@open-mercato/core 0.7.1-develop.7193.1.910a5b0a1e → 0.7.1-develop.7195.1.b5efd1d51a

package/dist/modules/workflows/lib/graph-utils.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../src/modules/workflows/lib/graph-utils.ts"],
-  "sourcesContent": ["import type { Node, Edge } from '@xyflow/react'\nimport type { WorkflowDefinition } from '../data/entities'\n\n/**\n * Graph Utilities for Visual Workflow Editor\n *\n * Converts between ReactFlow graph representation and workflow definition JSON\n */\n\nexport interface GraphToDefinitionOptions {\n  includePositions?: boolean\n}\n\nexport interface DefinitionToGraphOptions {\n  autoLayout?: boolean\n  layoutSpacing?: { vertical: number; horizontal: number }\n}\n\n/**\n * Convert ReactFlow graph (nodes + edges) to workflow definition JSON\n */\nexport function graphToDefinition(\n  nodes: Node[],\n  edges: Edge[],\n  options: GraphToDefinitionOptions = {}\n): WorkflowDefinition['definition'] {\n  // Extract steps from nodes\n  const steps = nodes.map((node) => {\n    const step: any = {\n      stepId: node.id,\n      stepName: node.data.label || node.id,\n      stepType: mapNodeTypeToStepType(node.type || 'automated'),\n    }\n\n    // Add step-specific configuration\n    if (node.data.description) {\n      step.description = node.data.description\n    }\n\n    // Add timeout if present\n    if (node.data.timeout) {\n      step.timeout = node.data.timeout\n    }\n\n    // Add retryPolicy if present\n    if (node.data.retryPolicy) {\n      step.retryPolicy = node.data.retryPolicy\n    }\n\n    // Add generic config if present\n    if (node.data.config) {\n      step.config = node.data.config\n    }\n\n    // User task configuration\n    if (node.type === 'userTask' && node.data) {\n      step.userTaskConfig = {\n        assignedTo: node.data.assignedTo,\n        assignedToRoles: node.data.assignedToRoles || [],\n        formKey: node.data.formKey,\n        allowedActions: node.data.allowedActions || ['complete', 'cancel'],\n      }\n\n      // Add form schema if present\n      if ((node.data as any).formSchema || (node.data as any).userTaskConfig?.formSchema) {\n        step.userTaskConfig.formSchema = (node.data as any).formSchema || (node.data as any).userTaskConfig.formSchema\n      }\n\n      // Add advanced fields if present\n      if ((node.data as any).assignmentRule || (node.data as any).userTaskConfig?.assignmentRule) {\n        step.userTaskConfig.assignmentRule = (node.data as any).assignmentRule || (node.data as any).userTaskConfig.assignmentRule\n      }\n\n      if ((node.data as any).slaDuration || (node.data as any).userTaskConfig?.slaDuration) {\n        step.userTaskConfig.slaDuration = (node.data as any).slaDuration || (node.data as any).userTaskConfig.slaDuration\n      }\n\n      if ((node.data as any).escalationRules || (node.data as any).userTaskConfig?.escalationRules) {\n        step.userTaskConfig.escalationRules = (node.data as any).escalationRules || (node.data as any).userTaskConfig.escalationRules\n      }\n    }\n\n    // Wait for signal configuration\n    if (node.type === 'waitForSignal' && node.data.signalConfig) {\n      step.signalConfig = node.data.signalConfig\n    }\n\n    // Step activities (for AUTOMATED steps)\n    if (node.type === 'automated' && node.data.activities) {\n      step.activities = node.data.activities\n    }\n\n    // Pre-conditions (for START steps)\n    if (node.type === 'start' && (node.data as any).preConditions && (node.data as any).preConditions.length > 0) {\n      step.preConditions = (node.data as any).preConditions\n    }\n\n    // Store position for visual editor\n    if (options.includePositions && node.position) {\n      step._editorPosition = {\n        x: node.position.x,\n        y: node.position.y,\n      }\n    }\n\n    return step\n  })\n\n  // Extract transitions from edges\n  const transitions = edges.map((edge) => {\n    const edgeData = edge.data as any\n    const transition: any = {\n      transitionId: edge.id,\n      fromStepId: edge.source,\n      toStepId: edge.target,\n      trigger: edgeData?.trigger || 'auto',\n    }\n\n    // Add transition name if present\n    if (edgeData?.transitionName) {\n      transition.transitionName = edgeData.transitionName\n    }\n\n    // Add priority if present (default 0)\n    if (edgeData?.priority !== undefined) {\n      transition.priority = edgeData.priority\n    }\n\n    // Add continueOnActivityFailure if present (default false)\n    if (edgeData?.continueOnActivityFailure !== undefined) {\n      transition.continueOnActivityFailure = edgeData.continueOnActivityFailure\n    }\n\n    // Add conditions if present\n    if (edgeData?.preConditions && edgeData.preConditions.length > 0) {\n      transition.preConditions = edgeData.preConditions\n    }\n\n    if (edgeData?.postConditions && edgeData.postConditions.length > 0) {\n      transition.postConditions = edgeData.postConditions\n    }\n\n    // Add activities if present in edge data\n    if (edgeData?.activities && edgeData.activities.length > 0) {\n      transition.activities = edgeData.activities.map((activity: any) => ({\n        activityId: activity.activityId,\n        activityName: activity.activityName,\n        activityType: activity.activityType,\n        config: activity.config || {},\n        // Include all optional fields\n        ...(activity.async !== undefined && { async: activity.async }),\n        ...(activity.timeout && { timeout: activity.timeout }),\n        ...(activity.retryPolicy && { retryPolicy: activity.retryPolicy }),\n        ...(activity.compensate !== undefined && { compensate: activity.compensate }),\n      }))\n    } else {\n      // Check if source node is automated and has activity data\n      // If so, place the activity in this transition\n      const sourceNode = nodes.find(n => n.id === edge.source)\n      if (sourceNode && sourceNode.type === 'automated' && sourceNode.data) {\n        if (sourceNode.data.activityType || sourceNode.data.activityId) {\n          const activity: any = {\n            activityId: sourceNode.data.activityId || `activity_${sourceNode.id}`,\n            activityName: sourceNode.data.activityName || sourceNode.data.label || 'Automated Activity',\n            activityType: sourceNode.data.activityType || 'CALL_API',\n            config: sourceNode.data.activityConfig || {},\n          }\n          // Include optional activity fields from node data\n          if ((sourceNode.data as any).activityAsync !== undefined) {\n            activity.async = (sourceNode.data as any).activityAsync\n          }\n          if ((sourceNode.data as any).activityTimeout) {\n            activity.timeout = (sourceNode.data as any).activityTimeout\n          }\n          if ((sourceNode.data as any).activityRetryPolicy) {\n            activity.retryPolicy = (sourceNode.data as any).activityRetryPolicy\n          }\n          if ((sourceNode.data as any).activityCompensate !== undefined) {\n            activity.compensate = (sourceNode.data as any).activityCompensate\n          }\n          transition.activities = [activity]\n        }\n      }\n    }\n\n    // Add label if present (legacy field, transitionName is preferred)\n    if (edgeData?.label && !transition.transitionName) {\n      transition.transitionName = edgeData.label\n    }\n\n    return transition\n  })\n\n  return {\n    steps,\n    transitions,\n    activities: [], // Global activities can be added later\n  }\n}\n\n/**\n * Convert workflow definition JSON to ReactFlow graph (nodes + edges)\n */\nexport function definitionToGraph(\n  definition: WorkflowDefinition['definition'],\n  options: DefinitionToGraphOptions = {}\n): { nodes: Node[]; edges: Edge[] } {\n  const { autoLayout = true, layoutSpacing = { vertical: 200, horizontal: 300 } } = options\n\n  // Build step map for quick lookup\n  const stepMap = new Map(definition.steps.map(step => [step.stepId, step]))\n\n  // Calculate smart layout positions if autoLayout is enabled\n  const positions = autoLayout\n    ? calculateSmartLayout(definition.steps, definition.transitions, layoutSpacing)\n    : null\n\n  // Convert steps to nodes\n  const nodes: Node[] = definition.steps.map((step, index) => {\n    // Determine position\n    let position = positions?.get(step.stepId) || { x: 250, y: 50 + index * layoutSpacing.vertical }\n\n    // Use stored position if available and not auto-layouting\n    if (!autoLayout && (step as any)._editorPosition) {\n      position = (step as any)._editorPosition\n    }\n\n    // Map step type to node type\n    const nodeType = mapStepTypeToNodeType(step.stepType)\n\n    // Build node data\n    const nodeData: any = {\n      label: step.stepName,\n      description: (step as any).description,\n      stepNumber: index > 0 ? index : undefined,\n    }\n\n    // Add timeout if present\n    if ((step as any).timeout) {\n      nodeData.timeout = (step as any).timeout\n    }\n\n    // Add retryPolicy if present\n    if ((step as any).retryPolicy) {\n      nodeData.retryPolicy = (step as any).retryPolicy\n    }\n\n    // Add generic config if present\n    if ((step as any).config) {\n      nodeData.config = (step as any).config\n    }\n\n    // Add user task data\n    if (step.stepType === 'USER_TASK' && step.userTaskConfig) {\n      nodeData.assignedTo = step.userTaskConfig.assignedTo\n      nodeData.assignedToRoles = step.userTaskConfig.assignedToRoles || []\n      nodeData.formKey = step.userTaskConfig.formKey\n      nodeData.allowedActions = step.userTaskConfig.allowedActions\n\n      // Store full userTaskConfig for advanced fields\n      nodeData.userTaskConfig = step.userTaskConfig\n\n      // Add form schema if present\n      if (step.userTaskConfig.formSchema) {\n        nodeData.formSchema = step.userTaskConfig.formSchema\n      }\n\n      // Add advanced fields if present\n      if (step.userTaskConfig.assignmentRule) {\n        nodeData.assignmentRule = step.userTaskConfig.assignmentRule\n      }\n\n      if (step.userTaskConfig.slaDuration) {\n        nodeData.slaDuration = step.userTaskConfig.slaDuration\n      }\n\n      if (step.userTaskConfig.escalationRules) {\n        nodeData.escalationRules = step.userTaskConfig.escalationRules\n      }\n    }\n\n    // Add wait for signal data\n    if (step.stepType === 'WAIT_FOR_SIGNAL' && (step as any).signalConfig) {\n      nodeData.signalConfig = (step as any).signalConfig\n    }\n\n    // Add step activities data (for AUTOMATED steps)\n    if (step.stepType === 'AUTOMATED' && (step as any).activities) {\n      nodeData.activities = (step as any).activities\n    }\n\n    // Add pre-conditions data (for START steps)\n    if (step.stepType === 'START' && (step as any).preConditions) {\n      nodeData.preConditions = (step as any).preConditions\n    }\n\n    // Set badge based on type\n    nodeData.badge = getBadgeForNodeType(nodeType)\n\n    // Default status is pending\n    nodeData.status = 'pending'\n\n    return {\n      id: step.stepId,\n      type: nodeType,\n      position,\n      data: nodeData,\n    }\n  })\n\n  // Convert transitions to edges\n  const edges: Edge[] = definition.transitions.map((transition) => {\n    return {\n      id: transition.transitionId,\n      source: transition.fromStepId,\n      target: transition.toStepId,\n      type: 'workflowTransition',\n      data: {\n        trigger: transition.trigger,\n        transitionName: (transition as any).transitionName,\n        priority: (transition as any).priority !== undefined ? (transition as any).priority : 0,\n        continueOnActivityFailure: (transition as any).continueOnActivityFailure !== undefined\n          ? (transition as any).continueOnActivityFailure\n          : false,\n        preConditions: transition.preConditions || [],\n        postConditions: transition.postConditions || [],\n        activities: transition.activities || [],\n        label: (transition as any).transitionName || (transition as any).label, // Backward compat\n        state: (transition as any).state || 'pending', // Default edge state\n      },\n    }\n  })\n\n  return { nodes, edges }\n}\n\n/**\n * Calculate smart layout positions for workflow nodes\n * Uses a layered/hierarchical layout algorithm that:\n * 1. Assigns levels (ranks) to nodes based on graph topology\n * 2. Spreads sibling nodes horizontally at the same level\n * 3. Centers merge points below their incoming nodes\n */\nfunction calculateSmartLayout(\n  steps: any[],\n  transitions: any[],\n  spacing: { vertical: number; horizontal: number }\n): Map<string, { x: number; y: number }> {\n  const positions = new Map<string, { x: number; y: number }>()\n\n  if (steps.length === 0) return positions\n\n  // Build adjacency lists\n  const outgoing = new Map<string, string[]>() // node -> children\n  const incoming = new Map<string, string[]>() // node -> parents\n\n  for (const step of steps) {\n    outgoing.set(step.stepId, [])\n    incoming.set(step.stepId, [])\n  }\n\n  for (const t of transitions) {\n    const children = outgoing.get(t.fromStepId) || []\n    children.push(t.toStepId)\n    outgoing.set(t.fromStepId, children)\n\n    const parents = incoming.get(t.toStepId) || []\n    parents.push(t.fromStepId)\n    incoming.set(t.toStepId, parents)\n  }\n\n  // Find start node(s) - nodes with no incoming edges\n  const startNodes = steps.filter(s => (incoming.get(s.stepId) || []).length === 0)\n  if (startNodes.length === 0) {\n    // Fallback: use first step as start\n    startNodes.push(steps[0])\n  }\n\n  // Assign levels using BFS (longest path from start)\n  const levels = new Map<string, number>()\n  const queue: Array<{ id: string; level: number }> = []\n\n  for (const start of startNodes) {\n    queue.push({ id: start.stepId, level: 0 })\n  }\n\n  while (queue.length > 0) {\n    const { id, level } = queue.shift()!\n    const currentLevel = levels.get(id)\n\n    // Only propagate when this path improves the node's level (longest path).\n    // Without this guard a cyclic graph (renegotiation/revision loops) keeps\n    // re-enqueuing children forever and freezes the browser (script timeout).\n    if (currentLevel !== undefined && level <= currentLevel) continue\n    levels.set(id, level)\n\n    // Safety cap: in a DAG a node's level is bounded by the node count; a\n    // higher value means we are walking a cycle, so stop descending.\n    if (level > steps.length) continue\n\n    const children = outgoing.get(id) || []\n    for (const child of children) {\n      queue.push({ id: child, level: level + 1 })\n    }\n  }\n\n  // Group nodes by level\n  const nodesByLevel = new Map<number, string[]>()\n  for (const [nodeId, level] of levels) {\n    const nodesAtLevel = nodesByLevel.get(level) || []\n    nodesAtLevel.push(nodeId)\n    nodesByLevel.set(level, nodesAtLevel)\n  }\n\n  // Calculate positions\n  const centerX = 400 // Center line for the graph\n  const startY = 50\n\n  for (const [level, nodeIds] of nodesByLevel) {\n    const count = nodeIds.length\n    const y = startY + level * spacing.vertical\n\n    if (count === 1) {\n      // Single node at this level - center it\n      positions.set(nodeIds[0], { x: centerX, y })\n    } else {\n      // Multiple nodes at this level - spread them horizontally\n      const totalWidth = (count - 1) * spacing.horizontal\n      const startX = centerX - totalWidth / 2\n\n      // Sort nodes by their parent's position for consistent ordering\n      nodeIds.sort((a, b) => {\n        const parentsA = incoming.get(a) || []\n        const parentsB = incoming.get(b) || []\n        const parentPosA = parentsA.length > 0 ? (positions.get(parentsA[0])?.x || 0) : 0\n        const parentPosB = parentsB.length > 0 ? (positions.get(parentsB[0])?.x || 0) : 0\n        return parentPosA - parentPosB\n      })\n\n      nodeIds.forEach((nodeId, idx) => {\n        positions.set(nodeId, { x: startX + idx * spacing.horizontal, y })\n      })\n    }\n  }\n\n  return positions\n}\n\n/**\n * Map node type to step type (for graph \u2192 definition)\n */\nfunction mapNodeTypeToStepType(nodeType: string): string {\n  const mapping: Record<string, string> = {\n    start: 'START',\n    end: 'END',\n    userTask: 'USER_TASK',\n    automated: 'AUTOMATED',\n    decision: 'DECISION',\n    waitForSignal: 'WAIT_FOR_SIGNAL',\n    waitForTimer: 'WAIT_FOR_TIMER',\n  }\n  return mapping[nodeType] || 'AUTOMATED'\n}\n\n/**\n * Map step type to node type (for definition \u2192 graph)\n */\nfunction mapStepTypeToNodeType(stepType: string): string {\n  const mapping: Record<string, string> = {\n    START: 'start',\n    END: 'end',\n    USER_TASK: 'userTask',\n    AUTOMATED: 'automated',\n    DECISION: 'decision',\n    WAIT_FOR_SIGNAL: 'waitForSignal',\n    WAIT_FOR_TIMER: 'waitForTimer',\n  }\n  return mapping[stepType] || 'automated'\n}\n\n/**\n * Get badge text for node type\n */\nfunction getBadgeForNodeType(nodeType: string): string {\n  const badges: Record<string, string> = {\n    start: 'Start',\n    end: 'End',\n    userTask: 'User Task',\n    automated: 'Automated',\n    decision: 'Decision',\n    waitForSignal: 'Wait for Signal',\n    waitForTimer: 'Wait for Timer',\n  }\n  return badges[nodeType] || 'Task'\n}\n\n/**\n * Validate workflow graph\n */\nexport interface ValidationError {\n  type: 'error' | 'warning'\n  message: string\n  nodeId?: string\n  edgeId?: string\n}\n\nexport function validateWorkflowGraph(nodes: Node[], edges: Edge[]): ValidationError[] {\n  const errors: ValidationError[] = []\n\n  // Check for at least one start node\n  const startNodes = nodes.filter((n) => n.type === 'start')\n  if (startNodes.length === 0) {\n    errors.push({\n      type: 'error',\n      message: 'Workflow must have at least one START node',\n    })\n  }\n  if (startNodes.length > 1) {\n    errors.push({\n      type: 'warning',\n      message: 'Workflow has multiple START nodes',\n    })\n  }\n\n  // Check for at least one end node\n  const endNodes = nodes.filter((n) => n.type === 'end')\n  if (endNodes.length === 0) {\n    errors.push({\n      type: 'error',\n      message: 'Workflow must have at least one END node',\n    })\n  }\n\n  // Check for orphan nodes (no incoming or outgoing edges)\n  for (const node of nodes) {\n    if (node.type === 'start') continue // Start nodes don't need incoming edges\n    if (node.type === 'end') continue // End nodes don't need outgoing edges\n\n    const hasIncoming = edges.some((e) => e.target === node.id)\n    const hasOutgoing = edges.some((e) => e.source === node.id)\n\n    if (!hasIncoming && !hasOutgoing) {\n      errors.push({\n        type: 'error',\n        message: `Node \"${node.data.label}\" is disconnected`,\n        nodeId: node.id,\n      })\n    } else if (!hasIncoming) {\n      errors.push({\n        type: 'warning',\n        message: `Node \"${node.data.label}\" has no incoming connections`,\n        nodeId: node.id,\n      })\n    } else if (!hasOutgoing) {\n      errors.push({\n        type: 'warning',\n        message: `Node \"${node.data.label}\" has no outgoing connections`,\n        nodeId: node.id,\n      })\n    }\n  }\n\n  // Check for cycles (simple detection)\n  const hasCycle = detectCycle(nodes, edges)\n  if (hasCycle) {\n    errors.push({\n      type: 'warning',\n      message: 'Workflow contains cycles (loops)',\n    })\n  }\n\n  // Check for duplicate step IDs\n  const stepIds = new Set<string>()\n  for (const node of nodes) {\n    if (stepIds.has(node.id)) {\n      errors.push({\n        type: 'error',\n        message: `Duplicate step ID: ${node.id}`,\n        nodeId: node.id,\n      })\n    }\n    stepIds.add(node.id)\n  }\n\n  return errors\n}\n\n/**\n * Simple cycle detection using DFS\n */\nfunction detectCycle(nodes: Node[], edges: Edge[]): boolean {\n  const adjList = new Map<string, string[]>()\n\n  // Build adjacency list\n  for (const node of nodes) {\n    adjList.set(node.id, [])\n  }\n  for (const edge of edges) {\n    const neighbors = adjList.get(edge.source) || []\n    neighbors.push(edge.target)\n    adjList.set(edge.source, neighbors)\n  }\n\n  const visited = new Set<string>()\n  const recStack = new Set<string>()\n\n  function dfs(nodeId: string): boolean {\n    visited.add(nodeId)\n    recStack.add(nodeId)\n\n    const neighbors = adjList.get(nodeId) || []\n    for (const neighbor of neighbors) {\n      if (!visited.has(neighbor)) {\n        if (dfs(neighbor)) return true\n      } else if (recStack.has(neighbor)) {\n        return true // Cycle detected\n      }\n    }\n\n    recStack.delete(nodeId)\n    return false\n  }\n\n  for (const node of nodes) {\n    if (!visited.has(node.id)) {\n      if (dfs(node.id)) return true\n    }\n  }\n\n  return false\n}\n\n/**\n * Sanitize ID to match schema regex: /^[a-z0-9_-]+$/\n * Converts to lowercase, replaces invalid characters with underscores\n */\nexport function sanitizeId(input: string): string {\n  return input\n    .toLowerCase()\n    .replace(/[^a-z0-9_-]/g, '_')\n    .replace(/_{2,}/g, '_') // Replace multiple underscores with single\n    .replace(/(?:^_|_$)/g, '') // Remove leading/trailing underscores\n}\n\n/**\n * Validate ID matches schema regex: /^[a-z0-9_-]+$/\n */\nexport function validateId(id: string): boolean {\n  return /^[a-z0-9_-]+$/.test(id)\n}\n\n/**\n * Generate unique step ID\n */\nexport function generateStepId(prefix: string = 'step'): string {\n  const id = `${prefix}_${Date.now()}_${Math.random().toString(36).substr(2, 9)}`\n  return sanitizeId(id)\n}\n\n/**\n * Generate unique transition ID\n */\nexport function generateTransitionId(fromStepId: string, toStepId: string): string {\n  const id = `e_${fromStepId}_${toStepId}`\n  return sanitizeId(id)\n}\n\n/**\n * Append a new edge to the list, skipping duplicate connections.\n *\n * A plain-data replacement for React Flow's `addEdge` so the visual editor\n * page does not pull the `@xyflow/react` runtime out of its lazy boundary\n * (#3169). Mirrors `addEdge`'s dedup rule: an edge is dropped when one with\n * the same source/target endpoints (and handles) already exists.\n */\nexport function appendWorkflowEdge(edges: Edge[], edge: Edge): Edge[] {\n  const isDuplicate = edges.some(\n    (existing) =>\n      existing.source === edge.source &&\n      existing.target === edge.target &&\n      // Match addEdge: empty-string and nullish handles are equivalent.\n      (existing.sourceHandle || null) === (edge.sourceHandle || null) &&\n      (existing.targetHandle || null) === (edge.targetHandle || null),\n  )\n  return isDuplicate ? edges : [...edges, edge]\n}\n"],
-  "mappings": "AAqBO,SAAS,kBACd,OACA,OACA,UAAoC,CAAC,GACH;AAElC,QAAM,QAAQ,MAAM,IAAI,CAAC,SAAS;AAChC,UAAM,OAAY;AAAA,MAChB,QAAQ,KAAK;AAAA,MACb,UAAU,KAAK,KAAK,SAAS,KAAK;AAAA,MAClC,UAAU,sBAAsB,KAAK,QAAQ,WAAW;AAAA,IAC1D;AAGA,QAAI,KAAK,KAAK,aAAa;AACzB,WAAK,cAAc,KAAK,KAAK;AAAA,IAC/B;AAGA,QAAI,KAAK,KAAK,SAAS;AACrB,WAAK,UAAU,KAAK,KAAK;AAAA,IAC3B;AAGA,QAAI,KAAK,KAAK,aAAa;AACzB,WAAK,cAAc,KAAK,KAAK;AAAA,IAC/B;AAGA,QAAI,KAAK,KAAK,QAAQ;AACpB,WAAK,SAAS,KAAK,KAAK;AAAA,IAC1B;AAGA,QAAI,KAAK,SAAS,cAAc,KAAK,MAAM;AACzC,WAAK,iBAAiB;AAAA,QACpB,YAAY,KAAK,KAAK;AAAA,QACtB,iBAAiB,KAAK,KAAK,mBAAmB,CAAC;AAAA,QAC/C,SAAS,KAAK,KAAK;AAAA,QACnB,gBAAgB,KAAK,KAAK,kBAAkB,CAAC,YAAY,QAAQ;AAAA,MACnE;AAGA,UAAK,KAAK,KAAa,cAAe,KAAK,KAAa,gBAAgB,YAAY;AAClF,aAAK,eAAe,aAAc,KAAK,KAAa,cAAe,KAAK,KAAa,eAAe;AAAA,MACtG;AAGA,UAAK,KAAK,KAAa,kBAAmB,KAAK,KAAa,gBAAgB,gBAAgB;AAC1F,aAAK,eAAe,iBAAkB,KAAK,KAAa,kBAAmB,KAAK,KAAa,eAAe;AAAA,MAC9G;AAEA,UAAK,KAAK,KAAa,eAAgB,KAAK,KAAa,gBAAgB,aAAa;AACpF,aAAK,eAAe,cAAe,KAAK,KAAa,eAAgB,KAAK,KAAa,eAAe;AAAA,MACxG;AAEA,UAAK,KAAK,KAAa,mBAAoB,KAAK,KAAa,gBAAgB,iBAAiB;AAC5F,aAAK,eAAe,kBAAmB,KAAK,KAAa,mBAAoB,KAAK,KAAa,eAAe;AAAA,MAChH;AAAA,IACF;AAGA,QAAI,KAAK,SAAS,mBAAmB,KAAK,KAAK,cAAc;AAC3D,WAAK,eAAe,KAAK,KAAK;AAAA,IAChC;AAGA,QAAI,KAAK,SAAS,eAAe,KAAK,KAAK,YAAY;AACrD,WAAK,aAAa,KAAK,KAAK;AAAA,IAC9B;AAGA,QAAI,KAAK,SAAS,WAAY,KAAK,KAAa,iBAAkB,KAAK,KAAa,cAAc,SAAS,GAAG;AAC5G,WAAK,gBAAiB,KAAK,KAAa;AAAA,IAC1C;AAGA,QAAI,QAAQ,oBAAoB,KAAK,UAAU;AAC7C,WAAK,kBAAkB;AAAA,QACrB,GAAG,KAAK,SAAS;AAAA,QACjB,GAAG,KAAK,SAAS;AAAA,MACnB;AAAA,IACF;AAEA,WAAO;AAAA,EACT,CAAC;AAGD,QAAM,cAAc,MAAM,IAAI,CAAC,SAAS;AACtC,UAAM,WAAW,KAAK;AACtB,UAAM,aAAkB;AAAA,MACtB,cAAc,KAAK;AAAA,MACnB,YAAY,KAAK;AAAA,MACjB,UAAU,KAAK;AAAA,MACf,SAAS,UAAU,WAAW;AAAA,IAChC;AAGA,QAAI,UAAU,gBAAgB;AAC5B,iBAAW,iBAAiB,SAAS;AAAA,IACvC;AAGA,QAAI,UAAU,aAAa,QAAW;AACpC,iBAAW,WAAW,SAAS;AAAA,IACjC;AAGA,QAAI,UAAU,8BAA8B,QAAW;AACrD,iBAAW,4BAA4B,SAAS;AAAA,IAClD;AAGA,QAAI,UAAU,iBAAiB,SAAS,cAAc,SAAS,GAAG;AAChE,iBAAW,gBAAgB,SAAS;AAAA,IACtC;AAEA,QAAI,UAAU,kBAAkB,SAAS,eAAe,SAAS,GAAG;AAClE,iBAAW,iBAAiB,SAAS;AAAA,IACvC;AAGA,QAAI,UAAU,cAAc,SAAS,WAAW,SAAS,GAAG;AAC1D,iBAAW,aAAa,SAAS,WAAW,IAAI,CAAC,cAAmB;AAAA,QAClE,YAAY,SAAS;AAAA,QACrB,cAAc,SAAS;AAAA,QACvB,cAAc,SAAS;AAAA,QACvB,QAAQ,SAAS,UAAU,CAAC;AAAA;AAAA,QAE5B,GAAI,SAAS,UAAU,UAAa,EAAE,OAAO,SAAS,MAAM;AAAA,QAC5D,GAAI,SAAS,WAAW,EAAE,SAAS,SAAS,QAAQ;AAAA,QACpD,GAAI,SAAS,eAAe,EAAE,aAAa,SAAS,YAAY;AAAA,QAChE,GAAI,SAAS,eAAe,UAAa,EAAE,YAAY,SAAS,WAAW;AAAA,MAC7E,EAAE;AAAA,IACJ,OAAO;AAGL,YAAM,aAAa,MAAM,KAAK,OAAK,EAAE,OAAO,KAAK,MAAM;AACvD,UAAI,cAAc,WAAW,SAAS,eAAe,WAAW,MAAM;AACpE,YAAI,WAAW,KAAK,gBAAgB,WAAW,KAAK,YAAY;AAC9D,gBAAM,WAAgB;AAAA,YACpB,YAAY,WAAW,KAAK,cAAc,YAAY,WAAW,EAAE;AAAA,YACnE,cAAc,WAAW,KAAK,gBAAgB,WAAW,KAAK,SAAS;AAAA,YACvE,cAAc,WAAW,KAAK,gBAAgB;AAAA,YAC9C,QAAQ,WAAW,KAAK,kBAAkB,CAAC;AAAA,UAC7C;AAEA,cAAK,WAAW,KAAa,kBAAkB,QAAW;AACxD,qBAAS,QAAS,WAAW,KAAa;AAAA,UAC5C;AACA,cAAK,WAAW,KAAa,iBAAiB;AAC5C,qBAAS,UAAW,WAAW,KAAa;AAAA,UAC9C;AACA,cAAK,WAAW,KAAa,qBAAqB;AAChD,qBAAS,cAAe,WAAW,KAAa;AAAA,UAClD;AACA,cAAK,WAAW,KAAa,uBAAuB,QAAW;AAC7D,qBAAS,aAAc,WAAW,KAAa;AAAA,UACjD;AACA,qBAAW,aAAa,CAAC,QAAQ;AAAA,QACnC;AAAA,MACF;AAAA,IACF;AAGA,QAAI,UAAU,SAAS,CAAC,WAAW,gBAAgB;AACjD,iBAAW,iBAAiB,SAAS;AAAA,IACvC;AAEA,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,YAAY,CAAC;AAAA;AAAA,EACf;AACF;AAKO,SAAS,kBACd,YACA,UAAoC,CAAC,GACH;AAClC,QAAM,EAAE,aAAa,MAAM,gBAAgB,EAAE,UAAU,KAAK,YAAY,IAAI,EAAE,IAAI;AAGlF,QAAM,UAAU,IAAI,IAAI,WAAW,MAAM,IAAI,UAAQ,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;AAGzE,QAAM,YAAY,aACd,qBAAqB,WAAW,OAAO,WAAW,aAAa,aAAa,IAC5E;AAGJ,QAAM,QAAgB,WAAW,MAAM,IAAI,CAAC,MAAM,UAAU;AAE1D,QAAI,WAAW,WAAW,IAAI,KAAK,MAAM,KAAK,EAAE,GAAG,KAAK,GAAG,KAAK,QAAQ,cAAc,SAAS;AAG/F,QAAI,CAAC,cAAe,KAAa,iBAAiB;AAChD,iBAAY,KAAa;AAAA,IAC3B;AAGA,UAAM,WAAW,sBAAsB,KAAK,QAAQ;AAGpD,UAAM,WAAgB;AAAA,MACpB,OAAO,KAAK;AAAA,MACZ,aAAc,KAAa;AAAA,MAC3B,YAAY,QAAQ,IAAI,QAAQ;AAAA,IAClC;AAGA,QAAK,KAAa,SAAS;AACzB,eAAS,UAAW,KAAa;AAAA,IACnC;AAGA,QAAK,KAAa,aAAa;AAC7B,eAAS,cAAe,KAAa;AAAA,IACvC;AAGA,QAAK,KAAa,QAAQ;AACxB,eAAS,SAAU,KAAa;AAAA,IAClC;AAGA,QAAI,KAAK,aAAa,eAAe,KAAK,gBAAgB;AACxD,eAAS,aAAa,KAAK,eAAe;AAC1C,eAAS,kBAAkB,KAAK,eAAe,mBAAmB,CAAC;AACnE,eAAS,UAAU,KAAK,eAAe;AACvC,eAAS,iBAAiB,KAAK,eAAe;AAG9C,eAAS,iBAAiB,KAAK;AAG/B,UAAI,KAAK,eAAe,YAAY;AAClC,iBAAS,aAAa,KAAK,eAAe;AAAA,MAC5C;AAGA,UAAI,KAAK,eAAe,gBAAgB;AACtC,iBAAS,iBAAiB,KAAK,eAAe;AAAA,MAChD;AAEA,UAAI,KAAK,eAAe,aAAa;AACnC,iBAAS,cAAc,KAAK,eAAe;AAAA,MAC7C;AAEA,UAAI,KAAK,eAAe,iBAAiB;AACvC,iBAAS,kBAAkB,KAAK,eAAe;AAAA,MACjD;AAAA,IACF;AAGA,QAAI,KAAK,aAAa,qBAAsB,KAAa,cAAc;AACrE,eAAS,eAAgB,KAAa;AAAA,IACxC;AAGA,QAAI,KAAK,aAAa,eAAgB,KAAa,YAAY;AAC7D,eAAS,aAAc,KAAa;AAAA,IACtC;AAGA,QAAI,KAAK,aAAa,WAAY,KAAa,eAAe;AAC5D,eAAS,gBAAiB,KAAa;AAAA,IACzC;AAGA,aAAS,QAAQ,oBAAoB,QAAQ;AAG7C,aAAS,SAAS;AAElB,WAAO;AAAA,MACL,IAAI,KAAK;AAAA,MACT,MAAM;AAAA,MACN;AAAA,MACA,MAAM;AAAA,IACR;AAAA,EACF,CAAC;AAGD,QAAM,QAAgB,WAAW,YAAY,IAAI,CAAC,eAAe;AAC/D,WAAO;AAAA,MACL,IAAI,WAAW;AAAA,MACf,QAAQ,WAAW;AAAA,MACnB,QAAQ,WAAW;AAAA,MACnB,MAAM;AAAA,MACN,MAAM;AAAA,QACJ,SAAS,WAAW;AAAA,QACpB,gBAAiB,WAAmB;AAAA,QACpC,UAAW,WAAmB,aAAa,SAAa,WAAmB,WAAW;AAAA,QACtF,2BAA4B,WAAmB,8BAA8B,SACxE,WAAmB,4BACpB;AAAA,QACJ,eAAe,WAAW,iBAAiB,CAAC;AAAA,QAC5C,gBAAgB,WAAW,kBAAkB,CAAC;AAAA,QAC9C,YAAY,WAAW,cAAc,CAAC;AAAA,QACtC,OAAQ,WAAmB,kBAAmB,WAAmB;AAAA;AAAA,QACjE,OAAQ,WAAmB,SAAS;AAAA;AAAA,MACtC;AAAA,IACF;AAAA,EACF,CAAC;AAED,SAAO,EAAE,OAAO,MAAM;AACxB;AASA,SAAS,qBACP,OACA,aACA,SACuC;AACvC,QAAM,YAAY,oBAAI,IAAsC;AAE5D,MAAI,MAAM,WAAW,EAAG,QAAO;AAG/B,QAAM,WAAW,oBAAI,IAAsB;AAC3C,QAAM,WAAW,oBAAI,IAAsB;AAE3C,aAAW,QAAQ,OAAO;AACxB,aAAS,IAAI,KAAK,QAAQ,CAAC,CAAC;AAC5B,aAAS,IAAI,KAAK,QAAQ,CAAC,CAAC;AAAA,EAC9B;AAEA,aAAW,KAAK,aAAa;AAC3B,UAAM,WAAW,SAAS,IAAI,EAAE,UAAU,KAAK,CAAC;AAChD,aAAS,KAAK,EAAE,QAAQ;AACxB,aAAS,IAAI,EAAE,YAAY,QAAQ;AAEnC,UAAM,UAAU,SAAS,IAAI,EAAE,QAAQ,KAAK,CAAC;AAC7C,YAAQ,KAAK,EAAE,UAAU;AACzB,aAAS,IAAI,EAAE,UAAU,OAAO;AAAA,EAClC;AAGA,QAAM,aAAa,MAAM,OAAO,QAAM,SAAS,IAAI,EAAE,MAAM,KAAK,CAAC,GAAG,WAAW,CAAC;AAChF,MAAI,WAAW,WAAW,GAAG;AAE3B,eAAW,KAAK,MAAM,CAAC,CAAC;AAAA,EAC1B;AAGA,QAAM,SAAS,oBAAI,IAAoB;AACvC,QAAM,QAA8C,CAAC;AAErD,aAAW,SAAS,YAAY;AAC9B,UAAM,KAAK,EAAE,IAAI,MAAM,QAAQ,OAAO,EAAE,CAAC;AAAA,EAC3C;AAEA,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,EAAE,IAAI,MAAM,IAAI,MAAM,MAAM;AAClC,UAAM,eAAe,OAAO,IAAI,EAAE;AAKlC,QAAI,iBAAiB,UAAa,SAAS,aAAc;AACzD,WAAO,IAAI,IAAI,KAAK;AAIpB,QAAI,QAAQ,MAAM,OAAQ;AAE1B,UAAM,WAAW,SAAS,IAAI,EAAE,KAAK,CAAC;AACtC,eAAW,SAAS,UAAU;AAC5B,YAAM,KAAK,EAAE,IAAI,OAAO,OAAO,QAAQ,EAAE,CAAC;AAAA,IAC5C;AAAA,EACF;AAGA,QAAM,eAAe,oBAAI,IAAsB;AAC/C,aAAW,CAAC,QAAQ,KAAK,KAAK,QAAQ;AACpC,UAAM,eAAe,aAAa,IAAI,KAAK,KAAK,CAAC;AACjD,iBAAa,KAAK,MAAM;AACxB,iBAAa,IAAI,OAAO,YAAY;AAAA,EACtC;AAGA,QAAM,UAAU;AAChB,QAAM,SAAS;AAEf,aAAW,CAAC,OAAO,OAAO,KAAK,cAAc;AAC3C,UAAM,QAAQ,QAAQ;AACtB,UAAM,IAAI,SAAS,QAAQ,QAAQ;AAEnC,QAAI,UAAU,GAAG;AAEf,gBAAU,IAAI,QAAQ,CAAC,GAAG,EAAE,GAAG,SAAS,EAAE,CAAC;AAAA,IAC7C,OAAO;AAEL,YAAM,cAAc,QAAQ,KAAK,QAAQ;AACzC,YAAM,SAAS,UAAU,aAAa;AAGtC,cAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,cAAM,WAAW,SAAS,IAAI,CAAC,KAAK,CAAC;AACrC,cAAM,WAAW,SAAS,IAAI,CAAC,KAAK,CAAC;AACrC,cAAM,aAAa,SAAS,SAAS,IAAK,UAAU,IAAI,SAAS,CAAC,CAAC,GAAG,KAAK,IAAK;AAChF,cAAM,aAAa,SAAS,SAAS,IAAK,UAAU,IAAI,SAAS,CAAC,CAAC,GAAG,KAAK,IAAK;AAChF,eAAO,aAAa;AAAA,MACtB,CAAC;AAED,cAAQ,QAAQ,CAAC,QAAQ,QAAQ;AAC/B,kBAAU,IAAI,QAAQ,EAAE,GAAG,SAAS,MAAM,QAAQ,YAAY,EAAE,CAAC;AAAA,MACnE,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,sBAAsB,UAA0B;AACvD,QAAM,UAAkC;AAAA,IACtC,OAAO;AAAA,IACP,KAAK;AAAA,IACL,UAAU;AAAA,IACV,WAAW;AAAA,IACX,UAAU;AAAA,IACV,eAAe;AAAA,IACf,cAAc;AAAA,EAChB;AACA,SAAO,QAAQ,QAAQ,KAAK;AAC9B;AAKA,SAAS,sBAAsB,UAA0B;AACvD,QAAM,UAAkC;AAAA,IACtC,OAAO;AAAA,IACP,KAAK;AAAA,IACL,WAAW;AAAA,IACX,WAAW;AAAA,IACX,UAAU;AAAA,IACV,iBAAiB;AAAA,IACjB,gBAAgB;AAAA,EAClB;AACA,SAAO,QAAQ,QAAQ,KAAK;AAC9B;AAKA,SAAS,oBAAoB,UAA0B;AACrD,QAAM,SAAiC;AAAA,IACrC,OAAO;AAAA,IACP,KAAK;AAAA,IACL,UAAU;AAAA,IACV,WAAW;AAAA,IACX,UAAU;AAAA,IACV,eAAe;AAAA,IACf,cAAc;AAAA,EAChB;AACA,SAAO,OAAO,QAAQ,KAAK;AAC7B;AAYO,SAAS,sBAAsB,OAAe,OAAkC;AACrF,QAAM,SAA4B,CAAC;AAGnC,QAAM,aAAa,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,OAAO;AACzD,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACA,MAAI,WAAW,SAAS,GAAG;AACzB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,QAAM,WAAW,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK;AACrD,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,SAAS,QAAS;AAC3B,QAAI,KAAK,SAAS,MAAO;AAEzB,UAAM,cAAc,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,KAAK,EAAE;AAC1D,UAAM,cAAc,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,KAAK,EAAE;AAE1D,QAAI,CAAC,eAAe,CAAC,aAAa;AAChC,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,SAAS,KAAK,KAAK,KAAK;AAAA,QACjC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH,WAAW,CAAC,aAAa;AACvB,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,SAAS,KAAK,KAAK,KAAK;AAAA,QACjC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH,WAAW,CAAC,aAAa;AACvB,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,SAAS,KAAK,KAAK,KAAK;AAAA,QACjC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH;AAAA,EACF;AAGA,QAAM,WAAW,YAAY,OAAO,KAAK;AACzC,MAAI,UAAU;AACZ,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,QAAM,UAAU,oBAAI,IAAY;AAChC,aAAW,QAAQ,OAAO;AACxB,QAAI,QAAQ,IAAI,KAAK,EAAE,GAAG;AACxB,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,sBAAsB,KAAK,EAAE;AAAA,QACtC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH;AACA,YAAQ,IAAI,KAAK,EAAE;AAAA,EACrB;AAEA,SAAO;AACT;AAKA,SAAS,YAAY,OAAe,OAAwB;AAC1D,QAAM,UAAU,oBAAI,IAAsB;AAG1C,aAAW,QAAQ,OAAO;AACxB,YAAQ,IAAI,KAAK,IAAI,CAAC,CAAC;AAAA,EACzB;AACA,aAAW,QAAQ,OAAO;AACxB,UAAM,YAAY,QAAQ,IAAI,KAAK,MAAM,KAAK,CAAC;AAC/C,cAAU,KAAK,KAAK,MAAM;AAC1B,YAAQ,IAAI,KAAK,QAAQ,SAAS;AAAA,EACpC;AAEA,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,WAAW,oBAAI,IAAY;AAEjC,WAAS,IAAI,QAAyB;AACpC,YAAQ,IAAI,MAAM;AAClB,aAAS,IAAI,MAAM;AAEnB,UAAM,YAAY,QAAQ,IAAI,MAAM,KAAK,CAAC;AAC1C,eAAW,YAAY,WAAW;AAChC,UAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG;AAC1B,YAAI,IAAI,QAAQ,EAAG,QAAO;AAAA,MAC5B,WAAW,SAAS,IAAI,QAAQ,GAAG;AACjC,eAAO;AAAA,MACT;AAAA,IACF;AAEA,aAAS,OAAO,MAAM;AACtB,WAAO;AAAA,EACT;AAEA,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,QAAQ,IAAI,KAAK,EAAE,GAAG;AACzB,UAAI,IAAI,KAAK,EAAE,EAAG,QAAO;AAAA,IAC3B;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,WAAW,OAAuB;AAChD,SAAO,MACJ,YAAY,EACZ,QAAQ,gBAAgB,GAAG,EAC3B,QAAQ,UAAU,GAAG,EACrB,QAAQ,cAAc,EAAE;AAC7B;AAKO,SAAS,WAAW,IAAqB;AAC9C,SAAO,gBAAgB,KAAK,EAAE;AAChC;AAKO,SAAS,eAAe,SAAiB,QAAgB;AAC9D,QAAM,KAAK,GAAG,MAAM,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,OAAO,GAAG,CAAC,CAAC;AAC7E,SAAO,WAAW,EAAE;AACtB;AAKO,SAAS,qBAAqB,YAAoB,UAA0B;AACjF,QAAM,KAAK,KAAK,UAAU,IAAI,QAAQ;AACtC,SAAO,WAAW,EAAE;AACtB;AAUO,SAAS,mBAAmB,OAAe,MAAoB;AACpE,QAAM,cAAc,MAAM;AAAA,IACxB,CAAC,aACC,SAAS,WAAW,KAAK,UACzB,SAAS,WAAW,KAAK;AAAA,KAExB,SAAS,gBAAgB,WAAW,KAAK,gBAAgB,UACzD,SAAS,gBAAgB,WAAW,KAAK,gBAAgB;AAAA,EAC9D;AACA,SAAO,cAAc,QAAQ,CAAC,GAAG,OAAO,IAAI;AAC9C;",
+  "sourcesContent": ["import type { Node, Edge } from '@xyflow/react'\nimport dagre from '@dagrejs/dagre'\nimport type { WorkflowDefinition } from '../data/entities'\nimport type { WorkflowIoContract } from '../data/validators'\nimport { isCompensationGhostEdge } from './compensation-ghosts'\nimport { isDataMappingEdge } from './data-edge-mapping'\nimport { isAnnotationNode } from './editor-annotations'\nimport { isTriggerEdge, isTriggerNode } from './trigger-node'\nimport { buildWorkflowRouteEdge } from './route-edge'\nimport {\n  findRouteKindDescriptor,\n  resolveEdgeRouteKind,\n  type RouteKindTransitionLike,\n} from './route-kinds'\nimport {\n  NODE_DESCRIPTION_HEIGHT,\n  NODE_HEIGHT,\n  NODE_OUTCOME_FOOTER_CHROME_HEIGHT,\n  NODE_OUTCOME_ROW_HEIGHT,\n  NODE_MAX_WIDTH,\n  NODE_MIN_WIDTH,\n  TERMINAL_NODE_HEIGHT,\n  TERMINAL_NODE_MIN_WIDTH,\n} from './node-geometry'\n\n/**\n * Graph Utilities for Visual Workflow Editor\n *\n * Converts between ReactFlow graph representation and workflow definition JSON\n */\n\nexport interface GraphToDefinitionOptions {\n  includePositions?: boolean\n}\n\n/**\n * Task inspector keys (spec \u00A76.1) that round-trip verbatim between the node and\n * the definition's `userTaskConfig`.\n *\n * They are listed rather than spread so an editor-only key on `node.data` can\n * never leak into a persisted definition, and so the set is one obvious place\n * to extend. The engine reads them through `userTaskConfig`; the inspector\n * reads them off `node.data`, which is why both directions copy.\n */\nconst USER_TASK_INSPECTOR_KEYS = [\n  'instructions',\n  'entityBindings',\n  'priority',\n  'deadline',\n  'reminders',\n  'onBreach',\n  'decisions',\n  'editablePrefilled',\n  // The \u00A77.1 portal discriminator. Listing it here is what makes it survive a\n  // Studio save at all: before, a definition carrying `assigneeKind: 'customer'`\n  // (authorable only through the Code view) was rebuilt from the fixed keys\n  // above and the portal addressing was silently downgraded to backoffice.\n  'assigneeKind',\n] as const\n\nexport interface DefinitionToGraphOptions {\n  autoLayout?: boolean\n  layoutSpacing?: { vertical: number; horizontal: number }\n  /**\n   * Declared IO port contracts of referenced sub-workflows, keyed by\n   * `subWorkflowId`. When provided, a SUB_WORKFLOW node renders the child's\n   * IN/OUT ports. Absent \u2192 the node renders without ports (backward compatible).\n   */\n  childContracts?: Map<string, WorkflowIoContract>\n}\n\nexport interface LayoutWithDagreOptions {\n  /** Flow direction. Default `'LR'` (left\u2192right). */\n  direction?: 'LR' | 'TB'\n  nodeWidth?: number\n  nodeHeight?: number\n}\n\n/**\n * Convert ReactFlow graph (nodes + edges) to workflow definition JSON\n */\nexport function graphToDefinition(\n  allNodes: Node[],\n  edges: Edge[],\n  options: GraphToDefinitionOptions = {}\n): WorkflowDefinition['definition'] {\n  // Sticky notes and groups are editor annotations (spec 4.5): they live only in\n  // `metadata.editor.annotations` and MUST NOT reach `steps` or `transitions`,\n  // so a definition carrying them serializes byte-identically to one that does\n  // not and the engine can never see them.\n  // The canvas trigger pill (fidelity gap #5) is filtered on the same terms:\n  // it is a render-time overlay derived from `definition.triggers` and has no\n  // step form at all, so a definition declaring triggers must serialize\n  // byte-identically to one that does not. It can only reach here through a\n  // caller mistake \u2014 it never enters the editor's node state \u2014 which is exactly\n  // why the guarantee is enforced rather than assumed.\n  const nodes = allNodes.filter((node) => !isAnnotationNode(node) && !isTriggerNode(node))\n  const annotationIds = new Set(\n    allNodes.filter((node) => isAnnotationNode(node) || isTriggerNode(node)).map((node) => node.id),\n  )\n\n  // Extract steps from nodes\n  const steps = nodes.map((node) => {\n    const step: any = {\n      stepId: node.id,\n      stepName: node.data.label || node.id,\n      stepType: mapNodeTypeToStepType(node.type || 'automated'),\n    }\n\n    // Add step-specific configuration\n    if (node.data.description) {\n      step.description = node.data.description\n    }\n\n    // Add timeout if present\n    if (node.data.timeout) {\n      step.timeout = node.data.timeout\n    }\n\n    // Add retryPolicy if present\n    if (node.data.retryPolicy) {\n      step.retryPolicy = node.data.retryPolicy\n    }\n\n    // Add generic config if present\n    if (node.data.config) {\n      step.config = node.data.config\n    }\n\n    // User task configuration\n    if (node.type === 'userTask' && node.data) {\n      step.userTaskConfig = {\n        assignedTo: node.data.assignedTo,\n        assignedToRoles: node.data.assignedToRoles || [],\n        formKey: node.data.formKey,\n        allowedActions: node.data.allowedActions || ['complete', 'cancel'],\n      }\n\n      // Add form schema if present\n      if ((node.data as any).formSchema || (node.data as any).userTaskConfig?.formSchema) {\n        step.userTaskConfig.formSchema = (node.data as any).formSchema || (node.data as any).userTaskConfig.formSchema\n      }\n\n      // Add advanced fields if present\n      if ((node.data as any).assignmentRule || (node.data as any).userTaskConfig?.assignmentRule) {\n        step.userTaskConfig.assignmentRule = (node.data as any).assignmentRule || (node.data as any).userTaskConfig.assignmentRule\n      }\n\n      if ((node.data as any).slaDuration || (node.data as any).userTaskConfig?.slaDuration) {\n        step.userTaskConfig.slaDuration = (node.data as any).slaDuration || (node.data as any).userTaskConfig.slaDuration\n      }\n\n      if ((node.data as any).escalationRules || (node.data as any).userTaskConfig?.escalationRules) {\n        step.userTaskConfig.escalationRules = (node.data as any).escalationRules || (node.data as any).userTaskConfig.escalationRules\n      }\n\n      for (const key of USER_TASK_INSPECTOR_KEYS) {\n        const authored = (node.data as any)[key] ?? (node.data as any).userTaskConfig?.[key]\n        if (authored !== undefined) step.userTaskConfig[key] = authored\n      }\n    }\n\n    // Wait for signal configuration\n    if (node.type === 'waitForSignal' && node.data.signalConfig) {\n      step.signalConfig = node.data.signalConfig\n    }\n\n    // Step activities (for AUTOMATED steps)\n    if (node.type === 'automated' && node.data.activities) {\n      step.activities = node.data.activities\n    }\n\n    // Invoke-agent step \u2192 AUTOMATED step carrying the INVOKE_AGENT activity plus\n    // a signalConfig so the engine can park-and-resume the human path. The\n    // stepType is already AUTOMATED via mapNodeTypeToStepType.\n    if (node.type === 'invokeAgent') {\n      if (node.data.activities) {\n        step.activities = node.data.activities\n      }\n      if (node.data.signalConfig) {\n        step.signalConfig = node.data.signalConfig\n      }\n    }\n\n    // Pre-conditions (for START steps)\n    if (node.type === 'start' && (node.data as any).preConditions && (node.data as any).preConditions.length > 0) {\n      step.preConditions = (node.data as any).preConditions\n    }\n\n    // Error directive (spec 5.9). Absent stays absent so definitions that never\n    // opened the picker save byte-identically.\n    if ((node.data as any).errorDirective) {\n      step.errorDirective = (node.data as any).errorDirective\n    }\n\n    // Editor-owned step metadata. `unmappedConfig` is config a step-type\n    // conversion could not map onto the new type (spec 4.5) \u2014 it is carried\n    // through save/load verbatim so nothing an author configured is ever lost.\n    const stepMetadata: Record<string, unknown> = {\n      ...((node.data as any).stepMetadata && typeof (node.data as any).stepMetadata === 'object'\n        ? (node.data as any).stepMetadata as Record<string, unknown>\n        : {}),\n    }\n    const unmappedConfig = (node.data as any).unmappedConfig\n    if (unmappedConfig && typeof unmappedConfig === 'object' && Object.keys(unmappedConfig).length > 0) {\n      stepMetadata.unmappedConfig = unmappedConfig\n    } else {\n      delete stepMetadata.unmappedConfig\n    }\n    if (Object.keys(stepMetadata).length > 0) {\n      step.metadata = stepMetadata\n    }\n\n    // Store position for visual editor\n    if (options.includePositions && node.position) {\n      step._editorPosition = {\n        x: node.position.x,\n        y: node.position.y,\n      }\n    }\n\n    return step\n  })\n\n  // Extract transitions from edges. Drag-authored data-mapping edges are NOT\n  // transitions \u2014 their binding lives in the target step's config.inputMapping \u2014\n  // and compensation ghosts (spec 4.4) are a rendering of existing routes, not\n  // routes of their own, so both are excluded here.\n  const transitions = edges\n    .filter((edge) => !isDataMappingEdge(edge)\n      && !isCompensationGhostEdge(edge)\n      && !isTriggerEdge(edge)\n      && !annotationIds.has(edge.source)\n      && !annotationIds.has(edge.target))\n    .map((edge) => {\n    const edgeData = edge.data as any\n    const transition: any = {\n      transitionId: edge.id,\n      fromStepId: edge.source,\n      toStepId: edge.target,\n      trigger: edgeData?.trigger || 'auto',\n    }\n\n    // Add transition name if present\n    if (edgeData?.transitionName) {\n      transition.transitionName = edgeData.transitionName\n    }\n\n    // Add priority if present (default 0)\n    if (edgeData?.priority !== undefined) {\n      transition.priority = edgeData.priority\n    }\n\n    // Route kind marker (spec 5.9 error routes, and every kind registered\n    // beside them in lib/route-kinds.ts). Only non-normal kinds are persisted;\n    // normal routes stay exactly as they were serialized before.\n    const routeKind = resolveEdgeRouteKind(edgeData?.kind, edge.sourceHandle)\n    if (routeKind) {\n      transition.kind = routeKind.kind\n      Object.assign(transition, routeKind.discriminatorFields(edge))\n    }\n\n    // Add continueOnActivityFailure if present (default false)\n    if (edgeData?.continueOnActivityFailure !== undefined) {\n      transition.continueOnActivityFailure = edgeData.continueOnActivityFailure\n    }\n\n    // Add conditions if present\n    if (edgeData?.preConditions && edgeData.preConditions.length > 0) {\n      transition.preConditions = edgeData.preConditions\n    }\n\n    if (edgeData?.postConditions && edgeData.postConditions.length > 0) {\n      transition.postConditions = edgeData.postConditions\n    }\n\n    // Inline condition expression (business_rules language). Branching routes\n    // authored on IF_ELSE / SWITCH nodes are plain conditioned transitions.\n    if (edgeData?.condition !== undefined && edgeData.condition !== null) {\n      transition.condition = edgeData.condition\n    }\n\n    // Add activities if present in edge data\n    if (edgeData?.activities && edgeData.activities.length > 0) {\n      transition.activities = edgeData.activities.map((activity: any) => ({\n        activityId: activity.activityId,\n        activityName: activity.activityName,\n        activityType: activity.activityType,\n        config: activity.config || {},\n        // Include all optional fields\n        ...(activity.async !== undefined && { async: activity.async }),\n        ...(activity.timeout && { timeout: activity.timeout }),\n        ...(activity.retryPolicy && { retryPolicy: activity.retryPolicy }),\n        ...(activity.compensate !== undefined && { compensate: activity.compensate }),\n      // Saga compensation (`compensation.activityId`) is what the canvas'\n      // compensation ghosts render and what `lib/compensation-handler.ts`\n      // executes on failure \u2014 it MUST survive the editor round trip.\n      ...(activity.compensation && { compensation: activity.compensation }),\n      }))\n    } else if (!transition.kind) {\n      // Check if source node is automated and has activity data\n      // If so, place the activity in this transition. A non-normal route never\n      // inherits the source step's activity \u2014 it is the recovery path, and\n      // re-running the activity that just failed (or that the run never got\n      // past) is exactly wrong.\n      const sourceNode = nodes.find(n => n.id === edge.source)\n      if (sourceNode && sourceNode.type === 'automated' && sourceNode.data) {\n        if (sourceNode.data.activityType || sourceNode.data.activityId) {\n          const activity: any = {\n            activityId: sourceNode.data.activityId || `activity_${sourceNode.id}`,\n            activityName: sourceNode.data.activityName || sourceNode.data.label || 'Automated Activity',\n            activityType: sourceNode.data.activityType || 'CALL_API',\n            config: sourceNode.data.activityConfig || {},\n          }\n          // Include optional activity fields from node data\n          if ((sourceNode.data as any).activityAsync !== undefined) {\n            activity.async = (sourceNode.data as any).activityAsync\n          }\n          if ((sourceNode.data as any).activityTimeout) {\n            activity.timeout = (sourceNode.data as any).activityTimeout\n          }\n          if ((sourceNode.data as any).activityRetryPolicy) {\n            activity.retryPolicy = (sourceNode.data as any).activityRetryPolicy\n          }\n          if ((sourceNode.data as any).activityCompensate !== undefined) {\n            activity.compensate = (sourceNode.data as any).activityCompensate\n          }\n          transition.activities = [activity]\n        }\n      }\n    }\n\n    // Add label if present (legacy field, transitionName is preferred)\n    if (edgeData?.label && !transition.transitionName) {\n      transition.transitionName = edgeData.label\n    }\n\n    return transition\n  })\n\n  return {\n    steps,\n    transitions,\n    activities: [], // Global activities can be added later\n  }\n}\n\n/**\n * Convert workflow definition JSON to ReactFlow graph (nodes + edges)\n */\nexport function definitionToGraph(\n  definition: WorkflowDefinition['definition'],\n  options: DefinitionToGraphOptions = {}\n): { nodes: Node[]; edges: Edge[] } {\n  const { autoLayout = true, layoutSpacing = { vertical: 200, horizontal: 300 }, childContracts } = options\n\n  // Build step map for quick lookup\n  const stepMap = new Map(definition.steps.map(step => [step.stepId, step]))\n\n  // Collect author-arranged positions persisted in the definition. A stored\n  // position always wins over an auto-computed one, so a saved graph re-opens\n  // exactly as the author left it.\n  const storedPositions = new Map<string, { x: number; y: number }>()\n  for (const step of definition.steps) {\n    const stored = (step as any)._editorPosition\n    if (stored && typeof stored.x === 'number' && typeof stored.y === 'number') {\n      storedPositions.set(step.stepId, { x: stored.x, y: stored.y })\n    }\n  }\n\n  // Auto-arrange only the steps that lack a stored position (e.g. freshly added\n  // nodes, or legacy/code graphs with no stored coordinates at all). When the\n  // caller explicitly disables autoLayout, skip dagre entirely.\n  const needsDagre = autoLayout && definition.steps.some((step) => !storedPositions.has(step.stepId))\n  const dagrePositions = needsDagre\n    ? layoutWithDagre(definition.steps, definition.transitions, {\n        direction: 'LR',\n        nodeWidth: NODE_MIN_WIDTH,\n        nodeHeight: NODE_HEIGHT,\n      })\n    : null\n\n  // Convert steps to nodes\n  const nodes: Node[] = definition.steps.map((step, index) => {\n    // Determine position: stored (author-arranged) \u2192 dagre (auto) \u2192 fallback.\n    const position = storedPositions.get(step.stepId)\n      || dagrePositions?.get(step.stepId)\n      || { x: 250, y: 50 + index * layoutSpacing.vertical }\n\n    // Map step type to node type. An AUTOMATED step whose activities contain a\n    // single INVOKE_AGENT marker is the compiled form of an invoke-agent node \u2014\n    // round-trip it back to that node type so the dedicated editor/UI is used.\n    const invokeAgentActivity = (step.stepType === 'AUTOMATED'\n      ? ((step as any).activities as any[] | undefined)?.find(\n          (activity) => activity?.activityType === 'INVOKE_AGENT',\n        )\n      : undefined)\n    const nodeType = invokeAgentActivity\n      ? 'invokeAgent'\n      : mapStepTypeToNodeType(step.stepType)\n\n    // Build node data\n    const nodeData: any = {\n      label: step.stepName,\n      description: (step as any).description,\n      stepNumber: index > 0 ? index : undefined,\n    }\n\n    // Add timeout if present\n    if ((step as any).timeout) {\n      nodeData.timeout = (step as any).timeout\n    }\n\n    // Add retryPolicy if present\n    if ((step as any).retryPolicy) {\n      nodeData.retryPolicy = (step as any).retryPolicy\n    }\n\n    // Add generic config if present\n    if ((step as any).config) {\n      nodeData.config = (step as any).config\n    }\n\n    // Editor-owned step metadata round-trips as-is; the quarantined config a\n    // step-type conversion produced is lifted out so the inspector can show it.\n    const stepMetadata = (step as any).metadata\n    if (stepMetadata && typeof stepMetadata === 'object') {\n      nodeData.stepMetadata = stepMetadata\n      const unmappedConfig = (stepMetadata as Record<string, unknown>).unmappedConfig\n      if (unmappedConfig && typeof unmappedConfig === 'object') {\n        nodeData.unmappedConfig = unmappedConfig\n      }\n    }\n\n    // Add user task data\n    if (step.stepType === 'USER_TASK' && step.userTaskConfig) {\n      nodeData.assignedTo = step.userTaskConfig.assignedTo\n      nodeData.assignedToRoles = step.userTaskConfig.assignedToRoles || []\n      nodeData.formKey = step.userTaskConfig.formKey\n      nodeData.allowedActions = step.userTaskConfig.allowedActions\n\n      // Store full userTaskConfig for advanced fields\n      nodeData.userTaskConfig = step.userTaskConfig\n\n      // Add form schema if present\n      if (step.userTaskConfig.formSchema) {\n        nodeData.formSchema = step.userTaskConfig.formSchema\n      }\n\n      // Add advanced fields if present\n      if (step.userTaskConfig.assignmentRule) {\n        nodeData.assignmentRule = step.userTaskConfig.assignmentRule\n      }\n\n      if (step.userTaskConfig.slaDuration) {\n        nodeData.slaDuration = step.userTaskConfig.slaDuration\n      }\n\n      if (step.userTaskConfig.escalationRules) {\n        nodeData.escalationRules = step.userTaskConfig.escalationRules\n      }\n\n      for (const key of USER_TASK_INSPECTOR_KEYS) {\n        const persisted = (step.userTaskConfig as Record<string, unknown>)[key]\n        if (persisted !== undefined) nodeData[key] = persisted\n      }\n    }\n\n    // Add wait for signal data\n    if (step.stepType === 'WAIT_FOR_SIGNAL' && (step as any).signalConfig) {\n      nodeData.signalConfig = (step as any).signalConfig\n    }\n\n    // Add sub-workflow port contract so the node renders the child's IN/OUT\n    // ports without opening it. Resolved from the supplied childContracts map.\n    if (step.stepType === 'SUB_WORKFLOW') {\n      const subWorkflowId = (step as any).config?.subWorkflowId\n      const contract = subWorkflowId ? childContracts?.get(subWorkflowId) : undefined\n      if (contract?.inputs?.length) nodeData.inputs = contract.inputs\n      if (contract?.outputs?.length) nodeData.outputs = contract.outputs\n      // Display-only mirror of config.subWorkflowId/version, so the node renders\n      // \"Invokes: <id>\" without re-reading config. The runtime + editor dialog\n      // keep config.subWorkflowId/version as the source of truth.\n      if ((step as any).config) {\n        nodeData.subWorkflowId = (step as any).config.subWorkflowId\n        if ((step as any).config.version != null) {\n          nodeData.version = (step as any).config.version\n        }\n      }\n    }\n\n    // Add step activities data (for AUTOMATED steps)\n    if (step.stepType === 'AUTOMATED' && (step as any).activities) {\n      nodeData.activities = (step as any).activities\n    }\n\n    // Add invoke-agent data (compiled AUTOMATED step). Carry the signalConfig and\n    // a display-only agentId so the node renders without re-parsing activities.\n    if (invokeAgentActivity) {\n      if ((step as any).signalConfig) {\n        nodeData.signalConfig = (step as any).signalConfig\n      }\n      nodeData.agentId = invokeAgentActivity.config?.agentId\n    }\n\n    // Add pre-conditions data (for START steps)\n    if (step.stepType === 'START' && (step as any).preConditions) {\n      nodeData.preConditions = (step as any).preConditions\n    }\n\n    // Error directive (spec 5.9)\n    if ((step as any).errorDirective) {\n      nodeData.errorDirective = (step as any).errorDirective\n    }\n\n    // Set badge based on type\n    nodeData.badge = getBadgeForNodeType(nodeType)\n\n    // Default status is pending\n    nodeData.status = 'pending'\n\n    return {\n      id: step.stepId,\n      type: nodeType,\n      position,\n      data: nodeData,\n    }\n  })\n\n  const decisionTransitionIdsByStep = new Map<string, Set<string>>()\n  for (const step of definition.steps) {\n    if (step.stepType !== 'USER_TASK') continue\n    const transitionIds = (step.userTaskConfig?.decisions ?? [])\n      .map((decision: { transitionId?: unknown }) => decision.transitionId)\n      .filter(\n        (transitionId: unknown): transitionId is string =>\n          typeof transitionId === 'string',\n      )\n    if (transitionIds.length > 0) {\n      decisionTransitionIdsByStep.set(step.stepId, new Set(transitionIds))\n    }\n  }\n\n  // Convert transitions to edges\n  const edges: Edge[] = definition.transitions.map((transition) => {\n    const routeTransition: RouteKindTransitionLike = transition\n    const routeKind = findRouteKindDescriptor(routeTransition.kind)\n    const decisionSourceHandle = decisionTransitionIdsByStep\n      .get(transition.fromStepId)\n      ?.has(transition.transitionId)\n      ? transition.transitionId\n      : undefined\n    return buildWorkflowRouteEdge({\n      id: transition.transitionId,\n      source: transition.fromStepId,\n      target: transition.toStepId,\n      // A kinded route re-attaches to its own output handle so the canvas\n      // renders it leaving the same port the author drew it from.\n      sourceHandle: routeKind\n        ? routeKind.resolveSourceHandle(routeTransition)\n        : decisionSourceHandle,\n      data: {\n        trigger: transition.trigger,\n        ...(routeKind ? { kind: routeKind.kind } : {}),\n        ...(routeTransition.outcomeKind ? { outcomeKind: routeTransition.outcomeKind } : {}),\n        transitionName: (transition as any).transitionName,\n        priority: (transition as any).priority !== undefined ? (transition as any).priority : 0,\n        continueOnActivityFailure: (transition as any).continueOnActivityFailure !== undefined\n          ? (transition as any).continueOnActivityFailure\n          : false,\n        preConditions: transition.preConditions || [],\n        postConditions: transition.postConditions || [],\n        condition: (transition as any).condition,\n        activities: transition.activities || [],\n        label: (transition as any).transitionName || (transition as any).label, // Backward compat\n        state: (transition as any).state || 'pending', // Default edge state\n      },\n    })\n  })\n\n  return { nodes, edges }\n}\n\n/**\n * Compute overlap-free, node-size-aware layout positions using `@dagrejs/dagre`.\n *\n * Builds a layered graph (default `rankdir: 'LR'` \u2192 left\u2192right flow), runs dagre\n * to rank nodes and minimize edge crossings, then converts dagre's center-origin\n * coordinates to React Flow's top-left origin. Returns a `Map` of `stepId` \u2192\n * top-left `{ x, y }`, the same shape the previous custom layout produced.\n *\n * Only control-flow transitions are passed here \u2014 drag-authored data mappings\n * are not transitions (they live in the target step's `config.inputMapping`).\n */\n/**\n * Approximate a node card's rendered footprint when its true measured size is\n * not yet known (initial open, before React Flow measures the DOM). Cards are\n * `w-fit` between `NODE_MIN_WIDTH` and `NODE_MAX_WIDTH` (see lib/node-geometry); their\n * width is driven mostly by the two-line `line-clamp-2` description, which pushes\n * almost any described node to the max width. So a node WITH a description is\n * estimated at the cap (and taller for the extra line); a bare-title node sizes\n * to its title. Underestimating here is what makes ranks overlap, so this errs\n * toward the real (larger) footprint. The Auto-arrange path uses exact measured\n * sizes instead and does not rely on this.\n */\nfunction estimateNodeSize(\n  label: unknown,\n  hasDescription: boolean,\n  isTerminal: boolean,\n  outcomeRowCount = 0,\n): { width: number; height: number } {\n  const text = typeof label === 'string' ? label.trim() : ''\n  const titleWidth = Math.round(text.length * 7) + 64\n  // Terminals are auto-width pills carrying only an icon and a name: no\n  // description row, no minimum card width.\n  if (isTerminal) {\n    return {\n      width: Math.min(Math.max(TERMINAL_NODE_MIN_WIDTH, titleWidth), NODE_MAX_WIDTH),\n      height: TERMINAL_NODE_HEIGHT,\n    }\n  }\n  const width = hasDescription\n    ? NODE_MAX_WIDTH\n    : Math.min(Math.max(NODE_MIN_WIDTH, titleWidth), NODE_MAX_WIDTH)\n  const bodyHeight = hasDescription ? NODE_HEIGHT + NODE_DESCRIPTION_HEIGHT : NODE_HEIGHT\n  const footerHeight =\n    outcomeRowCount > 0\n      ? NODE_OUTCOME_FOOTER_CHROME_HEIGHT + outcomeRowCount * NODE_OUTCOME_ROW_HEIGHT\n      : 0\n  return { width, height: bodyHeight + footerHeight }\n}\n\n/**\n * START / END, in either vocabulary: `definitionToGraph` lays out definition\n * steps (which carry `stepType`), `applyAutoLayout` lays out React Flow nodes\n * (which carry the editor `nodeType`).\n */\ninterface NodeFootprintLike {\n  width?: unknown\n  height?: unknown\n  description?: unknown\n  stepName?: unknown\n  label?: unknown\n  stepType?: unknown\n  nodeType?: unknown\n  stepId?: unknown\n  userTaskConfig?: { decisions?: unknown }\n  decisions?: unknown\n  activities?: unknown\n}\n\ninterface OutcomeLayoutTransitionLike {\n  fromStepId?: unknown\n  kind?: unknown\n  outcomeKind?: unknown\n}\n\nfunction isTerminalStep(step: NodeFootprintLike): boolean {\n  return step.stepType === 'START'\n    || step.stepType === 'END'\n    || step.nodeType === 'start'\n    || step.nodeType === 'end'\n}\n\n/**\n * Footprint dagre reserves for a node: its exact measured size when React Flow\n * has already laid it out (the Auto-arrange path passes `node.measured`),\n * otherwise the description-aware estimate above. Exported so a layout test can\n * assert that the boxes dagre reserved actually do not overlap.\n */\nexport function nodeFootprint(\n  step: NodeFootprintLike,\n  outcomeRowCount = 0,\n): { width: number; height: number } {\n  if (typeof step.width === 'number' && typeof step.height === 'number') {\n    return { width: step.width, height: step.height }\n  }\n  const description = step.description\n  const hasDescription = typeof description === 'string' && description.trim().length > 0\n  return estimateNodeSize(\n    step.stepName ?? step.label,\n    hasDescription,\n    isTerminalStep(step),\n    outcomeRowCount,\n  )\n}\n\n/**\n * How many outcome rows a step's footer renders (fidelity gap #4). An agent step\n * shows its WIRED outcomes plus `approved`; a user task shows one row per\n * authored decision. Both are derived here rather than measured, because dagre\n * runs before React Flow has laid a single card out.\n *\n * A footer that renders at all also carries the step's DEFAULT route as its last\n * row, which is why a non-empty count gets one more: under-estimating here is\n * exactly what makes dagre pack ranks into each other.\n */\nfunction countOutcomeRows(\n  step: NodeFootprintLike,\n  transitions: OutcomeLayoutTransitionLike[],\n): number {\n  const rows = countAuthoredOutcomeRows(step, transitions)\n  return rows > 0 ? rows + 1 : 0\n}\n\nfunction countAuthoredOutcomeRows(\n  step: NodeFootprintLike,\n  transitions: OutcomeLayoutTransitionLike[],\n): number {\n  const decisions = step?.userTaskConfig?.decisions ?? step?.decisions\n  if (Array.isArray(decisions)) {\n    return decisions.filter(\n      (decision) =>\n        typeof decision === 'object'\n        && decision !== null\n        && typeof (decision as { transitionId?: unknown }).transitionId === 'string',\n    ).length\n  }\n  if (!isInvokeAgentStep(step)) return 0\n  const wired = new Set<string>()\n  for (const transition of transitions) {\n    if (transition?.fromStepId !== step.stepId) continue\n    if (transition?.kind !== 'outcome') continue\n    if (typeof transition.outcomeKind === 'string') wired.add(transition.outcomeKind)\n  }\n  wired.add('approved')\n  return wired.size\n}\n\nfunction isInvokeAgentStep(step: NodeFootprintLike): boolean {\n  if (step?.nodeType === 'invokeAgent') return true\n  const activities = step?.activities\n  return Array.isArray(activities)\n    && activities.some(\n      (activity) =>\n        typeof activity === 'object'\n        && activity !== null\n        && (activity as { activityType?: unknown }).activityType === 'INVOKE_AGENT',\n    )\n}\n\nfunction layoutWithDagre(\n  steps: any[],\n  transitions: any[],\n  options: LayoutWithDagreOptions = {}\n): Map<string, { x: number; y: number }> {\n  const positions = new Map<string, { x: number; y: number }>()\n\n  if (steps.length === 0) return positions\n\n  const rankdir = options.direction ?? 'LR'\n\n  const graph = new dagre.graphlib.Graph()\n  graph.setDefaultEdgeLabel(() => ({}))\n  graph.setGraph({ rankdir, nodesep: 60, ranksep: 80 })\n\n  // Reserve each node's real footprint (measured when available, else a\n  // description-aware estimate). `ranksep`/`nodesep` then become the actual\n  // visible gap between cards, so the spacing is neither cramped nor blown apart.\n  for (const step of steps) {\n    graph.setNode(step.stepId, nodeFootprint(step, countOutcomeRows(step, transitions)))\n  }\n\n  // Transition labels are hover-only (WorkflowTransitionEdge), so they occupy no\n  // persistent canvas space \u2014 the layout no longer reserves a label pill between\n  // ranks, keeping nodes tight against `ranksep` instead of pushing them apart by\n  // the (previously up to 220px wide) label footprint.\n  for (const transition of transitions) {\n    if (graph.hasNode(transition.fromStepId) && graph.hasNode(transition.toStepId)) {\n      graph.setEdge(transition.fromStepId, transition.toStepId, {})\n    }\n  }\n\n  dagre.layout(graph)\n\n  for (const step of steps) {\n    const node = graph.node(step.stepId)\n    if (!node || typeof node.x !== 'number' || typeof node.y !== 'number') continue\n    // dagre returns the node center; React Flow positions use the top-left corner.\n    // Offset by this node's own footprint (set above), not a shared constant.\n    positions.set(step.stepId, {\n      x: node.x - node.width / 2,\n      y: node.y - node.height / 2,\n    })\n  }\n\n  return positions\n}\n\n/** Gap between the main flow and the return lane a loop node is dropped into. */\nexport const RETURN_LANE_GAP = 64\n\n/**\n * Drop dedicated return nodes into a lane BELOW the main flow (issue: loop route\n * lines cross-cutting the cards).\n *\n * dagre lays out LR and ranks a loop node (e.g. a retry `WAIT_FOR_TIMER`) to the\n * RIGHT of the step it routes back to, so its back-edge curves across the row and\n * reads as spaghetti. This post-pass finds a node whose ONLY outgoing edge is a\n * back-edge (its target sits left of it) \u2014 i.e. a node that exists purely to\n * route back \u2014 and lowers it beneath every card its return arc spans, keeping its\n * x. The forward edge then drops down to it and the return edge rises back up as\n * one clean arc under the row.\n *\n * Guards keep it conservative: only single-out-edge return nodes move, so a\n * genuine business loop through a multi-branch step is left to dagre. PURE.\n */\nexport function liftReturnNodesBelow(\n  positions: Map<string, { x: number; y: number }>,\n  sizeById: Map<string, { width: number; height: number }>,\n  transitions: { fromStepId: string; toStepId: string }[],\n  gap: number = RETURN_LANE_GAP,\n): Map<string, { x: number; y: number }> {\n  const outDegree = new Map<string, number>()\n  for (const transition of transitions) {\n    outDegree.set(transition.fromStepId, (outDegree.get(transition.fromStepId) ?? 0) + 1)\n  }\n\n  const widthOf = (id: string) => sizeById.get(id)?.width ?? NODE_MIN_WIDTH\n  const heightOf = (id: string) => sizeById.get(id)?.height ?? NODE_HEIGHT\n\n  const result = new Map(positions)\n  for (const transition of transitions) {\n    const from = result.get(transition.fromStepId)\n    const to = result.get(transition.toStepId)\n    if (!from || !to) continue\n    // A back-edge in an LR layout: the target sits left of the source.\n    if (to.x >= from.x) continue\n    // Only a DEDICATED return node moves \u2014 one whose sole job is to route back.\n    if ((outDegree.get(transition.fromStepId) ?? 0) !== 1) continue\n\n    const spanLeft = to.x\n    const spanRight = from.x + widthOf(transition.fromStepId)\n    let laneTop = Number.NEGATIVE_INFINITY\n    for (const [id, pos] of result) {\n      if (id === transition.fromStepId) continue\n      const nodeRight = pos.x + widthOf(id)\n      if (nodeRight < spanLeft || pos.x > spanRight) continue // no horizontal overlap\n      laneTop = Math.max(laneTop, pos.y + heightOf(id))\n    }\n    if (laneTop === Number.NEGATIVE_INFINITY) continue\n    result.set(transition.fromStepId, { x: from.x, y: Math.round(laneTop + gap) })\n  }\n  return result\n}\n\n/**\n * Re-run the dagre layered layout (`rankdir: 'LR'`) directly over React Flow\n * nodes + edges and return a NEW node array with refreshed `position` values.\n *\n * This is the single intentional full re-layout entry point (the \"Auto-arrange\"\n * toolbar action): it deliberately IGNORES any stored `_editorPosition` and\n * re-tidies the whole graph. Every other node field (`data`, `type`, handle\n * config, \u2026) is preserved \u2014 only `position` is replaced. Data-mapping edges are\n * excluded from the rank graph since they are not control-flow transitions.\n */\nexport function applyAutoLayout(nodes: Node[], edges: Edge[]): Node[] {\n  // Use each node's exact measured footprint so dagre reserves the real on-screen\n  // size; React Flow has already measured the cards by the time the user clicks\n  // Auto-arrange. Fall back to the estimate only for any not-yet-measured node.\n  // Annotations are not ranked: dagre only knows about the control-flow graph,\n  // so a note or group placed deliberately beside a step keeps the position its\n  // author gave it while Tidy re-lays the steps around it.\n  // The trigger pill is excluded for the same reason a note is, only harder: it\n  // has no rank at all. It is positioned relative to the START terminal it\n  // annotates, so ranking it would move it out from under its own anchor.\n  const steps = nodes\n    .filter((node) => !isAnnotationNode(node) && !isTriggerNode(node))\n    .map((node) => ({\n      stepId: node.id,\n      stepName: (node.data as any)?.label,\n      nodeType: node.type,\n      description: (node.data as any)?.description,\n      width: node.measured?.width,\n      height: node.measured?.height,\n    }))\n  const transitions = edges\n    .filter((edge) => !isDataMappingEdge(edge))\n    .map((edge) => ({\n      fromStepId: edge.source,\n      toStepId: edge.target,\n    }))\n\n  const positions = layoutWithDagre(steps, transitions, {\n    direction: 'LR',\n    nodeWidth: NODE_MIN_WIDTH,\n    nodeHeight: NODE_HEIGHT,\n  })\n\n  // Post-pass: lower dedicated return nodes (retry timers, loop-back waits) into\n  // a lane below the row so their return arc reads cleanly instead of cutting\n  // across the cards.\n  const sizeById = new Map<string, { width: number; height: number }>(\n    steps.map((step) => [\n      step.stepId as string,\n      { width: step.width ?? NODE_MIN_WIDTH, height: step.height ?? NODE_HEIGHT },\n    ]),\n  )\n  const laidOut = liftReturnNodesBelow(positions, sizeById, transitions)\n\n  return nodes.map((node) => {\n    const next = laidOut.get(node.id)\n    return next ? { ...node, position: { x: next.x, y: next.y } } : node\n  })\n}\n\n/**\n * Map node type to step type (for graph \u2192 definition)\n */\nfunction mapNodeTypeToStepType(nodeType: string): string {\n  const mapping: Record<string, string> = {\n    start: 'START',\n    end: 'END',\n    userTask: 'USER_TASK',\n    automated: 'AUTOMATED',\n    subWorkflow: 'SUB_WORKFLOW',\n    decision: 'DECISION',\n    waitForSignal: 'WAIT_FOR_SIGNAL',\n    waitForTimer: 'WAIT_FOR_TIMER',\n    waitForCondition: 'WAIT_FOR_CONDITION',\n    parallelFork: 'PARALLEL_FORK',\n    parallelJoin: 'PARALLEL_JOIN',\n    // The invoke-agent node is a specialization of an AUTOMATED step.\n    invokeAgent: 'AUTOMATED',\n    ifElse: 'IF_ELSE',\n    switch: 'SWITCH',\n  }\n  return mapping[nodeType] || 'AUTOMATED'\n}\n\n/**\n * Map step type to node type (for definition \u2192 graph)\n */\nfunction mapStepTypeToNodeType(stepType: string): string {\n  const mapping: Record<string, string> = {\n    START: 'start',\n    END: 'end',\n    USER_TASK: 'userTask',\n    AUTOMATED: 'automated',\n    SUB_WORKFLOW: 'subWorkflow',\n    DECISION: 'decision',\n    WAIT_FOR_SIGNAL: 'waitForSignal',\n    WAIT_FOR_TIMER: 'waitForTimer',\n    WAIT_FOR_CONDITION: 'waitForCondition',\n    PARALLEL_FORK: 'parallelFork',\n    PARALLEL_JOIN: 'parallelJoin',\n    IF_ELSE: 'ifElse',\n    SWITCH: 'switch',\n  }\n  return mapping[stepType] || 'automated'\n}\n\n/**\n * Get badge text for node type\n */\nexport function getBadgeForNodeType(nodeType: string): string {\n  const badges: Record<string, string> = {\n    start: 'Start',\n    end: 'End',\n    userTask: 'User Task',\n    automated: 'Automated',\n    decision: 'Decision',\n    subWorkflow: 'Sub-Workflow',\n    waitForSignal: 'Wait for Signal',\n    waitForTimer: 'Wait for Timer',\n    waitForCondition: 'Wait for Condition',\n    parallelFork: 'Parallel Fork',\n    parallelJoin: 'Parallel Join',\n    invokeAgent: 'Invoke Agent',\n    ifElse: 'If / Else',\n    switch: 'Switch',\n  }\n  return badges[nodeType] || 'Task'\n}\n\n/**\n * Validate workflow graph\n */\nexport interface ValidationError {\n  type: 'error' | 'warning'\n  message: string\n  nodeId?: string\n  edgeId?: string\n}\n\nexport function validateWorkflowGraph(allNodes: Node[], edges: Edge[]): ValidationError[] {\n  const errors: ValidationError[] = []\n\n  // Annotations are documentation, not steps: a sticky note has no routes by\n  // design and must never be reported as a disconnected node. The trigger pill\n  // is skipped for a stronger reason: it is not a step, so counting it would\n  // corrupt the exactly-one-START / at-least-one-END invariants this function\n  // exists to enforce.\n  const nodes = allNodes.filter((node) => !isAnnotationNode(node) && !isTriggerNode(node))\n\n  // Check for at least one start node\n  const startNodes = nodes.filter((n) => n.type === 'start')\n  if (startNodes.length === 0) {\n    errors.push({\n      type: 'error',\n      message: 'Workflow must have at least one START node',\n    })\n  }\n  if (startNodes.length > 1) {\n    errors.push({\n      type: 'warning',\n      message: 'Workflow has multiple START nodes',\n    })\n  }\n\n  // Check for at least one end node\n  const endNodes = nodes.filter((n) => n.type === 'end')\n  if (endNodes.length === 0) {\n    errors.push({\n      type: 'error',\n      message: 'Workflow must have at least one END node',\n    })\n  }\n\n  // Check for orphan nodes (no incoming or outgoing edges)\n  for (const node of nodes) {\n    if (node.type === 'start') continue // Start nodes don't need incoming edges\n    if (node.type === 'end') continue // End nodes don't need outgoing edges\n\n    const hasIncoming = edges.some((e) => e.target === node.id)\n    const hasOutgoing = edges.some((e) => e.source === node.id)\n\n    if (!hasIncoming && !hasOutgoing) {\n      errors.push({\n        type: 'error',\n        message: `Node \"${node.data.label}\" is disconnected`,\n        nodeId: node.id,\n      })\n    } else if (!hasIncoming) {\n      errors.push({\n        type: 'warning',\n        message: `Node \"${node.data.label}\" has no incoming connections`,\n        nodeId: node.id,\n      })\n    } else if (!hasOutgoing) {\n      errors.push({\n        type: 'warning',\n        message: `Node \"${node.data.label}\" has no outgoing connections`,\n        nodeId: node.id,\n      })\n    }\n  }\n\n  // Check for cycles (simple detection)\n  const hasCycle = detectCycle(nodes, edges)\n  if (hasCycle) {\n    errors.push({\n      type: 'warning',\n      message: 'Workflow contains cycles (loops)',\n    })\n  }\n\n  // Check for duplicate step IDs\n  const stepIds = new Set<string>()\n  for (const node of nodes) {\n    if (stepIds.has(node.id)) {\n      errors.push({\n        type: 'error',\n        message: `Duplicate step ID: ${node.id}`,\n        nodeId: node.id,\n      })\n    }\n    stepIds.add(node.id)\n  }\n\n  return errors\n}\n\n/**\n * Simple cycle detection using DFS\n */\nfunction detectCycle(nodes: Node[], edges: Edge[]): boolean {\n  const adjList = new Map<string, string[]>()\n\n  // Build adjacency list\n  for (const node of nodes) {\n    adjList.set(node.id, [])\n  }\n  for (const edge of edges) {\n    const neighbors = adjList.get(edge.source) || []\n    neighbors.push(edge.target)\n    adjList.set(edge.source, neighbors)\n  }\n\n  const visited = new Set<string>()\n  const recStack = new Set<string>()\n\n  function dfs(nodeId: string): boolean {\n    visited.add(nodeId)\n    recStack.add(nodeId)\n\n    const neighbors = adjList.get(nodeId) || []\n    for (const neighbor of neighbors) {\n      if (!visited.has(neighbor)) {\n        if (dfs(neighbor)) return true\n      } else if (recStack.has(neighbor)) {\n        return true // Cycle detected\n      }\n    }\n\n    recStack.delete(nodeId)\n    return false\n  }\n\n  for (const node of nodes) {\n    if (!visited.has(node.id)) {\n      if (dfs(node.id)) return true\n    }\n  }\n\n  return false\n}\n\n/**\n * Sanitize ID to match schema regex: /^[a-z0-9_-]+$/\n * Converts to lowercase, replaces invalid characters with underscores\n */\nexport function sanitizeId(input: string): string {\n  return input\n    .toLowerCase()\n    .replace(/[^a-z0-9_-]/g, '_')\n    .replace(/_{2,}/g, '_') // Replace multiple underscores with single\n    .replace(/(?:^_|_$)/g, '') // Remove leading/trailing underscores\n}\n\n/**\n * Validate ID matches schema regex: /^[a-z0-9_-]+$/\n */\nexport function validateId(id: string): boolean {\n  return /^[a-z0-9_-]+$/.test(id)\n}\n\n/**\n * Generate unique step ID\n */\nexport function generateStepId(prefix: string = 'step'): string {\n  const id = `${prefix}_${Date.now()}_${Math.random().toString(36).substr(2, 9)}`\n  return sanitizeId(id)\n}\n\n/** Prefix marking a durable, opaque transition id. */\nexport const DURABLE_TRANSITION_ID_PREFIX = 't_'\n\nconst LEGACY_TRANSITION_ID_PATTERN = /^e_/\n\n/**\n * Generate a durable, opaque transition ID.\n *\n * Endpoint-derived ids (`e_<from>_<to>`) tie a route's identity to the pair of\n * steps it happens to connect today, so re-pointing an edge would silently\n * change the id that mid-flight state resolves against\n * (`instance.pendingTransition`, `WorkflowBranchInstance.branchKey`). Opaque ids\n * keep route identity stable across reattachment and let two routes share the\n * same endpoints (a normal route and an error route, for example).\n *\n * Legacy endpoint-derived ids stay fully valid: stored definitions, seeded\n * examples and gallery templates keep their ids on load and save, and the\n * engine treats every transition id as an opaque string.\n *\n * The endpoint parameters are accepted for signature compatibility with callers\n * written against the endpoint-derived form; they no longer affect the result.\n */\nexport function generateTransitionId(_fromStepId?: string, _toStepId?: string): string {\n  const id = `${DURABLE_TRANSITION_ID_PREFIX}${Date.now().toString(36)}_${Math.random().toString(36).slice(2, 11)}`\n  return sanitizeId(id)\n}\n\n/** True when the id uses the legacy endpoint-derived (`e_<from>_<to>`) shape. */\nexport function isLegacyTransitionId(transitionId: string): boolean {\n  return LEGACY_TRANSITION_ID_PATTERN.test(transitionId)\n}\n\n/**\n * Append a new edge to the list, skipping duplicate connections.\n *\n * A plain-data replacement for React Flow's `addEdge` so the visual editor\n * page does not pull the `@xyflow/react` runtime out of its lazy boundary\n * (#3169). Mirrors `addEdge`'s dedup rule: an edge is dropped when one with\n * the same source/target endpoints (and handles) already exists.\n */\nexport function appendWorkflowEdge(edges: Edge[], edge: Edge): Edge[] {\n  const isDuplicate = edges.some(\n    (existing) =>\n      existing.source === edge.source &&\n      existing.target === edge.target &&\n      // Match addEdge: empty-string and nullish handles are equivalent.\n      (existing.sourceHandle || null) === (edge.sourceHandle || null) &&\n      (existing.targetHandle || null) === (edge.targetHandle || null),\n  )\n  return isDuplicate ? edges : [...edges, edge]\n}\n"],
+  "mappings": "AACA,OAAO,WAAW;AAGlB,SAAS,+BAA+B;AACxC,SAAS,yBAAyB;AAClC,SAAS,wBAAwB;AACjC,SAAS,eAAe,qBAAqB;AAC7C,SAAS,8BAA8B;AACvC;AAAA,EACE;AAAA,EACA;AAAA,OAEK;AACP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAqBP,MAAM,2BAA2B;AAAA,EAC/B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA;AACF;AAuBO,SAAS,kBACd,UACA,OACA,UAAoC,CAAC,GACH;AAWlC,QAAM,QAAQ,SAAS,OAAO,CAAC,SAAS,CAAC,iBAAiB,IAAI,KAAK,CAAC,cAAc,IAAI,CAAC;AACvF,QAAM,gBAAgB,IAAI;AAAA,IACxB,SAAS,OAAO,CAAC,SAAS,iBAAiB,IAAI,KAAK,cAAc,IAAI,CAAC,EAAE,IAAI,CAAC,SAAS,KAAK,EAAE;AAAA,EAChG;AAGA,QAAM,QAAQ,MAAM,IAAI,CAAC,SAAS;AAChC,UAAM,OAAY;AAAA,MAChB,QAAQ,KAAK;AAAA,MACb,UAAU,KAAK,KAAK,SAAS,KAAK;AAAA,MAClC,UAAU,sBAAsB,KAAK,QAAQ,WAAW;AAAA,IAC1D;AAGA,QAAI,KAAK,KAAK,aAAa;AACzB,WAAK,cAAc,KAAK,KAAK;AAAA,IAC/B;AAGA,QAAI,KAAK,KAAK,SAAS;AACrB,WAAK,UAAU,KAAK,KAAK;AAAA,IAC3B;AAGA,QAAI,KAAK,KAAK,aAAa;AACzB,WAAK,cAAc,KAAK,KAAK;AAAA,IAC/B;AAGA,QAAI,KAAK,KAAK,QAAQ;AACpB,WAAK,SAAS,KAAK,KAAK;AAAA,IAC1B;AAGA,QAAI,KAAK,SAAS,cAAc,KAAK,MAAM;AACzC,WAAK,iBAAiB;AAAA,QACpB,YAAY,KAAK,KAAK;AAAA,QACtB,iBAAiB,KAAK,KAAK,mBAAmB,CAAC;AAAA,QAC/C,SAAS,KAAK,KAAK;AAAA,QACnB,gBAAgB,KAAK,KAAK,kBAAkB,CAAC,YAAY,QAAQ;AAAA,MACnE;AAGA,UAAK,KAAK,KAAa,cAAe,KAAK,KAAa,gBAAgB,YAAY;AAClF,aAAK,eAAe,aAAc,KAAK,KAAa,cAAe,KAAK,KAAa,eAAe;AAAA,MACtG;AAGA,UAAK,KAAK,KAAa,kBAAmB,KAAK,KAAa,gBAAgB,gBAAgB;AAC1F,aAAK,eAAe,iBAAkB,KAAK,KAAa,kBAAmB,KAAK,KAAa,eAAe;AAAA,MAC9G;AAEA,UAAK,KAAK,KAAa,eAAgB,KAAK,KAAa,gBAAgB,aAAa;AACpF,aAAK,eAAe,cAAe,KAAK,KAAa,eAAgB,KAAK,KAAa,eAAe;AAAA,MACxG;AAEA,UAAK,KAAK,KAAa,mBAAoB,KAAK,KAAa,gBAAgB,iBAAiB;AAC5F,aAAK,eAAe,kBAAmB,KAAK,KAAa,mBAAoB,KAAK,KAAa,eAAe;AAAA,MAChH;AAEA,iBAAW,OAAO,0BAA0B;AAC1C,cAAM,WAAY,KAAK,KAAa,GAAG,KAAM,KAAK,KAAa,iBAAiB,GAAG;AACnF,YAAI,aAAa,OAAW,MAAK,eAAe,GAAG,IAAI;AAAA,MACzD;AAAA,IACF;AAGA,QAAI,KAAK,SAAS,mBAAmB,KAAK,KAAK,cAAc;AAC3D,WAAK,eAAe,KAAK,KAAK;AAAA,IAChC;AAGA,QAAI,KAAK,SAAS,eAAe,KAAK,KAAK,YAAY;AACrD,WAAK,aAAa,KAAK,KAAK;AAAA,IAC9B;AAKA,QAAI,KAAK,SAAS,eAAe;AAC/B,UAAI,KAAK,KAAK,YAAY;AACxB,aAAK,aAAa,KAAK,KAAK;AAAA,MAC9B;AACA,UAAI,KAAK,KAAK,cAAc;AAC1B,aAAK,eAAe,KAAK,KAAK;AAAA,MAChC;AAAA,IACF;AAGA,QAAI,KAAK,SAAS,WAAY,KAAK,KAAa,iBAAkB,KAAK,KAAa,cAAc,SAAS,GAAG;AAC5G,WAAK,gBAAiB,KAAK,KAAa;AAAA,IAC1C;AAIA,QAAK,KAAK,KAAa,gBAAgB;AACrC,WAAK,iBAAkB,KAAK,KAAa;AAAA,IAC3C;AAKA,UAAM,eAAwC;AAAA,MAC5C,GAAK,KAAK,KAAa,gBAAgB,OAAQ,KAAK,KAAa,iBAAiB,WAC7E,KAAK,KAAa,eACnB,CAAC;AAAA,IACP;AACA,UAAM,iBAAkB,KAAK,KAAa;AAC1C,QAAI,kBAAkB,OAAO,mBAAmB,YAAY,OAAO,KAAK,cAAc,EAAE,SAAS,GAAG;AAClG,mBAAa,iBAAiB;AAAA,IAChC,OAAO;AACL,aAAO,aAAa;AAAA,IACtB;AACA,QAAI,OAAO,KAAK,YAAY,EAAE,SAAS,GAAG;AACxC,WAAK,WAAW;AAAA,IAClB;AAGA,QAAI,QAAQ,oBAAoB,KAAK,UAAU;AAC7C,WAAK,kBAAkB;AAAA,QACrB,GAAG,KAAK,SAAS;AAAA,QACjB,GAAG,KAAK,SAAS;AAAA,MACnB;AAAA,IACF;AAEA,WAAO;AAAA,EACT,CAAC;AAMD,QAAM,cAAc,MACjB,OAAO,CAAC,SAAS,CAAC,kBAAkB,IAAI,KACpC,CAAC,wBAAwB,IAAI,KAC7B,CAAC,cAAc,IAAI,KACnB,CAAC,cAAc,IAAI,KAAK,MAAM,KAC9B,CAAC,cAAc,IAAI,KAAK,MAAM,CAAC,EACnC,IAAI,CAAC,SAAS;AACf,UAAM,WAAW,KAAK;AACtB,UAAM,aAAkB;AAAA,MACtB,cAAc,KAAK;AAAA,MACnB,YAAY,KAAK;AAAA,MACjB,UAAU,KAAK;AAAA,MACf,SAAS,UAAU,WAAW;AAAA,IAChC;AAGA,QAAI,UAAU,gBAAgB;AAC5B,iBAAW,iBAAiB,SAAS;AAAA,IACvC;AAGA,QAAI,UAAU,aAAa,QAAW;AACpC,iBAAW,WAAW,SAAS;AAAA,IACjC;AAKA,UAAM,YAAY,qBAAqB,UAAU,MAAM,KAAK,YAAY;AACxE,QAAI,WAAW;AACb,iBAAW,OAAO,UAAU;AAC5B,aAAO,OAAO,YAAY,UAAU,oBAAoB,IAAI,CAAC;AAAA,IAC/D;AAGA,QAAI,UAAU,8BAA8B,QAAW;AACrD,iBAAW,4BAA4B,SAAS;AAAA,IAClD;AAGA,QAAI,UAAU,iBAAiB,SAAS,cAAc,SAAS,GAAG;AAChE,iBAAW,gBAAgB,SAAS;AAAA,IACtC;AAEA,QAAI,UAAU,kBAAkB,SAAS,eAAe,SAAS,GAAG;AAClE,iBAAW,iBAAiB,SAAS;AAAA,IACvC;AAIA,QAAI,UAAU,cAAc,UAAa,SAAS,cAAc,MAAM;AACpE,iBAAW,YAAY,SAAS;AAAA,IAClC;AAGA,QAAI,UAAU,cAAc,SAAS,WAAW,SAAS,GAAG;AAC1D,iBAAW,aAAa,SAAS,WAAW,IAAI,CAAC,cAAmB;AAAA,QAClE,YAAY,SAAS;AAAA,QACrB,cAAc,SAAS;AAAA,QACvB,cAAc,SAAS;AAAA,QACvB,QAAQ,SAAS,UAAU,CAAC;AAAA;AAAA,QAE5B,GAAI,SAAS,UAAU,UAAa,EAAE,OAAO,SAAS,MAAM;AAAA,QAC5D,GAAI,SAAS,WAAW,EAAE,SAAS,SAAS,QAAQ;AAAA,QACpD,GAAI,SAAS,eAAe,EAAE,aAAa,SAAS,YAAY;AAAA,QAChE,GAAI,SAAS,eAAe,UAAa,EAAE,YAAY,SAAS,WAAW;AAAA;AAAA;AAAA;AAAA,QAI7E,GAAI,SAAS,gBAAgB,EAAE,cAAc,SAAS,aAAa;AAAA,MACnE,EAAE;AAAA,IACJ,WAAW,CAAC,WAAW,MAAM;AAM3B,YAAM,aAAa,MAAM,KAAK,OAAK,EAAE,OAAO,KAAK,MAAM;AACvD,UAAI,cAAc,WAAW,SAAS,eAAe,WAAW,MAAM;AACpE,YAAI,WAAW,KAAK,gBAAgB,WAAW,KAAK,YAAY;AAC9D,gBAAM,WAAgB;AAAA,YACpB,YAAY,WAAW,KAAK,cAAc,YAAY,WAAW,EAAE;AAAA,YACnE,cAAc,WAAW,KAAK,gBAAgB,WAAW,KAAK,SAAS;AAAA,YACvE,cAAc,WAAW,KAAK,gBAAgB;AAAA,YAC9C,QAAQ,WAAW,KAAK,kBAAkB,CAAC;AAAA,UAC7C;AAEA,cAAK,WAAW,KAAa,kBAAkB,QAAW;AACxD,qBAAS,QAAS,WAAW,KAAa;AAAA,UAC5C;AACA,cAAK,WAAW,KAAa,iBAAiB;AAC5C,qBAAS,UAAW,WAAW,KAAa;AAAA,UAC9C;AACA,cAAK,WAAW,KAAa,qBAAqB;AAChD,qBAAS,cAAe,WAAW,KAAa;AAAA,UAClD;AACA,cAAK,WAAW,KAAa,uBAAuB,QAAW;AAC7D,qBAAS,aAAc,WAAW,KAAa;AAAA,UACjD;AACA,qBAAW,aAAa,CAAC,QAAQ;AAAA,QACnC;AAAA,MACF;AAAA,IACF;AAGA,QAAI,UAAU,SAAS,CAAC,WAAW,gBAAgB;AACjD,iBAAW,iBAAiB,SAAS;AAAA,IACvC;AAEA,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,YAAY,CAAC;AAAA;AAAA,EACf;AACF;AAKO,SAAS,kBACd,YACA,UAAoC,CAAC,GACH;AAClC,QAAM,EAAE,aAAa,MAAM,gBAAgB,EAAE,UAAU,KAAK,YAAY,IAAI,GAAG,eAAe,IAAI;AAGlG,QAAM,UAAU,IAAI,IAAI,WAAW,MAAM,IAAI,UAAQ,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;AAKzE,QAAM,kBAAkB,oBAAI,IAAsC;AAClE,aAAW,QAAQ,WAAW,OAAO;AACnC,UAAM,SAAU,KAAa;AAC7B,QAAI,UAAU,OAAO,OAAO,MAAM,YAAY,OAAO,OAAO,MAAM,UAAU;AAC1E,sBAAgB,IAAI,KAAK,QAAQ,EAAE,GAAG,OAAO,GAAG,GAAG,OAAO,EAAE,CAAC;AAAA,IAC/D;AAAA,EACF;AAKA,QAAM,aAAa,cAAc,WAAW,MAAM,KAAK,CAAC,SAAS,CAAC,gBAAgB,IAAI,KAAK,MAAM,CAAC;AAClG,QAAM,iBAAiB,aACnB,gBAAgB,WAAW,OAAO,WAAW,aAAa;AAAA,IACxD,WAAW;AAAA,IACX,WAAW;AAAA,IACX,YAAY;AAAA,EACd,CAAC,IACD;AAGJ,QAAM,QAAgB,WAAW,MAAM,IAAI,CAAC,MAAM,UAAU;AAE1D,UAAM,WAAW,gBAAgB,IAAI,KAAK,MAAM,KAC3C,gBAAgB,IAAI,KAAK,MAAM,KAC/B,EAAE,GAAG,KAAK,GAAG,KAAK,QAAQ,cAAc,SAAS;AAKtD,UAAM,sBAAuB,KAAK,aAAa,cACzC,KAAa,YAAkC;AAAA,MAC/C,CAAC,aAAa,UAAU,iBAAiB;AAAA,IAC3C,IACA;AACJ,UAAM,WAAW,sBACb,gBACA,sBAAsB,KAAK,QAAQ;AAGvC,UAAM,WAAgB;AAAA,MACpB,OAAO,KAAK;AAAA,MACZ,aAAc,KAAa;AAAA,MAC3B,YAAY,QAAQ,IAAI,QAAQ;AAAA,IAClC;AAGA,QAAK,KAAa,SAAS;AACzB,eAAS,UAAW,KAAa;AAAA,IACnC;AAGA,QAAK,KAAa,aAAa;AAC7B,eAAS,cAAe,KAAa;AAAA,IACvC;AAGA,QAAK,KAAa,QAAQ;AACxB,eAAS,SAAU,KAAa;AAAA,IAClC;AAIA,UAAM,eAAgB,KAAa;AACnC,QAAI,gBAAgB,OAAO,iBAAiB,UAAU;AACpD,eAAS,eAAe;AACxB,YAAM,iBAAkB,aAAyC;AACjE,UAAI,kBAAkB,OAAO,mBAAmB,UAAU;AACxD,iBAAS,iBAAiB;AAAA,MAC5B;AAAA,IACF;AAGA,QAAI,KAAK,aAAa,eAAe,KAAK,gBAAgB;AACxD,eAAS,aAAa,KAAK,eAAe;AAC1C,eAAS,kBAAkB,KAAK,eAAe,mBAAmB,CAAC;AACnE,eAAS,UAAU,KAAK,eAAe;AACvC,eAAS,iBAAiB,KAAK,eAAe;AAG9C,eAAS,iBAAiB,KAAK;AAG/B,UAAI,KAAK,eAAe,YAAY;AAClC,iBAAS,aAAa,KAAK,eAAe;AAAA,MAC5C;AAGA,UAAI,KAAK,eAAe,gBAAgB;AACtC,iBAAS,iBAAiB,KAAK,eAAe;AAAA,MAChD;AAEA,UAAI,KAAK,eAAe,aAAa;AACnC,iBAAS,cAAc,KAAK,eAAe;AAAA,MAC7C;AAEA,UAAI,KAAK,eAAe,iBAAiB;AACvC,iBAAS,kBAAkB,KAAK,eAAe;AAAA,MACjD;AAEA,iBAAW,OAAO,0BAA0B;AAC1C,cAAM,YAAa,KAAK,eAA2C,GAAG;AACtE,YAAI,cAAc,OAAW,UAAS,GAAG,IAAI;AAAA,MAC/C;AAAA,IACF;AAGA,QAAI,KAAK,aAAa,qBAAsB,KAAa,cAAc;AACrE,eAAS,eAAgB,KAAa;AAAA,IACxC;AAIA,QAAI,KAAK,aAAa,gBAAgB;AACpC,YAAM,gBAAiB,KAAa,QAAQ;AAC5C,YAAM,WAAW,gBAAgB,gBAAgB,IAAI,aAAa,IAAI;AACtE,UAAI,UAAU,QAAQ,OAAQ,UAAS,SAAS,SAAS;AACzD,UAAI,UAAU,SAAS,OAAQ,UAAS,UAAU,SAAS;AAI3D,UAAK,KAAa,QAAQ;AACxB,iBAAS,gBAAiB,KAAa,OAAO;AAC9C,YAAK,KAAa,OAAO,WAAW,MAAM;AACxC,mBAAS,UAAW,KAAa,OAAO;AAAA,QAC1C;AAAA,MACF;AAAA,IACF;AAGA,QAAI,KAAK,aAAa,eAAgB,KAAa,YAAY;AAC7D,eAAS,aAAc,KAAa;AAAA,IACtC;AAIA,QAAI,qBAAqB;AACvB,UAAK,KAAa,cAAc;AAC9B,iBAAS,eAAgB,KAAa;AAAA,MACxC;AACA,eAAS,UAAU,oBAAoB,QAAQ;AAAA,IACjD;AAGA,QAAI,KAAK,aAAa,WAAY,KAAa,eAAe;AAC5D,eAAS,gBAAiB,KAAa;AAAA,IACzC;AAGA,QAAK,KAAa,gBAAgB;AAChC,eAAS,iBAAkB,KAAa;AAAA,IAC1C;AAGA,aAAS,QAAQ,oBAAoB,QAAQ;AAG7C,aAAS,SAAS;AAElB,WAAO;AAAA,MACL,IAAI,KAAK;AAAA,MACT,MAAM;AAAA,MACN;AAAA,MACA,MAAM;AAAA,IACR;AAAA,EACF,CAAC;AAED,QAAM,8BAA8B,oBAAI,IAAyB;AACjE,aAAW,QAAQ,WAAW,OAAO;AACnC,QAAI,KAAK,aAAa,YAAa;AACnC,UAAM,iBAAiB,KAAK,gBAAgB,aAAa,CAAC,GACvD,IAAI,CAAC,aAAyC,SAAS,YAAY,EACnE;AAAA,MACC,CAAC,iBACC,OAAO,iBAAiB;AAAA,IAC5B;AACF,QAAI,cAAc,SAAS,GAAG;AAC5B,kCAA4B,IAAI,KAAK,QAAQ,IAAI,IAAI,aAAa,CAAC;AAAA,IACrE;AAAA,EACF;AAGA,QAAM,QAAgB,WAAW,YAAY,IAAI,CAAC,eAAe;AAC/D,UAAM,kBAA2C;AACjD,UAAM,YAAY,wBAAwB,gBAAgB,IAAI;AAC9D,UAAM,uBAAuB,4BAC1B,IAAI,WAAW,UAAU,GACxB,IAAI,WAAW,YAAY,IAC3B,WAAW,eACX;AACJ,WAAO,uBAAuB;AAAA,MAC5B,IAAI,WAAW;AAAA,MACf,QAAQ,WAAW;AAAA,MACnB,QAAQ,WAAW;AAAA;AAAA;AAAA,MAGnB,cAAc,YACV,UAAU,oBAAoB,eAAe,IAC7C;AAAA,MACJ,MAAM;AAAA,QACJ,SAAS,WAAW;AAAA,QACpB,GAAI,YAAY,EAAE,MAAM,UAAU,KAAK,IAAI,CAAC;AAAA,QAC5C,GAAI,gBAAgB,cAAc,EAAE,aAAa,gBAAgB,YAAY,IAAI,CAAC;AAAA,QAClF,gBAAiB,WAAmB;AAAA,QACpC,UAAW,WAAmB,aAAa,SAAa,WAAmB,WAAW;AAAA,QACtF,2BAA4B,WAAmB,8BAA8B,SACxE,WAAmB,4BACpB;AAAA,QACJ,eAAe,WAAW,iBAAiB,CAAC;AAAA,QAC5C,gBAAgB,WAAW,kBAAkB,CAAC;AAAA,QAC9C,WAAY,WAAmB;AAAA,QAC/B,YAAY,WAAW,cAAc,CAAC;AAAA,QACtC,OAAQ,WAAmB,kBAAmB,WAAmB;AAAA;AAAA,QACjE,OAAQ,WAAmB,SAAS;AAAA;AAAA,MACtC;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AAED,SAAO,EAAE,OAAO,MAAM;AACxB;AAwBA,SAAS,iBACP,OACA,gBACA,YACA,kBAAkB,GACiB;AACnC,QAAM,OAAO,OAAO,UAAU,WAAW,MAAM,KAAK,IAAI;AACxD,QAAM,aAAa,KAAK,MAAM,KAAK,SAAS,CAAC,IAAI;AAGjD,MAAI,YAAY;AACd,WAAO;AAAA,MACL,OAAO,KAAK,IAAI,KAAK,IAAI,yBAAyB,UAAU,GAAG,cAAc;AAAA,MAC7E,QAAQ;AAAA,IACV;AAAA,EACF;AACA,QAAM,QAAQ,iBACV,iBACA,KAAK,IAAI,KAAK,IAAI,gBAAgB,UAAU,GAAG,cAAc;AACjE,QAAM,aAAa,iBAAiB,cAAc,0BAA0B;AAC5E,QAAM,eACJ,kBAAkB,IACd,oCAAoC,kBAAkB,0BACtD;AACN,SAAO,EAAE,OAAO,QAAQ,aAAa,aAAa;AACpD;AA2BA,SAAS,eAAe,MAAkC;AACxD,SAAO,KAAK,aAAa,WACpB,KAAK,aAAa,SAClB,KAAK,aAAa,WAClB,KAAK,aAAa;AACzB;AAQO,SAAS,cACd,MACA,kBAAkB,GACiB;AACnC,MAAI,OAAO,KAAK,UAAU,YAAY,OAAO,KAAK,WAAW,UAAU;AACrE,WAAO,EAAE,OAAO,KAAK,OAAO,QAAQ,KAAK,OAAO;AAAA,EAClD;AACA,QAAM,cAAc,KAAK;AACzB,QAAM,iBAAiB,OAAO,gBAAgB,YAAY,YAAY,KAAK,EAAE,SAAS;AACtF,SAAO;AAAA,IACL,KAAK,YAAY,KAAK;AAAA,IACtB;AAAA,IACA,eAAe,IAAI;AAAA,IACnB;AAAA,EACF;AACF;AAYA,SAAS,iBACP,MACA,aACQ;AACR,QAAM,OAAO,yBAAyB,MAAM,WAAW;AACvD,SAAO,OAAO,IAAI,OAAO,IAAI;AAC/B;AAEA,SAAS,yBACP,MACA,aACQ;AACR,QAAM,YAAY,MAAM,gBAAgB,aAAa,MAAM;AAC3D,MAAI,MAAM,QAAQ,SAAS,GAAG;AAC5B,WAAO,UAAU;AAAA,MACf,CAAC,aACC,OAAO,aAAa,YACjB,aAAa,QACb,OAAQ,SAAwC,iBAAiB;AAAA,IACxE,EAAE;AAAA,EACJ;AACA,MAAI,CAAC,kBAAkB,IAAI,EAAG,QAAO;AACrC,QAAM,QAAQ,oBAAI,IAAY;AAC9B,aAAW,cAAc,aAAa;AACpC,QAAI,YAAY,eAAe,KAAK,OAAQ;AAC5C,QAAI,YAAY,SAAS,UAAW;AACpC,QAAI,OAAO,WAAW,gBAAgB,SAAU,OAAM,IAAI,WAAW,WAAW;AAAA,EAClF;AACA,QAAM,IAAI,UAAU;AACpB,SAAO,MAAM;AACf;AAEA,SAAS,kBAAkB,MAAkC;AAC3D,MAAI,MAAM,aAAa,cAAe,QAAO;AAC7C,QAAM,aAAa,MAAM;AACzB,SAAO,MAAM,QAAQ,UAAU,KAC1B,WAAW;AAAA,IACZ,CAAC,aACC,OAAO,aAAa,YACjB,aAAa,QACZ,SAAwC,iBAAiB;AAAA,EACjE;AACJ;AAEA,SAAS,gBACP,OACA,aACA,UAAkC,CAAC,GACI;AACvC,QAAM,YAAY,oBAAI,IAAsC;AAE5D,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,QAAM,UAAU,QAAQ,aAAa;AAErC,QAAM,QAAQ,IAAI,MAAM,SAAS,MAAM;AACvC,QAAM,oBAAoB,OAAO,CAAC,EAAE;AACpC,QAAM,SAAS,EAAE,SAAS,SAAS,IAAI,SAAS,GAAG,CAAC;AAKpD,aAAW,QAAQ,OAAO;AACxB,UAAM,QAAQ,KAAK,QAAQ,cAAc,MAAM,iBAAiB,MAAM,WAAW,CAAC,CAAC;AAAA,EACrF;AAMA,aAAW,cAAc,aAAa;AACpC,QAAI,MAAM,QAAQ,WAAW,UAAU,KAAK,MAAM,QAAQ,WAAW,QAAQ,GAAG;AAC9E,YAAM,QAAQ,WAAW,YAAY,WAAW,UAAU,CAAC,CAAC;AAAA,IAC9D;AAAA,EACF;AAEA,QAAM,OAAO,KAAK;AAElB,aAAW,QAAQ,OAAO;AACxB,UAAM,OAAO,MAAM,KAAK,KAAK,MAAM;AACnC,QAAI,CAAC,QAAQ,OAAO,KAAK,MAAM,YAAY,OAAO,KAAK,MAAM,SAAU;AAGvE,cAAU,IAAI,KAAK,QAAQ;AAAA,MACzB,GAAG,KAAK,IAAI,KAAK,QAAQ;AAAA,MACzB,GAAG,KAAK,IAAI,KAAK,SAAS;AAAA,IAC5B,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAGO,MAAM,kBAAkB;AAiBxB,SAAS,qBACd,WACA,UACA,aACA,MAAc,iBACyB;AACvC,QAAM,YAAY,oBAAI,IAAoB;AAC1C,aAAW,cAAc,aAAa;AACpC,cAAU,IAAI,WAAW,aAAa,UAAU,IAAI,WAAW,UAAU,KAAK,KAAK,CAAC;AAAA,EACtF;AAEA,QAAM,UAAU,CAAC,OAAe,SAAS,IAAI,EAAE,GAAG,SAAS;AAC3D,QAAM,WAAW,CAAC,OAAe,SAAS,IAAI,EAAE,GAAG,UAAU;AAE7D,QAAM,SAAS,IAAI,IAAI,SAAS;AAChC,aAAW,cAAc,aAAa;AACpC,UAAM,OAAO,OAAO,IAAI,WAAW,UAAU;AAC7C,UAAM,KAAK,OAAO,IAAI,WAAW,QAAQ;AACzC,QAAI,CAAC,QAAQ,CAAC,GAAI;AAElB,QAAI,GAAG,KAAK,KAAK,EAAG;AAEpB,SAAK,UAAU,IAAI,WAAW,UAAU,KAAK,OAAO,EAAG;AAEvD,UAAM,WAAW,GAAG;AACpB,UAAM,YAAY,KAAK,IAAI,QAAQ,WAAW,UAAU;AACxD,QAAI,UAAU,OAAO;AACrB,eAAW,CAAC,IAAI,GAAG,KAAK,QAAQ;AAC9B,UAAI,OAAO,WAAW,WAAY;AAClC,YAAM,YAAY,IAAI,IAAI,QAAQ,EAAE;AACpC,UAAI,YAAY,YAAY,IAAI,IAAI,UAAW;AAC/C,gBAAU,KAAK,IAAI,SAAS,IAAI,IAAI,SAAS,EAAE,CAAC;AAAA,IAClD;AACA,QAAI,YAAY,OAAO,kBAAmB;AAC1C,WAAO,IAAI,WAAW,YAAY,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,MAAM,UAAU,GAAG,EAAE,CAAC;AAAA,EAC/E;AACA,SAAO;AACT;AAYO,SAAS,gBAAgB,OAAe,OAAuB;AAUpE,QAAM,QAAQ,MACX,OAAO,CAAC,SAAS,CAAC,iBAAiB,IAAI,KAAK,CAAC,cAAc,IAAI,CAAC,EAChE,IAAI,CAAC,UAAU;AAAA,IACd,QAAQ,KAAK;AAAA,IACb,UAAW,KAAK,MAAc;AAAA,IAC9B,UAAU,KAAK;AAAA,IACf,aAAc,KAAK,MAAc;AAAA,IACjC,OAAO,KAAK,UAAU;AAAA,IACtB,QAAQ,KAAK,UAAU;AAAA,EACzB,EAAE;AACJ,QAAM,cAAc,MACjB,OAAO,CAAC,SAAS,CAAC,kBAAkB,IAAI,CAAC,EACzC,IAAI,CAAC,UAAU;AAAA,IACd,YAAY,KAAK;AAAA,IACjB,UAAU,KAAK;AAAA,EACjB,EAAE;AAEJ,QAAM,YAAY,gBAAgB,OAAO,aAAa;AAAA,IACpD,WAAW;AAAA,IACX,WAAW;AAAA,IACX,YAAY;AAAA,EACd,CAAC;AAKD,QAAM,WAAW,IAAI;AAAA,IACnB,MAAM,IAAI,CAAC,SAAS;AAAA,MAClB,KAAK;AAAA,MACL,EAAE,OAAO,KAAK,SAAS,gBAAgB,QAAQ,KAAK,UAAU,YAAY;AAAA,IAC5E,CAAC;AAAA,EACH;AACA,QAAM,UAAU,qBAAqB,WAAW,UAAU,WAAW;AAErE,SAAO,MAAM,IAAI,CAAC,SAAS;AACzB,UAAM,OAAO,QAAQ,IAAI,KAAK,EAAE;AAChC,WAAO,OAAO,EAAE,GAAG,MAAM,UAAU,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,EAAE,EAAE,IAAI;AAAA,EAClE,CAAC;AACH;AAKA,SAAS,sBAAsB,UAA0B;AACvD,QAAM,UAAkC;AAAA,IACtC,OAAO;AAAA,IACP,KAAK;AAAA,IACL,UAAU;AAAA,IACV,WAAW;AAAA,IACX,aAAa;AAAA,IACb,UAAU;AAAA,IACV,eAAe;AAAA,IACf,cAAc;AAAA,IACd,kBAAkB;AAAA,IAClB,cAAc;AAAA,IACd,cAAc;AAAA;AAAA,IAEd,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,QAAQ;AAAA,EACV;AACA,SAAO,QAAQ,QAAQ,KAAK;AAC9B;AAKA,SAAS,sBAAsB,UAA0B;AACvD,QAAM,UAAkC;AAAA,IACtC,OAAO;AAAA,IACP,KAAK;AAAA,IACL,WAAW;AAAA,IACX,WAAW;AAAA,IACX,cAAc;AAAA,IACd,UAAU;AAAA,IACV,iBAAiB;AAAA,IACjB,gBAAgB;AAAA,IAChB,oBAAoB;AAAA,IACpB,eAAe;AAAA,IACf,eAAe;AAAA,IACf,SAAS;AAAA,IACT,QAAQ;AAAA,EACV;AACA,SAAO,QAAQ,QAAQ,KAAK;AAC9B;AAKO,SAAS,oBAAoB,UAA0B;AAC5D,QAAM,SAAiC;AAAA,IACrC,OAAO;AAAA,IACP,KAAK;AAAA,IACL,UAAU;AAAA,IACV,WAAW;AAAA,IACX,UAAU;AAAA,IACV,aAAa;AAAA,IACb,eAAe;AAAA,IACf,cAAc;AAAA,IACd,kBAAkB;AAAA,IAClB,cAAc;AAAA,IACd,cAAc;AAAA,IACd,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,QAAQ;AAAA,EACV;AACA,SAAO,OAAO,QAAQ,KAAK;AAC7B;AAYO,SAAS,sBAAsB,UAAkB,OAAkC;AACxF,QAAM,SAA4B,CAAC;AAOnC,QAAM,QAAQ,SAAS,OAAO,CAAC,SAAS,CAAC,iBAAiB,IAAI,KAAK,CAAC,cAAc,IAAI,CAAC;AAGvF,QAAM,aAAa,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,OAAO;AACzD,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACA,MAAI,WAAW,SAAS,GAAG;AACzB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,QAAM,WAAW,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK;AACrD,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,SAAS,QAAS;AAC3B,QAAI,KAAK,SAAS,MAAO;AAEzB,UAAM,cAAc,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,KAAK,EAAE;AAC1D,UAAM,cAAc,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,KAAK,EAAE;AAE1D,QAAI,CAAC,eAAe,CAAC,aAAa;AAChC,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,SAAS,KAAK,KAAK,KAAK;AAAA,QACjC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH,WAAW,CAAC,aAAa;AACvB,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,SAAS,KAAK,KAAK,KAAK;AAAA,QACjC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH,WAAW,CAAC,aAAa;AACvB,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,SAAS,KAAK,KAAK,KAAK;AAAA,QACjC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH;AAAA,EACF;AAGA,QAAM,WAAW,YAAY,OAAO,KAAK;AACzC,MAAI,UAAU;AACZ,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,QAAM,UAAU,oBAAI,IAAY;AAChC,aAAW,QAAQ,OAAO;AACxB,QAAI,QAAQ,IAAI,KAAK,EAAE,GAAG;AACxB,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,sBAAsB,KAAK,EAAE;AAAA,QACtC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH;AACA,YAAQ,IAAI,KAAK,EAAE;AAAA,EACrB;AAEA,SAAO;AACT;AAKA,SAAS,YAAY,OAAe,OAAwB;AAC1D,QAAM,UAAU,oBAAI,IAAsB;AAG1C,aAAW,QAAQ,OAAO;AACxB,YAAQ,IAAI,KAAK,IAAI,CAAC,CAAC;AAAA,EACzB;AACA,aAAW,QAAQ,OAAO;AACxB,UAAM,YAAY,QAAQ,IAAI,KAAK,MAAM,KAAK,CAAC;AAC/C,cAAU,KAAK,KAAK,MAAM;AAC1B,YAAQ,IAAI,KAAK,QAAQ,SAAS;AAAA,EACpC;AAEA,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,WAAW,oBAAI,IAAY;AAEjC,WAAS,IAAI,QAAyB;AACpC,YAAQ,IAAI,MAAM;AAClB,aAAS,IAAI,MAAM;AAEnB,UAAM,YAAY,QAAQ,IAAI,MAAM,KAAK,CAAC;AAC1C,eAAW,YAAY,WAAW;AAChC,UAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG;AAC1B,YAAI,IAAI,QAAQ,EAAG,QAAO;AAAA,MAC5B,WAAW,SAAS,IAAI,QAAQ,GAAG;AACjC,eAAO;AAAA,MACT;AAAA,IACF;AAEA,aAAS,OAAO,MAAM;AACtB,WAAO;AAAA,EACT;AAEA,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,QAAQ,IAAI,KAAK,EAAE,GAAG;AACzB,UAAI,IAAI,KAAK,EAAE,EAAG,QAAO;AAAA,IAC3B;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,WAAW,OAAuB;AAChD,SAAO,MACJ,YAAY,EACZ,QAAQ,gBAAgB,GAAG,EAC3B,QAAQ,UAAU,GAAG,EACrB,QAAQ,cAAc,EAAE;AAC7B;AAKO,SAAS,WAAW,IAAqB;AAC9C,SAAO,gBAAgB,KAAK,EAAE;AAChC;AAKO,SAAS,eAAe,SAAiB,QAAgB;AAC9D,QAAM,KAAK,GAAG,MAAM,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,OAAO,GAAG,CAAC,CAAC;AAC7E,SAAO,WAAW,EAAE;AACtB;AAGO,MAAM,+BAA+B;AAE5C,MAAM,+BAA+B;AAmB9B,SAAS,qBAAqB,aAAsB,WAA4B;AACrF,QAAM,KAAK,GAAG,4BAA4B,GAAG,KAAK,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,EAAE,CAAC;AAC/G,SAAO,WAAW,EAAE;AACtB;AAGO,SAAS,qBAAqB,cAA+B;AAClE,SAAO,6BAA6B,KAAK,YAAY;AACvD;AAUO,SAAS,mBAAmB,OAAe,MAAoB;AACpE,QAAM,cAAc,MAAM;AAAA,IACxB,CAAC,aACC,SAAS,WAAW,KAAK,UACzB,SAAS,WAAW,KAAK;AAAA,KAExB,SAAS,gBAAgB,WAAW,KAAK,gBAAgB,UACzD,SAAS,gBAAgB,WAAW,KAAK,gBAAgB;AAAA,EAC9D;AACA,SAAO,cAAc,QAAQ,CAAC,GAAG,OAAO,IAAI;AAC9C;",
   "names": []
 }

