@decaf-ts/integrations 0.10.5 → 0.11.0

package/lib/types/graph/engine/loops/GraphConditionEvaluator.d.mts

@@ -1,40 +0,0 @@
-/**
- * @module integrations/graph/loops/GraphConditionEvaluator
- * @summary Evaluator for built-in loop condition types and the `ConditionExpression` DSL.
- * @description Supports safe, built-in condition types only. Does NOT evaluate arbitrary JavaScript expressions.
- * When the condition object carries an `op` field (ALFRED-5 §8 / DECAF-32 §22.3), dispatches to the
- * {@link ConditionExpressionEvaluator} instead of the built-in `type`-based switch.
- */
-import type { GraphConditionDefinition } from "../types.d.mts";
-import type { ConditionExpression } from "@decaf-ts/ui-decorators/graph";
-/**
- * Evaluates loop conditions using built-in comparison types or the
- * `ConditionExpression` DSL.
- */
-export declare class GraphConditionEvaluator {
-    private readonly expressionEvaluator;
-    /**
-     * Evaluates a condition against the given state.
-     *
-     * When the condition object carries an `op` field, it is treated as a
-     * `ConditionExpression` (§22.3) and dispatched to the
-     * {@link ConditionExpressionEvaluator}. Otherwise the built-in `type`-based
-     * switch is used.
-     *
-     * @param condition - The condition definition.
-     * @param state - The current loop state.
-     * @returns `true` when the condition passes.
-     */
-    evaluate(condition: GraphConditionDefinition | ConditionExpression, state: unknown): boolean;
-    /**
-     * Resolves a value that may be a dotted path into the state object.
-     */
-    private resolveValue;
-    /**
-     * Detects whether a condition object is a `ConditionExpression` (§22.3) by
-     * checking for the presence of an `op` field. When true, the object is
-     * treated as a `ConditionExpression` and dispatched to the
-     * {@link ConditionExpressionEvaluator}.
-     */
-    private isConditionExpression;
-}

package/lib/types/graph/engine/loops/GraphLoopExecutionContext.d.cts

@@ -1,15 +0,0 @@
-/**
- * @module integrations/graph/loops/GraphLoopExecutionContext
- * @summary Context for loop node execution.
- * @description Carries loop-specific metadata and iteration state during loop execution.
- */
-import type { GraphLoopMetadata } from "../types.d.cts";
-/**
- * Context for a single loop execution, carrying the loop metadata and
- * current iteration index.
- */
-export declare class GraphLoopExecutionContext {
-    readonly iteration: number;
-    readonly metadata: GraphLoopMetadata;
-    constructor(iteration: number, metadata: GraphLoopMetadata);
-}

package/lib/types/graph/engine/loops/GraphLoopExecutionContext.d.mts

@@ -1,15 +0,0 @@
-/**
- * @module integrations/graph/loops/GraphLoopExecutionContext
- * @summary Context for loop node execution.
- * @description Carries loop-specific metadata and iteration state during loop execution.
- */
-import type { GraphLoopMetadata } from "../types.d.mts";
-/**
- * Context for a single loop execution, carrying the loop metadata and
- * current iteration index.
- */
-export declare class GraphLoopExecutionContext {
-    readonly iteration: number;
-    readonly metadata: GraphLoopMetadata;
-    constructor(iteration: number, metadata: GraphLoopMetadata);
-}

package/lib/types/graph/engine/loops/UntilGraphNodeExecutor.d.cts

@@ -1,22 +0,0 @@
-/**
- * @module integrations/graph/loops/UntilGraphNodeExecutor
- * @summary Until loop node executor.
- * @description Executes a body workflow at least once and repeats until a condition is true.
- */
-import type { GraphNodeExecutor } from "../execution/GraphNodeExecutor.d.cts";
-import type { GraphExecutionContext } from "../execution/GraphExecutionContext.d.cts";
-import type { GraphExecutionEngine } from "../execution/GraphExecutionEngine.d.cts";
-import type { GraphExecutionValues, GraphNodeExecutionRequest } from "../types.d.cts";
-/**
- * Executor for `core.loop.until` nodes.
- *
- * Executes the body at least once, then checks the condition. Repeats until
- * the condition evaluates to true.
- */
-export declare class UntilGraphNodeExecutor implements GraphNodeExecutor {
-    private readonly engine;
-    private readonly evaluator;
-    constructor(engine: GraphExecutionEngine);
-    execute(request: GraphNodeExecutionRequest, context: GraphExecutionContext): Promise<GraphExecutionValues>;
-    private extractMetadata;
-}

