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

package/dist/modules/workflows/lib/parallel-handler.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../src/modules/workflows/lib/parallel-handler.ts"],
-  "sourcesContent": ["/**\n * Workflows Module - Parallel Fork / Join Handler\n *\n * Implements PARALLEL_FORK / PARALLEL_JOIN execution with a multi-token model:\n *\n *  - `openFork` turns a PARALLEL_FORK step into N persistent branch tokens\n *    (`WorkflowBranchInstance`), one per outgoing `auto` transition, and puts the\n *    instance into the dormant `FORKED` state.\n *  - `advanceBranches` runs the interleaved loop: while the instance is FORKED it\n *    advances each ACTIVE branch one step at a time (BPMN semantics \u2014 single lock,\n *    no thread-level concurrency). A branch pauses independently (USER_TASK /\n *    signal / timer / async activity) without blocking siblings.\n *  - When every branch has reached its JOIN (wait-all), `fireJoin` merges the\n *    branch namespaces back into `instance.context`, applies optional\n *    `outputMapping`, and resumes the root token at the step after the JOIN.\n *  - A failed branch cancels its siblings and fails the whole instance.\n *\n * All work happens under the executor's pessimistic instance lock + transaction,\n * so wait-all counting and JOIN firing are race-free.\n */\n\nimport { EntityManager, LockMode } from '@mikro-orm/core'\nimport type { AwilixContainer } from 'awilix'\nimport {\n  WorkflowInstance,\n  WorkflowBranchInstance,\n  WorkflowDefinition,\n  StepInstance,\n  UserTask,\n  WorkflowEvent,\n} from '../data/entities'\nimport { logWorkflowEvent } from './event-logger'\nimport * as stepHandler from './step-handler'\nimport { branchToken } from './execution-token'\n\nexport interface AdvanceBranchesResult {\n  outcome: 'joined' | 'waiting' | 'failed'\n  error?: string\n}\n\nexport interface ResumeBranchOptions {\n  instanceId: string\n  branchInstanceId: string\n  tenantId: string\n  organizationId: string\n  /** Values merged into the branch's private namespace before resuming (task form data, signal payload, \u2026). */\n  contextMerge?: Record<string, any>\n  /** Step instance to exit (the paused step's instance) before the branch advances past it. */\n  exitStepInstanceId?: string | null\n  exitOutput?: any\n}\n\n/**\n * Resume a single paused/waiting branch: optionally merge data into its\n * namespace, exit its paused step instance, and mark it ACTIVE. The caller then\n * re-enters `executeWorkflow` (FORKED mode) so the interleaved loop advances the\n * branch and, if it is the last to arrive, fires the JOIN.\n *\n * Idempotent: a re-delivered signal/timer/task on an already-ACTIVE or terminal\n * branch is a no-op. Returns false when there is nothing to resume.\n */\nexport async function resumeBranch(\n  em: EntityManager,\n  options: ResumeBranchOptions,\n): Promise<boolean> {\n  const branch = await em.findOne(WorkflowBranchInstance, {\n    id: options.branchInstanceId,\n    workflowInstanceId: options.instanceId,\n    tenantId: options.tenantId,\n    organizationId: options.organizationId,\n  })\n\n  if (!branch) return false\n  if (branch.status !== 'PAUSED' && branch.status !== 'WAITING_FOR_ACTIVITIES') {\n    // Already active or terminal \u2014 re-delivery; nothing to do.\n    return false\n  }\n\n  const now = new Date()\n  if (options.contextMerge) {\n    branch.contextNamespace = { ...(branch.contextNamespace || {}), ...options.contextMerge }\n  }\n\n  if (options.exitStepInstanceId) {\n    const stepInstance = await em.findOne(StepInstance, {\n      id: options.exitStepInstanceId,\n      workflowInstanceId: options.instanceId,\n      status: 'ACTIVE',\n    })\n    if (stepInstance) {\n      await stepHandler.exitStep(em, stepInstance, options.exitOutput)\n    }\n  }\n\n  branch.status = 'ACTIVE'\n  branch.pendingTransition = null\n  branch.updatedAt = now\n  await em.flush()\n\n  return true\n}\n\ninterface ParallelContext {\n  userId?: string\n}\n\nfunction normalizeWorkflowUserId(value: unknown): string | null {\n  if (typeof value !== 'string') return null\n  const trimmed = value.trim()\n  if (!trimmed || trimmed.startsWith('trigger:')) return null\n  return trimmed\n}\n\nfunction getNestedValue(obj: any, path: string): any {\n  return path.split('.').reduce((current, key) => (current == null ? undefined : current[key]), obj)\n}\n\n/**\n * Open a PARALLEL_FORK: create one ACTIVE branch per outgoing `auto` transition\n * and mark the instance FORKED. Branch tokens start positioned ON the fork step\n * so the interleaved loop runs each branch's fork transition (and its\n * activities) in that branch's own context.\n */\nexport async function openFork(\n  em: EntityManager,\n  instance: WorkflowInstance,\n  definition: WorkflowDefinition,\n  forkStepDef: any,\n): Promise<void> {\n  const forkStepId: string = forkStepDef.stepId\n  const joinStepId: string | undefined = forkStepDef.config?.joinStepId\n  if (!joinStepId) {\n    throw new Error(`[internal] PARALLEL_FORK \"${forkStepId}\" missing config.joinStepId`)\n  }\n\n  const outgoing = (definition.definition.transitions || []).filter(\n    (transition: any) => transition.fromStepId === forkStepId && transition.trigger === 'auto',\n  )\n\n  const now = new Date()\n  const branchKeys: string[] = []\n  for (const transition of outgoing) {\n    branchKeys.push(transition.transitionId)\n    const branch = em.create(WorkflowBranchInstance, {\n      workflowInstanceId: instance.id,\n      forkStepId,\n      joinStepId,\n      branchKey: transition.transitionId,\n      parentBranchId: null,\n      // Start ON the fork; advanceBranches runs the branch_key transition first.\n      currentStepId: forkStepId,\n      status: 'ACTIVE',\n      contextNamespace: {},\n      tenantId: instance.tenantId,\n      organizationId: instance.organizationId,\n      startedAt: now,\n      createdAt: now,\n      updatedAt: now,\n    })\n    em.persist(branch)\n  }\n\n  instance.status = 'FORKED'\n  instance.activeForkStepId = forkStepId\n  instance.updatedAt = now\n  await em.flush()\n\n  await logWorkflowEvent(em, {\n    workflowInstanceId: instance.id,\n    eventType: 'PARALLEL_FORK_OPENED',\n    eventData: { forkStepId, joinStepId, branchKeys },\n    tenantId: instance.tenantId,\n    organizationId: instance.organizationId,\n  })\n}\n\n/**\n * Resume a branch that was WAITING_FOR_ACTIVITIES after its async activities\n * finished. Mirrors the instance-level resume but scoped to the branch:\n * merges completed-activity outputs into the branch namespace, advances the\n * branch's pending transition target, and marks it ACTIVE (or FAILED if any\n * async activity failed). The caller re-enters the interleaved loop.\n */\nexport async function resumeBranchAfterActivities(\n  em: EntityManager,\n  container: AwilixContainer,\n  instanceId: string,\n  branchInstanceId: string,\n): Promise<{ continueExecution: boolean }> {\n  const branch = await em.findOne(\n    WorkflowBranchInstance,\n    { id: branchInstanceId, workflowInstanceId: instanceId },\n    { lockMode: LockMode.PESSIMISTIC_WRITE },\n  )\n  if (!branch) {\n    throw new Error('[internal] Branch not found during async resume')\n  }\n  if (branch.status !== 'WAITING_FOR_ACTIVITIES') {\n    // Re-delivery or already advanced \u2014 nothing to do.\n    return { continueExecution: false }\n  }\n\n  const namespace = branch.contextNamespace || {}\n  const pendingJobIds = (namespace._pendingAsyncActivities as any[]) || []\n\n  const completedEvents = await em.find(WorkflowEvent, {\n    workflowInstanceId: instanceId,\n    branchInstanceId,\n    eventType: 'ACTIVITY_COMPLETED',\n    eventData: { async: true },\n  })\n  const failedCount = await em.count(WorkflowEvent, {\n    workflowInstanceId: instanceId,\n    branchInstanceId,\n    eventType: 'ACTIVITY_FAILED',\n    eventData: { async: true },\n  })\n\n  if (completedEvents.length + failedCount < pendingJobIds.length) {\n    // Still waiting on other branch activities.\n    return { continueExecution: false }\n  }\n\n  const now = new Date()\n  if (failedCount > 0) {\n    branch.status = 'FAILED'\n    branch.errorMessage = `${failedCount} async activities failed in branch \"${branch.branchKey}\"`\n    branch.updatedAt = now\n    await em.flush()\n    // The interleaved loop will observe the FAILED branch and cancel siblings.\n    return { continueExecution: true }\n  }\n\n  const mergedNamespace: Record<string, any> = { ...namespace }\n  for (const event of completedEvents) {\n    if (event.eventData?.output) {\n      mergedNamespace[`${event.eventData.activityId}_result`] = event.eventData.output\n    }\n  }\n  delete mergedNamespace._pendingAsyncActivities\n  branch.contextNamespace = mergedNamespace\n\n  const pending = branch.pendingTransition\n  branch.pendingTransition = null\n  branch.status = 'ACTIVE'\n  branch.updatedAt = now\n  await em.flush()\n\n  // Execute the destination step in branch context (mirrors the instance-level\n  // resume) so the branch cursor lands on an executed step. The step may pause\n  // the branch again (e.g. a following USER_TASK); that is handled by the loop.\n  if (pending) {\n    const instance = await em.findOne(WorkflowInstance, { id: instanceId })\n    if (instance) {\n      branch.currentStepId = pending.toStepId\n      await em.flush()\n      await stepHandler.executeStep(\n        em,\n        instance,\n        pending.toStepId,\n        {\n          workflowContext: { ...(instance.context || {}), ...(branch.contextNamespace || {}) },\n          userId: normalizeWorkflowUserId(instance.metadata?.initiatedBy) ?? undefined,\n        },\n        container,\n        branch,\n      )\n    }\n  }\n\n  return { continueExecution: true }\n}\n\n/**\n * Interleaved branch execution loop. Advances ACTIVE branches one step at a\n * time until either all branches reach the JOIN (\u2192 fireJoin \u2192 'joined'), a\n * branch fails (\u2192 cancel siblings + 'failed'), or no branch is ACTIVE because\n * they are all waiting on external resume (\u2192 'waiting').\n */\nexport async function advanceBranches(\n  em: EntityManager,\n  container: AwilixContainer,\n  instance: WorkflowInstance,\n  definition: WorkflowDefinition,\n  context: ParallelContext,\n): Promise<AdvanceBranchesResult> {\n  const forkStepId = instance.activeForkStepId\n  if (!forkStepId) {\n    throw new Error('[internal] advanceBranches called but instance has no active fork')\n  }\n\n  // Branch-aware iteration budget: each branch gets the same per-token budget as\n  // the single-token loop, so fan-out alone never trips the guard.\n  const allBranchesForBudget = await em.find(WorkflowBranchInstance, {\n    workflowInstanceId: instance.id,\n    forkStepId,\n  })\n  const maxIterations = Math.max(1, allBranchesForBudget.length) * 100\n  let iterations = 0\n\n  while (iterations < maxIterations) {\n    iterations++\n\n    const branches = await em.find(WorkflowBranchInstance, {\n      workflowInstanceId: instance.id,\n      forkStepId,\n    })\n\n    const active = branches.filter((b) => b.status === 'ACTIVE')\n\n    if (active.length === 0) {\n      const failed = branches.find((b) => b.status === 'FAILED')\n      if (failed) {\n        // A branch failed out-of-band (e.g. async-activity resume marked it\n        // FAILED); cancel any non-terminal siblings before failing the instance.\n        await cancelSiblings(em, instance, failed)\n        return { outcome: 'failed', error: failed.errorMessage || 'Branch failed' }\n      }\n      if (branches.every((b) => b.status === 'COMPLETED')) {\n        await fireJoin(em, instance, definition, branches, forkStepId)\n        return { outcome: 'joined' }\n      }\n      // Some branches paused/waiting for external resume \u2014 instance idles.\n      return { outcome: 'waiting' }\n    }\n\n    for (const branch of active) {\n      const result = await advanceOneBranch(em, container, instance, definition, branch, context)\n      if (result === 'failed') {\n        await cancelSiblings(em, instance, branch)\n        return { outcome: 'failed', error: branch.errorMessage || 'Branch failed' }\n      }\n    }\n  }\n\n  throw new Error('[internal] Maximum branch execution iterations reached - possible infinite loop')\n}\n\n/**\n * Advance a single ACTIVE branch by one step. Returns 'failed' if the branch\n * failed; otherwise mutates branch state (advanced / completed@join / paused).\n */\nasync function advanceOneBranch(\n  em: EntityManager,\n  container: AwilixContainer,\n  instance: WorkflowInstance,\n  definition: WorkflowDefinition,\n  branch: WorkflowBranchInstance,\n  context: ParallelContext,\n): Promise<'advanced' | 'failed'> {\n  // Already at the join \u2192 synchronize (mark completed, do not execute the join).\n  if (branch.currentStepId === branch.joinStepId) {\n    await completeBranchAtJoin(em, instance, branch)\n    return 'advanced'\n  }\n\n  const transitionHandler = await import('./transition-handler')\n\n  const token = branchToken(instance, branch)\n  // Token read context = instance snapshot overlaid with branch namespace.\n  const readContext = { ...(instance.context || {}), ...(branch.contextNamespace || {}) }\n  const evalContext = { workflowContext: readContext, userId: context.userId }\n\n  // Select the transition to take. Branches positioned on the fork follow their\n  // own branch_key transition; otherwise pick the highest-priority valid auto one.\n  let selected: any | null = null\n  if (branch.currentStepId === branch.forkStepId) {\n    selected = (definition.definition.transitions || []).find(\n      (transition: any) => transition.transitionId === branch.branchKey,\n    ) || null\n  } else {\n    const valid = await transitionHandler.findValidTransitions(\n      em,\n      instance,\n      branch.currentStepId,\n      evalContext,\n    )\n    const validAuto = valid.filter((vt) => vt.isValid && vt.transition?.trigger === 'auto')\n    selected = validAuto.length > 0 ? validAuto[0].transition : null\n  }\n\n  if (!selected) {\n    // No outgoing transition and not at the join \u2192 the branch is stuck.\n    await failBranch(em, instance, branch, `Branch \"${branch.branchKey}\" has no valid transition from \"${branch.currentStepId}\"`)\n    return 'failed'\n  }\n\n  try {\n    const transitionResult = await transitionHandler.executeTransitionForToken(\n      em,\n      container,\n      token,\n      selected.fromStepId,\n      selected.toStepId,\n      evalContext,\n    )\n\n    if (!transitionResult.success) {\n      await failBranch(em, instance, branch, transitionResult.error || 'Branch transition failed')\n      return 'failed'\n    }\n\n    // executeTransitionForToken set branch.currentStepId = toStepId. If that is\n    // the join, synchronize now (the join step itself is a no-op).\n    if (branch.currentStepId === branch.joinStepId) {\n      await completeBranchAtJoin(em, instance, branch)\n    }\n    return 'advanced'\n  } catch (error) {\n    const message = error instanceof Error ? error.message : String(error)\n    await failBranch(em, instance, branch, message)\n    return 'failed'\n  }\n}\n\nasync function completeBranchAtJoin(\n  em: EntityManager,\n  instance: WorkflowInstance,\n  branch: WorkflowBranchInstance,\n): Promise<void> {\n  const now = new Date()\n  branch.status = 'COMPLETED'\n  branch.completedAt = now\n  branch.updatedAt = now\n  await em.flush()\n\n  await logWorkflowEvent(em, {\n    workflowInstanceId: instance.id,\n    branchInstanceId: branch.id,\n    eventType: 'PARALLEL_BRANCH_COMPLETED',\n    eventData: { branchKey: branch.branchKey, joinStepId: branch.joinStepId },\n    tenantId: instance.tenantId,\n    organizationId: instance.organizationId,\n  })\n}\n\nasync function failBranch(\n  em: EntityManager,\n  instance: WorkflowInstance,\n  branch: WorkflowBranchInstance,\n  message: string,\n): Promise<void> {\n  const now = new Date()\n  branch.status = 'FAILED'\n  branch.errorMessage = message\n  branch.updatedAt = now\n  await em.flush()\n\n  await logWorkflowEvent(em, {\n    workflowInstanceId: instance.id,\n    branchInstanceId: branch.id,\n    eventType: 'PARALLEL_BRANCH_FAILED',\n    eventData: { branchKey: branch.branchKey, error: message },\n    tenantId: instance.tenantId,\n    organizationId: instance.organizationId,\n  })\n}\n\n/**\n * Cancel sibling branches of a failed branch (best-effort), cancel their open\n * user tasks, and log a cancellation event per branch.\n */\nasync function cancelSiblings(\n  em: EntityManager,\n  instance: WorkflowInstance,\n  failedBranch: WorkflowBranchInstance,\n): Promise<void> {\n  const siblings = await em.find(WorkflowBranchInstance, {\n    workflowInstanceId: instance.id,\n    forkStepId: failedBranch.forkStepId,\n  })\n\n  const now = new Date()\n  for (const sibling of siblings) {\n    if (sibling.id === failedBranch.id) continue\n    if (sibling.status === 'ACTIVE' || sibling.status === 'PAUSED' || sibling.status === 'WAITING_FOR_ACTIVITIES') {\n      sibling.status = 'CANCELLED'\n      sibling.updatedAt = now\n\n      // Best-effort: cancel the branch's open user tasks.\n      const openTasks = await em.find(UserTask, {\n        workflowInstanceId: instance.id,\n        branchInstanceId: sibling.id,\n        status: 'PENDING',\n      })\n      for (const task of openTasks) {\n        task.status = 'CANCELLED'\n        task.updatedAt = now\n      }\n\n      await em.flush()\n\n      await logWorkflowEvent(em, {\n        workflowInstanceId: instance.id,\n        branchInstanceId: sibling.id,\n        eventType: 'PARALLEL_BRANCH_CANCELLED',\n        eventData: { branchKey: sibling.branchKey, reason: 'sibling-failed' },\n        tenantId: instance.tenantId,\n        organizationId: instance.organizationId,\n      })\n    }\n  }\n\n  await logWorkflowEvent(em, {\n    workflowInstanceId: instance.id,\n    eventType: 'PARALLEL_FORK_FAILED',\n    eventData: { forkStepId: failedBranch.forkStepId, failedBranchKey: failedBranch.branchKey },\n    tenantId: instance.tenantId,\n    organizationId: instance.organizationId,\n  })\n}\n\n/**\n * Fire the JOIN once all branches are COMPLETED: merge each branch namespace\n * under `instance.context.branches[branchKey]`, apply optional outputMapping to\n * lift selected values to the top level, then resume the root token at the step\n * after the JOIN.\n */\nasync function fireJoin(\n  em: EntityManager,\n  instance: WorkflowInstance,\n  definition: WorkflowDefinition,\n  branches: WorkflowBranchInstance[],\n  forkStepId: string,\n): Promise<void> {\n  const joinStepId = branches[0]?.joinStepId\n  if (!joinStepId) {\n    throw new Error('[internal] fireJoin called without a join step id')\n  }\n\n  const joinStep = definition.definition.steps.find((s: any) => s.stepId === joinStepId)\n\n  // Deterministic merge \u2014 no silent collisions: each branch keeps its own slot.\n  const branchesContext: Record<string, any> = { ...(instance.context?.branches || {}) }\n  const mergedBranchKeys: string[] = []\n  for (const branch of branches) {\n    branchesContext[branch.branchKey] = branch.contextNamespace || {}\n    mergedBranchKeys.push(branch.branchKey)\n  }\n\n  let nextContext: Record<string, any> = {\n    ...(instance.context || {}),\n    branches: branchesContext,\n  }\n\n  // Optional outputMapping: topLevelKey -> 'branches.<branchKey>.<path>'. The\n  // reserved `branches` slot map is never overwritten \u2014 guard it explicitly so a\n  // mapping cannot clobber the per-branch namespaces.\n  const outputMapping: Record<string, string> | undefined = joinStep?.config?.outputMapping\n  if (outputMapping) {\n    for (const [topKey, sourcePath] of Object.entries(outputMapping)) {\n      if (topKey === 'branches') continue\n      const value = getNestedValue(nextContext, sourcePath)\n      if (value !== undefined) nextContext[topKey] = value\n    }\n  }\n\n  // Park the root token ON the JOIN step (not its successor) and let the\n  // single-token executor loop run the JOIN's outgoing transition. Jumping\n  // straight to the post-join step would bypass stepHandler.executeStep() for\n  // that step \u2014 so a following USER_TASK / WAIT_FOR_TIMER / WAIT_FOR_SIGNAL would\n  // never have its task created / timer enqueued / signal wait registered (the\n  // instance would hang), and any activities on the JOIN's outgoing transition\n  // would be skipped. The JOIN step itself is a no-op, so the loop simply runs\n  // its outgoing transition through the normal step-entry path.\n  const afterJoinStepId = (definition.definition.transitions || []).find(\n    (transition: any) => transition.fromStepId === joinStepId,\n  )?.toStepId ?? null\n\n  const now = new Date()\n  instance.context = nextContext\n  instance.status = 'RUNNING'\n  instance.activeForkStepId = null\n  instance.currentStepId = joinStepId\n  instance.updatedAt = now\n  await em.flush()\n\n  await logWorkflowEvent(em, {\n    workflowInstanceId: instance.id,\n    eventType: 'PARALLEL_JOIN_COMPLETED',\n    eventData: { forkStepId, joinStepId, mergedBranchKeys, afterJoinStepId },\n    tenantId: instance.tenantId,\n    organizationId: instance.organizationId,\n  })\n}\n"],
-  "mappings": "AAqBA,SAAwB,gBAAgB;AAExC;AAAA,EACE;AAAA,EACA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,wBAAwB;AACjC,YAAY,iBAAiB;AAC7B,SAAS,mBAAmB;AA4B5B,eAAsB,aACpB,IACA,SACkB;AAClB,QAAM,SAAS,MAAM,GAAG,QAAQ,wBAAwB;AAAA,IACtD,IAAI,QAAQ;AAAA,IACZ,oBAAoB,QAAQ;AAAA,IAC5B,UAAU,QAAQ;AAAA,IAClB,gBAAgB,QAAQ;AAAA,EAC1B,CAAC;AAED,MAAI,CAAC,OAAQ,QAAO;AACpB,MAAI,OAAO,WAAW,YAAY,OAAO,WAAW,0BAA0B;AAE5E,WAAO;AAAA,EACT;AAEA,QAAM,MAAM,oBAAI,KAAK;AACrB,MAAI,QAAQ,cAAc;AACxB,WAAO,mBAAmB,EAAE,GAAI,OAAO,oBAAoB,CAAC,GAAI,GAAG,QAAQ,aAAa;AAAA,EAC1F;AAEA,MAAI,QAAQ,oBAAoB;AAC9B,UAAM,eAAe,MAAM,GAAG,QAAQ,cAAc;AAAA,MAClD,IAAI,QAAQ;AAAA,MACZ,oBAAoB,QAAQ;AAAA,MAC5B,QAAQ;AAAA,IACV,CAAC;AACD,QAAI,cAAc;AAChB,YAAM,YAAY,SAAS,IAAI,cAAc,QAAQ,UAAU;AAAA,IACjE;AAAA,EACF;AAEA,SAAO,SAAS;AAChB,SAAO,oBAAoB;AAC3B,SAAO,YAAY;AACnB,QAAM,GAAG,MAAM;AAEf,SAAO;AACT;AAMA,SAAS,wBAAwB,OAA+B;AAC9D,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,CAAC,WAAW,QAAQ,WAAW,UAAU,EAAG,QAAO;AACvD,SAAO;AACT;AAEA,SAAS,eAAe,KAAU,MAAmB;AACnD,SAAO,KAAK,MAAM,GAAG,EAAE,OAAO,CAAC,SAAS,QAAS,WAAW,OAAO,SAAY,QAAQ,GAAG,GAAI,GAAG;AACnG;AAQA,eAAsB,SACpB,IACA,UACA,YACA,aACe;AACf,QAAM,aAAqB,YAAY;AACvC,QAAM,aAAiC,YAAY,QAAQ;AAC3D,MAAI,CAAC,YAAY;AACf,UAAM,IAAI,MAAM,6BAA6B,UAAU,6BAA6B;AAAA,EACtF;AAEA,QAAM,YAAY,WAAW,WAAW,eAAe,CAAC,GAAG;AAAA,IACzD,CAAC,eAAoB,WAAW,eAAe,cAAc,WAAW,YAAY;AAAA,EACtF;AAEA,QAAM,MAAM,oBAAI,KAAK;AACrB,QAAM,aAAuB,CAAC;AAC9B,aAAW,cAAc,UAAU;AACjC,eAAW,KAAK,WAAW,YAAY;AACvC,UAAM,SAAS,GAAG,OAAO,wBAAwB;AAAA,MAC/C,oBAAoB,SAAS;AAAA,MAC7B;AAAA,MACA;AAAA,MACA,WAAW,WAAW;AAAA,MACtB,gBAAgB;AAAA;AAAA,MAEhB,eAAe;AAAA,MACf,QAAQ;AAAA,MACR,kBAAkB,CAAC;AAAA,MACnB,UAAU,SAAS;AAAA,MACnB,gBAAgB,SAAS;AAAA,MACzB,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,IACb,CAAC;AACD,OAAG,QAAQ,MAAM;AAAA,EACnB;AAEA,WAAS,SAAS;AAClB,WAAS,mBAAmB;AAC5B,WAAS,YAAY;AACrB,QAAM,GAAG,MAAM;AAEf,QAAM,iBAAiB,IAAI;AAAA,IACzB,oBAAoB,SAAS;AAAA,IAC7B,WAAW;AAAA,IACX,WAAW,EAAE,YAAY,YAAY,WAAW;AAAA,IAChD,UAAU,SAAS;AAAA,IACnB,gBAAgB,SAAS;AAAA,EAC3B,CAAC;AACH;AASA,eAAsB,4BACpB,IACA,WACA,YACA,kBACyC;AACzC,QAAM,SAAS,MAAM,GAAG;AAAA,IACtB;AAAA,IACA,EAAE,IAAI,kBAAkB,oBAAoB,WAAW;AAAA,IACvD,EAAE,UAAU,SAAS,kBAAkB;AAAA,EACzC;AACA,MAAI,CAAC,QAAQ;AACX,UAAM,IAAI,MAAM,iDAAiD;AAAA,EACnE;AACA,MAAI,OAAO,WAAW,0BAA0B;AAE9C,WAAO,EAAE,mBAAmB,MAAM;AAAA,EACpC;AAEA,QAAM,YAAY,OAAO,oBAAoB,CAAC;AAC9C,QAAM,gBAAiB,UAAU,2BAAqC,CAAC;AAEvE,QAAM,kBAAkB,MAAM,GAAG,KAAK,eAAe;AAAA,IACnD,oBAAoB;AAAA,IACpB;AAAA,IACA,WAAW;AAAA,IACX,WAAW,EAAE,OAAO,KAAK;AAAA,EAC3B,CAAC;AACD,QAAM,cAAc,MAAM,GAAG,MAAM,eAAe;AAAA,IAChD,oBAAoB;AAAA,IACpB;AAAA,IACA,WAAW;AAAA,IACX,WAAW,EAAE,OAAO,KAAK;AAAA,EAC3B,CAAC;AAED,MAAI,gBAAgB,SAAS,cAAc,cAAc,QAAQ;AAE/D,WAAO,EAAE,mBAAmB,MAAM;AAAA,EACpC;AAEA,QAAM,MAAM,oBAAI,KAAK;AACrB,MAAI,cAAc,GAAG;AACnB,WAAO,SAAS;AAChB,WAAO,eAAe,GAAG,WAAW,uCAAuC,OAAO,SAAS;AAC3F,WAAO,YAAY;AACnB,UAAM,GAAG,MAAM;AAEf,WAAO,EAAE,mBAAmB,KAAK;AAAA,EACnC;AAEA,QAAM,kBAAuC,EAAE,GAAG,UAAU;AAC5D,aAAW,SAAS,iBAAiB;AACnC,QAAI,MAAM,WAAW,QAAQ;AAC3B,sBAAgB,GAAG,MAAM,UAAU,UAAU,SAAS,IAAI,MAAM,UAAU;AAAA,IAC5E;AAAA,EACF;AACA,SAAO,gBAAgB;AACvB,SAAO,mBAAmB;AAE1B,QAAM,UAAU,OAAO;AACvB,SAAO,oBAAoB;AAC3B,SAAO,SAAS;AAChB,SAAO,YAAY;AACnB,QAAM,GAAG,MAAM;AAKf,MAAI,SAAS;AACX,UAAM,WAAW,MAAM,GAAG,QAAQ,kBAAkB,EAAE,IAAI,WAAW,CAAC;AACtE,QAAI,UAAU;AACZ,aAAO,gBAAgB,QAAQ;AAC/B,YAAM,GAAG,MAAM;AACf,YAAM,YAAY;AAAA,QAChB;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,QACR;AAAA,UACE,iBAAiB,EAAE,GAAI,SAAS,WAAW,CAAC,GAAI,GAAI,OAAO,oBAAoB,CAAC,EAAG;AAAA,UACnF,QAAQ,wBAAwB,SAAS,UAAU,WAAW,KAAK;AAAA,QACrE;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,mBAAmB,KAAK;AACnC;AAQA,eAAsB,gBACpB,IACA,WACA,UACA,YACA,SACgC;AAChC,QAAM,aAAa,SAAS;AAC5B,MAAI,CAAC,YAAY;AACf,UAAM,IAAI,MAAM,mEAAmE;AAAA,EACrF;AAIA,QAAM,uBAAuB,MAAM,GAAG,KAAK,wBAAwB;AAAA,IACjE,oBAAoB,SAAS;AAAA,IAC7B;AAAA,EACF,CAAC;AACD,QAAM,gBAAgB,KAAK,IAAI,GAAG,qBAAqB,MAAM,IAAI;AACjE,MAAI,aAAa;AAEjB,SAAO,aAAa,eAAe;AACjC;AAEA,UAAM,WAAW,MAAM,GAAG,KAAK,wBAAwB;AAAA,MACrD,oBAAoB,SAAS;AAAA,MAC7B;AAAA,IACF,CAAC;AAED,UAAM,SAAS,SAAS,OAAO,CAAC,MAAM,EAAE,WAAW,QAAQ;AAE3D,QAAI,OAAO,WAAW,GAAG;AACvB,YAAM,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,WAAW,QAAQ;AACzD,UAAI,QAAQ;AAGV,cAAM,eAAe,IAAI,UAAU,MAAM;AACzC,eAAO,EAAE,SAAS,UAAU,OAAO,OAAO,gBAAgB,gBAAgB;AAAA,MAC5E;AACA,UAAI,SAAS,MAAM,CAAC,MAAM,EAAE,WAAW,WAAW,GAAG;AACnD,cAAM,SAAS,IAAI,UAAU,YAAY,UAAU,UAAU;AAC7D,eAAO,EAAE,SAAS,SAAS;AAAA,MAC7B;AAEA,aAAO,EAAE,SAAS,UAAU;AAAA,IAC9B;AAEA,eAAW,UAAU,QAAQ;AAC3B,YAAM,SAAS,MAAM,iBAAiB,IAAI,WAAW,UAAU,YAAY,QAAQ,OAAO;AAC1F,UAAI,WAAW,UAAU;AACvB,cAAM,eAAe,IAAI,UAAU,MAAM;AACzC,eAAO,EAAE,SAAS,UAAU,OAAO,OAAO,gBAAgB,gBAAgB;AAAA,MAC5E;AAAA,IACF;AAAA,EACF;AAEA,QAAM,IAAI,MAAM,iFAAiF;AACnG;AAMA,eAAe,iBACb,IACA,WACA,UACA,YACA,QACA,SACgC;AAEhC,MAAI,OAAO,kBAAkB,OAAO,YAAY;AAC9C,UAAM,qBAAqB,IAAI,UAAU,MAAM;AAC/C,WAAO;AAAA,EACT;AAEA,QAAM,oBAAoB,MAAM,OAAO,sBAAsB;AAE7D,QAAM,QAAQ,YAAY,UAAU,MAAM;AAE1C,QAAM,cAAc,EAAE,GAAI,SAAS,WAAW,CAAC,GAAI,GAAI,OAAO,oBAAoB,CAAC,EAAG;AACtF,QAAM,cAAc,EAAE,iBAAiB,aAAa,QAAQ,QAAQ,OAAO;AAI3E,MAAI,WAAuB;AAC3B,MAAI,OAAO,kBAAkB,OAAO,YAAY;AAC9C,gBAAY,WAAW,WAAW,eAAe,CAAC,GAAG;AAAA,MACnD,CAAC,eAAoB,WAAW,iBAAiB,OAAO;AAAA,IAC1D,KAAK;AAAA,EACP,OAAO;AACL,UAAM,QAAQ,MAAM,kBAAkB;AAAA,MACpC;AAAA,MACA;AAAA,MACA,OAAO;AAAA,MACP;AAAA,IACF;AACA,UAAM,YAAY,MAAM,OAAO,CAAC,OAAO,GAAG,WAAW,GAAG,YAAY,YAAY,MAAM;AACtF,eAAW,UAAU,SAAS,IAAI,UAAU,CAAC,EAAE,aAAa;AAAA,EAC9D;AAEA,MAAI,CAAC,UAAU;AAEb,UAAM,WAAW,IAAI,UAAU,QAAQ,WAAW,OAAO,SAAS,mCAAmC,OAAO,aAAa,GAAG;AAC5H,WAAO;AAAA,EACT;AAEA,MAAI;AACF,UAAM,mBAAmB,MAAM,kBAAkB;AAAA,MAC/C;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS;AAAA,MACT,SAAS;AAAA,MACT;AAAA,IACF;AAEA,QAAI,CAAC,iBAAiB,SAAS;AAC7B,YAAM,WAAW,IAAI,UAAU,QAAQ,iBAAiB,SAAS,0BAA0B;AAC3F,aAAO;AAAA,IACT;AAIA,QAAI,OAAO,kBAAkB,OAAO,YAAY;AAC9C,YAAM,qBAAqB,IAAI,UAAU,MAAM;AAAA,IACjD;AACA,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACrE,UAAM,WAAW,IAAI,UAAU,QAAQ,OAAO;AAC9C,WAAO;AAAA,EACT;AACF;AAEA,eAAe,qBACb,IACA,UACA,QACe;AACf,QAAM,MAAM,oBAAI,KAAK;AACrB,SAAO,SAAS;AAChB,SAAO,cAAc;AACrB,SAAO,YAAY;AACnB,QAAM,GAAG,MAAM;AAEf,QAAM,iBAAiB,IAAI;AAAA,IACzB,oBAAoB,SAAS;AAAA,IAC7B,kBAAkB,OAAO;AAAA,IACzB,WAAW;AAAA,IACX,WAAW,EAAE,WAAW,OAAO,WAAW,YAAY,OAAO,WAAW;AAAA,IACxE,UAAU,SAAS;AAAA,IACnB,gBAAgB,SAAS;AAAA,EAC3B,CAAC;AACH;AAEA,eAAe,WACb,IACA,UACA,QACA,SACe;AACf,QAAM,MAAM,oBAAI,KAAK;AACrB,SAAO,SAAS;AAChB,SAAO,eAAe;AACtB,SAAO,YAAY;AACnB,QAAM,GAAG,MAAM;AAEf,QAAM,iBAAiB,IAAI;AAAA,IACzB,oBAAoB,SAAS;AAAA,IAC7B,kBAAkB,OAAO;AAAA,IACzB,WAAW;AAAA,IACX,WAAW,EAAE,WAAW,OAAO,WAAW,OAAO,QAAQ;AAAA,IACzD,UAAU,SAAS;AAAA,IACnB,gBAAgB,SAAS;AAAA,EAC3B,CAAC;AACH;AAMA,eAAe,eACb,IACA,UACA,cACe;AACf,QAAM,WAAW,MAAM,GAAG,KAAK,wBAAwB;AAAA,IACrD,oBAAoB,SAAS;AAAA,IAC7B,YAAY,aAAa;AAAA,EAC3B,CAAC;AAED,QAAM,MAAM,oBAAI,KAAK;AACrB,aAAW,WAAW,UAAU;AAC9B,QAAI,QAAQ,OAAO,aAAa,GAAI;AACpC,QAAI,QAAQ,WAAW,YAAY,QAAQ,WAAW,YAAY,QAAQ,WAAW,0BAA0B;AAC7G,cAAQ,SAAS;AACjB,cAAQ,YAAY;AAGpB,YAAM,YAAY,MAAM,GAAG,KAAK,UAAU;AAAA,QACxC,oBAAoB,SAAS;AAAA,QAC7B,kBAAkB,QAAQ;AAAA,QAC1B,QAAQ;AAAA,MACV,CAAC;AACD,iBAAW,QAAQ,WAAW;AAC5B,aAAK,SAAS;AACd,aAAK,YAAY;AAAA,MACnB;AAEA,YAAM,GAAG,MAAM;AAEf,YAAM,iBAAiB,IAAI;AAAA,QACzB,oBAAoB,SAAS;AAAA,QAC7B,kBAAkB,QAAQ;AAAA,QAC1B,WAAW;AAAA,QACX,WAAW,EAAE,WAAW,QAAQ,WAAW,QAAQ,iBAAiB;AAAA,QACpE,UAAU,SAAS;AAAA,QACnB,gBAAgB,SAAS;AAAA,MAC3B,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,iBAAiB,IAAI;AAAA,IACzB,oBAAoB,SAAS;AAAA,IAC7B,WAAW;AAAA,IACX,WAAW,EAAE,YAAY,aAAa,YAAY,iBAAiB,aAAa,UAAU;AAAA,IAC1F,UAAU,SAAS;AAAA,IACnB,gBAAgB,SAAS;AAAA,EAC3B,CAAC;AACH;AAQA,eAAe,SACb,IACA,UACA,YACA,UACA,YACe;AACf,QAAM,aAAa,SAAS,CAAC,GAAG;AAChC,MAAI,CAAC,YAAY;AACf,UAAM,IAAI,MAAM,mDAAmD;AAAA,EACrE;AAEA,QAAM,WAAW,WAAW,WAAW,MAAM,KAAK,CAAC,MAAW,EAAE,WAAW,UAAU;AAGrF,QAAM,kBAAuC,EAAE,GAAI,SAAS,SAAS,YAAY,CAAC,EAAG;AACrF,QAAM,mBAA6B,CAAC;AACpC,aAAW,UAAU,UAAU;AAC7B,oBAAgB,OAAO,SAAS,IAAI,OAAO,oBAAoB,CAAC;AAChE,qBAAiB,KAAK,OAAO,SAAS;AAAA,EACxC;AAEA,MAAI,cAAmC;AAAA,IACrC,GAAI,SAAS,WAAW,CAAC;AAAA,IACzB,UAAU;AAAA,EACZ;AAKA,QAAM,gBAAoD,UAAU,QAAQ;AAC5E,MAAI,eAAe;AACjB,eAAW,CAAC,QAAQ,UAAU,KAAK,OAAO,QAAQ,aAAa,GAAG;AAChE,UAAI,WAAW,WAAY;AAC3B,YAAM,QAAQ,eAAe,aAAa,UAAU;AACpD,UAAI,UAAU,OAAW,aAAY,MAAM,IAAI;AAAA,IACjD;AAAA,EACF;AAUA,QAAM,mBAAmB,WAAW,WAAW,eAAe,CAAC,GAAG;AAAA,IAChE,CAAC,eAAoB,WAAW,eAAe;AAAA,EACjD,GAAG,YAAY;AAEf,QAAM,MAAM,oBAAI,KAAK;AACrB,WAAS,UAAU;AACnB,WAAS,SAAS;AAClB,WAAS,mBAAmB;AAC5B,WAAS,gBAAgB;AACzB,WAAS,YAAY;AACrB,QAAM,GAAG,MAAM;AAEf,QAAM,iBAAiB,IAAI;AAAA,IACzB,oBAAoB,SAAS;AAAA,IAC7B,WAAW;AAAA,IACX,WAAW,EAAE,YAAY,YAAY,kBAAkB,gBAAgB;AAAA,IACvE,UAAU,SAAS;AAAA,IACnB,gBAAgB,SAAS;AAAA,EAC3B,CAAC;AACH;",
+  "sourcesContent": ["/**\n * Workflows Module - Parallel Fork / Join Handler\n *\n * Implements PARALLEL_FORK / PARALLEL_JOIN execution with a multi-token model:\n *\n *  - `openFork` turns a PARALLEL_FORK step into N persistent branch tokens\n *    (`WorkflowBranchInstance`), one per outgoing `auto` transition, and puts the\n *    instance into the dormant `FORKED` state.\n *  - `advanceBranches` runs the interleaved loop: while the instance is FORKED it\n *    advances each ACTIVE branch one step at a time (BPMN semantics \u2014 single lock,\n *    no thread-level concurrency). A branch pauses independently (USER_TASK /\n *    signal / timer / async activity) without blocking siblings.\n *  - When every branch has reached its JOIN (wait-all), `fireJoin` merges the\n *    branch namespaces back into `instance.context`, applies optional\n *    `outputMapping`, and resumes the root token at the step after the JOIN.\n *  - A failed branch cancels its siblings and fails the whole instance.\n *\n * All work happens under the executor's pessimistic instance lock + transaction,\n * so wait-all counting and JOIN firing are race-free.\n */\n\nimport { EntityManager, LockMode } from '@mikro-orm/core'\nimport type { AwilixContainer } from 'awilix'\nimport {\n  WorkflowInstance,\n  WorkflowBranchInstance,\n  WorkflowDefinition,\n  StepInstance,\n  UserTask,\n  WorkflowEvent,\n} from '../data/entities'\nimport { logWorkflowEvent } from './event-logger'\nimport * as stepHandler from './step-handler'\nimport { branchToken, mergeTokenContext, type ExecutionToken } from './execution-token'\nimport { WORKFLOW_ERROR_CONTEXT_KEY, buildErrorContextEntry } from './error-routing'\n\nexport interface AdvanceBranchesResult {\n  outcome: 'joined' | 'waiting' | 'failed'\n  error?: string\n}\n\nexport interface ResumeBranchOptions {\n  instanceId: string\n  branchInstanceId: string\n  tenantId: string\n  organizationId: string\n  /** Values merged into the branch's private namespace before resuming (task form data, signal payload, \u2026). */\n  contextMerge?: Record<string, any>\n  /** Step instance to exit (the paused step's instance) before the branch advances past it. */\n  exitStepInstanceId?: string | null\n  exitOutput?: any\n}\n\n/**\n * Resume a single paused/waiting branch: optionally merge data into its\n * namespace, exit its paused step instance, and mark it ACTIVE. The caller then\n * re-enters `executeWorkflow` (FORKED mode) so the interleaved loop advances the\n * branch and, if it is the last to arrive, fires the JOIN.\n *\n * Idempotent: a re-delivered signal/timer/task on an already-ACTIVE or terminal\n * branch is a no-op. Returns false when there is nothing to resume.\n */\nexport async function resumeBranch(\n  em: EntityManager,\n  options: ResumeBranchOptions,\n): Promise<boolean> {\n  const branch = await em.findOne(WorkflowBranchInstance, {\n    id: options.branchInstanceId,\n    workflowInstanceId: options.instanceId,\n    tenantId: options.tenantId,\n    organizationId: options.organizationId,\n  })\n\n  if (!branch) return false\n  if (branch.status !== 'PAUSED' && branch.status !== 'WAITING_FOR_ACTIVITIES') {\n    // Already active or terminal \u2014 re-delivery; nothing to do.\n    return false\n  }\n\n  const now = new Date()\n  if (options.contextMerge) {\n    branch.contextNamespace = { ...(branch.contextNamespace || {}), ...options.contextMerge }\n  }\n\n  if (options.exitStepInstanceId) {\n    const stepInstance = await em.findOne(StepInstance, {\n      id: options.exitStepInstanceId,\n      workflowInstanceId: options.instanceId,\n      status: 'ACTIVE',\n    })\n    if (stepInstance) {\n      await stepHandler.exitStep(em, stepInstance, options.exitOutput)\n    }\n  }\n\n  branch.status = 'ACTIVE'\n  branch.pendingTransition = null\n  branch.updatedAt = now\n  await em.flush()\n\n  return true\n}\n\ninterface ParallelContext {\n  userId?: string\n}\n\nfunction normalizeWorkflowUserId(value: unknown): string | null {\n  if (typeof value !== 'string') return null\n  const trimmed = value.trim()\n  if (!trimmed || trimmed.startsWith('trigger:')) return null\n  return trimmed\n}\n\nfunction getNestedValue(obj: any, path: string): any {\n  return path.split('.').reduce((current, key) => (current == null ? undefined : current[key]), obj)\n}\n\n/**\n * Open a PARALLEL_FORK: create one ACTIVE branch per outgoing `auto` transition\n * and mark the instance FORKED. Branch tokens start positioned ON the fork step\n * so the interleaved loop runs each branch's fork transition (and its\n * activities) in that branch's own context.\n */\nexport async function openFork(\n  em: EntityManager,\n  instance: WorkflowInstance,\n  definition: WorkflowDefinition,\n  forkStepDef: any,\n): Promise<void> {\n  const forkStepId: string = forkStepDef.stepId\n  const joinStepId: string | undefined = forkStepDef.config?.joinStepId\n  if (!joinStepId) {\n    throw new Error(`[internal] PARALLEL_FORK \"${forkStepId}\" missing config.joinStepId`)\n  }\n\n  const outgoing = (definition.definition.transitions || []).filter(\n    (transition: any) => transition.fromStepId === forkStepId && transition.trigger === 'auto',\n  )\n\n  const now = new Date()\n  const branchKeys: string[] = []\n  for (const transition of outgoing) {\n    branchKeys.push(transition.transitionId)\n    const branch = em.create(WorkflowBranchInstance, {\n      workflowInstanceId: instance.id,\n      forkStepId,\n      joinStepId,\n      branchKey: transition.transitionId,\n      parentBranchId: null,\n      // Start ON the fork; advanceBranches runs the branch_key transition first.\n      currentStepId: forkStepId,\n      status: 'ACTIVE',\n      contextNamespace: {},\n      tenantId: instance.tenantId,\n      organizationId: instance.organizationId,\n      startedAt: now,\n      createdAt: now,\n      updatedAt: now,\n    })\n    em.persist(branch)\n  }\n\n  instance.status = 'FORKED'\n  instance.activeForkStepId = forkStepId\n  instance.updatedAt = now\n  await em.flush()\n\n  await logWorkflowEvent(em, {\n    workflowInstanceId: instance.id,\n    eventType: 'PARALLEL_FORK_OPENED',\n    eventData: { forkStepId, joinStepId, branchKeys },\n    tenantId: instance.tenantId,\n    organizationId: instance.organizationId,\n  })\n}\n\n/**\n * Resume a branch that was WAITING_FOR_ACTIVITIES after its async activities\n * finished. Mirrors the instance-level resume but scoped to the branch:\n * merges completed-activity outputs into the branch namespace, advances the\n * branch's pending transition target, and marks it ACTIVE (or FAILED if any\n * async activity failed). The caller re-enters the interleaved loop.\n */\nexport async function resumeBranchAfterActivities(\n  em: EntityManager,\n  container: AwilixContainer,\n  instanceId: string,\n  branchInstanceId: string,\n): Promise<{ continueExecution: boolean }> {\n  const branch = await em.findOne(\n    WorkflowBranchInstance,\n    { id: branchInstanceId, workflowInstanceId: instanceId },\n    { lockMode: LockMode.PESSIMISTIC_WRITE },\n  )\n  if (!branch) {\n    throw new Error('[internal] Branch not found during async resume')\n  }\n  if (branch.status !== 'WAITING_FOR_ACTIVITIES') {\n    // Re-delivery or already advanced \u2014 nothing to do.\n    return { continueExecution: false }\n  }\n\n  const namespace = branch.contextNamespace || {}\n  const pendingJobIds = (namespace._pendingAsyncActivities as any[]) || []\n\n  const completedEvents = await em.find(WorkflowEvent, {\n    workflowInstanceId: instanceId,\n    branchInstanceId,\n    eventType: 'ACTIVITY_COMPLETED',\n    eventData: { async: true },\n  })\n  const failedCount = await em.count(WorkflowEvent, {\n    workflowInstanceId: instanceId,\n    branchInstanceId,\n    eventType: 'ACTIVITY_FAILED',\n    eventData: { async: true },\n  })\n\n  if (completedEvents.length + failedCount < pendingJobIds.length) {\n    // Still waiting on other branch activities.\n    return { continueExecution: false }\n  }\n\n  const now = new Date()\n  if (failedCount > 0) {\n    branch.status = 'FAILED'\n    branch.errorMessage = `${failedCount} async activities failed in branch \"${branch.branchKey}\"`\n    branch.updatedAt = now\n    await em.flush()\n    // The interleaved loop will observe the FAILED branch and cancel siblings.\n    return { continueExecution: true }\n  }\n\n  const mergedNamespace: Record<string, any> = { ...namespace }\n  for (const event of completedEvents) {\n    if (event.eventData?.output) {\n      mergedNamespace[`${event.eventData.activityId}_result`] = event.eventData.output\n    }\n  }\n  delete mergedNamespace._pendingAsyncActivities\n  branch.contextNamespace = mergedNamespace\n\n  const pending = branch.pendingTransition\n  branch.pendingTransition = null\n  branch.status = 'ACTIVE'\n  branch.updatedAt = now\n  await em.flush()\n\n  // Execute the destination step in branch context (mirrors the instance-level\n  // resume) so the branch cursor lands on an executed step. The step may pause\n  // the branch again (e.g. a following USER_TASK); that is handled by the loop.\n  if (pending) {\n    const instance = await em.findOne(WorkflowInstance, { id: instanceId })\n    if (instance) {\n      branch.currentStepId = pending.toStepId\n      await em.flush()\n      await stepHandler.executeStep(\n        em,\n        instance,\n        pending.toStepId,\n        {\n          workflowContext: { ...(instance.context || {}), ...(branch.contextNamespace || {}) },\n          userId: normalizeWorkflowUserId(instance.metadata?.initiatedBy) ?? undefined,\n        },\n        container,\n        branch,\n      )\n    }\n  }\n\n  return { continueExecution: true }\n}\n\n/**\n * Interleaved branch execution loop. Advances ACTIVE branches one step at a\n * time until either all branches reach the JOIN (\u2192 fireJoin \u2192 'joined'), a\n * branch fails (\u2192 cancel siblings + 'failed'), or no branch is ACTIVE because\n * they are all waiting on external resume (\u2192 'waiting').\n */\nexport async function advanceBranches(\n  em: EntityManager,\n  container: AwilixContainer,\n  instance: WorkflowInstance,\n  definition: WorkflowDefinition,\n  context: ParallelContext,\n): Promise<AdvanceBranchesResult> {\n  const forkStepId = instance.activeForkStepId\n  if (!forkStepId) {\n    throw new Error('[internal] advanceBranches called but instance has no active fork')\n  }\n\n  // Branch-aware iteration budget: each branch gets the same per-token budget as\n  // the single-token loop, so fan-out alone never trips the guard.\n  const allBranchesForBudget = await em.find(WorkflowBranchInstance, {\n    workflowInstanceId: instance.id,\n    forkStepId,\n  })\n  const maxIterations = Math.max(1, allBranchesForBudget.length) * 100\n  let iterations = 0\n\n  while (iterations < maxIterations) {\n    iterations++\n\n    const branches = await em.find(WorkflowBranchInstance, {\n      workflowInstanceId: instance.id,\n      forkStepId,\n    })\n\n    const active = branches.filter((b) => b.status === 'ACTIVE')\n\n    if (active.length === 0) {\n      const failed = branches.find((b) => b.status === 'FAILED')\n      if (failed) {\n        // A branch failed out-of-band (e.g. async-activity resume marked it\n        // FAILED); cancel any non-terminal siblings before failing the instance.\n        await cancelSiblings(em, instance, failed)\n        return { outcome: 'failed', error: failed.errorMessage || 'Branch failed' }\n      }\n      if (branches.every((b) => b.status === 'COMPLETED')) {\n        await fireJoin(em, instance, definition, branches, forkStepId)\n        return { outcome: 'joined' }\n      }\n      // Some branches paused/waiting for external resume \u2014 instance idles.\n      return { outcome: 'waiting' }\n    }\n\n    for (const branch of active) {\n      const result = await advanceOneBranch(em, container, instance, definition, branch, context)\n      if (result === 'failed') {\n        await cancelSiblings(em, instance, branch)\n        return { outcome: 'failed', error: branch.errorMessage || 'Branch failed' }\n      }\n    }\n  }\n\n  throw new Error('[internal] Maximum branch execution iterations reached - possible infinite loop')\n}\n\n/**\n * Advance a single ACTIVE branch by one step. Returns 'failed' if the branch\n * failed; otherwise mutates branch state (advanced / completed@join / paused).\n */\nasync function advanceOneBranch(\n  em: EntityManager,\n  container: AwilixContainer,\n  instance: WorkflowInstance,\n  definition: WorkflowDefinition,\n  branch: WorkflowBranchInstance,\n  context: ParallelContext,\n): Promise<'advanced' | 'failed'> {\n  // Already at the join \u2192 synchronize (mark completed, do not execute the join).\n  if (branch.currentStepId === branch.joinStepId) {\n    await completeBranchAtJoin(em, instance, branch)\n    return 'advanced'\n  }\n\n  const transitionHandler = await import('./transition-handler')\n\n  const token = branchToken(instance, branch)\n  // Token read context = instance snapshot overlaid with branch namespace.\n  const readContext = { ...(instance.context || {}), ...(branch.contextNamespace || {}) }\n  const evalContext = { workflowContext: readContext, userId: context.userId }\n\n  // Select the transition to take. Branches positioned on the fork follow their\n  // own branch_key transition; otherwise pick the highest-priority valid auto one.\n  let selected: any | null = null\n  if (branch.currentStepId === branch.forkStepId) {\n    selected = (definition.definition.transitions || []).find(\n      (transition: any) => transition.transitionId === branch.branchKey,\n    ) || null\n  } else {\n    const valid = await transitionHandler.findValidTransitions(\n      em,\n      instance,\n      branch.currentStepId,\n      evalContext,\n    )\n    const validAuto = valid.filter((vt) => vt.isValid && vt.transition?.trigger === 'auto')\n    selected = validAuto.length > 0 ? validAuto[0].transition : null\n  }\n\n  if (!selected) {\n    // No outgoing transition and not at the join \u2192 the branch is stuck.\n    await failBranch(em, instance, branch, `Branch \"${branch.branchKey}\" has no valid transition from \"${branch.currentStepId}\"`)\n    return 'failed'\n  }\n\n  try {\n    const transitionResult = await transitionHandler.executeTransitionForToken(\n      em,\n      container,\n      token,\n      selected.fromStepId,\n      selected.toStepId,\n      { ...evalContext, transitionId: selected.transitionId },\n    )\n\n    if (!transitionResult.success) {\n      // Error routing (spec 5.9) inside a branch: a wired error route is taken\n      // in the branch itself, so only unhandled failures propagate to the\n      // instance. The failure-queue directive is deliberately instance-level and\n      // is not honored per branch \u2014 such a branch keeps failing as it does today.\n      const routed = await followBranchErrorRoute(\n        em,\n        container,\n        instance,\n        branch,\n        token,\n        transitionResult,\n        evalContext,\n      )\n      if (routed) {\n        if (branch.currentStepId === branch.joinStepId) {\n          await completeBranchAtJoin(em, instance, branch)\n        }\n        return 'advanced'\n      }\n      await failBranch(em, instance, branch, transitionResult.error || 'Branch transition failed')\n      return 'failed'\n    }\n\n    // executeTransitionForToken set branch.currentStepId = toStepId. If that is\n    // the join, synchronize now (the join step itself is a no-op).\n    if (branch.currentStepId === branch.joinStepId) {\n      await completeBranchAtJoin(em, instance, branch)\n    }\n    return 'advanced'\n  } catch (error) {\n    const message = error instanceof Error ? error.message : String(error)\n    await failBranch(em, instance, branch, message)\n    return 'failed'\n  }\n}\n\n/**\n * Follow a branch step's wired error route with the branch token, so the branch\n * keeps its own cursor and context namespace. Returns false when the transition\n * result carries no route or the route could not be taken.\n */\nasync function followBranchErrorRoute(\n  em: EntityManager,\n  container: AwilixContainer,\n  instance: WorkflowInstance,\n  branch: WorkflowBranchInstance,\n  token: ExecutionToken,\n  transitionResult: { failedStepId?: string; errorRoute?: { transitionId?: string; toStepId: string }; error?: string },\n  evalContext: { workflowContext: Record<string, any>; userId?: string },\n): Promise<boolean> {\n  const { failedStepId, errorRoute } = transitionResult\n  if (!failedStepId || !errorRoute) return false\n\n  const error = transitionResult.error || 'Branch transition failed'\n  await logWorkflowEvent(em, {\n    workflowInstanceId: instance.id,\n    branchInstanceId: branch.id,\n    eventType: 'ERROR_ROUTED',\n    eventData: {\n      failedStepId,\n      toStepId: errorRoute.toStepId,\n      transitionId: errorRoute.transitionId,\n      branchKey: branch.branchKey,\n      error,\n    },\n    tenantId: instance.tenantId,\n    organizationId: instance.organizationId,\n  })\n\n  const errorEntry = buildErrorContextEntry(failedStepId, error)\n  mergeTokenContext(token, { [WORKFLOW_ERROR_CONTEXT_KEY]: errorEntry })\n  await em.flush()\n\n  const transitionHandler = await import('./transition-handler')\n  const routedResult = await transitionHandler.executeTransitionForToken(\n    em,\n    container,\n    token,\n    failedStepId,\n    errorRoute.toStepId,\n    {\n      ...evalContext,\n      workflowContext: {\n        ...evalContext.workflowContext,\n        [WORKFLOW_ERROR_CONTEXT_KEY]: errorEntry,\n      },\n      transitionId: errorRoute.transitionId,\n    },\n  )\n\n  return routedResult.success === true\n}\n\nasync function completeBranchAtJoin(\n  em: EntityManager,\n  instance: WorkflowInstance,\n  branch: WorkflowBranchInstance,\n): Promise<void> {\n  const now = new Date()\n  branch.status = 'COMPLETED'\n  branch.completedAt = now\n  branch.updatedAt = now\n  await em.flush()\n\n  await logWorkflowEvent(em, {\n    workflowInstanceId: instance.id,\n    branchInstanceId: branch.id,\n    eventType: 'PARALLEL_BRANCH_COMPLETED',\n    eventData: { branchKey: branch.branchKey, joinStepId: branch.joinStepId },\n    tenantId: instance.tenantId,\n    organizationId: instance.organizationId,\n  })\n}\n\nasync function failBranch(\n  em: EntityManager,\n  instance: WorkflowInstance,\n  branch: WorkflowBranchInstance,\n  message: string,\n): Promise<void> {\n  const now = new Date()\n  branch.status = 'FAILED'\n  branch.errorMessage = message\n  branch.updatedAt = now\n  await em.flush()\n\n  await logWorkflowEvent(em, {\n    workflowInstanceId: instance.id,\n    branchInstanceId: branch.id,\n    eventType: 'PARALLEL_BRANCH_FAILED',\n    eventData: { branchKey: branch.branchKey, error: message },\n    tenantId: instance.tenantId,\n    organizationId: instance.organizationId,\n  })\n}\n\n/**\n * Cancel sibling branches of a failed branch (best-effort), cancel their open\n * user tasks, and log a cancellation event per branch.\n */\nasync function cancelSiblings(\n  em: EntityManager,\n  instance: WorkflowInstance,\n  failedBranch: WorkflowBranchInstance,\n): Promise<void> {\n  const siblings = await em.find(WorkflowBranchInstance, {\n    workflowInstanceId: instance.id,\n    forkStepId: failedBranch.forkStepId,\n  })\n\n  const now = new Date()\n  for (const sibling of siblings) {\n    if (sibling.id === failedBranch.id) continue\n    if (sibling.status === 'ACTIVE' || sibling.status === 'PAUSED' || sibling.status === 'WAITING_FOR_ACTIVITIES') {\n      sibling.status = 'CANCELLED'\n      sibling.updatedAt = now\n\n      // Best-effort: cancel the branch's open user tasks.\n      const openTasks = await em.find(UserTask, {\n        workflowInstanceId: instance.id,\n        branchInstanceId: sibling.id,\n        status: 'PENDING',\n      })\n      for (const task of openTasks) {\n        task.status = 'CANCELLED'\n        task.updatedAt = now\n      }\n\n      await em.flush()\n\n      await logWorkflowEvent(em, {\n        workflowInstanceId: instance.id,\n        branchInstanceId: sibling.id,\n        eventType: 'PARALLEL_BRANCH_CANCELLED',\n        eventData: { branchKey: sibling.branchKey, reason: 'sibling-failed' },\n        tenantId: instance.tenantId,\n        organizationId: instance.organizationId,\n      })\n    }\n  }\n\n  await logWorkflowEvent(em, {\n    workflowInstanceId: instance.id,\n    eventType: 'PARALLEL_FORK_FAILED',\n    eventData: { forkStepId: failedBranch.forkStepId, failedBranchKey: failedBranch.branchKey },\n    tenantId: instance.tenantId,\n    organizationId: instance.organizationId,\n  })\n}\n\n/**\n * Fire the JOIN once all branches are COMPLETED: merge each branch namespace\n * under `instance.context.branches[branchKey]`, apply optional outputMapping to\n * lift selected values to the top level, then resume the root token at the step\n * after the JOIN.\n */\nasync function fireJoin(\n  em: EntityManager,\n  instance: WorkflowInstance,\n  definition: WorkflowDefinition,\n  branches: WorkflowBranchInstance[],\n  forkStepId: string,\n): Promise<void> {\n  const joinStepId = branches[0]?.joinStepId\n  if (!joinStepId) {\n    throw new Error('[internal] fireJoin called without a join step id')\n  }\n\n  const joinStep = definition.definition.steps.find((s: any) => s.stepId === joinStepId)\n\n  // Deterministic merge \u2014 no silent collisions: each branch keeps its own slot.\n  const branchesContext: Record<string, any> = { ...(instance.context?.branches || {}) }\n  const mergedBranchKeys: string[] = []\n  for (const branch of branches) {\n    branchesContext[branch.branchKey] = branch.contextNamespace || {}\n    mergedBranchKeys.push(branch.branchKey)\n  }\n\n  let nextContext: Record<string, any> = {\n    ...(instance.context || {}),\n    branches: branchesContext,\n  }\n\n  // Optional outputMapping: topLevelKey -> 'branches.<branchKey>.<path>'. The\n  // reserved `branches` slot map is never overwritten \u2014 guard it explicitly so a\n  // mapping cannot clobber the per-branch namespaces.\n  const outputMapping: Record<string, string> | undefined = joinStep?.config?.outputMapping\n  if (outputMapping) {\n    for (const [topKey, sourcePath] of Object.entries(outputMapping)) {\n      if (topKey === 'branches') continue\n      const value = getNestedValue(nextContext, sourcePath)\n      if (value !== undefined) nextContext[topKey] = value\n    }\n  }\n\n  // Park the root token ON the JOIN step (not its successor) and let the\n  // single-token executor loop run the JOIN's outgoing transition. Jumping\n  // straight to the post-join step would bypass stepHandler.executeStep() for\n  // that step \u2014 so a following USER_TASK / WAIT_FOR_TIMER / WAIT_FOR_SIGNAL would\n  // never have its task created / timer enqueued / signal wait registered (the\n  // instance would hang), and any activities on the JOIN's outgoing transition\n  // would be skipped. The JOIN step itself is a no-op, so the loop simply runs\n  // its outgoing transition through the normal step-entry path.\n  const afterJoinStepId = (definition.definition.transitions || []).find(\n    (transition: any) => transition.fromStepId === joinStepId,\n  )?.toStepId ?? null\n\n  const now = new Date()\n  instance.context = nextContext\n  instance.status = 'RUNNING'\n  instance.activeForkStepId = null\n  instance.currentStepId = joinStepId\n  instance.updatedAt = now\n  await em.flush()\n\n  await logWorkflowEvent(em, {\n    workflowInstanceId: instance.id,\n    eventType: 'PARALLEL_JOIN_COMPLETED',\n    eventData: { forkStepId, joinStepId, mergedBranchKeys, afterJoinStepId },\n    tenantId: instance.tenantId,\n    organizationId: instance.organizationId,\n  })\n}\n"],
+  "mappings": "AAqBA,SAAwB,gBAAgB;AAExC;AAAA,EACE;AAAA,EACA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,wBAAwB;AACjC,YAAY,iBAAiB;AAC7B,SAAS,aAAa,yBAA8C;AACpE,SAAS,4BAA4B,8BAA8B;AA4BnE,eAAsB,aACpB,IACA,SACkB;AAClB,QAAM,SAAS,MAAM,GAAG,QAAQ,wBAAwB;AAAA,IACtD,IAAI,QAAQ;AAAA,IACZ,oBAAoB,QAAQ;AAAA,IAC5B,UAAU,QAAQ;AAAA,IAClB,gBAAgB,QAAQ;AAAA,EAC1B,CAAC;AAED,MAAI,CAAC,OAAQ,QAAO;AACpB,MAAI,OAAO,WAAW,YAAY,OAAO,WAAW,0BAA0B;AAE5E,WAAO;AAAA,EACT;AAEA,QAAM,MAAM,oBAAI,KAAK;AACrB,MAAI,QAAQ,cAAc;AACxB,WAAO,mBAAmB,EAAE,GAAI,OAAO,oBAAoB,CAAC,GAAI,GAAG,QAAQ,aAAa;AAAA,EAC1F;AAEA,MAAI,QAAQ,oBAAoB;AAC9B,UAAM,eAAe,MAAM,GAAG,QAAQ,cAAc;AAAA,MAClD,IAAI,QAAQ;AAAA,MACZ,oBAAoB,QAAQ;AAAA,MAC5B,QAAQ;AAAA,IACV,CAAC;AACD,QAAI,cAAc;AAChB,YAAM,YAAY,SAAS,IAAI,cAAc,QAAQ,UAAU;AAAA,IACjE;AAAA,EACF;AAEA,SAAO,SAAS;AAChB,SAAO,oBAAoB;AAC3B,SAAO,YAAY;AACnB,QAAM,GAAG,MAAM;AAEf,SAAO;AACT;AAMA,SAAS,wBAAwB,OAA+B;AAC9D,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,CAAC,WAAW,QAAQ,WAAW,UAAU,EAAG,QAAO;AACvD,SAAO;AACT;AAEA,SAAS,eAAe,KAAU,MAAmB;AACnD,SAAO,KAAK,MAAM,GAAG,EAAE,OAAO,CAAC,SAAS,QAAS,WAAW,OAAO,SAAY,QAAQ,GAAG,GAAI,GAAG;AACnG;AAQA,eAAsB,SACpB,IACA,UACA,YACA,aACe;AACf,QAAM,aAAqB,YAAY;AACvC,QAAM,aAAiC,YAAY,QAAQ;AAC3D,MAAI,CAAC,YAAY;AACf,UAAM,IAAI,MAAM,6BAA6B,UAAU,6BAA6B;AAAA,EACtF;AAEA,QAAM,YAAY,WAAW,WAAW,eAAe,CAAC,GAAG;AAAA,IACzD,CAAC,eAAoB,WAAW,eAAe,cAAc,WAAW,YAAY;AAAA,EACtF;AAEA,QAAM,MAAM,oBAAI,KAAK;AACrB,QAAM,aAAuB,CAAC;AAC9B,aAAW,cAAc,UAAU;AACjC,eAAW,KAAK,WAAW,YAAY;AACvC,UAAM,SAAS,GAAG,OAAO,wBAAwB;AAAA,MAC/C,oBAAoB,SAAS;AAAA,MAC7B;AAAA,MACA;AAAA,MACA,WAAW,WAAW;AAAA,MACtB,gBAAgB;AAAA;AAAA,MAEhB,eAAe;AAAA,MACf,QAAQ;AAAA,MACR,kBAAkB,CAAC;AAAA,MACnB,UAAU,SAAS;AAAA,MACnB,gBAAgB,SAAS;AAAA,MACzB,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW;AAAA,IACb,CAAC;AACD,OAAG,QAAQ,MAAM;AAAA,EACnB;AAEA,WAAS,SAAS;AAClB,WAAS,mBAAmB;AAC5B,WAAS,YAAY;AACrB,QAAM,GAAG,MAAM;AAEf,QAAM,iBAAiB,IAAI;AAAA,IACzB,oBAAoB,SAAS;AAAA,IAC7B,WAAW;AAAA,IACX,WAAW,EAAE,YAAY,YAAY,WAAW;AAAA,IAChD,UAAU,SAAS;AAAA,IACnB,gBAAgB,SAAS;AAAA,EAC3B,CAAC;AACH;AASA,eAAsB,4BACpB,IACA,WACA,YACA,kBACyC;AACzC,QAAM,SAAS,MAAM,GAAG;AAAA,IACtB;AAAA,IACA,EAAE,IAAI,kBAAkB,oBAAoB,WAAW;AAAA,IACvD,EAAE,UAAU,SAAS,kBAAkB;AAAA,EACzC;AACA,MAAI,CAAC,QAAQ;AACX,UAAM,IAAI,MAAM,iDAAiD;AAAA,EACnE;AACA,MAAI,OAAO,WAAW,0BAA0B;AAE9C,WAAO,EAAE,mBAAmB,MAAM;AAAA,EACpC;AAEA,QAAM,YAAY,OAAO,oBAAoB,CAAC;AAC9C,QAAM,gBAAiB,UAAU,2BAAqC,CAAC;AAEvE,QAAM,kBAAkB,MAAM,GAAG,KAAK,eAAe;AAAA,IACnD,oBAAoB;AAAA,IACpB;AAAA,IACA,WAAW;AAAA,IACX,WAAW,EAAE,OAAO,KAAK;AAAA,EAC3B,CAAC;AACD,QAAM,cAAc,MAAM,GAAG,MAAM,eAAe;AAAA,IAChD,oBAAoB;AAAA,IACpB;AAAA,IACA,WAAW;AAAA,IACX,WAAW,EAAE,OAAO,KAAK;AAAA,EAC3B,CAAC;AAED,MAAI,gBAAgB,SAAS,cAAc,cAAc,QAAQ;AAE/D,WAAO,EAAE,mBAAmB,MAAM;AAAA,EACpC;AAEA,QAAM,MAAM,oBAAI,KAAK;AACrB,MAAI,cAAc,GAAG;AACnB,WAAO,SAAS;AAChB,WAAO,eAAe,GAAG,WAAW,uCAAuC,OAAO,SAAS;AAC3F,WAAO,YAAY;AACnB,UAAM,GAAG,MAAM;AAEf,WAAO,EAAE,mBAAmB,KAAK;AAAA,EACnC;AAEA,QAAM,kBAAuC,EAAE,GAAG,UAAU;AAC5D,aAAW,SAAS,iBAAiB;AACnC,QAAI,MAAM,WAAW,QAAQ;AAC3B,sBAAgB,GAAG,MAAM,UAAU,UAAU,SAAS,IAAI,MAAM,UAAU;AAAA,IAC5E;AAAA,EACF;AACA,SAAO,gBAAgB;AACvB,SAAO,mBAAmB;AAE1B,QAAM,UAAU,OAAO;AACvB,SAAO,oBAAoB;AAC3B,SAAO,SAAS;AAChB,SAAO,YAAY;AACnB,QAAM,GAAG,MAAM;AAKf,MAAI,SAAS;AACX,UAAM,WAAW,MAAM,GAAG,QAAQ,kBAAkB,EAAE,IAAI,WAAW,CAAC;AACtE,QAAI,UAAU;AACZ,aAAO,gBAAgB,QAAQ;AAC/B,YAAM,GAAG,MAAM;AACf,YAAM,YAAY;AAAA,QAChB;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,QACR;AAAA,UACE,iBAAiB,EAAE,GAAI,SAAS,WAAW,CAAC,GAAI,GAAI,OAAO,oBAAoB,CAAC,EAAG;AAAA,UACnF,QAAQ,wBAAwB,SAAS,UAAU,WAAW,KAAK;AAAA,QACrE;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,mBAAmB,KAAK;AACnC;AAQA,eAAsB,gBACpB,IACA,WACA,UACA,YACA,SACgC;AAChC,QAAM,aAAa,SAAS;AAC5B,MAAI,CAAC,YAAY;AACf,UAAM,IAAI,MAAM,mEAAmE;AAAA,EACrF;AAIA,QAAM,uBAAuB,MAAM,GAAG,KAAK,wBAAwB;AAAA,IACjE,oBAAoB,SAAS;AAAA,IAC7B;AAAA,EACF,CAAC;AACD,QAAM,gBAAgB,KAAK,IAAI,GAAG,qBAAqB,MAAM,IAAI;AACjE,MAAI,aAAa;AAEjB,SAAO,aAAa,eAAe;AACjC;AAEA,UAAM,WAAW,MAAM,GAAG,KAAK,wBAAwB;AAAA,MACrD,oBAAoB,SAAS;AAAA,MAC7B;AAAA,IACF,CAAC;AAED,UAAM,SAAS,SAAS,OAAO,CAAC,MAAM,EAAE,WAAW,QAAQ;AAE3D,QAAI,OAAO,WAAW,GAAG;AACvB,YAAM,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,WAAW,QAAQ;AACzD,UAAI,QAAQ;AAGV,cAAM,eAAe,IAAI,UAAU,MAAM;AACzC,eAAO,EAAE,SAAS,UAAU,OAAO,OAAO,gBAAgB,gBAAgB;AAAA,MAC5E;AACA,UAAI,SAAS,MAAM,CAAC,MAAM,EAAE,WAAW,WAAW,GAAG;AACnD,cAAM,SAAS,IAAI,UAAU,YAAY,UAAU,UAAU;AAC7D,eAAO,EAAE,SAAS,SAAS;AAAA,MAC7B;AAEA,aAAO,EAAE,SAAS,UAAU;AAAA,IAC9B;AAEA,eAAW,UAAU,QAAQ;AAC3B,YAAM,SAAS,MAAM,iBAAiB,IAAI,WAAW,UAAU,YAAY,QAAQ,OAAO;AAC1F,UAAI,WAAW,UAAU;AACvB,cAAM,eAAe,IAAI,UAAU,MAAM;AACzC,eAAO,EAAE,SAAS,UAAU,OAAO,OAAO,gBAAgB,gBAAgB;AAAA,MAC5E;AAAA,IACF;AAAA,EACF;AAEA,QAAM,IAAI,MAAM,iFAAiF;AACnG;AAMA,eAAe,iBACb,IACA,WACA,UACA,YACA,QACA,SACgC;AAEhC,MAAI,OAAO,kBAAkB,OAAO,YAAY;AAC9C,UAAM,qBAAqB,IAAI,UAAU,MAAM;AAC/C,WAAO;AAAA,EACT;AAEA,QAAM,oBAAoB,MAAM,OAAO,sBAAsB;AAE7D,QAAM,QAAQ,YAAY,UAAU,MAAM;AAE1C,QAAM,cAAc,EAAE,GAAI,SAAS,WAAW,CAAC,GAAI,GAAI,OAAO,oBAAoB,CAAC,EAAG;AACtF,QAAM,cAAc,EAAE,iBAAiB,aAAa,QAAQ,QAAQ,OAAO;AAI3E,MAAI,WAAuB;AAC3B,MAAI,OAAO,kBAAkB,OAAO,YAAY;AAC9C,gBAAY,WAAW,WAAW,eAAe,CAAC,GAAG;AAAA,MACnD,CAAC,eAAoB,WAAW,iBAAiB,OAAO;AAAA,IAC1D,KAAK;AAAA,EACP,OAAO;AACL,UAAM,QAAQ,MAAM,kBAAkB;AAAA,MACpC;AAAA,MACA;AAAA,MACA,OAAO;AAAA,MACP;AAAA,IACF;AACA,UAAM,YAAY,MAAM,OAAO,CAAC,OAAO,GAAG,WAAW,GAAG,YAAY,YAAY,MAAM;AACtF,eAAW,UAAU,SAAS,IAAI,UAAU,CAAC,EAAE,aAAa;AAAA,EAC9D;AAEA,MAAI,CAAC,UAAU;AAEb,UAAM,WAAW,IAAI,UAAU,QAAQ,WAAW,OAAO,SAAS,mCAAmC,OAAO,aAAa,GAAG;AAC5H,WAAO;AAAA,EACT;AAEA,MAAI;AACF,UAAM,mBAAmB,MAAM,kBAAkB;AAAA,MAC/C;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS;AAAA,MACT,SAAS;AAAA,MACT,EAAE,GAAG,aAAa,cAAc,SAAS,aAAa;AAAA,IACxD;AAEA,QAAI,CAAC,iBAAiB,SAAS;AAK7B,YAAM,SAAS,MAAM;AAAA,QACnB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,UAAI,QAAQ;AACV,YAAI,OAAO,kBAAkB,OAAO,YAAY;AAC9C,gBAAM,qBAAqB,IAAI,UAAU,MAAM;AAAA,QACjD;AACA,eAAO;AAAA,MACT;AACA,YAAM,WAAW,IAAI,UAAU,QAAQ,iBAAiB,SAAS,0BAA0B;AAC3F,aAAO;AAAA,IACT;AAIA,QAAI,OAAO,kBAAkB,OAAO,YAAY;AAC9C,YAAM,qBAAqB,IAAI,UAAU,MAAM;AAAA,IACjD;AACA,WAAO;AAAA,EACT,SAAS,OAAO;AACd,UAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACrE,UAAM,WAAW,IAAI,UAAU,QAAQ,OAAO;AAC9C,WAAO;AAAA,EACT;AACF;AAOA,eAAe,uBACb,IACA,WACA,UACA,QACA,OACA,kBACA,aACkB;AAClB,QAAM,EAAE,cAAc,WAAW,IAAI;AACrC,MAAI,CAAC,gBAAgB,CAAC,WAAY,QAAO;AAEzC,QAAM,QAAQ,iBAAiB,SAAS;AACxC,QAAM,iBAAiB,IAAI;AAAA,IACzB,oBAAoB,SAAS;AAAA,IAC7B,kBAAkB,OAAO;AAAA,IACzB,WAAW;AAAA,IACX,WAAW;AAAA,MACT;AAAA,MACA,UAAU,WAAW;AAAA,MACrB,cAAc,WAAW;AAAA,MACzB,WAAW,OAAO;AAAA,MAClB;AAAA,IACF;AAAA,IACA,UAAU,SAAS;AAAA,IACnB,gBAAgB,SAAS;AAAA,EAC3B,CAAC;AAED,QAAM,aAAa,uBAAuB,cAAc,KAAK;AAC7D,oBAAkB,OAAO,EAAE,CAAC,0BAA0B,GAAG,WAAW,CAAC;AACrE,QAAM,GAAG,MAAM;AAEf,QAAM,oBAAoB,MAAM,OAAO,sBAAsB;AAC7D,QAAM,eAAe,MAAM,kBAAkB;AAAA,IAC3C;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW;AAAA,IACX;AAAA,MACE,GAAG;AAAA,MACH,iBAAiB;AAAA,QACf,GAAG,YAAY;AAAA,QACf,CAAC,0BAA0B,GAAG;AAAA,MAChC;AAAA,MACA,cAAc,WAAW;AAAA,IAC3B;AAAA,EACF;AAEA,SAAO,aAAa,YAAY;AAClC;AAEA,eAAe,qBACb,IACA,UACA,QACe;AACf,QAAM,MAAM,oBAAI,KAAK;AACrB,SAAO,SAAS;AAChB,SAAO,cAAc;AACrB,SAAO,YAAY;AACnB,QAAM,GAAG,MAAM;AAEf,QAAM,iBAAiB,IAAI;AAAA,IACzB,oBAAoB,SAAS;AAAA,IAC7B,kBAAkB,OAAO;AAAA,IACzB,WAAW;AAAA,IACX,WAAW,EAAE,WAAW,OAAO,WAAW,YAAY,OAAO,WAAW;AAAA,IACxE,UAAU,SAAS;AAAA,IACnB,gBAAgB,SAAS;AAAA,EAC3B,CAAC;AACH;AAEA,eAAe,WACb,IACA,UACA,QACA,SACe;AACf,QAAM,MAAM,oBAAI,KAAK;AACrB,SAAO,SAAS;AAChB,SAAO,eAAe;AACtB,SAAO,YAAY;AACnB,QAAM,GAAG,MAAM;AAEf,QAAM,iBAAiB,IAAI;AAAA,IACzB,oBAAoB,SAAS;AAAA,IAC7B,kBAAkB,OAAO;AAAA,IACzB,WAAW;AAAA,IACX,WAAW,EAAE,WAAW,OAAO,WAAW,OAAO,QAAQ;AAAA,IACzD,UAAU,SAAS;AAAA,IACnB,gBAAgB,SAAS;AAAA,EAC3B,CAAC;AACH;AAMA,eAAe,eACb,IACA,UACA,cACe;AACf,QAAM,WAAW,MAAM,GAAG,KAAK,wBAAwB;AAAA,IACrD,oBAAoB,SAAS;AAAA,IAC7B,YAAY,aAAa;AAAA,EAC3B,CAAC;AAED,QAAM,MAAM,oBAAI,KAAK;AACrB,aAAW,WAAW,UAAU;AAC9B,QAAI,QAAQ,OAAO,aAAa,GAAI;AACpC,QAAI,QAAQ,WAAW,YAAY,QAAQ,WAAW,YAAY,QAAQ,WAAW,0BAA0B;AAC7G,cAAQ,SAAS;AACjB,cAAQ,YAAY;AAGpB,YAAM,YAAY,MAAM,GAAG,KAAK,UAAU;AAAA,QACxC,oBAAoB,SAAS;AAAA,QAC7B,kBAAkB,QAAQ;AAAA,QAC1B,QAAQ;AAAA,MACV,CAAC;AACD,iBAAW,QAAQ,WAAW;AAC5B,aAAK,SAAS;AACd,aAAK,YAAY;AAAA,MACnB;AAEA,YAAM,GAAG,MAAM;AAEf,YAAM,iBAAiB,IAAI;AAAA,QACzB,oBAAoB,SAAS;AAAA,QAC7B,kBAAkB,QAAQ;AAAA,QAC1B,WAAW;AAAA,QACX,WAAW,EAAE,WAAW,QAAQ,WAAW,QAAQ,iBAAiB;AAAA,QACpE,UAAU,SAAS;AAAA,QACnB,gBAAgB,SAAS;AAAA,MAC3B,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,iBAAiB,IAAI;AAAA,IACzB,oBAAoB,SAAS;AAAA,IAC7B,WAAW;AAAA,IACX,WAAW,EAAE,YAAY,aAAa,YAAY,iBAAiB,aAAa,UAAU;AAAA,IAC1F,UAAU,SAAS;AAAA,IACnB,gBAAgB,SAAS;AAAA,EAC3B,CAAC;AACH;AAQA,eAAe,SACb,IACA,UACA,YACA,UACA,YACe;AACf,QAAM,aAAa,SAAS,CAAC,GAAG;AAChC,MAAI,CAAC,YAAY;AACf,UAAM,IAAI,MAAM,mDAAmD;AAAA,EACrE;AAEA,QAAM,WAAW,WAAW,WAAW,MAAM,KAAK,CAAC,MAAW,EAAE,WAAW,UAAU;AAGrF,QAAM,kBAAuC,EAAE,GAAI,SAAS,SAAS,YAAY,CAAC,EAAG;AACrF,QAAM,mBAA6B,CAAC;AACpC,aAAW,UAAU,UAAU;AAC7B,oBAAgB,OAAO,SAAS,IAAI,OAAO,oBAAoB,CAAC;AAChE,qBAAiB,KAAK,OAAO,SAAS;AAAA,EACxC;AAEA,MAAI,cAAmC;AAAA,IACrC,GAAI,SAAS,WAAW,CAAC;AAAA,IACzB,UAAU;AAAA,EACZ;AAKA,QAAM,gBAAoD,UAAU,QAAQ;AAC5E,MAAI,eAAe;AACjB,eAAW,CAAC,QAAQ,UAAU,KAAK,OAAO,QAAQ,aAAa,GAAG;AAChE,UAAI,WAAW,WAAY;AAC3B,YAAM,QAAQ,eAAe,aAAa,UAAU;AACpD,UAAI,UAAU,OAAW,aAAY,MAAM,IAAI;AAAA,IACjD;AAAA,EACF;AAUA,QAAM,mBAAmB,WAAW,WAAW,eAAe,CAAC,GAAG;AAAA,IAChE,CAAC,eAAoB,WAAW,eAAe;AAAA,EACjD,GAAG,YAAY;AAEf,QAAM,MAAM,oBAAI,KAAK;AACrB,WAAS,UAAU;AACnB,WAAS,SAAS;AAClB,WAAS,mBAAmB;AAC5B,WAAS,gBAAgB;AACzB,WAAS,YAAY;AACrB,QAAM,GAAG,MAAM;AAEf,QAAM,iBAAiB,IAAI;AAAA,IACzB,oBAAoB,SAAS;AAAA,IAC7B,WAAW;AAAA,IACX,WAAW,EAAE,YAAY,YAAY,kBAAkB,gBAAgB;AAAA,IACvE,UAAU,SAAS;AAAA,IACnB,gBAAgB,SAAS;AAAA,EAC3B,CAAC;AACH;",
   "names": []
 }

