@askrjs/askr 0.0.36 → 0.0.38

package/dist/renderer/for-commit.js

@@ -0,0 +1,486 @@
+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";
+//#region src/renderer/for-commit.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 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;
+	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 = () => {
+		if (hydrateExistingForDomInOrder(parent, forState)) return;
+		const domKeyMap = getOrBuildDomKeyMap(parent);
+		if (!domKeyMap) return;
+		for (let i = 0; i < forState.orderedKeys.length; i++) {
+			const itemKey = forState.orderedKeys[i];
+			const itemInstance = forState.items.get(itemKey);
+			if (!itemInstance || itemInstance.scope.dom) continue;
+			const existingDom = domKeyMap.get(itemKey);
+			if (!existingDom) continue;
+			itemInstance.scope.dom = existingDom;
+			itemInstance.scope.needsDomUpdate = true;
+		}
+	};
+	if (forState.orderedKeys.length === 0) {
+		removeForBoundaryNodes(parent, forState.lastRemovedNodes);
+		const fallbackScope = forState.fallbackScope;
+		const fallbackVNode = childrenVNodes[0];
+		const nextDom = fallbackScope && fallbackVNode !== void 0 ? runtime.syncForItemDom(parent, fallbackScope, fallbackVNode) : null;
+		if (nextDom) {
+			if (parent.childNodes.length !== 1 || parent.firstChild !== nextDom || forState.lastRemovedNodes.length > 0) parent.replaceChildren(nextDom);
+		} else if (parent.firstChild) parent.textContent = "";
+		keyedElements.delete(parent);
+		forState._hasResolvedItemDom = false;
+		recordBenchTiming("domCommit", performance.now() - domCommitStart);
+		clearForDomUpdateState(forState);
+		return;
+	}
+	if (!forState._hasResolvedItemDom && parent.childNodes.length > 0) hydrateExistingForDom();
+	const getDirtyForIndices = () => {
+		const pendingDirtyIndices = forState.pendingDirtyIndices;
+		if (pendingDirtyIndices && pendingDirtyIndices.length > 0) return pendingDirtyIndices;
+		const dirtyIndices = [];
+		for (let index = 0; index < forState.orderedKeys.length; index += 1) if (forState.orderedItems[index]?.scope.needsDomUpdate) dirtyIndices.push(index);
+		return dirtyIndices;
+	};
+	let dirtyIndicesCache = null;
+	const ensureDirtyIndices = () => {
+		if (dirtyIndicesCache) return dirtyIndicesCache;
+		dirtyIndicesCache = getDirtyForIndices();
+		return dirtyIndicesCache;
+	};
+	const dirtyIndices = forState.lastCommitStrategy === "NO_REORDER" ? ensureDirtyIndices() : [];
+	let boundaryChildrenExact = false;
+	const commitDirtyNoReorder = (dirtyIndices) => {
+		if (dirtyIndices.length === 0) {
+			boundaryChildrenExact = true;
+			return;
+		}
+		const orderedItems = forState.orderedItems;
+		const childNodes = parent.childNodes;
+		for (let dirtyIndex = 0; dirtyIndex < dirtyIndices.length; dirtyIndex++) {
+			const i = dirtyIndices[dirtyIndex];
+			const itemInstance = orderedItems[i];
+			if (!itemInstance) continue;
+			if (runtime.tryPatchStableForDirtyItem(itemInstance.scope)) continue;
+			const dom = runtime.syncForItemDom(parent, itemInstance.scope, childrenVNodes[i]);
+			if (!dom) continue;
+			const anchor = childNodes[i] ?? null;
+			if (dom.parentNode !== parent || dom !== anchor) {
+				recordBenchEvent("domInsert");
+				parent.insertBefore(dom, anchor);
+			}
+		}
+		boundaryChildrenExact = true;
+	};
+	const commitPositional = () => {
+		for (let i = 0; i < forState.orderedKeys.length; i++) {
+			const itemInstance = forState.orderedItems[i];
+			if (!itemInstance) continue;
+			const dom = runtime.syncForItemDom(parent, itemInstance.scope, childrenVNodes[i]);
+			if (!dom) continue;
+			if (dom.parentNode !== parent) {
+				const anchor = parent.childNodes[i] ?? null;
+				recordBenchEvent("domInsert");
+				parent.insertBefore(dom, anchor);
+			}
+		}
+		boundaryChildrenExact = true;
+	};
+	const commitAppend = () => {
+		if (!forState._hasResolvedItemDom && forState.lastRemovedNodes.length === 0 && parent.childNodes.length === forState.orderedKeys.length) {
+			let exactOrder = true;
+			let currentNode = parent.firstChild;
+			for (let i = 0; i < forState.orderedKeys.length; i++) {
+				const itemInstance = forState.orderedItems[i];
+				if (!itemInstance) {
+					exactOrder = false;
+					currentNode = currentNode?.nextSibling ?? null;
+					continue;
+				}
+				const dom = runtime.syncForItemDom(parent, itemInstance.scope, childrenVNodes[i]);
+				if (!dom || dom.parentNode !== parent || dom !== currentNode) exactOrder = false;
+				currentNode = currentNode?.nextSibling ?? null;
+			}
+			if (exactOrder) {
+				boundaryChildrenExact = true;
+				return;
+			}
+		}
+		withBenchMetricScope("coldCreate", () => {
+			const fragment = parent.ownerDocument.createDocumentFragment();
+			let hasPendingAppend = false;
+			for (let i = 0; i < forState.orderedKeys.length; i++) {
+				const itemInstance = forState.orderedItems[i];
+				if (!itemInstance) continue;
+				if (itemInstance.scope.dom?.parentNode === parent && !itemInstance.scope.needsDomUpdate) continue;
+				const dom = runtime.syncForItemDom(parent, itemInstance.scope, childrenVNodes[i]);
+				if (!dom) continue;
+				if (dom.parentNode !== parent) {
+					recordBenchEvent("domInsert");
+					fragment.appendChild(dom);
+					hasPendingAppend = true;
+				}
+			}
+			if (hasPendingAppend) parent.appendChild(fragment);
+		});
+		boundaryChildrenExact = true;
+	};
+	const commitSwap = () => {
+		const swapIndices = forState.pendingSwapIndices;
+		if (!swapIndices) return;
+		let [firstIndex, secondIndex] = swapIndices;
+		if (firstIndex === secondIndex) return;
+		if (firstIndex > secondIndex) [firstIndex, secondIndex] = [secondIndex, firstIndex];
+		const firstKey = forState.orderedKeys[firstIndex];
+		const secondKey = forState.orderedKeys[secondIndex];
+		const firstItem = forState.items.get(firstKey);
+		const secondItem = forState.items.get(secondKey);
+		if (!firstItem || !secondItem) {
+			commitReorder();
+			return;
+		}
+		const firstDom = runtime.syncForItemDom(parent, firstItem.scope, childrenVNodes[firstIndex]);
+		const secondDom = runtime.syncForItemDom(parent, secondItem.scope, childrenVNodes[secondIndex]);
+		if (!firstDom || !secondDom) {
+			commitReorder();
+			return;
+		}
+		if (firstDom.parentNode !== parent || secondDom.parentNode !== parent) {
+			commitReorder();
+			return;
+		}
+		if ((firstDom.compareDocumentPosition(secondDom) & Node.DOCUMENT_POSITION_FOLLOWING) !== 0) {
+			boundaryChildrenExact = true;
+			return;
+		}
+		const firstNextSibling = firstDom.nextSibling;
+		recordBenchEvent("domMove");
+		parent.insertBefore(firstDom, secondDom);
+		recordBenchEvent("domMove");
+		parent.insertBefore(secondDom, firstNextSibling);
+		boundaryChildrenExact = true;
+	};
+	const commitReorder = () => {
+		const items = forState.orderedItems;
+		const count = items.length;
+		if (forState.pendingMoveOnly && forState.lastRemovedNodes.length === 0) {
+			const nodes = Array(count);
+			let movedCount = 0;
+			let insertedCount = 0;
+			for (let i = 0; i < count; i++) {
+				const itemInstance = items[i];
+				if (!itemInstance) return;
+				const scope = itemInstance.scope;
+				const dom = scope.dom && !scope.needsDomUpdate ? scope.dom : runtime.syncForItemDom(parent, scope, childrenVNodes[i]);
+				if (!dom) return;
+				if (dom.parentNode === parent) movedCount++;
+				else insertedCount++;
+				nodes[i] = dom;
+			}
+			if (!canUseDirectReplaceChildrenSpread(count)) {
+				if (movedCount > 0) recordBenchEvent("domMove", movedCount);
+				if (insertedCount > 0) recordBenchEvent("domInsert", insertedCount);
+				replaceChildrenInOrder(parent, nodes, false);
+				boundaryChildrenExact = true;
+				return;
+			}
+			if (insertedCount > 0) {
+				if (movedCount > 0) recordBenchEvent("domMove", movedCount);
+				recordBenchEvent("domInsert", insertedCount);
+				replaceChildrenInOrder(parent, nodes, true);
+				boundaryChildrenExact = true;
+				return;
+			}
+			if (count > 1 && commitMoveOnlyReorder(parent, nodes)) {
+				boundaryChildrenExact = true;
+				return;
+			}
+			if (movedCount > 0) recordBenchEvent("domMove", movedCount);
+			if (insertedCount > 0) recordBenchEvent("domInsert", insertedCount);
+			replaceChildrenInOrder(parent, nodes, true);
+			boundaryChildrenExact = true;
+			return;
+		}
+		let hasExistingChild = false;
+		for (let i = 0; i < count; i++) if (items[i]?.scope.dom?.parentNode === parent) {
+			hasExistingChild = true;
+			break;
+		}
+		if (!hasExistingChild) {
+			withBenchMetricScope("coldCreate", () => {
+				const nodes = [];
+				for (let i = 0; i < count; i++) {
+					const itemInstance = items[i];
+					if (!itemInstance) continue;
+					const dom = runtime.syncForItemDom(parent, itemInstance.scope, childrenVNodes[i]);
+					if (dom) {
+						recordBenchEvent("domInsert");
+						nodes.push(dom);
+					}
+				}
+				recordBenchCounter("replaceChildrenCommits");
+				replaceChildrenInOrder(parent, nodes, false);
+			});
+			boundaryChildrenExact = true;
+			return;
+		}
+		if (forState.lastRemovedNodes.length === 0) {
+			const nodes = [];
+			for (let i = 0; i < count; i++) {
+				const itemInstance = items[i];
+				if (!itemInstance) continue;
+				const dom = runtime.syncForItemDom(parent, itemInstance.scope, childrenVNodes[i]);
+				if (!dom) continue;
+				recordBenchEvent(dom.parentNode === parent ? "domMove" : "domInsert");
+				nodes.push(dom);
+			}
+			replaceChildrenInOrder(parent, nodes, false);
+			boundaryChildrenExact = true;
+			return;
+		}
+		for (let i = 0; i < count; i++) {
+			const itemInstance = items[i];
+			if (!itemInstance) continue;
+			const dom = runtime.syncForItemDom(parent, itemInstance.scope, childrenVNodes[i]);
+			if (!dom) continue;
+			const anchor = parent.childNodes[i] ?? null;
+			if (dom !== anchor) {
+				recordBenchEvent("domMove");
+				parent.insertBefore(dom, anchor);
+			}
+		}
+		boundaryChildrenExact = true;
+	};
+	if (forState.lastCommitStrategy === "NO_REORDER" && dirtyIndices.length > 0 && forState.pendingDirtyIndices === null && forState.pendingSwapIndices === null && !forState.pendingMoveOnly && forState.lastRemovedNodes.length === 0 && parent.childNodes.length === forState.orderedKeys.length) {
+		commitDirtyNoReorder(dirtyIndices);
+		syncKeyedMapFromForState(parent, forState, "NO_REORDER", []);
+		recordBenchTiming("domCommit", performance.now() - domCommitStart);
+		clearForDomUpdateState(forState);
+		return;
+	}
+	switch (forState.lastCommitStrategy) {
+		case "NO_REORDER":
+			commitDirtyNoReorder(dirtyIndices);
+			break;
+		case "TRUNCATE":
+			commitPositional();
+			break;
+		case "APPEND":
+			commitAppend();
+			break;
+		case "SWAP":
+			commitSwap();
+			break;
+		default:
+			commitReorder();
+			break;
+	}
+	removeForBoundaryNodes(parent, forState.lastRemovedNodes);
+	syncKeyedMapFromForState(parent, forState, forState.lastCommitStrategy, forState.lastRemovedNodes);
+	const syncExactForBoundaryChildren = () => {
+		const expectedNodes = [];
+		for (let i = 0; i < forState.orderedKeys.length; i++) {
+			const itemInstance = forState.orderedItems[i];
+			if (!itemInstance) continue;
+			const dom = itemInstance.scope.dom && !itemInstance.scope.needsDomUpdate ? itemInstance.scope.dom : runtime.syncForItemDom(parent, itemInstance.scope, childrenVNodes[i]);
+			if (dom) expectedNodes.push(dom);
+		}
+		const currentNodes = Array.from(parent.childNodes);
+		if (currentNodes.length === expectedNodes.length && currentNodes.every((node, index) => node === expectedNodes[index])) return;
+		const expectedNodeSet = new Set(expectedNodes);
+		for (const currentNode of currentNodes) {
+			if (expectedNodeSet.has(currentNode)) continue;
+			teardownNodeSubtree(currentNode);
+			if (currentNode.parentNode === parent) {
+				recordBenchEvent("domRemove");
+				currentNode.remove();
+			}
+		}
+		replaceChildrenInOrder(parent, expectedNodes, true);
+	};
+	if (!boundaryChildrenExact) syncExactForBoundaryChildren();
+	forState._hasResolvedItemDom = true;
+	recordBenchTiming("domCommit", performance.now() - domCommitStart);
+	clearForDomUpdateState(forState);
+}
+//#endregion
+export { commitForStateBoundaryChildren };
+
+//# sourceMappingURL=for-commit.js.map

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

