@spendgraph/graph 0.5.0 → 0.7.0

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 spendgraph
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -2,153 +2,44 @@
 
 Wire nodes into a graph, run it, and get back a rollout with every step.
 
-```sh
+```bash
 npm install @spendgraph/graph
 ```
 
-Four things are exported. Everything else hangs off what they return.
-
-```ts
-import { graph, node, edge, end } from "@spendgraph/graph";
-```
-
-## A node
-
-One unit of work. `input` is what makes it reusable: the node says what it
-needs, the graph says where it comes from. Without that, every node has to know
-about the whole run.
-
 ```ts
-const classify = node({
-  name: "classify",
-  args: [
-    { name: "text", type: "string", required: true },
-    { name: "top_k", type: "number", required: false },
-  ] as const,
-  input: (ctx) => ({ text: ctx.values.question }),
-  run: ({ text, top_k }) => model.classify(text, top_k ?? 3),
-});
-```
-
-**Write `as const` and `run` types itself** from the args — `text` a string,
-`top_k` a number, optionals optional. Rename an argument and the handler stops
-compiling, rather than being handed `undefined` halfway through a graph, which
-is the most expensive place to find a typo.
-
-Args are validated before `run` does any work. A node name must be letters,
-digits and underscores starting with a letter, and that is checked at import
-rather than on the first run.
-
-## Wiring
+import { edge, end, graph, node } from "@spendgraph/graph";
 
-```ts
 const flow = graph({
-  entry: "classify",
-  nodes: [classify, lookup, answer],
-  edges: [
-    edge("classify", "lookup", (ctx) => ctx.outputs.classify === "billing"),
-    edge("classify", "answer"),
-    edge("lookup", "answer"),
-    end("answer"),
-  ],
+  entry: "parse",
+  nodes: [parse, divide, format],
+  edges: [edge("parse", "divide"), edge("divide", "format"), end("format")],
 });
 
