@decaf-ts/integrations 0.3.4 → 0.3.6

package/lib/types/graph/execution/SwitchGraphNodeExecutor.d.mts

@@ -0,0 +1,42 @@
+/**
+ * @module integrations/graph/execution/SwitchGraphNodeExecutor
+ * @summary Executor for the Switch flow-control node (DECAF-32 §22.2.2).
+ * @description Evaluates each case's condition against the node's input and
+ * routes the input to the first matching case's output port. Falls back to
+ * the `default` output when no case matches. Supports both
+ * {@link ConditionExpression} (graphical mode) and {@link CodeCondition}
+ * (code mode via the pluggable {@link CodeSandboxEvaluator}).
+ */
+import type { GraphNodeExecutor } from "./GraphNodeExecutor.d.mts";
+import type { GraphExecutionContext } from "./GraphExecutionContext.d.mts";
+import type { GraphExecutionValues } from "../types.d.mts";
+import type { CodeSandboxEvaluator } from "./CodeSandboxEvaluator.d.mts";
+/**
+ * Executor for `core.flow.switch` nodes.
+ *
+ * Evaluates each case's condition in order and routes the input to the
+ * first matching case's output port. When no case matches, routes to the
+ * `default` output port.
+ *
+ * Condition evaluation:
+ * - `ConditionExpression` — evaluated via {@link ConditionExpressionEvaluator}.
+ * - `CodeCondition` — evaluated via the pluggable {@link CodeSandboxEvaluator}
+ *   from the engine's config. Throws `GRAPH_CODE_SANDBOX_NOT_CONFIGURED`
+ *   when no evaluator is registered.
+ */
+export declare class SwitchGraphNodeExecutor implements GraphNodeExecutor {
+    private readonly engine?;
+    private readonly expressionEvaluator;
+    constructor(engine?: {
+        codeSandboxEvaluator?: CodeSandboxEvaluator;
+    } | undefined);
+    execute(input: GraphExecutionValues, context: GraphExecutionContext): Promise<GraphExecutionValues>;
+    /**
+     * Evaluates a single switch case condition.
+     */
+    private evaluateCondition;
+    /**
+     * Evaluates a code condition via the pluggable sandbox evaluator.
+     */
+    private evaluateCodeCondition;
+}

package/lib/types/graph/execution/index.d.cts

@@ -8,3 +8,5 @@ export * from "./GraphNodeExecutor.d.cts";
 export * from "./GraphExecutionResult.d.cts";
 export * from "./GraphExecutionFrame.d.cts";
 export * from "./GraphExecutionEngine.d.cts";
+export * from "./CodeSandboxEvaluator.d.cts";
+export * from "./SwitchGraphNodeExecutor.d.cts";

package/lib/types/graph/execution/index.d.mts

@@ -8,3 +8,5 @@ export * from "./GraphNodeExecutor.d.mts";
 export * from "./GraphExecutionResult.d.mts";
 export * from "./GraphExecutionFrame.d.mts";
 export * from "./GraphExecutionEngine.d.mts";
+export * from "./CodeSandboxEvaluator.d.mts";
+export * from "./SwitchGraphNodeExecutor.d.mts";

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

@@ -23,6 +23,8 @@ export * from "./execution/GraphNodeExecutor.d.cts";
 export * from "./execution/GraphExecutionFrame.d.cts";
 export * from "./execution/GraphExecutionResult.d.cts";
 export * from "./execution/GraphExecutionEngine.d.cts";
+export * from "./execution/CodeSandboxEvaluator.d.cts";
+export * from "./execution/SwitchGraphNodeExecutor.d.cts";
 export * from "./registry/GraphNodeExecutorRegistry.d.cts";
 export * from "./registry/GraphNodeExecutorResolver.d.cts";
 export * from "./store/GraphValueKey.d.cts";
@@ -41,6 +43,7 @@ export * from "./validation/GraphDefinitionValidator.d.cts";
 export * from "./validation/GraphPortSchemaResolver.d.cts";
 export * from "./validation/GraphValueValidator.d.cts";
 export * from "./loops/GraphConditionEvaluator.d.cts";
+export * from "./loops/ConditionExpressionEvaluator.d.cts";
 export * from "./loops/GraphLoopExecutionContext.d.cts";
 export * from "./loops/ForeachGraphNodeExecutor.d.cts";
 export * from "./loops/WhileGraphNodeExecutor.d.cts";
