@skaile/workspaces 2.5.0 → 2.6.0

package/dist/{chunk-4O2RAXKJ.js → chunk-J7K6K5DH.js}

@@ -1,5 +1,5 @@
-import { resolveFlowBindings, stableFlowJson, parseFlowDefinition, evaluateFlowExpression, inspectFlowExpression, collectFlowBindingExpressions } from './chunk-OEGHKO5N.js';
-import { isAgentNode, nodeBindings, nodeIsOptional, nodeSkillId, nodeLabel, isActiveRuntimeNode } from './chunk-4QROZZ5Z.js';
+import { resolveFlowBindings, stableFlowJson, evaluateFlowExpression, FlowExpressionError, parseFlowDefinition, inspectFlowExpression, collectFlowBindingExpressions } from './chunk-MNPDB7WD.js';
+import { isAgentNode, nodeBindings, isRouterNode, nodeIsOptional, nodeSkillId, nodeLabel, isActiveRuntimeNode } from './chunk-TUYN2HDT.js';
 import { assetSearchDirs } from './chunk-ZAP2BDHG.js';
 import * as z2 from 'zod';
 import * as path from 'path';
@@ -42,6 +42,286 @@ function interpolateNodeInstruction(instruction, values) {
   });
 }
 
+// factory-assets/connectors/flow/engine/router-settlement.ts
+var ROUTER_SELECTION_MARKER = "\n\n[skaile:flow-router-selection:";
+function pendingProducerOutput(flow, snapshots, missingPath) {
+  if (!missingPath) return false;
+  const segments = missingPath.split(".");
+  if (segments.length < 5 || segments[0] !== "nodes" || segments[2] !== "output" || segments[3] !== "fields") {
+    return false;
+  }
+  const producer = flow.nodes.find(({ id }) => id === segments[1]);
+  if (!producer?.contract?.output?.fields) return false;
+  return snapshots.get(producer.id)?.status !== "complete";
+}
+function evaluateRouterSelection(flow, router, snapshots) {
+  if (!isRouterNode(router)) return { unresolved: "no-match" };
+  const context = buildFlowExpressionContext(flow, snapshots);
+  for (const route of router.run.routes) {
+    try {
+      if (evaluateFlowExpression(route.when, context)) {
+        return { selectedTarget: route.target };
+      }
+    } catch (error) {
+      if (error instanceof FlowExpressionError && pendingProducerOutput(flow, snapshots, error.missingPath)) {
+        return { unresolved: "not-ready" };
+      }
+      throw error;
+    }
+  }
+  return { unresolved: "no-match" };
+}
+function routerSelectionOutput(selectedTarget) {
+  const summary = selectedTarget === null ? "Router completed without selecting a target." : `Router selected ${selectedTarget}.`;
+  return {
+    summary: `${summary}${ROUTER_SELECTION_MARKER}${JSON.stringify(selectedTarget)}]`,
+    artifacts: []
+  };
+}
+function routeTargets(router) {
+  if (!isRouterNode(router)) return [];
+  return [...new Set(router.run.routes.flatMap(({ target }) => target === null ? [] : [target]))];
+}
+function routerOwnershipIndex(flow, snapshots) {
+  const routers = flow.nodes.filter(
+    (node) => isRouterNode(node) && !["complete", "failed", "skipped"].includes(snapshots.get(node.id)?.status ?? "not_started")
+  );
+  const routerIds = new Set(routers.map(({ id }) => id));
+  const hardOutgoing = /* @__PURE__ */ new Map();
+  for (const edge of flow.edges) {
+    if (edge.type !== "flow") continue;
+    const targets = hardOutgoing.get(edge.source) ?? [];
+    targets.push(edge.target);
+    hardOutgoing.set(edge.source, targets);
+  }
+  const outgoing = /* @__PURE__ */ new Map();
+  for (const router of routers) {
+    const owned = /* @__PURE__ */ new Set();
+    const visited = /* @__PURE__ */ new Set();
+    const queue = routeTargets(router);
+    for (let index = 0; index < queue.length; index++) {
+      const nodeId = queue[index];
+      if (visited.has(nodeId)) continue;
+      visited.add(nodeId);
+      if (routerIds.has(nodeId)) owned.add(nodeId);
+      queue.push(...hardOutgoing.get(nodeId) ?? []);
+    }
+    outgoing.set(router.id, [...owned]);
+  }
+  return { routers, outgoing };
+}
+function routerOwnershipSourceComponents(flow, snapshots) {
+  const { routers, outgoing } = routerOwnershipIndex(flow, snapshots);
+  const reverse = /* @__PURE__ */ new Map();
+  for (const router of routers) reverse.set(router.id, []);
+  for (const [source, targets] of outgoing) {
+    for (const target of targets) reverse.get(target)?.push(source);
+  }
+  const visited = /* @__PURE__ */ new Set();
+  const finished = [];
+  for (const router of routers) {
+    if (visited.has(router.id)) continue;
+    const stack = [
+      { nodeId: router.id, exiting: false }
+    ];
+    while (stack.length > 0) {
+      const frame = stack.pop();
+      if (!frame) break;
+      if (frame.exiting) {
+        finished.push(frame.nodeId);
+        continue;
+      }
+      if (visited.has(frame.nodeId)) continue;
+      visited.add(frame.nodeId);
+      stack.push({ nodeId: frame.nodeId, exiting: true });
+      const targets = outgoing.get(frame.nodeId) ?? [];
+      for (let index = targets.length - 1; index >= 0; index--) {
+        if (!visited.has(targets[index])) {
+          stack.push({ nodeId: targets[index], exiting: false });
+        }
+      }
+    }
+  }
+  const componentByRouter = /* @__PURE__ */ new Map();
+  const components = [];
+  for (let index = finished.length - 1; index >= 0; index--) {
+    const start = finished[index];
+    if (componentByRouter.has(start)) continue;
+    const componentId = components.length;
+    const component = [];
+    const stack = [start];
+    componentByRouter.set(start, componentId);
+    while (stack.length > 0) {
+      const nodeId = stack.pop();
+      if (!nodeId) break;
+      component.push(nodeId);
+      for (const source of reverse.get(nodeId) ?? []) {
+        if (componentByRouter.has(source)) continue;
+        componentByRouter.set(source, componentId);
+        stack.push(source);
+      }
+    }
+    components.push(component);
+  }
+  const incomingComponents = /* @__PURE__ */ new Set();
+  for (const [source, targets] of outgoing) {
+    const sourceComponent = componentByRouter.get(source);
+    for (const target of targets) {
+      const targetComponent = componentByRouter.get(target);
+      if (sourceComponent !== void 0 && targetComponent !== void 0 && sourceComponent !== targetComponent) {
+        incomingComponents.add(targetComponent);
+      }
+    }
+  }
+  const definitionOrder = new Map(flow.nodes.map((node, index) => [node.id, index]));
+  const sourceComponents = components.filter(
+    (_, componentId) => !incomingComponents.has(componentId)
+  );
+  for (const component of sourceComponents) {
+    component.sort(
+      (left, right) => (definitionOrder.get(left) ?? Number.MAX_SAFE_INTEGER) - (definitionOrder.get(right) ?? Number.MAX_SAFE_INTEGER)
+    );
+  }
+  return sourceComponents.sort(
+    (left, right) => (definitionOrder.get(left[0]) ?? Number.MAX_SAFE_INTEGER) - (definitionOrder.get(right[0]) ?? Number.MAX_SAFE_INTEGER)
+  );
+}
+function persistedRouterSelection(router, snapshot) {
+  if (!isRouterNode(router) || snapshot?.status !== "complete") return void 0;
+  const summary = snapshot.output?.summary;
+  const markerIndex = summary?.lastIndexOf(ROUTER_SELECTION_MARKER) ?? -1;
+  if (!summary || markerIndex < 0 || !summary.endsWith("]")) return void 0;
+  let selectedTarget;
+  try {
+    selectedTarget = JSON.parse(summary.slice(markerIndex + ROUTER_SELECTION_MARKER.length, -1));
+  } catch {
+    return void 0;
+  }
+  if (selectedTarget !== null && (typeof selectedTarget !== "string" || !routeTargets(router).includes(selectedTarget))) {
+    return void 0;
+  }
+  if (selectedTarget === null && !router.run.routes.some(({ target }) => target === null)) {
+    return void 0;
+  }
+  return summary === routerSelectionOutput(selectedTarget).summary ? { selectedTarget } : void 0;
+}
+function edgeKey(source, target) {
+  return `${source}\0${target}`;
+}
+function planRouterSkips(flow, snapshots, settlements) {
+  const routers = flow.nodes.filter(isRouterNode);
+  const currentSelections = new Map(
+    settlements.map(({ routerNodeId, selectedTarget }) => [routerNodeId, selectedTarget])
+  );
+  const knownSelections = /* @__PURE__ */ new Map();
+  for (const router of routers) {
+    if (currentSelections.has(router.id)) {
+      knownSelections.set(router.id, currentSelections.get(router.id) ?? null);
+      continue;
+    }
+    const persisted = persistedRouterSelection(router, snapshots.get(router.id));
+    if (persisted) knownSelections.set(router.id, persisted.selectedTarget);
+  }
+  const outgoing = /* @__PURE__ */ new Map();
+  const incoming = /* @__PURE__ */ new Map();
+  for (const edge of flow.edges) {
+    if (edge.type !== "flow") continue;
+    const targets = outgoing.get(edge.source) ?? [];
+    targets.push(edge.target);
+    outgoing.set(edge.source, targets);
+    const sources = incoming.get(edge.target) ?? [];
+    sources.push(edge.source);
+    incoming.set(edge.target, sources);
+  }
+  const losingRoots = /* @__PURE__ */ new Set();
+  const selectedRoots = /* @__PURE__ */ new Set();
+  const losingRouteEdges = /* @__PURE__ */ new Set();
+  for (const router of routers) {
+    if (!knownSelections.has(router.id)) continue;
+    const selectedTarget = knownSelections.get(router.id) ?? null;
+    if (selectedTarget !== null) selectedRoots.add(selectedTarget);
+    for (const target of routeTargets(router)) {
+      if (target === selectedTarget) continue;
+      losingRoots.add(target);
+      losingRouteEdges.add(edgeKey(router.id, target));
+    }
+  }
+  const candidateOrigins = /* @__PURE__ */ new Map();
+  for (const root of losingRoots) {
+    const visited = /* @__PURE__ */ new Set();
+    const queue = [root];
+    for (let index = 0; index < queue.length; index++) {
+      const nodeId = queue[index];
+      if (visited.has(nodeId)) continue;
+      visited.add(nodeId);
+      const origins = candidateOrigins.get(nodeId) ?? /* @__PURE__ */ new Set();
+      origins.add(root);
+      candidateOrigins.set(nodeId, origins);
+      for (const target of outgoing.get(nodeId) ?? []) queue.push(target);
+    }
+  }
+  const candidates = new Set(candidateOrigins.keys());
+  const protectionQueue = [...selectedRoots];
+  for (const [nodeId, origins] of candidateOrigins) {
+    if (origins.size >= 2) protectionQueue.push(nodeId);
+    for (const source of incoming.get(nodeId) ?? []) {
+      if (candidates.has(source)) continue;
+      if (losingRouteEdges.has(edgeKey(source, nodeId))) continue;
+      if (["failed", "skipped"].includes(snapshots.get(source)?.status ?? "not_started")) continue;
+      protectionQueue.push(nodeId);
+      break;
+    }
+  }
+  const unknownSelections = /* @__PURE__ */ new Map();
+  for (const router of routers) {
+    if (knownSelections.has(router.id)) continue;
+    const status = snapshots.get(router.id)?.status ?? "not_started";
+    if (status === "failed" || status === "skipped") continue;
+    const targets = routeTargets(router);
+    unknownSelections.set(router.id, targets);
+    if (!candidates.has(router.id)) protectionQueue.push(...targets);
+  }
+  const protectedNodes = /* @__PURE__ */ new Set();
+  for (let index = 0; index < protectionQueue.length; index++) {
+    const nodeId = protectionQueue[index];
+    if (protectedNodes.has(nodeId)) continue;
+    protectedNodes.add(nodeId);
+    protectionQueue.push(...outgoing.get(nodeId) ?? []);
+    protectionQueue.push(...unknownSelections.get(nodeId) ?? []);
+  }
+  return flow.nodes.flatMap(
+    (node) => candidates.has(node.id) && !protectedNodes.has(node.id) ? [node.id] : []
+  );
+}
+function unsettledRouterBranchIds(flow, snapshots) {
+  const unsettled = flow.nodes.filter(
+    (node) => isRouterNode(node) && !["complete", "failed", "skipped"].includes(snapshots.get(node.id)?.status ?? "not_started")
+  );
+  const branches = new Set(
+    planRouterSkips(
+      flow,
+      snapshots,
+      unsettled.map(({ id }) => ({ routerNodeId: id, selectedTarget: null }))
+    )
+  );
+  for (const component of routerOwnershipSourceComponents(flow, snapshots)) {
+    for (const routerId of component) branches.delete(routerId);
+  }
+  return branches;
+}
+function availableRouterFrontier(flow, snapshots) {
+  const nodesById = new Map(flow.nodes.map((node) => [node.id, node]));
+  return routerOwnershipSourceComponents(flow, snapshots).flatMap((component) => {
+    for (const routerId of component) {
+      const node = nodesById.get(routerId);
+      if (!node || snapshots.get(routerId)?.status !== "available") continue;
+      if ("unresolved" in evaluateRouterSelection(flow, node, snapshots)) continue;
+      return [node];
+    }
+    return [];
+  });
+}
+
 // factory-assets/connectors/flow/engine/engine.ts
 function activeRuntimeNodes(flow) {
   return flow.nodes.filter(isActiveRuntimeNode);
@@ -81,6 +361,20 @@ function buildOutgoing(edges) {
   }
   return map;
 }
