@skaile/workspaces 0.8.5

package/dist/chunk-ZUQIXLRJ.js

@@ -0,0 +1,284 @@
+import fs from 'fs';
+import * as path from 'path';
+import path__default from 'path';
+import { parse } from 'yaml';
+import * as z from 'zod';
+
+// base-assets/connectors/flow/engine/engine.ts
+function skillNodes(flow) {
+  return flow.nodes.filter((n) => n.type === "skill");
+}
+function buildIncoming(edges) {
+  const map = /* @__PURE__ */ new Map();
+  for (const edge of edges) {
+    if (!map.has(edge.target)) map.set(edge.target, []);
+    map.get(edge.target).push(edge);
+  }
+  return map;
+}
+function buildOutgoing(edges) {
+  const map = /* @__PURE__ */ new Map();
+  for (const edge of edges) {
+    if (!map.has(edge.source)) map.set(edge.source, []);
+    map.get(edge.source).push(edge);
+  }
+  return map;
+}
+function computeFlowState(flow, completedIds, runningIds = /* @__PURE__ */ new Set(), skippedIds = /* @__PURE__ */ new Set()) {
+  const nodes = skillNodes(flow);
+  const incoming = buildIncoming(flow.edges);
+  const nodeStates = nodes.map((node) => {
+    const optional = node.data?.optional ?? false;
+    const skillId = node.data?.skill ?? node.id;
+    const label = node.data?.label ?? skillId;
+    if (completedIds.has(node.id)) {
+      return {
+        nodeId: node.id,
+        skillId,
+        label,
+        status: "complete",
+        optional,
+        canRun: false,
+        blockers: []
+      };
+    }
+    if (runningIds.has(node.id)) {
+      return {
+        nodeId: node.id,
+        skillId,
+        label,
+        status: "running",
+        optional,
+        canRun: false,
+        blockers: []
+      };
+    }
+    if (skippedIds.has(node.id)) {
+      return {
+        nodeId: node.id,
+        skillId,
+        label,
+        status: "skipped",
+        optional,
+        canRun: false,
+        blockers: []
+      };
+    }
+    const edges = incoming.get(node.id) ?? [];
+    const hardBlockers = edges.filter((e) => e.type === "flow").filter((e) => !completedIds.has(e.source) && !skippedIds.has(e.source)).map((e) => e.source);
+    const canRun = hardBlockers.length === 0;
+    let status;
+    if (!canRun) {
+      status = "not_started";
+    } else {
+      status = "available";
+    }
+    return { nodeId: node.id, skillId, label, status, optional, canRun, blockers: hardBlockers };
+  });
+  new Map(nodeStates.map((s) => [s.nodeId, s]));
+  const available = nodeStates.filter((s) => s.status === "available").map((s) => s.nodeId);
+  const completed = nodeStates.filter((s) => s.status === "complete").map((s) => s.nodeId);
+  const focus = nodeStates.filter(
+    (s) => s.status === "running" || s.status === "awaiting_approval" || s.status === "awaiting_input"
+  ).map((s) => s.nodeId);
+  const requiredNodes = nodes.filter((n) => !(n.data?.optional ?? false));
+  const done = requiredNodes.every((n) => completedIds.has(n.id) || skippedIds.has(n.id));
+  return { flowId: flow.id, nodes: nodeStates, available, completed, focus, done };
+}
+function computeFlowStateFromSnapshots(flow, snapshots) {
+  const nodes = skillNodes(flow);
+  const incoming = buildIncoming(flow.edges);
+  const statusFor = (nodeId) => snapshots.get(nodeId)?.status ?? "not_started";
+  const passed = (nodeId) => {
+    const s = statusFor(nodeId);
+    return s === "complete" || s === "skipped";
+  };
+  const nodeStates = nodes.map((node) => {
+    const snapshot = snapshots.get(node.id);
+    const optional = node.data?.optional ?? false;
+    const skillId = node.data?.skill ?? node.id;
+    const label = node.data?.label ?? skillId;
+    const status = snapshot?.status ?? "not_started";
+    const edges = incoming.get(node.id) ?? [];
+    const flowPreds = edges.filter((e) => e.type === "flow");
+    const hardBlockers = flowPreds.filter((e) => !passed(e.source)).map((e) => e.source);
+    let effectiveStatus = status;
+    if (status === "not_started" && hardBlockers.length === 0) {
+      effectiveStatus = "available";
+    }
+    return {
+      nodeId: node.id,
+      skillId,
+      label,
+      status: effectiveStatus,
+      optional,
+      canRun: hardBlockers.length === 0 && effectiveStatus === "available",
+      blockers: hardBlockers,
+      approval: snapshot?.approval,
+      input: snapshot?.input,
+      output: snapshot?.output,
+      error: snapshot?.error
+    };
+  });
+  const available = nodeStates.filter((s) => s.status === "available").map((s) => s.nodeId);
+  const completed = nodeStates.filter((s) => s.status === "complete").map((s) => s.nodeId);
+  const focus = nodeStates.filter(
+    (s) => s.status === "running" || s.status === "awaiting_approval" || s.status === "awaiting_input"
+  ).map((s) => s.nodeId);
+  const requiredNodes = nodes.filter((n) => !(n.data?.optional ?? false));
+  const done = requiredNodes.every((n) => {
+    const s = statusFor(n.id);
+    return s === "complete" || s === "skipped";
+  });
+  return { flowId: flow.id, nodes: nodeStates, available, completed, focus, done };
+}
+function isBlocking(status) {
+  return status !== "complete" && status !== "skipped";
+}
+function resolveNextNodes(flow, justCompleted, completedIds, skippedIds = /* @__PURE__ */ new Set()) {
+  const outgoing = buildOutgoing(flow.edges);
+  const incoming = buildIncoming(flow.edges);
+  const candidates = (outgoing.get(justCompleted) ?? []).map((e) => e.target);
+  const nextCompleted = /* @__PURE__ */ new Set([...completedIds, justCompleted]);
+  const result = [];
+  for (const candidateId of candidates) {
+    const edges = incoming.get(candidateId) ?? [];
+    const hardBlockers = edges.filter((e) => e.type === "flow").filter((e) => !nextCompleted.has(e.source) && !skippedIds.has(e.source));
+    if (hardBlockers.length === 0) {
+      result.push(candidateId);
+    }
+  }
+  return result;
+}
+function computeSkippable(flow, completedIds) {
+  const nodes = skillNodes(flow);
+  const outgoing = buildOutgoing(flow.edges);
+  return nodes.filter((n) => !completedIds.has(n.id)).filter((n) => n.data?.optional ?? false).filter((n) => {
+    const deps = (outgoing.get(n.id) ?? []).filter((e) => e.type === "flow");
+    return deps.every((e) => {
+      const target = flow.nodes.find((t) => t.id === e.target);
+      return target?.data?.optional ?? false;
+    });
+  }).map((n) => n.id);
+}
+function loadFlow(filePath) {
+  const raw = fs.readFileSync(filePath, "utf-8");
+  const ext = path__default.extname(filePath).toLowerCase();
+  if (ext === ".yaml" || ext === ".yml") {
+    return parse(raw);
+  }
+  return JSON.parse(raw);
+}
+function loadFlowsFromDir(dirPath) {
+  if (!fs.existsSync(dirPath)) return [];
+  const files = fs.readdirSync(dirPath).filter((f) => {
+    if (f.startsWith("_")) return false;
+    return f.endsWith(".flow.yaml") || f.endsWith(".flow.json") || f.endsWith(".json");
+  });
+  const flows = [];
+  for (const file of files) {
+    try {
+      const def = loadFlow(path__default.join(dirPath, file));
+      if (def.id && def.nodes && def.edges) {
+        flows.push(def);
+      }
+    } catch (err) {
+      process.stderr.write(`[agent-flow-engine] skipping ${file}: ${err.message}
+`);
+    }
+  }
+  return flows;
+}
+function loadAllFlows(aiResourcesRoot) {
+  if (!fs.existsSync(aiResourcesRoot)) return [];
+  const flows = [];
+  const domains = fs.readdirSync(aiResourcesRoot, { withFileTypes: true }).filter((d) => d.isDirectory()).map((d) => path__default.join(aiResourcesRoot, d.name, "flows"));
+  for (const flowsDir of domains) {
+    flows.push(...loadFlowsFromDir(flowsDir));
+  }
+  return flows;
+}
+var FlowNodeSchema = z.object({
+  id: z.string().min(1),
+  skill: z.string().optional(),
+  type: z.string().optional(),
+  label: z.string().optional(),
+  description: z.string().optional()
+}).passthrough();
+var FlowEdgeSchema = z.object({
+  id: z.string().optional(),
+  source: z.string().min(1),
+  target: z.string().min(1),
+  condition: z.string().optional()
+}).passthrough();
+var FlowManifestSchema = z.object({
+  id: z.string().min(1),
+  version: z.string().optional(),
+  name: z.string().min(1),
+  description: z.string().optional(),
+  metadata: z.object({
+    tags: z.array(z.string()).optional(),
+    stage: z.string().optional(),
+    icon: z.string().optional(),
+    category: z.string().optional(),
+    onboarding: z.record(z.unknown()).optional()
+  }).passthrough().optional(),
+  globals: z.record(z.unknown()).optional(),
+  modes: z.record(z.unknown()).optional(),
+  tier_presets: z.record(z.record(z.unknown())).optional(),
+  artifact_handoff: z.unknown().optional(),
+  entry: z.string().optional(),
+  nodes: z.array(FlowNodeSchema).optional(),
+  edges: z.array(FlowEdgeSchema).optional()
+}).passthrough();
+function validateFlow(data) {
+  const result = FlowManifestSchema.safeParse(data);
+  if (result.success) {
+    return { ok: true, data: result.data };
+  }
+  return {
+    ok: false,
+    errors: result.error.issues.map((issue) => ({
+      path: issue.path.join("."),
+      message: issue.message
+    }))
+  };
+}
+var flowKindProvider = {
+  kind: "flow",
+  displayName: "Flow",
+  providerVersion: "1.0.0",
+  discoveryPatterns: ["**/*.flow.yaml", "**/*.flow.json"],
+  matchesPath(relativePath) {
+    return relativePath.endsWith(".flow.yaml") || relativePath.endsWith(".flow.json");
+  },
+  validateManifest(data) {
+    return validateFlow(data);
+  },
+  defaultFileFilter(manifestPath) {
+    return {
+      assetRoot: path.dirname(manifestPath),
+      files: [path.basename(manifestPath)]
+    };
+  },
+  extractRequires(assetRef, manifest) {
+    const edges = [];
+    const nodes = manifest.nodes;
+    if (Array.isArray(nodes)) {
+      for (const node of nodes) {
+        if (typeof node === "object" && node !== null && "skill" in node && typeof node.skill === "string") {
+          edges.push({
+            from: assetRef,
+            to: node.skill,
+            field: "nodes[].skill"
+          });
+        }
+      }
+    }
+    return edges;
+  }
+};
+
+export { FlowManifestSchema, computeFlowState, computeFlowStateFromSnapshots, computeSkippable, flowKindProvider, isBlocking, loadAllFlows, loadFlow, loadFlowsFromDir, resolveNextNodes, validateFlow };
+//# sourceMappingURL=chunk-ZUQIXLRJ.js.map
+//# sourceMappingURL=chunk-ZUQIXLRJ.js.map