@@ -50,3 +53,4 @@ export * from "./pinning/GraphPinningPolicy.d.cts";
 export * from "./pinning/GraphPinningDependencyResolver.d.cts";
 export * from "./pinning/GraphPinningService.d.cts";
 export * from "./snapshots/GraphExecutionSnapshotMapper.d.cts";
+export * from "./nodes/index.d.cts";

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

@@ -23,6 +23,8 @@ export * from "./execution/GraphNodeExecutor.d.mts";
 export * from "./execution/GraphExecutionFrame.d.mts";
 export * from "./execution/GraphExecutionResult.d.mts";
 export * from "./execution/GraphExecutionEngine.d.mts";
+export * from "./execution/CodeSandboxEvaluator.d.mts";
+export * from "./execution/SwitchGraphNodeExecutor.d.mts";
 export * from "./registry/GraphNodeExecutorRegistry.d.mts";
 export * from "./registry/GraphNodeExecutorResolver.d.mts";
 export * from "./store/GraphValueKey.d.mts";
@@ -41,6 +43,7 @@ export * from "./validation/GraphDefinitionValidator.d.mts";
 export * from "./validation/GraphPortSchemaResolver.d.mts";
 export * from "./validation/GraphValueValidator.d.mts";
 export * from "./loops/GraphConditionEvaluator.d.mts";
+export * from "./loops/ConditionExpressionEvaluator.d.mts";
 export * from "./loops/GraphLoopExecutionContext.d.mts";
 export * from "./loops/ForeachGraphNodeExecutor.d.mts";
 export * from "./loops/WhileGraphNodeExecutor.d.mts";
@@ -50,3 +53,4 @@ export * from "./pinning/GraphPinningPolicy.d.mts";
 export * from "./pinning/GraphPinningDependencyResolver.d.mts";
 export * from "./pinning/GraphPinningService.d.mts";
 export * from "./snapshots/GraphExecutionSnapshotMapper.d.mts";
+export * from "./nodes/index.d.mts";

package/lib/types/graph/loops/ConditionExpressionEvaluator.d.cts

@@ -0,0 +1,36 @@
+/**
+ * @module integrations/graph/loops/ConditionExpressionEvaluator
+ * @summary Evaluator for the ALFRED-5 `ConditionExpression` DSL (DECAF-32 §22.3).
+ * @description Evaluates declarative, serializable condition expressions with
+ * `eq`/`neq`/`gt`/`gte`/`lt`/`lte`/`and`/`or`/`not`/`exists` operators and
+ * `ExprValue` references (`{const}`, `{path}`, `{step, path}`).
+ */
+import type { ConditionExpression } from "../types.d.cts";
+/**
+ * Evaluates a {@link ConditionExpression} against the given state.
+ *
+ * `ExprValue` resolution:
+ * - `{ const: x }` → the literal value `x`.
+ * - `{ path: "a.b" }` → dotted-path lookup into `state`.
+ * - `{ step: "nodeId", path: "out" }` → cross-node reference; in v1 the state
+ *   is expected to contain a `nodes` map keyed by node id (reserved for future
+ *   multi-step evaluation; falls back to `state` lookup when absent).
+ */
+export declare class ConditionExpressionEvaluator {
+    /**
+     * Evaluates a condition expression to a boolean.
+     *
+     * @param expr - The condition expression.
+     * @param state - The current evaluation state (loop state or execution values).
+     * @returns `true` when the expression evaluates to a truthy/positive result.
+     */
+    evaluate(expr: ConditionExpression, state: unknown): boolean;
+    /**
+     * Resolves an {@link ExprValue} against the current state.
+     */
+    private resolveValue;
+    /**
+     * Resolves a dotted path into a target object.
+     */
+    private resolvePath;
+}

package/lib/types/graph/loops/ConditionExpressionEvaluator.d.mts