-const result = await flow.execute({ question: "Why was I charged twice?" });
-```
-
-An edge says what runs next; a node's `input` says on what.
-
-**Branching is several edges, not one clever edge.** `edge(from, to, when)`
-takes a predicate, and the edges leaving a node are tried in declaration order
-with the first match winning — so an unconditional edge is the default branch
-and belongs last. `end(from)` is `edge(from, null)` said out loud.
-
-Compilation checks the wiring — an edge to a node that does not exist, an entry
-that is not a node, two nodes with the same name, a node nothing reaches —
-before anything runs. Those are the one place this package throws.
-
-## When a node fails
-
-A run never throws. A node that throws, or is handed an argument that does not
-validate, halts the run and comes back as a result:
-
-```ts
-result.status;  // "failed"
-result.error;   // '"lookup" failed: contract MSA 2.4 not found'
-result.steps;   // the steps that did run, with the failed one last
-```
-
-Continuing would leave every later node reading an output that was never
-written. Stopping with the steps intact is what lets a failed run say which
-three nodes ran and where it stopped, which a thrown exception cannot.
-
-`maxSteps` bounds the run and defaults to 25. A backwards edge is a feature and
-also how a graph hangs, and nothing tells the two apart statically, so the guard
-is a count and a clear failure rather than a hung process.
-
-## Watching it run
-
-`stream` is the same run, narrated — a node's start and end, whatever its nodes
-emit while running, and the finished result last.
-
-```ts
-const running = flow.stream({ question });
-
-for await (const event of running) {
-  if (event.type === "token") process.stdout.write(event.text);
-}
-
-const result = await running.result;
-```
-
-A node writes into the stream through the `emit` it is handed, so a node that
-wraps a streaming model call can forward deltas without the graph knowing what a
-token is. The run begins on the call rather than on the first read, so
-`result` is there for a caller who wants the rollout and not the commentary.
-
-## What comes back
-
-```ts
-result.status;    // "completed" | "failed"
-result.output;    // the last node's return, stringified; "" on a failure
-result.steps;     // every node that ran, in order
-result.outputs;   // each node's return, by name
-result.latencyMs;
-result.inputTokens;   // summed across every step, nested ones included
-result.outputTokens;
+const result = await flow.execute({ expression: "12 / 4" });
 ```
 
-A graph run is a rollout with several steps, so `GraphResult` hands straight to
-`@spendgraph/prompt`'s `report` and `call` without being translated first:
-
-```ts
-await prompt.call(values, () => flow.execute(values));
-```
+## What you get
 
-## Context
+- **A run comes back as a rollout** — every step, in order, ready to report.
+- **Compilation refuses what would fail at run time**: an unreachable node, an
+  edge to nothing, a graph with no way out.
+- **Handlers typed from their args**, the same inference `tools` uses.
+- **A node can stop to ask a person**, and the graph reports the question rather
+  than walking past it.
+- **A failed node can route somewhere** — `onFailure` names the node that runs
+  instead of the run ending, for a workflow whose earlier steps have to be undone.
 
-`outputs` is the only channel between nodes. A shared mutable bag would let node
-four depend on a key node two happens to set — a dependency the graph does not
-declare and compilation cannot check.
+## Docs
 
-```ts
-ctx.values;   // what execute() was called with
-ctx.outputs;  // what each finished node returned, by name
-ctx.steps;    // the steps so far; a copy, so writing to it does nothing
-```
-
-## Inspecting one
-
-A compiled graph answers questions about itself, which is what the workflows in
-`@spendgraph/harness` build on.
-
-```ts
-flow.entry;               // where a run starts
-flow.maxSteps;
-flow.nodes();             // every node, in declaration order
-flow.edgesFrom("classify"); // the edges leaving it, in the order they are tried
-```
+| | |
+| --- | --- |
+| [Overview](https://spendgraph.locusgraph.com/docs/graph/overview) | Four exports, and the whole thing in one example |
+| [Nodes](https://spendgraph.locusgraph.com/docs/graph/nodes) | One unit of work, typed from its args |
+| [Wiring](https://spendgraph.locusgraph.com/docs/graph/wiring) | Edges, branching, and what compilation refuses |
+| [Running a graph](https://spendgraph.locusgraph.com/docs/graph/running) | Failure, the step ceiling, what comes back |
+| [Streaming](https://spendgraph.locusgraph.com/docs/graph/streaming) | The same run, narrated |
+| [Pausing](https://spendgraph.locusgraph.com/docs/graph/pausing) | Stopping to ask a person, and picking it back up |
 
 ## License
 
-MIT
+Apache-2.0

package/dist/compile/ceiling.d.ts

@@ -0,0 +1,3 @@
+export declare const DEFAULT_MAX_STEPS = 25;
+/** How many nodes a run may visit, refusing NaN and Infinity since a run would never stop at either. */
+export declare function ceilingFor(maxSteps: number | undefined): number;

package/dist/compile/ceiling.js

@@ -0,0 +1 @@
+import{notACeiling as n}from"./errors.js";const r=25;function t(i){if(i===void 0)return r;if(!Number.isFinite(i))throw n(i,r);return Math.max(1,Math.floor(i))}export{r as DEFAULT_MAX_STEPS,t as ceilingFor};

package/dist/compile/compile.d.ts

@@ -1,5 +1,5 @@
-import { type GraphStream } from "../execute/index.js";
-import type { Edge, GraphResult, GraphSpec, Node } from "../types/index.js";
+import { type GraphStream } from "../stream/index.js";
+import type { Edge, GraphResult, GraphRunOptions, GraphSpec, Node } from "../types/index.js";
 export interface GraphOptions {
     /** Injectable clock, so tests do not measure real time. */
     now?: () => number;
@@ -12,18 +12,9 @@ export declare function graph(spec: GraphSpec, opts?: GraphOptions): {
     nodes: () => Node<never>[];
     /** Edges leaving a node, in the order they will be tried. */
     edgesFrom: (name: string) => Edge[];
-    /**
-     * Runs it once. Never throws — the result carries every step taken, so a
-     * run that stopped at node three still says which three and why.
-     */
-    execute: (values?: Record<string, unknown>) => Promise<GraphResult>;
-    /**
-     * The same run, narrated. Yields a node's start and end, whatever its nodes
-     * emit while running, and the finished result last.
-     *
-     * The run begins on the call, not on the first read, so `result` is there
-     * for the caller who wants the rollout and not the commentary.
-     */
-    stream: (values?: Record<string, unknown>) => GraphStream;
+    /** Runs it once. Never throws — the result carries every step taken. */
+    execute: (values?: Record<string, unknown>, runOpts?: GraphRunOptions) => Promise<GraphResult>;
+    /** The same run, narrated as it goes; `result` is there whether or not anyone reads. */
+    stream: (values?: Record<string, unknown>, runOpts?: GraphRunOptions) => GraphStream;
 };
 export type Graph = ReturnType<typeof graph>;

package/dist/compile/compile.js

@@ -1,17 +1 @@
-import { executeGraph, streamGraph } from "../execute/index.js";
-import { assertAllReachable, indexEdges, indexNodes } from "./validate.js";
-export function graph(spec, opts = {}) {
-    const now = opts.now ?? (() => Date.now());
-    const maxSteps = Math.max(1, spec.maxSteps ?? 25);
-    const byName = indexNodes(spec);
-    const edgesFrom = indexEdges(spec.edges ?? [], byName);
-    assertAllReachable(spec.entry, byName, edgesFrom);
-    return {
-        entry: spec.entry,
-        maxSteps,
-        nodes: () => [...byName.values()],
-        edgesFrom: (name) => [...(edgesFrom.get(name) ?? [])],
-        execute: (values = {}) => executeGraph(byName, edgesFrom, spec.entry, maxSteps, values, now),
-        stream: (values = {}) => streamGraph(byName, edgesFrom, spec.entry, maxSteps, values, now),
-    };
-}
+import{executeGraph as i}from"../execute/index.js";import{streamGraph as l}from"../stream/index.js";import{ceilingFor as s}from"./ceiling.js";import{assertEveryBranchIsCovered as u}from"./covered.js";import{indexEdges as d}from"./edges.js";import{unknownFailureNode as F}from"./errors.js";import{indexNodes as f}from"./nodes.js";import{assertAllReachable as x}from"./reachable.js";function E(r,m={}){const e=f(r),t=d(r.edges??[],e);if(r.onFailure&&!e.has(r.onFailure))throw F(r.onFailure,[...e.keys()]);x(r.entry,e,t,r.onFailure),u(t);const n={entry:r.entry,maxSteps:s(r.maxSteps),nodes:e,edgesFrom:t,...r.onFailure?{onFailure:r.onFailure}:{},now:m.now??(()=>Date.now())};return{entry:n.entry,maxSteps:n.maxSteps,nodes:()=>[...e.values()],edgesFrom:o=>[...t.get(o)??[]],execute:(o={},a={})=>i(n,o,a),stream:(o={},a={})=>l(n,o,a)}}export{E as graph};

package/dist/compile/covered.d.ts

@@ -0,0 +1,3 @@
+import type { EdgesFrom } from "./edges.js";
+/** Refuses a node whose edges are all conditional: a run where none match would stop and report success. */
+export declare function assertEveryBranchIsCovered(edgesFrom: EdgesFrom): void;

package/dist/compile/covered.js

@@ -0,0 +1 @@
+import{onlyConditionalEdges as o}from"./errors.js";function f(r){const n=[...r.entries()].filter(([,e])=>e.length>0&&e.every(t=>t.when)).map(([e])=>e);if(n.length>0)throw o(n)}export{f as assertEveryBranchIsCovered};

package/dist/compile/edges.d.ts

@@ -0,0 +1,5 @@
+import type { Edge } from "../types/index.js";
+import { type NodesByName } from "./nodes.js";
+export type EdgesFrom = Map<string, Edge[]>;
+/** Edges grouped by the node they leave, in the order they will be tried. */
+export declare function indexEdges(edges: Edge[], nodes: NodesByName): EdgesFrom;

package/dist/compile/edges.js

@@ -0,0 +1 @@
+import{edgeAfterDefault as i,edgeFromUnknown as a,edgeToUnknown as g}from"./errors.js";import{namesOf as m}from"./nodes.js";function h(s,e){const t=new Map,f=new Map;for(const o of s){if(!e.has(o.from))throw a(o.from,m(e));if(o.to!==null&&!e.has(o.to))throw g(o.from,o.to,m(e));const r=f.get(o.from);if(r)throw i(o.from,r.to,o.to);o.when||f.set(o.from,o);const n=t.get(o.from);n?n.push(o):t.set(o.from,[o])}return t}export{h as indexEdges};

package/dist/compile/errors.d.ts

@@ -0,0 +1,14 @@
+/** A graph refused at compile time: something about its shape cannot run as written. */
+export declare class GraphSpecError extends Error {
+    constructor(message: string);
+}
+export declare const noNodes: () => GraphSpecError;
+export declare const duplicateNode: (name: string) => GraphSpecError;
+export declare const unknownEntry: (entry: string, known: string[]) => GraphSpecError;
+export declare const edgeFromUnknown: (from: string, known: string[]) => GraphSpecError;
+export declare const edgeToUnknown: (from: string, to: string, known: string[]) => GraphSpecError;
+export declare const edgeAfterDefault: (from: string, defaultTo: string | null, to: string | null) => GraphSpecError;
+export declare const notACeiling: (maxSteps: number, fallback: number) => GraphSpecError;
+export declare const onlyConditionalEdges: (names: string[]) => GraphSpecError;
+export declare const unreachable: (orphans: string[], entry: string) => GraphSpecError;
+export declare const unknownFailureNode: (name: string, known: string[]) => GraphSpecError;

package/dist/compile/errors.js

@@ -0,0 +1 @@
+class o extends Error{constructor(n){super(n),this.name="GraphSpecError"}}const r=e=>e.map(n=>`"${n}"`).join(", "),a=()=>new o("A graph needs at least one node."),s=e=>new o(`Two nodes are called "${e}".`),i=(e,n)=>new o(`The entry node "${e}" is not in this graph. Known: ${n.join(", ")}.`),d=(e,n)=>new o(`An edge starts at "${e}", which is not a node in this graph. Known: ${n.join(", ")}.`),h=(e,n,t)=>new o(`An edge from "${e}" points at "${n}", which is not a node in this graph. Known: ${t.join(", ")}.`),c=(e,n,t)=>new o(`The edge from "${e}" to "${n??"the end"}" has no condition, so the edge to "${t??"the end"}" declared after it can never be taken. Put the unconditional edge last.`),p=(e,n)=>new o(`maxSteps is ${e}, which is not a ceiling \u2014 a run would never stop at it. Give it a finite number, or leave it out for the default of ${n}.`),w=e=>new o(`${r(e)} ${e.length===1?"has":"have"} only conditional edges, so a run where none of them match stops there and reports success. Add an unconditional edge as the default, or end("${e[0]}") to stop there on purpose.`),l=(e,n)=>new o(`Nothing reaches ${r(e)} from "${n}". Add an edge, or take the node out.`),u=(e,n)=>new o(`onFailure names "${e}", which is not a node in this graph. Known: ${n.join(", ")}.`);export{o as GraphSpecError,s as duplicateNode,c as edgeAfterDefault,d as edgeFromUnknown,h as edgeToUnknown,a as noNodes,p as notACeiling,w as onlyConditionalEdges,i as unknownEntry,u as unknownFailureNode,l as unreachable};

package/dist/compile/index.d.ts

@@ -1 +1,3 @@
+export { ceilingFor, DEFAULT_MAX_STEPS } from "./ceiling.js";
 export { type Graph, type GraphOptions, graph } from "./compile.js";
+export { GraphSpecError } from "./errors.js";

package/dist/compile/index.js

@@ -1 +1 @@
-export { graph } from "./compile.js";
+import{ceilingFor as p,DEFAULT_MAX_STEPS as e}from"./ceiling.js";import{graph as m}from"./compile.js";import{GraphSpecError as x}from"./errors.js";export{e as DEFAULT_MAX_STEPS,x as GraphSpecError,p as ceilingFor,m as graph};

package/dist/compile/nodes.d.ts

@@ -0,0 +1,4 @@
+import type { GraphSpec, Node } from "../types/index.js";
+export type NodesByName = Map<string, Node<never>>;
+export declare const namesOf: (nodes: NodesByName) => string[];
+export declare function indexNodes(spec: GraphSpec): NodesByName;

package/dist/compile/nodes.js

@@ -0,0 +1 @@
+import{duplicateNode as t,noNodes as r,unknownEntry as s}from"./errors.js";const d=n=>[...n.keys()];function f(n){if(n.nodes.length===0)throw r();const o=new Map;for(const e of n.nodes){if(o.has(e.name))throw t(e.name);o.set(e.name,e)}if(!o.has(n.entry))throw s(n.entry,d(o));return o}export{f as indexNodes,d as namesOf};

package/dist/compile/reachable.d.ts

@@ -0,0 +1,9 @@
+import type { EdgesFrom } from "./edges.js";
+import { type NodesByName } from "./nodes.js";
+/**
+ * Refuses a node nothing reaches from the entry, since the usual cause is a typo in an edge.
+ *
+ * A failure node is a second root: nothing points an edge at it, and the walk
+ * still reaches it from anywhere that falls over.
+ */
+export declare function assertAllReachable(entry: string, nodes: NodesByName, edgesFrom: EdgesFrom, onFailure?: string): void;

package/dist/compile/reachable.js

@@ -0,0 +1 @@
+import{unreachable as l}from"./errors.js";import{namesOf as i}from"./nodes.js";function d(e,h,c,a){const f=a?[e,a]:[e],r=new Set(f),s=[...f];for(let o=0;o<s.length;o++)for(const t of c.get(s[o])??[])t.to&&!r.has(t.to)&&(r.add(t.to),s.push(t.to));const n=i(h).filter(o=>!r.has(o));if(n.length)throw l(n,e)}export{d as assertAllReachable};

package/dist/execute/context.d.ts

@@ -0,0 +1,4 @@
+import type { GraphContext } from "../types/index.js";
+import type { Run } from "./run.js";
+/** What a node sees: the run so far, with a copy of the steps and an emit tagged with its name. */
+export declare function contextFor(run: Run, node: string): GraphContext;

package/dist/execute/context.js

@@ -0,0 +1 @@
+function a(t,o){return{values:t.values,outputs:t.outputs,from:t.cameFrom,failure:t.failure,steps:[...t.steps],emit:e=>t.narrate({type:"token",node:o,text:e}),note:e=>t.narrate({type:"note",node:o,data:e})}}export{a as contextFor};

package/dist/execute/errors.d.ts

@@ -0,0 +1,6 @@
+export declare const nowhereToStart: (start: string, known: string[]) => string;
+export declare const hitTheCeiling: (maxSteps: number, at: string) => string;
+export declare const inputThrew: (node: string, why: string) => string;
+export declare const givenBadArgs: (node: string, why: string) => string;
+export declare const nodeFailed: (node: string, why: string) => string;
+export declare const choosingThrew: (node: string, why: string) => string;

package/dist/execute/errors.js

@@ -0,0 +1 @@
+const n=(e,t)=>`No node is called "${e}", so there is nowhere to start. \`entry\` names where a resumed run picks up. Known: ${t.join(", ")}.`,o=(e,t)=>`Ran ${e} nodes without reaching an end, stopping at "${t}". Raising the ceiling is the last thing to try: a cycle that never exits is what it is here to stop. Otherwise a conditional edge never turns false, or the graph is genuinely longer than ${e} nodes.`,i=(e,t)=>`Building the input for "${e}" threw: ${t}`,r=(e,t)=>`"${e}" was given ${t}`,s=(e,t)=>`"${e}" failed: ${t}`,h=(e,t)=>`Choosing what runs after "${e}" threw: ${t}`;export{h as choosingThrew,r as givenBadArgs,o as hitTheCeiling,i as inputThrew,s as nodeFailed,n as nowhereToStart};