package/lib/types/graph/engine/loops/UntilGraphNodeExecutor.d.mts

@@ -1,22 +0,0 @@
-/**
- * @module integrations/graph/loops/UntilGraphNodeExecutor
- * @summary Until loop node executor.
- * @description Executes a body workflow at least once and repeats until a condition is true.
- */
-import type { GraphNodeExecutor } from "../execution/GraphNodeExecutor.d.mts";
-import type { GraphExecutionContext } from "../execution/GraphExecutionContext.d.mts";
-import type { GraphExecutionEngine } from "../execution/GraphExecutionEngine.d.mts";
-import type { GraphExecutionValues, GraphNodeExecutionRequest } from "../types.d.mts";
-/**
- * Executor for `core.loop.until` nodes.
- *
- * Executes the body at least once, then checks the condition. Repeats until
- * the condition evaluates to true.
- */
-export declare class UntilGraphNodeExecutor implements GraphNodeExecutor {
-    private readonly engine;
-    private readonly evaluator;
-    constructor(engine: GraphExecutionEngine);
-    execute(request: GraphNodeExecutionRequest, context: GraphExecutionContext): Promise<GraphExecutionValues>;
-    private extractMetadata;
-}

package/lib/types/graph/engine/loops/WhileGraphNodeExecutor.d.cts

@@ -1,26 +0,0 @@
-/**
- * @module integrations/graph/loops/WhileGraphNodeExecutor
- * @summary While loop node executor.
- * @description Executes a body workflow repeatedly while a condition is true, enforcing a maximum iteration limit.
- */
-import type { GraphNodeExecutor } from "../execution/GraphNodeExecutor.d.cts";
-import type { GraphExecutionContext } from "../execution/GraphExecutionContext.d.cts";
-import type { GraphExecutionEngine } from "../execution/GraphExecutionEngine.d.cts";
-import type { GraphExecutionValues, GraphNodeExecutionRequest } from "../types.d.cts";
-/**
- * Executor for `core.loop.while` nodes.
- *
- * Expects input:
- * - `state`: initial state
- *
- * Produces output:
- * - `state`: final state
- * - `iterations`: number of iterations executed
- */
-export declare class WhileGraphNodeExecutor implements GraphNodeExecutor {
-    private readonly engine;
-    private readonly evaluator;
-    constructor(engine: GraphExecutionEngine);
-    execute(request: GraphNodeExecutionRequest, context: GraphExecutionContext): Promise<GraphExecutionValues>;
-    private extractMetadata;
-}

package/lib/types/graph/engine/loops/WhileGraphNodeExecutor.d.mts

@@ -1,26 +0,0 @@
-/**
- * @module integrations/graph/loops/WhileGraphNodeExecutor
- * @summary While loop node executor.
- * @description Executes a body workflow repeatedly while a condition is true, enforcing a maximum iteration limit.
- */
-import type { GraphNodeExecutor } from "../execution/GraphNodeExecutor.d.mts";
-import type { GraphExecutionContext } from "../execution/GraphExecutionContext.d.mts";
-import type { GraphExecutionEngine } from "../execution/GraphExecutionEngine.d.mts";
-import type { GraphExecutionValues, GraphNodeExecutionRequest } from "../types.d.mts";
-/**
- * Executor for `core.loop.while` nodes.
- *
- * Expects input:
- * - `state`: initial state
- *
- * Produces output:
- * - `state`: final state
- * - `iterations`: number of iterations executed
- */
-export declare class WhileGraphNodeExecutor implements GraphNodeExecutor {
-    private readonly engine;
-    private readonly evaluator;
-    constructor(engine: GraphExecutionEngine);
-    execute(request: GraphNodeExecutionRequest, context: GraphExecutionContext): Promise<GraphExecutionValues>;
-    private extractMetadata;
-}

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

