wevu 6.18.7 → 6.19.1

package/dist/dev/runtime/app/setData/scheduler.mjs

@@ -0,0 +1,313 @@
+import { toRaw } from "../../../reactivity/reactive/shared.mjs";
+import { getReactiveVersion, isReactive } from "../../../reactivity/reactive.mjs";
+import { isRef } from "../../../reactivity/ref.mjs";
+import { hasOwn } from "../../../utils.mjs";
+import { hasTrackableSetupBinding } from "../../setupTracking.mjs";
+import { diffSnapshots, toPlain } from "../../diff.mjs";
+import { collectSnapshot } from "./snapshot.mjs";
+import { runPatchUpdate } from "./patchScheduler.mjs";
+
+//#region src/runtime/app/setData/scheduler.ts
+function createSetDataScheduler(options) {
+	const { state, setupState, snapshotOmitKeys, computedRefs, dirtyComputedKeys, includeComputed, setDataStrategy, computedCompare, computedCompareMaxDepth, computedCompareMaxKeys, currentAdapter, shouldIncludeKey, maxPatchKeys, maxPayloadBytes, mergeSiblingThreshold, mergeSiblingMaxInflationRatio, mergeSiblingMaxParentBytes, mergeSiblingSkipArray, elevateTopKeyThreshold, toPlainMaxDepth, toPlainMaxKeys, includeFunctions = false, functionPaths, debug, debugWhen, debugSampleRate, loopWarning, targetLabel, runTracker, isMounted, initialSnapshot, initialState } = options;
+	const plainCache = /* @__PURE__ */ new WeakMap();
+	const plainCacheEligibility = /* @__PURE__ */ new WeakMap();
+	let latestSnapshot = {};
+	let latestComputedSnapshot = Object.create(null);
+	const latestStateTokens = Object.create(null);
+	const latestComputedTokens = Object.create(null);
+	const needsFullSnapshot = { value: setDataStrategy === "patch" };
+	const pendingPatches = /* @__PURE__ */ new Map();
+	const fallbackTopKeys = /* @__PURE__ */ new Set();
+	const flushTimes = [];
+	let lastLoopWarningAt = Number.NEGATIVE_INFINITY;
+	const initialStateKeys = new Set(initialState && typeof initialState === "object" ? Object.keys(initialState) : []);
+	const isPlainObject = (value) => {
+		if (Object.prototype.toString.call(value) !== "[object Object]") return false;
+		const proto = Object.getPrototypeOf(value);
+		return proto === null || proto === Object.prototype;
+	};
+	const isDeepEqual = (left, right) => {
+		if (Object.is(left, right)) return true;
+		if (Array.isArray(left) && Array.isArray(right)) {
+			if (left.length !== right.length) return false;
+			return left.every((item, index) => isDeepEqual(item, right[index]));
+		}
+		if (isPlainObject(left) && isPlainObject(right)) {
+			const leftKeys = Object.keys(left);
+			const rightKeys = Object.keys(right);
+			if (leftKeys.length !== rightKeys.length) return false;
+			return leftKeys.every((key) => hasOwn(right, key) && isDeepEqual(left[key], right[key]));
+		}
+		return false;
+	};
+	const createValueToken = (value) => {
+		const candidate = isRef(value) ? value.value : value;
+		if (candidate == null || typeof candidate !== "object") return candidate;
+		if (!isReactive(candidate) && hasTrackableSetupBinding(candidate)) return { snapshot: toPlain(candidate, /* @__PURE__ */ new WeakMap(), {
+			cacheEligibility: plainCacheEligibility,
+			maxDepth: toPlainMaxDepth,
+			maxKeys: toPlainMaxKeys,
+			includeFunctions,
+			functionPaths
+		}) };
+		const raw = isReactive(candidate) ? toRaw(candidate) : candidate;
+		return {
+			raw,
+			version: getReactiveVersion(raw)
+		};
+	};
+	const isSameToken = (left, right) => {
+		if (Object.is(left, right)) return true;
+		if (!left || !right || typeof left !== "object" || typeof right !== "object" || !hasOwn(left, "raw") || !hasOwn(right, "raw")) {
+			if (left && right && typeof left === "object" && typeof right === "object" && hasOwn(left, "snapshot") && hasOwn(right, "snapshot")) return isDeepEqual(left.snapshot, right.snapshot);
+			return false;
+		}
+		return left.raw === right.raw && left.version === right.version;
+	};
+	const shouldIncludeSnapshotKey = (key) => shouldIncludeKey(key) && !(snapshotOmitKeys === null || snapshotOmitKeys === void 0 ? void 0 : snapshotOmitKeys.has(key));
+	if (initialSnapshot) {
+		for (const [key, value] of Object.entries(initialSnapshot)) if (shouldIncludeSnapshotKey(key)) latestSnapshot[key] = value;
+	}
+	const syncInitialSnapshotTokens = () => {
+		if (!initialSnapshot) return;
+		const rawState = isReactive(state) ? toRaw(state) : state;
+		const rawSetupState = setupState && typeof setupState === "object" ? isReactive(setupState) ? toRaw(setupState) : setupState : void 0;
+		for (const key of Object.keys(initialSnapshot)) {
+			if (!shouldIncludeSnapshotKey(key)) continue;
+			if (rawSetupState && hasOwn(rawSetupState, key)) {
+				latestStateTokens[key] = createValueToken(rawSetupState[key]);
+				continue;
+			}
+			if (hasOwn(rawState, key)) {
+				if (initialStateKeys.has(key)) continue;
+				rawState[key] = initialSnapshot[key];
+				latestStateTokens[key] = createValueToken(rawState[key]);
+			}
+		}
+	};
+	const resolveTopKeysByRoot = (root) => {
+		const matches = [];
+		const rawSetupState = setupState && typeof setupState === "object" ? isReactive(setupState) ? toRaw(setupState) : setupState : void 0;
+		for (const key of /* @__PURE__ */ new Set([...Object.keys(state), ...rawSetupState ? Object.keys(rawSetupState) : []])) {
+			if (!shouldIncludeSnapshotKey(key)) continue;
+			const value = rawSetupState && hasOwn(rawSetupState, key) ? rawSetupState[key] : state[key];
+			const candidate = isRef(value) ? value.value : value;
+			if (!candidate || typeof candidate !== "object") continue;
+			if (toRaw(candidate) === root) matches.push(key);
+		}
+		return matches;
+	};
+	const emitDebug = (info) => {
+		if (!debug) return;
+		const isFallback = info.reason !== "patch" && info.reason !== "diff";
+		if (debugWhen === "fallback" && !isFallback) return;
+		if (debugSampleRate < 1 && Math.random() > debugSampleRate) return;
+		try {
+			debug(info);
+		} catch (_unused) {}
+	};
+	const recordFlushForLoopWarning = () => {
+		if (!loopWarning) return;
+		const current = Date.now();
+		flushTimes.push(current);
+		const windowStart = current - loopWarning.sampleWindowMs;
+		while (flushTimes.length && flushTimes[0] < windowStart) flushTimes.shift();
+		if (flushTimes.length <= loopWarning.maxFlushes) return;
+		if (loopWarning.coolDownMs > 0 && current - lastLoopWarningAt < loopWarning.coolDownMs) return;
+		lastLoopWarningAt = current;
+		emitDebug({
+			mode: setDataStrategy,
+			reason: "loopWarning",
+			pendingPatchKeys: pendingPatches.size + fallbackTopKeys.size,
+			payloadKeys: 0,
+			computedDirtyKeys: includeComputed ? dirtyComputedKeys.size : 0,
+			flushCount: flushTimes.length,
+			windowMs: loopWarning.sampleWindowMs,
+			targetLabel,
+			message: `${targetLabel ? `${targetLabel} ` : ""}疑似运行时更新循环：${flushTimes.length} 次 setData flush/${loopWarning.sampleWindowMs}ms`
+		});
+	};
+	const collect = () => collectSnapshot({
+		state,
+		setupState,
+		computedRefs,
+		includeComputed,
+		shouldIncludeKey: shouldIncludeSnapshotKey,
+		plainCache,
+		plainCacheEligibility,
+		toPlainMaxDepth,
+		toPlainMaxKeys,
+		includeFunctions,
+		functionPaths
+	});
+	syncInitialSnapshotTokens();
+	const collectDiffSnapshot = () => {
+		const rawState = isReactive(state) ? toRaw(state) : state;
+		const rawSetupState = setupState && typeof setupState === "object" ? isReactive(setupState) ? toRaw(setupState) : setupState : void 0;
+		const nextSnapshot = { ...latestSnapshot };
+		const seen = /* @__PURE__ */ new WeakMap();
+		const includedStateKeys = /* @__PURE__ */ new Set();
+		const includedComputedKeys = /* @__PURE__ */ new Set();
+		const replacedTopLevelKeys = /* @__PURE__ */ new Set();
+		for (const key of /* @__PURE__ */ new Set([...Object.keys(rawState), ...rawSetupState ? Object.keys(rawSetupState) : []])) {
+			if (!shouldIncludeSnapshotKey(key)) continue;
+			includedStateKeys.add(key);
+			const source = rawSetupState && hasOwn(rawSetupState, key) ? rawSetupState : rawState;
+			const token = createValueToken(source[key]);
+			const previousToken = latestStateTokens[key];
+			if (previousToken && token && typeof previousToken === "object" && typeof token === "object" && hasOwn(previousToken, "raw") && hasOwn(token, "raw") && Array.isArray(previousToken.raw) && Array.isArray(token.raw) && previousToken.raw !== token.raw) replacedTopLevelKeys.add(key);
+			if (!isSameToken(previousToken, token) || !hasOwn(latestSnapshot, key)) nextSnapshot[key] = toPlain(source[key], seen, {
+				cache: plainCache,
+				cacheEligibility: plainCacheEligibility,
+				maxDepth: toPlainMaxDepth,
+				maxKeys: toPlainMaxKeys,
+				includeFunctions,
+				functionPaths,
+				_path: key
+			});
+			latestStateTokens[key] = token;
+		}
+		for (const key of Object.keys(latestStateTokens)) if (!includedStateKeys.has(key)) {
+			delete latestStateTokens[key];
+			if (!includeComputed || !hasOwn(computedRefs, key)) delete nextSnapshot[key];
+		}
+		if (!includeComputed) {
+			for (const key of Object.keys(latestComputedTokens)) delete latestComputedTokens[key];
+			return {
+				snapshot: nextSnapshot,
+				replacedTopLevelKeys
+			};
+		}
+		for (const key of Object.keys(computedRefs)) {
+			if (!shouldIncludeSnapshotKey(key)) continue;
+			includedComputedKeys.add(key);
+			const value = computedRefs[key].value;
+			const token = createValueToken(value);
+			if (!isSameToken(latestComputedTokens[key], token) || !hasOwn(latestSnapshot, key)) nextSnapshot[key] = toPlain(value, seen, {
+				cache: plainCache,
+				cacheEligibility: plainCacheEligibility,
+				maxDepth: toPlainMaxDepth,
+				maxKeys: toPlainMaxKeys,
+				includeFunctions,
+				functionPaths,
+				_path: key
+			});
+			latestComputedTokens[key] = token;
+		}
+		for (const key of Object.keys(latestComputedTokens)) if (!includedComputedKeys.has(key)) {
+			delete latestComputedTokens[key];
+			if (!hasOwn(rawState, key) || !shouldIncludeSnapshotKey(key)) delete nextSnapshot[key];
+		}
+		return {
+			snapshot: nextSnapshot,
+			replacedTopLevelKeys
+		};
+	};
+	const runDiffUpdate = (reason = "diff") => {
+		var _diffCollection$snaps;
+		const diffCollection = setDataStrategy === "diff" ? collectDiffSnapshot() : void 0;
+		const snapshot = (_diffCollection$snaps = diffCollection === null || diffCollection === void 0 ? void 0 : diffCollection.snapshot) !== null && _diffCollection$snaps !== void 0 ? _diffCollection$snaps : collect();
+		const diff = diffCollection ? (() => {
+			const fastDiff = {};
+			for (const key of diffCollection.replacedTopLevelKeys) fastDiff[key] = snapshot[key];
+			return {
+				...diffSnapshots(latestSnapshot, snapshot, { skipKeys: diffCollection.replacedTopLevelKeys }),
+				...fastDiff
+			};
+		})() : diffSnapshots(latestSnapshot, snapshot);
+		latestSnapshot = snapshot;
+		needsFullSnapshot.value = false;
+		pendingPatches.clear();
+		if (setDataStrategy === "patch" && includeComputed) {
+			latestComputedSnapshot = Object.create(null);
+			for (const key of Object.keys(computedRefs)) {
+				if (!shouldIncludeSnapshotKey(key)) continue;
+				latestComputedSnapshot[key] = snapshot[key];
+			}
+			dirtyComputedKeys.clear();
+		}
+		if (!Object.keys(diff).length) return;
+		if (typeof currentAdapter.setData === "function") {
+			const result = currentAdapter.setData(diff);
+			if (result && typeof result.then === "function") return result.catch(() => {});
+		}
+		emitDebug({
+			mode: "diff",
+			reason,
+			pendingPatchKeys: 0,
+			payloadKeys: Object.keys(diff).length
+		});
+	};
+	const mutationRecorder = (record, stateRootRaw) => {
+		if (!isMounted()) return;
+		if (record.root !== stateRootRaw) {
+			const topKeys = resolveTopKeysByRoot(record.root);
+			if (topKeys.length) for (const key of topKeys) fallbackTopKeys.add(key);
+			return;
+		}
+		if (!record.path) {
+			if (Array.isArray(record.fallbackTopKeys) && record.fallbackTopKeys.length) for (const key of record.fallbackTopKeys) fallbackTopKeys.add(key);
+			else needsFullSnapshot.value = true;
+			return;
+		}
+		const topKey = record.path.split(".", 1)[0];
+		if (!shouldIncludeSnapshotKey(topKey)) return;
+		pendingPatches.set(record.path, {
+			kind: record.kind,
+			op: record.op
+		});
+	};
+	const job = (_stateRootRaw) => {
+		if (!isMounted()) return;
+		recordFlushForLoopWarning();
+		runTracker();
+		if (setDataStrategy === "patch" && !needsFullSnapshot.value) {
+			if (!(pendingPatches.size > 0 || fallbackTopKeys.size > 0 || includeComputed && dirtyComputedKeys.size > 0)) return runDiffUpdate("diff");
+			return runPatchUpdate({
+				state,
+				computedRefs,
+				dirtyComputedKeys,
+				includeComputed,
+				computedCompare,
+				computedCompareMaxDepth,
+				computedCompareMaxKeys,
+				currentAdapter,
+				shouldIncludeKey: shouldIncludeSnapshotKey,
+				maxPatchKeys,
+				maxPayloadBytes,
+				mergeSiblingThreshold,
+				mergeSiblingMaxInflationRatio,
+				mergeSiblingMaxParentBytes,
+				mergeSiblingSkipArray,
+				elevateTopKeyThreshold,
+				toPlainMaxDepth,
+				toPlainMaxKeys,
+				includeFunctions,
+				functionPaths,
+				plainCache,
+				plainCacheEligibility,
+				pendingPatches,
+				fallbackTopKeys,
+				latestSnapshot,
+				latestComputedSnapshot,
+				needsFullSnapshot,
+				emitDebug,
+				runDiffUpdate
+			});
+		} else return runDiffUpdate(needsFullSnapshot.value ? "needsFullSnapshot" : "diff");
+	};
+	const snapshot = () => setDataStrategy === "patch" ? collect() : { ...latestSnapshot };
+	const cloneLatestSnapshot = () => ({ ...latestSnapshot });
+	return {
+		job,
+		mutationRecorder,
+		snapshot,
+		cloneLatestSnapshot,
+		getLatestSnapshot: () => latestSnapshot
+	};
+}
+
+//#endregion
+export { createSetDataScheduler };
+//# sourceMappingURL=scheduler.mjs.map

