@but212/atom-effect 0.20.0 → 0.21.1

package/README.md

@@ -2,6 +2,7 @@
 
 [![npm version](https://img.shields.io/npm/v/@but212/atom-effect.svg)](https://www.npmjs.com/package/@but212/atom-effect)
 [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+![ES2021+](https://img.shields.io/badge/target-ES2021%2B-blue)
 
 ## Quick Start
 

package/dist/atom-effect.min.js

@@ -1,2 +1,2 @@
-(function(h,E){typeof exports=="object"&&typeof module<"u"?E(exports):typeof define=="function"&&define.amd?define(["exports"],E):(h=typeof globalThis<"u"?globalThis:h||self,E(h.AtomEffect={}))})(this,(function(h){"use strict";const E={IDLE:"idle",PENDING:"pending",RESOLVED:"resolved",REJECTED:"rejected"},_={DISPOSED:1,EXECUTING:8},X={DISPOSED:1,IS_COMPUTED:2,DIRTY:8,IDLE:16,PENDING:32,RESOLVED:64,REJECTED:128,RECOMPUTING:256,HAS_ERROR:512},p={DISPOSED:1,SYNC:8,NOTIFICATION_SCHEDULED:16},nt={MAX_SIZE:1e3,WARMUP_SIZE:100,ENABLE_STATS:!1},I={MAX_EXECUTIONS_PER_SECOND:1e3,MAX_EXECUTIONS_PER_EFFECT:100,MAX_EXECUTIONS_PER_FLUSH:1e4,MAX_FLUSH_ITERATIONS:1e3,MIN_FLUSH_ITERATIONS:10,CLEANUP_THRESHOLD:1e3,BATCH_QUEUE_SHRINK_THRESHOLD:1e3},Q={WARN_INFINITE_LOOP:!0},w=1073741823,l=typeof process<"u"&&process.env&&process.env.NODE_ENV!=="production"||typeof __DEV__<"u"&&!!__DEV__,rt=Object.freeze([]);class T extends Error{constructor(t,e=null,s=!0){super(t),this.cause=e,this.recoverable=s,this.name="AtomError"}}class d extends T{constructor(t,e=null){super(t,e,!0),this.name="ComputedError"}}class g extends T{constructor(t,e=null){super(t,e,!1),this.name="EffectError"}}class k extends T{constructor(t,e=null){super(t,e,!1),this.name="SchedulerError"}}const j=Symbol("AtomEffect.DebugName"),ot=Symbol("AtomEffect.Id"),Y=Symbol("AtomEffect.Type"),P=Symbol("AtomEffect.NoDefaultValue"),ht=i=>"dependencies"in i&&Array.isArray(i.dependencies);function q(i,t,e){if(i===t)throw new d("Circular dependency detected: The computation refers to itself explicitly or implicitly.");if(!e.has(i.id)&&(e.add(i.id),ht(i))){const s=i.dependencies;for(let n=0;n<s.length;n++){const r=s[n];r&&q(r,t,e)}}}const S={enabled:l,warnInfiniteLoop:Q.WARN_INFINITE_LOOP,warn(i,t){l&&this.enabled&&i&&console.warn(`[Atom Effect] ${t}`)},checkCircular(i,t){if(i===t)throw new d("Direct circular dependency detected");l&&this.enabled&&q(i,t,new Set)},attachDebugInfo(i,t,e){if(!l||!this.enabled)return;const s=i;s[j]=`${t}_${e}`,s[ot]=e,s[Y]=t},getDebugName:i=>i?.[j],getDebugType:i=>i?.[Y]};let ct=1;const ut=()=>ct++;function $(i,t,e){if(typeof t=="function"){const n=t;for(let r=0,o=e.length;r<o;r++){const c=e[r];if(c&&c.fn===n)return}e.push(new M(n,void 0));return}if("addDependency"in t){t.addDependency(i);return}const s=t;for(let n=0,r=e.length;n<r;n++){const o=e[n];if(o&&o.sub===s)return}e.push(new M(void 0,s))}function K(i,t,e){const s=new Map;for(let n=0,r=t.length;n<r;n++){const o=t[n];o?.unsub&&s.set(o.node,o.unsub)}for(let n=0,r=i.length;n<r;n++){const o=i[n];if(!o)continue;const c=o.node,C=s.get(c);C!==void 0?(o.unsub=C,s.delete(c)):(S.checkCircular(c,e),o.unsub=c.subscribe(e))}for(const n of s.values())n()}class F{constructor(t,e,s=void 0){this.node=t,this.version=e,this.unsub=s}}class M{constructor(t,e){this.fn=t,this.sub=e}}const u={COMPUTED_MUST_BE_FUNCTION:"Computed target must be a function",COMPUTED_ASYNC_PENDING_NO_DEFAULT:"Async computation pending with no default value",COMPUTED_COMPUTATION_FAILED:"Computation execution failed",COMPUTED_ASYNC_COMPUTATION_FAILED:"Async computation execution failed",COMPUTED_CIRCULAR_DEPENDENCY:"Circular dependency detected",COMPUTED_DISPOSED:"Attempted to access disposed computed",ATOM_SUBSCRIBER_MUST_BE_FUNCTION:"Subscriber must be a function or Subscriber object",ATOM_INDIVIDUAL_SUBSCRIBER_FAILED:"Subscriber execution failed",EFFECT_MUST_BE_FUNCTION:"Effect target must be a function",EFFECT_EXECUTION_FAILED:"Effect execution failed",EFFECT_CLEANUP_FAILED:"Effect cleanup failed",EFFECT_DISPOSED:"Attempted to run disposed effect",SCHEDULER_FLUSH_OVERFLOW:(i,t)=>`Maximum flush iterations (${i}) exceeded. ${t} jobs dropped. Possible infinite loop.`,CALLBACK_ERROR_IN_ERROR_HANDLER:"Exception encountered in onError handler",EFFECT_FREQUENCY_LIMIT_EXCEEDED:"Effect executed too frequently within 1 second. Suspected infinite loop."};function O(i,t,e){if(i instanceof T)return i;const s=i instanceof Error,n=s?i.message:String(i),r=s?i:void 0,c=`${s?i.constructor.name:"Unexpected error"} (${e}): ${n}`;return new t(c,r)}class W{constructor(){this.flags=0,this.version=0,this._lastSeenEpoch=-1,this.id=ut()&w}}class J extends W{subscribe(t){const e=typeof t=="function";if(!e&&(!t||typeof t.execute!="function"))throw O(new TypeError("Invalid subscriber"),T,u.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);const s=this._subscribers;for(let r=0,o=s.length;r<o;r++){const c=s[r];if(c&&(e?c.fn===t:c.sub===t))return l&&console.warn("Duplicate subscription ignored."),()=>{}}const n=new M(e?t:void 0,e?void 0:t);return s.push(n),()=>this._unsubscribe(n)}_unsubscribe(t){const e=this._subscribers,s=e.indexOf(t);if(s===-1)return;const n=e.pop();s<e.length&&n&&(e[s]=n)}subscriberCount(){return this._subscribers.length}_notifySubscribers(t,e){if(this._subscribers.length===0)return;const s=this._subscribers.slice(0),n=s.length;for(let r=0;r<n;r++){const o=s[r];if(o)try{o.fn?o.fn(t,e):o.sub&&o.sub.execute()}catch(c){this._handleNotifyError(c)}}}_handleNotifyError(t){console.error(O(t,T,u.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED))}}let B=0;const z=()=>(B=B+1&w||1,B),V=i=>i+1&w;let H=0,R=!1,Z=0;const lt=()=>Z;function tt(){return R?(l&&console.warn("startFlush() called during flush - ignored"),!1):(R=!0,Z=z(),H=0,!0)}const et=()=>{R=!1},_t=()=>R?++H:0;class at{constructor(){this._queueBuffer=[[],[]],this._bufferIndex=0,this._size=0,this._epoch=0,this._isProcessing=!1,this._isBatching=!1,this._isFlushingSync=!1,this._batchDepth=0,this._batchQueue=[],this._batchQueueSize=0,this._maxFlushIterations=I.MAX_FLUSH_ITERATIONS,this.onOverflow=null,this._boundRunLoop=this._runLoop.bind(this)}get phase(){return this._isProcessing||this._isFlushingSync?2:this._isBatching?1:0}get queueSize(){return this._size}get isBatching(){return this._isBatching}schedule(t){if(l&&typeof t!="function")throw new k("Scheduler callback must be a function");if(t._nextEpoch!==this._epoch){if(t._nextEpoch=this._epoch,this._isBatching||this._isFlushingSync){this._batchQueue[this._batchQueueSize++]=t;return}this._queueBuffer[this._bufferIndex][this._size++]=t,this._isProcessing||this._flush()}}_flush(){this._isProcessing||this._size===0||(this._isProcessing=!0,queueMicrotask(this._boundRunLoop))}_runLoop(){try{if(this._size===0)return;const t=tt();this._drainQueue(),t&&et()}finally{this._isProcessing=!1,this._size>0&&!this._isBatching&&this._flush()}}_flushSync(){this._isFlushingSync=!0;const t=tt();try{this._mergeBatchQueue(),this._drainQueue()}finally{this._isFlushingSync=!1,t&&et()}}_mergeBatchQueue(){if(this._batchQueueSize===0)return;const t=++this._epoch,e=this._batchQueue,s=this._queueBuffer[this._bufferIndex];let n=this._size;for(let r=0;r<this._batchQueueSize;r++){const o=e[r];o._nextEpoch!==t&&(o._nextEpoch=t,s[n++]=o)}this._size=n,this._batchQueueSize=0,e.length>I.BATCH_QUEUE_SHRINK_THRESHOLD&&(e.length=0)}_drainQueue(){let t=0;for(;this._size>0;){if(++t>this._maxFlushIterations){this._handleFlushOverflow();return}this._processQueue(),this._mergeBatchQueue()}}_processQueue(){const t=this._bufferIndex,e=this._queueBuffer[t],s=this._size;this._bufferIndex=t^1,this._size=0,this._epoch++;for(let n=0;n<s;n++)try{e[n]()}catch(r){console.error(new k("Error occurred during scheduler execution",r))}e.length=0}_handleFlushOverflow(){const t=this._size+this._batchQueueSize;if(console.error(new k(u.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations,t))),this._size=0,this._queueBuffer[this._bufferIndex].length=0,this._batchQueueSize=0,this.onOverflow)try{this.onOverflow(t)}catch{}}startBatch(){this._batchDepth++,this._isBatching=!0}endBatch(){if(this._batchDepth===0){l&&console.warn("endBatch() called without matching startBatch(). Ignoring.");return}--this._batchDepth===0&&(this._flushSync(),this._isBatching=!1)}setMaxFlushIterations(t){if(t<I.MIN_FLUSH_ITERATIONS)throw new k(`Max flush iterations must be at least ${I.MIN_FLUSH_ITERATIONS}`);this._maxFlushIterations=t}}const y=new at,f={current:null,run(i,t){const e=this.current;this.current=i;try{return t()}finally{this.current=e}}};function ft(i){const t=f.current;if(t===null)return i();f.current=null;try{return i()}finally{f.current=t}}class Et extends J{constructor(t,e){super(),this._pendingOldValue=void 0,this._notifyTask=void 0,this._subscribers=[],this._value=t,e&&(this.flags|=p.SYNC),S.attachDebugInfo(this,"atom",this.id)}get value(){const t=f.current;return t&&$(this,t,this._subscribers),this._value}set value(t){const e=this._value;if(Object.is(e,t))return;this._value=t,this.version=V(this.version);const s=this.flags;if(!(this._subscribers.length===0||s&p.NOTIFICATION_SCHEDULED)){if(this._pendingOldValue=e,this.flags=s|p.NOTIFICATION_SCHEDULED,s&p.SYNC&&!y.isBatching){this._flushNotifications();return}this._notifyTask||(this._notifyTask=()=>this._flushNotifications()),y.schedule(this._notifyTask)}}_flushNotifications(){const t=this.flags;if(!(t&p.NOTIFICATION_SCHEDULED)||t&p.DISPOSED)return;const e=this._pendingOldValue;this._pendingOldValue=void 0,this.flags&=-17,this._notifySubscribers(this._value,e)}peek(){return this._value}dispose(){this.flags&p.DISPOSED||(this._subscribers.length=0,this.flags|=p.DISPOSED,this._value=void 0,this._pendingOldValue=void 0,this._notifyTask=void 0)}}function dt(i,t={}){return new Et(i,t.sync??!1)}class pt{constructor(t=50,e=256,s=!1){this.limit=t,this.capacity=e,this.pool=[],this.stats=null,this.stats=l||s?{acquired:0,released:0,rejected:{frozen:0,tooLarge:0,poolFull:0}}:null}acquire(){return this.stats&&this.stats.acquired++,this.pool.pop()??[]}release(t,e){if(!(e&&t===e)){if(t.length>this.capacity){this.stats&&this.stats.rejected.tooLarge++;return}if(this.pool.length>=this.limit){this.stats&&this.stats.rejected.poolFull++;return}if(Object.isFrozen(t)){this.stats&&this.stats.rejected.frozen++;return}t.length=0,this.pool.push(t),this.stats&&this.stats.released++}}getStats(){if(!this.stats)return null;const{acquired:t,released:e,rejected:s}=this.stats,n=t-e-(s.frozen+s.tooLarge+s.poolFull);return{acquired:t,released:e,rejected:{...s},leaked:n,poolSize:this.pool.length}}reset(){this.pool.length=0,this.stats&&(this.stats={acquired:0,released:0,rejected:{frozen:0,tooLarge:0,poolFull:0}})}}const a=Object.freeze([]),D=new pt;function st(i){return i!==null&&typeof i=="object"&&"value"in i&&typeof i.subscribe=="function"}function It(i){return st(i)&&typeof i.invalidate=="function"}function gt(i){return i!==null&&typeof i=="object"&&typeof i.dispose=="function"&&typeof i.run=="function"}function it(i){return i!==null&&typeof i=="object"&&typeof i.then=="function"}const St=3,Dt=Number.MAX_SAFE_INTEGER-1,{IDLE:U,DIRTY:A,PENDING:x,RESOLVED:b,REJECTED:m,HAS_ERROR:v,RECOMPUTING:L,DISPOSED:G,IS_COMPUTED:Ct}=X;function Tt(i){return i&b?E.RESOLVED:i&x?E.PENDING:i&m?E.REJECTED:E.IDLE}class bt extends J{constructor(t,e={}){if(typeof t!="function")throw new d(u.COMPUTED_MUST_BE_FUNCTION);super(),this._error=null,this._promiseId=0,this._subscribers=[],this._links=a,this._asyncStartAggregateVersion=0,this._asyncRetryCount=0,this._trackEpoch=-1,this._trackLinks=a,this._trackCount=0,this._value=void 0,this.flags=Ct|A|U,this._equal=e.equal??Object.is,this._fn=t,this._defaultValue="defaultValue"in e?e.defaultValue:P,this._onError=e.onError??null;const s=e.maxAsyncRetries;if(this._maxAsyncRetries=s!=null&&s>=0?s:St,S.attachDebugInfo(this,"computed",this.id),e.lazy===!1)try{this._recompute()}catch{}}_track(){const t=f.current;t&&$(this,t,this._subscribers)}get value(){this._track();const t=this.flags;if((t&(b|A|U))===b)return this._value;if(t&G)throw new d(u.COMPUTED_DISPOSED);if(t&L){if(this._defaultValue!==P)return this._defaultValue;throw new d(u.COMPUTED_CIRCULAR_DEPENDENCY)}if(t&(A|U)&&(this._recompute(),this.flags&b))return this._value;const e=this._defaultValue,s=e!==P;if(this.flags&x){if(s)return e;throw new d(u.COMPUTED_ASYNC_PENDING_NO_DEFAULT)}if(this.flags&m){if(this._error?.recoverable&&s)return e;throw this._error}return this._value}peek(){return this._value}get state(){return this._track(),Tt(this.flags)}get hasError(){if(this._track(),this.flags&(m|v))return!0;const t=this._links;for(let e=0,s=t.length;e<s;e++){const n=t[e]?.node;if(n&&n.flags&v)return!0}return!1}get isValid(){return!this.hasError}get errors(){if(this._track(),!this.hasError)return rt;const t=[];this._error&&t.push(this._error);const e=this._links;for(let s=0,n=e.length;s<n;s++){const r=e[s].node;if(r.flags&v){const o=r;if(o.errors){const c=o.errors;for(let C=0;C<c.length;C++){const N=c[C];N&&t.indexOf(N)===-1&&t.push(N)}}}}return Object.freeze(t)}get lastError(){return this._track(),this._error}get isPending(){return this._track(),(this.flags&x)!==0}get isResolved(){return this._track(),(this.flags&b)!==0}invalidate(){this._markDirty()}dispose(){if(this.flags&G)return;const t=this._links;if(t!==a){for(let e=0,s=t.length;e<s;e++)t[e].unsub?.();D.release(t),this._links=a}this._subscribers.length=0,this.flags=G|A|U,this._error=null,this._value=void 0}addDependency(t){if(t._lastSeenEpoch!==this._trackEpoch){if(t._lastSeenEpoch=this._trackEpoch,this._trackCount<this._trackLinks.length){const e=this._trackLinks[this._trackCount];e.node=t,e.version=t.version}else this._trackLinks.push(new F(t,t.version));this._trackCount++}}_recompute(){if(this.flags&L)return;this.flags|=L;const t=this._links;this._trackEpoch=z(),this._trackLinks=D.acquire(),this._trackCount=0;let e=!1;try{const s=f.run(this,this._fn);this._trackLinks.length=this._trackCount,K(this._trackLinks,t,this),this._links=this._trackLinks,e=!0,it(s)?this._handleAsyncComputation(s):this._finalizeResolution(s)}catch(s){if(!e)try{this._trackLinks.length=this._trackCount,K(this._trackLinks,t,this),this._links=this._trackLinks,e=!0}catch(n){l&&console.warn("[atom-effect] _commitDeps failed during error recovery:",n)}this._handleError(s,u.COMPUTED_COMPUTATION_FAILED,!0)}finally{e&&t!==a?D.release(t):e||D.release(this._trackLinks),this._trackEpoch=-1,this._trackLinks=a,this._trackCount=0,this.flags&=~L}}_handleAsyncComputation(t){this.flags=(this.flags|x)&-217,this._notifySubscribers(void 0,void 0),this._asyncStartAggregateVersion=this._captureVersionSnapshot(),this._asyncRetryCount=0,this._promiseId=(this._promiseId+1)%Dt;const e=this._promiseId;t.then(s=>{if(e===this._promiseId){if(this._captureVersionSnapshot()!==this._asyncStartAggregateVersion)return this._asyncRetryCount++<this._maxAsyncRetries?this._markDirty():this._handleError(new d(`Async drift threshold exceeded after ${this._maxAsyncRetries} retries.`),u.COMPUTED_ASYNC_COMPUTATION_FAILED);this._finalizeResolution(s),this._notifySubscribers(s,void 0)}},s=>e===this._promiseId&&this._handleError(s,u.COMPUTED_ASYNC_COMPUTATION_FAILED))}_captureVersionSnapshot(){let t=0;const e=this._links;for(let s=0,n=e.length;s<n;s++)t+=e[s].node.version;return t}_handleError(t,e,s=!1){const n=O(t,d,e);if(!s&&!(this.flags&m)&&(this.version=V(this.version)),this._error=n,this.flags=this.flags&-121|m|v,this._onError)try{this._onError(n)}catch(r){console.error(u.CALLBACK_ERROR_IN_ERROR_HANDLER,r)}if(s)throw n;this._notifySubscribers(void 0,void 0)}_finalizeResolution(t){(!(this.flags&b)||!this._equal(this._value,t))&&(this.version=V(this.version)),this._value=t,this._error=null,this.flags=(this.flags|b)&-697}execute(){this._markDirty()}_markDirty(){this.flags&(L|A)||(this.flags|=A,this._notifySubscribers(void 0,void 0))}}function Ot(i,t={}){return new bt(i,t)}class yt extends W{constructor(t,e={}){super(),this._cleanup=null,this._links=a,this._nextLinks=null,this._prevLinks=null,this._currentEpoch=-1,this._lastFlushEpoch=-1,this._executionsInEpoch=0,this._executionCount=0,this._windowStart=0,this._windowCount=0,this._execId=0,this._fn=t,this._onError=e.onError??null,this._sync=e.sync??!1,this._maxExecutions=e.maxExecutionsPerSecond??I.MAX_EXECUTIONS_PER_SECOND,this._maxExecutionsPerFlush=e.maxExecutionsPerFlush??I.MAX_EXECUTIONS_PER_EFFECT,this._trackModifications=e.trackModifications??!1,S.attachDebugInfo(this,"effect",this.id)}run(){if(this.flags&_.DISPOSED)throw new g(u.EFFECT_DISPOSED);this.execute(!0)}dispose(){this.flags&_.DISPOSED||(this.flags|=_.DISPOSED,this._execCleanup(),this._unsubLinks(this._links),this._links!==a&&D.release(this._links),this._links=a,this._executeTask=void 0)}addDependency(t){if(!(this.flags&_.EXECUTING)||t._lastSeenEpoch===this._currentEpoch)return;t._lastSeenEpoch=this._currentEpoch;const e=this._nextLinks,s=this._prevLinks;if(s)for(let n=0,r=s.length;n<r;n++){const o=s[n];if(o&&o.node===t&&o.unsub){e.push(new F(t,t.version,o.unsub)),o.unsub=void 0;return}}try{const n=t.subscribe(()=>{if(this._trackModifications&&this.flags&_.EXECUTING&&(t._modifiedAtEpoch=this._currentEpoch),this._sync)return this.execute();this._executeTask||(this._executeTask=()=>this.execute()),y.schedule(this._executeTask)});e.push(new F(t,t.version,n))}catch(n){const r=O(n,g,u.EFFECT_EXECUTION_FAILED);if(console.error(r),this._onError)try{this._onError(r)}catch{}e.push(new F(t,t.version,void 0))}}execute(t=!1){if(this.flags&(_.DISPOSED|_.EXECUTING)||!t&&this._links.length>0&&!this._isDirty())return;this._checkInfiniteLoops(),this.flags|=_.EXECUTING,this._execCleanup();const e=this._links;this._prevLinks=e!==a?e:null;const s=D.acquire();this._nextLinks=s,this._currentEpoch=z();let n=!1;try{const r=f.run(this,this._fn);if(this._links=s,n=!0,this._trackModifications&&S.enabled){const o=this._currentEpoch;for(let c=0,C=s.length;c<C;c++){const N=s[c].node;N._modifiedAtEpoch===o&&S.warn(!0,`Effect is reading a dependency (${S.getDebugName(N)||"unknown"}) that it just modified. Infinite loop may occur`)}}it(r)?this._handleAsyncResult(r):this._cleanup=typeof r=="function"?r:null}catch(r){n=!0,this._handleExecutionError(r),this._cleanup=null}finally{this._finalizeDependencies(n,e,s),this.flags&=-9}}_handleAsyncResult(t){const e=++this._execId;t.then(s=>{if(e!==this._execId||this.flags&_.DISPOSED){if(typeof s=="function")try{s()}catch(n){this._handleExecutionError(n,u.EFFECT_CLEANUP_FAILED)}return}typeof s=="function"&&(this._cleanup=s)},s=>e===this._execId&&this._handleExecutionError(s))}_finalizeDependencies(t,e,s){if(this._nextLinks=null,t){const n=this._prevLinks;if(n)for(let r=0,o=n.length;r<o;r++)n[r]?.unsub?.();e!==a&&D.release(e)}else this._unsubLinks(s),D.release(s);this._prevLinks=null}_unsubLinks(t){for(let e=0,s=t.length;e<s;e++)t[e]?.unsub?.()}_isDirty(){const t=this._links,e=f.current;f.current=null;try{for(let s=0,n=t.length;s<n;s++){const r=t[s],o=r.node;if(o.flags&X.IS_COMPUTED)try{o.value}catch{return l&&console.warn(`[atom-effect] Dependency #${o.id} threw during dirty check`),!0}if(o.version!==r.version)return!0}return!1}finally{f.current=e}}_execCleanup(){if(this._cleanup){try{this._cleanup()}catch(t){this._handleExecutionError(t,u.EFFECT_CLEANUP_FAILED)}this._cleanup=null}}_checkInfiniteLoops(){const t=lt();if(this._lastFlushEpoch!==t&&(this._lastFlushEpoch=t,this._executionsInEpoch=0),++this._executionsInEpoch>this._maxExecutionsPerFlush&&this._throwInfiniteLoopError("per-effect"),_t()>I.MAX_EXECUTIONS_PER_FLUSH&&this._throwInfiniteLoopError("global"),this._executionCount++,l&&Number.isFinite(this._maxExecutions)){const e=Date.now();if(e-this._windowStart>=1e3)this._windowStart=e,this._windowCount=1;else if(++this._windowCount>this._maxExecutions){const s=new g(u.EFFECT_FREQUENCY_LIMIT_EXCEEDED);throw this.dispose(),this._handleExecutionError(s),s}}}get isDisposed(){return(this.flags&_.DISPOSED)!==0}get executionCount(){return this._executionCount}get isExecuting(){return(this.flags&_.EXECUTING)!==0}_throwInfiniteLoopError(t){const e=new g(`Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${H}`);throw this.dispose(),console.error(e),e}_handleExecutionError(t,e=u.EFFECT_EXECUTION_FAILED){const s=O(t,g,e);if(console.error(s),this._onError)try{this._onError(s)}catch(n){console.error(O(n,g,u.CALLBACK_ERROR_IN_ERROR_HANDLER))}}}function At(i,t={}){if(typeof i!="function")throw new g(u.EFFECT_MUST_BE_FUNCTION);const e=new yt(i,t);return e.execute(),e}function Nt(i){if(typeof i!="function")throw new TypeError("Batch callback must be a function");y.startBatch();try{return i()}finally{y.endBatch()}}h.AsyncState=E,h.AtomError=T,h.ComputedError=d,h.DEBUG_CONFIG=Q,h.DEBUG_RUNTIME=S,h.EffectError=g,h.POOL_CONFIG=nt,h.SCHEDULER_CONFIG=I,h.SchedulerError=k,h.atom=dt,h.batch=Nt,h.computed=Ot,h.effect=At,h.isAtom=st,h.isComputed=It,h.isEffect=gt,h.scheduler=y,h.untracked=ft,Object.defineProperty(h,Symbol.toStringTag,{value:"Module"})}));
+(function(c,E){typeof exports=="object"&&typeof module<"u"?E(exports):typeof define=="function"&&define.amd?define(["exports"],E):(c=typeof globalThis<"u"?globalThis:c||self,E(c.AtomEffect={}))})(this,(function(c){"use strict";const E={IDLE:"idle",PENDING:"pending",RESOLVED:"resolved",REJECTED:"rejected"},a={DISPOSED:1,EXECUTING:8},$={DISPOSED:1,IS_COMPUTED:2,DIRTY:8,IDLE:16,PENDING:32,RESOLVED:64,REJECTED:128,RECOMPUTING:256,HAS_ERROR:512},p={DISPOSED:1,SYNC:8,NOTIFICATION_SCHEDULED:16},Et={MAX_SIZE:1e3,WARMUP_SIZE:100,ENABLE_STATS:!1},S={MAX_EXECUTIONS_PER_SECOND:1e3,MAX_EXECUTIONS_PER_EFFECT:100,MAX_EXECUTIONS_PER_FLUSH:1e4,MAX_FLUSH_ITERATIONS:1e3,MIN_FLUSH_ITERATIONS:10,BATCH_QUEUE_SHRINK_THRESHOLD:1e3},P={WARN_INFINITE_LOOP:!0,EFFECT_FREQUENCY_WINDOW:1e3},q={MAX_ASYNC_RETRIES:3,MAX_PROMISE_ID:Number.MAX_SAFE_INTEGER-1},v=1073741823,l=typeof process<"u"&&process.env&&process.env.NODE_ENV!=="production"||typeof __DEV__<"u"&&!!__DEV__,dt=Object.freeze([]);class T extends Error{constructor(t,e=null,s=!0){super(t),this.cause=e,this.recoverable=s,this.name="AtomError"}}class d extends T{constructor(t,e=null){super(t,e,!0),this.name="ComputedError"}}class C extends T{constructor(t,e=null){super(t,e,!1),this.name="EffectError"}}class y extends T{constructor(t,e=null){super(t,e,!1),this.name="SchedulerError"}}const W=Symbol("AtomEffect.DebugName"),It=Symbol("AtomEffect.Id"),K=Symbol("AtomEffect.Type"),w=Symbol("AtomEffect.NoDefaultValue"),pt=i=>"dependencies"in i&&Array.isArray(i.dependencies);function J(i,t,e){if(i===t)throw new d("Circular dependency detected: The computation refers to itself explicitly or implicitly.");if(!e.has(i.id)&&(e.add(i.id),pt(i))){const s=i.dependencies;for(let n=0;n<s.length;n++){const r=s[n];r&&J(r,t,e)}}}const D={enabled:l,warnInfiniteLoop:P.WARN_INFINITE_LOOP,warn(i,t){l&&this.enabled&&i&&console.warn(`[Atom Effect] ${t}`)},checkCircular(i,t){if(i===t)throw new d("Direct circular dependency detected");l&&this.enabled&&J(i,t,new Set)},attachDebugInfo(i,t,e){if(!l||!this.enabled)return;const s=i;s[W]=`${t}_${e}`,s[It]=e,s[K]=t},getDebugName:i=>i?.[W],getDebugType:i=>i?.[K]};let St=1;const Ct=()=>St++;function Z(i,t,e){if(typeof t=="function"){const n=t;for(let r=0,o=e.length;r<o;r++){const h=e[r];if(h&&h.fn===n)return}e.push(new B(n,void 0));return}if("addDependency"in t){t.addDependency(i);return}const s=t;for(let n=0,r=e.length;n<r;n++){const o=e[n];if(o&&o.sub===s)return}e.push(new B(void 0,s))}function tt(i,t,e){const s=new Map;for(let n=0,r=t.length;n<r;n++){const o=t[n];o?.unsub&&s.set(o.node,o.unsub)}for(let n=0,r=i.length;n<r;n++){const o=i[n];if(!o)continue;const h=o.node,I=s.get(h);I!==void 0?(o.unsub=I,s.delete(h)):(D.checkCircular(h,e),o.unsub=h.subscribe(e))}for(const n of s.values())n()}class M{constructor(t,e,s=void 0){this.node=t,this.version=e,this.unsub=s}}class B{constructor(t,e){this.fn=t,this.sub=e}}const u={COMPUTED_MUST_BE_FUNCTION:"Computed target must be a function",COMPUTED_ASYNC_PENDING_NO_DEFAULT:"Async computation pending with no default value",COMPUTED_COMPUTATION_FAILED:"Computation execution failed",COMPUTED_ASYNC_COMPUTATION_FAILED:"Async computation execution failed",COMPUTED_CIRCULAR_DEPENDENCY:"Circular dependency detected",COMPUTED_DISPOSED:"Attempted to access disposed computed",ATOM_SUBSCRIBER_MUST_BE_FUNCTION:"Subscriber must be a function or Subscriber object",ATOM_INDIVIDUAL_SUBSCRIBER_FAILED:"Subscriber execution failed",EFFECT_MUST_BE_FUNCTION:"Effect target must be a function",EFFECT_EXECUTION_FAILED:"Effect execution failed",EFFECT_CLEANUP_FAILED:"Effect cleanup failed",EFFECT_DISPOSED:"Attempted to run disposed effect",SCHEDULER_FLUSH_OVERFLOW:(i,t)=>`Maximum flush iterations (${i}) exceeded. ${t} jobs dropped. Possible infinite loop.`,CALLBACK_ERROR_IN_ERROR_HANDLER:"Exception encountered in onError handler",EFFECT_FREQUENCY_LIMIT_EXCEEDED:"Effect executed too frequently within 1 second. Suspected infinite loop.",SCHEDULER_CALLBACK_MUST_BE_FUNCTION:"Scheduler callback must be a function",SCHEDULER_END_BATCH_WITHOUT_START:"endBatch() called without matching startBatch(). Ignoring."};function b(i,t,e){if(i instanceof T)return i;const s=i instanceof Error,n=s?i.message:String(i),r=s?i:void 0,h=`${s?i.constructor.name:"Unexpected error"} (${e}): ${n}`;return new t(h,r)}class et{constructor(){this.flags=0,this.version=0,this._lastSeenEpoch=-1,this.id=Ct()&v}}class st extends et{subscribe(t){const e=typeof t=="function";if(!e&&(!t||typeof t.execute!="function"))throw b(new TypeError("Invalid subscriber"),T,u.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);const s=this._subscribers;for(let r=0,o=s.length;r<o;r++){const h=s[r];if(h&&(e?h.fn===t:h.sub===t))return l&&console.warn("Duplicate subscription ignored."),()=>{}}const n=new B(e?t:void 0,e?void 0:t);return s.push(n),()=>this._unsubscribe(n)}_unsubscribe(t){const e=this._subscribers,s=e.indexOf(t);if(s===-1)return;const n=e.pop();s<e.length&&n&&(e[s]=n)}subscriberCount(){return this._subscribers.length}_notifySubscribers(t,e){if(this._subscribers.length===0)return;const s=this._subscribers.slice(0),n=s.length;for(let r=0;r<n;r++){const o=s[r];if(o)try{o.fn?o.fn(t,e):o.sub&&o.sub.execute()}catch(h){this._handleNotifyError(h)}}}_handleNotifyError(t){console.error(b(t,T,u.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED))}}let H=0;const z=()=>(H=H+1&v||1,H),V=i=>i+1&v;let G=0,R=!1,it=0;const Dt=()=>it;function nt(){return R?(l&&console.warn("startFlush() called during flush - ignored"),!1):(R=!0,it=z(),G=0,!0)}const rt=()=>{R=!1},gt=()=>R?++G:0;class Tt{constructor(){this._queueBuffer=[[],[]],this._bufferIndex=0,this._size=0,this._epoch=0,this._isProcessing=!1,this._isBatching=!1,this._isFlushingSync=!1,this._batchDepth=0,this._batchQueue=[],this._batchQueueSize=0,this._maxFlushIterations=S.MAX_FLUSH_ITERATIONS,this.onOverflow=null,this._boundRunLoop=this._runLoop.bind(this)}get phase(){return this._isProcessing||this._isFlushingSync?2:this._isBatching?1:0}get queueSize(){return this._size}get isBatching(){return this._isBatching}schedule(t){if(l&&typeof t!="function")throw new y(u.SCHEDULER_CALLBACK_MUST_BE_FUNCTION);if(t._nextEpoch!==this._epoch){if(t._nextEpoch=this._epoch,this._isBatching||this._isFlushingSync){this._batchQueue[this._batchQueueSize++]=t;return}this._queueBuffer[this._bufferIndex][this._size++]=t,this._isProcessing||this._flush()}}_flush(){this._isProcessing||this._size===0||(this._isProcessing=!0,queueMicrotask(this._boundRunLoop))}_runLoop(){try{if(this._size===0)return;const t=nt();this._drainQueue(),t&&rt()}finally{this._isProcessing=!1,this._size>0&&!this._isBatching&&this._flush()}}_flushSync(){this._isFlushingSync=!0;const t=nt();try{this._mergeBatchQueue(),this._drainQueue()}finally{this._isFlushingSync=!1,t&&rt()}}_mergeBatchQueue(){if(this._batchQueueSize===0)return;const t=++this._epoch,e=this._batchQueue,s=this._queueBuffer[this._bufferIndex];let n=this._size;for(let r=0;r<this._batchQueueSize;r++){const o=e[r];o._nextEpoch!==t&&(o._nextEpoch=t,s[n++]=o)}this._size=n,this._batchQueueSize=0,e.length>S.BATCH_QUEUE_SHRINK_THRESHOLD&&(e.length=0)}_drainQueue(){let t=0;for(;this._size>0;){if(++t>this._maxFlushIterations){this._handleFlushOverflow();return}this._processQueue(),this._mergeBatchQueue()}}_processQueue(){const t=this._bufferIndex,e=this._queueBuffer[t],s=this._size;this._bufferIndex=t^1,this._size=0,this._epoch++;for(let n=0;n<s;n++)try{e[n]()}catch(r){console.error(new y("Error occurred during scheduler execution",r))}e.length=0}_handleFlushOverflow(){const t=this._size+this._batchQueueSize;if(console.error(new y(u.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations,t))),this._size=0,this._queueBuffer[this._bufferIndex].length=0,this._batchQueueSize=0,this.onOverflow)try{this.onOverflow(t)}catch{}}startBatch(){this._batchDepth++,this._isBatching=!0}endBatch(){if(this._batchDepth===0){l&&console.warn(u.SCHEDULER_END_BATCH_WITHOUT_START);return}--this._batchDepth===0&&(this._flushSync(),this._isBatching=!1)}setMaxFlushIterations(t){if(t<S.MIN_FLUSH_ITERATIONS)throw new y(`Max flush iterations must be at least ${S.MIN_FLUSH_ITERATIONS}`);this._maxFlushIterations=t}}const A=new Tt,k=Symbol.for("atom-effect/atom"),X=Symbol.for("atom-effect/computed"),Q=Symbol.for("atom-effect/effect"),f={current:null,run(i,t){const e=this.current;this.current=i;try{return t()}finally{this.current=e}}};function Ot(i){const t=f.current;if(t===null)return i();f.current=null;try{return i()}finally{f.current=t}}var ot,ht;class bt extends(ht=st,ot=k,ht){constructor(t,e){super(),this._pendingOldValue=void 0,this._notifyTask=()=>this._flushNotifications(),this._subscribers=[],this[ot]=!0,this._value=t,e&&(this.flags|=p.SYNC),D.attachDebugInfo(this,"atom",this.id)}get value(){const t=f.current;return t&&Z(this,t,this._subscribers),this._value}set value(t){const e=this._value;if(Object.is(e,t))return;this._value=t,this.version=V(this.version);const s=this.flags;if(!(this._subscribers.length===0||s&p.NOTIFICATION_SCHEDULED)){if(this._pendingOldValue=e,this.flags=s|p.NOTIFICATION_SCHEDULED,s&p.SYNC&&!A.isBatching){this._flushNotifications();return}A.schedule(this._notifyTask)}}_flushNotifications(){const t=this.flags;if(!(t&p.NOTIFICATION_SCHEDULED)||t&p.DISPOSED)return;const e=this._pendingOldValue;this._pendingOldValue=void 0,this.flags&=-17,this._notifySubscribers(this._value,e)}peek(){return this._value}dispose(){this.flags&p.DISPOSED||(this._subscribers.length=0,this.flags|=p.DISPOSED,this._value=void 0,this._pendingOldValue=void 0)}}function At(i,t={}){return new bt(i,t.sync??!1)}class Nt{constructor(t=50,e=256,s=!1){this.limit=t,this.capacity=e,this.pool=[],this.stats=null,this.stats=l||s?{acquired:0,released:0,rejected:{frozen:0,tooLarge:0,poolFull:0}}:null}acquire(){return this.stats&&this.stats.acquired++,this.pool.pop()??[]}release(t,e){if(!(e&&t===e)){if(t.length>this.capacity){this.stats&&this.stats.rejected.tooLarge++;return}if(this.pool.length>=this.limit){this.stats&&this.stats.rejected.poolFull++;return}if(Object.isFrozen(t)){this.stats&&this.stats.rejected.frozen++;return}t.length=0,this.pool.push(t),this.stats&&this.stats.released++}}getStats(){if(!this.stats)return null;const{acquired:t,released:e,rejected:s}=this.stats,n=t-e-(s.frozen+s.tooLarge+s.poolFull);return{acquired:t,released:e,rejected:{...s},leaked:n,poolSize:this.pool.length}}reset(){this.pool.length=0,this.stats&&(this.stats={acquired:0,released:0,rejected:{frozen:0,tooLarge:0,poolFull:0}})}}const _=Object.freeze([]),g=new Nt;function yt(i){return i!==null&&typeof i=="object"&&k in i}function mt(i){return i!==null&&typeof i=="object"&&X in i}function Ft(i){return i!==null&&typeof i=="object"&&Q in i}function ct(i){return i!==null&&typeof i=="object"&&typeof i.then=="function"}var ut,_t,lt;const{IDLE:L,DIRTY:N,PENDING:U,RESOLVED:O,REJECTED:m,HAS_ERROR:x,RECOMPUTING:F,DISPOSED:Y,IS_COMPUTED:Rt}=$;function kt(i){return i&O?E.RESOLVED:i&U?E.PENDING:i&m?E.REJECTED:E.IDLE}class Lt extends(lt=st,_t=k,ut=X,lt){constructor(t,e={}){if(typeof t!="function")throw new d(u.COMPUTED_MUST_BE_FUNCTION);super(),this[_t]=!0,this[ut]=!0,this._error=null,this._promiseId=0,this._subscribers=[],this._links=_,this._asyncStartAggregateVersion=0,this._asyncRetryCount=0,this._trackEpoch=-1,this._trackLinks=_,this._trackCount=0,this._value=void 0,this.flags=Rt|N|L,this._equal=e.equal??Object.is,this._fn=t,this._defaultValue="defaultValue"in e?e.defaultValue:w,this._onError=e.onError??null;const s=e.maxAsyncRetries;if(this._maxAsyncRetries=s!=null&&s>=0?s:q.MAX_ASYNC_RETRIES,D.attachDebugInfo(this,"computed",this.id),e.lazy===!1)try{this._recompute()}catch{}}_track(){const t=f.current;t&&Z(this,t,this._subscribers)}get value(){this._track();const t=this.flags;if((t&(O|N|L))===O)return this._value;if(t&Y)throw new d(u.COMPUTED_DISPOSED);if(t&F){if(this._defaultValue!==w)return this._defaultValue;throw new d(u.COMPUTED_CIRCULAR_DEPENDENCY)}if(t&(N|L)&&(this._recompute(),this.flags&O))return this._value;const e=this._defaultValue,s=e!==w;if(this.flags&U){if(s)return e;throw new d(u.COMPUTED_ASYNC_PENDING_NO_DEFAULT)}if(this.flags&m){if(s)return e;throw this._error}return this._value}peek(){return this._value}get state(){return this._track(),kt(this.flags)}get hasError(){if(this._track(),this.flags&(m|x))return!0;const t=this._links;for(let e=0,s=t.length;e<s;e++){const n=t[e]?.node;if(n&&n.flags&x)return!0}return!1}get isValid(){return!this.hasError}get errors(){if(this._track(),!this.hasError)return dt;const t=[];this._error&&t.push(this._error);const e=this._links;for(let s=0,n=e.length;s<n;s++){const r=e[s].node;if(r.flags&x){const h=r.errors;if(h.length>0)for(let I=0;I<h.length;I++){const j=h[I];j&&t.indexOf(j)===-1&&t.push(j)}}}return Object.freeze(t)}get lastError(){return this._track(),this._error}get isPending(){return this._track(),(this.flags&U)!==0}get isResolved(){return this._track(),(this.flags&O)!==0}invalidate(){this._markDirty()}dispose(){if(this.flags&Y)return;const t=this._links;if(t!==_){for(let e=0,s=t.length;e<s;e++)t[e].unsub?.();g.release(t),this._links=_}this._subscribers.length=0,this.flags=Y|N|L,this._error=null,this._value=void 0}addDependency(t){if(t._lastSeenEpoch!==this._trackEpoch){if(t._lastSeenEpoch=this._trackEpoch,this._trackCount<this._trackLinks.length){const e=this._trackLinks[this._trackCount];e.node=t,e.version=t.version}else this._trackLinks.push(new M(t,t.version));this._trackCount++}}_recompute(){if(this.flags&F)return;this.flags|=F;const t=this._links;this._trackEpoch=z(),this._trackLinks=g.acquire(),this._trackCount=0;let e=!1;try{const s=f.run(this,this._fn);this._trackLinks.length=this._trackCount,tt(this._trackLinks,t,this),this._links=this._trackLinks,e=!0,ct(s)?this._handleAsyncComputation(s):this._finalizeResolution(s)}catch(s){if(!e)try{this._trackLinks.length=this._trackCount,tt(this._trackLinks,t,this),this._links=this._trackLinks,e=!0}catch(n){l&&console.warn("[atom-effect] _commitDeps failed during error recovery:",n)}this._handleError(s,u.COMPUTED_COMPUTATION_FAILED,!0)}finally{e&&t!==_?g.release(t):e||g.release(this._trackLinks),this._trackEpoch=-1,this._trackLinks=_,this._trackCount=0,this.flags&=~F}}_handleAsyncComputation(t){this.flags=(this.flags|U)&-217,this._notifySubscribers(void 0,void 0),this._asyncStartAggregateVersion=this._captureVersionSnapshot(),this._asyncRetryCount=0,this._promiseId=(this._promiseId+1)%q.MAX_PROMISE_ID;const e=this._promiseId;t.then(s=>{if(e===this._promiseId){if(this._captureVersionSnapshot()!==this._asyncStartAggregateVersion)return this._asyncRetryCount++<this._maxAsyncRetries?this._markDirty():this._handleError(new d(`Async drift threshold exceeded after ${this._maxAsyncRetries} retries.`),u.COMPUTED_ASYNC_COMPUTATION_FAILED);this._finalizeResolution(s),this._notifySubscribers(s,void 0)}},s=>e===this._promiseId&&this._handleError(s,u.COMPUTED_ASYNC_COMPUTATION_FAILED))}_captureVersionSnapshot(){let t=0;const e=this._links;for(let s=0,n=e.length;s<n;s++)t=(t<<5)-t+e[s].node.version|0;return t}_handleError(t,e,s=!1){const n=b(t,d,e);if(!s&&!(this.flags&m)&&(this.version=V(this.version)),this._error=n,this.flags=this.flags&-121|m|x,this._onError)try{this._onError(n)}catch(r){console.error(u.CALLBACK_ERROR_IN_ERROR_HANDLER,r)}if(s)throw n;this._notifySubscribers(void 0,void 0)}_finalizeResolution(t){(!(this.flags&O)||!this._equal(this._value,t))&&(this.version=V(this.version)),this._value=t,this._error=null,this.flags=(this.flags|O)&-697}execute(){this._markDirty()}_markDirty(){this.flags&(F|N)||(this.flags|=N,this._notifySubscribers(void 0,void 0))}}function Ut(i,t={}){return new Lt(i,t)}var at,ft;class xt extends(ft=et,at=Q,ft){constructor(t,e={}){super(),this[at]=!0,this._cleanup=null,this._links=_,this._nextLinks=null,this._prevLinks=_,this._currentEpoch=-1,this._lastFlushEpoch=-1,this._executionsInEpoch=0,this._executionCount=0,this._windowStart=0,this._windowCount=0,this._execId=0,this._fn=t,this._onError=e.onError??null,this._sync=e.sync??!1,this._maxExecutions=e.maxExecutionsPerSecond??S.MAX_EXECUTIONS_PER_SECOND,this._maxExecutionsPerFlush=e.maxExecutionsPerFlush??S.MAX_EXECUTIONS_PER_EFFECT,this._trackModifications=e.trackModifications??!1,this._sync?(this._executeTask=void 0,this._notifyCallback=()=>this.execute()):(this._executeTask=()=>this.execute(),this._notifyCallback=()=>A.schedule(this._executeTask)),D.attachDebugInfo(this,"effect",this.id)}run(){if(this.flags&a.DISPOSED)throw new C(u.EFFECT_DISPOSED);this.execute(!0)}dispose(){this.flags&a.DISPOSED||(this.flags|=a.DISPOSED,this._execCleanup(),this._unsubLinks(this._links),this._links!==_&&g.release(this._links),this._links=_,this._prevLinks=_)}addDependency(t){if(!(this.flags&a.EXECUTING))return;const e=this._currentEpoch;if(t._lastSeenEpoch===e)return;t._lastSeenEpoch=e;const s=this._nextLinks,n=this._prevLinks;for(let r=0,o=n.length;r<o;r++){const h=n[r];if(h&&h.node===t&&h.unsub){h.version=t.version,s.push(h),n[r]=null;return}}try{let r;this._trackModifications?r=t.subscribe(()=>{this.flags&a.EXECUTING&&(t._modifiedAtEpoch=this._currentEpoch),this._notifyCallback()}):r=t.subscribe(this._notifyCallback),s.push(new M(t,t.version,r))}catch(r){const o=b(r,C,u.EFFECT_EXECUTION_FAILED);if(console.error(o),this._onError)try{this._onError(o)}catch{}s.push(new M(t,t.version,void 0))}}execute(t=!1){if(this.flags&(a.DISPOSED|a.EXECUTING)||!t&&this._links.length>0&&!this._isDirty())return;this._checkInfiniteLoops(),this.flags|=a.EXECUTING,this._execCleanup(),this._prevLinks=this._links;const e=g.acquire();this._nextLinks=e,this._currentEpoch=z();let s=!1;try{const n=f.run(this,this._fn);if(this._links=e,s=!0,this._trackModifications&&D.enabled){const r=this._currentEpoch;for(let o=0,h=e.length;o<h;o++){const I=e[o].node;I._modifiedAtEpoch===r&&D.warn(!0,`Effect is reading a dependency (${D.getDebugName(I)||"unknown"}) that it just modified. Infinite loop may occur`)}}ct(n)?this._handleAsyncResult(n):this._cleanup=typeof n=="function"?n:null}catch(n){this._links=e,s=!0,this._handleExecutionError(n),this._cleanup=null}finally{this._finalizeDependencies(s,this._prevLinks,e),this.flags&=-9}}_handleAsyncResult(t){const e=++this._execId;t.then(s=>{if(e!==this._execId||this.flags&a.DISPOSED){if(typeof s=="function")try{s()}catch(n){this._handleExecutionError(n,u.EFFECT_CLEANUP_FAILED)}return}typeof s=="function"&&(this._cleanup=s)},s=>e===this._execId&&this._handleExecutionError(s))}_finalizeDependencies(t,e,s){if(this._nextLinks=null,this._prevLinks=_,t){for(let n=0,r=e.length;n<r;n++){const o=e[n];o&&o.unsub?.()}e!==_&&g.release(e)}else this._unsubLinks(s),g.release(s)}_unsubLinks(t){for(let e=0,s=t.length;e<s;e++)t[e]?.unsub?.()}_isDirty(){const t=this._links,e=f.current;f.current=null;try{for(let s=0,n=t.length;s<n;s++){const r=t[s],o=r.node;if(o.flags&$.IS_COMPUTED)try{o.value}catch{return l&&console.warn(`[atom-effect] Dependency #${o.id} threw during dirty check`),!0}if(o.version!==r.version)return!0}return!1}finally{f.current=e}}_execCleanup(){if(this._cleanup){try{this._cleanup()}catch(t){this._handleExecutionError(t,u.EFFECT_CLEANUP_FAILED)}this._cleanup=null}}_checkInfiniteLoops(){const t=Dt();if(this._lastFlushEpoch!==t&&(this._lastFlushEpoch=t,this._executionsInEpoch=0),++this._executionsInEpoch>this._maxExecutionsPerFlush&&this._throwInfiniteLoopError("per-effect"),gt()>S.MAX_EXECUTIONS_PER_FLUSH&&this._throwInfiniteLoopError("global"),this._executionCount++,l&&Number.isFinite(this._maxExecutions)){const e=Date.now();if(e-this._windowStart>=P.EFFECT_FREQUENCY_WINDOW)this._windowStart=e,this._windowCount=1;else if(++this._windowCount>this._maxExecutions){const s=new C(u.EFFECT_FREQUENCY_LIMIT_EXCEEDED);throw this.dispose(),this._handleExecutionError(s),s}}}get isDisposed(){return(this.flags&a.DISPOSED)!==0}get executionCount(){return this._executionCount}get isExecuting(){return(this.flags&a.EXECUTING)!==0}_throwInfiniteLoopError(t){const e=new C(`Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${G}`);throw this.dispose(),console.error(e),e}_handleExecutionError(t,e=u.EFFECT_EXECUTION_FAILED){const s=b(t,C,e);if(console.error(s),this._onError)try{this._onError(s)}catch(n){console.error(b(n,C,u.CALLBACK_ERROR_IN_ERROR_HANDLER))}}}function Pt(i,t={}){if(typeof i!="function")throw new C(u.EFFECT_MUST_BE_FUNCTION);const e=new xt(i,t);return e.execute(),e}function vt(i){if(typeof i!="function")throw new TypeError("Batch callback must be a function");A.startBatch();try{return i()}finally{A.endBatch()}}c.ATOM_BRAND=k,c.AsyncState=E,c.AtomError=T,c.COMPUTED_BRAND=X,c.ComputedError=d,c.DEBUG_CONFIG=P,c.DEBUG_RUNTIME=D,c.EFFECT_BRAND=Q,c.EffectError=C,c.POOL_CONFIG=Et,c.SCHEDULER_CONFIG=S,c.SchedulerError=y,c.atom=At,c.batch=vt,c.computed=Ut,c.effect=Pt,c.isAtom=yt,c.isComputed=mt,c.isEffect=Ft,c.scheduler=A,c.untracked=Ot,Object.defineProperty(c,Symbol.toStringTag,{value:"Module"})}));
 //# sourceMappingURL=atom-effect.min.js.map

package/dist/atom-effect.min.js.map

@@ -1 +1 @@
-{"version":3,"file":"atom-effect.min.js","sources":["../src/constants.ts","../src/errors/errors.ts","../src/utils/debug.ts","../src/core/dep-tracking.ts","../src/errors/messages.ts","../src/utils/error.ts","../src/core/base.ts","../src/internal/epoch.ts","../src/internal/scheduler.ts","../src/tracking/context.ts","../src/tracking/untracked.ts","../src/core/atom.ts","../src/utils/array-pool.ts","../src/internal/pool.ts","../src/utils/type-guards.ts","../src/core/computed.ts","../src/core/effect.ts","../src/internal/batch.ts"],"sourcesContent":["/**\n * Async operation states.\n */\nexport const AsyncState = {\n  IDLE: 'idle',\n  PENDING: 'pending',\n  RESOLVED: 'resolved',\n  REJECTED: 'rejected',\n} as const;\n\n/**\n * Effect flags.\n */\nexport const EFFECT_STATE_FLAGS = {\n  DISPOSED: 1 << 0,\n  EXECUTING: 1 << 3,\n} as const;\n\n/**\n * Computed flags.\n */\nexport const COMPUTED_STATE_FLAGS = {\n  DISPOSED: 1 << 0,\n  /** Marker bit: identifies this node as a computed. */\n  IS_COMPUTED: 1 << 1,\n  DIRTY: 1 << 3,\n  IDLE: 1 << 4,\n  PENDING: 1 << 5,\n  RESOLVED: 1 << 6,\n  REJECTED: 1 << 7,\n  RECOMPUTING: 1 << 8,\n  HAS_ERROR: 1 << 9,\n} as const;\n\n/**\n * Writable Atom Flags.\n */\nexport const ATOM_STATE_FLAGS = {\n  DISPOSED: 1 << 0,\n  SYNC: 1 << 3,\n  NOTIFICATION_SCHEDULED: 1 << 4,\n} as const;\n\n/**\n * Array pool configuration.\n */\nexport const POOL_CONFIG = {\n  MAX_SIZE: 1000,\n  WARMUP_SIZE: 100,\n  ENABLE_STATS: false,\n} as const;\n\n/**\n * Scheduler configuration.\n */\nexport const SCHEDULER_CONFIG = {\n  // Infinite loop protection\n  MAX_EXECUTIONS_PER_SECOND: 1000,\n  MAX_EXECUTIONS_PER_EFFECT: 100,\n\n  // Batch processing limits to prevent blocking the main thread for too long\n  MAX_EXECUTIONS_PER_FLUSH: 10000,\n  MAX_FLUSH_ITERATIONS: 1000,\n  MIN_FLUSH_ITERATIONS: 10,\n\n  // Memory management\n  CLEANUP_THRESHOLD: 1000,\n  BATCH_QUEUE_SHRINK_THRESHOLD: 1000,\n} as const;\n\n/**\n * Debugging thresholds.\n */\nexport const DEBUG_CONFIG = {\n  WARN_INFINITE_LOOP: true,\n} as const;\n\n/**\n * V8 Small Integer (SMI) max value.\n */\nexport const SMI_MAX = 0x3fffffff;\n\n/**\n * Development environment flag.\n */\nexport const IS_DEV =\n  (typeof process !== 'undefined' && process.env && process.env.NODE_ENV !== 'production') ||\n  (typeof __DEV__ !== 'undefined' && !!__DEV__);\n\n// Fallback declaration for __DEV__ if not present in environment\ndeclare const __DEV__: boolean;\n\nexport const EMPTY_ERROR_ARRAY: readonly Error[] = Object.freeze([]);\n","/**\n * Base error class.\n */\nexport class AtomError extends Error {\n  constructor(\n    message: string,\n    public cause: Error | null = null,\n    public recoverable = true\n  ) {\n    super(message);\n    this.name = 'AtomError';\n  }\n}\n\n/** Computed error. */\nexport class ComputedError extends AtomError {\n  constructor(message: string, cause: Error | null = null) {\n    super(message, cause, true);\n    this.name = 'ComputedError';\n  }\n}\n\n/** Effect error. */\nexport class EffectError extends AtomError {\n  constructor(message: string, cause: Error | null = null) {\n    super(message, cause, false);\n    this.name = 'EffectError';\n  }\n}\n\n/** Scheduler error. */\nexport class SchedulerError extends AtomError {\n  constructor(message: string, cause: Error | null = null) {\n    super(message, cause, false);\n    this.name = 'SchedulerError';\n  }\n}\n","import { DEBUG_CONFIG, IS_DEV } from '@/constants';\nimport { ComputedError } from '@/errors/errors';\nimport type { DebugConfig, Dependency, DependencyId } from '@/types';\n\n// Debug symbols\nexport const DEBUG_NAME = Symbol('AtomEffect.DebugName');\nexport const DEBUG_ID = Symbol('AtomEffect.Id');\nexport const DEBUG_TYPE = Symbol('AtomEffect.Type');\nexport const NO_DEFAULT_VALUE = Symbol('AtomEffect.NoDefaultValue');\n\n/**\n * Dependency type guard.\n */\nconst hasDeps = (o: Dependency): o is Dependency & { dependencies: Dependency[] } =>\n  'dependencies' in o && Array.isArray((o as { dependencies: unknown }).dependencies);\n\n/**\n * Cycle detection.\n */\nfunction checkCircularInternal(dep: Dependency, current: object, visited: Set<number>): void {\n  // Cycle detected in *this* path\n  if (dep === current) {\n    throw new ComputedError(\n      'Circular dependency detected: The computation refers to itself explicitly or implicitly.'\n    );\n  }\n\n  // Cycle check\n  if (visited.has(dep.id)) return;\n  visited.add(dep.id);\n\n  if (hasDeps(dep)) {\n    const deps = dep.dependencies;\n    // Check dependencies\n    for (let i = 0; i < deps.length; i++) {\n      const child = deps[i];\n      if (child) {\n        checkCircularInternal(child, current, visited);\n      }\n    }\n  }\n}\n\n/**\n * Debug controller.\n */\nexport const debug: DebugConfig = {\n  // Dev mode flag\n  enabled: IS_DEV,\n\n  warnInfiniteLoop: DEBUG_CONFIG.WARN_INFINITE_LOOP,\n\n  warn(cond, msg) {\n    if (IS_DEV && this.enabled && cond) {\n      console.warn(`[Atom Effect] ${msg}`);\n    }\n  },\n\n  checkCircular(dep, current) {\n    if (dep === current) {\n      throw new ComputedError('Direct circular dependency detected');\n    }\n\n    if (IS_DEV && this.enabled) {\n      checkCircularInternal(dep, current, new Set());\n    }\n  },\n\n  attachDebugInfo(obj, type, id) {\n    if (!IS_DEV || !this.enabled) return;\n\n    const t = obj as Record<symbol, unknown>;\n    t[DEBUG_NAME] = `${type}_${id}`;\n    t[DEBUG_ID] = id;\n    t[DEBUG_TYPE] = type;\n  },\n\n  getDebugName: (obj) =>\n    (obj as Record<symbol, unknown> | null)?.[DEBUG_NAME] as string | undefined,\n\n  getDebugType: (obj) =>\n    (obj as Record<symbol, unknown> | null)?.[DEBUG_TYPE] as string | undefined,\n};\n\n/**\n * ID counter.\n */\nlet nextId = 1;\n\n/**\n * Generates ID.\n */\nexport const generateId = (): DependencyId => nextId++;\n","import type { DependencySubscriber, Listener } from '@/tracking/tracking.types';\nimport type { Dependency, Subscriber } from '@/types';\nimport { debug } from '@/utils/debug';\n/**\n * Tracks dependency.\n */\nexport function trackDependency<T>(\n  dependency: Dependency,\n  current: Listener,\n  subscribers: SubscriberLink<T>[]\n): void {\n  if (typeof current === 'function') {\n    const fn = current as (newValue?: T, oldValue?: T) => void;\n    // O(n) duplicate check — acceptable because:\n    // 1. subscribers array is typically 1-10 elements\n    // 2. DependencySubscriber (hot path) uses O(1) epoch-based dedup via addDependency\n    // 3. This branch only runs for raw function listeners (uncommon)\n    for (let i = 0, len = subscribers.length; i < len; i++) {\n      const link = subscribers[i];\n      if (link && link.fn === fn) return;\n    }\n    subscribers.push(new SubscriberLink(fn, undefined));\n    return;\n  }\n\n  if ('addDependency' in (current as object)) {\n    (current as DependencySubscriber).addDependency(dependency);\n    return;\n  }\n\n  const sub = current as Subscriber;\n  for (let i = 0, len = subscribers.length; i < len; i++) {\n    const link = subscribers[i];\n    if (link && link.sub === sub) return;\n  }\n  subscribers.push(new SubscriberLink(undefined, sub));\n}\n\n/**\n * Syncs dependencies.\n * Uses a local Map to park previous subscriptions, avoiding\n * temporary state on dependency nodes.\n */\nexport function syncDependencies(\n  nextLinks: DependencyLink[],\n  prevLinks: DependencyLink[],\n  tracker: Subscriber\n): void {\n  // Park: collect previous subscriptions into a local Map\n  const parked = new Map<Dependency, () => void>();\n  for (let i = 0, len = prevLinks.length; i < len; i++) {\n    const link = prevLinks[i];\n    if (link?.unsub) {\n      parked.set(link.node, link.unsub);\n    }\n  }\n\n  // Reclaim or subscribe\n  for (let i = 0, len = nextLinks.length; i < len; i++) {\n    const link = nextLinks[i];\n    if (!link) continue;\n\n    const node = link.node;\n    const existing = parked.get(node);\n    if (existing !== undefined) {\n      // Re-link: reclaim subscription from previous set\n      link.unsub = existing;\n      parked.delete(node);\n    } else {\n      // New link: subscribe afresh\n      debug.checkCircular(node, tracker);\n      link.unsub = node.subscribe(tracker);\n    }\n  }\n\n  // Cleanup: release unused subscriptions\n  for (const unsub of parked.values()) {\n    unsub();\n  }\n}\n\n/**\n * Dependency graph edge.\n */\nexport class DependencyLink {\n  public unsub: (() => void) | undefined;\n\n  constructor(\n    public node: Dependency,\n    public version: number,\n    unsub: (() => void) | undefined = undefined\n  ) {\n    // Always initialize to maintain consistent V8 hidden class\n    this.unsub = unsub;\n  }\n}\n\n/**\n * Subscriber link.\n */\nexport class SubscriberLink<T> {\n  public fn: ((newValue?: T, oldValue?: T) => void) | undefined;\n  public sub: Subscriber | undefined;\n\n  constructor(fn: ((newValue?: T, oldValue?: T) => void) | undefined, sub: Subscriber | undefined) {\n    // Always initialize both properties to maintain consistent V8 hidden class\n    this.fn = fn;\n    this.sub = sub;\n  }\n}\n","/**\n * Error message registry.\n */\nexport const ERROR_MESSAGES = {\n  // Computed Errors\n  COMPUTED_MUST_BE_FUNCTION: 'Computed target must be a function',\n  COMPUTED_ASYNC_PENDING_NO_DEFAULT: 'Async computation pending with no default value',\n  COMPUTED_COMPUTATION_FAILED: 'Computation execution failed',\n  COMPUTED_ASYNC_COMPUTATION_FAILED: 'Async computation execution failed',\n  COMPUTED_CIRCULAR_DEPENDENCY: 'Circular dependency detected',\n  COMPUTED_DISPOSED: 'Attempted to access disposed computed',\n\n  // Atom Errors\n  ATOM_SUBSCRIBER_MUST_BE_FUNCTION: 'Subscriber must be a function or Subscriber object',\n  ATOM_INDIVIDUAL_SUBSCRIBER_FAILED: 'Subscriber execution failed',\n\n  // Effect Errors\n  EFFECT_MUST_BE_FUNCTION: 'Effect target must be a function',\n  EFFECT_EXECUTION_FAILED: 'Effect execution failed',\n  EFFECT_CLEANUP_FAILED: 'Effect cleanup failed',\n  EFFECT_DISPOSED: 'Attempted to run disposed effect',\n\n  // Scheduler Errors\n  SCHEDULER_FLUSH_OVERFLOW: (max: number, dropped: number): string =>\n    `Maximum flush iterations (${max}) exceeded. ${dropped} jobs dropped. Possible infinite loop.`,\n\n  // System / Debug\n  CALLBACK_ERROR_IN_ERROR_HANDLER: 'Exception encountered in onError handler',\n\n  // Effect frequency\n  EFFECT_FREQUENCY_LIMIT_EXCEEDED:\n    'Effect executed too frequently within 1 second. Suspected infinite loop.',\n} as const;\n","import { AtomError } from '@/errors/errors';\n\n/**\n * Wraps error.\n *\n * @param error - Raw error.\n * @param ErrorClass - Error class.\n * @param context - Error context.\n */\nexport function wrapError(\n  error: unknown,\n  ErrorClass: typeof AtomError,\n  context: string\n): AtomError {\n  // Return if wrapped\n  if (error instanceof AtomError) {\n    return error;\n  }\n\n  const isNativeError = error instanceof Error;\n  const originalMessage = isNativeError ? error.message : String(error);\n  const cause = isNativeError ? error : undefined;\n\n  const type = isNativeError ? error.constructor.name : 'Unexpected error';\n  const finalMessage = `${type} (${context}): ${originalMessage}`;\n\n  return new ErrorClass(finalMessage, cause);\n}\n","import { IS_DEV, SMI_MAX } from '@/constants';\nimport { SubscriberLink } from '@/core/dep-tracking';\nimport { AtomError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport type { DependencyId, Subscriber } from '@/types';\nimport { generateId } from '@/utils/debug';\nimport { wrapError } from '@/utils/error';\n\n/**\n * Base class for all reactive nodes.\n */\nexport class ReactiveNode {\n  /** State flags */\n  flags = 0;\n  /** Version counter */\n  version = 0;\n  /** Last access epoch */\n  _lastSeenEpoch = -1;\n  /** Debug ID */\n  readonly id: DependencyId = generateId() & SMI_MAX;\n}\n\n/**\n * Reactive dependency base class.\n */\nexport abstract class ReactiveDependency<T> extends ReactiveNode {\n  protected abstract _subscribers: SubscriberLink<T>[];\n\n  /**\n   * Adds subscriber.\n   */\n  subscribe(listener: ((newValue?: T, oldValue?: T) => void) | Subscriber): () => void {\n    const isFn = typeof listener === 'function';\n    // Validate subscriber\n    if (!isFn && (!listener || typeof (listener as Subscriber).execute !== 'function')) {\n      throw wrapError(\n        new TypeError('Invalid subscriber'),\n        AtomError,\n        ERROR_MESSAGES.ATOM_SUBSCRIBER_MUST_BE_FUNCTION\n      );\n    }\n\n    const subs = this._subscribers;\n    for (let i = 0, len = subs.length; i < len; i++) {\n      const sub = subs[i];\n      if (!sub) continue;\n      if (isFn ? sub.fn === listener : sub.sub === listener) {\n        if (IS_DEV) console.warn('Duplicate subscription ignored.');\n        return () => {};\n      }\n    }\n\n    const link = new SubscriberLink<T>(\n      isFn ? (listener as (newValue?: T, oldValue?: T) => void) : undefined,\n      !isFn ? (listener as Subscriber) : undefined\n    );\n\n    subs.push(link);\n\n    return () => this._unsubscribe(link);\n  }\n\n  private _unsubscribe(link: SubscriberLink<T>): void {\n    const subs = this._subscribers;\n    const idx = subs.indexOf(link);\n    if (idx === -1) return;\n\n    // Remove subscriber\n    const last = subs.pop();\n    if (idx < subs.length && last) {\n      subs[idx] = last;\n    }\n  }\n\n  subscriberCount(): number {\n    return this._subscribers.length;\n  }\n\n  protected _notifySubscribers(newValue: T | undefined, oldValue: T | undefined): void {\n    if (this._subscribers.length === 0) return;\n\n    const subs = this._subscribers.slice(0);\n    const len = subs.length;\n\n    for (let i = 0; i < len; i++) {\n      const s = subs[i];\n      if (!s) continue;\n      try {\n        if (s.fn) s.fn(newValue, oldValue);\n        else if (s.sub) s.sub.execute();\n      } catch (err) {\n        this._handleNotifyError(err);\n      }\n    }\n  }\n\n  private _handleNotifyError(err: unknown): void {\n    console.error(wrapError(err, AtomError, ERROR_MESSAGES.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));\n  }\n}\n","import { IS_DEV, SMI_MAX } from '@/constants';\n\n// Global epoch counter.\nlet collectorEpoch = 0;\n\n/**\n * Next tracking epoch.\n */\nexport const nextEpoch = () => {\n  collectorEpoch = (collectorEpoch + 1) & SMI_MAX || 1;\n  return collectorEpoch;\n};\n\n/** Current tracking epoch. */\nexport const currentEpoch = () => collectorEpoch;\n\n/** Increments a version counter within SMI range. */\nexport const nextVersion = (v: number) => (v + 1) & SMI_MAX;\n\nexport let flushExecutionCount = 0;\nlet isFlushing = false;\nlet _flushEpoch = 0;\n\n/** Current flush epoch. */\nexport const currentFlushEpoch = () => _flushEpoch;\n\n/**\n * Starts flush cycle.\n */\nexport function startFlush(): boolean {\n  if (isFlushing) {\n    if (IS_DEV) console.warn('startFlush() called during flush - ignored');\n    return false;\n  }\n\n  isFlushing = true;\n  _flushEpoch = nextEpoch();\n  flushExecutionCount = 0;\n  return true;\n}\n\n/** Ends flush cycle. */\nexport const endFlush = () => {\n  isFlushing = false;\n};\n\n/**\n * Increments execution count.\n */\nexport const incrementFlushExecutionCount = () => (isFlushing ? ++flushExecutionCount : 0);\n\n/**\n * Resets flush state.\n */\nexport function resetFlushState(): void {\n  _flushEpoch = 0;\n  flushExecutionCount = 0;\n  isFlushing = false;\n}\n","import { IS_DEV, SCHEDULER_CONFIG } from '@/constants';\nimport { SchedulerError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport { endFlush, startFlush } from '@/internal/epoch';\n\nexport enum SchedulerPhase {\n  IDLE = 0,\n  BATCHING = 1,\n  FLUSHING = 2,\n}\n\nexport interface SchedulerJob {\n  (): void;\n  /** Next scheduled epoch */\n  _nextEpoch?: number;\n}\n\n/**\n * Scheduler implementation.\n */\nclass Scheduler {\n  /** Queue buffer */\n  _queueBuffer: [SchedulerJob[], SchedulerJob[]] = [[], []];\n  _bufferIndex = 0;\n  _size = 0;\n\n  /** Epoch counter */\n  _epoch = 0;\n\n  /** State flags */\n  _isProcessing = false;\n  _isBatching = false;\n  _isFlushingSync = false;\n\n  /** Batching state */\n  _batchDepth = 0;\n  _batchQueue: SchedulerJob[] = [];\n  _batchQueueSize = 0;\n\n  /** Config */\n  _maxFlushIterations: number = SCHEDULER_CONFIG.MAX_FLUSH_ITERATIONS;\n\n  /** Overflow callback */\n  onOverflow: ((droppedCount: number) => void) | null = null;\n\n  /** Bound run loop for microtask */\n  private readonly _boundRunLoop = this._runLoop.bind(this);\n\n  get phase(): SchedulerPhase {\n    if (this._isProcessing || this._isFlushingSync) return SchedulerPhase.FLUSHING;\n    if (this._isBatching) return SchedulerPhase.BATCHING;\n    return SchedulerPhase.IDLE;\n  }\n\n  get queueSize(): number {\n    return this._size;\n  }\n\n  get isBatching(): boolean {\n    return this._isBatching;\n  }\n\n  /**\n   * Schedules job.\n   */\n  schedule(callback: SchedulerJob): void {\n    if (IS_DEV && typeof callback !== 'function') {\n      throw new SchedulerError('Scheduler callback must be a function');\n    }\n\n    // Deduplicate job\n    if (callback._nextEpoch === this._epoch) return;\n    callback._nextEpoch = this._epoch;\n\n    if (this._isBatching || this._isFlushingSync) {\n      this._batchQueue[this._batchQueueSize++] = callback;\n      return;\n    }\n\n    // Push to current active buffer\n    this._queueBuffer[this._bufferIndex]![this._size++] = callback;\n\n    // Wake up if sleeping\n    if (!this._isProcessing) {\n      this._flush();\n    }\n  }\n\n  /**\n   * Triggers flush.\n   */\n  _flush(): void {\n    if (this._isProcessing || this._size === 0) return;\n    this._isProcessing = true;\n\n    queueMicrotask(this._boundRunLoop);\n  }\n\n  /**\n   * Scheduler loop.\n   */\n  private _runLoop(): void {\n    try {\n      if (this._size === 0) return;\n\n      const started = startFlush();\n      this._drainQueue();\n      if (started) endFlush();\n    } finally {\n      this._isProcessing = false;\n      // If new jobs arrived during flush (and not batching), re-schedule\n      if (this._size > 0 && !this._isBatching) {\n        this._flush();\n      }\n    }\n  }\n\n  _flushSync(): void {\n    this._isFlushingSync = true;\n    const started = startFlush();\n    try {\n      this._mergeBatchQueue();\n      this._drainQueue();\n    } finally {\n      this._isFlushingSync = false;\n      if (started) endFlush();\n    }\n  }\n\n  _mergeBatchQueue(): void {\n    if (this._batchQueueSize === 0) return;\n\n    // Increment epoch\n    const epoch = ++this._epoch;\n    const bQueue = this._batchQueue;\n    const targetBuffer = this._queueBuffer[this._bufferIndex]!;\n    let currentSize = this._size;\n\n    // Merge batch\n    for (let i = 0; i < this._batchQueueSize; i++) {\n      const job = bQueue[i]!;\n      // Retag jobs\n      if (job._nextEpoch !== epoch) {\n        job._nextEpoch = epoch;\n        targetBuffer[currentSize++] = job;\n      }\n    }\n\n    this._size = currentSize;\n    this._batchQueueSize = 0;\n\n    // Resize batch queue\n    if (bQueue.length > SCHEDULER_CONFIG.BATCH_QUEUE_SHRINK_THRESHOLD) {\n      bQueue.length = 0;\n    }\n  }\n\n  _drainQueue(): void {\n    let iterations = 0;\n    // Process queue\n    while (this._size > 0) {\n      // Overflow check\n      if (++iterations > this._maxFlushIterations) {\n        this._handleFlushOverflow();\n        return;\n      }\n\n      this._processQueue();\n      // If batch updates happened during processing, merge them in now\n      this._mergeBatchQueue();\n    }\n  }\n\n  _processQueue(): void {\n    const idx = this._bufferIndex;\n    const jobs = this._queueBuffer[idx]!;\n    const count = this._size;\n\n    // Swap buffers\n    this._bufferIndex = idx ^ 1;\n    this._size = 0;\n    this._epoch++;\n\n    for (let i = 0; i < count; i++) {\n      // Execute job\n      try {\n        jobs[i]!();\n      } catch (e) {\n        console.error(new SchedulerError('Error occurred during scheduler execution', e as Error));\n      }\n    }\n    // Clear the consumed buffer\n    jobs.length = 0;\n  }\n\n  private _handleFlushOverflow(): void {\n    const droppedCount = this._size + this._batchQueueSize;\n    console.error(\n      new SchedulerError(\n        ERROR_MESSAGES.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations, droppedCount)\n      )\n    );\n    this._size = 0;\n    this._queueBuffer[this._bufferIndex]!.length = 0;\n    this._batchQueueSize = 0;\n\n    if (this.onOverflow) {\n      try {\n        this.onOverflow(droppedCount);\n      } catch {}\n    }\n  }\n\n  startBatch(): void {\n    this._batchDepth++;\n    this._isBatching = true;\n  }\n\n  endBatch(): void {\n    if (this._batchDepth === 0) {\n      if (IS_DEV) console.warn('endBatch() called without matching startBatch(). Ignoring.');\n      return;\n    }\n\n    if (--this._batchDepth === 0) {\n      this._flushSync();\n      this._isBatching = false;\n    }\n  }\n\n  setMaxFlushIterations(max: number): void {\n    if (max < SCHEDULER_CONFIG.MIN_FLUSH_ITERATIONS)\n      throw new SchedulerError(\n        `Max flush iterations must be at least ${SCHEDULER_CONFIG.MIN_FLUSH_ITERATIONS}`\n      );\n    this._maxFlushIterations = max;\n  }\n}\n\nexport const scheduler = new Scheduler();\n","import type { Listener } from './tracking.types';\n\n/**\n * Global tracking context.\n */\nexport const trackingContext = {\n  /** Active listener. */\n  current: null as Listener | null,\n\n  /**\n   * Executes in context.\n   *\n   * @param listener - The subscriber.\n   * @param fn - The logic to execute.\n   * @returns The result of `fn`.\n   */\n  run<T>(listener: Listener, fn: () => T): T {\n    const prev = this.current;\n    this.current = listener;\n    try {\n      return fn();\n    } finally {\n      this.current = prev;\n    }\n  },\n};\n\n/**\n * Tracking context type.\n */\nexport type ITrackingContext = typeof trackingContext;\n","import { trackingContext } from './context';\n\n/**\n * Untracked execution.\n *\n * @param fn - Function to execute.\n * @returns Result of `fn`.\n */\nexport function untracked<T>(fn: () => T): T {\n  const prev = trackingContext.current;\n\n  // Skip if untracked\n  if (prev === null) return fn();\n\n  trackingContext.current = null;\n  try {\n    return fn();\n  } finally {\n    trackingContext.current = prev;\n  }\n}\n","import { ATOM_STATE_FLAGS } from '@/constants';\nimport { ReactiveDependency } from '@/core/base';\nimport { type SubscriberLink, trackDependency } from '@/core/dep-tracking';\nimport { nextVersion } from '@/internal/epoch';\nimport { scheduler } from '@/internal/scheduler';\nimport { trackingContext } from '@/tracking';\nimport type { AtomOptions, WritableAtom } from '@/types';\nimport { debug } from '@/utils/debug';\n\n/**\n * Internal {@link WritableAtom} implementation.\n */\nclass AtomImpl<T> extends ReactiveDependency<T> implements WritableAtom<T> {\n  private _value: T;\n  /** Old value for notifications */\n  private _pendingOldValue: T | undefined = undefined;\n  /** Cached notification task */\n  private _notifyTask: (() => void) | undefined = undefined;\n  protected _subscribers: SubscriberLink<T>[] = [];\n\n  constructor(initialValue: T, sync: boolean) {\n    super();\n    this._value = initialValue;\n    if (sync) this.flags |= ATOM_STATE_FLAGS.SYNC;\n    debug.attachDebugInfo(this, 'atom', this.id);\n  }\n\n  get value(): T {\n    const current = trackingContext.current;\n    if (current) {\n      trackDependency(this, current, this._subscribers);\n    }\n    return this._value;\n  }\n\n  set value(newValue: T) {\n    const oldValue = this._value;\n    if (Object.is(oldValue, newValue)) return;\n\n    this._value = newValue;\n    this.version = nextVersion(this.version);\n\n    const flags = this.flags;\n    if (this._subscribers.length === 0 || flags & ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED) {\n      return;\n    }\n\n    this._pendingOldValue = oldValue;\n    this.flags = flags | ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED;\n\n    // Sync handling\n    if (flags & ATOM_STATE_FLAGS.SYNC && !scheduler.isBatching) {\n      this._flushNotifications();\n      return;\n    }\n\n    // Async scheduling\n    if (!this._notifyTask) {\n      // Create notification task\n      this._notifyTask = () => this._flushNotifications();\n    }\n    scheduler.schedule(this._notifyTask);\n  }\n\n  /**\n   * Triggers subscribers.\n   */\n  private _flushNotifications(): void {\n    const flags = this.flags;\n    // Guard: Spurious flush or already disposed\n    if (!(flags & ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED) || flags & ATOM_STATE_FLAGS.DISPOSED) {\n      return;\n    }\n\n    const oldValue = this._pendingOldValue as T;\n    this._pendingOldValue = undefined;\n    this.flags &= ~ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED;\n\n    this._notifySubscribers(this._value, oldValue);\n  }\n\n  peek(): T {\n    return this._value;\n  }\n\n  dispose(): void {\n    if (this.flags & ATOM_STATE_FLAGS.DISPOSED) return;\n\n    this._subscribers.length = 0;\n    this.flags |= ATOM_STATE_FLAGS.DISPOSED;\n    // Release references\n    this._value = undefined as T;\n    this._pendingOldValue = undefined;\n    this._notifyTask = undefined;\n  }\n}\n\n/**\n * Creates a reactive atom holding mutable state.\n *\n * @param initialValue - The initial value of the atom.\n * @param options - Configuration options (sync: boolean).\n */\nexport function atom<T>(initialValue: T, options: AtomOptions = {}): WritableAtom<T> {\n  return new AtomImpl(initialValue, options.sync ?? false);\n}\n","import { IS_DEV } from '@/constants';\nimport type { PoolStats } from '@/types';\n\n/**\n * Array pool.\n *\n * @template T - Element type.\n */\nexport class ArrayPool<T> {\n  private readonly pool: T[][] = [];\n\n  // Mutable stats container, null when disabled\n  private stats: {\n    acquired: number;\n    released: number;\n    rejected: { frozen: number; tooLarge: number; poolFull: number };\n  } | null = null;\n\n  /**\n   * @param limit - Max unique arrays to hold (default: 50). Prevents the pool itself from consuming too much memory.\n   * @param capacity - Max length of an array to accept (default: 256).\n   * @param enableStats - Force-enable stats even in production (default: false).\n   */\n  constructor(\n    private readonly limit = 50,\n    private readonly capacity = 256,\n    enableStats = false\n  ) {\n    this.stats =\n      IS_DEV || enableStats\n        ? {\n            acquired: 0,\n            released: 0,\n            rejected: { frozen: 0, tooLarge: 0, poolFull: 0 },\n          }\n        : null;\n  }\n\n  /**\n   * Acquires array.\n   */\n  acquire(): T[] {\n    if (this.stats) {\n      this.stats.acquired++;\n    }\n    // LIFO reuse for better cache locality\n    return this.pool.pop() ?? [];\n  }\n\n  /**\n   * Releases array.\n   *\n   * @param arr - Array to release.\n   * @param emptyConst - Optional empty constant.\n   */\n  release(arr: T[], emptyConst?: readonly T[]): void {\n    if (emptyConst && arr === emptyConst) return;\n\n    if (arr.length > this.capacity) {\n      if (this.stats) this.stats.rejected.tooLarge++;\n      return;\n    }\n\n    if (this.pool.length >= this.limit) {\n      if (this.stats) this.stats.rejected.poolFull++;\n      return;\n    }\n\n    if (Object.isFrozen(arr)) {\n      if (this.stats) this.stats.rejected.frozen++;\n      return;\n    }\n\n    arr.length = 0;\n    this.pool.push(arr);\n\n    if (this.stats) {\n      this.stats.released++;\n    }\n  }\n\n  /**\n   * Pool stats.\n   */\n  getStats(): PoolStats | null {\n    if (!this.stats) return null;\n\n    const { acquired, released, rejected } = this.stats;\n    const leakCount =\n      acquired - released - (rejected.frozen + rejected.tooLarge + rejected.poolFull);\n\n    return {\n      acquired,\n      released,\n      rejected: { ...rejected },\n      leaked: leakCount,\n      poolSize: this.pool.length,\n    };\n  }\n\n  /**\n   * Resets pool.\n   */\n  reset(): void {\n    this.pool.length = 0;\n    if (this.stats) {\n      this.stats = {\n        acquired: 0,\n        released: 0,\n        rejected: { frozen: 0, tooLarge: 0, poolFull: 0 },\n      };\n    }\n  }\n}\n","import type { DependencyLink } from '@/core/dep-tracking';\nimport { ArrayPool } from '@/utils/array-pool';\n\nexport const EMPTY_LINKS: DependencyLink[] = Object.freeze(\n  [] as unknown as DependencyLink[]\n) as DependencyLink[];\n\nexport const linksArrayPool = new ArrayPool<DependencyLink>();\n","import type { ComputedAtom, EffectObject, ReadonlyAtom, WritableAtom } from '@/types';\n\n/**\n * Readonly atom check.\n *\n * @param obj - Object to check.\n */\nexport function isAtom(obj: unknown): obj is ReadonlyAtom {\n  return (\n    obj !== null &&\n    typeof obj === 'object' &&\n    'value' in obj &&\n    typeof (obj as { subscribe?: unknown }).subscribe === 'function'\n  );\n}\n\n/**\n * Writable atom check.\n */\nexport function isWritable(obj: unknown): obj is WritableAtom {\n  return isAtom(obj) && typeof (obj as { dispose?: unknown }).dispose === 'function';\n}\n\n/**\n * Computed atom check.\n */\nexport function isComputed(obj: unknown): obj is ComputedAtom {\n  return isAtom(obj) && typeof (obj as { invalidate?: unknown }).invalidate === 'function';\n}\n\n/**\n * Effect object check.\n */\nexport function isEffect(obj: unknown): obj is EffectObject {\n  return (\n    obj !== null &&\n    typeof obj === 'object' &&\n    typeof (obj as { dispose?: unknown }).dispose === 'function' &&\n    typeof (obj as { run?: unknown }).run === 'function'\n  );\n}\n\n/**\n * Promise check.\n */\nexport function isPromise<T>(value: unknown): value is Promise<T> {\n  return (\n    value !== null &&\n    typeof value === 'object' &&\n    typeof (value as { then?: unknown }).then === 'function'\n  );\n}\n","import { AsyncState, COMPUTED_STATE_FLAGS, EMPTY_ERROR_ARRAY, IS_DEV } from '@/constants';\nimport { ReactiveDependency } from '@/core/base';\nimport {\n  DependencyLink,\n  type SubscriberLink,\n  syncDependencies,\n  trackDependency,\n} from '@/core/dep-tracking';\nimport { ComputedError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport { nextEpoch, nextVersion } from '@/internal/epoch';\nimport { EMPTY_LINKS, linksArrayPool } from '@/internal/pool';\nimport { trackingContext } from '@/tracking';\nimport type {\n  AsyncStateType,\n  ComputedAtom,\n  ComputedOptions,\n  Dependency,\n  Subscriber,\n} from '@/types';\nimport { debug, NO_DEFAULT_VALUE } from '@/utils/debug';\nimport { wrapError } from '@/utils/error';\nimport { isPromise } from '@/utils/type-guards';\n\nconst MAX_ASYNC_RETRIES = 3;\nconst MAX_PROMISE_ID = Number.MAX_SAFE_INTEGER - 1;\n\nconst { IDLE, DIRTY, PENDING, RESOLVED, REJECTED, HAS_ERROR, RECOMPUTING, DISPOSED, IS_COMPUTED } =\n  COMPUTED_STATE_FLAGS;\n\nfunction getAsyncState(flags: number): AsyncStateType {\n  if (flags & RESOLVED) return AsyncState.RESOLVED;\n  if (flags & PENDING) return AsyncState.PENDING;\n  if (flags & REJECTED) return AsyncState.REJECTED;\n  return AsyncState.IDLE;\n}\n\n/**\n * Computed atom implementation.\n */\nclass ComputedAtomImpl<T> extends ReactiveDependency<T> implements ComputedAtom<T>, Subscriber {\n  private _value: T;\n  private _error: Error | null = null;\n  /** Promise tracking ID */\n  private _promiseId = 0;\n\n  private readonly _equal: (a: T, b: T) => boolean;\n  private readonly _fn: () => T | Promise<T>;\n  private readonly _defaultValue: T;\n  private readonly _onError: ((error: Error) => void) | null;\n  private readonly _maxAsyncRetries: number;\n\n  protected _subscribers: SubscriberLink<T>[] = [];\n  private _links: DependencyLink[] = EMPTY_LINKS;\n\n  // Async state\n  private _asyncStartAggregateVersion = 0;\n  private _asyncRetryCount = 0;\n\n  // Dependency collection state\n  private _trackEpoch = -1;\n  private _trackLinks: DependencyLink[] = EMPTY_LINKS;\n  private _trackCount = 0;\n\n  constructor(fn: () => T | Promise<T>, options: ComputedOptions<T> = {}) {\n    if (typeof fn !== 'function') throw new ComputedError(ERROR_MESSAGES.COMPUTED_MUST_BE_FUNCTION);\n    super();\n\n    this._value = undefined as T;\n    // Start dirty so first access triggers computation\n    this.flags = IS_COMPUTED | DIRTY | IDLE;\n    this._equal = options.equal ?? Object.is;\n    this._fn = fn;\n    this._defaultValue = 'defaultValue' in options ? options.defaultValue : (NO_DEFAULT_VALUE as T);\n    this._onError = options.onError ?? null;\n    const retries = options.maxAsyncRetries;\n    this._maxAsyncRetries = retries != null && retries >= 0 ? retries : MAX_ASYNC_RETRIES;\n\n    debug.attachDebugInfo(this, 'computed', this.id);\n\n    // Eager evaluation if not lazy\n    if (options.lazy === false) {\n      try {\n        this._recompute();\n      } catch {\n        /* _handleError already stored error and called onError */\n      }\n    }\n  }\n\n  private _track(): void {\n    const current = trackingContext.current;\n    if (current) trackDependency(this, current, this._subscribers);\n  }\n\n  get value(): T {\n    this._track();\n\n    const flags = this.flags;\n    if ((flags & (RESOLVED | DIRTY | IDLE)) === RESOLVED) {\n      return this._value;\n    }\n\n    if (flags & DISPOSED) {\n      throw new ComputedError(ERROR_MESSAGES.COMPUTED_DISPOSED);\n    }\n\n    if (flags & RECOMPUTING) {\n      if (this._defaultValue !== (NO_DEFAULT_VALUE as T)) return this._defaultValue;\n      throw new ComputedError(ERROR_MESSAGES.COMPUTED_CIRCULAR_DEPENDENCY);\n    }\n\n    if (flags & (DIRTY | IDLE)) {\n      this._recompute();\n      // Re-read flags after update\n      if (this.flags & RESOLVED) return this._value;\n    }\n\n    // 3. Async/Error handling\n    const def = this._defaultValue;\n    const hasDef = def !== (NO_DEFAULT_VALUE as T);\n\n    if (this.flags & PENDING) {\n      if (hasDef) return def;\n      throw new ComputedError(ERROR_MESSAGES.COMPUTED_ASYNC_PENDING_NO_DEFAULT);\n    }\n\n    if (this.flags & REJECTED) {\n      if ((this._error as ComputedError)?.recoverable && hasDef) return def;\n      throw this._error;\n    }\n\n    return this._value;\n  }\n\n  peek(): T {\n    return this._value;\n  }\n\n  get state(): AsyncStateType {\n    this._track();\n    return getAsyncState(this.flags);\n  }\n\n  get hasError(): boolean {\n    this._track();\n    if (this.flags & (REJECTED | HAS_ERROR)) return true;\n\n    // Live scan: deps may have changed error state asynchronously\n    const links = this._links;\n    for (let i = 0, len = links.length; i < len; i++) {\n      const node = links[i]?.node;\n      if (node && node.flags & HAS_ERROR) return true;\n    }\n    return false;\n  }\n\n  get isValid(): boolean {\n    return !this.hasError;\n  }\n\n  get errors(): readonly Error[] {\n    this._track();\n    if (!this.hasError) return EMPTY_ERROR_ARRAY;\n\n    // Collect errors directly into array, dedupe via indexOf (avoids Set allocation)\n    const collected: Error[] = [];\n    if (this._error) collected.push(this._error);\n\n    const links = this._links;\n    for (let i = 0, len = links.length; i < len; i++) {\n      const dep = links[i]!.node;\n      if (dep.flags & HAS_ERROR) {\n        const computedDep = dep as unknown as ComputedAtom<unknown>;\n        if (computedDep.errors) {\n          const depErrors = computedDep.errors;\n          for (let j = 0; j < depErrors.length; j++) {\n            const err = depErrors[j];\n            if (err && collected.indexOf(err) === -1) collected.push(err);\n          }\n        }\n      }\n    }\n\n    return Object.freeze(collected);\n  }\n\n  get lastError(): Error | null {\n    this._track();\n    return this._error;\n  }\n\n  get isPending(): boolean {\n    this._track();\n    return (this.flags & PENDING) !== 0;\n  }\n\n  get isResolved(): boolean {\n    this._track();\n    return (this.flags & RESOLVED) !== 0;\n  }\n\n  invalidate(): void {\n    this._markDirty();\n  }\n\n  dispose(): void {\n    if (this.flags & DISPOSED) return;\n\n    const links = this._links;\n    if (links !== EMPTY_LINKS) {\n      for (let i = 0, len = links.length; i < len; i++) {\n        links[i]!.unsub?.();\n      }\n      linksArrayPool.release(links);\n      this._links = EMPTY_LINKS;\n    }\n\n    this._subscribers.length = 0;\n    this.flags = DISPOSED | DIRTY | IDLE;\n\n    // Release Memory\n    this._error = null;\n    this._value = undefined as T;\n  }\n\n  addDependency(dep: Dependency): void {\n    // Deduplicate dependencies\n    if (dep._lastSeenEpoch === this._trackEpoch) return;\n    dep._lastSeenEpoch = this._trackEpoch;\n\n    // Resize array if needed\n    if (this._trackCount < this._trackLinks.length) {\n      const link = this._trackLinks[this._trackCount]!;\n      link.node = dep;\n      link.version = dep.version;\n    } else {\n      this._trackLinks.push(new DependencyLink(dep, dep.version));\n    }\n    this._trackCount++;\n  }\n\n  private _recompute(): void {\n    if (this.flags & RECOMPUTING) return;\n    this.flags |= RECOMPUTING;\n\n    const prevLinks = this._links;\n    this._trackEpoch = nextEpoch();\n    this._trackLinks = linksArrayPool.acquire();\n    this._trackCount = 0;\n\n    let committed = false;\n    try {\n      // Execute function\n      const result = trackingContext.run(this, this._fn);\n\n      // Inline _commitDeps\n      this._trackLinks.length = this._trackCount;\n      syncDependencies(this._trackLinks, prevLinks, this);\n      this._links = this._trackLinks;\n      committed = true;\n\n      // Handle Result\n      if (isPromise(result)) {\n        this._handleAsyncComputation(result);\n      } else {\n        this._finalizeResolution(result);\n      }\n    } catch (e) {\n      // Commit dependencies on error\n      if (!committed) {\n        try {\n          this._trackLinks.length = this._trackCount;\n          syncDependencies(this._trackLinks, prevLinks, this);\n          this._links = this._trackLinks;\n          committed = true;\n        } catch (commitErr) {\n          if (IS_DEV) {\n            console.warn('[atom-effect] _commitDeps failed during error recovery:', commitErr);\n          }\n        }\n      }\n      this._handleError(e as Error, ERROR_MESSAGES.COMPUTED_COMPUTATION_FAILED, true);\n    } finally {\n      // Release pool\n      if (committed && prevLinks !== EMPTY_LINKS) {\n        linksArrayPool.release(prevLinks);\n      } else if (!committed) {\n        linksArrayPool.release(this._trackLinks);\n      }\n\n      // Reset transient state\n      this._trackEpoch = -1;\n      this._trackLinks = EMPTY_LINKS;\n      this._trackCount = 0;\n      this.flags &= ~RECOMPUTING;\n    }\n  }\n\n  private _handleAsyncComputation(promise: Promise<T>): void {\n    // Set pending, clear idle/dirty/resolved/rejected\n    this.flags = (this.flags | PENDING) & ~(IDLE | DIRTY | RESOLVED | REJECTED);\n    // Notify pending\n    this._notifySubscribers(undefined, undefined);\n\n    this._asyncStartAggregateVersion = this._captureVersionSnapshot();\n    this._asyncRetryCount = 0;\n    // Invalidate old promises\n    this._promiseId = (this._promiseId + 1) % MAX_PROMISE_ID;\n    const promiseId = this._promiseId;\n\n    promise.then(\n      (res) => {\n        if (promiseId !== this._promiseId) return; // Stale\n\n        // Check for stale reads (did deps change while we waited?)\n        if (this._captureVersionSnapshot() !== this._asyncStartAggregateVersion) {\n          if (this._asyncRetryCount++ < this._maxAsyncRetries) {\n            return this._markDirty(); // Retry\n          }\n          return this._handleError(\n            new ComputedError(\n              `Async drift threshold exceeded after ${this._maxAsyncRetries} retries.`\n            ),\n            ERROR_MESSAGES.COMPUTED_ASYNC_COMPUTATION_FAILED\n          );\n        }\n\n        this._finalizeResolution(res);\n        this._notifySubscribers(res, undefined);\n      },\n      (err) =>\n        promiseId === this._promiseId &&\n        this._handleError(err, ERROR_MESSAGES.COMPUTED_ASYNC_COMPUTATION_FAILED)\n    );\n  }\n\n  private _captureVersionSnapshot(): number {\n    let sum = 0;\n    const links = this._links;\n    for (let i = 0, len = links.length; i < len; i++) {\n      sum += links[i]!.node.version;\n    }\n    return sum;\n  }\n\n  private _handleError(err: unknown, msg: string, throwErr = false): void {\n    const error = wrapError(err, ComputedError, msg);\n\n    if (!throwErr && !(this.flags & REJECTED)) {\n      // Update version\n      this.version = nextVersion(this.version);\n    }\n\n    this._error = error;\n    // Set rejected + has_error, clear idle/dirty/pending/resolved\n    this.flags = (this.flags & ~(IDLE | DIRTY | PENDING | RESOLVED)) | REJECTED | HAS_ERROR;\n\n    if (this._onError) {\n      try {\n        this._onError(error);\n      } catch (e) {\n        console.error(ERROR_MESSAGES.CALLBACK_ERROR_IN_ERROR_HANDLER, e);\n      }\n    }\n\n    if (throwErr) throw error;\n    this._notifySubscribers(undefined, undefined);\n  }\n\n  private _finalizeResolution(value: T): void {\n    // Only bump version if value actually changed or first resolve\n    if (!(this.flags & RESOLVED) || !this._equal(this._value, value)) {\n      this.version = nextVersion(this.version);\n    }\n\n    this._value = value;\n    this._error = null;\n    // Set resolved, clear idle/dirty/pending/rejected/has_error\n    this.flags = (this.flags | RESOLVED) & ~(IDLE | DIRTY | PENDING | REJECTED | HAS_ERROR);\n  }\n\n  execute(): void {\n    // Subscriber implementation\n    this._markDirty();\n  }\n\n  /** @internal */\n  _markDirty(): void {\n    if (this.flags & (RECOMPUTING | DIRTY)) return;\n    this.flags |= DIRTY;\n    this._notifySubscribers(undefined, undefined);\n  }\n}\n\n/**\n * Creates a computed value.\n * @param fn - Computation function\n * @param options - Options object\n */\nexport function computed<T>(fn: () => T, options?: ComputedOptions<T>): ComputedAtom<T>;\nexport function computed<T>(\n  fn: () => Promise<T>,\n  options: ComputedOptions<T> & { defaultValue: T }\n): ComputedAtom<T>;\nexport function computed<T>(\n  fn: () => T | Promise<T>,\n  options: ComputedOptions<T> = {}\n): ComputedAtom<T> {\n  return new ComputedAtomImpl(fn, options);\n}\n","import { COMPUTED_STATE_FLAGS, EFFECT_STATE_FLAGS, IS_DEV, SCHEDULER_CONFIG } from '@/constants';\nimport { ReactiveNode } from '@/core/base';\nimport { DependencyLink } from '@/core/dep-tracking';\nimport { EffectError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport {\n  currentFlushEpoch,\n  flushExecutionCount,\n  incrementFlushExecutionCount,\n  nextEpoch,\n} from '@/internal/epoch';\nimport { EMPTY_LINKS, linksArrayPool } from '@/internal/pool';\nimport { scheduler } from '@/internal/scheduler';\nimport { type DependencyTracker, trackingContext } from '@/tracking';\nimport type { Dependency, EffectFunction, EffectObject, EffectOptions } from '@/types';\nimport { debug } from '@/utils/debug';\nimport { wrapError } from '@/utils/error';\nimport { isPromise } from '@/utils/type-guards';\n\n/**\n * Effect implementation.\n */\nclass EffectImpl extends ReactiveNode implements EffectObject, DependencyTracker {\n  private _cleanup: (() => void) | null = null;\n  private _links: DependencyLink[] = EMPTY_LINKS;\n  private _nextLinks: DependencyLink[] | null = null;\n  private _executeTask: (() => void) | undefined;\n  private _prevLinks: DependencyLink[] | null = null;\n\n  private readonly _onError: ((error: unknown) => void) | null;\n\n  // Cycle detection\n  private _currentEpoch = -1;\n  private _lastFlushEpoch = -1;\n  private _executionsInEpoch = 0;\n\n  private readonly _fn: EffectFunction;\n  private readonly _sync: boolean;\n  private readonly _maxExecutions: number;\n  private readonly _maxExecutionsPerFlush: number;\n  private readonly _trackModifications: boolean;\n\n  // Frequency tracking (Dev)\n  private _executionCount = 0;\n  private _windowStart = 0;\n  private _windowCount = 0;\n  private _execId = 0;\n\n  constructor(fn: EffectFunction, options: EffectOptions = {}) {\n    super();\n    this._fn = fn;\n    this._onError = options.onError ?? null;\n    this._sync = options.sync ?? false;\n    this._maxExecutions =\n      options.maxExecutionsPerSecond ?? SCHEDULER_CONFIG.MAX_EXECUTIONS_PER_SECOND;\n    this._maxExecutionsPerFlush =\n      options.maxExecutionsPerFlush ?? SCHEDULER_CONFIG.MAX_EXECUTIONS_PER_EFFECT;\n    this._trackModifications = options.trackModifications ?? false;\n\n    debug.attachDebugInfo(this, 'effect', this.id);\n  }\n\n  public run(): void {\n    if (this.flags & EFFECT_STATE_FLAGS.DISPOSED) {\n      throw new EffectError(ERROR_MESSAGES.EFFECT_DISPOSED);\n    }\n    this.execute(true);\n  }\n\n  public dispose(): void {\n    if (this.flags & EFFECT_STATE_FLAGS.DISPOSED) return;\n    this.flags |= EFFECT_STATE_FLAGS.DISPOSED;\n\n    this._execCleanup();\n    this._unsubLinks(this._links);\n    if (this._links !== EMPTY_LINKS) {\n      linksArrayPool.release(this._links);\n    }\n\n    // Reset State\n    this._links = EMPTY_LINKS;\n    this._executeTask = undefined;\n  }\n\n  public addDependency(dep: Dependency): void {\n    // Only track if currently executing (double check)\n    if (!(this.flags & EFFECT_STATE_FLAGS.EXECUTING)) return;\n\n    // Deduplicate in current epoch\n    if (dep._lastSeenEpoch === this._currentEpoch) return;\n    dep._lastSeenEpoch = this._currentEpoch;\n\n    const nextLinks = this._nextLinks!;\n\n    // Reclaim existing subscription from previous links (avoids unsubscribe + resubscribe)\n    const prev = this._prevLinks;\n    if (prev) {\n      for (let j = 0, plen = prev.length; j < plen; j++) {\n        const plink = prev[j];\n        if (plink && plink.node === dep && plink.unsub) {\n          nextLinks.push(new DependencyLink(dep, dep.version, plink.unsub));\n          plink.unsub = undefined; // Mark as reclaimed\n          return;\n        }\n      }\n    }\n\n    try {\n      const unsubscribe = dep.subscribe(() => {\n        if (this._trackModifications && this.flags & EFFECT_STATE_FLAGS.EXECUTING)\n          dep._modifiedAtEpoch = this._currentEpoch;\n\n        if (this._sync) return this.execute();\n\n        // Task creation\n        if (!this._executeTask) this._executeTask = () => this.execute();\n        scheduler.schedule(this._executeTask!);\n      });\n      nextLinks.push(new DependencyLink(dep, dep.version, unsubscribe));\n    } catch (error) {\n      const wrapped = wrapError(error, EffectError, ERROR_MESSAGES.EFFECT_EXECUTION_FAILED);\n      console.error(wrapped);\n      if (this._onError) {\n        try {\n          this._onError(wrapped);\n        } catch {}\n      }\n      // Add noop link so next execution can attempt re-subscription\n      nextLinks.push(new DependencyLink(dep, dep.version, undefined));\n    }\n  }\n\n  /**\n   * Executes effect with tracking.\n   */\n  public execute(force = false): void {\n    if (this.flags & (EFFECT_STATE_FLAGS.DISPOSED | EFFECT_STATE_FLAGS.EXECUTING)) return;\n\n    // Skip if not dirty\n    if (!force && this._links.length > 0 && !this._isDirty()) return;\n\n    this._checkInfiniteLoops();\n\n    this.flags |= EFFECT_STATE_FLAGS.EXECUTING;\n    this._execCleanup();\n\n    const prevLinks = this._links;\n    // Store prev links for subscription reclamation in addDependency\n    this._prevLinks = prevLinks !== EMPTY_LINKS ? prevLinks : null;\n\n    // Setup tracking\n    const nextLinks = linksArrayPool.acquire();\n    this._nextLinks = nextLinks;\n    this._currentEpoch = nextEpoch();\n\n    let committed = false;\n    try {\n      const result = trackingContext.run(this, this._fn);\n      this._links = nextLinks;\n      committed = true;\n\n      // Inline _checkLoopWarnings\n      if (this._trackModifications && debug.enabled) {\n        const epoch = this._currentEpoch;\n        for (let i = 0, len = nextLinks.length; i < len; i++) {\n          const dep = nextLinks[i]!.node;\n          if (dep._modifiedAtEpoch === epoch) {\n            debug.warn(\n              true,\n              `Effect is reading a dependency (${debug.getDebugName(dep) || 'unknown'}) that it just modified. Infinite loop may occur`\n            );\n          }\n        }\n      }\n\n      // Handle result\n      if (isPromise(result)) {\n        this._handleAsyncResult(result);\n      } else {\n        this._cleanup = typeof result === 'function' ? result : null;\n      }\n    } catch (error) {\n      // Commit on error\n      committed = true;\n      this._handleExecutionError(error);\n      this._cleanup = null;\n    } finally {\n      this._finalizeDependencies(committed, prevLinks, nextLinks);\n      this.flags &= ~EFFECT_STATE_FLAGS.EXECUTING;\n    }\n  }\n\n  private _handleAsyncResult(promise: Promise<unknown>): void {\n    const execId = ++this._execId;\n    promise.then(\n      (cleanup) => {\n        // Guard against race conditions (new execution or disposal happened)\n        if (execId !== this._execId || this.flags & EFFECT_STATE_FLAGS.DISPOSED) {\n          if (typeof cleanup === 'function') {\n            try {\n              cleanup();\n            } catch (e) {\n              this._handleExecutionError(e, ERROR_MESSAGES.EFFECT_CLEANUP_FAILED);\n            }\n          }\n          return;\n        }\n        if (typeof cleanup === 'function') this._cleanup = cleanup as () => void;\n      },\n      (err) => execId === this._execId && this._handleExecutionError(err)\n    );\n  }\n\n  private _finalizeDependencies(\n    committed: boolean,\n    prevLinks: DependencyLink[],\n    nextLinks: DependencyLink[]\n  ): void {\n    this._nextLinks = null;\n\n    if (committed) {\n      // Cleanup unclaimed prev subscriptions\n      const prev = this._prevLinks;\n      if (prev) {\n        for (let i = 0, len = prev.length; i < len; i++) {\n          prev[i]?.unsub?.();\n        }\n      }\n      if (prevLinks !== EMPTY_LINKS) {\n        linksArrayPool.release(prevLinks);\n      }\n    } else {\n      // Abort and restore\n      this._unsubLinks(nextLinks);\n      linksArrayPool.release(nextLinks);\n    }\n\n    this._prevLinks = null;\n  }\n\n  private _unsubLinks(links: DependencyLink[]): void {\n    for (let i = 0, len = links.length; i < len; i++) {\n      links[i]?.unsub?.();\n    }\n  }\n\n  private _isDirty(): boolean {\n    const links = this._links;\n    // Save tracking context once, restore at end (avoids per-iteration function allocation)\n    const prevContext = trackingContext.current;\n    trackingContext.current = null;\n\n    try {\n      for (let i = 0, len = links.length; i < len; i++) {\n        const link = links[i]!;\n        const dep = link.node;\n\n        // Trigger recomputation for computed dependencies\n        if (dep.flags & COMPUTED_STATE_FLAGS.IS_COMPUTED) {\n          try {\n            // Force computed to re-evaluate so version reflects latest state\n            void (dep as { value: unknown }).value;\n          } catch {\n            if (IS_DEV) {\n              console.warn(`[atom-effect] Dependency #${dep.id} threw during dirty check`);\n            }\n            return true; // Error usually implies dirty/re-eval needed\n          }\n        }\n\n        // Version Check\n        if (dep.version !== link.version) return true;\n      }\n      return false;\n    } finally {\n      trackingContext.current = prevContext;\n    }\n  }\n\n  private _execCleanup(): void {\n    if (!this._cleanup) return;\n    try {\n      this._cleanup();\n    } catch (error) {\n      this._handleExecutionError(error, ERROR_MESSAGES.EFFECT_CLEANUP_FAILED);\n    }\n    this._cleanup = null;\n  }\n\n  private _checkInfiniteLoops(): void {\n    const epoch = currentFlushEpoch();\n    if (this._lastFlushEpoch !== epoch) {\n      this._lastFlushEpoch = epoch;\n      this._executionsInEpoch = 0;\n    }\n\n    if (++this._executionsInEpoch > this._maxExecutionsPerFlush)\n      this._throwInfiniteLoopError('per-effect');\n    if (incrementFlushExecutionCount() > SCHEDULER_CONFIG.MAX_EXECUTIONS_PER_FLUSH)\n      this._throwInfiniteLoopError('global');\n\n    this._executionCount++;\n\n    // Frequency check (dev only)\n    if (IS_DEV && Number.isFinite(this._maxExecutions)) {\n      const now = Date.now();\n      if (now - this._windowStart >= 1000) {\n        this._windowStart = now;\n        this._windowCount = 1;\n      } else if (++this._windowCount > this._maxExecutions) {\n        const err = new EffectError(ERROR_MESSAGES.EFFECT_FREQUENCY_LIMIT_EXCEEDED);\n        this.dispose();\n        this._handleExecutionError(err);\n        throw err;\n      }\n    }\n  }\n\n  get isDisposed(): boolean {\n    return (this.flags & EFFECT_STATE_FLAGS.DISPOSED) !== 0;\n  }\n  get executionCount(): number {\n    return this._executionCount;\n  }\n  get isExecuting(): boolean {\n    return (this.flags & EFFECT_STATE_FLAGS.EXECUTING) !== 0;\n  }\n\n  private _throwInfiniteLoopError(type: 'per-effect' | 'global'): never {\n    const error = new EffectError(\n      `Infinite loop detected (${type}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${flushExecutionCount}`\n    );\n    this.dispose();\n    console.error(error);\n    throw error;\n  }\n\n  private _handleExecutionError(\n    error: unknown,\n    message: string = ERROR_MESSAGES.EFFECT_EXECUTION_FAILED\n  ): void {\n    const errorObj = wrapError(error, EffectError, message);\n    console.error(errorObj);\n    if (this._onError) {\n      try {\n        this._onError(errorObj);\n      } catch (e) {\n        console.error(wrapError(e, EffectError, ERROR_MESSAGES.CALLBACK_ERROR_IN_ERROR_HANDLER));\n      }\n    }\n  }\n}\n\n/**\n * Creates and starts an effect.\n *\n * @param fn - Effect function.\n * @param options - Configuration options.\n * @returns Effect instance.\n */\nexport function effect(fn: EffectFunction, options: EffectOptions = {}): EffectObject {\n  if (typeof fn !== 'function') {\n    throw new EffectError(ERROR_MESSAGES.EFFECT_MUST_BE_FUNCTION);\n  }\n\n  const effectInstance = new EffectImpl(fn, options);\n  effectInstance.execute();\n\n  return effectInstance;\n}\n","import { scheduler } from './scheduler';\n\n/**\n * Batches updates.\n *\n * @param fn - Batch function.\n * @returns - Result of `fn`.\n */\nexport function batch<T>(fn: () => T): T {\n  // Validate callback\n  if (typeof fn !== 'function') {\n    throw new TypeError('Batch callback must be a function');\n  }\n\n  scheduler.startBatch();\n  try {\n    return fn();\n  } finally {\n    scheduler.endBatch();\n  }\n}\n"],"names":["AsyncState","EFFECT_STATE_FLAGS","COMPUTED_STATE_FLAGS","ATOM_STATE_FLAGS","POOL_CONFIG","SCHEDULER_CONFIG","DEBUG_CONFIG","SMI_MAX","IS_DEV","EMPTY_ERROR_ARRAY","AtomError","message","cause","recoverable","ComputedError","EffectError","SchedulerError","DEBUG_NAME","DEBUG_ID","DEBUG_TYPE","NO_DEFAULT_VALUE","hasDeps","o","checkCircularInternal","dep","current","visited","deps","i","child","debug","cond","msg","obj","type","id","t","nextId","generateId","trackDependency","dependency","subscribers","fn","len","link","SubscriberLink","sub","syncDependencies","nextLinks","prevLinks","tracker","parked","node","existing","unsub","DependencyLink","version","ERROR_MESSAGES","max","dropped","wrapError","error","ErrorClass","context","isNativeError","originalMessage","finalMessage","ReactiveNode","ReactiveDependency","listener","isFn","subs","idx","last","newValue","oldValue","s","err","collectorEpoch","nextEpoch","nextVersion","v","flushExecutionCount","isFlushing","_flushEpoch","currentFlushEpoch","startFlush","endFlush","incrementFlushExecutionCount","Scheduler","callback","started","epoch","bQueue","targetBuffer","currentSize","job","iterations","jobs","count","e","droppedCount","scheduler","trackingContext","prev","untracked","AtomImpl","initialValue","sync","flags","atom","options","ArrayPool","limit","capacity","enableStats","arr","emptyConst","acquired","released","rejected","leakCount","EMPTY_LINKS","linksArrayPool","isAtom","isComputed","isEffect","isPromise","value","MAX_ASYNC_RETRIES","MAX_PROMISE_ID","IDLE","DIRTY","PENDING","RESOLVED","REJECTED","HAS_ERROR","RECOMPUTING","DISPOSED","IS_COMPUTED","getAsyncState","ComputedAtomImpl","retries","def","hasDef","links","collected","computedDep","depErrors","j","committed","result","commitErr","promise","promiseId","res","sum","throwErr","computed","EffectImpl","plen","plink","unsubscribe","wrapped","force","execId","cleanup","prevContext","now","errorObj","effect","effectInstance","batch"],"mappings":"mOAGO,MAAMA,EAAa,CACxB,KAAM,OACN,QAAS,UACT,SAAU,WACV,SAAU,UACZ,EAKaC,EAAqB,CAChC,SAAU,EACV,UAAW,CACb,EAKaC,EAAuB,CAClC,SAAU,EAEV,YAAa,EACb,MAAO,EACP,KAAM,GACN,QAAS,GACT,SAAU,GACV,SAAU,IACV,YAAa,IACb,UAAW,GACb,EAKaC,EAAmB,CAC9B,SAAU,EACV,KAAM,EACN,uBAAwB,EAC1B,EAKaC,GAAc,CACzB,SAAU,IACV,YAAa,IACb,aAAc,EAChB,EAKaC,EAAmB,CAE9B,0BAA2B,IAC3B,0BAA2B,IAG3B,yBAA0B,IAC1B,qBAAsB,IACtB,qBAAsB,GAGtB,kBAAmB,IACnB,6BAA8B,GAChC,EAKaC,EAAe,CAC1B,mBAAoB,EACtB,EAKaC,EAAU,WAKVC,EACV,OAAO,QAAY,KAAe,QAAQ,KAAO,QAAQ,IAAI,WAAa,cAC1E,OAAO,QAAY,KAAe,CAAC,CAAC,QAK1BC,GAAsC,OAAO,OAAO,EAAE,ECzF5D,MAAMC,UAAkB,KAAM,CACnC,YACEC,EACOC,EAAsB,KACtBC,EAAc,GACrB,CACA,MAAMF,CAAO,EAHN,KAAA,MAAAC,EACA,KAAA,YAAAC,EAGP,KAAK,KAAO,WACd,CACF,CAGO,MAAMC,UAAsBJ,CAAU,CAC3C,YAAYC,EAAiBC,EAAsB,KAAM,CACvD,MAAMD,EAASC,EAAO,EAAI,EAC1B,KAAK,KAAO,eACd,CACF,CAGO,MAAMG,UAAoBL,CAAU,CACzC,YAAYC,EAAiBC,EAAsB,KAAM,CACvD,MAAMD,EAASC,EAAO,EAAK,EAC3B,KAAK,KAAO,aACd,CACF,CAGO,MAAMI,UAAuBN,CAAU,CAC5C,YAAYC,EAAiBC,EAAsB,KAAM,CACvD,MAAMD,EAASC,EAAO,EAAK,EAC3B,KAAK,KAAO,gBACd,CACF,CC/BO,MAAMK,SAAoB,sBAAsB,EAC1CC,UAAkB,eAAe,EACjCC,SAAoB,iBAAiB,EACrCC,SAA0B,2BAA2B,EAK5DC,GAAWC,GACf,iBAAkBA,GAAK,MAAM,QAASA,EAAgC,YAAY,EAKpF,SAASC,EAAsBC,EAAiBC,EAAiBC,EAA4B,CAE3F,GAAIF,IAAQC,EACV,MAAM,IAAIX,EACR,0FAAA,EAKJ,GAAI,CAAAY,EAAQ,IAAIF,EAAI,EAAE,IACtBE,EAAQ,IAAIF,EAAI,EAAE,EAEdH,GAAQG,CAAG,GAAG,CAChB,MAAMG,EAAOH,EAAI,aAEjB,QAASI,EAAI,EAAGA,EAAID,EAAK,OAAQC,IAAK,CACpC,MAAMC,EAAQF,EAAKC,CAAC,EAChBC,GACFN,EAAsBM,EAAOJ,EAASC,CAAO,CAEjD,CACF,CACF,CAKO,MAAMI,EAAqB,CAEhC,QAAStB,EAET,iBAAkBF,EAAa,mBAE/B,KAAKyB,EAAMC,EAAK,CACVxB,GAAU,KAAK,SAAWuB,GAC5B,QAAQ,KAAK,iBAAiBC,CAAG,EAAE,CAEvC,EAEA,cAAcR,EAAKC,EAAS,CAC1B,GAAID,IAAQC,EACV,MAAM,IAAIX,EAAc,qCAAqC,EAG3DN,GAAU,KAAK,SACjBe,EAAsBC,EAAKC,EAAS,IAAI,GAAK,CAEjD,EAEA,gBAAgBQ,EAAKC,EAAMC,EAAI,CAC7B,GAAI,CAAC3B,GAAU,CAAC,KAAK,QAAS,OAE9B,MAAM4B,EAAIH,EACVG,EAAEnB,CAAU,EAAI,GAAGiB,CAAI,IAAIC,CAAE,GAC7BC,EAAElB,EAAQ,EAAIiB,EACdC,EAAEjB,CAAU,EAAIe,CAClB,EAEA,aAAeD,GACZA,IAAyChB,CAAU,EAEtD,aAAegB,GACZA,IAAyCd,CAAU,CACxD,EAKA,IAAIkB,GAAS,EAKN,MAAMC,GAAa,IAAoBD,KCtFvC,SAASE,EACdC,EACAf,EACAgB,EACM,CACN,GAAI,OAAOhB,GAAY,WAAY,CACjC,MAAMiB,EAAKjB,EAKX,QAASG,EAAI,EAAGe,EAAMF,EAAY,OAAQb,EAAIe,EAAKf,IAAK,CACtD,MAAMgB,EAAOH,EAAYb,CAAC,EAC1B,GAAIgB,GAAQA,EAAK,KAAOF,EAAI,MAC9B,CACAD,EAAY,KAAK,IAAII,EAAeH,EAAI,MAAS,CAAC,EAClD,MACF,CAEA,GAAI,kBAAoBjB,EAAoB,CACzCA,EAAiC,cAAce,CAAU,EAC1D,MACF,CAEA,MAAMM,EAAMrB,EACZ,QAASG,EAAI,EAAGe,EAAMF,EAAY,OAAQb,EAAIe,EAAKf,IAAK,CACtD,MAAMgB,EAAOH,EAAYb,CAAC,EAC1B,GAAIgB,GAAQA,EAAK,MAAQE,EAAK,MAChC,CACAL,EAAY,KAAK,IAAII,EAAe,OAAWC,CAAG,CAAC,CACrD,CAOO,SAASC,EACdC,EACAC,EACAC,EACM,CAEN,MAAMC,MAAa,IACnB,QAASvB,EAAI,EAAGe,EAAMM,EAAU,OAAQrB,EAAIe,EAAKf,IAAK,CACpD,MAAMgB,EAAOK,EAAUrB,CAAC,EACpBgB,GAAM,OACRO,EAAO,IAAIP,EAAK,KAAMA,EAAK,KAAK,CAEpC,CAGA,QAAShB,EAAI,EAAGe,EAAMK,EAAU,OAAQpB,EAAIe,EAAKf,IAAK,CACpD,MAAMgB,EAAOI,EAAUpB,CAAC,EACxB,GAAI,CAACgB,EAAM,SAEX,MAAMQ,EAAOR,EAAK,KACZS,EAAWF,EAAO,IAAIC,CAAI,EAC5BC,IAAa,QAEfT,EAAK,MAAQS,EACbF,EAAO,OAAOC,CAAI,IAGlBtB,EAAM,cAAcsB,EAAMF,CAAO,EACjCN,EAAK,MAAQQ,EAAK,UAAUF,CAAO,EAEvC,CAGA,UAAWI,KAASH,EAAO,SACzBG,EAAA,CAEJ,CAKO,MAAMC,CAAe,CAG1B,YACSH,EACAI,EACPF,EAAkC,OAClC,CAHO,KAAA,KAAAF,EACA,KAAA,QAAAI,EAIP,KAAK,MAAQF,CACf,CACF,CAKO,MAAMT,CAAkB,CAI7B,YAAYH,EAAwDI,EAA6B,CAE/F,KAAK,GAAKJ,EACV,KAAK,IAAMI,CACb,CACF,CC1GO,MAAMW,EAAiB,CAE5B,0BAA2B,qCAC3B,kCAAmC,kDACnC,4BAA6B,+BAC7B,kCAAmC,qCACnC,6BAA8B,+BAC9B,kBAAmB,wCAGnB,iCAAkC,qDAClC,kCAAmC,8BAGnC,wBAAyB,mCACzB,wBAAyB,0BACzB,sBAAuB,wBACvB,gBAAiB,mCAGjB,yBAA0B,CAACC,EAAaC,IACtC,6BAA6BD,CAAG,eAAeC,CAAO,yCAGxD,gCAAiC,2CAGjC,gCACE,0EACJ,ECvBO,SAASC,EACdC,EACAC,EACAC,EACW,CAEX,GAAIF,aAAiBnD,EACnB,OAAOmD,EAGT,MAAMG,EAAgBH,aAAiB,MACjCI,EAAkBD,EAAgBH,EAAM,QAAU,OAAOA,CAAK,EAC9DjD,EAAQoD,EAAgBH,EAAQ,OAGhCK,EAAe,GADRF,EAAgBH,EAAM,YAAY,KAAO,kBAC1B,KAAKE,CAAO,MAAME,CAAe,GAE7D,OAAO,IAAIH,EAAWI,EAActD,CAAK,CAC3C,CChBO,MAAMuD,CAAa,CAAnB,aAAA,CAEL,KAAA,MAAQ,EAER,KAAA,QAAU,EAEV,KAAA,eAAiB,GAEjB,KAAS,GAAmB7B,KAAe/B,CAAA,CAC7C,CAKO,MAAe6D,UAA8BD,CAAa,CAM/D,UAAUE,EAA2E,CACnF,MAAMC,EAAO,OAAOD,GAAa,WAEjC,GAAI,CAACC,IAAS,CAACD,GAAY,OAAQA,EAAwB,SAAY,YACrE,MAAMT,EACJ,IAAI,UAAU,oBAAoB,EAClClD,EACA+C,EAAe,gCAAA,EAInB,MAAMc,EAAO,KAAK,aAClB,QAAS3C,EAAI,EAAGe,EAAM4B,EAAK,OAAQ3C,EAAIe,EAAKf,IAAK,CAC/C,MAAMkB,EAAMyB,EAAK3C,CAAC,EAClB,GAAKkB,IACDwB,EAAOxB,EAAI,KAAOuB,EAAWvB,EAAI,MAAQuB,GAC3C,OAAI7D,GAAQ,QAAQ,KAAK,iCAAiC,EACnD,IAAM,CAAC,CAElB,CAEA,MAAMoC,EAAO,IAAIC,EACfyB,EAAQD,EAAoD,OAC3DC,EAAkC,OAA1BD,CAA0B,EAGrC,OAAAE,EAAK,KAAK3B,CAAI,EAEP,IAAM,KAAK,aAAaA,CAAI,CACrC,CAEQ,aAAaA,EAA+B,CAClD,MAAM2B,EAAO,KAAK,aACZC,EAAMD,EAAK,QAAQ3B,CAAI,EAC7B,GAAI4B,IAAQ,GAAI,OAGhB,MAAMC,EAAOF,EAAK,IAAA,EACdC,EAAMD,EAAK,QAAUE,IACvBF,EAAKC,CAAG,EAAIC,EAEhB,CAEA,iBAA0B,CACxB,OAAO,KAAK,aAAa,MAC3B,CAEU,mBAAmBC,EAAyBC,EAA+B,CACnF,GAAI,KAAK,aAAa,SAAW,EAAG,OAEpC,MAAMJ,EAAO,KAAK,aAAa,MAAM,CAAC,EAChC5B,EAAM4B,EAAK,OAEjB,QAAS3C,EAAI,EAAGA,EAAIe,EAAKf,IAAK,CAC5B,MAAMgD,EAAIL,EAAK3C,CAAC,EAChB,GAAKgD,EACL,GAAI,CACEA,EAAE,GAAIA,EAAE,GAAGF,EAAUC,CAAQ,EACxBC,EAAE,KAAKA,EAAE,IAAI,QAAA,CACxB,OAASC,EAAK,CACZ,KAAK,mBAAmBA,CAAG,CAC7B,CACF,CACF,CAEQ,mBAAmBA,EAAoB,CAC7C,QAAQ,MAAMjB,EAAUiB,EAAKnE,EAAW+C,EAAe,iCAAiC,CAAC,CAC3F,CACF,CChGA,IAAIqB,EAAiB,EAKd,MAAMC,EAAY,KACvBD,EAAkBA,EAAiB,EAAKvE,GAAW,EAC5CuE,GAOIE,EAAeC,GAAeA,EAAI,EAAK1E,EAE7C,IAAI2E,EAAsB,EAC7BC,EAAa,GACbC,EAAc,EAGX,MAAMC,GAAoB,IAAMD,EAKhC,SAASE,IAAsB,CACpC,OAAIH,GACE3E,GAAQ,QAAQ,KAAK,4CAA4C,EAC9D,KAGT2E,EAAa,GACbC,EAAcL,EAAA,EACdG,EAAsB,EACf,GACT,CAGO,MAAMK,GAAW,IAAM,CAC5BJ,EAAa,EACf,EAKaK,GAA+B,IAAOL,EAAa,EAAED,EAAsB,EC7BxF,MAAMO,EAAU,CAAhB,aAAA,CAEE,KAAA,aAAiD,CAAC,CAAA,EAAI,EAAE,EACxD,KAAA,aAAe,EACf,KAAA,MAAQ,EAGR,KAAA,OAAS,EAGT,KAAA,cAAgB,GAChB,KAAA,YAAc,GACd,KAAA,gBAAkB,GAGlB,KAAA,YAAc,EACd,KAAA,YAA8B,CAAA,EAC9B,KAAA,gBAAkB,EAGlB,KAAA,oBAA8BpF,EAAiB,qBAG/C,KAAA,WAAsD,KAGtD,KAAiB,cAAgB,KAAK,SAAS,KAAK,IAAI,CAAA,CAExD,IAAI,OAAwB,CAC1B,OAAI,KAAK,eAAiB,KAAK,gBAAwB,EACnD,KAAK,YAAoB,EACtB,CACT,CAEA,IAAI,WAAoB,CACtB,OAAO,KAAK,KACd,CAEA,IAAI,YAAsB,CACxB,OAAO,KAAK,WACd,CAKA,SAASqF,EAA8B,CACrC,GAAIlF,GAAU,OAAOkF,GAAa,WAChC,MAAM,IAAI1E,EAAe,uCAAuC,EAIlE,GAAI0E,EAAS,aAAe,KAAK,OAGjC,IAFAA,EAAS,WAAa,KAAK,OAEvB,KAAK,aAAe,KAAK,gBAAiB,CAC5C,KAAK,YAAY,KAAK,iBAAiB,EAAIA,EAC3C,MACF,CAGA,KAAK,aAAa,KAAK,YAAY,EAAG,KAAK,OAAO,EAAIA,EAGjD,KAAK,eACR,KAAK,OAAA,EAET,CAKA,QAAe,CACT,KAAK,eAAiB,KAAK,QAAU,IACzC,KAAK,cAAgB,GAErB,eAAe,KAAK,aAAa,EACnC,CAKQ,UAAiB,CACvB,GAAI,CACF,GAAI,KAAK,QAAU,EAAG,OAEtB,MAAMC,EAAUL,GAAA,EAChB,KAAK,YAAA,EACDK,GAASJ,GAAA,CACf,QAAA,CACE,KAAK,cAAgB,GAEjB,KAAK,MAAQ,GAAK,CAAC,KAAK,aAC1B,KAAK,OAAA,CAET,CACF,CAEA,YAAmB,CACjB,KAAK,gBAAkB,GACvB,MAAMI,EAAUL,GAAA,EAChB,GAAI,CACF,KAAK,iBAAA,EACL,KAAK,YAAA,CACP,QAAA,CACE,KAAK,gBAAkB,GACnBK,GAASJ,GAAA,CACf,CACF,CAEA,kBAAyB,CACvB,GAAI,KAAK,kBAAoB,EAAG,OAGhC,MAAMK,EAAQ,EAAE,KAAK,OACfC,EAAS,KAAK,YACdC,EAAe,KAAK,aAAa,KAAK,YAAY,EACxD,IAAIC,EAAc,KAAK,MAGvB,QAASnE,EAAI,EAAGA,EAAI,KAAK,gBAAiBA,IAAK,CAC7C,MAAMoE,EAAMH,EAAOjE,CAAC,EAEhBoE,EAAI,aAAeJ,IACrBI,EAAI,WAAaJ,EACjBE,EAAaC,GAAa,EAAIC,EAElC,CAEA,KAAK,MAAQD,EACb,KAAK,gBAAkB,EAGnBF,EAAO,OAASxF,EAAiB,+BACnCwF,EAAO,OAAS,EAEpB,CAEA,aAAoB,CAClB,IAAII,EAAa,EAEjB,KAAO,KAAK,MAAQ,GAAG,CAErB,GAAI,EAAEA,EAAa,KAAK,oBAAqB,CAC3C,KAAK,qBAAA,EACL,MACF,CAEA,KAAK,cAAA,EAEL,KAAK,iBAAA,CACP,CACF,CAEA,eAAsB,CACpB,MAAMzB,EAAM,KAAK,aACX0B,EAAO,KAAK,aAAa1B,CAAG,EAC5B2B,EAAQ,KAAK,MAGnB,KAAK,aAAe3B,EAAM,EAC1B,KAAK,MAAQ,EACb,KAAK,SAEL,QAAS5C,EAAI,EAAGA,EAAIuE,EAAOvE,IAEzB,GAAI,CACFsE,EAAKtE,CAAC,EAAA,CACR,OAASwE,EAAG,CACV,QAAQ,MAAM,IAAIpF,EAAe,4CAA6CoF,CAAU,CAAC,CAC3F,CAGFF,EAAK,OAAS,CAChB,CAEQ,sBAA6B,CACnC,MAAMG,EAAe,KAAK,MAAQ,KAAK,gBAUvC,GATA,QAAQ,MACN,IAAIrF,EACFyC,EAAe,yBAAyB,KAAK,oBAAqB4C,CAAY,CAAA,CAChF,EAEF,KAAK,MAAQ,EACb,KAAK,aAAa,KAAK,YAAY,EAAG,OAAS,EAC/C,KAAK,gBAAkB,EAEnB,KAAK,WACP,GAAI,CACF,KAAK,WAAWA,CAAY,CAC9B,MAAQ,CAAC,CAEb,CAEA,YAAmB,CACjB,KAAK,cACL,KAAK,YAAc,EACrB,CAEA,UAAiB,CACf,GAAI,KAAK,cAAgB,EAAG,CACtB7F,GAAQ,QAAQ,KAAK,4DAA4D,EACrF,MACF,CAEI,EAAE,KAAK,cAAgB,IACzB,KAAK,WAAA,EACL,KAAK,YAAc,GAEvB,CAEA,sBAAsBkD,EAAmB,CACvC,GAAIA,EAAMrD,EAAiB,qBACzB,MAAM,IAAIW,EACR,yCAAyCX,EAAiB,oBAAoB,EAAA,EAElF,KAAK,oBAAsBqD,CAC7B,CACF,CAEO,MAAM4C,EAAY,IAAIb,GC1OhBc,EAAkB,CAE7B,QAAS,KAST,IAAOlC,EAAoB3B,EAAgB,CACzC,MAAM8D,EAAO,KAAK,QAClB,KAAK,QAAUnC,EACf,GAAI,CACF,OAAO3B,EAAA,CACT,QAAA,CACE,KAAK,QAAU8D,CACjB,CACF,CACF,ECjBO,SAASC,GAAa/D,EAAgB,CAC3C,MAAM8D,EAAOD,EAAgB,QAG7B,GAAIC,IAAS,KAAM,OAAO9D,EAAA,EAE1B6D,EAAgB,QAAU,KAC1B,GAAI,CACF,OAAO7D,EAAA,CACT,QAAA,CACE6D,EAAgB,QAAUC,CAC5B,CACF,CCRA,MAAME,WAAoBtC,CAAiD,CAQzE,YAAYuC,EAAiBC,EAAe,CAC1C,MAAA,EANF,KAAQ,iBAAkC,OAE1C,KAAQ,YAAwC,OAChD,KAAU,aAAoC,CAAA,EAI5C,KAAK,OAASD,EACVC,IAAM,KAAK,OAASzG,EAAiB,MACzC2B,EAAM,gBAAgB,KAAM,OAAQ,KAAK,EAAE,CAC7C,CAEA,IAAI,OAAW,CACb,MAAML,EAAU8E,EAAgB,QAChC,OAAI9E,GACFc,EAAgB,KAAMd,EAAS,KAAK,YAAY,EAE3C,KAAK,MACd,CAEA,IAAI,MAAMiD,EAAa,CACrB,MAAMC,EAAW,KAAK,OACtB,GAAI,OAAO,GAAGA,EAAUD,CAAQ,EAAG,OAEnC,KAAK,OAASA,EACd,KAAK,QAAUM,EAAY,KAAK,OAAO,EAEvC,MAAM6B,EAAQ,KAAK,MACnB,GAAI,OAAK,aAAa,SAAW,GAAKA,EAAQ1G,EAAiB,wBAQ/D,IAJA,KAAK,iBAAmBwE,EACxB,KAAK,MAAQkC,EAAQ1G,EAAiB,uBAGlC0G,EAAQ1G,EAAiB,MAAQ,CAACmG,EAAU,WAAY,CAC1D,KAAK,oBAAA,EACL,MACF,CAGK,KAAK,cAER,KAAK,YAAc,IAAM,KAAK,oBAAA,GAEhCA,EAAU,SAAS,KAAK,WAAW,EACrC,CAKQ,qBAA4B,CAClC,MAAMO,EAAQ,KAAK,MAEnB,GAAI,EAAEA,EAAQ1G,EAAiB,yBAA2B0G,EAAQ1G,EAAiB,SACjF,OAGF,MAAMwE,EAAW,KAAK,iBACtB,KAAK,iBAAmB,OACxB,KAAK,OAAS,IAEd,KAAK,mBAAmB,KAAK,OAAQA,CAAQ,CAC/C,CAEA,MAAU,CACR,OAAO,KAAK,MACd,CAEA,SAAgB,CACV,KAAK,MAAQxE,EAAiB,WAElC,KAAK,aAAa,OAAS,EAC3B,KAAK,OAASA,EAAiB,SAE/B,KAAK,OAAS,OACd,KAAK,iBAAmB,OACxB,KAAK,YAAc,OACrB,CACF,CAQO,SAAS2G,GAAQH,EAAiBI,EAAuB,GAAqB,CACnF,OAAO,IAAIL,GAASC,EAAcI,EAAQ,MAAQ,EAAK,CACzD,CCjGO,MAAMC,EAAa,CAexB,YACmBC,EAAQ,GACRC,EAAW,IAC5BC,EAAc,GACd,CAHiB,KAAA,MAAAF,EACA,KAAA,SAAAC,EAhBnB,KAAiB,KAAc,CAAA,EAG/B,KAAQ,MAIG,KAYT,KAAK,MACH1G,GAAU2G,EACN,CACE,SAAU,EACV,SAAU,EACV,SAAU,CAAE,OAAQ,EAAG,SAAU,EAAG,SAAU,CAAA,CAAE,EAElD,IACR,CAKA,SAAe,CACb,OAAI,KAAK,OACP,KAAK,MAAM,WAGN,KAAK,KAAK,IAAA,GAAS,CAAA,CAC5B,CAQA,QAAQC,EAAUC,EAAiC,CACjD,GAAI,EAAAA,GAAcD,IAAQC,GAE1B,IAAID,EAAI,OAAS,KAAK,SAAU,CAC1B,KAAK,OAAO,KAAK,MAAM,SAAS,WACpC,MACF,CAEA,GAAI,KAAK,KAAK,QAAU,KAAK,MAAO,CAC9B,KAAK,OAAO,KAAK,MAAM,SAAS,WACpC,MACF,CAEA,GAAI,OAAO,SAASA,CAAG,EAAG,CACpB,KAAK,OAAO,KAAK,MAAM,SAAS,SACpC,MACF,CAEAA,EAAI,OAAS,EACb,KAAK,KAAK,KAAKA,CAAG,EAEd,KAAK,OACP,KAAK,MAAM,WAEf,CAKA,UAA6B,CAC3B,GAAI,CAAC,KAAK,MAAO,OAAO,KAExB,KAAM,CAAE,SAAAE,EAAU,SAAAC,EAAU,SAAAC,CAAA,EAAa,KAAK,MACxCC,EACJH,EAAWC,GAAYC,EAAS,OAASA,EAAS,SAAWA,EAAS,UAExE,MAAO,CACL,SAAAF,EACA,SAAAC,EACA,SAAU,CAAE,GAAGC,CAAA,EACf,OAAQC,EACR,SAAU,KAAK,KAAK,MAAA,CAExB,CAKA,OAAc,CACZ,KAAK,KAAK,OAAS,EACf,KAAK,QACP,KAAK,MAAQ,CACX,SAAU,EACV,SAAU,EACV,SAAU,CAAE,OAAQ,EAAG,SAAU,EAAG,SAAU,CAAA,CAAE,EAGtD,CACF,CC9GO,MAAMC,EAAgC,OAAO,OAClD,CAAA,CACF,EAEaC,EAAiB,IAAIX,GCA3B,SAASY,GAAO3F,EAAmC,CACxD,OACEA,IAAQ,MACR,OAAOA,GAAQ,UACf,UAAWA,GACX,OAAQA,EAAgC,WAAc,UAE1D,CAYO,SAAS4F,GAAW5F,EAAmC,CAC5D,OAAO2F,GAAO3F,CAAG,GAAK,OAAQA,EAAiC,YAAe,UAChF,CAKO,SAAS6F,GAAS7F,EAAmC,CAC1D,OACEA,IAAQ,MACR,OAAOA,GAAQ,UACf,OAAQA,EAA8B,SAAY,YAClD,OAAQA,EAA0B,KAAQ,UAE9C,CAKO,SAAS8F,GAAaC,EAAqC,CAChE,OACEA,IAAU,MACV,OAAOA,GAAU,UACjB,OAAQA,EAA6B,MAAS,UAElD,CC3BA,MAAMC,GAAoB,EACpBC,GAAiB,OAAO,iBAAmB,EAE3C,CAAE,KAAAC,EAAM,MAAAC,EAAO,QAAAC,EAAS,SAAAC,EAAU,SAAAC,EAAU,UAAAC,EAAW,YAAAC,EAAa,SAAAC,EAAU,YAAAC,EAAA,EAClFzI,EAEF,SAAS0I,GAAc/B,EAA+B,CACpD,OAAIA,EAAQyB,EAAiBtI,EAAW,SACpC6G,EAAQwB,EAAgBrI,EAAW,QACnC6G,EAAQ0B,EAAiBvI,EAAW,SACjCA,EAAW,IACpB,CAKA,MAAM6I,WAA4BzE,CAA6D,CAwB7F,YAAY1B,EAA0BqE,EAA8B,GAAI,CACtE,GAAI,OAAOrE,GAAO,iBAAkB,IAAI5B,EAAc2C,EAAe,yBAAyB,EAC9F,MAAA,EAxBF,KAAQ,OAAuB,KAE/B,KAAQ,WAAa,EAQrB,KAAU,aAAoC,CAAA,EAC9C,KAAQ,OAA2BiE,EAGnC,KAAQ,4BAA8B,EACtC,KAAQ,iBAAmB,EAG3B,KAAQ,YAAc,GACtB,KAAQ,YAAgCA,EACxC,KAAQ,YAAc,EAMpB,KAAK,OAAS,OAEd,KAAK,MAAQiB,GAAcP,EAAQD,EACnC,KAAK,OAASpB,EAAQ,OAAS,OAAO,GACtC,KAAK,IAAMrE,EACX,KAAK,cAAgB,iBAAkBqE,EAAUA,EAAQ,aAAgB3F,EACzE,KAAK,SAAW2F,EAAQ,SAAW,KACnC,MAAM+B,EAAU/B,EAAQ,gBAMxB,GALA,KAAK,iBAAmB+B,GAAW,MAAQA,GAAW,EAAIA,EAAUb,GAEpEnG,EAAM,gBAAgB,KAAM,WAAY,KAAK,EAAE,EAG3CiF,EAAQ,OAAS,GACnB,GAAI,CACF,KAAK,WAAA,CACP,MAAQ,CAER,CAEJ,CAEQ,QAAe,CACrB,MAAMtF,EAAU8E,EAAgB,QAC5B9E,GAASc,EAAgB,KAAMd,EAAS,KAAK,YAAY,CAC/D,CAEA,IAAI,OAAW,CACb,KAAK,OAAA,EAEL,MAAMoF,EAAQ,KAAK,MACnB,IAAKA,GAASyB,EAAWF,EAAQD,MAAWG,EAC1C,OAAO,KAAK,OAGd,GAAIzB,EAAQ6B,EACV,MAAM,IAAI5H,EAAc2C,EAAe,iBAAiB,EAG1D,GAAIoD,EAAQ4B,EAAa,CACvB,GAAI,KAAK,gBAAmBrH,EAAwB,OAAO,KAAK,cAChE,MAAM,IAAIN,EAAc2C,EAAe,4BAA4B,CACrE,CAEA,GAAIoD,GAASuB,EAAQD,KACnB,KAAK,WAAA,EAED,KAAK,MAAQG,GAAU,OAAO,KAAK,OAIzC,MAAMS,EAAM,KAAK,cACXC,EAASD,IAAS3H,EAExB,GAAI,KAAK,MAAQiH,EAAS,CACxB,GAAIW,EAAQ,OAAOD,EACnB,MAAM,IAAIjI,EAAc2C,EAAe,iCAAiC,CAC1E,CAEA,GAAI,KAAK,MAAQ8E,EAAU,CACzB,GAAK,KAAK,QAA0B,aAAeS,EAAQ,OAAOD,EAClE,MAAM,KAAK,MACb,CAEA,OAAO,KAAK,MACd,CAEA,MAAU,CACR,OAAO,KAAK,MACd,CAEA,IAAI,OAAwB,CAC1B,YAAK,OAAA,EACEH,GAAc,KAAK,KAAK,CACjC,CAEA,IAAI,UAAoB,CAEtB,GADA,KAAK,OAAA,EACD,KAAK,OAASL,EAAWC,GAAY,MAAO,GAGhD,MAAMS,EAAQ,KAAK,OACnB,QAASrH,EAAI,EAAGe,EAAMsG,EAAM,OAAQrH,EAAIe,EAAKf,IAAK,CAChD,MAAMwB,EAAO6F,EAAMrH,CAAC,GAAG,KACvB,GAAIwB,GAAQA,EAAK,MAAQoF,EAAW,MAAO,EAC7C,CACA,MAAO,EACT,CAEA,IAAI,SAAmB,CACrB,MAAO,CAAC,KAAK,QACf,CAEA,IAAI,QAA2B,CAE7B,GADA,KAAK,OAAA,EACD,CAAC,KAAK,SAAU,OAAO/H,GAG3B,MAAMyI,EAAqB,CAAA,EACvB,KAAK,QAAQA,EAAU,KAAK,KAAK,MAAM,EAE3C,MAAMD,EAAQ,KAAK,OACnB,QAASrH,EAAI,EAAGe,EAAMsG,EAAM,OAAQrH,EAAIe,EAAKf,IAAK,CAChD,MAAMJ,EAAMyH,EAAMrH,CAAC,EAAG,KACtB,GAAIJ,EAAI,MAAQgH,EAAW,CACzB,MAAMW,EAAc3H,EACpB,GAAI2H,EAAY,OAAQ,CACtB,MAAMC,EAAYD,EAAY,OAC9B,QAASE,EAAI,EAAGA,EAAID,EAAU,OAAQC,IAAK,CACzC,MAAMxE,EAAMuE,EAAUC,CAAC,EACnBxE,GAAOqE,EAAU,QAAQrE,CAAG,IAAM,IAAIqE,EAAU,KAAKrE,CAAG,CAC9D,CACF,CACF,CACF,CAEA,OAAO,OAAO,OAAOqE,CAAS,CAChC,CAEA,IAAI,WAA0B,CAC5B,YAAK,OAAA,EACE,KAAK,MACd,CAEA,IAAI,WAAqB,CACvB,YAAK,OAAA,GACG,KAAK,MAAQb,KAAa,CACpC,CAEA,IAAI,YAAsB,CACxB,YAAK,OAAA,GACG,KAAK,MAAQC,KAAc,CACrC,CAEA,YAAmB,CACjB,KAAK,WAAA,CACP,CAEA,SAAgB,CACd,GAAI,KAAK,MAAQI,EAAU,OAE3B,MAAMO,EAAQ,KAAK,OACnB,GAAIA,IAAUvB,EAAa,CACzB,QAAS9F,EAAI,EAAGe,EAAMsG,EAAM,OAAQrH,EAAIe,EAAKf,IAC3CqH,EAAMrH,CAAC,EAAG,QAAA,EAEZ+F,EAAe,QAAQsB,CAAK,EAC5B,KAAK,OAASvB,CAChB,CAEA,KAAK,aAAa,OAAS,EAC3B,KAAK,MAAQgB,EAAWN,EAAQD,EAGhC,KAAK,OAAS,KACd,KAAK,OAAS,MAChB,CAEA,cAAc3G,EAAuB,CAEnC,GAAIA,EAAI,iBAAmB,KAAK,YAIhC,IAHAA,EAAI,eAAiB,KAAK,YAGtB,KAAK,YAAc,KAAK,YAAY,OAAQ,CAC9C,MAAMoB,EAAO,KAAK,YAAY,KAAK,WAAW,EAC9CA,EAAK,KAAOpB,EACZoB,EAAK,QAAUpB,EAAI,OACrB,MACE,KAAK,YAAY,KAAK,IAAI+B,EAAe/B,EAAKA,EAAI,OAAO,CAAC,EAE5D,KAAK,cACP,CAEQ,YAAmB,CACzB,GAAI,KAAK,MAAQiH,EAAa,OAC9B,KAAK,OAASA,EAEd,MAAMxF,EAAY,KAAK,OACvB,KAAK,YAAc8B,EAAA,EACnB,KAAK,YAAc4C,EAAe,QAAA,EAClC,KAAK,YAAc,EAEnB,IAAI2B,EAAY,GAChB,GAAI,CAEF,MAAMC,EAAShD,EAAgB,IAAI,KAAM,KAAK,GAAG,EAGjD,KAAK,YAAY,OAAS,KAAK,YAC/BxD,EAAiB,KAAK,YAAaE,EAAW,IAAI,EAClD,KAAK,OAAS,KAAK,YACnBqG,EAAY,GAGRvB,GAAUwB,CAAM,EAClB,KAAK,wBAAwBA,CAAM,EAEnC,KAAK,oBAAoBA,CAAM,CAEnC,OAASnD,EAAG,CAEV,GAAI,CAACkD,EACH,GAAI,CACF,KAAK,YAAY,OAAS,KAAK,YAC/BvG,EAAiB,KAAK,YAAaE,EAAW,IAAI,EAClD,KAAK,OAAS,KAAK,YACnBqG,EAAY,EACd,OAASE,EAAW,CACdhJ,GACF,QAAQ,KAAK,0DAA2DgJ,CAAS,CAErF,CAEF,KAAK,aAAapD,EAAY3C,EAAe,4BAA6B,EAAI,CAChF,QAAA,CAEM6F,GAAarG,IAAcyE,EAC7BC,EAAe,QAAQ1E,CAAS,EACtBqG,GACV3B,EAAe,QAAQ,KAAK,WAAW,EAIzC,KAAK,YAAc,GACnB,KAAK,YAAcD,EACnB,KAAK,YAAc,EACnB,KAAK,OAAS,CAACe,CACjB,CACF,CAEQ,wBAAwBgB,EAA2B,CAEzD,KAAK,OAAS,KAAK,MAAQpB,GAAW,KAEtC,KAAK,mBAAmB,OAAW,MAAS,EAE5C,KAAK,4BAA8B,KAAK,wBAAA,EACxC,KAAK,iBAAmB,EAExB,KAAK,YAAc,KAAK,WAAa,GAAKH,GAC1C,MAAMwB,EAAY,KAAK,WAEvBD,EAAQ,KACLE,GAAQ,CACP,GAAID,IAAc,KAAK,WAGvB,IAAI,KAAK,4BAA8B,KAAK,4BAC1C,OAAI,KAAK,mBAAqB,KAAK,iBAC1B,KAAK,WAAA,EAEP,KAAK,aACV,IAAI5I,EACF,wCAAwC,KAAK,gBAAgB,WAAA,EAE/D2C,EAAe,iCAAA,EAInB,KAAK,oBAAoBkG,CAAG,EAC5B,KAAK,mBAAmBA,EAAK,MAAS,EACxC,EACC9E,GACC6E,IAAc,KAAK,YACnB,KAAK,aAAa7E,EAAKpB,EAAe,iCAAiC,CAAA,CAE7E,CAEQ,yBAAkC,CACxC,IAAImG,EAAM,EACV,MAAMX,EAAQ,KAAK,OACnB,QAASrH,EAAI,EAAGe,EAAMsG,EAAM,OAAQrH,EAAIe,EAAKf,IAC3CgI,GAAOX,EAAMrH,CAAC,EAAG,KAAK,QAExB,OAAOgI,CACT,CAEQ,aAAa/E,EAAc7C,EAAa6H,EAAW,GAAa,CACtE,MAAMhG,EAAQD,EAAUiB,EAAK/D,EAAekB,CAAG,EAW/C,GATI,CAAC6H,GAAY,EAAE,KAAK,MAAQtB,KAE9B,KAAK,QAAUvD,EAAY,KAAK,OAAO,GAGzC,KAAK,OAASnB,EAEd,KAAK,MAAS,KAAK,MAAQ,KAAwC0E,EAAWC,EAE1E,KAAK,SACP,GAAI,CACF,KAAK,SAAS3E,CAAK,CACrB,OAASuC,EAAG,CACV,QAAQ,MAAM3C,EAAe,gCAAiC2C,CAAC,CACjE,CAGF,GAAIyD,EAAU,MAAMhG,EACpB,KAAK,mBAAmB,OAAW,MAAS,CAC9C,CAEQ,oBAAoBmE,EAAgB,EAEtC,EAAE,KAAK,MAAQM,IAAa,CAAC,KAAK,OAAO,KAAK,OAAQN,CAAK,KAC7D,KAAK,QAAUhD,EAAY,KAAK,OAAO,GAGzC,KAAK,OAASgD,EACd,KAAK,OAAS,KAEd,KAAK,OAAS,KAAK,MAAQM,GAAY,IACzC,CAEA,SAAgB,CAEd,KAAK,WAAA,CACP,CAGA,YAAmB,CACb,KAAK,OAASG,EAAcL,KAChC,KAAK,OAASA,EACd,KAAK,mBAAmB,OAAW,MAAS,EAC9C,CACF,CAYO,SAAS0B,GACdpH,EACAqE,EAA8B,GACb,CACjB,OAAO,IAAI8B,GAAiBnG,EAAIqE,CAAO,CACzC,CCpYA,MAAMgD,WAAmB5F,CAAwD,CA0B/E,YAAYzB,EAAoBqE,EAAyB,GAAI,CAC3D,MAAA,EA1BF,KAAQ,SAAgC,KACxC,KAAQ,OAA2BW,EACnC,KAAQ,WAAsC,KAE9C,KAAQ,WAAsC,KAK9C,KAAQ,cAAgB,GACxB,KAAQ,gBAAkB,GAC1B,KAAQ,mBAAqB,EAS7B,KAAQ,gBAAkB,EAC1B,KAAQ,aAAe,EACvB,KAAQ,aAAe,EACvB,KAAQ,QAAU,EAIhB,KAAK,IAAMhF,EACX,KAAK,SAAWqE,EAAQ,SAAW,KACnC,KAAK,MAAQA,EAAQ,MAAQ,GAC7B,KAAK,eACHA,EAAQ,wBAA0B1G,EAAiB,0BACrD,KAAK,uBACH0G,EAAQ,uBAAyB1G,EAAiB,0BACpD,KAAK,oBAAsB0G,EAAQ,oBAAsB,GAEzDjF,EAAM,gBAAgB,KAAM,SAAU,KAAK,EAAE,CAC/C,CAEO,KAAY,CACjB,GAAI,KAAK,MAAQ7B,EAAmB,SAClC,MAAM,IAAIc,EAAY0C,EAAe,eAAe,EAEtD,KAAK,QAAQ,EAAI,CACnB,CAEO,SAAgB,CACjB,KAAK,MAAQxD,EAAmB,WACpC,KAAK,OAASA,EAAmB,SAEjC,KAAK,aAAA,EACL,KAAK,YAAY,KAAK,MAAM,EACxB,KAAK,SAAWyH,GAClBC,EAAe,QAAQ,KAAK,MAAM,EAIpC,KAAK,OAASD,EACd,KAAK,aAAe,OACtB,CAEO,cAAclG,EAAuB,CAK1C,GAHI,EAAE,KAAK,MAAQvB,EAAmB,YAGlCuB,EAAI,iBAAmB,KAAK,cAAe,OAC/CA,EAAI,eAAiB,KAAK,cAE1B,MAAMwB,EAAY,KAAK,WAGjBwD,EAAO,KAAK,WAClB,GAAIA,EACF,QAAS6C,EAAI,EAAGW,EAAOxD,EAAK,OAAQ6C,EAAIW,EAAMX,IAAK,CACjD,MAAMY,EAAQzD,EAAK6C,CAAC,EACpB,GAAIY,GAASA,EAAM,OAASzI,GAAOyI,EAAM,MAAO,CAC9CjH,EAAU,KAAK,IAAIO,EAAe/B,EAAKA,EAAI,QAASyI,EAAM,KAAK,CAAC,EAChEA,EAAM,MAAQ,OACd,MACF,CACF,CAGF,GAAI,CACF,MAAMC,EAAc1I,EAAI,UAAU,IAAM,CAItC,GAHI,KAAK,qBAAuB,KAAK,MAAQvB,EAAmB,YAC9DuB,EAAI,iBAAmB,KAAK,eAE1B,KAAK,MAAO,OAAO,KAAK,QAAA,EAGvB,KAAK,oBAAmB,aAAe,IAAM,KAAK,QAAA,GACvD8E,EAAU,SAAS,KAAK,YAAa,CACvC,CAAC,EACDtD,EAAU,KAAK,IAAIO,EAAe/B,EAAKA,EAAI,QAAS0I,CAAW,CAAC,CAClE,OAASrG,EAAO,CACd,MAAMsG,EAAUvG,EAAUC,EAAO9C,EAAa0C,EAAe,uBAAuB,EAEpF,GADA,QAAQ,MAAM0G,CAAO,EACjB,KAAK,SACP,GAAI,CACF,KAAK,SAASA,CAAO,CACvB,MAAQ,CAAC,CAGXnH,EAAU,KAAK,IAAIO,EAAe/B,EAAKA,EAAI,QAAS,MAAS,CAAC,CAChE,CACF,CAKO,QAAQ4I,EAAQ,GAAa,CAIlC,GAHI,KAAK,OAASnK,EAAmB,SAAWA,EAAmB,YAG/D,CAACmK,GAAS,KAAK,OAAO,OAAS,GAAK,CAAC,KAAK,WAAY,OAE1D,KAAK,oBAAA,EAEL,KAAK,OAASnK,EAAmB,UACjC,KAAK,aAAA,EAEL,MAAMgD,EAAY,KAAK,OAEvB,KAAK,WAAaA,IAAcyE,EAAczE,EAAY,KAG1D,MAAMD,EAAY2E,EAAe,QAAA,EACjC,KAAK,WAAa3E,EAClB,KAAK,cAAgB+B,EAAA,EAErB,IAAIuE,EAAY,GAChB,GAAI,CACF,MAAMC,EAAShD,EAAgB,IAAI,KAAM,KAAK,GAAG,EAKjD,GAJA,KAAK,OAASvD,EACdsG,EAAY,GAGR,KAAK,qBAAuBxH,EAAM,QAAS,CAC7C,MAAM8D,EAAQ,KAAK,cACnB,QAAShE,EAAI,EAAGe,EAAMK,EAAU,OAAQpB,EAAIe,EAAKf,IAAK,CACpD,MAAMJ,EAAMwB,EAAUpB,CAAC,EAAG,KACtBJ,EAAI,mBAAqBoE,GAC3B9D,EAAM,KACJ,GACA,mCAAmCA,EAAM,aAAaN,CAAG,GAAK,SAAS,kDAAA,CAG7E,CACF,CAGIuG,GAAUwB,CAAM,EAClB,KAAK,mBAAmBA,CAAM,EAE9B,KAAK,SAAW,OAAOA,GAAW,WAAaA,EAAS,IAE5D,OAAS1F,EAAO,CAEdyF,EAAY,GACZ,KAAK,sBAAsBzF,CAAK,EAChC,KAAK,SAAW,IAClB,QAAA,CACE,KAAK,sBAAsByF,EAAWrG,EAAWD,CAAS,EAC1D,KAAK,OAAS,EAChB,CACF,CAEQ,mBAAmByG,EAAiC,CAC1D,MAAMY,EAAS,EAAE,KAAK,QACtBZ,EAAQ,KACLa,GAAY,CAEX,GAAID,IAAW,KAAK,SAAW,KAAK,MAAQpK,EAAmB,SAAU,CACvE,GAAI,OAAOqK,GAAY,WACrB,GAAI,CACFA,EAAA,CACF,OAASlE,EAAG,CACV,KAAK,sBAAsBA,EAAG3C,EAAe,qBAAqB,CACpE,CAEF,MACF,CACI,OAAO6G,GAAY,aAAY,KAAK,SAAWA,EACrD,EACCzF,GAAQwF,IAAW,KAAK,SAAW,KAAK,sBAAsBxF,CAAG,CAAA,CAEtE,CAEQ,sBACNyE,EACArG,EACAD,EACM,CAGN,GAFA,KAAK,WAAa,KAEdsG,EAAW,CAEb,MAAM9C,EAAO,KAAK,WAClB,GAAIA,EACF,QAAS5E,EAAI,EAAGe,EAAM6D,EAAK,OAAQ5E,EAAIe,EAAKf,IAC1C4E,EAAK5E,CAAC,GAAG,QAAA,EAGTqB,IAAcyE,GAChBC,EAAe,QAAQ1E,CAAS,CAEpC,MAEE,KAAK,YAAYD,CAAS,EAC1B2E,EAAe,QAAQ3E,CAAS,EAGlC,KAAK,WAAa,IACpB,CAEQ,YAAYiG,EAA+B,CACjD,QAASrH,EAAI,EAAGe,EAAMsG,EAAM,OAAQrH,EAAIe,EAAKf,IAC3CqH,EAAMrH,CAAC,GAAG,QAAA,CAEd,CAEQ,UAAoB,CAC1B,MAAMqH,EAAQ,KAAK,OAEbsB,EAAchE,EAAgB,QACpCA,EAAgB,QAAU,KAE1B,GAAI,CACF,QAAS3E,EAAI,EAAGe,EAAMsG,EAAM,OAAQrH,EAAIe,EAAKf,IAAK,CAChD,MAAMgB,EAAOqG,EAAMrH,CAAC,EACdJ,EAAMoB,EAAK,KAGjB,GAAIpB,EAAI,MAAQtB,EAAqB,YACnC,GAAI,CAEIsB,EAA2B,KACnC,MAAQ,CACN,OAAIhB,GACF,QAAQ,KAAK,6BAA6BgB,EAAI,EAAE,2BAA2B,EAEtE,EACT,CAIF,GAAIA,EAAI,UAAYoB,EAAK,QAAS,MAAO,EAC3C,CACA,MAAO,EACT,QAAA,CACE2D,EAAgB,QAAUgE,CAC5B,CACF,CAEQ,cAAqB,CAC3B,GAAK,KAAK,SACV,IAAI,CACF,KAAK,SAAA,CACP,OAAS1G,EAAO,CACd,KAAK,sBAAsBA,EAAOJ,EAAe,qBAAqB,CACxE,CACA,KAAK,SAAW,KAClB,CAEQ,qBAA4B,CAClC,MAAMmC,EAAQP,GAAA,EAcd,GAbI,KAAK,kBAAoBO,IAC3B,KAAK,gBAAkBA,EACvB,KAAK,mBAAqB,GAGxB,EAAE,KAAK,mBAAqB,KAAK,wBACnC,KAAK,wBAAwB,YAAY,EACvCJ,GAAA,EAAiCnF,EAAiB,0BACpD,KAAK,wBAAwB,QAAQ,EAEvC,KAAK,kBAGDG,GAAU,OAAO,SAAS,KAAK,cAAc,EAAG,CAClD,MAAMgK,EAAM,KAAK,IAAA,EACjB,GAAIA,EAAM,KAAK,cAAgB,IAC7B,KAAK,aAAeA,EACpB,KAAK,aAAe,UACX,EAAE,KAAK,aAAe,KAAK,eAAgB,CACpD,MAAM3F,EAAM,IAAI9D,EAAY0C,EAAe,+BAA+B,EAC1E,WAAK,QAAA,EACL,KAAK,sBAAsBoB,CAAG,EACxBA,CACR,CACF,CACF,CAEA,IAAI,YAAsB,CACxB,OAAQ,KAAK,MAAQ5E,EAAmB,YAAc,CACxD,CACA,IAAI,gBAAyB,CAC3B,OAAO,KAAK,eACd,CACA,IAAI,aAAuB,CACzB,OAAQ,KAAK,MAAQA,EAAmB,aAAe,CACzD,CAEQ,wBAAwBiC,EAAsC,CACpE,MAAM2B,EAAQ,IAAI9C,EAChB,2BAA2BmB,CAAI,sBAAsB,KAAK,kBAAkB,uDAAuDgD,CAAmB,EAAA,EAExJ,WAAK,QAAA,EACL,QAAQ,MAAMrB,CAAK,EACbA,CACR,CAEQ,sBACNA,EACAlD,EAAkB8C,EAAe,wBAC3B,CACN,MAAMgH,EAAW7G,EAAUC,EAAO9C,EAAaJ,CAAO,EAEtD,GADA,QAAQ,MAAM8J,CAAQ,EAClB,KAAK,SACP,GAAI,CACF,KAAK,SAASA,CAAQ,CACxB,OAASrE,EAAG,CACV,QAAQ,MAAMxC,EAAUwC,EAAGrF,EAAa0C,EAAe,+BAA+B,CAAC,CACzF,CAEJ,CACF,CASO,SAASiH,GAAOhI,EAAoBqE,EAAyB,GAAkB,CACpF,GAAI,OAAOrE,GAAO,WAChB,MAAM,IAAI3B,EAAY0C,EAAe,uBAAuB,EAG9D,MAAMkH,EAAiB,IAAIZ,GAAWrH,EAAIqE,CAAO,EACjD,OAAA4D,EAAe,QAAA,EAERA,CACT,CCzWO,SAASC,GAASlI,EAAgB,CAEvC,GAAI,OAAOA,GAAO,WAChB,MAAM,IAAI,UAAU,mCAAmC,EAGzD4D,EAAU,WAAA,EACV,GAAI,CACF,OAAO5D,EAAA,CACT,QAAA,CACE4D,EAAU,SAAA,CACZ,CACF"}
+{"version":3,"file":"atom-effect.min.js","sources":["../src/constants.ts","../src/errors/errors.ts","../src/utils/debug.ts","../src/core/dep-tracking.ts","../src/errors/messages.ts","../src/utils/error.ts","../src/core/base.ts","../src/internal/epoch.ts","../src/internal/scheduler.ts","../src/symbols.ts","../src/tracking/context.ts","../src/tracking/untracked.ts","../src/core/atom.ts","../src/utils/array-pool.ts","../src/internal/pool.ts","../src/utils/type-guards.ts","../src/core/computed.ts","../src/core/effect.ts","../src/internal/batch.ts"],"sourcesContent":["/**\n * Async operation states.\n */\nexport const AsyncState = {\n  IDLE: 'idle',\n  PENDING: 'pending',\n  RESOLVED: 'resolved',\n  REJECTED: 'rejected',\n} as const;\n\n/**\n * Effect flags.\n */\nexport const EFFECT_STATE_FLAGS = {\n  DISPOSED: 1 << 0,\n  EXECUTING: 1 << 3,\n} as const;\n\n/**\n * Computed flags.\n */\nexport const COMPUTED_STATE_FLAGS = {\n  DISPOSED: 1 << 0,\n  /** Marker bit: identifies this node as a computed. */\n  IS_COMPUTED: 1 << 1,\n  DIRTY: 1 << 3,\n  IDLE: 1 << 4,\n  PENDING: 1 << 5,\n  RESOLVED: 1 << 6,\n  REJECTED: 1 << 7,\n  RECOMPUTING: 1 << 8,\n  HAS_ERROR: 1 << 9,\n} as const;\n\n/**\n * Writable Atom Flags.\n */\nexport const ATOM_STATE_FLAGS = {\n  DISPOSED: 1 << 0,\n  SYNC: 1 << 3,\n  NOTIFICATION_SCHEDULED: 1 << 4,\n} as const;\n\n/**\n * Array pool configuration.\n */\nexport const POOL_CONFIG = {\n  MAX_SIZE: 1000,\n  WARMUP_SIZE: 100,\n  ENABLE_STATS: false,\n} as const;\n\n/**\n * Scheduler configuration.\n */\nexport const SCHEDULER_CONFIG = {\n  // Infinite loop protection\n  MAX_EXECUTIONS_PER_SECOND: 1000,\n  MAX_EXECUTIONS_PER_EFFECT: 100,\n\n  // Batch processing limits to prevent blocking the main thread for too long\n  MAX_EXECUTIONS_PER_FLUSH: 10000,\n  MAX_FLUSH_ITERATIONS: 1000,\n  MIN_FLUSH_ITERATIONS: 10,\n\n  // Memory management\n  BATCH_QUEUE_SHRINK_THRESHOLD: 1000,\n} as const;\n\n/**\n * Debugging thresholds.\n */\nexport const DEBUG_CONFIG = {\n  WARN_INFINITE_LOOP: true,\n  EFFECT_FREQUENCY_WINDOW: 1000,\n} as const;\n\n/**\n * Computed configuration.\n */\nexport const COMPUTED_CONFIG = {\n  MAX_ASYNC_RETRIES: 3,\n  MAX_PROMISE_ID: Number.MAX_SAFE_INTEGER - 1,\n} as const;\n\n/**\n * V8 Small Integer (SMI) max value.\n */\nexport const SMI_MAX = 0x3fffffff;\n\n/**\n * Development environment flag.\n */\nexport const IS_DEV =\n  (typeof process !== 'undefined' && process.env && process.env.NODE_ENV !== 'production') ||\n  (typeof __DEV__ !== 'undefined' && !!__DEV__);\n\n// Fallback declaration for __DEV__ if not present in environment\ndeclare const __DEV__: boolean;\n\nexport const EMPTY_ERROR_ARRAY: readonly Error[] = Object.freeze([]);\n","/**\n * Base error class.\n */\nexport class AtomError extends Error {\n  constructor(\n    message: string,\n    public cause: Error | null = null,\n    public recoverable = true\n  ) {\n    super(message);\n    this.name = 'AtomError';\n  }\n}\n\n/** Computed error. */\nexport class ComputedError extends AtomError {\n  constructor(message: string, cause: Error | null = null) {\n    super(message, cause, true);\n    this.name = 'ComputedError';\n  }\n}\n\n/** Effect error. */\nexport class EffectError extends AtomError {\n  constructor(message: string, cause: Error | null = null) {\n    super(message, cause, false);\n    this.name = 'EffectError';\n  }\n}\n\n/** Scheduler error. */\nexport class SchedulerError extends AtomError {\n  constructor(message: string, cause: Error | null = null) {\n    super(message, cause, false);\n    this.name = 'SchedulerError';\n  }\n}\n","import { DEBUG_CONFIG, IS_DEV } from '@/constants';\nimport { ComputedError } from '@/errors/errors';\nimport type { DebugConfig, Dependency, DependencyId } from '@/types';\n\n// Debug symbols\nexport const DEBUG_NAME = Symbol('AtomEffect.DebugName');\nexport const DEBUG_ID = Symbol('AtomEffect.Id');\nexport const DEBUG_TYPE = Symbol('AtomEffect.Type');\nexport const NO_DEFAULT_VALUE = Symbol('AtomEffect.NoDefaultValue');\n\n/**\n * Dependency type guard.\n */\nconst hasDeps = (o: Dependency): o is Dependency & { dependencies: Dependency[] } =>\n  'dependencies' in o && Array.isArray((o as { dependencies: unknown }).dependencies);\n\n/**\n * Cycle detection.\n */\nfunction checkCircularInternal(dep: Dependency, current: object, visited: Set<number>): void {\n  // Cycle detected in *this* path\n  if (dep === current) {\n    throw new ComputedError(\n      'Circular dependency detected: The computation refers to itself explicitly or implicitly.'\n    );\n  }\n\n  // Cycle check\n  if (visited.has(dep.id)) return;\n  visited.add(dep.id);\n\n  if (hasDeps(dep)) {\n    const deps = dep.dependencies;\n    // Check dependencies\n    for (let i = 0; i < deps.length; i++) {\n      const child = deps[i];\n      if (child) {\n        checkCircularInternal(child, current, visited);\n      }\n    }\n  }\n}\n\n/**\n * Debug controller.\n */\nexport const debug: DebugConfig = {\n  // Dev mode flag\n  enabled: IS_DEV,\n\n  warnInfiniteLoop: DEBUG_CONFIG.WARN_INFINITE_LOOP,\n\n  warn(cond, msg) {\n    if (IS_DEV && this.enabled && cond) {\n      console.warn(`[Atom Effect] ${msg}`);\n    }\n  },\n\n  checkCircular(dep, current) {\n    if (dep === current) {\n      throw new ComputedError('Direct circular dependency detected');\n    }\n\n    if (IS_DEV && this.enabled) {\n      checkCircularInternal(dep, current, new Set());\n    }\n  },\n\n  attachDebugInfo(obj, type, id) {\n    if (!IS_DEV || !this.enabled) return;\n\n    const t = obj as Record<symbol, unknown>;\n    t[DEBUG_NAME] = `${type}_${id}`;\n    t[DEBUG_ID] = id;\n    t[DEBUG_TYPE] = type;\n  },\n\n  getDebugName: (obj) =>\n    (obj as Record<symbol, unknown> | null)?.[DEBUG_NAME] as string | undefined,\n\n  getDebugType: (obj) =>\n    (obj as Record<symbol, unknown> | null)?.[DEBUG_TYPE] as string | undefined,\n};\n\n/**\n * ID counter.\n */\nlet nextId = 1;\n\n/**\n * Generates ID.\n */\nexport const generateId = (): DependencyId => nextId++;\n","import type { DependencySubscriber, Listener } from '@/tracking/tracking.types';\nimport type { Dependency, Subscriber } from '@/types';\nimport { debug } from '@/utils/debug';\n/**\n * Tracks dependency.\n */\nexport function trackDependency<T>(\n  dependency: Dependency,\n  current: Listener,\n  subscribers: Subscription<T>[]\n): void {\n  if (typeof current === 'function') {\n    const fn = current as (newValue?: T, oldValue?: T) => void;\n    // O(n) duplicate check — acceptable because:\n    // 1. subscribers array is typically 1-10 elements\n    // 2. DependencySubscriber (hot path) uses O(1) epoch-based dedup via addDependency\n    // 3. This branch only runs for raw function listeners (uncommon)\n    for (let i = 0, len = subscribers.length; i < len; i++) {\n      const link = subscribers[i];\n      if (link && link.fn === fn) return;\n    }\n    subscribers.push(new Subscription(fn, undefined));\n    return;\n  }\n\n  if ('addDependency' in (current as object)) {\n    (current as DependencySubscriber).addDependency(dependency);\n    return;\n  }\n\n  const sub = current as Subscriber;\n  for (let i = 0, len = subscribers.length; i < len; i++) {\n    const link = subscribers[i];\n    if (link && link.sub === sub) return;\n  }\n  subscribers.push(new Subscription(undefined, sub));\n}\n\n/**\n * Syncs dependencies.\n * Uses a local Map to park previous subscriptions, avoiding\n * temporary state on dependency nodes.\n */\nexport function syncDependencies(\n  nextLinks: DependencyLink[],\n  prevLinks: DependencyLink[],\n  tracker: Subscriber\n): void {\n  // Park: collect previous subscriptions into a local Map\n  const parked = new Map<Dependency, () => void>();\n  for (let i = 0, len = prevLinks.length; i < len; i++) {\n    const link = prevLinks[i];\n    if (link?.unsub) {\n      parked.set(link.node, link.unsub);\n    }\n  }\n\n  // Reclaim or subscribe\n  for (let i = 0, len = nextLinks.length; i < len; i++) {\n    const link = nextLinks[i];\n    if (!link) continue;\n\n    const node = link.node;\n    const existing = parked.get(node);\n    if (existing !== undefined) {\n      // Re-link: reclaim subscription from previous set\n      link.unsub = existing;\n      parked.delete(node);\n    } else {\n      // New link: subscribe afresh\n      debug.checkCircular(node, tracker);\n      link.unsub = node.subscribe(tracker);\n    }\n  }\n\n  // Cleanup: release unused subscriptions\n  for (const unsub of parked.values()) {\n    unsub();\n  }\n}\n\n/**\n * Dependency graph edge.\n */\nexport class DependencyLink {\n  public unsub: (() => void) | undefined;\n\n  constructor(\n    public node: Dependency,\n    public version: number,\n    unsub: (() => void) | undefined = undefined\n  ) {\n    // Always initialize to maintain consistent V8 hidden class\n    this.unsub = unsub;\n  }\n}\n\n/**\n * Subscription entry.\n */\nexport class Subscription<T> {\n  public fn: ((newValue?: T, oldValue?: T) => void) | undefined;\n  public sub: Subscriber | undefined;\n\n  constructor(fn: ((newValue?: T, oldValue?: T) => void) | undefined, sub: Subscriber | undefined) {\n    // Always initialize both properties to maintain consistent V8 hidden class\n    this.fn = fn;\n    this.sub = sub;\n  }\n}\n","/**\n * Error message registry.\n */\nexport const ERROR_MESSAGES = {\n  // Computed Errors\n  COMPUTED_MUST_BE_FUNCTION: 'Computed target must be a function',\n  COMPUTED_ASYNC_PENDING_NO_DEFAULT: 'Async computation pending with no default value',\n  COMPUTED_COMPUTATION_FAILED: 'Computation execution failed',\n  COMPUTED_ASYNC_COMPUTATION_FAILED: 'Async computation execution failed',\n  COMPUTED_CIRCULAR_DEPENDENCY: 'Circular dependency detected',\n  COMPUTED_DISPOSED: 'Attempted to access disposed computed',\n\n  // Atom Errors\n  ATOM_SUBSCRIBER_MUST_BE_FUNCTION: 'Subscriber must be a function or Subscriber object',\n  ATOM_INDIVIDUAL_SUBSCRIBER_FAILED: 'Subscriber execution failed',\n\n  // Effect Errors\n  EFFECT_MUST_BE_FUNCTION: 'Effect target must be a function',\n  EFFECT_EXECUTION_FAILED: 'Effect execution failed',\n  EFFECT_CLEANUP_FAILED: 'Effect cleanup failed',\n  EFFECT_DISPOSED: 'Attempted to run disposed effect',\n\n  // Scheduler Errors\n  SCHEDULER_FLUSH_OVERFLOW: (max: number, dropped: number): string =>\n    `Maximum flush iterations (${max}) exceeded. ${dropped} jobs dropped. Possible infinite loop.`,\n\n  // System / Debug\n  CALLBACK_ERROR_IN_ERROR_HANDLER: 'Exception encountered in onError handler',\n\n  // Effect frequency\n  EFFECT_FREQUENCY_LIMIT_EXCEEDED:\n    'Effect executed too frequently within 1 second. Suspected infinite loop.',\n\n  SCHEDULER_CALLBACK_MUST_BE_FUNCTION: 'Scheduler callback must be a function',\n  SCHEDULER_END_BATCH_WITHOUT_START: 'endBatch() called without matching startBatch(). Ignoring.',\n} as const;\n","import { AtomError } from '@/errors/errors';\n\n/**\n * Wraps error.\n *\n * @param error - Raw error.\n * @param ErrorClass - Error class.\n * @param context - Error context.\n */\nexport function wrapError(\n  error: unknown,\n  ErrorClass: typeof AtomError,\n  context: string\n): AtomError {\n  // Return if wrapped\n  if (error instanceof AtomError) {\n    return error;\n  }\n\n  const isNativeError = error instanceof Error;\n  const originalMessage = isNativeError ? error.message : String(error);\n  const cause = isNativeError ? error : undefined;\n\n  const type = isNativeError ? error.constructor.name : 'Unexpected error';\n  const finalMessage = `${type} (${context}): ${originalMessage}`;\n\n  return new ErrorClass(finalMessage, cause);\n}\n","import { IS_DEV, SMI_MAX } from '@/constants';\nimport { Subscription } from '@/core/dep-tracking';\nimport { AtomError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport type { DependencyId, Subscriber } from '@/types';\nimport { generateId } from '@/utils/debug';\nimport { wrapError } from '@/utils/error';\n\n/**\n * Base class for all reactive nodes.\n */\nexport class ReactiveNode {\n  /** State flags */\n  flags = 0;\n  /** Version counter */\n  version = 0;\n  /** Last access epoch */\n  _lastSeenEpoch = -1;\n  /** Debug ID */\n  readonly id: DependencyId = generateId() & SMI_MAX;\n}\n\n/**\n * Reactive dependency base class.\n */\nexport abstract class ReactiveDependency<T> extends ReactiveNode {\n  protected abstract _subscribers: Subscription<T>[];\n\n  /**\n   * Adds subscriber.\n   */\n  subscribe(listener: ((newValue?: T, oldValue?: T) => void) | Subscriber): () => void {\n    const isFn = typeof listener === 'function';\n    // Validate subscriber\n    if (!isFn && (!listener || typeof (listener as Subscriber).execute !== 'function')) {\n      throw wrapError(\n        new TypeError('Invalid subscriber'),\n        AtomError,\n        ERROR_MESSAGES.ATOM_SUBSCRIBER_MUST_BE_FUNCTION\n      );\n    }\n\n    const subs = this._subscribers;\n    for (let i = 0, len = subs.length; i < len; i++) {\n      const sub = subs[i];\n      if (!sub) continue;\n      if (isFn ? sub.fn === listener : sub.sub === listener) {\n        if (IS_DEV) console.warn('Duplicate subscription ignored.');\n        return () => {};\n      }\n    }\n\n    const link = new Subscription<T>(\n      isFn ? (listener as (newValue?: T, oldValue?: T) => void) : undefined,\n      !isFn ? (listener as Subscriber) : undefined\n    );\n\n    subs.push(link);\n\n    return () => this._unsubscribe(link);\n  }\n\n  private _unsubscribe(link: Subscription<T>): void {\n    const subs = this._subscribers;\n    const idx = subs.indexOf(link);\n    if (idx === -1) return;\n\n    // Remove subscriber\n    const last = subs.pop();\n    if (idx < subs.length && last) {\n      subs[idx] = last;\n    }\n  }\n\n  subscriberCount(): number {\n    return this._subscribers.length;\n  }\n\n  protected _notifySubscribers(newValue: T | undefined, oldValue: T | undefined): void {\n    if (this._subscribers.length === 0) return;\n\n    const subs = this._subscribers.slice(0);\n    const len = subs.length;\n\n    for (let i = 0; i < len; i++) {\n      const s = subs[i];\n      if (!s) continue;\n      try {\n        if (s.fn) s.fn(newValue, oldValue);\n        else if (s.sub) s.sub.execute();\n      } catch (err) {\n        this._handleNotifyError(err);\n      }\n    }\n  }\n\n  private _handleNotifyError(err: unknown): void {\n    console.error(wrapError(err, AtomError, ERROR_MESSAGES.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));\n  }\n}\n","import { IS_DEV, SMI_MAX } from '@/constants';\n\n// Global epoch counter.\nlet collectorEpoch = 0;\n\n/**\n * Next tracking epoch.\n */\nexport const nextEpoch = () => {\n  collectorEpoch = (collectorEpoch + 1) & SMI_MAX || 1;\n  return collectorEpoch;\n};\n\n/** Current tracking epoch. */\nexport const currentEpoch = () => collectorEpoch;\n\n/** Increments a version counter within SMI range. */\nexport const nextVersion = (v: number) => (v + 1) & SMI_MAX;\n\nexport let flushExecutionCount = 0;\nlet isFlushing = false;\nlet _flushEpoch = 0;\n\n/** Current flush epoch. */\nexport const currentFlushEpoch = () => _flushEpoch;\n\n/**\n * Starts flush cycle.\n */\nexport function startFlush(): boolean {\n  if (isFlushing) {\n    if (IS_DEV) console.warn('startFlush() called during flush - ignored');\n    return false;\n  }\n\n  isFlushing = true;\n  _flushEpoch = nextEpoch();\n  flushExecutionCount = 0;\n  return true;\n}\n\n/** Ends flush cycle. */\nexport const endFlush = () => {\n  isFlushing = false;\n};\n\n/**\n * Increments execution count.\n */\nexport const incrementFlushExecutionCount = () => (isFlushing ? ++flushExecutionCount : 0);\n\n/**\n * Resets flush state.\n */\nexport function resetFlushState(): void {\n  _flushEpoch = 0;\n  flushExecutionCount = 0;\n  isFlushing = false;\n}\n","import { IS_DEV, SCHEDULER_CONFIG } from '@/constants';\nimport { SchedulerError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport { endFlush, startFlush } from '@/internal/epoch';\n\nexport enum SchedulerPhase {\n  IDLE = 0,\n  BATCHING = 1,\n  FLUSHING = 2,\n}\n\nexport interface SchedulerJob {\n  (): void;\n  /** Next scheduled epoch */\n  _nextEpoch?: number;\n}\n\n/**\n * Scheduler implementation.\n */\nclass Scheduler {\n  /** Queue buffer */\n  _queueBuffer: [SchedulerJob[], SchedulerJob[]] = [[], []];\n  _bufferIndex = 0;\n  _size = 0;\n\n  /** Epoch counter */\n  _epoch = 0;\n\n  /** State flags */\n  _isProcessing = false;\n  _isBatching = false;\n  _isFlushingSync = false;\n\n  /** Batching state */\n  _batchDepth = 0;\n  _batchQueue: SchedulerJob[] = [];\n  _batchQueueSize = 0;\n\n  /** Config */\n  _maxFlushIterations: number = SCHEDULER_CONFIG.MAX_FLUSH_ITERATIONS;\n\n  /** Overflow callback */\n  onOverflow: ((droppedCount: number) => void) | null = null;\n\n  /** Bound run loop for microtask */\n  private readonly _boundRunLoop = this._runLoop.bind(this);\n\n  get phase(): SchedulerPhase {\n    if (this._isProcessing || this._isFlushingSync) return SchedulerPhase.FLUSHING;\n    if (this._isBatching) return SchedulerPhase.BATCHING;\n    return SchedulerPhase.IDLE;\n  }\n\n  get queueSize(): number {\n    return this._size;\n  }\n\n  get isBatching(): boolean {\n    return this._isBatching;\n  }\n\n  /**\n   * Schedules job.\n   */\n  schedule(callback: SchedulerJob): void {\n    if (IS_DEV && typeof callback !== 'function') {\n      throw new SchedulerError(ERROR_MESSAGES.SCHEDULER_CALLBACK_MUST_BE_FUNCTION);\n    }\n\n    // Deduplicate job\n    if (callback._nextEpoch === this._epoch) return;\n    callback._nextEpoch = this._epoch;\n\n    if (this._isBatching || this._isFlushingSync) {\n      this._batchQueue[this._batchQueueSize++] = callback;\n      return;\n    }\n\n    // Push to current active buffer\n    this._queueBuffer[this._bufferIndex]![this._size++] = callback;\n\n    // Wake up if sleeping\n    if (!this._isProcessing) {\n      this._flush();\n    }\n  }\n\n  /**\n   * Triggers flush.\n   */\n  _flush(): void {\n    if (this._isProcessing || this._size === 0) return;\n    this._isProcessing = true;\n\n    queueMicrotask(this._boundRunLoop);\n  }\n\n  /**\n   * Scheduler loop.\n   */\n  private _runLoop(): void {\n    try {\n      if (this._size === 0) return;\n\n      const started = startFlush();\n      this._drainQueue();\n      if (started) endFlush();\n    } finally {\n      this._isProcessing = false;\n      // If new jobs arrived during flush (and not batching), re-schedule\n      if (this._size > 0 && !this._isBatching) {\n        this._flush();\n      }\n    }\n  }\n\n  _flushSync(): void {\n    this._isFlushingSync = true;\n    const started = startFlush();\n    try {\n      this._mergeBatchQueue();\n      this._drainQueue();\n    } finally {\n      this._isFlushingSync = false;\n      if (started) endFlush();\n    }\n  }\n\n  _mergeBatchQueue(): void {\n    if (this._batchQueueSize === 0) return;\n\n    // Increment epoch\n    const epoch = ++this._epoch;\n    const bQueue = this._batchQueue;\n    const targetBuffer = this._queueBuffer[this._bufferIndex]!;\n    let currentSize = this._size;\n\n    // Merge batch\n    for (let i = 0; i < this._batchQueueSize; i++) {\n      const job = bQueue[i]!;\n      // Retag jobs\n      if (job._nextEpoch !== epoch) {\n        job._nextEpoch = epoch;\n        targetBuffer[currentSize++] = job;\n      }\n    }\n\n    this._size = currentSize;\n    this._batchQueueSize = 0;\n\n    // Resize batch queue\n    if (bQueue.length > SCHEDULER_CONFIG.BATCH_QUEUE_SHRINK_THRESHOLD) {\n      bQueue.length = 0;\n    }\n  }\n\n  _drainQueue(): void {\n    let iterations = 0;\n    // Process queue\n    while (this._size > 0) {\n      // Overflow check\n      if (++iterations > this._maxFlushIterations) {\n        this._handleFlushOverflow();\n        return;\n      }\n\n      this._processQueue();\n      // If batch updates happened during processing, merge them in now\n      this._mergeBatchQueue();\n    }\n  }\n\n  _processQueue(): void {\n    const idx = this._bufferIndex;\n    const jobs = this._queueBuffer[idx]!;\n    const count = this._size;\n\n    // Swap buffers\n    this._bufferIndex = idx ^ 1;\n    this._size = 0;\n    this._epoch++;\n\n    for (let i = 0; i < count; i++) {\n      // Execute job\n      try {\n        jobs[i]!();\n      } catch (e) {\n        console.error(new SchedulerError('Error occurred during scheduler execution', e as Error));\n      }\n    }\n    // Clear the consumed buffer\n    jobs.length = 0;\n  }\n\n  private _handleFlushOverflow(): void {\n    const droppedCount = this._size + this._batchQueueSize;\n    console.error(\n      new SchedulerError(\n        ERROR_MESSAGES.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations, droppedCount)\n      )\n    );\n    this._size = 0;\n    this._queueBuffer[this._bufferIndex]!.length = 0;\n    this._batchQueueSize = 0;\n\n    if (this.onOverflow) {\n      try {\n        this.onOverflow(droppedCount);\n      } catch {}\n    }\n  }\n\n  startBatch(): void {\n    this._batchDepth++;\n    this._isBatching = true;\n  }\n\n  endBatch(): void {\n    if (this._batchDepth === 0) {\n      if (IS_DEV) console.warn(ERROR_MESSAGES.SCHEDULER_END_BATCH_WITHOUT_START);\n      return;\n    }\n\n    if (--this._batchDepth === 0) {\n      this._flushSync();\n      this._isBatching = false;\n    }\n  }\n\n  setMaxFlushIterations(max: number): void {\n    if (max < SCHEDULER_CONFIG.MIN_FLUSH_ITERATIONS)\n      throw new SchedulerError(\n        `Max flush iterations must be at least ${SCHEDULER_CONFIG.MIN_FLUSH_ITERATIONS}`\n      );\n    this._maxFlushIterations = max;\n  }\n}\n\nexport const scheduler = new Scheduler();\n","/**\n * Brand symbols for reliable type identification.\n * Prevents false positives from duck-typing with external objects.\n */\nexport const ATOM_BRAND: unique symbol = Symbol.for('atom-effect/atom');\nexport const COMPUTED_BRAND: unique symbol = Symbol.for('atom-effect/computed');\nexport const EFFECT_BRAND: unique symbol = Symbol.for('atom-effect/effect');\n","import type { Listener } from './tracking.types';\n\n/**\n * Global tracking context.\n */\nexport const trackingContext = {\n  /** Active listener. */\n  current: null as Listener | null,\n\n  /**\n   * Executes in context.\n   *\n   * @param listener - The subscriber.\n   * @param fn - The logic to execute.\n   * @returns The result of `fn`.\n   */\n  run<T>(listener: Listener, fn: () => T): T {\n    const prev = this.current;\n    this.current = listener;\n    try {\n      return fn();\n    } finally {\n      this.current = prev;\n    }\n  },\n};\n\n/**\n * Tracking context type.\n */\nexport type ITrackingContext = typeof trackingContext;\n","import { trackingContext } from './context';\n\n/**\n * Untracked execution.\n *\n * @param fn - Function to execute.\n * @returns Result of `fn`.\n */\nexport function untracked<T>(fn: () => T): T {\n  const prev = trackingContext.current;\n\n  // Skip if untracked\n  if (prev === null) return fn();\n\n  trackingContext.current = null;\n  try {\n    return fn();\n  } finally {\n    trackingContext.current = prev;\n  }\n}\n","import { ATOM_STATE_FLAGS } from '@/constants';\nimport { ReactiveDependency } from '@/core/base';\nimport { type Subscription, trackDependency } from '@/core/dep-tracking';\nimport { nextVersion } from '@/internal/epoch';\nimport { scheduler } from '@/internal/scheduler';\nimport { ATOM_BRAND } from '@/symbols';\nimport { trackingContext } from '@/tracking';\nimport type { AtomOptions, WritableAtom } from '@/types';\nimport { debug } from '@/utils/debug';\n\n/**\n * Internal {@link WritableAtom} implementation.\n */\nclass AtomImpl<T> extends ReactiveDependency<T> implements WritableAtom<T> {\n  private _value: T;\n  /** Old value for notifications */\n  private _pendingOldValue: T | undefined = undefined;\n  /** Cached notification task */\n  private readonly _notifyTask = () => this._flushNotifications();\n  protected _subscribers: Subscription<T>[] = [];\n\n  /** @internal */\n  readonly [ATOM_BRAND] = true;\n\n  constructor(initialValue: T, sync: boolean) {\n    super();\n    this._value = initialValue;\n    if (sync) this.flags |= ATOM_STATE_FLAGS.SYNC;\n    debug.attachDebugInfo(this, 'atom', this.id);\n  }\n\n  get value(): T {\n    const current = trackingContext.current;\n    if (current) {\n      trackDependency(this, current, this._subscribers);\n    }\n    return this._value;\n  }\n\n  set value(newValue: T) {\n    const oldValue = this._value;\n    if (Object.is(oldValue, newValue)) return;\n\n    this._value = newValue;\n    this.version = nextVersion(this.version);\n\n    const flags = this.flags;\n    if (this._subscribers.length === 0 || flags & ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED) {\n      return;\n    }\n\n    this._pendingOldValue = oldValue;\n    this.flags = flags | ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED;\n\n    // Sync handling\n    if (flags & ATOM_STATE_FLAGS.SYNC && !scheduler.isBatching) {\n      this._flushNotifications();\n      return;\n    }\n\n    // Async scheduling\n    scheduler.schedule(this._notifyTask);\n  }\n\n  /**\n   * Triggers subscribers.\n   */\n  private _flushNotifications(): void {\n    const flags = this.flags;\n    // Guard: Spurious flush or already disposed\n    if (!(flags & ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED) || flags & ATOM_STATE_FLAGS.DISPOSED) {\n      return;\n    }\n\n    const oldValue = this._pendingOldValue as T;\n    this._pendingOldValue = undefined;\n    this.flags &= ~ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED;\n\n    this._notifySubscribers(this._value, oldValue);\n  }\n\n  peek(): T {\n    return this._value;\n  }\n\n  dispose(): void {\n    if (this.flags & ATOM_STATE_FLAGS.DISPOSED) return;\n\n    this._subscribers.length = 0;\n    this.flags |= ATOM_STATE_FLAGS.DISPOSED;\n    // Release references\n    this._value = undefined as T;\n    this._pendingOldValue = undefined;\n  }\n}\n\n/**\n * Creates a reactive atom holding mutable state.\n *\n * @param initialValue - The initial value of the atom.\n * @param options - Configuration options (sync: boolean).\n */\nexport function atom<T>(initialValue: T, options: AtomOptions = {}): WritableAtom<T> {\n  return new AtomImpl(initialValue, options.sync ?? false);\n}\n","import { IS_DEV } from '@/constants';\nimport type { PoolStats } from '@/types';\n\n/**\n * Array pool.\n *\n * @template T - Element type.\n */\nexport class ArrayPool<T> {\n  private readonly pool: T[][] = [];\n\n  // Mutable stats container, null when disabled\n  private stats: {\n    acquired: number;\n    released: number;\n    rejected: { frozen: number; tooLarge: number; poolFull: number };\n  } | null = null;\n\n  /**\n   * @param limit - Max unique arrays to hold (default: 50). Prevents the pool itself from consuming too much memory.\n   * @param capacity - Max length of an array to accept (default: 256).\n   * @param enableStats - Force-enable stats even in production (default: false).\n   */\n  constructor(\n    private readonly limit = 50,\n    private readonly capacity = 256,\n    enableStats = false\n  ) {\n    this.stats =\n      IS_DEV || enableStats\n        ? {\n            acquired: 0,\n            released: 0,\n            rejected: { frozen: 0, tooLarge: 0, poolFull: 0 },\n          }\n        : null;\n  }\n\n  /**\n   * Acquires array.\n   */\n  acquire(): T[] {\n    if (this.stats) {\n      this.stats.acquired++;\n    }\n    // LIFO reuse for better cache locality\n    return this.pool.pop() ?? [];\n  }\n\n  /**\n   * Releases array.\n   *\n   * @param arr - Array to release.\n   * @param emptyConst - Optional empty constant.\n   */\n  release(arr: T[], emptyConst?: readonly T[]): void {\n    if (emptyConst && arr === emptyConst) return;\n\n    if (arr.length > this.capacity) {\n      if (this.stats) this.stats.rejected.tooLarge++;\n      return;\n    }\n\n    if (this.pool.length >= this.limit) {\n      if (this.stats) this.stats.rejected.poolFull++;\n      return;\n    }\n\n    if (Object.isFrozen(arr)) {\n      if (this.stats) this.stats.rejected.frozen++;\n      return;\n    }\n\n    arr.length = 0;\n    this.pool.push(arr);\n\n    if (this.stats) {\n      this.stats.released++;\n    }\n  }\n\n  /**\n   * Pool stats.\n   */\n  getStats(): PoolStats | null {\n    if (!this.stats) return null;\n\n    const { acquired, released, rejected } = this.stats;\n    const leakCount =\n      acquired - released - (rejected.frozen + rejected.tooLarge + rejected.poolFull);\n\n    return {\n      acquired,\n      released,\n      rejected: { ...rejected },\n      leaked: leakCount,\n      poolSize: this.pool.length,\n    };\n  }\n\n  /**\n   * Resets pool.\n   */\n  reset(): void {\n    this.pool.length = 0;\n    if (this.stats) {\n      this.stats = {\n        acquired: 0,\n        released: 0,\n        rejected: { frozen: 0, tooLarge: 0, poolFull: 0 },\n      };\n    }\n  }\n}\n","import type { DependencyLink } from '@/core/dep-tracking';\nimport { ArrayPool } from '@/utils/array-pool';\n\nexport const EMPTY_LINKS: DependencyLink[] = Object.freeze(\n  [] as unknown as DependencyLink[]\n) as DependencyLink[];\n\nexport const linksArrayPool = new ArrayPool<DependencyLink>();\n","import { ATOM_BRAND, COMPUTED_BRAND, EFFECT_BRAND } from '@/symbols';\nimport type { ComputedAtom, EffectObject, ReadonlyAtom, WritableAtom } from '@/types';\n\n/**\n * Readonly atom check.\n *\n * @param obj - Object to check.\n */\nexport function isAtom(obj: unknown): obj is ReadonlyAtom {\n  return obj !== null && typeof obj === 'object' && ATOM_BRAND in obj;\n}\n\n/**\n * Writable atom check.\n */\nexport function isWritable(obj: unknown): obj is WritableAtom {\n  return isAtom(obj) && !isComputed(obj);\n}\n\n/**\n * Computed atom check.\n */\nexport function isComputed(obj: unknown): obj is ComputedAtom {\n  return obj !== null && typeof obj === 'object' && COMPUTED_BRAND in obj;\n}\n\n/**\n * Effect object check.\n */\nexport function isEffect(obj: unknown): obj is EffectObject {\n  return obj !== null && typeof obj === 'object' && EFFECT_BRAND in obj;\n}\n\n/**\n * Promise check.\n */\nexport function isPromise<T>(value: unknown): value is Promise<T> {\n  return (\n    value !== null &&\n    typeof value === 'object' &&\n    typeof (value as { then?: unknown }).then === 'function'\n  );\n}\n","import {\n  AsyncState,\n  COMPUTED_CONFIG,\n  COMPUTED_STATE_FLAGS,\n  EMPTY_ERROR_ARRAY,\n  IS_DEV,\n} from '@/constants';\nimport { ReactiveDependency } from '@/core/base';\nimport {\n  DependencyLink,\n  type Subscription,\n  syncDependencies,\n  trackDependency,\n} from '@/core/dep-tracking';\nimport { ComputedError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport { nextEpoch, nextVersion } from '@/internal/epoch';\nimport { EMPTY_LINKS, linksArrayPool } from '@/internal/pool';\nimport { ATOM_BRAND, COMPUTED_BRAND } from '@/symbols';\nimport { trackingContext } from '@/tracking';\nimport type {\n  AsyncStateType,\n  ComputedAtom,\n  ComputedOptions,\n  Dependency,\n  Subscriber,\n} from '@/types';\nimport { debug, NO_DEFAULT_VALUE } from '@/utils/debug';\nimport { wrapError } from '@/utils/error';\nimport { isPromise } from '@/utils/type-guards';\n\nconst { IDLE, DIRTY, PENDING, RESOLVED, REJECTED, HAS_ERROR, RECOMPUTING, DISPOSED, IS_COMPUTED } =\n  COMPUTED_STATE_FLAGS;\n\nfunction getAsyncState(flags: number): AsyncStateType {\n  if (flags & RESOLVED) return AsyncState.RESOLVED;\n  if (flags & PENDING) return AsyncState.PENDING;\n  if (flags & REJECTED) return AsyncState.REJECTED;\n  return AsyncState.IDLE;\n}\n\n/**\n * Computed atom implementation.\n */\nclass ComputedAtomImpl<T> extends ReactiveDependency<T> implements ComputedAtom<T>, Subscriber {\n  /** @internal */\n  readonly [ATOM_BRAND] = true;\n  /** @internal */\n  readonly [COMPUTED_BRAND] = true;\n\n  private _value: T;\n  private _error: Error | null = null;\n  /** Promise tracking ID */\n  private _promiseId = 0;\n\n  private readonly _equal: (a: T, b: T) => boolean;\n  private readonly _fn: () => T | Promise<T>;\n  private readonly _defaultValue: T;\n  private readonly _onError: ((error: Error) => void) | null;\n  private readonly _maxAsyncRetries: number;\n\n  protected _subscribers: Subscription<T>[] = [];\n  private _links: DependencyLink[] = EMPTY_LINKS;\n\n  // Async state\n  private _asyncStartAggregateVersion = 0;\n  private _asyncRetryCount = 0;\n\n  // Dependency collection state\n  private _trackEpoch = -1;\n  private _trackLinks: DependencyLink[] = EMPTY_LINKS;\n  private _trackCount = 0;\n\n  constructor(fn: () => T | Promise<T>, options: ComputedOptions<T> = {}) {\n    if (typeof fn !== 'function') throw new ComputedError(ERROR_MESSAGES.COMPUTED_MUST_BE_FUNCTION);\n    super();\n\n    this._value = undefined as T;\n    // Start dirty so first access triggers computation\n    this.flags = IS_COMPUTED | DIRTY | IDLE;\n    this._equal = options.equal ?? Object.is;\n    this._fn = fn;\n    this._defaultValue = 'defaultValue' in options ? options.defaultValue : (NO_DEFAULT_VALUE as T);\n    this._onError = options.onError ?? null;\n    const retries = options.maxAsyncRetries;\n    this._maxAsyncRetries =\n      retries != null && retries >= 0 ? retries : COMPUTED_CONFIG.MAX_ASYNC_RETRIES;\n\n    debug.attachDebugInfo(this, 'computed', this.id);\n\n    // Eager evaluation if not lazy\n    if (options.lazy === false) {\n      try {\n        this._recompute();\n      } catch {\n        /* _handleError already stored error and called onError */\n      }\n    }\n  }\n\n  private _track(): void {\n    const current = trackingContext.current;\n    if (current) trackDependency(this, current, this._subscribers);\n  }\n\n  get value(): T {\n    this._track();\n\n    const flags = this.flags;\n    if ((flags & (RESOLVED | DIRTY | IDLE)) === RESOLVED) {\n      return this._value;\n    }\n\n    if (flags & DISPOSED) {\n      throw new ComputedError(ERROR_MESSAGES.COMPUTED_DISPOSED);\n    }\n\n    if (flags & RECOMPUTING) {\n      if (this._defaultValue !== (NO_DEFAULT_VALUE as T)) return this._defaultValue;\n      throw new ComputedError(ERROR_MESSAGES.COMPUTED_CIRCULAR_DEPENDENCY);\n    }\n\n    if (flags & (DIRTY | IDLE)) {\n      this._recompute();\n      // Re-read flags after update\n      if (this.flags & RESOLVED) return this._value;\n    }\n\n    // 3. Async/Error handling\n    const def = this._defaultValue;\n    const hasDef = def !== (NO_DEFAULT_VALUE as T);\n\n    if (this.flags & PENDING) {\n      if (hasDef) return def;\n      throw new ComputedError(ERROR_MESSAGES.COMPUTED_ASYNC_PENDING_NO_DEFAULT);\n    }\n\n    if (this.flags & REJECTED) {\n      if (hasDef) return def;\n      throw this._error;\n    }\n\n    return this._value;\n  }\n\n  peek(): T {\n    return this._value;\n  }\n\n  get state(): AsyncStateType {\n    this._track();\n    return getAsyncState(this.flags);\n  }\n\n  get hasError(): boolean {\n    this._track();\n    if (this.flags & (REJECTED | HAS_ERROR)) return true;\n\n    // Live scan: deps may have changed error state asynchronously\n    const links = this._links;\n    for (let i = 0, len = links.length; i < len; i++) {\n      const node = links[i]?.node;\n      if (node && node.flags & HAS_ERROR) return true;\n    }\n    return false;\n  }\n\n  get isValid(): boolean {\n    return !this.hasError;\n  }\n\n  get errors(): readonly Error[] {\n    this._track();\n    if (!this.hasError) return EMPTY_ERROR_ARRAY;\n\n    // Collect errors directly into array, dedupe via indexOf (avoids Set allocation)\n    const collected: Error[] = [];\n    if (this._error) collected.push(this._error);\n\n    const links = this._links;\n    for (let i = 0, len = links.length; i < len; i++) {\n      const dep = links[i]!.node;\n      if (dep.flags & HAS_ERROR) {\n        const computedDep = dep as unknown as ComputedAtom<unknown>;\n        const depErrors = computedDep.errors;\n        if (depErrors.length > 0) {\n          for (let j = 0; j < depErrors.length; j++) {\n            const err = depErrors[j];\n            if (err && collected.indexOf(err) === -1) collected.push(err);\n          }\n        }\n      }\n    }\n\n    return Object.freeze(collected);\n  }\n\n  get lastError(): Error | null {\n    this._track();\n    return this._error;\n  }\n\n  get isPending(): boolean {\n    this._track();\n    return (this.flags & PENDING) !== 0;\n  }\n\n  get isResolved(): boolean {\n    this._track();\n    return (this.flags & RESOLVED) !== 0;\n  }\n\n  invalidate(): void {\n    this._markDirty();\n  }\n\n  dispose(): void {\n    if (this.flags & DISPOSED) return;\n\n    const links = this._links;\n    if (links !== EMPTY_LINKS) {\n      for (let i = 0, len = links.length; i < len; i++) {\n        links[i]!.unsub?.();\n      }\n      linksArrayPool.release(links);\n      this._links = EMPTY_LINKS;\n    }\n\n    this._subscribers.length = 0;\n    this.flags = DISPOSED | DIRTY | IDLE;\n\n    // Release Memory\n    this._error = null;\n    this._value = undefined as T;\n  }\n\n  addDependency(dep: Dependency): void {\n    // Deduplicate dependencies\n    if (dep._lastSeenEpoch === this._trackEpoch) return;\n    dep._lastSeenEpoch = this._trackEpoch;\n\n    // Resize array if needed\n    if (this._trackCount < this._trackLinks.length) {\n      const link = this._trackLinks[this._trackCount]!;\n      link.node = dep;\n      link.version = dep.version;\n    } else {\n      this._trackLinks.push(new DependencyLink(dep, dep.version));\n    }\n    this._trackCount++;\n  }\n\n  private _recompute(): void {\n    if (this.flags & RECOMPUTING) return;\n    this.flags |= RECOMPUTING;\n\n    const prevLinks = this._links;\n    this._trackEpoch = nextEpoch();\n    this._trackLinks = linksArrayPool.acquire();\n    this._trackCount = 0;\n\n    let committed = false;\n    try {\n      // Execute function\n      const result = trackingContext.run(this, this._fn);\n\n      // Inline _commitDeps\n      this._trackLinks.length = this._trackCount;\n      syncDependencies(this._trackLinks, prevLinks, this);\n      this._links = this._trackLinks;\n      committed = true;\n\n      // Handle Result\n      if (isPromise(result)) {\n        this._handleAsyncComputation(result);\n      } else {\n        this._finalizeResolution(result);\n      }\n    } catch (e) {\n      // Commit dependencies on error\n      if (!committed) {\n        try {\n          this._trackLinks.length = this._trackCount;\n          syncDependencies(this._trackLinks, prevLinks, this);\n          this._links = this._trackLinks;\n          committed = true;\n        } catch (commitErr) {\n          if (IS_DEV) {\n            console.warn('[atom-effect] _commitDeps failed during error recovery:', commitErr);\n          }\n        }\n      }\n      this._handleError(e as Error, ERROR_MESSAGES.COMPUTED_COMPUTATION_FAILED, true);\n    } finally {\n      // Release pool\n      if (committed && prevLinks !== EMPTY_LINKS) {\n        linksArrayPool.release(prevLinks);\n      } else if (!committed) {\n        linksArrayPool.release(this._trackLinks);\n      }\n\n      // Reset transient state\n      this._trackEpoch = -1;\n      this._trackLinks = EMPTY_LINKS;\n      this._trackCount = 0;\n      this.flags &= ~RECOMPUTING;\n    }\n  }\n\n  private _handleAsyncComputation(promise: Promise<T>): void {\n    // Set pending, clear idle/dirty/resolved/rejected\n    this.flags = (this.flags | PENDING) & ~(IDLE | DIRTY | RESOLVED | REJECTED);\n    // Notify pending\n    this._notifySubscribers(undefined, undefined);\n\n    this._asyncStartAggregateVersion = this._captureVersionSnapshot();\n    this._asyncRetryCount = 0;\n    // Invalidate old promises\n    this._promiseId = (this._promiseId + 1) % COMPUTED_CONFIG.MAX_PROMISE_ID;\n    const promiseId = this._promiseId;\n\n    promise.then(\n      (res) => {\n        if (promiseId !== this._promiseId) return; // Stale\n\n        // Check for stale reads (did deps change while we waited?)\n        if (this._captureVersionSnapshot() !== this._asyncStartAggregateVersion) {\n          if (this._asyncRetryCount++ < this._maxAsyncRetries) {\n            return this._markDirty(); // Retry\n          }\n          return this._handleError(\n            new ComputedError(\n              `Async drift threshold exceeded after ${this._maxAsyncRetries} retries.`\n            ),\n            ERROR_MESSAGES.COMPUTED_ASYNC_COMPUTATION_FAILED\n          );\n        }\n\n        this._finalizeResolution(res);\n        this._notifySubscribers(res, undefined);\n      },\n      (err) =>\n        promiseId === this._promiseId &&\n        this._handleError(err, ERROR_MESSAGES.COMPUTED_ASYNC_COMPUTATION_FAILED)\n    );\n  }\n\n  private _captureVersionSnapshot(): number {\n    let hash = 0;\n    const links = this._links;\n    for (let i = 0, len = links.length; i < len; i++) {\n      hash = ((hash << 5) - hash + links[i]!.node.version) | 0;\n    }\n    return hash;\n  }\n\n  private _handleError(err: unknown, msg: string, throwErr = false): void {\n    const error = wrapError(err, ComputedError, msg);\n\n    if (!throwErr && !(this.flags & REJECTED)) {\n      this.version = nextVersion(this.version);\n    }\n\n    this._error = error;\n    // Set rejected + has_error, clear idle/dirty/pending/resolved\n    this.flags = (this.flags & ~(IDLE | DIRTY | PENDING | RESOLVED)) | REJECTED | HAS_ERROR;\n\n    if (this._onError) {\n      try {\n        this._onError(error);\n      } catch (e) {\n        console.error(ERROR_MESSAGES.CALLBACK_ERROR_IN_ERROR_HANDLER, e);\n      }\n    }\n\n    if (throwErr) throw error;\n    this._notifySubscribers(undefined, undefined);\n  }\n\n  private _finalizeResolution(value: T): void {\n    // Only bump version if value actually changed or first resolve\n    if (!(this.flags & RESOLVED) || !this._equal(this._value, value)) {\n      this.version = nextVersion(this.version);\n    }\n\n    this._value = value;\n    this._error = null;\n    // Set resolved, clear idle/dirty/pending/rejected/has_error\n    this.flags = (this.flags | RESOLVED) & ~(IDLE | DIRTY | PENDING | REJECTED | HAS_ERROR);\n  }\n\n  execute(): void {\n    // Subscriber implementation\n    this._markDirty();\n  }\n\n  /** @internal */\n  _markDirty(): void {\n    if (this.flags & (RECOMPUTING | DIRTY)) return;\n    this.flags |= DIRTY;\n    this._notifySubscribers(undefined, undefined);\n  }\n}\n\n/**\n * Creates a computed value.\n * @param fn - Computation function\n * @param options - Options object\n */\nexport function computed<T>(fn: () => T, options?: ComputedOptions<T>): ComputedAtom<T>;\nexport function computed<T>(\n  fn: () => Promise<T>,\n  options: ComputedOptions<T> & { defaultValue: T }\n): ComputedAtom<T>;\nexport function computed<T>(\n  fn: () => T | Promise<T>,\n  options: ComputedOptions<T> = {}\n): ComputedAtom<T> {\n  return new ComputedAtomImpl(fn, options);\n}\n","import {\n  COMPUTED_STATE_FLAGS,\n  DEBUG_CONFIG,\n  EFFECT_STATE_FLAGS,\n  IS_DEV,\n  SCHEDULER_CONFIG,\n} from '@/constants';\nimport { ReactiveNode } from '@/core/base';\nimport { DependencyLink } from '@/core/dep-tracking';\nimport { EffectError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport {\n  currentFlushEpoch,\n  flushExecutionCount,\n  incrementFlushExecutionCount,\n  nextEpoch,\n} from '@/internal/epoch';\nimport { EMPTY_LINKS, linksArrayPool } from '@/internal/pool';\nimport { scheduler } from '@/internal/scheduler';\nimport { EFFECT_BRAND } from '@/symbols';\nimport { type DependencyTracker, trackingContext } from '@/tracking';\nimport type { Dependency, EffectFunction, EffectObject, EffectOptions } from '@/types';\nimport { debug } from '@/utils/debug';\nimport { wrapError } from '@/utils/error';\nimport { isPromise } from '@/utils/type-guards';\n\n/**\n * Effect implementation.\n */\nclass EffectImpl extends ReactiveNode implements EffectObject, DependencyTracker {\n  /** @internal */\n  readonly [EFFECT_BRAND] = true;\n\n  private _cleanup: (() => void) | null = null;\n  private _links: DependencyLink[] = EMPTY_LINKS;\n  private _nextLinks: DependencyLink[] | null = null;\n  private _prevLinks: DependencyLink[] = EMPTY_LINKS;\n\n  /** Pre-allocated scheduler task (created once in constructor) */\n  private readonly _executeTask: (() => void) | undefined;\n\n  /** Pre-allocated notify callback shared by all subscriptions */\n  private readonly _notifyCallback: () => void;\n\n  private readonly _onError: ((error: unknown) => void) | null;\n\n  // Cycle detection\n  private _currentEpoch = -1;\n  private _lastFlushEpoch = -1;\n  private _executionsInEpoch = 0;\n\n  private readonly _fn: EffectFunction;\n  private readonly _sync: boolean;\n  private readonly _maxExecutions: number;\n  private readonly _maxExecutionsPerFlush: number;\n  private readonly _trackModifications: boolean;\n\n  // Frequency tracking (Dev)\n  private _executionCount = 0;\n  private _windowStart = 0;\n  private _windowCount = 0;\n  private _execId = 0;\n\n  constructor(fn: EffectFunction, options: EffectOptions = {}) {\n    super();\n    this._fn = fn;\n    this._onError = options.onError ?? null;\n    this._sync = options.sync ?? false;\n    this._maxExecutions =\n      options.maxExecutionsPerSecond ?? SCHEDULER_CONFIG.MAX_EXECUTIONS_PER_SECOND;\n    this._maxExecutionsPerFlush =\n      options.maxExecutionsPerFlush ?? SCHEDULER_CONFIG.MAX_EXECUTIONS_PER_EFFECT;\n    this._trackModifications = options.trackModifications ?? false;\n\n    // Pre-allocate callbacks once — eliminates per-dependency closure allocation\n    if (this._sync) {\n      this._executeTask = undefined;\n      this._notifyCallback = () => this.execute();\n    } else {\n      this._executeTask = () => this.execute();\n      this._notifyCallback = () => scheduler.schedule(this._executeTask!);\n    }\n\n    debug.attachDebugInfo(this, 'effect', this.id);\n  }\n\n  public run(): void {\n    if (this.flags & EFFECT_STATE_FLAGS.DISPOSED) {\n      throw new EffectError(ERROR_MESSAGES.EFFECT_DISPOSED);\n    }\n    this.execute(true);\n  }\n\n  public dispose(): void {\n    if (this.flags & EFFECT_STATE_FLAGS.DISPOSED) return;\n    this.flags |= EFFECT_STATE_FLAGS.DISPOSED;\n\n    this._execCleanup();\n    this._unsubLinks(this._links);\n    if (this._links !== EMPTY_LINKS) {\n      linksArrayPool.release(this._links);\n    }\n\n    // Reset State\n    this._links = EMPTY_LINKS;\n    this._prevLinks = EMPTY_LINKS;\n  }\n\n  public addDependency(dep: Dependency): void {\n    // Only track if currently executing (double check)\n    if (!(this.flags & EFFECT_STATE_FLAGS.EXECUTING)) return;\n\n    const startEpoch = this._currentEpoch;\n\n    // Deduplicate in current epoch\n    if (dep._lastSeenEpoch === startEpoch) return;\n    dep._lastSeenEpoch = startEpoch;\n\n    const nextLinks = this._nextLinks!;\n\n    // Reclaim existing subscription from previous links (linear scan — typically 1-10 deps)\n    const prev = this._prevLinks;\n    for (let i = 0, len = prev.length; i < len; i++) {\n      const link = prev[i];\n      if (link && link.node === dep && link.unsub) {\n        // Reuse DependencyLink object — update version, move to nextLinks\n        link.version = dep.version;\n        nextLinks.push(link);\n        prev[i] = null!; // Mark as reclaimed (avoid double-reclaim)\n        return;\n      }\n    }\n\n    try {\n      let unsubscribe: () => void;\n      if (this._trackModifications) {\n        // trackModifications needs to capture `dep` for _modifiedAtEpoch tagging\n        unsubscribe = dep.subscribe(() => {\n          if (this.flags & EFFECT_STATE_FLAGS.EXECUTING) dep._modifiedAtEpoch = this._currentEpoch;\n          this._notifyCallback();\n        });\n      } else {\n        // Hot path: shared callback, zero per-dependency closure allocation\n        unsubscribe = dep.subscribe(this._notifyCallback);\n      }\n      nextLinks.push(new DependencyLink(dep, dep.version, unsubscribe));\n    } catch (error) {\n      const wrapped = wrapError(error, EffectError, ERROR_MESSAGES.EFFECT_EXECUTION_FAILED);\n      console.error(wrapped);\n      if (this._onError) {\n        try {\n          this._onError(wrapped);\n        } catch {}\n      }\n      // Add noop link so next execution can attempt re-subscription\n      nextLinks.push(new DependencyLink(dep, dep.version, undefined));\n    }\n  }\n\n  /**\n   * Executes effect with tracking.\n   */\n  public execute(force = false): void {\n    if (this.flags & (EFFECT_STATE_FLAGS.DISPOSED | EFFECT_STATE_FLAGS.EXECUTING)) return;\n\n    // Skip if not dirty\n    if (!force && this._links.length > 0 && !this._isDirty()) return;\n\n    this._checkInfiniteLoops();\n\n    this.flags |= EFFECT_STATE_FLAGS.EXECUTING;\n    this._execCleanup();\n\n    // Store prevLinks on instance for addDependency's linear reclaim scan\n    this._prevLinks = this._links;\n\n    // Setup tracking\n    const nextLinks = linksArrayPool.acquire();\n    this._nextLinks = nextLinks;\n    this._currentEpoch = nextEpoch();\n\n    let committed = false;\n    try {\n      const result = trackingContext.run(this, this._fn);\n      this._links = nextLinks;\n      committed = true;\n\n      // Inline _checkLoopWarnings\n      if (this._trackModifications && debug.enabled) {\n        const epoch = this._currentEpoch;\n        for (let i = 0, len = nextLinks.length; i < len; i++) {\n          const dep = nextLinks[i]!.node;\n          if (dep._modifiedAtEpoch === epoch) {\n            debug.warn(\n              true,\n              `Effect is reading a dependency (${debug.getDebugName(dep) || 'unknown'}) that it just modified. Infinite loop may occur`\n            );\n          }\n        }\n      }\n\n      // Handle result\n      if (isPromise(result)) {\n        this._handleAsyncResult(result);\n      } else {\n        this._cleanup = typeof result === 'function' ? result : null;\n      }\n    } catch (error) {\n      // Commit on error — assign links before marking committed\n      // so _finalizeDependencies can clean up prevLinks correctly\n      this._links = nextLinks;\n      committed = true;\n      this._handleExecutionError(error);\n      this._cleanup = null;\n    } finally {\n      this._finalizeDependencies(committed, this._prevLinks, nextLinks);\n      this.flags &= ~EFFECT_STATE_FLAGS.EXECUTING;\n    }\n  }\n\n  private _handleAsyncResult(promise: Promise<unknown>): void {\n    const execId = ++this._execId;\n    promise.then(\n      (cleanup) => {\n        // Guard against race conditions (new execution or disposal happened)\n        if (execId !== this._execId || this.flags & EFFECT_STATE_FLAGS.DISPOSED) {\n          if (typeof cleanup === 'function') {\n            try {\n              cleanup();\n            } catch (e) {\n              this._handleExecutionError(e, ERROR_MESSAGES.EFFECT_CLEANUP_FAILED);\n            }\n          }\n          return;\n        }\n        if (typeof cleanup === 'function') this._cleanup = cleanup as () => void;\n      },\n      (err) => execId === this._execId && this._handleExecutionError(err)\n    );\n  }\n\n  private _finalizeDependencies(\n    committed: boolean,\n    prevLinks: DependencyLink[],\n    nextLinks: DependencyLink[]\n  ): void {\n    this._nextLinks = null;\n    this._prevLinks = EMPTY_LINKS;\n\n    if (committed) {\n      // Cleanup unclaimed prev subscriptions (entries not nulled out by addDependency)\n      for (let i = 0, len = prevLinks.length; i < len; i++) {\n        const link = prevLinks[i];\n        if (link) link.unsub?.();\n      }\n\n      if (prevLinks !== EMPTY_LINKS) {\n        linksArrayPool.release(prevLinks);\n      }\n    } else {\n      // Abort and restore\n      this._unsubLinks(nextLinks);\n      linksArrayPool.release(nextLinks);\n    }\n  }\n\n  private _unsubLinks(links: DependencyLink[]): void {\n    for (let i = 0, len = links.length; i < len; i++) {\n      links[i]?.unsub?.();\n    }\n  }\n\n  private _isDirty(): boolean {\n    const links = this._links;\n    // Save tracking context once, restore at end (avoids per-iteration function allocation)\n    const prevContext = trackingContext.current;\n    trackingContext.current = null;\n\n    try {\n      for (let i = 0, len = links.length; i < len; i++) {\n        const link = links[i]!;\n        const dep = link.node;\n\n        // Trigger recomputation for computed dependencies\n        if (dep.flags & COMPUTED_STATE_FLAGS.IS_COMPUTED) {\n          try {\n            // Force computed to re-evaluate so version reflects latest state\n            void (dep as { value: unknown }).value;\n          } catch {\n            if (IS_DEV) {\n              console.warn(`[atom-effect] Dependency #${dep.id} threw during dirty check`);\n            }\n            return true; // Error usually implies dirty/re-eval needed\n          }\n        }\n\n        // Version Check\n        if (dep.version !== link.version) return true;\n      }\n      return false;\n    } finally {\n      trackingContext.current = prevContext;\n    }\n  }\n\n  private _execCleanup(): void {\n    if (!this._cleanup) return;\n    try {\n      this._cleanup();\n    } catch (error) {\n      this._handleExecutionError(error, ERROR_MESSAGES.EFFECT_CLEANUP_FAILED);\n    }\n    this._cleanup = null;\n  }\n\n  private _checkInfiniteLoops(): void {\n    const epoch = currentFlushEpoch();\n    if (this._lastFlushEpoch !== epoch) {\n      this._lastFlushEpoch = epoch;\n      this._executionsInEpoch = 0;\n    }\n\n    if (++this._executionsInEpoch > this._maxExecutionsPerFlush)\n      this._throwInfiniteLoopError('per-effect');\n    if (incrementFlushExecutionCount() > SCHEDULER_CONFIG.MAX_EXECUTIONS_PER_FLUSH)\n      this._throwInfiniteLoopError('global');\n\n    this._executionCount++;\n\n    // Frequency check (dev only)\n    if (IS_DEV && Number.isFinite(this._maxExecutions)) {\n      const now = Date.now();\n      if (now - this._windowStart >= DEBUG_CONFIG.EFFECT_FREQUENCY_WINDOW) {\n        this._windowStart = now;\n        this._windowCount = 1;\n      } else if (++this._windowCount > this._maxExecutions) {\n        const err = new EffectError(ERROR_MESSAGES.EFFECT_FREQUENCY_LIMIT_EXCEEDED);\n        this.dispose();\n        this._handleExecutionError(err);\n        throw err;\n      }\n    }\n  }\n\n  get isDisposed(): boolean {\n    return (this.flags & EFFECT_STATE_FLAGS.DISPOSED) !== 0;\n  }\n  get executionCount(): number {\n    return this._executionCount;\n  }\n  get isExecuting(): boolean {\n    return (this.flags & EFFECT_STATE_FLAGS.EXECUTING) !== 0;\n  }\n\n  private _throwInfiniteLoopError(type: 'per-effect' | 'global'): never {\n    const error = new EffectError(\n      `Infinite loop detected (${type}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${flushExecutionCount}`\n    );\n    this.dispose();\n    console.error(error);\n    throw error;\n  }\n\n  private _handleExecutionError(\n    error: unknown,\n    message: string = ERROR_MESSAGES.EFFECT_EXECUTION_FAILED\n  ): void {\n    const errorObj = wrapError(error, EffectError, message);\n    console.error(errorObj);\n    if (this._onError) {\n      try {\n        this._onError(errorObj);\n      } catch (e) {\n        console.error(wrapError(e, EffectError, ERROR_MESSAGES.CALLBACK_ERROR_IN_ERROR_HANDLER));\n      }\n    }\n  }\n}\n\n/**\n * Creates and starts an effect.\n *\n * @param fn - Effect function.\n * @param options - Configuration options.\n * @returns Effect instance.\n */\nexport function effect(fn: EffectFunction, options: EffectOptions = {}): EffectObject {\n  if (typeof fn !== 'function') {\n    throw new EffectError(ERROR_MESSAGES.EFFECT_MUST_BE_FUNCTION);\n  }\n\n  const effectInstance = new EffectImpl(fn, options);\n  effectInstance.execute();\n\n  return effectInstance;\n}\n","import { scheduler } from './scheduler';\n\n/**\n * Batches updates.\n *\n * @param fn - Batch function.\n * @returns - Result of `fn`.\n */\nexport function batch<T>(fn: () => T): T {\n  // Validate callback\n  if (typeof fn !== 'function') {\n    throw new TypeError('Batch callback must be a function');\n  }\n\n  scheduler.startBatch();\n  try {\n    return fn();\n  } finally {\n    scheduler.endBatch();\n  }\n}\n"],"names":["AsyncState","EFFECT_STATE_FLAGS","COMPUTED_STATE_FLAGS","ATOM_STATE_FLAGS","POOL_CONFIG","SCHEDULER_CONFIG","DEBUG_CONFIG","COMPUTED_CONFIG","SMI_MAX","IS_DEV","EMPTY_ERROR_ARRAY","AtomError","message","cause","recoverable","ComputedError","EffectError","SchedulerError","DEBUG_NAME","DEBUG_ID","DEBUG_TYPE","NO_DEFAULT_VALUE","hasDeps","o","checkCircularInternal","dep","current","visited","deps","i","child","debug","cond","msg","obj","type","id","t","nextId","generateId","trackDependency","dependency","subscribers","fn","len","link","Subscription","sub","syncDependencies","nextLinks","prevLinks","tracker","parked","node","existing","unsub","DependencyLink","version","ERROR_MESSAGES","max","dropped","wrapError","error","ErrorClass","context","isNativeError","originalMessage","finalMessage","ReactiveNode","ReactiveDependency","listener","isFn","subs","idx","last","newValue","oldValue","s","err","collectorEpoch","nextEpoch","nextVersion","v","flushExecutionCount","isFlushing","_flushEpoch","currentFlushEpoch","startFlush","endFlush","incrementFlushExecutionCount","Scheduler","callback","started","epoch","bQueue","targetBuffer","currentSize","job","iterations","jobs","count","e","droppedCount","scheduler","ATOM_BRAND","COMPUTED_BRAND","EFFECT_BRAND","trackingContext","prev","untracked","_a","_b","AtomImpl","initialValue","sync","flags","atom","options","ArrayPool","limit","capacity","enableStats","arr","emptyConst","acquired","released","rejected","leakCount","EMPTY_LINKS","linksArrayPool","isAtom","isComputed","isEffect","isPromise","value","_c","IDLE","DIRTY","PENDING","RESOLVED","REJECTED","HAS_ERROR","RECOMPUTING","DISPOSED","IS_COMPUTED","getAsyncState","ComputedAtomImpl","retries","def","hasDef","links","collected","depErrors","j","committed","result","commitErr","promise","promiseId","res","hash","throwErr","computed","EffectImpl","startEpoch","unsubscribe","wrapped","force","execId","cleanup","prevContext","now","errorObj","effect","effectInstance","batch"],"mappings":"mOAGO,MAAMA,EAAa,CACxB,KAAM,OACN,QAAS,UACT,SAAU,WACV,SAAU,UACZ,EAKaC,EAAqB,CAChC,SAAU,EACV,UAAW,CACb,EAKaC,EAAuB,CAClC,SAAU,EAEV,YAAa,EACb,MAAO,EACP,KAAM,GACN,QAAS,GACT,SAAU,GACV,SAAU,IACV,YAAa,IACb,UAAW,GACb,EAKaC,EAAmB,CAC9B,SAAU,EACV,KAAM,EACN,uBAAwB,EAC1B,EAKaC,GAAc,CACzB,SAAU,IACV,YAAa,IACb,aAAc,EAChB,EAKaC,EAAmB,CAE9B,0BAA2B,IAC3B,0BAA2B,IAG3B,yBAA0B,IAC1B,qBAAsB,IACtB,qBAAsB,GAGtB,6BAA8B,GAChC,EAKaC,EAAe,CAC1B,mBAAoB,GACpB,wBAAyB,GAC3B,EAKaC,EAAkB,CAC7B,kBAAmB,EACnB,eAAgB,OAAO,iBAAmB,CAC5C,EAKaC,EAAU,WAKVC,EACV,OAAO,QAAY,KAAe,QAAQ,KAAO,QAAQ,IAAI,WAAa,cAC1E,OAAO,QAAY,KAAe,CAAC,CAAC,QAK1BC,GAAsC,OAAO,OAAO,EAAE,ECjG5D,MAAMC,UAAkB,KAAM,CACnC,YACEC,EACOC,EAAsB,KACtBC,EAAc,GACrB,CACA,MAAMF,CAAO,EAHN,KAAA,MAAAC,EACA,KAAA,YAAAC,EAGP,KAAK,KAAO,WACd,CACF,CAGO,MAAMC,UAAsBJ,CAAU,CAC3C,YAAYC,EAAiBC,EAAsB,KAAM,CACvD,MAAMD,EAASC,EAAO,EAAI,EAC1B,KAAK,KAAO,eACd,CACF,CAGO,MAAMG,UAAoBL,CAAU,CACzC,YAAYC,EAAiBC,EAAsB,KAAM,CACvD,MAAMD,EAASC,EAAO,EAAK,EAC3B,KAAK,KAAO,aACd,CACF,CAGO,MAAMI,UAAuBN,CAAU,CAC5C,YAAYC,EAAiBC,EAAsB,KAAM,CACvD,MAAMD,EAASC,EAAO,EAAK,EAC3B,KAAK,KAAO,gBACd,CACF,CC/BO,MAAMK,SAAoB,sBAAsB,EAC1CC,UAAkB,eAAe,EACjCC,SAAoB,iBAAiB,EACrCC,SAA0B,2BAA2B,EAK5DC,GAAWC,GACf,iBAAkBA,GAAK,MAAM,QAASA,EAAgC,YAAY,EAKpF,SAASC,EAAsBC,EAAiBC,EAAiBC,EAA4B,CAE3F,GAAIF,IAAQC,EACV,MAAM,IAAIX,EACR,0FAAA,EAKJ,GAAI,CAAAY,EAAQ,IAAIF,EAAI,EAAE,IACtBE,EAAQ,IAAIF,EAAI,EAAE,EAEdH,GAAQG,CAAG,GAAG,CAChB,MAAMG,EAAOH,EAAI,aAEjB,QAASI,EAAI,EAAGA,EAAID,EAAK,OAAQC,IAAK,CACpC,MAAMC,EAAQF,EAAKC,CAAC,EAChBC,GACFN,EAAsBM,EAAOJ,EAASC,CAAO,CAEjD,CACF,CACF,CAKO,MAAMI,EAAqB,CAEhC,QAAStB,EAET,iBAAkBH,EAAa,mBAE/B,KAAK0B,EAAMC,EAAK,CACVxB,GAAU,KAAK,SAAWuB,GAC5B,QAAQ,KAAK,iBAAiBC,CAAG,EAAE,CAEvC,EAEA,cAAcR,EAAKC,EAAS,CAC1B,GAAID,IAAQC,EACV,MAAM,IAAIX,EAAc,qCAAqC,EAG3DN,GAAU,KAAK,SACjBe,EAAsBC,EAAKC,EAAS,IAAI,GAAK,CAEjD,EAEA,gBAAgBQ,EAAKC,EAAMC,EAAI,CAC7B,GAAI,CAAC3B,GAAU,CAAC,KAAK,QAAS,OAE9B,MAAM4B,EAAIH,EACVG,EAAEnB,CAAU,EAAI,GAAGiB,CAAI,IAAIC,CAAE,GAC7BC,EAAElB,EAAQ,EAAIiB,EACdC,EAAEjB,CAAU,EAAIe,CAClB,EAEA,aAAeD,GACZA,IAAyChB,CAAU,EAEtD,aAAegB,GACZA,IAAyCd,CAAU,CACxD,EAKA,IAAIkB,GAAS,EAKN,MAAMC,GAAa,IAAoBD,KCtFvC,SAASE,EACdC,EACAf,EACAgB,EACM,CACN,GAAI,OAAOhB,GAAY,WAAY,CACjC,MAAMiB,EAAKjB,EAKX,QAASG,EAAI,EAAGe,EAAMF,EAAY,OAAQb,EAAIe,EAAKf,IAAK,CACtD,MAAMgB,EAAOH,EAAYb,CAAC,EAC1B,GAAIgB,GAAQA,EAAK,KAAOF,EAAI,MAC9B,CACAD,EAAY,KAAK,IAAII,EAAaH,EAAI,MAAS,CAAC,EAChD,MACF,CAEA,GAAI,kBAAoBjB,EAAoB,CACzCA,EAAiC,cAAce,CAAU,EAC1D,MACF,CAEA,MAAMM,EAAMrB,EACZ,QAASG,EAAI,EAAGe,EAAMF,EAAY,OAAQb,EAAIe,EAAKf,IAAK,CACtD,MAAMgB,EAAOH,EAAYb,CAAC,EAC1B,GAAIgB,GAAQA,EAAK,MAAQE,EAAK,MAChC,CACAL,EAAY,KAAK,IAAII,EAAa,OAAWC,CAAG,CAAC,CACnD,CAOO,SAASC,GACdC,EACAC,EACAC,EACM,CAEN,MAAMC,MAAa,IACnB,QAASvB,EAAI,EAAGe,EAAMM,EAAU,OAAQrB,EAAIe,EAAKf,IAAK,CACpD,MAAMgB,EAAOK,EAAUrB,CAAC,EACpBgB,GAAM,OACRO,EAAO,IAAIP,EAAK,KAAMA,EAAK,KAAK,CAEpC,CAGA,QAAShB,EAAI,EAAGe,EAAMK,EAAU,OAAQpB,EAAIe,EAAKf,IAAK,CACpD,MAAMgB,EAAOI,EAAUpB,CAAC,EACxB,GAAI,CAACgB,EAAM,SAEX,MAAMQ,EAAOR,EAAK,KACZS,EAAWF,EAAO,IAAIC,CAAI,EAC5BC,IAAa,QAEfT,EAAK,MAAQS,EACbF,EAAO,OAAOC,CAAI,IAGlBtB,EAAM,cAAcsB,EAAMF,CAAO,EACjCN,EAAK,MAAQQ,EAAK,UAAUF,CAAO,EAEvC,CAGA,UAAWI,KAASH,EAAO,SACzBG,EAAA,CAEJ,CAKO,MAAMC,CAAe,CAG1B,YACSH,EACAI,EACPF,EAAkC,OAClC,CAHO,KAAA,KAAAF,EACA,KAAA,QAAAI,EAIP,KAAK,MAAQF,CACf,CACF,CAKO,MAAMT,CAAgB,CAI3B,YAAYH,EAAwDI,EAA6B,CAE/F,KAAK,GAAKJ,EACV,KAAK,IAAMI,CACb,CACF,CC1GO,MAAMW,EAAiB,CAE5B,0BAA2B,qCAC3B,kCAAmC,kDACnC,4BAA6B,+BAC7B,kCAAmC,qCACnC,6BAA8B,+BAC9B,kBAAmB,wCAGnB,iCAAkC,qDAClC,kCAAmC,8BAGnC,wBAAyB,mCACzB,wBAAyB,0BACzB,sBAAuB,wBACvB,gBAAiB,mCAGjB,yBAA0B,CAACC,EAAaC,IACtC,6BAA6BD,CAAG,eAAeC,CAAO,yCAGxD,gCAAiC,2CAGjC,gCACE,2EAEF,oCAAqC,wCACrC,kCAAmC,4DACrC,EC1BO,SAASC,EACdC,EACAC,EACAC,EACW,CAEX,GAAIF,aAAiBnD,EACnB,OAAOmD,EAGT,MAAMG,EAAgBH,aAAiB,MACjCI,EAAkBD,EAAgBH,EAAM,QAAU,OAAOA,CAAK,EAC9DjD,EAAQoD,EAAgBH,EAAQ,OAGhCK,EAAe,GADRF,EAAgBH,EAAM,YAAY,KAAO,kBAC1B,KAAKE,CAAO,MAAME,CAAe,GAE7D,OAAO,IAAIH,EAAWI,EAActD,CAAK,CAC3C,CChBO,MAAMuD,EAAa,CAAnB,aAAA,CAEL,KAAA,MAAQ,EAER,KAAA,QAAU,EAEV,KAAA,eAAiB,GAEjB,KAAS,GAAmB7B,KAAe/B,CAAA,CAC7C,CAKO,MAAe6D,WAA8BD,EAAa,CAM/D,UAAUE,EAA2E,CACnF,MAAMC,EAAO,OAAOD,GAAa,WAEjC,GAAI,CAACC,IAAS,CAACD,GAAY,OAAQA,EAAwB,SAAY,YACrE,MAAMT,EACJ,IAAI,UAAU,oBAAoB,EAClClD,EACA+C,EAAe,gCAAA,EAInB,MAAMc,EAAO,KAAK,aAClB,QAAS3C,EAAI,EAAGe,EAAM4B,EAAK,OAAQ3C,EAAIe,EAAKf,IAAK,CAC/C,MAAMkB,EAAMyB,EAAK3C,CAAC,EAClB,GAAKkB,IACDwB,EAAOxB,EAAI,KAAOuB,EAAWvB,EAAI,MAAQuB,GAC3C,OAAI7D,GAAQ,QAAQ,KAAK,iCAAiC,EACnD,IAAM,CAAC,CAElB,CAEA,MAAMoC,EAAO,IAAIC,EACfyB,EAAQD,EAAoD,OAC3DC,EAAkC,OAA1BD,CAA0B,EAGrC,OAAAE,EAAK,KAAK3B,CAAI,EAEP,IAAM,KAAK,aAAaA,CAAI,CACrC,CAEQ,aAAaA,EAA6B,CAChD,MAAM2B,EAAO,KAAK,aACZC,EAAMD,EAAK,QAAQ3B,CAAI,EAC7B,GAAI4B,IAAQ,GAAI,OAGhB,MAAMC,EAAOF,EAAK,IAAA,EACdC,EAAMD,EAAK,QAAUE,IACvBF,EAAKC,CAAG,EAAIC,EAEhB,CAEA,iBAA0B,CACxB,OAAO,KAAK,aAAa,MAC3B,CAEU,mBAAmBC,EAAyBC,EAA+B,CACnF,GAAI,KAAK,aAAa,SAAW,EAAG,OAEpC,MAAMJ,EAAO,KAAK,aAAa,MAAM,CAAC,EAChC5B,EAAM4B,EAAK,OAEjB,QAAS3C,EAAI,EAAGA,EAAIe,EAAKf,IAAK,CAC5B,MAAMgD,EAAIL,EAAK3C,CAAC,EAChB,GAAKgD,EACL,GAAI,CACEA,EAAE,GAAIA,EAAE,GAAGF,EAAUC,CAAQ,EACxBC,EAAE,KAAKA,EAAE,IAAI,QAAA,CACxB,OAASC,EAAK,CACZ,KAAK,mBAAmBA,CAAG,CAC7B,CACF,CACF,CAEQ,mBAAmBA,EAAoB,CAC7C,QAAQ,MAAMjB,EAAUiB,EAAKnE,EAAW+C,EAAe,iCAAiC,CAAC,CAC3F,CACF,CChGA,IAAIqB,EAAiB,EAKd,MAAMC,EAAY,KACvBD,EAAkBA,EAAiB,EAAKvE,GAAW,EAC5CuE,GAOIE,EAAeC,GAAeA,EAAI,EAAK1E,EAE7C,IAAI2E,EAAsB,EAC7BC,EAAa,GACbC,GAAc,EAGX,MAAMC,GAAoB,IAAMD,GAKhC,SAASE,IAAsB,CACpC,OAAIH,GACE3E,GAAQ,QAAQ,KAAK,4CAA4C,EAC9D,KAGT2E,EAAa,GACbC,GAAcL,EAAA,EACdG,EAAsB,EACf,GACT,CAGO,MAAMK,GAAW,IAAM,CAC5BJ,EAAa,EACf,EAKaK,GAA+B,IAAOL,EAAa,EAAED,EAAsB,EC7BxF,MAAMO,EAAU,CAAhB,aAAA,CAEE,KAAA,aAAiD,CAAC,CAAA,EAAI,EAAE,EACxD,KAAA,aAAe,EACf,KAAA,MAAQ,EAGR,KAAA,OAAS,EAGT,KAAA,cAAgB,GAChB,KAAA,YAAc,GACd,KAAA,gBAAkB,GAGlB,KAAA,YAAc,EACd,KAAA,YAA8B,CAAA,EAC9B,KAAA,gBAAkB,EAGlB,KAAA,oBAA8BrF,EAAiB,qBAG/C,KAAA,WAAsD,KAGtD,KAAiB,cAAgB,KAAK,SAAS,KAAK,IAAI,CAAA,CAExD,IAAI,OAAwB,CAC1B,OAAI,KAAK,eAAiB,KAAK,gBAAwB,EACnD,KAAK,YAAoB,EACtB,CACT,CAEA,IAAI,WAAoB,CACtB,OAAO,KAAK,KACd,CAEA,IAAI,YAAsB,CACxB,OAAO,KAAK,WACd,CAKA,SAASsF,EAA8B,CACrC,GAAIlF,GAAU,OAAOkF,GAAa,WAChC,MAAM,IAAI1E,EAAeyC,EAAe,mCAAmC,EAI7E,GAAIiC,EAAS,aAAe,KAAK,OAGjC,IAFAA,EAAS,WAAa,KAAK,OAEvB,KAAK,aAAe,KAAK,gBAAiB,CAC5C,KAAK,YAAY,KAAK,iBAAiB,EAAIA,EAC3C,MACF,CAGA,KAAK,aAAa,KAAK,YAAY,EAAG,KAAK,OAAO,EAAIA,EAGjD,KAAK,eACR,KAAK,OAAA,EAET,CAKA,QAAe,CACT,KAAK,eAAiB,KAAK,QAAU,IACzC,KAAK,cAAgB,GAErB,eAAe,KAAK,aAAa,EACnC,CAKQ,UAAiB,CACvB,GAAI,CACF,GAAI,KAAK,QAAU,EAAG,OAEtB,MAAMC,EAAUL,GAAA,EAChB,KAAK,YAAA,EACDK,GAASJ,GAAA,CACf,QAAA,CACE,KAAK,cAAgB,GAEjB,KAAK,MAAQ,GAAK,CAAC,KAAK,aAC1B,KAAK,OAAA,CAET,CACF,CAEA,YAAmB,CACjB,KAAK,gBAAkB,GACvB,MAAMI,EAAUL,GAAA,EAChB,GAAI,CACF,KAAK,iBAAA,EACL,KAAK,YAAA,CACP,QAAA,CACE,KAAK,gBAAkB,GACnBK,GAASJ,GAAA,CACf,CACF,CAEA,kBAAyB,CACvB,GAAI,KAAK,kBAAoB,EAAG,OAGhC,MAAMK,EAAQ,EAAE,KAAK,OACfC,EAAS,KAAK,YACdC,EAAe,KAAK,aAAa,KAAK,YAAY,EACxD,IAAIC,EAAc,KAAK,MAGvB,QAASnE,EAAI,EAAGA,EAAI,KAAK,gBAAiBA,IAAK,CAC7C,MAAMoE,EAAMH,EAAOjE,CAAC,EAEhBoE,EAAI,aAAeJ,IACrBI,EAAI,WAAaJ,EACjBE,EAAaC,GAAa,EAAIC,EAElC,CAEA,KAAK,MAAQD,EACb,KAAK,gBAAkB,EAGnBF,EAAO,OAASzF,EAAiB,+BACnCyF,EAAO,OAAS,EAEpB,CAEA,aAAoB,CAClB,IAAII,EAAa,EAEjB,KAAO,KAAK,MAAQ,GAAG,CAErB,GAAI,EAAEA,EAAa,KAAK,oBAAqB,CAC3C,KAAK,qBAAA,EACL,MACF,CAEA,KAAK,cAAA,EAEL,KAAK,iBAAA,CACP,CACF,CAEA,eAAsB,CACpB,MAAMzB,EAAM,KAAK,aACX0B,EAAO,KAAK,aAAa1B,CAAG,EAC5B2B,EAAQ,KAAK,MAGnB,KAAK,aAAe3B,EAAM,EAC1B,KAAK,MAAQ,EACb,KAAK,SAEL,QAAS5C,EAAI,EAAGA,EAAIuE,EAAOvE,IAEzB,GAAI,CACFsE,EAAKtE,CAAC,EAAA,CACR,OAASwE,EAAG,CACV,QAAQ,MAAM,IAAIpF,EAAe,4CAA6CoF,CAAU,CAAC,CAC3F,CAGFF,EAAK,OAAS,CAChB,CAEQ,sBAA6B,CACnC,MAAMG,EAAe,KAAK,MAAQ,KAAK,gBAUvC,GATA,QAAQ,MACN,IAAIrF,EACFyC,EAAe,yBAAyB,KAAK,oBAAqB4C,CAAY,CAAA,CAChF,EAEF,KAAK,MAAQ,EACb,KAAK,aAAa,KAAK,YAAY,EAAG,OAAS,EAC/C,KAAK,gBAAkB,EAEnB,KAAK,WACP,GAAI,CACF,KAAK,WAAWA,CAAY,CAC9B,MAAQ,CAAC,CAEb,CAEA,YAAmB,CACjB,KAAK,cACL,KAAK,YAAc,EACrB,CAEA,UAAiB,CACf,GAAI,KAAK,cAAgB,EAAG,CACtB7F,GAAQ,QAAQ,KAAKiD,EAAe,iCAAiC,EACzE,MACF,CAEI,EAAE,KAAK,cAAgB,IACzB,KAAK,WAAA,EACL,KAAK,YAAc,GAEvB,CAEA,sBAAsBC,EAAmB,CACvC,GAAIA,EAAMtD,EAAiB,qBACzB,MAAM,IAAIY,EACR,yCAAyCZ,EAAiB,oBAAoB,EAAA,EAElF,KAAK,oBAAsBsD,CAC7B,CACF,CAEO,MAAM4C,EAAY,IAAIb,GC3OhBc,EAA4B,OAAO,IAAI,kBAAkB,EACzDC,EAAgC,OAAO,IAAI,sBAAsB,EACjEC,EAA8B,OAAO,IAAI,oBAAoB,ECD7DC,EAAkB,CAE7B,QAAS,KAST,IAAOrC,EAAoB3B,EAAgB,CACzC,MAAMiE,EAAO,KAAK,QAClB,KAAK,QAAUtC,EACf,GAAI,CACF,OAAO3B,EAAA,CACT,QAAA,CACE,KAAK,QAAUiE,CACjB,CACF,CACF,ECjBO,SAASC,GAAalE,EAAgB,CAC3C,MAAMiE,EAAOD,EAAgB,QAG7B,GAAIC,IAAS,KAAM,OAAOjE,EAAA,EAE1BgE,EAAgB,QAAU,KAC1B,GAAI,CACF,OAAOhE,EAAA,CACT,QAAA,CACEgE,EAAgB,QAAUC,CAC5B,CACF,CCpBA,IAAAE,GAAAC,GAaA,MAAMC,WAAoBD,GAAA1C,GASdyC,GAAAN,EATcO,GAAiD,CAWzE,YAAYE,EAAiBC,EAAe,CAC1C,MAAA,EATF,KAAQ,iBAAkC,OAE1C,KAAiB,YAAc,IAAM,KAAK,oBAAA,EAC1C,KAAU,aAAkC,CAAA,EAG5C,KAAUJ,EAAA,EAAc,GAItB,KAAK,OAASG,EACVC,IAAM,KAAK,OAAS/G,EAAiB,MACzC4B,EAAM,gBAAgB,KAAM,OAAQ,KAAK,EAAE,CAC7C,CAEA,IAAI,OAAW,CACb,MAAML,EAAUiF,EAAgB,QAChC,OAAIjF,GACFc,EAAgB,KAAMd,EAAS,KAAK,YAAY,EAE3C,KAAK,MACd,CAEA,IAAI,MAAMiD,EAAa,CACrB,MAAMC,EAAW,KAAK,OACtB,GAAI,OAAO,GAAGA,EAAUD,CAAQ,EAAG,OAEnC,KAAK,OAASA,EACd,KAAK,QAAUM,EAAY,KAAK,OAAO,EAEvC,MAAMkC,EAAQ,KAAK,MACnB,GAAI,OAAK,aAAa,SAAW,GAAKA,EAAQhH,EAAiB,wBAQ/D,IAJA,KAAK,iBAAmByE,EACxB,KAAK,MAAQuC,EAAQhH,EAAiB,uBAGlCgH,EAAQhH,EAAiB,MAAQ,CAACoG,EAAU,WAAY,CAC1D,KAAK,oBAAA,EACL,MACF,CAGAA,EAAU,SAAS,KAAK,WAAW,EACrC,CAKQ,qBAA4B,CAClC,MAAMY,EAAQ,KAAK,MAEnB,GAAI,EAAEA,EAAQhH,EAAiB,yBAA2BgH,EAAQhH,EAAiB,SACjF,OAGF,MAAMyE,EAAW,KAAK,iBACtB,KAAK,iBAAmB,OACxB,KAAK,OAAS,IAEd,KAAK,mBAAmB,KAAK,OAAQA,CAAQ,CAC/C,CAEA,MAAU,CACR,OAAO,KAAK,MACd,CAEA,SAAgB,CACV,KAAK,MAAQzE,EAAiB,WAElC,KAAK,aAAa,OAAS,EAC3B,KAAK,OAASA,EAAiB,SAE/B,KAAK,OAAS,OACd,KAAK,iBAAmB,OAC1B,CACF,CAQO,SAASiH,GAAQH,EAAiBI,EAAuB,GAAqB,CACnF,OAAO,IAAIL,GAASC,EAAcI,EAAQ,MAAQ,EAAK,CACzD,CChGO,MAAMC,EAAa,CAexB,YACmBC,EAAQ,GACRC,EAAW,IAC5BC,EAAc,GACd,CAHiB,KAAA,MAAAF,EACA,KAAA,SAAAC,EAhBnB,KAAiB,KAAc,CAAA,EAG/B,KAAQ,MAIG,KAYT,KAAK,MACH/G,GAAUgH,EACN,CACE,SAAU,EACV,SAAU,EACV,SAAU,CAAE,OAAQ,EAAG,SAAU,EAAG,SAAU,CAAA,CAAE,EAElD,IACR,CAKA,SAAe,CACb,OAAI,KAAK,OACP,KAAK,MAAM,WAGN,KAAK,KAAK,IAAA,GAAS,CAAA,CAC5B,CAQA,QAAQC,EAAUC,EAAiC,CACjD,GAAI,EAAAA,GAAcD,IAAQC,GAE1B,IAAID,EAAI,OAAS,KAAK,SAAU,CAC1B,KAAK,OAAO,KAAK,MAAM,SAAS,WACpC,MACF,CAEA,GAAI,KAAK,KAAK,QAAU,KAAK,MAAO,CAC9B,KAAK,OAAO,KAAK,MAAM,SAAS,WACpC,MACF,CAEA,GAAI,OAAO,SAASA,CAAG,EAAG,CACpB,KAAK,OAAO,KAAK,MAAM,SAAS,SACpC,MACF,CAEAA,EAAI,OAAS,EACb,KAAK,KAAK,KAAKA,CAAG,EAEd,KAAK,OACP,KAAK,MAAM,WAEf,CAKA,UAA6B,CAC3B,GAAI,CAAC,KAAK,MAAO,OAAO,KAExB,KAAM,CAAE,SAAAE,EAAU,SAAAC,EAAU,SAAAC,CAAA,EAAa,KAAK,MACxCC,EACJH,EAAWC,GAAYC,EAAS,OAASA,EAAS,SAAWA,EAAS,UAExE,MAAO,CACL,SAAAF,EACA,SAAAC,EACA,SAAU,CAAE,GAAGC,CAAA,EACf,OAAQC,EACR,SAAU,KAAK,KAAK,MAAA,CAExB,CAKA,OAAc,CACZ,KAAK,KAAK,OAAS,EACf,KAAK,QACP,KAAK,MAAQ,CACX,SAAU,EACV,SAAU,EACV,SAAU,CAAE,OAAQ,EAAG,SAAU,EAAG,SAAU,CAAA,CAAE,EAGtD,CACF,CC9GO,MAAMC,EAAgC,OAAO,OAClD,CAAA,CACF,EAEaC,EAAiB,IAAIX,GCC3B,SAASY,GAAOhG,EAAmC,CACxD,OAAOA,IAAQ,MAAQ,OAAOA,GAAQ,UAAYsE,KAActE,CAClE,CAYO,SAASiG,GAAWjG,EAAmC,CAC5D,OAAOA,IAAQ,MAAQ,OAAOA,GAAQ,UAAYuE,KAAkBvE,CACtE,CAKO,SAASkG,GAASlG,EAAmC,CAC1D,OAAOA,IAAQ,MAAQ,OAAOA,GAAQ,UAAYwE,KAAgBxE,CACpE,CAKO,SAASmG,GAAaC,EAAqC,CAChE,OACEA,IAAU,MACV,OAAOA,GAAU,UACjB,OAAQA,EAA6B,MAAS,UAElD,CC1CA,IAAAxB,GAAAC,GAAAwB,GA+BA,KAAM,CAAE,KAAAC,EAAM,MAAAC,EAAO,QAAAC,EAAS,SAAAC,EAAU,SAAAC,EAAU,UAAAC,EAAW,YAAAC,EAAa,SAAAC,EAAU,YAAAC,EAAA,EAClF9I,EAEF,SAAS+I,GAAc9B,EAA+B,CACpD,OAAIA,EAAQwB,EAAiB3I,EAAW,SACpCmH,EAAQuB,EAAgB1I,EAAW,QACnCmH,EAAQyB,EAAiB5I,EAAW,SACjCA,EAAW,IACpB,CAKA,MAAMkJ,WAA4BX,GAAAlE,GAEtB0C,GAAAP,EAEAM,GAAAL,EAJsB8B,GAA6D,CA6B7F,YAAY5F,EAA0B0E,EAA8B,GAAI,CACtE,GAAI,OAAO1E,GAAO,iBAAkB,IAAI5B,EAAc2C,EAAe,yBAAyB,EAC9F,MAAA,EA7BF,KAAUqD,EAAA,EAAc,GAExB,KAAUD,EAAA,EAAkB,GAG5B,KAAQ,OAAuB,KAE/B,KAAQ,WAAa,EAQrB,KAAU,aAAkC,CAAA,EAC5C,KAAQ,OAA2BkB,EAGnC,KAAQ,4BAA8B,EACtC,KAAQ,iBAAmB,EAG3B,KAAQ,YAAc,GACtB,KAAQ,YAAgCA,EACxC,KAAQ,YAAc,EAMpB,KAAK,OAAS,OAEd,KAAK,MAAQgB,GAAcP,EAAQD,EACnC,KAAK,OAASnB,EAAQ,OAAS,OAAO,GACtC,KAAK,IAAM1E,EACX,KAAK,cAAgB,iBAAkB0E,EAAUA,EAAQ,aAAgBhG,EACzE,KAAK,SAAWgG,EAAQ,SAAW,KACnC,MAAM8B,EAAU9B,EAAQ,gBAOxB,GANA,KAAK,iBACH8B,GAAW,MAAQA,GAAW,EAAIA,EAAU5I,EAAgB,kBAE9DwB,EAAM,gBAAgB,KAAM,WAAY,KAAK,EAAE,EAG3CsF,EAAQ,OAAS,GACnB,GAAI,CACF,KAAK,WAAA,CACP,MAAQ,CAER,CAEJ,CAEQ,QAAe,CACrB,MAAM3F,EAAUiF,EAAgB,QAC5BjF,GAASc,EAAgB,KAAMd,EAAS,KAAK,YAAY,CAC/D,CAEA,IAAI,OAAW,CACb,KAAK,OAAA,EAEL,MAAMyF,EAAQ,KAAK,MACnB,IAAKA,GAASwB,EAAWF,EAAQD,MAAWG,EAC1C,OAAO,KAAK,OAGd,GAAIxB,EAAQ4B,EACV,MAAM,IAAIhI,EAAc2C,EAAe,iBAAiB,EAG1D,GAAIyD,EAAQ2B,EAAa,CACvB,GAAI,KAAK,gBAAmBzH,EAAwB,OAAO,KAAK,cAChE,MAAM,IAAIN,EAAc2C,EAAe,4BAA4B,CACrE,CAEA,GAAIyD,GAASsB,EAAQD,KACnB,KAAK,WAAA,EAED,KAAK,MAAQG,GAAU,OAAO,KAAK,OAIzC,MAAMS,EAAM,KAAK,cACXC,EAASD,IAAS/H,EAExB,GAAI,KAAK,MAAQqH,EAAS,CACxB,GAAIW,EAAQ,OAAOD,EACnB,MAAM,IAAIrI,EAAc2C,EAAe,iCAAiC,CAC1E,CAEA,GAAI,KAAK,MAAQkF,EAAU,CACzB,GAAIS,EAAQ,OAAOD,EACnB,MAAM,KAAK,MACb,CAEA,OAAO,KAAK,MACd,CAEA,MAAU,CACR,OAAO,KAAK,MACd,CAEA,IAAI,OAAwB,CAC1B,YAAK,OAAA,EACEH,GAAc,KAAK,KAAK,CACjC,CAEA,IAAI,UAAoB,CAEtB,GADA,KAAK,OAAA,EACD,KAAK,OAASL,EAAWC,GAAY,MAAO,GAGhD,MAAMS,EAAQ,KAAK,OACnB,QAASzH,EAAI,EAAGe,EAAM0G,EAAM,OAAQzH,EAAIe,EAAKf,IAAK,CAChD,MAAMwB,EAAOiG,EAAMzH,CAAC,GAAG,KACvB,GAAIwB,GAAQA,EAAK,MAAQwF,EAAW,MAAO,EAC7C,CACA,MAAO,EACT,CAEA,IAAI,SAAmB,CACrB,MAAO,CAAC,KAAK,QACf,CAEA,IAAI,QAA2B,CAE7B,GADA,KAAK,OAAA,EACD,CAAC,KAAK,SAAU,OAAOnI,GAG3B,MAAM6I,EAAqB,CAAA,EACvB,KAAK,QAAQA,EAAU,KAAK,KAAK,MAAM,EAE3C,MAAMD,EAAQ,KAAK,OACnB,QAASzH,EAAI,EAAGe,EAAM0G,EAAM,OAAQzH,EAAIe,EAAKf,IAAK,CAChD,MAAMJ,EAAM6H,EAAMzH,CAAC,EAAG,KACtB,GAAIJ,EAAI,MAAQoH,EAAW,CAEzB,MAAMW,EADc/H,EACU,OAC9B,GAAI+H,EAAU,OAAS,EACrB,QAASC,EAAI,EAAGA,EAAID,EAAU,OAAQC,IAAK,CACzC,MAAM3E,EAAM0E,EAAUC,CAAC,EACnB3E,GAAOyE,EAAU,QAAQzE,CAAG,IAAM,IAAIyE,EAAU,KAAKzE,CAAG,CAC9D,CAEJ,CACF,CAEA,OAAO,OAAO,OAAOyE,CAAS,CAChC,CAEA,IAAI,WAA0B,CAC5B,YAAK,OAAA,EACE,KAAK,MACd,CAEA,IAAI,WAAqB,CACvB,YAAK,OAAA,GACG,KAAK,MAAQb,KAAa,CACpC,CAEA,IAAI,YAAsB,CACxB,YAAK,OAAA,GACG,KAAK,MAAQC,KAAc,CACrC,CAEA,YAAmB,CACjB,KAAK,WAAA,CACP,CAEA,SAAgB,CACd,GAAI,KAAK,MAAQI,EAAU,OAE3B,MAAMO,EAAQ,KAAK,OACnB,GAAIA,IAAUtB,EAAa,CACzB,QAASnG,EAAI,EAAGe,EAAM0G,EAAM,OAAQzH,EAAIe,EAAKf,IAC3CyH,EAAMzH,CAAC,EAAG,QAAA,EAEZoG,EAAe,QAAQqB,CAAK,EAC5B,KAAK,OAAStB,CAChB,CAEA,KAAK,aAAa,OAAS,EAC3B,KAAK,MAAQe,EAAWN,EAAQD,EAGhC,KAAK,OAAS,KACd,KAAK,OAAS,MAChB,CAEA,cAAc/G,EAAuB,CAEnC,GAAIA,EAAI,iBAAmB,KAAK,YAIhC,IAHAA,EAAI,eAAiB,KAAK,YAGtB,KAAK,YAAc,KAAK,YAAY,OAAQ,CAC9C,MAAMoB,EAAO,KAAK,YAAY,KAAK,WAAW,EAC9CA,EAAK,KAAOpB,EACZoB,EAAK,QAAUpB,EAAI,OACrB,MACE,KAAK,YAAY,KAAK,IAAI+B,EAAe/B,EAAKA,EAAI,OAAO,CAAC,EAE5D,KAAK,cACP,CAEQ,YAAmB,CACzB,GAAI,KAAK,MAAQqH,EAAa,OAC9B,KAAK,OAASA,EAEd,MAAM5F,EAAY,KAAK,OACvB,KAAK,YAAc8B,EAAA,EACnB,KAAK,YAAciD,EAAe,QAAA,EAClC,KAAK,YAAc,EAEnB,IAAIyB,EAAY,GAChB,GAAI,CAEF,MAAMC,EAAShD,EAAgB,IAAI,KAAM,KAAK,GAAG,EAGjD,KAAK,YAAY,OAAS,KAAK,YAC/B3D,GAAiB,KAAK,YAAaE,EAAW,IAAI,EAClD,KAAK,OAAS,KAAK,YACnBwG,EAAY,GAGRrB,GAAUsB,CAAM,EAClB,KAAK,wBAAwBA,CAAM,EAEnC,KAAK,oBAAoBA,CAAM,CAEnC,OAAStD,EAAG,CAEV,GAAI,CAACqD,EACH,GAAI,CACF,KAAK,YAAY,OAAS,KAAK,YAC/B1G,GAAiB,KAAK,YAAaE,EAAW,IAAI,EAClD,KAAK,OAAS,KAAK,YACnBwG,EAAY,EACd,OAASE,EAAW,CACdnJ,GACF,QAAQ,KAAK,0DAA2DmJ,CAAS,CAErF,CAEF,KAAK,aAAavD,EAAY3C,EAAe,4BAA6B,EAAI,CAChF,QAAA,CAEMgG,GAAaxG,IAAc8E,EAC7BC,EAAe,QAAQ/E,CAAS,EACtBwG,GACVzB,EAAe,QAAQ,KAAK,WAAW,EAIzC,KAAK,YAAc,GACnB,KAAK,YAAcD,EACnB,KAAK,YAAc,EACnB,KAAK,OAAS,CAACc,CACjB,CACF,CAEQ,wBAAwBe,EAA2B,CAEzD,KAAK,OAAS,KAAK,MAAQnB,GAAW,KAEtC,KAAK,mBAAmB,OAAW,MAAS,EAE5C,KAAK,4BAA8B,KAAK,wBAAA,EACxC,KAAK,iBAAmB,EAExB,KAAK,YAAc,KAAK,WAAa,GAAKnI,EAAgB,eAC1D,MAAMuJ,EAAY,KAAK,WAEvBD,EAAQ,KACLE,GAAQ,CACP,GAAID,IAAc,KAAK,WAGvB,IAAI,KAAK,4BAA8B,KAAK,4BAC1C,OAAI,KAAK,mBAAqB,KAAK,iBAC1B,KAAK,WAAA,EAEP,KAAK,aACV,IAAI/I,EACF,wCAAwC,KAAK,gBAAgB,WAAA,EAE/D2C,EAAe,iCAAA,EAInB,KAAK,oBAAoBqG,CAAG,EAC5B,KAAK,mBAAmBA,EAAK,MAAS,EACxC,EACCjF,GACCgF,IAAc,KAAK,YACnB,KAAK,aAAahF,EAAKpB,EAAe,iCAAiC,CAAA,CAE7E,CAEQ,yBAAkC,CACxC,IAAIsG,EAAO,EACX,MAAMV,EAAQ,KAAK,OACnB,QAASzH,EAAI,EAAGe,EAAM0G,EAAM,OAAQzH,EAAIe,EAAKf,IAC3CmI,GAASA,GAAQ,GAAKA,EAAOV,EAAMzH,CAAC,EAAG,KAAK,QAAW,EAEzD,OAAOmI,CACT,CAEQ,aAAalF,EAAc7C,EAAagI,EAAW,GAAa,CACtE,MAAMnG,EAAQD,EAAUiB,EAAK/D,EAAekB,CAAG,EAU/C,GARI,CAACgI,GAAY,EAAE,KAAK,MAAQrB,KAC9B,KAAK,QAAU3D,EAAY,KAAK,OAAO,GAGzC,KAAK,OAASnB,EAEd,KAAK,MAAS,KAAK,MAAQ,KAAwC8E,EAAWC,EAE1E,KAAK,SACP,GAAI,CACF,KAAK,SAAS/E,CAAK,CACrB,OAASuC,EAAG,CACV,QAAQ,MAAM3C,EAAe,gCAAiC2C,CAAC,CACjE,CAGF,GAAI4D,EAAU,MAAMnG,EACpB,KAAK,mBAAmB,OAAW,MAAS,CAC9C,CAEQ,oBAAoBwE,EAAgB,EAEtC,EAAE,KAAK,MAAQK,IAAa,CAAC,KAAK,OAAO,KAAK,OAAQL,CAAK,KAC7D,KAAK,QAAUrD,EAAY,KAAK,OAAO,GAGzC,KAAK,OAASqD,EACd,KAAK,OAAS,KAEd,KAAK,OAAS,KAAK,MAAQK,GAAY,IACzC,CAEA,SAAgB,CAEd,KAAK,WAAA,CACP,CAGA,YAAmB,CACb,KAAK,OAASG,EAAcL,KAChC,KAAK,OAASA,EACd,KAAK,mBAAmB,OAAW,MAAS,EAC9C,CACF,CAYO,SAASyB,GACdvH,EACA0E,EAA8B,GACb,CACjB,OAAO,IAAI6B,GAAiBvG,EAAI0E,CAAO,CACzC,CCnaA,IAAAP,GAAAC,GA6BA,MAAMoD,WAAmBpD,GAAA3C,GAEb0C,GAAAJ,EAFaK,GAAwD,CAkC/E,YAAYpE,EAAoB0E,EAAyB,GAAI,CAC3D,MAAA,EAjCF,KAAUP,EAAA,EAAgB,GAE1B,KAAQ,SAAgC,KACxC,KAAQ,OAA2BkB,EACnC,KAAQ,WAAsC,KAC9C,KAAQ,WAA+BA,EAWvC,KAAQ,cAAgB,GACxB,KAAQ,gBAAkB,GAC1B,KAAQ,mBAAqB,EAS7B,KAAQ,gBAAkB,EAC1B,KAAQ,aAAe,EACvB,KAAQ,aAAe,EACvB,KAAQ,QAAU,EAIhB,KAAK,IAAMrF,EACX,KAAK,SAAW0E,EAAQ,SAAW,KACnC,KAAK,MAAQA,EAAQ,MAAQ,GAC7B,KAAK,eACHA,EAAQ,wBAA0BhH,EAAiB,0BACrD,KAAK,uBACHgH,EAAQ,uBAAyBhH,EAAiB,0BACpD,KAAK,oBAAsBgH,EAAQ,oBAAsB,GAGrD,KAAK,OACP,KAAK,aAAe,OACpB,KAAK,gBAAkB,IAAM,KAAK,QAAA,IAElC,KAAK,aAAe,IAAM,KAAK,QAAA,EAC/B,KAAK,gBAAkB,IAAMd,EAAU,SAAS,KAAK,YAAa,GAGpExE,EAAM,gBAAgB,KAAM,SAAU,KAAK,EAAE,CAC/C,CAEO,KAAY,CACjB,GAAI,KAAK,MAAQ9B,EAAmB,SAClC,MAAM,IAAIe,EAAY0C,EAAe,eAAe,EAEtD,KAAK,QAAQ,EAAI,CACnB,CAEO,SAAgB,CACjB,KAAK,MAAQzD,EAAmB,WACpC,KAAK,OAASA,EAAmB,SAEjC,KAAK,aAAA,EACL,KAAK,YAAY,KAAK,MAAM,EACxB,KAAK,SAAW+H,GAClBC,EAAe,QAAQ,KAAK,MAAM,EAIpC,KAAK,OAASD,EACd,KAAK,WAAaA,EACpB,CAEO,cAAcvG,EAAuB,CAE1C,GAAI,EAAE,KAAK,MAAQxB,EAAmB,WAAY,OAElD,MAAMmK,EAAa,KAAK,cAGxB,GAAI3I,EAAI,iBAAmB2I,EAAY,OACvC3I,EAAI,eAAiB2I,EAErB,MAAMnH,EAAY,KAAK,WAGjB2D,EAAO,KAAK,WAClB,QAAS/E,EAAI,EAAGe,EAAMgE,EAAK,OAAQ/E,EAAIe,EAAKf,IAAK,CAC/C,MAAMgB,EAAO+D,EAAK/E,CAAC,EACnB,GAAIgB,GAAQA,EAAK,OAASpB,GAAOoB,EAAK,MAAO,CAE3CA,EAAK,QAAUpB,EAAI,QACnBwB,EAAU,KAAKJ,CAAI,EACnB+D,EAAK/E,CAAC,EAAI,KACV,MACF,CACF,CAEA,GAAI,CACF,IAAIwI,EACA,KAAK,oBAEPA,EAAc5I,EAAI,UAAU,IAAM,CAC5B,KAAK,MAAQxB,EAAmB,YAAWwB,EAAI,iBAAmB,KAAK,eAC3E,KAAK,gBAAA,CACP,CAAC,EAGD4I,EAAc5I,EAAI,UAAU,KAAK,eAAe,EAElDwB,EAAU,KAAK,IAAIO,EAAe/B,EAAKA,EAAI,QAAS4I,CAAW,CAAC,CAClE,OAASvG,EAAO,CACd,MAAMwG,EAAUzG,EAAUC,EAAO9C,EAAa0C,EAAe,uBAAuB,EAEpF,GADA,QAAQ,MAAM4G,CAAO,EACjB,KAAK,SACP,GAAI,CACF,KAAK,SAASA,CAAO,CACvB,MAAQ,CAAC,CAGXrH,EAAU,KAAK,IAAIO,EAAe/B,EAAKA,EAAI,QAAS,MAAS,CAAC,CAChE,CACF,CAKO,QAAQ8I,EAAQ,GAAa,CAIlC,GAHI,KAAK,OAAStK,EAAmB,SAAWA,EAAmB,YAG/D,CAACsK,GAAS,KAAK,OAAO,OAAS,GAAK,CAAC,KAAK,WAAY,OAE1D,KAAK,oBAAA,EAEL,KAAK,OAAStK,EAAmB,UACjC,KAAK,aAAA,EAGL,KAAK,WAAa,KAAK,OAGvB,MAAMgD,EAAYgF,EAAe,QAAA,EACjC,KAAK,WAAahF,EAClB,KAAK,cAAgB+B,EAAA,EAErB,IAAI0E,EAAY,GAChB,GAAI,CACF,MAAMC,EAAShD,EAAgB,IAAI,KAAM,KAAK,GAAG,EAKjD,GAJA,KAAK,OAAS1D,EACdyG,EAAY,GAGR,KAAK,qBAAuB3H,EAAM,QAAS,CAC7C,MAAM8D,EAAQ,KAAK,cACnB,QAAShE,EAAI,EAAGe,EAAMK,EAAU,OAAQpB,EAAIe,EAAKf,IAAK,CACpD,MAAMJ,EAAMwB,EAAUpB,CAAC,EAAG,KACtBJ,EAAI,mBAAqBoE,GAC3B9D,EAAM,KACJ,GACA,mCAAmCA,EAAM,aAAaN,CAAG,GAAK,SAAS,kDAAA,CAG7E,CACF,CAGI4G,GAAUsB,CAAM,EAClB,KAAK,mBAAmBA,CAAM,EAE9B,KAAK,SAAW,OAAOA,GAAW,WAAaA,EAAS,IAE5D,OAAS7F,EAAO,CAGd,KAAK,OAASb,EACdyG,EAAY,GACZ,KAAK,sBAAsB5F,CAAK,EAChC,KAAK,SAAW,IAClB,QAAA,CACE,KAAK,sBAAsB4F,EAAW,KAAK,WAAYzG,CAAS,EAChE,KAAK,OAAS,EAChB,CACF,CAEQ,mBAAmB4G,EAAiC,CAC1D,MAAMW,EAAS,EAAE,KAAK,QACtBX,EAAQ,KACLY,GAAY,CAEX,GAAID,IAAW,KAAK,SAAW,KAAK,MAAQvK,EAAmB,SAAU,CACvE,GAAI,OAAOwK,GAAY,WACrB,GAAI,CACFA,EAAA,CACF,OAASpE,EAAG,CACV,KAAK,sBAAsBA,EAAG3C,EAAe,qBAAqB,CACpE,CAEF,MACF,CACI,OAAO+G,GAAY,aAAY,KAAK,SAAWA,EACrD,EACC3F,GAAQ0F,IAAW,KAAK,SAAW,KAAK,sBAAsB1F,CAAG,CAAA,CAEtE,CAEQ,sBACN4E,EACAxG,EACAD,EACM,CAIN,GAHA,KAAK,WAAa,KAClB,KAAK,WAAa+E,EAEd0B,EAAW,CAEb,QAAS7H,EAAI,EAAGe,EAAMM,EAAU,OAAQrB,EAAIe,EAAKf,IAAK,CACpD,MAAMgB,EAAOK,EAAUrB,CAAC,EACpBgB,KAAW,QAAA,CACjB,CAEIK,IAAc8E,GAChBC,EAAe,QAAQ/E,CAAS,CAEpC,MAEE,KAAK,YAAYD,CAAS,EAC1BgF,EAAe,QAAQhF,CAAS,CAEpC,CAEQ,YAAYqG,EAA+B,CACjD,QAASzH,EAAI,EAAGe,EAAM0G,EAAM,OAAQzH,EAAIe,EAAKf,IAC3CyH,EAAMzH,CAAC,GAAG,QAAA,CAEd,CAEQ,UAAoB,CAC1B,MAAMyH,EAAQ,KAAK,OAEboB,EAAc/D,EAAgB,QACpCA,EAAgB,QAAU,KAE1B,GAAI,CACF,QAAS9E,EAAI,EAAGe,EAAM0G,EAAM,OAAQzH,EAAIe,EAAKf,IAAK,CAChD,MAAMgB,EAAOyG,EAAMzH,CAAC,EACdJ,EAAMoB,EAAK,KAGjB,GAAIpB,EAAI,MAAQvB,EAAqB,YACnC,GAAI,CAEIuB,EAA2B,KACnC,MAAQ,CACN,OAAIhB,GACF,QAAQ,KAAK,6BAA6BgB,EAAI,EAAE,2BAA2B,EAEtE,EACT,CAIF,GAAIA,EAAI,UAAYoB,EAAK,QAAS,MAAO,EAC3C,CACA,MAAO,EACT,QAAA,CACE8D,EAAgB,QAAU+D,CAC5B,CACF,CAEQ,cAAqB,CAC3B,GAAK,KAAK,SACV,IAAI,CACF,KAAK,SAAA,CACP,OAAS5G,EAAO,CACd,KAAK,sBAAsBA,EAAOJ,EAAe,qBAAqB,CACxE,CACA,KAAK,SAAW,KAClB,CAEQ,qBAA4B,CAClC,MAAMmC,EAAQP,GAAA,EAcd,GAbI,KAAK,kBAAoBO,IAC3B,KAAK,gBAAkBA,EACvB,KAAK,mBAAqB,GAGxB,EAAE,KAAK,mBAAqB,KAAK,wBACnC,KAAK,wBAAwB,YAAY,EACvCJ,GAAA,EAAiCpF,EAAiB,0BACpD,KAAK,wBAAwB,QAAQ,EAEvC,KAAK,kBAGDI,GAAU,OAAO,SAAS,KAAK,cAAc,EAAG,CAClD,MAAMkK,EAAM,KAAK,IAAA,EACjB,GAAIA,EAAM,KAAK,cAAgBrK,EAAa,wBAC1C,KAAK,aAAeqK,EACpB,KAAK,aAAe,UACX,EAAE,KAAK,aAAe,KAAK,eAAgB,CACpD,MAAM7F,EAAM,IAAI9D,EAAY0C,EAAe,+BAA+B,EAC1E,WAAK,QAAA,EACL,KAAK,sBAAsBoB,CAAG,EACxBA,CACR,CACF,CACF,CAEA,IAAI,YAAsB,CACxB,OAAQ,KAAK,MAAQ7E,EAAmB,YAAc,CACxD,CACA,IAAI,gBAAyB,CAC3B,OAAO,KAAK,eACd,CACA,IAAI,aAAuB,CACzB,OAAQ,KAAK,MAAQA,EAAmB,aAAe,CACzD,CAEQ,wBAAwBkC,EAAsC,CACpE,MAAM2B,EAAQ,IAAI9C,EAChB,2BAA2BmB,CAAI,sBAAsB,KAAK,kBAAkB,uDAAuDgD,CAAmB,EAAA,EAExJ,WAAK,QAAA,EACL,QAAQ,MAAMrB,CAAK,EACbA,CACR,CAEQ,sBACNA,EACAlD,EAAkB8C,EAAe,wBAC3B,CACN,MAAMkH,EAAW/G,EAAUC,EAAO9C,EAAaJ,CAAO,EAEtD,GADA,QAAQ,MAAMgK,CAAQ,EAClB,KAAK,SACP,GAAI,CACF,KAAK,SAASA,CAAQ,CACxB,OAASvE,EAAG,CACV,QAAQ,MAAMxC,EAAUwC,EAAGrF,EAAa0C,EAAe,+BAA+B,CAAC,CACzF,CAEJ,CACF,CASO,SAASmH,GAAOlI,EAAoB0E,EAAyB,GAAkB,CACpF,GAAI,OAAO1E,GAAO,WAChB,MAAM,IAAI3B,EAAY0C,EAAe,uBAAuB,EAG9D,MAAMoH,EAAiB,IAAIX,GAAWxH,EAAI0E,CAAO,EACjD,OAAAyD,EAAe,QAAA,EAERA,CACT,CCnYO,SAASC,GAASpI,EAAgB,CAEvC,GAAI,OAAOA,GAAO,WAChB,MAAM,IAAI,UAAU,mCAAmC,EAGzD4D,EAAU,WAAA,EACV,GAAI,CACF,OAAO5D,EAAA,CACT,QAAA,CACE4D,EAAU,SAAA,CACZ,CACF"}