package/dist/modules/workflows/lib/port-contract.js

@@ -0,0 +1,54 @@
+import { parseBooleanToken } from "@open-mercato/shared/lib/boolean";
+function validateAgainstPorts(values, ports) {
+  const source = values ?? {};
+  const coerced = { ...source };
+  const errors = [];
+  for (const port of ports) {
+    const raw = source[port.name];
+    const isAbsent = raw === void 0 || raw === null || raw === "";
+    if (isAbsent) {
+      if (port.required) {
+        errors.push({ port: port.name, message: `Required port "${port.name}" is missing` });
+      }
+      continue;
+    }
+    const result = coercePortValue(raw, port);
+    if (result.error) {
+      errors.push({ port: port.name, message: result.error });
+      continue;
+    }
+    coerced[port.name] = result.value;
+  }
+  return { coerced, errors };
+}
+function coercePortValue(raw, port) {
+  switch (port.type) {
+    case "text":
+      return { value: String(raw) };
+    case "number": {
+      const parsed = typeof raw === "number" ? raw : Number(raw);
+      return Number.isNaN(parsed) ? { error: `Port "${port.name}" expects a number` } : { value: parsed };
+    }
+    case "boolean": {
+      const parsed = typeof raw === "boolean" ? raw : parseBooleanToken(typeof raw === "string" ? raw : String(raw));
+      return parsed === null ? { error: `Port "${port.name}" expects a boolean` } : { value: parsed };
+    }
+    case "select": {
+      const text = String(raw);
+      if (port.options && port.options.length > 0 && !port.options.includes(text)) {
+        return { error: `Port "${port.name}" must be one of: ${port.options.join(", ")}` };
+      }
+      return { value: text };
+    }
+    case "date": {
+      const date = raw instanceof Date ? raw : new Date(typeof raw === "number" ? raw : String(raw));
+      return Number.isNaN(date.getTime()) ? { error: `Port "${port.name}" expects a valid date` } : { value: date.toISOString() };
+    }
+    default:
+      return { value: raw };
+  }
+}
+export {
+  validateAgainstPorts
+};
+//# sourceMappingURL=port-contract.js.map

