@decaf-ts/integrations 0.10.8 → 0.12.0

package/lib/types/graph/engine/planning/GraphExecutionPlan.d.mts

@@ -1,25 +0,0 @@
-/**
- * @module integrations/graph/planning/GraphExecutionPlan
- * @summary The complete execution plan for a workflow (DECAF-50 §4.9).
- * @description Contains the resolved workflow, catalogue-resolved plan nodes,
- * validated edges, topological layers, and incoming/outgoing maps. Plans are
- * produced exclusively from a {@link GraphResolvedWorkflow}.
- */
-import type { GraphResolvedWorkflow } from "../validation/GraphResolvedWorkflow.d.mts";
-import type { GraphExecutionPlanNode } from "./GraphExecutionPlanNode.d.mts";
-import type { GraphExecutionPlanEdge } from "./GraphExecutionPlanEdge.d.mts";
-import type { GraphExecutionPlanLayer } from "./GraphExecutionPlanLayer.d.mts";
-/**
- * The resolved execution plan for a single workflow.
- */
-export interface GraphExecutionPlan {
-    /** The validated, catalogue-resolved workflow this plan was built from. */
-    resolved: GraphResolvedWorkflow;
-    /** The canonical document id. */
-    workflowId: string;
-    nodes: GraphExecutionPlanNode[];
-    edges: GraphExecutionPlanEdge[];
-    layers: GraphExecutionPlanLayer[];
-    incomingByNode: Map<string, GraphExecutionPlanEdge[]>;
-    outgoingByNode: Map<string, GraphExecutionPlanEdge[]>;
-}

package/lib/types/graph/engine/planning/GraphExecutionPlanEdge.d.cts

@@ -1,26 +0,0 @@
-/**
- * @module integrations/graph/planning/GraphExecutionPlanEdge
- * @summary Plan edge type for the execution plan.
- * @description Represents a directed route between two endpoints
- * (node-to-node or node-to-workflow-boundary) produced by the §4.8 edge
- * validation stage. Data edges route values; connection edges are structural.
- */
-/**
- * An edge in the execution plan representing a route from a source port to a
- * target port.
- *
- * `sourceNodeId` or `targetNodeId` may be {@link GRAPH_WORKFLOW_BOUNDARY} when
- * the edge connects to the workflow boundary. `type` distinguishes value
- * routing (`data`) from structural (`connection`) edges.
- */
-export interface GraphExecutionPlanEdge {
-    id: string;
-    /** `data` routes values; `connection` is structural only. */
-    type: "data" | "connection";
-    sourceNodeId: string;
-    sourcePort: string;
-    targetNodeId: string;
-    targetPort: string;
-    label?: string;
-    metadata?: Record<string, unknown>;
-}

package/lib/types/graph/engine/planning/GraphExecutionPlanEdge.d.mts

@@ -1,26 +0,0 @@
-/**
- * @module integrations/graph/planning/GraphExecutionPlanEdge
- * @summary Plan edge type for the execution plan.
- * @description Represents a directed route between two endpoints
- * (node-to-node or node-to-workflow-boundary) produced by the §4.8 edge
- * validation stage. Data edges route values; connection edges are structural.
- */
-/**
- * An edge in the execution plan representing a route from a source port to a
- * target port.
- *
- * `sourceNodeId` or `targetNodeId` may be {@link GRAPH_WORKFLOW_BOUNDARY} when
- * the edge connects to the workflow boundary. `type` distinguishes value
- * routing (`data`) from structural (`connection`) edges.
- */
-export interface GraphExecutionPlanEdge {
-    id: string;
-    /** `data` routes values; `connection` is structural only. */
-    type: "data" | "connection";
-    sourceNodeId: string;
-    sourcePort: string;
-    targetNodeId: string;
-    targetPort: string;
-    label?: string;
-    metadata?: Record<string, unknown>;
-}

package/lib/types/graph/engine/planning/GraphExecutionPlanLayer.d.cts

@@ -1,13 +0,0 @@
-/**
- * @module integrations/graph/planning/GraphExecutionPlanLayer
- * @summary A layer of nodes that can execute in parallel.
- * @description Produced by the topological planner; all nodes in a layer have no dependencies on each other.
- */
-import type { GraphExecutionPlanNode } from "./GraphExecutionPlanNode.d.cts";
-/**
- * A topological layer of nodes that may execute in parallel.
- */
-export interface GraphExecutionPlanLayer {
-    index: number;
-    nodes: GraphExecutionPlanNode[];
-}

