@graphrefly/graphrefly 0.37.0 → 0.39.0

package/dist/chunk-WGST56ZH.js

@@ -1,80 +0,0 @@
-import{b as z}from"./chunk-XIJKEXWR.js";import{g as Y,j as J}from"./chunk-B4L5X2QO.js";import{E as L,F as T,G as D,H as P}from"./chunk-LYCLF26R.js";import{b as Z}from"./chunk-QYADASLV.js";var pe={};Z(pe,{compileSpec:()=>se,decompileGraph:()=>ae,extractFnFactory:()=>V,extractSourceFactory:()=>B,generateCatalogPrompt:()=>K,isRichFnEntry:()=>M,isRichSourceEntry:()=>W,llmCompose:()=>ce,llmRefine:()=>X,specDiff:()=>ie,validateSpec:()=>A,validateSpecAgainstCatalog:()=>q});function M(i){return typeof i=="object"&&i!==null&&"factory"in i}function W(i){return typeof i=="object"&&i!==null&&"factory"in i}function V(i){return M(i)?i.factory:i}function B(i){return W(i)?i.factory:i}function K(i){let n=[];if(i.fns){let o=new Map;for(let[r,d]of Object.entries(i.fns)){let p=M(d)?d.tags?.[0]??"Other":"Other";o.has(p)||o.set(p,[]),o.get(p).push(ee(r,d))}for(let[r,d]of o)n.push(`${r}:
-${d.join(`
-`)}`)}if(i.sources){let o=[];for(let[r,d]of Object.entries(i.sources))o.push(te(r,d));o.length>0&&n.push(`Sources:
-${o.join(`
-`)}`)}return n.join(`
-
-`)}function ee(i,n){if(!M(n))return`- ${i}`;let o=`- ${i}: ${n.description}`;if(n.configSchema){let r=Object.entries(n.configSchema).map(([d,p])=>{let l=`${d}: ${p.type}`;return p.enum&&(l+=` (${p.enum.join("|")})`),p.required===!1&&(l+="?"),l});o+=`. Config: { ${r.join(", ")} }`}return o}function te(i,n){if(!W(n))return`- ${i}`;let o=`- ${i}: ${n.description}`;if(n.configSchema){let r=Object.entries(n.configSchema).map(([d,p])=>{let l=`${d}: ${p.type}`;return p.required===!1&&(l+="?"),l});o+=`. Config: { ${r.join(", ")} }`}return o}function q(i,n){let o=[],r=new Set(Object.keys(n.fns??{})),d=new Set(Object.keys(n.sources??{}));for(let[p,l]of Object.entries(i.nodes)){if(l.type==="template")continue;let s=l;if(s.fn&&r.size>0&&!r.has(s.fn))if(d.has(s.fn))o.push(`Node "${p}": fn "${s.fn}" is a source, not a function. Use it as a producer source instead, or use a function from: ${[...r].join(", ")}`);else{let c=I(s.fn,r);o.push(`Node "${p}": fn "${s.fn}" not found in catalog`+(c?`. Did you mean "${c}"?`:""))}if(s.source&&d.size>0&&!d.has(s.source))if(r.has(s.source))o.push(`Node "${p}": source "${s.source}" is a function, not a source. Use it as fn instead, or use a source from: ${[...d].join(", ")}`);else{let c=I(s.source,d);o.push(`Node "${p}": source "${s.source}" not found in catalog`+(c?`. Did you mean "${c}"?`:""))}if(s.fn&&s.config&&n.fns?.[s.fn]){let c=n.fns[s.fn];if(M(c)&&c.configSchema){for(let[t,$]of Object.entries(c.configSchema))if($.required!==!1&&!(t in s.config)&&o.push(`Node "${p}": config missing required field "${t}"`),t in s.config&&$.enum){let O=s.config[t];$.enum.includes(O)||o.push(`Node "${p}": config.${t} = ${JSON.stringify(O)}, expected one of: ${$.enum.join(", ")}`)}}}}if(i.templates){for(let[p,l]of Object.entries(i.templates))for(let[s,c]of Object.entries(l.nodes))if(c.fn&&r.size>0&&!r.has(c.fn)){let t=I(c.fn,r);o.push(`Template "${p}" node "${s}": fn "${c.fn}" not found in catalog`+(t?`. Did you mean "${t}"?`:""))}}return{valid:o.length===0,errors:o,warnings:[]}}function I(i,n){let o=null,r=1/0,d=i.toLowerCase();for(let p of n){let l=ne(d,p.toLowerCase());l<r&&l<=Math.max(3,Math.floor(i.length/2))&&(r=l,o=p)}return o}function ne(i,n){let o=i.length,r=n.length,d=Array.from({length:o+1},(p,l)=>Array.from({length:r+1},(s,c)=>l===0?c:c===0?l:0));for(let p=1;p<=o;p++)for(let l=1;l<=r;l++)d[p][l]=i[p-1]===n[l-1]?d[p-1][l-1]:1+Math.min(d[p-1][l],d[p][l-1],d[p-1][l-1]);return d[o][r]}var U=new Set(["state","producer","derived","effect","operator","template"]),oe=new Set(["state","producer","derived","effect","operator"]);function A(i){let n=[],o=[];if(i==null||typeof i!="object")return{valid:!1,errors:["GraphSpec must be a non-null object"],warnings:o};let r=i;if((typeof r.name!="string"||r.name.length===0)&&n.push("Missing or empty 'name' field"),r.nodes==null||typeof r.nodes!="object"||Array.isArray(r.nodes))return n.push("Missing or invalid 'nodes' field (must be an object)"),{valid:!1,errors:n,warnings:o};let d=new Set(Object.keys(r.nodes)),p=new Map,l=new Map;if(r.templates!=null&&typeof r.templates=="object"&&!Array.isArray(r.templates)){for(let[s,c]of Object.entries(r.templates))if(c!=null&&typeof c=="object"){let t=c;l.set(s,{params:Array.isArray(t.params)?t.params:[]})}}if(r.templates!=null)if(typeof r.templates!="object"||Array.isArray(r.templates))n.push("'templates' must be an object");else for(let[s,c]of Object.entries(r.templates)){if(c==null||typeof c!="object"){n.push(`Template "${s}": must be an object`);continue}let t=c;if(Array.isArray(t.params)||n.push(`Template "${s}": missing 'params' array`),t.nodes==null||typeof t.nodes!="object"||Array.isArray(t.nodes))n.push(`Template "${s}": missing or invalid 'nodes' object`);else{let $=new Set(Array.isArray(t.params)?t.params:[]),O=new Set(Object.keys(t.nodes));for(let[w,m]of Object.entries(t.nodes)){if(m==null||typeof m!="object"){n.push(`Template "${s}" node "${w}": must be an object`);continue}let g=m;if((typeof g.type!="string"||!oe.has(g.type))&&n.push(`Template "${s}" node "${w}": invalid type`),Array.isArray(g.deps))for(let y of g.deps)!O.has(y)&&!$.has(y)&&n.push(`Template "${s}" node "${w}": dep "${y}" is not an inner node or param`)}typeof t.output!="string"?n.push(`Template "${s}": missing 'output' string`):t.nodes[t.output]||n.push(`Template "${s}": output "${t.output}" is not a declared node`)}}for(let[s,c]of Object.entries(r.nodes)){if(c==null||typeof c!="object"){n.push(`Node "${s}": must be an object`);continue}let t=c;if(typeof t.type!="string"||!U.has(t.type)){n.push(`Node "${s}": invalid type "${String(t.type)}" (expected: ${[...U].join(", ")})`);continue}if(p.set(s,t.type),t.type==="template")if(typeof t.template!="string"||!l.has(t.template))n.push(`Node "${s}": template "${String(t.template)}" not found in templates`);else if(t.bind==null||typeof t.bind!="object"||Array.isArray(t.bind))n.push(`Node "${s}": template ref requires 'bind' object`);else{let $=l.get(t.template),O=t.bind;for(let w of $.params)w in O||n.push(`Node "${s}": template param "${w}" is not bound (template "${t.template}")`);for(let[,w]of Object.entries(O))typeof w=="string"&&!d.has(w)&&n.push(`Node "${s}": bind target "${w}" does not reference an existing node`)}else{if(Array.isArray(t.deps))for(let $ of t.deps)$===s?n.push(`Node "${s}": self-referencing dep`):d.has($)||n.push(`Node "${s}": dep "${$}" does not reference an existing node`);(t.type==="derived"||t.type==="effect"||t.type==="operator")&&!Array.isArray(t.deps)&&n.push(`Node "${s}": ${t.type} node should have a 'deps' array`)}}if(r.feedback!=null)if(!Array.isArray(r.feedback))n.push("'feedback' must be an array");else for(let s=0;s<r.feedback.length;s++){let c=r.feedback[s];if(c==null||typeof c!="object"){n.push(`Feedback [${s}]: must be an object`);continue}let t=c;typeof t.from!="string"||!d.has(t.from)?n.push(`Feedback [${s}]: 'from' "${String(t.from)}" does not reference an existing node`):p.get(t.from)==="effect"&&o.push(`Feedback [${s}]: 'from' "${t.from}" is an effect node \u2014 effects emit no DATA, so the feedback edge will never fire. Did you mean a derived/state node upstream?`),typeof t.from=="string"&&t.from===t.to&&n.push(`Feedback [${s}]: 'from' and 'to' must be different nodes`),typeof t.to!="string"||!d.has(t.to)?n.push(`Feedback [${s}]: 'to' "${String(t.to)}" does not reference an existing node`):typeof t.to=="string"&&p.get(t.to)!=="state"&&n.push(`Feedback [${s}]: 'to' node "${t.to}" must be a state node (got "${p.get(t.to)??"unknown"}")`)}return{valid:n.length===0,errors:n,warnings:o}}function se(i,n){let o=A(i);if(!o.valid)throw new Error(`compileSpec: invalid GraphSpec:
-${o.errors.join(`
-`)}`);let r=n?.catalog??{},d=n?.onMissing??"placeholder",p=new J(i.name),l=i.templates??{},s=q(i,r);if(!s.valid)throw new Error(`compileSpec: catalog validation errors:
-${s.errors.join(`
-`)}`);let c=[],t=(a,f,e)=>{if(e){c.push({path:a,kind:"source",name:e});return}f&&c.push({path:a,kind:"fn",name:f})},$=a=>{let f=r.fns?.[a];return f?V(f):void 0},O=a=>{let f=r.sources?.[a];return f?B(f):void 0},w=new Map,m=[];for(let[a,f]of Object.entries(i.nodes)){if(f.type==="template")continue;let e=f;if(e.type==="state"){let h=L(e.initial,{name:a,meta:e.meta?{...e.meta}:void 0});p.add(h,{name:a}),w.set(a,h)}else if(e.type==="producer"){let h=e.source?O(e.source):void 0,b=e.fn?$(e.fn):void 0;if(h){let u=h(e.config??{});p.add(u,{name:a}),w.set(a,u)}else if(b){let u=b([],e.config??{});p.add(u,{name:a}),w.set(a,u)}else{t(a,e.fn,e.source);let u=T(()=>{},{name:a,meta:{...e.meta,_specFn:e.fn,_specSource:e.source}});p.add(u,{name:a}),w.set(a,u)}}else m.push([a,e])}let g=!0,y=new Map(m);for(;y.size>0&&g;){g=!1;for(let[a,f]of[...y.entries()]){let e=f.deps??[];if(!e.every(x=>w.has(x)))continue;let h=e.map(x=>w.get(x)),b=f.fn?$(f.fn):void 0,u;b?u=b(h,f.config??{}):f.type==="effect"?(f.fn&&t(a,f.fn,void 0),u=P(h,()=>{})):(f.fn&&t(a,f.fn,void 0),u=D(h,x=>x[0])),p.add(u,{name:a}),w.set(a,u),y.delete(a),g=!0}}if(y.size>0){let a=[...y.keys()].sort().join(", ");throw new Error(`compileSpec: unresolvable deps for nodes: ${a}`)}for(let[a,f]of Object.entries(i.nodes)){if(f.type!=="template")continue;let e=f,h=l[e.template],b=new J(a),u=new Map,x=[];for(let[k,S]of Object.entries(h.nodes)){let v=(S.deps??[]).map(j=>j.startsWith("$")&&e.bind[j]?e.bind[j]:j),G={...S,deps:v};if(S.type==="state"){let j=L(S.initial,{name:k,meta:S.meta?{...S.meta}:void 0});b.add(j,{name:k}),u.set(k,j)}else if(S.type==="producer"){let j=S.source?O(S.source):void 0,E=S.fn?$(S.fn):void 0;if(j){let F=j(S.config??{});b.add(F,{name:k}),u.set(k,F)}else if(E){let F=E([],S.config??{});b.add(F,{name:k}),u.set(k,F)}else{t(`${a}.${k}`,S.fn,S.source);let F=T(()=>{},{name:k,meta:{...S.meta,_specFn:S.fn,_specSource:S.source}});b.add(F,{name:k}),u.set(k,F)}}else x.push([k,G])}let R=!0,N=new Map(x);for(;N.size>0&&R;){R=!1;for(let[k,S]of[...N.entries()]){let v=S.deps??[];if(!v.every(C=>u.has(C)||w.has(C)))continue;let j=v.map(C=>u.get(C)??w.get(C)),E=S.fn?$(S.fn):void 0,F;E?F=E(j,S.config??{}):S.type==="effect"?(S.fn&&t(`${a}.${k}`,S.fn,void 0),F=P(j,()=>{})):(S.fn&&t(`${a}.${k}`,S.fn,void 0),F=D(j,C=>C[0])),b.add(F,{name:k}),u.set(k,F),N.delete(k),R=!0}}if(N.size>0){let k=[...N.keys()].sort().join(", ");throw new Error(`compileSpec: template "${e.template}" has unresolvable deps: ${k}`)}p.mount(a,b);let _=`${a}::${h.output}`;w.set(a,p.resolve(_));try{let k=p.resolve(_);k.meta._templateName?.emit(e.template),k.meta._templateBind?.emit(e.bind)}catch{}}for(let a of i.feedback??[])z(p,a.from,a.to,{maxIterations:a.maxIterations});if(c.length>0){if(d==="error"){let a=c.map(f=>`  - ${f.path}: missing ${f.kind} "${f.name}"`);throw new Error(`compileSpec: ${c.length} catalog entr${c.length===1?"y":"ies"} missing \u2014 pass them via opts.catalog or set opts.onMissing to "warn"/"placeholder":
-${a.join(`
-`)}`)}if(d==="warn"){let a=n?.onWarn??(f=>console.warn(f));for(let f of c)a(`compileSpec: ${f.path} references missing ${f.kind} "${f.name}" \u2014 substituted placeholder`)}}return p}var re=new Set(["reduction","reduction_type","_specFn","_specSource","_templateName","_templateBind","feedbackFrom","feedbackTo","_internal"]);function ae(i){let n=i.describe({detail:"standard"}),o={},r=[],d=`::${Y}::`,p=/^__feedback_(?!effect_)(.+)$/,l=new Set;for(let m of Object.keys(n.nodes)){if(m.includes(d))continue;let g=p.exec(m);if(g){l.add(g[1]);let y=n.nodes[m]?.meta;y?.feedbackFrom&&y?.feedbackTo&&r.push({from:y.feedbackFrom,to:y.feedbackTo,...y.maxIterations?{maxIterations:y.maxIterations}:{}})}}for(let[m,g]of Object.entries(n.nodes)){if(m.includes(d)||p.test(m)||g.meta?._internal||m.startsWith("__feedback_effect_")||m.startsWith("__bridge_")||m.includes("::"))continue;let y={type:g.type};if(g.deps.length>0&&(y.deps=g.deps.filter(a=>!a.includes("::"))),g.type==="state"&&g.value!==void 0&&(y.initial=g.value),g.meta&&Object.keys(g.meta).length>0){let a={};for(let[f,e]of Object.entries(g.meta))re.has(f)||(a[f]=e);Object.keys(a).length>0&&(y.meta=a)}o[m]=y}let s={},c={},t=new Set;for(let m of n.subgraphs){let g=`${m}::`;for(let[y,a]of Object.entries(n.nodes)){if(!y.startsWith(g)||y.includes(d))continue;let f=a.meta;if(f?._templateName&&f?._templateBind){let e=f._templateName,h=f._templateBind;if(!s[e]){let b={},u=new Set,x=`${m}::`;for(let[v,G]of Object.entries(n.nodes)){if(!v.startsWith(x)||v.includes(d))continue;let j=v.slice(x.length);j.includes("::")||(u.add(j),b[j]={type:G.type,...G.deps.length>0?{deps:G.deps.map(E=>E.startsWith(x)?E.slice(x.length):E)}:{}})}let R=[],N=new Map;for(let v of Object.values(b))for(let G of v.deps??[])if(!u.has(G)&&!N.has(G)){let j=`$${G}`;R.push(j),N.set(G,j)}for(let v of Object.values(b))v.deps&&(v.deps=v.deps.map(G=>N.get(G)??G));let _=new Set;for(let v of Object.values(b))for(let G of v.deps??[])u.has(G)&&_.add(G);let S=[...u].filter(v=>!_.has(v))[0]??[...u].pop();s[e]={params:R,nodes:b,output:S}}delete o[m],c[m]={type:"template",template:e,bind:h},t.add(m);break}}}let $=new Map;for(let m of n.subgraphs){if(t.has(m))continue;let g={},y=`${m}::`;for(let[f,e]of Object.entries(n.nodes)){if(f.includes(d)||!f.startsWith(y))continue;let h=f.slice(y.length);h.includes("::")||(g[h]={type:e.type,...e.deps.length>0?{deps:e.deps.map(b=>b.startsWith(y)?b.slice(y.length):b)}:{}})}let a=JSON.stringify(Object.fromEntries(Object.entries(g).sort(([f],[e])=>f.localeCompare(e)).map(([f,e])=>[f,{type:e.type,deps:e.deps??[]}])));$.has(a)||$.set(a,[]),$.get(a).push({name:m,nodes:g})}for(let[,m]of $){if(m.length<2)continue;let g=`${m[0].name}_template`,y=m[0].nodes,a=new Set(Object.keys(y)),f=[],e=new Map;for(let R of Object.values(y))for(let N of R.deps??[])if(!a.has(N)&&!e.has(N)){let _=`$${N}`;f.push(_),e.set(N,_)}let h=new Set;for(let R of Object.values(y))for(let N of R.deps??[])a.has(N)&&h.add(N);let u=[...a].filter(R=>!h.has(R))[0]??[...a].pop(),x={};for(let[R,N]of Object.entries(y))x[R]={...N,deps:N.deps?.map(_=>e.get(_)??_)};s[g]={params:f,nodes:x,output:u};for(let R of m){delete o[R.name];let N={},_=new Set(Object.keys(R.nodes));for(let k of Object.values(R.nodes))for(let S of k.deps??[])if(!_.has(S)){let v=e.get(S)??`$${S}`;N[v]=S}c[R.name]={type:"template",template:g,bind:N}}}let O={...o,...c},w={name:n.name,nodes:O};return Object.keys(s).length>0&&(w.templates=s),r.length>0&&(w.feedback=r),w}function ie(i,n){let o=[];i.name!==n.name&&o.push({type:"changed",path:"name",detail:`"${i.name}" \u2192 "${n.name}"`});let r=new Set(Object.keys(i.nodes)),d=new Set(Object.keys(n.nodes));for(let e of d)if(!r.has(e)){let h=n.nodes[e];o.push({type:"added",path:`nodes.${e}`,detail:`type: ${h.type}`})}for(let e of r)d.has(e)||o.push({type:"removed",path:`nodes.${e}`});for(let e of r){if(!d.has(e))continue;let h=i.nodes[e],b=n.nodes[e];if(JSON.stringify(h)!==JSON.stringify(b)){let u=[];h.type!==b.type&&u.push(`type: ${h.type} \u2192 ${b.type}`),JSON.stringify(h.deps)!==JSON.stringify(b.deps)&&u.push("deps changed"),h.fn!==b.fn&&u.push(`fn: ${h.fn} \u2192 ${b.fn}`),JSON.stringify(h.config)!==JSON.stringify(b.config)&&u.push("config changed"),o.push({type:"changed",path:`nodes.${e}`,detail:u.join("; ")||"modified"})}}let p=i.templates??{},l=n.templates??{},s=new Set(Object.keys(p)),c=new Set(Object.keys(l));for(let e of c)s.has(e)||o.push({type:"added",path:`templates.${e}`});for(let e of s)c.has(e)||o.push({type:"removed",path:`templates.${e}`});for(let e of s)c.has(e)&&JSON.stringify(p[e])!==JSON.stringify(l[e])&&o.push({type:"changed",path:`templates.${e}`,detail:"template definition changed"});let t=i.feedback??[],$=n.feedback??[],O=new Set(t.map(e=>`${e.from}->${e.to}`)),w=new Set($.map(e=>`${e.from}->${e.to}`));for(let e of $){let h=`${e.from}->${e.to}`;O.has(h)||o.push({type:"added",path:`feedback.${h}`,detail:`maxIterations: ${e.maxIterations??10}`})}for(let e of t){let h=`${e.from}->${e.to}`;w.has(h)||o.push({type:"removed",path:`feedback.${h}`})}for(let e of t){let h=`${e.from}->${e.to}`,b=$.find(u=>u.from===e.from&&u.to===e.to);b&&JSON.stringify(e)!==JSON.stringify(b)&&o.push({type:"changed",path:`feedback.${h}`,detail:`maxIterations: ${e.maxIterations??10} \u2192 ${b.maxIterations??10}`})}let m=o.filter(e=>e.type==="added").length,g=o.filter(e=>e.type==="removed").length,y=o.filter(e=>e.type==="changed").length,a=[];m&&a.push(`${m} added`),g&&a.push(`${g} removed`),y&&a.push(`${y} changed`);let f=a.length>0?a.join(", "):"no changes";return{entries:o,summary:f}}var H=`You are a graph architect for GraphReFly, a reactive graph protocol.
-
-Given a natural-language description, produce a JSON GraphSpec with this structure:
-
-{
-  "name": "<graph_name>",
-  "nodes": {
-    "<node_name>": {
-      "type": "state" | "derived" | "producer" | "effect" | "operator",
-      "deps": ["<dep_node_name>", ...],
-      "fn": "<catalog_function_name>",
-      "source": "<catalog_source_name>",
-      "config": { ... },
-      "initial": <value>,
-      "meta": { "description": "<purpose>" }
-    },
-    "<template_instance>": {
-      "type": "template",
-      "template": "<template_name>",
-      "bind": { "$param": "node_name" }
-    }
-  },
-  "templates": {
-    "<template_name>": {
-      "params": ["$param1", "$param2"],
-      "nodes": { ... },
-      "output": "<output_node>"
-    }
-  },
-  "feedback": [
-    { "from": "<condition_node>", "to": "<state_node>", "maxIterations": 10 }
-  ]
-}
-
-Rules:
-- "state" nodes hold user/LLM-writable values (knobs). Use "initial" for default values.
-- "derived" nodes compute from deps using a named "fn".
-- "effect" nodes produce side effects from deps.
-- "producer" nodes generate values from a named "source".
-- Use "templates" when the same subgraph pattern repeats (e.g., per-source resilience).
-- Use "feedback" for bounded cycles where a derived value writes back to a state node.
-- meta.description is required for every node.
-- Return ONLY valid JSON, no markdown fences or commentary.`;function Q(i){let n=i.match(/^```(?:json)?\s*([\s\S]*?)\s*```[\s\S]*$/);return n?n[1]:i}async function ce(i,n,o){let r=H,d=o?.catalogDescription??(o?.catalog?K(o.catalog):void 0);d&&(r+=`
-
-Available catalog (use ONLY these names):
-${d}`),o?.systemPromptExtra&&(r+=`
-
-${o.systemPromptExtra}`);let p=[{role:"system",content:r},{role:"user",content:i}],c=(await n.invoke(p,{model:o?.model,temperature:o?.temperature??0,maxTokens:o?.maxTokens})).content.trim();c.startsWith("```")&&(c=Q(c));let t;try{t=JSON.parse(c)}catch{throw new Error(`llmCompose: LLM response is not valid JSON: ${c.slice(0,200)}`)}let $=A(t);if(!$.valid)throw new Error(`llmCompose: invalid GraphSpec:
-${$.errors.join(`
-`)}`);let O=t;if(o?.catalog){let w=o.maxAutoRefine??0;for(let m=0;m<=w;m++){let g=q(O,o.catalog);if(g.valid)break;if(m===w)throw new Error(`llmCompose: catalog validation failed after ${w} refine attempts:
-${g.errors.join(`
-`)}`);O=await X(O,`Fix these catalog errors:
-${g.errors.join(`
-`)}
-
-Use ONLY functions and sources from the catalog.`,n,{...o,catalogDescription:d})}}return O}async function X(i,n,o,r){let d=H;r?.catalogDescription&&(d+=`
-
-Available catalog:
-${r.catalogDescription}`),r?.systemPromptExtra&&(d+=`
-
-${r.systemPromptExtra}`);let p=[{role:"system",content:d},{role:"user",content:`Current GraphSpec:
-${JSON.stringify(i,null,2)}
-
-Modification request: ${n}
-
-Return the complete modified GraphSpec as JSON.`}],c=(await o.invoke(p,{model:r?.model,temperature:r?.temperature??0,maxTokens:r?.maxTokens})).content.trim();c.startsWith("```")&&(c=Q(c));let t;try{t=JSON.parse(c)}catch{throw new Error(`llmRefine: LLM response is not valid JSON: ${c.slice(0,200)}`)}let $=A(t);if(!$.valid)throw new Error(`llmRefine: invalid GraphSpec:
-${$.errors.join(`
-`)}`);return t}export{M as a,W as b,V as c,B as d,K as e,q as f,A as g,se as h,ae as i,ie as j,ce as k,X as l,pe as m};

