@directive-run/core 1.11.0 → 1.13.0

package/dist/chunk-PA6VC32N.js

@@ -0,0 +1,2 @@
+import {i}from'./chunk-2FF6QGOA.js';import {h}from'./chunk-PXRV64PA.js';var $="djb2-1",F=1,x=Symbol("directive.audit-ledger.internal");function B(t,r,i){if(t===null||typeof t!="object")return;let o=[];for(let a of r.split(".")){if(!a)continue;let l=a.match(/^\[(\d+)\](.*)$/);if(l){o.push(Number(l[1])),l[2]&&o.push(l[2].replace(/^\./,""));continue}let f=a.match(/^([^[]+)\[(\d+)\](.*)$/);if(f){o.push(f[1]),o.push(Number(f[2])),f[3]&&o.push(f[3].replace(/^\./,""));continue}o.push(a);}let m=t;for(let a=0;a<o.length-1;a++){let l=o[a];if(m===null||typeof m!="object")return;m=m[l];}if(m===null||typeof m!="object")return;let d=o[o.length-1];d!==void 0&&(m[d]=i);}function N(t){for(let r of Object.keys(t)){let i=t[r];if(i!==null&&typeof i=="object"){if(Array.isArray(i)&&r==="whenExplain")for(let o of i)o!==null&&typeof o=="object"&&Object.freeze(o);Object.freeze(i);}}return Object.freeze(t),t}var U=1e4,G=1e3;function P(t){if(t instanceof Date)return t.getTime();if(typeof t=="number"){if(!Number.isFinite(t))throw new Error("[Directive] audit-ledger: changedBetween bound must be a finite number, ISO string, or Date.");return t}if(typeof t=="string"){let r=Date.parse(t);if(!Number.isFinite(r))throw new Error(`[Directive] audit-ledger: changedBetween bound "${t}" is not a parseable ISO date string.`);return r}throw new Error("[Directive] audit-ledger: changedBetween bound must be a number, ISO string, or Date.")}function T(t,r){if(r.kind&&!(Array.isArray(r.kind)?r.kind:[r.kind]).includes(t.kind))return  false;if(r.factPath!==void 0)if(t.kind==="fact.change"){if(t.key!==r.factPath)return  false}else if(t.kind==="resolver.write.rejected"){if(t.fact!==r.factPath)return  false}else return  false;if(r.constraintId!==void 0&&(t.kind!=="constraint.evaluate"||t.constraintId!==r.constraintId))return  false;if(r.changedBetween){let[i,o]=r.changedBetween,m=P(i),d=P(o);if(t.ts<m||t.ts>d)return  false}return  true}function Y(t={}){let r=t.capacity??U,i=[],o=null;return {write(d){if(i.length>=r){let a=i[0];o?.(a.seq,1),i.shift();}for(i.push(d);i.length>r;)i.shift();},query(d){let a=d.limit??G,l=[];for(let f=i.length-1;f>=0;f--){let g=i[f];if(T(g,d)&&(l.push(g),l.length>=a))break}return l},recent(d){let a=Math.max(0,i.length-d);return i.slice(a)},forFact(d,a={}){return this.query({factPath:d,limit:a.limit})},forConstraint(d,a={}){return this.query({constraintId:d,limit:a.limit})},toJSON(){return {entries:i.slice(),capturedAt:Date.now()}},clear(){i=[];},destroy(){i=[],o=null;},erase(d,a){let l=0;for(let f=0;f<i.length;f++){let g=i[f];T(g,d)&&(i[f]=a(g),l++);}return l},onTruncate(d){o=d;}}}function W(t){return h(t)}function _(t){if(t.hashAlgo==="djb2-1")return W(t);throw new Error(`[Directive] audit-ledger: unknown hashAlgo "${String(t.hashAlgo)}" on entry seq=${t.seq}. Cannot verify chain integrity. Known algorithms: "djb2-1".`)}function ee(t={}){let r=t.sink??Y(),i$1=t.capturePII??false,o=t.redact,m=0,d=null,a=null,l=null,f=new Map,g=new Map,k=new Set;function L(e){if(i$1||k.size===0||e===null||typeof e!="object")return e;let n;try{n=JSON.parse(JSON.stringify(e));}catch{return e}return i(n,{operator(s,u,y,c){k.has(s)&&B(n,c,"[redacted]");},literal(s){k.has(s)&&B(n,s,"[redacted]");}}),n}function w(){if(f.clear(),g.clear(),!!a)try{let e=a.inspect;if(typeof e!="function")return;let s=e()?.constraints??[],u=a.$internal?.mergedConstraints;for(let y of s)if(y.whenSpec!==void 0)f.set(y.id,L(y.whenSpec));else {let c=u?.[y.id],h$1=c&&typeof c.when=="function"?c.when:void 0;h$1?g.set(y.id,h(String(h$1))):y.when!==void 0&&typeof y.when=="function"?g.set(y.id,h(String(y.when))):g.set(y.id,h("[function]"));}}catch{}}function j(){if(k.clear(),!(i$1||!a))try{let e=a.meta;if(!e||typeof e.byTag!="function")return;let n=e.byTag("pii")??[];for(let s of n)k.add(s.id);}catch{}}function E(e,n){return i$1?n:k.has(e)?"[redacted]":n}function C(e){if(!e||i$1||k.size===0)return e;let n=false,s=e.map(u=>{if(k.has(u.path))return n=true,{...u,actual:"[redacted]"};if(u.children){let y=C(u.children);if(y!==u.children)return n=true,{...u,children:y}}return u});return n?s:e}function p(e){let n={...e,seq:m++,ts:Date.now(),prevHash:d,hashAlgo:$,schemaVersion:F},s=o?o(n):n;return N(s),r.write(s),d=_(s),s}function M(e){switch(e.type){case "constraint.evaluate":{let n=f.get(e.id),s=g.get(e.id),u={kind:"constraint.evaluate",constraintId:e.id,active:e.active,whenExplain:C(e.whenExplain)};n!==void 0?u.whenSpec=n:s!==void 0&&(u.whenSource={kind:"function",sourceHash:s}),p(u);break}case "fact.change":p({kind:"fact.change",key:e.key,prior:E(e.key,e.prev),next:E(e.key,e.next)});break;case "resolver.write.rejected":e.kind==="summary"?p({kind:"resolver.write.rejected",rejection:"summary",resolverId:e.resolver,requirementId:e.requirementId,reason:e.reason,dropped:e.dropped}):p({kind:"resolver.write.rejected",rejection:"rejection",resolverId:e.resolver,requirementId:e.requirementId,reason:e.reason,fact:e.fact,expected:E(e.fact,e.expected),actual:E(e.fact,e.actual)});break;case "resolver.complete":p({kind:"resolver.complete",resolverId:e.resolver,requirementId:e.requirementId,duration:e.duration});break;case "resolver.error":p({kind:"resolver.error",resolverId:e.resolver,requirementId:e.requirementId,error:String(e.error)});break;case "system.init":case "system.start":case "system.stop":case "system.destroy":p({kind:e.type});break;}}let v=false;function K(e){a=e,j(),w(),l=e.observe(M),r.onTruncate?.((n,s)=>{if(!v){v=true;try{p({kind:"system.truncated",droppedSeq:n,droppedCount:s});}finally{v=false;}}});}function H(){l&&(l(),l=null),a=null,f.clear(),g.clear(),k.clear();}let V={name:"audit-ledger",onInit(e){K(e);},onStop(){l&&(l(),l=null);},onDestroy(){H();},onDefinitionRegister(e,n){e==="constraint"&&w(),(e==="constraint"||e==="resolver"||e==="effect")&&j();},onDefinitionAssign(e,n){e==="constraint"&&w();},onDefinitionUnregister(e,n){e==="constraint"&&w();},onSnapshot(e){p({kind:"system.snapshot",snapshotId:e.id,trigger:e.trigger});},onHistoryNavigate(e,n){p({kind:"system.history.navigate",from:e,to:n});}};function J(e){if(e.__internal===void 0)return e;let n={...e};return delete n.__internal,n}function b(e){let n=false;for(let s of e)if(s.__internal!==void 0){n=true;break}return n?e.map(J):e}return {plugin:V,query:(e={})=>b(r.query(e)),recent:e=>b(r.recent(e)),forFact:(e,n)=>b(r.forFact(e,n)),forConstraint:(e,n)=>b(r.forConstraint(e,n)),toJSON:()=>{let e=r.toJSON();return {entries:b(e.entries),capturedAt:e.capturedAt}},verify(e){if(e?.strong===true)throw new Error("[Directive] verify({ strong: true }) is reserved for v2 \u2014 v1 ships sync djb2 chain only. Use verify() (sync) for tamper detection.");let{entries:n}=r.toJSON();if(n.length===0)return {valid:true,entryCount:0};let s=new Set,u=null;for(let c=0;c<n.length;c++){let h=n[c];if(h.prevHash!==u){let S=c>0?n[c-1]:null,I=h.kind==="system.entry-erased",O=S?.kind==="system.entry-erased";if(I||O){let q=[];I&&q.push(h),O&&S!==null&&q.push(S);let R=q.find(Q=>Q.__internal!==x);if(R)return {valid:false,brokenAt:c,expectedHash:u??"<genesis>",actualHash:h.prevHash??"<genesis>",entry:R,reason:"tombstone forgery detected \u2014 missing internal sentinel. A 'system.entry-erased' entry was written via sink.write() rather than ledger.erase(); rejected as tamper."};let z=I?h:S;s.add(z.seq),u=_(h);continue}return {valid:false,brokenAt:c,expectedHash:u??"<genesis>",actualHash:h.prevHash??"<genesis>",entry:h}}u=_(h);}let y={valid:true,entryCount:n.length};return s.size>0&&(y.erasedSeqs=[...s].sort((c,h)=>c-h)),y},erase(e){let n=Date.now(),s=0;if(typeof r.erase=="function"&&(s=r.erase(e,c=>{let h={seq:c.seq,ts:c.ts,kind:"system.entry-erased",prevHash:c.prevHash,hashAlgo:c.hashAlgo,schemaVersion:c.schemaVersion??F,originalKind:c.kind,erasedAt:n,__internal:x};return N(h),h})),s===0)return {erased:0,markerEntry:null};let u={factPath:e.factPath!==void 0,constraintId:e.constraintId!==void 0,kind:e.kind,changedBetween:e.changedBetween!==void 0?"[range]":void 0},y=p({kind:"system.subject-erased",filterHash:h(e),filterShape:u,erased:s});return {erased:s,markerEntry:y}},clear(){r.clear(),m=0,d=null;},destroy(){H(),r.destroy();}}}export{Y as a,ee as b};//# sourceMappingURL=chunk-PA6VC32N.js.map
+//# sourceMappingURL=chunk-PA6VC32N.js.map

package/dist/chunk-PA6VC32N.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/plugins/audit-ledger.ts"],"names":["HASH_ALGO","SCHEMA_VERSION","LEDGER_INTERNAL_TOKEN","replaceAtPath","root","dottedPath","value","segs","part","m","m2","cur","i","seg","lastSeg","freezeEntry","entry","key","v","clause","DEFAULT_MEMORY_CAPACITY","DEFAULT_QUERY_LIMIT","parseRangeBound","t","matchesFilter","filter","a","b","start","end","memorySink","opts","capacity","entries","truncateHandler","dropped","limit","out","e","n","path","opts2","id","tombstoneFactory","count","handler","syncHash","hashObject","hashForEntry","createAuditLedger","sink","capturePII","userRedact","seq","lastHashCache","system","unobserve","whenSpecCache","whenSourceCache","piiTaggedFacts","redactWhenSpec","spec","cloned","walkPredicate","factPath","op","_operand","operandPath","refreshWhenSpecCache","inspect","constraints","mergedDefs","c","def","whenFn","refreshPIITags","meta","tagged","redactValue","redactClauses","clauses","mutated","inner","emit","partial","finalEntry","onEvent","event","whenSpec","whenSourceHash","emittingTruncate","attach","sys","droppedSeq","droppedCount","detach","plugin","type","snapshot","from","to","stripInternal","clone","stripInternalAll","needsClone","snap","erasedSeqsSet","prevHash","prevEntry","entryIsTombstone","prevIsTombstone","candidates","forged","tombstoneEntry","result","erasedAt","tombstone","filterShape","markerEntry"],"mappings":"wEAwCA,IAAMA,CAAAA,CAAY,QAAA,CAOZC,CAAAA,CAAiB,CAAA,CAajBC,CAAAA,CAAuC,OAC3C,iCACF,CAAA,CAQA,SAASC,CAAAA,CAAcC,CAAAA,CAAeC,CAAAA,CAAoBC,EAAsB,CAC9E,GAAIF,CAAAA,GAAS,IAAA,EAAQ,OAAOA,CAAAA,EAAS,SAAU,OAG/C,IAAMG,CAAAA,CAA+B,EAAC,CACtC,IAAA,IAAWC,KAAQH,CAAAA,CAAW,KAAA,CAAM,GAAG,CAAA,CAAG,CACxC,GAAI,CAACG,CAAAA,CAAM,SAEX,IAAMC,CAAAA,CAAID,CAAAA,CAAK,KAAA,CAAM,iBAAiB,CAAA,CACtC,GAAIC,CAAAA,CAAG,CACLF,CAAAA,CAAK,IAAA,CAAK,OAAOE,CAAAA,CAAE,CAAC,CAAC,CAAC,CAAA,CAClBA,CAAAA,CAAE,CAAC,CAAA,EAAGF,CAAAA,CAAK,IAAA,CAAKE,CAAAA,CAAE,CAAC,CAAA,CAAE,QAAQ,KAAA,CAAO,EAAE,CAAC,CAAA,CAC3C,QACF,CAEA,IAAMC,CAAAA,CAAKF,CAAAA,CAAK,KAAA,CAAM,wBAAwB,CAAA,CAC9C,GAAIE,EAAI,CACNH,CAAAA,CAAK,IAAA,CAAKG,CAAAA,CAAG,CAAC,CAAE,EAChBH,CAAAA,CAAK,IAAA,CAAK,MAAA,CAAOG,CAAAA,CAAG,CAAC,CAAC,CAAC,CAAA,CACnBA,CAAAA,CAAG,CAAC,CAAA,EAAGH,CAAAA,CAAK,IAAA,CAAKG,EAAG,CAAC,CAAA,CAAE,OAAA,CAAQ,KAAA,CAAO,EAAE,CAAC,CAAA,CAC7C,QACF,CACAH,CAAAA,CAAK,IAAA,CAAKC,CAAI,EAChB,CAEA,IAAIG,CAAAA,CAAeP,CAAAA,CACnB,IAAA,IAASQ,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIL,EAAK,MAAA,CAAS,CAAA,CAAGK,CAAAA,EAAAA,CAAK,CACxC,IAAMC,CAAAA,CAAMN,EAAKK,CAAC,CAAA,CAClB,GAAID,CAAAA,GAAQ,IAAA,EAAQ,OAAOA,GAAQ,QAAA,CAAU,OAC7CA,CAAAA,CAAOA,CAAAA,CAAyCE,CAAG,EACrD,CACA,GAAIF,CAAAA,GAAQ,IAAA,EAAQ,OAAOA,CAAAA,EAAQ,QAAA,CAAU,OAC7C,IAAMG,CAAAA,CAAUP,CAAAA,CAAKA,CAAAA,CAAK,MAAA,CAAS,CAAC,EAChCO,CAAAA,GAAY,MAAA,GACfH,CAAAA,CAAyCG,CAAO,CAAA,CAAIR,CAAAA,EACvD,CAOA,SAASS,CAAAA,CAAYC,CAAAA,CAA+B,CAClD,IAAA,IAAWC,CAAAA,IAAO,MAAA,CAAO,KAAKD,CAAK,CAAA,CAAG,CACpC,IAAME,CAAAA,CAAKF,CAAAA,CAA6CC,CAAG,CAAA,CAC3D,GAAIC,CAAAA,GAAM,IAAA,EAAQ,OAAOA,CAAAA,EAAM,SAAU,CACvC,GAAI,KAAA,CAAM,OAAA,CAAQA,CAAC,CAAA,EAAKD,IAAQ,aAAA,CAC9B,IAAA,IAAWE,CAAAA,IAAUD,CAAAA,CACfC,CAAAA,GAAW,IAAA,EAAQ,OAAOA,CAAAA,EAAW,QAAA,EACvC,MAAA,CAAO,MAAA,CAAOA,CAAM,CAAA,CAI1B,OAAO,MAAA,CAAOD,CAAC,EACjB,CACF,CACA,OAAA,MAAA,CAAO,OAAOF,CAAK,CAAA,CAEZA,CACT,CAiPA,IAAMI,CAAAA,CAA0B,GAAA,CAC1BC,CAAAA,CAAsB,GAAA,CAE5B,SAASC,CAAAA,CAAgBJ,CAAAA,CAAmC,CAC1D,GAAIA,aAAa,IAAA,CAAM,OAAOA,CAAAA,CAAE,OAAA,EAAQ,CACxC,GAAI,OAAOA,CAAAA,EAAM,QAAA,CAAU,CACzB,GAAI,CAAC,MAAA,CAAO,SAASA,CAAC,CAAA,CACpB,MAAM,IAAI,KAAA,CACR,8FACF,EAGF,OAAOA,CACT,CACA,GAAI,OAAOA,CAAAA,EAAM,SAAU,CACzB,IAAMK,CAAAA,CAAI,IAAA,CAAK,KAAA,CAAML,CAAC,EACtB,GAAI,CAAC,MAAA,CAAO,QAAA,CAASK,CAAC,CAAA,CACpB,MAAM,IAAI,KAAA,CACR,CAAA,gDAAA,EAAmDL,CAAC,CAAA,qCAAA,CACtD,CAAA,CAGF,OAAOK,CACT,CACA,MAAM,IAAI,KAAA,CACR,uFACF,CACF,CAEA,SAASC,CAAAA,CAAcR,CAAAA,CAAmBS,CAAAA,CAA8B,CACtE,GAAIA,CAAAA,CAAO,IAAA,EAEL,CAAA,CADU,KAAA,CAAM,OAAA,CAAQA,CAAAA,CAAO,IAAI,CAAA,CAAIA,CAAAA,CAAO,IAAA,CAAO,CAACA,CAAAA,CAAO,IAAI,GAC1D,QAAA,CAAST,CAAAA,CAAM,IAAI,CAAA,CAAG,OAAO,MAAA,CAE1C,GAAIS,CAAAA,CAAO,QAAA,GAAa,MAAA,CAEtB,GAAIT,CAAAA,CAAM,IAAA,GAAS,eACjB,GAAIA,CAAAA,CAAM,GAAA,GAAQS,CAAAA,CAAO,QAAA,CAAU,OAAO,eACjCT,CAAAA,CAAM,IAAA,GAAS,yBAAA,CAAA,CACxB,GAAIA,CAAAA,CAAM,IAAA,GAASS,CAAAA,CAAO,QAAA,CAAU,OAAO,MAAA,CAAA,KAE3C,OAAO,MAAA,CAGX,GAAIA,CAAAA,CAAO,eAAiB,MAAA,GACtBT,CAAAA,CAAM,IAAA,GAAS,qBAAA,EACfA,CAAAA,CAAM,YAAA,GAAiBS,EAAO,YAAA,CAAA,CAAc,OAAO,MAAA,CAEzD,GAAIA,CAAAA,CAAO,cAAA,CAAgB,CACzB,GAAM,CAACC,CAAAA,CAAGC,CAAC,CAAA,CAAIF,CAAAA,CAAO,eAChBG,CAAAA,CAAQN,CAAAA,CAAgBI,CAAC,CAAA,CACzBG,CAAAA,CAAMP,CAAAA,CAAgBK,CAAC,CAAA,CAC7B,GAAIX,CAAAA,CAAM,EAAA,CAAKY,CAAAA,EAASZ,CAAAA,CAAM,GAAKa,CAAAA,CAAK,OAAO,MACjD,CAEA,OAAO,KACT,CAOO,SAASC,CAAAA,CACdC,CAAAA,CAA8B,EAAC,CACd,CACjB,IAAMC,CAAAA,CAAWD,CAAAA,CAAK,QAAA,EAAYX,CAAAA,CAC9Ba,CAAAA,CAAwB,EAAC,CACzBC,EAEO,IAAA,CAwEX,OAtE8B,CAC5B,KAAA,CAAMlB,CAAAA,CAAO,CACX,GAAIiB,CAAAA,CAAQ,MAAA,EAAUD,CAAAA,CAAU,CAM9B,IAAMG,CAAAA,CAAUF,EAAQ,CAAC,CAAA,CACzBC,CAAAA,GAAkBC,CAAAA,CAAQ,GAAA,CAAK,CAAC,EAChCF,CAAAA,CAAQ,KAAA,GACV,CAIA,IAHAA,CAAAA,CAAQ,KAAKjB,CAAK,CAAA,CAGXiB,CAAAA,CAAQ,MAAA,CAASD,CAAAA,EACtBC,CAAAA,CAAQ,QAEZ,CAAA,CACA,KAAA,CAAMR,CAAAA,CAAQ,CACZ,IAAMW,EAAQX,CAAAA,CAAO,KAAA,EAASJ,CAAAA,CACxBgB,CAAAA,CAAoB,EAAC,CAC3B,IAAA,IAASzB,CAAAA,CAAIqB,CAAAA,CAAQ,MAAA,CAAS,CAAA,CAAGrB,CAAAA,EAAK,CAAA,CAAGA,CAAAA,EAAAA,CAAK,CAC5C,IAAM0B,CAAAA,CAAIL,CAAAA,CAAQrB,CAAC,CAAA,CACnB,GAAIY,EAAcc,CAAAA,CAAGb,CAAM,CAAA,GACzBY,CAAAA,CAAI,IAAA,CAAKC,CAAC,EACND,CAAAA,CAAI,MAAA,EAAUD,CAAAA,CAAAA,CAAO,KAE7B,CAEA,OAAOC,CACT,CAAA,CACA,MAAA,CAAOE,CAAAA,CAAG,CACR,IAAMX,CAAAA,CAAQ,KAAK,GAAA,CAAI,CAAA,CAAGK,CAAAA,CAAQ,MAAA,CAASM,CAAC,CAAA,CAE5C,OAAON,CAAAA,CAAQ,KAAA,CAAML,CAAK,CAC5B,CAAA,CACA,OAAA,CAAQY,EAAMC,CAAAA,CAAQ,EAAC,CAAG,CACxB,OAAO,IAAA,CAAK,MAAM,CAAE,QAAA,CAAUD,CAAAA,CAAM,KAAA,CAAOC,CAAAA,CAAM,KAAM,CAAC,CAC1D,CAAA,CACA,aAAA,CAAcC,CAAAA,CAAID,CAAAA,CAAQ,GAAI,CAC5B,OAAO,IAAA,CAAK,KAAA,CAAM,CAAE,YAAA,CAAcC,EAAI,KAAA,CAAOD,CAAAA,CAAM,KAAM,CAAC,CAC5D,CAAA,CACA,QAAS,CACP,OAAO,CAAE,OAAA,CAASR,CAAAA,CAAQ,KAAA,GAAS,UAAA,CAAY,IAAA,CAAK,GAAA,EAAM,CAC5D,CAAA,CACA,OAAQ,CACNA,CAAAA,CAAU,GACZ,CAAA,CACA,OAAA,EAAU,CACRA,CAAAA,CAAU,EAAC,CACXC,CAAAA,CAAkB,KACpB,CAAA,CACA,KAAA,CAAMT,CAAAA,CAAQkB,CAAAA,CAAkB,CAC9B,IAAIC,CAAAA,CAAQ,CAAA,CACZ,IAAA,IAAShC,EAAI,CAAA,CAAGA,CAAAA,CAAIqB,CAAAA,CAAQ,MAAA,CAAQrB,CAAAA,EAAAA,CAAK,CACvC,IAAM0B,CAAAA,CAAIL,CAAAA,CAAQrB,CAAC,CAAA,CACfY,CAAAA,CAAcc,CAAAA,CAAGb,CAAM,CAAA,GACzBQ,CAAAA,CAAQrB,CAAC,CAAA,CAAI+B,CAAAA,CAAiBL,CAAC,EAC/BM,CAAAA,EAAAA,EAEJ,CAEA,OAAOA,CACT,CAAA,CACA,UAAA,CAAWC,EAAS,CAClBX,CAAAA,CAAkBW,EACpB,CACF,CAGF,CAuBA,SAASC,CAAAA,CAAS9B,CAAAA,CAA2B,CAG3C,OAAO+B,CAAAA,CAAW/B,CAAK,CACzB,CAUA,SAASgC,CAAAA,CAAahC,CAAAA,CAA2B,CAC/C,GAAQA,CAAAA,CAAM,QAAA,GACP,QAAA,CACH,OAAO8B,CAAAA,CAAS9B,CAAK,CAAA,CAErB,MAAM,IAAI,KAAA,CACR,CAAA,4CAAA,EAA+C,MAAA,CAAQA,CAAAA,CAAgC,QAAQ,CAAC,kBAAkBA,CAAAA,CAAM,GAAG,CAAA,4DAAA,CAC7H,CAEN,CA+GO,SAASiC,GACdlB,CAAAA,CAA2B,EAAC,CACf,CACb,IAAMmB,CAAAA,CAAOnB,EAAK,IAAA,EAAQD,CAAAA,EAAW,CAC/BqB,GAAAA,CAAapB,CAAAA,CAAK,UAAA,EAAc,MAChCqB,CAAAA,CAAarB,CAAAA,CAAK,MAAA,CAEpBsB,CAAAA,CAAM,CAAA,CACNC,CAAAA,CAA+B,KAE/BC,CAAAA,CAAsC,IAAA,CACtCC,CAAAA,CAAiC,IAAA,CAQ/BC,CAAAA,CAAgB,IAAI,IAcpBC,CAAAA,CAAkB,IAAI,GAAA,CAGtBC,CAAAA,CAAiB,IAAI,GAAA,CAS3B,SAASC,CAAAA,CAAeC,CAAAA,CAAwB,CAE9C,GADIV,GAAAA,EAAcQ,CAAAA,CAAe,IAAA,GAAS,GACtCE,CAAAA,GAAS,IAAA,EAAQ,OAAOA,CAAAA,EAAS,QAAA,CAAU,OAAOA,EAKtD,IAAIC,CAAAA,CACJ,GAAI,CACFA,CAAAA,CAAS,IAAA,CAAK,MAAM,IAAA,CAAK,SAAA,CAAUD,CAAI,CAAC,EAC1C,CAAA,KAAQ,CAEN,OAAOA,CACT,CAEA,OAAAE,CAAAA,CAAcD,CAAAA,CAAQ,CACpB,QAAA,CAASE,CAAAA,CAAUC,CAAAA,CAAIC,CAAAA,CAAUC,CAAAA,CAAa,CACvCR,EAAe,GAAA,CAAIK,CAAQ,CAAA,EAEhC7D,CAAAA,CAAc2D,CAAAA,CAAQK,CAAAA,CAAa,YAAY,EAEjD,CAAA,CACA,OAAA,CAAQH,CAAAA,CAAU,CACXL,CAAAA,CAAe,GAAA,CAAIK,CAAQ,CAAA,EAEhC7D,CAAAA,CAAc2D,CAAAA,CAAQE,CAAAA,CAAU,YAAY,EAC9C,CACF,CAAC,CAAA,CAEMF,CACT,CAEA,SAASM,CAAAA,EAA6B,CAGpC,GAFAX,CAAAA,CAAc,KAAA,EAAM,CACpBC,CAAAA,CAAgB,KAAA,GACZ,CAAA,CAACH,CAAAA,CACL,GAAI,CACF,IAAMc,CAAAA,CACJd,EASA,OAAA,CACF,GAAI,OAAOc,CAAAA,EAAY,UAAA,CAAY,OAEnC,IAAMC,CAAAA,CADaD,CAAAA,EAAQ,EACK,WAAA,EAAe,EAAC,CAG1CE,EACJhB,CAAAA,CAKA,SAAA,EAAW,iBAAA,CACb,IAAA,IAAWiB,CAAAA,IAAKF,CAAAA,CACd,GAAIE,CAAAA,CAAE,QAAA,GAAa,KAAA,CAAA,CAGjBf,CAAAA,CAAc,GAAA,CACZe,CAAAA,CAAE,EAAA,CACFZ,CAAAA,CAAeY,CAAAA,CAAE,QAAQ,CAC3B,CAAA,CAAA,KACK,CAML,IAAMC,EAAMF,CAAAA,GAAaC,CAAAA,CAAE,EAAE,CAAA,CACvBE,GAAAA,CAASD,CAAAA,EAAO,OAAOA,CAAAA,CAAI,IAAA,EAAS,UAAA,CAAaA,CAAAA,CAAI,IAAA,CAAO,KAAA,CAAA,CAC9DC,IACFhB,CAAAA,CAAgB,GAAA,CAAIc,CAAAA,CAAE,EAAA,CAAIzB,CAAAA,CAAW,MAAA,CAAO2B,GAAM,CAAC,CAAC,CAAA,CAC3CF,CAAAA,CAAE,IAAA,GAAS,KAAA,CAAA,EAAa,OAAOA,CAAAA,CAAE,IAAA,EAAS,UAAA,CACnDd,CAAAA,CAAgB,GAAA,CAAIc,CAAAA,CAAE,GAAIzB,CAAAA,CAAW,MAAA,CAAOyB,CAAAA,CAAE,IAAI,CAAC,CAAC,EAMpDd,CAAAA,CAAgB,GAAA,CAAIc,CAAAA,CAAE,EAAA,CAAIzB,CAAAA,CAAW,YAAY,CAAC,EAEtD,CAEJ,CAAA,KAAQ,CAER,CACF,CAEA,SAAS4B,GAAuB,CAE9B,GADAhB,CAAAA,CAAe,KAAA,EAAM,CACjB,EAAAR,KAAc,CAACI,CAAAA,CAAAA,CACnB,GAAI,CACF,IAAMqB,CAAAA,CAAQrB,EAAyE,IAAA,CACvF,GAAI,CAACqB,CAAAA,EAAQ,OAAOA,CAAAA,CAAK,OAAU,UAAA,CAAY,OAC/C,IAAMC,CAAAA,CAASD,CAAAA,CAAK,KAAA,CAAM,KAAK,CAAA,EAAK,EAAC,CACrC,IAAA,IAAWnE,CAAAA,IAAKoE,CAAAA,CACdlB,EAAe,GAAA,CAAIlD,CAAAA,CAAE,EAAE,EAE3B,CAAA,KAAQ,CAER,CACF,CAEA,SAASqE,CAAAA,CAAYd,CAAAA,CAAkB1D,CAAAA,CAAyB,CAC9D,OAAI6C,GAAAA,CAAmB7C,CAAAA,CACnBqD,CAAAA,CAAe,GAAA,CAAIK,CAAQ,CAAA,CAAU,YAAA,CAElC1D,CACT,CAEA,SAASyE,CAAAA,CACPC,CAAAA,CAC4B,CAE5B,GADI,CAACA,CAAAA,EACD7B,GAAAA,EAAcQ,CAAAA,CAAe,IAAA,GAAS,CAAA,CAAG,OAAOqB,EACpD,IAAIC,CAAAA,CAAU,KAAA,CACR5C,CAAAA,CAAsB2C,CAAAA,CAAQ,GAAA,CAAKR,GAAM,CAC7C,GAAIb,CAAAA,CAAe,GAAA,CAAIa,CAAAA,CAAE,IAAI,EAC3B,OAAAS,CAAAA,CAAU,IAAA,CACH,CAAE,GAAGT,CAAAA,CAAG,OAAQ,YAAa,CAAA,CAGtC,GAAIA,CAAAA,CAAE,QAAA,CAAU,CACd,IAAMU,CAAAA,CAAQH,CAAAA,CAAcP,CAAAA,CAAE,QAAQ,CAAA,CACtC,GAAIU,IAAUV,CAAAA,CAAE,QAAA,CACd,OAAAS,CAAAA,CAAU,IAAA,CACH,CAAE,GAAGT,CAAAA,CAAG,QAAA,CAAUU,CAAM,CAEnC,CAEA,OAAOV,CACT,CAAC,CAAA,CAED,OAAOS,CAAAA,CAAU5C,CAAAA,CAAM2C,CACzB,CAaA,SAASG,CAAAA,CAAKC,CAAAA,CAA8C,CAC1D,IAAMpE,CAAAA,CAAQ,CACZ,GAAGoE,CAAAA,CACH,GAAA,CAAK/B,CAAAA,EAAAA,CACL,EAAA,CAAI,IAAA,CAAK,KAAI,CACb,QAAA,CAAUC,CAAAA,CACV,QAAA,CAAUtD,CAAAA,CACV,aAAA,CAAeC,CACjB,CAAA,CAEMoF,CAAAA,CAAajC,CAAAA,CAAaA,CAAAA,CAAWpC,CAAK,CAAA,CAAIA,EACpD,OAAAD,CAAAA,CAAYsE,CAAU,CAAA,CACtBnC,CAAAA,CAAK,KAAA,CAAMmC,CAAU,CAAA,CAKrB/B,CAAAA,CAAgBN,CAAAA,CAAaqC,CAAU,CAAA,CAEhCA,CACT,CAEA,SAASC,CAAAA,CAAQC,CAAAA,CAA+B,CAC9C,OAAQA,CAAAA,CAAM,IAAA,EACZ,KAAK,qBAAA,CAAuB,CAC1B,IAAMC,CAAAA,CAAW/B,CAAAA,CAAc,IAAI8B,CAAAA,CAAM,EAAE,CAAA,CACrCE,CAAAA,CAAiB/B,CAAAA,CAAgB,GAAA,CAAI6B,EAAM,EAAE,CAAA,CAC7CH,CAAAA,CAAmC,CACvC,IAAA,CAAM,qBAAA,CACN,aAAcG,CAAAA,CAAM,EAAA,CACpB,MAAA,CAAQA,CAAAA,CAAM,MAAA,CACd,WAAA,CAAaR,EAAcQ,CAAAA,CAAM,WAAW,CAC9C,CAAA,CACIC,CAAAA,GAAa,MAAA,CACfJ,EAAQ,QAAA,CAAWI,CAAAA,CACVC,CAAAA,GAAmB,MAAA,GAI5BL,CAAAA,CAAQ,UAAA,CAAa,CACnB,IAAA,CAAM,UAAA,CACN,UAAA,CAAYK,CACd,CAAA,CAAA,CAEFN,CAAAA,CAAKC,CAAO,EACZ,KACF,CACA,KAAK,aAAA,CACHD,CAAAA,CAAK,CACH,KAAM,aAAA,CACN,GAAA,CAAKI,CAAAA,CAAM,GAAA,CACX,KAAA,CAAOT,CAAAA,CAAYS,EAAM,GAAA,CAAKA,CAAAA,CAAM,IAAI,CAAA,CACxC,IAAA,CAAMT,CAAAA,CAAYS,EAAM,GAAA,CAAKA,CAAAA,CAAM,IAAI,CACzC,CAAC,CAAA,CACD,MACF,KAAK,yBAAA,CACCA,CAAAA,CAAM,IAAA,GAAS,SAAA,CACjBJ,CAAAA,CAAK,CACH,IAAA,CAAM,yBAAA,CACN,SAAA,CAAW,SAAA,CACX,UAAA,CAAYI,CAAAA,CAAM,SAClB,aAAA,CAAeA,CAAAA,CAAM,aAAA,CACrB,MAAA,CAAQA,CAAAA,CAAM,MAAA,CACd,OAAA,CAASA,CAAAA,CAAM,OACjB,CAAC,CAAA,CAEDJ,CAAAA,CAAK,CACH,IAAA,CAAM,0BACN,SAAA,CAAW,WAAA,CACX,UAAA,CAAYI,CAAAA,CAAM,QAAA,CAClB,aAAA,CAAeA,EAAM,aAAA,CACrB,MAAA,CAAQA,CAAAA,CAAM,MAAA,CACd,IAAA,CAAMA,CAAAA,CAAM,KACZ,QAAA,CAAUT,CAAAA,CAAYS,CAAAA,CAAM,IAAA,CAAMA,CAAAA,CAAM,QAAQ,EAChD,MAAA,CAAQT,CAAAA,CAAYS,CAAAA,CAAM,IAAA,CAAMA,CAAAA,CAAM,MAAM,CAC9C,CAAC,CAAA,CAEH,MACF,KAAK,mBAAA,CACHJ,CAAAA,CAAK,CACH,IAAA,CAAM,mBAAA,CACN,UAAA,CAAYI,CAAAA,CAAM,QAAA,CAClB,aAAA,CAAeA,EAAM,aAAA,CACrB,QAAA,CAAUA,CAAAA,CAAM,QAClB,CAAC,CAAA,CACD,MACF,KAAK,gBAAA,CACHJ,CAAAA,CAAK,CACH,IAAA,CAAM,gBAAA,CACN,WAAYI,CAAAA,CAAM,QAAA,CAClB,aAAA,CAAeA,CAAAA,CAAM,aAAA,CACrB,KAAA,CAAO,OAAOA,CAAAA,CAAM,KAAK,CAC3B,CAAC,CAAA,CACD,MACF,KAAK,aAAA,CACL,KAAK,cAAA,CACL,KAAK,aAAA,CACL,KAAK,iBACHJ,CAAAA,CAAK,CAAE,IAAA,CAAMI,CAAAA,CAAM,IAAK,CAAC,EACzB,MAOJ,CACF,CAOA,IAAIG,EAAmB,KAAA,CAEvB,SAASC,CAAAA,CAAOC,CAAAA,CAAiC,CAC/CrC,CAAAA,CAASqC,EACTjB,CAAAA,EAAe,CACfP,CAAAA,EAAqB,CACrBZ,CAAAA,CAAYoC,CAAAA,CAAI,OAAA,CAAQN,CAAO,CAAA,CAK/BpC,CAAAA,CAAK,UAAA,GAAa,CAAC2C,CAAAA,CAAYC,CAAAA,GAAiB,CAC9C,GAAI,CAAAJ,CAAAA,CACJ,CAAAA,CAAAA,CAAmB,IAAA,CACnB,GAAI,CACFP,CAAAA,CAAK,CACH,IAAA,CAAM,kBAAA,CACN,UAAA,CAAAU,EACA,YAAA,CAAAC,CACF,CAAC,EACH,CAAA,OAAE,CACAJ,EAAmB,MACrB,CAAA,CACF,CAAC,EACH,CAEA,SAASK,GAAe,CAClBvC,CAAAA,GACFA,CAAAA,EAAU,CACVA,CAAAA,CAAY,IAAA,CAAA,CAEdD,EAAS,IAAA,CACTE,CAAAA,CAAc,KAAA,EAAM,CACpBC,CAAAA,CAAgB,KAAA,GAChBC,CAAAA,CAAe,KAAA,GACjB,CAEA,IAAMqC,CAAAA,CAA+B,CACnC,IAAA,CAAM,cAAA,CACN,MAAA,CAAOJ,CAAAA,CAAK,CACVD,CAAAA,CAAOC,CAA2B,EACpC,CAAA,CACA,MAAA,EAAS,CAGHpC,CAAAA,GACFA,CAAAA,EAAU,CACVA,EAAY,IAAA,EAEhB,CAAA,CACA,SAAA,EAAY,CACVuC,CAAAA,GACF,EACA,oBAAA,CAAqBE,CAAAA,CAAMvD,CAAAA,CAAI,CACzBuD,CAAAA,GAAS,YAAA,EAAc7B,GAAqB,CAAA,CAC5C6B,CAAAA,GAAS,YAAA,EAAgBA,CAAAA,GAAS,UAAA,EAAcA,CAAAA,GAAS,WAG3DtB,CAAAA,GAGJ,CAAA,CACA,kBAAA,CAAmBsB,CAAAA,CAAMvD,CAAAA,CAAI,CAGvBuD,CAAAA,GAAS,YAAA,EAAc7B,CAAAA,GAE7B,CAAA,CACA,sBAAA,CAAuB6B,EAAMvD,CAAAA,CAAI,CAC3BuD,CAAAA,GAAS,YAAA,EAAc7B,CAAAA,GAE7B,CAAA,CACA,UAAA,CAAW8B,CAAAA,CAAU,CAInBf,CAAAA,CAAK,CACH,IAAA,CAAM,iBAAA,CACN,WAAYe,CAAAA,CAAS,EAAA,CACrB,OAAA,CAASA,CAAAA,CAAS,OACpB,CAAC,EACH,CAAA,CACA,iBAAA,CAAkBC,CAAAA,CAAMC,CAAAA,CAAI,CAE1BjB,CAAAA,CAAK,CACH,IAAA,CAAM,yBAAA,CACN,IAAA,CAAAgB,CAAAA,CACA,EAAA,CAAAC,CACF,CAAC,EACH,CACF,CAAA,CAQA,SAASC,CAAAA,CAAcrF,CAAAA,CAA+B,CACpD,GACGA,CAAAA,CAAgD,UAAA,GAAe,MAAA,CAEhE,OAAOA,CAAAA,CAET,IAAMsF,CAAAA,CAAQ,CAAE,GAAGtF,CAAM,CAAA,CACzB,OAAA,OAAOsF,EAAM,UAAA,CAENA,CACT,CAEA,SAASC,CAAAA,CACPtE,CAAAA,CACuB,CAGvB,IAAIuE,CAAAA,CAAa,KAAA,CACjB,IAAA,IAAWlE,CAAAA,IAAKL,CAAAA,CACd,GAAKK,CAAAA,CAA4C,UAAA,GAAe,MAAA,CAAW,CACzEkE,CAAAA,CAAa,IAAA,CACb,KACF,CAEF,OAAKA,CAAAA,CAIEvE,CAAAA,CAAQ,GAAA,CAAIoE,CAAa,EAHvBpE,CAIX,CAEA,OAAO,CACL,MAAA,CAAA+D,CAAAA,CACA,MAAO,CAACvE,CAAAA,CAAS,EAAC,GAAM8E,CAAAA,CAAiBrD,CAAAA,CAAK,MAAMzB,CAAM,CAAC,CAAA,CAC3D,MAAA,CAASc,CAAAA,EAAMgE,CAAAA,CAAiBrD,EAAK,MAAA,CAAOX,CAAC,CAAC,CAAA,CAC9C,OAAA,CAAS,CAACC,EAAMC,CAAAA,GAAU8D,CAAAA,CAAiBrD,CAAAA,CAAK,OAAA,CAAQV,CAAAA,CAAMC,CAAK,CAAC,CAAA,CACpE,aAAA,CAAe,CAACC,CAAAA,CAAID,CAAAA,GAClB8D,CAAAA,CAAiBrD,CAAAA,CAAK,cAAcR,CAAAA,CAAID,CAAK,CAAC,CAAA,CAChD,MAAA,CAAQ,IAAM,CACZ,IAAMgE,CAAAA,CAAOvD,CAAAA,CAAK,MAAA,EAAO,CAEzB,OAAO,CACL,OAAA,CAASqD,CAAAA,CAAiBE,CAAAA,CAAK,OAAO,CAAA,CACtC,UAAA,CAAYA,EAAK,UACnB,CACF,CAAA,CACA,MAAA,CAAO1E,CAAAA,CAA2C,CAKhD,GAAIA,CAAAA,EAAM,MAAA,GAAW,IAAA,CACnB,MAAM,IAAI,KAAA,CACR,yIACF,CAAA,CAGF,GAAM,CAAE,OAAA,CAAAE,CAAQ,CAAA,CAAIiB,EAAK,MAAA,EAAO,CAChC,GAAIjB,CAAAA,CAAQ,MAAA,GAAW,CAAA,CACrB,OAAO,CAAE,KAAA,CAAO,IAAA,CAAM,UAAA,CAAY,CAAE,CAAA,CAqBtC,IAAMyE,EAAgB,IAAI,GAAA,CACtBC,CAAAA,CAA0B,IAAA,CAC9B,IAAA,IAAS/F,CAAAA,CAAI,EAAGA,CAAAA,CAAIqB,CAAAA,CAAQ,MAAA,CAAQrB,CAAAA,EAAAA,CAAK,CACvC,IAAMI,EAAQiB,CAAAA,CAAQrB,CAAC,CAAA,CACvB,GAAII,CAAAA,CAAM,QAAA,GAAa2F,EAAU,CAK/B,IAAMC,CAAAA,CAAYhG,CAAAA,CAAI,CAAA,CAAIqB,CAAAA,CAAQrB,EAAI,CAAC,CAAA,CAAK,IAAA,CACtCiG,CAAAA,CAAmB7F,CAAAA,CAAM,IAAA,GAAS,sBAClC8F,CAAAA,CAAkBF,CAAAA,EAAW,IAAA,GAAS,qBAAA,CAE5C,GAAIC,CAAAA,EAAoBC,EAAiB,CAGvC,IAAMC,CAAAA,CAA2B,EAAC,CAC9BF,CAAAA,EAAkBE,CAAAA,CAAW,IAAA,CAAK/F,CAAK,CAAA,CACvC8F,CAAAA,EAAmBF,CAAAA,GAAc,IAAA,EACnCG,CAAAA,CAAW,KAAKH,CAAS,CAAA,CAE3B,IAAMI,CAAAA,CAASD,CAAAA,CAAW,IAAA,CACvBzE,GACEA,CAAAA,CAA4C,UAAA,GAC7CpC,CACJ,CAAA,CACA,GAAI8G,CAAAA,CACF,OAAO,CACL,KAAA,CAAO,KAAA,CACP,QAAA,CAAUpG,CAAAA,CACV,YAAA,CAAc+F,GAAY,WAAA,CAC1B,UAAA,CAAY3F,CAAAA,CAAM,QAAA,EAAY,WAAA,CAC9B,KAAA,CAAOgG,EACP,MAAA,CACE,yKACJ,CAAA,CAKF,IAAMC,CAAAA,CAAiBJ,CAAAA,CAAmB7F,EAAQ4F,CAAAA,CAClDF,CAAAA,CAAc,GAAA,CAAIO,CAAAA,CAAe,GAAG,CAAA,CACpCN,EAAW3D,CAAAA,CAAahC,CAAK,CAAA,CAE7B,QACF,CAEA,OAAO,CACL,KAAA,CAAO,KAAA,CACP,QAAA,CAAUJ,CAAAA,CACV,YAAA,CAAc+F,CAAAA,EAAY,WAAA,CAC1B,WAAY3F,CAAAA,CAAM,QAAA,EAAY,WAAA,CAC9B,KAAA,CAAAA,CACF,CACF,CACA2F,CAAAA,CAAW3D,CAAAA,CAAahC,CAAK,EAC/B,CAEA,IAAMkG,EAIF,CACF,KAAA,CAAO,IAAA,CACP,UAAA,CAAYjF,CAAAA,CAAQ,MACtB,EACA,OAAIyE,CAAAA,CAAc,IAAA,CAAO,CAAA,GACvBQ,CAAAA,CAAO,UAAA,CAAa,CAAC,GAAGR,CAAa,CAAA,CAAE,IAAA,CAAK,CAAChF,CAAAA,CAAGC,IAAMD,CAAAA,CAAIC,CAAC,CAAA,CAAA,CAGtDuF,CACT,CAAA,CACA,KAAA,CAAMzF,EAAQ,CAGZ,IAAM0F,CAAAA,CAAW,IAAA,CAAK,GAAA,EAAI,CACtBvE,CAAAA,CAAQ,CAAA,CAuCZ,GAtCI,OAAOM,CAAAA,CAAK,KAAA,EAAU,UAAA,GACxBN,CAAAA,CAAQM,EAAK,KAAA,CAAMzB,CAAAA,CAASa,CAAAA,EAAM,CAUhC,IAAM8E,CAAAA,CAAY,CAChB,GAAA,CAAK9E,CAAAA,CAAE,GAAA,CACP,EAAA,CAAIA,CAAAA,CAAE,EAAA,CACN,KAAM,qBAAA,CACN,QAAA,CAAUA,CAAAA,CAAE,QAAA,CACZ,QAAA,CAAUA,CAAAA,CAAE,SACZ,aAAA,CACGA,CAAAA,CACE,aAAA,EAAiBrC,CAAAA,CACtB,YAAA,CAAcqC,CAAAA,CAAE,KAChB,QAAA,CAAA6E,CAAAA,CACA,UAAA,CAAYjH,CACd,CAAA,CAMA,OAAAa,EAAYqG,CAAS,CAAA,CAEdA,CACT,CAAC,CAAA,CAAA,CAMCxE,CAAAA,GAAU,EACZ,OAAO,CAAE,MAAA,CAAQ,CAAA,CAAG,WAAA,CAAa,IAAK,CAAA,CAMxC,IAAMyE,CAAAA,CAAc,CAClB,QAAA,CAAU5F,CAAAA,CAAO,QAAA,GAAa,MAAA,CAC9B,aAAcA,CAAAA,CAAO,YAAA,GAAiB,MAAA,CACtC,IAAA,CAAMA,CAAAA,CAAO,IAAA,CACb,eACEA,CAAAA,CAAO,cAAA,GAAmB,MAAA,CACrB,SAAA,CACD,MACR,CAAA,CAGM6F,EAAcnC,CAAAA,CAAK,CACvB,IAAA,CAAM,uBAAA,CACN,UAAA,CAAYpC,CAAAA,CAAWtB,CAAM,CAAA,CAC7B,WAAA,CAAA4F,CAAAA,CACA,MAAA,CAAQzE,CACV,CAAC,EAED,OAAO,CAAE,MAAA,CAAQA,CAAAA,CAAO,WAAA,CAAA0E,CAAY,CACtC,CAAA,CACA,KAAA,EAAQ,CACNpE,CAAAA,CAAK,KAAA,EAAM,CACXG,EAAM,CAAA,CACNC,CAAAA,CAAgB,KAClB,CAAA,CACA,OAAA,EAAU,CACRyC,CAAAA,EAAO,CACP7C,CAAAA,CAAK,OAAA,GACP,CACF,CACF","file":"chunk-PA6VC32N.js","sourcesContent":["/**\n * createAuditLedger — append-only, queryable, hash-chained\n * (djb2; SHA-256 reserved for v2) audit of every state change. For\n * forensics and \"show me why this user got that decision.\"\n *\n * Captures (per observation event):\n *\n *   - `constraint.evaluate` → { whenSpec, whenExplain, active, whenSource? }\n *   - `resolver.write.rejected` (rejection + summary kinds)\n *   - `fact.change` → { key, prior, next }\n *   - `resolver.complete` → { resolverId, requirementId, duration }\n *   - `system.init` / `system.start` / `system.stop` / `system.destroy`\n *   - `system.snapshot` / `system.history.navigate` (lifecycle markers)\n *   - `system.truncated` (ring-buffer overflow marker)\n *   - `system.entry-erased` / `system.subject-erased` (GDPR Art.17 stub)\n *\n * Hash chain: each entry stores `prevHash` — the djb2 (`hashObject`)\n * hash of the previous entry's stable-stringified payload. Tampering\n * with any entry's payload breaks the next entry's `prevHash` link —\n * visible in `verify()`. v1 ships sync djb2 only; `verify({ strong: true })`\n * is reserved for v2 (SHA-256) and throws today.\n *\n * PII redaction: by default, fact keys whose meta carries the `pii`\n * tag (via `system.meta.byTag(\"pii\")`) have their values replaced with\n * `\"[redacted]\"` in `whenExplain.actual`, `fact.change.prior`,\n * `fact.change.next`, and the cached `whenSpec` operands. Opt out with\n * `capturePII: true`.\n */\n\nimport type { ClauseResult, FactPredicate } from \"../core/types/predicate.js\";\nimport type {\n  ModuleSchema,\n  ObservationEvent,\n  Plugin,\n  System,\n} from \"../core/types.js\";\nimport { walkPredicate } from \"../core/predicate.js\";\nimport { hashObject } from \"../utils/utils.js\";\n\n/** Hash algorithm tag — bumped if canonicalization or hash function changes. */\nconst HASH_ALGO = \"djb2-1\" as const;\n\n/**\n * Entry schema version. Bumped if `AuditEntry` field shape changes in\n * a way that breaks back-compat parsers. Persisted on every entry so\n * exports remain self-describing across library upgrades. (F-5)\n */\nconst SCHEMA_VERSION = 1 as const;\n\n/**\n * Private sentinel stamped onto tombstone entries by {@link createAuditLedger.erase}.\n * Never exported, never serialized — `verify()` checks for it before\n * accepting a `system.entry-erased` entry as a legitimate chain break.\n *\n * (N7) Without this, a caller holding a raw `AuditLedgerSink` reference\n * could write `{ kind: \"system.entry-erased\", … }` directly into the\n * sink to mask real tampering as legitimate erasure. The sentinel\n * raises the bar so only the in-process ledger plugin (which lives in\n * this module's closure) can mint a valid tombstone.\n */\nconst LEDGER_INTERNAL_TOKEN: unique symbol = Symbol(\n  \"directive.audit-ledger.internal\",\n);\n\n/**\n * Navigate `root` to `dottedPath` (`foo.bar.$eq`, `foo[0].value`) and\n * replace the value at the leaf. Used by `redactWhenSpec` to scrub\n * PII operands in cached predicate specs. Best-effort: silently no-ops\n * if the path doesn't resolve (caller already cloned the spec).\n */\nfunction replaceAtPath(root: unknown, dottedPath: string, value: unknown): void {\n  if (root === null || typeof root !== \"object\") return;\n  // Split on \".\" but treat \"[N]\" segments as array indices.\n  // E.g. \"[0].value\" → [\"[0]\", \"value\"], \"foo.bar[1]\" → [\"foo\", \"bar[1]\"].\n  const segs: Array<string | number> = [];\n  for (const part of dottedPath.split(\".\")) {\n    if (!part) continue;\n    // Pull leading `[N]` if present.\n    const m = part.match(/^\\[(\\d+)\\](.*)$/);\n    if (m) {\n      segs.push(Number(m[1]));\n      if (m[2]) segs.push(m[2].replace(/^\\./, \"\"));\n      continue;\n    }\n    // Trailing `[N]` on the segment.\n    const m2 = part.match(/^([^[]+)\\[(\\d+)\\](.*)$/);\n    if (m2) {\n      segs.push(m2[1]!);\n      segs.push(Number(m2[2]));\n      if (m2[3]) segs.push(m2[3].replace(/^\\./, \"\"));\n      continue;\n    }\n    segs.push(part);\n  }\n\n  let cur: unknown = root;\n  for (let i = 0; i < segs.length - 1; i++) {\n    const seg = segs[i]!;\n    if (cur === null || typeof cur !== \"object\") return;\n    cur = (cur as Record<string | number, unknown>)[seg];\n  }\n  if (cur === null || typeof cur !== \"object\") return;\n  const lastSeg = segs[segs.length - 1];\n  if (lastSeg === undefined) return;\n  (cur as Record<string | number, unknown>)[lastSeg] = value;\n}\n\n/**\n * Depth-2 freeze: freeze the entry, freeze each top-level value, and\n * freeze each clause in `whenExplain`. Cycle-safe + cheap; prevents\n * in-process payload mutation that would forge the chain. (C3)\n */\nfunction freezeEntry(entry: AuditEntry): AuditEntry {\n  for (const key of Object.keys(entry)) {\n    const v = (entry as unknown as Record<string, unknown>)[key];\n    if (v !== null && typeof v === \"object\") {\n      if (Array.isArray(v) && key === \"whenExplain\") {\n        for (const clause of v) {\n          if (clause !== null && typeof clause === \"object\") {\n            Object.freeze(clause);\n          }\n        }\n      }\n      Object.freeze(v);\n    }\n  }\n  Object.freeze(entry);\n\n  return entry;\n}\n\n// ============================================================================\n// AuditEntry types\n// ============================================================================\n\nexport type AuditEntryKind =\n  | \"constraint.evaluate\"\n  | \"resolver.write.rejected\"\n  | \"fact.change\"\n  | \"resolver.complete\"\n  | \"resolver.error\"\n  | \"system.init\"\n  | \"system.start\"\n  | \"system.stop\"\n  | \"system.destroy\"\n  | \"system.snapshot\"\n  | \"system.history.navigate\"\n  | \"system.truncated\"\n  | \"system.entry-erased\"\n  | \"system.subject-erased\";\n\ninterface AuditEntryBase {\n  /** Monotonic sequence number, starting at 0. */\n  readonly seq: number;\n  /** Wall-clock timestamp (ms epoch). */\n  readonly ts: number;\n  /** Discriminator. */\n  readonly kind: AuditEntryKind;\n  /** Hash of the previous entry's full payload. null on the genesis entry. */\n  readonly prevHash: string | null;\n  /**\n   * Hash algorithm tag identifying the canonicalization + hash\n   * function in use. Bumped if the algorithm or canonical form\n   * changes, so exports remain verifiable across versions.\n   */\n  readonly hashAlgo: typeof HASH_ALGO;\n  /**\n   * Entry schema version — bumped if any `AuditEntry` field shape\n   * changes in a way that breaks back-compat. Pair with `hashAlgo`\n   * when migrating older exports. (F-5)\n   */\n  readonly schemaVersion: typeof SCHEMA_VERSION;\n  /**\n   * Private sentinel — present (and equal to the in-module token) only\n   * on legitimate tombstones minted by `ledger.erase()`. Filtered out\n   * of all public read paths (`query`, `recent`, `toJSON`, etc.) so\n   * consumers never see or copy it. (N7)\n   *\n   * NOT serialized. NOT exported. Forging this from outside the module\n   * is impossible without the symbol reference; `verify()` rejects any\n   * `system.entry-erased` entry that lacks it.\n   *\n   * @internal\n   */\n  readonly __internal?: typeof LEDGER_INTERNAL_TOKEN;\n}\n\nexport type AuditEntry =\n  | (AuditEntryBase & {\n      kind: \"constraint.evaluate\";\n      constraintId: string;\n      active: boolean;\n      /** Cached at ledger start from `system.inspect().constraints[].whenSpec`. Refreshed on `register()`/`assign()`/`unregister()`. May be undefined for function-form constraints (see `whenSource`). PII operands redacted unless `capturePII: true`. */\n      whenSpec?: FactPredicate<unknown>;\n      whenExplain?: readonly ClauseResult[];\n      /**\n       * For function-form constraints (no `whenSpec`), a tamper-evident\n       * identity for the function. We DO NOT capture the raw source —\n       * closures routinely reference secrets, API keys, or PII (e.g.\n       * `if (apiKey === \"sk-live-xxx\")`) and a preview would leak them\n       * into the audit log. Instead, we capture a djb2 hash of the\n       * stringified function (`hashObject(String(fn))`). Auditors can\n       * detect \"the function changed between deploys\" by comparing\n       * hashes across entries, without ever seeing the function body.\n       *\n       * Informational only — NOT replayable. (N5, M22)\n       */\n      whenSource?: { kind: \"function\"; sourceHash: string };\n    })\n  | (AuditEntryBase & {\n      kind: \"resolver.write.rejected\";\n      rejection: \"rejection\" | \"summary\";\n      resolverId: string;\n      requirementId: string;\n      reason: string;\n      fact?: string;\n      expected?: unknown;\n      actual?: unknown;\n      dropped?: number;\n    })\n  | (AuditEntryBase & {\n      kind: \"fact.change\";\n      key: string;\n      prior: unknown;\n      next: unknown;\n    })\n  | (AuditEntryBase & {\n      kind: \"resolver.complete\";\n      resolverId: string;\n      requirementId: string;\n      duration: number;\n    })\n  | (AuditEntryBase & {\n      kind: \"resolver.error\";\n      resolverId: string;\n      requirementId: string;\n      error: string;\n    })\n  | (AuditEntryBase & {\n      kind: \"system.init\" | \"system.start\" | \"system.stop\" | \"system.destroy\";\n    })\n  | (AuditEntryBase & {\n      kind: \"system.snapshot\";\n      snapshotId: number;\n      trigger: string;\n    })\n  | (AuditEntryBase & {\n      kind: \"system.history.navigate\";\n      from: number;\n      to: number;\n    })\n  | (AuditEntryBase & {\n      kind: \"system.truncated\";\n      droppedSeq: number;\n      droppedCount: number;\n    })\n  | (AuditEntryBase & {\n      kind: \"system.entry-erased\";\n      originalKind: AuditEntryKind;\n      erasedAt: number;\n    })\n  | (AuditEntryBase & {\n      kind: \"system.subject-erased\";\n      /**\n       * djb2 hash of the filter (via `hashObject(filter)`). PII-safe —\n       * the raw filter values never land in the ledger. Pair with\n       * `filterShape` to see which filter fields were used. (N2)\n       */\n      filterHash: string;\n      /**\n       * Stripped-values shape of the filter — captures WHICH fields were\n       * present without recording their values. (N2)\n       */\n      filterShape: {\n        factPath: boolean;\n        constraintId: boolean;\n        kind: AuditEntryKind | readonly AuditEntryKind[] | undefined;\n        changedBetween: \"[range]\" | undefined;\n      };\n      erased: number;\n    });\n\n// ============================================================================\n// Sink interface\n// ============================================================================\n\nexport interface QueryFilter {\n  /** Exact-match fact path. */\n  factPath?: string;\n  /** Filter by constraint id. */\n  constraintId?: string;\n  /** Filter by entry kind. */\n  kind?: AuditEntryKind | readonly AuditEntryKind[];\n  /** Time range as `[startMs, endMs]`, ISO strings, or epoch numbers. */\n  changedBetween?: [string | number | Date, string | number | Date];\n  /** Maximum entries returned. Default 1000. */\n  limit?: number;\n}\n\n/**\n * Verify result — chain valid OR a break with full context for tamper visualization.\n *\n * Erased entries (via `ledger.erase()`) appear as legitimate chain breaks —\n * `verify()` reports them in `erasedSeqs` and continues the walk from the\n * tombstone's own hash. Real tamper still surfaces as `valid: false`.\n *\n * Forged tombstones (a caller writes `kind: \"system.entry-erased\"`\n * directly via `sink.write()` to mask tamper as erasure) are detected:\n * legitimate tombstones carry an in-module sentinel that forgeries\n * cannot mint, so `verify()` reports them as tamper. (N7)\n */\nexport type VerifyResult =\n  | {\n      valid: true;\n      entryCount: number;\n      /**\n       * Seq numbers of entries legitimately broken by `erase()`\n       * tombstones. NOT timestamps — each entry pairs this seq with\n       * the per-entry `system.entry-erased.erasedAt` (ms epoch) for\n       * the timestamp. Empty unless the chain contains erasures.\n       * (N1 + M1; renamed from `erasedAt` in R3)\n       */\n      erasedSeqs?: number[];\n    }\n  | {\n      valid: false;\n      brokenAt: number;\n      expectedHash: string;\n      actualHash: string;\n      entry: AuditEntry;\n      /**\n       * Human-readable reason for the break — populated for cases\n       * where the cause is more specific than \"hash mismatch\" (e.g.\n       * tombstone forgery detected via missing sentinel).\n       */\n      reason?: string;\n    };\n\nexport interface AuditLedgerSink {\n  write(entry: AuditEntry): void;\n  query(filter: QueryFilter): readonly AuditEntry[];\n  recent(n: number): readonly AuditEntry[];\n  forFact(path: string, opts?: { limit?: number }): readonly AuditEntry[];\n  forConstraint(id: string, opts?: { limit?: number }): readonly AuditEntry[];\n  toJSON(): { entries: readonly AuditEntry[]; capturedAt: number };\n  clear(): void;\n  destroy(): void;\n  /**\n   * Replace matching entries with tombstones IN PLACE (preserving seq +\n   * prevHash so the hash chain still verifies). v1 implementation\n   * matches on the same `QueryFilter` shape used by `query()`.\n   * Returns the count of entries replaced.\n   *\n   * WARNING: erases only from this sink. Any external copies (toJSON\n   * exports, downstream pipelines) must be erased separately.\n   */\n  erase?(filter: QueryFilter, tombstoneFactory: (e: AuditEntry) => AuditEntry): number;\n  /**\n   * Optional hook fired by the sink BEFORE shifting the oldest entry\n   * out of a bounded ring buffer. The ledger plugin uses this to emit\n   * a `system.truncated` marker so an auditor sees that the log was\n   * truncated and where. (M23)\n   */\n  onTruncate?(handler: (droppedSeq: number, droppedCount: number) => void): void;\n}\n\n// ============================================================================\n// memorySink — bounded ring buffer\n// ============================================================================\n\nconst DEFAULT_MEMORY_CAPACITY = 10_000;\nconst DEFAULT_QUERY_LIMIT = 1000;\n\nfunction parseRangeBound(v: string | number | Date): number {\n  if (v instanceof Date) return v.getTime();\n  if (typeof v === \"number\") {\n    if (!Number.isFinite(v)) {\n      throw new Error(\n        `[Directive] audit-ledger: changedBetween bound must be a finite number, ISO string, or Date.`,\n      );\n    }\n\n    return v;\n  }\n  if (typeof v === \"string\") {\n    const t = Date.parse(v);\n    if (!Number.isFinite(t)) {\n      throw new Error(\n        `[Directive] audit-ledger: changedBetween bound \"${v}\" is not a parseable ISO date string.`,\n      );\n    }\n\n    return t;\n  }\n  throw new Error(\n    `[Directive] audit-ledger: changedBetween bound must be a number, ISO string, or Date.`,\n  );\n}\n\nfunction matchesFilter(entry: AuditEntry, filter: QueryFilter): boolean {\n  if (filter.kind) {\n    const kinds = Array.isArray(filter.kind) ? filter.kind : [filter.kind];\n    if (!kinds.includes(entry.kind)) return false;\n  }\n  if (filter.factPath !== undefined) {\n    // Exact match — no LIKE wildcards. (SEC M2)\n    if (entry.kind === \"fact.change\") {\n      if (entry.key !== filter.factPath) return false;\n    } else if (entry.kind === \"resolver.write.rejected\") {\n      if (entry.fact !== filter.factPath) return false;\n    } else {\n      return false;\n    }\n  }\n  if (filter.constraintId !== undefined) {\n    if (entry.kind !== \"constraint.evaluate\") return false;\n    if (entry.constraintId !== filter.constraintId) return false;\n  }\n  if (filter.changedBetween) {\n    const [a, b] = filter.changedBetween;\n    const start = parseRangeBound(a);\n    const end = parseRangeBound(b);\n    if (entry.ts < start || entry.ts > end) return false;\n  }\n\n  return true;\n}\n\n/**\n * In-memory bounded ring-buffer sink. Drops oldest entries past\n * `capacity` (default 10,000). Use this as the default sink for dev,\n * tests, and StackBlitz demos.\n */\nexport function memorySink(\n  opts: { capacity?: number } = {},\n): AuditLedgerSink {\n  const capacity = opts.capacity ?? DEFAULT_MEMORY_CAPACITY;\n  let entries: AuditEntry[] = [];\n  let truncateHandler:\n    | ((droppedSeq: number, droppedCount: number) => void)\n    | null = null;\n\n  const sink: AuditLedgerSink = {\n    write(entry) {\n      if (entries.length >= capacity) {\n        // (M23) About to overflow — notify the owner BEFORE the shift\n        // so the dropped seq is still known. The handler may push an\n        // entry of its own (a truncation marker), which will itself\n        // push us over capacity; we shift one for one until we're back\n        // at capacity (handlers must be O(1) writers — typically one).\n        const dropped = entries[0]!;\n        truncateHandler?.(dropped.seq, 1);\n        entries.shift();\n      }\n      entries.push(entry);\n      // If the handler wrote a marker (entries.length now > capacity),\n      // drop one more from the head to keep us at capacity exactly.\n      while (entries.length > capacity) {\n        entries.shift();\n      }\n    },\n    query(filter) {\n      const limit = filter.limit ?? DEFAULT_QUERY_LIMIT;\n      const out: AuditEntry[] = [];\n      for (let i = entries.length - 1; i >= 0; i--) {\n        const e = entries[i]!;\n        if (matchesFilter(e, filter)) {\n          out.push(e);\n          if (out.length >= limit) break;\n        }\n      }\n\n      return out;\n    },\n    recent(n) {\n      const start = Math.max(0, entries.length - n);\n\n      return entries.slice(start);\n    },\n    forFact(path, opts2 = {}) {\n      return this.query({ factPath: path, limit: opts2.limit });\n    },\n    forConstraint(id, opts2 = {}) {\n      return this.query({ constraintId: id, limit: opts2.limit });\n    },\n    toJSON() {\n      return { entries: entries.slice(), capturedAt: Date.now() };\n    },\n    clear() {\n      entries = [];\n    },\n    destroy() {\n      entries = [];\n      truncateHandler = null;\n    },\n    erase(filter, tombstoneFactory) {\n      let count = 0;\n      for (let i = 0; i < entries.length; i++) {\n        const e = entries[i]!;\n        if (matchesFilter(e, filter)) {\n          entries[i] = tombstoneFactory(e);\n          count++;\n        }\n      }\n\n      return count;\n    },\n    onTruncate(handler) {\n      truncateHandler = handler;\n    },\n  };\n\n  return sink;\n}\n\n// ============================================================================\n// Hash chain — canonicalization\n// ============================================================================\n//\n// `syncHash(entry)` calls `hashObject(entry)` which calls\n// `stableStringify(entry)` — every entry shape (seq, ts, kind, prevHash,\n// hashAlgo, ...payload) is canonicalized via key-sorted JSON, then\n// djb2-hashed to a 32-bit hex string.\n//\n//   - Fast, sync, isomorphic Node/Bun/Deno/browser.\n//   - Tamper-DETECTION against accidental + light adversarial probing.\n//   - Collision-prone against a determined attacker, by design (32 bits).\n//\n// Any future change to the canonicalization or hash function breaks\n// existing exports, so each entry carries `hashAlgo: \"djb2-1\"`. Verifiers\n// must check that tag matches what they expect.\n//\n// `verify({ strong: true })` is reserved for v2 (SHA-256 chain via Web\n// Crypto). It throws today — there is no silent fallback. v1 ships sync\n// djb2 only.\n\nfunction syncHash(entry: AuditEntry): string {\n  // stableStringify guarantees same hash across runtimes regardless of\n  // key insertion order (architecture review #11, security review C1).\n  return hashObject(entry);\n}\n\n/**\n * Dispatch to the right hash function based on the entry's `hashAlgo`\n * discriminator. v1 has a single arm (`djb2-1`); the switch is in\n * place so v2 can add `\"sha256-1\"` without touching call sites. (N5)\n *\n * v2 promise: when SHA-256 lands, this becomes `case \"sha256-1\": return\n * await asyncSha256(entry);` — verify() will become async accordingly.\n */\nfunction hashForEntry(entry: AuditEntry): string {\n  switch (entry.hashAlgo) {\n    case \"djb2-1\":\n      return syncHash(entry);\n    default:\n      throw new Error(\n        `[Directive] audit-ledger: unknown hashAlgo \"${String((entry as { hashAlgo: unknown }).hashAlgo)}\" on entry seq=${entry.seq}. Cannot verify chain integrity. Known algorithms: \"djb2-1\".`,\n      );\n  }\n}\n\n// ============================================================================\n// AuditLedger plugin\n// ============================================================================\n\nexport interface AuditLedgerOptions {\n  /** Sink to write entries to. Default: in-memory ring buffer (capacity 10k). */\n  sink?: AuditLedgerSink;\n  /**\n   * Whether to capture raw fact values (`prior`/`next` on fact.change,\n   * `actual` in whenExplain). Default `false` — PII-tagged facts are\n   * redacted by default. Set `true` to opt out of redaction.\n   */\n  capturePII?: boolean;\n  /**\n   * Optional caller-supplied redactor. Runs AFTER the default\n   * pii-tag-based redaction. Useful for additional sanitization.\n   */\n  redact?: (entry: AuditEntry) => AuditEntry;\n}\n\nexport interface AuditLedger {\n  /** The plugin to pass to `createSystem({ plugins: [...] })`. */\n  readonly plugin: Plugin<ModuleSchema>;\n  /** Query entries matching the filter. */\n  query(filter?: QueryFilter): readonly AuditEntry[];\n  /** Most recent N entries (chronological). */\n  recent(n: number): readonly AuditEntry[];\n  /** All entries that touch this fact path (exact match). */\n  forFact(path: string, opts?: { limit?: number }): readonly AuditEntry[];\n  /** All entries for this constraint id. */\n  forConstraint(id: string, opts?: { limit?: number }): readonly AuditEntry[];\n  /** Full ledger snapshot for export / serialization. */\n  toJSON(): { entries: readonly AuditEntry[]; capturedAt: number };\n  /**\n   * Walk the hash chain genesis → tip. Returns `{ valid: true }` iff\n   * every entry's `prevHash` matches the (sync, djb2-based) hash of\n   * the previous entry. On break, returns the index of the first\n   * broken link plus the expected vs actual hashes — feed into a\n   * \"TAMPERED\" visualization.\n   *\n   * Erased entries (via `ledger.erase()`) appear as legitimate chain\n   * breaks — `verify()` reports them in `erasedSeqs` and continues\n   * the walk from the tombstone's actual hash. Real tamper still\n   * surfaces as `valid: false`. (N1 + M1)\n   *\n   * Forged tombstones — `kind: \"system.entry-erased\"` entries written\n   * directly via `sink.write()` to mask tamper — are detected as\n   * forgery. Legitimate tombstones carry an in-module sentinel that\n   * forgeries cannot mint. (N7)\n   *\n   * v1 ships sync djb2 only. `verify({ strong: true })` is reserved\n   * for v2 (SHA-256) and THROWS today — there is no silent fallback.\n   * Call `verify()` (no args) for tamper detection.\n   */\n  verify(opts?: { strong?: boolean }): VerifyResult;\n  /**\n   * Per-subject erasure (GDPR Art. 17 stub). Replaces matching entries\n   * in this sink with `system.entry-erased` tombstones (preserving\n   * seq + prevHash so verify() can resync), then appends a chained\n   * `system.subject-erased` marker entry that summarises the erasure.\n   *\n   * Returns `{ erased, markerEntry }` — `markerEntry` is the chained\n   * `system.subject-erased` summary (the N per-entry tombstones live\n   * in the sink, not on the return value). (M7)\n   *\n   * When `erased === 0` (filter matched nothing), `markerEntry` is\n   * `null` and no marker is emitted into the chain — avoids polluting\n   * the audit trail with empty \"erased: 0\" records. (MAJOR-3)\n   *\n   * WARNING: v1 erases only from THIS sink. External copies (toJSON\n   * exports, downstream pipelines, persisted backups) must be erased\n   * separately. (C8)\n   */\n  erase(filter: QueryFilter): {\n    erased: number;\n    markerEntry: AuditEntry | null;\n  };\n  /** Empty the sink. */\n  clear(): void;\n  /** Unsubscribe + drop the sink. */\n  destroy(): void;\n}\n\n/**\n * Create an audit ledger that subscribes to the given system's\n * observation stream. Returns a `Plugin` to install + a query/verify\n * API for the ledger.\n *\n * @example\n * ```ts\n * import { createAuditLedger } from \"@directive-run/core/plugins\";\n *\n * const ledger = createAuditLedger();\n * const system = createSystem({ module, plugins: [ledger.plugin] });\n * system.start();\n *\n * // Six months later — auditor asks \"what changed cart-total in March?\"\n * ledger.query({\n *   factPath: \"cartTotal\",\n *   changedBetween: [\"2026-03-01\", \"2026-04-01\"],\n * });\n *\n * // Verify nobody tampered with the ledger\n * const verdict = await ledger.verify();\n * if (!verdict.valid) {\n *   console.error(\"Tamper at entry\", verdict.brokenAt);\n * }\n * ```\n */\nexport function createAuditLedger(\n  opts: AuditLedgerOptions = {},\n): AuditLedger {\n  const sink = opts.sink ?? memorySink();\n  const capturePII = opts.capturePII ?? false;\n  const userRedact = opts.redact;\n\n  let seq = 0;\n  let lastHashCache: string | null = null; // Cache hash of last-written entry payload\n\n  let system: System<ModuleSchema> | null = null;\n  let unobserve: (() => void) | null = null;\n\n  /**\n   * Cache of constraint.id → whenSpec (snapshotted at start, refreshed\n   * on register/assign/unregister). Spec is already PII-redacted at\n   * cache time, so the operand pointer that flows into every\n   * `constraint.evaluate` entry can never leak. (C2)\n   */\n  const whenSpecCache = new Map<string, FactPredicate<unknown>>();\n\n  /**\n   * Cache of constraint.id → sourceHash for function-form constraints.\n   * (N5, M22)\n   *\n   * We hash the stringified function rather than store any preview of\n   * its source. Closures frequently reference secrets in scope\n   * (`apiKey`, `dbPassword`, customer PII pulled from outer state) and\n   * a preview would land those in the audit trail in plaintext. The\n   * hash is a tamper-evident identity — auditors can verify \"this\n   * constraint's source has not changed across these entries\" without\n   * ever seeing the source itself.\n   */\n  const whenSourceCache = new Map<string, string>();\n\n  /** Cache of PII-tagged fact paths. */\n  const piiTaggedFacts = new Set<string>();\n\n  /**\n   * Walk a predicate spec and replace operands at PII-tagged fact paths\n   * with `\"[redacted]\"`. Cached operand pointers (e.g. `{ email: { $eq:\n   * \"alice@x.com\" } }`) flow into every `constraint.evaluate` entry —\n   * without this scrub the email would land in the audit trail in\n   * plaintext on every evaluation. (C2)\n   */\n  function redactWhenSpec(spec: unknown): unknown {\n    if (capturePII || piiTaggedFacts.size === 0) return spec;\n    if (spec === null || typeof spec !== \"object\") return spec;\n\n    // Deep-clone so we don't mutate the user's source predicate. JSON\n    // round-trip handles plain objects + arrays cheaply; predicates are\n    // already JSON-safe (validatePredicate enforces this).\n    let cloned: unknown;\n    try {\n      cloned = JSON.parse(JSON.stringify(spec));\n    } catch {\n      // Spec contained something non-serializable; bail rather than crash.\n      return spec;\n    }\n\n    walkPredicate(cloned, {\n      operator(factPath, op, _operand, operandPath) {\n        if (!piiTaggedFacts.has(factPath)) return;\n        // Navigate cloned tree to operandPath and replace value.\n        replaceAtPath(cloned, operandPath, \"[redacted]\");\n        void op;\n      },\n      literal(factPath) {\n        if (!piiTaggedFacts.has(factPath)) return;\n        // Replace bare-value leaf at this factPath.\n        replaceAtPath(cloned, factPath, \"[redacted]\");\n      },\n    });\n\n    return cloned;\n  }\n\n  function refreshWhenSpecCache(): void {\n    whenSpecCache.clear();\n    whenSourceCache.clear();\n    if (!system) return;\n    try {\n      const inspect = (\n        system as {\n          inspect?: () => {\n            constraints?: Array<{\n              id: string;\n              whenSpec?: unknown;\n              when?: unknown;\n            }>;\n          };\n        }\n      ).inspect;\n      if (typeof inspect !== \"function\") return;\n      const inspection = inspect();\n      const constraints = inspection?.constraints ?? [];\n      // Best-effort access to merged constraint defs for function-form\n      // source capture. Not exposed via the public type; we feature-detect.\n      const mergedDefs = (\n        system as {\n          $internal?: {\n            mergedConstraints?: Record<string, { when?: unknown }>;\n          };\n        }\n      ).$internal?.mergedConstraints;\n      for (const c of constraints) {\n        if (c.whenSpec !== undefined) {\n          // Redact PII operands at cache time so the cached pointer\n          // flowing into evaluate entries is already safe. (C2)\n          whenSpecCache.set(\n            c.id,\n            redactWhenSpec(c.whenSpec) as FactPredicate<unknown>,\n          );\n        } else {\n          // No whenSpec means function-form `when:` (or no when at\n          // all). Capture a HASH of the function source rather than\n          // the source itself — closures may reference secrets in\n          // scope, and any preview would leak them into the audit\n          // trail. (N5, M22)\n          const def = mergedDefs?.[c.id];\n          const whenFn = def && typeof def.when === \"function\" ? def.when : undefined;\n          if (whenFn) {\n            whenSourceCache.set(c.id, hashObject(String(whenFn)));\n          } else if (c.when !== undefined && typeof c.when === \"function\") {\n            whenSourceCache.set(c.id, hashObject(String(c.when)));\n          } else {\n            // Function-form constraint we couldn't reach the source\n            // of. Mark it so audit entries still surface the form.\n            // We hash the marker string for consistency with the\n            // sourceHash field shape.\n            whenSourceCache.set(c.id, hashObject(\"[function]\"));\n          }\n        }\n      }\n    } catch {\n      // System not yet ready — skip silently.\n    }\n  }\n\n  function refreshPIITags(): void {\n    piiTaggedFacts.clear();\n    if (capturePII || !system) return;\n    try {\n      const meta = (system as { meta?: { byTag?: (tag: string) => Array<{ id: string }> } }).meta;\n      if (!meta || typeof meta.byTag !== \"function\") return;\n      const tagged = meta.byTag(\"pii\") ?? [];\n      for (const m of tagged) {\n        piiTaggedFacts.add(m.id);\n      }\n    } catch {\n      // No meta accessor — skip.\n    }\n  }\n\n  function redactValue(factPath: string, value: unknown): unknown {\n    if (capturePII) return value;\n    if (piiTaggedFacts.has(factPath)) return \"[redacted]\";\n\n    return value;\n  }\n\n  function redactClauses(\n    clauses: ClauseResult[] | undefined,\n  ): ClauseResult[] | undefined {\n    if (!clauses) return clauses;\n    if (capturePII || piiTaggedFacts.size === 0) return clauses;\n    let mutated = false;\n    const out: ClauseResult[] = clauses.map((c) => {\n      if (piiTaggedFacts.has(c.path)) {\n        mutated = true;\n        return { ...c, actual: \"[redacted]\" };\n      }\n      // Recurse into combinator children.\n      if (c.children) {\n        const inner = redactClauses(c.children);\n        if (inner !== c.children) {\n          mutated = true;\n          return { ...c, children: inner };\n        }\n      }\n\n      return c;\n    });\n\n    return mutated ? out : clauses;\n  }\n\n  /**\n   * `partial` is the entry-specific payload (no seq/ts/prevHash). It's\n   * typed as `Record<string, unknown>` because TS's distributed Omit\n   * over the AuditEntry discriminated union doesn't compose cleanly;\n   * runtime construction is safe because each call site passes a\n   * known-shape literal.\n   *\n   * Entries are deeply-frozen at write time (depth 2 — top-level\n   * values + whenExplain clauses) so that downstream consumers cannot\n   * mutate payloads in place and forge the chain. (C3)\n   */\n  function emit(partial: Record<string, unknown>): AuditEntry {\n    const entry = {\n      ...partial,\n      seq: seq++,\n      ts: Date.now(),\n      prevHash: lastHashCache,\n      hashAlgo: HASH_ALGO,\n      schemaVersion: SCHEMA_VERSION,\n    } as AuditEntry;\n\n    const finalEntry = userRedact ? userRedact(entry) : entry;\n    freezeEntry(finalEntry);\n    sink.write(finalEntry);\n\n    // Sync hash of this entry — stashed as the next entry's prevHash.\n    // Whole entry is hashed (including its own prevHash field) so\n    // verify() can rebuild the chain deterministically.\n    lastHashCache = hashForEntry(finalEntry);\n\n    return finalEntry;\n  }\n\n  function onEvent(event: ObservationEvent): void {\n    switch (event.type) {\n      case \"constraint.evaluate\": {\n        const whenSpec = whenSpecCache.get(event.id);\n        const whenSourceHash = whenSourceCache.get(event.id);\n        const partial: Record<string, unknown> = {\n          kind: \"constraint.evaluate\",\n          constraintId: event.id,\n          active: event.active,\n          whenExplain: redactClauses(event.whenExplain),\n        };\n        if (whenSpec !== undefined) {\n          partial.whenSpec = whenSpec;\n        } else if (whenSourceHash !== undefined) {\n          // Function-form constraint — sourceHash is informational and\n          // NOT replayable. We deliberately do NOT include any source\n          // preview because closures may reference secrets in scope. (N5, M22)\n          partial.whenSource = {\n            kind: \"function\",\n            sourceHash: whenSourceHash,\n          };\n        }\n        emit(partial);\n        break;\n      }\n      case \"fact.change\":\n        emit({\n          kind: \"fact.change\",\n          key: event.key,\n          prior: redactValue(event.key, event.prev),\n          next: redactValue(event.key, event.next),\n        });\n        break;\n      case \"resolver.write.rejected\":\n        if (event.kind === \"summary\") {\n          emit({\n            kind: \"resolver.write.rejected\",\n            rejection: \"summary\",\n            resolverId: event.resolver,\n            requirementId: event.requirementId,\n            reason: event.reason,\n            dropped: event.dropped,\n          });\n        } else {\n          emit({\n            kind: \"resolver.write.rejected\",\n            rejection: \"rejection\",\n            resolverId: event.resolver,\n            requirementId: event.requirementId,\n            reason: event.reason,\n            fact: event.fact,\n            expected: redactValue(event.fact, event.expected),\n            actual: redactValue(event.fact, event.actual),\n          });\n        }\n        break;\n      case \"resolver.complete\":\n        emit({\n          kind: \"resolver.complete\",\n          resolverId: event.resolver,\n          requirementId: event.requirementId,\n          duration: event.duration,\n        });\n        break;\n      case \"resolver.error\":\n        emit({\n          kind: \"resolver.error\",\n          resolverId: event.resolver,\n          requirementId: event.requirementId,\n          error: String(event.error),\n        });\n        break;\n      case \"system.init\":\n      case \"system.start\":\n      case \"system.stop\":\n      case \"system.destroy\":\n        emit({ kind: event.type });\n        break;\n      default:\n        // Other observation events ignored in v1 (derivation.compute,\n        // requirement.created/met/canceled, effect.run/error,\n        // reconcile.start/end). They're available via .observe()\n        // directly if a consumer wants them.\n        break;\n    }\n  }\n\n  /**\n   * Re-entrance guard for the truncation handler. The marker entry is\n   * itself a write that may trigger another shift; without this we'd\n   * recurse and overflow. (M23)\n   */\n  let emittingTruncate = false;\n\n  function attach(sys: System<ModuleSchema>): void {\n    system = sys;\n    refreshPIITags();\n    refreshWhenSpecCache();\n    unobserve = sys.observe(onEvent);\n    // Wire up the truncation marker — fires BEFORE the sink drops the\n    // oldest entry, so the dropped seq is still known. The guard\n    // prevents the marker's own write from recursing back through the\n    // capacity overflow path. (M23)\n    sink.onTruncate?.((droppedSeq, droppedCount) => {\n      if (emittingTruncate) return;\n      emittingTruncate = true;\n      try {\n        emit({\n          kind: \"system.truncated\",\n          droppedSeq,\n          droppedCount,\n        });\n      } finally {\n        emittingTruncate = false;\n      }\n    });\n  }\n\n  function detach(): void {\n    if (unobserve) {\n      unobserve();\n      unobserve = null;\n    }\n    system = null;\n    whenSpecCache.clear();\n    whenSourceCache.clear();\n    piiTaggedFacts.clear();\n  }\n\n  const plugin: Plugin<ModuleSchema> = {\n    name: \"audit-ledger\",\n    onInit(sys) {\n      attach(sys as System<ModuleSchema>);\n    },\n    onStop() {\n      // Keep the sink populated so query() works after stop, but\n      // drop the subscription to avoid leaks.\n      if (unobserve) {\n        unobserve();\n        unobserve = null;\n      }\n    },\n    onDestroy() {\n      detach();\n    },\n    onDefinitionRegister(type, id) {\n      if (type === \"constraint\") refreshWhenSpecCache();\n      if (type === \"constraint\" || type === \"resolver\" || type === \"effect\") {\n        // Re-pull PII tags too — a dynamically-registered fact (rare)\n        // could have brought new meta.\n        refreshPIITags();\n      }\n      void id;\n    },\n    onDefinitionAssign(type, id) {\n      // (C4) Constraint assigned a new spec — refresh the cache so the\n      // NEXT evaluate emits the new whenSpec, not the stale one.\n      if (type === \"constraint\") refreshWhenSpecCache();\n      void id;\n    },\n    onDefinitionUnregister(type, id) {\n      if (type === \"constraint\") refreshWhenSpecCache();\n      void id;\n    },\n    onSnapshot(snapshot) {\n      // (M9) Capture history snapshot as a lifecycle marker. Snapshot\n      // contents (facts) are NOT included to keep the entry small and\n      // avoid duplicating PII through a different channel.\n      emit({\n        kind: \"system.snapshot\",\n        snapshotId: snapshot.id,\n        trigger: snapshot.trigger,\n      });\n    },\n    onHistoryNavigate(from, to) {\n      // (M9) Capture time-travel navigation as a lifecycle marker.\n      emit({\n        kind: \"system.history.navigate\",\n        from,\n        to,\n      });\n    },\n  };\n\n  /**\n   * Strip the internal sentinel from an entry before it reaches a\n   * public read path. Returns a shallow clone with `__internal`\n   * removed — keeps the (frozen) live entry intact for verify() while\n   * making sure consumers never see the symbol. (N7)\n   */\n  function stripInternal(entry: AuditEntry): AuditEntry {\n    if (\n      (entry as AuditEntry & { __internal?: unknown }).__internal === undefined\n    ) {\n      return entry;\n    }\n    const clone = { ...entry } as AuditEntry & { __internal?: unknown };\n    delete clone.__internal;\n\n    return clone as AuditEntry;\n  }\n\n  function stripInternalAll(\n    entries: readonly AuditEntry[],\n  ): readonly AuditEntry[] {\n    // Avoid allocating a new array unless at least one entry carries\n    // the sentinel — the common case (no tombstones) is a no-op.\n    let needsClone = false;\n    for (const e of entries) {\n      if ((e as AuditEntry & { __internal?: unknown }).__internal !== undefined) {\n        needsClone = true;\n        break;\n      }\n    }\n    if (!needsClone) {\n      return entries;\n    }\n\n    return entries.map(stripInternal);\n  }\n\n  return {\n    plugin,\n    query: (filter = {}) => stripInternalAll(sink.query(filter)),\n    recent: (n) => stripInternalAll(sink.recent(n)),\n    forFact: (path, opts2) => stripInternalAll(sink.forFact(path, opts2)),\n    forConstraint: (id, opts2) =>\n      stripInternalAll(sink.forConstraint(id, opts2)),\n    toJSON: () => {\n      const snap = sink.toJSON();\n\n      return {\n        entries: stripInternalAll(snap.entries),\n        capturedAt: snap.capturedAt,\n      };\n    },\n    verify(opts?: { strong?: boolean }): VerifyResult {\n      // (C1) v1 ships sync djb2 only. Strong (SHA-256) verify is\n      // reserved for v2 and must NOT silently no-op — the previous\n      // implementation returned `{ valid: true }` regardless of the\n      // chain's actual state, which lied to callers.\n      if (opts?.strong === true) {\n        throw new Error(\n          \"[Directive] verify({ strong: true }) is reserved for v2 — v1 ships sync djb2 chain only. Use verify() (sync) for tamper detection.\",\n        );\n      }\n\n      const { entries } = sink.toJSON();\n      if (entries.length === 0) {\n        return { valid: true, entryCount: 0 };\n      }\n\n      // Sync walk — catches anything the djb2 chain would see.\n      // (N1 + M1) Erased-entry tombstones (kind: \"system.entry-erased\")\n      // legitimately break the chain — the tombstone's payload differs\n      // from the original entry it replaced, so the NEXT entry's\n      // prevHash no longer matches. When we detect a break whose\n      // PREVIOUS entry is a tombstone (or the broken entry itself is\n      // one), record the seq and resync the walk from the tombstone's\n      // own hash.\n      //\n      // (N7) Only tombstones bearing the internal sentinel are\n      // recognised. A forged tombstone — `kind: \"system.entry-erased\"`\n      // written directly via `sink.write()` to mask real tamper —\n      // lacks the in-module symbol and is reported as tamper.\n      //\n      // Use a Set to dedupe — adjacent tombstones can otherwise be\n      // recorded twice (once when the tombstone itself is the broken\n      // entry, once when the next iteration sees its predecessor was\n      // also a tombstone).\n      const erasedSeqsSet = new Set<number>();\n      let prevHash: string | null = null;\n      for (let i = 0; i < entries.length; i++) {\n        const entry = entries[i]!;\n        if (entry.prevHash !== prevHash) {\n          // Legitimate break? Either:\n          //   (a) the entry itself is the tombstone, or\n          //   (b) the previous entry was the tombstone whose payload\n          //       was rewritten by erase().\n          const prevEntry = i > 0 ? entries[i - 1]! : null;\n          const entryIsTombstone = entry.kind === \"system.entry-erased\";\n          const prevIsTombstone = prevEntry?.kind === \"system.entry-erased\";\n\n          if (entryIsTombstone || prevIsTombstone) {\n            // (N7) Verify the SENTINEL on whichever entry(ies) claim\n            // tombstone status. Missing sentinel ⇒ forgery ⇒ tamper.\n            const candidates: AuditEntry[] = [];\n            if (entryIsTombstone) candidates.push(entry);\n            if (prevIsTombstone && prevEntry !== null) {\n              candidates.push(prevEntry);\n            }\n            const forged = candidates.find(\n              (e) =>\n                (e as AuditEntry & { __internal?: unknown }).__internal !==\n                LEDGER_INTERNAL_TOKEN,\n            );\n            if (forged) {\n              return {\n                valid: false,\n                brokenAt: i,\n                expectedHash: prevHash ?? \"<genesis>\",\n                actualHash: entry.prevHash ?? \"<genesis>\",\n                entry: forged,\n                reason:\n                  \"tombstone forgery detected — missing internal sentinel. A 'system.entry-erased' entry was written via sink.write() rather than ledger.erase(); rejected as tamper.\",\n              };\n            }\n            // Legitimate erasure — record the tombstone's seq and\n            // resync the walk by hashing this entry as our new pointer\n            // for the next iteration.\n            const tombstoneEntry = entryIsTombstone ? entry : prevEntry!;\n            erasedSeqsSet.add(tombstoneEntry.seq);\n            prevHash = hashForEntry(entry);\n\n            continue;\n          }\n\n          return {\n            valid: false,\n            brokenAt: i,\n            expectedHash: prevHash ?? \"<genesis>\",\n            actualHash: entry.prevHash ?? \"<genesis>\",\n            entry,\n          };\n        }\n        prevHash = hashForEntry(entry);\n      }\n\n      const result: {\n        valid: true;\n        entryCount: number;\n        erasedSeqs?: number[];\n      } = {\n        valid: true,\n        entryCount: entries.length,\n      };\n      if (erasedSeqsSet.size > 0) {\n        result.erasedSeqs = [...erasedSeqsSet].sort((a, b) => a - b);\n      }\n\n      return result;\n    },\n    erase(filter) {\n      // (C8) Replace matching entries with tombstones IN PLACE, keeping\n      // seq + prevHash + hashAlgo so verify() can resync the chain.\n      const erasedAt = Date.now();\n      let count = 0;\n      if (typeof sink.erase === \"function\") {\n        count = sink.erase(filter, (e) => {\n          // Build a tombstone preserving the immutable chain fields.\n          // Carry SCHEMA_VERSION from the original so a fresh tombstone\n          // doesn't claim to be at a newer schema than the entry it\n          // replaced. (F-5)\n          //\n          // (N7) Stamp the in-module sentinel so `verify()` can tell\n          // this tombstone apart from a forgery written via\n          // `sink.write({ kind: \"system.entry-erased\", … })`. The\n          // sentinel is stripped from every public read path.\n          const tombstone = {\n            seq: e.seq,\n            ts: e.ts,\n            kind: \"system.entry-erased\" as const,\n            prevHash: e.prevHash,\n            hashAlgo: e.hashAlgo,\n            schemaVersion:\n              (e as AuditEntry & { schemaVersion?: typeof SCHEMA_VERSION })\n                .schemaVersion ?? SCHEMA_VERSION,\n            originalKind: e.kind,\n            erasedAt,\n            __internal: LEDGER_INTERNAL_TOKEN,\n          } as AuditEntry;\n          // CAUTION: replacing the payload changes the entry's hash —\n          // which means the NEXT entry's prevHash will no longer match.\n          // verify() recognises `system.entry-erased` as a legitimate\n          // chain break and reports it in `erasedSeqs` rather than as\n          // tamper. (N1 + M1)\n          freezeEntry(tombstone);\n\n          return tombstone;\n        });\n      }\n      // (MAJOR-3) Skip the `system.subject-erased` marker when nothing\n      // matched the filter — emitting an \"erased: 0\" marker pollutes\n      // the chain with noise and confuses auditors looking for real\n      // erasures.\n      if (count === 0) {\n        return { erased: 0, markerEntry: null };\n      }\n      // (N2) Don't store the raw filter — PII can land in the values\n      // (e.g. `factPath: \"alice@x.com\"`). Capture a hash + a shape\n      // descriptor so an auditor sees WHICH fields were used without\n      // exposing the values.\n      const filterShape = {\n        factPath: filter.factPath !== undefined,\n        constraintId: filter.constraintId !== undefined,\n        kind: filter.kind,\n        changedBetween:\n          filter.changedBetween !== undefined\n            ? (\"[range]\" as const)\n            : undefined,\n      };\n      // Emit a single chained `system.subject-erased` marker — recorded\n      // AFTER the erasure so auditors see what was removed and why.\n      const markerEntry = emit({\n        kind: \"system.subject-erased\",\n        filterHash: hashObject(filter),\n        filterShape,\n        erased: count,\n      });\n\n      return { erased: count, markerEntry };\n    },\n    clear() {\n      sink.clear();\n      seq = 0;\n      lastHashCache = null;\n    },\n    destroy() {\n      detach();\n      sink.destroy();\n    },\n  };\n}\n"]}

