@fgv/ts-sudoku-lib 2.0.2-alpha.0

package/lib/packlets/common/puzzleSession.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"puzzleSession.js","sourceRoot":"","sources":["../../../src/packlets/common/puzzleSession.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;AAEH,4CAAqE;AACrE,iCAA8B;AAC9B,iCAA8B;AAE9B,+BAA4B;AAS5B;;;GAGG;AACH,MAAa,aAAa;IAWxB;;OAEG;IACH,YAAsB,MAAc;QAClC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC;QACjC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,IAAW,EAAE;QACX,OAAO,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,IAAW,KAAK;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,IAAW,KAAK;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;;OAGG;IACH,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;IACzC,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,MAAM,CAAC,MAAc;QACjC,OAAO,IAAA,wBAAa,EAAC,GAAG,EAAE,CAAC,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;IACxD,CAAC;IAED;;;;OAIG;IACI,aAAa;QAClB,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACI,YAAY;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED;;;OAGG;IACI,aAAa;QAClB,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChD,CAAC;IAED;;;OAGG;IACI,eAAe;QACpB,OAAO,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC;IAED;;;;;OAKG;IACI,WAAW,CAAC,IAAiC;;QAClD,OAAO,CAAA,MAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,0CAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,MAAK,IAAI,CAAC;IACxD,CAAC;IAED;;;;;OAKG;IACI,YAAY,CAAC,IAAiC;;QACnD,OAAO,CAAA,MAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,0CAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,MAAK,IAAI,CAAC;IACzD,CAAC;IAED;;;;;;OAMG;IACI,cAAc,CAAC,IAAiC,EAAE,KAAa;;QACpE,OAAO,CAAA,MAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,0CAAE,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAK,IAAI,CAAC;IACpE,CAAC;IAED;;;;;;;OAOG;IACI,eAAe,CACpB,IAAiC,EACjC,SAA8B,EAC9B,IAAoB;QAEpB,OAAO,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;IAC7D,CAAC;IAED;;;;;;OAMG;IACI,eAAe,CAAC,IAAyB;QAC9C,OAAO,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACxD,CAAC;IAED;;;;;;OAMG;IACI,eAAe,CAAC,IAAiC,EAAE,KAAyB;QACjF,MAAM,QAAQ,GAAG,SAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,OAAO,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE;YAC/B,MAAM,KAAK,GAAa,EAAE,CAAC;YAC3B,MAAM,MAAM,GAAe,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YAChD,OAAO,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE;gBACxE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC5B,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC;gBACvB,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;YACvB,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACI,eAAe,CAAC,IAAiC,EAAE,KAAe;QACvE,MAAM,QAAQ,GAAG,SAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,OAAO,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE;YAC/B,MAAM,KAAK,GAAG,SAAS,CAAC;YACxB,MAAM,MAAM,GAAe,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YAChD,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE;gBACvE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC5B,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC;gBACvB,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;YACvB,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACI,WAAW,CAAC,OAAqB;QACtC,OAAO,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE;YAC3E,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC;YACvB,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;QACvB,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;OAOG;IACI,iBAAiB,CAAC,IAAoB,EAAE,KAAa;;QAC1D,OAAO,CAAA,MAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,0CAAE,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAK,IAAI,CAAC;IACrE,CAAC;IAED;;;;;OAKG;IACI,mBAAmB,CAAC,IAAoB;;QAC7C,OAAO,MAAA,MAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,0CAAE,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,mCAAI,IAAI,GAAG,EAAU,CAAC;IAC5E,CAAC;IAED;;;;OAIG;IACI,IAAI;QACT,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;YACjB,OAAO,IAAA,eAAI,EAAC,iBAAiB,CAAC,CAAC;SAChC;QAED,OAAO,IAAI,CAAC,OAAO;aAChB,cAAc,CACb,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAC1D,IAAI,CAAC,KAAK,CACX;aACA,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE;YACpB,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC;YACvB,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;QACvB,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACI,IAAI;QACT,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;YACjB,OAAO,IAAA,eAAI,EAAC,iBAAiB,CAAC,CAAC;SAChC;QACD,OAAO,IAAI,CAAC,OAAO;aAChB,cAAc,CACb,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EACpD,IAAI,CAAC,KAAK,CACX;aACA,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE;YACpB,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC;YACvB,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;QACvB,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;OAGG;IACI,SAAS;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC;IAEO,QAAQ,CAAC,OAAsB;QACrC,IAAI,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;YACvC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,OAAO,EAAE,CAAC;SAC7C;aAAM;YACL,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;YAC9B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;SACrC;QACD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;IAClC,CAAC;IAEO,KAAK,CAAC,IAAoB;QAChC,IAAI,IAAI,YAAY,WAAI,EAAE;YACxB,OAAO,IAAI,CAAC;SACb;QACD,OAAO,SAAG,CAAC,MAAM,CAAC,IAAI,CAAC;aACpB,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE;YAChB,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAClC,CAAC,CAAC;aACD,SAAS,EAAE,CAAC;IACjB,CAAC;IAEO,KAAK,CAAC,IAAiC;QAC7C,IAAI,IAAI,YAAY,WAAI,EAAE;YACxB,OAAO,IAAI,CAAC;SACb;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAA2B,CAAC,CAAC,SAAS,EAAE,CAAC;IACvE,CAAC;CACF;AArXD,sCAqXC","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 { Result, captureResult, fail, succeed } from '@fgv/ts-utils';\nimport { Cage } from './cage';\nimport { Cell } from './cell';\nimport { ICellContents, ICellState, IRowColumn, NavigationDirection, NavigationWrap } from './common';\nimport { Ids } from './ids';\nimport { ICage, ICell } from './public';\nimport { ICellUpdate, Puzzle } from './puzzle';\nimport { PuzzleState } from './puzzleState';\n\ninterface IPuzzleStep {\n  updates: ICellUpdate[];\n}\n\n/**\n * Represents a single puzzle session, including puzzle, current state and redo/undo.\n * @public\n */\nexport class PuzzleSession {\n  /**\n   * The current {@link PuzzleState | state} of this puzzle session.\n   */\n  public state: PuzzleState;\n\n  protected readonly _puzzle: Puzzle;\n  protected _nextStep: number;\n  protected _numSteps: number;\n  protected _steps: IPuzzleStep[];\n\n  /**\n   * @internal\n   */\n  protected constructor(puzzle: Puzzle) {\n    this._puzzle = puzzle;\n    this.state = puzzle.initialState;\n    this._nextStep = 0;\n    this._numSteps = 0;\n    this._steps = [];\n  }\n\n  /**\n   * ID of the puzzle being solved.\n   */\n  public get id(): string | undefined {\n    return this._puzzle.id;\n  }\n\n  /**\n   * Description of the puzzle being solved.\n   */\n  public get description(): string {\n    return this._puzzle.description;\n  }\n\n  /**\n   * Number of rows in the puzzle being solved.\n   */\n  public get numRows(): number {\n    return this._puzzle.numRows;\n  }\n\n  /**\n   * Number of columns in the puzzle being solved.\n   */\n  public get numColumns(): number {\n    return this._puzzle.numColumns;\n  }\n\n  /**\n   * The row {@link ICage | cages} in the puzzle being solved.\n   */\n  public get rows(): ICage[] {\n    return this._puzzle.rows;\n  }\n\n  /**\n   * The column {@link ICage | cages} in the puzzle being solved.\n   */\n  public get cols(): ICage[] {\n    return this._puzzle.cols;\n  }\n\n  /**\n   * The section {@link ICage | cages} in the puzzle being solved.\n   */\n  public get sections(): ICage[] {\n    return this._puzzle.sections;\n  }\n\n  /**\n   * All {@link ICage | cages} in the puzzle being solved.\n   */\n  public get cages(): ICage[] {\n    return this._puzzle.cages;\n  }\n\n  /**\n   * The cells {@link ICell | cells} in the puzzle being solved.\n   */\n  public get cells(): ICell[] {\n    return this._puzzle.cells;\n  }\n\n  /**\n   * Index of the next step in this puzzle session.\n   */\n  public get nextStep(): number {\n    return this._nextStep;\n  }\n\n  /**\n   * Number of steps currently elapsed in this puzzle session.  Note\n   * that after undo, `nextStep` will be less than `numSteps`.\n   */\n  public get numSteps(): number {\n    return this._numSteps;\n  }\n\n  /***\n   * Indicates whether undo is currently possible.\n   */\n  public get canUndo(): boolean {\n    return this._nextStep > 0;\n  }\n\n  /**\n   * Indicates whether redo is currently possible.\n   */\n  public get canRedo(): boolean {\n    return this._nextStep < this._numSteps;\n  }\n\n  /**\n   * Creates a new {@link PuzzleSession | puzzle session} from a supplied\n   * {@link Puzzle | puzzle}.\n   * @param puzzle - The {@link Puzzle | puzzle} from which the session is to be\n   * initialized.\n   * @returns `Success` with the requested {@link PuzzleSession | puzzle session},\n   * or `Failure` with details if an error occurs.\n   */\n  public static create(puzzle: Puzzle): Result<PuzzleSession> {\n    return captureResult(() => new PuzzleSession(puzzle));\n  }\n\n  /**\n   * Determines if the puzzle is correctly solved.\n   * @returns `true` if the puzzle is solved, `false` if the puzzle has\n   * empty or invalid cells.\n   */\n  public checkIsSolved(): boolean {\n    return this._puzzle.checkIsSolved(this.state);\n  }\n\n  /**\n   * Determines if the puzzle is valid in its current state.\n   * @returns `true` if all non-empty cells in the puzzle are valid,\n   * or `false` if any cells are invalid.\n   */\n  public checkIsValid(): boolean {\n    return this._puzzle.checkIsValid(this.state);\n  }\n\n  /**\n   * Gets all of the currently empty {@link ICell | cells} in the puzzle.\n   * @returns An array of {@link ICell | ICell} with all empty cells.\n   */\n  public getEmptyCells(): ICell[] {\n    return this._puzzle.getEmptyCells(this.state);\n  }\n\n  /**\n   * Gets all of the currently invalid {@link ICell | cells} in the puzzle.\n   * @returns An array of {@link ICell | ICell} with all invalid cells.\n   */\n  public getInvalidCells(): ICell[] {\n    return this._puzzle.getInvalidCells(this.state);\n  }\n\n  /**\n   * Determines if a cell is valid.\n   * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}\n   * describing the cell to be tested.\n   * @returns `true` if the cell value is valid, `false` if the cell value or the cell itself is invalid.\n   */\n  public cellIsValid(spec: string | IRowColumn | ICell): boolean {\n    return this._cell(spec)?.isValid(this.state) === true;\n  }\n\n  /**\n   * Determines if a cell has a value.\n   * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}\n   * describing the cell to be tested.\n   * @returns `true` if the cell has a value, `false` if the cell is empty or the cell itself is invalid.\n   */\n  public cellHasValue(spec: string | IRowColumn | ICell): boolean {\n    return this._cell(spec)?.hasValue(this.state) === true;\n  }\n\n  /**\n   * Determines if supplied value is valid for a specific cell.\n   * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}\n   * describing the cell to be tested.\n   * @param value - The value to be tested.\n   * @returns `true` if `value` is valid for the requested cell, `false` if the value or the cell itself is invalid.\n   */\n  public isValidForCell(spec: string | IRowColumn | ICell, value: number): boolean {\n    return this._cell(spec)?.isValidValue(value, this.state) === true;\n  }\n\n  /**\n   * Gets the neighbor for a cell in a given direction using specified wrapping rules.\n   * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}\n   * describing the cell to be tested.\n   * @param direction - The direction of the desired neighbor.\n   * @param wrap - Wrapping rules to be applied.\n   * @returns `Success` with the requested {@link ICell | cell}, or `Failure` with details if an error occurs.\n   */\n  public getCellNeighbor(\n    spec: string | IRowColumn | ICell,\n    direction: NavigationDirection,\n    wrap: NavigationWrap\n  ): Result<ICell> {\n    return this._puzzle.getCellNeighbor(spec, direction, wrap);\n  }\n\n  /**\n   * Gets the {@link ICellContents | contents} for a specified cell.\n   * @param spec - A `string` ({@link CellId | CellId}), {@link IRowColumn | RowColumn} or {@link ICell | ICell}\n   * describing the cell to be queried.\n   * @returns `Success` with the {@link ICell | cell description} and {@link ICellContents | cell contents}, or\n   * `Failure` with details if an error occurs.\n   */\n  public getCellContents(spec: string | IRowColumn): Result<{ cell: ICell; contents: ICellContents }> {\n    return this._puzzle.getCellContents(spec, this.state);\n  }\n\n  /**\n   * Updates the value of a cell.\n   * @param spec - A `string`, {@link IRowColumn | row and column}, or {@link ICell | cell} identifying\n   * the cell to be updated.\n   * @param value - A new value for the cell.\n   * @returns `Success` with `this` if the update is applied, `Failure` with details if an error occurs.\n   */\n  public updateCellValue(spec: string | IRowColumn | ICell, value: number | undefined): Result<this> {\n    const idResult = Ids.cellId(spec);\n    return idResult.onSuccess((id) => {\n      const notes: number[] = [];\n      const update: ICellState = { id, value, notes };\n      return this._puzzle.updateValues(update, this.state).onSuccess((update) => {\n        this._addMove(update.cells);\n        this.state = update.to;\n        return succeed(this);\n      });\n    });\n  }\n\n  /**\n   * Updates the notes on a cell.\n   * @param spec - A `string`, {@link IRowColumn | row and column}, or {@link ICell | cell} identifying\n   * the cell to be updated.\n   * @param notes - New notes for the cell.\n   * @returns `Success` with `this` if the update is applied, `Failure` with details if an error occurs.\n   */\n  public updateCellNotes(spec: string | IRowColumn | ICell, notes: number[]): Result<this> {\n    const idResult = Ids.cellId(spec);\n    return idResult.onSuccess((id) => {\n      const value = undefined;\n      const update: ICellState = { id, value, notes };\n      return this._puzzle.updateNotes(update, this.state).onSuccess((update) => {\n        this._addMove(update.cells);\n        this.state = update.to;\n        return succeed(this);\n      });\n    });\n  }\n\n  /**\n   * Updates value & notes for multiple cells.\n   * @param updates - An array of {@link ICellState | cell state} objects, each describing\n   * one cell to be updated.\n   * @returns `Success` with `this` if the updates are applied, `Failure` with details if\n   * an error occurs.\n   */\n  public updateCells(updates: ICellState[]): Result<this> {\n    return this._puzzle.updateContents(updates, this.state).onSuccess((update) => {\n      this._addMove(update.cells);\n      this.state = update.to;\n      return succeed(this);\n    });\n  }\n\n  /**\n   * Determines if some {@link ICage | cage} contains a specific value.\n   * @param spec - A `string` ({@link CageId | CageId}) or {@link ICage | ICage}\n   * indicating the cage to be tested.\n   * @param value - The value to be tested.\n   * @returns `true` if the cage exists and contains the specified value,\n   * `false` otherwise.\n   */\n  public cageContainsValue(spec: string | ICage, value: number): boolean {\n    return this._cage(spec)?.containsValue(value, this.state) === true;\n  }\n\n  /**\n   * Determines the numbers currently present in some cage.\n   * @param spec - A `string` ({@link CageId | CageId}) or {@link ICage | ICage}\n   * indicating the cage to be tested.\n   * @returns A `Set<number>` containing all numbers present in the cage.\n   */\n  public cageContainedValues(spec: string | ICage): Set<number> {\n    return this._cage(spec)?.containedValues(this.state) ?? new Set<number>();\n  }\n\n  /**\n   * Undo a single move in this puzzle session.\n   * @returns `Success` with `this` if the undo is applied, or `Failure`\n   * with details if an error occurs.\n   */\n  public undo(): Result<this> {\n    if (!this.canUndo) {\n      return fail(`nothing to undo`);\n    }\n\n    return this._puzzle\n      .updateContents(\n        this._steps[this._nextStep - 1].updates.map((u) => u.from),\n        this.state\n      )\n      .onSuccess((update) => {\n        this._nextStep--;\n        this.state = update.to;\n        return succeed(this);\n      });\n  }\n\n  /**\n   * Redo a single move in this puzzle session.\n   * @returns `Success` with `this` if the redo is applied, or `Failure`\n   * with details if an error occurs.\n   */\n  public redo(): Result<this> {\n    if (!this.canRedo) {\n      return fail('nothing to redo');\n    }\n    return this._puzzle\n      .updateContents(\n        this._steps[this._nextStep].updates.map((u) => u.to),\n        this.state\n      )\n      .onSuccess((update) => {\n        this._nextStep++;\n        this.state = update.to;\n        return succeed(this);\n      });\n  }\n\n  /**\n   * Gets a string representation of this puzzle, one string\n   * per row.\n   */\n  public toStrings(): string[] {\n    return this._puzzle.toStrings(this.state);\n  }\n\n  private _addMove(updates: ICellUpdate[]): void {\n    if (this._nextStep < this._steps.length) {\n      this._steps[this._nextStep++] = { updates };\n    } else {\n      this._steps.push({ updates });\n      this._nextStep = this._steps.length;\n    }\n    this._numSteps = this._nextStep;\n  }\n\n  private _cage(spec: string | ICage): Cage | undefined {\n    if (spec instanceof Cage) {\n      return spec;\n    }\n    return Ids.cageId(spec)\n      .onSuccess((id) => {\n        return this._puzzle.getCage(id);\n      })\n      .orDefault();\n  }\n\n  private _cell(spec: string | IRowColumn | ICell): Cell | undefined {\n    if (spec instanceof Cell) {\n      return spec;\n    }\n    return this._puzzle.getCell(spec as string | IRowColumn).orDefault();\n  }\n}\n"]}

