@fgv/ts-sudoku-ui 5.1.0-2 → 5.1.0-21

package/lib-commonjs/utils/CageLookupManager.js

@@ -1,287 +0,0 @@
-"use strict";
-/*
- * MIT License
- *
- * Copyright (c) 2023 Erik Fortune
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in all
- * copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.CageLookupManager = exports.SegmentBit = void 0;
-/**
- * Segment bit positions for the 12-bit mask
- */
-var SegmentBit;
-(function (SegmentBit) {
-    // Edges (bits 0-3)
-    SegmentBit[SegmentBit["EDGE_TOP"] = 1] = "EDGE_TOP";
-    SegmentBit[SegmentBit["EDGE_RIGHT"] = 2] = "EDGE_RIGHT";
-    SegmentBit[SegmentBit["EDGE_BOTTOM"] = 4] = "EDGE_BOTTOM";
-    SegmentBit[SegmentBit["EDGE_LEFT"] = 8] = "EDGE_LEFT";
-    // Corner connectors (bits 4-7)
-    SegmentBit[SegmentBit["CORNER_TOP_RIGHT"] = 16] = "CORNER_TOP_RIGHT";
-    SegmentBit[SegmentBit["CORNER_BOTTOM_RIGHT"] = 32] = "CORNER_BOTTOM_RIGHT";
-    SegmentBit[SegmentBit["CORNER_BOTTOM_LEFT"] = 64] = "CORNER_BOTTOM_LEFT";
-    SegmentBit[SegmentBit["CORNER_TOP_LEFT"] = 128] = "CORNER_TOP_LEFT";
-    // Internal segments (bits 8-11)
-    SegmentBit[SegmentBit["INTERNAL_TOP"] = 256] = "INTERNAL_TOP";
-    SegmentBit[SegmentBit["INTERNAL_RIGHT"] = 512] = "INTERNAL_RIGHT";
-    SegmentBit[SegmentBit["INTERNAL_BOTTOM"] = 1024] = "INTERNAL_BOTTOM";
-    SegmentBit[SegmentBit["INTERNAL_LEFT"] = 2048] = "INTERNAL_LEFT";
-})(SegmentBit || (exports.SegmentBit = SegmentBit = {}));
-/**
- * Two-stage lookup manager for cage border rendering
- * Stage 1: 8-neighbor pattern → segment pattern ID (256 → 47)
- * Stage 2: segment pattern ID → SVG path data (47 unique patterns)
- */
-class CageLookupManager {
-    constructor() {
-        // Stage 1: Neighbor pattern (8-bit) to segment pattern ID mapping
-        this._neighborToSegmentLookup = new Array(256);
-        // Stage 2: Segment pattern ID to SVG path data mapping
-        this._segmentPatterns = [];
-        // Reverse lookup for debugging: segment mask to pattern ID
-        this._segmentMaskToId = new Map();
-        this._generateLookupTables();
-    }
-    /**
-     * Get singleton instance
-     */
-    static getInstance() {
-        if (!CageLookupManager._instance) {
-            CageLookupManager._instance = new CageLookupManager();
-        }
-        return CageLookupManager._instance;
-    }
-    /**
-     * Convert neighbor analysis to 8-bit pattern
-     */
-    neighborsToPattern(neighbors) {
-        // should be bitwise or but that makes eslint cranky
-        return ((neighbors.north ? 1 : 0) +
-            (neighbors.northEast ? 2 : 0) +
-            (neighbors.east ? 4 : 0) +
-            (neighbors.southEast ? 8 : 0) +
-            (neighbors.south ? 16 : 0) +
-            (neighbors.southWest ? 32 : 0) +
-            (neighbors.west ? 64 : 0) +
-            (neighbors.northWest ? 128 : 0));
-    }
-    /**
-     * Get SVG path data for a given neighbor pattern
-     */
-    getPatternSVG(neighborPattern) {
-        if (neighborPattern < 0 || neighborPattern >= 256) {
-            throw new Error(`Invalid neighbor pattern: ${neighborPattern}`);
-        }
-        const segmentPatternId = this._neighborToSegmentLookup[neighborPattern];
-        return this._segmentPatterns[segmentPatternId];
-    }
-    /**
-     * Get segment pattern ID for debugging
-     */
-    getSegmentPatternId(neighborPattern) {
-        return this._neighborToSegmentLookup[neighborPattern];
-    }
-    /**
-     * Get total number of unique segment patterns
-     */
-    get uniquePatternCount() {
-        return this._segmentPatterns.length;
-    }
-    /**
-     * Generate both lookup tables
-     */
-    _generateLookupTables() {
-        // First pass: generate all unique segment masks and assign IDs
-        const uniqueSegmentMasks = new Set();
-        for (let neighborPattern = 0; neighborPattern < 256; neighborPattern++) {
-            const segmentMask = this._calculateSegmentMask(neighborPattern);
-            uniqueSegmentMasks.add(segmentMask);
-        }
-        // Convert to sorted array for consistent ordering
-        const sortedSegmentMasks = Array.from(uniqueSegmentMasks).sort((a, b) => a - b);
-        // Generate SVG patterns for each unique segment mask
-        for (let i = 0; i < sortedSegmentMasks.length; i++) {
-            const segmentMask = sortedSegmentMasks[i];
-            this._segmentMaskToId.set(segmentMask, i);
-            this._segmentPatterns[i] = this._generateSVGPattern(segmentMask);
-        }
-        // Second pass: populate neighbor-to-segment lookup
-        for (let neighborPattern = 0; neighborPattern < 256; neighborPattern++) {
-            const segmentMask = this._calculateSegmentMask(neighborPattern);
-            const segmentPatternId = this._segmentMaskToId.get(segmentMask);
-            this._neighborToSegmentLookup[neighborPattern] = segmentPatternId;
-        }
-    }
-    /**
-     * Calculate segment mask from 8-bit neighbor pattern
-     */
-    _calculateSegmentMask(neighborPattern) {
-        // Extract individual neighbor bits
-        // eslint-disable-next-line no-bitwise
-        const n = Boolean(neighborPattern & 1); // North
-        // eslint-disable-next-line no-bitwise
-        const ne = Boolean(neighborPattern & 2); // NorthEast
-        // eslint-disable-next-line no-bitwise
-        const e = Boolean(neighborPattern & 4); // East
-        // eslint-disable-next-line no-bitwise
-        const se = Boolean(neighborPattern & 8); // SouthEast
-        // eslint-disable-next-line no-bitwise
-        const s = Boolean(neighborPattern & 16); // South
-        // eslint-disable-next-line no-bitwise
-        const sw = Boolean(neighborPattern & 32); // SouthWest
-        // eslint-disable-next-line no-bitwise
-        const w = Boolean(neighborPattern & 64); // West
-        // eslint-disable-next-line no-bitwise
-        const nw = Boolean(neighborPattern & 128); // NorthWest
-        let segmentMask = 0;
-        // Edges: Draw when corresponding cardinal neighbor is NOT present
-        // eslint-disable-next-line no-bitwise
-        if (!n)
-            segmentMask |= SegmentBit.EDGE_TOP;
-        // eslint-disable-next-line no-bitwise
-        if (!e)
-            segmentMask |= SegmentBit.EDGE_RIGHT;
-        // eslint-disable-next-line no-bitwise
-        if (!s)
-            segmentMask |= SegmentBit.EDGE_BOTTOM;
-        // eslint-disable-next-line no-bitwise
-        if (!w)
-            segmentMask |= SegmentBit.EDGE_LEFT;
-        // Internal segments: Draw when corresponding cardinal neighbor IS present
-        // eslint-disable-next-line no-bitwise
-        if (n)
-            segmentMask |= SegmentBit.INTERNAL_TOP;
-        // eslint-disable-next-line no-bitwise
-        if (e)
-            segmentMask |= SegmentBit.INTERNAL_RIGHT;
-        // eslint-disable-next-line no-bitwise
-        if (s)
-            segmentMask |= SegmentBit.INTERNAL_BOTTOM;
-        // eslint-disable-next-line no-bitwise
-        if (w)
-            segmentMask |= SegmentBit.INTERNAL_LEFT;
-        // Corner connectors: Draw when diagonal is missing but both adjacent cardinals are present
-        // eslint-disable-next-line no-bitwise
-        if (!ne && n && e)
-            segmentMask |= SegmentBit.CORNER_TOP_RIGHT;
-        // eslint-disable-next-line no-bitwise
-        if (!se && s && e)
-            segmentMask |= SegmentBit.CORNER_BOTTOM_RIGHT;
-        // eslint-disable-next-line no-bitwise
-        if (!sw && s && w)
-            segmentMask |= SegmentBit.CORNER_BOTTOM_LEFT;
-        // eslint-disable-next-line no-bitwise
-        if (!nw && n && w)
-            segmentMask |= SegmentBit.CORNER_TOP_LEFT;
-        return segmentMask;
-    }
-    /**
-     * Generate SVG path data for a segment mask
-     */
-    _generateSVGPattern(segmentMask) {
-        const paths = [];
-        const inset = 0.1; // Standard inset for cage boundaries
-        const edgeExtension = 0.0; // Extend to cell edge for connections
-        // Determine which segments have internal connections (need to extend to edge)
-        // eslint-disable-next-line no-bitwise
-        const hasInternalTop = Boolean(segmentMask & SegmentBit.INTERNAL_TOP);
-        // eslint-disable-next-line no-bitwise
-        const hasInternalRight = Boolean(segmentMask & SegmentBit.INTERNAL_RIGHT);
-        // eslint-disable-next-line no-bitwise
-        const hasInternalBottom = Boolean(segmentMask & SegmentBit.INTERNAL_BOTTOM);
-        // eslint-disable-next-line no-bitwise
-        const hasInternalLeft = Boolean(segmentMask & SegmentBit.INTERNAL_LEFT);
-        // Edge segments - draw main segment with standard inset, then extensions to edge where needed
-        // eslint-disable-next-line no-bitwise
-        if (segmentMask & SegmentBit.EDGE_TOP) {
-            // Main horizontal segment
-            paths.push(`M${inset},${inset} L${1 - inset},${inset}`);
-            // Extensions to cell edges where there are internal connections
-            if (hasInternalLeft) {
-                paths.push(`M${edgeExtension},${inset} L${inset},${inset}`);
-            }
-            if (hasInternalRight) {
-                paths.push(`M${1 - inset},${inset} L${1 - edgeExtension},${inset}`);
-            }
-        }
-        // eslint-disable-next-line no-bitwise
-        if (segmentMask & SegmentBit.EDGE_RIGHT) {
-            // Main vertical segment
-            paths.push(`M${1 - inset},${inset} L${1 - inset},${1 - inset}`);
-            // Extensions to cell edges where there are internal connections
-            if (hasInternalTop) {
-                paths.push(`M${1 - inset},${edgeExtension} L${1 - inset},${inset}`);
-            }
-            if (hasInternalBottom) {
-                paths.push(`M${1 - inset},${1 - inset} L${1 - inset},${1 - edgeExtension}`);
-            }
-        }
-        // eslint-disable-next-line no-bitwise
-        if (segmentMask & SegmentBit.EDGE_BOTTOM) {
-            // Main horizontal segment
-            paths.push(`M${1 - inset},${1 - inset} L${inset},${1 - inset}`);
-            // Extensions to cell edges where there are internal connections
-            if (hasInternalRight) {
-                paths.push(`M${1 - edgeExtension},${1 - inset} L${1 - inset},${1 - inset}`);
-            }
-            if (hasInternalLeft) {
-                paths.push(`M${inset},${1 - inset} L${edgeExtension},${1 - inset}`);
-            }
-        }
-        // eslint-disable-next-line no-bitwise
-        if (segmentMask & SegmentBit.EDGE_LEFT) {
-            // Main vertical segment
-            paths.push(`M${inset},${1 - inset} L${inset},${inset}`);
-            // Extensions to cell edges where there are internal connections
-            if (hasInternalBottom) {
-                paths.push(`M${inset},${1 - edgeExtension} L${inset},${1 - inset}`);
-            }
-            if (hasInternalTop) {
-                paths.push(`M${inset},${inset} L${inset},${edgeExtension}`);
-            }
-        }
-        // Corner connectors - extend outward from cage corners
-        const cornerRadius = 0.08;
-        // eslint-disable-next-line no-bitwise
-        if (segmentMask & SegmentBit.CORNER_TOP_RIGHT) {
-            // Extend outward from top-right corner
-            paths.push(`M${1 - inset},${inset} L${1 - inset + cornerRadius},${inset} M${1 - inset},${inset} L${1 - inset},${inset - cornerRadius}`);
-        }
-        // eslint-disable-next-line no-bitwise
-        if (segmentMask & SegmentBit.CORNER_BOTTOM_RIGHT) {
-            // Extend outward from bottom-right corner
-            paths.push(`M${1 - inset},${1 - inset} L${1 - inset + cornerRadius},${1 - inset} M${1 - inset},${1 - inset} L${1 - inset},${1 - inset + cornerRadius}`);
-        }
-        // eslint-disable-next-line no-bitwise
-        if (segmentMask & SegmentBit.CORNER_BOTTOM_LEFT) {
-            // Extend outward from bottom-left corner
-            paths.push(`M${inset},${1 - inset} L${inset - cornerRadius},${1 - inset} M${inset},${1 - inset} L${inset},${1 - inset + cornerRadius}`);
-        }
-        // eslint-disable-next-line no-bitwise
-        if (segmentMask & SegmentBit.CORNER_TOP_LEFT) {
-            // Extend outward from top-left corner
-            paths.push(`M${inset},${inset} L${inset - cornerRadius},${inset} M${inset},${inset} L${inset},${inset - cornerRadius}`);
-        }
-        return paths.join(' ');
-    }
-}
-exports.CageLookupManager = CageLookupManager;
-//# sourceMappingURL=CageLookupManager.js.map