@@ -0,0 +1,36 @@
+/**
+ * @module integrations/graph/loops/ConditionExpressionEvaluator
+ * @summary Evaluator for the ALFRED-5 `ConditionExpression` DSL (DECAF-32 §22.3).
+ * @description Evaluates declarative, serializable condition expressions with
+ * `eq`/`neq`/`gt`/`gte`/`lt`/`lte`/`and`/`or`/`not`/`exists` operators and
+ * `ExprValue` references (`{const}`, `{path}`, `{step, path}`).
+ */
+import type { ConditionExpression } from "../types.d.mts";
+/**
+ * Evaluates a {@link ConditionExpression} against the given state.
+ *
+ * `ExprValue` resolution:
+ * - `{ const: x }` → the literal value `x`.
+ * - `{ path: "a.b" }` → dotted-path lookup into `state`.
+ * - `{ step: "nodeId", path: "out" }` → cross-node reference; in v1 the state
+ *   is expected to contain a `nodes` map keyed by node id (reserved for future
+ *   multi-step evaluation; falls back to `state` lookup when absent).
+ */
+export declare class ConditionExpressionEvaluator {
+    /**
+     * Evaluates a condition expression to a boolean.
+     *
+     * @param expr - The condition expression.
+     * @param state - The current evaluation state (loop state or execution values).
+     * @returns `true` when the expression evaluates to a truthy/positive result.
+     */
+    evaluate(expr: ConditionExpression, state: unknown): boolean;
+    /**
+     * Resolves an {@link ExprValue} against the current state.
+     */
+    private resolveValue;
+    /**
+     * Resolves a dotted path into a target object.
+     */
+    private resolvePath;
+}

package/lib/types/graph/loops/GraphConditionEvaluator.d.cts

@@ -1,23 +1,39 @@
 /**
  * @module integrations/graph/loops/GraphConditionEvaluator
- * @summary Evaluator for built-in loop condition types.
+ * @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.cts";
+import type { ConditionExpression, GraphConditionDefinition } from "../types.d.cts";
 /**
- * Evaluates loop conditions using built-in comparison types.
+ * 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, state: unknown): boolean;
+    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/loops/GraphConditionEvaluator.d.mts

@@ -1,23 +1,39 @@
 /**
  * @module integrations/graph/loops/GraphConditionEvaluator
- * @summary Evaluator for built-in loop condition types.
+ * @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, GraphConditionDefinition } from "../types.d.mts";
 /**
- * Evaluates loop conditions using built-in comparison types.
+ * 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, state: unknown): boolean;
+    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/loops/index.d.cts

@@ -4,6 +4,7 @@
  * @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";

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

@@ -4,6 +4,7 @@
  * @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";

package/lib/types/graph/nodes/agent.d.cts

@@ -0,0 +1,44 @@
+/**
+ * @module integrations/graph/nodes/agent
+ * @summary Production Agent node declaration.
+ * @description The Agent node is the primary AI agent entrypoint. It is a
+ * rectangular node with `@connection()` ports for its structural dependencies:
+ * `model` (the LLM), `memory` (the memory store), and `workspace` (the
+ * workspace/context). Connections are rendered on the bottom side of the node
+ * (DECAF-32 §21.3). Each connection category has a distinct color defined in
+ * the category style registry.
+ *
+ * The single `prompt` input accepts placeholder expressions (§22.4) such as
+ * `{{ $input.brief }}` or `{{ $node["Research"].output.summary }}` that are
+ * resolved at execution time by the placeholder compiler.
+ */
+import { Model } from "@decaf-ts/decorator-validation";
+import "./category-styles";
+/**
+ * Agent node — an AI agent that orchestrates a model, memory, and workspace.
+ *
+ * The agent has:
+ * - `@input` port on the **left**: `prompt` (the task prompt; supports
+ *   placeholder expressions like `{{ $input.something }}` per §22.4).
+ * - `@output` ports on the **right**: `response` (the agent's output), `actions`
+ *   (any actions the agent decided to take).
+ * - `@connection` ports on the **bottom**: `model` (LLM), `memory` (memory
+ *   store), `workspace` (workspace/context). Each connection has a distinct
+ *   category color.
+ *
+ * The node is rectangular (not rounded) to visually distinguish it from
+ * regular processing nodes. The `color` and `icon` are omitted from `@node()`
+ * so they are resolved from the `"Agent"` category style.
+ */
+export declare class AgentNode extends Model {
+    prompt: string;
+    response: string;
+    actions: unknown[];
+    model: unknown;
+    memory: unknown;
+    workspace: unknown;
+}
+/**
+ * All built-in agent node constructors.
+ */
+export declare const GRAPH_AGENT_NODES: readonly [typeof AgentNode];

package/lib/types/graph/nodes/agent.d.mts

