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

package/dist/domains/dam/uploadQueue/settlement/uploadPoller.js.map

@@ -1 +1 @@
-{"version":3,"file":"uploadPoller.js","names":["createQueuePoller","nextAt","timer","inFlight","earlierAt","followUp","lastReadEndedAt","consecutiveFailures","stopped","scheduler","uploadSettlementRuntime","sooner","planned","candidate","disarm","goIdle","arm","onTimer","deps","runRead","failed","trigger","now","age","computed","UPLOAD_POLL_ERROR_LADDER_MS","delayAfterRead","soonest","UPLOAD_POLL_MIN_GAP_MS","firstDelay","mode","sinceRead"],"sources":["../../../../../src/domains/dam/uploadQueue/settlement/uploadPoller.ts"],"sourcesContent":["import {\n  delayAfterRead,\n  firstDelay,\n  UPLOAD_POLL_ERROR_LADDER_MS,\n  UPLOAD_POLL_MIN_GAP_MS,\n  type UploadPollMode,\n} from '@/domains/dam/uploadQueue/settlement/uploadPollSchedule'\nimport { uploadSettlementRuntime } from '@/domains/dam/uploadQueue/settlement/uploadSettlementRuntime'\n\nexport interface QueuePollerDeps {\n  /** The age of the youngest tracked row of the queue in ms, or `null` when the queue tracks nothing. */\n  youngestAgeMs(): number | null\n  mode(): UploadPollMode\n  /** One read of all the tracked rows of the queue. A rejection is a failed read. */\n  read(trigger: 'tick' | 'visible'): Promise<void>\n}\n\nexport interface QueuePoller {\n  /** A row began to be tracked: the next read comes no later than its first mark. */\n  rowAdded(): void\n  /** The tab is visible again: a read at once. */\n  readNow(trigger: 'visible'): void\n  /** The tab was hidden, the mode changed or the queue tracks nothing any more: the timer is set anew. */\n  reschedule(): void\n  stop(): void\n}\n\n/** The timer of the ticks of one queue. What a tick reads is up to `deps.read`. */\nexport function createQueuePoller(deps: QueuePollerDeps): QueuePoller {\n  let nextAt: number | null = null\n  let timer: { handle: unknown } | null = null\n  let inFlight = false\n  // A sooner read asked for while one was on its way.\n  let earlierAt: number | null = null\n  let followUp = false\n  let lastReadEndedAt: number | null = null\n  let consecutiveFailures = 0\n  let stopped = false\n\n  const scheduler = () => uploadSettlementRuntime.scheduler\n  const sooner = (planned: number | null, candidate: number) =>\n    planned === null ? candidate : Math.min(planned, candidate)\n\n  const disarm = () => {\n    if (!timer) return\n    scheduler().clearTimeout(timer.handle)\n    timer = null\n  }\n\n  // The queue tracks nothing: no plan is kept for rows that are gone, and a later failure starts the ladder anew.\n  const goIdle = () => {\n    disarm()\n    nextAt = null\n    earlierAt = null\n    followUp = false\n    consecutiveFailures = 0\n  }\n\n  const arm = () => {\n    disarm()\n    if (stopped || inFlight || nextAt === null) return\n    // A hidden tab reads nothing; the planned time stays for its return.\n    if (!uploadSettlementRuntime.visibility.isVisible()) return\n    timer = { handle: scheduler().setTimeout(onTimer, Math.max(0, nextAt - scheduler().now())) }\n  }\n\n  const onTimer = () => {\n    timer = null\n    if (stopped) return\n    if (deps.youngestAgeMs() === null) {\n      goIdle()\n      return\n    }\n    if (!uploadSettlementRuntime.visibility.isVisible()) return\n    void runRead('tick')\n  }\n\n  const runRead = async (trigger: 'tick' | 'visible') => {\n    if (inFlight) {\n      followUp = true\n      return\n    }\n    disarm()\n    nextAt = null\n    inFlight = true\n    let failed = false\n    try {\n      await deps.read(trigger)\n    } catch {\n      failed = true\n    }\n    inFlight = false\n    if (stopped) return\n    const now = scheduler().now()\n    lastReadEndedAt = now\n    consecutiveFailures = failed ? consecutiveFailures + 1 : 0\n    const age = deps.youngestAgeMs()\n    if (age === null) {\n      goIdle()\n      return\n    }\n    const computed = failed\n      ? now + UPLOAD_POLL_ERROR_LADDER_MS[Math.min(consecutiveFailures, UPLOAD_POLL_ERROR_LADDER_MS.length) - 1]!\n      : now + delayAfterRead(age, deps.mode())\n    const soonest = now + UPLOAD_POLL_MIN_GAP_MS\n    nextAt = followUp ? soonest : Math.max(soonest, sooner(earlierAt, computed))\n    earlierAt = null\n    followUp = false\n    arm()\n  }\n\n  const rowAdded = () => {\n    if (stopped) return\n    const candidate = scheduler().now() + firstDelay(deps.mode())\n    // A new row only ever brings the read closer.\n    if (inFlight) {\n      earlierAt = sooner(earlierAt, candidate)\n      return\n    }\n    nextAt = sooner(nextAt, candidate)\n    arm()\n  }\n\n  const readNow = (trigger: 'visible') => {\n    if (stopped) return\n    if (inFlight) {\n      followUp = true\n      return\n    }\n    if (deps.youngestAgeMs() === null) {\n      goIdle()\n      return\n    }\n    const now = scheduler().now()\n    if (lastReadEndedAt !== null && now - lastReadEndedAt < UPLOAD_POLL_MIN_GAP_MS) {\n      nextAt = sooner(nextAt, lastReadEndedAt + UPLOAD_POLL_MIN_GAP_MS)\n      arm()\n      return\n    }\n    void runRead(trigger)\n  }\n\n  const reschedule = () => {\n    // A read on its way plans the next one itself, with the mode of that moment.\n    if (stopped || inFlight) return\n    // Before the hidden tab: a queue that empties while nobody looks keeps no plan for the return.\n    const age = deps.youngestAgeMs()\n    if (age === null) {\n      goIdle()\n      return\n    }\n    if (!uploadSettlementRuntime.visibility.isVisible()) {\n      disarm()\n      return\n    }\n    // A wait of the error ladder stands: the rhythm of a mode would plan by a read that failed.\n    if (consecutiveFailures === 0) {\n      const now = scheduler().now()\n      const mode = deps.mode()\n      const sinceRead = lastReadEndedAt === null ? null : now - lastReadEndedAt\n      // What would have been planned under the mode of now: by the last read, or by the first mark of a row that\n      // came after it. Never later than what is planned already.\n      const candidate =\n        sinceRead === null || age < sinceRead\n          ? now - age + firstDelay(mode)\n          : now - sinceRead + Math.max(UPLOAD_POLL_MIN_GAP_MS, delayAfterRead(age - sinceRead, mode))\n      nextAt = sooner(nextAt, Math.max(now, candidate))\n    }\n    arm()\n  }\n\n  const stop = () => {\n    stopped = true\n    goIdle()\n  }\n\n  return { rowAdded, readNow, reschedule, stop }\n}\n"],"mappings":";;;AA4BA,SAAgBA,EAAkB,GAAoC;CACpE,IAAIC,IAAwB,MACxBC,IAAoC,MACpCC,IAAW,IAEXC,IAA2B,MAC3BC,IAAW,IACXC,IAAiC,MACjCC,IAAsB,GACtBC,IAAU,IAERC,UAAkBC,EAAwB,WAC1CC,KAAU,GAAwB,MACtCC,MAAY,OAAOC,IAAY,KAAK,IAAID,GAASC,CAAS,GAEtDC,UAAe;EACnB,AAEAZ,OADAO,EAAU,CAAC,CAAC,aAAaP,EAAM,MAAM,GAC7B;CACV,GAGMa,UAAe;EAKnB,AAJAD,EAAO,GACP,IAAS,MACT,IAAY,MACZ,IAAW,IACX,IAAsB;CACxB,GAEME,UAAY;EAEhB,AADAF,EAAO,GACH,OAAWX,KAAYF,MAAW,SAEjCS,EAAwB,WAAW,UAAU,MAClD,IAAQ,EAAE,QAAQD,EAAU,CAAC,CAAC,WAAWQ,GAAS,KAAK,IAAI,GAAGhB,IAASQ,EAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE;CAC7F,GAEMQ,UAAgB;EAEpB,AADA,IAAQ,MACJ,OACAC,EAAK,cAAc,MAAM,OAC3BH,EAAO,IAGJL,EAAwB,WAAW,UAAU,KAClDS,EAAa,MAAM;CACrB,GAEMA,IAAU,OAAO,MAAgC;EACrD,IAAIhB,GAAU;GACZ,IAAW;GACX;EACF;EAGA,AAFAW,EAAO,GACP,IAAS,MACT,IAAW;EACX,IAAIM,IAAS;EACb,IAAI;GACF,MAAMF,EAAK,KAAKG,CAAO;EACzB,QAAQ;GACN,IAAS;EACX;EAEA,IADA,IAAW,IACPb,GAAS;EACb,IAAMc,IAAMb,EAAU,CAAC,CAAC,IAAI;EAE5B,AADA,IAAkBa,GAClB,IAAsBF,IAASb,IAAsB,IAAI;EACzD,IAAMgB,IAAML,EAAK,cAAc;EAC/B,IAAIK,MAAQ,MAAM;GAChB,EAAO;GACP;EACF;EACA,IAAMC,IAAWJ,IACbE,IAAMG,EAA4B,KAAK,IAAIlB,GAAqBkB,EAA4B,MAAM,IAAI,KACtGH,IAAMI,EAAeH,GAAKL,EAAK,KAAK,CAAC,GACnCS,IAAUL,IAAMM;EAItB,AAHA,IAASvB,IAAWsB,IAAU,KAAK,IAAIA,GAAShB,EAAOP,GAAWoB,CAAQ,CAAC,GAC3E,IAAY,MACZ,IAAW,IACXR,EAAI;CACN;CAmEA,OAAO;EAAE,gBAjEc;GACrB,IAAIR,GAAS;GACb,IAAMK,IAAYJ,EAAU,CAAC,CAAC,IAAI,IAAIoB,EAAWX,EAAK,KAAK,CAAC;GAE5D,AAAIf,IACF,IAAYQ,EAAOP,GAAWS,CAAS,KAGzC,IAASF,EAAOV,GAAQY,CAAS,GACjCG,EAAI;EACN;EAuDmB,UArDF,MAAuB;GACtC,IAAIR,GAAS;GACb,IAAIL,GAAU;IACZ,IAAW;IACX;GACF;GACA,IAAIe,EAAK,cAAc,MAAM,MAAM;IACjC,EAAO;IACP;GACF;GACA,IAAMI,IAAMb,EAAU,CAAC,CAAC,IAAI;GAC5B,AAAIH,MAAoB,QAAQgB,IAAMhB,IAAA,OACpC,IAASK,EAAOV,GAAQK,IAAkBsB,CAAsB,GAChEZ,EAAI,KAGNG,EAAaE,CAAO;EACtB;EAoC4B,kBAlCH;GAEvB,IAAIb,KAAWL,GAAU;GAEzB,IAAMoB,IAAML,EAAK,cAAc;GAC/B,IAAIK,MAAQ,MACV,EAAO;QAGT,IAAI,CAACb,EAAwB,WAAW,UAAU,GAChD,EAAO;QAIT;QAAIH,MAAwB,GAAG;KAC7B,IAAMe,IAAMb,EAAU,CAAC,CAAC,IAAI,GACtBqB,IAAOZ,EAAK,KAAK,GACjBa,IAAYzB,MAAoB,OAAO,OAAOgB,IAAMhB,GAGpDO,IACJkB,MAAc,QAAQR,IAAMQ,IACxBT,IAAMC,IAAMM,EAAWC,CAAI,IAC3BR,IAAMS,IAAY,KAAK,IAAIH,GAAwBF,EAAeH,IAAMQ,GAAWD,CAAI,CAAC;KAC9F,IAASnB,EAAOV,GAAQ,KAAK,IAAIqB,GAAKT,CAAS,CAAC;IAClD;IACA,EAAI;GADJ;EAEF;EAOwC,YALrB;GAEjB,AADA,IAAU,IACVE,EAAO;EACT;CAE6C;AAC/C"}
+{"version":3,"file":"uploadPoller.js","names":["createQueuePoller","nextAt","timer","inFlight","earlierAt","followUp","lastReadEndedAt","consecutiveFailures","stopped","scheduler","uploadSettlementRuntime","sooner","planned","candidate","disarm","goIdle","arm","onTimer","deps","runRead","failed","trigger","now","age","computed","UPLOAD_POLL_ERROR_LADDER_MS","delayAfterRead","soonest","UPLOAD_POLL_MIN_GAP_MS","firstDelay","mode","sinceRead"],"sources":["../../../../../src/domains/dam/uploadQueue/settlement/uploadPoller.ts"],"sourcesContent":["import {\n  delayAfterRead,\n  firstDelay,\n  UPLOAD_POLL_ERROR_LADDER_MS,\n  UPLOAD_POLL_MIN_GAP_MS,\n  type UploadPollMode,\n} from '@/domains/dam/uploadQueue/settlement/uploadPollSchedule'\nimport { uploadSettlementRuntime } from '@/domains/dam/uploadQueue/settlement/uploadSettlementRuntime'\n\nexport interface QueuePollerDeps {\n  /** The age of the youngest tracked row of the queue in ms, or `null` when the queue tracks nothing. */\n  youngestAgeMs(): number | null\n  mode(): UploadPollMode\n  /** One read of all the tracked rows of the queue. A rejection is a failed read. */\n  read(trigger: 'tick' | 'visible'): Promise<void>\n}\n\nexport interface QueuePoller {\n  /** A row started being tracked. The next read happens no later than its first mark. */\n  rowAdded(): void\n  /** The tab is visible again. Read immediately. */\n  readNow(trigger: 'visible'): void\n  /** Re-arms the timer after the tab is hidden, the mode changes or the queue stops tracking rows. */\n  reschedule(): void\n  stop(): void\n}\n\n/** Tick timer of one queue. What a tick reads is decided by `deps.read`. */\nexport function createQueuePoller(deps: QueuePollerDeps): QueuePoller {\n  let nextAt: number | null = null\n  let timer: { handle: unknown } | null = null\n  let inFlight = false\n  // An earlier read requested while another read is in flight.\n  let earlierAt: number | null = null\n  let followUp = false\n  let lastReadEndedAt: number | null = null\n  let consecutiveFailures = 0\n  let stopped = false\n\n  const scheduler = () => uploadSettlementRuntime.scheduler\n  const sooner = (planned: number | null, candidate: number) =>\n    planned === null ? candidate : Math.min(planned, candidate)\n\n  const disarm = () => {\n    if (!timer) return\n    scheduler().clearTimeout(timer.handle)\n    timer = null\n  }\n\n  // The queue tracks nothing. Drop the plan for removed rows so a later failure restarts the error ladder.\n  const goIdle = () => {\n    disarm()\n    nextAt = null\n    earlierAt = null\n    followUp = false\n    consecutiveFailures = 0\n  }\n\n  const arm = () => {\n    disarm()\n    if (stopped || inFlight || nextAt === null) return\n    // A hidden tab does not read. The planned time is kept for when the tab returns.\n    if (!uploadSettlementRuntime.visibility.isVisible()) return\n    timer = { handle: scheduler().setTimeout(onTimer, Math.max(0, nextAt - scheduler().now())) }\n  }\n\n  const onTimer = () => {\n    timer = null\n    if (stopped) return\n    if (deps.youngestAgeMs() === null) {\n      goIdle()\n      return\n    }\n    if (!uploadSettlementRuntime.visibility.isVisible()) return\n    void runRead('tick')\n  }\n\n  const runRead = async (trigger: 'tick' | 'visible') => {\n    if (inFlight) {\n      followUp = true\n      return\n    }\n    disarm()\n    nextAt = null\n    inFlight = true\n    let failed = false\n    try {\n      await deps.read(trigger)\n    } catch {\n      failed = true\n    }\n    inFlight = false\n    if (stopped) return\n    const now = scheduler().now()\n    lastReadEndedAt = now\n    consecutiveFailures = failed ? consecutiveFailures + 1 : 0\n    const age = deps.youngestAgeMs()\n    if (age === null) {\n      goIdle()\n      return\n    }\n    const computed = failed\n      ? now + UPLOAD_POLL_ERROR_LADDER_MS[Math.min(consecutiveFailures, UPLOAD_POLL_ERROR_LADDER_MS.length) - 1]!\n      : now + delayAfterRead(age, deps.mode())\n    const soonest = now + UPLOAD_POLL_MIN_GAP_MS\n    nextAt = followUp ? soonest : Math.max(soonest, sooner(earlierAt, computed))\n    earlierAt = null\n    followUp = false\n    arm()\n  }\n\n  const rowAdded = () => {\n    if (stopped) return\n    const candidate = scheduler().now() + firstDelay(deps.mode())\n    // A new row can only move the read earlier.\n    if (inFlight) {\n      earlierAt = sooner(earlierAt, candidate)\n      return\n    }\n    nextAt = sooner(nextAt, candidate)\n    arm()\n  }\n\n  const readNow = (trigger: 'visible') => {\n    if (stopped) return\n    if (inFlight) {\n      followUp = true\n      return\n    }\n    if (deps.youngestAgeMs() === null) {\n      goIdle()\n      return\n    }\n    const now = scheduler().now()\n    if (lastReadEndedAt !== null && now - lastReadEndedAt < UPLOAD_POLL_MIN_GAP_MS) {\n      nextAt = sooner(nextAt, lastReadEndedAt + UPLOAD_POLL_MIN_GAP_MS)\n      arm()\n      return\n    }\n    void runRead(trigger)\n  }\n\n  const reschedule = () => {\n    // An in-flight read schedules the next one itself, using the mode current at that time.\n    if (stopped || inFlight) return\n    // Checked before the hidden-tab check. A queue that empties while hidden must not keep a plan for the return.\n    const age = deps.youngestAgeMs()\n    if (age === null) {\n      goIdle()\n      return\n    }\n    if (!uploadSettlementRuntime.visibility.isVisible()) {\n      disarm()\n      return\n    }\n    // An error-ladder wait is kept. The mode rhythm would schedule relative to the failed read.\n    if (consecutiveFailures === 0) {\n      const now = scheduler().now()\n      const mode = deps.mode()\n      const sinceRead = lastReadEndedAt === null ? null : now - lastReadEndedAt\n      // The time the current mode would plan: from the last read, or from the first mark of a row added after it.\n      // Never later than the time already planned.\n      const candidate =\n        sinceRead === null || age < sinceRead\n          ? now - age + firstDelay(mode)\n          : now - sinceRead + Math.max(UPLOAD_POLL_MIN_GAP_MS, delayAfterRead(age - sinceRead, mode))\n      nextAt = sooner(nextAt, Math.max(now, candidate))\n    }\n    arm()\n  }\n\n  const stop = () => {\n    stopped = true\n    goIdle()\n  }\n\n  return { rowAdded, readNow, reschedule, stop }\n}\n"],"mappings":";;;AA4BA,SAAgBA,EAAkB,GAAoC;CACpE,IAAIC,IAAwB,MACxBC,IAAoC,MACpCC,IAAW,IAEXC,IAA2B,MAC3BC,IAAW,IACXC,IAAiC,MACjCC,IAAsB,GACtBC,IAAU,IAERC,UAAkBC,EAAwB,WAC1CC,KAAU,GAAwB,MACtCC,MAAY,OAAOC,IAAY,KAAK,IAAID,GAASC,CAAS,GAEtDC,UAAe;EACnB,AAEAZ,OADAO,EAAU,CAAC,CAAC,aAAaP,EAAM,MAAM,GAC7B;CACV,GAGMa,UAAe;EAKnB,AAJAD,EAAO,GACP,IAAS,MACT,IAAY,MACZ,IAAW,IACX,IAAsB;CACxB,GAEME,UAAY;EAEhB,AADAF,EAAO,GACHN,KAAWL,KAAYF,MAAW,QAEjCS,EAAwB,WAAW,UAAU,MAClD,IAAQ,EAAE,QAAQD,EAAU,CAAC,CAAC,WAAWQ,GAAS,KAAK,IAAI,GAAGhB,IAASQ,EAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE;CAC7F,GAEMQ,UAAgB;EAEpB,AADA,IAAQ,MACJT,MACAU,EAAK,cAAc,MAAM,OAC3BH,EAAO,IAGJL,EAAwB,WAAW,UAAU,KAClDS,EAAa,MAAM;CACrB,GAEMA,IAAU,OAAO,MAAgC;EACrD,IAAIhB,GAAU;GACZ,IAAW;GACX;EACF;EAGA,AAFAW,EAAO,GACP,IAAS,MACT,IAAW;EACX,IAAIM,IAAS;EACb,IAAI;GACF,MAAMF,EAAK,KAAKG,CAAO;EACzB,QAAQ;GACN,IAAS;EACX;EAEA,IADA,IAAW,IACPb,GAAS;EACb,IAAMc,IAAMb,EAAU,CAAC,CAAC,IAAI;EAE5B,AADA,IAAkBa,GAClB,IAAsBF,IAASb,IAAsB,IAAI;EACzD,IAAMgB,IAAML,EAAK,cAAc;EAC/B,IAAIK,MAAQ,MAAM;GAChB,EAAO;GACP;EACF;EACA,IAAMC,IAAWJ,IACbE,IAAMG,EAA4B,KAAK,IAAIlB,GAAqBkB,EAA4B,MAAM,IAAI,KACtGH,IAAMI,EAAeH,GAAKL,EAAK,KAAK,CAAC,GACnCS,IAAUL,IAAMM;EAItB,AAHA,IAASvB,IAAWsB,IAAU,KAAK,IAAIA,GAAShB,EAAOP,GAAWoB,CAAQ,CAAC,GAC3E,IAAY,MACZ,IAAW,IACXR,EAAI;CACN;CAmEA,OAAO;EAAE,gBAjEc;GACrB,IAAIR,GAAS;GACb,IAAMK,IAAYJ,EAAU,CAAC,CAAC,IAAI,IAAIoB,EAAWX,EAAK,KAAK,CAAC;GAE5D,AAAIf,IACF,IAAYQ,EAAOP,GAAWS,CAAS,KAGzC,IAASF,EAAOV,GAAQY,CAAS,GACjCG,EAAI;EACN;EAuDmB,UArDF,MAAuB;GACtC,IAAIR,GAAS;GACb,IAAIL,GAAU;IACZ,IAAW;IACX;GACF;GACA,IAAIe,EAAK,cAAc,MAAM,MAAM;IACjC,EAAO;IACP;GACF;GACA,IAAMI,IAAMb,EAAU,CAAC,CAAC,IAAI;GAC5B,AAAIH,MAAoB,QAAQgB,IAAMhB,IAAA,OACpC,IAASK,EAAOV,GAAQK,IAAkBsB,CAAsB,GAChEZ,EAAI,KAGNG,EAAaE,CAAO;EACtB;EAoC4B,kBAlCH;GAEvB,IAAIb,KAAWL,GAAU;GAEzB,IAAMoB,IAAML,EAAK,cAAc;GAC/B,IAAIK,MAAQ,MACV,EAAO;QAGT,IAAI,CAACb,EAAwB,WAAW,UAAU,GAChD,EAAO;QAIT;QAAIH,MAAwB,GAAG;KAC7B,IAAMe,IAAMb,EAAU,CAAC,CAAC,IAAI,GACtBqB,IAAOZ,EAAK,KAAK,GACjBa,IAAYzB,MAAoB,OAAO,OAAOgB,IAAMhB,GAGpDO,IACJkB,MAAc,QAAQR,IAAMQ,IACxBT,IAAMC,IAAMM,EAAWC,CAAI,IAC3BR,IAAMS,IAAY,KAAK,IAAIH,GAAwBF,EAAeH,IAAMQ,GAAWD,CAAI,CAAC;KAC9F,IAASnB,EAAOV,GAAQ,KAAK,IAAIqB,GAAKT,CAAS,CAAC;IAClD;IACA,EAAI;GADJ;EAEF;EAOwC,YALrB;GAEjB,AADA,IAAU,IACVE,EAAO;EACT;CAE6C;AAC/C"}

