@particle-academy/fancy-flow 0.77.0 → 0.78.0

package/dist/{chunk-OOQ2MMBE.js.map → chunk-GPFIJR2K.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/schema/workflow-schema.ts"],"names":[],"mappings":";;;;AAMO,IAAM,uBAAA,GAA0B;AAChC,IAAM,mBAAA,GAAsB;AAyH5B,SAAS,cAAA,CACd,KAAA,EACA,QAAA,EACA,IAAA,EACgB;AAChB,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,mBAAA;AAAA,IACT,OAAA,EAAS,uBAAA;AAAA,IACT,QAAA,EAAU,WAAW,EAAE,GAAG,UAAU,SAAA,EAAW,IAAA,CAAK,GAAA,EAAI,EAAE,GAAI,MAAA;AAAA;AAAA;AAAA,IAG9D,GAAI,KAAA,CAAM,MAAA,IAAU,KAAA,CAAM,MAAA,CAAO,MAAA,GAAS,CAAA,GAAI,EAAE,MAAA,EAAQ,KAAA,CAAM,MAAA,EAAO,GAAI,EAAC;AAAA,IAC1E,KAAA,EAAO;AAAA,MACL,KAAA,EAAO,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,YAAY,CAAA;AAAA,MACnC,KAAA,EAAO,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,YAAY;AAAA,KACrC;AAAA,IACA;AAAA,GACF;AACF;AAEA,SAAS,aAAa,CAAA,EAAiC;AACrD,EAAA,MAAM,IAAA,GAAY,CAAA,CAAE,IAAA,IAAQ,EAAC;AAC7B,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,IAAA,IAAQ,CAAA,CAAE,IAAA,IAAQ,QAAA;AAIxC,EAAA,MAAM,QAAQ,gBAAA,CAAiB,CAAA,EAAG,WAAA,CAAY,QAAQ,KAAK,MAAS,CAAA;AACpE,EAAA,MAAM,IAAA,GAAO,CAAA;AACb,EAAA,OAAO;AAAA,IACL,IAAI,CAAA,CAAE,EAAA;AAAA,IACN,IAAA,EAAM,QAAA;AAAA,IACN,QAAA,EAAU,EAAE,CAAA,EAAG,CAAA,CAAE,SAAS,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,QAAA,CAAS,CAAA,EAAE;AAAA,IAC7C,OAAO,IAAA,CAAK,KAAA;AAAA,IACZ,aAAa,IAAA,CAAK,WAAA;AAAA,IAClB,GAAI,OAAO,IAAA,CAAK,WAAA,KAAgB,QAAA,IAAY,IAAA,CAAK,WAAA,KAAgB,EAAA,GAAK,EAAE,WAAA,EAAa,IAAA,CAAK,WAAA,KAAgB,EAAC;AAAA,IAC3G,GAAI,OAAO,IAAA,CAAK,WAAA,KAAgB,QAAA,IAAY,IAAA,CAAK,WAAA,KAAgB,EAAA,GAAK,EAAE,WAAA,EAAa,IAAA,CAAK,WAAA,KAAgB,EAAC;AAAA,IAC3G,QAAQ,IAAA,CAAK,MAAA;AAAA,IACb,QAAQ,KAAA,CAAM,MAAA;AAAA,IACd,SAAS,KAAA,CAAM,OAAA;AAAA;AAAA;AAAA,IAGf,GAAI,KAAK,QAAA,GAAW,EAAE,UAAU,IAAA,CAAK,QAAA,KAAa,EAAC;AAAA,IACnD,GAAI,KAAK,MAAA,GAAS,EAAE,QAAQ,IAAA,CAAK,MAAA,KAAW,EAAC;AAAA,IAC7C,GAAI,OAAO,IAAA,CAAK,KAAA,KAAU,QAAA,GAAW,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAM,GAAI,EAAC;AAAA,IAC9D,GAAI,OAAO,IAAA,CAAK,MAAA,KAAW,QAAA,GAAW,EAAE,MAAA,EAAQ,IAAA,CAAK,MAAA,EAAO,GAAI,EAAC;AAAA,IACjE,GAAI,KAAK,KAAA,GAAQ,EAAE,OAAO,IAAA,CAAK,KAAA,KAAU;AAAC,GAC5C;AACF;AAEA,SAAS,aAAa,CAAA,EAAiC;AACrD,EAAA,OAAO;AAAA,IACL,IAAI,CAAA,CAAE,EAAA;AAAA,IACN,QAAQ,CAAA,CAAE,MAAA;AAAA,IACV,QAAQ,CAAA,CAAE,MAAA;AAAA,IACV,YAAA,EAAc,EAAE,YAAA,IAAgB,MAAA;AAAA,IAChC,YAAA,EAAc,EAAE,YAAA,IAAgB,MAAA;AAAA,IAChC,OAAO,OAAO,CAAA,CAAE,KAAA,KAAU,QAAA,GAAW,EAAE,KAAA,GAAQ;AAAA,GACjD;AACF;AAoBO,IAAM,aAA4C,EAAC;AA8BnD,SAAS,aAAA,CACd,MAAA,EACA,KAAA,GAAuC,UAAA,EAC9B;AACT,EAAA,IAAI,CAAC,MAAA,IAAU,OAAO,MAAA,KAAW,UAAU,OAAO,MAAA;AAElD,EAAA,MAAM,GAAA,GAAM,MAAA;AACZ,EAAA,IAAI,UAAU,GAAA,CAAI,OAAA;AAElB,EAAA,IAAI,OAAO,YAAY,QAAA,IAAY,CAAC,OAAO,SAAA,CAAU,OAAO,CAAA,IAAK,OAAA,IAAW,uBAAA,EAAyB;AACnG,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,IAAI,GAAA,GAAM,GAAA;AACV,EAAA,OAAO,UAAU,uBAAA,EAAyB;AACxC,IAAA,MAAM,IAAA,GAAO,MAAM,OAAO,CAAA;AAC1B,IAAA,IAAI,CAAC,MAAM,OAAO,GAAA;AAElB,IAAA,GAAA,GAAM,KAAK,GAAG,CAAA;AACd,IAAA,OAAA,IAAW,CAAA;AACX,IAAA,GAAA,CAAI,OAAA,GAAU,OAAA;AAAA,EAChB;AAEA,EAAA,OAAO,GAAA;AACT;AAOO,SAAS,cAAA,CAAe,MAAA,EAAiB,OAAA,GAAyB,EAAC,EAAiB;AACzF,EAAA,MAAM,SAAwB,EAAC;AAC/B,EAAA,MAAM,OAAA,GAAU,QAAQ,OAAA,KAAY,IAAA;AACpC,EAAA,MAAA,GAAS,cAAc,MAAM,CAAA;AAE7B,EAAA,IAAI,CAAC,MAAA,IAAU,OAAO,MAAA,KAAW,QAAA,EAAU;AACzC,IAAA,OAAO,EAAE,IAAI,KAAA,EAAO,KAAA,EAAO,EAAE,KAAA,EAAO,IAAI,KAAA,EAAO,IAAG,EAAG,MAAA,EAAQ,CAAC,EAAE,KAAA,EAAO,SAAS,OAAA,EAAS,0BAAA,EAA4B,CAAA,EAAE;AAAA,EACzH;AACA,EAAA,MAAM,CAAA,GAAI,MAAA;AAQV,EAAA,IAAI,CAAA,CAAE,YAAY,uBAAA,EAAyB;AACzC,IAAA,MAAA,CAAO,IAAA,CAAK;AAAA,MACV,KAAA,EAAO,OAAA;AAAA,MACP,OAAA,EAAS,CAAA,qCAAA,EAAwC,CAAA,CAAE,OAAO,cAAc,uBAAuB,CAAA,CAAA;AAAA,KAChG,CAAA;AACD,IAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,EAAE,KAAA,EAAO,EAAC,EAAG,KAAA,EAAO,EAAC,EAAE,EAAG,MAAA,EAAO;AAAA,EAC9D;AAEA,EAAA,MAAM,QAAA,GAAW,CAAA,CAAE,KAAA,EAAO,KAAA,IAAS,EAAC;AACpC,EAAA,MAAM,QAAA,GAAW,CAAA,CAAE,KAAA,EAAO,KAAA,IAAS,EAAC;AAEpC,EAAA,MAAM,KAAA,GAAoB,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM;AAC5C,IAAA,MAAM,IAAA,GAAO,WAAA,CAAY,CAAA,CAAE,IAAI,CAAA;AAC/B,IAAA,IAAI,CAAC,IAAA,EAAM;AACT,MAAA,MAAA,CAAO,IAAA,CAAK;AAAA,QACV,KAAA,EAAO,UAAU,SAAA,GAAY,OAAA;AAAA,QAC7B,QAAQ,CAAA,CAAE,EAAA;AAAA,QACV,OAAA,EAAS,CAAA,cAAA,EAAiB,CAAA,CAAE,IAAI,CAAA,sCAAA;AAAA,OACjC,CAAA;AAAA,IACH;AACA,IAAA,MAAM,SAAS,CAAA,CAAE,MAAA,KAAW,OAAO,gBAAA,CAAiB,IAAI,IAAI,EAAC,CAAA;AAC7D,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,KAAA,MAAW,GAAA,IAAO,cAAA,CAAe,IAAA,EAAM,MAAM,CAAA,EAAG;AAC9C,QAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAA,EAAO,SAAA,EAAW,QAAQ,CAAA,CAAE,EAAA,EAAI,OAAA,EAAS,CAAA,EAAG,IAAI,GAAG,CAAA,EAAA,EAAK,GAAA,CAAI,OAAO,IAAI,CAAA;AAAA,MACvF;AAAA,IACF;AAIA,IAAA,MAAM,MAAA,GAAS,IAAA,EAAM,IAAA,IAAQ,CAAA,CAAE,IAAA;AAC/B,IAAA,OAAO;AAAA,MACL,IAAI,CAAA,CAAE,EAAA;AAAA,MACN,IAAA,EAAM,MAAA;AAAA,MACN,QAAA,EAAU,EAAE,CAAA,EAAG,CAAA,CAAE,QAAA,EAAU,CAAA,IAAK,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,QAAA,EAAU,CAAA,IAAK,CAAA,EAAE;AAAA;AAAA,MAEzD,GAAI,EAAE,QAAA,GAAW,EAAE,UAAU,CAAA,CAAE,QAAA,KAAa,EAAC;AAAA,MAC7C,GAAI,EAAE,MAAA,GAAS,EAAE,QAAQ,CAAA,CAAE,MAAA,KAAW,EAAC;AAAA,MACvC,GAAI,OAAO,CAAA,CAAE,KAAA,KAAU,QAAA,GAAW,EAAE,KAAA,EAAO,CAAA,CAAE,KAAA,EAAM,GAAI,EAAC;AAAA,MACxD,GAAI,OAAO,CAAA,CAAE,MAAA,KAAW,QAAA,GAAW,EAAE,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAO,GAAI,EAAC;AAAA,MAC3D,GAAI,EAAE,KAAA,GAAQ,EAAE,OAAO,CAAA,CAAE,KAAA,KAAU,EAAC;AAAA,MACpC,IAAA,EAAM;AAAA,QACJ,IAAA,EAAM,MAAA;AAAA,QACN,KAAA,EAAO,CAAA,CAAE,KAAA,IAAS,IAAA,EAAM,SAAS,CAAA,CAAE,IAAA;AAAA,QACnC,aAAa,CAAA,CAAE,WAAA;AAAA,QACf,GAAI,EAAE,WAAA,GAAc,EAAE,aAAa,CAAA,CAAE,WAAA,KAAgB,EAAC;AAAA,QACtD,GAAI,EAAE,WAAA,GAAc,EAAE,aAAa,CAAA,CAAE,WAAA,KAAgB,EAAC;AAAA,QACtD,MAAA;AAAA;AAAA;AAAA,QAGA,GAAI,EAAE,MAAA,GAAS,EAAE,QAAQ,CAAA,CAAE,MAAA,KAAW,EAAC;AAAA,QACvC,GAAI,EAAE,OAAA,GAAU,EAAE,SAAS,CAAA,CAAE,OAAA,KAAY;AAAC;AAC5C,KACF;AAAA,EACF,CAAC,CAAA;AAED,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE,CAAC,CAAA;AAC9C,EAAA,MAAM,KAAA,GAAoB,QAAA,CACvB,GAAA,CAAI,CAAC,CAAA,KAAM;AACV,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,MAAM,CAAA,EAAG;AAC1B,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAA,EAAO,SAAA,EAAW,MAAA,EAAQ,CAAA,CAAE,EAAA,EAAI,OAAA,EAAS,CAAA,aAAA,EAAgB,CAAA,CAAE,MAAM,CAAA,YAAA,CAAA,EAAgB,CAAA;AAC/F,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,MAAM,CAAA,EAAG;AAC1B,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAA,EAAO,SAAA,EAAW,MAAA,EAAQ,CAAA,CAAE,EAAA,EAAI,OAAA,EAAS,CAAA,aAAA,EAAgB,CAAA,CAAE,MAAM,CAAA,YAAA,CAAA,EAAgB,CAAA;AAC/F,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,OAAO;AAAA,MACL,IAAI,CAAA,CAAE,EAAA;AAAA,MACN,QAAQ,CAAA,CAAE,MAAA;AAAA,MACV,QAAQ,CAAA,CAAE,MAAA;AAAA,MACV,cAAc,CAAA,CAAE,YAAA;AAAA,MAChB,cAAc,CAAA,CAAE,YAAA;AAAA,MAChB,OAAO,CAAA,CAAE;AAAA,KACX;AAAA,EACF,CAAC,CAAA,CACA,MAAA,CAAO,CAAC,CAAA,KAAqB,MAAM,IAAI,CAAA;AAW1C,EAAA,MAAA,CAAO,KAAK,GAAG,sBAAA,CAAuB,EAAE,KAAA,EAAO,KAAA,EAAO,CAAC,CAAA;AAEvD,EAAA,MAAM,KAAK,MAAA,CAAO,KAAA,CAAM,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,OAAO,CAAA;AAKlD,EAAA,MAAM,iBAAiB,KAAA,CAAM,OAAA,CAAQ,EAAE,MAAM,CAAA,GACxC,EAAE,MAAA,CAA2B,MAAA;AAAA,IAC5B,CAAC,UACC,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,IAAY,OAAQ,KAAA,CAAwB,IAAA,KAAS;AAAA,GAC5F,GACA,MAAA;AAEJ,EAAA,OAAO;AAAA,IACL,EAAA;AAAA,IACA,KAAA,EAAO;AAAA,MACL,KAAA;AAAA,MACA,KAAA;AAAA,MACA,GAAI,kBAAkB,cAAA,CAAe,MAAA,GAAS,IAAI,EAAE,MAAA,EAAQ,cAAA,EAAe,GAAI;AAAC,KAClF;AAAA,IACA;AAAA,GACF;AACF;AAGO,SAAS,eAAe,MAAA,EAA8B;AAC3D,EAAA,OAAO,IAAI,IAAA,CAAK,CAAC,IAAA,CAAK,SAAA,CAAU,MAAA,EAAQ,IAAA,EAAM,CAAC,CAAC,CAAA,EAAG,EAAE,IAAA,EAAM,oBAAoB,CAAA;AACjF","file":"chunk-OOQ2MMBE.js","sourcesContent":["import type { FlowEdge, FlowGraph, FlowNode, PortDescriptor, WorkflowInput } from \"../types\";\nimport { checkGraphConnectivity } from \"../analysis/graph-connectivity\";\nimport { defaultConfigFor, getNodeKind, validateConfig } from \"../registry/registry\";\nimport { resolveNodePorts } from \"../registry/ports\";\n\n/** Schema version. Bump on breaking shape changes; add migrations as needed. */\nexport const WORKFLOW_SCHEMA_VERSION = 1 as const;\nexport const WORKFLOW_SCHEMA_URL = \"https://particle.academy/schemas/workflow/v1.json\";\n\nexport type WorkflowSchema = {\n  $schema: typeof WORKFLOW_SCHEMA_URL;\n  version: typeof WORKFLOW_SCHEMA_VERSION;\n  metadata?: WorkflowMetadata;\n  /**\n   * What this workflow accepts at run start, passed BY NAME.\n   *\n   * Lives beside `graph` rather than inside it because it describes the\n   * workflow's CONTRACT, not its topology: a caller reads this to know what to\n   * pass, and reading it should not mean walking nodes looking for a trigger.\n   *\n   * Omitted entirely when a workflow takes none, so every existing saved\n   * document is unchanged byte for byte.\n   */\n  inputs?: WorkflowInput[];\n  graph: {\n    nodes: WorkflowSchemaNode[];\n    edges: WorkflowSchemaEdge[];\n  };\n  view?: {\n    viewport?: { x: number; y: number; zoom: number };\n  };\n};\n\nexport type WorkflowMetadata = {\n  id?: string;\n  name?: string;\n  description?: string;\n  createdAt?: number;\n  updatedAt?: number;\n  author?: string;\n  tags?: string[];\n};\n\nexport type WorkflowSchemaNode = {\n  id: string;\n  /** Registry kind name (e.g. \"memory_store\"). */\n  kind: string;\n  position: { x: number; y: number };\n  label?: string;\n  description?: string;\n  /**\n   * Announced to a person just before / just after this node runs. Omitted\n   * entirely when unset, so a graph of ordinary plumbing nodes does not carry\n   * a pair of empty keys per node and every diff of a saved graph stays\n   * readable.\n   */\n  startingMsg?: string;\n  stoppingMsg?: string;\n  config?: Record<string, unknown>;\n  /**\n   * Resolved ports, written on export.\n   *\n   * A kind may derive its ports from config (`switch_case` cases,\n   * `llm_branch` routes), and that derivation is a JavaScript function — a\n   * runtime in another language cannot execute it. Without the resolved ports\n   * in the document, the PHP twin sees no declared outputs and falls back to a\n   * single `out`, so every branch edge in an exported flow silently stops\n   * firing. Serializing them keeps the schema self-describing and preserves\n   * the cross-runtime guarantee: same JSON in, same routing out.\n   *\n   * Optional and additive — a hand-written schema may omit them, and each\n   * runtime then falls back to its own kind registry.\n   */\n  inputs?: PortDescriptor[];\n  outputs?: PortDescriptor[];\n  /**\n   * Node grouping and visual layout — additive + optional. `parentId`/`extent`\n   * say which container a node sits in (swimlanes); `width`/`height` carry an\n   * explicit (resized) size; `style` carries inline presentation.\n   *\n   * **`parentId` is NOT decoration, and a runtime that drops it is wrong.** It\n   * decides which terminal a node talks to — a terminal lane owns one session\n   * and membership is this field, deliberately, so there is no second copy of\n   * the grouping in each node's config to drift from what the canvas shows.\n   *\n   * This comment used to say these fields exist \"purely for the canvas\", so a\n   * runtime that only walks edges and ports could ignore all of them. The\n   * Python twin read that literally and carried none of them: a graph loaded\n   * there and saved back lost every grouping a person had drawn, silently. The\n   * sentence was true when it was written and became false without being\n   * revisited, which is the more common way a comment does harm.\n   *\n   * An older reader that does not know these fields still drops them — that is\n   * forward-compatibility, not permission.\n   */\n  parentId?: string;\n  extent?: \"parent\" | [[number, number], [number, number]];\n  width?: number;\n  height?: number;\n  style?: Record<string, unknown>;\n};\n\nexport type WorkflowSchemaEdge = {\n  id: string;\n  source: string;\n  target: string;\n  sourceHandle?: string;\n  targetHandle?: string;\n  label?: string;\n};\n\nexport type ImportIssue = {\n  level: \"error\" | \"warning\";\n  nodeId?: string;\n  edgeId?: string;\n  message: string;\n};\n\nexport type ImportResult = {\n  graph: FlowGraph;\n  issues: ImportIssue[];\n  /** True when the import produced a usable graph (errors may have been\n   *  rewritten to warnings via `lenient: true`, except an unsupported schema\n   *  version, which is always an error). */\n  ok: boolean;\n};\n\n/** Snapshot the in-memory graph as a portable WorkflowSchema. */\nexport function exportWorkflow(\n  graph: FlowGraph,\n  metadata?: WorkflowMetadata,\n  view?: WorkflowSchema[\"view\"],\n): WorkflowSchema {\n  return {\n    $schema: WORKFLOW_SCHEMA_URL,\n    version: WORKFLOW_SCHEMA_VERSION,\n    metadata: metadata ? { ...metadata, updatedAt: Date.now() } : undefined,\n    // Round-trips, or a saved workflow silently forgets its own contract and\n    // every caller's props become \"unknown input\" on the next load.\n    ...(graph.inputs && graph.inputs.length > 0 ? { inputs: graph.inputs } : {}),\n    graph: {\n      nodes: graph.nodes.map(toSchemaNode),\n      edges: graph.edges.map(toSchemaEdge),\n    },\n    view,\n  };\n}\n\nfunction toSchemaNode(n: FlowNode): WorkflowSchemaNode {\n  const data: any = n.data ?? {};\n  const kindName = data.kind ?? n.type ?? \"custom\";\n  // Resolve through the same helper the canvas and runtime use, so a\n  // config-driven kind writes its ACTUAL ports into the document instead of\n  // leaving another language's runtime to guess at them.\n  const ports = resolveNodePorts(n, getNodeKind(kindName) ?? undefined);\n  const node = n as any;\n  return {\n    id: n.id,\n    kind: kindName,\n    position: { x: n.position.x, y: n.position.y },\n    label: data.label,\n    description: data.description,\n    ...(typeof data.startingMsg === \"string\" && data.startingMsg !== \"\" ? { startingMsg: data.startingMsg } : {}),\n    ...(typeof data.stoppingMsg === \"string\" && data.stoppingMsg !== \"\" ? { stoppingMsg: data.stoppingMsg } : {}),\n    config: data.config,\n    inputs: ports.inputs,\n    outputs: ports.outputs,\n    // Visual layout — only when explicitly set (never persist auto-`measured`\n    // dimensions, which are derived, not authored).\n    ...(node.parentId ? { parentId: node.parentId } : {}),\n    ...(node.extent ? { extent: node.extent } : {}),\n    ...(typeof node.width === \"number\" ? { width: node.width } : {}),\n    ...(typeof node.height === \"number\" ? { height: node.height } : {}),\n    ...(node.style ? { style: node.style } : {}),\n  };\n}\n\nfunction toSchemaEdge(e: FlowEdge): WorkflowSchemaEdge {\n  return {\n    id: e.id,\n    source: e.source,\n    target: e.target,\n    sourceHandle: e.sourceHandle ?? undefined,\n    targetHandle: e.targetHandle ?? undefined,\n    label: typeof e.label === \"string\" ? e.label : undefined,\n  };\n}\n\nexport type ImportOptions = {\n  /** When true, unknown kinds become warnings + a \"custom\" placeholder\n   *  instead of errors. Default false. It never softens the schema version:\n   *  a document that is not `version: 1` (after migration) is refused either\n   *  way, because no runtime can honour a format it does not know. */\n  lenient?: boolean;\n};\n\n/** A migration step: takes a version-N document to version N+1. */\nexport type MigrationStep = (schema: Record<string, unknown>) => Record<string, unknown>;\n\n/**\n * Every migration step, keyed by the version it upgrades FROM.\n *\n * Empty today because v1 is current — when a BREAKING bump lands, add the step\n * here and every stored document upgrades on read, in this runtime and its\n * PHP and Python twins.\n */\nexport const MIGRATIONS: Record<number, MigrationStep> = {};\n\n/**\n * Migrate a raw schema object up to the current version, as far as it can go.\n *\n * Additive changes need no migration — an older document simply lacks the newer\n * optional fields. This is the seam for a future BREAKING bump, and\n * `importWorkflow` runs it before validating the version.\n *\n * ## The three rules, each with a reason\n *\n *  - **A PAST version migrates forward**, step by step, to the current one.\n *  - **A FUTURE version is left ALONE.** We cannot know what a later schema\n *    means, and migrating downward would be guessing. Untouched hands it to the\n *    version check, which reports it honestly.\n *  - **A GAP in the table is left alone too.** A missing step is not a licence\n *    to guess.\n *\n * ## Why `steps` is a parameter\n *\n * With only v1 in existence there is no old document to migrate, so a seam\n * tested against the built-in (empty) table is a check that CANNOT fail — it\n * would pass identically against a function that returned its input untouched,\n * which is what this was until the twins needed the same seam.\n *\n * The PHP and Python runtimes carry the identical shape. That mattered more\n * than it sounds: they had no migration at all and errored on any version\n * mismatch, so a v2 bump would have made every stored Op unreadable on exactly\n * the runtimes where durable runs resume.\n */\nexport function migrateSchema(\n  schema: unknown,\n  steps: Record<number, MigrationStep> = MIGRATIONS,\n): unknown {\n  if (!schema || typeof schema !== \"object\") return schema;\n\n  const doc = schema as Record<string, unknown>;\n  let version = doc.version;\n\n  if (typeof version !== \"number\" || !Number.isInteger(version) || version >= WORKFLOW_SCHEMA_VERSION) {\n    return schema;\n  }\n\n  let out = doc;\n  while (version < WORKFLOW_SCHEMA_VERSION) {\n    const step = steps[version];\n    if (!step) return out;\n\n    out = step(out);\n    version += 1;\n    out.version = version;\n  }\n\n  return out;\n}\n\n/**\n * Hydrate a schema into runtime FlowGraph + validate kinds/configs against\n * the registry. Reports issues for unknown kinds, missing required config,\n * and dangling edges.\n */\nexport function importWorkflow(schema: unknown, options: ImportOptions = {}): ImportResult {\n  const issues: ImportIssue[] = [];\n  const lenient = options.lenient === true;\n  schema = migrateSchema(schema);\n\n  if (!schema || typeof schema !== \"object\") {\n    return { ok: false, graph: { nodes: [], edges: [] }, issues: [{ level: \"error\", message: \"Schema is not an object.\" }] };\n  }\n  const s = schema as Partial<WorkflowSchema>;\n  // NEVER softened by `lenient`. That flag is about unknown VOCABULARY (a kind\n  // this host has not registered); a version is the format itself, and a\n  // runtime cannot honour a format it does not know. It used to become a\n  // warning, and fancy-flow-php imports leniently on every run(), so one\n  // versionless document ran in Laravel and was refused by a default (strict)\n  // import here. Past versions were migrated above, so anything still unequal\n  // is refused.\n  if (s.version !== WORKFLOW_SCHEMA_VERSION) {\n    issues.push({\n      level: \"error\",\n      message: `Unsupported workflow schema version: ${s.version} (expected ${WORKFLOW_SCHEMA_VERSION})`,\n    });\n    return { ok: false, graph: { nodes: [], edges: [] }, issues };\n  }\n\n  const rawNodes = s.graph?.nodes ?? [];\n  const rawEdges = s.graph?.edges ?? [];\n\n  const nodes: FlowNode[] = rawNodes.map((n) => {\n    const kind = getNodeKind(n.kind);\n    if (!kind) {\n      issues.push({\n        level: lenient ? \"warning\" : \"error\",\n        nodeId: n.id,\n        message: `Unknown kind \"${n.kind}\" — register it before importing.`,\n      });\n    }\n    const config = n.config ?? (kind ? defaultConfigFor(kind) : {});\n    if (kind) {\n      for (const iss of validateConfig(kind, config)) {\n        issues.push({ level: \"warning\", nodeId: n.id, message: `${iss.key}: ${iss.message}` });\n      }\n    }\n    // Canonicalise on the way in: a document may carry a pre-namespace id, and\n    // rewriting it here means the graph converges on the canonical id the next\n    // time it is saved, rather than carrying the ambiguous name forever.\n    const kindId = kind?.name ?? n.kind;\n    return {\n      id: n.id,\n      type: kindId,\n      position: { x: n.position?.x ?? 0, y: n.position?.y ?? 0 },\n      // Rehydrate visual layout onto the node's top level (where xyflow reads it).\n      ...(n.parentId ? { parentId: n.parentId } : {}),\n      ...(n.extent ? { extent: n.extent } : {}),\n      ...(typeof n.width === \"number\" ? { width: n.width } : {}),\n      ...(typeof n.height === \"number\" ? { height: n.height } : {}),\n      ...(n.style ? { style: n.style } : {}),\n      data: {\n        kind: kindId,\n        label: n.label ?? kind?.label ?? n.kind,\n        description: n.description,\n        ...(n.startingMsg ? { startingMsg: n.startingMsg } : {}),\n        ...(n.stoppingMsg ? { stoppingMsg: n.stoppingMsg } : {}),\n        config,\n        // Carry serialized ports back onto the node so a round-trip is stable\n        // and an unknown kind still routes the way the document described.\n        ...(n.inputs ? { inputs: n.inputs } : {}),\n        ...(n.outputs ? { outputs: n.outputs } : {}),\n      } as any,\n    };\n  });\n\n  const nodeIds = new Set(nodes.map((n) => n.id));\n  const edges: FlowEdge[] = rawEdges\n    .map((e) => {\n      if (!nodeIds.has(e.source)) {\n        issues.push({ level: \"warning\", edgeId: e.id, message: `Edge source \"${e.source}\" not found.` });\n        return null;\n      }\n      if (!nodeIds.has(e.target)) {\n        issues.push({ level: \"warning\", edgeId: e.id, message: `Edge target \"${e.target}\" not found.` });\n        return null;\n      }\n      return {\n        id: e.id,\n        source: e.source,\n        target: e.target,\n        sourceHandle: e.sourceHandle,\n        targetHandle: e.targetHandle,\n        label: e.label,\n      } as FlowEdge;\n    })\n    .filter((e): e is FlowEdge => e !== null);\n\n  // WIRING, not merely dataflow: a node no edge reaches and that reaches no\n  // edge, and an edge reading from a node that publishes nothing.\n  //\n  // Deliberately AFTER the edge loop, so it sees the same edges the engine will\n  // -- a dangling edge is dropped with a warning above, and running this first\n  // would let a dropped edge count as a connection.\n  //\n  // Deliberately NOT gated on `lenient`. That flag is about unknown VOCABULARY\n  // (a kind this host has not registered), never about wiring.\n  issues.push(...checkGraphConnectivity({ nodes, edges }));\n\n  const ok = issues.every((i) => i.level !== \"error\");\n  // The declaration comes back with the graph. Dropping it on import would be\n  // the worse half of losing it on export: the document still says what it\n  // accepts, the loaded graph does not, and every prop a caller passes becomes\n  // \"unknown input\" — an error pointing at the caller for a bug in the loader.\n  const declaredInputs = Array.isArray(s.inputs)\n    ? (s.inputs as WorkflowInput[]).filter(\n        (input): input is WorkflowInput =>\n          input !== null && typeof input === \"object\" && typeof (input as WorkflowInput).name === \"string\",\n      )\n    : undefined;\n\n  return {\n    ok,\n    graph: {\n      nodes,\n      edges,\n      ...(declaredInputs && declaredInputs.length > 0 ? { inputs: declaredInputs } : {}),\n    },\n    issues,\n  };\n}\n\n/** Convenience: serialize a schema as a downloadable JSON Blob. */\nexport function workflowToBlob(schema: WorkflowSchema): Blob {\n  return new Blob([JSON.stringify(schema, null, 2)], { type: \"application/json\" });\n}\n"]}
+{"version":3,"sources":["../src/schema/workflow-schema.ts"],"names":[],"mappings":";;;;AAMO,IAAM,uBAAA,GAA0B;AAChC,IAAM,mBAAA,GAAsB;AAyH5B,SAAS,cAAA,CACd,KAAA,EACA,QAAA,EACA,IAAA,EACgB;AAChB,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,mBAAA;AAAA,IACT,OAAA,EAAS,uBAAA;AAAA,IACT,QAAA,EAAU,WAAW,EAAE,GAAG,UAAU,SAAA,EAAW,IAAA,CAAK,GAAA,EAAI,EAAE,GAAI,MAAA;AAAA;AAAA;AAAA,IAG9D,GAAI,KAAA,CAAM,MAAA,IAAU,KAAA,CAAM,MAAA,CAAO,MAAA,GAAS,CAAA,GAAI,EAAE,MAAA,EAAQ,KAAA,CAAM,MAAA,EAAO,GAAI,EAAC;AAAA,IAC1E,KAAA,EAAO;AAAA,MACL,KAAA,EAAO,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,YAAY,CAAA;AAAA,MACnC,KAAA,EAAO,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,YAAY;AAAA,KACrC;AAAA,IACA;AAAA,GACF;AACF;AAEA,SAAS,aAAa,CAAA,EAAiC;AACrD,EAAA,MAAM,IAAA,GAAY,CAAA,CAAE,IAAA,IAAQ,EAAC;AAC7B,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,IAAA,IAAQ,CAAA,CAAE,IAAA,IAAQ,QAAA;AAIxC,EAAA,MAAM,QAAQ,gBAAA,CAAiB,CAAA,EAAG,WAAA,CAAY,QAAQ,KAAK,MAAS,CAAA;AACpE,EAAA,MAAM,IAAA,GAAO,CAAA;AACb,EAAA,OAAO;AAAA,IACL,IAAI,CAAA,CAAE,EAAA;AAAA,IACN,IAAA,EAAM,QAAA;AAAA,IACN,QAAA,EAAU,EAAE,CAAA,EAAG,CAAA,CAAE,SAAS,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,QAAA,CAAS,CAAA,EAAE;AAAA,IAC7C,OAAO,IAAA,CAAK,KAAA;AAAA,IACZ,aAAa,IAAA,CAAK,WAAA;AAAA,IAClB,GAAI,OAAO,IAAA,CAAK,WAAA,KAAgB,QAAA,IAAY,IAAA,CAAK,WAAA,KAAgB,EAAA,GAAK,EAAE,WAAA,EAAa,IAAA,CAAK,WAAA,KAAgB,EAAC;AAAA,IAC3G,GAAI,OAAO,IAAA,CAAK,WAAA,KAAgB,QAAA,IAAY,IAAA,CAAK,WAAA,KAAgB,EAAA,GAAK,EAAE,WAAA,EAAa,IAAA,CAAK,WAAA,KAAgB,EAAC;AAAA,IAC3G,QAAQ,IAAA,CAAK,MAAA;AAAA,IACb,QAAQ,KAAA,CAAM,MAAA;AAAA,IACd,SAAS,KAAA,CAAM,OAAA;AAAA;AAAA;AAAA,IAGf,GAAI,KAAK,QAAA,GAAW,EAAE,UAAU,IAAA,CAAK,QAAA,KAAa,EAAC;AAAA,IACnD,GAAI,KAAK,MAAA,GAAS,EAAE,QAAQ,IAAA,CAAK,MAAA,KAAW,EAAC;AAAA,IAC7C,GAAI,OAAO,IAAA,CAAK,KAAA,KAAU,QAAA,GAAW,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAM,GAAI,EAAC;AAAA,IAC9D,GAAI,OAAO,IAAA,CAAK,MAAA,KAAW,QAAA,GAAW,EAAE,MAAA,EAAQ,IAAA,CAAK,MAAA,EAAO,GAAI,EAAC;AAAA,IACjE,GAAI,KAAK,KAAA,GAAQ,EAAE,OAAO,IAAA,CAAK,KAAA,KAAU;AAAC,GAC5C;AACF;AAEA,SAAS,aAAa,CAAA,EAAiC;AACrD,EAAA,OAAO;AAAA,IACL,IAAI,CAAA,CAAE,EAAA;AAAA,IACN,QAAQ,CAAA,CAAE,MAAA;AAAA,IACV,QAAQ,CAAA,CAAE,MAAA;AAAA,IACV,YAAA,EAAc,EAAE,YAAA,IAAgB,MAAA;AAAA,IAChC,YAAA,EAAc,EAAE,YAAA,IAAgB,MAAA;AAAA,IAChC,OAAO,OAAO,CAAA,CAAE,KAAA,KAAU,QAAA,GAAW,EAAE,KAAA,GAAQ;AAAA,GACjD;AACF;AAoBO,IAAM,aAA4C,EAAC;AA8BnD,SAAS,aAAA,CACd,MAAA,EACA,KAAA,GAAuC,UAAA,EAC9B;AACT,EAAA,IAAI,CAAC,MAAA,IAAU,OAAO,MAAA,KAAW,UAAU,OAAO,MAAA;AAElD,EAAA,MAAM,GAAA,GAAM,MAAA;AACZ,EAAA,IAAI,UAAU,GAAA,CAAI,OAAA;AAElB,EAAA,IAAI,OAAO,YAAY,QAAA,IAAY,CAAC,OAAO,SAAA,CAAU,OAAO,CAAA,IAAK,OAAA,IAAW,uBAAA,EAAyB;AACnG,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,IAAI,GAAA,GAAM,GAAA;AACV,EAAA,OAAO,UAAU,uBAAA,EAAyB;AACxC,IAAA,MAAM,IAAA,GAAO,MAAM,OAAO,CAAA;AAC1B,IAAA,IAAI,CAAC,MAAM,OAAO,GAAA;AAElB,IAAA,GAAA,GAAM,KAAK,GAAG,CAAA;AACd,IAAA,OAAA,IAAW,CAAA;AACX,IAAA,GAAA,CAAI,OAAA,GAAU,OAAA;AAAA,EAChB;AAEA,EAAA,OAAO,GAAA;AACT;AAOO,SAAS,cAAA,CAAe,MAAA,EAAiB,OAAA,GAAyB,EAAC,EAAiB;AACzF,EAAA,MAAM,SAAwB,EAAC;AAC/B,EAAA,MAAM,OAAA,GAAU,QAAQ,OAAA,KAAY,IAAA;AACpC,EAAA,MAAA,GAAS,cAAc,MAAM,CAAA;AAE7B,EAAA,IAAI,CAAC,MAAA,IAAU,OAAO,MAAA,KAAW,QAAA,EAAU;AACzC,IAAA,OAAO,EAAE,IAAI,KAAA,EAAO,KAAA,EAAO,EAAE,KAAA,EAAO,IAAI,KAAA,EAAO,IAAG,EAAG,MAAA,EAAQ,CAAC,EAAE,KAAA,EAAO,SAAS,OAAA,EAAS,0BAAA,EAA4B,CAAA,EAAE;AAAA,EACzH;AACA,EAAA,MAAM,CAAA,GAAI,MAAA;AAQV,EAAA,IAAI,CAAA,CAAE,YAAY,uBAAA,EAAyB;AACzC,IAAA,MAAA,CAAO,IAAA,CAAK;AAAA,MACV,KAAA,EAAO,OAAA;AAAA,MACP,OAAA,EAAS,CAAA,qCAAA,EAAwC,CAAA,CAAE,OAAO,cAAc,uBAAuB,CAAA,CAAA;AAAA,KAChG,CAAA;AACD,IAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,EAAE,KAAA,EAAO,EAAC,EAAG,KAAA,EAAO,EAAC,EAAE,EAAG,MAAA,EAAO;AAAA,EAC9D;AAEA,EAAA,MAAM,QAAA,GAAW,CAAA,CAAE,KAAA,EAAO,KAAA,IAAS,EAAC;AACpC,EAAA,MAAM,QAAA,GAAW,CAAA,CAAE,KAAA,EAAO,KAAA,IAAS,EAAC;AAEpC,EAAA,MAAM,KAAA,GAAoB,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM;AAC5C,IAAA,MAAM,IAAA,GAAO,WAAA,CAAY,CAAA,CAAE,IAAI,CAAA;AAC/B,IAAA,IAAI,CAAC,IAAA,EAAM;AACT,MAAA,MAAA,CAAO,IAAA,CAAK;AAAA,QACV,KAAA,EAAO,UAAU,SAAA,GAAY,OAAA;AAAA,QAC7B,QAAQ,CAAA,CAAE,EAAA;AAAA,QACV,OAAA,EAAS,CAAA,cAAA,EAAiB,CAAA,CAAE,IAAI,CAAA,sCAAA;AAAA,OACjC,CAAA;AAAA,IACH;AACA,IAAA,MAAM,SAAS,CAAA,CAAE,MAAA,KAAW,OAAO,gBAAA,CAAiB,IAAI,IAAI,EAAC,CAAA;AAC7D,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,KAAA,MAAW,GAAA,IAAO,cAAA,CAAe,IAAA,EAAM,MAAM,CAAA,EAAG;AAC9C,QAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAA,EAAO,SAAA,EAAW,QAAQ,CAAA,CAAE,EAAA,EAAI,OAAA,EAAS,CAAA,EAAG,IAAI,GAAG,CAAA,EAAA,EAAK,GAAA,CAAI,OAAO,IAAI,CAAA;AAAA,MACvF;AAAA,IACF;AAIA,IAAA,MAAM,MAAA,GAAS,IAAA,EAAM,IAAA,IAAQ,CAAA,CAAE,IAAA;AAC/B,IAAA,OAAO;AAAA,MACL,IAAI,CAAA,CAAE,EAAA;AAAA,MACN,IAAA,EAAM,MAAA;AAAA,MACN,QAAA,EAAU,EAAE,CAAA,EAAG,CAAA,CAAE,QAAA,EAAU,CAAA,IAAK,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,QAAA,EAAU,CAAA,IAAK,CAAA,EAAE;AAAA;AAAA,MAEzD,GAAI,EAAE,QAAA,GAAW,EAAE,UAAU,CAAA,CAAE,QAAA,KAAa,EAAC;AAAA,MAC7C,GAAI,EAAE,MAAA,GAAS,EAAE,QAAQ,CAAA,CAAE,MAAA,KAAW,EAAC;AAAA,MACvC,GAAI,OAAO,CAAA,CAAE,KAAA,KAAU,QAAA,GAAW,EAAE,KAAA,EAAO,CAAA,CAAE,KAAA,EAAM,GAAI,EAAC;AAAA,MACxD,GAAI,OAAO,CAAA,CAAE,MAAA,KAAW,QAAA,GAAW,EAAE,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAO,GAAI,EAAC;AAAA,MAC3D,GAAI,EAAE,KAAA,GAAQ,EAAE,OAAO,CAAA,CAAE,KAAA,KAAU,EAAC;AAAA,MACpC,IAAA,EAAM;AAAA,QACJ,IAAA,EAAM,MAAA;AAAA,QACN,KAAA,EAAO,CAAA,CAAE,KAAA,IAAS,IAAA,EAAM,SAAS,CAAA,CAAE,IAAA;AAAA,QACnC,aAAa,CAAA,CAAE,WAAA;AAAA,QACf,GAAI,EAAE,WAAA,GAAc,EAAE,aAAa,CAAA,CAAE,WAAA,KAAgB,EAAC;AAAA,QACtD,GAAI,EAAE,WAAA,GAAc,EAAE,aAAa,CAAA,CAAE,WAAA,KAAgB,EAAC;AAAA,QACtD,MAAA;AAAA;AAAA;AAAA,QAGA,GAAI,EAAE,MAAA,GAAS,EAAE,QAAQ,CAAA,CAAE,MAAA,KAAW,EAAC;AAAA,QACvC,GAAI,EAAE,OAAA,GAAU,EAAE,SAAS,CAAA,CAAE,OAAA,KAAY;AAAC;AAC5C,KACF;AAAA,EACF,CAAC,CAAA;AAED,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE,CAAC,CAAA;AAC9C,EAAA,MAAM,KAAA,GAAoB,QAAA,CACvB,GAAA,CAAI,CAAC,CAAA,KAAM;AACV,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,MAAM,CAAA,EAAG;AAC1B,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAA,EAAO,SAAA,EAAW,MAAA,EAAQ,CAAA,CAAE,EAAA,EAAI,OAAA,EAAS,CAAA,aAAA,EAAgB,CAAA,CAAE,MAAM,CAAA,YAAA,CAAA,EAAgB,CAAA;AAC/F,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,MAAM,CAAA,EAAG;AAC1B,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAA,EAAO,SAAA,EAAW,MAAA,EAAQ,CAAA,CAAE,EAAA,EAAI,OAAA,EAAS,CAAA,aAAA,EAAgB,CAAA,CAAE,MAAM,CAAA,YAAA,CAAA,EAAgB,CAAA;AAC/F,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,OAAO;AAAA,MACL,IAAI,CAAA,CAAE,EAAA;AAAA,MACN,QAAQ,CAAA,CAAE,MAAA;AAAA,MACV,QAAQ,CAAA,CAAE,MAAA;AAAA,MACV,cAAc,CAAA,CAAE,YAAA;AAAA,MAChB,cAAc,CAAA,CAAE,YAAA;AAAA,MAChB,OAAO,CAAA,CAAE;AAAA,KACX;AAAA,EACF,CAAC,CAAA,CACA,MAAA,CAAO,CAAC,CAAA,KAAqB,MAAM,IAAI,CAAA;AAW1C,EAAA,MAAA,CAAO,KAAK,GAAG,sBAAA,CAAuB,EAAE,KAAA,EAAO,KAAA,EAAO,CAAC,CAAA;AAEvD,EAAA,MAAM,KAAK,MAAA,CAAO,KAAA,CAAM,CAAC,CAAA,KAAM,CAAA,CAAE,UAAU,OAAO,CAAA;AAKlD,EAAA,MAAM,iBAAiB,KAAA,CAAM,OAAA,CAAQ,EAAE,MAAM,CAAA,GACxC,EAAE,MAAA,CAA2B,MAAA;AAAA,IAC5B,CAAC,UACC,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,IAAY,OAAQ,KAAA,CAAwB,IAAA,KAAS;AAAA,GAC5F,GACA,MAAA;AAEJ,EAAA,OAAO;AAAA,IACL,EAAA;AAAA,IACA,KAAA,EAAO;AAAA,MACL,KAAA;AAAA,MACA,KAAA;AAAA,MACA,GAAI,kBAAkB,cAAA,CAAe,MAAA,GAAS,IAAI,EAAE,MAAA,EAAQ,cAAA,EAAe,GAAI;AAAC,KAClF;AAAA,IACA;AAAA,GACF;AACF;AAGO,SAAS,eAAe,MAAA,EAA8B;AAC3D,EAAA,OAAO,IAAI,IAAA,CAAK,CAAC,IAAA,CAAK,SAAA,CAAU,MAAA,EAAQ,IAAA,EAAM,CAAC,CAAC,CAAA,EAAG,EAAE,IAAA,EAAM,oBAAoB,CAAA;AACjF","file":"chunk-GPFIJR2K.js","sourcesContent":["import type { FlowEdge, FlowGraph, FlowNode, PortDescriptor, WorkflowInput } from \"../types\";\nimport { checkGraphConnectivity } from \"../analysis/graph-connectivity\";\nimport { defaultConfigFor, getNodeKind, validateConfig } from \"../registry/registry\";\nimport { resolveNodePorts } from \"../registry/ports\";\n\n/** Schema version. Bump on breaking shape changes; add migrations as needed. */\nexport const WORKFLOW_SCHEMA_VERSION = 1 as const;\nexport const WORKFLOW_SCHEMA_URL = \"https://particle.academy/schemas/workflow/v1.json\";\n\nexport type WorkflowSchema = {\n  $schema: typeof WORKFLOW_SCHEMA_URL;\n  version: typeof WORKFLOW_SCHEMA_VERSION;\n  metadata?: WorkflowMetadata;\n  /**\n   * What this workflow accepts at run start, passed BY NAME.\n   *\n   * Lives beside `graph` rather than inside it because it describes the\n   * workflow's CONTRACT, not its topology: a caller reads this to know what to\n   * pass, and reading it should not mean walking nodes looking for a trigger.\n   *\n   * Omitted entirely when a workflow takes none, so every existing saved\n   * document is unchanged byte for byte.\n   */\n  inputs?: WorkflowInput[];\n  graph: {\n    nodes: WorkflowSchemaNode[];\n    edges: WorkflowSchemaEdge[];\n  };\n  view?: {\n    viewport?: { x: number; y: number; zoom: number };\n  };\n};\n\nexport type WorkflowMetadata = {\n  id?: string;\n  name?: string;\n  description?: string;\n  createdAt?: number;\n  updatedAt?: number;\n  author?: string;\n  tags?: string[];\n};\n\nexport type WorkflowSchemaNode = {\n  id: string;\n  /** Registry kind name (e.g. \"memory_store\"). */\n  kind: string;\n  position: { x: number; y: number };\n  label?: string;\n  description?: string;\n  /**\n   * Announced to a person just before / just after this node runs. Omitted\n   * entirely when unset, so a graph of ordinary plumbing nodes does not carry\n   * a pair of empty keys per node and every diff of a saved graph stays\n   * readable.\n   */\n  startingMsg?: string;\n  stoppingMsg?: string;\n  config?: Record<string, unknown>;\n  /**\n   * Resolved ports, written on export.\n   *\n   * A kind may derive its ports from config (`switch_case` cases,\n   * `llm_branch` routes), and that derivation is a JavaScript function — a\n   * runtime in another language cannot execute it. Without the resolved ports\n   * in the document, the PHP twin sees no declared outputs and falls back to a\n   * single `out`, so every branch edge in an exported flow silently stops\n   * firing. Serializing them keeps the schema self-describing and preserves\n   * the cross-runtime guarantee: same JSON in, same routing out.\n   *\n   * Optional and additive — a hand-written schema may omit them, and each\n   * runtime then falls back to its own kind registry.\n   */\n  inputs?: PortDescriptor[];\n  outputs?: PortDescriptor[];\n  /**\n   * Node grouping and visual layout — additive + optional. `parentId`/`extent`\n   * say which container a node sits in (swimlanes); `width`/`height` carry an\n   * explicit (resized) size; `style` carries inline presentation.\n   *\n   * **`parentId` is NOT decoration, and a runtime that drops it is wrong.** It\n   * decides which terminal a node talks to — a terminal lane owns one session\n   * and membership is this field, deliberately, so there is no second copy of\n   * the grouping in each node's config to drift from what the canvas shows.\n   *\n   * This comment used to say these fields exist \"purely for the canvas\", so a\n   * runtime that only walks edges and ports could ignore all of them. The\n   * Python twin read that literally and carried none of them: a graph loaded\n   * there and saved back lost every grouping a person had drawn, silently. The\n   * sentence was true when it was written and became false without being\n   * revisited, which is the more common way a comment does harm.\n   *\n   * An older reader that does not know these fields still drops them — that is\n   * forward-compatibility, not permission.\n   */\n  parentId?: string;\n  extent?: \"parent\" | [[number, number], [number, number]];\n  width?: number;\n  height?: number;\n  style?: Record<string, unknown>;\n};\n\nexport type WorkflowSchemaEdge = {\n  id: string;\n  source: string;\n  target: string;\n  sourceHandle?: string;\n  targetHandle?: string;\n  label?: string;\n};\n\nexport type ImportIssue = {\n  level: \"error\" | \"warning\";\n  nodeId?: string;\n  edgeId?: string;\n  message: string;\n};\n\nexport type ImportResult = {\n  graph: FlowGraph;\n  issues: ImportIssue[];\n  /** True when the import produced a usable graph (errors may have been\n   *  rewritten to warnings via `lenient: true`, except an unsupported schema\n   *  version, which is always an error). */\n  ok: boolean;\n};\n\n/** Snapshot the in-memory graph as a portable WorkflowSchema. */\nexport function exportWorkflow(\n  graph: FlowGraph,\n  metadata?: WorkflowMetadata,\n  view?: WorkflowSchema[\"view\"],\n): WorkflowSchema {\n  return {\n    $schema: WORKFLOW_SCHEMA_URL,\n    version: WORKFLOW_SCHEMA_VERSION,\n    metadata: metadata ? { ...metadata, updatedAt: Date.now() } : undefined,\n    // Round-trips, or a saved workflow silently forgets its own contract and\n    // every caller's props become \"unknown input\" on the next load.\n    ...(graph.inputs && graph.inputs.length > 0 ? { inputs: graph.inputs } : {}),\n    graph: {\n      nodes: graph.nodes.map(toSchemaNode),\n      edges: graph.edges.map(toSchemaEdge),\n    },\n    view,\n  };\n}\n\nfunction toSchemaNode(n: FlowNode): WorkflowSchemaNode {\n  const data: any = n.data ?? {};\n  const kindName = data.kind ?? n.type ?? \"custom\";\n  // Resolve through the same helper the canvas and runtime use, so a\n  // config-driven kind writes its ACTUAL ports into the document instead of\n  // leaving another language's runtime to guess at them.\n  const ports = resolveNodePorts(n, getNodeKind(kindName) ?? undefined);\n  const node = n as any;\n  return {\n    id: n.id,\n    kind: kindName,\n    position: { x: n.position.x, y: n.position.y },\n    label: data.label,\n    description: data.description,\n    ...(typeof data.startingMsg === \"string\" && data.startingMsg !== \"\" ? { startingMsg: data.startingMsg } : {}),\n    ...(typeof data.stoppingMsg === \"string\" && data.stoppingMsg !== \"\" ? { stoppingMsg: data.stoppingMsg } : {}),\n    config: data.config,\n    inputs: ports.inputs,\n    outputs: ports.outputs,\n    // Visual layout — only when explicitly set (never persist auto-`measured`\n    // dimensions, which are derived, not authored).\n    ...(node.parentId ? { parentId: node.parentId } : {}),\n    ...(node.extent ? { extent: node.extent } : {}),\n    ...(typeof node.width === \"number\" ? { width: node.width } : {}),\n    ...(typeof node.height === \"number\" ? { height: node.height } : {}),\n    ...(node.style ? { style: node.style } : {}),\n  };\n}\n\nfunction toSchemaEdge(e: FlowEdge): WorkflowSchemaEdge {\n  return {\n    id: e.id,\n    source: e.source,\n    target: e.target,\n    sourceHandle: e.sourceHandle ?? undefined,\n    targetHandle: e.targetHandle ?? undefined,\n    label: typeof e.label === \"string\" ? e.label : undefined,\n  };\n}\n\nexport type ImportOptions = {\n  /** When true, unknown kinds become warnings + a \"custom\" placeholder\n   *  instead of errors. Default false. It never softens the schema version:\n   *  a document that is not `version: 1` (after migration) is refused either\n   *  way, because no runtime can honour a format it does not know. */\n  lenient?: boolean;\n};\n\n/** A migration step: takes a version-N document to version N+1. */\nexport type MigrationStep = (schema: Record<string, unknown>) => Record<string, unknown>;\n\n/**\n * Every migration step, keyed by the version it upgrades FROM.\n *\n * Empty today because v1 is current — when a BREAKING bump lands, add the step\n * here and every stored document upgrades on read, in this runtime and its\n * PHP and Python twins.\n */\nexport const MIGRATIONS: Record<number, MigrationStep> = {};\n\n/**\n * Migrate a raw schema object up to the current version, as far as it can go.\n *\n * Additive changes need no migration — an older document simply lacks the newer\n * optional fields. This is the seam for a future BREAKING bump, and\n * `importWorkflow` runs it before validating the version.\n *\n * ## The three rules, each with a reason\n *\n *  - **A PAST version migrates forward**, step by step, to the current one.\n *  - **A FUTURE version is left ALONE.** We cannot know what a later schema\n *    means, and migrating downward would be guessing. Untouched hands it to the\n *    version check, which reports it honestly.\n *  - **A GAP in the table is left alone too.** A missing step is not a licence\n *    to guess.\n *\n * ## Why `steps` is a parameter\n *\n * With only v1 in existence there is no old document to migrate, so a seam\n * tested against the built-in (empty) table is a check that CANNOT fail — it\n * would pass identically against a function that returned its input untouched,\n * which is what this was until the twins needed the same seam.\n *\n * The PHP and Python runtimes carry the identical shape. That mattered more\n * than it sounds: they had no migration at all and errored on any version\n * mismatch, so a v2 bump would have made every stored Op unreadable on exactly\n * the runtimes where durable runs resume.\n */\nexport function migrateSchema(\n  schema: unknown,\n  steps: Record<number, MigrationStep> = MIGRATIONS,\n): unknown {\n  if (!schema || typeof schema !== \"object\") return schema;\n\n  const doc = schema as Record<string, unknown>;\n  let version = doc.version;\n\n  if (typeof version !== \"number\" || !Number.isInteger(version) || version >= WORKFLOW_SCHEMA_VERSION) {\n    return schema;\n  }\n\n  let out = doc;\n  while (version < WORKFLOW_SCHEMA_VERSION) {\n    const step = steps[version];\n    if (!step) return out;\n\n    out = step(out);\n    version += 1;\n    out.version = version;\n  }\n\n  return out;\n}\n\n/**\n * Hydrate a schema into runtime FlowGraph + validate kinds/configs against\n * the registry. Reports issues for unknown kinds, missing required config,\n * and dangling edges.\n */\nexport function importWorkflow(schema: unknown, options: ImportOptions = {}): ImportResult {\n  const issues: ImportIssue[] = [];\n  const lenient = options.lenient === true;\n  schema = migrateSchema(schema);\n\n  if (!schema || typeof schema !== \"object\") {\n    return { ok: false, graph: { nodes: [], edges: [] }, issues: [{ level: \"error\", message: \"Schema is not an object.\" }] };\n  }\n  const s = schema as Partial<WorkflowSchema>;\n  // NEVER softened by `lenient`. That flag is about unknown VOCABULARY (a kind\n  // this host has not registered); a version is the format itself, and a\n  // runtime cannot honour a format it does not know. It used to become a\n  // warning, and fancy-flow-php imports leniently on every run(), so one\n  // versionless document ran in Laravel and was refused by a default (strict)\n  // import here. Past versions were migrated above, so anything still unequal\n  // is refused.\n  if (s.version !== WORKFLOW_SCHEMA_VERSION) {\n    issues.push({\n      level: \"error\",\n      message: `Unsupported workflow schema version: ${s.version} (expected ${WORKFLOW_SCHEMA_VERSION})`,\n    });\n    return { ok: false, graph: { nodes: [], edges: [] }, issues };\n  }\n\n  const rawNodes = s.graph?.nodes ?? [];\n  const rawEdges = s.graph?.edges ?? [];\n\n  const nodes: FlowNode[] = rawNodes.map((n) => {\n    const kind = getNodeKind(n.kind);\n    if (!kind) {\n      issues.push({\n        level: lenient ? \"warning\" : \"error\",\n        nodeId: n.id,\n        message: `Unknown kind \"${n.kind}\" — register it before importing.`,\n      });\n    }\n    const config = n.config ?? (kind ? defaultConfigFor(kind) : {});\n    if (kind) {\n      for (const iss of validateConfig(kind, config)) {\n        issues.push({ level: \"warning\", nodeId: n.id, message: `${iss.key}: ${iss.message}` });\n      }\n    }\n    // Canonicalise on the way in: a document may carry a pre-namespace id, and\n    // rewriting it here means the graph converges on the canonical id the next\n    // time it is saved, rather than carrying the ambiguous name forever.\n    const kindId = kind?.name ?? n.kind;\n    return {\n      id: n.id,\n      type: kindId,\n      position: { x: n.position?.x ?? 0, y: n.position?.y ?? 0 },\n      // Rehydrate visual layout onto the node's top level (where xyflow reads it).\n      ...(n.parentId ? { parentId: n.parentId } : {}),\n      ...(n.extent ? { extent: n.extent } : {}),\n      ...(typeof n.width === \"number\" ? { width: n.width } : {}),\n      ...(typeof n.height === \"number\" ? { height: n.height } : {}),\n      ...(n.style ? { style: n.style } : {}),\n      data: {\n        kind: kindId,\n        label: n.label ?? kind?.label ?? n.kind,\n        description: n.description,\n        ...(n.startingMsg ? { startingMsg: n.startingMsg } : {}),\n        ...(n.stoppingMsg ? { stoppingMsg: n.stoppingMsg } : {}),\n        config,\n        // Carry serialized ports back onto the node so a round-trip is stable\n        // and an unknown kind still routes the way the document described.\n        ...(n.inputs ? { inputs: n.inputs } : {}),\n        ...(n.outputs ? { outputs: n.outputs } : {}),\n      } as any,\n    };\n  });\n\n  const nodeIds = new Set(nodes.map((n) => n.id));\n  const edges: FlowEdge[] = rawEdges\n    .map((e) => {\n      if (!nodeIds.has(e.source)) {\n        issues.push({ level: \"warning\", edgeId: e.id, message: `Edge source \"${e.source}\" not found.` });\n        return null;\n      }\n      if (!nodeIds.has(e.target)) {\n        issues.push({ level: \"warning\", edgeId: e.id, message: `Edge target \"${e.target}\" not found.` });\n        return null;\n      }\n      return {\n        id: e.id,\n        source: e.source,\n        target: e.target,\n        sourceHandle: e.sourceHandle,\n        targetHandle: e.targetHandle,\n        label: e.label,\n      } as FlowEdge;\n    })\n    .filter((e): e is FlowEdge => e !== null);\n\n  // WIRING, not merely dataflow: a node no edge reaches and that reaches no\n  // edge, and an edge reading from a node that publishes nothing.\n  //\n  // Deliberately AFTER the edge loop, so it sees the same edges the engine will\n  // -- a dangling edge is dropped with a warning above, and running this first\n  // would let a dropped edge count as a connection.\n  //\n  // Deliberately NOT gated on `lenient`. That flag is about unknown VOCABULARY\n  // (a kind this host has not registered), never about wiring.\n  issues.push(...checkGraphConnectivity({ nodes, edges }));\n\n  const ok = issues.every((i) => i.level !== \"error\");\n  // The declaration comes back with the graph. Dropping it on import would be\n  // the worse half of losing it on export: the document still says what it\n  // accepts, the loaded graph does not, and every prop a caller passes becomes\n  // \"unknown input\" — an error pointing at the caller for a bug in the loader.\n  const declaredInputs = Array.isArray(s.inputs)\n    ? (s.inputs as WorkflowInput[]).filter(\n        (input): input is WorkflowInput =>\n          input !== null && typeof input === \"object\" && typeof (input as WorkflowInput).name === \"string\",\n      )\n    : undefined;\n\n  return {\n    ok,\n    graph: {\n      nodes,\n      edges,\n      ...(declaredInputs && declaredInputs.length > 0 ? { inputs: declaredInputs } : {}),\n    },\n    issues,\n  };\n}\n\n/** Convenience: serialize a schema as a downloadable JSON Blob. */\nexport function workflowToBlob(schema: WorkflowSchema): Blob {\n  return new Blob([JSON.stringify(schema, null, 2)], { type: \"application/json\" });\n}\n"]}