package/lib/types/graph/engine/planning/GraphExecutionPlanLayer.d.mts

@@ -1,13 +0,0 @@
-/**
- * @module integrations/graph/planning/GraphExecutionPlanLayer
- * @summary A layer of nodes that can execute in parallel.
- * @description Produced by the topological planner; all nodes in a layer have no dependencies on each other.
- */
-import type { GraphExecutionPlanNode } from "./GraphExecutionPlanNode.d.mts";
-/**
- * A topological layer of nodes that may execute in parallel.
- */
-export interface GraphExecutionPlanLayer {
-    index: number;
-    nodes: GraphExecutionPlanNode[];
-}

package/lib/types/graph/engine/planning/GraphExecutionPlanNode.d.cts

@@ -1,28 +0,0 @@
-/**
- * @module integrations/graph/planning/GraphExecutionPlanNode
- * @summary Plan node type for the execution plan (DECAF-50 §4.9).
- * @description A node fully resolved against the trusted backend catalogue:
- * the canonical instance, the effective (dynamics-expanded) manifest, and
- * the paired executor. The planner never carries raw node definitions.
- */
-import type { GraphJsonValue, GraphNodeInstance } from "@decaf-ts/ui-decorators/graph";
-import type { GraphResolvedNodeManifest } from "@decaf-ts/ui-decorators/graph";
-import type { GraphNodeExecutor } from "../execution/GraphNodeExecutor.d.cts";
-/**
- * A node in the execution plan, resolved from a
- * {@link GraphResolvedWorkflow} (DECAF-50 §4.9).
- */
-export interface GraphExecutionPlanNode {
-    id: string;
-    kind: string;
-    /** The canonical node instance from the workflow document. */
-    instance: GraphNodeInstance;
-    /** The effective (dynamics-expanded) manifest for the instance. */
-    manifest: GraphResolvedNodeManifest;
-    /** The trusted executor paired with the kind in the backend catalogue. */
-    executor: GraphNodeExecutor;
-    inputPorts: string[];
-    outputPorts: string[];
-    connectionPorts: string[];
-    metadata?: Record<string, GraphJsonValue>;
-}

package/lib/types/graph/engine/planning/GraphExecutionPlanNode.d.mts

@@ -1,28 +0,0 @@
-/**
- * @module integrations/graph/planning/GraphExecutionPlanNode
- * @summary Plan node type for the execution plan (DECAF-50 §4.9).
- * @description A node fully resolved against the trusted backend catalogue:
- * the canonical instance, the effective (dynamics-expanded) manifest, and
- * the paired executor. The planner never carries raw node definitions.
- */
-import type { GraphJsonValue, GraphNodeInstance } from "@decaf-ts/ui-decorators/graph";
-import type { GraphResolvedNodeManifest } from "@decaf-ts/ui-decorators/graph";
-import type { GraphNodeExecutor } from "../execution/GraphNodeExecutor.d.mts";
-/**
- * A node in the execution plan, resolved from a
- * {@link GraphResolvedWorkflow} (DECAF-50 §4.9).
- */
-export interface GraphExecutionPlanNode {
-    id: string;
-    kind: string;
-    /** The canonical node instance from the workflow document. */
-    instance: GraphNodeInstance;
-    /** The effective (dynamics-expanded) manifest for the instance. */
-    manifest: GraphResolvedNodeManifest;
-    /** The trusted executor paired with the kind in the backend catalogue. */
-    executor: GraphNodeExecutor;
-    inputPorts: string[];
-    outputPorts: string[];
-    connectionPorts: string[];
-    metadata?: Record<string, GraphJsonValue>;
-}

package/lib/types/graph/engine/planning/GraphExecutionPlanner.d.cts

