wevu 6.18.7 → 6.19.1

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

@@ -0,0 +1 @@
+{"version":3,"file":"mount.mjs","names":[],"sources":["../../../../src/runtime/app/mount.ts"],"sourcesContent":["import type { MutationRecord, WatchOptions, WatchStopHandle } from '../../reactivity'\nimport type {\n  AppConfig,\n  ComputedDefinitions,\n  CreateAppOptions,\n  ExtractComputed,\n  MethodDefinitions,\n  MiniProgramAdapter,\n  RuntimeInstance,\n  SetDataDebugInfo,\n} from '../types'\nimport {\n  WEVU_ATTRS_KEY,\n  WEVU_PROPS_DERIVED_KEYS_KEY,\n  WEVU_PROPS_KEY,\n  WEVU_SETUP_STATE_KEY,\n} from '@weapp-core/constants'\nimport { addMutationRecorder, effect, isReactive, prelinkReactiveTree, reactive, removeMutationRecorder, shallowReactive, stop, toRaw, touchReactive, watch } from '../../reactivity'\nimport { clearPatchIndices } from '../../reactivity/reactive'\nimport { queueJob } from '../../scheduler'\nimport { hasOwn } from '../../utils'\nimport { createBindModel } from '../bindModel'\nimport { hasTrackableSetupBinding, touchSetupBinding } from '../setupTracking'\nimport { createRuntimeContext } from './context'\nimport { createDiagnosticsLogger } from './diagnostics'\nimport { createSetDataScheduler } from './setData/scheduler'\nimport { resolveSetDataOptions } from './setDataOptions'\n\nfunction createWatchStopHandle(cleanup: () => void, baseHandle?: WatchStopHandle): WatchStopHandle {\n  const stopHandle = (() => {\n    cleanup()\n  }) as WatchStopHandle\n  stopHandle.stop = () => stopHandle()\n  stopHandle.pause = () => {\n    baseHandle?.pause?.()\n  }\n  stopHandle.resume = () => {\n    baseHandle?.resume?.()\n  }\n  return stopHandle\n}\n\ntype RuntimeInstanceWithSetupMethodsVersion<\n  D extends object,\n  C extends ComputedDefinitions,\n  M extends MethodDefinitions,\n> = RuntimeInstance<D, C, M> & {\n  __wevu_touchSetupMethodsVersion?: () => void\n  __wevu_flushSetupSnapshotSync?: () => void\n  __wevu_cloneLatestSnapshot?: () => Record<string, any>\n  __wevu_trackSetupReactiveKey?: (key: string) => void\n}\n\nfunction resolveDataOption<D extends object>(data: CreateAppOptions<D, any, any>['data']): D {\n  if (typeof data === 'function') {\n    return data()\n  }\n  return (data ?? {}) as D\n}\n\nexport function createRuntimeMount<D extends object, C extends ComputedDefinitions, M extends MethodDefinitions>(options: {\n  data: CreateAppOptions<D, C, M>['data']\n  resolvedComputed: C\n  resolvedMethods: M\n  appConfig: AppConfig\n  setDataOptions: CreateAppOptions<D, C, M>['setData']\n}) {\n  const {\n    data,\n    resolvedComputed,\n    resolvedMethods,\n    appConfig,\n    setDataOptions,\n  } = options\n\n  return (adapter?: MiniProgramAdapter): RuntimeInstance<D, C, M> => {\n    const rawState = resolveDataOption(data)\n    const adapterInitialProps = (adapter as any)?.__wevu_initialProps\n    // 预置 props 容器，确保编译器生成的 this.__wevuProps 回退表达式\n    // 在 computed 首次求值阶段即可建立响应式依赖。\n    if (rawState && typeof rawState === 'object' && !hasOwn(rawState as object, WEVU_PROPS_KEY)) {\n      try {\n        Object.defineProperty(rawState as object, WEVU_PROPS_KEY, {\n          value: shallowReactive(Object.create(null)),\n          configurable: true,\n          enumerable: false,\n          writable: false,\n        })\n      }\n      catch {\n        // 若 data 返回对象不可扩展，则跳过预置，后续由 mount 阶段兜底注入。\n      }\n    }\n    const rawProps = rawState && typeof rawState === 'object'\n      ? (rawState as any)[WEVU_PROPS_KEY]\n      : undefined\n    if (rawProps && typeof rawProps === 'object' && adapterInitialProps && typeof adapterInitialProps === 'object') {\n      Object.assign(rawProps, adapterInitialProps)\n    }\n    const state = reactive(rawState)\n    const setupState = reactive(Object.create(null))\n    const adapterSnapshotOmitKeys = (adapter as any)?.__wevu_snapshotOmitKeys\n    const deferInitialSnapshot = Boolean((adapter as any)?.__wevu_deferInitialSnapshot)\n    const adapterInitialSnapshot = (adapter as any)?.__wevu_initialSnapshot\n    const adapterInitialState = (adapter as any)?.__wevu_initialState\n    const snapshotOmitKeys = new Set<string>(\n      adapterSnapshotOmitKeys instanceof Set\n        ? adapterSnapshotOmitKeys\n        : Array.isArray(adapterSnapshotOmitKeys)\n          ? adapterSnapshotOmitKeys\n          : [],\n    )\n    if (rawState && typeof rawState === 'object' && !hasOwn(rawState as object, WEVU_SETUP_STATE_KEY)) {\n      try {\n        Object.defineProperty(rawState as object, WEVU_SETUP_STATE_KEY, {\n          value: setupState,\n          configurable: true,\n          enumerable: false,\n          writable: false,\n        })\n      }\n      catch {\n        // 若 data 返回对象不可扩展，则跳过预置，后续由注册阶段兜底注入。\n      }\n    }\n    if (rawState && typeof rawState === 'object' && adapterInitialState && typeof adapterInitialState === 'object') {\n      for (const [key, value] of Object.entries(adapterInitialState as Record<string, unknown>)) {\n        if (snapshotOmitKeys.has(key)) {\n          continue\n        }\n        ;(rawState as Record<string, unknown>)[key] = value\n      }\n    }\n    const computedDefs = resolvedComputed\n    const methodDefs = resolvedMethods\n\n    let mounted = true\n    const stopHandles: WatchStopHandle[] = []\n    const trackedSetupReactiveKeys = new Set<string>()\n    Object.keys(state as any).forEach((key) => {\n      const value = (state as any)[key]\n      if (hasTrackableSetupBinding(value)) {\n        trackedSetupReactiveKeys.add(key)\n      }\n    })\n\n    const {\n      includeComputed,\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      shouldIncludeKey,\n    } = resolveSetDataOptions(setDataOptions)\n    const diagnosticsLogger = createDiagnosticsLogger(diagnostics)\n    const loopWarningLogger = diagnostics === 'off' && loopWarning\n      ? createDiagnosticsLogger('fallback')\n      : undefined\n    const mergedDebug = (debug || diagnosticsLogger || loopWarningLogger)\n      ? (info: SetDataDebugInfo) => {\n          if (typeof debug === 'function') {\n            debug(info)\n          }\n          diagnosticsLogger?.(info)\n          if (info.reason === 'loopWarning') {\n            loopWarningLogger?.(info)\n          }\n        }\n      : undefined\n    const mergedDebugWhen = diagnostics === 'always'\n      ? 'always'\n      : debugWhen\n\n    const {\n      boundMethods,\n      computedRefs,\n      computedSetters,\n      dirtyComputedKeys,\n      computedProxy,\n      publicInstance,\n      touchSetupMethodsVersion,\n    } = createRuntimeContext({\n      state,\n      setupState: setupState as Record<string, any>,\n      computedDefs,\n      methodDefs,\n      appConfig,\n      includeComputed,\n      setDataStrategy,\n    })\n\n    const currentAdapter = adapter ?? { setData: () => {} }\n    const targetLabel = (currentAdapter as any).__wevu_targetLabel as string | undefined\n    const stateRootRaw = toRaw(state as any) as object\n    let tracker: ReturnType<typeof effect> | undefined\n    const scheduler = createSetDataScheduler({\n      state: state as any,\n      setupState: setupState as any,\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,\n      functionPaths,\n      debug: mergedDebug,\n      debugWhen: mergedDebugWhen,\n      debugSampleRate,\n      loopWarning,\n      targetLabel,\n      runTracker: () => tracker?.(),\n      isMounted: () => mounted,\n      initialSnapshot: adapterInitialSnapshot && typeof adapterInitialSnapshot === 'object'\n        ? adapterInitialSnapshot\n        : undefined,\n      initialState: adapterInitialState && typeof adapterInitialState === 'object'\n        ? adapterInitialState\n        : undefined,\n    })\n    const job = () => scheduler.job(stateRootRaw)\n    const mutationRecorder = (record: MutationRecord) => scheduler.mutationRecorder(record, stateRootRaw)\n\n    tracker = effect(\n      () => {\n        // 通过根版本信号跟踪任意状态变化\n        touchReactive(state as any)\n        // __wevuProps / __wevuAttrs 是非枚举属性，需显式跟踪，\n        // 否则 props/attrs 更新不会触发 setData 调度。\n        const runtimeProps = (state as any)[WEVU_PROPS_KEY]\n        if (isReactive(runtimeProps)) {\n          touchReactive(runtimeProps as any)\n        }\n        const runtimeAttrs = (state as any)[WEVU_ATTRS_KEY]\n        if (isReactive(runtimeAttrs)) {\n          touchReactive(runtimeAttrs as any)\n        }\n        // 在 setup 返回的 ref/computedRef 变更不会提升 reactive 根版本：\n        // 仅跟踪这些明确注册过的键，避免每轮 flush 扫描整份 state。\n        trackedSetupReactiveKeys.forEach((key) => {\n          const v = (setupState as any)[key] ?? (state as any)[key]\n          // setup 返回的组合式对象常常是“普通对象 + 内含 refs/reactive”，\n          // 这里递归触达内部响应式源，确保异步更新也能继续驱动 setData。\n          touchSetupBinding(v)\n        })\n      },\n      {\n        lazy: true,\n        scheduler: () => queueJob(job),\n      },\n    )\n\n    if (!deferInitialSnapshot) {\n      job()\n    }\n\n    stopHandles.push(createWatchStopHandle(() => stop(tracker)))\n    if (setDataStrategy === 'patch') {\n      prelinkReactiveTree(state as any, { shouldIncludeTopKey: shouldIncludeKey, maxDepth: prelinkMaxDepth, maxKeys: prelinkMaxKeys })\n      addMutationRecorder(mutationRecorder)\n      stopHandles.push(createWatchStopHandle(() => removeMutationRecorder(mutationRecorder)))\n      stopHandles.push(createWatchStopHandle(() => clearPatchIndices(state as any)))\n    }\n\n    function registerWatch<T>(\n      source: (() => T) | Record<string, any>,\n      cb: (value: T, oldValue: T) => void,\n      watchOptions?: WatchOptions,\n    ): WatchStopHandle {\n      const stopHandle = watch(source as any, (value: T, oldValue: T) => cb(value, oldValue), watchOptions)\n      stopHandles.push(stopHandle)\n      return createWatchStopHandle(() => {\n        stopHandle()\n        const index = stopHandles.indexOf(stopHandle)\n        if (index >= 0) {\n          stopHandles.splice(index, 1)\n        }\n      }, stopHandle)\n    }\n\n    const bindModel = createBindModel(\n      publicInstance as any,\n      state as any,\n      computedRefs,\n      computedSetters,\n      setupState as Record<string, any>,\n    )\n\n    const unmount = () => {\n      if (!mounted) {\n        return\n      }\n      mounted = false\n      stopHandles.forEach((handle) => {\n        try {\n          handle()\n        }\n        catch {\n          // 卸载阶段忽略 stop 抛错，确保其余清理继续\n        }\n      })\n      stopHandles.length = 0\n    }\n\n    const runtimeInstance: RuntimeInstance<D, C, M> = {\n      get state() {\n        return state\n      },\n      get setupState() {\n        return setupState as Record<string, any>\n      },\n      get proxy() {\n        return publicInstance\n      },\n      get methods() {\n        return boundMethods\n      },\n      get computed() {\n        return computedProxy as Readonly<ExtractComputed<C>>\n      },\n      get adapter() {\n        return currentAdapter\n      },\n      bindModel,\n      watch: registerWatch,\n      snapshot: () => scheduler.snapshot(),\n      unmount,\n    }\n\n    try {\n      Object.defineProperty(runtimeInstance, '__wevu_touchSetupMethodsVersion', {\n        value: touchSetupMethodsVersion,\n        configurable: true,\n        enumerable: false,\n        writable: false,\n      })\n    }\n    catch {\n      ;(runtimeInstance as RuntimeInstanceWithSetupMethodsVersion<D, C, M>).__wevu_touchSetupMethodsVersion = touchSetupMethodsVersion\n    }\n\n    try {\n      Object.defineProperty(runtimeInstance, '__wevu_flushSetupSnapshotSync', {\n        value: job,\n        configurable: true,\n        enumerable: false,\n        writable: false,\n      })\n    }\n    catch {\n      ;(runtimeInstance as RuntimeInstanceWithSetupMethodsVersion<D, C, M>).__wevu_flushSetupSnapshotSync = job\n    }\n\n    try {\n      Object.defineProperty(runtimeInstance, '__wevu_cloneLatestSnapshot', {\n        value: scheduler.cloneLatestSnapshot,\n        configurable: true,\n        enumerable: false,\n        writable: false,\n      })\n    }\n    catch {\n      ;(runtimeInstance as RuntimeInstanceWithSetupMethodsVersion<D, C, M>).__wevu_cloneLatestSnapshot = scheduler.cloneLatestSnapshot\n    }\n\n    try {\n      Object.defineProperty(runtimeInstance, '__wevu_trackSetupReactiveKey', {\n        value: (key: string) => {\n          trackedSetupReactiveKeys.add(key)\n        },\n        configurable: true,\n        enumerable: false,\n        writable: false,\n      })\n    }\n    catch {\n      ;(runtimeInstance as RuntimeInstanceWithSetupMethodsVersion<D, C, M>).__wevu_trackSetupReactiveKey = (key: string) => {\n        trackedSetupReactiveKeys.add(key)\n      }\n    }\n\n    try {\n      Object.defineProperty(runtimeInstance, WEVU_PROPS_DERIVED_KEYS_KEY, {\n        value: snapshotOmitKeys,\n        configurable: true,\n        enumerable: false,\n        writable: false,\n      })\n    }\n    catch {\n      ;(runtimeInstance as any)[WEVU_PROPS_DERIVED_KEYS_KEY] = snapshotOmitKeys\n    }\n\n    return runtimeInstance\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AA4BA,SAAS,sBAAsB,SAAqB,YAA+C;CACjG,MAAM,oBAAoB;EACxB,QAAQ;CACV;CACA,WAAW,aAAa,WAAW;CACnC,WAAW,cAAc;;EACvB,gFAAY,oFAAQ;CACtB;CACA,WAAW,eAAe;;EACxB,iFAAY,uFAAS;CACvB;CACA,OAAO;AACT;AAaA,SAAS,kBAAoC,MAAgD;CAC3F,IAAI,OAAO,SAAS,YAClB,OAAO,KAAK;CAEd,OAAQ,0CAAQ,CAAC;AACnB;AAEA,SAAgB,mBAAiG,SAM9G;CACD,MAAM,EACJ,MACA,kBACA,iBACA,WACA,mBACE;CAEJ,QAAQ,YAA2D;EACjE,MAAM,WAAW,kBAAkB,IAAI;EACvC,MAAM,wEAAuB,QAAiB;EAG9C,IAAI,YAAY,OAAO,aAAa,YAAY,CAAC,OAAO,UAAoB,cAAc,GACxF,IAAI;GACF,OAAO,eAAe,UAAoB,gBAAgB;IACxD,OAAO,gBAAgB,OAAO,OAAO,IAAI,CAAC;IAC1C,cAAc;IACd,YAAY;IACZ,UAAU;GACZ,CAAC;EACH,kBACM,CAEN;EAEF,MAAM,WAAW,YAAY,OAAO,aAAa,WAC5C,SAAiB,kBAClB;EACJ,IAAI,YAAY,OAAO,aAAa,YAAY,uBAAuB,OAAO,wBAAwB,UACpG,OAAO,OAAO,UAAU,mBAAmB;EAE7C,MAAM,QAAQ,SAAS,QAAQ;EAC/B,MAAM,aAAa,SAAS,OAAO,OAAO,IAAI,CAAC;EAC/C,MAAM,4EAA2B,QAAiB;EAClD,MAAM,uBAAuB,0DAAS,QAAiB,2BAA2B;EAClF,MAAM,2EAA0B,QAAiB;EACjD,MAAM,wEAAuB,QAAiB;EAC9C,MAAM,mBAAmB,IAAI,IAC3B,mCAAmC,MAC/B,0BACA,MAAM,QAAQ,uBAAuB,IACnC,0BACA,CAAC,CACT;EACA,IAAI,YAAY,OAAO,aAAa,YAAY,CAAC,OAAO,UAAoB,oBAAoB,GAC9F,IAAI;GACF,OAAO,eAAe,UAAoB,sBAAsB;IAC9D,OAAO;IACP,cAAc;IACd,YAAY;IACZ,UAAU;GACZ,CAAC;EACH,mBACM,CAEN;EAEF,IAAI,YAAY,OAAO,aAAa,YAAY,uBAAuB,OAAO,wBAAwB,UACpG,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,mBAA8C,GAAG;GACzF,IAAI,iBAAiB,IAAI,GAAG,GAC1B;GAED,AAAC,SAAqC,OAAO;EAChD;EAEF,MAAM,eAAe;EACrB,MAAM,aAAa;EAEnB,IAAI,UAAU;EACd,MAAM,cAAiC,CAAC;EACxC,MAAM,2CAA2B,IAAI,IAAY;EACjD,OAAO,KAAK,KAAY,CAAC,CAAC,SAAS,QAAQ;GACzC,MAAM,QAAS,MAAc;GAC7B,IAAI,yBAAyB,KAAK,GAChC,yBAAyB,IAAI,GAAG;EAEpC,CAAC;EAED,MAAM,EACJ,iBACA,iBACA,cACA,iBACA,uBACA,+BACA,4BACA,uBACA,iBACA,yBACA,wBACA,iBACA,gBACA,OACA,aACA,aACA,WACA,iBACA,wBACA,iBACA,gBACA,kBACA,eACA,qBACE,sBAAsB,cAAc;EACxC,MAAM,oBAAoB,wBAAwB,WAAW;EAC7D,MAAM,oBAAoB,gBAAgB,SAAS,cAC/C,wBAAwB,UAAU,IAClC;EACJ,MAAM,cAAe,SAAS,qBAAqB,qBAC9C,SAA2B;GAC1B,IAAI,OAAO,UAAU,YACnB,MAAM,IAAI;GAEZ,gFAAoB,IAAI;GACxB,IAAI,KAAK,WAAW,eAClB,gFAAoB,IAAI;EAE5B,IACA;EACJ,MAAM,kBAAkB,gBAAgB,WACpC,WACA;EAEJ,MAAM,EACJ,cACA,cACA,iBACA,mBACA,eACA,gBACA,6BACE,qBAAqB;GACvB;GACY;GACZ;GACA;GACA;GACA;GACA;EACF,CAAC;EAED,MAAM,iBAAiB,mDAAW,EAAE,eAAe,CAAC,EAAE;EACtD,MAAM,cAAe,eAAuB;EAC5C,MAAM,eAAe,MAAM,KAAY;EACvC,IAAI;EACJ,MAAM,YAAY,uBAAuB;GAChC;GACK;GACZ;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA,OAAO;GACP,WAAW;GACX;GACA;GACA;GACA,oEAAkB,QAAU;GAC5B,iBAAiB;GACjB,iBAAiB,0BAA0B,OAAO,2BAA2B,WACzE,yBACA;GACJ,cAAc,uBAAuB,OAAO,wBAAwB,WAChE,sBACA;EACN,CAAC;EACD,MAAM,YAAY,UAAU,IAAI,YAAY;EAC5C,MAAM,oBAAoB,WAA2B,UAAU,iBAAiB,QAAQ,YAAY;EAEpG,UAAU,aACF;GAEJ,cAAc,KAAY;GAG1B,MAAM,eAAgB,MAAc;GACpC,IAAI,WAAW,YAAY,GACzB,cAAc,YAAmB;GAEnC,MAAM,eAAgB,MAAc;GACpC,IAAI,WAAW,YAAY,GACzB,cAAc,YAAmB;GAInC,yBAAyB,SAAS,QAAQ;;IACxC,MAAM,YAAK,WAAmB,2CAAS,MAAc;IAGrD,kBAAkB,CAAC;GACrB,CAAC;EACH,GACA;GACE,MAAM;GACN,iBAAiB,SAAS,GAAG;EAC/B,CACF;EAEA,IAAI,CAAC,sBACH,IAAI;EAGN,YAAY,KAAK,4BAA4B,KAAK,OAAO,CAAC,CAAC;EAC3D,IAAI,oBAAoB,SAAS;GAC/B,oBAAoB,OAAc;IAAE,qBAAqB;IAAkB,UAAU;IAAiB,SAAS;GAAe,CAAC;GAC/H,oBAAoB,gBAAgB;GACpC,YAAY,KAAK,4BAA4B,uBAAuB,gBAAgB,CAAC,CAAC;GACtF,YAAY,KAAK,4BAA4B,kBAAkB,KAAY,CAAC,CAAC;EAC/E;EAEA,SAAS,cACP,QACA,IACA,cACiB;GACjB,MAAM,aAAa,MAAM,SAAgB,OAAU,aAAgB,GAAG,OAAO,QAAQ,GAAG,YAAY;GACpG,YAAY,KAAK,UAAU;GAC3B,OAAO,4BAA4B;IACjC,WAAW;IACX,MAAM,QAAQ,YAAY,QAAQ,UAAU;IAC5C,IAAI,SAAS,GACX,YAAY,OAAO,OAAO,CAAC;GAE/B,GAAG,UAAU;EACf;EAEA,MAAM,YAAY,gBAChB,gBACA,OACA,cACA,iBACA,UACF;EAEA,MAAM,gBAAgB;GACpB,IAAI,CAAC,SACH;GAEF,UAAU;GACV,YAAY,SAAS,WAAW;IAC9B,IAAI;KACF,OAAO;IACT,mBACM,CAEN;GACF,CAAC;GACD,YAAY,SAAS;EACvB;EAEA,MAAM,kBAA4C;GAChD,IAAI,QAAQ;IACV,OAAO;GACT;GACA,IAAI,aAAa;IACf,OAAO;GACT;GACA,IAAI,QAAQ;IACV,OAAO;GACT;GACA,IAAI,UAAU;IACZ,OAAO;GACT;GACA,IAAI,WAAW;IACb,OAAO;GACT;GACA,IAAI,UAAU;IACZ,OAAO;GACT;GACA;GACA,OAAO;GACP,gBAAgB,UAAU,SAAS;GACnC;EACF;EAEA,IAAI;GACF,OAAO,eAAe,iBAAiB,mCAAmC;IACxE,OAAO;IACP,cAAc;IACd,YAAY;IACZ,UAAU;GACZ,CAAC;EACH,mBACM;GACH,AAAC,gBAAoE,kCAAkC;EAC1G;EAEA,IAAI;GACF,OAAO,eAAe,iBAAiB,iCAAiC;IACtE,OAAO;IACP,cAAc;IACd,YAAY;IACZ,UAAU;GACZ,CAAC;EACH,mBACM;GACH,AAAC,gBAAoE,gCAAgC;EACxG;EAEA,IAAI;GACF,OAAO,eAAe,iBAAiB,8BAA8B;IACnE,OAAO,UAAU;IACjB,cAAc;IACd,YAAY;IACZ,UAAU;GACZ,CAAC;EACH,mBACM;GACH,AAAC,gBAAoE,6BAA6B,UAAU;EAC/G;EAEA,IAAI;GACF,OAAO,eAAe,iBAAiB,gCAAgC;IACrE,QAAQ,QAAgB;KACtB,yBAAyB,IAAI,GAAG;IAClC;IACA,cAAc;IACd,YAAY;IACZ,UAAU;GACZ,CAAC;EACH,mBACM;GACH,AAAC,gBAAoE,gCAAgC,QAAgB;IACpH,yBAAyB,IAAI,GAAG;GAClC;EACF;EAEA,IAAI;GACF,OAAO,eAAe,iBAAiB,6BAA6B;IAClE,OAAO;IACP,cAAc;IACd,YAAY;IACZ,UAAU;GACZ,CAAC;EACH,mBACM;GACH,AAAC,gBAAwB,+BAA+B;EAC3D;EAEA,OAAO;CACT;AACF"}

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

@@ -0,0 +1,14 @@
+//#region src/runtime/app/pending.ts
+let pendingRuntimeAppRegistration;
+function setPendingRuntimeAppRegistration(registration) {
+	pendingRuntimeAppRegistration = registration;
+}
+function takePendingRuntimeAppRegistration() {
+	const registration = pendingRuntimeAppRegistration;
+	pendingRuntimeAppRegistration = void 0;
+	return registration;
+}
+
+//#endregion
+export { setPendingRuntimeAppRegistration, takePendingRuntimeAppRegistration };
+//# sourceMappingURL=pending.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"pending.mjs","names":[],"sources":["../../../../src/runtime/app/pending.ts"],"sourcesContent":["import type { RuntimeApp } from '../types'\n\nexport interface PendingRuntimeAppRegistration {\n  app: RuntimeApp<any, any, any>\n  register: () => void\n}\n\nlet pendingRuntimeAppRegistration: PendingRuntimeAppRegistration | undefined\n\nexport function setPendingRuntimeAppRegistration(registration: PendingRuntimeAppRegistration): void {\n  pendingRuntimeAppRegistration = registration\n}\n\nexport function takePendingRuntimeAppRegistration(): PendingRuntimeAppRegistration | undefined {\n  const registration = pendingRuntimeAppRegistration\n  pendingRuntimeAppRegistration = undefined\n  return registration\n}\n"],"mappings":";AAOA,IAAI;AAEJ,SAAgB,iCAAiC,cAAmD;CAClG,gCAAgC;AAClC;AAEA,SAAgB,oCAA+E;CAC7F,MAAM,eAAe;CACrB,gCAAgC;CAChC,OAAO;AACT"}

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

@@ -0,0 +1,158 @@
+import { toPlain } from "../../diff.mjs";
+import { checkPayloadSize, collapsePayload, mergeSiblingPayload } from "./payload.mjs";
+import { applySnapshotUpdate, cloneSnapshotValue, isDeepEqualValue, isShallowEqualValue, normalizeSetDataValue } from "./snapshot.mjs";
+
+//#region src/runtime/app/setData/patchScheduler.ts
+function runPatchUpdate(options) {
+	const { state, computedRefs, dirtyComputedKeys, includeComputed, computedCompare, computedCompareMaxDepth, computedCompareMaxKeys, currentAdapter, shouldIncludeKey, maxPatchKeys, maxPayloadBytes, mergeSiblingThreshold, mergeSiblingMaxInflationRatio, mergeSiblingMaxParentBytes, mergeSiblingSkipArray, elevateTopKeyThreshold, toPlainMaxDepth, toPlainMaxKeys, includeFunctions = false, functionPaths, plainCache, plainCacheEligibility, pendingPatches, fallbackTopKeys, latestSnapshot, latestComputedSnapshot, needsFullSnapshot, emitDebug, runDiffUpdate } = options;
+	if (pendingPatches.size > maxPatchKeys) {
+		needsFullSnapshot.value = true;
+		const pendingCount = pendingPatches.size;
+		pendingPatches.clear();
+		dirtyComputedKeys.clear();
+		emitDebug({
+			mode: "diff",
+			reason: "maxPatchKeys",
+			pendingPatchKeys: pendingCount,
+			payloadKeys: 0
+		});
+		return runDiffUpdate("maxPatchKeys");
+	}
+	const seen = /* @__PURE__ */ new WeakMap();
+	const plainByPath = /* @__PURE__ */ new Map();
+	const payload = Object.create(null);
+	const patchEntriesRaw = [...pendingPatches.entries()];
+	if (Number.isFinite(elevateTopKeyThreshold) && elevateTopKeyThreshold > 0) {
+		const counts = /* @__PURE__ */ new Map();
+		for (const [path] of patchEntriesRaw) {
+			var _counts$get;
+			const top = path.split(".", 1)[0];
+			counts.set(top, ((_counts$get = counts.get(top)) !== null && _counts$get !== void 0 ? _counts$get : 0) + 1);
+		}
+		for (const [top, count] of counts) if (count >= elevateTopKeyThreshold) fallbackTopKeys.add(top);
+	}
+	const patchEntries = patchEntriesRaw.filter(([path]) => {
+		for (const topKey of fallbackTopKeys) if (path === topKey || path.startsWith(`${topKey}.`)) return false;
+		return true;
+	});
+	const entryMap = new Map(patchEntries);
+	pendingPatches.clear();
+	const getStateValueByPath = (path) => {
+		const segments = path.split(".").filter(Boolean);
+		let current = state;
+		for (const seg of segments) {
+			if (current == null) return current;
+			current = current[seg];
+		}
+		return current;
+	};
+	const getPlainByPath = (path) => {
+		if (plainByPath.has(path)) return plainByPath.get(path);
+		const value = normalizeSetDataValue(toPlain(getStateValueByPath(path), seen, {
+			cache: plainCache,
+			cacheEligibility: plainCacheEligibility,
+			maxDepth: toPlainMaxDepth,
+			maxKeys: toPlainMaxKeys,
+			includeFunctions,
+			functionPaths,
+			_path: path
+		}));
+		plainByPath.set(path, value);
+		return value;
+	};
+	if (fallbackTopKeys.size) {
+		for (const topKey of fallbackTopKeys) {
+			if (!shouldIncludeKey(topKey)) continue;
+			payload[topKey] = getPlainByPath(topKey);
+			entryMap.set(topKey, {
+				kind: "property",
+				op: "set"
+			});
+		}
+		fallbackTopKeys.clear();
+	}
+	for (const [path, entry] of patchEntries) {
+		if ((entry.kind === "array" ? "set" : entry.op) === "delete") {
+			payload[path] = null;
+			continue;
+		}
+		payload[path] = getPlainByPath(path);
+	}
+	let computedDirtyProcessed = 0;
+	if (includeComputed && dirtyComputedKeys.size) {
+		const computedPatch = Object.create(null);
+		const keys = [...dirtyComputedKeys];
+		dirtyComputedKeys.clear();
+		computedDirtyProcessed = keys.length;
+		for (const key of keys) {
+			if (!shouldIncludeKey(key)) continue;
+			const nextValue = toPlain(computedRefs[key].value, seen, {
+				cache: plainCache,
+				cacheEligibility: plainCacheEligibility,
+				maxDepth: toPlainMaxDepth,
+				maxKeys: toPlainMaxKeys,
+				includeFunctions,
+				functionPaths,
+				_path: key
+			});
+			const prevValue = latestComputedSnapshot[key];
+			if (computedCompare === "deep" ? isDeepEqualValue(prevValue, nextValue, computedCompareMaxDepth, { keys: computedCompareMaxKeys }) : computedCompare === "shallow" ? isShallowEqualValue(prevValue, nextValue) : Object.is(prevValue, nextValue)) continue;
+			computedPatch[key] = normalizeSetDataValue(nextValue);
+			latestComputedSnapshot[key] = cloneSnapshotValue(nextValue);
+		}
+		Object.assign(payload, computedPatch);
+	}
+	let collapsedPayload = collapsePayload(payload);
+	let mergedSiblingParents = 0;
+	if (mergeSiblingThreshold) {
+		const mergedResult = mergeSiblingPayload({
+			input: collapsedPayload,
+			entryMap,
+			getPlainByPath,
+			mergeSiblingThreshold,
+			mergeSiblingSkipArray,
+			mergeSiblingMaxParentBytes,
+			mergeSiblingMaxInflationRatio
+		});
+		mergedSiblingParents = mergedResult.merged;
+		collapsedPayload = collapsePayload(mergedResult.out);
+	}
+	const sizeCheck = checkPayloadSize(collapsedPayload, maxPayloadBytes);
+	const shouldFallback = sizeCheck.fallback;
+	emitDebug({
+		mode: shouldFallback ? "diff" : "patch",
+		reason: shouldFallback ? "maxPayloadBytes" : "patch",
+		pendingPatchKeys: patchEntries.length,
+		payloadKeys: Object.keys(collapsedPayload).length,
+		mergedSiblingParents: mergedSiblingParents || void 0,
+		computedDirtyKeys: computedDirtyProcessed || void 0,
+		estimatedBytes: sizeCheck.estimatedBytes,
+		bytes: sizeCheck.bytes
+	});
+	if (shouldFallback) {
+		needsFullSnapshot.value = true;
+		pendingPatches.clear();
+		dirtyComputedKeys.clear();
+		return runDiffUpdate("maxPayloadBytes");
+	}
+	if (!Object.keys(collapsedPayload).length) return;
+	for (const [path, value] of Object.entries(collapsedPayload)) {
+		const entry = entryMap.get(path);
+		if (entry) applySnapshotUpdate(latestSnapshot, path, value, entry.kind === "array" ? "set" : entry.op, { cloneValue: false });
+		else applySnapshotUpdate(latestSnapshot, path, value, "set", { cloneValue: false });
+	}
+	if (typeof currentAdapter.setData === "function") {
+		const result = currentAdapter.setData(collapsedPayload);
+		if (result && typeof result.then === "function") return result.catch(() => {});
+	}
+	emitDebug({
+		mode: "patch",
+		reason: "patch",
+		pendingPatchKeys: patchEntries.length,
+		payloadKeys: Object.keys(collapsedPayload).length
+	});
+}
+
+//#endregion
+export { runPatchUpdate };
+//# sourceMappingURL=patchScheduler.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"patchScheduler.mjs","names":[],"sources":["../../../../../src/runtime/app/setData/patchScheduler.ts"],"sourcesContent":["import type { SetDataDebugInfo } from '../../types'\nimport { toPlain } from '../../diff'\nimport { checkPayloadSize, collapsePayload, mergeSiblingPayload } from './payload'\nimport { applySnapshotUpdate, cloneSnapshotValue, isDeepEqualValue, isShallowEqualValue, normalizeSetDataValue } from './snapshot'\n\ninterface PatchEntry {\n  kind: 'property' | 'array'\n  op: 'set' | 'delete'\n}\n\nexport function runPatchUpdate(options: {\n  state: Record<string, any>\n  computedRefs: Record<string, { value: any }>\n  dirtyComputedKeys: Set<string>\n  includeComputed: boolean\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  plainCache: WeakMap<object, { version: number, value: any }>\n  plainCacheEligibility?: WeakMap<object, boolean>\n  pendingPatches: Map<string, PatchEntry>\n  fallbackTopKeys: Set<string>\n  latestSnapshot: Record<string, any>\n  latestComputedSnapshot: Record<string, any>\n  needsFullSnapshot: { value: boolean }\n  emitDebug: (info: SetDataDebugInfo) => void\n  runDiffUpdate: (reason?: SetDataDebugInfo['reason']) => void | Promise<void>\n}) {\n  const {\n    state,\n    computedRefs,\n    dirtyComputedKeys,\n    includeComputed,\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    plainCache,\n    plainCacheEligibility,\n    pendingPatches,\n    fallbackTopKeys,\n    latestSnapshot,\n    latestComputedSnapshot,\n    needsFullSnapshot,\n    emitDebug,\n    runDiffUpdate,\n  } = options\n\n  if (pendingPatches.size > maxPatchKeys) {\n    needsFullSnapshot.value = true\n    const pendingCount = pendingPatches.size\n    pendingPatches.clear()\n    dirtyComputedKeys.clear()\n    emitDebug({\n      mode: 'diff',\n      reason: 'maxPatchKeys',\n      pendingPatchKeys: pendingCount,\n      payloadKeys: 0,\n    })\n    return runDiffUpdate('maxPatchKeys')\n  }\n\n  const seen = new WeakMap<object, any>()\n  const plainByPath = new Map<string, any>()\n  const payload: Record<string, any> = Object.create(null)\n  const patchEntriesRaw = [...pendingPatches.entries()]\n\n  if (Number.isFinite(elevateTopKeyThreshold) && elevateTopKeyThreshold > 0) {\n    const counts = new Map<string, number>()\n    for (const [path] of patchEntriesRaw) {\n      const top = path.split('.', 1)[0]\n      counts.set(top, (counts.get(top) ?? 0) + 1)\n    }\n    for (const [top, count] of counts) {\n      if (count >= elevateTopKeyThreshold) {\n        fallbackTopKeys.add(top)\n      }\n    }\n  }\n\n  const patchEntries = patchEntriesRaw.filter(([path]) => {\n    for (const topKey of fallbackTopKeys) {\n      if (path === topKey || path.startsWith(`${topKey}.`)) {\n        return false\n      }\n    }\n    return true\n  })\n  const entryMap = new Map(patchEntries)\n  pendingPatches.clear()\n\n  const getStateValueByPath = (path: string) => {\n    const segments = path.split('.').filter(Boolean)\n    let current: any = state as any\n    for (const seg of segments) {\n      if (current == null) {\n        return current\n      }\n      current = current[seg]\n    }\n    return current\n  }\n\n  const getPlainByPath = (path: string) => {\n    if (plainByPath.has(path)) {\n      return plainByPath.get(path)\n    }\n    const value = normalizeSetDataValue(\n      toPlain(getStateValueByPath(path), seen, { cache: plainCache, cacheEligibility: plainCacheEligibility, maxDepth: toPlainMaxDepth, maxKeys: toPlainMaxKeys, includeFunctions, functionPaths, _path: path }),\n    )\n    plainByPath.set(path, value)\n    return value\n  }\n\n  if (fallbackTopKeys.size) {\n    for (const topKey of fallbackTopKeys) {\n      if (!shouldIncludeKey(topKey)) {\n        continue\n      }\n      payload[topKey] = getPlainByPath(topKey)\n      entryMap.set(topKey, { kind: 'property', op: 'set' })\n    }\n    fallbackTopKeys.clear()\n  }\n\n  for (const [path, entry] of patchEntries) {\n    const effectiveOp = entry.kind === 'array' ? 'set' : entry.op\n    if (effectiveOp === 'delete') {\n      payload[path] = null\n      continue\n    }\n    payload[path] = getPlainByPath(path)\n  }\n\n  let computedDirtyProcessed = 0\n  if (includeComputed && dirtyComputedKeys.size) {\n    const computedPatch: Record<string, any> = Object.create(null)\n    const keys = [...dirtyComputedKeys]\n    dirtyComputedKeys.clear()\n    computedDirtyProcessed = keys.length\n    for (const key of keys) {\n      if (!shouldIncludeKey(key)) {\n        continue\n      }\n      const nextValue = toPlain(computedRefs[key].value, seen, { cache: plainCache, cacheEligibility: plainCacheEligibility, maxDepth: toPlainMaxDepth, maxKeys: toPlainMaxKeys, includeFunctions, functionPaths, _path: key })\n      const prevValue = latestComputedSnapshot[key]\n      const equal = computedCompare === 'deep'\n        ? isDeepEqualValue(prevValue, nextValue, computedCompareMaxDepth, { keys: computedCompareMaxKeys })\n        : computedCompare === 'shallow'\n          ? isShallowEqualValue(prevValue, nextValue)\n          : Object.is(prevValue, nextValue)\n      if (equal) {\n        continue\n      }\n      computedPatch[key] = normalizeSetDataValue(nextValue)\n      latestComputedSnapshot[key] = cloneSnapshotValue(nextValue)\n    }\n    Object.assign(payload, computedPatch)\n  }\n\n  let collapsedPayload = collapsePayload(payload)\n  let mergedSiblingParents = 0\n  if (mergeSiblingThreshold) {\n    const mergedResult = mergeSiblingPayload({\n      input: collapsedPayload,\n      entryMap,\n      getPlainByPath,\n      mergeSiblingThreshold,\n      mergeSiblingSkipArray,\n      mergeSiblingMaxParentBytes,\n      mergeSiblingMaxInflationRatio,\n    })\n    mergedSiblingParents = mergedResult.merged\n    collapsedPayload = collapsePayload(mergedResult.out)\n  }\n  const sizeCheck = checkPayloadSize(collapsedPayload, maxPayloadBytes)\n  const shouldFallback = sizeCheck.fallback\n  emitDebug({\n    mode: shouldFallback ? 'diff' : 'patch',\n    reason: shouldFallback ? 'maxPayloadBytes' : 'patch',\n    pendingPatchKeys: patchEntries.length,\n    payloadKeys: Object.keys(collapsedPayload).length,\n    mergedSiblingParents: mergedSiblingParents || undefined,\n    computedDirtyKeys: computedDirtyProcessed || undefined,\n    estimatedBytes: sizeCheck.estimatedBytes,\n    bytes: sizeCheck.bytes,\n  })\n  if (shouldFallback) {\n    needsFullSnapshot.value = true\n    pendingPatches.clear()\n    dirtyComputedKeys.clear()\n    return runDiffUpdate('maxPayloadBytes')\n  }\n  if (!Object.keys(collapsedPayload).length) {\n    return\n  }\n\n  // 保持快照同步，确保 patch 模式可安全回退到 diff。\n  for (const [path, value] of Object.entries(collapsedPayload)) {\n    const entry = entryMap.get(path)\n    if (entry) {\n      applySnapshotUpdate(latestSnapshot, path, value, entry.kind === 'array' ? 'set' : entry.op, { cloneValue: false })\n    }\n    else {\n      // 计算属性或 diffSnapshots 生成的顶层键。\n      applySnapshotUpdate(latestSnapshot, path, value, 'set', { cloneValue: false })\n    }\n  }\n\n  if (typeof currentAdapter.setData === 'function') {\n    const result = currentAdapter.setData(collapsedPayload)\n    if (result && typeof (result as Promise<any>).then === 'function') {\n      return (result as Promise<void>).catch(() => {})\n    }\n  }\n  emitDebug({\n    mode: 'patch',\n    reason: 'patch',\n    pendingPatchKeys: patchEntries.length,\n    payloadKeys: Object.keys(collapsedPayload).length,\n  })\n}\n"],"mappings":";;;;;AAUA,SAAgB,eAAe,SA8B5B;CACD,MAAM,EACJ,OACA,cACA,mBACA,iBACA,iBACA,yBACA,wBACA,gBACA,kBACA,cACA,iBACA,uBACA,+BACA,4BACA,uBACA,wBACA,iBACA,gBACA,mBAAmB,OACnB,eACA,YACA,uBACA,gBACA,iBACA,gBACA,wBACA,mBACA,WACA,kBACE;CAEJ,IAAI,eAAe,OAAO,cAAc;EACtC,kBAAkB,QAAQ;EAC1B,MAAM,eAAe,eAAe;EACpC,eAAe,MAAM;EACrB,kBAAkB,MAAM;EACxB,UAAU;GACR,MAAM;GACN,QAAQ;GACR,kBAAkB;GAClB,aAAa;EACf,CAAC;EACD,OAAO,cAAc,cAAc;CACrC;CAEA,MAAM,uBAAO,IAAI,QAAqB;CACtC,MAAM,8BAAc,IAAI,IAAiB;CACzC,MAAM,UAA+B,OAAO,OAAO,IAAI;CACvD,MAAM,kBAAkB,CAAC,GAAG,eAAe,QAAQ,CAAC;CAEpD,IAAI,OAAO,SAAS,sBAAsB,KAAK,yBAAyB,GAAG;EACzE,MAAM,yBAAS,IAAI,IAAoB;EACvC,KAAK,MAAM,CAAC,SAAS,iBAAiB;;GACpC,MAAM,MAAM,KAAK,MAAM,KAAK,CAAC,CAAC,CAAC;GAC/B,OAAO,IAAI,qBAAM,OAAO,IAAI,GAAG,sDAAK,KAAK,CAAC;EAC5C;EACA,KAAK,MAAM,CAAC,KAAK,UAAU,QACzB,IAAI,SAAS,wBACX,gBAAgB,IAAI,GAAG;CAG7B;CAEA,MAAM,eAAe,gBAAgB,QAAQ,CAAC,UAAU;EACtD,KAAK,MAAM,UAAU,iBACnB,IAAI,SAAS,UAAU,KAAK,WAAW,GAAG,OAAO,EAAE,GACjD,OAAO;EAGX,OAAO;CACT,CAAC;CACD,MAAM,WAAW,IAAI,IAAI,YAAY;CACrC,eAAe,MAAM;CAErB,MAAM,uBAAuB,SAAiB;EAC5C,MAAM,WAAW,KAAK,MAAM,GAAG,CAAC,CAAC,OAAO,OAAO;EAC/C,IAAI,UAAe;EACnB,KAAK,MAAM,OAAO,UAAU;GAC1B,IAAI,WAAW,MACb,OAAO;GAET,UAAU,QAAQ;EACpB;EACA,OAAO;CACT;CAEA,MAAM,kBAAkB,SAAiB;EACvC,IAAI,YAAY,IAAI,IAAI,GACtB,OAAO,YAAY,IAAI,IAAI;EAE7B,MAAM,QAAQ,sBACZ,QAAQ,oBAAoB,IAAI,GAAG,MAAM;GAAE,OAAO;GAAY,kBAAkB;GAAuB,UAAU;GAAiB,SAAS;GAAgB;GAAkB;GAAe,OAAO;EAAK,CAAC,CAC3M;EACA,YAAY,IAAI,MAAM,KAAK;EAC3B,OAAO;CACT;CAEA,IAAI,gBAAgB,MAAM;EACxB,KAAK,MAAM,UAAU,iBAAiB;GACpC,IAAI,CAAC,iBAAiB,MAAM,GAC1B;GAEF,QAAQ,UAAU,eAAe,MAAM;GACvC,SAAS,IAAI,QAAQ;IAAE,MAAM;IAAY,IAAI;GAAM,CAAC;EACtD;EACA,gBAAgB,MAAM;CACxB;CAEA,KAAK,MAAM,CAAC,MAAM,UAAU,cAAc;EAExC,KADoB,MAAM,SAAS,UAAU,QAAQ,MAAM,QACvC,UAAU;GAC5B,QAAQ,QAAQ;GAChB;EACF;EACA,QAAQ,QAAQ,eAAe,IAAI;CACrC;CAEA,IAAI,yBAAyB;CAC7B,IAAI,mBAAmB,kBAAkB,MAAM;EAC7C,MAAM,gBAAqC,OAAO,OAAO,IAAI;EAC7D,MAAM,OAAO,CAAC,GAAG,iBAAiB;EAClC,kBAAkB,MAAM;EACxB,yBAAyB,KAAK;EAC9B,KAAK,MAAM,OAAO,MAAM;GACtB,IAAI,CAAC,iBAAiB,GAAG,GACvB;GAEF,MAAM,YAAY,QAAQ,aAAa,IAAI,CAAC,OAAO,MAAM;IAAE,OAAO;IAAY,kBAAkB;IAAuB,UAAU;IAAiB,SAAS;IAAgB;IAAkB;IAAe,OAAO;GAAI,CAAC;GACxN,MAAM,YAAY,uBAAuB;GAMzC,IALc,oBAAoB,SAC9B,iBAAiB,WAAW,WAAW,yBAAyB,EAAE,MAAM,uBAAuB,CAAC,IAChG,oBAAoB,YAClB,oBAAoB,WAAW,SAAS,IACxC,OAAO,GAAG,WAAW,SAAS,GAElC;GAEF,cAAc,OAAO,sBAAsB,SAAS;GACpD,uBAAuB,OAAO,mBAAmB,SAAS;EAC5D;EACA,OAAO,OAAO,SAAS,aAAa;CACtC;CAEA,IAAI,mBAAmB,gBAAgB,OAAO;CAC9C,IAAI,uBAAuB;CAC3B,IAAI,uBAAuB;EACzB,MAAM,eAAe,oBAAoB;GACvC,OAAO;GACP;GACA;GACA;GACA;GACA;GACA;EACF,CAAC;EACD,uBAAuB,aAAa;EACpC,mBAAmB,gBAAgB,aAAa,GAAG;CACrD;CACA,MAAM,YAAY,iBAAiB,kBAAkB,eAAe;CACpE,MAAM,iBAAiB,UAAU;CACjC,UAAU;EACR,MAAM,iBAAiB,SAAS;EAChC,QAAQ,iBAAiB,oBAAoB;EAC7C,kBAAkB,aAAa;EAC/B,aAAa,OAAO,KAAK,gBAAgB,CAAC,CAAC;EAC3C,sBAAsB,wBAAwB;EAC9C,mBAAmB,0BAA0B;EAC7C,gBAAgB,UAAU;EAC1B,OAAO,UAAU;CACnB,CAAC;CACD,IAAI,gBAAgB;EAClB,kBAAkB,QAAQ;EAC1B,eAAe,MAAM;EACrB,kBAAkB,MAAM;EACxB,OAAO,cAAc,iBAAiB;CACxC;CACA,IAAI,CAAC,OAAO,KAAK,gBAAgB,CAAC,CAAC,QACjC;CAIF,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,gBAAgB,GAAG;EAC5D,MAAM,QAAQ,SAAS,IAAI,IAAI;EAC/B,IAAI,OACF,oBAAoB,gBAAgB,MAAM,OAAO,MAAM,SAAS,UAAU,QAAQ,MAAM,IAAI,EAAE,YAAY,MAAM,CAAC;OAIjH,oBAAoB,gBAAgB,MAAM,OAAO,OAAO,EAAE,YAAY,MAAM,CAAC;CAEjF;CAEA,IAAI,OAAO,eAAe,YAAY,YAAY;EAChD,MAAM,SAAS,eAAe,QAAQ,gBAAgB;EACtD,IAAI,UAAU,OAAQ,OAAwB,SAAS,YACrD,OAAQ,OAAyB,YAAY,CAAC,CAAC;CAEnD;CACA,UAAU;EACR,MAAM;EACN,QAAQ;EACR,kBAAkB,aAAa;EAC/B,aAAa,OAAO,KAAK,gBAAgB,CAAC,CAAC;CAC7C,CAAC;AACH"}

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

@@ -0,0 +1,161 @@
+import { hasOwn } from "../../../utils.mjs";
+
+//#region src/runtime/app/setData/payload.ts
+function collapsePayload(input) {
+	const keys = Object.keys(input).sort();
+	if (keys.length <= 1) return input;
+	const out = {};
+	const prefixStack = [];
+	for (const key of keys) {
+		while (prefixStack.length) {
+			const prefix = prefixStack[prefixStack.length - 1];
+			if (key.startsWith(prefix)) break;
+			prefixStack.pop();
+		}
+		if (prefixStack.length) continue;
+		out[key] = input[key];
+		prefixStack.push(`${key}.`);
+	}
+	return out;
+}
+function estimateJsonSize(value, limit, seen) {
+	if (limit <= 0) return limit + 1;
+	if (value === null) return 4;
+	const t = typeof value;
+	if (t === "string") return 2 + value.length;
+	if (t === "number") return Number.isFinite(value) ? String(value).length : 4;
+	if (t === "boolean") return value ? 4 : 5;
+	if (t === "undefined" || t === "function" || t === "symbol") return 4;
+	if (t !== "object") return 4;
+	if (seen.has(value)) return 4;
+	seen.add(value);
+	if (Array.isArray(value)) {
+		let size = 2;
+		for (let i = 0; i < value.length; i++) {
+			if (i) size += 1;
+			size += estimateJsonSize(value[i], limit - size, seen);
+			if (size > limit) return size;
+		}
+		return size;
+	}
+	let size = 2;
+	for (const [k, v] of Object.entries(value)) {
+		if (size > 2) size += 1;
+		size += 2 + k.length + 1;
+		size += estimateJsonSize(v, limit - size, seen);
+		if (size > limit) return size;
+	}
+	return size;
+}
+function checkPayloadSize(payload, maxPayloadBytes) {
+	if (maxPayloadBytes === Number.POSITIVE_INFINITY) return {
+		fallback: false,
+		estimatedBytes: void 0,
+		bytes: void 0
+	};
+	const limit = maxPayloadBytes;
+	const keyCount = Object.keys(payload).length;
+	const estimated = estimateJsonSize(payload, limit + 1, /* @__PURE__ */ new WeakSet());
+	if (estimated > limit) return {
+		fallback: true,
+		estimatedBytes: estimated,
+		bytes: void 0
+	};
+	if (estimated >= limit * .85 && keyCount > 2) try {
+		const bytes = JSON.stringify(payload).length;
+		return {
+			fallback: bytes > limit,
+			estimatedBytes: estimated,
+			bytes
+		};
+	} catch (_unused) {
+		return {
+			fallback: false,
+			estimatedBytes: estimated,
+			bytes: void 0
+		};
+	}
+	return {
+		fallback: false,
+		estimatedBytes: estimated,
+		bytes: void 0
+	};
+}
+function mergeSiblingPayload(options) {
+	const { input, entryMap, getPlainByPath, mergeSiblingThreshold, mergeSiblingSkipArray, mergeSiblingMaxParentBytes, mergeSiblingMaxInflationRatio } = options;
+	if (!mergeSiblingThreshold) return {
+		out: input,
+		merged: 0
+	};
+	const keys = Object.keys(input);
+	if (keys.length < mergeSiblingThreshold) return {
+		out: input,
+		merged: 0
+	};
+	const groups = /* @__PURE__ */ new Map();
+	const hasDelete = /* @__PURE__ */ new Set();
+	for (const key of keys) {
+		var _groups$get;
+		const entry = entryMap.get(key);
+		if (!entry) continue;
+		if (input[key] === null || entry.op === "delete") {
+			const dot = key.lastIndexOf(".");
+			if (dot > 0) hasDelete.add(key.slice(0, dot));
+			continue;
+		}
+		const dot = key.lastIndexOf(".");
+		if (dot <= 0) continue;
+		const parent = key.slice(0, dot);
+		const list = (_groups$get = groups.get(parent)) !== null && _groups$get !== void 0 ? _groups$get : [];
+		list.push(key);
+		groups.set(parent, list);
+	}
+	const parents = [...groups.entries()].filter(([parent, list]) => list.length >= mergeSiblingThreshold && !hasDelete.has(parent)).sort((a, b) => b[0].split(".").length - a[0].split(".").length);
+	if (!parents.length) return {
+		out: input,
+		merged: 0
+	};
+	const out = {};
+	Object.assign(out, input);
+	let merged = 0;
+	const valueSizeCache = /* @__PURE__ */ new WeakMap();
+	const estimateValueSize = (value) => {
+		if (value && typeof value === "object") {
+			const cached = valueSizeCache.get(value);
+			if (cached !== void 0) return cached;
+			const size = estimateJsonSize(value, Number.POSITIVE_INFINITY, /* @__PURE__ */ new WeakSet());
+			valueSizeCache.set(value, size);
+			return size;
+		}
+		return estimateJsonSize(value, Number.POSITIVE_INFINITY, /* @__PURE__ */ new WeakSet());
+	};
+	const estimateEntryBytes = (key, value) => {
+		return 2 + key.length + 1 + estimateValueSize(value);
+	};
+	for (const [parent, list] of parents) {
+		if (hasOwn(out, parent)) continue;
+		const existingChildren = list.filter((k) => hasOwn(out, k));
+		if (existingChildren.length < mergeSiblingThreshold) continue;
+		const parentValue = getPlainByPath(parent);
+		if (mergeSiblingSkipArray && Array.isArray(parentValue)) continue;
+		if (mergeSiblingMaxParentBytes !== Number.POSITIVE_INFINITY) {
+			if (estimateEntryBytes(parent, parentValue) > mergeSiblingMaxParentBytes) continue;
+		}
+		if (mergeSiblingMaxInflationRatio !== Number.POSITIVE_INFINITY) {
+			let childBytes = 0;
+			for (const child of existingChildren) childBytes += estimateEntryBytes(child, out[child]);
+			if (estimateEntryBytes(parent, parentValue) > childBytes * mergeSiblingMaxInflationRatio) continue;
+		}
+		out[parent] = parentValue;
+		for (const child of existingChildren) delete out[child];
+		merged += 1;
+	}
+	return {
+		out,
+		merged
+	};
+}
+
+//#endregion
+export { checkPayloadSize, collapsePayload, estimateJsonSize, mergeSiblingPayload };
+//# sourceMappingURL=payload.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"payload.mjs","names":[],"sources":["../../../../../src/runtime/app/setData/payload.ts"],"sourcesContent":["import { hasOwn } from '../../../utils'\n\nexport function collapsePayload(input: Record<string, any>) {\n  const keys = Object.keys(input).sort()\n  if (keys.length <= 1) {\n    return input\n  }\n  // 折叠后的 payload 会直接传给原生 setData，并可能被微信开发者工具热重载脚本递归遍历。\n  // 这里不能使用 Object.create(null)，否则运行时内部的 o.hasOwnProperty(...) 会抛错。\n  const out: Record<string, any> = {}\n  const prefixStack: string[] = []\n  for (const key of keys) {\n    while (prefixStack.length) {\n      const prefix = prefixStack[prefixStack.length - 1]!\n      if (key.startsWith(prefix)) {\n        break\n      }\n      prefixStack.pop()\n    }\n    if (prefixStack.length) {\n      continue\n    }\n    out[key] = input[key]\n    prefixStack.push(`${key}.`)\n  }\n  return out\n}\n\nexport function estimateJsonSize(\n  value: any,\n  limit: number,\n  seen: WeakSet<object>,\n): number {\n  if (limit <= 0) {\n    return limit + 1\n  }\n  if (value === null) {\n    return 4\n  }\n  const t = typeof value\n  if (t === 'string') {\n    // 粗略估算：未计入转义开销；接近阈值时再用 JSON.stringify 校验\n    return 2 + value.length\n  }\n  if (t === 'number') {\n    return Number.isFinite(value) ? String(value).length : 4 // 空值占位\n  }\n  if (t === 'boolean') {\n    return value ? 4 : 5\n  }\n  if (t === 'undefined' || t === 'function' || t === 'symbol') {\n    return 4 // 空值占位\n  }\n  if (t !== 'object') {\n    return 4\n  }\n\n  if (seen.has(value)) {\n    return 4\n  }\n  seen.add(value)\n\n  if (Array.isArray(value)) {\n    let size = 2 // []\n    for (let i = 0; i < value.length; i++) {\n      if (i) {\n        size += 1\n      }\n      size += estimateJsonSize(value[i], limit - size, seen)\n      if (size > limit) {\n        return size\n      }\n    }\n    return size\n  }\n\n  let size = 2 // {}\n  for (const [k, v] of Object.entries(value)) {\n    if (size > 2) {\n      size += 1\n    }\n    // 键名部分：\n    size += 2 + k.length + 1\n    size += estimateJsonSize(v, limit - size, seen)\n    if (size > limit) {\n      return size\n    }\n  }\n  return size\n}\n\nexport function checkPayloadSize(payload: Record<string, any>, maxPayloadBytes: number) {\n  if (maxPayloadBytes === Number.POSITIVE_INFINITY) {\n    return { fallback: false as const, estimatedBytes: undefined as number | undefined, bytes: undefined as number | undefined }\n  }\n  const limit = maxPayloadBytes\n  const keyCount = Object.keys(payload).length\n  const estimated = estimateJsonSize(payload, limit + 1, new WeakSet())\n  if (estimated > limit) {\n    return { fallback: true as const, estimatedBytes: estimated, bytes: undefined }\n  }\n  // 接近阈值时再用 JSON.stringify 精确判断，避免低估导致未降级\n  if (estimated >= limit * 0.85 && keyCount > 2) {\n    try {\n      const bytes = JSON.stringify(payload).length\n      return { fallback: bytes > limit, estimatedBytes: estimated, bytes }\n    }\n    catch {\n      return { fallback: false as const, estimatedBytes: estimated, bytes: undefined }\n    }\n  }\n  return { fallback: false as const, estimatedBytes: estimated, bytes: undefined }\n}\n\nexport function mergeSiblingPayload(options: {\n  input: Record<string, any>\n  entryMap: Map<string, { kind: 'property' | 'array', op: 'set' | 'delete' }>\n  getPlainByPath: (path: string) => any\n  mergeSiblingThreshold: number\n  mergeSiblingSkipArray: boolean\n  mergeSiblingMaxParentBytes: number\n  mergeSiblingMaxInflationRatio: number\n}) {\n  const {\n    input,\n    entryMap,\n    getPlainByPath,\n    mergeSiblingThreshold,\n    mergeSiblingSkipArray,\n    mergeSiblingMaxParentBytes,\n    mergeSiblingMaxInflationRatio,\n  } = options\n\n  if (!mergeSiblingThreshold) {\n    return { out: input, merged: 0 }\n  }\n\n  const keys = Object.keys(input)\n  if (keys.length < mergeSiblingThreshold) {\n    return { out: input, merged: 0 }\n  }\n\n  const groups = new Map<string, string[]>()\n  const hasDelete = new Set<string>()\n\n  for (const key of keys) {\n    const entry = entryMap.get(key)\n    if (!entry) {\n      continue\n    }\n    if (input[key] === null || entry.op === 'delete') {\n      const dot = key.lastIndexOf('.')\n      if (dot > 0) {\n        hasDelete.add(key.slice(0, dot))\n      }\n      continue\n    }\n    const dot = key.lastIndexOf('.')\n    if (dot <= 0) {\n      continue\n    }\n    const parent = key.slice(0, dot)\n    const list = groups.get(parent) ?? []\n    list.push(key)\n    groups.set(parent, list)\n  }\n\n  const parents = [...groups.entries()]\n    .filter(([parent, list]) => list.length >= mergeSiblingThreshold && !hasDelete.has(parent))\n    .sort((a, b) => b[0].split('.').length - a[0].split('.').length)\n\n  if (!parents.length) {\n    return { out: input, merged: 0 }\n  }\n\n  // mergeSiblingPayload 的输出仍然属于对外 payload，必须保持普通对象原型。\n  // 后续如果为了“纯字典”语义改成 null-prototype，会重新引入热重载兼容性问题。\n  const out: Record<string, any> = {}\n  Object.assign(out, input)\n\n  let merged = 0\n  const valueSizeCache = new WeakMap<object, number>()\n  const estimateValueSize = (value: any) => {\n    if (value && typeof value === 'object') {\n      const cached = valueSizeCache.get(value as object)\n      if (cached !== undefined) {\n        return cached\n      }\n      const size = estimateJsonSize(value, Number.POSITIVE_INFINITY, new WeakSet())\n      valueSizeCache.set(value as object, size)\n      return size\n    }\n    return estimateJsonSize(value, Number.POSITIVE_INFINITY, new WeakSet())\n  }\n  const estimateEntryBytes = (key: string, value: any) => {\n    // 键名部分：\n    return (2 + key.length + 1) + estimateValueSize(value)\n  }\n\n  for (const [parent, list] of parents) {\n    if (hasOwn(out, parent)) {\n      continue\n    }\n    const existingChildren = list.filter(k => hasOwn(out, k))\n    if (existingChildren.length < mergeSiblingThreshold) {\n      continue\n    }\n    const parentValue = getPlainByPath(parent)\n    if (mergeSiblingSkipArray && Array.isArray(parentValue)) {\n      continue\n    }\n    if (mergeSiblingMaxParentBytes !== Number.POSITIVE_INFINITY) {\n      const parentBytes = estimateEntryBytes(parent, parentValue)\n      if (parentBytes > mergeSiblingMaxParentBytes) {\n        continue\n      }\n    }\n    if (mergeSiblingMaxInflationRatio !== Number.POSITIVE_INFINITY) {\n      let childBytes = 0\n      for (const child of existingChildren) {\n        childBytes += estimateEntryBytes(child, out[child])\n      }\n      const parentBytes = estimateEntryBytes(parent, parentValue)\n      if (parentBytes > childBytes * mergeSiblingMaxInflationRatio) {\n        continue\n      }\n    }\n    out[parent] = parentValue\n    for (const child of existingChildren) {\n      delete out[child]\n    }\n    merged += 1\n  }\n\n  return { out, merged }\n}\n"],"mappings":";;;AAEA,SAAgB,gBAAgB,OAA4B;CAC1D,MAAM,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,KAAK;CACrC,IAAI,KAAK,UAAU,GACjB,OAAO;CAIT,MAAM,MAA2B,CAAC;CAClC,MAAM,cAAwB,CAAC;CAC/B,KAAK,MAAM,OAAO,MAAM;EACtB,OAAO,YAAY,QAAQ;GACzB,MAAM,SAAS,YAAY,YAAY,SAAS;GAChD,IAAI,IAAI,WAAW,MAAM,GACvB;GAEF,YAAY,IAAI;EAClB;EACA,IAAI,YAAY,QACd;EAEF,IAAI,OAAO,MAAM;EACjB,YAAY,KAAK,GAAG,IAAI,EAAE;CAC5B;CACA,OAAO;AACT;AAEA,SAAgB,iBACd,OACA,OACA,MACQ;CACR,IAAI,SAAS,GACX,OAAO,QAAQ;CAEjB,IAAI,UAAU,MACZ,OAAO;CAET,MAAM,IAAI,OAAO;CACjB,IAAI,MAAM,UAER,OAAO,IAAI,MAAM;CAEnB,IAAI,MAAM,UACR,OAAO,OAAO,SAAS,KAAK,IAAI,OAAO,KAAK,CAAC,CAAC,SAAS;CAEzD,IAAI,MAAM,WACR,OAAO,QAAQ,IAAI;CAErB,IAAI,MAAM,eAAe,MAAM,cAAc,MAAM,UACjD,OAAO;CAET,IAAI,MAAM,UACR,OAAO;CAGT,IAAI,KAAK,IAAI,KAAK,GAChB,OAAO;CAET,KAAK,IAAI,KAAK;CAEd,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxB,IAAI,OAAO;EACX,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,IAAI,GACF,QAAQ;GAEV,QAAQ,iBAAiB,MAAM,IAAI,QAAQ,MAAM,IAAI;GACrD,IAAI,OAAO,OACT,OAAO;EAEX;EACA,OAAO;CACT;CAEA,IAAI,OAAO;CACX,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,KAAK,GAAG;EAC1C,IAAI,OAAO,GACT,QAAQ;EAGV,QAAQ,IAAI,EAAE,SAAS;EACvB,QAAQ,iBAAiB,GAAG,QAAQ,MAAM,IAAI;EAC9C,IAAI,OAAO,OACT,OAAO;CAEX;CACA,OAAO;AACT;AAEA,SAAgB,iBAAiB,SAA8B,iBAAyB;CACtF,IAAI,oBAAoB,OAAO,mBAC7B,OAAO;EAAE,UAAU;EAAgB,gBAAgB;EAAiC,OAAO;CAAgC;CAE7H,MAAM,QAAQ;CACd,MAAM,WAAW,OAAO,KAAK,OAAO,CAAC,CAAC;CACtC,MAAM,YAAY,iBAAiB,SAAS,QAAQ,mBAAG,IAAI,QAAQ,CAAC;CACpE,IAAI,YAAY,OACd,OAAO;EAAE,UAAU;EAAe,gBAAgB;EAAW,OAAO;CAAU;CAGhF,IAAI,aAAa,QAAQ,OAAQ,WAAW,GAC1C,IAAI;EACF,MAAM,QAAQ,KAAK,UAAU,OAAO,CAAC,CAAC;EACtC,OAAO;GAAE,UAAU,QAAQ;GAAO,gBAAgB;GAAW;EAAM;CACrE,kBACM;EACJ,OAAO;GAAE,UAAU;GAAgB,gBAAgB;GAAW,OAAO;EAAU;CACjF;CAEF,OAAO;EAAE,UAAU;EAAgB,gBAAgB;EAAW,OAAO;CAAU;AACjF;AAEA,SAAgB,oBAAoB,SAQjC;CACD,MAAM,EACJ,OACA,UACA,gBACA,uBACA,uBACA,4BACA,kCACE;CAEJ,IAAI,CAAC,uBACH,OAAO;EAAE,KAAK;EAAO,QAAQ;CAAE;CAGjC,MAAM,OAAO,OAAO,KAAK,KAAK;CAC9B,IAAI,KAAK,SAAS,uBAChB,OAAO;EAAE,KAAK;EAAO,QAAQ;CAAE;CAGjC,MAAM,yBAAS,IAAI,IAAsB;CACzC,MAAM,4BAAY,IAAI,IAAY;CAElC,KAAK,MAAM,OAAO,MAAM;;EACtB,MAAM,QAAQ,SAAS,IAAI,GAAG;EAC9B,IAAI,CAAC,OACH;EAEF,IAAI,MAAM,SAAS,QAAQ,MAAM,OAAO,UAAU;GAChD,MAAM,MAAM,IAAI,YAAY,GAAG;GAC/B,IAAI,MAAM,GACR,UAAU,IAAI,IAAI,MAAM,GAAG,GAAG,CAAC;GAEjC;EACF;EACA,MAAM,MAAM,IAAI,YAAY,GAAG;EAC/B,IAAI,OAAO,GACT;EAEF,MAAM,SAAS,IAAI,MAAM,GAAG,GAAG;EAC/B,MAAM,sBAAO,OAAO,IAAI,MAAM,sDAAK,CAAC;EACpC,KAAK,KAAK,GAAG;EACb,OAAO,IAAI,QAAQ,IAAI;CACzB;CAEA,MAAM,UAAU,CAAC,GAAG,OAAO,QAAQ,CAAC,CAAC,CAClC,QAAQ,CAAC,QAAQ,UAAU,KAAK,UAAU,yBAAyB,CAAC,UAAU,IAAI,MAAM,CAAC,CAAC,CAC1F,MAAM,GAAG,MAAM,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM;CAEjE,IAAI,CAAC,QAAQ,QACX,OAAO;EAAE,KAAK;EAAO,QAAQ;CAAE;CAKjC,MAAM,MAA2B,CAAC;CAClC,OAAO,OAAO,KAAK,KAAK;CAExB,IAAI,SAAS;CACb,MAAM,iCAAiB,IAAI,QAAwB;CACnD,MAAM,qBAAqB,UAAe;EACxC,IAAI,SAAS,OAAO,UAAU,UAAU;GACtC,MAAM,SAAS,eAAe,IAAI,KAAe;GACjD,IAAI,WAAW,QACb,OAAO;GAET,MAAM,OAAO,iBAAiB,OAAO,OAAO,mCAAmB,IAAI,QAAQ,CAAC;GAC5E,eAAe,IAAI,OAAiB,IAAI;GACxC,OAAO;EACT;EACA,OAAO,iBAAiB,OAAO,OAAO,mCAAmB,IAAI,QAAQ,CAAC;CACxE;CACA,MAAM,sBAAsB,KAAa,UAAe;EAEtD,OAAQ,IAAI,IAAI,SAAS,IAAK,kBAAkB,KAAK;CACvD;CAEA,KAAK,MAAM,CAAC,QAAQ,SAAS,SAAS;EACpC,IAAI,OAAO,KAAK,MAAM,GACpB;EAEF,MAAM,mBAAmB,KAAK,QAAO,MAAK,OAAO,KAAK,CAAC,CAAC;EACxD,IAAI,iBAAiB,SAAS,uBAC5B;EAEF,MAAM,cAAc,eAAe,MAAM;EACzC,IAAI,yBAAyB,MAAM,QAAQ,WAAW,GACpD;EAEF,IAAI,+BAA+B,OAAO,mBAExC;OADoB,mBAAmB,QAAQ,WACjC,IAAI,4BAChB;EACF;EAEF,IAAI,kCAAkC,OAAO,mBAAmB;GAC9D,IAAI,aAAa;GACjB,KAAK,MAAM,SAAS,kBAClB,cAAc,mBAAmB,OAAO,IAAI,MAAM;GAGpD,IADoB,mBAAmB,QAAQ,WACjC,IAAI,aAAa,+BAC7B;EAEJ;EACA,IAAI,UAAU;EACd,KAAK,MAAM,SAAS,kBAClB,OAAO,IAAI;EAEb,UAAU;CACZ;CAEA,OAAO;EAAE;EAAK;CAAO;AACvB"}