package/lib/packlets/common/puzzleState.d.ts

@@ -0,0 +1,52 @@
+import { Result } from '@fgv/ts-utils';
+import { CellId, ICellContents, ICellState } from './common';
+/**
+ * @public
+ */
+export declare class PuzzleState {
+    /**
+     * @internal
+     */
+    protected readonly _cells: Map<CellId, ICellContents>;
+    /**
+     * @internal
+     */
+    protected constructor(from: Map<CellId, ICellContents>, updates?: ICellState[]);
+    /**
+     * Constructs a new {@link PuzzleState | PuzzleState}.
+     * @param cells - An array of {@link ICellState | CellState} used to initialize the state.
+     * @returns The new {@link PuzzleState | PuzzleState}.
+     */
+    static create(cells: ICellState[]): Result<PuzzleState>;
+    /**
+     * Convert {@link ICellContents | CellContents} to `[`{@link CellId | CellId}`,` {@link ICellContents | CellContents}`]`
+     * tuple for `Map` construction.
+     * @param states - An array of {@link ICellContents | CellContents} to be converted.
+     * @returns The corresponding array of `[`{@link CellId | CellId}`,` {@link ICellContents | CellContents}`]`
+     * @internal
+     */
+    protected static _toEntries(states?: ICellState[]): [CellId, ICellContents][];
+    /**
+     * Gets the contents of a cell specified by {@link CellId | id}.
+     * @param id - The {@link CellId | id} of the cell to be retrieved.
+     * @returns A {@link ICellContents | CellContents} with the contents of
+     * the requested cell.
+     */
+    getCellContents(id: CellId): Result<ICellContents>;
+    /**
+     * Determines if some cell has an assigned value.
+     * @param id - The {@link CellId | id} of the cell to be tested.
+     * @returns `true` if the cell has a value, `false` if the cell
+     * is empty or invalid.
+     */
+    hasValue(id: CellId): boolean;
+    /**
+     * Creates a new {@link PuzzleState | PuzzleState} which corresponds
+     * to this state with updates applied.
+     * @param updates - An array of {@link ICellState | CellState} to be
+     * applied.
+     * @returns A new {@link PuzzleState} with updates applied.
+     */
+    update(updates: ICellState[]): Result<PuzzleState>;
+}
+//# sourceMappingURL=puzzleState.d.ts.map

