@anzusystems/common-admin 2.0.0-rc.5 → 2.0.0-rc.7

package/dist/domains/listEditor/composables/useListEditorController.js.map

@@ -1 +1 @@
-{"version":3,"file":"useListEditorController.js","names":["useListEditorController","keyField","options","keyOf","item","positionOpt","managedPosition","positionField","positionMultiplier","positionStrategy","positionOverrides","items","computed","dirtyExclude","toValue","stripTempIds","_k","v","normalize","copy","f","baselineHashes","ref","baselineRows","captureBaseline","map","r","rows","cloneDeep","seeded","changed","nextListEditorTempId","movedKeys","deletedRows","submitted","registeredValidity","reactive","isItemDirty","saved","key","baseHash","addedBaseline","editedKeys","live","base","stale","isRowEdited","unsavedKeys","out","isUnsaved","hasUnsaved","unsavedCount","keys","resolveValidity","registered","invalidKeys","hasErrors","rowState","invalid","editing","warning","validateAll","renumber","action","preservePositionValues","arr","renumberPositions","write","getPayload","getChanges","added","updated","moved","commit","source","savedItems","next","reset","indexOfKey","x","row","at","hint","i","current","removed","opts","hashes","fromIndex","toIndex","el","isValid"],"sources":["../../../../src/domains/listEditor/composables/useListEditorController.ts"],"sourcesContent":["import {\n  computed,\n  reactive,\n  ref,\n  toValue,\n  watch,\n  type ComputedRef,\n  type MaybeRefOrGetter,\n  type Ref,\n  type ShallowUnwrapRef,\n} from 'vue'\nimport type { ListEditorKey, ListEditorValidationState, PositionHint } from '@/domains/listEditor/types/listEditorTypes'\nimport { preservePositionValues, renumberPositions } from '@/domains/listEditor/utils/positions'\nimport { nextListEditorTempId } from '@/domains/listEditor/utils/tempId'\nimport { cloneDeep } from '@/shared/utils/common'\n\n/** Per-row validity. `true` (or `{ valid: true }`) = VALID. Only `valid: false` blocks save. */\nexport type ListEditorValidationResult = boolean | { valid: boolean; state?: 'invalid' | 'warning'; message?: string }\n\nexport type GetKey<TItem> = keyof TItem | ((item: TItem) => ListEditorKey)\n/**\n * How the managed order field is maintained.\n * - `renumber` (default) — positions are opaque ordinals: every write rewrites them to a clean\n *   `(index + 1) * multiplier` series.\n * - `preserve-values` — positions are meaningful ABSOLUTE numbers (e.g. a CMS page interleaves its\n *   rows with another collection on the same numeric scale, so rewriting 10/310 to 100/200 would\n *   move unrelated items). A REORDER then only swaps rows through the EXISTING slots: the set of\n *   values is kept and reassigned, ascending, to the new row order. It is a reorder policy, not a\n *   normalization policy — `add` keeps the position the factory/consumer supplied, `delete` leaves\n *   holes rather than compacting.\n *\n * Per-action exceptions go through `strategyOverrides` (e.g. base `preserve-values` +\n * `{ remove: 'renumber' }` to keep absolute values on reorder/save but still close the gap on delete).\n */\nexport type PositionStrategy = 'renumber' | 'preserve-values'\n\n/** Which mutation is asking for positions to be (re)assigned. */\nexport type PositionAction = 'add' | 'update' | 'remove' | 'move' | 'payload'\n\nexport type PositionOption<TItem> =\n  | false\n  | keyof TItem\n  | {\n      field: keyof TItem\n      multiplier?: number\n      strategy?: PositionStrategy\n      /**\n       * Per-action override of `strategy`. Each entry replaces the base strategy for that one\n       * action only; omitted actions inherit `strategy`. This is what lets a consumer mix policies\n       * without a bespoke preset — the behaviour is visible at the call site, one action per key.\n       */\n      strategyOverrides?: Partial<Record<PositionAction, PositionStrategy>>\n    }\n\nexport interface ListEditorChanges<TItem> {\n  added: TItem[]\n  updated: TItem[]\n  moved: TItem[]\n  deleted: TItem[]\n  reparented: TItem[]\n}\n\nexport interface UseListEditorControllerOptions<TItem extends Record<string, any>> {\n  /** Read the live list (the editor's v-model, or a consumer store getter). */\n  get: () => TItem[]\n  /** Write the list back. */\n  set: (items: TItem[]) => void\n  /** New-row factory. Optional for read-only / no-add lists. Should mint a stable temp id. */\n  factory?: () => TItem\n  /** Stable row identity. Default `'id'`. Never point this at the position field. */\n  getKey?: GetKey<TItem>\n  /** Managed order field. Default `'position'`. `false` opts out of position management. */\n  position?: PositionOption<TItem>\n  /**\n   * Extra top-level fields to drop from the dirty content-hash (position is\n   * always dropped). For a child collection a separate nested editor already\n   * tracks, so editing a child doesn't flip the parent row amber. Still in the\n   * payload — only the dirty comparison ignores it. Reactive (accepts a getter/ref).\n   */\n  dirtyExclude?: MaybeRefOrGetter<string[]>\n  /** Per-row validity — `true` = valid. Drives the red rail + `hasErrors`. */\n  validate?: (item: TItem) => ListEditorValidationResult\n  /** Custom dirty predicate (override the default content-diff). */\n  isDirty?: (current: TItem, saved: TItem | undefined) => boolean\n  /** Custom save payload (overrides `getPayload`). */\n  payload?: (items: TItem[]) => TItem[]\n  /** Resolve a saved row's key on commit (default: existing key, else mint a temp id). */\n  commitKey?: (saved: TItem, previous: TItem | undefined) => ListEditorKey\n  /** Normalize server rows before they become the new baseline on commit. */\n  normalizeSaved?: (savedItems: TItem[]) => TItem[]\n}\n\nexport interface ListEditorHandle<TItem extends Record<string, any>> {\n  items: ComputedRef<TItem[]>\n  hasUnsaved: ComputedRef<boolean>\n  /** Count of distinct unconfirmed changes (added/edited/moved rows + deferred-deletion tombstones). */\n  unsavedCount: ComputedRef<number>\n  hasErrors: ComputedRef<boolean>\n  invalidKeys: ComputedRef<Set<ListEditorKey>>\n  /** Amber: is this row added / edited / moved since the last commit? */\n  isUnsaved: (key: ListEditorKey) => boolean\n  /** Red rail (gated): 'invalid' only once the row is unsaved or `validateAll()` ran. */\n  rowState: (item: TItem, key: ListEditorKey, editing?: boolean) => ListEditorValidationState\n  /** Force-show all invalid rows + return whether the list is valid. The save guard. */\n  validateAll: () => boolean\n  /** Normalized ordered array for a full-DTO save. */\n  getPayload: () => TItem[]\n  /** Change-set for partial-save endpoints. */\n  getChanges: () => ListEditorChanges<TItem>\n  /** Adopt saved rows as the new baseline; backfill keys; clear unsaved/submitted. */\n  commit: (savedItems?: TItem[]) => void\n  /** Discard unsaved edits back to the last committed baseline (or given items). */\n  reset: (items?: TItem[]) => void\n  addItem: (item?: TItem, hint?: PositionHint) => ListEditorKey | undefined\n  updateItem: (key: ListEditorKey, next: TItem | Partial<TItem> | ((current: TItem) => TItem)) => void\n  /** Remove a row. `trackDeleted: false` (immediate mode) skips the deferred-deletion tombstone. */\n  deleteItem: (key: ListEditorKey, opts?: { trackDeleted?: boolean }) => void\n  /** Clear a deferred-deletion tombstone (the caller re-inserts the row, e.g. reorder Cancel). */\n  restoreDeleted: (key: ListEditorKey) => void\n  moveItem: (fromIndex: number, toIndex: number) => void\n  /** Drop the \"moved\" flag for the given keys (or all) without touching edits/adds — e.g. reorder Cancel. */\n  clearMoved: (keys?: Iterable<ListEditorKey>) => void\n  /** Escape hatch: a row form (e.g. vuelidate) reports its own validity instead of `validate`. */\n  registerValidity: (key: ListEditorKey, isValid: () => boolean) => () => void\n}\n\n/**\n * The shape a CONSUMER sees when it reads a list-editor handle through a template/function ref.\n * Vue's `expose` proxy unwraps every exposed ref, so the reactive fields (`hasUnsaved`, `hasErrors`,\n * `unsavedCount`, …) arrive as plain VALUES here, not `Ref`s: read `handle.hasUnsaved` (a boolean),\n * never `handle.hasUnsaved.value` (that is `undefined`). Type your `useTemplateRef` / collected-ref\n * maps with this so a stray `.value` is a compile error instead of a silently-dead guard/save-gate.\n */\nexport type ExposedListEditorHandle<TItem extends Record<string, any>> = ShallowUnwrapRef<ListEditorHandle<TItem>>\n\n/**\n * Component-owned state controller for the list editors (v2). Owns row keys,\n * declared dirty tracking (no fragile whole-list JSON diff on volatile fields),\n * validation summary, position renumbering, and the save lifecycle — exposed as\n * a `ListEditorHandle`. Created internally by an editor (default) or by a consumer\n * that passes it in as `:editor`, so the state survives unmount/remount.\n */\nexport function useListEditorController<TItem extends Record<string, any>>(\n  options: UseListEditorControllerOptions<TItem>\n): ListEditorHandle<TItem> {\n  const keyField = (typeof options.getKey === 'function' ? null : (options.getKey ?? 'id')) as keyof TItem | null\n  const keyOf = (item: TItem): ListEditorKey =>\n    typeof options.getKey === 'function' ? options.getKey(item) : (item[keyField as keyof TItem] as ListEditorKey)\n\n  const positionOpt = options.position ?? 'position'\n  const managedPosition = positionOpt !== false\n  const positionField = (\n    typeof positionOpt === 'object' ? positionOpt.field : positionOpt === false ? 'position' : positionOpt\n  ) as string\n  const positionMultiplier = typeof positionOpt === 'object' && positionOpt.multiplier ? positionOpt.multiplier : 1\n  const positionStrategy: PositionStrategy = (typeof positionOpt === 'object' && positionOpt.strategy) || 'renumber'\n  const positionOverrides: Partial<Record<PositionAction, PositionStrategy>> =\n    (typeof positionOpt === 'object' && positionOpt.strategyOverrides) || {}\n\n  const items = computed<TItem[]>(() => options.get())\n\n  // Baseline = last committed snapshot. `hashes` powers content-diff dirty\n  // (position excluded so a reorder never marks a row dirty); `rows` powers `reset`.\n  const dirtyExclude = computed<string[]>(() => toValue(options.dirtyExclude) ?? [])\n  // Temp ids are client identity bookkeeping, never content. `ensureKeys` mints one INTO the model\n  // for rows the server returns without a key — and for a NESTED editor that write happens on mount,\n  // i.e. when a parent row is merely expanded to be read. The parent hashes the whole row, so without\n  // this the seed would retroactively invalidate the parent's baseline and expanding a row to LOOK at\n  // it would mark it unsaved (QA 85050 batch 10 BUG-02). Only negative NUMBERS are stripped —\n  // persisted ids are positive (see `nextListEditorTempId`), so real ids still count as content, and\n  // a genuinely added row still differs by its other fields.\n  const stripTempIds = (_k: string, v: unknown): unknown =>\n    _k === 'id' && typeof v === 'number' && v < 0 ? undefined : v\n  const normalize = (item: TItem): string => {\n    const copy = { ...item } as Record<string, unknown>\n    if (managedPosition) delete copy[positionField]\n    for (const f of dirtyExclude.value) delete copy[f]\n    return JSON.stringify(copy, stripTempIds)\n  }\n  const baselineHashes = ref(new Map<ListEditorKey, string>()) as Ref<Map<ListEditorKey, string>>\n  const baselineRows = ref<TItem[]>([]) as Ref<TItem[]>\n  const captureBaseline = (rows: TItem[]) => {\n    const map = new Map<ListEditorKey, string>()\n    for (const r of rows) map.set(keyOf(r), normalize(r))\n    baselineHashes.value = map\n    // Deep clone: a shallow `{...r}` shares nested refs with the live row, so an\n    // in-place mutation would drift the baseline (reset/re-hash read stale data).\n    baselineRows.value = rows.map((r) => cloneDeep(r))\n  }\n  // Re-hash when the excluded-field set changes. `sync` so baseline + live\n  // normalize() never disagree mid-flush (which would flash every row amber).\n  watch(\n    dirtyExclude,\n    () => {\n      const map = new Map<ListEditorKey, string>()\n      for (const r of baselineRows.value) map.set(keyOf(r), normalize(r))\n      baselineHashes.value = map\n    },\n    { flush: 'sync' }\n  )\n  // Ensure every row has a resolvable, UNIQUE key before the first baseline\n  // capture. Server rows lacking the key field (e.g. no `id` and no custom\n  // get-key → keyOf() is undefined for ALL of them) would collapse to a single\n  // baseline entry and read as perpetually unsaved even on a clean load\n  // (QA 85050 BUG-03). Mint a temp id for those rows — exactly what commit()\n  // already does on save (line ~299). Rows that DO resolve a key (the common\n  // case) are untouched, so id-backed editors are unaffected.\n  const ensureKeys = (rows: TItem[]): { rows: TItem[]; changed: boolean } => {\n    if (!keyField) return { rows, changed: false }\n    let changed = false\n    const next = rows.map((item) => {\n      const k = keyOf(item)\n      if (k === undefined || k === null) {\n        changed = true\n        return { ...item, [keyField]: nextListEditorTempId() } as TItem\n      }\n      return item\n    })\n    return { rows: next, changed }\n  }\n  const seeded = ensureKeys(options.get())\n  if (seeded.changed) options.set(seeded.rows)\n  // Capture from the seeded array directly (not a re-read of options.get()): when\n  // set() emits through v-model the prop update is async, so options.get() would\n  // still return the pre-mint colliding rows here. Mirrors commit()'s pattern.\n  captureBaseline(seeded.rows)\n\n  // Declared structural state the content-diff can't see.\n  const movedKeys = ref(new Set<ListEditorKey>()) as Ref<Set<ListEditorKey>>\n  const deletedRows = ref<TItem[]>([]) as Ref<TItem[]>\n  const submitted = ref(false)\n  // Reactive so a row form (re)registering its validity re-runs `invalidKeys`/`rowState`.\n  const registeredValidity = reactive(new Map<ListEditorKey, () => boolean>())\n\n  const isItemDirty = (item: TItem, key: ListEditorKey): boolean => {\n    if (options.isDirty) {\n      const saved = baselineRows.value.find((r) => keyOf(r) === key)\n      return options.isDirty(item, saved)\n    }\n    const baseHash = baselineHashes.value.get(key)\n    if (baseHash === undefined) return true // added\n    if (baseHash !== normalize(item)) return true // edited\n    return movedKeys.value.has(key) // moved (content-invisible)\n  }\n\n  // Gate the validation rail on \"has this row actually been edited\" rather than just \"is it\n  // unsaved\", so a freshly added still-untouched row is amber but not yet red. `addedBaseline` =\n  // first-seen content hash of each ADDED row; `editedKeys` = STICKY set of rows whose content has\n  // since diverged from that first-seen / committed baseline. Sticky like vuelidate `$dirty`: once\n  // edited a row stays dirty until commit/reset, so clearing a field back to empty keeps the rail\n  // consistent with the field's own error state. Position / `dirtyExclude` are normalized out, so a\n  // reorder never counts as an edit.\n  const addedBaseline = ref(new Map<ListEditorKey, string>()) as Ref<Map<ListEditorKey, string>>\n  const editedKeys = ref(new Set<ListEditorKey>()) as Ref<Set<ListEditorKey>>\n  watch(\n    items,\n    (rows) => {\n      const live = new Set<ListEditorKey>()\n      for (const r of rows) {\n        const key = keyOf(r)\n        live.add(key)\n        if (!baselineHashes.value.has(key) && !addedBaseline.value.has(key)) {\n          addedBaseline.value.set(key, normalize(r))\n        }\n        if (!editedKeys.value.has(key)) {\n          const base = baselineHashes.value.get(key) ?? addedBaseline.value.get(key)\n          if (base !== undefined && base !== normalize(r)) editedKeys.value.add(key)\n        }\n      }\n      const stale: ListEditorKey[] = []\n      for (const key of addedBaseline.value.keys()) if (!live.has(key)) stale.push(key)\n      for (const key of stale) addedBaseline.value.delete(key)\n      // A deferred-deleted key that becomes live again (re-add before save) must drop its tombstone —\n      // otherwise it would both render and still count/report as deleted.\n      if (deletedRows.value.some((r) => live.has(keyOf(r)))) {\n        deletedRows.value = deletedRows.value.filter((r) => !live.has(keyOf(r)))\n      }\n    },\n    { immediate: true, deep: true }\n  )\n\n  const isRowEdited = (key: ListEditorKey): boolean => editedKeys.value.has(key)\n\n  const unsavedKeys = computed<Set<ListEditorKey>>(() => {\n    const out = new Set<ListEditorKey>()\n    for (const item of options.get()) {\n      const key = keyOf(item)\n      if (isItemDirty(item, key)) out.add(key)\n    }\n    return out\n  })\n\n  const isUnsaved = (key: ListEditorKey): boolean => unsavedKeys.value.has(key)\n  const hasUnsaved = computed<boolean>(() => unsavedKeys.value.size > 0 || deletedRows.value.length > 0)\n\n  // Count of DISTINCT unconfirmed changes = union of live dirty keys (added / edited / moved) and\n  // deferred-deletion tombstones. A key that is both live and tombstoned (delete-then-re-add) counts\n  // once; a deleted row (no longer live) adds one. Drives the \"N unconfirmed changes\" indicator, so a\n  // delete lights up as a change even though the row itself is gone.\n  const unsavedCount = computed<number>(() => {\n    const keys = new Set<ListEditorKey>(unsavedKeys.value)\n    for (const r of deletedRows.value) keys.add(keyOf(r))\n    return keys.size\n  })\n\n  const resolveValidity = (item: TItem, key: ListEditorKey): { invalid: boolean; warning: boolean } => {\n    const registered = registeredValidity.get(key)\n    if (registered) return { invalid: !registered(), warning: false }\n    if (!options.validate) return { invalid: false, warning: false }\n    const r = options.validate(item)\n    if (typeof r === 'boolean') return { invalid: !r, warning: false }\n    return { invalid: !r.valid, warning: r.valid && r.state === 'warning' }\n  }\n\n  const invalidKeys = computed<Set<ListEditorKey>>(() => {\n    const out = new Set<ListEditorKey>()\n    for (const item of options.get()) {\n      const key = keyOf(item)\n      if (resolveValidity(item, key).invalid) out.add(key)\n    }\n    return out\n  })\n  const hasErrors = computed<boolean>(() => invalidKeys.value.size > 0)\n\n  // Red rail gated behind \"row has been edited\" (content changed since add/baseline — mirrors the\n  // field's vuelidate `$dirty`) or an explicit validateAll() — so a freshly added still-untouched\n  // row stays amber (not red) and a loaded-but-invalid row doesn't light up before interaction,\n  // while a save attempt reveals every offender (mounted or collapsed).\n  const rowState = (item: TItem, key: ListEditorKey, editing = false): ListEditorValidationState => {\n    const { invalid, warning } = resolveValidity(item, key)\n    // Red rail for an invalid row that is edited, unsaved (added), or after a save attempt. A row being\n    // filled in reads amber (not red) and goes red once collapsed — but a save attempt (`submitted`,\n    // which also reveals collapsed offenders) always reds it, even while open. (QA 85050 batch 7)\n    if (invalid) {\n      if (submitted.value) return 'invalid'\n      if (editing) return null\n      return isRowEdited(key) || isUnsaved(key) ? 'invalid' : null\n    }\n    if (warning) return 'warning'\n    return null\n  }\n\n  const validateAll = (): boolean => {\n    submitted.value = true\n    return invalidKeys.value.size === 0\n  }\n\n  // Resolve the policy for THIS action: a per-action override wins, else the base strategy.\n  // Under 'preserve-values' only a move reassigns (through the existing kept slots); every other\n  // action leaves positions as-is (add keeps the handed value, delete leaves a hole, update/payload\n  // never touch them). Under 'renumber' every action rewrites to a clean `(index+1)*multiplier`.\n  const renumber = (arr: TItem[], action: PositionAction): TItem[] => {\n    if (!managedPosition) return arr\n    const strategy = positionOverrides[action] ?? positionStrategy\n    if (strategy === 'preserve-values') {\n      return action === 'move' ? preservePositionValues(arr, { positionField }) : arr\n    }\n    return renumberPositions(arr, { positionField, positionMultiplier })\n  }\n\n  const write = (arr: TItem[], action: PositionAction) => options.set(renumber(arr, action))\n\n  const getPayload = (): TItem[] =>\n    options.payload ? options.payload(options.get()) : renumber(options.get(), 'payload')\n\n  const getChanges = (): ListEditorChanges<TItem> => {\n    const added: TItem[] = []\n    const updated: TItem[] = []\n    const moved: TItem[] = []\n    for (const item of options.get()) {\n      const key = keyOf(item)\n      const baseHash = baselineHashes.value.get(key)\n      if (baseHash === undefined) added.push(item)\n      else if (baseHash !== normalize(item)) updated.push(item)\n      if (movedKeys.value.has(key)) moved.push(item)\n    }\n    return { added, updated, moved, deleted: [...deletedRows.value], reparented: [] }\n  }\n\n  const commit = (savedItems?: TItem[]): void => {\n    const source = savedItems ?? options.get()\n    const normalized = options.normalizeSaved ? options.normalizeSaved(source) : source\n    const next = normalized.map((item) => {\n      const key = options.commitKey\n        ? options.commitKey(\n            item,\n            baselineRows.value.find((r) => keyOf(r) === keyOf(item))\n          )\n        : keyOf(item)\n      if (key === undefined || key === null) {\n        return keyField ? ({ ...item, [keyField]: nextListEditorTempId() } as TItem) : item\n      }\n      return item\n    })\n    options.set(next)\n    captureBaseline(next)\n    movedKeys.value = new Set()\n    deletedRows.value = []\n    addedBaseline.value = new Map()\n    editedKeys.value = new Set()\n    submitted.value = false\n  }\n\n  const reset = (rows?: TItem[]): void => {\n    options.set(rows ?? baselineRows.value.map((r) => cloneDeep(r)))\n    movedKeys.value = new Set()\n    deletedRows.value = []\n    addedBaseline.value = new Map()\n    editedKeys.value = new Set()\n    submitted.value = false\n  }\n\n  const indexOfKey = (arr: TItem[], key: ListEditorKey): number => arr.findIndex((x) => keyOf(x) === key)\n\n  const addItem = (item?: TItem, hint?: PositionHint): ListEditorKey | undefined => {\n    const row = item ?? options.factory?.()\n    if (row === undefined) return undefined // no item + no factory (read-only list) → no-op\n    const arr = [...options.get()]\n    let at = arr.length\n    if (hint?.afterId !== undefined) {\n      const i = indexOfKey(arr, hint.afterId)\n      at = i === -1 ? arr.length : i + 1\n    } else if (hint?.index !== undefined) {\n      at = Math.max(0, Math.min(hint.index, arr.length))\n    }\n    arr.splice(at, 0, row)\n    write(arr, 'add')\n    return keyOf(row)\n  }\n\n  const updateItem = (key: ListEditorKey, next: TItem | Partial<TItem> | ((current: TItem) => TItem)): void => {\n    const arr = [...options.get()]\n    const i = indexOfKey(arr, key)\n    if (i === -1) return\n    const current = arr[i]!\n    const resolved =\n      typeof next === 'function'\n        ? (next as (c: TItem) => TItem)(current)\n        : ({ ...current, ...(next as Partial<TItem>) } as TItem)\n    arr[i] = resolved\n    write(arr, 'update')\n  }\n\n  const deleteItem = (key: ListEditorKey, opts?: { trackDeleted?: boolean }): void => {\n    const arr = [...options.get()]\n    const i = indexOfKey(arr, key)\n    if (i === -1) return\n    const removed = arr.splice(i, 1)[0]!\n    // A previously-saved row that's removed is a DEFERRED deletion: reported in the change-set and\n    // counted as one unconfirmed change (`unsavedCount`) until save. `trackDeleted: false` (immediate\n    // mode — the row is already deleted on the backend) skips the tombstone so it does NOT read as\n    // unsaved. An unsaved temp row just vanishes either way.\n    if (baselineHashes.value.has(key) && opts?.trackDeleted !== false) {\n      deletedRows.value = [...deletedRows.value, removed]\n    } else if (baselineHashes.value.has(key)) {\n      // Deleted on the backend: no longer part of the saved rows `reset()` returns to.\n      const hashes = new Map(baselineHashes.value)\n      hashes.delete(key)\n      baselineHashes.value = hashes\n      baselineRows.value = baselineRows.value.filter((r) => keyOf(r) !== key)\n    }\n    movedKeys.value.delete(key)\n    write(arr, 'remove')\n  }\n\n  // Un-tombstone a deferred-deleted row. Re-inserting the row into the model is the caller's job\n  // (e.g. reorder Cancel restoring the pre-session snapshot); this only clears the deletion record so\n  // `deletedRows` / `unsavedCount` / `getChanges().deleted` stay consistent.\n  const restoreDeleted = (key: ListEditorKey): void => {\n    deletedRows.value = deletedRows.value.filter((r) => keyOf(r) !== key)\n  }\n\n  const moveItem = (fromIndex: number, toIndex: number): void => {\n    const arr = [...options.get()]\n    if (fromIndex < 0 || fromIndex >= arr.length || toIndex < 0 || toIndex >= arr.length) return\n    if (fromIndex === toIndex) return\n    const el = arr.splice(fromIndex, 1)[0]!\n    arr.splice(toIndex, 0, el)\n    movedKeys.value.add(keyOf(el))\n    write(arr, 'move')\n  }\n\n  // Reorder Cancel restores the pre-session order, so the moves are undone — drop\n  // just those keys' \"moved\" flag (edits/adds stay dirty). No arg = clear all.\n  const clearMoved = (keys?: Iterable<ListEditorKey>): void => {\n    if (keys === undefined) {\n      movedKeys.value = new Set()\n      return\n    }\n    const next = new Set(movedKeys.value)\n    for (const key of keys) next.delete(key)\n    movedKeys.value = next\n  }\n\n  const registerValidity = (key: ListEditorKey, isValid: () => boolean): (() => void) => {\n    registeredValidity.set(key, isValid)\n    return () => registeredValidity.delete(key)\n  }\n\n  return {\n    items,\n    hasUnsaved,\n    unsavedCount,\n    hasErrors,\n    invalidKeys,\n    isUnsaved,\n    rowState,\n    validateAll,\n    getPayload,\n    getChanges,\n    commit,\n    reset,\n    addItem,\n    updateItem,\n    deleteItem,\n    restoreDeleted,\n    moveItem,\n    clearMoved,\n    registerValidity,\n  }\n}\n"],"mappings":";;;;;AA8IA,SAAgBA,EACd,GACyB;CACzB,IAAMC,IAAY,OAAOC,EAAQ,UAAW,aAAa,OAAQA,EAAQ,UAAU,MAC7EC,KAAS,MACb,OAAOD,EAAQ,UAAW,aAAaA,EAAQ,OAAOE,CAAI,IAAKA,EAAKH,IAEhEI,IAAcH,EAAQ,YAAY,YAClCI,IAAkBD,MAAgB,IAClCE,IACJ,OAAOF,KAAgB,WAAWA,EAAY,QAAQA,MAAgB,KAAQ,aAAaA,GAEvFG,IAAqB,OAAOH,KAAgB,YAAYA,EAAY,aAAaA,EAAY,aAAa,GAC1GI,IAAsC,OAAOJ,KAAgB,YAAYA,EAAY,YAAa,YAClGK,IACH,OAAOL,KAAgB,YAAYA,EAAY,qBAAsB,CAAC,GAEnEM,IAAQC,QAAwBV,EAAQ,IAAI,CAAC,GAI7CW,IAAeD,QAAyBE,EAAQZ,EAAQ,YAAY,KAAK,CAAC,CAAC,GAQ3Ea,KAAgB,GAAY,MAChCC,MAAO,QAAQ,OAAOC,KAAM,YAAYA,IAAI,IAAI,KAAA,IAAYA,GACxDC,KAAa,MAAwB;EACzC,IAAMC,IAAO,EAAE,GAAGf,EAAK;EACvB,AAAIE,KAAiB,OAAOa,EAAKZ;EACjC,KAAK,IAAMa,KAAKP,EAAa,OAAO,OAAOM,EAAKC;EAChD,OAAO,KAAK,UAAUD,GAAMJ,CAAY;CAC1C,GACMM,IAAiBC,kBAAI,IAAI,IAA2B,CAAC,GACrDC,IAAeD,EAAa,CAAC,CAAC,GAC9BE,KAAmB,MAAkB;EACzC,IAAMC,oBAAM,IAAI,IAA2B;EAC3C,KAAK,IAAMC,KAAKC,GAAM,EAAI,IAAIxB,EAAMuB,CAAC,GAAGR,EAAUQ,CAAC,CAAC;EAIpD,AAHA,EAAe,QAAQD,GAGvB,EAAa,QAAQE,EAAK,KAAK,MAAMC,EAAUF,CAAC,CAAC;CACnD;CAGA,EACEb,SACM;EACJ,IAAMY,oBAAM,IAAI,IAA2B;EAC3C,KAAK,IAAMC,KAAKH,EAAa,OAAO,EAAI,IAAIpB,EAAMuB,CAAC,GAAGR,EAAUQ,CAAC,CAAC;EAClE,EAAe,QAAQD;CACzB,GACA,EAAE,OAAO,OAAO,CAClB;CAqBA,IAAMI,MAbc,MAAuD;EACzE,IAAI,CAAC5B,GAAU,OAAO;GAAE;GAAM,SAAS;EAAM;EAC7C,IAAI6B,IAAU;EASd,OAAO;GAAE,MARIH,EAAK,KAAK,MACXxB,EAAMC,CACZ,KAAyB,QAC3B,IAAU,IACH;IAAE,GAAGA;KAAOH,IAAW8B,EAAqB;GAAE,KAEhD3B,CAEM;GAAM;EAAQ;CAC/B,EACe,CAAWF,EAAQ,IAAI,CAAC;CAKvC,AAJI2B,EAAO,WAAS3B,EAAQ,IAAI2B,EAAO,IAAI,GAI3CL,EAAgBK,EAAO,IAAI;CAG3B,IAAMG,IAAYV,kBAAI,IAAI,IAAmB,CAAC,GACxCW,IAAcX,EAAa,CAAC,CAAC,GAC7BY,IAAYZ,EAAI,EAAK,GAErBa,IAAqBC,kBAAS,IAAI,IAAkC,CAAC,GAErEC,KAAe,GAAa,MAAgC;EAChE,IAAInC,EAAQ,SAAS;GACnB,IAAMoC,IAAQf,EAAa,MAAM,MAAM,MAAMpB,EAAMuB,CAAC,MAAMa,CAAG;GAC7D,OAAOrC,EAAQ,QAAQE,GAAMkC,CAAK;EACpC;EACA,IAAME,IAAWnB,EAAe,MAAM,IAAIkB,CAAG;EAG7C,OAFIC,MAAa,KAAA,KACbA,MAAatB,EAAUd,CAAI,KACxB4B,EAAU,MAAM,IAAIO,CAAG;CAChC,GASME,IAAgBnB,kBAAI,IAAI,IAA2B,CAAC,GACpDoB,IAAapB,kBAAI,IAAI,IAAmB,CAAC;CAC/C,EACEX,IACC,MAAS;EACR,IAAMgC,oBAAO,IAAI,IAAmB;EACpC,KAAK,IAAMjB,KAAKC,GAAM;GACpB,IAAMY,IAAMpC,EAAMuB,CAAC;GAKnB,IAJAiB,EAAK,IAAIJ,CAAG,GACR,CAAClB,EAAe,MAAM,IAAIkB,CAAG,KAAK,CAACE,EAAc,MAAM,IAAIF,CAAG,KAChEE,EAAc,MAAM,IAAIF,GAAKrB,EAAUQ,CAAC,CAAC,GAEvC,CAACgB,EAAW,MAAM,IAAIH,CAAG,GAAG;IAC9B,IAAMK,IAAOvB,EAAe,MAAM,IAAIkB,CAAG,KAAKE,EAAc,MAAM,IAAIF,CAAG;IACzE,AAAIK,MAAS,KAAA,KAAaA,MAAS1B,EAAUQ,CAAC,KAAGgB,EAAW,MAAM,IAAIH,CAAG;GAC3E;EACF;EACA,IAAMM,IAAyB,CAAC;EAChC,KAAK,IAAMN,KAAOE,EAAc,MAAM,KAAK,GAAG,AAAKE,EAAK,IAAIJ,CAAG,KAAGM,EAAM,KAAKN,CAAG;EAChF,KAAK,IAAMA,KAAOM,GAAO,EAAc,MAAM,OAAON,CAAG;EAGvD,AAAIN,EAAY,MAAM,MAAM,MAAMU,EAAK,IAAIxC,EAAMuB,CAAC,CAAC,CAAC,MAClD,EAAY,QAAQO,EAAY,MAAM,QAAQ,MAAM,CAACU,EAAK,IAAIxC,EAAMuB,CAAC,CAAC,CAAC;CAE3E,GACA;EAAE,WAAW;EAAM,MAAM;CAAK,CAChC;CAEA,IAAMoB,KAAe,MAAgCJ,EAAW,MAAM,IAAIH,CAAG,GAEvEQ,IAAcnC,QAAmC;EACrD,IAAMoC,oBAAM,IAAI,IAAmB;EACnC,KAAK,IAAM5C,KAAQF,EAAQ,IAAI,GAAG;GAChC,IAAMqC,IAAMpC,EAAMC,CAAI;GACtB,AAAIiC,EAAYjC,GAAMmC,CAAG,KAAGS,EAAI,IAAIT,CAAG;EACzC;EACA,OAAOS;CACT,CAAC,GAEKC,KAAa,MAAgCF,EAAY,MAAM,IAAIR,CAAG,GACtEW,IAAatC,QAAwBmC,EAAY,MAAM,OAAO,KAAKd,EAAY,MAAM,SAAS,CAAC,GAM/FkB,IAAevC,QAAuB;EAC1C,IAAMwC,IAAO,IAAI,IAAmBL,EAAY,KAAK;EACrD,KAAK,IAAMrB,KAAKO,EAAY,OAAO,EAAK,IAAI9B,EAAMuB,CAAC,CAAC;EACpD,OAAO0B,EAAK;CACd,CAAC,GAEKC,KAAmB,GAAa,MAA+D;EACnG,IAAMC,IAAanB,EAAmB,IAAII,CAAG;EAC7C,IAAIe,GAAY,OAAO;GAAE,SAAS,CAACA,EAAW;GAAG,SAAS;EAAM;EAChE,IAAI,CAACpD,EAAQ,UAAU,OAAO;GAAE,SAAS;GAAO,SAAS;EAAM;EAC/D,IAAM,IAAIA,EAAQ,SAASE,CAAI;EAE/B,OADI,OAAO,KAAM,YAAkB;GAAE,SAAS,CAAC;GAAG,SAAS;EAAM,IAC1D;GAAE,SAAS,CAAC,EAAE;GAAO,SAAS,EAAE,SAAS,EAAE,UAAU;EAAU;CACxE,GAEMmD,IAAc3C,QAAmC;EACrD,IAAMoC,oBAAM,IAAI,IAAmB;EACnC,KAAK,IAAM5C,KAAQF,EAAQ,IAAI,GAAG;GAChC,IAAMqC,IAAMpC,EAAMC,CAAI;GACtB,AAAIiD,EAAgBjD,GAAMmC,CAAG,CAAC,CAAC,WAASS,EAAI,IAAIT,CAAG;EACrD;EACA,OAAOS;CACT,CAAC,GACKQ,IAAY5C,QAAwB2C,EAAY,MAAM,OAAO,CAAC,GAM9DE,KAAY,GAAa,GAAoB,IAAU,OAAqC;EAChG,IAAM,EAAE,YAAS,eAAYJ,EAAgBjD,GAAMmC,CAAG;EAUtD,OANImB,IACExB,EAAU,QAAc,YACxByB,IAAgB,OACbb,EAAYP,CAAG,KAAKU,EAAUV,CAAG,IAAI,YAAY,OAEtDqB,IAAgB,YACb;CACT,GAEMC,WACJ,EAAU,QAAQ,IACXN,EAAY,MAAM,SAAS,IAO9BO,KAAY,GAAc,MACzBxD,KACYI,EAAkBqD,MAAWtD,OAC7B,oBACRsD,MAAW,SAASC,EAAuBC,GAAK,EAAE,iBAAc,CAAC,IAAIA,IAEvEC,EAAkBD,GAAK;EAAE;EAAe;CAAmB,CAAC,IALtCA,GAQzBE,KAAS,GAAc,MAA2BjE,EAAQ,IAAI4D,EAASG,GAAKF,CAAM,CAAC,GAEnFK,UACJlE,EAAQ,UAAUA,EAAQ,QAAQA,EAAQ,IAAI,CAAC,IAAI4D,EAAS5D,EAAQ,IAAI,GAAG,SAAS,GAEhFmE,UAA6C;EACjD,IAAMC,IAAiB,CAAC,GAClBC,IAAmB,CAAC,GACpBC,IAAiB,CAAC;EACxB,KAAK,IAAMpE,KAAQF,EAAQ,IAAI,GAAG;GAChC,IAAMqC,IAAMpC,EAAMC,CAAI,GAChBoC,IAAWnB,EAAe,MAAM,IAAIkB,CAAG;GAG7C,AAFIC,MAAa,KAAA,IAAW8B,EAAM,KAAKlE,CAAI,IAClCoC,MAAatB,EAAUd,CAAI,KAAGmE,EAAQ,KAAKnE,CAAI,GACpD4B,EAAU,MAAM,IAAIO,CAAG,KAAGiC,EAAM,KAAKpE,CAAI;EAC/C;EACA,OAAO;GAAE;GAAO;GAAS;GAAO,SAAS,CAAC,GAAG6B,EAAY,KAAK;GAAG,YAAY,CAAC;EAAE;CAClF,GAEMwC,KAAU,MAA+B;EAC7C,IAAMC,IAASC,KAAczE,EAAQ,IAAI,GAEnC0E,KADa1E,EAAQ,iBAAiBA,EAAQ,eAAewE,CAAM,IAAIA,EAAA,CACrD,KAAK,OACfxE,EAAQ,YAChBA,EAAQ,UACNE,GACAmB,EAAa,MAAM,MAAM,MAAMpB,EAAMuB,CAAC,MAAMvB,EAAMC,CAAI,CAAC,CACzD,IACAD,EAAMC,CAAI,MACmB,QACxBH,IAAY;GAAE,GAAGG;IAAOH,IAAW8B,EAAqB;EAAE,IAE5D3B,CACR;EAOD,AANAF,EAAQ,IAAI0E,CAAI,GAChBpD,EAAgBoD,CAAI,GACpB,EAAU,wBAAQ,IAAI,IAAI,GAC1B,EAAY,QAAQ,CAAC,GACrB,EAAc,wBAAQ,IAAI,IAAI,GAC9B,EAAW,wBAAQ,IAAI,IAAI,GAC3B,EAAU,QAAQ;CACpB,GAEMC,KAAS,MAAyB;EAMtC,AALA3E,EAAQ,IAAIyB,KAAQJ,EAAa,MAAM,KAAK,MAAMK,EAAUF,CAAC,CAAC,CAAC,GAC/D,EAAU,wBAAQ,IAAI,IAAI,GAC1B,EAAY,QAAQ,CAAC,GACrB,EAAc,wBAAQ,IAAI,IAAI,GAC9B,EAAW,wBAAQ,IAAI,IAAI,GAC3B,EAAU,QAAQ;CACpB,GAEMoD,KAAc,GAAc,MAA+Bb,EAAI,WAAW,MAAM9D,EAAM4E,CAAC,MAAMxC,CAAG;CAuFtG,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,UAlGe,GAAc,MAAmD;GAChF,IAAMyC,IAAM5E,KAAQF,EAAQ,UAAU;GACtC,IAAI8E,MAAQ,KAAA,GAAW;GACvB,IAAMf,IAAM,CAAC,GAAG/D,EAAQ,IAAI,CAAC,GACzB+E,IAAKhB,EAAI;GACb,IAAIiB,GAAM,YAAY,KAAA,GAAW;IAC/B,IAAMC,IAAIL,EAAWb,GAAKiB,EAAK,OAAO;IACtC,IAAKC,MAAM,KAAKlB,EAAI,SAASkB,IAAI;GACnC,OAAO,AAAID,GAAM,UAAU,KAAA,MACzB,IAAK,KAAK,IAAI,GAAG,KAAK,IAAIA,EAAK,OAAOjB,EAAI,MAAM,CAAC;GAInD,OAFAA,EAAI,OAAOgB,GAAI,GAAGD,CAAG,GACrBb,EAAMF,GAAK,KAAK,GACT9D,EAAM6E,CAAG;EAClB;EAqFE,aAnFkB,GAAoB,MAAqE;GAC3G,IAAMf,IAAM,CAAC,GAAG/D,EAAQ,IAAI,CAAC,GACvBiF,IAAIL,EAAWb,GAAK1B,CAAG;GAC7B,IAAI4C,MAAM,IAAI;GACd,IAAMC,IAAUnB,EAAIkB;GAMpB,AADA,EAAIA,KAHF,OAAOP,KAAS,aACXA,EAA6BQ,CAAO,IACpC;IAAE,GAAGA;IAAS,GAAIR;GAAwB,GAEjDT,EAAMF,GAAK,QAAQ;EACrB;EAyEE,aAvEkB,GAAoB,MAA4C;GAClF,IAAMA,IAAM,CAAC,GAAG/D,EAAQ,IAAI,CAAC,GACvBiF,IAAIL,EAAWb,GAAK1B,CAAG;GAC7B,IAAI4C,MAAM,IAAI;GACd,IAAME,IAAUpB,EAAI,OAAOkB,GAAG,CAAC,CAAC,CAAC;GAKjC,IAAI9D,EAAe,MAAM,IAAIkB,CAAG,KAAK+C,GAAM,iBAAiB,IAC1D,EAAY,QAAQ,CAAC,GAAGrD,EAAY,OAAOoD,CAAO;QAC7C,IAAIhE,EAAe,MAAM,IAAIkB,CAAG,GAAG;IAExC,IAAMgD,IAAS,IAAI,IAAIlE,EAAe,KAAK;IAG3C,AAFAkE,EAAO,OAAOhD,CAAG,GACjB,EAAe,QAAQgD,GACvB,EAAa,QAAQhE,EAAa,MAAM,QAAQ,MAAMpB,EAAMuB,CAAC,MAAMa,CAAG;GACxE;GAEA,AADAP,EAAU,MAAM,OAAOO,CAAG,GAC1B4B,EAAMF,GAAK,QAAQ;EACrB;EAoDE,iBA/CsB,MAA6B;GACnD,EAAY,QAAQhC,EAAY,MAAM,QAAQ,MAAM9B,EAAMuB,CAAC,MAAMa,CAAG;EACtE;EA8CE,WA5CgB,GAAmB,MAA0B;GAC7D,IAAM0B,IAAM,CAAC,GAAG/D,EAAQ,IAAI,CAAC;GAE7B,IADIsF,IAAY,KAAKA,KAAavB,EAAI,UAAUwB,IAAU,KAAKA,KAAWxB,EAAI,UAC1EuB,MAAcC,GAAS;GAC3B,IAAMC,IAAKzB,EAAI,OAAOuB,GAAW,CAAC,CAAC,CAAC;GAGpC,AAFAvB,EAAI,OAAOwB,GAAS,GAAGC,CAAE,GACzB1D,EAAU,MAAM,IAAI7B,EAAMuF,CAAE,CAAC,GAC7BvB,EAAMF,GAAK,MAAM;EACnB;EAqCE,aAjCkB,MAAyC;GAC3D,IAAIb,MAAS,KAAA,GAAW;IACtB,EAAU,wBAAQ,IAAI,IAAI;IAC1B;GACF;GACA,IAAMwB,IAAO,IAAI,IAAI5C,EAAU,KAAK;GACpC,KAAK,IAAMO,KAAOa,GAAM,EAAK,OAAOb,CAAG;GACvC,EAAU,QAAQqC;EACpB;EA0BE,mBAxBwB,GAAoB,OAC5CzC,EAAmB,IAAII,GAAKoD,CAAO,SACtBxD,EAAmB,OAAOI,CAAG;CAuB5C;AACF"}
+{"version":3,"file":"useListEditorController.js","names":["useListEditorController","keyField","options","keyOf","item","positionOpt","managedPosition","positionField","positionMultiplier","positionStrategy","positionOverrides","items","computed","dirtyExclude","toValue","stripTempIds","_k","v","normalize","copy","f","baselineHashes","ref","baselineRows","captureBaseline","map","r","rows","cloneDeep","seeded","changed","nextListEditorTempId","movedKeys","deletedRows","submitted","registeredValidity","reactive","isItemDirty","saved","key","baseHash","addedBaseline","editedKeys","live","base","stale","isRowEdited","unsavedKeys","out","isUnsaved","hasUnsaved","unsavedCount","keys","resolveValidity","registered","invalidKeys","hasErrors","rowState","invalid","editing","warning","validateAll","renumber","action","preservePositionValues","arr","renumberPositions","write","getPayload","getChanges","added","updated","moved","commit","source","savedItems","next","reset","indexOfKey","x","row","at","hint","i","current","removed","opts","hashes","fromIndex","toIndex","el","isValid"],"sources":["../../../../src/domains/listEditor/composables/useListEditorController.ts"],"sourcesContent":["import {\n  computed,\n  reactive,\n  ref,\n  toValue,\n  watch,\n  type ComputedRef,\n  type MaybeRefOrGetter,\n  type Ref,\n  type ShallowUnwrapRef,\n} from 'vue'\nimport type { ListEditorKey, ListEditorValidationState, PositionHint } from '@/domains/listEditor/types/listEditorTypes'\nimport { preservePositionValues, renumberPositions } from '@/domains/listEditor/utils/positions'\nimport { nextListEditorTempId } from '@/domains/listEditor/utils/tempId'\nimport { cloneDeep } from '@/shared/utils/common'\n\n/** Per-row validity. `true` (or `{ valid: true }`) = VALID. Only `valid: false` blocks save. */\nexport type ListEditorValidationResult = boolean | { valid: boolean; state?: 'invalid' | 'warning'; message?: string }\n\nexport type GetKey<TItem> = keyof TItem | ((item: TItem) => ListEditorKey)\n/**\n * How the managed order field is maintained.\n * - `renumber` (default) — positions are opaque ordinals: every write rewrites them to a clean\n *   `(index + 1) * multiplier` series.\n * - `preserve-values` — positions are meaningful ABSOLUTE numbers (e.g. a CMS page interleaves its\n *   rows with another collection on the same numeric scale, so rewriting 10/310 to 100/200 would\n *   move unrelated items). A REORDER then only swaps rows through the EXISTING slots: the set of\n *   values is kept and reassigned, ascending, to the new row order. It is a reorder policy, not a\n *   normalization policy — `add` keeps the position the factory/consumer supplied, `delete` leaves\n *   holes rather than compacting.\n *\n * Per-action exceptions go through `strategyOverrides` (e.g. base `preserve-values` +\n * `{ remove: 'renumber' }` to keep absolute values on reorder/save but still close the gap on delete).\n */\nexport type PositionStrategy = 'renumber' | 'preserve-values'\n\n/** Which mutation is asking for positions to be (re)assigned. */\nexport type PositionAction = 'add' | 'update' | 'remove' | 'move' | 'payload'\n\nexport type PositionOption<TItem> =\n  | false\n  | keyof TItem\n  | {\n      field: keyof TItem\n      multiplier?: number\n      strategy?: PositionStrategy\n      /**\n       * Per-action override of `strategy`. Each entry replaces the base strategy for that one\n       * action only; omitted actions inherit `strategy`. This is what lets a consumer mix policies\n       * without a bespoke preset — the behaviour is visible at the call site, one action per key.\n       */\n      strategyOverrides?: Partial<Record<PositionAction, PositionStrategy>>\n    }\n\nexport interface ListEditorChanges<TItem> {\n  added: TItem[]\n  updated: TItem[]\n  moved: TItem[]\n  deleted: TItem[]\n  reparented: TItem[]\n}\n\nexport interface UseListEditorControllerOptions<TItem extends Record<string, any>> {\n  /** Read the live list (the editor's v-model, or a consumer store getter). */\n  get: () => TItem[]\n  /** Write the list back. */\n  set: (items: TItem[]) => void\n  /** New-row factory. Optional for read-only / no-add lists. Should mint a stable temp id. */\n  factory?: () => TItem\n  /** Stable row identity. Default `'id'`. Never point this at the position field. */\n  getKey?: GetKey<TItem>\n  /** Managed order field. Default `'position'`. `false` opts out of position management. */\n  position?: PositionOption<TItem>\n  /**\n   * Extra top-level fields to drop from the dirty content-hash (position is\n   * always dropped). For a child collection a separate nested editor already\n   * tracks, so editing a child doesn't flip the parent row amber. Still in the\n   * payload — only the dirty comparison ignores it. Reactive (accepts a getter/ref).\n   */\n  dirtyExclude?: MaybeRefOrGetter<string[]>\n  /** Per-row validity — `true` = valid. Drives the red rail + `hasErrors`. */\n  validate?: (item: TItem) => ListEditorValidationResult\n  /** Custom dirty predicate (override the default content-diff). */\n  isDirty?: (current: TItem, saved: TItem | undefined) => boolean\n  /** Custom save payload (overrides `getPayload`). */\n  payload?: (items: TItem[]) => TItem[]\n  /** Resolve a saved row's key on commit (default: existing key, else mint a temp id). */\n  commitKey?: (saved: TItem, previous: TItem | undefined) => ListEditorKey\n  /** Normalize server rows before they become the new baseline on commit. */\n  normalizeSaved?: (savedItems: TItem[]) => TItem[]\n}\n\nexport interface ListEditorHandle<TItem extends Record<string, any>> {\n  items: ComputedRef<TItem[]>\n  hasUnsaved: ComputedRef<boolean>\n  /** Count of distinct unconfirmed changes (added/edited/moved rows + deferred-deletion tombstones). */\n  unsavedCount: ComputedRef<number>\n  hasErrors: ComputedRef<boolean>\n  invalidKeys: ComputedRef<Set<ListEditorKey>>\n  /** Amber: is this row added / edited / moved since the last commit? */\n  isUnsaved: (key: ListEditorKey) => boolean\n  /** Red rail (gated): 'invalid' only once the row is unsaved or `validateAll()` ran. */\n  rowState: (item: TItem, key: ListEditorKey, editing?: boolean) => ListEditorValidationState\n  /** Force-show all invalid rows + return whether the list is valid. The save guard. */\n  validateAll: () => boolean\n  /** Normalized ordered array for a full-DTO save. */\n  getPayload: () => TItem[]\n  /** Change-set for partial-save endpoints. */\n  getChanges: () => ListEditorChanges<TItem>\n  /** Adopt saved rows as the new baseline; backfill keys; clear unsaved/submitted. */\n  commit: (savedItems?: TItem[]) => void\n  /** Discard unsaved edits back to the last committed baseline (or given items). */\n  reset: (items?: TItem[]) => void\n  addItem: (item?: TItem, hint?: PositionHint) => ListEditorKey | undefined\n  updateItem: (key: ListEditorKey, next: TItem | Partial<TItem> | ((current: TItem) => TItem)) => void\n  /** Remove a row. `trackDeleted: false` (immediate mode) skips the deferred-deletion tombstone. */\n  deleteItem: (key: ListEditorKey, opts?: { trackDeleted?: boolean }) => void\n  /** Clear a deferred-deletion tombstone (the caller re-inserts the row, e.g. reorder Cancel). */\n  restoreDeleted: (key: ListEditorKey) => void\n  moveItem: (fromIndex: number, toIndex: number) => void\n  /** Drop the \"moved\" flag for the given keys (or all) without touching edits/adds — e.g. reorder Cancel. */\n  clearMoved: (keys?: Iterable<ListEditorKey>) => void\n  /** Escape hatch: a row form (e.g. vuelidate) reports its own validity instead of `validate`. */\n  registerValidity: (key: ListEditorKey, isValid: () => boolean) => () => void\n}\n\n/**\n * The shape a CONSUMER sees when it reads a list-editor handle through a template/function ref.\n * Vue's `expose` proxy unwraps every exposed ref, so the reactive fields (`hasUnsaved`, `hasErrors`,\n * `unsavedCount`, …) arrive as plain VALUES here, not `Ref`s: read `handle.hasUnsaved` (a boolean),\n * never `handle.hasUnsaved.value` (that is `undefined`). Type your `useTemplateRef` / collected-ref\n * maps with this so a stray `.value` is a compile error instead of a silently-dead guard/save-gate.\n */\nexport type ExposedListEditorHandle<TItem extends Record<string, any>> = ShallowUnwrapRef<ListEditorHandle<TItem>>\n\n/**\n * State controller for the list editors, exposed as a `ListEditorHandle`. Owns row keys, declared dirty\n * tracking (no whole-list JSON diff), validation summary, position renumbering and the save lifecycle.\n * An editor creates it by default. A consumer can create it and\n * pass it as `:editor` so state survives unmount and remount.\n */\nexport function useListEditorController<TItem extends Record<string, any>>(\n  options: UseListEditorControllerOptions<TItem>\n): ListEditorHandle<TItem> {\n  const keyField = (typeof options.getKey === 'function' ? null : (options.getKey ?? 'id')) as keyof TItem | null\n  const keyOf = (item: TItem): ListEditorKey =>\n    typeof options.getKey === 'function' ? options.getKey(item) : (item[keyField as keyof TItem] as ListEditorKey)\n\n  const positionOpt = options.position ?? 'position'\n  const managedPosition = positionOpt !== false\n  const positionField = (\n    typeof positionOpt === 'object' ? positionOpt.field : positionOpt === false ? 'position' : positionOpt\n  ) as string\n  const positionMultiplier = typeof positionOpt === 'object' && positionOpt.multiplier ? positionOpt.multiplier : 1\n  const positionStrategy: PositionStrategy = (typeof positionOpt === 'object' && positionOpt.strategy) || 'renumber'\n  const positionOverrides: Partial<Record<PositionAction, PositionStrategy>> =\n    (typeof positionOpt === 'object' && positionOpt.strategyOverrides) || {}\n\n  const items = computed<TItem[]>(() => options.get())\n\n  // Baseline = last committed snapshot. `hashes` powers content-diff dirty\n  // (position excluded so a reorder never marks a row dirty); `rows` powers `reset`.\n  const dirtyExclude = computed<string[]>(() => toValue(options.dirtyExclude) ?? [])\n  // Temp ids are client identity bookkeeping, never content. `ensureKeys` mints one INTO the model\n  // for rows the server returns without a key — and for a NESTED editor that write happens on mount,\n  // i.e. when a parent row is merely expanded to be read. The parent hashes the whole row, so without\n  // this the seed would retroactively invalidate the parent's baseline and expanding a row to LOOK at\n  // it would mark it unsaved (QA 85050 batch 10 BUG-02). Only negative NUMBERS are stripped —\n  // persisted ids are positive (see `nextListEditorTempId`), so real ids still count as content, and\n  // a genuinely added row still differs by its other fields.\n  const stripTempIds = (_k: string, v: unknown): unknown =>\n    _k === 'id' && typeof v === 'number' && v < 0 ? undefined : v\n  const normalize = (item: TItem): string => {\n    const copy = { ...item } as Record<string, unknown>\n    if (managedPosition) delete copy[positionField]\n    for (const f of dirtyExclude.value) delete copy[f]\n    return JSON.stringify(copy, stripTempIds)\n  }\n  const baselineHashes = ref(new Map<ListEditorKey, string>()) as Ref<Map<ListEditorKey, string>>\n  const baselineRows = ref<TItem[]>([]) as Ref<TItem[]>\n  const captureBaseline = (rows: TItem[]) => {\n    const map = new Map<ListEditorKey, string>()\n    for (const r of rows) map.set(keyOf(r), normalize(r))\n    baselineHashes.value = map\n    // Deep clone: a shallow `{...r}` shares nested refs with the live row, so an\n    // in-place mutation would drift the baseline (reset/re-hash read stale data).\n    baselineRows.value = rows.map((r) => cloneDeep(r))\n  }\n  // Re-hash when the excluded-field set changes. `sync` so baseline + live\n  // normalize() never disagree mid-flush (which would flash every row amber).\n  watch(\n    dirtyExclude,\n    () => {\n      const map = new Map<ListEditorKey, string>()\n      for (const r of baselineRows.value) map.set(keyOf(r), normalize(r))\n      baselineHashes.value = map\n    },\n    { flush: 'sync' }\n  )\n  // Ensure every row has a resolvable, UNIQUE key before the first baseline\n  // capture. Server rows lacking the key field (e.g. no `id` and no custom\n  // get-key → keyOf() is undefined for ALL of them) would collapse to a single\n  // baseline entry and read as perpetually unsaved even on a clean load\n  // (QA 85050 BUG-03). Mint a temp id for those rows — exactly what commit()\n  // already does on save (line ~299). Rows that DO resolve a key (the common\n  // case) are untouched, so id-backed editors are unaffected.\n  const ensureKeys = (rows: TItem[]): { rows: TItem[]; changed: boolean } => {\n    if (!keyField) return { rows, changed: false }\n    let changed = false\n    const next = rows.map((item) => {\n      const k = keyOf(item)\n      if (k === undefined || k === null) {\n        changed = true\n        return { ...item, [keyField]: nextListEditorTempId() } as TItem\n      }\n      return item\n    })\n    return { rows: next, changed }\n  }\n  const seeded = ensureKeys(options.get())\n  if (seeded.changed) options.set(seeded.rows)\n  // Capture from the seeded array directly (not a re-read of options.get()): when\n  // set() emits through v-model the prop update is async, so options.get() would\n  // still return the pre-mint colliding rows here. Mirrors commit()'s pattern.\n  captureBaseline(seeded.rows)\n\n  // Declared structural state the content-diff can't see.\n  const movedKeys = ref(new Set<ListEditorKey>()) as Ref<Set<ListEditorKey>>\n  const deletedRows = ref<TItem[]>([]) as Ref<TItem[]>\n  const submitted = ref(false)\n  // Reactive so a row form (re)registering its validity re-runs `invalidKeys`/`rowState`.\n  const registeredValidity = reactive(new Map<ListEditorKey, () => boolean>())\n\n  const isItemDirty = (item: TItem, key: ListEditorKey): boolean => {\n    if (options.isDirty) {\n      const saved = baselineRows.value.find((r) => keyOf(r) === key)\n      return options.isDirty(item, saved)\n    }\n    const baseHash = baselineHashes.value.get(key)\n    if (baseHash === undefined) return true // added\n    if (baseHash !== normalize(item)) return true // edited\n    return movedKeys.value.has(key) // moved (content-invisible)\n  }\n\n  // Gate the validation rail on \"has this row actually been edited\" rather than just \"is it\n  // unsaved\", so a freshly added still-untouched row is amber but not yet red. `addedBaseline` =\n  // first-seen content hash of each ADDED row; `editedKeys` = STICKY set of rows whose content has\n  // since diverged from that first-seen / committed baseline. Sticky like vuelidate `$dirty`: once\n  // edited a row stays dirty until commit/reset, so clearing a field back to empty keeps the rail\n  // consistent with the field's own error state. Position / `dirtyExclude` are normalized out, so a\n  // reorder never counts as an edit.\n  const addedBaseline = ref(new Map<ListEditorKey, string>()) as Ref<Map<ListEditorKey, string>>\n  const editedKeys = ref(new Set<ListEditorKey>()) as Ref<Set<ListEditorKey>>\n  watch(\n    items,\n    (rows) => {\n      const live = new Set<ListEditorKey>()\n      for (const r of rows) {\n        const key = keyOf(r)\n        live.add(key)\n        if (!baselineHashes.value.has(key) && !addedBaseline.value.has(key)) {\n          addedBaseline.value.set(key, normalize(r))\n        }\n        if (!editedKeys.value.has(key)) {\n          const base = baselineHashes.value.get(key) ?? addedBaseline.value.get(key)\n          if (base !== undefined && base !== normalize(r)) editedKeys.value.add(key)\n        }\n      }\n      const stale: ListEditorKey[] = []\n      for (const key of addedBaseline.value.keys()) if (!live.has(key)) stale.push(key)\n      for (const key of stale) addedBaseline.value.delete(key)\n      // A deferred-deleted key that becomes live again (re-add before save) must drop its tombstone —\n      // otherwise it would both render and still count/report as deleted.\n      if (deletedRows.value.some((r) => live.has(keyOf(r)))) {\n        deletedRows.value = deletedRows.value.filter((r) => !live.has(keyOf(r)))\n      }\n    },\n    { immediate: true, deep: true }\n  )\n\n  const isRowEdited = (key: ListEditorKey): boolean => editedKeys.value.has(key)\n\n  const unsavedKeys = computed<Set<ListEditorKey>>(() => {\n    const out = new Set<ListEditorKey>()\n    for (const item of options.get()) {\n      const key = keyOf(item)\n      if (isItemDirty(item, key)) out.add(key)\n    }\n    return out\n  })\n\n  const isUnsaved = (key: ListEditorKey): boolean => unsavedKeys.value.has(key)\n  const hasUnsaved = computed<boolean>(() => unsavedKeys.value.size > 0 || deletedRows.value.length > 0)\n\n  // Count of DISTINCT unconfirmed changes = union of live dirty keys (added / edited / moved) and\n  // deferred-deletion tombstones. A key that is both live and tombstoned (delete-then-re-add) counts\n  // once; a deleted row (no longer live) adds one. Drives the \"N unconfirmed changes\" indicator, so a\n  // delete lights up as a change even though the row itself is gone.\n  const unsavedCount = computed<number>(() => {\n    const keys = new Set<ListEditorKey>(unsavedKeys.value)\n    for (const r of deletedRows.value) keys.add(keyOf(r))\n    return keys.size\n  })\n\n  const resolveValidity = (item: TItem, key: ListEditorKey): { invalid: boolean; warning: boolean } => {\n    const registered = registeredValidity.get(key)\n    if (registered) return { invalid: !registered(), warning: false }\n    if (!options.validate) return { invalid: false, warning: false }\n    const r = options.validate(item)\n    if (typeof r === 'boolean') return { invalid: !r, warning: false }\n    return { invalid: !r.valid, warning: r.valid && r.state === 'warning' }\n  }\n\n  const invalidKeys = computed<Set<ListEditorKey>>(() => {\n    const out = new Set<ListEditorKey>()\n    for (const item of options.get()) {\n      const key = keyOf(item)\n      if (resolveValidity(item, key).invalid) out.add(key)\n    }\n    return out\n  })\n  const hasErrors = computed<boolean>(() => invalidKeys.value.size > 0)\n\n  // Red rail gated behind \"row has been edited\" (content changed since add/baseline — mirrors the\n  // field's vuelidate `$dirty`) or an explicit validateAll() — so a freshly added still-untouched\n  // row stays amber (not red) and a loaded-but-invalid row doesn't light up before interaction,\n  // while a save attempt reveals every offender (mounted or collapsed).\n  const rowState = (item: TItem, key: ListEditorKey, editing = false): ListEditorValidationState => {\n    const { invalid, warning } = resolveValidity(item, key)\n    // Red rail for an invalid row that is edited, unsaved (added), or after a save attempt. A row being\n    // filled in reads amber (not red) and goes red once collapsed — but a save attempt (`submitted`,\n    // which also reveals collapsed offenders) always reds it, even while open. (QA 85050 batch 7)\n    if (invalid) {\n      if (submitted.value) return 'invalid'\n      if (editing) return null\n      return isRowEdited(key) || isUnsaved(key) ? 'invalid' : null\n    }\n    if (warning) return 'warning'\n    return null\n  }\n\n  const validateAll = (): boolean => {\n    submitted.value = true\n    return invalidKeys.value.size === 0\n  }\n\n  // Resolve the policy for THIS action: a per-action override wins, else the base strategy.\n  // Under 'preserve-values' only a move reassigns (through the existing kept slots); every other\n  // action leaves positions as-is (add keeps the handed value, delete leaves a hole, update/payload\n  // never touch them). Under 'renumber' every action rewrites to a clean `(index+1)*multiplier`.\n  const renumber = (arr: TItem[], action: PositionAction): TItem[] => {\n    if (!managedPosition) return arr\n    const strategy = positionOverrides[action] ?? positionStrategy\n    if (strategy === 'preserve-values') {\n      return action === 'move' ? preservePositionValues(arr, { positionField }) : arr\n    }\n    return renumberPositions(arr, { positionField, positionMultiplier })\n  }\n\n  const write = (arr: TItem[], action: PositionAction) => options.set(renumber(arr, action))\n\n  const getPayload = (): TItem[] =>\n    options.payload ? options.payload(options.get()) : renumber(options.get(), 'payload')\n\n  const getChanges = (): ListEditorChanges<TItem> => {\n    const added: TItem[] = []\n    const updated: TItem[] = []\n    const moved: TItem[] = []\n    for (const item of options.get()) {\n      const key = keyOf(item)\n      const baseHash = baselineHashes.value.get(key)\n      if (baseHash === undefined) added.push(item)\n      else if (baseHash !== normalize(item)) updated.push(item)\n      if (movedKeys.value.has(key)) moved.push(item)\n    }\n    return { added, updated, moved, deleted: [...deletedRows.value], reparented: [] }\n  }\n\n  const commit = (savedItems?: TItem[]): void => {\n    const source = savedItems ?? options.get()\n    const normalized = options.normalizeSaved ? options.normalizeSaved(source) : source\n    const next = normalized.map((item) => {\n      const key = options.commitKey\n        ? options.commitKey(\n            item,\n            baselineRows.value.find((r) => keyOf(r) === keyOf(item))\n          )\n        : keyOf(item)\n      if (key === undefined || key === null) {\n        return keyField ? ({ ...item, [keyField]: nextListEditorTempId() } as TItem) : item\n      }\n      return item\n    })\n    options.set(next)\n    captureBaseline(next)\n    movedKeys.value = new Set()\n    deletedRows.value = []\n    addedBaseline.value = new Map()\n    editedKeys.value = new Set()\n    submitted.value = false\n  }\n\n  const reset = (rows?: TItem[]): void => {\n    options.set(rows ?? baselineRows.value.map((r) => cloneDeep(r)))\n    movedKeys.value = new Set()\n    deletedRows.value = []\n    addedBaseline.value = new Map()\n    editedKeys.value = new Set()\n    submitted.value = false\n  }\n\n  const indexOfKey = (arr: TItem[], key: ListEditorKey): number => arr.findIndex((x) => keyOf(x) === key)\n\n  const addItem = (item?: TItem, hint?: PositionHint): ListEditorKey | undefined => {\n    const row = item ?? options.factory?.()\n    if (row === undefined) return undefined // no item + no factory (read-only list) → no-op\n    const arr = [...options.get()]\n    let at = arr.length\n    if (hint?.afterId !== undefined) {\n      const i = indexOfKey(arr, hint.afterId)\n      at = i === -1 ? arr.length : i + 1\n    } else if (hint?.index !== undefined) {\n      at = Math.max(0, Math.min(hint.index, arr.length))\n    }\n    arr.splice(at, 0, row)\n    write(arr, 'add')\n    return keyOf(row)\n  }\n\n  const updateItem = (key: ListEditorKey, next: TItem | Partial<TItem> | ((current: TItem) => TItem)): void => {\n    const arr = [...options.get()]\n    const i = indexOfKey(arr, key)\n    if (i === -1) return\n    const current = arr[i]!\n    const resolved =\n      typeof next === 'function'\n        ? (next as (c: TItem) => TItem)(current)\n        : ({ ...current, ...(next as Partial<TItem>) } as TItem)\n    arr[i] = resolved\n    write(arr, 'update')\n  }\n\n  const deleteItem = (key: ListEditorKey, opts?: { trackDeleted?: boolean }): void => {\n    const arr = [...options.get()]\n    const i = indexOfKey(arr, key)\n    if (i === -1) return\n    const removed = arr.splice(i, 1)[0]!\n    // A previously-saved row that's removed is a DEFERRED deletion: reported in the change-set and\n    // counted as one unconfirmed change (`unsavedCount`) until save. `trackDeleted: false` (immediate\n    // mode — the row is already deleted on the backend) skips the tombstone so it does NOT read as\n    // unsaved. An unsaved temp row just vanishes either way.\n    if (baselineHashes.value.has(key) && opts?.trackDeleted !== false) {\n      deletedRows.value = [...deletedRows.value, removed]\n    } else if (baselineHashes.value.has(key)) {\n      // Deleted on the backend: no longer part of the saved rows `reset()` returns to.\n      const hashes = new Map(baselineHashes.value)\n      hashes.delete(key)\n      baselineHashes.value = hashes\n      baselineRows.value = baselineRows.value.filter((r) => keyOf(r) !== key)\n    }\n    movedKeys.value.delete(key)\n    write(arr, 'remove')\n  }\n\n  // Un-tombstone a deferred-deleted row. Re-inserting the row into the model is the caller's job\n  // (e.g. reorder Cancel restoring the pre-session snapshot); this only clears the deletion record so\n  // `deletedRows` / `unsavedCount` / `getChanges().deleted` stay consistent.\n  const restoreDeleted = (key: ListEditorKey): void => {\n    deletedRows.value = deletedRows.value.filter((r) => keyOf(r) !== key)\n  }\n\n  const moveItem = (fromIndex: number, toIndex: number): void => {\n    const arr = [...options.get()]\n    if (fromIndex < 0 || fromIndex >= arr.length || toIndex < 0 || toIndex >= arr.length) return\n    if (fromIndex === toIndex) return\n    const el = arr.splice(fromIndex, 1)[0]!\n    arr.splice(toIndex, 0, el)\n    movedKeys.value.add(keyOf(el))\n    write(arr, 'move')\n  }\n\n  // Reorder Cancel restores the pre-session order, so the moves are undone — drop\n  // just those keys' \"moved\" flag (edits/adds stay dirty). No arg = clear all.\n  const clearMoved = (keys?: Iterable<ListEditorKey>): void => {\n    if (keys === undefined) {\n      movedKeys.value = new Set()\n      return\n    }\n    const next = new Set(movedKeys.value)\n    for (const key of keys) next.delete(key)\n    movedKeys.value = next\n  }\n\n  const registerValidity = (key: ListEditorKey, isValid: () => boolean): (() => void) => {\n    registeredValidity.set(key, isValid)\n    return () => registeredValidity.delete(key)\n  }\n\n  return {\n    items,\n    hasUnsaved,\n    unsavedCount,\n    hasErrors,\n    invalidKeys,\n    isUnsaved,\n    rowState,\n    validateAll,\n    getPayload,\n    getChanges,\n    commit,\n    reset,\n    addItem,\n    updateItem,\n    deleteItem,\n    restoreDeleted,\n    moveItem,\n    clearMoved,\n    registerValidity,\n  }\n}\n"],"mappings":";;;;;AA6IA,SAAgBA,EACd,GACyB;CACzB,IAAMC,IAAY,OAAOC,EAAQ,UAAW,aAAa,OAAQA,EAAQ,UAAU,MAC7EC,KAAS,MACb,OAAOD,EAAQ,UAAW,aAAaA,EAAQ,OAAOE,CAAI,IAAKA,EAAKH,IAEhEI,IAAcH,EAAQ,YAAY,YAClCI,IAAkBD,MAAgB,IAClCE,IACJ,OAAOF,KAAgB,WAAWA,EAAY,QAAQA,MAAgB,KAAQ,aAAaA,GAEvFG,IAAqB,OAAOH,KAAgB,YAAYA,EAAY,aAAaA,EAAY,aAAa,GAC1GI,IAAsC,OAAOJ,KAAgB,YAAYA,EAAY,YAAa,YAClGK,IACH,OAAOL,KAAgB,YAAYA,EAAY,qBAAsB,CAAC,GAEnEM,IAAQC,QAAwBV,EAAQ,IAAI,CAAC,GAI7CW,IAAeD,QAAyBE,EAAQZ,EAAQ,YAAY,KAAK,CAAC,CAAC,GAQ3Ea,KAAgB,GAAY,MAChCC,MAAO,QAAQ,OAAOC,KAAM,YAAYA,IAAI,IAAI,KAAA,IAAYA,GACxDC,KAAa,MAAwB;EACzC,IAAMC,IAAO,EAAE,GAAGf,EAAK;EACvB,AAAIE,KAAiB,OAAOa,EAAKZ;EACjC,KAAK,IAAMa,KAAKP,EAAa,OAAO,OAAOM,EAAKC;EAChD,OAAO,KAAK,UAAUD,GAAMJ,CAAY;CAC1C,GACMM,IAAiBC,kBAAI,IAAI,IAA2B,CAAC,GACrDC,IAAeD,EAAa,CAAC,CAAC,GAC9BE,KAAmB,MAAkB;EACzC,IAAMC,oBAAM,IAAI,IAA2B;EAC3C,KAAK,IAAMC,KAAKC,GAAM,EAAI,IAAIxB,EAAMuB,CAAC,GAAGR,EAAUQ,CAAC,CAAC;EAIpD,AAHA,EAAe,QAAQD,GAGvB,EAAa,QAAQE,EAAK,KAAK,MAAMC,EAAUF,CAAC,CAAC;CACnD;CAGA,EACEb,SACM;EACJ,IAAMY,oBAAM,IAAI,IAA2B;EAC3C,KAAK,IAAMC,KAAKH,EAAa,OAAO,EAAI,IAAIpB,EAAMuB,CAAC,GAAGR,EAAUQ,CAAC,CAAC;EAClE,EAAe,QAAQD;CACzB,GACA,EAAE,OAAO,OAAO,CAClB;CAqBA,IAAMI,MAbc,MAAuD;EACzE,IAAI,CAAC5B,GAAU,OAAO;GAAE;GAAM,SAAS;EAAM;EAC7C,IAAI6B,IAAU;EASd,OAAO;GAAE,MARIH,EAAK,KAAK,MACXxB,EAAMC,CACZ,KAAyB,QAC3B,IAAU,IACH;IAAE,GAAGA;KAAOH,IAAW8B,EAAqB;GAAE,KAEhD3B,CAEM;GAAM;EAAQ;CAC/B,EACe,CAAWF,EAAQ,IAAI,CAAC;CAKvC,AAJI2B,EAAO,WAAS3B,EAAQ,IAAI2B,EAAO,IAAI,GAI3CL,EAAgBK,EAAO,IAAI;CAG3B,IAAMG,IAAYV,kBAAI,IAAI,IAAmB,CAAC,GACxCW,IAAcX,EAAa,CAAC,CAAC,GAC7BY,IAAYZ,EAAI,EAAK,GAErBa,IAAqBC,kBAAS,IAAI,IAAkC,CAAC,GAErEC,KAAe,GAAa,MAAgC;EAChE,IAAInC,EAAQ,SAAS;GACnB,IAAMoC,IAAQf,EAAa,MAAM,MAAM,MAAMpB,EAAMuB,CAAC,MAAMa,CAAG;GAC7D,OAAOrC,EAAQ,QAAQE,GAAMkC,CAAK;EACpC;EACA,IAAME,IAAWnB,EAAe,MAAM,IAAIkB,CAAG;EAG7C,OAFIC,MAAa,KAAA,KACbA,MAAatB,EAAUd,CAAI,KACxB4B,EAAU,MAAM,IAAIO,CAAG;CAChC,GASME,IAAgBnB,kBAAI,IAAI,IAA2B,CAAC,GACpDoB,IAAapB,kBAAI,IAAI,IAAmB,CAAC;CAC/C,EACEX,IACC,MAAS;EACR,IAAMgC,oBAAO,IAAI,IAAmB;EACpC,KAAK,IAAMjB,KAAKC,GAAM;GACpB,IAAMY,IAAMpC,EAAMuB,CAAC;GAKnB,IAJAiB,EAAK,IAAIJ,CAAG,GACR,CAAClB,EAAe,MAAM,IAAIkB,CAAG,KAAK,CAACE,EAAc,MAAM,IAAIF,CAAG,KAChEE,EAAc,MAAM,IAAIF,GAAKrB,EAAUQ,CAAC,CAAC,GAEvC,CAACgB,EAAW,MAAM,IAAIH,CAAG,GAAG;IAC9B,IAAMK,IAAOvB,EAAe,MAAM,IAAIkB,CAAG,KAAKE,EAAc,MAAM,IAAIF,CAAG;IACzE,AAAIK,MAAS,KAAA,KAAaA,MAAS1B,EAAUQ,CAAC,KAAGgB,EAAW,MAAM,IAAIH,CAAG;GAC3E;EACF;EACA,IAAMM,IAAyB,CAAC;EAChC,KAAK,IAAMN,KAAOE,EAAc,MAAM,KAAK,GAAG,AAAKE,EAAK,IAAIJ,CAAG,KAAGM,EAAM,KAAKN,CAAG;EAChF,KAAK,IAAMA,KAAOM,GAAO,EAAc,MAAM,OAAON,CAAG;EAGvD,AAAIN,EAAY,MAAM,MAAM,MAAMU,EAAK,IAAIxC,EAAMuB,CAAC,CAAC,CAAC,MAClD,EAAY,QAAQO,EAAY,MAAM,QAAQ,MAAM,CAACU,EAAK,IAAIxC,EAAMuB,CAAC,CAAC,CAAC;CAE3E,GACA;EAAE,WAAW;EAAM,MAAM;CAAK,CAChC;CAEA,IAAMoB,KAAe,MAAgCJ,EAAW,MAAM,IAAIH,CAAG,GAEvEQ,IAAcnC,QAAmC;EACrD,IAAMoC,oBAAM,IAAI,IAAmB;EACnC,KAAK,IAAM5C,KAAQF,EAAQ,IAAI,GAAG;GAChC,IAAMqC,IAAMpC,EAAMC,CAAI;GACtB,AAAIiC,EAAYjC,GAAMmC,CAAG,KAAGS,EAAI,IAAIT,CAAG;EACzC;EACA,OAAOS;CACT,CAAC,GAEKC,KAAa,MAAgCF,EAAY,MAAM,IAAIR,CAAG,GACtEW,IAAatC,QAAwBmC,EAAY,MAAM,OAAO,KAAKd,EAAY,MAAM,SAAS,CAAC,GAM/FkB,IAAevC,QAAuB;EAC1C,IAAMwC,IAAO,IAAI,IAAmBL,EAAY,KAAK;EACrD,KAAK,IAAMrB,KAAKO,EAAY,OAAO,EAAK,IAAI9B,EAAMuB,CAAC,CAAC;EACpD,OAAO0B,EAAK;CACd,CAAC,GAEKC,KAAmB,GAAa,MAA+D;EACnG,IAAMC,IAAanB,EAAmB,IAAII,CAAG;EAC7C,IAAIe,GAAY,OAAO;GAAE,SAAS,CAACA,EAAW;GAAG,SAAS;EAAM;EAChE,IAAI,CAACpD,EAAQ,UAAU,OAAO;GAAE,SAAS;GAAO,SAAS;EAAM;EAC/D,IAAM,IAAIA,EAAQ,SAASE,CAAI;EAE/B,OADI,OAAO,KAAM,YAAkB;GAAE,SAAS,CAAC;GAAG,SAAS;EAAM,IAC1D;GAAE,SAAS,CAAC,EAAE;GAAO,SAAS,EAAE,SAAS,EAAE,UAAU;EAAU;CACxE,GAEMmD,IAAc3C,QAAmC;EACrD,IAAMoC,oBAAM,IAAI,IAAmB;EACnC,KAAK,IAAM5C,KAAQF,EAAQ,IAAI,GAAG;GAChC,IAAMqC,IAAMpC,EAAMC,CAAI;GACtB,AAAIiD,EAAgBjD,GAAMmC,CAAG,CAAC,CAAC,WAASS,EAAI,IAAIT,CAAG;EACrD;EACA,OAAOS;CACT,CAAC,GACKQ,IAAY5C,QAAwB2C,EAAY,MAAM,OAAO,CAAC,GAM9DE,KAAY,GAAa,GAAoB,IAAU,OAAqC;EAChG,IAAM,EAAE,YAAS,eAAYJ,EAAgBjD,GAAMmC,CAAG;EAUtD,OANImB,IACExB,EAAU,QAAc,YACxByB,IAAgB,OACbb,EAAYP,CAAG,KAAKU,EAAUV,CAAG,IAAI,YAAY,OAEtDqB,IAAgB,YACb;CACT,GAEMC,WACJ,EAAU,QAAQ,IACXN,EAAY,MAAM,SAAS,IAO9BO,KAAY,GAAc,MACzBxD,KACYI,EAAkBqD,MAAWtD,OAC7B,oBACRsD,MAAW,SAASC,EAAuBC,GAAK,EAAE,iBAAc,CAAC,IAAIA,IAEvEC,EAAkBD,GAAK;EAAE;EAAe;CAAmB,CAAC,IALtCA,GAQzBE,KAAS,GAAc,MAA2BjE,EAAQ,IAAI4D,EAASG,GAAKF,CAAM,CAAC,GAEnFK,UACJlE,EAAQ,UAAUA,EAAQ,QAAQA,EAAQ,IAAI,CAAC,IAAI4D,EAAS5D,EAAQ,IAAI,GAAG,SAAS,GAEhFmE,UAA6C;EACjD,IAAMC,IAAiB,CAAC,GAClBC,IAAmB,CAAC,GACpBC,IAAiB,CAAC;EACxB,KAAK,IAAMpE,KAAQF,EAAQ,IAAI,GAAG;GAChC,IAAMqC,IAAMpC,EAAMC,CAAI,GAChBoC,IAAWnB,EAAe,MAAM,IAAIkB,CAAG;GAG7C,AAFIC,MAAa,KAAA,IAAW8B,EAAM,KAAKlE,CAAI,IAClCoC,MAAatB,EAAUd,CAAI,KAAGmE,EAAQ,KAAKnE,CAAI,GACpD4B,EAAU,MAAM,IAAIO,CAAG,KAAGiC,EAAM,KAAKpE,CAAI;EAC/C;EACA,OAAO;GAAE;GAAO;GAAS;GAAO,SAAS,CAAC,GAAG6B,EAAY,KAAK;GAAG,YAAY,CAAC;EAAE;CAClF,GAEMwC,KAAU,MAA+B;EAC7C,IAAMC,IAASC,KAAczE,EAAQ,IAAI,GAEnC0E,KADa1E,EAAQ,iBAAiBA,EAAQ,eAAewE,CAAM,IAAIA,EAAA,CACrD,KAAK,OACfxE,EAAQ,YAChBA,EAAQ,UACNE,GACAmB,EAAa,MAAM,MAAM,MAAMpB,EAAMuB,CAAC,MAAMvB,EAAMC,CAAI,CAAC,CACzD,IACAD,EAAMC,CAAI,MACmB,QACxBH,IAAY;GAAE,GAAGG;IAAOH,IAAW8B,EAAqB;EAAE,IAE5D3B,CACR;EAOD,AANAF,EAAQ,IAAI0E,CAAI,GAChBpD,EAAgBoD,CAAI,GACpB,EAAU,wBAAQ,IAAI,IAAI,GAC1B,EAAY,QAAQ,CAAC,GACrB,EAAc,wBAAQ,IAAI,IAAI,GAC9B,EAAW,wBAAQ,IAAI,IAAI,GAC3B,EAAU,QAAQ;CACpB,GAEMC,KAAS,MAAyB;EAMtC,AALA3E,EAAQ,IAAIyB,KAAQJ,EAAa,MAAM,KAAK,MAAMK,EAAUF,CAAC,CAAC,CAAC,GAC/D,EAAU,wBAAQ,IAAI,IAAI,GAC1B,EAAY,QAAQ,CAAC,GACrB,EAAc,wBAAQ,IAAI,IAAI,GAC9B,EAAW,wBAAQ,IAAI,IAAI,GAC3B,EAAU,QAAQ;CACpB,GAEMoD,KAAc,GAAc,MAA+Bb,EAAI,WAAW,MAAM9D,EAAM4E,CAAC,MAAMxC,CAAG;CAuFtG,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,UAlGe,GAAc,MAAmD;GAChF,IAAMyC,IAAM5E,KAAQF,EAAQ,UAAU;GACtC,IAAI8E,MAAQ,KAAA,GAAW;GACvB,IAAMf,IAAM,CAAC,GAAG/D,EAAQ,IAAI,CAAC,GACzB+E,IAAKhB,EAAI;GACb,IAAIiB,GAAM,YAAY,KAAA,GAAW;IAC/B,IAAMC,IAAIL,EAAWb,GAAKiB,EAAK,OAAO;IACtC,IAAKC,MAAM,KAAKlB,EAAI,SAASkB,IAAI;GACnC,OAAO,AAAID,GAAM,UAAU,KAAA,MACzB,IAAK,KAAK,IAAI,GAAG,KAAK,IAAIA,EAAK,OAAOjB,EAAI,MAAM,CAAC;GAInD,OAFAA,EAAI,OAAOgB,GAAI,GAAGD,CAAG,GACrBb,EAAMF,GAAK,KAAK,GACT9D,EAAM6E,CAAG;EAClB;EAqFE,aAnFkB,GAAoB,MAAqE;GAC3G,IAAMf,IAAM,CAAC,GAAG/D,EAAQ,IAAI,CAAC,GACvBiF,IAAIL,EAAWb,GAAK1B,CAAG;GAC7B,IAAI4C,MAAM,IAAI;GACd,IAAMC,IAAUnB,EAAIkB;GAMpB,AADA,EAAIA,KAHF,OAAOP,KAAS,aACXA,EAA6BQ,CAAO,IACpC;IAAE,GAAGA;IAAS,GAAIR;GAAwB,GAEjDT,EAAMF,GAAK,QAAQ;EACrB;EAyEE,aAvEkB,GAAoB,MAA4C;GAClF,IAAMA,IAAM,CAAC,GAAG/D,EAAQ,IAAI,CAAC,GACvBiF,IAAIL,EAAWb,GAAK1B,CAAG;GAC7B,IAAI4C,MAAM,IAAI;GACd,IAAME,IAAUpB,EAAI,OAAOkB,GAAG,CAAC,CAAC,CAAC;GAKjC,IAAI9D,EAAe,MAAM,IAAIkB,CAAG,KAAK+C,GAAM,iBAAiB,IAC1D,EAAY,QAAQ,CAAC,GAAGrD,EAAY,OAAOoD,CAAO;QAC7C,IAAIhE,EAAe,MAAM,IAAIkB,CAAG,GAAG;IAExC,IAAMgD,IAAS,IAAI,IAAIlE,EAAe,KAAK;IAG3C,AAFAkE,EAAO,OAAOhD,CAAG,GACjB,EAAe,QAAQgD,GACvB,EAAa,QAAQhE,EAAa,MAAM,QAAQ,MAAMpB,EAAMuB,CAAC,MAAMa,CAAG;GACxE;GAEA,AADAP,EAAU,MAAM,OAAOO,CAAG,GAC1B4B,EAAMF,GAAK,QAAQ;EACrB;EAoDE,iBA/CsB,MAA6B;GACnD,EAAY,QAAQhC,EAAY,MAAM,QAAQ,MAAM9B,EAAMuB,CAAC,MAAMa,CAAG;EACtE;EA8CE,WA5CgB,GAAmB,MAA0B;GAC7D,IAAM0B,IAAM,CAAC,GAAG/D,EAAQ,IAAI,CAAC;GAE7B,IADIsF,IAAY,KAAKA,KAAavB,EAAI,UAAUwB,IAAU,KAAKA,KAAWxB,EAAI,UAC1EuB,MAAcC,GAAS;GAC3B,IAAMC,IAAKzB,EAAI,OAAOuB,GAAW,CAAC,CAAC,CAAC;GAGpC,AAFAvB,EAAI,OAAOwB,GAAS,GAAGC,CAAE,GACzB1D,EAAU,MAAM,IAAI7B,EAAMuF,CAAE,CAAC,GAC7BvB,EAAMF,GAAK,MAAM;EACnB;EAqCE,aAjCkB,MAAyC;GAC3D,IAAIb,MAAS,KAAA,GAAW;IACtB,EAAU,wBAAQ,IAAI,IAAI;IAC1B;GACF;GACA,IAAMwB,IAAO,IAAI,IAAI5C,EAAU,KAAK;GACpC,KAAK,IAAMO,KAAOa,GAAM,EAAK,OAAOb,CAAG;GACvC,EAAU,QAAQqC;EACpB;EA0BE,mBAxBwB,GAAoB,OAC5CzC,EAAmB,IAAII,GAAKoD,CAAO,SACtBxD,EAAmB,OAAOI,CAAG;CAuB5C;AACF"}