package/lib-commonjs/utils/CageLookupManager.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"CageLookupManager.js","sourceRoot":"","sources":["../../src/utils/CageLookupManager.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;AAgBH;;GAEG;AACH,IAAY,UAkBX;AAlBD,WAAY,UAAU;IACpB,mBAAmB;IACnB,mDAAiB,CAAA;IACjB,uDAAmB,CAAA;IACnB,yDAAoB,CAAA;IACpB,qDAAkB,CAAA;IAElB,+BAA+B;IAC/B,oEAAyB,CAAA;IACzB,0EAA4B,CAAA;IAC5B,wEAA2B,CAAA;IAC3B,mEAAwB,CAAA;IAExB,gCAAgC;IAChC,6DAAqB,CAAA;IACrB,iEAAuB,CAAA;IACvB,oEAAyB,CAAA;IACzB,gEAAuB,CAAA;AACzB,CAAC,EAlBW,UAAU,0BAAV,UAAU,QAkBrB;AAED;;;;GAIG;AACH,MAAa,iBAAiB;IAY5B;QATA,kEAAkE;QACjD,6BAAwB,GAAa,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;QAErE,uDAAuD;QACtC,qBAAgB,GAAa,EAAE,CAAC;QAEjD,2DAA2D;QAC1C,qBAAgB,GAAwB,IAAI,GAAG,EAAkB,CAAC;QAGjF,IAAI,CAAC,qBAAqB,EAAE,CAAC;IAC/B,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,WAAW;QACvB,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,CAAC;YACjC,iBAAiB,CAAC,SAAS,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACxD,CAAC;QACD,OAAO,iBAAiB,CAAC,SAAS,CAAC;IACrC,CAAC;IAED;;OAEG;IACI,kBAAkB,CAAC,SAA4B;QACpD,oDAAoD;QACpD,OAAO,CACL,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9B,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAChC,CAAC;IACJ,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,eAAuB;QAC1C,IAAI,eAAe,GAAG,CAAC,IAAI,eAAe,IAAI,GAAG,EAAE,CAAC;YAClD,MAAM,IAAI,KAAK,CAAC,6BAA6B,eAAe,EAAE,CAAC,CAAC;QAClE,CAAC;QAED,MAAM,gBAAgB,GAAG,IAAI,CAAC,wBAAwB,CAAC,eAAe,CAAC,CAAC;QACxE,OAAO,IAAI,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACI,mBAAmB,CAAC,eAAuB;QAChD,OAAO,IAAI,CAAC,wBAAwB,CAAC,eAAe,CAAC,CAAC;IACxD,CAAC;IAED;;OAEG;IACH,IAAW,kBAAkB;QAC3B,OAAO,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC;IACtC,CAAC;IAED;;OAEG;IACK,qBAAqB;QAC3B,+DAA+D;QAC/D,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAU,CAAC;QAE7C,KAAK,IAAI,eAAe,GAAG,CAAC,EAAE,eAAe,GAAG,GAAG,EAAE,eAAe,EAAE,EAAE,CAAC;YACvE,MAAM,WAAW,GAAG,IAAI,CAAC,qBAAqB,CAAC,eAAe,CAAC,CAAC;YAChE,kBAAkB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACtC,CAAC;QAED,kDAAkD;QAClD,MAAM,kBAAkB,GAAG,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAEhF,qDAAqD;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,MAAM,WAAW,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YAC1C,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC;QACnE,CAAC;QAED,mDAAmD;QACnD,KAAK,IAAI,eAAe,GAAG,CAAC,EAAE,eAAe,GAAG,GAAG,EAAE,eAAe,EAAE,EAAE,CAAC;YACvE,MAAM,WAAW,GAAG,IAAI,CAAC,qBAAqB,CAAC,eAAe,CAAC,CAAC;YAChE,MAAM,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC;YACjE,IAAI,CAAC,wBAAwB,CAAC,eAAe,CAAC,GAAG,gBAAgB,CAAC;QACpE,CAAC;IACH,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,eAAuB;QACnD,mCAAmC;QACnC,sCAAsC;QACtC,MAAM,CAAC,GAAG,OAAO,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ;QAChD,sCAAsC;QACtC,MAAM,EAAE,GAAG,OAAO,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY;QACrD,sCAAsC;QACtC,MAAM,CAAC,GAAG,OAAO,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO;QAC/C,sCAAsC;QACtC,MAAM,EAAE,GAAG,OAAO,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY;QACrD,sCAAsC;QACtC,MAAM,CAAC,GAAG,OAAO,CAAC,eAAe,GAAG,EAAE,CAAC,CAAC,CAAC,QAAQ;QACjD,sCAAsC;QACtC,MAAM,EAAE,GAAG,OAAO,CAAC,eAAe,GAAG,EAAE,CAAC,CAAC,CAAC,YAAY;QACtD,sCAAsC;QACtC,MAAM,CAAC,GAAG,OAAO,CAAC,eAAe,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO;QAChD,sCAAsC;QACtC,MAAM,EAAE,GAAG,OAAO,CAAC,eAAe,GAAG,GAAG,CAAC,CAAC,CAAC,YAAY;QAEvD,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,kEAAkE;QAClE,sCAAsC;QACtC,IAAI,CAAC,CAAC;YAAE,WAAW,IAAI,UAAU,CAAC,QAAQ,CAAC;QAC3C,sCAAsC;QACtC,IAAI,CAAC,CAAC;YAAE,WAAW,IAAI,UAAU,CAAC,UAAU,CAAC;QAC7C,sCAAsC;QACtC,IAAI,CAAC,CAAC;YAAE,WAAW,IAAI,UAAU,CAAC,WAAW,CAAC;QAC9C,sCAAsC;QACtC,IAAI,CAAC,CAAC;YAAE,WAAW,IAAI,UAAU,CAAC,SAAS,CAAC;QAE5C,0EAA0E;QAC1E,sCAAsC;QACtC,IAAI,CAAC;YAAE,WAAW,IAAI,UAAU,CAAC,YAAY,CAAC;QAC9C,sCAAsC;QACtC,IAAI,CAAC;YAAE,WAAW,IAAI,UAAU,CAAC,cAAc,CAAC;QAChD,sCAAsC;QACtC,IAAI,CAAC;YAAE,WAAW,IAAI,UAAU,CAAC,eAAe,CAAC;QACjD,sCAAsC;QACtC,IAAI,CAAC;YAAE,WAAW,IAAI,UAAU,CAAC,aAAa,CAAC;QAE/C,2FAA2F;QAC3F,sCAAsC;QACtC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC;YAAE,WAAW,IAAI,UAAU,CAAC,gBAAgB,CAAC;QAC9D,sCAAsC;QACtC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC;YAAE,WAAW,IAAI,UAAU,CAAC,mBAAmB,CAAC;QACjE,sCAAsC;QACtC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC;YAAE,WAAW,IAAI,UAAU,CAAC,kBAAkB,CAAC;QAChE,sCAAsC;QACtC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC;YAAE,WAAW,IAAI,UAAU,CAAC,eAAe,CAAC;QAE7D,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,WAAmB;QAC7C,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,qCAAqC;QACxD,MAAM,aAAa,GAAG,GAAG,CAAC,CAAC,sCAAsC;QAEjE,8EAA8E;QAC9E,sCAAsC;QACtC,MAAM,cAAc,GAAG,OAAO,CAAC,WAAW,GAAG,UAAU,CAAC,YAAY,CAAC,CAAC;QACtE,sCAAsC;QACtC,MAAM,gBAAgB,GAAG,OAAO,CAAC,WAAW,GAAG,UAAU,CAAC,cAAc,CAAC,CAAC;QAC1E,sCAAsC;QACtC,MAAM,iBAAiB,GAAG,OAAO,CAAC,WAAW,GAAG,UAAU,CAAC,eAAe,CAAC,CAAC;QAC5E,sCAAsC;QACtC,MAAM,eAAe,GAAG,OAAO,CAAC,WAAW,GAAG,UAAU,CAAC,aAAa,CAAC,CAAC;QAExE,8FAA8F;QAC9F,sCAAsC;QACtC,IAAI,WAAW,GAAG,UAAU,CAAC,QAAQ,EAAE,CAAC;YACtC,0BAA0B;YAC1B,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,IAAI,KAAK,EAAE,CAAC,CAAC;YAExD,gEAAgE;YAChE,IAAI,eAAe,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,IAAI,aAAa,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,EAAE,CAAC,CAAC;YAC9D,CAAC;YACD,IAAI,gBAAgB,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,KAAK,KAAK,CAAC,GAAG,aAAa,IAAI,KAAK,EAAE,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,IAAI,WAAW,GAAG,UAAU,CAAC,UAAU,EAAE,CAAC;YACxC,wBAAwB;YACxB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YAEhE,gEAAgE;YAChE,IAAI,cAAc,EAAE,CAAC;gBACnB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,aAAa,KAAK,CAAC,GAAG,KAAK,IAAI,KAAK,EAAE,CAAC,CAAC;YACtE,CAAC;YACD,IAAI,iBAAiB,EAAE,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC,CAAC;YAC9E,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,IAAI,WAAW,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;YACzC,0BAA0B;YAC1B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YAEhE,gEAAgE;YAChE,IAAI,gBAAgB,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,aAAa,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YAC9E,CAAC;YACD,IAAI,eAAe,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,aAAa,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,IAAI,WAAW,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC;YACvC,wBAAwB;YACxB,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,KAAK,IAAI,KAAK,EAAE,CAAC,CAAC;YAExD,gEAAgE;YAChE,IAAI,iBAAiB,EAAE,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,GAAG,aAAa,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YACtE,CAAC;YACD,IAAI,cAAc,EAAE,CAAC;gBACnB,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,aAAa,EAAE,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;QAED,uDAAuD;QACvD,MAAM,YAAY,GAAG,IAAI,CAAC;QAC1B,sCAAsC;QACtC,IAAI,WAAW,GAAG,UAAU,CAAC,gBAAgB,EAAE,CAAC;YAC9C,uCAAuC;YACvC,KAAK,CAAC,IAAI,CACR,IAAI,CAAC,GAAG,KAAK,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,GAAG,YAAY,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,IAC/F,KAAK,GAAG,YACV,EAAE,CACH,CAAC;QACJ,CAAC;QACD,sCAAsC;QACtC,IAAI,WAAW,GAAG,UAAU,CAAC,mBAAmB,EAAE,CAAC;YACjD,0CAA0C;YAC1C,KAAK,CAAC,IAAI,CACR,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,KAAK,GAAG,YAAY,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,KAAK,KAC7F,CAAC,GAAG,KACN,IAAI,CAAC,GAAG,KAAK,GAAG,YAAY,EAAE,CAC/B,CAAC;QACJ,CAAC;QACD,sCAAsC;QACtC,IAAI,WAAW,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;YAChD,yCAAyC;YACzC,KAAK,CAAC,IAAI,CACR,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,KAAK,GAAG,YAAY,IAAI,CAAC,GAAG,KAAK,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,KAAK,IAC3F,CAAC,GAAG,KAAK,GAAG,YACd,EAAE,CACH,CAAC;QACJ,CAAC;QACD,sCAAsC;QACtC,IAAI,WAAW,GAAG,UAAU,CAAC,eAAe,EAAE,CAAC;YAC7C,sCAAsC;YACtC,KAAK,CAAC,IAAI,CACR,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,GAAG,YAAY,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,IAC/E,KAAK,GAAG,YACV,EAAE,CACH,CAAC;QACJ,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;CACF;AAhRD,8CAgRC","sourcesContent":["/*\n * MIT License\n *\n * Copyright (c) 2023 Erik Fortune\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport { INeighborAnalysis } from './CagePatternManager';\n\n/**\n * Represents a cage cell's segment requirements as a 12-bit mask\n */\nexport interface ISegmentMask {\n  /** 4 bits: Edges (Top, Right, Bottom, Left) */\n  edges: number;\n  /** 4 bits: Corner connectors (TR, BR, BL, TL) */\n  corners: number;\n  /** 4 bits: Internal segments (Top, Right, Bottom, Left) */\n  internals: number;\n}\n\n/**\n * Segment bit positions for the 12-bit mask\n */\nexport enum SegmentBit {\n  // Edges (bits 0-3)\n  EDGE_TOP = 1 << 0,\n  EDGE_RIGHT = 1 << 1,\n  EDGE_BOTTOM = 1 << 2,\n  EDGE_LEFT = 1 << 3,\n\n  // Corner connectors (bits 4-7)\n  CORNER_TOP_RIGHT = 1 << 4,\n  CORNER_BOTTOM_RIGHT = 1 << 5,\n  CORNER_BOTTOM_LEFT = 1 << 6,\n  CORNER_TOP_LEFT = 1 << 7,\n\n  // Internal segments (bits 8-11)\n  INTERNAL_TOP = 1 << 8,\n  INTERNAL_RIGHT = 1 << 9,\n  INTERNAL_BOTTOM = 1 << 10,\n  INTERNAL_LEFT = 1 << 11\n}\n\n/**\n * Two-stage lookup manager for cage border rendering\n * Stage 1: 8-neighbor pattern → segment pattern ID (256 → 47)\n * Stage 2: segment pattern ID → SVG path data (47 unique patterns)\n */\nexport class CageLookupManager {\n  private static _instance: CageLookupManager | undefined;\n\n  // Stage 1: Neighbor pattern (8-bit) to segment pattern ID mapping\n  private readonly _neighborToSegmentLookup: number[] = new Array(256);\n\n  // Stage 2: Segment pattern ID to SVG path data mapping\n  private readonly _segmentPatterns: string[] = [];\n\n  // Reverse lookup for debugging: segment mask to pattern ID\n  private readonly _segmentMaskToId: Map<number, number> = new Map<number, number>();\n\n  private constructor() {\n    this._generateLookupTables();\n  }\n\n  /**\n   * Get singleton instance\n   */\n  public static getInstance(): CageLookupManager {\n    if (!CageLookupManager._instance) {\n      CageLookupManager._instance = new CageLookupManager();\n    }\n    return CageLookupManager._instance;\n  }\n\n  /**\n   * Convert neighbor analysis to 8-bit pattern\n   */\n  public neighborsToPattern(neighbors: INeighborAnalysis): number {\n    // should be bitwise or but that makes eslint cranky\n    return (\n      (neighbors.north ? 1 : 0) +\n      (neighbors.northEast ? 2 : 0) +\n      (neighbors.east ? 4 : 0) +\n      (neighbors.southEast ? 8 : 0) +\n      (neighbors.south ? 16 : 0) +\n      (neighbors.southWest ? 32 : 0) +\n      (neighbors.west ? 64 : 0) +\n      (neighbors.northWest ? 128 : 0)\n    );\n  }\n\n  /**\n   * Get SVG path data for a given neighbor pattern\n   */\n  public getPatternSVG(neighborPattern: number): string {\n    if (neighborPattern < 0 || neighborPattern >= 256) {\n      throw new Error(`Invalid neighbor pattern: ${neighborPattern}`);\n    }\n\n    const segmentPatternId = this._neighborToSegmentLookup[neighborPattern];\n    return this._segmentPatterns[segmentPatternId];\n  }\n\n  /**\n   * Get segment pattern ID for debugging\n   */\n  public getSegmentPatternId(neighborPattern: number): number {\n    return this._neighborToSegmentLookup[neighborPattern];\n  }\n\n  /**\n   * Get total number of unique segment patterns\n   */\n  public get uniquePatternCount(): number {\n    return this._segmentPatterns.length;\n  }\n\n  /**\n   * Generate both lookup tables\n   */\n  private _generateLookupTables(): void {\n    // First pass: generate all unique segment masks and assign IDs\n    const uniqueSegmentMasks = new Set<number>();\n\n    for (let neighborPattern = 0; neighborPattern < 256; neighborPattern++) {\n      const segmentMask = this._calculateSegmentMask(neighborPattern);\n      uniqueSegmentMasks.add(segmentMask);\n    }\n\n    // Convert to sorted array for consistent ordering\n    const sortedSegmentMasks = Array.from(uniqueSegmentMasks).sort((a, b) => a - b);\n\n    // Generate SVG patterns for each unique segment mask\n    for (let i = 0; i < sortedSegmentMasks.length; i++) {\n      const segmentMask = sortedSegmentMasks[i];\n      this._segmentMaskToId.set(segmentMask, i);\n      this._segmentPatterns[i] = this._generateSVGPattern(segmentMask);\n    }\n\n    // Second pass: populate neighbor-to-segment lookup\n    for (let neighborPattern = 0; neighborPattern < 256; neighborPattern++) {\n      const segmentMask = this._calculateSegmentMask(neighborPattern);\n      const segmentPatternId = this._segmentMaskToId.get(segmentMask)!;\n      this._neighborToSegmentLookup[neighborPattern] = segmentPatternId;\n    }\n  }\n\n  /**\n   * Calculate segment mask from 8-bit neighbor pattern\n   */\n  private _calculateSegmentMask(neighborPattern: number): number {\n    // Extract individual neighbor bits\n    // eslint-disable-next-line no-bitwise\n    const n = Boolean(neighborPattern & 1); // North\n    // eslint-disable-next-line no-bitwise\n    const ne = Boolean(neighborPattern & 2); // NorthEast\n    // eslint-disable-next-line no-bitwise\n    const e = Boolean(neighborPattern & 4); // East\n    // eslint-disable-next-line no-bitwise\n    const se = Boolean(neighborPattern & 8); // SouthEast\n    // eslint-disable-next-line no-bitwise\n    const s = Boolean(neighborPattern & 16); // South\n    // eslint-disable-next-line no-bitwise\n    const sw = Boolean(neighborPattern & 32); // SouthWest\n    // eslint-disable-next-line no-bitwise\n    const w = Boolean(neighborPattern & 64); // West\n    // eslint-disable-next-line no-bitwise\n    const nw = Boolean(neighborPattern & 128); // NorthWest\n\n    let segmentMask = 0;\n\n    // Edges: Draw when corresponding cardinal neighbor is NOT present\n    // eslint-disable-next-line no-bitwise\n    if (!n) segmentMask |= SegmentBit.EDGE_TOP;\n    // eslint-disable-next-line no-bitwise\n    if (!e) segmentMask |= SegmentBit.EDGE_RIGHT;\n    // eslint-disable-next-line no-bitwise\n    if (!s) segmentMask |= SegmentBit.EDGE_BOTTOM;\n    // eslint-disable-next-line no-bitwise\n    if (!w) segmentMask |= SegmentBit.EDGE_LEFT;\n\n    // Internal segments: Draw when corresponding cardinal neighbor IS present\n    // eslint-disable-next-line no-bitwise\n    if (n) segmentMask |= SegmentBit.INTERNAL_TOP;\n    // eslint-disable-next-line no-bitwise\n    if (e) segmentMask |= SegmentBit.INTERNAL_RIGHT;\n    // eslint-disable-next-line no-bitwise\n    if (s) segmentMask |= SegmentBit.INTERNAL_BOTTOM;\n    // eslint-disable-next-line no-bitwise\n    if (w) segmentMask |= SegmentBit.INTERNAL_LEFT;\n\n    // Corner connectors: Draw when diagonal is missing but both adjacent cardinals are present\n    // eslint-disable-next-line no-bitwise\n    if (!ne && n && e) segmentMask |= SegmentBit.CORNER_TOP_RIGHT;\n    // eslint-disable-next-line no-bitwise\n    if (!se && s && e) segmentMask |= SegmentBit.CORNER_BOTTOM_RIGHT;\n    // eslint-disable-next-line no-bitwise\n    if (!sw && s && w) segmentMask |= SegmentBit.CORNER_BOTTOM_LEFT;\n    // eslint-disable-next-line no-bitwise\n    if (!nw && n && w) segmentMask |= SegmentBit.CORNER_TOP_LEFT;\n\n    return segmentMask;\n  }\n\n  /**\n   * Generate SVG path data for a segment mask\n   */\n  private _generateSVGPattern(segmentMask: number): string {\n    const paths: string[] = [];\n    const inset = 0.1; // Standard inset for cage boundaries\n    const edgeExtension = 0.0; // Extend to cell edge for connections\n\n    // Determine which segments have internal connections (need to extend to edge)\n    // eslint-disable-next-line no-bitwise\n    const hasInternalTop = Boolean(segmentMask & SegmentBit.INTERNAL_TOP);\n    // eslint-disable-next-line no-bitwise\n    const hasInternalRight = Boolean(segmentMask & SegmentBit.INTERNAL_RIGHT);\n    // eslint-disable-next-line no-bitwise\n    const hasInternalBottom = Boolean(segmentMask & SegmentBit.INTERNAL_BOTTOM);\n    // eslint-disable-next-line no-bitwise\n    const hasInternalLeft = Boolean(segmentMask & SegmentBit.INTERNAL_LEFT);\n\n    // Edge segments - draw main segment with standard inset, then extensions to edge where needed\n    // eslint-disable-next-line no-bitwise\n    if (segmentMask & SegmentBit.EDGE_TOP) {\n      // Main horizontal segment\n      paths.push(`M${inset},${inset} L${1 - inset},${inset}`);\n\n      // Extensions to cell edges where there are internal connections\n      if (hasInternalLeft) {\n        paths.push(`M${edgeExtension},${inset} L${inset},${inset}`);\n      }\n      if (hasInternalRight) {\n        paths.push(`M${1 - inset},${inset} L${1 - edgeExtension},${inset}`);\n      }\n    }\n\n    // eslint-disable-next-line no-bitwise\n    if (segmentMask & SegmentBit.EDGE_RIGHT) {\n      // Main vertical segment\n      paths.push(`M${1 - inset},${inset} L${1 - inset},${1 - inset}`);\n\n      // Extensions to cell edges where there are internal connections\n      if (hasInternalTop) {\n        paths.push(`M${1 - inset},${edgeExtension} L${1 - inset},${inset}`);\n      }\n      if (hasInternalBottom) {\n        paths.push(`M${1 - inset},${1 - inset} L${1 - inset},${1 - edgeExtension}`);\n      }\n    }\n\n    // eslint-disable-next-line no-bitwise\n    if (segmentMask & SegmentBit.EDGE_BOTTOM) {\n      // Main horizontal segment\n      paths.push(`M${1 - inset},${1 - inset} L${inset},${1 - inset}`);\n\n      // Extensions to cell edges where there are internal connections\n      if (hasInternalRight) {\n        paths.push(`M${1 - edgeExtension},${1 - inset} L${1 - inset},${1 - inset}`);\n      }\n      if (hasInternalLeft) {\n        paths.push(`M${inset},${1 - inset} L${edgeExtension},${1 - inset}`);\n      }\n    }\n\n    // eslint-disable-next-line no-bitwise\n    if (segmentMask & SegmentBit.EDGE_LEFT) {\n      // Main vertical segment\n      paths.push(`M${inset},${1 - inset} L${inset},${inset}`);\n\n      // Extensions to cell edges where there are internal connections\n      if (hasInternalBottom) {\n        paths.push(`M${inset},${1 - edgeExtension} L${inset},${1 - inset}`);\n      }\n      if (hasInternalTop) {\n        paths.push(`M${inset},${inset} L${inset},${edgeExtension}`);\n      }\n    }\n\n    // Corner connectors - extend outward from cage corners\n    const cornerRadius = 0.08;\n    // eslint-disable-next-line no-bitwise\n    if (segmentMask & SegmentBit.CORNER_TOP_RIGHT) {\n      // Extend outward from top-right corner\n      paths.push(\n        `M${1 - inset},${inset} L${1 - inset + cornerRadius},${inset} M${1 - inset},${inset} L${1 - inset},${\n          inset - cornerRadius\n        }`\n      );\n    }\n    // eslint-disable-next-line no-bitwise\n    if (segmentMask & SegmentBit.CORNER_BOTTOM_RIGHT) {\n      // Extend outward from bottom-right corner\n      paths.push(\n        `M${1 - inset},${1 - inset} L${1 - inset + cornerRadius},${1 - inset} M${1 - inset},${1 - inset} L${\n          1 - inset\n        },${1 - inset + cornerRadius}`\n      );\n    }\n    // eslint-disable-next-line no-bitwise\n    if (segmentMask & SegmentBit.CORNER_BOTTOM_LEFT) {\n      // Extend outward from bottom-left corner\n      paths.push(\n        `M${inset},${1 - inset} L${inset - cornerRadius},${1 - inset} M${inset},${1 - inset} L${inset},${\n          1 - inset + cornerRadius\n        }`\n      );\n    }\n    // eslint-disable-next-line no-bitwise\n    if (segmentMask & SegmentBit.CORNER_TOP_LEFT) {\n      // Extend outward from top-left corner\n      paths.push(\n        `M${inset},${inset} L${inset - cornerRadius},${inset} M${inset},${inset} L${inset},${\n          inset - cornerRadius\n        }`\n      );\n    }\n\n    return paths.join(' ');\n  }\n}\n"]}