@@ -0,0 +1,44 @@
+/**
+ * @module integrations/graph/nodes/agent
+ * @summary Production Agent node declaration.
+ * @description The Agent node is the primary AI agent entrypoint. It is a
+ * rectangular node with `@connection()` ports for its structural dependencies:
+ * `model` (the LLM), `memory` (the memory store), and `workspace` (the
+ * workspace/context). Connections are rendered on the bottom side of the node
+ * (DECAF-32 §21.3). Each connection category has a distinct color defined in
+ * the category style registry.
+ *
+ * The single `prompt` input accepts placeholder expressions (§22.4) such as
+ * `{{ $input.brief }}` or `{{ $node["Research"].output.summary }}` that are
+ * resolved at execution time by the placeholder compiler.
+ */
+import { Model } from "@decaf-ts/decorator-validation";
+import "./category-styles";
+/**
+ * Agent node — an AI agent that orchestrates a model, memory, and workspace.
+ *
+ * The agent has:
+ * - `@input` port on the **left**: `prompt` (the task prompt; supports
+ *   placeholder expressions like `{{ $input.something }}` per §22.4).
+ * - `@output` ports on the **right**: `response` (the agent's output), `actions`
+ *   (any actions the agent decided to take).
+ * - `@connection` ports on the **bottom**: `model` (LLM), `memory` (memory
+ *   store), `workspace` (workspace/context). Each connection has a distinct
+ *   category color.
+ *
+ * The node is rectangular (not rounded) to visually distinguish it from
+ * regular processing nodes. The `color` and `icon` are omitted from `@node()`
+ * so they are resolved from the `"Agent"` category style.
+ */
+export declare class AgentNode extends Model {
+    prompt: string;
+    response: string;
+    actions: unknown[];
+    model: unknown;
+    memory: unknown;
+    workspace: unknown;
+}
+/**
+ * All built-in agent node constructors.
+ */
+export declare const GRAPH_AGENT_NODES: readonly [typeof AgentNode];

package/lib/types/graph/nodes/category-styles.d.cts

@@ -0,0 +1,8 @@
+/**
+ * Registers all built-in category styles. Called once at module init.
+ *
+ * Categories define the default visual style for nodes and connection ports.
+ * A node's explicit `color` / `icon` (on `@node()`) overrides the category
+ * style; when omitted, the category style is used.
+ */
+export declare function registerBuiltinCategoryStyles(): void;

package/lib/types/graph/nodes/category-styles.d.mts

@@ -0,0 +1,8 @@
+/**
+ * Registers all built-in category styles. Called once at module init.
+ *
+ * Categories define the default visual style for nodes and connection ports.
+ * A node's explicit `color` / `icon` (on `@node()`) overrides the category
+ * style; when omitted, the category style is used.
+ */
+export declare function registerBuiltinCategoryStyles(): void;

package/lib/types/graph/nodes/flow-control.d.cts

