@anzusystems/common-admin 2.0.0-rc.1 → 2.0.0-rc.10

package/dist/domains/listEditor/composables/useInlineEditing.js

@@ -1,6 +1,6 @@
 import { cloneDeep as e } from "../../../shared/utils/common.js";
 import { nextTick as t, ref as n, watch as r } from "vue";
-//#region src/domains/listEditor/composables/useInlineEditing.ts
+// src/domains/listEditor/composables/useInlineEditing.ts
 function i(i) {
 	let a = n(/* @__PURE__ */ new Set()), o = n(/* @__PURE__ */ new Map()), s = n(!1);
 	return r(i.watchKeys, (n, r) => {
@@ -42,7 +42,6 @@ function i(i) {
 		}
 	};
 }
-//#endregion
 export { i as useInlineEditing };
 
 //# sourceMappingURL=useInlineEditing.js.map

package/dist/domains/listEditor/composables/useIsTouchDevice.js

@@ -1,6 +1,6 @@
 import { computed as e } from "vue";
 import { useMediaQuery as t } from "@vueuse/core";
-//#region src/domains/listEditor/composables/useIsTouchDevice.ts
+// src/domains/listEditor/composables/useIsTouchDevice.ts
 function n() {
 	let n = t("(any-pointer: fine)");
 	return e(() => !n.value);
@@ -9,7 +9,6 @@ function r() {
 	let n = t("(any-pointer: coarse)");
 	return e(() => n.value);
 }
-//#endregion
 export { r as useHasCoarsePointer, n as useIsTouchDevice };
 
 //# sourceMappingURL=useIsTouchDevice.js.map

package/dist/domains/listEditor/composables/useKeyboardNav.js

@@ -1,5 +1,5 @@
 import { computed as e, ref as t, watch as n } from "vue";
-//#region src/domains/listEditor/composables/useKeyboardNav.ts
+// src/domains/listEditor/composables/useKeyboardNav.ts
 function r(r) {
 	let i = t(null), a = t(null), o = e(() => r.viewItems.value.map((e) => e.key)), s = (e) => i.value === e, c = (e) => a.value === e, l = e(() => a.value === null ? -1 : o.value.indexOf(a.value)), u = e(() => o.value.length);
 	function d(e) {
@@ -36,7 +36,7 @@ function r(r) {
 		return !!e?.matches?.("input, textarea, select, [contenteditable], [contenteditable=\"true\"]");
 	}
 	function _(e, t) {
-		if (r.disabled?.value) return;
+		if (t.defaultPrevented || r.disabled?.value) return;
 		let n = o.value, i = n.indexOf(e);
 		if (i < 0) return;
 		let s = r.viewItems.value[i], c = r.isReorderMode.value, l = a.value === e, u = a.value !== null, d = g(t.target);
@@ -100,7 +100,6 @@ function r(r) {
 		handleKeydown: _
 	};
 }
-//#endregion
 export { r as useKeyboardNav };
 
 //# sourceMappingURL=useKeyboardNav.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"useKeyboardNav.js","names":["el","useKeyboardNav","focusedKey","ref","grabbedKey","orderedKeys","computed","options","v","isFocused","key","isGrabbed","grabbedIndex","totalCount","rowTabindex","ordered","focusRowElement","setFocus","prevOrderedKeys","watch","now","oldIndex","releaseGrab","isFormField","target","handleKeydown","focusedItem","inReorder","isGrabbedNow","grabbedSomewhere","onFormField","e"],"sources":["../../../../src/domains/listEditor/composables/useKeyboardNav.ts"],"sourcesContent":["import { computed, ref, watch, type ComputedRef, type Ref } from 'vue'\nimport type { ListEditorKey } from '@/domains/listEditor/types/listEditorTypes'\n\nexport interface KeyboardNavViewItem {\n  key: ListEditorKey\n  expanded?: boolean\n  canExpand?: boolean\n  canIndent?: boolean\n  canOutdent?: boolean\n}\n\nexport type KeyboardNavVariant = 'flat' | 'sortable' | 'nested'\n\nexport interface KeyboardNavOptions {\n  viewItems: ComputedRef<KeyboardNavViewItem[]>\n  variant: KeyboardNavVariant\n  isReorderMode: Ref<boolean> | ComputedRef<boolean>\n  disabled?: Ref<boolean> | ComputedRef<boolean>\n\n  isEditing: (key: ListEditorKey) => boolean\n\n  onToggleEdit?: (key: ListEditorKey) => void\n  onCancelEdit?: (key: ListEditorKey) => void\n\n  onMoveUp?: (key: ListEditorKey) => void\n  onMoveDown?: (key: ListEditorKey) => void\n  onMoveTop?: (key: ListEditorKey) => void\n  onMoveBottom?: (key: ListEditorKey) => void\n\n  onIndent?: (key: ListEditorKey) => void\n  onOutdent?: (key: ListEditorKey) => void\n  onToggleChildren?: (key: ListEditorKey, expand: boolean) => void\n\n  onCancelReorder?: () => void\n}\n\nexport interface KeyboardNavApi {\n  focusedKey: Ref<ListEditorKey | null>\n  grabbedKey: Ref<ListEditorKey | null>\n  /** 0-based index of the grabbed row in the current ordering, or -1 if no grab. */\n  grabbedIndex: ComputedRef<number>\n  /** Total count of rows currently in the editor. */\n  totalCount: ComputedRef<number>\n  isFocused: (key: ListEditorKey) => boolean\n  isGrabbed: (key: ListEditorKey) => boolean\n  rowTabindex: (key: ListEditorKey) => number\n  setFocus: (key: ListEditorKey | null) => void\n  releaseGrab: () => void\n  handleKeydown: (key: ListEditorKey, e: KeyboardEvent) => void\n}\n\n// Roving tabindex + keyboard navigation for list-editor rows. Single tabstop\n// per editor; arrow keys move an internal pointer; reorder mode adds a \"grab\"\n// state where Enter/Space picks up the focused row and arrows move it.\nexport function useKeyboardNav(options: KeyboardNavOptions): KeyboardNavApi {\n  const focusedKey = ref<ListEditorKey | null>(null)\n  const grabbedKey = ref<ListEditorKey | null>(null)\n\n  const orderedKeys = computed<ListEditorKey[]>(() => options.viewItems.value.map((v) => v.key))\n\n  const isFocused = (key: ListEditorKey): boolean => focusedKey.value === key\n  const isGrabbed = (key: ListEditorKey): boolean => grabbedKey.value === key\n\n  const grabbedIndex = computed<number>(() => {\n    if (grabbedKey.value === null) return -1\n    return orderedKeys.value.indexOf(grabbedKey.value)\n  })\n\n  const totalCount = computed<number>(() => orderedKeys.value.length)\n\n  function rowTabindex(key: ListEditorKey): number {\n    const ordered = orderedKeys.value\n    if (ordered.length === 0) return -1\n    if (focusedKey.value === null) return ordered[0] === key ? 0 : -1\n    return focusedKey.value === key ? 0 : -1\n  }\n\n  function focusRowElement(key: ListEditorKey | null) {\n    if (key === null || typeof document === 'undefined') return\n    void Promise.resolve().then(() => {\n      const el = document.querySelector<HTMLElement>(`[data-id=\"${CSS.escape(String(key))}\"]`)\n      el?.focus()\n    })\n  }\n\n  function setFocus(key: ListEditorKey | null) {\n    focusedKey.value = key\n    focusRowElement(key)\n  }\n\n  // When the focused row is removed (e.g. via delete), fall to the row that\n  // took its slot, or to the new last row if it was at the end. Without this,\n  // focus vanishes to <body> after a delete and the user has to Tab back in.\n  // We snapshot the previous ordering so we can look up where the focused key\n  // *was* — by the time the watcher fires, the key is already gone from `now`.\n  // eslint-disable-next-line vue/no-ref-object-reactivity-loss\n  let prevOrderedKeys: ListEditorKey[] = [...orderedKeys.value]\n  watch(orderedKeys, (now) => {\n    if (focusedKey.value === null) {\n      prevOrderedKeys = [...now]\n      return\n    }\n    if (now.includes(focusedKey.value)) {\n      prevOrderedKeys = [...now]\n      return\n    }\n    if (now.length === 0) {\n      focusedKey.value = null\n      prevOrderedKeys = []\n      return\n    }\n    const oldIndex = prevOrderedKeys.indexOf(focusedKey.value)\n    const fallbackIndex = Math.min(Math.max(oldIndex, 0), now.length - 1)\n    setFocus(now[fallbackIndex]!)\n    prevOrderedKeys = [...now]\n  })\n\n  // Releasing a grab when the grabbed row is no longer in the list — keeps the\n  // grab state consistent if the row gets removed externally.\n  watch(orderedKeys, (now) => {\n    if (grabbedKey.value !== null && !now.includes(grabbedKey.value)) {\n      grabbedKey.value = null\n    }\n  })\n\n  function releaseGrab() {\n    grabbedKey.value = null\n  }\n\n  function isFormField(target: EventTarget | null): boolean {\n    const el = target as HTMLElement | null\n    return !!el?.matches?.('input, textarea, select, [contenteditable], [contenteditable=\"true\"]')\n  }\n\n  function handleKeydown(key: ListEditorKey, e: KeyboardEvent) {\n    if (options.disabled?.value) return\n\n    const ordered = orderedKeys.value\n    const i = ordered.indexOf(key)\n    if (i < 0) return\n\n    // `ordered` is these view items' keys, so `i` indexes them too.\n    const focusedItem = options.viewItems.value[i]!\n    const inReorder = options.isReorderMode.value\n    const isGrabbedNow = grabbedKey.value === key\n    const grabbedSomewhere = grabbedKey.value !== null\n\n    // Form fields keep native key behavior (cursor, newlines, selection) for\n    // every key except Escape. Esc still closes the edit panel even mid-typing.\n    const onFormField = isFormField(e.target)\n\n    switch (e.key) {\n      case 'ArrowUp':\n        if (onFormField) return\n        e.preventDefault()\n        if (inReorder && isGrabbedNow) {\n          options.onMoveUp?.(key)\n        } else if (i > 0) {\n          setFocus(ordered[i - 1]!)\n        }\n        return\n\n      case 'ArrowDown':\n        if (onFormField) return\n        e.preventDefault()\n        if (inReorder && isGrabbedNow) {\n          options.onMoveDown?.(key)\n        } else if (i < ordered.length - 1) {\n          setFocus(ordered[i + 1]!)\n        }\n        return\n\n      case 'Home':\n        if (onFormField) return\n        e.preventDefault()\n        if (inReorder && isGrabbedNow) {\n          options.onMoveTop?.(key)\n        } else if (ordered.length > 0) {\n          setFocus(ordered[0]!)\n        }\n        return\n\n      case 'End':\n        if (onFormField) return\n        e.preventDefault()\n        if (inReorder && isGrabbedNow) {\n          options.onMoveBottom?.(key)\n        } else if (ordered.length > 0) {\n          setFocus(ordered[ordered.length - 1]!)\n        }\n        return\n\n      case 'ArrowLeft':\n        if (options.variant !== 'nested' || onFormField) return\n        e.preventDefault()\n        if (inReorder && isGrabbedNow && focusedItem.canOutdent) {\n          options.onOutdent?.(key)\n        } else if (focusedItem.expanded) {\n          options.onToggleChildren?.(key, false)\n        }\n        return\n\n      case 'ArrowRight':\n        if (options.variant !== 'nested' || onFormField) return\n        e.preventDefault()\n        if (inReorder && isGrabbedNow && focusedItem.canIndent) {\n          options.onIndent?.(key)\n        } else if (focusedItem.canExpand && !focusedItem.expanded) {\n          options.onToggleChildren?.(key, true)\n        }\n        return\n\n      case 'Enter':\n      case ' ': // Space\n        if (onFormField) return\n        e.preventDefault()\n        if (inReorder) {\n          if (isGrabbedNow) {\n            grabbedKey.value = null\n          } else {\n            grabbedKey.value = key\n          }\n        } else {\n          options.onToggleEdit?.(key)\n        }\n        return\n\n      case 'Escape':\n        if (grabbedSomewhere) {\n          e.preventDefault()\n          grabbedKey.value = null\n          return\n        }\n        if (inReorder) {\n          e.preventDefault()\n          options.onCancelReorder?.()\n          return\n        }\n        if (options.isEditing(key)) {\n          e.preventDefault()\n          options.onCancelEdit?.(key)\n          return\n        }\n        return\n\n      default:\n        return\n    }\n  }\n\n  return {\n    focusedKey,\n    grabbedKey,\n    grabbedIndex,\n    totalCount,\n    isFocused,\n    isGrabbed,\n    rowTabindex,\n    setFocus,\n    releaseGrab,\n    handleKeydown,\n  }\n}\n"],"mappings":";;AAsDA,SAAgBC,EAAe,GAA6C;CAC1E,IAAMC,IAAaC,EAA0B,IAAI,GAC3CC,IAAaD,EAA0B,IAAI,GAE3CE,IAAcC,QAAgCC,EAAQ,UAAU,MAAM,KAAK,MAAMC,EAAE,GAAG,CAAC,GAEvFC,KAAa,MAAgCP,EAAW,UAAUQ,GAClEC,KAAa,MAAgCP,EAAW,UAAUM,GAElEE,IAAeN,QACfF,EAAW,UAAU,OAAa,KAC/BC,EAAY,MAAM,QAAQD,EAAW,KAAK,CAClD,GAEKS,IAAaP,QAAuBD,EAAY,MAAM,MAAM;CAElE,SAASS,EAAY,GAA4B;EAC/C,IAAMC,IAAUV,EAAY;EAG5B,OAFIU,EAAQ,WAAW,IAAU,KAC7Bb,EAAW,UAAU,OAAaa,EAAQ,OAAOL,IAAM,IAAI,KACxDR,EAAW,UAAUQ,IAAM,IAAI;CACxC;CAEA,SAASM,EAAgB,GAA2B;EAClD,AAAIN,MAAQ,QAAQ,OAAO,WAAa,OACxC,QAAa,QAAQ,CAAC,CAAC,WAAW;GAEhC,SADoB,cAA2B,aAAa,IAAI,OAAO,OAAOA,CAAG,CAAC,EAAE,GACpF,CAAA,EAAI,MAAM;EACZ,CAAC;CACH;CAEA,SAASO,EAAS,GAA2B;EAE3C,AADA,EAAW,QAAQP,GACnBM,EAAgBN,CAAG;CACrB;CAQA,IAAIQ,IAAmC,CAAC,GAAGb,EAAY,KAAK;CAuB5D,AAtBAc,EAAMd,IAAc,MAAQ;EAK1B,IAJIH,EAAW,UAAU,QAIrBkB,EAAI,SAASlB,EAAW,KAAK,GAAG;GAClC,IAAkB,CAAC,GAAGkB,CAAG;GACzB;EACF;EACA,IAAIA,EAAI,WAAW,GAAG;GAEpB,AADA,EAAW,QAAQ,MACnB,IAAkB,CAAC;GACnB;EACF;EACA,IAAMC,IAAWH,EAAgB,QAAQhB,EAAW,KAAK;EAGzD,AADAe,EAASG,EADa,KAAK,IAAI,KAAK,IAAIC,GAAU,CAAC,GAAGD,EAAI,SAAS,CACtD,EAAe,GAC5B,IAAkB,CAAC,GAAGA,CAAG;CAC3B,CAAC,GAIDD,EAAMd,IAAc,MAAQ;EAC1B,AAAID,EAAW,UAAU,QAAQ,CAACgB,EAAI,SAAShB,EAAW,KAAK,MAC7D,EAAW,QAAQ;CAEvB,CAAC;CAED,SAASkB,IAAc;EACrB,EAAW,QAAQ;CACrB;CAEA,SAASC,EAAY,GAAqC;EAExD,OAAO,CAAC,CAACvB,GAAI,UAAU,wEAAsE;CAC/F;CAEA,SAASyB,EAAc,GAAoB,GAAkB;EAC3D,IAAIlB,EAAQ,UAAU,OAAO;EAE7B,IAAMQ,IAAUV,EAAY,OACtB,IAAIU,EAAQ,QAAQL,CAAG;EAC7B,IAAI,IAAI,GAAG;EAGX,IAAMgB,IAAcnB,EAAQ,UAAU,MAAM,IACtCoB,IAAYpB,EAAQ,cAAc,OAClCqB,IAAexB,EAAW,UAAUM,GACpCmB,IAAmBzB,EAAW,UAAU,MAIxC0B,IAAcP,EAAYQ,EAAE,MAAM;EAExC,QAAQA,EAAE,KAAV;GACE,KAAK;IACH,IAAID,GAAa;IAEjB,AADAC,EAAE,eAAe,GACbJ,KAAaC,IACfrB,EAAQ,WAAWG,CAAG,IACb,IAAI,KACbO,EAASF,EAAQ,IAAI,EAAG;IAE1B;GAEF,KAAK;IACH,IAAIe,GAAa;IAEjB,AADAC,EAAE,eAAe,GACbJ,KAAaC,IACfrB,EAAQ,aAAaG,CAAG,IACf,IAAIK,EAAQ,SAAS,KAC9BE,EAASF,EAAQ,IAAI,EAAG;IAE1B;GAEF,KAAK;IACH,IAAIe,GAAa;IAEjB,AADAC,EAAE,eAAe,GACbJ,KAAaC,IACfrB,EAAQ,YAAYG,CAAG,IACdK,EAAQ,SAAS,KAC1BE,EAASF,EAAQ,EAAG;IAEtB;GAEF,KAAK;IACH,IAAIe,GAAa;IAEjB,AADAC,EAAE,eAAe,GACbJ,KAAaC,IACfrB,EAAQ,eAAeG,CAAG,IACjBK,EAAQ,SAAS,KAC1BE,EAASF,EAAQA,EAAQ,SAAS,EAAG;IAEvC;GAEF,KAAK;IACH,IAAIR,EAAQ,YAAY,YAAYuB,GAAa;IAEjD,AADAC,EAAE,eAAe,GACbJ,KAAaC,KAAgBF,EAAY,aAC3CnB,EAAQ,YAAYG,CAAG,IACdgB,EAAY,YACrBnB,EAAQ,mBAAmBG,GAAK,EAAK;IAEvC;GAEF,KAAK;IACH,IAAIH,EAAQ,YAAY,YAAYuB,GAAa;IAEjD,AADAC,EAAE,eAAe,GACbJ,KAAaC,KAAgBF,EAAY,YAC3CnB,EAAQ,WAAWG,CAAG,IACbgB,EAAY,aAAa,CAACA,EAAY,YAC/CnB,EAAQ,mBAAmBG,GAAK,EAAI;IAEtC;GAEF,KAAK;GACL,KAAK;IACH,IAAIoB,GAAa;IAEjB,AADAC,EAAE,eAAe,GACbJ,IACEC,IACF,EAAW,QAAQ,OAEnB,EAAW,QAAQlB,IAGrBH,EAAQ,eAAeG,CAAG;IAE5B;GAEF,KAAK;IACH,IAAImB,GAAkB;KAEpB,AADAE,EAAE,eAAe,GACjB,EAAW,QAAQ;KACnB;IACF;IACA,IAAIJ,GAAW;KAEb,AADAI,EAAE,eAAe,GACjBxB,EAAQ,kBAAkB;KAC1B;IACF;IACA,IAAIA,EAAQ,UAAUG,CAAG,GAAG;KAE1B,AADAqB,EAAE,eAAe,GACjBxB,EAAQ,eAAeG,CAAG;KAC1B;IACF;IACA;GAEF,SACE;EACJ;CACF;CAEA,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;AACF"}
+{"version":3,"file":"useKeyboardNav.js","names":["el","useKeyboardNav","focusedKey","ref","grabbedKey","orderedKeys","computed","options","v","isFocused","key","isGrabbed","grabbedIndex","totalCount","rowTabindex","ordered","focusRowElement","setFocus","prevOrderedKeys","watch","now","oldIndex","releaseGrab","isFormField","target","handleKeydown","e","focusedItem","inReorder","isGrabbedNow","grabbedSomewhere","onFormField"],"sources":["../../../../src/domains/listEditor/composables/useKeyboardNav.ts"],"sourcesContent":["import { computed, ref, watch, type ComputedRef, type Ref } from 'vue'\nimport type { ListEditorKey } from '@/domains/listEditor/types/listEditorTypes'\n\nexport interface KeyboardNavViewItem {\n  key: ListEditorKey\n  expanded?: boolean\n  canExpand?: boolean\n  canIndent?: boolean\n  canOutdent?: boolean\n}\n\nexport type KeyboardNavVariant = 'flat' | 'sortable' | 'nested'\n\nexport interface KeyboardNavOptions {\n  viewItems: ComputedRef<KeyboardNavViewItem[]>\n  variant: KeyboardNavVariant\n  isReorderMode: Ref<boolean> | ComputedRef<boolean>\n  disabled?: Ref<boolean> | ComputedRef<boolean>\n\n  isEditing: (key: ListEditorKey) => boolean\n\n  onToggleEdit?: (key: ListEditorKey) => void\n  onCancelEdit?: (key: ListEditorKey) => void\n\n  onMoveUp?: (key: ListEditorKey) => void\n  onMoveDown?: (key: ListEditorKey) => void\n  onMoveTop?: (key: ListEditorKey) => void\n  onMoveBottom?: (key: ListEditorKey) => void\n\n  onIndent?: (key: ListEditorKey) => void\n  onOutdent?: (key: ListEditorKey) => void\n  onToggleChildren?: (key: ListEditorKey, expand: boolean) => void\n\n  onCancelReorder?: () => void\n}\n\nexport interface KeyboardNavApi {\n  focusedKey: Ref<ListEditorKey | null>\n  grabbedKey: Ref<ListEditorKey | null>\n  /** 0-based index of the grabbed row in the current ordering, or -1 if no grab. */\n  grabbedIndex: ComputedRef<number>\n  /** Total count of rows currently in the editor. */\n  totalCount: ComputedRef<number>\n  isFocused: (key: ListEditorKey) => boolean\n  isGrabbed: (key: ListEditorKey) => boolean\n  rowTabindex: (key: ListEditorKey) => number\n  setFocus: (key: ListEditorKey | null) => void\n  releaseGrab: () => void\n  handleKeydown: (key: ListEditorKey, e: KeyboardEvent) => void\n}\n\n// Roving tabindex + keyboard navigation for list-editor rows. Single tabstop\n// per editor; arrow keys move an internal pointer; reorder mode adds a \"grab\"\n// state where Enter/Space picks up the focused row and arrows move it.\nexport function useKeyboardNav(options: KeyboardNavOptions): KeyboardNavApi {\n  const focusedKey = ref<ListEditorKey | null>(null)\n  const grabbedKey = ref<ListEditorKey | null>(null)\n\n  const orderedKeys = computed<ListEditorKey[]>(() => options.viewItems.value.map((v) => v.key))\n\n  const isFocused = (key: ListEditorKey): boolean => focusedKey.value === key\n  const isGrabbed = (key: ListEditorKey): boolean => grabbedKey.value === key\n\n  const grabbedIndex = computed<number>(() => {\n    if (grabbedKey.value === null) return -1\n    return orderedKeys.value.indexOf(grabbedKey.value)\n  })\n\n  const totalCount = computed<number>(() => orderedKeys.value.length)\n\n  function rowTabindex(key: ListEditorKey): number {\n    const ordered = orderedKeys.value\n    if (ordered.length === 0) return -1\n    if (focusedKey.value === null) return ordered[0] === key ? 0 : -1\n    return focusedKey.value === key ? 0 : -1\n  }\n\n  function focusRowElement(key: ListEditorKey | null) {\n    if (key === null || typeof document === 'undefined') return\n    void Promise.resolve().then(() => {\n      const el = document.querySelector<HTMLElement>(`[data-id=\"${CSS.escape(String(key))}\"]`)\n      el?.focus()\n    })\n  }\n\n  function setFocus(key: ListEditorKey | null) {\n    focusedKey.value = key\n    focusRowElement(key)\n  }\n\n  // When the focused row is removed (e.g. via delete), fall to the row that\n  // took its slot, or to the new last row if it was at the end. Without this,\n  // focus vanishes to <body> after a delete and the user has to Tab back in.\n  // We snapshot the previous ordering so we can look up where the focused key\n  // *was* — by the time the watcher fires, the key is already gone from `now`.\n  // eslint-disable-next-line vue/no-ref-object-reactivity-loss\n  let prevOrderedKeys: ListEditorKey[] = [...orderedKeys.value]\n  watch(orderedKeys, (now) => {\n    if (focusedKey.value === null) {\n      prevOrderedKeys = [...now]\n      return\n    }\n    if (now.includes(focusedKey.value)) {\n      prevOrderedKeys = [...now]\n      return\n    }\n    if (now.length === 0) {\n      focusedKey.value = null\n      prevOrderedKeys = []\n      return\n    }\n    const oldIndex = prevOrderedKeys.indexOf(focusedKey.value)\n    const fallbackIndex = Math.min(Math.max(oldIndex, 0), now.length - 1)\n    setFocus(now[fallbackIndex]!)\n    prevOrderedKeys = [...now]\n  })\n\n  // Releasing a grab when the grabbed row is no longer in the list — keeps the\n  // grab state consistent if the row gets removed externally.\n  watch(orderedKeys, (now) => {\n    if (grabbedKey.value !== null && !now.includes(grabbedKey.value)) {\n      grabbedKey.value = null\n    }\n  })\n\n  function releaseGrab() {\n    grabbedKey.value = null\n  }\n\n  function isFormField(target: EventTarget | null): boolean {\n    const el = target as HTMLElement | null\n    return !!el?.matches?.('input, textarea, select, [contenteditable], [contenteditable=\"true\"]')\n  }\n\n  function handleKeydown(key: ListEditorKey, e: KeyboardEvent) {\n    // A nested row's keydown bubbles into its ancestor rows; every key handled below calls\n    // `preventDefault`, so an ancestor does not act on it a second time for its own row.\n    if (e.defaultPrevented) return\n    if (options.disabled?.value) return\n\n    const ordered = orderedKeys.value\n    const i = ordered.indexOf(key)\n    if (i < 0) return\n\n    // `ordered` is these view items' keys, so `i` indexes them too.\n    const focusedItem = options.viewItems.value[i]!\n    const inReorder = options.isReorderMode.value\n    const isGrabbedNow = grabbedKey.value === key\n    const grabbedSomewhere = grabbedKey.value !== null\n\n    // Form fields keep native key behavior (cursor, newlines, selection) for\n    // every key except Escape. Esc still closes the edit panel even mid-typing.\n    const onFormField = isFormField(e.target)\n\n    switch (e.key) {\n      case 'ArrowUp':\n        if (onFormField) return\n        e.preventDefault()\n        if (inReorder && isGrabbedNow) {\n          options.onMoveUp?.(key)\n        } else if (i > 0) {\n          setFocus(ordered[i - 1]!)\n        }\n        return\n\n      case 'ArrowDown':\n        if (onFormField) return\n        e.preventDefault()\n        if (inReorder && isGrabbedNow) {\n          options.onMoveDown?.(key)\n        } else if (i < ordered.length - 1) {\n          setFocus(ordered[i + 1]!)\n        }\n        return\n\n      case 'Home':\n        if (onFormField) return\n        e.preventDefault()\n        if (inReorder && isGrabbedNow) {\n          options.onMoveTop?.(key)\n        } else if (ordered.length > 0) {\n          setFocus(ordered[0]!)\n        }\n        return\n\n      case 'End':\n        if (onFormField) return\n        e.preventDefault()\n        if (inReorder && isGrabbedNow) {\n          options.onMoveBottom?.(key)\n        } else if (ordered.length > 0) {\n          setFocus(ordered[ordered.length - 1]!)\n        }\n        return\n\n      case 'ArrowLeft':\n        if (options.variant !== 'nested' || onFormField) return\n        e.preventDefault()\n        if (inReorder && isGrabbedNow && focusedItem.canOutdent) {\n          options.onOutdent?.(key)\n        } else if (focusedItem.expanded) {\n          options.onToggleChildren?.(key, false)\n        }\n        return\n\n      case 'ArrowRight':\n        if (options.variant !== 'nested' || onFormField) return\n        e.preventDefault()\n        if (inReorder && isGrabbedNow && focusedItem.canIndent) {\n          options.onIndent?.(key)\n        } else if (focusedItem.canExpand && !focusedItem.expanded) {\n          options.onToggleChildren?.(key, true)\n        }\n        return\n\n      case 'Enter':\n      case ' ': // Space\n        if (onFormField) return\n        e.preventDefault()\n        if (inReorder) {\n          if (isGrabbedNow) {\n            grabbedKey.value = null\n          } else {\n            grabbedKey.value = key\n          }\n        } else {\n          options.onToggleEdit?.(key)\n        }\n        return\n\n      case 'Escape':\n        if (grabbedSomewhere) {\n          e.preventDefault()\n          grabbedKey.value = null\n          return\n        }\n        if (inReorder) {\n          e.preventDefault()\n          options.onCancelReorder?.()\n          return\n        }\n        if (options.isEditing(key)) {\n          e.preventDefault()\n          options.onCancelEdit?.(key)\n          return\n        }\n        return\n\n      default:\n        return\n    }\n  }\n\n  return {\n    focusedKey,\n    grabbedKey,\n    grabbedIndex,\n    totalCount,\n    isFocused,\n    isGrabbed,\n    rowTabindex,\n    setFocus,\n    releaseGrab,\n    handleKeydown,\n  }\n}\n"],"mappings":";;AAsDA,SAAgBC,EAAe,GAA6C;CAC1E,IAAMC,IAAaC,EAA0B,IAAI,GAC3CC,IAAaD,EAA0B,IAAI,GAE3CE,IAAcC,QAAgCC,EAAQ,UAAU,MAAM,KAAK,MAAMC,EAAE,GAAG,CAAC,GAEvFC,KAAa,MAAgCP,EAAW,UAAUQ,GAClEC,KAAa,MAAgCP,EAAW,UAAUM,GAElEE,IAAeN,QACfF,EAAW,UAAU,OAAa,KAC/BC,EAAY,MAAM,QAAQD,EAAW,KAAK,CAClD,GAEKS,IAAaP,QAAuBD,EAAY,MAAM,MAAM;CAElE,SAASS,EAAY,GAA4B;EAC/C,IAAMC,IAAUV,EAAY;EAG5B,OAFIU,EAAQ,WAAW,IAAU,KAC7Bb,EAAW,UAAU,OAAaa,EAAQ,OAAOL,IAAM,IAAI,KACxDR,EAAW,UAAUQ,IAAM,IAAI;CACxC;CAEA,SAASM,EAAgB,GAA2B;EAClD,AAAIN,MAAQ,QAAQ,OAAO,WAAa,OACxC,QAAa,QAAQ,CAAC,CAAC,WAAW;GAEhC,SADoB,cAA2B,aAAa,IAAI,OAAO,OAAOA,CAAG,CAAC,EAAE,GACpF,CAAA,EAAI,MAAM;EACZ,CAAC;CACH;CAEA,SAASO,EAAS,GAA2B;EAE3C,AADA,EAAW,QAAQP,GACnBM,EAAgBN,CAAG;CACrB;CAQA,IAAIQ,IAAmC,CAAC,GAAGb,EAAY,KAAK;CAuB5D,AAtBAc,EAAMd,IAAc,MAAQ;EAK1B,IAJIH,EAAW,UAAU,QAIrBkB,EAAI,SAASlB,EAAW,KAAK,GAAG;GAClC,IAAkB,CAAC,GAAGkB,CAAG;GACzB;EACF;EACA,IAAIA,EAAI,WAAW,GAAG;GAEpB,AADA,EAAW,QAAQ,MACnB,IAAkB,CAAC;GACnB;EACF;EACA,IAAMC,IAAWH,EAAgB,QAAQhB,EAAW,KAAK;EAGzD,AADAe,EAASG,EADa,KAAK,IAAI,KAAK,IAAIC,GAAU,CAAC,GAAGD,EAAI,SAAS,CACtD,EAAe,GAC5B,IAAkB,CAAC,GAAGA,CAAG;CAC3B,CAAC,GAIDD,EAAMd,IAAc,MAAQ;EAC1B,AAAID,EAAW,UAAU,QAAQ,CAACgB,EAAI,SAAShB,EAAW,KAAK,MAC7D,EAAW,QAAQ;CAEvB,CAAC;CAED,SAASkB,IAAc;EACrB,EAAW,QAAQ;CACrB;CAEA,SAASC,EAAY,GAAqC;EAExD,OAAO,CAAC,CAACvB,GAAI,UAAU,wEAAsE;CAC/F;CAEA,SAASyB,EAAc,GAAoB,GAAkB;EAI3D,IADIC,EAAE,oBACFnB,EAAQ,UAAU,OAAO;EAE7B,IAAMQ,IAAUV,EAAY,OACtB,IAAIU,EAAQ,QAAQL,CAAG;EAC7B,IAAI,IAAI,GAAG;EAGX,IAAMiB,IAAcpB,EAAQ,UAAU,MAAM,IACtCqB,IAAYrB,EAAQ,cAAc,OAClCsB,IAAezB,EAAW,UAAUM,GACpCoB,IAAmB1B,EAAW,UAAU,MAIxC2B,IAAcR,EAAYG,EAAE,MAAM;EAExC,QAAQA,EAAE,KAAV;GACE,KAAK;IACH,IAAIK,GAAa;IAEjB,AADAL,EAAE,eAAe,GACbE,KAAaC,IACftB,EAAQ,WAAWG,CAAG,IACb,IAAI,KACbO,EAASF,EAAQ,IAAI,EAAG;IAE1B;GAEF,KAAK;IACH,IAAIgB,GAAa;IAEjB,AADAL,EAAE,eAAe,GACbE,KAAaC,IACftB,EAAQ,aAAaG,CAAG,IACf,IAAIK,EAAQ,SAAS,KAC9BE,EAASF,EAAQ,IAAI,EAAG;IAE1B;GAEF,KAAK;IACH,IAAIgB,GAAa;IAEjB,AADAL,EAAE,eAAe,GACbE,KAAaC,IACftB,EAAQ,YAAYG,CAAG,IACdK,EAAQ,SAAS,KAC1BE,EAASF,EAAQ,EAAG;IAEtB;GAEF,KAAK;IACH,IAAIgB,GAAa;IAEjB,AADAL,EAAE,eAAe,GACbE,KAAaC,IACftB,EAAQ,eAAeG,CAAG,IACjBK,EAAQ,SAAS,KAC1BE,EAASF,EAAQA,EAAQ,SAAS,EAAG;IAEvC;GAEF,KAAK;IACH,IAAIR,EAAQ,YAAY,YAAYwB,GAAa;IAEjD,AADAL,EAAE,eAAe,GACbE,KAAaC,KAAgBF,EAAY,aAC3CpB,EAAQ,YAAYG,CAAG,IACdiB,EAAY,YACrBpB,EAAQ,mBAAmBG,GAAK,EAAK;IAEvC;GAEF,KAAK;IACH,IAAIH,EAAQ,YAAY,YAAYwB,GAAa;IAEjD,AADAL,EAAE,eAAe,GACbE,KAAaC,KAAgBF,EAAY,YAC3CpB,EAAQ,WAAWG,CAAG,IACbiB,EAAY,aAAa,CAACA,EAAY,YAC/CpB,EAAQ,mBAAmBG,GAAK,EAAI;IAEtC;GAEF,KAAK;GACL,KAAK;IACH,IAAIqB,GAAa;IAEjB,AADAL,EAAE,eAAe,GACbE,IACEC,IACF,EAAW,QAAQ,OAEnB,EAAW,QAAQnB,IAGrBH,EAAQ,eAAeG,CAAG;IAE5B;GAEF,KAAK;IACH,IAAIoB,GAAkB;KAEpB,AADAJ,EAAE,eAAe,GACjB,EAAW,QAAQ;KACnB;IACF;IACA,IAAIE,GAAW;KAEb,AADAF,EAAE,eAAe,GACjBnB,EAAQ,kBAAkB;KAC1B;IACF;IACA,IAAIA,EAAQ,UAAUG,CAAG,GAAG;KAE1B,AADAgB,EAAE,eAAe,GACjBnB,EAAQ,eAAeG,CAAG;KAC1B;IACF;IACA;GAEF,SACE;EACJ;CACF;CAEA,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;AACF"}

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

@@ -115,10 +115,9 @@ export interface ListEditorHandle<TItem extends Record<string, any>> {
  */
 export type ExposedListEditorHandle<TItem extends Record<string, any>> = ShallowUnwrapRef<ListEditorHandle<TItem>>;
 /**
- * Component-owned state controller for the list editors (v2). Owns row keys,
- * declared dirty tracking (no fragile whole-list JSON diff on volatile fields),
- * validation summary, position renumbering, and the save lifecycle — exposed as
- * a `ListEditorHandle`. Created internally by an editor (default) or by a consumer
- * that passes it in as `:editor`, so the state survives unmount/remount.
+ * State controller for the list editors, exposed as a `ListEditorHandle`. Owns row keys, declared dirty
+ * tracking (no whole-list JSON diff), validation summary, position renumbering and the save lifecycle.
+ * An editor creates it by default. A consumer can create it and
+ * pass it as `:editor` so state survives unmount and remount.
  */
 export declare function useListEditorController<TItem extends Record<string, any>>(options: UseListEditorControllerOptions<TItem>): ListEditorHandle<TItem>;

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

@@ -1,18 +1,18 @@
-import { cloneDeep as e } from "../../../shared/utils/common.js";
-import { preservePositionValues as t, renumberPositions as n } from "../utils/positions.js";
-import { nextListEditorTempId as r } from "../utils/tempId.js";
+import { preservePositionValues as e, renumberPositions as t } from "../utils/positions.js";
+import { nextListEditorTempId as n } from "../utils/tempId.js";
+import { cloneDeep as r } from "../../../shared/utils/common.js";
 import { computed as i, reactive as a, ref as o, toValue as s, watch as c } from "vue";
-//#region src/domains/listEditor/composables/useListEditorController.ts
+// src/domains/listEditor/composables/useListEditorController.ts
 function l(l) {
 	let u = typeof l.getKey == "function" ? null : l.getKey ?? "id", d = (e) => typeof l.getKey == "function" ? l.getKey(e) : e[u], f = l.position ?? "position", p = f !== !1, m = typeof f == "object" ? f.field : f === !1 ? "position" : f, h = typeof f == "object" && f.multiplier ? f.multiplier : 1, g = typeof f == "object" && f.strategy || "renumber", _ = typeof f == "object" && f.strategyOverrides || {}, v = i(() => l.get()), y = i(() => s(l.dirtyExclude) ?? []), b = (e, t) => e === "id" && typeof t == "number" && t < 0 ? void 0 : t, x = (e) => {
 		let t = { ...e };
 		p && delete t[m];
 		for (let e of y.value) delete t[e];
 		return JSON.stringify(t, b);
-	}, S = o(/* @__PURE__ */ new Map()), C = o([]), w = (t) => {
-		let n = /* @__PURE__ */ new Map();
-		for (let e of t) n.set(d(e), x(e));
-		S.value = n, C.value = t.map((t) => e(t));
+	}, S = o(/* @__PURE__ */ new Map()), C = o([]), w = (e) => {
+		let t = /* @__PURE__ */ new Map();
+		for (let n of e) t.set(d(n), x(n));
+		S.value = t, C.value = e.map((e) => r(e));
 	};
 	c(y, () => {
 		let e = /* @__PURE__ */ new Map();
@@ -28,7 +28,7 @@ function l(l) {
 		return {
 			rows: e.map((e) => d(e) == null ? (t = !0, {
 				...e,
-				[u]: r()
+				[u]: n()
 			}) : e),
 			changed: t
 		};
@@ -98,10 +98,10 @@ function l(l) {
 	}), B = i(() => z.value.size > 0), V = (e, t, n = !1) => {
 		let { invalid: r, warning: i } = R(e, t);
 		return r ? O.value ? "invalid" : n ? null : N(t) || F(t) ? "invalid" : null : i ? "warning" : null;
-	}, H = () => (O.value = !0, z.value.size === 0), U = (e, r) => p ? (_[r] ?? g) === "preserve-values" ? r === "move" ? t(e, { positionField: m }) : e : n(e, {
+	}, H = () => (O.value = !0, z.value.size === 0), U = (n, r) => p ? (_[r] ?? g) === "preserve-values" ? r === "move" ? e(n, { positionField: m }) : n : t(n, {
 		positionField: m,
 		positionMultiplier: h
-	}) : e, W = (e, t) => l.set(U(e, t)), G = () => l.payload ? l.payload(l.get()) : U(l.get(), "payload"), K = () => {
+	}) : n, W = (e, t) => l.set(U(e, t)), G = () => l.payload ? l.payload(l.get()) : U(l.get(), "payload"), K = () => {
 		let e = [], t = [], n = [];
 		for (let r of l.get()) {
 			let i = d(r), a = S.value.get(i);
@@ -115,13 +115,13 @@ function l(l) {
 			reparented: []
 		};
 	}, q = (e) => {
-		let t = e ?? l.get(), n = (l.normalizeSaved ? l.normalizeSaved(t) : t).map((e) => (l.commitKey ? l.commitKey(e, C.value.find((t) => d(t) === d(e))) : d(e)) == null && u ? {
+		let t = e ?? l.get(), r = (l.normalizeSaved ? l.normalizeSaved(t) : t).map((e) => (l.commitKey ? l.commitKey(e, C.value.find((t) => d(t) === d(e))) : d(e)) == null && u ? {
 			...e,
-			[u]: r()
+			[u]: n()
 		} : e);
-		l.set(n), w(n), E.value = /* @__PURE__ */ new Set(), D.value = [], j.value = /* @__PURE__ */ new Map(), M.value = /* @__PURE__ */ new Set(), O.value = !1;
-	}, J = (t) => {
-		l.set(t ?? C.value.map((t) => e(t))), E.value = /* @__PURE__ */ new Set(), D.value = [], j.value = /* @__PURE__ */ new Map(), M.value = /* @__PURE__ */ new Set(), O.value = !1;
+		l.set(r), w(r), E.value = /* @__PURE__ */ new Set(), D.value = [], j.value = /* @__PURE__ */ new Map(), M.value = /* @__PURE__ */ new Set(), O.value = !1;
+	}, J = (e) => {
+		l.set(e ?? C.value.map((e) => r(e))), E.value = /* @__PURE__ */ new Set(), D.value = [], j.value = /* @__PURE__ */ new Map(), M.value = /* @__PURE__ */ new Set(), O.value = !1;
 	}, Y = (e, t) => e.findIndex((e) => d(e) === t);
 	return {
 		items: v,
@@ -187,7 +187,6 @@ function l(l) {
 		registerValidity: (e, t) => (k.set(e, t), () => k.delete(e))
 	};
 }
-//#endregion
 export { l as useListEditorController };
 
 //# sourceMappingURL=useListEditorController.js.map

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/useListEditorScopeValidity.js

@@ -1,6 +1,6 @@
 import { watch as e } from "vue";
 import t from "@vuelidate/core";
-//#region src/domains/listEditor/composables/useListEditorScopeValidity.ts
+// src/domains/listEditor/composables/useListEditorScopeValidity.ts
 function n(n) {
 	let { hasErrors: r, validationScope: i, reveal: a, validateProvided: o } = n;
 	if (i === void 0 || i === !1) return;
@@ -10,7 +10,6 @@ function n(n) {
 		e && r.value && a();
 	});
 }
-//#endregion
 export { n as useListEditorScopeValidity };
 
 //# sourceMappingURL=useListEditorScopeValidity.js.map

package/dist/domains/listEditor/composables/useListEditorStateScope.js

@@ -1,7 +1,7 @@
 import { useListEditorController as e } from "./useListEditorController.js";
 import { useNestedListEditorController as t } from "./useNestedListEditorController.js";
 import { effectScope as n, getCurrentInstance as r, getCurrentScope as i, inject as a, onBeforeUnmount as o, onScopeDispose as s, provide as c, shallowRef as l, toValue as u } from "vue";
-//#region src/domains/listEditor/composables/useListEditorStateScope.ts
+// src/domains/listEditor/composables/useListEditorStateScope.ts
 var d = Symbol("le.stateScope"), f = 0;
 function p() {
 	let e = `les${++f}`, t = /* @__PURE__ */ new Map(), r = n(), a = (e, n) => {
@@ -99,7 +99,6 @@ function _(e, n) {
 		childScope: i.childScope(e)
 	};
 }
-//#endregion
 export { d as ListEditorStateScopeKey, p as createListEditorStateScope, m as provideListEditorStateScope, g as useListEditorStateEntry, _ as useNestedListEditorStateEntry };
 
 //# sourceMappingURL=useListEditorStateScope.js.map

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

@@ -1,6 +1,6 @@
 import { cloneDeep as e, isUndefined as t } from "../../../shared/utils/common.js";
 import { computed as n } from "vue";
-//#region src/domains/listEditor/composables/useNestedListEditor.ts
+// src/domains/listEditor/composables/useNestedListEditor.ts
 var r = "id", i = "position", a = "parent";
 function o(o, s) {
 	let c = s.keyField ?? r, l = s.getKey, u = s.positionField ?? i, d = s.parentField ?? a, f = s.positionMultiplier ?? 1, p = s.maxDepth, m = (e) => l ? l(e) : e[c], h = (e) => {
@@ -206,7 +206,6 @@ function o(o, s) {
 		calculateSubtreeDepth: h
 	};
 }
-//#endregion
 export { o as useNestedListEditor };
 
 //# sourceMappingURL=useNestedListEditor.js.map