@pravosleva/reactive-engine 2.6.0-beta.4 → 2.6.1

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,CA4Tb"}
+{"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,CAyTb"}

package/dist/core/types.d.ts

@@ -19,29 +19,47 @@ export type Token<T> = string | symbol | {
     new (engine: ReactiveEngineCore, ...args: any[]): T;
 };
 export type Factory<T> = (engine: ReactiveEngineCore) => T;
+/**
+ * ⚛️ БАЗОВЫЙ ИНТЕРФЕЙС-КОНТРАКТ ДЛЯ ЛЮБЫХ СИГНАЛОПОДОБНЫХ УЗЛОВ
+ */
+export interface ISignalLike<V> {
+    /**
+     * Публичный геттер с автоматическим динамическим трекингом зависимостей графа
+     */
+    readonly value: V;
+    /**
+     * Безопасное чтение значения из кэша БЕЗ трекинга зависимостей.
+     */
+    valueWithoutTracking?: V;
+    /**
+     * Активная Push-подписка на каждое изменение значения узла
+     */
+    subscribe: (cb: (v: V) => void) => CleanupFn;
+    /**
+     * Пассивный системный хук подписки на завершение реактивной транзакции.
+     */
+    __subscribe?: (cb: () => void) => CleanupFn;
+}
 /**
  * Интерфейс атомарного Сигнала графа.
+ * ⚛️ ТЕПЕРЬ ЯВНО НАСЛЕДУЕТ ISignalLike<T> ДЛЯ ГАРАНТИРОВАННОГО ВЫВОДА ТИПОВ
  */