@@ -1,48 +0,0 @@
-import type { GraphResolvedWorkflow } from "../validation/GraphResolvedWorkflow.d.cts";
-import type { GraphExecutionPlan } from "./GraphExecutionPlan.d.cts";
-/**
- * Planner that turns a {@link GraphResolvedWorkflow} into a
- * {@link GraphExecutionPlan} with topological layers.
- */
-export declare class GraphExecutionPlanner {
-    /**
-     * Plans a resolved workflow for execution.
-     *
-     * @param workflow - The catalogue-resolved workflow (output of the
-     *   nine-stage validation gate). Raw `GraphWorkflowDefinition` objects and
-     *   inline `GraphNodeDefinition` objects are rejected.
-     * @returns The execution plan with nodes, edges, layers, and maps.
-     * @throws {GraphTopologyError} when the input is not a resolved workflow.
-     * @throws {GraphCycleError} when the workflow contains an unsupported cycle.
-     */
-    plan(workflow: GraphResolvedWorkflow): GraphExecutionPlan;
-    /**
-     * Builds catalogue-resolved plan nodes from the resolved workflow.
-     * Each plan node carries the canonical instance, the effective manifest,
-     * and the trusted executor — never a raw node definition.
-     */
-    private buildPlanNodes;
-    /**
-     * Builds plan edges from the flattened resolved edges (already validated by
-     * §4.8 stage 5/6).
-     */
-    private buildPlanEdges;
-    /**
-     * Builds a map of node id -> incoming edges (boundary excluded from keys).
-     */
-    private buildIncomingMap;
-    /**
-     * Builds a map of node id -> outgoing edges (boundary targets included as
-     * edge values so workflow outputs stay routable).
-     */
-    private buildOutgoingMap;
-    /**
-     * Produces topological layers using Kahn's algorithm.
-     *
-     * Workflow boundary edges do not count as executable-node dependencies.
-     * Both data and structural (connection) edges count as dependencies
-     * (DECAF-32 acyclicity preserved; loop constructs are excepted because
-     * their bodies are separate nested documents).
-     */
-    private topologicalLayers;
-}

package/lib/types/graph/engine/planning/GraphExecutionPlanner.d.mts

@@ -1,48 +0,0 @@
-import type { GraphResolvedWorkflow } from "../validation/GraphResolvedWorkflow.d.mts";
-import type { GraphExecutionPlan } from "./GraphExecutionPlan.d.mts";
-/**
- * Planner that turns a {@link GraphResolvedWorkflow} into a
- * {@link GraphExecutionPlan} with topological layers.
- */
-export declare class GraphExecutionPlanner {
-    /**
-     * Plans a resolved workflow for execution.
-     *
-     * @param workflow - The catalogue-resolved workflow (output of the
-     *   nine-stage validation gate). Raw `GraphWorkflowDefinition` objects and
-     *   inline `GraphNodeDefinition` objects are rejected.
-     * @returns The execution plan with nodes, edges, layers, and maps.
-     * @throws {GraphTopologyError} when the input is not a resolved workflow.
-     * @throws {GraphCycleError} when the workflow contains an unsupported cycle.
-     */
-    plan(workflow: GraphResolvedWorkflow): GraphExecutionPlan;
-    /**
-     * Builds catalogue-resolved plan nodes from the resolved workflow.
-     * Each plan node carries the canonical instance, the effective manifest,
-     * and the trusted executor — never a raw node definition.
-     */
-    private buildPlanNodes;
-    /**
-     * Builds plan edges from the flattened resolved edges (already validated by
-     * §4.8 stage 5/6).
-     */
-    private buildPlanEdges;
-    /**
-     * Builds a map of node id -> incoming edges (boundary excluded from keys).
-     */
-    private buildIncomingMap;
-    /**
-     * Builds a map of node id -> outgoing edges (boundary targets included as
-     * edge values so workflow outputs stay routable).
-     */
-    private buildOutgoingMap;
-    /**
-     * Produces topological layers using Kahn's algorithm.
-     *
-     * Workflow boundary edges do not count as executable-node dependencies.
-     * Both data and structural (connection) edges count as dependencies
-     * (DECAF-32 acyclicity preserved; loop constructs are excepted because
-     * their bodies are separate nested documents).
-     */
-    private topologicalLayers;
-}

package/lib/types/graph/engine/planning/GraphTopology.d.cts