package/dist/modules/workflows/lib/port-contract.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/modules/workflows/lib/port-contract.ts"],
+  "sourcesContent": ["/**\n * Workflows Module - Sub-workflow Port Contract Validation\n *\n * Coerces and validates a flat values object against a declared list of port\n * fields (the `definition.io.inputs` / `definition.io.outputs` contract). Used\n * at the SUB_WORKFLOW boundary so mapped inputs entering a child and mapped\n * outputs leaving it conform to the child's declared, business-user-authored\n * contract.\n *\n * Validation is opt-in by contract presence: the caller only invokes this when\n * a child declares ports, so legacy untyped sub-workflows are unaffected.\n *\n * Coercion is intentionally permissive on representation (numeric strings,\n * boolean tokens, ISO/epoch dates) but strict on validity \u2014 an uncoercible\n * value or a missing required port produces an error rather than silently\n * dropping the field.\n */\n\nimport { parseBooleanToken } from '@open-mercato/shared/lib/boolean'\nimport type { PortField } from '../data/validators'\n\nexport interface PortValidationError {\n  port: string\n  message: string\n}\n\nexport interface PortValidationResult {\n  coerced: Record<string, any>\n  errors: PortValidationError[]\n}\n\n/**\n * Validate and coerce `values` against the declared `ports`.\n *\n * Declared ports are coerced into the contract's type; keys not covered by a\n * port pass through unchanged (so a partial contract does not strip unrelated\n * context). A required port that is absent, or a value that cannot be coerced\n * to its declared type, is reported as an error.\n */\nexport function validateAgainstPorts(\n  values: Record<string, any> | null | undefined,\n  ports: PortField[],\n): PortValidationResult {\n  const source = values ?? {}\n  const coerced: Record<string, any> = { ...source }\n  const errors: PortValidationError[] = []\n\n  for (const port of ports) {\n    const raw = source[port.name]\n    const isAbsent = raw === undefined || raw === null || raw === ''\n\n    if (isAbsent) {\n      if (port.required) {\n        errors.push({ port: port.name, message: `Required port \"${port.name}\" is missing` })\n      }\n      continue\n    }\n\n    const result = coercePortValue(raw, port)\n    if (result.error) {\n      errors.push({ port: port.name, message: result.error })\n      continue\n    }\n    coerced[port.name] = result.value\n  }\n\n  return { coerced, errors }\n}\n\nfunction coercePortValue(raw: any, port: PortField): { value?: any; error?: string } {\n  switch (port.type) {\n    case 'text':\n      return { value: String(raw) }\n\n    case 'number': {\n      const parsed = typeof raw === 'number' ? raw : Number(raw)\n      return Number.isNaN(parsed)\n        ? { error: `Port \"${port.name}\" expects a number` }\n        : { value: parsed }\n    }\n\n    case 'boolean': {\n      const parsed = typeof raw === 'boolean' ? raw : parseBooleanToken(typeof raw === 'string' ? raw : String(raw))\n      return parsed === null\n        ? { error: `Port \"${port.name}\" expects a boolean` }\n        : { value: parsed }\n    }\n\n    case 'select': {\n      const text = String(raw)\n      if (port.options && port.options.length > 0 && !port.options.includes(text)) {\n        return { error: `Port \"${port.name}\" must be one of: ${port.options.join(', ')}` }\n      }\n      return { value: text }\n    }\n\n    case 'date': {\n      const date = raw instanceof Date ? raw : new Date(typeof raw === 'number' ? raw : String(raw))\n      return Number.isNaN(date.getTime())\n        ? { error: `Port \"${port.name}\" expects a valid date` }\n        : { value: date.toISOString() }\n    }\n\n    default:\n      return { value: raw }\n  }\n}\n"],
+  "mappings": "AAkBA,SAAS,yBAAyB;AAqB3B,SAAS,qBACd,QACA,OACsB;AACtB,QAAM,SAAS,UAAU,CAAC;AAC1B,QAAM,UAA+B,EAAE,GAAG,OAAO;AACjD,QAAM,SAAgC,CAAC;AAEvC,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,OAAO,KAAK,IAAI;AAC5B,UAAM,WAAW,QAAQ,UAAa,QAAQ,QAAQ,QAAQ;AAE9D,QAAI,UAAU;AACZ,UAAI,KAAK,UAAU;AACjB,eAAO,KAAK,EAAE,MAAM,KAAK,MAAM,SAAS,kBAAkB,KAAK,IAAI,eAAe,CAAC;AAAA,MACrF;AACA;AAAA,IACF;AAEA,UAAM,SAAS,gBAAgB,KAAK,IAAI;AACxC,QAAI,OAAO,OAAO;AAChB,aAAO,KAAK,EAAE,MAAM,KAAK,MAAM,SAAS,OAAO,MAAM,CAAC;AACtD;AAAA,IACF;AACA,YAAQ,KAAK,IAAI,IAAI,OAAO;AAAA,EAC9B;AAEA,SAAO,EAAE,SAAS,OAAO;AAC3B;AAEA,SAAS,gBAAgB,KAAU,MAAkD;AACnF,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,aAAO,EAAE,OAAO,OAAO,GAAG,EAAE;AAAA,IAE9B,KAAK,UAAU;AACb,YAAM,SAAS,OAAO,QAAQ,WAAW,MAAM,OAAO,GAAG;AACzD,aAAO,OAAO,MAAM,MAAM,IACtB,EAAE,OAAO,SAAS,KAAK,IAAI,qBAAqB,IAChD,EAAE,OAAO,OAAO;AAAA,IACtB;AAAA,IAEA,KAAK,WAAW;AACd,YAAM,SAAS,OAAO,QAAQ,YAAY,MAAM,kBAAkB,OAAO,QAAQ,WAAW,MAAM,OAAO,GAAG,CAAC;AAC7G,aAAO,WAAW,OACd,EAAE,OAAO,SAAS,KAAK,IAAI,sBAAsB,IACjD,EAAE,OAAO,OAAO;AAAA,IACtB;AAAA,IAEA,KAAK,UAAU;AACb,YAAM,OAAO,OAAO,GAAG;AACvB,UAAI,KAAK,WAAW,KAAK,QAAQ,SAAS,KAAK,CAAC,KAAK,QAAQ,SAAS,IAAI,GAAG;AAC3E,eAAO,EAAE,OAAO,SAAS,KAAK,IAAI,qBAAqB,KAAK,QAAQ,KAAK,IAAI,CAAC,GAAG;AAAA,MACnF;AACA,aAAO,EAAE,OAAO,KAAK;AAAA,IACvB;AAAA,IAEA,KAAK,QAAQ;AACX,YAAM,OAAO,eAAe,OAAO,MAAM,IAAI,KAAK,OAAO,QAAQ,WAAW,MAAM,OAAO,GAAG,CAAC;AAC7F,aAAO,OAAO,MAAM,KAAK,QAAQ,CAAC,IAC9B,EAAE,OAAO,SAAS,KAAK,IAAI,yBAAyB,IACpD,EAAE,OAAO,KAAK,YAAY,EAAE;AAAA,IAClC;AAAA,IAEA;AACE,aAAO,EAAE,OAAO,IAAI;AAAA,EACxB;AACF;",
+  "names": []
+}