-export interface Signal<T> {
+export interface Signal<T> extends ISignalLike<T> {
     value: T;
-    subscribe: (cb: (val: T) => void) => CleanupFn;
     destroy: () => void;
 }
 /**
  * Интерфейс синхронно-ленивого Вычисляемого свойства.
+ * ⚛️ ТЕПЕРЬ ЯВНО НАСЛЕДУЕТ ISignalLike<T> ДЛЯ КЭШИРОВАНИЯ И ВЫВОДА ТИПОВ
  */
-export interface Computed<T> {
+export interface Computed<T> extends ISignalLike<T> {
     readonly value: T;
-    subscribe: (cb: (val: T) => void) => CleanupFn;
     destroy: () => void;
     _isDirty?: () => boolean;
     dependencies?: Set<any>;
     run?: () => void;
     type?: any;
 }
-/**
- * Интерфейс побочного Эффекта планировщика.
- */
 export interface IEffect {
     id: number;
     run: () => void;
@@ -54,48 +72,28 @@ export interface IEffect {
     fn?: () => void;
     _node?: any;
 }
-/**
- * Опции конфигурации Сигналов.
- */
 export interface SignalOptions<T> {
     name?: string;
     validate?: (value: T) => boolean | string;
 }
-/**
- * Состояние асинхронного ресурса.
- */
 export interface ResourceState<T> {
     data: T | null;
     loading: boolean;
     error: string | null;
     isRetrying?: boolean;
 }
-/**
- * Контракт асинхронного Ресурса ядра.
- */
 export interface Resource<T> extends ResourceState<T> {
     refetch: () => void;
     subscribe: (cb: (val: ResourceState<T>) => void) => CleanupFn;
     readonly value: ResourceState<T>;
     destroy: () => void;
 }
-/**
- * Настройки конфигурации асинхронного Ресурса.
- * Полностью очищены от legacy-параметров ретраев и таймаутов.
- */
 export interface ResourceOptions<T, S = void> {
-    /** Уникальное имя ресурса для трассировки и логирования */
     name?: string;
-    /** Принудительный сброс данных в null при изменении источника (true по умолчанию) */
     resetDataOnSourceChange?: boolean;
-    /** Декларативная пре-валидация параметров ДО отправки запроса в сеть */
     validateBeforeFetch?: (source: S) => boolean | string;
-    /** Валидация структуры ответа сервера после успешного разрешения промиса */
     responseValidate?: (data: T) => boolean | string;
 }
-/**
- * Параметры продвинутой системы логирования транзакций.
- */
 export interface EngineLoggerOptions {
     instanceName?: string;
     isEnabled: boolean;
@@ -133,9 +131,6 @@ export interface ReactiveDetail {
     oldValue: unknown;
     newValue: unknown;
 }
-/**
- * Карта маппинга категорий логов для безопасной работы метода queueLog.
- */
 export interface LogDetailMap {
     signal: SignalLogDetail;
     computed: ComputedLogDetail;
@@ -144,24 +139,4 @@ export interface LogDetailMap {
     resource: ResourceLogDetail;
     reactive: ReactiveDetail;
 }
-export interface ISignalLike<V> {
-    /**
-     * Публичный геттер с автоматическим динамическим трекингом зависимостей графа
-     */
-    value: V;
-    /**
-     * Безопасное чтение значения из кэша БЕЗ трекинга зависимостей.
-     * Предотвращает гонку планировщиков и лишние транзакции во время рендера React/Vue.
-     */
-    valueWithoutTracking: V;
-    /**
-     * Активная Push-подписка на каждое изменение значения узла
-     */
-    subscribe: (cb: (v: V) => void) => CleanupFn;
-    /**
-     * Пассивный системный хук подписки на завершение реактивной транзакции.
-     * Позволяет UI-мостам просыпаться строго один раз за тик, ликвидируя IDLE PULL дубли.
-     */
-    __subscribe?: (cb: () => void) => CleanupFn;
-}
 //# sourceMappingURL=types.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/core/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,QAAQ,CAAA;AAGhD,MAAM,MAAM,YAAY,GAAG,QAAQ,GAAG,UAAU,GAAG,QAAQ,GAAG,OAAO,GAAG,UAAU,GAAG,UAAU,CAAC;AAGhG,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,YAAY,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,EAAE,CAAC,EAAE,OAAO,CAAC;IACb,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CACnB;AAGD,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,MAAM,CAAC;IACX,eAAe,EAAE,SAAS,EAAE,CAAC;IAC7B,UAAU,EAAE,OAAO,CAAC;CACrB;AAED,MAAM,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC;AACnC,MAAM,MAAM,QAAQ,GAAG,MAAM,SAAS,GAAG,IAAI,CAAC;AAC9C,MAAM,MAAM,KAAK,CAAC,CAAC,IAAI,MAAM,GAAG,MAAM,GAAG;IAAE,KAAI,MAAM,EAAE,kBAAkB,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;CAAE,CAAC;AAChG,MAAM,MAAM,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,kBAAkB,KAAK,CAAC,CAAC;AAE3D;;GAEG;AACH,MAAM,WAAW,MAAM,CAAC,CAAC;IACvB,KAAK,EAAE,CAAC,CAAC;IACT,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,IAAI,KAAK,SAAS,CAAC;IAE/C,OAAO,EAAE,MAAM,IAAI,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IAClB,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,IAAI,KAAK,SAAS,CAAC;IAC/C,OAAO,EAAE,MAAM,IAAI,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,OAAO,CAAA;IACxB,YAAY,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAA;IACvB,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC;IACjB,IAAI,CAAC,EAAE,GAAG,CAAA;CACX;AAED;;GAEG;AACH,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAA;IACV,GAAG,EAAE,MAAM,IAAI,CAAA;IACf,SAAS,EAAE,MAAM,IAAI,CAAA;IACrB,QAAQ,EAAE,GAAG,CAAC,SAAS,CAAC,CAAA;IACxB,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,OAAO,CAAC,EAAE,OAAO,CAAA;IACjB,UAAU,CAAC,EAAE,OAAO,CAAA;IACpB,OAAO,CAAC,EAAE,MAAM,IAAI,CAAA;IACpB,EAAE,CAAC,EAAE,MAAM,IAAI,CAAA;IACf,KAAK,CAAC,EAAE,GAAG,CAAA;CACZ;AAED;;GAEG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC;IAC9B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAAC;CAC3C;AAED;;GAEG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC;IAC9B,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;IACf,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC,CAAE,SAAQ,aAAa,CAAC,CAAC,CAAC;IACnD,OAAO,EAAE,MAAM,IAAI,CAAC;IACpB,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,SAAS,CAAC;IAC9D,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;IAEjC,OAAO,EAAE,MAAM,IAAI,CAAC;CACrB;AAED;;;GAGG;AACH,MAAM,WAAW,eAAe,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI;IAC1C,2DAA2D;IAC3D,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,qFAAqF;IACrF,uBAAuB,CAAC,EAAE,OAAO,CAAC;IAClC,wEAAwE;IACxE,mBAAmB,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAAC;IACtD,4EAA4E;IAC5E,gBAAgB,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAAC;CAClD;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,OAAO,CAAC;IACnB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACzB,8BAA8B,CAAC,EAAE,OAAO,CAAC;CAC1C;AAGD,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,OAAO,CAAC;IACd,EAAE,EAAE,OAAO,CAAC;IACZ,gBAAgB,EAAE,MAAM,CAAC;IACzB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,OAAO,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,eAAe;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,cAAc;IAC7B,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,OAAO,CAAC;IACjB,IAAI,EAAE,OAAO,CAAC;IACd,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IACpB,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,OAAO,CAAC;IAClB,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,eAAe,CAAC;IACxB,QAAQ,EAAE,iBAAiB,CAAC;IAC5B,MAAM,EAAE,eAAe,CAAC;IACxB,KAAK,EAAE,cAAc,CAAC;IACtB,QAAQ,EAAE,iBAAiB,CAAC;IAC5B,QAAQ,EAAE,cAAc,CAAC;CAC1B;AAED,MAAM,WAAW,WAAW,CAAC,CAAC;IAC5B;;OAEG;IACH,KAAK,EAAE,CAAC,CAAC;IAET;;;OAGG;IACH,oBAAoB,EAAE,CAAC,CAAC;IAExB;;OAEG;IACH,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,IAAI,KAAK,SAAS,CAAC;IAE7C;;;OAGG;IACH,WAAW,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,IAAI,KAAK,SAAS,CAAC;CAC7C"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/core/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,QAAQ,CAAA;AAEhD,MAAM,MAAM,YAAY,GAAG,QAAQ,GAAG,UAAU,GAAG,QAAQ,GAAG,OAAO,GAAG,UAAU,GAAG,UAAU,CAAC;AAEhG,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,YAAY,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,EAAE,CAAC,EAAE,OAAO,CAAC;IACb,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,MAAM,CAAC;IACX,eAAe,EAAE,SAAS,EAAE,CAAC;IAC7B,UAAU,EAAE,OAAO,CAAC;CACrB;AAED,MAAM,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC;AACnC,MAAM,MAAM,QAAQ,GAAG,MAAM,SAAS,GAAG,IAAI,CAAC;AAC9C,MAAM,MAAM,KAAK,CAAC,CAAC,IAAI,MAAM,GAAG,MAAM,GAAG;IAAE,KAAI,MAAM,EAAE,kBAAkB,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;CAAE,CAAC;AAChG,MAAM,MAAM,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,kBAAkB,KAAK,CAAC,CAAC;AAE3D;;GAEG;AACH,MAAM,WAAW,WAAW,CAAC,CAAC;IAC5B;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IAElB;;OAEG;IACH,oBAAoB,CAAC,EAAE,CAAC,CAAC;IAEzB;;OAEG;IACH,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,IAAI,KAAK,SAAS,CAAC;IAE7C;;OAEG;IACH,WAAW,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,IAAI,KAAK,SAAS,CAAC;CAC7C;AAED;;;GAGG;AACH,MAAM,WAAW,MAAM,CAAC,CAAC,CAAE,SAAQ,WAAW,CAAC,CAAC,CAAC;IAC/C,KAAK,EAAE,CAAC,CAAC;IACT,OAAO,EAAE,MAAM,IAAI,CAAC;CACrB;AAED;;;GAGG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC,CAAE,SAAQ,WAAW,CAAC,CAAC,CAAC;IACjD,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IAClB,OAAO,EAAE,MAAM,IAAI,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,OAAO,CAAC;IACzB,YAAY,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACxB,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC;IACjB,IAAI,CAAC,EAAE,GAAG,CAAC;CACZ;AAED,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,GAAG,EAAE,MAAM,IAAI,CAAC;IAChB,SAAS,EAAE,MAAM,IAAI,CAAC;IACtB,QAAQ,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;IACzB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,IAAI,CAAC;IACrB,EAAE,CAAC,EAAE,MAAM,IAAI,CAAC;IAChB,KAAK,CAAC,EAAE,GAAG,CAAC;CACb;AAED,MAAM,WAAW,aAAa,CAAC,CAAC;IAC9B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAAC;CAC3C;AAED,MAAM,WAAW,aAAa,CAAC,CAAC;IAC9B,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;IACf,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED,MAAM,WAAW,QAAQ,CAAC,CAAC,CAAE,SAAQ,aAAa,CAAC,CAAC,CAAC;IACnD,OAAO,EAAE,MAAM,IAAI,CAAC;IACpB,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,SAAS,CAAC;IAC9D,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;IACjC,OAAO,EAAE,MAAM,IAAI,CAAC;CACrB;AAED,MAAM,WAAW,eAAe,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI;IAC1C,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,uBAAuB,CAAC,EAAE,OAAO,CAAC;IAClC,mBAAmB,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAAC;IACtD,gBAAgB,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAAC;CAClD;AAED,MAAM,WAAW,mBAAmB;IAClC,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,OAAO,CAAC;IACnB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACzB,8BAA8B,CAAC,EAAE,OAAO,CAAC;CAC1C;AAED,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,OAAO,CAAC;IACd,EAAE,EAAE,OAAO,CAAC;IACZ,gBAAgB,EAAE,MAAM,CAAC;IACzB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,OAAO,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,eAAe;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,cAAc;IAC7B,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,OAAO,CAAC;IACjB,IAAI,EAAE,OAAO,CAAC;IACd,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IACpB,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,OAAO,CAAC;IAClB,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,eAAe,CAAC;IACxB,QAAQ,EAAE,iBAAiB,CAAC;IAC5B,MAAM,EAAE,eAAe,CAAC;IACxB,KAAK,EAAE,cAAc,CAAC;IACtB,QAAQ,EAAE,iBAAiB,CAAC;IAC5B,QAAQ,EAAE,cAAc,CAAC;CAC1B"}

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,a=!0,o=0,s=!1,c=-1,l=2,u=new Set,d=new Map,f=new Set,p=new Set,m=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(_),i.type===`computed`&&i.subscribers.size===0&&m(i))}t.dependencies.clear(),t.depVersions&&t.depVersions.clear()}},h=t=>{if(!s||l===2)return t.run();if(p&&p.size>0){if(t.verifiedInEpoch===e.epoch&&e.batchDepth===0&&l===0)return!1}else if(t.verifiedInEpoch===e.epoch&&e.batchDepth===0)return!1;let n=!1;if(u&&u.size>0)for(let t of u){let r=t._node||t;if(r.type===`computed`&&r.update&&r.verifiedInEpoch!==e.epoch&&r.update(),t.hasBatchValue||d.get(t)!==r.version){n=!0;break}}return t.verifiedInEpoch=e.epoch,n||a?t.run():(l=0,!1)},g=0,_={id:e.subscriberId++,dependencies:u,subscribers:p,ownedEffects:f,depth:1,type:`computed`,fn:t,get version(){return o},get state(){return l},set state(e){l=e},get depVersions(){return d},verifiedInEpoch:-1,update:()=>h(_),run:()=>{if(c===e.epoch&&s&&l===0&&e.batchDepth===0)return!1;let r=e.epoch;if(c=r,_.verifiedInEpoch=r,e.cycleDetectionStack.has(_))throw Error(`[Graph Error] Cyclic dependency detected`);e.cycleDetectionStack.add(_);let p=e.activeConsumer,m=e.activeOwner;e.activeConsumer=_,e.activeOwner=_,g++,_.activeRunId=g;let h=u.size>0?Array.from(u):null;u.clear();try{if(f.size>0){for(let e of f)e&&typeof e.dispose==`function`&&e.dispose();f.clear()}let p=t();if(h!==null){let e=h.length===u.size;for(let t of h){let n=t;if(!e||!u.has(n)){let e=n._node||n;e.subscribers&&e.subscribers.delete(_),d.delete(n)}}}let m=a||!Object.is(i,p);if(m){let t=a?void 0:typeof i==`object`&&i?JSON.parse(JSON.stringify(i)):i;i=p,o++,e.log&&n&&e.log({type:`computed`,label:n,details:{from:t,to:p}})}a=!1,l=0,s=!0;let g=0;for(let e of u){let t=e,n=t._node||t;d.set(t,n.version),n.subscribers&&n.subscribers.add(_),n.depth!==void 0&&n.depth>g&&(g=n.depth)}return _.depth=g+1,e.epoch!==r&&(c=-1,_.verifiedInEpoch=-1,l=2),m}finally{e.activeConsumer=p,e.activeOwner=m,e.cycleDetectionStack.delete(_)}},markDirty:t=>{if(!(l>=t)){l=t;for(let t of p){let n=t._node||t;n.type===`effect`?(n.isDirty=!0,e.scheduleEffect(t)):n.markDirty&&n.markDirty(1)}}}},v={get value(){let t=e.activeConsumer;if(t&&t!==_){p.add(t),t.dependencies.add(_);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 h(_),t&&t.depVersions&&t.depVersions.set(v,o),i},get valueWithoutTracking(){return i},get version(){return o},get dependencies(){return u},subscribe(t){let n=this,r={id:e.subscriberId++,isDirty:!0,depth:9999,dependencies:new Set,type:`effect`,run:()=>{if(!r.isDisposed)try{t(n.value)}catch(e){console.error(e)}}};return p.add(r),t(this.value),()=>{r.isDisposed=!0,p.delete(r),r.dependencies.clear()}},subscribeState(e){return v.subscribe(e)},destroy:()=>{m(_),p&&p.clear(),e.computedCache.delete(t),u.clear(),d.clear(),f.clear(),a=!0,l=2,s=!1},__subscribe(t){let n={id:e.subscriberId++,type:`effect`,run:t,isDirty:!1};return p.add(n),()=>{p.delete(n)}}};return v.run=()=>_.run(),e.computedCache.set(t,v),v._node=_,v.subscribers=p,v}exports.createComputed=e;
+function e(e,t,n){let r=e.computedCache.get(t);if(r)return r;let i,a=!0,o=0,s=!1,c=-1,l=2,u=new Set,d=new Map,f=new Set,p=new Set,m=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(_),i.type===`computed`&&i.subscribers.size===0&&m(i))}t.dependencies.clear(),t.depVersions&&t.depVersions.clear()}},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;if(r.type===`computed`&&r.state>0&&r.update&&r.verifiedInEpoch!==e.epoch&&r.update(),t.hasBatchValue||d.get(t)!==r.version){n=!0;break}}return t.verifiedInEpoch=e.epoch,n||a?t.run():(l=0,!1)},g=0,_={id:e.subscriberId++,dependencies:u,subscribers:p,ownedEffects:f,depth:1,type:`computed`,fn:t,get version(){return o},get state(){return l},set state(e){l=e},get depVersions(){return d},verifiedInEpoch:-1,update:()=>h(_),run:()=>{if(c===e.epoch&&s&&l===0&&e.batchDepth===0)return!1;let r=e.epoch;if(c=r,_.verifiedInEpoch=r,e.cycleDetectionStack.has(_))throw Error(`[Graph Error] Cyclic dependency detected`);e.cycleDetectionStack.add(_);let p=e.activeConsumer,m=e.activeOwner;e.activeConsumer=_,e.activeOwner=_,g++,_.activeRunId=g;let h=u.size>0?Array.from(u):null;u.clear();try{if(f.size>0){for(let e of f)e&&typeof e.dispose==`function`&&e.dispose();f.clear()}let p=t();if(h!==null){let e=h.length===u.size;for(let t of h){let n=t;if(!e||!u.has(n)){let e=n._node||n;e.subscribers&&e.subscribers.delete(_),d.delete(n)}}}let m=a||!Object.is(i,p);if(m){let t=a?void 0:typeof i==`object`&&i?JSON.parse(JSON.stringify(i)):i;i=p,o++,e.log&&n&&e.log({type:`computed`,label:n,details:{from:t,to:p}})}a=!1,l=0,s=!0;let g=0;for(let e of u){let t=e,n=t._node||t;d.set(t,n.version),n.subscribers&&n.subscribers.add(_),n.depth!==void 0&&n.depth>g&&(g=n.depth)}return _.depth=g+1,e.epoch!==r&&(c=-1,_.verifiedInEpoch=-1,l=2),m}finally{e.activeConsumer=p,e.activeOwner=m,e.cycleDetectionStack.delete(_)}},markDirty:t=>{if(!(l>=t)){l=t;for(let t of p){let n=t._node||t;n.type===`effect`?(n.isDirty=!0,e.scheduleEffect(t)):n.markDirty&&n.markDirty(1)}}}},v={get value(){let t=e.activeConsumer;if(t&&t!==_){p.add(t),t.dependencies.add(_);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 h(_),t&&t.depVersions&&t.depVersions.set(v,o),i},get valueWithoutTracking(){return i},get version(){return o},get dependencies(){return u},subscribe(t){let n=this,r={id:e.subscriberId++,isDirty:!0,depth:9999,dependencies:new Set,type:`effect`,run:()=>{if(!r.isDisposed)try{t(n.value)}catch(e){console.error(e)}}};return p.add(r),t(this.value),()=>{r.isDisposed=!0,p.delete(r),r.dependencies.clear()}},subscribeState(e){return v.subscribe(e)},destroy:()=>{m(_),p&&p.clear(),e.computedCache.delete(t),u.clear(),d.clear(),f.clear(),a=!0,l=2,s=!1},__subscribe(t){let n={id:e.subscriberId++,type:`effect`,run:t,isDirty:!1};return p.add(n),()=>{p.delete(n)}}};return v.run=()=>_.run(),e.computedCache.set(t,v),v._node=_,v.subscribers=p,v}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  // Работает со скоростью нативной ссылки в 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    // ⚛️ ФИНАЛЬНЫЙ ЭТАЛОННЫЙ ГВАРД ЯДРА (Observed vs Unobserved Smart Bypass):\n    // Если у узла ЕСТЬ подписчики (observed-граф), мы применяем ультра-быстрый выход по эпохам.\n    // Но если подписчиков НЕТ (unobserved пулл-тесты), мы пропускаем этот гвард, если эпоха ядра изменилась.\n    // Это заставляет код ниже честно проверить версии родителей по цепочке, сохраняя 100% Glitch-Free ленивость!\n    if (subscribers && subscribers.size > 0) {\n      if (node.verifiedInEpoch === engine.epoch && engine.batchDepth === 0 && state === 0) {\n        return false\n      }\n    } else {\n    // В unobserved-режиме, если эпоха ядра совпадает с верификацией, мутаций не было — отдаем кэш за O(1)\n      if (node.verifiedInEpoch === engine.epoch && engine.batchDepth === 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') {\n        // Защита от глубокой квадратичной рекурсии\n          if (rawDep.update && rawDep.verifiedInEpoch !== engine.epoch) {\n            rawDep.update()\n          }\n        }\n\n        // Честная проверка физических изменений: если версия родителя сдвинулась,\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      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 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,EACA,EACA,EACa,CAGb,IAAM,EAAW,EAAO,cAAc,IAAI,CAAE,EAC5C,GAAI,EAAU,OAAO,EAErB,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,EAEM,EAAqB,GAAuB,CAChD,GAAI,CAAC,GAAiB,IAAU,EAC9B,OAAO,EAAK,IAAI,EAOlB,GAAI,GAAe,EAAY,KAAO,MAChC,EAAK,kBAAoB,EAAO,OAAS,EAAO,aAAe,GAAK,IAAU,EAChF,MAAO,EAAA,MAIT,GAAI,EAAK,kBAAoB,EAAO,OAAS,EAAO,aAAe,EACjE,MAAO,GAIX,IAAI,EAAmB,GAEvB,GAAI,GAAgB,EAAa,KAAO,EACtC,IAAK,IAAM,KAAO,EAAc,CAC9B,IAAM,EAAS,EAAI,OAAS,EAW5B,GATI,EAAO,OAAS,YAEd,EAAO,QAAU,EAAO,kBAAoB,EAAO,OACrD,EAAO,OAAO,EAMd,EAAI,eAAiB,EAAY,IAAI,CAAG,IAAM,EAAO,QAAS,CAChE,EAAmB,GACnB,KACF,CACF,CAUF,MAPA,GAAK,gBAAkB,EAAO,MAE1B,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,gBAAiB,GACjB,WAAc,EAAkB,CAAY,EAC5C,QAAW,CAET,GAAI,IAAqB,EAAO,OAAS,GAAiB,IAAU,GAAK,EAAO,aAAe,EAC7F,MAAO,GAIT,IAAM,EAAa,EAAO,MAI1B,GAHA,EAAmB,EACnB,EAAa,gBAAkB,EAE3B,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,CAGA,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,CAcA,MAZA,GAAa,MAAQ,EAAc,EAM/B,EAAO,QAAU,IACnB,EAAmB,GACnB,EAAa,gBAAkB,GAC/B,EAAQ,GAGH,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,EAAO,KACP,EAAkB,CACtB,GAAI,EAAO,eACX,QAAS,GACT,MAAO,KACP,aAAc,IAAI,IAClB,KAAM,SACN,QAAW,CACL,MAAW,WACf,GAAI,CAAE,EAAG,EAAK,KAAK,CAAE,OAAS,EAAK,CAAE,QAAQ,MAAM,CAAG,CAAE,CAC1D,CACF,EAGA,OAFA,EAAY,IAAI,CAAU,EAC1B,EAAG,KAAK,KAAK,MACA,CACX,EAAW,WAAa,GACxB,EAAY,OAAO,CAAU,EAC7B,EAAW,aAAa,MAAM,CAChC,CACF,EACA,eAAe,EAA2B,CACxC,OAAQ,EAAyB,UAAU,CAAE,CAC/C,EACA,YAAe,CACb,EAAY,CAAY,EACpB,GAAa,EAAY,MAAM,EACnC,EAAO,cAAc,OAAO,CAAE,EAE9B,EAAa,MAAM,EACnB,EAAY,MAAM,EAClB,EAAa,MAAM,EAEnB,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,EAQA,MANA,GAAiB,QAAY,EAAa,IAAI,EAC9C,EAAO,cAAc,IAAI,EAAI,CAAgB,EAE5C,EAA0B,MAAQ,EAClC,EAA0B,YAAc,EAElC,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  // Работает со скоростью нативной ссылки в 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      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 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,EACA,EACA,EACa,CAGb,IAAM,EAAW,EAAO,cAAc,IAAI,CAAE,EAC5C,GAAI,EAAU,OAAO,EAErB,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,EAEM,EAAqB,GAAuB,CAChD,GAAI,CAAC,GAAiB,IAAU,EAC9B,OAAO,EAAK,IAAI,EAOlB,GAAI,GAAe,EAAY,KAAO,GAChC,EAAK,kBAAoB,EAAO,OAAS,EAAO,aAAe,GAAK,IAAU,EAChF,MAAO,GAIX,IAAI,EAAmB,GAEvB,GAAI,GAAgB,EAAa,KAAO,EACtC,IAAK,IAAM,KAAO,EAAc,CAC9B,IAAM,EAAS,EAAI,OAAS,EAa5B,GAXI,EAAO,OAAS,YAAc,EAAO,MAAQ,GAI3C,EAAO,QAAU,EAAO,kBAAoB,EAAO,OACrD,EAAO,OAAO,EAMd,EAAI,eAAiB,EAAY,IAAI,CAAG,IAAM,EAAO,QAAS,CAChE,EAAmB,GACnB,KACF,CACF,CAUF,MAPA,GAAK,gBAAkB,EAAO,MAE1B,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,gBAAiB,GACjB,WAAc,EAAkB,CAAY,EAC5C,QAAW,CAET,GAAI,IAAqB,EAAO,OAAS,GAAiB,IAAU,GAAK,EAAO,aAAe,EAC7F,MAAO,GAIT,IAAM,EAAa,EAAO,MAI1B,GAHA,EAAmB,EACnB,EAAa,gBAAkB,EAE3B,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,CAGA,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,CAcA,MAZA,GAAa,MAAQ,EAAc,EAM/B,EAAO,QAAU,IACnB,EAAmB,GACnB,EAAa,gBAAkB,GAC/B,EAAQ,GAGH,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,EAAO,KACP,EAAkB,CACtB,GAAI,EAAO,eACX,QAAS,GACT,MAAO,KACP,aAAc,IAAI,IAClB,KAAM,SACN,QAAW,CACL,MAAW,WACf,GAAI,CAAE,EAAG,EAAK,KAAK,CAAE,OAAS,EAAK,CAAE,QAAQ,MAAM,CAAG,CAAE,CAC1D,CACF,EAGA,OAFA,EAAY,IAAI,CAAU,EAC1B,EAAG,KAAK,KAAK,MACA,CACX,EAAW,WAAa,GACxB,EAAY,OAAO,CAAU,EAC7B,EAAW,aAAa,MAAM,CAChC,CACF,EACA,eAAe,EAA2B,CACxC,OAAQ,EAAyB,UAAU,CAAE,CAC/C,EACA,YAAe,CACb,EAAY,CAAY,EACpB,GAAa,EAAY,MAAM,EACnC,EAAO,cAAc,OAAO,CAAE,EAE9B,EAAa,MAAM,EACnB,EAAY,MAAM,EAClB,EAAa,MAAM,EAEnB,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,EAQA,MANA,GAAiB,QAAY,EAAa,IAAI,EAC9C,EAAO,cAAc,IAAI,EAAI,CAAgB,EAE5C,EAA0B,MAAQ,EAClC,EAA0B,YAAc,EAElC,CACT"}

