@freighttech/ui 0.13.18

package/dist/backend/dynamic-table/store/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/backend/dynamic-table/store/index.ts"],
+  "sourcesContent": ["// store.ts\n\nimport type React from 'react';\nimport {\n  CellId,\n  SelectionState,\n  SelectionBounds,\n  CellState,\n  SaveStateType,\n  CellSubscriber,\n  ColumnDef,\n  RangeEdges,\n  FillPreview,\n  ClipboardMarker,\n  UndoCellChange,\n  UndoEntry,\n} from '../types/index';\n\nexport interface CellStore {\n  // --- Reads (imperative, no subscription) ---\n  /**\n   * THE single cell-value read. A pure projection of the row object:\n   * `getRowData(row)?.[currentColumns[col].data]` \u2014 exactly what `Cell.tsx`\n   * renders. There is deliberately no second value map: a column-indexed cache\n   * cannot survive a perspective reorder or a show/hide (`setColumns` re-keys\n   * widths but could never re-key a stale value map correctly), which is how\n   * copy and export used to disagree with the screen. Never reintroduce one.\n   */\n  getCellValue(row: number, col: number): any;\n  getRowData(row: number): any;\n  getRowCount(): number;\n  getSelection(): SelectionState;\n  getSelectionBounds(): SelectionBounds | null;\n  getFillPreview(): FillPreview | null;\n  /**\n   * In-grid Find & Replace state. Lives HERE, not in React state: `Cell` is\n   * memo'd and subscribes per cell, so routing match state through a parent\n   * would repaint every mounted row on every keystroke.\n   */\n  /** The marching-ants rectangle, or `null` when nothing is marked. */\n  getClipboardMarker(): ClipboardMarker | null;\n  getEditingCell(): { row: number; col: number } | null;\n  getSaveState(row: number, col: number): SaveStateType;\n  isNewRow(row: number): boolean;\n  hasNewRows(): boolean;\n  /**\n   * The column's PAINTED width: its declared width plus any fill-to-container\n   * surplus assigned by `setColumnStretch`. Every render site (cells, headers,\n   * spacers, the column virtualizer's geometry) reads this one number, which is\n   * what keeps a virtualization spacer honest while the table fills its\n   * container.\n   */\n  getColumnWidth(col: number): number;\n  /**\n   * The column's DECLARED width \u2014 what the column definition asked for, or what\n   * the user last dragged it to. Never includes the fill surplus.\n   *\n   * Read by everything that must not feed the fill back into itself:\n   * persistence (a stretched width must never be saved as a user preference),\n   * badge auto-fit (it grows the declared width), and the fill computation itself.\n   */\n  getBaseColumnWidth(col: number): number;\n  getColumnWidths(): Map<number, number>;\n  /**\n   * Assign the surplus that fills the container, in resolved PIXELS, keyed by\n   * column index. Replaces the previous assignment wholesale; an empty map\n   * clears it. No-ops (and notifies nobody) when nothing actually moved, which\n   * is what stops the measure \u2192 apply \u2192 measure loop.\n   */\n  setColumnStretch(next: Map<number, number>): void;\n  getStoreRevision(): number;\n  getSelectionRevision(): number;\n\n  // Derived for cell rendering\n  getCellState(row: number, col: number): CellState;\n\n  // For copy/paste operations\n  getCellsInSelection(): { row: number; col: number; value: any }[];\n  /**\n   * Every cell of an arbitrary rectangle, row-major. `getCellsInSelection()`\n   * delegates to this; fill reads its source block through it, and paste needs\n   * the identical walk. Addressing is by INDEX into the full column array \u2014 a\n   * column that is scrolled out of the virtualization window is still a column.\n   */\n  getCellsInRect(bounds: SelectionBounds): { row: number; col: number; value: any }[];\n\n  // --- Writes (trigger revisions) ---\n  setCellValue(row: number, col: number, value: any): void;\n  setRowData(row: number, data: any): void;\n  setSelection(selection: SelectionState): void;\n  setFillPreview(preview: FillPreview | null): void;\n  /** Replace the finder's state, repainting only the cells whose match status changed. */\n  /**\n   * Mark (or unmark) what is on the clipboard \u2014 Excel's marching ants.\n   * Repaints the UNION of the old and the new rectangle, nothing else.\n   */\n  setClipboardMarker(marker: ClipboardMarker | null): void;\n  setEditingCell(row: number, col: number): void;\n  clearEditing(): void;\n  /**\n   * The cell under the pointer, or `null` on leaving the grid. Repaints only\n   * the cell left and the cell entered \u2014 never the row, never the table.\n   */\n  setHoveredCell(cell: { row: number; col: number } | null): void;\n  setSaveState(row: number, col: number, state: SaveStateType): void;\n  setColumnWidth(col: number, width: number): void;\n\n  // Bulk data operations\n  setData(data: any[]): void;\n  setColumns(columns: ColumnDef[]): void;\n  reinitColumnWidths(): void;\n  addRow(rowData: any, atIndex?: number): void;\n  removeRow(rowIndex: number): void;\n  markRowAsNew(rowIndex: number, isNew: boolean): void;\n  markRowAsSaved(rowIndex: number, savedData: any): void;\n\n  // --- Subscriptions ---\n  subscribe(row: number, col: number, callback: CellSubscriber): () => void;\n  subscribeToStore(callback: CellSubscriber): () => void;\n  subscribeToSelection(callback: CellSubscriber): () => void;\n  /**\n   * Fires when the EDITING CELL moves (opened, moved, closed) \u2014 and nothing\n   * else. Deliberately separate from the selection channel: `setEditingCell`\n   * bumps only the two affected cells' revisions, so a selection subscriber\n   * cannot see it, and widening `setEditingCell` to bump the selection revision\n   * would re-render every mounted row on every edit start.\n   *\n   * Column virtualization is the reason this exists: the edited column is\n   * force-mounted, so the grid has to learn that it moved.\n   */\n  subscribeToEditing(callback: CellSubscriber): () => void;\n  getRevision(row: number, col: number): number;\n\n  // --- Table container focus management ---\n  setTableRef(ref: React.RefObject<HTMLDivElement | null>): void;\n  focusTable(): void;\n  blurTable(): void;\n\n  // --- Undo / redo ---\n  /** Record one cell mutation. No-op while suppressed (during replay). */\n  recordCellChange(change: UndoCellChange): void;\n  /** Open a group so subsequent recorded changes coalesce into one entry. */\n  beginUndoGroup(): void;\n  /** Close the open group, pushing it as a single entry if it has changes. */\n  endUndoGroup(): void;\n  popUndo(): UndoEntry | null;\n  popRedo(): UndoEntry | null;\n  pushUndo(entry: UndoEntry): void;\n  pushRedo(entry: UndoEntry): void;\n  canUndo(): boolean;\n  canRedo(): boolean;\n  setUndoSuppressed(suppressed: boolean): void;\n  /** Resolve a stable row id to its current row index, or -1 if not present. */\n  findRowIndexById(idColumnName: string, id: any): number;\n\n  // --- Internal ---\n  bumpRevision(row: number, col: number): void;\n  bumpRevisions(cells: Array<{ row: number; col: number }>): void;\n  bumpRowRevisions(row: number, colCount: number): void;\n  bumpStoreRevision(): void;\n}\n\nexport function createCellStore(initialData: any[], columns: ColumnDef[]): CellStore {\n  // Internal state.\n  // `rowDataMap` is the ONE value source. Everything else here is metadata\n  // (revisions, save states, widths, new-row flags) keyed by position.\n  const rowDataMap = new Map<number, any>();\n  const revisions = new Map<CellId, number>();\n  const subscribers = new Map<CellId, Set<CellSubscriber>>();\n  const saveStates = new Map<CellId, SaveStateType>();\n  const newRowFlags = new Set<number>();\n  const columnWidths = new Map<number, number>();\n  // Fill-to-container surplus, in pixels, per column index. Held SEPARATELY\n  // from the declared widths so a user's own drag, a persisted width and a\n  // badge auto-fit are never overwritten by the fill \u2014 and so the fill can be\n  // recomputed from scratch on every container resize instead of accumulating.\n  const columnStretch = new Map<number, number>();\n  const storeSubscribers = new Set<CellSubscriber>();\n\n  // Mutable columns reference - updated when column order/visibility changes\n  let currentColumns = columns;\n\n  let selection: SelectionState = { type: null, anchor: null, focus: null };\n  let fillPreview: FillPreview | null = null;\n  // Excel's marching ants. Deliberately NOT derived from the selection: it has\n  // to outlive the cursor moving away, which is the entire point of it.\n  let clipboardMarker: ClipboardMarker | null = null;\n  let editingCell: { row: number; col: number } | null = null;\n  // Pointer position in CELL space. See `setHoveredCell` for why this is not\n  // React state.\n  let hoveredCell: { row: number; col: number } | null = null;\n\n  // Undo / redo: stacks of entries (one inline edit, or one whole fill).\n  const UNDO_LIMIT = 100;\n  const undoStack: UndoEntry[] = [];\n  const redoStack: UndoEntry[] = [];\n  let undoGroup: UndoCellChange[] | null = null;\n  let suppressUndo = false;\n  let rowCount = initialData.length;\n  let storeRevision = 0;\n  let selectionRevision = 0;\n  const selectionSubscribers = new Set<CellSubscriber>();\n  const editingSubscribers = new Set<CellSubscriber>();\n  let tableRef: React.RefObject<HTMLDivElement | null> | null = null;\n\n  // Cache, invalidated on selection change\n  let boundsCache: SelectionBounds | null = null;\n\n  const getCellId = (row: number, col: number): CellId => `${row}:${col}`;\n\n  const calcBounds = (): SelectionBounds | null => {\n    if (!selection.anchor || !selection.focus) return null;\n\n    if (selection.type === 'rowRange') {\n      return {\n        startRow: Math.min(selection.anchor.row, selection.focus.row),\n        endRow: Math.max(selection.anchor.row, selection.focus.row),\n        startCol: 0,\n        endCol: currentColumns.length - 1,\n      };\n    }\n\n    if (selection.type === 'colRange') {\n      return {\n        startRow: 0,\n        endRow: rowCount - 1,\n        startCol: Math.min(selection.anchor.col, selection.focus.col),\n        endCol: Math.max(selection.anchor.col, selection.focus.col),\n      };\n    }\n\n    return {\n      startRow: Math.min(selection.anchor.row, selection.focus.row),\n      endRow: Math.max(selection.anchor.row, selection.focus.row),\n      startCol: Math.min(selection.anchor.col, selection.focus.col),\n      endCol: Math.max(selection.anchor.col, selection.focus.col),\n    };\n  };\n\n  const notify = (row: number, col: number) => {\n    const id = getCellId(row, col);\n    const subs = subscribers.get(id);\n    if (subs) {\n      subs.forEach((cb) => cb());\n    }\n  };\n\n  const bumpRevision = (row: number, col: number) => {\n    const id = getCellId(row, col);\n    revisions.set(id, (revisions.get(id) ?? 0) + 1);\n    notify(row, col);\n  };\n\n  const bumpRevisions = (cells: Array<{ row: number; col: number }>) => {\n    // First bump all revisions\n    cells.forEach(({ row, col }) => {\n      const id = getCellId(row, col);\n      revisions.set(id, (revisions.get(id) ?? 0) + 1);\n    });\n    // Then notify all (batch notifications)\n    cells.forEach(({ row, col }) => notify(row, col));\n  };\n\n  const bumpRowRevisions = (row: number, colCount: number) => {\n    const cells: Array<{ row: number; col: number }> = [];\n    for (let col = 0; col < colCount; col++) {\n      cells.push({ row, col });\n    }\n    bumpRevisions(cells);\n  };\n\n  const notifyStoreSubscribers = () => {\n    storeSubscribers.forEach((cb) => cb());\n  };\n\n  const notifySelectionSubscribers = () => {\n    selectionSubscribers.forEach((cb) => cb());\n  };\n\n  const notifyEditingSubscribers = () => {\n    editingSubscribers.forEach((cb) => cb());\n  };\n\n  const bumpStoreRevision = () => {\n    storeRevision++;\n    notifyStoreSubscribers();\n  };\n\n  const bumpSelectionRevision = () => {\n    selectionRevision++;\n    notifySelectionSubscribers();\n  };\n\n  const isCellInBounds = (row: number, col: number, bounds: SelectionBounds): boolean => {\n    return (\n      row >= bounds.startRow &&\n      row <= bounds.endRow &&\n      col >= bounds.startCol &&\n      col <= bounds.endCol\n    );\n  };\n\n  const getRangeEdges = (row: number, col: number, bounds: SelectionBounds): RangeEdges => ({\n    top: row === bounds.startRow,\n    bottom: row === bounds.endRow,\n    left: col === bounds.startCol,\n    right: col === bounds.endCol,\n  });\n\n  /**\n   * Does this block contain AT LEAST ONE column a fill may write?\n   *\n   * \"At least one\", never \"all\": a five-column selection that happens to include\n   * a read-only lookup column must still offer the handle. That column's writes\n   * are rejected by `applyCellWrites` and reported; the other four fill.\n   */\n  const someColumnFillable = (bounds: SelectionBounds): boolean => {\n    for (let c = bounds.startCol; c <= bounds.endCol; c++) {\n      const col = currentColumns[c];\n      if (col && !col.readOnly && !col.disableFill) return true;\n    }\n    return false;\n  };\n\n  /**\n   * Repaint the UNION of two rectangles, deduped. Used by both `setSelection`\n   * and `setFillPreview` \u2014 cells leaving the old rect must lose their outline in\n   * the same frame cells joining the new one gain it, or the grid shows two\n   * outlines for a frame.\n   */\n  const repaintUnion = (a: SelectionBounds | null, b: SelectionBounds | null) => {\n    const affected: Array<{ row: number; col: number }> = [];\n    const add = (bounds: SelectionBounds | null) => {\n      if (!bounds) return;\n      for (let r = bounds.startRow; r <= bounds.endRow; r++) {\n        for (let c = bounds.startCol; c <= bounds.endCol; c++) affected.push({ row: r, col: c });\n      }\n    };\n    add(a);\n    add(b);\n    const seen = new Set<CellId>();\n    const unique = affected.filter(({ row, col }) => {\n      const id = getCellId(row, col);\n      if (seen.has(id)) return false;\n      seen.add(id);\n      return true;\n    });\n    bumpRevisions(unique);\n  };\n\n  // Initialize data\n  const initializeData = (data: any[]) => {\n    rowDataMap.clear();\n    rowCount = data.length;\n\n    data.forEach((row, rowIndex) => {\n      rowDataMap.set(rowIndex, row);\n    });\n  };\n\n  // Initialize with provided data\n  initializeData(initialData);\n\n  // Initialize column widths from column definitions\n  currentColumns.forEach((col, idx) => {\n    if (col.width) {\n      columnWidths.set(idx, col.width);\n    }\n  });\n\n  const store: CellStore = {\n    // --- Reads ---\n    getCellValue(row: number, col: number): any {\n      // Projection, never a cache. `col` indexes the CURRENT view-order column\n      // array, so a reorder/hide is picked up on the very next read \u2014 which is\n      // why copy, export and the screen can no longer disagree.\n      const colDef = currentColumns[col];\n      if (!colDef) return undefined;\n      return rowDataMap.get(row)?.[colDef.data];\n    },\n\n    getRowData(row: number): any {\n      return rowDataMap.get(row);\n    },\n\n    getRowCount(): number {\n      return rowCount;\n    },\n\n    getSelection(): SelectionState {\n      return selection;\n    },\n\n    getSelectionBounds(): SelectionBounds | null {\n      if (!boundsCache) {\n        boundsCache = calcBounds();\n      }\n      return boundsCache;\n    },\n\n    getFillPreview(): FillPreview | null {\n      return fillPreview;\n    },\n\n\n    getClipboardMarker(): ClipboardMarker | null {\n      return clipboardMarker;\n    },\n\n    getEditingCell(): { row: number; col: number } | null {\n      return editingCell;\n    },\n\n    getSaveState(row: number, col: number): SaveStateType {\n      return saveStates.get(getCellId(row, col)) ?? null;\n    },\n\n    isNewRow(row: number): boolean {\n      return newRowFlags.has(row);\n    },\n\n    hasNewRows(): boolean {\n      return newRowFlags.size > 0;\n    },\n\n    getColumnWidth(col: number): number {\n      return (\n        (columnWidths.get(col) ?? currentColumns[col]?.width ?? 100) +\n        (columnStretch.get(col) ?? 0)\n      );\n    },\n\n    getBaseColumnWidth(col: number): number {\n      return columnWidths.get(col) ?? currentColumns[col]?.width ?? 100;\n    },\n\n    getColumnWidths(): Map<number, number> {\n      return new Map(columnWidths);\n    },\n\n    setColumnStretch(next: Map<number, number>): void {\n      // Normalize first: a zero surplus is the ABSENCE of one, so `{a: 0}` and\n      // `{}` must compare equal \u2014 otherwise every measure would look like a\n      // change and re-render the grid on a loop.\n      const normalized = new Map<number, number>();\n      next.forEach((extra, col) => { if (extra > 0) normalized.set(col, extra); });\n      let changed = normalized.size !== columnStretch.size;\n      if (!changed) {\n        for (const [col, extra] of normalized) {\n          if (columnStretch.get(col) !== extra) { changed = true; break; }\n        }\n      }\n      if (!changed) return;\n      columnStretch.clear();\n      normalized.forEach((extra, col) => columnStretch.set(col, extra));\n      bumpStoreRevision();\n    },\n\n    getStoreRevision(): number {\n      return storeRevision;\n    },\n\n    getSelectionRevision(): number {\n      return selectionRevision;\n    },\n\n    getCellState(row: number, col: number): CellState {\n      const bounds = this.getSelectionBounds();\n      const isInRange = bounds ? isCellInBounds(row, col, bounds) : false;\n\n      const isSelected =\n        selection.type === 'cell' &&\n        selection.anchor?.row === row &&\n        selection.anchor?.col === col;\n\n      // The fill preview is a RECTANGLE (Excel fills in four directions), so\n      // containment is the same `isCellInBounds` test the selection uses and the\n      // edges come from the same `getRangeEdges` helper. `fillEdges` was already\n      // typed four-sided; it simply used to be told `left: true, right: true`,\n      // which is only correct for a one-column strip.\n      const isFillPreview = !!fillPreview && isCellInBounds(row, col, fillPreview.bounds);\n      // The extension only \u2014 the cells that will actually be WRITTEN on release.\n      const isFillTarget =\n        isFillPreview && !!fillPreview && !isCellInBounds(row, col, fillPreview.source);\n      const isFillClearing =\n        !!fillPreview && !!fillPreview.cleared && isCellInBounds(row, col, fillPreview.cleared);\n\n      // The drag nub. Computed HERE, not in `Cell.tsx`: it needs the whole\n      // selection AND the column defs, both of which are already in this\n      // closure. Asking \"is ANY column in the selection fillable\" is what lets a\n      // multi-column source that CONTAINS a read-only column still offer a\n      // handle \u2014 that column's writes are rejected, the rest go through.\n      const isFillOrigin =\n        !!bounds &&\n        row === bounds.endRow &&\n        col === bounds.endCol &&\n        !editingCell &&\n        someColumnFillable(bounds);\n\n      const cellId = getCellId(row, col);\n      // Marching ants. Same containment test and same edge helper as the\n      // selection outline, so only the OUTER border of the marked block is\n      // painted rather than a box around every cell in it.\n      const isClipboardSource =\n        !!clipboardMarker && isCellInBounds(row, col, clipboardMarker.bounds);\n\n      return {\n        value: this.getCellValue(row, col),\n        isSelected,\n        isInRange,\n        rangeEdges: isInRange && bounds ? getRangeEdges(row, col, bounds) : {},\n        isEditing: editingCell?.row === row && editingCell?.col === col,\n        saveState: this.getSaveState(row, col),\n        isNewRow: this.isNewRow(row),\n        isFillPreview,\n        isFillTarget,\n        isFillClearing,\n        isFillOrigin,\n        fillEdges: isFillPreview && fillPreview ? getRangeEdges(row, col, fillPreview.bounds) : {},\n        isClipboardSource,\n        clipboardEdges:\n          isClipboardSource && clipboardMarker\n            ? getRangeEdges(row, col, clipboardMarker.bounds)\n            : {},\n        clipboardMode: isClipboardSource && clipboardMarker ? clipboardMarker.mode : null,\n        isHovered: hoveredCell?.row === row && hoveredCell?.col === col,\n      };\n    },\n\n    getCellsInSelection(): { row: number; col: number; value: any }[] {\n      const bounds = this.getSelectionBounds();\n      if (!bounds) return [];\n      return this.getCellsInRect(bounds);\n    },\n\n    getCellsInRect(bounds: SelectionBounds): { row: number; col: number; value: any }[] {\n      const cells: { row: number; col: number; value: any }[] = [];\n      for (let r = bounds.startRow; r <= bounds.endRow; r++) {\n        for (let c = bounds.startCol; c <= bounds.endCol; c++) {\n          cells.push({ row: r, col: c, value: this.getCellValue(r, c) });\n        }\n      }\n      return cells;\n    },\n\n    // --- Writes ---\n    setCellValue(row: number, col: number, value: any): void {\n      // Writes the ONE value source in place. The row object is shared with the\n      // consumer's `data` array by design (optimistic update), so the renderer,\n      // copy and export all observe the new value on the next read.\n      const rowData = rowDataMap.get(row);\n      if (rowData && currentColumns[col]) {\n        rowData[currentColumns[col].data] = value;\n      }\n\n      bumpRevision(row, col);\n    },\n\n    setRowData(row: number, data: any): void {\n      rowDataMap.set(row, data);\n      bumpRowRevisions(row, currentColumns.length);\n    },\n\n    setSelection(newSelection: SelectionState): void {\n      const oldBounds = this.getSelectionBounds();\n      selection = newSelection;\n      boundsCache = null; // invalidate cache\n      const newBounds = this.getSelectionBounds();\n\n      // Collect all affected cells\n      const affected: Array<{ row: number; col: number }> = [];\n\n      const addBoundsCells = (bounds: SelectionBounds | null) => {\n        if (!bounds) return;\n        for (let r = bounds.startRow; r <= bounds.endRow; r++) {\n          for (let c = bounds.startCol; c <= bounds.endCol; c++) {\n            affected.push({ row: r, col: c });\n          }\n        }\n      };\n\n      addBoundsCells(oldBounds);\n      addBoundsCells(newBounds);\n\n      // Dedupe\n      const seen = new Set<CellId>();\n      const unique = affected.filter(({ row, col }) => {\n        const id = getCellId(row, col);\n        if (seen.has(id)) return false;\n        seen.add(id);\n        return true;\n      });\n\n      bumpRevisions(unique);\n      bumpSelectionRevision();\n    },\n\n    setFillPreview(preview: FillPreview | null): void {\n      const prev = fillPreview;\n      fillPreview = preview;\n      // Repaint the union of the old and new fill RECTANGLES so cells leaving\n      // the preview lose their dashed outline in the same frame cells joining it\n      // gain one. Over a 100x20 grid that is ~2,000 notifies per mousemove \u2014 the\n      // same order a full-grid drag-select already costs today.\n      repaintUnion(prev ? prev.bounds : null, preview ? preview.bounds : null);\n    },\n\n\n    setClipboardMarker(marker: ClipboardMarker | null): void {\n      const prev = clipboardMarker;\n      if (!prev && !marker) return;\n      clipboardMarker = marker;\n      // Same union repaint the selection and the fill preview use: cells\n      // leaving the old rectangle must lose their ants in the SAME frame cells\n      // joining the new one gain them, or the grid briefly shows two.\n      repaintUnion(prev?.bounds ?? null, marker?.bounds ?? null);\n    },\n\n    // --- Undo / redo ---\n    recordCellChange(change: UndoCellChange): void {\n      if (suppressUndo) return;\n      if (undoGroup) {\n        undoGroup.push(change);\n      } else {\n        undoStack.push({ changes: [change] });\n        if (undoStack.length > UNDO_LIMIT) undoStack.shift();\n        redoStack.length = 0;\n      }\n    },\n\n    beginUndoGroup(): void {\n      undoGroup = [];\n    },\n\n    endUndoGroup(): void {\n      const group = undoGroup;\n      undoGroup = null;\n      if (group && group.length > 0) {\n        undoStack.push({ changes: group });\n        if (undoStack.length > UNDO_LIMIT) undoStack.shift();\n        redoStack.length = 0;\n      }\n    },\n\n    popUndo(): UndoEntry | null {\n      return undoStack.pop() ?? null;\n    },\n\n    popRedo(): UndoEntry | null {\n      return redoStack.pop() ?? null;\n    },\n\n    pushUndo(entry: UndoEntry): void {\n      undoStack.push(entry);\n      if (undoStack.length > UNDO_LIMIT) undoStack.shift();\n    },\n\n    pushRedo(entry: UndoEntry): void {\n      redoStack.push(entry);\n    },\n\n    canUndo(): boolean {\n      return undoStack.length > 0;\n    },\n\n    canRedo(): boolean {\n      return redoStack.length > 0;\n    },\n\n    setUndoSuppressed(suppressed: boolean): void {\n      suppressUndo = suppressed;\n    },\n\n    findRowIndexById(idColumnName: string, id: any): number {\n      if (id == null) return -1;\n      for (const [index, rowData] of rowDataMap) {\n        if (rowData?.[idColumnName] === id) return index;\n      }\n      return -1;\n    },\n\n    setEditingCell(row: number, col: number): void {\n      const prev = editingCell;\n      editingCell = { row, col };\n\n      if (prev) {\n        bumpRevision(prev.row, prev.col);\n      }\n      bumpRevision(row, col);\n      if (!prev || prev.row !== row || prev.col !== col) notifyEditingSubscribers();\n    },\n\n    setHoveredCell(cell: { row: number; col: number } | null): void {\n      const prev = hoveredCell;\n      if (prev && cell && prev.row === cell.row && prev.col === cell.col) return;\n      if (!prev && !cell) return;\n      hoveredCell = cell;\n      if (prev) bumpRevision(prev.row, prev.col);\n      if (cell) bumpRevision(cell.row, cell.col);\n    },\n\n    clearEditing(): void {\n      if (editingCell) {\n        const { row, col } = editingCell;\n        editingCell = null;\n        bumpRevision(row, col);\n        notifyEditingSubscribers();\n      }\n    },\n\n    setSaveState(row: number, col: number, state: SaveStateType): void {\n      const id = getCellId(row, col);\n      if (state === null) {\n        saveStates.delete(id);\n      } else {\n        saveStates.set(id, state);\n      }\n      bumpRevision(row, col);\n    },\n\n    setColumnWidth(col: number, width: number): void {\n      columnWidths.set(col, width);\n      // An explicit width REPLACES the fill surplus for that column. Without\n      // this a resize drag would jump by the surplus on its first pixel: the\n      // drag starts from the painted width and would then have the surplus\n      // added on top of it again. The next measure re-distributes whatever is\n      // still free across the columns that are still flexible.\n      columnStretch.delete(col);\n      // Bump store revision to trigger re-render of headers and total width\n      bumpStoreRevision();\n    },\n\n    setData(data: any[]): void {\n      // The marching ants are addressed by ROW INDEX. A refetch that returns\n      // the same rows in the same order leaves them pointing at the same cells,\n      // which is the common case (paste/copy do not change the sort) and is why\n      // the marker survives it. A different row COUNT proves the indices moved,\n      // and a marker that has silently slid onto other people's data is worse\n      // than no marker \u2014 so it is dropped rather than guessed at.\n      if (clipboardMarker && data.length !== rowCount) {\n        const stale = clipboardMarker;\n        clipboardMarker = null;\n        repaintUnion(stale.bounds, null);\n      }\n      initializeData(data);\n      newRowFlags.clear();\n\n      // Bump all subscribed cells\n      subscribers.forEach((_, id) => {\n        const [row, col] = id.split(':').map(Number);\n        bumpRevision(row, col);\n      });\n\n      bumpStoreRevision();\n    },\n\n    setColumns(newColumns: ColumnDef[]): void {\n      // Column indices have just moved (reorder / show-hide), so the ants'\n      // COLUMN bounds no longer name the columns they were drawn around.\n      if (clipboardMarker) {\n        const stale = clipboardMarker;\n        clipboardMarker = null;\n        repaintUnion(stale.bounds, null);\n      }\n      // Preserve the user's current widths across a column change (reorder /\n      // show-hide) by remapping them via the stable `data` key rather than the\n      // positional index. Without this, every perspective reorder would snap\n      // manually-sized columns back to their defaults.\n      const widthsByData = new Map<string, number>();\n      currentColumns.forEach((col, idx) => {\n        const w = columnWidths.get(idx);\n        if (w != null) widthsByData.set(col.data, w);\n      });\n      currentColumns = newColumns;\n      columnWidths.clear();\n      // The surplus is index-keyed and the indices have just moved. Dropped\n      // rather than remapped: the column SET changed, so the distribution is\n      // wrong anyway and the next measure recomputes it from scratch.\n      columnStretch.clear();\n      newColumns.forEach((col, idx) => {\n        const carried = widthsByData.get(col.data);\n        if (carried != null) columnWidths.set(idx, carried);\n        else if (col.width) columnWidths.set(idx, col.width);\n      });\n      // Clear save states when columns change to avoid showing states on wrong cells\n      saveStates.clear();\n      bumpStoreRevision();\n    },\n\n    reinitColumnWidths(): void {\n      // Drop all width overrides back to the column definitions. Used when the\n      // persistence scope changes under us (e.g. a different account loads on the\n      // same browser) so one user's layout never lingers into another's.\n      columnWidths.clear();\n      columnStretch.clear();\n      currentColumns.forEach((col, idx) => {\n        if (col.width) columnWidths.set(idx, col.width);\n      });\n      bumpStoreRevision();\n    },\n\n    addRow(rowData: any, atIndex: number = 0): void {\n      // Shift all existing data down\n      const newRowDataMap = new Map<number, any>();\n      const newRevisions = new Map<CellId, number>();\n      const newSaveStates = new Map<CellId, SaveStateType>();\n      const newNewRowFlags = new Set<number>();\n\n      // Shift rows after insertion point\n      rowDataMap.forEach((data, idx) => {\n        const newIdx = idx >= atIndex ? idx + 1 : idx;\n        newRowDataMap.set(newIdx, data);\n      });\n\n      // Shift revisions\n      revisions.forEach((rev, id) => {\n        const [r, c] = id.split(':').map(Number);\n        const newR = r >= atIndex ? r + 1 : r;\n        newRevisions.set(getCellId(newR, c), rev);\n      });\n\n      // Shift save states\n      saveStates.forEach((state, id) => {\n        const [r, c] = id.split(':').map(Number);\n        const newR = r >= atIndex ? r + 1 : r;\n        newSaveStates.set(getCellId(newR, c), state);\n      });\n\n      // Shift new row flags\n      newRowFlags.forEach((idx) => {\n        newNewRowFlags.add(idx >= atIndex ? idx + 1 : idx);\n      });\n\n      // Clear and repopulate\n      rowDataMap.clear();\n      revisions.clear();\n      saveStates.clear();\n      newRowFlags.clear();\n\n      newRowDataMap.forEach((data, idx) => rowDataMap.set(idx, data));\n      newRevisions.forEach((rev, id) => revisions.set(id, rev));\n      newSaveStates.forEach((state, id) => saveStates.set(id, state));\n      newNewRowFlags.forEach((idx) => newRowFlags.add(idx));\n\n      // Add new row. Seed every column key that the caller left out with '' \u2014\n      // the row object IS the value source now, so a missing key would render\n      // (and copy, and export) as `undefined` instead of an empty cell.\n      currentColumns.forEach((col) => {\n        if (rowData[col.data] == null) rowData[col.data] = '';\n      });\n      rowDataMap.set(atIndex, rowData);\n\n      rowCount++;\n\n      // Mark as new row\n      newRowFlags.add(atIndex);\n\n      // Bump all subscribed cells\n      subscribers.forEach((_, id) => {\n        const [row, col] = id.split(':').map(Number);\n        bumpRevision(row, col);\n      });\n\n      bumpStoreRevision();\n    },\n\n    removeRow(rowIndex: number): void {\n      // Shift all data up\n      const newRowDataMap = new Map<number, any>();\n      const newRevisions = new Map<CellId, number>();\n      const newSaveStates = new Map<CellId, SaveStateType>();\n      const newNewRowFlags = new Set<number>();\n\n      rowDataMap.forEach((data, idx) => {\n        if (idx < rowIndex) {\n          newRowDataMap.set(idx, data);\n        } else if (idx > rowIndex) {\n          newRowDataMap.set(idx - 1, data);\n        }\n      });\n\n      revisions.forEach((rev, id) => {\n        const [r, c] = id.split(':').map(Number);\n        if (r < rowIndex) {\n          newRevisions.set(getCellId(r, c), rev);\n        } else if (r > rowIndex) {\n          newRevisions.set(getCellId(r - 1, c), rev);\n        }\n      });\n\n      saveStates.forEach((state, id) => {\n        const [r, c] = id.split(':').map(Number);\n        if (r < rowIndex) {\n          newSaveStates.set(getCellId(r, c), state);\n        } else if (r > rowIndex) {\n          newSaveStates.set(getCellId(r - 1, c), state);\n        }\n      });\n\n      newRowFlags.forEach((idx) => {\n        if (idx < rowIndex) {\n          newNewRowFlags.add(idx);\n        } else if (idx > rowIndex) {\n          newNewRowFlags.add(idx - 1);\n        }\n      });\n\n      // Clear and repopulate\n      rowDataMap.clear();\n      revisions.clear();\n      saveStates.clear();\n      newRowFlags.clear();\n\n      newRowDataMap.forEach((data, idx) => rowDataMap.set(idx, data));\n      newRevisions.forEach((rev, id) => revisions.set(id, rev));\n      newSaveStates.forEach((state, id) => saveStates.set(id, state));\n      newNewRowFlags.forEach((idx) => newRowFlags.add(idx));\n\n      rowCount--;\n\n      // Bump all subscribed cells\n      subscribers.forEach((_, id) => {\n        const [row, col] = id.split(':').map(Number);\n        bumpRevision(row, col);\n      });\n\n      bumpStoreRevision();\n    },\n\n    markRowAsNew(rowIndex: number, isNew: boolean): void {\n      if (isNew) {\n        newRowFlags.add(rowIndex);\n      } else {\n        newRowFlags.delete(rowIndex);\n      }\n      bumpRowRevisions(rowIndex, currentColumns.length);\n      bumpStoreRevision();\n    },\n\n    markRowAsSaved(rowIndex: number, savedData: any): void {\n      newRowFlags.delete(rowIndex);\n      rowDataMap.set(rowIndex, savedData);\n      bumpRowRevisions(rowIndex, currentColumns.length);\n      bumpStoreRevision();\n    },\n\n    // --- Subscriptions ---\n    subscribe(row: number, col: number, callback: CellSubscriber): () => void {\n      const id = getCellId(row, col);\n      if (!subscribers.has(id)) {\n        subscribers.set(id, new Set());\n      }\n      subscribers.get(id)!.add(callback);\n\n      return () => {\n        const subs = subscribers.get(id);\n        if (subs) {\n          subs.delete(callback);\n          if (subs.size === 0) {\n            subscribers.delete(id);\n          }\n        }\n      };\n    },\n\n    subscribeToStore(callback: CellSubscriber): () => void {\n      storeSubscribers.add(callback);\n      return () => {\n        storeSubscribers.delete(callback);\n      };\n    },\n\n    subscribeToSelection(callback: CellSubscriber): () => void {\n      selectionSubscribers.add(callback);\n      return () => {\n        selectionSubscribers.delete(callback);\n      };\n    },\n\n    subscribeToEditing(callback: CellSubscriber): () => void {\n      editingSubscribers.add(callback);\n      return () => {\n        editingSubscribers.delete(callback);\n      };\n    },\n\n    getRevision(row: number, col: number): number {\n      return revisions.get(getCellId(row, col)) ?? 0;\n    },\n\n    // --- Table container focus management ---\n    setTableRef(ref: React.RefObject<HTMLDivElement | null>): void {\n      tableRef = ref;\n    },\n\n    focusTable(): void {\n      tableRef?.current?.focus();\n    },\n\n    blurTable(): void {\n      tableRef?.current?.blur();\n    },\n\n    bumpRevision,\n    bumpRevisions,\n    bumpRowRevisions,\n    bumpStoreRevision,\n  };\n\n  return store;\n}\n"],
+  "mappings": "AAkKO,SAAS,gBAAgB,aAAoB,SAAiC;AAInF,QAAM,aAAa,oBAAI,IAAiB;AACxC,QAAM,YAAY,oBAAI,IAAoB;AAC1C,QAAM,cAAc,oBAAI,IAAiC;AACzD,QAAM,aAAa,oBAAI,IAA2B;AAClD,QAAM,cAAc,oBAAI,IAAY;AACpC,QAAM,eAAe,oBAAI,IAAoB;AAK7C,QAAM,gBAAgB,oBAAI,IAAoB;AAC9C,QAAM,mBAAmB,oBAAI,IAAoB;AAGjD,MAAI,iBAAiB;AAErB,MAAI,YAA4B,EAAE,MAAM,MAAM,QAAQ,MAAM,OAAO,KAAK;AACxE,MAAI,cAAkC;AAGtC,MAAI,kBAA0C;AAC9C,MAAI,cAAmD;AAGvD,MAAI,cAAmD;AAGvD,QAAM,aAAa;AACnB,QAAM,YAAyB,CAAC;AAChC,QAAM,YAAyB,CAAC;AAChC,MAAI,YAAqC;AACzC,MAAI,eAAe;AACnB,MAAI,WAAW,YAAY;AAC3B,MAAI,gBAAgB;AACpB,MAAI,oBAAoB;AACxB,QAAM,uBAAuB,oBAAI,IAAoB;AACrD,QAAM,qBAAqB,oBAAI,IAAoB;AACnD,MAAI,WAA0D;AAG9D,MAAI,cAAsC;AAE1C,QAAM,YAAY,CAAC,KAAa,QAAwB,GAAG,GAAG,IAAI,GAAG;AAErE,QAAM,aAAa,MAA8B;AAC/C,QAAI,CAAC,UAAU,UAAU,CAAC,UAAU,MAAO,QAAO;AAElD,QAAI,UAAU,SAAS,YAAY;AACjC,aAAO;AAAA,QACL,UAAU,KAAK,IAAI,UAAU,OAAO,KAAK,UAAU,MAAM,GAAG;AAAA,QAC5D,QAAQ,KAAK,IAAI,UAAU,OAAO,KAAK,UAAU,MAAM,GAAG;AAAA,QAC1D,UAAU;AAAA,QACV,QAAQ,eAAe,SAAS;AAAA,MAClC;AAAA,IACF;AAEA,QAAI,UAAU,SAAS,YAAY;AACjC,aAAO;AAAA,QACL,UAAU;AAAA,QACV,QAAQ,WAAW;AAAA,QACnB,UAAU,KAAK,IAAI,UAAU,OAAO,KAAK,UAAU,MAAM,GAAG;AAAA,QAC5D,QAAQ,KAAK,IAAI,UAAU,OAAO,KAAK,UAAU,MAAM,GAAG;AAAA,MAC5D;AAAA,IACF;AAEA,WAAO;AAAA,MACL,UAAU,KAAK,IAAI,UAAU,OAAO,KAAK,UAAU,MAAM,GAAG;AAAA,MAC5D,QAAQ,KAAK,IAAI,UAAU,OAAO,KAAK,UAAU,MAAM,GAAG;AAAA,MAC1D,UAAU,KAAK,IAAI,UAAU,OAAO,KAAK,UAAU,MAAM,GAAG;AAAA,MAC5D,QAAQ,KAAK,IAAI,UAAU,OAAO,KAAK,UAAU,MAAM,GAAG;AAAA,IAC5D;AAAA,EACF;AAEA,QAAM,SAAS,CAAC,KAAa,QAAgB;AAC3C,UAAM,KAAK,UAAU,KAAK,GAAG;AAC7B,UAAM,OAAO,YAAY,IAAI,EAAE;AAC/B,QAAI,MAAM;AACR,WAAK,QAAQ,CAAC,OAAO,GAAG,CAAC;AAAA,IAC3B;AAAA,EACF;AAEA,QAAM,eAAe,CAAC,KAAa,QAAgB;AACjD,UAAM,KAAK,UAAU,KAAK,GAAG;AAC7B,cAAU,IAAI,KAAK,UAAU,IAAI,EAAE,KAAK,KAAK,CAAC;AAC9C,WAAO,KAAK,GAAG;AAAA,EACjB;AAEA,QAAM,gBAAgB,CAAC,UAA+C;AAEpE,UAAM,QAAQ,CAAC,EAAE,KAAK,IAAI,MAAM;AAC9B,YAAM,KAAK,UAAU,KAAK,GAAG;AAC7B,gBAAU,IAAI,KAAK,UAAU,IAAI,EAAE,KAAK,KAAK,CAAC;AAAA,IAChD,CAAC;AAED,UAAM,QAAQ,CAAC,EAAE,KAAK,IAAI,MAAM,OAAO,KAAK,GAAG,CAAC;AAAA,EAClD;AAEA,QAAM,mBAAmB,CAAC,KAAa,aAAqB;AAC1D,UAAM,QAA6C,CAAC;AACpD,aAAS,MAAM,GAAG,MAAM,UAAU,OAAO;AACvC,YAAM,KAAK,EAAE,KAAK,IAAI,CAAC;AAAA,IACzB;AACA,kBAAc,KAAK;AAAA,EACrB;AAEA,QAAM,yBAAyB,MAAM;AACnC,qBAAiB,QAAQ,CAAC,OAAO,GAAG,CAAC;AAAA,EACvC;AAEA,QAAM,6BAA6B,MAAM;AACvC,yBAAqB,QAAQ,CAAC,OAAO,GAAG,CAAC;AAAA,EAC3C;AAEA,QAAM,2BAA2B,MAAM;AACrC,uBAAmB,QAAQ,CAAC,OAAO,GAAG,CAAC;AAAA,EACzC;AAEA,QAAM,oBAAoB,MAAM;AAC9B;AACA,2BAAuB;AAAA,EACzB;AAEA,QAAM,wBAAwB,MAAM;AAClC;AACA,+BAA2B;AAAA,EAC7B;AAEA,QAAM,iBAAiB,CAAC,KAAa,KAAa,WAAqC;AACrF,WACE,OAAO,OAAO,YACd,OAAO,OAAO,UACd,OAAO,OAAO,YACd,OAAO,OAAO;AAAA,EAElB;AAEA,QAAM,gBAAgB,CAAC,KAAa,KAAa,YAAyC;AAAA,IACxF,KAAK,QAAQ,OAAO;AAAA,IACpB,QAAQ,QAAQ,OAAO;AAAA,IACvB,MAAM,QAAQ,OAAO;AAAA,IACrB,OAAO,QAAQ,OAAO;AAAA,EACxB;AASA,QAAM,qBAAqB,CAAC,WAAqC;AAC/D,aAAS,IAAI,OAAO,UAAU,KAAK,OAAO,QAAQ,KAAK;AACrD,YAAM,MAAM,eAAe,CAAC;AAC5B,UAAI,OAAO,CAAC,IAAI,YAAY,CAAC,IAAI,YAAa,QAAO;AAAA,IACvD;AACA,WAAO;AAAA,EACT;AAQA,QAAM,eAAe,CAAC,GAA2B,MAA8B;AAC7E,UAAM,WAAgD,CAAC;AACvD,UAAM,MAAM,CAAC,WAAmC;AAC9C,UAAI,CAAC,OAAQ;AACb,eAAS,IAAI,OAAO,UAAU,KAAK,OAAO,QAAQ,KAAK;AACrD,iBAAS,IAAI,OAAO,UAAU,KAAK,OAAO,QAAQ,IAAK,UAAS,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,CAAC;AAAA,MACzF;AAAA,IACF;AACA,QAAI,CAAC;AACL,QAAI,CAAC;AACL,UAAM,OAAO,oBAAI,IAAY;AAC7B,UAAM,SAAS,SAAS,OAAO,CAAC,EAAE,KAAK,IAAI,MAAM;AAC/C,YAAM,KAAK,UAAU,KAAK,GAAG;AAC7B,UAAI,KAAK,IAAI,EAAE,EAAG,QAAO;AACzB,WAAK,IAAI,EAAE;AACX,aAAO;AAAA,IACT,CAAC;AACD,kBAAc,MAAM;AAAA,EACtB;AAGA,QAAM,iBAAiB,CAAC,SAAgB;AACtC,eAAW,MAAM;AACjB,eAAW,KAAK;AAEhB,SAAK,QAAQ,CAAC,KAAK,aAAa;AAC9B,iBAAW,IAAI,UAAU,GAAG;AAAA,IAC9B,CAAC;AAAA,EACH;AAGA,iBAAe,WAAW;AAG1B,iBAAe,QAAQ,CAAC,KAAK,QAAQ;AACnC,QAAI,IAAI,OAAO;AACb,mBAAa,IAAI,KAAK,IAAI,KAAK;AAAA,IACjC;AAAA,EACF,CAAC;AAED,QAAM,QAAmB;AAAA;AAAA,IAEvB,aAAa,KAAa,KAAkB;AAI1C,YAAM,SAAS,eAAe,GAAG;AACjC,UAAI,CAAC,OAAQ,QAAO;AACpB,aAAO,WAAW,IAAI,GAAG,IAAI,OAAO,IAAI;AAAA,IAC1C;AAAA,IAEA,WAAW,KAAkB;AAC3B,aAAO,WAAW,IAAI,GAAG;AAAA,IAC3B;AAAA,IAEA,cAAsB;AACpB,aAAO;AAAA,IACT;AAAA,IAEA,eAA+B;AAC7B,aAAO;AAAA,IACT;AAAA,IAEA,qBAA6C;AAC3C,UAAI,CAAC,aAAa;AAChB,sBAAc,WAAW;AAAA,MAC3B;AACA,aAAO;AAAA,IACT;AAAA,IAEA,iBAAqC;AACnC,aAAO;AAAA,IACT;AAAA,IAGA,qBAA6C;AAC3C,aAAO;AAAA,IACT;AAAA,IAEA,iBAAsD;AACpD,aAAO;AAAA,IACT;AAAA,IAEA,aAAa,KAAa,KAA4B;AACpD,aAAO,WAAW,IAAI,UAAU,KAAK,GAAG,CAAC,KAAK;AAAA,IAChD;AAAA,IAEA,SAAS,KAAsB;AAC7B,aAAO,YAAY,IAAI,GAAG;AAAA,IAC5B;AAAA,IAEA,aAAsB;AACpB,aAAO,YAAY,OAAO;AAAA,IAC5B;AAAA,IAEA,eAAe,KAAqB;AAClC,cACG,aAAa,IAAI,GAAG,KAAK,eAAe,GAAG,GAAG,SAAS,QACvD,cAAc,IAAI,GAAG,KAAK;AAAA,IAE/B;AAAA,IAEA,mBAAmB,KAAqB;AACtC,aAAO,aAAa,IAAI,GAAG,KAAK,eAAe,GAAG,GAAG,SAAS;AAAA,IAChE;AAAA,IAEA,kBAAuC;AACrC,aAAO,IAAI,IAAI,YAAY;AAAA,IAC7B;AAAA,IAEA,iBAAiB,MAAiC;AAIhD,YAAM,aAAa,oBAAI,IAAoB;AAC3C,WAAK,QAAQ,CAAC,OAAO,QAAQ;AAAE,YAAI,QAAQ,EAAG,YAAW,IAAI,KAAK,KAAK;AAAA,MAAG,CAAC;AAC3E,UAAI,UAAU,WAAW,SAAS,cAAc;AAChD,UAAI,CAAC,SAAS;AACZ,mBAAW,CAAC,KAAK,KAAK,KAAK,YAAY;AACrC,cAAI,cAAc,IAAI,GAAG,MAAM,OAAO;AAAE,sBAAU;AAAM;AAAA,UAAO;AAAA,QACjE;AAAA,MACF;AACA,UAAI,CAAC,QAAS;AACd,oBAAc,MAAM;AACpB,iBAAW,QAAQ,CAAC,OAAO,QAAQ,cAAc,IAAI,KAAK,KAAK,CAAC;AAChE,wBAAkB;AAAA,IACpB;AAAA,IAEA,mBAA2B;AACzB,aAAO;AAAA,IACT;AAAA,IAEA,uBAA+B;AAC7B,aAAO;AAAA,IACT;AAAA,IAEA,aAAa,KAAa,KAAwB;AAChD,YAAM,SAAS,KAAK,mBAAmB;AACvC,YAAM,YAAY,SAAS,eAAe,KAAK,KAAK,MAAM,IAAI;AAE9D,YAAM,aACJ,UAAU,SAAS,UACnB,UAAU,QAAQ,QAAQ,OAC1B,UAAU,QAAQ,QAAQ;AAO5B,YAAM,gBAAgB,CAAC,CAAC,eAAe,eAAe,KAAK,KAAK,YAAY,MAAM;AAElF,YAAM,eACJ,iBAAiB,CAAC,CAAC,eAAe,CAAC,eAAe,KAAK,KAAK,YAAY,MAAM;AAChF,YAAM,iBACJ,CAAC,CAAC,eAAe,CAAC,CAAC,YAAY,WAAW,eAAe,KAAK,KAAK,YAAY,OAAO;AAOxF,YAAM,eACJ,CAAC,CAAC,UACF,QAAQ,OAAO,UACf,QAAQ,OAAO,UACf,CAAC,eACD,mBAAmB,MAAM;AAE3B,YAAM,SAAS,UAAU,KAAK,GAAG;AAIjC,YAAM,oBACJ,CAAC,CAAC,mBAAmB,eAAe,KAAK,KAAK,gBAAgB,MAAM;AAEtE,aAAO;AAAA,QACL,OAAO,KAAK,aAAa,KAAK,GAAG;AAAA,QACjC;AAAA,QACA;AAAA,QACA,YAAY,aAAa,SAAS,cAAc,KAAK,KAAK,MAAM,IAAI,CAAC;AAAA,QACrE,WAAW,aAAa,QAAQ,OAAO,aAAa,QAAQ;AAAA,QAC5D,WAAW,KAAK,aAAa,KAAK,GAAG;AAAA,QACrC,UAAU,KAAK,SAAS,GAAG;AAAA,QAC3B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,WAAW,iBAAiB,cAAc,cAAc,KAAK,KAAK,YAAY,MAAM,IAAI,CAAC;AAAA,QACzF;AAAA,QACA,gBACE,qBAAqB,kBACjB,cAAc,KAAK,KAAK,gBAAgB,MAAM,IAC9C,CAAC;AAAA,QACP,eAAe,qBAAqB,kBAAkB,gBAAgB,OAAO;AAAA,QAC7E,WAAW,aAAa,QAAQ,OAAO,aAAa,QAAQ;AAAA,MAC9D;AAAA,IACF;AAAA,IAEA,sBAAkE;AAChE,YAAM,SAAS,KAAK,mBAAmB;AACvC,UAAI,CAAC,OAAQ,QAAO,CAAC;AACrB,aAAO,KAAK,eAAe,MAAM;AAAA,IACnC;AAAA,IAEA,eAAe,QAAqE;AAClF,YAAM,QAAoD,CAAC;AAC3D,eAAS,IAAI,OAAO,UAAU,KAAK,OAAO,QAAQ,KAAK;AACrD,iBAAS,IAAI,OAAO,UAAU,KAAK,OAAO,QAAQ,KAAK;AACrD,gBAAM,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,OAAO,KAAK,aAAa,GAAG,CAAC,EAAE,CAAC;AAAA,QAC/D;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA;AAAA,IAGA,aAAa,KAAa,KAAa,OAAkB;AAIvD,YAAM,UAAU,WAAW,IAAI,GAAG;AAClC,UAAI,WAAW,eAAe,GAAG,GAAG;AAClC,gBAAQ,eAAe,GAAG,EAAE,IAAI,IAAI;AAAA,MACtC;AAEA,mBAAa,KAAK,GAAG;AAAA,IACvB;AAAA,IAEA,WAAW,KAAa,MAAiB;AACvC,iBAAW,IAAI,KAAK,IAAI;AACxB,uBAAiB,KAAK,eAAe,MAAM;AAAA,IAC7C;AAAA,IAEA,aAAa,cAAoC;AAC/C,YAAM,YAAY,KAAK,mBAAmB;AAC1C,kBAAY;AACZ,oBAAc;AACd,YAAM,YAAY,KAAK,mBAAmB;AAG1C,YAAM,WAAgD,CAAC;AAEvD,YAAM,iBAAiB,CAAC,WAAmC;AACzD,YAAI,CAAC,OAAQ;AACb,iBAAS,IAAI,OAAO,UAAU,KAAK,OAAO,QAAQ,KAAK;AACrD,mBAAS,IAAI,OAAO,UAAU,KAAK,OAAO,QAAQ,KAAK;AACrD,qBAAS,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,CAAC;AAAA,UAClC;AAAA,QACF;AAAA,MACF;AAEA,qBAAe,SAAS;AACxB,qBAAe,SAAS;AAGxB,YAAM,OAAO,oBAAI,IAAY;AAC7B,YAAM,SAAS,SAAS,OAAO,CAAC,EAAE,KAAK,IAAI,MAAM;AAC/C,cAAM,KAAK,UAAU,KAAK,GAAG;AAC7B,YAAI,KAAK,IAAI,EAAE,EAAG,QAAO;AACzB,aAAK,IAAI,EAAE;AACX,eAAO;AAAA,MACT,CAAC;AAED,oBAAc,MAAM;AACpB,4BAAsB;AAAA,IACxB;AAAA,IAEA,eAAe,SAAmC;AAChD,YAAM,OAAO;AACb,oBAAc;AAKd,mBAAa,OAAO,KAAK,SAAS,MAAM,UAAU,QAAQ,SAAS,IAAI;AAAA,IACzE;AAAA,IAGA,mBAAmB,QAAsC;AACvD,YAAM,OAAO;AACb,UAAI,CAAC,QAAQ,CAAC,OAAQ;AACtB,wBAAkB;AAIlB,mBAAa,MAAM,UAAU,MAAM,QAAQ,UAAU,IAAI;AAAA,IAC3D;AAAA;AAAA,IAGA,iBAAiB,QAA8B;AAC7C,UAAI,aAAc;AAClB,UAAI,WAAW;AACb,kBAAU,KAAK,MAAM;AAAA,MACvB,OAAO;AACL,kBAAU,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,CAAC;AACpC,YAAI,UAAU,SAAS,WAAY,WAAU,MAAM;AACnD,kBAAU,SAAS;AAAA,MACrB;AAAA,IACF;AAAA,IAEA,iBAAuB;AACrB,kBAAY,CAAC;AAAA,IACf;AAAA,IAEA,eAAqB;AACnB,YAAM,QAAQ;AACd,kBAAY;AACZ,UAAI,SAAS,MAAM,SAAS,GAAG;AAC7B,kBAAU,KAAK,EAAE,SAAS,MAAM,CAAC;AACjC,YAAI,UAAU,SAAS,WAAY,WAAU,MAAM;AACnD,kBAAU,SAAS;AAAA,MACrB;AAAA,IACF;AAAA,IAEA,UAA4B;AAC1B,aAAO,UAAU,IAAI,KAAK;AAAA,IAC5B;AAAA,IAEA,UAA4B;AAC1B,aAAO,UAAU,IAAI,KAAK;AAAA,IAC5B;AAAA,IAEA,SAAS,OAAwB;AAC/B,gBAAU,KAAK,KAAK;AACpB,UAAI,UAAU,SAAS,WAAY,WAAU,MAAM;AAAA,IACrD;AAAA,IAEA,SAAS,OAAwB;AAC/B,gBAAU,KAAK,KAAK;AAAA,IACtB;AAAA,IAEA,UAAmB;AACjB,aAAO,UAAU,SAAS;AAAA,IAC5B;AAAA,IAEA,UAAmB;AACjB,aAAO,UAAU,SAAS;AAAA,IAC5B;AAAA,IAEA,kBAAkB,YAA2B;AAC3C,qBAAe;AAAA,IACjB;AAAA,IAEA,iBAAiB,cAAsB,IAAiB;AACtD,UAAI,MAAM,KAAM,QAAO;AACvB,iBAAW,CAAC,OAAO,OAAO,KAAK,YAAY;AACzC,YAAI,UAAU,YAAY,MAAM,GAAI,QAAO;AAAA,MAC7C;AACA,aAAO;AAAA,IACT;AAAA,IAEA,eAAe,KAAa,KAAmB;AAC7C,YAAM,OAAO;AACb,oBAAc,EAAE,KAAK,IAAI;AAEzB,UAAI,MAAM;AACR,qBAAa,KAAK,KAAK,KAAK,GAAG;AAAA,MACjC;AACA,mBAAa,KAAK,GAAG;AACrB,UAAI,CAAC,QAAQ,KAAK,QAAQ,OAAO,KAAK,QAAQ,IAAK,0BAAyB;AAAA,IAC9E;AAAA,IAEA,eAAe,MAAiD;AAC9D,YAAM,OAAO;AACb,UAAI,QAAQ,QAAQ,KAAK,QAAQ,KAAK,OAAO,KAAK,QAAQ,KAAK,IAAK;AACpE,UAAI,CAAC,QAAQ,CAAC,KAAM;AACpB,oBAAc;AACd,UAAI,KAAM,cAAa,KAAK,KAAK,KAAK,GAAG;AACzC,UAAI,KAAM,cAAa,KAAK,KAAK,KAAK,GAAG;AAAA,IAC3C;AAAA,IAEA,eAAqB;AACnB,UAAI,aAAa;AACf,cAAM,EAAE,KAAK,IAAI,IAAI;AACrB,sBAAc;AACd,qBAAa,KAAK,GAAG;AACrB,iCAAyB;AAAA,MAC3B;AAAA,IACF;AAAA,IAEA,aAAa,KAAa,KAAa,OAA4B;AACjE,YAAM,KAAK,UAAU,KAAK,GAAG;AAC7B,UAAI,UAAU,MAAM;AAClB,mBAAW,OAAO,EAAE;AAAA,MACtB,OAAO;AACL,mBAAW,IAAI,IAAI,KAAK;AAAA,MAC1B;AACA,mBAAa,KAAK,GAAG;AAAA,IACvB;AAAA,IAEA,eAAe,KAAa,OAAqB;AAC/C,mBAAa,IAAI,KAAK,KAAK;AAM3B,oBAAc,OAAO,GAAG;AAExB,wBAAkB;AAAA,IACpB;AAAA,IAEA,QAAQ,MAAmB;AAOzB,UAAI,mBAAmB,KAAK,WAAW,UAAU;AAC/C,cAAM,QAAQ;AACd,0BAAkB;AAClB,qBAAa,MAAM,QAAQ,IAAI;AAAA,MACjC;AACA,qBAAe,IAAI;AACnB,kBAAY,MAAM;AAGlB,kBAAY,QAAQ,CAAC,GAAG,OAAO;AAC7B,cAAM,CAAC,KAAK,GAAG,IAAI,GAAG,MAAM,GAAG,EAAE,IAAI,MAAM;AAC3C,qBAAa,KAAK,GAAG;AAAA,MACvB,CAAC;AAED,wBAAkB;AAAA,IACpB;AAAA,IAEA,WAAW,YAA+B;AAGxC,UAAI,iBAAiB;AACnB,cAAM,QAAQ;AACd,0BAAkB;AAClB,qBAAa,MAAM,QAAQ,IAAI;AAAA,MACjC;AAKA,YAAM,eAAe,oBAAI,IAAoB;AAC7C,qBAAe,QAAQ,CAAC,KAAK,QAAQ;AACnC,cAAM,IAAI,aAAa,IAAI,GAAG;AAC9B,YAAI,KAAK,KAAM,cAAa,IAAI,IAAI,MAAM,CAAC;AAAA,MAC7C,CAAC;AACD,uBAAiB;AACjB,mBAAa,MAAM;AAInB,oBAAc,MAAM;AACpB,iBAAW,QAAQ,CAAC,KAAK,QAAQ;AAC/B,cAAM,UAAU,aAAa,IAAI,IAAI,IAAI;AACzC,YAAI,WAAW,KAAM,cAAa,IAAI,KAAK,OAAO;AAAA,iBACzC,IAAI,MAAO,cAAa,IAAI,KAAK,IAAI,KAAK;AAAA,MACrD,CAAC;AAED,iBAAW,MAAM;AACjB,wBAAkB;AAAA,IACpB;AAAA,IAEA,qBAA2B;AAIzB,mBAAa,MAAM;AACnB,oBAAc,MAAM;AACpB,qBAAe,QAAQ,CAAC,KAAK,QAAQ;AACnC,YAAI,IAAI,MAAO,cAAa,IAAI,KAAK,IAAI,KAAK;AAAA,MAChD,CAAC;AACD,wBAAkB;AAAA,IACpB;AAAA,IAEA,OAAO,SAAc,UAAkB,GAAS;AAE9C,YAAM,gBAAgB,oBAAI,IAAiB;AAC3C,YAAM,eAAe,oBAAI,IAAoB;AAC7C,YAAM,gBAAgB,oBAAI,IAA2B;AACrD,YAAM,iBAAiB,oBAAI,IAAY;AAGvC,iBAAW,QAAQ,CAAC,MAAM,QAAQ;AAChC,cAAM,SAAS,OAAO,UAAU,MAAM,IAAI;AAC1C,sBAAc,IAAI,QAAQ,IAAI;AAAA,MAChC,CAAC;AAGD,gBAAU,QAAQ,CAAC,KAAK,OAAO;AAC7B,cAAM,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,GAAG,EAAE,IAAI,MAAM;AACvC,cAAM,OAAO,KAAK,UAAU,IAAI,IAAI;AACpC,qBAAa,IAAI,UAAU,MAAM,CAAC,GAAG,GAAG;AAAA,MAC1C,CAAC;AAGD,iBAAW,QAAQ,CAAC,OAAO,OAAO;AAChC,cAAM,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,GAAG,EAAE,IAAI,MAAM;AACvC,cAAM,OAAO,KAAK,UAAU,IAAI,IAAI;AACpC,sBAAc,IAAI,UAAU,MAAM,CAAC,GAAG,KAAK;AAAA,MAC7C,CAAC;AAGD,kBAAY,QAAQ,CAAC,QAAQ;AAC3B,uBAAe,IAAI,OAAO,UAAU,MAAM,IAAI,GAAG;AAAA,MACnD,CAAC;AAGD,iBAAW,MAAM;AACjB,gBAAU,MAAM;AAChB,iBAAW,MAAM;AACjB,kBAAY,MAAM;AAElB,oBAAc,QAAQ,CAAC,MAAM,QAAQ,WAAW,IAAI,KAAK,IAAI,CAAC;AAC9D,mBAAa,QAAQ,CAAC,KAAK,OAAO,UAAU,IAAI,IAAI,GAAG,CAAC;AACxD,oBAAc,QAAQ,CAAC,OAAO,OAAO,WAAW,IAAI,IAAI,KAAK,CAAC;AAC9D,qBAAe,QAAQ,CAAC,QAAQ,YAAY,IAAI,GAAG,CAAC;AAKpD,qBAAe,QAAQ,CAAC,QAAQ;AAC9B,YAAI,QAAQ,IAAI,IAAI,KAAK,KAAM,SAAQ,IAAI,IAAI,IAAI;AAAA,MACrD,CAAC;AACD,iBAAW,IAAI,SAAS,OAAO;AAE/B;AAGA,kBAAY,IAAI,OAAO;AAGvB,kBAAY,QAAQ,CAAC,GAAG,OAAO;AAC7B,cAAM,CAAC,KAAK,GAAG,IAAI,GAAG,MAAM,GAAG,EAAE,IAAI,MAAM;AAC3C,qBAAa,KAAK,GAAG;AAAA,MACvB,CAAC;AAED,wBAAkB;AAAA,IACpB;AAAA,IAEA,UAAU,UAAwB;AAEhC,YAAM,gBAAgB,oBAAI,IAAiB;AAC3C,YAAM,eAAe,oBAAI,IAAoB;AAC7C,YAAM,gBAAgB,oBAAI,IAA2B;AACrD,YAAM,iBAAiB,oBAAI,IAAY;AAEvC,iBAAW,QAAQ,CAAC,MAAM,QAAQ;AAChC,YAAI,MAAM,UAAU;AAClB,wBAAc,IAAI,KAAK,IAAI;AAAA,QAC7B,WAAW,MAAM,UAAU;AACzB,wBAAc,IAAI,MAAM,GAAG,IAAI;AAAA,QACjC;AAAA,MACF,CAAC;AAED,gBAAU,QAAQ,CAAC,KAAK,OAAO;AAC7B,cAAM,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,GAAG,EAAE,IAAI,MAAM;AACvC,YAAI,IAAI,UAAU;AAChB,uBAAa,IAAI,UAAU,GAAG,CAAC,GAAG,GAAG;AAAA,QACvC,WAAW,IAAI,UAAU;AACvB,uBAAa,IAAI,UAAU,IAAI,GAAG,CAAC,GAAG,GAAG;AAAA,QAC3C;AAAA,MACF,CAAC;AAED,iBAAW,QAAQ,CAAC,OAAO,OAAO;AAChC,cAAM,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,GAAG,EAAE,IAAI,MAAM;AACvC,YAAI,IAAI,UAAU;AAChB,wBAAc,IAAI,UAAU,GAAG,CAAC,GAAG,KAAK;AAAA,QAC1C,WAAW,IAAI,UAAU;AACvB,wBAAc,IAAI,UAAU,IAAI,GAAG,CAAC,GAAG,KAAK;AAAA,QAC9C;AAAA,MACF,CAAC;AAED,kBAAY,QAAQ,CAAC,QAAQ;AAC3B,YAAI,MAAM,UAAU;AAClB,yBAAe,IAAI,GAAG;AAAA,QACxB,WAAW,MAAM,UAAU;AACzB,yBAAe,IAAI,MAAM,CAAC;AAAA,QAC5B;AAAA,MACF,CAAC;AAGD,iBAAW,MAAM;AACjB,gBAAU,MAAM;AAChB,iBAAW,MAAM;AACjB,kBAAY,MAAM;AAElB,oBAAc,QAAQ,CAAC,MAAM,QAAQ,WAAW,IAAI,KAAK,IAAI,CAAC;AAC9D,mBAAa,QAAQ,CAAC,KAAK,OAAO,UAAU,IAAI,IAAI,GAAG,CAAC;AACxD,oBAAc,QAAQ,CAAC,OAAO,OAAO,WAAW,IAAI,IAAI,KAAK,CAAC;AAC9D,qBAAe,QAAQ,CAAC,QAAQ,YAAY,IAAI,GAAG,CAAC;AAEpD;AAGA,kBAAY,QAAQ,CAAC,GAAG,OAAO;AAC7B,cAAM,CAAC,KAAK,GAAG,IAAI,GAAG,MAAM,GAAG,EAAE,IAAI,MAAM;AAC3C,qBAAa,KAAK,GAAG;AAAA,MACvB,CAAC;AAED,wBAAkB;AAAA,IACpB;AAAA,IAEA,aAAa,UAAkB,OAAsB;AACnD,UAAI,OAAO;AACT,oBAAY,IAAI,QAAQ;AAAA,MAC1B,OAAO;AACL,oBAAY,OAAO,QAAQ;AAAA,MAC7B;AACA,uBAAiB,UAAU,eAAe,MAAM;AAChD,wBAAkB;AAAA,IACpB;AAAA,IAEA,eAAe,UAAkB,WAAsB;AACrD,kBAAY,OAAO,QAAQ;AAC3B,iBAAW,IAAI,UAAU,SAAS;AAClC,uBAAiB,UAAU,eAAe,MAAM;AAChD,wBAAkB;AAAA,IACpB;AAAA;AAAA,IAGA,UAAU,KAAa,KAAa,UAAsC;AACxE,YAAM,KAAK,UAAU,KAAK,GAAG;AAC7B,UAAI,CAAC,YAAY,IAAI,EAAE,GAAG;AACxB,oBAAY,IAAI,IAAI,oBAAI,IAAI,CAAC;AAAA,MAC/B;AACA,kBAAY,IAAI,EAAE,EAAG,IAAI,QAAQ;AAEjC,aAAO,MAAM;AACX,cAAM,OAAO,YAAY,IAAI,EAAE;AAC/B,YAAI,MAAM;AACR,eAAK,OAAO,QAAQ;AACpB,cAAI,KAAK,SAAS,GAAG;AACnB,wBAAY,OAAO,EAAE;AAAA,UACvB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,IAEA,iBAAiB,UAAsC;AACrD,uBAAiB,IAAI,QAAQ;AAC7B,aAAO,MAAM;AACX,yBAAiB,OAAO,QAAQ;AAAA,MAClC;AAAA,IACF;AAAA,IAEA,qBAAqB,UAAsC;AACzD,2BAAqB,IAAI,QAAQ;AACjC,aAAO,MAAM;AACX,6BAAqB,OAAO,QAAQ;AAAA,MACtC;AAAA,IACF;AAAA,IAEA,mBAAmB,UAAsC;AACvD,yBAAmB,IAAI,QAAQ;AAC/B,aAAO,MAAM;AACX,2BAAmB,OAAO,QAAQ;AAAA,MACpC;AAAA,IACF;AAAA,IAEA,YAAY,KAAa,KAAqB;AAC5C,aAAO,UAAU,IAAI,UAAU,KAAK,GAAG,CAAC,KAAK;AAAA,IAC/C;AAAA;AAAA,IAGA,YAAY,KAAmD;AAC7D,iBAAW;AAAA,IACb;AAAA,IAEA,aAAmB;AACjB,gBAAU,SAAS,MAAM;AAAA,IAC3B;AAAA,IAEA,YAAkB;AAChB,gBAAU,SAAS,KAAK;AAAA,IAC1B;AAAA,IAEA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,SAAO;AACT;",
+  "names": []
+}