package/dist/execute/index.d.ts

@@ -1,4 +1,4 @@
-export { executeGraph } from "./execute.js";
 export type { NodeOutcome } from "./outcome.js";
-export type { GraphStream } from "./stream.js";
-export { streamGraph } from "./stream.js";
+export { resumingAt } from "./resume.js";
+export type { Compiled, Narrator } from "./run.js";
+export { executeGraph } from "./walk.js";

package/dist/execute/index.js

@@ -1,2 +1 @@
-export { executeGraph } from "./execute.js";
-export { streamGraph } from "./stream.js";
+import{resumingAt as o}from"./resume.js";import{executeGraph as m}from"./walk.js";export{m as executeGraph,o as resumingAt};

package/dist/execute/outcome.d.ts

@@ -1,13 +1,4 @@
 import type { RolloutStep } from "@spendgraph/sdk";
-/**
- * What a node returned, when it returned the shape a model call produces.
- *
- * Recognised structurally rather than declared: a node may return anything, and
- * a plain object is the common case. But a node that called a model, ran a
- * prompt or nested another workflow returns tokens and sometimes its own steps,
- * and both used to be flattened into the output string and lost — which made a
- * graph run report as costing nothing.
- */
 export interface NodeOutcome {
     output?: string;
     model?: string;
@@ -17,30 +8,14 @@ export interface NodeOutcome {
     outputTokens?: number;
     cacheReadTokens?: number;
     cacheWriteTokens?: number;
-    /** A nested run's own steps, spliced in rather than stringified away. */
+    citationTokens?: number;
+    reasoningTokens?: number;
     steps?: RolloutStep[];
 }
-/** The text a step should carry: an outcome's own output, or the whole value. */
 export declare function outputOf(value: unknown): string;
-/**
- * The token counts a node reported, or nothing when it reported none.
- *
- * A node that also returns nested steps reports none here: its own totals are
- * the sum of those steps, and counting both makes a graph inside a graph cost
- * exactly twice what it did.
- */
-export declare function tokensOf(value: unknown): Pick<RolloutStep, "inputTokens" | "outputTokens"> & {
+export declare function tokensOf(value: unknown): Pick<RolloutStep, "inputTokens" | "outputTokens" | "cacheReadTokens" | "cacheWriteTokens" | "citationTokens" | "reasoningTokens"> & {
     model?: string;
 };
-/**
- * A nested run's steps, renumbered to sit in this run's sequence.
- *
- * Prefixed with the node that produced them, so a step from a refine loop
- * inside a router still says which branch it came from.
- */
+/** A nested run's steps, renumbered into this run and named for the node they came from. */
 export declare function nestedSteps(value: unknown, from: number, source: string): RolloutStep[];
-/** What every step in a run adds up to. */
-export declare function totalTokens(steps: RolloutStep[]): {
-    inputTokens: number;
-    outputTokens: number;
-};
+export { totalTokens } from "@spendgraph/sdk";