package/dist/core.method.computed.mjs

@@ -14,13 +14,11 @@ function e(e, t, n) {
 		}
 	}, h = (t) => {
 		if (!s || l === 2) return t.run();
-		if (p && p.size > 0) {
-			if (t.verifiedInEpoch === e.epoch && e.batchDepth === 0 && l === 0) return !1;
-		} else if (t.verifiedInEpoch === e.epoch && e.batchDepth === 0) return !1;
+		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;
-			if (r.type === "computed" && r.update && r.verifiedInEpoch !== e.epoch && r.update(), t.hasBatchValue || d.get(t) !== r.version) {
+			if (r.type === "computed" && r.state > 0 && r.update && r.verifiedInEpoch !== e.epoch && r.update(), t.hasBatchValue || d.get(t) !== r.version) {
 				n = !0;
 				break;
 			}

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    // ⚛️ ФИНАЛЬНЫЙ ЭТАЛОННЫЙ ГВАРД ЯДРА (Observed vs Unobserved Smart Bypass):\n    // Если у узла ЕСТЬ подписчики (observed-граф), мы применяем ультра-быстрый выход по эпохам.\n    // Но если подписчиков НЕТ (unobserved пулл-тесты), мы пропускаем этот гвард, если эпоха ядра изменилась.\n    // Это заставляет код ниже честно проверить версии родителей по цепочке, сохраняя 100% Glitch-Free ленивость!\n    if (subscribers && subscribers.size > 0) {\n      if (node.verifiedInEpoch === engine.epoch && engine.batchDepth === 0 && state === 0) {\n        return false\n      }\n    } else {\n    // В unobserved-режиме, если эпоха ядра совпадает с верификацией, мутаций не было — отдаем кэш за O(1)\n      if (node.verifiedInEpoch === engine.epoch && engine.batchDepth === 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') {\n        // Защита от глубокой квадратичной рекурсии\n          if (rawDep.update && rawDep.verifiedInEpoch !== engine.epoch) {\n            rawDep.update()\n          }\n        }\n\n        // Честная проверка физических изменений: если версия родителя сдвинулась,\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      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 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;OAChC,EAAK,oBAAoB,EAAO,SAAS,EAAO,eAAe,KAAK,MAAU,GAChF,OAAO;EAAA,OAIT,IAAI,EAAK,oBAAoB,EAAO,SAAS,EAAO,eAAe,GACjE,OAAO;EAIX,IAAI,IAAmB;EAEvB,IAAI,KAAgB,EAAa,OAAO,GACtC,KAAK,IAAM,KAAO,GAAc;GAC9B,IAAM,IAAS,EAAI,SAAS;GAW5B,IATI,EAAO,SAAS,cAEd,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;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,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      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 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;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,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/react/hooks/useReactiveValue.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"useReactiveValue.cjs","names":[],"sources":["../../../src/react/hooks/useReactiveValue.ts"],"sourcesContent":["import { useSyncExternalStore, useDebugValue, useMemo, useRef, useState } from 'react'\nimport { ISignalLike } from '../../core/types'\n\nexport function useReactiveValue<V>(signal: ISignalLike<V> | any): V {\n  const isProxy = signal && typeof signal === 'object' && '__subscribe' in signal\n  const isSignal = signal && typeof signal === 'object' && 'subscribe' in signal\n\n  if (!isSignal && !isProxy) {\n    return signal\n  }\n\n  const rawNode = (signal as any)._node || signal\n  const engine = rawNode.engine || (signal as any).engine\n\n  // Локальный тикет рендеринга для useSyncExternalStore.\n  // Это ЕДИНСТВЕННЫЙ детерминированный источник истины для React Concurrent Mode.\n  const [ticket, setTicket] = useState(0)\n\n  // 🟢 КАНОНИЧЕСКИЙ ВЕРСИОННЫЙ СНАПШOТ useSyncExternalStore С СИНХРOННЫМ ПOДТЯГИВАНИЕМ КЭША\n  useSyncExternalStore(\n    // 1. Фаза подписки: Доверяем push-уведомлениям Ядра для запуска ререндера React\n    useMemo(() => (onStoreChange: () => void) => {\n      const triggerStoreRerender = () => {\n        setTicket((t) => t + 1)\n        onStoreChange()\n      }\n\n      // Для вычисляемых свойств используем скрытый __subscribe, который ловит markDirty(1)\n      if (rawNode.type === 'computed' && typeof (signal as any).__subscribe === 'function') {\n        return (signal as any).__subscribe(triggerStoreRerender)\n      }\n\n      if (rawNode.type !== 'computed' && '__subscribe' in signal && typeof (signal as any).__subscribe === 'function') {\n        return (signal as any).__subscribe(triggerStoreRerender)\n      }\n\n      return signal.subscribe(triggerStoreRerender)\n    }, [signal, rawNode]),\n\n    // 2. getSnapshot: Чистая, snapshot-безопасная O(1) операция!\n    // Мы СТРОГО возвращаем локальный ticket, изолируя React от бесконечного инкремента engine.epoch.\n    // Это намертво защищает от краша \"Maximum update depth exceeded\"!\n    () => ticket,\n\n    // SSR Снапшот\n    () => 0\n  )\n\n  useDebugValue(ticket)\n\n  // ⚛️ ТОПОЛОГИЧЕСКИЙ Pull (Безопасный Рендеринг из O(1) кэша ядра):\n  // Вычисляем граф и стягиваем свежее значение непосредственно в теле рендера.\n  // Оборачиваем в untrack, чтобы сам рендеринг React не создавал паразитных связей.\n  if (engine && 'untrack' in engine) {\n    return engine.untrack(() => (signal.value !== undefined ? signal.value : signal))\n  }\n\n  return signal.value !== undefined ? signal.value : signal\n}\n"],"mappings":"uBAGA,SAAgB,EAAoB,EAAiC,CACnE,IAAM,EAAU,GAAU,OAAO,GAAW,UAAY,gBAAiB,EAGzE,GAAI,EAFa,GAAU,OAAO,GAAW,UAAY,cAAe,IAEvD,CAAC,EAChB,OAAO,EAGT,IAAM,EAAW,EAAe,OAAS,EACnC,EAAS,EAAQ,QAAW,EAAe,OAI3C,CAAC,EAAQ,IAAA,EAAA,EAAA,SAAA,CAAsB,CAAC,EAyCtC,OAtCA,EAAA,EAAA,qBAAA,EAAA,EAAA,EAAA,QAAA,KAEiB,GAA8B,CAC3C,IAAM,MAA6B,CACjC,EAAW,GAAM,EAAI,CAAC,EACtB,EAAc,CAChB,EAWA,OARI,EAAQ,OAAS,YAAc,OAAQ,EAAe,aAAgB,YAItE,EAAQ,OAAS,YAAc,gBAAiB,GAAU,OAAQ,EAAe,aAAgB,WAC3F,EAAe,YAAY,CAAoB,EAGlD,EAAO,UAAU,CAAoB,CAC9C,EAAG,CAAC,EAAQ,CAAO,CAAC,MAKd,MAGA,CACR,GAEA,EAAA,EAAA,cAAA,CAAc,CAAM,EAKhB,GAAU,YAAa,EAClB,EAAO,YAAe,EAAO,QAAU,IAAA,GAA2B,EAAf,EAAO,KAAe,EAG3E,EAAO,QAAU,IAAA,GAA2B,EAAf,EAAO,KAC7C"}
+{"version":3,"file":"useReactiveValue.cjs","names":[],"sources":["../../../src/react/hooks/useReactiveValue.ts"],"sourcesContent":["import { useSyncExternalStore, useDebugValue, useMemo, useState } from 'react'\nimport { ISignalLike } from '../../core/types'\n\n/**\n * ⚛️ УЛЬТИМАТИВНЫЙ ХУК ДЛЯ СТЯГИВАНИЯ ДАННЫХ ИЗ ГРАФА В СРЕДУ REACT\n * Автоматически выводит тип внутренней структуры данных (V) из любого сигнала или вычисляемого свойства.\n */\nexport function useReactiveValue<V>(signal: ISignalLike<V>): V;\nexport function useReactiveValue<T extends object>(proxy: T): T;\nexport function useReactiveValue<T>(primitive: T): T;\nexport function useReactiveValue(signal: any): any {\n  const isProxy = signal && typeof signal === 'object' && '__subscribe' in signal\n  const isSignal = signal && typeof signal === 'object' && 'subscribe' in signal\n\n  if (!isSignal && !isProxy) {\n    return signal\n  }\n\n  const rawNode = signal._node || signal\n  const engine = rawNode.engine || signal.engine\n\n  // Локальный тикет рендеринга для useSyncExternalStore.\n  const [ticket, setTicket] = useState(0)\n\n  // 🟢 КАНОНИЧЕСКИЙ ВЕРСИОННЫЙ СНАПШOТ useSyncExternalStore С СИНХРOННЫМ ПOДТЯГИВАНИЕМ КЭША\n  useSyncExternalStore(\n    useMemo(() => (onStoreChange: () => void) => {\n      const triggerStoreRerender = () => {\n        setTicket((t) => t + 1)\n        onStoreChange()\n      }\n\n      if (rawNode.type === 'computed' && typeof signal.__subscribe === 'function') {\n        return signal.__subscribe(triggerStoreRerender)\n      }\n\n      if (rawNode.type !== 'computed' && '__subscribe' in signal && typeof signal.__subscribe === 'function') {\n        return signal.__subscribe(triggerStoreRerender)\n      }\n\n      return signal.subscribe(triggerStoreRerender)\n    }, [signal, rawNode]),\n\n    () => ticket,\n    () => 0\n  )\n\n  useDebugValue(ticket)\n\n  // ⚛️ ТОПОЛОГИЧЕСКИЙ Pull: Стягиваем свежее значение в теле рендера под untrack\n  if (engine && 'untrack' in engine) {\n    return engine.untrack(() => (signal.value !== undefined ? signal.value : signal))\n  }\n\n  return signal.value !== undefined ? signal.value : signal\n}\n"],"mappings":"uBAUA,SAAgB,EAAiB,EAAkB,CACjD,IAAM,EAAU,GAAU,OAAO,GAAW,UAAY,gBAAiB,EAGzE,GAAI,EAFa,GAAU,OAAO,GAAW,UAAY,cAAe,IAEvD,CAAC,EAChB,OAAO,EAGT,IAAM,EAAU,EAAO,OAAS,EAC1B,EAAS,EAAQ,QAAU,EAAO,OAGlC,CAAC,EAAQ,IAAA,EAAA,EAAA,SAAA,CAAsB,CAAC,EAgCtC,OA7BA,EAAA,EAAA,qBAAA,EAAA,EAAA,EAAA,QAAA,KACiB,GAA8B,CAC3C,IAAM,MAA6B,CACjC,EAAW,GAAM,EAAI,CAAC,EACtB,EAAc,CAChB,EAUA,OARI,EAAQ,OAAS,YAAc,OAAO,EAAO,aAAgB,YAI7D,EAAQ,OAAS,YAAc,gBAAiB,GAAU,OAAO,EAAO,aAAgB,WACnF,EAAO,YAAY,CAAoB,EAGzC,EAAO,UAAU,CAAoB,CAC9C,EAAG,CAAC,EAAQ,CAAO,CAAC,MAEd,MACA,CACR,GAEA,EAAA,EAAA,cAAA,CAAc,CAAM,EAGhB,GAAU,YAAa,EAClB,EAAO,YAAe,EAAO,QAAU,IAAA,GAA2B,EAAf,EAAO,KAAe,EAG3E,EAAO,QAAU,IAAA,GAA2B,EAAf,EAAO,KAC7C"}

package/dist/react/hooks/useReactiveValue.d.ts

@@ -1,3 +1,9 @@
 import { ISignalLike } from '../../core/types';
-export declare function useReactiveValue<V>(signal: ISignalLike<V> | any): V;
+/**
+ * ⚛️ УЛЬТИМАТИВНЫЙ ХУК ДЛЯ СТЯГИВАНИЯ ДАННЫХ ИЗ ГРАФА В СРЕДУ REACT
+ * Автоматически выводит тип внутренней структуры данных (V) из любого сигнала или вычисляемого свойства.
+ */
+export declare function useReactiveValue<V>(signal: ISignalLike<V>): V;
+export declare function useReactiveValue<T extends object>(proxy: T): T;
+export declare function useReactiveValue<T>(primitive: T): T;
 //# sourceMappingURL=useReactiveValue.d.ts.map

package/dist/react/hooks/useReactiveValue.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"useReactiveValue.d.ts","sourceRoot":"","sources":["../../../src/react/hooks/useReactiveValue.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AAE9C,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAuDnE"}
+{"version":3,"file":"useReactiveValue.d.ts","sourceRoot":"","sources":["../../../src/react/hooks/useReactiveValue.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AAE9C;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAC/D,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;AAChE,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC"}

package/dist/react/hooks/useReactiveValue.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"useReactiveValue.mjs","names":[],"sources":["../../../src/react/hooks/useReactiveValue.ts"],"sourcesContent":["import { useSyncExternalStore, useDebugValue, useMemo, useRef, useState } from 'react'\nimport { ISignalLike } from '../../core/types'\n\nexport function useReactiveValue<V>(signal: ISignalLike<V> | any): V {\n  const isProxy = signal && typeof signal === 'object' && '__subscribe' in signal\n  const isSignal = signal && typeof signal === 'object' && 'subscribe' in signal\n\n  if (!isSignal && !isProxy) {\n    return signal\n  }\n\n  const rawNode = (signal as any)._node || signal\n  const engine = rawNode.engine || (signal as any).engine\n\n  // Локальный тикет рендеринга для useSyncExternalStore.\n  // Это ЕДИНСТВЕННЫЙ детерминированный источник истины для React Concurrent Mode.\n  const [ticket, setTicket] = useState(0)\n\n  // 🟢 КАНОНИЧЕСКИЙ ВЕРСИОННЫЙ СНАПШOТ useSyncExternalStore С СИНХРOННЫМ ПOДТЯГИВАНИЕМ КЭША\n  useSyncExternalStore(\n    // 1. Фаза подписки: Доверяем push-уведомлениям Ядра для запуска ререндера React\n    useMemo(() => (onStoreChange: () => void) => {\n      const triggerStoreRerender = () => {\n        setTicket((t) => t + 1)\n        onStoreChange()\n      }\n\n      // Для вычисляемых свойств используем скрытый __subscribe, который ловит markDirty(1)\n      if (rawNode.type === 'computed' && typeof (signal as any).__subscribe === 'function') {\n        return (signal as any).__subscribe(triggerStoreRerender)\n      }\n\n      if (rawNode.type !== 'computed' && '__subscribe' in signal && typeof (signal as any).__subscribe === 'function') {\n        return (signal as any).__subscribe(triggerStoreRerender)\n      }\n\n      return signal.subscribe(triggerStoreRerender)\n    }, [signal, rawNode]),\n\n    // 2. getSnapshot: Чистая, snapshot-безопасная O(1) операция!\n    // Мы СТРОГО возвращаем локальный ticket, изолируя React от бесконечного инкремента engine.epoch.\n    // Это намертво защищает от краша \"Maximum update depth exceeded\"!\n    () => ticket,\n\n    // SSR Снапшот\n    () => 0\n  )\n\n  useDebugValue(ticket)\n\n  // ⚛️ ТОПОЛОГИЧЕСКИЙ Pull (Безопасный Рендеринг из O(1) кэша ядра):\n  // Вычисляем граф и стягиваем свежее значение непосредственно в теле рендера.\n  // Оборачиваем в untrack, чтобы сам рендеринг React не создавал паразитных связей.\n  if (engine && 'untrack' in engine) {\n    return engine.untrack(() => (signal.value !== undefined ? signal.value : signal))\n  }\n\n  return signal.value !== undefined ? signal.value : signal\n}\n"],"mappings":";;AAGA,SAAgB,EAAoB,GAAiC;CACnE,IAAM,IAAU,KAAU,OAAO,KAAW,YAAY,iBAAiB;CAGzE,IAAI,EAFa,KAAU,OAAO,KAAW,YAAY,eAAe,MAEvD,CAAC,GAChB,OAAO;CAGT,IAAM,IAAW,EAAe,SAAS,GACnC,IAAS,EAAQ,UAAW,EAAe,QAI3C,CAAC,GAAQ,KAAa,EAAS,CAAC;CAyCtC,OAtCA,EAEE,SAAe,MAA8B;EAC3C,IAAM,UAA6B;GAEjC,AADA,GAAW,MAAM,IAAI,CAAC,GACtB,EAAc;EAChB;EAWA,OARI,EAAQ,SAAS,cAAc,OAAQ,EAAe,eAAgB,cAItE,EAAQ,SAAS,cAAc,iBAAiB,KAAU,OAAQ,EAAe,eAAgB,aAC3F,EAAe,YAAY,CAAoB,IAGlD,EAAO,UAAU,CAAoB;CAC9C,GAAG,CAAC,GAAQ,CAAO,CAAC,SAKd,SAGA,CACR,GAEA,EAAc,CAAM,GAKhB,KAAU,aAAa,IAClB,EAAO,cAAe,EAAO,UAAU,KAAA,IAA2B,IAAf,EAAO,KAAe,IAG3E,EAAO,UAAU,KAAA,IAA2B,IAAf,EAAO;AAC7C"}
+{"version":3,"file":"useReactiveValue.mjs","names":[],"sources":["../../../src/react/hooks/useReactiveValue.ts"],"sourcesContent":["import { useSyncExternalStore, useDebugValue, useMemo, useState } from 'react'\nimport { ISignalLike } from '../../core/types'\n\n/**\n * ⚛️ УЛЬТИМАТИВНЫЙ ХУК ДЛЯ СТЯГИВАНИЯ ДАННЫХ ИЗ ГРАФА В СРЕДУ REACT\n * Автоматически выводит тип внутренней структуры данных (V) из любого сигнала или вычисляемого свойства.\n */\nexport function useReactiveValue<V>(signal: ISignalLike<V>): V;\nexport function useReactiveValue<T extends object>(proxy: T): T;\nexport function useReactiveValue<T>(primitive: T): T;\nexport function useReactiveValue(signal: any): any {\n  const isProxy = signal && typeof signal === 'object' && '__subscribe' in signal\n  const isSignal = signal && typeof signal === 'object' && 'subscribe' in signal\n\n  if (!isSignal && !isProxy) {\n    return signal\n  }\n\n  const rawNode = signal._node || signal\n  const engine = rawNode.engine || signal.engine\n\n  // Локальный тикет рендеринга для useSyncExternalStore.\n  const [ticket, setTicket] = useState(0)\n\n  // 🟢 КАНОНИЧЕСКИЙ ВЕРСИОННЫЙ СНАПШOТ useSyncExternalStore С СИНХРOННЫМ ПOДТЯГИВАНИЕМ КЭША\n  useSyncExternalStore(\n    useMemo(() => (onStoreChange: () => void) => {\n      const triggerStoreRerender = () => {\n        setTicket((t) => t + 1)\n        onStoreChange()\n      }\n\n      if (rawNode.type === 'computed' && typeof signal.__subscribe === 'function') {\n        return signal.__subscribe(triggerStoreRerender)\n      }\n\n      if (rawNode.type !== 'computed' && '__subscribe' in signal && typeof signal.__subscribe === 'function') {\n        return signal.__subscribe(triggerStoreRerender)\n      }\n\n      return signal.subscribe(triggerStoreRerender)\n    }, [signal, rawNode]),\n\n    () => ticket,\n    () => 0\n  )\n\n  useDebugValue(ticket)\n\n  // ⚛️ ТОПОЛОГИЧЕСКИЙ Pull: Стягиваем свежее значение в теле рендера под untrack\n  if (engine && 'untrack' in engine) {\n    return engine.untrack(() => (signal.value !== undefined ? signal.value : signal))\n  }\n\n  return signal.value !== undefined ? signal.value : signal\n}\n"],"mappings":";;AAUA,SAAgB,EAAiB,GAAkB;CACjD,IAAM,IAAU,KAAU,OAAO,KAAW,YAAY,iBAAiB;CAGzE,IAAI,EAFa,KAAU,OAAO,KAAW,YAAY,eAAe,MAEvD,CAAC,GAChB,OAAO;CAGT,IAAM,IAAU,EAAO,SAAS,GAC1B,IAAS,EAAQ,UAAU,EAAO,QAGlC,CAAC,GAAQ,KAAa,EAAS,CAAC;CAgCtC,OA7BA,EACE,SAAe,MAA8B;EAC3C,IAAM,UAA6B;GAEjC,AADA,GAAW,MAAM,IAAI,CAAC,GACtB,EAAc;EAChB;EAUA,OARI,EAAQ,SAAS,cAAc,OAAO,EAAO,eAAgB,cAI7D,EAAQ,SAAS,cAAc,iBAAiB,KAAU,OAAO,EAAO,eAAgB,aACnF,EAAO,YAAY,CAAoB,IAGzC,EAAO,UAAU,CAAoB;CAC9C,GAAG,CAAC,GAAQ,CAAO,CAAC,SAEd,SACA,CACR,GAEA,EAAc,CAAM,GAGhB,KAAU,aAAa,IAClB,EAAO,cAAe,EAAO,UAAU,KAAA,IAA2B,IAAf,EAAO,KAAe,IAG3E,EAAO,UAAU,KAAA,IAA2B,IAAf,EAAO;AAC7C"}

package/dist/reactive-engine.umd.js

@@ -1,5 +1,5 @@
 /*!
- * @pravosleva/reactive-engine v2.6.0-beta.4
+ * @pravosleva/reactive-engine v2.6.1
  * High-performance transactional reactive engine with microtask batching.
  *
  * @license MIT
@@ -9,5 +9,5 @@
  * @contact Telegram Channel: https://t.me/bash_exp_ru/3393
  * @contact Developer Telegram: https://t.me/pravosleva
  */
-(function(e,t){typeof exports==`object`&&typeof module<`u`?t(exports):typeof define==`function`&&define.amd?define([`exports`],t):(e=typeof globalThis<`u`?globalThis:e||self,t(e.ReactiveEngineLib={}))})(this,function(e){Object.defineProperty(e,Symbol.toStringTag,{value:`Module`});function t(e,t,n){let r=e.computedCache.get(t);if(r)return r;let i,a=!0,o=0,s=!1,c=-1,l=2,u=new Set,d=new Map,f=new Set,p=new Set,m=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(_),i.type===`computed`&&i.subscribers.size===0&&m(i))}t.dependencies.clear(),t.depVersions&&t.depVersions.clear()}},h=t=>{if(!s||l===2)return t.run();if(p&&p.size>0){if(t.verifiedInEpoch===e.epoch&&e.batchDepth===0&&l===0)return!1}else if(t.verifiedInEpoch===e.epoch&&e.batchDepth===0)return!1;let n=!1;if(u&&u.size>0)for(let t of u){let r=t._node||t;if(r.type===`computed`&&r.update&&r.verifiedInEpoch!==e.epoch&&r.update(),t.hasBatchValue||d.get(t)!==r.version){n=!0;break}}return t.verifiedInEpoch=e.epoch,n||a?t.run():(l=0,!1)},g=0,_={id:e.subscriberId++,dependencies:u,subscribers:p,ownedEffects:f,depth:1,type:`computed`,fn:t,get version(){return o},get state(){return l},set state(e){l=e},get depVersions(){return d},verifiedInEpoch:-1,update:()=>h(_),run:()=>{if(c===e.epoch&&s&&l===0&&e.batchDepth===0)return!1;let r=e.epoch;if(c=r,_.verifiedInEpoch=r,e.cycleDetectionStack.has(_))throw Error(`[Graph Error] Cyclic dependency detected`);e.cycleDetectionStack.add(_);let p=e.activeConsumer,m=e.activeOwner;e.activeConsumer=_,e.activeOwner=_,g++,_.activeRunId=g;let h=u.size>0?Array.from(u):null;u.clear();try{if(f.size>0){for(let e of f)e&&typeof e.dispose==`function`&&e.dispose();f.clear()}let p=t();if(h!==null){let e=h.length===u.size;for(let t of h){let n=t;if(!e||!u.has(n)){let e=n._node||n;e.subscribers&&e.subscribers.delete(_),d.delete(n)}}}let m=a||!Object.is(i,p);if(m){let t=a?void 0:typeof i==`object`&&i?JSON.parse(JSON.stringify(i)):i;i=p,o++,e.log&&n&&e.log({type:`computed`,label:n,details:{from:t,to:p}})}a=!1,l=0,s=!0;let g=0;for(let e of u){let t=e,n=t._node||t;d.set(t,n.version),n.subscribers&&n.subscribers.add(_),n.depth!==void 0&&n.depth>g&&(g=n.depth)}return _.depth=g+1,e.epoch!==r&&(c=-1,_.verifiedInEpoch=-1,l=2),m}finally{e.activeConsumer=p,e.activeOwner=m,e.cycleDetectionStack.delete(_)}},markDirty:t=>{if(!(l>=t)){l=t;for(let t of p){let n=t._node||t;n.type===`effect`?(n.isDirty=!0,e.scheduleEffect(t)):n.markDirty&&n.markDirty(1)}}}},v={get value(){let t=e.activeConsumer;if(t&&t!==_){p.add(t),t.dependencies.add(_);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 h(_),t&&t.depVersions&&t.depVersions.set(v,o),i},get valueWithoutTracking(){return i},get version(){return o},get dependencies(){return u},subscribe(t){let n=this,r={id:e.subscriberId++,isDirty:!0,depth:9999,dependencies:new Set,type:`effect`,run:()=>{if(!r.isDisposed)try{t(n.value)}catch(e){console.error(e)}}};return p.add(r),t(this.value),()=>{r.isDisposed=!0,p.delete(r),r.dependencies.clear()}},subscribeState(e){return v.subscribe(e)},destroy:()=>{m(_),p&&p.clear(),e.computedCache.delete(t),u.clear(),d.clear(),f.clear(),a=!0,l=2,s=!1},__subscribe(t){let n={id:e.subscriberId++,type:`effect`,run:t,isDirty:!1};return p.add(n),()=>{p.delete(n)}}};return v.run=()=>_.run(),e.computedCache.set(t,v),v._node=_,v.subscribers=p,v}var n=({tested:e,expectedKey:t,valueType:n})=>{let r=[];if(!e||!Array.isArray(e))return r;for(let i=0,a=e.length;i<a;i++){let a=e[i];if(typeof a!=`string`)continue;let o;switch(n){case`number`:o=RegExp(`\\[${t}=(?<value>\\d+)\\]`,`g`);break;default:o=RegExp(`\\[${t}=(?<value>.*?)\\]`,`g`);break}for(let e of a.matchAll(o))e?.groups&&r.push(e.groups.value)}return r};function r(e,t,r){let i=t,a=0,o=typeof r==`string`?r:r?.name,s=!!o&&n({tested:[o],expectedKey:`CORE_INTERNAL_SIGNAL`,valueType:`number`})?.[0]===`1`||!1,c=new Set,l=!1,u=t,d={type:`signal`,get version(){return a},subscribers:c},f=()=>{for(let t of c){let n=t._node||t;if(n.type===`effect`)n.isDirty=!0,e.scheduleEffect(t);else if(n.type===`computed`)n.markDirty&&n.markDirty(2);else if(typeof t==`function`)try{t(i)}catch(e){console.error(e)}else if(t&&typeof t.run==`function`)try{t.run()}catch(e){console.error(e)}}},p={get value(){let t=e.activeConsumer;return t&&(c.add(e.activeConsumer),e.activeConsumer.dependencies.add(p),t.activeRunId!==void 0&&(p._lastSeenInRunId=t.activeRunId)),i},set value(t){if(Object.is(i,t)&&!(i===t&&typeof i==`object`&&i))return;if(r&&typeof r==`object`&&r.validate){let e=r.validate(t);if(e!==!0){console.error(typeof e==`string`?e:`[Validation Error]`);return}}if(e.batchDepth>0){l||(l=!0,u=i),i=t,e.batchedSignals.add(p);return}let n=i;i=t,a++,e.epoch++,e.log({type:`signal`,label:o||`signal`,details:{from:n,to:t},isInternalCoreSignal:s}),f(),e.batchDepth===0&&e.flushEffects()},get version(){return a},type:`signal`,subscribe(e){return c.add(e),e(i),()=>{c.delete(e)}},_flushBatch:()=>{if(l){if(!Object.is(u,i)||typeof i==`object`&&i){a++,e.epoch++,e.log({type:`signal`,label:o||`signal_batched`,details:{from:u,to:i},isInternalCoreSignal:s});for(let t of c){let n=t._node||t;if(n.type===`effect`)n.isDirty=!0,e.scheduleEffect(t);else if(n.markDirty)n.markDirty(2);else if(typeof t==`function`)try{t(i)}catch(e){console.error(e)}}}l=!1,u=i}},get hasBatchValue(){return l},destroy:()=>{c&&c.clear(),e.batchedSignals&&e.batchedSignals.delete(p),l=!1,i=void 0,u=void 0}};return p._node=d,p.subscribers=c,p}function i(e,t){let n=e.activeConsumer;e.activeConsumer=null;try{return t()}finally{e.activeConsumer=n}}function a(e,t,n){if(e.proxyTargets.has(t))return t;if(e.proxyCache.has(t))return e.proxyCache.get(t);e.reactiveSignals.has(t)||e.reactiveSignals.set(t,new Map);let r=e.reactiveSignals.get(t),i=new Proxy(t,{get(t,i,a){if(i===`__subscribe`&&Array.isArray(t))return n=>{let i=r.get(`length`);return i||(i=e.signal(t.length),r.set(`length`,i)),i.subscribe(n)};if(Array.isArray(t)&&typeof i==`string`&&[`push`,`pop`,`shift`,`unshift`,`splice`,`sort`,`reverse`].includes(i))return(...n)=>{let o;return e.batch(()=>{o=Reflect.get(t,i).apply(a,n);let e=r.get(`length`);e&&(e.value=t.length),r.forEach((e,n)=>{n!==`length`&&(e.value=Reflect.get(t,n))})}),o};if(typeof i==`symbol`||i===`constructor`||i===`toJSON`)return Reflect.get(t,i,a);let o=r.get(i);if(!o){let a=Reflect.get(t,i);o=e.signal(a),r.set(i,o),typeof a==`object`&&a&&(o._proxyCache=e.reactive(a,n?`${n}.${String(i)}`:String(i)))}return o._proxyCache===void 0?o.value:(o.value,o._proxyCache)},set(t,n,i,a){let o=(e.proxyTargets.has(i),i),s=Reflect.get(t,n);if(s===o&&n!==`length`)return!0;Reflect.set(t,n,o);let c=r.get(n);if(c||(c=e.signal(s),r.set(n,c)),c._proxyCache=void 0,c.value=o,Array.isArray(t)&&n!==`length`){let e=r.get(`length`);e&&(e.value=t.length)}return!0}});return e.proxyCache.set(t,i),e.proxyTargets.add(i),i}function o(e,t,n){let r=!1,i=!1,a=2,o=new Set,s=new Map,c=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)}u.cleanups.clear(),e.activeConsumer=t}},u={id:e.subscriberId++,dependencies:o,ownedEffects:c,cleanups:new Set,type:`effect`,depth:0,label:n,get isDirty(){return a>0},set isDirty(e){e&&(a=2)},get isDisposed(){return r},set isDisposed(e){r=e},get state(){return a},set state(e){a=e},get depVersions(){return s},get _node(){return u},markDirty:()=>{a>=1||(a=1,e.scheduleEffect(u))},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();try{a=0;let e=t();if(typeof e==`function`&&u.cleanups.add(e),d!==null)for(let e of d){let t=e;if(!o.has(t)){let e=t._node||t;e.subscribers&&e.subscribers.delete(u),s.delete(t)}}let n=0;for(let e of o){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)}u.depth=n+1}finally{i=!1,e.activeConsumer=n,e.activeOwner=c}},dispose:()=>{if(!r){r=!0,u.isDisposed=!0,l();for(let e of o){let t=e._node||e;t.subscribers&&t.subscribers.delete(u)}o.clear(),s.clear()}}},d=e.activeOwner?e.activeOwner._node||e.activeOwner:null;return d&&d.ownedEffects&&d.ownedEffects.add(u),u.run(),()=>{u.dispose()}}var s=class{static churnTracker=new Map;static TIME_WINDOW_MS=1e3;static CHURN_WARNING_THRESHOLD=3;static CHURN_CRITICAL_THRESHOLD=6;static isDeepEqual(e,t){return e===t?!0:typeof e!=`object`||typeof t!=`object`||e===null||t===null?!1:JSON.stringify(e)===JSON.stringify(t)}static analyzeSignalChurn(e){let t=Date.now();this.churnTracker.has(e)||this.churnTracker.set(e,[]);let n=this.churnTracker.get(e),r=t-this.TIME_WINDOW_MS,i=n.filter(e=>e>r);i.push(t);let a=i.length,o=(this.TIME_WINDOW_MS/1e3).toFixed(1);return i.length<=1?(this.churnTracker.delete(e),{marker:`🟢`,info:`[STABLE] (1 изм./${o}s)`}):(this.churnTracker.set(e,i),a>=this.CHURN_CRITICAL_THRESHOLD?{marker:`🔴`,info:`[CRITICAL CHURN] (${a} изм./${o}s) — Нужен debounce!`}:a>=this.CHURN_WARNING_THRESHOLD?{marker:`🟡`,info:`[WARNING CHURN] (${a} изм./${o}s)`}:{marker:`🟢`,info:`[STABLE] (${a} изм./${o}s)`})}static processLog(e,t,n){let{type:r,label:i,details:a,isInternalCoreSignal:o=!1}=n;if(!e.isEnabled||o&&!e.isCoreOptimizationDebugEnabled)return;if(a&&`from`in a&&`to`in a&&this.isDeepEqual(a.from,a.to)){if(r===`computed`){t(r,`🔵 [IDLE PULL] ${i} (Значение кэша не изменилось)`,a);return}return}let s=``;if(r===`signal`||r===`resource`||r===`computed`){let e=this.analyzeSignalChurn(i);s=e.marker===`🟢`?` ${e.marker}`:` ${e.marker} ${e.info}`}t(r,`${i}${s}`,a)}};function c(e,t,r,i){let a=i&&typeof i==`object`,o=a?i.name||`unnamed_resource`:i||`unnamed_resource`,s=a?i:{},c=s.resetDataOnSourceChange??!0,l=s.responseValidate,u=s.validateBeforeFetch,d=e.signal({data:null,loading:!0,error:null,isRetrying:!1},`[CORE_INTERNAL_SIGNAL=1]:resource:state:${o}`),f=t=>{e.log({type:`resource`,label:o,details:{to:t,from:d.value}}),d.value=t},p=async(r,i,a=!1)=>{if(i.aborted)return;if(s.validateBeforeFetch&&s.validateBeforeFetch(r),u){let t=u(r);if(t===!1||typeof t==`string`){if(i.aborted)return;let n=typeof t==`string`?t:`Pre-fetch validation failed for resource`,r=a?null:e.untrack(()=>d.value.data);f({data:r,loading:!1,error:n,isRetrying:!1});return}}let p=a&&c?null:e.untrack(()=>d.value.data);f({data:p,loading:!0,error:null,isRetrying:!1});for(let a=0;a<=0;a++){if(i.aborted)return;let s=i;try{let e=await t(r,s);if(i.aborted)return;if(s.aborted)throw new DOMException(`The operation timed out.`,`TimeoutError`);if(l){let t=l(e);if(t===!1||typeof t==`string`){if(i.aborted)return;f({data:null,loading:!1,error:typeof t==`string`?t:`Validation failed`,isRetrying:!1});return}}if(i.aborted)return;f({data:e,loading:!1,error:null,isRetrying:!1});return}catch(t){if(i.aborted||t.name===`AbortError`&&i.aborted)return;let r=t.name===`TimeoutError`||t.name===`AbortError`||t.message?.includes(`timeout`),s=n({tested:[t.message],expectedKey:`THROW_CUSTOM_VALIDATION_ERROR_NO_RETRY`,valueType:`number`})?.[0]===`1`||!1,c=s&&n({tested:[t.message],expectedKey:`MESSAGE`,valueType:`string`})?.[0]||`Custom validation error`,l=s||t.name===`ValidationError`;if(a===0||l){if(i.aborted)return;let e=r?Error(`Request timed out after 1000ms`,{cause:t}):s?Error(c,{cause:t}):t;f({data:null,loading:!1,error:e instanceof Error?e.message:typeof e==`string`?e:`typeof finalError is ${typeof e}`,isRetrying:!1});return}else{if(i.aborted)return;let t=1e3*2**a;t=Math.min(t,3e5);let n=Math.random()*200;t+=n,f({data:d.value.data,loading:!0,error:null,isRetrying:!0}),console.warn(`[Resource Retry] "${o}" сбой по ${r?`таймауту`:`ошибке сети`}. Попытка ${a+1}/${a+1}...`);try{if(await e.delay(t,i),i.aborted)return}catch{return}}}}},m=null,h=e.effect(()=>{let t=r?r.value:void 0,n=new AbortController;return m=n,e.untrack(()=>{p(t,n.signal,!0)}),()=>n.abort()},`[CORE_INTERNAL_SIGNAL=1]:effect`);return{get data(){return d.value.data},get loading(){return d.value.loading},get error(){return d.value.error},get isRetrying(){return d.value.isRetrying},get value(){return d.value},refetch:()=>{m?.abort(),m=new AbortController,p(r?r.value:void 0,m.signal,!1)},subscribe:e=>d.subscribe(e),destroy:()=>{m?.abort(),m=null,typeof h==`function`&&h(),d.destroy&&d.destroy()}}}var l={signal:`background: #007acc; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;`,computed:`background: #42b883; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;`,effect:`background: #e01e5a; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;`,batch:`background: #7952b3; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;`,resource:`background: #d97706; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;`,reactive:`background: #007acc; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;`},u=null;function d(e){if(e===null)return`null`;if(e===void 0)return`undefined`;if(typeof e==`object`)try{return JSON.stringify(e)}catch{return`[Cyclic Object or Layer]`}return String(e)}function f(e,t,n){u||(u={id:Math.random().toString(36).substring(2,9),pendingLogQueue:[],isFlushing:!1},queueMicrotask(()=>p())),u.pendingLogQueue.push({type:e,label:t,from:n?.from,to:n?.to,payload:n?.payload,timestamp:Date.now()})}function p(){if(!u||u.isFlushing)return;u.isFlushing=!0;let e=u.pendingLogQueue;if(e.length===0){u=null;return}console.groupCollapsed(`%cREACTIVE TRANSACTION%c [id: ${u.id}] (${e.length} operations)`,`background: #7952b3; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;`,`color: #888; font-weight: normal;`);for(let t of e){let e=l[t.type],n=t.from!==void 0||t.to!==void 0,r=`%c${t.type.toUpperCase()}%c ${t.label}`;n&&(t.from?r+=` ${d(t.from)} → ${d(t.to)}`:r+=` (${d(t.to)})`),t.payload===void 0?console.log(r,e,`color: inherit;`):(console.groupCollapsed(r,e,`color: inherit;`),console.log(`Payload:`,t.payload),console.groupEnd())}console.groupEnd(),u=null}var m=class{frameworkPrefix=`core`;logger;epoch=0;activeConsumer=null;batchDepth=0;subscriberId=0;pendingEffects=[];maxPendingDepth=0;computedCache=new WeakMap;diRegistry=new Map;diCache=new Map;proxyCache=new WeakMap;proxyTargets=new WeakSet;reactiveSignals=new WeakMap;cycleDetectionStack=new Set;batchedSignals=new Set;activeOwner=null;pendingCleanups=new Set;queueCleanup(e){this.pendingCleanups.add(e)}constructor(e){this.logger=e?.logger||{isEnabled:!1}}scheduleEffect(e){let t=e.depth||0;this.pendingEffects[t]||(this.pendingEffects[t]=new Set),this.pendingEffects[t].add(e),t>this.maxPendingDepth&&(this.maxPendingDepth=t)}queueLog(e,t,n){f(e,t,n)}batch(e){this.batchDepth++;try{return e()}finally{if(this.batchDepth--,this.batchDepth===0){if(this.batchedSignals.size>0){for(let e of this.batchedSignals)e._flushBatch&&e._flushBatch();this.batchedSignals.clear()}this.flushEffects()}}}flushEffects(){if(this.batchDepth>0)return;let e=this.activeConsumer;try{for(let e=0;e<=this.maxPendingDepth;e++){let t=this.pendingEffects[e];if(!t||t.size===0)continue;let n=Array.from(t);t.clear();for(let t of n)if(!t.isDisposed&&t.isDirty){if(t.dependencies&&t.dependencies.size>0){let e=!1;for(let n of t.dependencies){let r=n._node||n;r.type===`computed`&&r.state>0&&r.update&&r.update(),t.depVersions&&t.depVersions.get(n)!==r.version&&(e=!0)}if(!e&&t.dependencies.size>0){t.isDirty=!1;continue}}try{t.run()}catch(t){for(let t=e;t<=this.maxPendingDepth;t++){let e=this.pendingEffects[t];if(e){for(let t of e)t.isDirty=!1;e.clear()}}throw this.maxPendingDepth=0,t}}if(e>0){let t=!1;for(let n=0;n<e;n++)if(this.pendingEffects[n]&&this.pendingEffects[n].size>0){t=!0;break}t&&(e=-1)}}this.maxPendingDepth=0}finally{this.activeConsumer=e}}log(e){!this.logger||!this.logger.isEnabled||s.processLog(this.logger,f,e)}signal(e,t){return r(this,e,t)}computed(e,n){return t(this,e,n)}effect(e,t){return o(this,e,t)}untrack(e){return i(this,e)}reactive(e,t){return a(this,e,t)}provide(e,t){this.diRegistry.set(e,t),this.diCache.delete(e)}inject(e){if(e==null)throw Error(`[DI Error] Token is empty`);if(this.diCache.has(e))return this.diCache.get(e);if(this.cycleDetectionStack.has(e))throw Error(`[DI Error] Cyclic dependency detected`);this.cycleDetectionStack.add(e);try{if(this.diRegistry.has(e)){let t=this.diRegistry.get(e);if(typeof t==`function`){if(t._isMockFunction){let n=t(this);return n===void 0?t:(this.diCache.set(e,n),n)}let n=t.toString();if(!(n.startsWith(`class `)||n.startsWith(`class{`)||t.prototype&&t.prototype.constructor===t&&!n.startsWith(`function`)&&!n.includes(`=>`))){let n=t(this);return this.diCache.set(e,n),n}return t}return t}if(typeof e==`function`){let t=new e(this);return this.diCache.set(e,t),t}throw Error(`[DI Error] Token not found`)}finally{this.cycleDetectionStack.delete(e)}}delay(e,t){return new Promise((n,r)=>{if(t.aborted)return r(new DOMException(`Aborted`,`AbortError`));let i=setTimeout(()=>{t.removeEventListener(`abort`,a),n()},e),a=()=>{clearTimeout(i),r(new DOMException(`Aborted`,`AbortError`))};t.addEventListener(`abort`,a,{once:!0})})}resource(e,t,n){return c(this,e,t,n)}},h=class extends m{},g=class extends h{autoLogQueue=[];isHardFlushScheduled=!1;queueLog(e,t,n){this.autoLogQueue.push({type:e,name:t,meta:n,timestamp:Date.now()}),this.isHardFlushScheduled||(this.isHardFlushScheduled=!0,queueMicrotask(()=>this.flushLogs()))}flushLogs(){this.isHardFlushScheduled=!1,this.autoLogQueue.length!==0&&(typeof process<`u`&&process.env.NODE_ENV!==`test`&&(console.group(`📊 [Autolog] Срез транзакций: ${this.autoLogQueue.length} операций`),this.autoLogQueue.forEach(e=>console.log(`[${e.type.toUpperCase()}] ${e.name}`,e.meta||``)),console.groupEnd()),this.autoLogQueue=[])}computed(e,t){let n=this,r=t||`unnamed_computed`,i=super.computed(e,t),a=!1,o={get value(){if(a)return i.value;let e=typeof performance<`u`?performance.now():0,t=i.value;return e&&n.queueLog(`computed`,r,{value:t,duration:`${(performance.now()-e).toFixed(3)}ms`}),t},subscribe:e=>i.subscribe(e),destroy(){a=!0,i.destroy()}};return`_node`in i&&Object.defineProperty(o,"_node",{value:i._node,enumerable:!1}),o}},_=new m({logger:{isEnabled:!1}}),v=(e,t)=>_.signal(e,t),y=(e,t)=>_.computed(e,t),b=(e,t)=>_.effect(e,t),x=e=>_.batch(e),S=e=>_.untrack(e);function C(){_=new m({logger:{isEnabled:!1}})}var w=class{engine;constructor(e){this.engine=e,this.onInit()}createNumericSignal(e,t){return this.engine.signal(e,{name:t,validate:e=>typeof e==`number`&&!isNaN(e)})}createComputed(e){return this.engine.computed(e)}createSignal(e,t){return this.engine.signal(e,t)}onInit(){}},T=w,E=class{engine;constructor(e){this.engine=e,setTimeout(()=>this.onInit(),0)}onInit(){}};e.AbstractService=w,e.BaseREService=T,e.BaseREServiceEnhanced=E,e.ReactiveEngine=h,e.ReactiveEngineAutolog=g,e.ReactiveEngineAutomatic=m,e.ReactiveEngineCore=m,e.batch=x,e.computed=y,e.effect=b,e.flushLogs=p,e.queueLog=f,e.resetGlobalReactiveEngine=C,e.signal=v,e.untrack=S});
+(function(e,t){typeof exports==`object`&&typeof module<`u`?t(exports):typeof define==`function`&&define.amd?define([`exports`],t):(e=typeof globalThis<`u`?globalThis:e||self,t(e.ReactiveEngineLib={}))})(this,function(e){Object.defineProperty(e,Symbol.toStringTag,{value:`Module`});function t(e,t,n){let r=e.computedCache.get(t);if(r)return r;let i,a=!0,o=0,s=!1,c=-1,l=2,u=new Set,d=new Map,f=new Set,p=new Set,m=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(_),i.type===`computed`&&i.subscribers.size===0&&m(i))}t.dependencies.clear(),t.depVersions&&t.depVersions.clear()}},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;if(r.type===`computed`&&r.state>0&&r.update&&r.verifiedInEpoch!==e.epoch&&r.update(),t.hasBatchValue||d.get(t)!==r.version){n=!0;break}}return t.verifiedInEpoch=e.epoch,n||a?t.run():(l=0,!1)},g=0,_={id:e.subscriberId++,dependencies:u,subscribers:p,ownedEffects:f,depth:1,type:`computed`,fn:t,get version(){return o},get state(){return l},set state(e){l=e},get depVersions(){return d},verifiedInEpoch:-1,update:()=>h(_),run:()=>{if(c===e.epoch&&s&&l===0&&e.batchDepth===0)return!1;let r=e.epoch;if(c=r,_.verifiedInEpoch=r,e.cycleDetectionStack.has(_))throw Error(`[Graph Error] Cyclic dependency detected`);e.cycleDetectionStack.add(_);let p=e.activeConsumer,m=e.activeOwner;e.activeConsumer=_,e.activeOwner=_,g++,_.activeRunId=g;let h=u.size>0?Array.from(u):null;u.clear();try{if(f.size>0){for(let e of f)e&&typeof e.dispose==`function`&&e.dispose();f.clear()}let p=t();if(h!==null){let e=h.length===u.size;for(let t of h){let n=t;if(!e||!u.has(n)){let e=n._node||n;e.subscribers&&e.subscribers.delete(_),d.delete(n)}}}let m=a||!Object.is(i,p);if(m){let t=a?void 0:typeof i==`object`&&i?JSON.parse(JSON.stringify(i)):i;i=p,o++,e.log&&n&&e.log({type:`computed`,label:n,details:{from:t,to:p}})}a=!1,l=0,s=!0;let g=0;for(let e of u){let t=e,n=t._node||t;d.set(t,n.version),n.subscribers&&n.subscribers.add(_),n.depth!==void 0&&n.depth>g&&(g=n.depth)}return _.depth=g+1,e.epoch!==r&&(c=-1,_.verifiedInEpoch=-1,l=2),m}finally{e.activeConsumer=p,e.activeOwner=m,e.cycleDetectionStack.delete(_)}},markDirty:t=>{if(!(l>=t)){l=t;for(let t of p){let n=t._node||t;n.type===`effect`?(n.isDirty=!0,e.scheduleEffect(t)):n.markDirty&&n.markDirty(1)}}}},v={get value(){let t=e.activeConsumer;if(t&&t!==_){p.add(t),t.dependencies.add(_);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 h(_),t&&t.depVersions&&t.depVersions.set(v,o),i},get valueWithoutTracking(){return i},get version(){return o},get dependencies(){return u},subscribe(t){let n=this,r={id:e.subscriberId++,isDirty:!0,depth:9999,dependencies:new Set,type:`effect`,run:()=>{if(!r.isDisposed)try{t(n.value)}catch(e){console.error(e)}}};return p.add(r),t(this.value),()=>{r.isDisposed=!0,p.delete(r),r.dependencies.clear()}},subscribeState(e){return v.subscribe(e)},destroy:()=>{m(_),p&&p.clear(),e.computedCache.delete(t),u.clear(),d.clear(),f.clear(),a=!0,l=2,s=!1},__subscribe(t){let n={id:e.subscriberId++,type:`effect`,run:t,isDirty:!1};return p.add(n),()=>{p.delete(n)}}};return v.run=()=>_.run(),e.computedCache.set(t,v),v._node=_,v.subscribers=p,v}var n=({tested:e,expectedKey:t,valueType:n})=>{let r=[];if(!e||!Array.isArray(e))return r;for(let i=0,a=e.length;i<a;i++){let a=e[i];if(typeof a!=`string`)continue;let o;switch(n){case`number`:o=RegExp(`\\[${t}=(?<value>\\d+)\\]`,`g`);break;default:o=RegExp(`\\[${t}=(?<value>.*?)\\]`,`g`);break}for(let e of a.matchAll(o))e?.groups&&r.push(e.groups.value)}return r};function r(e,t,r){let i=t,a=0,o=typeof r==`string`?r:r?.name,s=!!o&&n({tested:[o],expectedKey:`CORE_INTERNAL_SIGNAL`,valueType:`number`})?.[0]===`1`||!1,c=new Set,l=!1,u=t,d={type:`signal`,get version(){return a},subscribers:c},f=()=>{for(let t of c){let n=t._node||t;if(n.type===`effect`)n.isDirty=!0,e.scheduleEffect(t);else if(n.type===`computed`)n.markDirty&&n.markDirty(2);else if(typeof t==`function`)try{t(i)}catch(e){console.error(e)}else if(t&&typeof t.run==`function`)try{t.run()}catch(e){console.error(e)}}},p={get value(){let t=e.activeConsumer;return t&&(c.add(e.activeConsumer),e.activeConsumer.dependencies.add(p),t.activeRunId!==void 0&&(p._lastSeenInRunId=t.activeRunId)),i},set value(t){if(Object.is(i,t)&&!(i===t&&typeof i==`object`&&i))return;if(r&&typeof r==`object`&&r.validate){let e=r.validate(t);if(e!==!0){console.error(typeof e==`string`?e:`[Validation Error]`);return}}if(e.batchDepth>0){l||(l=!0,u=i),i=t,e.batchedSignals.add(p);return}let n=i;i=t,a++,e.epoch++,e.log({type:`signal`,label:o||`signal`,details:{from:n,to:t},isInternalCoreSignal:s}),f(),e.batchDepth===0&&e.flushEffects()},get version(){return a},type:`signal`,subscribe(e){return c.add(e),e(i),()=>{c.delete(e)}},_flushBatch:()=>{if(l){if(!Object.is(u,i)||typeof i==`object`&&i){a++,e.epoch++,e.log({type:`signal`,label:o||`signal_batched`,details:{from:u,to:i},isInternalCoreSignal:s});for(let t of c){let n=t._node||t;if(n.type===`effect`)n.isDirty=!0,e.scheduleEffect(t);else if(n.markDirty)n.markDirty(2);else if(typeof t==`function`)try{t(i)}catch(e){console.error(e)}}}l=!1,u=i}},get hasBatchValue(){return l},destroy:()=>{c&&c.clear(),e.batchedSignals&&e.batchedSignals.delete(p),l=!1,i=void 0,u=void 0}};return p._node=d,p.subscribers=c,p}function i(e,t){let n=e.activeConsumer;e.activeConsumer=null;try{return t()}finally{e.activeConsumer=n}}function a(e,t,n){if(e.proxyTargets.has(t))return t;if(e.proxyCache.has(t))return e.proxyCache.get(t);e.reactiveSignals.has(t)||e.reactiveSignals.set(t,new Map);let r=e.reactiveSignals.get(t),i=new Proxy(t,{get(t,i,a){if(i===`__subscribe`&&Array.isArray(t))return n=>{let i=r.get(`length`);return i||(i=e.signal(t.length),r.set(`length`,i)),i.subscribe(n)};if(Array.isArray(t)&&typeof i==`string`&&[`push`,`pop`,`shift`,`unshift`,`splice`,`sort`,`reverse`].includes(i))return(...n)=>{let o;return e.batch(()=>{o=Reflect.get(t,i).apply(a,n);let e=r.get(`length`);e&&(e.value=t.length),r.forEach((e,n)=>{n!==`length`&&(e.value=Reflect.get(t,n))})}),o};if(typeof i==`symbol`||i===`constructor`||i===`toJSON`)return Reflect.get(t,i,a);let o=r.get(i);if(!o){let a=Reflect.get(t,i);o=e.signal(a),r.set(i,o),typeof a==`object`&&a&&(o._proxyCache=e.reactive(a,n?`${n}.${String(i)}`:String(i)))}return o._proxyCache===void 0?o.value:(o.value,o._proxyCache)},set(t,n,i,a){let o=(e.proxyTargets.has(i),i),s=Reflect.get(t,n);if(s===o&&n!==`length`)return!0;Reflect.set(t,n,o);let c=r.get(n);if(c||(c=e.signal(s),r.set(n,c)),c._proxyCache=void 0,c.value=o,Array.isArray(t)&&n!==`length`){let e=r.get(`length`);e&&(e.value=t.length)}return!0}});return e.proxyCache.set(t,i),e.proxyTargets.add(i),i}function o(e,t,n){let r=!1,i=!1,a=2,o=new Set,s=new Map,c=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)}u.cleanups.clear(),e.activeConsumer=t}},u={id:e.subscriberId++,dependencies:o,ownedEffects:c,cleanups:new Set,type:`effect`,depth:0,label:n,get isDirty(){return a>0},set isDirty(e){e&&(a=2)},get isDisposed(){return r},set isDisposed(e){r=e},get state(){return a},set state(e){a=e},get depVersions(){return s},get _node(){return u},markDirty:()=>{a>=1||(a=1,e.scheduleEffect(u))},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();try{a=0;let e=t();if(typeof e==`function`&&u.cleanups.add(e),d!==null)for(let e of d){let t=e;if(!o.has(t)){let e=t._node||t;e.subscribers&&e.subscribers.delete(u),s.delete(t)}}let n=0;for(let e of o){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)}u.depth=n+1}finally{i=!1,e.activeConsumer=n,e.activeOwner=c}},dispose:()=>{if(!r){r=!0,u.isDisposed=!0,l();for(let e of o){let t=e._node||e;t.subscribers&&t.subscribers.delete(u)}o.clear(),s.clear()}}},d=e.activeOwner?e.activeOwner._node||e.activeOwner:null;return d&&d.ownedEffects&&d.ownedEffects.add(u),u.run(),()=>{u.dispose()}}var s=class{static churnTracker=new Map;static TIME_WINDOW_MS=1e3;static CHURN_WARNING_THRESHOLD=3;static CHURN_CRITICAL_THRESHOLD=6;static isDeepEqual(e,t){return e===t?!0:typeof e!=`object`||typeof t!=`object`||e===null||t===null?!1:JSON.stringify(e)===JSON.stringify(t)}static analyzeSignalChurn(e){let t=Date.now();this.churnTracker.has(e)||this.churnTracker.set(e,[]);let n=this.churnTracker.get(e),r=t-this.TIME_WINDOW_MS,i=n.filter(e=>e>r);i.push(t);let a=i.length,o=(this.TIME_WINDOW_MS/1e3).toFixed(1);return i.length<=1?(this.churnTracker.delete(e),{marker:`🟢`,info:`[STABLE] (1 изм./${o}s)`}):(this.churnTracker.set(e,i),a>=this.CHURN_CRITICAL_THRESHOLD?{marker:`🔴`,info:`[CRITICAL CHURN] (${a} изм./${o}s) — Нужен debounce!`}:a>=this.CHURN_WARNING_THRESHOLD?{marker:`🟡`,info:`[WARNING CHURN] (${a} изм./${o}s)`}:{marker:`🟢`,info:`[STABLE] (${a} изм./${o}s)`})}static processLog(e,t,n){let{type:r,label:i,details:a,isInternalCoreSignal:o=!1}=n;if(!e.isEnabled||o&&!e.isCoreOptimizationDebugEnabled)return;if(a&&`from`in a&&`to`in a&&this.isDeepEqual(a.from,a.to)){if(r===`computed`){t(r,`🔵 [IDLE PULL] ${i} (Значение кэша не изменилось)`,a);return}return}let s=``;if(r===`signal`||r===`resource`||r===`computed`){let e=this.analyzeSignalChurn(i);s=e.marker===`🟢`?` ${e.marker}`:` ${e.marker} ${e.info}`}t(r,`${i}${s}`,a)}};function c(e,t,r,i){let a=i&&typeof i==`object`,o=a?i.name||`unnamed_resource`:i||`unnamed_resource`,s=a?i:{},c=s.resetDataOnSourceChange??!0,l=s.responseValidate,u=s.validateBeforeFetch,d=e.signal({data:null,loading:!0,error:null,isRetrying:!1},`[CORE_INTERNAL_SIGNAL=1]:resource:state:${o}`),f=t=>{e.log({type:`resource`,label:o,details:{to:t,from:d.value}}),d.value=t},p=async(r,i,a=!1)=>{if(i.aborted)return;if(s.validateBeforeFetch&&s.validateBeforeFetch(r),u){let t=u(r);if(t===!1||typeof t==`string`){if(i.aborted)return;let n=typeof t==`string`?t:`Pre-fetch validation failed for resource`,r=a?null:e.untrack(()=>d.value.data);f({data:r,loading:!1,error:n,isRetrying:!1});return}}let p=a&&c?null:e.untrack(()=>d.value.data);f({data:p,loading:!0,error:null,isRetrying:!1});for(let a=0;a<=0;a++){if(i.aborted)return;let s=i;try{let e=await t(r,s);if(i.aborted)return;if(s.aborted)throw new DOMException(`The operation timed out.`,`TimeoutError`);if(l){let t=l(e);if(t===!1||typeof t==`string`){if(i.aborted)return;f({data:null,loading:!1,error:typeof t==`string`?t:`Validation failed`,isRetrying:!1});return}}if(i.aborted)return;f({data:e,loading:!1,error:null,isRetrying:!1});return}catch(t){if(i.aborted||t.name===`AbortError`&&i.aborted)return;let r=t.name===`TimeoutError`||t.name===`AbortError`||t.message?.includes(`timeout`),s=n({tested:[t.message],expectedKey:`THROW_CUSTOM_VALIDATION_ERROR_NO_RETRY`,valueType:`number`})?.[0]===`1`||!1,c=s&&n({tested:[t.message],expectedKey:`MESSAGE`,valueType:`string`})?.[0]||`Custom validation error`,l=s||t.name===`ValidationError`;if(a===0||l){if(i.aborted)return;let e=r?Error(`Request timed out after 1000ms`,{cause:t}):s?Error(c,{cause:t}):t;f({data:null,loading:!1,error:e instanceof Error?e.message:typeof e==`string`?e:`typeof finalError is ${typeof e}`,isRetrying:!1});return}else{if(i.aborted)return;let t=1e3*2**a;t=Math.min(t,3e5);let n=Math.random()*200;t+=n,f({data:d.value.data,loading:!0,error:null,isRetrying:!0}),console.warn(`[Resource Retry] "${o}" сбой по ${r?`таймауту`:`ошибке сети`}. Попытка ${a+1}/${a+1}...`);try{if(await e.delay(t,i),i.aborted)return}catch{return}}}}},m=null,h=e.effect(()=>{let t=r?r.value:void 0,n=new AbortController;return m=n,e.untrack(()=>{p(t,n.signal,!0)}),()=>n.abort()},`[CORE_INTERNAL_SIGNAL=1]:effect`);return{get data(){return d.value.data},get loading(){return d.value.loading},get error(){return d.value.error},get isRetrying(){return d.value.isRetrying},get value(){return d.value},refetch:()=>{m?.abort(),m=new AbortController,p(r?r.value:void 0,m.signal,!1)},subscribe:e=>d.subscribe(e),destroy:()=>{m?.abort(),m=null,typeof h==`function`&&h(),d.destroy&&d.destroy()}}}var l={signal:`background: #007acc; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;`,computed:`background: #42b883; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;`,effect:`background: #e01e5a; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;`,batch:`background: #7952b3; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;`,resource:`background: #d97706; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;`,reactive:`background: #007acc; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;`},u=null;function d(e){if(e===null)return`null`;if(e===void 0)return`undefined`;if(typeof e==`object`)try{return JSON.stringify(e)}catch{return`[Cyclic Object or Layer]`}return String(e)}function f(e,t,n){u||(u={id:Math.random().toString(36).substring(2,9),pendingLogQueue:[],isFlushing:!1},queueMicrotask(()=>p())),u.pendingLogQueue.push({type:e,label:t,from:n?.from,to:n?.to,payload:n?.payload,timestamp:Date.now()})}function p(){if(!u||u.isFlushing)return;u.isFlushing=!0;let e=u.pendingLogQueue;if(e.length===0){u=null;return}console.groupCollapsed(`%cREACTIVE TRANSACTION%c [id: ${u.id}] (${e.length} operations)`,`background: #7952b3; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;`,`color: #888; font-weight: normal;`);for(let t of e){let e=l[t.type],n=t.from!==void 0||t.to!==void 0,r=`%c${t.type.toUpperCase()}%c ${t.label}`;n&&(t.from?r+=` ${d(t.from)} → ${d(t.to)}`:r+=` (${d(t.to)})`),t.payload===void 0?console.log(r,e,`color: inherit;`):(console.groupCollapsed(r,e,`color: inherit;`),console.log(`Payload:`,t.payload),console.groupEnd())}console.groupEnd(),u=null}var m=class{frameworkPrefix=`core`;logger;epoch=0;activeConsumer=null;batchDepth=0;subscriberId=0;pendingEffects=[];maxPendingDepth=0;computedCache=new WeakMap;diRegistry=new Map;diCache=new Map;proxyCache=new WeakMap;proxyTargets=new WeakSet;reactiveSignals=new WeakMap;cycleDetectionStack=new Set;batchedSignals=new Set;activeOwner=null;pendingCleanups=new Set;queueCleanup(e){this.pendingCleanups.add(e)}constructor(e){this.logger=e?.logger||{isEnabled:!1}}scheduleEffect(e){let t=e.depth||0;this.pendingEffects[t]||(this.pendingEffects[t]=new Set),this.pendingEffects[t].add(e),t>this.maxPendingDepth&&(this.maxPendingDepth=t)}queueLog(e,t,n){f(e,t,n)}batch(e){this.batchDepth++;try{return e()}finally{if(this.batchDepth--,this.batchDepth===0){if(this.batchedSignals.size>0){for(let e of this.batchedSignals)e._flushBatch&&e._flushBatch();this.batchedSignals.clear()}this.flushEffects()}}}flushEffects(){if(this.batchDepth>0)return;let e=this.activeConsumer;try{for(let e=0;e<=this.maxPendingDepth;e++){let t=this.pendingEffects[e];if(!t||t.size===0)continue;let n=Array.from(t);t.clear();for(let t of n)if(!t.isDisposed&&t.isDirty){if(t.dependencies&&t.dependencies.size>0){let e=!1;for(let n of t.dependencies){let r=n._node||n;r.type===`computed`&&r.state>0&&r.update&&r.update(),t.depVersions&&t.depVersions.get(n)!==r.version&&(e=!0)}if(!e&&t.dependencies.size>0){t.isDirty=!1;continue}}try{t.run()}catch(t){for(let t=e;t<=this.maxPendingDepth;t++){let e=this.pendingEffects[t];if(e){for(let t of e)t.isDirty=!1;e.clear()}}throw this.maxPendingDepth=0,t}}if(e>0){let t=!1;for(let n=0;n<e;n++)if(this.pendingEffects[n]&&this.pendingEffects[n].size>0){t=!0;break}t&&(e=-1)}}this.maxPendingDepth=0}finally{this.activeConsumer=e}}log(e){!this.logger||!this.logger.isEnabled||s.processLog(this.logger,f,e)}signal(e,t){return r(this,e,t)}computed(e,n){return t(this,e,n)}effect(e,t){return o(this,e,t)}untrack(e){return i(this,e)}reactive(e,t){return a(this,e,t)}provide(e,t){this.diRegistry.set(e,t),this.diCache.delete(e)}inject(e){if(e==null)throw Error(`[DI Error] Token is empty`);if(this.diCache.has(e))return this.diCache.get(e);if(this.cycleDetectionStack.has(e))throw Error(`[DI Error] Cyclic dependency detected`);this.cycleDetectionStack.add(e);try{if(this.diRegistry.has(e)){let t=this.diRegistry.get(e);if(typeof t==`function`){if(t._isMockFunction){let n=t(this);return n===void 0?t:(this.diCache.set(e,n),n)}let n=t.toString();if(!(n.startsWith(`class `)||n.startsWith(`class{`)||t.prototype&&t.prototype.constructor===t&&!n.startsWith(`function`)&&!n.includes(`=>`))){let n=t(this);return this.diCache.set(e,n),n}return t}return t}if(typeof e==`function`){let t=new e(this);return this.diCache.set(e,t),t}throw Error(`[DI Error] Token not found`)}finally{this.cycleDetectionStack.delete(e)}}delay(e,t){return new Promise((n,r)=>{if(t.aborted)return r(new DOMException(`Aborted`,`AbortError`));let i=setTimeout(()=>{t.removeEventListener(`abort`,a),n()},e),a=()=>{clearTimeout(i),r(new DOMException(`Aborted`,`AbortError`))};t.addEventListener(`abort`,a,{once:!0})})}resource(e,t,n){return c(this,e,t,n)}},h=class extends m{},g=class extends h{autoLogQueue=[];isHardFlushScheduled=!1;queueLog(e,t,n){this.autoLogQueue.push({type:e,name:t,meta:n,timestamp:Date.now()}),this.isHardFlushScheduled||(this.isHardFlushScheduled=!0,queueMicrotask(()=>this.flushLogs()))}flushLogs(){this.isHardFlushScheduled=!1,this.autoLogQueue.length!==0&&(typeof process<`u`&&process.env.NODE_ENV!==`test`&&(console.group(`📊 [Autolog] Срез транзакций: ${this.autoLogQueue.length} операций`),this.autoLogQueue.forEach(e=>console.log(`[${e.type.toUpperCase()}] ${e.name}`,e.meta||``)),console.groupEnd()),this.autoLogQueue=[])}computed(e,t){let n=this,r=t||`unnamed_computed`,i=super.computed(e,t),a=!1,o={get value(){if(a)return i.value;let e=typeof performance<`u`?performance.now():0,t=i.value;return e&&n.queueLog(`computed`,r,{value:t,duration:`${(performance.now()-e).toFixed(3)}ms`}),t},subscribe:e=>i.subscribe(e),destroy(){a=!0,i.destroy()}};return`_node`in i&&Object.defineProperty(o,"_node",{value:i._node,enumerable:!1}),o}},_=new m({logger:{isEnabled:!1}}),v=(e,t)=>_.signal(e,t),y=(e,t)=>_.computed(e,t),b=(e,t)=>_.effect(e,t),x=e=>_.batch(e),S=e=>_.untrack(e);function C(){_=new m({logger:{isEnabled:!1}})}var w=class{engine;constructor(e){this.engine=e,this.onInit()}createNumericSignal(e,t){return this.engine.signal(e,{name:t,validate:e=>typeof e==`number`&&!isNaN(e)})}createComputed(e){return this.engine.computed(e)}createSignal(e,t){return this.engine.signal(e,t)}onInit(){}},T=w,E=class{engine;constructor(e){this.engine=e,setTimeout(()=>this.onInit(),0)}onInit(){}};e.AbstractService=w,e.BaseREService=T,e.BaseREServiceEnhanced=E,e.ReactiveEngine=h,e.ReactiveEngineAutolog=g,e.ReactiveEngineAutomatic=m,e.ReactiveEngineCore=m,e.batch=x,e.computed=y,e.effect=b,e.flushLogs=p,e.queueLog=f,e.resetGlobalReactiveEngine=C,e.signal=v,e.untrack=S});
 //# sourceMappingURL=reactive-engine.umd.js.map