package/lib-commonjs/utils/CagePatternManager.js

@@ -1,143 +0,0 @@
-"use strict";
-/*
- * MIT License
- *
- * Copyright (c) 2023 Erik Fortune
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in all
- * copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.CagePatternManager = void 0;
-const ts_sudoku_lib_1 = require("@fgv/ts-sudoku-lib");
-/**
- * Direction vectors for 8-directional neighbor analysis
- */
-const NEIGHBOR_DIRECTIONS = [
-    { dx: 0, dy: -1, name: 'north' }, // N
-    { dx: 1, dy: -1, name: 'northEast' }, // NE
-    { dx: 1, dy: 0, name: 'east' }, // E
-    { dx: 1, dy: 1, name: 'southEast' }, // SE
-    { dx: 0, dy: 1, name: 'south' }, // S
-    { dx: -1, dy: 1, name: 'southWest' }, // SW
-    { dx: -1, dy: 0, name: 'west' }, // W
-    { dx: -1, dy: -1, name: 'northWest' } // NW
-];
-/**
- * Manages cage border patterns using compositional approach
- * Analyzes 8-directional neighbors and generates appropriate border patterns
- */
-class CagePatternManager {
-    /**
-     * Convert CellId to grid position
-     */
-    _getCellPosition(cellId) {
-        const parsed = (0, ts_sudoku_lib_1.parseCellId)(cellId);
-        if (parsed) {
-            return parsed;
-        }
-        console.warn(`Invalid CellId format: ${cellId}`);
-        return { row: 0, col: 0 };
-    }
-    /**
-     * Analyze neighbors in 8 directions to determine which cells are part of the cage
-     */
-    analyzeNeighbors(cellId, occupiedCells) {
-        const { row, col } = this._getCellPosition(cellId);
-        const analysis = {};
-        for (const direction of NEIGHBOR_DIRECTIONS) {
-            const neighborRow = row + direction.dy;
-            const neighborCol = col + direction.dx;
-            const neighborKey = `${neighborRow},${neighborCol}`;
-            analysis[direction.name] = occupiedCells.has(neighborKey);
-        }
-        return analysis;
-    }
-    /**
-     * Generate edge pattern based on cardinal direction neighbors
-     * Edges are drawn where there is NO neighbor (external boundary)
-     */
-    generateEdgePattern(neighbors) {
-        return {
-            top: !neighbors.north,
-            right: !neighbors.east,
-            bottom: !neighbors.south,
-            left: !neighbors.west
-        };
-    }
-    /**
-     * Generate corner pattern based on diagonal neighbors and adjacent edges
-     * Corners are drawn where diagonal neighbor is missing AND both adjacent edges exist
-     */
-    generateCornerPattern(neighbors, edges) {
-        return {
-            // Top-right corner: draw if NE neighbor is missing AND both top and right edges exist
-            topRight: !neighbors.northEast && edges.top && edges.right,
-            // Bottom-right corner: draw if SE neighbor is missing AND both bottom and right edges exist
-            bottomRight: !neighbors.southEast && edges.bottom && edges.right,
-            // Bottom-left corner: draw if SW neighbor is missing AND both bottom and left edges exist
-            bottomLeft: !neighbors.southWest && edges.bottom && edges.left,
-            // Top-left corner: draw if NW neighbor is missing AND both top and left edges exist
-            topLeft: !neighbors.northWest && edges.top && edges.left
-        };
-    }
-    /**
-     * Convert edge pattern to numeric ID (0-15)
-     */
-    getEdgeId(edges) {
-        // should be bitwise or but that makes eslint cranky
-        return (edges.top ? 1 : 0) + (edges.right ? 2 : 0) + (edges.bottom ? 4 : 0) + (edges.left ? 8 : 0);
-    }
-    /**
-     * Convert corner pattern to numeric ID (0-15)
-     */
-    getCornerId(corners) {
-        // should be bitwise or but that makes eslint cranky
-        return ((corners.topRight ? 1 : 0) +
-            (corners.bottomRight ? 2 : 0) +
-            (corners.bottomLeft ? 4 : 0) +
-            (corners.topLeft ? 8 : 0));
-    }
-    /**
-     * Generate complete pattern specification for a cell
-     */
-    getPatternForCell(cellId, occupiedCells) {
-        const neighbors = this.analyzeNeighbors(cellId, occupiedCells);
-        const edges = this.generateEdgePattern(neighbors);
-        const corners = this.generateCornerPattern(neighbors, edges);
-        return {
-            edges,
-            corners,
-            edgeId: this.getEdgeId(edges),
-            cornerId: this.getCornerId(corners)
-        };
-    }
-    /**
-     * Build occupied cells set from cell IDs
-     */
-    buildOccupiedCellsSet(cellIds) {
-        const occupiedCells = new Set();
-        for (const cellId of cellIds) {
-            const position = this._getCellPosition(cellId);
-            occupiedCells.add(`${position.row},${position.col}`);
-        }
-        return occupiedCells;
-    }
-}
-exports.CagePatternManager = CagePatternManager;
-//# sourceMappingURL=CagePatternManager.js.map