package/dist/chunk-ZUQIXLRJ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../base-assets/connectors/flow/engine/engine.ts","../base-assets/connectors/flow/engine/loader.ts","../base-assets/connectors/flow/engine/flow-manifest.ts","../base-assets/connectors/flow/engine/flow-kind-provider.ts"],"names":["path","parseYaml","path2"],"mappings":";;;;;;;AAeA,SAAS,WAAW,IAAA,EAAkC;AACpD,EAAA,OAAO,KAAK,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,OAAO,CAAA;AACpD;AAGA,SAAS,cAAc,KAAA,EAA4C;AACjE,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAwB;AACxC,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,CAAC,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,EAAE,CAAA;AAClD,IAAA,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,CAAG,KAAK,IAAI,CAAA;AAAA,EACjC;AACA,EAAA,OAAO,GAAA;AACT;AAGA,SAAS,cAAc,KAAA,EAA4C;AACjE,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAwB;AACxC,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,CAAC,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,EAAE,CAAA;AAClD,IAAA,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,CAAG,KAAK,IAAI,CAAA;AAAA,EACjC;AACA,EAAA,OAAO,GAAA;AACT;AA4BO,SAAS,gBAAA,CACd,IAAA,EACA,YAAA,EACA,UAAA,mBAA0B,IAAI,KAAI,EAClC,UAAA,mBAA0B,IAAI,GAAA,EAAI,EACvB;AACX,EAAA,MAAM,KAAA,GAAQ,WAAW,IAAI,CAAA;AAC7B,EAAA,MAAM,QAAA,GAAW,aAAA,CAAc,IAAA,CAAK,KAAK,CAAA;AAEzC,EAAA,MAAM,UAAA,GAA0B,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AAClD,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,IAAA,EAAM,QAAA,IAAY,KAAA;AACxC,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,IAAA,EAAM,KAAA,IAAS,IAAA,CAAK,EAAA;AACzC,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,IAAA,EAAM,KAAA,IAAS,OAAA;AAElC,IAAA,IAAI,YAAA,CAAa,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC7B,MAAA,OAAO;AAAA,QACL,QAAQ,IAAA,CAAK,EAAA;AAAA,QACb,OAAA;AAAA,QACA,KAAA;AAAA,QACA,MAAA,EAAQ,UAAA;AAAA,QACR,QAAA;AAAA,QACA,MAAA,EAAQ,KAAA;AAAA,QACR,UAAU;AAAC,OACb;AAAA,IACF;AACA,IAAA,IAAI,UAAA,CAAW,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC3B,MAAA,OAAO;AAAA,QACL,QAAQ,IAAA,CAAK,EAAA;AAAA,QACb,OAAA;AAAA,QACA,KAAA;AAAA,QACA,MAAA,EAAQ,SAAA;AAAA,QACR,QAAA;AAAA,QACA,MAAA,EAAQ,KAAA;AAAA,QACR,UAAU;AAAC,OACb;AAAA,IACF;AACA,IAAA,IAAI,UAAA,CAAW,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC3B,MAAA,OAAO;AAAA,QACL,QAAQ,IAAA,CAAK,EAAA;AAAA,QACb,OAAA;AAAA,QACA,KAAA;AAAA,QACA,MAAA,EAAQ,SAAA;AAAA,QACR,QAAA;AAAA,QACA,MAAA,EAAQ,KAAA;AAAA,QACR,UAAU;AAAC,OACb;AAAA,IACF;AAEA,IAAA,MAAM,QAAQ,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAE,KAAK,EAAC;AAGxC,IAAA,MAAM,YAAA,GAAe,KAAA,CAClB,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAM,CAAA,CAC/B,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,YAAA,CAAa,GAAA,CAAI,CAAA,CAAE,MAAM,CAAA,IAAK,CAAC,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,MAAM,CAAC,CAAA,CACtE,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,MAAM,CAAA;AAEtB,IAAA,MAAM,MAAA,GAAS,aAAa,MAAA,KAAW,CAAA;AAEvC,IAAA,IAAI,MAAA;AACJ,IAAA,IAAI,CAAC,MAAA,EAAQ;AACX,MAAA,MAAA,GAAS,aAAA;AAAA,IACX,CAAA,MAAO;AACL,MAAA,MAAA,GAAS,WAAA;AAAA,IACX;AAEA,IAAA,OAAO,EAAE,MAAA,EAAQ,IAAA,CAAK,EAAA,EAAI,OAAA,EAAS,OAAO,MAAA,EAAQ,QAAA,EAAU,MAAA,EAAQ,QAAA,EAAU,YAAA,EAAa;AAAA,EAC7F,CAAC,CAAA;AAED,EAAkB,IAAI,GAAA,CAAI,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,MAAA,EAAQ,CAAC,CAAC,CAAC;AAE9D,EAAA,MAAM,SAAA,GAAY,UAAA,CAAW,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,KAAW,WAAW,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,MAAM,CAAA;AACxF,EAAA,MAAM,SAAA,GAAY,UAAA,CAAW,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,KAAW,UAAU,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,MAAM,CAAA;AACvF,EAAA,MAAM,QAAQ,UAAA,CACX,MAAA;AAAA,IACC,CAAC,MACC,CAAA,CAAE,MAAA,KAAW,aAAa,CAAA,CAAE,MAAA,KAAW,mBAAA,IAAuB,CAAA,CAAE,MAAA,KAAW;AAAA,GAC/E,CACC,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,MAAM,CAAA;AAGtB,EAAA,MAAM,aAAA,GAAgB,MAAM,MAAA,CAAO,CAAC,MAAM,EAAE,CAAA,CAAE,IAAA,EAAM,QAAA,IAAY,KAAA,CAAM,CAAA;AACtE,EAAA,MAAM,IAAA,GAAO,aAAA,CAAc,KAAA,CAAM,CAAC,MAAM,YAAA,CAAa,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,IAAK,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,EAAE,CAAC,CAAA;AAEtF,EAAA,OAAO,EAAE,QAAQ,IAAA,CAAK,EAAA,EAAI,OAAO,UAAA,EAAY,SAAA,EAAW,SAAA,EAAW,KAAA,EAAO,IAAA,EAAK;AACjF;AA6BO,SAAS,6BAAA,CACd,MACA,SAAA,EACW;AACX,EAAA,MAAM,KAAA,GAAQ,WAAW,IAAI,CAAA;AAC7B,EAAA,MAAM,QAAA,GAAW,aAAA,CAAc,IAAA,CAAK,KAAK,CAAA;AAGzC,EAAA,MAAM,YAAY,CAAC,MAAA,KAA+B,UAAU,GAAA,CAAI,MAAM,GAAG,MAAA,IAAU,aAAA;AAGnF,EAAA,MAAM,MAAA,GAAS,CAAC,MAAA,KAA4B;AAC1C,IAAA,MAAM,CAAA,GAAI,UAAU,MAAM,CAAA;AAC1B,IAAA,OAAO,CAAA,KAAM,cAAc,CAAA,KAAM,SAAA;AAAA,EACnC,CAAA;AAEA,EAAA,MAAM,UAAA,GAA0B,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AAClD,IAAA,MAAM,QAAA,GAAW,SAAA,CAAU,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AACtC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,IAAA,EAAM,QAAA,IAAY,KAAA;AACxC,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,IAAA,EAAM,KAAA,IAAS,IAAA,CAAK,EAAA;AACzC,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,IAAA,EAAM,KAAA,IAAS,OAAA;AAClC,IAAA,MAAM,MAAA,GAAS,UAAU,MAAA,IAAU,aAAA;AAEnC,IAAA,MAAM,QAAQ,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAE,KAAK,EAAC;AACxC,IAAA,MAAM,YAAY,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,MAAM,CAAA;AACvD,IAAA,MAAM,YAAA,GAAe,SAAA,CAAU,MAAA,CAAO,CAAC,MAAM,CAAC,MAAA,CAAO,CAAA,CAAE,MAAM,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,MAAM,CAAA;AAGnF,IAAA,IAAI,eAAA,GAA8B,MAAA;AAClC,IAAA,IAAI,MAAA,KAAW,aAAA,IAAiB,YAAA,CAAa,MAAA,KAAW,CAAA,EAAG;AACzD,MAAA,eAAA,GAAkB,WAAA;AAAA,IACpB;AAEA,IAAA,OAAO;AAAA,MACL,QAAQ,IAAA,CAAK,EAAA;AAAA,MACb,OAAA;AAAA,MACA,KAAA;AAAA,MACA,MAAA,EAAQ,eAAA;AAAA,MACR,QAAA;AAAA,MACA,MAAA,EAAQ,YAAA,CAAa,MAAA,KAAW,CAAA,IAAK,eAAA,KAAoB,WAAA;AAAA,MACzD,QAAA,EAAU,YAAA;AAAA,MACV,UAAU,QAAA,EAAU,QAAA;AAAA,MACpB,OAAO,QAAA,EAAU,KAAA;AAAA,MACjB,QAAQ,QAAA,EAAU,MAAA;AAAA,MAClB,OAAO,QAAA,EAAU;AAAA,KACnB;AAAA,EACF,CAAC,CAAA;AAED,EAAA,MAAM,SAAA,GAAY,UAAA,CAAW,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,KAAW,WAAW,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,MAAM,CAAA;AACxF,EAAA,MAAM,SAAA,GAAY,UAAA,CAAW,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,KAAW,UAAU,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,MAAM,CAAA;AACvF,EAAA,MAAM,QAAQ,UAAA,CACX,MAAA;AAAA,IACC,CAAC,MACC,CAAA,CAAE,MAAA,KAAW,aAAa,CAAA,CAAE,MAAA,KAAW,mBAAA,IAAuB,CAAA,CAAE,MAAA,KAAW;AAAA,GAC/E,CACC,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,MAAM,CAAA;AAEtB,EAAA,MAAM,aAAA,GAAgB,MAAM,MAAA,CAAO,CAAC,MAAM,EAAE,CAAA,CAAE,IAAA,EAAM,QAAA,IAAY,KAAA,CAAM,CAAA;AACtE,EAAA,MAAM,IAAA,GAAO,aAAA,CAAc,KAAA,CAAM,CAAC,CAAA,KAAM;AACtC,IAAA,MAAM,CAAA,GAAI,SAAA,CAAU,CAAA,CAAE,EAAE,CAAA;AACxB,IAAA,OAAO,CAAA,KAAM,cAAc,CAAA,KAAM,SAAA;AAAA,EACnC,CAAC,CAAA;AAED,EAAA,OAAO,EAAE,QAAQ,IAAA,CAAK,EAAA,EAAI,OAAO,UAAA,EAAY,SAAA,EAAW,SAAA,EAAW,KAAA,EAAO,IAAA,EAAK;AACjF;AAgBO,SAAS,WAAW,MAAA,EAA6B;AACtD,EAAA,OAAO,MAAA,KAAW,cAAc,MAAA,KAAW,SAAA;AAC7C;AAkBO,SAAS,iBACd,IAAA,EACA,aAAA,EACA,cACA,UAAA,mBAA0B,IAAI,KAAI,EACxB;AACV,EAAA,MAAM,QAAA,GAAW,aAAA,CAAc,IAAA,CAAK,KAAK,CAAA;AACzC,EAAA,MAAM,QAAA,GAAW,aAAA,CAAc,IAAA,CAAK,KAAK,CAAA;AACzC,EAAA,MAAM,UAAA,GAAA,CAAc,QAAA,CAAS,GAAA,CAAI,aAAa,CAAA,IAAK,EAAC,EAAG,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,MAAM,CAAA;AAE1E,EAAA,MAAM,gCAAgB,IAAI,GAAA,CAAI,CAAC,GAAG,YAAA,EAAc,aAAa,CAAC,CAAA;AAC9D,EAAA,MAAM,SAAmB,EAAC;AAE1B,EAAA,KAAA,MAAW,eAAe,UAAA,EAAY;AACpC,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,GAAA,CAAI,WAAW,KAAK,EAAC;AAC5C,IAAA,MAAM,YAAA,GAAe,MAClB,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,MAAM,CAAA,CAC/B,MAAA,CAAO,CAAC,MAAM,CAAC,aAAA,CAAc,GAAA,CAAI,CAAA,CAAE,MAAM,CAAA,IAAK,CAAC,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,MAAM,CAAC,CAAA;AAC1E,IAAA,IAAI,YAAA,CAAa,WAAW,CAAA,EAAG;AAC7B,MAAA,MAAA,CAAO,KAAK,WAAW,CAAA;AAAA,IACzB;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;AAmBO,SAAS,gBAAA,CAAiB,MAAsB,YAAA,EAAqC;AAC1F,EAAA,MAAM,KAAA,GAAQ,WAAW,IAAI,CAAA;AAC7B,EAAA,MAAM,QAAA,GAAW,aAAA,CAAc,IAAA,CAAK,KAAK,CAAA;AAEzC,EAAA,OAAO,KAAA,CACJ,OAAO,CAAC,CAAA,KAAM,CAAC,YAAA,CAAa,GAAA,CAAI,EAAE,EAAE,CAAC,EACrC,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,IAAA,EAAM,YAAY,KAAK,CAAA,CACvC,MAAA,CAAO,CAAC,CAAA,KAAM;AAEb,IAAA,MAAM,IAAA,GAAA,CAAQ,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,IAAK,EAAC,EAAG,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,MAAM,CAAA;AACvE,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,KAAM;AACvB,MAAA,MAAM,MAAA,GAAS,KAAK,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,CAAA,CAAE,MAAM,CAAA;AACvD,MAAA,OAAO,MAAA,EAAQ,MAAM,QAAA,IAAY,KAAA;AAAA,IACnC,CAAC,CAAA;AAAA,EACH,CAAC,CAAA,CACA,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,EAAE,CAAA;AACpB;AChUO,SAAS,SAAS,QAAA,EAAkC;AACzD,EAAA,MAAM,GAAA,GAAM,EAAA,CAAG,YAAA,CAAa,QAAA,EAAU,OAAO,CAAA;AAC7C,EAAA,MAAM,GAAA,GAAMA,aAAA,CAAK,OAAA,CAAQ,QAAQ,EAAE,WAAA,EAAY;AAC/C,EAAA,IAAI,GAAA,KAAQ,OAAA,IAAW,GAAA,KAAQ,MAAA,EAAQ;AACrC,IAAA,OAAOC,MAAU,GAAG,CAAA;AAAA,EACtB;AACA,EAAA,OAAO,IAAA,CAAK,MAAM,GAAG,CAAA;AACvB;AAeO,SAAS,iBAAiB,OAAA,EAAmC;AAClE,EAAA,IAAI,CAAC,EAAA,CAAG,UAAA,CAAW,OAAO,CAAA,SAAU,EAAC;AAErC,EAAA,MAAM,QAAQ,EAAA,CAAG,WAAA,CAAY,OAAO,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM;AAClD,IAAA,IAAI,CAAA,CAAE,UAAA,CAAW,GAAG,CAAA,EAAG,OAAO,KAAA;AAC9B,IAAA,OAAO,CAAA,CAAE,QAAA,CAAS,YAAY,CAAA,IAAK,CAAA,CAAE,SAAS,YAAY,CAAA,IAAK,CAAA,CAAE,QAAA,CAAS,OAAO,CAAA;AAAA,EACnF,CAAC,CAAA;AAED,EAAA,MAAM,QAA0B,EAAC;AAEjC,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI;AACF,MAAA,MAAM,MAAM,QAAA,CAASD,aAAA,CAAK,IAAA,CAAK,OAAA,EAAS,IAAI,CAAC,CAAA;AAC7C,MAAA,IAAI,GAAA,CAAI,EAAA,IAAM,GAAA,CAAI,KAAA,IAAS,IAAI,KAAA,EAAO;AACpC,QAAA,KAAA,CAAM,KAAK,GAAG,CAAA;AAAA,MAChB;AAAA,IACF,SAAS,GAAA,EAAK;AACZ,MAAA,OAAA,CAAQ,OAAO,KAAA,CAAM,CAAA,6BAAA,EAAgC,IAAI,CAAA,EAAA,EAAM,IAAc,OAAO;AAAA,CAAI,CAAA;AAAA,IAC1F;AAAA,EACF;AAEA,EAAA,OAAO,KAAA;AACT;AAeO,SAAS,aAAa,eAAA,EAA2C;AACtE,EAAA,IAAI,CAAC,EAAA,CAAG,UAAA,CAAW,eAAe,CAAA,SAAU,EAAC;AAE7C,EAAA,MAAM,QAA0B,EAAC;AAEjC,EAAA,MAAM,OAAA,GAAU,EAAA,CACb,WAAA,CAAY,eAAA,EAAiB,EAAE,eAAe,IAAA,EAAM,CAAA,CACpD,MAAA,CAAO,CAAC,CAAA,KAAM,EAAE,WAAA,EAAa,CAAA,CAC7B,GAAA,CAAI,CAAC,CAAA,KAAMA,aAAA,CAAK,IAAA,CAAK,eAAA,EAAiB,CAAA,CAAE,IAAA,EAAM,OAAO,CAAC,CAAA;AAEzD,EAAA,KAAA,MAAW,YAAY,OAAA,EAAS;AAC9B,IAAA,KAAA,CAAM,IAAA,CAAK,GAAG,gBAAA,CAAiB,QAAQ,CAAC,CAAA;AAAA,EAC1C;AAEA,EAAA,OAAO,KAAA;AACT;AC9DA,IAAM,iBACH,CAAA,CAAA,MAAA,CAAO;AAAA,EACN,EAAA,EAAM,CAAA,CAAA,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACpB,KAAA,EAAS,CAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,IAAA,EAAQ,CAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC1B,KAAA,EAAS,CAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,WAAA,EAAe,CAAA,CAAA,MAAA,EAAO,CAAE,QAAA;AAC1B,CAAC,EACA,WAAA,EAAY;AAEf,IAAM,iBACH,CAAA,CAAA,MAAA,CAAO;AAAA,EACN,EAAA,EAAM,CAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EACxB,MAAA,EAAU,CAAA,CAAA,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACxB,MAAA,EAAU,CAAA,CAAA,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACxB,SAAA,EAAa,CAAA,CAAA,MAAA,EAAO,CAAE,QAAA;AACxB,CAAC,EACA,WAAA,EAAY;AAER,IAAM,qBACV,CAAA,CAAA,MAAA,CAAO;AAAA,EACN,EAAA,EAAM,CAAA,CAAA,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACpB,OAAA,EAAW,CAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC7B,IAAA,EAAQ,CAAA,CAAA,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACtB,WAAA,EAAe,CAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EACjC,UACG,CAAA,CAAA,MAAA,CAAO;AAAA,IACN,IAAA,EAAQ,CAAA,CAAA,KAAA,CAAQ,CAAA,CAAA,MAAA,EAAQ,EAAE,QAAA,EAAS;AAAA,IACnC,KAAA,EAAS,CAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,IAC3B,IAAA,EAAQ,CAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,IAC1B,QAAA,EAAY,CAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,IAC9B,UAAA,EAAc,CAAA,CAAA,MAAA,CAAS,CAAA,CAAA,OAAA,EAAS,EAAE,QAAA;AAAS,GAC5C,CAAA,CACA,WAAA,EAAY,CACZ,QAAA,EAAS;AAAA,EACZ,OAAA,EAAW,CAAA,CAAA,MAAA,CAAS,CAAA,CAAA,OAAA,EAAS,EAAE,QAAA,EAAS;AAAA,EACxC,KAAA,EAAS,CAAA,CAAA,MAAA,CAAS,CAAA,CAAA,OAAA,EAAS,EAAE,QAAA,EAAS;AAAA,EACtC,cAAgB,CAAA,CAAA,MAAA,CAAS,CAAA,CAAA,MAAA,CAAS,WAAS,CAAC,EAAE,QAAA,EAAS;AAAA,EACvD,gBAAA,EAAoB,CAAA,CAAA,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EACvC,KAAA,EAAS,CAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,KAAA,EAAS,CAAA,CAAA,KAAA,CAAM,cAAc,CAAA,CAAE,QAAA,EAAS;AAAA,EACxC,KAAA,EAAS,CAAA,CAAA,KAAA,CAAM,cAAc,CAAA,CAAE,QAAA;AACjC,CAAC,EACA,WAAA;AAQI,SAAS,aAAa,IAAA,EAAuD;AAClF,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,SAAA,CAAU,IAAI,CAAA;AAChD,EAAA,IAAI,OAAO,OAAA,EAAS;AAClB,IAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,IAAA,EAAM,OAAO,IAAA,EAAK;AAAA,EACvC;AACA,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,KAAA;AAAA,IACJ,QAAQ,MAAA,CAAO,KAAA,CAAM,MAAA,CAAO,GAAA,CAAI,CAAC,KAAA,MAAW;AAAA,MAC1C,IAAA,EAAM,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,GAAG,CAAA;AAAA,MACzB,SAAS,KAAA,CAAM;AAAA,KACjB,CAAE;AAAA,GACJ;AACF;AClEO,IAAM,gBAAA,GAAuC;AAAA,EAClD,IAAA,EAAM,MAAA;AAAA,EACN,WAAA,EAAa,MAAA;AAAA,EACb,eAAA,EAAiB,OAAA;AAAA,EACjB,iBAAA,EAAmB,CAAC,gBAAA,EAAkB,gBAAgB,CAAA;AAAA,EAEtD,YAAY,YAAA,EAA+B;AACzC,IAAA,OAAO,aAAa,QAAA,CAAS,YAAY,CAAA,IAAK,YAAA,CAAa,SAAS,YAAY,CAAA;AAAA,EAClF,CAAA;AAAA,EAEA,iBAAiB,IAAA,EAAe;AAC9B,IAAA,OAAO,aAAa,IAAI,CAAA;AAAA,EAC1B,CAAA;AAAA,EAEA,kBAAkB,YAAA,EAA2C;AAC3D,IAAA,OAAO;AAAA,MACL,SAAA,EAAgBE,aAAQ,YAAY,CAAA;AAAA,MACpC,KAAA,EAAO,CAAMA,IAAA,CAAA,QAAA,CAAS,YAAY,CAAC;AAAA,KACrC;AAAA,EACF,CAAA;AAAA,EAEA,eAAA,CAAgB,UAAkB,QAAA,EAA4D;AAC5F,IAAA,MAAM,QAAiC,EAAC;AAGxC,IAAA,MAAM,QAAQ,QAAA,CAAS,KAAA;AACvB,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,MAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,QAAA,IACE,OAAO,IAAA,KAAS,QAAA,IAChB,IAAA,KAAS,IAAA,IACT,WAAW,IAAA,IACX,OAAQ,IAAA,CAAiC,KAAA,KAAU,QAAA,EACnD;AACA,UAAA,KAAA,CAAM,IAAA,CAAK;AAAA,YACT,IAAA,EAAM,QAAA;AAAA,YACN,IAAK,IAAA,CAAiC,KAAA;AAAA,YACtC,KAAA,EAAO;AAAA,WACR,CAAA;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,IAAA,OAAO,KAAA;AAAA,EACT;AACF","file":"chunk-ZUQIXLRJ.js","sourcesContent":["import type {\n  FlowDefinition,\n  FlowEdge,\n  FlowNode,\n  FlowState,\n  NodeExecutionSnapshot,\n  NodeState,\n  NodeStatus,\n} from \"./types.js\";\n\n// ---------------------------------------------------------------------------\n// Core engine — stateless, pure functions\n// ---------------------------------------------------------------------------\n\n/** Return only skill nodes (exclude groups) */\nfunction skillNodes(flow: FlowDefinition): FlowNode[] {\n  return flow.nodes.filter((n) => n.type === \"skill\");\n}\n\n/** Build adjacency: target → sources[] (incoming edges per node) */\nfunction buildIncoming(edges: FlowEdge[]): Map<string, FlowEdge[]> {\n  const map = new Map<string, FlowEdge[]>();\n  for (const edge of edges) {\n    if (!map.has(edge.target)) map.set(edge.target, []);\n    map.get(edge.target)!.push(edge);\n  }\n  return map;\n}\n\n/** Build adjacency: source → targets[] (outgoing edges per node) */\nfunction buildOutgoing(edges: FlowEdge[]): Map<string, FlowEdge[]> {\n  const map = new Map<string, FlowEdge[]>();\n  for (const edge of edges) {\n    if (!map.has(edge.source)) map.set(edge.source, []);\n    map.get(edge.source)!.push(edge);\n  }\n  return map;\n}\n\n/**\n * Compute the full {@link FlowState} from a flow definition and caller-supplied node ID sets.\n *\n * This is the primary engine function. It is stateless and side-effect-free — calling it\n * twice with the same arguments always returns an equivalent result.\n *\n * Edge semantics applied during computation:\n * - `'flow'`     — hard dependency: target cannot start until source is `complete` or `skipped`.\n * - `'parallel'` — soft dependency: target may run while source is still running.\n * - `'optional'` — advisory: target can start regardless of source state.\n *\n * A node is `available` when every incoming `'flow'`-type edge has a complete or skipped source.\n * A node is `not_started` when at least one hard predecessor is still pending.\n * The flow is `done` when every non-optional node is `complete` or `skipped`.\n *\n * Prefer {@link computeFlowStateFromSnapshots} for callers that track full `NodeExecution`\n * state (interaction statuses such as `awaiting_approval`, `awaiting_input`, `failed`).\n *\n * @param flow - The parsed flow definition.\n * @param completedIds - Set of node IDs that have finished successfully.\n * @param runningIds - Set of node IDs currently executing. Defaults to an empty set.\n * @param skippedIds - Set of node IDs that were explicitly skipped. Skipped nodes count\n *   as satisfied for downstream dependency checks. Defaults to an empty set.\n * @returns A {@link FlowState} describing the current status of every skill node.\n * @docLink packages/flow-engine/concepts#compute-flow-state\n */\nexport function computeFlowState(\n  flow: FlowDefinition,\n  completedIds: Set<string>,\n  runningIds: Set<string> = new Set(),\n  skippedIds: Set<string> = new Set(),\n): FlowState {\n  const nodes = skillNodes(flow);\n  const incoming = buildIncoming(flow.edges);\n\n  const nodeStates: NodeState[] = nodes.map((node) => {\n    const optional = node.data?.optional ?? false;\n    const skillId = node.data?.skill ?? node.id;\n    const label = node.data?.label ?? skillId;\n\n    if (completedIds.has(node.id)) {\n      return {\n        nodeId: node.id,\n        skillId,\n        label,\n        status: \"complete\",\n        optional,\n        canRun: false,\n        blockers: [],\n      };\n    }\n    if (runningIds.has(node.id)) {\n      return {\n        nodeId: node.id,\n        skillId,\n        label,\n        status: \"running\",\n        optional,\n        canRun: false,\n        blockers: [],\n      };\n    }\n    if (skippedIds.has(node.id)) {\n      return {\n        nodeId: node.id,\n        skillId,\n        label,\n        status: \"skipped\",\n        optional,\n        canRun: false,\n        blockers: [],\n      };\n    }\n\n    const edges = incoming.get(node.id) ?? [];\n\n    // Hard blockers: flow-type edges whose source is neither complete nor skipped\n    const hardBlockers = edges\n      .filter((e) => e.type === \"flow\")\n      .filter((e) => !completedIds.has(e.source) && !skippedIds.has(e.source))\n      .map((e) => e.source);\n\n    const canRun = hardBlockers.length === 0;\n\n    let status: NodeStatus;\n    if (!canRun) {\n      status = \"not_started\";\n    } else {\n      status = \"available\";\n    }\n\n    return { nodeId: node.id, skillId, label, status, optional, canRun, blockers: hardBlockers };\n  });\n\n  const _stateMap = new Map(nodeStates.map((s) => [s.nodeId, s]));\n\n  const available = nodeStates.filter((s) => s.status === \"available\").map((s) => s.nodeId);\n  const completed = nodeStates.filter((s) => s.status === \"complete\").map((s) => s.nodeId);\n  const focus = nodeStates\n    .filter(\n      (s) =>\n        s.status === \"running\" || s.status === \"awaiting_approval\" || s.status === \"awaiting_input\",\n    )\n    .map((s) => s.nodeId);\n\n  // Flow is done when all required nodes are complete or skipped\n  const requiredNodes = nodes.filter((n) => !(n.data?.optional ?? false));\n  const done = requiredNodes.every((n) => completedIds.has(n.id) || skippedIds.has(n.id));\n\n  return { flowId: flow.id, nodes: nodeStates, available, completed, focus, done };\n}\n\n/**\n * Snapshot-based variant of {@link computeFlowState}.\n *\n * Accepts a map of `NodeExecutionSnapshot` values carrying the current status and\n * interaction metadata for every node the caller knows about. Nodes absent from the\n * map are treated as `not_started`.\n *\n * This is the preferred API for the turn-based runner, which has a full `FlowExecution`\n * and needs to convey richer statuses (`awaiting_approval`, `awaiting_input`, `failed`)\n * back to the engine so downstream availability is computed correctly.\n *\n * Engine semantics:\n * - A node is `available` when all its incoming `'flow'`-type predecessors are `complete`\n *   or `skipped`. Any other upstream status — including `awaiting_approval`,\n *   `awaiting_input`, and `failed` — is treated as blocking.\n * - A `failed` optional node does **not** block its dependents.\n * - The flow is `done` when every non-optional node is `complete` or `skipped`. A single\n *   required node stuck in `failed` keeps `done` false.\n *\n * @param flow - The parsed flow definition.\n * @param snapshots - Map from node ID to its current {@link NodeExecutionSnapshot}.\n *   Missing entries default to `not_started` with no interaction metadata.\n * @returns A {@link FlowState} describing the current status of every skill node,\n *   including interaction fields (`approval`, `input`, `output`, `error`) copied\n *   from the matching snapshot.\n * @docLink packages/flow-engine/concepts#compute-flow-state-from-snapshots\n */\nexport function computeFlowStateFromSnapshots(\n  flow: FlowDefinition,\n  snapshots: Map<string, NodeExecutionSnapshot>,\n): FlowState {\n  const nodes = skillNodes(flow);\n  const incoming = buildIncoming(flow.edges);\n\n  /** Resolve the effective status for a node — defaulting to `not_started`. */\n  const statusFor = (nodeId: string): NodeStatus => snapshots.get(nodeId)?.status ?? \"not_started\";\n\n  /** A predecessor \"passes\" when it is complete or skipped. */\n  const passed = (nodeId: string): boolean => {\n    const s = statusFor(nodeId);\n    return s === \"complete\" || s === \"skipped\";\n  };\n\n  const nodeStates: NodeState[] = nodes.map((node) => {\n    const snapshot = snapshots.get(node.id);\n    const optional = node.data?.optional ?? false;\n    const skillId = node.data?.skill ?? node.id;\n    const label = node.data?.label ?? skillId;\n    const status = snapshot?.status ?? \"not_started\";\n\n    const edges = incoming.get(node.id) ?? [];\n    const flowPreds = edges.filter((e) => e.type === \"flow\");\n    const hardBlockers = flowPreds.filter((e) => !passed(e.source)).map((e) => e.source);\n\n    // For `not_started` nodes, elevate to `available` once blockers clear.\n    let effectiveStatus: NodeStatus = status;\n    if (status === \"not_started\" && hardBlockers.length === 0) {\n      effectiveStatus = \"available\";\n    }\n\n    return {\n      nodeId: node.id,\n      skillId,\n      label,\n      status: effectiveStatus,\n      optional,\n      canRun: hardBlockers.length === 0 && effectiveStatus === \"available\",\n      blockers: hardBlockers,\n      approval: snapshot?.approval,\n      input: snapshot?.input,\n      output: snapshot?.output,\n      error: snapshot?.error,\n    };\n  });\n\n  const available = nodeStates.filter((s) => s.status === \"available\").map((s) => s.nodeId);\n  const completed = nodeStates.filter((s) => s.status === \"complete\").map((s) => s.nodeId);\n  const focus = nodeStates\n    .filter(\n      (s) =>\n        s.status === \"running\" || s.status === \"awaiting_approval\" || s.status === \"awaiting_input\",\n    )\n    .map((s) => s.nodeId);\n\n  const requiredNodes = nodes.filter((n) => !(n.data?.optional ?? false));\n  const done = requiredNodes.every((n) => {\n    const s = statusFor(n.id);\n    return s === \"complete\" || s === \"skipped\";\n  });\n\n  return { flowId: flow.id, nodes: nodeStates, available, completed, focus, done };\n}\n\n/**\n * Returns `true` when the given status prevents downstream nodes from starting.\n *\n * Only `'complete'` and `'skipped'` satisfy a hard (`'flow'`-type) edge dependency.\n * All other statuses — including `'awaiting_approval'`, `'awaiting_input'`, and\n * `'failed'` — are considered blocking.\n *\n * Use this helper in the FlowAdapter and the turn-based orchestrator instead of\n * hard-coding the two-value whitelist inline.\n *\n * @param status - The {@link NodeStatus} to evaluate.\n * @returns `true` if the status prevents dependents from becoming `available`.\n * @docLink packages/flow-engine/concepts#is-blocking\n */\nexport function isBlocking(status: NodeStatus): boolean {\n  return status !== \"complete\" && status !== \"skipped\";\n}\n\n/**\n * Returns the IDs of nodes that become newly `available` after a specific node completes.\n *\n * More efficient than recomputing the full {@link FlowState} when only the downstream\n * impact of a single completion is needed. Only the direct successors of `justCompleted`\n * are evaluated — the rest of the graph is untouched.\n *\n * @param flow - The parsed flow definition.\n * @param justCompleted - ID of the node that just finished (will be added to the\n *   effective completed set before evaluating successors).\n * @param completedIds - Set of node IDs already known to be complete before this call.\n * @param skippedIds - Set of node IDs that were explicitly skipped. Defaults to an empty set.\n * @returns Array of node IDs whose hard dependencies are now fully satisfied and that\n *   were not already available before `justCompleted` finished.\n * @docLink packages/flow-engine/concepts#resolve-next-nodes\n */\nexport function resolveNextNodes(\n  flow: FlowDefinition,\n  justCompleted: string,\n  completedIds: Set<string>,\n  skippedIds: Set<string> = new Set(),\n): string[] {\n  const outgoing = buildOutgoing(flow.edges);\n  const incoming = buildIncoming(flow.edges);\n  const candidates = (outgoing.get(justCompleted) ?? []).map((e) => e.target);\n\n  const nextCompleted = new Set([...completedIds, justCompleted]);\n  const result: string[] = [];\n\n  for (const candidateId of candidates) {\n    const edges = incoming.get(candidateId) ?? [];\n    const hardBlockers = edges\n      .filter((e) => e.type === \"flow\")\n      .filter((e) => !nextCompleted.has(e.source) && !skippedIds.has(e.source));\n    if (hardBlockers.length === 0) {\n      result.push(candidateId);\n    }\n  }\n\n  return result;\n}\n\n/**\n * Returns the IDs of optional nodes that have not yet started and can be safely skipped.\n *\n * A node is skippable when it is:\n * 1. Not yet complete (absent from `completedIds`).\n * 2. Marked `optional` (`FlowNode.data.optional === true`).\n * 3. Not connected via a `'flow'`-type edge to any non-optional downstream node\n *    (i.e. skipping it cannot starve a required node of a hard dependency).\n *\n * The runner may call this to present the user with a list of nodes they can bypass\n * without breaking the flow's required path.\n *\n * @param flow - The parsed flow definition.\n * @param completedIds - Set of node IDs that have already completed (excluded from results).\n * @returns Array of node IDs that are safe to skip at this point in the execution.\n * @docLink packages/flow-engine/concepts#compute-skippable\n */\nexport function computeSkippable(flow: FlowDefinition, completedIds: Set<string>): string[] {\n  const nodes = skillNodes(flow);\n  const outgoing = buildOutgoing(flow.edges);\n\n  return nodes\n    .filter((n) => !completedIds.has(n.id))\n    .filter((n) => n.data?.optional ?? false)\n    .filter((n) => {\n      // A node is skippable if none of its outgoing flow-type edges go to a required node\n      const deps = (outgoing.get(n.id) ?? []).filter((e) => e.type === \"flow\");\n      return deps.every((e) => {\n        const target = flow.nodes.find((t) => t.id === e.target);\n        return target?.data?.optional ?? false;\n      });\n    })\n    .map((n) => n.id);\n}\n","import fs from \"node:fs\";\nimport path from \"node:path\";\nimport { parse as parseYaml } from \"yaml\";\nimport type { FlowDefinition } from \"./types.js\";\n\n/**\n * Load a single {@link FlowDefinition} from a YAML or JSON file on disk.\n *\n * Format detection is based on file extension:\n * - `.yaml` / `.yml` — parsed with the `yaml` library.\n * - Everything else  — parsed as JSON.\n *\n * @param filePath - Absolute path to the flow file.\n * @returns The parsed {@link FlowDefinition}.\n * @throws {Error} If the file does not exist, cannot be read, or fails to parse.\n * @docLink packages/flow-engine/concepts#flow-loading\n */\nexport function loadFlow(filePath: string): FlowDefinition {\n  const raw = fs.readFileSync(filePath, \"utf-8\");\n  const ext = path.extname(filePath).toLowerCase();\n  if (ext === \".yaml\" || ext === \".yml\") {\n    return parseYaml(raw) as FlowDefinition;\n  }\n  return JSON.parse(raw) as FlowDefinition;\n}\n\n/**\n * Load all `*.flow.yaml` and legacy `*.flow.json` / `*.json` flow files from a directory.\n *\n * Files that fail to parse are skipped with a warning written to `stderr` — they do not\n * cause the function to throw. Files whose name starts with `_` are skipped entirely\n * (treated as drafts or disabled flows). Files missing the required `id`, `nodes`, or\n * `edges` fields are also discarded silently.\n *\n * @param dirPath - Absolute path to the directory to scan.\n * @returns Array of successfully parsed {@link FlowDefinition} objects. Empty if the\n *   directory does not exist or contains no valid flow files.\n * @docLink packages/flow-engine/concepts#flow-loading\n */\nexport function loadFlowsFromDir(dirPath: string): FlowDefinition[] {\n  if (!fs.existsSync(dirPath)) return [];\n\n  const files = fs.readdirSync(dirPath).filter((f) => {\n    if (f.startsWith(\"_\")) return false;\n    return f.endsWith(\".flow.yaml\") || f.endsWith(\".flow.json\") || f.endsWith(\".json\");\n  });\n\n  const flows: FlowDefinition[] = [];\n\n  for (const file of files) {\n    try {\n      const def = loadFlow(path.join(dirPath, file));\n      if (def.id && def.nodes && def.edges) {\n        flows.push(def);\n      }\n    } catch (err) {\n      process.stderr.write(`[agent-flow-engine] skipping ${file}: ${(err as Error).message}\\n`);\n    }\n  }\n\n  return flows;\n}\n\n/**\n * Discover and load all flow definitions from every domain under an `ai-assets` root.\n *\n * Walks the top-level subdirectories of `aiResourcesRoot`, looks for a `flows/`\n * subdirectory inside each domain, and delegates to {@link loadFlowsFromDir} for\n * each one found. Files prefixed with `_` are skipped (draft/disabled).\n *\n * @param aiResourcesRoot - Absolute path to the `ai-assets/` directory (or equivalent\n *   resource root). Typically the `ai-assets/` folder at the monorepo root.\n * @returns Flat array of all successfully parsed {@link FlowDefinition} objects across\n *   all domains. Empty if the root directory does not exist.\n * @docLink packages/flow-engine/concepts#flow-loading\n */\nexport function loadAllFlows(aiResourcesRoot: string): FlowDefinition[] {\n  if (!fs.existsSync(aiResourcesRoot)) return [];\n\n  const flows: FlowDefinition[] = [];\n\n  const domains = fs\n    .readdirSync(aiResourcesRoot, { withFileTypes: true })\n    .filter((d) => d.isDirectory())\n    .map((d) => path.join(aiResourcesRoot, d.name, \"flows\"));\n\n  for (const flowsDir of domains) {\n    flows.push(...loadFlowsFromDir(flowsDir));\n  }\n\n  return flows;\n}\n","/**\n * Flow manifest schema and validation.\n *\n * Moved from @skaile/workspaces/types/manifests/flow.ts in Phase 1.7.3.\n * This is now the canonical location for flow manifest validation.\n */\n\nimport * as z from \"zod\";\n\n// ---------------------------------------------------------------------------\n// Validation result (inline — avoids importing from types/manifests/_shared)\n// ---------------------------------------------------------------------------\n\nexport interface ManifestValidationSuccess<T> {\n  ok: true;\n  data: T;\n}\n\nexport interface ManifestValidationFailure {\n  ok: false;\n  errors: Array<{ path: string; message: string }>;\n}\n\nexport type ManifestValidationResult<T> = ManifestValidationSuccess<T> | ManifestValidationFailure;\n\n// ---------------------------------------------------------------------------\n// Schema\n// ---------------------------------------------------------------------------\n\nconst FlowNodeSchema = z\n  .object({\n    id: z.string().min(1),\n    skill: z.string().optional(),\n    type: z.string().optional(),\n    label: z.string().optional(),\n    description: z.string().optional(),\n  })\n  .passthrough();\n\nconst FlowEdgeSchema = z\n  .object({\n    id: z.string().optional(),\n    source: z.string().min(1),\n    target: z.string().min(1),\n    condition: z.string().optional(),\n  })\n  .passthrough();\n\nexport const FlowManifestSchema = z\n  .object({\n    id: z.string().min(1),\n    version: z.string().optional(),\n    name: z.string().min(1),\n    description: z.string().optional(),\n    metadata: z\n      .object({\n        tags: z.array(z.string()).optional(),\n        stage: z.string().optional(),\n        icon: z.string().optional(),\n        category: z.string().optional(),\n        onboarding: z.record(z.unknown()).optional(),\n      })\n      .passthrough()\n      .optional(),\n    globals: z.record(z.unknown()).optional(),\n    modes: z.record(z.unknown()).optional(),\n    tier_presets: z.record(z.record(z.unknown())).optional(),\n    artifact_handoff: z.unknown().optional(),\n    entry: z.string().optional(),\n    nodes: z.array(FlowNodeSchema).optional(),\n    edges: z.array(FlowEdgeSchema).optional(),\n  })\n  .passthrough();\n\nexport type FlowManifest = z.infer<typeof FlowManifestSchema>;\n\n// ---------------------------------------------------------------------------\n// Validation\n// ---------------------------------------------------------------------------\n\nexport function validateFlow(data: unknown): ManifestValidationResult<FlowManifest> {\n  const result = FlowManifestSchema.safeParse(data);\n  if (result.success) {\n    return { ok: true, data: result.data };\n  }\n  return {\n    ok: false,\n    errors: result.error.issues.map((issue) => ({\n      path: issue.path.join(\".\"),\n      message: issue.message,\n    })),\n  };\n}\n","/**\n * Flow asset kind provider.\n *\n * Exported from @skaile/workspaces/base-assets/connectors/flow/engine for explicit registration\n * by the CLI at bootstrap. Discovery does NOT auto-include this provider\n * (discovery must stay a leaf — no flow-engine imports).\n *\n * Implements IAssetKindProvider with flow-specific:\n * - Discovery patterns: *.flow.yaml, *.flow.json\n * - Manifest validation via FlowManifestSchema\n * - Requires extraction: nodes[].skill references\n * - File filter: just the manifest file (flows are single-file)\n */\n\nimport * as path from \"node:path\";\nimport type {\n  IAssetKindProvider,\n  AssetKindFileFilter,\n  AssetKindRequiresEdge,\n} from \"@skaile/workspaces/plugins\";\nimport { validateFlow } from \"./flow-manifest.js\";\n\n// ---------------------------------------------------------------------------\n// Provider\n// ---------------------------------------------------------------------------\n\nexport const flowKindProvider: IAssetKindProvider = {\n  kind: \"flow\",\n  displayName: \"Flow\",\n  providerVersion: \"1.0.0\",\n  discoveryPatterns: [\"**/*.flow.yaml\", \"**/*.flow.json\"],\n\n  matchesPath(relativePath: string): boolean {\n    return relativePath.endsWith(\".flow.yaml\") || relativePath.endsWith(\".flow.json\");\n  },\n\n  validateManifest(data: unknown) {\n    return validateFlow(data);\n  },\n\n  defaultFileFilter(manifestPath: string): AssetKindFileFilter {\n    return {\n      assetRoot: path.dirname(manifestPath),\n      files: [path.basename(manifestPath)],\n    };\n  },\n\n  extractRequires(assetRef: string, manifest: Record<string, unknown>): AssetKindRequiresEdge[] {\n    const edges: AssetKindRequiresEdge[] = [];\n\n    // Extract skill references from nodes[].skill\n    const nodes = manifest.nodes;\n    if (Array.isArray(nodes)) {\n      for (const node of nodes) {\n        if (\n          typeof node === \"object\" &&\n          node !== null &&\n          \"skill\" in node &&\n          typeof (node as Record<string, unknown>).skill === \"string\"\n        ) {\n          edges.push({\n            from: assetRef,\n            to: (node as Record<string, unknown>).skill as string,\n            field: \"nodes[].skill\",\n          });\n        }\n      }\n    }\n\n    return edges;\n  },\n};\n"]}