package/dist/modules/workflows/lib/icon-search.js

@@ -0,0 +1,32 @@
+const ICON_SEARCH_RESULT_LIMIT = 120;
+function normalizeIconQuery(query) {
+  return query.trim().toLowerCase().replace(/[\s_]+/g, "-");
+}
+function normalizeIconName(value) {
+  if (!value) return "";
+  const trimmed = value.trim();
+  if (!trimmed) return "";
+  const withoutPrefix = trimmed.startsWith("lucide:") ? trimmed.slice("lucide:".length) : trimmed;
+  if (!withoutPrefix) return "";
+  if (!/[-_\s]/.test(withoutPrefix) && /[A-Z]/.test(withoutPrefix)) {
+    return withoutPrefix.replace(/([a-z0-9])([A-Z])/g, "$1-$2").replace(/([A-Z])([A-Z][a-z])/g, "$1-$2").toLowerCase();
+  }
+  return withoutPrefix.replace(/[_\s]+/g, "-").replace(/-+/g, "-").toLowerCase();
+}
+function filterIconNames(names, query, limit = ICON_SEARCH_RESULT_LIMIT) {
+  const normalized = normalizeIconQuery(query);
+  if (!normalized) return names.slice(0, limit);
+  const prefixMatches = [];
+  const substringMatches = [];
+  for (const name of names) {
+    if (name.startsWith(normalized)) prefixMatches.push(name);
+    else if (name.includes(normalized)) substringMatches.push(name);
+  }
+  return [...prefixMatches, ...substringMatches].slice(0, limit);
+}
+export {
+  ICON_SEARCH_RESULT_LIMIT,
+  filterIconNames,
+  normalizeIconName
+};
+//# sourceMappingURL=icon-search.js.map

