@pravosleva/reactive-engine 2.6.4-alpha.9 → 2.7.0-beta.0

package/README.md

@@ -213,7 +213,7 @@ Copying external async state directly into local mutable signals introduces sync
 // ❌ Mirroring Trap (Causes redundant pushes & recursion)
 engine.effect(() => {
   const data = apiResource.data
-  if (data) localSignal.value = data 
+  if (data) localSignal.value = data
 })
 
 // 🟢 Canonical Pattern (Pure Lazy Derivation)
@@ -229,7 +229,7 @@ To eliminate parent re-renders in deep form trees, push state subscriptions down
 ## Architecture-Grade Form Wizard (Example 254)
 This enterprise-ready multi-step form implementation demonstrates absolute separation of concerns: state, cross-step validation schemas, and API fetch mechanics are completely decoupled from React.
 
-1. Action Validation Decorators (`withValidation.ts`)
+1. Action Validation Decorators (`withValidationSync.ts`)
 ```ts
 import { Signal } from '@pravosleva/reactive-engine'
 
@@ -242,7 +242,7 @@ export interface ValidationOptions<T> {
   errorsSignal: Signal<Record<string, string>>
 }
 
-export const withValidation = <T, Args extends any[], R>(
+export const withValidationSync = <T, Args extends any[], R>(
   targetAction: (...args: Args) => R,
   options: ValidationOptions<T>
 ) => {
@@ -269,7 +269,7 @@ export const withValidation = <T, Args extends any[], R>(
   }
 }
 
-export const withResourceValidation = <S, T>(
+export const withValidationAsync = <S, T>(
   fetcher: (source: S, signal: AbortSignal) => Promise<T>,
   options: ValidationOptions<S>
 ) => {
@@ -299,7 +299,7 @@ export const withResourceValidation = <S, T>(
 2. Domain & Validation Service (`FormWizardLogic.ts`)
 ```tsx
 import { AbstractService } from '@pravosleva/reactive-engine'