package/lib/packlets/common/puzzleState.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"puzzleState.d.ts","sourceRoot":"","sources":["../../../src/packlets/common/puzzleState.ts"],"names":[],"mappings":"AAwBA,OAAO,EAAE,MAAM,EAAiB,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AAE7D;;GAEG;AACH,qBAAa,WAAW;IACtB;;OAEG;IACH,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IAEtD;;OAEG;IACH,SAAS,aAAa,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,EAAE,OAAO,CAAC,EAAE,UAAU,EAAE;IAK9E;;;;OAIG;WACW,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC;IAI9D;;;;;;OAMG;IACH,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,EAAE;IAW7E;;;;;OAKG;IACI,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;IAKzD;;;;;OAKG;IACI,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAKpC;;;;;;OAMG;IACI,MAAM,CAAC,OAAO,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC;CAO1D"}

package/lib/packlets/common/puzzleState.js

@@ -0,0 +1,100 @@
+"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.PuzzleState = void 0;
+const ts_utils_1 = require("@fgv/ts-utils");
+/**
+ * @public
+ */
+class PuzzleState {
+    /**
+     * @internal
+     */
+    constructor(from, updates) {
+        const entries = [...Array.from(from.entries()), ...PuzzleState._toEntries(updates)];
+        this._cells = new Map(entries);
+    }
+    /**
+     * Constructs a new {@link PuzzleState | PuzzleState}.
+     * @param cells - An array of {@link ICellState | CellState} used to initialize the state.
+     * @returns The new {@link PuzzleState | PuzzleState}.
+     */
+    static create(cells) {
+        return (0, ts_utils_1.succeed)(new PuzzleState(new Map(), cells));
+    }
+    /**
+     * Convert {@link ICellContents | CellContents} to `[`{@link CellId | CellId}`,` {@link ICellContents | CellContents}`]`
+     * tuple for `Map` construction.
+     * @param states - An array of {@link ICellContents | CellContents} to be converted.
+     * @returns The corresponding array of `[`{@link CellId | CellId}`,` {@link ICellContents | CellContents}`]`
+     * @internal
+     */
+    static _toEntries(states) {
+        /* c8 ignore next 3 - defense in depth */
+        if (!states) {
+            return [];
+        }
+        return states.map((state) => {
+            const { id, value, notes } = state;
+            return [id, { value, notes }];
+        });
+    }
+    /**
+     * Gets the contents of a cell specified by {@link CellId | id}.
+     * @param id - The {@link CellId | id} of the cell to be retrieved.
+     * @returns A {@link ICellContents | CellContents} with the contents of
+     * the requested cell.
+     */
+    getCellContents(id) {
+        const cell = this._cells.get(id);
+        return cell ? (0, ts_utils_1.succeed)(cell) : (0, ts_utils_1.fail)(`cell ${id} not found`);
+    }
+    /**
+     * Determines if some cell has an assigned value.
+     * @param id - The {@link CellId | id} of the cell to be tested.
+     * @returns `true` if the cell has a value, `false` if the cell
+     * is empty or invalid.
+     */
+    hasValue(id) {
+        const cell = this._cells.get(id);
+        return (cell === null || cell === void 0 ? void 0 : cell.value) !== undefined;
+    }
+    /**
+     * Creates a new {@link PuzzleState | PuzzleState} which corresponds
+     * to this state with updates applied.
+     * @param updates - An array of {@link ICellState | CellState} to be
+     * applied.
+     * @returns A new {@link PuzzleState} with updates applied.
+     */
+    update(updates) {
+        const updated = new PuzzleState(this._cells, updates);
+        if (updated._cells.size > this._cells.size) {
+            return (0, ts_utils_1.fail)(`update added cells`);
+        }
+        return (0, ts_utils_1.succeed)(updated);
+    }
+}
+exports.PuzzleState = PuzzleState;
+//# sourceMappingURL=puzzleState.js.map

