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

package/lib-commonjs/hooks/usePuzzleSession.js

@@ -1,401 +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.usePuzzleSession = usePuzzleSession;
-const react_1 = require("react");
-const ts_sudoku_lib_1 = require("@fgv/ts-sudoku-lib");
-const puzzleDefinitionHelper_1 = require("../utils/puzzleDefinitionHelper");
-/**
- * Hook for managing puzzle session state and operations
- * @public
- */
-function usePuzzleSession(initialPuzzleDescription) {
-    const [session, setSession] = (0, react_1.useState)(null);
-    const [puzzleDescription, setPuzzleDescription] = (0, react_1.useState)(null);
-    const [selectedCell, setSelectedCell] = (0, react_1.useState)(null);
-    const [selectedCells, setSelectedCells] = (0, react_1.useState)([]);
-    const [inputMode, setInputMode] = (0, react_1.useState)('notes'); // Notes-first paradigm
-    const [error, setError] = (0, react_1.useState)(null);
-    const [updateCounter, setUpdateCounter] = (0, react_1.useState)(0); // Force re-renders
-    // Initialize or update puzzle session
-    (0, react_1.useEffect)(() => {
-        // Use the provided description or create a default empty 9x9 puzzle
-        const puzzleDescriptor = initialPuzzleDescription || (0, puzzleDefinitionHelper_1.createEmptyPuzzleDefinition)();
-        const sessionResult = ts_sudoku_lib_1.Puzzles.Any.create(puzzleDescriptor).onSuccess((puzzle) => ts_sudoku_lib_1.PuzzleSession.create(puzzle));
-        if (sessionResult.isSuccess()) {
-            setSession(sessionResult.value);
-            setPuzzleDescription(puzzleDescriptor);
-            setError(null);
-        }
-        else {
-            setError(`Failed to create puzzle session: ${sessionResult.message}`);
-            setSession(null);
-            setPuzzleDescription(null);
-        }
-    }, [initialPuzzleDescription]);
-    // Get validation errors
-    const validationErrors = (0, react_1.useMemo)(() => {
-        if (!session)
-            return [];
-        const errors = [];
-        const invalidCells = session.getInvalidCells();
-        invalidCells.forEach((cell) => {
-            const contentsResult = session.state.getCellContents(cell.id);
-            if (contentsResult.isSuccess() && contentsResult.value.value) {
-                const contents = contentsResult.value;
-                // Check for duplicates in row, column, and section
-                const rowCells = session.rows[cell.row];
-                const colCells = session.cols[cell.col];
-                // Calculate section index based on puzzle dimensions
-                const cageHeight = session.puzzle.dimensions.cageHeightInCells;
-                const cageWidth = session.puzzle.dimensions.cageWidthInCells;
-                const sectionRow = Math.floor(cell.row / cageHeight);
-                const sectionCol = Math.floor(cell.col / cageWidth);
-                const sectionsPerRow = Math.ceil(session.numColumns / cageWidth);
-                const sectionIndex = sectionRow * sectionsPerRow + sectionCol;
-                const sectionCells = session.sections[sectionIndex];
-                const checkDuplicates = (cageCellIds, type) => {
-                    const duplicates = cageCellIds.filter((cellId) => {
-                        if (cellId === cell.id)
-                            return false;
-                        const cellContentsResult = session.state.getCellContents(cellId);
-                        return cellContentsResult.isSuccess() && cellContentsResult.value.value === contents.value;
-                    });
-                    if (duplicates.length > 0) {
-                        errors.push({
-                            cellId: cell.id,
-                            type,
-                            conflictingCells: duplicates,
-                            message: `Duplicate ${contents.value} in ${type.replace('duplicate-', '').replace('-', ' ')}`
-                        });
-                    }
-                };
-                checkDuplicates(rowCells.cellIds, 'duplicate-row');
-                checkDuplicates(colCells.cellIds, 'duplicate-column');
-                checkDuplicates(sectionCells.cellIds, 'duplicate-section');
-                // For Sudoku X puzzles, also check diagonal constraints
-                if (puzzleDescription?.type === 'sudoku-x') {
-                    // Find diagonal cages in the session
-                    const diagonalCages = session.cages.filter((cage) => cage.cageType === 'x');
-                    // Check main diagonal (top-left to bottom-right)
-                    if (cell.row === cell.col && diagonalCages.length > 0) {
-                        const mainDiagonal = diagonalCages[0];
-                        checkDuplicates(mainDiagonal.cellIds, 'duplicate-diagonal');
-                    }
-                    // Check anti-diagonal (top-right to bottom-left)
-                    if (cell.row + cell.col === 8 && diagonalCages.length > 1) {
-                        const antiDiagonal = diagonalCages[1];
-                        checkDuplicates(antiDiagonal.cellIds, 'duplicate-diagonal');
-                    }
-                }
-            }
-        });
-        return errors;
-    }, [session, puzzleDescription, updateCounter]);
-    // Get cell display information
-    const cellDisplayInfo = (0, react_1.useMemo)(() => {
-        if (!session)
-            return [];
-        return session.cells.map((cell) => {
-            const contentsResult = session.state.getCellContents(cell.id);
-            /* c8 ignore next 1 - defense in depth */
-            const contents = contentsResult.isSuccess() ? contentsResult.value : { value: undefined, notes: [] };
-            const hasValidationError = validationErrors.some((error) => error.cellId === cell.id);
-            return {
-                id: cell.id,
-                row: cell.row,
-                column: cell.col,
-                contents,
-                isImmutable: cell.immutable,
-                hasValidationError
-            };
-        });
-    }, [session, validationErrors, updateCounter]);
-    // Get cage display information for Killer Sudoku
-    const cageDisplayInfo = (0, react_1.useMemo)(() => {
-        if (!session || puzzleDescription?.type !== 'killer-sudoku')
-            return [];
-        return session.cages
-            .filter((cage) => cage.cageType === 'killer') // Only show killer cages, not diagonal/section cages
-            .map((cage) => {
-            // Calculate current sum
-            let currentSum = 0;
-            let isComplete = true;
-            let hasValues = false;
-            for (const cellId of cage.cellIds) {
-                const contentsResult = session.state.getCellContents(cellId);
-                if (contentsResult.isSuccess() && contentsResult.value.value) {
-                    currentSum += contentsResult.value.value;
-                    hasValues = true;
-                }
-                else {
-                    isComplete = false;
-                }
-            }
-            // Check if the current sum is valid (not exceeding target when incomplete, or matching target when complete)
-            const isValid = isComplete ? currentSum === cage.total : currentSum <= cage.total;
-            // Check if cage should be highlighted (contains selected cell)
-            const isHighlighted = selectedCell ? cage.cellIds.includes(selectedCell) : false;
-            return {
-                cage,
-                isHighlighted,
-                currentSum: hasValues ? currentSum : undefined,
-                isComplete,
-                isValid
-            };
-        });
-    }, [session, puzzleDescription, selectedCell, updateCounter]);
-    // Helper function to remove notes that conflict with a placed value
-    const removeConflictingNotes = (0, react_1.useCallback)((placedCellId, placedValue) => {
-        /* c8 ignore next 1 - defense in depth should not happen */
-        if (!session)
-            return;
-        const placedCell = session.cells.find((cell) => cell.id === placedCellId);
-        /* c8 ignore next 1 - defense in depth should not happen */
-        if (!placedCell)
-            return;
-        // Get cells in the same row, column, and section
-        const rowCells = session.rows[placedCell.row].cellIds;
-        const colCells = session.cols[placedCell.col].cellIds;
-        // Calculate section index based on puzzle dimensions
-        const cageHeight = session.puzzle.dimensions.cageHeightInCells;
-        const cageWidth = session.puzzle.dimensions.cageWidthInCells;
-        const sectionRow = Math.floor(placedCell.row / cageHeight);
-        const sectionCol = Math.floor(placedCell.col / cageWidth);
-        const sectionsPerRow = Math.ceil(session.numColumns / cageWidth);
-        const sectionIndex = sectionRow * sectionsPerRow + sectionCol;
-        const sectionCells = session.sections[sectionIndex].cellIds;
-        // Start with row, column, and section cells
-        const affectedCells = new Set([...rowCells, ...colCells, ...sectionCells]);
-        // For Sudoku X puzzles, also include diagonal cells
-        if (puzzleDescription?.type === 'sudoku-x') {
-            // Find diagonal cages in the session
-            const diagonalCages = session.cages.filter((cage) => cage.cageType === 'x');
-            // Check main diagonal (top-left to bottom-right)
-            if (placedCell.row === placedCell.col && diagonalCages.length > 0) {
-                const mainDiagonal = diagonalCages[0];
-                mainDiagonal.cellIds.forEach((cellId) => affectedCells.add(cellId));
-            }
-            // Check anti-diagonal (top-right to bottom-left)
-            if (placedCell.row + placedCell.col === 8 && diagonalCages.length > 1) {
-                const antiDiagonal = diagonalCages[1];
-                antiDiagonal.cellIds.forEach((cellId) => affectedCells.add(cellId));
-            }
-        }
-        // Remove the placed cell itself from the list
-        affectedCells.delete(placedCellId);
-        // Update notes for each affected cell
-        for (const cellId of Array.from(affectedCells)) {
-            const contentsResult = session.state.getCellContents(cellId);
-            if (contentsResult.isSuccess()) {
-                const contents = contentsResult.value;
-                // Only update if the cell has notes and contains the placed value
-                if (contents.notes.length > 0 && contents.notes.includes(placedValue) && !contents.value) {
-                    const newNotes = contents.notes.filter((note) => note !== placedValue);
-                    session.updateCellNotes(cellId, newNotes);
-                }
-            }
-        }
-    }, [session, puzzleDescription]);
-    // Update cell value with smart note removal
-    const updateCellValue = (0, react_1.useCallback)((cellId, value) => {
-        /* c8 ignore next 1 - defense in depth should not happen */
-        if (!session)
-            return;
-        const result = session.updateCellValue(cellId, value);
-        if (result.isSuccess()) {
-            // If a value was placed (not removed), remove conflicting notes
-            if (value !== undefined) {
-                removeConflictingNotes(cellId, value);
-            }
-            // Force re-render by incrementing update counter
-            setUpdateCounter((prev) => prev + 1);
-        }
-        else {
-            setError(`Failed to update cell: ${result.message}`);
-        }
-    }, [session, removeConflictingNotes]);
-    // Toggle a note in a cell
-    const toggleCellNote = (0, react_1.useCallback)((cellId, note) => {
-        /* c8 ignore next 1 - defense in depth should not happen */
-        if (!session)
-            return;
-        // Get current cell contents
-        const contentsResult = session.state.getCellContents(cellId);
-        if (contentsResult.isFailure()) {
-            setError(`Failed to get cell contents: ${contentsResult.message}`);
-            return;
-        }
-        const currentNotes = contentsResult.value.notes;
-        const newNotes = currentNotes.includes(note)
-            ? currentNotes.filter((n) => n !== note) // Remove note if it exists
-            : [...currentNotes, note].sort(); // Add note if it doesn't exist
-        const result = session.updateCellNotes(cellId, newNotes);
-        if (result.isSuccess()) {
-            setUpdateCounter((prev) => prev + 1);
-            /* c8 ignore next 3 - defense in depth */
-        }
-        else {
-            setError(`Failed to toggle note: ${result.message}`);
-        }
-    }, [session]);
-    // Clear all notes from a cell
-    const clearCellNotes = (0, react_1.useCallback)((cellId) => {
-        /* c8 ignore next 1 - defense in depth should not happen */
-        if (!session)
-            return;
-        const result = session.updateCellNotes(cellId, []);
-        if (result.isSuccess()) {
-            setUpdateCounter((prev) => prev + 1);
-        }
-        else {
-            setError(`Failed to clear notes: ${result.message}`);
-        }
-    }, [session]);
-    // Navigate to adjacent cell
-    const navigateToCell = (0, react_1.useCallback)((direction, wrap = 'wrap-around') => {
-        if (!session || !selectedCell)
-            return;
-        const currentCell = session.cells.find((cell) => cell.id === selectedCell);
-        /* c8 ignore next 1 - defense in depth should not happen */
-        if (!currentCell)
-            return;
-        let newRow = currentCell.row;
-        let newCol = currentCell.col;
-        switch (direction) {
-            case 'up':
-                newRow = newRow > 0 ? newRow - 1 : wrap === 'wrap-around' ? session.numRows - 1 : newRow;
-                break;
-            case 'down':
-                newRow = newRow < session.numRows - 1 ? newRow + 1 : wrap === 'wrap-around' ? 0 : newRow;
-                break;
-            case 'left':
-                newCol = newCol > 0 ? newCol - 1 : wrap === 'wrap-around' ? session.numColumns - 1 : newCol;
-                break;
-            case 'right':
-                newCol = newCol < session.numColumns - 1 ? newCol + 1 : wrap === 'wrap-around' ? 0 : newCol;
-                break;
-        }
-        const targetCell = session.cells.find((cell) => cell.row === newRow && cell.col === newCol);
-        if (targetCell) {
-            setSelectedCell(targetCell.id);
-        }
-    }, [session, selectedCell]);
-    // Undo last move
-    const undo = (0, react_1.useCallback)(() => {
-        /* c8 ignore next 1 - defense in depth should not happen */
-        if (!session)
-            return;
-        const result = session.undo();
-        if (result.isSuccess()) {
-            setUpdateCounter((prev) => prev + 1);
-        }
-        else {
-            setError(`Failed to undo: ${result.message}`);
-        }
-    }, [session]);
-    // Redo last undone move
-    const redo = (0, react_1.useCallback)(() => {
-        /* c8 ignore next 1 - defense in depth should not happen */
-        if (!session)
-            return;
-        const result = session.redo();
-        if (result.isSuccess()) {
-            setUpdateCounter((prev) => prev + 1);
-        }
-        else {
-            setError(`Failed to redo: ${result.message}`);
-        }
-    }, [session]);
-    // Reset puzzle to initial state
-    const reset = (0, react_1.useCallback)(() => {
-        /* c8 ignore next 1 - defense in depth should not happen */
-        if (!session)
-            return;
-        const result = ts_sudoku_lib_1.PuzzleSession.create(session.puzzle);
-        if (result.isSuccess()) {
-            setSession(result.value);
-            setSelectedCell(null);
-            setUpdateCounter(0);
-            /* c8 ignore next 3 - defense in depth */
-        }
-        else {
-            setError(`Failed to reset: ${result.message}`);
-        }
-    }, [session]);
-    // Export puzzle state
-    const exportPuzzle = (0, react_1.useCallback)(() => {
-        /* c8 ignore next 1 - defense in depth should not happen */
-        if (!session)
-            return null;
-        const cellsArray = Array(session.numRows * session.numColumns).fill('.');
-        session.cells.forEach((cell) => {
-            const contentsResult = session.state.getCellContents(cell.id);
-            const index = cell.row * session.numColumns + cell.col;
-            if (contentsResult.isSuccess() && contentsResult.value.value) {
-                cellsArray[index] = contentsResult.value.value.toString();
-            }
-        });
-        /* c8 ignore next 4 - defense in depth */
-        const id = session.id && session.id !== '' ? session.id : 'exported-puzzle';
-        const description = session.description && session.description !== '' ? session.description : 'Exported Puzzle';
-        const type = puzzleDescription?.type ?? 'sudoku';
-        return (0, puzzleDefinitionHelper_1.createPuzzleDefinition)({
-            id,
-            description,
-            type,
-            level: 1,
-            totalRows: session.numRows,
-            totalColumns: session.numColumns,
-            cells: cellsArray.join('')
-        });
-    }, [session, puzzleDescription, updateCounter]);
-    return {
-        session,
-        selectedCell,
-        selectedCells,
-        inputMode,
-        setSelectedCell,
-        setSelectedCells,
-        setInputMode,
-        cellDisplayInfo,
-        cageDisplayInfo,
-        validationErrors,
-        isValid: session?.checkIsValid() ?? false,
-        isSolved: session?.checkIsSolved() ?? false,
-        canUndo: session?.canUndo ?? false,
-        canRedo: session?.canRedo ?? false,
-        error,
-        updateCellValue,
-        toggleCellNote,
-        clearCellNotes,
-        navigateToCell,
-        undo,
-        redo,
-        reset,
-        exportPuzzle
-    };
-}
-//# sourceMappingURL=usePuzzleSession.js.map

