@fgv/ts-sudoku-ui 5.0.1-2

package/lib/types/index.d.ts

@@ -0,0 +1,234 @@
+import { CellId, ICellContents, NavigationDirection, IPuzzleDefinition, ICage } from '@fgv/ts-sudoku-lib';
+import { KeypadLayoutMode } from '../hooks/useResponsiveLayout';
+/**
+ * Validation error for display in the UI
+ * @public
+ */
+export interface IValidationError {
+    readonly cellId: CellId;
+    readonly type: 'duplicate-row' | 'duplicate-column' | 'duplicate-section' | 'duplicate-diagonal' | 'invalid-value';
+    readonly conflictingCells: CellId[];
+    readonly message: string;
+}
+/**
+ * Props for the main SudokuGridEntry component
+ * @public
+ */
+export interface ISudokuGridEntryProps {
+    /**
+     * Optional initial puzzle session to load. If not provided, an empty puzzle is created.
+     */
+    readonly initialPuzzleDescription?: IPuzzleDefinition;
+    /**
+     * Callback fired when the puzzle state changes
+     */
+    readonly onStateChange?: (isValid: boolean, isSolved: boolean) => void;
+    /**
+     * Callback fired when validation errors occur
+     */
+    readonly onValidationErrors?: (errors: IValidationError[]) => void;
+    /**
+     * Optional CSS class name for styling
+     */
+    readonly className?: string;
+    /**
+     * Optional forced layout mode for testing (overrides responsive detection)
+     */
+    readonly forceLayoutMode?: KeypadLayoutMode;
+}
+/**
+ * Props for the SudokuGrid component
+ * @public
+ */
+export interface ISudokuGridProps {
+    readonly numRows: number;
+    readonly numColumns: number;
+    readonly cells: ICellDisplayInfo[];
+    readonly cages?: ICageDisplayInfo[];
+    readonly selectedCell: CellId | null;
+    readonly selectedCells: CellId[];
+    readonly inputMode: InputMode;
+    readonly puzzleType?: string;
+    readonly puzzleDimensions?: {
+        readonly cageHeightInCells: number;
+        readonly cageWidthInCells: number;
+        readonly boardWidthInCages: number;
+        readonly boardHeightInCages: number;
+        readonly totalRows: number;
+        readonly totalColumns: number;
+        readonly maxValue: number;
+        readonly totalCages: number;
+        readonly basicCageTotal: number;
+    };
+    readonly onCellSelect: (cellId: CellId, event?: React.MouseEvent) => void;
+    readonly onLongPressToggle?: (cellId: CellId, event: React.TouchEvent | React.MouseEvent) => void;
+    readonly onCellValueChange: (cellId: CellId, value: number | undefined) => void;
+    readonly onNoteToggle: (cellId: CellId, note: number) => void;
+    readonly onClearAllNotes: (cellId: CellId) => void;
+    readonly onNavigate: (direction: NavigationDirection) => void;
+    readonly onDragOver?: (cellId: CellId) => void;
+    readonly onDragEnd?: () => void;
+    readonly isDragging?: boolean;
+    readonly className?: string;
+}
+/**
+ * Display information for a single cell
+ * @public
+ */
+export interface ICellDisplayInfo {
+    readonly id: CellId;
+    readonly row: number;
+    readonly column: number;
+    readonly contents: ICellContents;
+    readonly isImmutable: boolean;
+    readonly hasValidationError: boolean;
+}
+/**
+ * Input mode for cell interactions
+ * @public
+ */
+export type InputMode = 'value' | 'notes';
+/**
+ * Props for the SudokuCell component
+ * @public
+ */
+export interface ISudokuCellProps {
+    readonly cellInfo: ICellDisplayInfo;
+    readonly isSelected: boolean;
+    readonly inputMode: InputMode;
+    readonly puzzleDimensions?: {
+        readonly numRows: number;
+        readonly numColumns: number;
+        readonly cageHeight: number;
+        readonly cageWidth: number;
+    };
+    readonly onSelect: (event?: React.MouseEvent) => void;
+    readonly onLongPressToggle?: (event: React.TouchEvent | React.MouseEvent) => void;
+    readonly onValueChange: (value: number | undefined) => void;
+    readonly onNoteToggle: (note: number) => void;
+    readonly onClearAllNotes: () => void;
+    readonly onDragOver?: () => void;
+    readonly className?: string;
+}
+/**
+ * Props for the SudokuControls component
+ * @public
+ */
+export interface ISudokuControlsProps {
+    readonly canUndo: boolean;
+    readonly canRedo: boolean;
+    readonly canReset: boolean;
+    readonly isValid: boolean;
+    readonly isSolved: boolean;
+    readonly onUndo: () => void;
+    readonly onRedo: () => void;
+    readonly onReset: () => void;
+    readonly onExport: () => void;
+    readonly className?: string;
+}
+/**
+ * Props for the ValidationDisplay component
+ * @public
+ */
+export interface IValidationDisplayProps {
+    readonly errors: IValidationError[];
+    readonly isValid: boolean;
+    readonly isSolved: boolean;
+    readonly className?: string;
+}
+/**
+ * Display information for a cage in Killer Sudoku
+ * @public
+ */
+export interface ICageDisplayInfo {
+    readonly cage: ICage;
+    readonly isHighlighted: boolean;
+    readonly currentSum?: number;
+    readonly isComplete: boolean;
+    readonly isValid: boolean;
+}
+/**
+ * Props for the CageOverlay component
+ * @public
+ */
+export interface ICageOverlayProps {
+    readonly cages: ICageDisplayInfo[];
+    readonly gridSize: {
+        width: number;
+        height: number;
+    };
+    readonly cellSize: number;
+    readonly numRows?: number;
+    readonly numColumns?: number;
+    readonly className?: string;
+}
+/**
+ * Props for the CageSumIndicator component
+ * @public
+ */
+export interface ICageSumIndicatorProps {
+    readonly cage: ICage;
+    readonly currentSum?: number;
+    readonly isComplete: boolean;
+    readonly isValid: boolean;
+    readonly position: {
+        top: number;
+        left: number;
+    };
+    readonly className?: string;
+}
+/**
+ * Display mode for killer combinations explorer
+ * @public
+ */
+export type IKillerCombinationsMode = 'panel' | 'modal';
+/**
+ * Display information for a single combination
+ * @public
+ */
+export interface ICombinationDisplayInfo {
+    readonly combination: number[];
+    readonly signature: string;
+    readonly isEliminated: boolean;
+}
+/**
+ * State management for combination elimination
+ * @public
+ */
+export interface IEliminationState {
+    readonly eliminatedSignatures: Set<string>;
+    readonly toggleElimination: (signature: string) => void;
+    readonly clearAll: () => void;
+}
+/**
+ * Props for the KillerCombinationsExplorer component
+ * @public
+ */
+export interface IKillerCombinationsExplorerProps {
+    readonly selectedCage: ICage | null;
+    readonly puzzleId?: string;
+    readonly isOpen: boolean;
+    readonly onClose: () => void;
+    readonly mobileBreakpoint?: number;
+    readonly className?: string;
+}
+/**
+ * Props for the CombinationCard component
+ * @public
+ */
+export interface ICombinationCardProps {
+    readonly combination: ICombinationDisplayInfo;
+    readonly onToggle: (signature: string) => void;
+    readonly className?: string;
+}
+/**
+ * Props for the CombinationGrid component
+ * @public
+ */
+export interface ICombinationGridProps {
+    readonly combinations: ICombinationDisplayInfo[];
+    readonly onToggle: (signature: string) => void;
+    readonly mode: IKillerCombinationsMode;
+    readonly className?: string;
+}
+//# sourceMappingURL=index.d.ts.map