package/lib/packlets/common/puzzleState.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"puzzleState.js","sourceRoot":"","sources":["../../../src/packlets/common/puzzleState.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;AAEH,4CAAsD;AAGtD;;GAEG;AACH,MAAa,WAAW;IAMtB;;OAEG;IACH,YAAsB,IAAgC,EAAE,OAAsB;QAC5E,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,GAAG,WAAW,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;QACpF,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,MAAM,CAAC,KAAmB;QACtC,OAAO,IAAA,kBAAO,EAAC,IAAI,WAAW,CAAC,IAAI,GAAG,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;IACpD,CAAC;IAED;;;;;;OAMG;IACO,MAAM,CAAC,UAAU,CAAC,MAAqB;QAC/C,yCAAyC;QACzC,IAAI,CAAC,MAAM,EAAE;YACX,OAAO,EAAE,CAAC;SACX;QACD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YAC1B,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;YACnC,OAAO,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACI,eAAe,CAAC,EAAU;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAA,eAAI,EAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;IAC7D,CAAC;IAED;;;;;OAKG;IACI,QAAQ,CAAC,EAAU;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,OAAO,CAAA,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,KAAK,MAAK,SAAS,CAAC;IACnC,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,OAAqB;QACjC,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACtD,IAAI,OAAO,CAAC,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE;YAC1C,OAAO,IAAA,eAAI,EAAC,oBAAoB,CAAC,CAAC;SACnC;QACD,OAAO,IAAA,kBAAO,EAAC,OAAO,CAAC,CAAC;IAC1B,CAAC;CACF;AA7ED,kCA6EC","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 { Result, fail, succeed } from '@fgv/ts-utils';\nimport { CellId, ICellContents, ICellState } from './common';\n\n/**\n * @public\n */\nexport class PuzzleState {\n  /**\n   * @internal\n   */\n  protected readonly _cells: Map<CellId, ICellContents>;\n\n  /**\n   * @internal\n   */\n  protected constructor(from: Map<CellId, ICellContents>, updates?: ICellState[]) {\n    const entries = [...Array.from(from.entries()), ...PuzzleState._toEntries(updates)];\n    this._cells = new Map(entries);\n  }\n\n  /**\n   * Constructs a new {@link PuzzleState | PuzzleState}.\n   * @param cells - An array of {@link ICellState | CellState} used to initialize the state.\n   * @returns The new {@link PuzzleState | PuzzleState}.\n   */\n  public static create(cells: ICellState[]): Result<PuzzleState> {\n    return succeed(new PuzzleState(new Map(), cells));\n  }\n\n  /**\n   * Convert {@link ICellContents | CellContents} to `[`{@link CellId | CellId}`,` {@link ICellContents | CellContents}`]`\n   * tuple for `Map` construction.\n   * @param states - An array of {@link ICellContents | CellContents} to be converted.\n   * @returns The corresponding array of `[`{@link CellId | CellId}`,` {@link ICellContents | CellContents}`]`\n   * @internal\n   */\n  protected static _toEntries(states?: ICellState[]): [CellId, ICellContents][] {\n    /* c8 ignore next 3 - defense in depth */\n    if (!states) {\n      return [];\n    }\n    return states.map((state) => {\n      const { id, value, notes } = state;\n      return [id, { value, notes }];\n    });\n  }\n\n  /**\n   * Gets the contents of a cell specified by {@link CellId | id}.\n   * @param id - The {@link CellId | id} of the cell to be retrieved.\n   * @returns A {@link ICellContents | CellContents} with the contents of\n   * the requested cell.\n   */\n  public getCellContents(id: CellId): Result<ICellContents> {\n    const cell = this._cells.get(id);\n    return cell ? succeed(cell) : fail(`cell ${id} not found`);\n  }\n\n  /**\n   * Determines if some cell has an assigned value.\n   * @param id - The {@link CellId | id} of the cell to be tested.\n   * @returns `true` if the cell has a value, `false` if the cell\n   * is empty or invalid.\n   */\n  public hasValue(id: CellId): boolean {\n    const cell = this._cells.get(id);\n    return cell?.value !== undefined;\n  }\n\n  /**\n   * Creates a new {@link PuzzleState | PuzzleState} which corresponds\n   * to this state with updates applied.\n   * @param updates - An array of {@link ICellState | CellState} to be\n   * applied.\n   * @returns A new {@link PuzzleState} with updates applied.\n   */\n  public update(updates: ICellState[]): Result<PuzzleState> {\n    const updated = new PuzzleState(this._cells, updates);\n    if (updated._cells.size > this._cells.size) {\n      return fail(`update added cells`);\n    }\n    return succeed(updated);\n  }\n}\n"]}