package/dist/domains/dam/uploadQueue/settlement/uploadSettle.d.ts

@@ -5,55 +5,53 @@ import { UploadQueue, UploadQueueItem, UploadQueueKey } from '../../types/Upload
 import { UploadRowRoleType, UploadSettlementProfile, UploadSettlementTarget } from './uploadSettlementTypes';
 export interface UploadTrackState {
     queueKey: UploadQueueKey;
-    /** When the row began to wait for the server, in the time of the scheduler. */
+    /** When the row started waiting for the server, in scheduler time. */
     eligibleSince: number;
-    /** The client gave the row up on its finish request; the server may have finished the file all the same. */
+    /** The client failed the row on its finish request. The server may still have finished the file. */
     clientFailed: boolean;
-    /** Successful reads in a row that did not carry the asset of the row, or its file among the slots. */
+    /** Consecutive successful reads that did not include the row's asset, or its file among the slots. */
     misses: number;
-    /** Failed reads in a row. */
     readFailures: number;
     /**
-     * A failed read of the row was written down, or one that found no asset was let be reported, and no read has
-     * brought its asset since: the next ones are not.
+     * A failed read or a missing asset was already reported, and no read has found the asset since.
+     * Further failures are not reported.
      */
     reported: boolean;
 }
 export interface UploadRowNotice {
-    /** The row has waited longer than a processing should take. */
+    /** The row has waited longer than processing should take. */
     slow: boolean;
-    /** The reads of the row keep failing. */
     readWarning: boolean;
-    /** Which of the two the settlement has written into `row.error`. */
+    /** Which of the two notices the settlement wrote into `row.error`. */
     shown: 'slow' | 'readWarning' | null;
-    /** The text it wrote then. A row whose message is another one by now carries somebody else's error. */
+    /** The text written then. If the row's message differs now, the error belongs to someone else. */
     text: string | null;
 }
