@askrjs/askr 0.0.48 → 0.0.50

package/dist/renderer/for-commit-dom-map.js

@@ -0,0 +1,83 @@
+import { keyedElements } from "./keyed.js";
+//#region src/renderer/for-commit-dom-map.ts
+function getOrBuildDomKeyMap(parent) {
+	let keyMap = keyedElements.get(parent);
+	if (!keyMap) {
+		keyMap = /* @__PURE__ */ new Map();
+		for (let child = parent.firstElementChild; child; child = child.nextElementSibling) {
+			const key = child.getAttribute("data-key");
+			if (key !== null) {
+				keyMap.set(key, child);
+				const numericKey = Number(key);
+				if (!Number.isNaN(numericKey)) keyMap.set(numericKey, child);
+			}
+		}
+		if (keyMap.size > 0) keyedElements.set(parent, keyMap);
+	}
+	return keyMap.size > 0 ? keyMap : void 0;
+}
+function hydrateExistingForDomInOrder(parent, forState) {
+	if (parent.children.length !== forState.orderedKeys.length) return false;
+	for (let i = 0; i < forState.orderedKeys.length; i += 1) {
+		const itemKey = forState.orderedKeys[i];
+		const itemInstance = forState.items.get(itemKey);
+		const currentDom = parent.children[i];
+		if (!itemInstance || currentDom.getAttribute("data-key") !== String(itemKey)) return false;
+		itemInstance.scope.dom = currentDom;
+		itemInstance.scope.needsDomUpdate = true;
+	}
+	return true;
+}
+function syncKeyedMapFromForState(parent, forState, strategy, removedNodes) {
+	const existing = keyedElements.get(parent);
+	const ensureMapEntry = (map, key, element) => {
+		map.set(key, element);
+		const keyString = String(key);
+		map.set(keyString, element);
+		const keyNumber = Number(keyString);
+		if (!Number.isNaN(keyNumber)) map.set(keyNumber, element);
+	};
+	if (strategy === "SWAP") {
+		if (existing) return;
+	}
+	if (strategy === "FULL_KEYED" && existing && removedNodes.length === 0) return;
+	if (strategy === "NO_REORDER") {
+		if (existing && removedNodes.length === 0) return;
+		if (existing) {
+			for (const [mapKey, element] of existing) if (element.parentNode !== parent) existing.delete(mapKey);
+			if (existing.size > 0) keyedElements.set(parent, existing);
+			else keyedElements.delete(parent);
+			return;
+		}
+	}
+	if (strategy === "TRUNCATE" && forState.orderedKeys.length === 0) {
+		if (existing) existing.clear();
+		keyedElements.delete(parent);
+		return;
+	}
+	if (strategy === "APPEND" && existing) {
+		for (let i = 0; i < forState.orderedKeys.length; i++) {
+			const key = forState.orderedKeys[i];
+			if (key === null || existing.has(key)) continue;
+			const itemInstance = forState.items.get(key);
+			if (itemInstance?.scope.dom instanceof Element) ensureMapEntry(existing, key, itemInstance.scope.dom);
+		}
+		if (existing.size > 0) keyedElements.set(parent, existing);
+		else keyedElements.delete(parent);
+		return;
+	}
+	const nextMap = existing ?? /* @__PURE__ */ new Map();
+	nextMap.clear();
+	for (let i = 0; i < forState.orderedKeys.length; i++) {
+		const key = forState.orderedKeys[i];
+		if (key === null) continue;
+		const itemInstance = forState.items.get(key);
+		if (itemInstance?.scope.dom instanceof Element) ensureMapEntry(nextMap, key, itemInstance.scope.dom);
+	}
+	if (nextMap.size > 0) keyedElements.set(parent, nextMap);
+	else keyedElements.delete(parent);
+}
+//#endregion
+export { getOrBuildDomKeyMap, hydrateExistingForDomInOrder, syncKeyedMapFromForState };
+
+//# sourceMappingURL=for-commit-dom-map.js.map

package/dist/renderer/for-commit-dom-map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"for-commit-dom-map.js","names":[],"sources":["../../src/renderer/for-commit-dom-map.ts"],"sourcesContent":["import type { ForCommitStrategy, ForState } from '../runtime/for';\nimport { keyedElements } from './keyed';\n\nexport function getOrBuildDomKeyMap(\n  parent: Element\n): Map<string | number, Element> | undefined {\n  let keyMap = keyedElements.get(parent);\n  if (!keyMap) {\n    keyMap = new Map<string | number, Element>();\n    for (\n      let child = parent.firstElementChild;\n      child;\n      child = child.nextElementSibling\n    ) {\n      const key = child.getAttribute('data-key');\n      if (key !== null) {\n        keyMap.set(key, child);\n        const numericKey = Number(key);\n        if (!Number.isNaN(numericKey)) {\n          keyMap.set(numericKey, child);\n        }\n      }\n    }\n    if (keyMap.size > 0) {\n      keyedElements.set(parent, keyMap);\n    }\n  }\n  return keyMap.size > 0 ? keyMap : undefined;\n}\n\nexport function hydrateExistingForDomInOrder(\n  parent: Element,\n  forState: ForState<unknown>\n): boolean {\n  if (parent.children.length !== forState.orderedKeys.length) {\n    return false;\n  }\n\n  for (let i = 0; i < forState.orderedKeys.length; i += 1) {\n    const itemKey = forState.orderedKeys[i];\n    const itemInstance = forState.items.get(itemKey);\n    const currentDom = parent.children[i];\n\n    if (\n      !itemInstance ||\n      currentDom.getAttribute('data-key') !== String(itemKey)\n    ) {\n      return false;\n    }\n\n    itemInstance.scope.dom = currentDom;\n    itemInstance.scope.needsDomUpdate = true;\n  }\n\n  return true;\n}\n\nexport function syncKeyedMapFromForState(\n  parent: Element,\n  forState: ForState<unknown>,\n  strategy: ForCommitStrategy,\n  removedNodes: Node[]\n): void {\n  const existing = keyedElements.get(parent);\n  const ensureMapEntry = (\n    map: Map<string | number, Element>,\n    key: string | number,\n    element: Element\n  ): void => {\n    map.set(key, element);\n    const keyString = String(key);\n    map.set(keyString, element);\n    const keyNumber = Number(keyString);\n    if (!Number.isNaN(keyNumber)) {\n      map.set(keyNumber, element);\n    }\n  };\n\n  if (strategy === 'SWAP') {\n    if (existing) {\n      return;\n    }\n  }\n\n  if (strategy === 'FULL_KEYED' && existing && removedNodes.length === 0) {\n    return;\n  }\n\n  if (strategy === 'NO_REORDER') {\n    if (existing && removedNodes.length === 0) {\n      return;\n    }\n\n    if (existing) {\n      for (const [mapKey, element] of existing) {\n        if (element.parentNode !== parent) {\n          existing.delete(mapKey);\n        }\n      }\n\n      if (existing.size > 0) {\n        keyedElements.set(parent, existing);\n      } else {\n        keyedElements.delete(parent);\n      }\n      return;\n    }\n  }\n\n  if (strategy === 'TRUNCATE' && forState.orderedKeys.length === 0) {\n    if (existing) {\n      existing.clear();\n    }\n    keyedElements.delete(parent);\n    return;\n  }\n\n  if (strategy === 'APPEND' && existing) {\n    for (let i = 0; i < forState.orderedKeys.length; i++) {\n      const key = forState.orderedKeys[i];\n      if (key === null || existing.has(key)) continue;\n      const itemInstance = forState.items.get(key);\n      if (itemInstance?.scope.dom instanceof Element) {\n        ensureMapEntry(existing, key, itemInstance.scope.dom);\n      }\n    }\n\n    if (existing.size > 0) {\n      keyedElements.set(parent, existing);\n    } else {\n      keyedElements.delete(parent);\n    }\n    return;\n  }\n\n  const nextMap = existing ?? new Map<string | number, Element>();\n  nextMap.clear();\n\n  for (let i = 0; i < forState.orderedKeys.length; i++) {\n    const key = forState.orderedKeys[i];\n    if (key === null) continue;\n    const itemInstance = forState.items.get(key);\n    if (itemInstance?.scope.dom instanceof Element) {\n      ensureMapEntry(nextMap, key, itemInstance.scope.dom);\n    }\n  }\n\n  if (nextMap.size > 0) {\n    keyedElements.set(parent, nextMap);\n  } else {\n    keyedElements.delete(parent);\n  }\n}\n"],"mappings":";;AAGA,SAAgB,oBACd,QAC2C;CAC3C,IAAI,SAAS,cAAc,IAAI,MAAM;CACrC,IAAI,CAAC,QAAQ;EACX,yBAAS,IAAI,IAA8B;EAC3C,KACE,IAAI,QAAQ,OAAO,mBACnB,OACA,QAAQ,MAAM,oBACd;GACA,MAAM,MAAM,MAAM,aAAa,UAAU;GACzC,IAAI,QAAQ,MAAM;IAChB,OAAO,IAAI,KAAK,KAAK;IACrB,MAAM,aAAa,OAAO,GAAG;IAC7B,IAAI,CAAC,OAAO,MAAM,UAAU,GAC1B,OAAO,IAAI,YAAY,KAAK;GAEhC;EACF;EACA,IAAI,OAAO,OAAO,GAChB,cAAc,IAAI,QAAQ,MAAM;CAEpC;CACA,OAAO,OAAO,OAAO,IAAI,SAAS;AACpC;AAEA,SAAgB,6BACd,QACA,UACS;CACT,IAAI,OAAO,SAAS,WAAW,SAAS,YAAY,QAClD,OAAO;CAGT,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK,GAAG;EACvD,MAAM,UAAU,SAAS,YAAY;EACrC,MAAM,eAAe,SAAS,MAAM,IAAI,OAAO;EAC/C,MAAM,aAAa,OAAO,SAAS;EAEnC,IACE,CAAC,gBACD,WAAW,aAAa,UAAU,MAAM,OAAO,OAAO,GAEtD,OAAO;EAGT,aAAa,MAAM,MAAM;EACzB,aAAa,MAAM,iBAAiB;CACtC;CAEA,OAAO;AACT;AAEA,SAAgB,yBACd,QACA,UACA,UACA,cACM;CACN,MAAM,WAAW,cAAc,IAAI,MAAM;CACzC,MAAM,kBACJ,KACA,KACA,YACS;EACT,IAAI,IAAI,KAAK,OAAO;EACpB,MAAM,YAAY,OAAO,GAAG;EAC5B,IAAI,IAAI,WAAW,OAAO;EAC1B,MAAM,YAAY,OAAO,SAAS;EAClC,IAAI,CAAC,OAAO,MAAM,SAAS,GACzB,IAAI,IAAI,WAAW,OAAO;CAE9B;CAEA,IAAI,aAAa,QACf;MAAI,UACF;CACF;CAGF,IAAI,aAAa,gBAAgB,YAAY,aAAa,WAAW,GACnE;CAGF,IAAI,aAAa,cAAc;EAC7B,IAAI,YAAY,aAAa,WAAW,GACtC;EAGF,IAAI,UAAU;GACZ,KAAK,MAAM,CAAC,QAAQ,YAAY,UAC9B,IAAI,QAAQ,eAAe,QACzB,SAAS,OAAO,MAAM;GAI1B,IAAI,SAAS,OAAO,GAClB,cAAc,IAAI,QAAQ,QAAQ;QAElC,cAAc,OAAO,MAAM;GAE7B;EACF;CACF;CAEA,IAAI,aAAa,cAAc,SAAS,YAAY,WAAW,GAAG;EAChE,IAAI,UACF,SAAS,MAAM;EAEjB,cAAc,OAAO,MAAM;EAC3B;CACF;CAEA,IAAI,aAAa,YAAY,UAAU;EACrC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;GACpD,MAAM,MAAM,SAAS,YAAY;GACjC,IAAI,QAAQ,QAAQ,SAAS,IAAI,GAAG,GAAG;GACvC,MAAM,eAAe,SAAS,MAAM,IAAI,GAAG;GAC3C,IAAI,cAAc,MAAM,eAAe,SACrC,eAAe,UAAU,KAAK,aAAa,MAAM,GAAG;EAExD;EAEA,IAAI,SAAS,OAAO,GAClB,cAAc,IAAI,QAAQ,QAAQ;OAElC,cAAc,OAAO,MAAM;EAE7B;CACF;CAEA,MAAM,UAAU,4BAAY,IAAI,IAA8B;CAC9D,QAAQ,MAAM;CAEd,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;EACpD,MAAM,MAAM,SAAS,YAAY;EACjC,IAAI,QAAQ,MAAM;EAClB,MAAM,eAAe,SAAS,MAAM,IAAI,GAAG;EAC3C,IAAI,cAAc,MAAM,eAAe,SACrC,eAAe,SAAS,KAAK,aAAa,MAAM,GAAG;CAEvD;CAEA,IAAI,QAAQ,OAAO,GACjB,cAAc,IAAI,QAAQ,OAAO;MAEjC,cAAc,OAAO,MAAM;AAE/B"}

package/dist/renderer/for-commit-removal.js

@@ -0,0 +1,36 @@
+import { teardownNodeSubtree } from "./cleanup.js";
+import { recordBenchCounter, recordBenchEvent, withBenchMetricScope } from "../runtime/for-bench.js";
+import "../runtime/for.js";
+//#region src/renderer/for-commit-removal.ts
+function removeForBoundaryNodes(parent, removedNodes) {
+	if (removedNodes.length > 0 && removedNodes.length === parent.childNodes.length) {
+		let canBulkClear = true;
+		for (let i = 0; i < removedNodes.length; i++) if (removedNodes[i].parentNode !== parent) {
+			canBulkClear = false;
+			break;
+		}
+		if (canBulkClear) {
+			for (let i = 0; i < removedNodes.length; i++) {
+				recordBenchEvent("domRemove");
+				teardownNodeSubtree(removedNodes[i]);
+			}
+			withBenchMetricScope("fullClear", () => {
+				recordBenchCounter("bulkClearCommits");
+				parent.textContent = "";
+			});
+			return;
+		}
+	}
+	for (let i = 0; i < removedNodes.length; i++) {
+		const node = removedNodes[i];
+		if (node.parentNode === parent) {
+			recordBenchEvent("domRemove");
+			teardownNodeSubtree(node);
+			parent.removeChild(node);
+		}
+	}
+}
+//#endregion
+export { removeForBoundaryNodes };
+
+//# sourceMappingURL=for-commit-removal.js.map