package/dist/chunk-PXRV64PA.js

@@ -0,0 +1,3 @@
+var b=typeof process<"u"&&process.env?.NODE_ENV!=="production";function m(n,o=new WeakSet){if(n===null||typeof n!="object")return n;let r=n;if(o.has(r)||Object.isFrozen(r))return n;if(o.add(r),Array.isArray(r))for(let s of r)m(s,o);else for(let s of Object.keys(r))m(r[s],o);return Object.freeze(r),n}function A(n){return m(n)}function x(n,o,r){return (...s)=>{try{return r(...s)}catch(u){throw u instanceof Error&&u.message.startsWith("[Directive] ")?new Error(`[Directive] ${n} '${o}': ${u.message.slice(12)}`,{cause:u}):u}}}async function T(n,o,r){let s,u=new Promise((g,d)=>{s=setTimeout(()=>d(new Error(r)),o);});try{return await Promise.race([n,u])}finally{clearTimeout(s);}}function l(n,o=50){let r=new WeakSet;function s(t){if(t===null)return "null";if(t===void 0)return "undefined";let e=typeof t;if(e==="string")return JSON.stringify(t);if(e==="number"||e==="boolean")return String(t);if(e==="function")return '"[function]"';if(e==="symbol")return '"[symbol]"'}function u(t,e){if(r.has(t))return '"[circular]"';r.add(t);let i=e();return r.delete(t),i}function g(t,e){return u(t,()=>`[${t.map(i=>c(i,e+1)).join(",")}]`)}function d(t,e){return u(t,()=>`{${Object.keys(t).sort().map(f=>`${JSON.stringify(f)}:${c(t[f],e+1)}`).join(",")}}`)}function c(t,e){if(e>o)return '"[max depth exceeded]"';if(typeof t=="bigint")return `${t.toString()}n`;let i=s(t);if(i!==void 0)return i;if(t instanceof Date)return `D:${t.toISOString()}`;if(t instanceof RegExp)return `R:${t.source}:${t.flags}`;if(t instanceof Map){let a=[...t.entries()].sort();return `M:${c(a,e+1)}`}if(t instanceof Set){let a=[...t].sort();return `S:${c(a,e+1)}`}return Array.isArray(t)?g(t,e):typeof t=="object"?d(t,e):'"[unknown]"'}return c(n,0)}function D(n,o=50){let r=new Set(["__proto__","constructor","prototype"]),s=new WeakSet;function u(t,e){if(s.has(t))return  true;s.add(t);let i=e();return s.delete(t),i}function g(t,e){for(let i of t)if(!c(i,e+1))return  false;return  true}function d(t,e){for(let i of Object.keys(t))if(r.has(i)||!c(t[i],e+1))return  false;return  true}function c(t,e){if(e>o)return  false;if(t==null||typeof t!="object")return  true;let i=t;return Array.isArray(i)?u(i,()=>g(i,e)):u(i,()=>d(i,e))}return c(n,0)}function E(n,o){if(n===o)return  true;if(!n||!o)return  false;let r=Object.keys(n),s=Object.keys(o);if(r.length!==s.length)return  false;for(let u of r)if(n[u]!==o[u])return  false;return  true}function $(n){let o=l(n),r=5381;for(let s=0;s<o.length;s++)r=(r<<5)+r^o.charCodeAt(s);return (r>>>0).toString(16)}function h(n,o=Date.now()){return n.expiresAt!==void 0&&o>n.expiresAt}function R(n,o=Date.now()){if(!n||typeof n!="object")throw new Error("[Directive] Invalid snapshot: expected an object with 'data' and 'createdAt' properties.");if(!("data"in n))throw new Error("[Directive] Invalid snapshot: missing required 'data' property.");if(!("createdAt"in n)||typeof n.createdAt!="number")throw new Error("[Directive] Invalid snapshot: missing or invalid 'createdAt' property (expected number).");if(h(n,o)){let r=new Date(n.expiresAt).toISOString();throw new Error(`[Directive] Snapshot expired at ${r}. Obtain a fresh snapshot from the source.`)}return n.data}function P(n,o){let r=[];function s(e,i,a,f){r.push({path:e,oldValue:i,newValue:a,type:f});}function u(e,i,a){return e==null?(i!=null&&s(a,e,i,"added"),true):i==null?(s(a,e,i,"removed"),true):false}function g(e,i,a){if(e.length!==i.length){s(a,e,i,"changed");return}for(let f=0;f<e.length;f++)c(e[f],i[f],`${a}[${f}]`);}function d(e,i,a){let f=new Set([...Object.keys(e),...Object.keys(i)]);for(let y of f){let p=a?`${a}.${y}`:y;y in e?y in i?c(e[y],i[y],p):s(p,e[y],void 0,"removed"):s(p,void 0,i[y],"added");}}function c(e,i,a){if(!u(e,i,a)){if(typeof e!="object"||typeof i!="object"){Object.is(e,i)||s(a,e,i,"changed");return}if(Array.isArray(e)&&Array.isArray(i)){g(e,i,a);return}d(e,i,a);}}c(n.data,o.data,"");let t=n.version!==o.version&&(n.version!==void 0||o.version!==void 0);return {identical:r.length===0,changes:r,versionChanged:t,oldVersion:n.version,newVersion:o.version}}function C(n){return "signature"in n&&typeof n.signature=="string"}async function v(n,o){let r=l({data:n.data,createdAt:n.createdAt,expiresAt:n.expiresAt,version:n.version,metadata:n.metadata}),s=await k(r,o);return {...n,signature:s,algorithm:"hmac-sha256"}}async function I(n,o){if(!n.signature||n.algorithm!=="hmac-sha256")return  false;let r=l({data:n.data,createdAt:n.createdAt,expiresAt:n.expiresAt,version:n.version,metadata:n.metadata}),s=await k(r,o);return w(n.signature,s)}async function k(n,o){let r=typeof o=="string"?new TextEncoder().encode(o):o,s={name:"HMAC",hash:{name:"SHA-256"}},u=await crypto.subtle.importKey("raw",r,s,false,["sign"]),g=new TextEncoder().encode(n),d=await crypto.subtle.sign("HMAC",u,g);return Array.from(new Uint8Array(d)).map(c=>c.toString(16).padStart(2,"0")).join("")}function w(n,o){if(n.length!==o.length)return  false;let r=0;for(let s=0;s<n.length;s++)r|=n.charCodeAt(s)^o.charCodeAt(s);return r===0}function L(n,o=500){try{let r=JSON.stringify(n,(s,u)=>typeof u=="bigint"?`${u}n`:u,2);return r?r.length<=o?r:`${r.slice(0,o)}
+... (truncated, ${r.length} chars total)`:"[undefined]"}catch{return "[unserializable]"}}export{b as a,A as b,x as c,T as d,l as e,D as f,E as g,$ as h,h as i,R as j,P as k,C as l,v as m,I as n,L as o};//# sourceMappingURL=chunk-PXRV64PA.js.map
+//# sourceMappingURL=chunk-PXRV64PA.js.map