-/** What a read is to do for one target. */
+/** What a read should do for one target. */
 export interface UploadReadIntent {
-    /** The state an event carried: it stands when the read itself shows no final state. */
+    /** State carried by the event. It applies when the read shows no final state. */
     hint: 'processed' | null;
     /** When the row settles as processed, load its metadata as well. */
     metadata: boolean;
-    /** The metadata notification: the metadata may come before the final state. */
+    /** Set by the metadata notification. Metadata may arrive before the final state. */
     early: boolean;
-    /** A read that tells a row with `settleOn: 'never'` its file is processed. */
+    /** The read tells a row with `settleOn: 'never'` that its file is processed. */
     seen: boolean;
 }
 /** What the settlement remembers about rows. Every key is `toRaw(row)`. */
 export interface UploadSettleMemory {
     tracked: WeakMap<UploadQueueItem, UploadTrackState>;
-    /** The last write an event made into the row; a read that started before it is stale. Never cleared. */
+    /** The last write an event made into the row. A read started before it is stale. Never cleared. */
     revision: WeakMap<UploadQueueItem, number>;
     metadataLoaded: WeakSet<UploadQueueItem>;
-    /** Failed rows an event has brought back: their next read loads the metadata. */
+    /** Failed rows revived by an event. Their next read loads the metadata. */
     reviveWithMetadata: WeakSet<UploadQueueItem>;
-    /** Failed rows a refresh may still change: given up by the client and asked about, or left without their original. */
+    /** Failed rows a refresh may still change: given up by the client, or left without their duplicate's original. */
     refreshMayHelp: WeakSet<UploadQueueItem>;
-    /** Rows failed by the read that was one too many to find no asset, as long as the server settles them by nothing else. */
+    /** Rows failed because too many reads found no asset, while the server settles them by nothing else. */
     givenUpMissing: WeakSet<UploadQueueItem>;
     notices: WeakMap<UploadQueueItem, UploadRowNotice>;
-    /** One counter for the revisions and the starts of the reads. */
+    /** Shared counter for revisions and read starts. */
     clock: number;
 }
 export declare const createUploadSettleMemory: () => UploadSettleMemory;
