@pravosleva/reactive-engine 2.4.0 → 2.4.1-alpha.1

package/dist/core/core.advanced.gc-leak.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=core.advanced.gc-leak.test.d.ts.map

package/dist/core/core.advanced.gc-leak.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"core.advanced.gc-leak.test.d.ts","sourceRoot":"","sources":["../../src/core/core.advanced.gc-leak.test.ts"],"names":[],"mappings":""}

package/dist/core/core.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"core.d.ts","sourceRoot":"","sources":["../../src/core/core.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAW,mBAAmB,EAAE,YAAY,EAAE,SAAS,EAAiC,aAAa,EAAE,eAAe,EAAiB,QAAQ,EAAE,MAAM,SAAS,CAAA;AAUzL,KAAK,WAAW,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;AAE/C,KAAK,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAA;AAEpC,KAAK,cAAc,CAAC,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,CAAA;AAuBtE,wBAAgB,QAAQ,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;IAAE,IAAI,CAAC,EAAE,OAAO,CAAC;IAAC,EAAE,CAAC,EAAE,OAAO,CAAC;IAAC,OAAO,CAAC,EAAE,OAAO,CAAA;CAAE,GAAG,IAAI,CAM/H;AACD,wBAAgB,SAAS,IAAI,IAAI,CA8BhC;AACD,qBAAa,kBAAkB;IAC7B,SAAS,CAAC,eAAe,SAAS;IAClC,OAAO,CAAC,MAAM,CAAqB;IAC5B,KAAK,SAAI;IACT,cAAc,EAAE,GAAG,CAAO;IAC1B,UAAU,SAAI;IACd,YAAY,SAAI;IAChB,cAAc,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAK;IAChD,eAAe,SAAI;IACnB,aAAa,yBAA+B;IACnD,OAAO,CAAC,UAAU,CAA8B;IAChD,OAAO,CAAC,OAAO,CAA8B;IAC7C,OAAO,CAAC,UAAU,CAA6B;IAC/C,OAAO,CAAC,YAAY,CAAwB;IAC5C,OAAO,CAAC,eAAe,CAAmD;IAC1E,OAAO,CAAC,mBAAmB,CAAqB;IACzC,cAAc,WAAiB;IAC/B,WAAW,EAAE,GAAG,CAAO;IAEvB,eAAe,YAAiB,IAAI,EAAG;IAGvC,YAAY,CAAC,OAAO,EAAE,MAAM,IAAI,GAAG,IAAI;gBAIlC,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,mBAAmB,CAAA;KAAE;IAI/C,cAAc,CAAC,MAAM,EAAE,GAAG,GAAG,IAAI;IAWjC,QAAQ,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,OAAO,CAAC;QAAC,EAAE,CAAC,EAAE,OAAO,CAAC;QAAC,OAAO,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,IAAI;IAIhH,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC;IA2BxB,YAAY,IAAI,IAAI;IAyE3B,OAAO,CAAC,GAAG;IAMJ,MAAM,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,CAAC,EAAE,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAIhF,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC;IAK1D,MAAM,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,SAAS,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,IAAI;IAInE,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC;IAI1B,QAAQ,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,CAAC;IAIvD,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;IAK1E,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC;IAuC7C,OAAO,CAAC,KAAK;IAoBN,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,EACzB,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,KAAK,OAAO,CAAC,CAAC,CAAC,EACvD,MAAM,CAAC,EAAE;QAAE,KAAK,EAAE,CAAC,CAAA;KAAE,EACrB,aAAa,CAAC,EAAE,MAAM,GAAG,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,GAC7C,QAAQ,CAAC,CAAC,CAAC;CAgLf;AAED,OAAO,EAAE,kBAAkB,IAAI,cAAc,EAAE,kBAAkB,IAAI,uBAAuB,EAAE,CAAA"}
+{"version":3,"file":"core.d.ts","sourceRoot":"","sources":["../../src/core/core.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAW,mBAAmB,EAAE,YAAY,EAAE,SAAS,EAAiC,aAAa,EAAE,eAAe,EAAiB,QAAQ,EAAE,MAAM,SAAS,CAAA;AAUzL,KAAK,WAAW,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;AAE/C,KAAK,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAA;AAEpC,KAAK,cAAc,CAAC,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,CAAA;AAuBtE,wBAAgB,QAAQ,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;IAAE,IAAI,CAAC,EAAE,OAAO,CAAC;IAAC,EAAE,CAAC,EAAE,OAAO,CAAC;IAAC,OAAO,CAAC,EAAE,OAAO,CAAA;CAAE,GAAG,IAAI,CAM/H;AACD,wBAAgB,SAAS,IAAI,IAAI,CA8BhC;AACD,qBAAa,kBAAkB;IAC7B,SAAS,CAAC,eAAe,SAAS;IAClC,OAAO,CAAC,MAAM,CAAqB;IAC5B,KAAK,SAAI;IACT,cAAc,EAAE,GAAG,CAAO;IAC1B,UAAU,SAAI;IACd,YAAY,SAAI;IAChB,cAAc,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAK;IAChD,eAAe,SAAI;IACnB,aAAa,yBAA+B;IACnD,OAAO,CAAC,UAAU,CAA8B;IAChD,OAAO,CAAC,OAAO,CAA8B;IAC7C,OAAO,CAAC,UAAU,CAA6B;IAC/C,OAAO,CAAC,YAAY,CAAwB;IAC5C,OAAO,CAAC,eAAe,CAAmD;IAC1E,OAAO,CAAC,mBAAmB,CAAqB;IACzC,cAAc,WAAiB;IAC/B,WAAW,EAAE,GAAG,CAAO;IAEvB,eAAe,YAAiB,IAAI,EAAG;IAGvC,YAAY,CAAC,OAAO,EAAE,MAAM,IAAI,GAAG,IAAI;gBAIlC,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,mBAAmB,CAAA;KAAE;IAI/C,cAAc,CAAC,MAAM,EAAE,GAAG,GAAG,IAAI;IAWjC,QAAQ,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,OAAO,CAAC;QAAC,EAAE,CAAC,EAAE,OAAO,CAAC;QAAC,OAAO,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,IAAI;IAIhH,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC;IA0BxB,YAAY,IAAI,IAAI;IAyE3B,OAAO,CAAC,GAAG;IAMJ,MAAM,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,CAAC,EAAE,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAIhF,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC;IAK1D,MAAM,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,SAAS,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,IAAI;IAInE,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC;IAI1B,QAAQ,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,CAAC;IAIvD,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;IAK1E,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC;IAuC7C,OAAO,CAAC,KAAK;IAoBN,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,EACzB,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,KAAK,OAAO,CAAC,CAAC,CAAC,EACvD,MAAM,CAAC,EAAE;QAAE,KAAK,EAAE,CAAC,CAAA;KAAE,EACrB,aAAa,CAAC,EAAE,MAAM,GAAG,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,GAC7C,QAAQ,CAAC,CAAC,CAAC;CAgLf;AAED,OAAO,EAAE,kBAAkB,IAAI,cAAc,EAAE,kBAAkB,IAAI,uBAAuB,EAAE,CAAA"}

package/dist/core/core.method.computed.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"core.method.computed.d.ts","sourceRoot":"","sources":["../../src/core/core.method.computed.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAa,MAAM,SAAS,CAAA;AAE7C,wBAAgB,cAAc,CAAC,CAAC,EAC9B,MAAM,EAAE,GAAG,EACX,EAAE,EAAE,MAAM,CAAC,EACX,UAAU,CAAC,EAAE,MAAM,GAClB,QAAQ,CAAC,CAAC,CAAC,CAwSb"}
+{"version":3,"file":"core.method.computed.d.ts","sourceRoot":"","sources":["../../src/core/core.method.computed.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAa,MAAM,SAAS,CAAA;AAE7C,wBAAgB,cAAc,CAAC,CAAC,EAC9B,MAAM,EAAE,GAAG,EACX,EAAE,EAAE,MAAM,CAAC,EACX,UAAU,CAAC,EAAE,MAAM,GAClB,QAAQ,CAAC,CAAC,CAAC,CA0Tb"}

package/dist/core.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"core.cjs","names":[],"sources":["../src/core/core.ts"],"sourcesContent":["import { getExtractedValues } from '../utils/getExtractedValues'\nimport { Signal, Computed, IEffect, EngineLoggerOptions, LogEventType, CleanupFn, TransactionContext, LogRecord, SignalOptions, ResourceOptions, ResourceState, Resource } from './types'\nimport { createComputed } from './core.method.computed'\nimport { createSignal } from './core.method.signal'\n// import { executeBatch } from './core.method.batch'\nimport { executeUntrack } from './core.method.untrack'\nimport { createReactive } from './core.method.reactive'\nimport { createEffect } from './core.method.effect'\nimport { ReactiveDebounceLogger } from './core.logger'\n\n// Тип для конструктора класса\ntype Constructor<T> = new (...args: any[]) => T\n// Тип для фабричной функции зависимостей\ntype Factory<T> = (engine: any) => T\n// Универсальный тип токена DI\ntype InjectionToken<T> = Constructor<T> | Factory<T> | symbol | string\n\nconst badgeColors: Record<LogEventType, string> = {\n  signal: 'background: #007acc; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n  computed: 'background: #42b883; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n  effect: 'background: #e01e5a; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n  batch: 'background: #7952b3; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n  resource: 'background: #d97706; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n  reactive: 'background: #007acc; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;'\n}\nlet currentTransaction: TransactionContext | null = null\nfunction safeValueToString(value: unknown): string {\n  if (value === null) return 'null'\n  if (value === undefined) return 'undefined'\n  if (typeof value === 'object') {\n    try {\n      return JSON.stringify(value)\n    } catch (e) {\n      return '[Cyclic Object or Layer]'\n    }\n  }\n  return String(value)\n}\nexport function queueLog(type: LogEventType, label: string, details?: { from?: unknown; to?: unknown; payload?: unknown }): void {\n  if (!currentTransaction) {\n    currentTransaction = { id: Math.random().toString(36).substring(2, 9), pendingLogQueue: [], isFlushing: false }\n    queueMicrotask(() => flushLogs())\n  }\n  currentTransaction.pendingLogQueue.push({ type, label, from: details?.from, to: details?.to, payload: details?.payload, timestamp: Date.now() })\n}\nexport function flushLogs(): void {\n  if (!currentTransaction || currentTransaction.isFlushing) return\n  currentTransaction.isFlushing = true\n  const queue = currentTransaction.pendingLogQueue\n  if (queue.length === 0) {\n    currentTransaction = null\n    return\n  }\n  console.groupCollapsed(`%cREACTIVE TRANSACTION%c [id: ${currentTransaction.id}] (${queue.length} operations)`, 'background: #7952b3; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;', 'color: #888; font-weight: normal;')\n  for (const record of queue) {\n    const colorStyle = badgeColors[record.type]\n    const hasTransition = record.from !== undefined || record.to !== undefined\n    let logMessage = `%c${record.type.toUpperCase()}%c ${record.label}`\n\n    if (hasTransition) {\n      if (!!record.from)\n        logMessage += ` ${safeValueToString(record.from)} → ${safeValueToString(record.to)}`\n      else logMessage += ` (${safeValueToString(record.to)})`\n    }\n\n    if (record.payload !== undefined) {\n      console.groupCollapsed(logMessage, colorStyle, 'color: inherit;')\n      console.log('Payload:', record.payload)\n      console.groupEnd()\n    } else {\n      console.log(logMessage, colorStyle, 'color: inherit;')\n    }\n  }\n  console.groupEnd()\n  currentTransaction = null\n}\nexport class ReactiveEngineCore {\n  protected frameworkPrefix = 'core'\n  private logger: EngineLoggerOptions\n  public epoch = 0\n  public activeConsumer: any = null\n  public batchDepth = 0\n  public subscriberId = 0\n  public pendingEffects: Array<Set<any> | undefined> = []\n  public maxPendingDepth = 0\n  public computedCache = new WeakMap<Function, any>()\n  private diRegistry = new Map<unknown, unknown>()\n  private diCache = new Map<unknown, unknown>()\n  private proxyCache = new WeakMap<object, any>()\n  private proxyTargets = new WeakSet<object>()\n  private reactiveSignals = new WeakMap<object, Map<string | symbol, any>>()\n  private cycleDetectionStack = new Set<unknown>()\n  public batchedSignals = new Set<any>()\n  public activeOwner: any = null\n  // Системная очередь для отложенного батчинга деструкторов\n  public pendingCleanups = new Set<() => void>()\n\n  // Метод для регистрации отложенной очистки\n  public queueCleanup(cleanup: () => void): void {\n    this.pendingCleanups.add(cleanup)\n  }\n\n  constructor(options?: { logger?: EngineLoggerOptions }) {\n    this.logger = options?.logger || { isEnabled: false }\n  }\n\n  public scheduleEffect(effect: any): void {\n    const depth = effect.depth || 0\n    if (!this.pendingEffects[depth]) {\n      this.pendingEffects[depth] = new Set()\n    }\n    this.pendingEffects[depth]!.add(effect)\n    if (depth > this.maxPendingDepth) {\n      this.maxPendingDepth = depth\n    }\n  }\n\n  public queueLog(type: LogEventType, label: string, details?: { from?: unknown; to?: unknown; payload?: unknown }): void {\n    queueLog(type, label, details)\n  }\n\n  public batch<T>(fn: () => T): T {\n    this.batchDepth++\n    try {\n      return fn()\n    } finally {\n      this.batchDepth--\n      if (this.batchDepth === 0) {\n        if (this.batchedSignals.size > 0) {\n          for (const sig of this.batchedSignals) {\n            if (sig._flushBatch) sig._flushBatch()\n          }\n          this.batchedSignals.clear()\n        }\n\n        this.flushEffects()\n\n        // ⚡ ЭКСТРЕМЕЛЬНЫЙ ПЕРФОРМАНС-БАЙПАС:\n        // После завершения батча полностью уничтожаем временный строковый кэш,\n        // предотвращая утечки памяти и ложное переиспользование между тестами!\n        if ((this as any).batchComputedCache) {\n          (this as any).batchComputedCache.clear();\n          (this as any).batchComputedCache = null\n        }\n      }\n    }\n  }\n\n  public flushEffects(): void {\n    if (this.batchDepth > 0) return\n\n    const prevConsumer = this.activeConsumer\n\n    try {\n      for (let depth = 0; depth <= this.maxPendingDepth; depth++) {\n        const bucket = this.pendingEffects[depth]\n\n        if (!bucket || bucket.size === 0) continue\n\n        const effects = Array.from(bucket)\n        bucket.clear()\n\n        for (const effect of effects) {\n          if (effect.isDisposed) continue\n\n          // ⚡ ЗOЛОТOЙ СТАНДАРТ ОПТИМИЗАЦИИ (Early Dirty Check Bypass):\n          // Переносим проверку грязи в самое начало цикла. Если эффект не был промаркирован\n          // как DIRTY волной push-уведомлений, мы мгновенно пропускаем его, полностью\n          // избавляя V8 от холостого обхода родителей и тяжелых хэш-поисков depVersions.get(dep).\n          if (!effect.isDirty) continue\n\n          if (effect.dependencies && effect.dependencies.size > 0) {\n            let parentChanged = false\n\n            for (const dep of effect.dependencies) {\n              const rawNode = dep._node || dep\n\n              if (rawNode.type === 'computed' && rawNode.state > 0) {\n                if (rawNode.update) rawNode.update()\n              }\n\n              if (effect.depVersions && effect.depVersions.get(dep) !== rawNode.version) {\n                parentChanged = true\n              }\n            }\n\n            if (!parentChanged && effect.dependencies.size > 0) {\n              effect.isDirty = false\n              continue\n            }\n          }\n\n          // Оригинальная проверка снизу убирается, так как она теперь стоит сверху\n          try {\n            effect.run()\n          } catch (err) {\n            throw err\n          }\n        }\n\n        if (depth > 0) {\n          let hasEarlierEffects = false\n          for (let i = 0; i < depth; i++) {\n            if (this.pendingEffects[i] && this.pendingEffects[i]!.size > 0) {\n              hasEarlierEffects = true\n              break\n            }\n          }\n          if (hasEarlierEffects) depth = -1\n        }\n      }\n      this.maxPendingDepth = 0\n    } finally {\n      this.activeConsumer = prevConsumer\n    }\n  }\n\n  // public batch<T>(fn: () => T): T {\n  //   return executeBatch<T>(this, fn)\n  // }\n\n  private log (params: any) {\n    if (!this.logger || !this.logger.isEnabled) return\n\n    ReactiveDebounceLogger.processLog(this.logger, queueLog, params)\n  }\n\n  public signal<T>(initialValue: T, optionsOrName?: string | SignalOptions<T>): Signal<T> {\n    return createSignal<T>(this, initialValue, optionsOrName)\n  }\n\n  public computed<T>(fn: () => T, signalName?: string): Computed<T> {\n    // Просто делегируем вызов строго изолированной чистой функции\n    return createComputed<T>(this, fn, signalName)\n  }\n\n  public effect(fn: () => void | CleanupFn, effectName?: string): () => void {\n    return createEffect(this, fn, effectName)\n  }\n\n  public untrack<T>(fn: () => T): T {\n    return executeUntrack<T>(this, fn)\n  }\n\n  public reactive<T extends object>(target: T, name?: string): T {\n    return createReactive<T>(this, target, name)\n  }\n\n  public provide<T>(token: InjectionToken<T>, valueOrFactory: T | Factory<T>): void {\n    this.diRegistry.set(token, valueOrFactory)\n    this.diCache.delete(token)\n  }\n\n  public inject<T>(token: InjectionToken<T>): T {\n    if (token === undefined || token === null) throw new Error('[DI Error] Token is empty')\n    if (this.diCache.has(token)) return this.diCache.get(token) as T\n    if (this.cycleDetectionStack.has(token)) throw new Error('[DI Error] Cyclic dependency detected')\n    this.cycleDetectionStack.add(token)\n    try {\n      if (this.diRegistry.has(token)) {\n        const entry = this.diRegistry.get(token)\n        if (typeof entry === 'function') {\n          if ((entry as any)._isMockFunction) {\n            const mockRes = (entry as Function)(this)\n            if (mockRes !== undefined) {\n              this.diCache.set(token, mockRes)\n              return mockRes as T\n            }\n            return entry as unknown as T\n          }\n          const str = entry.toString()\n          const isClass = str.startsWith('class ') || str.startsWith('class{') || (entry.prototype && entry.prototype.constructor === entry && !str.startsWith('function') && !str.includes('=>'))\n          if (!isClass) {\n            const resolved = (entry as Factory<T>)(this)\n            this.diCache.set(token, resolved)\n            return resolved\n          }\n          return entry as unknown as T\n        }\n        return entry as T\n      }\n      if (typeof token === 'function') {\n        const resolved = new (token as Constructor<T>)(this)\n        this.diCache.set(token, resolved)\n        return resolved\n      }\n      throw new Error('[DI Error] Token not found')\n    } finally {\n      this.cycleDetectionStack.delete(token)\n    }\n  }\n\n  private delay(ms: number, signal: AbortSignal): Promise<void> {\n    return new Promise((resolve, reject) => {\n      if (signal.aborted) {\n        return reject(new DOMException('Aborted', 'AbortError'))\n      }\n\n      const timeoutId = setTimeout(() => {\n        signal.removeEventListener('abort', onAbort)\n        resolve()\n      }, ms)\n\n      const onAbort = () => {\n        clearTimeout(timeoutId)\n        reject(new DOMException('Aborted', 'AbortError'))\n      }\n\n      signal.addEventListener('abort', onAbort, { once: true })\n    })\n  }\n\n  public resource<T, S = void>(\n    fetcher: (source: S, signal: AbortSignal) => Promise<T>,\n    source?: { value: S },\n    optionsOrName?: string | ResourceOptions<T, S>,\n  ): Resource<T> {\n    const isOptionsObject = optionsOrName && typeof optionsOrName === 'object'\n    const resourceSignalName = isOptionsObject\n      ? ((optionsOrName as ResourceOptions<T, S>).name || 'unnamed_resource')\n      : (optionsOrName as string) || 'unnamed_resource'\n\n    const options: Partial<ResourceOptions<T, S>> = isOptionsObject\n      ? (optionsOrName as ResourceOptions<T, S>)\n      : {}\n\n    const resetDataOnSourceChange = options.resetDataOnSourceChange ?? true\n    const responseValidate = options.responseValidate\n    const validateBeforeFetch = options.validateBeforeFetch\n    const retryCount = 0\n    const baseDelay = 1000\n    const useExponential = true\n    const maxRetryDelay = 1000 * 60 * 5\n    const timeoutMs = 1000\n    const state = this.signal<ResourceState<T>>(\n      { data: null, loading: true, error: null, isRetrying: false },\n      `[CORE_INTERNAL_SIGNAL=1]:resource:state:${resourceSignalName}`\n    )\n\n    const updateResourceState = (nextState: ResourceState<T>) => {\n      this.log({ type: 'resource', label: resourceSignalName, details: { to: nextState, from: state.value } })\n      state.value = nextState\n    }\n\n    const load = async (sValue: S, effectSignal: AbortSignal, isSourceChange = false) => {\n      if (effectSignal.aborted) return\n      const isValid = options.validateBeforeFetch ? options.validateBeforeFetch(sValue) : true\n\n      /**\n       * 🧐 WIP_CORE: Есть два пути, ни один не будет ошибкой, если разкомментировать код ниже. Чуть бозже добавлю опци для более тонкой отладки ядра.\n       *\n       * - АКТИВНО: Разделяем мирную блокировку (false) и боевую ошибку (string): работать будет идеально, но без логов, связанных с пре-валидацией\n       * - НЕАКТИВНО: Более очевидное логирование процессов пре-валидации (выставление ошибок и мониторинг разработчиком)\n      */\n      // --\n      // if (isValid === false) {\n      //   // Если валидатор вернул строго false — мы тихо блокируем старт фетчера,\n      //   // переводя ресурс в состояние ПОКОЯ (loading: false, error: null).\n      //   // Это полностью ликвидирует генерацию ложных ошибок при монтировании!\n      //   state.value = {\n      //     loading: false,\n      //     data: null,\n      //     error: null, // Ошибки нет! Стейт стабилен.\n      //     isRetrying: false\n      //   }\n      //   return\n      // }\n      // if (typeof isValid === 'string') {\n      //   // Если валидатор вернул строку — это боевая декларативная ошибка валидации формы.\n      //   // Здесь мы честно переводим ресурс в стейт ошибки, как и требовалось ранее.\n      //   state.value = {\n      //     loading: false,\n      //     data: null,\n      //     error: 'Core internal stopper',\n      //     isRetrying: false\n      //   }\n      //   return\n      // }\n      // --\n      if (validateBeforeFetch) {\n        const preValidationResult = validateBeforeFetch(sValue)\n        if (preValidationResult === false || typeof preValidationResult === 'string') {\n          if (effectSignal.aborted) return\n          const errorMsg = typeof preValidationResult === 'string'\n            ? preValidationResult\n            : 'Pre-fetch validation failed for resource'\n\n          const currentData = isSourceChange ? null : this.untrack(() => state.value.data)\n          updateResourceState({ data: currentData, loading: false, error: errorMsg, isRetrying: false })\n          return\n        }\n      }\n      const shouldClear = isSourceChange && resetDataOnSourceChange\n      const currentData = shouldClear ? null : this.untrack(() => state.value.data)\n      updateResourceState({ data: currentData, loading: true, error: null, isRetrying: false })\n      for (let attempt = 0; attempt <= retryCount; attempt++) {\n        if (effectSignal.aborted) return\n        let combinedSignal = effectSignal\n        try {\n          const data = await fetcher(sValue, combinedSignal)\n          if (effectSignal.aborted) return\n          if (combinedSignal.aborted) {\n            throw new DOMException('The operation timed out.', 'TimeoutError')\n          }\n          if (responseValidate) {\n            const validationResult = responseValidate(data)\n            if (validationResult === false || typeof validationResult === 'string') {\n              if (effectSignal.aborted) return\n              const errorMsg = typeof validationResult === 'string' ? validationResult : 'Validation failed'\n              updateResourceState({ data: null, loading: false, error: errorMsg, isRetrying: false })\n              return\n            }\n          }\n          if (effectSignal.aborted) return\n          updateResourceState({ data, loading: false, error: null, isRetrying: false })\n          return\n        } catch (e: unknown) {\n          if (effectSignal.aborted || ((e as Error).name === 'AbortError' && effectSignal.aborted)) return\n          const isTimeout = (e as Error).name === 'TimeoutError' || (e as Error).name === 'AbortError' || (e as Error).message?.includes('timeout')\n          const isCustomValidationError = getExtractedValues({\n            tested: [(e as Error).message], expectedKey: 'THROW_CUSTOM_VALIDATION_ERROR_NO_RETRY', valueType: 'number',\n          })?.[0] === '1' || false\n          const __defaultCustomValidationErrorMessage = 'Custom validation error'\n          let customValidationErrorMessage: string = isCustomValidationError\n            ? (getExtractedValues({\n              tested: [(e as Error).message], expectedKey: 'MESSAGE', valueType: 'string',\n            })?.[0] || __defaultCustomValidationErrorMessage)\n            : __defaultCustomValidationErrorMessage\n          const isFetchBodyValidationError = isCustomValidationError || (e as Error).name === 'ValidationError'\n          if (attempt === retryCount || isFetchBodyValidationError) {\n            if (effectSignal.aborted) return\n            const finalError = isTimeout\n              ? new Error(`Request timed out after ${timeoutMs}ms`, { cause: e })\n              : isCustomValidationError\n                ? new Error(customValidationErrorMessage, { cause: e })\n                : e\n\n            updateResourceState({\n              data: null, loading: false,\n              error: finalError instanceof Error ? finalError.message : typeof finalError === 'string' ? finalError : `typeof finalError is ${typeof finalError}`,\n              isRetrying: false,\n            })\n            return\n          } else {\n            if (effectSignal.aborted) return\n            let currentDelay = useExponential ? baseDelay * Math.pow(2, attempt) : baseDelay\n            currentDelay = Math.min(currentDelay, maxRetryDelay)\n            const jitter = Math.random() * 200\n            currentDelay = currentDelay + jitter\n            updateResourceState({ data: state.value.data, loading: true, error: null, isRetrying: true })\n            const logReason = isTimeout ? 'таймауту' : 'ошибке сети'\n            console.warn(`[Resource Retry] \"${resourceSignalName}\" сбой по ${logReason}. Попытка ${attempt + 1}/${retryCount > 0 ? retryCount + 1 : attempt + 1}...`)\n\n            try {\n              await this.delay(currentDelay, effectSignal)\n              if (effectSignal.aborted) return\n            } catch (delayError) {\n              return\n            }\n          }\n        }\n      }\n    }\n\n    let activeEffectController: AbortController | null = null\n\n    this.effect(() => {\n      const sValue = source ? source.value : undefined as S\n      const effectController = new AbortController()\n      activeEffectController = effectController\n\n      this.untrack(() => {\n        load(sValue as S, effectController.signal, true)\n      })\n\n      return () => effectController.abort()\n    }, '[CORE_INTERNAL_SIGNAL=1]:effect')\n\n    return {\n      get data() { return state.value.data },\n      get loading() { return state.value.loading },\n      get error() { return state.value.error },\n      get isRetrying() { return state.value.isRetrying },\n      get value() { return state.value },\n      refetch: () => {\n        activeEffectController?.abort()\n        activeEffectController = new AbortController()\n        load(source ? source.value : undefined as S, activeEffectController.signal, false)\n      },\n      subscribe: (cb: (val: ResourceState<T>) => void) => state.subscribe(cb)\n    }\n  }\n}\n\nexport { ReactiveEngineCore as ReactiveEngine, ReactiveEngineCore as ReactiveEngineAutomatic }\n"],"mappings":"oRAiBA,IAAM,EAA4C,CAChD,OAAQ,6FACR,SAAU,6FACV,OAAQ,6FACR,MAAO,6FACP,SAAU,6FACV,SAAU,4FACZ,EACI,EAAgD,KACpD,SAAS,EAAkB,EAAwB,CACjD,GAAI,IAAU,KAAM,MAAO,OAC3B,GAAI,IAAU,IAAA,GAAW,MAAO,YAChC,GAAI,OAAO,GAAU,SACnB,GAAI,CACF,OAAO,KAAK,UAAU,CAAK,CAC7B,MAAY,CACV,MAAO,0BACT,CAEF,OAAO,OAAO,CAAK,CACrB,CACA,SAAgB,EAAS,EAAoB,EAAe,EAAqE,CAC1H,IACH,EAAqB,CAAE,GAAI,KAAK,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,UAAU,EAAG,CAAC,EAAG,gBAAiB,CAAC,EAAG,WAAY,EAAM,EAC9G,mBAAqB,EAAU,CAAC,GAElC,EAAmB,gBAAgB,KAAK,CAAE,OAAM,QAAO,KAAM,GAAS,KAAM,GAAI,GAAS,GAAI,QAAS,GAAS,QAAS,UAAW,KAAK,IAAI,CAAE,CAAC,CACjJ,CACA,SAAgB,GAAkB,CAChC,GAAI,CAAC,GAAsB,EAAmB,WAAY,OAC1D,EAAmB,WAAa,GAChC,IAAM,EAAQ,EAAmB,gBACjC,GAAI,EAAM,SAAW,EAAG,CACtB,EAAqB,KACrB,MACF,CACA,QAAQ,eAAe,iCAAiC,EAAmB,GAAG,KAAK,EAAM,OAAO,cAAe,6FAA8F,mCAAmC,EAChP,IAAK,IAAM,KAAU,EAAO,CAC1B,IAAM,EAAa,EAAY,EAAO,MAChC,EAAgB,EAAO,OAAS,IAAA,IAAa,EAAO,KAAO,IAAA,GAC7D,EAAa,KAAK,EAAO,KAAK,YAAY,EAAE,KAAK,EAAO,QAExD,IACI,EAAO,KACX,GAAc,IAAI,EAAkB,EAAO,IAAI,EAAE,KAAK,EAAkB,EAAO,EAAE,IAC9E,GAAc,KAAK,EAAkB,EAAO,EAAE,EAAE,IAGnD,EAAO,UAAY,IAAA,GAKrB,QAAQ,IAAI,EAAY,EAAY,iBAAiB,GAJrD,QAAQ,eAAe,EAAY,EAAY,iBAAiB,EAChE,QAAQ,IAAI,WAAY,EAAO,OAAO,EACtC,QAAQ,SAAS,EAIrB,CACA,QAAQ,SAAS,EACjB,EAAqB,IACvB,CACA,IAAa,EAAb,KAAgC,CAC9B,gBAA4B,OAC5B,OACA,MAAe,EACf,eAA6B,KAC7B,WAAoB,EACpB,aAAsB,EACtB,eAAqD,CAAC,EACtD,gBAAyB,EACzB,cAAuB,IAAI,QAC3B,WAAqB,IAAI,IACzB,QAAkB,IAAI,IACtB,WAAqB,IAAI,QACzB,aAAuB,IAAI,QAC3B,gBAA0B,IAAI,QAC9B,oBAA8B,IAAI,IAClC,eAAwB,IAAI,IAC5B,YAA0B,KAE1B,gBAAyB,IAAI,IAG7B,aAAoB,EAA2B,CAC7C,KAAK,gBAAgB,IAAI,CAAO,CAClC,CAEA,YAAY,EAA4C,CACtD,KAAK,OAAS,GAAS,QAAU,CAAE,UAAW,EAAM,CACtD,CAEA,eAAsB,EAAmB,CACvC,IAAM,EAAQ,EAAO,OAAS,EACzB,KAAK,eAAe,KACvB,KAAK,eAAe,GAAS,IAAI,KAEnC,KAAK,eAAe,EAAM,CAAE,IAAI,CAAM,EAClC,EAAQ,KAAK,kBACf,KAAK,gBAAkB,EAE3B,CAEA,SAAgB,EAAoB,EAAe,EAAqE,CACtH,EAAS,EAAM,EAAO,CAAO,CAC/B,CAEA,MAAgB,EAAgB,CAC9B,KAAK,aACL,GAAI,CACF,OAAO,EAAG,CACZ,QAAU,CAER,GADA,KAAK,aACD,KAAK,aAAe,EAAG,CACzB,GAAI,KAAK,eAAe,KAAO,EAAG,CAChC,IAAK,IAAM,KAAO,KAAK,eACjB,EAAI,aAAa,EAAI,YAAY,EAEvC,KAAK,eAAe,MAAM,CAC5B,CAEA,KAAK,aAAa,EAKlB,AAEE,KAAc,sBADd,KAAc,mBAAmB,MAAM,EACJ,KAEvC,CACF,CACF,CAEA,cAA4B,CAC1B,GAAI,KAAK,WAAa,EAAG,OAEzB,IAAM,EAAe,KAAK,eAE1B,GAAI,CACF,IAAK,IAAI,EAAQ,EAAG,GAAS,KAAK,gBAAiB,IAAS,CAC1D,IAAM,EAAS,KAAK,eAAe,GAEnC,GAAI,CAAC,GAAU,EAAO,OAAS,EAAG,SAElC,IAAM,EAAU,MAAM,KAAK,CAAM,EACjC,EAAO,MAAM,EAEb,IAAK,IAAM,KAAU,EACf,MAAO,YAMN,EAAO,QAEZ,IAAI,EAAO,cAAgB,EAAO,aAAa,KAAO,EAAG,CACvD,IAAI,EAAgB,GAEpB,IAAK,IAAM,KAAO,EAAO,aAAc,CACrC,IAAM,EAAU,EAAI,OAAS,EAEzB,EAAQ,OAAS,YAAc,EAAQ,MAAQ,GAC7C,EAAQ,QAAQ,EAAQ,OAAO,EAGjC,EAAO,aAAe,EAAO,YAAY,IAAI,CAAG,IAAM,EAAQ,UAChE,EAAgB,GAEpB,CAEA,GAAI,CAAC,GAAiB,EAAO,aAAa,KAAO,EAAG,CAClD,EAAO,QAAU,GACjB,QACF,CACF,CAGA,GAAI,CACF,EAAO,IAAI,CACb,OAAS,EAAK,CACZ,MAAM,CACR,CAPA,CAUF,GAAI,EAAQ,EAAG,CACb,IAAI,EAAoB,GACxB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,IACzB,GAAI,KAAK,eAAe,IAAM,KAAK,eAAe,EAAE,CAAE,KAAO,EAAG,CAC9D,EAAoB,GACpB,KACF,CAEE,IAAmB,EAAQ,GACjC,CACF,CACA,KAAK,gBAAkB,CACzB,QAAU,CACR,KAAK,eAAiB,CACxB,CACF,CAMA,IAAa,EAAa,CACpB,CAAC,KAAK,QAAU,CAAC,KAAK,OAAO,WAEjC,EAAA,uBAAuB,WAAW,KAAK,OAAQ,EAAU,CAAM,CACjE,CAEA,OAAiB,EAAiB,EAAsD,CACtF,OAAO,EAAA,aAAgB,KAAM,EAAc,CAAa,CAC1D,CAEA,SAAmB,EAAa,EAAkC,CAEhE,OAAO,EAAA,eAAkB,KAAM,EAAI,CAAU,CAC/C,CAEA,OAAc,EAA4B,EAAiC,CACzE,OAAO,EAAA,aAAa,KAAM,EAAI,CAAU,CAC1C,CAEA,QAAkB,EAAgB,CAChC,OAAO,EAAA,eAAkB,KAAM,CAAE,CACnC,CAEA,SAAkC,EAAW,EAAkB,CAC7D,OAAO,EAAA,eAAkB,KAAM,EAAQ,CAAI,CAC7C,CAEA,QAAkB,EAA0B,EAAsC,CAChF,KAAK,WAAW,IAAI,EAAO,CAAc,EACzC,KAAK,QAAQ,OAAO,CAAK,CAC3B,CAEA,OAAiB,EAA6B,CAC5C,GAAI,GAAiC,KAAM,MAAU,MAAM,2BAA2B,EACtF,GAAI,KAAK,QAAQ,IAAI,CAAK,EAAG,OAAO,KAAK,QAAQ,IAAI,CAAK,EAC1D,GAAI,KAAK,oBAAoB,IAAI,CAAK,EAAG,MAAU,MAAM,uCAAuC,EAChG,KAAK,oBAAoB,IAAI,CAAK,EAClC,GAAI,CACF,GAAI,KAAK,WAAW,IAAI,CAAK,EAAG,CAC9B,IAAM,EAAQ,KAAK,WAAW,IAAI,CAAK,EACvC,GAAI,OAAO,GAAU,WAAY,CAC/B,GAAK,EAAc,gBAAiB,CAClC,IAAM,EAAW,EAAmB,IAAI,EAKxC,OAJI,IAAY,IAAA,GAIT,GAHL,KAAK,QAAQ,IAAI,EAAO,CAAO,EACxB,EAGX,CACA,IAAM,EAAM,EAAM,SAAS,EAE3B,GAAI,EADY,EAAI,WAAW,QAAQ,GAAK,EAAI,WAAW,QAAQ,GAAM,EAAM,WAAa,EAAM,UAAU,cAAgB,GAAS,CAAC,EAAI,WAAW,UAAU,GAAK,CAAC,EAAI,SAAS,IAAI,GACxK,CACZ,IAAM,EAAY,EAAqB,IAAI,EAE3C,OADA,KAAK,QAAQ,IAAI,EAAO,CAAQ,EACzB,CACT,CACA,OAAO,CACT,CACA,OAAO,CACT,CACA,GAAI,OAAO,GAAU,WAAY,CAC/B,IAAM,EAAW,IAAK,EAAyB,IAAI,EAEnD,OADA,KAAK,QAAQ,IAAI,EAAO,CAAQ,EACzB,CACT,CACA,MAAU,MAAM,4BAA4B,CAC9C,QAAU,CACR,KAAK,oBAAoB,OAAO,CAAK,CACvC,CACF,CAEA,MAAc,EAAY,EAAoC,CAC5D,OAAO,IAAI,SAAS,EAAS,IAAW,CACtC,GAAI,EAAO,QACT,OAAO,EAAO,IAAI,aAAa,UAAW,YAAY,CAAC,EAGzD,IAAM,EAAY,eAAiB,CACjC,EAAO,oBAAoB,QAAS,CAAO,EAC3C,EAAQ,CACV,EAAG,CAAE,EAEC,MAAgB,CACpB,aAAa,CAAS,EACtB,EAAO,IAAI,aAAa,UAAW,YAAY,CAAC,CAClD,EAEA,EAAO,iBAAiB,QAAS,EAAS,CAAE,KAAM,EAAK,CAAC,CAC1D,CAAC,CACH,CAEA,SACE,EACA,EACA,EACa,CACb,IAAM,EAAkB,GAAiB,OAAO,GAAkB,SAC5D,EAAqB,EACrB,EAAwC,MAAQ,mBACjD,GAA4B,mBAE3B,EAA0C,EAC3C,EACD,CAAC,EAEC,EAA0B,EAAQ,yBAA2B,GAC7D,EAAmB,EAAQ,iBAC3B,EAAsB,EAAQ,oBAM9B,EAAQ,KAAK,OACjB,CAAE,KAAM,KAAM,QAAS,GAAM,MAAO,KAAM,WAAY,EAAM,EAC5D,2CAA2C,GAC7C,EAEM,EAAuB,GAAgC,CAC3D,KAAK,IAAI,CAAE,KAAM,WAAY,MAAO,EAAoB,QAAS,CAAE,GAAI,EAAW,KAAM,EAAM,KAAM,CAAE,CAAC,EACvG,EAAM,MAAQ,CAChB,EAEM,EAAO,MAAO,EAAW,EAA2B,EAAiB,KAAU,CACnF,GAAI,EAAa,QAAS,OAkC1B,GAjCgB,EAAQ,qBAAsB,EAAQ,oBAAoB,CAAM,EAiC5E,EAAqB,CACvB,IAAM,EAAsB,EAAoB,CAAM,EACtD,GAAI,IAAwB,IAAS,OAAO,GAAwB,SAAU,CAC5E,GAAI,EAAa,QAAS,OAC1B,IAAM,EAAW,OAAO,GAAwB,SAC5C,EACA,2CAEE,EAAc,EAAiB,KAAO,KAAK,YAAc,EAAM,MAAM,IAAI,EAC/E,EAAoB,CAAE,KAAM,EAAa,QAAS,GAAO,MAAO,EAAU,WAAY,EAAM,CAAC,EAC7F,MACF,CACF,CAEA,IAAM,EADc,GAAkB,EACJ,KAAO,KAAK,YAAc,EAAM,MAAM,IAAI,EAC5E,EAAoB,CAAE,KAAM,EAAa,QAAS,GAAM,MAAO,KAAM,WAAY,EAAM,CAAC,EACxF,IAAK,IAAI,EAAU,EAAG,GAAW,EAAY,IAAW,CACtD,GAAI,EAAa,QAAS,OAC1B,IAAI,EAAiB,EACrB,GAAI,CACF,IAAM,EAAO,MAAM,EAAQ,EAAQ,CAAc,EACjD,GAAI,EAAa,QAAS,OAC1B,GAAI,EAAe,QACjB,MAAM,IAAI,aAAa,2BAA4B,cAAc,EAEnE,GAAI,EAAkB,CACpB,IAAM,EAAmB,EAAiB,CAAI,EAC9C,GAAI,IAAqB,IAAS,OAAO,GAAqB,SAAU,CACtE,GAAI,EAAa,QAAS,OAE1B,EAAoB,CAAE,KAAM,KAAM,QAAS,GAAO,MADjC,OAAO,GAAqB,SAAW,EAAmB,oBACR,WAAY,EAAM,CAAC,EACtF,MACF,CACF,CACA,GAAI,EAAa,QAAS,OAC1B,EAAoB,CAAE,OAAM,QAAS,GAAO,MAAO,KAAM,WAAY,EAAM,CAAC,EAC5E,MACF,OAAS,EAAY,CACnB,GAAI,EAAa,SAAa,EAAY,OAAS,cAAgB,EAAa,QAAU,OAC1F,IAAM,EAAa,EAAY,OAAS,gBAAmB,EAAY,OAAS,cAAiB,EAAY,SAAS,SAAS,SAAS,EAClI,EAA0B,EAAA,mBAAmB,CACjD,OAAQ,CAAE,EAAY,OAAO,EAAG,YAAa,yCAA0C,UAAW,QACpG,CAAC,CAAC,GAAG,KAAO,KAAO,GAEf,EAAuC,GACtC,EAAA,mBAAmB,CACpB,OAAQ,CAAE,EAAY,OAAO,EAAG,YAAa,UAAW,UAAW,QACrE,CAAC,CAAC,GAAG,IACH,0BACE,EAA6B,GAA4B,EAAY,OAAS,kBACpF,GAAI,IAAY,GAAc,EAA4B,CACxD,GAAI,EAAa,QAAS,OAC1B,IAAM,EAAa,EACX,MAAM,iCAA0C,CAAE,MAAO,CAAE,CAAC,EAChE,EACM,MAAM,EAA8B,CAAE,MAAO,CAAE,CAAC,EACpD,EAEN,EAAoB,CAClB,KAAM,KAAM,QAAS,GACrB,MAAO,aAAsB,MAAQ,EAAW,QAAU,OAAO,GAAe,SAAW,EAAa,wBAAwB,OAAO,IACvI,WAAY,EACd,CAAC,EACD,MACF,KAAO,CACL,GAAI,EAAa,QAAS,OAC1B,IAAI,EAAgC,IAAqB,GAAG,EAC5D,EAAe,KAAK,IAAI,EAAc,GAAa,EACnD,IAAM,EAAS,KAAK,OAAO,EAAI,IAC/B,GAA8B,EAC9B,EAAoB,CAAE,KAAM,EAAM,MAAM,KAAM,QAAS,GAAM,MAAO,KAAM,WAAY,EAAK,CAAC,EAE5F,QAAQ,KAAK,qBAAqB,EAAmB,YADnC,EAAY,WAAa,cACgC,YAAY,EAAU,EAAE,GAAqC,EAAU,EAAE,IAAI,EAExJ,GAAI,CAEF,GADA,MAAM,KAAK,MAAM,EAAc,CAAY,EACvC,EAAa,QAAS,MAC5B,MAAqB,CACnB,MACF,CACF,CACF,CACF,CACF,EAEI,EAAiD,KAcrD,OAZA,KAAK,WAAa,CAChB,IAAM,EAAS,EAAS,EAAO,MAAQ,IAAA,GACjC,EAAmB,IAAI,gBAO7B,MANA,GAAyB,EAEzB,KAAK,YAAc,CACjB,EAAK,EAAa,EAAiB,OAAQ,EAAI,CACjD,CAAC,MAEY,EAAiB,MAAM,CACtC,EAAG,iCAAiC,EAE7B,CACL,IAAI,MAAO,CAAE,OAAO,EAAM,MAAM,IAAK,EACrC,IAAI,SAAU,CAAE,OAAO,EAAM,MAAM,OAAQ,EAC3C,IAAI,OAAQ,CAAE,OAAO,EAAM,MAAM,KAAM,EACvC,IAAI,YAAa,CAAE,OAAO,EAAM,MAAM,UAAW,EACjD,IAAI,OAAQ,CAAE,OAAO,EAAM,KAAM,EACjC,YAAe,CACb,GAAwB,MAAM,EAC9B,EAAyB,IAAI,gBAC7B,EAAK,EAAS,EAAO,MAAQ,IAAA,GAAgB,EAAuB,OAAQ,EAAK,CACnF,EACA,UAAY,GAAwC,EAAM,UAAU,CAAE,CACxE,CACF,CACF"}
+{"version":3,"file":"core.cjs","names":[],"sources":["../src/core/core.ts"],"sourcesContent":["import { getExtractedValues } from '../utils/getExtractedValues'\nimport { Signal, Computed, IEffect, EngineLoggerOptions, LogEventType, CleanupFn, TransactionContext, LogRecord, SignalOptions, ResourceOptions, ResourceState, Resource } from './types'\nimport { createComputed } from './core.method.computed'\nimport { createSignal } from './core.method.signal'\n// import { executeBatch } from './core.method.batch'\nimport { executeUntrack } from './core.method.untrack'\nimport { createReactive } from './core.method.reactive'\nimport { createEffect } from './core.method.effect'\nimport { ReactiveDebounceLogger } from './core.logger'\n\n// Тип для конструктора класса\ntype Constructor<T> = new (...args: any[]) => T\n// Тип для фабричной функции зависимостей\ntype Factory<T> = (engine: any) => T\n// Универсальный тип токена DI\ntype InjectionToken<T> = Constructor<T> | Factory<T> | symbol | string\n\nconst badgeColors: Record<LogEventType, string> = {\n  signal: 'background: #007acc; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n  computed: 'background: #42b883; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n  effect: 'background: #e01e5a; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n  batch: 'background: #7952b3; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n  resource: 'background: #d97706; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n  reactive: 'background: #007acc; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;'\n}\nlet currentTransaction: TransactionContext | null = null\nfunction safeValueToString(value: unknown): string {\n  if (value === null) return 'null'\n  if (value === undefined) return 'undefined'\n  if (typeof value === 'object') {\n    try {\n      return JSON.stringify(value)\n    } catch (e) {\n      return '[Cyclic Object or Layer]'\n    }\n  }\n  return String(value)\n}\nexport function queueLog(type: LogEventType, label: string, details?: { from?: unknown; to?: unknown; payload?: unknown }): void {\n  if (!currentTransaction) {\n    currentTransaction = { id: Math.random().toString(36).substring(2, 9), pendingLogQueue: [], isFlushing: false }\n    queueMicrotask(() => flushLogs())\n  }\n  currentTransaction.pendingLogQueue.push({ type, label, from: details?.from, to: details?.to, payload: details?.payload, timestamp: Date.now() })\n}\nexport function flushLogs(): void {\n  if (!currentTransaction || currentTransaction.isFlushing) return\n  currentTransaction.isFlushing = true\n  const queue = currentTransaction.pendingLogQueue\n  if (queue.length === 0) {\n    currentTransaction = null\n    return\n  }\n  console.groupCollapsed(`%cREACTIVE TRANSACTION%c [id: ${currentTransaction.id}] (${queue.length} operations)`, 'background: #7952b3; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;', 'color: #888; font-weight: normal;')\n  for (const record of queue) {\n    const colorStyle = badgeColors[record.type]\n    const hasTransition = record.from !== undefined || record.to !== undefined\n    let logMessage = `%c${record.type.toUpperCase()}%c ${record.label}`\n\n    if (hasTransition) {\n      if (!!record.from)\n        logMessage += ` ${safeValueToString(record.from)} → ${safeValueToString(record.to)}`\n      else logMessage += ` (${safeValueToString(record.to)})`\n    }\n\n    if (record.payload !== undefined) {\n      console.groupCollapsed(logMessage, colorStyle, 'color: inherit;')\n      console.log('Payload:', record.payload)\n      console.groupEnd()\n    } else {\n      console.log(logMessage, colorStyle, 'color: inherit;')\n    }\n  }\n  console.groupEnd()\n  currentTransaction = null\n}\nexport class ReactiveEngineCore {\n  protected frameworkPrefix = 'core'\n  private logger: EngineLoggerOptions\n  public epoch = 0\n  public activeConsumer: any = null\n  public batchDepth = 0\n  public subscriberId = 0\n  public pendingEffects: Array<Set<any> | undefined> = []\n  public maxPendingDepth = 0\n  public computedCache = new WeakMap<Function, any>()\n  private diRegistry = new Map<unknown, unknown>()\n  private diCache = new Map<unknown, unknown>()\n  private proxyCache = new WeakMap<object, any>()\n  private proxyTargets = new WeakSet<object>()\n  private reactiveSignals = new WeakMap<object, Map<string | symbol, any>>()\n  private cycleDetectionStack = new Set<unknown>()\n  public batchedSignals = new Set<any>()\n  public activeOwner: any = null\n  // Системная очередь для отложенного батчинга деструкторов\n  public pendingCleanups = new Set<() => void>()\n\n  // Метод для регистрации отложенной очистки\n  public queueCleanup(cleanup: () => void): void {\n    this.pendingCleanups.add(cleanup)\n  }\n\n  constructor(options?: { logger?: EngineLoggerOptions }) {\n    this.logger = options?.logger || { isEnabled: false }\n  }\n\n  public scheduleEffect(effect: any): void {\n    const depth = effect.depth || 0\n    if (!this.pendingEffects[depth]) {\n      this.pendingEffects[depth] = new Set()\n    }\n    this.pendingEffects[depth]!.add(effect)\n    if (depth > this.maxPendingDepth) {\n      this.maxPendingDepth = depth\n    }\n  }\n\n  public queueLog(type: LogEventType, label: string, details?: { from?: unknown; to?: unknown; payload?: unknown }): void {\n    queueLog(type, label, details)\n  }\n\n  public batch<T>(fn: () => T): T {\n    this.batchDepth++\n    try {\n      return fn()\n    } finally {\n      this.batchDepth--\n      if (this.batchDepth === 0) {\n        if (this.batchedSignals.size > 0) {\n          for (const sig of this.batchedSignals) {\n            if (sig._flushBatch) sig._flushBatch()\n          }\n          this.batchedSignals.clear()\n        }\n\n        this.flushEffects()\n\n        // ⚡ ЭКСТРЕМЕЛЬНЫЙ ПЕРФОРМАНС-БАЙПАС:\n        // Полностью уничтожаем временный кэш итерации, защищая тесты от коллизий строк\n        if ((this as any).batchComputedCache) {\n          (this as any).batchComputedCache.clear();\n          (this as any).batchComputedCache = null\n        }\n      }\n    }\n  }\n\n  public flushEffects(): void {\n    if (this.batchDepth > 0) return\n\n    const prevConsumer = this.activeConsumer\n\n    try {\n      for (let depth = 0; depth <= this.maxPendingDepth; depth++) {\n        const bucket = this.pendingEffects[depth]\n\n        if (!bucket || bucket.size === 0) continue\n\n        const effects = Array.from(bucket)\n        bucket.clear()\n\n        for (const effect of effects) {\n          if (effect.isDisposed) continue\n\n          // ⚡ ЗOЛОТOЙ СТАНДАРТ ОПТИМИЗАЦИИ (Early Dirty Check Bypass):\n          // Переносим проверку грязи в самое начало цикла. Если эффект не был промаркирован\n          // как DIRTY волной push-уведомлений, мы мгновенно пропускаем его, полностью\n          // избавляя V8 от холостого обхода родителей и тяжелых хэш-поисков depVersions.get(dep).\n          if (!effect.isDirty) continue\n\n          if (effect.dependencies && effect.dependencies.size > 0) {\n            let parentChanged = false\n\n            for (const dep of effect.dependencies) {\n              const rawNode = dep._node || dep\n\n              if (rawNode.type === 'computed' && rawNode.state > 0) {\n                if (rawNode.update) rawNode.update()\n              }\n\n              if (effect.depVersions && effect.depVersions.get(dep) !== rawNode.version) {\n                parentChanged = true\n              }\n            }\n\n            if (!parentChanged && effect.dependencies.size > 0) {\n              effect.isDirty = false\n              continue\n            }\n          }\n\n          // Оригинальная проверка снизу убирается, так как она теперь стоит сверху\n          try {\n            effect.run()\n          } catch (err) {\n            throw err\n          }\n        }\n\n        if (depth > 0) {\n          let hasEarlierEffects = false\n          for (let i = 0; i < depth; i++) {\n            if (this.pendingEffects[i] && this.pendingEffects[i]!.size > 0) {\n              hasEarlierEffects = true\n              break\n            }\n          }\n          if (hasEarlierEffects) depth = -1\n        }\n      }\n      this.maxPendingDepth = 0\n    } finally {\n      this.activeConsumer = prevConsumer\n    }\n  }\n\n  // public batch<T>(fn: () => T): T {\n  //   return executeBatch<T>(this, fn)\n  // }\n\n  private log (params: any) {\n    if (!this.logger || !this.logger.isEnabled) return\n\n    ReactiveDebounceLogger.processLog(this.logger, queueLog, params)\n  }\n\n  public signal<T>(initialValue: T, optionsOrName?: string | SignalOptions<T>): Signal<T> {\n    return createSignal<T>(this, initialValue, optionsOrName)\n  }\n\n  public computed<T>(fn: () => T, signalName?: string): Computed<T> {\n    // Просто делегируем вызов строго изолированной чистой функции\n    return createComputed<T>(this, fn, signalName)\n  }\n\n  public effect(fn: () => void | CleanupFn, effectName?: string): () => void {\n    return createEffect(this, fn, effectName)\n  }\n\n  public untrack<T>(fn: () => T): T {\n    return executeUntrack<T>(this, fn)\n  }\n\n  public reactive<T extends object>(target: T, name?: string): T {\n    return createReactive<T>(this, target, name)\n  }\n\n  public provide<T>(token: InjectionToken<T>, valueOrFactory: T | Factory<T>): void {\n    this.diRegistry.set(token, valueOrFactory)\n    this.diCache.delete(token)\n  }\n\n  public inject<T>(token: InjectionToken<T>): T {\n    if (token === undefined || token === null) throw new Error('[DI Error] Token is empty')\n    if (this.diCache.has(token)) return this.diCache.get(token) as T\n    if (this.cycleDetectionStack.has(token)) throw new Error('[DI Error] Cyclic dependency detected')\n    this.cycleDetectionStack.add(token)\n    try {\n      if (this.diRegistry.has(token)) {\n        const entry = this.diRegistry.get(token)\n        if (typeof entry === 'function') {\n          if ((entry as any)._isMockFunction) {\n            const mockRes = (entry as Function)(this)\n            if (mockRes !== undefined) {\n              this.diCache.set(token, mockRes)\n              return mockRes as T\n            }\n            return entry as unknown as T\n          }\n          const str = entry.toString()\n          const isClass = str.startsWith('class ') || str.startsWith('class{') || (entry.prototype && entry.prototype.constructor === entry && !str.startsWith('function') && !str.includes('=>'))\n          if (!isClass) {\n            const resolved = (entry as Factory<T>)(this)\n            this.diCache.set(token, resolved)\n            return resolved\n          }\n          return entry as unknown as T\n        }\n        return entry as T\n      }\n      if (typeof token === 'function') {\n        const resolved = new (token as Constructor<T>)(this)\n        this.diCache.set(token, resolved)\n        return resolved\n      }\n      throw new Error('[DI Error] Token not found')\n    } finally {\n      this.cycleDetectionStack.delete(token)\n    }\n  }\n\n  private delay(ms: number, signal: AbortSignal): Promise<void> {\n    return new Promise((resolve, reject) => {\n      if (signal.aborted) {\n        return reject(new DOMException('Aborted', 'AbortError'))\n      }\n\n      const timeoutId = setTimeout(() => {\n        signal.removeEventListener('abort', onAbort)\n        resolve()\n      }, ms)\n\n      const onAbort = () => {\n        clearTimeout(timeoutId)\n        reject(new DOMException('Aborted', 'AbortError'))\n      }\n\n      signal.addEventListener('abort', onAbort, { once: true })\n    })\n  }\n\n  public resource<T, S = void>(\n    fetcher: (source: S, signal: AbortSignal) => Promise<T>,\n    source?: { value: S },\n    optionsOrName?: string | ResourceOptions<T, S>,\n  ): Resource<T> {\n    const isOptionsObject = optionsOrName && typeof optionsOrName === 'object'\n    const resourceSignalName = isOptionsObject\n      ? ((optionsOrName as ResourceOptions<T, S>).name || 'unnamed_resource')\n      : (optionsOrName as string) || 'unnamed_resource'\n\n    const options: Partial<ResourceOptions<T, S>> = isOptionsObject\n      ? (optionsOrName as ResourceOptions<T, S>)\n      : {}\n\n    const resetDataOnSourceChange = options.resetDataOnSourceChange ?? true\n    const responseValidate = options.responseValidate\n    const validateBeforeFetch = options.validateBeforeFetch\n    const retryCount = 0\n    const baseDelay = 1000\n    const useExponential = true\n    const maxRetryDelay = 1000 * 60 * 5\n    const timeoutMs = 1000\n    const state = this.signal<ResourceState<T>>(\n      { data: null, loading: true, error: null, isRetrying: false },\n      `[CORE_INTERNAL_SIGNAL=1]:resource:state:${resourceSignalName}`\n    )\n\n    const updateResourceState = (nextState: ResourceState<T>) => {\n      this.log({ type: 'resource', label: resourceSignalName, details: { to: nextState, from: state.value } })\n      state.value = nextState\n    }\n\n    const load = async (sValue: S, effectSignal: AbortSignal, isSourceChange = false) => {\n      if (effectSignal.aborted) return\n      const isValid = options.validateBeforeFetch ? options.validateBeforeFetch(sValue) : true\n\n      /**\n       * 🧐 WIP_CORE: Есть два пути, ни один не будет ошибкой, если разкомментировать код ниже. Чуть бозже добавлю опци для более тонкой отладки ядра.\n       *\n       * - АКТИВНО: Разделяем мирную блокировку (false) и боевую ошибку (string): работать будет идеально, но без логов, связанных с пре-валидацией\n       * - НЕАКТИВНО: Более очевидное логирование процессов пре-валидации (выставление ошибок и мониторинг разработчиком)\n      */\n      // --\n      // if (isValid === false) {\n      //   // Если валидатор вернул строго false — мы тихо блокируем старт фетчера,\n      //   // переводя ресурс в состояние ПОКОЯ (loading: false, error: null).\n      //   // Это полностью ликвидирует генерацию ложных ошибок при монтировании!\n      //   state.value = {\n      //     loading: false,\n      //     data: null,\n      //     error: null, // Ошибки нет! Стейт стабилен.\n      //     isRetrying: false\n      //   }\n      //   return\n      // }\n      // if (typeof isValid === 'string') {\n      //   // Если валидатор вернул строку — это боевая декларативная ошибка валидации формы.\n      //   // Здесь мы честно переводим ресурс в стейт ошибки, как и требовалось ранее.\n      //   state.value = {\n      //     loading: false,\n      //     data: null,\n      //     error: 'Core internal stopper',\n      //     isRetrying: false\n      //   }\n      //   return\n      // }\n      // --\n      if (validateBeforeFetch) {\n        const preValidationResult = validateBeforeFetch(sValue)\n        if (preValidationResult === false || typeof preValidationResult === 'string') {\n          if (effectSignal.aborted) return\n          const errorMsg = typeof preValidationResult === 'string'\n            ? preValidationResult\n            : 'Pre-fetch validation failed for resource'\n\n          const currentData = isSourceChange ? null : this.untrack(() => state.value.data)\n          updateResourceState({ data: currentData, loading: false, error: errorMsg, isRetrying: false })\n          return\n        }\n      }\n      const shouldClear = isSourceChange && resetDataOnSourceChange\n      const currentData = shouldClear ? null : this.untrack(() => state.value.data)\n      updateResourceState({ data: currentData, loading: true, error: null, isRetrying: false })\n      for (let attempt = 0; attempt <= retryCount; attempt++) {\n        if (effectSignal.aborted) return\n        let combinedSignal = effectSignal\n        try {\n          const data = await fetcher(sValue, combinedSignal)\n          if (effectSignal.aborted) return\n          if (combinedSignal.aborted) {\n            throw new DOMException('The operation timed out.', 'TimeoutError')\n          }\n          if (responseValidate) {\n            const validationResult = responseValidate(data)\n            if (validationResult === false || typeof validationResult === 'string') {\n              if (effectSignal.aborted) return\n              const errorMsg = typeof validationResult === 'string' ? validationResult : 'Validation failed'\n              updateResourceState({ data: null, loading: false, error: errorMsg, isRetrying: false })\n              return\n            }\n          }\n          if (effectSignal.aborted) return\n          updateResourceState({ data, loading: false, error: null, isRetrying: false })\n          return\n        } catch (e: unknown) {\n          if (effectSignal.aborted || ((e as Error).name === 'AbortError' && effectSignal.aborted)) return\n          const isTimeout = (e as Error).name === 'TimeoutError' || (e as Error).name === 'AbortError' || (e as Error).message?.includes('timeout')\n          const isCustomValidationError = getExtractedValues({\n            tested: [(e as Error).message], expectedKey: 'THROW_CUSTOM_VALIDATION_ERROR_NO_RETRY', valueType: 'number',\n          })?.[0] === '1' || false\n          const __defaultCustomValidationErrorMessage = 'Custom validation error'\n          let customValidationErrorMessage: string = isCustomValidationError\n            ? (getExtractedValues({\n              tested: [(e as Error).message], expectedKey: 'MESSAGE', valueType: 'string',\n            })?.[0] || __defaultCustomValidationErrorMessage)\n            : __defaultCustomValidationErrorMessage\n          const isFetchBodyValidationError = isCustomValidationError || (e as Error).name === 'ValidationError'\n          if (attempt === retryCount || isFetchBodyValidationError) {\n            if (effectSignal.aborted) return\n            const finalError = isTimeout\n              ? new Error(`Request timed out after ${timeoutMs}ms`, { cause: e })\n              : isCustomValidationError\n                ? new Error(customValidationErrorMessage, { cause: e })\n                : e\n\n            updateResourceState({\n              data: null, loading: false,\n              error: finalError instanceof Error ? finalError.message : typeof finalError === 'string' ? finalError : `typeof finalError is ${typeof finalError}`,\n              isRetrying: false,\n            })\n            return\n          } else {\n            if (effectSignal.aborted) return\n            let currentDelay = useExponential ? baseDelay * Math.pow(2, attempt) : baseDelay\n            currentDelay = Math.min(currentDelay, maxRetryDelay)\n            const jitter = Math.random() * 200\n            currentDelay = currentDelay + jitter\n            updateResourceState({ data: state.value.data, loading: true, error: null, isRetrying: true })\n            const logReason = isTimeout ? 'таймауту' : 'ошибке сети'\n            console.warn(`[Resource Retry] \"${resourceSignalName}\" сбой по ${logReason}. Попытка ${attempt + 1}/${retryCount > 0 ? retryCount + 1 : attempt + 1}...`)\n\n            try {\n              await this.delay(currentDelay, effectSignal)\n              if (effectSignal.aborted) return\n            } catch (delayError) {\n              return\n            }\n          }\n        }\n      }\n    }\n\n    let activeEffectController: AbortController | null = null\n\n    this.effect(() => {\n      const sValue = source ? source.value : undefined as S\n      const effectController = new AbortController()\n      activeEffectController = effectController\n\n      this.untrack(() => {\n        load(sValue as S, effectController.signal, true)\n      })\n\n      return () => effectController.abort()\n    }, '[CORE_INTERNAL_SIGNAL=1]:effect')\n\n    return {\n      get data() { return state.value.data },\n      get loading() { return state.value.loading },\n      get error() { return state.value.error },\n      get isRetrying() { return state.value.isRetrying },\n      get value() { return state.value },\n      refetch: () => {\n        activeEffectController?.abort()\n        activeEffectController = new AbortController()\n        load(source ? source.value : undefined as S, activeEffectController.signal, false)\n      },\n      subscribe: (cb: (val: ResourceState<T>) => void) => state.subscribe(cb)\n    }\n  }\n}\n\nexport { ReactiveEngineCore as ReactiveEngine, ReactiveEngineCore as ReactiveEngineAutomatic }\n"],"mappings":"oRAiBA,IAAM,EAA4C,CAChD,OAAQ,6FACR,SAAU,6FACV,OAAQ,6FACR,MAAO,6FACP,SAAU,6FACV,SAAU,4FACZ,EACI,EAAgD,KACpD,SAAS,EAAkB,EAAwB,CACjD,GAAI,IAAU,KAAM,MAAO,OAC3B,GAAI,IAAU,IAAA,GAAW,MAAO,YAChC,GAAI,OAAO,GAAU,SACnB,GAAI,CACF,OAAO,KAAK,UAAU,CAAK,CAC7B,MAAY,CACV,MAAO,0BACT,CAEF,OAAO,OAAO,CAAK,CACrB,CACA,SAAgB,EAAS,EAAoB,EAAe,EAAqE,CAC1H,IACH,EAAqB,CAAE,GAAI,KAAK,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,UAAU,EAAG,CAAC,EAAG,gBAAiB,CAAC,EAAG,WAAY,EAAM,EAC9G,mBAAqB,EAAU,CAAC,GAElC,EAAmB,gBAAgB,KAAK,CAAE,OAAM,QAAO,KAAM,GAAS,KAAM,GAAI,GAAS,GAAI,QAAS,GAAS,QAAS,UAAW,KAAK,IAAI,CAAE,CAAC,CACjJ,CACA,SAAgB,GAAkB,CAChC,GAAI,CAAC,GAAsB,EAAmB,WAAY,OAC1D,EAAmB,WAAa,GAChC,IAAM,EAAQ,EAAmB,gBACjC,GAAI,EAAM,SAAW,EAAG,CACtB,EAAqB,KACrB,MACF,CACA,QAAQ,eAAe,iCAAiC,EAAmB,GAAG,KAAK,EAAM,OAAO,cAAe,6FAA8F,mCAAmC,EAChP,IAAK,IAAM,KAAU,EAAO,CAC1B,IAAM,EAAa,EAAY,EAAO,MAChC,EAAgB,EAAO,OAAS,IAAA,IAAa,EAAO,KAAO,IAAA,GAC7D,EAAa,KAAK,EAAO,KAAK,YAAY,EAAE,KAAK,EAAO,QAExD,IACI,EAAO,KACX,GAAc,IAAI,EAAkB,EAAO,IAAI,EAAE,KAAK,EAAkB,EAAO,EAAE,IAC9E,GAAc,KAAK,EAAkB,EAAO,EAAE,EAAE,IAGnD,EAAO,UAAY,IAAA,GAKrB,QAAQ,IAAI,EAAY,EAAY,iBAAiB,GAJrD,QAAQ,eAAe,EAAY,EAAY,iBAAiB,EAChE,QAAQ,IAAI,WAAY,EAAO,OAAO,EACtC,QAAQ,SAAS,EAIrB,CACA,QAAQ,SAAS,EACjB,EAAqB,IACvB,CACA,IAAa,EAAb,KAAgC,CAC9B,gBAA4B,OAC5B,OACA,MAAe,EACf,eAA6B,KAC7B,WAAoB,EACpB,aAAsB,EACtB,eAAqD,CAAC,EACtD,gBAAyB,EACzB,cAAuB,IAAI,QAC3B,WAAqB,IAAI,IACzB,QAAkB,IAAI,IACtB,WAAqB,IAAI,QACzB,aAAuB,IAAI,QAC3B,gBAA0B,IAAI,QAC9B,oBAA8B,IAAI,IAClC,eAAwB,IAAI,IAC5B,YAA0B,KAE1B,gBAAyB,IAAI,IAG7B,aAAoB,EAA2B,CAC7C,KAAK,gBAAgB,IAAI,CAAO,CAClC,CAEA,YAAY,EAA4C,CACtD,KAAK,OAAS,GAAS,QAAU,CAAE,UAAW,EAAM,CACtD,CAEA,eAAsB,EAAmB,CACvC,IAAM,EAAQ,EAAO,OAAS,EACzB,KAAK,eAAe,KACvB,KAAK,eAAe,GAAS,IAAI,KAEnC,KAAK,eAAe,EAAM,CAAE,IAAI,CAAM,EAClC,EAAQ,KAAK,kBACf,KAAK,gBAAkB,EAE3B,CAEA,SAAgB,EAAoB,EAAe,EAAqE,CACtH,EAAS,EAAM,EAAO,CAAO,CAC/B,CAEA,MAAgB,EAAgB,CAC9B,KAAK,aACL,GAAI,CACF,OAAO,EAAG,CACZ,QAAU,CAER,GADA,KAAK,aACD,KAAK,aAAe,EAAG,CACzB,GAAI,KAAK,eAAe,KAAO,EAAG,CAChC,IAAK,IAAM,KAAO,KAAK,eACjB,EAAI,aAAa,EAAI,YAAY,EAEvC,KAAK,eAAe,MAAM,CAC5B,CAEA,KAAK,aAAa,EAIlB,AAEE,KAAc,sBADd,KAAc,mBAAmB,MAAM,EACJ,KAEvC,CACF,CACF,CAEA,cAA4B,CAC1B,GAAI,KAAK,WAAa,EAAG,OAEzB,IAAM,EAAe,KAAK,eAE1B,GAAI,CACF,IAAK,IAAI,EAAQ,EAAG,GAAS,KAAK,gBAAiB,IAAS,CAC1D,IAAM,EAAS,KAAK,eAAe,GAEnC,GAAI,CAAC,GAAU,EAAO,OAAS,EAAG,SAElC,IAAM,EAAU,MAAM,KAAK,CAAM,EACjC,EAAO,MAAM,EAEb,IAAK,IAAM,KAAU,EACf,MAAO,YAMN,EAAO,QAEZ,IAAI,EAAO,cAAgB,EAAO,aAAa,KAAO,EAAG,CACvD,IAAI,EAAgB,GAEpB,IAAK,IAAM,KAAO,EAAO,aAAc,CACrC,IAAM,EAAU,EAAI,OAAS,EAEzB,EAAQ,OAAS,YAAc,EAAQ,MAAQ,GAC7C,EAAQ,QAAQ,EAAQ,OAAO,EAGjC,EAAO,aAAe,EAAO,YAAY,IAAI,CAAG,IAAM,EAAQ,UAChE,EAAgB,GAEpB,CAEA,GAAI,CAAC,GAAiB,EAAO,aAAa,KAAO,EAAG,CAClD,EAAO,QAAU,GACjB,QACF,CACF,CAGA,GAAI,CACF,EAAO,IAAI,CACb,OAAS,EAAK,CACZ,MAAM,CACR,CAPA,CAUF,GAAI,EAAQ,EAAG,CACb,IAAI,EAAoB,GACxB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,IACzB,GAAI,KAAK,eAAe,IAAM,KAAK,eAAe,EAAE,CAAE,KAAO,EAAG,CAC9D,EAAoB,GACpB,KACF,CAEE,IAAmB,EAAQ,GACjC,CACF,CACA,KAAK,gBAAkB,CACzB,QAAU,CACR,KAAK,eAAiB,CACxB,CACF,CAMA,IAAa,EAAa,CACpB,CAAC,KAAK,QAAU,CAAC,KAAK,OAAO,WAEjC,EAAA,uBAAuB,WAAW,KAAK,OAAQ,EAAU,CAAM,CACjE,CAEA,OAAiB,EAAiB,EAAsD,CACtF,OAAO,EAAA,aAAgB,KAAM,EAAc,CAAa,CAC1D,CAEA,SAAmB,EAAa,EAAkC,CAEhE,OAAO,EAAA,eAAkB,KAAM,EAAI,CAAU,CAC/C,CAEA,OAAc,EAA4B,EAAiC,CACzE,OAAO,EAAA,aAAa,KAAM,EAAI,CAAU,CAC1C,CAEA,QAAkB,EAAgB,CAChC,OAAO,EAAA,eAAkB,KAAM,CAAE,CACnC,CAEA,SAAkC,EAAW,EAAkB,CAC7D,OAAO,EAAA,eAAkB,KAAM,EAAQ,CAAI,CAC7C,CAEA,QAAkB,EAA0B,EAAsC,CAChF,KAAK,WAAW,IAAI,EAAO,CAAc,EACzC,KAAK,QAAQ,OAAO,CAAK,CAC3B,CAEA,OAAiB,EAA6B,CAC5C,GAAI,GAAiC,KAAM,MAAU,MAAM,2BAA2B,EACtF,GAAI,KAAK,QAAQ,IAAI,CAAK,EAAG,OAAO,KAAK,QAAQ,IAAI,CAAK,EAC1D,GAAI,KAAK,oBAAoB,IAAI,CAAK,EAAG,MAAU,MAAM,uCAAuC,EAChG,KAAK,oBAAoB,IAAI,CAAK,EAClC,GAAI,CACF,GAAI,KAAK,WAAW,IAAI,CAAK,EAAG,CAC9B,IAAM,EAAQ,KAAK,WAAW,IAAI,CAAK,EACvC,GAAI,OAAO,GAAU,WAAY,CAC/B,GAAK,EAAc,gBAAiB,CAClC,IAAM,EAAW,EAAmB,IAAI,EAKxC,OAJI,IAAY,IAAA,GAIT,GAHL,KAAK,QAAQ,IAAI,EAAO,CAAO,EACxB,EAGX,CACA,IAAM,EAAM,EAAM,SAAS,EAE3B,GAAI,EADY,EAAI,WAAW,QAAQ,GAAK,EAAI,WAAW,QAAQ,GAAM,EAAM,WAAa,EAAM,UAAU,cAAgB,GAAS,CAAC,EAAI,WAAW,UAAU,GAAK,CAAC,EAAI,SAAS,IAAI,GACxK,CACZ,IAAM,EAAY,EAAqB,IAAI,EAE3C,OADA,KAAK,QAAQ,IAAI,EAAO,CAAQ,EACzB,CACT,CACA,OAAO,CACT,CACA,OAAO,CACT,CACA,GAAI,OAAO,GAAU,WAAY,CAC/B,IAAM,EAAW,IAAK,EAAyB,IAAI,EAEnD,OADA,KAAK,QAAQ,IAAI,EAAO,CAAQ,EACzB,CACT,CACA,MAAU,MAAM,4BAA4B,CAC9C,QAAU,CACR,KAAK,oBAAoB,OAAO,CAAK,CACvC,CACF,CAEA,MAAc,EAAY,EAAoC,CAC5D,OAAO,IAAI,SAAS,EAAS,IAAW,CACtC,GAAI,EAAO,QACT,OAAO,EAAO,IAAI,aAAa,UAAW,YAAY,CAAC,EAGzD,IAAM,EAAY,eAAiB,CACjC,EAAO,oBAAoB,QAAS,CAAO,EAC3C,EAAQ,CACV,EAAG,CAAE,EAEC,MAAgB,CACpB,aAAa,CAAS,EACtB,EAAO,IAAI,aAAa,UAAW,YAAY,CAAC,CAClD,EAEA,EAAO,iBAAiB,QAAS,EAAS,CAAE,KAAM,EAAK,CAAC,CAC1D,CAAC,CACH,CAEA,SACE,EACA,EACA,EACa,CACb,IAAM,EAAkB,GAAiB,OAAO,GAAkB,SAC5D,EAAqB,EACrB,EAAwC,MAAQ,mBACjD,GAA4B,mBAE3B,EAA0C,EAC3C,EACD,CAAC,EAEC,EAA0B,EAAQ,yBAA2B,GAC7D,EAAmB,EAAQ,iBAC3B,EAAsB,EAAQ,oBAM9B,EAAQ,KAAK,OACjB,CAAE,KAAM,KAAM,QAAS,GAAM,MAAO,KAAM,WAAY,EAAM,EAC5D,2CAA2C,GAC7C,EAEM,EAAuB,GAAgC,CAC3D,KAAK,IAAI,CAAE,KAAM,WAAY,MAAO,EAAoB,QAAS,CAAE,GAAI,EAAW,KAAM,EAAM,KAAM,CAAE,CAAC,EACvG,EAAM,MAAQ,CAChB,EAEM,EAAO,MAAO,EAAW,EAA2B,EAAiB,KAAU,CACnF,GAAI,EAAa,QAAS,OAkC1B,GAjCgB,EAAQ,qBAAsB,EAAQ,oBAAoB,CAAM,EAiC5E,EAAqB,CACvB,IAAM,EAAsB,EAAoB,CAAM,EACtD,GAAI,IAAwB,IAAS,OAAO,GAAwB,SAAU,CAC5E,GAAI,EAAa,QAAS,OAC1B,IAAM,EAAW,OAAO,GAAwB,SAC5C,EACA,2CAEE,EAAc,EAAiB,KAAO,KAAK,YAAc,EAAM,MAAM,IAAI,EAC/E,EAAoB,CAAE,KAAM,EAAa,QAAS,GAAO,MAAO,EAAU,WAAY,EAAM,CAAC,EAC7F,MACF,CACF,CAEA,IAAM,EADc,GAAkB,EACJ,KAAO,KAAK,YAAc,EAAM,MAAM,IAAI,EAC5E,EAAoB,CAAE,KAAM,EAAa,QAAS,GAAM,MAAO,KAAM,WAAY,EAAM,CAAC,EACxF,IAAK,IAAI,EAAU,EAAG,GAAW,EAAY,IAAW,CACtD,GAAI,EAAa,QAAS,OAC1B,IAAI,EAAiB,EACrB,GAAI,CACF,IAAM,EAAO,MAAM,EAAQ,EAAQ,CAAc,EACjD,GAAI,EAAa,QAAS,OAC1B,GAAI,EAAe,QACjB,MAAM,IAAI,aAAa,2BAA4B,cAAc,EAEnE,GAAI,EAAkB,CACpB,IAAM,EAAmB,EAAiB,CAAI,EAC9C,GAAI,IAAqB,IAAS,OAAO,GAAqB,SAAU,CACtE,GAAI,EAAa,QAAS,OAE1B,EAAoB,CAAE,KAAM,KAAM,QAAS,GAAO,MADjC,OAAO,GAAqB,SAAW,EAAmB,oBACR,WAAY,EAAM,CAAC,EACtF,MACF,CACF,CACA,GAAI,EAAa,QAAS,OAC1B,EAAoB,CAAE,OAAM,QAAS,GAAO,MAAO,KAAM,WAAY,EAAM,CAAC,EAC5E,MACF,OAAS,EAAY,CACnB,GAAI,EAAa,SAAa,EAAY,OAAS,cAAgB,EAAa,QAAU,OAC1F,IAAM,EAAa,EAAY,OAAS,gBAAmB,EAAY,OAAS,cAAiB,EAAY,SAAS,SAAS,SAAS,EAClI,EAA0B,EAAA,mBAAmB,CACjD,OAAQ,CAAE,EAAY,OAAO,EAAG,YAAa,yCAA0C,UAAW,QACpG,CAAC,CAAC,GAAG,KAAO,KAAO,GAEf,EAAuC,GACtC,EAAA,mBAAmB,CACpB,OAAQ,CAAE,EAAY,OAAO,EAAG,YAAa,UAAW,UAAW,QACrE,CAAC,CAAC,GAAG,IACH,0BACE,EAA6B,GAA4B,EAAY,OAAS,kBACpF,GAAI,IAAY,GAAc,EAA4B,CACxD,GAAI,EAAa,QAAS,OAC1B,IAAM,EAAa,EACX,MAAM,iCAA0C,CAAE,MAAO,CAAE,CAAC,EAChE,EACM,MAAM,EAA8B,CAAE,MAAO,CAAE,CAAC,EACpD,EAEN,EAAoB,CAClB,KAAM,KAAM,QAAS,GACrB,MAAO,aAAsB,MAAQ,EAAW,QAAU,OAAO,GAAe,SAAW,EAAa,wBAAwB,OAAO,IACvI,WAAY,EACd,CAAC,EACD,MACF,KAAO,CACL,GAAI,EAAa,QAAS,OAC1B,IAAI,EAAgC,IAAqB,GAAG,EAC5D,EAAe,KAAK,IAAI,EAAc,GAAa,EACnD,IAAM,EAAS,KAAK,OAAO,EAAI,IAC/B,GAA8B,EAC9B,EAAoB,CAAE,KAAM,EAAM,MAAM,KAAM,QAAS,GAAM,MAAO,KAAM,WAAY,EAAK,CAAC,EAE5F,QAAQ,KAAK,qBAAqB,EAAmB,YADnC,EAAY,WAAa,cACgC,YAAY,EAAU,EAAE,GAAqC,EAAU,EAAE,IAAI,EAExJ,GAAI,CAEF,GADA,MAAM,KAAK,MAAM,EAAc,CAAY,EACvC,EAAa,QAAS,MAC5B,MAAqB,CACnB,MACF,CACF,CACF,CACF,CACF,EAEI,EAAiD,KAcrD,OAZA,KAAK,WAAa,CAChB,IAAM,EAAS,EAAS,EAAO,MAAQ,IAAA,GACjC,EAAmB,IAAI,gBAO7B,MANA,GAAyB,EAEzB,KAAK,YAAc,CACjB,EAAK,EAAa,EAAiB,OAAQ,EAAI,CACjD,CAAC,MAEY,EAAiB,MAAM,CACtC,EAAG,iCAAiC,EAE7B,CACL,IAAI,MAAO,CAAE,OAAO,EAAM,MAAM,IAAK,EACrC,IAAI,SAAU,CAAE,OAAO,EAAM,MAAM,OAAQ,EAC3C,IAAI,OAAQ,CAAE,OAAO,EAAM,MAAM,KAAM,EACvC,IAAI,YAAa,CAAE,OAAO,EAAM,MAAM,UAAW,EACjD,IAAI,OAAQ,CAAE,OAAO,EAAM,KAAM,EACjC,YAAe,CACb,GAAwB,MAAM,EAC9B,EAAyB,IAAI,gBAC7B,EAAK,EAAS,EAAO,MAAQ,IAAA,GAAgB,EAAuB,OAAQ,EAAK,CACnF,EACA,UAAY,GAAwC,EAAM,UAAU,CAAE,CACxE,CACF,CACF"}

package/dist/core.method.computed.cjs

@@ -1,2 +1,2 @@
-function e(e,t,n){let r=e.computedCache.get(t);if(r)return r;let i=t.toString();e.computedStringCache||=new Map;let a=e.computedStringCache.get(i);if(a)return a;let o,s=!0,c=0,l=!1,u=-1,d=2,f=new Set,p=new Map,m=new Set,h=new Set,g=e=>{if(!e)return;let t=e._node||e;if(t.dependencies&&t.dependencies.size>0){for(let n of t.dependencies){let r=n,i=r._node||r;i.subscribers&&(i.subscribers.delete(t),i.subscribers.delete(e),i.subscribers.delete(b),i.type===`computed`&&i.subscribers.size===0&&g(i))}t.dependencies.clear(),t.depVersions&&t.depVersions.clear()}},_=-1,v=t=>{if(!l||d===2)return t.run();if(_===e.epoch&&e.batchDepth===0)return!1;let n=!1;if(f&&f.size>0)for(let e of f){let t=e._node||e;if(t.type===`computed`&&t.update&&t.update(),e.hasBatchValue||p.get(e)!==t.version){n=!0;break}}return _=e.epoch,n||s?t.run():(d=0,!1)},y=0,b={id:e.subscriberId++,dependencies:f,subscribers:h,ownedEffects:m,depth:1,type:`computed`,fn:t,get version(){return c},get state(){return d},set state(e){d=e},get depVersions(){return p},update:()=>v(b),run:()=>{if(u===e.epoch&&l&&d===0&&e.batchDepth===0)return!1;if(u=e.epoch,_=e.epoch,e.cycleDetectionStack.has(b))throw Error(`[Graph Error] Cyclic dependency detected`);e.cycleDetectionStack.add(b);let r=e.activeConsumer,i=e.activeOwner;e.activeConsumer=b,e.activeOwner=b,y++,b.activeRunId=y;let a=f.size>0?Array.from(f):null;f.clear();try{if(m.size>0){for(let e of m)e&&typeof e.dispose==`function`&&e.dispose();m.clear()}let r=t();if(a!==null){let e=a.length===f.size;for(let t of a){let n=t;if(!e||!f.has(n)){let e=n._node||n;e.subscribers&&e.subscribers.delete(b),p.delete(n)}}}let i=s||!Object.is(o,r);if(i){let t=s?void 0:typeof o==`object`&&o?JSON.parse(JSON.stringify(o)):o;o=r,c++,e.log&&n&&e.log({type:`computed`,label:n,details:{from:t,to:r}})}s=!1,d=0,l=!0;let u=0;for(let e of f){let t=e,n=t._node||t;p.set(t,n.version),n.subscribers&&n.subscribers.add(b),n.depth!==void 0&&n.depth>u&&(u=n.depth)}return b.depth=u+1,i}finally{e.activeConsumer=r,e.activeOwner=i,e.cycleDetectionStack.delete(b)}},markDirty:t=>{if(!(d>=t)){d=t;for(let t of h){let n=t._node||t;n.type===`effect`?(n.isDirty=!0,e.scheduleEffect(t)):n.markDirty&&n.markDirty(1)}}}},x={get value(){let t=e.activeConsumer;if(t&&t!==b){h.add(t),t.dependencies.add(b);let e=b.depth||1,n=t._node||t;n.depth!==void 0&&e>=n.depth&&(n.depth=e+1),t.activeRunId!==void 0&&(b._lastSeenInRunId=t.activeRunId)}return v(b),t&&t.depVersions&&t.depVersions.set(x,c),o},get valueWithoutTracking(){return o},get version(){return c},get dependencies(){return f},subscribe(t){let n={id:e.subscriberId++,isDirty:!0,depth:9999,dependencies:new Set,type:`effect`,run:()=>{if(!n.isDisposed)try{t(x.value)}catch(e){console.error(e)}}};return h.add(n),t(x.value),()=>{n.isDisposed=!0,h.delete(n)}},subscribeState(e){return x.subscribe(e)},destroy:()=>{h.clear(),g(b),e.batchComputedCache&&e.batchComputedCache.delete(i),e.computedCache.delete(t),s=!0,d=2,l=!1},__subscribe(t){let n={id:e.subscriberId++,type:`effect`,run:t,isDirty:!1};return h.add(n),()=>{h.delete(n)}}};return x._node=b,x.subscribers=h,x._isDirty=()=>d>0,x.type=`computed`,x.run=()=>b.run(),e.computedCache.set(t,x),e.computedStringCache.set(i,x),x}exports.createComputed=e;
+function e(e,t,n){let r=e.computedCache.get(t);if(r)return r;let i=t.toString();if(e.batchDepth>0){e.batchComputedCache||=new Map;let t=e.batchComputedCache.get(i);if(t)return t}let a,o=!0,s=0,c=!1,l=-1,u=2,d=new Set,f=new Map,p=new Set,m=new Set,h=e=>{if(!e)return;let t=e._node||e;if(t.dependencies&&t.dependencies.size>0){for(let n of t.dependencies){let r=n,i=r._node||r;i.subscribers&&(i.subscribers.delete(t),i.subscribers.delete(e),i.subscribers.delete(y),i.type===`computed`&&i.subscribers.size===0&&h(i))}t.dependencies.clear(),t.depVersions&&t.depVersions.clear()}},g=-1,_=t=>{if(!c||u===2)return t.run();if(g===e.epoch&&e.batchDepth===0)return!1;let n=!1;if(d&&d.size>0)for(let e of d){let t=e._node||e;if(t.type===`computed`&&t.update&&t.update(),e.hasBatchValue||f.get(e)!==t.version){n=!0;break}}return g=e.epoch,n||o?t.run():(u=0,!1)},v=0,y={id:e.subscriberId++,dependencies:d,subscribers:m,ownedEffects:p,depth:1,type:`computed`,fn:t,get version(){return s},get state(){return u},set state(e){u=e},get depVersions(){return f},update:()=>_(y),run:()=>{if(l===e.epoch&&c&&u===0&&e.batchDepth===0)return!1;if(l=e.epoch,g=e.epoch,e.cycleDetectionStack.has(y))throw Error(`[Graph Error] Cyclic dependency detected`);e.cycleDetectionStack.add(y);let r=e.activeConsumer,i=e.activeOwner;e.activeConsumer=y,e.activeOwner=y,v++,y.activeRunId=v;let m=d.size>0?Array.from(d):null;d.clear();try{if(p.size>0){for(let e of p)e&&typeof e.dispose==`function`&&e.dispose();p.clear()}let r=t();if(m!==null){let e=m.length===d.size;for(let t of m){let n=t;if(!e||!d.has(n)){let e=n._node||n;e.subscribers&&e.subscribers.delete(y),f.delete(n)}}}let i=o||!Object.is(a,r);if(i){let t=o?void 0:typeof a==`object`&&a?JSON.parse(JSON.stringify(a)):a;a=r,s++,e.log&&n&&e.log({type:`computed`,label:n,details:{from:t,to:r}})}o=!1,u=0,c=!0;let l=0;for(let e of d){let t=e,n=t._node||t;f.set(t,n.version),n.subscribers&&n.subscribers.add(y),n.depth!==void 0&&n.depth>l&&(l=n.depth)}return y.depth=l+1,i}finally{e.activeConsumer=r,e.activeOwner=i,e.cycleDetectionStack.delete(y)}},markDirty:t=>{if(!(u>=t)){u=t;for(let t of m){let n=t._node||t;n.type===`effect`?(n.isDirty=!0,e.scheduleEffect(t)):n.markDirty&&n.markDirty(1)}}}},b={get value(){let t=e.activeConsumer;if(t&&t!==y){m.add(t),t.dependencies.add(y);let e=y.depth||1,n=t._node||t;n.depth!==void 0&&e>=n.depth&&(n.depth=e+1),t.activeRunId!==void 0&&(y._lastSeenInRunId=t.activeRunId)}return _(y),t&&t.depVersions&&t.depVersions.set(b,s),a},get valueWithoutTracking(){return a},get version(){return s},get dependencies(){return d},subscribe(t){let n={id:e.subscriberId++,isDirty:!0,depth:9999,dependencies:new Set,type:`effect`,run:()=>{if(!n.isDisposed)try{t(b.value)}catch(e){console.error(e)}}};return m.add(n),t(b.value),()=>{n.isDisposed=!0,m.delete(n)}},subscribeState(e){return b.subscribe(e)},destroy:()=>{h(y),m&&m.clear(),e.computedCache.delete(t),e.batchComputedCache&&e.batchComputedCache.delete(i),o=!0,u=2,c=!1},__subscribe(t){let n={id:e.subscriberId++,type:`effect`,run:t,isDirty:!1};return m.add(n),()=>{m.delete(n)}}};return b.run=()=>y.run(),e.computedCache.set(t,b),b._node=y,b.subscribers=m,e.batchDepth>0&&e.batchComputedCache&&e.batchComputedCache.set(i,b),b}exports.createComputed=e;
 //# sourceMappingURL=core.method.computed.cjs.map

package/dist/core.method.computed.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"core.method.computed.cjs","names":[],"sources":["../src/core/core.method.computed.ts"],"sourcesContent":["import { Computed, CleanupFn } from './types'\n\nexport function createComputed<T>(\n  engine: any,\n  fn: () => T,\n  signalName?: string\n): Computed<T> {\n  // 1. Быстрый канонический WeakMap путь (по ссылке на функцию)\n  const existing = engine.computedCache.get(fn)\n  if (existing) return existing as Computed<T>\n\n  // 2. ⚡ ИНСТАНС-СКОУПЕД СТРОКОВЫЙ КЭШ (Оптимизация аллокаций V8):\n  // Переиспользуем ноды по сигнатуре исходного кода для спасения кучи от Churn-эффекта.\n  // Защищен от утечек, так как очищается целиком при сбросе ядра между тестами.\n  const cacheKey = fn.toString()\n  if (!engine.computedStringCache) {\n    engine.computedStringCache = new Map<string, any>()\n  }\n  const cachedNode = engine.computedStringCache.get(cacheKey)\n  if (cachedNode) {\n    return cachedNode as Computed<T>\n  }\n\n  let value: T\n  let isDirty = true\n  let version = 0\n  let isInitialized = false\n  let evaluatedInEpoch = -1\n  let state = 2 // 2 = DIRTY, 1 = CHECK, 0 = STABLE\n\n  const dependencies = new Set<any>()\n  const depVersions = new Map<any, number>()\n  const ownedEffects = new Set<any>()\n  const subscribers = new Set<any>()\n\n  const releaseNode = (node: any): void => {\n    if (!node) return\n    const actNode = node._node || node\n\n    if (actNode.dependencies && actNode.dependencies.size > 0) {\n      for (const unknownDep of actNode.dependencies) {\n        const dep = unknownDep as any\n        const rawDepNode = dep._node || dep\n\n        if (rawDepNode.subscribers) {\n          rawDepNode.subscribers.delete(actNode)\n          rawDepNode.subscribers.delete(node)\n          rawDepNode.subscribers.delete(computedNode)\n\n          if (rawDepNode.type === 'computed' && rawDepNode.subscribers.size === 0) {\n            releaseNode(rawDepNode)\n          }\n        }\n      }\n      actNode.dependencies.clear()\n      if (actNode.depVersions) actNode.depVersions.clear()\n    }\n  }\n\n  let verifiedInEpoch = -1\n\n  const updateIfNecessary = (node: any): boolean => {\n    if (!isInitialized || state === 2) {\n      return node.run()\n    }\n\n    if (verifiedInEpoch === engine.epoch && engine.batchDepth === 0) {\n      return false\n    }\n\n    let hasChangedParent = false\n\n    if (dependencies && dependencies.size > 0) {\n      for (const dep of dependencies) {\n        const rawDep = dep._node || dep\n\n        if (rawDep.type === 'computed') {\n          if (rawDep.update) rawDep.update()\n        }\n\n        // Если родительский сигнал мутировал в текущем батче или версии разошлись\n        if (dep.hasBatchValue || depVersions.get(dep) !== rawDep.version) {\n          hasChangedParent = true\n          break\n        }\n      }\n    }\n\n    verifiedInEpoch = engine.epoch\n\n    if (hasChangedParent || isDirty) {\n      return node.run()\n    }\n\n    state = 0\n    return false\n  }\n\n  let currentRunId = 0\n\n  const computedNode: any = {\n    id: engine.subscriberId++,\n    dependencies,\n    subscribers,\n    ownedEffects,\n    depth: 1,\n    type: 'computed',\n    fn,\n    get version() { return version },\n    get state() { return state },\n    set state(val: number) { state = val },\n    get depVersions() { return depVersions },\n    update: () => updateIfNecessary(computedNode),\n    run: () => {\n      if (evaluatedInEpoch === engine.epoch && isInitialized && state === 0 && engine.batchDepth === 0) {\n        return false\n      }\n      evaluatedInEpoch = engine.epoch\n      verifiedInEpoch = engine.epoch\n\n      if (engine.cycleDetectionStack.has(computedNode)) {\n        throw new Error('[Graph Error] Cyclic dependency detected')\n      }\n      engine.cycleDetectionStack.add(computedNode)\n\n      const prevConsumer = engine.activeConsumer\n      const prevOwner = engine.activeOwner\n\n      engine.activeConsumer = computedNode\n      engine.activeOwner = computedNode\n\n      currentRunId++\n      computedNode.activeRunId = currentRunId\n\n      const oldDeps = dependencies.size > 0 ? Array.from(dependencies) : null\n      dependencies.clear()\n\n      try {\n        if (ownedEffects.size > 0) {\n          for (const child of ownedEffects) {\n            if (child && typeof child.dispose === 'function') {\n              child.dispose()\n            }\n          }\n          ownedEffects.clear()\n        }\n\n        const newValue = fn()\n\n        if (oldDeps !== null) {\n          const isSizeIdentical = oldDeps.length === dependencies.size\n          for (const unknownDep of oldDeps) {\n            const dep = unknownDep as any\n            if (!isSizeIdentical || !dependencies.has(dep)) {\n              const rawDepNode = dep._node || dep\n              if (rawDepNode.subscribers) rawDepNode.subscribers.delete(computedNode)\n              depVersions.delete(dep)\n            }\n          }\n        }\n\n        const changed = isDirty || !Object.is(value, newValue)\n\n        if (changed) {\n          const previousValueSnapshot = isDirty ? undefined : (typeof value === 'object' && value !== null ? JSON.parse(JSON.stringify(value)) : value)\n          value = newValue\n          version++\n\n          if (engine.log && signalName) {\n            engine.log({\n              type: 'computed',\n              label: signalName,\n              details: { from: previousValueSnapshot, to: newValue }\n            })\n          }\n        }\n\n        isDirty = false\n        state = 0\n        isInitialized = true\n\n        let maxDepDepth = 0\n        for (const unknownDep of dependencies) {\n          const dep = unknownDep as any\n          const rawNode = dep._node || dep\n          depVersions.set(dep, rawNode.version)\n          if (rawNode.subscribers) rawNode.subscribers.add(computedNode)\n          if (rawNode.depth !== undefined && rawNode.depth > maxDepDepth) {\n            maxDepDepth = rawNode.depth\n          }\n        }\n\n        computedNode.depth = maxDepDepth + 1\n        return changed\n      } finally {\n        engine.activeConsumer = prevConsumer\n        engine.activeOwner = prevOwner\n        engine.cycleDetectionStack.delete(computedNode)\n      }\n    },\n    markDirty: (parentState: number) => {\n      if (state >= parentState) return\n      state = parentState\n\n      for (const sub of subscribers) {\n        const rawSub = sub._node || sub\n        if (rawSub.type === 'effect') {\n          rawSub.isDirty = true\n          engine.scheduleEffect(sub)\n        } else if (rawSub.markDirty) {\n          rawSub.markDirty(1)\n        }\n      }\n    }\n  }\n\n  const computedInstance: Computed<T> = {\n    get value() {\n      const consumer = engine.activeConsumer\n      if (consumer && consumer !== computedNode) {\n        subscribers.add(consumer)\n        consumer.dependencies.add(computedNode)\n\n        const currentDepth = computedNode.depth || 1\n        const consumerRaw = consumer._node || consumer\n        if (consumerRaw.depth !== undefined && currentDepth >= consumerRaw.depth) {\n          consumerRaw.depth = currentDepth + 1\n        }\n\n        if (consumer.activeRunId !== undefined) {\n          computedNode._lastSeenInRunId = consumer.activeRunId\n        }\n      }\n\n      updateIfNecessary(computedNode)\n\n      if (consumer && consumer.depVersions) {\n        consumer.depVersions.set(computedInstance, version)\n      }\n      return value\n    },\n    get valueWithoutTracking() { return value },\n    get version() { return version },\n    get dependencies() { return dependencies },\n\n    subscribe(cb: (val: T) => void): CleanupFn {\n      const fakeEffect: any = {\n        id: engine.subscriberId++,\n        isDirty: true,\n        depth: 9999,\n        dependencies: new Set(),\n        type: 'effect',\n        run: () => {\n          if (fakeEffect.isDisposed) return\n          try { cb(computedInstance.value) } catch (err) { console.error(err) }\n        }\n      }\n      subscribers.add(fakeEffect)\n      cb(computedInstance.value)\n      return () => {\n        fakeEffect.isDisposed = true\n        subscribers.delete(fakeEffect)\n      }\n    },\n    subscribeState(cb: () => void): CleanupFn {\n      return (computedInstance as any).subscribe(cb)\n    },\n    destroy: () => {\n      subscribers.clear()\n      releaseNode(computedNode)\n      if (engine.batchComputedCache) {\n        engine.batchComputedCache.delete(cacheKey)\n      }\n      engine.computedCache.delete(fn)\n      isDirty = true\n      state = 2\n      isInitialized = false\n    },\n    __subscribe(cb: () => void): CleanupFn {\n      const hookEffect: any = {\n        id: engine.subscriberId++,\n        type: 'effect',\n        run: cb,\n        isDirty: false\n      }\n      subscribers.add(hookEffect)\n      return () => {\n        subscribers.delete(hookEffect)\n      }\n    }\n  } as any\n\n  ;(computedInstance as any)._node = computedNode\n  ;(computedInstance as any).subscribers = subscribers\n  computedInstance._isDirty = () => state > 0\n  computedInstance.type = 'computed'\n  computedInstance.run = () => computedNode.run()\n\n  engine.computedCache.set(fn, computedInstance)\n  engine.computedStringCache.set(cacheKey, computedInstance)\n\n  return computedInstance\n}\n"],"mappings":"AAEA,SAAgB,EACd,EACA,EACA,EACa,CAEb,IAAM,EAAW,EAAO,cAAc,IAAI,CAAE,EAC5C,GAAI,EAAU,OAAO,EAKrB,IAAM,EAAW,EAAG,SAAS,EAC7B,AACE,EAAO,sBAAsB,IAAI,IAEnC,IAAM,EAAa,EAAO,oBAAoB,IAAI,CAAQ,EAC1D,GAAI,EACF,OAAO,EAGT,IAAI,EACA,EAAU,GACV,EAAU,EACV,EAAgB,GAChB,EAAmB,GACnB,EAAQ,EAEN,EAAe,IAAI,IACnB,EAAc,IAAI,IAClB,EAAe,IAAI,IACnB,EAAc,IAAI,IAElB,EAAe,GAAoB,CACvC,GAAI,CAAC,EAAM,OACX,IAAM,EAAU,EAAK,OAAS,EAE9B,GAAI,EAAQ,cAAgB,EAAQ,aAAa,KAAO,EAAG,CACzD,IAAK,IAAM,KAAc,EAAQ,aAAc,CAC7C,IAAM,EAAM,EACN,EAAa,EAAI,OAAS,EAE5B,EAAW,cACb,EAAW,YAAY,OAAO,CAAO,EACrC,EAAW,YAAY,OAAO,CAAI,EAClC,EAAW,YAAY,OAAO,CAAY,EAEtC,EAAW,OAAS,YAAc,EAAW,YAAY,OAAS,GACpE,EAAY,CAAU,EAG5B,CACA,EAAQ,aAAa,MAAM,EACvB,EAAQ,aAAa,EAAQ,YAAY,MAAM,CACrD,CACF,EAEI,EAAkB,GAEhB,EAAqB,GAAuB,CAChD,GAAI,CAAC,GAAiB,IAAU,EAC9B,OAAO,EAAK,IAAI,EAGlB,GAAI,IAAoB,EAAO,OAAS,EAAO,aAAe,EAC5D,MAAO,GAGT,IAAI,EAAmB,GAEvB,GAAI,GAAgB,EAAa,KAAO,EACtC,IAAK,IAAM,KAAO,EAAc,CAC9B,IAAM,EAAS,EAAI,OAAS,EAO5B,GALI,EAAO,OAAS,YACd,EAAO,QAAQ,EAAO,OAAO,EAI/B,EAAI,eAAiB,EAAY,IAAI,CAAG,IAAM,EAAO,QAAS,CAChE,EAAmB,GACnB,KACF,CACF,CAUF,MAPA,GAAkB,EAAO,MAErB,GAAoB,EACf,EAAK,IAAI,GAGlB,EAAQ,EACD,GACT,EAEI,EAAe,EAEb,EAAoB,CACxB,GAAI,EAAO,eACX,eACA,cACA,eACA,MAAO,EACP,KAAM,WACN,KACA,IAAI,SAAU,CAAE,OAAO,CAAQ,EAC/B,IAAI,OAAQ,CAAE,OAAO,CAAM,EAC3B,IAAI,MAAM,EAAa,CAAE,EAAQ,CAAI,EACrC,IAAI,aAAc,CAAE,OAAO,CAAY,EACvC,WAAc,EAAkB,CAAY,EAC5C,QAAW,CACT,GAAI,IAAqB,EAAO,OAAS,GAAiB,IAAU,GAAK,EAAO,aAAe,EAC7F,MAAO,GAKT,GAHA,EAAmB,EAAO,MAC1B,EAAkB,EAAO,MAErB,EAAO,oBAAoB,IAAI,CAAY,EAC7C,MAAU,MAAM,0CAA0C,EAE5D,EAAO,oBAAoB,IAAI,CAAY,EAE3C,IAAM,EAAe,EAAO,eACtB,EAAY,EAAO,YAEzB,EAAO,eAAiB,EACxB,EAAO,YAAc,EAErB,IACA,EAAa,YAAc,EAE3B,IAAM,EAAU,EAAa,KAAO,EAAI,MAAM,KAAK,CAAY,EAAI,KACnE,EAAa,MAAM,EAEnB,GAAI,CACF,GAAI,EAAa,KAAO,EAAG,CACzB,IAAK,IAAM,KAAS,EACd,GAAS,OAAO,EAAM,SAAY,YACpC,EAAM,QAAQ,EAGlB,EAAa,MAAM,CACrB,CAEA,IAAM,EAAW,EAAG,EAEpB,GAAI,IAAY,KAAM,CACpB,IAAM,EAAkB,EAAQ,SAAW,EAAa,KACxD,IAAK,IAAM,KAAc,EAAS,CAChC,IAAM,EAAM,EACZ,GAAI,CAAC,GAAmB,CAAC,EAAa,IAAI,CAAG,EAAG,CAC9C,IAAM,EAAa,EAAI,OAAS,EAC5B,EAAW,aAAa,EAAW,YAAY,OAAO,CAAY,EACtE,EAAY,OAAO,CAAG,CACxB,CACF,CACF,CAEA,IAAM,EAAU,GAAW,CAAC,OAAO,GAAG,EAAO,CAAQ,EAErD,GAAI,EAAS,CACX,IAAM,EAAwB,EAAU,IAAA,GAAa,OAAO,GAAU,UAAY,EAAiB,KAAK,MAAM,KAAK,UAAU,CAAK,CAAC,EAAI,EACvI,EAAQ,EACR,IAEI,EAAO,KAAO,GAChB,EAAO,IAAI,CACT,KAAM,WACN,MAAO,EACP,QAAS,CAAE,KAAM,EAAuB,GAAI,CAAS,CACvD,CAAC,CAEL,CAEA,EAAU,GACV,EAAQ,EACR,EAAgB,GAEhB,IAAI,EAAc,EAClB,IAAK,IAAM,KAAc,EAAc,CACrC,IAAM,EAAM,EACN,EAAU,EAAI,OAAS,EAC7B,EAAY,IAAI,EAAK,EAAQ,OAAO,EAChC,EAAQ,aAAa,EAAQ,YAAY,IAAI,CAAY,EACzD,EAAQ,QAAU,IAAA,IAAa,EAAQ,MAAQ,IACjD,EAAc,EAAQ,MAE1B,CAGA,MADA,GAAa,MAAQ,EAAc,EAC5B,CACT,QAAU,CACR,EAAO,eAAiB,EACxB,EAAO,YAAc,EACrB,EAAO,oBAAoB,OAAO,CAAY,CAChD,CACF,EACA,UAAY,GAAwB,CAC9B,QAAS,GACb,GAAQ,EAER,IAAK,IAAM,KAAO,EAAa,CAC7B,IAAM,EAAS,EAAI,OAAS,EACxB,EAAO,OAAS,UAClB,EAAO,QAAU,GACjB,EAAO,eAAe,CAAG,GAChB,EAAO,WAChB,EAAO,UAAU,CAAC,CAEtB,CAVQ,CAWV,CACF,EAEM,EAAgC,CACpC,IAAI,OAAQ,CACV,IAAM,EAAW,EAAO,eACxB,GAAI,GAAY,IAAa,EAAc,CACzC,EAAY,IAAI,CAAQ,EACxB,EAAS,aAAa,IAAI,CAAY,EAEtC,IAAM,EAAe,EAAa,OAAS,EACrC,EAAc,EAAS,OAAS,EAClC,EAAY,QAAU,IAAA,IAAa,GAAgB,EAAY,QACjE,EAAY,MAAQ,EAAe,GAGjC,EAAS,cAAgB,IAAA,KAC3B,EAAa,iBAAmB,EAAS,YAE7C,CAOA,OALA,EAAkB,CAAY,EAE1B,GAAY,EAAS,aACvB,EAAS,YAAY,IAAI,EAAkB,CAAO,EAE7C,CACT,EACA,IAAI,sBAAuB,CAAE,OAAO,CAAM,EAC1C,IAAI,SAAU,CAAE,OAAO,CAAQ,EAC/B,IAAI,cAAe,CAAE,OAAO,CAAa,EAEzC,UAAU,EAAiC,CACzC,IAAM,EAAkB,CACtB,GAAI,EAAO,eACX,QAAS,GACT,MAAO,KACP,aAAc,IAAI,IAClB,KAAM,SACN,QAAW,CACL,MAAW,WACf,GAAI,CAAE,EAAG,EAAiB,KAAK,CAAE,OAAS,EAAK,CAAE,QAAQ,MAAM,CAAG,CAAE,CACtE,CACF,EAGA,OAFA,EAAY,IAAI,CAAU,EAC1B,EAAG,EAAiB,KAAK,MACZ,CACX,EAAW,WAAa,GACxB,EAAY,OAAO,CAAU,CAC/B,CACF,EACA,eAAe,EAA2B,CACxC,OAAQ,EAAyB,UAAU,CAAE,CAC/C,EACA,YAAe,CACb,EAAY,MAAM,EAClB,EAAY,CAAY,EACpB,EAAO,oBACT,EAAO,mBAAmB,OAAO,CAAQ,EAE3C,EAAO,cAAc,OAAO,CAAE,EAC9B,EAAU,GACV,EAAQ,EACR,EAAgB,EAClB,EACA,YAAY,EAA2B,CACrC,IAAM,EAAkB,CACtB,GAAI,EAAO,eACX,KAAM,SACN,IAAK,EACL,QAAS,EACX,EAEA,OADA,EAAY,IAAI,CAAU,MACb,CACX,EAAY,OAAO,CAAU,CAC/B,CACF,CACF,EAWA,MATC,GAA0B,MAAQ,EAClC,EAA0B,YAAc,EACzC,EAAiB,aAAiB,EAAQ,EAC1C,EAAiB,KAAO,WACxB,EAAiB,QAAY,EAAa,IAAI,EAE9C,EAAO,cAAc,IAAI,EAAI,CAAgB,EAC7C,EAAO,oBAAoB,IAAI,EAAU,CAAgB,EAElD,CACT"}
+{"version":3,"file":"core.method.computed.cjs","names":[],"sources":["../src/core/core.method.computed.ts"],"sourcesContent":["import { Computed, CleanupFn } from './types'\n\nexport function createComputed<T>(\n  engine: any,\n  fn: () => T,\n  signalName?: string\n): Computed<T> {\n  // 1. Быстрый канонический WeakMap путь (по ссылке на функцию)\n  const existing = engine.computedCache.get(fn)\n  if (existing) return existing as Computed<T>\n\n  // 2. ⚡ БЕЗОПАСНЫЙ ТРАНЗАКЦИОННЫЙ СТРОКОВЫЙ КЭШ:\n  // Переиспользуем ноды по сигнатуре только внутри ОДНОГО батча (цикла генерации графа).\n  const cacheKey = fn.toString()\n  if (engine.batchDepth > 0) {\n    if (!engine.batchComputedCache) {\n      engine.batchComputedCache = new Map<string, any>()\n    }\n    const cachedNode = engine.batchComputedCache.get(cacheKey)\n    if (cachedNode) {\n      return cachedNode as Computed<T>\n    }\n  }\n\n  let value: T\n  let isDirty = true\n  let version = 0\n  let isInitialized = false\n  let evaluatedInEpoch = -1\n  let state = 2 // 2 = DIRTY, 1 = CHECK, 0 = STABLE\n\n  const dependencies = new Set<any>()\n  const depVersions = new Map<any, number>()\n  const ownedEffects = new Set<any>()\n  const subscribers = new Set<any>()\n\n  const releaseNode = (node: any): void => {\n    if (!node) return\n    // Строго извлекаем внутреннее ядро ноды\n    const actNode = node._node || node\n\n    if (actNode.dependencies && actNode.dependencies.size > 0) {\n      for (const unknownDep of actNode.dependencies) {\n        const dep = unknownDep as any\n        const rawDepNode = dep._node || dep\n\n        if (rawDepNode.subscribers) {\n          // Удаляем связи, не затирая сами объекты\n          rawDepNode.subscribers.delete(actNode)\n          rawDepNode.subscribers.delete(node)\n          rawDepNode.subscribers.delete(computedNode)\n\n          // ⚡ БЕЗОПАСНЫЙ КАСКАДНЫЙ ПЕРЕХОД:\n          // Передаем в рекурсию строго внутренний приватный computedNode (rawDepNode),\n          // чтобы V8 распутывал граф без зануления внешних инстансов прокси\n          if (rawDepNode.type === 'computed' && rawDepNode.subscribers.size === 0) {\n            releaseNode(rawDepNode)\n          }\n        }\n      }\n      actNode.dependencies.clear()\n      if (actNode.depVersions) actNode.depVersions.clear()\n    }\n  }\n\n  let verifiedInEpoch = -1\n\n  const updateIfNecessary = (node: any): boolean => {\n    if (!isInitialized || state === 2) {\n      return node.run()\n    }\n\n    if (verifiedInEpoch === engine.epoch && engine.batchDepth === 0) {\n      return false\n    }\n\n    let hasChangedParent = false\n\n    if (dependencies && dependencies.size > 0) {\n      for (const dep of dependencies) {\n        const rawDep = dep._node || dep\n\n        if (rawDep.type === 'computed') {\n          if (rawDep.update) rawDep.update()\n        }\n\n        // Если родительский сигнал мутировал в текущем батче или версии разошлись\n        if (dep.hasBatchValue || depVersions.get(dep) !== rawDep.version) {\n          hasChangedParent = true\n          break\n        }\n      }\n    }\n\n    verifiedInEpoch = engine.epoch\n\n    if (hasChangedParent || isDirty) {\n      return node.run()\n    }\n\n    state = 0\n    return false\n  }\n\n  let currentRunId = 0\n\n  const computedNode: any = {\n    id: engine.subscriberId++,\n    dependencies,\n    subscribers,\n    ownedEffects,\n    depth: 1,\n    type: 'computed',\n    fn,\n    get version() { return version },\n    get state() { return state },\n    set state(val: number) { state = val },\n    get depVersions() { return depVersions },\n    update: () => updateIfNecessary(computedNode),\n    run: () => {\n      if (evaluatedInEpoch === engine.epoch && isInitialized && state === 0 && engine.batchDepth === 0) {\n        return false\n      }\n      evaluatedInEpoch = engine.epoch\n      verifiedInEpoch = engine.epoch\n\n      if (engine.cycleDetectionStack.has(computedNode)) {\n        throw new Error('[Graph Error] Cyclic dependency detected')\n      }\n      engine.cycleDetectionStack.add(computedNode)\n\n      const prevConsumer = engine.activeConsumer\n      const prevOwner = engine.activeOwner\n\n      engine.activeConsumer = computedNode\n      engine.activeOwner = computedNode\n\n      currentRunId++\n      computedNode.activeRunId = currentRunId\n\n      const oldDeps = dependencies.size > 0 ? Array.from(dependencies) : null\n      dependencies.clear()\n\n      try {\n        if (ownedEffects.size > 0) {\n          for (const child of ownedEffects) {\n            if (child && typeof child.dispose === 'function') {\n              child.dispose()\n            }\n          }\n          ownedEffects.clear()\n        }\n\n        const newValue = fn()\n\n        if (oldDeps !== null) {\n          const isSizeIdentical = oldDeps.length === dependencies.size\n          for (const unknownDep of oldDeps) {\n            const dep = unknownDep as any\n            if (!isSizeIdentical || !dependencies.has(dep)) {\n              const rawDepNode = dep._node || dep\n              if (rawDepNode.subscribers) rawDepNode.subscribers.delete(computedNode)\n              depVersions.delete(dep)\n            }\n          }\n        }\n\n        const changed = isDirty || !Object.is(value, newValue)\n\n        if (changed) {\n          const previousValueSnapshot = isDirty ? undefined : (typeof value === 'object' && value !== null ? JSON.parse(JSON.stringify(value)) : value)\n          value = newValue\n          version++\n\n          if (engine.log && signalName) {\n            engine.log({\n              type: 'computed',\n              label: signalName,\n              details: { from: previousValueSnapshot, to: newValue }\n            })\n          }\n        }\n\n        isDirty = false\n        state = 0\n        isInitialized = true\n\n        let maxDepDepth = 0\n        for (const unknownDep of dependencies) {\n          const dep = unknownDep as any\n          const rawNode = dep._node || dep\n          depVersions.set(dep, rawNode.version)\n          if (rawNode.subscribers) rawNode.subscribers.add(computedNode)\n          if (rawNode.depth !== undefined && rawNode.depth > maxDepDepth) {\n            maxDepDepth = rawNode.depth\n          }\n        }\n\n        computedNode.depth = maxDepDepth + 1\n        return changed\n      } finally {\n        engine.activeConsumer = prevConsumer\n        engine.activeOwner = prevOwner\n        engine.cycleDetectionStack.delete(computedNode)\n      }\n    },\n    markDirty: (parentState: number) => {\n      if (state >= parentState) return\n      state = parentState\n\n      for (const sub of subscribers) {\n        const rawSub = sub._node || sub\n        if (rawSub.type === 'effect') {\n          rawSub.isDirty = true\n          engine.scheduleEffect(sub)\n        } else if (rawSub.markDirty) {\n          rawSub.markDirty(1)\n        }\n      }\n    }\n  }\n\n  const computedInstance: Computed<T> = {\n    get value() {\n      const consumer = engine.activeConsumer\n      if (consumer && consumer !== computedNode) {\n        subscribers.add(consumer)\n        consumer.dependencies.add(computedNode)\n\n        const currentDepth = computedNode.depth || 1\n        const consumerRaw = consumer._node || consumer\n        if (consumerRaw.depth !== undefined && currentDepth >= consumerRaw.depth) {\n          consumerRaw.depth = currentDepth + 1\n        }\n\n        if (consumer.activeRunId !== undefined) {\n          computedNode._lastSeenInRunId = consumer.activeRunId\n        }\n      }\n\n      updateIfNecessary(computedNode)\n\n      if (consumer && consumer.depVersions) {\n        consumer.depVersions.set(computedInstance, version)\n      }\n      return value\n    },\n    get valueWithoutTracking() { return value },\n    get version() { return version },\n    get dependencies() { return dependencies },\n\n    subscribe(cb: (val: T) => void): CleanupFn {\n      const fakeEffect: any = {\n        id: engine.subscriberId++,\n        isDirty: true,\n        depth: 9999,\n        dependencies: new Set(),\n        type: 'effect',\n        run: () => {\n          if (fakeEffect.isDisposed) return\n          try { cb(computedInstance.value) } catch (err) { console.error(err) }\n        }\n      }\n      subscribers.add(fakeEffect)\n      cb(computedInstance.value)\n      return () => {\n        fakeEffect.isDisposed = true\n        subscribers.delete(fakeEffect)\n      }\n    },\n    subscribeState(cb: () => void): CleanupFn {\n      return (computedInstance as any).subscribe(cb)\n    },\n    destroy: () => {\n      // 1. Распутываем зависимости вверх по графу, пока subscribers живы\n      releaseNode(computedNode)\n\n      // 2. Очищаем локальные сеты графа, сохраняя ссылки на сами структуры\n      if (subscribers) subscribers.clear()\n\n      // 3. Вычищаем строго из кэшей\n      engine.computedCache.delete(fn)\n      if (engine.batchComputedCache) {\n        engine.batchComputedCache.delete(cacheKey)\n      }\n\n      // 4. Мягкий сброс флагов вычислений\n      isDirty = true\n      state = 2\n      isInitialized = false\n      // ⚛️ ГАРАНТИЯ СТАБИЛЬНОСТИ: Никаких занулений computedInstance._node = undefined!\n    },\n    __subscribe(cb: () => void): CleanupFn {\n      const hookEffect: any = {\n        id: engine.subscriberId++,\n        type: 'effect',\n        run: cb,\n        isDirty: false\n      }\n      subscribers.add(hookEffect)\n      return () => {\n        subscribers.delete(hookEffect)\n      }\n    }\n  } as any\n\n  computedInstance.run = () => computedNode.run()\n\n  // Сохраняем в канонический кэш\n  engine.computedCache.set(fn, computedInstance)\n\n  ;(computedInstance as any)._node = computedNode\n  ;(computedInstance as any).subscribers = subscribers\n\n  // ⚡ Записываем во временный батч-кэш для оптимизации аллокаций\n  if (engine.batchDepth > 0 && engine.batchComputedCache) {\n    engine.batchComputedCache.set(cacheKey, computedInstance)\n  }\n\n  return computedInstance\n}\n"],"mappings":"AAEA,SAAgB,EACd,EACA,EACA,EACa,CAEb,IAAM,EAAW,EAAO,cAAc,IAAI,CAAE,EAC5C,GAAI,EAAU,OAAO,EAIrB,IAAM,EAAW,EAAG,SAAS,EAC7B,GAAI,EAAO,WAAa,EAAG,CACzB,AACE,EAAO,qBAAqB,IAAI,IAElC,IAAM,EAAa,EAAO,mBAAmB,IAAI,CAAQ,EACzD,GAAI,EACF,OAAO,CAEX,CAEA,IAAI,EACA,EAAU,GACV,EAAU,EACV,EAAgB,GAChB,EAAmB,GACnB,EAAQ,EAEN,EAAe,IAAI,IACnB,EAAc,IAAI,IAClB,EAAe,IAAI,IACnB,EAAc,IAAI,IAElB,EAAe,GAAoB,CACvC,GAAI,CAAC,EAAM,OAEX,IAAM,EAAU,EAAK,OAAS,EAE9B,GAAI,EAAQ,cAAgB,EAAQ,aAAa,KAAO,EAAG,CACzD,IAAK,IAAM,KAAc,EAAQ,aAAc,CAC7C,IAAM,EAAM,EACN,EAAa,EAAI,OAAS,EAE5B,EAAW,cAEb,EAAW,YAAY,OAAO,CAAO,EACrC,EAAW,YAAY,OAAO,CAAI,EAClC,EAAW,YAAY,OAAO,CAAY,EAKtC,EAAW,OAAS,YAAc,EAAW,YAAY,OAAS,GACpE,EAAY,CAAU,EAG5B,CACA,EAAQ,aAAa,MAAM,EACvB,EAAQ,aAAa,EAAQ,YAAY,MAAM,CACrD,CACF,EAEI,EAAkB,GAEhB,EAAqB,GAAuB,CAChD,GAAI,CAAC,GAAiB,IAAU,EAC9B,OAAO,EAAK,IAAI,EAGlB,GAAI,IAAoB,EAAO,OAAS,EAAO,aAAe,EAC5D,MAAO,GAGT,IAAI,EAAmB,GAEvB,GAAI,GAAgB,EAAa,KAAO,EACtC,IAAK,IAAM,KAAO,EAAc,CAC9B,IAAM,EAAS,EAAI,OAAS,EAO5B,GALI,EAAO,OAAS,YACd,EAAO,QAAQ,EAAO,OAAO,EAI/B,EAAI,eAAiB,EAAY,IAAI,CAAG,IAAM,EAAO,QAAS,CAChE,EAAmB,GACnB,KACF,CACF,CAUF,MAPA,GAAkB,EAAO,MAErB,GAAoB,EACf,EAAK,IAAI,GAGlB,EAAQ,EACD,GACT,EAEI,EAAe,EAEb,EAAoB,CACxB,GAAI,EAAO,eACX,eACA,cACA,eACA,MAAO,EACP,KAAM,WACN,KACA,IAAI,SAAU,CAAE,OAAO,CAAQ,EAC/B,IAAI,OAAQ,CAAE,OAAO,CAAM,EAC3B,IAAI,MAAM,EAAa,CAAE,EAAQ,CAAI,EACrC,IAAI,aAAc,CAAE,OAAO,CAAY,EACvC,WAAc,EAAkB,CAAY,EAC5C,QAAW,CACT,GAAI,IAAqB,EAAO,OAAS,GAAiB,IAAU,GAAK,EAAO,aAAe,EAC7F,MAAO,GAKT,GAHA,EAAmB,EAAO,MAC1B,EAAkB,EAAO,MAErB,EAAO,oBAAoB,IAAI,CAAY,EAC7C,MAAU,MAAM,0CAA0C,EAE5D,EAAO,oBAAoB,IAAI,CAAY,EAE3C,IAAM,EAAe,EAAO,eACtB,EAAY,EAAO,YAEzB,EAAO,eAAiB,EACxB,EAAO,YAAc,EAErB,IACA,EAAa,YAAc,EAE3B,IAAM,EAAU,EAAa,KAAO,EAAI,MAAM,KAAK,CAAY,EAAI,KACnE,EAAa,MAAM,EAEnB,GAAI,CACF,GAAI,EAAa,KAAO,EAAG,CACzB,IAAK,IAAM,KAAS,EACd,GAAS,OAAO,EAAM,SAAY,YACpC,EAAM,QAAQ,EAGlB,EAAa,MAAM,CACrB,CAEA,IAAM,EAAW,EAAG,EAEpB,GAAI,IAAY,KAAM,CACpB,IAAM,EAAkB,EAAQ,SAAW,EAAa,KACxD,IAAK,IAAM,KAAc,EAAS,CAChC,IAAM,EAAM,EACZ,GAAI,CAAC,GAAmB,CAAC,EAAa,IAAI,CAAG,EAAG,CAC9C,IAAM,EAAa,EAAI,OAAS,EAC5B,EAAW,aAAa,EAAW,YAAY,OAAO,CAAY,EACtE,EAAY,OAAO,CAAG,CACxB,CACF,CACF,CAEA,IAAM,EAAU,GAAW,CAAC,OAAO,GAAG,EAAO,CAAQ,EAErD,GAAI,EAAS,CACX,IAAM,EAAwB,EAAU,IAAA,GAAa,OAAO,GAAU,UAAY,EAAiB,KAAK,MAAM,KAAK,UAAU,CAAK,CAAC,EAAI,EACvI,EAAQ,EACR,IAEI,EAAO,KAAO,GAChB,EAAO,IAAI,CACT,KAAM,WACN,MAAO,EACP,QAAS,CAAE,KAAM,EAAuB,GAAI,CAAS,CACvD,CAAC,CAEL,CAEA,EAAU,GACV,EAAQ,EACR,EAAgB,GAEhB,IAAI,EAAc,EAClB,IAAK,IAAM,KAAc,EAAc,CACrC,IAAM,EAAM,EACN,EAAU,EAAI,OAAS,EAC7B,EAAY,IAAI,EAAK,EAAQ,OAAO,EAChC,EAAQ,aAAa,EAAQ,YAAY,IAAI,CAAY,EACzD,EAAQ,QAAU,IAAA,IAAa,EAAQ,MAAQ,IACjD,EAAc,EAAQ,MAE1B,CAGA,MADA,GAAa,MAAQ,EAAc,EAC5B,CACT,QAAU,CACR,EAAO,eAAiB,EACxB,EAAO,YAAc,EACrB,EAAO,oBAAoB,OAAO,CAAY,CAChD,CACF,EACA,UAAY,GAAwB,CAC9B,QAAS,GACb,GAAQ,EAER,IAAK,IAAM,KAAO,EAAa,CAC7B,IAAM,EAAS,EAAI,OAAS,EACxB,EAAO,OAAS,UAClB,EAAO,QAAU,GACjB,EAAO,eAAe,CAAG,GAChB,EAAO,WAChB,EAAO,UAAU,CAAC,CAEtB,CAVQ,CAWV,CACF,EAEM,EAAgC,CACpC,IAAI,OAAQ,CACV,IAAM,EAAW,EAAO,eACxB,GAAI,GAAY,IAAa,EAAc,CACzC,EAAY,IAAI,CAAQ,EACxB,EAAS,aAAa,IAAI,CAAY,EAEtC,IAAM,EAAe,EAAa,OAAS,EACrC,EAAc,EAAS,OAAS,EAClC,EAAY,QAAU,IAAA,IAAa,GAAgB,EAAY,QACjE,EAAY,MAAQ,EAAe,GAGjC,EAAS,cAAgB,IAAA,KAC3B,EAAa,iBAAmB,EAAS,YAE7C,CAOA,OALA,EAAkB,CAAY,EAE1B,GAAY,EAAS,aACvB,EAAS,YAAY,IAAI,EAAkB,CAAO,EAE7C,CACT,EACA,IAAI,sBAAuB,CAAE,OAAO,CAAM,EAC1C,IAAI,SAAU,CAAE,OAAO,CAAQ,EAC/B,IAAI,cAAe,CAAE,OAAO,CAAa,EAEzC,UAAU,EAAiC,CACzC,IAAM,EAAkB,CACtB,GAAI,EAAO,eACX,QAAS,GACT,MAAO,KACP,aAAc,IAAI,IAClB,KAAM,SACN,QAAW,CACL,MAAW,WACf,GAAI,CAAE,EAAG,EAAiB,KAAK,CAAE,OAAS,EAAK,CAAE,QAAQ,MAAM,CAAG,CAAE,CACtE,CACF,EAGA,OAFA,EAAY,IAAI,CAAU,EAC1B,EAAG,EAAiB,KAAK,MACZ,CACX,EAAW,WAAa,GACxB,EAAY,OAAO,CAAU,CAC/B,CACF,EACA,eAAe,EAA2B,CACxC,OAAQ,EAAyB,UAAU,CAAE,CAC/C,EACA,YAAe,CAEb,EAAY,CAAY,EAGpB,GAAa,EAAY,MAAM,EAGnC,EAAO,cAAc,OAAO,CAAE,EAC1B,EAAO,oBACT,EAAO,mBAAmB,OAAO,CAAQ,EAI3C,EAAU,GACV,EAAQ,EACR,EAAgB,EAElB,EACA,YAAY,EAA2B,CACrC,IAAM,EAAkB,CACtB,GAAI,EAAO,eACX,KAAM,SACN,IAAK,EACL,QAAS,EACX,EAEA,OADA,EAAY,IAAI,CAAU,MACb,CACX,EAAY,OAAO,CAAU,CAC/B,CACF,CACF,EAeA,MAbA,GAAiB,QAAY,EAAa,IAAI,EAG9C,EAAO,cAAc,IAAI,EAAI,CAAgB,EAE5C,EAA0B,MAAQ,EAClC,EAA0B,YAAc,EAGrC,EAAO,WAAa,GAAK,EAAO,oBAClC,EAAO,mBAAmB,IAAI,EAAU,CAAgB,EAGnD,CACT"}