@@ -0,0 +1,104 @@
+/**
+ * @module integrations/graph/nodes/flow-control
+ * @summary Production flow-control node kind declarations (DECAF-32 §22.2.2).
+ * @description Canonical `@node`-decorated classes for the ten ALFRED-5
+ * flow-control kinds. These are graph-level macros: the engine's planner
+ * recognises them as ordinary executable nodes (§5.7) but they have no
+ * built-in executors — downstream projects (e.g. ALFRED) register custom
+ * executors or compile them into Mastra composition APIs (§22.2.2).
+ *
+ * The three loop kinds (`core.loop.foreach/while/until`) already have built-in
+ * executors (§5.9) and are NOT redeclared here.
+ */
+import { Model } from "@decaf-ts/decorator-validation";
+/**
+ * If — conditional branch. Evaluates a `ConditionExpression` (§22.3) and
+ * routes the input to the `then` or `else` output.
+ */
+export declare class IfFlowNode extends Model {
+    value: unknown;
+    then: unknown;
+    else: unknown;
+}
+/**
+ * Switch — multi-branch. Routes the input to one of the case output ports
+ * or `default` based on matching conditions. Each case defines a
+ * {@link SwitchCaseCondition} (graphical or code mode) and a dedicated
+ * output port. Cases are stored in `metadata.switch.cases` and the
+ * renderer creates dynamic output ports from them (DECAF-32 §22.2.2).
+ *
+ * The node grows in height as cases are added. Each case gets its own
+ * output port on the right side, labeled with the case label.
+ */
+export declare class SwitchFlowNode extends Model {
+    value: unknown;
+    default: unknown;
+}
+/**
+ * Parallel — splits execution into concurrent branches.
+ */
+export declare class ParallelFlowNode extends Model {
+    value: unknown;
+    branches: unknown[];
+}
+/**
+ * Merge — normalises branch/parallel outputs into a single output.
+ */
+export declare class MergeFlowNode extends Model {
+    values: unknown[];
+    merged: unknown;
+}
+/**
+ * Map — transforms the current input into a new output object.
+ */
+export declare class MapFlowNode extends Model {
+    value: unknown;
+    result: unknown;
+}
+/**
+ * Delay — pauses execution for a configured duration.
+ */
+export declare class DelayFlowNode extends Model {
+    value: unknown;
+    valueOut: unknown;
+}
+/**
+ * Error boundary — try/catch/finally workflow behaviour.
+ */
+export declare class ErrorBoundaryFlowNode extends Model {
+    value: unknown;
+    result: unknown;
+    error: unknown;
+}
+/**
+ * Human approval — suspends execution until a human approves or rejects.
+ */
+export declare class HumanApprovalFlowNode extends Model {
+    value: unknown;
+    approved: unknown;
+    rejected: unknown;
+}
+/**
+ * Return — defines and normalises the final workflow output.
+ */
+export declare class ReturnFlowNode extends Model {
+    value: unknown;
+    result: unknown;
+}
+/**
+ * Code — sandboxed JS/TS code execution (ALFRED-5 §7).
+ *
+ * The engine does not implement the sandbox directly (§22.4). A future
+ * executor may wrap the `CodeSandbox` contract (ALFRED-5 §7.17) as a
+ * pluggable executor. The placeholder syntax (`{{ $input }}`, `{{ $item }}`,
+ * `{{ $index }}`, `{{ $vars }}`, `{{ $node["Name"].output }}`) is Mastra-
+ * agnostic and lives in the downstream project's `modules/core` (ALFRED-6).
+ */
+export declare class CodeFlowNode extends Model {
+    input: unknown;
+    result: unknown;
+}
+/**
+ * All built-in flow-control node constructors.
+ */
+export declare const GRAPH_FLOW_CONTROL_NODES: readonly [typeof IfFlowNode, typeof SwitchFlowNode, typeof ParallelFlowNode, typeof MergeFlowNode, typeof MapFlowNode, typeof DelayFlowNode, typeof ErrorBoundaryFlowNode, typeof HumanApprovalFlowNode, typeof ReturnFlowNode, typeof CodeFlowNode];

package/lib/types/graph/nodes/flow-control.d.mts

