@askrjs/askr 0.0.44 → 0.0.45

package/dist/runtime/fastlane.js.map

@@ -1 +1 @@
-{"version":3,"file":"fastlane.js","names":[],"sources":["../../src/runtime/fastlane.ts"],"sourcesContent":["import { isDevelopmentEnvironment } from '../common/env';\nimport { globalScheduler } from './scheduler';\nimport { logger } from '../dev/logger';\nimport type { ComponentInstance } from './component';\nimport { finalizeReadableSubscriptions } from './readable';\nimport {\n  getKeyMapForElement,\n  isKeyedReorderFastPathEligible,\n  populateKeyMapForElement,\n} from '../renderer/keyed';\nimport { Fragment } from '../common/jsx';\nimport { setDevValue, getDevValue, getDevNamespace } from './dev-namespace';\n\nlet _bulkCommitActive = false;\nlet _appliedParents: WeakSet<Element> | null = null;\n\nexport function enterBulkCommit(): void {\n  _bulkCommitActive = true;\n  // Initialize registry of parents that had fast-path applied during this bulk commit\n  _appliedParents = new WeakSet<Element>();\n  setDevValue('__ASKR_FASTLANE_CLEARED_TASKS', 0);\n}\n\nexport function exitBulkCommit(): void {\n  _bulkCommitActive = false;\n  // Clear registry to avoid leaking across commits\n  _appliedParents = null;\n}\n\nexport function isBulkCommitActive(): boolean {\n  return _bulkCommitActive;\n}\n\n// Mark that a fast-path was applied on a parent element during the active\n// bulk commit. No-op if there is no active bulk commit.\nexport function markFastPathApplied(parent: Element): void {\n  if (!_appliedParents) return;\n  try {\n    _appliedParents.add(parent);\n  } catch (e) {\n    void e;\n  }\n}\n\nexport function isFastPathApplied(parent: Element): boolean {\n  return !!(_appliedParents && _appliedParents.has(parent));\n}\n\nfunction finalizeReadSubscriptions(instance: ComponentInstance): void {\n  finalizeReadableSubscriptions(instance);\n}\n\n/**\n * Attempt to execute a runtime fast-lane for a single component's synchronous\n * render result. Returns true if the fast-lane was used and commit was done.\n *\n * Preconditions (checked conservatively):\n * - The render result is an intrinsic element root with keyed children\n * - The renderer's fast-path heuristics indicate to use the fast-path\n * - No mount operations are pending on the component instance\n * - No child vnodes are component functions (avoid async/component mounts)\n */\n\n// Helper to unwrap Fragment vnodes to get the first intrinsic element child\nfunction unwrapFragmentForFastPath(vnode: unknown): unknown {\n  if (!vnode || typeof vnode !== 'object' || !('type' in vnode)) return vnode;\n  const v = vnode as {\n    type: unknown;\n    children?: unknown;\n    props?: { children?: unknown };\n  };\n  // Check if it's a Fragment\n  if (\n    typeof v.type === 'symbol' &&\n    (v.type === Fragment || String(v.type) === 'Symbol(askr.fragment)')\n  ) {\n    const children = v.props?.children ?? v.children;\n    if (Array.isArray(children) && children.length > 0) {\n      // Return the first child that's an intrinsic element\n      for (const child of children) {\n        if (child && typeof child === 'object' && 'type' in child) {\n          const c = child as { type: unknown };\n          if (typeof c.type === 'string') {\n            return child;\n          }\n        }\n      }\n    }\n  }\n  return vnode;\n}\n\nexport function classifyUpdate(instance: ComponentInstance, result: unknown) {\n  // Returns a classification describing whether this update is eligible for\n  // the reorder-only fast-lane. The classifier mirrors renderer-level\n  // heuristics and performs runtime-level checks (mounts, effects, component\n  // children) that the renderer cannot reason about.\n\n  // Unwrap Fragment to get the actual element vnode for classification\n  const unwrappedResult = unwrapFragmentForFastPath(result);\n\n  if (\n    !unwrappedResult ||\n    typeof unwrappedResult !== 'object' ||\n    !('type' in unwrappedResult)\n  )\n    return { useFastPath: false, reason: 'not-vnode' };\n\n  const vnode = unwrappedResult as {\n    type: unknown;\n    children?: unknown;\n    props?: { children?: unknown };\n  };\n  if (vnode == null || typeof vnode.type !== 'string')\n    return { useFastPath: false, reason: 'not-intrinsic' };\n\n  const parent = instance.target;\n  if (!parent) return { useFastPath: false, reason: 'no-root' };\n\n  const firstChild = parent.children[0] as Element | undefined;\n  if (!firstChild) return { useFastPath: false, reason: 'no-first-child' };\n  if (firstChild.tagName.toLowerCase() !== String(vnode.type).toLowerCase())\n    return { useFastPath: false, reason: 'root-tag-mismatch' };\n\n  const children = vnode.props?.children ?? vnode.children;\n  if (!Array.isArray(children))\n    return { useFastPath: false, reason: 'no-children-array' };\n\n  // Avoid component child vnodes (they may mount/unmount or trigger async)\n  for (const c of children) {\n    if (\n      typeof c === 'object' &&\n      c !== null &&\n      'type' in c &&\n      typeof (c as { type?: unknown }).type === 'function'\n    ) {\n      return { useFastPath: false, reason: 'component-child-present' };\n    }\n  }\n\n  if ((instance.mountOperations?.length ?? 0) > 0)\n    return { useFastPath: false, reason: 'pending-mounts' };\n  if ((instance.commitOperations?.length ?? 0) > 0)\n    return { useFastPath: false, reason: 'pending-lifecycle-commits' };\n\n  // Ask renderer for keyed reorder eligibility (prop differences & heuristics)\n  // Ensure a keyed map is available for the first child by populating it proactively.\n  try {\n    populateKeyMapForElement(firstChild);\n  } catch {\n    // ignore\n  }\n\n  const oldKeyMap = getKeyMapForElement(firstChild);\n  const decision = isKeyedReorderFastPathEligible(\n    firstChild,\n    children,\n    oldKeyMap\n  );\n\n  if (!decision.useFastPath || decision.totalKeyed < 128)\n    return { ...decision, useFastPath: false, reason: 'renderer-declined' };\n\n  return { ...decision, useFastPath: true } as const;\n}\n\nexport function commitReorderOnly(\n  instance: ComponentInstance,\n  result: unknown\n): boolean {\n  // Performs the minimal, synchronous reorder-only commit.\n  const evaluate = (\n    globalThis as {\n      __ASKR_RENDERER?: {\n        evaluate?: (node: unknown, target: Element | null) => void;\n      };\n    }\n  ).__ASKR_RENDERER?.evaluate;\n\n  if (typeof evaluate !== 'function') {\n    logger.warn(\n      '[Tempo][FASTPATH][DEV] renderer.evaluate not available; declining fast-lane'\n    );\n    return false;\n  }\n\n  const schedBefore = isDevelopmentEnvironment()\n    ? globalScheduler.getState()\n    : null;\n\n  enterBulkCommit();\n\n  try {\n    globalScheduler.runWithSyncProgress(() => {\n      evaluate(result, instance.target);\n\n      // Finalize runtime bookkeeping (read subscriptions / tokens)\n      try {\n        finalizeReadSubscriptions(instance);\n      } catch (e) {\n        if (isDevelopmentEnvironment()) throw e;\n      }\n    });\n\n    setDevValue('__FASTLANE_CLEARED_AFTER', 0);\n\n    // Dev-only invariant checks\n    if (isDevelopmentEnvironment()) {\n      validateFastLaneInvariants(instance, schedBefore);\n    }\n\n    return true;\n  } finally {\n    // Clear bulk commit flag first\n    exitBulkCommit();\n  }\n  // Note: The original code had a check here that was dead code because\n  // exitBulkCommit() already ran in the finally block. This comment serves\n  // as documentation that we've intentionally removed that unreachable code.\n}\n\n/**\n * Validates fast-lane invariants in dev mode.\n * Extracted to reduce complexity in commitReorderOnly.\n */\nfunction validateFastLaneInvariants(\n  instance: ComponentInstance,\n  schedBefore: ReturnType<typeof globalScheduler.getState> | null\n): void {\n  const commitCount = getDevValue<number>('__LAST_FASTPATH_COMMIT_COUNT') ?? 0;\n  const invariants = {\n    commitCount,\n    mountOps: instance.mountOperations?.length ?? 0,\n    commitOps: instance.commitOperations?.length ?? 0,\n    cleanupFns: instance.cleanupFns?.length ?? 0,\n  };\n  setDevValue('__LAST_FASTLANE_INVARIANTS', invariants);\n\n  if (commitCount !== 1) {\n    console.error(\n      '[FASTLANE][INV] commitCount',\n      commitCount,\n      'diag',\n      getDevNamespace()\n    );\n    throw new Error(\n      'Fast-lane invariant violated: expected exactly one DOM commit during reorder-only commit'\n    );\n  }\n\n  if (invariants.mountOps > 0) {\n    throw new Error(\n      'Fast-lane invariant violated: mount operations were registered during bulk commit'\n    );\n  }\n\n  if (invariants.commitOps > 0) {\n    throw new Error(\n      'Fast-lane invariant violated: lifecycle commit operations were registered during bulk commit'\n    );\n  }\n\n  if (invariants.cleanupFns > 0) {\n    throw new Error(\n      'Fast-lane invariant violated: cleanup functions were added during bulk commit'\n    );\n  }\n\n  const schedAfter = globalScheduler.getState();\n  if (\n    schedBefore &&\n    schedAfter &&\n    schedAfter.taskCount > schedBefore.taskCount\n  ) {\n    console.error(\n      '[FASTLANE] schedBefore, schedAfter',\n      schedBefore,\n      schedAfter\n    );\n    console.error('[FASTLANE] enqueue logs', getDevValue('__ENQUEUE_LOGS'));\n    throw new Error(\n      'Fast-lane invariant violated: scheduler enqueued leftover work during bulk commit'\n    );\n  }\n}\n\nexport function tryRuntimeFastLaneSync(\n  instance: ComponentInstance,\n  result: unknown\n): boolean {\n  const cls = classifyUpdate(instance, result);\n  if (!cls.useFastPath) {\n    // Clear stale fast-path diagnostics\n    setDevValue('__LAST_FASTPATH_STATS', undefined);\n    setDevValue('__LAST_FASTPATH_COMMIT_COUNT', 0);\n    return false;\n  }\n\n  try {\n    return commitReorderOnly(instance, result);\n  } catch (err) {\n    // Surface dev-only invariant failures, otherwise decline silently\n    if (isDevelopmentEnvironment()) throw err;\n    return false;\n  }\n}\n\n// Expose fastlane bridge on globalThis for environments/tests\nif (typeof globalThis !== 'undefined') {\n  (globalThis as Record<string, unknown>).__ASKR_FASTLANE = {\n    isBulkCommitActive,\n    enterBulkCommit,\n    exitBulkCommit,\n    tryRuntimeFastLaneSync,\n    markFastPathApplied,\n    isFastPathApplied,\n  };\n}\n"],"mappings":";;;;;;;;AAaA,IAAI,oBAAoB;AACxB,IAAI,kBAA2C;AAE/C,SAAgB,kBAAwB;CACtC,oBAAoB;CAEpB,kCAAkB,IAAI,QAAiB;CACvC,YAAY,iCAAiC,CAAC;AAChD;AAEA,SAAgB,iBAAuB;CACrC,oBAAoB;CAEpB,kBAAkB;AACpB;AAEA,SAAgB,qBAA8B;CAC5C,OAAO;AACT;AAIA,SAAgB,oBAAoB,QAAuB;CACzD,IAAI,CAAC,iBAAiB;CACtB,IAAI;EACF,gBAAgB,IAAI,MAAM;CAC5B,SAAS,GAAG,CAEZ;AACF;AAEA,SAAgB,kBAAkB,QAA0B;CAC1D,OAAO,CAAC,EAAE,mBAAmB,gBAAgB,IAAI,MAAM;AACzD;AAEA,SAAS,0BAA0B,UAAmC;CACpE,8BAA8B,QAAQ;AACxC;;;;;;;;;;;AAcA,SAAS,0BAA0B,OAAyB;CAC1D,IAAI,CAAC,SAAS,OAAO,UAAU,YAAY,EAAE,UAAU,QAAQ,OAAO;CACtE,MAAM,IAAI;CAMV,IACE,OAAO,EAAE,SAAS,aACjB,EAAE,SAAS,YAAY,OAAO,EAAE,IAAI,MAAM,0BAC3C;EACA,MAAM,WAAW,EAAE,OAAO,YAAY,EAAE;EACxC,IAAI,MAAM,QAAQ,QAAQ,KAAK,SAAS,SAAS,GAE/C;QAAK,MAAM,SAAS,UAClB,IAAI,SAAS,OAAO,UAAU,YAAY,UAAU,OAElD;QAAI,OAAO,MAAE,SAAS,UACpB,OAAO;GACT;EAEJ;CAEJ;CACA,OAAO;AACT;AAEA,SAAgB,eAAe,UAA6B,QAAiB;CAO3E,MAAM,kBAAkB,0BAA0B,MAAM;CAExD,IACE,CAAC,mBACD,OAAO,oBAAoB,YAC3B,EAAE,UAAU,kBAEZ,OAAO;EAAE,aAAa;EAAO,QAAQ;CAAY;CAEnD,MAAM,QAAQ;CAKd,IAAI,SAAS,QAAQ,OAAO,MAAM,SAAS,UACzC,OAAO;EAAE,aAAa;EAAO,QAAQ;CAAgB;CAEvD,MAAM,SAAS,SAAS;CACxB,IAAI,CAAC,QAAQ,OAAO;EAAE,aAAa;EAAO,QAAQ;CAAU;CAE5D,MAAM,aAAa,OAAO,SAAS;CACnC,IAAI,CAAC,YAAY,OAAO;EAAE,aAAa;EAAO,QAAQ;CAAiB;CACvE,IAAI,WAAW,QAAQ,YAAY,MAAM,OAAO,MAAM,IAAI,EAAE,YAAY,GACtE,OAAO;EAAE,aAAa;EAAO,QAAQ;CAAoB;CAE3D,MAAM,WAAW,MAAM,OAAO,YAAY,MAAM;CAChD,IAAI,CAAC,MAAM,QAAQ,QAAQ,GACzB,OAAO;EAAE,aAAa;EAAO,QAAQ;CAAoB;CAG3D,KAAK,MAAM,KAAK,UACd,IACE,OAAO,MAAM,YACb,MAAM,QACN,UAAU,KACV,OAAQ,EAAyB,SAAS,YAE1C,OAAO;EAAE,aAAa;EAAO,QAAQ;CAA0B;CAInE,KAAK,SAAS,iBAAiB,UAAU,KAAK,GAC5C,OAAO;EAAE,aAAa;EAAO,QAAQ;CAAiB;CACxD,KAAK,SAAS,kBAAkB,UAAU,KAAK,GAC7C,OAAO;EAAE,aAAa;EAAO,QAAQ;CAA4B;CAInE,IAAI;EACF,yBAAyB,UAAU;CACrC,QAAQ,CAER;CAGA,MAAM,WAAW,+BACf,YACA,UAHgB,oBAAoB,UAIpC,CACF;CAEA,IAAI,CAAC,SAAS,eAAe,SAAS,aAAa,KACjD,OAAO;EAAE,GAAG;EAAU,aAAa;EAAO,QAAQ;CAAoB;CAExE,OAAO;EAAE,GAAG;EAAU,aAAa;CAAK;AAC1C;AAEA,SAAgB,kBACd,UACA,QACS;CAET,MAAM,WACJ,WAKA,iBAAiB;CAEnB,IAAI,OAAO,aAAa,YAAY;EAClC,OAAO,KACL,6EACF;EACA,OAAO;CACT;CAEA,MAAM,cAAc,yBAAyB,IACzC,gBAAgB,SAAS,IACzB;CAEJ,gBAAgB;CAEhB,IAAI;EACF,gBAAgB,0BAA0B;GACxC,SAAS,QAAQ,SAAS,MAAM;GAGhC,IAAI;IACF,0BAA0B,QAAQ;GACpC,SAAS,GAAG;IACV,IAAI,yBAAyB,GAAG,MAAM;GACxC;EACF,CAAC;EAED,YAAY,4BAA4B,CAAC;EAGzC,IAAI,yBAAyB,GAC3B,2BAA2B,UAAU,WAAW;EAGlD,OAAO;CACT,UAAU;EAER,eAAe;CACjB;AAIF;;;;;AAMA,SAAS,2BACP,UACA,aACM;CACN,MAAM,cAAc,YAAoB,8BAA8B,KAAK;CAC3E,MAAM,aAAa;EACjB;EACA,UAAU,SAAS,iBAAiB,UAAU;EAC9C,WAAW,SAAS,kBAAkB,UAAU;EAChD,YAAY,SAAS,YAAY,UAAU;CAC7C;CACA,YAAY,8BAA8B,UAAU;CAEpD,IAAI,gBAAgB,GAAG;EACrB,QAAQ,MACN,+BACA,aACA,QACA,gBAAgB,CAClB;EACA,MAAM,IAAI,MACR,0FACF;CACF;CAEA,IAAI,WAAW,WAAW,GACxB,MAAM,IAAI,MACR,mFACF;CAGF,IAAI,WAAW,YAAY,GACzB,MAAM,IAAI,MACR,8FACF;CAGF,IAAI,WAAW,aAAa,GAC1B,MAAM,IAAI,MACR,+EACF;CAGF,MAAM,aAAa,gBAAgB,SAAS;CAC5C,IACE,eACA,cACA,WAAW,YAAY,YAAY,WACnC;EACA,QAAQ,MACN,sCACA,aACA,UACF;EACA,QAAQ,MAAM,2BAA2B,YAAY,gBAAgB,CAAC;EACtE,MAAM,IAAI,MACR,mFACF;CACF;AACF;AAEA,SAAgB,uBACd,UACA,QACS;CAET,IAAI,CADQ,eAAe,UAAU,MAChC,EAAI,aAAa;EAEpB,YAAY,yBAAyB,MAAS;EAC9C,YAAY,gCAAgC,CAAC;EAC7C,OAAO;CACT;CAEA,IAAI;EACF,OAAO,kBAAkB,UAAU,MAAM;CAC3C,SAAS,KAAK;EAEZ,IAAI,yBAAyB,GAAG,MAAM;EACtC,OAAO;CACT;AACF;AAGA,IAAI,OAAO,eAAe,aACxB,WAAwC,kBAAkB;CACxD;CACA;CACA;CACA;CACA;CACA;AACF"}
+{"version":3,"file":"fastlane.js","names":[],"sources":["../../src/runtime/fastlane.ts"],"sourcesContent":["import { isDevelopmentEnvironment } from '../common/env';\nimport { globalScheduler } from './scheduler';\nimport { logger } from '../dev/logger';\nimport type { ComponentInstance } from './component';\nimport { finalizeReadableSubscriptions } from './readable';\nimport {\n  getKeyMapForElement,\n  isKeyedReorderFastPathEligible,\n  populateKeyMapForElement,\n} from '../renderer/keyed';\nimport { Fragment } from '../common/jsx';\nimport { setDevValue, getDevValue, getDevNamespace } from './dev-namespace';\n\nlet _bulkCommitActive = false;\nlet _appliedParents: WeakSet<Element> | null = null;\n\nexport function enterBulkCommit(): void {\n  _bulkCommitActive = true;\n  // Initialize registry of parents that had fast-path applied during this bulk commit\n  _appliedParents = new WeakSet<Element>();\n  setDevValue('__ASKR_FASTLANE_CLEARED_TASKS', 0);\n}\n\nexport function exitBulkCommit(): void {\n  _bulkCommitActive = false;\n  // Clear registry to avoid leaking across commits\n  _appliedParents = null;\n}\n\nexport function isBulkCommitActive(): boolean {\n  return _bulkCommitActive;\n}\n\n// Mark that a fast-path was applied on a parent element during the active\n// bulk commit. No-op if there is no active bulk commit.\nexport function markFastPathApplied(parent: Element): void {\n  if (!_appliedParents) return;\n  try {\n    _appliedParents.add(parent);\n  } catch (e) {\n    void e;\n  }\n}\n\nexport function isFastPathApplied(parent: Element): boolean {\n  return !!(_appliedParents && _appliedParents.has(parent));\n}\n\nfunction finalizeReadSubscriptions(instance: ComponentInstance): void {\n  finalizeReadableSubscriptions(instance);\n}\n\n/**\n * Attempt to execute a runtime fast-lane for a single component's synchronous\n * render result. Returns true if the fast-lane was used and commit was done.\n *\n * Preconditions (checked conservatively):\n * - The render result is an intrinsic element root with keyed children\n * - The renderer's fast-path heuristics indicate to use the fast-path\n * - No mount operations are pending on the component instance\n * - No child vnodes are component functions (avoid async/component mounts)\n */\n\n// Helper to unwrap Fragment vnodes to get the first intrinsic element child\nfunction unwrapFragmentForFastPath(vnode: unknown): unknown {\n  if (!vnode || typeof vnode !== 'object' || !('type' in vnode)) return vnode;\n  const v = vnode as {\n    type: unknown;\n    children?: unknown;\n    props?: { children?: unknown };\n  };\n  // Check if it's a Fragment\n  if (\n    typeof v.type === 'symbol' &&\n    (v.type === Fragment || String(v.type) === 'Symbol(askr.fragment)')\n  ) {\n    const children = v.props?.children ?? v.children;\n    if (Array.isArray(children) && children.length > 0) {\n      // Return the first child that's an intrinsic element\n      for (const child of children) {\n        if (child && typeof child === 'object' && 'type' in child) {\n          const c = child as { type: unknown };\n          if (typeof c.type === 'string') {\n            return child;\n          }\n        }\n      }\n    }\n  }\n  return vnode;\n}\n\nexport function classifyUpdate(instance: ComponentInstance, result: unknown) {\n  // Returns a classification describing whether this update is eligible for\n  // the reorder-only fast-lane. The classifier mirrors renderer-level\n  // heuristics and performs runtime-level checks (mounts, effects, component\n  // children) that the renderer cannot reason about.\n\n  // Unwrap Fragment to get the actual element vnode for classification\n  const unwrappedResult = unwrapFragmentForFastPath(result);\n\n  if (\n    !unwrappedResult ||\n    typeof unwrappedResult !== 'object' ||\n    !('type' in unwrappedResult)\n  )\n    return { useFastPath: false, reason: 'not-vnode' };\n\n  const vnode = unwrappedResult as {\n    type: unknown;\n    children?: unknown;\n    props?: { children?: unknown };\n  };\n  if (vnode == null || typeof vnode.type !== 'string')\n    return { useFastPath: false, reason: 'not-intrinsic' };\n\n  const parent = instance.target;\n  if (!parent) return { useFastPath: false, reason: 'no-root' };\n\n  const firstChild = parent.children[0] as Element | undefined;\n  if (!firstChild) return { useFastPath: false, reason: 'no-first-child' };\n  if (firstChild.tagName.toLowerCase() !== String(vnode.type).toLowerCase())\n    return { useFastPath: false, reason: 'root-tag-mismatch' };\n\n  const children = vnode.props?.children ?? vnode.children;\n  if (!Array.isArray(children))\n    return { useFastPath: false, reason: 'no-children-array' };\n\n  // Avoid component child vnodes (they may mount/unmount or trigger async)\n  for (const c of children) {\n    if (\n      typeof c === 'object' &&\n      c !== null &&\n      'type' in c &&\n      typeof (c as { type?: unknown }).type === 'function'\n    ) {\n      return { useFastPath: false, reason: 'component-child-present' };\n    }\n  }\n\n  if ((instance.mountOperations?.length ?? 0) > 0)\n    return { useFastPath: false, reason: 'pending-mounts' };\n  if ((instance.commitOperations?.length ?? 0) > 0)\n    return { useFastPath: false, reason: 'pending-lifecycle-commits' };\n\n  // Ask renderer for keyed reorder eligibility (prop differences & heuristics)\n  // Ensure a keyed map is available for the first child by populating it proactively.\n  try {\n    populateKeyMapForElement(firstChild);\n  } catch {\n    // ignore\n  }\n\n  const oldKeyMap = getKeyMapForElement(firstChild);\n  const decision = isKeyedReorderFastPathEligible(\n    firstChild,\n    children,\n    oldKeyMap\n  );\n\n  if (!decision.useFastPath || decision.totalKeyed < 128)\n    return { ...decision, useFastPath: false, reason: 'renderer-declined' };\n\n  return { ...decision, useFastPath: true } as const;\n}\n\nexport function commitReorderOnly(\n  instance: ComponentInstance,\n  result: unknown\n): boolean {\n  // Performs the minimal, synchronous reorder-only commit.\n  const evaluate = (\n    globalThis as {\n      __ASKR_RENDERER?: {\n        evaluate?: (node: unknown, target: Element | null) => void;\n      };\n    }\n  ).__ASKR_RENDERER?.evaluate;\n\n  if (typeof evaluate !== 'function') {\n    logger.warn(\n      '[Tempo][FASTPATH][DEV] renderer.evaluate not available; declining fast-lane'\n    );\n    return false;\n  }\n\n  const schedBefore = isDevelopmentEnvironment()\n    ? globalScheduler.getState()\n    : null;\n\n  enterBulkCommit();\n\n  try {\n    globalScheduler.runWithSyncProgress(() => {\n      evaluate(result, instance.target);\n\n      // Finalize runtime bookkeeping (read subscriptions / tokens)\n      try {\n        finalizeReadSubscriptions(instance);\n      } catch (e) {\n        if (isDevelopmentEnvironment()) throw e;\n      }\n    });\n\n    setDevValue('__FASTLANE_CLEARED_AFTER', 0);\n\n    // Dev-only invariant checks\n    if (isDevelopmentEnvironment()) {\n      validateFastLaneInvariants(instance, schedBefore);\n    }\n\n    return true;\n  } finally {\n    // Clear bulk commit flag first\n    exitBulkCommit();\n  }\n  // Note: The original code had a check here that was dead code because\n  // exitBulkCommit() already ran in the finally block. This comment serves\n  // as documentation that we've intentionally removed that unreachable code.\n}\n\n/**\n * Validates fast-lane invariants in dev mode.\n * Extracted to reduce complexity in commitReorderOnly.\n */\nfunction validateFastLaneInvariants(\n  instance: ComponentInstance,\n  schedBefore: ReturnType<typeof globalScheduler.getState> | null\n): void {\n  const commitCount = getDevValue<number>('__LAST_FASTPATH_COMMIT_COUNT') ?? 0;\n  const invariants = {\n    commitCount,\n    mountOps: instance.mountOperations?.length ?? 0,\n    commitOps: instance.commitOperations?.length ?? 0,\n    cleanupFns: instance.cleanupFns?.length ?? 0,\n  };\n  setDevValue('__LAST_FASTLANE_INVARIANTS', invariants);\n\n  if (commitCount !== 1) {\n    console.error(\n      '[FASTLANE][INV] commitCount',\n      commitCount,\n      'diag',\n      getDevNamespace()\n    );\n    throw new Error(\n      'Fast-lane invariant violated: expected exactly one DOM commit during reorder-only commit'\n    );\n  }\n\n  if (invariants.mountOps > 0) {\n    throw new Error(\n      'Fast-lane invariant violated: mount operations were registered during bulk commit'\n    );\n  }\n\n  if (invariants.commitOps > 0) {\n    throw new Error(\n      'Fast-lane invariant violated: lifecycle commit operations were registered during bulk commit'\n    );\n  }\n\n  if (invariants.cleanupFns > 0) {\n    throw new Error(\n      'Fast-lane invariant violated: cleanup functions were added during bulk commit'\n    );\n  }\n\n  const schedAfter = globalScheduler.getState();\n  if (\n    schedBefore &&\n    schedAfter &&\n    schedAfter.taskCount > schedBefore.taskCount\n  ) {\n    console.error(\n      '[FASTLANE] schedBefore, schedAfter',\n      schedBefore,\n      schedAfter\n    );\n    console.error('[FASTLANE] enqueue logs', getDevValue('__ENQUEUE_LOGS'));\n    throw new Error(\n      'Fast-lane invariant violated: scheduler enqueued leftover work during bulk commit'\n    );\n  }\n}\n\nexport function tryRuntimeFastLaneSync(\n  instance: ComponentInstance,\n  result: unknown\n): boolean {\n  const cls = classifyUpdate(instance, result);\n  if (!cls.useFastPath) {\n    // Clear stale fast-path diagnostics\n    setDevValue('__LAST_FASTPATH_STATS', undefined);\n    setDevValue('__LAST_FASTPATH_COMMIT_COUNT', 0);\n    return false;\n  }\n\n  try {\n    return commitReorderOnly(instance, result);\n  } catch (err) {\n    // Surface dev-only invariant failures, otherwise decline silently\n    if (isDevelopmentEnvironment()) throw err;\n    return false;\n  }\n}\n\n// Expose fastlane bridge on globalThis for environments/tests\nif (typeof globalThis !== 'undefined') {\n  (globalThis as Record<string, unknown>).__ASKR_FASTLANE = {\n    isBulkCommitActive,\n    enterBulkCommit,\n    exitBulkCommit,\n    tryRuntimeFastLaneSync,\n    markFastPathApplied,\n    isFastPathApplied,\n  };\n}\n"],"mappings":";;;;;;;;AAaA,IAAI,oBAAoB;AACxB,IAAI,kBAA2C;AAE/C,SAAgB,kBAAwB;CACtC,oBAAoB;CAEpB,kCAAkB,IAAI,QAAiB;CACvC,YAAY,iCAAiC,CAAC;AAChD;AAEA,SAAgB,iBAAuB;CACrC,oBAAoB;CAEpB,kBAAkB;AACpB;AAEA,SAAgB,qBAA8B;CAC5C,OAAO;AACT;AAIA,SAAgB,oBAAoB,QAAuB;CACzD,IAAI,CAAC,iBAAiB;CACtB,IAAI;EACF,gBAAgB,IAAI,MAAM;CAC5B,SAAS,GAAG,CAEZ;AACF;AAEA,SAAgB,kBAAkB,QAA0B;CAC1D,OAAO,CAAC,EAAE,mBAAmB,gBAAgB,IAAI,MAAM;AACzD;AAEA,SAAS,0BAA0B,UAAmC;CACpE,8BAA8B,QAAQ;AACxC;;;;;;;;;;;AAcA,SAAS,0BAA0B,OAAyB;CAC1D,IAAI,CAAC,SAAS,OAAO,UAAU,YAAY,EAAE,UAAU,QAAQ,OAAO;CACtE,MAAM,IAAI;CAMV,IACE,OAAO,EAAE,SAAS,aACjB,EAAE,SAAS,YAAY,OAAO,EAAE,IAAI,MAAM,0BAC3C;EACA,MAAM,WAAW,EAAE,OAAO,YAAY,EAAE;EACxC,IAAI,MAAM,QAAQ,QAAQ,KAAK,SAAS,SAAS,GAE/C;QAAK,MAAM,SAAS,UAClB,IAAI,SAAS,OAAO,UAAU,YAAY,UAAU,OAElD;QAAI,OAAO,MAAE,SAAS,UACpB,OAAO;GACT;EAEJ;CAEJ;CACA,OAAO;AACT;AAEA,SAAgB,eAAe,UAA6B,QAAiB;CAO3E,MAAM,kBAAkB,0BAA0B,MAAM;CAExD,IACE,CAAC,mBACD,OAAO,oBAAoB,YAC3B,EAAE,UAAU,kBAEZ,OAAO;EAAE,aAAa;EAAO,QAAQ;CAAY;CAEnD,MAAM,QAAQ;CAKd,IAAI,SAAS,QAAQ,OAAO,MAAM,SAAS,UACzC,OAAO;EAAE,aAAa;EAAO,QAAQ;CAAgB;CAEvD,MAAM,SAAS,SAAS;CACxB,IAAI,CAAC,QAAQ,OAAO;EAAE,aAAa;EAAO,QAAQ;CAAU;CAE5D,MAAM,aAAa,OAAO,SAAS;CACnC,IAAI,CAAC,YAAY,OAAO;EAAE,aAAa;EAAO,QAAQ;CAAiB;CACvE,IAAI,WAAW,QAAQ,YAAY,MAAM,OAAO,MAAM,IAAI,CAAC,CAAC,YAAY,GACtE,OAAO;EAAE,aAAa;EAAO,QAAQ;CAAoB;CAE3D,MAAM,WAAW,MAAM,OAAO,YAAY,MAAM;CAChD,IAAI,CAAC,MAAM,QAAQ,QAAQ,GACzB,OAAO;EAAE,aAAa;EAAO,QAAQ;CAAoB;CAG3D,KAAK,MAAM,KAAK,UACd,IACE,OAAO,MAAM,YACb,MAAM,QACN,UAAU,KACV,OAAQ,EAAyB,SAAS,YAE1C,OAAO;EAAE,aAAa;EAAO,QAAQ;CAA0B;CAInE,KAAK,SAAS,iBAAiB,UAAU,KAAK,GAC5C,OAAO;EAAE,aAAa;EAAO,QAAQ;CAAiB;CACxD,KAAK,SAAS,kBAAkB,UAAU,KAAK,GAC7C,OAAO;EAAE,aAAa;EAAO,QAAQ;CAA4B;CAInE,IAAI;EACF,yBAAyB,UAAU;CACrC,QAAQ,CAER;CAGA,MAAM,WAAW,+BACf,YACA,UAHgB,oBAAoB,UAIpC,CACF;CAEA,IAAI,CAAC,SAAS,eAAe,SAAS,aAAa,KACjD,OAAO;EAAE,GAAG;EAAU,aAAa;EAAO,QAAQ;CAAoB;CAExE,OAAO;EAAE,GAAG;EAAU,aAAa;CAAK;AAC1C;AAEA,SAAgB,kBACd,UACA,QACS;CAET,MAAM,WACJ,WAKA,iBAAiB;CAEnB,IAAI,OAAO,aAAa,YAAY;EAClC,OAAO,KACL,6EACF;EACA,OAAO;CACT;CAEA,MAAM,cAAc,yBAAyB,IACzC,gBAAgB,SAAS,IACzB;CAEJ,gBAAgB;CAEhB,IAAI;EACF,gBAAgB,0BAA0B;GACxC,SAAS,QAAQ,SAAS,MAAM;GAGhC,IAAI;IACF,0BAA0B,QAAQ;GACpC,SAAS,GAAG;IACV,IAAI,yBAAyB,GAAG,MAAM;GACxC;EACF,CAAC;EAED,YAAY,4BAA4B,CAAC;EAGzC,IAAI,yBAAyB,GAC3B,2BAA2B,UAAU,WAAW;EAGlD,OAAO;CACT,UAAU;EAER,eAAe;CACjB;AAIF;;;;;AAMA,SAAS,2BACP,UACA,aACM;CACN,MAAM,cAAc,YAAoB,8BAA8B,KAAK;CAC3E,MAAM,aAAa;EACjB;EACA,UAAU,SAAS,iBAAiB,UAAU;EAC9C,WAAW,SAAS,kBAAkB,UAAU;EAChD,YAAY,SAAS,YAAY,UAAU;CAC7C;CACA,YAAY,8BAA8B,UAAU;CAEpD,IAAI,gBAAgB,GAAG;EACrB,QAAQ,MACN,+BACA,aACA,QACA,gBAAgB,CAClB;EACA,MAAM,IAAI,MACR,0FACF;CACF;CAEA,IAAI,WAAW,WAAW,GACxB,MAAM,IAAI,MACR,mFACF;CAGF,IAAI,WAAW,YAAY,GACzB,MAAM,IAAI,MACR,8FACF;CAGF,IAAI,WAAW,aAAa,GAC1B,MAAM,IAAI,MACR,+EACF;CAGF,MAAM,aAAa,gBAAgB,SAAS;CAC5C,IACE,eACA,cACA,WAAW,YAAY,YAAY,WACnC;EACA,QAAQ,MACN,sCACA,aACA,UACF;EACA,QAAQ,MAAM,2BAA2B,YAAY,gBAAgB,CAAC;EACtE,MAAM,IAAI,MACR,mFACF;CACF;AACF;AAEA,SAAgB,uBACd,UACA,QACS;CAET,IAAI,CADQ,eAAe,UAAU,MAChC,CAAA,CAAI,aAAa;EAEpB,YAAY,yBAAyB,MAAS;EAC9C,YAAY,gCAAgC,CAAC;EAC7C,OAAO;CACT;CAEA,IAAI;EACF,OAAO,kBAAkB,UAAU,MAAM;CAC3C,SAAS,KAAK;EAEZ,IAAI,yBAAyB,GAAG,MAAM;EACtC,OAAO;CACT;AACF;AAGA,IAAI,OAAO,eAAe,aACxB,WAAwC,kBAAkB;CACxD;CACA;CACA;CACA;CACA;CACA;AACF"}