package/dist/chunk-WSLN4JFO.js

@@ -1 +0,0 @@
-import{a as H,b as T}from"./chunk-QP5TH523.js";import{j as q}from"./chunk-B4L5X2QO.js";import{a as O,b as j}from"./chunk-533RQFF6.js";import{E as d,G as o,H as x,m as A}from"./chunk-LYCLF26R.js";import{b as ae}from"./chunk-QYADASLV.js";var ie={};ae(ie,{demoShell:()=>re});function w(h){return Math.max(0,Math.min(1,h))}function re(h){let B=w(h?.mainRatio??.65),E=w(h?.sideSplit??.5),J=Math.max(0,h?.viewportWidth??1280),k=h?.nodeRegistry??new Map,p=h?.adapter??null,S=h?.layoutFont??"14px monospace",u=h?.onHighlight,t=new q("demo-shell"),F=d(B,{name:"pane/main-ratio"}),D=d(E,{name:"pane/side-split"}),g=d(null,{name:"pane/fullscreen"}),G=d(J,{name:"viewport/width"});t.add(F,{name:"pane/main-ratio"}),t.add(D,{name:"pane/side-split"}),t.add(g,{name:"pane/fullscreen"}),t.add(G,{name:"viewport/width"});let L=o([F,G,g],([e,a,n])=>{let l=e,r=a,i=n;return i==="main"?r:i==="graph"||i==="code"?0:Math.round(r*l)},{name:"pane/main-width"}),R=o([L,G,g],([e,a,n])=>{let l=n,r=a;return l==="main"?0:l==="graph"||l==="code"?r:r-e},{name:"pane/side-width"}),C=o([D,g],([e,a])=>{let n=a;return n==="graph"?1:n==="code"||n==="main"?0:w(e)},{name:"pane/graph-height-ratio"}),K=o([C,g],([e,a])=>{let n=a;return n==="code"?1:n==="graph"||n==="main"?0:1-e},{name:"pane/code-height-ratio"});t.add(L,{name:"pane/main-width"}),t.add(R,{name:"pane/side-width"}),t.add(C,{name:"pane/graph-height-ratio"}),t.add(K,{name:"pane/code-height-ratio"});let b=d(null,{name:"demo/graph-ref"}),m=d(0,{name:"demo/graph-tick"});t.add(b,{name:"demo/graph-ref"}),t.add(m,{name:"demo/graph-tick"});let Q=o([b,m],([e,a])=>{let n=e;return n?n.describe({format:"mermaid"}):""},{name:"graph/mermaid"}),z=o([b,m],([e,a])=>{let n=e;if(!n)return null;let{expand:l,...r}=n.describe({detail:"standard"});return r},{name:"graph/describe"});t.add(Q,{name:"graph/mermaid"}),t.add(z,{name:"graph/describe"});let M=d(null,{name:"hover/target"});t.add(M,{name:"hover/target"});let P=o([M],([e])=>{let a=e;if(!a)return null;let n=k.get(a.id);return n?n.codeLine:null},{name:"highlight/code-scroll"}),W=o([M],([e])=>{let a=e;if(!a)return null;let n=k.get(a.id);return n?n.visualSelector:null},{name:"highlight/visual"}),N=o([M],([e])=>{let a=e;return a?a.id:null},{name:"highlight/graph"});if(t.add(P,{name:"highlight/code-scroll"}),t.add(W,{name:"highlight/visual"}),t.add(N,{name:"highlight/graph"}),u?.codeScroll){let e=u.codeScroll,a=x([P],([n])=>{e(n)});t.add(a,{name:"highlight/apply-code-scroll"})}if(u?.visual){let e=u.visual,a=x([W],([n])=>{e(n)});t.add(a,{name:"highlight/apply-visual"})}if(u?.graph){let e=u.graph,a=x([N],([n])=>{e(n)});t.add(a,{name:"highlight/apply-graph"})}let _=d(null,{name:"inspect/selected-node"});t.add(_,{name:"inspect/selected-node"});let U=O("standard"),X=o([_,b,m],([e,a,n])=>{let l=a,r=e;if(!l||!r)return null;try{let i=l.resolve(r),s=j(i,U);return{path:r,...s,value:i.cache}}catch{return null}},{name:"inspect/node-detail"}),Y=o([b,m],([e,a])=>{let n=e;return n?n.trace():[]},{name:"inspect/trace-log"});t.add(X,{name:"inspect/node-detail"}),t.add(Y,{name:"inspect/trace-log"});let I=d(!1,{name:"meta/debug"});t.add(I,{name:"meta/debug"});let Z=o([I,m],([e,a])=>e?t.describe({format:"mermaid"}):"",{name:"meta/shell-mermaid"});t.add(Z,{name:"meta/shell-mermaid"});let V=d("",{name:"layout/code-text"});if(t.add(V,{name:"layout/code-text"}),p){let e=new Map,a=o([z],([r])=>{let i=r;if(!i)return new Map;let s=new Map;for(let[c]of Object.entries(i.nodes)){let f=H(c,S,p,e),v=T(f,1/0,p,S,e),y=v.lines.reduce((te,ne)=>Math.max(te,ne.width),0),ee=v.lineCount*20;s.set(c,{width:y,height:ee})}return s},{name:"layout/graph-labels",equals:(r,i)=>{if(r===i)return!0;let s=r,c=i;if(s.size!==c.size)return!1;for(let[f,v]of s){let y=c.get(f);if(!y||y.width!==v.width||y.height!==v.height)return!1}return!0}}),n=o([V,R],([r,i])=>{let s=r;if(!s)return{lineCount:0,lines:[]};let c=H(s,S,p,e),f=i-40;return T(c,Math.max(100,f),p,S,e)},{name:"layout/code-lines"}),l=o([a],([r])=>{let i=r;if(i.size===0)return 200;let s=0;for(let{width:c}of i.values())c>s&&(s=c);return Math.max(200,Math.round(s+80))},{name:"layout/side-width-hint"});t.add(a,{name:"layout/graph-labels"}),t.add(n,{name:"layout/code-lines"}),t.add(l,{name:"layout/side-width-hint"})}let $=0;return{graph:t,setMainRatio(e){t.set("pane/main-ratio",w(e))},setSideSplit(e){t.set("pane/side-split",w(e))},setFullscreen(e){t.set("pane/fullscreen",e)},setViewportWidth(e){t.set("viewport/width",Math.max(0,e))},setHoverTarget(e){t.set("hover/target",e)},setDemoGraph(e){t.set("demo/graph-ref",e)},bumpGraphTick(){t.set("demo/graph-tick",++$)},selectNode(e){t.set("inspect/selected-node",e)},setMetaDebug(e){t.set("meta/debug",e)},setCodeText(e){t.set("layout/code-text",e)},batch(e){A(e)},destroy(){t.destroy()}}}export{re as a,ie as b};