package/lib-commonjs/hooks/usePuzzleSession.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"usePuzzleSession.js","sourceRoot":"","sources":["../../src/hooks/usePuzzleSession.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;AAkBH,4CA8bC;AA9cD,iCAAkE;AAClE,sDAO4B;AAE5B,4EAAsG;AAEtG;;;GAGG;AACH,SAAgB,gBAAgB,CAAC,wBAA4C;IAyB3E,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,GAAG,IAAA,gBAAQ,EAAuB,IAAI,CAAC,CAAC;IACnE,MAAM,CAAC,iBAAiB,EAAE,oBAAoB,CAAC,GAAG,IAAA,gBAAQ,EAA2B,IAAI,CAAC,CAAC;IAC3F,MAAM,CAAC,YAAY,EAAE,eAAe,CAAC,GAAG,IAAA,gBAAQ,EAAgB,IAAI,CAAC,CAAC;IACtE,MAAM,CAAC,aAAa,EAAE,gBAAgB,CAAC,GAAG,IAAA,gBAAQ,EAAW,EAAE,CAAC,CAAC;IACjE,MAAM,CAAC,SAAS,EAAE,YAAY,CAAC,GAAG,IAAA,gBAAQ,EAAY,OAAO,CAAC,CAAC,CAAC,uBAAuB;IACvF,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAA,gBAAQ,EAAgB,IAAI,CAAC,CAAC;IACxD,MAAM,CAAC,aAAa,EAAE,gBAAgB,CAAC,GAAG,IAAA,gBAAQ,EAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB;IAE1E,sCAAsC;IACtC,IAAA,iBAAS,EAAC,GAAG,EAAE;QACb,oEAAoE;QACpE,MAAM,gBAAgB,GAAsB,wBAAwB,IAAI,IAAA,oDAA2B,GAAE,CAAC;QAEtG,MAAM,aAAa,GAAG,uBAAO,CAAC,GAAG,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE,CAC9E,6BAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAC7B,CAAC;QAEF,IAAI,aAAa,CAAC,SAAS,EAAE,EAAE,CAAC;YAC9B,UAAU,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAChC,oBAAoB,CAAC,gBAAgB,CAAC,CAAC;YACvC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,oCAAoC,aAAa,CAAC,OAAO,EAAE,CAAC,CAAC;YACtE,UAAU,CAAC,IAAI,CAAC,CAAC;YACjB,oBAAoB,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC,EAAE,CAAC,wBAAwB,CAAC,CAAC,CAAC;IAE/B,wBAAwB;IACxB,MAAM,gBAAgB,GAAG,IAAA,eAAO,EAAC,GAAuB,EAAE;QACxD,IAAI,CAAC,OAAO;YAAE,OAAO,EAAE,CAAC;QAExB,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,MAAM,YAAY,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;QAE/C,YAAY,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YAC5B,MAAM,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC9D,IAAI,cAAc,CAAC,SAAS,EAAE,IAAI,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC7D,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC;gBAEtC,mDAAmD;gBACnD,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACxC,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAExC,qDAAqD;gBACrD,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,iBAAiB,CAAC;gBAC/D,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,gBAAgB,CAAC;gBAC7D,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,UAAU,CAAC,CAAC;gBACrD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,SAAS,CAAC,CAAC;gBACpD,MAAM,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,SAAS,CAAC,CAAC;gBACjE,MAAM,YAAY,GAAG,UAAU,GAAG,cAAc,GAAG,UAAU,CAAC;gBAC9D,MAAM,YAAY,GAAG,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;gBAEpD,MAAM,eAAe,GAAG,CAAC,WAAqB,EAAE,IAA8B,EAAQ,EAAE;oBACtF,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE;wBAC/C,IAAI,MAAM,KAAK,IAAI,CAAC,EAAE;4BAAE,OAAO,KAAK,CAAC;wBACrC,MAAM,kBAAkB,GAAG,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;wBACjE,OAAO,kBAAkB,CAAC,SAAS,EAAE,IAAI,kBAAkB,CAAC,KAAK,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,CAAC;oBAC7F,CAAC,CAAC,CAAC;oBAEH,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBAC1B,MAAM,CAAC,IAAI,CAAC;4BACV,MAAM,EAAE,IAAI,CAAC,EAAE;4BACf,IAAI;4BACJ,gBAAgB,EAAE,UAAU;4BAC5B,OAAO,EAAE,aAAa,QAAQ,CAAC,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;yBAC9F,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC,CAAC;gBAEF,eAAe,CAAC,QAAQ,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;gBACnD,eAAe,CAAC,QAAQ,CAAC,OAAO,EAAE,kBAAkB,CAAC,CAAC;gBACtD,eAAe,CAAC,YAAY,CAAC,OAAO,EAAE,mBAAmB,CAAC,CAAC;gBAE3D,wDAAwD;gBACxD,IAAI,iBAAiB,EAAE,IAAI,KAAK,UAAU,EAAE,CAAC;oBAC3C,qCAAqC;oBACrC,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAC,CAAC;oBAE5E,iDAAiD;oBACjD,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACtD,MAAM,YAAY,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;wBACtC,eAAe,CAAC,YAAY,CAAC,OAAO,EAAE,oBAAoB,CAAC,CAAC;oBAC9D,CAAC;oBAED,iDAAiD;oBACjD,IAAI,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBAC1D,MAAM,YAAY,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;wBACtC,eAAe,CAAC,YAAY,CAAC,OAAO,EAAE,oBAAoB,CAAC,CAAC;oBAC9D,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC;IAChB,CAAC,EAAE,CAAC,OAAO,EAAE,iBAAiB,EAAE,aAAa,CAAC,CAAC,CAAC;IAEhD,+BAA+B;IAC/B,MAAM,eAAe,GAAG,IAAA,eAAO,EAAC,GAAuB,EAAE;QACvD,IAAI,CAAC,OAAO;YAAE,OAAO,EAAE,CAAC;QAExB,OAAO,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YAChC,MAAM,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC9D,yCAAyC;YACzC,MAAM,QAAQ,GAAG,cAAc,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;YACrG,MAAM,kBAAkB,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;YAEtF,OAAO;gBACL,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,GAAG,EAAE,IAAI,CAAC,GAAG;gBACb,MAAM,EAAE,IAAI,CAAC,GAAG;gBAChB,QAAQ;gBACR,WAAW,EAAE,IAAI,CAAC,SAAS;gBAC3B,kBAAkB;aACnB,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,EAAE,CAAC,OAAO,EAAE,gBAAgB,EAAE,aAAa,CAAC,CAAC,CAAC;IAE/C,iDAAiD;IACjD,MAAM,eAAe,GAAG,IAAA,eAAO,EAAC,GAAuB,EAAE;QACvD,IAAI,CAAC,OAAO,IAAI,iBAAiB,EAAE,IAAI,KAAK,eAAe;YAAE,OAAO,EAAE,CAAC;QAEvE,OAAO,OAAO,CAAC,KAAK;aACjB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,qDAAqD;aAClG,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACZ,wBAAwB;YACxB,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,IAAI,UAAU,GAAG,IAAI,CAAC;YACtB,IAAI,SAAS,GAAG,KAAK,CAAC;YAEtB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAClC,MAAM,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;gBAC7D,IAAI,cAAc,CAAC,SAAS,EAAE,IAAI,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;oBAC7D,UAAU,IAAI,cAAc,CAAC,KAAK,CAAC,KAAK,CAAC;oBACzC,SAAS,GAAG,IAAI,CAAC;gBACnB,CAAC;qBAAM,CAAC;oBACN,UAAU,GAAG,KAAK,CAAC;gBACrB,CAAC;YACH,CAAC;YAED,6GAA6G;YAC7G,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,UAAU,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC;YAElF,+DAA+D;YAC/D,MAAM,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAEjF,OAAO;gBACL,IAAI;gBACJ,aAAa;gBACb,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS;gBAC9C,UAAU;gBACV,OAAO;aACR,CAAC;QACJ,CAAC,CAAC,CAAC;IACP,CAAC,EAAE,CAAC,OAAO,EAAE,iBAAiB,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC,CAAC;IAE9D,oEAAoE;IACpE,MAAM,sBAAsB,GAAG,IAAA,mBAAW,EACxC,CAAC,YAAoB,EAAE,WAAmB,EAAE,EAAE;QAC5C,2DAA2D;QAC3D,IAAI,CAAC,OAAO;YAAE,OAAO;QAErB,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,YAAY,CAAC,CAAC;QAC1E,2DAA2D;QAC3D,IAAI,CAAC,UAAU;YAAE,OAAO;QAExB,iDAAiD;QACjD,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;QACtD,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;QAEtD,qDAAqD;QACrD,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,iBAAiB,CAAC;QAC/D,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,gBAAgB,CAAC;QAC7D,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,GAAG,UAAU,CAAC,CAAC;QAC3D,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,GAAG,SAAS,CAAC,CAAC;QAC1D,MAAM,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,SAAS,CAAC,CAAC;QACjE,MAAM,YAAY,GAAG,UAAU,GAAG,cAAc,GAAG,UAAU,CAAC;QAC9D,MAAM,YAAY,GAAG,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC;QAE5D,4CAA4C;QAC5C,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,EAAE,GAAG,QAAQ,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC;QAE3E,oDAAoD;QACpD,IAAI,iBAAiB,EAAE,IAAI,KAAK,UAAU,EAAE,CAAC;YAC3C,qCAAqC;YACrC,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAC,CAAC;YAE5E,iDAAiD;YACjD,IAAI,UAAU,CAAC,GAAG,KAAK,UAAU,CAAC,GAAG,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAClE,MAAM,YAAY,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;gBACtC,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YACtE,CAAC;YAED,iDAAiD;YACjD,IAAI,UAAU,CAAC,GAAG,GAAG,UAAU,CAAC,GAAG,KAAK,CAAC,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtE,MAAM,YAAY,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;gBACtC,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,aAAa,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAEnC,sCAAsC;QACtC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;YAC/C,MAAM,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;YAC7D,IAAI,cAAc,CAAC,SAAS,EAAE,EAAE,CAAC;gBAC/B,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC;gBAEtC,kEAAkE;gBAClE,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;oBACzF,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;oBACvE,OAAO,CAAC,eAAe,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC,EACD,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAC7B,CAAC;IAEF,4CAA4C;IAC5C,MAAM,eAAe,GAAG,IAAA,mBAAW,EACjC,CAAC,MAAc,EAAE,KAAyB,EAAE,EAAE;QAC5C,2DAA2D;QAC3D,IAAI,CAAC,OAAO;YAAE,OAAO;QAErB,MAAM,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACtD,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;YACvB,gEAAgE;YAChE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,sBAAsB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACxC,CAAC;YAED,iDAAiD;YACjD,gBAAgB,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QACvC,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,0BAA0B,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;QACvD,CAAC;IACH,CAAC,EACD,CAAC,OAAO,EAAE,sBAAsB,CAAC,CAClC,CAAC;IAEF,0BAA0B;IAC1B,MAAM,cAAc,GAAG,IAAA,mBAAW,EAChC,CAAC,MAAc,EAAE,IAAY,EAAE,EAAE;QAC/B,2DAA2D;QAC3D,IAAI,CAAC,OAAO;YAAE,OAAO;QAErB,4BAA4B;QAC5B,MAAM,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC7D,IAAI,cAAc,CAAC,SAAS,EAAE,EAAE,CAAC;YAC/B,QAAQ,CAAC,gCAAgC,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC;YACnE,OAAO;QACT,CAAC;QAED,MAAM,YAAY,GAAG,cAAc,CAAC,KAAK,CAAC,KAAK,CAAC;QAChD,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC;YAC1C,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,2BAA2B;YACpE,CAAC,CAAC,CAAC,GAAG,YAAY,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,+BAA+B;QAEnE,MAAM,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACzD,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;YACvB,gBAAgB,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YACrC,yCAAyC;QAC3C,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,0BAA0B,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;QACvD,CAAC;IACH,CAAC,EACD,CAAC,OAAO,CAAC,CACV,CAAC;IAEF,8BAA8B;IAC9B,MAAM,cAAc,GAAG,IAAA,mBAAW,EAChC,CAAC,MAAc,EAAE,EAAE;QACjB,2DAA2D;QAC3D,IAAI,CAAC,OAAO;YAAE,OAAO;QAErB,MAAM,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACnD,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;YACvB,gBAAgB,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QACvC,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,0BAA0B,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;QACvD,CAAC;IACH,CAAC,EACD,CAAC,OAAO,CAAC,CACV,CAAC;IAEF,4BAA4B;IAC5B,MAAM,cAAc,GAAG,IAAA,mBAAW,EAChC,CAAC,SAA8B,EAAE,OAAuB,aAAa,EAAE,EAAE;QACvE,IAAI,CAAC,OAAO,IAAI,CAAC,YAAY;YAAE,OAAO;QAEtC,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,YAAY,CAAC,CAAC;QAC3E,2DAA2D;QAC3D,IAAI,CAAC,WAAW;YAAE,OAAO;QAEzB,IAAI,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC;QAC7B,IAAI,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC;QAE7B,QAAQ,SAAS,EAAE,CAAC;YAClB,KAAK,IAAI;gBACP,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBACzF,MAAM;YACR,KAAK,MAAM;gBACT,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBACzF,MAAM;YACR,KAAK,MAAM;gBACT,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBAC5F,MAAM;YACR,KAAK,OAAO;gBACV,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBAC5F,MAAM;QACV,CAAC;QAED,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC;QAC5F,IAAI,UAAU,EAAE,CAAC;YACf,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACjC,CAAC;IACH,CAAC,EACD,CAAC,OAAO,EAAE,YAAY,CAAC,CACxB,CAAC;IAEF,iBAAiB;IACjB,MAAM,IAAI,GAAG,IAAA,mBAAW,EAAC,GAAG,EAAE;QAC5B,2DAA2D;QAC3D,IAAI,CAAC,OAAO;YAAE,OAAO;QAErB,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;QAC9B,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;YACvB,gBAAgB,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QACvC,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,mBAAmB,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;QAChD,CAAC;IACH,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;IAEd,wBAAwB;IACxB,MAAM,IAAI,GAAG,IAAA,mBAAW,EAAC,GAAG,EAAE;QAC5B,2DAA2D;QAC3D,IAAI,CAAC,OAAO;YAAE,OAAO;QAErB,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;QAC9B,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;YACvB,gBAAgB,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QACvC,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,mBAAmB,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;QAChD,CAAC;IACH,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;IAEd,gCAAgC;IAChC,MAAM,KAAK,GAAG,IAAA,mBAAW,EAAC,GAAG,EAAE;QAC7B,2DAA2D;QAC3D,IAAI,CAAC,OAAO;YAAE,OAAO;QAErB,MAAM,MAAM,GAAG,6BAAa,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACpD,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;YACvB,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACzB,eAAe,CAAC,IAAI,CAAC,CAAC;YACtB,gBAAgB,CAAC,CAAC,CAAC,CAAC;YACpB,yCAAyC;QAC3C,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,oBAAoB,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;QACjD,CAAC;IACH,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;IAEd,sBAAsB;IACtB,MAAM,YAAY,GAAG,IAAA,mBAAW,EAAC,GAA6B,EAAE;QAC9D,2DAA2D;QAC3D,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAE1B,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEzE,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YAC7B,MAAM,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC9D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC;YACvD,IAAI,cAAc,CAAC,SAAS,EAAE,IAAI,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC7D,UAAU,CAAC,KAAK,CAAC,GAAG,cAAc,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC5D,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,yCAAyC;QACzC,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,iBAAiB,CAAC;QAC5E,MAAM,WAAW,GACf,OAAO,CAAC,WAAW,IAAI,OAAO,CAAC,WAAW,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,iBAAiB,CAAC;QAC9F,MAAM,IAAI,GAAG,iBAAiB,EAAE,IAAI,IAAI,QAAQ,CAAC;QAEjD,OAAO,IAAA,+CAAsB,EAAC;YAC5B,EAAE;YACF,WAAW;YACX,IAAI;YACJ,KAAK,EAAE,CAAC;YACR,SAAS,EAAE,OAAO,CAAC,OAAO;YAC1B,YAAY,EAAE,OAAO,CAAC,UAAU;YAChC,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;SAC3B,CAAC,CAAC;IACL,CAAC,EAAE,CAAC,OAAO,EAAE,iBAAiB,EAAE,aAAa,CAAC,CAAC,CAAC;IAEhD,OAAO;QACL,OAAO;QACP,YAAY;QACZ,aAAa;QACb,SAAS;QACT,eAAe;QACf,gBAAgB;QAChB,YAAY;QACZ,eAAe;QACf,eAAe;QACf,gBAAgB;QAChB,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,IAAI,KAAK;QACzC,QAAQ,EAAE,OAAO,EAAE,aAAa,EAAE,IAAI,KAAK;QAC3C,OAAO,EAAE,OAAO,EAAE,OAAO,IAAI,KAAK;QAClC,OAAO,EAAE,OAAO,EAAE,OAAO,IAAI,KAAK;QAClC,KAAK;QACL,eAAe;QACf,cAAc;QACd,cAAc;QACd,cAAc;QACd,IAAI;QACJ,IAAI;QACJ,KAAK;QACL,YAAY;KACb,CAAC;AACJ,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 { useCallback, useEffect, useMemo, useState } from 'react';\nimport {\n  PuzzleSession,\n  CellId,\n  NavigationDirection,\n  NavigationWrap,\n  Puzzles,\n  IPuzzleDefinition\n} from '@fgv/ts-sudoku-lib';\nimport { IValidationError, ICellDisplayInfo, InputMode, ICageDisplayInfo } from '../types';\nimport { createEmptyPuzzleDefinition, createPuzzleDefinition } from '../utils/puzzleDefinitionHelper';\n\n/**\n * Hook for managing puzzle session state and operations\n * @public\n */\nexport function usePuzzleSession(initialPuzzleDescription?: IPuzzleDefinition): {\n  session: PuzzleSession | null;\n  selectedCell: CellId | null;\n  selectedCells: CellId[];\n  inputMode: InputMode;\n  setSelectedCell: (cell: CellId | null) => void;\n  setSelectedCells: (cells: CellId[]) => void;\n  setInputMode: (mode: InputMode) => void;\n  cellDisplayInfo: ICellDisplayInfo[];\n  cageDisplayInfo: ICageDisplayInfo[];\n  validationErrors: IValidationError[];\n  isValid: boolean;\n  isSolved: boolean;\n  canUndo: boolean;\n  canRedo: boolean;\n  error: string | null;\n  updateCellValue: (cellId: CellId, value: number | undefined) => void;\n  toggleCellNote: (cellId: CellId, note: number) => void;\n  clearCellNotes: (cellId: CellId) => void;\n  navigateToCell: (direction: NavigationDirection, wrap?: NavigationWrap) => void;\n  undo: () => void;\n  redo: () => void;\n  reset: () => void;\n  exportPuzzle: () => IPuzzleDefinition | null;\n} {\n  const [session, setSession] = useState<PuzzleSession | null>(null);\n  const [puzzleDescription, setPuzzleDescription] = useState<IPuzzleDefinition | null>(null);\n  const [selectedCell, setSelectedCell] = useState<CellId | null>(null);\n  const [selectedCells, setSelectedCells] = useState<CellId[]>([]);\n  const [inputMode, setInputMode] = useState<InputMode>('notes'); // Notes-first paradigm\n  const [error, setError] = useState<string | null>(null);\n  const [updateCounter, setUpdateCounter] = useState(0); // Force re-renders\n\n  // Initialize or update puzzle session\n  useEffect(() => {\n    // Use the provided description or create a default empty 9x9 puzzle\n    const puzzleDescriptor: IPuzzleDefinition = initialPuzzleDescription || createEmptyPuzzleDefinition();\n\n    const sessionResult = Puzzles.Any.create(puzzleDescriptor).onSuccess((puzzle) =>\n      PuzzleSession.create(puzzle)\n    );\n\n    if (sessionResult.isSuccess()) {\n      setSession(sessionResult.value);\n      setPuzzleDescription(puzzleDescriptor);\n      setError(null);\n    } else {\n      setError(`Failed to create puzzle session: ${sessionResult.message}`);\n      setSession(null);\n      setPuzzleDescription(null);\n    }\n  }, [initialPuzzleDescription]);\n\n  // Get validation errors\n  const validationErrors = useMemo((): IValidationError[] => {\n    if (!session) return [];\n\n    const errors: IValidationError[] = [];\n    const invalidCells = session.getInvalidCells();\n\n    invalidCells.forEach((cell) => {\n      const contentsResult = session.state.getCellContents(cell.id);\n      if (contentsResult.isSuccess() && contentsResult.value.value) {\n        const contents = contentsResult.value;\n\n        // Check for duplicates in row, column, and section\n        const rowCells = session.rows[cell.row];\n        const colCells = session.cols[cell.col];\n\n        // Calculate section index based on puzzle dimensions\n        const cageHeight = session.puzzle.dimensions.cageHeightInCells;\n        const cageWidth = session.puzzle.dimensions.cageWidthInCells;\n        const sectionRow = Math.floor(cell.row / cageHeight);\n        const sectionCol = Math.floor(cell.col / cageWidth);\n        const sectionsPerRow = Math.ceil(session.numColumns / cageWidth);\n        const sectionIndex = sectionRow * sectionsPerRow + sectionCol;\n        const sectionCells = session.sections[sectionIndex];\n\n        const checkDuplicates = (cageCellIds: CellId[], type: IValidationError['type']): void => {\n          const duplicates = cageCellIds.filter((cellId) => {\n            if (cellId === cell.id) return false;\n            const cellContentsResult = session.state.getCellContents(cellId);\n            return cellContentsResult.isSuccess() && cellContentsResult.value.value === contents.value;\n          });\n\n          if (duplicates.length > 0) {\n            errors.push({\n              cellId: cell.id,\n              type,\n              conflictingCells: duplicates,\n              message: `Duplicate ${contents.value} in ${type.replace('duplicate-', '').replace('-', ' ')}`\n            });\n          }\n        };\n\n        checkDuplicates(rowCells.cellIds, 'duplicate-row');\n        checkDuplicates(colCells.cellIds, 'duplicate-column');\n        checkDuplicates(sectionCells.cellIds, 'duplicate-section');\n\n        // For Sudoku X puzzles, also check diagonal constraints\n        if (puzzleDescription?.type === 'sudoku-x') {\n          // Find diagonal cages in the session\n          const diagonalCages = session.cages.filter((cage) => cage.cageType === 'x');\n\n          // Check main diagonal (top-left to bottom-right)\n          if (cell.row === cell.col && diagonalCages.length > 0) {\n            const mainDiagonal = diagonalCages[0];\n            checkDuplicates(mainDiagonal.cellIds, 'duplicate-diagonal');\n          }\n\n          // Check anti-diagonal (top-right to bottom-left)\n          if (cell.row + cell.col === 8 && diagonalCages.length > 1) {\n            const antiDiagonal = diagonalCages[1];\n            checkDuplicates(antiDiagonal.cellIds, 'duplicate-diagonal');\n          }\n        }\n      }\n    });\n\n    return errors;\n  }, [session, puzzleDescription, updateCounter]);\n\n  // Get cell display information\n  const cellDisplayInfo = useMemo((): ICellDisplayInfo[] => {\n    if (!session) return [];\n\n    return session.cells.map((cell) => {\n      const contentsResult = session.state.getCellContents(cell.id);\n      /* c8 ignore next 1 - defense in depth */\n      const contents = contentsResult.isSuccess() ? contentsResult.value : { value: undefined, notes: [] };\n      const hasValidationError = validationErrors.some((error) => error.cellId === cell.id);\n\n      return {\n        id: cell.id,\n        row: cell.row,\n        column: cell.col,\n        contents,\n        isImmutable: cell.immutable,\n        hasValidationError\n      };\n    });\n  }, [session, validationErrors, updateCounter]);\n\n  // Get cage display information for Killer Sudoku\n  const cageDisplayInfo = useMemo((): ICageDisplayInfo[] => {\n    if (!session || puzzleDescription?.type !== 'killer-sudoku') return [];\n\n    return session.cages\n      .filter((cage) => cage.cageType === 'killer') // Only show killer cages, not diagonal/section cages\n      .map((cage) => {\n        // Calculate current sum\n        let currentSum = 0;\n        let isComplete = true;\n        let hasValues = false;\n\n        for (const cellId of cage.cellIds) {\n          const contentsResult = session.state.getCellContents(cellId);\n          if (contentsResult.isSuccess() && contentsResult.value.value) {\n            currentSum += contentsResult.value.value;\n            hasValues = true;\n          } else {\n            isComplete = false;\n          }\n        }\n\n        // Check if the current sum is valid (not exceeding target when incomplete, or matching target when complete)\n        const isValid = isComplete ? currentSum === cage.total : currentSum <= cage.total;\n\n        // Check if cage should be highlighted (contains selected cell)\n        const isHighlighted = selectedCell ? cage.cellIds.includes(selectedCell) : false;\n\n        return {\n          cage,\n          isHighlighted,\n          currentSum: hasValues ? currentSum : undefined,\n          isComplete,\n          isValid\n        };\n      });\n  }, [session, puzzleDescription, selectedCell, updateCounter]);\n\n  // Helper function to remove notes that conflict with a placed value\n  const removeConflictingNotes = useCallback(\n    (placedCellId: CellId, placedValue: number) => {\n      /* c8 ignore next 1 - defense in depth should not happen */\n      if (!session) return;\n\n      const placedCell = session.cells.find((cell) => cell.id === placedCellId);\n      /* c8 ignore next 1 - defense in depth should not happen */\n      if (!placedCell) return;\n\n      // Get cells in the same row, column, and section\n      const rowCells = session.rows[placedCell.row].cellIds;\n      const colCells = session.cols[placedCell.col].cellIds;\n\n      // Calculate section index based on puzzle dimensions\n      const cageHeight = session.puzzle.dimensions.cageHeightInCells;\n      const cageWidth = session.puzzle.dimensions.cageWidthInCells;\n      const sectionRow = Math.floor(placedCell.row / cageHeight);\n      const sectionCol = Math.floor(placedCell.col / cageWidth);\n      const sectionsPerRow = Math.ceil(session.numColumns / cageWidth);\n      const sectionIndex = sectionRow * sectionsPerRow + sectionCol;\n      const sectionCells = session.sections[sectionIndex].cellIds;\n\n      // Start with row, column, and section cells\n      const affectedCells = new Set([...rowCells, ...colCells, ...sectionCells]);\n\n      // For Sudoku X puzzles, also include diagonal cells\n      if (puzzleDescription?.type === 'sudoku-x') {\n        // Find diagonal cages in the session\n        const diagonalCages = session.cages.filter((cage) => cage.cageType === 'x');\n\n        // Check main diagonal (top-left to bottom-right)\n        if (placedCell.row === placedCell.col && diagonalCages.length > 0) {\n          const mainDiagonal = diagonalCages[0];\n          mainDiagonal.cellIds.forEach((cellId) => affectedCells.add(cellId));\n        }\n\n        // Check anti-diagonal (top-right to bottom-left)\n        if (placedCell.row + placedCell.col === 8 && diagonalCages.length > 1) {\n          const antiDiagonal = diagonalCages[1];\n          antiDiagonal.cellIds.forEach((cellId) => affectedCells.add(cellId));\n        }\n      }\n\n      // Remove the placed cell itself from the list\n      affectedCells.delete(placedCellId);\n\n      // Update notes for each affected cell\n      for (const cellId of Array.from(affectedCells)) {\n        const contentsResult = session.state.getCellContents(cellId);\n        if (contentsResult.isSuccess()) {\n          const contents = contentsResult.value;\n\n          // Only update if the cell has notes and contains the placed value\n          if (contents.notes.length > 0 && contents.notes.includes(placedValue) && !contents.value) {\n            const newNotes = contents.notes.filter((note) => note !== placedValue);\n            session.updateCellNotes(cellId, newNotes);\n          }\n        }\n      }\n    },\n    [session, puzzleDescription]\n  );\n\n  // Update cell value with smart note removal\n  const updateCellValue = useCallback(\n    (cellId: CellId, value: number | undefined) => {\n      /* c8 ignore next 1 - defense in depth should not happen */\n      if (!session) return;\n\n      const result = session.updateCellValue(cellId, value);\n      if (result.isSuccess()) {\n        // If a value was placed (not removed), remove conflicting notes\n        if (value !== undefined) {\n          removeConflictingNotes(cellId, value);\n        }\n\n        // Force re-render by incrementing update counter\n        setUpdateCounter((prev) => prev + 1);\n      } else {\n        setError(`Failed to update cell: ${result.message}`);\n      }\n    },\n    [session, removeConflictingNotes]\n  );\n\n  // Toggle a note in a cell\n  const toggleCellNote = useCallback(\n    (cellId: CellId, note: number) => {\n      /* c8 ignore next 1 - defense in depth should not happen */\n      if (!session) return;\n\n      // Get current cell contents\n      const contentsResult = session.state.getCellContents(cellId);\n      if (contentsResult.isFailure()) {\n        setError(`Failed to get cell contents: ${contentsResult.message}`);\n        return;\n      }\n\n      const currentNotes = contentsResult.value.notes;\n      const newNotes = currentNotes.includes(note)\n        ? currentNotes.filter((n) => n !== note) // Remove note if it exists\n        : [...currentNotes, note].sort(); // Add note if it doesn't exist\n\n      const result = session.updateCellNotes(cellId, newNotes);\n      if (result.isSuccess()) {\n        setUpdateCounter((prev) => prev + 1);\n        /* c8 ignore next 3 - defense in depth */\n      } else {\n        setError(`Failed to toggle note: ${result.message}`);\n      }\n    },\n    [session]\n  );\n\n  // Clear all notes from a cell\n  const clearCellNotes = useCallback(\n    (cellId: CellId) => {\n      /* c8 ignore next 1 - defense in depth should not happen */\n      if (!session) return;\n\n      const result = session.updateCellNotes(cellId, []);\n      if (result.isSuccess()) {\n        setUpdateCounter((prev) => prev + 1);\n      } else {\n        setError(`Failed to clear notes: ${result.message}`);\n      }\n    },\n    [session]\n  );\n\n  // Navigate to adjacent cell\n  const navigateToCell = useCallback(\n    (direction: NavigationDirection, wrap: NavigationWrap = 'wrap-around') => {\n      if (!session || !selectedCell) return;\n\n      const currentCell = session.cells.find((cell) => cell.id === selectedCell);\n      /* c8 ignore next 1 - defense in depth should not happen */\n      if (!currentCell) return;\n\n      let newRow = currentCell.row;\n      let newCol = currentCell.col;\n\n      switch (direction) {\n        case 'up':\n          newRow = newRow > 0 ? newRow - 1 : wrap === 'wrap-around' ? session.numRows - 1 : newRow;\n          break;\n        case 'down':\n          newRow = newRow < session.numRows - 1 ? newRow + 1 : wrap === 'wrap-around' ? 0 : newRow;\n          break;\n        case 'left':\n          newCol = newCol > 0 ? newCol - 1 : wrap === 'wrap-around' ? session.numColumns - 1 : newCol;\n          break;\n        case 'right':\n          newCol = newCol < session.numColumns - 1 ? newCol + 1 : wrap === 'wrap-around' ? 0 : newCol;\n          break;\n      }\n\n      const targetCell = session.cells.find((cell) => cell.row === newRow && cell.col === newCol);\n      if (targetCell) {\n        setSelectedCell(targetCell.id);\n      }\n    },\n    [session, selectedCell]\n  );\n\n  // Undo last move\n  const undo = useCallback(() => {\n    /* c8 ignore next 1 - defense in depth should not happen */\n    if (!session) return;\n\n    const result = session.undo();\n    if (result.isSuccess()) {\n      setUpdateCounter((prev) => prev + 1);\n    } else {\n      setError(`Failed to undo: ${result.message}`);\n    }\n  }, [session]);\n\n  // Redo last undone move\n  const redo = useCallback(() => {\n    /* c8 ignore next 1 - defense in depth should not happen */\n    if (!session) return;\n\n    const result = session.redo();\n    if (result.isSuccess()) {\n      setUpdateCounter((prev) => prev + 1);\n    } else {\n      setError(`Failed to redo: ${result.message}`);\n    }\n  }, [session]);\n\n  // Reset puzzle to initial state\n  const reset = useCallback(() => {\n    /* c8 ignore next 1 - defense in depth should not happen */\n    if (!session) return;\n\n    const result = PuzzleSession.create(session.puzzle);\n    if (result.isSuccess()) {\n      setSession(result.value);\n      setSelectedCell(null);\n      setUpdateCounter(0);\n      /* c8 ignore next 3 - defense in depth */\n    } else {\n      setError(`Failed to reset: ${result.message}`);\n    }\n  }, [session]);\n\n  // Export puzzle state\n  const exportPuzzle = useCallback((): IPuzzleDefinition | null => {\n    /* c8 ignore next 1 - defense in depth should not happen */\n    if (!session) return null;\n\n    const cellsArray = Array(session.numRows * session.numColumns).fill('.');\n\n    session.cells.forEach((cell) => {\n      const contentsResult = session.state.getCellContents(cell.id);\n      const index = cell.row * session.numColumns + cell.col;\n      if (contentsResult.isSuccess() && contentsResult.value.value) {\n        cellsArray[index] = contentsResult.value.value.toString();\n      }\n    });\n\n    /* c8 ignore next 4 - defense in depth */\n    const id = session.id && session.id !== '' ? session.id : 'exported-puzzle';\n    const description =\n      session.description && session.description !== '' ? session.description : 'Exported Puzzle';\n    const type = puzzleDescription?.type ?? 'sudoku';\n\n    return createPuzzleDefinition({\n      id,\n      description,\n      type,\n      level: 1,\n      totalRows: session.numRows,\n      totalColumns: session.numColumns,\n      cells: cellsArray.join('')\n    });\n  }, [session, puzzleDescription, updateCounter]);\n\n  return {\n    session,\n    selectedCell,\n    selectedCells,\n    inputMode,\n    setSelectedCell,\n    setSelectedCells,\n    setInputMode,\n    cellDisplayInfo,\n    cageDisplayInfo,\n    validationErrors,\n    isValid: session?.checkIsValid() ?? false,\n    isSolved: session?.checkIsSolved() ?? false,\n    canUndo: session?.canUndo ?? false,\n    canRedo: session?.canRedo ?? false,\n    error,\n    updateCellValue,\n    toggleCellNote,\n    clearCellNotes,\n    navigateToCell,\n    undo,\n    redo,\n    reset,\n    exportPuzzle\n  };\n}\n"]}