package/dist/backend/dynamic-table/styles/ContextMenu.css.js

@@ -0,0 +1,2 @@
+// Stub file - CSS is loaded via globals.css
+export default {};

package/dist/backend/dynamic-table/styles/DynamicTable.css.js

@@ -0,0 +1,2 @@
+// Stub file - CSS is loaded via globals.css
+export default {};

package/dist/backend/dynamic-table/styles/DynamicTable.v2.css.js

@@ -0,0 +1,2 @@
+// Stub file - CSS is loaded via globals.css
+export default {};

package/dist/backend/dynamic-table/styles/SearchBar.css.js

@@ -0,0 +1,2 @@
+// Stub file - CSS is loaded via globals.css
+export default {};

package/dist/backend/dynamic-table/styles/dateCell.css.js

@@ -0,0 +1,2 @@
+// Stub file - CSS is loaded via globals.css
+export default {};

package/dist/backend/dynamic-table/styles/density.css.js

@@ -0,0 +1,2 @@
+// Stub file - CSS is loaded via globals.css
+export default {};

package/dist/backend/dynamic-table/types/density.js

@@ -0,0 +1,29 @@
+const DENSITY_LEVELS = ["comfortable", "compact", "dense"];
+const DEFAULT_DENSITY = "comfortable";
+const DENSITY_ATTRIBUTE = "data-density-level";
+const DENSITY_METRICS = {
+  // Today's values, verified against DynamicTable.tsx:708 (`dataRowHeight`
+  // default 32) and DynamicTable.v2.css (header height is content-driven).
+  comfortable: { rowHeight: 32, headerHeight: null },
+  compact: { rowHeight: 26, headerHeight: 24 },
+  dense: { rowHeight: 20, headerHeight: 20 }
+};
+function isDensityLevel(value) {
+  return value === "comfortable" || value === "compact" || value === "dense";
+}
+function resolveDensityAttribute(level) {
+  return isDensityLevel(level) ? level : DEFAULT_DENSITY;
+}
+function resolveDensityRowHeight(level) {
+  return DENSITY_METRICS[isDensityLevel(level) ? level : DEFAULT_DENSITY].rowHeight;
+}
+export {
+  DEFAULT_DENSITY,
+  DENSITY_ATTRIBUTE,
+  DENSITY_LEVELS,
+  DENSITY_METRICS,
+  isDensityLevel,
+  resolveDensityAttribute,
+  resolveDensityRowHeight
+};
+//# sourceMappingURL=density.js.map