package/dist/renderer/for-commit-removal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"for-commit-removal.js","names":[],"sources":["../../src/renderer/for-commit-removal.ts"],"sourcesContent":["import {\n  recordBenchCounter,\n  recordBenchEvent,\n  withBenchMetricScope,\n} from '../runtime/for';\nimport { teardownNodeSubtree } from './cleanup';\n\nexport function removeForBoundaryNodes(\n  parent: Element,\n  removedNodes: Node[]\n): void {\n  if (\n    removedNodes.length > 0 &&\n    removedNodes.length === parent.childNodes.length\n  ) {\n    let canBulkClear = true;\n    for (let i = 0; i < removedNodes.length; i++) {\n      if (removedNodes[i].parentNode !== parent) {\n        canBulkClear = false;\n        break;\n      }\n    }\n\n    if (canBulkClear) {\n      for (let i = 0; i < removedNodes.length; i++) {\n        recordBenchEvent('domRemove');\n        teardownNodeSubtree(removedNodes[i]);\n      }\n      withBenchMetricScope('fullClear', () => {\n        recordBenchCounter('bulkClearCommits');\n        parent.textContent = '';\n      });\n      return;\n    }\n  }\n\n  for (let i = 0; i < removedNodes.length; i++) {\n    const node = removedNodes[i];\n    if (node.parentNode === parent) {\n      recordBenchEvent('domRemove');\n      teardownNodeSubtree(node);\n      parent.removeChild(node);\n    }\n  }\n}\n"],"mappings":";;;;AAOA,SAAgB,uBACd,QACA,cACM;CACN,IACE,aAAa,SAAS,KACtB,aAAa,WAAW,OAAO,WAAW,QAC1C;EACA,IAAI,eAAe;EACnB,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KACvC,IAAI,aAAa,EAAE,CAAC,eAAe,QAAQ;GACzC,eAAe;GACf;EACF;EAGF,IAAI,cAAc;GAChB,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;IAC5C,iBAAiB,WAAW;IAC5B,oBAAoB,aAAa,EAAE;GACrC;GACA,qBAAqB,mBAAmB;IACtC,mBAAmB,kBAAkB;IACrC,OAAO,cAAc;GACvB,CAAC;GACD;EACF;CACF;CAEA,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;EAC5C,MAAM,OAAO,aAAa;EAC1B,IAAI,KAAK,eAAe,QAAQ;GAC9B,iBAAiB,WAAW;GAC5B,oBAAoB,IAAI;GACxB,OAAO,YAAY,IAAI;EACzB;CACF;AACF"}

package/dist/renderer/for-commit-reorder.js

@@ -0,0 +1,89 @@
+import { canUseDirectReplaceChildrenSpread } from "./utils.js";
+import { recordBenchCounter, recordBenchEvent } from "../runtime/for-bench.js";
+import "../runtime/for.js";
+//#region src/renderer/for-commit-reorder.ts
+const DENSE_MOVE_MINIMUM = 64;
+const DENSE_MOVE_RATIO = .75;
+function replaceChildrenInOrder(parent, nodes, allowDirectSpread) {
+	if (allowDirectSpread && canUseDirectReplaceChildrenSpread(nodes.length)) {
+		parent.replaceChildren(...nodes);
+		return;
+	}
+	const fragment = parent.ownerDocument.createDocumentFragment();
+	for (let i = 0; i < nodes.length; i++) fragment.appendChild(nodes[i]);
+	parent.replaceChildren(fragment);
+}
+function getLISIndices(sequence) {
+	if (sequence.length === 0) return [];
+	const predecessors = sequence.slice();
+	const lisIndices = [0];
+	for (let i = 1; i < sequence.length; i += 1) {
+		const current = sequence[i];
+		const lastLisIndex = lisIndices[lisIndices.length - 1];
+		if (sequence[lastLisIndex] < current) {
+			predecessors[i] = lastLisIndex;
+			lisIndices.push(i);
+			continue;
+		}
+		let lo = 0;
+		let hi = lisIndices.length - 1;
+		while (lo < hi) {
+			const mid = lo + hi >> 1;
+			if (sequence[lisIndices[mid]] < current) lo = mid + 1;
+			else hi = mid;
+		}
+		if (current < sequence[lisIndices[lo]]) {
+			if (lo > 0) predecessors[i] = lisIndices[lo - 1];
+			lisIndices[lo] = i;
+		}
+	}
+	let cursor = lisIndices.length - 1;
+	let index = lisIndices[cursor];
+	while (cursor >= 0) {
+		lisIndices[cursor] = index;
+		index = predecessors[index];
+		cursor -= 1;
+	}
+	return lisIndices;
+}
+function commitMoveOnlyReorder(parent, nodes) {
+	const currentNodes = Array.from(parent.childNodes);
+	if (currentNodes.length !== nodes.length) return false;
+	const currentIndexByNode = /* @__PURE__ */ new Map();
+	for (let i = 0; i < currentNodes.length; i += 1) currentIndexByNode.set(currentNodes[i], i);
+	const positions = Array.from({ length: nodes.length }, () => 0);
+	for (let i = 0; i < nodes.length; i += 1) {
+		const position = currentIndexByNode.get(nodes[i]);
+		if (position === void 0) return false;
+		positions[i] = position;
+	}
+	const lisIndices = getLISIndices(positions);
+	if (lisIndices.length === nodes.length) return true;
+	const moveCount = nodes.length - lisIndices.length;
+	if (moveCount >= Math.max(DENSE_MOVE_MINIMUM, Math.floor(nodes.length * DENSE_MOVE_RATIO))) {
+		recordBenchEvent("domMove", moveCount);
+		recordBenchCounter("replaceChildrenCommits");
+		replaceChildrenInOrder(parent, nodes, false);
+		return true;
+	}
+	let lisCursor = lisIndices.length - 1;
+	let anchor = null;
+	for (let i = nodes.length - 1; i >= 0; i -= 1) {
+		const node = nodes[i];
+		if (lisCursor >= 0 && i === lisIndices[lisCursor]) {
+			anchor = node;
+			lisCursor -= 1;
+			continue;
+		}
+		if (node.nextSibling !== anchor) {
+			recordBenchEvent("domMove");
+			parent.insertBefore(node, anchor);
+		}
+		anchor = node;
+	}
+	return true;
+}
+//#endregion
+export { commitMoveOnlyReorder, replaceChildrenInOrder };
+
+//# sourceMappingURL=for-commit-reorder.js.map

package/dist/renderer/for-commit-reorder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"for-commit-reorder.js","names":[],"sources":["../../src/renderer/for-commit-reorder.ts"],"sourcesContent":["import { recordBenchCounter, recordBenchEvent } from '../runtime/for';\nimport { canUseDirectReplaceChildrenSpread } from './utils';\n\nconst DENSE_MOVE_MINIMUM = 64;\nconst DENSE_MOVE_RATIO = 0.75;\n\nexport function replaceChildrenInOrder(\n  parent: Element,\n  nodes: Node[],\n  allowDirectSpread: boolean\n): void {\n  if (allowDirectSpread && canUseDirectReplaceChildrenSpread(nodes.length)) {\n    parent.replaceChildren(...nodes);\n    return;\n  }\n\n  const fragment = parent.ownerDocument.createDocumentFragment();\n  for (let i = 0; i < nodes.length; i++) {\n    fragment.appendChild(nodes[i]);\n  }\n  parent.replaceChildren(fragment);\n}\n\nfunction getLISIndices(sequence: number[]): number[] {\n  if (sequence.length === 0) {\n    return [];\n  }\n\n  const predecessors = sequence.slice();\n  const lisIndices: number[] = [0];\n\n  for (let i = 1; i < sequence.length; i += 1) {\n    const current = sequence[i];\n    const lastLisIndex = lisIndices[lisIndices.length - 1];\n\n    if (sequence[lastLisIndex] < current) {\n      predecessors[i] = lastLisIndex;\n      lisIndices.push(i);\n      continue;\n    }\n\n    let lo = 0;\n    let hi = lisIndices.length - 1;\n    while (lo < hi) {\n      const mid = (lo + hi) >> 1;\n      if (sequence[lisIndices[mid]] < current) {\n        lo = mid + 1;\n      } else {\n        hi = mid;\n      }\n    }\n\n    if (current < sequence[lisIndices[lo]]) {\n      if (lo > 0) {\n        predecessors[i] = lisIndices[lo - 1];\n      }\n      lisIndices[lo] = i;\n    }\n  }\n\n  let cursor = lisIndices.length - 1;\n  let index = lisIndices[cursor];\n  while (cursor >= 0) {\n    lisIndices[cursor] = index;\n    index = predecessors[index];\n    cursor -= 1;\n  }\n\n  return lisIndices;\n}\n\nexport function commitMoveOnlyReorder(parent: Element, nodes: Node[]): boolean {\n  const currentNodes = Array.from(parent.childNodes);\n  if (currentNodes.length !== nodes.length) {\n    return false;\n  }\n\n  const currentIndexByNode = new Map<Node, number>();\n  for (let i = 0; i < currentNodes.length; i += 1) {\n    currentIndexByNode.set(currentNodes[i], i);\n  }\n\n  const positions = Array.from({ length: nodes.length }, () => 0);\n  for (let i = 0; i < nodes.length; i += 1) {\n    const position = currentIndexByNode.get(nodes[i]);\n    if (position === undefined) {\n      return false;\n    }\n    positions[i] = position;\n  }\n\n  const lisIndices = getLISIndices(positions);\n  if (lisIndices.length === nodes.length) {\n    return true;\n  }\n\n  const moveCount = nodes.length - lisIndices.length;\n  const denseMoveThreshold = Math.max(\n    DENSE_MOVE_MINIMUM,\n    Math.floor(nodes.length * DENSE_MOVE_RATIO)\n  );\n\n  if (moveCount >= denseMoveThreshold) {\n    recordBenchEvent('domMove', moveCount);\n    recordBenchCounter('replaceChildrenCommits');\n    replaceChildrenInOrder(parent, nodes, false);\n    return true;\n  }\n\n  let lisCursor = lisIndices.length - 1;\n  let anchor: Node | null = null;\n\n  for (let i = nodes.length - 1; i >= 0; i -= 1) {\n    const node = nodes[i];\n    if (lisCursor >= 0 && i === lisIndices[lisCursor]) {\n      anchor = node;\n      lisCursor -= 1;\n      continue;\n    }\n\n    if (node.nextSibling !== anchor) {\n      recordBenchEvent('domMove');\n      parent.insertBefore(node, anchor);\n    }\n\n    anchor = node;\n  }\n\n  return true;\n}\n"],"mappings":";;;;AAGA,MAAM,qBAAqB;AAC3B,MAAM,mBAAmB;AAEzB,SAAgB,uBACd,QACA,OACA,mBACM;CACN,IAAI,qBAAqB,kCAAkC,MAAM,MAAM,GAAG;EACxE,OAAO,gBAAgB,GAAG,KAAK;EAC/B;CACF;CAEA,MAAM,WAAW,OAAO,cAAc,uBAAuB;CAC7D,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,SAAS,YAAY,MAAM,EAAE;CAE/B,OAAO,gBAAgB,QAAQ;AACjC;AAEA,SAAS,cAAc,UAA8B;CACnD,IAAI,SAAS,WAAW,GACtB,OAAO,CAAC;CAGV,MAAM,eAAe,SAAS,MAAM;CACpC,MAAM,aAAuB,CAAC,CAAC;CAE/B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,GAAG;EAC3C,MAAM,UAAU,SAAS;EACzB,MAAM,eAAe,WAAW,WAAW,SAAS;EAEpD,IAAI,SAAS,gBAAgB,SAAS;GACpC,aAAa,KAAK;GAClB,WAAW,KAAK,CAAC;GACjB;EACF;EAEA,IAAI,KAAK;EACT,IAAI,KAAK,WAAW,SAAS;EAC7B,OAAO,KAAK,IAAI;GACd,MAAM,MAAO,KAAK,MAAO;GACzB,IAAI,SAAS,WAAW,QAAQ,SAC9B,KAAK,MAAM;QAEX,KAAK;EAET;EAEA,IAAI,UAAU,SAAS,WAAW,MAAM;GACtC,IAAI,KAAK,GACP,aAAa,KAAK,WAAW,KAAK;GAEpC,WAAW,MAAM;EACnB;CACF;CAEA,IAAI,SAAS,WAAW,SAAS;CACjC,IAAI,QAAQ,WAAW;CACvB,OAAO,UAAU,GAAG;EAClB,WAAW,UAAU;EACrB,QAAQ,aAAa;EACrB,UAAU;CACZ;CAEA,OAAO;AACT;AAEA,SAAgB,sBAAsB,QAAiB,OAAwB;CAC7E,MAAM,eAAe,MAAM,KAAK,OAAO,UAAU;CACjD,IAAI,aAAa,WAAW,MAAM,QAChC,OAAO;CAGT,MAAM,qCAAqB,IAAI,IAAkB;CACjD,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK,GAC5C,mBAAmB,IAAI,aAAa,IAAI,CAAC;CAG3C,MAAM,YAAY,MAAM,KAAK,EAAE,QAAQ,MAAM,OAAO,SAAS,CAAC;CAC9D,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxC,MAAM,WAAW,mBAAmB,IAAI,MAAM,EAAE;EAChD,IAAI,aAAa,QACf,OAAO;EAET,UAAU,KAAK;CACjB;CAEA,MAAM,aAAa,cAAc,SAAS;CAC1C,IAAI,WAAW,WAAW,MAAM,QAC9B,OAAO;CAGT,MAAM,YAAY,MAAM,SAAS,WAAW;CAM5C,IAAI,aALuB,KAAK,IAC9B,oBACA,KAAK,MAAM,MAAM,SAAS,gBAAgB,CAG3B,GAAoB;EACnC,iBAAiB,WAAW,SAAS;EACrC,mBAAmB,wBAAwB;EAC3C,uBAAuB,QAAQ,OAAO,KAAK;EAC3C,OAAO;CACT;CAEA,IAAI,YAAY,WAAW,SAAS;CACpC,IAAI,SAAsB;CAE1B,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;EAC7C,MAAM,OAAO,MAAM;EACnB,IAAI,aAAa,KAAK,MAAM,WAAW,YAAY;GACjD,SAAS;GACT,aAAa;GACb;EACF;EAEA,IAAI,KAAK,gBAAgB,QAAQ;GAC/B,iBAAiB,SAAS;GAC1B,OAAO,aAAa,MAAM,MAAM;EAClC;EAEA,SAAS;CACX;CAEA,OAAO;AACT"}

package/dist/renderer/for-commit.js

@@ -1,195 +1,13 @@
+import { teardownNodeSubtree } from "./cleanup.js";
 import { canUseDirectReplaceChildrenSpread } from "./utils.js";
 import { keyedElements } from "./keyed.js";
-import { teardownNodeSubtree } from "./cleanup.js";
 import { recordBenchCounter, recordBenchEvent, recordBenchTiming, withBenchMetricScope } from "../runtime/for-bench.js";
-import { clearForDomUpdateState } from "../runtime/for.js";
+import { clearForDomUpdateState } from "../runtime/for-internal.js";
+import "../runtime/for.js";
+import { getOrBuildDomKeyMap, hydrateExistingForDomInOrder, syncKeyedMapFromForState } from "./for-commit-dom-map.js";
+import { commitMoveOnlyReorder, replaceChildrenInOrder } from "./for-commit-reorder.js";
+import { removeForBoundaryNodes } from "./for-commit-removal.js";
 //#region src/renderer/for-commit.ts