package/dist/chunk-XIJKEXWR.js

@@ -1 +0,0 @@
-import{b as F,c as G}from"./chunk-O32GJOUJ.js";import{j as _}from"./chunk-B4L5X2QO.js";import{t as B}from"./chunk-JJTF75VS.js";import{b as $}from"./chunk-TZQPPQEQ.js";import{C as N}from"./chunk-MQZWA3DF.js";import{D as x,E as I,G as S,H as M,m as A}from"./chunk-LYCLF26R.js";import{b as k,c as v,d as y,f as T,g as O,i as E,j as w}from"./chunk-CK2E7BTU.js";import{b as K}from"./chunk-QYADASLV.js";var U={};K(U,{budgetGate:()=>C,effectivenessTracker:()=>L,feedback:()=>V,funnel:()=>P,scorer:()=>z});function R(u,t){return G("reduction",u,t)}function P(u,t,i,b){if(t.length===0)throw new RangeError("funnel requires at least one source");if(i.length===0)throw new RangeError("funnel requires at least one stage");let d=new _(u,b),s=t.length===1?t[0]:B(...t);d.add(s,{name:"merged"});let e="merged";for(let f=0;f<i.length;f++){let o=i[f],c=new _(o.name);o.build(c);try{c.resolve("input")}catch{throw new Error(`funnel stage "${o.name}" must define an "input" node`)}try{c.resolve("output")}catch{throw new Error(`funnel stage "${o.name}" must define an "output" node`)}d.mount(o.name,c);let l=d.resolve(e),m=`${o.name}::input`,g=d.resolve(m),a=`__bridge_${e}\u2192${o.name}_input`,p=M([l],([r])=>{g.emit(r)},{name:a});d.add(p,{name:a}),d.addDisposer(N(p)),e=`${o.name}::output`}return d}function V(u,t,i,b){let d=b?.maxIterations??10,s=`__feedback_${t}`,e=I(0,{meta:R("feedback_counter",{maxIterations:d,feedbackFrom:t,feedbackTo:i})});u.add(e,{name:s});let f=u.resolve(t),o=u.resolve(i),c=`__feedback_effect_${t}`,l=x([],(m,g)=>{let a=f.subscribe(p=>{for(let r of p){let n=r[0];if(n===k){let h=r[1];if(h==null)return;A(()=>{F(e,d)&&o.emit(h)})}else if(n===E||n===w){let h=n===w&&r.length>1?[w,r[1]]:[n];e.down([h])}}});return()=>a()},{name:c,describeKind:"effect",meta:{...R("feedback_effect",{feedbackFrom:t,feedbackTo:i}),_internal:!0}});return u.add(l,{name:c}),u.addDisposer(N(l)),u}function C(u,t,i){if(t.length===0)throw new RangeError("budgetGate requires at least one constraint");let b=t.map(a=>a.node),d=[u,...b],s=[],e=!1,f=!1,o=Symbol("budget-gate"),c=new Array(t.length);function l(){return t.every((a,p)=>a.check(c[p]))}function m(a){for(;s.length>0&&l();){let p=s[0];s=s.slice(1),a.emit(p)}s.length===0&&f&&(f=!1,a.down([[y]]))}return x([],(a,p)=>{for(let n=0;n<t.length;n++)c[n]=t[n].node.cache;let r=[];for(let n=0;n<d.length;n++){let h=d[n];r.push(h.subscribe(q=>{for(let D of q)g(D,n,p)}))}return()=>{for(let n of r)n()}},{...i,describeKind:"derived",meta:R("budget_gate",i?.meta)});function g(a,p,r){let n=a[0];if(p===0){if(n===k)return l()&&s.length===0?r.emit(a[1]):(s.push(a[1]),e||(e=!0,r.up([[T,o]]))),!0;if(n===v)return r.down([[v]]),!0;if(n===y)return s.length===0?r.down([[y]]):f=!0,!0;if(n===E||n===w){for(let h of s)r.emit(h);return s=[],f=!1,e&&(e=!1,r.up([[O,o]])),r.down([a]),!0}return!1}return n===k&&(c[p-1]=a[1]),n===k||n===y?(l()&&s.length>0?(m(r),s.length===0&&e&&(e=!1,r.up([[O,o]]))):!l()&&!e&&s.length>0&&(e=!0,r.up([[T,o]])),!0):n===v?!0:n===w?(r.down([a]),!0):n===E}}function z(u,t,i){if(u.length===0)throw new RangeError("scorer requires at least one source");if(u.length!==t.length)throw new RangeError("scorer requires the same number of sources and weights");let b=[...u,...t],d=u.length,s=i?.scoreFns;return S(b,e=>{let f=e.slice(0,d),o=e.slice(d),c=[],l=0;for(let m=0;m<d;m++){let g=f[m]??0,a=o[m]??0,r=(s?.[m]?s[m](g):g)*a;c.push(r),l+=r}return{value:f,score:l,breakdown:c}},{...i?{equals:i.equals,resubscribable:i.resubscribable,resetOnTeardown:i.resetOnTeardown}:{},describeKind:"derived",meta:R("scorer",i?.meta)})}function L(u){let t=$({name:u?.name??"effectiveness-entries"}),i=S([t.entries],([e])=>new Map(e),{name:`${u?.name??"effectiveness"}-snapshot`,equals:(e,f)=>{let o=e,c=f;if(o.size!==c.size)return!1;for(let[l,m]of o){let g=c.get(l);if(!g||m.attempts!==g.attempts||m.successes!==g.successes)return!1}return!0}});function b(e,f){let o=t.get(e),c=(o?.attempts??0)+1,l=(o?.successes??0)+(f?1:0);t.set(e,{key:e,attempts:c,successes:l,successRate:l/c})}function d(e){return t.get(e)}let s=N(i);return{node:i,record:b,lookup:d,dispose:()=>s()}}export{P as a,V as b,C as c,z as d,L as e,U as f};