package/lib-commonjs/utils/CagePatternManager.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"CagePatternManager.js","sourceRoot":"","sources":["../../src/utils/CagePatternManager.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;AAEH,sDAAyD;AAgDzD;;GAEG;AACH,MAAM,mBAAmB,GAAG;IAC1B,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,IAAI;IACtC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE,KAAK;IAC3C,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,IAAI;IACpC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE,KAAK;IAC1C,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,IAAI;IACrC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE,KAAK;IAC3C,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,IAAI;IACrC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,KAAK;CACnC,CAAC;AAEX;;;GAGG;AACH,MAAa,kBAAkB;IAC7B;;OAEG;IACK,gBAAgB,CAAC,MAAc;QACrC,MAAM,MAAM,GAAG,IAAA,2BAAW,EAAC,MAAM,CAAC,CAAC;QACnC,IAAI,MAAM,EAAE,CAAC;YACX,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,0BAA0B,MAAM,EAAE,CAAC,CAAC;QACjD,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACI,gBAAgB,CAAC,MAAc,EAAE,aAA0B;QAChE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,QAAQ,GAA+B,EAAE,CAAC;QAEhD,KAAK,MAAM,SAAS,IAAI,mBAAmB,EAAE,CAAC;YAC5C,MAAM,WAAW,GAAG,GAAG,GAAG,SAAS,CAAC,EAAE,CAAC;YACvC,MAAM,WAAW,GAAG,GAAG,GAAG,SAAS,CAAC,EAAE,CAAC;YACvC,MAAM,WAAW,GAAG,GAAG,WAAW,IAAI,WAAW,EAAE,CAAC;YAEpD,QAAQ,CAAC,SAAS,CAAC,IAA+B,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACvF,CAAC;QAED,OAAO,QAA6B,CAAC;IACvC,CAAC;IAED;;;OAGG;IACI,mBAAmB,CAAC,SAA4B;QACrD,OAAO;YACL,GAAG,EAAE,CAAC,SAAS,CAAC,KAAK;YACrB,KAAK,EAAE,CAAC,SAAS,CAAC,IAAI;YACtB,MAAM,EAAE,CAAC,SAAS,CAAC,KAAK;YACxB,IAAI,EAAE,CAAC,SAAS,CAAC,IAAI;SACtB,CAAC;IACJ,CAAC;IAED;;;OAGG;IACI,qBAAqB,CAAC,SAA4B,EAAE,KAAmB;QAC5E,OAAO;YACL,sFAAsF;YACtF,QAAQ,EAAE,CAAC,SAAS,CAAC,SAAS,IAAI,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK;YAE1D,4FAA4F;YAC5F,WAAW,EAAE,CAAC,SAAS,CAAC,SAAS,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK;YAEhE,0FAA0F;YAC1F,UAAU,EAAE,CAAC,SAAS,CAAC,SAAS,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,IAAI;YAE9D,oFAAoF;YACpF,OAAO,EAAE,CAAC,SAAS,CAAC,SAAS,IAAI,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,IAAI;SACzD,CAAC;IACJ,CAAC;IAED;;OAEG;IACI,SAAS,CAAC,KAAmB;QAClC,oDAAoD;QACpD,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrG,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,OAAuB;QACxC,oDAAoD;QACpD,OAAO,CACL,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC1B,CAAC;IACJ,CAAC;IAED;;OAEG;IACI,iBAAiB,CAAC,MAAc,EAAE,aAA0B;QACjE,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;QAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QAClD,MAAM,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAE7D,OAAO;YACL,KAAK;YACL,OAAO;YACP,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;YAC7B,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC;SACpC,CAAC;IACJ,CAAC;IAED;;OAEG;IACI,qBAAqB,CAAC,OAAiB;QAC5C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QAExC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;YAC/C,aAAa,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,GAAG,IAAI,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;QACvD,CAAC;QAED,OAAO,aAAa,CAAC;IACvB,CAAC;CACF;AAnHD,gDAmHC","sourcesContent":["/*\n * MIT License\n *\n * Copyright (c) 2023 Erik Fortune\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport { CellId, parseCellId } from '@fgv/ts-sudoku-lib';\n\n/**\n * Represents the neighbor analysis for a cell in 8 directions\n */\nexport interface INeighborAnalysis {\n  // Cardinal directions\n  north: boolean;\n  east: boolean;\n  south: boolean;\n  west: boolean;\n  // Diagonal directions\n  northEast: boolean;\n  southEast: boolean;\n  southWest: boolean;\n  northWest: boolean;\n}\n\n/**\n * Represents edge pattern requirements\n */\nexport interface IEdgePattern {\n  top: boolean;\n  right: boolean;\n  bottom: boolean;\n  left: boolean;\n}\n\n/**\n * Represents corner pattern requirements\n */\nexport interface ICornerPattern {\n  topRight: boolean;\n  bottomRight: boolean;\n  bottomLeft: boolean;\n  topLeft: boolean;\n}\n\n/**\n * Complete pattern specification for a cell\n */\nexport interface ICellPattern {\n  edges: IEdgePattern;\n  corners: ICornerPattern;\n  edgeId: number;\n  cornerId: number;\n}\n\n/**\n * Direction vectors for 8-directional neighbor analysis\n */\nconst NEIGHBOR_DIRECTIONS = [\n  { dx: 0, dy: -1, name: 'north' }, // N\n  { dx: 1, dy: -1, name: 'northEast' }, // NE\n  { dx: 1, dy: 0, name: 'east' }, // E\n  { dx: 1, dy: 1, name: 'southEast' }, // SE\n  { dx: 0, dy: 1, name: 'south' }, // S\n  { dx: -1, dy: 1, name: 'southWest' }, // SW\n  { dx: -1, dy: 0, name: 'west' }, // W\n  { dx: -1, dy: -1, name: 'northWest' } // NW\n] as const;\n\n/**\n * Manages cage border patterns using compositional approach\n * Analyzes 8-directional neighbors and generates appropriate border patterns\n */\nexport class CagePatternManager {\n  /**\n   * Convert CellId to grid position\n   */\n  private _getCellPosition(cellId: CellId): { row: number; col: number } {\n    const parsed = parseCellId(cellId);\n    if (parsed) {\n      return parsed;\n    }\n\n    console.warn(`Invalid CellId format: ${cellId}`);\n    return { row: 0, col: 0 };\n  }\n\n  /**\n   * Analyze neighbors in 8 directions to determine which cells are part of the cage\n   */\n  public analyzeNeighbors(cellId: CellId, occupiedCells: Set<string>): INeighborAnalysis {\n    const { row, col } = this._getCellPosition(cellId);\n    const analysis: Partial<INeighborAnalysis> = {};\n\n    for (const direction of NEIGHBOR_DIRECTIONS) {\n      const neighborRow = row + direction.dy;\n      const neighborCol = col + direction.dx;\n      const neighborKey = `${neighborRow},${neighborCol}`;\n\n      analysis[direction.name as keyof INeighborAnalysis] = occupiedCells.has(neighborKey);\n    }\n\n    return analysis as INeighborAnalysis;\n  }\n\n  /**\n   * Generate edge pattern based on cardinal direction neighbors\n   * Edges are drawn where there is NO neighbor (external boundary)\n   */\n  public generateEdgePattern(neighbors: INeighborAnalysis): IEdgePattern {\n    return {\n      top: !neighbors.north,\n      right: !neighbors.east,\n      bottom: !neighbors.south,\n      left: !neighbors.west\n    };\n  }\n\n  /**\n   * Generate corner pattern based on diagonal neighbors and adjacent edges\n   * Corners are drawn where diagonal neighbor is missing AND both adjacent edges exist\n   */\n  public generateCornerPattern(neighbors: INeighborAnalysis, edges: IEdgePattern): ICornerPattern {\n    return {\n      // Top-right corner: draw if NE neighbor is missing AND both top and right edges exist\n      topRight: !neighbors.northEast && edges.top && edges.right,\n\n      // Bottom-right corner: draw if SE neighbor is missing AND both bottom and right edges exist\n      bottomRight: !neighbors.southEast && edges.bottom && edges.right,\n\n      // Bottom-left corner: draw if SW neighbor is missing AND both bottom and left edges exist\n      bottomLeft: !neighbors.southWest && edges.bottom && edges.left,\n\n      // Top-left corner: draw if NW neighbor is missing AND both top and left edges exist\n      topLeft: !neighbors.northWest && edges.top && edges.left\n    };\n  }\n\n  /**\n   * Convert edge pattern to numeric ID (0-15)\n   */\n  public getEdgeId(edges: IEdgePattern): number {\n    // should be bitwise or but that makes eslint cranky\n    return (edges.top ? 1 : 0) + (edges.right ? 2 : 0) + (edges.bottom ? 4 : 0) + (edges.left ? 8 : 0);\n  }\n\n  /**\n   * Convert corner pattern to numeric ID (0-15)\n   */\n  public getCornerId(corners: ICornerPattern): number {\n    // should be bitwise or but that makes eslint cranky\n    return (\n      (corners.topRight ? 1 : 0) +\n      (corners.bottomRight ? 2 : 0) +\n      (corners.bottomLeft ? 4 : 0) +\n      (corners.topLeft ? 8 : 0)\n    );\n  }\n\n  /**\n   * Generate complete pattern specification for a cell\n   */\n  public getPatternForCell(cellId: CellId, occupiedCells: Set<string>): ICellPattern {\n    const neighbors = this.analyzeNeighbors(cellId, occupiedCells);\n    const edges = this.generateEdgePattern(neighbors);\n    const corners = this.generateCornerPattern(neighbors, edges);\n\n    return {\n      edges,\n      corners,\n      edgeId: this.getEdgeId(edges),\n      cornerId: this.getCornerId(corners)\n    };\n  }\n\n  /**\n   * Build occupied cells set from cell IDs\n   */\n  public buildOccupiedCellsSet(cellIds: CellId[]): Set<string> {\n    const occupiedCells = new Set<string>();\n\n    for (const cellId of cellIds) {\n      const position = this._getCellPosition(cellId);\n      occupiedCells.add(`${position.row},${position.col}`);\n    }\n\n    return occupiedCells;\n  }\n}\n"]}