@@ -0,0 +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\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  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  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":";;;;;;AAqBA,SAAS,oBACP,QAC2C;CAC3C,IAAI,SAAS,cAAc,IAAI,OAAO;CACtC,IAAI,CAAC,QAAQ;EACX,yBAAS,IAAI,KAA+B;EAC5C,KACE,IAAI,QAAQ,OAAO,mBACnB,OACA,QAAQ,MAAM,oBACd;GACA,MAAM,MAAM,MAAM,aAAa,WAAW;GAC1C,IAAI,QAAQ,MAAM;IAChB,OAAO,IAAI,KAAK,MAAM;IACtB,MAAM,aAAa,OAAO,IAAI;IAC9B,IAAI,CAAC,OAAO,MAAM,WAAW,EAC3B,OAAO,IAAI,YAAY,MAAM;;;EAInC,IAAI,OAAO,OAAO,GAChB,cAAc,IAAI,QAAQ,OAAO;;CAGrC,OAAO,OAAO,OAAO,IAAI,SAAS;;AAGpC,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,QAAQ;EAChD,MAAM,aAAa,OAAO,SAAS;EAEnC,IACE,CAAC,gBACD,WAAW,aAAa,WAAW,KAAK,OAAO,QAAQ,EAEvD,OAAO;EAGT,aAAa,MAAM,MAAM;EACzB,aAAa,MAAM,iBAAiB;;CAGtC,OAAO;;AAGT,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,GAAG,eAAe,QAAQ;GACzC,eAAe;GACf;;EAIJ,IAAI,cAAc;GAChB,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;IAC5C,iBAAiB,YAAY;IAC7B,oBAAoB,aAAa,GAAG;;GAEtC,qBAAqB,mBAAmB;IACtC,mBAAmB,mBAAmB;IACtC,OAAO,cAAc;KACrB;GACF;;;CAIJ,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;EAC5C,MAAM,OAAO,aAAa;EAC1B,IAAI,KAAK,eAAe,QAAQ;GAC9B,iBAAiB,YAAY;GAC7B,oBAAoB,KAAK;GACzB,OAAO,YAAY,KAAK;;;;AAK9B,SAAS,yBACP,QACA,UACA,UACA,cACM;CACN,MAAM,WAAW,cAAc,IAAI,OAAO;CAC1C,MAAM,kBACJ,KACA,KACA,YACS;EACT,IAAI,IAAI,KAAK,QAAQ;EACrB,MAAM,YAAY,OAAO,IAAI;EAC7B,IAAI,IAAI,WAAW,QAAQ;EAC3B,MAAM,YAAY,OAAO,UAAU;EACnC,IAAI,CAAC,OAAO,MAAM,UAAU,EAC1B,IAAI,IAAI,WAAW,QAAQ;;CAI/B,IAAI,aAAa,QACf;MAAI,UACF;;CAIJ,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,OAAO;GAI3B,IAAI,SAAS,OAAO,GAClB,cAAc,IAAI,QAAQ,SAAS;QAEnC,cAAc,OAAO,OAAO;GAE9B;;;CAIJ,IAAI,aAAa,cAAc,SAAS,YAAY,WAAW,GAAG;EAChE,IAAI,UACF,SAAS,OAAO;EAElB,cAAc,OAAO,OAAO;EAC5B;;CAGF,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,IAAI,EAAE;GACvC,MAAM,eAAe,SAAS,MAAM,IAAI,IAAI;GAC5C,IAAI,cAAc,MAAM,eAAe,SACrC,eAAe,UAAU,KAAK,aAAa,MAAM,IAAI;;EAIzD,IAAI,SAAS,OAAO,GAClB,cAAc,IAAI,QAAQ,SAAS;OAEnC,cAAc,OAAO,OAAO;EAE9B;;CAGF,MAAM,UAAU,4BAAY,IAAI,KAA+B;CAC/D,QAAQ,OAAO;CAEf,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;EACpD,MAAM,MAAM,SAAS,YAAY;EACjC,IAAI,QAAQ,MAAM;EAClB,MAAM,eAAe,SAAS,MAAM,IAAI,IAAI;EAC5C,IAAI,cAAc,MAAM,eAAe,SACrC,eAAe,SAAS,KAAK,aAAa,MAAM,IAAI;;CAIxD,IAAI,QAAQ,OAAO,GACjB,cAAc,IAAI,QAAQ,QAAQ;MAElC,cAAc,OAAO,OAAO;;AAIhC,SAAS,uBACP,QACA,OACA,mBACM;CACN,IAAI,qBAAqB,kCAAkC,MAAM,OAAO,EAAE;EACxE,OAAO,gBAAgB,GAAG,MAAM;EAChC;;CAGF,MAAM,WAAW,OAAO,cAAc,wBAAwB;CAC9D,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,SAAS,YAAY,MAAM,GAAG;CAEhC,OAAO,gBAAgB,SAAS;;AAGlC,SAAS,cAAc,UAA8B;CACnD,IAAI,SAAS,WAAW,GACtB,OAAO,EAAE;CAGX,MAAM,eAAe,SAAS,OAAO;CACrC,MAAM,aAAuB,CAAC,EAAE;CAEhC,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,EAAE;GAClB;;EAGF,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;;EAIT,IAAI,UAAU,SAAS,WAAW,MAAM;GACtC,IAAI,KAAK,GACP,aAAa,KAAK,WAAW,KAAK;GAEpC,WAAW,MAAM;;;CAIrB,IAAI,SAAS,WAAW,SAAS;CACjC,IAAI,QAAQ,WAAW;CACvB,OAAO,UAAU,GAAG;EAClB,WAAW,UAAU;EACrB,QAAQ,aAAa;EACrB,UAAU;;CAGZ,OAAO;;AAGT,SAAS,sBAAsB,QAAiB,OAAwB;CACtE,MAAM,eAAe,MAAM,KAAK,OAAO,WAAW;CAClD,IAAI,aAAa,WAAW,MAAM,QAChC,OAAO;CAGT,MAAM,qCAAqB,IAAI,KAAmB;CAClD,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK,GAC5C,mBAAmB,IAAI,aAAa,IAAI,EAAE;CAG5C,MAAM,YAAY,MAAM,KAAK,EAAE,QAAQ,MAAM,QAAQ,QAAQ,EAAE;CAC/D,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxC,MAAM,WAAW,mBAAmB,IAAI,MAAM,GAAG;EACjD,IAAI,aAAa,QACf,OAAO;EAET,UAAU,KAAK;;CAGjB,MAAM,aAAa,cAAc,UAAU;CAC3C,IAAI,WAAW,WAAW,MAAM,QAC9B,OAAO;CAGT,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;;EAGF,IAAI,KAAK,gBAAgB,QAAQ;GAC/B,iBAAiB,UAAU;GAC3B,OAAO,aAAa,MAAM,OAAO;;EAGnC,SAAS;;CAGX,OAAO;;AAGT,SAAgB,+BACd,QACA,UACA,gBACA,SACM;CACN,MAAM,iBAAiB,YAAY,KAAK;CAExC,MAAM,8BAAoC;EACxC,IAAI,6BAA6B,QAAQ,SAAS,EAChD;EAGF,MAAM,YAAY,oBAAoB,OAAO;EAC7C,IAAI,CAAC,WACH;EAGF,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,YAAY,QAAQ,KAAK;GACpD,MAAM,UAAU,SAAS,YAAY;GACrC,MAAM,eAAe,SAAS,MAAM,IAAI,QAAQ;GAChD,IAAI,CAAC,gBAAgB,aAAa,MAAM,KACtC;GAGF,MAAM,cAAc,UAAU,IAAI,QAAQ;GAC1C,IAAI,CAAC,aACH;GAGF,aAAa,MAAM,MAAM;GACzB,aAAa,MAAM,iBAAiB;;;CAIxC,IAAI,SAAS,YAAY,WAAW,GAAG;EACrC,uBAAuB,QAAQ,SAAS,iBAAiB;EAEzD,MAAM,gBAAgB,SAAS;EAC/B,MAAM,gBAAgB,eAAe;EACrC,MAAM,UACJ,iBAAiB,kBAAkB,SAC/B,QAAQ,eAAe,QAAQ,eAAe,cAAc,GAC5D;EAEN,IAAI,SACF;OACE,OAAO,WAAW,WAAW,KAC7B,OAAO,eAAe,WACtB,SAAS,iBAAiB,SAAS,GAEnC,OAAO,gBAAgB,QAAQ;SAE5B,IAAI,OAAO,YAChB,OAAO,cAAc;EAGvB,cAAc,OAAO,OAAO;EAC5B,SAAS,sBAAsB;EAC/B,kBAAkB,aAAa,YAAY,KAAK,GAAG,eAAe;EAClE,uBAAuB,SAAS;EAChC;;CAGF,IAAI,CAAC,SAAS,uBAAuB,OAAO,WAAW,SAAS,GAC9D,uBAAuB;CAGzB,MAAM,2BAAqC;EACzC,MAAM,sBAAsB,SAAS;EACrC,IAAI,uBAAuB,oBAAoB,SAAS,GACtD,OAAO;EAGT,MAAM,eAAyB,EAAE;EACjC,KAAK,IAAI,QAAQ,GAAG,QAAQ,SAAS,YAAY,QAAQ,SAAS,GAEhE,IADqB,SAAS,aAAa,QACzB,MAAM,gBACtB,aAAa,KAAK,MAAM;EAI5B,OAAO;;CAGT,IAAI,oBAAqC;CACzC,MAAM,2BAAqC;EACzC,IAAI,mBACF,OAAO;EAGT,oBAAoB,oBAAoB;EACxC,OAAO;;CAGT,MAAM,eACJ,SAAS,uBAAuB,eAAe,oBAAoB,GAAG,EAAE;CAC1E,IAAI,wBAAwB;CAE5B,MAAM,wBAAwB,iBAAiC;EAC7D,IAAI,aAAa,WAAW,GAAG;GAC7B,wBAAwB;GACxB;;EAGF,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,MAAM,EACxD;GAGF,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,GAChB;GACD,IAAI,CAAC,KACH;GAGF,MAAM,SAAS,WAAW,MAAM;GAChC,IAAI,IAAI,eAAe,UAAU,QAAQ,QAAQ;IAC/C,iBAAiB,YAAY;IAC7B,OAAO,aAAa,KAAK,OAAO;;;EAIpC,wBAAwB;;CAG1B,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,GAChB;GACD,IAAI,CAAC,KACH;GAGF,IAAI,IAAI,eAAe,QAAQ;IAC7B,MAAM,SAAS,OAAO,WAAW,MAAM;IACvC,iBAAiB,YAAY;IAC7B,OAAO,aAAa,KAAK,OAAO;;;EAIpC,wBAAwB;;CAG1B,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;;IAGF,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,GAChB;IACD,IAAI,CAAC,OAAO,IAAI,eAAe,UAAU,QAAQ,aAC/C,aAAa;IAGf,cAAc,aAAa,eAAe;;GAG5C,IAAI,YAAY;IACd,wBAAwB;IACxB;;;EAIJ,qBAAqB,oBAAoB;GACvC,MAAM,WAAW,OAAO,cAAc,wBAAwB;GAC9D,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,GAChB;IACD,IAAI,CAAC,KACH;IAGF,IAAI,IAAI,eAAe,QAAQ;KAC7B,iBAAiB,YAAY;KAC7B,SAAS,YAAY,IAAI;KACzB,mBAAmB;;;GAIvB,IAAI,kBACF,OAAO,YAAY,SAAS;IAE9B;EAEF,wBAAwB;;CAG1B,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,WAAW;EAGvD,MAAM,WAAW,SAAS,YAAY;EACtC,MAAM,YAAY,SAAS,YAAY;EACvC,MAAM,YAAY,SAAS,MAAM,IAAI,SAAS;EAC9C,MAAM,aAAa,SAAS,MAAM,IAAI,UAAU;EAEhD,IAAI,CAAC,aAAa,CAAC,YAAY;GAC7B,eAAe;GACf;;EAGF,MAAM,WAAW,QAAQ,eACvB,QACA,UAAU,OACV,eAAe,YAChB;EACD,MAAM,YAAY,QAAQ,eACxB,QACA,WAAW,OACX,eAAe,aAChB;EAED,IAAI,CAAC,YAAY,CAAC,WAAW;GAC3B,eAAe;GACf;;EAGF,IAAI,SAAS,eAAe,UAAU,UAAU,eAAe,QAAQ;GACrE,eAAe;GACf;;EAOF,KAHG,SAAS,wBAAwB,UAAU,GAC1C,KAAK,iCACP,GACqB;GACrB,wBAAwB;GACxB;;EAGF,MAAM,mBAAmB,SAAS;EAClC,iBAAiB,UAAU;EAC3B,OAAO,aAAa,UAAU,UAAU;EACxC,iBAAiB,UAAU;EAC3B,OAAO,aAAa,WAAW,iBAAiB;EAEhD,wBAAwB;;CAG1B,MAAM,sBAA4B;EAChC,MAAM,QAAQ,SAAS;EACvB,MAAM,QAAQ,MAAM;EAEpB,IAAI,SAAS,mBAAmB,SAAS,iBAAiB,WAAW,GAAG;GACtE,MAAM,QAAQ,MAAY,MAAM;GAChC,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,GAAG;IAE9D,IAAI,CAAC,KACH;IAGF,IAAI,IAAI,eAAe,QACrB;SAEA;IAEF,MAAM,KAAK;;GAGb,IAAI,CAAC,kCAAkC,MAAM,EAAE;IAC7C,IAAI,aAAa,GACf,iBAAiB,WAAW,WAAW;IAEzC,IAAI,gBAAgB,GAClB,iBAAiB,aAAa,cAAc;IAE9C,uBAAuB,QAAQ,OAAO,MAAM;IAC5C,wBAAwB;IACxB;;GAGF,IAAI,gBAAgB,GAAG;IACrB,IAAI,aAAa,GACf,iBAAiB,WAAW,WAAW;IAEzC,iBAAiB,aAAa,cAAc;IAC5C,uBAAuB,QAAQ,OAAO,KAAK;IAC3C,wBAAwB;IACxB;;GAGF,IAAI,QAAQ,KAAK,sBAAsB,QAAQ,MAAM,EAAE;IACrD,wBAAwB;IACxB;;GAGF,IAAI,aAAa,GACf,iBAAiB,WAAW,WAAW;GAEzC,IAAI,gBAAgB,GAClB,iBAAiB,aAAa,cAAc;GAG9C,uBAAuB,QAAQ,OAAO,KAAK;GAC3C,wBAAwB;GACxB;;EAGF,IAAI,mBAAmB;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAEzB,IADqB,MAAM,IACT,MAAM,KAAK,eAAe,QAAQ;GAClD,mBAAmB;GACnB;;EAIJ,IAAI,CAAC,kBAAkB;GACrB,qBAAqB,oBAAoB;IACvC,MAAM,QAAgB,EAAE;IACxB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;KAC9B,MAAM,eAAe,MAAM;KAC3B,IAAI,CAAC,cAAc;KACnB,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,GAChB;KACD,IAAI,KAAK;MACP,iBAAiB,YAAY;MAC7B,MAAM,KAAK,IAAI;;;IAGnB,mBAAmB,yBAAyB;IAC5C,uBAAuB,QAAQ,OAAO,MAAM;KAC5C;GAEF,wBAAwB;GACxB;;EAGF,IAAI,SAAS,iBAAiB,WAAW,GAAG;GAC1C,MAAM,QAAgB,EAAE;GAExB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;IAC9B,MAAM,eAAe,MAAM;IAC3B,IAAI,CAAC,cACH;IAGF,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,GAChB;IACD,IAAI,CAAC,KACH;IAGF,iBAAiB,IAAI,eAAe,SAAS,YAAY,YAAY;IACrE,MAAM,KAAK,IAAI;;GAGjB,uBAAuB,QAAQ,OAAO,MAAM;GAC5C,wBAAwB;GACxB;;EAGF,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,eAAe,MAAM;GAC3B,IAAI,CAAC,cACH;GAGF,MAAM,MAAM,QAAQ,eAClB,QACA,aAAa,OACb,eAAe,GAChB;GACD,IAAI,CAAC,KACH;GAGF,MAAM,SAAS,OAAO,WAAW,MAAM;GACvC,IAAI,QAAQ,QAAQ;IAClB,iBAAiB,UAAU;IAC3B,OAAO,aAAa,KAAK,OAAO;;;EAIpC,wBAAwB;;CAY1B,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,aAAa;EAClC,yBAAyB,QAAQ,UAAU,cAAc,EAAE,CAAC;EAE5D,kBAAkB,aAAa,YAAY,KAAK,GAAG,eAAe;EAClE,uBAAuB,SAAS;EAChC;;CAGF,QAAQ,SAAS,oBAAjB;EACE,KAAK;GACH,qBAAqB,aAAa;GAClC;EACF,KAAK;GACH,kBAAkB;GAClB;EACF,KAAK;GACH,cAAc;GACd;EACF,KAAK;GACH,YAAY;GACZ;EAEF;GACE,eAAe;GACf;;CAGJ,uBAAuB,QAAQ,SAAS,iBAAiB;CACzD,yBACE,QACA,UACA,SAAS,oBACT,SAAS,iBACV;CAED,MAAM,qCAA2C;EAC/C,MAAM,gBAAwB,EAAE;EAEhC,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,GAChB;GACP,IAAI,KACF,cAAc,KAAK,IAAI;;EAI3B,MAAM,eAAe,MAAM,KAAK,OAAO,WAAW;EAClD,IACE,aAAa,WAAW,cAAc,UACtC,aAAa,OAAO,MAAM,UAAU,SAAS,cAAc,OAAO,EAElE;EAGF,MAAM,kBAAkB,IAAI,IAAI,cAAc;EAC9C,KAAK,MAAM,eAAe,cAAc;GACtC,IAAI,gBAAgB,IAAI,YAAY,EAClC;GAGF,oBAAoB,YAAY;GAEhC,IAAI,YAAY,eAAe,QAAQ;IACrC,iBAAiB,YAAY;IAC7B,YAAY,QAAQ;;;EAIxB,uBAAuB,QAAQ,eAAe,KAAK;;CAGrD,IAAI,CAAC,uBACH,8BAA8B;CAEhC,SAAS,sBAAsB;CAC/B,kBAAkB,aAAa,YAAY,KAAK,GAAG,eAAe;CAClE,uBAAuB,SAAS"}