package/lib/packlets/file/converters.d.ts

@@ -0,0 +1,17 @@
+import { Converter, Result } from '@fgv/ts-utils';
+import { IPuzzlesFile } from './model';
+/**
+ * Converts an arbitrary object to a {@link Data.Model.PuzzlesFile | PuzzlesFile}.
+ * @public
+ */
+export declare const puzzlesFile: Converter<IPuzzlesFile>;
+/**
+ * Loads an arbitrary JSON file and parses it to return a validated
+ * {@link Data.Model.PuzzlesFile | PuzzlesFile}.
+ * @param path - String path to the file
+ * @returns `Success` with the resulting file, or `Failure` with details if an
+ * error occurs.
+ * @public
+ */
+export declare function loadJsonPuzzlesFileSync(path: string): Result<IPuzzlesFile>;
+//# sourceMappingURL=converters.d.ts.map

package/lib/packlets/file/converters.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"converters.d.ts","sourceRoot":"","sources":["../../../src/packlets/file/converters.ts"],"names":[],"mappings":"AAwBA,OAAO,EAAE,SAAS,EAAc,MAAM,EAAE,MAAM,eAAe,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAKvC;;;GAGG;AACH,eAAO,MAAM,WAAW,EAAE,SAAS,CAAC,YAAY,CAE9C,CAAC;AAEH;;;;;;;GAOG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,CAE1E"}