package/dist/backend/dynamic-table/types/density.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/backend/dynamic-table/types/density.ts"],
+  "sourcesContent": ["/**\n * DynamicTable density scale \u2014 the USER-SETTABLE row/type density preference.\n *\n * \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n * WHY THIS EXISTS\n *\n * Logistics users read a whole working picture off one screen. The 3 Aug 2026\n * INF workshops recorded the complaint verbatim (A16): \"on a normal monitor\n * roughly half the needed columns fit\". The same workshops recorded the exact\n * opposite need \u2014 two users (Agnieszka, Klaudiusz) work completely differently\n * and both asked for their own defaults, and the product owner has repeatedly\n * flagged FMS tables as \"fonts too small\".\n *\n * Those two facts do not reconcile into one number. They reconcile into a\n * PREFERENCE. So:\n *\n *   - `comfortable` is the DEFAULT and is pixel-identical to how the grid\n *     renders today. Opting out of the feature is a no-op.\n *   - `compact` and `dense` are opt-in, per user, and persist for that user.\n *   - Nothing here shrinks type globally. There is no global default change.\n *\n * \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n * WHY IT IS AN ATTRIBUTE, NOT A PROP THREADED INTO CELLS\n *\n * The grid virtualizes ROWS ONLY (one `useVirtualizer`, `overscan: 10`, no\n * `horizontal: true`). `VirtualRow` does a plain `columns.map`, so EVERY column\n * of EVERY mounted row renders. Denser tables mount MORE cells, so anything\n * per-cell gets multiplied by thousands.\n *\n * Therefore density is delivered as ONE attribute on the container\n * (`data-density-level`) which flips a block of CSS custom properties consumed\n * by existing selectors in `styles/density.css`. Switching density re-styles\n * the entire grid with:\n *\n *   - zero per-cell React work,\n *   - zero cell re-renders,\n *   - zero extra props threaded through `Cell` / `VirtualRow`.\n *\n * The browser recalculates style for the subtree; React does nothing.\n *\n * THE ONE EXCEPTION, stated honestly: ROW HEIGHT cannot be CSS-only. Rows are\n * absolutely positioned by the virtualizer (`transform: translateY(...)`, plus\n * an inline `height`), so the height must be a number JS knows. That is what\n * `DENSITY_METRICS[level].rowHeight` is for \u2014 the virtualizer's `estimateSize`\n * reads it, and `density.css` restates the SAME number for the box model.\n * Changing density therefore costs exactly one virtualizer re-measure, not a\n * per-cell pass. Do NOT try to force row height from CSS with `!important`:\n * it would win over the inline style and immediately desynchronise the fill\n * from the `translateY` offsets, overlapping the rows.\n *\n * \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n * NAMING TRAP \u2014 `data-density-level`, NOT `data-density`\n *\n * `data-density` is ALREADY TAKEN. `DynamicTable.tsx` emits it from a legacy\n * DEVELOPER-facing prop (`density?: 'sm' | 'md'` \u2192 36px / 44px rows), and\n * `DynamicTable.v2.css` carries rules keyed on `:not([data-density])` that\n * define part of today's default rendering. Reusing the attribute would\n * silently switch those rules off the moment a user picked `comfortable` \u2014\n * which is precisely the \"opting out must be a no-op\" guarantee, broken.\n *\n * So this scale uses a distinct attribute. The two are orthogonal today; see\n * the migration note at the bottom of this file.\n */\n\n/**\n * The three density levels, coarsest to tightest.\n *\n * - `comfortable` \u2014 today's sizing, exactly. The default.\n * - `compact`     \u2014 same 12px type, tighter geometry. ~24% more rows.\n * - `dense`       \u2014 the maximum-information setting: 11px data / 10px headers,\n *                   hairline row rules. ~67% more rows. For a power user on a\n *                   wide monitor who is scanning, not reading.\n */\nexport type DensityLevel = 'comfortable' | 'compact' | 'dense'\n\n/** Every level, in scale order. Safe to render as a picker. */\nexport const DENSITY_LEVELS: readonly DensityLevel[] = ['comfortable', 'compact', 'dense'] as const\n\n/**\n * The default. MUST stay `comfortable`: it is defined as pixel-identical to\n * pre-density rendering, which is what makes shipping this feature a visual\n * no-op for every user who never opens the setting.\n */\nexport const DEFAULT_DENSITY: DensityLevel = 'comfortable'\n\n/**\n * The container attribute that carries the level.\n *\n * Deliberately NOT `data-density` \u2014 see the naming trap above.\n */\nexport const DENSITY_ATTRIBUTE = 'data-density-level' as const\n\n/**\n * Geometry each level needs on the JS side.\n *\n * ONLY the numbers that CSS cannot own live here. Padding, borders, and the\n * type ramp are pure CSS (`styles/density.css`) and are intentionally absent \u2014\n * duplicating them in TS would create two sources of truth for values nothing\n * in JS reads.\n *\n * `rowHeight` MUST equal `--dt-row-height` for the same level in\n * `styles/density.css`. They are asserted equal by the unit test\n * `__tests__/density.test.ts`, which parses the stylesheet.\n */\nexport type DensityMetrics = {\n  /**\n   * Data-row height in px, border-box, INCLUDING the inter-row gap borders.\n   * Feeds the virtualizer's `estimateSize`.\n   */\n  rowHeight: number\n  /**\n   * Column-header row height in px, border-box. `null` = content-driven\n   * (`height: auto`), which is what today's grid does \u2014 pinning a number for\n   * `comfortable` would be a 1\u20132px visual change, and `comfortable` is not\n   * allowed to change anything.\n   */\n  headerHeight: number | null\n}\n\nexport const DENSITY_METRICS: Readonly<Record<DensityLevel, DensityMetrics>> = {\n  // Today's values, verified against DynamicTable.tsx:708 (`dataRowHeight`\n  // default 32) and DynamicTable.v2.css (header height is content-driven).\n  comfortable: { rowHeight: 32, headerHeight: null },\n  compact: { rowHeight: 26, headerHeight: 24 },\n  dense: { rowHeight: 20, headerHeight: 20 },\n}\n\n/**\n * Narrow an untrusted value (localStorage, an API response, a URL param) to a\n * `DensityLevel`. Pure; no allocation.\n */\nexport function isDensityLevel(value: unknown): value is DensityLevel {\n  return value === 'comfortable' || value === 'compact' || value === 'dense'\n}\n\n/**\n * Resolve a density level to the value of the container's density attribute.\n *\n * Pure, total, allocation-free \u2014 it returns one of three interned string\n * literals, so it is safe to call inside a render body.\n *\n * TOTAL BY DESIGN: an absent, `null`, or corrupt input (a stale localStorage\n * value, a hand-edited URL param) resolves to `DEFAULT_DENSITY` rather than\n * `null` or a throw. A broken preference must degrade to today's rendering,\n * never to an unstyled or missing grid.\n *\n * NOTE: `comfortable` DOES emit its attribute value rather than dropping the\n * attribute. That is deliberate. Every consuming rule in `density.css` is\n * guarded by `:not([data-density-level=\"comfortable\"])`, so the attribute's\n * presence at the default level changes nothing \u2014 and having it always present\n * means the level is inspectable in DevTools and assertable from `GridHarness`\n * without a special \"absent means comfortable\" case in every test.\n */\nexport function resolveDensityAttribute(level: DensityLevel | null | undefined): DensityLevel {\n  return isDensityLevel(level) ? level : DEFAULT_DENSITY\n}\n\n/**\n * Row height for a level. Falls back to the default for unknown input rather\n * than throwing \u2014 a corrupt stored preference must never break the grid.\n */\nexport function resolveDensityRowHeight(level: DensityLevel | null | undefined): number {\n  return DENSITY_METRICS[isDensityLevel(level) ? level : DEFAULT_DENSITY].rowHeight\n}\n\n/*\n * \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n * MIGRATION NOTE \u2014 folding in the legacy `density?: 'sm' | 'md'` prop\n *\n * The legacy prop is a per-table DEVELOPER choice (36px / 44px rows); this\n * scale is a per-user preference. They are independent axes today and a table\n * may carry both attributes without conflict, because `density.css` never\n * keys off `[data-density]`.\n *\n * The eventual cleanup \u2014 one axis, user-owned \u2014 is a separate change and needs\n * its own spec, because `'md'` (44px) is LOOSER than `comfortable` (32px), so\n * there is no honest 1:1 mapping. Do not \"simplify\" it in passing.\n * \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n */\n"],
+  "mappings": "AA4EO,MAAM,iBAA0C,CAAC,eAAe,WAAW,OAAO;AAOlF,MAAM,kBAAgC;AAOtC,MAAM,oBAAoB;AA6B1B,MAAM,kBAAkE;AAAA;AAAA;AAAA,EAG7E,aAAa,EAAE,WAAW,IAAI,cAAc,KAAK;AAAA,EACjD,SAAS,EAAE,WAAW,IAAI,cAAc,GAAG;AAAA,EAC3C,OAAO,EAAE,WAAW,IAAI,cAAc,GAAG;AAC3C;AAMO,SAAS,eAAe,OAAuC;AACpE,SAAO,UAAU,iBAAiB,UAAU,aAAa,UAAU;AACrE;AAoBO,SAAS,wBAAwB,OAAsD;AAC5F,SAAO,eAAe,KAAK,IAAI,QAAQ;AACzC;AAMO,SAAS,wBAAwB,OAAgD;AACtF,SAAO,gBAAgB,eAAe,KAAK,IAAI,QAAQ,eAAe,EAAE;AAC1E;",
+  "names": []
+}

