@askrjs/askr 0.0.35 → 0.0.37

package/dist/runtime/for.js

@@ -31,6 +31,7 @@ function createForState(eachSource, byFn, renderFn, fallback) {
 		fallbackScope: null,
 		items: /* @__PURE__ */ new Map(),
 		orderedKeys: [],
+		orderedItems: [],
 		orderedVNodes: [],
 		byFn,
 		renderFn,
@@ -105,9 +106,11 @@ function createForItemSignal(initialItem) {
 	itemSignal.set = (newValue, notifyReaders = true) => {
 		if (Object.is(itemValue, newValue)) return;
 		itemValue = newValue;
-		markReadableDerivedSubscribersDirty(itemSignal);
-		markReactivePropsDirtySource(itemSignal);
-		if (notifyReaders) notifyReadableReaders(itemSignal);
+		if (notifyReaders) {
+			markReadableDerivedSubscribersDirty(itemSignal);
+			markReactivePropsDirtySource(itemSignal);
+			notifyReadableReaders(itemSignal);
+		}
 	};
 	itemSignal._hasBeenRead = false;
 	return itemSignal;
@@ -125,9 +128,11 @@ function createForItemPropertySignal(initialValue) {
 	propertySignal.set = (newValue, notifyReaders = true) => {
 		if (Object.is(propertyValue, newValue)) return;
 		propertyValue = newValue;
-		markReadableDerivedSubscribersDirty(propertySignal);
-		markReactivePropsDirtySource(propertySignal);
-		if (notifyReaders) notifyReadableReaders(propertySignal);
+		if (notifyReaders) {
+			markReadableDerivedSubscribersDirty(propertySignal);
+			markReactivePropsDirtySource(propertySignal);
+			notifyReadableReaders(propertySignal);
+		}
 	};
 	propertySignal._hasBeenRead = false;
 	return propertySignal;
@@ -135,6 +140,16 @@ function createForItemPropertySignal(initialValue) {
 function readForItemProperty(item, prop) {
 	return Reflect.get(Object(item), prop);
 }
+function haveSameOwnKeys(previousItem, nextItem) {
+	const previousKeys = Reflect.ownKeys(Object(previousItem));
+	const nextKeys = Reflect.ownKeys(Object(nextItem));
+	if (previousKeys.length !== nextKeys.length) return false;
+	for (let i = 0; i < previousKeys.length; i += 1) if (previousKeys[i] !== nextKeys[i]) return false;
+	return true;
+}
+function scopeReadsSource(scope, source) {
+	return source._readers?.has(scope.componentInstance) ?? false;
+}
 function getOrCreateForItemPropertySignal(item, propertySignals, prop) {
 	const existingSignal = propertySignals.get(prop);
 	if (existingSignal) return existingSignal;
@@ -232,6 +247,7 @@ function createItemInstance(key, item, index, forState) {
 	const itemSignal = canProxyForItem(item) ? createForItemSignal(item) : null;
 	const itemPropertySignals = itemSignal ? /* @__PURE__ */ new Map() : null;
 	const reactiveItem = itemSignal && itemPropertySignals ? createReactiveForItem(itemSignal, itemPropertySignals) : item;
+	let itemInstance = null;
 	const scope = createChildScope(forState.parentInstance, key, () => {
 		if (forState._enqueueBoundaryCommit) {
 			forState._enqueueBoundaryCommit();
@@ -241,7 +257,7 @@ function createItemInstance(key, item, index, forState) {
 		if (parent) parent._enqueueRun?.();
 	});
 	renderItemScope(forState, scope, reactiveItem, indexSignal, key);
-	return {
+	itemInstance = {
 		key,
 		item,
 		reactiveItem,
@@ -250,6 +266,7 @@ function createItemInstance(key, item, index, forState) {
 		indexSignal,
 		scope
 	};
+	return itemInstance;
 }
 function rerenderItemInstance(forState, itemInstance, item) {
 	renderItemScope(forState, itemInstance.scope, item, itemInstance.indexSignal, itemInstance.key);
@@ -258,26 +275,30 @@ function updateItemInstance(forState, itemInstance, item) {
 	if (itemInstance.item === item) return false;
 	const previousItem = itemInstance.item;
 	itemInstance.item = item;
-	let needsRerender = false;
+	const scope = itemInstance.scope;
+	let scopeReadsChangedSignal = false;
 	const itemSignal = itemInstance.itemSignal;
 	if (!itemSignal) {
 		rerenderItemInstance(forState, itemInstance, item);
 		return true;
 	}
 	const propertySignals = itemInstance.itemPropertySignals;
+	const changedPropertySignals = [];
 	if (propertySignals && propertySignals.size > 0) for (const [prop, propertySignal] of propertySignals) {
 		const previousValue = readForItemProperty(previousItem, prop);
 		const nextValue = readForItemProperty(item, prop);
 		if (Object.is(previousValue, nextValue)) continue;
-		const propertyHasRenderReaders = (propertySignal._readers?.size ?? 0) > 0;
-		if (propertyHasRenderReaders) needsRerender = true;
-		propertySignal.set(nextValue, !propertyHasRenderReaders);
+		if (scopeReadsSource(scope, propertySignal)) scopeReadsChangedSignal = true;
+		changedPropertySignals.push([propertySignal, nextValue]);
 	}
-	const hasRenderReaders = (itemSignal._readers?.size ?? 0) > 0;
-	if (hasRenderReaders) needsRerender = true;
-	itemSignal.set(item, hasRenderReaders);
-	if (needsRerender) rerenderItemInstance(forState, itemInstance, itemInstance.reactiveItem);
-	return true;
+	if (scopeReadsSource(scope, itemSignal)) scopeReadsChangedSignal = true;
+	const itemShapeChanged = changedPropertySignals.length === 0 && !haveSameOwnKeys(previousItem, item);
+	const notifyReaders = !scopeReadsChangedSignal && (changedPropertySignals.length > 0 || itemShapeChanged);
+	const visibleChange = scopeReadsChangedSignal || changedPropertySignals.length > 0 || itemShapeChanged;
+	for (const [propertySignal, nextValue] of changedPropertySignals) propertySignal.set(nextValue, notifyReaders);
+	itemSignal.set(item, notifyReaders);
+	if (scopeReadsChangedSignal) rerenderItemInstance(forState, itemInstance, itemInstance.reactiveItem);
+	return visibleChange;
 }
 const FOR_FALLBACK_SCOPE_KEY = "__for-fallback__";
 function disposeFallbackScope(forState, domCleanup) {
@@ -296,6 +317,7 @@ function renderFallbackScope(forState) {
 	if (forState.fallback == null || forState.fallback === false) {
 		if (forState.fallbackScope) disposeFallbackScope(forState, "none");
 		forState.orderedVNodes = [];
+		forState.orderedItems = [];
 		return [];
 	}
 	const fallbackScope = forState.fallbackScope ?? createChildScope(forState.parentInstance, FOR_FALLBACK_SCOPE_KEY, () => {
@@ -308,6 +330,7 @@ function renderFallbackScope(forState) {
 	forState.fallbackScope = fallbackScope;
 	const vnode = fallbackScope.render(() => forState.fallback);
 	forState.orderedVNodes = vnode == null || vnode === false ? [] : [vnode];
+	forState.orderedItems = [];
 	return forState.orderedVNodes;
 }
 function disposeAllItems(forState, domCleanup) {
@@ -355,20 +378,24 @@ function reconcileForItems(forState, newArray) {
 			recordBenchFastLane("APPEND");
 			forState.lastCommitStrategy = "APPEND";
 			const resultVNodes = forState.orderedVNodes;
+			const resultItems = forState.orderedItems;
 			resultVNodes.length = newLen;
+			resultItems.length = newLen;
 			for (let i = 0; i < oldLen; i++) {
 				const item = newArray[i];
 				const key = orderedKeys[i];
-				const existing = items.get(key);
-				recordBenchEvent("itemReused");
+				const existing = resultItems[i] ?? items.get(key);
 				updateItemInstance(forState, existing, item);
+				resultItems[i] = existing;
 				resultVNodes[i] = existing.scope.vnode;
 			}
+			recordBenchEvent("itemReused", oldLen);
 			for (let i = oldLen; i < newLen; i++) {
 				const item = newArray[i];
 				const key = byFn(item, i);
 				const itemInstance = createItemInstance(key, item, i, forState);
 				items.set(key, itemInstance);
+				resultItems[i] = itemInstance;
 				resultVNodes[i] = itemInstance.scope.vnode;
 				orderedKeys[i] = key;
 			}
@@ -399,22 +426,27 @@ function reconcileForItems(forState, newArray) {
 				if (canUseRemoveOnePath) {
 					recordBenchFastLane("REMOVE_ONE");
 					forState.lastCommitStrategy = "NO_REORDER";
+					const previousOrderedItems = forState.orderedItems.slice();
 					const resultVNodes = forState.orderedVNodes;
+					const resultItems = forState.orderedItems;
 					resultVNodes.length = newLen;
+					resultItems.length = newLen;
 					const dirtyIndices = [];
 					for (let i = 0; i < newLen; i++) {
 						const item = newArray[i];
 						const key = i < removedIndex ? orderedKeys[i] : orderedKeys[i + 1];
 						const existing = items.get(key);
-						recordBenchEvent("itemReused");
+						const scopeNeedsDomUpdate = existing.scope.needsDomUpdate;
 						const itemChanged = existing.item !== item;
-						const needsDomUpdate = existing.scope.needsDomUpdate;
-						const indexChanged = existing.indexSignal.peek() !== i;
+						const indexSignal = existing.indexSignal;
+						const indexChanged = indexSignal._hasBeenRead && indexSignal.peek() !== i;
 						if (itemChanged) updateItemInstance(forState, existing, item);
-						if (indexChanged && existing.indexSignal._hasBeenRead) existing.indexSignal.set(i);
-						if (itemChanged || indexChanged || needsDomUpdate || existing.scope.needsDomUpdate) dirtyIndices.push(i);
+						if (indexChanged) indexSignal.set(i);
+						if (itemChanged || indexChanged || scopeNeedsDomUpdate) dirtyIndices.push(i);
+						resultItems[i] = existing;
 						resultVNodes[i] = existing.scope.vnode;
 					}
+					recordBenchEvent("itemReused", newLen);
 					const removedKey = orderedKeys[removedIndex];
 					const removedItem = items.get(removedKey);
 					if (removedItem) {
@@ -422,8 +454,13 @@ function reconcileForItems(forState, newArray) {
 						items.delete(removedKey);
 					}
 					const nextOrderedKeys = orderedKeys.slice(0, newLen);
-					for (let i = removedIndex; i < newLen; i++) nextOrderedKeys[i] = orderedKeys[i + 1];
+					const nextOrderedItems = previousOrderedItems.slice(0, newLen);
+					for (let i = removedIndex; i < newLen; i++) {
+						nextOrderedKeys[i] = orderedKeys[i + 1];
+						nextOrderedItems[i] = previousOrderedItems[i + 1];
+					}
 					forState.orderedKeys = nextOrderedKeys;
+					forState.orderedItems = nextOrderedItems;
 					if (BENCH_BUILD_ENABLED) {
 						recordBenchTiming("reconcile", performance.now() - reconcileStartMs);
 						flushBenchMetrics();
@@ -444,16 +481,19 @@ function reconcileForItems(forState, newArray) {
 			recordBenchFastLane("TRUNCATE");
 			forState.lastCommitStrategy = "TRUNCATE";
 			const resultVNodes = forState.orderedVNodes;
+			const resultItems = forState.orderedItems;
 			resultVNodes.length = newLen;
+			resultItems.length = newLen;
 			const isFullClear = newLen === 0;
 			for (let i = 0; i < newLen; i++) {
 				const item = newArray[i];
 				const key = orderedKeys[i];
 				const existing = items.get(key);
-				recordBenchEvent("itemReused");
 				updateItemInstance(forState, existing, item);
+				resultItems[i] = existing;
 				resultVNodes[i] = existing.scope.vnode;
 			}
+			recordBenchEvent("itemReused", newLen);
 			for (let i = newLen; i < oldLen; i++) {
 				const key = orderedKeys[i];
 				const itemInstance = items.get(key);
@@ -464,6 +504,7 @@ function reconcileForItems(forState, newArray) {
 			}
 			orderedKeys.length = newLen;
 			forState.orderedKeys = orderedKeys;
+			forState.orderedItems.length = newLen;
 			if (BENCH_BUILD_ENABLED) {
 				recordBenchTiming("reconcile", performance.now() - reconcileStartMs);
 				flushBenchMetrics();
@@ -485,20 +526,21 @@ function reconcileForItems(forState, newArray) {
 			recordBenchFastLane("NO_REORDER");
 			forState.lastCommitStrategy = "NO_REORDER";
 			const resultVNodes = forState.orderedVNodes;
+			const resultItems = forState.orderedItems;
 			resultVNodes.length = oldLen;
+			resultItems.length = oldLen;
 			const dirtyIndices = [];
 			for (let i = 0; i < oldLen; i++) {
 				const item = newArray[i];
 				const key = orderedKeys[i];
 				const existing = items.get(key);
-				recordBenchEvent("itemReused");
 				const itemChanged = existing.item !== item;
-				const needsDomUpdate = existing.scope.needsDomUpdate;
-				let rerendered = false;
-				if (itemChanged) rerendered = updateItemInstance(forState, existing, item);
-				if (rerendered || needsDomUpdate || existing.scope.needsDomUpdate) dirtyIndices.push(i);
+				if (itemChanged) updateItemInstance(forState, existing, item);
+				if (!itemChanged && existing.scope.needsDomUpdate) dirtyIndices.push(i);
+				resultItems[i] = existing;
 				resultVNodes[i] = existing.scope.vnode;
 			}
+			recordBenchEvent("itemReused", oldLen);
 			if (BENCH_BUILD_ENABLED) {
 				recordBenchTiming("reconcile", performance.now() - reconcileStartMs);
 				flushBenchMetrics();
@@ -552,6 +594,9 @@ function reconcileForItems(forState, newArray) {
 			const secondExisting = items.get(secondMismatchKey);
 			const firstItem = newArray[firstMismatch];
 			const secondItem = newArray[secondMismatch];
+			const nextOrderedItems = forState.orderedItems.slice();
+			nextOrderedItems[firstMismatch] = secondExisting;
+			nextOrderedItems[secondMismatch] = firstExisting;
 			recordBenchEvent("itemReused");
 			recordBenchEvent("itemReused");
 			if (firstExisting.item !== firstItem) updateItemInstance(forState, firstExisting, firstItem);
@@ -561,6 +606,7 @@ function reconcileForItems(forState, newArray) {
 			resultVNodes[firstMismatch] = firstExisting.scope.vnode;
 			resultVNodes[secondMismatch] = secondExisting.scope.vnode;
 			forState.orderedKeys = nextOrderedKeys;
+			forState.orderedItems = nextOrderedItems;
 			if (BENCH_BUILD_ENABLED) {
 				recordBenchTiming("reconcile", performance.now() - reconcileStartMs);
 				flushBenchMetrics();
@@ -572,6 +618,7 @@ function reconcileForItems(forState, newArray) {
 		}
 		let canUseMoveOnlyPath = true;
 		const moveOnlyKeys = [];
+		const moveOnlyItems = [];
 		const moveOnlyVNodes = [];
 		for (let i = 0; i < oldLen; i++) {
 			const item = newArray[i];
@@ -582,6 +629,7 @@ function reconcileForItems(forState, newArray) {
 				break;
 			}
 			moveOnlyKeys[i] = key;
+			moveOnlyItems[i] = existing;
 			moveOnlyVNodes[i] = existing.scope.vnode;
 			recordBenchEvent("itemReused");
 		}
@@ -589,6 +637,7 @@ function reconcileForItems(forState, newArray) {
 			recordBenchFastLane("FULL_KEYED");
 			forState.lastCommitStrategy = "FULL_KEYED";
 			forState.orderedKeys = moveOnlyKeys;
+			forState.orderedItems = moveOnlyItems;
 			forState.orderedVNodes = moveOnlyVNodes;
 			if (BENCH_BUILD_ENABLED) {
 				recordBenchTiming("reconcile", performance.now() - reconcileStartMs);
@@ -604,6 +653,7 @@ function reconcileForItems(forState, newArray) {
 	forState.lastCommitStrategy = "FULL_KEYED";
 	const toRemove = new Set(orderedKeys);
 	const newOrderedKeys = [];
+	const newOrderedItems = [];
 	const resultVNodes = [];
 	let moveOnly = toRemove.size === newArray.length;
 	for (let i = 0; i < newArray.length; i++) {
@@ -617,6 +667,7 @@ function reconcileForItems(forState, newArray) {
 		if (!existing) {
 			const itemInstance = createItemInstance(key, item, i, forState);
 			items.set(key, itemInstance);
+			newOrderedItems.push(itemInstance);
 			resultVNodes.push(itemInstance.scope.vnode);
 		} else {
 			recordBenchEvent("itemReused");
@@ -627,6 +678,7 @@ function reconcileForItems(forState, newArray) {
 				updateItemInstance(forState, existing, item);
 			}
 			if (indexChanged) existing.indexSignal.set(i);
+			newOrderedItems.push(existing);
 			resultVNodes.push(existing.scope.vnode);
 		}
 	}
@@ -639,6 +691,7 @@ function reconcileForItems(forState, newArray) {
 		}
 	}
 	forState.orderedKeys = newOrderedKeys;
+	forState.orderedItems = newOrderedItems;
 	if (BENCH_BUILD_ENABLED) {
 		recordBenchTiming("reconcile", performance.now() - reconcileStartMs);
 		flushBenchMetrics();
@@ -655,7 +708,12 @@ function evaluateForState(forState) {
 	return reconcileForItems(forState, forState.currentItems);
 }
 function clearForDomUpdateState(forState) {
-	for (let i = 0; i < forState.orderedKeys.length; i++) {
+	const dirtyIndices = forState.pendingDirtyIndices;
+	if (dirtyIndices && dirtyIndices.length > 0) for (let i = 0; i < dirtyIndices.length; i++) {
+		const itemInstance = forState.orderedItems[dirtyIndices[i]];
+		if (itemInstance) itemInstance.scope.needsDomUpdate = false;
+	}
+	else for (let i = 0; i < forState.orderedKeys.length; i++) {
 		const key = forState.orderedKeys[i];
 		const itemInstance = forState.items.get(key);
 		if (itemInstance) itemInstance.scope.needsDomUpdate = false;
@@ -666,6 +724,7 @@ function clearForDomUpdateState(forState) {
 	forState.pendingSwapIndices = null;
 	forState.pendingMoveOnly = false;
 	forState._needsSourceReconcile = false;
+	forState._hasResolvedItemDom = forState.orderedKeys.length > 0;
 }
 //#endregion
 export { clearForDomUpdateState, evaluateForState, useForState };

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(newValue: number | ((prev: number) => number)): 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  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    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 = (newValue: number | ((prev: number) => number)) => {\n    const nextValue =\n      typeof newValue === 'function' ? newValue(indexValue) : newValue;\n    if (nextValue !== indexValue) {\n      indexValue = nextValue;\n      markReadableDerivedSubscribersDirty(indexSignal);\n      markReactivePropsDirtySource(indexSignal);\n      notifyReadableReaders(indexSignal);\n    }\n  };\n  indexSignal._hasBeenRead = false;\n\n  return indexSignal;\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    markReadableDerivedSubscribersDirty(itemSignal);\n    markReactivePropsDirtySource(itemSignal);\n\n    if (notifyReaders) {\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    markReadableDerivedSubscribersDirty(propertySignal);\n    markReactivePropsDirtySource(propertySignal);\n\n    if (notifyReaders) {\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 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  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  const itemInstance: ForItemInstance<T> = {\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  let needsRerender = 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  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      const propertyHasRenderReaders = (propertySignal._readers?.size ?? 0) > 0;\n      if (propertyHasRenderReaders) {\n        needsRerender = true;\n      }\n\n      propertySignal.set(nextValue, !propertyHasRenderReaders);\n    }\n  }\n\n  const hasRenderReaders = (itemSignal._readers?.size ?? 0) > 0;\n  if (hasRenderReaders) {\n    needsRerender = true;\n  }\n  itemSignal.set(item, hasRenderReaders);\n\n  if (needsRerender) {\n    rerenderItemInstance(forState, itemInstance, itemInstance.reactiveItem);\n  }\n  return true;\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    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  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      resultVNodes.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 = items.get(key)!;\n        recordBenchEvent('itemReused');\n\n        updateItemInstance(forState, existing, item);\n\n        resultVNodes[i] = existing.scope.vnode as VNode;\n      }\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        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 resultVNodes = forState.orderedVNodes;\n          resultVNodes.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            recordBenchEvent('itemReused');\n\n            const itemChanged = existing.item !== item;\n            const needsDomUpdate = existing.scope.needsDomUpdate;\n            const indexChanged = existing.indexSignal.peek() !== i;\n\n            if (itemChanged) {\n              updateItemInstance(forState, existing, item);\n            }\n\n            if (indexChanged && existing.indexSignal._hasBeenRead) {\n              existing.indexSignal.set(i);\n            }\n\n            if (\n              itemChanged ||\n              indexChanged ||\n              needsDomUpdate ||\n              existing.scope.needsDomUpdate\n            ) {\n              dirtyIndices.push(i);\n            }\n\n            resultVNodes[i] = existing.scope.vnode as VNode;\n          }\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          for (let i = removedIndex; i < newLen; i++) {\n            nextOrderedKeys[i] = orderedKeys[i + 1];\n          }\n          forState.orderedKeys = nextOrderedKeys;\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      resultVNodes.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        recordBenchEvent('itemReused');\n\n        updateItemInstance(forState, existing, item);\n\n        resultVNodes[i] = existing.scope.vnode as VNode;\n      }\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\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      resultVNodes.length = oldLen;\n      const dirtyIndices: number[] = [];\n\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        recordBenchEvent('itemReused');\n\n        const itemChanged = existing.item !== item;\n        const needsDomUpdate = existing.scope.needsDomUpdate;\n        let rerendered = false;\n\n        if (itemChanged) {\n          rerendered = updateItemInstance(forState, existing, item);\n        }\n\n        if (rerendered || needsDomUpdate || existing.scope.needsDomUpdate) {\n          dirtyIndices.push(i);\n        }\n\n        resultVNodes[i] = existing.scope.vnode as VNode;\n      }\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\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      if (\n        firstExisting.indexSignal._hasBeenRead &&\n        firstExisting.indexSignal.peek() !== firstMismatch\n      ) {\n        firstExisting.indexSignal.set(firstMismatch);\n      }\n\n      if (\n        secondExisting.indexSignal._hasBeenRead &&\n        secondExisting.indexSignal.peek() !== secondMismatch\n      ) {\n        secondExisting.indexSignal.set(secondMismatch);\n      }\n\n      resultVNodes[firstMismatch] = firstExisting.scope.vnode as VNode;\n      resultVNodes[secondMismatch] = secondExisting.scope.vnode as VNode;\n\n      forState.orderedKeys = nextOrderedKeys;\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 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      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      forState.orderedKeys = moveOnlyKeys;\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 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      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 =\n        existing.indexSignal._hasBeenRead && 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        existing.indexSignal.set(i);\n      }\n\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\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  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  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}\n"],"mappings":";;;;;;;;;;;;;AAwCA,MAAM,sBAAsB,qBAAqB;AAyEjD,MAAM,4BAAY,IAAI,SAGnB;AAEH,SAAS,YACP,UACgC;CAChC,IAAI,QAAQ,UAAU,IAAI,SAAS;AACnC,KAAI,CAAC,OAAO;AACV,0BAAQ,IAAI,KAAK;AACjB,YAAU,IAAI,UAAU,MAAM;;AAEhC,QAAO;;AAGT,SAAgB,eACd,YACA,MACA,UACA,UACa;CACb,MAAM,iBAAiB,oBAAoB;AAE3C,QAAO;EACL,MAAM;EACN,cAAc,EAAE;EAChB;EACA;EACA,eAAe;EACf,uBAAO,IAAI,KAAK;EAChB,aAAa,EAAE;EACf,eAAe,EAAE;EACjB;EACA;EACA;EACA,oBAAoB;EACpB,kBAAkB,EAAE;EACpB,qBAAqB;EACrB,oBAAoB;EACpB,iBAAiB;EACjB,qBAAqB;EACrB,uBAAuB;EACvB,eAAe;EACf,sBAAsB;EACtB,wBAAwB;EACxB,2BAA2B;EAC5B;;AAGH,SAAgB,YACd,YACA,MACA,UACA,UACa;CACb,MAAM,WAAW,oBAAoB;AACrC,KAAI,CAAC,SACH,OAAM,IAAI,MACR,6DACD;CAGH,MAAM,YAAY,eAAe,UAAU,MAAM;CACjD,MAAM,QAAQ,YAAY,SAAS;CACnC,MAAM,WAAW,MAAM,IAAI,UAAU;AAErC,KAAI,UAAU;AACZ,WAAS,aAAa;AACtB,WAAS,OAAO;AAChB,WAAS,WAAW;AACpB,WAAS,WAAW;AACpB,SAAO;;CAGT,MAAM,UAAU,eAAe,YAAY,MAAM,UAAU,SAAS;AACpE,OAAM,IAAI,WAAW,QAA6B;AAElD,EAAC,SAAS,eAAe,EAAE,EAAE,WAAW;AACtC,UAAQ,eAAe,SAAS;AAChC,UAAQ,gBAAgB;AACxB,QAAM,OAAO,UAAU;GACvB;AAEF,QAAO;;AAGT,SAAS,qBAAqB,cAAsC;CAClE,IAAI,aAAa;CACjB,MAAM,0BAAU,IAAI,KAAgC;CAEpD,MAAM,qBAAqB;AACzB,cAAY,eAAe;AAC3B,qBAAmB,YAAY;AAC/B,SAAO;;AAET,aAAY,WAAW;AACvB,aAAY,aAAa;AACzB,aAAY,OAAO,aAAkD;EACnE,MAAM,YACJ,OAAO,aAAa,aAAa,SAAS,WAAW,GAAG;AAC1D,MAAI,cAAc,YAAY;AAC5B,gBAAa;AACb,uCAAoC,YAAY;AAChD,gCAA6B,YAAY;AACzC,yBAAsB,YAAY;;;AAGtC,aAAY,eAAe;AAE3B,QAAO;;AAGT,SAAS,oBAAuB,aAAkC;CAChE,IAAI,YAAY;CAChB,MAAM,0BAAU,IAAI,KAAgC;CAEpD,MAAM,oBAAoB;AACxB,aAAW,eAAe;AAC1B,qBAAmB,WAAW;AAC9B,SAAO;;AAGT,YAAW,WAAW;AACtB,YAAW,aAAa;AACxB,YAAW,OAAO,UAAa,gBAAgB,SAAS;AACtD,MAAI,OAAO,GAAG,WAAW,SAAS,CAChC;AAGF,cAAY;AACZ,sCAAoC,WAAW;AAC/C,+BAA6B,WAAW;AAExC,MAAI,cACF,uBAAsB,WAAW;;AAGrC,YAAW,eAAe;AAE1B,QAAO;;AAGT,SAAS,4BACP,cACuB;CACvB,IAAI,gBAAgB;CACpB,MAAM,0BAAU,IAAI,KAAgC;CAEpD,MAAM,wBAAwB;AAC5B,iBAAe,eAAe;AAC9B,qBAAmB,eAAe;AAClC,SAAO;;AAGT,gBAAe,WAAW;AAC1B,gBAAe,aAAa;AAC5B,gBAAe,OAAO,UAAmB,gBAAgB,SAAS;AAChE,MAAI,OAAO,GAAG,eAAe,SAAS,CACpC;AAGF,kBAAgB;AAChB,sCAAoC,eAAe;AACnD,+BAA6B,eAAe;AAE5C,MAAI,cACF,uBAAsB,eAAe;;AAGzC,gBAAe,eAAe;AAE9B,QAAO;;AAGT,SAAS,oBAAoB,MAAe,MAA4B;AACtE,QAAO,QAAQ,IAAI,OAAO,KAAK,EAAE,KAAK;;AAGxC,SAAS,iCACP,MACA,iBACA,MACuB;CACvB,MAAM,iBAAiB,gBAAgB,IAAI,KAAK;AAChD,KAAI,eACF,QAAO;CAGT,MAAM,iBAAiB,4BACrB,oBAAoB,MAAM,KAAK,CAChC;AACD,iBAAgB,IAAI,MAAM,eAAe;AACzC,QAAO;;AAGT,SAAS,gBAAgB,MAA+B;AACtD,QACG,OAAO,SAAS,YAAY,SAAS,QAAS,OAAO,SAAS;;AAInE,SAAS,sBACP,YACA,iBACG;AAGH,QAAO,IAAI,MAFI,OAAO,OAAO,KAEZ,EAAQ;EACvB,IAAI,QAAQ,MAAM,UAAU;AAE1B,OADsB,QAAQ,yBAAyB,QAAQ,KAC3D,CACF,QAAO,QAAQ,IAAI,QAAQ,MAAM,SAAS;GAG5C,MAAM,cAAc,WAAW,MAAM;AAErC,OAAI,OAAO,SAAS,SAClB,QAAO,iCACL,aACA,iBACA,KACD,EAAE;AAGL,sBAAmB,WAAW;AAC9B,UAAO,QAAQ,IAAI,OAAO,YAAY,EAAE,MAAM,SAAS;;EAEzD,IAAI,QAAQ,MAAM;AAChB,sBAAmB,WAAW;AAC9B,UAAO,QAAQ,UAAU,QAAQ,OAAO,WAAW,MAAM,CAAC;;EAE5D,QAAQ,QAAQ;AACd,sBAAmB,WAAW;GAC9B,MAAM,OAAO,IAAI,IAAqB,QAAQ,QAAQ,OAAO,CAAC;AAC9D,QAAK,MAAM,OAAO,QAAQ,QAAQ,OAAO,WAAW,MAAM,CAAC,CAAC,CAC1D,MAAK,IAAI,IAAI;AAGf,UAAO,MAAM,KAAK,KAAK;;EAEzB,yBAAyB,QAAQ,MAAM;AACrC,sBAAmB,WAAW;GAC9B,MAAM,gBAAgB,QAAQ,yBAAyB,QAAQ,KAAK;AACpE,OAAI,cACF,QAAO;AAGT,UAAO,OAAO,yBAAyB,OAAO,WAAW,MAAM,CAAC,EAAE,KAAK;;EAEzE,iBAAiB;AACf,sBAAmB,WAAW;AAC9B,UAAO,OAAO,eAAe,OAAO,WAAW,MAAM,CAAC,CAAC;;EAE1D,CAAC;;AAGJ,SAAS,qBACP,KACA,OACM;AACN,KAAI,SAAS,OAAO,UAAU,YAAY,UAAU,OAAO;EACzD,MAAM,KAAK;AACX,KAAG,MAAM;AAET,MAAI,OAAO,GAAG,SAAS,UAAU;AAC/B,OAAI,CAAC,GAAG,MAAO,IAAG,QAAQ,EAAE;AAC5B,OAAI,GAAG,MAAM,gBAAgB,OAC3B,IAAG,MAAM,cAAc,OAAO,IAAI;;;;AAM1C,SAAS,gBACP,UACA,OACA,MACA,aACA,KACO;AACP,kBAAiB,aAAa;CAC9B,MAAM,QAAQ,MAAM,aAAa,SAAS,SAAS,MAAM,YAAY,CAAC;AACtE,sBAAqB,KAAK,MAAM;AAChC,QAAO;;AAGT,SAAS,kBAAkB,SAAwB;AACjD,OAAM,IAAI,MAAM,QAAQ;;AAG1B,SAAS,gBAAmB,UAAuB,UAAqB;AACtE,KAAI,CAAC,0BAA0B,CAC7B;CAGF,MAAM,uBAAO,IAAI,KAAsB;CACvC,MAAM,2BAAW,IAAI,KAAkC;AACvD,MAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,MAAM,SAAS,KAAK,SAAS,IAAI,EAAE;AAEzC,MAAI,QAAQ,QAAQ,QAAQ,OAC1B,mBACE,kGACD;AAGH,MAAI,KAAK,IAAI,IAAI,CACf,mBACE,sCAAsC,OAAO,IAAI,CAAC,kEACnD;AAGH,OAAK,IAAI,IAAI;EAEb,MAAM,YAAY,OAAO,IAAI;EAC7B,MAAM,UAAU,OAAO;EACvB,MAAM,kBAAkB,SAAS,aAAa,IAAI,UAAU;AAC5D,MAAI,mBAAmB,oBAAoB,QACzC,mBACE,mCAAmC,UAAU,uDAC9C;AAEH,WAAS,IAAI,WAAW,QAA+B;;AAGzD,UAAS,cAAc;;AAKzB,SAAS,oBACP,UACA,cACA,YACM;AACN,kBAAiB,cAAc;CAC/B,MAAM,aAAa,aAAa,MAAM;AAEtC,KAAI;AACF,oBAAkB,aAAa,MAAM;UAC9B,KAAK;AACZ,MAAI,0BAA0B,CAC5B,SAAQ,MAAM,wBAAwB,IAAI;;AAI9C,KAAI,CAAC,WACH;AAGF,KAAI,sBAAsB,SACxB;MAAI,eAAe,WACjB,qBAAoB,WAAW;;AAInC,UAAS,iBAAiB,KAAK,WAAW;;AAG5C,SAAgB,mBACd,KACA,MACA,OACA,UACoB;AACpB,kBAAiB,cAAc;CAI/B,MAAM,cAAc,qBAAqB,MAAM;CAC/C,MAAM,aAAa,gBAAgB,KAAK,GAAG,oBAAoB,KAAK,GAAG;CACvE,MAAM,sBAAsB,6BACxB,IAAI,KAAyC,GAC7C;CACJ,MAAM,eACJ,cAAc,sBACV,sBAAsB,YAAY,oBAAoB,GACtD;CACN,MAAM,QAAQ,iBAAiB,SAAS,gBAAgB,WAAW;AACjE,MAAI,SAAS,wBAAwB;AACnC,YAAS,wBAAwB;AACjC;;EAGF,MAAM,SAAS,SAAS;AACxB,MAAI,OACF,QAAO,eAAe;GAExB;AAEF,iBAAgB,UAAU,OAAO,cAAc,aAAa,IAAI;AAYhE,QAAO;EATL;EACA;EACA;EACA;EACA;EACA;EACA;EAGK;;AAGT,SAAS,qBACP,UACA,cACA,MACM;AACN,iBACE,UACA,aAAa,OACb,MACA,aAAa,aACb,aAAa,IACd;;AAGH,SAAS,mBACP,UACA,cACA,MACS;AACT,KAAI,aAAa,SAAS,KACxB,QAAO;CAGT,MAAM,eAAe,aAAa;AAClC,cAAa,OAAO;CAEpB,IAAI,gBAAgB;CACpB,MAAM,aAAa,aAAa;AAChC,KAAI,CAAC,YAAY;AACf,uBAAqB,UAAU,cAAc,KAAK;AAClD,SAAO;;CAGT,MAAM,kBAAkB,aAAa;AACrC,KAAI,mBAAmB,gBAAgB,OAAO,EAC5C,MAAK,MAAM,CAAC,MAAM,mBAAmB,iBAAiB;EACpD,MAAM,gBAAgB,oBAAoB,cAAc,KAAK;EAC7D,MAAM,YAAY,oBAAoB,MAAM,KAAK;AACjD,MAAI,OAAO,GAAG,eAAe,UAAU,CACrC;EAGF,MAAM,4BAA4B,eAAe,UAAU,QAAQ,KAAK;AACxE,MAAI,yBACF,iBAAgB;AAGlB,iBAAe,IAAI,WAAW,CAAC,yBAAyB;;CAI5D,MAAM,oBAAoB,WAAW,UAAU,QAAQ,KAAK;AAC5D,KAAI,iBACF,iBAAgB;AAElB,YAAW,IAAI,MAAM,iBAAiB;AAEtC,KAAI,cACF,sBAAqB,UAAU,cAAc,aAAa,aAAa;AAEzE,QAAO;;AAGT,MAAM,yBAAyB;AAE/B,SAAS,qBACP,UACA,YACM;CACN,MAAM,gBAAgB,SAAS;AAC/B,KAAI,CAAC,cACH;CAGF,MAAM,aAAa,cAAc;AACjC,mBAAkB,cAAc;AAChC,UAAS,gBAAgB;AAEzB,KAAI,CAAC,WACH;AAGF,KAAI,sBAAsB,SACxB;MAAI,eAAe,WACjB,qBAAoB,WAAW;;AAInC,UAAS,iBAAiB,KAAK,WAAW;;AAG5C,SAAS,oBAAuB,UAAgC;AAC9D,KAAI,SAAS,YAAY,QAAQ,SAAS,aAAa,OAAO;AAC5D,MAAI,SAAS,cACX,sBAAqB,UAAU,OAAO;AAExC,WAAS,gBAAgB,EAAE;AAC3B,SAAO,EAAE;;CAGX,MAAM,gBACJ,SAAS,iBACT,iBAAiB,SAAS,gBAAgB,8BAA8B;AACtE,MAAI,SAAS,wBAAwB;AACnC,YAAS,wBAAwB;AACjC;;AAGF,WAAS,gBAAgB,eAAe;GACxC;AACJ,UAAS,gBAAgB;CAEzB,MAAM,QAAQ,cAAc,aAAa,SAAS,SAAkB;AACpE,UAAS,gBAAgB,SAAS,QAAQ,UAAU,QAAQ,EAAE,GAAG,CAAC,MAAM;AACxE,QAAO,SAAS;;AAGlB,SAAS,gBACP,UACA,YACM;CACN,MAAM,EAAE,OAAO,gBAAgB;AAC/B,MAAK,IAAI,QAAQ,GAAG,QAAQ,YAAY,QAAQ,SAAS,GAAG;EAC1D,MAAM,MAAM,YAAY;EACxB,MAAM,eAAe,MAAM,IAAI,IAAI;AACnC,MAAI,CAAC,aACH;AAEF,sBAAoB,UAAU,cAAc,WAAW;AACvD,QAAM,OAAO,IAAI;;AAEnB,aAAY,SAAS;AACrB,UAAS,cAAc;;AAGzB,SAAgB,kBACd,UACA,UACS;AACT,UAAS,eAAe;AACxB,iBAAgB,UAAU,SAAS;AAEnC,KAAI,oBACF,oBAAmB;CAGrB,MAAM,mBAAmB,sBAAsB,YAAY,KAAK,GAAG;CAEnE,MAAM,EAAE,OAAO,aAAa,SAAS;CACrC,MAAM,SAAS,YAAY;CAC3B,MAAM,SAAS,SAAS;AACxB,UAAS,mBAAmB,EAAE;AAE9B,KAAI,WAAW,GAAG;AAChB,MAAI,SAAS,EACX,iBAAgB,UAAU,SAAS,WAAW,aAAa,OAAO;AAEpE,sBAAoB,WAAW;AAC/B,WAAS,qBAAqB;AAC9B,WAAS,sBAAsB;AAC/B,WAAS,qBAAqB;AAC9B,WAAS,kBAAkB;AAE3B,MAAI,qBAAqB;AACvB,qBAAkB,aAAa,YAAY,KAAK,GAAG,iBAAiB;AACpE,sBAAmB;;AAGrB,SAAO,oBAAoB,SAAS;;AAGtC,KAAI,SAAS,cACX,sBAAqB,UAAU,OAAO;AAOxC,KAAI,SAAS,QAAQ;EACnB,IAAI,mBAAmB;AACvB,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IAE1B,KADY,KAAK,SAAS,IAAI,EAC1B,KAAQ,YAAY,IAAI;AAC1B,sBAAmB;AACnB;;AAIJ,MAAI,kBAAkB;AACpB,uBAAoB,SAAS;AAC7B,YAAS,qBAAqB;GAC9B,MAAM,eAAe,SAAS;AAC9B,gBAAa,SAAS;AAGtB,QAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;IAC/B,MAAM,OAAO,SAAS;IACtB,MAAM,MAAM,YAAY;IACxB,MAAM,WAAW,MAAM,IAAI,IAAI;AAC/B,qBAAiB,aAAa;AAE9B,uBAAmB,UAAU,UAAU,KAAK;AAE5C,iBAAa,KAAK,SAAS,MAAM;;AAInC,QAAK,IAAI,IAAI,QAAQ,IAAI,QAAQ,KAAK;IACpC,MAAM,OAAO,SAAS;IACtB,MAAM,MAAM,KAAK,MAAM,EAAE;IACzB,MAAM,eAAe,mBAAmB,KAAK,MAAM,GAAG,SAAS;AAC/D,UAAM,IAAI,KAAK,aAAa;AAC5B,iBAAa,KAAK,aAAa,MAAM;AACrC,gBAAY,KAAK;;AAGnB,OAAI,qBAAqB;AACvB,sBAAkB,aAAa,YAAY,KAAK,GAAG,iBAAiB;AACpE,uBAAmB;;AAGrB,YAAS,gBAAgB;AACzB,YAAS,sBAAsB;AAC/B,YAAS,qBAAqB;AAC9B,YAAS,kBAAkB;AAE3B,UAAO;;;AAQX,KAAI,SAAS,QAAQ;AACnB,MAAI,WAAW,SAAS,GAAG;GACzB,IAAI,eAAe;AAEnB,QAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IAE1B,KADgB,KAAK,SAAS,IAAI,EAC9B,KAAY,YAAY,IAAI;AAC9B,mBAAe;AACf;;AAIJ,OAAI,iBAAiB,IAAI;IACvB,IAAI,sBAAsB;AAC1B,SAAK,IAAI,IAAI,cAAc,IAAI,QAAQ,IAErC,KADgB,KAAK,SAAS,IAAI,EAC9B,KAAY,YAAY,IAAI,IAAI;AAClC,2BAAsB;AACtB;;AAIJ,QAAI,qBAAqB;AACvB,yBAAoB,aAAa;AACjC,cAAS,qBAAqB;KAE9B,MAAM,eAAe,SAAS;AAC9B,kBAAa,SAAS;KACtB,MAAM,eAAyB,EAAE;AAEjC,UAAK,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,IAAI;AAC/B,uBAAiB,aAAa;MAE9B,MAAM,cAAc,SAAS,SAAS;MACtC,MAAM,iBAAiB,SAAS,MAAM;MACtC,MAAM,eAAe,SAAS,YAAY,MAAM,KAAK;AAErD,UAAI,YACF,oBAAmB,UAAU,UAAU,KAAK;AAG9C,UAAI,gBAAgB,SAAS,YAAY,aACvC,UAAS,YAAY,IAAI,EAAE;AAG7B,UACE,eACA,gBACA,kBACA,SAAS,MAAM,eAEf,cAAa,KAAK,EAAE;AAGtB,mBAAa,KAAK,SAAS,MAAM;;KAGnC,MAAM,aAAa,YAAY;KAC/B,MAAM,cAAc,MAAM,IAAI,WAAW;AACzC,SAAI,aAAa;AACf,0BAAoB,UAAU,aAAa,WAAW;AACtD,YAAM,OAAO,WAAW;;KAG1B,MAAM,kBAAkB,YAAY,MAAM,GAAG,OAAO;AACpD,UAAK,IAAI,IAAI,cAAc,IAAI,QAAQ,IACrC,iBAAgB,KAAK,YAAY,IAAI;AAEvC,cAAS,cAAc;AAEvB,SAAI,qBAAqB;AACvB,wBACE,aACA,YAAY,KAAK,GAAG,iBACrB;AACD,yBAAmB;;AAGrB,cAAS,sBAAsB;AAC/B,cAAS,qBAAqB;AAC9B,cAAS,kBAAkB;AAE3B,YAAO;;;;EAKb,IAAI,qBAAqB;AACzB,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IAE1B,KADY,KAAK,SAAS,IAAI,EAC1B,KAAQ,YAAY,IAAI;AAC1B,wBAAqB;AACrB;;AAIJ,MAAI,oBAAoB;AACtB,uBAAoB,WAAW;AAC/B,YAAS,qBAAqB;GAC9B,MAAM,eAAe,SAAS;AAC9B,gBAAa,SAAS;GACtB,MAAM,cAAc,WAAW;AAG/B,QAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;IAC/B,MAAM,OAAO,SAAS;IACtB,MAAM,MAAM,YAAY;IACxB,MAAM,WAAW,MAAM,IAAI,IAAI;AAC/B,qBAAiB,aAAa;AAE9B,uBAAmB,UAAU,UAAU,KAAK;AAE5C,iBAAa,KAAK,SAAS,MAAM;;AAInC,QAAK,IAAI,IAAI,QAAQ,IAAI,QAAQ,KAAK;IACpC,MAAM,MAAM,YAAY;IACxB,MAAM,eAAe,MAAM,IAAI,IAAI;AACnC,QAAI,cAAc;AAChB,yBACE,UACA,cACA,cAAc,eAAe,WAC9B;AACD,WAAM,OAAO,IAAI;;;AAIrB,eAAY,SAAS;AACrB,YAAS,cAAc;AAEvB,OAAI,qBAAqB;AACvB,sBAAkB,aAAa,YAAY,KAAK,GAAG,iBAAiB;AACpE,uBAAmB;;AAGrB,YAAS,gBAAgB;AACzB,YAAS,sBAAsB;AAC/B,YAAS,qBAAqB;AAC9B,YAAS,kBAAkB;AAE3B,UAAO;;;AAQX,KAAI,WAAW,QAAQ;EACrB,IAAI,sBAAsB;AAC1B,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IAE1B,KADY,KAAK,SAAS,IAAI,EAC1B,KAAQ,YAAY,IAAI;AAC1B,yBAAsB;AACtB;;AAIJ,MAAI,qBAAqB;AACvB,uBAAoB,aAAa;AACjC,YAAS,qBAAqB;GAC9B,MAAM,eAAe,SAAS;AAC9B,gBAAa,SAAS;GACtB,MAAM,eAAyB,EAAE;AAGjC,QAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;IAC/B,MAAM,OAAO,SAAS;IACtB,MAAM,MAAM,YAAY;IACxB,MAAM,WAAW,MAAM,IAAI,IAAI;AAC/B,qBAAiB,aAAa;IAE9B,MAAM,cAAc,SAAS,SAAS;IACtC,MAAM,iBAAiB,SAAS,MAAM;IACtC,IAAI,aAAa;AAEjB,QAAI,YACF,cAAa,mBAAmB,UAAU,UAAU,KAAK;AAG3D,QAAI,cAAc,kBAAkB,SAAS,MAAM,eACjD,cAAa,KAAK,EAAE;AAGtB,iBAAa,KAAK,SAAS,MAAM;;AAGnC,OAAI,qBAAqB;AACvB,sBAAkB,aAAa,YAAY,KAAK,GAAG,iBAAiB;AACpE,uBAAmB;;AAGrB,YAAS,sBAAsB;AAC/B,YAAS,qBAAqB;AAC9B,YAAS,kBAAkB;AAE3B,UAAO;;EAGT,IAAI,gBAAgB;EACpB,IAAI,iBAAiB;EACrB,IAAI,mBAA2C;EAC/C,IAAI,oBAA4C;EAChD,IAAI,gBAAgB;EACpB,IAAI,iBAAiB;AAErB,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;GAC/B,MAAM,OAAO,SAAS;GACtB,MAAM,MAAM,KAAK,SAAS,IAAI,EAAE;AAChC,OAAI,QAAQ,YAAY,IAAI;IAC1B,MAAM,WAAW,MAAM,IAAI,IAAI;AAC/B,QAAI,YAAY,SAAS,SAAS,MAAM;AACtC,sBAAiB;AACjB;;AAEF;;AAGF;AACA,OAAI,kBAAkB,IAAI;AACxB,oBAAgB;AAChB,uBAAmB;AACnB;;AAGF,OAAI,mBAAmB,IAAI;AACzB,qBAAiB;AACjB,wBAAoB;AACpB;;AAGF,mBAAgB;AAChB;;AAGF,MACE,kBACA,kBAAkB,KAClB,kBAAkB,MAClB,mBAAmB,MACnB,qBAAqB,YAAY,mBACjC,sBAAsB,YAAY,gBAClC;AACA,uBAAoB,OAAO;AAC3B,oBAAiB,YAAY;AAC7B,oBAAiB,YAAY;AAE7B,YAAS,qBAAqB;GAE9B,MAAM,kBAAkB,YAAY,OAAO;AAC3C,mBAAgB,iBAAiB;AACjC,mBAAgB,kBAAkB;GAElC,MAAM,eAAe,SAAS;GAC9B,MAAM,gBAAgB,MAAM,IAAI,iBAAiB;GACjD,MAAM,iBAAiB,MAAM,IAAI,kBAAkB;GACnD,MAAM,YAAY,SAAS;GAC3B,MAAM,aAAa,SAAS;AAE5B,oBAAiB,aAAa;AAC9B,oBAAiB,aAAa;AAE9B,OAAI,cAAc,SAAS,UACzB,oBAAmB,UAAU,eAAe,UAAU;AAGxD,OAAI,eAAe,SAAS,WAC1B,oBAAmB,UAAU,gBAAgB,WAAW;AAG1D,OACE,cAAc,YAAY,gBAC1B,cAAc,YAAY,MAAM,KAAK,cAErC,eAAc,YAAY,IAAI,cAAc;AAG9C,OACE,eAAe,YAAY,gBAC3B,eAAe,YAAY,MAAM,KAAK,eAEtC,gBAAe,YAAY,IAAI,eAAe;AAGhD,gBAAa,iBAAiB,cAAc,MAAM;AAClD,gBAAa,kBAAkB,eAAe,MAAM;AAEpD,YAAS,cAAc;AAEvB,OAAI,qBAAqB;AACvB,sBAAkB,aAAa,YAAY,KAAK,GAAG,iBAAiB;AACpE,uBAAmB;;AAGrB,YAAS,sBAAsB;AAC/B,YAAS,qBAAqB,CAAC,eAAe,eAAe;AAC7D,YAAS,kBAAkB;AAE3B,UAAO;;EAGT,IAAI,qBAAqB;EACzB,MAAM,eAAuC,EAAE;EAC/C,MAAM,iBAA0B,EAAE;AAElC,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;GAC/B,MAAM,OAAO,SAAS;GACtB,MAAM,MAAM,KAAK,MAAM,EAAE;GACzB,MAAM,WAAW,MAAM,IAAI,IAAI;AAE/B,OACE,CAAC,YACD,SAAS,SAAS,QACjB,SAAS,YAAY,gBAAgB,SAAS,YAAY,MAAM,KAAK,GACtE;AACA,yBAAqB;AACrB;;AAGF,gBAAa,KAAK;AAClB,kBAAe,KAAK,SAAS,MAAM;AACnC,oBAAiB,aAAa;;AAGhC,MAAI,oBAAoB;AACtB,uBAAoB,aAAa;AACjC,YAAS,qBAAqB;AAC9B,YAAS,cAAc;AACvB,YAAS,gBAAgB;AAEzB,OAAI,qBAAqB;AACvB,sBAAkB,aAAa,YAAY,KAAK,GAAG,iBAAiB;AACpE,uBAAmB;;AAGrB,YAAS,sBAAsB;AAC/B,YAAS,qBAAqB;AAC9B,YAAS,kBAAkB;AAE3B,UAAO;;;AAQX,qBAAoB,aAAa;AACjC,UAAS,qBAAqB;CAE9B,MAAM,WAAW,IAAI,IAAI,YAAY;CACrC,MAAM,iBAAyC,EAAE;CACjD,MAAM,eAAwB,EAAE;CAChC,IAAI,WAAW,SAAS,SAAS,SAAS;AAG1C,MAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,OAAO,SAAS;EACtB,MAAM,MAAM,KAAK,MAAM,EAAE;AACzB,mBAAiB,YAAY;AAE7B,WAAS,OAAO,IAAI;AACpB,iBAAe,KAAK,IAAI;EAExB,MAAM,WAAW,MAAM,IAAI,IAAI;AAC/B,mBAAiB,WAAW,WAAW,UAAU;AAEjD,MAAI,CAAC,UAAU;GAEb,MAAM,eAAe,mBAAmB,KAAK,MAAM,GAAG,SAAS;AAC/D,SAAM,IAAI,KAAK,aAAa;AAC5B,gBAAa,KAAK,aAAa,MAAM,MAAe;SAC/C;AAEL,oBAAiB,aAAa;GAC9B,MAAM,cAAc,SAAS,SAAS;GACtC,MAAM,eACJ,SAAS,YAAY,gBAAgB,SAAS,YAAY,MAAM,KAAK;AAEvE,OAAI,aAAa;AACf,eAAW;AACX,uBAAmB,UAAU,UAAU,KAAK;;AAG9C,OAAI,aAEF,UAAS,YAAY,IAAI,EAAE;AAG7B,gBAAa,KAAK,SAAS,MAAM,MAAe;;;AAKpD,MAAK,MAAM,OAAO,UAAU;AAC1B,aAAW;EACX,MAAM,eAAe,MAAM,IAAI,IAAI;AACnC,MAAI,cAAc;AAChB,uBAAoB,UAAU,cAAc,OAAO;AACnD,SAAM,OAAO,IAAI;;;AAIrB,UAAS,cAAc;AAGvB,KAAI,qBAAqB;AACvB,oBAAkB,aAAa,YAAY,KAAK,GAAG,iBAAiB;AACpE,qBAAmB;;AAGrB,UAAS,gBAAgB;AACzB,UAAS,sBAAsB;AAC/B,UAAS,qBAAqB;AAC9B,UAAS,kBAAkB;AAE3B,QAAO;;AAGT,SAAgB,iBAAoB,UAAgC;AAClE,KAAI,CAAC,MAAM,QAAQ,SAAS,aAAa,CACvC,OAAM,IAAI,MAAM,uCAAuC;AAGzD,UAAS,wBAAwB;AACjC,QAAO,kBAAkB,UAAU,SAAS,aAAa;;AAG3D,SAAgB,uBAA0B,UAA6B;AACrE,MAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;EACpD,MAAM,MAAM,SAAS,YAAY;EACjC,MAAM,eAAe,SAAS,MAAM,IAAI,IAAI;AAC5C,MAAI,aACF,cAAa,MAAM,iBAAiB;;AAGxC,KAAI,SAAS,cACX,UAAS,cAAc,iBAAiB;AAE1C,UAAS,mBAAmB,EAAE;AAC9B,UAAS,sBAAsB;AAC/B,UAAS,qBAAqB;AAC9B,UAAS,kBAAkB;AAC3B,UAAS,wBAAwB"}
+{"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(newValue: number | ((prev: number) => number)): 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 = (newValue: number | ((prev: number) => number)) => {\n    const nextValue =\n      typeof newValue === 'function' ? newValue(indexValue) : newValue;\n    if (nextValue !== indexValue) {\n      indexValue = nextValue;\n      markReadableDerivedSubscribersDirty(indexSignal);\n      markReactivePropsDirtySource(indexSignal);\n      notifyReadableReaders(indexSignal);\n    }\n  };\n  indexSignal._hasBeenRead = false;\n\n  return indexSignal;\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 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    propertySignal.set(nextValue, notifyReaders);\n  }\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 =\n              indexSignal._hasBeenRead && indexSignal.peek() !== i;\n\n            if (itemChanged) {\n              updateItemInstance(forState, existing, item);\n            }\n\n            if (indexChanged) {\n              indexSignal.set(i);\n            }\n\n            if (itemChanged || indexChanged || 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      if (\n        firstExisting.indexSignal._hasBeenRead &&\n        firstExisting.indexSignal.peek() !== firstMismatch\n      ) {\n        firstExisting.indexSignal.set(firstMismatch);\n      }\n\n      if (\n        secondExisting.indexSignal._hasBeenRead &&\n        secondExisting.indexSignal.peek() !== secondMismatch\n      ) {\n        secondExisting.indexSignal.set(secondMismatch);\n      }\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      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 =\n        existing.indexSignal._hasBeenRead && 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        existing.indexSignal.set(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,qBAAqB;AA0EjD,MAAM,4BAAY,IAAI,SAGnB;AAEH,SAAS,YACP,UACgC;CAChC,IAAI,QAAQ,UAAU,IAAI,SAAS;CACnC,IAAI,CAAC,OAAO;EACV,wBAAQ,IAAI,KAAK;EACjB,UAAU,IAAI,UAAU,MAAM;;CAEhC,OAAO;;AAGT,SAAgB,eACd,YACA,MACA,UACA,UACa;CACb,MAAM,iBAAiB,oBAAoB;CAE3C,OAAO;EACL,MAAM;EACN,cAAc,EAAE;EAChB;EACA;EACA,eAAe;EACf,uBAAO,IAAI,KAAK;EAChB,aAAa,EAAE;EACf,cAAc,EAAE;EAChB,eAAe,EAAE;EACjB;EACA;EACA;EACA,oBAAoB;EACpB,kBAAkB,EAAE;EACpB,qBAAqB;EACrB,oBAAoB;EACpB,iBAAiB;EACjB,qBAAqB;EACrB,uBAAuB;EACvB,eAAe;EACf,sBAAsB;EACtB,wBAAwB;EACxB,2BAA2B;EAC5B;;AAGH,SAAgB,YACd,YACA,MACA,UACA,UACa;CACb,MAAM,WAAW,oBAAoB;CACrC,IAAI,CAAC,UACH,MAAM,IAAI,MACR,6DACD;CAGH,MAAM,YAAY,eAAe,UAAU,MAAM;CACjD,MAAM,QAAQ,YAAY,SAAS;CACnC,MAAM,WAAW,MAAM,IAAI,UAAU;CAErC,IAAI,UAAU;EACZ,SAAS,aAAa;EACtB,SAAS,OAAO;EAChB,SAAS,WAAW;EACpB,SAAS,WAAW;EACpB,OAAO;;CAGT,MAAM,UAAU,eAAe,YAAY,MAAM,UAAU,SAAS;CACpE,MAAM,IAAI,WAAW,QAA6B;CAElD,CAAC,SAAS,eAAe,EAAE,EAAE,WAAW;EACtC,QAAQ,eAAe,SAAS;EAChC,QAAQ,gBAAgB;EACxB,MAAM,OAAO,UAAU;GACvB;CAEF,OAAO;;AAGT,SAAS,qBAAqB,cAAsC;CAClE,IAAI,aAAa;CACjB,MAAM,0BAAU,IAAI,KAAgC;CAEpD,MAAM,qBAAqB;EACzB,YAAY,eAAe;EAC3B,mBAAmB,YAAY;EAC/B,OAAO;;CAET,YAAY,WAAW;CACvB,YAAY,aAAa;CACzB,YAAY,OAAO,aAAkD;EACnE,MAAM,YACJ,OAAO,aAAa,aAAa,SAAS,WAAW,GAAG;EAC1D,IAAI,cAAc,YAAY;GAC5B,aAAa;GACb,oCAAoC,YAAY;GAChD,6BAA6B,YAAY;GACzC,sBAAsB,YAAY;;;CAGtC,YAAY,eAAe;CAE3B,OAAO;;AAGT,SAAS,oBAAuB,aAAkC;CAChE,IAAI,YAAY;CAChB,MAAM,0BAAU,IAAI,KAAgC;CAEpD,MAAM,oBAAoB;EACxB,WAAW,eAAe;EAC1B,mBAAmB,WAAW;EAC9B,OAAO;;CAGT,WAAW,WAAW;CACtB,WAAW,aAAa;CACxB,WAAW,OAAO,UAAa,gBAAgB,SAAS;EACtD,IAAI,OAAO,GAAG,WAAW,SAAS,EAChC;EAGF,YAAY;EACZ,IAAI,eAAe;GACjB,oCAAoC,WAAW;GAC/C,6BAA6B,WAAW;GACxC,sBAAsB,WAAW;;;CAGrC,WAAW,eAAe;CAE1B,OAAO;;AAGT,SAAS,4BACP,cACuB;CACvB,IAAI,gBAAgB;CACpB,MAAM,0BAAU,IAAI,KAAgC;CAEpD,MAAM,wBAAwB;EAC5B,eAAe,eAAe;EAC9B,mBAAmB,eAAe;EAClC,OAAO;;CAGT,eAAe,WAAW;CAC1B,eAAe,aAAa;CAC5B,eAAe,OAAO,UAAmB,gBAAgB,SAAS;EAChE,IAAI,OAAO,GAAG,eAAe,SAAS,EACpC;EAGF,gBAAgB;EAChB,IAAI,eAAe;GACjB,oCAAoC,eAAe;GACnD,6BAA6B,eAAe;GAC5C,sBAAsB,eAAe;;;CAGzC,eAAe,eAAe;CAE9B,OAAO;;AAGT,SAAS,oBAAoB,MAAe,MAA4B;CACtE,OAAO,QAAQ,IAAI,OAAO,KAAK,EAAE,KAAK;;AAGxC,SAAS,gBAAgB,cAAuB,UAA4B;CAC1E,MAAM,eAAe,QAAQ,QAAQ,OAAO,aAAa,CAAC;CAC1D,MAAM,WAAW,QAAQ,QAAQ,OAAO,SAAS,CAAC;CAElD,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;;AAGT,SAAS,iBACP,OACA,QACS;CACT,OAAO,OAAO,UAAU,IAAI,MAAM,kBAAkB,IAAI;;AAG1D,SAAS,iCACP,MACA,iBACA,MACuB;CACvB,MAAM,iBAAiB,gBAAgB,IAAI,KAAK;CAChD,IAAI,gBACF,OAAO;CAGT,MAAM,iBAAiB,4BACrB,oBAAoB,MAAM,KAAK,CAChC;CACD,gBAAgB,IAAI,MAAM,eAAe;CACzC,OAAO;;AAGT,SAAS,gBAAgB,MAA+B;CACtD,OACG,OAAO,SAAS,YAAY,SAAS,QAAS,OAAO,SAAS;;AAInE,SAAS,sBACP,YACA,iBACG;CAGH,OAAO,IAAI,MAFI,OAAO,OAAO,KAEZ,EAAQ;EACvB,IAAI,QAAQ,MAAM,UAAU;GAE1B,IADsB,QAAQ,yBAAyB,QAAQ,KAC3D,EACF,OAAO,QAAQ,IAAI,QAAQ,MAAM,SAAS;GAG5C,MAAM,cAAc,WAAW,MAAM;GAErC,IAAI,OAAO,SAAS,UAClB,OAAO,iCACL,aACA,iBACA,KACD,EAAE;GAGL,mBAAmB,WAAW;GAC9B,OAAO,QAAQ,IAAI,OAAO,YAAY,EAAE,MAAM,SAAS;;EAEzD,IAAI,QAAQ,MAAM;GAChB,mBAAmB,WAAW;GAC9B,OAAO,QAAQ,UAAU,QAAQ,OAAO,WAAW,MAAM,CAAC;;EAE5D,QAAQ,QAAQ;GACd,mBAAmB,WAAW;GAC9B,MAAM,OAAO,IAAI,IAAqB,QAAQ,QAAQ,OAAO,CAAC;GAC9D,KAAK,MAAM,OAAO,QAAQ,QAAQ,OAAO,WAAW,MAAM,CAAC,CAAC,EAC1D,KAAK,IAAI,IAAI;GAGf,OAAO,MAAM,KAAK,KAAK;;EAEzB,yBAAyB,QAAQ,MAAM;GACrC,mBAAmB,WAAW;GAC9B,MAAM,gBAAgB,QAAQ,yBAAyB,QAAQ,KAAK;GACpE,IAAI,eACF,OAAO;GAGT,OAAO,OAAO,yBAAyB,OAAO,WAAW,MAAM,CAAC,EAAE,KAAK;;EAEzE,iBAAiB;GACf,mBAAmB,WAAW;GAC9B,OAAO,OAAO,eAAe,OAAO,WAAW,MAAM,CAAC,CAAC;;EAE1D,CAAC;;AAGJ,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,EAAE;GAC5B,IAAI,GAAG,MAAM,gBAAgB,QAC3B,GAAG,MAAM,cAAc,OAAO,IAAI;;;;AAM1C,SAAS,gBACP,UACA,OACA,MACA,aACA,KACO;CACP,iBAAiB,aAAa;CAC9B,MAAM,QAAQ,MAAM,aAAa,SAAS,SAAS,MAAM,YAAY,CAAC;CACtE,qBAAqB,KAAK,MAAM;CAChC,OAAO;;AAGT,SAAS,kBAAkB,SAAwB;CACjD,MAAM,IAAI,MAAM,QAAQ;;AAG1B,SAAS,gBAAmB,UAAuB,UAAqB;CACtE,IAAI,CAAC,0BAA0B,EAC7B;CAGF,MAAM,uBAAO,IAAI,KAAsB;CACvC,MAAM,2BAAW,IAAI,KAAkC;CACvD,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,MAAM,SAAS,KAAK,SAAS,IAAI,EAAE;EAEzC,IAAI,QAAQ,QAAQ,QAAQ,QAC1B,kBACE,kGACD;EAGH,IAAI,KAAK,IAAI,IAAI,EACf,kBACE,sCAAsC,OAAO,IAAI,CAAC,kEACnD;EAGH,KAAK,IAAI,IAAI;EAEb,MAAM,YAAY,OAAO,IAAI;EAC7B,MAAM,UAAU,OAAO;EACvB,MAAM,kBAAkB,SAAS,aAAa,IAAI,UAAU;EAC5D,IAAI,mBAAmB,oBAAoB,SACzC,kBACE,mCAAmC,UAAU,uDAC9C;EAEH,SAAS,IAAI,WAAW,QAA+B;;CAGzD,SAAS,cAAc;;AAKzB,SAAS,oBACP,UACA,cACA,YACM;CACN,iBAAiB,cAAc;CAC/B,MAAM,aAAa,aAAa,MAAM;CAEtC,IAAI;EACF,kBAAkB,aAAa,MAAM;UAC9B,KAAK;EACZ,IAAI,0BAA0B,EAC5B,QAAQ,MAAM,wBAAwB,IAAI;;CAI9C,IAAI,CAAC,YACH;CAGF,IAAI,sBAAsB,SACxB;MAAI,eAAe,YACjB,oBAAoB,WAAW;;CAInC,SAAS,iBAAiB,KAAK,WAAW;;AAG5C,SAAgB,mBACd,KACA,MACA,OACA,UACoB;CACpB,iBAAiB,cAAc;CAI/B,MAAM,cAAc,qBAAqB,MAAM;CAC/C,MAAM,aAAa,gBAAgB,KAAK,GAAG,oBAAoB,KAAK,GAAG;CACvE,MAAM,sBAAsB,6BACxB,IAAI,KAAyC,GAC7C;CACJ,MAAM,eACJ,cAAc,sBACV,sBAAsB,YAAY,oBAAoB,GACtD;CACN,IAAI,eAA0C;CAC9C,MAAM,QAAQ,iBAAiB,SAAS,gBAAgB,WAAW;EACjE,IAAI,SAAS,wBAAwB;GACnC,SAAS,wBAAwB;GACjC;;EAGF,MAAM,SAAS,SAAS;EACxB,IAAI,QACF,OAAO,eAAe;GAExB;CAEF,gBAAgB,UAAU,OAAO,cAAc,aAAa,IAAI;CAEhE,eAAe;EACb;EACA;EACA;EACA;EACA;EACA;EACA;EACD;CAED,OAAO;;AAGT,SAAS,qBACP,UACA,cACA,MACM;CACN,gBACE,UACA,aAAa,OACb,MACA,aAAa,aACb,aAAa,IACd;;AAGH,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,KAAK;EAClD,OAAO;;CAGT,MAAM,kBAAkB,aAAa;CACrC,MAAM,yBAAkE,EAAE;CAC1E,IAAI,mBAAmB,gBAAgB,OAAO,GAC5C,KAAK,MAAM,CAAC,MAAM,mBAAmB,iBAAiB;EACpD,MAAM,gBAAgB,oBAAoB,cAAc,KAAK;EAC7D,MAAM,YAAY,oBAAoB,MAAM,KAAK;EACjD,IAAI,OAAO,GAAG,eAAe,UAAU,EACrC;EAGF,IAAI,iBAAiB,OAAO,eAAe,EACzC,0BAA0B;EAG5B,uBAAuB,KAAK,CAAC,gBAAgB,UAAU,CAAC;;CAI5D,IAAI,iBAAiB,OAAO,WAAW,EACrC,0BAA0B;CAG5B,MAAM,mBACJ,uBAAuB,WAAW,KAAK,CAAC,gBAAgB,cAAc,KAAK;CAC7E,MAAM,gBACJ,CAAC,4BACA,uBAAuB,SAAS,KAAK;CACxC,MAAM,gBACJ,2BACA,uBAAuB,SAAS,KAChC;CACF,KAAK,MAAM,CAAC,gBAAgB,cAAc,wBACxC,eAAe,IAAI,WAAW,cAAc;CAE9C,WAAW,IAAI,MAAM,cAAc;CAEnC,IAAI,yBACF,qBAAqB,UAAU,cAAc,aAAa,aAAa;CAGzE,OAAO;;AAGT,MAAM,yBAAyB;AAE/B,SAAS,qBACP,UACA,YACM;CACN,MAAM,gBAAgB,SAAS;CAC/B,IAAI,CAAC,eACH;CAGF,MAAM,aAAa,cAAc;CACjC,kBAAkB,cAAc;CAChC,SAAS,gBAAgB;CAEzB,IAAI,CAAC,YACH;CAGF,IAAI,sBAAsB,SACxB;MAAI,eAAe,YACjB,oBAAoB,WAAW;;CAInC,SAAS,iBAAiB,KAAK,WAAW;;AAG5C,SAAS,oBAAuB,UAAgC;CAC9D,IAAI,SAAS,YAAY,QAAQ,SAAS,aAAa,OAAO;EAC5D,IAAI,SAAS,eACX,qBAAqB,UAAU,OAAO;EAExC,SAAS,gBAAgB,EAAE;EAC3B,SAAS,eAAe,EAAE;EAC1B,OAAO,EAAE;;CAGX,MAAM,gBACJ,SAAS,iBACT,iBAAiB,SAAS,gBAAgB,8BAA8B;EACtE,IAAI,SAAS,wBAAwB;GACnC,SAAS,wBAAwB;GACjC;;EAGF,SAAS,gBAAgB,eAAe;GACxC;CACJ,SAAS,gBAAgB;CAEzB,MAAM,QAAQ,cAAc,aAAa,SAAS,SAAkB;CACpE,SAAS,gBAAgB,SAAS,QAAQ,UAAU,QAAQ,EAAE,GAAG,CAAC,MAAM;CACxE,SAAS,eAAe,EAAE;CAC1B,OAAO,SAAS;;AAGlB,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,IAAI;EACnC,IAAI,CAAC,cACH;EAEF,oBAAoB,UAAU,cAAc,WAAW;EACvD,MAAM,OAAO,IAAI;;CAEnB,YAAY,SAAS;CACrB,SAAS,cAAc;;AAGzB,SAAgB,kBACd,UACA,UACS;CACT,SAAS,eAAe;CACxB,gBAAgB,UAAU,SAAS;CAEnC,IAAI,qBACF,mBAAmB;CAGrB,MAAM,mBAAmB,sBAAsB,YAAY,KAAK,GAAG;CAEnE,MAAM,EAAE,OAAO,aAAa,SAAS;CACrC,MAAM,SAAS,YAAY;CAC3B,MAAM,SAAS,SAAS;CACxB,SAAS,mBAAmB,EAAE;CAE9B,IAAI,WAAW,GAAG;EAChB,IAAI,SAAS,GACX,gBAAgB,UAAU,SAAS,WAAW,aAAa,OAAO;EAEpE,oBAAoB,WAAW;EAC/B,SAAS,qBAAqB;EAC9B,SAAS,sBAAsB;EAC/B,SAAS,qBAAqB;EAC9B,SAAS,kBAAkB;EAE3B,IAAI,qBAAqB;GACvB,kBAAkB,aAAa,YAAY,KAAK,GAAG,iBAAiB;GACpE,mBAAmB;;EAGrB,OAAO,oBAAoB,SAAS;;CAGtC,IAAI,SAAS,eACX,qBAAqB,UAAU,OAAO;CAOxC,IAAI,SAAS,QAAQ;EACnB,IAAI,mBAAmB;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAE1B,IADY,KAAK,SAAS,IAAI,EAC1B,KAAQ,YAAY,IAAI;GAC1B,mBAAmB;GACnB;;EAIJ,IAAI,kBAAkB;GACpB,oBAAoB,SAAS;GAC7B,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,IAAI;IAEjD,mBAAmB,UAAU,UAAU,KAAK;IAE5C,YAAY,KAAK;IACjB,aAAa,KAAK,SAAS,MAAM;;GAGnC,iBAAiB,cAAc,OAAO;GAGtC,KAAK,IAAI,IAAI,QAAQ,IAAI,QAAQ,KAAK;IACpC,MAAM,OAAO,SAAS;IACtB,MAAM,MAAM,KAAK,MAAM,EAAE;IACzB,MAAM,eAAe,mBAAmB,KAAK,MAAM,GAAG,SAAS;IAC/D,MAAM,IAAI,KAAK,aAAa;IAC5B,YAAY,KAAK;IACjB,aAAa,KAAK,aAAa,MAAM;IACrC,YAAY,KAAK;;GAGnB,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,KAAK,GAAG,iBAAiB;IACpE,mBAAmB;;GAGrB,SAAS,gBAAgB;GACzB,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB;GAC9B,SAAS,kBAAkB;GAE3B,OAAO;;;CAQX,IAAI,SAAS,QAAQ;EACnB,IAAI,WAAW,SAAS,GAAG;GACzB,IAAI,eAAe;GAEnB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAE1B,IADgB,KAAK,SAAS,IAAI,EAC9B,KAAY,YAAY,IAAI;IAC9B,eAAe;IACf;;GAIJ,IAAI,iBAAiB,IAAI;IACvB,IAAI,sBAAsB;IAC1B,KAAK,IAAI,IAAI,cAAc,IAAI,QAAQ,KAErC,IADgB,KAAK,SAAS,IAAI,EAC9B,KAAY,YAAY,IAAI,IAAI;KAClC,sBAAsB;KACtB;;IAIJ,IAAI,qBAAqB;KACvB,oBAAoB,aAAa;KACjC,SAAS,qBAAqB;KAE9B,MAAM,uBAAuB,SAAS,aAAa,OAAO;KAC1D,MAAM,eAAe,SAAS;KAC9B,MAAM,cAAc,SAAS;KAC7B,aAAa,SAAS;KACtB,YAAY,SAAS;KACrB,MAAM,eAAyB,EAAE;KAEjC,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,IAAI;MAC/B,MAAM,sBAAsB,SAAS,MAAM;MAE3C,MAAM,cAAc,SAAS,SAAS;MACtC,MAAM,cAAc,SAAS;MAC7B,MAAM,eACJ,YAAY,gBAAgB,YAAY,MAAM,KAAK;MAErD,IAAI,aACF,mBAAmB,UAAU,UAAU,KAAK;MAG9C,IAAI,cACF,YAAY,IAAI,EAAE;MAGpB,IAAI,eAAe,gBAAgB,qBACjC,aAAa,KAAK,EAAE;MAGtB,YAAY,KAAK;MACjB,aAAa,KAAK,SAAS,MAAM;;KAGnC,iBAAiB,cAAc,OAAO;KAEtC,MAAM,aAAa,YAAY;KAC/B,MAAM,cAAc,MAAM,IAAI,WAAW;KACzC,IAAI,aAAa;MACf,oBAAoB,UAAU,aAAa,WAAW;MACtD,MAAM,OAAO,WAAW;;KAG1B,MAAM,kBAAkB,YAAY,MAAM,GAAG,OAAO;KACpD,MAAM,mBAAmB,qBAAqB,MAAM,GAAG,OAAO;KAC9D,KAAK,IAAI,IAAI,cAAc,IAAI,QAAQ,KAAK;MAC1C,gBAAgB,KAAK,YAAY,IAAI;MACrC,iBAAiB,KAAK,qBAAqB,IAAI;;KAEjD,SAAS,cAAc;KACvB,SAAS,eAAe;KAExB,IAAI,qBAAqB;MACvB,kBACE,aACA,YAAY,KAAK,GAAG,iBACrB;MACD,mBAAmB;;KAGrB,SAAS,sBAAsB;KAC/B,SAAS,qBAAqB;KAC9B,SAAS,kBAAkB;KAE3B,OAAO;;;;EAKb,IAAI,qBAAqB;EACzB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAE1B,IADY,KAAK,SAAS,IAAI,EAC1B,KAAQ,YAAY,IAAI;GAC1B,qBAAqB;GACrB;;EAIJ,IAAI,oBAAoB;GACtB,oBAAoB,WAAW;GAC/B,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,IAAI;IAE/B,mBAAmB,UAAU,UAAU,KAAK;IAE5C,YAAY,KAAK;IACjB,aAAa,KAAK,SAAS,MAAM;;GAGnC,iBAAiB,cAAc,OAAO;GAGtC,KAAK,IAAI,IAAI,QAAQ,IAAI,QAAQ,KAAK;IACpC,MAAM,MAAM,YAAY;IACxB,MAAM,eAAe,MAAM,IAAI,IAAI;IACnC,IAAI,cAAc;KAChB,oBACE,UACA,cACA,cAAc,eAAe,WAC9B;KACD,MAAM,OAAO,IAAI;;;GAIrB,YAAY,SAAS;GACrB,SAAS,cAAc;GACvB,SAAS,aAAa,SAAS;GAE/B,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,KAAK,GAAG,iBAAiB;IACpE,mBAAmB;;GAGrB,SAAS,gBAAgB;GACzB,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB;GAC9B,SAAS,kBAAkB;GAE3B,OAAO;;;CAQX,IAAI,WAAW,QAAQ;EACrB,IAAI,sBAAsB;EAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAE1B,IADY,KAAK,SAAS,IAAI,EAC1B,KAAQ,YAAY,IAAI;GAC1B,sBAAsB;GACtB;;EAIJ,IAAI,qBAAqB;GACvB,oBAAoB,aAAa;GACjC,SAAS,qBAAqB;GAC9B,MAAM,eAAe,SAAS;GAC9B,MAAM,cAAc,SAAS;GAC7B,aAAa,SAAS;GACtB,YAAY,SAAS;GACrB,MAAM,eAAyB,EAAE;GAEjC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;IAC/B,MAAM,OAAO,SAAS;IACtB,MAAM,MAAM,YAAY;IACxB,MAAM,WAAW,MAAM,IAAI,IAAI;IAC/B,MAAM,cAAc,SAAS,SAAS;IAEtC,IAAI,aACF,mBAAmB,UAAU,UAAU,KAAK;IAG9C,IAAI,CAAC,eAAe,SAAS,MAAM,gBACjC,aAAa,KAAK,EAAE;IAGtB,YAAY,KAAK;IACjB,aAAa,KAAK,SAAS,MAAM;;GAGnC,iBAAiB,cAAc,OAAO;GAEtC,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,KAAK,GAAG,iBAAiB;IACpE,mBAAmB;;GAGrB,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB;GAC9B,SAAS,kBAAkB;GAE3B,OAAO;;EAGT,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,EAAE;GAChC,IAAI,QAAQ,YAAY,IAAI;IAC1B,MAAM,WAAW,MAAM,IAAI,IAAI;IAC/B,IAAI,YAAY,SAAS,SAAS,MAAM;KACtC,iBAAiB;KACjB;;IAEF;;GAGF;GACA,IAAI,kBAAkB,IAAI;IACxB,gBAAgB;IAChB,mBAAmB;IACnB;;GAGF,IAAI,mBAAmB,IAAI;IACzB,iBAAiB;IACjB,oBAAoB;IACpB;;GAGF,gBAAgB;GAChB;;EAGF,IACE,kBACA,kBAAkB,KAClB,kBAAkB,MAClB,mBAAmB,MACnB,qBAAqB,YAAY,mBACjC,sBAAsB,YAAY,gBAClC;GACA,oBAAoB,OAAO;GAC3B,iBAAiB,YAAY;GAC7B,iBAAiB,YAAY;GAE7B,SAAS,qBAAqB;GAE9B,MAAM,kBAAkB,YAAY,OAAO;GAC3C,gBAAgB,iBAAiB;GACjC,gBAAgB,kBAAkB;GAElC,MAAM,eAAe,SAAS;GAC9B,MAAM,gBAAgB,MAAM,IAAI,iBAAiB;GACjD,MAAM,iBAAiB,MAAM,IAAI,kBAAkB;GACnD,MAAM,YAAY,SAAS;GAC3B,MAAM,aAAa,SAAS;GAC5B,MAAM,mBAAmB,SAAS,aAAa,OAAO;GACtD,iBAAiB,iBAAiB;GAClC,iBAAiB,kBAAkB;GAEnC,iBAAiB,aAAa;GAC9B,iBAAiB,aAAa;GAE9B,IAAI,cAAc,SAAS,WACzB,mBAAmB,UAAU,eAAe,UAAU;GAGxD,IAAI,eAAe,SAAS,YAC1B,mBAAmB,UAAU,gBAAgB,WAAW;GAG1D,IACE,cAAc,YAAY,gBAC1B,cAAc,YAAY,MAAM,KAAK,eAErC,cAAc,YAAY,IAAI,cAAc;GAG9C,IACE,eAAe,YAAY,gBAC3B,eAAe,YAAY,MAAM,KAAK,gBAEtC,eAAe,YAAY,IAAI,eAAe;GAGhD,aAAa,iBAAiB,cAAc,MAAM;GAClD,aAAa,kBAAkB,eAAe,MAAM;GAEpD,SAAS,cAAc;GACvB,SAAS,eAAe;GAExB,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,KAAK,GAAG,iBAAiB;IACpE,mBAAmB;;GAGrB,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB,CAAC,eAAe,eAAe;GAC7D,SAAS,kBAAkB;GAE3B,OAAO;;EAGT,IAAI,qBAAqB;EACzB,MAAM,eAAuC,EAAE;EAC/C,MAAM,gBAAsC,EAAE;EAC9C,MAAM,iBAA0B,EAAE;EAElC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;GAC/B,MAAM,OAAO,SAAS;GACtB,MAAM,MAAM,KAAK,MAAM,EAAE;GACzB,MAAM,WAAW,MAAM,IAAI,IAAI;GAE/B,IACE,CAAC,YACD,SAAS,SAAS,QACjB,SAAS,YAAY,gBAAgB,SAAS,YAAY,MAAM,KAAK,GACtE;IACA,qBAAqB;IACrB;;GAGF,aAAa,KAAK;GAClB,cAAc,KAAK;GACnB,eAAe,KAAK,SAAS,MAAM;GACnC,iBAAiB,aAAa;;EAGhC,IAAI,oBAAoB;GACtB,oBAAoB,aAAa;GACjC,SAAS,qBAAqB;GAC9B,SAAS,cAAc;GACvB,SAAS,eAAe;GACxB,SAAS,gBAAgB;GAEzB,IAAI,qBAAqB;IACvB,kBAAkB,aAAa,YAAY,KAAK,GAAG,iBAAiB;IACpE,mBAAmB;;GAGrB,SAAS,sBAAsB;GAC/B,SAAS,qBAAqB;GAC9B,SAAS,kBAAkB;GAE3B,OAAO;;;CAQX,oBAAoB,aAAa;CACjC,SAAS,qBAAqB;CAE9B,MAAM,WAAW,IAAI,IAAI,YAAY;CACrC,MAAM,iBAAyC,EAAE;CACjD,MAAM,kBAAwC,EAAE;CAChD,MAAM,eAAwB,EAAE;CAChC,IAAI,WAAW,SAAS,SAAS,SAAS;CAG1C,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,OAAO,SAAS;EACtB,MAAM,MAAM,KAAK,MAAM,EAAE;EACzB,iBAAiB,YAAY;EAE7B,SAAS,OAAO,IAAI;EACpB,eAAe,KAAK,IAAI;EAExB,MAAM,WAAW,MAAM,IAAI,IAAI;EAC/B,iBAAiB,WAAW,WAAW,UAAU;EAEjD,IAAI,CAAC,UAAU;GAEb,MAAM,eAAe,mBAAmB,KAAK,MAAM,GAAG,SAAS;GAC/D,MAAM,IAAI,KAAK,aAAa;GAC5B,gBAAgB,KAAK,aAAa;GAClC,aAAa,KAAK,aAAa,MAAM,MAAe;SAC/C;GAEL,iBAAiB,aAAa;GAC9B,MAAM,cAAc,SAAS,SAAS;GACtC,MAAM,eACJ,SAAS,YAAY,gBAAgB,SAAS,YAAY,MAAM,KAAK;GAEvE,IAAI,aAAa;IACf,WAAW;IACX,mBAAmB,UAAU,UAAU,KAAK;;GAG9C,IAAI,cAEF,SAAS,YAAY,IAAI,EAAE;GAG7B,gBAAgB,KAAK,SAAS;GAC9B,aAAa,KAAK,SAAS,MAAM,MAAe;;;CAKpD,KAAK,MAAM,OAAO,UAAU;EAC1B,WAAW;EACX,MAAM,eAAe,MAAM,IAAI,IAAI;EACnC,IAAI,cAAc;GAChB,oBAAoB,UAAU,cAAc,OAAO;GACnD,MAAM,OAAO,IAAI;;;CAIrB,SAAS,cAAc;CACvB,SAAS,eAAe;CAGxB,IAAI,qBAAqB;EACvB,kBAAkB,aAAa,YAAY,KAAK,GAAG,iBAAiB;EACpE,mBAAmB;;CAGrB,SAAS,gBAAgB;CACzB,SAAS,sBAAsB;CAC/B,SAAS,qBAAqB;CAC9B,SAAS,kBAAkB;CAE3B,OAAO;;AAGT,SAAgB,iBAAoB,UAAgC;CAClE,IAAI,CAAC,MAAM,QAAQ,SAAS,aAAa,EACvC,MAAM,IAAI,MAAM,uCAAuC;CAGzD,SAAS,wBAAwB;CACjC,OAAO,kBAAkB,UAAU,SAAS,aAAa;;AAG3D,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;;MAIxC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;EACpD,MAAM,MAAM,SAAS,YAAY;EACjC,MAAM,eAAe,SAAS,MAAM,IAAI,IAAI;EAC5C,IAAI,cACF,aAAa,MAAM,iBAAiB;;CAK1C,IAAI,SAAS,eACX,SAAS,cAAc,iBAAiB;CAE1C,SAAS,mBAAmB,EAAE;CAC9B,SAAS,sBAAsB;CAC/B,SAAS,qBAAqB;CAC9B,SAAS,kBAAkB;CAC3B,SAAS,wBAAwB;CACjC,SAAS,sBAAsB,SAAS,YAAY,SAAS"}

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

@@ -1 +1 @@
-{"version":3,"file":"operations.d.ts","names":[],"sources":["../../src/runtime/operations.ts"],"mappings":";UAYiB,cAAA;EACf,KAAA,EAAO,CAAA;EACP,OAAA;EACA,KAAA,EAAO,KAAA;EACP,OAAA;AAAA;;;;;;;;;AAaF;;iBAAgB,QAAA,GAAA,CACd,EAAA,GAAK,IAAA;EAAQ,MAAA,EAAQ,WAAA;AAAA,MAAkB,OAAA,CAAQ,CAAA,IAAK,CAAA,EACpD,IAAA,eACC,cAAA,CAAe,CAAA;AAAA,iBAsNF,EAAA,CACd,MAAA,EAAQ,WAAA,EACR,KAAA,UACA,OAAA,EAAS,aAAA;AAAA,iBAiBK,KAAA,CAAM,UAAA,UAAoB,EAAA;AAAA,iBAgB1B,MAAA,GAAA,CACd,OAAA,WACA,QAAA,GAAW,MAAA;EACR,KAAA,EAAO,CAAA;EAAU,OAAA;EAAkB,KAAA,EAAO,KAAA;AAAA;AAAA,iBAK/B,IAAA,CACd,EAAA,8BAAgC,OAAA;;;;;;;;;;;iBAwBlB,OAAA,GAAA,CAAW,EAAA,QAAU,CAAA,SAAU,CAAA"}
+{"version":3,"file":"operations.d.ts","names":[],"sources":["../../src/runtime/operations.ts"],"mappings":";UAaiB,cAAA;EACf,KAAA,EAAO,CAAA;EACP,OAAA;EACA,KAAA,EAAO,KAAA;EACP,OAAA;AAAA;;;;;;;;;AAaF;;iBAAgB,QAAA,GAAA,CACd,EAAA,GAAK,IAAA;EAAQ,MAAA,EAAQ,WAAA;AAAA,MAAkB,OAAA,CAAQ,CAAA,IAAK,CAAA,EACpD,IAAA,eACC,cAAA,CAAe,CAAA;AAAA,iBAsNF,EAAA,CACd,MAAA,EAAQ,WAAA,EACR,KAAA,UACA,OAAA,EAAS,aAAA;AAAA,iBAiBK,KAAA,CAAM,UAAA,UAAoB,EAAA;AAAA,iBAgB1B,MAAA,GAAA,CACd,OAAA,WACA,QAAA,GAAW,MAAA;EACR,KAAA,EAAO,CAAA;EAAU,OAAA;EAAkB,KAAA,EAAO,KAAA;AAAA;AAAA,iBAK/B,IAAA,CACd,EAAA,8BAAgC,OAAA;;;;;;;;;;;iBAwBlB,OAAA,GAAA,CAAW,EAAA,QAAU,CAAA,SAAU,CAAA"}