package/lib/packlets/file/converters.js

@@ -0,0 +1,49 @@
+"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.loadJsonPuzzlesFileSync = exports.puzzlesFile = void 0;
+const ts_utils_1 = require("@fgv/ts-utils");
+const ts_json_1 = require("@fgv/ts-json");
+const common_1 = require("../common");
+/**
+ * Converts an arbitrary object to a {@link Data.Model.PuzzlesFile | PuzzlesFile}.
+ * @public
+ */
+exports.puzzlesFile = ts_utils_1.Converters.strictObject({
+    puzzles: ts_utils_1.Converters.arrayOf(common_1.Converters.puzzleDescription)
+});
+/**
+ * Loads an arbitrary JSON file and parses it to return a validated
+ * {@link Data.Model.PuzzlesFile | PuzzlesFile}.
+ * @param path - String path to the file
+ * @returns `Success` with the resulting file, or `Failure` with details if an
+ * error occurs.
+ * @public
+ */
+function loadJsonPuzzlesFileSync(path) {
+    return ts_json_1.File.convertJsonFileSync(path, exports.puzzlesFile);
+}
+exports.loadJsonPuzzlesFileSync = loadJsonPuzzlesFileSync;
+//# sourceMappingURL=converters.js.map

package/lib/packlets/file/converters.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"converters.js","sourceRoot":"","sources":["../../../src/packlets/file/converters.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;AAEH,4CAA8D;AAG9D,0CAAoC;AACpC,sCAA2D;AAE3D;;;GAGG;AACU,QAAA,WAAW,GAA4B,qBAAU,CAAC,YAAY,CAAe;IACxF,OAAO,EAAE,qBAAU,CAAC,OAAO,CAAC,mBAAgB,CAAC,iBAAiB,CAAC;CAChE,CAAC,CAAC;AAEH;;;;;;;GAOG;AACH,SAAgB,uBAAuB,CAAC,IAAY;IAClD,OAAO,cAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,mBAAW,CAAC,CAAC;AACrD,CAAC;AAFD,0DAEC","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 { Converter, Converters, Result } from '@fgv/ts-utils';\nimport { IPuzzlesFile } from './model';\n\nimport { File } from '@fgv/ts-json';\nimport { Converters as CommonConverters } from '../common';\n\n/**\n * Converts an arbitrary object to a {@link Data.Model.PuzzlesFile | PuzzlesFile}.\n * @public\n */\nexport const puzzlesFile: Converter<IPuzzlesFile> = Converters.strictObject<IPuzzlesFile>({\n  puzzles: Converters.arrayOf(CommonConverters.puzzleDescription)\n});\n\n/**\n * Loads an arbitrary JSON file and parses it to return a validated\n * {@link Data.Model.PuzzlesFile | PuzzlesFile}.\n * @param path - String path to the file\n * @returns `Success` with the resulting file, or `Failure` with details if an\n * error occurs.\n * @public\n */\nexport function loadJsonPuzzlesFileSync(path: string): Result<IPuzzlesFile> {\n  return File.convertJsonFileSync(path, puzzlesFile);\n}\n"]}

package/lib/packlets/file/index.d.ts

@@ -0,0 +1,4 @@
+import * as Converters from './converters';
+import * as Model from './model';
+export { Converters, Model };
+//# sourceMappingURL=index.d.ts.map