package/lib-commonjs/hooks/useResponsiveLayout.js

@@ -1,142 +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.useResponsiveLayout = useResponsiveLayout;
-const react_1 = require("react");
-/**
- * Breakpoints for responsive design
- */
-const BREAKPOINTS = {
-    mobile: 768,
-    tablet: 1024,
-    smallHeight: 600
-};
-/**
- * Detect if device supports touch
- */
-function detectTouchSupport() {
-    return ('ontouchstart' in window ||
-        navigator.maxTouchPoints > 0 ||
-        (navigator.msMaxTouchPoints ?? 0) > 0);
-}
-/**
- * Determine device type based on screen size and touch capability
- */
-function determineDeviceType(width, height, isTouch) {
-    if (width <= BREAKPOINTS.mobile) {
-        return 'mobile';
-    }
-    if (width <= BREAKPOINTS.tablet && isTouch) {
-        return 'tablet';
-    }
-    return 'desktop';
-}
-/**
- * Determine optimal keypad layout mode
- */
-function determineKeypadLayoutMode(deviceType, orientation, width, height, isTouch) {
-    // Desktop: show overlay on demand or hidden by default
-    if (deviceType === 'desktop') {
-        return isTouch ? 'overlay' : 'hidden';
-    }
-    // Mobile portrait: side-by-side if width allows
-    if (deviceType === 'mobile' && orientation === 'portrait') {
-        return width >= 360 ? 'side-by-side' : 'stacked';
-    }
-    // Mobile landscape: stacked beside grid if height allows
-    if (deviceType === 'mobile' && orientation === 'landscape') {
-        return height >= BREAKPOINTS.smallHeight ? 'stacked' : 'overlay';
-    }
-    // Tablet: side-by-side in portrait, stacked in landscape
-    if (deviceType === 'tablet') {
-        return orientation === 'portrait' ? 'side-by-side' : 'stacked';
-    }
-    /* c8 ignore next 2 - defense in depth: all device types are explicitly handled above */
-    return 'overlay';
-}
-/**
- * Hook to detect responsive layout information for optimal keypad display
- * @param forceLayoutMode - Optional layout mode override for testing
- * @public
- */
-function useResponsiveLayout(forceLayoutMode) {
-    const [layoutInfo, setLayoutInfo] = (0, react_1.useState)(() => {
-        const width = window.innerWidth;
-        const height = window.innerHeight;
-        const isTouchDevice = detectTouchSupport();
-        const orientation = width > height ? 'landscape' : 'portrait';
-        const deviceType = determineDeviceType(width, height, isTouchDevice);
-        const keypadLayoutMode = forceLayoutMode ?? determineKeypadLayoutMode(deviceType, orientation, width, height, isTouchDevice);
-        return {
-            deviceType,
-            orientation,
-            keypadLayoutMode,
-            screenWidth: width,
-            screenHeight: height,
-            isTouchDevice,
-            isSmallScreen: width <= BREAKPOINTS.mobile,
-            hasSpaceForDualKeypads: width >= 480 || (orientation === 'landscape' && height >= BREAKPOINTS.smallHeight)
-        };
-    });
-    (0, react_1.useEffect)(() => {
-        // Don't set up listeners if layout mode is forced
-        if (forceLayoutMode) {
-            return;
-        }
-        function updateLayoutInfo() {
-            const width = window.innerWidth;
-            const height = window.innerHeight;
-            const isTouchDevice = detectTouchSupport();
-            const orientation = width > height ? 'landscape' : 'portrait';
-            const deviceType = determineDeviceType(width, height, isTouchDevice);
-            const keypadLayoutMode = determineKeypadLayoutMode(deviceType, orientation, width, height, isTouchDevice);
-            setLayoutInfo({
-                deviceType,
-                orientation,
-                keypadLayoutMode,
-                screenWidth: width,
-                screenHeight: height,
-                isTouchDevice,
-                isSmallScreen: width <= BREAKPOINTS.mobile,
-                hasSpaceForDualKeypads: width >= 480 || (orientation === 'landscape' && height >= BREAKPOINTS.smallHeight)
-            });
-        }
-        // Update on resize
-        window.addEventListener('resize', updateLayoutInfo);
-        // Update on orientation change
-        window.addEventListener('orientationchange', () => {
-            // Small delay to ensure screen dimensions are updated
-            setTimeout(updateLayoutInfo, 100);
-        });
-        // Initial update
-        updateLayoutInfo();
-        return () => {
-            window.removeEventListener('resize', updateLayoutInfo);
-            window.removeEventListener('orientationchange', updateLayoutInfo);
-        };
-    }, [forceLayoutMode]);
-    return layoutInfo;
-}
-//# sourceMappingURL=useResponsiveLayout.js.map

