@graphrefly/graphrefly 0.37.0 → 0.39.0

package/dist/{index-C_qi0WlF.d.cts → index-BJ26eEjs.d.cts}

@@ -1,8 +1,8 @@
-import { R as ReactiveLogBundle } from './reactive-log-ScpWyqny.cjs';
+import { B as BaseAuditRecord } from './index-DINuaZlJ.cjs';
+import { a as ReactiveLogBundle } from './reactive-log-_zeEnB9H.cjs';
 import { NodeInput } from './extra/sources.cjs';
 import { AppendLogStorageTier } from './extra/storage-tiers.cjs';
-import { B as BaseAuditRecord } from './imperative-audit-ahAE65a9.cjs';
-import { C as CqrsEventMap, a as CqrsEvent, b as CqrsGraph } from './index-BECJ8M0T.cjs';
+import { C as CqrsEventMap, a as CqrsEvent, b as CqrsGraph } from './index-DyM4tFAe.cjs';
 
 /**
  * Process Manager pattern (Phase 7 — roadmap §4.6, Audit 3 — locked 2026-04-24).
@@ -35,14 +35,21 @@ import { C as CqrsEventMap, a as CqrsEvent, b as CqrsGraph } from './index-BECJ8
 /**
  * Discriminated union returned by each step handler.
  *
- * - `"continue"` — update state, optionally emit side-effect events and
- *   schedule a future synthetic event.
+ * - `"success"` — step ran cleanly; update state, optionally emit
+ *   side-effect events and schedule a future synthetic event. The process
+ *   instance stays `"running"`.
  * - `"terminate"` — workflow complete; instance moves to `"terminated"`.
- * - `"fail"` — triggers compensation; instance moves to `"compensated"` /
- *   `"failed"`.
+ *   Process-specific extension to the canonical outcome enum.
+ * - `"failure"` — triggers compensation; instance moves to `"compensated"` /
+ *   `"errored"`.
+ *
+ * Field name is `outcome` (matching `cqrs.DispatchRecord.outcome` and the
+ * canonical Tier 1.6.2 / 2.3 enum). `"success"` and `"failure"` are the
+ * canonical values; `"terminate"` is the process-specific extension for
+ * "early-return success".
  */
 type ProcessStepResult<TState> = {
-    kind: "continue";
+    outcome: "success";
     state: TState;
     emit?: readonly {
         type: string;
@@ -50,7 +57,7 @@ type ProcessStepResult<TState> = {
     }[];
     schedule?: ProcessSchedule;
 } | {
-    kind: "terminate";
+    outcome: "terminate";
     state: TState;
     emit?: readonly {
         type: string;
@@ -58,7 +65,7 @@ type ProcessStepResult<TState> = {
     }[];
     reason?: string;
 } | {
-    kind: "fail";
+    outcome: "failure";
     error: unknown;
 };
 /**
@@ -79,19 +86,19 @@ type ProcessSchedule = {
  */
 type ProcessStep<TState, EM extends CqrsEventMap, K extends keyof EM & string> = (state: TState, event: CqrsEvent<EM[K]>) => NodeInput<ProcessStepResult<TState>>;
 /**
- * Compensation handler. Runs when a step returns `kind: "fail"`, throws, or
+ * Compensation handler. Runs when a step returns `outcome: "failure"`, throws, or
  * when `cancel(correlationId)` is called on a running instance.
  *
  * Should undo any side effects performed by prior steps (refund, cancel
  * reservation, etc.). Errors thrown inside compensate are swallowed and
- * recorded in the audit log with `status: "failed"` to prevent cascading
+ * recorded in the audit log with `status: "errored"` to prevent cascading
  * failure loops.
  */
 type ProcessCompensate<TState> = (state: TState, error: unknown) => NodeInput<void>;
 /**
  * Audit record for a single process instance state transition.
  *
- * Every status change (start → running → terminated / failed / compensated)
+ * Every status change (start → running → terminated / errored / compensated)
  * appends one record. `correlationId` is the stable process key.
  *
  * Extends {@link BaseAuditRecord} so records carry `t_ns` / `seq` /
@@ -103,7 +110,7 @@ interface ProcessInstance<TState> extends BaseAuditRecord {
     /** Most-recent instance state at this transition. */
     readonly state: TState;
     /** Current lifecycle status after this transition. */
-    readonly status: "running" | "terminated" | "failed" | "compensated";
+    readonly status: "running" | "terminated" | "errored" | "compensated";
     /** Wall-clock nanoseconds when `start()` was called. */
     readonly startedAt: number;
     /** Wall-clock nanoseconds of this transition. */
@@ -137,13 +144,13 @@ interface ProcessManagerOpts<TState, EM extends CqrsEventMap> {
         [K in keyof EM & string]?: ProcessStep<TState, EM, K>;
     };
     /**
-     * Optional compensation handler. Runs on step `kind: "fail"` / step throw
+     * Optional compensation handler. Runs on step `outcome: "failure"` / step throw
      * and on explicit `cancel()`. If omitted, instances fail silently with
-     * status `"failed"` instead of `"compensated"`.
+     * status `"errored"` instead of `"compensated"`.
      */
     readonly compensate?: ProcessCompensate<TState>;
     /**
-     * Optional predicate called after each `"continue"` step. When it returns
+     * Optional predicate called after each `"success"` step. When it returns
      * `true`, the instance is moved to `"terminated"` immediately without
      * waiting for a `"terminate"` step result.
      */
@@ -245,10 +252,10 @@ interface ProcessManagerResult<TState> {
  *   watching: ["orderPlaced", "paymentReceived"],
  *   steps: {
  *     orderPlaced(state, event) {
- *       return { kind: "continue", state: { ...state, orderId: event.payload.orderId } };
+ *       return { outcome: "success", state: { ...state, orderId: event.payload.orderId } };
  *     },
  *     paymentReceived(state, event) {
- *       return { kind: "terminate", state: { ...state, total: event.payload.amount } };
+ *       return { outcome: "terminate", state: { ...state, total: event.payload.amount } };
  *     },
  *   },
  *   compensate(state, _error) {

package/dist/{index-BiomL7AW.d.ts → index-BJSZxSFX.d.ts}

@@ -1,5 +1,5 @@
 import { Ref, WatchSource } from 'vue';
-import { a as Node } from './node-fSc-hCv8.js';
+import { N as Node } from './node-BYInONRr.js';
 
 /**
  * Subscribe to a read-only `Node<T>` as a Vue `Ref<T>`. Auto-unsubscribes on scope disposal.

package/dist/{index-DCAuN9u5.d.cts → index-BKMdnYnk.d.ts}

@@ -1,35 +1,37 @@
-import { a as Node } from './node-fSc-hCv8.cjs';
-import { G as Graph } from './graph-CaNXUc3c.cjs';
-import { L as LLMAdapter } from './types-BMSGPlpO.cjs';
+import { D as DescribeNodeOutput } from './meta-D8OyedKp.js';
+import { N as Node } from './node-BYInONRr.js';
+import { G as Graph, b as GraphDescribeOutput } from './graph-30XSgtVX.js';
+import { L as LLMAdapter } from './types-39jk0kaV.js';
 
 /**
  * LLM graph composition (roadmap §8.3).
  *
  * Declarative GraphSpec schema + compiler/decompiler for graph topology.
- * The LLM designs graphs as JSON; compileSpec instantiates them; decompileGraph
- * extracts them back. Templates support reusable subgraph patterns. Feedback
- * edges express bounded cycles via §8.1 feedback().
+ * The LLM designs graphs as JSON; `compileSpec` instantiates them;
+ * `decompileSpec` extracts them back. Templates support reusable subgraph
+ * patterns. Feedback edges express bounded cycles via §8.1 feedback().
+ *
+ * **Tier 1.5.3 Phase 3 (2026-04-27):** `GraphSpec` is a structural alias of
+ * {@link GraphDescribeOutput} with two LLM-author-friendly extras
+ * (`templates?` / `feedback?`). Per-node factory references are encoded in
+ * `meta.factory` + `meta.factoryArgs` (no more `fn` / `source` / `config` /
+ * `initial` fields). State node initial values live in
+ * `meta.factoryArgs.initial` (state self-tags with
+ * `factoryTag("state", { initial })`).
  *
  * @module
  */
 
-/** A single node declaration in a GraphSpec. */
-type GraphSpecNode = {
-    /** Node kind: state, producer, derived, effect, operator. */
-    type: "state" | "producer" | "derived" | "effect" | "operator";
-    /** Dependency node names (for derived/effect/operator). */
-    deps?: string[];
-    /** Named function from the catalog (for derived/effect/operator/producer). */
-    fn?: string;
-    /** Named source from the catalog (for producer). */
-    source?: string;
-    /** Freeform config passed to the catalog fn/source factory. */
-    config?: Record<string, unknown>;
-    /** Initial value (for state nodes). */
-    initial?: unknown;
-    /** Human/LLM-readable metadata. */
-    meta?: Record<string, unknown>;
-};
+/**
+ * A single node declaration in a GraphSpec — structural alias of
+ * {@link DescribeNodeOutput}.
+ *
+ * Per-node factory provenance lives in `meta.factory` + `meta.factoryArgs`
+ * (use {@link factoryTag} to stamp them at construction time). State node
+ * initial values come through `meta.factoryArgs.initial` for tagged states,
+ * with fallback to `value` (since spec projection retains state values).
+ */
+type GraphSpecNode = DescribeNodeOutput;
 /** Template instantiation node — expanded at compile time. */
 type GraphSpecTemplateRef = {
     type: "template";
@@ -56,15 +58,23 @@ type GraphSpecFeedbackEdge = {
     /** Max iterations before stopping (default: 10). */
     maxIterations?: number;
 };
-/** Declarative graph topology for LLM composition (§8.3). */
-type GraphSpec = {
-    /** Graph name. */
-    name: string;
-    /** Node declarations (keyed by node name). */
+/**
+ * Declarative graph topology for LLM composition (§8.3).
+ *
+ * Tier 1.5.3 Phase 3 (2026-04-27): structural alias of
+ * {@link GraphDescribeOutput} extended with optional `templates` /
+ * `feedback` fields for LLM-author convenience. Top-level `factory` /
+ * `factoryArgs` (Phase 2.5 carry) ride along on every describe output.
+ *
+ * Round-trip property: `decompileSpec(g) === g.describe({ detail: "spec" })`
+ * (modulo the small feedback-edge extraction sugar).
+ */
+type GraphSpec = Omit<GraphDescribeOutput, "nodes" | "expand"> & {
+    /** Node declarations (keyed by node name). Either a structural describe entry or a template ref. */
     nodes: Record<string, GraphSpecNode | GraphSpecTemplateRef>;
-    /** Reusable subgraph templates. */
+    /** Reusable subgraph templates (LLM-author extra; not present in `describe()` output). */
     templates?: Record<string, GraphSpecTemplate>;
-    /** Feedback edges (bounded cycles). */
+    /** Feedback edges (bounded cycles, LLM-author extra). */
     feedback?: GraphSpecFeedbackEdge[];
 };
 /**
@@ -125,16 +135,32 @@ type CatalogSourceEntry = {
     /** Category tags. */
     tags?: string[];
 };
+/**
+ * Top-level Graph factory — used when a spec was produced from a graph that
+ * called `Graph.prototype.tagFactory(name, args)`. The catalog supplies a
+ * function that takes the recorded `factoryArgs` (JSON-serializable subset)
+ * and returns a fully-wired Graph. Runtime context (LLMAdapter instances,
+ * callbacks, embedders) is captured by the closure — the args themselves are
+ * a documentation fragment, not a complete construction recipe.
+ *
+ * Tier 1.5.3 Phase 2.5 (DG1=B, 2026-04-27).
+ */
+type GraphFactory = (factoryArgs: unknown) => Graph;
 /**
  * Fn/source lookup table passed to compileSpec and llmCompose.
  *
  * Accepts both bare factories (backward-compatible) and rich {@link CatalogFnEntry}
  * / {@link CatalogSourceEntry} objects. When rich entries are provided, the library
  * auto-generates LLM prompts and validates LLM output against the catalog.
+ *
+ * `graphFactories` (Tier 1.5.3 Phase 2.5) handles top-level Graph-returning
+ * factories — when `spec.factory` matches a key, `compileSpec` delegates the
+ * entire reconstruction to that factory.
  */
 type GraphSpecCatalog = {
     fns?: Record<string, FnFactory | CatalogFnEntry>;
     sources?: Record<string, SourceFactory | CatalogSourceEntry>;
+    graphFactories?: Record<string, GraphFactory>;
 };
 /** Type guard: is this a rich catalog fn entry (vs bare factory)? */
 declare function isRichFnEntry(entry: FnFactory | CatalogFnEntry): entry is CatalogFnEntry;
@@ -212,19 +238,28 @@ type CompileSpecOptions = {
  */
 declare function compileSpec(spec: GraphSpec, opts?: CompileSpecOptions): Graph;
 /**
- * Extract a GraphSpec from a running graph.
+ * Extract a {@link GraphSpec} from a running graph.
+ *
+ * Tier 1.5.3 Phase 3 (2026-04-27): thin projection over
+ * `graph.describe({ detail: "spec" })`. The describe-output already carries
+ * structural fields (`type`, `deps`, optional `value`) plus per-node
+ * `meta.factory` / `meta.factoryArgs` for tagged factories and top-level
+ * `factory` / `factoryArgs` for graph-level tags. The only sugar this helper
+ * adds is a feedback-edge recovery scan over `meta.feedbackFrom` /
+ * `meta.feedbackTo` companion fields stamped by the §8.1 `feedback()`
+ * primitive.
  *
- * Uses `describe({ detail: "standard" })` as a starting point, then enriches:
- * - Feedback edges recovered from counter node meta (`feedbackFrom`/`feedbackTo`)
- * - Template refs recovered from output node meta (`_templateName`/`_templateBind`)
- * - Structural fingerprinting as fallback for 2+ identical mounted subgraphs
+ * **Removed in Phase 3:** template fingerprinting / `_templateName` /
+ * `_templateBind` recovery. Mounted subgraphs surface as nested `subname::*`
+ * paths in `desc.nodes`; if you need the template-instantiation form, build
+ * the spec by hand or read the meta companions directly.
  *
  * @param graph - Running graph to decompile.
  * @returns A GraphSpec representation.
  *
  * @category patterns
  */
-declare function decompileGraph(graph: Graph): GraphSpec;
+declare function decompileSpec(graph: Graph): GraphSpec;
 /** A single change in a spec diff. */
 type SpecDiffEntry = {
     type: "added" | "removed" | "changed";
@@ -311,6 +346,7 @@ type index_CatalogSourceEntry = CatalogSourceEntry;
 type index_CompileSpecOptions = CompileSpecOptions;
 type index_ConfigFieldSchema = ConfigFieldSchema;
 type index_FnFactory = FnFactory;
+type index_GraphFactory = GraphFactory;
 type index_GraphSpec = GraphSpec;
 type index_GraphSpecCatalog = GraphSpecCatalog;
 type index_GraphSpecFeedbackEdge = GraphSpecFeedbackEdge;
@@ -324,7 +360,7 @@ type index_SourceFactory = SourceFactory;
 type index_SpecDiffEntry = SpecDiffEntry;
 type index_SpecDiffResult = SpecDiffResult;
 declare const index_compileSpec: typeof compileSpec;
-declare const index_decompileGraph: typeof decompileGraph;
+declare const index_decompileSpec: typeof decompileSpec;
 declare const index_extractFnFactory: typeof extractFnFactory;
 declare const index_extractSourceFactory: typeof extractSourceFactory;
 declare const index_generateCatalogPrompt: typeof generateCatalogPrompt;
@@ -336,7 +372,7 @@ declare const index_specDiff: typeof specDiff;
 declare const index_validateSpec: typeof validateSpec;
 declare const index_validateSpecAgainstCatalog: typeof validateSpecAgainstCatalog;
 declare namespace index {
-  export { type index_CatalogFnEntry as CatalogFnEntry, type index_CatalogSourceEntry as CatalogSourceEntry, type index_CompileSpecOptions as CompileSpecOptions, type index_ConfigFieldSchema as ConfigFieldSchema, type index_FnFactory as FnFactory, type index_GraphSpec as GraphSpec, type index_GraphSpecCatalog as GraphSpecCatalog, type index_GraphSpecFeedbackEdge as GraphSpecFeedbackEdge, type index_GraphSpecNode as GraphSpecNode, type index_GraphSpecTemplate as GraphSpecTemplate, type index_GraphSpecTemplateRef as GraphSpecTemplateRef, type index_GraphSpecValidation as GraphSpecValidation, type index_LLMComposeOptions as LLMComposeOptions, type index_LLMRefineOptions as LLMRefineOptions, type index_SourceFactory as SourceFactory, type index_SpecDiffEntry as SpecDiffEntry, type index_SpecDiffResult as SpecDiffResult, index_compileSpec as compileSpec, index_decompileGraph as decompileGraph, index_extractFnFactory as extractFnFactory, index_extractSourceFactory as extractSourceFactory, index_generateCatalogPrompt as generateCatalogPrompt, index_isRichFnEntry as isRichFnEntry, index_isRichSourceEntry as isRichSourceEntry, index_llmCompose as llmCompose, index_llmRefine as llmRefine, index_specDiff as specDiff, index_validateSpec as validateSpec, index_validateSpecAgainstCatalog as validateSpecAgainstCatalog };
+  export { type index_CatalogFnEntry as CatalogFnEntry, type index_CatalogSourceEntry as CatalogSourceEntry, type index_CompileSpecOptions as CompileSpecOptions, type index_ConfigFieldSchema as ConfigFieldSchema, type index_FnFactory as FnFactory, type index_GraphFactory as GraphFactory, type index_GraphSpec as GraphSpec, type index_GraphSpecCatalog as GraphSpecCatalog, type index_GraphSpecFeedbackEdge as GraphSpecFeedbackEdge, type index_GraphSpecNode as GraphSpecNode, type index_GraphSpecTemplate as GraphSpecTemplate, type index_GraphSpecTemplateRef as GraphSpecTemplateRef, type index_GraphSpecValidation as GraphSpecValidation, type index_LLMComposeOptions as LLMComposeOptions, type index_LLMRefineOptions as LLMRefineOptions, type index_SourceFactory as SourceFactory, type index_SpecDiffEntry as SpecDiffEntry, type index_SpecDiffResult as SpecDiffResult, index_compileSpec as compileSpec, index_decompileSpec as decompileSpec, index_extractFnFactory as extractFnFactory, index_extractSourceFactory as extractSourceFactory, index_generateCatalogPrompt as generateCatalogPrompt, index_isRichFnEntry as isRichFnEntry, index_isRichSourceEntry as isRichSourceEntry, index_llmCompose as llmCompose, index_llmRefine as llmRefine, index_specDiff as specDiff, index_validateSpec as validateSpec, index_validateSpecAgainstCatalog as validateSpecAgainstCatalog };
 }
 
-export { type CatalogFnEntry as C, type FnFactory as F, type GraphSpec as G, type LLMComposeOptions as L, type SourceFactory as S, type CatalogSourceEntry as a, type ConfigFieldSchema as b, type GraphSpecCatalog as c, type GraphSpecFeedbackEdge as d, type GraphSpecNode as e, type GraphSpecTemplate as f, type GraphSpecTemplateRef as g, type GraphSpecValidation as h, index as i, type CompileSpecOptions as j, type LLMRefineOptions as k, type SpecDiffEntry as l, type SpecDiffResult as m, compileSpec as n, decompileGraph as o, extractFnFactory as p, extractSourceFactory as q, generateCatalogPrompt as r, isRichFnEntry as s, isRichSourceEntry as t, llmCompose as u, llmRefine as v, specDiff as w, validateSpec as x, validateSpecAgainstCatalog as y };
+export { type CatalogFnEntry as C, type FnFactory as F, type GraphSpec as G, type LLMComposeOptions as L, type SourceFactory as S, type CatalogSourceEntry as a, type ConfigFieldSchema as b, type GraphSpecCatalog as c, type GraphSpecFeedbackEdge as d, type GraphSpecNode as e, type GraphSpecTemplate as f, type GraphSpecTemplateRef as g, type GraphSpecValidation as h, index as i, type CompileSpecOptions as j, type GraphFactory as k, type LLMRefineOptions as l, type SpecDiffEntry as m, type SpecDiffResult as n, compileSpec as o, decompileSpec as p, extractFnFactory as q, extractSourceFactory as r, generateCatalogPrompt as s, isRichFnEntry as t, isRichSourceEntry as u, llmCompose as v, llmRefine as w, specDiff as x, validateSpec as y, validateSpecAgainstCatalog as z };

package/dist/{index-DfAo9WKr.d.ts → index-BM9szD8n.d.cts}

@@ -1,6 +1,6 @@
-import { a as Node } from './node-fSc-hCv8.js';
-import { S as StatusValue, C as CircuitState, R as RateLimiterOptions, a as CircuitBreakerOptions, b as RetryOptions, F as FallbackInput, N as NS_PER_MS, c as NS_PER_SEC } from './resilience-Bys63Cpd.js';
-import { B as BudgetConstraint } from './index-DXz9uwcs.js';
+import { N as Node } from './node-BYInONRr.cjs';
+import { S as StatusValue, C as CircuitState, R as RateLimiterOptions, a as CircuitBreakerOptions, b as RetryOptions, F as FallbackInput, N as NS_PER_MS, c as NS_PER_SEC } from './index-CwP_KAMS.cjs';
+import { B as BudgetConstraint } from './budget-gate-DiP_nK0n.cjs';
 
 /**
  * Resilience composition with correct nesting order (roadmap §9.0b).
@@ -30,8 +30,16 @@ import { B as BudgetConstraint } from './index-DXz9uwcs.js';
 
 /** Options for {@link resilientPipeline}. Every field is optional — omit to skip that layer. */
 interface ResilientPipelineOptions<T> {
-    /** Admission control — at most `maxEvents` DATA per `windowNs`. See {@link rateLimiter}. */
-    rateLimit?: RateLimiterOptions;
+    /**
+     * Admission control — at most `maxEvents` DATA per `windowNs`. See {@link rateLimiter}.
+     *
+     * `maxBuffer` is optional at the pipeline layer (defaults to `Infinity`, preserving
+     * the historical unbounded behavior). Pass an explicit positive integer to opt in to
+     * a bounded queue. Tier 5.2 will surface backpressure-policy options to callers.
+     */
+    rateLimit?: Omit<RateLimiterOptions, "maxBuffer"> & {
+        maxBuffer?: number;
+    };
     /** Cost/constraint gate. See {@link budgetGate}. */
     budget?: ReadonlyArray<BudgetConstraint>;
     /** Circuit breaker — fail-fast when the downstream resource is unhealthy. See {@link circuitBreaker}. */
@@ -62,7 +70,7 @@ interface ResilientPipelineOptions<T> {
 interface ResilientPipelineBundle<T> {
     /** The final resilient node. Subscribe to this for DATA emissions. */
     node: Node<T>;
-    /** Live status: `"pending" | "active" | "completed" | "errored"`. */
+    /** Live status: `"pending" | "running" | "completed" | "errored"`. */
     status: Node<StatusValue>;
     /** Last error payload, or `null` when not errored. */
     error: Node<unknown | null>;

package/dist/{index-CajEOoAN.d.ts → index-BUPVld1w.d.ts}

@@ -1,5 +1,5 @@
-import { G as Graph } from './graph-YQXDndFy.js';
-import { M as MeasurementAdapter } from './reactive-layout-BDdngW56.js';
+import { G as Graph } from './graph-30XSgtVX.js';
+import { M as MeasurementAdapter } from './reactive-layout-DkTXxtSy.js';
 
 /**
  * Three-pane demo shell (roadmap §7.2).

package/dist/{index-C-pFD_FV.d.ts → index-BXd6OMEy.d.ts}

@@ -1,6 +1,6 @@
-import { M as MeasurementAdapter, P as PreparedSegment, L as LineBreaksResult, C as CharPosition, a as LayoutCursor, I as Interval, b as LayoutLine, c as LayoutNextLineContext, d as LayoutNextLineResult, R as ReactiveLayoutBundle, e as ReactiveLayoutOptions, S as SegmentBreakKind, f as SegmentMeasureStats, g as analyzeAndMeasure, h as carveTextLineSlots, i as computeCharPositions, j as computeLineBreaks, l as layoutNextLine, r as reactiveLayout } from './reactive-layout-BDdngW56.js';
-import { a as Node } from './node-fSc-hCv8.js';
-import { G as Graph } from './graph-YQXDndFy.js';
+import { M as MeasurementAdapter, P as PreparedSegment, L as LineBreaksResult, C as CharPosition, a as LayoutCursor, I as Interval, b as LayoutLine, c as LayoutNextLineContext, d as LayoutNextLineResult, R as ReactiveLayoutBundle, e as ReactiveLayoutOptions, S as SegmentBreakKind, f as SegmentMeasureStats, g as analyzeAndMeasure, h as carveTextLineSlots, i as computeCharPositions, j as computeLineBreaks, l as layoutNextLine, r as reactiveLayout } from './reactive-layout-DkTXxtSy.js';
+import { N as Node } from './node-BYInONRr.js';
+import { G as Graph } from './graph-30XSgtVX.js';
 
 /**
  * MeasurementAdapter implementations (roadmap §7.1 — pluggable backends).

package/dist/index-BhUaMYm_.d.ts

@@ -0,0 +1,113 @@
+import { N as Node, a as NodeOptions } from './node-BYInONRr.js';
+import { a as GraphOptions, G as Graph } from './graph-30XSgtVX.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 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[]>>;
+
+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_feedback: typeof feedback;
+declare const index_funnel: typeof funnel;
+declare const index_scorer: typeof scorer;
+declare namespace index {
+  export { 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_feedback as feedback, index_funnel as funnel, index_scorer as scorer };
+}
+
+export { type FeedbackOptions as F, type ScoredItem as S, type FunnelOptions as a, type FunnelStage as b, type ScorerOptions as c, type StepRef as d, funnel as e, feedback as f, index as i, scorer as s };

package/dist/{index-DAKm44My.d.cts → index-BndG0cpK.d.cts}

@@ -1,6 +1,6 @@
-import { a as Node } from './node-fSc-hCv8.cjs';
-import { G as Graph, a as GraphOptions } from './graph-CaNXUc3c.cjs';
-import { R as ReactiveLogBundle } from './reactive-log-ScpWyqny.cjs';
+import { N as Node } from './node-BYInONRr.cjs';
+import { G as Graph, a as GraphOptions } from './graph-BUwMAxJI.cjs';
+import { a as ReactiveLogBundle } from './reactive-log-_zeEnB9H.cjs';
 import { AppendLogStorageTier } from './extra/storage-tiers.cjs';
 
 type TopicOptions = {