package/dist/runtime/for.js.map

@@ -1 +1 @@
-{"version":3,"file":"for.js","names":[],"sources":["../../src/runtime/for.ts"],"sourcesContent":["/**\n * For primitive runtime\n *\n * Manages per-item component instances and array reconciliation\n * to eliminate over-invalidation in list rendering.\n */\n\nimport { type ComponentInstance, getCurrentInstance } from './component';\nimport { claimHookIndex } from './component';\nimport { type DOMElement, type VNode } from '../common/vnode';\nimport { isDevelopmentEnvironment } from '../common/env';\nimport { teardownNodeSubtree } from '../renderer/cleanup';\nimport {\n  createChildScope,\n  disposeChildScope,\n  type ChildScope,\n} from './child-scope';\nimport type { ForProps } from '../control/for';\nimport type { ForEachSource } from '../control/for';\nimport {\n  markReactivePropsDirtySource,\n  markReadableDerivedSubscribersDirty,\n  notifyReadableReaders,\n  recordReadableRead,\n  type ReadableSource,\n} from './readable';\nimport type { FineGrainedEffectHandle } from './effect';\nimport {\n  flushBenchMetrics,\n  getBenchMetrics,\n  isBenchBuildEnabled,\n  isBenchMetricScopeActive,\n  recordBenchEvent,\n  recordBenchCounter,\n  recordBenchFastLane,\n  recordBenchTiming,\n  resetBenchMetrics,\n  withBenchMetricScope,\n} from './for-bench';\n\nconst BENCH_BUILD_ENABLED = isBenchBuildEnabled();\n\nexport {\n  getBenchMetrics,\n  isBenchMetricScopeActive,\n  recordBenchEvent,\n  recordBenchCounter,\n  recordBenchTiming,\n  resetBenchMetrics,\n  withBenchMetricScope,\n};\n\nexport interface ForItemInstance<T> {\n  key: string | number;\n  item: T;\n  reactiveItem: T;\n  itemSignal: ForItemSignal<T> | null;\n  itemPropertySignals: Map<PropertyKey, ForItemPropertySignal> | null;\n  indexSignal: ForIndexSignal;\n  scope: ChildScope;\n}\n\ntype ForItemSignal<T> = ReadableSource<T> &\n  (() => T) & {\n    peek(): T;\n    set(newValue: T, notifyReaders?: boolean): void;\n  };\n\ntype ForItemPropertySignal = ReadableSource<unknown> &\n  (() => unknown) & {\n    peek(): unknown;\n    set(newValue: unknown, notifyReaders?: boolean): void;\n  };\n\ntype ForIndexSignal = ReadableSource<number> &\n  (() => number) & {\n    peek(): number;\n    set(\n      newValue: number | ((prev: number) => number),\n      notifyReaders?: boolean\n    ): void;\n  };\n\nexport type ForCommitStrategy =\n  | 'APPEND'\n  | 'TRUNCATE'\n  | 'NO_REORDER'\n  | 'SWAP'\n  | 'FULL_KEYED';\n\nexport interface ForState<T> {\n  kind: 'for';\n  currentItems: T[];\n  eachSource: ForEachSource<T>;\n  fallback: VNode | null;\n  fallbackScope: ChildScope | null;\n  items: Map<string | number, ForItemInstance<T>>;\n  orderedKeys: Array<string | number>;\n  orderedItems: ForItemInstance<T>[];\n  orderedVNodes: VNode[];\n  byFn: NonNullable<ForProps<T>['by']> | ((item: T, index: number) => number);\n  renderFn: (item: T, index: () => number) => VNode;\n  parentInstance: ComponentInstance | null;\n  lastCommitStrategy: ForCommitStrategy;\n  lastRemovedNodes: Node[];\n  pendingDirtyIndices: number[] | null;\n  pendingSwapIndices: [number, number] | null;\n  pendingMoveOnly: boolean;\n  _hasResolvedItemDom: boolean;\n  _needsSourceReconcile: boolean;\n  _sourceEffect: FineGrainedEffectHandle<T[]> | null;\n  _suspendSourceCommit: boolean;\n  _enqueueBoundaryCommit?: (() => void) | null;\n  _hasPendingBoundaryCommit?: boolean;\n  devKeyKinds?: Map<string, 'number' | 'string'>;\n}\n\nconst forStates = new WeakMap<\n  ComponentInstance,\n  Map<number, ForState<unknown>>\n>();\n\nfunction getForStore(\n  instance: ComponentInstance\n): Map<number, ForState<unknown>> {\n  let store = forStates.get(instance);\n  if (!store) {\n    store = new Map();\n    forStates.set(instance, store);\n  }\n  return store;\n}\n\nexport function createForState<T>(\n  eachSource: ForEachSource<T>,\n  byFn: ForState<T>['byFn'],\n  renderFn: (item: T, index: () => number) => VNode,\n  fallback: VNode | null\n): ForState<T> {\n  const parentInstance = getCurrentInstance();\n\n  return {\n    kind: 'for',\n    currentItems: [],\n    eachSource,\n    fallback,\n    fallbackScope: null,\n    items: new Map(),\n    orderedKeys: [],\n    orderedItems: [],\n    orderedVNodes: [],\n    byFn,\n    renderFn,\n    parentInstance,\n    lastCommitStrategy: 'NO_REORDER',\n    lastRemovedNodes: [],\n    pendingDirtyIndices: null,\n    pendingSwapIndices: null,\n    pendingMoveOnly: false,\n    _hasResolvedItemDom: false,\n    _needsSourceReconcile: false,\n    _sourceEffect: null,\n    _suspendSourceCommit: false,\n    _enqueueBoundaryCommit: null,\n    _hasPendingBoundaryCommit: false,\n  };\n}\n\nexport function useForState<T>(\n  eachSource: ForEachSource<T>,\n  byFn: ForState<T>['byFn'],\n  renderFn: (item: T, index: () => number) => VNode,\n  fallback: VNode | null\n): ForState<T> {\n  const instance = getCurrentInstance();\n  if (!instance) {\n    throw new Error(\n      'For can only be created during component render execution.'\n    );\n  }\n\n  const hookIndex = claimHookIndex(instance, 'For');\n  const store = getForStore(instance);\n  const existing = store.get(hookIndex) as ForState<T> | undefined;\n\n  if (existing) {\n    existing.eachSource = eachSource;\n    existing.byFn = byFn;\n    existing.renderFn = renderFn;\n    existing.fallback = fallback;\n    return existing;\n  }\n\n  const created = createForState(eachSource, byFn, renderFn, fallback);\n  store.set(hookIndex, created as ForState<unknown>);\n\n  (instance.cleanupFns ??= []).push(() => {\n    created._sourceEffect?.cleanup();\n    created._sourceEffect = null;\n    store.delete(hookIndex);\n  });\n\n  return created;\n}\n\nfunction createForIndexSignal(initialIndex: number): ForIndexSignal {\n  let indexValue = initialIndex;\n  const readers = new Map<ComponentInstance, number>();\n\n  const indexSignal = (() => {\n    indexSignal._hasBeenRead = true;\n    recordReadableRead(indexSignal);\n    return indexValue;\n  }) as ForIndexSignal;\n  indexSignal._readers = readers;\n  indexSignal.peek = () => indexValue;\n  indexSignal.set = (\n    newValue: number | ((prev: number) => number),\n    notifyReaders = true\n  ) => {\n    const nextValue =\n      typeof newValue === 'function' ? newValue(indexValue) : newValue;\n    if (nextValue !== indexValue) {\n      indexValue = nextValue;\n      if (notifyReaders) {\n        markReadableDerivedSubscribersDirty(indexSignal);\n        markReactivePropsDirtySource(indexSignal);\n        notifyReadableReaders(indexSignal);\n      }\n    }\n  };\n  indexSignal._hasBeenRead = false;\n\n  return indexSignal;\n}\n\nfunction syncForIndexSignal(\n  indexSignal: ForIndexSignal,\n  nextIndex: number\n): boolean {\n  if (indexSignal.peek() === nextIndex) {\n    return false;\n  }\n\n  indexSignal.set(nextIndex, indexSignal._hasBeenRead);\n  return indexSignal._hasBeenRead === true;\n}\n\nfunction syncForItemIndex<T>(\n  forState: ForState<T>,\n  itemInstance: ForItemInstance<T>,\n  nextIndex: number\n): boolean {\n  const indexSignal = itemInstance.indexSignal;\n  if (indexSignal.peek() === nextIndex) {\n    return false;\n  }\n\n  const scopeReadsIndex = scopeReadsSource(itemInstance.scope, indexSignal);\n  if (!scopeReadsIndex) {\n    syncForIndexSignal(indexSignal, nextIndex);\n    return false;\n  }\n\n  indexSignal.set(nextIndex, false);\n  markReadableDerivedSubscribersDirty(indexSignal);\n  markReactivePropsDirtySource(indexSignal);\n  notifyReadableReaders(indexSignal, itemInstance.scope.componentInstance);\n\n  rerenderItemInstance(forState, itemInstance, itemInstance.reactiveItem);\n\n  return true;\n}\n\nfunction createForItemSignal<T>(initialItem: T): ForItemSignal<T> {\n  let itemValue = initialItem;\n  const readers = new Map<ComponentInstance, number>();\n\n  const itemSignal = (() => {\n    itemSignal._hasBeenRead = true;\n    recordReadableRead(itemSignal);\n    return itemValue;\n  }) as ForItemSignal<T>;\n\n  itemSignal._readers = readers;\n  itemSignal.peek = () => itemValue;\n  itemSignal.set = (newValue: T, notifyReaders = true) => {\n    if (Object.is(itemValue, newValue)) {\n      return;\n    }\n\n    itemValue = newValue;\n    if (notifyReaders) {\n      markReadableDerivedSubscribersDirty(itemSignal);\n      markReactivePropsDirtySource(itemSignal);\n      notifyReadableReaders(itemSignal);\n    }\n  };\n  itemSignal._hasBeenRead = false;\n\n  return itemSignal;\n}\n\nfunction createForItemPropertySignal(\n  initialValue: unknown\n): ForItemPropertySignal {\n  let propertyValue = initialValue;\n  const readers = new Map<ComponentInstance, number>();\n\n  const propertySignal = (() => {\n    propertySignal._hasBeenRead = true;\n    recordReadableRead(propertySignal);\n    return propertyValue;\n  }) as ForItemPropertySignal;\n\n  propertySignal._readers = readers;\n  propertySignal.peek = () => propertyValue;\n  propertySignal.set = (newValue: unknown, notifyReaders = true) => {\n    if (Object.is(propertyValue, newValue)) {\n      return;\n    }\n\n    propertyValue = newValue;\n    if (notifyReaders) {\n      markReadableDerivedSubscribersDirty(propertySignal);\n      markReactivePropsDirtySource(propertySignal);\n      notifyReadableReaders(propertySignal);\n    }\n  };\n  propertySignal._hasBeenRead = false;\n\n  return propertySignal;\n}\n\nfunction readForItemProperty(item: unknown, prop: PropertyKey): unknown {\n  return Reflect.get(Object(item), prop);\n}\n\nfunction haveSameOwnKeys(previousItem: unknown, nextItem: unknown): boolean {\n  const previousKeys = Reflect.ownKeys(Object(previousItem));\n  const nextKeys = Reflect.ownKeys(Object(nextItem));\n\n  if (previousKeys.length !== nextKeys.length) {\n    return false;\n  }\n\n  for (let i = 0; i < previousKeys.length; i += 1) {\n    if (previousKeys[i] !== nextKeys[i]) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nfunction scopeReadsSource(\n  scope: ChildScope,\n  source: ReadableSource<unknown>\n): boolean {\n  return source._readers?.has(scope.componentInstance) ?? false;\n}\n\nfunction isForParentReader<T>(\n  forState: ForState<T>,\n  reader: ComponentInstance\n): boolean {\n  let current = forState.parentInstance;\n\n  while (current) {\n    if (current === reader) {\n      return true;\n    }\n    current = current.parentInstance;\n  }\n\n  return false;\n}\n\nfunction removeForParentReaders<T>(\n  forState: ForState<T>,\n  source: ReadableSource<unknown>\n): void {\n  const readers = source._readers;\n  if (!readers || readers.size === 0) {\n    return;\n  }\n\n  for (const reader of readers.keys()) {\n    if (isForParentReader(forState, reader)) {\n      readers.delete(reader);\n    }\n  }\n}\n\nfunction getOrCreateForItemPropertySignal<T>(\n  item: T,\n  propertySignals: Map<PropertyKey, ForItemPropertySignal>,\n  prop: PropertyKey\n): ForItemPropertySignal {\n  const existingSignal = propertySignals.get(prop);\n  if (existingSignal) {\n    return existingSignal;\n  }\n\n  const propertySignal = createForItemPropertySignal(\n    readForItemProperty(item, prop)\n  );\n  propertySignals.set(prop, propertySignal);\n  return propertySignal;\n}\n\nfunction canProxyForItem(item: unknown): item is object {\n  return (\n    (typeof item === 'object' && item !== null) || typeof item === 'function'\n  );\n}\n\nfunction createReactiveForItem<T>(\n  itemSignal: ForItemSignal<T>,\n  propertySignals: Map<PropertyKey, ForItemPropertySignal>\n): T {\n  const target = Object.create(null) as Record<string | symbol, unknown>;\n\n  return new Proxy(target, {\n    get(target, prop, receiver) {\n      const ownDescriptor = Reflect.getOwnPropertyDescriptor(target, prop);\n      if (ownDescriptor) {\n        return Reflect.get(target, prop, receiver);\n      }\n\n      const currentItem = itemSignal.peek();\n\n      if (typeof prop !== 'symbol') {\n        return getOrCreateForItemPropertySignal(\n          currentItem,\n          propertySignals,\n          prop\n        )();\n      }\n\n      recordReadableRead(itemSignal);\n      return Reflect.get(Object(currentItem), prop, receiver);\n    },\n    has(target, prop) {\n      recordReadableRead(itemSignal);\n      return prop in target || prop in Object(itemSignal.peek());\n    },\n    ownKeys(target) {\n      recordReadableRead(itemSignal);\n      const keys = new Set<string | symbol>(Reflect.ownKeys(target));\n      for (const key of Reflect.ownKeys(Object(itemSignal.peek()))) {\n        keys.add(key);\n      }\n\n      return Array.from(keys);\n    },\n    getOwnPropertyDescriptor(target, prop) {\n      recordReadableRead(itemSignal);\n      const ownDescriptor = Reflect.getOwnPropertyDescriptor(target, prop);\n      if (ownDescriptor) {\n        return ownDescriptor;\n      }\n\n      return Object.getOwnPropertyDescriptor(Object(itemSignal.peek()), prop);\n    },\n    getPrototypeOf() {\n      recordReadableRead(itemSignal);\n      return Object.getPrototypeOf(Object(itemSignal.peek()));\n    },\n  }) as T;\n}\n\nfunction materializeItemVnode(\n  key: string | number,\n  vnode: VNode | undefined\n): void {\n  if (vnode && typeof vnode === 'object' && 'type' in vnode) {\n    const vn = vnode as DOMElement;\n    vn.key = key;\n\n    if (typeof vn.type === 'string') {\n      if (!vn.props) vn.props = {};\n      if (vn.props['data-key'] === undefined) {\n        vn.props['data-key'] = String(key);\n      }\n    }\n  }\n}\n\nfunction renderItemScope<T>(\n  forState: ForState<T>,\n  scope: ChildScope,\n  item: T,\n  indexSignal: ForIndexSignal,\n  key: string | number\n): VNode {\n  recordBenchEvent('rowFactory');\n  const vnode = scope.render(() => forState.renderFn(item, indexSignal));\n  materializeItemVnode(key, vnode);\n  return vnode;\n}\n\nfunction failForValidation(message: string): never {\n  throw new Error(message);\n}\n\nfunction validateForKeys<T>(forState: ForState<T>, newArray: T[]): void {\n  if (!isDevelopmentEnvironment()) {\n    return;\n  }\n\n  const seen = new Set<string | number>();\n  const keyKinds = new Map<string, 'number' | 'string'>();\n  for (let i = 0; i < newArray.length; i++) {\n    const key = forState.byFn(newArray[i], i);\n\n    if (key === null || key === undefined) {\n      failForValidation(\n        '[askr] Invalid For key detected. Keys should be stable, non-null, and unique within a For list.'\n      );\n    }\n\n    if (seen.has(key)) {\n      failForValidation(\n        `[askr] Duplicate For key detected: ${String(key)}. Keys should be stable, non-null, and unique within a For list.`\n      );\n    }\n\n    seen.add(key);\n\n    const keyString = String(key);\n    const keyKind = typeof key;\n    const previousKeyKind = forState.devKeyKinds?.get(keyString);\n    if (previousKeyKind && previousKeyKind !== keyKind) {\n      failForValidation(\n        `[askr] For key type changed for ${keyString}. Keys must remain consistently typed across renders.`\n      );\n    }\n    keyKinds.set(keyString, keyKind as 'number' | 'string');\n  }\n\n  forState.devKeyKinds = keyKinds;\n}\n\ntype RemovedDomCleanupMode = 'none' | 'teardown' | 'full-clear';\n\nfunction disposeItemInstance<T>(\n  forState: ForState<T>,\n  itemInstance: ForItemInstance<T>,\n  domCleanup: RemovedDomCleanupMode\n): void {\n  recordBenchEvent('itemRemoved');\n  const removedDom = itemInstance.scope.dom;\n\n  try {\n    disposeChildScope(itemInstance.scope);\n  } catch (err) {\n    if (isDevelopmentEnvironment()) {\n      console.error('[For] Cleanup error:', err);\n    }\n  }\n\n  if (!removedDom) {\n    return;\n  }\n\n  if (removedDom instanceof Element) {\n    if (domCleanup === 'teardown') {\n      teardownNodeSubtree(removedDom);\n    }\n  }\n\n  forState.lastRemovedNodes.push(removedDom);\n}\n\nexport function createItemInstance<T>(\n  key: string | number,\n  item: T,\n  index: number,\n  forState: ForState<T>\n): ForItemInstance<T> {\n  recordBenchEvent('itemCreated');\n\n  // Create index signal manually without going through state() hook\n  // to avoid hook order violations (each For item creates its signal dynamically)\n  const indexSignal = createForIndexSignal(index);\n  const itemSignal = canProxyForItem(item) ? createForItemSignal(item) : null;\n  const itemPropertySignals = itemSignal\n    ? new Map<PropertyKey, ForItemPropertySignal>()\n    : null;\n  const reactiveItem =\n    itemSignal && itemPropertySignals\n      ? createReactiveForItem(itemSignal, itemPropertySignals)\n      : item;\n  let itemInstance: ForItemInstance<T> | null = null;\n  const scope = createChildScope(forState.parentInstance, key, () => {\n    if (forState._enqueueBoundaryCommit) {\n      forState._enqueueBoundaryCommit();\n      return;\n    }\n\n    const parent = forState.parentInstance;\n    if (parent) {\n      parent._enqueueRun?.();\n    }\n  });\n\n  renderItemScope(forState, scope, reactiveItem, indexSignal, key);\n\n  itemInstance = {\n    key,\n    item,\n    reactiveItem,\n    itemSignal,\n    itemPropertySignals,\n    indexSignal,\n    scope,\n  };\n\n  return itemInstance;\n}\n\nfunction rerenderItemInstance<T>(\n  forState: ForState<T>,\n  itemInstance: ForItemInstance<T>,\n  item: T\n): void {\n  renderItemScope(\n    forState,\n    itemInstance.scope,\n    item,\n    itemInstance.indexSignal,\n    itemInstance.key\n  );\n}\n\nfunction updateItemInstance<T>(\n  forState: ForState<T>,\n  itemInstance: ForItemInstance<T>,\n  item: T\n): boolean {\n  if (itemInstance.item === item) {\n    return false;\n  }\n\n  const previousItem = itemInstance.item;\n  itemInstance.item = item;\n\n  const scope = itemInstance.scope;\n  let scopeReadsChangedSignal = false;\n  const itemSignal = itemInstance.itemSignal;\n  if (!itemSignal) {\n    rerenderItemInstance(forState, itemInstance, item);\n    return true;\n  }\n\n  const propertySignals = itemInstance.itemPropertySignals;\n  const changedPropertySignals: Array<[ForItemPropertySignal, unknown]> = [];\n  if (propertySignals && propertySignals.size > 0) {\n    for (const [prop, propertySignal] of propertySignals) {\n      const previousValue = readForItemProperty(previousItem, prop);\n      const nextValue = readForItemProperty(item, prop);\n      if (Object.is(previousValue, nextValue)) {\n        continue;\n      }\n\n      if (scopeReadsSource(scope, propertySignal)) {\n        scopeReadsChangedSignal = true;\n      }\n\n      changedPropertySignals.push([propertySignal, nextValue]);\n    }\n  }\n\n  if (scopeReadsSource(scope, itemSignal)) {\n    scopeReadsChangedSignal = true;\n  }\n\n  const itemShapeChanged =\n    changedPropertySignals.length === 0 && !haveSameOwnKeys(previousItem, item);\n  const notifyReaders =\n    !scopeReadsChangedSignal &&\n    (changedPropertySignals.length > 0 || itemShapeChanged);\n  const visibleChange =\n    scopeReadsChangedSignal ||\n    changedPropertySignals.length > 0 ||\n    itemShapeChanged;\n  for (const [propertySignal, nextValue] of changedPropertySignals) {\n    removeForParentReaders(forState, propertySignal);\n    propertySignal.set(nextValue, notifyReaders);\n  }\n  removeForParentReaders(forState, itemSignal);\n  itemSignal.set(item, notifyReaders);\n\n  if (scopeReadsChangedSignal) {\n    rerenderItemInstance(forState, itemInstance, itemInstance.reactiveItem);\n  }\n\n  return visibleChange;\n}\n\nconst FOR_FALLBACK_SCOPE_KEY = '__for-fallback__';\n\nfunction disposeFallbackScope<T>(\n  forState: ForState<T>,\n  domCleanup: RemovedDomCleanupMode\n): void {\n  const fallbackScope = forState.fallbackScope;\n  if (!fallbackScope) {\n    return;\n  }\n\n  const removedDom = fallbackScope.dom;\n  disposeChildScope(fallbackScope);\n  forState.fallbackScope = null;\n\n  if (!removedDom) {\n    return;\n  }\n\n  if (removedDom instanceof Element) {\n    if (domCleanup === 'teardown') {\n      teardownNodeSubtree(removedDom);\n    }\n  }\n\n  forState.lastRemovedNodes.push(removedDom);\n}\n\nfunction renderFallbackScope<T>(forState: ForState<T>): VNode[] {\n  if (forState.fallback == null || forState.fallback === false) {\n    if (forState.fallbackScope) {\n      disposeFallbackScope(forState, 'none');\n    }\n    forState.orderedVNodes = [];\n    forState.orderedItems = [];\n    return [];\n  }\n\n  const fallbackScope =\n    forState.fallbackScope ??\n    createChildScope(forState.parentInstance, FOR_FALLBACK_SCOPE_KEY, () => {\n      if (forState._enqueueBoundaryCommit) {\n        forState._enqueueBoundaryCommit();\n        return;\n      }\n\n      forState.parentInstance?._enqueueRun?.();\n    });\n  forState.fallbackScope = fallbackScope;\n\n  const vnode = fallbackScope.render(() => forState.fallback as VNode);\n  forState.orderedVNodes = vnode == null || vnode === false ? [] : [vnode];\n  forState.orderedItems = [];\n  return forState.orderedVNodes;\n}\n\nfunction disposeAllItems<T>(\n  forState: ForState<T>,\n  domCleanup: RemovedDomCleanupMode\n): void {\n  const { items, orderedKeys } = forState;\n  for (let index = 0; index < orderedKeys.length; index += 1) {\n    const key = orderedKeys[index];\n    const itemInstance = items.get(key);\n    if (!itemInstance) {\n      continue;\n    }\n    disposeItemInstance(forState, itemInstance, domCleanup);\n    items.delete(key);\n  }\n  orderedKeys.length = 0;\n  forState.orderedKeys = orderedKeys;\n}\n\nexport function reconcileForItems<T>(\n  forState: ForState<T>,\n  newArray: T[]\n): VNode[] {\n  forState.currentItems = newArray;\n  validateForKeys(forState, newArray);\n\n  if (BENCH_BUILD_ENABLED) {\n    resetBenchMetrics();\n  }\n\n  const reconcileStartMs = BENCH_BUILD_ENABLED ? performance.now() : 0;\n\n  const { items, orderedKeys, byFn } = forState;\n  const oldLen = orderedKeys.length;\n  const newLen = newArray.length;\n  forState.lastRemovedNodes = [];\n\n  if (newLen === 0) {\n    if (oldLen > 0) {\n      disposeAllItems(forState, forState.fallback ? 'teardown' : 'none');\n    }\n    recordBenchFastLane('TRUNCATE');\n    forState.lastCommitStrategy = 'TRUNCATE';\n    forState.pendingDirtyIndices = null;\n    forState.pendingSwapIndices = null;\n    forState.pendingMoveOnly = false;\n\n    if (BENCH_BUILD_ENABLED) {\n      recordBenchTiming('reconcile', performance.now() - reconcileStartMs);\n      flushBenchMetrics();\n    }\n\n    return renderFallbackScope(forState);\n  }\n\n  if (forState.fallbackScope) {\n    disposeFallbackScope(forState, 'none');\n  }\n\n  // ─────────────────────────────────────────────────────────────────────────\n  // FAST PATH A: APPEND\n  // Guard: oldLen <= newLen && all old keys match new keys at same indices\n  // ─────────────────────────────────────────────────────────────────────────\n  if (oldLen < newLen) {\n    let canUseAppendPath = true;\n    for (let i = 0; i < oldLen; i++) {\n      const key = byFn(newArray[i], i);\n      if (key !== orderedKeys[i]) {\n        canUseAppendPath = false;\n        break;\n      }\n    }\n\n    if (canUseAppendPath) {\n      recordBenchFastLane('APPEND');\n      forState.lastCommitStrategy = 'APPEND';\n      const resultVNodes = forState.orderedVNodes;\n      const resultItems = forState.orderedItems;\n      resultVNodes.length = newLen;\n      resultItems.length = newLen;\n\n      // Update existing rows in-place\n      for (let i = 0; i < oldLen; i++) {\n        const item = newArray[i];\n        const key = orderedKeys[i];\n        const existing = resultItems[i] ?? items.get(key)!;\n\n        updateItemInstance(forState, existing, item);\n\n        resultItems[i] = existing;\n        resultVNodes[i] = existing.scope.vnode as VNode;\n      }\n\n      recordBenchEvent('itemReused', oldLen);\n\n      // Create and append new rows\n      for (let i = oldLen; i < newLen; i++) {\n        const item = newArray[i];\n        const key = byFn(item, i);\n        const itemInstance = createItemInstance(key, item, i, forState);\n        items.set(key, itemInstance);\n        resultItems[i] = itemInstance;\n        resultVNodes[i] = itemInstance.scope.vnode as VNode;\n        orderedKeys[i] = key;\n      }\n\n      if (BENCH_BUILD_ENABLED) {\n        recordBenchTiming('reconcile', performance.now() - reconcileStartMs);\n        flushBenchMetrics();\n      }\n\n      forState.orderedVNodes = resultVNodes;\n      forState.pendingDirtyIndices = null;\n      forState.pendingSwapIndices = null;\n      forState.pendingMoveOnly = false;\n\n      return resultVNodes;\n    }\n  }\n\n  // ─────────────────────────────────────────────────────────────────────────\n  // FAST PATH B: TRUNCATE\n  // Guard: newLen <= oldLen && all new keys match old keys at same indices\n  // ─────────────────────────────────────────────────────────────────────────\n  if (newLen < oldLen) {\n    if (oldLen === newLen + 1) {\n      let removedIndex = -1;\n\n      for (let i = 0; i < newLen; i++) {\n        const nextKey = byFn(newArray[i], i);\n        if (nextKey !== orderedKeys[i]) {\n          removedIndex = i;\n          break;\n        }\n      }\n\n      if (removedIndex !== -1) {\n        let canUseRemoveOnePath = true;\n        for (let i = removedIndex; i < newLen; i++) {\n          const nextKey = byFn(newArray[i], i);\n          if (nextKey !== orderedKeys[i + 1]) {\n            canUseRemoveOnePath = false;\n            break;\n          }\n        }\n\n        if (canUseRemoveOnePath) {\n          recordBenchFastLane('REMOVE_ONE');\n          forState.lastCommitStrategy = 'NO_REORDER';\n\n          const previousOrderedItems = forState.orderedItems.slice();\n          const resultVNodes = forState.orderedVNodes;\n          const resultItems = forState.orderedItems;\n          resultVNodes.length = newLen;\n          resultItems.length = newLen;\n          const dirtyIndices: number[] = [];\n\n          for (let i = 0; i < newLen; i++) {\n            const item = newArray[i];\n            const key = i < removedIndex ? orderedKeys[i] : orderedKeys[i + 1];\n            const existing = items.get(key)!;\n            const scopeNeedsDomUpdate = existing.scope.needsDomUpdate;\n\n            const itemChanged = existing.item !== item;\n            const indexSignal = existing.indexSignal;\n            const indexChanged = indexSignal.peek() !== i;\n\n            if (itemChanged) {\n              updateItemInstance(forState, existing, item);\n            }\n\n            const indexVisibleChange = indexChanged\n              ? syncForItemIndex(forState, existing, i)\n              : false;\n\n            if (itemChanged || indexVisibleChange || scopeNeedsDomUpdate) {\n              dirtyIndices.push(i);\n            }\n\n            resultItems[i] = existing;\n            resultVNodes[i] = existing.scope.vnode as VNode;\n          }\n\n          recordBenchEvent('itemReused', newLen);\n\n          const removedKey = orderedKeys[removedIndex];\n          const removedItem = items.get(removedKey);\n          if (removedItem) {\n            disposeItemInstance(forState, removedItem, 'teardown');\n            items.delete(removedKey);\n          }\n\n          const nextOrderedKeys = orderedKeys.slice(0, newLen);\n          const nextOrderedItems = previousOrderedItems.slice(0, newLen);\n          for (let i = removedIndex; i < newLen; i++) {\n            nextOrderedKeys[i] = orderedKeys[i + 1];\n            nextOrderedItems[i] = previousOrderedItems[i + 1];\n          }\n          forState.orderedKeys = nextOrderedKeys;\n          forState.orderedItems = nextOrderedItems;\n\n          if (BENCH_BUILD_ENABLED) {\n            recordBenchTiming(\n              'reconcile',\n              performance.now() - reconcileStartMs\n            );\n            flushBenchMetrics();\n          }\n\n          forState.pendingDirtyIndices = dirtyIndices;\n          forState.pendingSwapIndices = null;\n          forState.pendingMoveOnly = false;\n\n          return resultVNodes;\n        }\n      }\n    }\n\n    let canUseTruncatePath = true;\n    for (let i = 0; i < newLen; i++) {\n      const key = byFn(newArray[i], i);\n      if (key !== orderedKeys[i]) {\n        canUseTruncatePath = false;\n        break;\n      }\n    }\n\n    if (canUseTruncatePath) {\n      recordBenchFastLane('TRUNCATE');\n      forState.lastCommitStrategy = 'TRUNCATE';\n      const resultVNodes = forState.orderedVNodes;\n      const resultItems = forState.orderedItems;\n      resultVNodes.length = newLen;\n      resultItems.length = newLen;\n      const isFullClear = newLen === 0;\n\n      // Update existing rows in-place\n      for (let i = 0; i < newLen; i++) {\n        const item = newArray[i];\n        const key = orderedKeys[i];\n        const existing = items.get(key)!;\n\n        updateItemInstance(forState, existing, item);\n\n        resultItems[i] = existing;\n        resultVNodes[i] = existing.scope.vnode as VNode;\n      }\n\n      recordBenchEvent('itemReused', newLen);\n\n      // Remove tail rows\n      for (let i = newLen; i < oldLen; i++) {\n        const key = orderedKeys[i];\n        const itemInstance = items.get(key);\n        if (itemInstance) {\n          disposeItemInstance(\n            forState,\n            itemInstance,\n            isFullClear ? 'full-clear' : 'teardown'\n          );\n          items.delete(key);\n        }\n      }\n\n      orderedKeys.length = newLen;\n      forState.orderedKeys = orderedKeys;\n      forState.orderedItems.length = newLen;\n\n      if (BENCH_BUILD_ENABLED) {\n        recordBenchTiming('reconcile', performance.now() - reconcileStartMs);\n        flushBenchMetrics();\n      }\n\n      forState.orderedVNodes = resultVNodes;\n      forState.pendingDirtyIndices = null;\n      forState.pendingSwapIndices = null;\n      forState.pendingMoveOnly = false;\n\n      return resultVNodes;\n    }\n  }\n\n  // ─────────────────────────────────────────────────────────────────────────\n  // FAST PATH C: NO-REORDER (in-place update only)\n  // Guard: oldLen === newLen && keys match at all indices\n  // ─────────────────────────────────────────────────────────────────────────\n  if (oldLen === newLen) {\n    let canUseNoReorderPath = true;\n    for (let i = 0; i < oldLen; i++) {\n      const key = byFn(newArray[i], i);\n      if (key !== orderedKeys[i]) {\n        canUseNoReorderPath = false;\n        break;\n      }\n    }\n\n    if (canUseNoReorderPath) {\n      recordBenchFastLane('NO_REORDER');\n      forState.lastCommitStrategy = 'NO_REORDER';\n      const resultVNodes = forState.orderedVNodes;\n      const resultItems = forState.orderedItems;\n      resultVNodes.length = oldLen;\n      resultItems.length = oldLen;\n      const dirtyIndices: number[] = [];\n      // Update in-place only, no DOM moves needed\n      for (let i = 0; i < oldLen; i++) {\n        const item = newArray[i];\n        const key = orderedKeys[i];\n        const existing = items.get(key)!;\n        const itemChanged = existing.item !== item;\n\n        if (itemChanged) {\n          updateItemInstance(forState, existing, item);\n        }\n\n        if (!itemChanged && existing.scope.needsDomUpdate) {\n          dirtyIndices.push(i);\n        }\n\n        resultItems[i] = existing;\n        resultVNodes[i] = existing.scope.vnode as VNode;\n      }\n\n      recordBenchEvent('itemReused', oldLen);\n\n      if (BENCH_BUILD_ENABLED) {\n        recordBenchTiming('reconcile', performance.now() - reconcileStartMs);\n        flushBenchMetrics();\n      }\n\n      forState.pendingDirtyIndices = dirtyIndices;\n      forState.pendingSwapIndices = null;\n      forState.pendingMoveOnly = false;\n\n      return resultVNodes;\n    }\n\n    let firstMismatch = -1;\n    let secondMismatch = -1;\n    let firstMismatchKey: string | number | null = null;\n    let secondMismatchKey: string | number | null = null;\n    let mismatchCount = 0;\n    let canUseSwapPath = true;\n\n    for (let i = 0; i < oldLen; i++) {\n      const item = newArray[i];\n      const key = byFn(newArray[i], i);\n      if (key === orderedKeys[i]) {\n        const existing = items.get(key);\n        if (existing && existing.item !== item) {\n          canUseSwapPath = false;\n          break;\n        }\n        continue;\n      }\n\n      mismatchCount++;\n      if (firstMismatch === -1) {\n        firstMismatch = i;\n        firstMismatchKey = key;\n        continue;\n      }\n\n      if (secondMismatch === -1) {\n        secondMismatch = i;\n        secondMismatchKey = key;\n        continue;\n      }\n\n      mismatchCount = 3;\n      break;\n    }\n\n    if (\n      canUseSwapPath &&\n      mismatchCount === 2 &&\n      firstMismatch !== -1 &&\n      secondMismatch !== -1 &&\n      firstMismatchKey === orderedKeys[secondMismatch] &&\n      secondMismatchKey === orderedKeys[firstMismatch]\n    ) {\n      recordBenchFastLane('SWAP');\n      recordBenchEvent('itemMoved');\n      recordBenchEvent('itemMoved');\n\n      forState.lastCommitStrategy = 'SWAP';\n\n      const nextOrderedKeys = orderedKeys.slice();\n      nextOrderedKeys[firstMismatch] = firstMismatchKey;\n      nextOrderedKeys[secondMismatch] = secondMismatchKey;\n\n      const resultVNodes = forState.orderedVNodes;\n      const firstExisting = items.get(firstMismatchKey)!;\n      const secondExisting = items.get(secondMismatchKey)!;\n      const firstItem = newArray[firstMismatch];\n      const secondItem = newArray[secondMismatch];\n      const nextOrderedItems = forState.orderedItems.slice();\n      nextOrderedItems[firstMismatch] = secondExisting;\n      nextOrderedItems[secondMismatch] = firstExisting;\n\n      recordBenchEvent('itemReused');\n      recordBenchEvent('itemReused');\n\n      if (firstExisting.item !== firstItem) {\n        updateItemInstance(forState, firstExisting, firstItem);\n      }\n\n      if (secondExisting.item !== secondItem) {\n        updateItemInstance(forState, secondExisting, secondItem);\n      }\n\n      syncForItemIndex(forState, firstExisting, firstMismatch);\n\n      syncForItemIndex(forState, secondExisting, secondMismatch);\n\n      resultVNodes[firstMismatch] = firstExisting.scope.vnode as VNode;\n      resultVNodes[secondMismatch] = secondExisting.scope.vnode as VNode;\n\n      forState.orderedKeys = nextOrderedKeys;\n      forState.orderedItems = nextOrderedItems;\n\n      if (BENCH_BUILD_ENABLED) {\n        recordBenchTiming('reconcile', performance.now() - reconcileStartMs);\n        flushBenchMetrics();\n      }\n\n      forState.pendingDirtyIndices = null;\n      forState.pendingSwapIndices = [firstMismatch, secondMismatch];\n      forState.pendingMoveOnly = true;\n\n      return resultVNodes;\n    }\n\n    let canUseMoveOnlyPath = true;\n    const moveOnlyKeys: Array<string | number> = [];\n    const moveOnlyItems: ForItemInstance<T>[] = [];\n    const moveOnlyVNodes: VNode[] = [];\n\n    for (let i = 0; i < oldLen; i++) {\n      const item = newArray[i];\n      const key = byFn(item, i);\n      const existing = items.get(key);\n\n      if (\n        !existing ||\n        existing.item !== item ||\n        (existing.indexSignal._hasBeenRead && existing.indexSignal.peek() !== i)\n      ) {\n        canUseMoveOnlyPath = false;\n        break;\n      }\n\n      moveOnlyKeys[i] = key;\n      moveOnlyItems[i] = existing;\n      moveOnlyVNodes[i] = existing.scope.vnode as VNode;\n      recordBenchEvent('itemReused');\n    }\n\n    if (canUseMoveOnlyPath) {\n      recordBenchFastLane('FULL_KEYED');\n      forState.lastCommitStrategy = 'FULL_KEYED';\n\n      for (let i = 0; i < moveOnlyItems.length; i++) {\n        syncForItemIndex(forState, moveOnlyItems[i], i);\n        moveOnlyVNodes[i] = moveOnlyItems[i].scope.vnode as VNode;\n      }\n\n      forState.orderedKeys = moveOnlyKeys;\n      forState.orderedItems = moveOnlyItems;\n      forState.orderedVNodes = moveOnlyVNodes;\n\n      if (BENCH_BUILD_ENABLED) {\n        recordBenchTiming('reconcile', performance.now() - reconcileStartMs);\n        flushBenchMetrics();\n      }\n\n      forState.pendingDirtyIndices = null;\n      forState.pendingSwapIndices = null;\n      forState.pendingMoveOnly = true;\n\n      return moveOnlyVNodes;\n    }\n  }\n\n  // ─────────────────────────────────────────────────────────────────────────\n  // FULL KEYED RECONCILIATION (slow path for complex reorders)\n  // Avoid allocating newKeyMap: iterate directly and track removals\n  // ─────────────────────────────────────────────────────────────────────────\n  recordBenchFastLane('FULL_KEYED');\n  forState.lastCommitStrategy = 'FULL_KEYED';\n\n  const toRemove = new Set(orderedKeys);\n  const newOrderedKeys: Array<string | number> = [];\n  const newOrderedItems: ForItemInstance<T>[] = [];\n  const resultVNodes: VNode[] = [];\n  let moveOnly = toRemove.size === newArray.length;\n\n  // Single pass: iterate new array directly, no intermediate map\n  for (let i = 0; i < newArray.length; i++) {\n    const item = newArray[i];\n    const key = byFn(item, i);\n    recordBenchEvent('keyLookup');\n\n    toRemove.delete(key);\n    newOrderedKeys.push(key);\n\n    const existing = items.get(key);\n    recordBenchEvent(existing ? 'keyHit' : 'keyMiss');\n\n    if (!existing) {\n      // Added: create new item instance\n      const itemInstance = createItemInstance(key, item, i, forState);\n      items.set(key, itemInstance);\n      newOrderedItems.push(itemInstance);\n      resultVNodes.push(itemInstance.scope.vnode as VNode);\n    } else {\n      // Exists: check if item changed (by identity)\n      recordBenchEvent('itemReused');\n      const itemChanged = existing.item !== item;\n      const indexChanged = existing.indexSignal.peek() !== i;\n\n      if (itemChanged) {\n        moveOnly = false;\n        updateItemInstance(forState, existing, item);\n      }\n\n      if (indexChanged) {\n        // Index changed: update index signal (triggers re-render if index is used)\n        syncForItemIndex(forState, existing, i);\n      }\n\n      newOrderedItems.push(existing);\n      resultVNodes.push(existing.scope.vnode as VNode);\n    }\n  }\n\n  // Remove deleted items\n  for (const key of toRemove) {\n    moveOnly = false;\n    const itemInstance = items.get(key);\n    if (itemInstance) {\n      disposeItemInstance(forState, itemInstance, 'none');\n      items.delete(key);\n    }\n  }\n\n  forState.orderedKeys = newOrderedKeys;\n  forState.orderedItems = newOrderedItems;\n\n  // Record reconcile timing\n  if (BENCH_BUILD_ENABLED) {\n    recordBenchTiming('reconcile', performance.now() - reconcileStartMs);\n    flushBenchMetrics();\n  }\n\n  forState.orderedVNodes = resultVNodes;\n  forState.pendingDirtyIndices = null;\n  forState.pendingSwapIndices = null;\n  forState.pendingMoveOnly = moveOnly;\n\n  return resultVNodes;\n}\n\nexport function evaluateForState<T>(forState: ForState<T>): VNode[] {\n  if (!Array.isArray(forState.currentItems)) {\n    throw new Error('For source must evaluate to an array');\n  }\n\n  forState._needsSourceReconcile = false;\n  return reconcileForItems(forState, forState.currentItems);\n}\n\nexport function clearForDomUpdateState<T>(forState: ForState<T>): void {\n  const dirtyIndices = forState.pendingDirtyIndices;\n  if (dirtyIndices && dirtyIndices.length > 0) {\n    for (let i = 0; i < dirtyIndices.length; i++) {\n      const itemInstance = forState.orderedItems[dirtyIndices[i]];\n      if (itemInstance) {\n        itemInstance.scope.needsDomUpdate = false;\n      }\n    }\n  } else {\n    for (let i = 0; i < forState.orderedKeys.length; i++) {\n      const key = forState.orderedKeys[i];\n      const itemInstance = forState.items.get(key);\n      if (itemInstance) {\n        itemInstance.scope.needsDomUpdate = false;\n      }\n    }\n  }\n\n  if (forState.fallbackScope) {\n    forState.fallbackScope.needsDomUpdate = false;\n  }\n  forState.lastRemovedNodes = [];\n  forState.pendingDirtyIndices = null;\n  forState.pendingSwapIndices = null;\n  forState.pendingMoveOnly = false;\n  forState._needsSourceReconcile = false;\n  forState._hasResolvedItemDom = forState.orderedKeys.length > 0;\n}\n"],"mappings":";;;;;;;;;;;;;AAwCA,MAAM,sBAAsB,oBAAoB;AA6EhD,MAAM,4BAAY,IAAI,QAGpB;AAEF,SAAS,YACP,UACgC;CAChC,IAAI,QAAQ,UAAU,IAAI,QAAQ;CAClC,IAAI,CAAC,OAAO;EACV,wBAAQ,IAAI,IAAI;EAChB,UAAU,IAAI,UAAU,KAAK;CAC/B;CACA,OAAO;AACT;AAEA,SAAgB,eACd,YACA,MACA,UACA,UACa;CACb,MAAM,iBAAiB,mBAAmB;CAE1C,OAAO;EACL,MAAM;EACN,cAAc,CAAC;EACf;EACA;EACA,eAAe;EACf,uBAAO,IAAI,IAAI;EACf,aAAa,CAAC;EACd,cAAc,CAAC;EACf,eAAe,CAAC;EAChB;EACA;EACA;EACA,oBAAoB;EACpB,kBAAkB,CAAC;EACnB,qBAAqB;EACrB,oBAAoB;EACpB,iBAAiB;EACjB,qBAAqB;EACrB,uBAAuB;EACvB,eAAe;EACf,sBAAsB;EACtB,wBAAwB;EACxB,2BAA2B;CAC7B;AACF;AAEA,SAAgB,YACd,YACA,MACA,UACA,UACa;CACb,MAAM,WAAW,mBAAmB;CACpC,IAAI,CAAC,UACH,MAAM,IAAI,MACR,4DACF;CAGF,MAAM,YAAY,eAAe,UAAU,KAAK;CAChD,MAAM,QAAQ,YAAY,QAAQ;CAClC,MAAM,WAAW,MAAM,IAAI,SAAS;CAEpC,IAAI,UAAU;EACZ,SAAS,aAAa;EACtB,SAAS,OAAO;EAChB,SAAS,WAAW;EACpB,SAAS,WAAW;EACpB,OAAO;CACT;CAEA,MAAM,UAAU,eAAe,YAAY,MAAM,UAAU,QAAQ;CACnE,MAAM,IAAI,WAAW,OAA4B;CAEjD,CAAC,SAAS,eAAe,CAAC,GAAG,WAAW;EACtC,QAAQ,eAAe,QAAQ;EAC/B,QAAQ,gBAAgB;EACxB,MAAM,OAAO,SAAS;CACxB,CAAC;CAED,OAAO;AACT;AAEA,SAAS,qBAAqB,cAAsC;CAClE,IAAI,aAAa;CACjB,MAAM,0BAAU,IAAI,IAA+B;CAEnD,MAAM,qBAAqB;EACzB,YAAY,eAAe;EAC3B,mBAAmB,WAAW;EAC9B,OAAO;CACT;CACA,YAAY,WAAW;CACvB,YAAY,aAAa;CACzB,YAAY,OACV,UACA,gBAAgB,SACb;EACH,MAAM,YACJ,OAAO,aAAa,aAAa,SAAS,UAAU,IAAI;EAC1D,IAAI,cAAc,YAAY;GAC5B,aAAa;GACb,IAAI,eAAe;IACjB,oCAAoC,WAAW;IAC/C,6BAA6B,WAAW;IACxC,sBAAsB,WAAW;GACnC;EACF;CACF;CACA,YAAY,eAAe;CAE3B,OAAO;AACT;AAEA,SAAS,mBACP,aACA,WACS;CACT,IAAI,YAAY,KAAK,MAAM,WACzB,OAAO;CAGT,YAAY,IAAI,WAAW,YAAY,YAAY;CACnD,OAAO,YAAY,iBAAiB;AACtC;AAEA,SAAS,iBACP,UACA,cACA,WACS;CACT,MAAM,cAAc,aAAa;CACjC,IAAI,YAAY,KAAK,MAAM,WACzB,OAAO;CAIT,IAAI,CADoB,iBAAiB,aAAa,OAAO,WACxD,GAAiB;EACpB,mBAAmB,aAAa,SAAS;EACzC,OAAO;CACT;CAEA,YAAY,IAAI,WAAW,KAAK;CAChC,oCAAoC,WAAW;CAC/C,6BAA6B,WAAW;CACxC,sBAAsB,aAAa,aAAa,MAAM,iBAAiB;CAEvE,qBAAqB,UAAU,cAAc,aAAa,YAAY;CAEtE,OAAO;AACT;AAEA,SAAS,oBAAuB,aAAkC;CAChE,IAAI,YAAY;CAChB,MAAM,0BAAU,IAAI,IAA+B;CAEnD,MAAM,oBAAoB;EACxB,WAAW,eAAe;EAC1B,mBAAmB,UAAU;EAC7B,OAAO;CACT;CAEA,WAAW,WAAW;CACtB,WAAW,aAAa;CACxB,WAAW,OAAO,UAAa,gBAAgB,SAAS;EACtD,IAAI,OAAO,GAAG,WAAW,QAAQ,GAC/B;EAGF,YAAY;EACZ,IAAI,eAAe;GACjB,oCAAoC,UAAU;GAC9C,6BAA6B,UAAU;GACvC,sBAAsB,UAAU;EAClC;CACF;CACA,WAAW,eAAe;CAE1B,OAAO;AACT;AAEA,SAAS,4BACP,cACuB;CACvB,IAAI,gBAAgB;CACpB,MAAM,0BAAU,IAAI,IAA+B;CAEnD,MAAM,wBAAwB;EAC5B,eAAe,eAAe;EAC9B,mBAAmB,cAAc;EACjC,OAAO;CACT;CAEA,eAAe,WAAW;CAC1B,eAAe,aAAa;CAC5B,eAAe,OAAO,UAAmB,gBAAgB,SAAS;EAChE,IAAI,OAAO,GAAG,eAAe,QAAQ,GACnC;EAGF,gBAAgB;EAChB,IAAI,eAAe;GACjB,oCAAoC,cAAc;GAClD,6BAA6B,cAAc;GAC3C,sBAAsB,cAAc;EACtC;CACF;CACA,eAAe,eAAe;CAE9B,OAAO;AACT;AAEA,SAAS,oBAAoB,MAAe,MAA4B;CACtE,OAAO,QAAQ,IAAI,OAAO,IAAI,GAAG,IAAI;AACvC;AAEA,SAAS,gBAAgB,cAAuB,UAA4B;CAC1E,MAAM,eAAe,QAAQ,QAAQ,OAAO,YAAY,CAAC;CACzD,MAAM,WAAW,QAAQ,QAAQ,OAAO,QAAQ,CAAC;CAEjD,IAAI,aAAa,WAAW,SAAS,QACnC,OAAO;CAGT,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK,GAC5C,IAAI,aAAa,OAAO,SAAS,IAC/B,OAAO;CAIX,OAAO;AACT;AAEA,SAAS,iBACP,OACA,QACS;CACT,OAAO,OAAO,UAAU,IAAI,MAAM,iBAAiB,KAAK;AAC1D;AAEA,SAAS,kBACP,UACA,QACS;CACT,IAAI,UAAU,SAAS;CAEvB,OAAO,SAAS;EACd,IAAI,YAAY,QACd,OAAO;EAET,UAAU,QAAQ;CACpB;CAEA,OAAO;AACT;AAEA,SAAS,uBACP,UACA,QACM;CACN,MAAM,UAAU,OAAO;CACvB,IAAI,CAAC,WAAW,QAAQ,SAAS,GAC/B;CAGF,KAAK,MAAM,UAAU,QAAQ,KAAK,GAChC,IAAI,kBAAkB,UAAU,MAAM,GACpC,QAAQ,OAAO,MAAM;AAG3B;AAEA,SAAS,iCACP,MACA,iBACA,MACuB;CACvB,MAAM,iBAAiB,gBAAgB,IAAI,IAAI;CAC/C,IAAI,gBACF,OAAO;CAGT,MAAM,iBAAiB,4BACrB,oBAAoB,MAAM,IAAI,CAChC;CACA,gBAAgB,IAAI,MAAM,cAAc;CACxC,OAAO;AACT;AAEA,SAAS,gBAAgB,MAA+B;CACtD,OACG,OAAO,SAAS,YAAY,SAAS,QAAS,OAAO,SAAS;AAEnE;AAEA,SAAS,sBACP,YACA,iBACG;CAGH,OAAO,IAAI,MAFI,OAAO,OAAO,IAEZ,GAAQ;EACvB,IAAI,QAAQ,MAAM,UAAU;GAE1B,IADsB,QAAQ,yBAAyB,QAAQ,IAC3D,GACF,OAAO,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAG3C,MAAM,cAAc,WAAW,KAAK;GAEpC,IAAI,OAAO,SAAS,UAClB,OAAO,iCACL,aACA,iBACA,IACF,EAAE;GAGJ,mBAAmB,UAAU;GAC7B,OAAO,QAAQ,IAAI,OAAO,WAAW,GAAG,MAAM,QAAQ;EACxD;EACA,IAAI,QAAQ,MAAM;GAChB,mBAAmB,UAAU;GAC7B,OAAO,QAAQ,UAAU,QAAQ,OAAO,WAAW,KAAK,CAAC;EAC3D;EACA,QAAQ,QAAQ;GACd,mBAAmB,UAAU;GAC7B,MAAM,OAAO,IAAI,IAAqB,QAAQ,QAAQ,MAAM,CAAC;GAC7D,KAAK,MAAM,OAAO,QAAQ,QAAQ,OAAO,WAAW,KAAK,CAAC,CAAC,GACzD,KAAK,IAAI,GAAG;GAGd,OAAO,MAAM,KAAK,IAAI;EACxB;EACA,yBAAyB,QAAQ,MAAM;GACrC,mBAAmB,UAAU;GAC7B,MAAM,gBAAgB,QAAQ,yBAAyB,QAAQ,IAAI;GACnE,IAAI,eACF,OAAO;GAGT,OAAO,OAAO,yBAAyB,OAAO,WAAW,KAAK,CAAC,GAAG,IAAI;EACxE;EACA,iBAAiB;GACf,mBAAmB,UAAU;GAC7B,OAAO,OAAO,eAAe,OAAO,WAAW,KAAK,CAAC,CAAC;EACxD;CACF,CAAC;AACH;AAEA,SAAS,qBACP,KACA,OACM;CACN,IAAI,SAAS,OAAO,UAAU,YAAY,UAAU,OAAO;EACzD,MAAM,KAAK;EACX,GAAG,MAAM;EAET,IAAI,OAAO,GAAG,SAAS,UAAU;GAC/B,IAAI,CAAC,GAAG,OAAO,GAAG,QAAQ,CAAC;GAC3B,IAAI,GAAG,MAAM,gBAAgB,QAC3B,GAAG,MAAM,cAAc,OAAO,GAAG;EAErC;CACF;AACF;AAEA,SAAS,gBACP,UACA,OACA,MACA,aACA,KACO;CACP,iBAAiB,YAAY;CAC7B,MAAM,QAAQ,MAAM,aAAa,SAAS,SAAS,MAAM,WAAW,CAAC;CACrE,qBAAqB,KAAK,KAAK;CAC/B,OAAO;AACT;AAEA,SAAS,kBAAkB,SAAwB;CACjD,MAAM,IAAI,MAAM,OAAO;AACzB;AAEA,SAAS,gBAAmB,UAAuB,UAAqB;CACtE,IAAI,CAAC,yBAAyB,GAC5B;CAGF,MAAM,uBAAO,IAAI,IAAqB;CACtC,MAAM,2BAAW,IAAI,IAAiC;CACtD,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,MAAM,SAAS,KAAK,SAAS,IAAI,CAAC;EAExC,IAAI,QAAQ,QAAQ,QAAQ,QAC1B,kBACE,iGACF;EAGF,IAAI,KAAK,IAAI,GAAG,GACd,kBACE,sCAAsC,OAAO,GAAG,EAAE,iEACpD;EAGF,KAAK,IAAI,GAAG;EAEZ,MAAM,YAAY,OAAO,GAAG;EAC5B,MAAM,UAAU,OAAO;EACvB,MAAM,kBAAkB,SAAS,aAAa,IAAI,SAAS;EAC3D,IAAI,mBAAmB,oBAAoB,SACzC,kBACE,mCAAmC,UAAU,sDAC/C;EAEF,SAAS,IAAI,WAAW,OAA8B;CACxD;CAEA,SAAS,cAAc;AACzB;AAIA,SAAS,oBACP,UACA,cACA,YACM;CACN,iBAAiB,aAAa;CAC9B,MAAM,aAAa,aAAa,MAAM;CAEtC,IAAI;EACF,kBAAkB,aAAa,KAAK;CACtC,SAAS,KAAK;EACZ,IAAI,yBAAyB,GAC3B,QAAQ,MAAM,wBAAwB,GAAG;CAE7C;CAEA,IAAI,CAAC,YACH;CAGF,IAAI,sBAAsB,SACxB;MAAI,eAAe,YACjB,oBAAoB,UAAU;CAChC;CAGF,SAAS,iBAAiB,KAAK,UAAU;AAC3C;AAEA,SAAgB,mBACd,KACA,MACA,OACA,UACoB;CACpB,iBAAiB,aAAa;CAI9B,MAAM,cAAc,qBAAqB,KAAK;CAC9C,MAAM,aAAa,gBAAgB,IAAI,IAAI,oBAAoB,IAAI,IAAI;CACvE,MAAM,sBAAsB,6BACxB,IAAI,IAAwC,IAC5C;CACJ,MAAM,eACJ,cAAc,sBACV,sBAAsB,YAAY,mBAAmB,IACrD;CACN,IAAI,eAA0C;CAC9C,MAAM,QAAQ,iBAAiB,SAAS,gBAAgB,WAAW;EACjE,IAAI,SAAS,wBAAwB;GACnC,SAAS,uBAAuB;GAChC;EACF;EAEA,MAAM,SAAS,SAAS;EACxB,IAAI,QACF,OAAO,cAAc;CAEzB,CAAC;CAED,gBAAgB,UAAU,OAAO,cAAc,aAAa,GAAG;CAE/D,eAAe;EACb;EACA;EACA;EACA;EACA;EACA;EACA;CACF;CAEA,OAAO;AACT;AAEA,SAAS,qBACP,UACA,cACA,MACM;CACN,gBACE,UACA,aAAa,OACb,MACA,aAAa,aACb,aAAa,GACf;AACF;AAEA,SAAS,mBACP,UACA,cACA,MACS;CACT,IAAI,aAAa,SAAS,MACxB,OAAO;CAGT,MAAM,eAAe,aAAa;CAClC,aAAa,OAAO;CAEpB,MAAM,QAAQ,aAAa;CAC3B,IAAI,0BAA0B;CAC9B,MAAM,aAAa,aAAa;CAChC,IAAI,CAAC,YAAY;EACf,qBAAqB,UAAU,cAAc,IAAI;EACjD,OAAO;CACT;CAEA,MAAM,kBAAkB,aAAa;CACrC,MAAM,yBAAkE,CAAC;CACzE,IAAI,mBAAmB,gBAAgB,OAAO,GAC5C,KAAK,MAAM,CAAC,MAAM,mBAAmB,iBAAiB;EACpD,MAAM,gBAAgB,oBAAoB,cAAc,IAAI;EAC5D,MAAM,YAAY,oBAAoB,MAAM,IAAI;EAChD,IAAI,OAAO,GAAG,eAAe,SAAS,GACpC;EAGF,IAAI,iBAAiB,OAAO,cAAc,GACxC,0BAA0B;EAG5B,uBAAuB,KAAK,CAAC,gBAAgB,SAAS,CAAC;CACzD;CAGF,IAAI,iBAAiB,OAAO,UAAU,GACpC,0BAA0B;CAG5B,MAAM,mBACJ,uBAAuB,WAAW,KAAK,CAAC,gBAAgB,cAAc,IAAI;CAC5E,MAAM,gBACJ,CAAC,4BACA,uBAAuB,SAAS,KAAK;CACxC,MAAM,gBACJ,2BACA,uBAAuB,SAAS,KAChC;CACF,KAAK,MAAM,CAAC,gBAAgB,cAAc,wBAAwB;EAChE,uBAAuB,UAAU,cAAc;EAC/C,eAAe,IAAI,WAAW,aAAa;CAC7C;CACA,uBAAuB,UAAU,UAAU;CAC3C,WAAW,IAAI,MAAM,aAAa;CAElC,IAAI,yBACF,qBAAqB,UAAU,cAAc,aAAa,YAAY;CAGxE,OAAO;AACT;AAEA,MAAM,yBAAyB;AAE/B,SAAS,qBACP,UACA,YACM;CACN,MAAM,gBAAgB,SAAS;CAC/B,IAAI,CAAC,eACH;CAGF,MAAM,aAAa,cAAc;CACjC,kBAAkB,aAAa;CAC/B,SAAS,gBAAgB;CAEzB,IAAI,CAAC,YACH;CAGF,IAAI,sBAAsB,SACxB;MAAI,eAAe,YACjB,oBAAoB,UAAU;CAChC;CAGF,SAAS,iBAAiB,KAAK,UAAU;AAC3C;AAEA,SAAS,oBAAuB,UAAgC;CAC9D,IAAI,SAAS,YAAY,QAAQ,SAAS,aAAa,OAAO;EAC5D,IAAI,SAAS,eACX,qBAAqB,UAAU,MAAM;EAEvC,SAAS,gBAAgB,CAAC;EAC1B,SAAS,eAAe,CAAC;EACzB,OAAO,CAAC;CACV;CAEA,MAAM,gBACJ,SAAS,iBACT,iBAAiB,SAAS,gBAAgB,8BAA8B;EACtE,IAAI,SAAS,wBAAwB;GACnC,SAAS,uBAAuB;GAChC;EACF;EAEA,SAAS,gBAAgB,cAAc;CACzC,CAAC;CACH,SAAS,gBAAgB;CAEzB,MAAM,QAAQ,cAAc,aAAa,SAAS,QAAiB;CACnE,SAAS,gBAAgB,SAAS,QAAQ,UAAU,QAAQ,CAAC,IAAI,CAAC,KAAK;CACvE,SAAS,eAAe,CAAC;CACzB,OAAO,SAAS;AAClB;AAEA,SAAS,gBACP,UACA,YACM;CACN,MAAM,EAAE,OAAO,gBAAgB;CAC/B,KAAK,IAAI,QAAQ,GAAG,QAAQ,YAAY,QAAQ,SAAS,GAAG;EAC1D,MAAM,MAAM,YAAY;EACxB,MAAM,eAAe,MAAM,IAAI,GAAG;EAClC,IAAI,CAAC,cACH;EAEF,oBAAoB,UAAU,cAAc,UAAU;EACtD,MAAM,OAAO,GAAG;CAClB;CACA,YAAY,SAAS;CACrB,SAAS,cAAc;AACzB;AAEA,SAAgB,kBACd,UACA,UACS;CACT,SAAS,eAAe;CACxB,gBAAgB,UAAU,QAAQ;CAElC,IAAI,qBACF,kBAAkB;CAGpB,MAAM,mBAAmB,sBAAsB,YAAY,IAAI,IAAI;CAEnE,MAAM,EAAE,OAAO,aAAa,SAAS;CACrC,MAAM,SAAS,YAAY;CAC3B,MAAM,SAAS,SAAS;CACxB,SAAS,mBAAmB,CAAC;CAE7B,IAAI,WAAW,GAAG;EAChB,IAAI,SAAS,GACX,gBAAgB,UAAU,SAAS,WAAW,aAAa,MAAM;EAEnE,oBAAoB,UAAU;EAC9B,SAAS,qBAAqB;EAC9B,SAAS,sBAAsB;EAC/B,SAAS,qBAAqB;EAC9B,SAAS,kBAAkB;EAE3B,IAAI,qBAAqB;GACvB,kBAAkB,aAAa,YAAY,IAAI,IAAI,gBAAgB;GACnE,kBAAkB;EACpB;EAEA,OAAO,oBAAoB,QAAQ;CACrC;CAEA,IAAI,SAAS,eACX,qBAAqB,UAAU,MAAM;CAOvC,IAAI,SAAS,QAAQ;EACnB,IAAI,mBAAmB;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAE1B,IADY,KAAK,SAAS,IAAI,CAC1B,MAAQ,YAAY,IAAI;GAC1B,mBAAmB;GACnB;EACF;EAGF,IAAI,kBAAkB;GACpB,oBAAoB,QAAQ;GAC5B,SAAS,qBAAqB;GAC9B,MAAM,eAAe,SAAS;GAC9B,MAAM,cAAc,SAAS;GAC7B,aAAa,SAAS;GACtB,YAAY,SAAS;GAGrB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;IAC/B,MAAM,OAAO,SAAS;IACtB,MAAM,MAAM,YAAY;IACxB,MAAM,WAAW,YAAY,MAAM,MAAM,IAAI,GAAG;IAEhD,mBAAmB,UAAU,UAAU,IAAI;IAE3C,YAAY,KAAK;IACjB,aAAa,KAAK,SAAS,MAAM;GACnC;GAEA,iBAAiB,cAAc,MAAM;GAGrC,KAAK,IAAI,IAAI,QAAQ,IAAI,QAAQ,KAAK;IACpC,MAAM,OAAO,SAAS;IACtB,MAAM,MAAM,KAAK,MAAM,CAAC;IACxB,MAAM,eAAe,mBAAmB,KAAK,MAAM,GAAG,QAAQ;IAC9D,MAAM,IAAI,KAAK,YAAY;IAC3B,YAAY,KAAK;IACjB,aAAa,KAAK,aAAa,MAAM;IACrC,YAAY,KAAK;GACnB;GAEA,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,IAAI,IAAI,gBAAgB;IACnE,kBAAkB;GACpB;GAEA,SAAS,gBAAgB;GACzB,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB;GAC9B,SAAS,kBAAkB;GAE3B,OAAO;EACT;CACF;CAMA,IAAI,SAAS,QAAQ;EACnB,IAAI,WAAW,SAAS,GAAG;GACzB,IAAI,eAAe;GAEnB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAE1B,IADgB,KAAK,SAAS,IAAI,CAC9B,MAAY,YAAY,IAAI;IAC9B,eAAe;IACf;GACF;GAGF,IAAI,iBAAiB,IAAI;IACvB,IAAI,sBAAsB;IAC1B,KAAK,IAAI,IAAI,cAAc,IAAI,QAAQ,KAErC,IADgB,KAAK,SAAS,IAAI,CAC9B,MAAY,YAAY,IAAI,IAAI;KAClC,sBAAsB;KACtB;IACF;IAGF,IAAI,qBAAqB;KACvB,oBAAoB,YAAY;KAChC,SAAS,qBAAqB;KAE9B,MAAM,uBAAuB,SAAS,aAAa,MAAM;KACzD,MAAM,eAAe,SAAS;KAC9B,MAAM,cAAc,SAAS;KAC7B,aAAa,SAAS;KACtB,YAAY,SAAS;KACrB,MAAM,eAAyB,CAAC;KAEhC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;MAC/B,MAAM,OAAO,SAAS;MACtB,MAAM,MAAM,IAAI,eAAe,YAAY,KAAK,YAAY,IAAI;MAChE,MAAM,WAAW,MAAM,IAAI,GAAG;MAC9B,MAAM,sBAAsB,SAAS,MAAM;MAE3C,MAAM,cAAc,SAAS,SAAS;MAEtC,MAAM,eADc,SAAS,YACI,KAAK,MAAM;MAE5C,IAAI,aACF,mBAAmB,UAAU,UAAU,IAAI;MAG7C,MAAM,qBAAqB,eACvB,iBAAiB,UAAU,UAAU,CAAC,IACtC;MAEJ,IAAI,eAAe,sBAAsB,qBACvC,aAAa,KAAK,CAAC;MAGrB,YAAY,KAAK;MACjB,aAAa,KAAK,SAAS,MAAM;KACnC;KAEA,iBAAiB,cAAc,MAAM;KAErC,MAAM,aAAa,YAAY;KAC/B,MAAM,cAAc,MAAM,IAAI,UAAU;KACxC,IAAI,aAAa;MACf,oBAAoB,UAAU,aAAa,UAAU;MACrD,MAAM,OAAO,UAAU;KACzB;KAEA,MAAM,kBAAkB,YAAY,MAAM,GAAG,MAAM;KACnD,MAAM,mBAAmB,qBAAqB,MAAM,GAAG,MAAM;KAC7D,KAAK,IAAI,IAAI,cAAc,IAAI,QAAQ,KAAK;MAC1C,gBAAgB,KAAK,YAAY,IAAI;MACrC,iBAAiB,KAAK,qBAAqB,IAAI;KACjD;KACA,SAAS,cAAc;KACvB,SAAS,eAAe;KAExB,IAAI,qBAAqB;MACvB,kBACE,aACA,YAAY,IAAI,IAAI,gBACtB;MACA,kBAAkB;KACpB;KAEA,SAAS,sBAAsB;KAC/B,SAAS,qBAAqB;KAC9B,SAAS,kBAAkB;KAE3B,OAAO;IACT;GACF;EACF;EAEA,IAAI,qBAAqB;EACzB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAE1B,IADY,KAAK,SAAS,IAAI,CAC1B,MAAQ,YAAY,IAAI;GAC1B,qBAAqB;GACrB;EACF;EAGF,IAAI,oBAAoB;GACtB,oBAAoB,UAAU;GAC9B,SAAS,qBAAqB;GAC9B,MAAM,eAAe,SAAS;GAC9B,MAAM,cAAc,SAAS;GAC7B,aAAa,SAAS;GACtB,YAAY,SAAS;GACrB,MAAM,cAAc,WAAW;GAG/B,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;IAC/B,MAAM,OAAO,SAAS;IACtB,MAAM,MAAM,YAAY;IACxB,MAAM,WAAW,MAAM,IAAI,GAAG;IAE9B,mBAAmB,UAAU,UAAU,IAAI;IAE3C,YAAY,KAAK;IACjB,aAAa,KAAK,SAAS,MAAM;GACnC;GAEA,iBAAiB,cAAc,MAAM;GAGrC,KAAK,IAAI,IAAI,QAAQ,IAAI,QAAQ,KAAK;IACpC,MAAM,MAAM,YAAY;IACxB,MAAM,eAAe,MAAM,IAAI,GAAG;IAClC,IAAI,cAAc;KAChB,oBACE,UACA,cACA,cAAc,eAAe,UAC/B;KACA,MAAM,OAAO,GAAG;IAClB;GACF;GAEA,YAAY,SAAS;GACrB,SAAS,cAAc;GACvB,SAAS,aAAa,SAAS;GAE/B,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,IAAI,IAAI,gBAAgB;IACnE,kBAAkB;GACpB;GAEA,SAAS,gBAAgB;GACzB,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB;GAC9B,SAAS,kBAAkB;GAE3B,OAAO;EACT;CACF;CAMA,IAAI,WAAW,QAAQ;EACrB,IAAI,sBAAsB;EAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAE1B,IADY,KAAK,SAAS,IAAI,CAC1B,MAAQ,YAAY,IAAI;GAC1B,sBAAsB;GACtB;EACF;EAGF,IAAI,qBAAqB;GACvB,oBAAoB,YAAY;GAChC,SAAS,qBAAqB;GAC9B,MAAM,eAAe,SAAS;GAC9B,MAAM,cAAc,SAAS;GAC7B,aAAa,SAAS;GACtB,YAAY,SAAS;GACrB,MAAM,eAAyB,CAAC;GAEhC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;IAC/B,MAAM,OAAO,SAAS;IACtB,MAAM,MAAM,YAAY;IACxB,MAAM,WAAW,MAAM,IAAI,GAAG;IAC9B,MAAM,cAAc,SAAS,SAAS;IAEtC,IAAI,aACF,mBAAmB,UAAU,UAAU,IAAI;IAG7C,IAAI,CAAC,eAAe,SAAS,MAAM,gBACjC,aAAa,KAAK,CAAC;IAGrB,YAAY,KAAK;IACjB,aAAa,KAAK,SAAS,MAAM;GACnC;GAEA,iBAAiB,cAAc,MAAM;GAErC,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,IAAI,IAAI,gBAAgB;IACnE,kBAAkB;GACpB;GAEA,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB;GAC9B,SAAS,kBAAkB;GAE3B,OAAO;EACT;EAEA,IAAI,gBAAgB;EACpB,IAAI,iBAAiB;EACrB,IAAI,mBAA2C;EAC/C,IAAI,oBAA4C;EAChD,IAAI,gBAAgB;EACpB,IAAI,iBAAiB;EAErB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;GAC/B,MAAM,OAAO,SAAS;GACtB,MAAM,MAAM,KAAK,SAAS,IAAI,CAAC;GAC/B,IAAI,QAAQ,YAAY,IAAI;IAC1B,MAAM,WAAW,MAAM,IAAI,GAAG;IAC9B,IAAI,YAAY,SAAS,SAAS,MAAM;KACtC,iBAAiB;KACjB;IACF;IACA;GACF;GAEA;GACA,IAAI,kBAAkB,IAAI;IACxB,gBAAgB;IAChB,mBAAmB;IACnB;GACF;GAEA,IAAI,mBAAmB,IAAI;IACzB,iBAAiB;IACjB,oBAAoB;IACpB;GACF;GAEA,gBAAgB;GAChB;EACF;EAEA,IACE,kBACA,kBAAkB,KAClB,kBAAkB,MAClB,mBAAmB,MACnB,qBAAqB,YAAY,mBACjC,sBAAsB,YAAY,gBAClC;GACA,oBAAoB,MAAM;GAC1B,iBAAiB,WAAW;GAC5B,iBAAiB,WAAW;GAE5B,SAAS,qBAAqB;GAE9B,MAAM,kBAAkB,YAAY,MAAM;GAC1C,gBAAgB,iBAAiB;GACjC,gBAAgB,kBAAkB;GAElC,MAAM,eAAe,SAAS;GAC9B,MAAM,gBAAgB,MAAM,IAAI,gBAAgB;GAChD,MAAM,iBAAiB,MAAM,IAAI,iBAAiB;GAClD,MAAM,YAAY,SAAS;GAC3B,MAAM,aAAa,SAAS;GAC5B,MAAM,mBAAmB,SAAS,aAAa,MAAM;GACrD,iBAAiB,iBAAiB;GAClC,iBAAiB,kBAAkB;GAEnC,iBAAiB,YAAY;GAC7B,iBAAiB,YAAY;GAE7B,IAAI,cAAc,SAAS,WACzB,mBAAmB,UAAU,eAAe,SAAS;GAGvD,IAAI,eAAe,SAAS,YAC1B,mBAAmB,UAAU,gBAAgB,UAAU;GAGzD,iBAAiB,UAAU,eAAe,aAAa;GAEvD,iBAAiB,UAAU,gBAAgB,cAAc;GAEzD,aAAa,iBAAiB,cAAc,MAAM;GAClD,aAAa,kBAAkB,eAAe,MAAM;GAEpD,SAAS,cAAc;GACvB,SAAS,eAAe;GAExB,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,IAAI,IAAI,gBAAgB;IACnE,kBAAkB;GACpB;GAEA,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB,CAAC,eAAe,cAAc;GAC5D,SAAS,kBAAkB;GAE3B,OAAO;EACT;EAEA,IAAI,qBAAqB;EACzB,MAAM,eAAuC,CAAC;EAC9C,MAAM,gBAAsC,CAAC;EAC7C,MAAM,iBAA0B,CAAC;EAEjC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;GAC/B,MAAM,OAAO,SAAS;GACtB,MAAM,MAAM,KAAK,MAAM,CAAC;GACxB,MAAM,WAAW,MAAM,IAAI,GAAG;GAE9B,IACE,CAAC,YACD,SAAS,SAAS,QACjB,SAAS,YAAY,gBAAgB,SAAS,YAAY,KAAK,MAAM,GACtE;IACA,qBAAqB;IACrB;GACF;GAEA,aAAa,KAAK;GAClB,cAAc,KAAK;GACnB,eAAe,KAAK,SAAS,MAAM;GACnC,iBAAiB,YAAY;EAC/B;EAEA,IAAI,oBAAoB;GACtB,oBAAoB,YAAY;GAChC,SAAS,qBAAqB;GAE9B,KAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;IAC7C,iBAAiB,UAAU,cAAc,IAAI,CAAC;IAC9C,eAAe,KAAK,cAAc,GAAG,MAAM;GAC7C;GAEA,SAAS,cAAc;GACvB,SAAS,eAAe;GACxB,SAAS,gBAAgB;GAEzB,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,IAAI,IAAI,gBAAgB;IACnE,kBAAkB;GACpB;GAEA,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB;GAC9B,SAAS,kBAAkB;GAE3B,OAAO;EACT;CACF;CAMA,oBAAoB,YAAY;CAChC,SAAS,qBAAqB;CAE9B,MAAM,WAAW,IAAI,IAAI,WAAW;CACpC,MAAM,iBAAyC,CAAC;CAChD,MAAM,kBAAwC,CAAC;CAC/C,MAAM,eAAwB,CAAC;CAC/B,IAAI,WAAW,SAAS,SAAS,SAAS;CAG1C,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,OAAO,SAAS;EACtB,MAAM,MAAM,KAAK,MAAM,CAAC;EACxB,iBAAiB,WAAW;EAE5B,SAAS,OAAO,GAAG;EACnB,eAAe,KAAK,GAAG;EAEvB,MAAM,WAAW,MAAM,IAAI,GAAG;EAC9B,iBAAiB,WAAW,WAAW,SAAS;EAEhD,IAAI,CAAC,UAAU;GAEb,MAAM,eAAe,mBAAmB,KAAK,MAAM,GAAG,QAAQ;GAC9D,MAAM,IAAI,KAAK,YAAY;GAC3B,gBAAgB,KAAK,YAAY;GACjC,aAAa,KAAK,aAAa,MAAM,KAAc;EACrD,OAAO;GAEL,iBAAiB,YAAY;GAC7B,MAAM,cAAc,SAAS,SAAS;GACtC,MAAM,eAAe,SAAS,YAAY,KAAK,MAAM;GAErD,IAAI,aAAa;IACf,WAAW;IACX,mBAAmB,UAAU,UAAU,IAAI;GAC7C;GAEA,IAAI,cAEF,iBAAiB,UAAU,UAAU,CAAC;GAGxC,gBAAgB,KAAK,QAAQ;GAC7B,aAAa,KAAK,SAAS,MAAM,KAAc;EACjD;CACF;CAGA,KAAK,MAAM,OAAO,UAAU;EAC1B,WAAW;EACX,MAAM,eAAe,MAAM,IAAI,GAAG;EAClC,IAAI,cAAc;GAChB,oBAAoB,UAAU,cAAc,MAAM;GAClD,MAAM,OAAO,GAAG;EAClB;CACF;CAEA,SAAS,cAAc;CACvB,SAAS,eAAe;CAGxB,IAAI,qBAAqB;EACvB,kBAAkB,aAAa,YAAY,IAAI,IAAI,gBAAgB;EACnE,kBAAkB;CACpB;CAEA,SAAS,gBAAgB;CACzB,SAAS,sBAAsB;CAC/B,SAAS,qBAAqB;CAC9B,SAAS,kBAAkB;CAE3B,OAAO;AACT;AAEA,SAAgB,iBAAoB,UAAgC;CAClE,IAAI,CAAC,MAAM,QAAQ,SAAS,YAAY,GACtC,MAAM,IAAI,MAAM,sCAAsC;CAGxD,SAAS,wBAAwB;CACjC,OAAO,kBAAkB,UAAU,SAAS,YAAY;AAC1D;AAEA,SAAgB,uBAA0B,UAA6B;CACrE,MAAM,eAAe,SAAS;CAC9B,IAAI,gBAAgB,aAAa,SAAS,GACxC,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;EAC5C,MAAM,eAAe,SAAS,aAAa,aAAa;EACxD,IAAI,cACF,aAAa,MAAM,iBAAiB;CAExC;MAEA,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;EACpD,MAAM,MAAM,SAAS,YAAY;EACjC,MAAM,eAAe,SAAS,MAAM,IAAI,GAAG;EAC3C,IAAI,cACF,aAAa,MAAM,iBAAiB;CAExC;CAGF,IAAI,SAAS,eACX,SAAS,cAAc,iBAAiB;CAE1C,SAAS,mBAAmB,CAAC;CAC7B,SAAS,sBAAsB;CAC/B,SAAS,qBAAqB;CAC9B,SAAS,kBAAkB;CAC3B,SAAS,wBAAwB;CACjC,SAAS,sBAAsB,SAAS,YAAY,SAAS;AAC/D"}
+{"version":3,"file":"for.js","names":[],"sources":["../../src/runtime/for.ts"],"sourcesContent":["/**\n * For primitive runtime\n *\n * Manages per-item component instances and array reconciliation\n * to eliminate over-invalidation in list rendering.\n */\n\nimport { type ComponentInstance, getCurrentInstance } from './component';\nimport { claimHookIndex } from './component';\nimport { type DOMElement, type VNode } from '../common/vnode';\nimport { isDevelopmentEnvironment } from '../common/env';\nimport { teardownNodeSubtree } from '../renderer/cleanup';\nimport {\n  createChildScope,\n  disposeChildScope,\n  type ChildScope,\n} from './child-scope';\nimport type { ForProps } from '../control/for';\nimport type { ForEachSource } from '../control/for';\nimport {\n  markReactivePropsDirtySource,\n  markReadableDerivedSubscribersDirty,\n  notifyReadableReaders,\n  recordReadableRead,\n  type ReadableSource,\n} from './readable';\nimport type { FineGrainedEffectHandle } from './effect';\nimport {\n  flushBenchMetrics,\n  getBenchMetrics,\n  isBenchBuildEnabled,\n  isBenchMetricScopeActive,\n  recordBenchEvent,\n  recordBenchCounter,\n  recordBenchFastLane,\n  recordBenchTiming,\n  resetBenchMetrics,\n  withBenchMetricScope,\n} from './for-bench';\n\nconst BENCH_BUILD_ENABLED = isBenchBuildEnabled();\n\nexport {\n  getBenchMetrics,\n  isBenchMetricScopeActive,\n  recordBenchEvent,\n  recordBenchCounter,\n  recordBenchTiming,\n  resetBenchMetrics,\n  withBenchMetricScope,\n};\n\nexport interface ForItemInstance<T> {\n  key: string | number;\n  item: T;\n  reactiveItem: T;\n  itemSignal: ForItemSignal<T> | null;\n  itemPropertySignals: Map<PropertyKey, ForItemPropertySignal> | null;\n  indexSignal: ForIndexSignal;\n  scope: ChildScope;\n}\n\ntype ForItemSignal<T> = ReadableSource<T> &\n  (() => T) & {\n    peek(): T;\n    set(newValue: T, notifyReaders?: boolean): void;\n  };\n\ntype ForItemPropertySignal = ReadableSource<unknown> &\n  (() => unknown) & {\n    peek(): unknown;\n    set(newValue: unknown, notifyReaders?: boolean): void;\n  };\n\ntype ForIndexSignal = ReadableSource<number> &\n  (() => number) & {\n    peek(): number;\n    set(\n      newValue: number | ((prev: number) => number),\n      notifyReaders?: boolean\n    ): void;\n  };\n\nexport type ForCommitStrategy =\n  | 'APPEND'\n  | 'TRUNCATE'\n  | 'NO_REORDER'\n  | 'SWAP'\n  | 'FULL_KEYED';\n\nexport interface ForState<T> {\n  kind: 'for';\n  currentItems: T[];\n  eachSource: ForEachSource<T>;\n  fallback: VNode | null;\n  fallbackScope: ChildScope | null;\n  items: Map<string | number, ForItemInstance<T>>;\n  orderedKeys: Array<string | number>;\n  orderedItems: ForItemInstance<T>[];\n  orderedVNodes: VNode[];\n  byFn: NonNullable<ForProps<T>['by']> | ((item: T, index: number) => number);\n  renderFn: (item: T, index: () => number) => VNode;\n  parentInstance: ComponentInstance | null;\n  lastCommitStrategy: ForCommitStrategy;\n  lastRemovedNodes: Node[];\n  pendingDirtyIndices: number[] | null;\n  pendingSwapIndices: [number, number] | null;\n  pendingMoveOnly: boolean;\n  _hasResolvedItemDom: boolean;\n  _needsSourceReconcile: boolean;\n  _sourceEffect: FineGrainedEffectHandle<T[]> | null;\n  _suspendSourceCommit: boolean;\n  _enqueueBoundaryCommit?: (() => void) | null;\n  _hasPendingBoundaryCommit?: boolean;\n  devKeyKinds?: Map<string, 'number' | 'string'>;\n}\n\nconst forStates = new WeakMap<\n  ComponentInstance,\n  Map<number, ForState<unknown>>\n>();\n\nfunction getForStore(\n  instance: ComponentInstance\n): Map<number, ForState<unknown>> {\n  let store = forStates.get(instance);\n  if (!store) {\n    store = new Map();\n    forStates.set(instance, store);\n  }\n  return store;\n}\n\nexport function createForState<T>(\n  eachSource: ForEachSource<T>,\n  byFn: ForState<T>['byFn'],\n  renderFn: (item: T, index: () => number) => VNode,\n  fallback: VNode | null\n): ForState<T> {\n  const parentInstance = getCurrentInstance();\n\n  return {\n    kind: 'for',\n    currentItems: [],\n    eachSource,\n    fallback,\n    fallbackScope: null,\n    items: new Map(),\n    orderedKeys: [],\n    orderedItems: [],\n    orderedVNodes: [],\n    byFn,\n    renderFn,\n    parentInstance,\n    lastCommitStrategy: 'NO_REORDER',\n    lastRemovedNodes: [],\n    pendingDirtyIndices: null,\n    pendingSwapIndices: null,\n    pendingMoveOnly: false,\n    _hasResolvedItemDom: false,\n    _needsSourceReconcile: false,\n    _sourceEffect: null,\n    _suspendSourceCommit: false,\n    _enqueueBoundaryCommit: null,\n    _hasPendingBoundaryCommit: false,\n  };\n}\n\nexport function useForState<T>(\n  eachSource: ForEachSource<T>,\n  byFn: ForState<T>['byFn'],\n  renderFn: (item: T, index: () => number) => VNode,\n  fallback: VNode | null\n): ForState<T> {\n  const instance = getCurrentInstance();\n  if (!instance) {\n    throw new Error(\n      'For can only be created during component render execution.'\n    );\n  }\n\n  const hookIndex = claimHookIndex(instance, 'For');\n  const store = getForStore(instance);\n  const existing = store.get(hookIndex) as ForState<T> | undefined;\n\n  if (existing) {\n    existing.eachSource = eachSource;\n    existing.byFn = byFn;\n    existing.renderFn = renderFn;\n    existing.fallback = fallback;\n    return existing;\n  }\n\n  const created = createForState(eachSource, byFn, renderFn, fallback);\n  store.set(hookIndex, created as ForState<unknown>);\n\n  (instance.cleanupFns ??= []).push(() => {\n    created._sourceEffect?.cleanup();\n    created._sourceEffect = null;\n    store.delete(hookIndex);\n  });\n\n  return created;\n}\n\nfunction createForIndexSignal(initialIndex: number): ForIndexSignal {\n  let indexValue = initialIndex;\n  const readers = new Map<ComponentInstance, number>();\n\n  const indexSignal = (() => {\n    indexSignal._hasBeenRead = true;\n    recordReadableRead(indexSignal);\n    return indexValue;\n  }) as ForIndexSignal;\n  indexSignal._readers = readers;\n  indexSignal.peek = () => indexValue;\n  indexSignal.set = (\n    newValue: number | ((prev: number) => number),\n    notifyReaders = true\n  ) => {\n    const nextValue =\n      typeof newValue === 'function' ? newValue(indexValue) : newValue;\n    if (nextValue !== indexValue) {\n      indexValue = nextValue;\n      if (notifyReaders) {\n        markReadableDerivedSubscribersDirty(indexSignal);\n        markReactivePropsDirtySource(indexSignal);\n        notifyReadableReaders(indexSignal);\n      }\n    }\n  };\n  indexSignal._hasBeenRead = false;\n\n  return indexSignal;\n}\n\nfunction syncForIndexSignal(\n  indexSignal: ForIndexSignal,\n  nextIndex: number\n): boolean {\n  if (indexSignal.peek() === nextIndex) {\n    return false;\n  }\n\n  indexSignal.set(nextIndex, indexSignal._hasBeenRead);\n  return indexSignal._hasBeenRead === true;\n}\n\nfunction syncForItemIndex<T>(\n  forState: ForState<T>,\n  itemInstance: ForItemInstance<T>,\n  nextIndex: number\n): boolean {\n  const indexSignal = itemInstance.indexSignal;\n  if (indexSignal.peek() === nextIndex) {\n    return false;\n  }\n\n  const scopeReadsIndex = scopeReadsSource(itemInstance.scope, indexSignal);\n  if (!scopeReadsIndex) {\n    syncForIndexSignal(indexSignal, nextIndex);\n    return false;\n  }\n\n  indexSignal.set(nextIndex, false);\n  markReadableDerivedSubscribersDirty(indexSignal);\n  markReactivePropsDirtySource(indexSignal);\n  notifyReadableReaders(indexSignal, itemInstance.scope.componentInstance);\n\n  rerenderItemInstance(forState, itemInstance, itemInstance.reactiveItem);\n\n  return true;\n}\n\nfunction createForItemSignal<T>(initialItem: T): ForItemSignal<T> {\n  let itemValue = initialItem;\n  const readers = new Map<ComponentInstance, number>();\n\n  const itemSignal = (() => {\n    itemSignal._hasBeenRead = true;\n    recordReadableRead(itemSignal);\n    return itemValue;\n  }) as ForItemSignal<T>;\n\n  itemSignal._readers = readers;\n  itemSignal.peek = () => itemValue;\n  itemSignal.set = (newValue: T, notifyReaders = true) => {\n    if (Object.is(itemValue, newValue)) {\n      return;\n    }\n\n    itemValue = newValue;\n    if (notifyReaders) {\n      markReadableDerivedSubscribersDirty(itemSignal);\n      markReactivePropsDirtySource(itemSignal);\n      notifyReadableReaders(itemSignal);\n    }\n  };\n  itemSignal._hasBeenRead = false;\n\n  return itemSignal;\n}\n\nfunction createForItemPropertySignal(\n  initialValue: unknown\n): ForItemPropertySignal {\n  let propertyValue = initialValue;\n  const readers = new Map<ComponentInstance, number>();\n\n  const propertySignal = (() => {\n    propertySignal._hasBeenRead = true;\n    recordReadableRead(propertySignal);\n    return propertyValue;\n  }) as ForItemPropertySignal;\n\n  propertySignal._readers = readers;\n  propertySignal.peek = () => propertyValue;\n  propertySignal.set = (newValue: unknown, notifyReaders = true) => {\n    if (Object.is(propertyValue, newValue)) {\n      return;\n    }\n\n    propertyValue = newValue;\n    if (notifyReaders) {\n      markReadableDerivedSubscribersDirty(propertySignal);\n      markReactivePropsDirtySource(propertySignal);\n      notifyReadableReaders(propertySignal);\n    }\n  };\n  propertySignal._hasBeenRead = false;\n\n  return propertySignal;\n}\n\nfunction readForItemProperty(item: unknown, prop: PropertyKey): unknown {\n  return Reflect.get(Object(item), prop);\n}\n\nfunction haveSameOwnKeys(previousItem: unknown, nextItem: unknown): boolean {\n  const previousKeys = Reflect.ownKeys(Object(previousItem));\n  const nextKeys = Reflect.ownKeys(Object(nextItem));\n\n  if (previousKeys.length !== nextKeys.length) {\n    return false;\n  }\n\n  for (let i = 0; i < previousKeys.length; i += 1) {\n    if (previousKeys[i] !== nextKeys[i]) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nfunction scopeReadsSource(\n  scope: ChildScope,\n  source: ReadableSource<unknown>\n): boolean {\n  return source._readers?.has(scope.componentInstance) ?? false;\n}\n\nfunction isForParentReader<T>(\n  forState: ForState<T>,\n  reader: ComponentInstance\n): boolean {\n  let current = forState.parentInstance;\n\n  while (current) {\n    if (current === reader) {\n      return true;\n    }\n    current = current.parentInstance;\n  }\n\n  return false;\n}\n\nfunction removeForParentReaders<T>(\n  forState: ForState<T>,\n  source: ReadableSource<unknown>\n): void {\n  const readers = source._readers;\n  if (!readers || readers.size === 0) {\n    return;\n  }\n\n  for (const reader of readers.keys()) {\n    if (isForParentReader(forState, reader)) {\n      readers.delete(reader);\n    }\n  }\n}\n\nfunction getOrCreateForItemPropertySignal<T>(\n  item: T,\n  propertySignals: Map<PropertyKey, ForItemPropertySignal>,\n  prop: PropertyKey\n): ForItemPropertySignal {\n  const existingSignal = propertySignals.get(prop);\n  if (existingSignal) {\n    return existingSignal;\n  }\n\n  const propertySignal = createForItemPropertySignal(\n    readForItemProperty(item, prop)\n  );\n  propertySignals.set(prop, propertySignal);\n  return propertySignal;\n}\n\nfunction canProxyForItem(item: unknown): item is object {\n  return (\n    (typeof item === 'object' && item !== null) || typeof item === 'function'\n  );\n}\n\nfunction createReactiveForItem<T>(\n  itemSignal: ForItemSignal<T>,\n  propertySignals: Map<PropertyKey, ForItemPropertySignal>\n): T {\n  const target = Object.create(null) as Record<string | symbol, unknown>;\n\n  return new Proxy(target, {\n    get(target, prop, receiver) {\n      const ownDescriptor = Reflect.getOwnPropertyDescriptor(target, prop);\n      if (ownDescriptor) {\n        return Reflect.get(target, prop, receiver);\n      }\n\n      const currentItem = itemSignal.peek();\n\n      if (typeof prop !== 'symbol') {\n        return getOrCreateForItemPropertySignal(\n          currentItem,\n          propertySignals,\n          prop\n        )();\n      }\n\n      recordReadableRead(itemSignal);\n      return Reflect.get(Object(currentItem), prop, receiver);\n    },\n    has(target, prop) {\n      recordReadableRead(itemSignal);\n      return prop in target || prop in Object(itemSignal.peek());\n    },\n    ownKeys(target) {\n      recordReadableRead(itemSignal);\n      const keys = new Set<string | symbol>(Reflect.ownKeys(target));\n      for (const key of Reflect.ownKeys(Object(itemSignal.peek()))) {\n        keys.add(key);\n      }\n\n      return Array.from(keys);\n    },\n    getOwnPropertyDescriptor(target, prop) {\n      recordReadableRead(itemSignal);\n      const ownDescriptor = Reflect.getOwnPropertyDescriptor(target, prop);\n      if (ownDescriptor) {\n        return ownDescriptor;\n      }\n\n      return Object.getOwnPropertyDescriptor(Object(itemSignal.peek()), prop);\n    },\n    getPrototypeOf() {\n      recordReadableRead(itemSignal);\n      return Object.getPrototypeOf(Object(itemSignal.peek()));\n    },\n  }) as T;\n}\n\nfunction materializeItemVnode(\n  key: string | number,\n  vnode: VNode | undefined\n): void {\n  if (vnode && typeof vnode === 'object' && 'type' in vnode) {\n    const vn = vnode as DOMElement;\n    vn.key = key;\n\n    if (typeof vn.type === 'string') {\n      if (!vn.props) vn.props = {};\n      if (vn.props['data-key'] === undefined) {\n        vn.props['data-key'] = String(key);\n      }\n    }\n  }\n}\n\nfunction renderItemScope<T>(\n  forState: ForState<T>,\n  scope: ChildScope,\n  item: T,\n  indexSignal: ForIndexSignal,\n  key: string | number\n): VNode {\n  recordBenchEvent('rowFactory');\n  const vnode = scope.render(() => forState.renderFn(item, indexSignal));\n  materializeItemVnode(key, vnode);\n  return vnode;\n}\n\nfunction failForValidation(message: string): never {\n  throw new Error(message);\n}\n\nfunction validateForKeys<T>(forState: ForState<T>, newArray: T[]): void {\n  if (!isDevelopmentEnvironment()) {\n    return;\n  }\n\n  const seen = new Set<string | number>();\n  const keyKinds = new Map<string, 'number' | 'string'>();\n  for (let i = 0; i < newArray.length; i++) {\n    const key = forState.byFn(newArray[i], i);\n\n    if (key === null || key === undefined) {\n      failForValidation(\n        '[askr] Invalid For key detected. Keys should be stable, non-null, and unique within a For list.'\n      );\n    }\n\n    if (seen.has(key)) {\n      failForValidation(\n        `[askr] Duplicate For key detected: ${String(key)}. Keys should be stable, non-null, and unique within a For list.`\n      );\n    }\n\n    seen.add(key);\n\n    const keyString = String(key);\n    const keyKind = typeof key;\n    const previousKeyKind = forState.devKeyKinds?.get(keyString);\n    if (previousKeyKind && previousKeyKind !== keyKind) {\n      failForValidation(\n        `[askr] For key type changed for ${keyString}. Keys must remain consistently typed across renders.`\n      );\n    }\n    keyKinds.set(keyString, keyKind as 'number' | 'string');\n  }\n\n  forState.devKeyKinds = keyKinds;\n}\n\ntype RemovedDomCleanupMode = 'none' | 'teardown' | 'full-clear';\n\nfunction disposeItemInstance<T>(\n  forState: ForState<T>,\n  itemInstance: ForItemInstance<T>,\n  domCleanup: RemovedDomCleanupMode\n): void {\n  recordBenchEvent('itemRemoved');\n  const removedDom = itemInstance.scope.dom;\n\n  try {\n    disposeChildScope(itemInstance.scope);\n  } catch (err) {\n    if (isDevelopmentEnvironment()) {\n      console.error('[For] Cleanup error:', err);\n    }\n  }\n\n  if (!removedDom) {\n    return;\n  }\n\n  if (removedDom instanceof Element) {\n    if (domCleanup === 'teardown') {\n      teardownNodeSubtree(removedDom);\n    }\n  }\n\n  forState.lastRemovedNodes.push(removedDom);\n}\n\nexport function createItemInstance<T>(\n  key: string | number,\n  item: T,\n  index: number,\n  forState: ForState<T>\n): ForItemInstance<T> {\n  recordBenchEvent('itemCreated');\n\n  // Create index signal manually without going through state() hook\n  // to avoid hook order violations (each For item creates its signal dynamically)\n  const indexSignal = createForIndexSignal(index);\n  const itemSignal = canProxyForItem(item) ? createForItemSignal(item) : null;\n  const itemPropertySignals = itemSignal\n    ? new Map<PropertyKey, ForItemPropertySignal>()\n    : null;\n  const reactiveItem =\n    itemSignal && itemPropertySignals\n      ? createReactiveForItem(itemSignal, itemPropertySignals)\n      : item;\n  let itemInstance: ForItemInstance<T> | null = null;\n  const scope = createChildScope(forState.parentInstance, key, () => {\n    if (forState._enqueueBoundaryCommit) {\n      forState._enqueueBoundaryCommit();\n      return;\n    }\n\n    const parent = forState.parentInstance;\n    if (parent) {\n      parent._enqueueRun?.();\n    }\n  });\n\n  renderItemScope(forState, scope, reactiveItem, indexSignal, key);\n\n  itemInstance = {\n    key,\n    item,\n    reactiveItem,\n    itemSignal,\n    itemPropertySignals,\n    indexSignal,\n    scope,\n  };\n\n  return itemInstance;\n}\n\nfunction rerenderItemInstance<T>(\n  forState: ForState<T>,\n  itemInstance: ForItemInstance<T>,\n  item: T\n): void {\n  renderItemScope(\n    forState,\n    itemInstance.scope,\n    item,\n    itemInstance.indexSignal,\n    itemInstance.key\n  );\n}\n\nfunction updateItemInstance<T>(\n  forState: ForState<T>,\n  itemInstance: ForItemInstance<T>,\n  item: T\n): boolean {\n  if (itemInstance.item === item) {\n    return false;\n  }\n\n  const previousItem = itemInstance.item;\n  itemInstance.item = item;\n\n  const scope = itemInstance.scope;\n  let scopeReadsChangedSignal = false;\n  const itemSignal = itemInstance.itemSignal;\n  if (!itemSignal) {\n    rerenderItemInstance(forState, itemInstance, item);\n    return true;\n  }\n\n  const propertySignals = itemInstance.itemPropertySignals;\n  const changedPropertySignals: Array<[ForItemPropertySignal, unknown]> = [];\n  if (propertySignals && propertySignals.size > 0) {\n    for (const [prop, propertySignal] of propertySignals) {\n      const previousValue = readForItemProperty(previousItem, prop);\n      const nextValue = readForItemProperty(item, prop);\n      if (Object.is(previousValue, nextValue)) {\n        continue;\n      }\n\n      if (scopeReadsSource(scope, propertySignal)) {\n        scopeReadsChangedSignal = true;\n      }\n\n      changedPropertySignals.push([propertySignal, nextValue]);\n    }\n  }\n\n  if (scopeReadsSource(scope, itemSignal)) {\n    scopeReadsChangedSignal = true;\n  }\n\n  const itemShapeChanged =\n    changedPropertySignals.length === 0 && !haveSameOwnKeys(previousItem, item);\n  const notifyReaders =\n    !scopeReadsChangedSignal &&\n    (changedPropertySignals.length > 0 || itemShapeChanged);\n  const visibleChange =\n    scopeReadsChangedSignal ||\n    changedPropertySignals.length > 0 ||\n    itemShapeChanged;\n  for (const [propertySignal, nextValue] of changedPropertySignals) {\n    removeForParentReaders(forState, propertySignal);\n    propertySignal.set(nextValue, notifyReaders);\n  }\n  removeForParentReaders(forState, itemSignal);\n  itemSignal.set(item, notifyReaders);\n\n  if (scopeReadsChangedSignal) {\n    rerenderItemInstance(forState, itemInstance, itemInstance.reactiveItem);\n  }\n\n  return visibleChange;\n}\n\nconst FOR_FALLBACK_SCOPE_KEY = '__for-fallback__';\n\nfunction disposeFallbackScope<T>(\n  forState: ForState<T>,\n  domCleanup: RemovedDomCleanupMode\n): void {\n  const fallbackScope = forState.fallbackScope;\n  if (!fallbackScope) {\n    return;\n  }\n\n  const removedDom = fallbackScope.dom;\n  disposeChildScope(fallbackScope);\n  forState.fallbackScope = null;\n\n  if (!removedDom) {\n    return;\n  }\n\n  if (removedDom instanceof Element) {\n    if (domCleanup === 'teardown') {\n      teardownNodeSubtree(removedDom);\n    }\n  }\n\n  forState.lastRemovedNodes.push(removedDom);\n}\n\nfunction renderFallbackScope<T>(forState: ForState<T>): VNode[] {\n  if (forState.fallback == null || forState.fallback === false) {\n    if (forState.fallbackScope) {\n      disposeFallbackScope(forState, 'none');\n    }\n    forState.orderedVNodes = [];\n    forState.orderedItems = [];\n    return [];\n  }\n\n  const fallbackScope =\n    forState.fallbackScope ??\n    createChildScope(forState.parentInstance, FOR_FALLBACK_SCOPE_KEY, () => {\n      if (forState._enqueueBoundaryCommit) {\n        forState._enqueueBoundaryCommit();\n        return;\n      }\n\n      forState.parentInstance?._enqueueRun?.();\n    });\n  forState.fallbackScope = fallbackScope;\n\n  const vnode = fallbackScope.render(() => forState.fallback as VNode);\n  forState.orderedVNodes = vnode == null || vnode === false ? [] : [vnode];\n  forState.orderedItems = [];\n  return forState.orderedVNodes;\n}\n\nfunction disposeAllItems<T>(\n  forState: ForState<T>,\n  domCleanup: RemovedDomCleanupMode\n): void {\n  const { items, orderedKeys } = forState;\n  for (let index = 0; index < orderedKeys.length; index += 1) {\n    const key = orderedKeys[index];\n    const itemInstance = items.get(key);\n    if (!itemInstance) {\n      continue;\n    }\n    disposeItemInstance(forState, itemInstance, domCleanup);\n    items.delete(key);\n  }\n  orderedKeys.length = 0;\n  forState.orderedKeys = orderedKeys;\n}\n\nexport function reconcileForItems<T>(\n  forState: ForState<T>,\n  newArray: T[]\n): VNode[] {\n  forState.currentItems = newArray;\n  validateForKeys(forState, newArray);\n\n  if (BENCH_BUILD_ENABLED) {\n    resetBenchMetrics();\n  }\n\n  const reconcileStartMs = BENCH_BUILD_ENABLED ? performance.now() : 0;\n\n  const { items, orderedKeys, byFn } = forState;\n  const oldLen = orderedKeys.length;\n  const newLen = newArray.length;\n  forState.lastRemovedNodes = [];\n\n  if (newLen === 0) {\n    if (oldLen > 0) {\n      disposeAllItems(forState, forState.fallback ? 'teardown' : 'none');\n    }\n    recordBenchFastLane('TRUNCATE');\n    forState.lastCommitStrategy = 'TRUNCATE';\n    forState.pendingDirtyIndices = null;\n    forState.pendingSwapIndices = null;\n    forState.pendingMoveOnly = false;\n\n    if (BENCH_BUILD_ENABLED) {\n      recordBenchTiming('reconcile', performance.now() - reconcileStartMs);\n      flushBenchMetrics();\n    }\n\n    return renderFallbackScope(forState);\n  }\n\n  if (forState.fallbackScope) {\n    disposeFallbackScope(forState, 'none');\n  }\n\n  // ─────────────────────────────────────────────────────────────────────────\n  // FAST PATH A: APPEND\n  // Guard: oldLen <= newLen && all old keys match new keys at same indices\n  // ─────────────────────────────────────────────────────────────────────────\n  if (oldLen < newLen) {\n    let canUseAppendPath = true;\n    for (let i = 0; i < oldLen; i++) {\n      const key = byFn(newArray[i], i);\n      if (key !== orderedKeys[i]) {\n        canUseAppendPath = false;\n        break;\n      }\n    }\n\n    if (canUseAppendPath) {\n      recordBenchFastLane('APPEND');\n      forState.lastCommitStrategy = 'APPEND';\n      const resultVNodes = forState.orderedVNodes;\n      const resultItems = forState.orderedItems;\n      resultVNodes.length = newLen;\n      resultItems.length = newLen;\n\n      // Update existing rows in-place\n      for (let i = 0; i < oldLen; i++) {\n        const item = newArray[i];\n        const key = orderedKeys[i];\n        const existing = resultItems[i] ?? items.get(key)!;\n\n        updateItemInstance(forState, existing, item);\n\n        resultItems[i] = existing;\n        resultVNodes[i] = existing.scope.vnode as VNode;\n      }\n\n      recordBenchEvent('itemReused', oldLen);\n\n      // Create and append new rows\n      for (let i = oldLen; i < newLen; i++) {\n        const item = newArray[i];\n        const key = byFn(item, i);\n        const itemInstance = createItemInstance(key, item, i, forState);\n        items.set(key, itemInstance);\n        resultItems[i] = itemInstance;\n        resultVNodes[i] = itemInstance.scope.vnode as VNode;\n        orderedKeys[i] = key;\n      }\n\n      if (BENCH_BUILD_ENABLED) {\n        recordBenchTiming('reconcile', performance.now() - reconcileStartMs);\n        flushBenchMetrics();\n      }\n\n      forState.orderedVNodes = resultVNodes;\n      forState.pendingDirtyIndices = null;\n      forState.pendingSwapIndices = null;\n      forState.pendingMoveOnly = false;\n\n      return resultVNodes;\n    }\n  }\n\n  // ─────────────────────────────────────────────────────────────────────────\n  // FAST PATH B: TRUNCATE\n  // Guard: newLen <= oldLen && all new keys match old keys at same indices\n  // ─────────────────────────────────────────────────────────────────────────\n  if (newLen < oldLen) {\n    if (oldLen === newLen + 1) {\n      let removedIndex = -1;\n\n      for (let i = 0; i < newLen; i++) {\n        const nextKey = byFn(newArray[i], i);\n        if (nextKey !== orderedKeys[i]) {\n          removedIndex = i;\n          break;\n        }\n      }\n\n      if (removedIndex !== -1) {\n        let canUseRemoveOnePath = true;\n        for (let i = removedIndex; i < newLen; i++) {\n          const nextKey = byFn(newArray[i], i);\n          if (nextKey !== orderedKeys[i + 1]) {\n            canUseRemoveOnePath = false;\n            break;\n          }\n        }\n\n        if (canUseRemoveOnePath) {\n          recordBenchFastLane('REMOVE_ONE');\n          forState.lastCommitStrategy = 'NO_REORDER';\n\n          const previousOrderedItems = forState.orderedItems.slice();\n          const resultVNodes = forState.orderedVNodes;\n          const resultItems = forState.orderedItems;\n          resultVNodes.length = newLen;\n          resultItems.length = newLen;\n          const dirtyIndices: number[] = [];\n\n          for (let i = 0; i < newLen; i++) {\n            const item = newArray[i];\n            const key = i < removedIndex ? orderedKeys[i] : orderedKeys[i + 1];\n            const existing = items.get(key)!;\n            const scopeNeedsDomUpdate = existing.scope.needsDomUpdate;\n\n            const itemChanged = existing.item !== item;\n            const indexSignal = existing.indexSignal;\n            const indexChanged = indexSignal.peek() !== i;\n\n            if (itemChanged) {\n              updateItemInstance(forState, existing, item);\n            }\n\n            const indexVisibleChange = indexChanged\n              ? syncForItemIndex(forState, existing, i)\n              : false;\n\n            if (itemChanged || indexVisibleChange || scopeNeedsDomUpdate) {\n              dirtyIndices.push(i);\n            }\n\n            resultItems[i] = existing;\n            resultVNodes[i] = existing.scope.vnode as VNode;\n          }\n\n          recordBenchEvent('itemReused', newLen);\n\n          const removedKey = orderedKeys[removedIndex];\n          const removedItem = items.get(removedKey);\n          if (removedItem) {\n            disposeItemInstance(forState, removedItem, 'teardown');\n            items.delete(removedKey);\n          }\n\n          const nextOrderedKeys = orderedKeys.slice(0, newLen);\n          const nextOrderedItems = previousOrderedItems.slice(0, newLen);\n          for (let i = removedIndex; i < newLen; i++) {\n            nextOrderedKeys[i] = orderedKeys[i + 1];\n            nextOrderedItems[i] = previousOrderedItems[i + 1];\n          }\n          forState.orderedKeys = nextOrderedKeys;\n          forState.orderedItems = nextOrderedItems;\n\n          if (BENCH_BUILD_ENABLED) {\n            recordBenchTiming(\n              'reconcile',\n              performance.now() - reconcileStartMs\n            );\n            flushBenchMetrics();\n          }\n\n          forState.pendingDirtyIndices = dirtyIndices;\n          forState.pendingSwapIndices = null;\n          forState.pendingMoveOnly = false;\n\n          return resultVNodes;\n        }\n      }\n    }\n\n    let canUseTruncatePath = true;\n    for (let i = 0; i < newLen; i++) {\n      const key = byFn(newArray[i], i);\n      if (key !== orderedKeys[i]) {\n        canUseTruncatePath = false;\n        break;\n      }\n    }\n\n    if (canUseTruncatePath) {\n      recordBenchFastLane('TRUNCATE');\n      forState.lastCommitStrategy = 'TRUNCATE';\n      const resultVNodes = forState.orderedVNodes;\n      const resultItems = forState.orderedItems;\n      resultVNodes.length = newLen;\n      resultItems.length = newLen;\n      const isFullClear = newLen === 0;\n\n      // Update existing rows in-place\n      for (let i = 0; i < newLen; i++) {\n        const item = newArray[i];\n        const key = orderedKeys[i];\n        const existing = items.get(key)!;\n\n        updateItemInstance(forState, existing, item);\n\n        resultItems[i] = existing;\n        resultVNodes[i] = existing.scope.vnode as VNode;\n      }\n\n      recordBenchEvent('itemReused', newLen);\n\n      // Remove tail rows\n      for (let i = newLen; i < oldLen; i++) {\n        const key = orderedKeys[i];\n        const itemInstance = items.get(key);\n        if (itemInstance) {\n          disposeItemInstance(\n            forState,\n            itemInstance,\n            isFullClear ? 'full-clear' : 'teardown'\n          );\n          items.delete(key);\n        }\n      }\n\n      orderedKeys.length = newLen;\n      forState.orderedKeys = orderedKeys;\n      forState.orderedItems.length = newLen;\n\n      if (BENCH_BUILD_ENABLED) {\n        recordBenchTiming('reconcile', performance.now() - reconcileStartMs);\n        flushBenchMetrics();\n      }\n\n      forState.orderedVNodes = resultVNodes;\n      forState.pendingDirtyIndices = null;\n      forState.pendingSwapIndices = null;\n      forState.pendingMoveOnly = false;\n\n      return resultVNodes;\n    }\n  }\n\n  // ─────────────────────────────────────────────────────────────────────────\n  // FAST PATH C: NO-REORDER (in-place update only)\n  // Guard: oldLen === newLen && keys match at all indices\n  // ─────────────────────────────────────────────────────────────────────────\n  if (oldLen === newLen) {\n    let canUseNoReorderPath = true;\n    for (let i = 0; i < oldLen; i++) {\n      const key = byFn(newArray[i], i);\n      if (key !== orderedKeys[i]) {\n        canUseNoReorderPath = false;\n        break;\n      }\n    }\n\n    if (canUseNoReorderPath) {\n      recordBenchFastLane('NO_REORDER');\n      forState.lastCommitStrategy = 'NO_REORDER';\n      const resultVNodes = forState.orderedVNodes;\n      const resultItems = forState.orderedItems;\n      resultVNodes.length = oldLen;\n      resultItems.length = oldLen;\n      const dirtyIndices: number[] = [];\n      // Update in-place only, no DOM moves needed\n      for (let i = 0; i < oldLen; i++) {\n        const item = newArray[i];\n        const key = orderedKeys[i];\n        const existing = items.get(key)!;\n        const itemChanged = existing.item !== item;\n\n        if (itemChanged) {\n          updateItemInstance(forState, existing, item);\n        }\n\n        if (!itemChanged && existing.scope.needsDomUpdate) {\n          dirtyIndices.push(i);\n        }\n\n        resultItems[i] = existing;\n        resultVNodes[i] = existing.scope.vnode as VNode;\n      }\n\n      recordBenchEvent('itemReused', oldLen);\n\n      if (BENCH_BUILD_ENABLED) {\n        recordBenchTiming('reconcile', performance.now() - reconcileStartMs);\n        flushBenchMetrics();\n      }\n\n      forState.pendingDirtyIndices = dirtyIndices;\n      forState.pendingSwapIndices = null;\n      forState.pendingMoveOnly = false;\n\n      return resultVNodes;\n    }\n\n    let firstMismatch = -1;\n    let secondMismatch = -1;\n    let firstMismatchKey: string | number | null = null;\n    let secondMismatchKey: string | number | null = null;\n    let mismatchCount = 0;\n    let canUseSwapPath = true;\n\n    for (let i = 0; i < oldLen; i++) {\n      const item = newArray[i];\n      const key = byFn(newArray[i], i);\n      if (key === orderedKeys[i]) {\n        const existing = items.get(key);\n        if (existing && existing.item !== item) {\n          canUseSwapPath = false;\n          break;\n        }\n        continue;\n      }\n\n      mismatchCount++;\n      if (firstMismatch === -1) {\n        firstMismatch = i;\n        firstMismatchKey = key;\n        continue;\n      }\n\n      if (secondMismatch === -1) {\n        secondMismatch = i;\n        secondMismatchKey = key;\n        continue;\n      }\n\n      mismatchCount = 3;\n      break;\n    }\n\n    if (\n      canUseSwapPath &&\n      mismatchCount === 2 &&\n      firstMismatch !== -1 &&\n      secondMismatch !== -1 &&\n      firstMismatchKey === orderedKeys[secondMismatch] &&\n      secondMismatchKey === orderedKeys[firstMismatch]\n    ) {\n      recordBenchFastLane('SWAP');\n      recordBenchEvent('itemMoved');\n      recordBenchEvent('itemMoved');\n\n      forState.lastCommitStrategy = 'SWAP';\n\n      const nextOrderedKeys = orderedKeys.slice();\n      nextOrderedKeys[firstMismatch] = firstMismatchKey;\n      nextOrderedKeys[secondMismatch] = secondMismatchKey;\n\n      const resultVNodes = forState.orderedVNodes;\n      const firstExisting = items.get(firstMismatchKey)!;\n      const secondExisting = items.get(secondMismatchKey)!;\n      const firstItem = newArray[firstMismatch];\n      const secondItem = newArray[secondMismatch];\n      const nextOrderedItems = forState.orderedItems.slice();\n      nextOrderedItems[firstMismatch] = secondExisting;\n      nextOrderedItems[secondMismatch] = firstExisting;\n\n      recordBenchEvent('itemReused');\n      recordBenchEvent('itemReused');\n\n      if (firstExisting.item !== firstItem) {\n        updateItemInstance(forState, firstExisting, firstItem);\n      }\n\n      if (secondExisting.item !== secondItem) {\n        updateItemInstance(forState, secondExisting, secondItem);\n      }\n\n      syncForItemIndex(forState, firstExisting, firstMismatch);\n\n      syncForItemIndex(forState, secondExisting, secondMismatch);\n\n      resultVNodes[firstMismatch] = firstExisting.scope.vnode as VNode;\n      resultVNodes[secondMismatch] = secondExisting.scope.vnode as VNode;\n\n      forState.orderedKeys = nextOrderedKeys;\n      forState.orderedItems = nextOrderedItems;\n\n      if (BENCH_BUILD_ENABLED) {\n        recordBenchTiming('reconcile', performance.now() - reconcileStartMs);\n        flushBenchMetrics();\n      }\n\n      forState.pendingDirtyIndices = null;\n      forState.pendingSwapIndices = [firstMismatch, secondMismatch];\n      forState.pendingMoveOnly = true;\n\n      return resultVNodes;\n    }\n\n    let canUseMoveOnlyPath = true;\n    const moveOnlyKeys: Array<string | number> = [];\n    const moveOnlyItems: ForItemInstance<T>[] = [];\n    const moveOnlyVNodes: VNode[] = [];\n\n    for (let i = 0; i < oldLen; i++) {\n      const item = newArray[i];\n      const key = byFn(item, i);\n      const existing = items.get(key);\n\n      if (\n        !existing ||\n        existing.item !== item ||\n        (existing.indexSignal._hasBeenRead && existing.indexSignal.peek() !== i)\n      ) {\n        canUseMoveOnlyPath = false;\n        break;\n      }\n\n      moveOnlyKeys[i] = key;\n      moveOnlyItems[i] = existing;\n      moveOnlyVNodes[i] = existing.scope.vnode as VNode;\n      recordBenchEvent('itemReused');\n    }\n\n    if (canUseMoveOnlyPath) {\n      recordBenchFastLane('FULL_KEYED');\n      forState.lastCommitStrategy = 'FULL_KEYED';\n\n      for (let i = 0; i < moveOnlyItems.length; i++) {\n        syncForItemIndex(forState, moveOnlyItems[i], i);\n        moveOnlyVNodes[i] = moveOnlyItems[i].scope.vnode as VNode;\n      }\n\n      forState.orderedKeys = moveOnlyKeys;\n      forState.orderedItems = moveOnlyItems;\n      forState.orderedVNodes = moveOnlyVNodes;\n\n      if (BENCH_BUILD_ENABLED) {\n        recordBenchTiming('reconcile', performance.now() - reconcileStartMs);\n        flushBenchMetrics();\n      }\n\n      forState.pendingDirtyIndices = null;\n      forState.pendingSwapIndices = null;\n      forState.pendingMoveOnly = true;\n\n      return moveOnlyVNodes;\n    }\n  }\n\n  // ─────────────────────────────────────────────────────────────────────────\n  // FULL KEYED RECONCILIATION (slow path for complex reorders)\n  // Avoid allocating newKeyMap: iterate directly and track removals\n  // ─────────────────────────────────────────────────────────────────────────\n  recordBenchFastLane('FULL_KEYED');\n  forState.lastCommitStrategy = 'FULL_KEYED';\n\n  const toRemove = new Set(orderedKeys);\n  const newOrderedKeys: Array<string | number> = [];\n  const newOrderedItems: ForItemInstance<T>[] = [];\n  const resultVNodes: VNode[] = [];\n  let moveOnly = toRemove.size === newArray.length;\n\n  // Single pass: iterate new array directly, no intermediate map\n  for (let i = 0; i < newArray.length; i++) {\n    const item = newArray[i];\n    const key = byFn(item, i);\n    recordBenchEvent('keyLookup');\n\n    toRemove.delete(key);\n    newOrderedKeys.push(key);\n\n    const existing = items.get(key);\n    recordBenchEvent(existing ? 'keyHit' : 'keyMiss');\n\n    if (!existing) {\n      // Added: create new item instance\n      const itemInstance = createItemInstance(key, item, i, forState);\n      items.set(key, itemInstance);\n      newOrderedItems.push(itemInstance);\n      resultVNodes.push(itemInstance.scope.vnode as VNode);\n    } else {\n      // Exists: check if item changed (by identity)\n      recordBenchEvent('itemReused');\n      const itemChanged = existing.item !== item;\n      const indexChanged = existing.indexSignal.peek() !== i;\n\n      if (itemChanged) {\n        moveOnly = false;\n        updateItemInstance(forState, existing, item);\n      }\n\n      if (indexChanged) {\n        // Index changed: update index signal (triggers re-render if index is used)\n        syncForItemIndex(forState, existing, i);\n      }\n\n      newOrderedItems.push(existing);\n      resultVNodes.push(existing.scope.vnode as VNode);\n    }\n  }\n\n  // Remove deleted items\n  for (const key of toRemove) {\n    moveOnly = false;\n    const itemInstance = items.get(key);\n    if (itemInstance) {\n      disposeItemInstance(forState, itemInstance, 'none');\n      items.delete(key);\n    }\n  }\n\n  forState.orderedKeys = newOrderedKeys;\n  forState.orderedItems = newOrderedItems;\n\n  // Record reconcile timing\n  if (BENCH_BUILD_ENABLED) {\n    recordBenchTiming('reconcile', performance.now() - reconcileStartMs);\n    flushBenchMetrics();\n  }\n\n  forState.orderedVNodes = resultVNodes;\n  forState.pendingDirtyIndices = null;\n  forState.pendingSwapIndices = null;\n  forState.pendingMoveOnly = moveOnly;\n\n  return resultVNodes;\n}\n\nexport function evaluateForState<T>(forState: ForState<T>): VNode[] {\n  if (!Array.isArray(forState.currentItems)) {\n    throw new Error('For source must evaluate to an array');\n  }\n\n  forState._needsSourceReconcile = false;\n  return reconcileForItems(forState, forState.currentItems);\n}\n\nexport function clearForDomUpdateState<T>(forState: ForState<T>): void {\n  const dirtyIndices = forState.pendingDirtyIndices;\n  if (dirtyIndices && dirtyIndices.length > 0) {\n    for (let i = 0; i < dirtyIndices.length; i++) {\n      const itemInstance = forState.orderedItems[dirtyIndices[i]];\n      if (itemInstance) {\n        itemInstance.scope.needsDomUpdate = false;\n      }\n    }\n  } else {\n    for (let i = 0; i < forState.orderedKeys.length; i++) {\n      const key = forState.orderedKeys[i];\n      const itemInstance = forState.items.get(key);\n      if (itemInstance) {\n        itemInstance.scope.needsDomUpdate = false;\n      }\n    }\n  }\n\n  if (forState.fallbackScope) {\n    forState.fallbackScope.needsDomUpdate = false;\n  }\n  forState.lastRemovedNodes = [];\n  forState.pendingDirtyIndices = null;\n  forState.pendingSwapIndices = null;\n  forState.pendingMoveOnly = false;\n  forState._needsSourceReconcile = false;\n  forState._hasResolvedItemDom = forState.orderedKeys.length > 0;\n}\n"],"mappings":";;;;;;;;;;;;;AAwCA,MAAM,sBAAsB,oBAAoB;AA6EhD,MAAM,4BAAY,IAAI,QAGpB;AAEF,SAAS,YACP,UACgC;CAChC,IAAI,QAAQ,UAAU,IAAI,QAAQ;CAClC,IAAI,CAAC,OAAO;EACV,wBAAQ,IAAI,IAAI;EAChB,UAAU,IAAI,UAAU,KAAK;CAC/B;CACA,OAAO;AACT;AAEA,SAAgB,eACd,YACA,MACA,UACA,UACa;CACb,MAAM,iBAAiB,mBAAmB;CAE1C,OAAO;EACL,MAAM;EACN,cAAc,CAAC;EACf;EACA;EACA,eAAe;EACf,uBAAO,IAAI,IAAI;EACf,aAAa,CAAC;EACd,cAAc,CAAC;EACf,eAAe,CAAC;EAChB;EACA;EACA;EACA,oBAAoB;EACpB,kBAAkB,CAAC;EACnB,qBAAqB;EACrB,oBAAoB;EACpB,iBAAiB;EACjB,qBAAqB;EACrB,uBAAuB;EACvB,eAAe;EACf,sBAAsB;EACtB,wBAAwB;EACxB,2BAA2B;CAC7B;AACF;AAEA,SAAgB,YACd,YACA,MACA,UACA,UACa;CACb,MAAM,WAAW,mBAAmB;CACpC,IAAI,CAAC,UACH,MAAM,IAAI,MACR,4DACF;CAGF,MAAM,YAAY,eAAe,UAAU,KAAK;CAChD,MAAM,QAAQ,YAAY,QAAQ;CAClC,MAAM,WAAW,MAAM,IAAI,SAAS;CAEpC,IAAI,UAAU;EACZ,SAAS,aAAa;EACtB,SAAS,OAAO;EAChB,SAAS,WAAW;EACpB,SAAS,WAAW;EACpB,OAAO;CACT;CAEA,MAAM,UAAU,eAAe,YAAY,MAAM,UAAU,QAAQ;CACnE,MAAM,IAAI,WAAW,OAA4B;CAEjD,CAAC,SAAS,eAAe,CAAC,EAAA,CAAG,WAAW;EACtC,QAAQ,eAAe,QAAQ;EAC/B,QAAQ,gBAAgB;EACxB,MAAM,OAAO,SAAS;CACxB,CAAC;CAED,OAAO;AACT;AAEA,SAAS,qBAAqB,cAAsC;CAClE,IAAI,aAAa;CACjB,MAAM,0BAAU,IAAI,IAA+B;CAEnD,MAAM,qBAAqB;EACzB,YAAY,eAAe;EAC3B,mBAAmB,WAAW;EAC9B,OAAO;CACT;CACA,YAAY,WAAW;CACvB,YAAY,aAAa;CACzB,YAAY,OACV,UACA,gBAAgB,SACb;EACH,MAAM,YACJ,OAAO,aAAa,aAAa,SAAS,UAAU,IAAI;EAC1D,IAAI,cAAc,YAAY;GAC5B,aAAa;GACb,IAAI,eAAe;IACjB,oCAAoC,WAAW;IAC/C,6BAA6B,WAAW;IACxC,sBAAsB,WAAW;GACnC;EACF;CACF;CACA,YAAY,eAAe;CAE3B,OAAO;AACT;AAEA,SAAS,mBACP,aACA,WACS;CACT,IAAI,YAAY,KAAK,MAAM,WACzB,OAAO;CAGT,YAAY,IAAI,WAAW,YAAY,YAAY;CACnD,OAAO,YAAY,iBAAiB;AACtC;AAEA,SAAS,iBACP,UACA,cACA,WACS;CACT,MAAM,cAAc,aAAa;CACjC,IAAI,YAAY,KAAK,MAAM,WACzB,OAAO;CAIT,IAAI,CADoB,iBAAiB,aAAa,OAAO,WACxD,GAAiB;EACpB,mBAAmB,aAAa,SAAS;EACzC,OAAO;CACT;CAEA,YAAY,IAAI,WAAW,KAAK;CAChC,oCAAoC,WAAW;CAC/C,6BAA6B,WAAW;CACxC,sBAAsB,aAAa,aAAa,MAAM,iBAAiB;CAEvE,qBAAqB,UAAU,cAAc,aAAa,YAAY;CAEtE,OAAO;AACT;AAEA,SAAS,oBAAuB,aAAkC;CAChE,IAAI,YAAY;CAChB,MAAM,0BAAU,IAAI,IAA+B;CAEnD,MAAM,oBAAoB;EACxB,WAAW,eAAe;EAC1B,mBAAmB,UAAU;EAC7B,OAAO;CACT;CAEA,WAAW,WAAW;CACtB,WAAW,aAAa;CACxB,WAAW,OAAO,UAAa,gBAAgB,SAAS;EACtD,IAAI,OAAO,GAAG,WAAW,QAAQ,GAC/B;EAGF,YAAY;EACZ,IAAI,eAAe;GACjB,oCAAoC,UAAU;GAC9C,6BAA6B,UAAU;GACvC,sBAAsB,UAAU;EAClC;CACF;CACA,WAAW,eAAe;CAE1B,OAAO;AACT;AAEA,SAAS,4BACP,cACuB;CACvB,IAAI,gBAAgB;CACpB,MAAM,0BAAU,IAAI,IAA+B;CAEnD,MAAM,wBAAwB;EAC5B,eAAe,eAAe;EAC9B,mBAAmB,cAAc;EACjC,OAAO;CACT;CAEA,eAAe,WAAW;CAC1B,eAAe,aAAa;CAC5B,eAAe,OAAO,UAAmB,gBAAgB,SAAS;EAChE,IAAI,OAAO,GAAG,eAAe,QAAQ,GACnC;EAGF,gBAAgB;EAChB,IAAI,eAAe;GACjB,oCAAoC,cAAc;GAClD,6BAA6B,cAAc;GAC3C,sBAAsB,cAAc;EACtC;CACF;CACA,eAAe,eAAe;CAE9B,OAAO;AACT;AAEA,SAAS,oBAAoB,MAAe,MAA4B;CACtE,OAAO,QAAQ,IAAI,OAAO,IAAI,GAAG,IAAI;AACvC;AAEA,SAAS,gBAAgB,cAAuB,UAA4B;CAC1E,MAAM,eAAe,QAAQ,QAAQ,OAAO,YAAY,CAAC;CACzD,MAAM,WAAW,QAAQ,QAAQ,OAAO,QAAQ,CAAC;CAEjD,IAAI,aAAa,WAAW,SAAS,QACnC,OAAO;CAGT,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK,GAC5C,IAAI,aAAa,OAAO,SAAS,IAC/B,OAAO;CAIX,OAAO;AACT;AAEA,SAAS,iBACP,OACA,QACS;CACT,OAAO,OAAO,UAAU,IAAI,MAAM,iBAAiB,KAAK;AAC1D;AAEA,SAAS,kBACP,UACA,QACS;CACT,IAAI,UAAU,SAAS;CAEvB,OAAO,SAAS;EACd,IAAI,YAAY,QACd,OAAO;EAET,UAAU,QAAQ;CACpB;CAEA,OAAO;AACT;AAEA,SAAS,uBACP,UACA,QACM;CACN,MAAM,UAAU,OAAO;CACvB,IAAI,CAAC,WAAW,QAAQ,SAAS,GAC/B;CAGF,KAAK,MAAM,UAAU,QAAQ,KAAK,GAChC,IAAI,kBAAkB,UAAU,MAAM,GACpC,QAAQ,OAAO,MAAM;AAG3B;AAEA,SAAS,iCACP,MACA,iBACA,MACuB;CACvB,MAAM,iBAAiB,gBAAgB,IAAI,IAAI;CAC/C,IAAI,gBACF,OAAO;CAGT,MAAM,iBAAiB,4BACrB,oBAAoB,MAAM,IAAI,CAChC;CACA,gBAAgB,IAAI,MAAM,cAAc;CACxC,OAAO;AACT;AAEA,SAAS,gBAAgB,MAA+B;CACtD,OACG,OAAO,SAAS,YAAY,SAAS,QAAS,OAAO,SAAS;AAEnE;AAEA,SAAS,sBACP,YACA,iBACG;CAGH,OAAO,IAAI,MAFI,OAAO,OAAO,IAEZ,GAAQ;EACvB,IAAI,QAAQ,MAAM,UAAU;GAE1B,IADsB,QAAQ,yBAAyB,QAAQ,IAC3D,GACF,OAAO,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAG3C,MAAM,cAAc,WAAW,KAAK;GAEpC,IAAI,OAAO,SAAS,UAClB,OAAO,iCACL,aACA,iBACA,IACF,CAAC,CAAC;GAGJ,mBAAmB,UAAU;GAC7B,OAAO,QAAQ,IAAI,OAAO,WAAW,GAAG,MAAM,QAAQ;EACxD;EACA,IAAI,QAAQ,MAAM;GAChB,mBAAmB,UAAU;GAC7B,OAAO,QAAQ,UAAU,QAAQ,OAAO,WAAW,KAAK,CAAC;EAC3D;EACA,QAAQ,QAAQ;GACd,mBAAmB,UAAU;GAC7B,MAAM,OAAO,IAAI,IAAqB,QAAQ,QAAQ,MAAM,CAAC;GAC7D,KAAK,MAAM,OAAO,QAAQ,QAAQ,OAAO,WAAW,KAAK,CAAC,CAAC,GACzD,KAAK,IAAI,GAAG;GAGd,OAAO,MAAM,KAAK,IAAI;EACxB;EACA,yBAAyB,QAAQ,MAAM;GACrC,mBAAmB,UAAU;GAC7B,MAAM,gBAAgB,QAAQ,yBAAyB,QAAQ,IAAI;GACnE,IAAI,eACF,OAAO;GAGT,OAAO,OAAO,yBAAyB,OAAO,WAAW,KAAK,CAAC,GAAG,IAAI;EACxE;EACA,iBAAiB;GACf,mBAAmB,UAAU;GAC7B,OAAO,OAAO,eAAe,OAAO,WAAW,KAAK,CAAC,CAAC;EACxD;CACF,CAAC;AACH;AAEA,SAAS,qBACP,KACA,OACM;CACN,IAAI,SAAS,OAAO,UAAU,YAAY,UAAU,OAAO;EACzD,MAAM,KAAK;EACX,GAAG,MAAM;EAET,IAAI,OAAO,GAAG,SAAS,UAAU;GAC/B,IAAI,CAAC,GAAG,OAAO,GAAG,QAAQ,CAAC;GAC3B,IAAI,GAAG,MAAM,gBAAgB,QAC3B,GAAG,MAAM,cAAc,OAAO,GAAG;EAErC;CACF;AACF;AAEA,SAAS,gBACP,UACA,OACA,MACA,aACA,KACO;CACP,iBAAiB,YAAY;CAC7B,MAAM,QAAQ,MAAM,aAAa,SAAS,SAAS,MAAM,WAAW,CAAC;CACrE,qBAAqB,KAAK,KAAK;CAC/B,OAAO;AACT;AAEA,SAAS,kBAAkB,SAAwB;CACjD,MAAM,IAAI,MAAM,OAAO;AACzB;AAEA,SAAS,gBAAmB,UAAuB,UAAqB;CACtE,IAAI,CAAC,yBAAyB,GAC5B;CAGF,MAAM,uBAAO,IAAI,IAAqB;CACtC,MAAM,2BAAW,IAAI,IAAiC;CACtD,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,MAAM,SAAS,KAAK,SAAS,IAAI,CAAC;EAExC,IAAI,QAAQ,QAAQ,QAAQ,QAC1B,kBACE,iGACF;EAGF,IAAI,KAAK,IAAI,GAAG,GACd,kBACE,sCAAsC,OAAO,GAAG,EAAE,iEACpD;EAGF,KAAK,IAAI,GAAG;EAEZ,MAAM,YAAY,OAAO,GAAG;EAC5B,MAAM,UAAU,OAAO;EACvB,MAAM,kBAAkB,SAAS,aAAa,IAAI,SAAS;EAC3D,IAAI,mBAAmB,oBAAoB,SACzC,kBACE,mCAAmC,UAAU,sDAC/C;EAEF,SAAS,IAAI,WAAW,OAA8B;CACxD;CAEA,SAAS,cAAc;AACzB;AAIA,SAAS,oBACP,UACA,cACA,YACM;CACN,iBAAiB,aAAa;CAC9B,MAAM,aAAa,aAAa,MAAM;CAEtC,IAAI;EACF,kBAAkB,aAAa,KAAK;CACtC,SAAS,KAAK;EACZ,IAAI,yBAAyB,GAC3B,QAAQ,MAAM,wBAAwB,GAAG;CAE7C;CAEA,IAAI,CAAC,YACH;CAGF,IAAI,sBAAsB,SACxB;MAAI,eAAe,YACjB,oBAAoB,UAAU;CAChC;CAGF,SAAS,iBAAiB,KAAK,UAAU;AAC3C;AAEA,SAAgB,mBACd,KACA,MACA,OACA,UACoB;CACpB,iBAAiB,aAAa;CAI9B,MAAM,cAAc,qBAAqB,KAAK;CAC9C,MAAM,aAAa,gBAAgB,IAAI,IAAI,oBAAoB,IAAI,IAAI;CACvE,MAAM,sBAAsB,6BACxB,IAAI,IAAwC,IAC5C;CACJ,MAAM,eACJ,cAAc,sBACV,sBAAsB,YAAY,mBAAmB,IACrD;CACN,IAAI,eAA0C;CAC9C,MAAM,QAAQ,iBAAiB,SAAS,gBAAgB,WAAW;EACjE,IAAI,SAAS,wBAAwB;GACnC,SAAS,uBAAuB;GAChC;EACF;EAEA,MAAM,SAAS,SAAS;EACxB,IAAI,QACF,OAAO,cAAc;CAEzB,CAAC;CAED,gBAAgB,UAAU,OAAO,cAAc,aAAa,GAAG;CAE/D,eAAe;EACb;EACA;EACA;EACA;EACA;EACA;EACA;CACF;CAEA,OAAO;AACT;AAEA,SAAS,qBACP,UACA,cACA,MACM;CACN,gBACE,UACA,aAAa,OACb,MACA,aAAa,aACb,aAAa,GACf;AACF;AAEA,SAAS,mBACP,UACA,cACA,MACS;CACT,IAAI,aAAa,SAAS,MACxB,OAAO;CAGT,MAAM,eAAe,aAAa;CAClC,aAAa,OAAO;CAEpB,MAAM,QAAQ,aAAa;CAC3B,IAAI,0BAA0B;CAC9B,MAAM,aAAa,aAAa;CAChC,IAAI,CAAC,YAAY;EACf,qBAAqB,UAAU,cAAc,IAAI;EACjD,OAAO;CACT;CAEA,MAAM,kBAAkB,aAAa;CACrC,MAAM,yBAAkE,CAAC;CACzE,IAAI,mBAAmB,gBAAgB,OAAO,GAC5C,KAAK,MAAM,CAAC,MAAM,mBAAmB,iBAAiB;EACpD,MAAM,gBAAgB,oBAAoB,cAAc,IAAI;EAC5D,MAAM,YAAY,oBAAoB,MAAM,IAAI;EAChD,IAAI,OAAO,GAAG,eAAe,SAAS,GACpC;EAGF,IAAI,iBAAiB,OAAO,cAAc,GACxC,0BAA0B;EAG5B,uBAAuB,KAAK,CAAC,gBAAgB,SAAS,CAAC;CACzD;CAGF,IAAI,iBAAiB,OAAO,UAAU,GACpC,0BAA0B;CAG5B,MAAM,mBACJ,uBAAuB,WAAW,KAAK,CAAC,gBAAgB,cAAc,IAAI;CAC5E,MAAM,gBACJ,CAAC,4BACA,uBAAuB,SAAS,KAAK;CACxC,MAAM,gBACJ,2BACA,uBAAuB,SAAS,KAChC;CACF,KAAK,MAAM,CAAC,gBAAgB,cAAc,wBAAwB;EAChE,uBAAuB,UAAU,cAAc;EAC/C,eAAe,IAAI,WAAW,aAAa;CAC7C;CACA,uBAAuB,UAAU,UAAU;CAC3C,WAAW,IAAI,MAAM,aAAa;CAElC,IAAI,yBACF,qBAAqB,UAAU,cAAc,aAAa,YAAY;CAGxE,OAAO;AACT;AAEA,MAAM,yBAAyB;AAE/B,SAAS,qBACP,UACA,YACM;CACN,MAAM,gBAAgB,SAAS;CAC/B,IAAI,CAAC,eACH;CAGF,MAAM,aAAa,cAAc;CACjC,kBAAkB,aAAa;CAC/B,SAAS,gBAAgB;CAEzB,IAAI,CAAC,YACH;CAGF,IAAI,sBAAsB,SACxB;MAAI,eAAe,YACjB,oBAAoB,UAAU;CAChC;CAGF,SAAS,iBAAiB,KAAK,UAAU;AAC3C;AAEA,SAAS,oBAAuB,UAAgC;CAC9D,IAAI,SAAS,YAAY,QAAQ,SAAS,aAAa,OAAO;EAC5D,IAAI,SAAS,eACX,qBAAqB,UAAU,MAAM;EAEvC,SAAS,gBAAgB,CAAC;EAC1B,SAAS,eAAe,CAAC;EACzB,OAAO,CAAC;CACV;CAEA,MAAM,gBACJ,SAAS,iBACT,iBAAiB,SAAS,gBAAgB,8BAA8B;EACtE,IAAI,SAAS,wBAAwB;GACnC,SAAS,uBAAuB;GAChC;EACF;EAEA,SAAS,gBAAgB,cAAc;CACzC,CAAC;CACH,SAAS,gBAAgB;CAEzB,MAAM,QAAQ,cAAc,aAAa,SAAS,QAAiB;CACnE,SAAS,gBAAgB,SAAS,QAAQ,UAAU,QAAQ,CAAC,IAAI,CAAC,KAAK;CACvE,SAAS,eAAe,CAAC;CACzB,OAAO,SAAS;AAClB;AAEA,SAAS,gBACP,UACA,YACM;CACN,MAAM,EAAE,OAAO,gBAAgB;CAC/B,KAAK,IAAI,QAAQ,GAAG,QAAQ,YAAY,QAAQ,SAAS,GAAG;EAC1D,MAAM,MAAM,YAAY;EACxB,MAAM,eAAe,MAAM,IAAI,GAAG;EAClC,IAAI,CAAC,cACH;EAEF,oBAAoB,UAAU,cAAc,UAAU;EACtD,MAAM,OAAO,GAAG;CAClB;CACA,YAAY,SAAS;CACrB,SAAS,cAAc;AACzB;AAEA,SAAgB,kBACd,UACA,UACS;CACT,SAAS,eAAe;CACxB,gBAAgB,UAAU,QAAQ;CAElC,IAAI,qBACF,kBAAkB;CAGpB,MAAM,mBAAmB,sBAAsB,YAAY,IAAI,IAAI;CAEnE,MAAM,EAAE,OAAO,aAAa,SAAS;CACrC,MAAM,SAAS,YAAY;CAC3B,MAAM,SAAS,SAAS;CACxB,SAAS,mBAAmB,CAAC;CAE7B,IAAI,WAAW,GAAG;EAChB,IAAI,SAAS,GACX,gBAAgB,UAAU,SAAS,WAAW,aAAa,MAAM;EAEnE,oBAAoB,UAAU;EAC9B,SAAS,qBAAqB;EAC9B,SAAS,sBAAsB;EAC/B,SAAS,qBAAqB;EAC9B,SAAS,kBAAkB;EAE3B,IAAI,qBAAqB;GACvB,kBAAkB,aAAa,YAAY,IAAI,IAAI,gBAAgB;GACnE,kBAAkB;EACpB;EAEA,OAAO,oBAAoB,QAAQ;CACrC;CAEA,IAAI,SAAS,eACX,qBAAqB,UAAU,MAAM;CAOvC,IAAI,SAAS,QAAQ;EACnB,IAAI,mBAAmB;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAE1B,IADY,KAAK,SAAS,IAAI,CAC1B,MAAQ,YAAY,IAAI;GAC1B,mBAAmB;GACnB;EACF;EAGF,IAAI,kBAAkB;GACpB,oBAAoB,QAAQ;GAC5B,SAAS,qBAAqB;GAC9B,MAAM,eAAe,SAAS;GAC9B,MAAM,cAAc,SAAS;GAC7B,aAAa,SAAS;GACtB,YAAY,SAAS;GAGrB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;IAC/B,MAAM,OAAO,SAAS;IACtB,MAAM,MAAM,YAAY;IACxB,MAAM,WAAW,YAAY,MAAM,MAAM,IAAI,GAAG;IAEhD,mBAAmB,UAAU,UAAU,IAAI;IAE3C,YAAY,KAAK;IACjB,aAAa,KAAK,SAAS,MAAM;GACnC;GAEA,iBAAiB,cAAc,MAAM;GAGrC,KAAK,IAAI,IAAI,QAAQ,IAAI,QAAQ,KAAK;IACpC,MAAM,OAAO,SAAS;IACtB,MAAM,MAAM,KAAK,MAAM,CAAC;IACxB,MAAM,eAAe,mBAAmB,KAAK,MAAM,GAAG,QAAQ;IAC9D,MAAM,IAAI,KAAK,YAAY;IAC3B,YAAY,KAAK;IACjB,aAAa,KAAK,aAAa,MAAM;IACrC,YAAY,KAAK;GACnB;GAEA,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,IAAI,IAAI,gBAAgB;IACnE,kBAAkB;GACpB;GAEA,SAAS,gBAAgB;GACzB,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB;GAC9B,SAAS,kBAAkB;GAE3B,OAAO;EACT;CACF;CAMA,IAAI,SAAS,QAAQ;EACnB,IAAI,WAAW,SAAS,GAAG;GACzB,IAAI,eAAe;GAEnB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAE1B,IADgB,KAAK,SAAS,IAAI,CAC9B,MAAY,YAAY,IAAI;IAC9B,eAAe;IACf;GACF;GAGF,IAAI,iBAAiB,IAAI;IACvB,IAAI,sBAAsB;IAC1B,KAAK,IAAI,IAAI,cAAc,IAAI,QAAQ,KAErC,IADgB,KAAK,SAAS,IAAI,CAC9B,MAAY,YAAY,IAAI,IAAI;KAClC,sBAAsB;KACtB;IACF;IAGF,IAAI,qBAAqB;KACvB,oBAAoB,YAAY;KAChC,SAAS,qBAAqB;KAE9B,MAAM,uBAAuB,SAAS,aAAa,MAAM;KACzD,MAAM,eAAe,SAAS;KAC9B,MAAM,cAAc,SAAS;KAC7B,aAAa,SAAS;KACtB,YAAY,SAAS;KACrB,MAAM,eAAyB,CAAC;KAEhC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;MAC/B,MAAM,OAAO,SAAS;MACtB,MAAM,MAAM,IAAI,eAAe,YAAY,KAAK,YAAY,IAAI;MAChE,MAAM,WAAW,MAAM,IAAI,GAAG;MAC9B,MAAM,sBAAsB,SAAS,MAAM;MAE3C,MAAM,cAAc,SAAS,SAAS;MAEtC,MAAM,eADc,SAAS,YACI,KAAK,MAAM;MAE5C,IAAI,aACF,mBAAmB,UAAU,UAAU,IAAI;MAG7C,MAAM,qBAAqB,eACvB,iBAAiB,UAAU,UAAU,CAAC,IACtC;MAEJ,IAAI,eAAe,sBAAsB,qBACvC,aAAa,KAAK,CAAC;MAGrB,YAAY,KAAK;MACjB,aAAa,KAAK,SAAS,MAAM;KACnC;KAEA,iBAAiB,cAAc,MAAM;KAErC,MAAM,aAAa,YAAY;KAC/B,MAAM,cAAc,MAAM,IAAI,UAAU;KACxC,IAAI,aAAa;MACf,oBAAoB,UAAU,aAAa,UAAU;MACrD,MAAM,OAAO,UAAU;KACzB;KAEA,MAAM,kBAAkB,YAAY,MAAM,GAAG,MAAM;KACnD,MAAM,mBAAmB,qBAAqB,MAAM,GAAG,MAAM;KAC7D,KAAK,IAAI,IAAI,cAAc,IAAI,QAAQ,KAAK;MAC1C,gBAAgB,KAAK,YAAY,IAAI;MACrC,iBAAiB,KAAK,qBAAqB,IAAI;KACjD;KACA,SAAS,cAAc;KACvB,SAAS,eAAe;KAExB,IAAI,qBAAqB;MACvB,kBACE,aACA,YAAY,IAAI,IAAI,gBACtB;MACA,kBAAkB;KACpB;KAEA,SAAS,sBAAsB;KAC/B,SAAS,qBAAqB;KAC9B,SAAS,kBAAkB;KAE3B,OAAO;IACT;GACF;EACF;EAEA,IAAI,qBAAqB;EACzB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAE1B,IADY,KAAK,SAAS,IAAI,CAC1B,MAAQ,YAAY,IAAI;GAC1B,qBAAqB;GACrB;EACF;EAGF,IAAI,oBAAoB;GACtB,oBAAoB,UAAU;GAC9B,SAAS,qBAAqB;GAC9B,MAAM,eAAe,SAAS;GAC9B,MAAM,cAAc,SAAS;GAC7B,aAAa,SAAS;GACtB,YAAY,SAAS;GACrB,MAAM,cAAc,WAAW;GAG/B,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;IAC/B,MAAM,OAAO,SAAS;IACtB,MAAM,MAAM,YAAY;IACxB,MAAM,WAAW,MAAM,IAAI,GAAG;IAE9B,mBAAmB,UAAU,UAAU,IAAI;IAE3C,YAAY,KAAK;IACjB,aAAa,KAAK,SAAS,MAAM;GACnC;GAEA,iBAAiB,cAAc,MAAM;GAGrC,KAAK,IAAI,IAAI,QAAQ,IAAI,QAAQ,KAAK;IACpC,MAAM,MAAM,YAAY;IACxB,MAAM,eAAe,MAAM,IAAI,GAAG;IAClC,IAAI,cAAc;KAChB,oBACE,UACA,cACA,cAAc,eAAe,UAC/B;KACA,MAAM,OAAO,GAAG;IAClB;GACF;GAEA,YAAY,SAAS;GACrB,SAAS,cAAc;GACvB,SAAS,aAAa,SAAS;GAE/B,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,IAAI,IAAI,gBAAgB;IACnE,kBAAkB;GACpB;GAEA,SAAS,gBAAgB;GACzB,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB;GAC9B,SAAS,kBAAkB;GAE3B,OAAO;EACT;CACF;CAMA,IAAI,WAAW,QAAQ;EACrB,IAAI,sBAAsB;EAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAE1B,IADY,KAAK,SAAS,IAAI,CAC1B,MAAQ,YAAY,IAAI;GAC1B,sBAAsB;GACtB;EACF;EAGF,IAAI,qBAAqB;GACvB,oBAAoB,YAAY;GAChC,SAAS,qBAAqB;GAC9B,MAAM,eAAe,SAAS;GAC9B,MAAM,cAAc,SAAS;GAC7B,aAAa,SAAS;GACtB,YAAY,SAAS;GACrB,MAAM,eAAyB,CAAC;GAEhC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;IAC/B,MAAM,OAAO,SAAS;IACtB,MAAM,MAAM,YAAY;IACxB,MAAM,WAAW,MAAM,IAAI,GAAG;IAC9B,MAAM,cAAc,SAAS,SAAS;IAEtC,IAAI,aACF,mBAAmB,UAAU,UAAU,IAAI;IAG7C,IAAI,CAAC,eAAe,SAAS,MAAM,gBACjC,aAAa,KAAK,CAAC;IAGrB,YAAY,KAAK;IACjB,aAAa,KAAK,SAAS,MAAM;GACnC;GAEA,iBAAiB,cAAc,MAAM;GAErC,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,IAAI,IAAI,gBAAgB;IACnE,kBAAkB;GACpB;GAEA,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB;GAC9B,SAAS,kBAAkB;GAE3B,OAAO;EACT;EAEA,IAAI,gBAAgB;EACpB,IAAI,iBAAiB;EACrB,IAAI,mBAA2C;EAC/C,IAAI,oBAA4C;EAChD,IAAI,gBAAgB;EACpB,IAAI,iBAAiB;EAErB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;GAC/B,MAAM,OAAO,SAAS;GACtB,MAAM,MAAM,KAAK,SAAS,IAAI,CAAC;GAC/B,IAAI,QAAQ,YAAY,IAAI;IAC1B,MAAM,WAAW,MAAM,IAAI,GAAG;IAC9B,IAAI,YAAY,SAAS,SAAS,MAAM;KACtC,iBAAiB;KACjB;IACF;IACA;GACF;GAEA;GACA,IAAI,kBAAkB,IAAI;IACxB,gBAAgB;IAChB,mBAAmB;IACnB;GACF;GAEA,IAAI,mBAAmB,IAAI;IACzB,iBAAiB;IACjB,oBAAoB;IACpB;GACF;GAEA,gBAAgB;GAChB;EACF;EAEA,IACE,kBACA,kBAAkB,KAClB,kBAAkB,MAClB,mBAAmB,MACnB,qBAAqB,YAAY,mBACjC,sBAAsB,YAAY,gBAClC;GACA,oBAAoB,MAAM;GAC1B,iBAAiB,WAAW;GAC5B,iBAAiB,WAAW;GAE5B,SAAS,qBAAqB;GAE9B,MAAM,kBAAkB,YAAY,MAAM;GAC1C,gBAAgB,iBAAiB;GACjC,gBAAgB,kBAAkB;GAElC,MAAM,eAAe,SAAS;GAC9B,MAAM,gBAAgB,MAAM,IAAI,gBAAgB;GAChD,MAAM,iBAAiB,MAAM,IAAI,iBAAiB;GAClD,MAAM,YAAY,SAAS;GAC3B,MAAM,aAAa,SAAS;GAC5B,MAAM,mBAAmB,SAAS,aAAa,MAAM;GACrD,iBAAiB,iBAAiB;GAClC,iBAAiB,kBAAkB;GAEnC,iBAAiB,YAAY;GAC7B,iBAAiB,YAAY;GAE7B,IAAI,cAAc,SAAS,WACzB,mBAAmB,UAAU,eAAe,SAAS;GAGvD,IAAI,eAAe,SAAS,YAC1B,mBAAmB,UAAU,gBAAgB,UAAU;GAGzD,iBAAiB,UAAU,eAAe,aAAa;GAEvD,iBAAiB,UAAU,gBAAgB,cAAc;GAEzD,aAAa,iBAAiB,cAAc,MAAM;GAClD,aAAa,kBAAkB,eAAe,MAAM;GAEpD,SAAS,cAAc;GACvB,SAAS,eAAe;GAExB,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,IAAI,IAAI,gBAAgB;IACnE,kBAAkB;GACpB;GAEA,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB,CAAC,eAAe,cAAc;GAC5D,SAAS,kBAAkB;GAE3B,OAAO;EACT;EAEA,IAAI,qBAAqB;EACzB,MAAM,eAAuC,CAAC;EAC9C,MAAM,gBAAsC,CAAC;EAC7C,MAAM,iBAA0B,CAAC;EAEjC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;GAC/B,MAAM,OAAO,SAAS;GACtB,MAAM,MAAM,KAAK,MAAM,CAAC;GACxB,MAAM,WAAW,MAAM,IAAI,GAAG;GAE9B,IACE,CAAC,YACD,SAAS,SAAS,QACjB,SAAS,YAAY,gBAAgB,SAAS,YAAY,KAAK,MAAM,GACtE;IACA,qBAAqB;IACrB;GACF;GAEA,aAAa,KAAK;GAClB,cAAc,KAAK;GACnB,eAAe,KAAK,SAAS,MAAM;GACnC,iBAAiB,YAAY;EAC/B;EAEA,IAAI,oBAAoB;GACtB,oBAAoB,YAAY;GAChC,SAAS,qBAAqB;GAE9B,KAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;IAC7C,iBAAiB,UAAU,cAAc,IAAI,CAAC;IAC9C,eAAe,KAAK,cAAc,EAAE,CAAC,MAAM;GAC7C;GAEA,SAAS,cAAc;GACvB,SAAS,eAAe;GACxB,SAAS,gBAAgB;GAEzB,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,IAAI,IAAI,gBAAgB;IACnE,kBAAkB;GACpB;GAEA,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB;GAC9B,SAAS,kBAAkB;GAE3B,OAAO;EACT;CACF;CAMA,oBAAoB,YAAY;CAChC,SAAS,qBAAqB;CAE9B,MAAM,WAAW,IAAI,IAAI,WAAW;CACpC,MAAM,iBAAyC,CAAC;CAChD,MAAM,kBAAwC,CAAC;CAC/C,MAAM,eAAwB,CAAC;CAC/B,IAAI,WAAW,SAAS,SAAS,SAAS;CAG1C,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,OAAO,SAAS;EACtB,MAAM,MAAM,KAAK,MAAM,CAAC;EACxB,iBAAiB,WAAW;EAE5B,SAAS,OAAO,GAAG;EACnB,eAAe,KAAK,GAAG;EAEvB,MAAM,WAAW,MAAM,IAAI,GAAG;EAC9B,iBAAiB,WAAW,WAAW,SAAS;EAEhD,IAAI,CAAC,UAAU;GAEb,MAAM,eAAe,mBAAmB,KAAK,MAAM,GAAG,QAAQ;GAC9D,MAAM,IAAI,KAAK,YAAY;GAC3B,gBAAgB,KAAK,YAAY;GACjC,aAAa,KAAK,aAAa,MAAM,KAAc;EACrD,OAAO;GAEL,iBAAiB,YAAY;GAC7B,MAAM,cAAc,SAAS,SAAS;GACtC,MAAM,eAAe,SAAS,YAAY,KAAK,MAAM;GAErD,IAAI,aAAa;IACf,WAAW;IACX,mBAAmB,UAAU,UAAU,IAAI;GAC7C;GAEA,IAAI,cAEF,iBAAiB,UAAU,UAAU,CAAC;GAGxC,gBAAgB,KAAK,QAAQ;GAC7B,aAAa,KAAK,SAAS,MAAM,KAAc;EACjD;CACF;CAGA,KAAK,MAAM,OAAO,UAAU;EAC1B,WAAW;EACX,MAAM,eAAe,MAAM,IAAI,GAAG;EAClC,IAAI,cAAc;GAChB,oBAAoB,UAAU,cAAc,MAAM;GAClD,MAAM,OAAO,GAAG;EAClB;CACF;CAEA,SAAS,cAAc;CACvB,SAAS,eAAe;CAGxB,IAAI,qBAAqB;EACvB,kBAAkB,aAAa,YAAY,IAAI,IAAI,gBAAgB;EACnE,kBAAkB;CACpB;CAEA,SAAS,gBAAgB;CACzB,SAAS,sBAAsB;CAC/B,SAAS,qBAAqB;CAC9B,SAAS,kBAAkB;CAE3B,OAAO;AACT;AAEA,SAAgB,iBAAoB,UAAgC;CAClE,IAAI,CAAC,MAAM,QAAQ,SAAS,YAAY,GACtC,MAAM,IAAI,MAAM,sCAAsC;CAGxD,SAAS,wBAAwB;CACjC,OAAO,kBAAkB,UAAU,SAAS,YAAY;AAC1D;AAEA,SAAgB,uBAA0B,UAA6B;CACrE,MAAM,eAAe,SAAS;CAC9B,IAAI,gBAAgB,aAAa,SAAS,GACxC,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;EAC5C,MAAM,eAAe,SAAS,aAAa,aAAa;EACxD,IAAI,cACF,aAAa,MAAM,iBAAiB;CAExC;MAEA,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;EACpD,MAAM,MAAM,SAAS,YAAY;EACjC,MAAM,eAAe,SAAS,MAAM,IAAI,GAAG;EAC3C,IAAI,cACF,aAAa,MAAM,iBAAiB;CAExC;CAGF,IAAI,SAAS,eACX,SAAS,cAAc,iBAAiB;CAE1C,SAAS,mBAAmB,CAAC;CAC7B,SAAS,sBAAsB;CAC/B,SAAS,qBAAqB;CAC9B,SAAS,kBAAkB;CAC3B,SAAS,wBAAwB;CACjC,SAAS,sBAAsB,SAAS,YAAY,SAAS;AAC/D"}