package/lib-commonjs/hooks/useResponsiveLayout.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"useResponsiveLayout.js","sourceRoot":"","sources":["../../src/hooks/useResponsiveLayout.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;AA6HH,kDA2EC;AAtMD,iCAA4C;AAkD5C;;GAEG;AACH,MAAM,WAAW,GAAG;IAClB,MAAM,EAAE,GAAG;IACX,MAAM,EAAE,IAAI;IACZ,WAAW,EAAE,GAAG;CACR,CAAC;AAEX;;GAEG;AACH,SAAS,kBAAkB;IACzB,OAAO,CACL,cAAc,IAAI,MAAM;QACxB,SAAS,CAAC,cAAc,GAAG,CAAC;QAC5B,CAAE,SAAsD,CAAC,gBAAgB,IAAI,CAAC,CAAC,GAAG,CAAC,CACpF,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAC,KAAa,EAAE,MAAc,EAAE,OAAgB;IAC1E,IAAI,KAAK,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;QAChC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,IAAI,KAAK,IAAI,WAAW,CAAC,MAAM,IAAI,OAAO,EAAE,CAAC;QAC3C,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,SAAS,yBAAyB,CAChC,UAAsB,EACtB,WAA8B,EAC9B,KAAa,EACb,MAAc,EACd,OAAgB;IAEhB,uDAAuD;IACvD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;IACxC,CAAC;IAED,gDAAgD;IAChD,IAAI,UAAU,KAAK,QAAQ,IAAI,WAAW,KAAK,UAAU,EAAE,CAAC;QAC1D,OAAO,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC;IACnD,CAAC;IAED,yDAAyD;IACzD,IAAI,UAAU,KAAK,QAAQ,IAAI,WAAW,KAAK,WAAW,EAAE,CAAC;QAC3D,OAAO,MAAM,IAAI,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;IACnE,CAAC;IAED,yDAAyD;IACzD,IAAI,UAAU,KAAK,QAAQ,EAAE,CAAC;QAC5B,OAAO,WAAW,KAAK,UAAU,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC;IACjE,CAAC;IACD,wFAAwF;IACxF,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,SAAgB,mBAAmB,CAAC,eAAkC;IACpE,MAAM,CAAC,UAAU,EAAE,aAAa,CAAC,GAAG,IAAA,gBAAQ,EAAwB,GAAG,EAAE;QACvE,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC;QAChC,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,CAAC;QAClC,MAAM,aAAa,GAAG,kBAAkB,EAAE,CAAC;QAC3C,MAAM,WAAW,GAAsB,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC;QACjF,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;QACrE,MAAM,gBAAgB,GACpB,eAAe,IAAI,yBAAyB,CAAC,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;QAEtG,OAAO;YACL,UAAU;YACV,WAAW;YACX,gBAAgB;YAChB,WAAW,EAAE,KAAK;YAClB,YAAY,EAAE,MAAM;YACpB,aAAa;YACb,aAAa,EAAE,KAAK,IAAI,WAAW,CAAC,MAAM;YAC1C,sBAAsB,EACpB,KAAK,IAAI,GAAG,IAAI,CAAC,WAAW,KAAK,WAAW,IAAI,MAAM,IAAI,WAAW,CAAC,WAAW,CAAC;SACrF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAA,iBAAS,EAAC,GAAG,EAAE;QACb,kDAAkD;QAClD,IAAI,eAAe,EAAE,CAAC;YACpB,OAAO;QACT,CAAC;QAED,SAAS,gBAAgB;YACvB,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC;YAChC,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,CAAC;YAClC,MAAM,aAAa,GAAG,kBAAkB,EAAE,CAAC;YAC3C,MAAM,WAAW,GAAsB,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC;YACjF,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;YACrE,MAAM,gBAAgB,GAAG,yBAAyB,CAChD,UAAU,EACV,WAAW,EACX,KAAK,EACL,MAAM,EACN,aAAa,CACd,CAAC;YAEF,aAAa,CAAC;gBACZ,UAAU;gBACV,WAAW;gBACX,gBAAgB;gBAChB,WAAW,EAAE,KAAK;gBAClB,YAAY,EAAE,MAAM;gBACpB,aAAa;gBACb,aAAa,EAAE,KAAK,IAAI,WAAW,CAAC,MAAM;gBAC1C,sBAAsB,EACpB,KAAK,IAAI,GAAG,IAAI,CAAC,WAAW,KAAK,WAAW,IAAI,MAAM,IAAI,WAAW,CAAC,WAAW,CAAC;aACrF,CAAC,CAAC;QACL,CAAC;QAED,mBAAmB;QACnB,MAAM,CAAC,gBAAgB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;QAEpD,+BAA+B;QAC/B,MAAM,CAAC,gBAAgB,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAChD,sDAAsD;YACtD,UAAU,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,iBAAiB;QACjB,gBAAgB,EAAE,CAAC;QAEnB,OAAO,GAAG,EAAE;YACV,MAAM,CAAC,mBAAmB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;YACvD,MAAM,CAAC,mBAAmB,CAAC,mBAAmB,EAAE,gBAAgB,CAAC,CAAC;QACpE,CAAC,CAAC;IACJ,CAAC,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC;IAEtB,OAAO,UAAU,CAAC;AACpB,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 { useState, useEffect } from 'react';\n\n/**\n * Device type detection result\n * @public\n */\nexport type DeviceType = 'mobile' | 'tablet' | 'desktop';\n\n/**\n * Screen orientation\n * @public\n */\nexport type ScreenOrientation = 'portrait' | 'landscape';\n\n/**\n * Layout mode for dual keypad\n * @public\n */\nexport type KeypadLayoutMode = 'side-by-side' | 'stacked' | 'overlay' | 'hidden';\n\n/**\n * Responsive layout information\n * @public\n */\nexport interface IResponsiveLayoutInfo {\n  /** Device type based on screen size and touch capability */\n  readonly deviceType: DeviceType;\n\n  /** Current screen orientation */\n  readonly orientation: ScreenOrientation;\n\n  /** Recommended keypad layout mode */\n  readonly keypadLayoutMode: KeypadLayoutMode;\n\n  /** Screen width in pixels */\n  readonly screenWidth: number;\n\n  /** Screen height in pixels */\n  readonly screenHeight: number;\n\n  /** Whether touch is supported */\n  readonly isTouchDevice: boolean;\n\n  /** Whether the screen is considered small */\n  readonly isSmallScreen: boolean;\n\n  /** Whether the screen has enough space for dual keypads */\n  readonly hasSpaceForDualKeypads: boolean;\n}\n\n/**\n * Breakpoints for responsive design\n */\nconst BREAKPOINTS = {\n  mobile: 768,\n  tablet: 1024,\n  smallHeight: 600\n} as const;\n\n/**\n * Detect if device supports touch\n */\nfunction detectTouchSupport(): boolean {\n  return (\n    'ontouchstart' in window ||\n    navigator.maxTouchPoints > 0 ||\n    ((navigator as unknown as { msMaxTouchPoints?: number }).msMaxTouchPoints ?? 0) > 0\n  );\n}\n\n/**\n * Determine device type based on screen size and touch capability\n */\nfunction determineDeviceType(width: number, height: number, isTouch: boolean): DeviceType {\n  if (width <= BREAKPOINTS.mobile) {\n    return 'mobile';\n  }\n\n  if (width <= BREAKPOINTS.tablet && isTouch) {\n    return 'tablet';\n  }\n\n  return 'desktop';\n}\n\n/**\n * Determine optimal keypad layout mode\n */\nfunction determineKeypadLayoutMode(\n  deviceType: DeviceType,\n  orientation: ScreenOrientation,\n  width: number,\n  height: number,\n  isTouch: boolean\n): KeypadLayoutMode {\n  // Desktop: show overlay on demand or hidden by default\n  if (deviceType === 'desktop') {\n    return isTouch ? 'overlay' : 'hidden';\n  }\n\n  // Mobile portrait: side-by-side if width allows\n  if (deviceType === 'mobile' && orientation === 'portrait') {\n    return width >= 360 ? 'side-by-side' : 'stacked';\n  }\n\n  // Mobile landscape: stacked beside grid if height allows\n  if (deviceType === 'mobile' && orientation === 'landscape') {\n    return height >= BREAKPOINTS.smallHeight ? 'stacked' : 'overlay';\n  }\n\n  // Tablet: side-by-side in portrait, stacked in landscape\n  if (deviceType === 'tablet') {\n    return orientation === 'portrait' ? 'side-by-side' : 'stacked';\n  }\n  /* c8 ignore next 2 - defense in depth: all device types are explicitly handled above */\n  return 'overlay';\n}\n\n/**\n * Hook to detect responsive layout information for optimal keypad display\n * @param forceLayoutMode - Optional layout mode override for testing\n * @public\n */\nexport function useResponsiveLayout(forceLayoutMode?: KeypadLayoutMode): IResponsiveLayoutInfo {\n  const [layoutInfo, setLayoutInfo] = useState<IResponsiveLayoutInfo>(() => {\n    const width = window.innerWidth;\n    const height = window.innerHeight;\n    const isTouchDevice = detectTouchSupport();\n    const orientation: ScreenOrientation = width > height ? 'landscape' : 'portrait';\n    const deviceType = determineDeviceType(width, height, isTouchDevice);\n    const keypadLayoutMode =\n      forceLayoutMode ?? determineKeypadLayoutMode(deviceType, orientation, width, height, isTouchDevice);\n\n    return {\n      deviceType,\n      orientation,\n      keypadLayoutMode,\n      screenWidth: width,\n      screenHeight: height,\n      isTouchDevice,\n      isSmallScreen: width <= BREAKPOINTS.mobile,\n      hasSpaceForDualKeypads:\n        width >= 480 || (orientation === 'landscape' && height >= BREAKPOINTS.smallHeight)\n    };\n  });\n\n  useEffect(() => {\n    // Don't set up listeners if layout mode is forced\n    if (forceLayoutMode) {\n      return;\n    }\n\n    function updateLayoutInfo(): void {\n      const width = window.innerWidth;\n      const height = window.innerHeight;\n      const isTouchDevice = detectTouchSupport();\n      const orientation: ScreenOrientation = width > height ? 'landscape' : 'portrait';\n      const deviceType = determineDeviceType(width, height, isTouchDevice);\n      const keypadLayoutMode = determineKeypadLayoutMode(\n        deviceType,\n        orientation,\n        width,\n        height,\n        isTouchDevice\n      );\n\n      setLayoutInfo({\n        deviceType,\n        orientation,\n        keypadLayoutMode,\n        screenWidth: width,\n        screenHeight: height,\n        isTouchDevice,\n        isSmallScreen: width <= BREAKPOINTS.mobile,\n        hasSpaceForDualKeypads:\n          width >= 480 || (orientation === 'landscape' && height >= BREAKPOINTS.smallHeight)\n      });\n    }\n\n    // Update on resize\n    window.addEventListener('resize', updateLayoutInfo);\n\n    // Update on orientation change\n    window.addEventListener('orientationchange', () => {\n      // Small delay to ensure screen dimensions are updated\n      setTimeout(updateLayoutInfo, 100);\n    });\n\n    // Initial update\n    updateLayoutInfo();\n\n    return () => {\n      window.removeEventListener('resize', updateLayoutInfo);\n      window.removeEventListener('orientationchange', updateLayoutInfo);\n    };\n  }, [forceLayoutMode]);\n\n  return layoutInfo;\n}\n"]}