@ricsam/formula-engine 0.0.15 → 0.0.17

package/dist/cjs/core/managers/workbook-manager.cjs

@@ -112,7 +112,8 @@ class WorkbookManager {
     }
     this.workbooks.set(workbookName, {
       name: workbookName,
-      sheets: new Map
+      sheets: new Map,
+      workbookMetadata: undefined
     });
   }
   removeWorkbook(workbookName) {
@@ -194,7 +195,9 @@ class WorkbookManager {
     const sheet = {
       name: sheetName,
       index: workbook.sheets.size,
-      content: new Map
+      content: new Map,
+      metadata: new Map,
+      sheetMetadata: undefined
     };
     if (workbook.sheets.has(sheet.name)) {
       throw new Error("Sheet already exists");
@@ -266,6 +269,43 @@ class WorkbookManager {
       update(workbook.sheets);
     });
   }
+  updateFormulasExcluding(excludeCellsSet, updateCallback) {
+    this.workbooks.forEach((workbook, workbookName) => {
+      workbook.sheets.forEach((sheet, sheetName) => {
+        sheet.content.forEach((cell, key) => {
+          if (typeof cell === "string" && cell.startsWith("=")) {
+            const { colIndex, rowIndex } = import_utils.parseCellReference(key);
+            const cellKey = `${workbookName}:${sheetName}:${colIndex}:${rowIndex}`;
+            if (excludeCellsSet.has(cellKey)) {
+              return;
+            }
+            const formula = cell.slice(1);
+            const updatedFormula = updateCallback(formula);
+            if (updatedFormula !== formula) {
+              sheet.content.set(key, `=${updatedFormula}`);
+            }
+          }
+        });
+      });
+    });
+  }
+  updateFormulasForWorkbook(workbookName, updateCallback) {
+    const workbook = this.workbooks.get(workbookName);
+    if (!workbook) {
+      throw new import_evaluation_error.WorkbookNotFoundError(workbookName);
+    }
+    workbook.sheets.forEach((sheet) => {
+      sheet.content.forEach((cell, key) => {
+        if (typeof cell === "string" && cell.startsWith("=")) {
+          const formula = cell.slice(1);
+          const updatedFormula = updateCallback(formula);
+          if (updatedFormula !== formula) {
+            sheet.content.set(key, `=${updatedFormula}`);
+          }
+        }
+      });
+    });
+  }
   getSheetSerialized({
     workbookName,
     sheetName
@@ -356,6 +396,64 @@ class WorkbookManager {
       this.addCellToGroups(indexes, address.rowIndex, address.colIndex, adr);
     }
   }
+  setCellMetadata(address, metadata) {
+    const sheet = this.getSheet({
+      workbookName: address.workbookName,
+      sheetName: address.sheetName
+    });
+    if (!sheet) {
+      throw new import_evaluation_error.SheetNotFoundError(address.sheetName);
+    }
+    const key = import_utils.getCellReference(address);
+    if (metadata === undefined) {
+      sheet.metadata.delete(key);
+    } else {
+      sheet.metadata.set(key, metadata);
+    }
+  }
+  getCellMetadata(address) {
+    const sheet = this.getSheet({
+      workbookName: address.workbookName,
+      sheetName: address.sheetName
+    });
+    if (!sheet) {
+      return;
+    }
+    const key = import_utils.getCellReference(address);
+    return sheet.metadata.get(key);
+  }
+  getSheetMetadataSerialized(opts) {
+    const sheet = this.getSheet(opts);
+    return sheet?.metadata || new Map;
+  }
+  setSheetMetadata(opts, metadata) {
+    const sheet = this.getSheet(opts);
+    if (!sheet) {
+      throw new import_evaluation_error.SheetNotFoundError(opts.sheetName);
+    }
+    sheet.sheetMetadata = metadata;
+  }
+  getSheetMetadata(opts) {
+    const sheet = this.getSheet(opts);
+    if (!sheet) {
+      return;
+    }
+    return sheet.sheetMetadata;
+  }
+  setWorkbookMetadata(workbookName, metadata) {
+    const workbook = this.workbooks.get(workbookName);
+    if (!workbook) {
+      throw new Error(`Workbook "${workbookName}" not found`);
+    }
+    workbook.workbookMetadata = metadata;
+  }
+  getWorkbookMetadata(workbookName) {
+    const workbook = this.workbooks.get(workbookName);
+    if (!workbook) {
+      return;
+    }
+    return workbook.workbookMetadata;
+  }
   setSheetContent(opts, newContent) {
     const sheet = this.getSheet(opts);
     if (!sheet) {
@@ -382,11 +480,14 @@ class WorkbookManager {
       throw new import_evaluation_error.SheetNotFoundError(address.sheetName);
     }
     const newContent = new Map(sheet.content);
+    const newMetadata = new Map(sheet.metadata);
     for (const cellAddress of this.iterateCellsInRange(address)) {
       const cellRef = import_utils.getCellReference(cellAddress);
       newContent.delete(cellRef);
+      newMetadata.delete(cellRef);
     }
     this.setSheetContent(address, newContent);
+    sheet.metadata = newMetadata;
   }
   *iterateCellsInRange(address) {
     const sheet = this.getSheet(address);
@@ -471,4 +572,4 @@ class WorkbookManager {
   }
 }
 
-//# debugId=53F111E41968239964756E2164756E21
+//# debugId=E071DA0B5FD7DF7F64756E2164756E21

package/dist/cjs/core/managers/workbook-manager.cjs.map

@@ -2,9 +2,9 @@
   "version": 3,
   "sources": ["../../../../src/core/managers/workbook-manager.ts"],
   "sourcesContent": [
-    "import {\n  FormulaError,\n  type CellAddress,\n  type FiniteSpreadsheetRange,\n  type LocalCellAddress,\n  type SerializedCellValue,\n  type Sheet,\n  type SpreadsheetRange,\n  type Workbook,\n} from \"../types.cjs\";\nimport { getCellReference, parseCellReference } from \"../utils.cjs\";\n\nimport type { RangeAddress } from \"../types.cjs\";\nimport { buildRangeEvalOrder } from \"./range-eval-order-builder.cjs\";\nimport {\n  EvaluationError,\n  SheetNotFoundError,\n  WorkbookNotFoundError,\n} from \"../../evaluator/evaluation-error.cjs\";\nimport { normalizeSerializedCellValue } from \"../../parser/formatter.cjs\";\n\ninterface IndexEntry {\n  number: number;\n  key: string;\n}\n\nexport interface SheetIndexes {\n  // lookup maps - cells grouped by row/column\n  rowGroups: Map<number, IndexEntry[]>; // row number -> cells in that row (sorted by col)\n  colGroups: Map<number, IndexEntry[]>; // col number -> cells in that col (sorted by row)\n\n  // Sorted flat indexes - for finding cells before a given row/col\n  cellsSortedByRow: IndexEntry[];\n  cellsSortedByCol: IndexEntry[];\n}\n\n/**\n * Utility class for binary search operations on IndexEntry arrays\n */\nexport class IndexEntryBinarySearch {\n  /**\n   * Find the insertion point for a number in a sorted IndexEntry array\n   * Returns the index where the number should be inserted to maintain sort order\n   */\n  static findInsertionPoint(entries: IndexEntry[], target: number): number {\n    let left = 0;\n    let right = entries.length;\n\n    while (left < right) {\n      const mid = Math.floor((left + right) / 2);\n      const midEntry = entries[mid];\n      if (midEntry && midEntry.number < target) {\n        left = mid + 1;\n      } else {\n        right = mid;\n      }\n    }\n\n    return left;\n  }\n\n  /**\n   * Find the first element >= target\n   * Returns the index of the first element, or -1 if not found\n   */\n  static findFirstGreaterOrEqual(\n    entries: IndexEntry[],\n    target: number\n  ): number {\n    if (entries.length === 0) return -1;\n\n    let left = 0;\n    let right = entries.length - 1;\n    let result = -1;\n\n    while (left <= right) {\n      const mid = Math.floor((left + right) / 2);\n      const midEntry = entries[mid];\n      if (midEntry && midEntry.number >= target) {\n        result = mid;\n        right = mid - 1;\n      } else {\n        left = mid + 1;\n      }\n    }\n\n    return result;\n  }\n\n  /**\n   * Find the rightmost position where we could insert a target value\n   * Useful for finding elements that come before a target\n   */\n  static findRightmostInsertionPoint(\n    entries: IndexEntry[],\n    target: number\n  ): number {\n    return IndexEntryBinarySearch.findInsertionPoint(entries, target);\n  }\n}\n\nexport class WorkbookManager {\n  private workbooks: Map<string, Workbook> = new Map();\n\n  // Map from \"workbookName|sheetName\" to indexes\n  private sheetIndexes: Map<string, SheetIndexes> = new Map();\n\n  /**\n   * Generate a key for the sheet indexes map\n   */\n  private getSheetIndexKey(workbookName: string, sheetName: string): string {\n    return `${workbookName}|${sheetName}`;\n  }\n\n  /**\n   * Get or create indexes for a sheet\n   */\n  public getSheetIndexes(opts: {\n    workbookName: string;\n    sheetName: string;\n  }): SheetIndexes {\n    const key = this.getSheetIndexKey(opts.workbookName, opts.sheetName);\n    let indexes = this.sheetIndexes.get(key);\n\n    if (!indexes) {\n      indexes = {\n        rowGroups: new Map(),\n        colGroups: new Map(),\n        cellsSortedByRow: [],\n        cellsSortedByCol: [],\n      };\n      this.sheetIndexes.set(key, indexes);\n    }\n\n    return indexes;\n  }\n\n  getSheets(workbookName: string): Map<string, Sheet> {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      throw new WorkbookNotFoundError(workbookName);\n    }\n    return workbook.sheets;\n  }\n\n  getWorkbooks(): Map<string, Workbook> {\n    return this.workbooks;\n  }\n\n  addWorkbook(workbookName: string): void {\n    if (this.workbooks.has(workbookName)) {\n      throw new Error(\"Workbook already exists\");\n    }\n    this.workbooks.set(workbookName, {\n      name: workbookName,\n      sheets: new Map(),\n    });\n  }\n\n  removeWorkbook(workbookName: string): void {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      throw new WorkbookNotFoundError(workbookName);\n    }\n\n    // Clean up indexes for all sheets in this workbook\n    for (const sheetName of workbook.sheets.keys()) {\n      const key = this.getSheetIndexKey(workbookName, sheetName);\n      this.sheetIndexes.delete(key);\n    }\n\n    this.workbooks.delete(workbookName);\n  }\n\n  isContentEmpty(content: SerializedCellValue): boolean {\n    return content === \"\" || content === undefined;\n  }\n\n  renameWorkbook(opts: {\n    workbookName: string;\n    newWorkbookName: string;\n  }): void {\n    const workbook = this.workbooks.get(opts.workbookName);\n    if (!workbook) {\n      throw new Error(\"Workbook not found\");\n    }\n\n    // Update indexes for all sheets in this workbook\n    for (const sheetName of workbook.sheets.keys()) {\n      const oldKey = this.getSheetIndexKey(opts.workbookName, sheetName);\n      const newKey = this.getSheetIndexKey(opts.newWorkbookName, sheetName);\n      const indexes = this.sheetIndexes.get(oldKey);\n      if (indexes) {\n        this.sheetIndexes.set(newKey, indexes);\n        this.sheetIndexes.delete(oldKey);\n      }\n    }\n\n    this.workbooks.set(opts.newWorkbookName, workbook);\n    this.workbooks.delete(opts.workbookName);\n    workbook.name = opts.newWorkbookName;\n  }\n\n  resetWorkbooks(workbooks: Map<string, Workbook>): void {\n    this.workbooks.clear();\n    this.sheetIndexes.clear();\n\n    workbooks.forEach((workbook, workbookName) => {\n      this.workbooks.set(workbookName, workbook);\n      workbook.sheets.forEach((sheet) => {\n        // Initialize indexes for this sheet\n        const indexes = this.getSheetIndexes({\n          workbookName,\n          sheetName: sheet.name,\n        });\n        indexes.rowGroups.clear();\n        indexes.colGroups.clear();\n        indexes.cellsSortedByRow = [];\n        indexes.cellsSortedByCol = [];\n\n        sheet.content.forEach((value, key) => {\n          this.setCellContent(\n            {\n              workbookName,\n              sheetName: sheet.name,\n              colIndex: parseCellReference(key).colIndex,\n              rowIndex: parseCellReference(key).rowIndex,\n            },\n            value,\n            {\n              sheet,\n              buildingFromScratch: true,\n            }\n          );\n        });\n      });\n    });\n  }\n\n  getSheet({\n    workbookName,\n    sheetName,\n  }: {\n    workbookName: string;\n    sheetName: string;\n  }): Sheet | undefined {\n    const workbook = this.workbooks.get(workbookName);\n    const sheet = workbook?.sheets.get(sheetName);\n    return sheet;\n  }\n\n  addSheet({\n    workbookName,\n    sheetName,\n  }: {\n    workbookName: string;\n    sheetName: string;\n  }): Sheet {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      throw new WorkbookNotFoundError(workbookName);\n    }\n    const sheet = {\n      name: sheetName,\n      index: workbook.sheets.size,\n      content: new Map(),\n    };\n\n    if (workbook.sheets.has(sheet.name)) {\n      throw new Error(\"Sheet already exists\");\n    }\n\n    workbook.sheets.set(sheetName, sheet);\n\n    // Initialize empty indexes for this sheet\n    this.getSheetIndexes({ workbookName, sheetName });\n\n    return sheet;\n  }\n\n  removeSheet({\n    workbookName,\n    sheetName,\n  }: {\n    workbookName: string;\n    sheetName: string;\n  }): Sheet {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      throw new WorkbookNotFoundError(workbookName);\n    }\n    const sheet = workbook.sheets.get(sheetName);\n    if (!sheet) {\n      throw new Error(\"Sheet not found\");\n    }\n\n    // Remove the sheet\n    workbook.sheets.delete(sheetName);\n\n    // Clean up indexes for this sheet\n    const key = this.getSheetIndexKey(workbookName, sheetName);\n    this.sheetIndexes.delete(key);\n\n    return sheet;\n  }\n\n  renameSheet({\n    workbookName,\n    sheetName,\n    newSheetName,\n  }: {\n    workbookName: string;\n    sheetName: string;\n    newSheetName: string;\n  }): Sheet {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      throw new WorkbookNotFoundError(workbookName);\n    }\n    const sheet = workbook.sheets.get(sheetName);\n    if (!sheet) {\n      throw new SheetNotFoundError(sheetName);\n    }\n\n    if (workbook.sheets.has(newSheetName)) {\n      throw new Error(\"Sheet with new name already exists\");\n    }\n\n    // Update sheet name\n    sheet.name = newSheetName;\n\n    // Update sheets map\n    workbook.sheets.set(newSheetName, sheet);\n    workbook.sheets.delete(sheetName);\n\n    // Move indexes to new key\n    const oldKey = this.getSheetIndexKey(workbookName, sheetName);\n    const newKey = this.getSheetIndexKey(workbookName, newSheetName);\n    const indexes = this.sheetIndexes.get(oldKey);\n    if (indexes) {\n      this.sheetIndexes.set(newKey, indexes);\n      this.sheetIndexes.delete(oldKey);\n    }\n\n    return sheet;\n  }\n\n  updateAllFormulas(updateCallback: (formula: string) => string): void {\n    const update = (map: Map<string, Sheet>) => {\n      map.forEach((sheet) => {\n        sheet.content.forEach((cell, key) => {\n          if (typeof cell === \"string\" && cell.startsWith(\"=\")) {\n            const formula = cell.slice(1);\n            const updatedFormula = updateCallback(formula);\n\n            // Only update if the formula actually changed\n            if (updatedFormula !== formula) {\n              sheet.content.set(key, `=${updatedFormula}`);\n            }\n          }\n        });\n      });\n    };\n\n    this.workbooks.forEach((workbook) => {\n      update(workbook.sheets);\n    });\n  }\n\n  getSheetSerialized({\n    workbookName,\n    sheetName,\n  }: {\n    workbookName: string;\n    sheetName: string;\n  }): Map<string, SerializedCellValue> {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      throw new WorkbookNotFoundError(workbookName);\n    }\n    const sheet = workbook.sheets.get(sheetName);\n    if (!sheet) {\n      throw new SheetNotFoundError(sheetName);\n    }\n\n    return sheet.content;\n  }\n\n  /**\n   * Add a cell to the grouped indexes\n   */\n  private addCellToGroups(\n    indexes: SheetIndexes,\n    rowIndex: number,\n    colIndex: number,\n    key: string\n  ): void {\n    // Add to row group (cells in this row, sorted by column)\n    let rowGroup = indexes.rowGroups.get(rowIndex);\n    if (!rowGroup) {\n      rowGroup = [];\n      indexes.rowGroups.set(rowIndex, rowGroup);\n    }\n    const colEntry: IndexEntry = { number: colIndex, key };\n    const colInsertIdx = this.findInsertIndex(rowGroup, colIndex);\n    rowGroup.splice(colInsertIdx, 0, colEntry);\n\n    // Add to column group (cells in this column, sorted by row)\n    let colGroup = indexes.colGroups.get(colIndex);\n    if (!colGroup) {\n      colGroup = [];\n      indexes.colGroups.set(colIndex, colGroup);\n    }\n    const rowEntry: IndexEntry = { number: rowIndex, key };\n    const rowInsertIdx = this.findInsertIndex(colGroup, rowIndex);\n    colGroup.splice(rowInsertIdx, 0, rowEntry);\n\n    // Add to sorted flat indexes\n    this.insertSorted(indexes.cellsSortedByRow, { number: rowIndex, key });\n    this.insertSorted(indexes.cellsSortedByCol, { number: colIndex, key });\n  }\n\n  /**\n   * Remove a cell from the grouped indexes\n   */\n  private removeCellFromGroups(\n    indexes: SheetIndexes,\n    rowIndex: number,\n    colIndex: number,\n    key: string\n  ): void {\n    // Remove from row group\n    const rowGroup = indexes.rowGroups.get(rowIndex);\n    if (rowGroup) {\n      const filteredGroup = rowGroup.filter((e) => e.key !== key);\n      if (filteredGroup.length === 0) {\n        indexes.rowGroups.delete(rowIndex);\n      } else {\n        indexes.rowGroups.set(rowIndex, filteredGroup);\n      }\n    }\n\n    // Remove from column group\n    const colGroup = indexes.colGroups.get(colIndex);\n    if (colGroup) {\n      const filteredGroup = colGroup.filter((e) => e.key !== key);\n      if (filteredGroup.length === 0) {\n        indexes.colGroups.delete(colIndex);\n      } else {\n        indexes.colGroups.set(colIndex, filteredGroup);\n      }\n    }\n\n    // Remove from sorted flat indexes\n    indexes.cellsSortedByRow = indexes.cellsSortedByRow.filter(\n      (item) => item.key !== key\n    );\n    indexes.cellsSortedByCol = indexes.cellsSortedByCol.filter(\n      (item) => item.key !== key\n    );\n  }\n\n  /**\n   * Find insertion index in sorted array\n   */\n  private findInsertIndex(entries: IndexEntry[], n: number): number {\n    return IndexEntryBinarySearch.findInsertionPoint(entries, n);\n  }\n\n  /**\n   * Inserts an item into a sorted array by number, maintaining sort order.\n   * If an item with the same number and key already exists, it won't be added again.\n   */\n  private insertSorted(array: IndexEntry[], item: IndexEntry): void {\n    // Check if item already exists (same number and key)\n    const existingIndex = array.findIndex(\n      (existing) => existing.number === item.number && existing.key === item.key\n    );\n\n    if (existingIndex !== -1) {\n      // Item already exists, no need to add it again\n      return;\n    }\n\n    // Find the insertion point using binary search for efficiency\n    const insertionPoint = IndexEntryBinarySearch.findInsertionPoint(\n      array,\n      item.number\n    );\n\n    // Insert at the found position\n    array.splice(insertionPoint, 0, item);\n  }\n\n  setCellContent(\n    address: CellAddress,\n    content: SerializedCellValue,\n    options?: {\n      /**\n       * for extra performance, if the sheet is already known, it can be passed in\n       */\n      sheet?: Sheet;\n      /**\n       * if the sheet is being built from scratch, we can skip some checks\n       */\n      buildingFromScratch?: boolean;\n    }\n  ): void {\n    const sheet =\n      options?.sheet ||\n      this.getSheet({\n        sheetName: address.sheetName,\n        workbookName: address.workbookName,\n      });\n\n    if (!sheet) {\n      throw new SheetNotFoundError(address.sheetName);\n    }\n\n    const indexes = this.getSheetIndexes({\n      workbookName: address.workbookName,\n      sheetName: address.sheetName,\n    });\n    const adr = getCellReference(address);\n\n    if (this.isContentEmpty(content)) {\n      if (!options?.buildingFromScratch) {\n        sheet.content.delete(adr);\n        // Remove from all indexes\n        this.removeCellFromGroups(\n          indexes,\n          address.rowIndex,\n          address.colIndex,\n          adr\n        );\n      }\n    } else {\n      sheet.content.set(adr, content);\n      // Add to all indexes\n      this.addCellToGroups(indexes, address.rowIndex, address.colIndex, adr);\n    }\n  }\n\n  /**\n   * Replace all content for a sheet (safely, without breaking references)\n   * This method clears the existing Map and repopulates it rather than replacing the Map reference\n   */\n  setSheetContent(\n    opts: { sheetName: string; workbookName: string },\n    newContent: Map<string, SerializedCellValue>\n  ): void {\n    const sheet = this.getSheet(opts);\n    if (!sheet) {\n      throw new SheetNotFoundError(opts.sheetName);\n    }\n\n    // Clear existing content without breaking the Map reference\n    sheet.content.clear();\n\n    // Clean up indexes for this sheet\n    const key = this.getSheetIndexKey(opts.workbookName, opts.sheetName);\n    this.sheetIndexes.delete(key);\n\n    // Repopulate with new content\n    newContent.forEach((value, key) => {\n      this.setCellContent(\n        {\n          workbookName: opts.workbookName,\n          sheetName: opts.sheetName,\n          colIndex: parseCellReference(key).colIndex,\n          rowIndex: parseCellReference(key).rowIndex,\n        },\n        value,\n        {\n          sheet,\n          buildingFromScratch: true,\n        }\n      );\n    });\n  }\n\n  /**\n   * Removes the content in the spreadsheet that is inside the range.\n   * OPTIMIZED: Uses indexes to only process cells that actually exist.\n   * ENHANCED: Now supports infinite ranges.\n   */\n  clearSpreadsheetRange(address: RangeAddress) {\n    const sheet = this.getSheet(address);\n\n    if (!sheet) {\n      throw new SheetNotFoundError(address.sheetName);\n    }\n\n    // Get current sheet content and prepare new content with cleared cells\n    const newContent = new Map(sheet.content);\n\n    // Use iterateCellsInRange to only process cells that actually exist\n    // This handles both finite and infinite ranges efficiently\n    for (const cellAddress of this.iterateCellsInRange(address)) {\n      const cellRef = getCellReference(cellAddress);\n\n      // Remove from content\n      newContent.delete(cellRef);\n    }\n\n    // setSheetContent will rebuild indexes from scratch, so no need to manually update them\n    this.setSheetContent(address, newContent);\n  }\n\n  /**\n   * Optimized generator to iterate over cells defined in the content within a range\n   * Uses indexes to efficiently find and yield only cells that exist within the range\n   */\n  *iterateCellsInRange(address: RangeAddress): Generator<CellAddress> {\n    // First check if the sheet exists\n    const sheet = this.getSheet(address);\n    if (!sheet) {\n      throw new SheetNotFoundError(address.sheetName);\n    }\n\n    const indexes = this.getSheetIndexes(address);\n\n    const range = address.range;\n\n    // Use the sorted index to find only rows that actually contain cells\n    // This avoids iterating through empty rows regardless of finite/infinite bounds\n\n    if (range.end.row.type === \"number\") {\n      // Finite bounds: Use binary search to find the range of cells to check\n      const startIndex = IndexEntryBinarySearch.findFirstGreaterOrEqual(\n        indexes.cellsSortedByRow,\n        range.start.row\n      );\n\n      if (startIndex === -1) return; // No cells at or after start row\n\n      // Process cells from startIndex until we exceed the end row\n      for (let i = startIndex; i < indexes.cellsSortedByRow.length; i++) {\n        const cellEntry = indexes.cellsSortedByRow[i];\n        if (!cellEntry) continue;\n\n        const parsed = parseCellReference(cellEntry.key);\n\n        // Stop if we've gone beyond the row range\n        if (parsed.rowIndex > range.end.row.value) break;\n\n        // Check if cell is within column bounds\n        if (parsed.colIndex < range.start.col) continue;\n\n        if (\n          range.end.col.type === \"number\" &&\n          parsed.colIndex > range.end.col.value\n        ) {\n          continue; // Skip this cell but keep checking others in different rows\n        }\n\n        yield {\n          rowIndex: parsed.rowIndex,\n          colIndex: parsed.colIndex,\n          sheetName: address.sheetName,\n          workbookName: address.workbookName,\n        };\n      }\n    } else {\n      // Infinite row bounds: Use binary search to find starting point\n      const startIndex = IndexEntryBinarySearch.findFirstGreaterOrEqual(\n        indexes.cellsSortedByRow,\n        range.start.row\n      );\n\n      if (startIndex === -1) return; // No cells at or after start row\n\n      // Process all cells from startIndex to end\n      for (let i = startIndex; i < indexes.cellsSortedByRow.length; i++) {\n        const cellEntry = indexes.cellsSortedByRow[i];\n        if (!cellEntry) continue;\n\n        const parsed = parseCellReference(cellEntry.key);\n\n        // Check if cell is within column bounds\n        if (parsed.colIndex < range.start.col) continue;\n\n        if (\n          range.end.col.type === \"number\" &&\n          parsed.colIndex > range.end.col.value\n        ) {\n          continue; // Skip this cell but keep checking others in different rows\n        }\n\n        yield {\n          rowIndex: parsed.rowIndex,\n          colIndex: parsed.colIndex,\n          sheetName: address.sheetName,\n          workbookName: address.workbookName,\n        };\n      }\n    }\n  }\n\n  getCellsInRange(address: RangeAddress): CellAddress[] {\n    return Array.from(this.iterateCellsInRange(address));\n  }\n\n  private getCellContent(cellAddress: CellAddress): SerializedCellValue {\n    const sheet = this.getSheet(cellAddress);\n    if (!sheet) {\n      throw new SheetNotFoundError(cellAddress.sheetName);\n    }\n    return sheet.content.get(getCellReference(cellAddress));\n  }\n\n  public getSerializedCellValue(cellAddress: CellAddress): SerializedCellValue {\n    const sheet = this.getSheet(cellAddress);\n    if (!sheet) {\n      throw new SheetNotFoundError(cellAddress.sheetName);\n    }\n    return normalizeSerializedCellValue(\n      sheet.content.get(getCellReference(cellAddress))\n    );\n  }\n\n  public isCellEmpty(cellAddress: CellAddress): boolean {\n    const content = this.getCellContent(cellAddress);\n    return (\n      content === undefined || (typeof content === \"string\" && content === \"\")\n    );\n  }\n  public isFormulaCell(cellAddress: CellAddress): boolean {\n    const content = this.getCellContent(cellAddress);\n    return typeof content === \"string\" && content.startsWith(\"=\");\n  }\n\n  /**\n   * Build evaluation order for a range\n   * Delegates to the buildRangeEvalOrder function\n   */\n  public buildRangeEvalOrder(\n    lookupOrder: \"row-major\" | \"col-major\",\n    lookupRange: RangeAddress\n  ) {\n    // Import and call the function\n    return buildRangeEvalOrder.call(this, lookupOrder, lookupRange);\n  }\n}\n"
+    "import {\n  FormulaError,\n  type CellAddress,\n  type FiniteSpreadsheetRange,\n  type LocalCellAddress,\n  type SerializedCellValue,\n  type Sheet,\n  type SpreadsheetRange,\n  type Workbook,\n} from \"../types.cjs\";\nimport { getCellReference, parseCellReference } from \"../utils.cjs\";\n\nimport type { RangeAddress } from \"../types.cjs\";\nimport { buildRangeEvalOrder } from \"./range-eval-order-builder.cjs\";\nimport {\n  EvaluationError,\n  SheetNotFoundError,\n  WorkbookNotFoundError,\n} from \"../../evaluator/evaluation-error.cjs\";\nimport { normalizeSerializedCellValue } from \"../../parser/formatter.cjs\";\n\ninterface IndexEntry {\n  number: number;\n  key: string;\n}\n\nexport interface SheetIndexes {\n  // lookup maps - cells grouped by row/column\n  rowGroups: Map<number, IndexEntry[]>; // row number -> cells in that row (sorted by col)\n  colGroups: Map<number, IndexEntry[]>; // col number -> cells in that col (sorted by row)\n\n  // Sorted flat indexes - for finding cells before a given row/col\n  cellsSortedByRow: IndexEntry[];\n  cellsSortedByCol: IndexEntry[];\n}\n\n/**\n * Utility class for binary search operations on IndexEntry arrays\n */\nexport class IndexEntryBinarySearch {\n  /**\n   * Find the insertion point for a number in a sorted IndexEntry array\n   * Returns the index where the number should be inserted to maintain sort order\n   */\n  static findInsertionPoint(entries: IndexEntry[], target: number): number {\n    let left = 0;\n    let right = entries.length;\n\n    while (left < right) {\n      const mid = Math.floor((left + right) / 2);\n      const midEntry = entries[mid];\n      if (midEntry && midEntry.number < target) {\n        left = mid + 1;\n      } else {\n        right = mid;\n      }\n    }\n\n    return left;\n  }\n\n  /**\n   * Find the first element >= target\n   * Returns the index of the first element, or -1 if not found\n   */\n  static findFirstGreaterOrEqual(\n    entries: IndexEntry[],\n    target: number\n  ): number {\n    if (entries.length === 0) return -1;\n\n    let left = 0;\n    let right = entries.length - 1;\n    let result = -1;\n\n    while (left <= right) {\n      const mid = Math.floor((left + right) / 2);\n      const midEntry = entries[mid];\n      if (midEntry && midEntry.number >= target) {\n        result = mid;\n        right = mid - 1;\n      } else {\n        left = mid + 1;\n      }\n    }\n\n    return result;\n  }\n\n  /**\n   * Find the rightmost position where we could insert a target value\n   * Useful for finding elements that come before a target\n   */\n  static findRightmostInsertionPoint(\n    entries: IndexEntry[],\n    target: number\n  ): number {\n    return IndexEntryBinarySearch.findInsertionPoint(entries, target);\n  }\n}\n\nexport class WorkbookManager {\n  private workbooks: Map<string, Workbook> = new Map();\n\n  // Map from \"workbookName|sheetName\" to indexes\n  private sheetIndexes: Map<string, SheetIndexes> = new Map();\n\n  /**\n   * Generate a key for the sheet indexes map\n   */\n  private getSheetIndexKey(workbookName: string, sheetName: string): string {\n    return `${workbookName}|${sheetName}`;\n  }\n\n  /**\n   * Get or create indexes for a sheet\n   */\n  public getSheetIndexes(opts: {\n    workbookName: string;\n    sheetName: string;\n  }): SheetIndexes {\n    const key = this.getSheetIndexKey(opts.workbookName, opts.sheetName);\n    let indexes = this.sheetIndexes.get(key);\n\n    if (!indexes) {\n      indexes = {\n        rowGroups: new Map(),\n        colGroups: new Map(),\n        cellsSortedByRow: [],\n        cellsSortedByCol: [],\n      };\n      this.sheetIndexes.set(key, indexes);\n    }\n\n    return indexes;\n  }\n\n  getSheets(workbookName: string): Map<string, Sheet> {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      throw new WorkbookNotFoundError(workbookName);\n    }\n    return workbook.sheets;\n  }\n\n  getWorkbooks(): Map<string, Workbook> {\n    return this.workbooks;\n  }\n\n  addWorkbook(workbookName: string): void {\n    if (this.workbooks.has(workbookName)) {\n      throw new Error(\"Workbook already exists\");\n    }\n    this.workbooks.set(workbookName, {\n      name: workbookName,\n      sheets: new Map(),\n      workbookMetadata: undefined,\n    });\n  }\n\n  removeWorkbook(workbookName: string): void {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      throw new WorkbookNotFoundError(workbookName);\n    }\n\n    // Clean up indexes for all sheets in this workbook\n    for (const sheetName of workbook.sheets.keys()) {\n      const key = this.getSheetIndexKey(workbookName, sheetName);\n      this.sheetIndexes.delete(key);\n    }\n\n    this.workbooks.delete(workbookName);\n  }\n\n  isContentEmpty(content: SerializedCellValue): boolean {\n    return content === \"\" || content === undefined;\n  }\n\n  renameWorkbook(opts: {\n    workbookName: string;\n    newWorkbookName: string;\n  }): void {\n    const workbook = this.workbooks.get(opts.workbookName);\n    if (!workbook) {\n      throw new Error(\"Workbook not found\");\n    }\n\n    // Update indexes for all sheets in this workbook\n    for (const sheetName of workbook.sheets.keys()) {\n      const oldKey = this.getSheetIndexKey(opts.workbookName, sheetName);\n      const newKey = this.getSheetIndexKey(opts.newWorkbookName, sheetName);\n      const indexes = this.sheetIndexes.get(oldKey);\n      if (indexes) {\n        this.sheetIndexes.set(newKey, indexes);\n        this.sheetIndexes.delete(oldKey);\n      }\n    }\n\n    this.workbooks.set(opts.newWorkbookName, workbook);\n    this.workbooks.delete(opts.workbookName);\n    workbook.name = opts.newWorkbookName;\n  }\n\n  resetWorkbooks(workbooks: Map<string, Workbook>): void {\n    this.workbooks.clear();\n    this.sheetIndexes.clear();\n\n    workbooks.forEach((workbook, workbookName) => {\n      this.workbooks.set(workbookName, workbook);\n      workbook.sheets.forEach((sheet) => {\n        // Initialize indexes for this sheet\n        const indexes = this.getSheetIndexes({\n          workbookName,\n          sheetName: sheet.name,\n        });\n        indexes.rowGroups.clear();\n        indexes.colGroups.clear();\n        indexes.cellsSortedByRow = [];\n        indexes.cellsSortedByCol = [];\n\n        sheet.content.forEach((value, key) => {\n          this.setCellContent(\n            {\n              workbookName,\n              sheetName: sheet.name,\n              colIndex: parseCellReference(key).colIndex,\n              rowIndex: parseCellReference(key).rowIndex,\n            },\n            value,\n            {\n              sheet,\n              buildingFromScratch: true,\n            }\n          );\n        });\n      });\n    });\n  }\n\n  getSheet({\n    workbookName,\n    sheetName,\n  }: {\n    workbookName: string;\n    sheetName: string;\n  }): Sheet | undefined {\n    const workbook = this.workbooks.get(workbookName);\n    const sheet = workbook?.sheets.get(sheetName);\n    return sheet;\n  }\n\n  addSheet({\n    workbookName,\n    sheetName,\n  }: {\n    workbookName: string;\n    sheetName: string;\n  }): Sheet {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      throw new WorkbookNotFoundError(workbookName);\n    }\n    const sheet = {\n      name: sheetName,\n      index: workbook.sheets.size,\n      content: new Map(),\n      metadata: new Map(),\n      sheetMetadata: undefined,\n    };\n\n    if (workbook.sheets.has(sheet.name)) {\n      throw new Error(\"Sheet already exists\");\n    }\n\n    workbook.sheets.set(sheetName, sheet);\n\n    // Initialize empty indexes for this sheet\n    this.getSheetIndexes({ workbookName, sheetName });\n\n    return sheet;\n  }\n\n  removeSheet({\n    workbookName,\n    sheetName,\n  }: {\n    workbookName: string;\n    sheetName: string;\n  }): Sheet {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      throw new WorkbookNotFoundError(workbookName);\n    }\n    const sheet = workbook.sheets.get(sheetName);\n    if (!sheet) {\n      throw new Error(\"Sheet not found\");\n    }\n\n    // Remove the sheet\n    workbook.sheets.delete(sheetName);\n\n    // Clean up indexes for this sheet\n    const key = this.getSheetIndexKey(workbookName, sheetName);\n    this.sheetIndexes.delete(key);\n\n    return sheet;\n  }\n\n  renameSheet({\n    workbookName,\n    sheetName,\n    newSheetName,\n  }: {\n    workbookName: string;\n    sheetName: string;\n    newSheetName: string;\n  }): Sheet {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      throw new WorkbookNotFoundError(workbookName);\n    }\n    const sheet = workbook.sheets.get(sheetName);\n    if (!sheet) {\n      throw new SheetNotFoundError(sheetName);\n    }\n\n    if (workbook.sheets.has(newSheetName)) {\n      throw new Error(\"Sheet with new name already exists\");\n    }\n\n    // Update sheet name\n    sheet.name = newSheetName;\n\n    // Update sheets map\n    workbook.sheets.set(newSheetName, sheet);\n    workbook.sheets.delete(sheetName);\n\n    // Move indexes to new key\n    const oldKey = this.getSheetIndexKey(workbookName, sheetName);\n    const newKey = this.getSheetIndexKey(workbookName, newSheetName);\n    const indexes = this.sheetIndexes.get(oldKey);\n    if (indexes) {\n      this.sheetIndexes.set(newKey, indexes);\n      this.sheetIndexes.delete(oldKey);\n    }\n\n    return sheet;\n  }\n\n  updateAllFormulas(updateCallback: (formula: string) => string): void {\n    const update = (map: Map<string, Sheet>) => {\n      map.forEach((sheet) => {\n        sheet.content.forEach((cell, key) => {\n          if (typeof cell === \"string\" && cell.startsWith(\"=\")) {\n            const formula = cell.slice(1);\n            const updatedFormula = updateCallback(formula);\n\n            // Only update if the formula actually changed\n            if (updatedFormula !== formula) {\n              sheet.content.set(key, `=${updatedFormula}`);\n            }\n          }\n        });\n      });\n    };\n\n    this.workbooks.forEach((workbook) => {\n      update(workbook.sheets);\n    });\n  }\n\n  updateFormulasExcluding(\n    excludeCellsSet: Set<string>,\n    updateCallback: (formula: string) => string\n  ): void {\n    this.workbooks.forEach((workbook, workbookName) => {\n      workbook.sheets.forEach((sheet, sheetName) => {\n        sheet.content.forEach((cell, key) => {\n          if (typeof cell === \"string\" && cell.startsWith(\"=\")) {\n            const { colIndex, rowIndex } = parseCellReference(key);\n            const cellKey = `${workbookName}:${sheetName}:${colIndex}:${rowIndex}`;\n            \n            // Skip if this cell is in the exclude set\n            if (excludeCellsSet.has(cellKey)) {\n              return;\n            }\n\n            const formula = cell.slice(1);\n            const updatedFormula = updateCallback(formula);\n\n            // Only update if the formula actually changed\n            if (updatedFormula !== formula) {\n              sheet.content.set(key, `=${updatedFormula}`);\n            }\n          }\n        });\n      });\n    });\n  }\n\n  updateFormulasForWorkbook(\n    workbookName: string,\n    updateCallback: (formula: string) => string\n  ): void {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      throw new WorkbookNotFoundError(workbookName);\n    }\n\n    workbook.sheets.forEach((sheet) => {\n      sheet.content.forEach((cell, key) => {\n        if (typeof cell === \"string\" && cell.startsWith(\"=\")) {\n          const formula = cell.slice(1);\n          const updatedFormula = updateCallback(formula);\n\n          // Only update if the formula actually changed\n          if (updatedFormula !== formula) {\n            sheet.content.set(key, `=${updatedFormula}`);\n          }\n        }\n      });\n    });\n  }\n\n  getSheetSerialized({\n    workbookName,\n    sheetName,\n  }: {\n    workbookName: string;\n    sheetName: string;\n  }): Map<string, SerializedCellValue> {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      throw new WorkbookNotFoundError(workbookName);\n    }\n    const sheet = workbook.sheets.get(sheetName);\n    if (!sheet) {\n      throw new SheetNotFoundError(sheetName);\n    }\n\n    return sheet.content;\n  }\n\n  /**\n   * Add a cell to the grouped indexes\n   */\n  private addCellToGroups(\n    indexes: SheetIndexes,\n    rowIndex: number,\n    colIndex: number,\n    key: string\n  ): void {\n    // Add to row group (cells in this row, sorted by column)\n    let rowGroup = indexes.rowGroups.get(rowIndex);\n    if (!rowGroup) {\n      rowGroup = [];\n      indexes.rowGroups.set(rowIndex, rowGroup);\n    }\n    const colEntry: IndexEntry = { number: colIndex, key };\n    const colInsertIdx = this.findInsertIndex(rowGroup, colIndex);\n    rowGroup.splice(colInsertIdx, 0, colEntry);\n\n    // Add to column group (cells in this column, sorted by row)\n    let colGroup = indexes.colGroups.get(colIndex);\n    if (!colGroup) {\n      colGroup = [];\n      indexes.colGroups.set(colIndex, colGroup);\n    }\n    const rowEntry: IndexEntry = { number: rowIndex, key };\n    const rowInsertIdx = this.findInsertIndex(colGroup, rowIndex);\n    colGroup.splice(rowInsertIdx, 0, rowEntry);\n\n    // Add to sorted flat indexes\n    this.insertSorted(indexes.cellsSortedByRow, { number: rowIndex, key });\n    this.insertSorted(indexes.cellsSortedByCol, { number: colIndex, key });\n  }\n\n  /**\n   * Remove a cell from the grouped indexes\n   */\n  private removeCellFromGroups(\n    indexes: SheetIndexes,\n    rowIndex: number,\n    colIndex: number,\n    key: string\n  ): void {\n    // Remove from row group\n    const rowGroup = indexes.rowGroups.get(rowIndex);\n    if (rowGroup) {\n      const filteredGroup = rowGroup.filter((e) => e.key !== key);\n      if (filteredGroup.length === 0) {\n        indexes.rowGroups.delete(rowIndex);\n      } else {\n        indexes.rowGroups.set(rowIndex, filteredGroup);\n      }\n    }\n\n    // Remove from column group\n    const colGroup = indexes.colGroups.get(colIndex);\n    if (colGroup) {\n      const filteredGroup = colGroup.filter((e) => e.key !== key);\n      if (filteredGroup.length === 0) {\n        indexes.colGroups.delete(colIndex);\n      } else {\n        indexes.colGroups.set(colIndex, filteredGroup);\n      }\n    }\n\n    // Remove from sorted flat indexes\n    indexes.cellsSortedByRow = indexes.cellsSortedByRow.filter(\n      (item) => item.key !== key\n    );\n    indexes.cellsSortedByCol = indexes.cellsSortedByCol.filter(\n      (item) => item.key !== key\n    );\n  }\n\n  /**\n   * Find insertion index in sorted array\n   */\n  private findInsertIndex(entries: IndexEntry[], n: number): number {\n    return IndexEntryBinarySearch.findInsertionPoint(entries, n);\n  }\n\n  /**\n   * Inserts an item into a sorted array by number, maintaining sort order.\n   * If an item with the same number and key already exists, it won't be added again.\n   */\n  private insertSorted(array: IndexEntry[], item: IndexEntry): void {\n    // Check if item already exists (same number and key)\n    const existingIndex = array.findIndex(\n      (existing) => existing.number === item.number && existing.key === item.key\n    );\n\n    if (existingIndex !== -1) {\n      // Item already exists, no need to add it again\n      return;\n    }\n\n    // Find the insertion point using binary search for efficiency\n    const insertionPoint = IndexEntryBinarySearch.findInsertionPoint(\n      array,\n      item.number\n    );\n\n    // Insert at the found position\n    array.splice(insertionPoint, 0, item);\n  }\n\n  setCellContent(\n    address: CellAddress,\n    content: SerializedCellValue,\n    options?: {\n      /**\n       * for extra performance, if the sheet is already known, it can be passed in\n       */\n      sheet?: Sheet;\n      /**\n       * if the sheet is being built from scratch, we can skip some checks\n       */\n      buildingFromScratch?: boolean;\n    }\n  ): void {\n    const sheet =\n      options?.sheet ||\n      this.getSheet({\n        sheetName: address.sheetName,\n        workbookName: address.workbookName,\n      });\n\n    if (!sheet) {\n      throw new SheetNotFoundError(address.sheetName);\n    }\n\n    const indexes = this.getSheetIndexes({\n      workbookName: address.workbookName,\n      sheetName: address.sheetName,\n    });\n    const adr = getCellReference(address);\n\n    if (this.isContentEmpty(content)) {\n      if (!options?.buildingFromScratch) {\n        sheet.content.delete(adr);\n        // Remove from all indexes\n        this.removeCellFromGroups(\n          indexes,\n          address.rowIndex,\n          address.colIndex,\n          adr\n        );\n      }\n    } else {\n      sheet.content.set(adr, content);\n      // Add to all indexes\n      this.addCellToGroups(indexes, address.rowIndex, address.colIndex, adr);\n    }\n  }\n\n  /**\n   * Set metadata for a cell\n   */\n  setCellMetadata<TMetadata = unknown>(address: CellAddress, metadata: TMetadata | undefined): void {\n    const sheet = this.getSheet({\n      workbookName: address.workbookName,\n      sheetName: address.sheetName,\n    });\n    if (!sheet) {\n      throw new SheetNotFoundError(address.sheetName);\n    }\n\n    const key = getCellReference(address);\n    if (metadata === undefined) {\n      sheet.metadata.delete(key);\n    } else {\n      sheet.metadata.set(key, metadata);\n    }\n  }\n\n  /**\n   * Get metadata for a cell\n   */\n  getCellMetadata<TMetadata = unknown>(address: CellAddress): TMetadata | undefined {\n    const sheet = this.getSheet({\n      workbookName: address.workbookName,\n      sheetName: address.sheetName,\n    });\n    if (!sheet) {\n      return undefined;\n    }\n\n    const key = getCellReference(address);\n    return sheet.metadata.get(key) as TMetadata | undefined;\n  }\n\n  /**\n   * Get all metadata for a sheet\n   */\n  getSheetMetadataSerialized<TMetadata = unknown>(opts: {\n    sheetName: string;\n    workbookName: string;\n  }): Map<string, TMetadata> {\n    const sheet = this.getSheet(opts);\n    return sheet?.metadata || new Map();\n  }\n\n  /**\n   * Set metadata for a sheet\n   */\n  setSheetMetadata<TSheetMetadata = unknown>(\n    opts: { workbookName: string; sheetName: string },\n    metadata: TSheetMetadata\n  ): void {\n    const sheet = this.getSheet(opts);\n    if (!sheet) {\n      throw new SheetNotFoundError(opts.sheetName);\n    }\n    sheet.sheetMetadata = metadata;\n  }\n\n  /**\n   * Get metadata for a sheet\n   */\n  getSheetMetadata<TSheetMetadata = unknown>(\n    opts: { workbookName: string; sheetName: string }\n  ): TSheetMetadata | undefined {\n    const sheet = this.getSheet(opts);\n    if (!sheet) {\n      return undefined;\n    }\n    return sheet.sheetMetadata as TSheetMetadata | undefined;\n  }\n\n  /**\n   * Set metadata for a workbook\n   */\n  setWorkbookMetadata<TWorkbookMetadata = unknown>(\n    workbookName: string,\n    metadata: TWorkbookMetadata\n  ): void {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      throw new Error(`Workbook \"${workbookName}\" not found`);\n    }\n    workbook.workbookMetadata = metadata;\n  }\n\n  /**\n   * Get metadata for a workbook\n   */\n  getWorkbookMetadata<TWorkbookMetadata = unknown>(\n    workbookName: string\n  ): TWorkbookMetadata | undefined {\n    const workbook = this.workbooks.get(workbookName);\n    if (!workbook) {\n      return undefined;\n    }\n    return workbook.workbookMetadata as TWorkbookMetadata | undefined;\n  }\n\n  /**\n   * Replace all content for a sheet (safely, without breaking references)\n   * This method clears the existing Map and repopulates it rather than replacing the Map reference\n   */\n  setSheetContent(\n    opts: { sheetName: string; workbookName: string },\n    newContent: Map<string, SerializedCellValue>\n  ): void {\n    const sheet = this.getSheet(opts);\n    if (!sheet) {\n      throw new SheetNotFoundError(opts.sheetName);\n    }\n\n    // Clear existing content without breaking the Map reference\n    sheet.content.clear();\n\n    // Clean up indexes for this sheet\n    const key = this.getSheetIndexKey(opts.workbookName, opts.sheetName);\n    this.sheetIndexes.delete(key);\n\n    // Repopulate with new content\n    newContent.forEach((value, key) => {\n      this.setCellContent(\n        {\n          workbookName: opts.workbookName,\n          sheetName: opts.sheetName,\n          colIndex: parseCellReference(key).colIndex,\n          rowIndex: parseCellReference(key).rowIndex,\n        },\n        value,\n        {\n          sheet,\n          buildingFromScratch: true,\n        }\n      );\n    });\n  }\n\n  /**\n   * Removes the content in the spreadsheet that is inside the range.\n   * OPTIMIZED: Uses indexes to only process cells that actually exist.\n   * ENHANCED: Now supports infinite ranges.\n   */\n  clearSpreadsheetRange(address: RangeAddress) {\n    const sheet = this.getSheet(address);\n\n    if (!sheet) {\n      throw new SheetNotFoundError(address.sheetName);\n    }\n\n    // Get current sheet content and prepare new content with cleared cells\n    const newContent = new Map(sheet.content);\n    const newMetadata = new Map(sheet.metadata);\n\n    // Use iterateCellsInRange to only process cells that actually exist\n    // This handles both finite and infinite ranges efficiently\n    for (const cellAddress of this.iterateCellsInRange(address)) {\n      const cellRef = getCellReference(cellAddress);\n\n      // Remove from content and metadata\n      newContent.delete(cellRef);\n      newMetadata.delete(cellRef);\n    }\n\n    // Update content\n    this.setSheetContent(address, newContent);\n    \n    // Update metadata\n    sheet.metadata = newMetadata;\n  }\n\n  /**\n   * Optimized generator to iterate over cells defined in the content within a range\n   * Uses indexes to efficiently find and yield only cells that exist within the range\n   */\n  *iterateCellsInRange(address: RangeAddress): Generator<CellAddress> {\n    // First check if the sheet exists\n    const sheet = this.getSheet(address);\n    if (!sheet) {\n      throw new SheetNotFoundError(address.sheetName);\n    }\n\n    const indexes = this.getSheetIndexes(address);\n\n    const range = address.range;\n\n    // Use the sorted index to find only rows that actually contain cells\n    // This avoids iterating through empty rows regardless of finite/infinite bounds\n\n    if (range.end.row.type === \"number\") {\n      // Finite bounds: Use binary search to find the range of cells to check\n      const startIndex = IndexEntryBinarySearch.findFirstGreaterOrEqual(\n        indexes.cellsSortedByRow,\n        range.start.row\n      );\n\n      if (startIndex === -1) return; // No cells at or after start row\n\n      // Process cells from startIndex until we exceed the end row\n      for (let i = startIndex; i < indexes.cellsSortedByRow.length; i++) {\n        const cellEntry = indexes.cellsSortedByRow[i];\n        if (!cellEntry) continue;\n\n        const parsed = parseCellReference(cellEntry.key);\n\n        // Stop if we've gone beyond the row range\n        if (parsed.rowIndex > range.end.row.value) break;\n\n        // Check if cell is within column bounds\n        if (parsed.colIndex < range.start.col) continue;\n\n        if (\n          range.end.col.type === \"number\" &&\n          parsed.colIndex > range.end.col.value\n        ) {\n          continue; // Skip this cell but keep checking others in different rows\n        }\n\n        yield {\n          rowIndex: parsed.rowIndex,\n          colIndex: parsed.colIndex,\n          sheetName: address.sheetName,\n          workbookName: address.workbookName,\n        };\n      }\n    } else {\n      // Infinite row bounds: Use binary search to find starting point\n      const startIndex = IndexEntryBinarySearch.findFirstGreaterOrEqual(\n        indexes.cellsSortedByRow,\n        range.start.row\n      );\n\n      if (startIndex === -1) return; // No cells at or after start row\n\n      // Process all cells from startIndex to end\n      for (let i = startIndex; i < indexes.cellsSortedByRow.length; i++) {\n        const cellEntry = indexes.cellsSortedByRow[i];\n        if (!cellEntry) continue;\n\n        const parsed = parseCellReference(cellEntry.key);\n\n        // Check if cell is within column bounds\n        if (parsed.colIndex < range.start.col) continue;\n\n        if (\n          range.end.col.type === \"number\" &&\n          parsed.colIndex > range.end.col.value\n        ) {\n          continue; // Skip this cell but keep checking others in different rows\n        }\n\n        yield {\n          rowIndex: parsed.rowIndex,\n          colIndex: parsed.colIndex,\n          sheetName: address.sheetName,\n          workbookName: address.workbookName,\n        };\n      }\n    }\n  }\n\n  getCellsInRange(address: RangeAddress): CellAddress[] {\n    return Array.from(this.iterateCellsInRange(address));\n  }\n\n  public getCellContent(cellAddress: CellAddress): SerializedCellValue {\n    const sheet = this.getSheet(cellAddress);\n    if (!sheet) {\n      throw new SheetNotFoundError(cellAddress.sheetName);\n    }\n    return sheet.content.get(getCellReference(cellAddress));\n  }\n\n  public getSerializedCellValue(cellAddress: CellAddress): SerializedCellValue {\n    const sheet = this.getSheet(cellAddress);\n    if (!sheet) {\n      throw new SheetNotFoundError(cellAddress.sheetName);\n    }\n    return normalizeSerializedCellValue(\n      sheet.content.get(getCellReference(cellAddress))\n    );\n  }\n\n  public isCellEmpty(cellAddress: CellAddress): boolean {\n    const content = this.getCellContent(cellAddress);\n    return (\n      content === undefined || (typeof content === \"string\" && content === \"\")\n    );\n  }\n  public isFormulaCell(cellAddress: CellAddress): boolean {\n    const content = this.getCellContent(cellAddress);\n    return typeof content === \"string\" && content.startsWith(\"=\");\n  }\n\n  /**\n   * Build evaluation order for a range\n   * Delegates to the buildRangeEvalOrder function\n   */\n  public buildRangeEvalOrder(\n    lookupOrder: \"row-major\" | \"col-major\",\n    lookupRange: RangeAddress\n  ) {\n    // Import and call the function\n    return buildRangeEvalOrder.call(this, lookupOrder, lookupRange);\n  }\n}\n"
   ],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAUqD,IAArD;AAGoC,IAApC;AAKO,IAJP;AAK6C,IAA7C;AAAA;AAoBO,MAAM,uBAAuB;AAAA,SAK3B,kBAAkB,CAAC,SAAuB,QAAwB;AAAA,IACvE,IAAI,OAAO;AAAA,IACX,IAAI,QAAQ,QAAQ;AAAA,IAEpB,OAAO,OAAO,OAAO;AAAA,MACnB,MAAM,MAAM,KAAK,OAAO,OAAO,SAAS,CAAC;AAAA,MACzC,MAAM,WAAW,QAAQ;AAAA,MACzB,IAAI,YAAY,SAAS,SAAS,QAAQ;AAAA,QACxC,OAAO,MAAM;AAAA,MACf,EAAO;AAAA,QACL,QAAQ;AAAA;AAAA,IAEZ;AAAA,IAEA,OAAO;AAAA;AAAA,SAOF,uBAAuB,CAC5B,SACA,QACQ;AAAA,IACR,IAAI,QAAQ,WAAW;AAAA,MAAG,OAAO;AAAA,IAEjC,IAAI,OAAO;AAAA,IACX,IAAI,QAAQ,QAAQ,SAAS;AAAA,IAC7B,IAAI,SAAS;AAAA,IAEb,OAAO,QAAQ,OAAO;AAAA,MACpB,MAAM,MAAM,KAAK,OAAO,OAAO,SAAS,CAAC;AAAA,MACzC,MAAM,WAAW,QAAQ;AAAA,MACzB,IAAI,YAAY,SAAS,UAAU,QAAQ;AAAA,QACzC,SAAS;AAAA,QACT,QAAQ,MAAM;AAAA,MAChB,EAAO;AAAA,QACL,OAAO,MAAM;AAAA;AAAA,IAEjB;AAAA,IAEA,OAAO;AAAA;AAAA,SAOF,2BAA2B,CAChC,SACA,QACQ;AAAA,IACR,OAAO,uBAAuB,mBAAmB,SAAS,MAAM;AAAA;AAEpE;AAAA;AAEO,MAAM,gBAAgB;AAAA,EACnB,YAAmC,IAAI;AAAA,EAGvC,eAA0C,IAAI;AAAA,EAK9C,gBAAgB,CAAC,cAAsB,WAA2B;AAAA,IACxE,OAAO,GAAG,gBAAgB;AAAA;AAAA,EAMrB,eAAe,CAAC,MAGN;AAAA,IACf,MAAM,MAAM,KAAK,iBAAiB,KAAK,cAAc,KAAK,SAAS;AAAA,IACnE,IAAI,UAAU,KAAK,aAAa,IAAI,GAAG;AAAA,IAEvC,IAAI,CAAC,SAAS;AAAA,MACZ,UAAU;AAAA,QACR,WAAW,IAAI;AAAA,QACf,WAAW,IAAI;AAAA,QACf,kBAAkB,CAAC;AAAA,QACnB,kBAAkB,CAAC;AAAA,MACrB;AAAA,MACA,KAAK,aAAa,IAAI,KAAK,OAAO;AAAA,IACpC;AAAA,IAEA,OAAO;AAAA;AAAA,EAGT,SAAS,CAAC,cAA0C;AAAA,IAClD,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,8CAAsB,YAAY;AAAA,IAC9C;AAAA,IACA,OAAO,SAAS;AAAA;AAAA,EAGlB,YAAY,GAA0B;AAAA,IACpC,OAAO,KAAK;AAAA;AAAA,EAGd,WAAW,CAAC,cAA4B;AAAA,IACtC,IAAI,KAAK,UAAU,IAAI,YAAY,GAAG;AAAA,MACpC,MAAM,IAAI,MAAM,yBAAyB;AAAA,IAC3C;AAAA,IACA,KAAK,UAAU,IAAI,cAAc;AAAA,MAC/B,MAAM;AAAA,MACN,QAAQ,IAAI;AAAA,IACd,CAAC;AAAA;AAAA,EAGH,cAAc,CAAC,cAA4B;AAAA,IACzC,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,8CAAsB,YAAY;AAAA,IAC9C;AAAA,IAGA,WAAW,aAAa,SAAS,OAAO,KAAK,GAAG;AAAA,MAC9C,MAAM,MAAM,KAAK,iBAAiB,cAAc,SAAS;AAAA,MACzD,KAAK,aAAa,OAAO,GAAG;AAAA,IAC9B;AAAA,IAEA,KAAK,UAAU,OAAO,YAAY;AAAA;AAAA,EAGpC,cAAc,CAAC,SAAuC;AAAA,IACpD,OAAO,YAAY,MAAM,YAAY;AAAA;AAAA,EAGvC,cAAc,CAAC,MAGN;AAAA,IACP,MAAM,WAAW,KAAK,UAAU,IAAI,KAAK,YAAY;AAAA,IACrD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,MAAM,oBAAoB;AAAA,IACtC;AAAA,IAGA,WAAW,aAAa,SAAS,OAAO,KAAK,GAAG;AAAA,MAC9C,MAAM,SAAS,KAAK,iBAAiB,KAAK,cAAc,SAAS;AAAA,MACjE,MAAM,SAAS,KAAK,iBAAiB,KAAK,iBAAiB,SAAS;AAAA,MACpE,MAAM,UAAU,KAAK,aAAa,IAAI,MAAM;AAAA,MAC5C,IAAI,SAAS;AAAA,QACX,KAAK,aAAa,IAAI,QAAQ,OAAO;AAAA,QACrC,KAAK,aAAa,OAAO,MAAM;AAAA,MACjC;AAAA,IACF;AAAA,IAEA,KAAK,UAAU,IAAI,KAAK,iBAAiB,QAAQ;AAAA,IACjD,KAAK,UAAU,OAAO,KAAK,YAAY;AAAA,IACvC,SAAS,OAAO,KAAK;AAAA;AAAA,EAGvB,cAAc,CAAC,WAAwC;AAAA,IACrD,KAAK,UAAU,MAAM;AAAA,IACrB,KAAK,aAAa,MAAM;AAAA,IAExB,UAAU,QAAQ,CAAC,UAAU,iBAAiB;AAAA,MAC5C,KAAK,UAAU,IAAI,cAAc,QAAQ;AAAA,MACzC,SAAS,OAAO,QAAQ,CAAC,UAAU;AAAA,QAEjC,MAAM,UAAU,KAAK,gBAAgB;AAAA,UACnC;AAAA,UACA,WAAW,MAAM;AAAA,QACnB,CAAC;AAAA,QACD,QAAQ,UAAU,MAAM;AAAA,QACxB,QAAQ,UAAU,MAAM;AAAA,QACxB,QAAQ,mBAAmB,CAAC;AAAA,QAC5B,QAAQ,mBAAmB,CAAC;AAAA,QAE5B,MAAM,QAAQ,QAAQ,CAAC,OAAO,QAAQ;AAAA,UACpC,KAAK,eACH;AAAA,YACE;AAAA,YACA,WAAW,MAAM;AAAA,YACjB,UAAU,gCAAmB,GAAG,EAAE;AAAA,YAClC,UAAU,gCAAmB,GAAG,EAAE;AAAA,UACpC,GACA,OACA;AAAA,YACE;AAAA,YACA,qBAAqB;AAAA,UACvB,CACF;AAAA,SACD;AAAA,OACF;AAAA,KACF;AAAA;AAAA,EAGH,QAAQ;AAAA,IACN;AAAA,IACA;AAAA,KAIoB;AAAA,IACpB,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,MAAM,QAAQ,UAAU,OAAO,IAAI,SAAS;AAAA,IAC5C,OAAO;AAAA;AAAA,EAGT,QAAQ;AAAA,IACN;AAAA,IACA;AAAA,KAIQ;AAAA,IACR,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,8CAAsB,YAAY;AAAA,IAC9C;AAAA,IACA,MAAM,QAAQ;AAAA,MACZ,MAAM;AAAA,MACN,OAAO,SAAS,OAAO;AAAA,MACvB,SAAS,IAAI;AAAA,IACf;AAAA,IAEA,IAAI,SAAS,OAAO,IAAI,MAAM,IAAI,GAAG;AAAA,MACnC,MAAM,IAAI,MAAM,sBAAsB;AAAA,IACxC;AAAA,IAEA,SAAS,OAAO,IAAI,WAAW,KAAK;AAAA,IAGpC,KAAK,gBAAgB,EAAE,cAAc,UAAU,CAAC;AAAA,IAEhD,OAAO;AAAA;AAAA,EAGT,WAAW;AAAA,IACT;AAAA,IACA;AAAA,KAIQ;AAAA,IACR,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,8CAAsB,YAAY;AAAA,IAC9C;AAAA,IACA,MAAM,QAAQ,SAAS,OAAO,IAAI,SAAS;AAAA,IAC3C,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,MAAM,iBAAiB;AAAA,IACnC;AAAA,IAGA,SAAS,OAAO,OAAO,SAAS;AAAA,IAGhC,MAAM,MAAM,KAAK,iBAAiB,cAAc,SAAS;AAAA,IACzD,KAAK,aAAa,OAAO,GAAG;AAAA,IAE5B,OAAO;AAAA;AAAA,EAGT,WAAW;AAAA,IACT;AAAA,IACA;AAAA,IACA;AAAA,KAKQ;AAAA,IACR,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,8CAAsB,YAAY;AAAA,IAC9C;AAAA,IACA,MAAM,QAAQ,SAAS,OAAO,IAAI,SAAS;AAAA,IAC3C,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,SAAS;AAAA,IACxC;AAAA,IAEA,IAAI,SAAS,OAAO,IAAI,YAAY,GAAG;AAAA,MACrC,MAAM,IAAI,MAAM,oCAAoC;AAAA,IACtD;AAAA,IAGA,MAAM,OAAO;AAAA,IAGb,SAAS,OAAO,IAAI,cAAc,KAAK;AAAA,IACvC,SAAS,OAAO,OAAO,SAAS;AAAA,IAGhC,MAAM,SAAS,KAAK,iBAAiB,cAAc,SAAS;AAAA,IAC5D,MAAM,SAAS,KAAK,iBAAiB,cAAc,YAAY;AAAA,IAC/D,MAAM,UAAU,KAAK,aAAa,IAAI,MAAM;AAAA,IAC5C,IAAI,SAAS;AAAA,MACX,KAAK,aAAa,IAAI,QAAQ,OAAO;AAAA,MACrC,KAAK,aAAa,OAAO,MAAM;AAAA,IACjC;AAAA,IAEA,OAAO;AAAA;AAAA,EAGT,iBAAiB,CAAC,gBAAmD;AAAA,IACnE,MAAM,SAAS,CAAC,QAA4B;AAAA,MAC1C,IAAI,QAAQ,CAAC,UAAU;AAAA,QACrB,MAAM,QAAQ,QAAQ,CAAC,MAAM,QAAQ;AAAA,UACnC,IAAI,OAAO,SAAS,YAAY,KAAK,WAAW,GAAG,GAAG;AAAA,YACpD,MAAM,UAAU,KAAK,MAAM,CAAC;AAAA,YAC5B,MAAM,iBAAiB,eAAe,OAAO;AAAA,YAG7C,IAAI,mBAAmB,SAAS;AAAA,cAC9B,MAAM,QAAQ,IAAI,KAAK,IAAI,gBAAgB;AAAA,YAC7C;AAAA,UACF;AAAA,SACD;AAAA,OACF;AAAA;AAAA,IAGH,KAAK,UAAU,QAAQ,CAAC,aAAa;AAAA,MACnC,OAAO,SAAS,MAAM;AAAA,KACvB;AAAA;AAAA,EAGH,kBAAkB;AAAA,IAChB;AAAA,IACA;AAAA,KAImC;AAAA,IACnC,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,8CAAsB,YAAY;AAAA,IAC9C;AAAA,IACA,MAAM,QAAQ,SAAS,OAAO,IAAI,SAAS;AAAA,IAC3C,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,SAAS;AAAA,IACxC;AAAA,IAEA,OAAO,MAAM;AAAA;AAAA,EAMP,eAAe,CACrB,SACA,UACA,UACA,KACM;AAAA,IAEN,IAAI,WAAW,QAAQ,UAAU,IAAI,QAAQ;AAAA,IAC7C,IAAI,CAAC,UAAU;AAAA,MACb,WAAW,CAAC;AAAA,MACZ,QAAQ,UAAU,IAAI,UAAU,QAAQ;AAAA,IAC1C;AAAA,IACA,MAAM,WAAuB,EAAE,QAAQ,UAAU,IAAI;AAAA,IACrD,MAAM,eAAe,KAAK,gBAAgB,UAAU,QAAQ;AAAA,IAC5D,SAAS,OAAO,cAAc,GAAG,QAAQ;AAAA,IAGzC,IAAI,WAAW,QAAQ,UAAU,IAAI,QAAQ;AAAA,IAC7C,IAAI,CAAC,UAAU;AAAA,MACb,WAAW,CAAC;AAAA,MACZ,QAAQ,UAAU,IAAI,UAAU,QAAQ;AAAA,IAC1C;AAAA,IACA,MAAM,WAAuB,EAAE,QAAQ,UAAU,IAAI;AAAA,IACrD,MAAM,eAAe,KAAK,gBAAgB,UAAU,QAAQ;AAAA,IAC5D,SAAS,OAAO,cAAc,GAAG,QAAQ;AAAA,IAGzC,KAAK,aAAa,QAAQ,kBAAkB,EAAE,QAAQ,UAAU,IAAI,CAAC;AAAA,IACrE,KAAK,aAAa,QAAQ,kBAAkB,EAAE,QAAQ,UAAU,IAAI,CAAC;AAAA;AAAA,EAM/D,oBAAoB,CAC1B,SACA,UACA,UACA,KACM;AAAA,IAEN,MAAM,WAAW,QAAQ,UAAU,IAAI,QAAQ;AAAA,IAC/C,IAAI,UAAU;AAAA,MACZ,MAAM,gBAAgB,SAAS,OAAO,CAAC,MAAM,EAAE,QAAQ,GAAG;AAAA,MAC1D,IAAI,cAAc,WAAW,GAAG;AAAA,QAC9B,QAAQ,UAAU,OAAO,QAAQ;AAAA,MACnC,EAAO;AAAA,QACL,QAAQ,UAAU,IAAI,UAAU,aAAa;AAAA;AAAA,IAEjD;AAAA,IAGA,MAAM,WAAW,QAAQ,UAAU,IAAI,QAAQ;AAAA,IAC/C,IAAI,UAAU;AAAA,MACZ,MAAM,gBAAgB,SAAS,OAAO,CAAC,MAAM,EAAE,QAAQ,GAAG;AAAA,MAC1D,IAAI,cAAc,WAAW,GAAG;AAAA,QAC9B,QAAQ,UAAU,OAAO,QAAQ;AAAA,MACnC,EAAO;AAAA,QACL,QAAQ,UAAU,IAAI,UAAU,aAAa;AAAA;AAAA,IAEjD;AAAA,IAGA,QAAQ,mBAAmB,QAAQ,iBAAiB,OAClD,CAAC,SAAS,KAAK,QAAQ,GACzB;AAAA,IACA,QAAQ,mBAAmB,QAAQ,iBAAiB,OAClD,CAAC,SAAS,KAAK,QAAQ,GACzB;AAAA;AAAA,EAMM,eAAe,CAAC,SAAuB,GAAmB;AAAA,IAChE,OAAO,uBAAuB,mBAAmB,SAAS,CAAC;AAAA;AAAA,EAOrD,YAAY,CAAC,OAAqB,MAAwB;AAAA,IAEhE,MAAM,gBAAgB,MAAM,UAC1B,CAAC,aAAa,SAAS,WAAW,KAAK,UAAU,SAAS,QAAQ,KAAK,GACzE;AAAA,IAEA,IAAI,kBAAkB,IAAI;AAAA,MAExB;AAAA,IACF;AAAA,IAGA,MAAM,iBAAiB,uBAAuB,mBAC5C,OACA,KAAK,MACP;AAAA,IAGA,MAAM,OAAO,gBAAgB,GAAG,IAAI;AAAA;AAAA,EAGtC,cAAc,CACZ,SACA,SACA,SAUM;AAAA,IACN,MAAM,QACJ,SAAS,SACT,KAAK,SAAS;AAAA,MACZ,WAAW,QAAQ;AAAA,MACnB,cAAc,QAAQ;AAAA,IACxB,CAAC;AAAA,IAEH,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,QAAQ,SAAS;AAAA,IAChD;AAAA,IAEA,MAAM,UAAU,KAAK,gBAAgB;AAAA,MACnC,cAAc,QAAQ;AAAA,MACtB,WAAW,QAAQ;AAAA,IACrB,CAAC;AAAA,IACD,MAAM,MAAM,8BAAiB,OAAO;AAAA,IAEpC,IAAI,KAAK,eAAe,OAAO,GAAG;AAAA,MAChC,IAAI,CAAC,SAAS,qBAAqB;AAAA,QACjC,MAAM,QAAQ,OAAO,GAAG;AAAA,QAExB,KAAK,qBACH,SACA,QAAQ,UACR,QAAQ,UACR,GACF;AAAA,MACF;AAAA,IACF,EAAO;AAAA,MACL,MAAM,QAAQ,IAAI,KAAK,OAAO;AAAA,MAE9B,KAAK,gBAAgB,SAAS,QAAQ,UAAU,QAAQ,UAAU,GAAG;AAAA;AAAA;AAAA,EAQzE,eAAe,CACb,MACA,YACM;AAAA,IACN,MAAM,QAAQ,KAAK,SAAS,IAAI;AAAA,IAChC,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,KAAK,SAAS;AAAA,IAC7C;AAAA,IAGA,MAAM,QAAQ,MAAM;AAAA,IAGpB,MAAM,MAAM,KAAK,iBAAiB,KAAK,cAAc,KAAK,SAAS;AAAA,IACnE,KAAK,aAAa,OAAO,GAAG;AAAA,IAG5B,WAAW,QAAQ,CAAC,OAAO,SAAQ;AAAA,MACjC,KAAK,eACH;AAAA,QACE,cAAc,KAAK;AAAA,QACnB,WAAW,KAAK;AAAA,QAChB,UAAU,gCAAmB,IAAG,EAAE;AAAA,QAClC,UAAU,gCAAmB,IAAG,EAAE;AAAA,MACpC,GACA,OACA;AAAA,QACE;AAAA,QACA,qBAAqB;AAAA,MACvB,CACF;AAAA,KACD;AAAA;AAAA,EAQH,qBAAqB,CAAC,SAAuB;AAAA,IAC3C,MAAM,QAAQ,KAAK,SAAS,OAAO;AAAA,IAEnC,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,QAAQ,SAAS;AAAA,IAChD;AAAA,IAGA,MAAM,aAAa,IAAI,IAAI,MAAM,OAAO;AAAA,IAIxC,WAAW,eAAe,KAAK,oBAAoB,OAAO,GAAG;AAAA,MAC3D,MAAM,UAAU,8BAAiB,WAAW;AAAA,MAG5C,WAAW,OAAO,OAAO;AAAA,IAC3B;AAAA,IAGA,KAAK,gBAAgB,SAAS,UAAU;AAAA;AAAA,GAOzC,mBAAmB,CAAC,SAA+C;AAAA,IAElE,MAAM,QAAQ,KAAK,SAAS,OAAO;AAAA,IACnC,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,QAAQ,SAAS;AAAA,IAChD;AAAA,IAEA,MAAM,UAAU,KAAK,gBAAgB,OAAO;AAAA,IAE5C,MAAM,QAAQ,QAAQ;AAAA,IAKtB,IAAI,MAAM,IAAI,IAAI,SAAS,UAAU;AAAA,MAEnC,MAAM,aAAa,uBAAuB,wBACxC,QAAQ,kBACR,MAAM,MAAM,GACd;AAAA,MAEA,IAAI,eAAe;AAAA,QAAI;AAAA,MAGvB,SAAS,IAAI,WAAY,IAAI,QAAQ,iBAAiB,QAAQ,KAAK;AAAA,QACjE,MAAM,YAAY,QAAQ,iBAAiB;AAAA,QAC3C,IAAI,CAAC;AAAA,UAAW;AAAA,QAEhB,MAAM,SAAS,gCAAmB,UAAU,GAAG;AAAA,QAG/C,IAAI,OAAO,WAAW,MAAM,IAAI,IAAI;AAAA,UAAO;AAAA,QAG3C,IAAI,OAAO,WAAW,MAAM,MAAM;AAAA,UAAK;AAAA,QAEvC,IACE,MAAM,IAAI,IAAI,SAAS,YACvB,OAAO,WAAW,MAAM,IAAI,IAAI,OAChC;AAAA,UACA;AAAA,QACF;AAAA,QAEA,MAAM;AAAA,UACJ,UAAU,OAAO;AAAA,UACjB,UAAU,OAAO;AAAA,UACjB,WAAW,QAAQ;AAAA,UACnB,cAAc,QAAQ;AAAA,QACxB;AAAA,MACF;AAAA,IACF,EAAO;AAAA,MAEL,MAAM,aAAa,uBAAuB,wBACxC,QAAQ,kBACR,MAAM,MAAM,GACd;AAAA,MAEA,IAAI,eAAe;AAAA,QAAI;AAAA,MAGvB,SAAS,IAAI,WAAY,IAAI,QAAQ,iBAAiB,QAAQ,KAAK;AAAA,QACjE,MAAM,YAAY,QAAQ,iBAAiB;AAAA,QAC3C,IAAI,CAAC;AAAA,UAAW;AAAA,QAEhB,MAAM,SAAS,gCAAmB,UAAU,GAAG;AAAA,QAG/C,IAAI,OAAO,WAAW,MAAM,MAAM;AAAA,UAAK;AAAA,QAEvC,IACE,MAAM,IAAI,IAAI,SAAS,YACvB,OAAO,WAAW,MAAM,IAAI,IAAI,OAChC;AAAA,UACA;AAAA,QACF;AAAA,QAEA,MAAM;AAAA,UACJ,UAAU,OAAO;AAAA,UACjB,UAAU,OAAO;AAAA,UACjB,WAAW,QAAQ;AAAA,UACnB,cAAc,QAAQ;AAAA,QACxB;AAAA,MACF;AAAA;AAAA;AAAA,EAIJ,eAAe,CAAC,SAAsC;AAAA,IACpD,OAAO,MAAM,KAAK,KAAK,oBAAoB,OAAO,CAAC;AAAA;AAAA,EAG7C,cAAc,CAAC,aAA+C;AAAA,IACpE,MAAM,QAAQ,KAAK,SAAS,WAAW;AAAA,IACvC,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,YAAY,SAAS;AAAA,IACpD;AAAA,IACA,OAAO,MAAM,QAAQ,IAAI,8BAAiB,WAAW,CAAC;AAAA;AAAA,EAGjD,sBAAsB,CAAC,aAA+C;AAAA,IAC3E,MAAM,QAAQ,KAAK,SAAS,WAAW;AAAA,IACvC,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,YAAY,SAAS;AAAA,IACpD;AAAA,IACA,OAAO,8CACL,MAAM,QAAQ,IAAI,8BAAiB,WAAW,CAAC,CACjD;AAAA;AAAA,EAGK,WAAW,CAAC,aAAmC;AAAA,IACpD,MAAM,UAAU,KAAK,eAAe,WAAW;AAAA,IAC/C,OACE,YAAY,aAAc,OAAO,YAAY,YAAY,YAAY;AAAA;AAAA,EAGlE,aAAa,CAAC,aAAmC;AAAA,IACtD,MAAM,UAAU,KAAK,eAAe,WAAW;AAAA,IAC/C,OAAO,OAAO,YAAY,YAAY,QAAQ,WAAW,GAAG;AAAA;AAAA,EAOvD,mBAAmB,CACxB,aACA,aACA;AAAA,IAEA,OAAO,oDAAoB,KAAK,MAAM,aAAa,WAAW;AAAA;AAElE;",
-  "debugId": "53F111E41968239964756E2164756E21",
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAUqD,IAArD;AAGoC,IAApC;AAKO,IAJP;AAK6C,IAA7C;AAAA;AAoBO,MAAM,uBAAuB;AAAA,SAK3B,kBAAkB,CAAC,SAAuB,QAAwB;AAAA,IACvE,IAAI,OAAO;AAAA,IACX,IAAI,QAAQ,QAAQ;AAAA,IAEpB,OAAO,OAAO,OAAO;AAAA,MACnB,MAAM,MAAM,KAAK,OAAO,OAAO,SAAS,CAAC;AAAA,MACzC,MAAM,WAAW,QAAQ;AAAA,MACzB,IAAI,YAAY,SAAS,SAAS,QAAQ;AAAA,QACxC,OAAO,MAAM;AAAA,MACf,EAAO;AAAA,QACL,QAAQ;AAAA;AAAA,IAEZ;AAAA,IAEA,OAAO;AAAA;AAAA,SAOF,uBAAuB,CAC5B,SACA,QACQ;AAAA,IACR,IAAI,QAAQ,WAAW;AAAA,MAAG,OAAO;AAAA,IAEjC,IAAI,OAAO;AAAA,IACX,IAAI,QAAQ,QAAQ,SAAS;AAAA,IAC7B,IAAI,SAAS;AAAA,IAEb,OAAO,QAAQ,OAAO;AAAA,MACpB,MAAM,MAAM,KAAK,OAAO,OAAO,SAAS,CAAC;AAAA,MACzC,MAAM,WAAW,QAAQ;AAAA,MACzB,IAAI,YAAY,SAAS,UAAU,QAAQ;AAAA,QACzC,SAAS;AAAA,QACT,QAAQ,MAAM;AAAA,MAChB,EAAO;AAAA,QACL,OAAO,MAAM;AAAA;AAAA,IAEjB;AAAA,IAEA,OAAO;AAAA;AAAA,SAOF,2BAA2B,CAChC,SACA,QACQ;AAAA,IACR,OAAO,uBAAuB,mBAAmB,SAAS,MAAM;AAAA;AAEpE;AAAA;AAEO,MAAM,gBAAgB;AAAA,EACnB,YAAmC,IAAI;AAAA,EAGvC,eAA0C,IAAI;AAAA,EAK9C,gBAAgB,CAAC,cAAsB,WAA2B;AAAA,IACxE,OAAO,GAAG,gBAAgB;AAAA;AAAA,EAMrB,eAAe,CAAC,MAGN;AAAA,IACf,MAAM,MAAM,KAAK,iBAAiB,KAAK,cAAc,KAAK,SAAS;AAAA,IACnE,IAAI,UAAU,KAAK,aAAa,IAAI,GAAG;AAAA,IAEvC,IAAI,CAAC,SAAS;AAAA,MACZ,UAAU;AAAA,QACR,WAAW,IAAI;AAAA,QACf,WAAW,IAAI;AAAA,QACf,kBAAkB,CAAC;AAAA,QACnB,kBAAkB,CAAC;AAAA,MACrB;AAAA,MACA,KAAK,aAAa,IAAI,KAAK,OAAO;AAAA,IACpC;AAAA,IAEA,OAAO;AAAA;AAAA,EAGT,SAAS,CAAC,cAA0C;AAAA,IAClD,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,8CAAsB,YAAY;AAAA,IAC9C;AAAA,IACA,OAAO,SAAS;AAAA;AAAA,EAGlB,YAAY,GAA0B;AAAA,IACpC,OAAO,KAAK;AAAA;AAAA,EAGd,WAAW,CAAC,cAA4B;AAAA,IACtC,IAAI,KAAK,UAAU,IAAI,YAAY,GAAG;AAAA,MACpC,MAAM,IAAI,MAAM,yBAAyB;AAAA,IAC3C;AAAA,IACA,KAAK,UAAU,IAAI,cAAc;AAAA,MAC/B,MAAM;AAAA,MACN,QAAQ,IAAI;AAAA,MACZ,kBAAkB;AAAA,IACpB,CAAC;AAAA;AAAA,EAGH,cAAc,CAAC,cAA4B;AAAA,IACzC,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,8CAAsB,YAAY;AAAA,IAC9C;AAAA,IAGA,WAAW,aAAa,SAAS,OAAO,KAAK,GAAG;AAAA,MAC9C,MAAM,MAAM,KAAK,iBAAiB,cAAc,SAAS;AAAA,MACzD,KAAK,aAAa,OAAO,GAAG;AAAA,IAC9B;AAAA,IAEA,KAAK,UAAU,OAAO,YAAY;AAAA;AAAA,EAGpC,cAAc,CAAC,SAAuC;AAAA,IACpD,OAAO,YAAY,MAAM,YAAY;AAAA;AAAA,EAGvC,cAAc,CAAC,MAGN;AAAA,IACP,MAAM,WAAW,KAAK,UAAU,IAAI,KAAK,YAAY;AAAA,IACrD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,MAAM,oBAAoB;AAAA,IACtC;AAAA,IAGA,WAAW,aAAa,SAAS,OAAO,KAAK,GAAG;AAAA,MAC9C,MAAM,SAAS,KAAK,iBAAiB,KAAK,cAAc,SAAS;AAAA,MACjE,MAAM,SAAS,KAAK,iBAAiB,KAAK,iBAAiB,SAAS;AAAA,MACpE,MAAM,UAAU,KAAK,aAAa,IAAI,MAAM;AAAA,MAC5C,IAAI,SAAS;AAAA,QACX,KAAK,aAAa,IAAI,QAAQ,OAAO;AAAA,QACrC,KAAK,aAAa,OAAO,MAAM;AAAA,MACjC;AAAA,IACF;AAAA,IAEA,KAAK,UAAU,IAAI,KAAK,iBAAiB,QAAQ;AAAA,IACjD,KAAK,UAAU,OAAO,KAAK,YAAY;AAAA,IACvC,SAAS,OAAO,KAAK;AAAA;AAAA,EAGvB,cAAc,CAAC,WAAwC;AAAA,IACrD,KAAK,UAAU,MAAM;AAAA,IACrB,KAAK,aAAa,MAAM;AAAA,IAExB,UAAU,QAAQ,CAAC,UAAU,iBAAiB;AAAA,MAC5C,KAAK,UAAU,IAAI,cAAc,QAAQ;AAAA,MACzC,SAAS,OAAO,QAAQ,CAAC,UAAU;AAAA,QAEjC,MAAM,UAAU,KAAK,gBAAgB;AAAA,UACnC;AAAA,UACA,WAAW,MAAM;AAAA,QACnB,CAAC;AAAA,QACD,QAAQ,UAAU,MAAM;AAAA,QACxB,QAAQ,UAAU,MAAM;AAAA,QACxB,QAAQ,mBAAmB,CAAC;AAAA,QAC5B,QAAQ,mBAAmB,CAAC;AAAA,QAE5B,MAAM,QAAQ,QAAQ,CAAC,OAAO,QAAQ;AAAA,UACpC,KAAK,eACH;AAAA,YACE;AAAA,YACA,WAAW,MAAM;AAAA,YACjB,UAAU,gCAAmB,GAAG,EAAE;AAAA,YAClC,UAAU,gCAAmB,GAAG,EAAE;AAAA,UACpC,GACA,OACA;AAAA,YACE;AAAA,YACA,qBAAqB;AAAA,UACvB,CACF;AAAA,SACD;AAAA,OACF;AAAA,KACF;AAAA;AAAA,EAGH,QAAQ;AAAA,IACN;AAAA,IACA;AAAA,KAIoB;AAAA,IACpB,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,MAAM,QAAQ,UAAU,OAAO,IAAI,SAAS;AAAA,IAC5C,OAAO;AAAA;AAAA,EAGT,QAAQ;AAAA,IACN;AAAA,IACA;AAAA,KAIQ;AAAA,IACR,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,8CAAsB,YAAY;AAAA,IAC9C;AAAA,IACA,MAAM,QAAQ;AAAA,MACZ,MAAM;AAAA,MACN,OAAO,SAAS,OAAO;AAAA,MACvB,SAAS,IAAI;AAAA,MACb,UAAU,IAAI;AAAA,MACd,eAAe;AAAA,IACjB;AAAA,IAEA,IAAI,SAAS,OAAO,IAAI,MAAM,IAAI,GAAG;AAAA,MACnC,MAAM,IAAI,MAAM,sBAAsB;AAAA,IACxC;AAAA,IAEA,SAAS,OAAO,IAAI,WAAW,KAAK;AAAA,IAGpC,KAAK,gBAAgB,EAAE,cAAc,UAAU,CAAC;AAAA,IAEhD,OAAO;AAAA;AAAA,EAGT,WAAW;AAAA,IACT;AAAA,IACA;AAAA,KAIQ;AAAA,IACR,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,8CAAsB,YAAY;AAAA,IAC9C;AAAA,IACA,MAAM,QAAQ,SAAS,OAAO,IAAI,SAAS;AAAA,IAC3C,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,MAAM,iBAAiB;AAAA,IACnC;AAAA,IAGA,SAAS,OAAO,OAAO,SAAS;AAAA,IAGhC,MAAM,MAAM,KAAK,iBAAiB,cAAc,SAAS;AAAA,IACzD,KAAK,aAAa,OAAO,GAAG;AAAA,IAE5B,OAAO;AAAA;AAAA,EAGT,WAAW;AAAA,IACT;AAAA,IACA;AAAA,IACA;AAAA,KAKQ;AAAA,IACR,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,8CAAsB,YAAY;AAAA,IAC9C;AAAA,IACA,MAAM,QAAQ,SAAS,OAAO,IAAI,SAAS;AAAA,IAC3C,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,SAAS;AAAA,IACxC;AAAA,IAEA,IAAI,SAAS,OAAO,IAAI,YAAY,GAAG;AAAA,MACrC,MAAM,IAAI,MAAM,oCAAoC;AAAA,IACtD;AAAA,IAGA,MAAM,OAAO;AAAA,IAGb,SAAS,OAAO,IAAI,cAAc,KAAK;AAAA,IACvC,SAAS,OAAO,OAAO,SAAS;AAAA,IAGhC,MAAM,SAAS,KAAK,iBAAiB,cAAc,SAAS;AAAA,IAC5D,MAAM,SAAS,KAAK,iBAAiB,cAAc,YAAY;AAAA,IAC/D,MAAM,UAAU,KAAK,aAAa,IAAI,MAAM;AAAA,IAC5C,IAAI,SAAS;AAAA,MACX,KAAK,aAAa,IAAI,QAAQ,OAAO;AAAA,MACrC,KAAK,aAAa,OAAO,MAAM;AAAA,IACjC;AAAA,IAEA,OAAO;AAAA;AAAA,EAGT,iBAAiB,CAAC,gBAAmD;AAAA,IACnE,MAAM,SAAS,CAAC,QAA4B;AAAA,MAC1C,IAAI,QAAQ,CAAC,UAAU;AAAA,QACrB,MAAM,QAAQ,QAAQ,CAAC,MAAM,QAAQ;AAAA,UACnC,IAAI,OAAO,SAAS,YAAY,KAAK,WAAW,GAAG,GAAG;AAAA,YACpD,MAAM,UAAU,KAAK,MAAM,CAAC;AAAA,YAC5B,MAAM,iBAAiB,eAAe,OAAO;AAAA,YAG7C,IAAI,mBAAmB,SAAS;AAAA,cAC9B,MAAM,QAAQ,IAAI,KAAK,IAAI,gBAAgB;AAAA,YAC7C;AAAA,UACF;AAAA,SACD;AAAA,OACF;AAAA;AAAA,IAGH,KAAK,UAAU,QAAQ,CAAC,aAAa;AAAA,MACnC,OAAO,SAAS,MAAM;AAAA,KACvB;AAAA;AAAA,EAGH,uBAAuB,CACrB,iBACA,gBACM;AAAA,IACN,KAAK,UAAU,QAAQ,CAAC,UAAU,iBAAiB;AAAA,MACjD,SAAS,OAAO,QAAQ,CAAC,OAAO,cAAc;AAAA,QAC5C,MAAM,QAAQ,QAAQ,CAAC,MAAM,QAAQ;AAAA,UACnC,IAAI,OAAO,SAAS,YAAY,KAAK,WAAW,GAAG,GAAG;AAAA,YACpD,QAAQ,UAAU,aAAa,gCAAmB,GAAG;AAAA,YACrD,MAAM,UAAU,GAAG,gBAAgB,aAAa,YAAY;AAAA,YAG5D,IAAI,gBAAgB,IAAI,OAAO,GAAG;AAAA,cAChC;AAAA,YACF;AAAA,YAEA,MAAM,UAAU,KAAK,MAAM,CAAC;AAAA,YAC5B,MAAM,iBAAiB,eAAe,OAAO;AAAA,YAG7C,IAAI,mBAAmB,SAAS;AAAA,cAC9B,MAAM,QAAQ,IAAI,KAAK,IAAI,gBAAgB;AAAA,YAC7C;AAAA,UACF;AAAA,SACD;AAAA,OACF;AAAA,KACF;AAAA;AAAA,EAGH,yBAAyB,CACvB,cACA,gBACM;AAAA,IACN,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,8CAAsB,YAAY;AAAA,IAC9C;AAAA,IAEA,SAAS,OAAO,QAAQ,CAAC,UAAU;AAAA,MACjC,MAAM,QAAQ,QAAQ,CAAC,MAAM,QAAQ;AAAA,QACnC,IAAI,OAAO,SAAS,YAAY,KAAK,WAAW,GAAG,GAAG;AAAA,UACpD,MAAM,UAAU,KAAK,MAAM,CAAC;AAAA,UAC5B,MAAM,iBAAiB,eAAe,OAAO;AAAA,UAG7C,IAAI,mBAAmB,SAAS;AAAA,YAC9B,MAAM,QAAQ,IAAI,KAAK,IAAI,gBAAgB;AAAA,UAC7C;AAAA,QACF;AAAA,OACD;AAAA,KACF;AAAA;AAAA,EAGH,kBAAkB;AAAA,IAChB;AAAA,IACA;AAAA,KAImC;AAAA,IACnC,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,8CAAsB,YAAY;AAAA,IAC9C;AAAA,IACA,MAAM,QAAQ,SAAS,OAAO,IAAI,SAAS;AAAA,IAC3C,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,SAAS;AAAA,IACxC;AAAA,IAEA,OAAO,MAAM;AAAA;AAAA,EAMP,eAAe,CACrB,SACA,UACA,UACA,KACM;AAAA,IAEN,IAAI,WAAW,QAAQ,UAAU,IAAI,QAAQ;AAAA,IAC7C,IAAI,CAAC,UAAU;AAAA,MACb,WAAW,CAAC;AAAA,MACZ,QAAQ,UAAU,IAAI,UAAU,QAAQ;AAAA,IAC1C;AAAA,IACA,MAAM,WAAuB,EAAE,QAAQ,UAAU,IAAI;AAAA,IACrD,MAAM,eAAe,KAAK,gBAAgB,UAAU,QAAQ;AAAA,IAC5D,SAAS,OAAO,cAAc,GAAG,QAAQ;AAAA,IAGzC,IAAI,WAAW,QAAQ,UAAU,IAAI,QAAQ;AAAA,IAC7C,IAAI,CAAC,UAAU;AAAA,MACb,WAAW,CAAC;AAAA,MACZ,QAAQ,UAAU,IAAI,UAAU,QAAQ;AAAA,IAC1C;AAAA,IACA,MAAM,WAAuB,EAAE,QAAQ,UAAU,IAAI;AAAA,IACrD,MAAM,eAAe,KAAK,gBAAgB,UAAU,QAAQ;AAAA,IAC5D,SAAS,OAAO,cAAc,GAAG,QAAQ;AAAA,IAGzC,KAAK,aAAa,QAAQ,kBAAkB,EAAE,QAAQ,UAAU,IAAI,CAAC;AAAA,IACrE,KAAK,aAAa,QAAQ,kBAAkB,EAAE,QAAQ,UAAU,IAAI,CAAC;AAAA;AAAA,EAM/D,oBAAoB,CAC1B,SACA,UACA,UACA,KACM;AAAA,IAEN,MAAM,WAAW,QAAQ,UAAU,IAAI,QAAQ;AAAA,IAC/C,IAAI,UAAU;AAAA,MACZ,MAAM,gBAAgB,SAAS,OAAO,CAAC,MAAM,EAAE,QAAQ,GAAG;AAAA,MAC1D,IAAI,cAAc,WAAW,GAAG;AAAA,QAC9B,QAAQ,UAAU,OAAO,QAAQ;AAAA,MACnC,EAAO;AAAA,QACL,QAAQ,UAAU,IAAI,UAAU,aAAa;AAAA;AAAA,IAEjD;AAAA,IAGA,MAAM,WAAW,QAAQ,UAAU,IAAI,QAAQ;AAAA,IAC/C,IAAI,UAAU;AAAA,MACZ,MAAM,gBAAgB,SAAS,OAAO,CAAC,MAAM,EAAE,QAAQ,GAAG;AAAA,MAC1D,IAAI,cAAc,WAAW,GAAG;AAAA,QAC9B,QAAQ,UAAU,OAAO,QAAQ;AAAA,MACnC,EAAO;AAAA,QACL,QAAQ,UAAU,IAAI,UAAU,aAAa;AAAA;AAAA,IAEjD;AAAA,IAGA,QAAQ,mBAAmB,QAAQ,iBAAiB,OAClD,CAAC,SAAS,KAAK,QAAQ,GACzB;AAAA,IACA,QAAQ,mBAAmB,QAAQ,iBAAiB,OAClD,CAAC,SAAS,KAAK,QAAQ,GACzB;AAAA;AAAA,EAMM,eAAe,CAAC,SAAuB,GAAmB;AAAA,IAChE,OAAO,uBAAuB,mBAAmB,SAAS,CAAC;AAAA;AAAA,EAOrD,YAAY,CAAC,OAAqB,MAAwB;AAAA,IAEhE,MAAM,gBAAgB,MAAM,UAC1B,CAAC,aAAa,SAAS,WAAW,KAAK,UAAU,SAAS,QAAQ,KAAK,GACzE;AAAA,IAEA,IAAI,kBAAkB,IAAI;AAAA,MAExB;AAAA,IACF;AAAA,IAGA,MAAM,iBAAiB,uBAAuB,mBAC5C,OACA,KAAK,MACP;AAAA,IAGA,MAAM,OAAO,gBAAgB,GAAG,IAAI;AAAA;AAAA,EAGtC,cAAc,CACZ,SACA,SACA,SAUM;AAAA,IACN,MAAM,QACJ,SAAS,SACT,KAAK,SAAS;AAAA,MACZ,WAAW,QAAQ;AAAA,MACnB,cAAc,QAAQ;AAAA,IACxB,CAAC;AAAA,IAEH,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,QAAQ,SAAS;AAAA,IAChD;AAAA,IAEA,MAAM,UAAU,KAAK,gBAAgB;AAAA,MACnC,cAAc,QAAQ;AAAA,MACtB,WAAW,QAAQ;AAAA,IACrB,CAAC;AAAA,IACD,MAAM,MAAM,8BAAiB,OAAO;AAAA,IAEpC,IAAI,KAAK,eAAe,OAAO,GAAG;AAAA,MAChC,IAAI,CAAC,SAAS,qBAAqB;AAAA,QACjC,MAAM,QAAQ,OAAO,GAAG;AAAA,QAExB,KAAK,qBACH,SACA,QAAQ,UACR,QAAQ,UACR,GACF;AAAA,MACF;AAAA,IACF,EAAO;AAAA,MACL,MAAM,QAAQ,IAAI,KAAK,OAAO;AAAA,MAE9B,KAAK,gBAAgB,SAAS,QAAQ,UAAU,QAAQ,UAAU,GAAG;AAAA;AAAA;AAAA,EAOzE,eAAoC,CAAC,SAAsB,UAAuC;AAAA,IAChG,MAAM,QAAQ,KAAK,SAAS;AAAA,MAC1B,cAAc,QAAQ;AAAA,MACtB,WAAW,QAAQ;AAAA,IACrB,CAAC;AAAA,IACD,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,QAAQ,SAAS;AAAA,IAChD;AAAA,IAEA,MAAM,MAAM,8BAAiB,OAAO;AAAA,IACpC,IAAI,aAAa,WAAW;AAAA,MAC1B,MAAM,SAAS,OAAO,GAAG;AAAA,IAC3B,EAAO;AAAA,MACL,MAAM,SAAS,IAAI,KAAK,QAAQ;AAAA;AAAA;AAAA,EAOpC,eAAoC,CAAC,SAA6C;AAAA,IAChF,MAAM,QAAQ,KAAK,SAAS;AAAA,MAC1B,cAAc,QAAQ;AAAA,MACtB,WAAW,QAAQ;AAAA,IACrB,CAAC;AAAA,IACD,IAAI,CAAC,OAAO;AAAA,MACV;AAAA,IACF;AAAA,IAEA,MAAM,MAAM,8BAAiB,OAAO;AAAA,IACpC,OAAO,MAAM,SAAS,IAAI,GAAG;AAAA;AAAA,EAM/B,0BAA+C,CAAC,MAGrB;AAAA,IACzB,MAAM,QAAQ,KAAK,SAAS,IAAI;AAAA,IAChC,OAAO,OAAO,YAAY,IAAI;AAAA;AAAA,EAMhC,gBAA0C,CACxC,MACA,UACM;AAAA,IACN,MAAM,QAAQ,KAAK,SAAS,IAAI;AAAA,IAChC,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,KAAK,SAAS;AAAA,IAC7C;AAAA,IACA,MAAM,gBAAgB;AAAA;AAAA,EAMxB,gBAA0C,CACxC,MAC4B;AAAA,IAC5B,MAAM,QAAQ,KAAK,SAAS,IAAI;AAAA,IAChC,IAAI,CAAC,OAAO;AAAA,MACV;AAAA,IACF;AAAA,IACA,OAAO,MAAM;AAAA;AAAA,EAMf,mBAAgD,CAC9C,cACA,UACM;AAAA,IACN,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb,MAAM,IAAI,MAAM,aAAa,yBAAyB;AAAA,IACxD;AAAA,IACA,SAAS,mBAAmB;AAAA;AAAA,EAM9B,mBAAgD,CAC9C,cAC+B;AAAA,IAC/B,MAAM,WAAW,KAAK,UAAU,IAAI,YAAY;AAAA,IAChD,IAAI,CAAC,UAAU;AAAA,MACb;AAAA,IACF;AAAA,IACA,OAAO,SAAS;AAAA;AAAA,EAOlB,eAAe,CACb,MACA,YACM;AAAA,IACN,MAAM,QAAQ,KAAK,SAAS,IAAI;AAAA,IAChC,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,KAAK,SAAS;AAAA,IAC7C;AAAA,IAGA,MAAM,QAAQ,MAAM;AAAA,IAGpB,MAAM,MAAM,KAAK,iBAAiB,KAAK,cAAc,KAAK,SAAS;AAAA,IACnE,KAAK,aAAa,OAAO,GAAG;AAAA,IAG5B,WAAW,QAAQ,CAAC,OAAO,SAAQ;AAAA,MACjC,KAAK,eACH;AAAA,QACE,cAAc,KAAK;AAAA,QACnB,WAAW,KAAK;AAAA,QAChB,UAAU,gCAAmB,IAAG,EAAE;AAAA,QAClC,UAAU,gCAAmB,IAAG,EAAE;AAAA,MACpC,GACA,OACA;AAAA,QACE;AAAA,QACA,qBAAqB;AAAA,MACvB,CACF;AAAA,KACD;AAAA;AAAA,EAQH,qBAAqB,CAAC,SAAuB;AAAA,IAC3C,MAAM,QAAQ,KAAK,SAAS,OAAO;AAAA,IAEnC,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,QAAQ,SAAS;AAAA,IAChD;AAAA,IAGA,MAAM,aAAa,IAAI,IAAI,MAAM,OAAO;AAAA,IACxC,MAAM,cAAc,IAAI,IAAI,MAAM,QAAQ;AAAA,IAI1C,WAAW,eAAe,KAAK,oBAAoB,OAAO,GAAG;AAAA,MAC3D,MAAM,UAAU,8BAAiB,WAAW;AAAA,MAG5C,WAAW,OAAO,OAAO;AAAA,MACzB,YAAY,OAAO,OAAO;AAAA,IAC5B;AAAA,IAGA,KAAK,gBAAgB,SAAS,UAAU;AAAA,IAGxC,MAAM,WAAW;AAAA;AAAA,GAOlB,mBAAmB,CAAC,SAA+C;AAAA,IAElE,MAAM,QAAQ,KAAK,SAAS,OAAO;AAAA,IACnC,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,QAAQ,SAAS;AAAA,IAChD;AAAA,IAEA,MAAM,UAAU,KAAK,gBAAgB,OAAO;AAAA,IAE5C,MAAM,QAAQ,QAAQ;AAAA,IAKtB,IAAI,MAAM,IAAI,IAAI,SAAS,UAAU;AAAA,MAEnC,MAAM,aAAa,uBAAuB,wBACxC,QAAQ,kBACR,MAAM,MAAM,GACd;AAAA,MAEA,IAAI,eAAe;AAAA,QAAI;AAAA,MAGvB,SAAS,IAAI,WAAY,IAAI,QAAQ,iBAAiB,QAAQ,KAAK;AAAA,QACjE,MAAM,YAAY,QAAQ,iBAAiB;AAAA,QAC3C,IAAI,CAAC;AAAA,UAAW;AAAA,QAEhB,MAAM,SAAS,gCAAmB,UAAU,GAAG;AAAA,QAG/C,IAAI,OAAO,WAAW,MAAM,IAAI,IAAI;AAAA,UAAO;AAAA,QAG3C,IAAI,OAAO,WAAW,MAAM,MAAM;AAAA,UAAK;AAAA,QAEvC,IACE,MAAM,IAAI,IAAI,SAAS,YACvB,OAAO,WAAW,MAAM,IAAI,IAAI,OAChC;AAAA,UACA;AAAA,QACF;AAAA,QAEA,MAAM;AAAA,UACJ,UAAU,OAAO;AAAA,UACjB,UAAU,OAAO;AAAA,UACjB,WAAW,QAAQ;AAAA,UACnB,cAAc,QAAQ;AAAA,QACxB;AAAA,MACF;AAAA,IACF,EAAO;AAAA,MAEL,MAAM,aAAa,uBAAuB,wBACxC,QAAQ,kBACR,MAAM,MAAM,GACd;AAAA,MAEA,IAAI,eAAe;AAAA,QAAI;AAAA,MAGvB,SAAS,IAAI,WAAY,IAAI,QAAQ,iBAAiB,QAAQ,KAAK;AAAA,QACjE,MAAM,YAAY,QAAQ,iBAAiB;AAAA,QAC3C,IAAI,CAAC;AAAA,UAAW;AAAA,QAEhB,MAAM,SAAS,gCAAmB,UAAU,GAAG;AAAA,QAG/C,IAAI,OAAO,WAAW,MAAM,MAAM;AAAA,UAAK;AAAA,QAEvC,IACE,MAAM,IAAI,IAAI,SAAS,YACvB,OAAO,WAAW,MAAM,IAAI,IAAI,OAChC;AAAA,UACA;AAAA,QACF;AAAA,QAEA,MAAM;AAAA,UACJ,UAAU,OAAO;AAAA,UACjB,UAAU,OAAO;AAAA,UACjB,WAAW,QAAQ;AAAA,UACnB,cAAc,QAAQ;AAAA,QACxB;AAAA,MACF;AAAA;AAAA;AAAA,EAIJ,eAAe,CAAC,SAAsC;AAAA,IACpD,OAAO,MAAM,KAAK,KAAK,oBAAoB,OAAO,CAAC;AAAA;AAAA,EAG9C,cAAc,CAAC,aAA+C;AAAA,IACnE,MAAM,QAAQ,KAAK,SAAS,WAAW;AAAA,IACvC,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,YAAY,SAAS;AAAA,IACpD;AAAA,IACA,OAAO,MAAM,QAAQ,IAAI,8BAAiB,WAAW,CAAC;AAAA;AAAA,EAGjD,sBAAsB,CAAC,aAA+C;AAAA,IAC3E,MAAM,QAAQ,KAAK,SAAS,WAAW;AAAA,IACvC,IAAI,CAAC,OAAO;AAAA,MACV,MAAM,IAAI,2CAAmB,YAAY,SAAS;AAAA,IACpD;AAAA,IACA,OAAO,8CACL,MAAM,QAAQ,IAAI,8BAAiB,WAAW,CAAC,CACjD;AAAA;AAAA,EAGK,WAAW,CAAC,aAAmC;AAAA,IACpD,MAAM,UAAU,KAAK,eAAe,WAAW;AAAA,IAC/C,OACE,YAAY,aAAc,OAAO,YAAY,YAAY,YAAY;AAAA;AAAA,EAGlE,aAAa,CAAC,aAAmC;AAAA,IACtD,MAAM,UAAU,KAAK,eAAe,WAAW;AAAA,IAC/C,OAAO,OAAO,YAAY,YAAY,QAAQ,WAAW,GAAG;AAAA;AAAA,EAOvD,mBAAmB,CACxB,aACA,aACA;AAAA,IAEA,OAAO,oDAAoB,KAAK,MAAM,aAAa,WAAW;AAAA;AAElE;",
+  "debugId": "E071DA0B5FD7DF7F64756E2164756E21",
   "names": []
 }

package/dist/cjs/core/types.cjs.map

@@ -2,9 +2,9 @@
   "version": 3,
   "sources": ["../../../src/core/types.ts"],
   "sourcesContent": [
-    "/**\n * Core type definitions for FormulaEngine\n * This file contains all fundamental types used throughout the engine\n */\n\nimport type { EvaluationContext } from \"../evaluator/evaluation-context.cjs\";\nimport type { FormulaEvaluator } from \"../evaluator/formula-evaluator.cjs\";\nimport type { FunctionNode } from \"../parser/ast.cjs\";\nimport type { DependencyNode } from \"./managers/dependency-node.cjs\";\nimport type { LookupOrder } from \"./managers/range-eval-order-builder.cjs\";\n\n// Cell addressing types\nexport interface CellAddress {\n  sheetName: string;\n  workbookName: string;\n  colIndex: number;\n  rowIndex: number;\n}\n\nexport interface RangeAddress {\n  sheetName: string;\n  workbookName: string;\n  range: SpreadsheetRange;\n}\n\nexport interface LocalCellAddress {\n  colIndex: number;\n  rowIndex: number;\n}\n\nexport type ArethmeticEvaluator = (\n  left: CellValue,\n  right: CellValue,\n  context: EvaluationContext\n) => CellValue | ErrorEvaluationResult;\n\nexport type PositiveInfinity = {\n  type: \"infinity\";\n  sign: \"positive\";\n};\n\nexport type CellInfinity = {\n  type: \"infinity\";\n  sign: \"positive\" | \"negative\";\n};\n\nexport type CellNumber = {\n  type: \"number\";\n  value: number;\n};\n\nexport type SpreadsheetRangeEnd = CellNumber | PositiveInfinity;\n\nexport type SpreadsheetRange = {\n  start: {\n    col: number;\n    row: number;\n  };\n  end: {\n    col: SpreadsheetRangeEnd;\n    row: SpreadsheetRangeEnd;\n  };\n};\n\nexport type RelativeRange = {\n  start: {\n    col: number;\n    row: number;\n  };\n  width: SpreadsheetRangeEnd;\n  height: SpreadsheetRangeEnd;\n};\n\nexport type FiniteSpreadsheetRange = {\n  start: {\n    col: number;\n    row: number;\n  };\n  end: {\n    col: number;\n    row: number;\n  };\n};\n\nexport type CellString = {\n  type: \"string\";\n  value: string;\n};\n\nexport type CellBoolean = {\n  type: \"boolean\";\n  value: boolean;\n};\n\n// Cell value types\nexport type CellValue = CellNumber | CellString | CellBoolean | CellInfinity;\n/**\n * undefined and \"\" are considered empty values\n * undefineds are converted to \"\" in the engine\n *\n * any empty values are deleted from the sheet content\n */\nexport type SerializedCellValue = string | number | boolean | undefined;\n\n// Named expressions\nexport interface NamedExpression {\n  name: string;\n  expression: string;\n}\n\nexport interface TableDefinition {\n  name: string;\n  start: {\n    rowIndex: number;\n    colIndex: number;\n  };\n  headers: Map<string, { name: string; index: number }>;\n  endRow: SpreadsheetRangeEnd;\n  sheetName: string;\n  workbookName: string;\n}\n\n// Formula errors\nexport enum FormulaError {\n  DIV0 = \"#DIV/0!\",\n  NA = \"#N/A\",\n  NAME = \"#NAME?\",\n  NUM = \"#NUM!\",\n  REF = \"#REF!\",\n  VALUE = \"#VALUE!\",\n  CYCLE = \"#CYCLE!\",\n  ERROR = \"#ERROR!\",\n  SPILL = \"#SPILL!\",\n}\n\n// Sheet structure\nexport interface Sheet {\n  name: string;\n  index: number; // 0-based index of the sheet\n  content: Map<string, SerializedCellValue>;\n}\n\nexport interface Workbook {\n  name: string;\n  sheets: Map<string, Sheet>;\n}\n\nexport type ValueEvaluationResult = {\n  type: \"value\";\n  result: CellValue;\n  /**\n   * If the terminating evaluation result is a reference (see evaluateReference)\n   * then we store information about the source cell for context dependent functions like CELL\n   */\n  sourceCell?: CellAddress;\n};\n\nexport type AwaitingEvaluationResult = {\n  type: \"awaiting-evaluation\";\n  waitingFor: DependencyNode;\n  errAddress: DependencyNode;\n  /**\n   * If the terminating evaluation result is a reference (see evaluateReference)\n   * then we store information about the source cell for context dependent functions like CELL\n   */\n  sourceCell?: CellAddress;\n};\n\nexport type DoesNotSpillResult = {\n  type: \"does-not-spill\";\n};\n\nexport type ErrorEvaluationResult =\n  | {\n      type: \"error\";\n      err: FormulaError;\n      errAddress: DependencyNode;\n      message: string;\n      /**\n       * If the terminating evaluation result is a reference (see evaluateReference)\n       * then we store information about the source cell for context dependent functions like CELL\n       */\n      sourceCell?: CellAddress;\n    }\n  | AwaitingEvaluationResult;\n\nexport type SingleEvaluationResult =\n  | ValueEvaluationResult\n  | ErrorEvaluationResult;\n\nexport type SpilledValuesEvaluator = (\n  spillOffset: { x: number; y: number },\n  context: EvaluationContext\n) => SingleEvaluationResult;\n\nexport type SpilledValuesEvaluationResult = {\n  type: \"spilled-values\";\n\n  /**\n   * When a raw range is evaluated, we will add it to the sourceRange so it can be used e.g. for context dependent functions\n   */\n  sourceRange?: RangeAddress;\n\n  /**\n   * If the terminating evaluation result is a reference (see evaluateReference)\n   * then we store information about the source cell for context dependent functions like CELL\n   * sourceCell will only be defined on a spilledValue when a single value is looked up,\n   */\n  sourceCell?: CellAddress;\n\n  spillArea: (origin: CellAddress) => SpreadsheetRange;\n  /**\n   * for debugging we add a source string to denote where the spilled values were created\n   */\n  source: string;\n  evaluate: SpilledValuesEvaluator;\n  /**\n   * evaluateAllCells evaluates all non-empty cells in the spilled range.\n   * Because a spilled range can be open-ended, we need to have logic for which cells we should evaluate.\n   * e.g. when evaluating a range such as D:D only the cells in the current sheet residing in\n   * column D should be evaluated and cells producing spilled values that spill onto D:D.\n   *\n   * In order to evaluate spilled cells in D:D the range evaluateAllCells need to get all cells in the\n   * the intersection of the spilled range and D:D, for that reason evaluateAllCells gets an intersection parameter,\n   * where the intersection is relative to the origin.\n   *\n   * #### Producers:\n   * In e.g. SEQUENCE and evaluateRange we have logic for which cells in a spilled range we should evaluate,\n   *\n   * #### Nesting:\n   * e.g. evaluation of scalar operators where we want to nest e.g. `5 * right.evaluate()`\n   * can be implemented by calling\n   * ```ts\n   * const vals = child.evaluateAllCells.call(this, options);\n   * return vals.map(val => ({ ...val, result: 5 * val.result }));\n   * ```\n   *\n   * #### Consumers:\n   * Only functions that need access to all spilled values in a range end up calling evaluateAllCells, e.g.\n   * SUM, MIN, MAX, MATCH. Other types of functions like INDEX doesn't need to evaluate all cells in a range,\n   * but does a lookup into a spilled range using the evaluate method.\n   *\n   */\n  evaluateAllCells: (\n    this: FormulaEvaluator,\n    options: {\n      /**\n       * an intersection relative to the origin\n       */\n      intersection?: SpreadsheetRange;\n      evaluate: SpilledValuesEvaluator;\n      context: EvaluationContext;\n      /**\n       * origin is the cell address that the spilled range is spilled from\n       * e.g. in A3=B2:B4 the origin is A3\n       */\n      origin: CellAddress;\n\n      lookupOrder: LookupOrder;\n    }\n  ) => EvaluateAllCellsResult;\n};\n\nexport type EvaluateAllCellsResult =\n  | ErrorEvaluationResult\n  | {\n      type: \"values\";\n      values: CellInRangeResult[];\n    };\n\nexport type CellInRangeResult = {\n  result: SingleEvaluationResult;\n  relativePos: { x: number; y: number };\n};\n\nexport type FunctionEvaluationResult =\n  | SingleEvaluationResult\n  | SpilledValuesEvaluationResult;\n\nexport type SpilledValue = {\n  /**\n   * spillOnto is the range that the spilled value is spilled onto\n   */\n  spillOnto: SpreadsheetRange;\n  /**\n   * origin is the cell address that the spilled value is spilled from\n   */\n  origin: CellAddress;\n};\n\n/**\n * Function definition\n */\nexport interface FunctionDefinition {\n  name: string;\n  evaluate: (\n    this: FormulaEvaluator,\n    node: FunctionNode,\n    context: EvaluationContext\n  ) => FunctionEvaluationResult;\n  aliases?: string[];\n}\n\n/**\n * Evaluation result\n */\nexport type EvaluationResult = {\n  dependencies: Set<string>;\n} & FunctionEvaluationResult;\n\nexport type SCC = {\n  id: number;\n  nodes: Set<DependencyNode>; // All nodes considering soft + hard edges\n  evaluationOrder: DependencyNode[]; // Flat topologically ordered list\n  resolved: boolean;\n  hardEdgeSCCs: Set<DependencyNode>[]; // SCCs formed by only hard edges (regular dependencies)\n};\n\nexport type SCCDAG = {\n  sccList: SCC[];\n  sccGraph: Map<number, Set<number>>; // Adjacency list of SCC dependencies\n};\n\nexport type EvaluationOrder = {\n  evaluationOrder: Set<DependencyNode>;\n  hasCycle: boolean;\n  cycleNodes?: Set<DependencyNode>;\n  hash: string;\n  sccDAG?: SCCDAG;\n};\n\n// Conditional Styling types\nexport interface LCHColor {\n  l: number; // Lightness: 0-100\n  c: number; // Chroma: 0-150+\n  h: number; // Hue: 0-360\n}\n\nexport interface FormulaStyleCondition {\n  type: \"formula\";\n  formula: string;\n  color: LCHColor;\n}\n\nexport interface GradientStyleCondition {\n  type: \"gradient\";\n  min:\n    | { type: \"lowest_value\"; color: LCHColor }\n    | { type: \"number\"; color: LCHColor; valueFormula: string };\n  max:\n    | { type: \"highest_value\"; color: LCHColor }\n    | { type: \"number\"; color: LCHColor; valueFormula: string };\n}\n\nexport type StyleCondition = FormulaStyleCondition | GradientStyleCondition;\n\nexport interface ConditionalStyle {\n  area: RangeAddress;\n  condition: StyleCondition;\n}\n\nexport interface DirectCellStyle {\n  area: RangeAddress;\n  style: CellStyle\n}\n\nexport interface CellStyle {\n  backgroundColor?: string; // Hex color format\n  color?: string; // Text color in hex format\n  fontSize?: number; // Font size in pixels\n  bold?: boolean;\n  italic?: boolean;\n  underline?: boolean;\n}\n\nexport interface CopyCellsOptions {\n  cut: boolean;\n  /**\n   * all: Copy everything from the source to the target\n   * content: Copy only the content from the source to the target\n   * style: Copy only the style from the source to the target\n   */\n  target: 'all' | 'content' | 'style';\n  /**\n   * The type of the content to copy\n   * value: Copy the value from the source to the target,\n   * e.g. if the cell has the formula =123 + 123 then the value is 246\n   * formula: Copy the formula from the source to the target,\n   * e.g. if the cell has the formula =123 + 123 then the formula is =123 + 123 is copied\n   */\n  type: \"value\" | \"formula\";\n}\n"
+    "/**\n * Core type definitions for FormulaEngine\n * This file contains all fundamental types used throughout the engine\n */\n\nimport type { EvaluationContext } from \"../evaluator/evaluation-context.cjs\";\nimport type { FormulaEvaluator } from \"../evaluator/formula-evaluator.cjs\";\nimport type { FunctionNode } from \"../parser/ast.cjs\";\nimport type { DependencyNode } from \"./managers/dependency-node.cjs\";\nimport type { LookupOrder } from \"./managers/range-eval-order-builder.cjs\";\n\n// Cell addressing types\nexport interface CellAddress {\n  sheetName: string;\n  workbookName: string;\n  colIndex: number;\n  rowIndex: number;\n}\n\nexport interface RangeAddress {\n  sheetName: string;\n  workbookName: string;\n  range: SpreadsheetRange;\n}\n\nexport interface LocalCellAddress {\n  colIndex: number;\n  rowIndex: number;\n}\n\nexport type ArethmeticEvaluator = (\n  left: CellValue,\n  right: CellValue,\n  context: EvaluationContext\n) => CellValue | ErrorEvaluationResult;\n\nexport type PositiveInfinity = {\n  type: \"infinity\";\n  sign: \"positive\";\n};\n\nexport type CellInfinity = {\n  type: \"infinity\";\n  sign: \"positive\" | \"negative\";\n};\n\nexport type CellNumber = {\n  type: \"number\";\n  value: number;\n};\n\nexport type SpreadsheetRangeEnd = CellNumber | PositiveInfinity;\n\nexport type SpreadsheetRange = {\n  start: {\n    col: number;\n    row: number;\n  };\n  end: {\n    col: SpreadsheetRangeEnd;\n    row: SpreadsheetRangeEnd;\n  };\n};\n\nexport type RelativeRange = {\n  start: {\n    col: number;\n    row: number;\n  };\n  width: SpreadsheetRangeEnd;\n  height: SpreadsheetRangeEnd;\n};\n\nexport type FiniteSpreadsheetRange = {\n  start: {\n    col: number;\n    row: number;\n  };\n  end: {\n    col: number;\n    row: number;\n  };\n};\n\nexport type CellString = {\n  type: \"string\";\n  value: string;\n};\n\nexport type CellBoolean = {\n  type: \"boolean\";\n  value: boolean;\n};\n\n// Cell value types\nexport type CellValue = CellNumber | CellString | CellBoolean | CellInfinity;\n/**\n * undefined and \"\" are considered empty values\n * undefineds are converted to \"\" in the engine\n *\n * any empty values are deleted from the sheet content\n */\nexport type SerializedCellValue = string | number | boolean | undefined;\n\n\n// Named expressions\nexport interface NamedExpression {\n  name: string;\n  expression: string;\n}\n\nexport interface TableDefinition {\n  name: string;\n  start: {\n    rowIndex: number;\n    colIndex: number;\n  };\n  headers: Map<string, { name: string; index: number }>;\n  endRow: SpreadsheetRangeEnd;\n  sheetName: string;\n  workbookName: string;\n}\n\n// Formula errors\nexport enum FormulaError {\n  DIV0 = \"#DIV/0!\",\n  NA = \"#N/A\",\n  NAME = \"#NAME?\",\n  NUM = \"#NUM!\",\n  REF = \"#REF!\",\n  VALUE = \"#VALUE!\",\n  CYCLE = \"#CYCLE!\",\n  ERROR = \"#ERROR!\",\n  SPILL = \"#SPILL!\",\n}\n\n// Sheet structure\nexport interface Sheet<TCellMetadata = unknown, TSheetMetadata = unknown> {\n  name: string;\n  index: number; // 0-based index of the sheet\n  content: Map<string, SerializedCellValue>;\n  /**\n   * Cell metadata - arbitrary consumer-defined data per cell\n   * Examples: rich text content, links, comments, custom app data\n   * The engine stores and copies this data but doesn't interpret it\n   * Keyed by cell reference (e.g., \"A1\")\n   */\n  metadata: Map<string, TCellMetadata>;\n  /**\n   * Sheet-level metadata - arbitrary consumer-defined data for the entire sheet\n   * Examples: text boxes, drawings, frozen panes, print settings\n   * The engine stores and copies this data but doesn't interpret it\n   */\n  sheetMetadata: TSheetMetadata;\n}\n\nexport interface Workbook<TCellMetadata = unknown, TSheetMetadata = unknown, TWorkbookMetadata = unknown> {\n  name: string;\n  sheets: Map<string, Sheet<TCellMetadata, TSheetMetadata>>;\n  /**\n   * Workbook-level metadata - arbitrary consumer-defined data for the entire workbook\n   * Examples: themes, custom ribbons, document properties, workbook settings\n   * The engine stores and copies this data but doesn't interpret it\n   */\n  workbookMetadata: TWorkbookMetadata;\n}\n\n/**\n * Tracked reference - a stable reference to a range that updates automatically\n * when workbooks/sheets are renamed and becomes invalid when they're deleted\n */\nexport interface TrackedReference {\n  id: string;              // UUID\n  address: RangeAddress;   // The range being tracked\n  isValid: boolean;        // False if sheet/workbook deleted\n}\n\nexport type ValueEvaluationResult = {\n  type: \"value\";\n  result: CellValue;\n  /**\n   * If the terminating evaluation result is a reference (see evaluateReference)\n   * then we store information about the source cell for context dependent functions like CELL\n   */\n  sourceCell?: CellAddress;\n};\n\nexport type AwaitingEvaluationResult = {\n  type: \"awaiting-evaluation\";\n  waitingFor: DependencyNode;\n  errAddress: DependencyNode;\n  /**\n   * If the terminating evaluation result is a reference (see evaluateReference)\n   * then we store information about the source cell for context dependent functions like CELL\n   */\n  sourceCell?: CellAddress;\n};\n\nexport type DoesNotSpillResult = {\n  type: \"does-not-spill\";\n};\n\nexport type ErrorEvaluationResult =\n  | {\n      type: \"error\";\n      err: FormulaError;\n      errAddress: DependencyNode;\n      message: string;\n      /**\n       * If the terminating evaluation result is a reference (see evaluateReference)\n       * then we store information about the source cell for context dependent functions like CELL\n       */\n      sourceCell?: CellAddress;\n    }\n  | AwaitingEvaluationResult;\n\nexport type SingleEvaluationResult =\n  | ValueEvaluationResult\n  | ErrorEvaluationResult;\n\nexport type SpilledValuesEvaluator = (\n  spillOffset: { x: number; y: number },\n  context: EvaluationContext\n) => SingleEvaluationResult;\n\nexport type SpilledValuesEvaluationResult = {\n  type: \"spilled-values\";\n\n  /**\n   * When a raw range is evaluated, we will add it to the sourceRange so it can be used e.g. for context dependent functions\n   */\n  sourceRange?: RangeAddress;\n\n  /**\n   * If the terminating evaluation result is a reference (see evaluateReference)\n   * then we store information about the source cell for context dependent functions like CELL\n   * sourceCell will only be defined on a spilledValue when a single value is looked up,\n   */\n  sourceCell?: CellAddress;\n\n  spillArea: (origin: CellAddress) => SpreadsheetRange;\n  /**\n   * for debugging we add a source string to denote where the spilled values were created\n   */\n  source: string;\n  evaluate: SpilledValuesEvaluator;\n  /**\n   * evaluateAllCells evaluates all non-empty cells in the spilled range.\n   * Because a spilled range can be open-ended, we need to have logic for which cells we should evaluate.\n   * e.g. when evaluating a range such as D:D only the cells in the current sheet residing in\n   * column D should be evaluated and cells producing spilled values that spill onto D:D.\n   *\n   * In order to evaluate spilled cells in D:D the range evaluateAllCells need to get all cells in the\n   * the intersection of the spilled range and D:D, for that reason evaluateAllCells gets an intersection parameter,\n   * where the intersection is relative to the origin.\n   *\n   * #### Producers:\n   * In e.g. SEQUENCE and evaluateRange we have logic for which cells in a spilled range we should evaluate,\n   *\n   * #### Nesting:\n   * e.g. evaluation of scalar operators where we want to nest e.g. `5 * right.evaluate()`\n   * can be implemented by calling\n   * ```ts\n   * const vals = child.evaluateAllCells.call(this, options);\n   * return vals.map(val => ({ ...val, result: 5 * val.result }));\n   * ```\n   *\n   * #### Consumers:\n   * Only functions that need access to all spilled values in a range end up calling evaluateAllCells, e.g.\n   * SUM, MIN, MAX, MATCH. Other types of functions like INDEX doesn't need to evaluate all cells in a range,\n   * but does a lookup into a spilled range using the evaluate method.\n   *\n   */\n  evaluateAllCells: (\n    this: FormulaEvaluator,\n    options: {\n      /**\n       * an intersection relative to the origin\n       */\n      intersection?: SpreadsheetRange;\n      evaluate: SpilledValuesEvaluator;\n      context: EvaluationContext;\n      /**\n       * origin is the cell address that the spilled range is spilled from\n       * e.g. in A3=B2:B4 the origin is A3\n       */\n      origin: CellAddress;\n\n      lookupOrder: LookupOrder;\n    }\n  ) => EvaluateAllCellsResult;\n};\n\nexport type EvaluateAllCellsResult =\n  | ErrorEvaluationResult\n  | {\n      type: \"values\";\n      values: CellInRangeResult[];\n    };\n\nexport type CellInRangeResult = {\n  result: SingleEvaluationResult;\n  relativePos: { x: number; y: number };\n};\n\nexport type FunctionEvaluationResult =\n  | SingleEvaluationResult\n  | SpilledValuesEvaluationResult;\n\nexport type SpilledValue = {\n  /**\n   * spillOnto is the range that the spilled value is spilled onto\n   */\n  spillOnto: SpreadsheetRange;\n  /**\n   * origin is the cell address that the spilled value is spilled from\n   */\n  origin: CellAddress;\n};\n\n/**\n * Function definition\n */\nexport interface FunctionDefinition {\n  name: string;\n  evaluate: (\n    this: FormulaEvaluator,\n    node: FunctionNode,\n    context: EvaluationContext\n  ) => FunctionEvaluationResult;\n  aliases?: string[];\n}\n\n/**\n * Evaluation result\n */\nexport type EvaluationResult = {\n  dependencies: Set<string>;\n} & FunctionEvaluationResult;\n\nexport type SCC = {\n  id: number;\n  nodes: Set<DependencyNode>; // All nodes considering soft + hard edges\n  evaluationOrder: DependencyNode[]; // Flat topologically ordered list\n  resolved: boolean;\n  hardEdgeSCCs: Set<DependencyNode>[]; // SCCs formed by only hard edges (regular dependencies)\n};\n\nexport type SCCDAG = {\n  sccList: SCC[];\n  sccGraph: Map<number, Set<number>>; // Adjacency list of SCC dependencies\n};\n\nexport type EvaluationOrder = {\n  evaluationOrder: Set<DependencyNode>;\n  hasCycle: boolean;\n  cycleNodes?: Set<DependencyNode>;\n  hash: string;\n  sccDAG?: SCCDAG;\n};\n\n// Conditional Styling types\nexport interface LCHColor {\n  l: number; // Lightness: 0-100\n  c: number; // Chroma: 0-150+\n  h: number; // Hue: 0-360\n}\n\nexport interface FormulaStyleCondition {\n  type: \"formula\";\n  formula: string;\n  color: LCHColor;\n}\n\nexport interface GradientStyleCondition {\n  type: \"gradient\";\n  min:\n    | { type: \"lowest_value\"; color: LCHColor }\n    | { type: \"number\"; color: LCHColor; valueFormula: string };\n  max:\n    | { type: \"highest_value\"; color: LCHColor }\n    | { type: \"number\"; color: LCHColor; valueFormula: string };\n}\n\nexport type StyleCondition = FormulaStyleCondition | GradientStyleCondition;\n\nexport interface ConditionalStyle {\n  areas: RangeAddress[];\n  condition: StyleCondition;\n}\n\nexport interface DirectCellStyle {\n  areas: RangeAddress[];\n  style: CellStyle\n}\n\nexport interface CellStyle {\n  backgroundColor?: string; // Hex color format\n  color?: string; // Text color in hex format\n  fontSize?: number; // Font size in pixels\n  bold?: boolean;\n  italic?: boolean;\n  underline?: boolean;\n}\n\nexport interface CopyCellsOptions {\n  /**\n   * Whether this is a cut operation (clears source cells after copying)\n   * @default false\n   */\n  cut?: boolean;\n  /**\n   * What to include in the copy operation.\n   * - Use 'all' as shorthand for ['content', 'style', 'metadata']\n   * - Use array for fine-grained control over what to copy:\n   *   - ['content'] - copy only values/formulas\n   *   - ['style'] - copy only formatting\n   *   - ['metadata'] - copy only metadata (rich text, links, etc.)\n   *   - ['content', 'style'] - copy content and formatting\n   *   - ['content', 'metadata'] - copy content and metadata\n   *   - ['style', 'metadata'] - copy formatting and metadata\n   *   - ['content', 'style', 'metadata'] - same as 'all'\n   * @default 'all'\n   */\n  include?: 'all' | ('content' | 'style' | 'metadata')[];\n  /**\n   * The type of the content to copy\n   * value: Copy the value from the source to the target,\n   * e.g. if the cell has the formula =123 + 123 then the value is 246\n   * formula: Copy the formula from the source to the target,\n   * e.g. if the cell has the formula =123 + 123 then the formula is =123 + 123 is copied\n   * @default 'formula'\n   */\n  type?: \"value\" | \"formula\";\n}\n"
   ],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2HO,IAAK;AAAA,CAAL,CAAK,kBAAL;AAAA,EACL,wBAAO;AAAA,EACP,sBAAK;AAAA,EACL,wBAAO;AAAA,EACP,uBAAM;AAAA,EACN,uBAAM;AAAA,EACN,yBAAQ;AAAA,EACR,yBAAQ;AAAA,EACR,yBAAQ;AAAA,EACR,yBAAQ;AAAA,GATE;",
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4HO,IAAK;AAAA,CAAL,CAAK,kBAAL;AAAA,EACL,wBAAO;AAAA,EACP,sBAAK;AAAA,EACL,wBAAO;AAAA,EACP,uBAAM;AAAA,EACN,uBAAM;AAAA,EACN,yBAAQ;AAAA,EACR,yBAAQ;AAAA,EACR,yBAAQ;AAAA,EACR,yBAAQ;AAAA,GATE;",
   "debugId": "F54C7C141D21E24164756E2164756E21",
   "names": []
 }

package/dist/cjs/package.json

@@ -1,5 +1,5 @@
 {
   "name": "@ricsam/formula-engine",
-  "version": "0.0.15",
+  "version": "0.0.17",
   "type": "commonjs"
 }

package/dist/mjs/core/autofill-utils.mjs

@@ -63,6 +63,7 @@ class AutoFill {
     });
     this.engine.setSheetContent(opts, newContent);
     this.fillStyles(opts, finiteSeedRange, finiteFillRange, direction);