package/dist/imperative-audit-ahAE65a9.d.cts

@@ -1,28 +0,0 @@
-/**
- * Imperative-controller-with-audit helper layer (Audit 2 — locked 2026-04-24).
- *
- * Five Phase-4 primitives share the same shape: imperative mutation methods +
- * closure state + reactive audit log + freeze-at-entry + rollback-on-throw.
- * This module factors out the common machinery so each primitive becomes
- * declarative wiring over typed audit records:
- *  - `gate`, `pipeline.gate`            (Wave A.2 Unit 8)
- *  - `JobQueueGraph`                    (Wave B.3 Unit 15)
- *  - `CqrsGraph.dispatch`               (Wave C.2 Unit 20)
- *  - `CqrsGraph.saga`                   (Wave C.3 Unit 22)
- *  - `processManager` (Wave 7)          [out of scope this commit]
- *
- * @internal — exposed for primitive impls only; not re-exported through any
- * patterns/<x>/index.ts barrel.
- */
-
-/** Shared base shape for every audit record. Per-primitive types extend this. */
-interface BaseAuditRecord {
-    readonly t_ns: number;
-    readonly seq?: number;
-    readonly handlerVersion?: {
-        id: string;
-        version: string | number;
-    };
-}
-
-export type { BaseAuditRecord as B };