package/dist/runtime/operations.js.map

@@ -1 +1 @@
-{"version":3,"file":"operations.js","names":[],"sources":["../../src/runtime/operations.ts"],"sourcesContent":["import {\n  claimHookIndex,\n  getCurrentComponentInstance,\n  registerCommitOperation,\n  type ComponentInstance,\n} from './component';\nimport { getCurrentContextFrame } from './context';\nimport { ResourceCell } from './resource-cell';\nimport { state } from './state';\nimport { globalScheduler } from './scheduler';\nimport { getSSRBridge } from './ssr-bridge';\nimport { brandSnapshotSource } from './snapshot-source';\nimport { SSRDataMissingError } from '../common/ssr-errors';\nimport { isRouteActivityActive } from '../common/route-activity';\n\nexport interface ResourceResult<T> {\n  value: T | null;\n  pending: boolean;\n  error: Error | null;\n  refresh(): void;\n}\n\nexport type ActivityPredicate = () => boolean;\n\nexport interface TimerOptions {\n  when?: ActivityPredicate | readonly ActivityPredicate[];\n}\n\nfunction normalizePredicates(\n  predicates: TimerOptions['when']\n): readonly ActivityPredicate[] {\n  if (!predicates) {\n    return [];\n  }\n\n  return typeof predicates === 'function' ? [predicates] : predicates;\n}\n\nfunction allPredicatesPass(predicates: readonly ActivityPredicate[]): boolean {\n  for (const predicate of predicates) {\n    if (!predicate()) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\ntype LifecycleSlotKind = 'timer' | 'listener' | 'task';\n\ntype LifecycleSlot = {\n  kind: LifecycleSlotKind;\n};\n\nfunction getLifecycleSlot<TSlot extends LifecycleSlot>(\n  instance: ComponentInstance,\n  index: number,\n  kind: TSlot['kind'],\n  create: () => TSlot\n): TSlot {\n  const existing = instance.lifecycleSlots[index];\n\n  if (existing) {\n    const slot = existing as LifecycleSlot;\n    if (slot.kind !== kind) {\n      throw new Error(\n        `${kind}() lifecycle order violation: slot ${index} already belongs to ${slot.kind}(). ` +\n          'Keep lifecycle primitives in a stable top-level order.'\n      );\n    }\n\n    return existing as TSlot;\n  }\n\n  const slot = create();\n  instance.lifecycleSlots[index] = slot;\n  return slot;\n}\n\nexport function routeActive(\n  pathOrPaths: string | readonly string[]\n): ActivityPredicate {\n  return () => isRouteActivityActive(pathOrPaths);\n}\n\nexport function documentVisible(): ActivityPredicate {\n  return () =>\n    typeof document === 'undefined' || document.visibilityState !== 'hidden';\n}\n\nexport function windowFocused(): ActivityPredicate {\n  return () =>\n    typeof document === 'undefined' ||\n    typeof document.hasFocus !== 'function' ||\n    document.hasFocus();\n}\n\nexport function resource<T, const TDeps extends readonly unknown[]>(\n  fn: (opts: { signal: AbortSignal }) => PromiseLike<T> | T,\n  deps: TDeps\n): ResourceResult<T>;\n\n/**\n * Resource primitive — simple, deterministic async primitive\n * Usage: resource(fn, deps)\n * - fn receives { signal }\n * - captures execution context once at creation (synchronous step only)\n * - executes at most once per generation; stale async results are ignored\n * - refresh() cancels in-flight execution, increments generation and re-runs\n * - exposes { value, pending, error, refresh }\n * - during SSR, async results are disallowed and will throw synchronously\n */\nexport function resource<T>(\n  fn: (opts: { signal: AbortSignal }) => PromiseLike<T> | T,\n  deps: readonly unknown[] = []\n): ResourceResult<T> {\n  const instance = getCurrentComponentInstance();\n  // Create a non-null alias early so it can be used in nested closures\n  // without TypeScript complaining about possible null access.\n  const inst = instance as ComponentInstance;\n\n  if (!instance) {\n    const ssr = getSSRBridge();\n    // If we're in a synchronous SSR render that has resolved data, use it.\n    const renderData = ssr.getCurrentRenderData();\n    if (renderData) {\n      const key = ssr.getNextKey();\n      if (!(key in renderData)) {\n        ssr.throwSSRDataMissing();\n      }\n      const val = renderData[key] as T;\n      return brandSnapshotSource({\n        value: val,\n        pending: false,\n        error: null,\n        refresh: () => {},\n      }) as ResourceResult<T>;\n    }\n\n    // If we are in an SSR render pass without supplied data, throw for clarity.\n    const ssrCtx = ssr.getCurrentSSRContext();\n    if (ssrCtx) {\n      ssr.throwSSRDataMissing();\n    }\n\n    // No active component instance and not in SSR render with data.\n    // Autopilot invariant: resources must be created during render within an app.\n    throw new Error(\n      '[Askr] resource() must be called during component render inside an app. ' +\n        'Do not create resources at module scope or outside render.'\n    );\n  }\n\n  // Internal ResourceCell — pure state machine now moved to its own module\n  // to keep component wiring separate and ensure no component access here.\n  // (See ./resource-cell.ts)\n\n  // If we're in a synchronous SSR render that was supplied resolved data, use it\n  const ssr = getSSRBridge();\n  const renderData = ssr.getCurrentRenderData();\n  if (renderData) {\n    // Deterministic key generation: the collection step and render step use\n    // the same incremental key generation to align resources.\n    const key = ssr.getNextKey();\n    if (!(key in renderData)) {\n      ssr.throwSSRDataMissing();\n    }\n\n    // Commit synchronous value from render data and return a stable snapshot\n    const val = renderData[key] as T;\n\n    const holder = state<{\n      cell?: ResourceCell<T>;\n      snapshot: ResourceResult<T>;\n    }>({\n      cell: undefined,\n      snapshot: brandSnapshotSource({\n        value: val,\n        pending: false,\n        error: null,\n        refresh: () => {},\n      }) as ResourceResult<T>,\n    });\n\n    const h = holder();\n    h.snapshot.value = val;\n    h.snapshot.pending = false;\n    h.snapshot.error = null;\n    return h.snapshot;\n  }\n\n  // Persist a holder so the snapshot identity is stable across renders.\n  const holder = state<{ cell?: ResourceCell<T>; snapshot: ResourceResult<T> }>(\n    {\n      cell: undefined,\n      snapshot: brandSnapshotSource({\n        value: null,\n        pending: true,\n        error: null,\n        refresh: () => {},\n      }) as ResourceResult<T>,\n    }\n  );\n\n  const h = holder();\n\n  // Initialize cell on first call\n  if (!h.cell) {\n    const frame = getCurrentContextFrame();\n    const cell = new ResourceCell<T>(fn, deps, frame);\n    // Attach debug label (component name) for richer logs\n    cell.ownerName = inst.fn?.name || '<anonymous>';\n    h.cell = cell;\n    h.snapshot = cell.snapshot as ResourceResult<T>;\n\n    // Subscribe and schedule component updates when cell changes\n    const unsubscribe = cell.subscribe(() => {\n      const cur = holder();\n      cur.snapshot.value = cell.snapshot.value;\n      cur.snapshot.pending = cell.snapshot.pending;\n      cur.snapshot.error = cell.snapshot.error;\n      holder.set(cur);\n      try {\n        inst.notifyUpdate?.();\n      } catch {\n        // ignore\n      }\n    });\n\n    // Cleanup on unmount\n    (inst.cleanupFns ??= []).push(() => {\n      unsubscribe();\n      cell.dispose();\n    });\n\n    // Render invariant: do NOT start async work during render on the client.\n    // SSR remains strict/synchronous and must throw immediately if async is encountered.\n    if (inst.ssr) {\n      // SSR: must run synchronously so missing data throws during render\n      cell.start(true, false);\n      if (!cell.pending) {\n        const cur = holder();\n        cur.snapshot.value = cell.value;\n        cur.snapshot.pending = cell.pending;\n        cur.snapshot.error = cell.error;\n      }\n    } else {\n      // Client: start after render via scheduler (never inline)\n      const scheduledGeneration = cell.generation;\n      globalScheduler.enqueueInLane('post', () => {\n        if (!inst.notifyUpdate || cell.generation !== scheduledGeneration) {\n          return;\n        }\n\n        try {\n          cell.start(false, false);\n        } catch (err) {\n          // Non-SSR: reflect synchronous errors into snapshot via manual update\n          const cur = holder();\n          cur.snapshot.value = cell.value;\n          cur.snapshot.pending = cell.pending;\n          cur.snapshot.error = (err as Error) ?? null;\n          holder.set(cur);\n          inst.notifyUpdate?.();\n          return;\n        }\n\n        // If the resource completed synchronously, subscribers were not notified.\n        // Force a re-render so the component can observe the value.\n        if (!cell.pending) {\n          const cur = holder();\n          cur.snapshot.value = cell.value;\n          cur.snapshot.pending = cell.pending;\n          cur.snapshot.error = cell.error;\n          holder.set(cur);\n          inst.notifyUpdate?.();\n        }\n      });\n    }\n  }\n\n  const cell = h.cell!;\n  cell.setLoader(fn);\n\n  // Detect dependency changes and refresh immediately\n  const depsChanged =\n    !cell.deps ||\n    cell.deps.length !== deps.length ||\n    cell.deps.some((d, i) => !Object.is(d, deps[i]));\n\n  if (depsChanged) {\n    cell.deps = deps.slice();\n    cell.generation++;\n    cell.pending = true;\n    cell.error = null;\n\n    // Synchronously reflect the pending state into the stable snapshot so the\n    // render that triggered the deps change can surface a loading indicator.\n    // The async start() runs with notify=false and the deps-change branch never\n    // re-published the snapshot, so without this a deps-driven refetch jumped\n    // straight from the old value to the new value, never exposing pending.\n    // Stale-while-revalidate: the previous value is retained until the new\n    // fetch resolves.\n    h.snapshot.pending = true;\n    h.snapshot.error = null;\n    try {\n      if (inst.ssr) {\n        cell.start(true, false);\n        if (!cell.pending) {\n          const cur = holder();\n          cur.snapshot.value = cell.value;\n          cur.snapshot.pending = cell.pending;\n          cur.snapshot.error = cell.error;\n        }\n      } else {\n        const scheduledGeneration = cell.generation;\n        globalScheduler.enqueueInLane('post', () => {\n          if (!inst.notifyUpdate || cell.generation !== scheduledGeneration) {\n            return;\n          }\n\n          cell.start(false, false);\n          if (!cell.pending) {\n            const cur = holder();\n            cur.snapshot.value = cell.value;\n            cur.snapshot.pending = cell.pending;\n            cur.snapshot.error = cell.error;\n            holder.set(cur);\n            inst.notifyUpdate?.();\n          }\n        });\n      }\n    } catch (err) {\n      if (err instanceof SSRDataMissingError) throw err;\n      cell.error = err as Error;\n      cell.pending = false;\n      const cur = holder();\n      cur.snapshot.value = cell.value;\n      cur.snapshot.pending = cell.pending;\n      cur.snapshot.error = cell.error;\n      // Do not call holder.set() here; this is still render.\n    }\n  }\n\n  // Return the stable snapshot object owned by the cell\n  return h.snapshot;\n}\n\ntype ListenerOptions = boolean | AddEventListenerOptions | undefined;\n\ntype NormalizedListenerOptions =\n  | boolean\n  | {\n      capture?: boolean;\n      once?: boolean;\n      passive?: boolean;\n      signal?: AbortSignal;\n    }\n  | undefined;\n\ninterface ListenerSlot extends LifecycleSlot {\n  kind: 'listener';\n  target: EventTarget | null;\n  event: string;\n  handler: EventListener;\n  listener: EventListener;\n  options: NormalizedListenerOptions;\n  pendingTarget: EventTarget;\n  pendingEvent: string;\n  pendingHandler: EventListener;\n  pendingOptions: NormalizedListenerOptions;\n  attached: boolean;\n  cleanupRegistered: boolean;\n}\n\nfunction normalizeListenerOptions(\n  options: ListenerOptions\n): NormalizedListenerOptions {\n  if (options === undefined || typeof options === 'boolean') {\n    return options;\n  }\n\n  return {\n    ...(options.capture !== undefined ? { capture: options.capture } : {}),\n    ...(options.once !== undefined ? { once: options.once } : {}),\n    ...(options.passive !== undefined ? { passive: options.passive } : {}),\n    ...(options.signal !== undefined ? { signal: options.signal } : {}),\n  };\n}\n\nfunction listenerOptionsEqual(\n  a: NormalizedListenerOptions,\n  b: NormalizedListenerOptions\n): boolean {\n  if (a === b) {\n    return true;\n  }\n  if (typeof a === 'boolean' || typeof b === 'boolean') {\n    return a === b;\n  }\n  if (!a || !b) {\n    return a === b;\n  }\n\n  return (\n    a.capture === b.capture &&\n    a.once === b.once &&\n    a.passive === b.passive &&\n    a.signal === b.signal\n  );\n}\n\nfunction detachListenerSlot(slot: ListenerSlot): void {\n  if (!slot.attached || !slot.target) {\n    return;\n  }\n\n  slot.target.removeEventListener(slot.event, slot.listener, slot.options);\n  slot.attached = false;\n}\n\nfunction commitListenerSlot(\n  instance: ComponentInstance,\n  slot: ListenerSlot\n): void {\n  slot.handler = slot.pendingHandler;\n\n  const shouldReattach =\n    !slot.attached ||\n    slot.target !== slot.pendingTarget ||\n    slot.event !== slot.pendingEvent ||\n    !listenerOptionsEqual(slot.options, slot.pendingOptions);\n\n  if (shouldReattach) {\n    detachListenerSlot(slot);\n    slot.target = slot.pendingTarget;\n    slot.event = slot.pendingEvent;\n    slot.options = slot.pendingOptions;\n    slot.target.addEventListener(slot.event, slot.listener, slot.options);\n    slot.attached = true;\n  }\n\n  if (!slot.cleanupRegistered) {\n    slot.cleanupRegistered = true;\n    instance.cleanupFns.push(() => {\n      detachListenerSlot(slot);\n      slot.cleanupRegistered = false;\n    });\n  }\n}\n\nexport function on(\n  target: EventTarget,\n  event: string,\n  handler: EventListener,\n  options?: ListenerOptions\n): void {\n  const instance = getCurrentComponentInstance();\n  if (!instance) {\n    return;\n  }\n\n  const index = claimHookIndex(instance, 'on');\n  const normalizedOptions = normalizeListenerOptions(options);\n  const slot = getLifecycleSlot<ListenerSlot>(\n    instance,\n    index,\n    'listener',\n    () => {\n      const createdSlot = {\n        kind: 'listener' as const,\n        target: null,\n        event,\n        handler,\n        listener: ((evt: Event) => {\n          createdSlot.handler.call(createdSlot.target, evt);\n        }) as EventListener,\n        options: undefined,\n        pendingTarget: target,\n        pendingEvent: event,\n        pendingHandler: handler,\n        pendingOptions: normalizedOptions,\n        attached: false,\n        cleanupRegistered: false,\n      };\n      return createdSlot;\n    }\n  );\n\n  slot.pendingTarget = target;\n  slot.pendingEvent = event;\n  slot.pendingHandler = handler;\n  slot.pendingOptions = normalizedOptions;\n\n  registerCommitOperation(() => {\n    commitListenerSlot(instance, slot);\n  });\n}\n\ninterface TimerSlot extends LifecycleSlot {\n  kind: 'timer';\n  id: ReturnType<typeof setInterval> | null;\n  intervalMs: number | null;\n  pendingIntervalMs: number;\n  callback: () => void;\n  predicates: readonly ActivityPredicate[];\n  pendingCallback: () => void;\n  pendingPredicates: readonly ActivityPredicate[];\n  cleanupRegistered: boolean;\n}\n\nfunction stopTimerSlot(slot: TimerSlot): void {\n  if (slot.id === null) {\n    return;\n  }\n\n  clearInterval(slot.id);\n  slot.id = null;\n}\n\nfunction startTimerSlot(slot: TimerSlot): void {\n  slot.id = setInterval(() => {\n    if (allPredicatesPass(slot.predicates)) {\n      slot.callback();\n    }\n  }, slot.intervalMs ?? slot.pendingIntervalMs);\n}\n\nfunction commitTimerSlot(instance: ComponentInstance, slot: TimerSlot): void {\n  const intervalChanged = slot.intervalMs !== slot.pendingIntervalMs;\n\n  slot.callback = slot.pendingCallback;\n  slot.predicates = slot.pendingPredicates;\n\n  if (slot.id === null || intervalChanged) {\n    stopTimerSlot(slot);\n    slot.intervalMs = slot.pendingIntervalMs;\n    startTimerSlot(slot);\n  }\n\n  if (!slot.cleanupRegistered) {\n    slot.cleanupRegistered = true;\n    instance.cleanupFns.push(() => {\n      stopTimerSlot(slot);\n      slot.cleanupRegistered = false;\n    });\n  }\n}\n\nexport function timer(\n  intervalMs: number,\n  fn: () => void,\n  options?: TimerOptions\n): void {\n  const instance = getCurrentComponentInstance();\n  if (!instance) {\n    return;\n  }\n\n  const index = claimHookIndex(instance, 'timer');\n  const predicates = normalizePredicates(options?.when);\n  const slot = getLifecycleSlot<TimerSlot>(instance, index, 'timer', () => ({\n    kind: 'timer',\n    id: null,\n    intervalMs: null,\n    pendingIntervalMs: intervalMs,\n    callback: fn,\n    predicates,\n    pendingCallback: fn,\n    pendingPredicates: predicates,\n    cleanupRegistered: false,\n  }));\n\n  slot.pendingIntervalMs = intervalMs;\n  slot.pendingCallback = fn;\n  slot.pendingPredicates = predicates;\n\n  registerCommitOperation(() => {\n    commitTimerSlot(instance, slot);\n  });\n}\n\nexport function stream<T>(\n  _source: unknown,\n  _options?: Record<string, unknown>\n): { value: T | null; pending: boolean; error: Error | null } {\n  // Stub implementation: no-op.\n  return { value: null, pending: true, error: null };\n}\n\nexport function task(\n  fn: () => void | (() => void) | PromiseLike<void | (() => void)>\n): void {\n  const instance = getCurrentComponentInstance();\n  if (!instance) {\n    return;\n  }\n\n  const index = claimHookIndex(instance, 'task');\n  const slot = getLifecycleSlot<\n    LifecycleSlot & {\n      kind: 'task';\n      started: boolean;\n      task: typeof fn;\n    }\n  >(instance, index, 'task', () => ({\n    kind: 'task',\n    started: false,\n    task: fn,\n  }));\n\n  if (!slot.started) {\n    slot.task = fn;\n    registerCommitOperation(async () => {\n      if (slot.started) {\n        return;\n      }\n\n      slot.started = true;\n      return await slot.task();\n    });\n  }\n}\n\n/**\n * Capture the result of a synchronous expression at call time and return a\n * thunk that returns the captured value later. This is a low-level helper for\n * cases where async continuations need to observe a snapshot of values at the\n * moment scheduling occurred.\n *\n * Usage (public API):\n * const snapshot = capture(() => someState());\n * Promise.resolve().then(() => { use(snapshot()); });\n */\nexport function capture<T>(fn: () => T): () => T {\n  const value = fn();\n  return () => value;\n}\n"],"mappings":";;;;;;;;;;AA4BA,SAAS,oBACP,YAC8B;CAC9B,IAAI,CAAC,YACH,OAAO,CAAC;CAGV,OAAO,OAAO,eAAe,aAAa,CAAC,UAAU,IAAI;AAC3D;AAEA,SAAS,kBAAkB,YAAmD;CAC5E,KAAK,MAAM,aAAa,YACtB,IAAI,CAAC,UAAU,GACb,OAAO;CAIX,OAAO;AACT;AAQA,SAAS,iBACP,UACA,OACA,MACA,QACO;CACP,MAAM,WAAW,SAAS,eAAe;CAEzC,IAAI,UAAU;EACZ,MAAM,OAAO;EACb,IAAI,KAAK,SAAS,MAChB,MAAM,IAAI,MACR,GAAG,KAAK,qCAAqC,MAAM,sBAAsB,KAAK,KAAK,2DAErF;EAGF,OAAO;CACT;CAEA,MAAM,OAAO,OAAO;CACpB,SAAS,eAAe,SAAS;CACjC,OAAO;AACT;AAEA,SAAgB,YACd,aACmB;CACnB,aAAa,sBAAsB,WAAW;AAChD;AAEA,SAAgB,kBAAqC;CACnD,aACE,OAAO,aAAa,eAAe,SAAS,oBAAoB;AACpE;AAEA,SAAgB,gBAAmC;CACjD,aACE,OAAO,aAAa,eACpB,OAAO,SAAS,aAAa,cAC7B,SAAS,SAAS;AACtB;;;;;;;;;;;AAiBA,SAAgB,SACd,IACA,OAA2B,CAAC,GACT;CACnB,MAAM,WAAW,4BAA4B;CAG7C,MAAM,OAAO;CAEb,IAAI,CAAC,UAAU;EACb,MAAM,MAAM,aAAa;EAEzB,MAAM,aAAa,IAAI,qBAAqB;EAC5C,IAAI,YAAY;GACd,MAAM,MAAM,IAAI,WAAW;GAC3B,IAAI,EAAE,OAAO,aACX,IAAI,oBAAoB;GAE1B,MAAM,MAAM,WAAW;GACvB,OAAO,oBAAoB;IACzB,OAAO;IACP,SAAS;IACT,OAAO;IACP,eAAe,CAAC;GAClB,CAAC;EACH;EAIA,IADe,IAAI,qBACf,GACF,IAAI,oBAAoB;EAK1B,MAAM,IAAI,MACR,oIAEF;CACF;CAOA,MAAM,MAAM,aAAa;CACzB,MAAM,aAAa,IAAI,qBAAqB;CAC5C,IAAI,YAAY;EAGd,MAAM,MAAM,IAAI,WAAW;EAC3B,IAAI,EAAE,OAAO,aACX,IAAI,oBAAoB;EAI1B,MAAM,MAAM,WAAW;EAevB,MAAM,IAbS,MAGZ;GACD,MAAM;GACN,UAAU,oBAAoB;IAC5B,OAAO;IACP,SAAS;IACT,OAAO;IACP,eAAe,CAAC;GAClB,CAAC;EACH,CAEU,EAAO;EACjB,EAAE,SAAS,QAAQ;EACnB,EAAE,SAAS,UAAU;EACrB,EAAE,SAAS,QAAQ;EACnB,OAAO,EAAE;CACX;CAGA,MAAM,SAAS,MACb;EACE,MAAM;EACN,UAAU,oBAAoB;GAC5B,OAAO;GACP,SAAS;GACT,OAAO;GACP,eAAe,CAAC;EAClB,CAAC;CACH,CACF;CAEA,MAAM,IAAI,OAAO;CAGjB,IAAI,CAAC,EAAE,MAAM;EAEX,MAAM,OAAO,IAAI,aAAgB,IAAI,MADvB,uBAC6B,CAAK;EAEhD,KAAK,YAAY,KAAK,IAAI,QAAQ;EAClC,EAAE,OAAO;EACT,EAAE,WAAW,KAAK;EAGlB,MAAM,cAAc,KAAK,gBAAgB;GACvC,MAAM,MAAM,OAAO;GACnB,IAAI,SAAS,QAAQ,KAAK,SAAS;GACnC,IAAI,SAAS,UAAU,KAAK,SAAS;GACrC,IAAI,SAAS,QAAQ,KAAK,SAAS;GACnC,OAAO,IAAI,GAAG;GACd,IAAI;IACF,KAAK,eAAe;GACtB,QAAQ,CAER;EACF,CAAC;EAGD,CAAC,KAAK,eAAe,CAAC,GAAG,WAAW;GAClC,YAAY;GACZ,KAAK,QAAQ;EACf,CAAC;EAID,IAAI,KAAK,KAAK;GAEZ,KAAK,MAAM,MAAM,KAAK;GACtB,IAAI,CAAC,KAAK,SAAS;IACjB,MAAM,MAAM,OAAO;IACnB,IAAI,SAAS,QAAQ,KAAK;IAC1B,IAAI,SAAS,UAAU,KAAK;IAC5B,IAAI,SAAS,QAAQ,KAAK;GAC5B;EACF,OAAO;GAEL,MAAM,sBAAsB,KAAK;GACjC,gBAAgB,cAAc,cAAc;IAC1C,IAAI,CAAC,KAAK,gBAAgB,KAAK,eAAe,qBAC5C;IAGF,IAAI;KACF,KAAK,MAAM,OAAO,KAAK;IACzB,SAAS,KAAK;KAEZ,MAAM,MAAM,OAAO;KACnB,IAAI,SAAS,QAAQ,KAAK;KAC1B,IAAI,SAAS,UAAU,KAAK;KAC5B,IAAI,SAAS,QAAS,OAAiB;KACvC,OAAO,IAAI,GAAG;KACd,KAAK,eAAe;KACpB;IACF;IAIA,IAAI,CAAC,KAAK,SAAS;KACjB,MAAM,MAAM,OAAO;KACnB,IAAI,SAAS,QAAQ,KAAK;KAC1B,IAAI,SAAS,UAAU,KAAK;KAC5B,IAAI,SAAS,QAAQ,KAAK;KAC1B,OAAO,IAAI,GAAG;KACd,KAAK,eAAe;IACtB;GACF,CAAC;EACH;CACF;CAEA,MAAM,OAAO,EAAE;CACf,KAAK,UAAU,EAAE;CAQjB,IAJE,CAAC,KAAK,QACN,KAAK,KAAK,WAAW,KAAK,UAC1B,KAAK,KAAK,MAAM,GAAG,MAAM,CAAC,OAAO,GAAG,GAAG,KAAK,EAAE,CAAC,GAEhC;EACf,KAAK,OAAO,KAAK,MAAM;EACvB,KAAK;EACL,KAAK,UAAU;EACf,KAAK,QAAQ;EASb,EAAE,SAAS,UAAU;EACrB,EAAE,SAAS,QAAQ;EACnB,IAAI;GACF,IAAI,KAAK,KAAK;IACZ,KAAK,MAAM,MAAM,KAAK;IACtB,IAAI,CAAC,KAAK,SAAS;KACjB,MAAM,MAAM,OAAO;KACnB,IAAI,SAAS,QAAQ,KAAK;KAC1B,IAAI,SAAS,UAAU,KAAK;KAC5B,IAAI,SAAS,QAAQ,KAAK;IAC5B;GACF,OAAO;IACL,MAAM,sBAAsB,KAAK;IACjC,gBAAgB,cAAc,cAAc;KAC1C,IAAI,CAAC,KAAK,gBAAgB,KAAK,eAAe,qBAC5C;KAGF,KAAK,MAAM,OAAO,KAAK;KACvB,IAAI,CAAC,KAAK,SAAS;MACjB,MAAM,MAAM,OAAO;MACnB,IAAI,SAAS,QAAQ,KAAK;MAC1B,IAAI,SAAS,UAAU,KAAK;MAC5B,IAAI,SAAS,QAAQ,KAAK;MAC1B,OAAO,IAAI,GAAG;MACd,KAAK,eAAe;KACtB;IACF,CAAC;GACH;EACF,SAAS,KAAK;GACZ,IAAI,eAAe,qBAAqB,MAAM;GAC9C,KAAK,QAAQ;GACb,KAAK,UAAU;GACf,MAAM,MAAM,OAAO;GACnB,IAAI,SAAS,QAAQ,KAAK;GAC1B,IAAI,SAAS,UAAU,KAAK;GAC5B,IAAI,SAAS,QAAQ,KAAK;EAE5B;CACF;CAGA,OAAO,EAAE;AACX;AA6BA,SAAS,yBACP,SAC2B;CAC3B,IAAI,YAAY,UAAa,OAAO,YAAY,WAC9C,OAAO;CAGT,OAAO;EACL,GAAI,QAAQ,YAAY,SAAY,EAAE,SAAS,QAAQ,QAAQ,IAAI,CAAC;EACpE,GAAI,QAAQ,SAAS,SAAY,EAAE,MAAM,QAAQ,KAAK,IAAI,CAAC;EAC3D,GAAI,QAAQ,YAAY,SAAY,EAAE,SAAS,QAAQ,QAAQ,IAAI,CAAC;EACpE,GAAI,QAAQ,WAAW,SAAY,EAAE,QAAQ,QAAQ,OAAO,IAAI,CAAC;CACnE;AACF;AAEA,SAAS,qBACP,GACA,GACS;CACT,IAAI,MAAM,GACR,OAAO;CAET,IAAI,OAAO,MAAM,aAAa,OAAO,MAAM,WACzC,OAAO,MAAM;CAEf,IAAI,CAAC,KAAK,CAAC,GACT,OAAO,MAAM;CAGf,OACE,EAAE,YAAY,EAAE,WAChB,EAAE,SAAS,EAAE,QACb,EAAE,YAAY,EAAE,WAChB,EAAE,WAAW,EAAE;AAEnB;AAEA,SAAS,mBAAmB,MAA0B;CACpD,IAAI,CAAC,KAAK,YAAY,CAAC,KAAK,QAC1B;CAGF,KAAK,OAAO,oBAAoB,KAAK,OAAO,KAAK,UAAU,KAAK,OAAO;CACvE,KAAK,WAAW;AAClB;AAEA,SAAS,mBACP,UACA,MACM;CACN,KAAK,UAAU,KAAK;CAQpB,IALE,CAAC,KAAK,YACN,KAAK,WAAW,KAAK,iBACrB,KAAK,UAAU,KAAK,gBACpB,CAAC,qBAAqB,KAAK,SAAS,KAAK,cAAc,GAErC;EAClB,mBAAmB,IAAI;EACvB,KAAK,SAAS,KAAK;EACnB,KAAK,QAAQ,KAAK;EAClB,KAAK,UAAU,KAAK;EACpB,KAAK,OAAO,iBAAiB,KAAK,OAAO,KAAK,UAAU,KAAK,OAAO;EACpE,KAAK,WAAW;CAClB;CAEA,IAAI,CAAC,KAAK,mBAAmB;EAC3B,KAAK,oBAAoB;EACzB,SAAS,WAAW,WAAW;GAC7B,mBAAmB,IAAI;GACvB,KAAK,oBAAoB;EAC3B,CAAC;CACH;AACF;AAEA,SAAgB,GACd,QACA,OACA,SACA,SACM;CACN,MAAM,WAAW,4BAA4B;CAC7C,IAAI,CAAC,UACH;CAGF,MAAM,QAAQ,eAAe,UAAU,IAAI;CAC3C,MAAM,oBAAoB,yBAAyB,OAAO;CAC1D,MAAM,OAAO,iBACX,UACA,OACA,kBACM;EACJ,MAAM,cAAc;GAClB,MAAM;GACN,QAAQ;GACR;GACA;GACA,YAAY,QAAe;IACzB,YAAY,QAAQ,KAAK,YAAY,QAAQ,GAAG;GAClD;GACA,SAAS;GACT,eAAe;GACf,cAAc;GACd,gBAAgB;GAChB,gBAAgB;GAChB,UAAU;GACV,mBAAmB;EACrB;EACA,OAAO;CACT,CACF;CAEA,KAAK,gBAAgB;CACrB,KAAK,eAAe;CACpB,KAAK,iBAAiB;CACtB,KAAK,iBAAiB;CAEtB,8BAA8B;EAC5B,mBAAmB,UAAU,IAAI;CACnC,CAAC;AACH;AAcA,SAAS,cAAc,MAAuB;CAC5C,IAAI,KAAK,OAAO,MACd;CAGF,cAAc,KAAK,EAAE;CACrB,KAAK,KAAK;AACZ;AAEA,SAAS,eAAe,MAAuB;CAC7C,KAAK,KAAK,kBAAkB;EAC1B,IAAI,kBAAkB,KAAK,UAAU,GACnC,KAAK,SAAS;CAElB,GAAG,KAAK,cAAc,KAAK,iBAAiB;AAC9C;AAEA,SAAS,gBAAgB,UAA6B,MAAuB;CAC3E,MAAM,kBAAkB,KAAK,eAAe,KAAK;CAEjD,KAAK,WAAW,KAAK;CACrB,KAAK,aAAa,KAAK;CAEvB,IAAI,KAAK,OAAO,QAAQ,iBAAiB;EACvC,cAAc,IAAI;EAClB,KAAK,aAAa,KAAK;EACvB,eAAe,IAAI;CACrB;CAEA,IAAI,CAAC,KAAK,mBAAmB;EAC3B,KAAK,oBAAoB;EACzB,SAAS,WAAW,WAAW;GAC7B,cAAc,IAAI;GAClB,KAAK,oBAAoB;EAC3B,CAAC;CACH;AACF;AAEA,SAAgB,MACd,YACA,IACA,SACM;CACN,MAAM,WAAW,4BAA4B;CAC7C,IAAI,CAAC,UACH;CAGF,MAAM,QAAQ,eAAe,UAAU,OAAO;CAC9C,MAAM,aAAa,oBAAoB,SAAS,IAAI;CACpD,MAAM,OAAO,iBAA4B,UAAU,OAAO,gBAAgB;EACxE,MAAM;EACN,IAAI;EACJ,YAAY;EACZ,mBAAmB;EACnB,UAAU;EACV;EACA,iBAAiB;EACjB,mBAAmB;EACnB,mBAAmB;CACrB,EAAE;CAEF,KAAK,oBAAoB;CACzB,KAAK,kBAAkB;CACvB,KAAK,oBAAoB;CAEzB,8BAA8B;EAC5B,gBAAgB,UAAU,IAAI;CAChC,CAAC;AACH;AAEA,SAAgB,OACd,SACA,UAC4D;CAE5D,OAAO;EAAE,OAAO;EAAM,SAAS;EAAM,OAAO;CAAK;AACnD;AAEA,SAAgB,KACd,IACM;CACN,MAAM,WAAW,4BAA4B;CAC7C,IAAI,CAAC,UACH;CAIF,MAAM,OAAO,iBAMX,UAPY,eAAe,UAAU,MAO3B,GAAO,eAAe;EAChC,MAAM;EACN,SAAS;EACT,MAAM;CACR,EAAE;CAEF,IAAI,CAAC,KAAK,SAAS;EACjB,KAAK,OAAO;EACZ,wBAAwB,YAAY;GAClC,IAAI,KAAK,SACP;GAGF,KAAK,UAAU;GACf,OAAO,MAAM,KAAK,KAAK;EACzB,CAAC;CACH;AACF;;;;;;;;;;;AAYA,SAAgB,QAAW,IAAsB;CAC/C,MAAM,QAAQ,GAAG;CACjB,aAAa;AACf"}
+{"version":3,"file":"operations.js","names":[],"sources":["../../src/runtime/operations.ts"],"sourcesContent":["import {\n  claimHookIndex,\n  getCurrentComponentInstance,\n  registerCommitOperation,\n  type ComponentInstance,\n} from './component';\nimport { getCurrentContextFrame } from './context';\nimport { ResourceCell } from './resource-cell';\nimport { state } from './state';\nimport { globalScheduler } from './scheduler';\nimport { getSSRBridge } from './ssr-bridge';\nimport { brandSnapshotSource } from './snapshot-source';\nimport { SSRDataMissingError } from '../common/ssr-errors';\nimport { isRouteActivityActive } from '../common/route-activity';\n\nexport interface ResourceResult<T> {\n  value: T | null;\n  pending: boolean;\n  error: Error | null;\n  refresh(): void;\n}\n\nexport type ActivityPredicate = () => boolean;\n\nexport interface TimerOptions {\n  when?: ActivityPredicate | readonly ActivityPredicate[];\n}\n\nfunction normalizePredicates(\n  predicates: TimerOptions['when']\n): readonly ActivityPredicate[] {\n  if (!predicates) {\n    return [];\n  }\n\n  return typeof predicates === 'function' ? [predicates] : predicates;\n}\n\nfunction allPredicatesPass(predicates: readonly ActivityPredicate[]): boolean {\n  for (const predicate of predicates) {\n    if (!predicate()) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\ntype LifecycleSlotKind = 'timer' | 'listener' | 'task';\n\ntype LifecycleSlot = {\n  kind: LifecycleSlotKind;\n};\n\nfunction getLifecycleSlot<TSlot extends LifecycleSlot>(\n  instance: ComponentInstance,\n  index: number,\n  kind: TSlot['kind'],\n  create: () => TSlot\n): TSlot {\n  const existing = instance.lifecycleSlots[index];\n\n  if (existing) {\n    const slot = existing as LifecycleSlot;\n    if (slot.kind !== kind) {\n      throw new Error(\n        `${kind}() lifecycle order violation: slot ${index} already belongs to ${slot.kind}(). ` +\n          'Keep lifecycle primitives in a stable top-level order.'\n      );\n    }\n\n    return existing as TSlot;\n  }\n\n  const slot = create();\n  instance.lifecycleSlots[index] = slot;\n  return slot;\n}\n\nexport function routeActive(\n  pathOrPaths: string | readonly string[]\n): ActivityPredicate {\n  return () => isRouteActivityActive(pathOrPaths);\n}\n\nexport function documentVisible(): ActivityPredicate {\n  return () =>\n    typeof document === 'undefined' || document.visibilityState !== 'hidden';\n}\n\nexport function windowFocused(): ActivityPredicate {\n  return () =>\n    typeof document === 'undefined' ||\n    typeof document.hasFocus !== 'function' ||\n    document.hasFocus();\n}\n\nexport function resource<T, const TDeps extends readonly unknown[]>(\n  fn: (opts: { signal: AbortSignal }) => PromiseLike<T> | T,\n  deps: TDeps\n): ResourceResult<T>;\n\n/**\n * Resource primitive — simple, deterministic async primitive\n * Usage: resource(fn, deps)\n * - fn receives { signal }\n * - captures execution context once at creation (synchronous step only)\n * - executes at most once per generation; stale async results are ignored\n * - refresh() cancels in-flight execution, increments generation and re-runs\n * - exposes { value, pending, error, refresh }\n * - during SSR, async results are disallowed and will throw synchronously\n */\nexport function resource<T>(\n  fn: (opts: { signal: AbortSignal }) => PromiseLike<T> | T,\n  deps: readonly unknown[] = []\n): ResourceResult<T> {\n  const instance = getCurrentComponentInstance();\n  // Create a non-null alias early so it can be used in nested closures\n  // without TypeScript complaining about possible null access.\n  const inst = instance as ComponentInstance;\n\n  if (!instance) {\n    const ssr = getSSRBridge();\n    // If we're in a synchronous SSR render that has resolved data, use it.\n    const renderData = ssr.getCurrentRenderData();\n    if (renderData) {\n      const key = ssr.getNextKey();\n      if (!(key in renderData)) {\n        ssr.throwSSRDataMissing();\n      }\n      const val = renderData[key] as T;\n      return brandSnapshotSource({\n        value: val,\n        pending: false,\n        error: null,\n        refresh: () => {},\n      }) as ResourceResult<T>;\n    }\n\n    // If we are in an SSR render pass without supplied data, throw for clarity.\n    const ssrCtx = ssr.getCurrentSSRContext();\n    if (ssrCtx) {\n      ssr.throwSSRDataMissing();\n    }\n\n    // No active component instance and not in SSR render with data.\n    // Autopilot invariant: resources must be created during render within an app.\n    throw new Error(\n      '[Askr] resource() must be called during component render inside an app. ' +\n        'Do not create resources at module scope or outside render.'\n    );\n  }\n\n  // Internal ResourceCell — pure state machine now moved to its own module\n  // to keep component wiring separate and ensure no component access here.\n  // (See ./resource-cell.ts)\n\n  // If we're in a synchronous SSR render that was supplied resolved data, use it\n  const ssr = getSSRBridge();\n  const renderData = ssr.getCurrentRenderData();\n  if (renderData) {\n    // Deterministic key generation: the collection step and render step use\n    // the same incremental key generation to align resources.\n    const key = ssr.getNextKey();\n    if (!(key in renderData)) {\n      ssr.throwSSRDataMissing();\n    }\n\n    // Commit synchronous value from render data and return a stable snapshot\n    const val = renderData[key] as T;\n\n    const holder = state<{\n      cell?: ResourceCell<T>;\n      snapshot: ResourceResult<T>;\n    }>({\n      cell: undefined,\n      snapshot: brandSnapshotSource({\n        value: val,\n        pending: false,\n        error: null,\n        refresh: () => {},\n      }) as ResourceResult<T>,\n    });\n\n    const h = holder();\n    h.snapshot.value = val;\n    h.snapshot.pending = false;\n    h.snapshot.error = null;\n    return h.snapshot;\n  }\n\n  // Persist a holder so the snapshot identity is stable across renders.\n  const holder = state<{ cell?: ResourceCell<T>; snapshot: ResourceResult<T> }>(\n    {\n      cell: undefined,\n      snapshot: brandSnapshotSource({\n        value: null,\n        pending: true,\n        error: null,\n        refresh: () => {},\n      }) as ResourceResult<T>,\n    }\n  );\n\n  const h = holder();\n\n  // Initialize cell on first call\n  if (!h.cell) {\n    const frame = getCurrentContextFrame();\n    const cell = new ResourceCell<T>(fn, deps, frame);\n    // Attach debug label (component name) for richer logs\n    cell.ownerName = inst.fn?.name || '<anonymous>';\n    h.cell = cell;\n    h.snapshot = cell.snapshot as ResourceResult<T>;\n\n    // Subscribe and schedule component updates when cell changes\n    const unsubscribe = cell.subscribe(() => {\n      const cur = holder();\n      cur.snapshot.value = cell.snapshot.value;\n      cur.snapshot.pending = cell.snapshot.pending;\n      cur.snapshot.error = cell.snapshot.error;\n      holder.set(cur);\n      try {\n        inst.notifyUpdate?.();\n      } catch {\n        // ignore\n      }\n    });\n\n    // Cleanup on unmount\n    (inst.cleanupFns ??= []).push(() => {\n      unsubscribe();\n      cell.dispose();\n    });\n\n    // Render invariant: do NOT start async work during render on the client.\n    // SSR remains strict/synchronous and must throw immediately if async is encountered.\n    if (inst.ssr) {\n      // SSR: must run synchronously so missing data throws during render\n      cell.start(true, false);\n      if (!cell.pending) {\n        const cur = holder();\n        cur.snapshot.value = cell.value;\n        cur.snapshot.pending = cell.pending;\n        cur.snapshot.error = cell.error;\n      }\n    } else {\n      // Client: start after render via scheduler (never inline)\n      const scheduledGeneration = cell.generation;\n      globalScheduler.enqueueInLane('post', () => {\n        if (!inst.notifyUpdate || cell.generation !== scheduledGeneration) {\n          return;\n        }\n\n        try {\n          cell.start(false, false);\n        } catch (err) {\n          // Non-SSR: reflect synchronous errors into snapshot via manual update\n          const cur = holder();\n          cur.snapshot.value = cell.value;\n          cur.snapshot.pending = cell.pending;\n          cur.snapshot.error = (err as Error) ?? null;\n          holder.set(cur);\n          inst.notifyUpdate?.();\n          return;\n        }\n\n        // If the resource completed synchronously, subscribers were not notified.\n        // Force a re-render so the component can observe the value.\n        if (!cell.pending) {\n          const cur = holder();\n          cur.snapshot.value = cell.value;\n          cur.snapshot.pending = cell.pending;\n          cur.snapshot.error = cell.error;\n          holder.set(cur);\n          inst.notifyUpdate?.();\n        }\n      });\n    }\n  }\n\n  const cell = h.cell!;\n  cell.setLoader(fn);\n\n  // Detect dependency changes and refresh immediately\n  const depsChanged =\n    !cell.deps ||\n    cell.deps.length !== deps.length ||\n    cell.deps.some((d, i) => !Object.is(d, deps[i]));\n\n  if (depsChanged) {\n    cell.deps = deps.slice();\n    cell.generation++;\n    cell.pending = true;\n    cell.error = null;\n\n    // Synchronously reflect the pending state into the stable snapshot so the\n    // render that triggered the deps change can surface a loading indicator.\n    // The async start() runs with notify=false and the deps-change branch never\n    // re-published the snapshot, so without this a deps-driven refetch jumped\n    // straight from the old value to the new value, never exposing pending.\n    // Stale-while-revalidate: the previous value is retained until the new\n    // fetch resolves.\n    h.snapshot.pending = true;\n    h.snapshot.error = null;\n    try {\n      if (inst.ssr) {\n        cell.start(true, false);\n        if (!cell.pending) {\n          const cur = holder();\n          cur.snapshot.value = cell.value;\n          cur.snapshot.pending = cell.pending;\n          cur.snapshot.error = cell.error;\n        }\n      } else {\n        const scheduledGeneration = cell.generation;\n        globalScheduler.enqueueInLane('post', () => {\n          if (!inst.notifyUpdate || cell.generation !== scheduledGeneration) {\n            return;\n          }\n\n          cell.start(false, false);\n          if (!cell.pending) {\n            const cur = holder();\n            cur.snapshot.value = cell.value;\n            cur.snapshot.pending = cell.pending;\n            cur.snapshot.error = cell.error;\n            holder.set(cur);\n            inst.notifyUpdate?.();\n          }\n        });\n      }\n    } catch (err) {\n      if (err instanceof SSRDataMissingError) throw err;\n      cell.error = err as Error;\n      cell.pending = false;\n      const cur = holder();\n      cur.snapshot.value = cell.value;\n      cur.snapshot.pending = cell.pending;\n      cur.snapshot.error = cell.error;\n      // Do not call holder.set() here; this is still render.\n    }\n  }\n\n  // Return the stable snapshot object owned by the cell\n  return h.snapshot;\n}\n\ntype ListenerOptions = boolean | AddEventListenerOptions | undefined;\n\ntype NormalizedListenerOptions =\n  | boolean\n  | {\n      capture?: boolean;\n      once?: boolean;\n      passive?: boolean;\n      signal?: AbortSignal;\n    }\n  | undefined;\n\ninterface ListenerSlot extends LifecycleSlot {\n  kind: 'listener';\n  target: EventTarget | null;\n  event: string;\n  handler: EventListener;\n  listener: EventListener;\n  options: NormalizedListenerOptions;\n  pendingTarget: EventTarget;\n  pendingEvent: string;\n  pendingHandler: EventListener;\n  pendingOptions: NormalizedListenerOptions;\n  attached: boolean;\n  cleanupRegistered: boolean;\n}\n\nfunction normalizeListenerOptions(\n  options: ListenerOptions\n): NormalizedListenerOptions {\n  if (options === undefined || typeof options === 'boolean') {\n    return options;\n  }\n\n  return {\n    ...(options.capture !== undefined ? { capture: options.capture } : {}),\n    ...(options.once !== undefined ? { once: options.once } : {}),\n    ...(options.passive !== undefined ? { passive: options.passive } : {}),\n    ...(options.signal !== undefined ? { signal: options.signal } : {}),\n  };\n}\n\nfunction listenerOptionsEqual(\n  a: NormalizedListenerOptions,\n  b: NormalizedListenerOptions\n): boolean {\n  if (a === b) {\n    return true;\n  }\n  if (typeof a === 'boolean' || typeof b === 'boolean') {\n    return a === b;\n  }\n  if (!a || !b) {\n    return a === b;\n  }\n\n  return (\n    a.capture === b.capture &&\n    a.once === b.once &&\n    a.passive === b.passive &&\n    a.signal === b.signal\n  );\n}\n\nfunction detachListenerSlot(slot: ListenerSlot): void {\n  if (!slot.attached || !slot.target) {\n    return;\n  }\n\n  slot.target.removeEventListener(slot.event, slot.listener, slot.options);\n  slot.attached = false;\n}\n\nfunction commitListenerSlot(\n  instance: ComponentInstance,\n  slot: ListenerSlot\n): void {\n  slot.handler = slot.pendingHandler;\n\n  const shouldReattach =\n    !slot.attached ||\n    slot.target !== slot.pendingTarget ||\n    slot.event !== slot.pendingEvent ||\n    !listenerOptionsEqual(slot.options, slot.pendingOptions);\n\n  if (shouldReattach) {\n    detachListenerSlot(slot);\n    slot.target = slot.pendingTarget;\n    slot.event = slot.pendingEvent;\n    slot.options = slot.pendingOptions;\n    slot.target.addEventListener(slot.event, slot.listener, slot.options);\n    slot.attached = true;\n  }\n\n  if (!slot.cleanupRegistered) {\n    slot.cleanupRegistered = true;\n    instance.cleanupFns.push(() => {\n      detachListenerSlot(slot);\n      slot.cleanupRegistered = false;\n    });\n  }\n}\n\nexport function on(\n  target: EventTarget,\n  event: string,\n  handler: EventListener,\n  options?: ListenerOptions\n): void {\n  const instance = getCurrentComponentInstance();\n  if (!instance) {\n    return;\n  }\n\n  const index = claimHookIndex(instance, 'on');\n  const normalizedOptions = normalizeListenerOptions(options);\n  const slot = getLifecycleSlot<ListenerSlot>(\n    instance,\n    index,\n    'listener',\n    () => {\n      const createdSlot = {\n        kind: 'listener' as const,\n        target: null,\n        event,\n        handler,\n        listener: ((evt: Event) => {\n          createdSlot.handler.call(createdSlot.target, evt);\n        }) as EventListener,\n        options: undefined,\n        pendingTarget: target,\n        pendingEvent: event,\n        pendingHandler: handler,\n        pendingOptions: normalizedOptions,\n        attached: false,\n        cleanupRegistered: false,\n      };\n      return createdSlot;\n    }\n  );\n\n  slot.pendingTarget = target;\n  slot.pendingEvent = event;\n  slot.pendingHandler = handler;\n  slot.pendingOptions = normalizedOptions;\n\n  registerCommitOperation(() => {\n    commitListenerSlot(instance, slot);\n  });\n}\n\ninterface TimerSlot extends LifecycleSlot {\n  kind: 'timer';\n  id: ReturnType<typeof setInterval> | null;\n  intervalMs: number | null;\n  pendingIntervalMs: number;\n  callback: () => void;\n  predicates: readonly ActivityPredicate[];\n  pendingCallback: () => void;\n  pendingPredicates: readonly ActivityPredicate[];\n  cleanupRegistered: boolean;\n}\n\nfunction stopTimerSlot(slot: TimerSlot): void {\n  if (slot.id === null) {\n    return;\n  }\n\n  clearInterval(slot.id);\n  slot.id = null;\n}\n\nfunction startTimerSlot(slot: TimerSlot): void {\n  slot.id = setInterval(() => {\n    if (allPredicatesPass(slot.predicates)) {\n      slot.callback();\n    }\n  }, slot.intervalMs ?? slot.pendingIntervalMs);\n}\n\nfunction commitTimerSlot(instance: ComponentInstance, slot: TimerSlot): void {\n  const intervalChanged = slot.intervalMs !== slot.pendingIntervalMs;\n\n  slot.callback = slot.pendingCallback;\n  slot.predicates = slot.pendingPredicates;\n\n  if (slot.id === null || intervalChanged) {\n    stopTimerSlot(slot);\n    slot.intervalMs = slot.pendingIntervalMs;\n    startTimerSlot(slot);\n  }\n\n  if (!slot.cleanupRegistered) {\n    slot.cleanupRegistered = true;\n    instance.cleanupFns.push(() => {\n      stopTimerSlot(slot);\n      slot.cleanupRegistered = false;\n    });\n  }\n}\n\nexport function timer(\n  intervalMs: number,\n  fn: () => void,\n  options?: TimerOptions\n): void {\n  const instance = getCurrentComponentInstance();\n  if (!instance) {\n    return;\n  }\n\n  const index = claimHookIndex(instance, 'timer');\n  const predicates = normalizePredicates(options?.when);\n  const slot = getLifecycleSlot<TimerSlot>(instance, index, 'timer', () => ({\n    kind: 'timer',\n    id: null,\n    intervalMs: null,\n    pendingIntervalMs: intervalMs,\n    callback: fn,\n    predicates,\n    pendingCallback: fn,\n    pendingPredicates: predicates,\n    cleanupRegistered: false,\n  }));\n\n  slot.pendingIntervalMs = intervalMs;\n  slot.pendingCallback = fn;\n  slot.pendingPredicates = predicates;\n\n  registerCommitOperation(() => {\n    commitTimerSlot(instance, slot);\n  });\n}\n\nexport function stream<T>(\n  _source: unknown,\n  _options?: Record<string, unknown>\n): { value: T | null; pending: boolean; error: Error | null } {\n  // Stub implementation: no-op.\n  return { value: null, pending: true, error: null };\n}\n\nexport function task(\n  fn: () => void | (() => void) | PromiseLike<void | (() => void)>\n): void {\n  const instance = getCurrentComponentInstance();\n  if (!instance) {\n    return;\n  }\n\n  const index = claimHookIndex(instance, 'task');\n  const slot = getLifecycleSlot<\n    LifecycleSlot & {\n      kind: 'task';\n      started: boolean;\n      task: typeof fn;\n    }\n  >(instance, index, 'task', () => ({\n    kind: 'task',\n    started: false,\n    task: fn,\n  }));\n\n  if (!slot.started) {\n    slot.task = fn;\n    registerCommitOperation(async () => {\n      if (slot.started) {\n        return;\n      }\n\n      slot.started = true;\n      return await slot.task();\n    });\n  }\n}\n\n/**\n * Capture the result of a synchronous expression at call time and return a\n * thunk that returns the captured value later. This is a low-level helper for\n * cases where async continuations need to observe a snapshot of values at the\n * moment scheduling occurred.\n *\n * Usage (public API):\n * const snapshot = capture(() => someState());\n * Promise.resolve().then(() => { use(snapshot()); });\n */\nexport function capture<T>(fn: () => T): () => T {\n  const value = fn();\n  return () => value;\n}\n"],"mappings":";;;;;;;;;;AA4BA,SAAS,oBACP,YAC8B;CAC9B,IAAI,CAAC,YACH,OAAO,CAAC;CAGV,OAAO,OAAO,eAAe,aAAa,CAAC,UAAU,IAAI;AAC3D;AAEA,SAAS,kBAAkB,YAAmD;CAC5E,KAAK,MAAM,aAAa,YACtB,IAAI,CAAC,UAAU,GACb,OAAO;CAIX,OAAO;AACT;AAQA,SAAS,iBACP,UACA,OACA,MACA,QACO;CACP,MAAM,WAAW,SAAS,eAAe;CAEzC,IAAI,UAAU;EACZ,MAAM,OAAO;EACb,IAAI,KAAK,SAAS,MAChB,MAAM,IAAI,MACR,GAAG,KAAK,qCAAqC,MAAM,sBAAsB,KAAK,KAAK,2DAErF;EAGF,OAAO;CACT;CAEA,MAAM,OAAO,OAAO;CACpB,SAAS,eAAe,SAAS;CACjC,OAAO;AACT;AAEA,SAAgB,YACd,aACmB;CACnB,aAAa,sBAAsB,WAAW;AAChD;AAEA,SAAgB,kBAAqC;CACnD,aACE,OAAO,aAAa,eAAe,SAAS,oBAAoB;AACpE;AAEA,SAAgB,gBAAmC;CACjD,aACE,OAAO,aAAa,eACpB,OAAO,SAAS,aAAa,cAC7B,SAAS,SAAS;AACtB;;;;;;;;;;;AAiBA,SAAgB,SACd,IACA,OAA2B,CAAC,GACT;CACnB,MAAM,WAAW,4BAA4B;CAG7C,MAAM,OAAO;CAEb,IAAI,CAAC,UAAU;EACb,MAAM,MAAM,aAAa;EAEzB,MAAM,aAAa,IAAI,qBAAqB;EAC5C,IAAI,YAAY;GACd,MAAM,MAAM,IAAI,WAAW;GAC3B,IAAI,EAAE,OAAO,aACX,IAAI,oBAAoB;GAE1B,MAAM,MAAM,WAAW;GACvB,OAAO,oBAAoB;IACzB,OAAO;IACP,SAAS;IACT,OAAO;IACP,eAAe,CAAC;GAClB,CAAC;EACH;EAIA,IADe,IAAI,qBACf,GACF,IAAI,oBAAoB;EAK1B,MAAM,IAAI,MACR,oIAEF;CACF;CAOA,MAAM,MAAM,aAAa;CACzB,MAAM,aAAa,IAAI,qBAAqB;CAC5C,IAAI,YAAY;EAGd,MAAM,MAAM,IAAI,WAAW;EAC3B,IAAI,EAAE,OAAO,aACX,IAAI,oBAAoB;EAI1B,MAAM,MAAM,WAAW;EAevB,MAAM,IAbS,MAGZ;GACD,MAAM;GACN,UAAU,oBAAoB;IAC5B,OAAO;IACP,SAAS;IACT,OAAO;IACP,eAAe,CAAC;GAClB,CAAC;EACH,CAEU,CAAA,CAAO;EACjB,EAAE,SAAS,QAAQ;EACnB,EAAE,SAAS,UAAU;EACrB,EAAE,SAAS,QAAQ;EACnB,OAAO,EAAE;CACX;CAGA,MAAM,SAAS,MACb;EACE,MAAM;EACN,UAAU,oBAAoB;GAC5B,OAAO;GACP,SAAS;GACT,OAAO;GACP,eAAe,CAAC;EAClB,CAAC;CACH,CACF;CAEA,MAAM,IAAI,OAAO;CAGjB,IAAI,CAAC,EAAE,MAAM;EAEX,MAAM,OAAO,IAAI,aAAgB,IAAI,MADvB,uBAC6B,CAAK;EAEhD,KAAK,YAAY,KAAK,IAAI,QAAQ;EAClC,EAAE,OAAO;EACT,EAAE,WAAW,KAAK;EAGlB,MAAM,cAAc,KAAK,gBAAgB;GACvC,MAAM,MAAM,OAAO;GACnB,IAAI,SAAS,QAAQ,KAAK,SAAS;GACnC,IAAI,SAAS,UAAU,KAAK,SAAS;GACrC,IAAI,SAAS,QAAQ,KAAK,SAAS;GACnC,OAAO,IAAI,GAAG;GACd,IAAI;IACF,KAAK,eAAe;GACtB,QAAQ,CAER;EACF,CAAC;EAGD,CAAC,KAAK,eAAe,CAAC,EAAA,CAAG,WAAW;GAClC,YAAY;GACZ,KAAK,QAAQ;EACf,CAAC;EAID,IAAI,KAAK,KAAK;GAEZ,KAAK,MAAM,MAAM,KAAK;GACtB,IAAI,CAAC,KAAK,SAAS;IACjB,MAAM,MAAM,OAAO;IACnB,IAAI,SAAS,QAAQ,KAAK;IAC1B,IAAI,SAAS,UAAU,KAAK;IAC5B,IAAI,SAAS,QAAQ,KAAK;GAC5B;EACF,OAAO;GAEL,MAAM,sBAAsB,KAAK;GACjC,gBAAgB,cAAc,cAAc;IAC1C,IAAI,CAAC,KAAK,gBAAgB,KAAK,eAAe,qBAC5C;IAGF,IAAI;KACF,KAAK,MAAM,OAAO,KAAK;IACzB,SAAS,KAAK;KAEZ,MAAM,MAAM,OAAO;KACnB,IAAI,SAAS,QAAQ,KAAK;KAC1B,IAAI,SAAS,UAAU,KAAK;KAC5B,IAAI,SAAS,QAAS,OAAiB;KACvC,OAAO,IAAI,GAAG;KACd,KAAK,eAAe;KACpB;IACF;IAIA,IAAI,CAAC,KAAK,SAAS;KACjB,MAAM,MAAM,OAAO;KACnB,IAAI,SAAS,QAAQ,KAAK;KAC1B,IAAI,SAAS,UAAU,KAAK;KAC5B,IAAI,SAAS,QAAQ,KAAK;KAC1B,OAAO,IAAI,GAAG;KACd,KAAK,eAAe;IACtB;GACF,CAAC;EACH;CACF;CAEA,MAAM,OAAO,EAAE;CACf,KAAK,UAAU,EAAE;CAQjB,IAJE,CAAC,KAAK,QACN,KAAK,KAAK,WAAW,KAAK,UAC1B,KAAK,KAAK,MAAM,GAAG,MAAM,CAAC,OAAO,GAAG,GAAG,KAAK,EAAE,CAAC,GAEhC;EACf,KAAK,OAAO,KAAK,MAAM;EACvB,KAAK;EACL,KAAK,UAAU;EACf,KAAK,QAAQ;EASb,EAAE,SAAS,UAAU;EACrB,EAAE,SAAS,QAAQ;EACnB,IAAI;GACF,IAAI,KAAK,KAAK;IACZ,KAAK,MAAM,MAAM,KAAK;IACtB,IAAI,CAAC,KAAK,SAAS;KACjB,MAAM,MAAM,OAAO;KACnB,IAAI,SAAS,QAAQ,KAAK;KAC1B,IAAI,SAAS,UAAU,KAAK;KAC5B,IAAI,SAAS,QAAQ,KAAK;IAC5B;GACF,OAAO;IACL,MAAM,sBAAsB,KAAK;IACjC,gBAAgB,cAAc,cAAc;KAC1C,IAAI,CAAC,KAAK,gBAAgB,KAAK,eAAe,qBAC5C;KAGF,KAAK,MAAM,OAAO,KAAK;KACvB,IAAI,CAAC,KAAK,SAAS;MACjB,MAAM,MAAM,OAAO;MACnB,IAAI,SAAS,QAAQ,KAAK;MAC1B,IAAI,SAAS,UAAU,KAAK;MAC5B,IAAI,SAAS,QAAQ,KAAK;MAC1B,OAAO,IAAI,GAAG;MACd,KAAK,eAAe;KACtB;IACF,CAAC;GACH;EACF,SAAS,KAAK;GACZ,IAAI,eAAe,qBAAqB,MAAM;GAC9C,KAAK,QAAQ;GACb,KAAK,UAAU;GACf,MAAM,MAAM,OAAO;GACnB,IAAI,SAAS,QAAQ,KAAK;GAC1B,IAAI,SAAS,UAAU,KAAK;GAC5B,IAAI,SAAS,QAAQ,KAAK;EAE5B;CACF;CAGA,OAAO,EAAE;AACX;AA6BA,SAAS,yBACP,SAC2B;CAC3B,IAAI,YAAY,UAAa,OAAO,YAAY,WAC9C,OAAO;CAGT,OAAO;EACL,GAAI,QAAQ,YAAY,SAAY,EAAE,SAAS,QAAQ,QAAQ,IAAI,CAAC;EACpE,GAAI,QAAQ,SAAS,SAAY,EAAE,MAAM,QAAQ,KAAK,IAAI,CAAC;EAC3D,GAAI,QAAQ,YAAY,SAAY,EAAE,SAAS,QAAQ,QAAQ,IAAI,CAAC;EACpE,GAAI,QAAQ,WAAW,SAAY,EAAE,QAAQ,QAAQ,OAAO,IAAI,CAAC;CACnE;AACF;AAEA,SAAS,qBACP,GACA,GACS;CACT,IAAI,MAAM,GACR,OAAO;CAET,IAAI,OAAO,MAAM,aAAa,OAAO,MAAM,WACzC,OAAO,MAAM;CAEf,IAAI,CAAC,KAAK,CAAC,GACT,OAAO,MAAM;CAGf,OACE,EAAE,YAAY,EAAE,WAChB,EAAE,SAAS,EAAE,QACb,EAAE,YAAY,EAAE,WAChB,EAAE,WAAW,EAAE;AAEnB;AAEA,SAAS,mBAAmB,MAA0B;CACpD,IAAI,CAAC,KAAK,YAAY,CAAC,KAAK,QAC1B;CAGF,KAAK,OAAO,oBAAoB,KAAK,OAAO,KAAK,UAAU,KAAK,OAAO;CACvE,KAAK,WAAW;AAClB;AAEA,SAAS,mBACP,UACA,MACM;CACN,KAAK,UAAU,KAAK;CAQpB,IALE,CAAC,KAAK,YACN,KAAK,WAAW,KAAK,iBACrB,KAAK,UAAU,KAAK,gBACpB,CAAC,qBAAqB,KAAK,SAAS,KAAK,cAAc,GAErC;EAClB,mBAAmB,IAAI;EACvB,KAAK,SAAS,KAAK;EACnB,KAAK,QAAQ,KAAK;EAClB,KAAK,UAAU,KAAK;EACpB,KAAK,OAAO,iBAAiB,KAAK,OAAO,KAAK,UAAU,KAAK,OAAO;EACpE,KAAK,WAAW;CAClB;CAEA,IAAI,CAAC,KAAK,mBAAmB;EAC3B,KAAK,oBAAoB;EACzB,SAAS,WAAW,WAAW;GAC7B,mBAAmB,IAAI;GACvB,KAAK,oBAAoB;EAC3B,CAAC;CACH;AACF;AAEA,SAAgB,GACd,QACA,OACA,SACA,SACM;CACN,MAAM,WAAW,4BAA4B;CAC7C,IAAI,CAAC,UACH;CAGF,MAAM,QAAQ,eAAe,UAAU,IAAI;CAC3C,MAAM,oBAAoB,yBAAyB,OAAO;CAC1D,MAAM,OAAO,iBACX,UACA,OACA,kBACM;EACJ,MAAM,cAAc;GAClB,MAAM;GACN,QAAQ;GACR;GACA;GACA,YAAY,QAAe;IACzB,YAAY,QAAQ,KAAK,YAAY,QAAQ,GAAG;GAClD;GACA,SAAS;GACT,eAAe;GACf,cAAc;GACd,gBAAgB;GAChB,gBAAgB;GAChB,UAAU;GACV,mBAAmB;EACrB;EACA,OAAO;CACT,CACF;CAEA,KAAK,gBAAgB;CACrB,KAAK,eAAe;CACpB,KAAK,iBAAiB;CACtB,KAAK,iBAAiB;CAEtB,8BAA8B;EAC5B,mBAAmB,UAAU,IAAI;CACnC,CAAC;AACH;AAcA,SAAS,cAAc,MAAuB;CAC5C,IAAI,KAAK,OAAO,MACd;CAGF,cAAc,KAAK,EAAE;CACrB,KAAK,KAAK;AACZ;AAEA,SAAS,eAAe,MAAuB;CAC7C,KAAK,KAAK,kBAAkB;EAC1B,IAAI,kBAAkB,KAAK,UAAU,GACnC,KAAK,SAAS;CAElB,GAAG,KAAK,cAAc,KAAK,iBAAiB;AAC9C;AAEA,SAAS,gBAAgB,UAA6B,MAAuB;CAC3E,MAAM,kBAAkB,KAAK,eAAe,KAAK;CAEjD,KAAK,WAAW,KAAK;CACrB,KAAK,aAAa,KAAK;CAEvB,IAAI,KAAK,OAAO,QAAQ,iBAAiB;EACvC,cAAc,IAAI;EAClB,KAAK,aAAa,KAAK;EACvB,eAAe,IAAI;CACrB;CAEA,IAAI,CAAC,KAAK,mBAAmB;EAC3B,KAAK,oBAAoB;EACzB,SAAS,WAAW,WAAW;GAC7B,cAAc,IAAI;GAClB,KAAK,oBAAoB;EAC3B,CAAC;CACH;AACF;AAEA,SAAgB,MACd,YACA,IACA,SACM;CACN,MAAM,WAAW,4BAA4B;CAC7C,IAAI,CAAC,UACH;CAGF,MAAM,QAAQ,eAAe,UAAU,OAAO;CAC9C,MAAM,aAAa,oBAAoB,SAAS,IAAI;CACpD,MAAM,OAAO,iBAA4B,UAAU,OAAO,gBAAgB;EACxE,MAAM;EACN,IAAI;EACJ,YAAY;EACZ,mBAAmB;EACnB,UAAU;EACV;EACA,iBAAiB;EACjB,mBAAmB;EACnB,mBAAmB;CACrB,EAAE;CAEF,KAAK,oBAAoB;CACzB,KAAK,kBAAkB;CACvB,KAAK,oBAAoB;CAEzB,8BAA8B;EAC5B,gBAAgB,UAAU,IAAI;CAChC,CAAC;AACH;AAEA,SAAgB,OACd,SACA,UAC4D;CAE5D,OAAO;EAAE,OAAO;EAAM,SAAS;EAAM,OAAO;CAAK;AACnD;AAEA,SAAgB,KACd,IACM;CACN,MAAM,WAAW,4BAA4B;CAC7C,IAAI,CAAC,UACH;CAIF,MAAM,OAAO,iBAMX,UAPY,eAAe,UAAU,MAO3B,GAAO,eAAe;EAChC,MAAM;EACN,SAAS;EACT,MAAM;CACR,EAAE;CAEF,IAAI,CAAC,KAAK,SAAS;EACjB,KAAK,OAAO;EACZ,wBAAwB,YAAY;GAClC,IAAI,KAAK,SACP;GAGF,KAAK,UAAU;GACf,OAAO,MAAM,KAAK,KAAK;EACzB,CAAC;CACH;AACF;;;;;;;;;;;AAYA,SAAgB,QAAW,IAAsB;CAC/C,MAAM,QAAQ,GAAG;CACjB,aAAa;AACf"}