package/dist/renderer/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":["_evaluate","_markReactivePropsDirtySource"],"sources":["../../src/renderer/index.ts"],"sourcesContent":["// Renderer barrel entrypoint.\n// Keep this file small: re-export the public surface and attach the runtime\n// fast-lane bridge on import.\n\nexport * from './types';\nexport * from './cleanup';\nexport * from './keyed';\nexport * from './dom';\nexport { evaluate, clearDOMRange } from './evaluate';\n\nimport { evaluate as _evaluate } from './evaluate';\nimport { isKeyedReorderFastPathEligible, getKeyMapForElement } from './keyed';\nimport { markReactivePropsDirtySource as _markReactivePropsDirtySource } from './dom';\n\nexport function installRendererBridge(): true {\n  if (typeof globalThis !== 'undefined') {\n    const _g = globalThis as Record<string, unknown>;\n    _g.__ASKR_RENDERER = {\n      evaluate: _evaluate,\n      isKeyedReorderFastPathEligible,\n      getKeyMapForElement,\n      markReactivePropsDirtySource: _markReactivePropsDirtySource,\n    };\n  }\n  return true;\n}\n"],"mappings":";;;;;;;;AAcA,SAAgB,wBAA8B;CAC5C,IAAI,OAAO,eAAe,aAAa;EACrC,MAAM,KAAK;EACX,GAAG,kBAAkB;GACTA;GACV;GACA;GAC8BC;GAC/B;;CAEH,OAAO"}
+{"version":3,"file":"index.js","names":["_evaluate","_markReactivePropsDirtySource"],"sources":["../../src/renderer/index.ts"],"sourcesContent":["// Renderer barrel entrypoint.\n// Keep this file small: re-export the public surface and attach the runtime\n// fast-lane bridge on import.\n\nexport * from './types';\nexport * from './cleanup';\nexport {\n  keyedElements,\n  getKeyMapForElement,\n  populateKeyMapForElement,\n  _reconcilerRecordedParents,\n  isKeyedReorderFastPathEligible,\n} from './keyed';\nexport * from './dom';\nexport { evaluate, clearDOMRange } from './evaluate';\n\nimport { evaluate as _evaluate } from './evaluate';\nimport { isKeyedReorderFastPathEligible, getKeyMapForElement } from './keyed';\nimport { markReactivePropsDirtySource as _markReactivePropsDirtySource } from './dom';\n\nexport function installRendererBridge(): true {\n  if (typeof globalThis !== 'undefined') {\n    const _g = globalThis as Record<string, unknown>;\n    _g.__ASKR_RENDERER = {\n      evaluate: _evaluate,\n      isKeyedReorderFastPathEligible,\n      getKeyMapForElement,\n      markReactivePropsDirtySource: _markReactivePropsDirtySource,\n    };\n  }\n  return true;\n}\n"],"mappings":";;;;;;;;AAoBA,SAAgB,wBAA8B;CAC5C,IAAI,OAAO,eAAe,aAAa;EACrC,MAAM,KAAK;EACX,GAAG,kBAAkB;GACTA;GACV;GACA;GAC8BC;GAC/B;;CAEH,OAAO"}