+    this.fillMetadata(opts, finiteSeedRange, finiteFillRange, direction);
   }
   getSeedCells(opts, seedRange) {
     const cells = [];
@@ -324,55 +325,92 @@ class AutoFill {
           rowIndex: row
         };
         for (const style of allConditionalStyles) {
-          if (style.area.workbookName === opts.workbookName && style.area.sheetName === opts.sheetName) {
-            const intersection = intersectRanges(style.area.range, sourceCellRange);
-            if (intersection) {
-              const newStyle = {
-                area: {
-                  workbookName: opts.workbookName,
-                  sheetName: opts.sheetName,
-                  range: {
-                    start: { col: targetCell.colIndex, row: targetCell.rowIndex },
-                    end: {
-                      col: { type: "number", value: targetCell.colIndex },
-                      row: { type: "number", value: targetCell.rowIndex }
+          for (const area of style.areas) {
+            if (area.workbookName === opts.workbookName && area.sheetName === opts.sheetName) {
+              const intersection = intersectRanges(area.range, sourceCellRange);
+              if (intersection) {
+                const newStyle = {
+                  areas: [{
+                    workbookName: opts.workbookName,
+                    sheetName: opts.sheetName,
+                    range: {
+                      start: { col: targetCell.colIndex, row: targetCell.rowIndex },
+                      end: {
+                        col: { type: "number", value: targetCell.colIndex },
+                        row: { type: "number", value: targetCell.rowIndex }
+                      }
                     }
-                  }
-                },
-                condition: style.condition
-              };
-              this.styleManager.addConditionalStyle(newStyle);
+                  }],
+                  condition: style.condition
+                };
+                this.styleManager.addConditionalStyle(newStyle);
+              }
             }
           }
         }
         for (const style of allCellStyles) {
-          if (style.area.workbookName === opts.workbookName && style.area.sheetName === opts.sheetName) {
-            const intersection = intersectRanges(style.area.range, sourceCellRange);
-            if (intersection) {
-              const newStyle = {
-                area: {
-                  workbookName: opts.workbookName,
-                  sheetName: opts.sheetName,
-                  range: {
-                    start: { col: targetCell.colIndex, row: targetCell.rowIndex },
-                    end: {
-                      col: { type: "number", value: targetCell.colIndex },
-                      row: { type: "number", value: targetCell.rowIndex }
+          for (const area of style.areas) {
+            if (area.workbookName === opts.workbookName && area.sheetName === opts.sheetName) {
+              const intersection = intersectRanges(area.range, sourceCellRange);
+              if (intersection) {
+                const newStyle = {
+                  areas: [{
+                    workbookName: opts.workbookName,
+                    sheetName: opts.sheetName,
+                    range: {
+                      start: { col: targetCell.colIndex, row: targetCell.rowIndex },
+                      end: {
+                        col: { type: "number", value: targetCell.colIndex },
+                        row: { type: "number", value: targetCell.rowIndex }
+                      }
                     }
-                  }
-                },
-                style: style.style
-              };
-              this.styleManager.addCellStyle(newStyle);
+                  }],
+                  style: style.style
+                };
+                this.styleManager.addCellStyle(newStyle);
+              }
             }
           }
         }
       }
     }
   }
+  fillMetadata(opts, seedRange, fillRange, direction) {
+    const seedWidth = seedRange.end.col - seedRange.start.col + 1;
+    const seedHeight = seedRange.end.row - seedRange.start.row + 1;
+    for (let row = fillRange.start.row;row <= fillRange.end.row; row++) {
+      for (let col = fillRange.start.col;col <= fillRange.end.col; col++) {
+        let seedCol;
+        let seedRow;
+        if (direction === "down" || direction === "up") {
+          seedCol = seedRange.start.col + (col - fillRange.start.col) % seedWidth;
+          seedRow = seedRange.start.row + (row - fillRange.start.row) % seedHeight;
+        } else {
+          seedRow = seedRange.start.row + (row - fillRange.start.row) % seedHeight;
+          seedCol = seedRange.start.col + (col - fillRange.start.col) % seedWidth;
+        }
+        const sourceCellAddress = {
+          workbookName: opts.workbookName,
+          sheetName: opts.sheetName,
+          colIndex: seedCol,
+          rowIndex: seedRow
+        };
+        const targetCellAddress = {
+          workbookName: opts.workbookName,
+          sheetName: opts.sheetName,
+          colIndex: col,
+          rowIndex: row
+        };
+        const sourceMetadata = this.workbookManager.getCellMetadata(sourceCellAddress);
+        if (sourceMetadata) {
+          this.workbookManager.setCellMetadata(targetCellAddress, { ...sourceMetadata });
+        }
+      }
+    }
+  }
 }
 export {
   AutoFill
 };
 
-//# debugId=40379B665DE6663764756E2164756E21
+//# debugId=30954F7E8DEBBB8364756E2164756E21