package/dist/{chunk-YNKOEQLI.js → chunk-J5YUYDMK.js}

@@ -745,6 +745,9 @@ async function runFlow(graph, executors, onEvent = () => {
             executors,
             depth,
             run,
+            // Structural executors derive a nested lane from the graph they are
+            // in; `for_each`'s `item` port cannot be implemented without it.
+            graph,
             terminal: terminalAccessorFor(node)
           })
         );
@@ -1253,14 +1256,102 @@ var mergeExecutor = (ctx) => {
   }
   return merged;
 };
-var forEachExecutor = (ctx) => {
-  const source = resolve(configOf(ctx.node).source, ctx.inputs);
+var FOR_EACH_DEFAULT_MAX_ITEMS = 1e3;
+var FOR_EACH_HARD_MAX_ITEMS = 1e4;
+function reachable(adjacency, starts) {
+  const seen = /* @__PURE__ */ new Set();
+  const queue = [...starts];
+  for (let cursor = 0; cursor < queue.length; cursor += 1) {
+    const id = queue[cursor];
+    if (seen.has(id)) continue;
+    seen.add(id);
+    for (const target of adjacency.get(id) ?? []) queue.push(target);
+  }
+  return seen;
+}
+function forEachLane(graph, nodeId) {
+  const handleOf = (edge) => edge.sourceHandle ?? "out";
+  const itemEdges = graph.edges.filter((e) => e.source === nodeId && handleOf(e) === "item");
+  if (itemEdges.length === 0) return null;
+  const adjacency = /* @__PURE__ */ new Map();
+  for (const edge of graph.edges) {
+    const list = adjacency.get(edge.source) ?? [];
+    list.push(edge.target);
+    adjacency.set(edge.source, list);
+  }
+  const done = reachable(
+    adjacency,
+    graph.edges.filter((e) => e.source === nodeId && handleOf(e) === "done").map((e) => e.target)
+  );
+  const body = new Set(
+    [...reachable(adjacency, itemEdges.map((e) => e.target))].filter(
+      (id) => !done.has(id) && id !== nodeId
+    )
+  );
+  return {
+    graph: {
+      nodes: graph.nodes.filter((n) => body.has(n.id)),
+      edges: graph.edges.filter((e) => body.has(e.source) && body.has(e.target)),
+      ...graph.inputs === void 0 ? {} : { inputs: graph.inputs }
+    },
+    entries: itemEdges.filter((e) => body.has(e.target))
+  };
+}
+var forEachExecutor = async (ctx) => {
+  const config = configOf(ctx.node);
+  const source = resolve(config.source, ctx.inputs);
   let items;
   if (Array.isArray(source)) items = source;
   else if (source === null || source === void 0) items = [];
   else if (typeof source === "object") items = Object.values(source);
   else items = [source];
-  return { items, count: items.length };
+  const lane = ctx.graph ? forEachLane(ctx.graph, ctx.node.id) : null;
+  if (lane === null || config.mode === "collect") {
+    return { items, count: items.length };
+  }
+  if (lane.graph.nodes.length === 0) {
+    ctx.abort(`for_each "${ctx.node.id}" has an item edge but its derived lane is empty`);
+  }
+  const maxItems = Number(config.maxItems ?? FOR_EACH_DEFAULT_MAX_ITEMS);
+  if (!Number.isFinite(maxItems) || maxItems < 1 || maxItems > FOR_EACH_HARD_MAX_ITEMS) {
+    ctx.abort(`for_each "${ctx.node.id}" maxItems must be between 1 and ${FOR_EACH_HARD_MAX_ITEMS}`);
+  }
+  if (items.length > maxItems) {
+    ctx.abort(
+      `for_each "${ctx.node.id}" resolved ${items.length} items exceeds its maxItems cap of ${maxItems}`
+    );
+  }
+  const results = [];
+  const failures = [];
+  for (const [index, item] of items.entries()) {
+    const initialInputs = {};
+    for (const edge of lane.entries) {
+      initialInputs[edge.target] = {
+        ...initialInputs[edge.target] ?? {},
+        [edge.targetHandle ?? "in"]: item
+      };
+    }
+    const nested = await runFlow(lane.graph, { ...ctx.executors ?? {} }, () => {
+    }, {
+      initialInputs,
+      depth: (ctx.depth ?? 0) + 1,
+      // The index rides on the identity, so a node in iteration 3 cannot share
+      // an idempotency key with the same node in iteration 4.
+      run: ctx.run?.descend(ctx.node.id, index)
+    });
+    if (!nested.ok) {
+      const reason = nested.error ?? "unknown error";
+      if (decodePause(reason)) ctx.abort(reason);
+      results.push(null);
+      failures.push({ index, item, error: reason });
+      continue;
+    }
+    results.push(nested.outputs);
+  }
+  return {
+    __port: "done",
+    value: { items, results, failures, count: items.length }
+  };
 };
 var manualTriggerExecutor = (ctx) => ctx.inputs;
 var outputExecutor = (ctx) => {
@@ -1817,6 +1908,15 @@ var KINDS = [
     name: "@particle-academy/for_each",
     outputShape: [
       { path: "items", type: "array" },
+      // `results` and `failures` are the WIRED shape -- what a lane produces
+      // when the `item` port is connected. Declared unconditionally because a
+      // declaration describes the kind, not one graph's use of it, and because
+      // the shared table requires them: fancy-conformance 0.30.0 added
+      // `results` and 0.31.0 added `failures`, both BREAKING, both so that a
+      // runtime which has not implemented iteration fails here rather than
+      // reporting surface parity it does not have.
+      { path: "results", type: "array" },
+      { path: "failures", type: "array" },
       { path: "count", type: "number" }
     ],
     aliases: ["for_each", "@fancy/for_each"],
@@ -1825,7 +1925,7 @@ var KINDS = [
     executor: forEachExecutor,
     category: "logic",
     label: "For Each",
-    description: "Iterate over a list, emitting each item on `item`.",
+    description: "Wire `item` to a lane and it runs once per item, aggregating `results` and `failures` on `done`. Leave `item` unwired (or set `mode: collect`) and it just publishes the list and its size -- one node, one checkpoint.",
     icon: "\u21BB",
     inputs: [{ id: "in" }],
     outputs: [{ id: "item", label: "item" }, { id: "done", label: "done" }],
@@ -2894,5 +2994,5 @@ function describeExpressionGrammar() {
 }
 
 export { BUILTIN_KIND_DATA, DEFAULT_MAX_DEPTH, LEGACY_PAUSE_PREFIXES, PAUSE_PREFIX, RunIdentity, UnresolvedPathError, applyKindSchemaOverlay, availableVariables, baseVariables, categoryAccent, clearKindSchemaOverlays, clearNodeKindOverrides, declaredRoutes, decodePause, defaultConfigFor, describeExpressionGrammar, encodePause, ensureBuiltinKinds, escapeSegment, evaluateConfig, evaluateExpression, getNodeKind, humanInputFields, isPause, kindIds, listNodeKinds, llmRouterExecutor, nodeConfig, onNodeKindsChanged, outputFieldsFor, overrideNodeKind, pauseForHuman, registerBuiltinKindInternal, registerNodeKind, resolveFallbackPort, resolveKindId, resolveNodePorts, resolvePath, resolvePortSpec, runFlow, subflowExecutor, subflowMode, subflowPorts, text, truthy, tryResolvePath, undeliveredEdgeWarnings, unregisterNodeKind, validateConfig };
-//# sourceMappingURL=chunk-YNKOEQLI.js.map
-//# sourceMappingURL=chunk-YNKOEQLI.js.map
+//# sourceMappingURL=chunk-J5YUYDMK.js.map
+//# sourceMappingURL=chunk-J5YUYDMK.js.map