package/dist/modules/workflows/lib/portal-task-access.js

@@ -0,0 +1,89 @@
+import { findWithDecryption } from "@open-mercato/shared/lib/encryption/find";
+import { CustomerUser } from "@open-mercato/core/modules/customer_accounts/data/entities";
+import {
+  decideTaskVisibility
+} from "./task-visibility.js";
+import { toTaskFacts } from "./task-visibility-request.js";
+const PORTAL_TASKS_VIEW_FEATURE = "portal.tasks.view";
+const PORTAL_TASKS_COMPLETE_FEATURE = "portal.tasks.complete";
+const PORTAL_ENTITY_ACCESS = /* @__PURE__ */ new Map();
+const PORTAL_POLICY = { businessContextEnabled: true };
+const PORTAL_NO_COMPANY_BODY = {
+  ok: false,
+  error: "No company association"
+};
+const PORTAL_TASK_NOT_FOUND_BODY = {
+  ok: false,
+  error: "Task not found"
+};
+function pushIfPresent(target, value) {
+  if (typeof value === "string" && value.length > 0) target.add(value);
+}
+async function resolvePortalTaskPrincipal(input) {
+  const { auth, em, isPortalAdmin } = input;
+  if (!auth.customerEntityId) {
+    return { ok: false, status: 403, body: PORTAL_NO_COMPANY_BODY };
+  }
+  const ownedRecordIds = /* @__PURE__ */ new Set();
+  pushIfPresent(ownedRecordIds, auth.customerEntityId);
+  pushIfPresent(ownedRecordIds, auth.personEntityId);
+  const assigneeIds = /* @__PURE__ */ new Set([auth.sub]);
+  if (isPortalAdmin) {
+    const members = await findWithDecryption(
+      em,
+      CustomerUser,
+      {
+        customerEntityId: auth.customerEntityId,
+        tenantId: auth.tenantId,
+        deletedAt: null
+      },
+      { fields: ["id", "personEntityId", "customerEntityId"] },
+      { tenantId: auth.tenantId, organizationId: auth.orgId }
+    );
+    for (const member of members) {
+      assigneeIds.add(member.id);
+      pushIfPresent(ownedRecordIds, member.personEntityId);
+      pushIfPresent(ownedRecordIds, member.customerEntityId);
+    }
+  }
+  return {
+    ok: true,
+    principal: {
+      kind: "portal",
+      principalId: auth.sub,
+      tenantId: auth.tenantId,
+      organizationId: auth.orgId,
+      ownedRecordIds,
+      isPortalAdmin
+    },
+    assigneeIds: [...assigneeIds]
+  };
+}
+function buildPortalTaskConditions(input) {
+  return {
+    tenantId: input.principal.tenantId,
+    organizationId: input.principal.organizationId,
+    assigneeKind: "customer",
+    assignedTo: { $in: [...input.assigneeIds] },
+    entityTypes: { $ne: null }
+  };
+}
+function decidePortalTaskAccess(principal, task) {
+  return decideTaskVisibility(principal, toTaskFacts(task), PORTAL_ENTITY_ACCESS, PORTAL_POLICY);
+}
+function filterVisiblePortalTasks(principal, tasks) {
+  return tasks.filter((task) => decidePortalTaskAccess(principal, task).visible);
+}
+const PORTAL_TASK_REFUSAL = { status: 404, body: PORTAL_TASK_NOT_FOUND_BODY };
+export {
+  PORTAL_NO_COMPANY_BODY,
+  PORTAL_TASKS_COMPLETE_FEATURE,
+  PORTAL_TASKS_VIEW_FEATURE,
+  PORTAL_TASK_NOT_FOUND_BODY,
+  PORTAL_TASK_REFUSAL,
+  buildPortalTaskConditions,
+  decidePortalTaskAccess,
+  filterVisiblePortalTasks,
+  resolvePortalTaskPrincipal
+};
+//# sourceMappingURL=portal-task-access.js.map