package/lib-commonjs/utils/puzzleDefinitionHelper.js

@@ -1,103 +0,0 @@
-"use strict";
-/*
- * MIT License
- *
- * Copyright (c) 2023 Erik Fortune
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in all
- * copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.createPuzzleDefinition = createPuzzleDefinition;
-exports.createEmptyPuzzleDefinition = createEmptyPuzzleDefinition;
-/**
- * Helper to create a complete IPuzzleDefinition from simple parameters
- * @public
- */
-function createPuzzleDefinition(simple) {
-    const { totalRows, totalColumns } = simple;
-    // Determine cage dimensions based on grid size
-    let cageWidth, cageHeight;
-    if (totalRows === 4 && totalColumns === 4) {
-        cageWidth = 2;
-        cageHeight = 2;
-    }
-    else if (totalRows === 6 && totalColumns === 6) {
-        cageWidth = 3;
-        cageHeight = 2;
-    }
-    else if (totalRows === 9 && totalColumns === 9) {
-        cageWidth = 3;
-        cageHeight = 3;
-    }
-    else if (totalRows === 12 && totalColumns === 12) {
-        cageWidth = 4;
-        cageHeight = 3;
-    }
-    else if (totalRows === 16 && totalColumns === 16) {
-        cageWidth = 4;
-        cageHeight = 4;
-    }
-    else if (totalRows === 25 && totalColumns === 25) {
-        cageWidth = 5;
-        cageHeight = 5;
-    }
-    else {
-        // Default to square cages
-        const size = Math.sqrt(totalRows);
-        cageWidth = Math.floor(size);
-        cageHeight = Math.floor(size);
-    }
-    const boardWidthInCages = totalColumns / cageWidth;
-    const boardHeightInCages = totalRows / cageHeight;
-    const maxValue = cageWidth * cageHeight;
-    const totalCages = boardWidthInCages * boardHeightInCages;
-    const basicCageTotal = (maxValue * (maxValue + 1)) / 2;
-    return {
-        id: simple.id,
-        description: simple.description,
-        type: simple.type,
-        level: simple.level,
-        totalRows,
-        totalColumns,
-        cells: simple.cells,
-        cageWidthInCells: cageWidth,
-        cageHeightInCells: cageHeight,
-        boardWidthInCages,
-        boardHeightInCages,
-        maxValue,
-        totalCages,
-        basicCageTotal
-    };
-}
-/**
- * Helper to create an empty puzzle definition
- * @public
- */
-function createEmptyPuzzleDefinition(rows = 9, columns = 9, type = 'sudoku') {
-    return createPuzzleDefinition({
-        id: 'manual-entry',
-        description: 'Manual Entry Puzzle',
-        type,
-        level: 1,
-        totalRows: rows,
-        totalColumns: columns,
-        cells: '.'.repeat(rows * columns)
-    });
-}
-//# sourceMappingURL=puzzleDefinitionHelper.js.map