-const DENSE_MOVE_MINIMUM = 64;
-const DENSE_MOVE_RATIO = .75;
-function getOrBuildDomKeyMap(parent) {
-	let keyMap = keyedElements.get(parent);
-	if (!keyMap) {
-		keyMap = /* @__PURE__ */ new Map();
-		for (let child = parent.firstElementChild; child; child = child.nextElementSibling) {
-			const key = child.getAttribute("data-key");
-			if (key !== null) {
-				keyMap.set(key, child);
-				const numericKey = Number(key);
-				if (!Number.isNaN(numericKey)) keyMap.set(numericKey, child);
-			}
-		}
-		if (keyMap.size > 0) keyedElements.set(parent, keyMap);
-	}
-	return keyMap.size > 0 ? keyMap : void 0;
-}
-function hydrateExistingForDomInOrder(parent, forState) {
-	if (parent.children.length !== forState.orderedKeys.length) return false;
-	for (let i = 0; i < forState.orderedKeys.length; i += 1) {
-		const itemKey = forState.orderedKeys[i];
-		const itemInstance = forState.items.get(itemKey);
-		const currentDom = parent.children[i];
-		if (!itemInstance || currentDom.getAttribute("data-key") !== String(itemKey)) return false;
-		itemInstance.scope.dom = currentDom;
-		itemInstance.scope.needsDomUpdate = true;
-	}
-	return true;
-}
-function removeForBoundaryNodes(parent, removedNodes) {
-	if (removedNodes.length > 0 && removedNodes.length === parent.childNodes.length) {
-		let canBulkClear = true;
-		for (let i = 0; i < removedNodes.length; i++) if (removedNodes[i].parentNode !== parent) {
-			canBulkClear = false;
-			break;
-		}
-		if (canBulkClear) {
-			for (let i = 0; i < removedNodes.length; i++) {
-				recordBenchEvent("domRemove");
-				teardownNodeSubtree(removedNodes[i]);
-			}
-			withBenchMetricScope("fullClear", () => {
-				recordBenchCounter("bulkClearCommits");
-				parent.textContent = "";
-			});
-			return;
-		}
-	}
-	for (let i = 0; i < removedNodes.length; i++) {
-		const node = removedNodes[i];
-		if (node.parentNode === parent) {
-			recordBenchEvent("domRemove");
-			teardownNodeSubtree(node);
-			parent.removeChild(node);
-		}
-	}
-}
-function syncKeyedMapFromForState(parent, forState, strategy, removedNodes) {
-	const existing = keyedElements.get(parent);
-	const ensureMapEntry = (map, key, element) => {
-		map.set(key, element);
-		const keyString = String(key);
-		map.set(keyString, element);
-		const keyNumber = Number(keyString);
-		if (!Number.isNaN(keyNumber)) map.set(keyNumber, element);
-	};
-	if (strategy === "SWAP") {
-		if (existing) return;
-	}
-	if (strategy === "FULL_KEYED" && existing && removedNodes.length === 0) return;
-	if (strategy === "NO_REORDER") {
-		if (existing && removedNodes.length === 0) return;
-		if (existing) {
-			for (const [mapKey, element] of existing) if (element.parentNode !== parent) existing.delete(mapKey);
-			if (existing.size > 0) keyedElements.set(parent, existing);
-			else keyedElements.delete(parent);
-			return;
-		}
-	}
-	if (strategy === "TRUNCATE" && forState.orderedKeys.length === 0) {
-		if (existing) existing.clear();
-		keyedElements.delete(parent);
-		return;
-	}
-	if (strategy === "APPEND" && existing) {
-		for (let i = 0; i < forState.orderedKeys.length; i++) {
-			const key = forState.orderedKeys[i];
-			if (key === null || existing.has(key)) continue;
-			const itemInstance = forState.items.get(key);
-			if (itemInstance?.scope.dom instanceof Element) ensureMapEntry(existing, key, itemInstance.scope.dom);
-		}
-		if (existing.size > 0) keyedElements.set(parent, existing);
-		else keyedElements.delete(parent);
-		return;
-	}
-	const nextMap = existing ?? /* @__PURE__ */ new Map();
-	nextMap.clear();
-	for (let i = 0; i < forState.orderedKeys.length; i++) {
-		const key = forState.orderedKeys[i];
-		if (key === null) continue;
-		const itemInstance = forState.items.get(key);
-		if (itemInstance?.scope.dom instanceof Element) ensureMapEntry(nextMap, key, itemInstance.scope.dom);
-	}
-	if (nextMap.size > 0) keyedElements.set(parent, nextMap);
-	else keyedElements.delete(parent);
-}
-function replaceChildrenInOrder(parent, nodes, allowDirectSpread) {
-	if (allowDirectSpread && canUseDirectReplaceChildrenSpread(nodes.length)) {
-		parent.replaceChildren(...nodes);
-		return;
-	}
-	const fragment = parent.ownerDocument.createDocumentFragment();
-	for (let i = 0; i < nodes.length; i++) fragment.appendChild(nodes[i]);
-	parent.replaceChildren(fragment);
-}
-function getLISIndices(sequence) {
-	if (sequence.length === 0) return [];
-	const predecessors = sequence.slice();
-	const lisIndices = [0];
-	for (let i = 1; i < sequence.length; i += 1) {
-		const current = sequence[i];
-		const lastLisIndex = lisIndices[lisIndices.length - 1];
-		if (sequence[lastLisIndex] < current) {
-			predecessors[i] = lastLisIndex;
-			lisIndices.push(i);
-			continue;
-		}
-		let lo = 0;
-		let hi = lisIndices.length - 1;
-		while (lo < hi) {
-			const mid = lo + hi >> 1;
-			if (sequence[lisIndices[mid]] < current) lo = mid + 1;
-			else hi = mid;
-		}
-		if (current < sequence[lisIndices[lo]]) {
-			if (lo > 0) predecessors[i] = lisIndices[lo - 1];
-			lisIndices[lo] = i;
-		}
-	}
-	let cursor = lisIndices.length - 1;
-	let index = lisIndices[cursor];
-	while (cursor >= 0) {
-		lisIndices[cursor] = index;
-		index = predecessors[index];
-		cursor -= 1;
-	}
-	return lisIndices;
-}
-function commitMoveOnlyReorder(parent, nodes) {
-	const currentNodes = Array.from(parent.childNodes);
-	if (currentNodes.length !== nodes.length) return false;
-	const currentIndexByNode = /* @__PURE__ */ new Map();
-	for (let i = 0; i < currentNodes.length; i += 1) currentIndexByNode.set(currentNodes[i], i);
-	const positions = Array.from({ length: nodes.length }, () => 0);
-	for (let i = 0; i < nodes.length; i += 1) {
-		const position = currentIndexByNode.get(nodes[i]);
-		if (position === void 0) return false;
-		positions[i] = position;
-	}
-	const lisIndices = getLISIndices(positions);
-	if (lisIndices.length === nodes.length) return true;
-	const moveCount = nodes.length - lisIndices.length;
-	if (moveCount >= Math.max(DENSE_MOVE_MINIMUM, Math.floor(nodes.length * DENSE_MOVE_RATIO))) {
-		recordBenchEvent("domMove", moveCount);
-		recordBenchCounter("replaceChildrenCommits");
-		replaceChildrenInOrder(parent, nodes, false);
-		return true;
-	}
-	let lisCursor = lisIndices.length - 1;
-	let anchor = null;
-	for (let i = nodes.length - 1; i >= 0; i -= 1) {
-		const node = nodes[i];
-		if (lisCursor >= 0 && i === lisIndices[lisCursor]) {
-			anchor = node;
-			lisCursor -= 1;
-			continue;
-		}
-		if (node.nextSibling !== anchor) {
-			recordBenchEvent("domMove");
-			parent.insertBefore(node, anchor);
-		}
-		anchor = node;
-	}
-	return true;
-}
 function commitForStateBoundaryChildren(parent, forState, childrenVNodes, runtime) {
 	const domCommitStart = performance.now();
 	const hydrateExistingForDom = () => {

package/dist/renderer/for-commit.js.map

@@ -1 +1 @@
-{"version":3,"file":"for-commit.js","names":[],"sources":["../../src/renderer/for-commit.ts"],"sourcesContent":["import type { ChildScope } from '../runtime/child-scope';\nimport {\n  clearForDomUpdateState,\n  recordBenchCounter,\n  recordBenchEvent,\n  recordBenchTiming,\n  type ForCommitStrategy,\n  type ForState,\n  withBenchMetricScope,\n} from '../runtime/for';\nimport { teardownNodeSubtree } from './cleanup';\nimport { keyedElements } from './keyed';\nimport type { VNode } from './types';\nimport { canUseDirectReplaceChildrenSpread } from './utils';\n\nconst DENSE_MOVE_MINIMUM = 64;\nconst DENSE_MOVE_RATIO = 0.75;\n\nexport interface ForCommitRuntime {\n  isProduction(): boolean;\n  syncForItemDom(parent: Element, scope: ChildScope, vnode: VNode): Node | null;\n  tryPatchStableForDirtyItem(scope: ChildScope): boolean;\n}\n\nfunction getOrBuildDomKeyMap(\n  parent: Element\n): Map<string | number, Element> | undefined {\n  let keyMap = keyedElements.get(parent);\n  if (!keyMap) {\n    keyMap = new Map<string | number, Element>();\n    for (\n      let child = parent.firstElementChild;\n      child;\n      child = child.nextElementSibling\n    ) {\n      const key = child.getAttribute('data-key');\n      if (key !== null) {\n        keyMap.set(key, child);\n        const numericKey = Number(key);\n        if (!Number.isNaN(numericKey)) {\n          keyMap.set(numericKey, child);\n        }\n      }\n    }\n    if (keyMap.size > 0) {\n      keyedElements.set(parent, keyMap);\n    }\n  }\n  return keyMap.size > 0 ? keyMap : undefined;\n}\n\nfunction hydrateExistingForDomInOrder(\n  parent: Element,\n  forState: ForState<unknown>\n): boolean {\n  if (parent.children.length !== forState.orderedKeys.length) {\n    return false;\n  }\n\n  for (let i = 0; i < forState.orderedKeys.length; i += 1) {\n    const itemKey = forState.orderedKeys[i];\n    const itemInstance = forState.items.get(itemKey);\n    const currentDom = parent.children[i];\n\n    if (\n      !itemInstance ||\n      currentDom.getAttribute('data-key') !== String(itemKey)\n    ) {\n      return false;\n    }\n\n    itemInstance.scope.dom = currentDom;\n    itemInstance.scope.needsDomUpdate = true;\n  }\n\n  return true;\n}\n\nfunction removeForBoundaryNodes(parent: Element, removedNodes: Node[]): void {\n  if (\n    removedNodes.length > 0 &&\n    removedNodes.length === parent.childNodes.length\n  ) {\n    let canBulkClear = true;\n    for (let i = 0; i < removedNodes.length; i++) {\n      if (removedNodes[i].parentNode !== parent) {\n        canBulkClear = false;\n        break;\n      }\n    }\n\n    if (canBulkClear) {\n      for (let i = 0; i < removedNodes.length; i++) {\n        recordBenchEvent('domRemove');\n        teardownNodeSubtree(removedNodes[i]);\n      }\n      withBenchMetricScope('fullClear', () => {\n        recordBenchCounter('bulkClearCommits');\n        parent.textContent = '';\n      });\n      return;\n    }\n  }\n\n  for (let i = 0; i < removedNodes.length; i++) {\n    const node = removedNodes[i];\n    if (node.parentNode === parent) {\n      recordBenchEvent('domRemove');\n      teardownNodeSubtree(node);\n      parent.removeChild(node);\n    }\n  }\n}\n\nfunction syncKeyedMapFromForState(\n  parent: Element,\n  forState: ForState<unknown>,\n  strategy: ForCommitStrategy,\n  removedNodes: Node[]\n): void {\n  const existing = keyedElements.get(parent);\n  const ensureMapEntry = (\n    map: Map<string | number, Element>,\n    key: string | number,\n    element: Element\n  ): void => {\n    map.set(key, element);\n    const keyString = String(key);\n    map.set(keyString, element);\n    const keyNumber = Number(keyString);\n    if (!Number.isNaN(keyNumber)) {\n      map.set(keyNumber, element);\n    }\n  };\n\n  if (strategy === 'SWAP') {\n    if (existing) {\n      return;\n    }\n  }\n\n  if (strategy === 'FULL_KEYED' && existing && removedNodes.length === 0) {\n    return;\n  }\n\n  if (strategy === 'NO_REORDER') {\n    if (existing && removedNodes.length === 0) {\n      return;\n    }\n\n    if (existing) {\n      for (const [mapKey, element] of existing) {\n        if (element.parentNode !== parent) {\n          existing.delete(mapKey);\n        }\n      }\n\n      if (existing.size > 0) {\n        keyedElements.set(parent, existing);\n      } else {\n        keyedElements.delete(parent);\n      }\n      return;\n    }\n  }\n\n  if (strategy === 'TRUNCATE' && forState.orderedKeys.length === 0) {\n    if (existing) {\n      existing.clear();\n    }\n    keyedElements.delete(parent);\n    return;\n  }\n\n  if (strategy === 'APPEND' && existing) {\n    for (let i = 0; i < forState.orderedKeys.length; i++) {\n      const key = forState.orderedKeys[i];\n      if (key === null || existing.has(key)) continue;\n      const itemInstance = forState.items.get(key);\n      if (itemInstance?.scope.dom instanceof Element) {\n        ensureMapEntry(existing, key, itemInstance.scope.dom);\n      }\n    }\n\n    if (existing.size > 0) {\n      keyedElements.set(parent, existing);\n    } else {\n      keyedElements.delete(parent);\n    }\n    return;\n  }\n\n  const nextMap = existing ?? new Map<string | number, Element>();\n  nextMap.clear();\n\n  for (let i = 0; i < forState.orderedKeys.length; i++) {\n    const key = forState.orderedKeys[i];\n    if (key === null) continue;\n    const itemInstance = forState.items.get(key);\n    if (itemInstance?.scope.dom instanceof Element) {\n      ensureMapEntry(nextMap, key, itemInstance.scope.dom);\n    }\n  }\n\n  if (nextMap.size > 0) {\n    keyedElements.set(parent, nextMap);\n  } else {\n    keyedElements.delete(parent);\n  }\n}\n\nfunction replaceChildrenInOrder(\n  parent: Element,\n  nodes: Node[],\n  allowDirectSpread: boolean\n): void {\n  if (allowDirectSpread && canUseDirectReplaceChildrenSpread(nodes.length)) {\n    parent.replaceChildren(...nodes);\n    return;\n  }\n\n  const fragment = parent.ownerDocument.createDocumentFragment();\n  for (let i = 0; i < nodes.length; i++) {\n    fragment.appendChild(nodes[i]);\n  }\n  parent.replaceChildren(fragment);\n}\n\nfunction getLISIndices(sequence: number[]): number[] {\n  if (sequence.length === 0) {\n    return [];\n  }\n\n  const predecessors = sequence.slice();\n  const lisIndices: number[] = [0];\n\n  for (let i = 1; i < sequence.length; i += 1) {\n    const current = sequence[i];\n    const lastLisIndex = lisIndices[lisIndices.length - 1];\n\n    if (sequence[lastLisIndex] < current) {\n      predecessors[i] = lastLisIndex;\n      lisIndices.push(i);\n      continue;\n    }\n\n    let lo = 0;\n    let hi = lisIndices.length - 1;\n    while (lo < hi) {\n      const mid = (lo + hi) >> 1;\n      if (sequence[lisIndices[mid]] < current) {\n        lo = mid + 1;\n      } else {\n        hi = mid;\n      }\n    }\n\n    if (current < sequence[lisIndices[lo]]) {\n      if (lo > 0) {\n        predecessors[i] = lisIndices[lo - 1];\n      }\n      lisIndices[lo] = i;\n    }\n  }\n\n  let cursor = lisIndices.length - 1;\n  let index = lisIndices[cursor];\n  while (cursor >= 0) {\n    lisIndices[cursor] = index;\n    index = predecessors[index];\n    cursor -= 1;\n  }\n\n  return lisIndices;\n}\n\nfunction commitMoveOnlyReorder(parent: Element, nodes: Node[]): boolean {\n  const currentNodes = Array.from(parent.childNodes);\n  if (currentNodes.length !== nodes.length) {\n    return false;\n  }\n\n  const currentIndexByNode = new Map<Node, number>();\n  for (let i = 0; i < currentNodes.length; i += 1) {\n    currentIndexByNode.set(currentNodes[i], i);\n  }\n\n  const positions = Array.from({ length: nodes.length }, () => 0);\n  for (let i = 0; i < nodes.length; i += 1) {\n    const position = currentIndexByNode.get(nodes[i]);\n    if (position === undefined) {\n      return false;\n    }\n    positions[i] = position;\n  }\n\n  const lisIndices = getLISIndices(positions);\n  if (lisIndices.length === nodes.length) {\n    return true;\n  }\n\n  const moveCount = nodes.length - lisIndices.length;\n  const denseMoveThreshold = Math.max(\n    DENSE_MOVE_MINIMUM,\n    Math.floor(nodes.length * DENSE_MOVE_RATIO)\n  );\n\n  if (moveCount >= denseMoveThreshold) {\n    recordBenchEvent('domMove', moveCount);\n    recordBenchCounter('replaceChildrenCommits');\n    replaceChildrenInOrder(parent, nodes, false);\n    return true;\n  }\n\n  let lisCursor = lisIndices.length - 1;\n  let anchor: Node | null = null;\n\n  for (let i = nodes.length - 1; i >= 0; i -= 1) {\n    const node = nodes[i];\n    if (lisCursor >= 0 && i === lisIndices[lisCursor]) {\n      anchor = node;\n      lisCursor -= 1;\n      continue;\n    }\n\n    if (node.nextSibling !== anchor) {\n      recordBenchEvent('domMove');\n      parent.insertBefore(node, anchor);\n    }\n\n    anchor = node;\n  }\n\n  return true;\n}\n\nexport function commitForStateBoundaryChildren(\n  parent: Element,\n  forState: ForState<unknown>,\n  childrenVNodes: VNode[],\n  runtime: ForCommitRuntime\n): void {\n  const domCommitStart = performance.now();\n\n  const hydrateExistingForDom = (): void => {\n    if (hydrateExistingForDomInOrder(parent, forState)) {\n      return;\n    }\n\n    const domKeyMap = getOrBuildDomKeyMap(parent);\n    if (!domKeyMap) {\n      return;\n    }\n\n    for (let i = 0; i < forState.orderedKeys.length; i++) {\n      const itemKey = forState.orderedKeys[i];\n      const itemInstance = forState.items.get(itemKey);\n      if (!itemInstance || itemInstance.scope.dom) {\n        continue;\n      }\n\n      const existingDom = domKeyMap.get(itemKey);\n      if (!existingDom) {\n        continue;\n      }\n\n      itemInstance.scope.dom = existingDom;\n      itemInstance.scope.needsDomUpdate = true;\n    }\n  };\n\n  if (forState.orderedKeys.length === 0) {\n    removeForBoundaryNodes(parent, forState.lastRemovedNodes);\n\n    const fallbackScope = forState.fallbackScope;\n    const fallbackVNode = childrenVNodes[0];\n    const nextDom =\n      fallbackScope && fallbackVNode !== undefined\n        ? runtime.syncForItemDom(parent, fallbackScope, fallbackVNode)\n        : null;\n\n    if (nextDom) {\n      if (\n        parent.childNodes.length !== 1 ||\n        parent.firstChild !== nextDom ||\n        forState.lastRemovedNodes.length > 0\n      ) {\n        parent.replaceChildren(nextDom);\n      }\n    } else if (parent.firstChild) {\n      parent.textContent = '';\n    }\n\n    keyedElements.delete(parent);\n    forState._hasResolvedItemDom = false;\n    recordBenchTiming('domCommit', performance.now() - domCommitStart);\n    clearForDomUpdateState(forState);\n    return;\n  }\n\n  if (!forState._hasResolvedItemDom && parent.childNodes.length > 0) {\n    hydrateExistingForDom();\n  }\n\n  const getDirtyForIndices = (): number[] => {\n    const pendingDirtyIndices = forState.pendingDirtyIndices;\n    if (pendingDirtyIndices && pendingDirtyIndices.length > 0) {\n      return pendingDirtyIndices;\n    }\n\n    const dirtyIndices: number[] = [];\n    for (let index = 0; index < forState.orderedKeys.length; index += 1) {\n      const itemInstance = forState.orderedItems[index];\n      if (itemInstance?.scope.needsDomUpdate) {\n        dirtyIndices.push(index);\n      }\n    }\n\n    return dirtyIndices;\n  };\n\n  let dirtyIndicesCache: number[] | null = null;\n  const ensureDirtyIndices = (): number[] => {\n    if (dirtyIndicesCache) {\n      return dirtyIndicesCache;\n    }\n\n    dirtyIndicesCache = getDirtyForIndices();\n    return dirtyIndicesCache;\n  };\n\n  const dirtyIndices =\n    forState.lastCommitStrategy === 'NO_REORDER' ? ensureDirtyIndices() : [];\n  let boundaryChildrenExact = false;\n\n  const commitDirtyNoReorder = (dirtyIndices: number[]): void => {\n    if (dirtyIndices.length === 0) {\n      boundaryChildrenExact = true;\n      return;\n    }\n\n    const orderedItems = forState.orderedItems;\n    const childNodes = parent.childNodes;\n\n    for (let dirtyIndex = 0; dirtyIndex < dirtyIndices.length; dirtyIndex++) {\n      const i = dirtyIndices[dirtyIndex];\n      const itemInstance = orderedItems[i];\n      if (!itemInstance) {\n        continue;\n      }\n\n      if (runtime.tryPatchStableForDirtyItem(itemInstance.scope)) {\n        continue;\n      }\n\n      const dom = runtime.syncForItemDom(\n        parent,\n        itemInstance.scope,\n        childrenVNodes[i]\n      );\n      if (!dom) {\n        continue;\n      }\n\n      const anchor = childNodes[i] ?? null;\n      if (dom.parentNode !== parent || dom !== anchor) {\n        recordBenchEvent('domInsert');\n        parent.insertBefore(dom, anchor);\n      }\n    }\n\n    boundaryChildrenExact = true;\n  };\n\n  const commitPositional = (): void => {\n    for (let i = 0; i < forState.orderedKeys.length; i++) {\n      const itemInstance = forState.orderedItems[i];\n      if (!itemInstance) {\n        continue;\n      }\n\n      const dom = runtime.syncForItemDom(\n        parent,\n        itemInstance.scope,\n        childrenVNodes[i]\n      );\n      if (!dom) {\n        continue;\n      }\n\n      if (dom.parentNode !== parent) {\n        const anchor = parent.childNodes[i] ?? null;\n        recordBenchEvent('domInsert');\n        parent.insertBefore(dom, anchor);\n      }\n    }\n\n    boundaryChildrenExact = true;\n  };\n\n  const commitAppend = (): void => {\n    const canHydrateInPlace =\n      !forState._hasResolvedItemDom &&\n      forState.lastRemovedNodes.length === 0 &&\n      parent.childNodes.length === forState.orderedKeys.length;\n    if (canHydrateInPlace) {\n      let exactOrder = true;\n      let currentNode = parent.firstChild;\n\n      for (let i = 0; i < forState.orderedKeys.length; i++) {\n        const itemInstance = forState.orderedItems[i];\n        if (!itemInstance) {\n          exactOrder = false;\n          currentNode = currentNode?.nextSibling ?? null;\n          continue;\n        }\n\n        const dom = runtime.syncForItemDom(\n          parent,\n          itemInstance.scope,\n          childrenVNodes[i]\n        );\n        if (!dom || dom.parentNode !== parent || dom !== currentNode) {\n          exactOrder = false;\n        }\n\n        currentNode = currentNode?.nextSibling ?? null;\n      }\n\n      if (exactOrder) {\n        boundaryChildrenExact = true;\n        return;\n      }\n    }\n\n    withBenchMetricScope('coldCreate', () => {\n      const fragment = parent.ownerDocument.createDocumentFragment();\n      let hasPendingAppend = false;\n\n      for (let i = 0; i < forState.orderedKeys.length; i++) {\n        const itemInstance = forState.orderedItems[i];\n        if (!itemInstance) {\n          continue;\n        }\n\n        if (\n          itemInstance.scope.dom?.parentNode === parent &&\n          !itemInstance.scope.needsDomUpdate\n        ) {\n          continue;\n        }\n\n        const dom = runtime.syncForItemDom(\n          parent,\n          itemInstance.scope,\n          childrenVNodes[i]\n        );\n        if (!dom) {\n          continue;\n        }\n\n        if (dom.parentNode !== parent) {\n          recordBenchEvent('domInsert');\n          fragment.appendChild(dom);\n          hasPendingAppend = true;\n        }\n      }\n\n      if (hasPendingAppend) {\n        parent.appendChild(fragment);\n      }\n    });\n\n    boundaryChildrenExact = true;\n  };\n\n  const commitSwap = (): void => {\n    const swapIndices = forState.pendingSwapIndices;\n    if (!swapIndices) {\n      return;\n    }\n\n    let [firstIndex, secondIndex] = swapIndices;\n    if (firstIndex === secondIndex) {\n      return;\n    }\n\n    if (firstIndex > secondIndex) {\n      [firstIndex, secondIndex] = [secondIndex, firstIndex];\n    }\n\n    const firstKey = forState.orderedKeys[firstIndex];\n    const secondKey = forState.orderedKeys[secondIndex];\n    const firstItem = forState.items.get(firstKey);\n    const secondItem = forState.items.get(secondKey);\n\n    if (!firstItem || !secondItem) {\n      commitReorder();\n      return;\n    }\n\n    const firstDom = runtime.syncForItemDom(\n      parent,\n      firstItem.scope,\n      childrenVNodes[firstIndex]\n    );\n    const secondDom = runtime.syncForItemDom(\n      parent,\n      secondItem.scope,\n      childrenVNodes[secondIndex]\n    );\n\n    if (!firstDom || !secondDom) {\n      commitReorder();\n      return;\n    }\n\n    if (firstDom.parentNode !== parent || secondDom.parentNode !== parent) {\n      commitReorder();\n      return;\n    }\n\n    const firstBeforeSecond =\n      (firstDom.compareDocumentPosition(secondDom) &\n        Node.DOCUMENT_POSITION_FOLLOWING) !==\n      0;\n    if (firstBeforeSecond) {\n      boundaryChildrenExact = true;\n      return;\n    }\n\n    const firstNextSibling = firstDom.nextSibling;\n    recordBenchEvent('domMove');\n    parent.insertBefore(firstDom, secondDom);\n    recordBenchEvent('domMove');\n    parent.insertBefore(secondDom, firstNextSibling);\n\n    boundaryChildrenExact = true;\n  };\n\n  const commitReorder = (): void => {\n    const items = forState.orderedItems;\n    const count = items.length;\n\n    if (forState.pendingMoveOnly && forState.lastRemovedNodes.length === 0) {\n      const nodes = Array<Node>(count);\n      let movedCount = 0;\n      let insertedCount = 0;\n\n      for (let i = 0; i < count; i++) {\n        const itemInstance = items[i];\n        if (!itemInstance) {\n          return;\n        }\n\n        const scope = itemInstance.scope;\n        const dom =\n          scope.dom && !scope.needsDomUpdate\n            ? scope.dom\n            : runtime.syncForItemDom(parent, scope, childrenVNodes[i]);\n\n        if (!dom) {\n          return;\n        }\n\n        if (dom.parentNode === parent) {\n          movedCount++;\n        } else {\n          insertedCount++;\n        }\n        nodes[i] = dom;\n      }\n\n      if (!canUseDirectReplaceChildrenSpread(count)) {\n        if (movedCount > 0) {\n          recordBenchEvent('domMove', movedCount);\n        }\n        if (insertedCount > 0) {\n          recordBenchEvent('domInsert', insertedCount);\n        }\n        replaceChildrenInOrder(parent, nodes, false);\n        boundaryChildrenExact = true;\n        return;\n      }\n\n      if (insertedCount > 0) {\n        if (movedCount > 0) {\n          recordBenchEvent('domMove', movedCount);\n        }\n        recordBenchEvent('domInsert', insertedCount);\n        replaceChildrenInOrder(parent, nodes, true);\n        boundaryChildrenExact = true;\n        return;\n      }\n\n      if (count > 1 && commitMoveOnlyReorder(parent, nodes)) {\n        boundaryChildrenExact = true;\n        return;\n      }\n\n      if (movedCount > 0) {\n        recordBenchEvent('domMove', movedCount);\n      }\n      if (insertedCount > 0) {\n        recordBenchEvent('domInsert', insertedCount);\n      }\n\n      replaceChildrenInOrder(parent, nodes, true);\n      boundaryChildrenExact = true;\n      return;\n    }\n\n    let hasExistingChild = false;\n    for (let i = 0; i < count; i++) {\n      const itemInstance = items[i];\n      if (itemInstance?.scope.dom?.parentNode === parent) {\n        hasExistingChild = true;\n        break;\n      }\n    }\n\n    if (!hasExistingChild) {\n      withBenchMetricScope('coldCreate', () => {\n        const nodes: Node[] = [];\n        for (let i = 0; i < count; i++) {\n          const itemInstance = items[i];\n          if (!itemInstance) continue;\n          const dom = runtime.syncForItemDom(\n            parent,\n            itemInstance.scope,\n            childrenVNodes[i]\n          );\n          if (dom) {\n            recordBenchEvent('domInsert');\n            nodes.push(dom);\n          }\n        }\n        recordBenchCounter('replaceChildrenCommits');\n        replaceChildrenInOrder(parent, nodes, false);\n      });\n\n      boundaryChildrenExact = true;\n      return;\n    }\n\n    if (forState.lastRemovedNodes.length === 0) {\n      const nodes: Node[] = [];\n\n      for (let i = 0; i < count; i++) {\n        const itemInstance = items[i];\n        if (!itemInstance) {\n          continue;\n        }\n\n        const dom = runtime.syncForItemDom(\n          parent,\n          itemInstance.scope,\n          childrenVNodes[i]\n        );\n        if (!dom) {\n          continue;\n        }\n\n        recordBenchEvent(dom.parentNode === parent ? 'domMove' : 'domInsert');\n        nodes.push(dom);\n      }\n\n      replaceChildrenInOrder(parent, nodes, false);\n      boundaryChildrenExact = true;\n      return;\n    }\n\n    for (let i = 0; i < count; i++) {\n      const itemInstance = items[i];\n      if (!itemInstance) {\n        continue;\n      }\n\n      const dom = runtime.syncForItemDom(\n        parent,\n        itemInstance.scope,\n        childrenVNodes[i]\n      );\n      if (!dom) {\n        continue;\n      }\n\n      const anchor = parent.childNodes[i] ?? null;\n      if (dom !== anchor) {\n        recordBenchEvent('domMove');\n        parent.insertBefore(dom, anchor);\n      }\n    }\n\n    boundaryChildrenExact = true;\n  };\n\n  const isLocalOnlyDirtyCommit =\n    forState.lastCommitStrategy === 'NO_REORDER' &&\n    dirtyIndices.length > 0 &&\n    forState.pendingDirtyIndices === null &&\n    forState.pendingSwapIndices === null &&\n    !forState.pendingMoveOnly &&\n    forState.lastRemovedNodes.length === 0 &&\n    parent.childNodes.length === forState.orderedKeys.length;\n\n  if (isLocalOnlyDirtyCommit) {\n    commitDirtyNoReorder(dirtyIndices);\n    syncKeyedMapFromForState(parent, forState, 'NO_REORDER', []);\n\n    recordBenchTiming('domCommit', performance.now() - domCommitStart);\n    clearForDomUpdateState(forState);\n    return;\n  }\n\n  switch (forState.lastCommitStrategy) {\n    case 'NO_REORDER':\n      commitDirtyNoReorder(dirtyIndices);\n      break;\n    case 'TRUNCATE':\n      commitPositional();\n      break;\n    case 'APPEND':\n      commitAppend();\n      break;\n    case 'SWAP':\n      commitSwap();\n      break;\n    case 'FULL_KEYED':\n    default:\n      commitReorder();\n      break;\n  }\n\n  removeForBoundaryNodes(parent, forState.lastRemovedNodes);\n  if (forState.lastRemovedNodes.length > 0) {\n    boundaryChildrenExact = false;\n  }\n  syncKeyedMapFromForState(\n    parent,\n    forState,\n    forState.lastCommitStrategy,\n    forState.lastRemovedNodes\n  );\n\n  const syncExactForBoundaryChildren = (): void => {\n    const expectedNodes: Node[] = [];\n\n    for (let i = 0; i < forState.orderedKeys.length; i++) {\n      const itemInstance = forState.orderedItems[i];\n      if (!itemInstance) {\n        continue;\n      }\n\n      const dom =\n        itemInstance.scope.dom && !itemInstance.scope.needsDomUpdate\n          ? itemInstance.scope.dom\n          : runtime.syncForItemDom(\n              parent,\n              itemInstance.scope,\n              childrenVNodes[i]\n            );\n      if (dom) {\n        expectedNodes.push(dom);\n      }\n    }\n\n    const currentNodes = Array.from(parent.childNodes);\n    if (\n      currentNodes.length === expectedNodes.length &&\n      currentNodes.every((node, index) => node === expectedNodes[index])\n    ) {\n      return;\n    }\n\n    const expectedNodeSet = new Set(expectedNodes);\n    for (const currentNode of currentNodes) {\n      if (expectedNodeSet.has(currentNode)) {\n        continue;\n      }\n\n      teardownNodeSubtree(currentNode);\n\n      if (currentNode.parentNode === parent) {\n        recordBenchEvent('domRemove');\n        currentNode.remove();\n      }\n    }\n\n    replaceChildrenInOrder(parent, expectedNodes, true);\n  };\n\n  if (!boundaryChildrenExact) {\n    syncExactForBoundaryChildren();\n  }\n  forState._hasResolvedItemDom = true;\n  recordBenchTiming('domCommit', performance.now() - domCommitStart);\n  clearForDomUpdateState(forState);\n}\n"],"mappings":";;;;;;AAeA,MAAM,qBAAqB;AAC3B,MAAM,mBAAmB;AAQzB,SAAS,oBACP,QAC2C;CAC3C,IAAI,SAAS,cAAc,IAAI,MAAM;CACrC,IAAI,CAAC,QAAQ;EACX,yBAAS,IAAI,IAA8B;EAC3C,KACE,IAAI,QAAQ,OAAO,mBACnB,OACA,QAAQ,MAAM,oBACd;GACA,MAAM,MAAM,MAAM,aAAa,UAAU;GACzC,IAAI,QAAQ,MAAM;IAChB,OAAO,IAAI,KAAK,KAAK;IACrB,MAAM,aAAa,OAAO,GAAG;IAC7B,IAAI,CAAC,OAAO,MAAM,UAAU,GAC1B,OAAO,IAAI,YAAY,KAAK;GAEhC;EACF;EACA,IAAI,OAAO,OAAO,GAChB,cAAc,IAAI,QAAQ,MAAM;CAEpC;CACA,OAAO,OAAO,OAAO,IAAI,SAAS;AACpC;AAEA,SAAS,6BACP,QACA,UACS;CACT,IAAI,OAAO,SAAS,WAAW,SAAS,YAAY,QAClD,OAAO;CAGT,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK,GAAG;EACvD,MAAM,UAAU,SAAS,YAAY;EACrC,MAAM,eAAe,SAAS,MAAM,IAAI,OAAO;EAC/C,MAAM,aAAa,OAAO,SAAS;EAEnC,IACE,CAAC,gBACD,WAAW,aAAa,UAAU,MAAM,OAAO,OAAO,GAEtD,OAAO;EAGT,aAAa,MAAM,MAAM;EACzB,aAAa,MAAM,iBAAiB;CACtC;CAEA,OAAO;AACT;AAEA,SAAS,uBAAuB,QAAiB,cAA4B;CAC3E,IACE,aAAa,SAAS,KACtB,aAAa,WAAW,OAAO,WAAW,QAC1C;EACA,IAAI,eAAe;EACnB,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KACvC,IAAI,aAAa,EAAE,CAAC,eAAe,QAAQ;GACzC,eAAe;GACf;EACF;EAGF,IAAI,cAAc;GAChB,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;IAC5C,iBAAiB,WAAW;IAC5B,oBAAoB,aAAa,EAAE;GACrC;GACA,qBAAqB,mBAAmB;IACtC,mBAAmB,kBAAkB;IACrC,OAAO,cAAc;GACvB,CAAC;GACD;EACF;CACF;CAEA,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;EAC5C,MAAM,OAAO,aAAa;EAC1B,IAAI,KAAK,eAAe,QAAQ;GAC9B,iBAAiB,WAAW;GAC5B,oBAAoB,IAAI;GACxB,OAAO,YAAY,IAAI;EACzB;CACF;AACF;AAEA,SAAS,yBACP,QACA,UACA,UACA,cACM;CACN,MAAM,WAAW,cAAc,IAAI,MAAM;CACzC,MAAM,kBACJ,KACA,KACA,YACS;EACT,IAAI,IAAI,KAAK,OAAO;EACpB,MAAM,YAAY,OAAO,GAAG;EAC5B,IAAI,IAAI,WAAW,OAAO;EAC1B,MAAM,YAAY,OAAO,SAAS;EAClC,IAAI,CAAC,OAAO,MAAM,SAAS,GACzB,IAAI,IAAI,WAAW,OAAO;CAE9B;CAEA,IAAI,aAAa,QACf;MAAI,UACF;CACF;CAGF,IAAI,aAAa,gBAAgB,YAAY,aAAa,WAAW,GACnE;CAGF,IAAI,aAAa,cAAc;EAC7B,IAAI,YAAY,aAAa,WAAW,GACtC;EAGF,IAAI,UAAU;GACZ,KAAK,MAAM,CAAC,QAAQ,YAAY,UAC9B,IAAI,QAAQ,eAAe,QACzB,SAAS,OAAO,MAAM;GAI1B,IAAI,SAAS,OAAO,GAClB,cAAc,IAAI,QAAQ,QAAQ;QAElC,cAAc,OAAO,MAAM;GAE7B;EACF;CACF;CAEA,IAAI,aAAa,cAAc,SAAS,YAAY,WAAW,GAAG;EAChE,IAAI,UACF,SAAS,MAAM;EAEjB,cAAc,OAAO,MAAM;EAC3B;CACF;CAEA,IAAI,aAAa,YAAY,UAAU;EACrC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;GACpD,MAAM,MAAM,SAAS,YAAY;GACjC,IAAI,QAAQ,QAAQ,SAAS,IAAI,GAAG,GAAG;GACvC,MAAM,eAAe,SAAS,MAAM,IAAI,GAAG;GAC3C,IAAI,cAAc,MAAM,eAAe,SACrC,eAAe,UAAU,KAAK,aAAa,MAAM,GAAG;EAExD;EAEA,IAAI,SAAS,OAAO,GAClB,cAAc,IAAI,QAAQ,QAAQ;OAElC,cAAc,OAAO,MAAM;EAE7B;CACF;CAEA,MAAM,UAAU,4BAAY,IAAI,IAA8B;CAC9D,QAAQ,MAAM;CAEd,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;EACpD,MAAM,MAAM,SAAS,YAAY;EACjC,IAAI,QAAQ,MAAM;EAClB,MAAM,eAAe,SAAS,MAAM,IAAI,GAAG;EAC3C,IAAI,cAAc,MAAM,eAAe,SACrC,eAAe,SAAS,KAAK,aAAa,MAAM,GAAG;CAEvD;CAEA,IAAI,QAAQ,OAAO,GACjB,cAAc,IAAI,QAAQ,OAAO;MAEjC,cAAc,OAAO,MAAM;AAE/B;AAEA,SAAS,uBACP,QACA,OACA,mBACM;CACN,IAAI,qBAAqB,kCAAkC,MAAM,MAAM,GAAG;EACxE,OAAO,gBAAgB,GAAG,KAAK;EAC/B;CACF;CAEA,MAAM,WAAW,OAAO,cAAc,uBAAuB;CAC7D,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,SAAS,YAAY,MAAM,EAAE;CAE/B,OAAO,gBAAgB,QAAQ;AACjC;AAEA,SAAS,cAAc,UAA8B;CACnD,IAAI,SAAS,WAAW,GACtB,OAAO,CAAC;CAGV,MAAM,eAAe,SAAS,MAAM;CACpC,MAAM,aAAuB,CAAC,CAAC;CAE/B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,GAAG;EAC3C,MAAM,UAAU,SAAS;EACzB,MAAM,eAAe,WAAW,WAAW,SAAS;EAEpD,IAAI,SAAS,gBAAgB,SAAS;GACpC,aAAa,KAAK;GAClB,WAAW,KAAK,CAAC;GACjB;EACF;EAEA,IAAI,KAAK;EACT,IAAI,KAAK,WAAW,SAAS;EAC7B,OAAO,KAAK,IAAI;GACd,MAAM,MAAO,KAAK,MAAO;GACzB,IAAI,SAAS,WAAW,QAAQ,SAC9B,KAAK,MAAM;QAEX,KAAK;EAET;EAEA,IAAI,UAAU,SAAS,WAAW,MAAM;GACtC,IAAI,KAAK,GACP,aAAa,KAAK,WAAW,KAAK;GAEpC,WAAW,MAAM;EACnB;CACF;CAEA,IAAI,SAAS,WAAW,SAAS;CACjC,IAAI,QAAQ,WAAW;CACvB,OAAO,UAAU,GAAG;EAClB,WAAW,UAAU;EACrB,QAAQ,aAAa;EACrB,UAAU;CACZ;CAEA,OAAO;AACT;AAEA,SAAS,sBAAsB,QAAiB,OAAwB;CACtE,MAAM,eAAe,MAAM,KAAK,OAAO,UAAU;CACjD,IAAI,aAAa,WAAW,MAAM,QAChC,OAAO;CAGT,MAAM,qCAAqB,IAAI,IAAkB;CACjD,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK,GAC5C,mBAAmB,IAAI,aAAa,IAAI,CAAC;CAG3C,MAAM,YAAY,MAAM,KAAK,EAAE,QAAQ,MAAM,OAAO,SAAS,CAAC;CAC9D,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxC,MAAM,WAAW,mBAAmB,IAAI,MAAM,EAAE;EAChD,IAAI,aAAa,QACf,OAAO;EAET,UAAU,KAAK;CACjB;CAEA,MAAM,aAAa,cAAc,SAAS;CAC1C,IAAI,WAAW,WAAW,MAAM,QAC9B,OAAO;CAGT,MAAM,YAAY,MAAM,SAAS,WAAW;CAM5C,IAAI,aALuB,KAAK,IAC9B,oBACA,KAAK,MAAM,MAAM,SAAS,gBAAgB,CAG3B,GAAoB;EACnC,iBAAiB,WAAW,SAAS;EACrC,mBAAmB,wBAAwB;EAC3C,uBAAuB,QAAQ,OAAO,KAAK;EAC3C,OAAO;CACT;CAEA,IAAI,YAAY,WAAW,SAAS;CACpC,IAAI,SAAsB;CAE1B,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;EAC7C,MAAM,OAAO,MAAM;EACnB,IAAI,aAAa,KAAK,MAAM,WAAW,YAAY;GACjD,SAAS;GACT,aAAa;GACb;EACF;EAEA,IAAI,KAAK,gBAAgB,QAAQ;GAC/B,iBAAiB,SAAS;GAC1B,OAAO,aAAa,MAAM,MAAM;EAClC;EAEA,SAAS;CACX;CAEA,OAAO;AACT;AAEA,SAAgB,+BACd,QACA,UACA,gBACA,SACM;CACN,MAAM,iBAAiB,YAAY,IAAI;CAEvC,MAAM,8BAAoC;EACxC,IAAI,6BAA6B,QAAQ,QAAQ,GAC/C;EAGF,MAAM,YAAY,oBAAoB,MAAM;EAC5C,IAAI,CAAC,WACH;EAGF,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;GACpD,MAAM,UAAU,SAAS,YAAY;GACrC,MAAM,eAAe,SAAS,MAAM,IAAI,OAAO;GAC/C,IAAI,CAAC,gBAAgB,aAAa,MAAM,KACtC;GAGF,MAAM,cAAc,UAAU,IAAI,OAAO;GACzC,IAAI,CAAC,aACH;GAGF,aAAa,MAAM,MAAM;GACzB,aAAa,MAAM,iBAAiB;EACtC;CACF;CAEA,IAAI,SAAS,YAAY,WAAW,GAAG;EACrC,uBAAuB,QAAQ,SAAS,gBAAgB;EAExD,MAAM,gBAAgB,SAAS;EAC/B,MAAM,gBAAgB,eAAe;EACrC,MAAM,UACJ,iBAAiB,kBAAkB,SAC/B,QAAQ,eAAe,QAAQ,eAAe,aAAa,IAC3D;EAEN,IAAI,SACF;OACE,OAAO,WAAW,WAAW,KAC7B,OAAO,eAAe,WACtB,SAAS,iBAAiB,SAAS,GAEnC,OAAO,gBAAgB,OAAO;EAChC,OACK,IAAI,OAAO,YAChB,OAAO,cAAc;EAGvB,cAAc,OAAO,MAAM;EAC3B,SAAS,sBAAsB;EAC/B,kBAAkB,aAAa,YAAY,IAAI,IAAI,cAAc;EACjE,uBAAuB,QAAQ;EAC/B;CACF;CAEA,IAAI,CAAC,SAAS,uBAAuB,OAAO,WAAW,SAAS,GAC9D,sBAAsB;CAGxB,MAAM,2BAAqC;EACzC,MAAM,sBAAsB,SAAS;EACrC,IAAI,uBAAuB,oBAAoB,SAAS,GACtD,OAAO;EAGT,MAAM,eAAyB,CAAC;EAChC,KAAK,IAAI,QAAQ,GAAG,QAAQ,SAAS,YAAY,QAAQ,SAAS,GAEhE,IADqB,SAAS,aAAa,MACvC,EAAc,MAAM,gBACtB,aAAa,KAAK,KAAK;EAI3B,OAAO;CACT;CAEA,IAAI,oBAAqC;CACzC,MAAM,2BAAqC;EACzC,IAAI,mBACF,OAAO;EAGT,oBAAoB,mBAAmB;EACvC,OAAO;CACT;CAEA,MAAM,eACJ,SAAS,uBAAuB,eAAe,mBAAmB,IAAI,CAAC;CACzE,IAAI,wBAAwB;CAE5B,MAAM,wBAAwB,iBAAiC;EAC7D,IAAI,aAAa,WAAW,GAAG;GAC7B,wBAAwB;GACxB;EACF;EAEA,MAAM,eAAe,SAAS;EAC9B,MAAM,aAAa,OAAO;EAE1B,KAAK,IAAI,aAAa,GAAG,aAAa,aAAa,QAAQ,cAAc;GACvE,MAAM,IAAI,aAAa;GACvB,MAAM,eAAe,aAAa;GAClC,IAAI,CAAC,cACH;GAGF,IAAI,QAAQ,2BAA2B,aAAa,KAAK,GACvD;GAGF,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,EACjB;GACA,IAAI,CAAC,KACH;GAGF,MAAM,SAAS,WAAW,MAAM;GAChC,IAAI,IAAI,eAAe,UAAU,QAAQ,QAAQ;IAC/C,iBAAiB,WAAW;IAC5B,OAAO,aAAa,KAAK,MAAM;GACjC;EACF;EAEA,wBAAwB;CAC1B;CAEA,MAAM,yBAA+B;EACnC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;GACpD,MAAM,eAAe,SAAS,aAAa;GAC3C,IAAI,CAAC,cACH;GAGF,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,EACjB;GACA,IAAI,CAAC,KACH;GAGF,IAAI,IAAI,eAAe,QAAQ;IAC7B,MAAM,SAAS,OAAO,WAAW,MAAM;IACvC,iBAAiB,WAAW;IAC5B,OAAO,aAAa,KAAK,MAAM;GACjC;EACF;EAEA,wBAAwB;CAC1B;CAEA,MAAM,qBAA2B;EAK/B,IAHE,CAAC,SAAS,uBACV,SAAS,iBAAiB,WAAW,KACrC,OAAO,WAAW,WAAW,SAAS,YAAY,QAC7B;GACrB,IAAI,aAAa;GACjB,IAAI,cAAc,OAAO;GAEzB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;IACpD,MAAM,eAAe,SAAS,aAAa;IAC3C,IAAI,CAAC,cAAc;KACjB,aAAa;KACb,cAAc,aAAa,eAAe;KAC1C;IACF;IAEA,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,EACjB;IACA,IAAI,CAAC,OAAO,IAAI,eAAe,UAAU,QAAQ,aAC/C,aAAa;IAGf,cAAc,aAAa,eAAe;GAC5C;GAEA,IAAI,YAAY;IACd,wBAAwB;IACxB;GACF;EACF;EAEA,qBAAqB,oBAAoB;GACvC,MAAM,WAAW,OAAO,cAAc,uBAAuB;GAC7D,IAAI,mBAAmB;GAEvB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;IACpD,MAAM,eAAe,SAAS,aAAa;IAC3C,IAAI,CAAC,cACH;IAGF,IACE,aAAa,MAAM,KAAK,eAAe,UACvC,CAAC,aAAa,MAAM,gBAEpB;IAGF,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,EACjB;IACA,IAAI,CAAC,KACH;IAGF,IAAI,IAAI,eAAe,QAAQ;KAC7B,iBAAiB,WAAW;KAC5B,SAAS,YAAY,GAAG;KACxB,mBAAmB;IACrB;GACF;GAEA,IAAI,kBACF,OAAO,YAAY,QAAQ;EAE/B,CAAC;EAED,wBAAwB;CAC1B;CAEA,MAAM,mBAAyB;EAC7B,MAAM,cAAc,SAAS;EAC7B,IAAI,CAAC,aACH;EAGF,IAAI,CAAC,YAAY,eAAe;EAChC,IAAI,eAAe,aACjB;EAGF,IAAI,aAAa,aACf,CAAC,YAAY,eAAe,CAAC,aAAa,UAAU;EAGtD,MAAM,WAAW,SAAS,YAAY;EACtC,MAAM,YAAY,SAAS,YAAY;EACvC,MAAM,YAAY,SAAS,MAAM,IAAI,QAAQ;EAC7C,MAAM,aAAa,SAAS,MAAM,IAAI,SAAS;EAE/C,IAAI,CAAC,aAAa,CAAC,YAAY;GAC7B,cAAc;GACd;EACF;EAEA,MAAM,WAAW,QAAQ,eACvB,QACA,UAAU,OACV,eAAe,WACjB;EACA,MAAM,YAAY,QAAQ,eACxB,QACA,WAAW,OACX,eAAe,YACjB;EAEA,IAAI,CAAC,YAAY,CAAC,WAAW;GAC3B,cAAc;GACd;EACF;EAEA,IAAI,SAAS,eAAe,UAAU,UAAU,eAAe,QAAQ;GACrE,cAAc;GACd;EACF;EAMA,KAHG,SAAS,wBAAwB,SAAS,IACzC,KAAK,iCACP,GACqB;GACrB,wBAAwB;GACxB;EACF;EAEA,MAAM,mBAAmB,SAAS;EAClC,iBAAiB,SAAS;EAC1B,OAAO,aAAa,UAAU,SAAS;EACvC,iBAAiB,SAAS;EAC1B,OAAO,aAAa,WAAW,gBAAgB;EAE/C,wBAAwB;CAC1B;CAEA,MAAM,sBAA4B;EAChC,MAAM,QAAQ,SAAS;EACvB,MAAM,QAAQ,MAAM;EAEpB,IAAI,SAAS,mBAAmB,SAAS,iBAAiB,WAAW,GAAG;GACtE,MAAM,QAAQ,MAAY,KAAK;GAC/B,IAAI,aAAa;GACjB,IAAI,gBAAgB;GAEpB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;IAC9B,MAAM,eAAe,MAAM;IAC3B,IAAI,CAAC,cACH;IAGF,MAAM,QAAQ,aAAa;IAC3B,MAAM,MACJ,MAAM,OAAO,CAAC,MAAM,iBAChB,MAAM,MACN,QAAQ,eAAe,QAAQ,OAAO,eAAe,EAAE;IAE7D,IAAI,CAAC,KACH;IAGF,IAAI,IAAI,eAAe,QACrB;SAEA;IAEF,MAAM,KAAK;GACb;GAEA,IAAI,CAAC,kCAAkC,KAAK,GAAG;IAC7C,IAAI,aAAa,GACf,iBAAiB,WAAW,UAAU;IAExC,IAAI,gBAAgB,GAClB,iBAAiB,aAAa,aAAa;IAE7C,uBAAuB,QAAQ,OAAO,KAAK;IAC3C,wBAAwB;IACxB;GACF;GAEA,IAAI,gBAAgB,GAAG;IACrB,IAAI,aAAa,GACf,iBAAiB,WAAW,UAAU;IAExC,iBAAiB,aAAa,aAAa;IAC3C,uBAAuB,QAAQ,OAAO,IAAI;IAC1C,wBAAwB;IACxB;GACF;GAEA,IAAI,QAAQ,KAAK,sBAAsB,QAAQ,KAAK,GAAG;IACrD,wBAAwB;IACxB;GACF;GAEA,IAAI,aAAa,GACf,iBAAiB,WAAW,UAAU;GAExC,IAAI,gBAAgB,GAClB,iBAAiB,aAAa,aAAa;GAG7C,uBAAuB,QAAQ,OAAO,IAAI;GAC1C,wBAAwB;GACxB;EACF;EAEA,IAAI,mBAAmB;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAEzB,IADqB,MAAM,EACvB,EAAc,MAAM,KAAK,eAAe,QAAQ;GAClD,mBAAmB;GACnB;EACF;EAGF,IAAI,CAAC,kBAAkB;GACrB,qBAAqB,oBAAoB;IACvC,MAAM,QAAgB,CAAC;IACvB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;KAC9B,MAAM,eAAe,MAAM;KAC3B,IAAI,CAAC,cAAc;KACnB,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,EACjB;KACA,IAAI,KAAK;MACP,iBAAiB,WAAW;MAC5B,MAAM,KAAK,GAAG;KAChB;IACF;IACA,mBAAmB,wBAAwB;IAC3C,uBAAuB,QAAQ,OAAO,KAAK;GAC7C,CAAC;GAED,wBAAwB;GACxB;EACF;EAEA,IAAI,SAAS,iBAAiB,WAAW,GAAG;GAC1C,MAAM,QAAgB,CAAC;GAEvB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;IAC9B,MAAM,eAAe,MAAM;IAC3B,IAAI,CAAC,cACH;IAGF,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,EACjB;IACA,IAAI,CAAC,KACH;IAGF,iBAAiB,IAAI,eAAe,SAAS,YAAY,WAAW;IACpE,MAAM,KAAK,GAAG;GAChB;GAEA,uBAAuB,QAAQ,OAAO,KAAK;GAC3C,wBAAwB;GACxB;EACF;EAEA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,eAAe,MAAM;GAC3B,IAAI,CAAC,cACH;GAGF,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,EACjB;GACA,IAAI,CAAC,KACH;GAGF,MAAM,SAAS,OAAO,WAAW,MAAM;GACvC,IAAI,QAAQ,QAAQ;IAClB,iBAAiB,SAAS;IAC1B,OAAO,aAAa,KAAK,MAAM;GACjC;EACF;EAEA,wBAAwB;CAC1B;CAWA,IARE,SAAS,uBAAuB,gBAChC,aAAa,SAAS,KACtB,SAAS,wBAAwB,QACjC,SAAS,uBAAuB,QAChC,CAAC,SAAS,mBACV,SAAS,iBAAiB,WAAW,KACrC,OAAO,WAAW,WAAW,SAAS,YAAY,QAExB;EAC1B,qBAAqB,YAAY;EACjC,yBAAyB,QAAQ,UAAU,cAAc,CAAC,CAAC;EAE3D,kBAAkB,aAAa,YAAY,IAAI,IAAI,cAAc;EACjE,uBAAuB,QAAQ;EAC/B;CACF;CAEA,QAAQ,SAAS,oBAAjB;EACE,KAAK;GACH,qBAAqB,YAAY;GACjC;EACF,KAAK;GACH,iBAAiB;GACjB;EACF,KAAK;GACH,aAAa;GACb;EACF,KAAK;GACH,WAAW;GACX;EAEF;GACE,cAAc;GACd;CACJ;CAEA,uBAAuB,QAAQ,SAAS,gBAAgB;CACxD,IAAI,SAAS,iBAAiB,SAAS,GACrC,wBAAwB;CAE1B,yBACE,QACA,UACA,SAAS,oBACT,SAAS,gBACX;CAEA,MAAM,qCAA2C;EAC/C,MAAM,gBAAwB,CAAC;EAE/B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;GACpD,MAAM,eAAe,SAAS,aAAa;GAC3C,IAAI,CAAC,cACH;GAGF,MAAM,MACJ,aAAa,MAAM,OAAO,CAAC,aAAa,MAAM,iBAC1C,aAAa,MAAM,MACnB,QAAQ,eACN,QACA,aAAa,OACb,eAAe,EACjB;GACN,IAAI,KACF,cAAc,KAAK,GAAG;EAE1B;EAEA,MAAM,eAAe,MAAM,KAAK,OAAO,UAAU;EACjD,IACE,aAAa,WAAW,cAAc,UACtC,aAAa,OAAO,MAAM,UAAU,SAAS,cAAc,MAAM,GAEjE;EAGF,MAAM,kBAAkB,IAAI,IAAI,aAAa;EAC7C,KAAK,MAAM,eAAe,cAAc;GACtC,IAAI,gBAAgB,IAAI,WAAW,GACjC;GAGF,oBAAoB,WAAW;GAE/B,IAAI,YAAY,eAAe,QAAQ;IACrC,iBAAiB,WAAW;IAC5B,YAAY,OAAO;GACrB;EACF;EAEA,uBAAuB,QAAQ,eAAe,IAAI;CACpD;CAEA,IAAI,CAAC,uBACH,6BAA6B;CAE/B,SAAS,sBAAsB;CAC/B,kBAAkB,aAAa,YAAY,IAAI,IAAI,cAAc;CACjE,uBAAuB,QAAQ;AACjC"}
+{"version":3,"file":"for-commit.js","names":[],"sources":["../../src/renderer/for-commit.ts"],"sourcesContent":["import type { ChildScope } from '../runtime/child-scope';\nimport {\n  clearForDomUpdateState,\n  recordBenchCounter,\n  recordBenchEvent,\n  recordBenchTiming,\n  type ForState,\n  withBenchMetricScope,\n} from '../runtime/for';\nimport { teardownNodeSubtree } from './cleanup';\nimport { keyedElements } from './keyed';\nimport type { VNode } from './types';\nimport { canUseDirectReplaceChildrenSpread } from './utils';\nimport {\n  getOrBuildDomKeyMap,\n  hydrateExistingForDomInOrder,\n  syncKeyedMapFromForState,\n} from './for-commit-dom-map';\nimport {\n  commitMoveOnlyReorder,\n  replaceChildrenInOrder,\n} from './for-commit-reorder';\nimport { removeForBoundaryNodes } from './for-commit-removal';\n\nexport interface ForCommitRuntime {\n  isProduction(): boolean;\n  syncForItemDom(parent: Element, scope: ChildScope, vnode: VNode): Node | null;\n  tryPatchStableForDirtyItem(scope: ChildScope): boolean;\n}\n\nexport function commitForStateBoundaryChildren(\n  parent: Element,\n  forState: ForState<unknown>,\n  childrenVNodes: VNode[],\n  runtime: ForCommitRuntime\n): void {\n  const domCommitStart = performance.now();\n\n  const hydrateExistingForDom = (): void => {\n    if (hydrateExistingForDomInOrder(parent, forState)) {\n      return;\n    }\n\n    const domKeyMap = getOrBuildDomKeyMap(parent);\n    if (!domKeyMap) {\n      return;\n    }\n\n    for (let i = 0; i < forState.orderedKeys.length; i++) {\n      const itemKey = forState.orderedKeys[i];\n      const itemInstance = forState.items.get(itemKey);\n      if (!itemInstance || itemInstance.scope.dom) {\n        continue;\n      }\n\n      const existingDom = domKeyMap.get(itemKey);\n      if (!existingDom) {\n        continue;\n      }\n\n      itemInstance.scope.dom = existingDom;\n      itemInstance.scope.needsDomUpdate = true;\n    }\n  };\n\n  if (forState.orderedKeys.length === 0) {\n    removeForBoundaryNodes(parent, forState.lastRemovedNodes);\n\n    const fallbackScope = forState.fallbackScope;\n    const fallbackVNode = childrenVNodes[0];\n    const nextDom =\n      fallbackScope && fallbackVNode !== undefined\n        ? runtime.syncForItemDom(parent, fallbackScope, fallbackVNode)\n        : null;\n\n    if (nextDom) {\n      if (\n        parent.childNodes.length !== 1 ||\n        parent.firstChild !== nextDom ||\n        forState.lastRemovedNodes.length > 0\n      ) {\n        parent.replaceChildren(nextDom);\n      }\n    } else if (parent.firstChild) {\n      parent.textContent = '';\n    }\n\n    keyedElements.delete(parent);\n    forState._hasResolvedItemDom = false;\n    recordBenchTiming('domCommit', performance.now() - domCommitStart);\n    clearForDomUpdateState(forState);\n    return;\n  }\n\n  if (!forState._hasResolvedItemDom && parent.childNodes.length > 0) {\n    hydrateExistingForDom();\n  }\n\n  const getDirtyForIndices = (): number[] => {\n    const pendingDirtyIndices = forState.pendingDirtyIndices;\n    if (pendingDirtyIndices && pendingDirtyIndices.length > 0) {\n      return pendingDirtyIndices;\n    }\n\n    const dirtyIndices: number[] = [];\n    for (let index = 0; index < forState.orderedKeys.length; index += 1) {\n      const itemInstance = forState.orderedItems[index];\n      if (itemInstance?.scope.needsDomUpdate) {\n        dirtyIndices.push(index);\n      }\n    }\n\n    return dirtyIndices;\n  };\n\n  let dirtyIndicesCache: number[] | null = null;\n  const ensureDirtyIndices = (): number[] => {\n    if (dirtyIndicesCache) {\n      return dirtyIndicesCache;\n    }\n\n    dirtyIndicesCache = getDirtyForIndices();\n    return dirtyIndicesCache;\n  };\n\n  const dirtyIndices =\n    forState.lastCommitStrategy === 'NO_REORDER' ? ensureDirtyIndices() : [];\n  let boundaryChildrenExact = false;\n\n  const commitDirtyNoReorder = (dirtyIndices: number[]): void => {\n    if (dirtyIndices.length === 0) {\n      boundaryChildrenExact = true;\n      return;\n    }\n\n    const orderedItems = forState.orderedItems;\n    const childNodes = parent.childNodes;\n\n    for (let dirtyIndex = 0; dirtyIndex < dirtyIndices.length; dirtyIndex++) {\n      const i = dirtyIndices[dirtyIndex];\n      const itemInstance = orderedItems[i];\n      if (!itemInstance) {\n        continue;\n      }\n\n      if (runtime.tryPatchStableForDirtyItem(itemInstance.scope)) {\n        continue;\n      }\n\n      const dom = runtime.syncForItemDom(\n        parent,\n        itemInstance.scope,\n        childrenVNodes[i]\n      );\n      if (!dom) {\n        continue;\n      }\n\n      const anchor = childNodes[i] ?? null;\n      if (dom.parentNode !== parent || dom !== anchor) {\n        recordBenchEvent('domInsert');\n        parent.insertBefore(dom, anchor);\n      }\n    }\n\n    boundaryChildrenExact = true;\n  };\n\n  const commitPositional = (): void => {\n    for (let i = 0; i < forState.orderedKeys.length; i++) {\n      const itemInstance = forState.orderedItems[i];\n      if (!itemInstance) {\n        continue;\n      }\n\n      const dom = runtime.syncForItemDom(\n        parent,\n        itemInstance.scope,\n        childrenVNodes[i]\n      );\n      if (!dom) {\n        continue;\n      }\n\n      if (dom.parentNode !== parent) {\n        const anchor = parent.childNodes[i] ?? null;\n        recordBenchEvent('domInsert');\n        parent.insertBefore(dom, anchor);\n      }\n    }\n\n    boundaryChildrenExact = true;\n  };\n\n  const commitAppend = (): void => {\n    const canHydrateInPlace =\n      !forState._hasResolvedItemDom &&\n      forState.lastRemovedNodes.length === 0 &&\n      parent.childNodes.length === forState.orderedKeys.length;\n    if (canHydrateInPlace) {\n      let exactOrder = true;\n      let currentNode = parent.firstChild;\n\n      for (let i = 0; i < forState.orderedKeys.length; i++) {\n        const itemInstance = forState.orderedItems[i];\n        if (!itemInstance) {\n          exactOrder = false;\n          currentNode = currentNode?.nextSibling ?? null;\n          continue;\n        }\n\n        const dom = runtime.syncForItemDom(\n          parent,\n          itemInstance.scope,\n          childrenVNodes[i]\n        );\n        if (!dom || dom.parentNode !== parent || dom !== currentNode) {\n          exactOrder = false;\n        }\n\n        currentNode = currentNode?.nextSibling ?? null;\n      }\n\n      if (exactOrder) {\n        boundaryChildrenExact = true;\n        return;\n      }\n    }\n\n    withBenchMetricScope('coldCreate', () => {\n      const fragment = parent.ownerDocument.createDocumentFragment();\n      let hasPendingAppend = false;\n\n      for (let i = 0; i < forState.orderedKeys.length; i++) {\n        const itemInstance = forState.orderedItems[i];\n        if (!itemInstance) {\n          continue;\n        }\n\n        if (\n          itemInstance.scope.dom?.parentNode === parent &&\n          !itemInstance.scope.needsDomUpdate\n        ) {\n          continue;\n        }\n\n        const dom = runtime.syncForItemDom(\n          parent,\n          itemInstance.scope,\n          childrenVNodes[i]\n        );\n        if (!dom) {\n          continue;\n        }\n\n        if (dom.parentNode !== parent) {\n          recordBenchEvent('domInsert');\n          fragment.appendChild(dom);\n          hasPendingAppend = true;\n        }\n      }\n\n      if (hasPendingAppend) {\n        parent.appendChild(fragment);\n      }\n    });\n\n    boundaryChildrenExact = true;\n  };\n\n  const commitSwap = (): void => {\n    const swapIndices = forState.pendingSwapIndices;\n    if (!swapIndices) {\n      return;\n    }\n\n    let [firstIndex, secondIndex] = swapIndices;\n    if (firstIndex === secondIndex) {\n      return;\n    }\n\n    if (firstIndex > secondIndex) {\n      [firstIndex, secondIndex] = [secondIndex, firstIndex];\n    }\n\n    const firstKey = forState.orderedKeys[firstIndex];\n    const secondKey = forState.orderedKeys[secondIndex];\n    const firstItem = forState.items.get(firstKey);\n    const secondItem = forState.items.get(secondKey);\n\n    if (!firstItem || !secondItem) {\n      commitReorder();\n      return;\n    }\n\n    const firstDom = runtime.syncForItemDom(\n      parent,\n      firstItem.scope,\n      childrenVNodes[firstIndex]\n    );\n    const secondDom = runtime.syncForItemDom(\n      parent,\n      secondItem.scope,\n      childrenVNodes[secondIndex]\n    );\n\n    if (!firstDom || !secondDom) {\n      commitReorder();\n      return;\n    }\n\n    if (firstDom.parentNode !== parent || secondDom.parentNode !== parent) {\n      commitReorder();\n      return;\n    }\n\n    const firstBeforeSecond =\n      (firstDom.compareDocumentPosition(secondDom) &\n        Node.DOCUMENT_POSITION_FOLLOWING) !==\n      0;\n    if (firstBeforeSecond) {\n      boundaryChildrenExact = true;\n      return;\n    }\n\n    const firstNextSibling = firstDom.nextSibling;\n    recordBenchEvent('domMove');\n    parent.insertBefore(firstDom, secondDom);\n    recordBenchEvent('domMove');\n    parent.insertBefore(secondDom, firstNextSibling);\n\n    boundaryChildrenExact = true;\n  };\n\n  const commitReorder = (): void => {\n    const items = forState.orderedItems;\n    const count = items.length;\n\n    if (forState.pendingMoveOnly && forState.lastRemovedNodes.length === 0) {\n      const nodes = Array<Node>(count);\n      let movedCount = 0;\n      let insertedCount = 0;\n\n      for (let i = 0; i < count; i++) {\n        const itemInstance = items[i];\n        if (!itemInstance) {\n          return;\n        }\n\n        const scope = itemInstance.scope;\n        const dom =\n          scope.dom && !scope.needsDomUpdate\n            ? scope.dom\n            : runtime.syncForItemDom(parent, scope, childrenVNodes[i]);\n\n        if (!dom) {\n          return;\n        }\n\n        if (dom.parentNode === parent) {\n          movedCount++;\n        } else {\n          insertedCount++;\n        }\n        nodes[i] = dom;\n      }\n\n      if (!canUseDirectReplaceChildrenSpread(count)) {\n        if (movedCount > 0) {\n          recordBenchEvent('domMove', movedCount);\n        }\n        if (insertedCount > 0) {\n          recordBenchEvent('domInsert', insertedCount);\n        }\n        replaceChildrenInOrder(parent, nodes, false);\n        boundaryChildrenExact = true;\n        return;\n      }\n\n      if (insertedCount > 0) {\n        if (movedCount > 0) {\n          recordBenchEvent('domMove', movedCount);\n        }\n        recordBenchEvent('domInsert', insertedCount);\n        replaceChildrenInOrder(parent, nodes, true);\n        boundaryChildrenExact = true;\n        return;\n      }\n\n      if (count > 1 && commitMoveOnlyReorder(parent, nodes)) {\n        boundaryChildrenExact = true;\n        return;\n      }\n\n      if (movedCount > 0) {\n        recordBenchEvent('domMove', movedCount);\n      }\n      if (insertedCount > 0) {\n        recordBenchEvent('domInsert', insertedCount);\n      }\n\n      replaceChildrenInOrder(parent, nodes, true);\n      boundaryChildrenExact = true;\n      return;\n    }\n\n    let hasExistingChild = false;\n    for (let i = 0; i < count; i++) {\n      const itemInstance = items[i];\n      if (itemInstance?.scope.dom?.parentNode === parent) {\n        hasExistingChild = true;\n        break;\n      }\n    }\n\n    if (!hasExistingChild) {\n      withBenchMetricScope('coldCreate', () => {\n        const nodes: Node[] = [];\n        for (let i = 0; i < count; i++) {\n          const itemInstance = items[i];\n          if (!itemInstance) continue;\n          const dom = runtime.syncForItemDom(\n            parent,\n            itemInstance.scope,\n            childrenVNodes[i]\n          );\n          if (dom) {\n            recordBenchEvent('domInsert');\n            nodes.push(dom);\n          }\n        }\n        recordBenchCounter('replaceChildrenCommits');\n        replaceChildrenInOrder(parent, nodes, false);\n      });\n\n      boundaryChildrenExact = true;\n      return;\n    }\n\n    if (forState.lastRemovedNodes.length === 0) {\n      const nodes: Node[] = [];\n\n      for (let i = 0; i < count; i++) {\n        const itemInstance = items[i];\n        if (!itemInstance) {\n          continue;\n        }\n\n        const dom = runtime.syncForItemDom(\n          parent,\n          itemInstance.scope,\n          childrenVNodes[i]\n        );\n        if (!dom) {\n          continue;\n        }\n\n        recordBenchEvent(dom.parentNode === parent ? 'domMove' : 'domInsert');\n        nodes.push(dom);\n      }\n\n      replaceChildrenInOrder(parent, nodes, false);\n      boundaryChildrenExact = true;\n      return;\n    }\n\n    for (let i = 0; i < count; i++) {\n      const itemInstance = items[i];\n      if (!itemInstance) {\n        continue;\n      }\n\n      const dom = runtime.syncForItemDom(\n        parent,\n        itemInstance.scope,\n        childrenVNodes[i]\n      );\n      if (!dom) {\n        continue;\n      }\n\n      const anchor = parent.childNodes[i] ?? null;\n      if (dom !== anchor) {\n        recordBenchEvent('domMove');\n        parent.insertBefore(dom, anchor);\n      }\n    }\n\n    boundaryChildrenExact = true;\n  };\n\n  const isLocalOnlyDirtyCommit =\n    forState.lastCommitStrategy === 'NO_REORDER' &&\n    dirtyIndices.length > 0 &&\n    forState.pendingDirtyIndices === null &&\n    forState.pendingSwapIndices === null &&\n    !forState.pendingMoveOnly &&\n    forState.lastRemovedNodes.length === 0 &&\n    parent.childNodes.length === forState.orderedKeys.length;\n\n  if (isLocalOnlyDirtyCommit) {\n    commitDirtyNoReorder(dirtyIndices);\n    syncKeyedMapFromForState(parent, forState, 'NO_REORDER', []);\n\n    recordBenchTiming('domCommit', performance.now() - domCommitStart);\n    clearForDomUpdateState(forState);\n    return;\n  }\n\n  switch (forState.lastCommitStrategy) {\n    case 'NO_REORDER':\n      commitDirtyNoReorder(dirtyIndices);\n      break;\n    case 'TRUNCATE':\n      commitPositional();\n      break;\n    case 'APPEND':\n      commitAppend();\n      break;\n    case 'SWAP':\n      commitSwap();\n      break;\n    case 'FULL_KEYED':\n    default:\n      commitReorder();\n      break;\n  }\n\n  removeForBoundaryNodes(parent, forState.lastRemovedNodes);\n  if (forState.lastRemovedNodes.length > 0) {\n    boundaryChildrenExact = false;\n  }\n  syncKeyedMapFromForState(\n    parent,\n    forState,\n    forState.lastCommitStrategy,\n    forState.lastRemovedNodes\n  );\n\n  const syncExactForBoundaryChildren = (): void => {\n    const expectedNodes: Node[] = [];\n\n    for (let i = 0; i < forState.orderedKeys.length; i++) {\n      const itemInstance = forState.orderedItems[i];\n      if (!itemInstance) {\n        continue;\n      }\n\n      const dom =\n        itemInstance.scope.dom && !itemInstance.scope.needsDomUpdate\n          ? itemInstance.scope.dom\n          : runtime.syncForItemDom(\n              parent,\n              itemInstance.scope,\n              childrenVNodes[i]\n            );\n      if (dom) {\n        expectedNodes.push(dom);\n      }\n    }\n\n    const currentNodes = Array.from(parent.childNodes);\n    if (\n      currentNodes.length === expectedNodes.length &&\n      currentNodes.every((node, index) => node === expectedNodes[index])\n    ) {\n      return;\n    }\n\n    const expectedNodeSet = new Set(expectedNodes);\n    for (const currentNode of currentNodes) {\n      if (expectedNodeSet.has(currentNode)) {\n        continue;\n      }\n\n      teardownNodeSubtree(currentNode);\n\n      if (currentNode.parentNode === parent) {\n        recordBenchEvent('domRemove');\n        currentNode.remove();\n      }\n    }\n\n    replaceChildrenInOrder(parent, expectedNodes, true);\n  };\n\n  if (!boundaryChildrenExact) {\n    syncExactForBoundaryChildren();\n  }\n  forState._hasResolvedItemDom = true;\n  recordBenchTiming('domCommit', performance.now() - domCommitStart);\n  clearForDomUpdateState(forState);\n}\n"],"mappings":";;;;;;;;;;AA8BA,SAAgB,+BACd,QACA,UACA,gBACA,SACM;CACN,MAAM,iBAAiB,YAAY,IAAI;CAEvC,MAAM,8BAAoC;EACxC,IAAI,6BAA6B,QAAQ,QAAQ,GAC/C;EAGF,MAAM,YAAY,oBAAoB,MAAM;EAC5C,IAAI,CAAC,WACH;EAGF,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;GACpD,MAAM,UAAU,SAAS,YAAY;GACrC,MAAM,eAAe,SAAS,MAAM,IAAI,OAAO;GAC/C,IAAI,CAAC,gBAAgB,aAAa,MAAM,KACtC;GAGF,MAAM,cAAc,UAAU,IAAI,OAAO;GACzC,IAAI,CAAC,aACH;GAGF,aAAa,MAAM,MAAM;GACzB,aAAa,MAAM,iBAAiB;EACtC;CACF;CAEA,IAAI,SAAS,YAAY,WAAW,GAAG;EACrC,uBAAuB,QAAQ,SAAS,gBAAgB;EAExD,MAAM,gBAAgB,SAAS;EAC/B,MAAM,gBAAgB,eAAe;EACrC,MAAM,UACJ,iBAAiB,kBAAkB,SAC/B,QAAQ,eAAe,QAAQ,eAAe,aAAa,IAC3D;EAEN,IAAI,SACF;OACE,OAAO,WAAW,WAAW,KAC7B,OAAO,eAAe,WACtB,SAAS,iBAAiB,SAAS,GAEnC,OAAO,gBAAgB,OAAO;EAChC,OACK,IAAI,OAAO,YAChB,OAAO,cAAc;EAGvB,cAAc,OAAO,MAAM;EAC3B,SAAS,sBAAsB;EAC/B,kBAAkB,aAAa,YAAY,IAAI,IAAI,cAAc;EACjE,uBAAuB,QAAQ;EAC/B;CACF;CAEA,IAAI,CAAC,SAAS,uBAAuB,OAAO,WAAW,SAAS,GAC9D,sBAAsB;CAGxB,MAAM,2BAAqC;EACzC,MAAM,sBAAsB,SAAS;EACrC,IAAI,uBAAuB,oBAAoB,SAAS,GACtD,OAAO;EAGT,MAAM,eAAyB,CAAC;EAChC,KAAK,IAAI,QAAQ,GAAG,QAAQ,SAAS,YAAY,QAAQ,SAAS,GAEhE,IADqB,SAAS,aAAa,MACvC,EAAc,MAAM,gBACtB,aAAa,KAAK,KAAK;EAI3B,OAAO;CACT;CAEA,IAAI,oBAAqC;CACzC,MAAM,2BAAqC;EACzC,IAAI,mBACF,OAAO;EAGT,oBAAoB,mBAAmB;EACvC,OAAO;CACT;CAEA,MAAM,eACJ,SAAS,uBAAuB,eAAe,mBAAmB,IAAI,CAAC;CACzE,IAAI,wBAAwB;CAE5B,MAAM,wBAAwB,iBAAiC;EAC7D,IAAI,aAAa,WAAW,GAAG;GAC7B,wBAAwB;GACxB;EACF;EAEA,MAAM,eAAe,SAAS;EAC9B,MAAM,aAAa,OAAO;EAE1B,KAAK,IAAI,aAAa,GAAG,aAAa,aAAa,QAAQ,cAAc;GACvE,MAAM,IAAI,aAAa;GACvB,MAAM,eAAe,aAAa;GAClC,IAAI,CAAC,cACH;GAGF,IAAI,QAAQ,2BAA2B,aAAa,KAAK,GACvD;GAGF,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,EACjB;GACA,IAAI,CAAC,KACH;GAGF,MAAM,SAAS,WAAW,MAAM;GAChC,IAAI,IAAI,eAAe,UAAU,QAAQ,QAAQ;IAC/C,iBAAiB,WAAW;IAC5B,OAAO,aAAa,KAAK,MAAM;GACjC;EACF;EAEA,wBAAwB;CAC1B;CAEA,MAAM,yBAA+B;EACnC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;GACpD,MAAM,eAAe,SAAS,aAAa;GAC3C,IAAI,CAAC,cACH;GAGF,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,EACjB;GACA,IAAI,CAAC,KACH;GAGF,IAAI,IAAI,eAAe,QAAQ;IAC7B,MAAM,SAAS,OAAO,WAAW,MAAM;IACvC,iBAAiB,WAAW;IAC5B,OAAO,aAAa,KAAK,MAAM;GACjC;EACF;EAEA,wBAAwB;CAC1B;CAEA,MAAM,qBAA2B;EAK/B,IAHE,CAAC,SAAS,uBACV,SAAS,iBAAiB,WAAW,KACrC,OAAO,WAAW,WAAW,SAAS,YAAY,QAC7B;GACrB,IAAI,aAAa;GACjB,IAAI,cAAc,OAAO;GAEzB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;IACpD,MAAM,eAAe,SAAS,aAAa;IAC3C,IAAI,CAAC,cAAc;KACjB,aAAa;KACb,cAAc,aAAa,eAAe;KAC1C;IACF;IAEA,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,EACjB;IACA,IAAI,CAAC,OAAO,IAAI,eAAe,UAAU,QAAQ,aAC/C,aAAa;IAGf,cAAc,aAAa,eAAe;GAC5C;GAEA,IAAI,YAAY;IACd,wBAAwB;IACxB;GACF;EACF;EAEA,qBAAqB,oBAAoB;GACvC,MAAM,WAAW,OAAO,cAAc,uBAAuB;GAC7D,IAAI,mBAAmB;GAEvB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;IACpD,MAAM,eAAe,SAAS,aAAa;IAC3C,IAAI,CAAC,cACH;IAGF,IACE,aAAa,MAAM,KAAK,eAAe,UACvC,CAAC,aAAa,MAAM,gBAEpB;IAGF,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,EACjB;IACA,IAAI,CAAC,KACH;IAGF,IAAI,IAAI,eAAe,QAAQ;KAC7B,iBAAiB,WAAW;KAC5B,SAAS,YAAY,GAAG;KACxB,mBAAmB;IACrB;GACF;GAEA,IAAI,kBACF,OAAO,YAAY,QAAQ;EAE/B,CAAC;EAED,wBAAwB;CAC1B;CAEA,MAAM,mBAAyB;EAC7B,MAAM,cAAc,SAAS;EAC7B,IAAI,CAAC,aACH;EAGF,IAAI,CAAC,YAAY,eAAe;EAChC,IAAI,eAAe,aACjB;EAGF,IAAI,aAAa,aACf,CAAC,YAAY,eAAe,CAAC,aAAa,UAAU;EAGtD,MAAM,WAAW,SAAS,YAAY;EACtC,MAAM,YAAY,SAAS,YAAY;EACvC,MAAM,YAAY,SAAS,MAAM,IAAI,QAAQ;EAC7C,MAAM,aAAa,SAAS,MAAM,IAAI,SAAS;EAE/C,IAAI,CAAC,aAAa,CAAC,YAAY;GAC7B,cAAc;GACd;EACF;EAEA,MAAM,WAAW,QAAQ,eACvB,QACA,UAAU,OACV,eAAe,WACjB;EACA,MAAM,YAAY,QAAQ,eACxB,QACA,WAAW,OACX,eAAe,YACjB;EAEA,IAAI,CAAC,YAAY,CAAC,WAAW;GAC3B,cAAc;GACd;EACF;EAEA,IAAI,SAAS,eAAe,UAAU,UAAU,eAAe,QAAQ;GACrE,cAAc;GACd;EACF;EAMA,KAHG,SAAS,wBAAwB,SAAS,IACzC,KAAK,iCACP,GACqB;GACrB,wBAAwB;GACxB;EACF;EAEA,MAAM,mBAAmB,SAAS;EAClC,iBAAiB,SAAS;EAC1B,OAAO,aAAa,UAAU,SAAS;EACvC,iBAAiB,SAAS;EAC1B,OAAO,aAAa,WAAW,gBAAgB;EAE/C,wBAAwB;CAC1B;CAEA,MAAM,sBAA4B;EAChC,MAAM,QAAQ,SAAS;EACvB,MAAM,QAAQ,MAAM;EAEpB,IAAI,SAAS,mBAAmB,SAAS,iBAAiB,WAAW,GAAG;GACtE,MAAM,QAAQ,MAAY,KAAK;GAC/B,IAAI,aAAa;GACjB,IAAI,gBAAgB;GAEpB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;IAC9B,MAAM,eAAe,MAAM;IAC3B,IAAI,CAAC,cACH;IAGF,MAAM,QAAQ,aAAa;IAC3B,MAAM,MACJ,MAAM,OAAO,CAAC,MAAM,iBAChB,MAAM,MACN,QAAQ,eAAe,QAAQ,OAAO,eAAe,EAAE;IAE7D,IAAI,CAAC,KACH;IAGF,IAAI,IAAI,eAAe,QACrB;SAEA;IAEF,MAAM,KAAK;GACb;GAEA,IAAI,CAAC,kCAAkC,KAAK,GAAG;IAC7C,IAAI,aAAa,GACf,iBAAiB,WAAW,UAAU;IAExC,IAAI,gBAAgB,GAClB,iBAAiB,aAAa,aAAa;IAE7C,uBAAuB,QAAQ,OAAO,KAAK;IAC3C,wBAAwB;IACxB;GACF;GAEA,IAAI,gBAAgB,GAAG;IACrB,IAAI,aAAa,GACf,iBAAiB,WAAW,UAAU;IAExC,iBAAiB,aAAa,aAAa;IAC3C,uBAAuB,QAAQ,OAAO,IAAI;IAC1C,wBAAwB;IACxB;GACF;GAEA,IAAI,QAAQ,KAAK,sBAAsB,QAAQ,KAAK,GAAG;IACrD,wBAAwB;IACxB;GACF;GAEA,IAAI,aAAa,GACf,iBAAiB,WAAW,UAAU;GAExC,IAAI,gBAAgB,GAClB,iBAAiB,aAAa,aAAa;GAG7C,uBAAuB,QAAQ,OAAO,IAAI;GAC1C,wBAAwB;GACxB;EACF;EAEA,IAAI,mBAAmB;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAEzB,IADqB,MAAM,EACvB,EAAc,MAAM,KAAK,eAAe,QAAQ;GAClD,mBAAmB;GACnB;EACF;EAGF,IAAI,CAAC,kBAAkB;GACrB,qBAAqB,oBAAoB;IACvC,MAAM,QAAgB,CAAC;IACvB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;KAC9B,MAAM,eAAe,MAAM;KAC3B,IAAI,CAAC,cAAc;KACnB,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,EACjB;KACA,IAAI,KAAK;MACP,iBAAiB,WAAW;MAC5B,MAAM,KAAK,GAAG;KAChB;IACF;IACA,mBAAmB,wBAAwB;IAC3C,uBAAuB,QAAQ,OAAO,KAAK;GAC7C,CAAC;GAED,wBAAwB;GACxB;EACF;EAEA,IAAI,SAAS,iBAAiB,WAAW,GAAG;GAC1C,MAAM,QAAgB,CAAC;GAEvB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;IAC9B,MAAM,eAAe,MAAM;IAC3B,IAAI,CAAC,cACH;IAGF,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,EACjB;IACA,IAAI,CAAC,KACH;IAGF,iBAAiB,IAAI,eAAe,SAAS,YAAY,WAAW;IACpE,MAAM,KAAK,GAAG;GAChB;GAEA,uBAAuB,QAAQ,OAAO,KAAK;GAC3C,wBAAwB;GACxB;EACF;EAEA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,eAAe,MAAM;GAC3B,IAAI,CAAC,cACH;GAGF,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,EACjB;GACA,IAAI,CAAC,KACH;GAGF,MAAM,SAAS,OAAO,WAAW,MAAM;GACvC,IAAI,QAAQ,QAAQ;IAClB,iBAAiB,SAAS;IAC1B,OAAO,aAAa,KAAK,MAAM;GACjC;EACF;EAEA,wBAAwB;CAC1B;CAWA,IARE,SAAS,uBAAuB,gBAChC,aAAa,SAAS,KACtB,SAAS,wBAAwB,QACjC,SAAS,uBAAuB,QAChC,CAAC,SAAS,mBACV,SAAS,iBAAiB,WAAW,KACrC,OAAO,WAAW,WAAW,SAAS,YAAY,QAExB;EAC1B,qBAAqB,YAAY;EACjC,yBAAyB,QAAQ,UAAU,cAAc,CAAC,CAAC;EAE3D,kBAAkB,aAAa,YAAY,IAAI,IAAI,cAAc;EACjE,uBAAuB,QAAQ;EAC/B;CACF;CAEA,QAAQ,SAAS,oBAAjB;EACE,KAAK;GACH,qBAAqB,YAAY;GACjC;EACF,KAAK;GACH,iBAAiB;GACjB;EACF,KAAK;GACH,aAAa;GACb;EACF,KAAK;GACH,WAAW;GACX;EAEF;GACE,cAAc;GACd;CACJ;CAEA,uBAAuB,QAAQ,SAAS,gBAAgB;CACxD,IAAI,SAAS,iBAAiB,SAAS,GACrC,wBAAwB;CAE1B,yBACE,QACA,UACA,SAAS,oBACT,SAAS,gBACX;CAEA,MAAM,qCAA2C;EAC/C,MAAM,gBAAwB,CAAC;EAE/B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;GACpD,MAAM,eAAe,SAAS,aAAa;GAC3C,IAAI,CAAC,cACH;GAGF,MAAM,MACJ,aAAa,MAAM,OAAO,CAAC,aAAa,MAAM,iBAC1C,aAAa,MAAM,MACnB,QAAQ,eACN,QACA,aAAa,OACb,eAAe,EACjB;GACN,IAAI,KACF,cAAc,KAAK,GAAG;EAE1B;EAEA,MAAM,eAAe,MAAM,KAAK,OAAO,UAAU;EACjD,IACE,aAAa,WAAW,cAAc,UACtC,aAAa,OAAO,MAAM,UAAU,SAAS,cAAc,MAAM,GAEjE;EAGF,MAAM,kBAAkB,IAAI,IAAI,aAAa;EAC7C,KAAK,MAAM,eAAe,cAAc;GACtC,IAAI,gBAAgB,IAAI,WAAW,GACjC;GAGF,oBAAoB,WAAW;GAE/B,IAAI,YAAY,eAAe,QAAQ;IACrC,iBAAiB,WAAW;IAC5B,YAAY,OAAO;GACrB;EACF;EAEA,uBAAuB,QAAQ,eAAe,IAAI;CACpD;CAEA,IAAI,CAAC,uBACH,6BAA6B;CAE/B,SAAS,sBAAsB;CAC/B,kBAAkB,aAAa,YAAY,IAAI,IAAI,cAAc;CACjE,uBAAuB,QAAQ;AACjC"}

package/dist/renderer/index.js

@@ -1,24 +1,36 @@
-import "../common/vnode.js";
+import { _isDOMElement } from "../common/vnode.js";
 import "./types.js";
-import { getKeyMapForElement, isKeyedReorderFastPathEligible } from "./keyed.js";
-import "./cleanup.js";
-import "./children.js";
-import { markReactivePropsDirtySource } from "./dom.js";
+import { configureRuntimeRenderer } from "../runtime/runtime.js";
+import { getDefaultRuntimeInstance } from "../runtime/access.js";
+import { REACTIVE_CHILDREN_KEY, cleanupInstanceIfPresent, cleanupInstancesUnder, elementListeners, elementReactivePropsCleanup, elementRefs, removeAllListeners, removeElementListeners, removeElementReactiveProps, removeElementRef, teardownNodeSubtree, updateElementRef } from "./cleanup.js";
+import { getKeyMapForElement, isKeyedReorderFastPathEligible, populateKeyMapForElement } from "./keyed.js";
+import "./boundaries.js";
+import { isBulkTextFastPathEligible, performBulkPositionalKeyedTextUpdate, performBulkTextReplace } from "./children.js";
+import { syncComponentElement } from "./component-host.js";
+import { setStaticChildSlotsCacheEnabled } from "./static-reuse.js";
+import { updateElementChildren, updateUnkeyedChildren } from "./element-children.js";
+import { markReactivePropsDirtySource } from "./prop-bindings.js";
+import { tryPatchStableForDirtyItem } from "./stable-patch.js";
+import { IS_DOM_AVAILABLE, createDOMNode, updateElementFromVnode } from "./dom-internal.js";
+import "./dom.js";
 import { evaluate } from "./evaluate.js";
 //#region src/renderer/index.ts
-function installRendererBridge() {
-	if (typeof globalThis !== "undefined") {
-		const _g = globalThis;
-		_g.__ASKR_RENDERER = {
-			evaluate,
-			isKeyedReorderFastPathEligible,
-			getKeyMapForElement,
-			markReactivePropsDirtySource
-		};
-	}
+function createRendererHost() {
+	return {
+		evaluate,
+		cleanupInstancesUnder,
+		teardownNodeSubtree,
+		populateKeyMapForElement,
+		getKeyMapForElement,
+		isKeyedReorderFastPathEligible,
+		markReactivePropsDirtySource
+	};
+}
+function installRendererBridge(runtime = getDefaultRuntimeInstance()) {
+	configureRuntimeRenderer(createRendererHost(), runtime);
 	return true;
 }
 //#endregion
-export { installRendererBridge };
+export { IS_DOM_AVAILABLE, REACTIVE_CHILDREN_KEY, _isDOMElement, cleanupInstanceIfPresent, cleanupInstancesUnder, createDOMNode, createRendererHost, elementListeners, elementReactivePropsCleanup, elementRefs, installRendererBridge, isBulkTextFastPathEligible, markReactivePropsDirtySource, performBulkPositionalKeyedTextUpdate, performBulkTextReplace, removeAllListeners, removeElementListeners, removeElementReactiveProps, removeElementRef, setStaticChildSlotsCacheEnabled, syncComponentElement, teardownNodeSubtree, tryPatchStableForDirtyItem, updateElementChildren, updateElementFromVnode, updateElementRef, updateUnkeyedChildren };
 
 //# sourceMappingURL=index.js.map