package/lib/types/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/types/index.ts"],"names":[],"mappings":"AAwBA,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAC1G,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAEhE;;;GAGG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EACT,eAAe,GACf,kBAAkB,GAClB,mBAAmB,GACnB,oBAAoB,GACpB,eAAe,CAAC;IACpB,QAAQ,CAAC,gBAAgB,EAAE,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED;;;GAGG;AACH,MAAM,WAAW,qBAAqB;IACpC;;OAEG;IACH,QAAQ,CAAC,wBAAwB,CAAC,EAAE,iBAAiB,CAAC;IAEtD;;OAEG;IACH,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,KAAK,IAAI,CAAC;IAEvE;;OAEG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE,CAAC,MAAM,EAAE,gBAAgB,EAAE,KAAK,IAAI,CAAC;IAEnE;;OAEG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAE5B;;OAEG;IACH,QAAQ,CAAC,eAAe,CAAC,EAAE,gBAAgB,CAAC;CAC7C;AAED;;;GAGG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,KAAK,EAAE,gBAAgB,EAAE,CAAC;IACnC,QAAQ,CAAC,KAAK,CAAC,EAAE,gBAAgB,EAAE,CAAC;IACpC,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IACrC,QAAQ,CAAC,aAAa,EAAE,MAAM,EAAE,CAAC;IACjC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;IAC9B,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,gBAAgB,CAAC,EAAE;QAC1B,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;QACnC,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;QAClC,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;QACnC,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;QACpC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;QAC9B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAC1B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;QAC5B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;KACjC,CAAC;IACF,QAAQ,CAAC,YAAY,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,UAAU,KAAK,IAAI,CAAC;IAC1E,QAAQ,CAAC,iBAAiB,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,KAAK,IAAI,CAAC;IAClG,QAAQ,CAAC,iBAAiB,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,SAAS,KAAK,IAAI,CAAC;IAChF,QAAQ,CAAC,YAAY,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,IAAI,CAAC;IAC9D,QAAQ,CAAC,eAAe,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI,CAAC;IACnD,QAAQ,CAAC,UAAU,EAAE,CAAC,SAAS,EAAE,mBAAmB,KAAK,IAAI,CAAC;IAC9D,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI,CAAC;IAC/C,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,IAAI,CAAC;IAChC,QAAQ,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC;IAC9B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,QAAQ,EAAE,aAAa,CAAC;IACjC,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,QAAQ,CAAC,kBAAkB,EAAE,OAAO,CAAC;CACtC;AAED;;;GAGG;AACH,MAAM,MAAM,SAAS,GAAG,OAAO,GAAG,OAAO,CAAC;AAE1C;;;GAGG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,QAAQ,EAAE,gBAAgB,CAAC;IACpC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;IAC9B,QAAQ,CAAC,gBAAgB,CAAC,EAAE;QAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;QACzB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;QAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;QAC5B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;KAC5B,CAAC;IACF,QAAQ,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,UAAU,KAAK,IAAI,CAAC;IACtD,QAAQ,CAAC,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,KAAK,IAAI,CAAC;IAClF,QAAQ,CAAC,aAAa,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,KAAK,IAAI,CAAC;IAC5D,QAAQ,CAAC,YAAY,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,CAAC;IAC9C,QAAQ,CAAC,eAAe,EAAE,MAAM,IAAI,CAAC;IACrC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,IAAI,CAAC;IACjC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC;IAC5B,QAAQ,CAAC,OAAO,EAAE,MAAM,IAAI,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,MAAM,IAAI,CAAC;IAC9B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,MAAM,EAAE,gBAAgB,EAAE,CAAC;IACpC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;IACrB,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC;IAChC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;CAC3B;AAED;;;GAGG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,KAAK,EAAE,gBAAgB,EAAE,CAAC;IACnC,QAAQ,CAAC,QAAQ,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IACrD,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;IACrB,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;IACjD,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,MAAM,uBAAuB,GAAG,OAAO,GAAG,OAAO,CAAC;AAExD;;;GAGG;AACH,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,YAAY,EAAE,OAAO,CAAC;CAChC;AAED;;;GAGG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,oBAAoB,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3C,QAAQ,CAAC,iBAAiB,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,IAAI,CAAC;IACxD,QAAQ,CAAC,QAAQ,EAAE,MAAM,IAAI,CAAC;CAC/B;AAED;;;GAGG;AACH,MAAM,WAAW,gCAAgC;IAC/C,QAAQ,CAAC,YAAY,EAAE,KAAK,GAAG,IAAI,CAAC;IACpC,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,IAAI,CAAC;IAC7B,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,WAAW,EAAE,uBAAuB,CAAC;IAC9C,QAAQ,CAAC,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,IAAI,CAAC;IAC/C,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,YAAY,EAAE,uBAAuB,EAAE,CAAC;IACjD,QAAQ,CAAC,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,IAAI,CAAC;IAC/C,QAAQ,CAAC,IAAI,EAAE,uBAAuB,CAAC;IACvC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B"}