package/dist/modules/workflows/lib/icon-search.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/modules/workflows/lib/icon-search.ts"],
+  "sourcesContent": ["/**\n * Icon-name search for the definition icon picker (spec section 4.5:\n * \"searchable lucide grid\").\n *\n * The grid searches the platform's SHARED lucide registry\n * (`@open-mercato/ui/backend/icons/lucideRegistry`) rather than the full lucide\n * export: that registry is generated from the icon names actually used across\n * the repo and is already in every backend page's chunk through `AppShell`, so\n * the picker adds no icons to the bundle at all. Importing `lucide-react`\n * wholesale would have pulled well over a thousand components into the editor\n * chunk for a field that stores one string.\n *\n * PURE: string in, strings out \u2014 no React, no icon components.\n */\n\n/** Enough to fill the grid without rendering a thousand buttons at once. */\nexport const ICON_SEARCH_RESULT_LIMIT = 120\n\nfunction normalizeIconQuery(query: string): string {\n  return query.trim().toLowerCase().replace(/[\\s_]+/g, '-')\n}\n\n/**\n * Normalize an author-entered icon value to the registry's kebab-case key.\n *\n * The field has always been free text, so stored values are a mix of\n * `ShoppingCart`, `shopping-cart` and `lucide:shopping-cart`. Matching them all\n * is what lets an existing definition open with its icon selected instead of\n * looking unset.\n */\nexport function normalizeIconName(value: string | null | undefined): string {\n  if (!value) return ''\n  const trimmed = value.trim()\n  if (!trimmed) return ''\n  const withoutPrefix = trimmed.startsWith('lucide:') ? trimmed.slice('lucide:'.length) : trimmed\n  if (!withoutPrefix) return ''\n  if (!/[-_\\s]/.test(withoutPrefix) && /[A-Z]/.test(withoutPrefix)) {\n    return withoutPrefix\n      .replace(/([a-z0-9])([A-Z])/g, '$1-$2')\n      .replace(/([A-Z])([A-Z][a-z])/g, '$1-$2')\n      .toLowerCase()\n  }\n  return withoutPrefix.replace(/[_\\s]+/g, '-').replace(/-+/g, '-').toLowerCase()\n}\n\n/**\n * Filter icon names by query, ranking a prefix match above a substring match so\n * typing \"cart\" surfaces `cart` before `shopping-cart`. Names are compared\n * pairwise for ordering \u2014 never an uncompared sort on a shared array (#3620).\n */\nexport function filterIconNames(\n  names: readonly string[],\n  query: string,\n  limit: number = ICON_SEARCH_RESULT_LIMIT,\n): string[] {\n  const normalized = normalizeIconQuery(query)\n  if (!normalized) return names.slice(0, limit)\n  const prefixMatches: string[] = []\n  const substringMatches: string[] = []\n  for (const name of names) {\n    if (name.startsWith(normalized)) prefixMatches.push(name)\n    else if (name.includes(normalized)) substringMatches.push(name)\n  }\n  return [...prefixMatches, ...substringMatches].slice(0, limit)\n}\n"],
+  "mappings": "AAgBO,MAAM,2BAA2B;AAExC,SAAS,mBAAmB,OAAuB;AACjD,SAAO,MAAM,KAAK,EAAE,YAAY,EAAE,QAAQ,WAAW,GAAG;AAC1D;AAUO,SAAS,kBAAkB,OAA0C;AAC1E,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,CAAC,QAAS,QAAO;AACrB,QAAM,gBAAgB,QAAQ,WAAW,SAAS,IAAI,QAAQ,MAAM,UAAU,MAAM,IAAI;AACxF,MAAI,CAAC,cAAe,QAAO;AAC3B,MAAI,CAAC,SAAS,KAAK,aAAa,KAAK,QAAQ,KAAK,aAAa,GAAG;AAChE,WAAO,cACJ,QAAQ,sBAAsB,OAAO,EACrC,QAAQ,wBAAwB,OAAO,EACvC,YAAY;AAAA,EACjB;AACA,SAAO,cAAc,QAAQ,WAAW,GAAG,EAAE,QAAQ,OAAO,GAAG,EAAE,YAAY;AAC/E;AAOO,SAAS,gBACd,OACA,OACA,QAAgB,0BACN;AACV,QAAM,aAAa,mBAAmB,KAAK;AAC3C,MAAI,CAAC,WAAY,QAAO,MAAM,MAAM,GAAG,KAAK;AAC5C,QAAM,gBAA0B,CAAC;AACjC,QAAM,mBAA6B,CAAC;AACpC,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,WAAW,UAAU,EAAG,eAAc,KAAK,IAAI;AAAA,aAC/C,KAAK,SAAS,UAAU,EAAG,kBAAiB,KAAK,IAAI;AAAA,EAChE;AACA,SAAO,CAAC,GAAG,eAAe,GAAG,gBAAgB,EAAE,MAAM,GAAG,KAAK;AAC/D;",
+  "names": []
+}