package/dist/modules/workflows/lib/portal-task-access.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/modules/workflows/lib/portal-task-access.ts"],
+  "sourcesContent": ["/**\n * Per-request wiring for the \u00A76.4 rule on the PORTAL side.\n *\n * The counterpart to `lib/task-visibility-request.ts`. Same contract: the pure\n * predicate (`lib/task-visibility.ts`) decides, this module only assembles its\n * inputs and turns the expressible half into a `WHERE`. A second copy of the\n * rule anywhere is a review failure.\n *\n * ## Three things this file exists to get exactly right\n *\n * **1. A task with no bindings DENIES.** The backoffice branch passes an empty\n * binding set vacuously, because a backoffice principal already carries an\n * org-membership grant and being assigned a task inside your own tenant is a\n * complete authorization story. A portal principal carries no such grant: the\n * binding to their own record *is* the entire authorization, so with no binding\n * there is nothing to authorize against. The predicate answers\n * `denied:portal-unbound`; this module additionally excludes those rows in SQL\n * (`entity_types IS NOT NULL`) so `pagination.total` does not count rows the\n * predicate then drops.\n *\n * **2. `isPortalAdmin` buys nothing.** `customerAuth.ts` replaces a portal\n * admin's grants with the literal `['*']`, and `CustomerRbacService` short-\n * circuits `userHasAllFeatures` before any matching, so *every* feature check\n * passes for them. Therefore no feature check may take part in the ownership\n * decision: `PortalTaskPrincipal` carries no feature array at all, ownership is\n * a `Set.has` against `ownedRecordIds`, and `isPortalAdmin` is consulted last\n * and only to widen `visible` \u2014 never `actable`, never ownership.\n *\n * **3. The two id spaces are not interchangeable.** `assignedTo` on a portal\n * task names a `CustomerUser.id` (the JWT `sub`). A binding's `entityId` names a\n * customer/person ENTITY RECORD. They are resolved from the same company query\n * and used in different places: user ids drive the SQL assignee arm, record ids\n * drive the ownership `Set.has`. Feeding one where the other belongs would make\n * a portal admin's own user id \"own\" a record.\n *\n * ## Company scoping\n *\n * Copied from `customer_accounts/api/portal/users.ts` verbatim, including its\n * hard precondition: no `customerEntityId` \u21D2 403 \"No company association\" and\n * an empty owned set. A portal user who belongs to no company owns nothing, so\n * they see nothing, admin or not.\n *\n * Note `customerEntityId` / `personEntityId` are JWT claims read straight off\n * the token and not re-verified per request, so a user moved between companies\n * keeps stale ownership until their token turns over (design \u00A79 item 8).\n */\n\nimport type { EntityManager } from '@mikro-orm/postgresql'\nimport { findWithDecryption } from '@open-mercato/shared/lib/encryption/find'\nimport type { CustomerAuthContext } from '@open-mercato/core/modules/customer_accounts/lib/customerAuth'\nimport { CustomerUser } from '@open-mercato/core/modules/customer_accounts/data/entities'\nimport { UserTask } from '../data/entities'\nimport {\n  decideTaskVisibility,\n  type PortalTaskPrincipal,\n  type TaskEntityAccessMap,\n  type TaskVisibilityDecision,\n  type TaskVisibilityPolicy,\n} from './task-visibility'\nimport { toTaskFacts } from './task-visibility-request'\n\n/** Portal ACL features. New ids on an ADDITIVE-ONLY surface \u2014 nothing renamed. */\nexport const PORTAL_TASKS_VIEW_FEATURE = 'portal.tasks.view'\nexport const PORTAL_TASKS_COMPLETE_FEATURE = 'portal.tasks.complete'\n\n/**\n * The portal branch reads NEITHER of these \u2014 it decides on structure, tenant,\n * organization, `assignee_kind` and record ownership alone. They exist because\n * `decideTaskVisibility` takes one shape for both principals. Frozen here so no\n * route invents a map that could accidentally start meaning something.\n */\nconst PORTAL_ENTITY_ACCESS: TaskEntityAccessMap = new Map()\nconst PORTAL_POLICY: TaskVisibilityPolicy = { businessContextEnabled: true }\n\nexport type PortalTaskPrincipalResolution =\n  | { ok: true; principal: PortalTaskPrincipal; assigneeIds: readonly string[] }\n  | { ok: false; status: 403; body: Record<string, unknown> }\n\n/**\n * Refusal body copied verbatim from `portal/users.ts` so the whole portal\n * answers a company-less principal the same way.\n */\nexport const PORTAL_NO_COMPANY_BODY: Record<string, unknown> = {\n  ok: false,\n  error: 'No company association',\n}\n\nexport const PORTAL_TASK_NOT_FOUND_BODY: Record<string, unknown> = {\n  ok: false,\n  error: 'Task not found',\n}\n\nfunction pushIfPresent(target: Set<string>, value: string | null | undefined): void {\n  if (typeof value === 'string' && value.length > 0) target.add(value)\n}\n\n/**\n * Assemble the portal principal for this request.\n *\n * `assigneeIds` is the set of `CustomerUser.id` values whose tasks this\n * principal may be shown \u2014 themselves, plus every company member when they are\n * a portal admin. It is the SQL arm; `ownedRecordIds` is the ownership check.\n * Both come from the one company query.\n */\nexport async function resolvePortalTaskPrincipal(input: {\n  auth: CustomerAuthContext\n  em: EntityManager\n  isPortalAdmin: boolean\n}): Promise<PortalTaskPrincipalResolution> {\n  const { auth, em, isPortalAdmin } = input\n\n  if (!auth.customerEntityId) {\n    return { ok: false, status: 403, body: PORTAL_NO_COMPANY_BODY }\n  }\n\n  const ownedRecordIds = new Set<string>()\n  pushIfPresent(ownedRecordIds, auth.customerEntityId)\n  pushIfPresent(ownedRecordIds, auth.personEntityId)\n\n  const assigneeIds = new Set<string>([auth.sub])\n\n  if (isPortalAdmin) {\n    // The exact filter `portal/users.ts` uses, so \"my company\" means the same\n    // thing on both surfaces.\n    const members = await findWithDecryption<CustomerUser>(\n      em,\n      CustomerUser,\n      {\n        customerEntityId: auth.customerEntityId,\n        tenantId: auth.tenantId,\n        deletedAt: null,\n      },\n      { fields: ['id', 'personEntityId', 'customerEntityId'] },\n      { tenantId: auth.tenantId, organizationId: auth.orgId },\n    )\n    for (const member of members) {\n      assigneeIds.add(member.id)\n      pushIfPresent(ownedRecordIds, member.personEntityId)\n      pushIfPresent(ownedRecordIds, member.customerEntityId)\n    }\n  }\n\n  return {\n    ok: true,\n    principal: {\n      kind: 'portal',\n      principalId: auth.sub,\n      tenantId: auth.tenantId,\n      organizationId: auth.orgId,\n      ownedRecordIds,\n      isPortalAdmin,\n    },\n    assigneeIds: [...assigneeIds],\n  }\n}\n\n/**\n * The expressible half of the portal rule as ORM conditions.\n *\n * Three structural filters and no fourth:\n *\n * - `assignee_kind = 'customer'` keeps every backoffice row out of the portal\n *   result set entirely, independent of the predicate. It is defence 3 of 4\n *   against the `['*']` wildcard.\n * - `assigned_to IN (\u2026)` narrows to this principal (plus their company members\n *   for an admin). Ownership is still checked afterwards by the predicate \u2014 this\n *   only avoids fetching rows that cannot survive it.\n * - `entity_types IS NOT NULL` drops unbound rows, which the predicate denies\n *   anyway. Doing it in SQL is what keeps `pagination.total` honest.\n *\n * Ownership itself is NOT expressible: it is a containment test over the\n * `entity_bindings` jsonb against a per-principal id set. The predicate answers\n * it, and any row it drops that SQL admitted is an authoring anomaly, not a\n * routine case.\n */\nexport function buildPortalTaskConditions(input: {\n  principal: PortalTaskPrincipal\n  assigneeIds: readonly string[]\n}): Record<string, unknown> {\n  return {\n    tenantId: input.principal.tenantId,\n    organizationId: input.principal.organizationId,\n    assigneeKind: 'customer',\n    assignedTo: { $in: [...input.assigneeIds] },\n    entityTypes: { $ne: null },\n  }\n}\n\n/** The predicate's answer for one already-loaded row, portal side. */\nexport function decidePortalTaskAccess(\n  principal: PortalTaskPrincipal,\n  task: UserTask,\n): TaskVisibilityDecision {\n  return decideTaskVisibility(principal, toTaskFacts(task), PORTAL_ENTITY_ACCESS, PORTAL_POLICY)\n}\n\n/**\n * The rows of an already-filtered page the predicate agrees are visible.\n *\n * The SQL above is not the whole rule \u2014 ownership is not expressible \u2014 so unlike\n * the backoffice list this genuinely drops rows: a task assigned to a company\n * member but bound to a record outside the company. Dropping is the correct\n * direction, and the caller logs the divergence rather than hiding it.\n */\nexport function filterVisiblePortalTasks(\n  principal: PortalTaskPrincipal,\n  tasks: readonly UserTask[],\n): UserTask[] {\n  return tasks.filter((task) => decidePortalTaskAccess(principal, task).visible)\n}\n\n/**\n * Every portal refusal is the same 404 with the same body.\n *\n * There is no portal analogue of the backoffice `view_all` diagnostic: no portal\n * principal has a legitimate reason to learn that a row they cannot read exists,\n * and a portal admin least of all \u2014 telling them \"this task exists but is not\n * yours\" is precisely the cross-customer disclosure the ownership check prevents.\n */\nexport const PORTAL_TASK_REFUSAL = { status: 404 as const, body: PORTAL_TASK_NOT_FOUND_BODY }\n"],
+  "mappings": "AAgDA,SAAS,0BAA0B;AAEnC,SAAS,oBAAoB;AAE7B;AAAA,EACE;AAAA,OAKK;AACP,SAAS,mBAAmB;AAGrB,MAAM,4BAA4B;AAClC,MAAM,gCAAgC;AAQ7C,MAAM,uBAA4C,oBAAI,IAAI;AAC1D,MAAM,gBAAsC,EAAE,wBAAwB,KAAK;AAUpE,MAAM,yBAAkD;AAAA,EAC7D,IAAI;AAAA,EACJ,OAAO;AACT;AAEO,MAAM,6BAAsD;AAAA,EACjE,IAAI;AAAA,EACJ,OAAO;AACT;AAEA,SAAS,cAAc,QAAqB,OAAwC;AAClF,MAAI,OAAO,UAAU,YAAY,MAAM,SAAS,EAAG,QAAO,IAAI,KAAK;AACrE;AAUA,eAAsB,2BAA2B,OAIN;AACzC,QAAM,EAAE,MAAM,IAAI,cAAc,IAAI;AAEpC,MAAI,CAAC,KAAK,kBAAkB;AAC1B,WAAO,EAAE,IAAI,OAAO,QAAQ,KAAK,MAAM,uBAAuB;AAAA,EAChE;AAEA,QAAM,iBAAiB,oBAAI,IAAY;AACvC,gBAAc,gBAAgB,KAAK,gBAAgB;AACnD,gBAAc,gBAAgB,KAAK,cAAc;AAEjD,QAAM,cAAc,oBAAI,IAAY,CAAC,KAAK,GAAG,CAAC;AAE9C,MAAI,eAAe;AAGjB,UAAM,UAAU,MAAM;AAAA,MACpB;AAAA,MACA;AAAA,MACA;AAAA,QACE,kBAAkB,KAAK;AAAA,QACvB,UAAU,KAAK;AAAA,QACf,WAAW;AAAA,MACb;AAAA,MACA,EAAE,QAAQ,CAAC,MAAM,kBAAkB,kBAAkB,EAAE;AAAA,MACvD,EAAE,UAAU,KAAK,UAAU,gBAAgB,KAAK,MAAM;AAAA,IACxD;AACA,eAAW,UAAU,SAAS;AAC5B,kBAAY,IAAI,OAAO,EAAE;AACzB,oBAAc,gBAAgB,OAAO,cAAc;AACnD,oBAAc,gBAAgB,OAAO,gBAAgB;AAAA,IACvD;AAAA,EACF;AAEA,SAAO;AAAA,IACL,IAAI;AAAA,IACJ,WAAW;AAAA,MACT,MAAM;AAAA,MACN,aAAa,KAAK;AAAA,MAClB,UAAU,KAAK;AAAA,MACf,gBAAgB,KAAK;AAAA,MACrB;AAAA,MACA;AAAA,IACF;AAAA,IACA,aAAa,CAAC,GAAG,WAAW;AAAA,EAC9B;AACF;AAqBO,SAAS,0BAA0B,OAGd;AAC1B,SAAO;AAAA,IACL,UAAU,MAAM,UAAU;AAAA,IAC1B,gBAAgB,MAAM,UAAU;AAAA,IAChC,cAAc;AAAA,IACd,YAAY,EAAE,KAAK,CAAC,GAAG,MAAM,WAAW,EAAE;AAAA,IAC1C,aAAa,EAAE,KAAK,KAAK;AAAA,EAC3B;AACF;AAGO,SAAS,uBACd,WACA,MACwB;AACxB,SAAO,qBAAqB,WAAW,YAAY,IAAI,GAAG,sBAAsB,aAAa;AAC/F;AAUO,SAAS,yBACd,WACA,OACY;AACZ,SAAO,MAAM,OAAO,CAAC,SAAS,uBAAuB,WAAW,IAAI,EAAE,OAAO;AAC/E;AAUO,MAAM,sBAAsB,EAAE,QAAQ,KAAc,MAAM,2BAA2B;",
+  "names": []
+}