package/dist/core.method.computed.mjs

@@ -3,80 +3,82 @@ function e(e, t, n) {
 	let r = e.computedCache.get(t);
 	if (r) return r;
 	let i = t.toString();
-	e.computedStringCache ||= /* @__PURE__ */ new Map();
-	let a = e.computedStringCache.get(i);
-	if (a) return a;
-	let o, s = !0, c = 0, l = !1, u = -1, d = 2, f = /* @__PURE__ */ new Set(), p = /* @__PURE__ */ new Map(), m = /* @__PURE__ */ new Set(), h = /* @__PURE__ */ new Set(), g = (e) => {
+	if (e.batchDepth > 0) {
+		e.batchComputedCache ||= /* @__PURE__ */ new Map();
+		let t = e.batchComputedCache.get(i);
+		if (t) return t;
+	}
+	let a, o = !0, s = 0, c = !1, l = -1, u = 2, d = /* @__PURE__ */ new Set(), f = /* @__PURE__ */ new Map(), p = /* @__PURE__ */ new Set(), m = /* @__PURE__ */ new Set(), h = (e) => {
 		if (!e) return;
 		let t = e._node || e;
 		if (t.dependencies && t.dependencies.size > 0) {
 			for (let n of t.dependencies) {
 				let r = n, i = r._node || r;
-				i.subscribers && (i.subscribers.delete(t), i.subscribers.delete(e), i.subscribers.delete(b), i.type === "computed" && i.subscribers.size === 0 && g(i));
+				i.subscribers && (i.subscribers.delete(t), i.subscribers.delete(e), i.subscribers.delete(y), i.type === "computed" && i.subscribers.size === 0 && h(i));
 			}
 			t.dependencies.clear(), t.depVersions && t.depVersions.clear();
 		}
-	}, _ = -1, v = (t) => {
-		if (!l || d === 2) return t.run();
-		if (_ === e.epoch && e.batchDepth === 0) return !1;
+	}, g = -1, _ = (t) => {
+		if (!c || u === 2) return t.run();
+		if (g === e.epoch && e.batchDepth === 0) return !1;
 		let n = !1;
-		if (f && f.size > 0) for (let e of f) {
+		if (d && d.size > 0) for (let e of d) {
 			let t = e._node || e;
-			if (t.type === "computed" && t.update && t.update(), e.hasBatchValue || p.get(e) !== t.version) {
+			if (t.type === "computed" && t.update && t.update(), e.hasBatchValue || f.get(e) !== t.version) {
 				n = !0;
 				break;
 			}
 		}
-		return _ = e.epoch, n || s ? t.run() : (d = 0, !1);
-	}, y = 0, b = {
+		return g = e.epoch, n || o ? t.run() : (u = 0, !1);
+	}, v = 0, y = {
 		id: e.subscriberId++,
-		dependencies: f,
-		subscribers: h,
-		ownedEffects: m,
+		dependencies: d,
+		subscribers: m,
+		ownedEffects: p,
 		depth: 1,
 		type: "computed",
 		fn: t,
 		get version() {
-			return c;
+			return s;
 		},
 		get state() {
-			return d;
+			return u;
 		},
 		set state(e) {
-			d = e;
+			u = e;
 		},
 		get depVersions() {
-			return p;
+			return f;
 		},
-		update: () => v(b),
+		update: () => _(y),
 		run: () => {
-			if (u === e.epoch && l && d === 0 && e.batchDepth === 0) return !1;
-			if (u = e.epoch, _ = e.epoch, e.cycleDetectionStack.has(b)) throw Error("[Graph Error] Cyclic dependency detected");
-			e.cycleDetectionStack.add(b);
+			if (l === e.epoch && c && u === 0 && e.batchDepth === 0) return !1;
+			if (l = e.epoch, g = e.epoch, e.cycleDetectionStack.has(y)) throw Error("[Graph Error] Cyclic dependency detected");
+			e.cycleDetectionStack.add(y);
 			let r = e.activeConsumer, i = e.activeOwner;
-			e.activeConsumer = b, e.activeOwner = b, y++, b.activeRunId = y;
-			let a = f.size > 0 ? Array.from(f) : null;
-			f.clear();
+			e.activeConsumer = y, e.activeOwner = y, v++, y.activeRunId = v;
+			let m = d.size > 0 ? Array.from(d) : null;
+			d.clear();
 			try {
-				if (m.size > 0) {
-					for (let e of m) e && typeof e.dispose == "function" && e.dispose();
-					m.clear();
+				if (p.size > 0) {
+					for (let e of p) e && typeof e.dispose == "function" && e.dispose();
+					p.clear();
 				}
 				let r = t();
-				if (a !== null) {
-					let e = a.length === f.size;
-					for (let t of a) {
+				if (m !== null) {
+					let e = m.length === d.size;
+					for (let t of m) {
 						let n = t;
-						if (!e || !f.has(n)) {
+						if (!e || !d.has(n)) {
 							let e = n._node || n;
-							e.subscribers && e.subscribers.delete(b), p.delete(n);
+							e.subscribers && e.subscribers.delete(y), f.delete(n);
 						}
 					}
 				}
-				let i = s || !Object.is(o, r);
+				let i = o || !Object.is(a, r);
 				if (i) {
-					let t = s ? void 0 : typeof o == "object" && o ? JSON.parse(JSON.stringify(o)) : o;
-					o = r, c++, e.log && n && e.log({
+					let t = o ? void 0 : typeof a == "object" && a ? JSON.parse(JSON.stringify(a)) : a;
+					a = r, s++, e.log && n && e.log({
 						type: "computed",
 						label: n,
 						details: {
@@ -85,44 +87,44 @@ function e(e, t, n) {
 						}
 					});
 				}
-				s = !1, d = 0, l = !0;
-				let u = 0;
-				for (let e of f) {
+				o = !1, u = 0, c = !0;
+				let l = 0;
+				for (let e of d) {
 					let t = e, n = t._node || t;
-					p.set(t, n.version), n.subscribers && n.subscribers.add(b), n.depth !== void 0 && n.depth > u && (u = n.depth);
+					f.set(t, n.version), n.subscribers && n.subscribers.add(y), n.depth !== void 0 && n.depth > l && (l = n.depth);
 				}
-				return b.depth = u + 1, i;
+				return y.depth = l + 1, i;
 			} finally {
-				e.activeConsumer = r, e.activeOwner = i, e.cycleDetectionStack.delete(b);
+				e.activeConsumer = r, e.activeOwner = i, e.cycleDetectionStack.delete(y);
 			}
 		},
 		markDirty: (t) => {
-			if (!(d >= t)) {
-				d = t;
-				for (let t of h) {
+			if (!(u >= t)) {
+				u = t;
+				for (let t of m) {
 					let n = t._node || t;
 					n.type === "effect" ? (n.isDirty = !0, e.scheduleEffect(t)) : n.markDirty && n.markDirty(1);
 				}
 			}
 		}
-	}, x = {
+	}, b = {
 		get value() {
 			let t = e.activeConsumer;
-			if (t && t !== b) {
-				h.add(t), t.dependencies.add(b);
-				let e = b.depth || 1, n = t._node || t;
-				n.depth !== void 0 && e >= n.depth && (n.depth = e + 1), t.activeRunId !== void 0 && (b._lastSeenInRunId = t.activeRunId);
+			if (t && t !== y) {
+				m.add(t), t.dependencies.add(y);
+				let e = y.depth || 1, n = t._node || t;
+				n.depth !== void 0 && e >= n.depth && (n.depth = e + 1), t.activeRunId !== void 0 && (y._lastSeenInRunId = t.activeRunId);
 			}
-			return v(b), t && t.depVersions && t.depVersions.set(x, c), o;
+			return _(y), t && t.depVersions && t.depVersions.set(b, s), a;
 		},
 		get valueWithoutTracking() {
-			return o;
+			return a;
 		},
 		get version() {
-			return c;
+			return s;
 		},
 		get dependencies() {
-			return f;
+			return d;
 		},
 		subscribe(t) {
 			let n = {
@@ -133,21 +135,21 @@ function e(e, t, n) {
 				type: "effect",
 				run: () => {
 					if (!n.isDisposed) try {
-						t(x.value);
+						t(b.value);
 					} catch (e) {
 						console.error(e);
 					}
 				}
 			};
-			return h.add(n), t(x.value), () => {
-				n.isDisposed = !0, h.delete(n);
+			return m.add(n), t(b.value), () => {
+				n.isDisposed = !0, m.delete(n);
 			};
 		},
 		subscribeState(e) {
-			return x.subscribe(e);
+			return b.subscribe(e);
 		},
 		destroy: () => {
-			h.clear(), g(b), e.batchComputedCache && e.batchComputedCache.delete(i), e.computedCache.delete(t), s = !0, d = 2, l = !1;
+			h(y), m && m.clear(), e.computedCache.delete(t), e.batchComputedCache && e.batchComputedCache.delete(i), o = !0, u = 2, c = !1;
 		},
 		__subscribe(t) {
 			let n = {
@@ -156,12 +158,12 @@ function e(e, t, n) {
 				run: t,
 				isDirty: !1
 			};
-			return h.add(n), () => {
-				h.delete(n);
+			return m.add(n), () => {
+				m.delete(n);
 			};
 		}
 	};
-	return x._node = b, x.subscribers = h, x._isDirty = () => d > 0, x.type = "computed", x.run = () => b.run(), e.computedCache.set(t, x), e.computedStringCache.set(i, x), x;
+	return b.run = () => y.run(), e.computedCache.set(t, b), b._node = y, b.subscribers = m, e.batchDepth > 0 && e.batchComputedCache && e.batchComputedCache.set(i, b), b;
 }
 //#endregion
 export { e as createComputed };

package/dist/core.method.computed.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"core.method.computed.mjs","names":[],"sources":["../src/core/core.method.computed.ts"],"sourcesContent":["import { Computed, CleanupFn } from './types'\n\nexport function createComputed<T>(\n  engine: any,\n  fn: () => T,\n  signalName?: string\n): Computed<T> {\n  // 1. Быстрый канонический WeakMap путь (по ссылке на функцию)\n  const existing = engine.computedCache.get(fn)\n  if (existing) return existing as Computed<T>\n\n  // 2. ⚡ ИНСТАНС-СКОУПЕД СТРОКОВЫЙ КЭШ (Оптимизация аллокаций V8):\n  // Переиспользуем ноды по сигнатуре исходного кода для спасения кучи от Churn-эффекта.\n  // Защищен от утечек, так как очищается целиком при сбросе ядра между тестами.\n  const cacheKey = fn.toString()\n  if (!engine.computedStringCache) {\n    engine.computedStringCache = new Map<string, any>()\n  }\n  const cachedNode = engine.computedStringCache.get(cacheKey)\n  if (cachedNode) {\n    return cachedNode as Computed<T>\n  }\n\n  let value: T\n  let isDirty = true\n  let version = 0\n  let isInitialized = false\n  let evaluatedInEpoch = -1\n  let state = 2 // 2 = DIRTY, 1 = CHECK, 0 = STABLE\n\n  const dependencies = new Set<any>()\n  const depVersions = new Map<any, number>()\n  const ownedEffects = new Set<any>()\n  const subscribers = new Set<any>()\n\n  const releaseNode = (node: any): void => {\n    if (!node) return\n    const actNode = node._node || node\n\n    if (actNode.dependencies && actNode.dependencies.size > 0) {\n      for (const unknownDep of actNode.dependencies) {\n        const dep = unknownDep as any\n        const rawDepNode = dep._node || dep\n\n        if (rawDepNode.subscribers) {\n          rawDepNode.subscribers.delete(actNode)\n          rawDepNode.subscribers.delete(node)\n          rawDepNode.subscribers.delete(computedNode)\n\n          if (rawDepNode.type === 'computed' && rawDepNode.subscribers.size === 0) {\n            releaseNode(rawDepNode)\n          }\n        }\n      }\n      actNode.dependencies.clear()\n      if (actNode.depVersions) actNode.depVersions.clear()\n    }\n  }\n\n  let verifiedInEpoch = -1\n\n  const updateIfNecessary = (node: any): boolean => {\n    if (!isInitialized || state === 2) {\n      return node.run()\n    }\n\n    if (verifiedInEpoch === engine.epoch && engine.batchDepth === 0) {\n      return false\n    }\n\n    let hasChangedParent = false\n\n    if (dependencies && dependencies.size > 0) {\n      for (const dep of dependencies) {\n        const rawDep = dep._node || dep\n\n        if (rawDep.type === 'computed') {\n          if (rawDep.update) rawDep.update()\n        }\n\n        // Если родительский сигнал мутировал в текущем батче или версии разошлись\n        if (dep.hasBatchValue || depVersions.get(dep) !== rawDep.version) {\n          hasChangedParent = true\n          break\n        }\n      }\n    }\n\n    verifiedInEpoch = engine.epoch\n\n    if (hasChangedParent || isDirty) {\n      return node.run()\n    }\n\n    state = 0\n    return false\n  }\n\n  let currentRunId = 0\n\n  const computedNode: any = {\n    id: engine.subscriberId++,\n    dependencies,\n    subscribers,\n    ownedEffects,\n    depth: 1,\n    type: 'computed',\n    fn,\n    get version() { return version },\n    get state() { return state },\n    set state(val: number) { state = val },\n    get depVersions() { return depVersions },\n    update: () => updateIfNecessary(computedNode),\n    run: () => {\n      if (evaluatedInEpoch === engine.epoch && isInitialized && state === 0 && engine.batchDepth === 0) {\n        return false\n      }\n      evaluatedInEpoch = engine.epoch\n      verifiedInEpoch = engine.epoch\n\n      if (engine.cycleDetectionStack.has(computedNode)) {\n        throw new Error('[Graph Error] Cyclic dependency detected')\n      }\n      engine.cycleDetectionStack.add(computedNode)\n\n      const prevConsumer = engine.activeConsumer\n      const prevOwner = engine.activeOwner\n\n      engine.activeConsumer = computedNode\n      engine.activeOwner = computedNode\n\n      currentRunId++\n      computedNode.activeRunId = currentRunId\n\n      const oldDeps = dependencies.size > 0 ? Array.from(dependencies) : null\n      dependencies.clear()\n\n      try {\n        if (ownedEffects.size > 0) {\n          for (const child of ownedEffects) {\n            if (child && typeof child.dispose === 'function') {\n              child.dispose()\n            }\n          }\n          ownedEffects.clear()\n        }\n\n        const newValue = fn()\n\n        if (oldDeps !== null) {\n          const isSizeIdentical = oldDeps.length === dependencies.size\n          for (const unknownDep of oldDeps) {\n            const dep = unknownDep as any\n            if (!isSizeIdentical || !dependencies.has(dep)) {\n              const rawDepNode = dep._node || dep\n              if (rawDepNode.subscribers) rawDepNode.subscribers.delete(computedNode)\n              depVersions.delete(dep)\n            }\n          }\n        }\n\n        const changed = isDirty || !Object.is(value, newValue)\n\n        if (changed) {\n          const previousValueSnapshot = isDirty ? undefined : (typeof value === 'object' && value !== null ? JSON.parse(JSON.stringify(value)) : value)\n          value = newValue\n          version++\n\n          if (engine.log && signalName) {\n            engine.log({\n              type: 'computed',\n              label: signalName,\n              details: { from: previousValueSnapshot, to: newValue }\n            })\n          }\n        }\n\n        isDirty = false\n        state = 0\n        isInitialized = true\n\n        let maxDepDepth = 0\n        for (const unknownDep of dependencies) {\n          const dep = unknownDep as any\n          const rawNode = dep._node || dep\n          depVersions.set(dep, rawNode.version)\n          if (rawNode.subscribers) rawNode.subscribers.add(computedNode)\n          if (rawNode.depth !== undefined && rawNode.depth > maxDepDepth) {\n            maxDepDepth = rawNode.depth\n          }\n        }\n\n        computedNode.depth = maxDepDepth + 1\n        return changed\n      } finally {\n        engine.activeConsumer = prevConsumer\n        engine.activeOwner = prevOwner\n        engine.cycleDetectionStack.delete(computedNode)\n      }\n    },\n    markDirty: (parentState: number) => {\n      if (state >= parentState) return\n      state = parentState\n\n      for (const sub of subscribers) {\n        const rawSub = sub._node || sub\n        if (rawSub.type === 'effect') {\n          rawSub.isDirty = true\n          engine.scheduleEffect(sub)\n        } else if (rawSub.markDirty) {\n          rawSub.markDirty(1)\n        }\n      }\n    }\n  }\n\n  const computedInstance: Computed<T> = {\n    get value() {\n      const consumer = engine.activeConsumer\n      if (consumer && consumer !== computedNode) {\n        subscribers.add(consumer)\n        consumer.dependencies.add(computedNode)\n\n        const currentDepth = computedNode.depth || 1\n        const consumerRaw = consumer._node || consumer\n        if (consumerRaw.depth !== undefined && currentDepth >= consumerRaw.depth) {\n          consumerRaw.depth = currentDepth + 1\n        }\n\n        if (consumer.activeRunId !== undefined) {\n          computedNode._lastSeenInRunId = consumer.activeRunId\n        }\n      }\n\n      updateIfNecessary(computedNode)\n\n      if (consumer && consumer.depVersions) {\n        consumer.depVersions.set(computedInstance, version)\n      }\n      return value\n    },\n    get valueWithoutTracking() { return value },\n    get version() { return version },\n    get dependencies() { return dependencies },\n\n    subscribe(cb: (val: T) => void): CleanupFn {\n      const fakeEffect: any = {\n        id: engine.subscriberId++,\n        isDirty: true,\n        depth: 9999,\n        dependencies: new Set(),\n        type: 'effect',\n        run: () => {\n          if (fakeEffect.isDisposed) return\n          try { cb(computedInstance.value) } catch (err) { console.error(err) }\n        }\n      }\n      subscribers.add(fakeEffect)\n      cb(computedInstance.value)\n      return () => {\n        fakeEffect.isDisposed = true\n        subscribers.delete(fakeEffect)\n      }\n    },\n    subscribeState(cb: () => void): CleanupFn {\n      return (computedInstance as any).subscribe(cb)\n    },\n    destroy: () => {\n      subscribers.clear()\n      releaseNode(computedNode)\n      if (engine.batchComputedCache) {\n        engine.batchComputedCache.delete(cacheKey)\n      }\n      engine.computedCache.delete(fn)\n      isDirty = true\n      state = 2\n      isInitialized = false\n    },\n    __subscribe(cb: () => void): CleanupFn {\n      const hookEffect: any = {\n        id: engine.subscriberId++,\n        type: 'effect',\n        run: cb,\n        isDirty: false\n      }\n      subscribers.add(hookEffect)\n      return () => {\n        subscribers.delete(hookEffect)\n      }\n    }\n  } as any\n\n  ;(computedInstance as any)._node = computedNode\n  ;(computedInstance as any).subscribers = subscribers\n  computedInstance._isDirty = () => state > 0\n  computedInstance.type = 'computed'\n  computedInstance.run = () => computedNode.run()\n\n  engine.computedCache.set(fn, computedInstance)\n  engine.computedStringCache.set(cacheKey, computedInstance)\n\n  return computedInstance\n}\n"],"mappings":";AAEA,SAAgB,EACd,GACA,GACA,GACa;CAEb,IAAM,IAAW,EAAO,cAAc,IAAI,CAAE;CAC5C,IAAI,GAAU,OAAO;CAKrB,IAAM,IAAW,EAAG,SAAS;CAC7B,AACE,EAAO,wCAAsB,IAAI,IAAiB;CAEpD,IAAM,IAAa,EAAO,oBAAoB,IAAI,CAAQ;CAC1D,IAAI,GACF,OAAO;CAGT,IAAI,GACA,IAAU,IACV,IAAU,GACV,IAAgB,IAChB,IAAmB,IACnB,IAAQ,GAEN,oBAAe,IAAI,IAAS,GAC5B,oBAAc,IAAI,IAAiB,GACnC,oBAAe,IAAI,IAAS,GAC5B,oBAAc,IAAI,IAAS,GAE3B,KAAe,MAAoB;EACvC,IAAI,CAAC,GAAM;EACX,IAAM,IAAU,EAAK,SAAS;EAE9B,IAAI,EAAQ,gBAAgB,EAAQ,aAAa,OAAO,GAAG;GACzD,KAAK,IAAM,KAAc,EAAQ,cAAc;IAC7C,IAAM,IAAM,GACN,IAAa,EAAI,SAAS;IAEhC,AAAI,EAAW,gBACb,EAAW,YAAY,OAAO,CAAO,GACrC,EAAW,YAAY,OAAO,CAAI,GAClC,EAAW,YAAY,OAAO,CAAY,GAEtC,EAAW,SAAS,cAAc,EAAW,YAAY,SAAS,KACpE,EAAY,CAAU;GAG5B;GAEA,AADA,EAAQ,aAAa,MAAM,GACvB,EAAQ,eAAa,EAAQ,YAAY,MAAM;EACrD;CACF,GAEI,IAAkB,IAEhB,KAAqB,MAAuB;EAChD,IAAI,CAAC,KAAiB,MAAU,GAC9B,OAAO,EAAK,IAAI;EAGlB,IAAI,MAAoB,EAAO,SAAS,EAAO,eAAe,GAC5D,OAAO;EAGT,IAAI,IAAmB;EAEvB,IAAI,KAAgB,EAAa,OAAO,GACtC,KAAK,IAAM,KAAO,GAAc;GAC9B,IAAM,IAAS,EAAI,SAAS;GAO5B,IALI,EAAO,SAAS,cACd,EAAO,UAAQ,EAAO,OAAO,GAI/B,EAAI,iBAAiB,EAAY,IAAI,CAAG,MAAM,EAAO,SAAS;IAChE,IAAmB;IACnB;GACF;EACF;EAUF,OAPA,IAAkB,EAAO,OAErB,KAAoB,IACf,EAAK,IAAI,KAGlB,IAAQ,GACD;CACT,GAEI,IAAe,GAEb,IAAoB;EACxB,IAAI,EAAO;EACX;EACA;EACA;EACA,OAAO;EACP,MAAM;EACN;EACA,IAAI,UAAU;GAAE,OAAO;EAAQ;EAC/B,IAAI,QAAQ;GAAE,OAAO;EAAM;EAC3B,IAAI,MAAM,GAAa;GAAE,IAAQ;EAAI;EACrC,IAAI,cAAc;GAAE,OAAO;EAAY;EACvC,cAAc,EAAkB,CAAY;EAC5C,WAAW;GACT,IAAI,MAAqB,EAAO,SAAS,KAAiB,MAAU,KAAK,EAAO,eAAe,GAC7F,OAAO;GAKT,IAHA,IAAmB,EAAO,OAC1B,IAAkB,EAAO,OAErB,EAAO,oBAAoB,IAAI,CAAY,GAC7C,MAAU,MAAM,0CAA0C;GAE5D,EAAO,oBAAoB,IAAI,CAAY;GAE3C,IAAM,IAAe,EAAO,gBACtB,IAAY,EAAO;GAMzB,AAJA,EAAO,iBAAiB,GACxB,EAAO,cAAc,GAErB,KACA,EAAa,cAAc;GAE3B,IAAM,IAAU,EAAa,OAAO,IAAI,MAAM,KAAK,CAAY,IAAI;GACnE,EAAa,MAAM;GAEnB,IAAI;IACF,IAAI,EAAa,OAAO,GAAG;KACzB,KAAK,IAAM,KAAS,GAClB,AAAI,KAAS,OAAO,EAAM,WAAY,cACpC,EAAM,QAAQ;KAGlB,EAAa,MAAM;IACrB;IAEA,IAAM,IAAW,EAAG;IAEpB,IAAI,MAAY,MAAM;KACpB,IAAM,IAAkB,EAAQ,WAAW,EAAa;KACxD,KAAK,IAAM,KAAc,GAAS;MAChC,IAAM,IAAM;MACZ,IAAI,CAAC,KAAmB,CAAC,EAAa,IAAI,CAAG,GAAG;OAC9C,IAAM,IAAa,EAAI,SAAS;OAEhC,AADI,EAAW,eAAa,EAAW,YAAY,OAAO,CAAY,GACtE,EAAY,OAAO,CAAG;MACxB;KACF;IACF;IAEA,IAAM,IAAU,KAAW,CAAC,OAAO,GAAG,GAAO,CAAQ;IAErD,IAAI,GAAS;KACX,IAAM,IAAwB,IAAU,KAAA,IAAa,OAAO,KAAU,YAAY,IAAiB,KAAK,MAAM,KAAK,UAAU,CAAK,CAAC,IAAI;KAIvI,AAHA,IAAQ,GACR,KAEI,EAAO,OAAO,KAChB,EAAO,IAAI;MACT,MAAM;MACN,OAAO;MACP,SAAS;OAAE,MAAM;OAAuB,IAAI;MAAS;KACvD,CAAC;IAEL;IAIA,AAFA,IAAU,IACV,IAAQ,GACR,IAAgB;IAEhB,IAAI,IAAc;IAClB,KAAK,IAAM,KAAc,GAAc;KACrC,IAAM,IAAM,GACN,IAAU,EAAI,SAAS;KAG7B,AAFA,EAAY,IAAI,GAAK,EAAQ,OAAO,GAChC,EAAQ,eAAa,EAAQ,YAAY,IAAI,CAAY,GACzD,EAAQ,UAAU,KAAA,KAAa,EAAQ,QAAQ,MACjD,IAAc,EAAQ;IAE1B;IAGA,OADA,EAAa,QAAQ,IAAc,GAC5B;GACT,UAAU;IAGR,AAFA,EAAO,iBAAiB,GACxB,EAAO,cAAc,GACrB,EAAO,oBAAoB,OAAO,CAAY;GAChD;EACF;EACA,YAAY,MAAwB;GAC9B,WAAS,IACb;QAAQ;IAER,KAAK,IAAM,KAAO,GAAa;KAC7B,IAAM,IAAS,EAAI,SAAS;KAC5B,AAAI,EAAO,SAAS,YAClB,EAAO,UAAU,IACjB,EAAO,eAAe,CAAG,KAChB,EAAO,aAChB,EAAO,UAAU,CAAC;IAEtB;GAVQ;EAWV;CACF,GAEM,IAAgC;EACpC,IAAI,QAAQ;GACV,IAAM,IAAW,EAAO;GACxB,IAAI,KAAY,MAAa,GAAc;IAEzC,AADA,EAAY,IAAI,CAAQ,GACxB,EAAS,aAAa,IAAI,CAAY;IAEtC,IAAM,IAAe,EAAa,SAAS,GACrC,IAAc,EAAS,SAAS;IAKtC,AAJI,EAAY,UAAU,KAAA,KAAa,KAAgB,EAAY,UACjE,EAAY,QAAQ,IAAe,IAGjC,EAAS,gBAAgB,KAAA,MAC3B,EAAa,mBAAmB,EAAS;GAE7C;GAOA,OALA,EAAkB,CAAY,GAE1B,KAAY,EAAS,eACvB,EAAS,YAAY,IAAI,GAAkB,CAAO,GAE7C;EACT;EACA,IAAI,uBAAuB;GAAE,OAAO;EAAM;EAC1C,IAAI,UAAU;GAAE,OAAO;EAAQ;EAC/B,IAAI,eAAe;GAAE,OAAO;EAAa;EAEzC,UAAU,GAAiC;GACzC,IAAM,IAAkB;IACtB,IAAI,EAAO;IACX,SAAS;IACT,OAAO;IACP,8BAAc,IAAI,IAAI;IACtB,MAAM;IACN,WAAW;KACL,OAAW,YACf,IAAI;MAAE,EAAG,EAAiB,KAAK;KAAE,SAAS,GAAK;MAAE,QAAQ,MAAM,CAAG;KAAE;IACtE;GACF;GAGA,OAFA,EAAY,IAAI,CAAU,GAC1B,EAAG,EAAiB,KAAK,SACZ;IAEX,AADA,EAAW,aAAa,IACxB,EAAY,OAAO,CAAU;GAC/B;EACF;EACA,eAAe,GAA2B;GACxC,OAAQ,EAAyB,UAAU,CAAE;EAC/C;EACA,eAAe;GASb,AARA,EAAY,MAAM,GAClB,EAAY,CAAY,GACpB,EAAO,sBACT,EAAO,mBAAmB,OAAO,CAAQ,GAE3C,EAAO,cAAc,OAAO,CAAE,GAC9B,IAAU,IACV,IAAQ,GACR,IAAgB;EAClB;EACA,YAAY,GAA2B;GACrC,IAAM,IAAkB;IACtB,IAAI,EAAO;IACX,MAAM;IACN,KAAK;IACL,SAAS;GACX;GAEA,OADA,EAAY,IAAI,CAAU,SACb;IACX,EAAY,OAAO,CAAU;GAC/B;EACF;CACF;CAWA,OATC,EAA0B,QAAQ,GAClC,EAA0B,cAAc,GACzC,EAAiB,iBAAiB,IAAQ,GAC1C,EAAiB,OAAO,YACxB,EAAiB,YAAY,EAAa,IAAI,GAE9C,EAAO,cAAc,IAAI,GAAI,CAAgB,GAC7C,EAAO,oBAAoB,IAAI,GAAU,CAAgB,GAElD;AACT"}
+{"version":3,"file":"core.method.computed.mjs","names":[],"sources":["../src/core/core.method.computed.ts"],"sourcesContent":["import { Computed, CleanupFn } from './types'\n\nexport function createComputed<T>(\n  engine: any,\n  fn: () => T,\n  signalName?: string\n): Computed<T> {\n  // 1. Быстрый канонический WeakMap путь (по ссылке на функцию)\n  const existing = engine.computedCache.get(fn)\n  if (existing) return existing as Computed<T>\n\n  // 2. ⚡ БЕЗОПАСНЫЙ ТРАНЗАКЦИОННЫЙ СТРОКОВЫЙ КЭШ:\n  // Переиспользуем ноды по сигнатуре только внутри ОДНОГО батча (цикла генерации графа).\n  const cacheKey = fn.toString()\n  if (engine.batchDepth > 0) {\n    if (!engine.batchComputedCache) {\n      engine.batchComputedCache = new Map<string, any>()\n    }\n    const cachedNode = engine.batchComputedCache.get(cacheKey)\n    if (cachedNode) {\n      return cachedNode as Computed<T>\n    }\n  }\n\n  let value: T\n  let isDirty = true\n  let version = 0\n  let isInitialized = false\n  let evaluatedInEpoch = -1\n  let state = 2 // 2 = DIRTY, 1 = CHECK, 0 = STABLE\n\n  const dependencies = new Set<any>()\n  const depVersions = new Map<any, number>()\n  const ownedEffects = new Set<any>()\n  const subscribers = new Set<any>()\n\n  const releaseNode = (node: any): void => {\n    if (!node) return\n    // Строго извлекаем внутреннее ядро ноды\n    const actNode = node._node || node\n\n    if (actNode.dependencies && actNode.dependencies.size > 0) {\n      for (const unknownDep of actNode.dependencies) {\n        const dep = unknownDep as any\n        const rawDepNode = dep._node || dep\n\n        if (rawDepNode.subscribers) {\n          // Удаляем связи, не затирая сами объекты\n          rawDepNode.subscribers.delete(actNode)\n          rawDepNode.subscribers.delete(node)\n          rawDepNode.subscribers.delete(computedNode)\n\n          // ⚡ БЕЗОПАСНЫЙ КАСКАДНЫЙ ПЕРЕХОД:\n          // Передаем в рекурсию строго внутренний приватный computedNode (rawDepNode),\n          // чтобы V8 распутывал граф без зануления внешних инстансов прокси\n          if (rawDepNode.type === 'computed' && rawDepNode.subscribers.size === 0) {\n            releaseNode(rawDepNode)\n          }\n        }\n      }\n      actNode.dependencies.clear()\n      if (actNode.depVersions) actNode.depVersions.clear()\n    }\n  }\n\n  let verifiedInEpoch = -1\n\n  const updateIfNecessary = (node: any): boolean => {\n    if (!isInitialized || state === 2) {\n      return node.run()\n    }\n\n    if (verifiedInEpoch === engine.epoch && engine.batchDepth === 0) {\n      return false\n    }\n\n    let hasChangedParent = false\n\n    if (dependencies && dependencies.size > 0) {\n      for (const dep of dependencies) {\n        const rawDep = dep._node || dep\n\n        if (rawDep.type === 'computed') {\n          if (rawDep.update) rawDep.update()\n        }\n\n        // Если родительский сигнал мутировал в текущем батче или версии разошлись\n        if (dep.hasBatchValue || depVersions.get(dep) !== rawDep.version) {\n          hasChangedParent = true\n          break\n        }\n      }\n    }\n\n    verifiedInEpoch = engine.epoch\n\n    if (hasChangedParent || isDirty) {\n      return node.run()\n    }\n\n    state = 0\n    return false\n  }\n\n  let currentRunId = 0\n\n  const computedNode: any = {\n    id: engine.subscriberId++,\n    dependencies,\n    subscribers,\n    ownedEffects,\n    depth: 1,\n    type: 'computed',\n    fn,\n    get version() { return version },\n    get state() { return state },\n    set state(val: number) { state = val },\n    get depVersions() { return depVersions },\n    update: () => updateIfNecessary(computedNode),\n    run: () => {\n      if (evaluatedInEpoch === engine.epoch && isInitialized && state === 0 && engine.batchDepth === 0) {\n        return false\n      }\n      evaluatedInEpoch = engine.epoch\n      verifiedInEpoch = engine.epoch\n\n      if (engine.cycleDetectionStack.has(computedNode)) {\n        throw new Error('[Graph Error] Cyclic dependency detected')\n      }\n      engine.cycleDetectionStack.add(computedNode)\n\n      const prevConsumer = engine.activeConsumer\n      const prevOwner = engine.activeOwner\n\n      engine.activeConsumer = computedNode\n      engine.activeOwner = computedNode\n\n      currentRunId++\n      computedNode.activeRunId = currentRunId\n\n      const oldDeps = dependencies.size > 0 ? Array.from(dependencies) : null\n      dependencies.clear()\n\n      try {\n        if (ownedEffects.size > 0) {\n          for (const child of ownedEffects) {\n            if (child && typeof child.dispose === 'function') {\n              child.dispose()\n            }\n          }\n          ownedEffects.clear()\n        }\n\n        const newValue = fn()\n\n        if (oldDeps !== null) {\n          const isSizeIdentical = oldDeps.length === dependencies.size\n          for (const unknownDep of oldDeps) {\n            const dep = unknownDep as any\n            if (!isSizeIdentical || !dependencies.has(dep)) {\n              const rawDepNode = dep._node || dep\n              if (rawDepNode.subscribers) rawDepNode.subscribers.delete(computedNode)\n              depVersions.delete(dep)\n            }\n          }\n        }\n\n        const changed = isDirty || !Object.is(value, newValue)\n\n        if (changed) {\n          const previousValueSnapshot = isDirty ? undefined : (typeof value === 'object' && value !== null ? JSON.parse(JSON.stringify(value)) : value)\n          value = newValue\n          version++\n\n          if (engine.log && signalName) {\n            engine.log({\n              type: 'computed',\n              label: signalName,\n              details: { from: previousValueSnapshot, to: newValue }\n            })\n          }\n        }\n\n        isDirty = false\n        state = 0\n        isInitialized = true\n\n        let maxDepDepth = 0\n        for (const unknownDep of dependencies) {\n          const dep = unknownDep as any\n          const rawNode = dep._node || dep\n          depVersions.set(dep, rawNode.version)\n          if (rawNode.subscribers) rawNode.subscribers.add(computedNode)\n          if (rawNode.depth !== undefined && rawNode.depth > maxDepDepth) {\n            maxDepDepth = rawNode.depth\n          }\n        }\n\n        computedNode.depth = maxDepDepth + 1\n        return changed\n      } finally {\n        engine.activeConsumer = prevConsumer\n        engine.activeOwner = prevOwner\n        engine.cycleDetectionStack.delete(computedNode)\n      }\n    },\n    markDirty: (parentState: number) => {\n      if (state >= parentState) return\n      state = parentState\n\n      for (const sub of subscribers) {\n        const rawSub = sub._node || sub\n        if (rawSub.type === 'effect') {\n          rawSub.isDirty = true\n          engine.scheduleEffect(sub)\n        } else if (rawSub.markDirty) {\n          rawSub.markDirty(1)\n        }\n      }\n    }\n  }\n\n  const computedInstance: Computed<T> = {\n    get value() {\n      const consumer = engine.activeConsumer\n      if (consumer && consumer !== computedNode) {\n        subscribers.add(consumer)\n        consumer.dependencies.add(computedNode)\n\n        const currentDepth = computedNode.depth || 1\n        const consumerRaw = consumer._node || consumer\n        if (consumerRaw.depth !== undefined && currentDepth >= consumerRaw.depth) {\n          consumerRaw.depth = currentDepth + 1\n        }\n\n        if (consumer.activeRunId !== undefined) {\n          computedNode._lastSeenInRunId = consumer.activeRunId\n        }\n      }\n\n      updateIfNecessary(computedNode)\n\n      if (consumer && consumer.depVersions) {\n        consumer.depVersions.set(computedInstance, version)\n      }\n      return value\n    },\n    get valueWithoutTracking() { return value },\n    get version() { return version },\n    get dependencies() { return dependencies },\n\n    subscribe(cb: (val: T) => void): CleanupFn {\n      const fakeEffect: any = {\n        id: engine.subscriberId++,\n        isDirty: true,\n        depth: 9999,\n        dependencies: new Set(),\n        type: 'effect',\n        run: () => {\n          if (fakeEffect.isDisposed) return\n          try { cb(computedInstance.value) } catch (err) { console.error(err) }\n        }\n      }\n      subscribers.add(fakeEffect)\n      cb(computedInstance.value)\n      return () => {\n        fakeEffect.isDisposed = true\n        subscribers.delete(fakeEffect)\n      }\n    },\n    subscribeState(cb: () => void): CleanupFn {\n      return (computedInstance as any).subscribe(cb)\n    },\n    destroy: () => {\n      // 1. Распутываем зависимости вверх по графу, пока subscribers живы\n      releaseNode(computedNode)\n\n      // 2. Очищаем локальные сеты графа, сохраняя ссылки на сами структуры\n      if (subscribers) subscribers.clear()\n\n      // 3. Вычищаем строго из кэшей\n      engine.computedCache.delete(fn)\n      if (engine.batchComputedCache) {\n        engine.batchComputedCache.delete(cacheKey)\n      }\n\n      // 4. Мягкий сброс флагов вычислений\n      isDirty = true\n      state = 2\n      isInitialized = false\n      // ⚛️ ГАРАНТИЯ СТАБИЛЬНОСТИ: Никаких занулений computedInstance._node = undefined!\n    },\n    __subscribe(cb: () => void): CleanupFn {\n      const hookEffect: any = {\n        id: engine.subscriberId++,\n        type: 'effect',\n        run: cb,\n        isDirty: false\n      }\n      subscribers.add(hookEffect)\n      return () => {\n        subscribers.delete(hookEffect)\n      }\n    }\n  } as any\n\n  computedInstance.run = () => computedNode.run()\n\n  // Сохраняем в канонический кэш\n  engine.computedCache.set(fn, computedInstance)\n\n  ;(computedInstance as any)._node = computedNode\n  ;(computedInstance as any).subscribers = subscribers\n\n  // ⚡ Записываем во временный батч-кэш для оптимизации аллокаций\n  if (engine.batchDepth > 0 && engine.batchComputedCache) {\n    engine.batchComputedCache.set(cacheKey, computedInstance)\n  }\n\n  return computedInstance\n}\n"],"mappings":";AAEA,SAAgB,EACd,GACA,GACA,GACa;CAEb,IAAM,IAAW,EAAO,cAAc,IAAI,CAAE;CAC5C,IAAI,GAAU,OAAO;CAIrB,IAAM,IAAW,EAAG,SAAS;CAC7B,IAAI,EAAO,aAAa,GAAG;EACzB,AACE,EAAO,uCAAqB,IAAI,IAAiB;EAEnD,IAAM,IAAa,EAAO,mBAAmB,IAAI,CAAQ;EACzD,IAAI,GACF,OAAO;CAEX;CAEA,IAAI,GACA,IAAU,IACV,IAAU,GACV,IAAgB,IAChB,IAAmB,IACnB,IAAQ,GAEN,oBAAe,IAAI,IAAS,GAC5B,oBAAc,IAAI,IAAiB,GACnC,oBAAe,IAAI,IAAS,GAC5B,oBAAc,IAAI,IAAS,GAE3B,KAAe,MAAoB;EACvC,IAAI,CAAC,GAAM;EAEX,IAAM,IAAU,EAAK,SAAS;EAE9B,IAAI,EAAQ,gBAAgB,EAAQ,aAAa,OAAO,GAAG;GACzD,KAAK,IAAM,KAAc,EAAQ,cAAc;IAC7C,IAAM,IAAM,GACN,IAAa,EAAI,SAAS;IAEhC,AAAI,EAAW,gBAEb,EAAW,YAAY,OAAO,CAAO,GACrC,EAAW,YAAY,OAAO,CAAI,GAClC,EAAW,YAAY,OAAO,CAAY,GAKtC,EAAW,SAAS,cAAc,EAAW,YAAY,SAAS,KACpE,EAAY,CAAU;GAG5B;GAEA,AADA,EAAQ,aAAa,MAAM,GACvB,EAAQ,eAAa,EAAQ,YAAY,MAAM;EACrD;CACF,GAEI,IAAkB,IAEhB,KAAqB,MAAuB;EAChD,IAAI,CAAC,KAAiB,MAAU,GAC9B,OAAO,EAAK,IAAI;EAGlB,IAAI,MAAoB,EAAO,SAAS,EAAO,eAAe,GAC5D,OAAO;EAGT,IAAI,IAAmB;EAEvB,IAAI,KAAgB,EAAa,OAAO,GACtC,KAAK,IAAM,KAAO,GAAc;GAC9B,IAAM,IAAS,EAAI,SAAS;GAO5B,IALI,EAAO,SAAS,cACd,EAAO,UAAQ,EAAO,OAAO,GAI/B,EAAI,iBAAiB,EAAY,IAAI,CAAG,MAAM,EAAO,SAAS;IAChE,IAAmB;IACnB;GACF;EACF;EAUF,OAPA,IAAkB,EAAO,OAErB,KAAoB,IACf,EAAK,IAAI,KAGlB,IAAQ,GACD;CACT,GAEI,IAAe,GAEb,IAAoB;EACxB,IAAI,EAAO;EACX;EACA;EACA;EACA,OAAO;EACP,MAAM;EACN;EACA,IAAI,UAAU;GAAE,OAAO;EAAQ;EAC/B,IAAI,QAAQ;GAAE,OAAO;EAAM;EAC3B,IAAI,MAAM,GAAa;GAAE,IAAQ;EAAI;EACrC,IAAI,cAAc;GAAE,OAAO;EAAY;EACvC,cAAc,EAAkB,CAAY;EAC5C,WAAW;GACT,IAAI,MAAqB,EAAO,SAAS,KAAiB,MAAU,KAAK,EAAO,eAAe,GAC7F,OAAO;GAKT,IAHA,IAAmB,EAAO,OAC1B,IAAkB,EAAO,OAErB,EAAO,oBAAoB,IAAI,CAAY,GAC7C,MAAU,MAAM,0CAA0C;GAE5D,EAAO,oBAAoB,IAAI,CAAY;GAE3C,IAAM,IAAe,EAAO,gBACtB,IAAY,EAAO;GAMzB,AAJA,EAAO,iBAAiB,GACxB,EAAO,cAAc,GAErB,KACA,EAAa,cAAc;GAE3B,IAAM,IAAU,EAAa,OAAO,IAAI,MAAM,KAAK,CAAY,IAAI;GACnE,EAAa,MAAM;GAEnB,IAAI;IACF,IAAI,EAAa,OAAO,GAAG;KACzB,KAAK,IAAM,KAAS,GAClB,AAAI,KAAS,OAAO,EAAM,WAAY,cACpC,EAAM,QAAQ;KAGlB,EAAa,MAAM;IACrB;IAEA,IAAM,IAAW,EAAG;IAEpB,IAAI,MAAY,MAAM;KACpB,IAAM,IAAkB,EAAQ,WAAW,EAAa;KACxD,KAAK,IAAM,KAAc,GAAS;MAChC,IAAM,IAAM;MACZ,IAAI,CAAC,KAAmB,CAAC,EAAa,IAAI,CAAG,GAAG;OAC9C,IAAM,IAAa,EAAI,SAAS;OAEhC,AADI,EAAW,eAAa,EAAW,YAAY,OAAO,CAAY,GACtE,EAAY,OAAO,CAAG;MACxB;KACF;IACF;IAEA,IAAM,IAAU,KAAW,CAAC,OAAO,GAAG,GAAO,CAAQ;IAErD,IAAI,GAAS;KACX,IAAM,IAAwB,IAAU,KAAA,IAAa,OAAO,KAAU,YAAY,IAAiB,KAAK,MAAM,KAAK,UAAU,CAAK,CAAC,IAAI;KAIvI,AAHA,IAAQ,GACR,KAEI,EAAO,OAAO,KAChB,EAAO,IAAI;MACT,MAAM;MACN,OAAO;MACP,SAAS;OAAE,MAAM;OAAuB,IAAI;MAAS;KACvD,CAAC;IAEL;IAIA,AAFA,IAAU,IACV,IAAQ,GACR,IAAgB;IAEhB,IAAI,IAAc;IAClB,KAAK,IAAM,KAAc,GAAc;KACrC,IAAM,IAAM,GACN,IAAU,EAAI,SAAS;KAG7B,AAFA,EAAY,IAAI,GAAK,EAAQ,OAAO,GAChC,EAAQ,eAAa,EAAQ,YAAY,IAAI,CAAY,GACzD,EAAQ,UAAU,KAAA,KAAa,EAAQ,QAAQ,MACjD,IAAc,EAAQ;IAE1B;IAGA,OADA,EAAa,QAAQ,IAAc,GAC5B;GACT,UAAU;IAGR,AAFA,EAAO,iBAAiB,GACxB,EAAO,cAAc,GACrB,EAAO,oBAAoB,OAAO,CAAY;GAChD;EACF;EACA,YAAY,MAAwB;GAC9B,WAAS,IACb;QAAQ;IAER,KAAK,IAAM,KAAO,GAAa;KAC7B,IAAM,IAAS,EAAI,SAAS;KAC5B,AAAI,EAAO,SAAS,YAClB,EAAO,UAAU,IACjB,EAAO,eAAe,CAAG,KAChB,EAAO,aAChB,EAAO,UAAU,CAAC;IAEtB;GAVQ;EAWV;CACF,GAEM,IAAgC;EACpC,IAAI,QAAQ;GACV,IAAM,IAAW,EAAO;GACxB,IAAI,KAAY,MAAa,GAAc;IAEzC,AADA,EAAY,IAAI,CAAQ,GACxB,EAAS,aAAa,IAAI,CAAY;IAEtC,IAAM,IAAe,EAAa,SAAS,GACrC,IAAc,EAAS,SAAS;IAKtC,AAJI,EAAY,UAAU,KAAA,KAAa,KAAgB,EAAY,UACjE,EAAY,QAAQ,IAAe,IAGjC,EAAS,gBAAgB,KAAA,MAC3B,EAAa,mBAAmB,EAAS;GAE7C;GAOA,OALA,EAAkB,CAAY,GAE1B,KAAY,EAAS,eACvB,EAAS,YAAY,IAAI,GAAkB,CAAO,GAE7C;EACT;EACA,IAAI,uBAAuB;GAAE,OAAO;EAAM;EAC1C,IAAI,UAAU;GAAE,OAAO;EAAQ;EAC/B,IAAI,eAAe;GAAE,OAAO;EAAa;EAEzC,UAAU,GAAiC;GACzC,IAAM,IAAkB;IACtB,IAAI,EAAO;IACX,SAAS;IACT,OAAO;IACP,8BAAc,IAAI,IAAI;IACtB,MAAM;IACN,WAAW;KACL,OAAW,YACf,IAAI;MAAE,EAAG,EAAiB,KAAK;KAAE,SAAS,GAAK;MAAE,QAAQ,MAAM,CAAG;KAAE;IACtE;GACF;GAGA,OAFA,EAAY,IAAI,CAAU,GAC1B,EAAG,EAAiB,KAAK,SACZ;IAEX,AADA,EAAW,aAAa,IACxB,EAAY,OAAO,CAAU;GAC/B;EACF;EACA,eAAe,GAA2B;GACxC,OAAQ,EAAyB,UAAU,CAAE;EAC/C;EACA,eAAe;GAgBb,AAdA,EAAY,CAAY,GAGpB,KAAa,EAAY,MAAM,GAGnC,EAAO,cAAc,OAAO,CAAE,GAC1B,EAAO,sBACT,EAAO,mBAAmB,OAAO,CAAQ,GAI3C,IAAU,IACV,IAAQ,GACR,IAAgB;EAElB;EACA,YAAY,GAA2B;GACrC,IAAM,IAAkB;IACtB,IAAI,EAAO;IACX,MAAM;IACN,KAAK;IACL,SAAS;GACX;GAEA,OADA,EAAY,IAAI,CAAU,SACb;IACX,EAAY,OAAO,CAAU;GAC/B;EACF;CACF;CAeA,OAbA,EAAiB,YAAY,EAAa,IAAI,GAG9C,EAAO,cAAc,IAAI,GAAI,CAAgB,GAE5C,EAA0B,QAAQ,GAClC,EAA0B,cAAc,GAGrC,EAAO,aAAa,KAAK,EAAO,sBAClC,EAAO,mBAAmB,IAAI,GAAU,CAAgB,GAGnD;AACT"}