package/dist/dev/runtime/app/setData/scheduler.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.mjs","names":[],"sources":["../../../../../src/runtime/app/setData/scheduler.ts"],"sourcesContent":["import type { MutationRecord } from '../../../reactivity'\nimport type { SetDataDebugInfo } from '../../types'\nimport { getReactiveVersion, isReactive, isRef, toRaw } from '../../../reactivity'\nimport { hasOwn } from '../../../utils'\nimport { diffSnapshots, toPlain } from '../../diff'\nimport { hasTrackableSetupBinding } from '../../setupTracking'\nimport { runPatchUpdate } from './patchScheduler'\nimport { collectSnapshot } from './snapshot'\n\nexport function createSetDataScheduler(options: {\n  state: Record<string, any>\n  setupState?: Record<string, any>\n  snapshotOmitKeys?: Set<string>\n  computedRefs: Record<string, { value: any }>\n  dirtyComputedKeys: Set<string>\n  includeComputed: boolean\n  setDataStrategy: 'diff' | 'patch'\n  computedCompare: 'reference' | 'shallow' | 'deep'\n  computedCompareMaxDepth: number\n  computedCompareMaxKeys: number\n  currentAdapter: { setData?: (payload: Record<string, any>) => void | Promise<void> }\n  shouldIncludeKey: (key: string) => boolean\n  maxPatchKeys: number\n  maxPayloadBytes: number\n  mergeSiblingThreshold: number\n  mergeSiblingMaxInflationRatio: number\n  mergeSiblingMaxParentBytes: number\n  mergeSiblingSkipArray: boolean\n  elevateTopKeyThreshold: number\n  toPlainMaxDepth: number\n  toPlainMaxKeys: number\n  includeFunctions?: boolean\n  functionPaths: string[]\n  debug: ((info: SetDataDebugInfo) => void) | undefined\n  debugWhen: 'fallback' | 'always'\n  debugSampleRate: number\n  loopWarning: false | {\n    sampleWindowMs: number\n    maxFlushes: number\n    coolDownMs: number\n  }\n  targetLabel?: string\n  runTracker: () => void\n  isMounted: () => boolean\n  initialSnapshot?: Record<string, any>\n  initialState?: Record<string, any>\n}) {\n  const {\n    state,\n    setupState,\n    snapshotOmitKeys,\n    computedRefs,\n    dirtyComputedKeys,\n    includeComputed,\n    setDataStrategy,\n    computedCompare,\n    computedCompareMaxDepth,\n    computedCompareMaxKeys,\n    currentAdapter,\n    shouldIncludeKey,\n    maxPatchKeys,\n    maxPayloadBytes,\n    mergeSiblingThreshold,\n    mergeSiblingMaxInflationRatio,\n    mergeSiblingMaxParentBytes,\n    mergeSiblingSkipArray,\n    elevateTopKeyThreshold,\n    toPlainMaxDepth,\n    toPlainMaxKeys,\n    includeFunctions = false,\n    functionPaths,\n    debug,\n    debugWhen,\n    debugSampleRate,\n    loopWarning,\n    targetLabel,\n    runTracker,\n    isMounted,\n    initialSnapshot,\n    initialState,\n  } = options\n\n  const plainCache = new WeakMap<object, { version: number, value: any }>()\n  const plainCacheEligibility = new WeakMap<object, boolean>()\n  let latestSnapshot: Record<string, any> = {}\n  let latestComputedSnapshot: Record<string, any> = Object.create(null)\n  const latestStateTokens = Object.create(null) as Record<string, unknown>\n  const latestComputedTokens = Object.create(null) as Record<string, unknown>\n  const needsFullSnapshot = { value: setDataStrategy === 'patch' }\n  const pendingPatches = new Map<string, { kind: 'property' | 'array', op: 'set' | 'delete' }>()\n  const fallbackTopKeys = new Set<string>()\n  const flushTimes: number[] = []\n  let lastLoopWarningAt = Number.NEGATIVE_INFINITY\n  const initialStateKeys = new Set(\n    initialState && typeof initialState === 'object'\n      ? Object.keys(initialState)\n      : [],\n  )\n\n  const isPlainObject = (value: unknown): value is Record<string, any> => {\n    if (Object.prototype.toString.call(value) !== '[object Object]') {\n      return false\n    }\n    const proto = Object.getPrototypeOf(value)\n    return proto === null || proto === Object.prototype\n  }\n\n  const isDeepEqual = (left: any, right: any): boolean => {\n    if (Object.is(left, right)) {\n      return true\n    }\n    if (Array.isArray(left) && Array.isArray(right)) {\n      if (left.length !== right.length) {\n        return false\n      }\n      return left.every((item, index) => isDeepEqual(item, right[index]))\n    }\n    if (isPlainObject(left) && isPlainObject(right)) {\n      const leftKeys = Object.keys(left)\n      const rightKeys = Object.keys(right)\n      if (leftKeys.length !== rightKeys.length) {\n        return false\n      }\n      return leftKeys.every(key => hasOwn(right, key) && isDeepEqual(left[key], right[key]))\n    }\n    return false\n  }\n\n  const createValueToken = (value: unknown) => {\n    const candidate = isRef(value) ? value.value : value\n    if (candidate == null || typeof candidate !== 'object') {\n      return candidate\n    }\n    if (!isReactive(candidate) && hasTrackableSetupBinding(candidate)) {\n      return {\n        snapshot: toPlain(candidate, new WeakMap(), {\n          cacheEligibility: plainCacheEligibility,\n          maxDepth: toPlainMaxDepth,\n          maxKeys: toPlainMaxKeys,\n          includeFunctions,\n          functionPaths,\n        }),\n      }\n    }\n    const raw = isReactive(candidate) ? toRaw(candidate as any) : candidate\n    return {\n      raw,\n      version: getReactiveVersion(raw as any),\n    }\n  }\n\n  const isSameToken = (left: unknown, right: unknown) => {\n    if (Object.is(left, right)) {\n      return true\n    }\n    if (\n      !left\n      || !right\n      || typeof left !== 'object'\n      || typeof right !== 'object'\n      || !hasOwn(left as object, 'raw')\n      || !hasOwn(right as object, 'raw')\n    ) {\n      if (\n        left\n        && right\n        && typeof left === 'object'\n        && typeof right === 'object'\n        && hasOwn(left as object, 'snapshot')\n        && hasOwn(right as object, 'snapshot')\n      ) {\n        return isDeepEqual((left as any).snapshot, (right as any).snapshot)\n      }\n      return false\n    }\n    return (left as any).raw === (right as any).raw && (left as any).version === (right as any).version\n  }\n\n  const shouldIncludeSnapshotKey = (key: string) => shouldIncludeKey(key) && !snapshotOmitKeys?.has(key)\n\n  if (initialSnapshot) {\n    for (const [key, value] of Object.entries(initialSnapshot)) {\n      if (shouldIncludeSnapshotKey(key)) {\n        latestSnapshot[key] = value\n      }\n    }\n  }\n\n  const syncInitialSnapshotTokens = () => {\n    if (!initialSnapshot) {\n      return\n    }\n    const rawState = (isReactive(state) ? toRaw(state as any) : state) as Record<string, any>\n    const rawSetupState = setupState && typeof setupState === 'object'\n      ? (isReactive(setupState) ? toRaw(setupState as any) : setupState)\n      : undefined\n\n    for (const key of Object.keys(initialSnapshot)) {\n      if (!shouldIncludeSnapshotKey(key)) {\n        continue\n      }\n      if (rawSetupState && hasOwn(rawSetupState, key)) {\n        latestStateTokens[key] = createValueToken(rawSetupState[key])\n        continue\n      }\n      if (hasOwn(rawState, key)) {\n        if (initialStateKeys.has(key)) {\n          continue\n        }\n        rawState[key] = initialSnapshot[key]\n        latestStateTokens[key] = createValueToken(rawState[key])\n      }\n    }\n  }\n\n  const resolveTopKeysByRoot = (root: object) => {\n    const matches: string[] = []\n    const rawSetupState = setupState && typeof setupState === 'object'\n      ? (isReactive(setupState) ? toRaw(setupState as any) : setupState)\n      : undefined\n    for (const key of new Set([...Object.keys(state), ...(rawSetupState ? Object.keys(rawSetupState) : [])])) {\n      if (!shouldIncludeSnapshotKey(key)) {\n        continue\n      }\n      const value = rawSetupState && hasOwn(rawSetupState, key) ? rawSetupState[key] : state[key]\n      const candidate = isRef(value) ? value.value : value\n      if (!candidate || typeof candidate !== 'object') {\n        continue\n      }\n      if (toRaw(candidate as any) === root) {\n        matches.push(key)\n      }\n    }\n    return matches\n  }\n\n  const emitDebug = (info: SetDataDebugInfo) => {\n    if (!debug) {\n      return\n    }\n    const isFallback = info.reason !== 'patch' && info.reason !== 'diff'\n    if (debugWhen === 'fallback' && !isFallback) {\n      return\n    }\n    if (debugSampleRate < 1 && Math.random() > debugSampleRate) {\n      return\n    }\n    try {\n      debug(info)\n    }\n    catch {\n      // 忽略异常\n    }\n  }\n\n  const recordFlushForLoopWarning = () => {\n    if (!loopWarning) {\n      return\n    }\n    const current = Date.now()\n    flushTimes.push(current)\n    const windowStart = current - loopWarning.sampleWindowMs\n    while (flushTimes.length && flushTimes[0] < windowStart) {\n      flushTimes.shift()\n    }\n    if (flushTimes.length <= loopWarning.maxFlushes) {\n      return\n    }\n    if (loopWarning.coolDownMs > 0 && current - lastLoopWarningAt < loopWarning.coolDownMs) {\n      return\n    }\n    lastLoopWarningAt = current\n    emitDebug({\n      mode: setDataStrategy,\n      reason: 'loopWarning',\n      pendingPatchKeys: pendingPatches.size + fallbackTopKeys.size,\n      payloadKeys: 0,\n      computedDirtyKeys: includeComputed ? dirtyComputedKeys.size : 0,\n      flushCount: flushTimes.length,\n      windowMs: loopWarning.sampleWindowMs,\n      targetLabel,\n      message: `${targetLabel ? `${targetLabel} ` : ''}疑似运行时更新循环：${flushTimes.length} 次 setData flush/${loopWarning.sampleWindowMs}ms`,\n    })\n  }\n\n  const collect = () => collectSnapshot({\n    state,\n    setupState,\n    computedRefs,\n    includeComputed,\n    shouldIncludeKey: shouldIncludeSnapshotKey,\n    plainCache,\n    plainCacheEligibility,\n    toPlainMaxDepth,\n    toPlainMaxKeys,\n    includeFunctions,\n    functionPaths,\n  })\n\n  syncInitialSnapshotTokens()\n\n  const collectDiffSnapshot = () => {\n    const rawState = (isReactive(state) ? toRaw(state as any) : state) as Record<string, any>\n    const rawSetupState = setupState && typeof setupState === 'object'\n      ? (isReactive(setupState) ? toRaw(setupState as any) : setupState)\n      : undefined\n    const nextSnapshot: Record<string, any> = { ...latestSnapshot }\n    const seen = new WeakMap<object, any>()\n    const includedStateKeys = new Set<string>()\n    const includedComputedKeys = new Set<string>()\n    const replacedTopLevelKeys = new Set<string>()\n\n    for (const key of new Set([...Object.keys(rawState), ...(rawSetupState ? Object.keys(rawSetupState) : [])])) {\n      if (!shouldIncludeSnapshotKey(key)) {\n        continue\n      }\n      includedStateKeys.add(key)\n      const source = rawSetupState && hasOwn(rawSetupState, key) ? rawSetupState : rawState\n      const token = createValueToken(source[key])\n      const previousToken = latestStateTokens[key]\n      if (\n        previousToken\n        && token\n        && typeof previousToken === 'object'\n        && typeof token === 'object'\n        && hasOwn(previousToken as object, 'raw')\n        && hasOwn(token as object, 'raw')\n        && Array.isArray((previousToken as any).raw)\n        && Array.isArray((token as any).raw)\n        && (previousToken as any).raw !== (token as any).raw\n      ) {\n        replacedTopLevelKeys.add(key)\n      }\n      if (!isSameToken(previousToken, token) || !hasOwn(latestSnapshot, key)) {\n        nextSnapshot[key] = toPlain(source[key], seen, {\n          cache: plainCache,\n          cacheEligibility: plainCacheEligibility,\n          maxDepth: toPlainMaxDepth,\n          maxKeys: toPlainMaxKeys,\n          includeFunctions,\n          functionPaths,\n          _path: key,\n        })\n      }\n      latestStateTokens[key] = token\n    }\n\n    for (const key of Object.keys(latestStateTokens)) {\n      if (!includedStateKeys.has(key)) {\n        delete latestStateTokens[key]\n        if (!includeComputed || !hasOwn(computedRefs, key)) {\n          delete nextSnapshot[key]\n        }\n      }\n    }\n\n    if (!includeComputed) {\n      for (const key of Object.keys(latestComputedTokens)) {\n        delete latestComputedTokens[key]\n      }\n      return {\n        snapshot: nextSnapshot,\n        replacedTopLevelKeys,\n      }\n    }\n\n    for (const key of Object.keys(computedRefs)) {\n      if (!shouldIncludeSnapshotKey(key)) {\n        continue\n      }\n      includedComputedKeys.add(key)\n      const value = computedRefs[key].value\n      const token = createValueToken(value)\n      if (!isSameToken(latestComputedTokens[key], token) || !hasOwn(latestSnapshot, key)) {\n        nextSnapshot[key] = toPlain(value, seen, {\n          cache: plainCache,\n          cacheEligibility: plainCacheEligibility,\n          maxDepth: toPlainMaxDepth,\n          maxKeys: toPlainMaxKeys,\n          includeFunctions,\n          functionPaths,\n          _path: key,\n        })\n      }\n      latestComputedTokens[key] = token\n    }\n\n    for (const key of Object.keys(latestComputedTokens)) {\n      if (!includedComputedKeys.has(key)) {\n        delete latestComputedTokens[key]\n        if (!hasOwn(rawState, key) || !shouldIncludeSnapshotKey(key)) {\n          delete nextSnapshot[key]\n        }\n      }\n    }\n\n    return {\n      snapshot: nextSnapshot,\n      replacedTopLevelKeys,\n    }\n  }\n\n  const runDiffUpdate = (reason: SetDataDebugInfo['reason'] = 'diff'): void | Promise<void> => {\n    const diffCollection = setDataStrategy === 'diff' ? collectDiffSnapshot() : undefined\n    const snapshot = diffCollection?.snapshot ?? collect()\n    const diff = diffCollection\n      ? (() => {\n          const fastDiff: Record<string, any> = {}\n          for (const key of diffCollection.replacedTopLevelKeys) {\n            fastDiff[key] = snapshot[key]\n          }\n          const baseDiff = diffSnapshots(latestSnapshot, snapshot, {\n            skipKeys: diffCollection.replacedTopLevelKeys,\n          })\n          return {\n            ...baseDiff,\n            ...fastDiff,\n          }\n        })()\n      : diffSnapshots(latestSnapshot, snapshot)\n    latestSnapshot = snapshot\n    needsFullSnapshot.value = false\n    pendingPatches.clear()\n    if (setDataStrategy === 'patch' && includeComputed) {\n      latestComputedSnapshot = Object.create(null)\n      for (const key of Object.keys(computedRefs)) {\n        if (!shouldIncludeSnapshotKey(key)) {\n          continue\n        }\n        latestComputedSnapshot[key] = snapshot[key]\n      }\n      dirtyComputedKeys.clear()\n    }\n    if (!Object.keys(diff).length) {\n      return\n    }\n    if (typeof currentAdapter.setData === 'function') {\n      const result = currentAdapter.setData(diff)\n      if (result && typeof (result as Promise<any>).then === 'function') {\n        return (result as Promise<void>).catch(() => {})\n      }\n    }\n    emitDebug({\n      mode: 'diff',\n      reason,\n      pendingPatchKeys: 0,\n      payloadKeys: Object.keys(diff).length,\n    })\n  }\n\n  const mutationRecorder = (record: MutationRecord, stateRootRaw: object) => {\n    if (!isMounted()) {\n      return\n    }\n    if (record.root !== stateRootRaw) {\n      const topKeys = resolveTopKeysByRoot(record.root)\n      if (topKeys.length) {\n        for (const key of topKeys) {\n          fallbackTopKeys.add(key)\n        }\n      }\n      return\n    }\n    if (!record.path) {\n      if (Array.isArray(record.fallbackTopKeys) && record.fallbackTopKeys.length) {\n        for (const key of record.fallbackTopKeys) {\n          fallbackTopKeys.add(key)\n        }\n      }\n      else {\n        needsFullSnapshot.value = true\n      }\n      return\n    }\n    const topKey = record.path.split('.', 1)[0]\n    if (!shouldIncludeSnapshotKey(topKey)) {\n      return\n    }\n    pendingPatches.set(record.path, { kind: record.kind, op: record.op })\n  }\n\n  const job = (_stateRootRaw: object) => {\n    if (!isMounted()) {\n      return\n    }\n    recordFlushForLoopWarning()\n    // 生成快照前刷新依赖（setup 中的 ref / 新增 key）\n    runTracker()\n\n    if (setDataStrategy === 'patch' && !needsFullSnapshot.value) {\n      const hasPatchSignal = pendingPatches.size > 0\n        || fallbackTopKeys.size > 0\n        || (includeComputed && dirtyComputedKeys.size > 0)\n      // setup 返回的 ref/computed 变更不会进入 mutation recorder，patch 信号为空时兜底走 diff。\n      if (!hasPatchSignal) {\n        return runDiffUpdate('diff')\n      }\n      return runPatchUpdate({\n        state,\n        computedRefs,\n        dirtyComputedKeys,\n        includeComputed,\n        computedCompare,\n        computedCompareMaxDepth,\n        computedCompareMaxKeys,\n        currentAdapter,\n        shouldIncludeKey: shouldIncludeSnapshotKey,\n        maxPatchKeys,\n        maxPayloadBytes,\n        mergeSiblingThreshold,\n        mergeSiblingMaxInflationRatio,\n        mergeSiblingMaxParentBytes,\n        mergeSiblingSkipArray,\n        elevateTopKeyThreshold,\n        toPlainMaxDepth,\n        toPlainMaxKeys,\n        includeFunctions,\n        functionPaths,\n        plainCache,\n        plainCacheEligibility,\n        pendingPatches,\n        fallbackTopKeys,\n        latestSnapshot,\n        latestComputedSnapshot,\n        needsFullSnapshot,\n        emitDebug,\n        runDiffUpdate,\n      })\n    }\n    else {\n      return runDiffUpdate(needsFullSnapshot.value ? 'needsFullSnapshot' : 'diff')\n    }\n  }\n\n  const snapshot = () => (setDataStrategy === 'patch' ? collect() : ({ ...latestSnapshot }))\n  const cloneLatestSnapshot = () => ({ ...latestSnapshot })\n\n  return {\n    job,\n    mutationRecorder,\n    snapshot,\n    cloneLatestSnapshot,\n    getLatestSnapshot: () => latestSnapshot,\n  }\n}\n"],"mappings":";;;;;;;;;;AASA,SAAgB,uBAAuB,SAqCpC;CACD,MAAM,EACJ,OACA,YACA,kBACA,cACA,mBACA,iBACA,iBACA,iBACA,yBACA,wBACA,gBACA,kBACA,cACA,iBACA,uBACA,+BACA,4BACA,uBACA,wBACA,iBACA,gBACA,mBAAmB,OACnB,eACA,OACA,WACA,iBACA,aACA,aACA,YACA,WACA,iBACA,iBACE;CAEJ,MAAM,6BAAa,IAAI,QAAiD;CACxE,MAAM,wCAAwB,IAAI,QAAyB;CAC3D,IAAI,iBAAsC,CAAC;CAC3C,IAAI,yBAA8C,OAAO,OAAO,IAAI;CACpE,MAAM,oBAAoB,OAAO,OAAO,IAAI;CAC5C,MAAM,uBAAuB,OAAO,OAAO,IAAI;CAC/C,MAAM,oBAAoB,EAAE,OAAO,oBAAoB,QAAQ;CAC/D,MAAM,iCAAiB,IAAI,IAAkE;CAC7F,MAAM,kCAAkB,IAAI,IAAY;CACxC,MAAM,aAAuB,CAAC;CAC9B,IAAI,oBAAoB,OAAO;CAC/B,MAAM,mBAAmB,IAAI,IAC3B,gBAAgB,OAAO,iBAAiB,WACpC,OAAO,KAAK,YAAY,IACxB,CAAC,CACP;CAEA,MAAM,iBAAiB,UAAiD;EACtE,IAAI,OAAO,UAAU,SAAS,KAAK,KAAK,MAAM,mBAC5C,OAAO;EAET,MAAM,QAAQ,OAAO,eAAe,KAAK;EACzC,OAAO,UAAU,QAAQ,UAAU,OAAO;CAC5C;CAEA,MAAM,eAAe,MAAW,UAAwB;EACtD,IAAI,OAAO,GAAG,MAAM,KAAK,GACvB,OAAO;EAET,IAAI,MAAM,QAAQ,IAAI,KAAK,MAAM,QAAQ,KAAK,GAAG;GAC/C,IAAI,KAAK,WAAW,MAAM,QACxB,OAAO;GAET,OAAO,KAAK,OAAO,MAAM,UAAU,YAAY,MAAM,MAAM,MAAM,CAAC;EACpE;EACA,IAAI,cAAc,IAAI,KAAK,cAAc,KAAK,GAAG;GAC/C,MAAM,WAAW,OAAO,KAAK,IAAI;GACjC,MAAM,YAAY,OAAO,KAAK,KAAK;GACnC,IAAI,SAAS,WAAW,UAAU,QAChC,OAAO;GAET,OAAO,SAAS,OAAM,QAAO,OAAO,OAAO,GAAG,KAAK,YAAY,KAAK,MAAM,MAAM,IAAI,CAAC;EACvF;EACA,OAAO;CACT;CAEA,MAAM,oBAAoB,UAAmB;EAC3C,MAAM,YAAY,MAAM,KAAK,IAAI,MAAM,QAAQ;EAC/C,IAAI,aAAa,QAAQ,OAAO,cAAc,UAC5C,OAAO;EAET,IAAI,CAAC,WAAW,SAAS,KAAK,yBAAyB,SAAS,GAC9D,OAAO,EACL,UAAU,QAAQ,2BAAW,IAAI,QAAQ,GAAG;GAC1C,kBAAkB;GAClB,UAAU;GACV,SAAS;GACT;GACA;EACF,CAAC,EACH;EAEF,MAAM,MAAM,WAAW,SAAS,IAAI,MAAM,SAAgB,IAAI;EAC9D,OAAO;GACL;GACA,SAAS,mBAAmB,GAAU;EACxC;CACF;CAEA,MAAM,eAAe,MAAe,UAAmB;EACrD,IAAI,OAAO,GAAG,MAAM,KAAK,GACvB,OAAO;EAET,IACE,CAAC,QACE,CAAC,SACD,OAAO,SAAS,YAChB,OAAO,UAAU,YACjB,CAAC,OAAO,MAAgB,KAAK,KAC7B,CAAC,OAAO,OAAiB,KAAK,GACjC;GACA,IACE,QACG,SACA,OAAO,SAAS,YAChB,OAAO,UAAU,YACjB,OAAO,MAAgB,UAAU,KACjC,OAAO,OAAiB,UAAU,GAErC,OAAO,YAAa,KAAa,UAAW,MAAc,QAAQ;GAEpE,OAAO;EACT;EACA,OAAQ,KAAa,QAAS,MAAc,OAAQ,KAAa,YAAa,MAAc;CAC9F;CAEA,MAAM,4BAA4B,QAAgB,iBAAiB,GAAG,KAAK,sEAAC,iBAAkB,IAAI,GAAG;CAErG,IAAI,iBACF;OAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,eAAe,GACvD,IAAI,yBAAyB,GAAG,GAC9B,eAAe,OAAO;CAE1B;CAGF,MAAM,kCAAkC;EACtC,IAAI,CAAC,iBACH;EAEF,MAAM,WAAY,WAAW,KAAK,IAAI,MAAM,KAAY,IAAI;EAC5D,MAAM,gBAAgB,cAAc,OAAO,eAAe,WACrD,WAAW,UAAU,IAAI,MAAM,UAAiB,IAAI,aACrD;EAEJ,KAAK,MAAM,OAAO,OAAO,KAAK,eAAe,GAAG;GAC9C,IAAI,CAAC,yBAAyB,GAAG,GAC/B;GAEF,IAAI,iBAAiB,OAAO,eAAe,GAAG,GAAG;IAC/C,kBAAkB,OAAO,iBAAiB,cAAc,IAAI;IAC5D;GACF;GACA,IAAI,OAAO,UAAU,GAAG,GAAG;IACzB,IAAI,iBAAiB,IAAI,GAAG,GAC1B;IAEF,SAAS,OAAO,gBAAgB;IAChC,kBAAkB,OAAO,iBAAiB,SAAS,IAAI;GACzD;EACF;CACF;CAEA,MAAM,wBAAwB,SAAiB;EAC7C,MAAM,UAAoB,CAAC;EAC3B,MAAM,gBAAgB,cAAc,OAAO,eAAe,WACrD,WAAW,UAAU,IAAI,MAAM,UAAiB,IAAI,aACrD;EACJ,KAAK,MAAM,uBAAO,IAAI,IAAI,CAAC,GAAG,OAAO,KAAK,KAAK,GAAG,GAAI,gBAAgB,OAAO,KAAK,aAAa,IAAI,CAAC,CAAE,CAAC,GAAG;GACxG,IAAI,CAAC,yBAAyB,GAAG,GAC/B;GAEF,MAAM,QAAQ,iBAAiB,OAAO,eAAe,GAAG,IAAI,cAAc,OAAO,MAAM;GACvF,MAAM,YAAY,MAAM,KAAK,IAAI,MAAM,QAAQ;GAC/C,IAAI,CAAC,aAAa,OAAO,cAAc,UACrC;GAEF,IAAI,MAAM,SAAgB,MAAM,MAC9B,QAAQ,KAAK,GAAG;EAEpB;EACA,OAAO;CACT;CAEA,MAAM,aAAa,SAA2B;EAC5C,IAAI,CAAC,OACH;EAEF,MAAM,aAAa,KAAK,WAAW,WAAW,KAAK,WAAW;EAC9D,IAAI,cAAc,cAAc,CAAC,YAC/B;EAEF,IAAI,kBAAkB,KAAK,KAAK,OAAO,IAAI,iBACzC;EAEF,IAAI;GACF,MAAM,IAAI;EACZ,kBACM,CAEN;CACF;CAEA,MAAM,kCAAkC;EACtC,IAAI,CAAC,aACH;EAEF,MAAM,UAAU,KAAK,IAAI;EACzB,WAAW,KAAK,OAAO;EACvB,MAAM,cAAc,UAAU,YAAY;EAC1C,OAAO,WAAW,UAAU,WAAW,KAAK,aAC1C,WAAW,MAAM;EAEnB,IAAI,WAAW,UAAU,YAAY,YACnC;EAEF,IAAI,YAAY,aAAa,KAAK,UAAU,oBAAoB,YAAY,YAC1E;EAEF,oBAAoB;EACpB,UAAU;GACR,MAAM;GACN,QAAQ;GACR,kBAAkB,eAAe,OAAO,gBAAgB;GACxD,aAAa;GACb,mBAAmB,kBAAkB,kBAAkB,OAAO;GAC9D,YAAY,WAAW;GACvB,UAAU,YAAY;GACtB;GACA,SAAS,GAAG,cAAc,GAAG,YAAY,KAAK,GAAG,YAAY,WAAW,OAAO,mBAAmB,YAAY,eAAe;EAC/H,CAAC;CACH;CAEA,MAAM,gBAAgB,gBAAgB;EACpC;EACA;EACA;EACA;EACA,kBAAkB;EAClB;EACA;EACA;EACA;EACA;EACA;CACF,CAAC;CAED,0BAA0B;CAE1B,MAAM,4BAA4B;EAChC,MAAM,WAAY,WAAW,KAAK,IAAI,MAAM,KAAY,IAAI;EAC5D,MAAM,gBAAgB,cAAc,OAAO,eAAe,WACrD,WAAW,UAAU,IAAI,MAAM,UAAiB,IAAI,aACrD;EACJ,MAAM,eAAoC,EAAE,GAAG,eAAe;EAC9D,MAAM,uBAAO,IAAI,QAAqB;EACtC,MAAM,oCAAoB,IAAI,IAAY;EAC1C,MAAM,uCAAuB,IAAI,IAAY;EAC7C,MAAM,uCAAuB,IAAI,IAAY;EAE7C,KAAK,MAAM,uBAAO,IAAI,IAAI,CAAC,GAAG,OAAO,KAAK,QAAQ,GAAG,GAAI,gBAAgB,OAAO,KAAK,aAAa,IAAI,CAAC,CAAE,CAAC,GAAG;GAC3G,IAAI,CAAC,yBAAyB,GAAG,GAC/B;GAEF,kBAAkB,IAAI,GAAG;GACzB,MAAM,SAAS,iBAAiB,OAAO,eAAe,GAAG,IAAI,gBAAgB;GAC7E,MAAM,QAAQ,iBAAiB,OAAO,IAAI;GAC1C,MAAM,gBAAgB,kBAAkB;GACxC,IACE,iBACG,SACA,OAAO,kBAAkB,YACzB,OAAO,UAAU,YACjB,OAAO,eAAyB,KAAK,KACrC,OAAO,OAAiB,KAAK,KAC7B,MAAM,QAAS,cAAsB,GAAG,KACxC,MAAM,QAAS,MAAc,GAAG,KAC/B,cAAsB,QAAS,MAAc,KAEjD,qBAAqB,IAAI,GAAG;GAE9B,IAAI,CAAC,YAAY,eAAe,KAAK,KAAK,CAAC,OAAO,gBAAgB,GAAG,GACnE,aAAa,OAAO,QAAQ,OAAO,MAAM,MAAM;IAC7C,OAAO;IACP,kBAAkB;IAClB,UAAU;IACV,SAAS;IACT;IACA;IACA,OAAO;GACT,CAAC;GAEH,kBAAkB,OAAO;EAC3B;EAEA,KAAK,MAAM,OAAO,OAAO,KAAK,iBAAiB,GAC7C,IAAI,CAAC,kBAAkB,IAAI,GAAG,GAAG;GAC/B,OAAO,kBAAkB;GACzB,IAAI,CAAC,mBAAmB,CAAC,OAAO,cAAc,GAAG,GAC/C,OAAO,aAAa;EAExB;EAGF,IAAI,CAAC,iBAAiB;GACpB,KAAK,MAAM,OAAO,OAAO,KAAK,oBAAoB,GAChD,OAAO,qBAAqB;GAE9B,OAAO;IACL,UAAU;IACV;GACF;EACF;EAEA,KAAK,MAAM,OAAO,OAAO,KAAK,YAAY,GAAG;GAC3C,IAAI,CAAC,yBAAyB,GAAG,GAC/B;GAEF,qBAAqB,IAAI,GAAG;GAC5B,MAAM,QAAQ,aAAa,IAAI,CAAC;GAChC,MAAM,QAAQ,iBAAiB,KAAK;GACpC,IAAI,CAAC,YAAY,qBAAqB,MAAM,KAAK,KAAK,CAAC,OAAO,gBAAgB,GAAG,GAC/E,aAAa,OAAO,QAAQ,OAAO,MAAM;IACvC,OAAO;IACP,kBAAkB;IAClB,UAAU;IACV,SAAS;IACT;IACA;IACA,OAAO;GACT,CAAC;GAEH,qBAAqB,OAAO;EAC9B;EAEA,KAAK,MAAM,OAAO,OAAO,KAAK,oBAAoB,GAChD,IAAI,CAAC,qBAAqB,IAAI,GAAG,GAAG;GAClC,OAAO,qBAAqB;GAC5B,IAAI,CAAC,OAAO,UAAU,GAAG,KAAK,CAAC,yBAAyB,GAAG,GACzD,OAAO,aAAa;EAExB;EAGF,OAAO;GACL,UAAU;GACV;EACF;CACF;CAEA,MAAM,iBAAiB,SAAqC,WAAiC;;EAC3F,MAAM,iBAAiB,oBAAoB,SAAS,oBAAoB,IAAI;EAC5E,MAAM,oGAAW,eAAgB,iFAAY,QAAQ;EACrD,MAAM,OAAO,wBACF;GACL,MAAM,WAAgC,CAAC;GACvC,KAAK,MAAM,OAAO,eAAe,sBAC/B,SAAS,OAAO,SAAS;GAK3B,OAAO;IACL,GAJe,cAAc,gBAAgB,UAAU,EACvD,UAAU,eAAe,qBAC3B,CAEY;IACV,GAAG;GACL;EACF,EAAC,CAAE,IACH,cAAc,gBAAgB,QAAQ;EAC1C,iBAAiB;EACjB,kBAAkB,QAAQ;EAC1B,eAAe,MAAM;EACrB,IAAI,oBAAoB,WAAW,iBAAiB;GAClD,yBAAyB,OAAO,OAAO,IAAI;GAC3C,KAAK,MAAM,OAAO,OAAO,KAAK,YAAY,GAAG;IAC3C,IAAI,CAAC,yBAAyB,GAAG,GAC/B;IAEF,uBAAuB,OAAO,SAAS;GACzC;GACA,kBAAkB,MAAM;EAC1B;EACA,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,QACrB;EAEF,IAAI,OAAO,eAAe,YAAY,YAAY;GAChD,MAAM,SAAS,eAAe,QAAQ,IAAI;GAC1C,IAAI,UAAU,OAAQ,OAAwB,SAAS,YACrD,OAAQ,OAAyB,YAAY,CAAC,CAAC;EAEnD;EACA,UAAU;GACR,MAAM;GACN;GACA,kBAAkB;GAClB,aAAa,OAAO,KAAK,IAAI,CAAC,CAAC;EACjC,CAAC;CACH;CAEA,MAAM,oBAAoB,QAAwB,iBAAyB;EACzE,IAAI,CAAC,UAAU,GACb;EAEF,IAAI,OAAO,SAAS,cAAc;GAChC,MAAM,UAAU,qBAAqB,OAAO,IAAI;GAChD,IAAI,QAAQ,QACV,KAAK,MAAM,OAAO,SAChB,gBAAgB,IAAI,GAAG;GAG3B;EACF;EACA,IAAI,CAAC,OAAO,MAAM;GAChB,IAAI,MAAM,QAAQ,OAAO,eAAe,KAAK,OAAO,gBAAgB,QAClE,KAAK,MAAM,OAAO,OAAO,iBACvB,gBAAgB,IAAI,GAAG;QAIzB,kBAAkB,QAAQ;GAE5B;EACF;EACA,MAAM,SAAS,OAAO,KAAK,MAAM,KAAK,CAAC,CAAC,CAAC;EACzC,IAAI,CAAC,yBAAyB,MAAM,GAClC;EAEF,eAAe,IAAI,OAAO,MAAM;GAAE,MAAM,OAAO;GAAM,IAAI,OAAO;EAAG,CAAC;CACtE;CAEA,MAAM,OAAO,kBAA0B;EACrC,IAAI,CAAC,UAAU,GACb;EAEF,0BAA0B;EAE1B,WAAW;EAEX,IAAI,oBAAoB,WAAW,CAAC,kBAAkB,OAAO;GAK3D,IAAI,EAJmB,eAAe,OAAO,KACxC,gBAAgB,OAAO,KACtB,mBAAmB,kBAAkB,OAAO,IAGhD,OAAO,cAAc,MAAM;GAE7B,OAAO,eAAe;IACpB;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA,kBAAkB;IAClB;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;GACF,CAAC;EACH,OAEE,OAAO,cAAc,kBAAkB,QAAQ,sBAAsB,MAAM;CAE/E;CAEA,MAAM,iBAAkB,oBAAoB,UAAU,QAAQ,IAAK,EAAE,GAAG,eAAe;CACvF,MAAM,6BAA6B,EAAE,GAAG,eAAe;CAEvD,OAAO;EACL;EACA;EACA;EACA;EACA,yBAAyB;CAC3B;AACF"}

package/dist/dev/runtime/app/setData/snapshot.mjs

@@ -0,0 +1,129 @@
+import { toRaw } from "../../../reactivity/reactive/shared.mjs";
+import { isReactive } from "../../../reactivity/reactive.mjs";
+import { hasOwn } from "../../../utils.mjs";
+import { toPlain } from "../../diff.mjs";
+
+//#region src/runtime/app/setData/snapshot.ts
+function isPlainObjectLike(value) {
+	if (value == null || typeof value !== "object") return false;
+	const proto = Object.getPrototypeOf(value);
+	return proto === Object.prototype || proto === null;
+}
+function normalizeSetDataValue(value) {
+	return value === void 0 ? null : value;
+}
+function cloneSnapshotValue(value) {
+	if (Array.isArray(value)) return value.map((item) => cloneSnapshotValue(item));
+	if (!isPlainObjectLike(value)) return value;
+	const out = {};
+	for (const key of Object.keys(value)) out[key] = cloneSnapshotValue(value[key]);
+	return out;
+}
+function isShallowEqualValue(a, b) {
+	if (Object.is(a, b)) return true;
+	if (Array.isArray(a) && Array.isArray(b)) {
+		if (a.length !== b.length) return false;
+		for (let i = 0; i < a.length; i++) if (!Object.is(a[i], b[i])) return false;
+		return true;
+	}
+	if (!isPlainObjectLike(a) || !isPlainObjectLike(b)) return false;
+	const aKeys = Object.keys(a);
+	const bKeys = Object.keys(b);
+	if (aKeys.length !== bKeys.length) return false;
+	for (const k of aKeys) {
+		if (!hasOwn(b, k)) return false;
+		if (!Object.is(a[k], b[k])) return false;
+	}
+	return true;
+}
+function isDeepEqualValue(a, b, depth, budget) {
+	if (Object.is(a, b)) return true;
+	if (depth <= 0) return false;
+	if (Array.isArray(a) && Array.isArray(b)) {
+		if (a.length !== b.length) return false;
+		for (let i = 0; i < a.length; i++) if (!isDeepEqualValue(a[i], b[i], depth - 1, budget)) return false;
+		return true;
+	}
+	if (!isPlainObjectLike(a) || !isPlainObjectLike(b)) return false;
+	const aKeys = Object.keys(a);
+	const bKeys = Object.keys(b);
+	if (aKeys.length !== bKeys.length) return false;
+	for (const k of aKeys) {
+		budget.keys -= 1;
+		if (budget.keys <= 0) return false;
+		if (!hasOwn(b, k)) return false;
+		if (!isDeepEqualValue(a[k], b[k], depth - 1, budget)) return false;
+	}
+	return true;
+}
+function applySnapshotUpdate(snapshot, path, value, op, options) {
+	var _options$cloneValue;
+	const cloneValue = (_options$cloneValue = options === null || options === void 0 ? void 0 : options.cloneValue) !== null && _options$cloneValue !== void 0 ? _options$cloneValue : true;
+	const segments = path.split(".").filter(Boolean);
+	if (!segments.length) return;
+	let current = snapshot;
+	for (let i = 0; i < segments.length - 1; i++) {
+		const key = segments[i];
+		if (!hasOwn(current, key) || current[key] == null || typeof current[key] !== "object") current[key] = {};
+		current = current[key];
+	}
+	const leaf = segments[segments.length - 1];
+	if (op === "delete") try {
+		delete current[leaf];
+	} catch (_unused) {
+		current[leaf] = null;
+	}
+	else current[leaf] = cloneValue ? cloneSnapshotValue(value) : value;
+}
+function collectSnapshot(options) {
+	const { state, setupState, computedRefs, includeComputed, shouldIncludeKey, plainCache, plainCacheEligibility, toPlainMaxDepth, toPlainMaxKeys, includeFunctions = false, functionPaths = [] } = options;
+	const seen = /* @__PURE__ */ new WeakMap();
+	const out = {};
+	const budget = Number.isFinite(toPlainMaxKeys) ? { keys: toPlainMaxKeys } : void 0;
+	const rawState = isReactive(state) ? toRaw(state) : state;
+	const rawSetupState = setupState && typeof setupState === "object" ? isReactive(setupState) ? toRaw(setupState) : setupState : void 0;
+	const stateKeys = Object.keys(rawState);
+	const setupStateKeys = rawSetupState ? Object.keys(rawSetupState) : [];
+	const computedKeys = includeComputed ? Object.keys(computedRefs) : [];
+	for (const key of stateKeys) {
+		if (!shouldIncludeKey(key)) continue;
+		out[key] = toPlain(rawState[key], seen, {
+			cache: plainCache,
+			cacheEligibility: plainCacheEligibility,
+			maxDepth: toPlainMaxDepth,
+			includeFunctions,
+			functionPaths,
+			_budget: budget,
+			_path: key
+		});
+	}
+	for (const key of setupStateKeys) {
+		if (!shouldIncludeKey(key)) continue;
+		out[key] = toPlain(rawSetupState[key], seen, {
+			cache: plainCache,
+			cacheEligibility: plainCacheEligibility,
+			maxDepth: toPlainMaxDepth,
+			includeFunctions,
+			functionPaths,
+			_budget: budget,
+			_path: key
+		});
+	}
+	for (const key of computedKeys) {
+		if (!shouldIncludeKey(key)) continue;
+		out[key] = toPlain(computedRefs[key].value, seen, {
+			cache: plainCache,
+			cacheEligibility: plainCacheEligibility,
+			maxDepth: toPlainMaxDepth,
+			includeFunctions,
+			functionPaths,
+			_budget: budget,
+			_path: key
+		});
+	}
+	return out;
+}
+
+//#endregion
+export { applySnapshotUpdate, cloneSnapshotValue, collectSnapshot, isDeepEqualValue, isPlainObjectLike, isShallowEqualValue, normalizeSetDataValue };
+//# sourceMappingURL=snapshot.mjs.map

package/dist/dev/runtime/app/setData/snapshot.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"snapshot.mjs","names":[],"sources":["../../../../../src/runtime/app/setData/snapshot.ts"],"sourcesContent":["import { isReactive, toRaw } from '../../../reactivity'\nimport { hasOwn } from '../../../utils'\nimport { toPlain } from '../../diff'\n\nexport function isPlainObjectLike(value: any) {\n  if (value == null || typeof value !== 'object') {\n    return false\n  }\n  const proto = Object.getPrototypeOf(value)\n  return proto === Object.prototype || proto === null\n}\n\nexport function normalizeSetDataValue<T>(value: T): T | null {\n  return value === undefined ? null : value\n}\n\nexport function cloneSnapshotValue<T>(value: T): T {\n  if (Array.isArray(value)) {\n    return value.map(item => cloneSnapshotValue(item)) as T\n  }\n  if (!isPlainObjectLike(value)) {\n    return value\n  }\n  // 这里的快照对象会继续进入 setData / WXML / DevTools 热重载链路。\n  // 不能使用 Object.create(null)，否则微信运行时内部直接调用 hasOwnProperty 时会报错。\n  const out: Record<string, any> = {}\n  for (const key of Object.keys(value as Record<string, any>)) {\n    out[key] = cloneSnapshotValue((value as Record<string, any>)[key])\n  }\n  return out as T\n}\n\nexport function isShallowEqualValue(a: any, b: any): boolean {\n  if (Object.is(a, b)) {\n    return true\n  }\n  if (Array.isArray(a) && Array.isArray(b)) {\n    if (a.length !== b.length) {\n      return false\n    }\n    for (let i = 0; i < a.length; i++) {\n      if (!Object.is(a[i], b[i])) {\n        return false\n      }\n    }\n    return true\n  }\n  if (!isPlainObjectLike(a) || !isPlainObjectLike(b)) {\n    return false\n  }\n  const aKeys = Object.keys(a)\n  const bKeys = Object.keys(b)\n  if (aKeys.length !== bKeys.length) {\n    return false\n  }\n  for (const k of aKeys) {\n    if (!hasOwn(b, k)) {\n      return false\n    }\n    if (!Object.is(a[k], b[k])) {\n      return false\n    }\n  }\n  return true\n}\n\nexport function isDeepEqualValue(\n  a: any,\n  b: any,\n  depth: number,\n  budget: { keys: number },\n): boolean {\n  if (Object.is(a, b)) {\n    return true\n  }\n  if (depth <= 0) {\n    return false\n  }\n  if (Array.isArray(a) && Array.isArray(b)) {\n    if (a.length !== b.length) {\n      return false\n    }\n    for (let i = 0; i < a.length; i++) {\n      if (!isDeepEqualValue(a[i], b[i], depth - 1, budget)) {\n        return false\n      }\n    }\n    return true\n  }\n  if (!isPlainObjectLike(a) || !isPlainObjectLike(b)) {\n    return false\n  }\n  const aKeys = Object.keys(a)\n  const bKeys = Object.keys(b)\n  if (aKeys.length !== bKeys.length) {\n    return false\n  }\n  for (const k of aKeys) {\n    budget.keys -= 1\n    if (budget.keys <= 0) {\n      return false\n    }\n    if (!hasOwn(b, k)) {\n      return false\n    }\n    if (!isDeepEqualValue(a[k], b[k], depth - 1, budget)) {\n      return false\n    }\n  }\n  return true\n}\n\nexport function applySnapshotUpdate(\n  snapshot: Record<string, any>,\n  path: string,\n  value: any,\n  op: 'set' | 'delete',\n  options?: { cloneValue?: boolean },\n) {\n  const cloneValue = options?.cloneValue ?? true\n  const segments = path.split('.').filter(Boolean)\n  if (!segments.length) {\n    return\n  }\n  let current: any = snapshot\n  for (let i = 0; i < segments.length - 1; i++) {\n    const key = segments[i]\n    if (!hasOwn(current, key) || current[key] == null || typeof current[key] !== 'object') {\n      // 中间节点同样会被同步到最新快照并可能参与视图层更新，必须保持普通对象原型。\n      current[key] = {}\n    }\n    current = current[key]\n  }\n  const leaf = segments[segments.length - 1]!\n  if (op === 'delete') {\n    try {\n      delete current[leaf]\n    }\n    catch {\n      current[leaf] = null\n    }\n  }\n  else {\n    current[leaf] = cloneValue ? cloneSnapshotValue(value) : value\n  }\n}\n\nexport function collectSnapshot(options: {\n  state: Record<string, any>\n  setupState?: Record<string, any>\n  computedRefs: Record<string, { value: any }>\n  includeComputed: boolean\n  shouldIncludeKey: (key: string) => boolean\n  plainCache: WeakMap<object, { version: number, value: any }>\n  plainCacheEligibility?: WeakMap<object, boolean>\n  toPlainMaxDepth: number\n  toPlainMaxKeys: number\n  includeFunctions?: boolean\n  functionPaths?: string[]\n}) {\n  const {\n    state,\n    setupState,\n    computedRefs,\n    includeComputed,\n    shouldIncludeKey,\n    plainCache,\n    plainCacheEligibility,\n    toPlainMaxDepth,\n    toPlainMaxKeys,\n    includeFunctions = false,\n    functionPaths = [],\n  } = options\n  const seen = new WeakMap<object, any>()\n  // collectSnapshot 的返回值会被 owner snapshot / patch scheduler 复用。\n  // 后续维护不要改回 null-prototype 对象，否则热重载下会再次触发 hasOwnProperty 兼容问题。\n  const out: Record<string, any> = {}\n  const budget = Number.isFinite(toPlainMaxKeys) ? { keys: toPlainMaxKeys } : undefined\n\n  const rawState = (isReactive(state) ? toRaw(state as any) : state) as Record<string, any>\n  const rawSetupState = setupState && typeof setupState === 'object'\n    ? (isReactive(setupState) ? toRaw(setupState as any) : setupState)\n    : undefined\n  const stateKeys = Object.keys(rawState)\n  const setupStateKeys = rawSetupState ? Object.keys(rawSetupState) : []\n  const computedKeys = includeComputed ? Object.keys(computedRefs) : []\n\n  for (const key of stateKeys) {\n    if (!shouldIncludeKey(key)) {\n      continue\n    }\n    out[key] = toPlain(rawState[key], seen, { cache: plainCache, cacheEligibility: plainCacheEligibility, maxDepth: toPlainMaxDepth, includeFunctions, functionPaths, _budget: budget, _path: key })\n  }\n\n  for (const key of setupStateKeys) {\n    if (!shouldIncludeKey(key)) {\n      continue\n    }\n    out[key] = toPlain(rawSetupState![key], seen, { cache: plainCache, cacheEligibility: plainCacheEligibility, maxDepth: toPlainMaxDepth, includeFunctions, functionPaths, _budget: budget, _path: key })\n  }\n\n  for (const key of computedKeys) {\n    if (!shouldIncludeKey(key)) {\n      continue\n    }\n    out[key] = toPlain(computedRefs[key].value, seen, { cache: plainCache, cacheEligibility: plainCacheEligibility, maxDepth: toPlainMaxDepth, includeFunctions, functionPaths, _budget: budget, _path: key })\n  }\n\n  return out\n}\n"],"mappings":";;;;;;AAIA,SAAgB,kBAAkB,OAAY;CAC5C,IAAI,SAAS,QAAQ,OAAO,UAAU,UACpC,OAAO;CAET,MAAM,QAAQ,OAAO,eAAe,KAAK;CACzC,OAAO,UAAU,OAAO,aAAa,UAAU;AACjD;AAEA,SAAgB,sBAAyB,OAAoB;CAC3D,OAAO,UAAU,SAAY,OAAO;AACtC;AAEA,SAAgB,mBAAsB,OAAa;CACjD,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,MAAM,KAAI,SAAQ,mBAAmB,IAAI,CAAC;CAEnD,IAAI,CAAC,kBAAkB,KAAK,GAC1B,OAAO;CAIT,MAAM,MAA2B,CAAC;CAClC,KAAK,MAAM,OAAO,OAAO,KAAK,KAA4B,GACxD,IAAI,OAAO,mBAAoB,MAA8B,IAAI;CAEnE,OAAO;AACT;AAEA,SAAgB,oBAAoB,GAAQ,GAAiB;CAC3D,IAAI,OAAO,GAAG,GAAG,CAAC,GAChB,OAAO;CAET,IAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG;EACxC,IAAI,EAAE,WAAW,EAAE,QACjB,OAAO;EAET,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,CAAC,OAAO,GAAG,EAAE,IAAI,EAAE,EAAE,GACvB,OAAO;EAGX,OAAO;CACT;CACA,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,kBAAkB,CAAC,GAC/C,OAAO;CAET,MAAM,QAAQ,OAAO,KAAK,CAAC;CAC3B,MAAM,QAAQ,OAAO,KAAK,CAAC;CAC3B,IAAI,MAAM,WAAW,MAAM,QACzB,OAAO;CAET,KAAK,MAAM,KAAK,OAAO;EACrB,IAAI,CAAC,OAAO,GAAG,CAAC,GACd,OAAO;EAET,IAAI,CAAC,OAAO,GAAG,EAAE,IAAI,EAAE,EAAE,GACvB,OAAO;CAEX;CACA,OAAO;AACT;AAEA,SAAgB,iBACd,GACA,GACA,OACA,QACS;CACT,IAAI,OAAO,GAAG,GAAG,CAAC,GAChB,OAAO;CAET,IAAI,SAAS,GACX,OAAO;CAET,IAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG;EACxC,IAAI,EAAE,WAAW,EAAE,QACjB,OAAO;EAET,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,CAAC,iBAAiB,EAAE,IAAI,EAAE,IAAI,QAAQ,GAAG,MAAM,GACjD,OAAO;EAGX,OAAO;CACT;CACA,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,kBAAkB,CAAC,GAC/C,OAAO;CAET,MAAM,QAAQ,OAAO,KAAK,CAAC;CAC3B,MAAM,QAAQ,OAAO,KAAK,CAAC;CAC3B,IAAI,MAAM,WAAW,MAAM,QACzB,OAAO;CAET,KAAK,MAAM,KAAK,OAAO;EACrB,OAAO,QAAQ;EACf,IAAI,OAAO,QAAQ,GACjB,OAAO;EAET,IAAI,CAAC,OAAO,GAAG,CAAC,GACd,OAAO;EAET,IAAI,CAAC,iBAAiB,EAAE,IAAI,EAAE,IAAI,QAAQ,GAAG,MAAM,GACjD,OAAO;CAEX;CACA,OAAO;AACT;AAEA,SAAgB,oBACd,UACA,MACA,OACA,IACA,SACA;;CACA,MAAM,sFAAa,QAAS,+EAAc;CAC1C,MAAM,WAAW,KAAK,MAAM,GAAG,CAAC,CAAC,OAAO,OAAO;CAC/C,IAAI,CAAC,SAAS,QACZ;CAEF,IAAI,UAAe;CACnB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,SAAS,GAAG,KAAK;EAC5C,MAAM,MAAM,SAAS;EACrB,IAAI,CAAC,OAAO,SAAS,GAAG,KAAK,QAAQ,QAAQ,QAAQ,OAAO,QAAQ,SAAS,UAE3E,QAAQ,OAAO,CAAC;EAElB,UAAU,QAAQ;CACpB;CACA,MAAM,OAAO,SAAS,SAAS,SAAS;CACxC,IAAI,OAAO,UACT,IAAI;EACF,OAAO,QAAQ;CACjB,kBACM;EACJ,QAAQ,QAAQ;CAClB;MAGA,QAAQ,QAAQ,aAAa,mBAAmB,KAAK,IAAI;AAE7D;AAEA,SAAgB,gBAAgB,SAY7B;CACD,MAAM,EACJ,OACA,YACA,cACA,iBACA,kBACA,YACA,uBACA,iBACA,gBACA,mBAAmB,OACnB,gBAAgB,CAAC,MACf;CACJ,MAAM,uBAAO,IAAI,QAAqB;CAGtC,MAAM,MAA2B,CAAC;CAClC,MAAM,SAAS,OAAO,SAAS,cAAc,IAAI,EAAE,MAAM,eAAe,IAAI;CAE5E,MAAM,WAAY,WAAW,KAAK,IAAI,MAAM,KAAY,IAAI;CAC5D,MAAM,gBAAgB,cAAc,OAAO,eAAe,WACrD,WAAW,UAAU,IAAI,MAAM,UAAiB,IAAI,aACrD;CACJ,MAAM,YAAY,OAAO,KAAK,QAAQ;CACtC,MAAM,iBAAiB,gBAAgB,OAAO,KAAK,aAAa,IAAI,CAAC;CACrE,MAAM,eAAe,kBAAkB,OAAO,KAAK,YAAY,IAAI,CAAC;CAEpE,KAAK,MAAM,OAAO,WAAW;EAC3B,IAAI,CAAC,iBAAiB,GAAG,GACvB;EAEF,IAAI,OAAO,QAAQ,SAAS,MAAM,MAAM;GAAE,OAAO;GAAY,kBAAkB;GAAuB,UAAU;GAAiB;GAAkB;GAAe,SAAS;GAAQ,OAAO;EAAI,CAAC;CACjM;CAEA,KAAK,MAAM,OAAO,gBAAgB;EAChC,IAAI,CAAC,iBAAiB,GAAG,GACvB;EAEF,IAAI,OAAO,QAAQ,cAAe,MAAM,MAAM;GAAE,OAAO;GAAY,kBAAkB;GAAuB,UAAU;GAAiB;GAAkB;GAAe,SAAS;GAAQ,OAAO;EAAI,CAAC;CACvM;CAEA,KAAK,MAAM,OAAO,cAAc;EAC9B,IAAI,CAAC,iBAAiB,GAAG,GACvB;EAEF,IAAI,OAAO,QAAQ,aAAa,IAAI,CAAC,OAAO,MAAM;GAAE,OAAO;GAAY,kBAAkB;GAAuB,UAAU;GAAiB;GAAkB;GAAe,SAAS;GAAQ,OAAO;EAAI,CAAC;CAC3M;CAEA,OAAO;AACT"}

package/dist/dev/runtime/app/setDataOptions.mjs

@@ -0,0 +1,73 @@
+//#region src/runtime/app/setDataOptions.ts
+function resolveSetDataOptions(setDataOptions) {
+	var _setDataOptions$inclu, _setDataOptions$suspe, _setDataOptions$strat, _setDataOptions$merge, _setDataOptions$compu, _setDataOptions$diagn, _setDataOptions$debug;
+	const includeComputed = (_setDataOptions$inclu = setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.includeComputed) !== null && _setDataOptions$inclu !== void 0 ? _setDataOptions$inclu : true;
+	const suspendWhenHidden = (_setDataOptions$suspe = setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.suspendWhenHidden) !== null && _setDataOptions$suspe !== void 0 ? _setDataOptions$suspe : false;
+	const setDataStrategy = (_setDataOptions$strat = setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.strategy) !== null && _setDataOptions$strat !== void 0 ? _setDataOptions$strat : "diff";
+	const maxPatchKeys = typeof (setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.maxPatchKeys) === "number" ? Math.max(0, setDataOptions.maxPatchKeys) : Number.POSITIVE_INFINITY;
+	const maxPayloadBytes = typeof (setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.maxPayloadBytes) === "number" ? Math.max(0, setDataOptions.maxPayloadBytes) : Number.POSITIVE_INFINITY;
+	const mergeSiblingThreshold = typeof (setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.mergeSiblingThreshold) === "number" ? Math.max(2, Math.floor(setDataOptions.mergeSiblingThreshold)) : 0;
+	const mergeSiblingMaxInflationRatio = typeof (setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.mergeSiblingMaxInflationRatio) === "number" ? Math.max(0, setDataOptions.mergeSiblingMaxInflationRatio) : 1.25;
+	const mergeSiblingMaxParentBytes = typeof (setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.mergeSiblingMaxParentBytes) === "number" ? Math.max(0, setDataOptions.mergeSiblingMaxParentBytes) : Number.POSITIVE_INFINITY;
+	const mergeSiblingSkipArray = (_setDataOptions$merge = setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.mergeSiblingSkipArray) !== null && _setDataOptions$merge !== void 0 ? _setDataOptions$merge : true;
+	const computedCompare = (_setDataOptions$compu = setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.computedCompare) !== null && _setDataOptions$compu !== void 0 ? _setDataOptions$compu : setDataStrategy === "patch" ? "deep" : "reference";
+	const computedCompareMaxDepth = typeof (setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.computedCompareMaxDepth) === "number" ? Math.max(0, Math.floor(setDataOptions.computedCompareMaxDepth)) : 4;
+	const computedCompareMaxKeys = typeof (setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.computedCompareMaxKeys) === "number" ? Math.max(0, Math.floor(setDataOptions.computedCompareMaxKeys)) : 200;
+	const prelinkMaxDepth = setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.prelinkMaxDepth;
+	const prelinkMaxKeys = setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.prelinkMaxKeys;
+	const debug = setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.debug;
+	const diagnostics = (_setDataOptions$diagn = setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.diagnostics) !== null && _setDataOptions$diagn !== void 0 ? _setDataOptions$diagn : "off";
+	const loopWarningOption = setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.loopWarning;
+	const loopWarning = loopWarningOption === false || loopWarningOption && typeof loopWarningOption === "object" && loopWarningOption.enabled === false ? false : {
+		sampleWindowMs: typeof loopWarningOption === "object" && typeof loopWarningOption.sampleWindowMs === "number" ? Math.max(100, Math.floor(loopWarningOption.sampleWindowMs)) : 1e3,
+		maxFlushes: typeof loopWarningOption === "object" && typeof loopWarningOption.maxFlushes === "number" ? Math.max(1, Math.floor(loopWarningOption.maxFlushes)) : 50,
+		coolDownMs: typeof loopWarningOption === "object" && typeof loopWarningOption.coolDownMs === "number" ? Math.max(0, Math.floor(loopWarningOption.coolDownMs)) : 5e3
+	};
+	const debugWhen = (_setDataOptions$debug = setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.debugWhen) !== null && _setDataOptions$debug !== void 0 ? _setDataOptions$debug : "fallback";
+	const debugSampleRate = typeof (setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.debugSampleRate) === "number" ? Math.min(1, Math.max(0, setDataOptions.debugSampleRate)) : 1;
+	const elevateTopKeyThreshold = typeof (setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.elevateTopKeyThreshold) === "number" ? Math.max(0, Math.floor(setDataOptions.elevateTopKeyThreshold)) : Number.POSITIVE_INFINITY;
+	const toPlainMaxDepth = typeof (setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.toPlainMaxDepth) === "number" ? Math.max(0, Math.floor(setDataOptions.toPlainMaxDepth)) : Number.POSITIVE_INFINITY;
+	const toPlainMaxKeys = typeof (setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.toPlainMaxKeys) === "number" ? Math.max(0, Math.floor(setDataOptions.toPlainMaxKeys)) : Number.POSITIVE_INFINITY;
+	const includeFunctions = Boolean(setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.includeFunctions);
+	const functionPaths = Array.isArray(setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.functionPaths) ? [...new Set(setDataOptions.functionPaths.filter((path) => typeof path === "string" && path.length > 0))] : [];
+	const pickSet = Array.isArray(setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.pick) && setDataOptions.pick.length > 0 ? new Set(setDataOptions.pick) : void 0;
+	const omitSet = Array.isArray(setDataOptions === null || setDataOptions === void 0 ? void 0 : setDataOptions.omit) && setDataOptions.omit.length > 0 ? new Set(setDataOptions.omit) : void 0;
+	const shouldIncludeKey = (key) => {
+		if (pickSet && !pickSet.has(key)) return false;
+		if (omitSet && omitSet.has(key)) return false;
+		return true;
+	};
+	return {
+		includeComputed,
+		suspendWhenHidden,
+		setDataStrategy,
+		maxPatchKeys,
+		maxPayloadBytes,
+		mergeSiblingThreshold,
+		mergeSiblingMaxInflationRatio,
+		mergeSiblingMaxParentBytes,
+		mergeSiblingSkipArray,
+		computedCompare,
+		computedCompareMaxDepth,
+		computedCompareMaxKeys,
+		prelinkMaxDepth,
+		prelinkMaxKeys,
+		debug,
+		diagnostics,
+		loopWarning,
+		debugWhen,
+		debugSampleRate,
+		elevateTopKeyThreshold,
+		toPlainMaxDepth,
+		toPlainMaxKeys,
+		includeFunctions,
+		functionPaths,
+		pickSet,
+		omitSet,
+		shouldIncludeKey
+	};
+}
+
+//#endregion
+export { resolveSetDataOptions };
+//# sourceMappingURL=setDataOptions.mjs.map

package/dist/dev/runtime/app/setDataOptions.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"setDataOptions.mjs","names":[],"sources":["../../../../src/runtime/app/setDataOptions.ts"],"sourcesContent":["import type { SetDataSnapshotOptions } from '../types'\n\nexport interface ResolvedSetDataOptions {\n  includeComputed: boolean\n  suspendWhenHidden: boolean\n  setDataStrategy: 'diff' | 'patch'\n  maxPatchKeys: number\n  maxPayloadBytes: number\n  mergeSiblingThreshold: number\n  mergeSiblingMaxInflationRatio: number\n  mergeSiblingMaxParentBytes: number\n  mergeSiblingSkipArray: boolean\n  computedCompare: 'reference' | 'shallow' | 'deep'\n  computedCompareMaxDepth: number\n  computedCompareMaxKeys: number\n  prelinkMaxDepth: number | undefined\n  prelinkMaxKeys: number | undefined\n  debug: SetDataSnapshotOptions['debug']\n  diagnostics: 'off' | 'fallback' | 'always'\n  loopWarning: false | {\n    sampleWindowMs: number\n    maxFlushes: number\n    coolDownMs: number\n  }\n  debugWhen: 'fallback' | 'always'\n  debugSampleRate: number\n  elevateTopKeyThreshold: number\n  toPlainMaxDepth: number\n  toPlainMaxKeys: number\n  includeFunctions: boolean\n  functionPaths: string[]\n  pickSet: Set<string> | undefined\n  omitSet: Set<string> | undefined\n  shouldIncludeKey: (key: string) => boolean\n}\n\nexport function resolveSetDataOptions(\n  setDataOptions?: SetDataSnapshotOptions,\n): ResolvedSetDataOptions {\n  const includeComputed = setDataOptions?.includeComputed ?? true\n  const suspendWhenHidden = setDataOptions?.suspendWhenHidden ?? false\n  const setDataStrategy = setDataOptions?.strategy ?? 'diff'\n  const maxPatchKeys = typeof setDataOptions?.maxPatchKeys === 'number'\n    ? Math.max(0, setDataOptions!.maxPatchKeys!)\n    : Number.POSITIVE_INFINITY\n  const maxPayloadBytes = typeof setDataOptions?.maxPayloadBytes === 'number'\n    ? Math.max(0, setDataOptions!.maxPayloadBytes!)\n    : Number.POSITIVE_INFINITY\n  const mergeSiblingThreshold = typeof setDataOptions?.mergeSiblingThreshold === 'number'\n    ? Math.max(2, Math.floor(setDataOptions!.mergeSiblingThreshold!))\n    : 0\n  const mergeSiblingMaxInflationRatio = typeof setDataOptions?.mergeSiblingMaxInflationRatio === 'number'\n    ? Math.max(0, setDataOptions!.mergeSiblingMaxInflationRatio!)\n    : 1.25\n  const mergeSiblingMaxParentBytes = typeof setDataOptions?.mergeSiblingMaxParentBytes === 'number'\n    ? Math.max(0, setDataOptions!.mergeSiblingMaxParentBytes!)\n    : Number.POSITIVE_INFINITY\n  const mergeSiblingSkipArray = setDataOptions?.mergeSiblingSkipArray ?? true\n  const computedCompare = setDataOptions?.computedCompare ?? (setDataStrategy === 'patch' ? 'deep' : 'reference')\n  const computedCompareMaxDepth = typeof setDataOptions?.computedCompareMaxDepth === 'number'\n    ? Math.max(0, Math.floor(setDataOptions!.computedCompareMaxDepth!))\n    : 4\n  const computedCompareMaxKeys = typeof setDataOptions?.computedCompareMaxKeys === 'number'\n    ? Math.max(0, Math.floor(setDataOptions!.computedCompareMaxKeys!))\n    : 200\n  const prelinkMaxDepth = setDataOptions?.prelinkMaxDepth\n  const prelinkMaxKeys = setDataOptions?.prelinkMaxKeys\n  const debug = setDataOptions?.debug\n  const diagnostics = setDataOptions?.diagnostics ?? 'off'\n  const loopWarningOption = setDataOptions?.loopWarning\n  const loopWarning = loopWarningOption === false || (\n    loopWarningOption\n    && typeof loopWarningOption === 'object'\n    && loopWarningOption.enabled === false\n  )\n    ? false\n    : {\n        sampleWindowMs: typeof loopWarningOption === 'object' && typeof loopWarningOption.sampleWindowMs === 'number'\n          ? Math.max(100, Math.floor(loopWarningOption.sampleWindowMs))\n          : 1000,\n        maxFlushes: typeof loopWarningOption === 'object' && typeof loopWarningOption.maxFlushes === 'number'\n          ? Math.max(1, Math.floor(loopWarningOption.maxFlushes))\n          : 50,\n        coolDownMs: typeof loopWarningOption === 'object' && typeof loopWarningOption.coolDownMs === 'number'\n          ? Math.max(0, Math.floor(loopWarningOption.coolDownMs))\n          : 5000,\n      }\n  const debugWhen = setDataOptions?.debugWhen ?? 'fallback'\n  const debugSampleRate = typeof setDataOptions?.debugSampleRate === 'number'\n    ? Math.min(1, Math.max(0, setDataOptions!.debugSampleRate!))\n    : 1\n  const elevateTopKeyThreshold = typeof setDataOptions?.elevateTopKeyThreshold === 'number'\n    ? Math.max(0, Math.floor(setDataOptions!.elevateTopKeyThreshold!))\n    : Number.POSITIVE_INFINITY\n  const toPlainMaxDepth = typeof setDataOptions?.toPlainMaxDepth === 'number'\n    ? Math.max(0, Math.floor(setDataOptions!.toPlainMaxDepth!))\n    : Number.POSITIVE_INFINITY\n  const toPlainMaxKeys = typeof setDataOptions?.toPlainMaxKeys === 'number'\n    ? Math.max(0, Math.floor(setDataOptions!.toPlainMaxKeys!))\n    : Number.POSITIVE_INFINITY\n  const includeFunctions = Boolean(setDataOptions?.includeFunctions)\n  const functionPaths = Array.isArray(setDataOptions?.functionPaths)\n    ? [...new Set(setDataOptions.functionPaths.filter(path => typeof path === 'string' && path.length > 0))]\n    : []\n  const pickSet = Array.isArray(setDataOptions?.pick) && setDataOptions!.pick!.length > 0\n    ? new Set(setDataOptions!.pick)\n    : undefined\n  const omitSet = Array.isArray(setDataOptions?.omit) && setDataOptions!.omit!.length > 0\n    ? new Set(setDataOptions!.omit)\n    : undefined\n  const shouldIncludeKey = (key: string) => {\n    if (pickSet && !pickSet.has(key)) {\n      return false\n    }\n    if (omitSet && omitSet.has(key)) {\n      return false\n    }\n    return true\n  }\n\n  return {\n    includeComputed,\n    suspendWhenHidden,\n    setDataStrategy,\n    maxPatchKeys,\n    maxPayloadBytes,\n    mergeSiblingThreshold,\n    mergeSiblingMaxInflationRatio,\n    mergeSiblingMaxParentBytes,\n    mergeSiblingSkipArray,\n    computedCompare,\n    computedCompareMaxDepth,\n    computedCompareMaxKeys,\n    prelinkMaxDepth,\n    prelinkMaxKeys,\n    debug,\n    diagnostics,\n    loopWarning,\n    debugWhen,\n    debugSampleRate,\n    elevateTopKeyThreshold,\n    toPlainMaxDepth,\n    toPlainMaxKeys,\n    includeFunctions,\n    functionPaths,\n    pickSet,\n    omitSet,\n    shouldIncludeKey,\n  }\n}\n"],"mappings":";AAoCA,SAAgB,sBACd,gBACwB;;CACxB,MAAM,2GAAkB,eAAgB,wFAAmB;CAC3D,MAAM,6GAAoB,eAAgB,0FAAqB;CAC/D,MAAM,2GAAkB,eAAgB,iFAAY;CACpD,MAAM,eAAe,wEAAO,eAAgB,kBAAiB,WACzD,KAAK,IAAI,GAAG,eAAgB,YAAa,IACzC,OAAO;CACX,MAAM,kBAAkB,wEAAO,eAAgB,qBAAoB,WAC/D,KAAK,IAAI,GAAG,eAAgB,eAAgB,IAC5C,OAAO;CACX,MAAM,wBAAwB,wEAAO,eAAgB,2BAA0B,WAC3E,KAAK,IAAI,GAAG,KAAK,MAAM,eAAgB,qBAAsB,CAAC,IAC9D;CACJ,MAAM,gCAAgC,wEAAO,eAAgB,mCAAkC,WAC3F,KAAK,IAAI,GAAG,eAAgB,6BAA8B,IAC1D;CACJ,MAAM,6BAA6B,wEAAO,eAAgB,gCAA+B,WACrF,KAAK,IAAI,GAAG,eAAgB,0BAA2B,IACvD,OAAO;CACX,MAAM,iHAAwB,eAAgB,8FAAyB;CACvE,MAAM,2GAAkB,eAAgB,wFAAoB,oBAAoB,UAAU,SAAS;CACnG,MAAM,0BAA0B,wEAAO,eAAgB,6BAA4B,WAC/E,KAAK,IAAI,GAAG,KAAK,MAAM,eAAgB,uBAAwB,CAAC,IAChE;CACJ,MAAM,yBAAyB,wEAAO,eAAgB,4BAA2B,WAC7E,KAAK,IAAI,GAAG,KAAK,MAAM,eAAgB,sBAAuB,CAAC,IAC/D;CACJ,MAAM,kFAAkB,eAAgB;CACxC,MAAM,iFAAiB,eAAgB;CACvC,MAAM,wEAAQ,eAAgB;CAC9B,MAAM,uGAAc,eAAgB,oFAAe;CACnD,MAAM,oFAAoB,eAAgB;CAC1C,MAAM,cAAc,sBAAsB,SACxC,qBACG,OAAO,sBAAsB,YAC7B,kBAAkB,YAAY,QAE/B,QACA;EACE,gBAAgB,OAAO,sBAAsB,YAAY,OAAO,kBAAkB,mBAAmB,WACjG,KAAK,IAAI,KAAK,KAAK,MAAM,kBAAkB,cAAc,CAAC,IAC1D;EACJ,YAAY,OAAO,sBAAsB,YAAY,OAAO,kBAAkB,eAAe,WACzF,KAAK,IAAI,GAAG,KAAK,MAAM,kBAAkB,UAAU,CAAC,IACpD;EACJ,YAAY,OAAO,sBAAsB,YAAY,OAAO,kBAAkB,eAAe,WACzF,KAAK,IAAI,GAAG,KAAK,MAAM,kBAAkB,UAAU,CAAC,IACpD;CACN;CACJ,MAAM,qGAAY,eAAgB,kFAAa;CAC/C,MAAM,kBAAkB,wEAAO,eAAgB,qBAAoB,WAC/D,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,eAAgB,eAAgB,CAAC,IACzD;CACJ,MAAM,yBAAyB,wEAAO,eAAgB,4BAA2B,WAC7E,KAAK,IAAI,GAAG,KAAK,MAAM,eAAgB,sBAAuB,CAAC,IAC/D,OAAO;CACX,MAAM,kBAAkB,wEAAO,eAAgB,qBAAoB,WAC/D,KAAK,IAAI,GAAG,KAAK,MAAM,eAAgB,eAAgB,CAAC,IACxD,OAAO;CACX,MAAM,iBAAiB,wEAAO,eAAgB,oBAAmB,WAC7D,KAAK,IAAI,GAAG,KAAK,MAAM,eAAgB,cAAe,CAAC,IACvD,OAAO;CACX,MAAM,mBAAmB,wEAAQ,eAAgB,gBAAgB;CACjE,MAAM,gBAAgB,MAAM,wEAAQ,eAAgB,aAAa,IAC7D,CAAC,GAAG,IAAI,IAAI,eAAe,cAAc,QAAO,SAAQ,OAAO,SAAS,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,IACrG,CAAC;CACL,MAAM,UAAU,MAAM,wEAAQ,eAAgB,IAAI,KAAK,eAAgB,KAAM,SAAS,IAClF,IAAI,IAAI,eAAgB,IAAI,IAC5B;CACJ,MAAM,UAAU,MAAM,wEAAQ,eAAgB,IAAI,KAAK,eAAgB,KAAM,SAAS,IAClF,IAAI,IAAI,eAAgB,IAAI,IAC5B;CACJ,MAAM,oBAAoB,QAAgB;EACxC,IAAI,WAAW,CAAC,QAAQ,IAAI,GAAG,GAC7B,OAAO;EAET,IAAI,WAAW,QAAQ,IAAI,GAAG,GAC5B,OAAO;EAET,OAAO;CACT;CAEA,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;AACF"}