@@ -1,11 +0,0 @@
-/**
- * @module integrations/graph/loops
- * @summary Structured loop executors.
- * @description Re-exports the condition evaluator, loop execution context, and foreach/while/until executors.
- */
-export * from "./GraphConditionEvaluator.d.cts";
-export * from "./ConditionExpressionEvaluator.d.cts";
-export * from "./GraphLoopExecutionContext.d.cts";
-export * from "./ForeachGraphNodeExecutor.d.cts";
-export * from "./WhileGraphNodeExecutor.d.cts";
-export * from "./UntilGraphNodeExecutor.d.cts";

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

@@ -1,11 +0,0 @@
-/**
- * @module integrations/graph/loops
- * @summary Structured loop executors.
- * @description Re-exports the condition evaluator, loop execution context, and foreach/while/until executors.
- */
-export * from "./GraphConditionEvaluator.d.mts";
-export * from "./ConditionExpressionEvaluator.d.mts";
-export * from "./GraphLoopExecutionContext.d.mts";
-export * from "./ForeachGraphNodeExecutor.d.mts";
-export * from "./WhileGraphNodeExecutor.d.mts";
-export * from "./UntilGraphNodeExecutor.d.mts";

package/lib/types/graph/engine/pinning/GraphPinningDependencyResolver.d.cts

@@ -1,21 +0,0 @@
-/**
- * @module integrations/graph/pinning/GraphPinningDependencyResolver
- * @summary Resolves upstream dependency subtrees for pinning.
- * @description When a node is pinned, all upstream nodes it depends on must also be pinned. This resolver computes the dependency set.
- */
-import type { GraphExecutionPlan } from "../planning/GraphExecutionPlan.d.cts";
-/**
- * Resolves the upstream dependency subtree of a node for pinning operations.
- */
-export declare class GraphPinningDependencyResolver {
-    /**
-     * Returns the set of upstream node ids that the given node depends on,
-     * excluding the workflow boundary.
-     */
-    getDependencies(plan: GraphExecutionPlan, nodeId: string): Set<string>;
-    /**
-     * Returns the full set of node ids to pin: the node itself plus all its
-     * upstream dependencies.
-     */
-    getPinSet(plan: GraphExecutionPlan, nodeId: string): Set<string>;
-}

package/lib/types/graph/engine/pinning/GraphPinningDependencyResolver.d.mts

@@ -1,21 +0,0 @@
-/**
- * @module integrations/graph/pinning/GraphPinningDependencyResolver
- * @summary Resolves upstream dependency subtrees for pinning.
- * @description When a node is pinned, all upstream nodes it depends on must also be pinned. This resolver computes the dependency set.
- */
-import type { GraphExecutionPlan } from "../planning/GraphExecutionPlan.d.mts";
-/**
- * Resolves the upstream dependency subtree of a node for pinning operations.
- */
-export declare class GraphPinningDependencyResolver {
-    /**
-     * Returns the set of upstream node ids that the given node depends on,
-     * excluding the workflow boundary.
-     */
-    getDependencies(plan: GraphExecutionPlan, nodeId: string): Set<string>;
-    /**
-     * Returns the full set of node ids to pin: the node itself plus all its
-     * upstream dependencies.
-     */
-    getPinSet(plan: GraphExecutionPlan, nodeId: string): Set<string>;
-}

package/lib/types/graph/engine/pinning/GraphPinningMetadata.d.cts