package/dist/backend/dynamic-table/types/filters.js

@@ -0,0 +1,124 @@
+const getOperatorsForType = (type) => {
+  const common = [
+    { value: "is_any_of", label: "is any of" },
+    { value: "is_not_any_of", label: "is not any of" },
+    { value: "is_empty", label: "is empty" },
+    { value: "is_not_empty", label: "is not empty" }
+  ];
+  if (type === "numeric") {
+    return [
+      ...common,
+      { value: "equals", label: "equals" },
+      { value: "not_equals", label: "not equals" },
+      { value: "greater_than", label: "greater than" },
+      { value: "less_than", label: "less than" }
+    ];
+  }
+  if (type === "boolean") {
+    return [
+      { value: "is_true", label: "is true" },
+      { value: "is_false", label: "is false" }
+    ];
+  }
+  if (type === "date") {
+    return [
+      // Now-relative presets first — the most-used for "due today / this week".
+      { value: "is_today", label: "today" },
+      { value: "is_tomorrow", label: "tomorrow" },
+      { value: "is_this_week", label: "this week" },
+      { value: "is_next_week", label: "next week" },
+      { value: "is_overdue", label: "overdue" },
+      { value: "is_between", label: "is between" },
+      { value: "is_before", label: "is before" },
+      { value: "is_after", label: "is after" },
+      { value: "is_on_or_before", label: "is on or before" },
+      { value: "is_on_or_after", label: "is on or after" },
+      { value: "is_in_next", label: "next" },
+      { value: "is_in_last", label: "last" },
+      { value: "equals", label: "equals" },
+      { value: "is_empty", label: "is empty" },
+      { value: "is_not_empty", label: "is not empty" }
+    ];
+  }
+  return [
+    ...common,
+    { value: "contains", label: "contains" }
+  ];
+};
+const PRESET_DATE_OPERATORS = [
+  "is_overdue",
+  "is_today",
+  "is_tomorrow",
+  "is_this_week",
+  "is_next_week"
+];
+const needsValueInput = (operator) => {
+  return !["is_empty", "is_not_empty", "is_true", "is_false", ...PRESET_DATE_OPERATORS].includes(operator);
+};
+const needsMultipleValues = (operator) => {
+  return ["is_any_of", "is_not_any_of"].includes(operator);
+};
+const needsRangeValues = (operator) => {
+  return operator === "is_between";
+};
+const DATE_OPERATORS = [
+  "is_before",
+  "is_after",
+  "is_on_or_before",
+  "is_on_or_after",
+  "is_between",
+  "equals"
+];
+const isDateOperator = (operator) => DATE_OPERATORS.includes(operator);
+const RELATIVE_DATE_UNITS = ["days", "weeks", "months"];
+const RELATIVE_DATE_OPERATORS = ["is_in_next", "is_in_last"];
+const needsRelativeInput = (operator) => RELATIVE_DATE_OPERATORS.includes(operator);
+const applyFilters = (data, filters, columns) => {
+  if (filters.length === 0) return data;
+  return data.filter((row) => {
+    return filters.every((filter) => {
+      const value = row[filter.field];
+      const stringValue = String(value ?? "").toLowerCase();
+      switch (filter.operator) {
+        case "is_any_of":
+          return filter.values.some((v) => String(value) === v);
+        case "is_not_any_of":
+          return !filter.values.some((v) => String(value) === v);
+        case "contains":
+          return filter.values.some((v) => stringValue.includes(v.toLowerCase()));
+        case "is_empty":
+          return !value || stringValue === "";
+        case "is_not_empty":
+          return !!value && stringValue !== "";
+        case "equals":
+          return Number(value) === Number(filter.values[0]);
+        case "not_equals":
+          return Number(value) !== Number(filter.values[0]);
+        case "greater_than":
+          return Number(value) > Number(filter.values[0]);
+        case "less_than":
+          return Number(value) < Number(filter.values[0]);
+        case "is_true":
+          return value === true || value === "true";
+        case "is_false":
+          return value === false || value === "false";
+        default:
+          return true;
+      }
+    });
+  });
+};
+export {
+  DATE_OPERATORS,
+  PRESET_DATE_OPERATORS,
+  RELATIVE_DATE_OPERATORS,
+  RELATIVE_DATE_UNITS,
+  applyFilters,
+  getOperatorsForType,
+  isDateOperator,
+  needsMultipleValues,
+  needsRangeValues,
+  needsRelativeInput,
+  needsValueInput
+};
+//# sourceMappingURL=filters.js.map