package/lib-commonjs/utils/puzzleDefinitionHelper.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"puzzleDefinitionHelper.js","sourceRoot":"","sources":["../../src/utils/puzzleDefinitionHelper.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;AAsBH,wDAqDC;AAMD,kEAcC;AA7ED;;;GAGG;AACH,SAAgB,sBAAsB,CAAC,MAAgC;IACrE,MAAM,EAAE,SAAS,EAAE,YAAY,EAAE,GAAG,MAAM,CAAC;IAE3C,+CAA+C;IAC/C,IAAI,SAAiB,EAAE,UAAkB,CAAC;IAE1C,IAAI,SAAS,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QAC1C,SAAS,GAAG,CAAC,CAAC;QACd,UAAU,GAAG,CAAC,CAAC;IACjB,CAAC;SAAM,IAAI,SAAS,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QACjD,SAAS,GAAG,CAAC,CAAC;QACd,UAAU,GAAG,CAAC,CAAC;IACjB,CAAC;SAAM,IAAI,SAAS,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QACjD,SAAS,GAAG,CAAC,CAAC;QACd,UAAU,GAAG,CAAC,CAAC;IACjB,CAAC;SAAM,IAAI,SAAS,KAAK,EAAE,IAAI,YAAY,KAAK,EAAE,EAAE,CAAC;QACnD,SAAS,GAAG,CAAC,CAAC;QACd,UAAU,GAAG,CAAC,CAAC;IACjB,CAAC;SAAM,IAAI,SAAS,KAAK,EAAE,IAAI,YAAY,KAAK,EAAE,EAAE,CAAC;QACnD,SAAS,GAAG,CAAC,CAAC;QACd,UAAU,GAAG,CAAC,CAAC;IACjB,CAAC;SAAM,IAAI,SAAS,KAAK,EAAE,IAAI,YAAY,KAAK,EAAE,EAAE,CAAC;QACnD,SAAS,GAAG,CAAC,CAAC;QACd,UAAU,GAAG,CAAC,CAAC;IACjB,CAAC;SAAM,CAAC;QACN,0BAA0B;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAClC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC7B,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,iBAAiB,GAAG,YAAY,GAAG,SAAS,CAAC;IACnD,MAAM,kBAAkB,GAAG,SAAS,GAAG,UAAU,CAAC;IAClD,MAAM,QAAQ,GAAG,SAAS,GAAG,UAAU,CAAC;IACxC,MAAM,UAAU,GAAG,iBAAiB,GAAG,kBAAkB,CAAC;IAC1D,MAAM,cAAc,GAAG,CAAC,QAAQ,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEvD,OAAO;QACL,EAAE,EAAE,MAAM,CAAC,EAAE;QACb,WAAW,EAAE,MAAM,CAAC,WAAW;QAC/B,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,SAAS;QACT,YAAY;QACZ,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,gBAAgB,EAAE,SAAS;QAC3B,iBAAiB,EAAE,UAAU;QAC7B,iBAAiB;QACjB,kBAAkB;QAClB,QAAQ;QACR,UAAU;QACV,cAAc;KACf,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAgB,2BAA2B,CACzC,OAAe,CAAC,EAChB,UAAkB,CAAC,EACnB,OAAmB,QAAQ;IAE3B,OAAO,sBAAsB,CAAC;QAC5B,EAAE,EAAE,cAAc;QAClB,WAAW,EAAE,qBAAqB;QAClC,IAAI;QACJ,KAAK,EAAE,CAAC;QACR,SAAS,EAAE,IAAI;QACf,YAAY,EAAE,OAAO;QACrB,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC;KAClC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/*\n * MIT License\n *\n * Copyright (c) 2023 Erik Fortune\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport { IPuzzleDefinition, PuzzleType } from '@fgv/ts-sudoku-lib';\n\n/**\n * Simple puzzle definition for UI usage\n * @public\n */\nexport interface ISimplePuzzleDescription {\n  readonly id?: string;\n  readonly description: string;\n  readonly type: PuzzleType;\n  readonly level: number;\n  readonly totalRows: number;\n  readonly totalColumns: number;\n  readonly cells: string;\n}\n\n/**\n * Helper to create a complete IPuzzleDefinition from simple parameters\n * @public\n */\nexport function createPuzzleDefinition(simple: ISimplePuzzleDescription): IPuzzleDefinition {\n  const { totalRows, totalColumns } = simple;\n\n  // Determine cage dimensions based on grid size\n  let cageWidth: number, cageHeight: number;\n\n  if (totalRows === 4 && totalColumns === 4) {\n    cageWidth = 2;\n    cageHeight = 2;\n  } else if (totalRows === 6 && totalColumns === 6) {\n    cageWidth = 3;\n    cageHeight = 2;\n  } else if (totalRows === 9 && totalColumns === 9) {\n    cageWidth = 3;\n    cageHeight = 3;\n  } else if (totalRows === 12 && totalColumns === 12) {\n    cageWidth = 4;\n    cageHeight = 3;\n  } else if (totalRows === 16 && totalColumns === 16) {\n    cageWidth = 4;\n    cageHeight = 4;\n  } else if (totalRows === 25 && totalColumns === 25) {\n    cageWidth = 5;\n    cageHeight = 5;\n  } else {\n    // Default to square cages\n    const size = Math.sqrt(totalRows);\n    cageWidth = Math.floor(size);\n    cageHeight = Math.floor(size);\n  }\n\n  const boardWidthInCages = totalColumns / cageWidth;\n  const boardHeightInCages = totalRows / cageHeight;\n  const maxValue = cageWidth * cageHeight;\n  const totalCages = boardWidthInCages * boardHeightInCages;\n  const basicCageTotal = (maxValue * (maxValue + 1)) / 2;\n\n  return {\n    id: simple.id,\n    description: simple.description,\n    type: simple.type,\n    level: simple.level,\n    totalRows,\n    totalColumns,\n    cells: simple.cells,\n    cageWidthInCells: cageWidth,\n    cageHeightInCells: cageHeight,\n    boardWidthInCages,\n    boardHeightInCages,\n    maxValue,\n    totalCages,\n    basicCageTotal\n  };\n}\n\n/**\n * Helper to create an empty puzzle definition\n * @public\n */\nexport function createEmptyPuzzleDefinition(\n  rows: number = 9,\n  columns: number = 9,\n  type: PuzzleType = 'sudoku'\n): IPuzzleDefinition {\n  return createPuzzleDefinition({\n    id: 'manual-entry',\n    description: 'Manual Entry Puzzle',\n    type,\n    level: 1,\n    totalRows: rows,\n    totalColumns: columns,\n    cells: '.'.repeat(rows * columns)\n  });\n}\n"]}