@@ -1,23 +0,0 @@
-/**
- * @module integrations/graph/planning/GraphTopology
- * @summary Utility helpers for graph topology analysis.
- * @description Provides helper functions used by the planner and pinning dependency resolver.
- */
-import type { GraphExecutionPlanEdge } from "./GraphExecutionPlanEdge.d.cts";
-/**
- * Topology utility for traversing the execution plan's edges.
- */
-export declare class GraphTopology {
-    /**
-     * Returns the set of upstream node ids reachable from `nodeId` by following
-     * incoming edges. The workflow boundary node is excluded.
-     */
-    static upstreamNodes(nodeId: string, incomingByNode: Map<string, GraphExecutionPlanEdge[]>, includeBoundary?: boolean): Set<string>;
-    /**
-     * Returns the set of downstream node ids reachable from `nodeId` by following
-     * outgoing edges. The workflow boundary node is excluded.
-     */
-    static downstreamNodes(nodeId: string, outgoingByNode: Map<string, GraphExecutionPlanEdge[]>, includeBoundary?: boolean): Set<string>;
-    /** Returns whether a node id is the workflow boundary. */
-    static isBoundary(nodeId: string): boolean;
-}

package/lib/types/graph/engine/planning/GraphTopology.d.mts

@@ -1,23 +0,0 @@
-/**
- * @module integrations/graph/planning/GraphTopology
- * @summary Utility helpers for graph topology analysis.
- * @description Provides helper functions used by the planner and pinning dependency resolver.
- */
-import type { GraphExecutionPlanEdge } from "./GraphExecutionPlanEdge.d.mts";
-/**
- * Topology utility for traversing the execution plan's edges.
- */
-export declare class GraphTopology {
-    /**
-     * Returns the set of upstream node ids reachable from `nodeId` by following
-     * incoming edges. The workflow boundary node is excluded.
-     */
-    static upstreamNodes(nodeId: string, incomingByNode: Map<string, GraphExecutionPlanEdge[]>, includeBoundary?: boolean): Set<string>;
-    /**
-     * Returns the set of downstream node ids reachable from `nodeId` by following
-     * outgoing edges. The workflow boundary node is excluded.
-     */
-    static downstreamNodes(nodeId: string, outgoingByNode: Map<string, GraphExecutionPlanEdge[]>, includeBoundary?: boolean): Set<string>;
-    /** Returns whether a node id is the workflow boundary. */
-    static isBoundary(nodeId: string): boolean;
-}

package/lib/types/graph/engine/planning/index.d.cts

@@ -1,11 +0,0 @@
-/**
- * @module integrations/graph/planning
- * @summary Graph execution planning.
- * @description Re-exports the execution plan types, relation resolver, and topological planner.
- */
-export * from "./GraphExecutionPlanNode.d.cts";
-export * from "./GraphExecutionPlanEdge.d.cts";
-export * from "./GraphExecutionPlanLayer.d.cts";
-export * from "./GraphExecutionPlan.d.cts";
-export * from "./GraphExecutionPlanner.d.cts";
-export * from "./GraphTopology.d.cts";

package/lib/types/graph/engine/planning/index.d.mts

@@ -1,11 +0,0 @@
-/**
- * @module integrations/graph/planning
- * @summary Graph execution planning.
- * @description Re-exports the execution plan types, relation resolver, and topological planner.
- */
-export * from "./GraphExecutionPlanNode.d.mts";
-export * from "./GraphExecutionPlanEdge.d.mts";
-export * from "./GraphExecutionPlanLayer.d.mts";
-export * from "./GraphExecutionPlan.d.mts";
-export * from "./GraphExecutionPlanner.d.mts";
-export * from "./GraphTopology.d.mts";

package/lib/types/graph/engine/registry/GraphNodeExecutorRegistry.d.cts