package/lib/types/index.js

@@ -0,0 +1,25 @@
+/*
+ * 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.
+ */
+export {};
+//# sourceMappingURL=index.js.map

package/lib/types/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/types/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG","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, ICellContents, NavigationDirection, IPuzzleDefinition, ICage } from '@fgv/ts-sudoku-lib';\nimport { KeypadLayoutMode } from '../hooks/useResponsiveLayout';\n\n/**\n * Validation error for display in the UI\n * @public\n */\nexport interface IValidationError {\n  readonly cellId: CellId;\n  readonly type:\n    | 'duplicate-row'\n    | 'duplicate-column'\n    | 'duplicate-section'\n    | 'duplicate-diagonal'\n    | 'invalid-value';\n  readonly conflictingCells: CellId[];\n  readonly message: string;\n}\n\n/**\n * Props for the main SudokuGridEntry component\n * @public\n */\nexport interface ISudokuGridEntryProps {\n  /**\n   * Optional initial puzzle session to load. If not provided, an empty puzzle is created.\n   */\n  readonly initialPuzzleDescription?: IPuzzleDefinition;\n\n  /**\n   * Callback fired when the puzzle state changes\n   */\n  readonly onStateChange?: (isValid: boolean, isSolved: boolean) => void;\n\n  /**\n   * Callback fired when validation errors occur\n   */\n  readonly onValidationErrors?: (errors: IValidationError[]) => void;\n\n  /**\n   * Optional CSS class name for styling\n   */\n  readonly className?: string;\n\n  /**\n   * Optional forced layout mode for testing (overrides responsive detection)\n   */\n  readonly forceLayoutMode?: KeypadLayoutMode;\n}\n\n/**\n * Props for the SudokuGrid component\n * @public\n */\nexport interface ISudokuGridProps {\n  readonly numRows: number;\n  readonly numColumns: number;\n  readonly cells: ICellDisplayInfo[];\n  readonly cages?: ICageDisplayInfo[];\n  readonly selectedCell: CellId | null;\n  readonly selectedCells: CellId[];\n  readonly inputMode: InputMode;\n  readonly puzzleType?: string;\n  readonly puzzleDimensions?: {\n    readonly cageHeightInCells: number;\n    readonly cageWidthInCells: number;\n    readonly boardWidthInCages: number;\n    readonly boardHeightInCages: number;\n    readonly totalRows: number;\n    readonly totalColumns: number;\n    readonly maxValue: number;\n    readonly totalCages: number;\n    readonly basicCageTotal: number;\n  };\n  readonly onCellSelect: (cellId: CellId, event?: React.MouseEvent) => void;\n  readonly onLongPressToggle?: (cellId: CellId, event: React.TouchEvent | React.MouseEvent) => void;\n  readonly onCellValueChange: (cellId: CellId, value: number | undefined) => void;\n  readonly onNoteToggle: (cellId: CellId, note: number) => void;\n  readonly onClearAllNotes: (cellId: CellId) => void;\n  readonly onNavigate: (direction: NavigationDirection) => void;\n  readonly onDragOver?: (cellId: CellId) => void;\n  readonly onDragEnd?: () => void;\n  readonly isDragging?: boolean;\n  readonly className?: string;\n}\n\n/**\n * Display information for a single cell\n * @public\n */\nexport interface ICellDisplayInfo {\n  readonly id: CellId;\n  readonly row: number;\n  readonly column: number;\n  readonly contents: ICellContents;\n  readonly isImmutable: boolean;\n  readonly hasValidationError: boolean;\n}\n\n/**\n * Input mode for cell interactions\n * @public\n */\nexport type InputMode = 'value' | 'notes';\n\n/**\n * Props for the SudokuCell component\n * @public\n */\nexport interface ISudokuCellProps {\n  readonly cellInfo: ICellDisplayInfo;\n  readonly isSelected: boolean;\n  readonly inputMode: InputMode;\n  readonly puzzleDimensions?: {\n    readonly numRows: number;\n    readonly numColumns: number;\n    readonly cageHeight: number;\n    readonly cageWidth: number;\n  };\n  readonly onSelect: (event?: React.MouseEvent) => void;\n  readonly onLongPressToggle?: (event: React.TouchEvent | React.MouseEvent) => void;\n  readonly onValueChange: (value: number | undefined) => void;\n  readonly onNoteToggle: (note: number) => void;\n  readonly onClearAllNotes: () => void;\n  readonly onDragOver?: () => void;\n  readonly className?: string;\n}\n\n/**\n * Props for the SudokuControls component\n * @public\n */\nexport interface ISudokuControlsProps {\n  readonly canUndo: boolean;\n  readonly canRedo: boolean;\n  readonly canReset: boolean;\n  readonly isValid: boolean;\n  readonly isSolved: boolean;\n  readonly onUndo: () => void;\n  readonly onRedo: () => void;\n  readonly onReset: () => void;\n  readonly onExport: () => void;\n  readonly className?: string;\n}\n\n/**\n * Props for the ValidationDisplay component\n * @public\n */\nexport interface IValidationDisplayProps {\n  readonly errors: IValidationError[];\n  readonly isValid: boolean;\n  readonly isSolved: boolean;\n  readonly className?: string;\n}\n\n/**\n * Display information for a cage in Killer Sudoku\n * @public\n */\nexport interface ICageDisplayInfo {\n  readonly cage: ICage;\n  readonly isHighlighted: boolean;\n  readonly currentSum?: number;\n  readonly isComplete: boolean;\n  readonly isValid: boolean;\n}\n\n/**\n * Props for the CageOverlay component\n * @public\n */\nexport interface ICageOverlayProps {\n  readonly cages: ICageDisplayInfo[];\n  readonly gridSize: { width: number; height: number };\n  readonly cellSize: number;\n  readonly numRows?: number;\n  readonly numColumns?: number;\n  readonly className?: string;\n}\n\n/**\n * Props for the CageSumIndicator component\n * @public\n */\nexport interface ICageSumIndicatorProps {\n  readonly cage: ICage;\n  readonly currentSum?: number;\n  readonly isComplete: boolean;\n  readonly isValid: boolean;\n  readonly position: { top: number; left: number };\n  readonly className?: string;\n}\n\n/**\n * Display mode for killer combinations explorer\n * @public\n */\nexport type IKillerCombinationsMode = 'panel' | 'modal';\n\n/**\n * Display information for a single combination\n * @public\n */\nexport interface ICombinationDisplayInfo {\n  readonly combination: number[];\n  readonly signature: string;\n  readonly isEliminated: boolean;\n}\n\n/**\n * State management for combination elimination\n * @public\n */\nexport interface IEliminationState {\n  readonly eliminatedSignatures: Set<string>;\n  readonly toggleElimination: (signature: string) => void;\n  readonly clearAll: () => void;\n}\n\n/**\n * Props for the KillerCombinationsExplorer component\n * @public\n */\nexport interface IKillerCombinationsExplorerProps {\n  readonly selectedCage: ICage | null;\n  readonly puzzleId?: string;\n  readonly isOpen: boolean;\n  readonly onClose: () => void;\n  readonly mobileBreakpoint?: number;\n  readonly className?: string;\n}\n\n/**\n * Props for the CombinationCard component\n * @public\n */\nexport interface ICombinationCardProps {\n  readonly combination: ICombinationDisplayInfo;\n  readonly onToggle: (signature: string) => void;\n  readonly className?: string;\n}\n\n/**\n * Props for the CombinationGrid component\n * @public\n */\nexport interface ICombinationGridProps {\n  readonly combinations: ICombinationDisplayInfo[];\n  readonly onToggle: (signature: string) => void;\n  readonly mode: IKillerCombinationsMode;\n  readonly className?: string;\n}\n"]}