package/dist/modules/workflows/lib/rerun-from-step.js

@@ -0,0 +1,65 @@
+const TERMINAL_STEP_STATUSES = /* @__PURE__ */ new Set(["COMPLETED", "FAILED", "SKIPPED", "CANCELLED"]);
+const RERUNNABLE_INSTANCE_STATUSES = /* @__PURE__ */ new Set(["FAILED", "PAUSED"]);
+function orderKey(execution) {
+  const raw = execution.enteredAt ?? execution.createdAt;
+  if (!raw) return 0;
+  const parsed = raw instanceof Date ? raw.getTime() : new Date(raw).getTime();
+  return Number.isNaN(parsed) ? 0 : parsed;
+}
+function resolveRerunEligibility(input) {
+  if (!RERUNNABLE_INSTANCE_STATUSES.has(input.instanceStatus)) {
+    return {
+      ok: false,
+      code: "WORKFLOW_INSTANCE_NOT_RERUNNABLE",
+      message: `Cannot rerun a step of a ${input.instanceStatus} instance. Only FAILED or PAUSED instances can be rerun.`
+    };
+  }
+  const definitionStep = input.definitionSteps.find((step) => step.stepId === input.stepId);
+  if (!definitionStep) {
+    return {
+      ok: false,
+      code: "WORKFLOW_STEP_NOT_IN_DEFINITION",
+      message: `Step ${input.stepId} is no longer part of this workflow definition.`
+    };
+  }
+  const executions = input.stepExecutions.filter((execution) => execution.stepId === input.stepId);
+  if (executions.length === 0) {
+    return {
+      ok: false,
+      code: "WORKFLOW_STEP_NEVER_EXECUTED",
+      message: `Step ${input.stepId} has not executed in this run, so there is nothing to rerun.`
+    };
+  }
+  const latest = [...executions].sort((left, right) => orderKey(right) - orderKey(left))[0];
+  if (!TERMINAL_STEP_STATUSES.has(latest.status)) {
+    return {
+      ok: false,
+      code: "WORKFLOW_STEP_STILL_PARKED",
+      message: `Step ${input.stepId} is still ${latest.status}. Cancel or resolve the pending attempt before rerunning it.`
+    };
+  }
+  if (latest.stepType !== definitionStep.stepType) {
+    return {
+      ok: false,
+      code: "WORKFLOW_STEP_TYPE_CHANGED",
+      message: `Step ${input.stepId} changed from ${latest.stepType} to ${definitionStep.stepType} since this run started. Start a new instance instead.`
+    };
+  }
+  return { ok: true, supersededStepInstanceId: latest.id, stepType: latest.stepType };
+}
+function computeContextDiff(before, patch) {
+  const diff = {};
+  if (!patch) return diff;
+  const source = before ?? {};
+  for (const [key, next] of Object.entries(patch)) {
+    const current = source[key];
+    if (JSON.stringify(current) === JSON.stringify(next)) continue;
+    diff[key] = { from: current ?? null, to: next };
+  }
+  return diff;
+}
+export {
+  computeContextDiff,
+  resolveRerunEligibility
+};
+//# sourceMappingURL=rerun-from-step.js.map