@@ -1,39 +0,0 @@
-/**
- * @module integrations/graph/registry/GraphNodeExecutorRegistry
- * @summary Compatibility facade over {@link GraphNodeCatalogue} (DECAF-50 §4.7).
- * @description Holds no map of its own: every kind→executor binding lives in
- * the catalogue's single kind→registration map. `register()` upserts the
- * executor on an existing registration or creates a placeholder-manifest entry
- * for legacy executor-only registrations; the strict manifest+executor pairing
- * required by DECAF-50 is enforced by `GraphNodeCatalogue.register()`.
- *
- * Legacy error contract preserved: this facade keeps throwing
- * {@link GraphExecutionError} where the pre-catalogue registry did, while the
- * underlying catalogue throws the normative DECAF-50 catalogue errors.
- */
-import type { GraphNodeExecutor } from "../execution/GraphNodeExecutor.d.cts";
-import { GraphNodeCatalogue } from "../catalog/GraphNodeCatalogue.d.cts";
-/**
- * Compatibility facade over {@link GraphNodeCatalogue} for legacy
- * kind→executor registration (DECAF-50 §4.7). Delegates every binding to the
- * catalogue and preserves the pre-catalogue {@link GraphExecutionError}
- * contract.
- */
-export declare class GraphNodeExecutorRegistry {
-    private readonly catalogue;
-    constructor(catalogue?: GraphNodeCatalogue);
-    /** The backing catalogue holding all kind→registration entries. */
-    get catalog(): GraphNodeCatalogue;
-    /** Registers an executor for the given node kind. */
-    register(kind: string, executor: GraphNodeExecutor): this;
-    /** Removes the registration for the given node kind. */
-    unregister(kind: string): this;
-    /** Returns whether a registration exists for the given kind. */
-    has(kind: string): boolean;
-    /**
-     * Resolves the executor for the given node kind.
-     *
-     * @throws {GraphExecutionError} when no registration exists for `kind`.
-     */
-    resolve(kind: string): GraphNodeExecutor;
-}

package/lib/types/graph/engine/registry/GraphNodeExecutorRegistry.d.mts

@@ -1,39 +0,0 @@
-/**
- * @module integrations/graph/registry/GraphNodeExecutorRegistry
- * @summary Compatibility facade over {@link GraphNodeCatalogue} (DECAF-50 §4.7).
- * @description Holds no map of its own: every kind→executor binding lives in
- * the catalogue's single kind→registration map. `register()` upserts the
- * executor on an existing registration or creates a placeholder-manifest entry
- * for legacy executor-only registrations; the strict manifest+executor pairing
- * required by DECAF-50 is enforced by `GraphNodeCatalogue.register()`.
- *
- * Legacy error contract preserved: this facade keeps throwing
- * {@link GraphExecutionError} where the pre-catalogue registry did, while the
- * underlying catalogue throws the normative DECAF-50 catalogue errors.
- */
-import type { GraphNodeExecutor } from "../execution/GraphNodeExecutor.d.mts";
-import { GraphNodeCatalogue } from "../catalog/GraphNodeCatalogue.d.mts";
-/**
- * Compatibility facade over {@link GraphNodeCatalogue} for legacy
- * kind→executor registration (DECAF-50 §4.7). Delegates every binding to the
- * catalogue and preserves the pre-catalogue {@link GraphExecutionError}
- * contract.
- */
-export declare class GraphNodeExecutorRegistry {
-    private readonly catalogue;
-    constructor(catalogue?: GraphNodeCatalogue);
-    /** The backing catalogue holding all kind→registration entries. */
-    get catalog(): GraphNodeCatalogue;
-    /** Registers an executor for the given node kind. */
-    register(kind: string, executor: GraphNodeExecutor): this;
-    /** Removes the registration for the given node kind. */
-    unregister(kind: string): this;
-    /** Returns whether a registration exists for the given kind. */
-    has(kind: string): boolean;
-    /**
-     * Resolves the executor for the given node kind.
-     *
-     * @throws {GraphExecutionError} when no registration exists for `kind`.
-     */
-    resolve(kind: string): GraphNodeExecutor;
-}

package/lib/types/graph/engine/registry/GraphNodeExecutorResolver.d.cts

@@ -1,21 +0,0 @@
-/**
- * @module integrations/graph/registry/GraphNodeExecutorResolver
- * @summary Utility for resolving executors from a registry with fallback.
- * @description Provides a helper that attempts to resolve an executor by kind, falling back to a default executor when the kind is not registered.
- */
-import type { GraphNodeExecutor } from "../execution/GraphNodeExecutor.d.cts";
-import type { GraphNodeExecutorRegistry } from "./GraphNodeExecutorRegistry.d.cts";
-/**
- * Resolver that wraps a {@link GraphNodeExecutorRegistry} and optionally
- * falls back to a default executor when a kind is not found.
- */
-export declare class GraphNodeExecutorResolver {
-    private readonly registry;
-    private readonly defaultExecutor?;
-    constructor(registry: GraphNodeExecutorRegistry, defaultExecutor?: GraphNodeExecutor);
-    /**
-     * Resolves the executor for `kind`, falling back to the default executor
-     * when provided.
-     */
-    resolve(kind: string): GraphNodeExecutor;
-}

package/lib/types/graph/engine/registry/GraphNodeExecutorResolver.d.mts