@@ -0,0 +1,104 @@
+/**
+ * @module integrations/graph/nodes/flow-control
+ * @summary Production flow-control node kind declarations (DECAF-32 §22.2.2).
+ * @description Canonical `@node`-decorated classes for the ten ALFRED-5
+ * flow-control kinds. These are graph-level macros: the engine's planner
+ * recognises them as ordinary executable nodes (§5.7) but they have no
+ * built-in executors — downstream projects (e.g. ALFRED) register custom
+ * executors or compile them into Mastra composition APIs (§22.2.2).
+ *
+ * The three loop kinds (`core.loop.foreach/while/until`) already have built-in
+ * executors (§5.9) and are NOT redeclared here.
+ */
+import { Model } from "@decaf-ts/decorator-validation";
+/**
+ * If — conditional branch. Evaluates a `ConditionExpression` (§22.3) and
+ * routes the input to the `then` or `else` output.
+ */
+export declare class IfFlowNode extends Model {
+    value: unknown;
+    then: unknown;
+    else: unknown;
+}
+/**
+ * Switch — multi-branch. Routes the input to one of the case output ports
+ * or `default` based on matching conditions. Each case defines a
+ * {@link SwitchCaseCondition} (graphical or code mode) and a dedicated
+ * output port. Cases are stored in `metadata.switch.cases` and the
+ * renderer creates dynamic output ports from them (DECAF-32 §22.2.2).
+ *
+ * The node grows in height as cases are added. Each case gets its own
+ * output port on the right side, labeled with the case label.
+ */
+export declare class SwitchFlowNode extends Model {
+    value: unknown;
+    default: unknown;
+}
+/**
+ * Parallel — splits execution into concurrent branches.
+ */
+export declare class ParallelFlowNode extends Model {
+    value: unknown;
+    branches: unknown[];
+}
+/**
+ * Merge — normalises branch/parallel outputs into a single output.
+ */
+export declare class MergeFlowNode extends Model {
+    values: unknown[];
+    merged: unknown;
+}
+/**
+ * Map — transforms the current input into a new output object.
+ */
+export declare class MapFlowNode extends Model {
+    value: unknown;
+    result: unknown;
+}
+/**
+ * Delay — pauses execution for a configured duration.
+ */
+export declare class DelayFlowNode extends Model {
+    value: unknown;
+    valueOut: unknown;
+}
+/**
+ * Error boundary — try/catch/finally workflow behaviour.
+ */
+export declare class ErrorBoundaryFlowNode extends Model {
+    value: unknown;
+    result: unknown;
+    error: unknown;
+}
+/**
+ * Human approval — suspends execution until a human approves or rejects.
+ */
+export declare class HumanApprovalFlowNode extends Model {
+    value: unknown;
+    approved: unknown;
+    rejected: unknown;
+}
+/**
+ * Return — defines and normalises the final workflow output.
+ */
+export declare class ReturnFlowNode extends Model {
+    value: unknown;
+    result: unknown;
+}
+/**
+ * Code — sandboxed JS/TS code execution (ALFRED-5 §7).
+ *
+ * The engine does not implement the sandbox directly (§22.4). A future
+ * executor may wrap the `CodeSandbox` contract (ALFRED-5 §7.17) as a
+ * pluggable executor. The placeholder syntax (`{{ $input }}`, `{{ $item }}`,
+ * `{{ $index }}`, `{{ $vars }}`, `{{ $node["Name"].output }}`) is Mastra-
+ * agnostic and lives in the downstream project's `modules/core` (ALFRED-6).
+ */
+export declare class CodeFlowNode extends Model {
+    input: unknown;
+    result: unknown;
+}
+/**
+ * All built-in flow-control node constructors.
+ */
+export declare const GRAPH_FLOW_CONTROL_NODES: readonly [typeof IfFlowNode, typeof SwitchFlowNode, typeof ParallelFlowNode, typeof MergeFlowNode, typeof MapFlowNode, typeof DelayFlowNode, typeof ErrorBoundaryFlowNode, typeof HumanApprovalFlowNode, typeof ReturnFlowNode, typeof CodeFlowNode];

package/lib/types/graph/nodes/index.d.cts

@@ -0,0 +1,16 @@
+/**
+ * @module integrations/graph/nodes
+ * @summary Production node kind declarations (DECAF-32 §22.2).
+ * @description Canonical `@node`-decorated classes for the ALFRED-5 node kind
+ * taxonomy. These are the framework's built-in node definitions — triggers
+ * (§22.2.1), flow-control/utility nodes (§22.2.2–22.2.3), and the Agent node
+ * (§21.3). The three loop kinds (`core.loop.foreach/while/until`) already have
+ * built-in executors (§5.9) and are not redeclared here.
+ *
+ * Consumers (for-angular, ALFRED, etc.) import these declarations to populate
+ * node palettes, registries, and reference snapshots.
+ */
+export * from "./category-styles.d.cts";
+export * from "./triggers.d.cts";
+export * from "./flow-control.d.cts";
+export * from "./agent.d.cts";

package/lib/types/graph/nodes/index.d.mts

@@ -0,0 +1,16 @@
+/**
+ * @module integrations/graph/nodes
+ * @summary Production node kind declarations (DECAF-32 §22.2).
+ * @description Canonical `@node`-decorated classes for the ALFRED-5 node kind
+ * taxonomy. These are the framework's built-in node definitions — triggers
+ * (§22.2.1), flow-control/utility nodes (§22.2.2–22.2.3), and the Agent node
+ * (§21.3). The three loop kinds (`core.loop.foreach/while/until`) already have
+ * built-in executors (§5.9) and are not redeclared here.
+ *
+ * Consumers (for-angular, ALFRED, etc.) import these declarations to populate
+ * node palettes, registries, and reference snapshots.
+ */
+export * from "./category-styles.d.mts";
+export * from "./triggers.d.mts";
+export * from "./flow-control.d.mts";
+export * from "./agent.d.mts";