package/lib/packlets/file/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/packlets/file/index.ts"],"names":[],"mappings":"AAwBA,OAAO,KAAK,UAAU,MAAM,cAAc,CAAC;AAC3C,OAAO,KAAK,KAAK,MAAM,SAAS,CAAC;AAEjC,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC"}

package/lib/packlets/file/index.js

@@ -0,0 +1,54 @@
+"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.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
+    __setModuleDefault(result, mod);
+    return result;
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Model = exports.Converters = void 0;
+const Converters = __importStar(require("./converters"));
+exports.Converters = Converters;
+const Model = __importStar(require("./model"));
+exports.Model = Model;
+//# sourceMappingURL=index.js.map

package/lib/packlets/file/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/packlets/file/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,yDAA2C;AAGlC,gCAAU;AAFnB,+CAAiC;AAEZ,sBAAK","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 * as Converters from './converters';\nimport * as Model from './model';\n\nexport { Converters, Model };\n"]}

package/lib/packlets/file/model.d.ts

@@ -0,0 +1,9 @@
+import { IPuzzleDescription } from '../common';
+/**
+ * Parsed file containing a collection of puzzles.
+ * @public
+ */
+export interface IPuzzlesFile {
+    puzzles: IPuzzleDescription[];
+}
+//# sourceMappingURL=model.d.ts.map

package/lib/packlets/file/model.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.d.ts","sourceRoot":"","sources":["../../../src/packlets/file/model.ts"],"names":[],"mappings":"AAwBA,OAAO,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AAE/C;;;GAGG;AACH,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,kBAAkB,EAAE,CAAC;CAC/B"}

package/lib/packlets/file/model.js

@@ -0,0 +1,26 @@
+"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 });
+//# sourceMappingURL=model.js.map

package/lib/packlets/file/model.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.js","sourceRoot":"","sources":["../../../src/packlets/file/model.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 { IPuzzleDescription } from '../common';\n\n/**\n * Parsed file containing a collection of puzzles.\n * @public\n */\nexport interface IPuzzlesFile {\n  puzzles: IPuzzleDescription[];\n}\n"]}

package/lib/packlets/puzzles/anyPuzzle.d.ts

@@ -0,0 +1,10 @@
+import { Result } from '@fgv/ts-utils';
+import { IPuzzleDescription, Puzzle } from '../common';
+/**
+ * Static class to instantiate any puzzle from a {@link Data.Model.PuzzleDescription | puzzle description}.
+ * @internal
+ */
+export declare class AnyPuzzle {
+    static create(puzzle: IPuzzleDescription): Result<Puzzle>;
+}
+//# sourceMappingURL=anyPuzzle.d.ts.map

package/lib/packlets/puzzles/anyPuzzle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"anyPuzzle.d.ts","sourceRoot":"","sources":["../../../src/packlets/puzzles/anyPuzzle.ts"],"names":[],"mappings":"AAwBA,OAAO,EAAE,MAAM,EAAQ,MAAM,eAAe,CAAC;AAE7C,OAAO,EAAE,kBAAkB,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAKvD;;;GAGG;AACH,qBAAa,SAAS;WACN,MAAM,CAAC,MAAM,EAAE,kBAAkB,GAAG,MAAM,CAAC,MAAM,CAAC;CAajE"}

package/lib/packlets/puzzles/anyPuzzle.js

@@ -0,0 +1,51 @@
+"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.AnyPuzzle = void 0;
+const ts_utils_1 = require("@fgv/ts-utils");
+const killerSudokuPuzzle_1 = require("./killerSudokuPuzzle");
+const sudokuPuzzle_1 = require("./sudokuPuzzle");
+const sudokuXPuzzle_1 = require("./sudokuXPuzzle");
+/**
+ * Static class to instantiate any puzzle from a {@link Data.Model.PuzzleDescription | puzzle description}.
+ * @internal
+ */
+class AnyPuzzle {
+    static create(puzzle) {
+        switch (puzzle.type) {
+            case 'sudoku':
+                return sudokuPuzzle_1.SudokuPuzzle.create(puzzle);
+            case 'sudoku-x':
+                return sudokuXPuzzle_1.SudokuXPuzzle.create(puzzle);
+            case 'killer-sudoku':
+                return killerSudokuPuzzle_1.KillerSudokuPuzzle.create(puzzle);
+            /* c8 ignore next 2 */
+            default:
+                return (0, ts_utils_1.fail)(`Puzzle '${puzzle.description}' unsupported type ${puzzle.type}`);
+        }
+    }
+}
+exports.AnyPuzzle = AnyPuzzle;
+//# sourceMappingURL=anyPuzzle.js.map

package/lib/packlets/puzzles/anyPuzzle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"anyPuzzle.js","sourceRoot":"","sources":["../../../src/packlets/puzzles/anyPuzzle.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;AAEH,4CAA6C;AAG7C,6DAA0D;AAC1D,iDAA8C;AAC9C,mDAAgD;AAEhD;;;GAGG;AACH,MAAa,SAAS;IACb,MAAM,CAAC,MAAM,CAAC,MAA0B;QAC7C,QAAQ,MAAM,CAAC,IAAI,EAAE;YACnB,KAAK,QAAQ;gBACX,OAAO,2BAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACrC,KAAK,UAAU;gBACb,OAAO,6BAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACtC,KAAK,eAAe;gBAClB,OAAO,uCAAkB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC3C,sBAAsB;YACtB;gBACE,OAAO,IAAA,eAAI,EAAC,WAAW,MAAM,CAAC,WAAW,sBAAsB,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;SACjF;IACH,CAAC;CACF;AAdD,8BAcC","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 { Result, fail } from '@fgv/ts-utils';\n\nimport { IPuzzleDescription, Puzzle } from '../common';\nimport { KillerSudokuPuzzle } from './killerSudokuPuzzle';\nimport { SudokuPuzzle } from './sudokuPuzzle';\nimport { SudokuXPuzzle } from './sudokuXPuzzle';\n\n/**\n * Static class to instantiate any puzzle from a {@link Data.Model.PuzzleDescription | puzzle description}.\n * @internal\n */\nexport class AnyPuzzle {\n  public static create(puzzle: IPuzzleDescription): Result<Puzzle> {\n    switch (puzzle.type) {\n      case 'sudoku':\n        return SudokuPuzzle.create(puzzle);\n      case 'sudoku-x':\n        return SudokuXPuzzle.create(puzzle);\n      case 'killer-sudoku':\n        return KillerSudokuPuzzle.create(puzzle);\n      /* c8 ignore next 2 */\n      default:\n        return fail(`Puzzle '${puzzle.description}' unsupported type ${puzzle.type}`);\n    }\n  }\n}\n"]}