package/lib/utils/CageLookupManager.d.ts

@@ -0,0 +1,74 @@
+import { INeighborAnalysis } from './CagePatternManager';
+/**
+ * Represents a cage cell's segment requirements as a 12-bit mask
+ */
+export interface ISegmentMask {
+    /** 4 bits: Edges (Top, Right, Bottom, Left) */
+    edges: number;
+    /** 4 bits: Corner connectors (TR, BR, BL, TL) */
+    corners: number;
+    /** 4 bits: Internal segments (Top, Right, Bottom, Left) */
+    internals: number;
+}
+/**
+ * Segment bit positions for the 12-bit mask
+ */
+export declare enum SegmentBit {
+    EDGE_TOP = 1,
+    EDGE_RIGHT = 2,
+    EDGE_BOTTOM = 4,
+    EDGE_LEFT = 8,
+    CORNER_TOP_RIGHT = 16,
+    CORNER_BOTTOM_RIGHT = 32,
+    CORNER_BOTTOM_LEFT = 64,
+    CORNER_TOP_LEFT = 128,
+    INTERNAL_TOP = 256,
+    INTERNAL_RIGHT = 512,
+    INTERNAL_BOTTOM = 1024,
+    INTERNAL_LEFT = 2048
+}
+/**
+ * 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)
+ */
+export declare class CageLookupManager {
+    private static _instance;
+    private readonly _neighborToSegmentLookup;
+    private readonly _segmentPatterns;
+    private readonly _segmentMaskToId;
+    private constructor();
+    /**
+     * Get singleton instance
+     */
+    static getInstance(): CageLookupManager;
+    /**
+     * Convert neighbor analysis to 8-bit pattern
+     */
+    neighborsToPattern(neighbors: INeighborAnalysis): number;
+    /**
+     * Get SVG path data for a given neighbor pattern
+     */
+    getPatternSVG(neighborPattern: number): string;
+    /**
+     * Get segment pattern ID for debugging
+     */
+    getSegmentPatternId(neighborPattern: number): number;
+    /**
+     * Get total number of unique segment patterns
+     */
+    get uniquePatternCount(): number;
+    /**
+     * Generate both lookup tables
+     */
+    private _generateLookupTables;
+    /**
+     * Calculate segment mask from 8-bit neighbor pattern
+     */
+    private _calculateSegmentMask;
+    /**
+     * Generate SVG path data for a segment mask
+     */
+    private _generateSVGPattern;
+}
+//# sourceMappingURL=CageLookupManager.d.ts.map