+function resolveAvailableRouter(flow, routerNodeId, snapshots) {
+  const router = flow.nodes.find((node) => node.id === routerNodeId);
+  if (!router || !isRouterNode(router)) return void 0;
+  const state = computeFlowStateFromSnapshots(flow, snapshots);
+  if (!state.available.includes(routerNodeId)) return void 0;
+  const selected = evaluateRouterSelection(flow, router, snapshots);
+  if ("unresolved" in selected) return selected;
+  return {
+    selectedTarget: selected.selectedTarget,
+    skippedNodeIds: planRouterSkips(flow, snapshots, [
+      { routerNodeId, selectedTarget: selected.selectedTarget }
+    ])
+  };
+}
 function computeFlowState(flow, completedIds, runningIds = /* @__PURE__ */ new Set(), skippedIds = /* @__PURE__ */ new Set()) {
   const nodes = activeRuntimeNodes(flow);
   const incoming = buildIncoming(flow.edges);
@@ -89,6 +383,7 @@ function computeFlowState(flow, completedIds, runningIds = /* @__PURE__ */ new S
     const status = completedIds.has(node.id) ? "complete" : runningIds.has(node.id) ? "running" : skippedIds.has(node.id) ? "skipped" : "not_started";
     snapshots.set(node.id, { status });
   }
+  const gatedBranches = unsettledRouterBranchIds(flow, snapshots);
   const context = buildFlowExpressionContext(flow, snapshots);
   const nodeStates = nodes.map((node) => {
     const optional = nodeIsOptional(node);
@@ -130,6 +425,18 @@ function computeFlowState(flow, completedIds, runningIds = /* @__PURE__ */ new S
         failedPreconditions: []
       };
     }
+    if (gatedBranches.has(node.id)) {
+      return {
+        nodeId: node.id,
+        skillId,
+        label,
+        status: "not_started",
+        optional,
+        canRun: false,
+        blockers: [],
+        failedPreconditions: []
+      };
+    }
     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 preconditionFailures = failedPreconditions(node, context);
@@ -164,6 +471,7 @@ function computeFlowState(flow, completedIds, runningIds = /* @__PURE__ */ new S
 function computeFlowStateFromSnapshots(flow, snapshots) {
   const nodes = activeRuntimeNodes(flow);
   const incoming = buildIncoming(flow.edges);
+  const gatedBranches = unsettledRouterBranchIds(flow, snapshots);
   const context = buildFlowExpressionContext(flow, snapshots);
   const statusFor = (nodeId) => snapshots.get(nodeId)?.status ?? "not_started";
   const passed = (nodeId) => {
@@ -182,7 +490,9 @@ function computeFlowStateFromSnapshots(flow, snapshots) {
     const isAdmissionState = status === "not_started" || status === "available";
     const preconditionFailures = isAdmissionState ? failedPreconditions(node, context) : [];
     let effectiveStatus = status;
-    if (isAdmissionState) {
+    if (isAdmissionState && gatedBranches.has(node.id)) {
+      effectiveStatus = "not_started";
+    } else if (isAdmissionState) {
       effectiveStatus = hardBlockers.length === 0 && preconditionFailures.length === 0 ? "available" : "not_started";
     }
     return {
@@ -441,6 +751,6 @@ function loadAllFlows(aiResourcesRoot) {
   return [...byId.values()];
 }
 
-export { FlowManifestSchema, buildFlowExpressionContext, computeFlowState, computeFlowStateFromSnapshots, computeSkippable, flowKindProvider, getConsumedOutputSchema, interpolateNodeInstruction, isBlocking, loadAllFlows, loadFlow, loadFlowsFromDir, resolveNextNodes, resolveNodeBindings, validateConsumedNodeOutput, validateFlow };
-//# sourceMappingURL=chunk-4O2RAXKJ.js.map
-//# sourceMappingURL=chunk-4O2RAXKJ.js.map
+export { FlowManifestSchema, availableRouterFrontier, buildFlowExpressionContext, computeFlowState, computeFlowStateFromSnapshots, computeSkippable, evaluateRouterSelection, flowKindProvider, getConsumedOutputSchema, interpolateNodeInstruction, isBlocking, loadAllFlows, loadFlow, loadFlowsFromDir, persistedRouterSelection, planRouterSkips, resolveAvailableRouter, resolveNextNodes, resolveNodeBindings, routerSelectionOutput, unsettledRouterBranchIds, validateConsumedNodeOutput, validateFlow };
+//# sourceMappingURL=chunk-J7K6K5DH.js.map
+//# sourceMappingURL=chunk-J7K6K5DH.js.map

package/dist/chunk-J7K6K5DH.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../factory-assets/connectors/flow/engine/bindings.ts","../factory-assets/connectors/flow/engine/router-settlement.ts","../factory-assets/connectors/flow/engine/engine.ts","../factory-assets/connectors/flow/engine/output-schema.ts","../factory-assets/connectors/flow/engine/flow-manifest.ts","../factory-assets/connectors/flow/engine/flow-kind-provider.ts","../factory-assets/connectors/flow/engine/loader.ts"],"names":["path","z","parseYaml"],"mappings":";;;;;;;;;;AAWO,SAAS,0BAAA,CACd,MACA,SAAA,EACuB;AACvB,EAAA,MAAM,QAAwC,EAAC;AAC/C,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAK,KAAA,EAAO;AAC7B,IAAA,MAAM,QAAA,GAAW,SAAA,CAAU,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AACtC,IAAA,MAAM,MAAA,GACJ,QAAA,EAAU,MAAA,KAAW,UAAA,IAAc,QAAA,CAAS,MAAA,EAAQ,MAAA,GAChD,EAAE,MAAA,EAAQ,QAAA,CAAS,MAAA,CAAO,MAAA,EAAO,GACjC,MAAA;AACN,IAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,GAAI,EAAE,QAAQ,QAAA,EAAU,MAAA,IAAU,eAAe,MAAA,EAAO;AAAA,EACvE;AACA,EAAA,OAAO;AAAA,IACL,MAAM,EAAE,KAAA,EAAO,KAAK,QAAA,EAAU,SAAA,IAAa,EAAC,EAAE;AAAA,IAC9C,UAAU,IAAA,CAAK,QAAA;AAAA,IACf;AAAA,GACF;AACF;AAGO,SAAS,oBACd,IAAA,EACA,IAAA,EACA,SAAA,EACA,gBAAA,GAAoD,EAAC,EAC/B;AACtB,EAAA,MAAM,UAAU,MAAA,CAAO,WAAA;AAAA,IACrB,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,CAAC,QAAA,KAAa,CAAC,QAAA,CAAS,EAAA,EAAI,WAAA,CAAY,QAAQ,CAAA,GAAI,OAAA,GAAU,SAAS,CAAC;AAAA,GACzF;AACA,EAAA,OAAO,mBAAA;AAAA,IACL,aAAa,IAAI,CAAA;AAAA,IACjB,0BAAA,CAA2B,MAAM,SAAS,CAAA;AAAA,IAC1C,OAAA;AAAA,IACA;AAAA,GACF;AACF;AAGO,SAAS,0BAAA,CACd,aACA,MAAA,EACQ;AACR,EAAA,OAAO,WAAA,CAAY,OAAA,CAAQ,kCAAA,EAAoC,CAAC,cAAc,IAAA,KAAiB;AAC7F,IAAA,IAAI,CAAC,MAAA,CAAO,MAAA,CAAO,MAAA,EAAQ,IAAI,CAAA,EAAG;AAChC,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,yBAAA,EAA4B,IAAI,CAAA,WAAA,CAAa,CAAA;AAAA,IAC/D;AACA,IAAA,MAAM,KAAA,GAAQ,OAAO,IAAI,CAAA;AACzB,IAAA,OAAO,OAAO,KAAA,KAAU,QAAA,GAAW,KAAA,GAAQ,eAAe,KAAK,CAAA;AAAA,EACjE,CAAC,CAAA;AACH;;;ACvDA,IAAM,uBAAA,GAA0B,oCAAA;AAahC,SAAS,qBAAA,CACP,IAAA,EACA,SAAA,EACA,WAAA,EACS;AACT,EAAA,IAAI,CAAC,aAAa,OAAO,KAAA;AACzB,EAAA,MAAM,QAAA,GAAW,WAAA,CAAY,KAAA,CAAM,GAAG,CAAA;AACtC,EAAA,IACE,QAAA,CAAS,MAAA,GAAS,CAAA,IAClB,QAAA,CAAS,CAAC,CAAA,KAAM,OAAA,IAChB,QAAA,CAAS,CAAC,CAAA,KAAM,QAAA,IAChB,QAAA,CAAS,CAAC,MAAM,QAAA,EAChB;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,CAAC,EAAE,EAAA,EAAG,KAAM,EAAA,KAAO,QAAA,CAAS,CAAC,CAAC,CAAA;AAC/D,EAAA,IAAI,CAAC,QAAA,EAAU,QAAA,EAAU,MAAA,EAAQ,QAAQ,OAAO,KAAA;AAChD,EAAA,OAAO,SAAA,CAAU,GAAA,CAAI,QAAA,CAAS,EAAE,GAAG,MAAA,KAAW,UAAA;AAChD;AAGO,SAAS,uBAAA,CACd,IAAA,EACA,MAAA,EACA,SAAA,EACiB;AACjB,EAAA,IAAI,CAAC,YAAA,CAAa,MAAM,GAAG,OAAO,EAAE,YAAY,UAAA,EAAW;AAC3D,EAAA,MAAM,OAAA,GAAU,0BAAA,CAA2B,IAAA,EAAM,SAAS,CAAA;AAC1D,EAAA,KAAA,MAAW,KAAA,IAAS,MAAA,CAAO,GAAA,CAAI,MAAA,EAAQ;AACrC,IAAA,IAAI;AACF,MAAA,IAAI,sBAAA,CAAuB,KAAA,CAAM,IAAA,EAAM,OAAO,CAAA,EAAG;AAC/C,QAAA,OAAO,EAAE,cAAA,EAAgB,KAAA,CAAM,MAAA,EAAO;AAAA,MACxC;AAAA,IACF,SAAS,KAAA,EAAO;AACd,MAAA,IACE,iBAAiB,mBAAA,IACjB,qBAAA,CAAsB,MAAM,SAAA,EAAW,KAAA,CAAM,WAAW,CAAA,EACxD;AACA,QAAA,OAAO,EAAE,YAAY,WAAA,EAAY;AAAA,MACnC;AACA,MAAA,MAAM,KAAA;AAAA,IACR;AAAA,EACF;AACA,EAAA,OAAO,EAAE,YAAY,UAAA,EAAW;AAClC;AAGO,SAAS,sBAAsB,cAAA,EAA2C;AAC/E,EAAA,MAAM,OAAA,GACJ,cAAA,KAAmB,IAAA,GACf,8CAAA,GACA,mBAAmB,cAAc,CAAA,CAAA,CAAA;AACvC,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,GAAG,OAAO,CAAA,EAAG,uBAAuB,CAAA,EAAG,IAAA,CAAK,SAAA,CAAU,cAAc,CAAC,CAAA,CAAA,CAAA;AAAA,IAC9E,WAAW;AAAC,GACd;AACF;AAEA,SAAS,aAAa,MAAA,EAA4B;AAChD,EAAA,IAAI,CAAC,YAAA,CAAa,MAAM,CAAA,SAAU,EAAC;AACnC,EAAA,OAAO,CAAC,GAAG,IAAI,GAAA,CAAI,OAAO,GAAA,CAAI,MAAA,CAAO,QAAQ,CAAC,EAAE,QAAO,KAAO,MAAA,KAAW,OAAO,EAAC,GAAI,CAAC,MAAM,CAAE,CAAC,CAAC,CAAA;AAClG;AAQA,SAAS,oBAAA,CACP,MACA,SAAA,EACsB;AACtB,EAAA,MAAM,OAAA,GAAU,KAAK,KAAA,CAAM,MAAA;AAAA,IACzB,CAAC,IAAA,KACC,YAAA,CAAa,IAAI,CAAA,IACjB,CAAC,CAAC,UAAA,EAAY,QAAA,EAAU,SAAS,CAAA,CAAE,SAAS,SAAA,CAAU,GAAA,CAAI,KAAK,EAAE,CAAA,EAAG,UAAU,aAAa;AAAA,GAC/F;AACA,EAAA,MAAM,SAAA,GAAY,IAAI,GAAA,CAAI,OAAA,CAAQ,GAAA,CAAI,CAAC,EAAE,EAAA,EAAG,KAAM,EAAE,CAAC,CAAA;AACrD,EAAA,MAAM,YAAA,uBAAmB,GAAA,EAAsB;AAC/C,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAK,KAAA,EAAO;AAC7B,IAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,UAAU,YAAA,CAAa,GAAA,CAAI,IAAA,CAAK,MAAM,KAAK,EAAC;AAClD,IAAA,OAAA,CAAQ,IAAA,CAAK,KAAK,MAAM,CAAA;AACxB,IAAA,YAAA,CAAa,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,OAAO,CAAA;AAAA,EACvC;AAEA,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAsB;AAC3C,EAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC5B,IAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,IAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,IAAA,MAAM,KAAA,GAAQ,aAAa,MAAM,CAAA;AACjC,IAAA,KAAA,IAAS,KAAA,GAAQ,CAAA,EAAG,KAAA,GAAQ,KAAA,CAAM,QAAQ,KAAA,EAAA,EAAS;AACjD,MAAA,MAAM,MAAA,GAAS,MAAM,KAAK,CAAA;AAC1B,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,EAAG;AACzB,MAAA,OAAA,CAAQ,IAAI,MAAM,CAAA;AAClB,MAAA,IAAI,UAAU,GAAA,CAAI,MAAM,CAAA,EAAG,KAAA,CAAM,IAAI,MAAM,CAAA;AAC3C,MAAA,KAAA,CAAM,KAAK,GAAI,YAAA,CAAa,IAAI,MAAM,CAAA,IAAK,EAAG,CAAA;AAAA,IAChD;AACA,IAAA,QAAA,CAAS,IAAI,MAAA,CAAO,EAAA,EAAI,CAAC,GAAG,KAAK,CAAC,CAAA;AAAA,EACpC;AACA,EAAA,OAAO,EAAE,SAAS,QAAA,EAAS;AAC7B;AAWA,SAAS,+BAAA,CACP,MACA,SAAA,EACY;AACZ,EAAA,MAAM,EAAE,OAAA,EAAS,QAAA,EAAS,GAAI,oBAAA,CAAqB,MAAM,SAAS,CAAA;AAClE,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAsB;AAC1C,EAAA,KAAA,MAAW,UAAU,OAAA,EAAS,OAAA,CAAQ,IAAI,MAAA,CAAO,EAAA,EAAI,EAAE,CAAA;AACvD,EAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,OAAO,CAAA,IAAK,QAAA,EAAU;AACxC,IAAA,KAAA,MAAW,UAAU,OAAA,EAAS,OAAA,CAAQ,IAAI,MAAM,CAAA,EAAG,KAAK,MAAM,CAAA;AAAA,EAChE;AAEA,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,WAAqB,EAAC;AAC5B,EAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC5B,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,EAAE,CAAA,EAAG;AAC5B,IAAA,MAAM,KAAA,GAAqD;AAAA,MACzD,EAAE,MAAA,EAAQ,MAAA,CAAO,EAAA,EAAI,SAAS,KAAA;AAAM,KACtC;AACA,IAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,MAAA,MAAM,KAAA,GAAQ,MAAM,GAAA,EAAI;AACxB,MAAA,IAAI,CAAC,KAAA,EAAO;AACZ,MAAA,IAAI,MAAM,OAAA,EAAS;AACjB,QAAA,QAAA,CAAS,IAAA,CAAK,MAAM,MAAM,CAAA;AAC1B,QAAA;AAAA,MACF;AACA,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,KAAA,CAAM,MAAM,CAAA,EAAG;AAC/B,MAAA,OAAA,CAAQ,GAAA,CAAI,MAAM,MAAM,CAAA;AACxB,MAAA,KAAA,CAAM,KAAK,EAAE,MAAA,EAAQ,MAAM,MAAA,EAAQ,OAAA,EAAS,MAAM,CAAA;AAClD,MAAA,MAAM,UAAU,QAAA,CAAS,GAAA,CAAI,KAAA,CAAM,MAAM,KAAK,EAAC;AAC/C,MAAA,KAAA,IAAS,QAAQ,OAAA,CAAQ,MAAA,GAAS,CAAA,EAAG,KAAA,IAAS,GAAG,KAAA,EAAA,EAAS;AACxD,QAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,OAAA,CAAQ,KAAK,CAAC,CAAA,EAAG;AAChC,UAAA,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,OAAA,CAAQ,KAAK,CAAA,EAAG,OAAA,EAAS,OAAO,CAAA;AAAA,QACvD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,iBAAA,uBAAwB,GAAA,EAAoB;AAClD,EAAA,MAAM,aAAyB,EAAC;AAChC,EAAA,KAAA,IAAS,QAAQ,QAAA,CAAS,MAAA,GAAS,CAAA,EAAG,KAAA,IAAS,GAAG,KAAA,EAAA,EAAS;AACzD,IAAA,MAAM,KAAA,GAAQ,SAAS,KAAK,CAAA;AAC5B,IAAA,IAAI,iBAAA,CAAkB,GAAA,CAAI,KAAK,CAAA,EAAG;AAClC,IAAA,MAAM,cAAc,UAAA,CAAW,MAAA;AAC/B,IAAA,MAAM,YAAsB,EAAC;AAC7B,IAAA,MAAM,KAAA,GAAQ,CAAC,KAAK,CAAA;AACpB,IAAA,iBAAA,CAAkB,GAAA,CAAI,OAAO,WAAW,CAAA;AACxC,IAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,MAAA,MAAM,MAAA,GAAS,MAAM,GAAA,EAAI;AACzB,MAAA,IAAI,CAAC,MAAA,EAAQ;AACb,MAAA,SAAA,CAAU,KAAK,MAAM,CAAA;AACrB,MAAA,KAAA,MAAW,UAAU,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,IAAK,EAAC,EAAG;AAC9C,QAAA,IAAI,iBAAA,CAAkB,GAAA,CAAI,MAAM,CAAA,EAAG;AACnC,QAAA,iBAAA,CAAkB,GAAA,CAAI,QAAQ,WAAW,CAAA;AACzC,QAAA,KAAA,CAAM,KAAK,MAAM,CAAA;AAAA,MACnB;AAAA,IACF;AACA,IAAA,UAAA,CAAW,KAAK,SAAS,CAAA;AAAA,EAC3B;AAEA,EAAA,MAAM,kBAAA,uBAAyB,GAAA,EAAY;AAC3C,EAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,OAAO,CAAA,IAAK,QAAA,EAAU;AACxC,IAAA,MAAM,eAAA,GAAkB,iBAAA,CAAkB,GAAA,CAAI,MAAM,CAAA;AACpD,IAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC5B,MAAA,MAAM,eAAA,GAAkB,iBAAA,CAAkB,GAAA,CAAI,MAAM,CAAA;AACpD,MAAA,IACE,eAAA,KAAoB,MAAA,IACpB,eAAA,KAAoB,MAAA,IACpB,oBAAoB,eAAA,EACpB;AACA,QAAA,kBAAA,CAAmB,IAAI,eAAe,CAAA;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,eAAA,GAAkB,IAAI,GAAA,CAAI,IAAA,CAAK,MAAM,GAAA,CAAI,CAAC,IAAA,EAAM,KAAA,KAAU,CAAC,IAAA,CAAK,EAAA,EAAI,KAAK,CAAC,CAAC,CAAA;AACjF,EAAA,MAAM,mBAAmB,UAAA,CAAW,MAAA;AAAA,IAClC,CAAC,CAAA,EAAG,WAAA,KAAgB,CAAC,kBAAA,CAAmB,IAAI,WAAW;AAAA,GACzD;AACA,EAAA,KAAA,MAAW,aAAa,gBAAA,EAAkB;AACxC,IAAA,SAAA,CAAU,IAAA;AAAA,MACR,CAAC,IAAA,EAAM,KAAA,KAAA,CACJ,eAAA,CAAgB,GAAA,CAAI,IAAI,CAAA,IAAK,MAAA,CAAO,gBAAA,KACpC,eAAA,CAAgB,GAAA,CAAI,KAAK,KAAK,MAAA,CAAO,gBAAA;AAAA,KAC1C;AAAA,EACF;AACA,EAAA,OAAO,gBAAA,CAAiB,IAAA;AAAA,IACtB,CAAC,IAAA,EAAM,KAAA,KAAA,CACJ,eAAA,CAAgB,GAAA,CAAI,KAAK,CAAC,CAAC,CAAA,IAAK,MAAA,CAAO,qBACvC,eAAA,CAAgB,GAAA,CAAI,MAAM,CAAC,CAAC,KAAK,MAAA,CAAO,gBAAA;AAAA,GAC7C;AACF;AAGO,SAAS,wBAAA,CACd,QACA,QAAA,EAC+C;AAC/C,EAAA,IAAI,CAAC,YAAA,CAAa,MAAM,KAAK,QAAA,EAAU,MAAA,KAAW,YAAY,OAAO,MAAA;AACrE,EAAA,MAAM,OAAA,GAAU,SAAS,MAAA,EAAQ,OAAA;AACjC,EAAA,MAAM,WAAA,GAAc,OAAA,EAAS,WAAA,CAAY,uBAAuB,CAAA,IAAK,EAAA;AACrE,EAAA,IAAI,CAAC,WAAW,WAAA,GAAc,CAAA,IAAK,CAAC,OAAA,CAAQ,QAAA,CAAS,GAAG,CAAA,EAAG,OAAO,MAAA;AAClE,EAAA,IAAI,cAAA;AACJ,EAAA,IAAI;AACF,IAAA,cAAA,GAAiB,IAAA,CAAK,MAAM,OAAA,CAAQ,KAAA,CAAM,cAAc,uBAAA,CAAwB,MAAA,EAAQ,EAAE,CAAC,CAAA;AAAA,EAC7F,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,IACE,cAAA,KAAmB,IAAA,KAClB,OAAO,cAAA,KAAmB,QAAA,IAAY,CAAC,YAAA,CAAa,MAAM,CAAA,CAAE,QAAA,CAAS,cAAc,CAAA,CAAA,EACpF;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,IAAI,cAAA,KAAmB,IAAA,IAAQ,CAAC,MAAA,CAAO,GAAA,CAAI,MAAA,CAAO,IAAA,CAAK,CAAC,EAAE,MAAA,EAAO,KAAM,MAAA,KAAW,IAAI,CAAA,EAAG;AACvF,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,YAAY,qBAAA,CAAsB,cAAc,EAAE,OAAA,GAAU,EAAE,gBAAe,GAAI,MAAA;AAC1F;AAEA,SAAS,OAAA,CAAQ,QAAgB,MAAA,EAAwB;AACvD,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,EAAA,EAAS,MAAM,CAAA,CAAA;AACjC;AAUO,SAAS,eAAA,CACd,IAAA,EACA,SAAA,EACA,WAAA,EACU;AACV,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,YAAY,CAAA;AAC9C,EAAA,MAAM,oBAAoB,IAAI,GAAA;AAAA,IAC5B,WAAA,CAAY,GAAA,CAAI,CAAC,EAAE,YAAA,EAAc,gBAAe,KAAM,CAAC,YAAA,EAAc,cAAc,CAAC;AAAA,GACtF;AACA,EAAA,MAAM,eAAA,uBAAsB,GAAA,EAA2B;AACvD,EAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC5B,IAAA,IAAI,iBAAA,CAAkB,GAAA,CAAI,MAAA,CAAO,EAAE,CAAA,EAAG;AACpC,MAAA,eAAA,CAAgB,GAAA,CAAI,OAAO,EAAA,EAAI,iBAAA,CAAkB,IAAI,MAAA,CAAO,EAAE,KAAK,IAAI,CAAA;AACvE,MAAA;AAAA,IACF;AACA,IAAA,MAAM,YAAY,wBAAA,CAAyB,MAAA,EAAQ,UAAU,GAAA,CAAI,MAAA,CAAO,EAAE,CAAC,CAAA;AAC3E,IAAA,IAAI,WAAW,eAAA,CAAgB,GAAA,CAAI,MAAA,CAAO,EAAA,EAAI,UAAU,cAAc,CAAA;AAAA,EACxE;AAEA,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAsB;AAC3C,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAsB;AAC3C,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAK,KAAA,EAAO;AAC7B,IAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAQ;AAC1B,IAAA,MAAM,UAAU,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,MAAM,KAAK,EAAC;AAC9C,IAAA,OAAA,CAAQ,IAAA,CAAK,KAAK,MAAM,CAAA;AACxB,IAAA,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,OAAO,CAAA;AACjC,IAAA,MAAM,UAAU,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,MAAM,KAAK,EAAC;AAC9C,IAAA,OAAA,CAAQ,IAAA,CAAK,KAAK,MAAM,CAAA;AACxB,IAAA,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,OAAO,CAAA;AAAA,EACnC;AAEA,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AACpC,EAAA,MAAM,aAAA,uBAAoB,GAAA,EAAY;AACtC,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAY;AACzC,EAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC5B,IAAA,IAAI,CAAC,eAAA,CAAgB,GAAA,CAAI,MAAA,CAAO,EAAE,CAAA,EAAG;AACrC,IAAA,MAAM,cAAA,GAAiB,eAAA,CAAgB,GAAA,CAAI,MAAA,CAAO,EAAE,CAAA,IAAK,IAAA;AACzD,IAAA,IAAI,cAAA,KAAmB,IAAA,EAAM,aAAA,CAAc,GAAA,CAAI,cAAc,CAAA;AAC7D,IAAA,KAAA,MAAW,MAAA,IAAU,YAAA,CAAa,MAAM,CAAA,EAAG;AACzC,MAAA,IAAI,WAAW,cAAA,EAAgB;AAC/B,MAAA,WAAA,CAAY,IAAI,MAAM,CAAA;AACtB,MAAA,gBAAA,CAAiB,GAAA,CAAI,OAAA,CAAQ,MAAA,CAAO,EAAA,EAAI,MAAM,CAAC,CAAA;AAAA,IACjD;AAAA,EACF;AAEA,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAyB;AACtD,EAAA,KAAA,MAAW,QAAQ,WAAA,EAAa;AAC9B,IAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,IAAA,MAAM,KAAA,GAAQ,CAAC,IAAI,CAAA;AACnB,IAAA,KAAA,IAAS,KAAA,GAAQ,CAAA,EAAG,KAAA,GAAQ,KAAA,CAAM,QAAQ,KAAA,EAAA,EAAS;AACjD,MAAA,MAAM,MAAA,GAAS,MAAM,KAAK,CAAA;AAC1B,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,EAAG;AACzB,MAAA,OAAA,CAAQ,IAAI,MAAM,CAAA;AAClB,MAAA,MAAM,UAAU,gBAAA,CAAiB,GAAA,CAAI,MAAM,CAAA,wBAAS,GAAA,EAAY;AAChE,MAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAChB,MAAA,gBAAA,CAAiB,GAAA,CAAI,QAAQ,OAAO,CAAA;AACpC,MAAA,KAAA,MAAW,MAAA,IAAU,SAAS,GAAA,CAAI,MAAM,KAAK,EAAC,EAAG,KAAA,CAAM,IAAA,CAAK,MAAM,CAAA;AAAA,IACpE;AAAA,EACF;AACA,EAAA,MAAM,UAAA,GAAa,IAAI,GAAA,CAAI,gBAAA,CAAiB,MAAM,CAAA;AAElD,EAAA,MAAM,eAAA,GAAkB,CAAC,GAAG,aAAa,CAAA;AACzC,EAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,OAAO,CAAA,IAAK,gBAAA,EAAkB;AAChD,IAAA,IAAI,OAAA,CAAQ,IAAA,IAAQ,CAAA,EAAG,eAAA,CAAgB,KAAK,MAAM,CAAA;AAClD,IAAA,KAAA,MAAW,UAAU,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA,IAAK,EAAC,EAAG;AAC/C,MAAA,IAAI,UAAA,CAAW,GAAA,CAAI,MAAM,CAAA,EAAG;AAC5B,MAAA,IAAI,iBAAiB,GAAA,CAAI,OAAA,CAAQ,MAAA,EAAQ,MAAM,CAAC,CAAA,EAAG;AACnD,MAAA,IAAI,CAAC,QAAA,EAAU,SAAS,CAAA,CAAE,QAAA,CAAS,SAAA,CAAU,GAAA,CAAI,MAAM,CAAA,EAAG,MAAA,IAAU,aAAa,CAAA,EAAG;AACpF,MAAA,eAAA,CAAgB,KAAK,MAAM,CAAA;AAC3B,MAAA;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,iBAAA,uBAAwB,GAAA,EAAsB;AACpD,EAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC5B,IAAA,IAAI,eAAA,CAAgB,GAAA,CAAI,MAAA,CAAO,EAAE,CAAA,EAAG;AACpC,IAAA,MAAM,SAAS,SAAA,CAAU,GAAA,CAAI,MAAA,CAAO,EAAE,GAAG,MAAA,IAAU,aAAA;AACnD,IAAA,IAAI,MAAA,KAAW,QAAA,IAAY,MAAA,KAAW,SAAA,EAAW;AACjD,IAAA,MAAM,OAAA,GAAU,aAAa,MAAM,CAAA;AACnC,IAAA,iBAAA,CAAkB,GAAA,CAAI,MAAA,CAAO,EAAA,EAAI,OAAO,CAAA;AACxC,IAAA,IAAI,CAAC,WAAW,GAAA,CAAI,MAAA,CAAO,EAAE,CAAA,EAAG,eAAA,CAAgB,IAAA,CAAK,GAAG,OAAO,CAAA;AAAA,EACjE;AAEA,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAAY;AACvC,EAAA,KAAA,IAAS,KAAA,GAAQ,CAAA,EAAG,KAAA,GAAQ,eAAA,CAAgB,QAAQ,KAAA,EAAA,EAAS;AAC3D,IAAA,MAAM,MAAA,GAAS,gBAAgB,KAAK,CAAA;AACpC,IAAA,IAAI,cAAA,CAAe,GAAA,CAAI,MAAM,CAAA,EAAG;AAChC,IAAA,cAAA,CAAe,IAAI,MAAM,CAAA;AACzB,IAAA,eAAA,CAAgB,KAAK,GAAI,QAAA,CAAS,IAAI,MAAM,CAAA,IAAK,EAAG,CAAA;AACpD,IAAA,eAAA,CAAgB,KAAK,GAAI,iBAAA,CAAkB,IAAI,MAAM,CAAA,IAAK,EAAG,CAAA;AAAA,EAC/D;AAEA,EAAA,OAAO,KAAK,KAAA,CAAM,OAAA;AAAA,IAAQ,CAAC,IAAA,KACzB,UAAA,CAAW,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,IAAK,CAAC,cAAA,CAAe,GAAA,CAAI,KAAK,EAAE,CAAA,GAAI,CAAC,IAAA,CAAK,EAAE,IAAI;AAAC,GACzE;AACF;AAQO,SAAS,wBAAA,CACd,MACA,SAAA,EACa;AACb,EAAA,MAAM,SAAA,GAAY,KAAK,KAAA,CAAM,MAAA;AAAA,IAC3B,CAAC,IAAA,KACC,YAAA,CAAa,IAAI,CAAA,IACjB,CAAC,CAAC,UAAA,EAAY,QAAA,EAAU,SAAS,CAAA,CAAE,SAAS,SAAA,CAAU,GAAA,CAAI,KAAK,EAAE,CAAA,EAAG,UAAU,aAAa;AAAA,GAC/F;AACA,EAAA,MAAM,WAAW,IAAI,GAAA;AAAA,IACnB,eAAA;AAAA,MACE,IAAA;AAAA,MACA,SAAA;AAAA,MACA,SAAA,CAAU,GAAA,CAAI,CAAC,EAAE,EAAA,EAAG,MAAO,EAAE,YAAA,EAAc,EAAA,EAAI,cAAA,EAAgB,IAAA,EAAK,CAAE;AAAA;AACxE,GACF;AACA,EAAA,KAAA,MAAW,SAAA,IAAa,+BAAA,CAAgC,IAAA,EAAM,SAAS,CAAA,EAAG;AACxE,IAAA,KAAA,MAAW,QAAA,IAAY,SAAA,EAAW,QAAA,CAAS,MAAA,CAAO,QAAQ,CAAA;AAAA,EAC5D;AACA,EAAA,OAAO,QAAA;AACT;AAWO,SAAS,uBAAA,CACd,MACA,SAAA,EACY;AACZ,EAAA,MAAM,SAAA,GAAY,IAAI,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,CAAC,IAAA,CAAK,EAAA,EAAI,IAAI,CAAC,CAAC,CAAA;AACnE,EAAA,OAAO,gCAAgC,IAAA,EAAM,SAAS,CAAA,CAAE,OAAA,CAAQ,CAAC,SAAA,KAAc;AAC7E,IAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,MAAA,MAAM,IAAA,GAAO,SAAA,CAAU,GAAA,CAAI,QAAQ,CAAA;AACnC,MAAA,IAAI,CAAC,IAAA,IAAQ,SAAA,CAAU,IAAI,QAAQ,CAAA,EAAG,WAAW,WAAA,EAAa;AAC9D,MAAA,IAAI,YAAA,IAAgB,uBAAA,CAAwB,IAAA,EAAM,IAAA,EAAM,SAAS,CAAA,EAAG;AACpE,MAAA,OAAO,CAAC,IAAI,CAAA;AAAA,IACd;AACA,IAAA,OAAO,EAAC;AAAA,EACV,CAAC,CAAA;AACH;;;AC7XA,SAAS,mBAAmB,IAAA,EAAkC;AAC5D,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,mBAAmB,CAAA;AAC9C;AAGA,SAAS,mBAAA,CACP,MACA,OAAA,EAC2B;AAC3B,EAAA,MAAM,WAAsC,EAAC;AAC7C,EAAA,KAAA,MAAW,WAAA,IAAe,IAAA,CAAK,QAAA,EAAU,QAAA,IAAY,EAAC,EAAG;AACvD,IAAA,MAAM,OAAA,GAAU,WAAA,CAAY,OAAA,IAAW,CAAA,qBAAA,EAAwB,YAAY,IAAI,CAAA,CAAA;AAC/E,IAAA,IAAI;AACF,MAAA,IAAI,CAAC,sBAAA,CAAuB,WAAA,CAAY,IAAA,EAAM,OAAO,CAAA,EAAG;AACtD,QAAA,QAAA,CAAS,IAAA,CAAK,EAAE,UAAA,EAAY,WAAA,CAAY,MAAM,OAAA,EAAS,MAAA,EAAQ,SAAS,CAAA;AAAA,MAC1E;AAAA,IACF,SAAS,KAAA,EAAO;AACd,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACZ,YAAY,WAAA,CAAY,IAAA;AAAA,QACxB,OAAA;AAAA,QACA,MAAA,EAAQ,OAAA;AAAA,QACR,MAAA,EAAQ,KAAA,YAAiB,KAAA,GAAQ,KAAA,CAAM,OAAA,GAAU;AAAA,OAClD,CAAA;AAAA,IACH;AAAA,EACF;AACA,EAAA,OAAO,QAAA;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;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;AAiCO,SAAS,sBAAA,CACd,IAAA,EACA,YAAA,EACA,SAAA,EAC2D;AAC3D,EAAA,MAAM,MAAA,GAAS,KAAK,KAAA,CAAM,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,OAAO,YAAY,CAAA;AACjE,EAAA,IAAI,CAAC,MAAA,IAAU,CAAC,YAAA,CAAa,MAAM,GAAG,OAAO,MAAA;AAC7C,EAAA,MAAM,KAAA,GAAQ,6BAAA,CAA8B,IAAA,EAAM,SAAS,CAAA;AAC3D,EAAA,IAAI,CAAC,KAAA,CAAM,SAAA,CAAU,QAAA,CAAS,YAAY,GAAG,OAAO,MAAA;AAEpD,EAAA,MAAM,QAAA,GAAW,uBAAA,CAAwB,IAAA,EAAM,MAAA,EAAQ,SAAS,CAAA;AAChE,EAAA,IAAI,YAAA,IAAgB,UAAU,OAAO,QAAA;AAErC,EAAA,OAAO;AAAA,IACL,gBAAgB,QAAA,CAAS,cAAA;AAAA,IACzB,cAAA,EAAgB,eAAA,CAAgB,IAAA,EAAM,SAAA,EAAW;AAAA,MAC/C,EAAE,YAAA,EAAc,cAAA,EAAgB,QAAA,CAAS,cAAA;AAAe,KACzD;AAAA,GACH;AACF;AAgCO,SAAS,gBAAA,CACd,IAAA,EACA,YAAA,EACA,UAAA,mBAA0B,IAAI,KAAI,EAClC,UAAA,mBAA0B,IAAI,GAAA,EAAI,EACvB;AACX,EAAA,MAAM,KAAA,GAAQ,mBAAmB,IAAI,CAAA;AACrC,EAAA,MAAM,QAAA,GAAW,aAAA,CAAc,IAAA,CAAK,KAAK,CAAA;AACzC,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAmC;AACzD,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,SAAqB,YAAA,CAAa,GAAA,CAAI,KAAK,EAAE,CAAA,GAC/C,aACA,UAAA,CAAW,GAAA,CAAI,IAAA,CAAK,EAAE,IACpB,SAAA,GACA,UAAA,CAAW,IAAI,IAAA,CAAK,EAAE,IACpB,SAAA,GACA,aAAA;AACR,IAAA,SAAA,CAAU,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,EAAE,QAAQ,CAAA;AAAA,EACnC;AACA,EAAA,MAAM,aAAA,GAAgB,wBAAA,CAAyB,IAAA,EAAM,SAAS,CAAA;AAC9D,EAAA,MAAM,OAAA,GAAU,0BAAA,CAA2B,IAAA,EAAM,SAAS,CAAA;AAE1D,EAAA,MAAM,UAAA,GAA0B,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AAClD,IAAA,MAAM,QAAA,GAAW,eAAe,IAAI,CAAA;AACpC,IAAA,MAAM,OAAA,GAAU,YAAY,IAAI,CAAA;AAChC,IAAA,MAAM,KAAA,GAAQ,UAAU,IAAI,CAAA;AAE5B,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,EAAC;AAAA,QACX,qBAAqB;AAAC,OACxB;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,EAAC;AAAA,QACX,qBAAqB;AAAC,OACxB;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,EAAC;AAAA,QACX,qBAAqB;AAAC,OACxB;AAAA,IACF;AAEA,IAAA,IAAI,aAAA,CAAc,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC9B,MAAA,OAAO;AAAA,QACL,QAAQ,IAAA,CAAK,EAAA;AAAA,QACb,OAAA;AAAA,QACA,KAAA;AAAA,QACA,MAAA,EAAQ,aAAA;AAAA,QACR,QAAA;AAAA,QACA,MAAA,EAAQ,KAAA;AAAA,QACR,UAAU,EAAC;AAAA,QACX,qBAAqB;AAAC,OACxB;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,oBAAA,GAAuB,mBAAA,CAAoB,IAAA,EAAM,OAAO,CAAA;AAC9D,IAAA,MAAM,MAAA,GAAS,YAAA,CAAa,MAAA,KAAW,CAAA,IAAK,qBAAqB,MAAA,KAAW,CAAA;AAE5E,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;AAAA,MACL,QAAQ,IAAA,CAAK,EAAA;AAAA,MACb,OAAA;AAAA,MACA,KAAA;AAAA,MACA,MAAA;AAAA,MACA,QAAA;AAAA,MACA,MAAA;AAAA,MACA,QAAA,EAAU,YAAA;AAAA,MACV,mBAAA,EAAqB;AAAA,KACvB;AAAA,EACF,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,CAAC,cAAA,CAAe,CAAC,CAAC,CAAA;AAC5D,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;AA8BO,SAAS,6BAAA,CACd,MACA,SAAA,EACW;AACX,EAAA,MAAM,KAAA,GAAQ,mBAAmB,IAAI,CAAA;AACrC,EAAA,MAAM,QAAA,GAAW,aAAA,CAAc,IAAA,CAAK,KAAK,CAAA;AACzC,EAAA,MAAM,aAAA,GAAgB,wBAAA,CAAyB,IAAA,EAAM,SAAS,CAAA;AAC9D,EAAA,MAAM,OAAA,GAAU,0BAAA,CAA2B,IAAA,EAAM,SAAS,CAAA;AAG1D,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,eAAe,IAAI,CAAA;AACpC,IAAA,MAAM,OAAA,GAAU,YAAY,IAAI,CAAA;AAChC,IAAA,MAAM,KAAA,GAAQ,UAAU,IAAI,CAAA;AAC5B,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;AAEnF,IAAA,MAAM,gBAAA,GAAmB,MAAA,KAAW,aAAA,IAAiB,MAAA,KAAW,WAAA;AAChE,IAAA,MAAM,uBAAuB,gBAAA,GAAmB,mBAAA,CAAoB,IAAA,EAAM,OAAO,IAAI,EAAC;AAGtF,IAAA,IAAI,eAAA,GAA8B,MAAA;AAClC,IAAA,IAAI,gBAAA,IAAoB,aAAA,CAAc,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAClD,MAAA,eAAA,GAAkB,aAAA;AAAA,IACpB,WAAW,gBAAA,EAAkB;AAC3B,MAAA,eAAA,GACE,aAAa,MAAA,KAAW,CAAA,IAAK,oBAAA,CAAqB,MAAA,KAAW,IACzD,WAAA,GACA,aAAA;AAAA,IACR;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,QACE,YAAA,CAAa,MAAA,KAAW,KACxB,oBAAA,CAAqB,MAAA,KAAW,KAChC,eAAA,KAAoB,WAAA;AAAA,MACtB,QAAA,EAAU,YAAA;AAAA,MACV,mBAAA,EAAqB,oBAAA;AAAA,MACrB,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,CAAC,cAAA,CAAe,CAAC,CAAC,CAAA;AAC5D,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;AAqBO,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,mBAAmB,IAAI,CAAA;AACrC,EAAA,MAAM,QAAA,GAAW,aAAA,CAAc,IAAA,CAAK,KAAK,CAAA;AAEzC,EAAA,OAAO,MACJ,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,aAAa,GAAA,CAAI,CAAA,CAAE,EAAE,CAAC,EACrC,MAAA,CAAO,cAAc,CAAA,CACrB,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,GAAS,cAAA,CAAe,MAAM,CAAA,GAAI,KAAA;AAAA,IAC3C,CAAC,CAAA;AAAA,EACH,CAAC,CAAA,CACA,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,EAAE,CAAA;AACpB;AC7dA,SAAS,oBAAoB,IAAA,EAA0B;AACrD,EAAA,MAAM,WAAA,GAAA,CAAe,IAAA,CAAK,QAAA,EAAU,QAAA,IAAY,EAAC,EAAG,GAAA,CAAI,CAAC,EAAE,IAAA,EAAK,KAAM,IAAI,CAAA;AAC1E,EAAA,WAAA,CAAY,KAAK,GAAG,6BAAA,CAA8B,IAAA,CAAK,QAAA,EAAU,KAAK,CAAC,CAAA;AACvE,EAAA,IAAI,IAAA,CAAK,GAAA,EAAK,IAAA,KAAS,QAAA,EAAU;AAC/B,IAAA,WAAA,CAAY,IAAA,CAAK,GAAG,IAAA,CAAK,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,CAAC,EAAE,IAAA,EAAK,KAAM,IAAI,CAAC,CAAA;AAAA,EAC7D;AACA,EAAA,OAAO,WAAA;AACT;AAEA,SAAS,mBAAA,CAAoB,MAAgB,UAAA,EAA6B;AACxE,EAAA,OAAO,mBAAA,CAAoB,IAAI,CAAA,CAAE,IAAA;AAAA,IAAK,CAAC,UAAA,KACrC,qBAAA,CAAsB,UAAA,EAAY,KAAK,CAAA,CAAE,IAAA;AAAA,MAAK,CAAC,EAAE,IAAA,EAAAA,KAAAA,OAC/CA,KAAAA,CAAK,UAAA,CAAW,CAAA,MAAA,EAAS,UAAU,CAAA,eAAA,CAAiB;AAAA;AACtD,GACF;AACF;AAQO,SAAS,uBAAA,CACd,MACA,UAAA,EACqC;AACrC,EAAA,MAAM,QAAA,GAAW,KAAK,KAAA,CAAM,IAAA,CAAK,CAAC,EAAE,EAAA,EAAG,KAAM,EAAA,KAAO,UAAU,CAAA;AAC9D,EAAA,MAAM,MAAA,GAAS,QAAA,EAAU,QAAA,EAAU,MAAA,EAAQ,MAAA;AAC3C,EAAA,IAAI,CAAC,QAAQ,OAAO,MAAA;AACpB,EAAA,OAAO,KAAK,KAAA,CAAM,IAAA;AAAA,IAChB,CAAC,QAAA,KAAa,QAAA,CAAS,OAAO,UAAA,IAAc,mBAAA,CAAoB,UAAU,UAAU;AAAA,MAElF,MAAA,GACA,MAAA;AACN;AAGO,SAAS,0BAAA,CACd,IAAA,EACA,UAAA,EACA,MAAA,EAC4B;AAC5B,EAAA,MAAM,MAAA,GAAS,uBAAA,CAAwB,IAAA,EAAM,UAAU,CAAA;AACvD,EAAA,IAAI,CAAC,QAAQ,OAAO,EAAE,OAAO,IAAA,EAAM,MAAA,EAAQ,EAAC,EAAE;AAE9C,EAAA,IAAI;AACF,IAAA,MAAM,SAAA,GAAcC,kBAAe,MAAgD,CAAA;AACnF,IAAA,MAAM,MAAA,GAAS,SAAA,CAAU,SAAA,CAAU,MAAA,IAAU,EAAE,CAAA;AAC/C,IAAA,IAAI,MAAA,CAAO,SAAS,OAAO,EAAE,OAAO,IAAA,EAAM,MAAA,EAAQ,EAAC,EAAE;AACrD,IAAA,OAAO;AAAA,MACL,KAAA,EAAO,KAAA;AAAA,MACP,QAAQ,MAAA,CAAO,KAAA,CAAM,MAAA,CAClB,GAAA,CAAI,CAAC,KAAA,KAAU;AACd,QAAA,MAAM,SAAS,KAAA,CAAM,IAAA,CAAK,IAAI,MAAM,CAAA,CAAE,KAAK,GAAG,CAAA;AAC9C,QAAA,OAAO,CAAA,MAAA,EAAS,SAAS,CAAA,CAAA,EAAI,MAAM,KAAK,EAAE,CAAA,EAAA,EAAK,MAAM,OAAO,CAAA,CAAA;AAAA,MAC9D,CAAC,EACA,IAAA;AAAK,KACV;AAAA,EACF,SAAS,KAAA,EAAO;AACd,IAAA,OAAO;AAAA,MACL,KAAA,EAAO,KAAA;AAAA,MACP,MAAA,EAAQ;AAAA,QACN,yCACE,KAAA,YAAiB,KAAA,GAAQ,MAAM,OAAA,GAAU,MAAA,CAAO,KAAK,CACvD,CAAA;AAAA;AACF,KACF;AAAA,EACF;AACF;ACpDA,IAAM,iBAAmB,EAAA,CAAA,WAAA,CAAY;AAAA,EACnC,EAAA,EAAM,EAAA,CAAA,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACpB,KAAA,EAAS,EAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,IAAA,EAAQ,EAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC1B,KAAA,EAAS,EAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,WAAA,EAAe,EAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EACjC,MACG,EAAA,CAAA,WAAA,CAAY;AAAA,IACX,QAAA,EAAY,EAAA,CAAA,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA;AAAA,IAE/B,QAAA,EAAY,EAAA,CAAA,WAAA,CAAY,EAAE,SAAA,EAAa,EAAA,CAAA,OAAA,GAAU,QAAA,EAAS,EAAG,CAAA,CAAE,QAAA;AAAS,GACzE,CAAA,CACA,MAAA,CAAO,CAAC,CAAA,KAAM,EAAE,CAAA,CAAE,QAAA,KAAa,IAAA,IAAQ,CAAA,CAAE,QAAA,EAAU,SAAA,KAAc,IAAA,CAAA,EAAO;AAAA;AAAA;AAAA,IAGvE,OAAA,EAAS;AAAA,GACV,EACA,QAAA;AACL,CAAC,CAAA;AAED,IAAM,iBAAmB,EAAA,CAAA,WAAA,CAAY;AAAA,EACnC,EAAA,EAAM,EAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EACxB,MAAA,EAAU,EAAA,CAAA,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACxB,MAAA,EAAU,EAAA,CAAA,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACxB,SAAA,EAAa,EAAA,CAAA,MAAA,EAAO,CAAE,QAAA;AACxB,CAAC,CAAA;AAEM,IAAM,qBAAuB,EAAA,CAAA,WAAA,CAAY;AAAA,EAC9C,EAAA,EAAM,EAAA,CAAA,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACpB,OAAA,EAAW,EAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC7B,IAAA,EAAQ,EAAA,CAAA,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACtB,WAAA,EAAe,EAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EACjC,UACG,EAAA,CAAA,WAAA,CAAY;AAAA,IACX,IAAA,EAAQ,EAAA,CAAA,KAAA,CAAQ,EAAA,CAAA,MAAA,EAAQ,EAAE,QAAA,EAAS;AAAA,IACnC,KAAA,EAAS,EAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,IAC3B,IAAA,EAAQ,EAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,IAC1B,QAAA,EAAY,EAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,IAC9B,YAAc,EAAA,CAAA,MAAA,CAAS,EAAA,CAAA,MAAA,IAAY,EAAA,CAAA,OAAA,EAAS,EAAE,QAAA;AAAS,GACxD,EACA,QAAA,EAAS;AAAA,EACZ,SAAW,EAAA,CAAA,MAAA,CAAS,EAAA,CAAA,MAAA,IAAY,EAAA,CAAA,OAAA,EAAS,EAAE,QAAA,EAAS;AAAA,EACpD,OAAS,EAAA,CAAA,MAAA,CAAS,EAAA,CAAA,MAAA,IAAY,EAAA,CAAA,OAAA,EAAS,EAAE,QAAA,EAAS;AAAA,EAClD,YAAA,EAAgB,EAAA,CAAA,MAAA,CAAS,EAAA,CAAA,MAAA,EAAO,EAAK,EAAA,CAAA,MAAA,CAAS,EAAA,CAAA,MAAA,EAAO,EAAK,EAAA,CAAA,OAAA,EAAS,CAAC,CAAA,CAAE,QAAA,EAAS;AAAA,EAC/E,gBAAA,EAAoB,EAAA,CAAA,OAAA,EAAQ,CAAE,QAAA,EAAS;AAAA,EACvC,KAAA,EAAS,EAAA,CAAA,MAAA,EAAO,CAAE,QAAA,EAAS;AAAA,EAC3B,KAAA,EAAS,EAAA,CAAA,KAAA,CAAM,cAAc,CAAA,CAAE,QAAA,EAAS;AAAA,EACxC,KAAA,EAAS,EAAA,CAAA,KAAA,CAAM,cAAc,CAAA,CAAE,QAAA;AACjC,CAAC;AAQM,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;;;ACvEO,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,EAAgB,aAAQ,YAAY,CAAA;AAAA,MACpC,KAAA,EAAO,CAAM,IAAA,CAAA,QAAA,CAAS,YAAY,CAAC;AAAA,KACrC;AAAA,EACF,CAAA;AAAA,EAEA,eAAA,CAAgB,UAAkB,QAAA,EAA4D;AAC5F,IAAA,MAAM,QAAiC,EAAC;AACxC,IAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,IAAA,MAAM,GAAA,GAAM,CAAC,EAAA,EAAY,KAAA,KAAwB;AAC/C,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA,EAAG;AAClB,MAAA,IAAA,CAAK,IAAI,EAAE,CAAA;AACX,MAAA,KAAA,CAAM,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,EAAA,EAAI,OAAO,CAAA;AAAA,IAC1C,CAAA;AAEA,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,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,IAAA,KAAS,IAAA,EAAM;AAC/C,QAAA,MAAM,CAAA,GAAI,IAAA;AACV,QAAA,MAAM,IAAA,GACJ,OAAO,CAAA,CAAE,IAAA,KAAS,QAAA,IAAY,EAAE,IAAA,KAAS,IAAA,GAAQ,CAAA,CAAE,IAAA,GAAmC,EAAC;AAEzF,QAAA,MAAM,GAAA,GACJ,OAAO,CAAA,CAAE,GAAA,KAAQ,QAAA,IAAY,EAAE,GAAA,KAAQ,IAAA,GAAQ,CAAA,CAAE,GAAA,GAAkC,EAAC;AAEtF,QAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,EAAG;AAC7B,UAAA,KAAA,MAAW,KAAA,IAAS,IAAI,MAAA,EAAQ;AAC9B,YAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,GAAA,CAAI,OAAO,oBAAoB,CAAA;AAAA,UAChE;AAAA,QACF;AAEA,QAAA,IAAI,IAAI,IAAA,KAAS,UAAA,IAAc,OAAO,GAAA,CAAI,SAAS,QAAA,EAAU;AAC3D,UAAA,MAAM,OAAA,GAAU,GAAA,CAAI,IAAA,CAAK,UAAA,CAAW,OAAO,IAAI,GAAA,CAAI,IAAA,GAAO,CAAA,KAAA,EAAQ,GAAA,CAAI,IAAI,CAAA,CAAA;AAC1E,UAAA,GAAA,CAAI,SAAS,kBAAkB,CAAA;AAAA,QACjC;AAEA,QAAA,MAAM,QAAQ,OAAO,IAAA,CAAK,UAAU,QAAA,GAAW,IAAA,CAAK,QAAQ,CAAA,CAAE,KAAA;AAC9D,QAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,UAAA,GAAA,CAAI,OAAO,oBAAoB,CAAA;AAAA,QACjC;AAEA,QAAA,MAAM,UAAU,OAAO,IAAA,CAAK,SAAS,QAAA,GAAW,IAAA,CAAK,OAAO,CAAA,CAAE,IAAA;AAC9D,QAAA,IAAI,OAAO,YAAY,QAAA,EAAU;AAC/B,UAAA,GAAA,CAAI,OAAA,CAAQ,WAAW,OAAO,CAAA,GAAI,UAAU,CAAA,KAAA,EAAQ,OAAO,IAAI,mBAAmB,CAAA;AAAA,QACpF;AAAA,MACF;AAAA,IACF;AAEA,IAAA,OAAO,KAAA;AAAA,EACT;AACF;ACzEO,SAAS,SAAS,QAAA,EAAkC;AACzD,EAAA,MAAM,GAAA,GAAM,EAAA,CAAG,YAAA,CAAa,QAAA,EAAU,OAAO,CAAA;AAC7C,EAAA,MAAM,GAAA,GAAMD,aAAAA,CAAK,OAAA,CAAQ,QAAQ,EAAE,WAAA,EAAY;AAC/C,EAAA,MAAM,QAAA,GAAW,GAAA,KAAQ,OAAA,IAAW,GAAA,KAAQ,MAAA,GAASE,MAAU,GAAG,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AACpF,EAAA,MAAM,MAAA,GAAS,oBAAoB,QAAQ,CAAA;AAC3C,EAAA,IAAI,CAAC,OAAO,EAAA,EAAI;AACd,IAAA,MAAM,UAAU,MAAA,CAAO,MAAA,CACpB,GAAA,CAAI,CAAC,UAAU,CAAA,EAAA,EAAK,KAAA,CAAM,IAAA,IAAQ,QAAQ,KAAK,KAAA,CAAM,OAAO,CAAA,CAAE,CAAA,CAC9D,KAAK,IAAI,CAAA;AACZ,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA;AAAA,EAA6B,OAAO,CAAA,CAAE,CAAA;AAAA,EACxD;AACA,EAAA,OAAO,MAAA,CAAO,IAAA;AAChB;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,CAASF,aAAAA,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;AAM7C,EAAA,MAAM,IAAA,uBAAW,GAAA,EAA4B;AAC7C,EAAA,KAAA,MAAW,EAAE,GAAA,EAAI,IAAK,eAAA,CAAgB,eAAA,EAAiB,OAAO,CAAA,EAAG;AAC/D,IAAA,KAAA,MAAW,IAAA,IAAQ,gBAAA,CAAiB,GAAG,CAAA,EAAG;AACxC,MAAA,IAAI,CAAC,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,EAAE,GAAG,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,IAAI,CAAA;AAAA,IAChD;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,IAAA,CAAK,MAAA,EAAQ,CAAA;AAC1B","file":"chunk-J7K6K5DH.js","sourcesContent":["import {\n  resolveFlowBindings,\n  stableFlowJson,\n  type BindingOrigin,\n  type FlowExpressionContext,\n  type ResolvedNodeBindings,\n} from \"../contract/expression.js\";\nimport { isAgentNode, nodeBindings } from \"./node-shape.js\";\nimport type { FlowDefinition, FlowNode, NodeExecutionSnapshot } from \"./types.js\";\n\n/** Build the bounded expression context from immutable definition and snapshot state. */\nexport function buildFlowExpressionContext(\n  flow: FlowDefinition,\n  snapshots: Map<string, NodeExecutionSnapshot>,\n): FlowExpressionContext {\n  const nodes: FlowExpressionContext[\"nodes\"] = {};\n  for (const node of flow.nodes) {\n    const snapshot = snapshots.get(node.id);\n    const output =\n      snapshot?.status === \"complete\" && snapshot.output?.fields\n        ? { fields: snapshot.output.fields }\n        : undefined;\n    nodes[node.id] = { status: snapshot?.status ?? \"not_started\", output };\n  }\n  return {\n    flow: { input: flow.defaults?.run_input ?? {} },\n    defaults: flow.defaults,\n    nodes,\n  };\n}\n\n/** Resolve one node's named inputs and derive their runtime/agent origins. */\nexport function resolveNodeBindings(\n  flow: FlowDefinition,\n  node: FlowNode,\n  snapshots: Map<string, NodeExecutionSnapshot>,\n  flowInputOrigins: Record<string, BindingOrigin[]> = {},\n): ResolvedNodeBindings {\n  const origins = Object.fromEntries(\n    flow.nodes.map((producer) => [producer.id, isAgentNode(producer) ? \"agent\" : \"runtime\"]),\n  ) as Record<string, \"agent\" | \"runtime\">;\n  return resolveFlowBindings(\n    nodeBindings(node),\n    buildFlowExpressionContext(flow, snapshots),\n    origins,\n    flowInputOrigins,\n  );\n}\n\n/** Interpolate named, already-resolved binding values into an agent instruction. */\nexport function interpolateNodeInstruction(\n  instruction: string,\n  values: Record<string, unknown>,\n): string {\n  return instruction.replace(/\\$\\{([A-Za-z_][A-Za-z0-9_-]*)\\}/g, (_placeholder, name: string) => {\n    if (!Object.hasOwn(values, name)) {\n      throw new Error(`Node instruction binding ${name} is missing`);\n    }\n    const value = values[name];\n    return typeof value === \"string\" ? value : stableFlowJson(value);\n  });\n}\n","import type { NodeOutput } from \"@skaile/workspaces/types\";\nimport { evaluateFlowExpression, FlowExpressionError } from \"../contract/expression.js\";\nimport { buildFlowExpressionContext } from \"./bindings.js\";\nimport { isRouterNode } from \"./node-shape.js\";\nimport type { FlowDefinition, FlowNode, NodeExecutionSnapshot } from \"./types.js\";\n\nconst ROUTER_SELECTION_MARKER = \"\\n\\n[skaile:flow-router-selection:\";\n\n/** One deterministic router choice being settled in the current atomic batch. */\nexport interface RouterSettlement {\n  routerNodeId: string;\n  selectedTarget: string | null;\n}\n\n/** Internal result of evaluating one already-admitted router. */\nexport type RouterSelection =\n  | { selectedTarget: string | null }\n  | { unresolved: \"not-ready\" | \"no-match\" };\n\nfunction pendingProducerOutput(\n  flow: FlowDefinition,\n  snapshots: Map<string, NodeExecutionSnapshot>,\n  missingPath: string | undefined,\n): boolean {\n  if (!missingPath) return false;\n  const segments = missingPath.split(\".\");\n  if (\n    segments.length < 5 ||\n    segments[0] !== \"nodes\" ||\n    segments[2] !== \"output\" ||\n    segments[3] !== \"fields\"\n  ) {\n    return false;\n  }\n  const producer = flow.nodes.find(({ id }) => id === segments[1]);\n  if (!producer?.contract?.output?.fields) return false;\n  return snapshots.get(producer.id)?.status !== \"complete\";\n}\n\n/** Evaluate ordered routes for a router whose availability was already established. */\nexport function evaluateRouterSelection(\n  flow: FlowDefinition,\n  router: FlowNode,\n  snapshots: Map<string, NodeExecutionSnapshot>,\n): RouterSelection {\n  if (!isRouterNode(router)) return { unresolved: \"no-match\" };\n  const context = buildFlowExpressionContext(flow, snapshots);\n  for (const route of router.run.routes) {\n    try {\n      if (evaluateFlowExpression(route.when, context)) {\n        return { selectedTarget: route.target };\n      }\n    } catch (error) {\n      if (\n        error instanceof FlowExpressionError &&\n        pendingProducerOutput(flow, snapshots, error.missingPath)\n      ) {\n        return { unresolved: \"not-ready\" };\n      }\n      throw error;\n    }\n  }\n  return { unresolved: \"no-match\" };\n}\n\n/** Encode a router choice in the existing durable node-output envelope. */\nexport function routerSelectionOutput(selectedTarget: string | null): NodeOutput {\n  const summary =\n    selectedTarget === null\n      ? \"Router completed without selecting a target.\"\n      : `Router selected ${selectedTarget}.`;\n  return {\n    summary: `${summary}${ROUTER_SELECTION_MARKER}${JSON.stringify(selectedTarget)}]`,\n    artifacts: [],\n  };\n}\n\nfunction routeTargets(router: FlowNode): string[] {\n  if (!isRouterNode(router)) return [];\n  return [...new Set(router.run.routes.flatMap(({ target }) => (target === null ? [] : [target])))];\n}\n\ninterface RouterOwnershipIndex {\n  routers: FlowNode[];\n  outgoing: Map<string, string[]>;\n}\n\n/** Index router-to-router ownership through route targets and hard-flow descendants. */\nfunction routerOwnershipIndex(\n  flow: FlowDefinition,\n  snapshots: Map<string, NodeExecutionSnapshot>,\n): RouterOwnershipIndex {\n  const routers = flow.nodes.filter(\n    (node) =>\n      isRouterNode(node) &&\n      ![\"complete\", \"failed\", \"skipped\"].includes(snapshots.get(node.id)?.status ?? \"not_started\"),\n  );\n  const routerIds = new Set(routers.map(({ id }) => id));\n  const hardOutgoing = new Map<string, string[]>();\n  for (const edge of flow.edges) {\n    if (edge.type !== \"flow\") continue;\n    const targets = hardOutgoing.get(edge.source) ?? [];\n    targets.push(edge.target);\n    hardOutgoing.set(edge.source, targets);\n  }\n\n  const outgoing = new Map<string, string[]>();\n  for (const router of routers) {\n    const owned = new Set<string>();\n    const visited = new Set<string>();\n    const queue = routeTargets(router);\n    for (let index = 0; index < queue.length; index++) {\n      const nodeId = queue[index];\n      if (visited.has(nodeId)) continue;\n      visited.add(nodeId);\n      if (routerIds.has(nodeId)) owned.add(nodeId);\n      queue.push(...(hardOutgoing.get(nodeId) ?? []));\n    }\n    outgoing.set(router.id, [...owned]);\n  }\n  return { routers, outgoing };\n}\n\n/**\n * Return every member of each source router-ownership SCC.\n *\n * Route ownership is deliberately not a dependency arc and may cycle even though hard flow is\n * acyclic. Source SCC members are ungated so normal hard-edge/precondition admission and ordered\n * decidability select the settlement frontier. Ordinary parent components remain ahead of nested\n * children, while self-targeting and mutually targeting routers cannot deadlock admission. The\n * graph is preindexed and both SCC passes are iterative.\n */\nfunction routerOwnershipSourceComponents(\n  flow: FlowDefinition,\n  snapshots: Map<string, NodeExecutionSnapshot>,\n): string[][] {\n  const { routers, outgoing } = routerOwnershipIndex(flow, snapshots);\n  const reverse = new Map<string, string[]>();\n  for (const router of routers) reverse.set(router.id, []);\n  for (const [source, targets] of outgoing) {\n    for (const target of targets) reverse.get(target)?.push(source);\n  }\n\n  const visited = new Set<string>();\n  const finished: string[] = [];\n  for (const router of routers) {\n    if (visited.has(router.id)) continue;\n    const stack: Array<{ nodeId: string; exiting: boolean }> = [\n      { nodeId: router.id, exiting: false },\n    ];\n    while (stack.length > 0) {\n      const frame = stack.pop();\n      if (!frame) break;\n      if (frame.exiting) {\n        finished.push(frame.nodeId);\n        continue;\n      }\n      if (visited.has(frame.nodeId)) continue;\n      visited.add(frame.nodeId);\n      stack.push({ nodeId: frame.nodeId, exiting: true });\n      const targets = outgoing.get(frame.nodeId) ?? [];\n      for (let index = targets.length - 1; index >= 0; index--) {\n        if (!visited.has(targets[index])) {\n          stack.push({ nodeId: targets[index], exiting: false });\n        }\n      }\n    }\n  }\n\n  const componentByRouter = new Map<string, number>();\n  const components: string[][] = [];\n  for (let index = finished.length - 1; index >= 0; index--) {\n    const start = finished[index];\n    if (componentByRouter.has(start)) continue;\n    const componentId = components.length;\n    const component: string[] = [];\n    const stack = [start];\n    componentByRouter.set(start, componentId);\n    while (stack.length > 0) {\n      const nodeId = stack.pop();\n      if (!nodeId) break;\n      component.push(nodeId);\n      for (const source of reverse.get(nodeId) ?? []) {\n        if (componentByRouter.has(source)) continue;\n        componentByRouter.set(source, componentId);\n        stack.push(source);\n      }\n    }\n    components.push(component);\n  }\n\n  const incomingComponents = new Set<number>();\n  for (const [source, targets] of outgoing) {\n    const sourceComponent = componentByRouter.get(source);\n    for (const target of targets) {\n      const targetComponent = componentByRouter.get(target);\n      if (\n        sourceComponent !== undefined &&\n        targetComponent !== undefined &&\n        sourceComponent !== targetComponent\n      ) {\n        incomingComponents.add(targetComponent);\n      }\n    }\n  }\n\n  const definitionOrder = new Map(flow.nodes.map((node, index) => [node.id, index]));\n  const sourceComponents = components.filter(\n    (_, componentId) => !incomingComponents.has(componentId),\n  );\n  for (const component of sourceComponents) {\n    component.sort(\n      (left, right) =>\n        (definitionOrder.get(left) ?? Number.MAX_SAFE_INTEGER) -\n        (definitionOrder.get(right) ?? Number.MAX_SAFE_INTEGER),\n    );\n  }\n  return sourceComponents.sort(\n    (left, right) =>\n      (definitionOrder.get(left[0]) ?? Number.MAX_SAFE_INTEGER) -\n      (definitionOrder.get(right[0]) ?? Number.MAX_SAFE_INTEGER),\n  );\n}\n\n/** Decode and validate a completed router's engine-owned selection summary. */\nexport function persistedRouterSelection(\n  router: FlowNode,\n  snapshot: NodeExecutionSnapshot | undefined,\n): { selectedTarget: string | null } | undefined {\n  if (!isRouterNode(router) || snapshot?.status !== \"complete\") return undefined;\n  const summary = snapshot.output?.summary;\n  const markerIndex = summary?.lastIndexOf(ROUTER_SELECTION_MARKER) ?? -1;\n  if (!summary || markerIndex < 0 || !summary.endsWith(\"]\")) return undefined;\n  let selectedTarget: unknown;\n  try {\n    selectedTarget = JSON.parse(summary.slice(markerIndex + ROUTER_SELECTION_MARKER.length, -1));\n  } catch {\n    return undefined;\n  }\n  if (\n    selectedTarget !== null &&\n    (typeof selectedTarget !== \"string\" || !routeTargets(router).includes(selectedTarget))\n  ) {\n    return undefined;\n  }\n  if (selectedTarget === null && !router.run.routes.some(({ target }) => target === null)) {\n    return undefined;\n  }\n  return summary === routerSelectionOutput(selectedTarget).summary ? { selectedTarget } : undefined;\n}\n\nfunction edgeKey(source: string, target: string): string {\n  return `${source}\\u0000${target}`;\n}\n\n/**\n * Plan exclusive branch skips for all known router choices as one coordinated settlement.\n *\n * Only hard `flow` edges participate. The graph is indexed once, then each distinct losing\n * target performs a linear adjacency walk; optional and parallel edges can neither spread nor\n * preserve exclusivity. A selected route, a still-live unsettled router, shared convergence, or\n * an incoming hard predecessor outside the losing region protects that node and its descendants.\n */\nexport function planRouterSkips(\n  flow: FlowDefinition,\n  snapshots: Map<string, NodeExecutionSnapshot>,\n  settlements: readonly RouterSettlement[],\n): string[] {\n  const routers = flow.nodes.filter(isRouterNode);\n  const currentSelections = new Map(\n    settlements.map(({ routerNodeId, selectedTarget }) => [routerNodeId, selectedTarget]),\n  );\n  const knownSelections = new Map<string, string | null>();\n  for (const router of routers) {\n    if (currentSelections.has(router.id)) {\n      knownSelections.set(router.id, currentSelections.get(router.id) ?? null);\n      continue;\n    }\n    const persisted = persistedRouterSelection(router, snapshots.get(router.id));\n    if (persisted) knownSelections.set(router.id, persisted.selectedTarget);\n  }\n\n  const outgoing = new Map<string, string[]>();\n  const incoming = new Map<string, string[]>();\n  for (const edge of flow.edges) {\n    if (edge.type !== \"flow\") continue;\n    const targets = outgoing.get(edge.source) ?? [];\n    targets.push(edge.target);\n    outgoing.set(edge.source, targets);\n    const sources = incoming.get(edge.target) ?? [];\n    sources.push(edge.source);\n    incoming.set(edge.target, sources);\n  }\n\n  const losingRoots = new Set<string>();\n  const selectedRoots = new Set<string>();\n  const losingRouteEdges = new Set<string>();\n  for (const router of routers) {\n    if (!knownSelections.has(router.id)) continue;\n    const selectedTarget = knownSelections.get(router.id) ?? null;\n    if (selectedTarget !== null) selectedRoots.add(selectedTarget);\n    for (const target of routeTargets(router)) {\n      if (target === selectedTarget) continue;\n      losingRoots.add(target);\n      losingRouteEdges.add(edgeKey(router.id, target));\n    }\n  }\n\n  const candidateOrigins = new Map<string, Set<string>>();\n  for (const root of losingRoots) {\n    const visited = new Set<string>();\n    const queue = [root];\n    for (let index = 0; index < queue.length; index++) {\n      const nodeId = queue[index];\n      if (visited.has(nodeId)) continue;\n      visited.add(nodeId);\n      const origins = candidateOrigins.get(nodeId) ?? new Set<string>();\n      origins.add(root);\n      candidateOrigins.set(nodeId, origins);\n      for (const target of outgoing.get(nodeId) ?? []) queue.push(target);\n    }\n  }\n  const candidates = new Set(candidateOrigins.keys());\n\n  const protectionQueue = [...selectedRoots];\n  for (const [nodeId, origins] of candidateOrigins) {\n    if (origins.size >= 2) protectionQueue.push(nodeId);\n    for (const source of incoming.get(nodeId) ?? []) {\n      if (candidates.has(source)) continue;\n      if (losingRouteEdges.has(edgeKey(source, nodeId))) continue;\n      if ([\"failed\", \"skipped\"].includes(snapshots.get(source)?.status ?? \"not_started\")) continue;\n      protectionQueue.push(nodeId);\n      break;\n    }\n  }\n\n  const unknownSelections = new Map<string, string[]>();\n  for (const router of routers) {\n    if (knownSelections.has(router.id)) continue;\n    const status = snapshots.get(router.id)?.status ?? \"not_started\";\n    if (status === \"failed\" || status === \"skipped\") continue;\n    const targets = routeTargets(router);\n    unknownSelections.set(router.id, targets);\n    if (!candidates.has(router.id)) protectionQueue.push(...targets);\n  }\n\n  const protectedNodes = new Set<string>();\n  for (let index = 0; index < protectionQueue.length; index++) {\n    const nodeId = protectionQueue[index];\n    if (protectedNodes.has(nodeId)) continue;\n    protectedNodes.add(nodeId);\n    protectionQueue.push(...(outgoing.get(nodeId) ?? []));\n    protectionQueue.push(...(unknownSelections.get(nodeId) ?? []));\n  }\n\n  return flow.nodes.flatMap((node) =>\n    candidates.has(node.id) && !protectedNodes.has(node.id) ? [node.id] : [],\n  );\n}\n\n/**\n * Return every possible target branch gated by an unsettled router.\n *\n * Gating follows hard `flow` descendants only. A selected route, shared convergence, or another\n * live hard predecessor protects a node, matching settlement pruning without mutating snapshots.\n */\nexport function unsettledRouterBranchIds(\n  flow: FlowDefinition,\n  snapshots: Map<string, NodeExecutionSnapshot>,\n): Set<string> {\n  const unsettled = flow.nodes.filter(\n    (node) =>\n      isRouterNode(node) &&\n      ![\"complete\", \"failed\", \"skipped\"].includes(snapshots.get(node.id)?.status ?? \"not_started\"),\n  );\n  const branches = new Set(\n    planRouterSkips(\n      flow,\n      snapshots,\n      unsettled.map(({ id }) => ({ routerNodeId: id, selectedTarget: null })),\n    ),\n  );\n  for (const component of routerOwnershipSourceComponents(flow, snapshots)) {\n    for (const routerId of component) branches.delete(routerId);\n  }\n  return branches;\n}\n\n/**\n * Return one actually available, decidable router per source ownership component.\n *\n * Every source-component member remains ungated for normal admission. Within a settlement wave,\n * definition order chooses the first member that is both available and decidable; unresolved or\n * blocked peers cannot starve it. Limiting each component to one choice prevents a router from\n * completing atomically after that same wave makes its branch losing. Independent source\n * components can still settle together.\n */\nexport function availableRouterFrontier(\n  flow: FlowDefinition,\n  snapshots: Map<string, NodeExecutionSnapshot>,\n): FlowNode[] {\n  const nodesById = new Map(flow.nodes.map((node) => [node.id, node]));\n  return routerOwnershipSourceComponents(flow, snapshots).flatMap((component) => {\n    for (const routerId of component) {\n      const node = nodesById.get(routerId);\n      if (!node || snapshots.get(routerId)?.status !== \"available\") continue;\n      if (\"unresolved\" in evaluateRouterSelection(flow, node, snapshots)) continue;\n      return [node];\n    }\n    return [];\n  });\n}\n","import type {\n  FlowDefinition,\n  FlowEdge,\n  FlowNode,\n  FlowState,\n  NodeExecutionSnapshot,\n  NodePreconditionFailure,\n  NodeState,\n  NodeStatus,\n} from \"./types.js\";\nimport { evaluateFlowExpression, type FlowExpressionContext } from \"../contract/expression.js\";\nimport { buildFlowExpressionContext } from \"./bindings.js\";\nimport {\n  isActiveRuntimeNode,\n  isRouterNode,\n  nodeIsOptional,\n  nodeLabel,\n  nodeSkillId,\n} from \"./node-shape.js\";\nimport {\n  evaluateRouterSelection,\n  planRouterSkips,\n  unsettledRouterBranchIds,\n} from \"./router-settlement.js\";\n\n// ---------------------------------------------------------------------------\n// Core engine — stateless, pure functions\n// ---------------------------------------------------------------------------\n\n/** Return nodes with state owned by the current runtime. */\nfunction activeRuntimeNodes(flow: FlowDefinition): FlowNode[] {\n  return flow.nodes.filter(isActiveRuntimeNode);\n}\n\n/** Evaluate every authored admission condition without mutating runtime state. */\nfunction failedPreconditions(\n  node: FlowNode,\n  context: FlowExpressionContext,\n): NodePreconditionFailure[] {\n  const failures: NodePreconditionFailure[] = [];\n  for (const requirement of node.contract?.requires ?? []) {\n    const message = requirement.message ?? `Precondition failed: ${requirement.expr}`;\n    try {\n      if (!evaluateFlowExpression(requirement.expr, context)) {\n        failures.push({ expression: requirement.expr, message, reason: \"false\" });\n      }\n    } catch (error) {\n      failures.push({\n        expression: requirement.expr,\n        message,\n        reason: \"error\",\n        detail: error instanceof Error ? error.message : \"Flow expression evaluation failed\",\n      });\n    }\n  }\n  return failures;\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/** Result of resolving one available router against the current expression context. */\nexport interface RouterResolution {\n  /** First matching route target. `null` means every branch loses. */\n  selectedTarget: string | null;\n  /** Exclusive nodes belonging only to unselected route targets, in definition order. */\n  skippedNodeIds: string[];\n}\n\n/** Available router that cannot make a deterministic choice from the current snapshot. */\nexport interface UnresolvedRouterResolution {\n  /** Why the router remains available for a later drain pass. */\n  unresolved: \"not-ready\" | \"no-match\";\n}\n\n/**\n * Resolve the first matching route for a router that is currently available.\n *\n * Route conditions use the same bounded context as node preconditions and bindings. Resolution\n * is deliberately separate from state computation: unavailable routers return `undefined`\n * without evaluating any route. Losing route targets and their exclusive downstream paths are\n * returned for the caller to mark skipped. Exclusivity follows hard `flow` edges only and keeps\n * selected routes, unsettled-router targets, shared convergence, and externally reachable nodes\n * live. A declared producer output that is not complete yet returns a retryable unresolved result;\n * malformed expressions still throw their path-bearing evaluator error.\n *\n * @param flow - Parsed flow containing the router and branch graph.\n * @param routerNodeId - Router execution identity.\n * @param snapshots - Current node snapshots used for admission and expression values.\n * @returns The selected target and losing nodes, an unresolved reason while available but not\n *   decidable, or `undefined` while the router is unavailable.\n */\nexport function resolveAvailableRouter(\n  flow: FlowDefinition,\n  routerNodeId: string,\n  snapshots: Map<string, NodeExecutionSnapshot>,\n): RouterResolution | UnresolvedRouterResolution | undefined {\n  const router = flow.nodes.find((node) => node.id === routerNodeId);\n  if (!router || !isRouterNode(router)) return undefined;\n  const state = computeFlowStateFromSnapshots(flow, snapshots);\n  if (!state.available.includes(routerNodeId)) return undefined;\n\n  const selected = evaluateRouterSelection(flow, router, snapshots);\n  if (\"unresolved\" in selected) return selected;\n\n  return {\n    selectedTarget: selected.selectedTarget,\n    skippedNodeIds: planRouterSkips(flow, snapshots, [\n      { routerNodeId, selectedTarget: selected.selectedTarget },\n    ]),\n  };\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 * and every authored precondition evaluates true.\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 * This set-based overload has statuses but no completed output fields. Use\n * {@link computeFlowStateFromSnapshots} when a precondition reads node output.\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 every active runtime 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 = activeRuntimeNodes(flow);\n  const incoming = buildIncoming(flow.edges);\n  const snapshots = new Map<string, NodeExecutionSnapshot>();\n  for (const node of nodes) {\n    const status: NodeStatus = completedIds.has(node.id)\n      ? \"complete\"\n      : runningIds.has(node.id)\n        ? \"running\"\n        : skippedIds.has(node.id)\n          ? \"skipped\"\n          : \"not_started\";\n    snapshots.set(node.id, { status });\n  }\n  const gatedBranches = unsettledRouterBranchIds(flow, snapshots);\n  const context = buildFlowExpressionContext(flow, snapshots);\n\n  const nodeStates: NodeState[] = nodes.map((node) => {\n    const optional = nodeIsOptional(node);\n    const skillId = nodeSkillId(node);\n    const label = nodeLabel(node);\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        failedPreconditions: [],\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        failedPreconditions: [],\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        failedPreconditions: [],\n      };\n    }\n\n    if (gatedBranches.has(node.id)) {\n      return {\n        nodeId: node.id,\n        skillId,\n        label,\n        status: \"not_started\",\n        optional,\n        canRun: false,\n        blockers: [],\n        failedPreconditions: [],\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 preconditionFailures = failedPreconditions(node, context);\n    const canRun = hardBlockers.length === 0 && preconditionFailures.length === 0;\n\n    let status: NodeStatus;\n    if (!canRun) {\n      status = \"not_started\";\n    } else {\n      status = \"available\";\n    }\n\n    return {\n      nodeId: node.id,\n      skillId,\n      label,\n      status,\n      optional,\n      canRun,\n      blockers: hardBlockers,\n      failedPreconditions: preconditionFailures,\n    };\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) => !nodeIsOptional(n));\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. Every authored precondition\n *   must also evaluate true against the snapshot expression context.\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 every active runtime 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 = activeRuntimeNodes(flow);\n  const incoming = buildIncoming(flow.edges);\n  const gatedBranches = unsettledRouterBranchIds(flow, snapshots);\n  const context = buildFlowExpressionContext(flow, snapshots);\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 = nodeIsOptional(node);\n    const skillId = nodeSkillId(node);\n    const label = nodeLabel(node);\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    const isAdmissionState = status === \"not_started\" || status === \"available\";\n    const preconditionFailures = isAdmissionState ? failedPreconditions(node, context) : [];\n\n    // Recompute admission in both directions after fresh start or hydrate.\n    let effectiveStatus: NodeStatus = status;\n    if (isAdmissionState && gatedBranches.has(node.id)) {\n      effectiveStatus = \"not_started\";\n    } else if (isAdmissionState) {\n      effectiveStatus =\n        hardBlockers.length === 0 && preconditionFailures.length === 0\n          ? \"available\"\n          : \"not_started\";\n    }\n\n    return {\n      nodeId: node.id,\n      skillId,\n      label,\n      status: effectiveStatus,\n      optional,\n      canRun:\n        hardBlockers.length === 0 &&\n        preconditionFailures.length === 0 &&\n        effectiveStatus === \"available\",\n      blockers: hardBlockers,\n      failedPreconditions: preconditionFailures,\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) => !nodeIsOptional(n));\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. Unlike executable-node-filtered\n *   helpers, this walks raw edge targets and does not filter by node type — if a `group`,\n *   `sub-flow`, or `router` node is a direct successor, its ID can appear here. Callers that\n *   dispatch these IDs are responsible for filtering inert nodes.\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 = activeRuntimeNodes(flow);\n  const outgoing = buildOutgoing(flow.edges);\n\n  return nodes\n    .filter((n) => !completedIds.has(n.id))\n    .filter(nodeIsOptional)\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 ? nodeIsOptional(target) : false;\n      });\n    })\n    .map((n) => n.id);\n}\n","import * as z from \"zod\";\nimport { collectFlowBindingExpressions, inspectFlowExpression } from \"../contract/expression.js\";\nimport type { FlowDefinition, FlowNode } from \"./types.js\";\n\n/** Result of validating fields at a producer's consumed-output boundary. */\nexport interface NodeOutputValidationResult {\n  /** Whether the fields may be exposed to downstream consumers. */\n  valid: boolean;\n  /** Stable, path-bearing failures. Empty when validation is not required. */\n  issues: string[];\n}\n\nfunction consumerExpressions(node: FlowNode): string[] {\n  const expressions = (node.contract?.requires ?? []).map(({ expr }) => expr);\n  expressions.push(...collectFlowBindingExpressions(node.contract?.input));\n  if (node.run?.kind === \"router\") {\n    expressions.push(...node.run.routes.map(({ when }) => when));\n  }\n  return expressions;\n}\n\nfunction readsProducerOutput(node: FlowNode, producerId: string): boolean {\n  return consumerExpressions(node).some((expression) =>\n    inspectFlowExpression(expression, false).some(({ path }) =>\n      path.startsWith(`nodes.${producerId}.output.fields.`),\n    ),\n  );\n}\n\n/**\n * Return a producer's declared fields schema only when another node reads it.\n *\n * Consumption is deliberately limited to preconditions, named bindings, and\n * router conditions. Status reads and unreferenced declarations remain prose-only.\n */\nexport function getConsumedOutputSchema(\n  flow: FlowDefinition,\n  producerId: string,\n): Record<string, unknown> | undefined {\n  const producer = flow.nodes.find(({ id }) => id === producerId);\n  const schema = producer?.contract?.output?.fields;\n  if (!schema) return undefined;\n  return flow.nodes.some(\n    (consumer) => consumer.id !== producerId && readsProducerOutput(consumer, producerId),\n  )\n    ? schema\n    : undefined;\n}\n\n/** Validate proposed fields only when a downstream deterministic consumer requires them. */\nexport function validateConsumedNodeOutput(\n  flow: FlowDefinition,\n  producerId: string,\n  fields: Record<string, unknown> | undefined,\n): NodeOutputValidationResult {\n  const schema = getConsumedOutputSchema(flow, producerId);\n  if (!schema) return { valid: true, issues: [] };\n\n  try {\n    const validator = z.fromJSONSchema(schema as Parameters<typeof z.fromJSONSchema>[0]);\n    const parsed = validator.safeParse(fields ?? {});\n    if (parsed.success) return { valid: true, issues: [] };\n    return {\n      valid: false,\n      issues: parsed.error.issues\n        .map((issue) => {\n          const suffix = issue.path.map(String).join(\".\");\n          return `fields${suffix ? `.${suffix}` : \"\"}: ${issue.message}`;\n        })\n        .sort(),\n    };\n  } catch (error) {\n    return {\n      valid: false,\n      issues: [\n        `fields: invalid authored JSON Schema: ${\n          error instanceof Error ? error.message : String(error)\n        }`,\n      ],\n    };\n  }\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.looseObject({\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  data: z\n    .looseObject({\n      optional: z.boolean().optional(),\n      // Mandatory approval gate — autonomous mode cannot skip it.\n      approval: z.looseObject({ mandatory: z.boolean().optional() }).optional(),\n    })\n    .refine((d) => !(d.optional === true && d.approval?.mandatory === true), {\n      // A mandatory gate can never be skipped, so optional+mandatory is a\n      // contradiction — reject it rather than silently letting mandatory win.\n      message: \"a node cannot be both optional and a mandatory approval gate\",\n    })\n    .optional(),\n});\n\nconst FlowEdgeSchema = z.looseObject({\n  id: z.string().optional(),\n  source: z.string().min(1),\n  target: z.string().min(1),\n  condition: z.string().optional(),\n});\n\nexport const FlowManifestSchema = z.looseObject({\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    .looseObject({\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.string(), z.unknown()).optional(),\n    })\n    .optional(),\n  globals: z.record(z.string(), z.unknown()).optional(),\n  modes: z.record(z.string(), z.unknown()).optional(),\n  tier_presets: z.record(z.string(), z.record(z.string(), 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\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/factory-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[].run.assets plus legacy skill/sub-flow references\n * - File filter: just the manifest file (flows are single-file)\n */\n\nimport * as path from \"node:path\";\nimport type {\n  AssetKindFileFilter,\n  AssetKindRequiresEdge,\n  IAssetKindProvider,\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.1.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    const seen = new Set<string>();\n    const add = (to: string, field: string): void => {\n      if (seen.has(to)) return;\n      seen.add(to);\n      edges.push({ from: assetRef, to, field });\n    };\n\n    const nodes = manifest.nodes;\n    if (Array.isArray(nodes)) {\n      for (const node of nodes) {\n        if (typeof node !== \"object\" || node === null) continue;\n        const n = node as Record<string, unknown>;\n        const data = (\n          typeof n.data === \"object\" && n.data !== null ? (n.data as Record<string, unknown>) : {}\n        ) as Record<string, unknown>;\n        const run =\n          typeof n.run === \"object\" && n.run !== null ? (n.run as Record<string, unknown>) : {};\n\n        if (Array.isArray(run.assets)) {\n          for (const asset of run.assets) {\n            if (typeof asset === \"string\") add(asset, \"nodes[].run.assets\");\n          }\n        }\n\n        if (run.kind === \"sub-flow\" && typeof run.flow === \"string\") {\n          const flowRef = run.flow.startsWith(\"flow:\") ? run.flow : `flow:${run.flow}`;\n          add(flowRef, \"nodes[].run.flow\");\n        }\n\n        const skill = typeof data.skill === \"string\" ? data.skill : n.skill;\n        if (typeof skill === \"string\") {\n          add(skill, \"nodes[].data.skill\");\n        }\n\n        const subFlow = typeof data.flow === \"string\" ? data.flow : n.flow;\n        if (typeof subFlow === \"string\") {\n          add(subFlow.startsWith(\"flow:\") ? subFlow : `flow:${subFlow}`, \"nodes[].data.flow\");\n        }\n      }\n    }\n\n    return edges;\n  },\n};\n","import fs from \"node:fs\";\nimport path from \"node:path\";\nimport { assetSearchDirs } from \"@skaile/workspaces/core\";\nimport { parse as parseYaml } from \"yaml\";\nimport { parseFlowDefinition } from \"../contract/normalize.js\";\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  const authored = ext === \".yaml\" || ext === \".yml\" ? parseYaml(raw) : JSON.parse(raw);\n  const parsed = parseFlowDefinition(authored);\n  if (!parsed.ok) {\n    const details = parsed.errors\n      .map((issue) => `  ${issue.path || \"<root>\"}: ${issue.message}`)\n      .join(\"\\n\");\n    throw new Error(`Invalid flow definition:\\n${details}`);\n  }\n  return parsed.data;\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  // `assetSearchDirs` covers both the flat (`<root>/flows/`) and domain-nested\n  // (`<root>/<domain>/flows/`) layouts via the one shared layout primitive.\n  // De-dupe by id (first dir wins) so a root that happens to define a flow in\n  // both layouts surfaces it once.\n  const byId = new Map<string, FlowDefinition>();\n  for (const { dir } of assetSearchDirs(aiResourcesRoot, \"flows\")) {\n    for (const flow of loadFlowsFromDir(dir)) {\n      if (!byId.has(flow.id)) byId.set(flow.id, flow);\n    }\n  }\n  return [...byId.values()];\n}\n"]}