@@ -1,21 +0,0 @@
-/**
- * @module integrations/graph/registry/GraphNodeExecutorResolver
- * @summary Utility for resolving executors from a registry with fallback.
- * @description Provides a helper that attempts to resolve an executor by kind, falling back to a default executor when the kind is not registered.
- */
-import type { GraphNodeExecutor } from "../execution/GraphNodeExecutor.d.mts";
-import type { GraphNodeExecutorRegistry } from "./GraphNodeExecutorRegistry.d.mts";
-/**
- * Resolver that wraps a {@link GraphNodeExecutorRegistry} and optionally
- * falls back to a default executor when a kind is not found.
- */
-export declare class GraphNodeExecutorResolver {
-    private readonly registry;
-    private readonly defaultExecutor?;
-    constructor(registry: GraphNodeExecutorRegistry, defaultExecutor?: GraphNodeExecutor);
-    /**
-     * Resolves the executor for `kind`, falling back to the default executor
-     * when provided.
-     */
-    resolve(kind: string): GraphNodeExecutor;
-}

package/lib/types/graph/engine/registry/index.d.cts

@@ -1,7 +0,0 @@
-/**
- * @module integrations/graph/registry
- * @summary Graph node executor registry and resolver.
- * @description Re-exports the executor registry and resolver.
- */
-export * from "./GraphNodeExecutorRegistry.d.cts";
-export * from "./GraphNodeExecutorResolver.d.cts";

package/lib/types/graph/engine/registry/index.d.mts

@@ -1,7 +0,0 @@
-/**
- * @module integrations/graph/registry
- * @summary Graph node executor registry and resolver.
- * @description Re-exports the executor registry and resolver.
- */
-export * from "./GraphNodeExecutorRegistry.d.mts";
-export * from "./GraphNodeExecutorResolver.d.mts";

package/lib/types/graph/engine/runs/GraphRunEventPublisher.d.cts

@@ -1,26 +0,0 @@
-import { type GraphRunEventEnvelope, type GraphRunEventEnvelopeInput, type GraphRunLimits } from "@decaf-ts/ui-decorators/graph";
-import { type GraphRunEventStore } from "./types.d.cts";
-/**
- * Sequences and persists run events for the SSE run stream (DECAF-50 §4.16):
- * assigns a monotonically increasing `sequence` per run, stamps ISO
- * timestamps, truncates oversized/non-serializable payloads to the
- * configured limits, and chains appends per run so store writes preserve
- * publish order.
- */
-export declare class GraphRunEventPublisher {
-    private readonly store;
-    private readonly limits;
-    private readonly sequences;
-    private readonly chains;
-    constructor(store: GraphRunEventStore, limits?: GraphRunLimits);
-    /**
-     * Assigns the next sequence number for the run, stamps and limits the
-     * payload, and appends the envelope to the store in publish order.
-     */
-    publish(event: GraphRunEventEnvelopeInput): Promise<GraphRunEventEnvelope>;
-    /** Highest sequence number issued for the run (0 when none). */
-    lastSequence(runId: string): number;
-    /** Drops sequencing state for a finished run. */
-    release(runId: string): void;
-    private limitPayload;
-}

package/lib/types/graph/engine/runs/GraphRunEventPublisher.d.mts

@@ -1,26 +0,0 @@
-import { type GraphRunEventEnvelope, type GraphRunEventEnvelopeInput, type GraphRunLimits } from "@decaf-ts/ui-decorators/graph";
-import { type GraphRunEventStore } from "./types.d.mts";
-/**
- * Sequences and persists run events for the SSE run stream (DECAF-50 §4.16):
- * assigns a monotonically increasing `sequence` per run, stamps ISO
- * timestamps, truncates oversized/non-serializable payloads to the
- * configured limits, and chains appends per run so store writes preserve
- * publish order.
- */
-export declare class GraphRunEventPublisher {
-    private readonly store;
-    private readonly limits;
-    private readonly sequences;
-    private readonly chains;
-    constructor(store: GraphRunEventStore, limits?: GraphRunLimits);
-    /**
-     * Assigns the next sequence number for the run, stamps and limits the
-     * payload, and appends the envelope to the store in publish order.
-     */
-    publish(event: GraphRunEventEnvelopeInput): Promise<GraphRunEventEnvelope>;
-    /** Highest sequence number issued for the run (0 when none). */
-    lastSequence(runId: string): number;
-    /** Drops sequencing state for a finished run. */
-    release(runId: string): void;
-    private limitPayload;
-}

