@pravosleva/reactive-engine 2.1.8-beta → 2.1.10-beta

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1 +1 @@
1
- {"version":3,"file":"core.d.ts","sourceRoot":"","sources":["../../src/core/core.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAW,mBAAmB,EAAE,YAAY,EAAE,SAAS,EAAiC,aAAa,EAAE,eAAe,EAAiB,QAAQ,EAAE,MAAM,SAAS,CAAA;AAUzL,KAAK,WAAW,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;AAE/C,KAAK,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAA;AAEpC,KAAK,cAAc,CAAC,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,CAAA;AAuBtE,wBAAgB,QAAQ,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;IAAE,IAAI,CAAC,EAAE,OAAO,CAAC;IAAC,EAAE,CAAC,EAAE,OAAO,CAAC;IAAC,OAAO,CAAC,EAAE,OAAO,CAAA;CAAE,GAAG,IAAI,CAM/H;AACD,wBAAgB,SAAS,IAAI,IAAI,CA8BhC;AACD,qBAAa,kBAAkB;IAC7B,SAAS,CAAC,eAAe,SAAS;IAClC,OAAO,CAAC,MAAM,CAAqB;IAC5B,KAAK,SAAI;IACT,cAAc,EAAE,GAAG,CAAO;IAC1B,UAAU,SAAI;IACd,YAAY,SAAI;IAChB,cAAc,WAAiB;IAC/B,aAAa,4CAAkD;IACtE,OAAO,CAAC,UAAU,CAA8B;IAChD,OAAO,CAAC,OAAO,CAA8B;IAC7C,OAAO,CAAC,UAAU,CAA6B;IAC/C,OAAO,CAAC,YAAY,CAAwB;IAC5C,OAAO,CAAC,eAAe,CAAmD;IAC1E,OAAO,CAAC,mBAAmB,CAAqB;IACzC,cAAc,WAAiB;IAC/B,WAAW,EAAE,GAAG,CAAO;gBAElB,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,mBAAmB,CAAA;KAAE;IAI/C,QAAQ,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,OAAO,CAAC;QAAC,EAAE,CAAC,EAAE,OAAO,CAAC;QAAC,OAAO,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,IAAI;IAIhH,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC;IAsBxB,YAAY,IAAI,IAAI;IAmD3B,OAAO,CAAC,GAAG;IASJ,MAAM,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,CAAC,EAAE,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAIhF,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC;IAK1D,MAAM,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,SAAS,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,IAAI;IAInE,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC;IAI1B,QAAQ,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,CAAC;IAIvD,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;IAK1E,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC;IAuC7C,OAAO,CAAC,KAAK;IAoBN,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,EACzB,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,KAAK,OAAO,CAAC,CAAC,CAAC,EACvD,MAAM,CAAC,EAAE;QAAE,KAAK,EAAE,CAAC,CAAA;KAAE,EACrB,aAAa,CAAC,EAAE,MAAM,GAAG,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,GAC7C,QAAQ,CAAC,CAAC,CAAC;CAgLf;AAED,OAAO,EAAE,kBAAkB,IAAI,cAAc,EAAE,kBAAkB,IAAI,uBAAuB,EAAE,CAAA"}
1
+ {"version":3,"file":"core.d.ts","sourceRoot":"","sources":["../../src/core/core.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAW,mBAAmB,EAAE,YAAY,EAAE,SAAS,EAAiC,aAAa,EAAE,eAAe,EAAiB,QAAQ,EAAE,MAAM,SAAS,CAAA;AAUzL,KAAK,WAAW,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;AAE/C,KAAK,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAA;AAEpC,KAAK,cAAc,CAAC,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,CAAA;AAuBtE,wBAAgB,QAAQ,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;IAAE,IAAI,CAAC,EAAE,OAAO,CAAC;IAAC,EAAE,CAAC,EAAE,OAAO,CAAC;IAAC,OAAO,CAAC,EAAE,OAAO,CAAA;CAAE,GAAG,IAAI,CAM/H;AACD,wBAAgB,SAAS,IAAI,IAAI,CA8BhC;AACD,qBAAa,kBAAkB;IAC7B,SAAS,CAAC,eAAe,SAAS;IAClC,OAAO,CAAC,MAAM,CAAqB;IAC5B,KAAK,SAAI;IACT,cAAc,EAAE,GAAG,CAAO;IAC1B,UAAU,SAAI;IACd,YAAY,SAAI;IAChB,cAAc,WAAiB;IAC/B,aAAa,4CAAkD;IACtE,OAAO,CAAC,UAAU,CAA8B;IAChD,OAAO,CAAC,OAAO,CAA8B;IAC7C,OAAO,CAAC,UAAU,CAA6B;IAC/C,OAAO,CAAC,YAAY,CAAwB;IAC5C,OAAO,CAAC,eAAe,CAAmD;IAC1E,OAAO,CAAC,mBAAmB,CAAqB;IACzC,cAAc,WAAiB;IAC/B,WAAW,EAAE,GAAG,CAAO;gBAElB,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,mBAAmB,CAAA;KAAE;IAI/C,QAAQ,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,OAAO,CAAC;QAAC,EAAE,CAAC,EAAE,OAAO,CAAC;QAAC,OAAO,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,IAAI;IAIhH,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC;IAmBxB,YAAY,IAAI,IAAI;IAkD3B,OAAO,CAAC,GAAG;IASJ,MAAM,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,CAAC,EAAE,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAIhF,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC;IAK1D,MAAM,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,SAAS,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,IAAI;IAInE,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC;IAI1B,QAAQ,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,CAAC;IAIvD,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;IAK1E,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC;IAuC7C,OAAO,CAAC,KAAK;IAoBN,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,EACzB,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,KAAK,OAAO,CAAC,CAAC,CAAC,EACvD,MAAM,CAAC,EAAE;QAAE,KAAK,EAAE,CAAC,CAAA;KAAE,EACrB,aAAa,CAAC,EAAE,MAAM,GAAG,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,GAC7C,QAAQ,CAAC,CAAC,CAAC;CAgLf;AAED,OAAO,EAAE,kBAAkB,IAAI,cAAc,EAAE,kBAAkB,IAAI,uBAAuB,EAAE,CAAA"}
@@ -1 +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,CA2Rb"}
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,CAqTb"}
@@ -1 +1 @@
1
- {"version":3,"file":"core.method.effect.d.ts","sourceRoot":"","sources":["../../src/core/core.method.effect.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAA;AAEnC,wBAAgB,YAAY,CAC1B,MAAM,EAAE,GAAG,EACX,EAAE,EAAE,MAAM,IAAI,GAAG,SAAS,EAC1B,UAAU,CAAC,EAAE,MAAM,GAClB,MAAM,IAAI,CAuHZ"}
1
+ {"version":3,"file":"core.method.effect.d.ts","sourceRoot":"","sources":["../../src/core/core.method.effect.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAA;AAEnC,wBAAgB,YAAY,CAC1B,MAAM,EAAE,GAAG,EACX,EAAE,EAAE,MAAM,IAAI,GAAG,SAAS,EAC1B,UAAU,CAAC,EAAE,MAAM,GAClB,MAAM,IAAI,CAwHZ"}
package/dist/core.cjs CHANGED
@@ -1,2 +1,2 @@
1
- const e=require("./utils/getExtractedValues.cjs"),t=require("./core.method.computed.cjs"),n=require("./core.method.signal.cjs"),r=require("./core.method.untrack.cjs"),i=require("./core.method.reactive.cjs"),a=require("./core.method.effect.cjs"),o=require("./core.logger.cjs");var s={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;`},c=null;function l(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 u(e,t,n){c||(c={id:Math.random().toString(36).substring(2,9),pendingLogQueue:[],isFlushing:!1},queueMicrotask(()=>d())),c.pendingLogQueue.push({type:e,label:t,from:n?.from,to:n?.to,payload:n?.payload,timestamp:Date.now()})}function d(){if(!c||c.isFlushing)return;c.isFlushing=!0;let e=c.pendingLogQueue;if(e.length===0){c=null;return}console.groupCollapsed(`%cREACTIVE TRANSACTION%c [id: ${c.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=s[t.type],n=t.from!==void 0||t.to!==void 0,r=`%c${t.type.toUpperCase()}%c ${t.label}`;n&&(t.from?r+=` ${l(t.from)} → ${l(t.to)}`:r+=` (${l(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(),c=null}var f=class{frameworkPrefix=`core`;logger;epoch=0;activeConsumer=null;batchDepth=0;subscriberId=0;pendingEffects=new Set;computedCache=new Map;diRegistry=new Map;diCache=new Map;proxyCache=new WeakMap;proxyTargets=new WeakSet;reactiveSignals=new WeakMap;cycleDetectionStack=new Set;batchedSignals=new Set;activeOwner=null;constructor(e){this.logger=e?.logger||{isEnabled:!1}}queueLog(e,t,n){u(e,t,n)}batch(e){this.batchDepth++;try{return e()}finally{if(this.batchDepth--,this.batchDepth===0){let e=Array.from(this.batchedSignals);this.batchedSignals.clear(),e.forEach(e=>{e._flushBatch&&e._flushBatch()}),this.flushEffects()}}}flushEffects(){if(this.batchDepth>0)return;let e=Array.from(this.pendingEffects);this.pendingEffects.clear(),e.sort((e,t)=>(e.depth||0)-(t.depth||0)||e.id-t.id);let t=this.activeConsumer;try{for(let t of e)if(!t.isDisposed){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}}if(t.isDirty)try{t.run()}catch(e){if(this.batchDepth===0)throw e}}}finally{this.activeConsumer=t}}log({type:e,label:t,details:n,isInternalCoreSignal:r=!1}){o.ReactiveDebounceLogger.processLog(this.logger,u,{type:e,label:t,details:n,isInternalCoreSignal:r})}signal(e,t){return n.createSignal(this,e,t)}computed(e,n){return t.createComputed(this,e,n)}effect(e,t){return a.createEffect(this,e,t)}untrack(e){return r.executeUntrack(this,e)}reactive(e,t){return i.createReactive(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(t,n,r){let i=r&&typeof r==`object`,a=i?r.name||`unnamed_resource`:r||`unnamed_resource`,o=i?r:{},s=o.resetDataOnSourceChange??!0,c=o.responseValidate,l=o.validateBeforeFetch,u=this.signal({data:null,loading:!0,error:null,isRetrying:!1},`[CORE_INTERNAL_SIGNAL=1]:resource:state:${a}`),d=e=>{this.log({type:`resource`,label:a,details:{to:e,from:u.value}}),u.value=e},f=async(n,r,i=!1)=>{if(r.aborted)return;if(o.validateBeforeFetch&&o.validateBeforeFetch(n),l){let e=l(n);if(e===!1||typeof e==`string`){if(r.aborted)return;let t=typeof e==`string`?e:`Pre-fetch validation failed for resource`,n=i?null:this.untrack(()=>u.value.data);d({data:n,loading:!1,error:t,isRetrying:!1});return}}let f=i&&s?null:this.untrack(()=>u.value.data);d({data:f,loading:!0,error:null,isRetrying:!1});for(let i=0;i<=0;i++){if(r.aborted)return;let o=r;try{let e=await t(n,o);if(r.aborted)return;if(o.aborted)throw new DOMException(`The operation timed out.`,`TimeoutError`);if(c){let t=c(e);if(t===!1||typeof t==`string`){if(r.aborted)return;d({data:null,loading:!1,error:typeof t==`string`?t:`Validation failed`,isRetrying:!1});return}}if(r.aborted)return;d({data:e,loading:!1,error:null,isRetrying:!1});return}catch(t){if(r.aborted||t.name===`AbortError`&&r.aborted)return;let n=t.name===`TimeoutError`||t.name===`AbortError`||t.message?.includes(`timeout`),o=e.getExtractedValues({tested:[t.message],expectedKey:`THROW_CUSTOM_VALIDATION_ERROR_NO_RETRY`,valueType:`number`})?.[0]===`1`||!1,s=o&&e.getExtractedValues({tested:[t.message],expectedKey:`MESSAGE`,valueType:`string`})?.[0]||`Custom validation error`,c=o||t.name===`ValidationError`;if(i===0||c){if(r.aborted)return;let e=n?Error(`Request timed out after 1000ms`,{cause:t}):o?Error(s,{cause:t}):t;d({data:null,loading:!1,error:e instanceof Error?e.message:typeof e==`string`?e:`typeof finalError is ${typeof e}`,isRetrying:!1});return}else{if(r.aborted)return;let e=1e3*2**i;e=Math.min(e,3e5);let t=Math.random()*200;e+=t,d({data:u.value.data,loading:!0,error:null,isRetrying:!0}),console.warn(`[Resource Retry] "${a}" сбой по ${n?`таймауту`:`ошибке сети`}. Попытка ${i+1}/${i+1}...`);try{if(await this.delay(e,r),r.aborted)return}catch{return}}}}},p=null;return this.effect(()=>{let e=n?n.value:void 0,t=new AbortController;return p=t,this.untrack(()=>{f(e,t.signal,!0)}),()=>t.abort()},`[CORE_INTERNAL_SIGNAL=1]:effect`),{get data(){return u.value.data},get loading(){return u.value.loading},get error(){return u.value.error},get isRetrying(){return u.value.isRetrying},get value(){return u.value},refetch:()=>{p?.abort(),p=new AbortController,f(n?n.value:void 0,p.signal,!1)},subscribe:e=>u.subscribe(e)}}};exports.ReactiveEngine=f,exports.ReactiveEngineAutomatic=f,exports.ReactiveEngineCore=f,exports.flushLogs=d,exports.queueLog=u;
1
+ const e=require("./utils/getExtractedValues.cjs"),t=require("./core.method.computed.cjs"),n=require("./core.method.signal.cjs"),r=require("./core.method.untrack.cjs"),i=require("./core.method.reactive.cjs"),a=require("./core.method.effect.cjs"),o=require("./core.logger.cjs");var s={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;`},c=null;function l(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 u(e,t,n){c||(c={id:Math.random().toString(36).substring(2,9),pendingLogQueue:[],isFlushing:!1},queueMicrotask(()=>d())),c.pendingLogQueue.push({type:e,label:t,from:n?.from,to:n?.to,payload:n?.payload,timestamp:Date.now()})}function d(){if(!c||c.isFlushing)return;c.isFlushing=!0;let e=c.pendingLogQueue;if(e.length===0){c=null;return}console.groupCollapsed(`%cREACTIVE TRANSACTION%c [id: ${c.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=s[t.type],n=t.from!==void 0||t.to!==void 0,r=`%c${t.type.toUpperCase()}%c ${t.label}`;n&&(t.from?r+=` ${l(t.from)} → ${l(t.to)}`:r+=` (${l(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(),c=null}var f=class{frameworkPrefix=`core`;logger;epoch=0;activeConsumer=null;batchDepth=0;subscriberId=0;pendingEffects=new Set;computedCache=new Map;diRegistry=new Map;diCache=new Map;proxyCache=new WeakMap;proxyTargets=new WeakSet;reactiveSignals=new WeakMap;cycleDetectionStack=new Set;batchedSignals=new Set;activeOwner=null;constructor(e){this.logger=e?.logger||{isEnabled:!1}}queueLog(e,t,n){u(e,t,n)}batch(e){this.batchDepth++;try{return e()}finally{if(this.batchDepth--,this.batchDepth===0){let e=Array.from(this.batchedSignals);this.batchedSignals.clear(),e.forEach(e=>{e._flushBatch&&e._flushBatch()}),this.flushEffects()}}}flushEffects(){if(this.batchDepth>0)return;let e=Array.from(this.pendingEffects);this.pendingEffects.clear(),e.sort((e,t)=>(e.depth||0)-(t.depth||0)||e.id-t.id);let t=this.activeConsumer;try{for(let t of e)if(!t.isDisposed){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}}if(t.isDirty)try{t.run()}catch(e){throw e}}}finally{this.activeConsumer=t}}log({type:e,label:t,details:n,isInternalCoreSignal:r=!1}){o.ReactiveDebounceLogger.processLog(this.logger,u,{type:e,label:t,details:n,isInternalCoreSignal:r})}signal(e,t){return n.createSignal(this,e,t)}computed(e,n){return t.createComputed(this,e,n)}effect(e,t){return a.createEffect(this,e,t)}untrack(e){return r.executeUntrack(this,e)}reactive(e,t){return i.createReactive(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(t,n,r){let i=r&&typeof r==`object`,a=i?r.name||`unnamed_resource`:r||`unnamed_resource`,o=i?r:{},s=o.resetDataOnSourceChange??!0,c=o.responseValidate,l=o.validateBeforeFetch,u=this.signal({data:null,loading:!0,error:null,isRetrying:!1},`[CORE_INTERNAL_SIGNAL=1]:resource:state:${a}`),d=e=>{this.log({type:`resource`,label:a,details:{to:e,from:u.value}}),u.value=e},f=async(n,r,i=!1)=>{if(r.aborted)return;if(o.validateBeforeFetch&&o.validateBeforeFetch(n),l){let e=l(n);if(e===!1||typeof e==`string`){if(r.aborted)return;let t=typeof e==`string`?e:`Pre-fetch validation failed for resource`,n=i?null:this.untrack(()=>u.value.data);d({data:n,loading:!1,error:t,isRetrying:!1});return}}let f=i&&s?null:this.untrack(()=>u.value.data);d({data:f,loading:!0,error:null,isRetrying:!1});for(let i=0;i<=0;i++){if(r.aborted)return;let o=r;try{let e=await t(n,o);if(r.aborted)return;if(o.aborted)throw new DOMException(`The operation timed out.`,`TimeoutError`);if(c){let t=c(e);if(t===!1||typeof t==`string`){if(r.aborted)return;d({data:null,loading:!1,error:typeof t==`string`?t:`Validation failed`,isRetrying:!1});return}}if(r.aborted)return;d({data:e,loading:!1,error:null,isRetrying:!1});return}catch(t){if(r.aborted||t.name===`AbortError`&&r.aborted)return;let n=t.name===`TimeoutError`||t.name===`AbortError`||t.message?.includes(`timeout`),o=e.getExtractedValues({tested:[t.message],expectedKey:`THROW_CUSTOM_VALIDATION_ERROR_NO_RETRY`,valueType:`number`})?.[0]===`1`||!1,s=o&&e.getExtractedValues({tested:[t.message],expectedKey:`MESSAGE`,valueType:`string`})?.[0]||`Custom validation error`,c=o||t.name===`ValidationError`;if(i===0||c){if(r.aborted)return;let e=n?Error(`Request timed out after 1000ms`,{cause:t}):o?Error(s,{cause:t}):t;d({data:null,loading:!1,error:e instanceof Error?e.message:typeof e==`string`?e:`typeof finalError is ${typeof e}`,isRetrying:!1});return}else{if(r.aborted)return;let e=1e3*2**i;e=Math.min(e,3e5);let t=Math.random()*200;e+=t,d({data:u.value.data,loading:!0,error:null,isRetrying:!0}),console.warn(`[Resource Retry] "${a}" сбой по ${n?`таймауту`:`ошибке сети`}. Попытка ${i+1}/${i+1}...`);try{if(await this.delay(e,r),r.aborted)return}catch{return}}}}},p=null;return this.effect(()=>{let e=n?n.value:void 0,t=new AbortController;return p=t,this.untrack(()=>{f(e,t.signal,!0)}),()=>t.abort()},`[CORE_INTERNAL_SIGNAL=1]:effect`),{get data(){return u.value.data},get loading(){return u.value.loading},get error(){return u.value.error},get isRetrying(){return u.value.isRetrying},get value(){return u.value},refetch:()=>{p?.abort(),p=new AbortController,f(n?n.value:void 0,p.signal,!1)},subscribe:e=>u.subscribe(e)}}};exports.ReactiveEngine=f,exports.ReactiveEngineAutomatic=f,exports.ReactiveEngineCore=f,exports.flushLogs=d,exports.queueLog=u;
2
2
  //# sourceMappingURL=core.cjs.map
package/dist/core.cjs.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"core.cjs","names":[],"sources":["../src/core/core.ts"],"sourcesContent":["import { getExtractedValues } from '../utils/getExtractedValues'\nimport { Signal, Computed, IEffect, EngineLoggerOptions, LogEventType, CleanupFn, TransactionContext, LogRecord, SignalOptions, ResourceOptions, ResourceState, Resource } from './types'\nimport { createComputed } from './core.method.computed'\nimport { createSignal } from './core.method.signal'\nimport { executeBatch } from './core.method.batch'\nimport { executeUntrack } from './core.method.untrack'\nimport { createReactive } from './core.method.reactive'\nimport { createEffect } from './core.method.effect'\nimport { ReactiveDebounceLogger } from './core.logger'\n\n// Тип для конструктора класса\ntype Constructor<T> = new (...args: any[]) => T\n// Тип для фабричной функции зависимостей\ntype Factory<T> = (engine: any) => T\n// Универсальный тип токена DI\ntype InjectionToken<T> = Constructor<T> | Factory<T> | symbol | string\n\nconst badgeColors: Record<LogEventType, string> = {\n signal: 'background: #007acc; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n computed: 'background: #42b883; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n effect: 'background: #e01e5a; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n batch: 'background: #7952b3; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n resource: 'background: #d97706; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n reactive: 'background: #007acc; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;'\n}\nlet currentTransaction: TransactionContext | null = null\nfunction safeValueToString(value: unknown): string {\n if (value === null) return 'null'\n if (value === undefined) return 'undefined'\n if (typeof value === 'object') {\n try {\n return JSON.stringify(value)\n } catch (e) {\n return '[Cyclic Object or Layer]'\n }\n }\n return String(value)\n}\nexport function queueLog(type: LogEventType, label: string, details?: { from?: unknown; to?: unknown; payload?: unknown }): void {\n if (!currentTransaction) {\n currentTransaction = { id: Math.random().toString(36).substring(2, 9), pendingLogQueue: [], isFlushing: false }\n queueMicrotask(() => flushLogs())\n }\n currentTransaction.pendingLogQueue.push({ type, label, from: details?.from, to: details?.to, payload: details?.payload, timestamp: Date.now() })\n}\nexport function flushLogs(): void {\n if (!currentTransaction || currentTransaction.isFlushing) return\n currentTransaction.isFlushing = true\n const queue = currentTransaction.pendingLogQueue\n if (queue.length === 0) {\n currentTransaction = null\n return\n }\n console.groupCollapsed(`%cREACTIVE TRANSACTION%c [id: ${currentTransaction.id}] (${queue.length} operations)`, 'background: #7952b3; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;', 'color: #888; font-weight: normal;')\n for (const record of queue) {\n const colorStyle = badgeColors[record.type]\n const hasTransition = record.from !== undefined || record.to !== undefined\n let logMessage = `%c${record.type.toUpperCase()}%c ${record.label}`\n\n if (hasTransition) {\n if (!!record.from)\n logMessage += ` ${safeValueToString(record.from)} → ${safeValueToString(record.to)}`\n else logMessage += ` (${safeValueToString(record.to)})`\n }\n\n if (record.payload !== undefined) {\n console.groupCollapsed(logMessage, colorStyle, 'color: inherit;')\n console.log('Payload:', record.payload)\n console.groupEnd()\n } else {\n console.log(logMessage, colorStyle, 'color: inherit;')\n }\n }\n console.groupEnd()\n currentTransaction = null\n}\nexport class ReactiveEngineCore {\n protected frameworkPrefix = 'core'\n private logger: EngineLoggerOptions\n public epoch = 0\n public activeConsumer: any = null\n public batchDepth = 0\n public subscriberId = 0\n public pendingEffects = new Set<any>()\n public computedCache = new Map<Function, WeakRef<Computed<unknown>>>()\n private diRegistry = new Map<unknown, unknown>()\n private diCache = new Map<unknown, unknown>()\n private proxyCache = new WeakMap<object, any>()\n private proxyTargets = new WeakSet<object>()\n private reactiveSignals = new WeakMap<object, Map<string | symbol, any>>()\n private cycleDetectionStack = new Set<unknown>()\n public batchedSignals = new Set<any>()\n public activeOwner: any = null\n\n constructor(options?: { logger?: EngineLoggerOptions }) {\n this.logger = options?.logger || { isEnabled: false }\n }\n\n public queueLog(type: LogEventType, label: string, details?: { from?: unknown; to?: unknown; payload?: unknown }): void {\n queueLog(type, label, details)\n }\n\n public batch<T>(fn: () => T): T {\n this.batchDepth++\n try {\n return fn()\n } finally {\n this.batchDepth--\n if (this.batchDepth === 0) {\n // 🚀 АТOМАРНЫЙ КOММИТ ТРАНЗАКЦИИ\n const signalsToFlush = Array.from(this.batchedSignals)\n this.batchedSignals.clear()\n\n // Сначала фиксируем финальные версии всех изменившихся сигналов\n signalsToFlush.forEach(sig => {\n if (sig._flushBatch) sig._flushBatch()\n })\n\n // Затем одной топологической волной запускаем эффекты\n this.flushEffects()\n }\n }\n }\n\n public flushEffects(): void {\n if (this.batchDepth > 0) return\n\n const effects = Array.from(this.pendingEffects)\n this.pendingEffects.clear()\n\n // Гарантируем строгий топологический порядок выполнения эффектов\n effects.sort((a, b) => (a.depth || 0) - (b.depth || 0) || a.id - b.id)\n\n const prevConsumer = this.activeConsumer\n\n try {\n for (const effect of effects) {\n if (effect.isDisposed) continue\n\n // Рекурсивный pull-анализ версий родителей перед запуском эффекта\n if (effect.dependencies && effect.dependencies.size > 0) {\n let parentChanged = false\n for (const dep of effect.dependencies) {\n const rawNode = dep._node || dep\n if (rawNode.type === 'computed' && rawNode.state > 0) {\n if (rawNode.update) rawNode.update()\n }\n if (effect.depVersions && effect.depVersions.get(dep) !== rawNode.version) {\n parentChanged = true\n }\n }\n // Value Equality Cut: Если предки стабильны, гасим эффект\n if (!parentChanged && effect.dependencies.size > 0) {\n effect.isDirty = false\n continue\n }\n }\n\n if (!effect.isDirty) continue\n\n try {\n effect.run()\n } catch (err) {\n if (this.batchDepth === 0) throw err\n }\n }\n } finally {\n this.activeConsumer = prevConsumer\n }\n }\n\n // public batch<T>(fn: () => T): T {\n // return executeBatch<T>(this, fn)\n // }\n\n private log ({ type, label, details, isInternalCoreSignal = false }: { type: LogEventType, label: string, details?: { from?: unknown; to?: unknown; payload?: unknown }, isInternalCoreSignal?: boolean }) {\n ReactiveDebounceLogger.processLog(this.logger, queueLog, {\n type,\n label,\n details,\n isInternalCoreSignal\n })\n }\n\n public signal<T>(initialValue: T, optionsOrName?: string | SignalOptions<T>): Signal<T> {\n return createSignal<T>(this, initialValue, optionsOrName)\n }\n\n public computed<T>(fn: () => T, signalName?: string): Computed<T> {\n // Просто делегируем вызов строго изолированной чистой функции\n return createComputed<T>(this, fn, signalName)\n }\n\n public effect(fn: () => void | CleanupFn, effectName?: string): () => void {\n return createEffect(this, fn, effectName)\n }\n\n public untrack<T>(fn: () => T): T {\n return executeUntrack<T>(this, fn)\n }\n\n public reactive<T extends object>(target: T, name?: string): T {\n return createReactive<T>(this, target, name)\n }\n\n public provide<T>(token: InjectionToken<T>, valueOrFactory: T | Factory<T>): void {\n this.diRegistry.set(token, valueOrFactory)\n this.diCache.delete(token)\n }\n\n public inject<T>(token: InjectionToken<T>): T {\n if (token === undefined || token === null) throw new Error('[DI Error] Token is empty')\n if (this.diCache.has(token)) return this.diCache.get(token) as T\n if (this.cycleDetectionStack.has(token)) throw new Error('[DI Error] Cyclic dependency detected')\n this.cycleDetectionStack.add(token)\n try {\n if (this.diRegistry.has(token)) {\n const entry = this.diRegistry.get(token)\n if (typeof entry === 'function') {\n if ((entry as any)._isMockFunction) {\n const mockRes = (entry as Function)(this)\n if (mockRes !== undefined) {\n this.diCache.set(token, mockRes)\n return mockRes as T\n }\n return entry as unknown as T\n }\n const str = entry.toString()\n const isClass = str.startsWith('class ') || str.startsWith('class{') || (entry.prototype && entry.prototype.constructor === entry && !str.startsWith('function') && !str.includes('=>'))\n if (!isClass) {\n const resolved = (entry as Factory<T>)(this)\n this.diCache.set(token, resolved)\n return resolved\n }\n return entry as unknown as T\n }\n return entry as T\n }\n if (typeof token === 'function') {\n const resolved = new (token as Constructor<T>)(this)\n this.diCache.set(token, resolved)\n return resolved\n }\n throw new Error('[DI Error] Token not found')\n } finally {\n this.cycleDetectionStack.delete(token)\n }\n }\n\n private delay(ms: number, signal: AbortSignal): Promise<void> {\n return new Promise((resolve, reject) => {\n if (signal.aborted) {\n return reject(new DOMException('Aborted', 'AbortError'))\n }\n\n const timeoutId = setTimeout(() => {\n signal.removeEventListener('abort', onAbort)\n resolve()\n }, ms)\n\n const onAbort = () => {\n clearTimeout(timeoutId)\n reject(new DOMException('Aborted', 'AbortError'))\n }\n\n signal.addEventListener('abort', onAbort, { once: true })\n })\n }\n\n public resource<T, S = void>(\n fetcher: (source: S, signal: AbortSignal) => Promise<T>,\n source?: { value: S },\n optionsOrName?: string | ResourceOptions<T, S>,\n ): Resource<T> {\n const isOptionsObject = optionsOrName && typeof optionsOrName === 'object'\n const resourceSignalName = isOptionsObject\n ? ((optionsOrName as ResourceOptions<T, S>).name || 'unnamed_resource')\n : (optionsOrName as string) || 'unnamed_resource'\n\n const options: Partial<ResourceOptions<T, S>> = isOptionsObject\n ? (optionsOrName as ResourceOptions<T, S>)\n : {}\n\n const resetDataOnSourceChange = options.resetDataOnSourceChange ?? true\n const responseValidate = options.responseValidate\n const validateBeforeFetch = options.validateBeforeFetch\n const retryCount = 0\n const baseDelay = 1000\n const useExponential = true\n const maxRetryDelay = 1000 * 60 * 5\n const timeoutMs = 1000\n const state = this.signal<ResourceState<T>>(\n { data: null, loading: true, error: null, isRetrying: false },\n `[CORE_INTERNAL_SIGNAL=1]:resource:state:${resourceSignalName}`\n )\n\n const updateResourceState = (nextState: ResourceState<T>) => {\n this.log({ type: 'resource', label: resourceSignalName, details: { to: nextState, from: state.value } })\n state.value = nextState\n }\n\n const load = async (sValue: S, effectSignal: AbortSignal, isSourceChange = false) => {\n if (effectSignal.aborted) return\n const isValid = options.validateBeforeFetch ? options.validateBeforeFetch(sValue) : true\n\n /**\n * 🧐 WIP_CORE: Есть два пути, ни один не будет ошибкой, если разкомментировать код ниже. Чуть бозже добавлю опци для более тонкой отладки ядра.\n *\n * - АКТИВНО: Разделяем мирную блокировку (false) и боевую ошибку (string): работать будет идеально, но без логов, связанных с пре-валидацией\n * - НЕАКТИВНО: Более очевидное логирование процессов пре-валидации (выставление ошибок и мониторинг разработчиком)\n */\n // --\n // if (isValid === false) {\n // // Если валидатор вернул строго false — мы тихо блокируем старт фетчера,\n // // переводя ресурс в состояние ПОКОЯ (loading: false, error: null).\n // // Это полностью ликвидирует генерацию ложных ошибок при монтировании!\n // state.value = {\n // loading: false,\n // data: null,\n // error: null, // Ошибки нет! Стейт стабилен.\n // isRetrying: false\n // }\n // return\n // }\n // if (typeof isValid === 'string') {\n // // Если валидатор вернул строку — это боевая декларативная ошибка валидации формы.\n // // Здесь мы честно переводим ресурс в стейт ошибки, как и требовалось ранее.\n // state.value = {\n // loading: false,\n // data: null,\n // error: 'Core internal stopper',\n // isRetrying: false\n // }\n // return\n // }\n // --\n if (validateBeforeFetch) {\n const preValidationResult = validateBeforeFetch(sValue)\n if (preValidationResult === false || typeof preValidationResult === 'string') {\n if (effectSignal.aborted) return\n const errorMsg = typeof preValidationResult === 'string'\n ? preValidationResult\n : 'Pre-fetch validation failed for resource'\n\n const currentData = isSourceChange ? null : this.untrack(() => state.value.data)\n updateResourceState({ data: currentData, loading: false, error: errorMsg, isRetrying: false })\n return\n }\n }\n const shouldClear = isSourceChange && resetDataOnSourceChange\n const currentData = shouldClear ? null : this.untrack(() => state.value.data)\n updateResourceState({ data: currentData, loading: true, error: null, isRetrying: false })\n for (let attempt = 0; attempt <= retryCount; attempt++) {\n if (effectSignal.aborted) return\n let combinedSignal = effectSignal\n try {\n const data = await fetcher(sValue, combinedSignal)\n if (effectSignal.aborted) return\n if (combinedSignal.aborted) {\n throw new DOMException('The operation timed out.', 'TimeoutError')\n }\n if (responseValidate) {\n const validationResult = responseValidate(data)\n if (validationResult === false || typeof validationResult === 'string') {\n if (effectSignal.aborted) return\n const errorMsg = typeof validationResult === 'string' ? validationResult : 'Validation failed'\n updateResourceState({ data: null, loading: false, error: errorMsg, isRetrying: false })\n return\n }\n }\n if (effectSignal.aborted) return\n updateResourceState({ data, loading: false, error: null, isRetrying: false })\n return\n } catch (e: unknown) {\n if (effectSignal.aborted || ((e as Error).name === 'AbortError' && effectSignal.aborted)) return\n const isTimeout = (e as Error).name === 'TimeoutError' || (e as Error).name === 'AbortError' || (e as Error).message?.includes('timeout')\n const isCustomValidationError = getExtractedValues({\n tested: [(e as Error).message], expectedKey: 'THROW_CUSTOM_VALIDATION_ERROR_NO_RETRY', valueType: 'number',\n })?.[0] === '1' || false\n const __defaultCustomValidationErrorMessage = 'Custom validation error'\n let customValidationErrorMessage: string = isCustomValidationError\n ? (getExtractedValues({\n tested: [(e as Error).message], expectedKey: 'MESSAGE', valueType: 'string',\n })?.[0] || __defaultCustomValidationErrorMessage)\n : __defaultCustomValidationErrorMessage\n const isFetchBodyValidationError = isCustomValidationError || (e as Error).name === 'ValidationError'\n if (attempt === retryCount || isFetchBodyValidationError) {\n if (effectSignal.aborted) return\n const finalError = isTimeout\n ? new Error(`Request timed out after ${timeoutMs}ms`, { cause: e })\n : isCustomValidationError\n ? new Error(customValidationErrorMessage, { cause: e })\n : e\n\n updateResourceState({\n data: null, loading: false,\n error: finalError instanceof Error ? finalError.message : typeof finalError === 'string' ? finalError : `typeof finalError is ${typeof finalError}`,\n isRetrying: false,\n })\n return\n } else {\n if (effectSignal.aborted) return\n let currentDelay = useExponential ? baseDelay * Math.pow(2, attempt) : baseDelay\n currentDelay = Math.min(currentDelay, maxRetryDelay)\n const jitter = Math.random() * 200\n currentDelay = currentDelay + jitter\n updateResourceState({ data: state.value.data, loading: true, error: null, isRetrying: true })\n const logReason = isTimeout ? 'таймауту' : 'ошибке сети'\n console.warn(`[Resource Retry] \"${resourceSignalName}\" сбой по ${logReason}. Попытка ${attempt + 1}/${retryCount > 0 ? retryCount + 1 : attempt + 1}...`)\n\n try {\n await this.delay(currentDelay, effectSignal)\n if (effectSignal.aborted) return\n } catch (delayError) {\n return\n }\n }\n }\n }\n }\n\n let activeEffectController: AbortController | null = null\n\n this.effect(() => {\n const sValue = source ? source.value : undefined as S\n const effectController = new AbortController()\n activeEffectController = effectController\n\n this.untrack(() => {\n load(sValue as S, effectController.signal, true)\n })\n\n return () => effectController.abort()\n }, '[CORE_INTERNAL_SIGNAL=1]:effect')\n\n return {\n get data() { return state.value.data },\n get loading() { return state.value.loading },\n get error() { return state.value.error },\n get isRetrying() { return state.value.isRetrying },\n get value() { return state.value },\n refetch: () => {\n activeEffectController?.abort()\n activeEffectController = new AbortController()\n load(source ? source.value : undefined as S, activeEffectController.signal, false)\n },\n subscribe: (cb: (val: ResourceState<T>) => void) => state.subscribe(cb)\n }\n }\n}\n\nexport { ReactiveEngineCore as ReactiveEngine, ReactiveEngineCore as ReactiveEngineAutomatic }\n"],"mappings":"oRAiBA,IAAM,EAA4C,CAChD,OAAQ,6FACR,SAAU,6FACV,OAAQ,6FACR,MAAO,6FACP,SAAU,6FACV,SAAU,4FACZ,EACI,EAAgD,KACpD,SAAS,EAAkB,EAAwB,CACjD,GAAI,IAAU,KAAM,MAAO,OAC3B,GAAI,IAAU,IAAA,GAAW,MAAO,YAChC,GAAI,OAAO,GAAU,SACnB,GAAI,CACF,OAAO,KAAK,UAAU,CAAK,CAC7B,MAAY,CACV,MAAO,0BACT,CAEF,OAAO,OAAO,CAAK,CACrB,CACA,SAAgB,EAAS,EAAoB,EAAe,EAAqE,CAC1H,IACH,EAAqB,CAAE,GAAI,KAAK,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,UAAU,EAAG,CAAC,EAAG,gBAAiB,CAAC,EAAG,WAAY,EAAM,EAC9G,mBAAqB,EAAU,CAAC,GAElC,EAAmB,gBAAgB,KAAK,CAAE,OAAM,QAAO,KAAM,GAAS,KAAM,GAAI,GAAS,GAAI,QAAS,GAAS,QAAS,UAAW,KAAK,IAAI,CAAE,CAAC,CACjJ,CACA,SAAgB,GAAkB,CAChC,GAAI,CAAC,GAAsB,EAAmB,WAAY,OAC1D,EAAmB,WAAa,GAChC,IAAM,EAAQ,EAAmB,gBACjC,GAAI,EAAM,SAAW,EAAG,CACtB,EAAqB,KACrB,MACF,CACA,QAAQ,eAAe,iCAAiC,EAAmB,GAAG,KAAK,EAAM,OAAO,cAAe,6FAA8F,mCAAmC,EAChP,IAAK,IAAM,KAAU,EAAO,CAC1B,IAAM,EAAa,EAAY,EAAO,MAChC,EAAgB,EAAO,OAAS,IAAA,IAAa,EAAO,KAAO,IAAA,GAC7D,EAAa,KAAK,EAAO,KAAK,YAAY,EAAE,KAAK,EAAO,QAExD,IACI,EAAO,KACX,GAAc,IAAI,EAAkB,EAAO,IAAI,EAAE,KAAK,EAAkB,EAAO,EAAE,IAC9E,GAAc,KAAK,EAAkB,EAAO,EAAE,EAAE,IAGnD,EAAO,UAAY,IAAA,GAKrB,QAAQ,IAAI,EAAY,EAAY,iBAAiB,GAJrD,QAAQ,eAAe,EAAY,EAAY,iBAAiB,EAChE,QAAQ,IAAI,WAAY,EAAO,OAAO,EACtC,QAAQ,SAAS,EAIrB,CACA,QAAQ,SAAS,EACjB,EAAqB,IACvB,CACA,IAAa,EAAb,KAAgC,CAC9B,gBAA4B,OAC5B,OACA,MAAe,EACf,eAA6B,KAC7B,WAAoB,EACpB,aAAsB,EACtB,eAAwB,IAAI,IAC5B,cAAuB,IAAI,IAC3B,WAAqB,IAAI,IACzB,QAAkB,IAAI,IACtB,WAAqB,IAAI,QACzB,aAAuB,IAAI,QAC3B,gBAA0B,IAAI,QAC9B,oBAA8B,IAAI,IAClC,eAAwB,IAAI,IAC5B,YAA0B,KAE1B,YAAY,EAA4C,CACtD,KAAK,OAAS,GAAS,QAAU,CAAE,UAAW,EAAM,CACtD,CAEA,SAAgB,EAAoB,EAAe,EAAqE,CACtH,EAAS,EAAM,EAAO,CAAO,CAC/B,CAEA,MAAgB,EAAgB,CAC9B,KAAK,aACL,GAAI,CACF,OAAO,EAAG,CACZ,QAAU,CAER,GADA,KAAK,aACD,KAAK,aAAe,EAAG,CAEzB,IAAM,EAAiB,MAAM,KAAK,KAAK,cAAc,EACrD,KAAK,eAAe,MAAM,EAG1B,EAAe,QAAQ,GAAO,CACxB,EAAI,aAAa,EAAI,YAAY,CACvC,CAAC,EAGD,KAAK,aAAa,CACpB,CACF,CACF,CAEA,cAA4B,CAC1B,GAAI,KAAK,WAAa,EAAG,OAEzB,IAAM,EAAU,MAAM,KAAK,KAAK,cAAc,EAC9C,KAAK,eAAe,MAAM,EAG1B,EAAQ,MAAM,EAAG,KAAO,EAAE,OAAS,IAAM,EAAE,OAAS,IAAM,EAAE,GAAK,EAAE,EAAE,EAErE,IAAM,EAAe,KAAK,eAE1B,GAAI,CACF,IAAK,IAAM,KAAU,EACf,MAAO,WAGX,IAAI,EAAO,cAAgB,EAAO,aAAa,KAAO,EAAG,CACvD,IAAI,EAAgB,GACpB,IAAK,IAAM,KAAO,EAAO,aAAc,CACrC,IAAM,EAAU,EAAI,OAAS,EACzB,EAAQ,OAAS,YAAc,EAAQ,MAAQ,GAC7C,EAAQ,QAAQ,EAAQ,OAAO,EAEjC,EAAO,aAAe,EAAO,YAAY,IAAI,CAAG,IAAM,EAAQ,UAChE,EAAgB,GAEpB,CAEA,GAAI,CAAC,GAAiB,EAAO,aAAa,KAAO,EAAG,CAClD,EAAO,QAAU,GACjB,QACF,CACF,CAEK,KAAO,QAEZ,GAAI,CACF,EAAO,IAAI,CACb,OAAS,EAAK,CACZ,GAAI,KAAK,aAAe,EAAG,MAAM,CACnC,CARA,CAUJ,QAAU,CACR,KAAK,eAAiB,CACxB,CACF,CAMA,IAAa,CAAE,OAAM,QAAO,UAAS,uBAAuB,IAA+I,CACzM,EAAA,uBAAuB,WAAW,KAAK,OAAQ,EAAU,CACvD,OACA,QACA,UACA,sBACF,CAAC,CACH,CAEA,OAAiB,EAAiB,EAAsD,CACtF,OAAO,EAAA,aAAgB,KAAM,EAAc,CAAa,CAC1D,CAEA,SAAmB,EAAa,EAAkC,CAEhE,OAAO,EAAA,eAAkB,KAAM,EAAI,CAAU,CAC/C,CAEA,OAAc,EAA4B,EAAiC,CACzE,OAAO,EAAA,aAAa,KAAM,EAAI,CAAU,CAC1C,CAEA,QAAkB,EAAgB,CAChC,OAAO,EAAA,eAAkB,KAAM,CAAE,CACnC,CAEA,SAAkC,EAAW,EAAkB,CAC7D,OAAO,EAAA,eAAkB,KAAM,EAAQ,CAAI,CAC7C,CAEA,QAAkB,EAA0B,EAAsC,CAChF,KAAK,WAAW,IAAI,EAAO,CAAc,EACzC,KAAK,QAAQ,OAAO,CAAK,CAC3B,CAEA,OAAiB,EAA6B,CAC5C,GAAI,GAAiC,KAAM,MAAU,MAAM,2BAA2B,EACtF,GAAI,KAAK,QAAQ,IAAI,CAAK,EAAG,OAAO,KAAK,QAAQ,IAAI,CAAK,EAC1D,GAAI,KAAK,oBAAoB,IAAI,CAAK,EAAG,MAAU,MAAM,uCAAuC,EAChG,KAAK,oBAAoB,IAAI,CAAK,EAClC,GAAI,CACF,GAAI,KAAK,WAAW,IAAI,CAAK,EAAG,CAC9B,IAAM,EAAQ,KAAK,WAAW,IAAI,CAAK,EACvC,GAAI,OAAO,GAAU,WAAY,CAC/B,GAAK,EAAc,gBAAiB,CAClC,IAAM,EAAW,EAAmB,IAAI,EAKxC,OAJI,IAAY,IAAA,GAIT,GAHL,KAAK,QAAQ,IAAI,EAAO,CAAO,EACxB,EAGX,CACA,IAAM,EAAM,EAAM,SAAS,EAE3B,GAAI,EADY,EAAI,WAAW,QAAQ,GAAK,EAAI,WAAW,QAAQ,GAAM,EAAM,WAAa,EAAM,UAAU,cAAgB,GAAS,CAAC,EAAI,WAAW,UAAU,GAAK,CAAC,EAAI,SAAS,IAAI,GACxK,CACZ,IAAM,EAAY,EAAqB,IAAI,EAE3C,OADA,KAAK,QAAQ,IAAI,EAAO,CAAQ,EACzB,CACT,CACA,OAAO,CACT,CACA,OAAO,CACT,CACA,GAAI,OAAO,GAAU,WAAY,CAC/B,IAAM,EAAW,IAAK,EAAyB,IAAI,EAEnD,OADA,KAAK,QAAQ,IAAI,EAAO,CAAQ,EACzB,CACT,CACA,MAAU,MAAM,4BAA4B,CAC9C,QAAU,CACR,KAAK,oBAAoB,OAAO,CAAK,CACvC,CACF,CAEA,MAAc,EAAY,EAAoC,CAC5D,OAAO,IAAI,SAAS,EAAS,IAAW,CACtC,GAAI,EAAO,QACT,OAAO,EAAO,IAAI,aAAa,UAAW,YAAY,CAAC,EAGzD,IAAM,EAAY,eAAiB,CACjC,EAAO,oBAAoB,QAAS,CAAO,EAC3C,EAAQ,CACV,EAAG,CAAE,EAEC,MAAgB,CACpB,aAAa,CAAS,EACtB,EAAO,IAAI,aAAa,UAAW,YAAY,CAAC,CAClD,EAEA,EAAO,iBAAiB,QAAS,EAAS,CAAE,KAAM,EAAK,CAAC,CAC1D,CAAC,CACH,CAEA,SACE,EACA,EACA,EACa,CACb,IAAM,EAAkB,GAAiB,OAAO,GAAkB,SAC5D,EAAqB,EACrB,EAAwC,MAAQ,mBACjD,GAA4B,mBAE3B,EAA0C,EAC3C,EACD,CAAC,EAEC,EAA0B,EAAQ,yBAA2B,GAC7D,EAAmB,EAAQ,iBAC3B,EAAsB,EAAQ,oBAM9B,EAAQ,KAAK,OACjB,CAAE,KAAM,KAAM,QAAS,GAAM,MAAO,KAAM,WAAY,EAAM,EAC5D,2CAA2C,GAC7C,EAEM,EAAuB,GAAgC,CAC3D,KAAK,IAAI,CAAE,KAAM,WAAY,MAAO,EAAoB,QAAS,CAAE,GAAI,EAAW,KAAM,EAAM,KAAM,CAAE,CAAC,EACvG,EAAM,MAAQ,CAChB,EAEM,EAAO,MAAO,EAAW,EAA2B,EAAiB,KAAU,CACnF,GAAI,EAAa,QAAS,OAkC1B,GAjCgB,EAAQ,qBAAsB,EAAQ,oBAAoB,CAAM,EAiC5E,EAAqB,CACvB,IAAM,EAAsB,EAAoB,CAAM,EACtD,GAAI,IAAwB,IAAS,OAAO,GAAwB,SAAU,CAC5E,GAAI,EAAa,QAAS,OAC1B,IAAM,EAAW,OAAO,GAAwB,SAC5C,EACA,2CAEE,EAAc,EAAiB,KAAO,KAAK,YAAc,EAAM,MAAM,IAAI,EAC/E,EAAoB,CAAE,KAAM,EAAa,QAAS,GAAO,MAAO,EAAU,WAAY,EAAM,CAAC,EAC7F,MACF,CACF,CAEA,IAAM,EADc,GAAkB,EACJ,KAAO,KAAK,YAAc,EAAM,MAAM,IAAI,EAC5E,EAAoB,CAAE,KAAM,EAAa,QAAS,GAAM,MAAO,KAAM,WAAY,EAAM,CAAC,EACxF,IAAK,IAAI,EAAU,EAAG,GAAW,EAAY,IAAW,CACtD,GAAI,EAAa,QAAS,OAC1B,IAAI,EAAiB,EACrB,GAAI,CACF,IAAM,EAAO,MAAM,EAAQ,EAAQ,CAAc,EACjD,GAAI,EAAa,QAAS,OAC1B,GAAI,EAAe,QACjB,MAAM,IAAI,aAAa,2BAA4B,cAAc,EAEnE,GAAI,EAAkB,CACpB,IAAM,EAAmB,EAAiB,CAAI,EAC9C,GAAI,IAAqB,IAAS,OAAO,GAAqB,SAAU,CACtE,GAAI,EAAa,QAAS,OAE1B,EAAoB,CAAE,KAAM,KAAM,QAAS,GAAO,MADjC,OAAO,GAAqB,SAAW,EAAmB,oBACR,WAAY,EAAM,CAAC,EACtF,MACF,CACF,CACA,GAAI,EAAa,QAAS,OAC1B,EAAoB,CAAE,OAAM,QAAS,GAAO,MAAO,KAAM,WAAY,EAAM,CAAC,EAC5E,MACF,OAAS,EAAY,CACnB,GAAI,EAAa,SAAa,EAAY,OAAS,cAAgB,EAAa,QAAU,OAC1F,IAAM,EAAa,EAAY,OAAS,gBAAmB,EAAY,OAAS,cAAiB,EAAY,SAAS,SAAS,SAAS,EAClI,EAA0B,EAAA,mBAAmB,CACjD,OAAQ,CAAE,EAAY,OAAO,EAAG,YAAa,yCAA0C,UAAW,QACpG,CAAC,CAAC,GAAG,KAAO,KAAO,GAEf,EAAuC,GACtC,EAAA,mBAAmB,CACpB,OAAQ,CAAE,EAAY,OAAO,EAAG,YAAa,UAAW,UAAW,QACrE,CAAC,CAAC,GAAG,IACH,0BACE,EAA6B,GAA4B,EAAY,OAAS,kBACpF,GAAI,IAAY,GAAc,EAA4B,CACxD,GAAI,EAAa,QAAS,OAC1B,IAAM,EAAa,EACX,MAAM,iCAA0C,CAAE,MAAO,CAAE,CAAC,EAChE,EACM,MAAM,EAA8B,CAAE,MAAO,CAAE,CAAC,EACpD,EAEN,EAAoB,CAClB,KAAM,KAAM,QAAS,GACrB,MAAO,aAAsB,MAAQ,EAAW,QAAU,OAAO,GAAe,SAAW,EAAa,wBAAwB,OAAO,IACvI,WAAY,EACd,CAAC,EACD,MACF,KAAO,CACL,GAAI,EAAa,QAAS,OAC1B,IAAI,EAAgC,IAAqB,GAAG,EAC5D,EAAe,KAAK,IAAI,EAAc,GAAa,EACnD,IAAM,EAAS,KAAK,OAAO,EAAI,IAC/B,GAA8B,EAC9B,EAAoB,CAAE,KAAM,EAAM,MAAM,KAAM,QAAS,GAAM,MAAO,KAAM,WAAY,EAAK,CAAC,EAE5F,QAAQ,KAAK,qBAAqB,EAAmB,YADnC,EAAY,WAAa,cACgC,YAAY,EAAU,EAAE,GAAqC,EAAU,EAAE,IAAI,EAExJ,GAAI,CAEF,GADA,MAAM,KAAK,MAAM,EAAc,CAAY,EACvC,EAAa,QAAS,MAC5B,MAAqB,CACnB,MACF,CACF,CACF,CACF,CACF,EAEI,EAAiD,KAcrD,OAZA,KAAK,WAAa,CAChB,IAAM,EAAS,EAAS,EAAO,MAAQ,IAAA,GACjC,EAAmB,IAAI,gBAO7B,MANA,GAAyB,EAEzB,KAAK,YAAc,CACjB,EAAK,EAAa,EAAiB,OAAQ,EAAI,CACjD,CAAC,MAEY,EAAiB,MAAM,CACtC,EAAG,iCAAiC,EAE7B,CACL,IAAI,MAAO,CAAE,OAAO,EAAM,MAAM,IAAK,EACrC,IAAI,SAAU,CAAE,OAAO,EAAM,MAAM,OAAQ,EAC3C,IAAI,OAAQ,CAAE,OAAO,EAAM,MAAM,KAAM,EACvC,IAAI,YAAa,CAAE,OAAO,EAAM,MAAM,UAAW,EACjD,IAAI,OAAQ,CAAE,OAAO,EAAM,KAAM,EACjC,YAAe,CACb,GAAwB,MAAM,EAC9B,EAAyB,IAAI,gBAC7B,EAAK,EAAS,EAAO,MAAQ,IAAA,GAAgB,EAAuB,OAAQ,EAAK,CACnF,EACA,UAAY,GAAwC,EAAM,UAAU,CAAE,CACxE,CACF,CACF"}
1
+ {"version":3,"file":"core.cjs","names":[],"sources":["../src/core/core.ts"],"sourcesContent":["import { getExtractedValues } from '../utils/getExtractedValues'\nimport { Signal, Computed, IEffect, EngineLoggerOptions, LogEventType, CleanupFn, TransactionContext, LogRecord, SignalOptions, ResourceOptions, ResourceState, Resource } from './types'\nimport { createComputed } from './core.method.computed'\nimport { createSignal } from './core.method.signal'\nimport { executeBatch } from './core.method.batch'\nimport { executeUntrack } from './core.method.untrack'\nimport { createReactive } from './core.method.reactive'\nimport { createEffect } from './core.method.effect'\nimport { ReactiveDebounceLogger } from './core.logger'\n\n// Тип для конструктора класса\ntype Constructor<T> = new (...args: any[]) => T\n// Тип для фабричной функции зависимостей\ntype Factory<T> = (engine: any) => T\n// Универсальный тип токена DI\ntype InjectionToken<T> = Constructor<T> | Factory<T> | symbol | string\n\nconst badgeColors: Record<LogEventType, string> = {\n signal: 'background: #007acc; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n computed: 'background: #42b883; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n effect: 'background: #e01e5a; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n batch: 'background: #7952b3; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n resource: 'background: #d97706; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;',\n reactive: 'background: #007acc; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;'\n}\nlet currentTransaction: TransactionContext | null = null\nfunction safeValueToString(value: unknown): string {\n if (value === null) return 'null'\n if (value === undefined) return 'undefined'\n if (typeof value === 'object') {\n try {\n return JSON.stringify(value)\n } catch (e) {\n return '[Cyclic Object or Layer]'\n }\n }\n return String(value)\n}\nexport function queueLog(type: LogEventType, label: string, details?: { from?: unknown; to?: unknown; payload?: unknown }): void {\n if (!currentTransaction) {\n currentTransaction = { id: Math.random().toString(36).substring(2, 9), pendingLogQueue: [], isFlushing: false }\n queueMicrotask(() => flushLogs())\n }\n currentTransaction.pendingLogQueue.push({ type, label, from: details?.from, to: details?.to, payload: details?.payload, timestamp: Date.now() })\n}\nexport function flushLogs(): void {\n if (!currentTransaction || currentTransaction.isFlushing) return\n currentTransaction.isFlushing = true\n const queue = currentTransaction.pendingLogQueue\n if (queue.length === 0) {\n currentTransaction = null\n return\n }\n console.groupCollapsed(`%cREACTIVE TRANSACTION%c [id: ${currentTransaction.id}] (${queue.length} operations)`, 'background: #7952b3; color: #fff; padding: 2px 6px; border-radius: 4px; font-weight: bold;', 'color: #888; font-weight: normal;')\n for (const record of queue) {\n const colorStyle = badgeColors[record.type]\n const hasTransition = record.from !== undefined || record.to !== undefined\n let logMessage = `%c${record.type.toUpperCase()}%c ${record.label}`\n\n if (hasTransition) {\n if (!!record.from)\n logMessage += ` ${safeValueToString(record.from)} → ${safeValueToString(record.to)}`\n else logMessage += ` (${safeValueToString(record.to)})`\n }\n\n if (record.payload !== undefined) {\n console.groupCollapsed(logMessage, colorStyle, 'color: inherit;')\n console.log('Payload:', record.payload)\n console.groupEnd()\n } else {\n console.log(logMessage, colorStyle, 'color: inherit;')\n }\n }\n console.groupEnd()\n currentTransaction = null\n}\nexport class ReactiveEngineCore {\n protected frameworkPrefix = 'core'\n private logger: EngineLoggerOptions\n public epoch = 0\n public activeConsumer: any = null\n public batchDepth = 0\n public subscriberId = 0\n public pendingEffects = new Set<any>()\n public computedCache = new Map<Function, WeakRef<Computed<unknown>>>()\n private diRegistry = new Map<unknown, unknown>()\n private diCache = new Map<unknown, unknown>()\n private proxyCache = new WeakMap<object, any>()\n private proxyTargets = new WeakSet<object>()\n private reactiveSignals = new WeakMap<object, Map<string | symbol, any>>()\n private cycleDetectionStack = new Set<unknown>()\n public batchedSignals = new Set<any>()\n public activeOwner: any = null\n\n constructor(options?: { logger?: EngineLoggerOptions }) {\n this.logger = options?.logger || { isEnabled: false }\n }\n\n public queueLog(type: LogEventType, label: string, details?: { from?: unknown; to?: unknown; payload?: unknown }): void {\n queueLog(type, label, details)\n }\n\n public batch<T>(fn: () => T): T {\n this.batchDepth++\n try {\n return fn()\n } finally {\n this.batchDepth--\n if (this.batchDepth === 0) {\n const signalsToFlush = Array.from(this.batchedSignals)\n this.batchedSignals.clear()\n\n signalsToFlush.forEach(sig => {\n if (sig._flushBatch) sig._flushBatch()\n })\n\n this.flushEffects()\n }\n }\n }\n\n public flushEffects(): void {\n if (this.batchDepth > 0) return\n\n const effects = Array.from(this.pendingEffects)\n this.pendingEffects.clear()\n\n // Строгая топологическая сортировка\n effects.sort((a, b) => (a.depth || 0) - (b.depth || 0) || a.id - b.id)\n\n const prevConsumer = this.activeConsumer\n\n try {\n for (const effect of effects) {\n if (effect.isDisposed) continue\n\n // Pull-валидация версий родителей перед запуском эффекта\n if (effect.dependencies && effect.dependencies.size > 0) {\n let parentChanged = false\n for (const dep of effect.dependencies) {\n const rawNode = dep._node || dep\n if (rawNode.type === 'computed' && rawNode.state > 0) {\n if (rawNode.update) rawNode.update()\n }\n if (effect.depVersions && effect.depVersions.get(dep) !== rawNode.version) {\n parentChanged = true\n }\n }\n if (!parentChanged && effect.dependencies.size > 0) {\n effect.isDirty = false\n continue\n }\n }\n\n if (!effect.isDirty) continue\n\n try {\n effect.run()\n } catch (err) {\n throw err\n }\n }\n } finally {\n this.activeConsumer = prevConsumer\n }\n }\n\n // public batch<T>(fn: () => T): T {\n // return executeBatch<T>(this, fn)\n // }\n\n private log ({ type, label, details, isInternalCoreSignal = false }: { type: LogEventType, label: string, details?: { from?: unknown; to?: unknown; payload?: unknown }, isInternalCoreSignal?: boolean }) {\n ReactiveDebounceLogger.processLog(this.logger, queueLog, {\n type,\n label,\n details,\n isInternalCoreSignal\n })\n }\n\n public signal<T>(initialValue: T, optionsOrName?: string | SignalOptions<T>): Signal<T> {\n return createSignal<T>(this, initialValue, optionsOrName)\n }\n\n public computed<T>(fn: () => T, signalName?: string): Computed<T> {\n // Просто делегируем вызов строго изолированной чистой функции\n return createComputed<T>(this, fn, signalName)\n }\n\n public effect(fn: () => void | CleanupFn, effectName?: string): () => void {\n return createEffect(this, fn, effectName)\n }\n\n public untrack<T>(fn: () => T): T {\n return executeUntrack<T>(this, fn)\n }\n\n public reactive<T extends object>(target: T, name?: string): T {\n return createReactive<T>(this, target, name)\n }\n\n public provide<T>(token: InjectionToken<T>, valueOrFactory: T | Factory<T>): void {\n this.diRegistry.set(token, valueOrFactory)\n this.diCache.delete(token)\n }\n\n public inject<T>(token: InjectionToken<T>): T {\n if (token === undefined || token === null) throw new Error('[DI Error] Token is empty')\n if (this.diCache.has(token)) return this.diCache.get(token) as T\n if (this.cycleDetectionStack.has(token)) throw new Error('[DI Error] Cyclic dependency detected')\n this.cycleDetectionStack.add(token)\n try {\n if (this.diRegistry.has(token)) {\n const entry = this.diRegistry.get(token)\n if (typeof entry === 'function') {\n if ((entry as any)._isMockFunction) {\n const mockRes = (entry as Function)(this)\n if (mockRes !== undefined) {\n this.diCache.set(token, mockRes)\n return mockRes as T\n }\n return entry as unknown as T\n }\n const str = entry.toString()\n const isClass = str.startsWith('class ') || str.startsWith('class{') || (entry.prototype && entry.prototype.constructor === entry && !str.startsWith('function') && !str.includes('=>'))\n if (!isClass) {\n const resolved = (entry as Factory<T>)(this)\n this.diCache.set(token, resolved)\n return resolved\n }\n return entry as unknown as T\n }\n return entry as T\n }\n if (typeof token === 'function') {\n const resolved = new (token as Constructor<T>)(this)\n this.diCache.set(token, resolved)\n return resolved\n }\n throw new Error('[DI Error] Token not found')\n } finally {\n this.cycleDetectionStack.delete(token)\n }\n }\n\n private delay(ms: number, signal: AbortSignal): Promise<void> {\n return new Promise((resolve, reject) => {\n if (signal.aborted) {\n return reject(new DOMException('Aborted', 'AbortError'))\n }\n\n const timeoutId = setTimeout(() => {\n signal.removeEventListener('abort', onAbort)\n resolve()\n }, ms)\n\n const onAbort = () => {\n clearTimeout(timeoutId)\n reject(new DOMException('Aborted', 'AbortError'))\n }\n\n signal.addEventListener('abort', onAbort, { once: true })\n })\n }\n\n public resource<T, S = void>(\n fetcher: (source: S, signal: AbortSignal) => Promise<T>,\n source?: { value: S },\n optionsOrName?: string | ResourceOptions<T, S>,\n ): Resource<T> {\n const isOptionsObject = optionsOrName && typeof optionsOrName === 'object'\n const resourceSignalName = isOptionsObject\n ? ((optionsOrName as ResourceOptions<T, S>).name || 'unnamed_resource')\n : (optionsOrName as string) || 'unnamed_resource'\n\n const options: Partial<ResourceOptions<T, S>> = isOptionsObject\n ? (optionsOrName as ResourceOptions<T, S>)\n : {}\n\n const resetDataOnSourceChange = options.resetDataOnSourceChange ?? true\n const responseValidate = options.responseValidate\n const validateBeforeFetch = options.validateBeforeFetch\n const retryCount = 0\n const baseDelay = 1000\n const useExponential = true\n const maxRetryDelay = 1000 * 60 * 5\n const timeoutMs = 1000\n const state = this.signal<ResourceState<T>>(\n { data: null, loading: true, error: null, isRetrying: false },\n `[CORE_INTERNAL_SIGNAL=1]:resource:state:${resourceSignalName}`\n )\n\n const updateResourceState = (nextState: ResourceState<T>) => {\n this.log({ type: 'resource', label: resourceSignalName, details: { to: nextState, from: state.value } })\n state.value = nextState\n }\n\n const load = async (sValue: S, effectSignal: AbortSignal, isSourceChange = false) => {\n if (effectSignal.aborted) return\n const isValid = options.validateBeforeFetch ? options.validateBeforeFetch(sValue) : true\n\n /**\n * 🧐 WIP_CORE: Есть два пути, ни один не будет ошибкой, если разкомментировать код ниже. Чуть бозже добавлю опци для более тонкой отладки ядра.\n *\n * - АКТИВНО: Разделяем мирную блокировку (false) и боевую ошибку (string): работать будет идеально, но без логов, связанных с пре-валидацией\n * - НЕАКТИВНО: Более очевидное логирование процессов пре-валидации (выставление ошибок и мониторинг разработчиком)\n */\n // --\n // if (isValid === false) {\n // // Если валидатор вернул строго false — мы тихо блокируем старт фетчера,\n // // переводя ресурс в состояние ПОКОЯ (loading: false, error: null).\n // // Это полностью ликвидирует генерацию ложных ошибок при монтировании!\n // state.value = {\n // loading: false,\n // data: null,\n // error: null, // Ошибки нет! Стейт стабилен.\n // isRetrying: false\n // }\n // return\n // }\n // if (typeof isValid === 'string') {\n // // Если валидатор вернул строку — это боевая декларативная ошибка валидации формы.\n // // Здесь мы честно переводим ресурс в стейт ошибки, как и требовалось ранее.\n // state.value = {\n // loading: false,\n // data: null,\n // error: 'Core internal stopper',\n // isRetrying: false\n // }\n // return\n // }\n // --\n if (validateBeforeFetch) {\n const preValidationResult = validateBeforeFetch(sValue)\n if (preValidationResult === false || typeof preValidationResult === 'string') {\n if (effectSignal.aborted) return\n const errorMsg = typeof preValidationResult === 'string'\n ? preValidationResult\n : 'Pre-fetch validation failed for resource'\n\n const currentData = isSourceChange ? null : this.untrack(() => state.value.data)\n updateResourceState({ data: currentData, loading: false, error: errorMsg, isRetrying: false })\n return\n }\n }\n const shouldClear = isSourceChange && resetDataOnSourceChange\n const currentData = shouldClear ? null : this.untrack(() => state.value.data)\n updateResourceState({ data: currentData, loading: true, error: null, isRetrying: false })\n for (let attempt = 0; attempt <= retryCount; attempt++) {\n if (effectSignal.aborted) return\n let combinedSignal = effectSignal\n try {\n const data = await fetcher(sValue, combinedSignal)\n if (effectSignal.aborted) return\n if (combinedSignal.aborted) {\n throw new DOMException('The operation timed out.', 'TimeoutError')\n }\n if (responseValidate) {\n const validationResult = responseValidate(data)\n if (validationResult === false || typeof validationResult === 'string') {\n if (effectSignal.aborted) return\n const errorMsg = typeof validationResult === 'string' ? validationResult : 'Validation failed'\n updateResourceState({ data: null, loading: false, error: errorMsg, isRetrying: false })\n return\n }\n }\n if (effectSignal.aborted) return\n updateResourceState({ data, loading: false, error: null, isRetrying: false })\n return\n } catch (e: unknown) {\n if (effectSignal.aborted || ((e as Error).name === 'AbortError' && effectSignal.aborted)) return\n const isTimeout = (e as Error).name === 'TimeoutError' || (e as Error).name === 'AbortError' || (e as Error).message?.includes('timeout')\n const isCustomValidationError = getExtractedValues({\n tested: [(e as Error).message], expectedKey: 'THROW_CUSTOM_VALIDATION_ERROR_NO_RETRY', valueType: 'number',\n })?.[0] === '1' || false\n const __defaultCustomValidationErrorMessage = 'Custom validation error'\n let customValidationErrorMessage: string = isCustomValidationError\n ? (getExtractedValues({\n tested: [(e as Error).message], expectedKey: 'MESSAGE', valueType: 'string',\n })?.[0] || __defaultCustomValidationErrorMessage)\n : __defaultCustomValidationErrorMessage\n const isFetchBodyValidationError = isCustomValidationError || (e as Error).name === 'ValidationError'\n if (attempt === retryCount || isFetchBodyValidationError) {\n if (effectSignal.aborted) return\n const finalError = isTimeout\n ? new Error(`Request timed out after ${timeoutMs}ms`, { cause: e })\n : isCustomValidationError\n ? new Error(customValidationErrorMessage, { cause: e })\n : e\n\n updateResourceState({\n data: null, loading: false,\n error: finalError instanceof Error ? finalError.message : typeof finalError === 'string' ? finalError : `typeof finalError is ${typeof finalError}`,\n isRetrying: false,\n })\n return\n } else {\n if (effectSignal.aborted) return\n let currentDelay = useExponential ? baseDelay * Math.pow(2, attempt) : baseDelay\n currentDelay = Math.min(currentDelay, maxRetryDelay)\n const jitter = Math.random() * 200\n currentDelay = currentDelay + jitter\n updateResourceState({ data: state.value.data, loading: true, error: null, isRetrying: true })\n const logReason = isTimeout ? 'таймауту' : 'ошибке сети'\n console.warn(`[Resource Retry] \"${resourceSignalName}\" сбой по ${logReason}. Попытка ${attempt + 1}/${retryCount > 0 ? retryCount + 1 : attempt + 1}...`)\n\n try {\n await this.delay(currentDelay, effectSignal)\n if (effectSignal.aborted) return\n } catch (delayError) {\n return\n }\n }\n }\n }\n }\n\n let activeEffectController: AbortController | null = null\n\n this.effect(() => {\n const sValue = source ? source.value : undefined as S\n const effectController = new AbortController()\n activeEffectController = effectController\n\n this.untrack(() => {\n load(sValue as S, effectController.signal, true)\n })\n\n return () => effectController.abort()\n }, '[CORE_INTERNAL_SIGNAL=1]:effect')\n\n return {\n get data() { return state.value.data },\n get loading() { return state.value.loading },\n get error() { return state.value.error },\n get isRetrying() { return state.value.isRetrying },\n get value() { return state.value },\n refetch: () => {\n activeEffectController?.abort()\n activeEffectController = new AbortController()\n load(source ? source.value : undefined as S, activeEffectController.signal, false)\n },\n subscribe: (cb: (val: ResourceState<T>) => void) => state.subscribe(cb)\n }\n }\n}\n\nexport { ReactiveEngineCore as ReactiveEngine, ReactiveEngineCore as ReactiveEngineAutomatic }\n"],"mappings":"oRAiBA,IAAM,EAA4C,CAChD,OAAQ,6FACR,SAAU,6FACV,OAAQ,6FACR,MAAO,6FACP,SAAU,6FACV,SAAU,4FACZ,EACI,EAAgD,KACpD,SAAS,EAAkB,EAAwB,CACjD,GAAI,IAAU,KAAM,MAAO,OAC3B,GAAI,IAAU,IAAA,GAAW,MAAO,YAChC,GAAI,OAAO,GAAU,SACnB,GAAI,CACF,OAAO,KAAK,UAAU,CAAK,CAC7B,MAAY,CACV,MAAO,0BACT,CAEF,OAAO,OAAO,CAAK,CACrB,CACA,SAAgB,EAAS,EAAoB,EAAe,EAAqE,CAC1H,IACH,EAAqB,CAAE,GAAI,KAAK,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,UAAU,EAAG,CAAC,EAAG,gBAAiB,CAAC,EAAG,WAAY,EAAM,EAC9G,mBAAqB,EAAU,CAAC,GAElC,EAAmB,gBAAgB,KAAK,CAAE,OAAM,QAAO,KAAM,GAAS,KAAM,GAAI,GAAS,GAAI,QAAS,GAAS,QAAS,UAAW,KAAK,IAAI,CAAE,CAAC,CACjJ,CACA,SAAgB,GAAkB,CAChC,GAAI,CAAC,GAAsB,EAAmB,WAAY,OAC1D,EAAmB,WAAa,GAChC,IAAM,EAAQ,EAAmB,gBACjC,GAAI,EAAM,SAAW,EAAG,CACtB,EAAqB,KACrB,MACF,CACA,QAAQ,eAAe,iCAAiC,EAAmB,GAAG,KAAK,EAAM,OAAO,cAAe,6FAA8F,mCAAmC,EAChP,IAAK,IAAM,KAAU,EAAO,CAC1B,IAAM,EAAa,EAAY,EAAO,MAChC,EAAgB,EAAO,OAAS,IAAA,IAAa,EAAO,KAAO,IAAA,GAC7D,EAAa,KAAK,EAAO,KAAK,YAAY,EAAE,KAAK,EAAO,QAExD,IACI,EAAO,KACX,GAAc,IAAI,EAAkB,EAAO,IAAI,EAAE,KAAK,EAAkB,EAAO,EAAE,IAC9E,GAAc,KAAK,EAAkB,EAAO,EAAE,EAAE,IAGnD,EAAO,UAAY,IAAA,GAKrB,QAAQ,IAAI,EAAY,EAAY,iBAAiB,GAJrD,QAAQ,eAAe,EAAY,EAAY,iBAAiB,EAChE,QAAQ,IAAI,WAAY,EAAO,OAAO,EACtC,QAAQ,SAAS,EAIrB,CACA,QAAQ,SAAS,EACjB,EAAqB,IACvB,CACA,IAAa,EAAb,KAAgC,CAC9B,gBAA4B,OAC5B,OACA,MAAe,EACf,eAA6B,KAC7B,WAAoB,EACpB,aAAsB,EACtB,eAAwB,IAAI,IAC5B,cAAuB,IAAI,IAC3B,WAAqB,IAAI,IACzB,QAAkB,IAAI,IACtB,WAAqB,IAAI,QACzB,aAAuB,IAAI,QAC3B,gBAA0B,IAAI,QAC9B,oBAA8B,IAAI,IAClC,eAAwB,IAAI,IAC5B,YAA0B,KAE1B,YAAY,EAA4C,CACtD,KAAK,OAAS,GAAS,QAAU,CAAE,UAAW,EAAM,CACtD,CAEA,SAAgB,EAAoB,EAAe,EAAqE,CACtH,EAAS,EAAM,EAAO,CAAO,CAC/B,CAEA,MAAgB,EAAgB,CAC9B,KAAK,aACL,GAAI,CACF,OAAO,EAAG,CACZ,QAAU,CAER,GADA,KAAK,aACD,KAAK,aAAe,EAAG,CACzB,IAAM,EAAiB,MAAM,KAAK,KAAK,cAAc,EACrD,KAAK,eAAe,MAAM,EAE1B,EAAe,QAAQ,GAAO,CACxB,EAAI,aAAa,EAAI,YAAY,CACvC,CAAC,EAED,KAAK,aAAa,CACpB,CACF,CACF,CAEA,cAA4B,CAC1B,GAAI,KAAK,WAAa,EAAG,OAEzB,IAAM,EAAU,MAAM,KAAK,KAAK,cAAc,EAC9C,KAAK,eAAe,MAAM,EAG1B,EAAQ,MAAM,EAAG,KAAO,EAAE,OAAS,IAAM,EAAE,OAAS,IAAM,EAAE,GAAK,EAAE,EAAE,EAErE,IAAM,EAAe,KAAK,eAE1B,GAAI,CACF,IAAK,IAAM,KAAU,EACf,MAAO,WAGX,IAAI,EAAO,cAAgB,EAAO,aAAa,KAAO,EAAG,CACvD,IAAI,EAAgB,GACpB,IAAK,IAAM,KAAO,EAAO,aAAc,CACrC,IAAM,EAAU,EAAI,OAAS,EACzB,EAAQ,OAAS,YAAc,EAAQ,MAAQ,GAC7C,EAAQ,QAAQ,EAAQ,OAAO,EAEjC,EAAO,aAAe,EAAO,YAAY,IAAI,CAAG,IAAM,EAAQ,UAChE,EAAgB,GAEpB,CACA,GAAI,CAAC,GAAiB,EAAO,aAAa,KAAO,EAAG,CAClD,EAAO,QAAU,GACjB,QACF,CACF,CAEK,KAAO,QAEZ,GAAI,CACF,EAAO,IAAI,CACb,OAAS,EAAK,CACZ,MAAM,CACR,CARA,CAUJ,QAAU,CACR,KAAK,eAAiB,CACxB,CACF,CAMA,IAAa,CAAE,OAAM,QAAO,UAAS,uBAAuB,IAA+I,CACzM,EAAA,uBAAuB,WAAW,KAAK,OAAQ,EAAU,CACvD,OACA,QACA,UACA,sBACF,CAAC,CACH,CAEA,OAAiB,EAAiB,EAAsD,CACtF,OAAO,EAAA,aAAgB,KAAM,EAAc,CAAa,CAC1D,CAEA,SAAmB,EAAa,EAAkC,CAEhE,OAAO,EAAA,eAAkB,KAAM,EAAI,CAAU,CAC/C,CAEA,OAAc,EAA4B,EAAiC,CACzE,OAAO,EAAA,aAAa,KAAM,EAAI,CAAU,CAC1C,CAEA,QAAkB,EAAgB,CAChC,OAAO,EAAA,eAAkB,KAAM,CAAE,CACnC,CAEA,SAAkC,EAAW,EAAkB,CAC7D,OAAO,EAAA,eAAkB,KAAM,EAAQ,CAAI,CAC7C,CAEA,QAAkB,EAA0B,EAAsC,CAChF,KAAK,WAAW,IAAI,EAAO,CAAc,EACzC,KAAK,QAAQ,OAAO,CAAK,CAC3B,CAEA,OAAiB,EAA6B,CAC5C,GAAI,GAAiC,KAAM,MAAU,MAAM,2BAA2B,EACtF,GAAI,KAAK,QAAQ,IAAI,CAAK,EAAG,OAAO,KAAK,QAAQ,IAAI,CAAK,EAC1D,GAAI,KAAK,oBAAoB,IAAI,CAAK,EAAG,MAAU,MAAM,uCAAuC,EAChG,KAAK,oBAAoB,IAAI,CAAK,EAClC,GAAI,CACF,GAAI,KAAK,WAAW,IAAI,CAAK,EAAG,CAC9B,IAAM,EAAQ,KAAK,WAAW,IAAI,CAAK,EACvC,GAAI,OAAO,GAAU,WAAY,CAC/B,GAAK,EAAc,gBAAiB,CAClC,IAAM,EAAW,EAAmB,IAAI,EAKxC,OAJI,IAAY,IAAA,GAIT,GAHL,KAAK,QAAQ,IAAI,EAAO,CAAO,EACxB,EAGX,CACA,IAAM,EAAM,EAAM,SAAS,EAE3B,GAAI,EADY,EAAI,WAAW,QAAQ,GAAK,EAAI,WAAW,QAAQ,GAAM,EAAM,WAAa,EAAM,UAAU,cAAgB,GAAS,CAAC,EAAI,WAAW,UAAU,GAAK,CAAC,EAAI,SAAS,IAAI,GACxK,CACZ,IAAM,EAAY,EAAqB,IAAI,EAE3C,OADA,KAAK,QAAQ,IAAI,EAAO,CAAQ,EACzB,CACT,CACA,OAAO,CACT,CACA,OAAO,CACT,CACA,GAAI,OAAO,GAAU,WAAY,CAC/B,IAAM,EAAW,IAAK,EAAyB,IAAI,EAEnD,OADA,KAAK,QAAQ,IAAI,EAAO,CAAQ,EACzB,CACT,CACA,MAAU,MAAM,4BAA4B,CAC9C,QAAU,CACR,KAAK,oBAAoB,OAAO,CAAK,CACvC,CACF,CAEA,MAAc,EAAY,EAAoC,CAC5D,OAAO,IAAI,SAAS,EAAS,IAAW,CACtC,GAAI,EAAO,QACT,OAAO,EAAO,IAAI,aAAa,UAAW,YAAY,CAAC,EAGzD,IAAM,EAAY,eAAiB,CACjC,EAAO,oBAAoB,QAAS,CAAO,EAC3C,EAAQ,CACV,EAAG,CAAE,EAEC,MAAgB,CACpB,aAAa,CAAS,EACtB,EAAO,IAAI,aAAa,UAAW,YAAY,CAAC,CAClD,EAEA,EAAO,iBAAiB,QAAS,EAAS,CAAE,KAAM,EAAK,CAAC,CAC1D,CAAC,CACH,CAEA,SACE,EACA,EACA,EACa,CACb,IAAM,EAAkB,GAAiB,OAAO,GAAkB,SAC5D,EAAqB,EACrB,EAAwC,MAAQ,mBACjD,GAA4B,mBAE3B,EAA0C,EAC3C,EACD,CAAC,EAEC,EAA0B,EAAQ,yBAA2B,GAC7D,EAAmB,EAAQ,iBAC3B,EAAsB,EAAQ,oBAM9B,EAAQ,KAAK,OACjB,CAAE,KAAM,KAAM,QAAS,GAAM,MAAO,KAAM,WAAY,EAAM,EAC5D,2CAA2C,GAC7C,EAEM,EAAuB,GAAgC,CAC3D,KAAK,IAAI,CAAE,KAAM,WAAY,MAAO,EAAoB,QAAS,CAAE,GAAI,EAAW,KAAM,EAAM,KAAM,CAAE,CAAC,EACvG,EAAM,MAAQ,CAChB,EAEM,EAAO,MAAO,EAAW,EAA2B,EAAiB,KAAU,CACnF,GAAI,EAAa,QAAS,OAkC1B,GAjCgB,EAAQ,qBAAsB,EAAQ,oBAAoB,CAAM,EAiC5E,EAAqB,CACvB,IAAM,EAAsB,EAAoB,CAAM,EACtD,GAAI,IAAwB,IAAS,OAAO,GAAwB,SAAU,CAC5E,GAAI,EAAa,QAAS,OAC1B,IAAM,EAAW,OAAO,GAAwB,SAC5C,EACA,2CAEE,EAAc,EAAiB,KAAO,KAAK,YAAc,EAAM,MAAM,IAAI,EAC/E,EAAoB,CAAE,KAAM,EAAa,QAAS,GAAO,MAAO,EAAU,WAAY,EAAM,CAAC,EAC7F,MACF,CACF,CAEA,IAAM,EADc,GAAkB,EACJ,KAAO,KAAK,YAAc,EAAM,MAAM,IAAI,EAC5E,EAAoB,CAAE,KAAM,EAAa,QAAS,GAAM,MAAO,KAAM,WAAY,EAAM,CAAC,EACxF,IAAK,IAAI,EAAU,EAAG,GAAW,EAAY,IAAW,CACtD,GAAI,EAAa,QAAS,OAC1B,IAAI,EAAiB,EACrB,GAAI,CACF,IAAM,EAAO,MAAM,EAAQ,EAAQ,CAAc,EACjD,GAAI,EAAa,QAAS,OAC1B,GAAI,EAAe,QACjB,MAAM,IAAI,aAAa,2BAA4B,cAAc,EAEnE,GAAI,EAAkB,CACpB,IAAM,EAAmB,EAAiB,CAAI,EAC9C,GAAI,IAAqB,IAAS,OAAO,GAAqB,SAAU,CACtE,GAAI,EAAa,QAAS,OAE1B,EAAoB,CAAE,KAAM,KAAM,QAAS,GAAO,MADjC,OAAO,GAAqB,SAAW,EAAmB,oBACR,WAAY,EAAM,CAAC,EACtF,MACF,CACF,CACA,GAAI,EAAa,QAAS,OAC1B,EAAoB,CAAE,OAAM,QAAS,GAAO,MAAO,KAAM,WAAY,EAAM,CAAC,EAC5E,MACF,OAAS,EAAY,CACnB,GAAI,EAAa,SAAa,EAAY,OAAS,cAAgB,EAAa,QAAU,OAC1F,IAAM,EAAa,EAAY,OAAS,gBAAmB,EAAY,OAAS,cAAiB,EAAY,SAAS,SAAS,SAAS,EAClI,EAA0B,EAAA,mBAAmB,CACjD,OAAQ,CAAE,EAAY,OAAO,EAAG,YAAa,yCAA0C,UAAW,QACpG,CAAC,CAAC,GAAG,KAAO,KAAO,GAEf,EAAuC,GACtC,EAAA,mBAAmB,CACpB,OAAQ,CAAE,EAAY,OAAO,EAAG,YAAa,UAAW,UAAW,QACrE,CAAC,CAAC,GAAG,IACH,0BACE,EAA6B,GAA4B,EAAY,OAAS,kBACpF,GAAI,IAAY,GAAc,EAA4B,CACxD,GAAI,EAAa,QAAS,OAC1B,IAAM,EAAa,EACX,MAAM,iCAA0C,CAAE,MAAO,CAAE,CAAC,EAChE,EACM,MAAM,EAA8B,CAAE,MAAO,CAAE,CAAC,EACpD,EAEN,EAAoB,CAClB,KAAM,KAAM,QAAS,GACrB,MAAO,aAAsB,MAAQ,EAAW,QAAU,OAAO,GAAe,SAAW,EAAa,wBAAwB,OAAO,IACvI,WAAY,EACd,CAAC,EACD,MACF,KAAO,CACL,GAAI,EAAa,QAAS,OAC1B,IAAI,EAAgC,IAAqB,GAAG,EAC5D,EAAe,KAAK,IAAI,EAAc,GAAa,EACnD,IAAM,EAAS,KAAK,OAAO,EAAI,IAC/B,GAA8B,EAC9B,EAAoB,CAAE,KAAM,EAAM,MAAM,KAAM,QAAS,GAAM,MAAO,KAAM,WAAY,EAAK,CAAC,EAE5F,QAAQ,KAAK,qBAAqB,EAAmB,YADnC,EAAY,WAAa,cACgC,YAAY,EAAU,EAAE,GAAqC,EAAU,EAAE,IAAI,EAExJ,GAAI,CAEF,GADA,MAAM,KAAK,MAAM,EAAc,CAAY,EACvC,EAAa,QAAS,MAC5B,MAAqB,CACnB,MACF,CACF,CACF,CACF,CACF,EAEI,EAAiD,KAcrD,OAZA,KAAK,WAAa,CAChB,IAAM,EAAS,EAAS,EAAO,MAAQ,IAAA,GACjC,EAAmB,IAAI,gBAO7B,MANA,GAAyB,EAEzB,KAAK,YAAc,CACjB,EAAK,EAAa,EAAiB,OAAQ,EAAI,CACjD,CAAC,MAEY,EAAiB,MAAM,CACtC,EAAG,iCAAiC,EAE7B,CACL,IAAI,MAAO,CAAE,OAAO,EAAM,MAAM,IAAK,EACrC,IAAI,SAAU,CAAE,OAAO,EAAM,MAAM,OAAQ,EAC3C,IAAI,OAAQ,CAAE,OAAO,EAAM,MAAM,KAAM,EACvC,IAAI,YAAa,CAAE,OAAO,EAAM,MAAM,UAAW,EACjD,IAAI,OAAQ,CAAE,OAAO,EAAM,KAAM,EACjC,YAAe,CACb,GAAwB,MAAM,EAC9B,EAAyB,IAAI,gBAC7B,EAAK,EAAS,EAAO,MAAQ,IAAA,GAAgB,EAAuB,OAAQ,EAAK,CACnF,EACA,UAAY,GAAwC,EAAM,UAAU,CAAE,CACxE,CACF,CACF"}
@@ -1,2 +1,2 @@
1
- function e(e,t,n){let r=e.computedCache.get(t)?.deref();if(r)return r;let i,a=!0,o=0,s=!1,c=2,l=new Set,u=new Map,d=e=>{if(!e)return;let t=e._node||e;if(t.dependencies&&t.dependencies.size>0){let n=Array.from(t.dependencies);t.dependencies.clear(),t.depVersions&&t.depVersions.clear(),n.forEach(n=>{let r=n._node||n;r.subscribers&&(r.subscribers.delete(t),r.subscribers.delete(e),r.subscribers.delete(m),r.type===`computed`&&r.subscribers.size===0&&d(r))})}},f=new class extends Set{delete(n){let r=super.delete(n);return this.size===0&&(c=2,a=!0,e.computedCache.delete(t)),r}},p=e=>{if(!s||e.state===2)return e.run();if(e.state===1){let t=!1;for(let n of Array.from(e.dependencies)){let r=n._node||n;if(r.type===`computed`&&r.state>0&&p(r),e.depVersions.get(n)!==r.version){t=!0;break}}return e.state=0,t||a?e.run():!1}return!1},m={id:e.subscriberId++,dependencies:l,subscribers:f,depth:1,type:`computed`,fn:t,get version(){return o},get state(){return c},set state(e){c=e},get depVersions(){return u},update:()=>p(m),run:()=>{if(e.cycleDetectionStack.has(m))throw Error(`[Graph Error] Cyclic dependency detected`);e.cycleDetectionStack.add(m);let r=e.activeConsumer;e.activeConsumer=m;let d=new Set(l);l.clear();try{let r=t();d.forEach(e=>{if(!l.has(e)){let t=e._node||e;t.subscribers&&t.subscribers.delete(m),u.delete(e)}});let p=a||!Object.is(i,r);if(p){let s=a?void 0:typeof i==`object`&&i?JSON.parse(JSON.stringify(i)):i;i=r,o++,e.log&&e.log({type:`computed`,label:n||`computed:[${t.name||m.id}]`,details:{from:s,to:r}}),f.forEach(t=>{let n=t._node||t;n.type===`effect`?(n.state=2,n.isDirty=!0,e.pendingEffects.add(t)):n.markDirty&&n.markDirty(1)})}a=!1,c=0,s=!0;let g=0;return l.forEach(e=>{let t=e._node||e;u.set(e,t.version),t.depth!==void 0&&t.depth>g&&(g=t.depth)}),f.forEach(e=>{let t=e._node||e;t.depVersions&&t.depVersions.set(h,o)}),m.depth=g+1,p}finally{e.activeConsumer=r,e.cycleDetectionStack.delete(m)}},markDirty:t=>{c>=t||(c=t,f.forEach(t=>{let n=t._node||t;n.type===`effect`&&(n.isDirty=!0,e.pendingEffects.add(t)),n.markDirty&&n.markDirty(1)}))}},h={get value(){return e.activeConsumer&&e.activeConsumer!==m&&(m.subscribers.add(e.activeConsumer),e.activeConsumer.dependencies.add(m)),p(m),e.activeConsumer&&e.activeConsumer.depVersions&&e.activeConsumer.depVersions.set(h,o),i},get valueWithoutTracking(){return i},get version(){return o},subscribe(t){let n={id:e.subscriberId++,isDirty:!0,depth:9999,dependencies:new Set,type:`effect`,run:()=>{if(!n.isDisposed)try{t(h.value)}catch(e){console.error(e)}}};return m.subscribers.add(n),t(h.value),()=>{n.isDisposed=!0,m.subscribers.delete(n)}},subscribeState(e){return h.subscribe(e)},destroy:()=>{m.subscribers.clear(),d(m),e.computedCache.delete(t),a=!0,c=2,s=!1},__subscribe(t){let n={id:e.subscriberId++,type:`effect`,run:t,isDirty:!1};return m.subscribers.add(n),()=>{f.delete(n)}}};return h._node=m,h.subscribers=f,h.dependencies=l,h._isDirty=()=>c>0,h.type=`computed`,h.run=()=>m.run(),e.computedCache.set(t,new WeakRef(h)),h}exports.createComputed=e;
1
+ function e(e,t,n){let r=e.computedCache.get(t)?.deref();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=e=>{if(!e)return;let t=e._node||e;if(t.dependencies&&t.dependencies.size>0){let n=Array.from(t.dependencies);t.dependencies.clear(),t.depVersions&&t.depVersions.clear(),n.forEach(n=>{let r=n._node||n;r.subscribers&&(r.subscribers.delete(t),r.subscribers.delete(e),r.subscribers.delete(g),r.type===`computed`&&r.subscribers.size===0&&p(r))})}},m=new class extends Set{delete(n){let r=super.delete(n);return this.size===0&&(l=2,a=!0,s=!1,p(g),e.computedCache.delete(t)),r}},h=e=>{if(!s||e.state===2)return e.run();if(e.state===1){let t=!1,n=-1,r=Array.from(e.dependencies||[]);for(let i=0;i<r.length;i++){let a=r[i],o=a._node||a;if(o.type===`computed`&&o.state>0&&h(o),e.depVersions.get(a)!==o.version){t=!0,n=i;break}}if(n!==-1)for(let e=n+1;e<r.length;e++){let t=r[e],n=t._node||t;n.type===`computed`&&n.state===1&&(n.state=0)}return e.state=0,t||a?e.run():!1}return!1},g={id:e.subscriberId++,dependencies:u,subscribers:m,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},update:()=>h(g),run:()=>{if(c===e.epoch&&s)return!1;if(c=e.epoch,e.cycleDetectionStack.has(g))throw Error(`[Graph Error] Cyclic dependency detected`);e.cycleDetectionStack.add(g);let r=e.activeConsumer,p=e.activeOwner;e.activeConsumer=g,e.activeOwner=g;let h=new Set(u);u.clear();try{f.forEach(e=>{e.dispose&&e.dispose()}),f.clear();let r=t();h.forEach(e=>{if(!u.has(e)){let t=e._node||e;t.subscribers&&t.subscribers.delete(g),d.delete(e)}});let c=a||!Object.is(i,r);if(c){let t=a?void 0:typeof i==`object`&&i?JSON.parse(JSON.stringify(i)):i;i=r,o++,e.log&&n&&e.log({type:`computed`,label:n,details:{from:t,to:r}}),m.forEach(t=>{let n=t._node||t;n.type===`effect`?(n.state=2,n.isDirty=!0,e.pendingEffects.add(t)):n.markDirty&&n.markDirty(1)})}a=!1,l=0,s=!0;let p=0;return u.forEach(e=>{let t=e._node||e;d.set(e,t.version),t.subscribers&&t.subscribers.add(g),t.depth!==void 0&&t.depth>p&&(p=t.depth)}),m.forEach(e=>{let t=e._node||e;t.depVersions&&t.depVersions.set(_,o)}),g.depth=p+1,c}finally{e.activeConsumer=r,e.activeOwner=p,e.cycleDetectionStack.delete(g)}},markDirty:t=>{l>=t||(l=t,m.forEach(t=>{let n=t._node||t;n.type===`effect`?(n.isDirty=!0,e.pendingEffects.add(t)):n.markDirty&&n.markDirty(1)}))}},_={get value(){return e.activeConsumer&&e.activeConsumer!==g&&(g.subscribers.add(e.activeConsumer),e.activeConsumer.dependencies.add(g)),h(g),e.activeConsumer&&e.activeConsumer.depVersions&&e.activeConsumer.depVersions.set(_,o),i},get valueWithoutTracking(){return i},get version(){return o},subscribe(t){let n={id:e.subscriberId++,isDirty:!0,depth:9999,dependencies:new Set,type:`effect`,run:()=>{if(!n.isDisposed)try{t(_.value)}catch(e){console.error(e)}}};return g.subscribers.add(n),t(_.value),()=>{n.isDisposed=!0,g.subscribers.delete(n)}},subscribeState(e){return _.subscribe(e)},destroy:()=>{g.subscribers.clear(),p(g),e.computedCache.delete(t),a=!0,l=2,s=!1},__subscribe(t){let n={id:e.subscriberId++,type:`effect`,run:t,isDirty:!1};return g.subscribers.add(n),()=>{m.delete(n)}}};return _._node=g,_.subscribers=m,_.dependencies=u,_._isDirty=()=>l>0,_.type=`computed`,_.run=()=>g.run(),e.computedCache.set(t,new WeakRef(_)),_}exports.createComputed=e;
2
2
  //# sourceMappingURL=core.method.computed.cjs.map
@@ -1 +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 const cachedRef = engine.computedCache.get(fn)\n const existing = cachedRef?.deref()\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\n // 0 = STABLE, 1 = CHECK, 2 = DIRTY\n let state = 2\n\n const dependencies = new Set<any>()\n const depVersions = new Map<any, number>()\n\n const releaseNode = (node: any): void => {\n if (!node) return\n const actNode = node._node || node\n if (actNode.dependencies && actNode.dependencies.size > 0) {\n const snapshotDeps = Array.from(actNode.dependencies)\n actNode.dependencies.clear()\n if (actNode.depVersions) actNode.depVersions.clear()\n\n snapshotDeps.forEach((dep: any) => {\n const rawDepNode = dep._node || dep\n if (rawDepNode.subscribers) {\n rawDepNode.subscribers.delete(actNode)\n rawDepNode.subscribers.delete(node)\n rawDepNode.subscribers.delete(computedNode)\n if (rawDepNode.type === 'computed' && rawDepNode.subscribers.size === 0) {\n releaseNode(rawDepNode)\n }\n }\n })\n }\n }\n\n const subscribers = new class extends Set<any> {\n override delete(val: any): boolean {\n const res = super.delete(val)\n // ⚛️ СТРИКТМОД-ЗАЩИТА СВЯЗЕЙ ГРАФА:\n // Мы убираем отсюда моментальный вызов releaseNode(computedNode) при size === 0!\n // Если StrictMode временно отписывает хук во время перемонтажа,\n // связи с родительскими сигналами НЕ должны выжигаться из памяти.\n // Граф сохраняет целостность, а полная зачистка происходит строго при вызове .destroy().\n if (this.size === 0) {\n state = 2\n isDirty = true\n engine.computedCache.delete(fn)\n }\n return res\n }\n }()\n\n // ⚡ КАНOНИЧЕСКИЙ АПДЕЙТЕР ГРАФА С АВТOМАТИЧЕСКИМ ПРЕPЫВАНИЕМ (Pull)\n const updateIfNecessary = (node: any): boolean => {\n // 1. Холодный старт\n if (!isInitialized) {\n return node.run()\n }\n\n // 2. Если прилетел прямой dirty-флаг от сигнала — вычисляем сразу\n if (node.state === 2) {\n return node.run()\n }\n\n // 3. Фаза ленивой проверки CHECK (1)\n if (node.state === 1) {\n let hasChangedParent = false\n\n // Опрашиваем родителей СТРОГО по одному, последовательно!\n for (const dep of Array.from(node.dependencies)) {\n const rawDep = (dep as any)._node || dep\n\n if (rawDep.type === 'computed' && rawDep.state > 0) {\n updateIfNecessary(rawDep)\n }\n\n if (node.depVersions.get(dep) !== rawDep.version) {\n hasChangedParent = true\n // 🎯 VALUE EQUALITY BREAK: Родоначальник ветки изменился!\n // Прерываем опрос оставшихся родителей, чтобы не дергать мёртвые ветки (узел c)\n break\n }\n }\n\n node.state = 0\n\n if (hasChangedParent || isDirty) {\n return node.run()\n }\n\n return false // Value Equality Cut\n }\n\n return false\n }\n\n const computedNode: any = {\n id: engine.subscriberId++,\n dependencies,\n subscribers,\n depth: 1,\n type: 'computed',\n fn,\n get version() { return version },\n get state() { return state },\n set state(val: number) { state = val },\n get depVersions() { return depVersions },\n update: () => {\n return updateIfNecessary(computedNode)\n },\n run: () => {\n if (engine.cycleDetectionStack.has(computedNode)) throw new Error('[Graph Error] Cyclic dependency detected')\n engine.cycleDetectionStack.add(computedNode)\n\n const prevConsumer = engine.activeConsumer\n engine.activeConsumer = computedNode\n\n // 🎯 ЧЕСТНЫЙ DIFF ЗАВИСИМОСТЕЙ БЕЗ ВСЛЕПУЮ ОЧИСТКИ (Канонический Паттерн)\n // Сохраняем слепок старых зависимостей, не удаляя их из подписчиков родителей раньше времени!\n const oldDeps = new Set(dependencies)\n dependencies.clear()\n\n try {\n const newValue = fn()\n\n // Отписываемся ТОЛЬКО от тех старых зависимостей, которые не нарисовались в новом запуске fn()\n oldDeps.forEach(dep => {\n if (!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) {\n engine.log({\n type: 'computed',\n label: signalName || `computed:[${fn.name || computedNode.id}]`,\n details: { from: previousValueSnapshot, to: newValue }\n })\n }\n\n subscribers.forEach(sub => {\n const rawSub = sub._node || sub\n if (rawSub.type === 'effect') {\n rawSub.state = 2 // Эффекты переводим в DIRTY\n rawSub.isDirty = true\n engine.pendingEffects.add(sub)\n } else {\n if (rawSub.markDirty) rawSub.markDirty(1) // computed переводят потомков в CHECK (1)\n }\n })\n }\n\n isDirty = false\n state = 0\n isInitialized = true\n\n let maxDepDepth = 0\n dependencies.forEach(dep => {\n const rawNode = dep._node || dep\n depVersions.set(dep, rawNode.version)\n if (rawNode.depth !== undefined && rawNode.depth > maxDepDepth) maxDepDepth = rawNode.depth\n })\n\n // Синхронизация слепков версий подписчиков\n subscribers.forEach(sub => {\n const rawSub = sub._node || sub\n if (rawSub.depVersions) {\n rawSub.depVersions.set(computedInstance, version)\n }\n })\n\n computedNode.depth = maxDepDepth + 1\n return changed\n } finally {\n engine.activeConsumer = prevConsumer\n engine.cycleDetectionStack.delete(computedNode)\n }\n },\n markDirty: (parentState: number) => {\n if (state >= parentState) return\n\n state = parentState\n\n subscribers.forEach(sub => {\n const rawSub = sub._node || sub\n if (rawSub.type === 'effect') {\n rawSub.isDirty = true\n engine.pendingEffects.add(sub)\n }\n if (rawSub.markDirty) {\n rawSub.markDirty(1)\n }\n })\n }\n }\n\n const computedInstance: Computed<T> = {\n get value() {\n // Регистрируем зависимость, если этот computed считывается внутри другого computed или эффекта\n if (engine.activeConsumer && engine.activeConsumer !== computedNode) {\n computedNode.subscribers.add(engine.activeConsumer)\n engine.activeConsumer.dependencies.add(computedNode)\n }\n\n // Атомарно запускаем pull-алгоритм ленивой проверки версий родителей\n updateIfNecessary(computedNode)\n\n // Синхронизируем числовой слепок версии для активного консьюмера\n if (engine.activeConsumer && engine.activeConsumer.depVersions) {\n engine.activeConsumer.depVersions.set(computedInstance, version)\n }\n\n // Железобетонно отдаем закэшированное значение без фантомных перезапусков!\n return value\n },\n get valueWithoutTracking() { return value },\n get version() { return version },\n subscribe(cb: (val: T) => void): CleanupFn {\n const fakeEffect: any = {\n id: engine.subscriberId++,\n isDirty: true,\n depth: 9999,\n dependencies: new Set(),\n type: 'effect',\n run: () => {\n if (fakeEffect.isDisposed) return\n try { cb(computedInstance.value) } catch (err) { console.error(err) }\n }\n }\n computedNode.subscribers.add(fakeEffect)\n cb(computedInstance.value)\n return () => {\n fakeEffect.isDisposed = true\n computedNode.subscribers.delete(fakeEffect)\n }\n },\n subscribeState(cb: () => void): CleanupFn {\n return (computedInstance as any).subscribe(cb)\n },\n destroy: () => {\n computedNode.subscribers.clear()\n releaseNode(computedNode)\n engine.computedCache.delete(fn)\n isDirty = true\n state = 2\n isInitialized = false\n },\n __subscribe(cb: () => void): CleanupFn {\n const hookEffect: any = {\n id: engine.subscriberId++,\n type: 'effect',\n run: cb,\n isDirty: false\n }\n computedNode.subscribers.add(hookEffect)\n return () => {\n subscribers.delete(hookEffect)\n }\n }\n } as any\n\n ;(computedInstance as any)._node = computedNode\n ;(computedInstance as any).subscribers = subscribers\n ;(computedInstance as any).dependencies = dependencies\n computedInstance._isDirty = () => state > 0\n computedInstance.type = 'computed'\n computedInstance.run = () => computedNode.run()\n\n engine.computedCache.set(fn, new WeakRef(computedInstance as any))\n return computedInstance\n}\n"],"mappings":"AAEA,SAAgB,EACd,EACA,EACA,EACa,CAEb,IAAM,EADY,EAAO,cAAc,IAAI,CAC1B,CAAA,EAAW,MAAM,EAClC,GAAI,EAAU,OAAO,EAErB,IAAI,EACA,EAAU,GACV,EAAU,EACV,EAAgB,GAGhB,EAAQ,EAEN,EAAe,IAAI,IACnB,EAAc,IAAI,IAElB,EAAe,GAAoB,CACvC,GAAI,CAAC,EAAM,OACX,IAAM,EAAU,EAAK,OAAS,EAC9B,GAAI,EAAQ,cAAgB,EAAQ,aAAa,KAAO,EAAG,CACzD,IAAM,EAAe,MAAM,KAAK,EAAQ,YAAY,EACpD,EAAQ,aAAa,MAAM,EACvB,EAAQ,aAAa,EAAQ,YAAY,MAAM,EAEnD,EAAa,QAAS,GAAa,CACjC,IAAM,EAAa,EAAI,OAAS,EAC5B,EAAW,cACb,EAAW,YAAY,OAAO,CAAO,EACrC,EAAW,YAAY,OAAO,CAAI,EAClC,EAAW,YAAY,OAAO,CAAY,EACtC,EAAW,OAAS,YAAc,EAAW,YAAY,OAAS,GACpE,EAAY,CAAU,EAG5B,CAAC,CACH,CACF,EAEM,EAAc,IAAI,cAAc,GAAS,CAC7C,OAAgB,EAAmB,CACjC,IAAM,EAAM,MAAM,OAAO,CAAG,EAW5B,OALI,KAAK,OAAS,IAChB,EAAQ,EACR,EAAU,GACV,EAAO,cAAc,OAAO,CAAE,GAEzB,CACT,CACF,EAGM,EAAqB,GAAuB,CAOhD,GALI,CAAC,GAKD,EAAK,QAAU,EACjB,OAAO,EAAK,IAAI,EAIlB,GAAI,EAAK,QAAU,EAAG,CACpB,IAAI,EAAmB,GAGvB,IAAK,IAAM,KAAO,MAAM,KAAK,EAAK,YAAY,EAAG,CAC/C,IAAM,EAAU,EAAY,OAAS,EAMrC,GAJI,EAAO,OAAS,YAAc,EAAO,MAAQ,GAC/C,EAAkB,CAAM,EAGtB,EAAK,YAAY,IAAI,CAAG,IAAM,EAAO,QAAS,CAChD,EAAmB,GAGnB,KACF,CACF,CAQA,MANA,GAAK,MAAQ,EAET,GAAoB,EACf,EAAK,IAAI,EAGX,EACT,CAEA,MAAO,EACT,EAEM,EAAoB,CACxB,GAAI,EAAO,eACX,eACA,cACA,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,WACS,EAAkB,CAAY,EAEvC,QAAW,CACT,GAAI,EAAO,oBAAoB,IAAI,CAAY,EAAG,MAAU,MAAM,0CAA0C,EAC5G,EAAO,oBAAoB,IAAI,CAAY,EAE3C,IAAM,EAAe,EAAO,eAC5B,EAAO,eAAiB,EAIxB,IAAM,EAAU,IAAI,IAAI,CAAY,EACpC,EAAa,MAAM,EAEnB,GAAI,CACF,IAAM,EAAW,EAAG,EAGpB,EAAQ,QAAQ,GAAO,CACrB,GAAI,CAAC,EAAa,IAAI,CAAG,EAAG,CAC1B,IAAM,EAAa,EAAI,OAAS,EAC5B,EAAW,aAAa,EAAW,YAAY,OAAO,CAAY,EACtE,EAAY,OAAO,CAAG,CACxB,CACF,CAAC,EAGD,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,KACT,EAAO,IAAI,CACT,KAAM,WACN,MAAO,GAAc,aAAa,EAAG,MAAQ,EAAa,GAAG,GAC7D,QAAS,CAAE,KAAM,EAAuB,GAAI,CAAS,CACvD,CAAC,EAGH,EAAY,QAAQ,GAAO,CACzB,IAAM,EAAS,EAAI,OAAS,EACxB,EAAO,OAAS,UAClB,EAAO,MAAQ,EACf,EAAO,QAAU,GACjB,EAAO,eAAe,IAAI,CAAG,GAEzB,EAAO,WAAW,EAAO,UAAU,CAAC,CAE5C,CAAC,CACH,CAEA,EAAU,GACV,EAAQ,EACR,EAAgB,GAEhB,IAAI,EAAc,EAgBlB,OAfA,EAAa,QAAQ,GAAO,CAC1B,IAAM,EAAU,EAAI,OAAS,EAC7B,EAAY,IAAI,EAAK,EAAQ,OAAO,EAChC,EAAQ,QAAU,IAAA,IAAa,EAAQ,MAAQ,IAAa,EAAc,EAAQ,MACxF,CAAC,EAGD,EAAY,QAAQ,GAAO,CACzB,IAAM,EAAS,EAAI,OAAS,EACxB,EAAO,aACT,EAAO,YAAY,IAAI,EAAkB,CAAO,CAEpD,CAAC,EAED,EAAa,MAAQ,EAAc,EAC5B,CACT,QAAU,CACR,EAAO,eAAiB,EACxB,EAAO,oBAAoB,OAAO,CAAY,CAChD,CACF,EACA,UAAY,GAAwB,CAC9B,GAAS,IAEb,EAAQ,EAER,EAAY,QAAQ,GAAO,CACzB,IAAM,EAAS,EAAI,OAAS,EACxB,EAAO,OAAS,WAClB,EAAO,QAAU,GACjB,EAAO,eAAe,IAAI,CAAG,GAE3B,EAAO,WACT,EAAO,UAAU,CAAC,CAEtB,CAAC,EACH,CACF,EAEM,EAAgC,CACpC,IAAI,OAAQ,CAgBV,OAdI,EAAO,gBAAkB,EAAO,iBAAmB,IACrD,EAAa,YAAY,IAAI,EAAO,cAAc,EAClD,EAAO,eAAe,aAAa,IAAI,CAAY,GAIrD,EAAkB,CAAY,EAG1B,EAAO,gBAAkB,EAAO,eAAe,aACjD,EAAO,eAAe,YAAY,IAAI,EAAkB,CAAO,EAI1D,CACT,EACA,IAAI,sBAAuB,CAAE,OAAO,CAAM,EAC1C,IAAI,SAAU,CAAE,OAAO,CAAQ,EAC/B,UAAU,EAAiC,CACzC,IAAM,EAAkB,CACtB,GAAI,EAAO,eACX,QAAS,GACT,MAAO,KACP,aAAc,IAAI,IAClB,KAAM,SACN,QAAW,CACL,MAAW,WACf,GAAI,CAAE,EAAG,EAAiB,KAAK,CAAE,OAAS,EAAK,CAAE,QAAQ,MAAM,CAAG,CAAE,CACtE,CACF,EAGA,OAFA,EAAa,YAAY,IAAI,CAAU,EACvC,EAAG,EAAiB,KAAK,MACZ,CACX,EAAW,WAAa,GACxB,EAAa,YAAY,OAAO,CAAU,CAC5C,CACF,EACA,eAAe,EAA2B,CACxC,OAAQ,EAAyB,UAAU,CAAE,CAC/C,EACA,YAAe,CACb,EAAa,YAAY,MAAM,EAC/B,EAAY,CAAY,EACxB,EAAO,cAAc,OAAO,CAAE,EAC9B,EAAU,GACV,EAAQ,EACR,EAAgB,EAClB,EACA,YAAY,EAA2B,CACrC,IAAM,EAAkB,CACtB,GAAI,EAAO,eACX,KAAM,SACN,IAAK,EACL,QAAS,EACX,EAEA,OADA,EAAa,YAAY,IAAI,CAAU,MAC1B,CACX,EAAY,OAAO,CAAU,CAC/B,CACF,CACF,EAUA,MARC,GAA0B,MAAQ,EAClC,EAA0B,YAAc,EACxC,EAA0B,aAAe,EAC1C,EAAiB,aAAiB,EAAQ,EAC1C,EAAiB,KAAO,WACxB,EAAiB,QAAY,EAAa,IAAI,EAE9C,EAAO,cAAc,IAAI,EAAI,IAAI,QAAQ,CAAuB,CAAC,EAC1D,CACT"}
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 const cachedRef = engine.computedCache.get(fn)\n const existing = cachedRef?.deref()\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 // 0 = STABLE, 1 = CHECK, 2 = DIRTY\n\n const dependencies = new Set<any>()\n const depVersions = new Map<any, number>()\n\n // 🌳 ХРАНИЛИЩЕ ВНУТРЕННИХ ЭФФЕКТOВ ВЫЧИСЛЕНИЯ (Тест #242)\n const ownedEffects = new Set<any>()\n\n const releaseNode = (node: any): void => {\n if (!node) return\n const actNode = node._node || node\n if (actNode.dependencies && actNode.dependencies.size > 0) {\n const snapshotDeps = Array.from(actNode.dependencies)\n actNode.dependencies.clear()\n if (actNode.depVersions) actNode.depVersions.clear()\n\n snapshotDeps.forEach((dep: any) => {\n const rawDepNode = dep._node || dep\n if (rawDepNode.subscribers) {\n rawDepNode.subscribers.delete(actNode)\n rawDepNode.subscribers.delete(node)\n rawDepNode.subscribers.delete(computedNode)\n if (rawDepNode.type === 'computed' && rawDepNode.subscribers.size === 0) {\n releaseNode(rawDepNode)\n }\n }\n })\n }\n }\n\n const subscribers = new class extends Set<any> {\n override delete(val: any): boolean {\n const res = super.delete(val)\n if (this.size === 0) {\n state = 2\n isDirty = true\n isInitialized = false\n releaseNode(computedNode)\n engine.computedCache.delete(fn)\n }\n return res\n }\n }()\n\n // ⚡ КАНOНИЧЕСКИЙ АПДЕЙТЕР ГРАФА С АВТOМАТИЧЕСКИМ ПРЕPЫВАНИЕМ И СБРOСОМ ПАРАЛЛЕЛЬНЫХ ВЕТОК (Pull)\n const updateIfNecessary = (node: any): boolean => {\n // 1. Холодный старт (самый первый вызов в жизни узла)\n if (!isInitialized) {\n return node.run()\n }\n\n // 2. Если прилетел прямой dirty-флаг от сигнала — вычисляем сразу\n if (node.state === 2) {\n return node.run()\n }\n\n // 3. Phase ленивой проверки CHECK (1)\n if (node.state === 1) {\n let hasChangedParent = false\n let brokenAtIndex = -1\n const depsArray = Array.from(node.dependencies || [])\n\n // Последовательно опрашиваем родителей по одному\n for (let i = 0; i < depsArray.length; i++) {\n const dep = depsArray[i]\n const rawDep = (dep as any)._node || dep\n\n // Рекурсивно актуализируем родителя-computed\n if (rawDep.type === 'computed' && rawDep.state > 0) {\n updateIfNecessary(rawDep)\n }\n\n // Сверяем сохраненную версию ребра с актуальной версией родителя\n if (node.depVersions.get(dep) !== rawDep.version) {\n hasChangedParent = true\n brokenAtIndex = i // Запоминаем индекс, на котором произошел разрыв\n\n // 🎯 КАНOНИЧЕСКИЙ VALUE EQUALITY BREAK (Тест #193):\n // Родоначальник ветки b изменился! Прерываем опрос, чтобы не выполнять\n // мёртвую ветку (узел c) холосто.\n break\n }\n }\n\n // 🌳 СБРOС ПАРАЛЛЕЛЬНЫХ ВЕТВЕЙ ДЛЯ СИНХРOНИЗАЦИИ (Пример 201):\n // Если произошел досрочный break, все оставшиеся в списке родители,\n // до которых мы не успели дойти, могут остаться в зависшем состоянии state === 1.\n // Мы обязаны аккуратно сбросить их стейты в стабильный 0, чтобы они вовремя\n // среагировали на последующие асинхронные пуш-уведомления от макро-батчей!\n if (brokenAtIndex !== -1) {\n for (let j = brokenAtIndex + 1; j < depsArray.length; j++) {\n const untouchedDep = depsArray[j]\n const rawUntouched = (untouchedDep as any)._node || untouchedDep\n if (rawUntouched.type === 'computed' && rawUntouched.state === 1) {\n rawUntouched.state = 0 // Снимаем зависшую блокировку графа\n }\n }\n }\n\n // Намертво гасим стейт текущего узла в стабильный (0) ДО вызова run()\n node.state = 0\n\n if (hasChangedParent || isDirty) {\n return node.run() // Пересчитываем узел, что вызовет динамический diff и отписку\n }\n\n return false // Value Equality Cut\n }\n\n return false\n }\n\n const computedNode: any = {\n id: engine.subscriberId++,\n dependencies,\n subscribers,\n ownedEffects, // Экспортируем контекст владения для вложенных эффектов\n depth: 1,\n type: 'computed',\n fn,\n get version() { return version },\n get state() { return state },\n set state(val: number) { state = val },\n get depVersions() { return depVersions },\n update: () => updateIfNecessary(computedNode),\n run: () => {\n if (evaluatedInEpoch === engine.epoch && isInitialized) {\n return false\n }\n evaluatedInEpoch = engine.epoch\n\n if (engine.cycleDetectionStack.has(computedNode)) throw new Error('[Graph Error] Cyclic dependency detected')\n engine.cycleDetectionStack.add(computedNode)\n\n const prevConsumer = engine.activeConsumer\n const prevOwner = engine.activeOwner\n\n // Направляем контекст консьюмера и владения на текущий computed\n engine.activeConsumer = computedNode\n engine.activeOwner = computedNode\n\n const oldDeps = new Set(dependencies)\n dependencies.clear()\n\n try {\n // 🎯 ФИКС КЕЙСА #242: Перед запуском fn() принудительно очищаем\n // и уничтожаем все внутренние эффекты, созданные на предыдущем кадре оценки!\n ownedEffects.forEach(child => { if (child.dispose) child.dispose() })\n ownedEffects.clear()\n\n const newValue = fn()\n\n oldDeps.forEach(dep => {\n if (!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 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 subscribers.forEach(sub => {\n const rawSub = sub._node || sub\n if (rawSub.type === 'effect') {\n rawSub.state = 2\n rawSub.isDirty = true\n engine.pendingEffects.add(sub)\n } else if (rawSub.markDirty) {\n rawSub.markDirty(1)\n }\n })\n }\n\n isDirty = false\n state = 0\n isInitialized = true\n\n let maxDepDepth = 0\n dependencies.forEach(dep => {\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) maxDepDepth = rawNode.depth\n })\n\n subscribers.forEach(sub => {\n const rawSub = sub._node || sub\n if (rawSub.depVersions) {\n rawSub.depVersions.set(computedInstance, version)\n }\n })\n\n computedNode.depth = maxDepDepth + 1\n return changed\n } finally {\n engine.activeConsumer = prevConsumer\n engine.activeOwner = prevOwner\n engine.cycleDetectionStack.delete(computedNode)\n }\n },\n markDirty: (parentState: number) => {\n if (state >= parentState) return\n state = parentState\n\n subscribers.forEach(sub => {\n const rawSub = sub._node || sub\n if (rawSub.type === 'effect') {\n rawSub.isDirty = true\n engine.pendingEffects.add(sub)\n } else if (rawSub.markDirty) {\n rawSub.markDirty(1)\n }\n })\n }\n }\n\n const computedInstance: Computed<T> = {\n get value() {\n if (engine.activeConsumer && engine.activeConsumer !== computedNode) {\n computedNode.subscribers.add(engine.activeConsumer)\n engine.activeConsumer.dependencies.add(computedNode)\n }\n\n updateIfNecessary(computedNode)\n\n if (engine.activeConsumer && engine.activeConsumer.depVersions) {\n engine.activeConsumer.depVersions.set(computedInstance, version)\n }\n return value\n },\n get valueWithoutTracking() { return value },\n get version() { return version },\n subscribe(cb: (val: T) => void): CleanupFn {\n const fakeEffect: any = {\n id: engine.subscriberId++,\n isDirty: true,\n depth: 9999,\n dependencies: new Set(),\n type: 'effect',\n run: () => {\n if (fakeEffect.isDisposed) return\n try { cb(computedInstance.value) } catch (err) { console.error(err) }\n }\n }\n computedNode.subscribers.add(fakeEffect)\n cb(computedInstance.value)\n return () => {\n fakeEffect.isDisposed = true\n computedNode.subscribers.delete(fakeEffect)\n }\n },\n subscribeState(cb: () => void): CleanupFn {\n return (computedInstance as any).subscribe(cb)\n },\n destroy: () => {\n computedNode.subscribers.clear()\n releaseNode(computedNode)\n engine.computedCache.delete(fn)\n isDirty = true\n state = 2\n isInitialized = false\n },\n __subscribe(cb: () => void): CleanupFn {\n const hookEffect: any = {\n id: engine.subscriberId++,\n type: 'effect',\n run: cb,\n isDirty: false\n }\n computedNode.subscribers.add(hookEffect)\n return () => {\n subscribers.delete(hookEffect)\n }\n }\n } as any\n\n ;(computedInstance as any)._node = computedNode\n ;(computedInstance as any).subscribers = subscribers\n ;(computedInstance as any).dependencies = dependencies\n computedInstance._isDirty = () => state > 0\n computedInstance.type = 'computed'\n computedInstance.run = () => computedNode.run()\n\n engine.computedCache.set(fn, new WeakRef(computedInstance as any))\n return computedInstance\n}\n"],"mappings":"AAEA,SAAgB,EACd,EACA,EACA,EACa,CAEb,IAAM,EADY,EAAO,cAAc,IAAI,CAC1B,CAAA,EAAW,MAAM,EAClC,GAAI,EAAU,OAAO,EAErB,IAAI,EACA,EAAU,GACV,EAAU,EACV,EAAgB,GAChB,EAAmB,GACnB,EAAQ,EAEN,EAAe,IAAI,IACnB,EAAc,IAAI,IAGlB,EAAe,IAAI,IAEnB,EAAe,GAAoB,CACvC,GAAI,CAAC,EAAM,OACX,IAAM,EAAU,EAAK,OAAS,EAC9B,GAAI,EAAQ,cAAgB,EAAQ,aAAa,KAAO,EAAG,CACzD,IAAM,EAAe,MAAM,KAAK,EAAQ,YAAY,EACpD,EAAQ,aAAa,MAAM,EACvB,EAAQ,aAAa,EAAQ,YAAY,MAAM,EAEnD,EAAa,QAAS,GAAa,CACjC,IAAM,EAAa,EAAI,OAAS,EAC5B,EAAW,cACb,EAAW,YAAY,OAAO,CAAO,EACrC,EAAW,YAAY,OAAO,CAAI,EAClC,EAAW,YAAY,OAAO,CAAY,EACtC,EAAW,OAAS,YAAc,EAAW,YAAY,OAAS,GACpE,EAAY,CAAU,EAG5B,CAAC,CACH,CACF,EAEM,EAAc,IAAI,cAAc,GAAS,CAC7C,OAAgB,EAAmB,CACjC,IAAM,EAAM,MAAM,OAAO,CAAG,EAQ5B,OAPI,KAAK,OAAS,IAChB,EAAQ,EACR,EAAU,GACV,EAAgB,GAChB,EAAY,CAAY,EACxB,EAAO,cAAc,OAAO,CAAE,GAEzB,CACT,CACF,EAGM,EAAqB,GAAuB,CAOhD,GALI,CAAC,GAKD,EAAK,QAAU,EACjB,OAAO,EAAK,IAAI,EAIlB,GAAI,EAAK,QAAU,EAAG,CACpB,IAAI,EAAmB,GACnB,EAAgB,GACd,EAAY,MAAM,KAAK,EAAK,cAAgB,CAAC,CAAC,EAGpD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAU,OAAQ,IAAK,CACzC,IAAM,EAAM,EAAU,GAChB,EAAU,EAAY,OAAS,EAQrC,GALI,EAAO,OAAS,YAAc,EAAO,MAAQ,GAC/C,EAAkB,CAAM,EAItB,EAAK,YAAY,IAAI,CAAG,IAAM,EAAO,QAAS,CAChD,EAAmB,GACnB,EAAgB,EAKhB,KACF,CACF,CAOA,GAAI,IAAkB,GACpB,IAAK,IAAI,EAAI,EAAgB,EAAG,EAAI,EAAU,OAAQ,IAAK,CACzD,IAAM,EAAe,EAAU,GACzB,EAAgB,EAAqB,OAAS,EAChD,EAAa,OAAS,YAAc,EAAa,QAAU,IAC7D,EAAa,MAAQ,EAEzB,CAUF,MANA,GAAK,MAAQ,EAET,GAAoB,EACf,EAAK,IAAI,EAGX,EACT,CAEA,MAAO,EACT,EAEM,EAAoB,CACxB,GAAI,EAAO,eACX,eACA,cACA,eACA,MAAO,EACP,KAAM,WACN,KACA,IAAI,SAAU,CAAE,OAAO,CAAQ,EAC/B,IAAI,OAAQ,CAAE,OAAO,CAAM,EAC3B,IAAI,MAAM,EAAa,CAAE,EAAQ,CAAI,EACrC,IAAI,aAAc,CAAE,OAAO,CAAY,EACvC,WAAc,EAAkB,CAAY,EAC5C,QAAW,CACT,GAAI,IAAqB,EAAO,OAAS,EACvC,MAAO,GAIT,GAFA,EAAmB,EAAO,MAEtB,EAAO,oBAAoB,IAAI,CAAY,EAAG,MAAU,MAAM,0CAA0C,EAC5G,EAAO,oBAAoB,IAAI,CAAY,EAE3C,IAAM,EAAe,EAAO,eACtB,EAAY,EAAO,YAGzB,EAAO,eAAiB,EACxB,EAAO,YAAc,EAErB,IAAM,EAAU,IAAI,IAAI,CAAY,EACpC,EAAa,MAAM,EAEnB,GAAI,CAGF,EAAa,QAAQ,GAAS,CAAM,EAAM,SAAS,EAAM,QAAQ,CAAE,CAAC,EACpE,EAAa,MAAM,EAEnB,IAAM,EAAW,EAAG,EAEpB,EAAQ,QAAQ,GAAO,CACrB,GAAI,CAAC,EAAa,IAAI,CAAG,EAAG,CAC1B,IAAM,EAAa,EAAI,OAAS,EAC5B,EAAW,aAAa,EAAW,YAAY,OAAO,CAAY,EACtE,EAAY,OAAO,CAAG,CACxB,CACF,CAAC,EAED,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,EAGH,EAAY,QAAQ,GAAO,CACzB,IAAM,EAAS,EAAI,OAAS,EACxB,EAAO,OAAS,UAClB,EAAO,MAAQ,EACf,EAAO,QAAU,GACjB,EAAO,eAAe,IAAI,CAAG,GACpB,EAAO,WAChB,EAAO,UAAU,CAAC,CAEtB,CAAC,CACH,CAEA,EAAU,GACV,EAAQ,EACR,EAAgB,GAEhB,IAAI,EAAc,EAgBlB,OAfA,EAAa,QAAQ,GAAO,CAC1B,IAAM,EAAU,EAAI,OAAS,EAC7B,EAAY,IAAI,EAAK,EAAQ,OAAO,EAChC,EAAQ,aAAa,EAAQ,YAAY,IAAI,CAAY,EACzD,EAAQ,QAAU,IAAA,IAAa,EAAQ,MAAQ,IAAa,EAAc,EAAQ,MACxF,CAAC,EAED,EAAY,QAAQ,GAAO,CACzB,IAAM,EAAS,EAAI,OAAS,EACxB,EAAO,aACT,EAAO,YAAY,IAAI,EAAkB,CAAO,CAEpD,CAAC,EAED,EAAa,MAAQ,EAAc,EAC5B,CACT,QAAU,CACR,EAAO,eAAiB,EACxB,EAAO,YAAc,EACrB,EAAO,oBAAoB,OAAO,CAAY,CAChD,CACF,EACA,UAAY,GAAwB,CAC9B,GAAS,IACb,EAAQ,EAER,EAAY,QAAQ,GAAO,CACzB,IAAM,EAAS,EAAI,OAAS,EACxB,EAAO,OAAS,UAClB,EAAO,QAAU,GACjB,EAAO,eAAe,IAAI,CAAG,GACpB,EAAO,WAChB,EAAO,UAAU,CAAC,CAEtB,CAAC,EACH,CACF,EAEM,EAAgC,CACpC,IAAI,OAAQ,CAWV,OAVI,EAAO,gBAAkB,EAAO,iBAAmB,IACrD,EAAa,YAAY,IAAI,EAAO,cAAc,EAClD,EAAO,eAAe,aAAa,IAAI,CAAY,GAGrD,EAAkB,CAAY,EAE1B,EAAO,gBAAkB,EAAO,eAAe,aACjD,EAAO,eAAe,YAAY,IAAI,EAAkB,CAAO,EAE1D,CACT,EACA,IAAI,sBAAuB,CAAE,OAAO,CAAM,EAC1C,IAAI,SAAU,CAAE,OAAO,CAAQ,EAC/B,UAAU,EAAiC,CACzC,IAAM,EAAkB,CACtB,GAAI,EAAO,eACX,QAAS,GACT,MAAO,KACP,aAAc,IAAI,IAClB,KAAM,SACN,QAAW,CACL,MAAW,WACf,GAAI,CAAE,EAAG,EAAiB,KAAK,CAAE,OAAS,EAAK,CAAE,QAAQ,MAAM,CAAG,CAAE,CACtE,CACF,EAGA,OAFA,EAAa,YAAY,IAAI,CAAU,EACvC,EAAG,EAAiB,KAAK,MACZ,CACX,EAAW,WAAa,GACxB,EAAa,YAAY,OAAO,CAAU,CAC5C,CACF,EACA,eAAe,EAA2B,CACxC,OAAQ,EAAyB,UAAU,CAAE,CAC/C,EACA,YAAe,CACb,EAAa,YAAY,MAAM,EAC/B,EAAY,CAAY,EACxB,EAAO,cAAc,OAAO,CAAE,EAC9B,EAAU,GACV,EAAQ,EACR,EAAgB,EAClB,EACA,YAAY,EAA2B,CACrC,IAAM,EAAkB,CACtB,GAAI,EAAO,eACX,KAAM,SACN,IAAK,EACL,QAAS,EACX,EAEA,OADA,EAAa,YAAY,IAAI,CAAU,MAC1B,CACX,EAAY,OAAO,CAAU,CAC/B,CACF,CACF,EAUA,MARC,GAA0B,MAAQ,EAClC,EAA0B,YAAc,EACxC,EAA0B,aAAe,EAC1C,EAAiB,aAAiB,EAAQ,EAC1C,EAAiB,KAAO,WACxB,EAAiB,QAAY,EAAa,IAAI,EAE9C,EAAO,cAAc,IAAI,EAAI,IAAI,QAAQ,CAAuB,CAAC,EAC1D,CACT"}
@@ -2,39 +2,44 @@
2
2
  function e(e, t, n) {
3
3
  let r = e.computedCache.get(t)?.deref();
4
4
  if (r) return r;
5
- let i, a = !0, o = 0, s = !1, c = 2, l = /* @__PURE__ */ new Set(), u = /* @__PURE__ */ new Map(), d = (e) => {
5
+ let i, a = !0, o = 0, s = !1, c = -1, l = 2, u = /* @__PURE__ */ new Set(), d = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ new Set(), p = (e) => {
6
6
  if (!e) return;
7
7
  let t = e._node || e;
8
8
  if (t.dependencies && t.dependencies.size > 0) {
9
9
  let n = Array.from(t.dependencies);
10
10
  t.dependencies.clear(), t.depVersions && t.depVersions.clear(), n.forEach((n) => {
11
11
  let r = n._node || n;
12
- r.subscribers && (r.subscribers.delete(t), r.subscribers.delete(e), r.subscribers.delete(m), r.type === "computed" && r.subscribers.size === 0 && d(r));
12
+ r.subscribers && (r.subscribers.delete(t), r.subscribers.delete(e), r.subscribers.delete(g), r.type === "computed" && r.subscribers.size === 0 && p(r));
13
13
  });
14
14
  }
15
- }, f = new class extends Set {
15
+ }, m = new class extends Set {
16
16
  delete(n) {
17
17
  let r = super.delete(n);
18
- return this.size === 0 && (c = 2, a = !0, e.computedCache.delete(t)), r;
18
+ return this.size === 0 && (l = 2, a = !0, s = !1, p(g), e.computedCache.delete(t)), r;
19
19
  }
20
- }(), p = (e) => {
20
+ }(), h = (e) => {
21
21
  if (!s || e.state === 2) return e.run();
22
22
  if (e.state === 1) {
23
- let t = !1;
24
- for (let n of Array.from(e.dependencies)) {
25
- let r = n._node || n;
26
- if (r.type === "computed" && r.state > 0 && p(r), e.depVersions.get(n) !== r.version) {
27
- t = !0;
23
+ let t = !1, n = -1, r = Array.from(e.dependencies || []);
24
+ for (let i = 0; i < r.length; i++) {
25
+ let a = r[i], o = a._node || a;
26
+ if (o.type === "computed" && o.state > 0 && h(o), e.depVersions.get(a) !== o.version) {
27
+ t = !0, n = i;
28
28
  break;
29
29
  }
30
30
  }
31
+ if (n !== -1) for (let e = n + 1; e < r.length; e++) {
32
+ let t = r[e], n = t._node || t;
33
+ n.type === "computed" && n.state === 1 && (n.state = 0);
34
+ }
31
35
  return e.state = 0, t || a ? e.run() : !1;
32
36
  }
33
37
  return !1;
34
- }, m = {
38
+ }, g = {
35
39
  id: e.subscriberId++,
36
- dependencies: l,
37
- subscribers: f,
40
+ dependencies: u,
41
+ subscribers: m,
42
+ ownedEffects: f,
38
43
  depth: 1,
39
44
  type: "computed",
40
45
  fn: t,
@@ -42,67 +47,71 @@ function e(e, t, n) {
42
47
  return o;
43
48
  },
44
49
  get state() {
45
- return c;
50
+ return l;
46
51
  },
47
52
  set state(e) {
48
- c = e;
53
+ l = e;
49
54
  },
50
55
  get depVersions() {
51
- return u;
56
+ return d;
52
57
  },
53
- update: () => p(m),
58
+ update: () => h(g),
54
59
  run: () => {
55
- if (e.cycleDetectionStack.has(m)) throw Error("[Graph Error] Cyclic dependency detected");
56
- e.cycleDetectionStack.add(m);
57
- let r = e.activeConsumer;
58
- e.activeConsumer = m;
59
- let d = new Set(l);
60
- l.clear();
60
+ if (c === e.epoch && s) return !1;
61
+ if (c = e.epoch, e.cycleDetectionStack.has(g)) throw Error("[Graph Error] Cyclic dependency detected");
62
+ e.cycleDetectionStack.add(g);
63
+ let r = e.activeConsumer, p = e.activeOwner;
64
+ e.activeConsumer = g, e.activeOwner = g;
65
+ let h = new Set(u);
66
+ u.clear();
61
67
  try {
68
+ f.forEach((e) => {
69
+ e.dispose && e.dispose();
70
+ }), f.clear();
62
71
  let r = t();
63
- d.forEach((e) => {
64
- if (!l.has(e)) {
72
+ h.forEach((e) => {
73
+ if (!u.has(e)) {
65
74
  let t = e._node || e;
66
- t.subscribers && t.subscribers.delete(m), u.delete(e);
75
+ t.subscribers && t.subscribers.delete(g), d.delete(e);
67
76
  }
68
77
  });
69
- let p = a || !Object.is(i, r);
70
- if (p) {
71
- let s = a ? void 0 : typeof i == "object" && i ? JSON.parse(JSON.stringify(i)) : i;
72
- i = r, o++, e.log && e.log({
78
+ let c = a || !Object.is(i, r);
79
+ if (c) {
80
+ let t = a ? void 0 : typeof i == "object" && i ? JSON.parse(JSON.stringify(i)) : i;
81
+ i = r, o++, e.log && n && e.log({
73
82
  type: "computed",
74
- label: n || `computed:[${t.name || m.id}]`,
83
+ label: n,
75
84
  details: {
76
- from: s,
85
+ from: t,
77
86
  to: r
78
87
  }
79
- }), f.forEach((t) => {
88
+ }), m.forEach((t) => {
80
89
  let n = t._node || t;
81
90
  n.type === "effect" ? (n.state = 2, n.isDirty = !0, e.pendingEffects.add(t)) : n.markDirty && n.markDirty(1);
82
91
  });
83
92
  }
84
- a = !1, c = 0, s = !0;
85
- let g = 0;
86
- return l.forEach((e) => {
93
+ a = !1, l = 0, s = !0;
94
+ let p = 0;
95
+ return u.forEach((e) => {
87
96
  let t = e._node || e;
88
- u.set(e, t.version), t.depth !== void 0 && t.depth > g && (g = t.depth);
89
- }), f.forEach((e) => {
97
+ d.set(e, t.version), t.subscribers && t.subscribers.add(g), t.depth !== void 0 && t.depth > p && (p = t.depth);
98
+ }), m.forEach((e) => {
90
99
  let t = e._node || e;
91
- t.depVersions && t.depVersions.set(h, o);
92
- }), m.depth = g + 1, p;
100
+ t.depVersions && t.depVersions.set(_, o);
101
+ }), g.depth = p + 1, c;
93
102
  } finally {
94
- e.activeConsumer = r, e.cycleDetectionStack.delete(m);
103
+ e.activeConsumer = r, e.activeOwner = p, e.cycleDetectionStack.delete(g);
95
104
  }
96
105
  },
97
106
  markDirty: (t) => {
98
- c >= t || (c = t, f.forEach((t) => {
107
+ l >= t || (l = t, m.forEach((t) => {
99
108
  let n = t._node || t;
100
- n.type === "effect" && (n.isDirty = !0, e.pendingEffects.add(t)), n.markDirty && n.markDirty(1);
109
+ n.type === "effect" ? (n.isDirty = !0, e.pendingEffects.add(t)) : n.markDirty && n.markDirty(1);
101
110
  }));
102
111
  }
103
- }, h = {
112
+ }, _ = {
104
113
  get value() {
105
- return e.activeConsumer && e.activeConsumer !== m && (m.subscribers.add(e.activeConsumer), e.activeConsumer.dependencies.add(m)), p(m), e.activeConsumer && e.activeConsumer.depVersions && e.activeConsumer.depVersions.set(h, o), i;
114
+ return e.activeConsumer && e.activeConsumer !== g && (g.subscribers.add(e.activeConsumer), e.activeConsumer.dependencies.add(g)), h(g), e.activeConsumer && e.activeConsumer.depVersions && e.activeConsumer.depVersions.set(_, o), i;
106
115
  },
107
116
  get valueWithoutTracking() {
108
117
  return i;
@@ -119,21 +128,21 @@ function e(e, t, n) {
119
128
  type: "effect",
120
129
  run: () => {
121
130
  if (!n.isDisposed) try {
122
- t(h.value);
131
+ t(_.value);
123
132
  } catch (e) {
124
133
  console.error(e);
125
134
  }
126
135
  }
127
136
  };
128
- return m.subscribers.add(n), t(h.value), () => {
129
- n.isDisposed = !0, m.subscribers.delete(n);
137
+ return g.subscribers.add(n), t(_.value), () => {
138
+ n.isDisposed = !0, g.subscribers.delete(n);
130
139
  };
131
140
  },
132
141
  subscribeState(e) {
133
- return h.subscribe(e);
142
+ return _.subscribe(e);
134
143
  },
135
144
  destroy: () => {
136
- m.subscribers.clear(), d(m), e.computedCache.delete(t), a = !0, c = 2, s = !1;
145
+ g.subscribers.clear(), p(g), e.computedCache.delete(t), a = !0, l = 2, s = !1;
137
146
  },
138
147
  __subscribe(t) {
139
148
  let n = {
@@ -142,12 +151,12 @@ function e(e, t, n) {
142
151
  run: t,
143
152
  isDirty: !1
144
153
  };
145
- return m.subscribers.add(n), () => {
146
- f.delete(n);
154
+ return g.subscribers.add(n), () => {
155
+ m.delete(n);
147
156
  };
148
157
  }
149
158
  };
150
- return h._node = m, h.subscribers = f, h.dependencies = l, h._isDirty = () => c > 0, h.type = "computed", h.run = () => m.run(), e.computedCache.set(t, new WeakRef(h)), h;
159
+ return _._node = g, _.subscribers = m, _.dependencies = u, _._isDirty = () => l > 0, _.type = "computed", _.run = () => g.run(), e.computedCache.set(t, new WeakRef(_)), _;
151
160
  }
152
161
  //#endregion
153
162
  export { e as createComputed };
@@ -1 +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 const cachedRef = engine.computedCache.get(fn)\n const existing = cachedRef?.deref()\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\n // 0 = STABLE, 1 = CHECK, 2 = DIRTY\n let state = 2\n\n const dependencies = new Set<any>()\n const depVersions = new Map<any, number>()\n\n const releaseNode = (node: any): void => {\n if (!node) return\n const actNode = node._node || node\n if (actNode.dependencies && actNode.dependencies.size > 0) {\n const snapshotDeps = Array.from(actNode.dependencies)\n actNode.dependencies.clear()\n if (actNode.depVersions) actNode.depVersions.clear()\n\n snapshotDeps.forEach((dep: any) => {\n const rawDepNode = dep._node || dep\n if (rawDepNode.subscribers) {\n rawDepNode.subscribers.delete(actNode)\n rawDepNode.subscribers.delete(node)\n rawDepNode.subscribers.delete(computedNode)\n if (rawDepNode.type === 'computed' && rawDepNode.subscribers.size === 0) {\n releaseNode(rawDepNode)\n }\n }\n })\n }\n }\n\n const subscribers = new class extends Set<any> {\n override delete(val: any): boolean {\n const res = super.delete(val)\n // ⚛️ СТРИКТМОД-ЗАЩИТА СВЯЗЕЙ ГРАФА:\n // Мы убираем отсюда моментальный вызов releaseNode(computedNode) при size === 0!\n // Если StrictMode временно отписывает хук во время перемонтажа,\n // связи с родительскими сигналами НЕ должны выжигаться из памяти.\n // Граф сохраняет целостность, а полная зачистка происходит строго при вызове .destroy().\n if (this.size === 0) {\n state = 2\n isDirty = true\n engine.computedCache.delete(fn)\n }\n return res\n }\n }()\n\n // ⚡ КАНOНИЧЕСКИЙ АПДЕЙТЕР ГРАФА С АВТOМАТИЧЕСКИМ ПРЕPЫВАНИЕМ (Pull)\n const updateIfNecessary = (node: any): boolean => {\n // 1. Холодный старт\n if (!isInitialized) {\n return node.run()\n }\n\n // 2. Если прилетел прямой dirty-флаг от сигнала — вычисляем сразу\n if (node.state === 2) {\n return node.run()\n }\n\n // 3. Фаза ленивой проверки CHECK (1)\n if (node.state === 1) {\n let hasChangedParent = false\n\n // Опрашиваем родителей СТРОГО по одному, последовательно!\n for (const dep of Array.from(node.dependencies)) {\n const rawDep = (dep as any)._node || dep\n\n if (rawDep.type === 'computed' && rawDep.state > 0) {\n updateIfNecessary(rawDep)\n }\n\n if (node.depVersions.get(dep) !== rawDep.version) {\n hasChangedParent = true\n // 🎯 VALUE EQUALITY BREAK: Родоначальник ветки изменился!\n // Прерываем опрос оставшихся родителей, чтобы не дергать мёртвые ветки (узел c)\n break\n }\n }\n\n node.state = 0\n\n if (hasChangedParent || isDirty) {\n return node.run()\n }\n\n return false // Value Equality Cut\n }\n\n return false\n }\n\n const computedNode: any = {\n id: engine.subscriberId++,\n dependencies,\n subscribers,\n depth: 1,\n type: 'computed',\n fn,\n get version() { return version },\n get state() { return state },\n set state(val: number) { state = val },\n get depVersions() { return depVersions },\n update: () => {\n return updateIfNecessary(computedNode)\n },\n run: () => {\n if (engine.cycleDetectionStack.has(computedNode)) throw new Error('[Graph Error] Cyclic dependency detected')\n engine.cycleDetectionStack.add(computedNode)\n\n const prevConsumer = engine.activeConsumer\n engine.activeConsumer = computedNode\n\n // 🎯 ЧЕСТНЫЙ DIFF ЗАВИСИМОСТЕЙ БЕЗ ВСЛЕПУЮ ОЧИСТКИ (Канонический Паттерн)\n // Сохраняем слепок старых зависимостей, не удаляя их из подписчиков родителей раньше времени!\n const oldDeps = new Set(dependencies)\n dependencies.clear()\n\n try {\n const newValue = fn()\n\n // Отписываемся ТОЛЬКО от тех старых зависимостей, которые не нарисовались в новом запуске fn()\n oldDeps.forEach(dep => {\n if (!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) {\n engine.log({\n type: 'computed',\n label: signalName || `computed:[${fn.name || computedNode.id}]`,\n details: { from: previousValueSnapshot, to: newValue }\n })\n }\n\n subscribers.forEach(sub => {\n const rawSub = sub._node || sub\n if (rawSub.type === 'effect') {\n rawSub.state = 2 // Эффекты переводим в DIRTY\n rawSub.isDirty = true\n engine.pendingEffects.add(sub)\n } else {\n if (rawSub.markDirty) rawSub.markDirty(1) // computed переводят потомков в CHECK (1)\n }\n })\n }\n\n isDirty = false\n state = 0\n isInitialized = true\n\n let maxDepDepth = 0\n dependencies.forEach(dep => {\n const rawNode = dep._node || dep\n depVersions.set(dep, rawNode.version)\n if (rawNode.depth !== undefined && rawNode.depth > maxDepDepth) maxDepDepth = rawNode.depth\n })\n\n // Синхронизация слепков версий подписчиков\n subscribers.forEach(sub => {\n const rawSub = sub._node || sub\n if (rawSub.depVersions) {\n rawSub.depVersions.set(computedInstance, version)\n }\n })\n\n computedNode.depth = maxDepDepth + 1\n return changed\n } finally {\n engine.activeConsumer = prevConsumer\n engine.cycleDetectionStack.delete(computedNode)\n }\n },\n markDirty: (parentState: number) => {\n if (state >= parentState) return\n\n state = parentState\n\n subscribers.forEach(sub => {\n const rawSub = sub._node || sub\n if (rawSub.type === 'effect') {\n rawSub.isDirty = true\n engine.pendingEffects.add(sub)\n }\n if (rawSub.markDirty) {\n rawSub.markDirty(1)\n }\n })\n }\n }\n\n const computedInstance: Computed<T> = {\n get value() {\n // Регистрируем зависимость, если этот computed считывается внутри другого computed или эффекта\n if (engine.activeConsumer && engine.activeConsumer !== computedNode) {\n computedNode.subscribers.add(engine.activeConsumer)\n engine.activeConsumer.dependencies.add(computedNode)\n }\n\n // Атомарно запускаем pull-алгоритм ленивой проверки версий родителей\n updateIfNecessary(computedNode)\n\n // Синхронизируем числовой слепок версии для активного консьюмера\n if (engine.activeConsumer && engine.activeConsumer.depVersions) {\n engine.activeConsumer.depVersions.set(computedInstance, version)\n }\n\n // Железобетонно отдаем закэшированное значение без фантомных перезапусков!\n return value\n },\n get valueWithoutTracking() { return value },\n get version() { return version },\n subscribe(cb: (val: T) => void): CleanupFn {\n const fakeEffect: any = {\n id: engine.subscriberId++,\n isDirty: true,\n depth: 9999,\n dependencies: new Set(),\n type: 'effect',\n run: () => {\n if (fakeEffect.isDisposed) return\n try { cb(computedInstance.value) } catch (err) { console.error(err) }\n }\n }\n computedNode.subscribers.add(fakeEffect)\n cb(computedInstance.value)\n return () => {\n fakeEffect.isDisposed = true\n computedNode.subscribers.delete(fakeEffect)\n }\n },\n subscribeState(cb: () => void): CleanupFn {\n return (computedInstance as any).subscribe(cb)\n },\n destroy: () => {\n computedNode.subscribers.clear()\n releaseNode(computedNode)\n engine.computedCache.delete(fn)\n isDirty = true\n state = 2\n isInitialized = false\n },\n __subscribe(cb: () => void): CleanupFn {\n const hookEffect: any = {\n id: engine.subscriberId++,\n type: 'effect',\n run: cb,\n isDirty: false\n }\n computedNode.subscribers.add(hookEffect)\n return () => {\n subscribers.delete(hookEffect)\n }\n }\n } as any\n\n ;(computedInstance as any)._node = computedNode\n ;(computedInstance as any).subscribers = subscribers\n ;(computedInstance as any).dependencies = dependencies\n computedInstance._isDirty = () => state > 0\n computedInstance.type = 'computed'\n computedInstance.run = () => computedNode.run()\n\n engine.computedCache.set(fn, new WeakRef(computedInstance as any))\n return computedInstance\n}\n"],"mappings":";AAEA,SAAgB,EACd,GACA,GACA,GACa;CAEb,IAAM,IADY,EAAO,cAAc,IAAI,CAC1B,CAAA,EAAW,MAAM;CAClC,IAAI,GAAU,OAAO;CAErB,IAAI,GACA,IAAU,IACV,IAAU,GACV,IAAgB,IAGhB,IAAQ,GAEN,oBAAe,IAAI,IAAS,GAC5B,oBAAc,IAAI,IAAiB,GAEnC,KAAe,MAAoB;EACvC,IAAI,CAAC,GAAM;EACX,IAAM,IAAU,EAAK,SAAS;EAC9B,IAAI,EAAQ,gBAAgB,EAAQ,aAAa,OAAO,GAAG;GACzD,IAAM,IAAe,MAAM,KAAK,EAAQ,YAAY;GAIpD,AAHA,EAAQ,aAAa,MAAM,GACvB,EAAQ,eAAa,EAAQ,YAAY,MAAM,GAEnD,EAAa,SAAS,MAAa;IACjC,IAAM,IAAa,EAAI,SAAS;IAChC,AAAI,EAAW,gBACb,EAAW,YAAY,OAAO,CAAO,GACrC,EAAW,YAAY,OAAO,CAAI,GAClC,EAAW,YAAY,OAAO,CAAY,GACtC,EAAW,SAAS,cAAc,EAAW,YAAY,SAAS,KACpE,EAAY,CAAU;GAG5B,CAAC;EACH;CACF,GAEM,IAAc,IAAI,cAAc,IAAS;EAC7C,OAAgB,GAAmB;GACjC,IAAM,IAAM,MAAM,OAAO,CAAG;GAW5B,OALI,KAAK,SAAS,MAChB,IAAQ,GACR,IAAU,IACV,EAAO,cAAc,OAAO,CAAE,IAEzB;EACT;CACF,EAAE,GAGI,KAAqB,MAAuB;EAOhD,IALI,CAAC,KAKD,EAAK,UAAU,GACjB,OAAO,EAAK,IAAI;EAIlB,IAAI,EAAK,UAAU,GAAG;GACpB,IAAI,IAAmB;GAGvB,KAAK,IAAM,KAAO,MAAM,KAAK,EAAK,YAAY,GAAG;IAC/C,IAAM,IAAU,EAAY,SAAS;IAMrC,IAJI,EAAO,SAAS,cAAc,EAAO,QAAQ,KAC/C,EAAkB,CAAM,GAGtB,EAAK,YAAY,IAAI,CAAG,MAAM,EAAO,SAAS;KAChD,IAAmB;KAGnB;IACF;GACF;GAQA,OANA,EAAK,QAAQ,GAET,KAAoB,IACf,EAAK,IAAI,IAGX;EACT;EAEA,OAAO;CACT,GAEM,IAAoB;EACxB,IAAI,EAAO;EACX;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,cACS,EAAkB,CAAY;EAEvC,WAAW;GACT,IAAI,EAAO,oBAAoB,IAAI,CAAY,GAAG,MAAU,MAAM,0CAA0C;GAC5G,EAAO,oBAAoB,IAAI,CAAY;GAE3C,IAAM,IAAe,EAAO;GAC5B,EAAO,iBAAiB;GAIxB,IAAM,IAAU,IAAI,IAAI,CAAY;GACpC,EAAa,MAAM;GAEnB,IAAI;IACF,IAAM,IAAW,EAAG;IAGpB,EAAQ,SAAQ,MAAO;KACrB,IAAI,CAAC,EAAa,IAAI,CAAG,GAAG;MAC1B,IAAM,IAAa,EAAI,SAAS;MAEhC,AADI,EAAW,eAAa,EAAW,YAAY,OAAO,CAAY,GACtE,EAAY,OAAO,CAAG;KACxB;IACF,CAAC;IAGD,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;KAYvI,AAXA,IAAQ,GACR,KAEI,EAAO,OACT,EAAO,IAAI;MACT,MAAM;MACN,OAAO,KAAc,aAAa,EAAG,QAAQ,EAAa,GAAG;MAC7D,SAAS;OAAE,MAAM;OAAuB,IAAI;MAAS;KACvD,CAAC,GAGH,EAAY,SAAQ,MAAO;MACzB,IAAM,IAAS,EAAI,SAAS;MAC5B,AAAI,EAAO,SAAS,YAClB,EAAO,QAAQ,GACf,EAAO,UAAU,IACjB,EAAO,eAAe,IAAI,CAAG,KAEzB,EAAO,aAAW,EAAO,UAAU,CAAC;KAE5C,CAAC;IACH;IAIA,AAFA,IAAU,IACV,IAAQ,GACR,IAAgB;IAEhB,IAAI,IAAc;IAgBlB,OAfA,EAAa,SAAQ,MAAO;KAC1B,IAAM,IAAU,EAAI,SAAS;KAE7B,AADA,EAAY,IAAI,GAAK,EAAQ,OAAO,GAChC,EAAQ,UAAU,KAAA,KAAa,EAAQ,QAAQ,MAAa,IAAc,EAAQ;IACxF,CAAC,GAGD,EAAY,SAAQ,MAAO;KACzB,IAAM,IAAS,EAAI,SAAS;KAC5B,AAAI,EAAO,eACT,EAAO,YAAY,IAAI,GAAkB,CAAO;IAEpD,CAAC,GAED,EAAa,QAAQ,IAAc,GAC5B;GACT,UAAU;IAER,AADA,EAAO,iBAAiB,GACxB,EAAO,oBAAoB,OAAO,CAAY;GAChD;EACF;EACA,YAAY,MAAwB;GAC9B,KAAS,MAEb,IAAQ,GAER,EAAY,SAAQ,MAAO;IACzB,IAAM,IAAS,EAAI,SAAS;IAK5B,AAJI,EAAO,SAAS,aAClB,EAAO,UAAU,IACjB,EAAO,eAAe,IAAI,CAAG,IAE3B,EAAO,aACT,EAAO,UAAU,CAAC;GAEtB,CAAC;EACH;CACF,GAEM,IAAgC;EACpC,IAAI,QAAQ;GAgBV,OAdI,EAAO,kBAAkB,EAAO,mBAAmB,MACrD,EAAa,YAAY,IAAI,EAAO,cAAc,GAClD,EAAO,eAAe,aAAa,IAAI,CAAY,IAIrD,EAAkB,CAAY,GAG1B,EAAO,kBAAkB,EAAO,eAAe,eACjD,EAAO,eAAe,YAAY,IAAI,GAAkB,CAAO,GAI1D;EACT;EACA,IAAI,uBAAuB;GAAE,OAAO;EAAM;EAC1C,IAAI,UAAU;GAAE,OAAO;EAAQ;EAC/B,UAAU,GAAiC;GACzC,IAAM,IAAkB;IACtB,IAAI,EAAO;IACX,SAAS;IACT,OAAO;IACP,8BAAc,IAAI,IAAI;IACtB,MAAM;IACN,WAAW;KACL,OAAW,YACf,IAAI;MAAE,EAAG,EAAiB,KAAK;KAAE,SAAS,GAAK;MAAE,QAAQ,MAAM,CAAG;KAAE;IACtE;GACF;GAGA,OAFA,EAAa,YAAY,IAAI,CAAU,GACvC,EAAG,EAAiB,KAAK,SACZ;IAEX,AADA,EAAW,aAAa,IACxB,EAAa,YAAY,OAAO,CAAU;GAC5C;EACF;EACA,eAAe,GAA2B;GACxC,OAAQ,EAAyB,UAAU,CAAE;EAC/C;EACA,eAAe;GAMb,AALA,EAAa,YAAY,MAAM,GAC/B,EAAY,CAAY,GACxB,EAAO,cAAc,OAAO,CAAE,GAC9B,IAAU,IACV,IAAQ,GACR,IAAgB;EAClB;EACA,YAAY,GAA2B;GACrC,IAAM,IAAkB;IACtB,IAAI,EAAO;IACX,MAAM;IACN,KAAK;IACL,SAAS;GACX;GAEA,OADA,EAAa,YAAY,IAAI,CAAU,SAC1B;IACX,EAAY,OAAO,CAAU;GAC/B;EACF;CACF;CAUA,OARC,EAA0B,QAAQ,GAClC,EAA0B,cAAc,GACxC,EAA0B,eAAe,GAC1C,EAAiB,iBAAiB,IAAQ,GAC1C,EAAiB,OAAO,YACxB,EAAiB,YAAY,EAAa,IAAI,GAE9C,EAAO,cAAc,IAAI,GAAI,IAAI,QAAQ,CAAuB,CAAC,GAC1D;AACT"}
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 const cachedRef = engine.computedCache.get(fn)\n const existing = cachedRef?.deref()\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 // 0 = STABLE, 1 = CHECK, 2 = DIRTY\n\n const dependencies = new Set<any>()\n const depVersions = new Map<any, number>()\n\n // 🌳 ХРАНИЛИЩЕ ВНУТРЕННИХ ЭФФЕКТOВ ВЫЧИСЛЕНИЯ (Тест #242)\n const ownedEffects = new Set<any>()\n\n const releaseNode = (node: any): void => {\n if (!node) return\n const actNode = node._node || node\n if (actNode.dependencies && actNode.dependencies.size > 0) {\n const snapshotDeps = Array.from(actNode.dependencies)\n actNode.dependencies.clear()\n if (actNode.depVersions) actNode.depVersions.clear()\n\n snapshotDeps.forEach((dep: any) => {\n const rawDepNode = dep._node || dep\n if (rawDepNode.subscribers) {\n rawDepNode.subscribers.delete(actNode)\n rawDepNode.subscribers.delete(node)\n rawDepNode.subscribers.delete(computedNode)\n if (rawDepNode.type === 'computed' && rawDepNode.subscribers.size === 0) {\n releaseNode(rawDepNode)\n }\n }\n })\n }\n }\n\n const subscribers = new class extends Set<any> {\n override delete(val: any): boolean {\n const res = super.delete(val)\n if (this.size === 0) {\n state = 2\n isDirty = true\n isInitialized = false\n releaseNode(computedNode)\n engine.computedCache.delete(fn)\n }\n return res\n }\n }()\n\n // ⚡ КАНOНИЧЕСКИЙ АПДЕЙТЕР ГРАФА С АВТOМАТИЧЕСКИМ ПРЕPЫВАНИЕМ И СБРOСОМ ПАРАЛЛЕЛЬНЫХ ВЕТОК (Pull)\n const updateIfNecessary = (node: any): boolean => {\n // 1. Холодный старт (самый первый вызов в жизни узла)\n if (!isInitialized) {\n return node.run()\n }\n\n // 2. Если прилетел прямой dirty-флаг от сигнала — вычисляем сразу\n if (node.state === 2) {\n return node.run()\n }\n\n // 3. Phase ленивой проверки CHECK (1)\n if (node.state === 1) {\n let hasChangedParent = false\n let brokenAtIndex = -1\n const depsArray = Array.from(node.dependencies || [])\n\n // Последовательно опрашиваем родителей по одному\n for (let i = 0; i < depsArray.length; i++) {\n const dep = depsArray[i]\n const rawDep = (dep as any)._node || dep\n\n // Рекурсивно актуализируем родителя-computed\n if (rawDep.type === 'computed' && rawDep.state > 0) {\n updateIfNecessary(rawDep)\n }\n\n // Сверяем сохраненную версию ребра с актуальной версией родителя\n if (node.depVersions.get(dep) !== rawDep.version) {\n hasChangedParent = true\n brokenAtIndex = i // Запоминаем индекс, на котором произошел разрыв\n\n // 🎯 КАНOНИЧЕСКИЙ VALUE EQUALITY BREAK (Тест #193):\n // Родоначальник ветки b изменился! Прерываем опрос, чтобы не выполнять\n // мёртвую ветку (узел c) холосто.\n break\n }\n }\n\n // 🌳 СБРOС ПАРАЛЛЕЛЬНЫХ ВЕТВЕЙ ДЛЯ СИНХРOНИЗАЦИИ (Пример 201):\n // Если произошел досрочный break, все оставшиеся в списке родители,\n // до которых мы не успели дойти, могут остаться в зависшем состоянии state === 1.\n // Мы обязаны аккуратно сбросить их стейты в стабильный 0, чтобы они вовремя\n // среагировали на последующие асинхронные пуш-уведомления от макро-батчей!\n if (brokenAtIndex !== -1) {\n for (let j = brokenAtIndex + 1; j < depsArray.length; j++) {\n const untouchedDep = depsArray[j]\n const rawUntouched = (untouchedDep as any)._node || untouchedDep\n if (rawUntouched.type === 'computed' && rawUntouched.state === 1) {\n rawUntouched.state = 0 // Снимаем зависшую блокировку графа\n }\n }\n }\n\n // Намертво гасим стейт текущего узла в стабильный (0) ДО вызова run()\n node.state = 0\n\n if (hasChangedParent || isDirty) {\n return node.run() // Пересчитываем узел, что вызовет динамический diff и отписку\n }\n\n return false // Value Equality Cut\n }\n\n return false\n }\n\n const computedNode: any = {\n id: engine.subscriberId++,\n dependencies,\n subscribers,\n ownedEffects, // Экспортируем контекст владения для вложенных эффектов\n depth: 1,\n type: 'computed',\n fn,\n get version() { return version },\n get state() { return state },\n set state(val: number) { state = val },\n get depVersions() { return depVersions },\n update: () => updateIfNecessary(computedNode),\n run: () => {\n if (evaluatedInEpoch === engine.epoch && isInitialized) {\n return false\n }\n evaluatedInEpoch = engine.epoch\n\n if (engine.cycleDetectionStack.has(computedNode)) throw new Error('[Graph Error] Cyclic dependency detected')\n engine.cycleDetectionStack.add(computedNode)\n\n const prevConsumer = engine.activeConsumer\n const prevOwner = engine.activeOwner\n\n // Направляем контекст консьюмера и владения на текущий computed\n engine.activeConsumer = computedNode\n engine.activeOwner = computedNode\n\n const oldDeps = new Set(dependencies)\n dependencies.clear()\n\n try {\n // 🎯 ФИКС КЕЙСА #242: Перед запуском fn() принудительно очищаем\n // и уничтожаем все внутренние эффекты, созданные на предыдущем кадре оценки!\n ownedEffects.forEach(child => { if (child.dispose) child.dispose() })\n ownedEffects.clear()\n\n const newValue = fn()\n\n oldDeps.forEach(dep => {\n if (!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 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 subscribers.forEach(sub => {\n const rawSub = sub._node || sub\n if (rawSub.type === 'effect') {\n rawSub.state = 2\n rawSub.isDirty = true\n engine.pendingEffects.add(sub)\n } else if (rawSub.markDirty) {\n rawSub.markDirty(1)\n }\n })\n }\n\n isDirty = false\n state = 0\n isInitialized = true\n\n let maxDepDepth = 0\n dependencies.forEach(dep => {\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) maxDepDepth = rawNode.depth\n })\n\n subscribers.forEach(sub => {\n const rawSub = sub._node || sub\n if (rawSub.depVersions) {\n rawSub.depVersions.set(computedInstance, version)\n }\n })\n\n computedNode.depth = maxDepDepth + 1\n return changed\n } finally {\n engine.activeConsumer = prevConsumer\n engine.activeOwner = prevOwner\n engine.cycleDetectionStack.delete(computedNode)\n }\n },\n markDirty: (parentState: number) => {\n if (state >= parentState) return\n state = parentState\n\n subscribers.forEach(sub => {\n const rawSub = sub._node || sub\n if (rawSub.type === 'effect') {\n rawSub.isDirty = true\n engine.pendingEffects.add(sub)\n } else if (rawSub.markDirty) {\n rawSub.markDirty(1)\n }\n })\n }\n }\n\n const computedInstance: Computed<T> = {\n get value() {\n if (engine.activeConsumer && engine.activeConsumer !== computedNode) {\n computedNode.subscribers.add(engine.activeConsumer)\n engine.activeConsumer.dependencies.add(computedNode)\n }\n\n updateIfNecessary(computedNode)\n\n if (engine.activeConsumer && engine.activeConsumer.depVersions) {\n engine.activeConsumer.depVersions.set(computedInstance, version)\n }\n return value\n },\n get valueWithoutTracking() { return value },\n get version() { return version },\n subscribe(cb: (val: T) => void): CleanupFn {\n const fakeEffect: any = {\n id: engine.subscriberId++,\n isDirty: true,\n depth: 9999,\n dependencies: new Set(),\n type: 'effect',\n run: () => {\n if (fakeEffect.isDisposed) return\n try { cb(computedInstance.value) } catch (err) { console.error(err) }\n }\n }\n computedNode.subscribers.add(fakeEffect)\n cb(computedInstance.value)\n return () => {\n fakeEffect.isDisposed = true\n computedNode.subscribers.delete(fakeEffect)\n }\n },\n subscribeState(cb: () => void): CleanupFn {\n return (computedInstance as any).subscribe(cb)\n },\n destroy: () => {\n computedNode.subscribers.clear()\n releaseNode(computedNode)\n engine.computedCache.delete(fn)\n isDirty = true\n state = 2\n isInitialized = false\n },\n __subscribe(cb: () => void): CleanupFn {\n const hookEffect: any = {\n id: engine.subscriberId++,\n type: 'effect',\n run: cb,\n isDirty: false\n }\n computedNode.subscribers.add(hookEffect)\n return () => {\n subscribers.delete(hookEffect)\n }\n }\n } as any\n\n ;(computedInstance as any)._node = computedNode\n ;(computedInstance as any).subscribers = subscribers\n ;(computedInstance as any).dependencies = dependencies\n computedInstance._isDirty = () => state > 0\n computedInstance.type = 'computed'\n computedInstance.run = () => computedNode.run()\n\n engine.computedCache.set(fn, new WeakRef(computedInstance as any))\n return computedInstance\n}\n"],"mappings":";AAEA,SAAgB,EACd,GACA,GACA,GACa;CAEb,IAAM,IADY,EAAO,cAAc,IAAI,CAC1B,CAAA,EAAW,MAAM;CAClC,IAAI,GAAU,OAAO;CAErB,IAAI,GACA,IAAU,IACV,IAAU,GACV,IAAgB,IAChB,IAAmB,IACnB,IAAQ,GAEN,oBAAe,IAAI,IAAS,GAC5B,oBAAc,IAAI,IAAiB,GAGnC,oBAAe,IAAI,IAAS,GAE5B,KAAe,MAAoB;EACvC,IAAI,CAAC,GAAM;EACX,IAAM,IAAU,EAAK,SAAS;EAC9B,IAAI,EAAQ,gBAAgB,EAAQ,aAAa,OAAO,GAAG;GACzD,IAAM,IAAe,MAAM,KAAK,EAAQ,YAAY;GAIpD,AAHA,EAAQ,aAAa,MAAM,GACvB,EAAQ,eAAa,EAAQ,YAAY,MAAM,GAEnD,EAAa,SAAS,MAAa;IACjC,IAAM,IAAa,EAAI,SAAS;IAChC,AAAI,EAAW,gBACb,EAAW,YAAY,OAAO,CAAO,GACrC,EAAW,YAAY,OAAO,CAAI,GAClC,EAAW,YAAY,OAAO,CAAY,GACtC,EAAW,SAAS,cAAc,EAAW,YAAY,SAAS,KACpE,EAAY,CAAU;GAG5B,CAAC;EACH;CACF,GAEM,IAAc,IAAI,cAAc,IAAS;EAC7C,OAAgB,GAAmB;GACjC,IAAM,IAAM,MAAM,OAAO,CAAG;GAQ5B,OAPI,KAAK,SAAS,MAChB,IAAQ,GACR,IAAU,IACV,IAAgB,IAChB,EAAY,CAAY,GACxB,EAAO,cAAc,OAAO,CAAE,IAEzB;EACT;CACF,EAAE,GAGI,KAAqB,MAAuB;EAOhD,IALI,CAAC,KAKD,EAAK,UAAU,GACjB,OAAO,EAAK,IAAI;EAIlB,IAAI,EAAK,UAAU,GAAG;GACpB,IAAI,IAAmB,IACnB,IAAgB,IACd,IAAY,MAAM,KAAK,EAAK,gBAAgB,CAAC,CAAC;GAGpD,KAAK,IAAI,IAAI,GAAG,IAAI,EAAU,QAAQ,KAAK;IACzC,IAAM,IAAM,EAAU,IAChB,IAAU,EAAY,SAAS;IAQrC,IALI,EAAO,SAAS,cAAc,EAAO,QAAQ,KAC/C,EAAkB,CAAM,GAItB,EAAK,YAAY,IAAI,CAAG,MAAM,EAAO,SAAS;KAEhD,AADA,IAAmB,IACnB,IAAgB;KAKhB;IACF;GACF;GAOA,IAAI,MAAkB,IACpB,KAAK,IAAI,IAAI,IAAgB,GAAG,IAAI,EAAU,QAAQ,KAAK;IACzD,IAAM,IAAe,EAAU,IACzB,IAAgB,EAAqB,SAAS;IACpD,AAAI,EAAa,SAAS,cAAc,EAAa,UAAU,MAC7D,EAAa,QAAQ;GAEzB;GAUF,OANA,EAAK,QAAQ,GAET,KAAoB,IACf,EAAK,IAAI,IAGX;EACT;EAEA,OAAO;CACT,GAEM,IAAoB;EACxB,IAAI,EAAO;EACX;EACA;EACA;EACA,OAAO;EACP,MAAM;EACN;EACA,IAAI,UAAU;GAAE,OAAO;EAAQ;EAC/B,IAAI,QAAQ;GAAE,OAAO;EAAM;EAC3B,IAAI,MAAM,GAAa;GAAE,IAAQ;EAAI;EACrC,IAAI,cAAc;GAAE,OAAO;EAAY;EACvC,cAAc,EAAkB,CAAY;EAC5C,WAAW;GACT,IAAI,MAAqB,EAAO,SAAS,GACvC,OAAO;GAIT,IAFA,IAAmB,EAAO,OAEtB,EAAO,oBAAoB,IAAI,CAAY,GAAG,MAAU,MAAM,0CAA0C;GAC5G,EAAO,oBAAoB,IAAI,CAAY;GAE3C,IAAM,IAAe,EAAO,gBACtB,IAAY,EAAO;GAIzB,AADA,EAAO,iBAAiB,GACxB,EAAO,cAAc;GAErB,IAAM,IAAU,IAAI,IAAI,CAAY;GACpC,EAAa,MAAM;GAEnB,IAAI;IAIF,AADA,EAAa,SAAQ,MAAS;KAAE,AAAI,EAAM,WAAS,EAAM,QAAQ;IAAE,CAAC,GACpE,EAAa,MAAM;IAEnB,IAAM,IAAW,EAAG;IAEpB,EAAQ,SAAQ,MAAO;KACrB,IAAI,CAAC,EAAa,IAAI,CAAG,GAAG;MAC1B,IAAM,IAAa,EAAI,SAAS;MAEhC,AADI,EAAW,eAAa,EAAW,YAAY,OAAO,CAAY,GACtE,EAAY,OAAO,CAAG;KACxB;IACF,CAAC;IAED,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;KAYvI,AAXA,IAAQ,GACR,KAEI,EAAO,OAAO,KAChB,EAAO,IAAI;MACT,MAAM;MACN,OAAO;MACP,SAAS;OAAE,MAAM;OAAuB,IAAI;MAAS;KACvD,CAAC,GAGH,EAAY,SAAQ,MAAO;MACzB,IAAM,IAAS,EAAI,SAAS;MAC5B,AAAI,EAAO,SAAS,YAClB,EAAO,QAAQ,GACf,EAAO,UAAU,IACjB,EAAO,eAAe,IAAI,CAAG,KACpB,EAAO,aAChB,EAAO,UAAU,CAAC;KAEtB,CAAC;IACH;IAIA,AAFA,IAAU,IACV,IAAQ,GACR,IAAgB;IAEhB,IAAI,IAAc;IAgBlB,OAfA,EAAa,SAAQ,MAAO;KAC1B,IAAM,IAAU,EAAI,SAAS;KAG7B,AAFA,EAAY,IAAI,GAAK,EAAQ,OAAO,GAChC,EAAQ,eAAa,EAAQ,YAAY,IAAI,CAAY,GACzD,EAAQ,UAAU,KAAA,KAAa,EAAQ,QAAQ,MAAa,IAAc,EAAQ;IACxF,CAAC,GAED,EAAY,SAAQ,MAAO;KACzB,IAAM,IAAS,EAAI,SAAS;KAC5B,AAAI,EAAO,eACT,EAAO,YAAY,IAAI,GAAkB,CAAO;IAEpD,CAAC,GAED,EAAa,QAAQ,IAAc,GAC5B;GACT,UAAU;IAGR,AAFA,EAAO,iBAAiB,GACxB,EAAO,cAAc,GACrB,EAAO,oBAAoB,OAAO,CAAY;GAChD;EACF;EACA,YAAY,MAAwB;GAC9B,KAAS,MACb,IAAQ,GAER,EAAY,SAAQ,MAAO;IACzB,IAAM,IAAS,EAAI,SAAS;IAC5B,AAAI,EAAO,SAAS,YAClB,EAAO,UAAU,IACjB,EAAO,eAAe,IAAI,CAAG,KACpB,EAAO,aAChB,EAAO,UAAU,CAAC;GAEtB,CAAC;EACH;CACF,GAEM,IAAgC;EACpC,IAAI,QAAQ;GAWV,OAVI,EAAO,kBAAkB,EAAO,mBAAmB,MACrD,EAAa,YAAY,IAAI,EAAO,cAAc,GAClD,EAAO,eAAe,aAAa,IAAI,CAAY,IAGrD,EAAkB,CAAY,GAE1B,EAAO,kBAAkB,EAAO,eAAe,eACjD,EAAO,eAAe,YAAY,IAAI,GAAkB,CAAO,GAE1D;EACT;EACA,IAAI,uBAAuB;GAAE,OAAO;EAAM;EAC1C,IAAI,UAAU;GAAE,OAAO;EAAQ;EAC/B,UAAU,GAAiC;GACzC,IAAM,IAAkB;IACtB,IAAI,EAAO;IACX,SAAS;IACT,OAAO;IACP,8BAAc,IAAI,IAAI;IACtB,MAAM;IACN,WAAW;KACL,OAAW,YACf,IAAI;MAAE,EAAG,EAAiB,KAAK;KAAE,SAAS,GAAK;MAAE,QAAQ,MAAM,CAAG;KAAE;IACtE;GACF;GAGA,OAFA,EAAa,YAAY,IAAI,CAAU,GACvC,EAAG,EAAiB,KAAK,SACZ;IAEX,AADA,EAAW,aAAa,IACxB,EAAa,YAAY,OAAO,CAAU;GAC5C;EACF;EACA,eAAe,GAA2B;GACxC,OAAQ,EAAyB,UAAU,CAAE;EAC/C;EACA,eAAe;GAMb,AALA,EAAa,YAAY,MAAM,GAC/B,EAAY,CAAY,GACxB,EAAO,cAAc,OAAO,CAAE,GAC9B,IAAU,IACV,IAAQ,GACR,IAAgB;EAClB;EACA,YAAY,GAA2B;GACrC,IAAM,IAAkB;IACtB,IAAI,EAAO;IACX,MAAM;IACN,KAAK;IACL,SAAS;GACX;GAEA,OADA,EAAa,YAAY,IAAI,CAAU,SAC1B;IACX,EAAY,OAAO,CAAU;GAC/B;EACF;CACF;CAUA,OARC,EAA0B,QAAQ,GAClC,EAA0B,cAAc,GACxC,EAA0B,eAAe,GAC1C,EAAiB,iBAAiB,IAAQ,GAC1C,EAAiB,OAAO,YACxB,EAAiB,YAAY,EAAa,IAAI,GAE9C,EAAO,cAAc,IAAI,GAAI,IAAI,QAAQ,CAAuB,CAAC,GAC1D;AACT"}