package/dist/backend/dynamic-table/types/filters.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/backend/dynamic-table/types/filters.ts"],
+  "sourcesContent": ["// types/filters.ts\n\nexport type FilterOperator =\n  | 'is_any_of'\n  | 'is_not_any_of'\n  | 'contains'\n  | 'is_empty'\n  | 'is_not_empty'\n  | 'equals'\n  | 'not_equals'\n  | 'greater_than'\n  | 'less_than'\n  | 'is_true'\n  | 'is_false'\n  | 'is_before'\n  | 'is_after'\n  | 'is_on_or_before'\n  | 'is_on_or_after'\n  | 'is_between'\n  | 'is_in_next'\n  | 'is_in_last'\n  | 'is_overdue'\n  | 'is_today'\n  | 'is_tomorrow'\n  | 'is_this_week'\n  | 'is_next_week';\n\nexport const getOperatorsForType = (type?: 'text' | 'numeric' | 'boolean'| \"date\" | \"dropdown\" | \"multiselect\"): { value: FilterOperator; label: string }[] => {\n  const common = [\n    { value: 'is_any_of' as FilterOperator, label: 'is any of' },\n    { value: 'is_not_any_of' as FilterOperator, label: 'is not any of' },\n    { value: 'is_empty' as FilterOperator, label: 'is empty' },\n    { value: 'is_not_empty' as FilterOperator, label: 'is not empty' },\n  ];\n\n  if (type === 'numeric') {\n    return [\n      ...common,\n      { value: 'equals' as FilterOperator, label: 'equals' },\n      { value: 'not_equals' as FilterOperator, label: 'not equals' },\n      { value: 'greater_than' as FilterOperator, label: 'greater than' },\n      { value: 'less_than' as FilterOperator, label: 'less than' },\n    ];\n  }\n\n  if (type === 'boolean') {\n    return [\n      { value: 'is_true' as FilterOperator, label: 'is true' },\n      { value: 'is_false' as FilterOperator, label: 'is false' },\n    ];\n  }\n\n  if (type === 'date') {\n    return [\n      // Now-relative presets first \u2014 the most-used for \"due today / this week\".\n      { value: 'is_today' as FilterOperator, label: 'today' },\n      { value: 'is_tomorrow' as FilterOperator, label: 'tomorrow' },\n      { value: 'is_this_week' as FilterOperator, label: 'this week' },\n      { value: 'is_next_week' as FilterOperator, label: 'next week' },\n      { value: 'is_overdue' as FilterOperator, label: 'overdue' },\n      { value: 'is_between' as FilterOperator, label: 'is between' },\n      { value: 'is_before' as FilterOperator, label: 'is before' },\n      { value: 'is_after' as FilterOperator, label: 'is after' },\n      { value: 'is_on_or_before' as FilterOperator, label: 'is on or before' },\n      { value: 'is_on_or_after' as FilterOperator, label: 'is on or after' },\n      { value: 'is_in_next' as FilterOperator, label: 'next' },\n      { value: 'is_in_last' as FilterOperator, label: 'last' },\n      { value: 'equals' as FilterOperator, label: 'equals' },\n      { value: 'is_empty' as FilterOperator, label: 'is empty' },\n      { value: 'is_not_empty' as FilterOperator, label: 'is not empty' },\n    ];\n  }\n\n  return [\n    ...common,\n    { value: 'contains' as FilterOperator, label: 'contains' },\n  ];\n};\n\n// Now-relative preset operators \u2014 value-less; resolved to a today-anchored\n// window server-side (see filterParser). Like is_empty, they render no value\n// editor.\nexport const PRESET_DATE_OPERATORS: FilterOperator[] = [\n  'is_overdue', 'is_today', 'is_tomorrow', 'is_this_week', 'is_next_week',\n];\n\nexport const needsValueInput = (operator: FilterOperator): boolean => {\n  return !['is_empty', 'is_not_empty', 'is_true', 'is_false', ...PRESET_DATE_OPERATORS].includes(operator);\n};\n\nexport const needsMultipleValues = (operator: FilterOperator): boolean => {\n  return ['is_any_of', 'is_not_any_of'].includes(operator);\n};\n\n// `is_between` takes two scalar values (from + to), shown as two date inputs.\n// Distinct from `needsMultipleValues` which is a multi-pill \"any of\" set.\nexport const needsRangeValues = (operator: FilterOperator): boolean => {\n  return operator === 'is_between';\n};\n\n// Date-operator predicate \u2014 used by ConfigureViewFilters to render\n// <input type=\"date\"> instead of a plain text box.\n// NB: the relative operators (`is_in_next`/`is_in_last`) are deliberately\n// excluded \u2014 they take a count + unit, not a calendar date, so they render the\n// relative editor (see `needsRelativeInput`) rather than the FilterDatePicker.\nexport const DATE_OPERATORS: FilterOperator[] = [\n  'is_before', 'is_after', 'is_on_or_before', 'is_on_or_after', 'is_between', 'equals',\n];\nexport const isDateOperator = (operator: FilterOperator): boolean => DATE_OPERATORS.includes(operator);\n\n// Relative (\"moving\") date operators \u2014 value is a [count, unit] pair, resolved\n// to a today-anchored window server-side. Rendered as a number input + unit\n// select (dni / tygodnie / miesi\u0105ce) in ConfigureViewFilters.\nexport type RelativeDateUnit = 'days' | 'weeks' | 'months';\nexport const RELATIVE_DATE_UNITS: RelativeDateUnit[] = ['days', 'weeks', 'months'];\nexport const RELATIVE_DATE_OPERATORS: FilterOperator[] = ['is_in_next', 'is_in_last'];\nexport const needsRelativeInput = (operator: FilterOperator): boolean =>\n  RELATIVE_DATE_OPERATORS.includes(operator);\n\nexport const applyFilters = (data: any[], filters: { field: string; operator: FilterOperator; values: string[] }[], columns: any[]): any[] => {\n  if (filters.length === 0) return data;\n\n  return data.filter(row => {\n    return filters.every(filter => {\n      const value = row[filter.field];\n      const stringValue = String(value ?? '').toLowerCase();\n\n      switch (filter.operator) {\n        case 'is_any_of':\n          return filter.values.some(v => String(value) === v);\n        case 'is_not_any_of':\n          return !filter.values.some(v => String(value) === v);\n        case 'contains':\n          return filter.values.some(v => stringValue.includes(v.toLowerCase()));\n        case 'is_empty':\n          return !value || stringValue === '';\n        case 'is_not_empty':\n          return !!value && stringValue !== '';\n        case 'equals':\n          return Number(value) === Number(filter.values[0]);\n        case 'not_equals':\n          return Number(value) !== Number(filter.values[0]);\n        case 'greater_than':\n          return Number(value) > Number(filter.values[0]);\n        case 'less_than':\n          return Number(value) < Number(filter.values[0]);\n        case 'is_true':\n          return value === true || value === 'true';\n        case 'is_false':\n          return value === false || value === 'false';\n        default:\n          return true;\n      }\n    });\n  });\n};\n"],
+  "mappings": "AA2BO,MAAM,sBAAsB,CAAC,SAA2H;AAC7J,QAAM,SAAS;AAAA,IACb,EAAE,OAAO,aAA+B,OAAO,YAAY;AAAA,IAC3D,EAAE,OAAO,iBAAmC,OAAO,gBAAgB;AAAA,IACnE,EAAE,OAAO,YAA8B,OAAO,WAAW;AAAA,IACzD,EAAE,OAAO,gBAAkC,OAAO,eAAe;AAAA,EACnE;AAEA,MAAI,SAAS,WAAW;AACtB,WAAO;AAAA,MACL,GAAG;AAAA,MACH,EAAE,OAAO,UAA4B,OAAO,SAAS;AAAA,MACrD,EAAE,OAAO,cAAgC,OAAO,aAAa;AAAA,MAC7D,EAAE,OAAO,gBAAkC,OAAO,eAAe;AAAA,MACjE,EAAE,OAAO,aAA+B,OAAO,YAAY;AAAA,IAC7D;AAAA,EACF;AAEA,MAAI,SAAS,WAAW;AACtB,WAAO;AAAA,MACL,EAAE,OAAO,WAA6B,OAAO,UAAU;AAAA,MACvD,EAAE,OAAO,YAA8B,OAAO,WAAW;AAAA,IAC3D;AAAA,EACF;AAEA,MAAI,SAAS,QAAQ;AACnB,WAAO;AAAA;AAAA,MAEL,EAAE,OAAO,YAA8B,OAAO,QAAQ;AAAA,MACtD,EAAE,OAAO,eAAiC,OAAO,WAAW;AAAA,MAC5D,EAAE,OAAO,gBAAkC,OAAO,YAAY;AAAA,MAC9D,EAAE,OAAO,gBAAkC,OAAO,YAAY;AAAA,MAC9D,EAAE,OAAO,cAAgC,OAAO,UAAU;AAAA,MAC1D,EAAE,OAAO,cAAgC,OAAO,aAAa;AAAA,MAC7D,EAAE,OAAO,aAA+B,OAAO,YAAY;AAAA,MAC3D,EAAE,OAAO,YAA8B,OAAO,WAAW;AAAA,MACzD,EAAE,OAAO,mBAAqC,OAAO,kBAAkB;AAAA,MACvE,EAAE,OAAO,kBAAoC,OAAO,iBAAiB;AAAA,MACrE,EAAE,OAAO,cAAgC,OAAO,OAAO;AAAA,MACvD,EAAE,OAAO,cAAgC,OAAO,OAAO;AAAA,MACvD,EAAE,OAAO,UAA4B,OAAO,SAAS;AAAA,MACrD,EAAE,OAAO,YAA8B,OAAO,WAAW;AAAA,MACzD,EAAE,OAAO,gBAAkC,OAAO,eAAe;AAAA,IACnE;AAAA,EACF;AAEA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,EAAE,OAAO,YAA8B,OAAO,WAAW;AAAA,EAC3D;AACF;AAKO,MAAM,wBAA0C;AAAA,EACrD;AAAA,EAAc;AAAA,EAAY;AAAA,EAAe;AAAA,EAAgB;AAC3D;AAEO,MAAM,kBAAkB,CAAC,aAAsC;AACpE,SAAO,CAAC,CAAC,YAAY,gBAAgB,WAAW,YAAY,GAAG,qBAAqB,EAAE,SAAS,QAAQ;AACzG;AAEO,MAAM,sBAAsB,CAAC,aAAsC;AACxE,SAAO,CAAC,aAAa,eAAe,EAAE,SAAS,QAAQ;AACzD;AAIO,MAAM,mBAAmB,CAAC,aAAsC;AACrE,SAAO,aAAa;AACtB;AAOO,MAAM,iBAAmC;AAAA,EAC9C;AAAA,EAAa;AAAA,EAAY;AAAA,EAAmB;AAAA,EAAkB;AAAA,EAAc;AAC9E;AACO,MAAM,iBAAiB,CAAC,aAAsC,eAAe,SAAS,QAAQ;AAM9F,MAAM,sBAA0C,CAAC,QAAQ,SAAS,QAAQ;AAC1E,MAAM,0BAA4C,CAAC,cAAc,YAAY;AAC7E,MAAM,qBAAqB,CAAC,aACjC,wBAAwB,SAAS,QAAQ;AAEpC,MAAM,eAAe,CAAC,MAAa,SAA0E,YAA0B;AAC5I,MAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,SAAO,KAAK,OAAO,SAAO;AACxB,WAAO,QAAQ,MAAM,YAAU;AAC7B,YAAM,QAAQ,IAAI,OAAO,KAAK;AAC9B,YAAM,cAAc,OAAO,SAAS,EAAE,EAAE,YAAY;AAEpD,cAAQ,OAAO,UAAU;AAAA,QACvB,KAAK;AACH,iBAAO,OAAO,OAAO,KAAK,OAAK,OAAO,KAAK,MAAM,CAAC;AAAA,QACpD,KAAK;AACH,iBAAO,CAAC,OAAO,OAAO,KAAK,OAAK,OAAO,KAAK,MAAM,CAAC;AAAA,QACrD,KAAK;AACH,iBAAO,OAAO,OAAO,KAAK,OAAK,YAAY,SAAS,EAAE,YAAY,CAAC,CAAC;AAAA,QACtE,KAAK;AACH,iBAAO,CAAC,SAAS,gBAAgB;AAAA,QACnC,KAAK;AACH,iBAAO,CAAC,CAAC,SAAS,gBAAgB;AAAA,QACpC,KAAK;AACH,iBAAO,OAAO,KAAK,MAAM,OAAO,OAAO,OAAO,CAAC,CAAC;AAAA,QAClD,KAAK;AACH,iBAAO,OAAO,KAAK,MAAM,OAAO,OAAO,OAAO,CAAC,CAAC;AAAA,QAClD,KAAK;AACH,iBAAO,OAAO,KAAK,IAAI,OAAO,OAAO,OAAO,CAAC,CAAC;AAAA,QAChD,KAAK;AACH,iBAAO,OAAO,KAAK,IAAI,OAAO,OAAO,OAAO,CAAC,CAAC;AAAA,QAChD,KAAK;AACH,iBAAO,UAAU,QAAQ,UAAU;AAAA,QACrC,KAAK;AACH,iBAAO,UAAU,SAAS,UAAU;AAAA,QACtC;AACE,iBAAO;AAAA,MACX;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AACH;",
+  "names": []
+}