package/dist/runtime/readable.d.ts

@@ -11,12 +11,13 @@ interface ReadableSource<T = unknown> {
   _hasEverBeenRead?: boolean;
   _readers?: Map<ComponentInstance, number>;
   _derivedSubscribers?: Set<DerivedSubscriber>;
+  _version?: number;
 }
 declare function markReadableUsage(source: unknown): void;
 declare function recordReadableRead(source: ReadableSource<unknown>): void;
 declare function withFineGrainedReadTracking<T>(pendingSources: Set<ReadableSource<unknown>>, fn: () => T): T;
 declare function finalizeReadableSubscriptions(instance: ComponentInstance): void;
-declare function finalizeReadableSubscriptionsFromSnapshot(instance: ComponentInstance, token: number | undefined, newSet: Set<ReadableSource<unknown>> | undefined): void;
+declare function finalizeReadableSubscriptionsFromSnapshot(instance: ComponentInstance, token: number | undefined, newSet: Set<ReadableSource<unknown>> | undefined, pendingReadSourceVersions?: Map<ReadableSource<unknown>, number> | undefined): void;
 declare function cleanupReadableSubscriptions(instance: ComponentInstance): void;
 declare function withDerivedReadTracking<T>(subscriber: DerivedSubscriber, fn: () => T): T;
 declare function syncDerivedDependencySubscriptions(subscriber: DerivedSubscriber, prevSources: Set<ReadableSource<unknown>>, nextSources: Set<ReadableSource<unknown>>): void;