package/dist/domains/listEditor/composables/useNestedListEditor.d.ts

@@ -29,7 +29,7 @@ export interface UseNestedListEditorOptions {
     positionMultiplier?: number;
     /** `false` = the position field is not managed: tree ops never write it. */
     managedPosition?: boolean;
-    /** Per-action policy (mirrors the flat controller); default 'renumber'. */
+    /** Per-action policy, as in the flat controller. Default 'renumber'. */
     positionStrategyFor?: (action: 'add' | 'remove' | 'move') => 'renumber' | 'preserve-values';
     maxDepth: number;
     expandedKeys?: Ref<Set<ListEditorKey>>;
@@ -60,8 +60,7 @@ export interface NestedListEditorApi<TItem extends Record<string, any>> {
     calculateSubtreeDepth: (node: NestedTreeNode<TItem>) => number;
 }
 /**
- * Nested list editor core. Pure data behavior shared by ANestedSortableListEditor.
- * Works on a tree of `{ data, children, meta }` nodes. Mutators return a cloned tree and also
- * assign it to `model.value`.
+ * Nested list editor core for `ANestedSortableListEditor`. Works on a tree of `{ data, children, meta }` nodes.
+ * Mutators return a cloned tree and also assign it to `model.value`.
  */
 export declare function useNestedListEditor<TItem extends Record<string, any>>(model: Ref<NestedTree<TItem>>, options: UseNestedListEditorOptions): NestedListEditorApi<TItem>;

package/dist/domains/listEditor/composables/useNestedListEditor.js.map

@@ -1 +1 @@
-{"version":3,"file":"useNestedListEditor.js","names":["DEFAULT_KEY_FIELD","DEFAULT_POSITION_FIELD","DEFAULT_PARENT_FIELD","useNestedListEditor","keyField","options","resolveKey","positionField","parentField","positionMultiplier","maxDepth","getKey","data","calculateSubtreeDepth","node","max","child","d","findNode","model","item","arr","id","found","recalculateSiblings","action","values","siblings","s","v","slots","a","b","sibling","i","pos","recalculateAll","walk","tree","recalculatePositions","cloned","cloneDeep","buildViewItems","flat","expandedKeys","flatIndex","nodes","key","childrenAllowed","isUndefined","hasChildren","childrenCount","isExpanded","remainingDepth","depth","canAddChild","canOutdent","canIndent","parentNode","viewItems","computed","insertAfter","afterIdx","newNode","resolveInsertIndex","hint","idx","addItem","targetSiblings","afterNode","afterParent","insertIdx","deleteItem","parent","opts","updateItem","markDirty","swapSiblings","target","getTargetIndex","removed","moveUp","res","moveDown","moveTop","moveBottom","indent","prev","subtreeDepth","calculateParentDepth","outdent","grandParent","grandSiblings","parentIdx","currentSiblings","targetParentId","isDescendant","n","c","newParentNode","newParentDepth","targetParent","sourceSiblings","sourceIdx","samelist","insertAt","targetIndex"],"sources":["../../../../src/domains/listEditor/composables/useNestedListEditor.ts"],"sourcesContent":["import { computed, type ComputedRef, type Ref } from 'vue'\nimport { cloneDeep, isUndefined } from '@/shared/utils/common'\nimport type {\n  ListEditorKey,\n  ListViewItem,\n  NestedTree,\n  NestedTreeNode,\n  PositionHint,\n} from '@/domains/listEditor/types/listEditorTypes'\n\nexport interface NestedViewItem<TItem> extends ListViewItem<TItem> {\n  node: NestedTreeNode<TItem>\n  depth: number\n  parent: TItem | null\n  parentKey: ListEditorKey | null\n  childrenCount: number\n  hasChildren: boolean\n  childrenAllowed: boolean\n  siblingIndex: number\n  siblingCount: number\n  firstInParent: boolean\n  lastInParent: boolean\n  canAddChild: boolean\n  canIndent: boolean\n  canOutdent: boolean\n}\n\nexport interface UseNestedListEditorOptions {\n  keyField?: string\n  /**\n   * Resolve a row's key; takes precedence over `keyField`. Pass the controller's\n   * `keyOf` so tree ops key rows the same way as dirty/validity tracking — incl.\n   * a FUNCTION get-key, which `keyField` lookup would miss.\n   */\n  getKey?: (data: any) => ListEditorKey\n  positionField?: string\n  parentField?: string\n  positionMultiplier?: number\n  /** `false` = the position field is not managed: tree ops never write it. */\n  managedPosition?: boolean\n  /** Per-action policy (mirrors the flat controller); default 'renumber'. */\n  positionStrategyFor?: (action: 'add' | 'remove' | 'move') => 'renumber' | 'preserve-values'\n  maxDepth: number\n  expandedKeys?: Ref<Set<ListEditorKey>>\n}\n\nexport interface NestedListEditorApi<TItem extends Record<string, any>> {\n  viewItems: ComputedRef<NestedViewItem<TItem>[]>\n  findNode: (id: ListEditorKey) => {\n    node: NestedTreeNode<TItem> | null\n    parent: NestedTreeNode<TItem> | null\n  }\n  addItem: (\n    data: TItem,\n    hint?: PositionHint & {\n      parentId?: ListEditorKey | null\n      asFirstChild?: boolean\n      childrenAllowed?: boolean\n    }\n  ) => NestedTree<TItem>\n  deleteItem: (id: ListEditorKey, opts?: { renumber?: boolean }) => NestedTree<TItem>\n  updateItem: (id: ListEditorKey, data: TItem, markDirty?: boolean) => NestedTree<TItem>\n  moveUp: (id: ListEditorKey) => NestedTree<TItem> | null\n  moveDown: (id: ListEditorKey) => NestedTree<TItem> | null\n  moveTop: (id: ListEditorKey) => NestedTree<TItem> | null\n  moveBottom: (id: ListEditorKey) => NestedTree<TItem> | null\n  indent: (id: ListEditorKey) => NestedTree<TItem> | null\n  outdent: (id: ListEditorKey) => NestedTree<TItem> | null\n  moveTo: (id: ListEditorKey, targetParentId: ListEditorKey | null, targetIndex: number) => NestedTree<TItem> | null\n  recalculatePositions: (model: NestedTree<TItem>) => NestedTree<TItem>\n  calculateSubtreeDepth: (node: NestedTreeNode<TItem>) => number\n}\n\nconst DEFAULT_KEY_FIELD = 'id'\nconst DEFAULT_POSITION_FIELD = 'position'\nconst DEFAULT_PARENT_FIELD = 'parent'\n\n/**\n * Nested list editor core. Pure data behavior shared by ANestedSortableListEditor.\n * Works on a tree of `{ data, children, meta }` nodes. Mutators return a cloned tree and also\n * assign it to `model.value`.\n */\nexport function useNestedListEditor<TItem extends Record<string, any>>(\n  model: Ref<NestedTree<TItem>>,\n  options: UseNestedListEditorOptions\n): NestedListEditorApi<TItem> {\n  const keyField = options.keyField ?? DEFAULT_KEY_FIELD\n  const resolveKey = options.getKey\n  const positionField = options.positionField ?? DEFAULT_POSITION_FIELD\n  const parentField = options.parentField ?? DEFAULT_PARENT_FIELD\n  const positionMultiplier = options.positionMultiplier ?? 1\n  const maxDepth = options.maxDepth\n\n  const getKey = (data: TItem): ListEditorKey => (resolveKey ? resolveKey(data) : (data[keyField] as ListEditorKey))\n\n  const calculateSubtreeDepth = (node: NestedTreeNode<TItem>): number => {\n    if (!node.children || node.children.length === 0) return 1\n    let max = 0\n    for (const child of node.children) {\n      const d = calculateSubtreeDepth(child)\n      if (d > max) max = d\n    }\n    return max + 1\n  }\n\n  const findNode = (\n    id: ListEditorKey,\n    arr: NestedTreeNode<TItem>[] = model.value.children,\n    parent: NestedTreeNode<TItem> | null = null\n  ): { node: NestedTreeNode<TItem> | null; parent: NestedTreeNode<TItem> | null } => {\n    for (const item of arr) {\n      if (getKey(item.data) === id) return { node: item, parent }\n      if (item.children && item.children.length > 0) {\n        const found = findNode(id, item.children, item)\n        if (found.node) return found\n      }\n    }\n    return { node: null, parent: null }\n  }\n\n  const recalculateSiblings = (siblings: NestedTreeNode<TItem>[], action: 'add' | 'remove' | 'move' = 'move') => {\n    if (options.managedPosition === false) return\n    const strategy = options.positionStrategyFor?.(action) ?? 'renumber'\n    if (strategy === 'preserve-values') {\n      if (action !== 'move') return\n      const values = siblings.map((s) => s.data[positionField])\n      // As in the flat editor: without a finite number on every row there is no slot set to move\n      // through, and inventing one would write a wrong payload.\n      if (!values.every((v) => typeof v === 'number' && Number.isFinite(v))) {\n        console.warn(\n          `[listEditor] position strategy \"preserve-values\" needs a finite numeric \\`${positionField}\\` ` +\n            'on every row; found ' +\n            JSON.stringify(values) +\n            ' — leaving positions untouched.'\n        )\n        return\n      }\n      const slots = (values as number[]).slice().sort((a, b) => a - b)\n      siblings.forEach((sibling, i) => {\n        if (sibling.data[positionField] !== slots[i]) {\n          ;(sibling.data as any)[positionField] = slots[i]\n          sibling.meta.dirty = true\n        }\n      })\n      return\n    }\n    let pos = 1 * positionMultiplier\n    for (const sibling of siblings) {\n      if (sibling.data[positionField] !== pos) {\n        ;(sibling.data as any)[positionField] = pos\n        // Flag dirty so a partial-subset save persists the new position;\n        // otherwise reorders are lost on reload and rows collide on old positions.\n        sibling.meta.dirty = true\n      }\n      pos += positionMultiplier\n    }\n  }\n\n  const recalculateAll = (tree: NestedTree<TItem>) => {\n    const walk = (arr: NestedTreeNode<TItem>[]) => {\n      recalculateSiblings(arr)\n      for (const item of arr) if (item.children && item.children.length) walk(item.children)\n    }\n    walk(tree.children)\n  }\n\n  const recalculatePositions = (tree: NestedTree<TItem>): NestedTree<TItem> => {\n    const cloned = cloneDeep(tree) as NestedTree<TItem>\n    recalculateAll(cloned)\n    return cloned\n  }\n\n  const buildViewItems = (tree: NestedTree<TItem>): NestedViewItem<TItem>[] => {\n    const flat: NestedViewItem<TItem>[] = []\n    const expandedKeys = options.expandedKeys?.value\n    let flatIndex = 0\n    const walk = (nodes: NestedTreeNode<TItem>[], depth: number, parentNode: NestedTreeNode<TItem> | null) => {\n      for (let i = 0; i < nodes.length; i++) {\n        const node = nodes[i]!\n        const key = getKey(node.data)\n        const childrenAllowed = !isUndefined(node.children)\n        const hasChildren = childrenAllowed && (node.children?.length ?? 0) > 0\n        const childrenCount = node.children?.length ?? 0\n        const isExpanded = expandedKeys ? expandedKeys.has(key) : true\n        const remainingDepth = maxDepth - (depth + 1)\n        const canAddChild = childrenAllowed && remainingDepth > 0\n        const canOutdent = depth > 0\n        const canIndent = i > 0\n        flat.push({\n          key,\n          index: flatIndex++,\n          raw: node.data,\n          position: node.data[positionField] as number | undefined,\n          node,\n          depth,\n          parent: parentNode?.data ?? null,\n          parentKey: parentNode ? getKey(parentNode.data) : null,\n          childrenCount,\n          hasChildren,\n          childrenAllowed,\n          siblingIndex: i,\n          siblingCount: nodes.length,\n          firstInParent: i === 0,\n          lastInParent: i === nodes.length - 1,\n          canAddChild,\n          canIndent,\n          canOutdent,\n        })\n        if (hasChildren && isExpanded) {\n          walk(node.children as NestedTreeNode<TItem>[], depth + 1, node)\n        }\n      }\n    }\n    walk(tree.children, 0, null)\n    return flat\n  }\n\n  const viewItems = computed<NestedViewItem<TItem>[]>(() => buildViewItems(model.value))\n\n  const insertAfter = (siblings: NestedTreeNode<TItem>[], afterIdx: number, newNode: NestedTreeNode<TItem>) => {\n    siblings.splice(afterIdx + 1, 0, newNode)\n  }\n\n  const resolveInsertIndex = (siblings: NestedTreeNode<TItem>[], hint?: PositionHint): number => {\n    if (!hint) return siblings.length\n    if (hint.afterId !== undefined) {\n      const idx = siblings.findIndex((s) => getKey(s.data) === hint.afterId)\n      return idx === -1 ? siblings.length : idx + 1\n    }\n    if (hint.afterIndex !== undefined) {\n      if (hint.afterIndex < 0) return siblings.length\n      return Math.min(hint.afterIndex + 1, siblings.length)\n    }\n    if (hint.index !== undefined) {\n      return Math.max(0, Math.min(hint.index, siblings.length))\n    }\n    return siblings.length\n  }\n\n  const addItem = (\n    data: TItem,\n    hint?: PositionHint & {\n      parentId?: ListEditorKey | null\n      asFirstChild?: boolean\n      childrenAllowed?: boolean\n    }\n  ): NestedTree<TItem> => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const childrenAllowed = hint?.childrenAllowed ?? true\n    const newNode: NestedTreeNode<TItem> = {\n      data: cloneDeep(data) as TItem,\n      children: childrenAllowed ? [] : undefined,\n      meta: { dirty: false },\n    }\n\n    let targetSiblings: NestedTreeNode<TItem>[] = cloned.children\n    let parentNode: NestedTreeNode<TItem> | null = null\n\n    if (hint?.parentId !== undefined && hint.parentId !== null) {\n      const { node } = findNode(hint.parentId, cloned.children)\n      if (node && node.children) {\n        targetSiblings = node.children\n        parentNode = node\n      }\n    }\n\n    if (hint?.afterId !== undefined) {\n      const { node: afterNode, parent: afterParent } = findNode(hint.afterId, cloned.children)\n      if (afterNode) {\n        const siblings = afterParent ? (afterParent.children as NestedTreeNode<TItem>[]) : cloned.children\n        const idx = siblings.indexOf(afterNode)\n        if (idx !== -1) {\n          insertAfter(siblings, idx, newNode)\n          ;(newNode.data as any)[parentField] = afterParent ? getKey(afterParent.data) : null\n          recalculateSiblings(siblings, 'add')\n          model.value = cloned\n          return cloned\n        }\n      }\n    }\n\n    const insertIdx = hint?.asFirstChild ? 0 : resolveInsertIndex(targetSiblings, hint)\n    targetSiblings.splice(insertIdx, 0, newNode)\n    ;(newNode.data as any)[parentField] = parentNode ? getKey(parentNode.data) : null\n    recalculateSiblings(targetSiblings, 'add')\n    model.value = cloned\n    return cloned\n  }\n\n  // `renumber: false` leaves the siblings' positions as they are: a row already deleted on the backend,\n  // which does not renumber either, so the gap the server has stays in the editor too.\n  const deleteItem = (id: ListEditorKey, opts?: { renumber?: boolean }): NestedTree<TItem> => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const { node, parent } = findNode(id, cloned.children)\n    if (!node) return cloned\n    const siblings = parent ? (parent.children as NestedTreeNode<TItem>[]) : cloned.children\n    const idx = siblings.indexOf(node)\n    if (idx === -1) return cloned\n    siblings.splice(idx, 1)\n    if (opts?.renumber !== false) recalculateSiblings(siblings, 'remove')\n    model.value = cloned\n    return cloned\n  }\n\n  const updateItem = (id: ListEditorKey, data: TItem, markDirty = true): NestedTree<TItem> => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const { node } = findNode(id, cloned.children)\n    if (!node) return cloned\n    node.data = cloneDeep(data) as TItem\n    // An edit must be persisted by partial-subset saves. `markDirty=false` is for\n    // snapshot restore on edit-cancel, which must NOT flag the node dirty.\n    if (markDirty) node.meta.dirty = true\n    model.value = cloned\n    return cloned\n  }\n\n  const swapSiblings = (\n    cloned: NestedTree<TItem>,\n    id: ListEditorKey,\n    getTargetIndex: (siblings: NestedTreeNode<TItem>[], currentIdx: number) => number | null\n  ): NestedTree<TItem> | null => {\n    const { node, parent } = findNode(id, cloned.children)\n    if (!node) return null\n    const siblings = parent ? (parent.children as NestedTreeNode<TItem>[]) : cloned.children\n    const idx = siblings.indexOf(node)\n    if (idx === -1) return null\n    const target = getTargetIndex(siblings, idx)\n    if (target === null || target === idx) return null\n    const removed = siblings.splice(idx, 1)[0]!\n    siblings.splice(target, 0, removed)\n    if (options.managedPosition === false) removed.meta.dirty = true\n    recalculateSiblings(siblings)\n    return cloned\n  }\n\n  const moveUp = (id: ListEditorKey): NestedTree<TItem> | null => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const res = swapSiblings(cloned, id, (_s, idx) => (idx > 0 ? idx - 1 : null))\n    if (res) model.value = res\n    return res\n  }\n\n  const moveDown = (id: ListEditorKey): NestedTree<TItem> | null => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const res = swapSiblings(cloned, id, (s, idx) => (idx < s.length - 1 ? idx + 1 : null))\n    if (res) model.value = res\n    return res\n  }\n\n  const moveTop = (id: ListEditorKey): NestedTree<TItem> | null => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const res = swapSiblings(cloned, id, (_s, idx) => (idx > 0 ? 0 : null))\n    if (res) model.value = res\n    return res\n  }\n\n  const moveBottom = (id: ListEditorKey): NestedTree<TItem> | null => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const res = swapSiblings(cloned, id, (s, idx) => (idx < s.length - 1 ? s.length - 1 : null))\n    if (res) model.value = res\n    return res\n  }\n\n  /**\n   * Indent: move the item under its previous sibling as its last child.\n   * Fails if: no previous sibling, previous sibling doesn't allow children,\n   * or the resulting depth would exceed maxDepth.\n   */\n  const indent = (id: ListEditorKey): NestedTree<TItem> | null => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const { node, parent } = findNode(id, cloned.children)\n    if (!node) return null\n    const siblings = parent ? (parent.children as NestedTreeNode<TItem>[]) : cloned.children\n    const idx = siblings.indexOf(node)\n    if (idx <= 0) return null\n    const prev = siblings[idx - 1]!\n    if (isUndefined(prev.children)) return null\n    const subtreeDepth = calculateSubtreeDepth(node)\n    const prevDepth = calculateParentDepth(cloned, getKey(prev.data))\n    if (prevDepth + 1 + subtreeDepth > maxDepth) return null\n\n    siblings.splice(idx, 1)\n    prev.children!.push(node)\n    ;(node.data as any)[parentField] = getKey(prev.data)\n    // Persist the reparent even when the position number is unchanged (QA 85050 BUG-13).\n    node.meta.dirty = true\n    recalculateSiblings(siblings)\n    recalculateSiblings(prev.children!)\n    model.value = cloned\n    return cloned\n  }\n\n  /**\n   * Outdent: move the item up one level — it becomes the next sibling of its current parent.\n   * Fails if the item is already at root.\n   */\n  const outdent = (id: ListEditorKey): NestedTree<TItem> | null => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const { node, parent } = findNode(id, cloned.children)\n    if (!node || !parent) return null\n\n    const { parent: grandParent } = findNode(getKey(parent.data), cloned.children)\n    const grandSiblings = grandParent ? (grandParent.children as NestedTreeNode<TItem>[]) : cloned.children\n    const parentIdx = grandSiblings.indexOf(parent)\n    if (parentIdx === -1) return null\n\n    const currentSiblings = parent.children as NestedTreeNode<TItem>[]\n    const idx = currentSiblings.indexOf(node)\n    if (idx === -1) return null\n    currentSiblings.splice(idx, 1)\n    grandSiblings.splice(parentIdx + 1, 0, node)\n    ;(node.data as any)[parentField] = grandParent ? getKey(grandParent.data) : null\n    // Persist the reparent even when the position number is unchanged (QA 85050 BUG-13).\n    node.meta.dirty = true\n\n    recalculateSiblings(currentSiblings)\n    recalculateSiblings(grandSiblings)\n    model.value = cloned\n    return cloned\n  }\n\n  const calculateParentDepth = (tree: NestedTree<TItem>, id: ListEditorKey): number => {\n    const walk = (arr: NestedTreeNode<TItem>[], depth: number): number | null => {\n      for (const item of arr) {\n        if (getKey(item.data) === id) return depth\n        if (item.children && item.children.length) {\n          const d = walk(item.children, depth + 1)\n          if (d !== null) return d\n        }\n      }\n      return null\n    }\n    return walk(tree.children, 0) ?? 0\n  }\n\n  /**\n   * Move a node to a specific parent at a specific index. Used by drag/drop.\n   * Respects maxDepth — returns null if the move would exceed it.\n   */\n  const moveTo = (\n    id: ListEditorKey,\n    targetParentId: ListEditorKey | null,\n    targetIndex: number\n  ): NestedTree<TItem> | null => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const { node, parent } = findNode(id, cloned.children)\n    if (!node) return null\n\n    if (targetParentId !== null) {\n      const isDescendant = (n: NestedTreeNode<TItem>): boolean => {\n        if (!n.children) return false\n        for (const c of n.children) {\n          if (getKey(c.data) === targetParentId) return true\n          if (isDescendant(c)) return true\n        }\n        return false\n      }\n      if (getKey(node.data) === targetParentId || isDescendant(node)) return null\n    }\n\n    let targetSiblings: NestedTreeNode<TItem>[]\n    let newParentNode: NestedTreeNode<TItem> | null = null\n    let newParentDepth = 0\n    if (targetParentId === null) {\n      targetSiblings = cloned.children\n      newParentDepth = 0\n    } else {\n      const { node: targetParent } = findNode(targetParentId, cloned.children)\n      if (!targetParent || isUndefined(targetParent.children)) return null\n      targetSiblings = targetParent.children\n      newParentNode = targetParent\n      newParentDepth = calculateParentDepth(cloned, targetParentId) + 1\n    }\n\n    const subtreeDepth = calculateSubtreeDepth(node)\n    if (newParentDepth + subtreeDepth > maxDepth) return null\n\n    const sourceSiblings = parent ? (parent.children as NestedTreeNode<TItem>[]) : cloned.children\n    const sourceIdx = sourceSiblings.indexOf(node)\n    if (sourceIdx === -1) return null\n\n    const samelist = sourceSiblings === targetSiblings\n    const removed = sourceSiblings.splice(sourceIdx, 1)[0]!\n    let insertAt = targetIndex\n    if (samelist && sourceIdx < targetIndex) insertAt = targetIndex - 1\n    insertAt = Math.max(0, Math.min(insertAt, targetSiblings.length))\n    targetSiblings.splice(insertAt, 0, removed)\n    ;(removed.data as any)[parentField] = newParentNode ? getKey(newParentNode.data) : null\n    // Flag explicitly: a reparent at an unchanged position number (root pos 2 →\n    // a group's 2nd child, also pos 2) isn't caught by recalculateSiblings, so the\n    // partial save would omit it and the child reverts to root on reload (BUG-13).\n    removed.meta.dirty = true\n\n    if (!samelist) recalculateSiblings(sourceSiblings)\n    recalculateSiblings(targetSiblings)\n    model.value = cloned\n    return cloned\n  }\n\n  return {\n    viewItems,\n    findNode,\n    addItem,\n    deleteItem,\n    updateItem,\n    moveUp,\n    moveDown,\n    moveTop,\n    moveBottom,\n    indent,\n    outdent,\n    moveTo,\n    recalculatePositions,\n    calculateSubtreeDepth,\n  }\n}\n"],"mappings":";;;AAyEA,IAAMA,IAAoB,MACpBC,IAAyB,YACzBC,IAAuB;AAO7B,SAAgBC,EACd,GACA,GAC4B;CAC5B,IAAMC,IAAWC,EAAQ,YAAYL,GAC/BM,IAAaD,EAAQ,QACrBE,IAAgBF,EAAQ,iBAAiBJ,GACzCO,IAAcH,EAAQ,eAAeH,GACrCO,IAAqBJ,EAAQ,sBAAsB,GACnDK,IAAWL,EAAQ,UAEnBM,KAAU,MAAgCL,IAAaA,EAAWM,CAAI,IAAKA,EAAKR,IAEhFS,KAAyB,MAAwC;EACrE,IAAI,CAACC,EAAK,YAAYA,EAAK,SAAS,WAAW,GAAG,OAAO;EACzD,IAAIC,IAAM;EACV,KAAK,IAAMC,KAASF,EAAK,UAAU;GACjC,IAAMG,IAAIJ,EAAsBG,CAAK;GACrC,AAAIC,IAAIF,MAAK,IAAME;EACrB;EACA,OAAOF,IAAM;CACf,GAEMG,KACJ,GACA,IAA+BC,EAAM,MAAM,UAC3C,IAAuC,SAC0C;EACjF,KAAK,IAAMC,KAAQC,GAAK;GACtB,IAAIV,EAAOS,EAAK,IAAI,MAAME,GAAI,OAAO;IAAE,MAAMF;IAAM;GAAO;GAC1D,IAAIA,EAAK,YAAYA,EAAK,SAAS,SAAS,GAAG;IAC7C,IAAMG,IAAQL,EAASI,GAAIF,EAAK,UAAUA,CAAI;IAC9C,IAAIG,EAAM,MAAM,OAAOA;GACzB;EACF;EACA,OAAO;GAAE,MAAM;GAAM,QAAQ;EAAK;CACpC,GAEMC,KAAuB,GAAmC,IAAoC,WAAW;EAC7G,IAAInB,EAAQ,oBAAoB,IAAO;EAEvC,KADiBA,EAAQ,sBAAsBoB,CAAM,KAAK,gBACzC,mBAAmB;GAClC,IAAIA,MAAW,QAAQ;GACvB,IAAMC,IAASC,EAAS,KAAK,MAAMC,EAAE,KAAKrB,EAAc;GAGxD,IAAI,CAACmB,EAAO,OAAO,MAAM,OAAOG,KAAM,YAAY,OAAO,SAASA,CAAC,CAAC,GAAG;IACrE,QAAQ,KACN,6EAA6EtB,EAAc,2BAEzF,KAAK,UAAUmB,CAAM,IACrB,iCACJ;IACA;GACF;GACA,IAAMI,IAASJ,EAAoB,MAAM,CAAC,CAAC,MAAM,GAAG,MAAMK,IAAIC,CAAC;GAC/D,EAAS,SAAS,GAAS,MAAM;IAC/B,AAAIC,EAAQ,KAAK1B,OAAmBuB,EAAMI,OACvC,EAAS,KAAa3B,KAAiBuB,EAAMI,IAC9C,EAAQ,KAAK,QAAQ;GAEzB,CAAC;GACD;EACF;EACA,IAAIC,IAAM,IAAI1B;EACd,KAAK,IAAMwB,KAAWN,GAOpB,AANIM,EAAQ,KAAK1B,OAAmB4B,MACjC,EAAS,KAAa5B,KAAiB4B,GAGxC,EAAQ,KAAK,QAAQ,KAEvB,KAAO1B;CAEX,GAEM2B,KAAkB,MAA4B;EAClD,IAAMC,KAAQ,MAAiC;GAC7C,EAAoBhB,CAAG;GACvB,KAAK,IAAMD,KAAQC,GAAK,AAAID,EAAK,YAAYA,EAAK,SAAS,UAAQiB,EAAKjB,EAAK,QAAQ;EACvF;EACA,EAAKkB,EAAK,QAAQ;CACpB,GAEMC,KAAwB,MAA+C;EAC3E,IAAMC,IAASC,EAAUH,CAAI;EAE7B,OADAF,EAAeI,CAAM,GACdA;CACT,GAEME,KAAkB,MAAqD;EAC3E,IAAMC,IAAgC,CAAC,GACjCC,IAAevC,EAAQ,cAAc,OACvCwC,IAAY,GACVR,KAAQ,GAAgC,GAAe,MAA6C;GACxG,KAAK,IAAIH,IAAI,GAAGA,IAAIY,EAAM,QAAQ,KAAK;IACrC,IAAMhC,IAAOgC,EAAMZ,IACba,IAAMpC,EAAOG,EAAK,IAAI,GACtBkC,IAAkB,CAACC,EAAYnC,EAAK,QAAQ,GAC5CoC,IAAcF,MAAoBlC,EAAK,UAAU,UAAU,KAAK,GAChEqC,IAAgBrC,EAAK,UAAU,UAAU,GACzCsC,IAAa,MAAeR,EAAa,IAAIG,CAAG,GAChDM,IAAiB3C,KAAY4C,IAAQ,IACrCC,IAAcP,KAAmBK,IAAiB,GAClDG,IAAaF,IAAQ,GACrBG,IAAYvB,IAAI;IAqBtB,AApBAS,EAAK,KAAK;KACR;KACA,OAAO;KACP,KAAK7B,EAAK;KACV,UAAUA,EAAK,KAAKP;KACpB;KACA;KACA,QAAQmD,GAAY,QAAQ;KAC5B,WAAWA,IAAa/C,EAAO+C,EAAW,IAAI,IAAI;KAClD;KACA;KACA;KACA,cAAcxB;KACd,cAAcY,EAAM;KACpB,eAAeZ,MAAM;KACrB,cAAcA,MAAMY,EAAM,SAAS;KACnC;KACA;KACA;IACF,CAAC,GACGI,KAAeE,KACjBf,EAAKvB,EAAK,UAAqCwC,IAAQ,GAAGxC,CAAI;GAElE;EACF;EAEA,OADAuB,EAAKC,EAAK,UAAU,GAAG,IAAI,GACpBK;CACT,GAEMgB,IAAYC,QAAwClB,EAAevB,EAAM,KAAK,CAAC,GAE/E0C,KAAe,GAAmC,GAAkB,MAAmC;EAC3G,EAAS,OAAOC,IAAW,GAAG,GAAGC,CAAO;CAC1C,GAEMC,KAAsB,GAAmC,MAAgC;EAC7F,IAAI,CAACC,GAAM,OAAOtC,EAAS;EAC3B,IAAIsC,EAAK,YAAY,KAAA,GAAW;GAC9B,IAAMC,IAAMvC,EAAS,WAAW,MAAMhB,EAAOiB,EAAE,IAAI,MAAMqC,EAAK,OAAO;GACrE,OAAOC,MAAQ,KAAKvC,EAAS,SAASuC,IAAM;EAC9C;EAQA,OAPID,EAAK,eAAe,KAAA,IAIpBA,EAAK,UAAU,KAAA,IAGZtC,EAAS,SAFP,KAAK,IAAI,GAAG,KAAK,IAAIsC,EAAK,OAAOtC,EAAS,MAAM,CAAC,IAJpDsC,EAAK,aAAa,IAAUtC,EAAS,SAClC,KAAK,IAAIsC,EAAK,aAAa,GAAGtC,EAAS,MAAM;CAMxD,GAEMwC,KACJ,GACA,MAKsB;EACtB,IAAM3B,IAASC,EAAUtB,EAAM,KAAK,GAC9B6B,IAAkBiB,GAAM,mBAAmB,IAC3CF,IAAiC;GACrC,MAAMtB,EAAU7B,CAAI;GACpB,UAAUoC,IAAkB,CAAC,IAAI,KAAA;GACjC,MAAM,EAAE,OAAO,GAAM;EACvB,GAEIoB,IAA0C5B,EAAO,UACjDkB,IAA2C;EAE/C,IAAIO,GAAM,aAAa,KAAA,KAAaA,EAAK,aAAa,MAAM;GAC1D,IAAM,EAAE,YAAS/C,EAAS+C,EAAK,UAAUzB,EAAO,QAAQ;GACxD,AAAI1B,KAAQA,EAAK,aACf,IAAiBA,EAAK,UACtB,IAAaA;EAEjB;EAEA,IAAImD,GAAM,YAAY,KAAA,GAAW;GAC/B,IAAM,EAAE,MAAMI,GAAW,QAAQC,MAAgBpD,EAAS+C,EAAK,SAASzB,EAAO,QAAQ;GACvF,IAAI6B,GAAW;IACb,IAAM1C,IAAW2C,IAAeA,EAAY,WAAuC9B,EAAO,UACpF0B,IAAMvC,EAAS,QAAQ0C,CAAS;IACtC,IAAIH,MAAQ,IAKV,OAJAL,EAAYlC,GAAUuC,GAAKH,CAAO,GACjC,EAAS,KAAavD,KAAe8D,IAAc3D,EAAO2D,EAAY,IAAI,IAAI,MAC/E9C,EAAoBG,GAAU,KAAK,GACnC,EAAM,QAAQa,GACPA;GAEX;EACF;EAEA,IAAM+B,IAAYN,GAAM,eAAe,IAAID,EAAmBI,GAAgBH,CAAI;EAKlF,OAJAG,EAAe,OAAOG,GAAW,GAAGR,CAAO,GAC1C,EAAS,KAAavD,KAAekD,IAAa/C,EAAO+C,EAAW,IAAI,IAAI,MAC7ElC,EAAoB4C,GAAgB,KAAK,GACzC,EAAM,QAAQ5B,GACPA;CACT,GAIMgC,KAAc,GAAmB,MAAqD;EAC1F,IAAMhC,IAASC,EAAUtB,EAAM,KAAK,GAC9B,EAAE,SAAM,cAAWD,EAASI,GAAIkB,EAAO,QAAQ;EACrD,IAAI,CAAC1B,GAAM,OAAO0B;EAClB,IAAMb,IAAW8C,IAAUA,EAAO,WAAuCjC,EAAO,UAC1E0B,IAAMvC,EAAS,QAAQb,CAAI;EAKjC,OAJIoD,MAAQ,OACZvC,EAAS,OAAOuC,GAAK,CAAC,GAClBQ,GAAM,aAAa,MAAOlD,EAAoBG,GAAU,QAAQ,GACpE,EAAM,QAAQa,IACPA;CACT,GAEMmC,KAAc,GAAmB,GAAa,IAAY,OAA4B;EAC1F,IAAMnC,IAASC,EAAUtB,EAAM,KAAK,GAC9B,EAAE,YAASD,EAASI,GAAIkB,EAAO,QAAQ;EAO7C,OANK1B,MACL,EAAK,OAAO2B,EAAU7B,CAAI,GAGtBgE,MAAW,EAAK,KAAK,QAAQ,KACjC,EAAM,QAAQpC,IACPA;CACT,GAEMqC,KACJ,GACA,GACA,MAC6B;EAC7B,IAAM,EAAE,SAAM,cAAW3D,EAASI,GAAIkB,EAAO,QAAQ;EACrD,IAAI,CAAC1B,GAAM,OAAO;EAClB,IAAMa,IAAW8C,IAAUA,EAAO,WAAuCjC,EAAO,UAC1E0B,IAAMvC,EAAS,QAAQb,CAAI;EACjC,IAAIoD,MAAQ,IAAI,OAAO;EACvB,IAAMY,IAASC,EAAepD,GAAUuC,CAAG;EAC3C,IAAIY,MAAW,QAAQA,MAAWZ,GAAK,OAAO;EAC9C,IAAMc,IAAUrD,EAAS,OAAOuC,GAAK,CAAC,CAAC,CAAC;EAIxC,OAHAvC,EAAS,OAAOmD,GAAQ,GAAGE,CAAO,GAC9B3E,EAAQ,oBAAoB,OAAO,EAAQ,KAAK,QAAQ,KAC5DmB,EAAoBG,CAAQ,GACrBa;CACT,GAEMyC,KAAU,MAAgD;EAC9D,IAAMzC,IAASC,EAAUtB,EAAM,KAAK,GAC9B+D,IAAML,EAAarC,GAAQlB,IAAK,GAAI,MAAS4C,IAAM,IAAIA,IAAM,IAAI,IAAK;EAE5E,OADIgB,MAAK,EAAM,QAAQA,IAChBA;CACT,GAEMC,KAAY,MAAgD;EAChE,IAAM3C,IAASC,EAAUtB,EAAM,KAAK,GAC9B+D,IAAML,EAAarC,GAAQlB,IAAK,GAAG,MAAS4C,IAAMtC,EAAE,SAAS,IAAIsC,IAAM,IAAI,IAAK;EAEtF,OADIgB,MAAK,EAAM,QAAQA,IAChBA;CACT,GAEME,KAAW,MAAgD;EAC/D,IAAM5C,IAASC,EAAUtB,EAAM,KAAK,GAC9B+D,IAAML,EAAarC,GAAQlB,IAAK,GAAI,MAAS4C,IAAM,IAAI,IAAI,IAAK;EAEtE,OADIgB,MAAK,EAAM,QAAQA,IAChBA;CACT,GAEMG,KAAc,MAAgD;EAClE,IAAM7C,IAASC,EAAUtB,EAAM,KAAK,GAC9B+D,IAAML,EAAarC,GAAQlB,IAAK,GAAG,MAAS4C,IAAMtC,EAAE,SAAS,IAAIA,EAAE,SAAS,IAAI,IAAK;EAE3F,OADIsD,MAAK,EAAM,QAAQA,IAChBA;CACT,GAOMI,KAAU,MAAgD;EAC9D,IAAM9C,IAASC,EAAUtB,EAAM,KAAK,GAC9B,EAAE,SAAM,cAAWD,EAASI,GAAIkB,EAAO,QAAQ;EACrD,IAAI,CAAC1B,GAAM,OAAO;EAClB,IAAMa,IAAW8C,IAAUA,EAAO,WAAuCjC,EAAO,UAC1E0B,IAAMvC,EAAS,QAAQb,CAAI;EACjC,IAAIoD,KAAO,GAAG,OAAO;EACrB,IAAMqB,IAAO5D,EAASuC,IAAM;EAC5B,IAAIjB,EAAYsC,EAAK,QAAQ,GAAG,OAAO;EACvC,IAAMC,IAAe3E,EAAsBC,CAAI;EAY/C,OAXkB2E,EAAqBjD,GAAQ7B,EAAO4E,EAAK,IAAI,CAC3D,IAAY,IAAIC,IAAe9E,IAAiB,QAEpDiB,EAAS,OAAOuC,GAAK,CAAC,GACtBqB,EAAK,SAAU,KAAKzE,CAAI,GACvB,EAAM,KAAaN,KAAeG,EAAO4E,EAAK,IAAI,GAEnD,EAAK,KAAK,QAAQ,IAClB/D,EAAoBG,CAAQ,GAC5BH,EAAoB+D,EAAK,QAAS,GAClC,EAAM,QAAQ/C,GACPA;CACT,GAMMkD,KAAW,MAAgD;EAC/D,IAAMlD,IAASC,EAAUtB,EAAM,KAAK,GAC9B,EAAE,SAAM,cAAWD,EAASI,GAAIkB,EAAO,QAAQ;EACrD,IAAI,CAAC1B,KAAQ,CAAC2D,GAAQ,OAAO;EAE7B,IAAM,EAAE,QAAQkB,MAAgBzE,EAASP,EAAO8D,EAAO,IAAI,GAAGjC,EAAO,QAAQ,GACvEoD,IAAgBD,IAAeA,EAAY,WAAuCnD,EAAO,UACzFqD,IAAYD,EAAc,QAAQnB,CAAM;EAC9C,IAAIoB,MAAc,IAAI,OAAO;EAE7B,IAAMC,IAAkBrB,EAAO,UACzBP,IAAM4B,EAAgB,QAAQhF,CAAI;EAWxC,OAVIoD,MAAQ,KAAW,QACvB4B,EAAgB,OAAO5B,GAAK,CAAC,GAC7B0B,EAAc,OAAOC,IAAY,GAAG,GAAG/E,CAAI,GAC1C,EAAM,KAAaN,KAAemF,IAAchF,EAAOgF,EAAY,IAAI,IAAI,MAE5E,EAAK,KAAK,QAAQ,IAElBnE,EAAoBsE,CAAe,GACnCtE,EAAoBoE,CAAa,GACjC,EAAM,QAAQpD,GACPA;CACT,GAEMiD,KAAwB,GAAyB,MAA8B;EACnF,IAAMpD,KAAQ,GAA8B,MAAiC;GAC3E,KAAK,IAAMjB,KAAQC,GAAK;IACtB,IAAIV,EAAOS,EAAK,IAAI,MAAME,GAAI,OAAOgC;IACrC,IAAIlC,EAAK,YAAYA,EAAK,SAAS,QAAQ;KACzC,IAAMH,IAAIoB,EAAKjB,EAAK,UAAUkC,IAAQ,CAAC;KACvC,IAAIrC,MAAM,MAAM,OAAOA;IACzB;GACF;GACA,OAAO;EACT;EACA,OAAOoB,EAAKC,EAAK,UAAU,CAAC,KAAK;CACnC;CAkEA,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,SAvEA,GACA,GACA,MAC6B;GAC7B,IAAME,IAASC,EAAUtB,EAAM,KAAK,GAC9B,EAAE,SAAM,cAAWD,EAASI,GAAIkB,EAAO,QAAQ;GACrD,IAAI,CAAC1B,GAAM,OAAO;GAElB,IAAIiF,MAAmB,MAAM;IAC3B,IAAMC,KAAgB,MAAsC;KAC1D,IAAI,CAACC,EAAE,UAAU,OAAO;KACxB,KAAK,IAAMC,KAAKD,EAAE,UAEhB,IADItF,EAAOuF,EAAE,IAAI,MAAMH,KACnBC,EAAaE,CAAC,GAAG,OAAO;KAE9B,OAAO;IACT;IACA,IAAIvF,EAAOG,EAAK,IAAI,MAAMiF,KAAkBC,EAAalF,CAAI,GAAG,OAAO;GACzE;GAEA,IAAIsD,GACA+B,IAA8C,MAC9CC,IAAiB;GACrB,IAAIL,MAAmB,MAErB,AADA,IAAiBvD,EAAO,UACxB,IAAiB;QACZ;IACL,IAAM,EAAE,MAAM6D,MAAiBnF,EAAS6E,GAAgBvD,EAAO,QAAQ;IACvE,IAAI,CAAC6D,KAAgBpD,EAAYoD,EAAa,QAAQ,GAAG,OAAO;IAGhE,AAFA,IAAiBA,EAAa,UAC9B,IAAgBA,GAChB,IAAiBZ,EAAqBjD,GAAQuD,CAAc,IAAI;GAClE;GAEA,IAAMP,IAAe3E,EAAsBC,CAAI;GAC/C,IAAIsF,IAAiBZ,IAAe9E,GAAU,OAAO;GAErD,IAAM4F,IAAiB7B,IAAUA,EAAO,WAAuCjC,EAAO,UAChF+D,IAAYD,EAAe,QAAQxF,CAAI;GAC7C,IAAIyF,MAAc,IAAI,OAAO;GAE7B,IAAMC,IAAWF,MAAmBlC,GAC9BY,IAAUsB,EAAe,OAAOC,GAAW,CAAC,CAAC,CAAC,IAChDE,IAAWC;GAaf,OAZIF,KAAYD,IAAYG,MAAa,IAAWA,IAAc,IAClE,IAAW,KAAK,IAAI,GAAG,KAAK,IAAID,GAAUrC,EAAe,MAAM,CAAC,GAChEA,EAAe,OAAOqC,GAAU,GAAGzB,CAAO,GACzC,EAAS,KAAaxE,KAAe2F,IAAgBxF,EAAOwF,EAAc,IAAI,IAAI,MAInF,EAAQ,KAAK,QAAQ,IAEhBK,KAAUhF,EAAoB8E,CAAc,GACjD9E,EAAoB4C,CAAc,GAClC,EAAM,QAAQ5B,GACPA;EACT;EAeE;EACA;CACF;AACF"}
+{"version":3,"file":"useNestedListEditor.js","names":["DEFAULT_KEY_FIELD","DEFAULT_POSITION_FIELD","DEFAULT_PARENT_FIELD","useNestedListEditor","keyField","options","resolveKey","positionField","parentField","positionMultiplier","maxDepth","getKey","data","calculateSubtreeDepth","node","max","child","d","findNode","model","item","arr","id","found","recalculateSiblings","action","values","siblings","s","v","slots","a","b","sibling","i","pos","recalculateAll","walk","tree","recalculatePositions","cloned","cloneDeep","buildViewItems","flat","expandedKeys","flatIndex","nodes","key","childrenAllowed","isUndefined","hasChildren","childrenCount","isExpanded","remainingDepth","depth","canAddChild","canOutdent","canIndent","parentNode","viewItems","computed","insertAfter","afterIdx","newNode","resolveInsertIndex","hint","idx","addItem","targetSiblings","afterNode","afterParent","insertIdx","deleteItem","parent","opts","updateItem","markDirty","swapSiblings","target","getTargetIndex","removed","moveUp","res","moveDown","moveTop","moveBottom","indent","prev","subtreeDepth","calculateParentDepth","outdent","grandParent","grandSiblings","parentIdx","currentSiblings","targetParentId","isDescendant","n","c","newParentNode","newParentDepth","targetParent","sourceSiblings","sourceIdx","samelist","insertAt","targetIndex"],"sources":["../../../../src/domains/listEditor/composables/useNestedListEditor.ts"],"sourcesContent":["import { computed, type ComputedRef, type Ref } from 'vue'\nimport { cloneDeep, isUndefined } from '@/shared/utils/common'\nimport type {\n  ListEditorKey,\n  ListViewItem,\n  NestedTree,\n  NestedTreeNode,\n  PositionHint,\n} from '@/domains/listEditor/types/listEditorTypes'\n\nexport interface NestedViewItem<TItem> extends ListViewItem<TItem> {\n  node: NestedTreeNode<TItem>\n  depth: number\n  parent: TItem | null\n  parentKey: ListEditorKey | null\n  childrenCount: number\n  hasChildren: boolean\n  childrenAllowed: boolean\n  siblingIndex: number\n  siblingCount: number\n  firstInParent: boolean\n  lastInParent: boolean\n  canAddChild: boolean\n  canIndent: boolean\n  canOutdent: boolean\n}\n\nexport interface UseNestedListEditorOptions {\n  keyField?: string\n  /**\n   * Resolve a row's key; takes precedence over `keyField`. Pass the controller's\n   * `keyOf` so tree ops key rows the same way as dirty/validity tracking — incl.\n   * a FUNCTION get-key, which `keyField` lookup would miss.\n   */\n  getKey?: (data: any) => ListEditorKey\n  positionField?: string\n  parentField?: string\n  positionMultiplier?: number\n  /** `false` = the position field is not managed: tree ops never write it. */\n  managedPosition?: boolean\n  /** Per-action policy, as in the flat controller. Default 'renumber'. */\n  positionStrategyFor?: (action: 'add' | 'remove' | 'move') => 'renumber' | 'preserve-values'\n  maxDepth: number\n  expandedKeys?: Ref<Set<ListEditorKey>>\n}\n\nexport interface NestedListEditorApi<TItem extends Record<string, any>> {\n  viewItems: ComputedRef<NestedViewItem<TItem>[]>\n  findNode: (id: ListEditorKey) => {\n    node: NestedTreeNode<TItem> | null\n    parent: NestedTreeNode<TItem> | null\n  }\n  addItem: (\n    data: TItem,\n    hint?: PositionHint & {\n      parentId?: ListEditorKey | null\n      asFirstChild?: boolean\n      childrenAllowed?: boolean\n    }\n  ) => NestedTree<TItem>\n  deleteItem: (id: ListEditorKey, opts?: { renumber?: boolean }) => NestedTree<TItem>\n  updateItem: (id: ListEditorKey, data: TItem, markDirty?: boolean) => NestedTree<TItem>\n  moveUp: (id: ListEditorKey) => NestedTree<TItem> | null\n  moveDown: (id: ListEditorKey) => NestedTree<TItem> | null\n  moveTop: (id: ListEditorKey) => NestedTree<TItem> | null\n  moveBottom: (id: ListEditorKey) => NestedTree<TItem> | null\n  indent: (id: ListEditorKey) => NestedTree<TItem> | null\n  outdent: (id: ListEditorKey) => NestedTree<TItem> | null\n  moveTo: (id: ListEditorKey, targetParentId: ListEditorKey | null, targetIndex: number) => NestedTree<TItem> | null\n  recalculatePositions: (model: NestedTree<TItem>) => NestedTree<TItem>\n  calculateSubtreeDepth: (node: NestedTreeNode<TItem>) => number\n}\n\nconst DEFAULT_KEY_FIELD = 'id'\nconst DEFAULT_POSITION_FIELD = 'position'\nconst DEFAULT_PARENT_FIELD = 'parent'\n\n/**\n * Nested list editor core for `ANestedSortableListEditor`. Works on a tree of `{ data, children, meta }` nodes.\n * Mutators return a cloned tree and also assign it to `model.value`.\n */\nexport function useNestedListEditor<TItem extends Record<string, any>>(\n  model: Ref<NestedTree<TItem>>,\n  options: UseNestedListEditorOptions\n): NestedListEditorApi<TItem> {\n  const keyField = options.keyField ?? DEFAULT_KEY_FIELD\n  const resolveKey = options.getKey\n  const positionField = options.positionField ?? DEFAULT_POSITION_FIELD\n  const parentField = options.parentField ?? DEFAULT_PARENT_FIELD\n  const positionMultiplier = options.positionMultiplier ?? 1\n  const maxDepth = options.maxDepth\n\n  const getKey = (data: TItem): ListEditorKey => (resolveKey ? resolveKey(data) : (data[keyField] as ListEditorKey))\n\n  const calculateSubtreeDepth = (node: NestedTreeNode<TItem>): number => {\n    if (!node.children || node.children.length === 0) return 1\n    let max = 0\n    for (const child of node.children) {\n      const d = calculateSubtreeDepth(child)\n      if (d > max) max = d\n    }\n    return max + 1\n  }\n\n  const findNode = (\n    id: ListEditorKey,\n    arr: NestedTreeNode<TItem>[] = model.value.children,\n    parent: NestedTreeNode<TItem> | null = null\n  ): { node: NestedTreeNode<TItem> | null; parent: NestedTreeNode<TItem> | null } => {\n    for (const item of arr) {\n      if (getKey(item.data) === id) return { node: item, parent }\n      if (item.children && item.children.length > 0) {\n        const found = findNode(id, item.children, item)\n        if (found.node) return found\n      }\n    }\n    return { node: null, parent: null }\n  }\n\n  const recalculateSiblings = (siblings: NestedTreeNode<TItem>[], action: 'add' | 'remove' | 'move' = 'move') => {\n    if (options.managedPosition === false) return\n    const strategy = options.positionStrategyFor?.(action) ?? 'renumber'\n    if (strategy === 'preserve-values') {\n      if (action !== 'move') return\n      const values = siblings.map((s) => s.data[positionField])\n      // Same as the flat editor: without a finite number on every row there is no slot set to move through.\n      // Inventing one would write a wrong payload.\n      if (!values.every((v) => typeof v === 'number' && Number.isFinite(v))) {\n        console.warn(\n          `[listEditor] position strategy \"preserve-values\" needs a finite numeric \\`${positionField}\\` ` +\n            'on every row; found ' +\n            JSON.stringify(values) +\n            ' — leaving positions untouched.'\n        )\n        return\n      }\n      const slots = (values as number[]).slice().sort((a, b) => a - b)\n      siblings.forEach((sibling, i) => {\n        if (sibling.data[positionField] !== slots[i]) {\n          ;(sibling.data as any)[positionField] = slots[i]\n          sibling.meta.dirty = true\n        }\n      })\n      return\n    }\n    let pos = 1 * positionMultiplier\n    for (const sibling of siblings) {\n      if (sibling.data[positionField] !== pos) {\n        ;(sibling.data as any)[positionField] = pos\n        // Flag dirty so a partial-subset save persists the new position;\n        // otherwise reorders are lost on reload and rows collide on old positions.\n        sibling.meta.dirty = true\n      }\n      pos += positionMultiplier\n    }\n  }\n\n  const recalculateAll = (tree: NestedTree<TItem>) => {\n    const walk = (arr: NestedTreeNode<TItem>[]) => {\n      recalculateSiblings(arr)\n      for (const item of arr) if (item.children && item.children.length) walk(item.children)\n    }\n    walk(tree.children)\n  }\n\n  const recalculatePositions = (tree: NestedTree<TItem>): NestedTree<TItem> => {\n    const cloned = cloneDeep(tree) as NestedTree<TItem>\n    recalculateAll(cloned)\n    return cloned\n  }\n\n  const buildViewItems = (tree: NestedTree<TItem>): NestedViewItem<TItem>[] => {\n    const flat: NestedViewItem<TItem>[] = []\n    const expandedKeys = options.expandedKeys?.value\n    let flatIndex = 0\n    const walk = (nodes: NestedTreeNode<TItem>[], depth: number, parentNode: NestedTreeNode<TItem> | null) => {\n      for (let i = 0; i < nodes.length; i++) {\n        const node = nodes[i]!\n        const key = getKey(node.data)\n        const childrenAllowed = !isUndefined(node.children)\n        const hasChildren = childrenAllowed && (node.children?.length ?? 0) > 0\n        const childrenCount = node.children?.length ?? 0\n        const isExpanded = expandedKeys ? expandedKeys.has(key) : true\n        const remainingDepth = maxDepth - (depth + 1)\n        const canAddChild = childrenAllowed && remainingDepth > 0\n        const canOutdent = depth > 0\n        const canIndent = i > 0\n        flat.push({\n          key,\n          index: flatIndex++,\n          raw: node.data,\n          position: node.data[positionField] as number | undefined,\n          node,\n          depth,\n          parent: parentNode?.data ?? null,\n          parentKey: parentNode ? getKey(parentNode.data) : null,\n          childrenCount,\n          hasChildren,\n          childrenAllowed,\n          siblingIndex: i,\n          siblingCount: nodes.length,\n          firstInParent: i === 0,\n          lastInParent: i === nodes.length - 1,\n          canAddChild,\n          canIndent,\n          canOutdent,\n        })\n        if (hasChildren && isExpanded) {\n          walk(node.children as NestedTreeNode<TItem>[], depth + 1, node)\n        }\n      }\n    }\n    walk(tree.children, 0, null)\n    return flat\n  }\n\n  const viewItems = computed<NestedViewItem<TItem>[]>(() => buildViewItems(model.value))\n\n  const insertAfter = (siblings: NestedTreeNode<TItem>[], afterIdx: number, newNode: NestedTreeNode<TItem>) => {\n    siblings.splice(afterIdx + 1, 0, newNode)\n  }\n\n  const resolveInsertIndex = (siblings: NestedTreeNode<TItem>[], hint?: PositionHint): number => {\n    if (!hint) return siblings.length\n    if (hint.afterId !== undefined) {\n      const idx = siblings.findIndex((s) => getKey(s.data) === hint.afterId)\n      return idx === -1 ? siblings.length : idx + 1\n    }\n    if (hint.afterIndex !== undefined) {\n      if (hint.afterIndex < 0) return siblings.length\n      return Math.min(hint.afterIndex + 1, siblings.length)\n    }\n    if (hint.index !== undefined) {\n      return Math.max(0, Math.min(hint.index, siblings.length))\n    }\n    return siblings.length\n  }\n\n  const addItem = (\n    data: TItem,\n    hint?: PositionHint & {\n      parentId?: ListEditorKey | null\n      asFirstChild?: boolean\n      childrenAllowed?: boolean\n    }\n  ): NestedTree<TItem> => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const childrenAllowed = hint?.childrenAllowed ?? true\n    const newNode: NestedTreeNode<TItem> = {\n      data: cloneDeep(data) as TItem,\n      children: childrenAllowed ? [] : undefined,\n      meta: { dirty: false },\n    }\n\n    let targetSiblings: NestedTreeNode<TItem>[] = cloned.children\n    let parentNode: NestedTreeNode<TItem> | null = null\n\n    if (hint?.parentId !== undefined && hint.parentId !== null) {\n      const { node } = findNode(hint.parentId, cloned.children)\n      if (node && node.children) {\n        targetSiblings = node.children\n        parentNode = node\n      }\n    }\n\n    if (hint?.afterId !== undefined) {\n      const { node: afterNode, parent: afterParent } = findNode(hint.afterId, cloned.children)\n      if (afterNode) {\n        const siblings = afterParent ? (afterParent.children as NestedTreeNode<TItem>[]) : cloned.children\n        const idx = siblings.indexOf(afterNode)\n        if (idx !== -1) {\n          insertAfter(siblings, idx, newNode)\n          ;(newNode.data as any)[parentField] = afterParent ? getKey(afterParent.data) : null\n          recalculateSiblings(siblings, 'add')\n          model.value = cloned\n          return cloned\n        }\n      }\n    }\n\n    const insertIdx = hint?.asFirstChild ? 0 : resolveInsertIndex(targetSiblings, hint)\n    targetSiblings.splice(insertIdx, 0, newNode)\n    ;(newNode.data as any)[parentField] = parentNode ? getKey(parentNode.data) : null\n    recalculateSiblings(targetSiblings, 'add')\n    model.value = cloned\n    return cloned\n  }\n\n  // `renumber: false` keeps sibling positions. The row is already\n  // deleted on the backend, which does not renumber either.\n  // So the editor keeps the same gap the server has.\n  const deleteItem = (id: ListEditorKey, opts?: { renumber?: boolean }): NestedTree<TItem> => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const { node, parent } = findNode(id, cloned.children)\n    if (!node) return cloned\n    const siblings = parent ? (parent.children as NestedTreeNode<TItem>[]) : cloned.children\n    const idx = siblings.indexOf(node)\n    if (idx === -1) return cloned\n    siblings.splice(idx, 1)\n    if (opts?.renumber !== false) recalculateSiblings(siblings, 'remove')\n    model.value = cloned\n    return cloned\n  }\n\n  const updateItem = (id: ListEditorKey, data: TItem, markDirty = true): NestedTree<TItem> => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const { node } = findNode(id, cloned.children)\n    if (!node) return cloned\n    node.data = cloneDeep(data) as TItem\n    // An edit must be persisted by partial-subset saves. `markDirty=false` is for\n    // snapshot restore on edit-cancel, which must NOT flag the node dirty.\n    if (markDirty) node.meta.dirty = true\n    model.value = cloned\n    return cloned\n  }\n\n  const swapSiblings = (\n    cloned: NestedTree<TItem>,\n    id: ListEditorKey,\n    getTargetIndex: (siblings: NestedTreeNode<TItem>[], currentIdx: number) => number | null\n  ): NestedTree<TItem> | null => {\n    const { node, parent } = findNode(id, cloned.children)\n    if (!node) return null\n    const siblings = parent ? (parent.children as NestedTreeNode<TItem>[]) : cloned.children\n    const idx = siblings.indexOf(node)\n    if (idx === -1) return null\n    const target = getTargetIndex(siblings, idx)\n    if (target === null || target === idx) return null\n    const removed = siblings.splice(idx, 1)[0]!\n    siblings.splice(target, 0, removed)\n    if (options.managedPosition === false) removed.meta.dirty = true\n    recalculateSiblings(siblings)\n    return cloned\n  }\n\n  const moveUp = (id: ListEditorKey): NestedTree<TItem> | null => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const res = swapSiblings(cloned, id, (_s, idx) => (idx > 0 ? idx - 1 : null))\n    if (res) model.value = res\n    return res\n  }\n\n  const moveDown = (id: ListEditorKey): NestedTree<TItem> | null => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const res = swapSiblings(cloned, id, (s, idx) => (idx < s.length - 1 ? idx + 1 : null))\n    if (res) model.value = res\n    return res\n  }\n\n  const moveTop = (id: ListEditorKey): NestedTree<TItem> | null => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const res = swapSiblings(cloned, id, (_s, idx) => (idx > 0 ? 0 : null))\n    if (res) model.value = res\n    return res\n  }\n\n  const moveBottom = (id: ListEditorKey): NestedTree<TItem> | null => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const res = swapSiblings(cloned, id, (s, idx) => (idx < s.length - 1 ? s.length - 1 : null))\n    if (res) model.value = res\n    return res\n  }\n\n  /**\n   * Indent: move the item under its previous sibling as its last child.\n   * Fails if: no previous sibling, previous sibling doesn't allow children,\n   * or the resulting depth would exceed maxDepth.\n   */\n  const indent = (id: ListEditorKey): NestedTree<TItem> | null => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const { node, parent } = findNode(id, cloned.children)\n    if (!node) return null\n    const siblings = parent ? (parent.children as NestedTreeNode<TItem>[]) : cloned.children\n    const idx = siblings.indexOf(node)\n    if (idx <= 0) return null\n    const prev = siblings[idx - 1]!\n    if (isUndefined(prev.children)) return null\n    const subtreeDepth = calculateSubtreeDepth(node)\n    const prevDepth = calculateParentDepth(cloned, getKey(prev.data))\n    if (prevDepth + 1 + subtreeDepth > maxDepth) return null\n\n    siblings.splice(idx, 1)\n    prev.children!.push(node)\n    ;(node.data as any)[parentField] = getKey(prev.data)\n    // Persist the reparent even when the position number is unchanged (QA 85050 BUG-13).\n    node.meta.dirty = true\n    recalculateSiblings(siblings)\n    recalculateSiblings(prev.children!)\n    model.value = cloned\n    return cloned\n  }\n\n  /**\n   * Outdent: move the item up one level — it becomes the next sibling of its current parent.\n   * Fails if the item is already at root.\n   */\n  const outdent = (id: ListEditorKey): NestedTree<TItem> | null => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const { node, parent } = findNode(id, cloned.children)\n    if (!node || !parent) return null\n\n    const { parent: grandParent } = findNode(getKey(parent.data), cloned.children)\n    const grandSiblings = grandParent ? (grandParent.children as NestedTreeNode<TItem>[]) : cloned.children\n    const parentIdx = grandSiblings.indexOf(parent)\n    if (parentIdx === -1) return null\n\n    const currentSiblings = parent.children as NestedTreeNode<TItem>[]\n    const idx = currentSiblings.indexOf(node)\n    if (idx === -1) return null\n    currentSiblings.splice(idx, 1)\n    grandSiblings.splice(parentIdx + 1, 0, node)\n    ;(node.data as any)[parentField] = grandParent ? getKey(grandParent.data) : null\n    // Persist the reparent even when the position number is unchanged (QA 85050 BUG-13).\n    node.meta.dirty = true\n\n    recalculateSiblings(currentSiblings)\n    recalculateSiblings(grandSiblings)\n    model.value = cloned\n    return cloned\n  }\n\n  const calculateParentDepth = (tree: NestedTree<TItem>, id: ListEditorKey): number => {\n    const walk = (arr: NestedTreeNode<TItem>[], depth: number): number | null => {\n      for (const item of arr) {\n        if (getKey(item.data) === id) return depth\n        if (item.children && item.children.length) {\n          const d = walk(item.children, depth + 1)\n          if (d !== null) return d\n        }\n      }\n      return null\n    }\n    return walk(tree.children, 0) ?? 0\n  }\n\n  /**\n   * Move a node to a specific parent at a specific index. Used by drag/drop.\n   * Respects maxDepth — returns null if the move would exceed it.\n   */\n  const moveTo = (\n    id: ListEditorKey,\n    targetParentId: ListEditorKey | null,\n    targetIndex: number\n  ): NestedTree<TItem> | null => {\n    const cloned = cloneDeep(model.value) as NestedTree<TItem>\n    const { node, parent } = findNode(id, cloned.children)\n    if (!node) return null\n\n    if (targetParentId !== null) {\n      const isDescendant = (n: NestedTreeNode<TItem>): boolean => {\n        if (!n.children) return false\n        for (const c of n.children) {\n          if (getKey(c.data) === targetParentId) return true\n          if (isDescendant(c)) return true\n        }\n        return false\n      }\n      if (getKey(node.data) === targetParentId || isDescendant(node)) return null\n    }\n\n    let targetSiblings: NestedTreeNode<TItem>[]\n    let newParentNode: NestedTreeNode<TItem> | null = null\n    let newParentDepth = 0\n    if (targetParentId === null) {\n      targetSiblings = cloned.children\n      newParentDepth = 0\n    } else {\n      const { node: targetParent } = findNode(targetParentId, cloned.children)\n      if (!targetParent || isUndefined(targetParent.children)) return null\n      targetSiblings = targetParent.children\n      newParentNode = targetParent\n      newParentDepth = calculateParentDepth(cloned, targetParentId) + 1\n    }\n\n    const subtreeDepth = calculateSubtreeDepth(node)\n    if (newParentDepth + subtreeDepth > maxDepth) return null\n\n    const sourceSiblings = parent ? (parent.children as NestedTreeNode<TItem>[]) : cloned.children\n    const sourceIdx = sourceSiblings.indexOf(node)\n    if (sourceIdx === -1) return null\n\n    const samelist = sourceSiblings === targetSiblings\n    const removed = sourceSiblings.splice(sourceIdx, 1)[0]!\n    let insertAt = targetIndex\n    if (samelist && sourceIdx < targetIndex) insertAt = targetIndex - 1\n    insertAt = Math.max(0, Math.min(insertAt, targetSiblings.length))\n    targetSiblings.splice(insertAt, 0, removed)\n    ;(removed.data as any)[parentField] = newParentNode ? getKey(newParentNode.data) : null\n    // Flag explicitly: a reparent at an unchanged position number (root pos 2 →\n    // a group's 2nd child, also pos 2) isn't caught by recalculateSiblings, so the\n    // partial save would omit it and the child reverts to root on reload (BUG-13).\n    removed.meta.dirty = true\n\n    if (!samelist) recalculateSiblings(sourceSiblings)\n    recalculateSiblings(targetSiblings)\n    model.value = cloned\n    return cloned\n  }\n\n  return {\n    viewItems,\n    findNode,\n    addItem,\n    deleteItem,\n    updateItem,\n    moveUp,\n    moveDown,\n    moveTop,\n    moveBottom,\n    indent,\n    outdent,\n    moveTo,\n    recalculatePositions,\n    calculateSubtreeDepth,\n  }\n}\n"],"mappings":";;;AAyEA,IAAMA,IAAoB,MACpBC,IAAyB,YACzBC,IAAuB;AAM7B,SAAgBC,EACd,GACA,GAC4B;CAC5B,IAAMC,IAAWC,EAAQ,YAAYL,GAC/BM,IAAaD,EAAQ,QACrBE,IAAgBF,EAAQ,iBAAiBJ,GACzCO,IAAcH,EAAQ,eAAeH,GACrCO,IAAqBJ,EAAQ,sBAAsB,GACnDK,IAAWL,EAAQ,UAEnBM,KAAU,MAAgCL,IAAaA,EAAWM,CAAI,IAAKA,EAAKR,IAEhFS,KAAyB,MAAwC;EACrE,IAAI,CAACC,EAAK,YAAYA,EAAK,SAAS,WAAW,GAAG,OAAO;EACzD,IAAIC,IAAM;EACV,KAAK,IAAMC,KAASF,EAAK,UAAU;GACjC,IAAMG,IAAIJ,EAAsBG,CAAK;GACrC,AAAIC,IAAIF,MAAK,IAAME;EACrB;EACA,OAAOF,IAAM;CACf,GAEMG,KACJ,GACA,IAA+BC,EAAM,MAAM,UAC3C,IAAuC,SAC0C;EACjF,KAAK,IAAMC,KAAQC,GAAK;GACtB,IAAIV,EAAOS,EAAK,IAAI,MAAME,GAAI,OAAO;IAAE,MAAMF;IAAM;GAAO;GAC1D,IAAIA,EAAK,YAAYA,EAAK,SAAS,SAAS,GAAG;IAC7C,IAAMG,IAAQL,EAASI,GAAIF,EAAK,UAAUA,CAAI;IAC9C,IAAIG,EAAM,MAAM,OAAOA;GACzB;EACF;EACA,OAAO;GAAE,MAAM;GAAM,QAAQ;EAAK;CACpC,GAEMC,KAAuB,GAAmC,IAAoC,WAAW;EAC7G,IAAInB,EAAQ,oBAAoB,IAAO;EAEvC,KADiBA,EAAQ,sBAAsBoB,CAAM,KAAK,gBACzC,mBAAmB;GAClC,IAAIA,MAAW,QAAQ;GACvB,IAAMC,IAASC,EAAS,KAAK,MAAMC,EAAE,KAAKrB,EAAc;GAGxD,IAAI,CAACmB,EAAO,OAAO,MAAM,OAAOG,KAAM,YAAY,OAAO,SAASA,CAAC,CAAC,GAAG;IACrE,QAAQ,KACN,6EAA6EtB,EAAc,2BAEzF,KAAK,UAAUmB,CAAM,IACrB,iCACJ;IACA;GACF;GACA,IAAMI,IAASJ,EAAoB,MAAM,CAAC,CAAC,MAAM,GAAG,MAAMK,IAAIC,CAAC;GAC/D,EAAS,SAAS,GAAS,MAAM;IAC/B,AAAIC,EAAQ,KAAK1B,OAAmBuB,EAAMI,OACvC,EAAS,KAAa3B,KAAiBuB,EAAMI,IAC9C,EAAQ,KAAK,QAAQ;GAEzB,CAAC;GACD;EACF;EACA,IAAIC,IAAM,IAAI1B;EACd,KAAK,IAAMwB,KAAWN,GAOpB,AANIM,EAAQ,KAAK1B,OAAmB4B,MACjC,EAAS,KAAa5B,KAAiB4B,GAGxC,EAAQ,KAAK,QAAQ,KAEvB,KAAO1B;CAEX,GAEM2B,KAAkB,MAA4B;EAClD,IAAMC,KAAQ,MAAiC;GAC7C,EAAoBhB,CAAG;GACvB,KAAK,IAAMD,KAAQC,GAAK,AAAID,EAAK,YAAYA,EAAK,SAAS,UAAQiB,EAAKjB,EAAK,QAAQ;EACvF;EACA,EAAKkB,EAAK,QAAQ;CACpB,GAEMC,KAAwB,MAA+C;EAC3E,IAAMC,IAASC,EAAUH,CAAI;EAE7B,OADAF,EAAeI,CAAM,GACdA;CACT,GAEME,KAAkB,MAAqD;EAC3E,IAAMC,IAAgC,CAAC,GACjCC,IAAevC,EAAQ,cAAc,OACvCwC,IAAY,GACVR,KAAQ,GAAgC,GAAe,MAA6C;GACxG,KAAK,IAAIH,IAAI,GAAGA,IAAIY,EAAM,QAAQ,KAAK;IACrC,IAAMhC,IAAOgC,EAAMZ,IACba,IAAMpC,EAAOG,EAAK,IAAI,GACtBkC,IAAkB,CAACC,EAAYnC,EAAK,QAAQ,GAC5CoC,IAAcF,MAAoBlC,EAAK,UAAU,UAAU,KAAK,GAChEqC,IAAgBrC,EAAK,UAAU,UAAU,GACzCsC,IAAa,MAAeR,EAAa,IAAIG,CAAG,GAChDM,IAAiB3C,KAAY4C,IAAQ,IACrCC,IAAcP,KAAmBK,IAAiB,GAClDG,IAAaF,IAAQ,GACrBG,IAAYvB,IAAI;IAqBtB,AApBAS,EAAK,KAAK;KACR;KACA,OAAO;KACP,KAAK7B,EAAK;KACV,UAAUA,EAAK,KAAKP;KACpB;KACA;KACA,QAAQmD,GAAY,QAAQ;KAC5B,WAAWA,IAAa/C,EAAO+C,EAAW,IAAI,IAAI;KAClD;KACA;KACA;KACA,cAAcxB;KACd,cAAcY,EAAM;KACpB,eAAeZ,MAAM;KACrB,cAAcA,MAAMY,EAAM,SAAS;KACnC;KACA;KACA;IACF,CAAC,GACGI,KAAeE,KACjBf,EAAKvB,EAAK,UAAqCwC,IAAQ,GAAGxC,CAAI;GAElE;EACF;EAEA,OADAuB,EAAKC,EAAK,UAAU,GAAG,IAAI,GACpBK;CACT,GAEMgB,IAAYC,QAAwClB,EAAevB,EAAM,KAAK,CAAC,GAE/E0C,KAAe,GAAmC,GAAkB,MAAmC;EAC3G,EAAS,OAAOC,IAAW,GAAG,GAAGC,CAAO;CAC1C,GAEMC,KAAsB,GAAmC,MAAgC;EAC7F,IAAI,CAACC,GAAM,OAAOtC,EAAS;EAC3B,IAAIsC,EAAK,YAAY,KAAA,GAAW;GAC9B,IAAMC,IAAMvC,EAAS,WAAW,MAAMhB,EAAOiB,EAAE,IAAI,MAAMqC,EAAK,OAAO;GACrE,OAAOC,MAAQ,KAAKvC,EAAS,SAASuC,IAAM;EAC9C;EAQA,OAPID,EAAK,eAAe,KAAA,IAIpBA,EAAK,UAAU,KAAA,IAGZtC,EAAS,SAFP,KAAK,IAAI,GAAG,KAAK,IAAIsC,EAAK,OAAOtC,EAAS,MAAM,CAAC,IAJpDsC,EAAK,aAAa,IAAUtC,EAAS,SAClC,KAAK,IAAIsC,EAAK,aAAa,GAAGtC,EAAS,MAAM;CAMxD,GAEMwC,KACJ,GACA,MAKsB;EACtB,IAAM3B,IAASC,EAAUtB,EAAM,KAAK,GAC9B6B,IAAkBiB,GAAM,mBAAmB,IAC3CF,IAAiC;GACrC,MAAMtB,EAAU7B,CAAI;GACpB,UAAUoC,IAAkB,CAAC,IAAI,KAAA;GACjC,MAAM,EAAE,OAAO,GAAM;EACvB,GAEIoB,IAA0C5B,EAAO,UACjDkB,IAA2C;EAE/C,IAAIO,GAAM,aAAa,KAAA,KAAaA,EAAK,aAAa,MAAM;GAC1D,IAAM,EAAE,YAAS/C,EAAS+C,EAAK,UAAUzB,EAAO,QAAQ;GACxD,AAAI1B,KAAQA,EAAK,aACf,IAAiBA,EAAK,UACtB,IAAaA;EAEjB;EAEA,IAAImD,GAAM,YAAY,KAAA,GAAW;GAC/B,IAAM,EAAE,MAAMI,GAAW,QAAQC,MAAgBpD,EAAS+C,EAAK,SAASzB,EAAO,QAAQ;GACvF,IAAI6B,GAAW;IACb,IAAM1C,IAAW2C,IAAeA,EAAY,WAAuC9B,EAAO,UACpF0B,IAAMvC,EAAS,QAAQ0C,CAAS;IACtC,IAAIH,MAAQ,IAKV,OAJAL,EAAYlC,GAAUuC,GAAKH,CAAO,GACjC,EAAS,KAAavD,KAAe8D,IAAc3D,EAAO2D,EAAY,IAAI,IAAI,MAC/E9C,EAAoBG,GAAU,KAAK,GACnC,EAAM,QAAQa,GACPA;GAEX;EACF;EAEA,IAAM+B,IAAYN,GAAM,eAAe,IAAID,EAAmBI,GAAgBH,CAAI;EAKlF,OAJAG,EAAe,OAAOG,GAAW,GAAGR,CAAO,GAC1C,EAAS,KAAavD,KAAekD,IAAa/C,EAAO+C,EAAW,IAAI,IAAI,MAC7ElC,EAAoB4C,GAAgB,KAAK,GACzC,EAAM,QAAQ5B,GACPA;CACT,GAKMgC,KAAc,GAAmB,MAAqD;EAC1F,IAAMhC,IAASC,EAAUtB,EAAM,KAAK,GAC9B,EAAE,SAAM,cAAWD,EAASI,GAAIkB,EAAO,QAAQ;EACrD,IAAI,CAAC1B,GAAM,OAAO0B;EAClB,IAAMb,IAAW8C,IAAUA,EAAO,WAAuCjC,EAAO,UAC1E0B,IAAMvC,EAAS,QAAQb,CAAI;EAKjC,OAJIoD,MAAQ,OACZvC,EAAS,OAAOuC,GAAK,CAAC,GAClBQ,GAAM,aAAa,MAAOlD,EAAoBG,GAAU,QAAQ,GACpE,EAAM,QAAQa,IACPA;CACT,GAEMmC,KAAc,GAAmB,GAAa,IAAY,OAA4B;EAC1F,IAAMnC,IAASC,EAAUtB,EAAM,KAAK,GAC9B,EAAE,YAASD,EAASI,GAAIkB,EAAO,QAAQ;EAO7C,OANK1B,MACL,EAAK,OAAO2B,EAAU7B,CAAI,GAGtBgE,MAAW,EAAK,KAAK,QAAQ,KACjC,EAAM,QAAQpC,IACPA;CACT,GAEMqC,KACJ,GACA,GACA,MAC6B;EAC7B,IAAM,EAAE,SAAM,cAAW3D,EAASI,GAAIkB,EAAO,QAAQ;EACrD,IAAI,CAAC1B,GAAM,OAAO;EAClB,IAAMa,IAAW8C,IAAUA,EAAO,WAAuCjC,EAAO,UAC1E0B,IAAMvC,EAAS,QAAQb,CAAI;EACjC,IAAIoD,MAAQ,IAAI,OAAO;EACvB,IAAMY,IAASC,EAAepD,GAAUuC,CAAG;EAC3C,IAAIY,MAAW,QAAQA,MAAWZ,GAAK,OAAO;EAC9C,IAAMc,IAAUrD,EAAS,OAAOuC,GAAK,CAAC,CAAC,CAAC;EAIxC,OAHAvC,EAAS,OAAOmD,GAAQ,GAAGE,CAAO,GAC9B3E,EAAQ,oBAAoB,OAAO,EAAQ,KAAK,QAAQ,KAC5DmB,EAAoBG,CAAQ,GACrBa;CACT,GAEMyC,KAAU,MAAgD;EAC9D,IAAMzC,IAASC,EAAUtB,EAAM,KAAK,GAC9B+D,IAAML,EAAarC,GAAQlB,IAAK,GAAI,MAAS4C,IAAM,IAAIA,IAAM,IAAI,IAAK;EAE5E,OADIgB,MAAK,EAAM,QAAQA,IAChBA;CACT,GAEMC,KAAY,MAAgD;EAChE,IAAM3C,IAASC,EAAUtB,EAAM,KAAK,GAC9B+D,IAAML,EAAarC,GAAQlB,IAAK,GAAG,MAAS4C,IAAMtC,EAAE,SAAS,IAAIsC,IAAM,IAAI,IAAK;EAEtF,OADIgB,MAAK,EAAM,QAAQA,IAChBA;CACT,GAEME,KAAW,MAAgD;EAC/D,IAAM5C,IAASC,EAAUtB,EAAM,KAAK,GAC9B+D,IAAML,EAAarC,GAAQlB,IAAK,GAAI,MAAS4C,IAAM,IAAI,IAAI,IAAK;EAEtE,OADIgB,MAAK,EAAM,QAAQA,IAChBA;CACT,GAEMG,KAAc,MAAgD;EAClE,IAAM7C,IAASC,EAAUtB,EAAM,KAAK,GAC9B+D,IAAML,EAAarC,GAAQlB,IAAK,GAAG,MAAS4C,IAAMtC,EAAE,SAAS,IAAIA,EAAE,SAAS,IAAI,IAAK;EAE3F,OADIsD,MAAK,EAAM,QAAQA,IAChBA;CACT,GAOMI,KAAU,MAAgD;EAC9D,IAAM9C,IAASC,EAAUtB,EAAM,KAAK,GAC9B,EAAE,SAAM,cAAWD,EAASI,GAAIkB,EAAO,QAAQ;EACrD,IAAI,CAAC1B,GAAM,OAAO;EAClB,IAAMa,IAAW8C,IAAUA,EAAO,WAAuCjC,EAAO,UAC1E0B,IAAMvC,EAAS,QAAQb,CAAI;EACjC,IAAIoD,KAAO,GAAG,OAAO;EACrB,IAAMqB,IAAO5D,EAASuC,IAAM;EAC5B,IAAIjB,EAAYsC,EAAK,QAAQ,GAAG,OAAO;EACvC,IAAMC,IAAe3E,EAAsBC,CAAI;EAY/C,OAXkB2E,EAAqBjD,GAAQ7B,EAAO4E,EAAK,IAAI,CAC3D,IAAY,IAAIC,IAAe9E,IAAiB,QAEpDiB,EAAS,OAAOuC,GAAK,CAAC,GACtBqB,EAAK,SAAU,KAAKzE,CAAI,GACvB,EAAM,KAAaN,KAAeG,EAAO4E,EAAK,IAAI,GAEnD,EAAK,KAAK,QAAQ,IAClB/D,EAAoBG,CAAQ,GAC5BH,EAAoB+D,EAAK,QAAS,GAClC,EAAM,QAAQ/C,GACPA;CACT,GAMMkD,KAAW,MAAgD;EAC/D,IAAMlD,IAASC,EAAUtB,EAAM,KAAK,GAC9B,EAAE,SAAM,cAAWD,EAASI,GAAIkB,EAAO,QAAQ;EACrD,IAAI,CAAC1B,KAAQ,CAAC2D,GAAQ,OAAO;EAE7B,IAAM,EAAE,QAAQkB,MAAgBzE,EAASP,EAAO8D,EAAO,IAAI,GAAGjC,EAAO,QAAQ,GACvEoD,IAAgBD,IAAeA,EAAY,WAAuCnD,EAAO,UACzFqD,IAAYD,EAAc,QAAQnB,CAAM;EAC9C,IAAIoB,MAAc,IAAI,OAAO;EAE7B,IAAMC,IAAkBrB,EAAO,UACzBP,IAAM4B,EAAgB,QAAQhF,CAAI;EAWxC,OAVIoD,MAAQ,KAAW,QACvB4B,EAAgB,OAAO5B,GAAK,CAAC,GAC7B0B,EAAc,OAAOC,IAAY,GAAG,GAAG/E,CAAI,GAC1C,EAAM,KAAaN,KAAemF,IAAchF,EAAOgF,EAAY,IAAI,IAAI,MAE5E,EAAK,KAAK,QAAQ,IAElBnE,EAAoBsE,CAAe,GACnCtE,EAAoBoE,CAAa,GACjC,EAAM,QAAQpD,GACPA;CACT,GAEMiD,KAAwB,GAAyB,MAA8B;EACnF,IAAMpD,KAAQ,GAA8B,MAAiC;GAC3E,KAAK,IAAMjB,KAAQC,GAAK;IACtB,IAAIV,EAAOS,EAAK,IAAI,MAAME,GAAI,OAAOgC;IACrC,IAAIlC,EAAK,YAAYA,EAAK,SAAS,QAAQ;KACzC,IAAMH,IAAIoB,EAAKjB,EAAK,UAAUkC,IAAQ,CAAC;KACvC,IAAIrC,MAAM,MAAM,OAAOA;IACzB;GACF;GACA,OAAO;EACT;EACA,OAAOoB,EAAKC,EAAK,UAAU,CAAC,KAAK;CACnC;CAkEA,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,SAvEA,GACA,GACA,MAC6B;GAC7B,IAAME,IAASC,EAAUtB,EAAM,KAAK,GAC9B,EAAE,SAAM,cAAWD,EAASI,GAAIkB,EAAO,QAAQ;GACrD,IAAI,CAAC1B,GAAM,OAAO;GAElB,IAAIiF,MAAmB,MAAM;IAC3B,IAAMC,KAAgB,MAAsC;KAC1D,IAAI,CAACC,EAAE,UAAU,OAAO;KACxB,KAAK,IAAMC,KAAKD,EAAE,UAEhB,IADItF,EAAOuF,EAAE,IAAI,MAAMH,KACnBC,EAAaE,CAAC,GAAG,OAAO;KAE9B,OAAO;IACT;IACA,IAAIvF,EAAOG,EAAK,IAAI,MAAMiF,KAAkBC,EAAalF,CAAI,GAAG,OAAO;GACzE;GAEA,IAAIsD,GACA+B,IAA8C,MAC9CC,IAAiB;GACrB,IAAIL,MAAmB,MAErB,AADA,IAAiBvD,EAAO,UACxB,IAAiB;QACZ;IACL,IAAM,EAAE,MAAM6D,MAAiBnF,EAAS6E,GAAgBvD,EAAO,QAAQ;IACvE,IAAI,CAAC6D,KAAgBpD,EAAYoD,EAAa,QAAQ,GAAG,OAAO;IAGhE,AAFA,IAAiBA,EAAa,UAC9B,IAAgBA,GAChB,IAAiBZ,EAAqBjD,GAAQuD,CAAc,IAAI;GAClE;GAEA,IAAMP,IAAe3E,EAAsBC,CAAI;GAC/C,IAAIsF,IAAiBZ,IAAe9E,GAAU,OAAO;GAErD,IAAM4F,IAAiB7B,IAAUA,EAAO,WAAuCjC,EAAO,UAChF+D,IAAYD,EAAe,QAAQxF,CAAI;GAC7C,IAAIyF,MAAc,IAAI,OAAO;GAE7B,IAAMC,IAAWF,MAAmBlC,GAC9BY,IAAUsB,EAAe,OAAOC,GAAW,CAAC,CAAC,CAAC,IAChDE,IAAWC;GAaf,OAZIF,KAAYD,IAAYG,MAAa,IAAWA,IAAc,IAClE,IAAW,KAAK,IAAI,GAAG,KAAK,IAAID,GAAUrC,EAAe,MAAM,CAAC,GAChEA,EAAe,OAAOqC,GAAU,GAAGzB,CAAO,GACzC,EAAS,KAAaxE,KAAe2F,IAAgBxF,EAAOwF,EAAc,IAAI,IAAI,MAInF,EAAQ,KAAK,QAAQ,IAEhBK,KAAUhF,EAAoB8E,CAAc,GACjD9E,EAAoB4C,CAAc,GAClC,EAAM,QAAQ5B,GACPA;EACT;EAeE;EACA;CACF;AACF"}

package/dist/domains/listEditor/composables/useNestedListEditorController.d.ts

@@ -116,10 +116,11 @@ export type ExposedNestedListEditorHandle<TItem extends Record<string, any>> = S
 /** What `ANestedSortableListEditor` exposes on top of the controller handle. */
 export interface NestedSortableListEditorExtras {
     /**
-     * Runs a tree mutation the server has already made (a row created through a dialog) and adopts as
-     * saved only the rows it added or edited, plus `keys`. Siblings it only renumbered and other pending
-     * work stay unsaved (the server may not have renumbered them), and so does the position of a created
-     * row the op renumbered. `commit()` would adopt the whole tree instead.
+     * Runs a tree mutation the server already made (e.g. a row created through a dialog).
+     * Adopts as saved only the rows it added or edited, plus `keys`.
+     * Siblings it only renumbered, other pending work and a renumbered position of
+     * a created row stay unsaved, because the server may not have renumbered them.
+     * `commit()` would adopt the whole tree instead.
      */
     acceptChanges: (op: () => void, keys?: ListEditorKey[]) => void;
     enterReorderMode: () => void;