@@ -63,33 +61,33 @@ export interface UploadSettleRow {
     row: UploadQueueItem;
 }
 export interface UploadSettleOptions {
-    /** A row stopped being tracked, by a write or by the store. */
+    /** A row stopped being tracked, by a settlement write or by the store. */
     onUntrack?(queueKey: UploadQueueKey): void;
-    /** The settlement was disposed of: what a read of an original brings after that is written nowhere. */
+    /** The settlement was disposed. Results of an original read that arrive later are not written. */
     isDisposed?(): boolean;
 }
 export declare const isFinalFileStatus: (status: AssetFileProcessStatusType | null | undefined) => status is "processed" | "duplicate" | "failed";
 /**
- * The state a read gives the file of the target. An asset carries the state of its main file alone: a final state
- * it shows stands, otherwise the state the event carried, when it carried one. Of another file (a slot beside the
- * main one) the asset says nothing, and only what the event carried stands.
+ * The file state a read gives the target.
+ * An asset reports only its main file state. A final state from the asset wins, otherwise the event state applies.
+ * For another file (a slot) the asset says nothing, so only the event state applies.
  */
 export declare const resolveReadStatus: (asset: AssetDetailItemDto, target: Pick<UploadSettlementTarget, "fileId">, intent: Pick<UploadReadIntent, "hint">) => AssetFileProcessStatusType | undefined;
 export declare const clearRowError: (row: UploadQueueItem) => void;
 export declare const isEmptyMetadataValue: (value: unknown) => boolean;
 /**
- * The first load of the metadata of a row. What the user has put into the row before it (a mass operation of the
- * queue) stays: only the empty lists and the empty custom fields are filled.
+ * First metadata load of a row. Values the user set earlier (via a queue mass operation) stay.
+ * Only empty lists and empty custom fields are filled.
  */
 export declare function mergeLoadedMetadata(queue: UploadQueue, row: UploadQueueItem, asset: AssetDetailItemDto, caches: Pick<UploadSettlementProfile['caches'], 'addAuthors' | 'addKeywords'>): void;
 /**
- * What a read asset gives a row without a change of its state. `hadMetadata`: the metadata of the row was loaded
- * once, whether or not it has its form now.
+ * Applies a read asset to a row without changing its state.
+ * `hadMetadata`: the row's metadata was loaded once, whether or not the form is shown now.
  */
 export declare function decorateRow(row: UploadQueueItem, asset: AssetDetailItemDto, mainFile: AssetFile, role: UploadRowRoleType, hadMetadata: boolean): void;
 /**
- * The writes of the settlement: a read asset or a known state into the rows of the queues. No timers and no reads
- * of its own, but for the original of a duplicate.
+ * Settlement writes: a read asset or a known state into queue rows.
+ * No timers and no reads of its own, except reading a duplicate's original.
  */
 export declare function createUploadSettle(profile: UploadSettlementProfile, memory?: UploadSettleMemory, options?: UploadSettleOptions): {
     memory: UploadSettleMemory;

package/dist/domains/dam/uploadQueue/settlement/uploadSettle.js

@@ -1,11 +1,11 @@
-import { isArray as e, isNull as t, isObject as n, isUndefined as r } from "../../../../shared/utils/common.js";
-import { DamAssetType as i } from "../../types/Asset.js";
-import { AssetFileFailReasonDefault as a, AssetFileProcessStatus as o } from "../../types/AssetFile.js";
-import { useAssetSuggestions as s } from "../composables/assetSuggestions.js";
-import { UploadQueueItemStatus as c } from "../../types/UploadQueue.js";
-import { UploadRowRole as l } from "./uploadSettlementTypes.js";
+import { DamAssetType as e } from "../../types/Asset.js";
+import { AssetFileFailReasonDefault as t, AssetFileProcessStatus as n } from "../../types/AssetFile.js";
+import { UploadQueueItemStatus as r } from "../../types/UploadQueue.js";
+import { useAssetSuggestions as i } from "../composables/assetSuggestions.js";
+import { UploadRowRole as a } from "./uploadSettlementTypes.js";
+import { isArray as o, isNull as s, isObject as c, isUndefined as l } from "../../../../shared/utils/common.js";
 import { toRaw as u } from "vue";
-//#region src/domains/dam/uploadQueue/settlement/uploadSettle.ts
+// src/domains/dam/uploadQueue/settlement/uploadSettle.ts
 var d = () => ({
 	tracked: /* @__PURE__ */ new WeakMap(),
 	revision: /* @__PURE__ */ new WeakMap(),
@@ -15,163 +15,163 @@ var d = () => ({
 	givenUpMissing: /* @__PURE__ */ new WeakSet(),
 	notices: /* @__PURE__ */ new WeakMap(),
 	clock: 0
-}), f = (e) => e === o.Processed || e === o.Duplicate || e === o.Failed, p = (e, n, r) => {
-	if (!t(n.fileId) && n.fileId !== e.mainFile?.id) return r.hint ?? void 0;
-	let i = e.mainFile?.fileAttributes?.status;
-	return f(i) ? i : r.hint ?? i;
+}), f = (e) => e === n.Processed || e === n.Duplicate || e === n.Failed, p = (e, t, n) => {
+	if (!s(t.fileId) && t.fileId !== e.mainFile?.id) return n.hint ?? void 0;
+	let r = e.mainFile?.fileAttributes?.status;
+	return f(r) ? r : n.hint ?? r;
 }, m = (e) => {
 	e.error = {
 		hasError: !1,
 		message: "",
-		assetFileFailReason: a
+		assetFileFailReason: t
 	};
-}, h = (n) => r(n) || t(n) || n === "" || e(n) && !n.length;
-function g(e, t, r, i) {
-	let { updateNewNames: a, getAuthorConflicts: o } = s();
-	h(t.keywords) && (t.keywords = [...r.keywords ?? []]), h(t.authors) && (t.authors = [...r.authors ?? []]);
-	let c = n(r.metadata.customData) ? { ...r.metadata.customData } : {};
-	if (n(t.customData)) for (let [e, n] of Object.entries(t.customData)) h(n) || (c[e] = n);
-	t.customData = c, t.mainFileSingleUse = r.mainFileSingleUse, t.mainFileInternal = r.mainFileInternal;
-	let l = r.metadata.authorSuggestions ?? {};
-	a(l, e.suggestions.newAuthorNames), a(r.metadata.keywordSuggestions ?? {}, e.suggestions.newKeywordNames), t.authorConflicts = o(l), i.addKeywords(t.keywords), i.addAuthors(t.authors), i.addAuthors(t.authorConflicts);
+}, h = (e) => l(e) || s(e) || e === "" || o(e) && !e.length;
+function g(e, t, n, r) {
+	let { updateNewNames: a, getAuthorConflicts: o } = i();
+	h(t.keywords) && (t.keywords = [...n.keywords ?? []]), h(t.authors) && (t.authors = [...n.authors ?? []]);
+	let s = c(n.metadata.customData) ? { ...n.metadata.customData } : {};
+	if (c(t.customData)) for (let [e, n] of Object.entries(t.customData)) h(n) || (s[e] = n);
+	t.customData = s, t.mainFileSingleUse = n.mainFileSingleUse, t.mainFileInternal = n.mainFileInternal;
+	let l = n.metadata.authorSuggestions ?? {};
+	a(l, e.suggestions.newAuthorNames), a(n.metadata.keywordSuggestions ?? {}, e.suggestions.newKeywordNames), t.authorConflicts = o(l), r.addKeywords(t.keywords), r.addAuthors(t.authors), r.addAuthors(t.authorConflicts);
 }
-function _(e, n, r, i, a) {
-	e.assetStatus = n.attributes.assetStatus, (t(e.fileId) || e.fileId === r.id) && (r.links?.image_detail && (e.imagePreview = r.links.image_detail), !e.canEditMetadata && !a && i !== l.MassEdit && (e.mainFileSingleUse = n.mainFileSingleUse, e.mainFileInternal = n.mainFileInternal));
+function _(e, t, n, r, i) {
+	e.assetStatus = t.attributes.assetStatus, (s(e.fileId) || e.fileId === n.id) && (n.links?.image_detail && (e.imagePreview = n.links.image_detail), !e.canEditMetadata && !i && r !== a.MassEdit && (e.mainFileSingleUse = t.mainFileSingleUse, e.mainFileInternal = t.mainFileInternal));
 }
 var v = (e) => {
 	e.isDuplicate = !0, e.uploadedAssetId ??= e.assetId;
 };
-function y(e, r = d(), a = {}) {
-	let l = (t) => e.policyFor(e.roleOf(t)), f = (t, n, r, i) => (!e.configOf || !r.configNames?.length || r.configNames.includes(e.configOf(t))) && e.matches(n, r, i), h = (t) => {
-		let n = e.configOf ? [...new Set(t.configNames ?? [])] : [];
-		return n.length > 1 ? n.map((e) => ({
-			...t,
-			configNames: [e]
-		})) : [t];
-	}, y = /* @__PURE__ */ new Set(), b = (t) => (y.add(t), e.configOf ? {
-		addAuthors: (n) => e.caches.addAuthors(n, t),
-		addKeywords: (n) => e.caches.addKeywords(n, t)
+function y(t, a = d(), o = {}) {
+	let l = (e) => t.policyFor(t.roleOf(e)), f = (e, n, r, i) => (!t.configOf || !r.configNames?.length || r.configNames.includes(t.configOf(e))) && t.matches(n, r, i), h = (e) => {
+		let n = t.configOf ? [...new Set(e.configNames ?? [])] : [];
+		return n.length > 1 ? n.map((t) => ({
+			...e,
+			configNames: [t]
+		})) : [e];
+	}, y = /* @__PURE__ */ new Set(), b = (e) => (y.add(e), t.configOf ? {
+		addAuthors: (n) => t.caches.addAuthors(n, e),
+		addKeywords: (n) => t.caches.addKeywords(n, e)
 	} : {
-		addAuthors: (t) => e.caches.addAuthors(t),
-		addKeywords: (t) => e.caches.addKeywords(t)
+		addAuthors: (e) => t.caches.addAuthors(e),
+		addKeywords: (e) => t.caches.addKeywords(e)
 	}), x = () => {
-		let t = [...y];
-		if (y.clear(), !e.configOf) e.caches.fetchAuthors(), e.caches.fetchKeywords();
-		else for (let n of t) e.caches.fetchAuthors(n), e.caches.fetchKeywords(n);
+		let e = [...y];
+		if (y.clear(), !t.configOf) t.caches.fetchAuthors(), t.caches.fetchKeywords();
+		else for (let n of e) t.caches.fetchAuthors(n), t.caches.fetchKeywords(n);
 	}, S = () => {
-		let t = [];
-		for (let [n, r] of e.queues()) for (let e of r.items) t.push({
+		let e = [];
+		for (let [n, r] of t.queues()) for (let t of r.items) e.push({
 			queueKey: n,
 			queue: r,
-			row: e
+			row: t
 		});
-		return t;
-	}, C = (e) => e.status === c.Stop, w = (t) => {
-		let n = u(t);
-		for (let [, t] of e.queues()) if (u(t.items).some((e) => u(e) === n)) return !0;
+		return e;
+	}, C = (e) => e.status === r.Stop, w = (e) => {
+		let n = u(e);
+		for (let [, e] of t.queues()) if (u(e.items).some((e) => u(e) === n)) return !0;
 		return !1;
-	}, T = (e) => e.isDuplicate && l(e).duplicate === "markDuplicate", E = () => a.isDisposed?.() === !0, D = (t, n, i) => _(t, n, i, e.roleOf(t), r.metadataLoaded.has(u(t))), O = (e) => r.revision.get(u(e)) ?? 0, k = (e) => {
-		let t = ++r.clock;
-		return r.revision.set(u(e), t), t;
-	}, A = (e, t) => t <= O(e), j = () => ++r.clock, M = (e) => r.tracked.get(u(e)), N = (e) => {
-		let t = u(e), n = r.tracked.get(t);
-		n && (r.tracked.delete(t), a.onUntrack?.(n.queueKey));
-	}, P = (t, n, i) => {
-		let a = u(n);
-		r.refreshMayHelp.has(a) !== i && (i ? r.refreshMayHelp.add(a) : r.refreshMayHelp.delete(a), e.hooks.onRefreshMayHelp?.(t, n, i));
+	}, T = (e) => e.isDuplicate && l(e).duplicate === "markDuplicate", E = () => o.isDisposed?.() === !0, D = (e, n, r) => _(e, n, r, t.roleOf(e), a.metadataLoaded.has(u(e))), O = (e) => a.revision.get(u(e)) ?? 0, k = (e) => {
+		let t = ++a.clock;
+		return a.revision.set(u(e), t), t;
+	}, A = (e, t) => t <= O(e), j = () => ++a.clock, M = (e) => a.tracked.get(u(e)), N = (e) => {
+		let t = u(e), n = a.tracked.get(t);
+		n && (a.tracked.delete(t), o.onUntrack?.(n.queueKey));
+	}, P = (e, n, r) => {
+		let i = u(n);
+		a.refreshMayHelp.has(i) !== r && (r ? a.refreshMayHelp.add(i) : a.refreshMayHelp.delete(i), t.hooks.onRefreshMayHelp?.(e, n, r));
 	}, F = (e) => {
-		let t = u(e), n = r.notices.get(t);
+		let t = u(e), n = a.notices.get(t);
 		return n || (n = {
 			slow: !1,
 			readWarning: !1,
 			shown: null,
 			text: null
-		}, r.notices.set(t, n)), n;
-	}, I = (e) => r.notices.delete(u(e)), L = (e) => {
-		let t = r.notices.get(u(e));
+		}, a.notices.set(t, n)), n;
+	}, I = (e) => a.notices.delete(u(e)), L = (e) => {
+		let t = a.notices.get(u(e));
 		return !!t?.shown && e.error.message === t.text;
-	}, R = (t, { clear: n = !1 } = {}) => {
-		let r = F(t), i = null;
-		if (r.readWarning && l(t).metadata === "load" && !t.canEditMetadata && !T(t) && t.status !== c.Failed ? i = "readWarning" : r.slow && t.status === c.Processing && (i = "slow"), i) {
-			let n = i === "slow" ? e.messages.processingTooLong(t) : e.messages.readFailed(t);
-			t.error.hasError = !0, t.error.message = n, r.shown = i, r.text = n;
-		} else n ? m(t) : L(t) && (t.status === c.Failed ? t.error = {
-			...t.error,
+	}, R = (e, { clear: n = !1 } = {}) => {
+		let i = F(e), a = null;
+		if (i.readWarning && l(e).metadata === "load" && !e.canEditMetadata && !T(e) && e.status !== r.Failed ? a = "readWarning" : i.slow && e.status === r.Processing && (a = "slow"), a) {
+			let n = a === "slow" ? t.messages.processingTooLong(e) : t.messages.readFailed(e);
+			e.error.hasError = !0, e.error.message = n, i.shown = a, i.text = n;
+		} else n ? m(e) : L(e) && (e.status === r.Failed ? e.error = {
+			...e.error,
 			message: ""
-		} : m(t)), r.shown = null, r.text = null;
-	}, z = ({ queueKey: e, queue: t, row: n }, i) => {
-		g(t, n, i, b(e)), r.metadataLoaded.add(u(n));
-	}, B = ({ queueKey: n, queue: i, row: a }, o, s, d) => {
-		let f = u(a), p = a.status === c.Failed || r.reviveWithMetadata.has(f);
-		a.status = c.Uploaded, t(a.fileId) && (a.fileId = s.id), D(a, o, s);
-		let m = F(a);
-		l(a).metadata === "load" && !T(a) && (d.metadata || p) && (!a.canEditMetadata && !r.metadataLoaded.has(f) && z({
-			queueKey: n,
-			queue: i,
-			row: a
-		}, o), a.canEditMetadata = !0, m.readWarning = !1, e.hooks.afterMetadataLoaded?.(n, a)), r.reviveWithMetadata.delete(f), r.givenUpMissing.delete(f), m.slow = !1, R(a, { clear: !0 }), P(n, a, !1), N(a), e.hooks.onRowFinal(n, a);
-	}, V = ({ queueKey: t, row: n }, i) => {
-		n.status = c.Failed, n.error = {
+		} : m(e)), i.shown = null, i.text = null;
+	}, z = ({ queueKey: e, queue: t, row: n }, r) => {
+		g(t, n, r, b(e)), a.metadataLoaded.add(u(n));
+	}, B = ({ queueKey: e, queue: n, row: i }, o, c, d) => {
+		let f = u(i), p = i.status === r.Failed || a.reviveWithMetadata.has(f);
+		i.status = r.Uploaded, s(i.fileId) && (i.fileId = c.id), D(i, o, c);
+		let m = F(i);
+		l(i).metadata === "load" && !T(i) && (d.metadata || p) && (!i.canEditMetadata && !a.metadataLoaded.has(f) && z({
+			queueKey: e,
+			queue: n,
+			row: i
+		}, o), i.canEditMetadata = !0, m.readWarning = !1, t.hooks.afterMetadataLoaded?.(e, i)), a.reviveWithMetadata.delete(f), a.givenUpMissing.delete(f), m.slow = !1, R(i, { clear: !0 }), P(e, i, !1), N(i), t.hooks.onRowFinal(e, i);
+	}, V = ({ queueKey: e, row: n }, i) => {
+		n.status = r.Failed, n.error = {
 			hasError: !0,
 			message: "",
 			assetFileFailReason: i
-		}, n.canEditMetadata = !1, I(n), r.reviveWithMetadata.delete(u(n)), r.givenUpMissing.delete(u(n)), P(t, n, !1), N(n), e.hooks.onRowFinal(t, n);
+		}, n.canEditMetadata = !1, I(n), a.reviveWithMetadata.delete(u(n)), a.givenUpMissing.delete(u(n)), P(e, n, !1), N(n), t.hooks.onRowFinal(e, n);
 	}, H = (e, t) => {
-		for (let n of S()) n.row.status !== c.Stop && f(n.queueKey, n.row, e, "settle") && (V(n, t), k(n.row));
-	}, U = (t) => {
+		for (let n of S()) n.row.status !== r.Stop && f(n.queueKey, n.row, e, "settle") && (V(n, t), k(n.row));
+	}, U = (e) => {
 		for (let { queueKey: n, row: i } of S()) {
-			if (i.status === c.Stop || l(i).settleOn !== "event" || !f(n, i, t, "settle")) continue;
-			let a = u(i);
-			i.status === c.Failed && r.reviveWithMetadata.add(a), r.givenUpMissing.delete(a), i.status = c.Uploaded, !T(i) && r.metadataLoaded.has(a) && (i.canEditMetadata = !0), F(i).slow = !1, R(i, { clear: !0 }), k(i), P(n, i, !1), N(i), e.hooks.onRowFinal(n, i);
+			if (i.status === r.Stop || l(i).settleOn !== "event" || !f(n, i, e, "settle")) continue;
+			let o = u(i);
+			i.status === r.Failed && a.reviveWithMetadata.add(o), a.givenUpMissing.delete(o), i.status = r.Uploaded, !T(i) && a.metadataLoaded.has(o) && (i.canEditMetadata = !0), F(i).slow = !1, R(i, { clear: !0 }), k(i), P(n, i, !1), N(i), t.hooks.onRowFinal(n, i);
 		}
-	}, W = (t) => {
-		for (let { queueKey: n, row: r } of S()) r.status !== c.Stop && l(r).settleOn === "never" && f(n, r, t, "decorate") && e.hooks.onProcessedSeen?.(n, r);
-	}, G = (e, t, n) => S().filter(({ queueKey: r, row: i }) => i.status !== c.Stop && n(i) && l(i).duplicate === t && f(r, i, e, "settle")), K = async (t, n, i, a) => {
-		let o = [];
-		for (let { queueKey: n, row: i } of G(t, "markDuplicate", a)) v(i), i.status = c.Uploaded, i.canEditMetadata = !1, m(i), I(i), r.reviveWithMetadata.delete(u(i)), r.givenUpMissing.delete(u(i)), o.push({
+	}, W = (e) => {
+		for (let { queueKey: n, row: i } of S()) i.status !== r.Stop && l(i).settleOn === "never" && f(n, i, e, "decorate") && t.hooks.onProcessedSeen?.(n, i);
+	}, G = (e, t, n) => S().filter(({ queueKey: i, row: a }) => a.status !== r.Stop && n(a) && l(a).duplicate === t && f(i, a, e, "settle")), K = async (e, n, i, o) => {
+		let s = [];
+		for (let { queueKey: n, row: i } of G(e, "markDuplicate", o)) v(i), i.status = r.Uploaded, i.canEditMetadata = !1, m(i), I(i), a.reviveWithMetadata.delete(u(i)), a.givenUpMissing.delete(u(i)), s.push({
 			row: i,
 			mark: k(i)
-		}), P(n, i, !1), N(i), e.hooks.onRowFinal(n, i);
-		if (!o.length || !n || !i || !e.readers.duplicateOriginFile) return;
-		let s = null;
+		}), P(n, i, !1), N(i), t.hooks.onRowFinal(n, i);
+		if (!s.length || !n || !i || !t.readers.duplicateOriginFile) return;
+		let c = null;
 		try {
-			s = await e.readers.duplicateOriginFile(n, i);
+			c = await t.readers.duplicateOriginFile(n, i);
 		} catch (e) {
 			console.error("uploadQueue: the duplicated file could not be read", e);
 		}
-		if (s && !E()) for (let { row: e, mark: t } of o) w(e) && e.status !== c.Stop && e.isDuplicate && O(e) === t && (e.fileId = s.id, e.duplicateAssetId = s.asset, e.mainFileSingleUse = s.flags.singleUse, s.links?.image_detail && (e.imagePreview = s.links.image_detail));
-	}, q = async (t, a, o, l) => {
-		if (!a || o !== i.Image) return !1;
-		let d = G(t, "becomeOriginal", l).map((e) => ({
+		if (c && !E()) for (let { row: e, mark: t } of s) w(e) && e.status !== r.Stop && e.isDuplicate && O(e) === t && (e.fileId = c.id, e.duplicateAssetId = c.asset, e.mainFileSingleUse = c.flags.singleUse, c.links?.image_detail && (e.imagePreview = c.links.image_detail));
+	}, q = async (n, o, s, l) => {
+		if (!o || s !== e.Image) return !1;
+		let d = G(n, "becomeOriginal", l).map((e) => ({
 			...e,
 			mark: O(e.row)
 		}));
 		if (!d.length) return !1;
-		let f = () => d.filter(({ row: e, mark: t }) => w(e) && !C(e) && O(e) === t), { updateNewNames: p, getAuthorConflicts: h } = s(), g;
+		let f = () => d.filter(({ row: e, mark: t }) => w(e) && !C(e) && O(e) === t), { updateNewNames: p, getAuthorConflicts: h } = i(), g;
 		try {
-			if (!e.readers.duplicateOriginAsset) throw Error("uploadSettlement: no reader of the original asset");
-			g = await e.readers.duplicateOriginAsset(a, { queueKey: d[0].queueKey });
+			if (!t.readers.duplicateOriginAsset) throw Error("uploadSettlement: no reader of the original asset");
+			g = await t.readers.duplicateOriginAsset(o, { queueKey: d[0].queueKey });
 		} catch {
 			if (E()) return !1;
-			let t = !1;
+			let e = !1;
 			for (let { queueKey: n, row: i } of f()) {
-				let a = r.refreshMayHelp.has(u(i));
+				let o = a.refreshMayHelp.has(u(i));
 				N(i);
-				let o = i.status === c.Processing;
-				o && (i.status = c.Failed, i.error = {
+				let s = i.status === r.Processing;
+				s && (i.status = r.Failed, i.error = {
 					...i.error,
 					hasError: !0,
 					message: L(i) ? "" : i.error.message
-				}, i.canEditMetadata = !1, I(i), e.hooks.onRowFinal(n, i)), (o || a) && (P(n, i, !0), t = !0);
+				}, i.canEditMetadata = !1, I(i), t.hooks.onRowFinal(n, i)), (s || o) && (P(n, i, !0), e = !0);
 			}
-			return t;
+			return e;
 		}
 		if (E()) return !1;
-		for (let { queueKey: t, queue: i, row: o } of f()) {
+		for (let { queueKey: e, queue: n, row: i } of f()) {
 			let s = g.metadata.authorSuggestions ?? {};
-			v(o), o.status = c.Uploaded, m(o), o.fileId = a, o.duplicateAssetId = g.id, o.assetStatus = g.attributes.assetStatus, g.mainFile?.links?.image_detail && (o.imagePreview = g.mainFile.links.image_detail), o.keywords = [...g.keywords ?? []], o.authors = [...g.authors ?? []], o.customData = n(g.metadata.customData) ? { ...g.metadata.customData } : {}, p(s, i.suggestions.newAuthorNames), p(g.metadata.keywordSuggestions ?? {}, i.suggestions.newKeywordNames), o.authorConflicts = h(s);
-			let l = b(t);
-			l.addKeywords(o.keywords), l.addAuthors(o.authors), l.addAuthors(o.authorConflicts), o.assetId = g.id, o.mainFileSingleUse = g.mainFileSingleUse, o.mainFileInternal = g.mainFileInternal, r.metadataLoaded.add(u(o)), o.canEditMetadata = !0, I(o), r.reviveWithMetadata.delete(u(o)), r.givenUpMissing.delete(u(o)), k(o), P(t, o, !1), N(o), e.hooks.onRowFinal(t, o);
+			v(i), i.status = r.Uploaded, m(i), i.fileId = o, i.duplicateAssetId = g.id, i.assetStatus = g.attributes.assetStatus, g.mainFile?.links?.image_detail && (i.imagePreview = g.mainFile.links.image_detail), i.keywords = [...g.keywords ?? []], i.authors = [...g.authors ?? []], i.customData = c(g.metadata.customData) ? { ...g.metadata.customData } : {}, p(s, n.suggestions.newAuthorNames), p(g.metadata.keywordSuggestions ?? {}, n.suggestions.newKeywordNames), i.authorConflicts = h(s);
+			let l = b(e);
+			l.addKeywords(i.keywords), l.addAuthors(i.authors), l.addAuthors(i.authorConflicts), i.assetId = g.id, i.mainFileSingleUse = g.mainFileSingleUse, i.mainFileInternal = g.mainFileInternal, a.metadataLoaded.add(u(i)), i.canEditMetadata = !0, I(i), a.reviveWithMetadata.delete(u(i)), a.givenUpMissing.delete(u(i)), k(i), P(e, i, !1), N(i), t.hooks.onRowFinal(e, i);
 		}
 		return x(), !1;
 	}, J = async (e, t, n, r = () => !0) => {
@@ -183,34 +183,34 @@ function y(e, r = d(), a = {}) {
 		} catch (e) {
 			console.error("uploadQueue: the duplicate could not be settled", e);
 		}
-	}, X = ({ queueKey: t, queue: n, row: i }, a) => {
-		l(i).metadata !== "load" || i.canEditMetadata || T(i) || (i.status !== c.Failed || e.metadataGate?.(t, i) === "load") && (r.metadataLoaded.has(u(i)) || z({
-			queueKey: t,
+	}, X = ({ queueKey: e, queue: n, row: i }, o) => {
+		l(i).metadata !== "load" || i.canEditMetadata || T(i) || (i.status !== r.Failed || t.metadataGate?.(e, i) === "load") && (a.metadataLoaded.has(u(i)) || z({
+			queueKey: e,
 			queue: n,
 			row: i
-		}, a), i.canEditMetadata = !0, F(i).readWarning = !1, R(i), e.hooks.afterMetadataLoaded?.(t, i));
-	}, Z = async (t, n, r, i) => {
-		let a = t.mainFile ?? null, s = p(t, n, r), c = !1, u = !1;
+		}, o), i.canEditMetadata = !0, F(i).readWarning = !1, R(i), t.hooks.afterMetadataLoaded?.(e, i));
+	}, Z = async (e, r, i, a) => {
+		let o = e.mainFile ?? null, s = p(e, r, i), c = !1, u = !1;
 		for (let d of S()) {
 			let { queueKey: p, row: m } = d;
 			if ((!c || w(m)) && !C(m)) {
-				if (!A(m, i) && a && f(p, m, n, "decorate")) {
-					let h = f(p, m, n, "settle");
-					if (s === o.Processed) l(m).settleOn === "never" ? (D(m, t, a), r.seen && e.hooks.onProcessedSeen?.(p, m)) : h && B(d, t, a, r);
-					else if (s === o.Duplicate && h) {
+				if (!A(m, a) && o && f(p, m, r, "decorate")) {
+					let h = f(p, m, r, "settle");
+					if (s === n.Processed) l(m).settleOn === "never" ? (D(m, e, o), i.seen && t.hooks.onProcessedSeen?.(p, m)) : h && B(d, e, o, i);
+					else if (s === n.Duplicate && h) {
 						if (!c) {
-							if (c = !0, u = await J(n, a.originAssetFile, t.attributes.assetType, (e) => !A(e, i)), E()) return u;
+							if (c = !0, u = await J(r, o.originAssetFile, e.attributes.assetType, (e) => !A(e, a)), E()) return u;
 							if (!w(m) || C(m)) continue;
 						}
-					} else s === o.Failed && h && V(d, a.fileAttributes.failReason);
+					} else s === n.Failed && h && V(d, o.fileAttributes.failReason);
 				}
-				r.early && f(p, m, n, "metadata") && X(d, t);
+				i.early && f(p, m, r, "metadata") && X(d, e);
 			}
 		}
-		return e.hooks.onAssetRead?.(t), u;
-	}, Q = (e) => e.status === c.Uploaded && !e.canEditMetadata && l(e).metadata === "load" && !T(e);
+		return t.hooks.onAssetRead?.(e), u;
+	}, Q = (e) => e.status === r.Uploaded && !e.canEditMetadata && l(e).metadata === "load" && !T(e);
 	return {
-		memory: r,
+		memory: a,
 		policyOf: l,
 		concerns: f,
 		byConfiguration: h,
@@ -233,14 +233,13 @@ function y(e, r = d(), a = {}) {
 		settleDuplicate: J,
 		settleKnownDuplicate: Y,
 		awaitsMetadata: Q,
-		giveUpOnMissing: ({ queueKey: t, row: n }) => {
-			P(t, n, !1);
+		giveUpOnMissing: ({ queueKey: e, row: n }) => {
+			P(e, n, !1);
 			let i = Q(n);
-			n.status !== c.Processing && !i ? N(n) : (n.status = c.Failed, n.error.hasError = !0, n.error.message = i ? e.messages.assetGone?.(n) ?? e.messages.assetMissing(n) : e.messages.assetMissing(n), n.canEditMetadata = !1, r.givenUpMissing.add(u(n)), I(n), N(n), e.hooks.onRowFinal(t, n));
+			n.status !== r.Processing && !i ? N(n) : (n.status = r.Failed, n.error.hasError = !0, n.error.message = i ? t.messages.assetGone?.(n) ?? t.messages.assetMissing(n) : t.messages.assetMissing(n), n.canEditMetadata = !1, a.givenUpMissing.add(u(n)), I(n), N(n), t.hooks.onRowFinal(e, n));
 		}
 	};
 }
-//#endregion
 export { m as clearRowError, y as createUploadSettle, d as createUploadSettleMemory, _ as decorateRow, h as isEmptyMetadataValue, f as isFinalFileStatus, g as mergeLoadedMetadata, p as resolveReadStatus };
 
 //# sourceMappingURL=uploadSettle.js.map