package/dist/modules/workflows/lib/insert-at-cursor.js

@@ -0,0 +1,26 @@
+function insertAtCursor(currentValue, insertion, selectionStart, selectionEnd) {
+  const length = currentValue.length;
+  const clamp = (position) => Math.min(Math.max(position, 0), length);
+  const start = selectionStart === null ? length : clamp(selectionStart);
+  const end = selectionEnd === null ? start : Math.max(clamp(selectionEnd), start);
+  const value = `${currentValue.slice(0, start)}${insertion}${currentValue.slice(end)}`;
+  return { value, cursor: start + insertion.length };
+}
+function insertAtElementCursor(element, currentValue, insertion) {
+  if (element === null) return insertAtCursor(currentValue, insertion, null, null);
+  let selectionStart = null;
+  let selectionEnd = null;
+  try {
+    selectionStart = element.selectionStart;
+    selectionEnd = element.selectionEnd;
+  } catch {
+    selectionStart = null;
+    selectionEnd = null;
+  }
+  return insertAtCursor(currentValue, insertion, selectionStart, selectionEnd);
+}
+export {
+  insertAtCursor,
+  insertAtElementCursor
+};
+//# sourceMappingURL=insert-at-cursor.js.map

package/dist/modules/workflows/lib/insert-at-cursor.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/modules/workflows/lib/insert-at-cursor.ts"],
+  "sourcesContent": ["/**\n * Workflows Module - cursor-aware text insertion (spec\n * 2026-07-26-workflows-ux-redesign.md section 3.5, step 3.2).\n *\n * Pure helper shared by the variable picker: given the current value of a\n * text control and a selection range, produce the value with the insertion\n * spliced in and the cursor position immediately after it. Works identically\n * for `<input>` and `<textarea>` \u2014 the element-facing wrapper only reads\n * `selectionStart`/`selectionEnd`, degrading to append-at-end when the\n * element is missing or does not expose a selection (e.g. non-text inputs).\n */\n\nexport interface CursorInsertionResult {\n  value: string\n  cursor: number\n}\n\nexport function insertAtCursor(\n  currentValue: string,\n  insertion: string,\n  selectionStart: number | null,\n  selectionEnd: number | null,\n): CursorInsertionResult {\n  const length = currentValue.length\n  const clamp = (position: number) => Math.min(Math.max(position, 0), length)\n  const start = selectionStart === null ? length : clamp(selectionStart)\n  const end = selectionEnd === null ? start : Math.max(clamp(selectionEnd), start)\n  const value = `${currentValue.slice(0, start)}${insertion}${currentValue.slice(end)}`\n  return { value, cursor: start + insertion.length }\n}\n\nexport interface CursorInsertionTarget {\n  selectionStart: number | null\n  selectionEnd: number | null\n}\n\nexport function insertAtElementCursor(\n  element: CursorInsertionTarget | null,\n  currentValue: string,\n  insertion: string,\n): CursorInsertionResult {\n  if (element === null) return insertAtCursor(currentValue, insertion, null, null)\n  let selectionStart: number | null = null\n  let selectionEnd: number | null = null\n  try {\n    selectionStart = element.selectionStart\n    selectionEnd = element.selectionEnd\n  } catch {\n    selectionStart = null\n    selectionEnd = null\n  }\n  return insertAtCursor(currentValue, insertion, selectionStart, selectionEnd)\n}\n"],
+  "mappings": "AAiBO,SAAS,eACd,cACA,WACA,gBACA,cACuB;AACvB,QAAM,SAAS,aAAa;AAC5B,QAAM,QAAQ,CAAC,aAAqB,KAAK,IAAI,KAAK,IAAI,UAAU,CAAC,GAAG,MAAM;AAC1E,QAAM,QAAQ,mBAAmB,OAAO,SAAS,MAAM,cAAc;AACrE,QAAM,MAAM,iBAAiB,OAAO,QAAQ,KAAK,IAAI,MAAM,YAAY,GAAG,KAAK;AAC/E,QAAM,QAAQ,GAAG,aAAa,MAAM,GAAG,KAAK,CAAC,GAAG,SAAS,GAAG,aAAa,MAAM,GAAG,CAAC;AACnF,SAAO,EAAE,OAAO,QAAQ,QAAQ,UAAU,OAAO;AACnD;AAOO,SAAS,sBACd,SACA,cACA,WACuB;AACvB,MAAI,YAAY,KAAM,QAAO,eAAe,cAAc,WAAW,MAAM,IAAI;AAC/E,MAAI,iBAAgC;AACpC,MAAI,eAA8B;AAClC,MAAI;AACF,qBAAiB,QAAQ;AACzB,mBAAe,QAAQ;AAAA,EACzB,QAAQ;AACN,qBAAiB;AACjB,mBAAe;AAAA,EACjB;AACA,SAAO,eAAe,cAAc,WAAW,gBAAgB,YAAY;AAC7E;",
+  "names": []
+}