package/dist/imperative-audit-ahAE65a9.d.ts

@@ -1,28 +0,0 @@
-/**
- * Imperative-controller-with-audit helper layer (Audit 2 — locked 2026-04-24).
- *
- * Five Phase-4 primitives share the same shape: imperative mutation methods +
- * closure state + reactive audit log + freeze-at-entry + rollback-on-throw.
- * This module factors out the common machinery so each primitive becomes
- * declarative wiring over typed audit records:
- *  - `gate`, `pipeline.gate`            (Wave A.2 Unit 8)
- *  - `JobQueueGraph`                    (Wave B.3 Unit 15)
- *  - `CqrsGraph.dispatch`               (Wave C.2 Unit 20)
- *  - `CqrsGraph.saga`                   (Wave C.3 Unit 22)
- *  - `processManager` (Wave 7)          [out of scope this commit]
- *
- * @internal — exposed for primitive impls only; not re-exported through any
- * patterns/<x>/index.ts barrel.
- */
-
-/** Shared base shape for every audit record. Per-primitive types extend this. */
-interface BaseAuditRecord {
-    readonly t_ns: number;
-    readonly seq?: number;
-    readonly handlerVersion?: {
-        id: string;
-        version: string | number;
-    };
-}
-
-export type { BaseAuditRecord as B };

