@graphrefly/graphrefly 0.38.0 → 0.39.0

package/dist/chunk-XLYF4LBH.js

@@ -1 +0,0 @@
-import{a as $}from"./chunk-6KZZ6XQE.js";import{c as O}from"./chunk-O32GJOUJ.js";import{a as C}from"./chunk-NSAZ6PR6.js";import{k as A}from"./chunk-QMC2PLNM.js";import{b as x}from"./chunk-7KZZLWZ6.js";import{C as R}from"./chunk-RZ5HKPGI.js";import{C as T,E as N,G as E,o as b,p as w,u as P,w as S}from"./chunk-LYCLF26R.js";import{b as v}from"./chunk-CK2E7BTU.js";import{b as M}from"./chunk-QYADASLV.js";var J={};M(J,{AuditTrailGraph:()=>k,PolicyEnforcerGraph:()=>G,auditTrail:()=>z,complianceSnapshot:()=>F,policyEnforcer:()=>K,reactiveExplainPath:()=>q});function V(i,t){return O("audit",i,t)}var L=new Set(["data","error","complete","teardown"]),k=class extends A{entries;count;_log;_target;constructor(t,n){super(n.name??`${t.name}_audit`,n.graph),this._target=t,this._log=x([],{name:"entries",...n.maxSize!=null?{maxSize:n.maxSize}:{}}),this.entries=this._log.entries,this.add(this.entries,{name:"entries"}),this.count=E([this.entries],([c])=>c.length,{name:"count",describeKind:"derived",meta:V("count")}),this.add(this.count,{name:"count"}),this.addDisposer(R(this.count));let o=n.includeTypes!=null?new Set(n.includeTypes):L,u=n.filter,a=0,h=t.observe({timeline:!0,structured:!0}),m=h.onEvent(c=>{if(c.type==="derived")return;let e=c.type;if(!o.has(e))return;let d=c.path??"",r={seq:a++,timestamp_ns:c.timestamp_ns??b(),wall_clock_ns:w(),path:d,type:e},f=(d?D(t,d):void 0)?.lastMutation;f!=null&&(r.actor=f.actor),e==="data"&&(r.value=c.data),e==="error"&&(r.error=c.data);let l=d?U(t,d):void 0;l!=null&&(r.annotation=l),!(u!=null&&!u(r))&&this._log.append(r)});this.addDisposer(()=>{m(),h.dispose()}),this.addDisposer(()=>this._log.disposeAllViews())}all(){return this.entries.cache??[]}byNode(t){return this.all().filter(n=>n.path===t)}byActor(t){return this.all().filter(n=>n.actor?.id===t)}byActorType(t){return this.all().filter(n=>n.actor?.type===t)}byTimeRange(t,n){return this.all().filter(o=>!(o.timestamp_ns<t||n!=null&&o.timestamp_ns>=n))}get target(){return this._target}};function z(i,t={}){return new k(i,t)}var G=class extends A{policies;violations;violationCount;_target;_mode;_currentGuard;constructor(t,n,o){super(o.name??`${t.name}_policy`,o.graph),this._target=t,this._mode=o.mode??"audit";let u=I(n)?n:N(n,{name:"policies"});this.policies=u,this.add(this.policies,{name:"policies"}),this.violations=new $("violations",{retainedLimit:o.violationsLimit??1e3}),this.mount("violations",this.violations),this.violationCount=E([this.violations.events],([e])=>e.length,{name:"violationCount",describeKind:"derived",meta:V("policy_violation_count")}),this.add(this.violationCount,{name:"violationCount"}),this.addDisposer(R(this.violationCount));let h=u.cache??[];this._currentGuard=P(h);let m=u.subscribe(e=>{for(let d of e)d[0]===v&&(h=d[1]??[],this._currentGuard=P(h))});this.addDisposer(m);let c=o.paths!=null?[...o.paths]:j(t);if(this._mode==="enforce"){let e=new Map,d=r=>{if(e.has(r))return;let s=D(t,r);if(!(s instanceof T))return;let f=(l,p)=>{let y=this._currentGuard(l,p);return y||this._publishViolation(l,p,r,"blocked"),y};e.set(r,s._pushGuard(f))};for(let r of c)d(r);if(o.paths==null){let r=C(t,(s,f,l)=>{if(s.kind==="added")if(s.nodeKind==="node")d(`${l}${s.name}`);else{let p=f._mounts.get(s.name);if(!(p instanceof A))return;let y=`${l}${s.name}::`,_=j(p);for(let g of _)d(g===""?`${l}${s.name}`:`${y}${g}`)}else if(s.kind==="removed")if(s.nodeKind==="node"){let p=`${l}${s.name}`,y=e.get(p);y!=null&&(y(),e.delete(p))}else{let p=`${l}${s.name}`,y=`${p}::`;for(let[_,g]of e)(_===p||_.startsWith(y))&&(g(),e.delete(_))}});this.addDisposer(r)}else{let r=t.topology.subscribe(s=>{for(let f of s){if(f[0]!==v)continue;let l=f[1];if(l.kind!=="removed"||l.nodeKind!=="node")continue;let p=e.get(l.name);p!=null&&(p(),e.delete(l.name))}});this.addDisposer(r)}this.addDisposer(()=>{for(let r of e.values())r();e.clear()})}else{let e=t.observe({timeline:!0,structured:!0}),d=e.onEvent(r=>{if(r.type!=="data"&&r.type!=="error")return;let s=r.path??"";if(!s||o.paths!=null&&!o.paths.includes(s))return;let f=r.actor??D(t,s)?.lastMutation?.actor;if(f==null)return;let l="write";this._currentGuard(f,l)||this._publishViolation(f,l,s,"observed")});this.addDisposer(()=>{d(),e.dispose()})}}_publishViolation(t,n,o,u){this.violations.publish({timestamp_ns:b(),wall_clock_ns:w(),path:o,actor:t,action:n,mode:this._mode,result:u})}all(){return this.violations.retained()}get mode(){return this._mode}get target(){return this._target}};function K(i,t,n={}){return new G(i,t,n)}function q(i,t,n,o){return i.explain(t,n,{reactive:!0,...o})}function F(i,t={}){let n={format_version:1,timestamp_ns:b(),wall_clock_ns:w(),graph:i.snapshot()};if(t.actor!=null&&(n.actor=t.actor),t.audit!=null){let u=[...t.audit.all()];n.audit={count:u.length,entries:u}}if(t.policies!=null){let u=t.policies.policies.cache??[];n.policies={mode:t.policies.mode,rules:u,violations:[...t.policies.all()]}}let o=B(n);return{...n,fingerprint:o}}function I(i){return typeof i=="object"&&i!==null&&"subscribe"in i}function D(i,t){try{return i.node(t)}catch{return}}function U(i,t){try{return i.annotation(t)}catch{return}}function j(i){let t=i.describe({detail:"minimal"});return Object.keys(t.nodes)}function B(i){return S(JSON.stringify(H(i)))}function H(i){let t=new Set,n=o=>{if(o===void 0)return{__undefined:!0};if(o===null)return null;let u=typeof o;if(u==="bigint")return{__bigint:o.toString()};if(u!=="object")return o;let a=o;if(t.has(a))return{__circular:!0};t.add(a);try{if(Array.isArray(a))return a.map(n);if(a instanceof Date)return{__date:a.toISOString()};if(a instanceof RegExp)return{__regexp:{source:a.source,flags:a.flags}};if(a instanceof Map)return{__map:[...a.entries()].map(([c,e])=>[n(c),n(e)])};if(a instanceof Set)return{__set:[...a].map(n)};if(ArrayBuffer.isView(a)){let m=a,c=new Array(m.length);for(let e=0;e<m.length;e++)c[e]=m[e]??0;return{__typed_array:{ctor:a.constructor.name,data:c}}}let h={};for(let m of Object.keys(a).sort())h[m]=n(a[m]);return h}finally{t.delete(a)}};return n(i)}export{k as a,z as b,G as c,K as d,q as e,F as f,J as g};

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-CpdnP-0y.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-CHsVwf9S.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 };

package/dist/index-DOU1Ee_k.d.ts

@@ -1,186 +0,0 @@
-import { a as Node, N as NodeOptions } from './node-fSc-hCv8.js';
-import { a as GraphOptions, G as Graph } from './graph-BjW1taJl.js';
-
-/**
- * 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 };

package/dist/resilience-LGBK236C.js

@@ -1 +0,0 @@
-import{a,b,c,d,e,f,g,h,i,j,k}from"./chunk-XIMFHEKV.js";import"./chunk-ESMPEKEV.js";import"./chunk-4VVTGLXJ.js";import"./chunk-DQJLC6YY.js";import"./chunk-RZ5HKPGI.js";import"./chunk-LYCLF26R.js";import"./chunk-CK2E7BTU.js";import"./chunk-QYADASLV.js";export{b as CircuitOpenError,f as RateLimiterOverflowError,i as TimeoutError,c as circuitBreaker,j as fallback,g as rateLimiter,a as retry,k as timeout,e as tokenBucket,d as withBreaker,h as withStatus};