package/dist/runtime/readable.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"readable.d.ts","names":[],"sources":["../../src/runtime/readable.ts"],"mappings":";;;UAGiB,iBAAA;EACf,UAAA;EACA,yBAAA,GAA4B,GAAG,CAAC,cAAA;AAAA;AAAA,UAGjB,cAAA;EAAA,IACX,CAAA;EACJ,YAAA;EACA,gBAAA;EACA,QAAA,GAAW,GAAA,CAAI,iBAAA;EACf,mBAAA,GAAsB,GAAA,CAAI,iBAAA;AAAA;AAAA,iBAGZ,iBAAA,CAAkB,MAAe;AAAA,iBAoBjC,kBAAA,CAAmB,MAA+B,EAAvB,cAAc;AAAA,iBA8BzC,2BAAA,IACd,cAAA,EAAgB,GAAA,CAAI,cAAA,YACpB,EAAA,QAAU,CAAA,GACT,CAAA;AAAA,iBAWa,6BAAA,CACd,QAA2B,EAAjB,iBAAiB;AAAA,iBAUb,yCAAA,CACd,QAAA,EAAU,iBAAA,EACV,KAAA,sBACA,MAAA,EAAQ,GAAA,CAAI,cAAA;AAAA,iBAgCE,4BAAA,CACd,QAA2B,EAAjB,iBAAiB;AAAA,iBAab,uBAAA,IACd,UAAA,EAAY,iBAAA,EACZ,EAAA,QAAU,CAAA,GACT,CAAA;AAAA,iBAaa,kCAAA,CACd,UAAA,EAAY,iBAAA,EACZ,WAAA,EAAa,GAAA,CAAI,cAAA,YACjB,WAAA,EAAa,GAAA,CAAI,cAAA;AAAA,iBAkBH,mCAAA,CACd,UAAA,EAAY,iBAAA,EACZ,OAAA,EAAS,GAAA,CAAI,cAAA;AAAA,iBAQC,mCAAA,CACd,MAA+B,EAAvB,cAAc;AAAA,iBAYR,4BAAA,CACd,MAA+B,EAAvB,cAAc;AAAA,iBAaR,qBAAA,CACd,MAAA,EAAQ,cAAA,WACR,YAAA,GAAe,iBAAiB"}
+{"version":3,"file":"readable.d.ts","names":[],"sources":["../../src/runtime/readable.ts"],"mappings":";;;UAGiB,iBAAA;EACf,UAAA;EACA,yBAAA,GAA4B,GAAG,CAAC,cAAA;AAAA;AAAA,UAGjB,cAAA;EAAA,IACX,CAAA;EACJ,YAAA;EACA,gBAAA;EACA,QAAA,GAAW,GAAA,CAAI,iBAAA;EACf,mBAAA,GAAsB,GAAA,CAAI,iBAAA;EAC1B,QAAA;AAAA;AAAA,iBAGc,iBAAA,CAAkB,MAAe;AAAA,iBAsCjC,kBAAA,CAAmB,MAA+B,EAAvB,cAAc;AAAA,iBAsCzC,2BAAA,IACd,cAAA,EAAgB,GAAA,CAAI,cAAA,YACpB,EAAA,QAAU,CAAA,GACT,CAAA;AAAA,iBAWa,6BAAA,CACd,QAA2B,EAAjB,iBAAiB;AAAA,iBAiBb,yCAAA,CACd,QAAA,EAAU,iBAAA,EACV,KAAA,sBACA,MAAA,EAAQ,GAAA,CAAI,cAAA,wBACZ,yBAAA,GACI,GAAA,CAAI,cAAA;AAAA,iBAkDM,4BAAA,CACd,QAA2B,EAAjB,iBAAiB;AAAA,iBAiBb,uBAAA,IACd,UAAA,EAAY,iBAAA,EACZ,EAAA,QAAU,CAAA,GACT,CAAA;AAAA,iBAaa,kCAAA,CACd,UAAA,EAAY,iBAAA,EACZ,WAAA,EAAa,GAAA,CAAI,cAAA,YACjB,WAAA,EAAa,GAAA,CAAI,cAAA;AAAA,iBAkBH,mCAAA,CACd,UAAA,EAAY,iBAAA,EACZ,OAAA,EAAS,GAAA,CAAI,cAAA;AAAA,iBAQC,mCAAA,CACd,MAA+B,EAAvB,cAAc;AAAA,iBAYR,4BAAA,CACd,MAA+B,EAAvB,cAAc;AAAA,iBAaR,qBAAA,CACd,MAAA,EAAQ,cAAA,WACR,YAAA,GAAe,iBAAiB"}