package/dist/index-BCq12BqB.d.ts

@@ -1,139 +0,0 @@
-import { a as Node } from './node-fSc-hCv8.js';
-import { G as Graph } from './graph-YQXDndFy.js';
-
-/**
- * Memory patterns (roadmap §4.3).
- *
- * Domain-layer helpers composed from GraphRefly primitives. `vectorIndex` uses
- * an exact-search backend by default; an HNSW adapter can be injected as an
- * optional dependency.
- */
-
-type CollectionPolicy = "fifo" | "lru";
-type VectorBackend = "flat" | "hnsw";
-type LightCollectionEntry<T> = {
-    readonly id: string;
-    readonly value: T;
-    readonly createdAtNs: number;
-    readonly lastAccessNs: number;
-};
-type LightCollectionOptions = {
-    name?: string;
-    maxSize?: number;
-    policy?: CollectionPolicy;
-};
-type LightCollectionBundle<T> = {
-    readonly entries: Node<ReadonlyMap<string, LightCollectionEntry<T>>>;
-    upsert: (id: string, value: T) => void;
-    remove: (id: string) => void;
-    clear: () => void;
-    get: (id: string) => T | undefined;
-    has: (id: string) => boolean;
-};
-type CollectionEntry<T> = LightCollectionEntry<T> & {
-    readonly baseScore: number;
-};
-type RankedCollectionEntry<T> = CollectionEntry<T> & {
-    readonly score: number;
-};
-type CollectionOptions<T> = {
-    maxSize?: number;
-    policy?: CollectionPolicy;
-    /**
-     * Produces a base score at insert/update time.
-     */
-    score?: (value: T) => number;
-    /**
-     * Exponential decay rate per second. 0 disables decay.
-     */
-    decayRate?: number;
-    /**
-     * Minimum score floor after decay.
-     */
-    minScore?: number;
-};
-type CollectionGraph<T> = Graph & {
-    upsert: (id: string, value: T, opts?: {
-        score?: number;
-    }) => void;
-    remove: (id: string) => void;
-    clear: () => void;
-    getItem: (id: string) => CollectionEntry<T> | undefined;
-};
-type VectorRecord<TMeta> = {
-    readonly id: string;
-    readonly vector: readonly number[];
-    readonly meta?: TMeta;
-};
-type VectorSearchResult<TMeta> = {
-    readonly id: string;
-    readonly score: number;
-    readonly meta?: TMeta;
-};
-type HnswAdapter<TMeta> = {
-    upsert: (id: string, vector: readonly number[], meta?: TMeta) => void;
-    remove: (id: string) => void;
-    clear: () => void;
-    search: (query: readonly number[], k: number) => ReadonlyArray<VectorSearchResult<TMeta>>;
-};
-type VectorIndexOptions<TMeta> = {
-    backend?: VectorBackend;
-    dimension?: number;
-    /**
-     * Optional dependency seam for HNSW.
-     */
-    hnswFactory?: () => HnswAdapter<TMeta>;
-};
-type VectorIndexBundle<TMeta> = {
-    readonly backend: VectorBackend;
-    readonly entries: Node<ReadonlyMap<string, VectorRecord<TMeta>>>;
-    upsert: (id: string, vector: readonly number[], meta?: TMeta) => void;
-    remove: (id: string) => void;
-    clear: () => void;
-    search: (query: readonly number[], k?: number) => ReadonlyArray<VectorSearchResult<TMeta>>;
-};
-type KnowledgeEdge<TRelation extends string = string> = {
-    readonly from: string;
-    readonly to: string;
-    readonly relation: TRelation;
-    readonly weight: number;
-};
-type KnowledgeGraphGraph<TEntity, TRelation extends string = string> = Graph & {
-    upsertEntity: (id: string, value: TEntity) => void;
-    removeEntity: (id: string) => void;
-    link: (from: string, to: string, relation: TRelation, weight?: number) => void;
-    unlink: (from: string, to: string, relation?: TRelation) => void;
-    related: (id: string, relation?: TRelation) => ReadonlyArray<KnowledgeEdge<TRelation>>;
-};
-declare function decay(baseScore: number, ageSeconds: number, ratePerSecond: number, minScore?: number): number;
-declare function lightCollection<T>(opts?: LightCollectionOptions): LightCollectionBundle<T>;
-declare function collection<T>(name: string, opts?: CollectionOptions<T>): CollectionGraph<T>;
-declare function vectorIndex<TMeta>(opts?: VectorIndexOptions<TMeta>): VectorIndexBundle<TMeta>;
-declare function knowledgeGraph<TEntity, TRelation extends string = string>(name: string): KnowledgeGraphGraph<TEntity, TRelation>;
-
-type index_CollectionEntry<T> = CollectionEntry<T>;
-type index_CollectionGraph<T> = CollectionGraph<T>;
-type index_CollectionOptions<T> = CollectionOptions<T>;
-type index_CollectionPolicy = CollectionPolicy;
-type index_HnswAdapter<TMeta> = HnswAdapter<TMeta>;
-type index_KnowledgeEdge<TRelation extends string = string> = KnowledgeEdge<TRelation>;
-type index_KnowledgeGraphGraph<TEntity, TRelation extends string = string> = KnowledgeGraphGraph<TEntity, TRelation>;
-type index_LightCollectionBundle<T> = LightCollectionBundle<T>;
-type index_LightCollectionEntry<T> = LightCollectionEntry<T>;
-type index_LightCollectionOptions = LightCollectionOptions;
-type index_RankedCollectionEntry<T> = RankedCollectionEntry<T>;
-type index_VectorBackend = VectorBackend;
-type index_VectorIndexBundle<TMeta> = VectorIndexBundle<TMeta>;
-type index_VectorIndexOptions<TMeta> = VectorIndexOptions<TMeta>;
-type index_VectorRecord<TMeta> = VectorRecord<TMeta>;
-type index_VectorSearchResult<TMeta> = VectorSearchResult<TMeta>;
-declare const index_collection: typeof collection;
-declare const index_decay: typeof decay;
-declare const index_knowledgeGraph: typeof knowledgeGraph;
-declare const index_lightCollection: typeof lightCollection;
-declare const index_vectorIndex: typeof vectorIndex;
-declare namespace index {
-  export { type index_CollectionEntry as CollectionEntry, type index_CollectionGraph as CollectionGraph, type index_CollectionOptions as CollectionOptions, type index_CollectionPolicy as CollectionPolicy, type index_HnswAdapter as HnswAdapter, type index_KnowledgeEdge as KnowledgeEdge, type index_KnowledgeGraphGraph as KnowledgeGraphGraph, type index_LightCollectionBundle as LightCollectionBundle, type index_LightCollectionEntry as LightCollectionEntry, type index_LightCollectionOptions as LightCollectionOptions, type index_RankedCollectionEntry as RankedCollectionEntry, type index_VectorBackend as VectorBackend, type index_VectorIndexBundle as VectorIndexBundle, type index_VectorIndexOptions as VectorIndexOptions, type index_VectorRecord as VectorRecord, type index_VectorSearchResult as VectorSearchResult, index_collection as collection, index_decay as decay, index_knowledgeGraph as knowledgeGraph, index_lightCollection as lightCollection, index_vectorIndex as vectorIndex };
-}
-
-export { type CollectionEntry as C, type HnswAdapter as H, type KnowledgeGraphGraph as K, type LightCollectionBundle as L, type RankedCollectionEntry as R, type VectorSearchResult as V, type VectorIndexBundle as a, type CollectionGraph as b, type CollectionOptions as c, type CollectionPolicy as d, type KnowledgeEdge as e, type LightCollectionEntry as f, type LightCollectionOptions as g, type VectorBackend as h, index as i, type VectorIndexOptions as j, type VectorRecord as k, collection as l, decay as m, knowledgeGraph as n, lightCollection as o, vectorIndex as v };