package/dist/backend/dynamic-table/types/grouping.js

@@ -0,0 +1,34 @@
+const AGGREGATION_FNS = [
+  "sum",
+  "avg",
+  "min",
+  "max",
+  "count",
+  "countDistinct"
+];
+function isAggregationFn(value) {
+  return typeof value === "string" && AGGREGATION_FNS.includes(value);
+}
+function aggregationFnsForColumnType(type) {
+  if (type === "numeric") return ["sum", "avg", "min", "max", "count", "countDistinct"];
+  if (type === "date") return ["min", "max", "count", "countDistinct"];
+  return ["count", "countDistinct"];
+}
+function defaultAggregationFnForColumnType(type) {
+  return aggregationFnsForColumnType(type)[0] ?? "count";
+}
+function generateGroupRuleId() {
+  return `group-${Date.now()}-${Math.random().toString(36).substr(2, 9)}`;
+}
+function generateAggregationRuleId(field) {
+  return `agg-${field}`;
+}
+export {
+  AGGREGATION_FNS,
+  aggregationFnsForColumnType,
+  defaultAggregationFnForColumnType,
+  generateAggregationRuleId,
+  generateGroupRuleId,
+  isAggregationFn
+};
+//# sourceMappingURL=grouping.js.map

package/dist/backend/dynamic-table/types/grouping.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/backend/dynamic-table/types/grouping.ts"],
+  "sourcesContent": ["// types/grouping.ts\n\nimport type { ColumnDataType } from './perspective';\n\nexport interface GroupRule {\n  id: string;\n  field: string;\n  direction: 'asc' | 'desc';\n}\n\n/**\n * Aggregation function applied to a column within each group (and, once the\n * footer is wired, over the filtered dataset).\n *\n * Semantics deliberately mirror SQL / Excel so the client-side fold and the\n * server-side `GROUP BY`-less aggregate agree on the same numbers:\n *\n * - `sum`            \u2014 `SUM(col)`; non-numeric cells are ignored, empty set \u2192 0\n * - `avg`            \u2014 `AVG(col)`; non-numeric ignored, empty set \u2192 null\n * - `min` / `max`    \u2014 `MIN(col)` / `MAX(col)`; empty set \u2192 null. Date columns\n *                      compare chronologically and yield epoch milliseconds.\n * - `count`          \u2014 `COUNT(col)`: non-empty cells (NOT the row count)\n * - `countDistinct`  \u2014 `COUNT(DISTINCT col)`\n */\nexport type AggregationFn = 'sum' | 'avg' | 'min' | 'max' | 'count' | 'countDistinct';\n\n/**\n * THE single source of truth for the supported functions.\n *\n * There used to be three independent `['sum']` literals \u2014 this type, the\n * `perspectiveTransforms` whitelist (which SILENTLY DROPPED any rule it did not\n * recognise, so a saved view could lose its rules on reload) and the Configure\n * View picker. They must widen in lockstep, so they now all read this constant.\n */\nexport const AGGREGATION_FNS: readonly AggregationFn[] = [\n  'sum',\n  'avg',\n  'min',\n  'max',\n  'count',\n  'countDistinct',\n] as const;\n\nexport function isAggregationFn(value: unknown): value is AggregationFn {\n  return typeof value === 'string' && (AGGREGATION_FNS as readonly string[]).includes(value);\n}\n\n/**\n * Which functions make sense for a column of this type.\n *\n * `count` / `countDistinct` are valid on *every* column (Excel's COUNTA works\n * on text); `sum` / `avg` need numbers; `min` / `max` additionally work on\n * dates, which is how \"earliest / latest\" is expressed.\n */\nexport function aggregationFnsForColumnType(type?: ColumnDataType): AggregationFn[] {\n  if (type === 'numeric') return ['sum', 'avg', 'min', 'max', 'count', 'countDistinct'];\n  if (type === 'date') return ['min', 'max', 'count', 'countDistinct'];\n  return ['count', 'countDistinct'];\n}\n\n/** The first function that is valid for a column type \u2014 used when a rule's column changes. */\nexport function defaultAggregationFnForColumnType(type?: ColumnDataType): AggregationFn {\n  return aggregationFnsForColumnType(type)[0] ?? 'count';\n}\n\nexport interface AggregationRule {\n  /** Stable id \u2014 one rule per column, so `agg-<field>`. */\n  id: string;\n  /** Column `data` key. */\n  field: string;\n  fn: AggregationFn;\n  /**\n   * OPTIONAL partition column (`data` key). When set, the aggregate is not one\n   * number but ONE NUMBER PER DISTINCT VALUE of this column, and the UI renders\n   * the breakdown instead of a single figure.\n   *\n   * This exists because a scalar `sum` over a column whose rows are not\n   * commensurable is not merely imprecise \u2014 it is FALSE, and it looks fine.\n   * `SUM(grossAmount)` over 6 150 PLN + 1 000 EUR + 8 600 USD rendered\n   * `15 750,00`, unlabelled, as the only summary figure on the screen an\n   * accountant closes the month from (HEDGE-147).\n   *\n   * The honest fix is a per-dimension breakdown rather than a conversion to a\n   * base currency: a breakdown needs no exchange rate, so unlike a converted\n   * total it CANNOT be wrong. (A converted total would additionally have to\n   * show rate + date + source to be readable at all \u2014 HEDGE-39/43/81 \u2014 and\n   * would have to source a rate that most rows simply do not carry.)\n   *\n   * Omitted on every pre-existing rule, so behaviour is unchanged wherever it\n   * is not set.\n   */\n  dimension?: string;\n}\n\n/**\n * One slice of a dimensioned aggregate: the partition value and its figure.\n *\n * `key` is the raw cell value of the dimension column, stringified (`'PLN'`),\n * or `''` when the row had none \u2014 the renderer decides how to label that.\n */\nexport interface AggregateBreakdownEntry {\n  key: string;\n  value: number | null;\n}\n\n/**\n * What set of rows an aggregate actually describes.\n *\n * This is not decoration. Client-side grouping folds over ONE server page\n * (`pageSize <= 100`), so a subtotal presented as \"the group total\" is wrong\n * whenever the dataset spans more than one page. Every aggregate therefore\n * carries its scope and the UI is required to render it.\n */\nexport type AggregateScope = 'dataset' | 'page';\n\n/**\n * Transport shape for a server-computed aggregate (`?aggregate=` response).\n * Not persisted.\n */\nexport interface AggregateResult {\n  /** MANDATORY. An unlabelled number is the defect this exists to prevent. */\n  scope: AggregateScope;\n  /** Row count in scope. */\n  total: number;\n  /** `${field}:${fn}` -> value. `null` means \"no value in scope\" (e.g. MIN of nothing). */\n  values: Record<string, number | null>;\n  /**\n   * `${field}:${fn}` -> per-dimension slices, present only for rules that\n   * carry a `dimension`. Optional, so a route that has not adopted it (and\n   * every already-published response) stays valid.\n   */\n  breakdowns?: Record<string, AggregateBreakdownEntry[]>;\n}\n\nexport interface GroupHeaderVisualRow {\n  type: 'groupHeader';\n  groupKey: string;\n  field: string;\n  value: string;\n  count: number;\n  depth: number;\n  collapsed: boolean;\n  /** Data indices of every row in this group (incl. nested descendants),\n   * regardless of collapse state \u2014 drives the group select-all checkbox. */\n  memberDataIndices: number[];\n}\n\nexport interface DataVisualRow {\n  type: 'dataRow';\n  dataIndex: number;\n}\n\n/** Subtotal row rendered after a group's rows (one per group level). */\nexport interface GroupSummaryVisualRow {\n  type: 'groupSummary';\n  /** Ties the summary to its group header. */\n  groupKey: string;\n  /** Nesting depth \u2014 parity with the group header for left-indent. */\n  depth: number;\n  /** field -> aggregated value. Only aggregated fields are present.\n   *  `null` = the function had nothing to work with (e.g. MIN over no numbers). */\n  values: Record<string, number | null>;\n  /** field -> the function that produced `values[field]`, so the renderer can\n   *  format a count as an integer and a date MIN as a date. */\n  fns: Record<string, AggregationFn>;\n  /** field -> per-dimension slices, for the fields whose rule set a\n   *  `dimension`. When present the renderer shows these INSTEAD of\n   *  `values[field]`, because for those fields the scalar is not meaningful. */\n  breakdowns?: Record<string, AggregateBreakdownEntry[]>;\n  /**\n   * What these numbers actually cover. `'page'` whenever the loaded rows are\n   * only part of the filtered dataset (or when coverage is unknown) \u2014 the UI\n   * MUST say so rather than presenting a page fold as a group total.\n   */\n  scope: AggregateScope;\n  /** How many rows on the loaded page fed this subtotal. */\n  rowsCovered: number;\n}\n\nexport type VisualRow = GroupHeaderVisualRow | DataVisualRow | GroupSummaryVisualRow;\n\nexport function generateGroupRuleId(): string {\n  return `group-${Date.now()}-${Math.random().toString(36).substr(2, 9)}`;\n}\n\n/** One aggregation rule per column, so a field-derived id keeps it unique. */\nexport function generateAggregationRuleId(field: string): string {\n  return `agg-${field}`;\n}\n"],
+  "mappings": "AAkCO,MAAM,kBAA4C;AAAA,EACvD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEO,SAAS,gBAAgB,OAAwC;AACtE,SAAO,OAAO,UAAU,YAAa,gBAAsC,SAAS,KAAK;AAC3F;AASO,SAAS,4BAA4B,MAAwC;AAClF,MAAI,SAAS,UAAW,QAAO,CAAC,OAAO,OAAO,OAAO,OAAO,SAAS,eAAe;AACpF,MAAI,SAAS,OAAQ,QAAO,CAAC,OAAO,OAAO,SAAS,eAAe;AACnE,SAAO,CAAC,SAAS,eAAe;AAClC;AAGO,SAAS,kCAAkC,MAAsC;AACtF,SAAO,4BAA4B,IAAI,EAAE,CAAC,KAAK;AACjD;AAsHO,SAAS,sBAA8B;AAC5C,SAAO,SAAS,KAAK,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,OAAO,GAAG,CAAC,CAAC;AACvE;AAGO,SAAS,0BAA0B,OAAuB;AAC/D,SAAO,OAAO,KAAK;AACrB;",
+  "names": []
+}