package/dist/modules/workflows/lib/rerun-from-step.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/modules/workflows/lib/rerun-from-step.ts"],
+  "sourcesContent": ["/**\n * Rerun from step (spec \u00A78.4) \u2014 the eligibility decision, PURE.\n *\n * > \"**Rerun from failed step**, optionally with edited context \u2014 audited as\n * > `STEP_RERUN { editedContextDiff, by }`, gated by its own ACL feature.\"\n *\n * **This does NOT change the step state machine.** `workflows/AGENTS.md` says a\n * step goes `PENDING \u2192 ACTIVE \u2192 COMPLETED|FAILED|SKIPPED|CANCELLED` and is\n * never set out of order, so reviving the terminal `StepInstance` is out of the\n * question. It never happens here: the terminal row is read for its recorded\n * `stepType` and then left exactly as it is, and the new attempt gets a FRESH\n * row \u2014 which is what the engine already does on every step entry\n * (`lib/step-handler.ts` `enterStep` unconditionally\n * `em.create(StepInstance, { \u2026 status: 'ACTIVE' \u2026 })`). Both attempts stay in\n * the audit trail, and no status transition is invented.\n *\n * The cursor move plus `executeStep` is the same shape the definition-level\n * error handler already uses (`enterErrorHandlerStep` in\n * `lib/workflow-executor.ts`), so no transition record is invented either.\n */\n\n/** Step-instance statuses that mean the attempt is over and a new one is safe. */\nconst TERMINAL_STEP_STATUSES = new Set(['COMPLETED', 'FAILED', 'SKIPPED', 'CANCELLED'])\n\n/**\n * Instance statuses a rerun may act on. A RUNNING instance is excluded on\n * purpose: the engine is mid-advance and moving its cursor underneath it would\n * race the execution loop.\n */\nconst RERUNNABLE_INSTANCE_STATUSES = new Set(['FAILED', 'PAUSED'])\n\nexport type RerunRefusalCode =\n  | 'WORKFLOW_INSTANCE_NOT_RERUNNABLE'\n  | 'WORKFLOW_STEP_NOT_IN_DEFINITION'\n  | 'WORKFLOW_STEP_TYPE_CHANGED'\n  | 'WORKFLOW_STEP_NEVER_EXECUTED'\n  | 'WORKFLOW_STEP_STILL_PARKED'\n\nexport type RerunStepExecutionInput = {\n  id: string\n  stepId: string\n  stepType: string\n  status: string\n  enteredAt?: string | Date | null\n  createdAt?: string | Date | null\n}\n\nexport type RerunEligibility =\n  | { ok: true; supersededStepInstanceId: string; stepType: string }\n  | { ok: false; code: RerunRefusalCode; message: string }\n\nfunction orderKey(execution: RerunStepExecutionInput): number {\n  const raw = execution.enteredAt ?? execution.createdAt\n  if (!raw) return 0\n  const parsed = raw instanceof Date ? raw.getTime() : new Date(raw).getTime()\n  return Number.isNaN(parsed) ? 0 : parsed\n}\n\nexport function resolveRerunEligibility(input: {\n  instanceStatus: string\n  stepId: string\n  definitionSteps: ReadonlyArray<{ stepId: string; stepType: string }>\n  stepExecutions: ReadonlyArray<RerunStepExecutionInput>\n}): RerunEligibility {\n  if (!RERUNNABLE_INSTANCE_STATUSES.has(input.instanceStatus)) {\n    return {\n      ok: false,\n      code: 'WORKFLOW_INSTANCE_NOT_RERUNNABLE',\n      message: `Cannot rerun a step of a ${input.instanceStatus} instance. Only FAILED or PAUSED instances can be rerun.`,\n    }\n  }\n\n  const definitionStep = input.definitionSteps.find((step) => step.stepId === input.stepId)\n  if (!definitionStep) {\n    return {\n      ok: false,\n      code: 'WORKFLOW_STEP_NOT_IN_DEFINITION',\n      message: `Step ${input.stepId} is no longer part of this workflow definition.`,\n    }\n  }\n\n  const executions = input.stepExecutions.filter((execution) => execution.stepId === input.stepId)\n  if (executions.length === 0) {\n    return {\n      ok: false,\n      code: 'WORKFLOW_STEP_NEVER_EXECUTED',\n      message: `Step ${input.stepId} has not executed in this run, so there is nothing to rerun.`,\n    }\n  }\n\n  const latest = [...executions].sort((left, right) => orderKey(right) - orderKey(left))[0]\n\n  if (!TERMINAL_STEP_STATUSES.has(latest.status)) {\n    // The step is still parked: a queue job and, for an agent step, a pending\n    // proposal are still addressed to THIS attempt. Rerunning would leave both\n    // orphaned and able to resume the run a second time. Lifting this needs\n    // \u00A77.4's addressable resume token.\n    return {\n      ok: false,\n      code: 'WORKFLOW_STEP_STILL_PARKED',\n      message: `Step ${input.stepId} is still ${latest.status}. Cancel or resolve the pending attempt before rerunning it.`,\n    }\n  }\n\n  if (latest.stepType !== definitionStep.stepType) {\n    // The instance pins `definitionId` and the engine re-reads that row, so a\n    // FAILED instance's definition can be edited in place \u2014 the structural-edit\n    // guard only refuses while instances are ACTIVE. Replaying a step whose\n    // type changed underneath would execute something the run never ran.\n    return {\n      ok: false,\n      code: 'WORKFLOW_STEP_TYPE_CHANGED',\n      message: `Step ${input.stepId} changed from ${latest.stepType} to ${definitionStep.stepType} since this run started. Start a new instance instead.`,\n    }\n  }\n\n  return { ok: true, supersededStepInstanceId: latest.id, stepType: latest.stepType }\n}\n\nexport type ContextDiffEntry = { from: unknown; to: unknown }\n\n/**\n * The `editedContextDiff` the `STEP_RERUN` event records. Only the keys the\n * caller actually changed appear \u2014 a patch that re-sends an identical value is\n * not an edit, and recording it would make the audit unreadable.\n */\nexport function computeContextDiff(\n  before: Record<string, unknown> | null | undefined,\n  patch: Record<string, unknown> | null | undefined\n): Record<string, ContextDiffEntry> {\n  const diff: Record<string, ContextDiffEntry> = {}\n  if (!patch) return diff\n  const source = before ?? {}\n  for (const [key, next] of Object.entries(patch)) {\n    const current = source[key]\n    if (JSON.stringify(current) === JSON.stringify(next)) continue\n    diff[key] = { from: current ?? null, to: next }\n  }\n  return diff\n}\n"],
+  "mappings": "AAsBA,MAAM,yBAAyB,oBAAI,IAAI,CAAC,aAAa,UAAU,WAAW,WAAW,CAAC;AAOtF,MAAM,+BAA+B,oBAAI,IAAI,CAAC,UAAU,QAAQ,CAAC;AAsBjE,SAAS,SAAS,WAA4C;AAC5D,QAAM,MAAM,UAAU,aAAa,UAAU;AAC7C,MAAI,CAAC,IAAK,QAAO;AACjB,QAAM,SAAS,eAAe,OAAO,IAAI,QAAQ,IAAI,IAAI,KAAK,GAAG,EAAE,QAAQ;AAC3E,SAAO,OAAO,MAAM,MAAM,IAAI,IAAI;AACpC;AAEO,SAAS,wBAAwB,OAKnB;AACnB,MAAI,CAAC,6BAA6B,IAAI,MAAM,cAAc,GAAG;AAC3D,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,SAAS,4BAA4B,MAAM,cAAc;AAAA,IAC3D;AAAA,EACF;AAEA,QAAM,iBAAiB,MAAM,gBAAgB,KAAK,CAAC,SAAS,KAAK,WAAW,MAAM,MAAM;AACxF,MAAI,CAAC,gBAAgB;AACnB,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,SAAS,QAAQ,MAAM,MAAM;AAAA,IAC/B;AAAA,EACF;AAEA,QAAM,aAAa,MAAM,eAAe,OAAO,CAAC,cAAc,UAAU,WAAW,MAAM,MAAM;AAC/F,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,SAAS,QAAQ,MAAM,MAAM;AAAA,IAC/B;AAAA,EACF;AAEA,QAAM,SAAS,CAAC,GAAG,UAAU,EAAE,KAAK,CAAC,MAAM,UAAU,SAAS,KAAK,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;AAExF,MAAI,CAAC,uBAAuB,IAAI,OAAO,MAAM,GAAG;AAK9C,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,SAAS,QAAQ,MAAM,MAAM,aAAa,OAAO,MAAM;AAAA,IACzD;AAAA,EACF;AAEA,MAAI,OAAO,aAAa,eAAe,UAAU;AAK/C,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,SAAS,QAAQ,MAAM,MAAM,iBAAiB,OAAO,QAAQ,OAAO,eAAe,QAAQ;AAAA,IAC7F;AAAA,EACF;AAEA,SAAO,EAAE,IAAI,MAAM,0BAA0B,OAAO,IAAI,UAAU,OAAO,SAAS;AACpF;AASO,SAAS,mBACd,QACA,OACkC;AAClC,QAAM,OAAyC,CAAC;AAChD,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,SAAS,UAAU,CAAC;AAC1B,aAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,KAAK,GAAG;AAC/C,UAAM,UAAU,OAAO,GAAG;AAC1B,QAAI,KAAK,UAAU,OAAO,MAAM,KAAK,UAAU,IAAI,EAAG;AACtD,SAAK,GAAG,IAAI,EAAE,MAAM,WAAW,MAAM,IAAI,KAAK;AAAA,EAChD;AACA,SAAO;AACT;",
+  "names": []
+}

package/dist/modules/workflows/lib/route-chip-events.js

@@ -0,0 +1,23 @@
+const WORKFLOW_ROUTE_CHIP_EVENT = "workflow-route-chip:open";
+function requestRouteChipSection(edgeId, section) {
+  if (typeof window === "undefined") return;
+  window.dispatchEvent(
+    new CustomEvent(WORKFLOW_ROUTE_CHIP_EVENT, { detail: { edgeId, section } })
+  );
+}
+const WORKFLOW_ROUTE_ACTIVITY_EVENT = "workflow-route-activity:open";
+function requestRouteActivityEdit(edgeId, activityId) {
+  if (typeof window === "undefined") return;
+  window.dispatchEvent(
+    new CustomEvent(WORKFLOW_ROUTE_ACTIVITY_EVENT, {
+      detail: { edgeId, activityId }
+    })
+  );
+}
+export {
+  WORKFLOW_ROUTE_ACTIVITY_EVENT,
+  WORKFLOW_ROUTE_CHIP_EVENT,
+  requestRouteActivityEdit,
+  requestRouteChipSection
+};
+//# sourceMappingURL=route-chip-events.js.map