package/dist/index-BokynmA4.d.cts

@@ -1,186 +0,0 @@
-import { a as Node, N as NodeOptions } from './node-fSc-hCv8.cjs';
-import { a as GraphOptions, G as Graph } from './graph-CaNXUc3c.cjs';
-
-/**
- * Reduction primitives (roadmap §8.1).
- *
- * Composable building blocks for taking heterogeneous massive inputs and producing
- * prioritized, auditable, human-actionable output. Each primitive is either a Graph
- * factory or a Node factory, built on top of core + extra primitives.
- *
- * @module
- */
-
-type StepRef = string | Node<unknown>;
-/** A named stage for {@link funnel}. */
-type FunnelStage = {
-    /** Stage name (mounted as subgraph). */
-    name: string;
-    /** Builder: receives a sub-graph, should add an `"input"` and `"output"` node. */
-    build: (sub: Graph) => void;
-};
-/** Options for {@link funnel}. */
-type FunnelOptions = GraphOptions & {
-    meta?: Record<string, unknown>;
-};
-/**
- * Multi-source merge with sequential reduction stages.
- *
- * Sources are merged into a single stream. Each stage is a named subgraph
- * (mounted via `graph.mount()`). Stages connect linearly:
- * `merged → stage[0].input → stage[0].output → stage[1].input → ...`
- *
- * @param name - Graph name.
- * @param sources - Input nodes to merge.
- * @param stages - Sequential reduction stages.
- * @param opts - Optional graph/meta options.
- * @returns Graph with `"merged"` and mounted stage subgraphs.
- *
- * @category patterns
- */
-declare function funnel<T>(name: string, sources: ReadonlyArray<Node<T>>, stages: ReadonlyArray<FunnelStage>, opts?: FunnelOptions): Graph;
-/** Options for {@link feedback}. */
-type FeedbackOptions = {
-    /** Maximum feedback iterations before stopping (default: 10). */
-    maxIterations?: number;
-    /** Optional budget gate node path for cost-bounded iteration. */
-    budgetNode?: StepRef;
-    meta?: Record<string, unknown>;
-};
-/**
- * Introduce a bounded reactive cycle into an existing graph.
- *
- * When `condition` emits a non-null DATA value, the feedback effect routes it
- * back to the `reentry` state node — creating a cycle. Bounded by
- * `maxIterations` (default 10). The counter node (`__feedback_<condition>`)
- * is the source of truth — reset it to 0 to allow more iterations.
- *
- * To remove the feedback cycle, call `graph.remove("__feedback_<condition>")`.
- *
- * @param graph - Existing graph to augment with a feedback cycle.
- * @param condition - Path to a node whose DATA triggers feedback.
- * @param reentry - Path to a state node that receives the feedback value.
- * @param opts - Iteration bounds and metadata.
- * @returns The same graph (mutated with feedback nodes added).
- *
- * @category patterns
- */
-declare function feedback(graph: Graph, condition: string, reentry: string, opts?: FeedbackOptions): Graph;
-/** A reactive constraint for {@link budgetGate}. */
-type BudgetConstraint<T = unknown> = {
-    /** Constraint node whose value is checked. */
-    node: Node<T>;
-    /** Returns `true` when the constraint is satisfied (budget available). */
-    check: (value: T) => boolean;
-};
-/** Options for {@link budgetGate}. */
-type BudgetGateOptions = Omit<NodeOptions<unknown>, "describeKind" | "name" | "meta"> & {
-    meta?: Record<string, unknown>;
-};
-/**
- * Pass-through that respects reactive constraint nodes.
- *
- * DATA flows through when all constraints are satisfied. When any constraint
- * is exceeded, PAUSE is sent upstream and DATA is buffered. When constraints
- * relax, RESUME is sent and buffered DATA flushes.
- *
- * @param source - Input node.
- * @param constraints - Reactive constraint checks.
- * @param opts - Optional node options.
- * @returns Gated node.
- *
- * @category patterns
- */
-declare function budgetGate<T>(source: Node<T>, constraints: ReadonlyArray<BudgetConstraint>, opts?: BudgetGateOptions): Node<T>;
-/** A scored item with full breakdown. */
-type ScoredItem<T = unknown> = {
-    /** Original value. */
-    value: T;
-    /** Final weighted score. */
-    score: number;
-    /** Per-signal breakdown: signal index → weighted contribution. */
-    breakdown: number[];
-};
-/** Options for {@link scorer}. */
-type ScorerOptions = Omit<NodeOptions<unknown>, "describeKind" | "name" | "meta"> & {
-    meta?: Record<string, unknown>;
-    /** Custom scoring function per signal. Default: identity (signal value IS the score). */
-    scoreFns?: ReadonlyArray<(value: unknown) => number>;
-};
-/**
- * Reactive multi-signal scoring with live weights.
- *
- * Each source emits items to score. Weights are reactive state nodes that
- * LLM or human can adjust live. Output is sorted scored items with full
- * breakdown.
- *
- * @param sources - Signal nodes (each emits a numeric score dimension).
- * @param weights - Reactive weight nodes (one per source).
- * @param opts - Optional node/meta options.
- * @returns Node emitting scored output.
- *
- * @category patterns
- */
-declare function scorer(sources: ReadonlyArray<Node<number>>, weights: ReadonlyArray<Node<number>>, opts?: ScorerOptions): Node<ScoredItem<number[]>>;
-/** A single effectiveness record for an action×context pair. */
-type EffectivenessEntry = {
-    readonly key: string;
-    readonly attempts: number;
-    readonly successes: number;
-    readonly successRate: number;
-};
-/** Snapshot shape for the effectiveness tracker node. */
-type EffectivenessSnapshot = ReadonlyMap<string, EffectivenessEntry>;
-/** Bundle returned by {@link effectivenessTracker}. */
-interface EffectivenessTrackerBundle {
-    /** Reactive node — current effectiveness map snapshot. */
-    readonly node: Node<EffectivenessSnapshot>;
-    /** Record a completed action (success or failure). */
-    record(key: string, success: boolean): void;
-    /** Look up effectiveness for a specific key. */
-    lookup(key: string): EffectivenessEntry | undefined;
-    /** Tear down internal keepalive subscriptions. */
-    dispose(): void;
-}
-/** Options for {@link effectivenessTracker}. */
-type EffectivenessTrackerOptions = {
-    /** Name for the reactive map (default "effectiveness-entries"). */
-    name?: string;
-};
-/**
- * Generic action×context → success rate tracker.
- *
- * Generalized from the harness `strategyModel` pattern. Tracks attempts and
- * successes per string key, exposes a reactive snapshot node, and provides
- * `record()` / `lookup()` methods.
- *
- * Use cases: A/B testing, routing optimization, cache policy tuning, retry
- * strategy selection — any domain that tracks effectiveness per action.
- *
- * @param opts - Optional configuration.
- * @returns Bundle with reactive node, record(), lookup(), dispose().
- */
-declare function effectivenessTracker(opts?: EffectivenessTrackerOptions): EffectivenessTrackerBundle;
-
-type index_BudgetConstraint<T = unknown> = BudgetConstraint<T>;
-type index_BudgetGateOptions = BudgetGateOptions;
-type index_EffectivenessEntry = EffectivenessEntry;
-type index_EffectivenessSnapshot = EffectivenessSnapshot;
-type index_EffectivenessTrackerBundle = EffectivenessTrackerBundle;
-type index_EffectivenessTrackerOptions = EffectivenessTrackerOptions;
-type index_FeedbackOptions = FeedbackOptions;
-type index_FunnelOptions = FunnelOptions;
-type index_FunnelStage = FunnelStage;
-type index_ScoredItem<T = unknown> = ScoredItem<T>;
-type index_ScorerOptions = ScorerOptions;
-type index_StepRef = StepRef;
-declare const index_budgetGate: typeof budgetGate;
-declare const index_effectivenessTracker: typeof effectivenessTracker;
-declare const index_feedback: typeof feedback;
-declare const index_funnel: typeof funnel;
-declare const index_scorer: typeof scorer;
-declare namespace index {
-  export { type index_BudgetConstraint as BudgetConstraint, type index_BudgetGateOptions as BudgetGateOptions, type index_EffectivenessEntry as EffectivenessEntry, type index_EffectivenessSnapshot as EffectivenessSnapshot, type index_EffectivenessTrackerBundle as EffectivenessTrackerBundle, type index_EffectivenessTrackerOptions as EffectivenessTrackerOptions, type index_FeedbackOptions as FeedbackOptions, type index_FunnelOptions as FunnelOptions, type index_FunnelStage as FunnelStage, type index_ScoredItem as ScoredItem, type index_ScorerOptions as ScorerOptions, type index_StepRef as StepRef, index_budgetGate as budgetGate, index_effectivenessTracker as effectivenessTracker, index_feedback as feedback, index_funnel as funnel, index_scorer as scorer };
-}
-
-export { type BudgetConstraint as B, type EffectivenessEntry as E, type FeedbackOptions as F, type ScoredItem as S, type BudgetGateOptions as a, type EffectivenessSnapshot as b, type EffectivenessTrackerBundle as c, type EffectivenessTrackerOptions as d, type FunnelOptions as e, type FunnelStage as f, type ScorerOptions as g, type StepRef as h, index as i, budgetGate as j, effectivenessTracker as k, feedback as l, funnel as m, scorer as s };