-import { withValidation, withResourceValidation, ValidationSchema } from './withValidation'
+import { withValidationSync, withValidationAsync, ValidationSchema } from './withValidation'
 
 export interface WizardState {
   step: number
@@ -345,15 +345,15 @@ export class FormWizardLogic extends AbstractService {
   private profileSource = this.engine.computed(() => this.formData.profile)
 
   public nextToProfileStep = () => {
-    const action = withValidation(() => {
+    const action = withValidationSync(() => {
       this.currentStep.value = 2
     }, { schema: this.accountSchema, errorsSignal: this.errors })
-    
+
     action(this.formData.account)
   }
 
   public submitWizardForm = this.engine.resource(
-    withResourceValidation(
+    withValidationAsync(
       async (profileData, abortSignal) => {
         return this.api.submitWizard(profileData)
       },

package/dist/core/core.d.ts

@@ -26,6 +26,7 @@ export declare class ReactiveEngineCore {
     private cycleDetectionStack;
     batchedSignals: Set<any>;
     activeOwner: any;
+    activeCleanupNode: any;
     pendingCleanups: Set<() => void>;
     queueCleanup(cleanup: () => void): void;
     constructor(options?: {
@@ -40,7 +41,111 @@ export declare class ReactiveEngineCore {
     batch<T>(fn: () => T): T;
     flushEffects(): void;
     log(params: any): void;
+    /**
+     * Создает новый реактивный сигнал с заданным начальным значением и опциями.
+     *
+     * @template T Тип значения сигнала.
+     * @param initialValue Начальное значение сигнала.
+     * @param optionsOrName Конфигурационные параметры сигнала или его имя.
+     * @param optionsOrName.name Уникальное текстовое имя сигнала для отладки и вывода в транзакционный логгер.
+     * @param optionsOrName.validate Пользовательская функция валидации значения, возвращающая true/false или строку ошибки.
+     *
+     * @method signal
+     * @memberof ReactiveEngine
+     *
+     * @example
+     * // Пример 1: Чистый TypeScript (Базовый)
+     * const engine = new ReactiveEngineCore();
+     * const counter = engine.signal(0, { name: 'counter' });
+     * console.log(counter.value); // 0
+     * counter.value = 1;
+     * console.log(counter.value); // 1
+     *
+     * @example
+     * // Пример 2: Чистый TypeScript (Продвинутый с валидацией)
+     * interface User { id: number; name: string; }
+     * const engine = new ReactiveEngineCore();
+     * const userSignal = engine.signal<User>({ id: 1, name: 'John Doe' }, {
+     *   name: 'user',
+     *   validate: (user) => user.id > 0 && typeof user.name === 'string'
+     * });
+     * userSignal.value = { id: -1, name: 'Jane Doe' }; // Ошибка валидации
+     *
+     * @example
+     * // Пример 3: Интеграция с React (через DI контейнер)
+     * interface User { id: number; name: string; }
+     * class UserService {
+     *   constructor(engine: ReactiveEngineCore) {
+     *     this.mySignal = engine.signal<User>({ id: 1, name: 'John Doe' }, { name: 'userSignal' });
+     *   }
+     *
+     *   mySignal: Signal<User>;
+     * }
+     *
+     * const engine = new ReactiveEngineCore();
+     * engine.provide(UserService, UserService);
+     * const logic = engine.inject(UserService);
+     *
+     * function MyComponent() {
+     *   const user = useReactiveValue(logic.mySignal);
+     *   return <div>{user.name}</div>;
+     * }
+     */
     signal<T>(initialValue: T, optionsOrName?: string | SignalOptions<T>): Signal<T>;
+    /**
+     * Создает новое вычисляемое свойство (Computed) на основе чистой функции.
+     *
+     * @template T Тип значения, возвращаемого вычисляемым свойством.
+     * @param fn Чистая функция-вычислитель, которая определяет логику вычисления значения.
+     * @param signalName Опциональное имя сигнала для отладки и вывода в транзакционный логгер.
+     *
+     * @method computed
+     * @memberof ReactiveEngine
+     *
+     * @example
+     * // Пример 1: Чистый TypeScript (Базовый)
+     * const engine = new ReactiveEngineCore();
+     * const counter = engine.signal(0, { name: 'counter' });
+     * const doubleCounter = engine.computed(() => counter.value * 2);
+     * console.log(doubleCounter.value); // 0
+     * counter.value = 1;
+     * console.log(doubleCounter.value); // 2
+     *
+     * @example
+     * // Пример 2: Чистый TypeScript (Продвинутый с цепочкой зависимостей)
+     * interface User { id: number; name: string; }
+     * const engine = new ReactiveEngineCore();
+     * const userSignal = engine.signal<User>({ id: 1, name: 'John Doe' }, { name: 'user' });
+     * const userNameLength = engine.computed(() => userSignal.value.name.length);
+     * const hasLongName = engine.computed(() => userNameLength.value > 5);
+     *
+     * console.log(hasLongName.value); // false
+     * userSignal.value = { id: 1, name: 'Johnathan' };
+     * console.log(userNameLength.value); // 9
+     * console.log(hasLongName.value); // true
+     *
+     * @example
+     * // Пример 3: Интеграция с React (через DI контейнер)
+     * interface User { id: number; name: string; }
+     * class UserService {
+     *   constructor(engine: ReactiveEngineCore) {
+     *     this.userSignal = engine.signal<User>({ id: 1, name: 'John Doe' }, { name: 'userSignal' });
+     *     this.userNameLength = engine.computed(() => this.userSignal.value.name.length);
+     *   }
+     *
+     *   userSignal: Signal<User>;
+     *   userNameLength: Computed<number>;
+     * }
+     *
+     * const engine = new ReactiveEngineCore();
+     * engine.provide(UserService, UserService);
+     * const logic = engine.inject(UserService);
+     *
+     * function MyComponent() {
+     *   const hasLongName = engine.use(logic.userNameLength);
+     *   return <div>{hasLongName ? 'Long name' : 'Short name'}</div>;
+     * }
+     */
     computed<T>(fn: () => T, signalName?: string): Computed<T>;
     effect(fn: () => void | CleanupFn, effectName?: string): () => void;
     untrack<T>(fn: () => T): T;
@@ -51,6 +156,62 @@ export declare class ReactiveEngineCore {
     /**
      * Создает умную реактивную декларативную обертку над асинхронными операциями
      * с автоматическим подавлением Race Conditions и встроенным методом .destroy().
+     *
+     * @template T Тип данных, возвращаемых фетчером после успешного выполнения.
+     * @template S Тип реактивной зависимости (source).
+     * @param fetcher Асинхронная функция, выполняющая запрос и возвращающая данные типа T.
+     * @param source Реактивный сигнал или примитив, предоставляющий источник данных для фетчера.
+     * @param optionsOrName Конфигурационные опции ресурса или его имя.
+     * @param optionsOrName.name Имя ресурса.
+     * @param optionsOrName.resetDataOnSourceChange Флаг, указывающий, следует ли сбрасывать данные при изменении источника.
+     * @param optionsOrName.validateBeforeFetch Функция валидации источника перед выполнением фетча.
+     * @param optionsOrName.responseValidate Функция валидации ответа после выполнения фетча.
+     * @param optionsOrName.timeout Максимальное время ожидания запроса в миллисекундах.
+     * @param optionsOrName.retryCount Количество попыток повторного выполнения запроса в случае ошибки.
+     *
+     * @example
+     * // Пример 1: Чистый TypeScript (Базовый)
+     * interface User { id: number; name: string; }
+     * interface ApiResponse<T> { ok: boolean; message?: string; data: T; }
+     * const engine = new ReactiveEngineCore();
+     * const userSignal = engine.signal<User>({ id: 1, name: 'John Doe' });
+     * const fetchUser = async (source: User, signal: AbortSignal): Promise<ApiResponse<User>> => {
+     *   // Реализация фетча пользователя
+     * };
+     * const userResource = engine.resource(fetchUser, { value: userSignal.value }, { name: 'userResource' });
+     *
+     * @example
+     * // Пример 2: Чистый TypeScript (Продвинутый)
+     * interface User { id: number; name: string; }
+     * interface ApiResponse<T> { ok: boolean; message?: string; data: T; }
+     * const engine = new ReactiveEngineCore();
+     * const userSignal = engine.signal<User>({ id: 1, name: 'John Doe' });
+     * const fetchUser = async (source: User, signal: AbortSignal): Promise<ApiResponse<User>> => {
+     *   // Реализация фетча пользователя с использованием AbortSignal и timeout
+     * };
+     * const userResource = engine.resource(fetchUser, { value: userSignal.value }, {
+     *   name: 'userResource',
+     *   timeout: 5000,
+     *   retryCount: 3,
+     * });
+     *
+     * @example
+     * // Пример 3: Интеграция с React (через DI контейнер)
+     * interface User { id: number; name: string; }
+     * interface ApiResponse<T> { ok: boolean; message?: string; data: T; }
+     * class UserService {
+     *   constructor(engine: ReactiveEngineCore) {
+     *     const userSignal = engine.signal<User>({ id: 1, name: 'John Doe' });
+     *     this.myResource = engine.resource(fetchUser, { value: userSignal.value }, { name: 'userResource' });
+     *   }
+     *
+     *   myResource: Resource<ApiResponse<User>>;
+     * }
+     *
+     * const engine = new ReactiveEngineCore();
+     * engine.provide(UserService, UserService);
+     * const logic = engine.inject(UserService);
+     * const state = useReactiveValue(logic.myResource);
      */
     resource<T, S = void>(fetcher: (source: S, signal: AbortSignal) => Promise<T>, source?: {
         value: S;

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;AAWzL,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;IAC3B,MAAM,EAAE,mBAAmB,CAAA;IAC3B,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;IAmBxB,YAAY,IAAI,IAAI;IAwFpB,GAAG,CAAC,MAAM,EAAE,GAAG;IAKf,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;IAuCtC,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;IAoB5D;;;OAGG;IACI,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;CAIf;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;AAWzL,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;IAC3B,MAAM,EAAE,mBAAmB,CAAA;IAC3B,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;IACvB,iBAAiB,EAAE,GAAG,CAAO;IAE7B,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;IAmBxB,YAAY,IAAI,IAAI;IA4FpB,GAAG,CAAC,MAAM,EAAE,GAAG;IAKtB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAiDG;IACI,MAAM,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,CAAC,EAAE,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAIvF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAqDG;IACI,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;IAuCtC,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;IAoB5D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2DG;IACI,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;CAIf;AAED,OAAO,EAAE,kBAAkB,IAAI,cAAc,EAAE,kBAAkB,IAAI,uBAAuB,EAAE,CAAA"}

package/dist/core/core.effect.test.d.ts

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

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

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

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,CAiVb"}
+{"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,CA8Tb"}

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

@@ -1 +1 @@
-{"version":3,"file":"core.method.effect.d.ts","sourceRoot":"","sources":["../../src/core/core.method.effect.ts"],"names":[],"mappings":"AAAA,OAAO,EAAW,QAAQ,EAAa,MAAM,SAAS,CAAA;AAatD,wBAAgB,YAAY,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,EAAE,QAAQ,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,IAAI,CAuJvF"}
+{"version":3,"file":"core.method.effect.d.ts","sourceRoot":"","sources":["../../src/core/core.method.effect.ts"],"names":[],"mappings":"AAAA,OAAO,EAAW,QAAQ,EAAa,MAAM,SAAS,CAAA;AActD,wBAAgB,YAAY,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,EAAE,QAAQ,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,IAAI,CA2LvF"}

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

@@ -1 +1 @@
-{"version":3,"file":"core.method.signal.d.ts","sourceRoot":"","sources":["../../src/core/core.method.signal.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,SAAS,CAAA;AAE/C,wBAAgB,YAAY,CAAC,CAAC,EAC5B,MAAM,EAAE,GAAG,EACX,YAAY,EAAE,CAAC,EACf,aAAa,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,MAAM,GACxC,MAAM,CAAC,CAAC,CAAC,CAyJX"}
+{"version":3,"file":"core.method.signal.d.ts","sourceRoot":"","sources":["../../src/core/core.method.signal.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,SAAS,CAAA;AAE/C,wBAAgB,YAAY,CAAC,CAAC,EAC5B,MAAM,EAAE,GAAG,EACX,YAAY,EAAE,CAAC,EACf,aAAa,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,MAAM,GACxC,MAAM,CAAC,CAAC,CAAC,CAuKX"}

package/dist/core.method.computed.mjs

@@ -14,6 +14,7 @@ function e(e, t, n) {
 		}
 	}, h = (t) => {
 		if (!s || l === 2) return t.run();
+		if (p && p.size > 0 && t.verifiedInEpoch === e.epoch && e.batchDepth === 0 && l === 0) return !1;
 		let n = !1;
 		if (u && u.size > 0) for (let t of u) {
 			let r = t._node || t;
@@ -22,7 +23,7 @@ function e(e, t, n) {
 				break;
 			}
 		}
-		return n ? (c = -1, t.verifiedInEpoch = -1, t.run()) : p && p.size > 0 && t.verifiedInEpoch === e.epoch && e.batchDepth === 0 && l === 0 ? !1 : a ? t.run() : (t.verifiedInEpoch !== -1 && t.verifiedInEpoch < e.epoch && (!p || p.size === 0) ? t.verifiedInEpoch = -1 : t.verifiedInEpoch = e.epoch, l = 0, !1);
+		return t.verifiedInEpoch = e.epoch, n || a ? t.run() : (l = 0, !1);
 	}, g = 0, _ = {
 		id: e.subscriberId++,
 		dependencies: u,
@@ -110,7 +111,7 @@ function e(e, t, n) {
 				let e = _.depth || 1, n = t._node || t;
 				n.depth !== void 0 && e >= n.depth && (n.depth = e + 1), t.activeRunId !== void 0 && (_._lastSeenInRunId = t.activeRunId);
 			}
-			return (l === 2 || _.verifiedInEpoch !== -1 && _.verifiedInEpoch < e.epoch) && (_.verifiedInEpoch = -1, c = -1), h(_), t && t.depVersions && t.depVersions.set(v, o), i;
+			return h(_), t && t.depVersions && t.depVersions.set(v, o), i;
 		},
 		get valueWithoutTracking() {
 			return i;

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  // Работает со скоростью нативной ссылки в V8, полностью исключая утечки памяти\n  const existing = engine.computedCache.get(fn)\n  if (existing) return existing as Computed<T>\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  const updateIfNecessary = (node: any): boolean => {\n    if (!isInitialized || state === 2) {\n      return node.run()\n    }\n\n    // 1. Сначала честно сканируем родителей по физическим версиям мутаций в V8.\n    // Это единственный способ отловить inner write на фазе ленивого pull-запроса,\n    // так как вложенный сеттер мог сдвинуть версии сигналов в обход markDirty.\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' && rawDep.state > 0) {\n          if (rawDep.update && rawDep.verifiedInEpoch !== engine.epoch) {\n            rawDep.update()\n          }\n        }\n\n        if (dep.hasBatchValue || depVersions.get(dep) !== rawDep.version) {\n          hasChangedParent = true\n          break\n        }\n      }\n    }\n\n    // ⚛️ УЛЬТИМАТИВНЫЙ ФИКС ТЕСТOВ #180 и #186:\n    // Если обход родителей подтвердил изменение версий из побочного канала (hasChangedParent === true),\n    // мы ОБЯЗАНЫ сбросить кэши эпох текущей ноды и пустить её на честный пересчет.\n    // При этом мы НЕ выставляем принудительно state = 2, благодаря чему метод run()\n    // сможет сравнить результаты через Object.is и легитимно остановить волну (Value-Equality Cut)!\n    if (hasChangedParent) {\n      evaluatedInEpoch = -1\n      node.verifiedInEpoch = -1\n      return node.run()\n    }\n\n    // 2. И только если родители НЕ менялись, мы можем применить быстрый O(1) возврат по эпохам\n    if (subscribers && subscribers.size > 0) {\n      if (node.verifiedInEpoch === engine.epoch && engine.batchDepth === 0 && state === 0) {\n        return false\n      }\n    }\n\n    if (isDirty) {\n      return node.run()\n    }\n\n    // Канонический сброс для unobserved pull-цепочек из тестов матрицы сайта\n    if (node.verifiedInEpoch !== -1 && node.verifiedInEpoch < engine.epoch && (!subscribers || subscribers.size === 0)) {\n      node.verifiedInEpoch = -1\n    } else {\n      node.verifiedInEpoch = engine.epoch\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    verifiedInEpoch: -1, // Перенесено напрямую на объект ноды для ультимативного O(1)\n    update: () => updateIfNecessary(computedNode),\n    run: () => {\n      // ⚛️ КАНOНИЧЕСКИЙ БЫСТРЫЙ ВЫХOД:\n      // Срабатывает только если эпоха стабильна, узел не сброшен в updateIfNecessary\n      // и в текущем кадре не происходило inner write мутаций у родителей\n      if (evaluatedInEpoch === engine.epoch && isInitialized && state === 0 && engine.batchDepth === 0) {\n        return false\n      }\n\n      // Запоминаем стартовую эпоху до вызова функции пользователя\n      const startEpoch = engine.epoch\n      evaluatedInEpoch = startEpoch\n      computedNode.verifiedInEpoch = startEpoch\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        // Выполняем пользовательскую функцию (здесь могут произойти inner writes из тестов #179, #180, #186)\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\n        // ⚡ ФИКС ДЛЯ INNER WRITES (#179, #180, #186):\n        // Если во время исполнения fn() эпоха ядра сдвинулась (был вложенный сеттер),\n        // мы обязаны сбросить кэш верификации этой эпохи, чтобы последующие цепочки\n        // зависимостей внутри этого же тика пересчитали свои значения нативно.\n        if (engine.epoch !== startEpoch) {\n          evaluatedInEpoch = -1\n          computedNode.verifiedInEpoch = -1\n          state = 2 // Переводим в DIRTY для немедленной инвалидации\n        }\n\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        if (typeof consumer.dependencies?.add === 'function') {\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\n      // ⚛️ ВЕЛИКИЙ ПРЕДOХРАНИТЕЛЬ ДЛЯ INNER WRITES (#180 и #186):\n      // Если у ноды есть сохраненный маркер эпохи, но состояние у узла DIRTY (state === 2)\n      // из-за вложенного вызова markDirty(2) во время flush-цикла, либо если глобальная эпоха\n      // ядра ушла вперед — мы ОБЯЗАНЫ обнулить verifiedInEpoch, чтобы пропустить пулл-запрос к родителям!\n      if (state === 2 || (computedNode.verifiedInEpoch !== -1 && computedNode.verifiedInEpoch < engine.epoch)) {\n        computedNode.verifiedInEpoch = -1\n        evaluatedInEpoch = -1\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 self = this\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(self.value) } catch (err) { console.error(err) }\n        }\n      }\n      subscribers.add(fakeEffect)\n      cb(this.value)\n      return () => {\n        fakeEffect.isDisposed = true\n        subscribers.delete(fakeEffect)\n        fakeEffect.dependencies.clear()\n      }\n    },\n    subscribeState(cb: () => void): CleanupFn {\n      return (computedInstance as any).subscribe(cb)\n    },\n    destroy: () => {\n      releaseNode(computedNode)\n      if (subscribers) subscribers.clear()\n      engine.computedCache.delete(fn)\n\n      dependencies.clear()\n      depVersions.clear()\n      ownedEffects.clear()\n\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.run = () => computedNode.run()\n  engine.computedCache.set(fn, computedInstance)\n\n  ;(computedInstance as any)._node = computedNode\n  ;(computedInstance as any).subscribers = subscribers\n\n  return computedInstance\n}\n"],"mappings":";AAEA,SAAgB,EACd,GACA,GACA,GACa;CAGb,IAAM,IAAW,EAAO,cAAc,IAAI,CAAE;CAC5C,IAAI,GAAU,OAAO;CAErB,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,GAEM,KAAqB,MAAuB;EAChD,IAAI,CAAC,KAAiB,MAAU,GAC9B,OAAO,EAAK,IAAI;EAMlB,IAAI,IAAmB;EAEvB,IAAI,KAAgB,EAAa,OAAO,GACtC,KAAK,IAAM,KAAO,GAAc;GAC9B,IAAM,IAAS,EAAI,SAAS;GAQ5B,IANI,EAAO,SAAS,cAAc,EAAO,QAAQ,KAC3C,EAAO,UAAU,EAAO,oBAAoB,EAAO,SACrD,EAAO,OAAO,GAId,EAAI,iBAAiB,EAAY,IAAI,CAAG,MAAM,EAAO,SAAS;IAChE,IAAmB;IACnB;GACF;EACF;EAiCF,OAzBI,KACF,IAAmB,IACnB,EAAK,kBAAkB,IAChB,EAAK,IAAI,KAId,KAAe,EAAY,OAAO,KAChC,EAAK,oBAAoB,EAAO,SAAS,EAAO,eAAe,KAAK,MAAU,IACzE,KAIP,IACK,EAAK,IAAI,KAId,EAAK,oBAAoB,MAAM,EAAK,kBAAkB,EAAO,UAAU,CAAC,KAAe,EAAY,SAAS,KAC9G,EAAK,kBAAkB,KAEvB,EAAK,kBAAkB,EAAO,OAGhC,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,iBAAiB;EACjB,cAAc,EAAkB,CAAY;EAC5C,WAAW;GAIT,IAAI,MAAqB,EAAO,SAAS,KAAiB,MAAU,KAAK,EAAO,eAAe,GAC7F,OAAO;GAIT,IAAM,IAAa,EAAO;GAI1B,IAHA,IAAmB,GACnB,EAAa,kBAAkB,GAE3B,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;IAGA,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;IAcA,OAZA,EAAa,QAAQ,IAAc,GAM/B,EAAO,UAAU,MACnB,IAAmB,IACnB,EAAa,kBAAkB,IAC/B,IAAQ,IAGH;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,KACvB,OAAO,EAAS,cAAc,OAAQ,YAAY;IAEpD,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;GAiBF,QAVI,MAAU,KAAM,EAAa,oBAAoB,MAAM,EAAa,kBAAkB,EAAO,WAC/F,EAAa,kBAAkB,IAC/B,IAAmB,KAGrB,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,IAAO,MACP,IAAkB;IACtB,IAAI,EAAO;IACX,SAAS;IACT,OAAO;IACP,8BAAc,IAAI,IAAI;IACtB,MAAM;IACN,WAAW;KACL,OAAW,YACf,IAAI;MAAE,EAAG,EAAK,KAAK;KAAE,SAAS,GAAK;MAAE,QAAQ,MAAM,CAAG;KAAE;IAC1D;GACF;GAGA,OAFA,EAAY,IAAI,CAAU,GAC1B,EAAG,KAAK,KAAK,SACA;IAGX,AAFA,EAAW,aAAa,IACxB,EAAY,OAAO,CAAU,GAC7B,EAAW,aAAa,MAAM;GAChC;EACF;EACA,eAAe,GAA2B;GACxC,OAAQ,EAAyB,UAAU,CAAE;EAC/C;EACA,eAAe;GAWb,AAVA,EAAY,CAAY,GACpB,KAAa,EAAY,MAAM,GACnC,EAAO,cAAc,OAAO,CAAE,GAE9B,EAAa,MAAM,GACnB,EAAY,MAAM,GAClB,EAAa,MAAM,GAEnB,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;CAQA,OANA,EAAiB,YAAY,EAAa,IAAI,GAC9C,EAAO,cAAc,IAAI,GAAI,CAAgB,GAE5C,EAA0B,QAAQ,GAClC,EAA0B,cAAc,GAElC;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  // Работает со скоростью нативной ссылки в V8, полностью исключая утечки памяти\n  const existing = engine.computedCache.get(fn)\n  if (existing) return existing as Computed<T>\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  const updateIfNecessary = (node: any): boolean => {\n    if (!isInitialized || state === 2) {\n      return node.run()\n    }\n\n    // ⚛️ КОРРЕКТНЫЙ МЕМОИЗАЦИОННЫЙ ГВАРД (Pull-совместимый проход):\n    // Если у узла есть активные подписчики (observed), мы можем оптимизировать расчет через эпохи.\n    // Но если подписчиков НЕТ (unobserved), мы ОБЯЗАНЫ пропустить быстрый выход по эпохам\n    // и честно проверить, изменились ли версии родителей ниже.\n    if (subscribers && subscribers.size > 0) {\n      if (node.verifiedInEpoch === engine.epoch && engine.batchDepth === 0 && state === 0) {\n        return false\n      }\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' && rawDep.state > 0) {\n          // ⚛️ ЗАЩИТА ОТ КАСКАДНОГО ОБХОДА:\n          // Вызываем update() родителя только если он еще не был верифицирован в текущей эпохе.\n          // Это ликвидирует квадратичную рекурсию на динамических структурах графа!\n          if (rawDep.update && rawDep.verifiedInEpoch !== engine.epoch) {\n            rawDep.update()\n          }\n        }\n\n        // Если родитель имеет отложенное батч-значение (hasBatchValue)\n        // или его версия изменилась — кэш невалиден!\n        if (dep.hasBatchValue || depVersions.get(dep) !== rawDep.version) {\n          hasChangedParent = true\n          break\n        }\n      }\n    }\n\n    node.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    verifiedInEpoch: -1, // Перенесено напрямую на объект ноды для ультимативного O(1)\n    update: () => updateIfNecessary(computedNode),\n    run: () => {\n      // Стандартный быстрый выход для стабильных эпох\n      if (evaluatedInEpoch === engine.epoch && isInitialized && state === 0 && engine.batchDepth === 0) {\n        return false\n      }\n\n      // Запоминаем стартовую эпоху до вызова функции пользователя\n      const startEpoch = engine.epoch\n      evaluatedInEpoch = startEpoch\n      computedNode.verifiedInEpoch = startEpoch\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        // Выполняем пользовательскую функцию (здесь могут произойти inner writes из тестов #179, #180, #186)\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\n        // ⚡ ФИКС ДЛЯ INNER WRITES (#179, #180, #186):\n        // Если во время исполнения fn() эпоха ядра сдвинулась (был вложенный сеттер),\n        // мы обязаны сбросить кэш верификации этой эпохи, чтобы последующие цепочки\n        // зависимостей внутри этого же тика пересчитали свои значения нативно.\n        if (engine.epoch !== startEpoch) {\n          evaluatedInEpoch = -1\n          computedNode.verifiedInEpoch = -1\n          state = 2 // Переводим в DIRTY для немедленной инвалидации\n        }\n\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      // 🛡️ АТОМАРНАЯ ЗАЩИТА: Фиксируем ссылку локально и работаем строго с ней.\n      // Это полностью предотвращает TypeError: ... reading 'add' на проде Next.js.\n      const consumer = engine.activeConsumer\n      if (consumer && consumer !== computedNode) {\n        // Проверяем наличие метода add у консьюмера, страхуя граф от стороннего мусора Webpack\n        if (typeof consumer.dependencies?.add === 'function') {\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\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 self = this\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(self.value) } catch (err) { console.error(err) }\n        }\n      }\n      subscribers.add(fakeEffect)\n      cb(this.value)\n      return () => {\n        fakeEffect.isDisposed = true\n        subscribers.delete(fakeEffect)\n        fakeEffect.dependencies.clear()\n      }\n    },\n    subscribeState(cb: () => void): CleanupFn {\n      return (computedInstance as any).subscribe(cb)\n    },\n    destroy: () => {\n      releaseNode(computedNode)\n      if (subscribers) subscribers.clear()\n      engine.computedCache.delete(fn)\n\n      dependencies.clear()\n      depVersions.clear()\n      ownedEffects.clear()\n\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.run = () => computedNode.run()\n  engine.computedCache.set(fn, computedInstance)\n\n  ;(computedInstance as any)._node = computedNode\n  ;(computedInstance as any).subscribers = subscribers\n\n  return computedInstance\n}\n"],"mappings":";AAEA,SAAgB,EACd,GACA,GACA,GACa;CAGb,IAAM,IAAW,EAAO,cAAc,IAAI,CAAE;CAC5C,IAAI,GAAU,OAAO;CAErB,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,GAEM,KAAqB,MAAuB;EAChD,IAAI,CAAC,KAAiB,MAAU,GAC9B,OAAO,EAAK,IAAI;EAOlB,IAAI,KAAe,EAAY,OAAO,KAChC,EAAK,oBAAoB,EAAO,SAAS,EAAO,eAAe,KAAK,MAAU,GAChF,OAAO;EAIX,IAAI,IAAmB;EAEvB,IAAI,KAAgB,EAAa,OAAO,GACtC,KAAK,IAAM,KAAO,GAAc;GAC9B,IAAM,IAAS,EAAI,SAAS;GAa5B,IAXI,EAAO,SAAS,cAAc,EAAO,QAAQ,KAI3C,EAAO,UAAU,EAAO,oBAAoB,EAAO,SACrD,EAAO,OAAO,GAMd,EAAI,iBAAiB,EAAY,IAAI,CAAG,MAAM,EAAO,SAAS;IAChE,IAAmB;IACnB;GACF;EACF;EAUF,OAPA,EAAK,kBAAkB,EAAO,OAE1B,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,iBAAiB;EACjB,cAAc,EAAkB,CAAY;EAC5C,WAAW;GAET,IAAI,MAAqB,EAAO,SAAS,KAAiB,MAAU,KAAK,EAAO,eAAe,GAC7F,OAAO;GAIT,IAAM,IAAa,EAAO;GAI1B,IAHA,IAAmB,GACnB,EAAa,kBAAkB,GAE3B,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;IAGA,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;IAcA,OAZA,EAAa,QAAQ,IAAc,GAM/B,EAAO,UAAU,MACnB,IAAmB,IACnB,EAAa,kBAAkB,IAC/B,IAAQ,IAGH;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;GAGV,IAAM,IAAW,EAAO;GACxB,IAAI,KAAY,MAAa,KAEvB,OAAO,EAAS,cAAc,OAAQ,YAAY;IAEpD,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;GAQF,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,IAAO,MACP,IAAkB;IACtB,IAAI,EAAO;IACX,SAAS;IACT,OAAO;IACP,8BAAc,IAAI,IAAI;IACtB,MAAM;IACN,WAAW;KACL,OAAW,YACf,IAAI;MAAE,EAAG,EAAK,KAAK;KAAE,SAAS,GAAK;MAAE,QAAQ,MAAM,CAAG;KAAE;IAC1D;GACF;GAGA,OAFA,EAAY,IAAI,CAAU,GAC1B,EAAG,KAAK,KAAK,SACA;IAGX,AAFA,EAAW,aAAa,IACxB,EAAY,OAAO,CAAU,GAC7B,EAAW,aAAa,MAAM;GAChC;EACF;EACA,eAAe,GAA2B;GACxC,OAAQ,EAAyB,UAAU,CAAE;EAC/C;EACA,eAAe;GAWb,AAVA,EAAY,CAAY,GACpB,KAAa,EAAY,MAAM,GACnC,EAAO,cAAc,OAAO,CAAE,GAE9B,EAAa,MAAM,GACnB,EAAY,MAAM,GAClB,EAAa,MAAM,GAEnB,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;CAQA,OANA,EAAiB,YAAY,EAAa,IAAI,GAC9C,EAAO,cAAc,IAAI,GAAI,CAAgB,GAE5C,EAA0B,QAAQ,GAClC,EAA0B,cAAc,GAElC;AACT"}

package/dist/core.method.effect.mjs

@@ -1,35 +1,46 @@
 //#region src/core/core.method.effect.ts
 function e(e, t, n) {
-	let r = !1, i = !1, a = 2, o = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Set(), l = () => {
-		if (c.size > 0) {
-			let t = e.activeConsumer, n = e.activeOwner;
-			e.activeConsumer = null, e.activeOwner = null;
-			for (let e of c) e.dispose && e.dispose();
-			c.clear(), e.activeConsumer = t, e.activeOwner = n;
-		}
-		if (u.cleanups.size > 0) {
-			let t = e.activeConsumer;
-			e.activeConsumer = null;
-			for (let e of u.cleanups) try {
-				e();
-			} catch (e) {
-				console.error(e);
+	let r = !1, i = !1, a = !1, o = 2, s = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ new Set(), u = /* @__PURE__ */ new Map(), d = () => {
+		if (a) return;
+		a = !0;
+		let t = e.activeCleanupNode;
+		e.activeCleanupNode = f;
+		try {
+			if (l.size > 0) {
+				let t = e.activeConsumer, n = e.activeOwner;
+				e.activeConsumer = null, e.activeOwner = null;
+				for (let e of l) e.dispose && e.dispose();
+				l.clear(), e.activeConsumer = t, e.activeOwner = n;
+			}
+			if (f.cleanups.size > 0) {
+				let t = e.activeConsumer;
+				e.activeConsumer = null;
+				let n = null, r = Array.from(f.cleanups);
+				f.cleanups.clear();
+				for (let e of r) try {
+					e();
+				} catch (e) {
+					console.error(e), n ||= e;
+				}
+				if (e.activeConsumer = t, n) throw n;
 			}
-			u.cleanups.clear(), e.activeConsumer = t;
+		} finally {
+			e.activeCleanupNode = t, a = !1;
 		}
-	}, u = {
+	}, f = {
 		id: e.subscriberId++,
-		dependencies: o,
-		ownedEffects: c,
+		dependencies: s,
+		ownedEffects: l,
 		cleanups: /* @__PURE__ */ new Set(),
 		type: "effect",
 		depth: 0,
 		label: n,
+		_snapshotValues: u,
 		get isDirty() {
-			return a > 0;
+			return o > 0;
 		},
 		set isDirty(e) {
-			e && (a = 2);
+			e && (o = 2);
 		},
 		get isDisposed() {
 			return r;
@@ -38,60 +49,69 @@ function e(e, t, n) {
 			r = e;
 		},
 		get state() {
-			return a;
+			return o;
 		},
 		set state(e) {
-			a = e;
+			o = e;
 		},
 		get depVersions() {
-			return s;
+			return c;
 		},
 		get _node() {
-			return u;
+			return f;
 		},
 		markDirty: () => {
-			a >= 1 || (a = 1, e.scheduleEffect(u));
+			r || o >= 1 || (o = 1, e.scheduleEffect(f));
 		},
 		run: () => {
 			if (r || i) return;
-			i = !0, l();
-			let n = e.activeConsumer, c = e.activeOwner;
-			e.activeConsumer = u, e.activeOwner = u;
-			let d = o.size > 0 ? Array.from(o) : null;
-			o.clear();
+			i = !0;
+			try {
+				d();
+			} catch (e) {
+				throw i = !1, e;
+			}
+			if (r) {
+				i = !1;
+				return;
+			}
+			let n = e.activeConsumer, a = e.activeOwner;
+			e.activeConsumer = f, e.activeOwner = f;
+			let l = s.size > 0 ? Array.from(s) : null;
+			s.clear();
 			try {
-				a = 0;
+				o = 0;
 				let e = t();
-				if (typeof e == "function" && u.cleanups.add(e), d !== null) for (let e of d) {
+				if (typeof e == "function" && f.cleanups.add(e), l !== null) for (let e of l) {
 					let t = e;
-					if (!o.has(t)) {
+					if (!s.has(t)) {
 						let e = t._node || t;
-						e.subscribers && e.subscribers.delete(u), s.delete(t);
+						e.subscribers && e.subscribers.delete(f), c.delete(t), u.delete(t);
 					}
 				}
 				let n = 0;
-				for (let e of o) {
+				for (let e of s) {
 					let t = e, r = t._node || t;
-					s.set(t, r.version), r.subscribers && r.subscribers.add(u), r.depth !== void 0 && r.depth > n && (n = r.depth);
+					c.set(t, r.version), r.subscribers && r.subscribers.add(f), r.depth !== void 0 && r.depth > n && (n = r.depth);
 				}
-				u.depth = n + 1;
+				f.depth = n + 1;
 			} finally {
-				i = !1, e.activeConsumer = n, e.activeOwner = c;
+				i = !1, e.activeConsumer = n, e.activeOwner = a;
 			}
 		},
 		dispose: () => {
 			if (!r) {
-				r = !0, u.isDisposed = !0, l();
-				for (let e of o) {
+				r = !0, f.isDisposed = !0, d();
+				for (let e of s) {
 					let t = e._node || e;
-					t.subscribers && t.subscribers.delete(u);
+					t.subscribers && t.subscribers.delete(f);
 				}
-				o.clear(), s.clear();
+				s.clear(), c.clear(), u.clear();
 			}
 		}
-	}, d = e.activeOwner ? e.activeOwner._node || e.activeOwner : null;
-	return d && d.ownedEffects && d.ownedEffects.add(u), u.run(), () => {
-		u.dispose();
+	}, p = e.activeOwner ? e.activeOwner._node || e.activeOwner : null;
+	return p && p.ownedEffects && p.ownedEffects.add(f), f.run(), () => {
+		f.dispose();
 	};
 }
 //#endregion

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

@@ -1 +1 @@
-{"version":3,"file":"core.method.effect.mjs","names":[],"sources":["../src/core/core.method.effect.ts"],"sourcesContent":["import { IEffect, EffectFn, CleanupFn } from './types'\n\ninterface ICoreEffectNode extends IEffect {\n  dependencies: Set<any>;\n  depVersions: Map<any, number>;\n  ownedEffects: Set<ICoreEffectNode>;\n  type: string;\n  depth: number;\n  state: number;\n  _node: any;\n  dispose: () => void;\n}\n\nexport function createEffect(engine: any, fn: EffectFn, effectName?: string): () => void {\n  let isDisposed = false\n  let isRunning = false\n  let state = 2 // 0 = STABLE, 1 = CHECK, 2 = DIRTY\n\n  const dependencies = new Set<any>()\n  const depVersions = new Map<any, number>()\n  const ownedEffects = new Set<ICoreEffectNode>()\n\n  const runCleanupPhase = () => {\n    // Каскадное уничтожение вложенных детей через быстрый for...of\n    if (ownedEffects.size > 0) {\n      const prevConsumer = engine.activeConsumer\n      const prevOwner = engine.activeOwner\n      engine.activeConsumer = null\n      engine.activeOwner = null\n\n      for (const child of ownedEffects) {\n        if (child.dispose) child.dispose()\n      }\n      ownedEffects.clear()\n\n      engine.activeConsumer = prevConsumer\n      engine.activeOwner = prevOwner\n    }\n\n    // Изоляция ошибок в деструкторах пользователя через быстрый for...of\n    if (effectNode.cleanups.size > 0) {\n      const prevConsumer = engine.activeConsumer\n      engine.activeConsumer = null\n\n      for (const cleanup of effectNode.cleanups) {\n        try {\n          cleanup()\n        } catch (err) {\n          console.error(err)\n        }\n      }\n\n      effectNode.cleanups.clear()\n      engine.activeConsumer = prevConsumer\n    }\n  }\n\n  const effectNode: ICoreEffectNode = {\n    id: engine.subscriberId++,\n    dependencies,\n    ownedEffects,\n    cleanups: new Set<CleanupFn>(),\n    type: 'effect',\n    depth: 0,\n    label: effectName,\n\n    get isDirty(): boolean { return state > 0 },\n    set isDirty(val: boolean) { if (val) state = 2 },\n\n    get isDisposed(): boolean { return isDisposed },\n    set isDisposed(val: boolean) { isDisposed = val },\n\n    get state(): number { return state },\n    set state(val: number) { state = val },\n    get depVersions(): Map<any, number> { return depVersions },\n    get _node(): any { return effectNode },\n\n    markDirty: () => {\n      if (state >= 1) return\n      state = 1\n      engine.scheduleEffect(effectNode)\n    },\n\n    run: () => {\n      if (isDisposed || isRunning) return\n      isRunning = true\n\n      runCleanupPhase()\n\n      const prevConsumer = engine.activeConsumer\n      const prevOwner = engine.activeOwner\n\n      engine.activeConsumer = effectNode\n      engine.activeOwner = effectNode\n\n      const oldDeps = dependencies.size > 0 ? Array.from(dependencies) : null\n      dependencies.clear()\n\n      try {\n        state = 0 // Сбрасываем флаг грязи перед чтением графа\n\n        const result = fn()\n        if (typeof result === 'function') {\n          effectNode.cleanups.add(result)\n        }\n\n        if (oldDeps !== null) {\n          for (const unknownDep of oldDeps) {\n            const dep = unknownDep as any\n            if (!dependencies.has(dep)) {\n              const rawDepNode = dep._node || dep\n              if (rawDepNode.subscribers) rawDepNode.subscribers.delete(effectNode)\n              depVersions.delete(dep)\n            }\n          }\n        }\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(effectNode)\n          if (rawNode.depth !== undefined && rawNode.depth > maxDepDepth) {\n            maxDepDepth = rawNode.depth\n          }\n        }\n        effectNode.depth = maxDepDepth + 1\n\n      } finally {\n        isRunning = false\n        engine.activeConsumer = prevConsumer\n        engine.activeOwner = prevOwner\n      }\n    },\n\n    dispose: () => {\n      if (isDisposed) return\n      isDisposed = true\n      effectNode.isDisposed = true\n\n      runCleanupPhase()\n\n      // ⚡ ОПТИМИЗАЦИЯ: Замена .forEach на быстрый for...of при полном уничтожении эффекта\n      for (const dep of dependencies) {\n        const rawNode = dep._node || dep\n        if (rawNode.subscribers) rawNode.subscribers.delete(effectNode)\n      }\n      dependencies.clear()\n      depVersions.clear()\n    }\n  }\n\n  const actualOwnerNode = engine.activeOwner ? (engine.activeOwner._node || engine.activeOwner) : null\n\n  if (actualOwnerNode && actualOwnerNode.ownedEffects) {\n    actualOwnerNode.ownedEffects.add(effectNode)\n  }\n\n  effectNode.run()\n\n  return () => {\n    effectNode.dispose()\n  }\n}\n"],"mappings":";AAaA,SAAgB,EAAa,GAAa,GAAc,GAAiC;CACvF,IAAI,IAAa,IACb,IAAY,IACZ,IAAQ,GAEN,oBAAe,IAAI,IAAS,GAC5B,oBAAc,IAAI,IAAiB,GACnC,oBAAe,IAAI,IAAqB,GAExC,UAAwB;EAE5B,IAAI,EAAa,OAAO,GAAG;GACzB,IAAM,IAAe,EAAO,gBACtB,IAAY,EAAO;GAEzB,AADA,EAAO,iBAAiB,MACxB,EAAO,cAAc;GAErB,KAAK,IAAM,KAAS,GAClB,AAAI,EAAM,WAAS,EAAM,QAAQ;GAKnC,AAHA,EAAa,MAAM,GAEnB,EAAO,iBAAiB,GACxB,EAAO,cAAc;EACvB;EAGA,IAAI,EAAW,SAAS,OAAO,GAAG;GAChC,IAAM,IAAe,EAAO;GAC5B,EAAO,iBAAiB;GAExB,KAAK,IAAM,KAAW,EAAW,UAC/B,IAAI;IACF,EAAQ;GACV,SAAS,GAAK;IACZ,QAAQ,MAAM,CAAG;GACnB;GAIF,AADA,EAAW,SAAS,MAAM,GAC1B,EAAO,iBAAiB;EAC1B;CACF,GAEM,IAA8B;EAClC,IAAI,EAAO;EACX;EACA;EACA,0BAAU,IAAI,IAAe;EAC7B,MAAM;EACN,OAAO;EACP,OAAO;EAEP,IAAI,UAAmB;GAAE,OAAO,IAAQ;EAAE;EAC1C,IAAI,QAAQ,GAAc;GAAE,AAAI,MAAK,IAAQ;EAAE;EAE/C,IAAI,aAAsB;GAAE,OAAO;EAAW;EAC9C,IAAI,WAAW,GAAc;GAAE,IAAa;EAAI;EAEhD,IAAI,QAAgB;GAAE,OAAO;EAAM;EACnC,IAAI,MAAM,GAAa;GAAE,IAAQ;EAAI;EACrC,IAAI,cAAgC;GAAE,OAAO;EAAY;EACzD,IAAI,QAAa;GAAE,OAAO;EAAW;EAErC,iBAAiB;GACX,KAAS,MACb,IAAQ,GACR,EAAO,eAAe,CAAU;EAClC;EAEA,WAAW;GACT,IAAI,KAAc,GAAW;GAG7B,AAFA,IAAY,IAEZ,EAAgB;GAEhB,IAAM,IAAe,EAAO,gBACtB,IAAY,EAAO;GAGzB,AADA,EAAO,iBAAiB,GACxB,EAAO,cAAc;GAErB,IAAM,IAAU,EAAa,OAAO,IAAI,MAAM,KAAK,CAAY,IAAI;GACnE,EAAa,MAAM;GAEnB,IAAI;IACF,IAAQ;IAER,IAAM,IAAS,EAAG;IAKlB,IAJI,OAAO,KAAW,cACpB,EAAW,SAAS,IAAI,CAAM,GAG5B,MAAY,MACd,KAAK,IAAM,KAAc,GAAS;KAChC,IAAM,IAAM;KACZ,IAAI,CAAC,EAAa,IAAI,CAAG,GAAG;MAC1B,IAAM,IAAa,EAAI,SAAS;MAEhC,AADI,EAAW,eAAa,EAAW,YAAY,OAAO,CAAU,GACpE,EAAY,OAAO,CAAG;KACxB;IACF;IAGF,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,CAAU,GACvD,EAAQ,UAAU,KAAA,KAAa,EAAQ,QAAQ,MACjD,IAAc,EAAQ;IAE1B;IACA,EAAW,QAAQ,IAAc;GAEnC,UAAU;IAGR,AAFA,IAAY,IACZ,EAAO,iBAAiB,GACxB,EAAO,cAAc;GACvB;EACF;EAEA,eAAe;GACT,QAIJ;IAHA,IAAa,IACb,EAAW,aAAa,IAExB,EAAgB;IAGhB,KAAK,IAAM,KAAO,GAAc;KAC9B,IAAM,IAAU,EAAI,SAAS;KAC7B,AAAI,EAAQ,eAAa,EAAQ,YAAY,OAAO,CAAU;IAChE;IAEA,AADA,EAAa,MAAM,GACnB,EAAY,MAAM;GARF;EASlB;CACF,GAEM,IAAkB,EAAO,cAAe,EAAO,YAAY,SAAS,EAAO,cAAe;CAQhG,OANI,KAAmB,EAAgB,gBACrC,EAAgB,aAAa,IAAI,CAAU,GAG7C,EAAW,IAAI,SAEF;EACX,EAAW,QAAQ;CACrB;AACF"}
+{"version":3,"file":"core.method.effect.mjs","names":[],"sources":["../src/core/core.method.effect.ts"],"sourcesContent":["import { IEffect, EffectFn, CleanupFn } from './types'\n\ninterface ICoreEffectNode extends IEffect {\n  dependencies: Set<any>;\n  depVersions: Map<any, number>;\n  ownedEffects: Set<ICoreEffectNode>;\n  type: string;\n  depth: number;\n  state: number;\n  _node: any;\n  dispose: () => void;\n  _snapshotValues: Map<any, any>;\n}\n\nexport function createEffect(engine: any, fn: EffectFn, effectName?: string): () => void {\n  let isDisposed = false\n  let isRunning = false\n  let isCleaning = false\n  let state = 2 // 0 = STABLE, 1 = CHECK, 2 = DIRTY (Гарантированное объявление переменной)\n\n  const dependencies = new Set<any>()\n  const depVersions = new Map<any, number>()\n  const ownedEffects = new Set<ICoreEffectNode>()\n  const snapshotValues = new Map<any, any>()\n\n  const runCleanupPhase = () => {\n    if (isCleaning) return\n    isCleaning = true\n\n    // Активируем контекст чтения исторических снапшотов\n    const prevCleanupNode = engine.activeCleanupNode\n    engine.activeCleanupNode = effectNode\n\n    try {\n      // 1. Каскадное уничтожение вложенных дочерних эффектов\n      if (ownedEffects.size > 0) {\n        const prevConsumer = engine.activeConsumer\n        const prevOwner = engine.activeOwner\n        engine.activeConsumer = null\n        engine.activeOwner = null\n\n        for (const child of ownedEffects) {\n          if (child.dispose) child.dispose()\n        }\n        ownedEffects.clear()\n\n        engine.activeConsumer = prevConsumer\n        engine.activeOwner = prevOwner\n      }\n\n      // 2. Вызов деструкторов пользователя в режиме untracked\n      if (effectNode.cleanups.size > 0) {\n        const prevConsumer = engine.activeConsumer\n        engine.activeConsumer = null\n\n        let firstError: unknown = null\n        const cleanupsArray = Array.from(effectNode.cleanups)\n        effectNode.cleanups.clear()\n\n        for (const cleanup of cleanupsArray) {\n          try {\n            cleanup()\n          } catch (err) {\n            console.error(err)\n            if (!firstError) {\n              firstError = err\n            }\n          }\n        }\n\n        engine.activeConsumer = prevConsumer\n\n        if (firstError) {\n          throw firstError\n        }\n      }\n    } finally {\n      engine.activeCleanupNode = prevCleanupNode\n      isCleaning = false\n    }\n  }\n\n  const effectNode: ICoreEffectNode = {\n    id: engine.subscriberId++,\n    dependencies,\n    ownedEffects,\n    cleanups: new Set<CleanupFn>(),\n    type: 'effect',\n    depth: 0,\n    label: effectName,\n    _snapshotValues: snapshotValues,\n\n    get isDirty(): boolean { return state > 0 },\n    set isDirty(val: boolean) { if (val) state = 2 },\n\n    get isDisposed(): boolean { return isDisposed },\n    set isDisposed(val: boolean) { isDisposed = val },\n\n    get state(): number { return state },\n    set state(val: number) { state = val },\n    get depVersions(): Map<any, number> { return depVersions },\n    get _node(): any { return effectNode },\n\n    markDirty: () => {\n      if (isDisposed || state >= 1) return\n      state = 1\n      engine.scheduleEffect(effectNode)\n    },\n\n    run: () => {\n      if (isDisposed || isRunning) return\n      isRunning = true\n\n      try {\n        runCleanupPhase()\n      } catch (err) {\n        isRunning = false\n        throw err\n      }\n\n      if (isDisposed) {\n        isRunning = false\n        return\n      }\n\n      const prevConsumer = engine.activeConsumer\n      const prevOwner = engine.activeOwner\n\n      engine.activeConsumer = effectNode\n      engine.activeOwner = effectNode\n\n      const oldDeps = dependencies.size > 0 ? Array.from(dependencies) : null\n      dependencies.clear()\n\n      try {\n        state = 0 // Локальная переменная замыкания теперь успешно сбрасывается в STABLE\n\n        const result = fn()\n        if (typeof result === 'function') {\n          effectNode.cleanups.add(result)\n        }\n\n        if (oldDeps !== null) {\n          for (const unknownDep of oldDeps) {\n            const dep = unknownDep as any\n            if (!dependencies.has(dep)) {\n              const rawDepNode = dep._node || dep\n              if (rawDepNode.subscribers) rawDepNode.subscribers.delete(effectNode)\n              depVersions.delete(dep)\n              snapshotValues.delete(dep)\n            }\n          }\n        }\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(effectNode)\n          if (rawNode.depth !== undefined && rawNode.depth > maxDepDepth) {\n            maxDepDepth = rawNode.depth\n          }\n        }\n        effectNode.depth = maxDepDepth + 1\n\n      } finally {\n        isRunning = false\n        engine.activeConsumer = prevConsumer\n        engine.activeOwner = prevOwner\n      }\n    },\n\n    dispose: () => {\n      if (isDisposed) return\n      isDisposed = true\n      effectNode.isDisposed = true\n\n      runCleanupPhase()\n\n      for (const dep of dependencies) {\n        const rawNode = dep._node || dep\n        if (rawNode.subscribers) rawNode.subscribers.delete(effectNode)\n      }\n      dependencies.clear()\n      depVersions.clear()\n      snapshotValues.clear()\n    }\n  }\n\n  const actualOwnerNode = engine.activeOwner ? (engine.activeOwner._node || engine.activeOwner) : null\n\n  if (actualOwnerNode && actualOwnerNode.ownedEffects) {\n    actualOwnerNode.ownedEffects.add(effectNode)\n  }\n\n  effectNode.run()\n\n  return () => {\n    effectNode.dispose()\n  }\n}\n"],"mappings":";AAcA,SAAgB,EAAa,GAAa,GAAc,GAAiC;CACvF,IAAI,IAAa,IACb,IAAY,IACZ,IAAa,IACb,IAAQ,GAEN,oBAAe,IAAI,IAAS,GAC5B,oBAAc,IAAI,IAAiB,GACnC,oBAAe,IAAI,IAAqB,GACxC,oBAAiB,IAAI,IAAc,GAEnC,UAAwB;EAC5B,IAAI,GAAY;EAChB,IAAa;EAGb,IAAM,IAAkB,EAAO;EAC/B,EAAO,oBAAoB;EAE3B,IAAI;GAEF,IAAI,EAAa,OAAO,GAAG;IACzB,IAAM,IAAe,EAAO,gBACtB,IAAY,EAAO;IAEzB,AADA,EAAO,iBAAiB,MACxB,EAAO,cAAc;IAErB,KAAK,IAAM,KAAS,GAClB,AAAI,EAAM,WAAS,EAAM,QAAQ;IAKnC,AAHA,EAAa,MAAM,GAEnB,EAAO,iBAAiB,GACxB,EAAO,cAAc;GACvB;GAGA,IAAI,EAAW,SAAS,OAAO,GAAG;IAChC,IAAM,IAAe,EAAO;IAC5B,EAAO,iBAAiB;IAExB,IAAI,IAAsB,MACpB,IAAgB,MAAM,KAAK,EAAW,QAAQ;IACpD,EAAW,SAAS,MAAM;IAE1B,KAAK,IAAM,KAAW,GACpB,IAAI;KACF,EAAQ;IACV,SAAS,GAAK;KAEZ,AADA,QAAQ,MAAM,CAAG,GACjB,AACE,MAAa;IAEjB;IAKF,IAFA,EAAO,iBAAiB,GAEpB,GACF,MAAM;GAEV;EACF,UAAU;GAER,AADA,EAAO,oBAAoB,GAC3B,IAAa;EACf;CACF,GAEM,IAA8B;EAClC,IAAI,EAAO;EACX;EACA;EACA,0BAAU,IAAI,IAAe;EAC7B,MAAM;EACN,OAAO;EACP,OAAO;EACP,iBAAiB;EAEjB,IAAI,UAAmB;GAAE,OAAO,IAAQ;EAAE;EAC1C,IAAI,QAAQ,GAAc;GAAE,AAAI,MAAK,IAAQ;EAAE;EAE/C,IAAI,aAAsB;GAAE,OAAO;EAAW;EAC9C,IAAI,WAAW,GAAc;GAAE,IAAa;EAAI;EAEhD,IAAI,QAAgB;GAAE,OAAO;EAAM;EACnC,IAAI,MAAM,GAAa;GAAE,IAAQ;EAAI;EACrC,IAAI,cAAgC;GAAE,OAAO;EAAY;EACzD,IAAI,QAAa;GAAE,OAAO;EAAW;EAErC,iBAAiB;GACX,KAAc,KAAS,MAC3B,IAAQ,GACR,EAAO,eAAe,CAAU;EAClC;EAEA,WAAW;GACT,IAAI,KAAc,GAAW;GAC7B,IAAY;GAEZ,IAAI;IACF,EAAgB;GAClB,SAAS,GAAK;IAEZ,MADA,IAAY,IACN;GACR;GAEA,IAAI,GAAY;IACd,IAAY;IACZ;GACF;GAEA,IAAM,IAAe,EAAO,gBACtB,IAAY,EAAO;GAGzB,AADA,EAAO,iBAAiB,GACxB,EAAO,cAAc;GAErB,IAAM,IAAU,EAAa,OAAO,IAAI,MAAM,KAAK,CAAY,IAAI;GACnE,EAAa,MAAM;GAEnB,IAAI;IACF,IAAQ;IAER,IAAM,IAAS,EAAG;IAKlB,IAJI,OAAO,KAAW,cACpB,EAAW,SAAS,IAAI,CAAM,GAG5B,MAAY,MACd,KAAK,IAAM,KAAc,GAAS;KAChC,IAAM,IAAM;KACZ,IAAI,CAAC,EAAa,IAAI,CAAG,GAAG;MAC1B,IAAM,IAAa,EAAI,SAAS;MAGhC,AAFI,EAAW,eAAa,EAAW,YAAY,OAAO,CAAU,GACpE,EAAY,OAAO,CAAG,GACtB,EAAe,OAAO,CAAG;KAC3B;IACF;IAGF,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,CAAU,GACvD,EAAQ,UAAU,KAAA,KAAa,EAAQ,QAAQ,MACjD,IAAc,EAAQ;IAE1B;IACA,EAAW,QAAQ,IAAc;GAEnC,UAAU;IAGR,AAFA,IAAY,IACZ,EAAO,iBAAiB,GACxB,EAAO,cAAc;GACvB;EACF;EAEA,eAAe;GACT,QAIJ;IAHA,IAAa,IACb,EAAW,aAAa,IAExB,EAAgB;IAEhB,KAAK,IAAM,KAAO,GAAc;KAC9B,IAAM,IAAU,EAAI,SAAS;KAC7B,AAAI,EAAQ,eAAa,EAAQ,YAAY,OAAO,CAAU;IAChE;IAGA,AAFA,EAAa,MAAM,GACnB,EAAY,MAAM,GAClB,EAAe,MAAM;GARL;EASlB;CACF,GAEM,IAAkB,EAAO,cAAe,EAAO,YAAY,SAAS,EAAO,cAAe;CAQhG,OANI,KAAmB,EAAgB,gBACrC,EAAgB,aAAa,IAAI,CAAU,GAG7C,EAAW,IAAI,SAEF;EACX,EAAW,QAAQ;CACrB;AACF"}

package/dist/core.method.resource.mjs

@@ -124,7 +124,9 @@ function t(t, n, r, i) {
 							total: d,
 							nextDelayMs: Math.round(e)
 						} }
-					}), console.warn(`[Resource Retry] "${o}" сбой по ${r ? "таймауту" : "ошибке сети"}. Запрос ${a + 1} из ${d + 1} не удался. Ожидание повтора: ${Math.round(e)}ms`);
+					});
+					let n = r ? "таймауту" : "ошибке сети";
+					t.logger.isEnabled && console.warn(`[Resource Retry] "${o}" сбой по ${n}. Запрос ${a + 1} из ${d + 1} не удался. Ожидание повтора: ${Math.round(e)}ms`);
 					try {
 						if (await t.delay(e, i), i.aborted) return;
 					} catch {