package/dist/modules/workflows/lib/instance-date-filter.js

@@ -0,0 +1,28 @@
+const CALENDAR_DAY = /^\d{4}-\d{2}-\d{2}$/;
+function parseBoundary(raw, edge) {
+  if (raw === null || raw === void 0 || raw === "") return { ok: true, value: null };
+  const normalized = CALENDAR_DAY.test(raw) ? `${raw}${edge === "start" ? "T00:00:00.000Z" : "T23:59:59.999Z"}` : raw;
+  const parsed = new Date(normalized);
+  if (Number.isNaN(parsed.getTime())) {
+    return { ok: false, error: `Invalid date value: ${raw}` };
+  }
+  return { ok: true, value: parsed };
+}
+function buildStartedAtRange(from, to) {
+  const parsedFrom = parseBoundary(from, "start");
+  if (!parsedFrom.ok) return { ok: false, error: parsedFrom.error };
+  const parsedTo = parseBoundary(to, "end");
+  if (!parsedTo.ok) return { ok: false, error: parsedTo.error };
+  if (!parsedFrom.value && !parsedTo.value) return { ok: true, range: null };
+  if (parsedFrom.value && parsedTo.value && parsedFrom.value.getTime() > parsedTo.value.getTime()) {
+    return { ok: false, error: "startedFrom must not be after startedTo" };
+  }
+  const range = {};
+  if (parsedFrom.value) range.$gte = parsedFrom.value;
+  if (parsedTo.value) range.$lte = parsedTo.value;
+  return { ok: true, range };
+}
+export {
+  buildStartedAtRange
+};
+//# sourceMappingURL=instance-date-filter.js.map