package/lib/utils/CageLookupManager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CageLookupManager.d.ts","sourceRoot":"","sources":["../../src/utils/CageLookupManager.ts"],"names":[],"mappings":"AAwBA,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AAEzD;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,+CAA+C;IAC/C,KAAK,EAAE,MAAM,CAAC;IACd,iDAAiD;IACjD,OAAO,EAAE,MAAM,CAAC;IAChB,2DAA2D;IAC3D,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,oBAAY,UAAU;IAEpB,QAAQ,IAAS;IACjB,UAAU,IAAS;IACnB,WAAW,IAAS;IACpB,SAAS,IAAS;IAGlB,gBAAgB,KAAS;IACzB,mBAAmB,KAAS;IAC5B,kBAAkB,KAAS;IAC3B,eAAe,MAAS;IAGxB,YAAY,MAAS;IACrB,cAAc,MAAS;IACvB,eAAe,OAAU;IACzB,aAAa,OAAU;CACxB;AAED;;;;GAIG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,MAAM,CAAC,SAAS,CAAgC;IAGxD,OAAO,CAAC,QAAQ,CAAC,wBAAwB,CAA4B;IAGrE,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAgB;IAGjD,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAkD;IAEnF,OAAO;IAIP;;OAEG;WACW,WAAW,IAAI,iBAAiB;IAO9C;;OAEG;IACI,kBAAkB,CAAC,SAAS,EAAE,iBAAiB,GAAG,MAAM;IAc/D;;OAEG;IACI,aAAa,CAAC,eAAe,EAAE,MAAM,GAAG,MAAM;IASrD;;OAEG;IACI,mBAAmB,CAAC,eAAe,EAAE,MAAM,GAAG,MAAM;IAI3D;;OAEG;IACH,IAAW,kBAAkB,IAAI,MAAM,CAEtC;IAED;;OAEG;IACH,OAAO,CAAC,qBAAqB;IA2B7B;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAsD7B;;OAEG;IACH,OAAO,CAAC,mBAAmB;CAiH5B"}

package/lib/utils/CageLookupManager.js

@@ -0,0 +1,283 @@
+/*
+ * 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.
+ */
+/**
+ * Segment bit positions for the 12-bit mask
+ */
+export 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 || (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)
+ */
+export 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(' ');
+    }
+}
+//# sourceMappingURL=CageLookupManager.js.map