package/dist/modules/workflows/lib/route-chip-events.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/modules/workflows/lib/route-chip-events.ts"],
+  "sourcesContent": ["/**\n * Workflows Module - Route Chip Events\n *\n * Chips live inside React Flow's `EdgeLabelRenderer` portal, so a chip click\n * never reaches the canvas' `onEdgeClick`. The chip therefore announces itself\n * on `window` and the visual editor listens \u2014 the same decoupling the inline\n * node-delete button uses (`WORKFLOW_NODE_DELETE_EVENT`), so no callback has to\n * be threaded through the edge-data transform.\n */\n\nimport type { RouteChipSection } from './route-chips'\n\nexport const WORKFLOW_ROUTE_CHIP_EVENT = 'workflow-route-chip:open'\n\nexport interface RouteChipEventDetail {\n  edgeId: string\n  section: RouteChipSection\n}\n\nexport function requestRouteChipSection(edgeId: string, section: RouteChipSection): void {\n  if (typeof window === 'undefined') return\n  window.dispatchEvent(\n    new CustomEvent<RouteChipEventDetail>(WORKFLOW_ROUTE_CHIP_EVENT, { detail: { edgeId, section } }),\n  )\n}\n\n/**\n * A single activity chip announces which activity it is, so the editor can open\n * a focused single-activity modal instead of the whole transition inspector.\n */\nexport const WORKFLOW_ROUTE_ACTIVITY_EVENT = 'workflow-route-activity:open'\n\nexport interface RouteActivityEventDetail {\n  edgeId: string\n  activityId: string\n}\n\nexport function requestRouteActivityEdit(edgeId: string, activityId: string): void {\n  if (typeof window === 'undefined') return\n  window.dispatchEvent(\n    new CustomEvent<RouteActivityEventDetail>(WORKFLOW_ROUTE_ACTIVITY_EVENT, {\n      detail: { edgeId, activityId },\n    }),\n  )\n}\n"],
+  "mappings": "AAYO,MAAM,4BAA4B;AAOlC,SAAS,wBAAwB,QAAgB,SAAiC;AACvF,MAAI,OAAO,WAAW,YAAa;AACnC,SAAO;AAAA,IACL,IAAI,YAAkC,2BAA2B,EAAE,QAAQ,EAAE,QAAQ,QAAQ,EAAE,CAAC;AAAA,EAClG;AACF;AAMO,MAAM,gCAAgC;AAOtC,SAAS,yBAAyB,QAAgB,YAA0B;AACjF,MAAI,OAAO,WAAW,YAAa;AACnC,SAAO;AAAA,IACL,IAAI,YAAsC,+BAA+B;AAAA,MACvE,QAAQ,EAAE,QAAQ,WAAW;AAAA,IAC/B,CAAC;AAAA,EACH;AACF;",
+  "names": []
+}

package/dist/modules/workflows/lib/route-chips.js

@@ -0,0 +1,91 @@
+const ROUTE_CHIP_LIMIT = 3;
+const ROUTE_CHIP_ZOOM_THRESHOLD = 0.6;
+const CONDITION_SUMMARY_MAX_LENGTH = 28;
+const VALUELESS_OPERATORS = /* @__PURE__ */ new Set(["IS_EMPTY", "IS_NOT_EMPTY"]);
+function isGroupLike(value) {
+  return Boolean(
+    value && typeof value === "object" && typeof value.operator === "string" && Array.isArray(value.rules)
+  );
+}
+function isSimpleLike(value) {
+  return Boolean(
+    value && typeof value === "object" && typeof value.field === "string" && typeof value.operator === "string"
+  );
+}
+function formatValue(value) {
+  if (value === null || value === void 0) return "";
+  if (Array.isArray(value)) return value.map((entry) => formatValue(entry)).join(",");
+  if (typeof value === "object") return "{\u2026}";
+  return String(value);
+}
+function truncate(text, max) {
+  if (text.length <= max) return text;
+  return `${text.slice(0, Math.max(0, max - 1)).trimEnd()}\u2026`;
+}
+function summarizeSimple(condition) {
+  const operator = condition.operator === "==" ? "=" : condition.operator;
+  if (VALUELESS_OPERATORS.has(condition.operator)) {
+    return `${condition.field} ${operator}`;
+  }
+  const right = condition.valueField ? condition.valueField : formatValue(condition.value);
+  return right ? `${condition.field} ${operator} ${right}` : `${condition.field} ${operator}`;
+}
+function summarizeConditionExpression(condition, maxLength = CONDITION_SUMMARY_MAX_LENGTH) {
+  if (isSimpleLike(condition)) return truncate(summarizeSimple(condition), maxLength);
+  if (isGroupLike(condition)) {
+    const rules = condition.rules;
+    const first = rules.find((rule) => isSimpleLike(rule) || isGroupLike(rule));
+    if (!first) return null;
+    const head = summarizeConditionExpression(first, maxLength);
+    if (!head) return null;
+    const remaining = rules.length - 1;
+    if (remaining <= 0) return head;
+    return truncate(`${head} +${remaining}`, maxLength + 4);
+  }
+  return null;
+}
+function readActivities(raw) {
+  if (!Array.isArray(raw)) return [];
+  const chips = [];
+  raw.forEach((entry, index) => {
+    if (!entry || typeof entry !== "object") return;
+    const activityType = entry.activityType;
+    if (typeof activityType !== "string" || activityType.length === 0) return;
+    const activityId = entry.activityId;
+    chips.push({
+      activityId: typeof activityId === "string" && activityId ? activityId : `${activityType}-${index}`,
+      activityType
+    });
+  });
+  return chips;
+}
+function hasRuleReference(raw) {
+  return Array.isArray(raw) && raw.length > 0;
+}
+function buildRouteChipModel(input) {
+  const conditionSummary = summarizeConditionExpression(input.condition);
+  const allActivities = readActivities(input.activities);
+  const activities = allActivities.slice(0, ROUTE_CHIP_LIMIT);
+  const overflowCount = Math.max(0, allActivities.length - activities.length);
+  const carriesCondition = conditionSummary !== null || hasRuleReference(input.preConditions);
+  const isOtherwise = !carriesCondition && Boolean(input.hasConditionedSibling);
+  return {
+    conditionSummary,
+    activities,
+    overflowCount,
+    isOtherwise,
+    isEmpty: conditionSummary === null && allActivities.length === 0 && !isOtherwise
+  };
+}
+function routeCarriesCondition(input) {
+  return summarizeConditionExpression(input.condition) !== null || hasRuleReference(input.preConditions);
+}
+export {
+  CONDITION_SUMMARY_MAX_LENGTH,
+  ROUTE_CHIP_LIMIT,
+  ROUTE_CHIP_ZOOM_THRESHOLD,
+  buildRouteChipModel,
+  routeCarriesCondition,
+  summarizeConditionExpression
+};
+//# sourceMappingURL=route-chips.js.map

package/dist/modules/workflows/lib/route-chips.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/modules/workflows/lib/route-chips.ts"],
+  "sourcesContent": ["/**\n * Workflows Module - Route Chips (pure)\n *\n * Derives what a transition renders ALONG its edge (spec\n * 2026-07-26-workflows-ux-redesign.md section 4.4, issue #4244): a compact\n * condition summary, the activities that run on the route as icon chips, and\n * the `otherwise` marker for the one unconditioned route of a branching node.\n *\n * The model is DERIVED, never stored: nothing here writes back into edge data\n * or the definition, so chips can never change the saved shape of a workflow.\n * PURE \u2014 no React, no xyflow, no registry: the caller supplies already-read\n * edge data and the activity icon lookup.\n */\n\n/** Activity chips beyond this cap collapse into a single `+N` badge. */\nexport const ROUTE_CHIP_LIMIT = 3\n\n/**\n * Below this canvas zoom the chip row collapses to dots (semantic zoom). Picked\n * so a 60-node flow zoomed out to fit stays readable as structure rather than\n * as a wall of text.\n */\nexport const ROUTE_CHIP_ZOOM_THRESHOLD = 0.6\n\n/** Longest condition summary rendered before it is elided. */\nexport const CONDITION_SUMMARY_MAX_LENGTH = 28\n\nexport type RouteChipSection = 'condition' | 'activities'\n\nexport interface RouteActivityChip {\n  activityId: string\n  activityType: string\n}\n\nexport interface RouteChipModel {\n  conditionSummary: string | null\n  activities: RouteActivityChip[]\n  overflowCount: number\n  isOtherwise: boolean\n  isEmpty: boolean\n}\n\nexport interface RouteChipInput {\n  condition?: unknown\n  preConditions?: unknown\n  activities?: unknown\n  /** True when a sibling route leaving the same step carries a condition. */\n  hasConditionedSibling?: boolean\n}\n\ninterface SimpleConditionLike {\n  field: string\n  operator: string\n  value?: unknown\n  valueField?: string\n}\n\ninterface GroupConditionLike {\n  operator: string\n  rules: unknown[]\n}\n\n/** Operators that read as a complete predicate on their own. */\nconst VALUELESS_OPERATORS = new Set(['IS_EMPTY', 'IS_NOT_EMPTY'])\n\nfunction isGroupLike(value: unknown): value is GroupConditionLike {\n  return Boolean(\n    value &&\n      typeof value === 'object' &&\n      typeof (value as GroupConditionLike).operator === 'string' &&\n      Array.isArray((value as GroupConditionLike).rules),\n  )\n}\n\nfunction isSimpleLike(value: unknown): value is SimpleConditionLike {\n  return Boolean(\n    value &&\n      typeof value === 'object' &&\n      typeof (value as SimpleConditionLike).field === 'string' &&\n      typeof (value as SimpleConditionLike).operator === 'string',\n  )\n}\n\nfunction formatValue(value: unknown): string {\n  if (value === null || value === undefined) return ''\n  if (Array.isArray(value)) return value.map((entry) => formatValue(entry)).join(',')\n  if (typeof value === 'object') return '{\u2026}'\n  return String(value)\n}\n\nfunction truncate(text: string, max: number): string {\n  if (text.length <= max) return text\n  return `${text.slice(0, Math.max(0, max - 1)).trimEnd()}\u2026`\n}\n\nfunction summarizeSimple(condition: SimpleConditionLike): string {\n  const operator = condition.operator === '==' ? '=' : condition.operator\n  if (VALUELESS_OPERATORS.has(condition.operator)) {\n    return `${condition.field} ${operator}`\n  }\n  const right = condition.valueField ? condition.valueField : formatValue(condition.value)\n  return right ? `${condition.field} ${operator} ${right}` : `${condition.field} ${operator}`\n}\n\n/**\n * Compact `field op value` rendering of a business_rules `ConditionExpression`.\n * A group summarises to its first rule plus a `+N` suffix for the rest, which is\n * what makes the chip readable at a glance; the full expression stays one click\n * away in the condition editor. Returns null when there is nothing to show.\n */\nexport function summarizeConditionExpression(\n  condition: unknown,\n  maxLength: number = CONDITION_SUMMARY_MAX_LENGTH,\n): string | null {\n  if (isSimpleLike(condition)) return truncate(summarizeSimple(condition), maxLength)\n\n  if (isGroupLike(condition)) {\n    const rules = condition.rules\n    const first = rules.find((rule) => isSimpleLike(rule) || isGroupLike(rule))\n    if (!first) return null\n    const head = summarizeConditionExpression(first, maxLength)\n    if (!head) return null\n    const remaining = rules.length - 1\n    if (remaining <= 0) return head\n    return truncate(`${head} +${remaining}`, maxLength + 4)\n  }\n\n  return null\n}\n\nfunction readActivities(raw: unknown): RouteActivityChip[] {\n  if (!Array.isArray(raw)) return []\n  const chips: RouteActivityChip[] = []\n  raw.forEach((entry, index) => {\n    if (!entry || typeof entry !== 'object') return\n    const activityType = (entry as { activityType?: unknown }).activityType\n    if (typeof activityType !== 'string' || activityType.length === 0) return\n    const activityId = (entry as { activityId?: unknown }).activityId\n    chips.push({\n      activityId: typeof activityId === 'string' && activityId ? activityId : `${activityType}-${index}`,\n      activityType,\n    })\n  })\n  return chips\n}\n\nfunction hasRuleReference(raw: unknown): boolean {\n  return Array.isArray(raw) && raw.length > 0\n}\n\n/**\n * The chip row for one transition. `isOtherwise` marks the default route: it\n * carries no condition of its own while a sibling leaving the same step does \u2014\n * exactly the `ensureOtherwiseRoute` reading used by branching nodes, computed\n * here from the live graph so it stays true for hand-wired routes too.\n */\nexport function buildRouteChipModel(input: RouteChipInput): RouteChipModel {\n  const conditionSummary = summarizeConditionExpression(input.condition)\n  const allActivities = readActivities(input.activities)\n  const activities = allActivities.slice(0, ROUTE_CHIP_LIMIT)\n  const overflowCount = Math.max(0, allActivities.length - activities.length)\n  const carriesCondition = conditionSummary !== null || hasRuleReference(input.preConditions)\n  const isOtherwise = !carriesCondition && Boolean(input.hasConditionedSibling)\n\n  return {\n    conditionSummary,\n    activities,\n    overflowCount,\n    isOtherwise,\n    isEmpty: conditionSummary === null && allActivities.length === 0 && !isOtherwise,\n  }\n}\n\n/** Route data carries a condition (inline expression or business-rule reference). */\nexport function routeCarriesCondition(input: { condition?: unknown; preConditions?: unknown }): boolean {\n  return summarizeConditionExpression(input.condition) !== null || hasRuleReference(input.preConditions)\n}\n"],
+  "mappings": "AAeO,MAAM,mBAAmB;AAOzB,MAAM,4BAA4B;AAGlC,MAAM,+BAA+B;AAsC5C,MAAM,sBAAsB,oBAAI,IAAI,CAAC,YAAY,cAAc,CAAC;AAEhE,SAAS,YAAY,OAA6C;AAChE,SAAO;AAAA,IACL,SACE,OAAO,UAAU,YACjB,OAAQ,MAA6B,aAAa,YAClD,MAAM,QAAS,MAA6B,KAAK;AAAA,EACrD;AACF;AAEA,SAAS,aAAa,OAA8C;AAClE,SAAO;AAAA,IACL,SACE,OAAO,UAAU,YACjB,OAAQ,MAA8B,UAAU,YAChD,OAAQ,MAA8B,aAAa;AAAA,EACvD;AACF;AAEA,SAAS,YAAY,OAAwB;AAC3C,MAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,IAAI,CAAC,UAAU,YAAY,KAAK,CAAC,EAAE,KAAK,GAAG;AAClF,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,SAAO,OAAO,KAAK;AACrB;AAEA,SAAS,SAAS,MAAc,KAAqB;AACnD,MAAI,KAAK,UAAU,IAAK,QAAO;AAC/B,SAAO,GAAG,KAAK,MAAM,GAAG,KAAK,IAAI,GAAG,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC;AACzD;AAEA,SAAS,gBAAgB,WAAwC;AAC/D,QAAM,WAAW,UAAU,aAAa,OAAO,MAAM,UAAU;AAC/D,MAAI,oBAAoB,IAAI,UAAU,QAAQ,GAAG;AAC/C,WAAO,GAAG,UAAU,KAAK,IAAI,QAAQ;AAAA,EACvC;AACA,QAAM,QAAQ,UAAU,aAAa,UAAU,aAAa,YAAY,UAAU,KAAK;AACvF,SAAO,QAAQ,GAAG,UAAU,KAAK,IAAI,QAAQ,IAAI,KAAK,KAAK,GAAG,UAAU,KAAK,IAAI,QAAQ;AAC3F;AAQO,SAAS,6BACd,WACA,YAAoB,8BACL;AACf,MAAI,aAAa,SAAS,EAAG,QAAO,SAAS,gBAAgB,SAAS,GAAG,SAAS;AAElF,MAAI,YAAY,SAAS,GAAG;AAC1B,UAAM,QAAQ,UAAU;AACxB,UAAM,QAAQ,MAAM,KAAK,CAAC,SAAS,aAAa,IAAI,KAAK,YAAY,IAAI,CAAC;AAC1E,QAAI,CAAC,MAAO,QAAO;AACnB,UAAM,OAAO,6BAA6B,OAAO,SAAS;AAC1D,QAAI,CAAC,KAAM,QAAO;AAClB,UAAM,YAAY,MAAM,SAAS;AACjC,QAAI,aAAa,EAAG,QAAO;AAC3B,WAAO,SAAS,GAAG,IAAI,KAAK,SAAS,IAAI,YAAY,CAAC;AAAA,EACxD;AAEA,SAAO;AACT;AAEA,SAAS,eAAe,KAAmC;AACzD,MAAI,CAAC,MAAM,QAAQ,GAAG,EAAG,QAAO,CAAC;AACjC,QAAM,QAA6B,CAAC;AACpC,MAAI,QAAQ,CAAC,OAAO,UAAU;AAC5B,QAAI,CAAC,SAAS,OAAO,UAAU,SAAU;AACzC,UAAM,eAAgB,MAAqC;AAC3D,QAAI,OAAO,iBAAiB,YAAY,aAAa,WAAW,EAAG;AACnE,UAAM,aAAc,MAAmC;AACvD,UAAM,KAAK;AAAA,MACT,YAAY,OAAO,eAAe,YAAY,aAAa,aAAa,GAAG,YAAY,IAAI,KAAK;AAAA,MAChG;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AACD,SAAO;AACT;AAEA,SAAS,iBAAiB,KAAuB;AAC/C,SAAO,MAAM,QAAQ,GAAG,KAAK,IAAI,SAAS;AAC5C;AAQO,SAAS,oBAAoB,OAAuC;AACzE,QAAM,mBAAmB,6BAA6B,MAAM,SAAS;AACrE,QAAM,gBAAgB,eAAe,MAAM,UAAU;AACrD,QAAM,aAAa,cAAc,MAAM,GAAG,gBAAgB;AAC1D,QAAM,gBAAgB,KAAK,IAAI,GAAG,cAAc,SAAS,WAAW,MAAM;AAC1E,QAAM,mBAAmB,qBAAqB,QAAQ,iBAAiB,MAAM,aAAa;AAC1F,QAAM,cAAc,CAAC,oBAAoB,QAAQ,MAAM,qBAAqB;AAE5E,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,qBAAqB,QAAQ,cAAc,WAAW,KAAK,CAAC;AAAA,EACvE;AACF;AAGO,SAAS,sBAAsB,OAAkE;AACtG,SAAO,6BAA6B,MAAM,SAAS,MAAM,QAAQ,iBAAiB,MAAM,aAAa;AACvG;",
+  "names": []
+}

package/dist/modules/workflows/lib/route-edge.js

@@ -0,0 +1,17 @@
+const WORKFLOW_TRANSITION_EDGE_TYPE = "workflowTransition";
+function buildWorkflowRouteEdge(input) {
+  return {
+    id: input.id,
+    source: input.source,
+    target: input.target,
+    type: WORKFLOW_TRANSITION_EDGE_TYPE,
+    ...input.sourceHandle ? { sourceHandle: input.sourceHandle } : {},
+    ...input.targetHandle ? { targetHandle: input.targetHandle } : {},
+    data: input.data ?? {}
+  };
+}
+export {
+  WORKFLOW_TRANSITION_EDGE_TYPE,
+  buildWorkflowRouteEdge
+};
+//# sourceMappingURL=route-edge.js.map