package/lib/types/graph/engine/runs/GraphRunExecutor.d.cts

@@ -1,75 +0,0 @@
-/**
- * @module integrations/graph/engine/runs/GraphRunExecutor
- * @summary Asynchronous graph run execution (DECAF-50 §4.16).
- * @description Schedules runs against the {@link GraphExecutionEngine},
- * mirrors engine events into the run's sequenced SSE stream, enforces run
- * timeouts via per-run `AbortController`s, and finalizes the run's terminal
- * state in the run store. Exactly one execution per `runId` — repeated
- * schedules await the same completion promise.
- */
-import type { Context, MaybeContextualArg } from "@decaf-ts/core";
-import { type GraphWorkflowDocument } from "@decaf-ts/ui-decorators/graph";
-import { GraphExecutionEngine } from "../execution/GraphExecutionEngine.d.cts";
-import type { GraphExecutionResult, GraphExecutionValues } from "../types.d.cts";
-import { GraphRunEventPublisher } from "./GraphRunEventPublisher.d.cts";
-import { type GraphRunLimits } from "@decaf-ts/ui-decorators/graph";
-import { type GraphRun, type GraphRunStore } from "./types.d.cts";
-/** Why a run was aborted: explicit user cancellation or run timeout. */
-export type GraphRunAbortReason = "user" | "timeout";
-/** Lifecycle hooks observed by {@link GraphRunExecutor} when a run completes. */
-export interface GraphRunExecutionHooks {
-    /** Called once a run reaches a terminal state, with its result when successful. */
-    onRunCompleted?: (run: GraphRun, result?: GraphExecutionResult) => Promise<void>;
-}
-/**
- * Resolves the canonical document (and its fingerprint) a run executes,
- * accepting an optional Decaf {@link Context} as leading argument.
- */
-export type GraphRunDocumentProvider = (...args: MaybeContextualArg<Context>) => Promise<{
-    document: GraphWorkflowDocument;
-    fingerprint: string;
-}>;
-/**
- * Executes graph runs asynchronously (DECAF-50 §4.16): schedules a run
- * against the {@link GraphExecutionEngine}, mirrors engine events into the
- * run's sequenced SSE stream, enforces run timeouts via per-run
- * `AbortController`s, and finalizes the run's terminal state in the run
- * store. Exactly one execution per `runId` — repeated schedules await the
- * same completion promise.
- */
-export declare class GraphRunExecutor {
-    private readonly engine;
-    private readonly runStore;
-    private readonly publisher;
-    private readonly limits;
-    private readonly hooks;
-    private readonly controllers;
-    private readonly completions;
-    private readonly timeouts;
-    constructor(engine: GraphExecutionEngine, runStore: GraphRunStore, publisher: GraphRunEventPublisher, hooks?: GraphRunExecutionHooks, limits?: GraphRunLimits);
-    /** Returns (creating if needed) the run's `AbortController`. */
-    begin(runId: string): AbortController;
-    /** Aborts the run, if it is still in flight. Returns whether an abort was issued. */
-    abort(runId: string, reason: GraphRunAbortReason): boolean;
-    /** Whether the run's abort signal has fired. */
-    isAborted(runId: string): boolean;
-    /** The run's abort reason, when aborted. */
-    abortReason(runId: string): GraphRunAbortReason | undefined;
-    /** The run's in-flight completion promise, when one is scheduled. */
-    waitFor(runId: string): Promise<GraphRun> | undefined;
-    /**
-     * Schedules the run for execution and returns its completion promise
-     * (deduplicated per `runId`). Engine events are mirrored to the run's SSE
-     * stream; failures still emit a terminal event and finalize the run as
-     * `failed`.
-     */
-    schedule(run: GraphRun, documentProvider: GraphRunDocumentProvider, inputs: GraphExecutionValues, ...args: MaybeContextualArg<Context>): Promise<GraphRun>;
-    /** Releases all per-run state (controller, completion, timeout, publisher sequencing). */
-    release(runId: string): void;
-    private armTimeout;
-    private runExecution;
-    private emitTerminal;
-    private finalize;
-    private persist;
-    private envelopeOf;
-}