@but212/atom-effect 0.22.2 → 0.23.0

package/dist/atom-effect.min.js

@@ -1,2 +1,2 @@
-(function(o,l){typeof exports=="object"&&typeof module<"u"?l(exports):typeof define=="function"&&define.amd?define(["exports"],l):(o=typeof globalThis<"u"?globalThis:o||self,l(o.AtomEffect={}))})(this,(function(o){"use strict";const l={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},f={DISPOSED:1,SYNC:8,NOTIFICATION_SCHEDULED:16},ht={MAX_SIZE:1e3,WARMUP_SIZE:100,ENABLE_STATS:!1},E={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},Q={WARN_INFINITE_LOOP:!0,EFFECT_FREQUENCY_WINDOW:1e3},Y={MAX_ASYNC_RETRIES:3,MAX_PROMISE_ID:Number.MAX_SAFE_INTEGER-1},N=1073741823,q=typeof process<"u"&&process.env&&!1||!1,ct=Object.freeze([]);class p extends Error{constructor(t,e=null,s=!0){super(t),this.cause=e,this.recoverable=s,this.name="AtomError"}}class d extends p{constructor(t,e=null){super(t,e,!0),this.name="ComputedError"}}class S extends p{constructor(t,e=null){super(t,e,!1),this.name="EffectError"}}class y extends p{constructor(t,e=null){super(t,e,!1),this.name="SchedulerError"}}const ut=Symbol("AtomEffect.DebugName"),_t=Symbol("AtomEffect.Type"),P=Symbol("AtomEffect.NoDefaultValue"),O={enabled:q,warnInfiniteLoop:Q.WARN_INFINITE_LOOP,warn(i,t){},checkCircular(i,t){if(i===t)throw new d("Direct circular dependency detected")},attachDebugInfo(i,t,e){},getDebugName:i=>i?.[ut],getDebugType:i=>i?.[_t]};let at=1;const lt=()=>at++;function j(i,t,e){if(typeof t=="function"){const n=t;if(e.some(r=>r&&r.fn===n))return;e.push(new x(n,void 0));return}if("addDependency"in t){t.addDependency(i);return}const s=t;e.some(n=>n&&n.sub===s)||e.push(new x(void 0,s))}function $(i,t,e){const s=new Map;t.forEach(n=>{n?.unsub&&s.set(n.node,n.unsub)}),i.forEach(n=>{if(!n)return;const r=n.node,c=s.get(r);c!==void 0?(n.unsub=c,s.delete(r)):(O.checkCircular(r,e),n.unsub=r.subscribe(e))}),s.forEach(n=>n())}class v{constructor(t,e,s=void 0){this.node=t,this.version=e,this.unsub=s}}class x{constructor(t,e){this.fn=t,this.sub=e}}const h={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 C(i,t,e){if(i instanceof p)return i;const s=i instanceof Error,n=s?i.message:String(i),r=s?i:void 0,k=`${s?i.constructor.name:"Unexpected error"} (${e}): ${n}`;return new t(k,r)}class W{constructor(){this.flags=0,this.version=0,this._lastSeenEpoch=-1,this.id=lt()&N}}class K extends W{subscribe(t){const e=typeof t=="function";if(!e&&(!t||typeof t.execute!="function"))throw C(new TypeError("Invalid subscriber"),p,h.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);if(this._subscribers.some(r=>r?e?r.fn===t:r.sub===t:!1))return()=>{};const s=new x(e?t:void 0,e?void 0:t);return this._subscribers.push(s),()=>this._unsubscribe(s)}_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;this._subscribers.slice(0).forEach(n=>{if(n)try{n.fn?n.fn(t,e):n.sub&&n.sub.execute()}catch(r){this._handleNotifyError(r)}})}_handleNotifyError(t){console.error(C(t,p,h.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED))}}let M=0;const B=()=>(M=M+1&N||1,M),w=i=>i+1&N;let z=0,R=!1,J=0;const Z=()=>J;function tt(){return R?!1:(R=!0,J=B(),z=0,!0)}const et=()=>{R=!1},ft=()=>R?++z:0;class Et{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=E.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(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;e.slice(0,this._batchQueueSize).forEach(r=>{r._nextEpoch!==t&&(r._nextEpoch=t,s[n++]=r)}),this._size=n,this._batchQueueSize=0,e.length>E.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(h.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(){this._batchDepth!==0&&--this._batchDepth===0&&(this._flushSync(),this._isBatching=!1)}setMaxFlushIterations(t){if(t<E.MIN_FLUSH_ITERATIONS)throw new y(`Max flush iterations must be at least ${E.MIN_FLUSH_ITERATIONS}`);this._maxFlushIterations=t}}const g=new Et,m=Symbol.for("atom-effect/atom"),H=Symbol.for("atom-effect/computed"),V=Symbol.for("atom-effect/effect"),a={current:null,run(i,t){const e=this.current;this.current=i;try{return t()}finally{this.current=e}}};function dt(i){const t=a.current;if(t===null)return i();a.current=null;try{return i()}finally{a.current=t}}var st;class It extends K{constructor(t,e){super(),this._pendingOldValue=void 0,this._notifyTask=()=>this._flushNotifications(),this._subscribers=[],this[st]=!0,this._value=t,e&&(this.flags|=f.SYNC),O.attachDebugInfo(this,"atom",this.id)}get value(){const t=a.current;return t&&j(this,t,this._subscribers),this._value}set value(t){const e=this._value;if(Object.is(e,t))return;this._value=t,this.version=w(this.version);const s=this.flags;if(!(this._subscribers.length===0||s&f.NOTIFICATION_SCHEDULED)){if(this._pendingOldValue=e,this.flags=s|f.NOTIFICATION_SCHEDULED,s&f.SYNC&&!g.isBatching){this._flushNotifications();return}g.schedule(this._notifyTask)}}_flushNotifications(){const t=this.flags;if(!(t&f.NOTIFICATION_SCHEDULED)||t&f.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&f.DISPOSED||(this._subscribers.length=0,this.flags|=f.DISPOSED,this._value=void 0,this._pendingOldValue=void 0)}[(st=m,Symbol.dispose)](){this.dispose()}}function pt(i,t={}){return new It(i,t.sync??!1)}class St{constructor(t=50,e=256,s=!1){this.limit=t,this.capacity=e,this.pool=[],this.stats=null,this.stats=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 u=Object.freeze([]),I=new St;function Dt(i){return i!==null&&typeof i=="object"&&m in i}function Ct(i){return i!==null&&typeof i=="object"&&H in i}function gt(i){return i!==null&&typeof i=="object"&&V in i}function it(i){return i!==null&&typeof i=="object"&&typeof i.then=="function"}var nt,rt;const{IDLE:L,DIRTY:T,PENDING:F,RESOLVED:D,REJECTED:b,HAS_ERROR:U,RECOMPUTING:A,DISPOSED:G,IS_COMPUTED:Tt}=X;function Ot(i){return i&D?l.RESOLVED:i&F?l.PENDING:i&b?l.REJECTED:l.IDLE}class bt extends K{constructor(t,e={}){if(typeof t!="function")throw new d(h.COMPUTED_MUST_BE_FUNCTION);super(),this[rt]=!0,this[nt]=!0,this._error=null,this._promiseId=0,this._subscribers=[],this._links=u,this._asyncStartAggregateVersion=0,this._asyncRetryCount=0,this._lastDriftEpoch=-1,this._trackEpoch=-1,this._trackLinks=u,this._trackCount=0,this._value=void 0,this.flags=Tt|T|L,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??Y.MAX_ASYNC_RETRIES)&N,O.attachDebugInfo(this,"computed",this.id),e.lazy===!1)try{this._recompute()}catch{}}_track(){const t=a.current;t&&j(this,t,this._subscribers)}get value(){this._track();const t=this.flags;if((t&(D|T|L))===D)return this._value;if(t&G)throw new d(h.COMPUTED_DISPOSED);if(t&A){if(this._defaultValue!==P)return this._defaultValue;throw new d(h.COMPUTED_CIRCULAR_DEPENDENCY)}if(t&(T|L)&&(this._recompute(),this.flags&D))return this._value;const e=this._defaultValue,s=e!==P;if(this.flags&F){if(s)return e;throw new d(h.COMPUTED_ASYNC_PENDING_NO_DEFAULT)}if(this.flags&b){if(s)return e;throw this._error}return this._value}peek(){return this._value}get state(){return this._track(),Ot(this.flags)}get hasError(){return this._track(),this.flags&(b|U)?!0:this._links.some(t=>t?.node?.flags&U)}get isValid(){return!this.hasError}get errors(){if(this._track(),!this.hasError)return ct;const t=[];return this._error&&t.push(this._error),this._links.forEach(s=>{const n=s.node;n.flags&U&&n.errors.forEach(c=>{c&&!t.includes(c)&&t.push(c)})}),Object.freeze(t)}get lastError(){return this._track(),this._error}get isPending(){return this._track(),(this.flags&F)!==0}get isResolved(){return this._track(),(this.flags&D)!==0}invalidate(){this._markDirty()}dispose(){if(this.flags&G)return;const t=this._links;t!==u&&(t.forEach(e=>e.unsub?.()),I.release(t),this._links=u),this._subscribers.length=0,this.flags=G|T|L,this._error=null,this._value=void 0}[(rt=m,nt=H,Symbol.dispose)](){this.dispose()}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 v(t,t.version));this._trackCount++}}_recompute(){if(this.flags&A)return;this.flags|=A;const t=this._links;this._trackEpoch=B(),this._trackLinks=I.acquire(),this._trackCount=0;let e=!1;try{const s=a.run(this,this._fn);this._trackLinks.length=this._trackCount,$(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,$(this._trackLinks,t,this),this._links=this._trackLinks,e=!0}catch{}this._handleError(s,h.COMPUTED_COMPUTATION_FAILED,!0)}finally{e&&t!==u?I.release(t):e||I.release(this._trackLinks),this._trackEpoch=-1,this._trackLinks=u,this._trackCount=0,this.flags&=~A}}_handleAsyncComputation(t){this.flags=(this.flags|F)&-217,this._notifySubscribers(void 0,void 0),this._asyncStartAggregateVersion=this._captureVersionSnapshot(),this._asyncRetryCount=0,this._promiseId=(this._promiseId+1)%Y.MAX_PROMISE_ID;const e=this._promiseId;t.then(s=>{if(e===this._promiseId){if(this._captureVersionSnapshot()!==this._asyncStartAggregateVersion){const n=Z();return this._lastDriftEpoch!==n&&(this._lastDriftEpoch=n,this._asyncRetryCount=0),this._asyncRetryCount++<this._maxAsyncRetries?this._markDirty():this._handleError(new d(`Async drift threshold exceeded after ${this._maxAsyncRetries} retries.`),h.COMPUTED_ASYNC_COMPUTATION_FAILED)}this._finalizeResolution(s),this._notifySubscribers(s,void 0)}},s=>e===this._promiseId&&this._handleError(s,h.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=C(t,d,e);if(!s&&!(this.flags&b)&&(this.version=w(this.version)),this._error=n,this.flags=this.flags&-121|b|U,this._onError)try{this._onError(n)}catch(r){console.error(h.CALLBACK_ERROR_IN_ERROR_HANDLER,r)}if(s)throw n;this._notifySubscribers(void 0,void 0)}_finalizeResolution(t){(!(this.flags&D)||!this._equal(this._value,t))&&(this.version=w(this.version)),this._value=t,this._error=null,this.flags=(this.flags|D)&-697}execute(){this._markDirty()}_markDirty(){this.flags&(A|T)||(this.flags|=T,this._notifySubscribers(void 0,void 0))}}function At(i,t={}){return new bt(i,t)}var ot;class Nt extends W{constructor(t,e={}){super(),this[ot]=!0,this._cleanup=null,this._links=u,this._nextLinks=null,this._prevLinks=u,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??E.MAX_EXECUTIONS_PER_SECOND,this._maxExecutionsPerFlush=e.maxExecutionsPerFlush??E.MAX_EXECUTIONS_PER_EFFECT,this._sync?(this._executeTask=void 0,this._notifyCallback=()=>this.execute()):(this._executeTask=()=>this.execute(),this._notifyCallback=()=>g.schedule(this._executeTask)),O.attachDebugInfo(this,"effect",this.id)}run(){if(this.flags&_.DISPOSED)throw new S(h.EFFECT_DISPOSED);this.execute(!0)}dispose(){this.flags&_.DISPOSED||(this.flags|=_.DISPOSED,this._execCleanup(),this._unsubLinks(this._links),this._links!==u&&I.release(this._links),this._links=u,this._prevLinks=u)}[(ot=V,Symbol.dispose)](){this.dispose()}addDependency(t){if(!(this.flags&_.EXECUTING))return;const e=this._currentEpoch;if(t._lastSeenEpoch===e)return;t._lastSeenEpoch=e;const s=this._nextLinks,n=this._prevLinks,r=n.findIndex(c=>c&&c.node===t&&c.unsub);if(r!==-1){const c=n[r];c.version=t.version,s.push(c),n[r]=null;return}try{const c=t.subscribe(this._notifyCallback);s.push(new v(t,t.version,c))}catch(c){const k=C(c,S,h.EFFECT_EXECUTION_FAILED);if(console.error(k),this._onError)try{this._onError(k)}catch{}s.push(new v(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(),this._prevLinks=this._links;const e=I.acquire();this._nextLinks=e,this._currentEpoch=B();let s=!1;try{const n=a.run(this,this._fn);this._links=e,s=!0,it(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&_.DISPOSED){if(typeof s=="function")try{s()}catch(n){this._handleExecutionError(n,h.EFFECT_CLEANUP_FAILED)}return}typeof s=="function"&&(this._cleanup=s)},s=>e===this._execId&&this._handleExecutionError(s))}_finalizeDependencies(t,e,s){this._nextLinks=null,this._prevLinks=u,t?(e.forEach(n=>n?.unsub?.()),e!==u&&I.release(e)):(this._unsubLinks(s),I.release(s))}_unsubLinks(t){t.forEach(e=>e?.unsub?.())}_isDirty(){const t=this._links,e=a.current;a.current=null;try{return t.some(s=>{const n=s.node;if(n.flags&X.IS_COMPUTED)try{n.value}catch{return!0}return n.version!==s.version})}finally{a.current=e}}_execCleanup(){if(this._cleanup){try{this._cleanup()}catch(t){this._handleExecutionError(t,h.EFFECT_CLEANUP_FAILED)}this._cleanup=null}}_checkInfiniteLoops(){const t=Z();this._lastFlushEpoch!==t&&(this._lastFlushEpoch=t,this._executionsInEpoch=0),++this._executionsInEpoch>this._maxExecutionsPerFlush&&this._throwInfiniteLoopError("per-effect"),ft()>E.MAX_EXECUTIONS_PER_FLUSH&&this._throwInfiniteLoopError("global"),this._executionCount++}get isDisposed(){return(this.flags&_.DISPOSED)!==0}get executionCount(){return this._executionCount}get isExecuting(){return(this.flags&_.EXECUTING)!==0}_throwInfiniteLoopError(t){const e=new S(`Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${z}`);throw this.dispose(),console.error(e),e}_handleExecutionError(t,e=h.EFFECT_EXECUTION_FAILED){const s=C(t,S,e);if(console.error(s),this._onError)try{this._onError(s)}catch(n){console.error(C(n,S,h.CALLBACK_ERROR_IN_ERROR_HANDLER))}}}function yt(i,t={}){if(typeof i!="function")throw new S(h.EFFECT_MUST_BE_FUNCTION);const e=new Nt(i,t);return e.execute(),e}function Rt(i){if(typeof i!="function")throw new TypeError("Batch callback must be a function");g.startBatch();try{return i()}finally{g.endBatch()}}o.ATOM_BRAND=m,o.AsyncState=l,o.AtomError=p,o.COMPUTED_BRAND=H,o.ComputedError=d,o.DEBUG_CONFIG=Q,o.DEBUG_RUNTIME=O,o.EFFECT_BRAND=V,o.EffectError=S,o.POOL_CONFIG=ht,o.SCHEDULER_CONFIG=E,o.SchedulerError=y,o.atom=pt,o.batch=Rt,o.computed=At,o.effect=yt,o.isAtom=Dt,o.isComputed=Ct,o.isEffect=gt,o.scheduler=g,o.untracked=dt,Object.defineProperty(o,Symbol.toStringTag,{value:"Module"})}));
+(function(o,f){typeof exports=="object"&&typeof module<"u"?f(exports):typeof define=="function"&&define.amd?define(["exports"],f):(o=typeof globalThis<"u"?globalThis:o||self,f(o.AtomEffect={}))})(this,(function(o){"use strict";const f={IDLE:"idle",PENDING:"pending",RESOLVED:"resolved",REJECTED:"rejected"},l={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},E={DISPOSED:1,SYNC:8,NOTIFICATION_SCHEDULED:16},d={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},G={WARN_INFINITE_LOOP:!0,EFFECT_FREQUENCY_WINDOW:1e3},Q={MAX_ASYNC_RETRIES:3,MAX_PROMISE_ID:Number.MAX_SAFE_INTEGER-1},D={UNINITIALIZED:-1},A=1073741823,Y=typeof process<"u"&&process.env&&!1||!1,ct=Object.freeze([]);function j(n,t,s){const e=new Map;for(let i=0;i<t.length;i++){const r=t[i];r?.unsub&&e.set(r.node,r.unsub)}for(let i=0;i<n.length;i++){const r=n[i];if(!r)continue;const h=r.node,c=e.get(h);c!==void 0?(r.unsub=c,e.delete(h)):r.unsub||(r.unsub=h.subscribe(s))}for(const i of e.values())i()}class O{constructor(t,s,e=void 0){this.node=t,this.version=s,this.unsub=e}}class ut{constructor(t,s){this.fn=t,this.sub=s}notify(t,s){this.fn?this.fn(t,s):this.sub&&this.sub.execute()}}class C extends Error{constructor(t,s=null,e=!0){super(t),this.cause=s,this.recoverable=e,this.name="AtomError"}}class p extends C{constructor(t,s=null){super(t,s,!0),this.name="ComputedError"}}class S extends C{constructor(t,s=null){super(t,s,!1),this.name="EffectError"}}class y extends C{constructor(t,s=null){super(t,s,!1),this.name="SchedulerError"}}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:(n,t)=>`Maximum flush iterations (${n}) 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.",BATCH_CALLBACK_MUST_BE_FUNCTION:"Batch callback must be a function"},_t=Symbol("AtomEffect.DebugName"),lt=Symbol("AtomEffect.Type"),x=Symbol("AtomEffect.NoDefaultValue"),m={enabled:Y,warnInfiniteLoop:G.WARN_INFINITE_LOOP,warn(n,t){},attachDebugInfo(n,t,s){},getDebugName:n=>n?.[_t],getDebugType:n=>n?.[lt]};let at=1;const ft=()=>at++;function k(n,t,s){if(n instanceof C)return n;const e=n instanceof Error,i=e?n.message:String(n),r=e?n:void 0,c=`${e?n.constructor.name:"Unexpected error"} (${s}): ${i}`;return new t(c,r)}class q{constructor(){this.flags=0,this.version=0,this._lastSeenEpoch=D.UNINITIALIZED,this.id=ft()&A}}class $ extends q{constructor(){super(...arguments),this._notifying=0}subscribe(t){const s=typeof t=="function";if(!s&&(!t||typeof t.execute!="function"))throw k(new TypeError("Invalid subscriber"),C,u.ATOM_SUBSCRIBER_MUST_BE_FUNCTION);const e=this._subscribers,i=e.length;let r=!1;for(let c=0;c<i;c++){const V=e[c];if(V!=null&&(s?V.fn===t:V.sub===t)){r=!0;break}}if(r)return()=>{};const h=new ut(s?t:void 0,s?void 0:t);return e.push(h),()=>this._unsubscribe(h)}_unsubscribe(t){const s=this._subscribers;let e=-1;for(let r=0;r<s.length;r++)if(s[r]===t){e=r;break}if(e===-1)return;if(this._notifying>0){s[e]=null;return}const i=s.pop();e<s.length&&i!==void 0&&(s[e]=i)}subscriberCount(){let t=0;const s=this._subscribers;for(let e=0;e<s.length;e++)s[e]!=null&&t++;return t}_notifySubscribers(t,s){const e=this._subscribers,i=e.length;if(i!==0){this._notifying++;try{for(let r=0;r<i;r++){const h=e[r];if(h!=null)try{h.notify(t,s)}catch(c){this._handleNotifyError(c)}}}finally{this._notifying--,this._notifying===0&&this._cleanupTombstones()}}}_cleanupTombstones(){const t=this._subscribers;let s=0;for(;s<t.length;)if(t[s]===null){const e=t.pop();s<t.length&&e!==void 0&&(t[s]=e)}else s++}_handleNotifyError(t){console.error(k(t,C,u.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED))}}let P=0;const M=()=>(P=P+1&A||1,P),B=n=>n+1&A;let w=0,R=!1,K=0;const W=()=>K;function Z(){return R?!1:(R=!0,K=M(),w=0,!0)}const J=()=>{R=!1},Et=()=>R?++w:0;class dt{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=d.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(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=Z();this._drainQueue(),t&&J()}finally{this._isProcessing=!1,this._size>0&&!this._isBatching&&this._flush()}}_flushSync(){this._isFlushingSync=!0;const t=Z();try{this._mergeBatchQueue(),this._drainQueue()}finally{this._isFlushingSync=!1,t&&J()}}_mergeBatchQueue(){if(this._batchQueueSize===0)return;const t=++this._epoch,s=this._batchQueue,e=this._queueBuffer[this._bufferIndex];let i=this._size;s.slice(0,this._batchQueueSize).forEach(r=>{r._nextEpoch!==t&&(r._nextEpoch=t,e[i++]=r)}),this._size=i,this._batchQueueSize=0,s.length>d.BATCH_QUEUE_SHRINK_THRESHOLD&&(s.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,s=this._queueBuffer[t],e=this._size;this._bufferIndex=t^1,this._size=0,this._epoch++;for(let i=0;i<e;i++)try{const r=s[i];typeof r=="function"?r():r.execute()}catch(r){console.error(new y("Error occurred during scheduler execution",r))}s.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(){this._batchDepth!==0&&--this._batchDepth===0&&(this._flushSync(),this._isBatching=!1)}setMaxFlushIterations(t){if(t<d.MIN_FLUSH_ITERATIONS)throw new y(`Max flush iterations must be at least ${d.MIN_FLUSH_ITERATIONS}`);this._maxFlushIterations=t}}const b=new dt,z=Symbol.for("atom-effect/atom"),tt=Symbol.for("atom-effect/computed"),st=Symbol.for("atom-effect/effect"),It=Symbol.for("atom-effect/writable"),a={current:null,run(n,t){const s=this.current;this.current=n;try{return t()}finally{this.current=s}}};function Ct(n){const t=a.current;if(t===null)return n();a.current=null;try{return n()}finally{a.current=t}}var et,it;class pt extends ${constructor(t,s){super(),this._pendingOldValue=void 0,this._subscribers=[],this[it]=!0,this[et]=!0,this._value=t,s&&(this.flags|=E.SYNC),m.attachDebugInfo(this,"atom",this.id)}get value(){return a.current?.addDependency(this),this._value}set value(t){const s=this._value;if(Object.is(s,t))return;this._value=t,this.version=B(this.version);const e=this.flags;if(!(this._subscribers.length===0||e&E.NOTIFICATION_SCHEDULED)){if(this._pendingOldValue=s,this.flags=e|E.NOTIFICATION_SCHEDULED,e&E.SYNC&&!b.isBatching){this._flushNotifications();return}b.schedule(this)}}execute(){this._flushNotifications()}_flushNotifications(){const t=this.flags;if(!(t&E.NOTIFICATION_SCHEDULED)||t&E.DISPOSED)return;const s=this._pendingOldValue;this._pendingOldValue=void 0,this.flags&=-17,this._notifySubscribers(this._value,s)}peek(){return this._value}dispose(){this.flags&E.DISPOSED||(this._subscribers.length=0,this.flags|=E.DISPOSED,this._value=void 0,this._pendingOldValue=void 0)}[(it=z,et=It,Symbol.dispose)](){this.dispose()}}function St(n,t={}){return new pt(n,t.sync??!1)}class gt{constructor(t=50,s=256,e=!1){this.limit=t,this.capacity=s,this.pool=[],this.stats=null,this.stats=e?{acquired:0,released:0,rejected:{frozen:0,tooLarge:0,poolFull:0}}:null}acquire(){return this.stats&&this.stats.acquired++,this.pool.pop()??[]}release(t,s){if(!(s&&t===s)){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:s,rejected:e}=this.stats,i=t-s-(e.frozen+e.tooLarge+e.poolFull);return{acquired:t,released:s,rejected:{...e},leaked:i,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([]),I=new gt;function Dt(n){return n!==null&&typeof n=="object"&&z in n}function kt(n){return n!==null&&typeof n=="object"&&tt in n}function bt(n){return n!==null&&typeof n=="object"&&st in n}function nt(n){return n!==null&&typeof n=="object"&&typeof n.then=="function"}var rt,ht;const{IDLE:F,DIRTY:T,PENDING:U,RESOLVED:g,REJECTED:N,HAS_ERROR:v,RECOMPUTING:L,DISPOSED:H,IS_COMPUTED:Tt}=X;function Nt(n){return n&g?f.RESOLVED:n&U?f.PENDING:n&N?f.REJECTED:f.IDLE}class Lt extends ${constructor(t,s={}){if(typeof t!="function")throw new p(u.COMPUTED_MUST_BE_FUNCTION);super(),this[ht]=!0,this[rt]=!0,this._error=null,this._promiseId=0,this._subscribers=[],this._links=_,this._asyncStartAggregateVersion=0,this._asyncRetryCount=0,this._lastDriftEpoch=D.UNINITIALIZED,this._trackEpoch=D.UNINITIALIZED,this._trackLinks=_,this._trackCount=0,this._value=void 0,this.flags=Tt|T|F,this._equal=s.equal??Object.is,this._fn=t,this._defaultValue="defaultValue"in s?s.defaultValue:x,this._onError=s.onError??null;const e=s.maxAsyncRetries;if(this._maxAsyncRetries=(e??Q.MAX_ASYNC_RETRIES)&A,m.attachDebugInfo(this,"computed",this.id),s.lazy===!1)try{this._recompute()}catch{}}_track(){a.current?.addDependency(this)}get value(){this._track();const t=this.flags;if((t&(g|T|F))===g)return this._value;if(t&H)throw new p(u.COMPUTED_DISPOSED);if(t&L){if(this._defaultValue!==x)return this._defaultValue;throw new p(u.COMPUTED_CIRCULAR_DEPENDENCY)}if(t&(T|F)&&(this._recompute(),this.flags&g))return this._value;const s=this._defaultValue,e=s!==x;if(this.flags&U){if(e)return s;throw new p(u.COMPUTED_ASYNC_PENDING_NO_DEFAULT)}if(this.flags&N){if(e)return s;throw this._error}return this._value}peek(){return this._value}get state(){return this._track(),Nt(this.flags)}get hasError(){return this._track(),this.flags&(N|v)?!0:this._links.some(t=>t?.node?.flags&v)}get isValid(){return!this.hasError}get errors(){if(this._track(),!this.hasError)return ct;const t=[];return this._error&&t.push(this._error),this._links.forEach(e=>{const i=e.node;i.flags&v&&i.errors.forEach(h=>{h&&!t.includes(h)&&t.push(h)})}),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&g)!==0}invalidate(){this._markDirty()}dispose(){if(this.flags&H)return;const t=this._links;t!==_&&(t.forEach(s=>s.unsub?.()),I.release(t),this._links=_),this._subscribers.length=0,this.flags=H|T|F,this._error=null,this._value=void 0}[(ht=z,rt=tt,Symbol.dispose)](){this.dispose()}addDependency(t){if(t._lastSeenEpoch!==this._trackEpoch){if(t._lastSeenEpoch=this._trackEpoch,this._trackLinks===this._links&&this._trackCount<this._links.length&&this._links[this._trackCount].node===t){this._links[this._trackCount].version=t.version,this._trackCount++;return}if(this._trackLinks===this._links){const s=I.acquire();for(let e=0;e<this._trackCount;e++)s[e]=this._links[e];this._trackLinks=s}this._trackCount<this._trackLinks.length?this._trackLinks[this._trackCount]=new O(t,t.version):this._trackLinks.push(new O(t,t.version)),this._trackCount++}}_recompute(){if(this.flags&L)return;this.flags|=L;const t=this._links;this._trackEpoch=M(),this._trackLinks=t,this._trackCount=0;let s=!1;try{const e=a.run(this,this._fn);if(this._trackLinks===t)if(this._trackCount===t.length)s=!0;else{for(let i=this._trackCount;i<t.length;i++)t[i].unsub?.();t.length=this._trackCount,s=!0}else this._trackLinks.length=this._trackCount,j(this._trackLinks,t,this),this._links=this._trackLinks,s=!0;nt(e)?this._handleAsyncComputation(e):this._finalizeResolution(e)}catch(e){if(!s)try{if(this._trackLinks===t){for(let i=this._trackCount;i<t.length;i++)t[i].unsub?.();t.length=this._trackCount,s=!0}else this._trackLinks.length=this._trackCount,j(this._trackLinks,t,this),this._links=this._trackLinks,s=!0}catch{}this._handleError(e,u.COMPUTED_COMPUTATION_FAILED,!0)}finally{s?this._links!==t&&t!==_&&I.release(t):this._trackLinks!==t&&this._trackLinks!==_&&I.release(this._trackLinks),this._trackEpoch=D.UNINITIALIZED,this._trackLinks=_,this._trackCount=0,this.flags&=~L}}_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 s=this._promiseId;t.then(e=>{if(s===this._promiseId){if(this._captureVersionSnapshot()!==this._asyncStartAggregateVersion){const i=W();return this._lastDriftEpoch!==i&&(this._lastDriftEpoch=i,this._asyncRetryCount=0),this._asyncRetryCount++<this._maxAsyncRetries?this._markDirty():this._handleError(new p(`Async drift threshold exceeded after ${this._maxAsyncRetries} retries.`),u.COMPUTED_ASYNC_COMPUTATION_FAILED)}this._finalizeResolution(e),this._notifySubscribers(e,void 0)}},e=>s===this._promiseId&&this._handleError(e,u.COMPUTED_ASYNC_COMPUTATION_FAILED))}_captureVersionSnapshot(){let t=0;const s=this._links;for(let e=0,i=s.length;e<i;e++)t=(t<<5)-t+s[e].node.version|0;return t}_handleError(t,s,e=!1){const i=k(t,p,s);if(!e&&!(this.flags&N)&&(this.version=B(this.version)),this._error=i,this.flags=this.flags&-121|N|v,this._onError)try{this._onError(i)}catch(r){console.error(u.CALLBACK_ERROR_IN_ERROR_HANDLER,r)}if(e)throw i;this._notifySubscribers(void 0,void 0)}_finalizeResolution(t){(!(this.flags&g)||!this._equal(this._value,t))&&(this.version=B(this.version)),this._value=t,this._error=null,this.flags=(this.flags|g)&-697}execute(){this._markDirty()}_markDirty(){this.flags&(L|T)||(this.flags|=T,this._notifySubscribers(void 0,void 0))}}function At(n,t={}){return new Lt(n,t)}var ot;class Ot extends q{constructor(t,s={}){super(),this[ot]=!0,this._cleanup=null,this._links=_,this._nextLinks=null,this._prevLinks=_,this._currentEpoch=D.UNINITIALIZED,this._lastFlushEpoch=D.UNINITIALIZED,this._executionsInEpoch=0,this._executionCount=0,this._windowStart=0,this._windowCount=0,this._execId=0,this._trackCount=0,this._fn=t,this._onError=s.onError??null,this._sync=s.sync??!1,this._maxExecutions=s.maxExecutionsPerSecond??d.MAX_EXECUTIONS_PER_SECOND,this._maxExecutionsPerFlush=s.maxExecutionsPerFlush??d.MAX_EXECUTIONS_PER_EFFECT,this._sync?this._notifyCallback=()=>this.execute():this._notifyCallback=()=>b.schedule(this),m.attachDebugInfo(this,"effect",this.id)}run(){if(this.flags&l.DISPOSED)throw new S(u.EFFECT_DISPOSED);this.execute(!0)}dispose(){this.flags&l.DISPOSED||(this.flags|=l.DISPOSED,this._execCleanup(),this._unsubLinks(this._links),this._links!==_&&I.release(this._links),this._links=_,this._prevLinks=_)}[(ot=st,Symbol.dispose)](){this.dispose()}addDependency(t){if(!(this.flags&l.EXECUTING))return;const s=this._currentEpoch;if(t._lastSeenEpoch===s)return;t._lastSeenEpoch=s;const e=this._prevLinks;if(this._nextLinks===e&&this._trackCount<e.length&&e[this._trackCount].node===t){e[this._trackCount].version=t.version,this._trackCount++;return}if(this._nextLinks===e){const h=I.acquire();for(let c=0;c<this._trackCount;c++)h[c]=e[c];this._nextLinks=h}const i=this._nextLinks;let r=-1;for(let h=this._trackCount;h<e.length;h++){const c=e[h];if(c&&c.node===t&&c.unsub){r=h;break}}if(r!==-1){const h=e[r];h.version=t.version,i[this._trackCount]=h,e[r]=null}else try{const h=t.subscribe(this._notifyCallback);i[this._trackCount]=new O(t,t.version,h)}catch(h){const c=k(h,S,u.EFFECT_EXECUTION_FAILED);if(console.error(c),this._onError)try{this._onError(c)}catch{}i[this._trackCount]=new O(t,t.version,void 0)}this._trackCount++}execute(t=!1){if(this.flags&(l.DISPOSED|l.EXECUTING)||!t&&this._links.length>0&&!this._isDirty())return;this._checkInfiniteLoops(),this.flags|=l.EXECUTING,this._execCleanup(),this._prevLinks=this._links,this._nextLinks=this._links,this._currentEpoch=M(),this._trackCount=0;let s=!1;try{const e=a.run(this,this._fn);if(this._nextLinks===this._prevLinks)if(this._trackCount===this._prevLinks.length)s=!0;else{for(let i=this._trackCount;i<this._prevLinks.length;i++)this._prevLinks[i]?.unsub?.();this._prevLinks.length=this._trackCount,s=!0}else this._nextLinks.length=this._trackCount,s=!0;this._links=this._nextLinks,nt(e)?this._handleAsyncResult(e):this._cleanup=typeof e=="function"?e:null}catch(e){if(!s)if(this._nextLinks===this._prevLinks){for(let i=this._trackCount;i<this._prevLinks.length;i++)this._prevLinks[i]?.unsub?.();this._prevLinks.length=this._trackCount,s=!0}else this._nextLinks.length=this._trackCount,s=!0;this._links=this._nextLinks,this._handleExecutionError(e),this._cleanup=null}finally{this._finalizeDependencies(s,this._prevLinks,this._nextLinks),this.flags&=-9}}_handleAsyncResult(t){const s=++this._execId;t.then(e=>{if(s!==this._execId||this.flags&l.DISPOSED){if(typeof e=="function")try{e()}catch(i){this._handleExecutionError(i,u.EFFECT_CLEANUP_FAILED)}return}typeof e=="function"&&(this._cleanup=e)},e=>s===this._execId&&this._handleExecutionError(e))}_finalizeDependencies(t,s,e){this._nextLinks=null,this._prevLinks=_,t?e!==s&&s!==_&&(s.forEach(i=>i?.unsub?.()),I.release(s)):e!==s&&e!==_&&e&&(this._unsubLinks(e),I.release(e))}_unsubLinks(t){t.forEach(s=>s?.unsub?.())}_isDirty(){const t=this._links,s=a.current;a.current=null;try{return t.some(e=>{const i=e.node;if(i.flags&X.IS_COMPUTED)try{i.value}catch{return!0}return i.version!==e.version})}finally{a.current=s}}_execCleanup(){if(this._cleanup){try{this._cleanup()}catch(t){this._handleExecutionError(t,u.EFFECT_CLEANUP_FAILED)}this._cleanup=null}}_checkInfiniteLoops(){const t=W();this._lastFlushEpoch!==t&&(this._lastFlushEpoch=t,this._executionsInEpoch=0),++this._executionsInEpoch>this._maxExecutionsPerFlush&&this._throwInfiniteLoopError("per-effect"),Et()>d.MAX_EXECUTIONS_PER_FLUSH&&this._throwInfiniteLoopError("global"),this._executionCount++}get isDisposed(){return(this.flags&l.DISPOSED)!==0}get executionCount(){return this._executionCount}get isExecuting(){return(this.flags&l.EXECUTING)!==0}_throwInfiniteLoopError(t){const s=new S(`Infinite loop detected (${t}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${w}`);throw this.dispose(),console.error(s),s}_handleExecutionError(t,s=u.EFFECT_EXECUTION_FAILED){const e=k(t,S,s);if(console.error(e),this._onError)try{this._onError(e)}catch(i){console.error(k(i,S,u.CALLBACK_ERROR_IN_ERROR_HANDLER))}}}function yt(n,t={}){if(typeof n!="function")throw new S(u.EFFECT_MUST_BE_FUNCTION);const s=new Ot(n,t);return s.execute(),s}function mt(n){if(typeof n!="function")throw new TypeError(u.BATCH_CALLBACK_MUST_BE_FUNCTION);b.startBatch();try{return n()}finally{b.endBatch()}}o.AsyncState=f,o.AtomError=C,o.ComputedError=p,o.DEBUG_CONFIG=G,o.DEBUG_RUNTIME=m,o.EffectError=S,o.SCHEDULER_CONFIG=d,o.SchedulerError=y,o.atom=St,o.batch=mt,o.computed=At,o.effect=yt,o.isAtom=Dt,o.isComputed=kt,o.isEffect=bt,o.scheduler=b,o.untracked=Ct,Object.defineProperty(o,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/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    // Check dependencies\n    dep.dependencies.forEach((child) => {\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    if (subscribers.some((link) => link && link.fn === fn)) return;\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  if (subscribers.some((link) => link && link.sub === sub)) return;\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  prevLinks.forEach((link) => {\n    if (link?.unsub) {\n      parked.set(link.node, link.unsub);\n    }\n  });\n\n  // Reclaim or subscribe\n  nextLinks.forEach((link) => {\n    if (!link) return;\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  parked.forEach((unsub) => unsub());\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    if (\n      this._subscribers.some((sub) => {\n        if (!sub) return false;\n        return isFn ? sub.fn === listener : sub.sub === listener;\n      })\n    ) {\n      if (IS_DEV) console.warn('Duplicate subscription ignored.');\n      return () => {};\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    const subs = this._subscribers;\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    subs.forEach((s) => {\n      if (!s) return;\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    bQueue.slice(0, this._batchQueueSize).forEach((job) => {\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    // Execute jobs\n    for (let i = 0; i < count; i++) {\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  [Symbol.dispose](): void {\n    this.dispose();\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  SMI_MAX,\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 { currentFlushEpoch, 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  private _lastDriftEpoch = -1;\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 ?? COMPUTED_CONFIG.MAX_ASYNC_RETRIES) & SMI_MAX;\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    return this._links.some((link) => link?.node?.flags & HAS_ERROR);\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    links.forEach((link) => {\n      const dep = link.node;\n      if (dep.flags & HAS_ERROR) {\n        const computedDep = dep as unknown as ComputedAtom<unknown>;\n        computedDep.errors.forEach((err) => {\n          if (err && !collected.includes(err)) collected.push(err);\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      links.forEach((link) => link!.unsub?.());\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  [Symbol.dispose](): void {\n    this.dispose();\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        if (this._captureVersionSnapshot() !== this._asyncStartAggregateVersion) {\n          // Reset retry counter when flush epoch changes — drifts across different\n          // scheduler flushes are independent bursts, not a continuous failure streak.\n          const epoch = currentFlushEpoch();\n          if (this._lastDriftEpoch !== epoch) {\n            this._lastDriftEpoch = epoch;\n            this._asyncRetryCount = 0;\n          }\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  // 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    // 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  [Symbol.dispose](): void {\n    this.dispose();\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    const existingIndex = prev.findIndex((link) => link && link.node === dep && link.unsub);\n\n    if (existingIndex !== -1) {\n      const link = prev[existingIndex]!;\n      // Reuse DependencyLink object — update version, move to nextLinks\n      link.version = dep.version;\n      nextLinks.push(link);\n      prev[existingIndex] = null!; // Mark as reclaimed (avoid double-reclaim)\n      return;\n    }\n\n    try {\n      const unsubscribe = dep.subscribe(this._notifyCallback);\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      // 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      prevLinks.forEach((link) => link?.unsub?.());\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    links.forEach((link) => link?.unsub?.());\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      return links.some((link) => {\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        return dep.version !== link.version;\n      });\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_TYPE","NO_DEFAULT_VALUE","debug","cond","msg","dep","current","obj","type","id","nextId","generateId","trackDependency","dependency","subscribers","fn","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","i","e","droppedCount","scheduler","ATOM_BRAND","COMPUTED_BRAND","EFFECT_BRAND","trackingContext","prev","untracked","_a","AtomImpl","initialValue","sync","flags","atom","options","ArrayPool","limit","capacity","enableStats","arr","emptyConst","acquired","released","rejected","leakCount","EMPTY_LINKS","linksArrayPool","isAtom","isComputed","isEffect","isPromise","value","_b","IDLE","DIRTY","PENDING","RESOLVED","REJECTED","HAS_ERROR","RECOMPUTING","DISPOSED","IS_COMPUTED","getAsyncState","ComputedAtomImpl","retries","def","hasDef","collected","links","committed","result","promise","promiseId","res","hash","len","throwErr","computed","EffectImpl","startEpoch","existingIndex","unsubscribe","wrapped","force","execId","cleanup","prevContext","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,IACf,GAKxBC,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,UAAoB,sBAAsB,EAE1CC,UAAoB,iBAAiB,EACrCC,SAA0B,2BAA2B,EAoCrDC,EAAqB,CAEhC,QAASZ,EAET,iBAAkBH,EAAa,mBAE/B,KAAKgB,EAAMC,EAAK,CAIhB,EAEA,cAAcC,EAAKC,EAAS,CAC1B,GAAID,IAAQC,EACV,MAAM,IAAIV,EAAc,qCAAqC,CAMjE,EAEA,gBAAgBW,EAAKC,EAAMC,EAAI,CAO/B,EAEA,aAAeF,GACZA,IAAyCR,EAAU,EAEtD,aAAeQ,GACZA,IAAyCP,EAAU,CACxD,EAKA,IAAIU,GAAS,EAKN,MAAMC,GAAa,IAAoBD,KCpFvC,SAASE,EACdC,EACAP,EACAQ,EACM,CACN,GAAI,OAAOR,GAAY,WAAY,CACjC,MAAMS,EAAKT,EAKX,GAAIQ,EAAY,KAAME,GAASA,GAAQA,EAAK,KAAOD,CAAE,EAAG,OACxDD,EAAY,KAAK,IAAIG,EAAaF,EAAI,MAAS,CAAC,EAChD,MACF,CAEA,GAAI,kBAAoBT,EAAoB,CACzCA,EAAiC,cAAcO,CAAU,EAC1D,MACF,CAEA,MAAMK,EAAMZ,EACRQ,EAAY,KAAME,GAASA,GAAQA,EAAK,MAAQE,CAAG,GACvDJ,EAAY,KAAK,IAAIG,EAAa,OAAWC,CAAG,CAAC,CACnD,CAOO,SAASC,EACdC,EACAC,EACAC,EACM,CAEN,MAAMC,MAAa,IACnBF,EAAU,QAASL,GAAS,CACtBA,GAAM,OACRO,EAAO,IAAIP,EAAK,KAAMA,EAAK,KAAK,CAEpC,CAAC,EAGDI,EAAU,QAASJ,GAAS,CAC1B,GAAI,CAACA,EAAM,OAEX,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,CAAC,EAGDC,EAAO,QAASG,GAAUA,EAAA,CAAO,CACnC,CAKO,MAAMC,CAAe,CAG1B,YACSH,EACAI,EACPF,EAAkC,OAClC,CAHO,KAAA,KAAAF,EACA,KAAA,QAAAI,EAIP,KAAK,MAAQF,CACf,CACF,CAKO,MAAMT,CAAgB,CAI3B,YAAYF,EAAwDG,EAA6B,CAE/F,KAAK,GAAKH,EACV,KAAK,IAAMG,CACb,CACF,CChGO,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,aAAiBzC,EACnB,OAAOyC,EAGT,MAAMG,EAAgBH,aAAiB,MACjCI,EAAkBD,EAAgBH,EAAM,QAAU,OAAOA,CAAK,EAC9DvC,EAAQ0C,EAAgBH,EAAQ,OAGhCK,EAAe,GADRF,EAAgBH,EAAM,YAAY,KAAO,kBAC1B,KAAKE,CAAO,MAAME,CAAe,GAE7D,OAAO,IAAIH,EAAWI,EAAc5C,CAAK,CAC3C,CChBO,MAAM6C,CAAa,CAAnB,aAAA,CAEL,KAAA,MAAQ,EAER,KAAA,QAAU,EAEV,KAAA,eAAiB,GAEjB,KAAS,GAAmB5B,KAAetB,CAAA,CAC7C,CAKO,MAAemD,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,EAClCxC,EACAqC,EAAe,gCAAA,EAInB,GACE,KAAK,aAAa,KAAMX,GACjBA,EACEwB,EAAOxB,EAAI,KAAOuB,EAAWvB,EAAI,MAAQuB,EAD/B,EAElB,EAGD,MAAO,IAAM,CAAC,EAGhB,MAAMzB,EAAO,IAAIC,EACfyB,EAAQD,EAAoD,OAC3DC,EAAkC,OAA1BD,CAA0B,EAIrC,OADa,KAAK,aACb,KAAKzB,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,OAEvB,KAAK,aAAa,MAAM,CAAC,EACjC,QAASC,GAAM,CAClB,GAAKA,EACL,GAAI,CACEA,EAAE,GAAIA,EAAE,GAAGF,EAAUC,CAAQ,EACxBC,EAAE,KAAKA,EAAE,IAAI,QAAA,CACxB,OAASC,EAAK,CACZ,KAAK,mBAAmBA,CAAG,CAC7B,CACF,CAAC,CACH,CAEQ,mBAAmBA,EAAoB,CAC7C,QAAQ,MAAMjB,EAAUiB,EAAKzD,EAAWqC,EAAe,iCAAiC,CAAC,CAC3F,CACF,CC9FA,IAAIqB,EAAiB,EAKd,MAAMC,EAAY,KACvBD,EAAkBA,EAAiB,EAAK7D,GAAW,EAC5C6D,GAOIE,EAAeC,GAAeA,EAAI,EAAKhE,EAE7C,IAAIiE,EAAsB,EAC7BC,EAAa,GACbC,EAAc,EAGX,MAAMC,EAAoB,IAAMD,EAKhC,SAASE,IAAsB,CACpC,OAAIH,EAEK,IAGTA,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,oBAA8B3E,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,SAAS4E,EAA8B,CAMrC,GAAIA,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,MAGvBF,EAAO,MAAM,EAAG,KAAK,eAAe,EAAE,QAASG,GAAQ,CAEjDA,EAAI,aAAeJ,IACrBI,EAAI,WAAaJ,EACjBE,EAAaC,GAAa,EAAIC,EAElC,CAAC,EAED,KAAK,MAAQD,EACb,KAAK,gBAAkB,EAGnBF,EAAO,OAAS/E,EAAiB,+BACnC+E,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,SAGL,QAAS4B,EAAI,EAAGA,EAAID,EAAOC,IACzB,GAAI,CACFF,EAAKE,CAAC,EAAA,CACR,OAASC,EAAG,CACV,QAAQ,MAAM,IAAI3E,EAAe,4CAA6C2E,CAAU,CAAC,CAC3F,CAGFH,EAAK,OAAS,CAChB,CAEQ,sBAA6B,CACnC,MAAMI,EAAe,KAAK,MAAQ,KAAK,gBAUvC,GATA,QAAQ,MACN,IAAI5E,EACF+B,EAAe,yBAAyB,KAAK,oBAAqB6C,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,CACX,KAAK,cAAgB,GAKrB,EAAE,KAAK,cAAgB,IACzB,KAAK,WAAA,EACL,KAAK,YAAc,GAEvB,CAEA,sBAAsB5C,EAAmB,CACvC,GAAIA,EAAM5C,EAAiB,qBACzB,MAAM,IAAIY,EACR,yCAAyCZ,EAAiB,oBAAoB,EAAA,EAElF,KAAK,oBAAsB4C,CAC7B,CACF,CAEO,MAAM6C,EAAY,IAAId,GC1OhBe,EAA4B,OAAO,IAAI,kBAAkB,EACzDC,EAAgC,OAAO,IAAI,sBAAsB,EACjEC,EAA8B,OAAO,IAAI,oBAAoB,ECD7DC,EAAkB,CAE7B,QAAS,KAST,IAAOtC,EAAoB1B,EAAgB,CACzC,MAAMiE,EAAO,KAAK,QAClB,KAAK,QAAUvC,EACf,GAAI,CACF,OAAO1B,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,GAaA,MAAMC,WAAoB3C,CAAiD,CAWzE,YAAY4C,EAAiBC,EAAe,CAC1C,MAAA,EATF,KAAQ,iBAAkC,OAE1C,KAAiB,YAAc,IAAM,KAAK,oBAAA,EAC1C,KAAU,aAAkC,CAAA,EAG5C,KAAUH,EAAA,EAAc,GAItB,KAAK,OAASE,EACVC,IAAM,KAAK,OAASrG,EAAiB,MACzCkB,EAAM,gBAAgB,KAAM,OAAQ,KAAK,EAAE,CAC7C,CAEA,IAAI,OAAW,CACb,MAAMI,EAAUyE,EAAgB,QAChC,OAAIzE,GACFM,EAAgB,KAAMN,EAAS,KAAK,YAAY,EAE3C,KAAK,MACd,CAEA,IAAI,MAAMwC,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,EAAQtG,EAAiB,wBAQ/D,IAJA,KAAK,iBAAmB+D,EACxB,KAAK,MAAQuC,EAAQtG,EAAiB,uBAGlCsG,EAAQtG,EAAiB,MAAQ,CAAC2F,EAAU,WAAY,CAC1D,KAAK,oBAAA,EACL,MACF,CAGAA,EAAU,SAAS,KAAK,WAAW,EACrC,CAKQ,qBAA4B,CAClC,MAAMW,EAAQ,KAAK,MAEnB,GAAI,EAAEA,EAAQtG,EAAiB,yBAA2BsG,EAAQtG,EAAiB,SACjF,OAGF,MAAM+D,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,MAAQ/D,EAAiB,WAElC,KAAK,aAAa,OAAS,EAC3B,KAAK,OAASA,EAAiB,SAE/B,KAAK,OAAS,OACd,KAAK,iBAAmB,OAC1B,CAEA,EAzEUkG,GAAAN,EAyET,OAAO,QAAA,GAAiB,CACvB,KAAK,QAAA,CACP,CACF,CAQO,SAASW,GAAQH,EAAiBI,EAAuB,GAAqB,CACnF,OAAO,IAAIL,GAASC,EAAcI,EAAQ,MAAQ,EAAK,CACzD,CCpGO,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,MACOC,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,GAAO9F,EAAmC,CACxD,OAAOA,IAAQ,MAAQ,OAAOA,GAAQ,UAAYqE,KAAcrE,CAClE,CAYO,SAAS+F,GAAW/F,EAAmC,CAC5D,OAAOA,IAAQ,MAAQ,OAAOA,GAAQ,UAAYsE,KAAkBtE,CACtE,CAKO,SAASgG,GAAShG,EAAmC,CAC1D,OAAOA,IAAQ,MAAQ,OAAOA,GAAQ,UAAYuE,KAAgBvE,CACpE,CAKO,SAASiG,GAAaC,EAAqC,CAChE,OACEA,IAAU,MACV,OAAOA,GAAU,UACjB,OAAQA,EAA6B,MAAS,UAElD,CC1CA,IAAAvB,GAAAwB,GAgCA,KAAM,CAAE,KAAAC,EAAM,MAAAC,EAAO,QAAAC,EAAS,SAAAC,EAAU,SAAAC,EAAU,UAAAC,EAAW,YAAAC,EAAa,SAAAC,EAAU,YAAAC,EAAA,EAClFpI,EAEF,SAASqI,GAAc9B,EAA+B,CACpD,OAAIA,EAAQwB,EAAiBjI,EAAW,SACpCyG,EAAQuB,EAAgBhI,EAAW,QACnCyG,EAAQyB,EAAiBlI,EAAW,SACjCA,EAAW,IACpB,CAKA,MAAMwI,WAA4B7E,CAA6D,CA8B7F,YAAYzB,EAA0ByE,EAA8B,GAAI,CACtE,GAAI,OAAOzE,GAAO,iBAAkB,IAAInB,EAAciC,EAAe,yBAAyB,EAC9F,MAAA,EA9BF,KAAU6E,EAAA,EAAc,GAExB,KAAUxB,EAAA,EAAkB,GAG5B,KAAQ,OAAuB,KAE/B,KAAQ,WAAa,EAQrB,KAAU,aAAkC,CAAA,EAC5C,KAAQ,OAA2BiB,EAGnC,KAAQ,4BAA8B,EACtC,KAAQ,iBAAmB,EAC3B,KAAQ,gBAAkB,GAG1B,KAAQ,YAAc,GACtB,KAAQ,YAAgCA,EACxC,KAAQ,YAAc,EAMpB,KAAK,OAAS,OAEd,KAAK,MAAQgB,GAAcP,EAAQD,EACnC,KAAK,OAASnB,EAAQ,OAAS,OAAO,GACtC,KAAK,IAAMzE,EACX,KAAK,cAAgB,iBAAkByE,EAAUA,EAAQ,aAAgBvF,EACzE,KAAK,SAAWuF,EAAQ,SAAW,KACnC,MAAM8B,EAAU9B,EAAQ,gBAMxB,GALA,KAAK,kBAAoB8B,GAAWlI,EAAgB,mBAAqBC,EAEzEa,EAAM,gBAAgB,KAAM,WAAY,KAAK,EAAE,EAG3CsF,EAAQ,OAAS,GACnB,GAAI,CACF,KAAK,WAAA,CACP,MAAQ,CAER,CAEJ,CAEQ,QAAe,CACrB,MAAMlF,EAAUyE,EAAgB,QAC5BzE,GAASM,EAAgB,KAAMN,EAAS,KAAK,YAAY,CAC/D,CAEA,IAAI,OAAW,CACb,KAAK,OAAA,EAEL,MAAMgF,EAAQ,KAAK,MACnB,IAAKA,GAASwB,EAAWF,EAAQD,MAAWG,EAC1C,OAAO,KAAK,OAGd,GAAIxB,EAAQ4B,EACV,MAAM,IAAItH,EAAciC,EAAe,iBAAiB,EAG1D,GAAIyD,EAAQ2B,EAAa,CACvB,GAAI,KAAK,gBAAmBhH,EAAwB,OAAO,KAAK,cAChE,MAAM,IAAIL,EAAciC,EAAe,4BAA4B,CACrE,CAEA,GAAIyD,GAASsB,EAAQD,KACnB,KAAK,WAAA,EAED,KAAK,MAAQG,GAAU,OAAO,KAAK,OAIzC,MAAMS,EAAM,KAAK,cACXC,EAASD,IAAStH,EAExB,GAAI,KAAK,MAAQ4G,EAAS,CACxB,GAAIW,EAAQ,OAAOD,EACnB,MAAM,IAAI3H,EAAciC,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,OADA,KAAK,OAAA,EACD,KAAK,OAASL,EAAWC,GAAmB,GAGzC,KAAK,OAAO,KAAMhG,GAASA,GAAM,MAAM,MAAQgG,CAAS,CACjE,CAEA,IAAI,SAAmB,CACrB,MAAO,CAAC,KAAK,QACf,CAEA,IAAI,QAA2B,CAE7B,GADA,KAAK,OAAA,EACD,CAAC,KAAK,SAAU,OAAOzH,GAG3B,MAAMkI,EAAqB,CAAA,EAC3B,OAAI,KAAK,QAAQA,EAAU,KAAK,KAAK,MAAM,EAE7B,KAAK,OACb,QAASzG,GAAS,CACtB,MAAMX,EAAMW,EAAK,KACbX,EAAI,MAAQ2G,GACM3G,EACR,OAAO,QAAS4C,GAAQ,CAC9BA,GAAO,CAACwE,EAAU,SAASxE,CAAG,GAAGwE,EAAU,KAAKxE,CAAG,CACzD,CAAC,CAEL,CAAC,EAEM,OAAO,OAAOwE,CAAS,CAChC,CAEA,IAAI,WAA0B,CAC5B,YAAK,OAAA,EACE,KAAK,MACd,CAEA,IAAI,WAAqB,CACvB,YAAK,OAAA,GACG,KAAK,MAAQZ,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,MAAMQ,EAAQ,KAAK,OACfA,IAAUvB,IACZuB,EAAM,QAAS1G,GAASA,EAAM,SAAS,EACvCoF,EAAe,QAAQsB,CAAK,EAC5B,KAAK,OAASvB,GAGhB,KAAK,aAAa,OAAS,EAC3B,KAAK,MAAQe,EAAWN,EAAQD,EAGhC,KAAK,OAAS,KACd,KAAK,OAAS,MAChB,CAEA,EAnLUD,GAAA9B,EAEAM,GAAAL,EAiLT,OAAO,WAAiB,CACvB,KAAK,QAAA,CACP,CAEA,cAAcxE,EAAuB,CAEnC,GAAIA,EAAI,iBAAmB,KAAK,YAIhC,IAHAA,EAAI,eAAiB,KAAK,YAGtB,KAAK,YAAc,KAAK,YAAY,OAAQ,CAC9C,MAAMW,EAAO,KAAK,YAAY,KAAK,WAAW,EAC9CA,EAAK,KAAOX,EACZW,EAAK,QAAUX,EAAI,OACrB,MACE,KAAK,YAAY,KAAK,IAAIsB,EAAetB,EAAKA,EAAI,OAAO,CAAC,EAE5D,KAAK,cACP,CAEQ,YAAmB,CACzB,GAAI,KAAK,MAAQ4G,EAAa,OAC9B,KAAK,OAASA,EAEd,MAAM5F,EAAY,KAAK,OACvB,KAAK,YAAc8B,EAAA,EACnB,KAAK,YAAciD,EAAe,QAAA,EAClC,KAAK,YAAc,EAEnB,IAAIuB,EAAY,GAChB,GAAI,CAEF,MAAMC,EAAS7C,EAAgB,IAAI,KAAM,KAAK,GAAG,EAGjD,KAAK,YAAY,OAAS,KAAK,YAC/B5D,EAAiB,KAAK,YAAaE,EAAW,IAAI,EAClD,KAAK,OAAS,KAAK,YACnBsG,EAAY,GAGRnB,GAAUoB,CAAM,EAClB,KAAK,wBAAwBA,CAAM,EAEnC,KAAK,oBAAoBA,CAAM,CAEnC,OAASnD,EAAG,CAEV,GAAI,CAACkD,EACH,GAAI,CACF,KAAK,YAAY,OAAS,KAAK,YAC/BxG,EAAiB,KAAK,YAAaE,EAAW,IAAI,EAClD,KAAK,OAAS,KAAK,YACnBsG,EAAY,EACd,MAAoB,CAIpB,CAEF,KAAK,aAAalD,EAAY5C,EAAe,4BAA6B,EAAI,CAChF,QAAA,CAEM8F,GAAatG,IAAc8E,EAC7BC,EAAe,QAAQ/E,CAAS,EACtBsG,GACVvB,EAAe,QAAQ,KAAK,WAAW,EAIzC,KAAK,YAAc,GACnB,KAAK,YAAcD,EACnB,KAAK,YAAc,EACnB,KAAK,OAAS,CAACc,CACjB,CACF,CAEQ,wBAAwBY,EAA2B,CAEzD,KAAK,OAAS,KAAK,MAAQhB,GAAW,KAEtC,KAAK,mBAAmB,OAAW,MAAS,EAE5C,KAAK,4BAA8B,KAAK,wBAAA,EACxC,KAAK,iBAAmB,EAExB,KAAK,YAAc,KAAK,WAAa,GAAKzH,EAAgB,eAC1D,MAAM0I,EAAY,KAAK,WAEvBD,EAAQ,KACLE,GAAQ,CACP,GAAID,IAAc,KAAK,WAEvB,IAAI,KAAK,4BAA8B,KAAK,4BAA6B,CAGvE,MAAM9D,EAAQP,EAAA,EAKd,OAJI,KAAK,kBAAoBO,IAC3B,KAAK,gBAAkBA,EACvB,KAAK,iBAAmB,GAEtB,KAAK,mBAAqB,KAAK,iBAC1B,KAAK,WAAA,EAEP,KAAK,aACV,IAAIpE,EACF,wCAAwC,KAAK,gBAAgB,WAAA,EAE/DiC,EAAe,iCAAA,CAEnB,CAEA,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,EAAO,EACX,MAAMN,EAAQ,KAAK,OACnB,QAASlD,EAAI,EAAGyD,EAAMP,EAAM,OAAQlD,EAAIyD,EAAKzD,IAC3CwD,GAASA,GAAQ,GAAKA,EAAON,EAAMlD,CAAC,EAAG,KAAK,QAAW,EAEzD,OAAOwD,CACT,CAEQ,aAAa/E,EAAc7C,EAAa8H,EAAW,GAAa,CACtE,MAAMjG,EAAQD,EAAUiB,EAAKrD,EAAeQ,CAAG,EAU/C,GARI,CAAC8H,GAAY,EAAE,KAAK,MAAQnB,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,OAASwC,EAAG,CACV,QAAQ,MAAM5C,EAAe,gCAAiC4C,CAAC,CACjE,CAGF,GAAIyD,EAAU,MAAMjG,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,SAASuB,GACdpH,EACAyE,EAA8B,GACb,CACjB,OAAO,IAAI6B,GAAiBtG,EAAIyE,CAAO,CACzC,CCnaA,IAAAN,GA6BA,MAAMkD,WAAmB7F,CAAwD,CAgC/E,YAAYxB,EAAoByE,EAAyB,GAAI,CAC3D,MAAA,EA/BF,KAAUN,EAAA,EAAgB,GAE1B,KAAQ,SAAgC,KACxC,KAAQ,OAA2BiB,EACnC,KAAQ,WAAsC,KAC9C,KAAQ,WAA+BA,EAWvC,KAAQ,cAAgB,GACxB,KAAQ,gBAAkB,GAC1B,KAAQ,mBAAqB,EAO7B,KAAQ,gBAAkB,EAC1B,KAAQ,aAAe,EACvB,KAAQ,aAAe,EACvB,KAAQ,QAAU,EAIhB,KAAK,IAAMpF,EACX,KAAK,SAAWyE,EAAQ,SAAW,KACnC,KAAK,MAAQA,EAAQ,MAAQ,GAC7B,KAAK,eACHA,EAAQ,wBAA0BtG,EAAiB,0BACrD,KAAK,uBACHsG,EAAQ,uBAAyBtG,EAAiB,0BAEhD,KAAK,OACP,KAAK,aAAe,OACpB,KAAK,gBAAkB,IAAM,KAAK,QAAA,IAElC,KAAK,aAAe,IAAM,KAAK,QAAA,EAC/B,KAAK,gBAAkB,IAAMyF,EAAU,SAAS,KAAK,YAAa,GAGpEzE,EAAM,gBAAgB,KAAM,SAAU,KAAK,EAAE,CAC/C,CAEO,KAAY,CACjB,GAAI,KAAK,MAAQpB,EAAmB,SAClC,MAAM,IAAIe,EAAYgC,EAAe,eAAe,EAEtD,KAAK,QAAQ,EAAI,CACnB,CAEO,SAAgB,CACjB,KAAK,MAAQ/C,EAAmB,WACpC,KAAK,OAASA,EAAmB,SAEjC,KAAK,aAAA,EACL,KAAK,YAAY,KAAK,MAAM,EACxB,KAAK,SAAWqH,GAClBC,EAAe,QAAQ,KAAK,MAAM,EAIpC,KAAK,OAASD,EACd,KAAK,WAAaA,EACpB,CAEA,EAzEUjB,GAAAJ,EAyET,OAAO,QAAA,GAAiB,CACvB,KAAK,QAAA,CACP,CAEO,cAAczE,EAAuB,CAE1C,GAAI,EAAE,KAAK,MAAQvB,EAAmB,WAAY,OAElD,MAAMuJ,EAAa,KAAK,cAGxB,GAAIhI,EAAI,iBAAmBgI,EAAY,OACvChI,EAAI,eAAiBgI,EAErB,MAAMjH,EAAY,KAAK,WAGjB4D,EAAO,KAAK,WACZsD,EAAgBtD,EAAK,UAAWhE,GAASA,GAAQA,EAAK,OAASX,GAAOW,EAAK,KAAK,EAEtF,GAAIsH,IAAkB,GAAI,CACxB,MAAMtH,EAAOgE,EAAKsD,CAAa,EAE/BtH,EAAK,QAAUX,EAAI,QACnBe,EAAU,KAAKJ,CAAI,EACnBgE,EAAKsD,CAAa,EAAI,KACtB,MACF,CAEA,GAAI,CACF,MAAMC,EAAclI,EAAI,UAAU,KAAK,eAAe,EACtDe,EAAU,KAAK,IAAIO,EAAetB,EAAKA,EAAI,QAASkI,CAAW,CAAC,CAClE,OAAStG,EAAO,CACd,MAAMuG,EAAUxG,EAAUC,EAAOpC,EAAagC,EAAe,uBAAuB,EAEpF,GADA,QAAQ,MAAM2G,CAAO,EACjB,KAAK,SACP,GAAI,CACF,KAAK,SAASA,CAAO,CACvB,MAAQ,CAAC,CAGXpH,EAAU,KAAK,IAAIO,EAAetB,EAAKA,EAAI,QAAS,MAAS,CAAC,CAChE,CACF,CAKO,QAAQoI,EAAQ,GAAa,CAIlC,GAHI,KAAK,OAAS3J,EAAmB,SAAWA,EAAmB,YAG/D,CAAC2J,GAAS,KAAK,OAAO,OAAS,GAAK,CAAC,KAAK,WAAY,OAE1D,KAAK,oBAAA,EAEL,KAAK,OAAS3J,EAAmB,UACjC,KAAK,aAAA,EAGL,KAAK,WAAa,KAAK,OAGvB,MAAMsC,EAAYgF,EAAe,QAAA,EACjC,KAAK,WAAahF,EAClB,KAAK,cAAgB+B,EAAA,EAErB,IAAIwE,EAAY,GAChB,GAAI,CACF,MAAMC,EAAS7C,EAAgB,IAAI,KAAM,KAAK,GAAG,EACjD,KAAK,OAAS3D,EACduG,EAAY,GAGRnB,GAAUoB,CAAM,EAClB,KAAK,mBAAmBA,CAAM,EAE9B,KAAK,SAAW,OAAOA,GAAW,WAAaA,EAAS,IAE5D,OAAS3F,EAAO,CAGd,KAAK,OAASb,EACduG,EAAY,GACZ,KAAK,sBAAsB1F,CAAK,EAChC,KAAK,SAAW,IAClB,QAAA,CACE,KAAK,sBAAsB0F,EAAW,KAAK,WAAYvG,CAAS,EAChE,KAAK,OAAS,EAChB,CACF,CAEQ,mBAAmByG,EAAiC,CAC1D,MAAMa,EAAS,EAAE,KAAK,QACtBb,EAAQ,KACLc,GAAY,CAEX,GAAID,IAAW,KAAK,SAAW,KAAK,MAAQ5J,EAAmB,SAAU,CACvE,GAAI,OAAO6J,GAAY,WACrB,GAAI,CACFA,EAAA,CACF,OAASlE,EAAG,CACV,KAAK,sBAAsBA,EAAG5C,EAAe,qBAAqB,CACpE,CAEF,MACF,CACI,OAAO8G,GAAY,aAAY,KAAK,SAAWA,EACrD,EACC1F,GAAQyF,IAAW,KAAK,SAAW,KAAK,sBAAsBzF,CAAG,CAAA,CAEtE,CAEQ,sBACN0E,EACAtG,EACAD,EACM,CACN,KAAK,WAAa,KAClB,KAAK,WAAa+E,EAEdwB,GAEFtG,EAAU,QAASL,GAASA,GAAM,SAAS,EAEvCK,IAAc8E,GAChBC,EAAe,QAAQ/E,CAAS,IAIlC,KAAK,YAAYD,CAAS,EAC1BgF,EAAe,QAAQhF,CAAS,EAEpC,CAEQ,YAAYsG,EAA+B,CACjDA,EAAM,QAAS1G,GAASA,GAAM,SAAS,CACzC,CAEQ,UAAoB,CAC1B,MAAM0G,EAAQ,KAAK,OAEbkB,EAAc7D,EAAgB,QACpCA,EAAgB,QAAU,KAE1B,GAAI,CACF,OAAO2C,EAAM,KAAM1G,GAAS,CAC1B,MAAMX,EAAMW,EAAK,KAGjB,GAAIX,EAAI,MAAQtB,EAAqB,YACnC,GAAI,CAEIsB,EAA2B,KACnC,MAAQ,CAIN,MAAO,EACT,CAIF,OAAOA,EAAI,UAAYW,EAAK,OAC9B,CAAC,CACH,QAAA,CACE+D,EAAgB,QAAU6D,CAC5B,CACF,CAEQ,cAAqB,CAC3B,GAAK,KAAK,SACV,IAAI,CACF,KAAK,SAAA,CACP,OAAS3G,EAAO,CACd,KAAK,sBAAsBA,EAAOJ,EAAe,qBAAqB,CACxE,CACA,KAAK,SAAW,KAClB,CAEQ,qBAA4B,CAClC,MAAMmC,EAAQP,EAAA,EACV,KAAK,kBAAoBO,IAC3B,KAAK,gBAAkBA,EACvB,KAAK,mBAAqB,GAGxB,EAAE,KAAK,mBAAqB,KAAK,wBACnC,KAAK,wBAAwB,YAAY,EACvCJ,GAAA,EAAiC1E,EAAiB,0BACpD,KAAK,wBAAwB,QAAQ,EAEvC,KAAK,iBAeP,CAEA,IAAI,YAAsB,CACxB,OAAQ,KAAK,MAAQJ,EAAmB,YAAc,CACxD,CACA,IAAI,gBAAyB,CAC3B,OAAO,KAAK,eACd,CACA,IAAI,aAAuB,CACzB,OAAQ,KAAK,MAAQA,EAAmB,aAAe,CACzD,CAEQ,wBAAwB0B,EAAsC,CACpE,MAAMyB,EAAQ,IAAIpC,EAChB,2BAA2BW,CAAI,sBAAsB,KAAK,kBAAkB,uDAAuD8C,CAAmB,EAAA,EAExJ,WAAK,QAAA,EACL,QAAQ,MAAMrB,CAAK,EACbA,CACR,CAEQ,sBACNA,EACAxC,EAAkBoC,EAAe,wBAC3B,CACN,MAAMgH,EAAW7G,EAAUC,EAAOpC,EAAaJ,CAAO,EAEtD,GADA,QAAQ,MAAMoJ,CAAQ,EAClB,KAAK,SACP,GAAI,CACF,KAAK,SAASA,CAAQ,CACxB,OAASpE,EAAG,CACV,QAAQ,MAAMzC,EAAUyC,EAAG5E,EAAagC,EAAe,+BAA+B,CAAC,CACzF,CAEJ,CACF,CASO,SAASiH,GAAO/H,EAAoByE,EAAyB,GAAkB,CACpF,GAAI,OAAOzE,GAAO,WAChB,MAAM,IAAIlB,EAAYgC,EAAe,uBAAuB,EAG9D,MAAMkH,EAAiB,IAAIX,GAAWrH,EAAIyE,CAAO,EACjD,OAAAuD,EAAe,QAAA,EAERA,CACT,CCpWO,SAASC,GAASjI,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/core/dep-tracking.ts","../src/errors/errors.ts","../src/errors/messages.ts","../src/utils/debug.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 * 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 * Epoch sentinel values.\n */\nexport const EPOCH_CONSTANTS = {\n  /** Uninitialized epoch marker. Used as initial value before any flush has occurred. */\n  UNINITIALIZED: -1,\n  /** Minimum valid epoch value after a counter reset. */\n  MIN: 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","import type { Dependency, Subscriber } from '@/types';\n// trackDependency removed as it was obsolete and caused polymorphic cache misses\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; i < prevLinks.length; 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; i < nextLinks.length; i++) {\n    const nextLink = nextLinks[i];\n    if (!nextLink) continue;\n\n    const node = nextLink.node;\n    const existingUnsub = parked.get(node);\n\n    if (existingUnsub !== undefined) {\n      // Re-link: reclaim subscription from previous set\n      nextLink.unsub = existingUnsub;\n      parked.delete(node);\n    } else if (!nextLink.unsub) {\n      // New link: subscribe afresh\n      // Protect against double-subscription if unsub is somehow already set\n      nextLink.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  notify(newValue?: T, oldValue?: T): void {\n    if (this.fn) this.fn(newValue, oldValue);\n    else if (this.sub) this.sub.execute();\n  }\n}\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","/**\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  BATCH_CALLBACK_MUST_BE_FUNCTION: 'Batch callback must be a function',\n} as const;\n","import { DEBUG_CONFIG, IS_DEV } from '@/constants';\nimport type { DebugConfig, 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 * 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  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 { 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 { EPOCH_CONSTANTS, 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 = EPOCH_CONSTANTS.UNINITIALIZED;\n  /** Scheduler epoch tag */\n  _nextEpoch?: number;\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> | null)[];\n  private _notifying = 0;\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    const len = subs.length;\n    let duplicate = false;\n\n    for (let i = 0; i < len; i++) {\n      const sub = subs[i];\n      if (sub != null) {\n        if (isFn ? sub.fn === listener : sub.sub === listener) {\n          duplicate = true;\n          break;\n        }\n      }\n    }\n\n    if (duplicate) {\n      if (IS_DEV) console.warn('Duplicate subscription ignored.');\n      return () => {};\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    let idx = -1;\n    for (let i = 0; i < subs.length; i++) {\n      if (subs[i] === link) {\n        idx = i;\n        break;\n      }\n    }\n\n    if (idx === -1) return;\n\n    if (this._notifying > 0) {\n      // Tombstone\n      subs[idx] = null;\n      return;\n    }\n\n    // Remove subscriber (pop-and-swap)\n    const last = subs.pop();\n    if (idx < subs.length && last !== undefined) {\n      subs[idx] = last;\n    }\n  }\n\n  subscriberCount(): number {\n    let count = 0;\n    const subs = this._subscribers;\n    for (let i = 0; i < subs.length; i++) {\n      if (subs[i] != null) count++;\n    }\n    return count;\n  }\n\n  protected _notifySubscribers(newValue: T | undefined, oldValue: T | undefined): void {\n    const subs = this._subscribers;\n    const len = subs.length;\n    if (len === 0) return;\n\n    this._notifying++;\n    try {\n      for (let i = 0; i < len; i++) {\n        const s = subs[i];\n        if (s != null) {\n          try {\n            s.notify(newValue, oldValue);\n          } catch (err) {\n            this._handleNotifyError(err);\n          }\n        }\n      }\n    } finally {\n      this._notifying--;\n      if (this._notifying === 0) {\n        this._cleanupTombstones();\n      }\n    }\n  }\n\n  private _cleanupTombstones(): void {\n    const subs = this._subscribers;\n    let i = 0;\n    while (i < subs.length) {\n      if (subs[i] === null) {\n        const last = subs.pop();\n        if (i < subs.length && last !== undefined) {\n          subs[i] = last;\n        }\n      } else {\n        i++;\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 SchedulerJobObject {\n  execute(): void;\n  /** Next scheduled epoch */\n  _nextEpoch?: number;\n}\n\nexport interface SchedulerJobFunction {\n  (): void;\n  /** Next scheduled epoch */\n  _nextEpoch?: number;\n}\n\nexport type SchedulerJob = SchedulerJobFunction | SchedulerJobObject;\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) {\n      const isFn = typeof callback === 'function';\n      const isObj =\n        typeof callback === 'object' &&\n        callback !== null &&\n        typeof (callback as SchedulerJobObject).execute === 'function';\n      if (!isFn && !isObj) {\n        throw new SchedulerError(ERROR_MESSAGES.SCHEDULER_CALLBACK_MUST_BE_FUNCTION);\n      }\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    bQueue.slice(0, this._batchQueueSize).forEach((job) => {\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    // Execute jobs\n    for (let i = 0; i < count; i++) {\n      try {\n        const job = jobs[i]!;\n        if (typeof job === 'function') job();\n        else job.execute();\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\n/**\n * Positive writable brand — only stamped on truly mutable atoms.\n * Allows future ReadonlyAtom / derived primitives to carry ATOM_BRAND\n * without being misidentified as writable by isWritable().\n */\nexport const WRITABLE_BRAND: unique symbol = Symbol.for('atom-effect/writable');\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 } from '@/core/dep-tracking';\nimport { nextVersion } from '@/internal/epoch';\nimport { scheduler } from '@/internal/scheduler';\nimport { ATOM_BRAND, WRITABLE_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  protected _subscribers: (Subscription<T> | null)[] = [];\n\n  /** @internal */\n  readonly [ATOM_BRAND] = true;\n  /** @internal */\n  readonly [WRITABLE_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    trackingContext.current?.addDependency(this);\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);\n  }\n\n  /**\n   * Executes scheduled notification.\n   * @internal\n   */\n  execute(): void {\n    this._flushNotifications();\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  [Symbol.dispose](): void {\n    this.dispose();\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, WRITABLE_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 *\n * Uses a dedicated positive brand instead of `!isComputed()` to remain\n * correct if new ReadonlyAtom-style primitives are added in the future.\n */\nexport function isWritable(obj: unknown): obj is WritableAtom {\n  return obj !== null && typeof obj === 'object' && WRITABLE_BRAND in 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  EPOCH_CONSTANTS,\n  IS_DEV,\n  SMI_MAX,\n} from '@/constants';\nimport { ReactiveDependency } from '@/core/base';\nimport { DependencyLink, type Subscription, syncDependencies } from '@/core/dep-tracking';\nimport { ComputedError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport { currentFlushEpoch, 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> | null)[] = [];\n  private _links: DependencyLink[] = EMPTY_LINKS;\n\n  // Async state\n  private _asyncStartAggregateVersion = 0;\n  private _asyncRetryCount = 0;\n  private _lastDriftEpoch: number = EPOCH_CONSTANTS.UNINITIALIZED;\n\n  // Dependency collection state\n  private _trackEpoch: number = EPOCH_CONSTANTS.UNINITIALIZED;\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 ?? COMPUTED_CONFIG.MAX_ASYNC_RETRIES) & SMI_MAX;\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    trackingContext.current?.addDependency(this);\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    return this._links.some((link) => link?.node?.flags & HAS_ERROR);\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    links.forEach((link) => {\n      const dep = link.node;\n      if (dep.flags & HAS_ERROR) {\n        const computedDep = dep as unknown as ComputedAtom<unknown>;\n        computedDep.errors.forEach((err) => {\n          if (err && !collected.includes(err)) collected.push(err);\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      links.forEach((link) => link!.unsub?.());\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  [Symbol.dispose](): void {\n    this.dispose();\n  }\n\n  addDependency(dep: Dependency): void {\n    // Deduplicate dependencies\n    if (dep._lastSeenEpoch === this._trackEpoch) return;\n    dep._lastSeenEpoch = this._trackEpoch;\n\n    // Fast path: fully stable dependencies\n    if (\n      this._trackLinks === this._links &&\n      this._trackCount < this._links.length &&\n      this._links[this._trackCount]!.node === dep\n    ) {\n      this._links[this._trackCount]!.version = dep.version;\n      this._trackCount++;\n      return;\n    }\n\n    // Diverged! Fork the array for the remaining tracking\n    if (this._trackLinks === this._links) {\n      const newLinks = linksArrayPool.acquire();\n      for (let i = 0; i < this._trackCount; i++) {\n        newLinks[i] = this._links[i]!;\n      }\n      this._trackLinks = newLinks;\n    }\n\n    // Add the new dependency\n    if (this._trackCount < this._trackLinks.length) {\n      this._trackLinks[this._trackCount] = new DependencyLink(dep, 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 = prevLinks; // Optimistic reuse\n    this._trackCount = 0;\n\n    let committed = false;\n    try {\n      // Execute function\n      const result = trackingContext.run(this, this._fn);\n\n      // Stable path optimizations\n      if (this._trackLinks === prevLinks) {\n        if (this._trackCount === prevLinks.length) {\n          // Fully stable: do nothing\n          committed = true;\n        } else {\n          // Prefix stable but shorter: unsubscribe the remaining tail\n          for (let i = this._trackCount; i < prevLinks.length; i++) {\n            prevLinks[i]!.unsub?.();\n          }\n          prevLinks.length = this._trackCount;\n          committed = true;\n        }\n      } else {\n        // Diverged path: run syncDependencies with Map fallback for the new array\n        this._trackLinks.length = this._trackCount;\n        syncDependencies(this._trackLinks, prevLinks, this);\n        this._links = this._trackLinks;\n        committed = true;\n      }\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 gracefully\n      if (!committed) {\n        try {\n          if (this._trackLinks === prevLinks) {\n            for (let i = this._trackCount; i < prevLinks.length; i++) {\n              prevLinks[i]!.unsub?.();\n            }\n            prevLinks.length = this._trackCount;\n            committed = true;\n          } else {\n            this._trackLinks.length = this._trackCount;\n            syncDependencies(this._trackLinks, prevLinks, this);\n            this._links = this._trackLinks;\n            committed = true;\n          }\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      // Pool Release\n      if (committed) {\n        if (this._links !== prevLinks && prevLinks !== EMPTY_LINKS) {\n          linksArrayPool.release(prevLinks);\n        }\n      } else if (this._trackLinks !== prevLinks && this._trackLinks !== EMPTY_LINKS) {\n        linksArrayPool.release(this._trackLinks);\n      }\n\n      // Reset transient state\n      this._trackEpoch = EPOCH_CONSTANTS.UNINITIALIZED;\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        if (this._captureVersionSnapshot() !== this._asyncStartAggregateVersion) {\n          // Reset retry counter when flush epoch changes — drifts across different\n          // scheduler flushes are independent bursts, not a continuous failure streak.\n          const epoch = currentFlushEpoch();\n          if (this._lastDriftEpoch !== epoch) {\n            this._lastDriftEpoch = epoch;\n            this._asyncRetryCount = 0;\n          }\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  EPOCH_CONSTANTS,\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 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: number = EPOCH_CONSTANTS.UNINITIALIZED;\n  private _lastFlushEpoch: number = EPOCH_CONSTANTS.UNINITIALIZED;\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  // Frequency tracking (Dev)\n  private _executionCount = 0;\n  private _windowStart = 0;\n  private _windowCount = 0;\n  private _execId = 0;\n  private _trackCount = 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    // Pre-allocate callbacks once — eliminates per-dependency closure allocation\n    if (this._sync) {\n      this._notifyCallback = () => this.execute();\n    } else {\n      this._notifyCallback = () => scheduler.schedule(this);\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  [Symbol.dispose](): void {\n    this.dispose();\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 prevLinks = this._prevLinks;\n\n    // Fast path: fully stable dependencies\n    if (\n      this._nextLinks === prevLinks &&\n      this._trackCount < prevLinks.length &&\n      prevLinks[this._trackCount]!.node === dep\n    ) {\n      prevLinks[this._trackCount]!.version = dep.version;\n      this._trackCount++;\n      return;\n    }\n\n    // Diverged! Fork the array for the remaining tracking\n    if (this._nextLinks === prevLinks) {\n      const newLinks = linksArrayPool.acquire();\n      for (let i = 0; i < this._trackCount; i++) {\n        newLinks[i] = prevLinks[i]!;\n      }\n      this._nextLinks = newLinks;\n    }\n\n    const nextLinks = this._nextLinks!;\n\n    // Reclaim existing subscription from previous links\n    // Since effect manages unsub manually, use a strict Map lookup if many prevLinks remain\n    // to avoid Megamorphic linear-scan O(N^2) cliffs.\n    let existingIndex = -1;\n    // We only need to search from `this._trackCount` onwards because\n    // earlier items are already verified or copied as the stable prefix!\n    for (let i = this._trackCount; i < prevLinks.length; i++) {\n      const link = prevLinks[i];\n      if (link && link.node === dep && link.unsub) {\n        existingIndex = i;\n        break;\n      }\n    }\n\n    if (existingIndex !== -1) {\n      const link = prevLinks[existingIndex]!;\n      // Reuse DependencyLink object — update version, move to nextLinks\n      link.version = dep.version;\n      nextLinks[this._trackCount] = link;\n      prevLinks[existingIndex] = null!; // Mark as reclaimed\n    } else {\n      try {\n        const unsubscribe = dep.subscribe(this._notifyCallback);\n        nextLinks[this._trackCount] = 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[this._trackCount] = new DependencyLink(dep, dep.version, undefined);\n      }\n    }\n    this._trackCount++;\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 properties for optimistic array reuse\n    this._nextLinks = this._links;\n    this._currentEpoch = nextEpoch();\n    this._trackCount = 0;\n\n    let committed = false;\n    try {\n      const result = trackingContext.run(this, this._fn);\n\n      // Stable path optimizations\n      if (this._nextLinks === this._prevLinks) {\n        if (this._trackCount === this._prevLinks.length) {\n          // Fully stable\n          committed = true;\n        } else {\n          // Prefix stable but shorter: unsubscribe the remaining tail\n          for (let i = this._trackCount; i < this._prevLinks.length; i++) {\n            this._prevLinks[i]?.unsub?.();\n          }\n          this._prevLinks.length = this._trackCount;\n          committed = true;\n        }\n      } else {\n        // Diverged path\n        this._nextLinks.length = this._trackCount;\n        committed = true;\n      }\n\n      this._links = this._nextLinks;\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 gracefully to maintain state for recovery\n      if (!committed) {\n        if (this._nextLinks === this._prevLinks) {\n          for (let i = this._trackCount; i < this._prevLinks.length; i++) {\n            this._prevLinks[i]?.unsub?.();\n          }\n          this._prevLinks.length = this._trackCount;\n          committed = true;\n        } else {\n          this._nextLinks.length = this._trackCount;\n          committed = true;\n        }\n      }\n      this._links = this._nextLinks;\n      this._handleExecutionError(error);\n      this._cleanup = null;\n    } finally {\n      this._finalizeDependencies(committed, this._prevLinks, this._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[] | null\n  ): void {\n    this._nextLinks = null;\n    this._prevLinks = EMPTY_LINKS;\n\n    if (committed) {\n      if (nextLinks !== prevLinks && prevLinks !== EMPTY_LINKS) {\n        prevLinks.forEach((link) => link?.unsub?.());\n        linksArrayPool.release(prevLinks);\n      }\n    } else if (nextLinks !== prevLinks && nextLinks !== EMPTY_LINKS && nextLinks) {\n      this._unsubLinks(nextLinks);\n      linksArrayPool.release(nextLinks);\n    }\n  }\n\n  private _unsubLinks(links: DependencyLink[]): void {\n    links.forEach((link) => link?.unsub?.());\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      return links.some((link) => {\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        return dep.version !== link.version;\n      });\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 { ERROR_MESSAGES } from '@/errors/messages';\nimport { 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(ERROR_MESSAGES.BATCH_CALLBACK_MUST_BE_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","SCHEDULER_CONFIG","DEBUG_CONFIG","COMPUTED_CONFIG","EPOCH_CONSTANTS","SMI_MAX","IS_DEV","EMPTY_ERROR_ARRAY","syncDependencies","nextLinks","prevLinks","tracker","parked","link","nextLink","node","existingUnsub","unsub","DependencyLink","version","Subscription","fn","sub","newValue","oldValue","AtomError","message","cause","recoverable","ComputedError","EffectError","SchedulerError","ERROR_MESSAGES","max","dropped","DEBUG_NAME","DEBUG_TYPE","NO_DEFAULT_VALUE","debug","cond","msg","obj","type","id","nextId","generateId","wrapError","error","ErrorClass","context","isNativeError","originalMessage","finalMessage","ReactiveNode","ReactiveDependency","listener","isFn","subs","len","duplicate","i","idx","last","count","s","err","collectorEpoch","nextEpoch","nextVersion","v","flushExecutionCount","isFlushing","_flushEpoch","currentFlushEpoch","startFlush","endFlush","incrementFlushExecutionCount","Scheduler","callback","started","epoch","bQueue","targetBuffer","currentSize","job","iterations","jobs","e","droppedCount","scheduler","ATOM_BRAND","COMPUTED_BRAND","EFFECT_BRAND","WRITABLE_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","IDLE","DIRTY","PENDING","RESOLVED","REJECTED","HAS_ERROR","RECOMPUTING","DISPOSED","IS_COMPUTED","getAsyncState","ComputedAtomImpl","retries","def","hasDef","collected","dep","links","newLinks","committed","result","promise","promiseId","res","hash","throwErr","computed","EffectImpl","startEpoch","existingIndex","unsubscribe","wrapped","force","execId","cleanup","prevContext","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,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,EAAkB,CAE7B,cAAe,EAGjB,EAKaC,EAAU,WAKVC,EACV,OAAO,QAAY,KAAe,QAAQ,KAAO,IACf,GAKxBC,GAAsC,OAAO,OAAO,EAAE,EC9F5D,SAASC,EACdC,EACAC,EACAC,EACM,CAEN,MAAMC,MAAa,IACnB,QAAS,EAAI,EAAG,EAAIF,EAAU,OAAQ,IAAK,CACzC,MAAMG,EAAOH,EAAU,CAAC,EACpBG,GAAM,OACRD,EAAO,IAAIC,EAAK,KAAMA,EAAK,KAAK,CAEpC,CAGA,QAAS,EAAI,EAAG,EAAIJ,EAAU,OAAQ,IAAK,CACzC,MAAMK,EAAWL,EAAU,CAAC,EAC5B,GAAI,CAACK,EAAU,SAEf,MAAMC,EAAOD,EAAS,KAChBE,EAAgBJ,EAAO,IAAIG,CAAI,EAEjCC,IAAkB,QAEpBF,EAAS,MAAQE,EACjBJ,EAAO,OAAOG,CAAI,GACRD,EAAS,QAGnBA,EAAS,MAAQC,EAAK,UAAUJ,CAAO,EAE3C,CAGA,UAAWM,KAASL,EAAO,SACzBK,EAAA,CAEJ,CAKO,MAAMC,CAAe,CAG1B,YACSH,EACAI,EACPF,EAAkC,OAClC,CAHO,KAAA,KAAAF,EACA,KAAA,QAAAI,EAIP,KAAK,MAAQF,CACf,CACF,CAKO,MAAMG,EAAgB,CAI3B,YAAYC,EAAwDC,EAA6B,CAE/F,KAAK,GAAKD,EACV,KAAK,IAAMC,CACb,CAEA,OAAOC,EAAcC,EAAoB,CACnC,KAAK,GAAI,KAAK,GAAGD,EAAUC,CAAQ,EAC9B,KAAK,KAAK,KAAK,IAAI,QAAA,CAC9B,CACF,CC5EO,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,CCjCO,MAAMK,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,6DACnC,gCAAiC,mCACnC,EChCaC,UAAoB,sBAAsB,EAE1CC,UAAoB,iBAAiB,EACrCC,SAA0B,2BAA2B,EAKrDC,EAAqB,CAEhC,QAAShC,EAET,iBAAkBJ,EAAa,mBAE/B,KAAKqC,EAAMC,EAAK,CAIhB,EAEA,gBAAgBC,EAAKC,EAAMC,EAAI,CAO/B,EAEA,aAAeF,GACZA,IAAyCN,EAAU,EAEtD,aAAeM,GACZA,IAAyCL,EAAU,CACxD,EAKA,IAAIQ,GAAS,EAKN,MAAMC,GAAa,IAAoBD,KCvCvC,SAASE,EACdC,EACAC,EACAC,EACW,CAEX,GAAIF,aAAiBtB,EACnB,OAAOsB,EAGT,MAAMG,EAAgBH,aAAiB,MACjCI,EAAkBD,EAAgBH,EAAM,QAAU,OAAOA,CAAK,EAC9DpB,EAAQuB,EAAgBH,EAAQ,OAGhCK,EAAe,GADRF,EAAgBH,EAAM,YAAY,KAAO,kBAC1B,KAAKE,CAAO,MAAME,CAAe,GAE7D,OAAO,IAAIH,EAAWI,EAAczB,CAAK,CAC3C,CChBO,MAAM0B,CAAa,CAAnB,aAAA,CAEL,KAAA,MAAQ,EAER,KAAA,QAAU,EAEV,KAAA,eAAiBjD,EAAgB,cAIjC,KAAS,GAAmByC,KAAexC,CAAA,CAC7C,CAKO,MAAeiD,UAA8BD,CAAa,CAA1D,aAAA,CAAA,MAAA,GAAA,SAAA,EAEL,KAAQ,WAAa,CAAA,CAKrB,UAAUE,EAA2E,CACnF,MAAMC,EAAO,OAAOD,GAAa,WAEjC,GAAI,CAACC,IAAS,CAACD,GAAY,OAAQA,EAAwB,SAAY,YACrE,MAAMT,EACJ,IAAI,UAAU,oBAAoB,EAClCrB,EACAO,EAAe,gCAAA,EAInB,MAAMyB,EAAO,KAAK,aACZC,EAAMD,EAAK,OACjB,IAAIE,EAAY,GAEhB,QAASC,EAAI,EAAGA,EAAIF,EAAKE,IAAK,CAC5B,MAAMtC,EAAMmC,EAAKG,CAAC,EAClB,GAAItC,GAAO,OACLkC,EAAOlC,EAAI,KAAOiC,EAAWjC,EAAI,MAAQiC,GAAU,CACrDI,EAAY,GACZ,KACF,CAEJ,CAEA,GAAIA,EAEF,MAAO,IAAM,CAAC,EAGhB,MAAM9C,EAAO,IAAIO,GACfoC,EAAQD,EAAoD,OAC3DC,EAAkC,OAA1BD,CAA0B,EAGrC,OAAAE,EAAK,KAAK5C,CAAI,EAEP,IAAM,KAAK,aAAaA,CAAI,CACrC,CAEQ,aAAaA,EAA6B,CAChD,MAAM4C,EAAO,KAAK,aAClB,IAAII,EAAM,GACV,QAASD,EAAI,EAAGA,EAAIH,EAAK,OAAQG,IAC/B,GAAIH,EAAKG,CAAC,IAAM/C,EAAM,CACpBgD,EAAMD,EACN,KACF,CAGF,GAAIC,IAAQ,GAAI,OAEhB,GAAI,KAAK,WAAa,EAAG,CAEvBJ,EAAKI,CAAG,EAAI,KACZ,MACF,CAGA,MAAMC,EAAOL,EAAK,IAAA,EACdI,EAAMJ,EAAK,QAAUK,IAAS,SAChCL,EAAKI,CAAG,EAAIC,EAEhB,CAEA,iBAA0B,CACxB,IAAIC,EAAQ,EACZ,MAAMN,EAAO,KAAK,aAClB,QAASG,EAAI,EAAGA,EAAIH,EAAK,OAAQG,IAC3BH,EAAKG,CAAC,GAAK,MAAMG,IAEvB,OAAOA,CACT,CAEU,mBAAmBxC,EAAyBC,EAA+B,CACnF,MAAMiC,EAAO,KAAK,aACZC,EAAMD,EAAK,OACjB,GAAIC,IAAQ,EAEZ,MAAK,aACL,GAAI,CACF,QAASE,EAAI,EAAGA,EAAIF,EAAKE,IAAK,CAC5B,MAAMI,EAAIP,EAAKG,CAAC,EAChB,GAAII,GAAK,KACP,GAAI,CACFA,EAAE,OAAOzC,EAAUC,CAAQ,CAC7B,OAASyC,EAAK,CACZ,KAAK,mBAAmBA,CAAG,CAC7B,CAEJ,CACF,QAAA,CACE,KAAK,aACD,KAAK,aAAe,GACtB,KAAK,mBAAA,CAET,EACF,CAEQ,oBAA2B,CACjC,MAAMR,EAAO,KAAK,aAClB,IAAIG,EAAI,EACR,KAAOA,EAAIH,EAAK,QACd,GAAIA,EAAKG,CAAC,IAAM,KAAM,CACpB,MAAME,EAAOL,EAAK,IAAA,EACdG,EAAIH,EAAK,QAAUK,IAAS,SAC9BL,EAAKG,CAAC,EAAIE,EAEd,MACEF,GAGN,CAEQ,mBAAmBK,EAAoB,CAC7C,QAAQ,MAAMnB,EAAUmB,EAAKxC,EAAWO,EAAe,iCAAiC,CAAC,CAC3F,CACF,CCpJA,IAAIkC,EAAiB,EAKd,MAAMC,EAAY,KACvBD,EAAkBA,EAAiB,EAAK7D,GAAW,EAC5C6D,GAOIE,EAAeC,GAAeA,EAAI,EAAKhE,EAE7C,IAAIiE,EAAsB,EAC7BC,EAAa,GACbC,EAAc,EAGX,MAAMC,EAAoB,IAAMD,EAKhC,SAASE,GAAsB,CACpC,OAAIH,EAEK,IAGTA,EAAa,GACbC,EAAcL,EAAA,EACdG,EAAsB,EACf,GACT,CAGO,MAAMK,EAAW,IAAM,CAC5BJ,EAAa,EACf,EAKaK,GAA+B,IAAOL,EAAa,EAAED,EAAsB,ECrBxF,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,oBAA8B5E,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,SAAS6E,EAA8B,CAarC,GAAIA,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,EAAA,EAChB,KAAK,YAAA,EACDK,GAASJ,EAAA,CACf,QAAA,CACE,KAAK,cAAgB,GAEjB,KAAK,MAAQ,GAAK,CAAC,KAAK,aAC1B,KAAK,OAAA,CAET,CACF,CAEA,YAAmB,CACjB,KAAK,gBAAkB,GACvB,MAAMI,EAAUL,EAAA,EAChB,GAAI,CACF,KAAK,iBAAA,EACL,KAAK,YAAA,CACP,QAAA,CACE,KAAK,gBAAkB,GACnBK,GAASJ,EAAA,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,MAGvBF,EAAO,MAAM,EAAG,KAAK,eAAe,EAAE,QAASG,GAAQ,CAEjDA,EAAI,aAAeJ,IACrBI,EAAI,WAAaJ,EACjBE,EAAaC,GAAa,EAAIC,EAElC,CAAC,EAED,KAAK,MAAQD,EACb,KAAK,gBAAkB,EAGnBF,EAAO,OAAShF,EAAiB,+BACnCgF,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,MAAMxB,EAAM,KAAK,aACXyB,EAAO,KAAK,aAAazB,CAAG,EAC5BE,EAAQ,KAAK,MAGnB,KAAK,aAAeF,EAAM,EAC1B,KAAK,MAAQ,EACb,KAAK,SAGL,QAAS,EAAI,EAAG,EAAIE,EAAO,IACzB,GAAI,CACF,MAAMqB,EAAME,EAAK,CAAC,EACd,OAAOF,GAAQ,WAAYA,EAAA,IACtB,QAAA,CACX,OAASG,EAAG,CACV,QAAQ,MAAM,IAAIxD,EAAe,4CAA6CwD,CAAU,CAAC,CAC3F,CAGFD,EAAK,OAAS,CAChB,CAEQ,sBAA6B,CACnC,MAAME,EAAe,KAAK,MAAQ,KAAK,gBAUvC,GATA,QAAQ,MACN,IAAIzD,EACFC,EAAe,yBAAyB,KAAK,oBAAqBwD,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,CACX,KAAK,cAAgB,GAKrB,EAAE,KAAK,cAAgB,IACzB,KAAK,WAAA,EACL,KAAK,YAAc,GAEvB,CAEA,sBAAsBvD,EAAmB,CACvC,GAAIA,EAAMhC,EAAiB,qBACzB,MAAM,IAAI8B,EACR,yCAAyC9B,EAAiB,oBAAoB,EAAA,EAElF,KAAK,oBAAsBgC,CAC7B,CACF,CAEO,MAAMwD,EAAY,IAAIZ,GC3PhBa,EAA4B,OAAO,IAAI,kBAAkB,EACzDC,GAAgC,OAAO,IAAI,sBAAsB,EACjEC,GAA8B,OAAO,IAAI,oBAAoB,EAO7DC,GAAgC,OAAO,IAAI,sBAAsB,ECRjEC,EAAkB,CAE7B,QAAS,KAST,IAAOvC,EAAoBlC,EAAgB,CACzC,MAAM0E,EAAO,KAAK,QAClB,KAAK,QAAUxC,EACf,GAAI,CACF,OAAOlC,EAAA,CACT,QAAA,CACE,KAAK,QAAU0E,CACjB,CACF,CACF,ECjBO,SAASC,GAAa3E,EAAgB,CAC3C,MAAM0E,EAAOD,EAAgB,QAG7B,GAAIC,IAAS,KAAM,OAAO1E,EAAA,EAE1ByE,EAAgB,QAAU,KAC1B,GAAI,CACF,OAAOzE,EAAA,CACT,QAAA,CACEyE,EAAgB,QAAUC,CAC5B,CACF,CCpBA,IAAAE,GAAAC,GAaA,MAAMC,WAAoB7C,CAAiD,CAWzE,YAAY8C,EAAiBC,EAAe,CAC1C,MAAA,EATF,KAAQ,iBAAkC,OAC1C,KAAU,aAA2C,CAAA,EAGrD,KAAUH,EAAA,EAAc,GAExB,KAAUD,EAAA,EAAkB,GAI1B,KAAK,OAASG,EACVC,IAAM,KAAK,OAASrG,EAAiB,MACzCsC,EAAM,gBAAgB,KAAM,OAAQ,KAAK,EAAE,CAC7C,CAEA,IAAI,OAAW,CACb,OAAAwD,EAAgB,SAAS,cAAc,IAAI,EACpC,KAAK,MACd,CAEA,IAAI,MAAMvE,EAAa,CACrB,MAAMC,EAAW,KAAK,OACtB,GAAI,OAAO,GAAGA,EAAUD,CAAQ,EAAG,OAEnC,KAAK,OAASA,EACd,KAAK,QAAU6C,EAAY,KAAK,OAAO,EAEvC,MAAMkC,EAAQ,KAAK,MACnB,GAAI,OAAK,aAAa,SAAW,GAAKA,EAAQtG,EAAiB,wBAQ/D,IAJA,KAAK,iBAAmBwB,EACxB,KAAK,MAAQ8E,EAAQtG,EAAiB,uBAGlCsG,EAAQtG,EAAiB,MAAQ,CAACyF,EAAU,WAAY,CAC1D,KAAK,oBAAA,EACL,MACF,CAGAA,EAAU,SAAS,IAAI,EACzB,CAMA,SAAgB,CACd,KAAK,oBAAA,CACP,CAKQ,qBAA4B,CAClC,MAAMa,EAAQ,KAAK,MAEnB,GAAI,EAAEA,EAAQtG,EAAiB,yBAA2BsG,EAAQtG,EAAiB,SACjF,OAGF,MAAMwB,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,MAAQxB,EAAiB,WAElC,KAAK,aAAa,OAAS,EAC3B,KAAK,OAASA,EAAiB,SAE/B,KAAK,OAAS,OACd,KAAK,iBAAmB,OAC1B,CAEA,EAhFUkG,GAAAR,EAEAO,GAAAJ,GA8ET,OAAO,WAAiB,CACvB,KAAK,QAAA,CACP,CACF,CAQO,SAASU,GAAQH,EAAiBI,EAAuB,GAAqB,CACnF,OAAO,IAAIL,GAASC,EAAcI,EAAQ,MAAQ,EAAK,CACzD,CCzGO,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,MACOC,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,GAAO5E,EAAmC,CACxD,OAAOA,IAAQ,MAAQ,OAAOA,GAAQ,UAAYiD,KAAcjD,CAClE,CAeO,SAAS6E,GAAW7E,EAAmC,CAC5D,OAAOA,IAAQ,MAAQ,OAAOA,GAAQ,UAAYkD,MAAkBlD,CACtE,CAKO,SAAS8E,GAAS9E,EAAmC,CAC1D,OAAOA,IAAQ,MAAQ,OAAOA,GAAQ,UAAYmD,MAAgBnD,CACpE,CAKO,SAAS+E,GAAaC,EAAqC,CAChE,OACEA,IAAU,MACV,OAAOA,GAAU,UACjB,OAAQA,EAA6B,MAAS,UAElD,CC7CA,IAAAxB,GAAAC,GA4BA,KAAM,CAAE,KAAAwB,EAAM,MAAAC,EAAO,QAAAC,EAAS,SAAAC,EAAU,SAAAC,EAAU,UAAAC,EAAW,YAAAC,EAAa,SAAAC,EAAU,YAAAC,EAAA,EAClFnI,EAEF,SAASoI,GAAc7B,EAA+B,CACpD,OAAIA,EAAQuB,EAAiBhI,EAAW,SACpCyG,EAAQsB,EAAgB/H,EAAW,QACnCyG,EAAQwB,EAAiBjI,EAAW,SACjCA,EAAW,IACpB,CAKA,MAAMuI,WAA4B9E,CAA6D,CA8B7F,YAAYjC,EAA0BmF,EAA8B,GAAI,CACtE,GAAI,OAAOnF,GAAO,iBAAkB,IAAIQ,EAAcG,EAAe,yBAAyB,EAC9F,MAAA,EA9BF,KAAUkE,EAAA,EAAc,GAExB,KAAUD,EAAA,EAAkB,GAG5B,KAAQ,OAAuB,KAE/B,KAAQ,WAAa,EAQrB,KAAU,aAA2C,CAAA,EACrD,KAAQ,OAA2BkB,EAGnC,KAAQ,4BAA8B,EACtC,KAAQ,iBAAmB,EAC3B,KAAQ,gBAA0B/G,EAAgB,cAGlD,KAAQ,YAAsBA,EAAgB,cAC9C,KAAQ,YAAgC+G,EACxC,KAAQ,YAAc,EAMpB,KAAK,OAAS,OAEd,KAAK,MAAQe,GAAcP,EAAQD,EACnC,KAAK,OAASlB,EAAQ,OAAS,OAAO,GACtC,KAAK,IAAMnF,EACX,KAAK,cAAgB,iBAAkBmF,EAAUA,EAAQ,aAAgBnE,EACzE,KAAK,SAAWmE,EAAQ,SAAW,KACnC,MAAM6B,EAAU7B,EAAQ,gBAMxB,GALA,KAAK,kBAAoB6B,GAAWlI,EAAgB,mBAAqBE,EAEzEiC,EAAM,gBAAgB,KAAM,WAAY,KAAK,EAAE,EAG3CkE,EAAQ,OAAS,GACnB,GAAI,CACF,KAAK,WAAA,CACP,MAAQ,CAER,CAEJ,CAEQ,QAAe,CACrBV,EAAgB,SAAS,cAAc,IAAI,CAC7C,CAEA,IAAI,OAAW,CACb,KAAK,OAAA,EAEL,MAAMQ,EAAQ,KAAK,MACnB,IAAKA,GAASuB,EAAWF,EAAQD,MAAWG,EAC1C,OAAO,KAAK,OAGd,GAAIvB,EAAQ2B,EACV,MAAM,IAAIpG,EAAcG,EAAe,iBAAiB,EAG1D,GAAIsE,EAAQ0B,EAAa,CACvB,GAAI,KAAK,gBAAmB3F,EAAwB,OAAO,KAAK,cAChE,MAAM,IAAIR,EAAcG,EAAe,4BAA4B,CACrE,CAEA,GAAIsE,GAASqB,EAAQD,KACnB,KAAK,WAAA,EAED,KAAK,MAAQG,GAAU,OAAO,KAAK,OAIzC,MAAMS,EAAM,KAAK,cACXC,EAASD,IAASjG,EAExB,GAAI,KAAK,MAAQuF,EAAS,CACxB,GAAIW,EAAQ,OAAOD,EACnB,MAAM,IAAIzG,EAAcG,EAAe,iCAAiC,CAC1E,CAEA,GAAI,KAAK,MAAQ8F,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,OADA,KAAK,OAAA,EACD,KAAK,OAASL,EAAWC,GAAmB,GAGzC,KAAK,OAAO,KAAMlH,GAASA,GAAM,MAAM,MAAQkH,CAAS,CACjE,CAEA,IAAI,SAAmB,CACrB,MAAO,CAAC,KAAK,QACf,CAEA,IAAI,QAA2B,CAE7B,GADA,KAAK,OAAA,EACD,CAAC,KAAK,SAAU,OAAOxH,GAG3B,MAAMiI,EAAqB,CAAA,EAC3B,OAAI,KAAK,QAAQA,EAAU,KAAK,KAAK,MAAM,EAE7B,KAAK,OACb,QAAS3H,GAAS,CACtB,MAAM4H,EAAM5H,EAAK,KACb4H,EAAI,MAAQV,GACMU,EACR,OAAO,QAASxE,GAAQ,CAC9BA,GAAO,CAACuE,EAAU,SAASvE,CAAG,GAAGuE,EAAU,KAAKvE,CAAG,CACzD,CAAC,CAEL,CAAC,EAEM,OAAO,OAAOuE,CAAS,CAChC,CAEA,IAAI,WAA0B,CAC5B,YAAK,OAAA,EACE,KAAK,MACd,CAEA,IAAI,WAAqB,CACvB,YAAK,OAAA,GACG,KAAK,MAAQZ,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,MAAMS,EAAQ,KAAK,OACfA,IAAUvB,IACZuB,EAAM,QAAS7H,GAASA,EAAM,SAAS,EACvCuG,EAAe,QAAQsB,CAAK,EAC5B,KAAK,OAASvB,GAGhB,KAAK,aAAa,OAAS,EAC3B,KAAK,MAAQc,EAAWN,EAAQD,EAGhC,KAAK,OAAS,KACd,KAAK,OAAS,MAChB,CAEA,EAlLUxB,GAAAR,EAEAO,GAAAN,GAgLT,OAAO,WAAiB,CACvB,KAAK,QAAA,CACP,CAEA,cAAc8C,EAAuB,CAEnC,GAAIA,EAAI,iBAAmB,KAAK,YAIhC,IAHAA,EAAI,eAAiB,KAAK,YAIxB,KAAK,cAAgB,KAAK,QAC1B,KAAK,YAAc,KAAK,OAAO,QAC/B,KAAK,OAAO,KAAK,WAAW,EAAG,OAASA,EACxC,CACA,KAAK,OAAO,KAAK,WAAW,EAAG,QAAUA,EAAI,QAC7C,KAAK,cACL,MACF,CAGA,GAAI,KAAK,cAAgB,KAAK,OAAQ,CACpC,MAAME,EAAWvB,EAAe,QAAA,EAChC,QAASxD,EAAI,EAAGA,EAAI,KAAK,YAAaA,IACpC+E,EAAS/E,CAAC,EAAI,KAAK,OAAOA,CAAC,EAE7B,KAAK,YAAc+E,CACrB,CAGI,KAAK,YAAc,KAAK,YAAY,OACtC,KAAK,YAAY,KAAK,WAAW,EAAI,IAAIzH,EAAeuH,EAAKA,EAAI,OAAO,EAExE,KAAK,YAAY,KAAK,IAAIvH,EAAeuH,EAAKA,EAAI,OAAO,CAAC,EAE5D,KAAK,cACP,CAEQ,YAAmB,CACzB,GAAI,KAAK,MAAQT,EAAa,OAC9B,KAAK,OAASA,EAEd,MAAMtH,EAAY,KAAK,OACvB,KAAK,YAAcyD,EAAA,EACnB,KAAK,YAAczD,EACnB,KAAK,YAAc,EAEnB,IAAIkI,EAAY,GAChB,GAAI,CAEF,MAAMC,EAAS/C,EAAgB,IAAI,KAAM,KAAK,GAAG,EAGjD,GAAI,KAAK,cAAgBpF,EACvB,GAAI,KAAK,cAAgBA,EAAU,OAEjCkI,EAAY,OACP,CAEL,QAAS,EAAI,KAAK,YAAa,EAAIlI,EAAU,OAAQ,IACnDA,EAAU,CAAC,EAAG,QAAA,EAEhBA,EAAU,OAAS,KAAK,YACxBkI,EAAY,EACd,MAGA,KAAK,YAAY,OAAS,KAAK,YAC/BpI,EAAiB,KAAK,YAAaE,EAAW,IAAI,EAClD,KAAK,OAAS,KAAK,YACnBkI,EAAY,GAIVpB,GAAUqB,CAAM,EAClB,KAAK,wBAAwBA,CAAM,EAEnC,KAAK,oBAAoBA,CAAM,CAEnC,OAAS,EAAG,CAEV,GAAI,CAACD,EACH,GAAI,CACF,GAAI,KAAK,cAAgBlI,EAAW,CAClC,QAAS,EAAI,KAAK,YAAa,EAAIA,EAAU,OAAQ,IACnDA,EAAU,CAAC,EAAG,QAAA,EAEhBA,EAAU,OAAS,KAAK,YACxBkI,EAAY,EACd,MACE,KAAK,YAAY,OAAS,KAAK,YAC/BpI,EAAiB,KAAK,YAAaE,EAAW,IAAI,EAClD,KAAK,OAAS,KAAK,YACnBkI,EAAY,EAEhB,MAAoB,CAIpB,CAEF,KAAK,aAAa,EAAY5G,EAAe,4BAA6B,EAAI,CAChF,QAAA,CAEM4G,EACE,KAAK,SAAWlI,GAAaA,IAAcyG,GAC7CC,EAAe,QAAQ1G,CAAS,EAEzB,KAAK,cAAgBA,GAAa,KAAK,cAAgByG,GAChEC,EAAe,QAAQ,KAAK,WAAW,EAIzC,KAAK,YAAchH,EAAgB,cACnC,KAAK,YAAc+G,EACnB,KAAK,YAAc,EACnB,KAAK,OAAS,CAACa,CACjB,CACF,CAEQ,wBAAwBc,EAA2B,CAEzD,KAAK,OAAS,KAAK,MAAQlB,GAAW,KAEtC,KAAK,mBAAmB,OAAW,MAAS,EAE5C,KAAK,4BAA8B,KAAK,wBAAA,EACxC,KAAK,iBAAmB,EAExB,KAAK,YAAc,KAAK,WAAa,GAAKzH,EAAgB,eAC1D,MAAM4I,EAAY,KAAK,WAEvBD,EAAQ,KACLE,GAAQ,CACP,GAAID,IAAc,KAAK,WAEvB,IAAI,KAAK,4BAA8B,KAAK,4BAA6B,CAGvE,MAAM/D,EAAQP,EAAA,EAKd,OAJI,KAAK,kBAAoBO,IAC3B,KAAK,gBAAkBA,EACvB,KAAK,iBAAmB,GAEtB,KAAK,mBAAqB,KAAK,iBAC1B,KAAK,WAAA,EAEP,KAAK,aACV,IAAInD,EACF,wCAAwC,KAAK,gBAAgB,WAAA,EAE/DG,EAAe,iCAAA,CAEnB,CAEA,KAAK,oBAAoBgH,CAAG,EAC5B,KAAK,mBAAmBA,EAAK,MAAS,EACxC,EACC/E,GACC8E,IAAc,KAAK,YACnB,KAAK,aAAa9E,EAAKjC,EAAe,iCAAiC,CAAA,CAE7E,CAEQ,yBAAkC,CACxC,IAAIiH,EAAO,EACX,MAAMP,EAAQ,KAAK,OACnB,QAAS9E,EAAI,EAAGF,EAAMgF,EAAM,OAAQ9E,EAAIF,EAAKE,IAC3CqF,GAASA,GAAQ,GAAKA,EAAOP,EAAM9E,CAAC,EAAG,KAAK,QAAW,EAEzD,OAAOqF,CACT,CAEQ,aAAahF,EAAczB,EAAa0G,EAAW,GAAa,CACtE,MAAMnG,EAAQD,EAAUmB,EAAKpC,EAAeW,CAAG,EAU/C,GARI,CAAC0G,GAAY,EAAE,KAAK,MAAQpB,KAC9B,KAAK,QAAU1D,EAAY,KAAK,OAAO,GAGzC,KAAK,OAASrB,EAEd,KAAK,MAAS,KAAK,MAAQ,KAAwC+E,EAAWC,EAE1E,KAAK,SACP,GAAI,CACF,KAAK,SAAShF,CAAK,CACrB,OAASwC,EAAG,CACV,QAAQ,MAAMvD,EAAe,gCAAiCuD,CAAC,CACjE,CAGF,GAAI2D,EAAU,MAAMnG,EACpB,KAAK,mBAAmB,OAAW,MAAS,CAC9C,CAEQ,oBAAoB0E,EAAgB,EAEtC,EAAE,KAAK,MAAQI,IAAa,CAAC,KAAK,OAAO,KAAK,OAAQJ,CAAK,KAC7D,KAAK,QAAUrD,EAAY,KAAK,OAAO,GAGzC,KAAK,OAASqD,EACd,KAAK,OAAS,KAEd,KAAK,OAAS,KAAK,MAAQI,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,SAASwB,GACd9H,EACAmF,EAA8B,GACb,CACjB,OAAO,IAAI4B,GAAiB/G,EAAImF,CAAO,CACzC,CCzcA,IAAAP,GA8BA,MAAMmD,WAAmB/F,CAAwD,CA8B/E,YAAYhC,EAAoBmF,EAAyB,GAAI,CAC3D,MAAA,EA7BF,KAAUP,EAAA,EAAgB,GAE1B,KAAQ,SAAgC,KACxC,KAAQ,OAA2BkB,EACnC,KAAQ,WAAsC,KAC9C,KAAQ,WAA+BA,EAQvC,KAAQ,cAAwB/G,EAAgB,cAChD,KAAQ,gBAA0BA,EAAgB,cAClD,KAAQ,mBAAqB,EAO7B,KAAQ,gBAAkB,EAC1B,KAAQ,aAAe,EACvB,KAAQ,aAAe,EACvB,KAAQ,QAAU,EAClB,KAAQ,YAAc,EAIpB,KAAK,IAAMiB,EACX,KAAK,SAAWmF,EAAQ,SAAW,KACnC,KAAK,MAAQA,EAAQ,MAAQ,GAC7B,KAAK,eACHA,EAAQ,wBAA0BvG,EAAiB,0BACrD,KAAK,uBACHuG,EAAQ,uBAAyBvG,EAAiB,0BAEhD,KAAK,MACP,KAAK,gBAAkB,IAAM,KAAK,QAAA,EAElC,KAAK,gBAAkB,IAAMwF,EAAU,SAAS,IAAI,EAGtDnD,EAAM,gBAAgB,KAAM,SAAU,KAAK,EAAE,CAC/C,CAEO,KAAY,CACjB,GAAI,KAAK,MAAQxC,EAAmB,SAClC,MAAM,IAAIgC,EAAYE,EAAe,eAAe,EAEtD,KAAK,QAAQ,EAAI,CACnB,CAEO,SAAgB,CACjB,KAAK,MAAQlC,EAAmB,WACpC,KAAK,OAASA,EAAmB,SAEjC,KAAK,aAAA,EACL,KAAK,YAAY,KAAK,MAAM,EACxB,KAAK,SAAWqH,GAClBC,EAAe,QAAQ,KAAK,MAAM,EAIpC,KAAK,OAASD,EACd,KAAK,WAAaA,EACpB,CAEA,EArEUlB,GAAAL,GAqET,OAAO,QAAA,GAAiB,CACvB,KAAK,QAAA,CACP,CAEO,cAAc6C,EAAuB,CAE1C,GAAI,EAAE,KAAK,MAAQ3I,EAAmB,WAAY,OAElD,MAAMuJ,EAAa,KAAK,cAGxB,GAAIZ,EAAI,iBAAmBY,EAAY,OACvCZ,EAAI,eAAiBY,EAErB,MAAM3I,EAAY,KAAK,WAGvB,GACE,KAAK,aAAeA,GACpB,KAAK,YAAcA,EAAU,QAC7BA,EAAU,KAAK,WAAW,EAAG,OAAS+H,EACtC,CACA/H,EAAU,KAAK,WAAW,EAAG,QAAU+H,EAAI,QAC3C,KAAK,cACL,MACF,CAGA,GAAI,KAAK,aAAe/H,EAAW,CACjC,MAAMiI,EAAWvB,EAAe,QAAA,EAChC,QAASxD,EAAI,EAAGA,EAAI,KAAK,YAAaA,IACpC+E,EAAS/E,CAAC,EAAIlD,EAAUkD,CAAC,EAE3B,KAAK,WAAa+E,CACpB,CAEA,MAAMlI,EAAY,KAAK,WAKvB,IAAI6I,EAAgB,GAGpB,QAAS1F,EAAI,KAAK,YAAaA,EAAIlD,EAAU,OAAQkD,IAAK,CACxD,MAAM/C,EAAOH,EAAUkD,CAAC,EACxB,GAAI/C,GAAQA,EAAK,OAAS4H,GAAO5H,EAAK,MAAO,CAC3CyI,EAAgB1F,EAChB,KACF,CACF,CAEA,GAAI0F,IAAkB,GAAI,CACxB,MAAMzI,EAAOH,EAAU4I,CAAa,EAEpCzI,EAAK,QAAU4H,EAAI,QACnBhI,EAAU,KAAK,WAAW,EAAII,EAC9BH,EAAU4I,CAAa,EAAI,IAC7B,KACE,IAAI,CACF,MAAMC,EAAcd,EAAI,UAAU,KAAK,eAAe,EACtDhI,EAAU,KAAK,WAAW,EAAI,IAAIS,EAAeuH,EAAKA,EAAI,QAASc,CAAW,CAChF,OAASxG,EAAO,CACd,MAAMyG,EAAU1G,EAAUC,EAAOjB,EAAaE,EAAe,uBAAuB,EAEpF,GADA,QAAQ,MAAMwH,CAAO,EACjB,KAAK,SACP,GAAI,CACF,KAAK,SAASA,CAAO,CACvB,MAAQ,CAAC,CAGX/I,EAAU,KAAK,WAAW,EAAI,IAAIS,EAAeuH,EAAKA,EAAI,QAAS,MAAS,CAC9E,CAEF,KAAK,aACP,CAKO,QAAQgB,EAAQ,GAAa,CAIlC,GAHI,KAAK,OAAS3J,EAAmB,SAAWA,EAAmB,YAG/D,CAAC2J,GAAS,KAAK,OAAO,OAAS,GAAK,CAAC,KAAK,WAAY,OAE1D,KAAK,oBAAA,EAEL,KAAK,OAAS3J,EAAmB,UACjC,KAAK,aAAA,EAGL,KAAK,WAAa,KAAK,OAGvB,KAAK,WAAa,KAAK,OACvB,KAAK,cAAgBqE,EAAA,EACrB,KAAK,YAAc,EAEnB,IAAIyE,EAAY,GAChB,GAAI,CACF,MAAMC,EAAS/C,EAAgB,IAAI,KAAM,KAAK,GAAG,EAGjD,GAAI,KAAK,aAAe,KAAK,WAC3B,GAAI,KAAK,cAAgB,KAAK,WAAW,OAEvC8C,EAAY,OACP,CAEL,QAAS,EAAI,KAAK,YAAa,EAAI,KAAK,WAAW,OAAQ,IACzD,KAAK,WAAW,CAAC,GAAG,QAAA,EAEtB,KAAK,WAAW,OAAS,KAAK,YAC9BA,EAAY,EACd,MAGA,KAAK,WAAW,OAAS,KAAK,YAC9BA,EAAY,GAGd,KAAK,OAAS,KAAK,WAGfpB,GAAUqB,CAAM,EAClB,KAAK,mBAAmBA,CAAM,EAE9B,KAAK,SAAW,OAAOA,GAAW,WAAaA,EAAS,IAE5D,OAAS9F,EAAO,CAEd,GAAI,CAAC6F,EACH,GAAI,KAAK,aAAe,KAAK,WAAY,CACvC,QAAS,EAAI,KAAK,YAAa,EAAI,KAAK,WAAW,OAAQ,IACzD,KAAK,WAAW,CAAC,GAAG,QAAA,EAEtB,KAAK,WAAW,OAAS,KAAK,YAC9BA,EAAY,EACd,MACE,KAAK,WAAW,OAAS,KAAK,YAC9BA,EAAY,GAGhB,KAAK,OAAS,KAAK,WACnB,KAAK,sBAAsB7F,CAAK,EAChC,KAAK,SAAW,IAClB,QAAA,CACE,KAAK,sBAAsB6F,EAAW,KAAK,WAAY,KAAK,UAAU,EACtE,KAAK,OAAS,EAChB,CACF,CAEQ,mBAAmBE,EAAiC,CAC1D,MAAMY,EAAS,EAAE,KAAK,QACtBZ,EAAQ,KACLa,GAAY,CAEX,GAAID,IAAW,KAAK,SAAW,KAAK,MAAQ5J,EAAmB,SAAU,CACvE,GAAI,OAAO6J,GAAY,WACrB,GAAI,CACFA,EAAA,CACF,OAASpE,EAAG,CACV,KAAK,sBAAsBA,EAAGvD,EAAe,qBAAqB,CACpE,CAEF,MACF,CACI,OAAO2H,GAAY,aAAY,KAAK,SAAWA,EACrD,EACC1F,GAAQyF,IAAW,KAAK,SAAW,KAAK,sBAAsBzF,CAAG,CAAA,CAEtE,CAEQ,sBACN2E,EACAlI,EACAD,EACM,CACN,KAAK,WAAa,KAClB,KAAK,WAAa0G,EAEdyB,EACEnI,IAAcC,GAAaA,IAAcyG,IAC3CzG,EAAU,QAASG,GAASA,GAAM,SAAS,EAC3CuG,EAAe,QAAQ1G,CAAS,GAEzBD,IAAcC,GAAaD,IAAc0G,GAAe1G,IACjE,KAAK,YAAYA,CAAS,EAC1B2G,EAAe,QAAQ3G,CAAS,EAEpC,CAEQ,YAAYiI,EAA+B,CACjDA,EAAM,QAAS7H,GAASA,GAAM,SAAS,CACzC,CAEQ,UAAoB,CAC1B,MAAM6H,EAAQ,KAAK,OAEbkB,EAAc9D,EAAgB,QACpCA,EAAgB,QAAU,KAE1B,GAAI,CACF,OAAO4C,EAAM,KAAM7H,GAAS,CAC1B,MAAM4H,EAAM5H,EAAK,KAGjB,GAAI4H,EAAI,MAAQ1I,EAAqB,YACnC,GAAI,CAEI0I,EAA2B,KACnC,MAAQ,CAIN,MAAO,EACT,CAIF,OAAOA,EAAI,UAAY5H,EAAK,OAC9B,CAAC,CACH,QAAA,CACEiF,EAAgB,QAAU8D,CAC5B,CACF,CAEQ,cAAqB,CAC3B,GAAK,KAAK,SACV,IAAI,CACF,KAAK,SAAA,CACP,OAAS7G,EAAO,CACd,KAAK,sBAAsBA,EAAOf,EAAe,qBAAqB,CACxE,CACA,KAAK,SAAW,KAClB,CAEQ,qBAA4B,CAClC,MAAMgD,EAAQP,EAAA,EACV,KAAK,kBAAoBO,IAC3B,KAAK,gBAAkBA,EACvB,KAAK,mBAAqB,GAGxB,EAAE,KAAK,mBAAqB,KAAK,wBACnC,KAAK,wBAAwB,YAAY,EACvCJ,GAAA,EAAiC3E,EAAiB,0BACpD,KAAK,wBAAwB,QAAQ,EAEvC,KAAK,iBAeP,CAEA,IAAI,YAAsB,CACxB,OAAQ,KAAK,MAAQH,EAAmB,YAAc,CACxD,CACA,IAAI,gBAAyB,CAC3B,OAAO,KAAK,eACd,CACA,IAAI,aAAuB,CACzB,OAAQ,KAAK,MAAQA,EAAmB,aAAe,CACzD,CAEQ,wBAAwB4C,EAAsC,CACpE,MAAMK,EAAQ,IAAIjB,EAChB,2BAA2BY,CAAI,sBAAsB,KAAK,kBAAkB,uDAAuD4B,CAAmB,EAAA,EAExJ,WAAK,QAAA,EACL,QAAQ,MAAMvB,CAAK,EACbA,CACR,CAEQ,sBACNA,EACArB,EAAkBM,EAAe,wBAC3B,CACN,MAAM6H,EAAW/G,EAAUC,EAAOjB,EAAaJ,CAAO,EAEtD,GADA,QAAQ,MAAMmI,CAAQ,EAClB,KAAK,SACP,GAAI,CACF,KAAK,SAASA,CAAQ,CACxB,OAAStE,EAAG,CACV,QAAQ,MAAMzC,EAAUyC,EAAGzD,EAAaE,EAAe,+BAA+B,CAAC,CACzF,CAEJ,CACF,CASO,SAAS8H,GAAOzI,EAAoBmF,EAAyB,GAAkB,CACpF,GAAI,OAAOnF,GAAO,WAChB,MAAM,IAAIS,EAAYE,EAAe,uBAAuB,EAG9D,MAAM+H,EAAiB,IAAIX,GAAW/H,EAAImF,CAAO,EACjD,OAAAuD,EAAe,QAAA,EAERA,CACT,CC1ZO,SAASC,GAAS3I,EAAgB,CAEvC,GAAI,OAAOA,GAAO,WAChB,MAAM,IAAI,UAAUW,EAAe,+BAA+B,EAGpEyD,EAAU,WAAA,EACV,GAAI,CACF,OAAOpE,EAAA,CACT,QAAA,CACEoE,EAAU,SAAA,CACZ,CACF"}