package/dist/backend/dynamic-table/types/import.js

@@ -0,0 +1,7 @@
+const IMPORT_MAX_ROWS = 1e3;
+const IMPORT_MAX_FILE_BYTES = 10 * 1024 * 1024;
+export {
+  IMPORT_MAX_FILE_BYTES,
+  IMPORT_MAX_ROWS
+};
+//# sourceMappingURL=import.js.map

package/dist/backend/dynamic-table/types/import.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/backend/dynamic-table/types/import.ts"],
+  "sourcesContent": ["/**\n * Wire types for the reversible file-import pipeline (Spec 3, Phases 1-3).\n *\n * This module is deliberately **dependency-free** \u2014 no `xlsx`, no React, no\n * server APIs \u2014 so both the browser panel (`components/ImportPanel.tsx`) and\n * the server parser (`utils/importParse.ts`) can share one vocabulary without\n * the client ever pulling the spreadsheet reader into its bundle.\n *\n * The parse itself is SERVER-SIDE ONLY. A client+server double parse is\n * exactly how a preview and its commit drift apart, so the browser never sees\n * a workbook \u2014 it uploads bytes and renders whatever the server made of them.\n */\n\n/** Hard caps enforced BEFORE parsing (see spec A6 / \"Memory blow-up\" risk). */\nexport const IMPORT_MAX_ROWS = 1000;\nexport const IMPORT_MAX_FILE_BYTES = 10 * 1024 * 1024;\n\n/** v1 import modes. `upsert_key` is per-module opt-in and not offered here. */\nexport type ImportMode = 'create' | 'upsert_id';\n\n/** What a preview decided to do with one source row. */\nexport type ImportRowAction = 'created' | 'updated' | 'skipped' | 'failed';\n\n/**\n * One importable target field, declared by the adopting module.\n *\n * `labels` carries EVERY header spelling that should auto-map onto this field:\n * the export's own column title (per locale), the field key, and any legacy\n * spelling. Round-tripping an export must need zero manual mapping, and the\n * export header is locale-dependent, so a single label is not enough.\n */\nexport interface ImportFieldDef {\n  /** Target field key on the module's create/update input. */\n  field: string;\n  /** Primary human label, shown in the mapping UI. */\n  label: string;\n  /** Additional accepted header spellings (locales, snake_case, aliases). */\n  labels?: string[];\n  type?: 'text' | 'numeric' | 'date' | 'boolean';\n  /** Required for a `create`; a blank value fails the row. */\n  required?: boolean;\n  /**\n   * True when the field points at another record. Relation fields are REFUSED\n   * on the generic path rather than silently mis-resolved (spec A1): a header\n   * mapping onto one produces `relation_unsupported`, never a lookup guess.\n   */\n  relation?: boolean;\n  /** Marks the field used to match an existing record in `upsert_id` mode. */\n  matchKey?: boolean;\n}\n\n/** File header \u2192 target field key. Headers absent from the map are ignored. */\nexport type ImportMapping = Record<string, string>;\n\nexport type ImportMappingIssueCode =\n  | 'relation_unsupported'\n  | 'unknown_field'\n  | 'duplicate_field'\n  | 'missing_required';\n\nexport interface ImportMappingIssue {\n  code: ImportMappingIssueCode;\n  /** The file header at fault, when the issue is header-shaped. */\n  header?: string;\n  /** The target field at fault, when the issue is field-shaped. */\n  field?: string;\n  /** Human label for whichever of the two the message should name. */\n  label: string;\n}\n\n/** A per-cell validation failure on a previewed row. */\nexport interface ImportCellError {\n  field: string;\n  message: string;\n}\n\n/** One row of the dry-run preview. Nothing here has been written. */\nexport interface ImportPreviewRow {\n  /** 1-based data row in the uploaded file (header row excluded). */\n  sourceRowNumber: number;\n  action: ImportRowAction;\n  /** Mapped + coerced values, keyed by target field. */\n  values: Record<string, unknown>;\n  /** Existing record this row would update (`upsert_id` only). */\n  recordId: string | null;\n  errors: ImportCellError[];\n}\n\nexport interface ImportSummary {\n  created: number;\n  updated: number;\n  skipped: number;\n  failed: number;\n}\n\n/** `POST \u2026/import/preview` response. */\nexport interface ImportPreviewResponse {\n  importBatchId: string;\n  mode: ImportMode;\n  sourceFileName: string;\n  /** The mapping actually applied \u2014 echoed so the panel can show + edit it. */\n  mapping: ImportMapping;\n  /** Headers found in the file, in file order. */\n  headers: string[];\n  /** Target fields the module accepts, for the mapping UI. */\n  fields: ImportFieldDef[];\n  mappingIssues: ImportMappingIssue[];\n  rows: ImportPreviewRow[];\n  summary: ImportSummary;\n}\n\n/** `POST \u2026/import/:id/commit` response. */\nexport interface ImportCommitResponse {\n  importBatchId: string;\n  created: number;\n  updated: number;\n  failed: number;\n  rows: Array<{\n    sourceRowNumber: number;\n    action: ImportRowAction;\n    recordId: string | null;\n    errorMessage: string | null;\n  }>;\n}\n\n/** `POST \u2026/import/:id/revert` response. */\nexport interface ImportRevertResponse {\n  importBatchId: string;\n  restored: number;\n  deleted: number;\n  refused: Array<{ sourceRowNumber: number; reason: string }>;\n}\n"],
+  "mappings": "AAcO,MAAM,kBAAkB;AACxB,MAAM,wBAAwB,KAAK,OAAO;",
+  "names": []
+}