package/dist/chunk-PXRV64PA.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/dev-true.ts","../src/utils/utils.ts"],"names":["dev_true_default","deepFreeze","value","seen","obj","item","key","freezeSpec","spec","attributeError","category","id","fn","args","e","withTimeout","promise","ms","errorMessage","timeoutId","timeoutPromise","_","reject","stableStringify","maxDepth","stringifyPrimitive","val","type","withCircularGuard","result","stringifyArray","depth","v","stringify","stringifyObject","k","primitive","entries","items","isPrototypeSafe","dangerousKeys","objVal","checkArray","arr","check","checkObject","shallowEqual","a","b","keysA","keysB","hashObject","str","hash","i","isSnapshotExpired","snapshot","now","validateSnapshot","expiredAt","diffSnapshots","oldSnapshot","newSnapshot","changes","pushChange","path","oldValue","newValue","compareNullish","oldObj","newObj","compareArrays","oldArr","newArr","compare","compareObjects","oldRecord","newRecord","allKeys","childPath","versionChanged","isSignedSnapshot","signSnapshot","secret","payload","signature","hmacSha256","verifySnapshotSignature","signedSnapshot","expectedSignature","timingSafeEqual","message","secretBytes","algorithm","messageBytes","safeStringify","data","maxLen","_key"],"mappings":"AAIA,IAAOA,CAAAA,CAAQ,OAAO,OAAA,CAAY,GAAA,EAChC,QAAQ,GAAA,EAAK,QAAA,GAAa,aCarB,SAASC,EACdC,CAAAA,CACAC,CAAAA,CAAwB,IAAI,OAAA,CACzB,CACH,GAAID,CAAAA,GAAU,IAAA,EAAQ,OAAOA,GAAU,QAAA,CACrC,OAAOA,CAAAA,CAET,IAAME,EAAMF,CAAAA,CACZ,GAAIC,CAAAA,CAAK,GAAA,CAAIC,CAAG,CAAA,EAAK,MAAA,CAAO,QAAA,CAASA,CAAG,EACtC,OAAOF,CAAAA,CAIT,GAFAC,CAAAA,CAAK,IAAIC,CAAG,CAAA,CAER,KAAA,CAAM,OAAA,CAAQA,CAAG,CAAA,CACnB,IAAA,IAAWC,CAAAA,IAAQD,CAAAA,CACjBH,EAAWI,CAAAA,CAAMF,CAAI,CAAA,CAAA,KAGvB,IAAA,IAAWG,KAAO,MAAA,CAAO,IAAA,CAAKF,CAAG,CAAA,CAC/BH,EAAYG,CAAAA,CAAgCE,CAAG,CAAA,CAAGH,CAAI,EAI1D,OAAA,MAAA,CAAO,MAAA,CAAOC,CAAG,CAAA,CACVF,CACT,CAmBO,SAASK,CAAAA,CAAcC,CAAAA,CAAY,CACxC,OAAOP,CAAAA,CAAWO,CAAI,CACxB,CAkBO,SAASC,CAAAA,CACdC,CAAAA,CACAC,EACAC,CAAAA,CACmB,CAKnB,OAAO,CAAA,GAAIC,IAAe,CACxB,GAAI,CACF,OAAOD,EAAG,GAAGC,CAAI,CACnB,CAAA,MAASC,EAAG,CACV,MAAIA,CAAAA,YAAa,KAAA,EAASA,EAAE,OAAA,CAAQ,UAAA,CAAW,cAAc,CAAA,CACrD,IAAI,KAAA,CACR,CAAA,YAAA,EAAeJ,CAAQ,CAAA,EAAA,EAAKC,CAAE,CAAA,GAAA,EAAMG,CAAAA,CAAE,OAAA,CAAQ,KAAA,CAAM,EAAqB,CAAC,CAAA,CAAA,CAC1E,CAAE,KAAA,CAAOA,CAAE,CACb,CAAA,CAEIA,CACR,CACF,CACF,CAYA,eAAsBC,CAAAA,CACpBC,CAAAA,CACAC,EACAC,CAAAA,CACY,CACZ,IAAIC,CAAAA,CAEEC,EAAiB,IAAI,OAAA,CAAe,CAACC,CAAAA,CAAGC,IAAW,CACvDH,CAAAA,CAAY,UAAA,CAAW,IAAMG,EAAO,IAAI,KAAA,CAAMJ,CAAY,CAAC,EAAGD,CAAE,EAClE,CAAC,CAAA,CAED,GAAI,CACF,OAAO,MAAM,QAAQ,IAAA,CAAK,CAACD,CAAAA,CAASI,CAAc,CAAC,CACrD,CAAA,OAAE,CACA,YAAA,CAAaD,CAAU,EACzB,CACF,CAwBO,SAASI,EAAgBrB,CAAAA,CAAgBsB,CAAAA,CAAW,EAAA,CAAY,CACrE,IAAMrB,CAAAA,CAAO,IAAI,OAAA,CAGjB,SAASsB,EAAmBC,CAAAA,CAAkC,CAC5D,GAAIA,CAAAA,GAAQ,KAAM,OAAO,MAAA,CACzB,GAAIA,CAAAA,GAAQ,OAAW,OAAO,WAAA,CAE9B,IAAMC,CAAAA,CAAO,OAAOD,CAAAA,CACpB,GAAIC,CAAAA,GAAS,QAAA,CAAU,OAAO,IAAA,CAAK,SAAA,CAAUD,CAAG,CAAA,CAChD,GAAIC,CAAAA,GAAS,QAAA,EAAYA,CAAAA,GAAS,SAAA,CAAW,OAAO,MAAA,CAAOD,CAAG,CAAA,CAC9D,GAAIC,IAAS,UAAA,CAAY,OAAO,cAAA,CAChC,GAAIA,IAAS,QAAA,CAAU,OAAO,YAGhC,CAGA,SAASC,CAAAA,CAAkBxB,CAAAA,CAAaQ,CAAAA,CAA0B,CAChE,GAAIT,CAAAA,CAAK,GAAA,CAAIC,CAAG,CAAA,CACd,OAAO,cAAA,CAETD,CAAAA,CAAK,GAAA,CAAIC,CAAG,EACZ,IAAMyB,CAAAA,CAASjB,CAAAA,EAAG,CAClB,OAAAT,CAAAA,CAAK,MAAA,CAAOC,CAAG,CAAA,CAERyB,CACT,CAGA,SAASC,CAAAA,CAAeJ,CAAAA,CAAgBK,EAAuB,CAC7D,OAAOH,CAAAA,CACLF,CAAAA,CACA,IAAM,CAAA,CAAA,EAAIA,CAAAA,CAAI,GAAA,CAAKM,CAAAA,EAAMC,EAAUD,CAAAA,CAAGD,CAAAA,CAAQ,CAAC,CAAC,EAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAC7D,CACF,CAGA,SAASG,CAAAA,CACP9B,CAAAA,CACA2B,EACQ,CACR,OAAOH,CAAAA,CAAkBxB,CAAAA,CAAK,IAMrB,CAAA,CAAA,EALM,MAAA,CAAO,IAAA,CAAKA,CAAG,EAAE,IAAA,EAAK,CAChB,GAAA,CAChB+B,CAAAA,EAAM,GAAG,IAAA,CAAK,SAAA,CAAUA,CAAC,CAAC,IAAIF,CAAAA,CAAU7B,CAAAA,CAAI+B,CAAC,CAAA,CAAGJ,EAAQ,CAAC,CAAC,CAAA,CAC7D,CAAA,CAEiB,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAC3B,CACH,CAGA,SAASE,CAAAA,CAAUP,CAAAA,CAAcK,EAAuB,CACtD,GAAIA,CAAAA,CAAQP,CAAAA,CACV,OAAO,wBAAA,CAKT,GAAI,OAAOE,CAAAA,EAAQ,SACjB,OAAO,CAAA,EAAGA,CAAAA,CAAI,QAAA,EAAU,CAAA,CAAA,CAAA,CAG1B,IAAMU,CAAAA,CAAYX,CAAAA,CAAmBC,CAAG,CAAA,CACxC,GAAIU,CAAAA,GAAc,MAAA,CAChB,OAAOA,CAAAA,CAOT,GAAIV,CAAAA,YAAe,IAAA,CACjB,OAAO,CAAA,EAAA,EAAKA,CAAAA,CAAI,WAAA,EAAa,GAE/B,GAAIA,CAAAA,YAAe,MAAA,CACjB,OAAO,KAAKA,CAAAA,CAAI,MAAM,CAAA,CAAA,EAAIA,CAAAA,CAAI,KAAK,CAAA,CAAA,CAErC,GAAIA,CAAAA,YAAe,GAAA,CAAK,CACtB,IAAMW,CAAAA,CAAU,CAAC,GAAGX,EAAI,OAAA,EAAS,CAAA,CAAE,IAAA,GACnC,OAAO,CAAA,EAAA,EAAKO,CAAAA,CAAUI,CAAAA,CAASN,EAAQ,CAAC,CAAC,CAAA,CAC3C,CACA,GAAIL,CAAAA,YAAe,GAAA,CAAK,CACtB,IAAMY,CAAAA,CAAQ,CAAC,GAAGZ,CAAG,EAAE,IAAA,EAAK,CAC5B,OAAO,CAAA,EAAA,EAAKO,EAAUK,CAAAA,CAAOP,CAAAA,CAAQ,CAAC,CAAC,EACzC,CAEA,OAAI,KAAA,CAAM,OAAA,CAAQL,CAAG,CAAA,CACZI,CAAAA,CAAeJ,CAAAA,CAAKK,CAAK,EAG9B,OAAOL,CAAAA,EAAQ,QAAA,CACVQ,CAAAA,CAAgBR,EAAgCK,CAAK,CAAA,CAGvD,aACT,CAEA,OAAOE,CAAAA,CAAU/B,CAAAA,CAAO,CAAC,CAC3B,CAUO,SAASqC,CAAAA,CAAgBnC,CAAAA,CAAcoB,CAAAA,CAAW,GAAa,CACpE,IAAMgB,CAAAA,CAAgB,IAAI,IAAI,CAAC,WAAA,CAAa,aAAA,CAAe,WAAW,CAAC,CAAA,CACjErC,CAAAA,CAAO,IAAI,OAAA,CAGjB,SAASyB,CAAAA,CAAkBa,CAAAA,CAAgB7B,CAAAA,CAA4B,CACrE,GAAIT,CAAAA,CAAK,GAAA,CAAIsC,CAAM,CAAA,CAAG,OAAO,KAAA,CAC7BtC,CAAAA,CAAK,GAAA,CAAIsC,CAAM,CAAA,CACf,IAAMZ,CAAAA,CAASjB,CAAAA,GACf,OAAAT,CAAAA,CAAK,MAAA,CAAOsC,CAAM,EAEXZ,CACT,CAGA,SAASa,CAAAA,CAAWC,EAAgBZ,CAAAA,CAAwB,CAC1D,IAAA,IAAW1B,CAAAA,IAAQsC,EACjB,GAAI,CAACC,CAAAA,CAAMvC,CAAAA,CAAM0B,EAAQ,CAAC,CAAA,CACxB,OAAO,MAAA,CAIX,OAAO,KACT,CAGA,SAASc,CAAAA,CACPJ,EACAV,CAAAA,CACS,CACT,IAAA,IAAWzB,CAAAA,IAAO,OAAO,IAAA,CAAKmC,CAAM,CAAA,CAIlC,GAHID,EAAc,GAAA,CAAIlC,CAAG,CAAA,EAGrB,CAACsC,EAAMH,CAAAA,CAAOnC,CAAG,CAAA,CAAGyB,CAAAA,CAAQ,CAAC,CAAA,CAC/B,OAAO,MAAA,CAIX,OAAO,KACT,CAGA,SAASa,CAAAA,CAAMlB,CAAAA,CAAcK,EAAwB,CACnD,GAAIA,CAAAA,CAAQP,CAAAA,CAAU,OAAO,MAAA,CAE7B,GADIE,CAAAA,EAAQ,IAAA,EACR,OAAOA,CAAAA,EAAQ,QAAA,CAAU,OAAO,KAAA,CAEpC,IAAMe,CAAAA,CAASf,CAAAA,CAEf,OAAI,KAAA,CAAM,QAAQe,CAAM,CAAA,CACfb,CAAAA,CAAkBa,CAAAA,CAAQ,IAAMC,CAAAA,CAAWD,CAAAA,CAAQV,CAAK,CAAC,EAG3DH,CAAAA,CAAkBa,CAAAA,CAAQ,IAAMI,CAAAA,CAAYJ,EAAQV,CAAK,CAAC,CACnE,CAEA,OAAOa,CAAAA,CAAMxC,CAAAA,CAAK,CAAC,CACrB,CAUO,SAAS0C,CAAAA,CACdC,CAAAA,CACAC,CAAAA,CACS,CACT,GAAID,CAAAA,GAAMC,CAAAA,CAAG,OAAO,MACpB,GAAI,CAACD,CAAAA,EAAK,CAACC,EAAG,OAAO,MAAA,CAErB,IAAMC,CAAAA,CAAQ,OAAO,IAAA,CAAKF,CAAC,CAAA,CACrBG,CAAAA,CAAQ,OAAO,IAAA,CAAKF,CAAC,CAAA,CAE3B,GAAIC,EAAM,MAAA,GAAWC,CAAAA,CAAM,MAAA,CAAQ,OAAO,OAE1C,IAAA,IAAW5C,CAAAA,IAAO2C,CAAAA,CAChB,GAAIF,EAAEzC,CAAG,CAAA,GAAM0C,CAAAA,CAAE1C,CAAG,EAAG,OAAO,MAAA,CAGhC,OAAO,KACT,CAkBO,SAAS6C,CAAAA,CAAWjD,CAAAA,CAAwB,CACjD,IAAMkD,CAAAA,CAAM7B,CAAAA,CAAgBrB,CAAK,EAC7BmD,CAAAA,CAAO,IAAA,CACX,IAAA,IAASC,CAAAA,CAAI,EAAGA,CAAAA,CAAIF,CAAAA,CAAI,MAAA,CAAQE,CAAAA,EAAAA,CAC9BD,GAASA,CAAAA,EAAQ,CAAA,EAAKA,CAAAA,CAAQD,CAAAA,CAAI,WAAWE,CAAC,CAAA,CAGhD,OAAA,CAAQD,CAAAA,GAAS,GAAG,QAAA,CAAS,EAAE,CACjC,CAkCO,SAASE,CAAAA,CACdC,CAAAA,CACAC,CAAAA,CAAc,IAAA,CAAK,KAAI,CACd,CACT,OAAOD,CAAAA,CAAS,YAAc,MAAA,EAAaC,CAAAA,CAAMD,CAAAA,CAAS,SAC5D,CA6BO,SAASE,CAAAA,CACdF,CAAAA,CACAC,CAAAA,CAAc,KAAK,GAAA,EAAI,CACpB,CAEH,GAAI,CAACD,CAAAA,EAAY,OAAOA,CAAAA,EAAa,QAAA,CACnC,MAAM,IAAI,KAAA,CACR,0FACF,CAAA,CAEF,GAAI,EAAE,MAAA,GAAUA,CAAAA,CAAAA,CACd,MAAM,IAAI,KAAA,CACR,iEACF,CAAA,CAEF,GAAI,EAAE,WAAA,GAAeA,CAAAA,CAAAA,EAAa,OAAOA,EAAS,SAAA,EAAc,QAAA,CAC9D,MAAM,IAAI,MACR,0FACF,CAAA,CAIF,GAAID,CAAAA,CAAkBC,EAAUC,CAAG,CAAA,CAAG,CACpC,IAAME,EAAY,IAAI,IAAA,CAAKH,CAAAA,CAAS,SAAU,EAAE,WAAA,EAAY,CAC5D,MAAM,IAAI,MACR,CAAA,gCAAA,EAAmCG,CAAS,CAAA,0CAAA,CAC9C,CACF,CACA,OAAOH,CAAAA,CAAS,IAClB,CAqDO,SAASI,CAAAA,CACdC,CAAAA,CACAC,CAAAA,CACc,CACd,IAAMC,CAAAA,CAA+B,EAAC,CAGtC,SAASC,EACPC,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACAxC,CAAAA,CACM,CACNoC,CAAAA,CAAQ,IAAA,CAAK,CAAE,IAAA,CAAAE,EAAM,QAAA,CAAAC,CAAAA,CAAU,QAAA,CAAAC,CAAAA,CAAU,KAAAxC,CAAK,CAAC,EACjD,CAGA,SAASyC,CAAAA,CACPC,CAAAA,CACAC,CAAAA,CACAL,CAAAA,CACS,CACT,OAAII,CAAAA,EAAW,IAAA,EACTC,CAAAA,EAAW,IAAA,EACbN,CAAAA,CAAWC,CAAAA,CAAMI,CAAAA,CAAQC,EAAQ,OAAO,CAAA,CAGnC,IAAA,EAELA,CAAAA,EAAW,MACbN,CAAAA,CAAWC,CAAAA,CAAMI,CAAAA,CAAQC,CAAAA,CAAQ,SAAS,CAAA,CAEnC,IAAA,EAGF,KACT,CAGA,SAASC,CAAAA,CACPC,CAAAA,CACAC,CAAAA,CACAR,CAAAA,CACM,CACN,GAAIO,CAAAA,CAAO,MAAA,GAAWC,CAAAA,CAAO,OAAQ,CACnCT,CAAAA,CAAWC,CAAAA,CAAMO,CAAAA,CAAQC,EAAQ,SAAS,CAAA,CAE1C,MACF,CACA,QAASnB,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIkB,CAAAA,CAAO,OAAQlB,CAAAA,EAAAA,CACjCoB,CAAAA,CAAQF,CAAAA,CAAOlB,CAAC,EAAGmB,CAAAA,CAAOnB,CAAC,CAAA,CAAG,CAAA,EAAGW,CAAI,CAAA,CAAA,EAAIX,CAAC,CAAA,CAAA,CAAG,EAEjD,CAGA,SAASqB,CAAAA,CACPC,CAAAA,CACAC,CAAAA,CACAZ,EACM,CACN,IAAMa,CAAAA,CAAU,IAAI,IAAI,CACtB,GAAG,MAAA,CAAO,IAAA,CAAKF,CAAS,CAAA,CACxB,GAAG,MAAA,CAAO,IAAA,CAAKC,CAAS,CAC1B,CAAC,CAAA,CAED,IAAA,IAAWvE,KAAOwE,CAAAA,CAAS,CACzB,IAAMC,CAAAA,CAAYd,EAAO,CAAA,EAAGA,CAAI,CAAA,CAAA,EAAI3D,CAAG,GAAKA,CAAAA,CACtCA,CAAAA,IAAOsE,CAAAA,CAEAtE,CAAAA,IAAOuE,EAGlBH,CAAAA,CAAQE,CAAAA,CAAUtE,CAAG,CAAA,CAAGuE,EAAUvE,CAAG,CAAA,CAAGyE,CAAS,CAAA,CAFjDf,EAAWe,CAAAA,CAAWH,CAAAA,CAAUtE,CAAG,CAAA,CAAG,OAAW,SAAS,CAAA,CAF1D0D,CAAAA,CAAWe,CAAAA,CAAW,OAAWF,CAAAA,CAAUvE,CAAG,CAAA,CAAG,OAAO,EAM5D,CACF,CAGA,SAASoE,CAAAA,CAAQL,EAAiBC,CAAAA,CAAiBL,CAAAA,CAAoB,CACrE,GAAI,CAAAG,CAAAA,CAAeC,CAAAA,CAAQC,CAAAA,CAAQL,CAAI,EAKvC,CAAA,GAAI,OAAOI,CAAAA,EAAW,QAAA,EAAY,OAAOC,CAAAA,EAAW,QAAA,CAAU,CACvD,MAAA,CAAO,GAAGD,CAAAA,CAAQC,CAAM,CAAA,EAC3BN,CAAAA,CAAWC,EAAMI,CAAAA,CAAQC,CAAAA,CAAQ,SAAS,CAAA,CAG5C,MACF,CAGA,GAAI,KAAA,CAAM,QAAQD,CAAM,CAAA,EAAK,KAAA,CAAM,OAAA,CAAQC,CAAM,CAAA,CAAG,CAClDC,CAAAA,CAAcF,CAAAA,CAAQC,EAAQL,CAAI,CAAA,CAElC,MACF,CAGAU,EACEN,CAAAA,CACAC,CAAAA,CACAL,CACF,EAAA,CACF,CAGAS,CAAAA,CAAQb,CAAAA,CAAY,IAAA,CAAMC,CAAAA,CAAY,KAAM,EAAE,CAAA,CAG9C,IAAMkB,CAAAA,CACJnB,EAAY,OAAA,GAAYC,CAAAA,CAAY,OAAA,GACnCD,CAAAA,CAAY,UAAY,MAAA,EAAaC,CAAAA,CAAY,OAAA,GAAY,MAAA,CAAA,CAEhE,OAAO,CACL,SAAA,CAAWC,CAAAA,CAAQ,MAAA,GAAW,EAC9B,OAAA,CAAAA,CAAAA,CACA,cAAA,CAAAiB,CAAAA,CACA,WAAYnB,CAAAA,CAAY,OAAA,CACxB,UAAA,CAAYC,CAAAA,CAAY,OAC1B,CACF,CAwBO,SAASmB,CAAAA,CACdzB,EAC+B,CAC/B,OAAO,WAAA,GAAeA,CAAAA,EAAY,OAAOA,CAAAA,CAAS,SAAA,EAAc,QAClE,CAoCA,eAAsB0B,CAAAA,CACpB1B,CAAAA,CACA2B,CAAAA,CAC4B,CAE5B,IAAMC,CAAAA,CAAU7D,CAAAA,CAAgB,CAC9B,IAAA,CAAMiC,EAAS,IAAA,CACf,SAAA,CAAWA,CAAAA,CAAS,SAAA,CACpB,UAAWA,CAAAA,CAAS,SAAA,CACpB,OAAA,CAASA,CAAAA,CAAS,QAClB,QAAA,CAAUA,CAAAA,CAAS,QACrB,CAAC,EAEK6B,CAAAA,CAAY,MAAMC,CAAAA,CAAWF,CAAAA,CAASD,CAAM,CAAA,CAElD,OAAO,CACL,GAAG3B,EACH,SAAA,CAAA6B,CAAAA,CACA,SAAA,CAAW,aACb,CACF,CA8BA,eAAsBE,CAAAA,CACpBC,CAAAA,CACAL,EACkB,CAClB,GAAI,CAACK,CAAAA,CAAe,WAAaA,CAAAA,CAAe,SAAA,GAAc,aAAA,CAC5D,OAAO,OAIT,IAAMJ,CAAAA,CAAU7D,CAAAA,CAAgB,CAC9B,KAAMiE,CAAAA,CAAe,IAAA,CACrB,SAAA,CAAWA,CAAAA,CAAe,UAC1B,SAAA,CAAWA,CAAAA,CAAe,SAAA,CAC1B,OAAA,CAASA,EAAe,OAAA,CACxB,QAAA,CAAUA,CAAAA,CAAe,QAC3B,CAAC,CAAA,CAEKC,CAAAA,CAAoB,MAAMH,CAAAA,CAAWF,EAASD,CAAM,CAAA,CAG1D,OAAOO,CAAAA,CAAgBF,CAAAA,CAAe,SAAA,CAAWC,CAAiB,CACpE,CAMA,eAAeH,CAAAA,CACbK,CAAAA,CACAR,CAAAA,CACiB,CAEjB,IAAMS,CAAAA,CACJ,OAAOT,CAAAA,EAAW,SAAW,IAAI,WAAA,EAAY,CAAE,MAAA,CAAOA,CAAM,CAAA,CAAIA,CAAAA,CAG5DU,CAAAA,CAA8B,CAClC,KAAM,MAAA,CACN,IAAA,CAAM,CAAE,IAAA,CAAM,SAAU,CAC1B,CAAA,CACMvF,CAAAA,CAAM,MAAM,OAAO,MAAA,CAAO,SAAA,CAC9B,KAAA,CACAsF,CAAAA,CACAC,EACA,KAAA,CACA,CAAC,MAAM,CACT,EAGMC,CAAAA,CAAe,IAAI,WAAA,EAAY,CAAE,OAAOH,CAAO,CAAA,CAC/CN,CAAAA,CAAY,MAAM,OAAO,MAAA,CAAO,IAAA,CAAK,MAAA,CAAQ/E,CAAAA,CAAKwF,CAAY,CAAA,CAGpE,OAAO,KAAA,CAAM,IAAA,CAAK,IAAI,UAAA,CAAWT,CAAS,CAAC,CAAA,CACxC,IAAKrC,CAAAA,EAAMA,CAAAA,CAAE,QAAA,CAAS,EAAE,EAAE,QAAA,CAAS,CAAA,CAAG,GAAG,CAAC,EAC1C,IAAA,CAAK,EAAE,CACZ,CAMA,SAAS0C,CAAAA,CAAgB3C,CAAAA,CAAWC,CAAAA,CAAoB,CACtD,GAAID,CAAAA,CAAE,MAAA,GAAWC,CAAAA,CAAE,MAAA,CACjB,OAAO,MAAA,CAGT,IAAInB,CAAAA,CAAS,CAAA,CACb,QAASyB,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIP,CAAAA,CAAE,OAAQO,CAAAA,EAAAA,CAC5BzB,CAAAA,EAAUkB,CAAAA,CAAE,UAAA,CAAWO,CAAC,CAAA,CAAIN,CAAAA,CAAE,UAAA,CAAWM,CAAC,EAE5C,OAAOzB,CAAAA,GAAW,CACpB,CASO,SAASkE,CAAAA,CAAcC,CAAAA,CAAeC,CAAAA,CAAS,GAAA,CAAa,CACjE,GAAI,CACF,IAAM7C,CAAAA,CAAM,KAAK,SAAA,CACf4C,CAAAA,CACA,CAACE,CAAAA,CAAMhG,IACD,OAAOA,CAAAA,EAAU,QAAA,CACZ,CAAA,EAAGA,CAAK,CAAA,CAAA,CAAA,CAGVA,CAAAA,CAET,CACF,CAAA,CACA,OAAKkD,CAAAA,CAGDA,CAAAA,CAAI,MAAA,EAAU6C,CAAAA,CACT7C,EAGF,CAAA,EAAGA,CAAAA,CAAI,KAAA,CAAM,CAAA,CAAG6C,CAAM,CAAC;AAAA,gBAAA,EAAqB7C,CAAAA,CAAI,MAAM,CAAA,aAAA,CAAA,CANpD,aAOX,MAAQ,CACN,OAAO,kBACT,CACF","file":"chunk-PXRV64PA.js","sourcesContent":["// Runtime check that bundlers (webpack, esbuild, turbopack, rollup) inline\n// based on the consumer's NODE_ENV. Without this, the published bundle bakes\n// in `true` and dev-mode validation runs in every consumer's production\n// build — a real footgun the v1.5/v1.6 release hit.\nexport default typeof process !== \"undefined\" &&\n  process.env?.NODE_ENV !== \"production\";\n","/**\n * Shared utilities for Directive\n */\n\n// ============================================================================\n// Deep freeze\n// ============================================================================\n\n/**\n * Recursively `Object.freeze` an object including nested objects, arrays, and\n * array elements. Uses a `WeakSet` to handle cycles. Skips primitives and\n * already-frozen values to avoid wasted work.\n *\n * Used at definition-registration sites (constraints, derivations, effects,\n * events, prefixed specs) so post-registration mutation of a nested operand\n * cannot silently change the compiled closure's behavior. Prefer\n * {@link freezeSpec} at registration sites — it documents the convention.\n */\nexport function deepFreeze<T>(\n  value: T,\n  seen: WeakSet<object> = new WeakSet(),\n): T {\n  if (value === null || typeof value !== \"object\") {\n    return value;\n  }\n  const obj = value as unknown as object;\n  if (seen.has(obj) || Object.isFrozen(obj)) {\n    return value;\n  }\n  seen.add(obj);\n\n  if (Array.isArray(obj)) {\n    for (const item of obj) {\n      deepFreeze(item, seen);\n    }\n  } else {\n    for (const key of Object.keys(obj)) {\n      deepFreeze((obj as Record<string, unknown>)[key], seen);\n    }\n  }\n\n  Object.freeze(obj);\n  return value;\n}\n\n/**\n * Freeze a definition spec at registration. Centralizes the deepFreeze\n * convention so a new definition arm cannot forget it — every constraint,\n * derivation, effect, event, and prefixed-spec registration funnels through\n * this single helper.\n *\n * @param spec - The definition spec to freeze (mutated in place, returned)\n * @returns The same `spec` value, now deeply frozen\n *\n * @example\n * ```ts\n * // At registration time, freeze user-supplied specs so post-registration\n * // mutation cannot silently change the compiled closure's behavior.\n * const spec = freezeSpec(userPredicate);\n * memoizePredicate(spec);\n * ```\n */\nexport function freezeSpec<T>(spec: T): T {\n  return deepFreeze(spec);\n}\n\n/**\n * Wrap a synthesized definition function so a `[Directive]`-prefixed error\n * thrown from inside it is re-thrown with the owning definition's category +\n * id injected, and the original error preserved as `cause`. Non-`[Directive]`\n * errors (user code, native) pass through untouched.\n *\n * Centralizes the owner-attribution wrap shared by the data-form `when`\n * (constraints), `on` (effects), and `compute` (derivations) closures — a\n * `[Directive]`-prefixed throw (e.g. `$matches: string`) is re-pointed at the\n * owning definition so the stack trace blames user config, not the runtime.\n *\n * @param category - The owning definition kind, used in the re-thrown message.\n * @param id - The owning definition's id.\n * @param fn - The synthesized function to wrap.\n * @returns A function with identical signature that re-attributes Directive errors.\n */\nexport function attributeError<A extends unknown[], R>(\n  category: \"constraint\" | \"effect\" | \"derivation\",\n  id: string,\n  fn: (...args: A) => R,\n): (...args: A) => R {\n  // Synchronous by design: the wrapped definition functions (memoized\n  // predicate `when`/`on` closures, template closures) always return\n  // synchronously. A `try/catch` only re-attributes a synchronous throw — an\n  // async-returning fn's rejected promise would escape un-re-attributed.\n  return (...args: A): R => {\n    try {\n      return fn(...args);\n    } catch (e) {\n      if (e instanceof Error && e.message.startsWith(\"[Directive] \")) {\n        throw new Error(\n          `[Directive] ${category} '${id}': ${e.message.slice(\"[Directive] \".length)}`,\n          { cause: e },\n        );\n      }\n      throw e;\n    }\n  };\n}\n\n/**\n * Execute a promise with a timeout, properly cleaning up the timer.\n * Used by both constraints and resolvers for timeout handling.\n *\n * @param promise - The promise to wrap with a timeout\n * @param ms - Timeout duration in milliseconds\n * @param errorMessage - Error message if timeout occurs\n * @returns The promise result\n * @throws Error if timeout is exceeded\n */\nexport async function withTimeout<T>(\n  promise: Promise<T>,\n  ms: number,\n  errorMessage: string,\n): Promise<T> {\n  let timeoutId: ReturnType<typeof setTimeout>;\n\n  const timeoutPromise = new Promise<never>((_, reject) => {\n    timeoutId = setTimeout(() => reject(new Error(errorMessage)), ms);\n  });\n\n  try {\n    return await Promise.race([promise, timeoutPromise]);\n  } finally {\n    clearTimeout(timeoutId!);\n  }\n}\n\n/**\n * Normalize an error to an Error instance.\n * Ensures consistent error handling throughout the library.\n *\n * @param error - The error to normalize (can be anything)\n * @returns An Error instance\n */\nexport function normalizeError(error: unknown): Error {\n  if (error instanceof Error) {\n    return error;\n  }\n  return new Error(String(error));\n}\n\n/**\n * Create a stable JSON string with sorted keys.\n * Handles circular references and deeply nested objects safely.\n *\n * @param value - The value to stringify\n * @param maxDepth - Maximum nesting depth (default: 50)\n * @returns A stable JSON string\n */\nexport function stableStringify(value: unknown, maxDepth = 50): string {\n  const seen = new WeakSet();\n\n  /** Stringify a primitive value (null, undefined, string, number, boolean, function, symbol). */\n  function stringifyPrimitive(val: unknown): string | undefined {\n    if (val === null) return \"null\";\n    if (val === undefined) return \"undefined\";\n\n    const type = typeof val;\n    if (type === \"string\") return JSON.stringify(val);\n    if (type === \"number\" || type === \"boolean\") return String(val);\n    if (type === \"function\") return '\"[function]\"';\n    if (type === \"symbol\") return '\"[symbol]\"';\n\n    return undefined;\n  }\n\n  /** Guard against circular references using a seen-set, then delegate to fn. */\n  function withCircularGuard(obj: object, fn: () => string): string {\n    if (seen.has(obj)) {\n      return '\"[circular]\"';\n    }\n    seen.add(obj);\n    const result = fn();\n    seen.delete(obj);\n\n    return result;\n  }\n\n  /** Stringify an array with circular reference protection. */\n  function stringifyArray(val: unknown[], depth: number): string {\n    return withCircularGuard(\n      val,\n      () => `[${val.map((v) => stringify(v, depth + 1)).join(\",\")}]`,\n    );\n  }\n\n  /** Stringify an object with sorted keys and circular reference protection. */\n  function stringifyObject(\n    obj: Record<string, unknown>,\n    depth: number,\n  ): string {\n    return withCircularGuard(obj, () => {\n      const keys = Object.keys(obj).sort();\n      const pairs = keys.map(\n        (k) => `${JSON.stringify(k)}:${stringify(obj[k], depth + 1)}`,\n      );\n\n      return `{${pairs.join(\",\")}}`;\n    });\n  }\n\n  /** Recursively stringify a value with depth limit and circular detection. */\n  function stringify(val: unknown, depth: number): string {\n    if (depth > maxDepth) {\n      return '\"[max depth exceeded]\"';\n    }\n\n    // BigInt is not JSON-serializable; encode with a trailing 'n' to remain\n    // distinct from numeric strings.\n    if (typeof val === \"bigint\") {\n      return `${val.toString()}n`;\n    }\n\n    const primitive = stringifyPrimitive(val);\n    if (primitive !== undefined) {\n      return primitive;\n    }\n\n    // Typed-value branches: each prefix is bare (no outer quotes) so it can\n    // never collide with a JSON-encoded string. `JSON.stringify(\"D:...\")`\n    // emits `\"D:...\"` (the wrapping quotes ARE part of the output string),\n    // whereas the Date branch emits `D:...` (no quotes). Distinct outputs.\n    if (val instanceof Date) {\n      return `D:${val.toISOString()}`;\n    }\n    if (val instanceof RegExp) {\n      return `R:${val.source}:${val.flags}`;\n    }\n    if (val instanceof Map) {\n      const entries = [...val.entries()].sort();\n      return `M:${stringify(entries, depth + 1)}`;\n    }\n    if (val instanceof Set) {\n      const items = [...val].sort();\n      return `S:${stringify(items, depth + 1)}`;\n    }\n\n    if (Array.isArray(val)) {\n      return stringifyArray(val, depth);\n    }\n\n    if (typeof val === \"object\") {\n      return stringifyObject(val as Record<string, unknown>, depth);\n    }\n\n    return '\"[unknown]\"';\n  }\n\n  return stringify(value, 0);\n}\n\n/**\n * Check for prototype pollution in an object, including nested objects.\n * Returns true if the object is safe, false if dangerous keys are found.\n *\n * @param obj - The object to check\n * @param maxDepth - Maximum nesting depth to check (default: 50)\n * @returns True if safe, false if dangerous keys found\n */\nexport function isPrototypeSafe(obj: unknown, maxDepth = 50): boolean {\n  const dangerousKeys = new Set([\"__proto__\", \"constructor\", \"prototype\"]);\n  const seen = new WeakSet();\n\n  /** Guard against circular references using a seen-set, then delegate to fn. */\n  function withCircularGuard(objVal: object, fn: () => boolean): boolean {\n    if (seen.has(objVal)) return true;\n    seen.add(objVal);\n    const result = fn();\n    seen.delete(objVal);\n\n    return result;\n  }\n\n  /** Check array elements for prototype pollution keys. */\n  function checkArray(arr: unknown[], depth: number): boolean {\n    for (const item of arr) {\n      if (!check(item, depth + 1)) {\n        return false;\n      }\n    }\n\n    return true;\n  }\n\n  /** Check object keys and values for prototype pollution. */\n  function checkObject(\n    objVal: Record<string, unknown>,\n    depth: number,\n  ): boolean {\n    for (const key of Object.keys(objVal)) {\n      if (dangerousKeys.has(key)) {\n        return false;\n      }\n      if (!check(objVal[key], depth + 1)) {\n        return false;\n      }\n    }\n\n    return true;\n  }\n\n  /** Recursively check a value tree for dangerous prototype keys. */\n  function check(val: unknown, depth: number): boolean {\n    if (depth > maxDepth) return false; // Fail safe at max depth - don't assume safety\n    if (val === null || val === undefined) return true;\n    if (typeof val !== \"object\") return true;\n\n    const objVal = val as Record<string, unknown>;\n\n    if (Array.isArray(objVal)) {\n      return withCircularGuard(objVal, () => checkArray(objVal, depth));\n    }\n\n    return withCircularGuard(objVal, () => checkObject(objVal, depth));\n  }\n\n  return check(obj, 0);\n}\n\n/**\n * Shallow equality comparison for objects.\n * Used by React hooks to avoid unnecessary re-renders.\n *\n * @param a - First object\n * @param b - Second object\n * @returns True if objects are shallowly equal\n */\nexport function shallowEqual<T extends Record<string, unknown>>(\n  a: T,\n  b: T,\n): boolean {\n  if (a === b) return true;\n  if (!a || !b) return false;\n\n  const keysA = Object.keys(a);\n  const keysB = Object.keys(b);\n\n  if (keysA.length !== keysB.length) return false;\n\n  for (const key of keysA) {\n    if (a[key] !== b[key]) return false;\n  }\n\n  return true;\n}\n\n/**\n * Generate a simple hash string from an object.\n * Uses djb2 algorithm on the stable stringified value.\n *\n * **Limitations:**\n * - 32-bit hash output means collision probability increases with data set size\n *   (birthday paradox: ~50% collision chance at ~77,000 distinct values)\n * - Suitable for: cache invalidation, change detection, deduplication of small sets\n * - NOT suitable for: cryptographic use, security-sensitive operations, large-scale deduplication\n *\n * For security-sensitive use cases requiring stronger collision resistance,\n * consider using a cryptographic hash like SHA-256.\n *\n * @param value - The value to hash\n * @returns A hex hash string (8 characters, 32 bits)\n */\nexport function hashObject(value: unknown): string {\n  const str = stableStringify(value);\n  let hash = 5381;\n  for (let i = 0; i < str.length; i++) {\n    hash = ((hash << 5) + hash) ^ str.charCodeAt(i);\n  }\n  // Convert to unsigned 32-bit and then to hex\n  return (hash >>> 0).toString(16);\n}\n\n// ============================================================================\n// Distributable Snapshot Utilities\n// ============================================================================\n\n/**\n * Distributable snapshot type for type-safe helper functions.\n */\nexport interface DistributableSnapshotLike<T = Record<string, unknown>> {\n  data: T;\n  createdAt: number;\n  expiresAt?: number;\n  version?: string;\n  metadata?: Record<string, unknown>;\n}\n\n/**\n * Check if a distributable snapshot has expired.\n * Returns false if the snapshot has no expiresAt field.\n *\n * @example\n * ```typescript\n * const snapshot = system.getDistributableSnapshot({ ttlSeconds: 3600 });\n * // ... later ...\n * if (isSnapshotExpired(snapshot)) {\n *   // Refresh the snapshot\n * }\n * ```\n *\n * @param snapshot - The snapshot to check\n * @param now - Optional current timestamp (defaults to Date.now())\n * @returns True if the snapshot has expired, false otherwise\n */\nexport function isSnapshotExpired<T>(\n  snapshot: DistributableSnapshotLike<T>,\n  now: number = Date.now(),\n): boolean {\n  return snapshot.expiresAt !== undefined && now > snapshot.expiresAt;\n}\n\n/**\n * Validate a distributable snapshot and return its data.\n * Throws if the snapshot is malformed or has expired.\n *\n * @example\n * ```typescript\n * const cached = JSON.parse(await redis.get(`entitlements:${userId}`));\n * try {\n *   const data = validateSnapshot(cached);\n *   // Use data.canUseFeature, etc.\n * } catch (e) {\n *   // Snapshot invalid or expired, refresh it\n * }\n * ```\n *\n * @example Using custom timestamp for testing\n * ```typescript\n * const snapshot = { data: { test: true }, createdAt: 1000, expiresAt: 2000 };\n * validateSnapshot(snapshot, 1500); // Returns { test: true }\n * validateSnapshot(snapshot, 2500); // Throws: Snapshot expired\n * ```\n *\n * @param snapshot - The snapshot to validate\n * @param now - Optional current timestamp (defaults to Date.now())\n * @returns The snapshot data if valid\n * @throws Error if the snapshot is malformed or has expired\n */\nexport function validateSnapshot<T>(\n  snapshot: DistributableSnapshotLike<T>,\n  now: number = Date.now(),\n): T {\n  // Structural validation\n  if (!snapshot || typeof snapshot !== \"object\") {\n    throw new Error(\n      \"[Directive] Invalid snapshot: expected an object with 'data' and 'createdAt' properties.\",\n    );\n  }\n  if (!(\"data\" in snapshot)) {\n    throw new Error(\n      \"[Directive] Invalid snapshot: missing required 'data' property.\",\n    );\n  }\n  if (!(\"createdAt\" in snapshot) || typeof snapshot.createdAt !== \"number\") {\n    throw new Error(\n      \"[Directive] Invalid snapshot: missing or invalid 'createdAt' property (expected number).\",\n    );\n  }\n\n  // Expiration validation\n  if (isSnapshotExpired(snapshot, now)) {\n    const expiredAt = new Date(snapshot.expiresAt!).toISOString();\n    throw new Error(\n      `[Directive] Snapshot expired at ${expiredAt}. Obtain a fresh snapshot from the source.`,\n    );\n  }\n  return snapshot.data;\n}\n\n/**\n * Diff result for a single changed value.\n */\nexport interface SnapshotDiffEntry {\n  /** The key path that changed (e.g., \"canUseApi\" or \"limits.apiCalls\") */\n  path: string;\n  /** The value in the old snapshot */\n  oldValue: unknown;\n  /** The value in the new snapshot */\n  newValue: unknown;\n  /** Type of change: \"added\", \"removed\", or \"changed\" */\n  type: \"added\" | \"removed\" | \"changed\";\n}\n\n/**\n * Result of diffing two snapshots.\n */\nexport interface SnapshotDiff {\n  /** Whether the snapshots are identical */\n  identical: boolean;\n  /** List of changes between snapshots */\n  changes: SnapshotDiffEntry[];\n  /** Whether the version changed (if both have versions) */\n  versionChanged: boolean;\n  /** Old version (if available) */\n  oldVersion?: string;\n  /** New version (if available) */\n  newVersion?: string;\n}\n\n/**\n * Compare two distributable snapshots and return the differences.\n * Useful for debugging, audit logs, and webhook payloads.\n *\n * @example\n * ```typescript\n * const oldSnapshot = system.getDistributableSnapshot({ includeVersion: true });\n * system.dispatch({ type: \"upgradePlan\", plan: \"pro\" });\n * const newSnapshot = system.getDistributableSnapshot({ includeVersion: true });\n *\n * const diff = diffSnapshots(oldSnapshot, newSnapshot);\n * if (!diff.identical) {\n *   console.log(\"Changes:\", diff.changes);\n *   // [{ path: \"canUseApi\", oldValue: false, newValue: true, type: \"changed\" }]\n * }\n * ```\n *\n * @param oldSnapshot - The previous snapshot\n * @param newSnapshot - The new snapshot\n * @returns A diff result with all changes\n */\nexport function diffSnapshots<T = Record<string, unknown>>(\n  oldSnapshot: DistributableSnapshotLike<T>,\n  newSnapshot: DistributableSnapshotLike<T>,\n): SnapshotDiff {\n  const changes: SnapshotDiffEntry[] = [];\n\n  /** Push a change entry to the diff results. */\n  function pushChange(\n    path: string,\n    oldValue: unknown,\n    newValue: unknown,\n    type: SnapshotDiffEntry[\"type\"],\n  ): void {\n    changes.push({ path, oldValue, newValue, type });\n  }\n\n  /** Handle null/undefined comparison cases. Returns true if fully handled. */\n  function compareNullish(\n    oldObj: unknown,\n    newObj: unknown,\n    path: string,\n  ): boolean {\n    if (oldObj === null || oldObj === undefined) {\n      if (newObj !== null && newObj !== undefined) {\n        pushChange(path, oldObj, newObj, \"added\");\n      }\n\n      return true;\n    }\n    if (newObj === null || newObj === undefined) {\n      pushChange(path, oldObj, newObj, \"removed\");\n\n      return true;\n    }\n\n    return false;\n  }\n\n  /** Compare two arrays element by element, recursing into each. */\n  function compareArrays(\n    oldArr: unknown[],\n    newArr: unknown[],\n    path: string,\n  ): void {\n    if (oldArr.length !== newArr.length) {\n      pushChange(path, oldArr, newArr, \"changed\");\n\n      return;\n    }\n    for (let i = 0; i < oldArr.length; i++) {\n      compare(oldArr[i], newArr[i], `${path}[${i}]`);\n    }\n  }\n\n  /** Compare two objects by key union, detecting added/removed/changed. */\n  function compareObjects(\n    oldRecord: Record<string, unknown>,\n    newRecord: Record<string, unknown>,\n    path: string,\n  ): void {\n    const allKeys = new Set([\n      ...Object.keys(oldRecord),\n      ...Object.keys(newRecord),\n    ]);\n\n    for (const key of allKeys) {\n      const childPath = path ? `${path}.${key}` : key;\n      if (!(key in oldRecord)) {\n        pushChange(childPath, undefined, newRecord[key], \"added\");\n      } else if (!(key in newRecord)) {\n        pushChange(childPath, oldRecord[key], undefined, \"removed\");\n      } else {\n        compare(oldRecord[key], newRecord[key], childPath);\n      }\n    }\n  }\n\n  /** Recursively compare two values and record differences. */\n  function compare(oldObj: unknown, newObj: unknown, path: string): void {\n    if (compareNullish(oldObj, newObj, path)) {\n      return;\n    }\n\n    // Handle primitives\n    if (typeof oldObj !== \"object\" || typeof newObj !== \"object\") {\n      if (!Object.is(oldObj, newObj)) {\n        pushChange(path, oldObj, newObj, \"changed\");\n      }\n\n      return;\n    }\n\n    // Handle arrays\n    if (Array.isArray(oldObj) && Array.isArray(newObj)) {\n      compareArrays(oldObj, newObj, path);\n\n      return;\n    }\n\n    // Handle objects\n    compareObjects(\n      oldObj as Record<string, unknown>,\n      newObj as Record<string, unknown>,\n      path,\n    );\n  }\n\n  // Compare data\n  compare(oldSnapshot.data, newSnapshot.data, \"\");\n\n  // Check version change\n  const versionChanged =\n    oldSnapshot.version !== newSnapshot.version &&\n    (oldSnapshot.version !== undefined || newSnapshot.version !== undefined);\n\n  return {\n    identical: changes.length === 0,\n    changes,\n    versionChanged,\n    oldVersion: oldSnapshot.version,\n    newVersion: newSnapshot.version,\n  };\n}\n\n// ============================================================================\n// Snapshot Signing (HMAC)\n// ============================================================================\n\n/**\n * A signed distributable snapshot.\n * Contains the original snapshot plus a cryptographic signature.\n */\nexport interface SignedSnapshot<T = Record<string, unknown>>\n  extends DistributableSnapshotLike<T> {\n  /** HMAC-SHA256 signature in hex format */\n  signature: string;\n  /** Signing algorithm used */\n  algorithm: \"hmac-sha256\";\n}\n\n/**\n * Check if a snapshot is signed.\n *\n * @param snapshot - The snapshot to check\n * @returns True if the snapshot has a signature\n */\nexport function isSignedSnapshot<T>(\n  snapshot: DistributableSnapshotLike<T> | SignedSnapshot<T>,\n): snapshot is SignedSnapshot<T> {\n  return \"signature\" in snapshot && typeof snapshot.signature === \"string\";\n}\n\n/**\n * Sign a distributable snapshot using HMAC-SHA256.\n * Creates a tamper-proof signature that can be verified later.\n *\n * **Security Notes:**\n * - Use a cryptographically random secret of at least 32 bytes\n * - Store the secret securely (environment variable, secrets manager)\n * - Never expose the secret to clients\n * - The signature covers all snapshot fields for integrity\n *\n * @example\n * ```typescript\n * const snapshot = system.getDistributableSnapshot({\n *   includeDerivations: ['canUseFeature', 'limits'],\n *   ttlSeconds: 3600,\n * });\n *\n * // Sign the snapshot (server-side only)\n * const signed = await signSnapshot(snapshot, process.env.SNAPSHOT_SECRET);\n *\n * // Store in JWT, Redis, or send to client\n * const jwt = createJWT({ snapshot: signed });\n *\n * // Later, verify the signature\n * const isValid = await verifySnapshotSignature(signed, process.env.SNAPSHOT_SECRET);\n * if (!isValid) {\n *   throw new Error('Snapshot has been tampered with');\n * }\n * ```\n *\n * @param snapshot - The snapshot to sign\n * @param secret - The HMAC secret (string or Uint8Array)\n * @returns A signed snapshot with the signature attached\n */\nexport async function signSnapshot<T>(\n  snapshot: DistributableSnapshotLike<T>,\n  secret: string | Uint8Array,\n): Promise<SignedSnapshot<T>> {\n  // Create a canonical representation for signing\n  const payload = stableStringify({\n    data: snapshot.data,\n    createdAt: snapshot.createdAt,\n    expiresAt: snapshot.expiresAt,\n    version: snapshot.version,\n    metadata: snapshot.metadata,\n  });\n\n  const signature = await hmacSha256(payload, secret);\n\n  return {\n    ...snapshot,\n    signature,\n    algorithm: \"hmac-sha256\",\n  };\n}\n\n/**\n * Verify the signature of a signed snapshot.\n * Returns true if the signature is valid, false otherwise.\n *\n * **Important:** Always verify signatures before trusting snapshot data,\n * especially if the snapshot was received from an untrusted source (client, cache).\n *\n * @example\n * ```typescript\n * // Receive signed snapshot from client or cache\n * const snapshot = JSON.parse(cachedData);\n *\n * // Verify before using\n * const isValid = await verifySnapshotSignature(snapshot, process.env.SNAPSHOT_SECRET);\n * if (!isValid) {\n *   throw new Error('Invalid snapshot signature - possible tampering');\n * }\n *\n * // Now safe to use snapshot.data\n * if (snapshot.data.canUseFeature.api) {\n *   // Grant access\n * }\n * ```\n *\n * @param signedSnapshot - The signed snapshot to verify\n * @param secret - The HMAC secret (must match the signing secret)\n * @returns True if signature is valid, false otherwise\n */\nexport async function verifySnapshotSignature<T>(\n  signedSnapshot: SignedSnapshot<T>,\n  secret: string | Uint8Array,\n): Promise<boolean> {\n  if (!signedSnapshot.signature || signedSnapshot.algorithm !== \"hmac-sha256\") {\n    return false;\n  }\n\n  // Recreate the canonical payload (same as signing)\n  const payload = stableStringify({\n    data: signedSnapshot.data,\n    createdAt: signedSnapshot.createdAt,\n    expiresAt: signedSnapshot.expiresAt,\n    version: signedSnapshot.version,\n    metadata: signedSnapshot.metadata,\n  });\n\n  const expectedSignature = await hmacSha256(payload, secret);\n\n  // Use timing-safe comparison\n  return timingSafeEqual(signedSnapshot.signature, expectedSignature);\n}\n\n/**\n * Create HMAC-SHA256 signature of a message.\n * Uses Web Crypto API for cross-platform support (Node.js, browsers, Deno, Bun).\n */\nasync function hmacSha256(\n  message: string,\n  secret: string | Uint8Array,\n): Promise<string> {\n  // Convert secret to Uint8Array if string\n  const secretBytes: Uint8Array =\n    typeof secret === \"string\" ? new TextEncoder().encode(secret) : secret;\n\n  // Import key for HMAC\n  const algorithm: HmacImportParams = {\n    name: \"HMAC\",\n    hash: { name: \"SHA-256\" },\n  };\n  const key = await crypto.subtle.importKey(\n    \"raw\",\n    secretBytes as unknown as ArrayBuffer,\n    algorithm,\n    false,\n    [\"sign\"],\n  );\n\n  // Sign the message\n  const messageBytes = new TextEncoder().encode(message);\n  const signature = await crypto.subtle.sign(\"HMAC\", key, messageBytes);\n\n  // Convert to hex string\n  return Array.from(new Uint8Array(signature))\n    .map((b) => b.toString(16).padStart(2, \"0\"))\n    .join(\"\");\n}\n\n/**\n * Timing-safe string comparison to prevent timing attacks.\n * Both strings should be the same length (hex signatures from same algorithm).\n */\nfunction timingSafeEqual(a: string, b: string): boolean {\n  if (a.length !== b.length) {\n    return false;\n  }\n\n  let result = 0;\n  for (let i = 0; i < a.length; i++) {\n    result |= a.charCodeAt(i) ^ b.charCodeAt(i);\n  }\n  return result === 0;\n}\n\n/**\n * Safely stringify any value for display. Handles circular references,\n * BigInt, throwing toJSON, and optional truncation.\n *\n * This is the canonical implementation – all packages should import this\n * instead of maintaining local copies.\n */\nexport function safeStringify(data: unknown, maxLen = 500): string {\n  try {\n    const str = JSON.stringify(\n      data,\n      (_key, value) => {\n        if (typeof value === \"bigint\") {\n          return `${value}n`;\n        }\n\n        return value;\n      },\n      2,\n    );\n    if (!str) {\n      return \"[undefined]\";\n    }\n    if (str.length <= maxLen) {\n      return str;\n    }\n\n    return `${str.slice(0, maxLen)}\\n... (truncated, ${str.length} chars total)`;\n  } catch {\n    return \"[unserializable]\";\n  }\n}\n"]}