package/dist/modules/workflows/lib/instance-date-filter.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/modules/workflows/lib/instance-date-filter.ts"],
+  "sourcesContent": ["/**\n * Run-list date filtering (spec \u00A78.3: \"Run list: filters by definition, status,\n * correlationKey, date\") \u2014 PURE.\n *\n * The filter bar's date-range control emits calendar days (`yyyy-MM-dd`), not\n * instants, so `to` has to cover the WHOLE day or \"started on the 3rd\" silently\n * excludes everything after midnight. Callers may also pass a full ISO\n * timestamp, which is taken verbatim.\n *\n * An unparseable value is an ERROR, never a silently dropped filter: handing\n * `new Date('garbage')` to the ORM is an Invalid Date, and a query built from\n * one answers nothing while looking like it answered something.\n */\n\nconst CALENDAR_DAY = /^\\d{4}-\\d{2}-\\d{2}$/\n\nexport type DateBoundaryResult =\n  | { ok: true; value: Date | null }\n  | { ok: false; error: string }\n\nfunction parseBoundary(raw: string | null | undefined, edge: 'start' | 'end'): DateBoundaryResult {\n  if (raw === null || raw === undefined || raw === '') return { ok: true, value: null }\n  const normalized = CALENDAR_DAY.test(raw)\n    ? `${raw}${edge === 'start' ? 'T00:00:00.000Z' : 'T23:59:59.999Z'}`\n    : raw\n  const parsed = new Date(normalized)\n  if (Number.isNaN(parsed.getTime())) {\n    return { ok: false, error: `Invalid date value: ${raw}` }\n  }\n  return { ok: true, value: parsed }\n}\n\nexport type StartedAtRangeResult =\n  | { ok: true; range: { $gte?: Date; $lte?: Date } | null }\n  | { ok: false; error: string }\n\nexport function buildStartedAtRange(\n  from: string | null | undefined,\n  to: string | null | undefined\n): StartedAtRangeResult {\n  const parsedFrom = parseBoundary(from, 'start')\n  if (!parsedFrom.ok) return { ok: false, error: parsedFrom.error }\n  const parsedTo = parseBoundary(to, 'end')\n  if (!parsedTo.ok) return { ok: false, error: parsedTo.error }\n\n  if (!parsedFrom.value && !parsedTo.value) return { ok: true, range: null }\n\n  if (parsedFrom.value && parsedTo.value && parsedFrom.value.getTime() > parsedTo.value.getTime()) {\n    return { ok: false, error: 'startedFrom must not be after startedTo' }\n  }\n\n  const range: { $gte?: Date; $lte?: Date } = {}\n  if (parsedFrom.value) range.$gte = parsedFrom.value\n  if (parsedTo.value) range.$lte = parsedTo.value\n  return { ok: true, range }\n}\n"],
+  "mappings": "AAcA,MAAM,eAAe;AAMrB,SAAS,cAAc,KAAgC,MAA2C;AAChG,MAAI,QAAQ,QAAQ,QAAQ,UAAa,QAAQ,GAAI,QAAO,EAAE,IAAI,MAAM,OAAO,KAAK;AACpF,QAAM,aAAa,aAAa,KAAK,GAAG,IACpC,GAAG,GAAG,GAAG,SAAS,UAAU,mBAAmB,gBAAgB,KAC/D;AACJ,QAAM,SAAS,IAAI,KAAK,UAAU;AAClC,MAAI,OAAO,MAAM,OAAO,QAAQ,CAAC,GAAG;AAClC,WAAO,EAAE,IAAI,OAAO,OAAO,uBAAuB,GAAG,GAAG;AAAA,EAC1D;AACA,SAAO,EAAE,IAAI,MAAM,OAAO,OAAO;AACnC;AAMO,SAAS,oBACd,MACA,IACsB;AACtB,QAAM,aAAa,cAAc,MAAM,OAAO;AAC9C,MAAI,CAAC,WAAW,GAAI,QAAO,EAAE,IAAI,OAAO,OAAO,WAAW,MAAM;AAChE,QAAM,WAAW,cAAc,IAAI,KAAK;AACxC,MAAI,CAAC,SAAS,GAAI,QAAO,EAAE,IAAI,OAAO,OAAO,SAAS,MAAM;AAE5D,MAAI,CAAC,WAAW,SAAS,CAAC,SAAS,MAAO,QAAO,EAAE,IAAI,MAAM,OAAO,KAAK;AAEzE,MAAI,WAAW,SAAS,SAAS,SAAS,WAAW,MAAM,QAAQ,IAAI,SAAS,MAAM,QAAQ,GAAG;AAC/F,WAAO,EAAE,IAAI,OAAO,OAAO,0CAA0C;AAAA,EACvE;AAEA,QAAM,QAAsC,CAAC;AAC7C,MAAI,WAAW,MAAO,OAAM,OAAO,WAAW;AAC9C,MAAI,SAAS,MAAO,OAAM,OAAO,SAAS;AAC1C,SAAO,EAAE,IAAI,MAAM,MAAM;AAC3B;",
+  "names": []
+}