package/dist/backend/dynamic-table/types/index.js

@@ -0,0 +1,46 @@
+import {
+  CELL_BATCH_SAVE_EVENT,
+  CELL_BATCH_SAVE_RESULT_EVENT
+} from "../handlers/cellWrites.js";
+const TableEvents = {
+  CELL_EDIT_SAVE: "table:cell:edit:save",
+  CELL_SAVE_START: "table:cell:save:start",
+  CELL_SAVE_SUCCESS: "table:cell:save:success",
+  CELL_SAVE_ERROR: "table:cell:save:error",
+  /** One multi-cell write (paste / cut / clear / fill / replace / import). */
+  CELL_BATCH_SAVE: CELL_BATCH_SAVE_EVENT,
+  /** The applied/rejected tally for that same write. */
+  CELL_BATCH_SAVE_RESULT: CELL_BATCH_SAVE_RESULT_EVENT,
+  NEW_ROW_SAVE: "table:new:row:save",
+  NEW_ROW_SAVE_START: "table:new:row:save:start",
+  NEW_ROW_SAVE_SUCCESS: "table:new:row:save:success",
+  NEW_ROW_SAVE_ERROR: "table:new:row:save:error",
+  FILTER_CHANGE: "table:filter:change",
+  FILTER_SAVE: "table:filter:save",
+  FILTER_SELECT: "table:filter:select",
+  FILTER_RENAME: "table:filter:rename",
+  FILTER_DELETE: "table:filter:delete",
+  COLUMN_SORT: "table:column:sort",
+  SEARCH: "table:search",
+  COLUMN_CONTEXT_MENU_ACTION: "table:column:context:action",
+  ROW_CONTEXT_MENU_ACTION: "table:row:context:action",
+  CELL_CONTEXT_MENU_ACTION: "table:cell:context:action",
+  // Perspective events
+  PERSPECTIVE_SAVE: "table:perspective:save",
+  PERSPECTIVE_SELECT: "table:perspective:select",
+  PERSPECTIVE_RENAME: "table:perspective:rename",
+  PERSPECTIVE_DELETE: "table:perspective:delete",
+  PERSPECTIVE_CHANGE: "table:perspective:change",
+  PERSPECTIVE_DUPLICATE: "table:perspective:duplicate",
+  PERSPECTIVE_SET_DEFAULT: "table:perspective:setDefault",
+  PERSPECTIVE_PUBLISH: "table:perspective:publish",
+  PERSPECTIVE_TEMPLATE_COPY: "table:perspective:templateCopy"
+};
+export * from "./filters.js";
+export * from "./perspective.js";
+export * from "./grouping.js";
+export * from "./rollup.js";
+export {
+  TableEvents
+};
+//# sourceMappingURL=index.js.map