package/dist/runtime/readable.js

@@ -11,6 +11,19 @@ function markReadableUsage(source) {
 let currentDerivedSubscriber = null;
 let suppressComponentReadTrackingDepth = 0;
 let currentFineGrainedReadSources = null;
+function scheduleReadableInstanceUpdate(instance) {
+	if (instance.hasPendingUpdate) return;
+	instance.hasPendingUpdate = true;
+	const task = instance._pendingFlushTask;
+	if (task) {
+		globalScheduler.enqueue(task);
+		return;
+	}
+	globalScheduler.enqueue(() => {
+		instance.hasPendingUpdate = false;
+		instance.notifyUpdate?.();
+	});
+}
 function recordReadableRead(source) {
 	source._hasEverBeenRead = true;
 	if (currentFineGrainedReadSources) {
@@ -26,6 +39,13 @@ function recordReadableRead(source) {
 	if (!inst || inst._currentRenderToken === void 0) return;
 	if (!inst._pendingReadSources) inst._pendingReadSources = /* @__PURE__ */ new Set();
 	inst._pendingReadSources.add(source);
+	const sourceVersion = source._version ?? 0;
+	let pendingVersions = inst._pendingReadSourceVersions;
+	if (!pendingVersions) {
+		pendingVersions = /* @__PURE__ */ new Map();
+		inst._pendingReadSourceVersions = pendingVersions;
+	}
+	pendingVersions.set(source, sourceVersion);
 }
 function withFineGrainedReadTracking(pendingSources, fn) {
 	const previousPendingSources = currentFineGrainedReadSources;
@@ -39,18 +59,27 @@ function withFineGrainedReadTracking(pendingSources, fn) {
 function finalizeReadableSubscriptions(instance) {
 	const newSet = instance._pendingReadSources;
 	const token = instance._currentRenderToken;
-	finalizeReadableSubscriptionsFromSnapshot(instance, token, newSet);
+	const pendingVersions = instance._pendingReadSourceVersions;
+	finalizeReadableSubscriptionsFromSnapshot(instance, token, newSet, pendingVersions);
 	instance._pendingReadSources = void 0;
 	instance._currentRenderToken = void 0;
+	instance._pendingReadSourceVersions = void 0;
 }
-function finalizeReadableSubscriptionsFromSnapshot(instance, token, newSet) {
+function finalizeReadableSubscriptionsFromSnapshot(instance, token, newSet, pendingReadSourceVersions = instance._pendingReadSourceVersions) {
 	if (token === void 0) return;
 	const oldSet = instance._lastReadSources;
+	const pendingVersions = pendingReadSourceVersions;
+	let needsFollowUpUpdate = false;
 	if (oldSet) {
 		for (const source of oldSet) if (!newSet?.has(source)) source._readers?.delete(instance);
 	}
 	instance.lastRenderToken = token;
 	if (newSet) for (const source of newSet) {
+		if (pendingVersions && (!oldSet || oldSet.has(source))) {
+			const sourceVersion = source._version ?? 0;
+			const readVersion = pendingVersions.get(source);
+			if (readVersion !== void 0 && sourceVersion !== readVersion) needsFollowUpUpdate = true;
+		}
 		let readers = source._readers;
 		if (!readers) {
 			readers = /* @__PURE__ */ new Map();
@@ -59,12 +88,19 @@ function finalizeReadableSubscriptionsFromSnapshot(instance, token, newSet) {
 		readers.set(instance, instance.lastRenderToken ?? 0);
 	}
 	instance._lastReadSources = newSet ?? /* @__PURE__ */ new Set();
+	if (needsFollowUpUpdate) scheduleReadableInstanceUpdate(instance);
 }
 function cleanupReadableSubscriptions(instance) {
 	const sources = instance._lastReadSources;
-	if (!sources || sources.size === 0) return;
+	if (!sources || sources.size === 0) {
+		instance._pendingReadSources = void 0;
+		instance._pendingReadSourceVersions = void 0;
+		return;
+	}
 	for (const source of sources) source._readers?.delete(instance);
 	instance._lastReadSources = /* @__PURE__ */ new Set();
+	instance._pendingReadSources = void 0;
+	instance._pendingReadSourceVersions = void 0;
 }
 function withDerivedReadTracking(subscriber, fn) {
 	const prevDerivedSubscriber = currentDerivedSubscriber;
@@ -103,6 +139,7 @@ function markReactivePropsDirtySource(source) {
 	} catch {}
 }
 function notifyReadableReaders(source, skipInstance) {
+	source._version = (source._version ?? 0) + 1;
 	const readers = source._readers;
 	let didScheduleUpdate = false;
 	if (!readers || readers.size === 0) return false;
@@ -110,13 +147,7 @@ function notifyReadableReaders(source, skipInstance) {
 		if (skipInstance && instance === skipInstance) continue;
 		if (instance.lastRenderToken !== token) continue;
 		if (instance.hasPendingUpdate) continue;
-		instance.hasPendingUpdate = true;
-		const task = instance._pendingFlushTask;
-		if (task) globalScheduler.enqueue(task);
-		else globalScheduler.enqueue(() => {
-			instance.hasPendingUpdate = false;
-			instance.notifyUpdate?.();
-		});
+		scheduleReadableInstanceUpdate(instance);
 		didScheduleUpdate = true;
 	}
 	return didScheduleUpdate;