@@ -1,14 +0,0 @@
-/**
- * @module integrations/graph/pinning/GraphPinningMetadata
- * @summary Pinning metadata defaults and helpers.
- * @description Provides default pinning metadata values and a helper to check pinnability. The `GraphPinningMetadata` type itself is defined in `../types` and re-exported from the package root.
- */
-import type { GraphPinningMetadata } from "../types.d.cts";
-/**
- * Default pinning metadata applied when `@pinnable()` is used without options.
- */
-export declare const DEFAULT_PINNING_METADATA: GraphPinningMetadata;
-/**
- * Returns `true` when the given metadata allows pinning.
- */
-export declare function isPinnable(metadata: GraphPinningMetadata | undefined): boolean;

package/lib/types/graph/engine/pinning/GraphPinningMetadata.d.mts

@@ -1,14 +0,0 @@
-/**
- * @module integrations/graph/pinning/GraphPinningMetadata
- * @summary Pinning metadata defaults and helpers.
- * @description Provides default pinning metadata values and a helper to check pinnability. The `GraphPinningMetadata` type itself is defined in `../types` and re-exported from the package root.
- */
-import type { GraphPinningMetadata } from "../types.d.mts";
-/**
- * Default pinning metadata applied when `@pinnable()` is used without options.
- */
-export declare const DEFAULT_PINNING_METADATA: GraphPinningMetadata;
-/**
- * Returns `true` when the given metadata allows pinning.
- */
-export declare function isPinnable(metadata: GraphPinningMetadata | undefined): boolean;

package/lib/types/graph/engine/pinning/GraphPinningPolicy.d.cts

@@ -1,20 +0,0 @@
-/**
- * @module integrations/graph/pinning/GraphPinningPolicy
- * @summary Decides whether a node can be pinned and whether pinned values should be used.
- * @description Reads pinning metadata from plan nodes and enforces the pinning strategy.
- */
-import type { GraphExecutionPlanNode } from "../planning/GraphExecutionPlanNode.d.cts";
-import type { GraphPinningMetadata } from "../types.d.cts";
-/**
- * Policy that decides pinning behaviour for a plan node.
- */
-export declare class GraphPinningPolicy {
-    /** Returns whether the node is allowed to be pinned. */
-    canPin(node: GraphExecutionPlanNode): boolean;
-    /** Returns whether the engine should attempt to use a pinned value for the node. */
-    shouldUsePinnedValue(node: GraphExecutionPlanNode): boolean;
-    /** Returns whether automatic pinning should occur after execution. */
-    shouldAutoPin(node: GraphExecutionPlanNode): boolean;
-    /** Extracts pinning metadata from a plan node. */
-    getPinningMetadata(node: GraphExecutionPlanNode): GraphPinningMetadata;
-}

package/lib/types/graph/engine/pinning/GraphPinningPolicy.d.mts

@@ -1,20 +0,0 @@
-/**
- * @module integrations/graph/pinning/GraphPinningPolicy
- * @summary Decides whether a node can be pinned and whether pinned values should be used.
- * @description Reads pinning metadata from plan nodes and enforces the pinning strategy.
- */
-import type { GraphExecutionPlanNode } from "../planning/GraphExecutionPlanNode.d.mts";
-import type { GraphPinningMetadata } from "../types.d.mts";
-/**
- * Policy that decides pinning behaviour for a plan node.
- */
-export declare class GraphPinningPolicy {
-    /** Returns whether the node is allowed to be pinned. */
-    canPin(node: GraphExecutionPlanNode): boolean;
-    /** Returns whether the engine should attempt to use a pinned value for the node. */
-    shouldUsePinnedValue(node: GraphExecutionPlanNode): boolean;
-    /** Returns whether automatic pinning should occur after execution. */
-    shouldAutoPin(node: GraphExecutionPlanNode): boolean;
-    /** Extracts pinning metadata from a plan node. */
-    getPinningMetadata(node: GraphExecutionPlanNode): GraphPinningMetadata;
-}

package/lib/types/graph/engine/pinning/GraphPinningService.d.cts

