@graphrefly/graphrefly 0.27.0 → 0.29.0

package/dist/extra/operators.js

@@ -0,0 +1 @@
+import{A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z}from"../chunk-5JDE5JHE.js";import"../chunk-4VVTGLXJ.js";import"../chunk-KASHOCF5.js";import"../chunk-W4TSQ6RJ.js";import"../chunk-CK2E7BTU.js";import"../chunk-QYADASLV.js";export{E as audit,G as buffer,H as bufferCount,J as bufferTime,U as catchError,p as combine,R as combineLatest,t as concat,x as concatMap,B as debounce,S as debounceTime,A as delay,n as distinctUntilChanged,l as elementAt,w as exhaustMap,b as filter,k as find,i as first,z as flatMap,M as interval,j as last,a as map,r as merge,y as mergeMap,o as pairwise,O as pausable,u as race,d as reduce,N as repeat,P as rescue,D as sample,c as scan,f as skip,v as switchMap,e as take,h as takeUntil,g as takeWhile,m as tap,C as throttle,T as throttleTime,F as timeout,Q as valve,L as window,I as windowCount,K as windowTime,q as withLatestFrom,s as zip};

package/dist/extra/reactive.cjs

@@ -0,0 +1 @@
+"use strict";var le=Object.defineProperty;var He=Object.getOwnPropertyDescriptor;var Pe=Object.getOwnPropertyNames;var Be=Object.prototype.hasOwnProperty;var Ue=(r,e)=>{for(var n in e)le(r,n,{get:e[n],enumerable:!0})},We=(r,e,n,t)=>{if(e&&typeof e=="object"||typeof e=="function")for(let s of Pe(e))!Be.call(r,s)&&s!==n&&le(r,s,{get:()=>e[s],enumerable:!(t=He(e,s))||t.enumerable});return r};var $e=r=>We(le({},"__esModule",{value:!0}),r);var hn={};Ue(hn,{NativeIndexBackend:()=>re,NativeListBackend:()=>se,NativeLogBackend:()=>ie,NativeMapBackend:()=>oe,reactiveIndex:()=>dn,reactiveList:()=>un,reactiveLog:()=>cn,reactiveMap:()=>fn});module.exports=$e(hn);var K=0,B=!1,S=[],V=[],F=[],U=[];function xe(){return K>0||B}function Te(){return K>0}function Me(r){K>0?U.push(r):r()}function N(r){K+=1;let e=!1;try{r()}catch(n){throw e=!0,n}finally{if(K-=1,K===0)if(e){if(!B){let n=U.splice(0);for(let t of n)try{t()}catch{}S.length=0,V.length=0,F.length=0}}else je()}}function je(){let r=!B;r&&(B=!0);let e=[],n=0;try{for(;S.length>0||V.length>0||F.length>0||r&&U.length>0;){if(r&&U.length>0){let i=U.splice(0);for(let o of i)try{o()}catch(a){e.push(a)}continue}if(n+=1,n>1e3)throw S.length=0,V.length=0,F.length=0,new Error("batch drain exceeded 1000 iterations \u2014 likely a reactive cycle");let s=(S.length>0?S:V.length>0?V:F).splice(0);for(let i of s)try{i()}catch(o){e.push(o)}}}finally{r&&(B=!1)}if(e.length===1)throw e[0];if(e.length>1)throw new AggregateError(e,"batch drain: multiple callbacks threw")}function Z(r,e,n){if(e.length===0)return;if(e.length===1){let d=n(e[0][0]);if(d<3||!xe()){r(e);return}(d>=5?F:d===4?V:S).push(()=>r(e));return}let t=e.length,s=t,i=t,o=t,a=0;for(;a<t&&n(e[a][0])<3;)a++;for(s=a;a<t&&n(e[a][0])===3;)a++;for(i=a;a<t&&n(e[a][0])===4;)a++;o=a;let u=xe();if(s>0){let d=e.slice(0,s);r(d)}if(i>s){let d=e.slice(s,i);u?S.push(()=>r(d)):r(d)}if(o>i){let d=e.slice(i,o);u?V.push(()=>r(d)):r(d)}if(t>o){let d=e.slice(o,t);u?F.push(()=>r(d)):r(d)}}var W=Symbol.for("graphrefly/START"),y=Symbol.for("graphrefly/DATA"),w=Symbol.for("graphrefly/DIRTY"),O=Symbol.for("graphrefly/RESOLVED"),I=Symbol.for("graphrefly/INVALIDATE"),D=Symbol.for("graphrefly/PAUSE"),$=Symbol.for("graphrefly/RESUME"),A=Symbol.for("graphrefly/TEARDOWN"),C=Symbol.for("graphrefly/COMPLETE"),x=Symbol.for("graphrefly/ERROR"),z=Object.freeze([w]),ce=Object.freeze([O]),qe=Object.freeze([I]),fe=Object.freeze([W]),Ye=Object.freeze([C]),Je=Object.freeze([A]),he=Object.freeze([z]),ke=Object.freeze([ce]),Ne=Object.freeze([qe]),Ae=Object.freeze([Ye]),pe=Object.freeze([Je]);var Xe={name:"json",version:1,contentType:"application/json",encode(r){let e=JSON.stringify(r);return new TextEncoder().encode(e)},decode(r,e){let n=new TextDecoder().decode(r);return JSON.parse(n)}};function Ee(r){r.registerCodec(Xe)}var Ze={type:"system",id:""};function Q(r){if(r==null)return Ze;let{type:e,id:n,...t}=r;return{type:e??"system",id:n??"",...t}}function j(){return Math.trunc(performance.now()*1e6)}function Re(){return Date.now()*1e6}var ee=class{_messageTypes=new Map;_codecs=new Map;_onMessage;_onSubscribe;_defaultVersioning;_defaultHashFn;_inspectorEnabled=!(typeof process<"u"&&process.env?.NODE_ENV==="production");_globalInspector;_frozen=!1;tierOf;constructor(e){this._onMessage=e.onMessage,this._onSubscribe=e.onSubscribe,this._defaultVersioning=e.defaultVersioning,this._defaultHashFn=e.defaultHashFn,this.tierOf=n=>{let t=this._messageTypes.get(n);return t!=null?t.tier:1}}get onMessage(){return this._frozen=!0,this._onMessage}get onSubscribe(){return this._frozen=!0,this._onSubscribe}set onMessage(e){this._assertUnfrozen(),this._onMessage=e}set onSubscribe(e){this._assertUnfrozen(),this._onSubscribe=e}get defaultVersioning(){return this._defaultVersioning}set defaultVersioning(e){this._assertUnfrozen(),this._defaultVersioning=e}get defaultHashFn(){return this._defaultHashFn}set defaultHashFn(e){this._assertUnfrozen(),this._defaultHashFn=e}get inspectorEnabled(){return this._inspectorEnabled}set inspectorEnabled(e){this._inspectorEnabled=e}get globalInspector(){return this._globalInspector}set globalInspector(e){this._globalInspector=e}registerMessageType(e,n){return this._assertUnfrozen(),this._messageTypes.set(e,{tier:n.tier,wireCrossing:n.wireCrossing??n.tier>=3,metaPassthrough:n.metaPassthrough??!0}),this}messageTier(e){let n=this._messageTypes.get(e);return n!=null?n.tier:1}isWireCrossing(e){let n=this._messageTypes.get(e);return n!=null?n.wireCrossing:!0}isLocalOnly(e){return!this.isWireCrossing(e)}isMetaPassthrough(e){let n=this._messageTypes.get(e);return n!=null?n.metaPassthrough:!0}isKnownMessageType(e){return this._messageTypes.has(e)}registerCodec(e){return this._assertUnfrozen(),this._codecs.set(e.name,e),this}lookupCodec(e){return this._codecs.get(e)}_isFrozen(){return this._frozen}_assertUnfrozen(){if(this._frozen)throw new Error("GraphReFlyConfig is frozen: a node has already captured this config. Register custom types and set hooks before creating any node.")}};function Se(r){r.registerMessageType(W,{tier:0,wireCrossing:!1}),r.registerMessageType(w,{tier:1,wireCrossing:!1}),r.registerMessageType(I,{tier:1,wireCrossing:!1,metaPassthrough:!1}),r.registerMessageType(D,{tier:2,wireCrossing:!1}),r.registerMessageType($,{tier:2,wireCrossing:!1}),r.registerMessageType(y,{tier:3,wireCrossing:!0}),r.registerMessageType(O,{tier:3,wireCrossing:!0}),r.registerMessageType(C,{tier:4,wireCrossing:!0,metaPassthrough:!1}),r.registerMessageType(x,{tier:4,wireCrossing:!0,metaPassthrough:!1}),r.registerMessageType(A,{tier:5,wireCrossing:!0,metaPassthrough:!1})}var L=class extends Error{actor;action;nodeName;constructor(e,n){super(n??`GuardDenied: action "${String(e.action)}" denied for actor type "${String(e.actor.type)}"`),this.name="GuardDenied",this.actor=e.actor,this.action=e.action,this.nodeName=e.nodeName}get node(){return this.nodeName}};function _e(r){if(r===void 0)return null;if(typeof r=="number"){if(!Number.isFinite(r))throw new TypeError(`Cannot hash non-finite number: ${r}`);if(Number.isInteger(r)&&!Number.isSafeInteger(r))throw new TypeError(`Cannot hash integer outside safe range (|n| > 2^53-1): ${r}. Cross-language cid parity is not guaranteed for unsafe integers.`);return r}if(typeof r=="string"||typeof r=="boolean"||r===null)return r;if(Array.isArray(r))return r.map(_e);if(typeof r=="object"&&r!==null){let e={};for(let n of Object.keys(r).sort())e[n]=_e(r[n]);return e}return null}var Qe=new Uint32Array([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),en=new TextEncoder;function nn(r){let e=en.encode(r),n=e.length,t=n*8,s=n+9+63&-64,i=new Uint8Array(s);i.set(e),i[n]=128;let o=new DataView(i.buffer);o.setUint32(s-4,t>>>0,!1),o.setUint32(s-8,Math.floor(t/4294967296)>>>0,!1);let a=1779033703,u=3144134277,d=1013904242,c=2773480762,_=1359893119,g=2600822924,h=528734635,l=1541459225,f=new Uint32Array(64),p=(T,m)=>T>>>m|T<<32-m;for(let T=0;T<s;T+=64){for(let v=0;v<16;v++)f[v]=o.getUint32(T+v*4,!1);for(let v=16;v<64;v++){let H=f[v-15],P=f[v-2],X=p(H,7)^p(H,18)^H>>>3,ue=p(P,17)^p(P,19)^P>>>10;f[v]=f[v-16]+X+f[v-7]+ue>>>0}let m=a,R=u,M=d,ae=c,k=_,Y=g,J=h,de=l;for(let v=0;v<64;v++){let H=p(k,6)^p(k,11)^p(k,25),P=k&Y^~k&J,X=de+H+P+Qe[v]+f[v]>>>0,ue=p(m,2)^p(m,13)^p(m,22),Le=m&R^m&M^R&M,Ge=ue+Le>>>0;de=J,J=Y,Y=k,k=ae+X>>>0,ae=M,M=R,R=m,m=X+Ge>>>0}a=a+m>>>0,u=u+R>>>0,d=d+M>>>0,c=c+ae>>>0,_=_+k>>>0,g=g+Y>>>0,h=h+J>>>0,l=l+de>>>0}let b=T=>T.toString(16).padStart(8,"0");return b(a)+b(u)+b(d)+b(c)+b(_)+b(g)+b(h)+b(l)}function ge(r){let e=_e(r??null),n=JSON.stringify(e);return nn(n).slice(0,16)}function tn(){let r=globalThis.crypto;if(r?.randomUUID)return r.randomUUID();let e=()=>Math.floor(Math.random()*4294967296).toString(16).padStart(8,"0"),n=e()+e()+e()+e();return`${n.slice(0,8)}-${n.slice(8,12)}-4${n.slice(13,16)}-${(parseInt(n.slice(16,17),16)&3|8).toString(16)}${n.slice(17,20)}-${n.slice(20,32)}`}function ye(r,e,n){let t=n?.id??tn();if(r===0)return{id:t,version:0};let i=(n?.hash??ge)(e);return{id:t,version:0,cid:i,prev:null}}function Ve(r,e,n){r.version+=1,"cid"in r&&(r.prev=r.cid,r.cid=n(e))}var Oe=()=>{},Ie=100;function De(r){return{node:r,unsub:null,prevData:void 0,dirty:!1,involvedThisWave:!1,dataBatch:[],terminal:void 0}}function be(r){r.prevData=void 0,r.dirty=!1,r.involvedThisWave=!1,r.dataBatch.length=0,r.terminal=void 0}function ne(r){return r.length===0?r:typeof r[0]=="symbol"?[r]:r}var rn=(r,e,n,t)=>{n.direction==="down-in"&&r._onDepMessage(n.depIndex,e)},sn=(r,e,n,t)=>{let s=r;if(s._status==="completed"||s._status==="errored")return;let i=s._cached,o=i===void 0?[fe]:[fe,[y,i]];s._status==="dirty"&&o.push(z),Z(e,o,s._config.tierOf)},ve=new ee({onMessage:rn,onSubscribe:sn});Se(ve);Ee(ve);var te=class r{_optsName;_describeKind;meta;_hasMeta;_config;_deps;_sinks=null;_sinkCount=0;_cached;_status;_cleanup;_store={};_waveHasNewData=!1;_hasNewTerminal=!1;_hasCalledFnOnce=!1;_paused=!1;_pendingWave=!1;_isExecutingFn=!1;_pendingRerun=!1;_rerunDepth=0;_dirtyDepCount=0;_batchPendingMessages=null;_pauseLocks=null;_pauseBuffer=null;_fn;_equals;_resubscribable;_resetOnTeardown;_autoComplete;_autoError;_pausable;_partial;_guard;_extraGuards;_hashFn;_versioning;_versioningLevel;_lastMutation;_inspectorHooks;_actions;constructor(e,n,t){this._config=t.config??ve,this._config.onMessage,this._optsName=t.name,this._describeKind=t.describeKind,this._equals=t.equals??Object.is,this._resubscribable=t.resubscribable??!1,this._resetOnTeardown=t.resetOnTeardown??!1,this._autoComplete=t.completeWhenDepsComplete??!0,this._autoError=t.errorWhenDepsError??!0,this._pausable=t.pausable??!0,this._guard=t.guard,this._fn=n,this._partial=t.partial??!1,this._cached=t.initial!==void 0?t.initial:void 0,this._status=e.length===0&&n==null&&this._cached!==void 0?"settled":"sentinel",this._hashFn=t.versioningHash??this._config.defaultHashFn??ge;let s=t.versioning??this._config.defaultVersioning;this._versioningLevel=s,this._versioning=s!=null?ye(s,this._cached===void 0?void 0:this._cached,{id:t.versioningId,hash:this._hashFn}):void 0,this._deps=e.map(De);let i={};for(let[a,u]of Object.entries(t.meta??{})){let d={initial:u,name:`${t.name??"node"}:meta:${a}`,describeKind:"state",config:this._config};t.guard!=null&&(d.guard=t.guard),i[a]=new r([],void 0,d)}Object.freeze(i),this.meta=i,this._hasMeta=Object.keys(i).length>0;let o=this;this._actions={emit(a){o._emit([[y,a]])},down(a){o._emit(ne(a))},up(a){o._emitUp(ne(a))}},this.down=this.down.bind(this),this.up=this.up.bind(this)}get _isTerminal(){return this._status==="completed"||this._status==="errored"}get name(){return this._optsName}get status(){return this._status}get cache(){return this._cached===void 0?void 0:this._cached}get lastMutation(){return this._lastMutation}get v(){return this._versioning}hasGuard(){return this._guard!=null}_applyVersioning(e,n){if(this._isExecutingFn)throw new Error(`Node "${this.name}": _applyVersioning cannot run mid-fn \u2014 call it outside of \`_execFn\` (typically at graph setup time before the first subscribe).`);let t=this._versioningLevel;if(t!=null&&e<=t)return;let s=n?.hash??this._hashFn;s!==this._hashFn&&(this._hashFn=s);let i=this._cached===void 0?void 0:this._cached,o=this._versioning,a=o?.id??n?.id,u=o?.version??0,d=ye(e,i,{id:a,hash:s});d.version=u,this._versioning=d,this._versioningLevel=e}_setInspectorHook(e){return e==null?()=>{}:(this._inspectorHooks==null&&(this._inspectorHooks=new Set),this._inspectorHooks.add(e),()=>{this._inspectorHooks?.delete(e),this._inspectorHooks?.size===0&&(this._inspectorHooks=void 0)})}_pushGuard(e){return this._extraGuards==null&&(this._extraGuards=new Set),this._extraGuards.add(e),()=>{this._extraGuards?.delete(e),this._extraGuards?.size===0&&(this._extraGuards=void 0)}}allowsObserve(e){if(this._guard==null&&this._extraGuards==null)return!0;let n=Q(e);if(this._guard!=null&&!this._guard(n,"observe"))return!1;if(this._extraGuards!=null){for(let t of this._extraGuards)if(!t(n,"observe"))return!1}return!0}_checkGuard(e){if(e?.internal)return;let n=this._guard!=null||this._extraGuards!=null,t=e?.actor!=null;if(!n&&!t)return;let s=Q(e?.actor),i=e?.delivery==="signal"?"signal":"write";if(this._guard!=null&&!this._guard(s,i))throw new L({actor:s,action:i,nodeName:this.name});if(this._extraGuards!=null){for(let o of this._extraGuards)if(!o(s,i))throw new L({actor:s,action:i,nodeName:this.name})}this._lastMutation={actor:s,timestamp_ns:Re()}}down(e,n){let t=ne(e);t.length!==0&&(this._checkGuard(n),this._emit(t))}emit(e,n){this._checkGuard(n),this._emit([[y,e]])}up(e,n){if(this._deps.length===0)return;let t=ne(e);if(t.length===0)return;this._checkGuard(n);let s=n??{internal:!0};this._validateUpTiers(t);for(let i of this._deps)i.node.up?.(t,s)}_emitUp(e){if(this._deps.length!==0&&e.length!==0){this._validateUpTiers(e);for(let n of this._deps)n.node.up?.(e,{internal:!0})}}_validateUpTiers(e){let n=this._config.tierOf;for(let t of e){let s=n(t[0]);if(s===3||s===4)throw new Error(`Node "${this.name}": tier-${s} messages cannot flow up \u2014 DATA/RESOLVED/COMPLETE/ERROR are downstream-only. Use \`down(...)\` for value delivery; \`up(...)\` is for control signals (DIRTY, INVALIDATE, PAUSE, RESUME, TEARDOWN).`)}}subscribe(e,n){if(n!=null&&this._guard!=null){let u=Q(n);if(!this._guard(u,"observe"))throw new L({actor:u,action:"observe",nodeName:this.name})}let s=this._isTerminal&&this._resubscribable;if(s){this._cached=void 0,this._status="sentinel",this._store={},this._hasCalledFnOnce=!1,this._waveHasNewData=!1,this._hasNewTerminal=!1,this._paused=!1,this._pendingWave=!1,this._pendingRerun=!1,this._isExecutingFn=!1,this._rerunDepth=0,this._dirtyDepCount=0,this._pauseLocks=null,this._pauseBuffer=null;for(let u of this._deps)be(u);if(this._partial===!1){for(let u of this._deps)if(u.prevData!==void 0||u.dataBatch.length!==0||u.terminal!==void 0||u.dirty)throw new Error(`resubscribable-reset invariant: DepRecord not fully reset for node ${this._optsName??"(anonymous)"}`)}}this._sinkCount+=1;let i;try{i=this._config.onSubscribe(this,e,{sinkCount:this._sinkCount,afterTerminalReset:s},this._actions)}catch(u){throw this._sinkCount-=1,u}this._sinks==null?this._sinks=e:typeof this._sinks=="function"?this._sinks=new Set([this._sinks,e]):this._sinks.add(e);let o=this._isTerminal;if(this._sinkCount===1&&!o)try{this._activate()}catch(u){if(this._sinkCount-=1,this._removeSink(e),this._sinkCount===0&&(this._status="sentinel"),typeof i=="function")try{i()}catch{}throw u}this._status==="sentinel"&&this._cached===void 0&&(this._status="pending");let a=!1;return()=>{a||(a=!0,this._sinkCount-=1,this._removeSink(e),typeof i=="function"&&i(),this._sinks==null&&this._deactivate())}}_removeSink(e){if(this._sinks===e)this._sinks=null;else if(this._sinks!=null&&typeof this._sinks!="function")if(this._sinks.delete(e),this._sinks.size===1){let[n]=this._sinks;this._sinks=n}else this._sinks.size===0&&(this._sinks=null)}_activate(){if(this._deps.length===0){this._fn&&this._execFn();return}this._dirtyDepCount=0;let e=this._deps.length,n=0;try{for(let t=0;t<e;t++){let s=t,i=this._deps[t];i.unsub=Oe,i.unsub=i.node.subscribe(o=>{if(i.unsub===null)return;let a=this._config.tierOf,u=!1;for(let d of o)a(d[0])>=3&&(u=!0),this._config.onMessage(this,d,{direction:"down-in",depIndex:s},this._actions);u&&this._maybeRunFnOnSettlement()}),n++}}catch(t){this._deps[n].unsub=null;for(let s=0;s<n;s++){let i=this._deps[s];if(i.unsub!=null){let o=i.unsub;i.unsub=null;try{o()}catch{}be(i)}}throw this._dirtyDepCount=0,t}}_addDep(e){for(let s=0;s<this._deps.length;s++)if(this._deps[s].node===e)return s;let n=this._deps.length,t=De(e);if(this._deps.push(t),this._sinks==null)return n;t.dirty=!0,this._dirtyDepCount++,this._status!=="dirty"&&this._emit(he),t.unsub=Oe;try{t.unsub=e.subscribe(s=>{if(t.unsub===null)return;let i=this._config.tierOf,o=!1;for(let a of s)i(a[0])>=3&&(o=!0),this._config.onMessage(this,a,{direction:"down-in",depIndex:n},this._actions);o&&this._maybeRunFnOnSettlement()})}catch(s){throw t.unsub=null,this._deps.pop(),this._dirtyDepCount--,s}return n}_deactivate(e=!1){let n=this._cleanup;if(this._cleanup=void 0,typeof n=="function")try{n()}catch(t){this._emit([[x,this._wrapFnError("cleanup threw",t)]])}else if(n!=null&&typeof n=="object"){let t=n.deactivate;if(typeof t=="function")try{t()}catch(s){this._emit([[x,this._wrapFnError("cleanup.deactivate threw",s)]])}}for(let t of this._deps){if(t.unsub!=null){let s=t.unsub;t.unsub=null;try{s()}catch{}}be(t)}this._waveHasNewData=!1,this._hasNewTerminal=!1,this._hasCalledFnOnce=!1,this._paused=!1,this._pendingWave=!1,this._pendingRerun=!1,this._rerunDepth=0,this._store={},this._dirtyDepCount=0,this._pauseLocks=null,this._pauseBuffer=null,this._fn!=null&&(this._cached=void 0),e||(this._fn!=null||this._deps.length>0)&&(!this._isTerminal||this._resubscribable)&&(this._status="sentinel")}_onDepMessage(e,n){let t=this._deps[e],s=n[0];if(this._inspectorHooks!=null){let i={kind:"dep_message",depIndex:e,message:n};for(let o of this._inspectorHooks)o(i)}if(s!==W){if(s===w){this._depDirtied(t);return}if(s===I){this._depInvalidated(t),this._emit(Ne);return}if(s===D||s===$){this._emit([n]);return}if(s===A){this._emit(pe);return}if(s===y)this._depSettledAsData(t,n[1]);else if(s===O)this._depSettledAsResolved(t);else if(s===C)this._depSettledAsTerminal(t,!0);else if(s===x)this._depSettledAsTerminal(t,n[1]);else{this._emit([n]);return}if(!this._fn){(s===y||s===O)&&this._emit([n]),(s===C||s===x)&&this._maybeAutoTerminalAfterWave();return}}}_depDirtied(e){e.dirty||(e.dirty=!0,e.involvedThisWave=!0,this._dirtyDepCount++,this._status!=="dirty"&&this._emit(he))}_depSettledAsData(e,n){e.dirty&&(e.dirty=!1,this._dirtyDepCount--),e.involvedThisWave=!0,e.dataBatch.push(n),this._waveHasNewData=!0}_depSettledAsResolved(e){e.dirty&&(e.dirty=!1,this._dirtyDepCount--)}_depSettledAsTerminal(e,n){e.dirty&&(e.dirty=!1,this._dirtyDepCount--),e.terminal=n,e.involvedThisWave=!0,this._hasNewTerminal=!0}_depInvalidated(e){e.prevData=void 0,e.terminal=void 0,e.dataBatch.length=0,e.dirty?e.involvedThisWave=!1:(e.dirty=!0,e.involvedThisWave=!0,this._dirtyDepCount++)}_maybeRunFnOnSettlement(){if(!(this._isTerminal&&!this._resubscribable)&&!(this._dirtyDepCount>0)){if(!this._partial&&!this._hasCalledFnOnce)for(let e=0;e<this._deps.length;e++){let n=this._deps[e];if(n.dataBatch.length===0&&n.prevData===void 0&&n.terminal===void 0){this._maybeAutoTerminalAfterWave();return}}if(this._paused){this._pendingWave=!0;return}if(!this._waveHasNewData&&!this._hasNewTerminal&&this._hasCalledFnOnce){this._clearWaveFlags(),this._emit(ke),this._maybeAutoTerminalAfterWave();return}this._fn&&this._execFn(),this._maybeAutoTerminalAfterWave()}}_maybeAutoTerminalAfterWave(){if(this._deps.length===0||this._isTerminal)return;let e=this._deps.find(n=>n.terminal!==void 0&&n.terminal!==!0);if(e!=null){this._autoError&&this._emit([[x,e.terminal]]);return}this._autoComplete&&this._deps.every(n=>n.terminal!==void 0)&&this._emit(Ae)}_execFn(){if(!this._fn||this._isTerminal&&!this._resubscribable)return;if(this._isExecutingFn){this._pendingRerun=!0;return}let e=this._cleanup;if(typeof e=="function"){this._cleanup=void 0;try{e()}catch(o){this._emit([[x,this._wrapFnError("cleanup threw",o)]]);return}}else if(e!=null&&typeof e=="object"){let o=e.beforeRun;if(typeof o=="function"){e.beforeRun=void 0;try{o()}catch(a){this._emit([[x,this._wrapFnError("cleanup.beforeRun threw",a)]]);return}}}let n=this._deps.map(o=>o.involvedThisWave?o.dataBatch.length>0?[...o.dataBatch]:[]:void 0),t=this._deps.map(o=>o.prevData);for(let o=0;o<this._deps.length;o++){let a=n[o];a!=null&&a.length>0&&(this._deps[o].prevData=a[a.length-1])}let s=this._deps.map(o=>o.terminal),i={prevData:t,terminalDeps:s,store:this._store};if(this._hasCalledFnOnce=!0,this._clearWaveFlags(),this._inspectorHooks!=null){let o={kind:"run",batchData:n,prevData:t};for(let a of this._inspectorHooks)a(o)}this._isExecutingFn=!0;try{let o=this._fn(n,this._actions,i);if(typeof o=="function")this._cleanup=o;else if(o!=null&&typeof o=="object"){let a=o;(typeof a.beforeRun=="function"||typeof a.deactivate=="function"||typeof a.invalidate=="function")&&(this._cleanup=o)}}catch(o){this._emit([[x,this._wrapFnError("fn threw",o)]])}finally{this._isExecutingFn=!1,this._pendingRerun?(this._pendingRerun=!1,this._rerunDepth+=1,this._rerunDepth>Ie?(this._rerunDepth=0,this._emit([[x,new Error(`Node "${this.name}": _pendingRerun depth exceeded ${Ie} \u2014 likely a reactive cycle`)]])):this._maybeRunFnOnSettlement()):this._rerunDepth=0,this._clearWaveFlags()}}_clearWaveFlags(){this._waveHasNewData=!1,this._hasNewTerminal=!1;for(let e of this._deps)e.involvedThisWave=!1,e.dataBatch.length=0}_wrapFnError(e,n){let t=n instanceof Error?n.message:String(n);return new Error(`Node "${this.name}": ${e}: ${t}`,{cause:n})}_frameBatch(e){let n=this._config.tierOf;if(e.length===1)return n(e[0][0])===3&&this._status!=="dirty"?[z,e[0]]:e;let t=!0,s=!1,i=!1,o=-1;for(let u of e){let d=n(u[0]);d<o&&(t=!1),d===3&&(s=!0),u[0]===w&&(i=!0),o=d}let a=e;if(!t){let u=e.map((d,c)=>({m:d,i:c,tier:n(d[0])}));u.sort((d,c)=>d.tier-c.tier||d.i-c.i),a=u.map(d=>d.m)}if(s&&!i&&this._status!=="dirty"){let u=0;for(;u<a.length&&n(a[u][0])===0;)u++;return u===0?[z,...a]:[...a.slice(0,u),z,...a.slice(u)]}return a}_emit(e){if(e.length===0)return;for(let a=0;a<e.length;a++){let u=e[a];if(u[0]===x&&u[1]===void 0)throw new TypeError('[ERROR, payload] requires a non-undefined payload (spec \xA71.2). Pass an Error object or domain tag instead \u2014 e.g. node.down([[ERROR, new Error("reason")]])')}let n=e;if(this._isTerminal&&!this._resubscribable){let a=e.filter(u=>u[0]===A||u[0]===I);if(a.length===0)return;n=a}n=this._frameBatch(n);let s=null;for(let a=0;a<n.length;a++){let u=n[a],d=u[0];if(d!==D&&d!==$){s?.push(u);continue}if(u.length<2)throw new Error(`Node "${this.name}": [[${d===D?"PAUSE":"RESUME"}]] must carry a lockId payload \u2014 bare PAUSE/RESUME is a protocol violation (C0 rule). Use \`[[PAUSE, lockId]]\` / \`[[RESUME, lockId]]\`.`);let c=!0;if(this._pausable!==!1){let _=u[1];if(d===D)this._pauseLocks==null&&(this._pauseLocks=new Set),this._pauseLocks.add(_),this._paused=!0,this._pausable==="resumeAll"&&this._pauseBuffer==null&&(this._pauseBuffer=[]);else if(this._pauseLocks==null||!this._pauseLocks.has(_))c=!1;else if(this._pauseLocks.delete(_),this._pauseLocks.size===0){if(this._paused=!1,this._pauseBuffer!=null&&this._pauseBuffer.length>0){let g=this._pauseBuffer;this._pauseBuffer=[],this._emit(g)}this._pendingWave&&(this._pendingWave=!1,this._maybeRunFnOnSettlement())}}c?s?.push(u):s==null&&(s=n.slice(0,a))}if(s!=null){if(s.length===0)return;n=s}if(this._hasMeta&&n.some(a=>a[0]===A))for(let a of Object.keys(this.meta))try{this.meta[a]._emit(pe)}catch{}let{finalMessages:i,equalsError:o}=this._updateState(n);if(i.length>0&&this._config.inspectorEnabled){let a=this._config.globalInspector;if(a!=null)try{a({kind:"emit",node:this,messages:i})}catch{}}if(i.length>0)if(this._paused&&this._pausable==="resumeAll"&&this._pauseBuffer!=null){let a=this._config.tierOf,u=[];for(let d of i)a(d[0])===3?this._pauseBuffer.push(d):u.push(d);u.length>0&&this._dispatchOrAccumulate(u)}else this._dispatchOrAccumulate(i);o!=null&&this._emit([[x,o]])}_updateState(e){let n=this._config.tierOf,t,s,i=-1,o=0;for(let c of e)n(c[0])===3&&o++;let a=o<=1,u=-1;if(this._versioning!=null&&o>1){for(let c=e.length-1;c>=0;c--)if(e[c][0]===y){u=c;break}}for(let c=0;c<e.length;c++){let _=e[c],g=_[0];if(g===y){if(_.length>=2){let h=!1;if(a&&this._cached!==void 0)try{h=this._equals(this._cached,_[1])}catch(l){s=this._wrapFnError("equals threw",l),i=c;break}if(h){t==null&&(t=e.slice(0,c)),t.push(ce),this._status="resolved";continue}this._cached=_[1],this._versioning!=null&&(u<0||c===u)&&Ve(this._versioning,_[1],this._hashFn)}this._status="settled",t?.push(_)}else if(t?.push(_),g===w)this._status="dirty";else if(g===O)this._status="resolved";else if(g===C)this._status="completed";else if(g===x)this._status="errored";else if(g===I){this._cached=void 0,this._status="dirty";let h=this._cleanup;if(typeof h=="function"){this._cleanup=void 0;try{h()}catch{}}else if(h!=null&&typeof h=="object"){let l=h.invalidate;if(typeof l=="function")try{l()}catch{}}}else g===A&&(this._resetOnTeardown&&(this._cached=void 0),this._deactivate(!0),this._status="sentinel")}let d=i>=0?t??e.slice(0,i):t??e;return s!=null?{finalMessages:d,equalsError:s}:{finalMessages:d}}_deliverToSinks=e=>{if(this._sinks==null)return;if(typeof this._sinks=="function"){this._sinks(e);return}let n=[...this._sinks];for(let t of n)t(e)};_dispatchOrAccumulate(e){if(Te()){this._batchPendingMessages===null&&(this._batchPendingMessages=[],Me(()=>this._flushBatchPending()));for(let n of e)this._batchPendingMessages.push(n);return}Z(this._deliverToSinks,e,this._config.tierOf)}_flushBatchPending(){let e=this._batchPendingMessages;if(e===null||(this._batchPendingMessages=null,e.length===0))return;let n=this._frameBatch(e);Z(this._deliverToSinks,n,this._config.tierOf)}},Ce=r=>Array.isArray(r),me=r=>typeof r=="object"&&r!=null&&!Array.isArray(r);function we(r,e,n){let t=Ce(r)?r:[],s=typeof r=="function"?r:typeof e=="function"?e:void 0,i={};return Ce(r)?i=(me(e)?e:n)??{}:me(r)?i=r:i=(me(e)?e:n)??{},new te(t,s,i)}function E(r,e){return we([],{...e,initial:r})}function q(r,e,n){return we(r,(s,i,o)=>{let a=s.map((u,d)=>u!=null&&u.length>0?u.at(-1):o.prevData[d]);i.emit(e(a,o))},{describeKind:"derived",...n})}function Ke(r,e){if(r===e)return 0;let n=typeof r;if(n===typeof e&&(n==="number"||n==="string"||n==="boolean"||n==="bigint")){let s=r,i=e;return s<i?-1:s>i?1:0}return String(r).localeCompare(String(e))}function on(r,e){let n=Ke(r[0],e[0]);return n!==0?n:Ke(r[1],e[1])}function Fe(r){return[r.secondary,r.primary]}function G(r,e){let n=Fe(e),t=0,s=r.length;for(;t<s;){let i=t+s>>1;on(n,Fe(r[i]))>0?t=i+1:s=i}return t}var re=class{_version=0;_buf=[];_byPrimary=new Map;get version(){return this._version}get size(){return this._buf.length}has(e){return this._byPrimary.has(e)}get(e){return this._byPrimary.get(e)?.value}upsert(e,n,t,s){let i=this._byPrimary.get(e),o={primary:e,secondary:n,value:t};if(i!==void 0&&s?.equals?.(i,o))return!1;if(i!==void 0){let u=G(this._buf,i);this._buf.splice(u,1)}let a=G(this._buf,o);return this._buf.splice(a,0,o),this._byPrimary.set(e,o),this._version+=1,i===void 0}upsertMany(e,n){let t=0;try{for(let s of e){let i=this._byPrimary.get(s.primary),o={primary:s.primary,secondary:s.secondary,value:s.value};if(i!==void 0&&n?.equals?.(i,o))continue;if(i!==void 0){let u=G(this._buf,i);this._buf.splice(u,1)}let a=G(this._buf,o);this._buf.splice(a,0,o),this._byPrimary.set(s.primary,o),t+=1}}finally{t>0&&(this._version+=1)}return t}delete(e){let n=this._byPrimary.get(e);if(n===void 0)return!1;let t=G(this._buf,n);return this._buf.splice(t,1),this._byPrimary.delete(e),this._version+=1,!0}deleteMany(e){let n=0;try{for(let t of e){let s=this._byPrimary.get(t);if(s===void 0)continue;let i=G(this._buf,s);this._buf.splice(i,1),this._byPrimary.delete(t),n+=1}}finally{n>0&&(this._version+=1)}return n}clear(){let e=this._buf.length;return e===0?0:(this._buf.length=0,this._byPrimary.clear(),this._version+=1,e)}toArray(){return[...this._buf]}toPrimaryMap(){let e=new Map;for(let n of this._buf)e.set(n.primary,n.value);return e}};function an(r){return r.subscribe(()=>{})}function dn(r={}){let{name:e,versioning:n,equals:t,backend:s}=r,i=s??new re;function o(h){return h?.equals!==void 0||t===void 0?h:{...h,equals:t}}let a=E([],{name:e,describeKind:"state",equals:(h,l)=>h===l,...n!=null?{versioning:n}:{}}),u=q([a],([h])=>{let l=h,f=new Map;for(let p of l)f.set(p.primary,p.value);return f},{initial:i.toPrimaryMap(),describeKind:"derived"}),d=an(u),c=!1;function _(){let h=i.toArray();N(()=>{a.down([[w]]),a.down([[y,h]])})}function g(h){let l=i.version;try{return h()}finally{i.version!==l&&_()}}return{ordered:a,byPrimary:u,has(h){return i.has(h)},get(h){return i.get(h)},get size(){return i.size},upsert(h,l,f,p){return g(()=>i.upsert(h,l,f,o(p)))},upsertMany(h,l){let f=[...h];f.length!==0&&g(()=>i.upsertMany(f,o(l)))},delete(h){g(()=>i.delete(h))},deleteMany(h){let l=[...h];l.length!==0&&g(()=>i.deleteMany(l))},clear(){g(()=>i.clear())},dispose(){c||(c=!0,d())}}}var se=class{_version=0;_buf;constructor(e){this._buf=e?[...e]:[]}get version(){return this._version}get size(){return this._buf.length}at(e){if(!Number.isInteger(e))return;let n=e>=0?e:this._buf.length+e;if(!(n<0||n>=this._buf.length))return this._buf[n]}append(e){this._buf.push(e),this._version+=1}appendMany(e){if(e.length===0)return;let n=this._buf.length;this._buf.length=n+e.length;for(let t=0;t<e.length;t++)this._buf[n+t]=e[t];this._version+=1}insert(e,n){if(!Number.isInteger(e)||e<0||e>this._buf.length)throw new RangeError(`insert: index ${e} out of range [0, ${this._buf.length}]`);this._buf.splice(e,0,n),this._version+=1}insertMany(e,n){if(!Number.isInteger(e)||e<0||e>this._buf.length)throw new RangeError(`insertMany: index ${e} out of range [0, ${this._buf.length}]`);n.length!==0&&(this._buf.splice(e,0,...n),this._version+=1)}pop(e){if(this._buf.length===0)throw new RangeError("pop from empty list");if(!Number.isInteger(e))throw new RangeError(`pop: index ${e} must be an integer`);let n=e>=0?e:this._buf.length+e;if(n<0||n>=this._buf.length)throw new RangeError(`pop: index ${e} out of range`);let[t]=this._buf.splice(n,1);return this._version+=1,t}clear(){let e=this._buf.length;return e===0?0:(this._buf.length=0,this._version+=1,e)}toArray(){return[...this._buf]}};function un(r,e={}){let{name:n,versioning:t,backend:s}=e,i=s??new se(r),o=E(i.toArray(),{name:n,describeKind:"state",equals:(d,c)=>d===c,...t!=null?{versioning:t}:{}});function a(){let d=i.toArray();N(()=>{o.down([[w]]),o.down([[y,d]])})}function u(d){let c=i.version;try{return d()}finally{i.version!==c&&a()}}return{items:o,get size(){return i.size},at(d){return i.at(d)},append(d){u(()=>i.append(d))},appendMany(d){u(()=>i.appendMany(d))},insert(d,c){u(()=>i.insert(d,c))},insertMany(d,c){u(()=>i.insertMany(d,c))},pop(d=-1){return u(()=>i.pop(d))},clear(){u(()=>i.clear())},dispose(){}}}var ie=class{_version=0;_maxSize;_buf;_head=0;_size=0;constructor(e,n){if(n!==void 0&&n<1)throw new RangeError("maxSize must be >= 1");if(this._maxSize=n,n!==void 0){if(this._buf=new Array(n),e&&e.length>0){let t=Math.min(e.length,n),s=e.length-t;for(let i=0;i<t;i++)this._buf[i]=e[s+i];this._size=t}}else this._buf=e?[...e]:[],this._size=this._buf.length}get version(){return this._version}get size(){return this._size}at(e){if(!Number.isInteger(e))return;let n=e>=0?e:this._size+e;if(!(n<0||n>=this._size))return this._maxSize!==void 0?this._buf[(this._head+n)%this._maxSize]:this._buf[n]}append(e){this._rawAppend(e),this._version+=1}appendMany(e){if(e.length===0)return;let n=this._maxSize!==void 0&&e.length>this._maxSize?e.length-this._maxSize:0;for(let t=n;t<e.length;t++)this._rawAppend(e[t]);this._version+=1}clear(){if(this._size===0)return 0;let e=this._size;if(this._maxSize===void 0)this._buf.length=0;else for(let n=0;n<e;n++)this._buf[(this._head+n)%this._maxSize]=void 0;return this._head=0,this._size=0,this._version+=1,e}trimHead(e){if(!Number.isInteger(e)||e<0)throw new RangeError(`trimHead: n must be a non-negative integer (got ${e})`);if(e===0||this._size===0)return 0;let n=Math.min(e,this._size);if(this._maxSize===void 0)this._buf.splice(0,n);else{for(let t=0;t<n;t++)this._buf[(this._head+t)%this._maxSize]=void 0;this._head=(this._head+n)%this._maxSize}return this._size-=n,this._version+=1,n}slice(e,n){if(!Number.isInteger(e)||e<0)throw new RangeError(`slice: start must be a non-negative integer (got ${e})`);if(n!==void 0&&(!Number.isInteger(n)||n<0))throw new RangeError(`slice: stop must be a non-negative integer or undefined (got ${n})`);let t=n===void 0?this._size:Math.min(Math.max(n,0),this._size),s=Math.min(e,this._size);if(s>=t)return[];let i=t-s;if(this._maxSize===void 0)return this._buf.slice(s,t);let o=new Array(i);for(let a=0;a<i;a++)o[a]=this._buf[(this._head+s+a)%this._maxSize];return o}tail(e){if(!Number.isInteger(e)||e<0)throw new RangeError(`tail: n must be a non-negative integer (got ${e})`);if(e===0||this._size===0)return[];let n=Math.min(e,this._size);return this.slice(this._size-n,this._size)}toArray(){if(this._maxSize===void 0)return[...this._buf];let e=new Array(this._size);for(let n=0;n<this._size;n++)e[n]=this._buf[(this._head+n)%this._maxSize];return e}_rawAppend(e){if(this._maxSize===void 0){this._buf.push(e),this._size=this._buf.length;return}this._size<this._maxSize?(this._buf[(this._head+this._size)%this._maxSize]=e,this._size+=1):(this._buf[this._head]=e,this._head=(this._head+1)%this._maxSize)}};function ze(r){return r.subscribe(()=>{})}var ln=64;function cn(r,e={}){let{name:n,maxSize:t,versioning:s,backend:i}=e,o=i??new ie(r,t),a=E(o.toArray(),{name:n,describeKind:"state",equals:(l,f)=>l===f,...s!=null?{versioning:s}:{}});function u(){let l=o.toArray();N(()=>{a.down([[w]]),a.down([[y,l]])})}let d=new Map,c=new Map;function _(l,f){return`${l}:${f===void 0?"END":f}`}function g(l){if(l.size<ln)return;let f=l.keys().next();if(f.done)return;let p=l.get(f.value);p!==void 0&&p.dispose(),l.delete(f.value)}function h(l){let f=o.version;try{return l()}finally{o.version!==f&&u()}}return{entries:a,get size(){return o.size},at(l){return o.at(l)},append(l){h(()=>o.append(l))},appendMany(l){l.length!==0&&h(()=>o.appendMany(l))},clear(){h(()=>o.clear())},trimHead(l){h(()=>o.trimHead(l))},tail(l){if(!Number.isInteger(l)||l<0)throw new RangeError(`tail: n must be a non-negative integer (got ${l})`);let f=d.get(l);if(f!==void 0)return d.delete(l),d.set(l,f),f.node;g(d);let p=q([a],([T])=>{let m=T;return l===0||m.length===0?[]:m.slice(Math.max(0,m.length-l))},{initial:o.tail(l),describeKind:"derived"}),b=ze(p);return d.set(l,{node:p,dispose:b}),p},slice(l,f){if(!Number.isInteger(l)||l<0)throw new RangeError(`slice: start must be a non-negative integer (got ${l})`);if(f!==void 0&&(!Number.isInteger(f)||f<0))throw new RangeError(`slice: stop must be a non-negative integer or undefined (got ${f})`);let p=_(l,f),b=c.get(p);if(b!==void 0)return c.delete(p),c.set(p,b),b.node;g(c);let T=q([a],([R])=>{let M=R;return f===void 0?M.slice(l):M.slice(l,f)},{initial:o.slice(l,f),describeKind:"derived"}),m=ze(T);return c.set(p,{node:T,dispose:m}),T},disposeTail(l){let f=d.get(l);return f===void 0?!1:(f.dispose(),d.delete(l),!0)},disposeSlice(l,f){let p=_(l,f),b=c.get(p);return b===void 0?!1:(b.dispose(),c.delete(p),!0)},disposeAllViews(){for(let l of d.values())l.dispose();d.clear();for(let l of c.values())l.dispose();c.clear()},dispose(){for(let l of d.values())l.dispose();d.clear();for(let l of c.values())l.dispose();c.clear()}}}var oe=class{_version=0;_store=new Map;_maxSize;_defaultTtl;constructor(e={}){let{maxSize:n,defaultTtl:t}=e;if(n!==void 0&&n<1)throw new RangeError("maxSize must be >= 1");if(t!==void 0&&t<=0)throw new RangeError("defaultTtl must be positive");this._maxSize=n,this._defaultTtl=t}get version(){return this._version}get size(){return this._store.size}has(e){let n=this._store.get(e);return n===void 0?!1:this._isExpired(n)?(this._store.delete(e),this._version+=1,!1):(this._touchLru(e,n),!0)}get(e){let n=this._store.get(e);if(n!==void 0){if(this._isExpired(n)){this._store.delete(e),this._version+=1;return}return this._touchLru(e,n),n.value}}set(e,n,t){let s=this._resolveExpiresAt(t);this._store.has(e)&&this._store.delete(e),this._store.set(e,{value:n,expiresAt:s}),this._evictLruWhileOver(),this._version+=1}setMany(e,n){let t=this._resolveExpiresAt(n),s=0;try{for(let[i,o]of e)this._store.has(i)&&this._store.delete(i),this._store.set(i,{value:o,expiresAt:t}),s+=1}finally{s>0&&(this._evictLruWhileOver(),this._version+=1)}}delete(e){let n=this._store.delete(e);return n&&(this._version+=1),n}deleteMany(e){let n=0;try{for(let t of e)this._store.delete(t)&&(n+=1)}finally{n>0&&(this._version+=1)}return n}clear(){let e=this._store.size;return e===0?0:(this._store.clear(),this._version+=1,e)}pruneExpired(){let e=j(),n=0;for(let[t,s]of this._store)this._isExpired(s,e)&&(this._store.delete(t),n+=1);return n>0&&(this._version+=1),n}toMap(){let e=j(),n=new Map;for(let[t,s]of this._store)this._isExpired(s,e)||n.set(t,s.value);return n}_resolveExpiresAt(e){let n=e??this._defaultTtl;if(n!==void 0){if(!Number.isFinite(n)||n<=0)throw new RangeError(`MapBackend: ttl must be a positive finite number (got ${n})`);return j()+n*1e9}}_isExpired(e,n){return e.expiresAt===void 0?!1:(n??j())>=e.expiresAt}_touchLru(e,n){this._store.delete(e),this._store.set(e,n)}_evictLruWhileOver(){if(this._maxSize!==void 0)for(;this._store.size>this._maxSize;){let e=this._store.keys().next().value;if(e===void 0)break;this._store.delete(e)}}};function fn(r={}){let{name:e,maxSize:n,defaultTtl:t,versioning:s,backend:i}=r,o=i??new oe({maxSize:n,defaultTtl:t}),a=E(o.toMap(),{name:e,describeKind:"state",equals:(c,_)=>c===_,...s!=null?{versioning:s}:{}});function u(){let c=o.toMap();N(()=>{a.down([[w]]),a.down([[y,c]])})}function d(c){let _=o.version;try{return c()}finally{o.version!==_&&u()}}return{entries:a,has(c){return d(()=>o.has(c))},get(c){return d(()=>o.get(c))},set(c,_,g){d(()=>o.set(c,_,g?.ttl))},setMany(c,_){d(()=>o.setMany(c,_?.ttl))},delete(c){d(()=>o.delete(c))},deleteMany(c){d(()=>o.deleteMany(c))},clear(){d(()=>o.clear())},pruneExpired(){d(()=>o.pruneExpired())},get size(){return o.size},dispose(){}}}0&&(module.exports={NativeIndexBackend,NativeListBackend,NativeLogBackend,NativeMapBackend,reactiveIndex,reactiveList,reactiveLog,reactiveMap});

package/dist/extra/reactive.d.cts

@@ -0,0 +1,352 @@
+import { a as Node, V as VersioningLevel } from '../node-Dd6wHSib.cjs';
+export { L as LogBackend, N as NativeLogBackend, R as ReactiveLogBundle, a as ReactiveLogOptions, r as reactiveLog } from '../reactive-log-BiVoSxke.cjs';
+export { M as MapBackend, N as NativeMapBackend, b as NativeMapBackendOptions, R as ReactiveMapBundle, a as ReactiveMapOptions, r as reactiveMap } from '../reactive-map-CwO_COHy.cjs';
+
+type IndexRow<K, V = unknown> = {
+    readonly primary: K;
+    readonly secondary: unknown;
+    readonly value: V;
+};
+type ReactiveIndexOptions<K, V = unknown> = {
+    /** Optional registry name for `describe()` / debugging. */
+    name?: string;
+    /**
+     * Storage backend. Defaults to `NativeIndexBackend` (flat array + parallel `Map<K,IndexRow>`).
+     * Users can plug in persistent / B-tree backends via the {@link IndexBackend} interface.
+     */
+    backend?: IndexBackend<K, V>;
+    /**
+     * Optional versioning level for the underlying `ordered` state node. Set at
+     * construction time; cannot be changed later. Pass `0` for V0 identity +
+     * monotonic version counter, or `1` for V1 + content-addressed cid.
+     * (The `byPrimary` derived node inherits through the dep graph.)
+     */
+    versioning?: VersioningLevel;
+    /**
+     * Default row-equality used to short-circuit idempotent upserts. When
+     * provided, every `upsert` / `upsertMany` that finds an existing primary
+     * compares the stored and candidate rows via `equals(existing, next)` —
+     * on `true` the call is a no-op (no version bump, no emission). Per-call
+     * `UpsertOptions.equals` overrides this default. Analogous to
+     * `NodeOptions.equals` on the core `node()` primitive.
+     */
+    equals?: (existing: IndexRow<K, V>, next: IndexRow<K, V>) => boolean;
+};
+type ReactiveIndexBundle<K, V = unknown> = {
+    /** Rows sorted by `(secondary, primary)`. */
+    readonly ordered: Node<readonly IndexRow<K, V>[]>;
+    /** Map from primary key to stored value. */
+    readonly byPrimary: Node<ReadonlyMap<K, V>>;
+    /** O(1) primary-key existence check. */
+    has: (primary: K) => boolean;
+    /** O(1) value lookup by primary key. */
+    get: (primary: K) => V | undefined;
+    /** Number of rows currently in the index (O(1)). */
+    readonly size: number;
+    /**
+     * Upserts a row. When `opts.equals(existing, next)` returns `true` for an
+     * existing primary key, the upsert is a no-op (no version bump, no emission).
+     * Useful for idempotent writes.
+     *
+     * @returns `true` if a new row was inserted (primary key was absent),
+     *   `false` if the primary key was already present (updated in place OR
+     *   skipped idempotently via `opts.equals`). D5(a).
+     */
+    upsert: (primary: K, secondary: unknown, value: V, opts?: UpsertOptions<K, V>) => boolean;
+    /**
+     * Bulk upsert — emits one snapshot for the whole batch. `opts.equals` applied
+     * per-row. No-op if empty or all rows skipped.
+     *
+     * **Iterable consumption:** Consumes `rows` once (single-pass).
+     */
+    upsertMany: (rows: Iterable<{
+        primary: K;
+        secondary: unknown;
+        value: V;
+    }>, opts?: UpsertOptions<K, V>) => void;
+    delete: (primary: K) => void;
+    /**
+     * Bulk delete — emits one snapshot for the whole batch. No-op if nothing was removed.
+     *
+     * **Iterable consumption:** Consumes `primaries` once (single-pass).
+     */
+    deleteMany: (primaries: Iterable<K>) => void;
+    clear: () => void;
+    /**
+     * Releases internal keepalive subscriptions (on `byPrimary`) so the bundle
+     * can be GC'd. Safe to call more than once (subsequent calls are no-ops).
+     * Subsequent mutations after `dispose()` still execute on the backend but
+     * `byPrimary` may stop updating if no external subscriber is attached.
+     * D6(a).
+     */
+    dispose: () => void;
+};
+/**
+ * Storage contract for {@link reactiveIndex}. Implementations own the mutable state and
+ * expose a monotonic `version` counter that increments on every structural change.
+ *
+ * The reactive layer reads `version` to decide when to emit; it does not inspect
+ * internal representation. Users can plug in B-tree / skip-list / persistent backends
+ * without touching the reactive emission logic.
+ *
+ * @remarks Post-1.0 op-log changesets will extend this interface with a
+ * `changesSince(version: number): Iterable<Change>` method. Current consumers
+ * should treat all methods here as stable.
+ *
+ * @category extra
+ */
+/**
+ * Optional per-call options for {@link IndexBackend.upsert} and bulk upsert.
+ *
+ * @category extra
+ */
+type UpsertOptions<K, V> = {
+    /**
+     * Skip the upsert if an existing row is considered equal to the proposed row.
+     * Default: no skip — every upsert advances `version`. Provide for idempotent
+     * keys (e.g., `(a, b) => a.secondary === b.secondary && a.value === b.value`).
+     */
+    equals?: (existing: IndexRow<K, V>, next: IndexRow<K, V>) => boolean;
+};
+interface IndexBackend<K, V = unknown> {
+    /** Monotonic mutation counter; increments on every upsert/delete/clear that changes state. */
+    readonly version: number;
+    /** Number of rows currently stored. */
+    readonly size: number;
+    /** O(1) primary-key existence check. */
+    has(primary: K): boolean;
+    /** Value lookup by primary key. */
+    get(primary: K): V | undefined;
+    /**
+     * Insert or replace a row. Returns `true` if a row was inserted (primary
+     * didn't exist), `false` otherwise (updated OR skipped via `opts.equals`).
+     *
+     * **Atomicity contract:** Either fully succeeds or throws before any state
+     * change; `version` advances only on state change.
+     */
+    upsert(primary: K, secondary: unknown, value: V, opts?: UpsertOptions<K, V>): boolean;
+    /**
+     * Atomic bulk upsert. Returns the number of rows that caused a state change
+     * (inserts + non-skipped updates). Advances `version` at most once.
+     * No-op if iterable is empty or all rows skipped by `opts.equals`.
+     *
+     * **Consumes `rows` once** — pass an array for multi-shot consumers.
+     */
+    upsertMany(rows: Iterable<{
+        primary: K;
+        secondary: unknown;
+        value: V;
+    }>, opts?: UpsertOptions<K, V>): number;
+    /** Remove a row by primary key. Returns `true` if the row existed. Advances `version` only if true. */
+    delete(primary: K): boolean;
+    /**
+     * Atomic bulk delete. Returns count removed. Advances `version` at most once.
+     * No-op if no keys were present. Consumes `primaries` once.
+     */
+    deleteMany(primaries: Iterable<K>): number;
+    /** Remove all rows. Returns the number removed. Advances `version` only if non-zero. */
+    clear(): number;
+    /** Rows in sorted `(secondary, primary)` order — fresh snapshot suitable for emission. */
+    toArray(): readonly IndexRow<K, V>[];
+    /** Primary-key → value map — fresh snapshot. */
+    toPrimaryMap(): ReadonlyMap<K, V>;
+}
+/**
+ * Default flat-array backend. Maintains `buf: IndexRow[]` sorted by `(secondary, primary)`
+ * and a parallel `Map<K, IndexRow>` for O(1) primary-key lookup.
+ *
+ * **Complexity:**
+ * - `has`, `get`: O(1)
+ * - `upsert`: up to 2× O(log n) bisect (locate old + locate new) + up to 2× O(n) splice (remove-old + insert-new) = O(n)
+ * - `upsertMany(k rows)`: O(k log n) bisect + O(k·n) splice worst case; single version bump
+ * - `delete`: O(log n) bisect + O(n) splice = O(n)
+ * - `deleteMany(k keys)`: O(k log n) + O(k·n) splice worst case; single version bump
+ * - `clear`: O(1)
+ * - `toArray`, `toPrimaryMap`: O(n)
+ *
+ * @category extra
+ */
+declare class NativeIndexBackend<K, V = unknown> implements IndexBackend<K, V> {
+    private _version;
+    private readonly _buf;
+    private readonly _byPrimary;
+    get version(): number;
+    get size(): number;
+    has(primary: K): boolean;
+    get(primary: K): V | undefined;
+    upsert(primary: K, secondary: unknown, value: V, opts?: UpsertOptions<K, V>): boolean;
+    upsertMany(rows: Iterable<{
+        primary: K;
+        secondary: unknown;
+        value: V;
+    }>, opts?: UpsertOptions<K, V>): number;
+    delete(primary: K): boolean;
+    deleteMany(primaries: Iterable<K>): number;
+    clear(): number;
+    toArray(): readonly IndexRow<K, V>[];
+    toPrimaryMap(): ReadonlyMap<K, V>;
+}
+/**
+ * Creates a reactive index: unique primary key per row, rows sorted by `(secondary, primary)` for ordered scans.
+ *
+ * @param options - Optional `name` for `describe()` / debugging, and optional `backend` (see {@link IndexBackend}).
+ * @returns Bundle with `ordered` (sorted rows), `byPrimary` (map), O(1) `has` / `get` / `size`,
+ *   imperative `upsert` / `upsertMany` / `delete` / `deleteMany` / `clear`.
+ *
+ * @remarks
+ * **Ordering:** `secondary` and `primary` are compared via a small total order: same primitive `typeof` uses
+ * numeric/string/boolean/bigint comparison; mixed or object keys fall back to `String(a).localeCompare(String(b))`
+ * (not identical to Python's rich comparison for exotic types).
+ *
+ * **Backend:** The default {@link NativeIndexBackend} offers O(1) primary-key lookups and O(n) upserts.
+ * For scale beyond a few thousand rows, supply a user-pluggable persistent/B-tree backend via the
+ * `backend` option — reactive emission semantics are unchanged.
+ *
+ * @example
+ * ```ts
+ * import { reactiveIndex } from "@graphrefly/graphrefly-ts";
+ *
+ * const idx = reactiveIndex<string, string>();
+ * idx.upsert("id1", 10, "row-a");
+ * idx.upsert("id2", 5, "row-b");
+ * ```
+ *
+ * @category extra
+ */
+declare function reactiveIndex<K, V = unknown>(options?: ReactiveIndexOptions<K, V>): ReactiveIndexBundle<K, V>;
+
+type ReactiveListOptions<T> = {
+    name?: string;
+    /**
+     * Storage backend. Defaults to `NativeListBackend` (flat mutable array).
+     * Users can plug in persistent / RRB-tree backends via the {@link ListBackend} interface.
+     */
+    backend?: ListBackend<T>;
+    /**
+     * Optional versioning level for the underlying `items` state node. Set at
+     * construction time; cannot be changed later. Pass `0` for V0 identity +
+     * monotonic version counter, or `1` for V1 + content-addressed cid.
+     */
+    versioning?: VersioningLevel;
+};
+type ReactiveListBundle<T> = {
+    /** Emits `readonly T[]` on each structural change (two-phase). */
+    readonly items: Node<readonly T[]>;
+    /** Current entry count (O(1)). */
+    readonly size: number;
+    /** Positional access (O(1)); supports negative indices (Python-style). Returns `undefined` on out-of-range. */
+    at: (index: number) => T | undefined;
+    append: (value: T) => void;
+    /** Push all values, emit one snapshot. No-op if `values` is empty. */
+    appendMany: (values: readonly T[]) => void;
+    /** Insert a value at `index`. Throws `RangeError` on out-of-range. */
+    insert: (index: number, value: T) => void;
+    /** Insert all values at `index` as one bulk op; emits one snapshot. No-op if `values` is empty. */
+    insertMany: (index: number, values: readonly T[]) => void;
+    /** Remove and return the value at `index` (default: last). Negative indices Python-style. Throws on empty / out-of-range. */
+    pop: (index?: number) => T;
+    clear: () => void;
+    /**
+     * Releases any internal keepalive subscriptions so the bundle can be
+     * GC'd. `reactiveList` currently holds none (no internal derived nodes),
+     * so `dispose()` is a no-op today — exposed for API parity with
+     * `reactiveIndex.dispose` / `reactiveMap.dispose` / `reactiveLog.dispose`.
+     * Idempotent. D6(a).
+     */
+    dispose: () => void;
+};
+/**
+ * Storage contract for {@link reactiveList}. Implementations own the mutable state
+ * and expose a monotonic `version` counter that increments on every structural change.
+ *
+ * The reactive layer reads `version` before and after each backend call; when it
+ * advances, a snapshot is emitted.
+ *
+ * @remarks Post-1.0 op-log changesets will extend this interface with a
+ * `changesSince(version: number): Iterable<Change>` method. Current consumers
+ * should treat all methods here as stable.
+ *
+ * @category extra
+ */
+interface ListBackend<T> {
+    /** Monotonic mutation counter; increments on every structural change. */
+    readonly version: number;
+    /** Number of items currently stored. */
+    readonly size: number;
+    /** Positional access; `undefined` on out-of-range. */
+    at(index: number): T | undefined;
+    /** Append a single value. Advances `version`. */
+    append(value: T): void;
+    /** Append a batch. Advances `version` once. No-op if empty. */
+    appendMany(values: readonly T[]): void;
+    /** Insert at index; throws `RangeError` on out-of-range `0 <= index <= size`. Advances `version`. */
+    insert(index: number, value: T): void;
+    /** Bulk insert at index; throws on out-of-range. Advances `version` once. No-op if `values` empty. */
+    insertMany(index: number, values: readonly T[]): void;
+    /** Remove and return value at index; throws on empty / out-of-range. Advances `version`. */
+    pop(index: number): T;
+    /** Clear all entries. Returns count removed. Advances `version` only if non-zero. */
+    clear(): number;
+    /** Full snapshot as a fresh array. */
+    toArray(): readonly T[];
+}
+/**
+ * Default mutable-array backend.
+ *
+ * **Complexity:**
+ * - `at`, `size`: O(1)
+ * - `append`: O(1) amortized
+ * - `appendMany(values)`, `insertMany(index, values)`: O(n + k) where k = values.length
+ * - `insert`, `pop` (middle): O(n) due to splice
+ * - `pop` (last): O(1)
+ * - `clear`: O(1)
+ * - `toArray`: O(n)
+ *
+ * @category extra
+ */
+declare class NativeListBackend<T> implements ListBackend<T> {
+    private _version;
+    private readonly _buf;
+    constructor(initial?: readonly T[]);
+    get version(): number;
+    get size(): number;
+    at(index: number): T | undefined;
+    append(value: T): void;
+    appendMany(values: readonly T[]): void;
+    insert(index: number, value: T): void;
+    insertMany(index: number, values: readonly T[]): void;
+    pop(index: number): T;
+    clear(): number;
+    toArray(): readonly T[];
+}
+/**
+ * Creates a reactive list with immutable array snapshots.
+ *
+ * @param initial - Optional initial items (copied).
+ * @param options - Optional `name` for `describe()` / debugging, or pluggable `backend`.
+ * @returns Bundle with `items` (state node), `size` / `at`, `append` / `appendMany` / `insert` /
+ *   `insertMany` / `pop` / `clear`.
+ *
+ * @remarks
+ * **No `maxSize`:** insert/pop-anywhere semantics make eviction-under-cap ambiguous.
+ * For bounded append-heavy workloads use `reactiveLog` (head-trim is well-defined for
+ * append-only).
+ *
+ * **Backend:** Default {@link NativeListBackend}. For persistent / RRB-tree semantics
+ * supply a custom {@link ListBackend}. If you provide a `backend`, `initial` is ignored
+ * — seed the backend directly.
+ *
+ * @example
+ * ```ts
+ * import { reactiveList } from "@graphrefly/graphrefly-ts";
+ *
+ * const list = reactiveList<string>(["a"], { name: "queue" });
+ * list.append("b");
+ * list.insertMany(1, ["x", "y"]);
+ * ```
+ *
+ * @category extra
+ */
+declare function reactiveList<T>(initial?: readonly T[], options?: ReactiveListOptions<T>): ReactiveListBundle<T>;
+
+export { type IndexBackend, type IndexRow, type ListBackend, NativeIndexBackend, NativeListBackend, type ReactiveIndexBundle, type ReactiveIndexOptions, type ReactiveListBundle, type ReactiveListOptions, type UpsertOptions, reactiveIndex, reactiveList };