package/dist/chunk-R2GHSCTR.js

@@ -0,0 +1,3 @@
+import {p,j as j$1,q,i as i$1,k as k$1,h as h$1,r,u,s,v}from'./chunk-2FF6QGOA.js';import {k,j,l,m,i,h}from'./chunk-I722BZA5.js';import {f,e,a,b,c,d,h as h$2}from'./chunk-PXRV64PA.js';var qe=class extends Error{constructor(x,h,T,g,p=true){super(x);this.source=h;this.sourceId=T;this.context=g;this.recoverable=p;this.name="DirectiveError";}};function St(){return {create(f){return f}}}function Rt(){return {create(f){return f}}}function bt(f){return f}function wt(f){return f}function Kt(f){return f._mode==="single"}function Bt(f){return f._mode==="namespaced"}function fe(f){if(!f)return;let o=Object.assign(Object.create(null),f);return Array.isArray(o.tags)&&Object.freeze(o.tags),Object.freeze(o)}function Wt(f){return typeof f=="object"&&f!==null&&Object.hasOwn(f,"compute")&&typeof f.compute=="function"}function Dt(f){return typeof f=="boolean"?{enabled:f,maxSnapshots:100}:{enabled:true,maxSnapshots:f.maxSnapshots??100}}function Ze(f$1){let{historyOption:o,facts:x,store:h,onSnapshot:T,onHistoryChange:g}=f$1,{enabled:p,maxSnapshots:A}=Dt(o),z=[],M=-1,J=1,N=false,X=false,K=[],C=null,$=-1;function q(){return h.toObject()}function j(){let _=q();try{return structuredClone(_)}catch{try{return JSON.parse(JSON.stringify(_))}catch{return {..._}}}}function Q(_){if(!f(_)){console.error("[Directive] Potential prototype pollution detected in snapshot data, skipping restore");return}h.batch(()=>{for(let[W,te]of Object.entries(_)){if(W==="__proto__"||W==="constructor"||W==="prototype"){console.warn(`[Directive] Skipping dangerous key "${W}" during fact restoration`);continue}x[W]=te;}});}return {get isEnabled(){return p},get isRestoring(){return X},get isPaused(){return N},get snapshots(){return [...z]},get currentIndex(){return M},takeSnapshot(_){if(!p||N)return {id:-1,timestamp:Date.now(),facts:{},trigger:_};let W={id:J++,timestamp:Date.now(),facts:j(),trigger:_};for(M<z.length-1&&z.splice(M+1),z.push(W),M=z.length-1;z.length>A;)z.shift(),M--;return T?.(W),W},restore(_){if(p){N=true,X=true;try{Q(_.facts);}finally{N=false,X=false;}}},goBack(_=1){if(!p||z.length===0)return;let W=M,te=M,ne=K.find(l=>M>l.startIndex&&M<=l.endIndex);if(ne)te=ne.startIndex;else if(K.find(s=>M===s.startIndex)){let s=K.find(y=>y.endIndex<M&&M-y.endIndex<=_);te=s?s.startIndex:Math.max(0,M-_);}else te=Math.max(0,M-_);if(W===te)return;M=te;let c=z[M];c&&(this.restore(c),g?.(W,te));},goForward(_=1){if(!p||z.length===0)return;let W=M,te=M,ne=K.find(l=>M>=l.startIndex&&M<l.endIndex);if(ne?te=ne.endIndex:te=Math.min(z.length-1,M+_),W===te)return;M=te;let c=z[M];c&&(this.restore(c),g?.(W,te));},goTo(_){if(!p)return;let W=z.findIndex(c=>c.id===_);if(W===-1){console.warn(`[Directive] Snapshot ${_} not found`);return}let te=M;M=W;let ne=z[M];ne&&(this.restore(ne),g?.(te,W));},replay(){if(!p||z.length===0)return;M=0;let _=z[0];_&&this.restore(_);},export(){return JSON.stringify({version:1,snapshots:z,currentIndex:M})},import(_){if(p)try{let W=JSON.parse(_);if(typeof W!="object"||W===null)throw new Error("[Directive] Invalid history data: expected object");if(W.version!==1)throw new Error(`[Directive] Unsupported history export version: ${W.version}`);if(!Array.isArray(W.snapshots))throw new Error("[Directive] Invalid history data: snapshots must be an array");if(typeof W.currentIndex!="number")throw new Error("Invalid history data: currentIndex must be a number");for(let ne of W.snapshots){if(typeof ne!="object"||ne===null)throw new Error("[Directive] Invalid snapshot: expected object");if(typeof ne.id!="number"||typeof ne.timestamp!="number"||typeof ne.trigger!="string"||typeof ne.facts!="object")throw new Error("Invalid snapshot structure");if(!f(ne.facts))throw new Error("[Directive] Invalid fact data: potential prototype pollution detected in nested objects")}z.length=0,z.push(...W.snapshots),M=W.currentIndex;let te=z[M];te&&this.restore(te);}catch(W){console.error("[Directive] Failed to import history data:",W);}},beginChangeset(_){p&&(C=_,$=M);},endChangeset(){!p||C===null||(M>$&&K.push({label:C,startIndex:$,endIndex:M}),C=null,$=-1);},pause(){N=true;},resume(){N=false;}}}function Ye(){let f={id:-1,timestamp:0,facts:{},trigger:""};return {isEnabled:false,isRestoring:false,isPaused:false,snapshots:[],currentIndex:-1,takeSnapshot:()=>f,restore:()=>{},goBack:()=>{},goForward:()=>{},goTo:()=>{},replay:()=>{},export:()=>"{}",import:()=>{},beginChangeset:()=>{},endChangeset:()=>{},pause:()=>{},resume:()=>{}}}var Qe=new WeakMap;function kt(f,o){if(o)return o(f);let x=Qe.get(f);if(x!==void 0)return x;let{type:h,...T}=f,g=e(T),p=`${h}:${g}`;return Qe.set(f,p),p}function Ae(f,o,x){return {requirement:f,id:kt(f,x),fromConstraint:o}}function Xt(f){return o=>({type:f,...o})}function Gt(f,o){return f.type===o}function Zt(f){return o=>o.type===f}var ke=class f{map=new Map;add(o){this.map.has(o.id)||this.map.set(o.id,o);}remove(o){return this.map.delete(o)}has(o){return this.map.has(o)}get(o){return this.map.get(o)}all(){return [...this.map.values()]}ids(){return [...this.map.keys()]}get size(){return this.map.size}clear(){this.map.clear();}clone(){let o=new f;for(let x of this.map.values())o.add(x);return o}diff(o){let x=[],h=[];for(let T of this.map.values())o.has(T.id)||x.push(T);for(let T of o.map.values())this.map.has(T.id)||h.push(T);return {added:x,removed:h}}};var Et=5e3;function et(f){let{definitions:o,facts:x,requirementKeys:h$1={},defaultTimeout:T=Et,onEvaluate:g,onError:p$1}=f,A=new Map;function z(t,r){if(!r||typeof r.when=="function")return;let d=r.when;if(a&&(r.async&&console.warn(`[Directive] constraint "${t}": data \`when\` is always sync; \`async: true\` will be ignored`),r.deps&&console.warn(`[Directive] constraint "${t}": data \`when\` cannot be combined with explicit \`deps\` \u2014 deps are tracked automatically`)),r.deps&&(r.deps=void 0),M(d))throw new Error(`[Directive] constraint "${t}": $changed is effects-only \u2014 constraint when has no prev snapshot. Move the change-detection to an effect, or use a boolean derivation as a synthetic prev.`);if(d===null||typeof d!="object")throw new Error(`[Directive] memoizePredicate: predicate must be a plain object or array; got ${typeof d}`);a&&j$1(d)&&console.warn(`[Directive] constraint '${t}': data spec has no operators, combinators, or clauses \u2014 looks like a config object passed by mistake. Either pass a predicate like { phase: 'red' } or a function.`),b(d);let w=q(d);r.when=c("constraint",t,E=>w(E)),A.set(t,d),r.async&&(r.async=false);}function M(t){let r=false;return i$1(t,{operator(d,w){w==="$changed"&&(r=true);},strayOperatorKey(d){d==="$changed"&&(r=true);}}),r}for(let t of Object.keys(o))z(t,o[t]);let J=new Map,N=new Set,X=new Set,K=new Map,C=new Map,$=new Set,q$1=new Map,j=new Map,Q=false,oe=new Set,_=new Set,W=new Map,te=[],ne=new Map;function c$1(t,r){o[t]&&(W.has(t)||W.set(t,new Set),W.get(t).add(r));}function l(){W.clear();for(let[t,r]of Object.entries(o))if(r.after)for(let d of r.after)c$1(d,t);}function s(t,r,d,w,E){if(d.has(t))return;if(w.has(t)){let ae=r.indexOf(t),ce=[...r.slice(ae),t].join(" \u2192 ");throw new Error(`[Directive] Constraint cycle detected: ${ce}. Remove one of the \`after\` dependencies to break the cycle.`)}w.add(t),r.push(t);let Y=o[t];if(Y?.after)for(let ae of Y.after)o[ae]&&s(ae,r,d,w,E);r.pop(),w.delete(t),d.add(t),E.push(t);}function y(){let t=new Set,r=new Set,d=[];for(let w of Object.keys(o))s(w,[],t,r,d);te=d,ne=new Map(te.map((w,E)=>[w,E]));}y(),l();function O(){for(let[t,r]of Object.entries(o))if(r.after)for(let d of r.after)o[d]||console.warn(`[Directive] Constraint "${t}" references unknown constraint "${d}" in \`after\`. This dependency will be ignored. Check for typos or ensure the constraint exists.`);}a&&O();function G(t,r){return r.async!==void 0?r.async:!!X.has(t)}function re(t){let r=o[t];if(!r)throw new Error(`[Directive] Unknown constraint: ${t}`);let d=G(t,r);d&&X.add(t);let w={id:t,priority:r.priority??0,isAsync:d,lastResult:null,isEvaluating:false,error:null,lastResolvedAt:null,after:r.after??[],hitCount:0,lastActiveAt:null};return J.set(t,w),w}function le(t){return J.get(t)??re(t)}function ve(t,r){if(t.size!==r.size||t.size===0)return  false;for(let d of r)if(!t.has(d))return  false;return  true}function S(t,r){for(let d of r){let w=C.get(d);w&&(w.delete(t),w.size===0&&C.delete(d));}}function i(t,r){for(let d of r)C.has(d)||C.set(d,new Set),C.get(d).add(t);}function D(t){let r=K.get(t);r&&(S(t,r),K.delete(t));}function P(t){W.delete(t);for(let r of W.values())r.delete(t);}function H(t,r){let d=K.get(t)??new Set;ve(d,r)||(S(t,d),i(t,r),K.set(t,r));}function ee(t,r){let d=r.when;if(r.deps)return q$1.set(t,new Set(r.deps)),d(x);let w=h(()=>d(x));return q$1.set(t,w.deps),w.value}function de(t,r,d){r.lastResult=d,d&&(r.hitCount++,r.lastActiveAt=Date.now()),r.isEvaluating=false,g?.(t,d);}function me(t,r,d){r.error=d instanceof Error?d:new Error(String(d)),r.lastResult=false,r.isEvaluating=false,p$1?.(t,d);}function ye(t,r,d){return X.add(t),r.isAsync=true,a&&console.warn(`[Directive] Constraint "${t}" returned a Promise but was not marked as async. Add \`async: true\` to the constraint definition to avoid this warning and improve performance.`),d.then(w=>(de(t,r,w),w)).catch(w=>(me(t,r,w),false))}function he(t){let r=o[t];if(!r)return  false;let d=le(t);d.isEvaluating=true,d.error=null;try{let w=ee(t,r);return w instanceof Promise?ye(t,d,w):(de(t,d,w),w)}catch(w){return me(t,d,w),false}}async function Se(t){let r=o[t];if(!r)return  false;let d$1=le(t),w=r.timeout??T;if(d$1.isEvaluating=true,d$1.error=null,r.deps?.length){let E=new Set(r.deps);H(t,E),q$1.set(t,E);}try{let E=r.when(x),Y=await d(E,w,`Constraint "${t}" timed out after ${w}ms`);return d$1.lastResult=Y,Y&&(d$1.hitCount++,d$1.lastActiveAt=Date.now()),d$1.isEvaluating=!1,g?.(t,Y),Y}catch(E){return d$1.error=E instanceof Error?E:new Error(String(E)),d$1.lastResult=false,d$1.isEvaluating=false,p$1?.(t,E),false}}let we=10;function Me(t,r){if(t==null)return [];if(Array.isArray(t)){let d=t.filter(w=>w!=null);return a&&d.length>we&&r&&console.warn(`[Directive] Constraint "${r}" produced ${d.length} requirements. Consider splitting into multiple constraints for better performance.`),d}return [t]}function Re(t){let r=o[t];if(!r)return {requirements:[],deps:new Set};let d=r.require;if(typeof d=="function"){let{value:E,deps:Y}=h(()=>d(x));return {requirements:Me(E,t),deps:Y}}return {requirements:Me(d,t),deps:new Set}}function F(t,r){if(r.size===0)return;let d=K.get(t)??new Set;for(let w of r)d.add(w);i(t,r),K.set(t,d);}let ie=null;function ge(){return ie||(ie=Object.keys(o).sort((t,r)=>{let d=le(t),E=le(r).priority-d.priority;if(E!==0)return E;let Y=ne.get(t)??0,ae=ne.get(r)??0;return Y-ae})),ie}for(let t of Object.keys(o))re(t);function De(t){for(let[r,d]of Object.entries(t))d.async&&!d.deps&&console.warn(`[Directive] Async constraint "${r}" has no \`deps\` declared. Auto-tracking cannot work across async boundaries. Add \`deps: ["key1", "key2"]\` to enable dependency tracking.`);}a&&De(o);function Ie(t){return !o[t]||N.has(t)||_.has(t)?true:oe.has(t)}function u(t){let r=J.get(t);if(!r||r.after.length===0)return  true;for(let d of r.after)if(!Ie(d))return  false;return  true}function m(t){let r=q$1.get(t);r!==void 0&&H(t,r),_.add(t),j.set(t,[]);}function v(t,r,d){if(r!==void 0){let w=new Set(r);for(let E of d)w.add(E);H(t,w);}else F(t,d);}function I(t,r,d){if(r.length===0){j.set(t,[]);return}let w=r.map(E=>Ae(E,t,h$1[E.type]));for(let E of w)d.add(E);j.set(t,w);}function L(t,r){for(let d of t)r.add(d);}function e(t,r,d){if(N.has(t))return;if(!r){m(t);return}_.delete(t);let w=q$1.get(t),E,Y;try{let ae=Re(t);E=ae.requirements,Y=ae.deps;}catch(ae){p$1?.(t,ae),m(t);return}v(t,w,Y),I(t,E,d);}function n(t,r){let d=[],w=[];for(let E of t){if(u(E)){w.push(E);continue}d.push(E);let Y=j.get(E);Y&&L(Y,r);}return {blocked:d,ready:w}}function a$1(t,r){let d=[];for(let w of t){let E=he(w);if(E instanceof Promise){d.push({id:w,promise:E});continue}e(w,E,r);}return d}async function b$1(t,r){let d=await Promise.all(t.map(async({id:w,promise:E})=>({id:w,active:await E})));for(let{id:w,active:E}of d)e(w,E,r);}async function R(t,r){let{blocked:d,ready:w}=n(t,r);if(w.length===0)return d;let E=[],Y=[];for(let ce of w)le(ce).isAsync?Y.push(ce):E.push(ce);let ae=a$1(E,r);if(ae.length>0&&await b$1(ae,r),Y.length>0){let ce=Y.map(pe=>({id:pe,promise:Se(pe)}));await b$1(ce,r);}return d}function k(t,r){for(let d of t){let w=C.get(d);if(w)for(let E of w)N.has(E)||r.add(E);}}function B(t){for(let r of $)N.has(r)||t.add(r);$.clear();}function U(t){let r=new Set;return k(t,r),B(r),r}function Z(t,r,d){for(let w of t){if(r.has(w))continue;let E=j.get(w);E&&L(E,d);}}return {async evaluate(t){let r=new ke;_.clear();let d=ge(),w=N.size===0?d:d.filter(ce=>!N.has(ce)),E;if(!Q||!t||t.size===0)E=w,Q=true;else {let ce=U(t);E=[...ce],Z(w,ce,r);}let Y=E,ae=E.length+1;for(;Y.length>0&&ae>0;){let ce=Y.length;if(Y=await R(Y,r),Y.length===ce)break;ae--;}return r.all()},getState(t){return J.get(t)},getDependencies(t){return K.get(t)},getAllStates(){return [...J.values()]},disable(t){if(!J.has(t)){console.warn(`[Directive] constraints.disable("${t}") \u2014 no such constraint`);return}N.add(t),ie=null,j.delete(t),D(t),q$1.delete(t);},enable(t){if(!J.has(t)){console.warn(`[Directive] constraints.enable("${t}") \u2014 no such constraint`);return}N.delete(t),ie=null,$.add(t);},isDisabled(t){return N.has(t)},invalidate(t){let r=C.get(t);if(r)for(let d of r)$.add(d);},markResolved(t){oe.add(t);let r=J.get(t);r&&(r.lastResolvedAt=Date.now());let d=W.get(t);if(d)for(let w of d)$.add(w);},isResolved(t){return oe.has(t)},registerDefinitions(t){let r=false;for(let[d,w]of Object.entries(t))o[d]=w,z(d,o[d]),re(d),$.add(d),w.after?.length&&(r=true);ie=null,r&&y(),l();},assignDefinition(t,r){if(!o[t])throw new Error(`[Directive] Cannot assign constraint "${t}" \u2014 it does not exist. Use register() to create it.`);o[t]=r,A.delete(t),z(t,o[t]),re(t),$.add(t),ie=null,y(),l();},unregisterDefinition(t){o[t]&&(delete o[t],J.delete(t),N.delete(t),X.delete(t),$.delete(t),_.delete(t),oe.delete(t),j.delete(t),q$1.delete(t),D(t),P(t),ie=null,y(),l());},async callOne(t,r){if(!o[t])throw new Error(`[Directive] Cannot call constraint "${t}" \u2014 it does not exist.`);if(N.has(t))return [];let w=le(t),E;if(w.isAsync)E=await Se(t);else {let ce=he(t);E=ce instanceof Promise?await ce:ce;}if(!E)return [];let{requirements:Y}=Re(t);if(Y.length===0)return [];let ae=[];for(let ce of Y){let pe=r?{...ce,...r}:ce;ae.push(Ae(pe,t,h$1[pe.type]));}return ae},setRequirementKey(t,r){h$1[t]=r;},removeRequirementKey(t){delete h$1[t];},getWhenSpec(t){return A.get(t)},explainWhen(t){let r=A.get(t);if(r)return p(r,x)}}}function tt(f){let{definitions:o,facts:x,onCompute:h$1,onInvalidate:T,onError:g}=f,p=3,A=new Map;function z(S,i){if(typeof i!="object"||i===null||!Object.hasOwn(i,"compute"))return;let D=i,P=D.compute,H;if(typeof P=="function")H=P;else if(k$1(P))b(P),H=ee=>s(P,ee);else if(typeof P=="object"&&P!==null){b(P);let ee=q(P);H=c("derivation",S,de=>ee(de));}else if(P!==void 0)throw new Error(`[Directive] memoizePredicate: predicate must be a plain object or array; got ${typeof P}`);if(H){o[S]=H;let ee=fe(D.meta);ee&&A.set(S,ee);}}for(let[S,i]of Object.entries(o))z(S,i);let M=new Map,J=new Map,N=new Map,X=new Map,K=0,C=new Set,$=false,q$1=100,j$1;function Q(S,i){let D=M.has(S)?X:N,P=D.get(S);P?.delete(i),P&&P.size===0&&D.delete(S);}function oe(S,i){let D=o[S]?X:N,P=D.get(S);P||(P=new Set,D.set(S,P)),P.add(i);}function _(S){let i=M.get(S);if(i)for(let D of i.dependencies)Q(D,S);}function W(S){let i=X.get(S);if(i){K++;try{for(let D of i)le(D);}finally{K--;}X.delete(S);}}function te(S){delete o[S],M.delete(S),J.delete(S),C.delete(S),A.delete(S);}function ne(S){if(!o[S])throw new Error(`[Directive] Unknown derivation: ${S}`);let D={id:S,compute:()=>l(S),cachedValue:void 0,dependencies:new Set,isStale:true,isComputing:false,stableRunCount:0,depsStable:false};return M.set(S,D),D}function c$1(S){return M.get(S)??ne(S)}function l(S){let i=c$1(S),D=o[S];if(!D)throw new Error(`[Directive] Unknown derivation: ${S}`);if(i.isComputing)throw new Error(`[Directive] Circular dependency detected in derivation: ${S}`);i.isComputing=true;try{let P=i.cachedValue,H,ee;if(i.depsStable&&i.dependencies.size>0)H=D(x,j$1),ee=i.dependencies;else {let de=h(()=>D(x,j$1));H=de.value,ee=de.deps,i.dependencies.size>0&&s$1(ee,i.dependencies)?(i.stableRunCount++,i.stableRunCount>=p&&(i.depsStable=!0)):i.stableRunCount=0;}return i.cachedValue=H,i.isStale=!1,y(S,ee),h$1&&h$1(S,H,P,[...ee]),H}catch(P){throw g?.(S,P),P}finally{i.isComputing=false;}}function s$1(S,i){if(S.size!==i.size)return  false;for(let D of i)if(!S.has(D))return  false;return  true}function y(S,i){let D=c$1(S),P=D.dependencies;if(!s$1(P,i)){for(let H of P)Q(H,S);for(let H of i)oe(H,S);D.dependencies=i;}}function O(S){for(let i of S){let D=J.get(i);if(D)for(let P of D)P();}}function G(){if(!(K>0||$)){$=true;try{let S=0;for(;C.size>0;){if(++S>q$1){let D=[...C];throw C.clear(),new Error(`[Directive] Infinite derivation notification loop detected after ${q$1} iterations. Remaining: ${D.join(", ")}. This usually means a derivation listener is mutating facts that re-trigger the same derivation.`)}let i=[...C];C.clear(),O(i);}}finally{$=false;}}}function re(S,i){let D=X.get(S);if(D)for(let P of D)i.push(P);}function le(S,i=new Set){let D=[S];for(;D.length>0;){let P=D.pop();if(i.has(P))continue;i.add(P);let H=M.get(P);!H||H.isStale||(H.isStale=true,H.depsStable=false,H.stableRunCount=0,T?.(P),C.add(P),re(P,D));}}return j$1=new Proxy({},{get(S,i){if(typeof i=="symbol"||k.has(i)||!o[i])return;j(i);let D=c$1(i);return D.isStale&&l(i),D.cachedValue},set(){return  false},deleteProperty(){return  false},defineProperty(){return  false},getPrototypeOf(){return null},setPrototypeOf(){return  false}}),{get(S){let i=c$1(S);return i.isStale&&l(S),i.cachedValue},isStale(S){return M.get(S)?.isStale??true},invalidate(S){let i=N.get(S);if(!i)return;K++;let D=new Set;try{for(let P of i)le(P,D);}finally{K--,G();}},invalidateMany(S){K++;let i=new Set;try{for(let D of S){let P=N.get(D);if(P)for(let H of P)le(H,i);}}finally{K--,G();}},invalidateAll(){K++;try{for(let S of M.values())S.isStale||(S.isStale=!0,S.depsStable=!1,S.stableRunCount=0,C.add(S.id));}finally{K--,G();}},subscribe(S,i){for(let D of S){let P=D;J.has(P)||J.set(P,new Set),J.get(P).add(i);}return ()=>{for(let D of S){let P=D,H=J.get(P);H?.delete(i),H&&H.size===0&&J.delete(P);}}},getProxy(){return j$1},getDependencies(S){return c$1(S).dependencies},registerDefinitions(S){for(let[i,D]of Object.entries(S))typeof D=="function"?o[i]=D:z(i,D),ne(i);},assignDefinition(S,i){if(!o[S])throw new Error(`[Directive] Cannot assign derivation "${S}" \u2014 it does not exist. Use register() to create it.`);typeof i=="function"?(o[S]=i,A.delete(S)):(A.delete(S),z(S,i));let D=M.get(S);D&&(D.isStale=true,D.depsStable=false,D.stableRunCount=0,C.add(S)),G();},unregisterDefinition(S){o[S]&&(_(S),W(S),te(S),G());},getMeta(S){return A.get(S)},callOne(S){if(!o[S])throw new Error(`[Directive] Cannot call derivation "${S}" \u2014 it does not exist.`);return l(S)}}}var Mt=3;function nt(f){let{definitions:o,facts:x,store:h$2,onRun:T,onError:g}=f,p=new Map,A=null,z=false,M=new Map;function J(c$1){let l=o[c$1];if(!l)throw new Error(`[Directive] Unknown effect: ${c$1}`);M.delete(c$1);let s=null,y=false;if(l.deps)s=new Set(l.deps),y=true;else if(l.on!==void 0){if(!h$1(l.on))throw new Error(`[Directive] effect on must be a FactPredicate spec; got ${typeof l.on}`);if(l.on===null||typeof l.on!="object")throw new Error(`[Directive] memoizePredicate: predicate must be a plain object or array; got ${typeof l.on}`);b(l.on),s=r(l.on),y=true;let G=q(l.on);M.set(c$1,c("effect",c$1,(re,le)=>G(re,le)));}let O={id:c$1,enabled:true,hasExplicitDeps:y,dependencies:s,cleanup:null,stableRunCount:0,depsStable:false};return p.set(c$1,O),O}function N(c){return p.get(c)??J(c)}function X(){return h$2.toObject()}function K(c){c.depsStable=false,c.stableRunCount=0;}function C(c,l){for(let s of c)if(l.has(s))return  true;return  false}function $(c,l){let s=N(c);if(!s.enabled)return  false;if(s.dependencies){if(!C(s.dependencies,l))return  false;s.depsStable&&K(s);let y=M.get(c);if(y){let O=X();return y(O,A??void 0)}return  true}return  true}function q$1(c){if(c.cleanup){try{c.cleanup();}catch(l){g?.(c.id,l),console.error(`[Directive] Effect "${c.id}" cleanup threw an error:`,l);}c.cleanup=null;}}function j(c,l){if(typeof l=="function")if(z)try{l();}catch(s){g?.(c.id,s),console.error(`[Directive] Effect "${c.id}" cleanup threw an error:`,s);}else c.cleanup=l;}async function Q(c,l){let s;if(h$2.batch(()=>{s=l.run(x,A);}),s instanceof Promise){let y=await s;j(c,y);}else j(c,s);}function oe(c,l){if(c.size!==l.size)return  false;for(let s of l)if(!c.has(s))return  false;return  true}function _(c,l){if(!(c.dependencies&&oe(c.dependencies,l))){K(c);return}c.stableRunCount++,c.stableRunCount>=Mt&&(c.depsStable=true);}async function W(c,l){if(c.depsStable&&c.dependencies){await Q(c,l);return}let s,y=h(()=>(h$2.batch(()=>{s=l.run(x,A);}),s)),O=y.deps,G=y.value;G instanceof Promise&&(G=await G),j(c,G),_(c,O),c.dependencies=O.size>0?O:null;}async function te(c){let l=N(c),s=o[c];if(!(!l.enabled||!s)){q$1(l),T?.(c,l.dependencies?[...l.dependencies]:[]);try{l.hasExplicitDeps?await Q(l,s):await W(l,s);}catch(y){g?.(c,y),console.error(`[Directive] Effect "${c}" threw an error:`,y),l.hasExplicitDeps||K(l);}}}for(let c of Object.keys(o))J(c);return {async runEffects(c){let l=[];for(let s of Object.keys(o))$(s,c)&&l.push(s);await Promise.all(l.map(te)),A=X();},async runAll(){let c=Object.keys(o);await Promise.all(c.map(l=>{let s=N(l);return s.enabled?(K(s),te(l)):Promise.resolve()})),A=X();},disable(c){let l=N(c);l.enabled=false;},enable(c){let l=N(c);l.enabled=true;},isEnabled(c){return N(c).enabled},cleanupAll(){z=true;for(let c of p.values())q$1(c);},registerDefinitions(c){for(let[l,s]of Object.entries(c))o[l]=s,J(l);},assignDefinition(c,l){if(!o[c])throw new Error(`[Directive] Cannot assign effect "${c}" \u2014 it does not exist. Use register() to create it.`);let s=p.get(c);s&&q$1(s),o[c]=l,J(c);},unregisterDefinition(c){if(!o[c])return;let l=p.get(c);l&&q$1(l),delete o[c],p.delete(c),M.delete(c);},async callOne(c){let l=o[c];if(!l)throw new Error(`[Directive] Cannot call effect "${c}" \u2014 it does not exist.`);let s=N(c);if(s.enabled){q$1(s),T?.(c,s.dependencies?[...s.dependencies]:[]);try{let y;if(h$2.batch(()=>{y=l.run(x,A);}),y instanceof Promise){let O=await y;j(s,O);}else j(s,y);}catch(y){g?.(c,y),console.error(`[Directive] Effect "${c}" threw an error:`,y);}}}}}function Ct(f={}){let{delayMs:o=1e3,maxRetries:x=3,backoffMultiplier:h=2,maxDelayMs:T=3e4}=f,g=new Map;function p(A){let z=o*h**(A-1);return Math.min(z,T)}return {scheduleRetry(A,z,M,J,N){if(J>x)return null;let X=p(J),K={source:A,sourceId:z,context:M,attempt:J,nextRetryTime:Date.now()+X,callback:N};return g.set(z,K),K},getPendingRetries(){return Array.from(g.values())},processDueRetries(){let A=Date.now(),z=[];for(let[M,J]of g)J.nextRetryTime<=A&&(z.push(J),g.delete(M));return z},cancelRetry(A){g.delete(A);},clearAll(){g.clear();}}}var xt={constraint:"skip",resolver:"skip",effect:"skip",derivation:"skip",system:"throw"};function rt(f={}){let{config:o={},onError:x,onRecovery:h}=f,T=[],g=100,p=Ct(o.retryLater),A=new Map,z=1e3;function M(C,$,q,j){if(q instanceof qe)return q;let Q=q instanceof Error?q.message:String(q),oe=C!=="system";return new qe(Q,C,$,j,oe)}function J(C,$,q){let j=(()=>{switch(C){case "constraint":return o.onConstraintError;case "resolver":return o.onResolverError;case "effect":return o.onEffectError;case "derivation":return o.onDerivationError;default:return}})();if(typeof j=="function"){try{let Q=j(q,$);if(typeof Q=="string")return Q}catch(Q){console.error("[Directive] Error in error handler callback:",Q);}return "skip"}return typeof j=="string"?j:xt[C]}function N(C){T.push(C),T.length>g&&T.shift();try{x?.(C);}catch($){console.error("[Directive] Error in onError callback:",$);}try{o.onError?.(C);}catch($){console.error("[Directive] Error in config.onError callback:",$);}}function X(C,$,q){let j=(A.get($)??0)+1;if(A.set($,j),A.size>z){let oe=A.keys().next().value;oe!==void 0&&A.delete(oe);}return p.scheduleRetry(C,$,q,j)?"retry-later":(A.delete($),typeof process<"u"&&process.env?.NODE_ENV!=="production"&&console.warn(`[Directive] ${C} "${$}" exceeded max retry-later attempts. Skipping.`),"skip")}return {handleError(C,$,q,j){let Q=M(C,$,q,j);N(Q);let oe=J(C,$,q instanceof Error?q:new Error(String(q)));oe==="retry-later"&&(oe=X(C,$,j));try{h?.(Q,oe);}catch(_){console.error("[Directive] Error in onRecovery callback:",_);}if(oe==="throw")throw Q;return oe},getLastError(){return T[T.length-1]??null},getAllErrors(){return [...T]},clearErrors(){T.length=0;},getRetryLaterManager(){return p},processDueRetries(){return p.processDueRetries()},clearRetryAttempts(C){A.delete(C),p.cancelRetry(C);}}}function qt(f,o=100){try{return JSON.stringify(f)?.slice(0,o)??String(f)}catch{return "[circular or non-serializable]"}}function It(f){let{schema:o,onChange:x,onBatch:h}=f,g=Object.keys(o).length===0,p=f.validate??a,A=f.strictKeys??(a&&!g),z=f.redactErrors??false,M=new Map,J=new Set,N=new Map,X=new Set,K=0,C=[],$=new Set,q=false,j$1=[],Q=100;function oe(i){return i!==null&&typeof i=="object"&&"safeParse"in i&&typeof i.safeParse=="function"&&"_def"in i&&"parse"in i&&typeof i.parse=="function"}function _(i){let D=i;if(D._typeName)return D._typeName;if(oe(i)){let P=i._def;if(P?.typeName)return P.typeName.replace(/^Zod/,"").toLowerCase()}return "unknown"}function W(i){return z?"[redacted]":qt(i)}function te(i){return i===null?"null":Array.isArray(i)?"array":typeof i}function ne(i,D,P){let H=P.safeParse(D);if(H.success)return;let ee=te(D),de=W(D),me=H.error?.message??H.error?.issues?.[0]?.message??"Validation failed",ye=_(P);throw new Error(`[Directive] Validation failed for "${i}": expected ${ye}, got ${ee} ${de}. ${me}`)}function c(i){if(typeof i._lastFailedIndex=="number"&&i._lastFailedIndex>=0){let D=` (element at index ${i._lastFailedIndex} failed)`;return i._lastFailedIndex=-1,D}return ""}function l(i,D,P){let H=P._validators;if(!H||!Array.isArray(H)||H.length===0)return;let ee=P._typeName??"unknown";for(let de=0;de<H.length;de++){let me=H[de];if(typeof me!="function"||me(D))continue;let ye=te(D),he=W(D),Se=c(P),we=de===0?"":` (validator ${de+1} failed)`;throw new Error(`[Directive] Validation failed for "${i}": expected ${ee}, got ${ye} ${he}${we}${Se}`)}}function s(i){if(A)throw new Error(`[Directive] Unknown fact key: "${i}". Key not defined in schema.`);console.warn(`[Directive] Unknown fact key: "${i}"`);}function y(i,D){if(!p)return;let P=o[i];if(!P){s(i);return}if(oe(P)){ne(i,D,P);return}l(i,D,P);}function O(i){N.get(i)?.forEach(D=>D());}function G(){X.forEach(i=>i());}function re(i,D,P){if(q){j$1.push({key:i,value:D,prev:P});return}q=true;try{x?.(i,D,P),O(i),G(),le(". A listener is repeatedly mutating facts that re-trigger notifications");}finally{q=false;}}function le(i){let D=0;for(;j$1.length>0;){if(++D>Q)throw j$1.length=0,new Error(`[Directive] Infinite notification loop detected after ${Q} iterations${i}.`);let P=[...j$1];j$1.length=0;for(let H of P)x?.(H.key,H.value,H.prev),O(H.key);G();}}function ve(){if(!(K>0)){if(h&&C.length>0&&h([...C]),$.size>0){q=true;try{for(let i of $)O(i);G(),le(" during flush");}finally{q=false;}}C.length=0,$.clear();}}let S={get(i){return j(i),M.get(i)},has(i){return j(i),M.has(i)},set(i,D){a&&y(i,D);let P=M.get(i);Object.is(P,D)||(M.set(i,D),J.add(i),K>0?(C.push({key:i,value:D,prev:P,type:"set"}),$.add(i)):re(i,D,P));},delete(i){let D=M.get(i);M.delete(i),J.delete(i),K>0?(C.push({key:i,value:void 0,prev:D,type:"delete"}),$.add(i)):re(i,void 0,D);},batch(i){K++;try{i();}finally{K--,ve();}},subscribe(i,D){for(let P of i){let H=P;N.has(H)||N.set(H,new Set),N.get(H).add(D);}return ()=>{for(let P of i){let H=N.get(P);H&&(H.delete(D),H.size===0&&N.delete(P));}}},subscribeAll(i){return X.add(i),()=>X.delete(i)},toObject(){let i={};for(let D of J)M.has(D)&&(i[D]=M.get(D));return i}};return S.destroy=()=>{N.clear(),X.clear();},S.registerKeys=i=>{for(let D of Object.keys(i))k.has(D)||(o[D]=i[D],J.add(D));},S}var Fe=new WeakMap;function it(f,o,x=o){return new Proxy(f,{get(h,T){if(typeof T=="string"&&k.has(T))return;if(T===Symbol.for("nodejs.util.inspect.custom"))return ()=>h;let g=Reflect.get(h,T);if(typeof T=="symbol"||typeof g!="object"||g===null)return g;if(Fe.has(g))return Fe.get(g);let p=it(g,o,`${x}.${String(T)}`);return Fe.set(g,p),p},set(h,T,g){return typeof T!="symbol"&&console.warn(`[Directive] Nested mutation on "facts.${x}.${String(T)}" will not trigger reactivity. Use: facts.${o} = { ...facts.${o}, ... }`),Reflect.set(h,T,g)}})}function Pt(f,o){let x=()=>({get:T=>i(()=>f.get(T)),has:T=>i(()=>f.has(T))});return new Proxy({},{get(T,g){if(typeof g=="symbol")return g===Symbol.for("nodejs.util.inspect.custom")?()=>i(()=>f.toObject()):void 0;if(k.has(g))return;if(g==="$store")return f;if(g==="$snapshot")return x;let p=f.get(g);return a&&p!==null&&typeof p=="object"?it(p,g):p},set(T,g,p){if(typeof g=="symbol"||g==="$store"||g==="$snapshot"||k.has(g))return  false;if(a){let A=l(p);A&&m(g,A);}return f.set(g,p),true},deleteProperty(T,g){return typeof g=="symbol"||g==="$store"||g==="$snapshot"||k.has(g)?false:(f.delete(g),true)},has(T,g){return g==="$store"||g==="$snapshot"?true:typeof g=="symbol"||k.has(g)?false:f.has(g)},ownKeys(){return Object.keys(o)},getOwnPropertyDescriptor(T,g){if(!(typeof g=="string"&&k.has(g)))return g==="$store"||g==="$snapshot"?{configurable:true,enumerable:false,writable:false}:{configurable:true,enumerable:true,writable:true}},defineProperty(){return  false},getPrototypeOf(){return null},setPrototypeOf(){return  false}})}function st(f){let o=It(f),x=Pt(o,f.schema);return {store:o,facts:x}}function ot(){let f=[];function o(g){if(g)try{return g()}catch(p){console.error("[Directive] Plugin error:",p);return}}async function x(g){if(g)try{return await g()}catch(p){console.error("[Directive] Plugin error:",p);return}}function h(g){return (...p)=>{for(let A of f)o(()=>A[g]?.(...p));}}return {register(g){f.some(p=>p.name===g.name)&&(console.warn(`[Directive] Plugin "${g.name}" is already registered, replacing...`),this.unregister(g.name)),f.push(g);},unregister(g){let p=f.findIndex(A=>A.name===g);p!==-1&&f.splice(p,1);},getPlugins(){return [...f]},async emitInit(g){for(let p of f)await x(()=>p.onInit?.(g));},emitStart:h("onStart"),emitStop:h("onStop"),emitDestroy:h("onDestroy"),emitFactSet:h("onFactSet"),emitFactDelete:h("onFactDelete"),emitFactsBatch:h("onFactsBatch"),emitDerivationCompute:h("onDerivationCompute"),emitDerivationInvalidate:h("onDerivationInvalidate"),emitReconcileStart:h("onReconcileStart"),emitReconcileEnd:h("onReconcileEnd"),emitConstraintEvaluate:h("onConstraintEvaluate"),emitConstraintError:h("onConstraintError"),emitRequirementCreated:h("onRequirementCreated"),emitRequirementMet:h("onRequirementMet"),emitRequirementCanceled:h("onRequirementCanceled"),emitResolverStart:h("onResolverStart"),emitResolverComplete:h("onResolverComplete"),emitResolverError:h("onResolverError"),emitResolverRetry:h("onResolverRetry"),emitResolverCancel:h("onResolverCancel"),emitResolverWriteRejected:h("onResolverWriteRejected"),emitEffectRun:h("onEffectRun"),emitEffectError:h("onEffectError"),emitSnapshot:h("onSnapshot"),emitHistoryNavigate:h("onHistoryNavigate"),emitError:h("onError"),emitErrorRecovery:h("onErrorRecovery"),emitDefinitionRegister:h("onDefinitionRegister"),emitDefinitionAssign:h("onDefinitionAssign"),emitDefinitionUnregister:h("onDefinitionUnregister"),emitDefinitionCall:h("onDefinitionCall"),emitTraceComplete:h("onTraceComplete")}}var at={attempts:1,backoff:"none",initialDelay:100,maxDelay:3e4},ct={enabled:false,windowMs:50};function Tt(f,o){if(!o||o==="none")return f;if(o==="full")return Math.floor(Math.random()*f);if(o==="equal"){let x=f/2;return Math.floor(x+Math.random()*x)}if(typeof o=="object"&&"maxMs"in o){let x=Number.isFinite(o.maxMs)&&o.maxMs>0?o.maxMs:0;return f+Math.floor(Math.random()*x)}return f}function Ot(f,o){let{backoff:x,initialDelay:h=100,maxDelay:T=3e4}=f,g;switch(x){case "none":g=h;break;case "linear":g=h*o;break;case "exponential":g=h*2**(o-1);break;default:g=h;}let p=Math.min(g,T),A=Tt(p,f.jitter);return Math.max(1,A)}function jt(f){if(a)for(let[o,x]of Object.entries(f)){if(!x.resolve&&!x.resolveBatch&&!x.resolveBatchWithResults)throw new Error(`[Directive] Resolver "${o}" must define either resolve() or resolveBatch(). Add one of these methods to handle requirements.`);if(!(!x.batch?.enabled||x.resolveBatch||x.resolveBatchWithResults))if(x.resolve)console.warn(`[Directive] Resolver "${o}" has batch.enabled but no resolveBatch(). Falling back to individual resolve() calls. Add resolveBatch() for true bulk operations.`);else throw new Error(`[Directive] Resolver "${o}" has batch.enabled=true but no resolve(), resolveBatch(), or resolveBatchWithResults() method.`)}}function lt(f){let{definitions:o,facts:x,store:h,getConstraintBinding:T,onStart:g,onComplete:p,onError:A,onRetry:z,onCancel:M,onClobber:J,onClobberSuppressed:N,onResolutionComplete:X,onRequeue:K}=f;jt(o);let C=new Map,$=new Map,q=1e3,j=new Map,Q=new Map,oe=1e3;function _(){if($.size>q){let u=$.size-q,m=$.keys();for(let v=0;v<u;v++){let I=m.next().value;I&&$.delete(I);}}}function W(u){return typeof u=="object"&&u!==null&&"requirement"in u&&typeof u.requirement=="string"}function te(u){return typeof u=="object"&&u!==null&&"requirement"in u&&typeof u.requirement=="function"}function ne(u,m){return W(u)?m.type===u.requirement:te(u)?u.requirement(m):false}function c(u,m){let v=Q.get(u);if(!v)return null;Q.delete(u),Q.set(u,v);for(let I of v){let L=o[I];if(L&&ne(L,m))return I}return null}function l(u,m){if(!Q.has(u)){if(Q.size>=oe){let v=Q.keys().next().value;v!==void 0&&Q.delete(v);}Q.set(u,new Set);}Q.get(u).add(m);}function s(u){let m=u.type,v=c(m,u);if(v)return v;for(let[I,L]of Object.entries(o))if(ne(L,u))return l(m,I),I;return null}function y(u){if(!T||!u||!u.fromConstraint)return null;let m=T(u.fromConstraint);return !m||m.fields.length===0?null:m}function O(u,m,v,I,L){let e=x,n=new Set(u.fields),a=10,b=0,R=false,k=new Map;for(let Z of n){let V=v?v[Z]:e[Z];k.set(Z,V);}let B=new Set;function U(Z){return B.has(Z)?false:Object.is(e[Z],k.get(Z))?true:(B.add(Z),b++,b<=a?I&&I(Z,k.get(Z),e[Z]):R||(R=true,L&&L(b-a)),m.abort(),false)}return new Proxy(x,{get(Z,V,t){return Reflect.get(x,V,t)},set(Z,V,t,r){if(typeof V!="string"||!n.has(V))return Reflect.set(x,V,t);if(!U(V))return  true;let d=k.get(V);k.set(V,t);let w=Reflect.set(x,V,t);return w||k.set(V,d),w},deleteProperty(Z,V){if(typeof V!="string"||!n.has(V))return Reflect.deleteProperty(x,V);if(!U(V))return  true;let t=k.get(V);k.set(V,void 0);let r=Reflect.deleteProperty(x,V);return r||k.set(V,t),r},has(Z,V){return Reflect.has(x,V)},ownKeys(){return Reflect.ownKeys(x)},getOwnPropertyDescriptor(Z,V){return Reflect.getOwnPropertyDescriptor(x,V)}})}function G(u,m,v,I,L,e){return {facts:v&&I?O(v,I,L,J&&e?(R,k,B)=>{let{resolverId:U,requirements:Z}=e;for(let V of Z)J(U,V,R,k,B);}:void 0,N&&e?R=>{let{resolverId:k,requirements:B}=e;for(let U of B)N(k,U,R);}:void 0):x,signal:u,snapshot:()=>x.$snapshot(),requeue:()=>{if(K)for(let R of m)K(R);}}}async function re(u,m,v,I){let L=u instanceof Error?u:new Error(String(u));if(I.signal.aborted)return {action:"abort",error:L};if(v.shouldRetry&&!v.shouldRetry(L,m))return {action:"break",error:L};if(m<v.attempts){if(I.signal.aborted)return {action:"abort",error:L};let e=Ot(v,m);if(await new Promise(n=>{let a=setTimeout(n,e),b=()=>{clearTimeout(a),n();};I.signal.addEventListener("abort",b,{once:true});}),I.signal.aborted)return {action:"abort",error:L}}return {action:"continue",error:L}}async function le(u,m,v,I,L,e){if(!u.resolve)return;let n=y(v),a;h.batch(()=>{a=u.resolve(v.requirement,G(I,[v.id],n,L,e,{resolverId:m,requirements:[v]}));});let b=u.timeout;if(b&&b>0){await d(a,b,`Resolver "${m}" timed out after ${b}ms`);return}await a;}function ve(u,m,v){let I=Date.now()-v;$.set(m.id,{state:"success",requirementId:m.id,completedAt:Date.now(),duration:I}),_(),p?.(u,m,I);}function S(u,m,v,I){$.set(m.id,{state:"error",requirementId:m.id,error:v,failedAt:Date.now(),attempts:I}),_(),A?.(u,m,v);}function i(u,m,v){let I=C.get(u);I&&(I.attempt=m,I.status={state:"running",requirementId:u,startedAt:v,attempt:m});}async function D(u,m,v,I,L){let e=await re(u,m,v,I);return e.action==="continue"&&m<v.attempts&&L(m+1),{lastError:e.error,shouldContinue:e.action==="continue"}}async function P(u,m,v,I){let L=o[u];if(!L)return;let e={...at,...L.retry},n=null,a=C.get(m.id)?.startedAt??Date.now();for(let b=1;b<=e.attempts;b++){if(v.signal.aborted)return;i(m.id,b,a);try{await le(L,u,m,v.signal,v,I),ve(u,m,a);return}catch(R){let k=await D(R,b,e,v,B=>z?.(u,m,B));if(n=k.lastError,!k.shouldContinue)break}}S(u,m,n,e.attempts);}async function H(u,m,v){return m&&m>0?d(u,m,v):u}async function ee(u,m,v,I,L,e,n,a){let b;h.batch(()=>{b=u.resolveBatchWithResults(I,L);});let R=await H(b,e,`Batch resolver "${m}" timed out after ${e}ms`);if(R.length!==v.length)throw new Error(`[Directive] Batch resolver "${m}" returned ${R.length} results but expected ${v.length}. Results array must match input order.`);let k=false;for(let B=0;B<v.length;B++){let U=v[B],Z=R[B];if(Z.success){ve(m,U,n);continue}k=true;let V=Z.error??new Error("Batch item failed");$.set(U.id,{state:"error",requirementId:U.id,error:V,failedAt:Date.now(),attempts:a}),A?.(m,U,V);}return !k||v.some((B,U)=>R[U]?.success)?"done":"retry"}async function de(u,m,v,I,L,e,n){let a;h.batch(()=>{a=u.resolveBatch(I,L);}),await H(a,e,`Batch resolver "${m}" timed out after ${e}ms`);for(let b of v)ve(m,b,n);}function me(u,m,v,I){for(let L of m)S(u,L,v,I);}async function ye(u,m){await Promise.all(m.map(v=>{let I=new AbortController;return P(u,v,I)}));}async function he(u,m,v,I,L,e,n,a,b){let R=null;if(v.length>0){let U=v[0];v.every(V=>V.fromConstraint===U.fromConstraint)&&(R=y(U));}let k=G(I,v.map(U=>U.id),R,L,b,{resolverId:m,requirements:v}),B=v.map(U=>U.requirement);return u.resolveBatchWithResults?ee(u,m,v,B,k,e,n,a):(await de(u,m,v,B,k,e,n),"done")}function Se(u,m,v){for(let I of m)z?.(u,I,v);}async function we(u,m,v,I,L,e){let n=new AbortController,a=Date.now(),b=null;for(let R=1;R<=I.attempts;R++){if(n.signal.aborted)return null;try{if(await he(u,m,v,n.signal,n,L,a,R,e)==="done")return null}catch(k){let B=await D(k,R,I,n,U=>Se(m,v,U));if(b=B.lastError,!B.shouldContinue)break}}return b}async function Me(u,m,v){let I=o[u];if(!I)return;if(!I.resolveBatch&&!I.resolveBatchWithResults){await ye(u,m);return}let L={...at,...I.retry},n={...ct,...I.batch}.timeoutMs??I.timeout,a=await we(I,u,m,L,n,v);a&&me(u,m,a,L.attempts);}let Re=1e4;function F(u){u.timer&&(clearTimeout(u.timer),u.timer=null);}function ie(u){return j.has(u)||j.set(u,{resolverId:u,requirements:[],baselines:[],timer:null}),j.get(u)}function ge(u,m,v){let I=o[u];if(!I)return;let L={...ct,...I.batch},e=ie(u),n=L.maxSize||Re;if(e.requirements.length>=n&&(F(e),De(u)),e.requirements.push(m),e.baselines.push(v),L.maxSize&&e.requirements.length>=L.maxSize){F(e),De(u);return}F(e),e.timer=setTimeout(()=>{De(u);},L.windowMs);}function De(u){let m=j.get(u);if(!m||m.requirements.length===0)return;let v=[...m.requirements],I;for(let L=m.baselines.length-1;L>=0;L--){let e=m.baselines[L];if(e!==void 0){I=e;break}}m.requirements=[],m.baselines=[],m.timer=null,Me(u,v,I).then(()=>{X?.();});}return {resolve(u,m){if(C.has(u.id))return;let v=s(u.requirement);if(!v){a&&console.warn(`[Directive] No resolver found for requirement type "${u.requirement.type}" (id: ${u.id})`);return}let I=o[v];if(!I)return;if(I.batch?.enabled){ge(v,u,m?.factsBaseline);return}let L=new AbortController,e=Date.now(),n={requirementId:u.id,resolverId:v,controller:L,startedAt:e,attempt:1,status:{state:"pending",requirementId:u.id,startedAt:e},originalRequirement:u};C.set(u.id,n),g?.(v,u),P(v,u,L,m?.factsBaseline).finally(()=>{C.delete(u.id)&&X?.();});},cancel(u){let m=C.get(u);if(m){m.controller.abort(),C.delete(u),$.set(u,{state:"canceled",requirementId:u,canceledAt:Date.now()}),_(),M?.(m.resolverId,m.originalRequirement);return}for(let v of j.values()){let I=v.requirements.findIndex(L=>L.id===u);if(I!==-1){let[L]=v.requirements.splice(I,1);v.baselines.splice(I,1),$.set(u,{state:"canceled",requirementId:u,canceledAt:Date.now()}),_(),L&&M?.(v.resolverId,L);return}}},detach(u){C.delete(u);},cancelAll(){let u=[...C.keys()];for(let m of u)this.cancel(m);for(let m of j.values()){m.timer&&clearTimeout(m.timer);for(let v of m.requirements)$.set(v.id,{state:"canceled",requirementId:v.id,canceledAt:Date.now()}),M?.(m.resolverId,v);}j.clear(),_();},getStatus(u){let m=C.get(u);if(m)return m.status;let v=$.get(u);return v||{state:"idle"}},getInflight(){return [...C.keys()]},getInflightInfo(){return [...C.values()].map(u=>({id:u.requirementId,resolverId:u.resolverId,startedAt:u.startedAt}))},getInflightCount(){return C.size},isResolving(u){return C.has(u)},processBatches(){for(let u of j.keys())De(u);},hasPendingBatches(){for(let u of j.values())if(u.requirements.length>0)return  true;return  false},registerDefinitions(u){for(let[m,v]of Object.entries(u))o[m]=v;Q.clear();},assignDefinition(u,m){if(!o[u])throw new Error(`[Directive] Cannot assign resolver "${u}" \u2014 it does not exist. Use register() to create it.`);o[u]=m,Q.clear();},unregisterDefinition(u){if(!o[u])return;for(let[v,I]of C)I.resolverId===u&&(I.controller.abort(),C.delete(v),$.set(v,{state:"canceled",requirementId:v,canceledAt:Date.now()}),M?.(u,I.originalRequirement));let m=j.get(u);if(m){m.timer&&clearTimeout(m.timer);for(let v of m.requirements)$.set(v.id,{state:"canceled",requirementId:v.id,canceledAt:Date.now()}),M?.(u,v);j.delete(u);}delete o[u],Q.clear(),_();},async callOne(u,m){let v=o[u];if(!v)throw new Error(`[Directive] Cannot call resolver "${u}" \u2014 it does not exist.`);let I=new AbortController,L=G(I.signal,[]);if(v.resolve){let e;h.batch(()=>{e=v.resolve(m,L);}),await e;}},destroy(){this.cancelAll(),$.clear(),Q.clear();}}}function ut(f){let{mergedDerive:o,getDerivation:x,definitions:h}=f,T={register:(g,p)=>h.register("derivation",g,p),assign:(g,p)=>h.assign("derivation",g,p),unregister:g=>h.unregister("derivation",g),call:g=>h.call("derivation",g),isDynamic:g=>h.isDynamic("derivation",g),listDynamic:()=>h.listDynamic("derivation")};return new Proxy({},{get(g,p){if(typeof p!="symbol"&&!k.has(p)){if(p in T)return T[p];if(p in o)return x(p)}},has(g,p){return typeof p=="symbol"||k.has(p)?false:p in o||p in T},ownKeys(){return Object.keys(o)},getOwnPropertyDescriptor(g,p){if(typeof p!="symbol"&&!k.has(p)&&(p in o||p in T))return {configurable:true,enumerable:true}},set(){return  false},defineProperty(){return  false},getPrototypeOf(){return null},setPrototypeOf(){return  false}})}function dt(f){let{mergedEvents:o,dispatchEvent:x}=f;return new Proxy({},{get(h,T){if(typeof T!="symbol"&&!k.has(T))return g=>{x(T,g);}},has(h,T){return typeof T=="symbol"||k.has(T)?false:T in o},ownKeys(){return Object.keys(o)},getOwnPropertyDescriptor(h,T){if(typeof T!="symbol"&&!k.has(T)&&T in o)return {configurable:true,enumerable:true}},set(){return  false},defineProperty(){return  false},getPrototypeOf(){return null},setPrototypeOf(){return  false}})}var $t=new Set(["register","assign","unregister","call","isDynamic","listDynamic"]);function ft(f){let{mergedConstraints:o,mergedResolvers:x,mergedDerive:h,mergedEffects:T,constraintsManager:g,resolversManager:p,derivationsManager:A,effectsManager:z,pluginManager:M,getState:J,scheduleReconcile:N,maxDeferredRegistrations:X}=f,K={constraints:new Set,resolvers:new Set,derivations:new Set,effects:new Set},C={constraints:new Map,resolvers:new Map,derivations:new Map,effects:new Map},$=[];function q(c){if($t.has(c))throw new Error(`[Directive] Derivation ID "${c}" conflicts with a reserved derive method name.`)}let j={constraint:{label:"Constraint",mergedMap:o,manager:g,dynamicSet:K.constraints,originalsMap:C.constraints,reconciles:true},resolver:{label:"Resolver",mergedMap:x,manager:p,dynamicSet:K.resolvers,originalsMap:C.resolvers,reconciles:true},derivation:{label:"Derivation",mergedMap:h,manager:A,dynamicSet:K.derivations,originalsMap:C.derivations,reconciles:false,validateId:q},effect:{label:"Effect",mergedMap:T,manager:z,dynamicSet:K.effects,originalsMap:C.effects,reconciles:false}};function Q(c){if(typeof c!="string"||c.length===0)throw new Error(`[Directive] Definition ID must be a non-empty string. Received: ${String(c)}`);if(k.has(c))throw new Error(`[Directive] Security: Definition ID "${c}" is a blocked property.`);if(c.includes("::"))throw new Error(`[Directive] Definition ID "${c}" cannot contain "::". This separator is reserved for namespacing.`)}function oe(c,l,s){let y=j[c];if(y.validateId?.(l),l in y.mergedMap)throw new Error(`[Directive] ${y.label} "${l}" already exists. Use assign() to override.`);if(c!=="derivation"){let O=s;O.meta&&(O.meta=fe(O.meta));}y.mergedMap[l]=s,y.manager.registerDefinitions({[l]:s}),y.dynamicSet.add(l),M.emitDefinitionRegister(c,l,s),y.reconciles&&N();}function _(c,l,s){let y=j[c];if(y.validateId?.(l),!(l in y.mergedMap))throw new Error(`[Directive] ${y.label} "${l}" does not exist. Use register() to create it.`);if(c!=="derivation"){let G=s;G.meta&&(G.meta=fe(G.meta));}let O=y.mergedMap[l];y.manager.assignDefinition(l,s),y.originalsMap.set(l,O),y.mergedMap[l]=s,M.emitDefinitionAssign(c,l,s,O),y.reconciles&&N();}function W(c,l){let s=j[c];if(!s.dynamicSet.has(l)){a&&console.warn(`[Directive] Cannot unregister static ${c} "${l}". Only dynamically registered ${c}s can be removed.`);return}s.manager.unregisterDefinition(l),delete s.mergedMap[l],s.dynamicSet.delete(l),s.originalsMap.delete(l),M.emitDefinitionUnregister(c,l),s.reconciles&&N();}function te(){if($.length===0)return;let c=$.splice(0);for(let l of c)try{switch(l.op){case "register":oe(l.type,l.id,l.def);break;case "assign":_(l.type,l.id,l.def);break;case "unregister":W(l.type,l.id);break}}catch(s){a&&console.error(`[Directive] Error in deferred ${l.op} for ${l.type} "${l.id}":`,s);}}function ne(c,l,s,y){let{isDestroyed:O,isReconciling:G}=J();if(O)throw new Error(`[Directive] Cannot ${c} ${l} "${s}" on a destroyed system.`);if(Q(s),G){if($.length>=X)throw new Error(`[Directive] Too many deferred registrations (max ${X}). Avoid calling register/assign/unregister in resolver or effect callbacks during reconciliation.`);c==="unregister"?$.push({op:c,type:l,id:s}):$.push({op:c,type:l,id:s,def:y});return}switch(c){case "register":oe(l,s,y);break;case "assign":_(l,s,y);break;case "unregister":W(l,s);break}}return {register(c,l,s){ne("register",c,l,s);},assign(c,l,s){ne("assign",c,l,s);},unregister(c,l){ne("unregister",c,l);},call(c,l,s){let{isDestroyed:y}=J();if(y)throw new Error(`[Directive] Cannot call ${c} "${l}" on a destroyed system.`);switch(Q(l),M.emitDefinitionCall(c,l,s),c){case "constraint":return g.callOne(l,s);case "resolver":return p.callOne(l,s);case "derivation":return A.callOne(l);case "effect":return z.callOne(l)}},isDynamic(c,l){switch(c){case "constraint":return K.constraints.has(l);case "resolver":return K.resolvers.has(l);case "derivation":return K.derivations.has(l);case "effect":return K.effects.has(l)}},listDynamic(c){switch(c){case "constraint":return [...K.constraints];case "resolver":return [...K.resolvers];case "derivation":return [...K.derivations];case "effect":return [...K.effects]}},flushDeferred:te,getOriginal(c,l){let y={constraint:C.constraints,resolver:C.resolvers,derivation:C.derivations,effect:C.effects}[c];if(y)return y.get(l)},restoreOriginal(c,l){let y={constraint:C.constraints,resolver:C.resolvers,derivation:C.derivations,effect:C.effects}[c];if(!y||!y.has(l))return  false;let O=y.get(l);return ne("assign",c,l,O),y.delete(l),true},destroy(){$.length=0,K.constraints.clear(),K.resolvers.clear(),K.derivations.clear(),K.effects.clear(),C.constraints.clear(),C.resolvers.clear(),C.derivations.clear(),C.effects.clear();}}}function gt(f){let{traceConfig:o,pluginManager:x,resolverMetaLookup:h}=f;if(!(o===true||typeof o=="object"&&o!==null))return {enabled:false,recordFactChange(){},startRun(){return 0},currentTrace:null,getEntries(){return null},attributeResolverStart(){},recordResolverComplete(){},recordResolverError(){},decrementInflight(){},finalizeCurrentRun(){},drainPendingChanges(){},destroy(){}};let g=(typeof o=="object"&&o!==null?o.maxRuns:void 0)??100,p=[],A=new Map,z=0,M=null,J=[],N=new Map,X=new Map,K=new Map,C=null,$=0,q=0,j={count:0,totalDuration:0,avgDuration:0,maxDuration:0,avgResolverCount:0,totalResolverCount:0,avgFactChangeCount:0,totalFactChangeCount:0};function Q(s){let y=A.get(s);if(y&&y.status==="pending"){y.status="settled";let O=K.get(s);y.duration=O!==void 0?performance.now()-O:Date.now()-y.timestamp,K.delete(s),X.delete(s),y.causalChain=W(y),te(y),q++,x.emitTraceComplete(y);}}function oe(s){let y=N.get(s);if(N.delete(s),y!==void 0){let O=(X.get(y)??1)-1;O<=0?Q(y):X.set(y,O);}}function _(){let s=p.shift();if(s&&(A.delete(s.id),K.delete(s.id),s.status==="pending")){X.delete(s.id);for(let[y,O]of N)O===s.id&&N.delete(y);}}function W(s){let y=[];for(let O of s.factChanges)y.push(`${O.key} changed`);for(let O of s.derivationsRecomputed)y.push(`${O.id} recomputed`);for(let O of s.constraintsHit)y.push(`${O.id} constraint hit`);for(let O of s.requirementsAdded)y.push(`${O.type} requirement added`);for(let O of s.resolversCompleted)y.push(`${O.resolver} resolved (${O.duration.toFixed(0)}ms)`);for(let O of s.resolversErrored)y.push(`${O.resolver} errored`);for(let O of s.effectsRun)y.push(`${O.id} effect ran`);return y.join(" \u2192 ")}function te(s){j.count++,j.totalDuration+=s.duration,j.avgDuration=j.totalDuration/j.count,s.duration>j.maxDuration&&(j.maxDuration=s.duration);let y=s.resolversStarted.length;j.totalResolverCount+=y,j.avgResolverCount=j.totalResolverCount/j.count;let O=s.factChanges.length;j.totalFactChangeCount+=O,j.avgFactChangeCount=j.totalFactChangeCount/j.count;let G=[];j.count>3&&s.duration>j.avgDuration*5&&G.push(`Duration ${s.duration.toFixed(0)}ms is 5x+ above average (${j.avgDuration.toFixed(0)}ms)`),s.resolversErrored.length>0&&G.push(`${s.resolversErrored.length} resolver(s) errored`),G.length>0&&(s.anomalies=G);}function ne(s){p.push(s),A.set(s.id,s),p.length>g&&_(),q++;}function c(s){return s.factChanges.length>0||s.constraintsHit.length>0||s.requirementsAdded.length>0||s.effectsRun.length>0}return {enabled:true,get currentTrace(){return M},set currentTrace(s){M=s;},recordFactChange(s,y,O){J.push({key:s,oldValue:y,newValue:O});},startRun(){let s=performance.now(),y=++z;return K.set(y,s),M={id:y,timestamp:Date.now(),duration:0,status:"pending",factChanges:J.splice(0),derivationsRecomputed:[],constraintsHit:[],requirementsAdded:[],requirementsRemoved:[],resolversStarted:[],resolversCompleted:[],resolversErrored:[],effectsRun:[],effectErrors:[]},s},getEntries(){return (!C||$!==q)&&(C=[...p],$=q),C},attributeResolverStart(s){M&&N.set(s,M.id);},recordResolverComplete(s,y,O){let G=N.get(s);if(G!==void 0){let re=A.get(G);re&&re.resolversCompleted.push({resolver:y,requirementId:s,duration:O,meta:h?.(y)});}},recordResolverError(s,y,O){let G=N.get(s);if(G!==void 0){let re=A.get(G);re&&re.resolversErrored.push({resolver:y,requirementId:s,error:O,meta:h?.(y)});}},decrementInflight(s){oe(s);},finalizeCurrentRun(s){if(!M)return;if(M.duration=performance.now()-s,!c(M)){K.delete(M.id),M=null;return}let y=M.resolversStarted.length;y===0?(M.status="settled",M.causalChain=W(M),te(M),ne(M),x.emitTraceComplete(M)):(M.status="pending",ne(M),X.set(M.id,y)),M=null;},drainPendingChanges(){J.length=0;},destroy(){p.length=0,A.clear(),N.clear(),X.clear(),K.clear(),J.length=0,M=null,C=null;}}}function mt(f,o){for(let[x,h]of Object.entries(f)){if(typeof h!="object"||h===null)continue;let T=Object.hasOwn(h,"handler"),g=Object.hasOwn(h,"patch");if(T&&g&&a&&console.warn(`[Directive] event "${x}": both \`handler\` and \`patch\` provided \u2014 using \`handler\` (patch is ignored).`),T){let p=h;if(f[x]=p.handler,p.meta){let A=fe(p.meta);A&&o.set(x,A);}continue}if(g){let p=h,A=p.patch;if(b(A),f[x]=(z,M)=>v(A,z,M??{}),p.meta){let z=fe(p.meta);z&&o.set(x,z);}}}}function Jn(f$1){let o=Object.create(null),x=Object.create(null),h=Object.create(null),T=Object.create(null),g=Object.create(null),p=Object.create(null),A=new Map,z=new Map,M=new Map,J=new Map,N=new Map;for(let e of f$1.modules){let n=(b,R)=>{if(b)for(let k$1 of Object.keys(b)){if(k.has(k$1))throw new Error(`[Directive] Security: Module "${e.id}" has dangerous key "${k$1}" in ${R}. This could indicate a prototype pollution attempt.`);if(R==="schema"&&k$1.startsWith("$"))throw new Error(`[Directive] Module "${e.id}" has schema key "${k$1}" starting with "$". Keys starting with $ are reserved for internal accessors ($store, $snapshot).`)}};n(e.schema,"schema"),n(e.events,"events"),n(e.derive,"derive"),n(e.effects,"effects"),n(e.constraints,"constraints"),n(e.resolvers,"resolvers");for(let b of Object.keys(e.schema)){let R=M.get(b);if(R)throw new Error(`[Directive] Schema collision: Fact "${b}" is defined in both module "${R}" and "${e.id}". Use namespacing (e.g., "${e.id}::${b}") or merge into one module.`);M.set(b,e.id);}let a=(b,R)=>{if(b)for(let k of Object.keys(b)){let B=J.get(k);if(B&&B!==e.id)throw new Error(`[Directive] Definition collision: ${R} "${k}" is defined in both module "${B}" and "${e.id}". Use namespacing or rename to avoid conflicts.`);J.set(k,e.id);}};if(a(e.derive,"derivation"),a(e.effects,"effect"),a(e.constraints,"constraint"),a(e.resolvers,"resolver"),a(e.events,"event"),Object.assign(o,e.schema),e.events&&(mt(e.events,z),Object.assign(x,e.events)),e.derive&&Object.assign(h,e.derive),e.effects&&Object.assign(T,e.effects),e.constraints&&Object.assign(g,e.constraints),e.resolvers){Object.assign(p,e.resolvers);for(let b of Object.keys(e.resolvers))N.set(b,e);}if(e.meta){let b=fe(e.meta);b&&A.set(e.id,b);}}for(let e of Object.values(g))e.meta&&(e.meta=fe(e.meta));for(let e of Object.values(p))e.meta&&(e.meta=fe(e.meta));for(let e of Object.values(T)){let n=e;n.meta&&(n.meta=fe(n.meta));}for(let e of Object.values(o)){let n=e;n._meta&&(n._meta=fe(n._meta));}let X=null;if(f$1.modules.some(e=>e.history?.snapshotEvents)){X=new Set;for(let e of f$1.modules){let n=e;if(n.history?.snapshotEvents)for(let a of n.history.snapshotEvents)X.add(a);else if(n.events)for(let a of Object.keys(n.events))X.add(a);}}let C=0,$=false;if(a){let e=new Set(Object.keys(h));for(let n of Object.keys(o))e.has(n)&&console.warn(`[Directive] "${n}" exists as both a fact and a derivation. This may cause unexpected dependency tracking behavior.`);}let q=ot();for(let e of f$1.plugins??[])q.register(e);let j=q.getPlugins().length>0,Q=q.register.bind(q),oe=q.unregister.bind(q);q.register=e=>{Q(e),j=true;},q.unregister=e=>{oe(e),j=q.getPlugins().length>0;};let _=()=>j,W=rt({config:f$1.errorBoundary,onError:e=>q.emitError(e),onRecovery:(e,n)=>q.emitErrorRecovery(e,n)}),te=null,ne=()=>{},c=()=>{},l=null,s=gt({traceConfig:f$1.trace,pluginManager:q,resolverMetaLookup:e=>p[e]?.meta}),y=s.enabled,{store:O,facts:G}=st({schema:o,onChange:(e,n,a)=>{q.emitFactSet(e,n,a),ne(e),y&&s.recordFactChange(String(e),a,n),!l?.isRestoring&&(C===0&&($=true),F.changedKeys.add(e),ge());},onBatch:e=>{q.emitFactsBatch(e);let n=[];for(let a of e)n.push(a.key);if(y)for(let a of e)s.recordFactChange(a.key,a.prev,a.type==="delete"?void 0:a.value);if(c(n),!l?.isRestoring){C===0&&($=true);for(let a of e)F.changedKeys.add(a.key);ge();}}}),re=tt({definitions:h,facts:G,onCompute:(e,n,a,b)=>{_()&&q.emitDerivationCompute(e,n,b),s.currentTrace&&s.currentTrace.derivationsRecomputed.push({id:e,deps:b?[...b]:[],oldValue:a,newValue:n,meta:re.getMeta(e)});},onInvalidate:e=>{_()&&q.emitDerivationInvalidate(e);},onError:(e,n)=>{W.handleError("derivation",e,n)==="retry"&&re.invalidate(e);}});ne=e=>re.invalidate(e),c=e=>re.invalidateMany(e);let le=nt({definitions:T,facts:G,store:O,onRun:(e,n)=>{_()&&q.emitEffectRun(e),s.currentTrace&&s.currentTrace.effectsRun.push({id:e,triggeredBy:n,meta:T[e]?.meta});},onError:(e,n)=>{let a=W.handleError("effect",e,n);_()&&q.emitEffectError(e,n),s.currentTrace&&s.currentTrace.effectErrors.push({id:e,error:String(n),meta:T[e]?.meta}),a==="disable"&&le.disable(e),a==="retry"&&(F.changedKeys.add("*"),ge());}});function ve(e){if(Array.isArray(e)){let n=e;return a=>u(n,a)}return e}let S=Object.create(null);for(let e of Object.values(p))e.key&&typeof e.requirement=="string"&&(S[e.requirement]=ve(e.key));let i=et({definitions:g,facts:G,requirementKeys:S,onEvaluate:(e,n)=>{if(_()){let a=i.explainWhen(e);q.emitConstraintEvaluate(e,n,a);}},onError:(e,n)=>{let a=W.handleError("constraint",e,n);_()&&q.emitConstraintError(e,n),a==="disable"&&i.disable(e);}});function D(e){for(let n of Object.values(e))n.key&&typeof n.requirement=="string"&&i.setRequirementKey(n.requirement,ve(n.key));}function P(e){let n=g[e];if(!n?.owns||n.owns.length===0)return;let a$1=i.getState(e);if(a$1?.isAsync||n.async){a&&(a$1?.isAsync&&!n.async?console.warn(`[Directive] constraint '${e}': owns binding disabled because when() returned a Promise \u2014 convert to a synchronous when, mark the constraint async: true and accept the binding being off, or use a data-form when (always sync).`):console.warn(`[Directive] Constraint "${e}" has \`owns\` but is async. Binding is disabled \u2014 async constraints cannot be bound.`));return}return {fields:n.owns}}let H=new Set,ee=lt({definitions:p,facts:G,store:O,getConstraintBinding:P,onStart:(e,n)=>{_()&&q.emitResolverStart(e,n);},onComplete:(e,n,a)=>{W.clearRetryAttempts(e),_()&&(q.emitResolverComplete(e,n,a),q.emitRequirementMet(n,e)),i.markResolved(n.fromConstraint),y&&(s.recordResolverComplete(n.id,e,a),s.decrementInflight(n.id));},onError:(e,n,a)=>{let b=W.handleError("resolver",e,a,n);if(_()&&q.emitResolverError(e,n,a),b==="disable"&&i.disable(n.fromConstraint),b==="retry"&&(F.previousRequirements.remove(n.id),ge()),b==="retry-later"){let U=W.getRetryLaterManager().getPendingRetries().find(Z=>Z.sourceId===e);U&&!U.callback&&(U.callback=()=>{ge();});}y&&(s.recordResolverError(n.id,e,String(a)),s.decrementInflight(n.id));let R=N.get(e),k=R?.hooks?.onResolverError;if(k){let B=a instanceof Error?a:new Error(String(a));try{k(B,n.requirement,{facts:G});}catch(U){console.error(`[Directive] onResolverError hook for module "${R?.id}" threw:`,U);}}},onRetry:(e,n,a)=>q.emitResolverRetry(e,n,a),onCancel:(e,n)=>{q.emitResolverCancel(e,n),q.emitRequirementCanceled(n),y&&s.decrementInflight(n.id);},onClobber:(e,n,a,b,R)=>{_()&&q.emitResolverWriteRejected({kind:"rejection",resolver:e,req:n,reason:"clobbered",fact:a,expected:b,actual:R});},onClobberSuppressed:(e,n,a)=>{_()&&q.emitResolverWriteRejected({kind:"summary",resolver:e,req:n,reason:"clobbered",dropped:a});},onResolutionComplete:()=>{Se(),ge();},onRequeue:e=>{H.add(e);}}),de=new Set;function me(){for(let e of de)e();}let ye=f$1.history?Ze({historyOption:f$1.history,facts:G,store:O,onSnapshot:e=>{q.emitSnapshot(e),me();},onHistoryChange:(e,n)=>{q.emitHistoryNavigate(e,n),me();}}):Ye();l=ye;let he=new Set;function Se(){for(let e of he)e();}let we=50,Me=100,Re=0,F={isRunning:false,isReconciling:false,reconcileScheduled:false,isInitializing:false,isInitialized:false,isReady:false,isDestroyed:false,changedKeys:new Set,previousRequirements:new ke,readyPromise:null,readyResolve:null},ie=ft({mergedConstraints:g,mergedResolvers:p,mergedDerive:h,mergedEffects:T,constraintsManager:i,resolversManager:ee,derivationsManager:re,effectsManager:le,pluginManager:q,getState:()=>F,scheduleReconcile:ge,maxDeferredRegistrations:Me});function ge(){!F.isRunning||F.reconcileScheduled||F.isInitializing||(F.reconcileScheduled=true,Se(),queueMicrotask(()=>{F.reconcileScheduled=false,F.isRunning&&!F.isInitializing&&De().catch(e=>{a&&console.error("[Directive] Unexpected error in reconcile:",e);});}));}async function De(){if(F.isReconciling)return;if(Re++,Re>we){a&&console.warn(`[Directive] Reconcile loop exceeded ${we} iterations. This usually means resolvers are creating circular requirement chains. Check that resolvers aren't mutating facts that re-trigger their own constraints.`),y&&s.drainPendingChanges(),F.previousRequirements=new ke,Re=0;return}F.isReconciling=true,Se();let e=y?s.startRun():0,n=s.currentTrace;if(n)for(let a of n.factChanges){let b=o[a.key];a.meta=b?._meta;}try{if(F.changedKeys.size>0){if(X===null||$){let t=F.changedKeys,r=t.size<=5?`facts-changed:${[...t].join(",")}`:`facts-changed:${[...t].slice(0,5).join(",")}+${t.size-5}more`;ye.takeSnapshot(r);}$=!1;}let a=G.$snapshot();q.emitReconcileStart(a),await le.runEffects(F.changedKeys);let b=new Set(F.changedKeys);F.changedKeys.clear();let R=await i.evaluate(b),k=new ke;for(let t of R)k.add(t),q.emitRequirementCreated(t);if(n){let t=new Set(R.map(r=>r.fromConstraint));for(let r of t){let d=i.getState(r);if(d){let w=i.getDependencies(r);n.constraintsHit.push({id:r,priority:d.priority,deps:w?[...w]:[],meta:g[r]?.meta});}}}let{added:B,removed:U}=k.diff(F.previousRequirements);if(n){for(let t of B)n.requirementsAdded.push({id:t.id,type:t.requirement.type,fromConstraint:t.fromConstraint});for(let t of U)n.requirementsRemoved.push({id:t.id,type:t.requirement.type,fromConstraint:t.fromConstraint});}for(let t of U)(t.fromConstraint?P(t.fromConstraint):void 0)?ee.detach(t.id):ee.cancel(t.id);let Z;if(B.length>0){let t=new Set;for(let r of B){if(!r.fromConstraint)continue;let d=P(r.fromConstraint);if(d)for(let w of d.fields)t.add(w);}if(t.size>0){Z=Object.create(null);for(let r of t)Z[r]=O.get(r);}}for(let t of B)ee.resolve(t,{factsBaseline:Z});if(n){let t=ee.getInflightInfo(),r=new Map(t.map(d=>[d.id,d]));for(let d of B){let E=r.get(d.id)?.resolverId??"unknown";n.resolversStarted.push({resolver:E,requirementId:d.id,meta:p[E]?.meta}),s.attributeResolverStart(d.id);}}if(F.previousRequirements=k,H.size>0){for(let t of H)F.previousRequirements.remove(t);H.clear(),ge();}let V=ee.getInflightInfo();if(f$1.plugins&&f$1.plugins.length>0){let t=U.length>0?new Map(V.map(d=>[d.id,d.resolverId])):void 0,r={unmet:R.filter(d=>!ee.isResolving(d.id)),inflight:V,completed:[],canceled:U.map(d=>({id:d.id,resolverId:t?.get(d.id)??"unknown"}))};q.emitReconcileEnd(r);}F.isReady||(F.isReady=!0,F.readyResolve&&(F.readyResolve(),F.readyResolve=null));}finally{y&&s.finalizeCurrentRun(e),F.isReconciling=false,ie.flushDeferred(),Re=0,F.changedKeys.size>0&&ge(),Se();}}function Ie(e,n){let a$1=x[e];if(a$1){C++,(X===null||X.has(e))&&($=true);try{O.batch(()=>{a$1(G,{type:e,...n});});}finally{C--;}}else a&&console.warn(`[Directive] Unknown event type "${e}". No handler is registered for this event. Available events: ${Object.keys(x).join(", ")||"(none)"}`);}let u$1=ut({mergedDerive:h,getDerivation:e=>re.get(e),definitions:ie}),m=dt({mergedEvents:x,dispatchEvent:Ie});function v(){let e=[];for(let[n,a]of A)e.push({type:"module",id:n,meta:a});for(let n of Object.keys(o)){let a=o[n]?._meta;a&&e.push({type:"fact",id:n,meta:a});}for(let[n,a]of z)e.push({type:"event",id:n,meta:a});for(let[n,a]of Object.entries(g))a.meta&&e.push({type:"constraint",id:n,meta:a.meta});for(let[n,a]of Object.entries(p))a.meta&&e.push({type:"resolver",id:n,meta:a.meta});for(let[n,a]of Object.entries(T)){let b=a.meta;b&&e.push({type:"effect",id:n,meta:b});}for(let n of Object.keys(h)){let a=re.getMeta(n);a&&e.push({type:"derivation",id:n,meta:a});}return e}let I={facts:G,history:ye.isEnabled?ye:null,derive:u$1,events:m,constraints:{disable:e=>i.disable(e),enable:e=>i.enable(e),isDisabled:e=>i.isDisabled(e),register:(e,n)=>{ie.register("constraint",e,n);},assign:(e,n)=>{ie.assign("constraint",e,n);},unregister:e=>{ie.unregister("constraint",e);},call:(e,n)=>ie.call("constraint",e,n),isDynamic:e=>ie.isDynamic("constraint",e),listDynamic:()=>ie.listDynamic("constraint")},effects:{disable:e=>le.disable(e),enable:e=>le.enable(e),isEnabled:e=>le.isEnabled(e),register:(e,n)=>{ie.register("effect",e,n);},assign:(e,n)=>{ie.assign("effect",e,n);},unregister:e=>{ie.unregister("effect",e);},call:e=>ie.call("effect",e),isDynamic:e=>ie.isDynamic("effect",e),listDynamic:()=>ie.listDynamic("effect")},resolvers:{register:(e,n)=>{ie.register("resolver",e,n),D({[e]:n});},assign:(e,n)=>{ie.assign("resolver",e,n),D({[e]:n});},unregister:e=>{let n=p[e];n?.key&&typeof n.requirement=="string"&&i.removeRequirementKey(n.requirement),ie.unregister("resolver",e);},call:(e,n)=>ie.call("resolver",e,n),isDynamic:e=>ie.isDynamic("resolver",e),listDynamic:()=>ie.listDynamic("resolver")},get trace(){return s.getEntries()},meta:{module(e){return A.get(e)},fact(e){return o[e]?._meta},event(e){return z.get(e)},constraint(e){return g[e]?.meta},resolver(e){return p[e]?.meta},effect(e){return T[e]?.meta},derivation(e){return re.getMeta(e)},byCategory(e){return v().filter(n=>n.meta.category===e)},byTag(e){return v().filter(n=>n.meta.tags?.includes(e))}},observe(e){if(q.getPlugins().filter(R=>R.name.startsWith("__observer_")).length>=100)return a&&console.warn("[Directive] Maximum observer limit (100) reached. Call the unsubscribe function returned by observe() to clean up."),()=>{};let a$1=`__observer_${Date.now()}_${Math.random().toString(36).slice(2)}`,b={name:a$1,onInit:()=>e({type:"system.init"}),onStart:()=>e({type:"system.start"}),onStop:()=>e({type:"system.stop"}),onDestroy:()=>e({type:"system.destroy"}),onFactSet:(R,k,B)=>e({type:"fact.change",key:R,prev:B,next:k}),onConstraintEvaluate:(R,k,B)=>{e(B?{type:"constraint.evaluate",id:R,active:k,whenExplain:B}:{type:"constraint.evaluate",id:R,active:k});},onConstraintError:(R,k)=>e({type:"constraint.error",id:R,error:k}),onRequirementCreated:R=>e({type:"requirement.created",id:R.id,requirementType:R.requirement.type}),onRequirementMet:(R,k)=>e({type:"requirement.met",id:R.id,byResolver:k}),onRequirementCanceled:R=>e({type:"requirement.canceled",id:R.id}),onResolverStart:(R,k)=>e({type:"resolver.start",resolver:R,requirementId:k.id}),onResolverComplete:(R,k,B)=>e({type:"resolver.complete",resolver:R,requirementId:k.id,duration:B}),onResolverError:(R,k,B)=>e({type:"resolver.error",resolver:R,requirementId:k.id,error:B}),onResolverWriteRejected:R=>{if(R.kind==="summary"){e({type:"resolver.write.rejected",kind:"summary",resolver:R.resolver,requirementId:R.req.id,reason:R.reason,dropped:R.dropped});return}e({type:"resolver.write.rejected",kind:"rejection",resolver:R.resolver,requirementId:R.req.id,reason:R.reason,fact:R.fact,expected:R.expected,actual:R.actual});},onEffectRun:R=>e({type:"effect.run",id:R}),onEffectError:(R,k)=>e({type:"effect.error",id:R,error:k}),onDerivationCompute:(R,k)=>e({type:"derivation.compute",id:R,value:k}),onReconcileStart:()=>e({type:"reconcile.start"}),onReconcileEnd:R=>{let k=R;e({type:"reconcile.end",resolversCompleted:Array.isArray(k.completed)?k.completed.length:0,resolversCanceled:Array.isArray(k.canceled)?k.canceled.length:0});}};return q.register(b),()=>q.unregister(a$1)},initialize(){if(!F.isInitialized){F.isInitializing=true;for(let e of f$1.modules)e.init&&O.batch(()=>{e.init(G);});f$1.onAfterModuleInit&&O.batch(()=>{f$1.onAfterModuleInit();}),F.isInitializing=false,F.isInitialized=true;for(let e of Object.keys(h))re.get(e);}},start(){if(!F.isRunning){F.isInitialized||this.initialize(),F.isRunning=true;for(let e of f$1.modules)e.hooks?.onStart?.(I);if(q.emitStart(I),f$1.errorBoundary?.retryLater&&!te){let e=Math.max(f$1.errorBoundary.retryLater.delayMs??1e3,250);te=setInterval(()=>{let n=W.processDueRetries();for(let a of n)a.callback?a.callback():ge();},Math.min(e,500));}ge();}},stop(){if(F.isRunning){F.isRunning=false,te!==null&&(clearInterval(te),te=null),W.getRetryLaterManager().clearAll(),ee.cancelAll(),le.cleanupAll();for(let e of f$1.modules)e.hooks?.onStop?.(I);q.emitStop(I);}},destroy(){F.isDestroyed||(this.stop(),F.isDestroyed=true,O.destroy?.(),ee.destroy(),W.clearErrors(),he.clear(),de.clear(),s.destroy(),ie.destroy(),A.clear(),z.clear(),H.clear(),q.emitDestroy(I));},dispatch(e){k.has(e.type)||Ie(e.type,e);},read(e){return re.get(e)},subscribe(e,n){let a$1=[],b=[];for(let k of e)k in h?a$1.push(k):k in o?b.push(k):a&&console.warn(`[Directive] subscribe: unknown key "${k}"`);let R=[];return a$1.length>0&&R.push(re.subscribe(a$1,n)),b.length>0&&R.push(O.subscribe(b,n)),()=>{for(let k of R)k();}},watch(e,n,a$1){let b=a$1?.equalityFn?(k,B)=>a$1.equalityFn(k,B):(k,B)=>Object.is(k,B);if(e in h){let k=re.get(e);return re.subscribe([e],()=>{let B=re.get(e);if(!b(B,k)){let U=k;k=B,n(B,U);}})}a&&(e in o||console.warn(`[Directive] watch: unknown key "${e}"`));let R=O.get(e);return O.subscribe([e],()=>{let k=O.get(e);if(!b(k,R)){let B=R;R=k,n(k,B);}})},when(e,n){return new Promise((a,b)=>{let R=O.toObject();if(e(R)){a();return}let k,B,U=()=>{k?.(),B!==void 0&&clearTimeout(B);};k=O.subscribeAll(()=>{let Z=O.toObject();e(Z)&&(U(),a());}),n?.timeout!==void 0&&n.timeout>0&&(B=setTimeout(()=>{U(),b(new Error(`[Directive] when: timed out after ${n.timeout}ms`));},n.timeout));})},inspect(){return {unmet:F.previousRequirements.all(),inflight:ee.getInflightInfo(),facts:Object.keys(o).map(e=>({key:e,meta:o[e]?._meta})),events:Object.keys(x).map(e=>({name:e,meta:z.get(e)})),constraints:i.getAllStates().map(e=>{let n=i.getWhenSpec(e.id),a=g[e.id],b=a?.owns&&a.owns.length>0?a.owns:void 0;return {id:e.id,active:e.lastResult??false,disabled:i.isDisabled(e.id),priority:e.priority,hitCount:e.hitCount,lastActiveAt:e.lastActiveAt,meta:a?.meta,...n?{whenSpec:n}:{},...b?{owns:b}:{}}}),resolvers:Object.fromEntries(ee.getInflight().map(e=>[e,ee.getStatus(e)])),resolverDefs:Object.entries(p).map(([e,n])=>({id:e,requirement:typeof n.requirement=="string"?n.requirement:"(predicate)",meta:n.meta})),effects:Object.entries(T).map(([e,n])=>({id:e,meta:n.meta})),derivations:Object.keys(h).map(e=>({id:e,meta:re.getMeta(e)})),modules:f$1.modules.map(e=>({id:e.id,meta:A.get(e.id)})),traceEnabled:y,...y?{trace:structuredClone(s.getEntries()??[])}:{}}},explain(e){let a=F.previousRequirements.all().find(E=>E.id===e);if(!a)return null;let b=i.getState(a.fromConstraint),R=ee.getStatus(e),k={},B=i.getDependencies(a.fromConstraint);if(B)for(let E of B)k[E]=O.get(E);else for(let[E,Y]of Object.entries(O.toObject()))k[E]=Y;let U=g[a.fromConstraint],Z=U?.meta?.label??a.fromConstraint,V=[`Requirement "${a.requirement.type}" (id: ${a.id})`,`\u251C\u2500 Produced by constraint: ${Z}`,`\u251C\u2500 Constraint priority: ${b?.priority??0}`,`\u251C\u2500 Constraint active: ${b?.lastResult??"unknown"}`,`\u251C\u2500 Resolver status: ${R.state}`];U?.meta?.description&&V.push(`\u251C\u2500 Description: ${U.meta.description}`);let t=i.explainWhen(a.fromConstraint),r=(E,Y,ae)=>{let ce=ae?"\u2514\u2500":"\u251C\u2500",pe=E.pass?"\u2713":"\u2717";if(E.children){if(E.op==="$not"){let $e=E.pass?" (child failed)":" (child passed)";V.push(`${Y}${ce} ${pe} $not${$e}`);}else V.push(`${Y}${ce} ${pe} ${E.op} (${E.actual}/${E.expected})`);let vt=`${Y}${ae?"   ":"\u2502  "}`;E.children.forEach(($e,ht)=>{r($e,vt,ht===E.children.length-1);});return}let yt=typeof E.expected=="object"?JSON.stringify(E.expected):String(E.expected),pt=E.actual===void 0?"undefined":typeof E.actual=="object"?JSON.stringify(E.actual):String(E.actual);V.push(`${Y}${ce} ${pe} ${E.path} ${E.op} ${yt} (actual: ${pt})`);};t&&t.length>0&&(V.push("\u251C\u2500 Predicate clauses:"),t.forEach((E,Y)=>{r(E,"\u2502  ",Y===t.length-1);}));let d=Object.entries(a.requirement).filter(([E])=>E!=="type").map(([E,Y])=>`${E}=${JSON.stringify(Y)}`).join(", ");d&&V.push(`\u251C\u2500 Requirement payload: { ${d} }`);let w=Object.entries(k).slice(0,10);return w.length>0&&(V.push("\u2514\u2500 Relevant facts:"),w.forEach(([E,Y],ae)=>{let ce=ae===w.length-1?"   \u2514\u2500":"   \u251C\u2500",pe=typeof Y=="object"?JSON.stringify(Y):String(Y);V.push(`${ce} ${E} = ${pe.slice(0,50)}${pe.length>50?"...":""}`);})),V.join(`
+`)},getOriginal(e,n){return ie.getOriginal(e,n)},restoreOriginal(e,n){return ie.restoreOriginal(e,n)},async settle(e=5e3){let n=()=>ee.getInflightCount()===0&&!F.isReconciling&&!F.reconcileScheduled&&!ee.hasPendingBatches();if(ee.hasPendingBatches()&&ee.processBatches(),await new Promise(a=>queueMicrotask(a)),!n())return new Promise((a,b)=>{let R=false,k=()=>{R||(R=true,clearTimeout(B),U());},B=setTimeout(()=>{k();let Z=[],V=ee.getInflightInfo();V.length>0&&Z.push(`${V.length} resolvers inflight: ${V.map(r=>r.resolverId).join(", ")}`),F.isReconciling&&Z.push("reconciliation in progress"),F.reconcileScheduled&&Z.push("reconcile scheduled");let t=F.previousRequirements.all();t.length>0&&Z.push(`${t.length} unmet requirements: ${t.map(r=>r.requirement.type).join(", ")}`),b(new Error(`[Directive] settle() timed out after ${e}ms. ${Z.join("; ")}`));},e),U=this.onSettledChange(()=>{ee.hasPendingBatches()&&ee.processBatches(),queueMicrotask(()=>{!R&&n()&&(k(),a());});});})},getSnapshot(){return {facts:O.toObject(),version:1}},getDistributableSnapshot(e={}){let{includeDerivations:n,excludeDerivations:a$1,includeFacts:b,ttlSeconds:R,metadata:k,includeVersion:B}=e,U={},Z=Object.keys(h),V=new Set(Z),t;if(n){if(t=n.filter(w=>V.has(w)),a){let w=n.filter(E=>!V.has(E));w.length>0&&console.warn(`[Directive] getDistributableSnapshot: Unknown derivation keys ignored: ${w.join(", ")}. Available: ${Z.join(", ")||"(none)"}`);}}else t=Z;if(a$1){let w=new Set(a$1);t=t.filter(E=>!w.has(E));}for(let w of t)try{U[w]=re.get(w);}catch(E){a&&console.warn(`[Directive] getDistributableSnapshot: Skipping derivation "${w}" due to error:`,E);}if(b&&b.length>0){let w=O.toObject(),E=Object.keys(w);if(a){let Y=b.filter(ae=>!(ae in w));Y.length>0&&console.warn(`[Directive] getDistributableSnapshot: Unknown fact keys ignored: ${Y.join(", ")}. Available: ${E.join(", ")||"(none)"}`);}for(let Y of b)Y in w&&(U[Y]=w[Y]);}let r=Date.now(),d={data:U,createdAt:r};return R!==void 0&&R>0&&(d.expiresAt=r+R*1e3),B&&(d.version=h$2(U)),k&&(d.metadata=k),d},watchDistributableSnapshot(e,n){let{includeDerivations:a$1,excludeDerivations:b}=e,R=Object.keys(h),k;if(a$1?k=a$1.filter(Z=>R.includes(Z)):k=R,b){let Z=new Set(b);k=k.filter(V=>!Z.has(V));}if(k.length===0)return a&&console.warn("[Directive] watchDistributableSnapshot: No derivations to watch. Callback will never be called."),()=>{};let U=this.getDistributableSnapshot({...e,includeVersion:true}).version;return re.subscribe(k,()=>{let Z=this.getDistributableSnapshot({...e,includeVersion:true});Z.version!==U&&(U=Z.version,n(Z));})},restore(e){if(!e||typeof e!="object")throw new Error("[Directive] restore() requires a valid snapshot object");if(!e.facts||typeof e.facts!="object")throw new Error("[Directive] restore() snapshot must have a facts object");if(!f(e))throw new Error("[Directive] restore() rejected: snapshot contains potentially dangerous keys (__proto__, constructor, or prototype). This may indicate a prototype pollution attack.");O.batch(()=>{for(let[n,a]of Object.entries(e.facts))k.has(n)||O.set(n,a);});},onSettledChange(e){return he.add(e),()=>{he.delete(e);}},onHistoryChange(e){return de.add(e),()=>{de.delete(e);}},batch(e){O.batch(e);},get isSettled(){return ee.getInflightCount()===0&&!ee.hasPendingBatches()&&!F.isReconciling&&!F.reconcileScheduled},get isRunning(){return F.isRunning},get isInitialized(){return F.isInitialized},get isReady(){return F.isReady},whenReady(){return F.isReady?Promise.resolve():F.isRunning?(F.readyPromise||(F.readyPromise=new Promise(e=>{F.readyResolve=e;})),F.readyPromise):Promise.reject(new Error("[Directive] whenReady() called before start(). Call system.start() first, then await system.whenReady()."))}};function L(e){if(F.isReconciling)throw new Error(`[Directive] Cannot register module "${e.id}" during reconciliation. Wait for the current reconciliation cycle to complete.`);if(F.isDestroyed)throw new Error(`[Directive] Cannot register module "${e.id}" on a destroyed system.`);let n=(a,b)=>{if(a)for(let R of Object.keys(a)){if(k.has(R))throw new Error(`[Directive] Security: Module "${e.id}" has dangerous key "${R}" in ${b}.`);if(b==="schema"&&R.startsWith("$"))throw new Error(`[Directive] Module "${e.id}" has schema key "${R}" starting with "$". Keys starting with $ are reserved for internal accessors ($store, $snapshot).`)}};n(e.schema,"schema"),n(e.events,"events"),n(e.derive,"derive"),n(e.effects,"effects"),n(e.constraints,"constraints"),n(e.resolvers,"resolvers");for(let a of Object.keys(e.schema))if(a in o)throw new Error(`[Directive] Schema collision: Fact "${a}" already exists. Cannot register module "${e.id}".`);if(a&&e.derive){let a=new Set(Object.keys(o));for(let b of Object.keys(e.derive))a.has(b)&&console.warn(`[Directive] "${b}" exists as both a fact and a derivation after registering module "${e.id}".`);}if(e.history?.snapshotEvents){X===null&&(X=new Set(Object.keys(x)));for(let a of e.history.snapshotEvents)X.add(a);}else if(X!==null&&e.events)for(let a of Object.keys(e.events))X.add(a);Object.assign(o,e.schema);for(let a of Object.values(e.schema)){let b=a;b._meta&&(b._meta=fe(b._meta));}if(e.events&&(mt(e.events,z),Object.assign(x,e.events)),e.derive&&(Object.assign(h,e.derive),re.registerDefinitions(e.derive)),e.effects){for(let a of Object.values(e.effects)){let b=a;b.meta&&(b.meta=fe(b.meta));}Object.assign(T,e.effects),le.registerDefinitions(e.effects);}if(e.constraints){for(let a of Object.values(e.constraints)){let b=a;b.meta&&(b.meta=fe(b.meta));}Object.assign(g,e.constraints),i.registerDefinitions(e.constraints);}if(e.resolvers){for(let a of Object.values(e.resolvers)){let b=a;b.meta&&(b.meta=fe(b.meta));}Object.assign(p,e.resolvers);for(let a of Object.keys(e.resolvers))N.set(a,e);ee.registerDefinitions(e.resolvers),D(e.resolvers);}if(O.registerKeys(e.schema),e.meta){let a=fe(e.meta);a&&A.set(e.id,a);}f$1.modules.push(e),e.init&&O.batch(()=>{e.init(G);}),e.hooks?.onInit?.(I),F.isRunning&&(e.hooks?.onStart?.(I),ge());}I.registerModule=L,q.emitInit(I);for(let e of f$1.modules)e.hooks?.onInit?.(I);return I}export{Wt as a,qe as b,St as c,Rt as d,bt as e,wt as f,Kt as g,Bt as h,Ze as i,Ye as j,kt as k,Xt as l,Gt as m,Zt as n,ke as o,et as p,tt as q,nt as r,Ct as s,rt as t,It as u,Pt as v,st as w,ot as x,lt as y,Jn as z};//# sourceMappingURL=chunk-R2GHSCTR.js.map
+//# sourceMappingURL=chunk-R2GHSCTR.js.map