@@ -1,70 +0,0 @@
-import type { GraphExecutionPlanNode } from "../planning/GraphExecutionPlanNode.d.cts";
-import type { GraphValueStore } from "../store/GraphValueStore.d.cts";
-import type { GraphValueKey } from "../store/GraphValueKey.d.cts";
-import type { GraphCachedValue } from "../store/GraphCachedValue.d.cts";
-import type { GraphExecutionValues, GraphPinNodeOptions, GraphUnpinNodeOptions } from "../types.d.cts";
-import type { GraphPinningPolicy } from "./GraphPinningPolicy.d.cts";
-import type { GraphPinningDependencyResolver } from "./GraphPinningDependencyResolver.d.cts";
-/**
- * Service that manages pinning and unpinning of graph node values.
- */
-export declare class GraphPinningService {
-    private readonly store;
-    private readonly policy;
-    private readonly dependencyResolver;
-    constructor(store: GraphValueStore, policy: GraphPinningPolicy, dependencyResolver: GraphPinningDependencyResolver);
-    /**
-     * Pins a node and all its upstream dependencies.
-     *
-     * @throws {GraphPinningError} when the node or any dependency is not pinnable.
-     */
-    pinNode(options: GraphPinNodeOptions): Promise<void>;
-    /**
-     * Unpins a single node (does not unpin dependents in v1).
-     */
-    unpinNode(options: GraphUnpinNodeOptions): Promise<void>;
-    /**
-     * Reads a pinned value for a node, returning `undefined` when no valid
-     * pinned value exists.
-     */
-    readPinnedValue(workflowId: string, node: GraphExecutionPlanNode, inputs: GraphExecutionValues, dependencyFingerprints: Record<string, string>, namespace?: string): Promise<GraphCachedValue | undefined>;
-    /**
-     * Creates a stable value key for a node.
-     */
-    createValueKey(workflowId: string, node: GraphExecutionPlanNode, inputs: GraphExecutionValues, dependencyFingerprints: Record<string, string>, namespace?: string): GraphValueKey;
-    /**
-     * Computes a stable fingerprint for a node (DECAF-50 §4.9).
-     *
-     * The fingerprint derives from the node kind, the instance parameters, the
-     * input bindings, the effective input values, relevant instance metadata,
-     * and the configured dependency fingerprints. Presentation-only UI state is
-     * excluded: the instance `ui` record is never read, and a `ui` key inside
-     * metadata is stripped, so canvas positions and visual settings cannot
-     * affect pinning.
-     */
-    computeFingerprint(workflowId: string, node: GraphExecutionPlanNode, inputs: GraphExecutionValues, dependencyFingerprints: Record<string, string>): string;
-    /**
-     * Strips presentation-only keys (`ui` and UI-state shapes) from the node's
-     * instance metadata, leaving only pinning-relevant metadata.
-     */
-    private relevantMetadata;
-    /**
-     * Returns a topological ordering of the given node set.
-     */
-    private topologicalOrder;
-    /**
-     * Computes fingerprints for all upstream dependencies of a node.
-     */
-    private dependencyFingerprints;
-    /**
-     * Serializes a value with recursively sorted keys for stable hashing.
-     */
-    private stableSerialize;
-    /**
-     * Simple non-cryptographic hash for browser environments where
-     * `node:crypto` is unavailable. Produces a deterministic hex-like string
-     * from the input. This is NOT cryptographically secure but is sufficient
-     * for fingerprint-based cache keys.
-     */
-    private simpleHash;
-}

package/lib/types/graph/engine/pinning/GraphPinningService.d.mts