package/lib/packlets/puzzles/index.d.ts

@@ -0,0 +1,6 @@
+import { AnyPuzzle as Any } from './anyPuzzle';
+import { KillerSudokuPuzzle as Killer } from './killerSudokuPuzzle';
+import { SudokuPuzzle as Sudoku } from './sudokuPuzzle';
+import { SudokuXPuzzle as SudokuX } from './sudokuXPuzzle';
+export { Any, Killer, Sudoku, SudokuX };
+//# sourceMappingURL=index.d.ts.map

package/lib/packlets/puzzles/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/packlets/puzzles/index.ts"],"names":[],"mappings":"AAwBA,OAAO,EAAE,SAAS,IAAI,GAAG,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EAAE,kBAAkB,IAAI,MAAM,EAAE,MAAM,sBAAsB,CAAC;AACpE,OAAO,EAAE,YAAY,IAAI,MAAM,EAAE,MAAM,gBAAgB,CAAC;AACxD,OAAO,EAAE,aAAa,IAAI,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAE3D,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC"}

package/lib/packlets/puzzles/index.js

@@ -0,0 +1,35 @@
+"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.SudokuX = exports.Sudoku = exports.Killer = exports.Any = void 0;
+const anyPuzzle_1 = require("./anyPuzzle");
+Object.defineProperty(exports, "Any", { enumerable: true, get: function () { return anyPuzzle_1.AnyPuzzle; } });
+const killerSudokuPuzzle_1 = require("./killerSudokuPuzzle");
+Object.defineProperty(exports, "Killer", { enumerable: true, get: function () { return killerSudokuPuzzle_1.KillerSudokuPuzzle; } });
+const sudokuPuzzle_1 = require("./sudokuPuzzle");
+Object.defineProperty(exports, "Sudoku", { enumerable: true, get: function () { return sudokuPuzzle_1.SudokuPuzzle; } });
+const sudokuXPuzzle_1 = require("./sudokuXPuzzle");
+Object.defineProperty(exports, "SudokuX", { enumerable: true, get: function () { return sudokuXPuzzle_1.SudokuXPuzzle; } });
+//# sourceMappingURL=index.js.map

package/lib/packlets/puzzles/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/packlets/puzzles/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;AAEH,2CAA+C;AAKtC,oFALa,qBAAG,OAKb;AAJZ,6DAAoE;AAItD,uFAJiB,uCAAM,OAIjB;AAHpB,iDAAwD;AAGlC,uFAHG,2BAAM,OAGH;AAF5B,mDAA2D;AAE7B,wFAFJ,6BAAO,OAEI","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 { AnyPuzzle as Any } from './anyPuzzle';\nimport { KillerSudokuPuzzle as Killer } from './killerSudokuPuzzle';\nimport { SudokuPuzzle as Sudoku } from './sudokuPuzzle';\nimport { SudokuXPuzzle as SudokuX } from './sudokuXPuzzle';\n\nexport { Any, Killer, Sudoku, SudokuX };\n"]}

package/lib/packlets/puzzles/killerSudokuPuzzle.d.ts

@@ -0,0 +1,14 @@
+import { Result } from '@fgv/ts-utils';
+import { IPuzzleDescription, Puzzle } from '../common';
+/**
+ * @public
+ */
+export declare class KillerSudokuPuzzle extends Puzzle {
+    private constructor();
+    static create(desc: IPuzzleDescription): Result<Puzzle>;
+    private static _getKillerCages;
+    private static _getCageCells;
+    private static _getCages;
+    private static _getKillerCells;
+}
+//# sourceMappingURL=killerSudokuPuzzle.d.ts.map

package/lib/packlets/puzzles/killerSudokuPuzzle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"killerSudokuPuzzle.d.ts","sourceRoot":"","sources":["../../../src/packlets/puzzles/killerSudokuPuzzle.ts"],"names":[],"mappings":"AAwBA,OAAO,EAAE,MAAM,EAAgC,MAAM,eAAe,CAAC;AACrE,OAAO,EAAwB,kBAAkB,EAAO,MAAM,EAAoB,MAAM,WAAW,CAAC;AAIpG;;GAEG;AACH,qBAAa,kBAAmB,SAAQ,MAAM;IAC5C,OAAO;WAIO,MAAM,CAAC,IAAI,EAAE,kBAAkB,GAAG,MAAM,CAAC,MAAM,CAAC;IAmB9D,OAAO,CAAC,MAAM,CAAC,eAAe;IAa9B,OAAO,CAAC,MAAM,CAAC,aAAa;IAuB5B,OAAO,CAAC,MAAM,CAAC,SAAS;IAuCxB,OAAO,CAAC,MAAM,CAAC,eAAe;CAmB/B"}