@@ -1,70 +0,0 @@
-import type { GraphExecutionPlanNode } from "../planning/GraphExecutionPlanNode.d.mts";
-import type { GraphValueStore } from "../store/GraphValueStore.d.mts";
-import type { GraphValueKey } from "../store/GraphValueKey.d.mts";
-import type { GraphCachedValue } from "../store/GraphCachedValue.d.mts";
-import type { GraphExecutionValues, GraphPinNodeOptions, GraphUnpinNodeOptions } from "../types.d.mts";
-import type { GraphPinningPolicy } from "./GraphPinningPolicy.d.mts";
-import type { GraphPinningDependencyResolver } from "./GraphPinningDependencyResolver.d.mts";
-/**
- * Service that manages pinning and unpinning of graph node values.
- */
-export declare class GraphPinningService {
-    private readonly store;
-    private readonly policy;
-    private readonly dependencyResolver;
-    constructor(store: GraphValueStore, policy: GraphPinningPolicy, dependencyResolver: GraphPinningDependencyResolver);
-    /**
-     * Pins a node and all its upstream dependencies.
-     *
-     * @throws {GraphPinningError} when the node or any dependency is not pinnable.
-     */
-    pinNode(options: GraphPinNodeOptions): Promise<void>;
-    /**
-     * Unpins a single node (does not unpin dependents in v1).
-     */
-    unpinNode(options: GraphUnpinNodeOptions): Promise<void>;
-    /**
-     * Reads a pinned value for a node, returning `undefined` when no valid
-     * pinned value exists.
-     */
-    readPinnedValue(workflowId: string, node: GraphExecutionPlanNode, inputs: GraphExecutionValues, dependencyFingerprints: Record<string, string>, namespace?: string): Promise<GraphCachedValue | undefined>;
-    /**
-     * Creates a stable value key for a node.
-     */
-    createValueKey(workflowId: string, node: GraphExecutionPlanNode, inputs: GraphExecutionValues, dependencyFingerprints: Record<string, string>, namespace?: string): GraphValueKey;
-    /**
-     * Computes a stable fingerprint for a node (DECAF-50 §4.9).
-     *
-     * The fingerprint derives from the node kind, the instance parameters, the
-     * input bindings, the effective input values, relevant instance metadata,
-     * and the configured dependency fingerprints. Presentation-only UI state is
-     * excluded: the instance `ui` record is never read, and a `ui` key inside
-     * metadata is stripped, so canvas positions and visual settings cannot
-     * affect pinning.
-     */
-    computeFingerprint(workflowId: string, node: GraphExecutionPlanNode, inputs: GraphExecutionValues, dependencyFingerprints: Record<string, string>): string;
-    /**
-     * Strips presentation-only keys (`ui` and UI-state shapes) from the node's
-     * instance metadata, leaving only pinning-relevant metadata.
-     */
-    private relevantMetadata;
-    /**
-     * Returns a topological ordering of the given node set.
-     */
-    private topologicalOrder;
-    /**
-     * Computes fingerprints for all upstream dependencies of a node.
-     */
-    private dependencyFingerprints;
-    /**
-     * Serializes a value with recursively sorted keys for stable hashing.
-     */
-    private stableSerialize;
-    /**
-     * Simple non-cryptographic hash for browser environments where
-     * `node:crypto` is unavailable. Produces a deterministic hex-like string
-     * from the input. This is NOT cryptographically secure but is sufficient
-     * for fingerprint-based cache keys.
-     */
-    private simpleHash;
-}

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

@@ -1,9 +0,0 @@
-/**
- * @module integrations/graph/pinning
- * @summary Graph pinning subsystem.
- * @description Re-exports the pinning metadata, policy, dependency resolver, and service.
- */
-export * from "./GraphPinningMetadata.d.cts";
-export * from "./GraphPinningPolicy.d.cts";
-export * from "./GraphPinningDependencyResolver.d.cts";
-export * from "./GraphPinningService.d.cts";

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

@@ -1,9 +0,0 @@
-/**
- * @module integrations/graph/pinning
- * @summary Graph pinning subsystem.
- * @description Re-exports the pinning metadata, policy, dependency resolver, and service.
- */
-export * from "./GraphPinningMetadata.d.mts";
-export * from "./GraphPinningPolicy.d.mts";
-export * from "./GraphPinningDependencyResolver.d.mts";
-export * from "./GraphPinningService.d.mts";

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

@@ -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.cts";
-import type { GraphExecutionPlanNode } from "./GraphExecutionPlanNode.d.cts";
-import type { GraphExecutionPlanEdge } from "./GraphExecutionPlanEdge.d.cts";
-import type { GraphExecutionPlanLayer } from "./GraphExecutionPlanLayer.d.cts";
-/**
- * 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/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>;
-}