@shware/workflow 2.0.0 → 3.0.0

package/dist/dsl/bundle.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"bundle.mjs","names":["BundleIRSchema"],"sources":["../../src/dsl/bundle.ts"],"sourcesContent":["import { semanticHash } from '../hash';\nimport {\n  type BundleIR,\n  BundleIR as BundleIRSchema,\n  type ConditionIR,\n  IR_VERSION,\n  type NodeIR,\n  type SegmentIR,\n  type WorkflowIR,\n} from '../ir';\nimport { type AnyTemplate, CHANNEL_OF } from '../templates';\nimport type { ActionRef } from './action';\nimport type { SegmentInternal, SegmentRef } from './condition';\nimport type { WorkflowBuilder } from './workflow';\n\n/**\n * The deployment unit — compileBundle gathers workflows, segments and the\n * template manifest into one BundleIR snapshot (terraform-apply mental model);\n * the server diffs each definition by contentHash (see plan.ts).\n */\nexport function compileBundle(input: {\n  workflows: readonly WorkflowBuilder[];\n  segments?: readonly SegmentRef[];\n  /** The template manifest: these definitions, by channel and id. */\n  templates?: readonly AnyTemplate[];\n  actions?: readonly ActionRef<object>[];\n}): BundleIR {\n  const segments = (input.segments ?? []).map((segment) => {\n    const { id, definition, loc, meta } = segment as SegmentInternal;\n    const compiled: SegmentIR = {\n      irVersion: IR_VERSION,\n      id,\n      // Labels and provenance both live in meta, which stripMeta drops before hashing\n      contentHash: semanticHash(definition),\n      condition: definition,\n    };\n    const merged = {\n      ...(meta?.name !== undefined ? { name: meta.name } : {}),\n      ...(meta?.description !== undefined ? { description: meta.description } : {}),\n      ...(loc !== undefined ? { loc } : {}),\n    };\n    if (Object.keys(merged).length > 0) compiled.meta = merged;\n    return compiled;\n  });\n\n  const templates = (input.templates ?? []).map((template) => ({\n    irVersion: IR_VERSION,\n    key: template.id,\n    channel: CHANNEL_OF[template.kind],\n  }));\n\n  // Manifest only — name and code-identity hash; the implementation ships in the Worker bundle, never in IR\n  const actions = (input.actions ?? []).map((a) => ({\n    irVersion: IR_VERSION,\n    name: a.name,\n    codeHash: a.codeHash,\n  }));\n\n  const workflows = input.workflows.map((builder) => builder.toIR());\n\n  // Names are wire identity (routing tables, entry ledger, by-name refs):\n  // duplicates would silently last-write-win on deploy, so fail the compile.\n  assertUniqueNames(\n    workflows.map((w) => w.id),\n    'workflow'\n  );\n  assertUniqueNames(\n    segments.map((s) => s.id),\n    'segment'\n  );\n  // A message node names its template by channel and key, so the key is unique per channel:\n  // an email and a push of one nudge may share it\n  assertUniqueNames(\n    templates.map((t) => `${t.channel}:${t.key}`),\n    'template'\n  );\n  assertUniqueNames(\n    actions.map((a) => a.name),\n    'action'\n  );\n\n  // Deploy replaces the whole segment table, so every by-name reference must\n  // resolve inside this bundle — catching it here turns a runtime \"Unknown\n  // segment\" in some user's journey into a compile error.\n  assertSegmentRefsResolve(workflows, segments);\n\n  // Payload predicates and profile predicates share the Condition type, so\n  // placement is checked here: payload only inside where-trees, and where-trees\n  // contain nothing but payload predicates and combinators.\n  assertConditionPlacement(workflows, segments);\n\n  // Same rationale as segments: the runtime registry is looked up by name, so\n  // an action a workflow runs must be in the bundle — and its codeHash must\n  // agree, or two same-named definitions are competing for one identity.\n  assertActionRefsResolve(workflows, actions);\n\n  return BundleIRSchema.parse({ irVersion: IR_VERSION, workflows, segments, templates, actions });\n}\n\nfunction assertUniqueNames(names: readonly string[], kind: string): void {\n  const seen = new Set<string>();\n  for (const name of names) {\n    if (seen.has(name)) throw new Error(`compileBundle: duplicate ${kind} name '${name}'`);\n    seen.add(name);\n  }\n}\n\nfunction assertSegmentRefsResolve(\n  workflows: readonly WorkflowIR[],\n  segments: readonly SegmentIR[]\n): void {\n  const defined = new Set(segments.map((s) => s.id));\n  const check = (refs: ReadonlySet<string>, owner: string): void => {\n    for (const ref of refs) {\n      if (!defined.has(ref)) {\n        throw new Error(\n          `compileBundle: ${owner} references segment '${ref}' that is not in the bundle — pass it in 'segments'`\n        );\n      }\n    }\n  };\n  for (const workflow of workflows) {\n    check(referencedSegments(workflow), `workflow '${workflow.id}'`);\n  }\n  // Segments may reference other segments; those must resolve too\n  for (const segment of segments) {\n    const refs = new Set<string>();\n    collectConditionRefs(segment.condition, refs);\n    check(refs, `segment '${segment.id}'`);\n  }\n}\n\nfunction referencedSegments(workflow: WorkflowIR): Set<string> {\n  const refs = new Set<string>();\n  if (workflow.trigger.type === 'segment') refs.add(workflow.trigger.segment);\n  if (workflow.trigger.type === 'event' && workflow.trigger.filter !== undefined) {\n    collectConditionRefs(workflow.trigger.filter, refs);\n  }\n  if (workflow.goal !== undefined) collectConditionRefs(workflow.goal.condition, refs);\n  if (workflow.exitWhen !== undefined) collectConditionRefs(workflow.exitWhen, refs);\n  collectNodeRefs(workflow.flow, refs);\n  return refs;\n}\n\nfunction collectConditionRefs(condition: ConditionIR, into: Set<string>): void {\n  switch (condition.type) {\n    case 'and':\n    case 'or':\n      for (const child of condition.conditions) collectConditionRefs(child, into);\n      break;\n    case 'not':\n      collectConditionRefs(condition.condition, into);\n      break;\n    case 'segment':\n      into.add(condition.segment);\n      break;\n    default:\n      break;\n  }\n}\n\nfunction collectNodeRefs(nodes: readonly NodeIR[], into: Set<string>): void {\n  for (const node of nodes) {\n    switch (node.type) {\n      case 'wait_until':\n        collectConditionRefs(node.condition, into);\n        if (Array.isArray(node.onTimeout)) collectNodeRefs(node.onTimeout, into);\n        break;\n      case 'branch':\n        for (const branchCase of node.cases) {\n          collectConditionRefs(branchCase.condition, into);\n          collectNodeRefs(branchCase.flow, into);\n        }\n        if (node.otherwise) collectNodeRefs(node.otherwise, into);\n        break;\n      case 'filter':\n        collectConditionRefs(node.condition, into);\n        break;\n      case 'cohort':\n        for (const arm of node.arms) collectNodeRefs(arm.flow, into);\n        break;\n      default:\n        break;\n    }\n  }\n}\n\nfunction assertActionRefsResolve(\n  workflows: readonly WorkflowIR[],\n  actions: readonly { name: string; codeHash: string }[]\n): void {\n  const defined = new Map(actions.map((a) => [a.name, a.codeHash]));\n  for (const workflow of workflows) {\n    const used = new Map<string, Set<string | undefined>>();\n    collectActionRefs(workflow.flow, used);\n    for (const [name, codeHashes] of used) {\n      const manifestHash = defined.get(name);\n      if (manifestHash === undefined) {\n        throw new Error(\n          `compileBundle: workflow '${workflow.id}' runs action '${name}' that is not in the bundle — pass it in 'actions'`\n        );\n      }\n      // Every node's hash is checked, not just one per name: with two\n      // definitions under one name, whichever the manifest holds, the *other*\n      // node is the one that would meet a mismatched implementation at run time.\n      for (const codeHash of codeHashes) {\n        if (codeHash !== undefined && codeHash !== manifestHash) {\n          throw new Error(\n            `compileBundle: workflow '${workflow.id}' runs action '${name}' whose code differs from the one in 'actions' — two definitions are sharing that name`\n          );\n        }\n      }\n    }\n  }\n}\n\n/** name → every codeHash seen under it; a name with two is exactly the case worth failing on. */\nfunction collectActionRefs(\n  nodes: readonly NodeIR[],\n  into: Map<string, Set<string | undefined>>\n): void {\n  for (const node of nodes) {\n    switch (node.type) {\n      case 'action': {\n        const seen = into.get(node.action) ?? new Set<string | undefined>();\n        seen.add(node.codeHash);\n        into.set(node.action, seen);\n        break;\n      }\n      case 'wait_until':\n        if (Array.isArray(node.onTimeout)) collectActionRefs(node.onTimeout, into);\n        break;\n      case 'branch':\n        for (const branchCase of node.cases) collectActionRefs(branchCase.flow, into);\n        if (node.otherwise) collectActionRefs(node.otherwise, into);\n        break;\n      case 'cohort':\n        for (const arm of node.arms) collectActionRefs(arm.flow, into);\n        break;\n      default:\n        break;\n    }\n  }\n}\n\n/* --------------------- payload / profile placement checks --------------------- */\n\nfunction assertConditionPlacement(\n  workflows: readonly WorkflowIR[],\n  segments: readonly SegmentIR[]\n): void {\n  for (const workflow of workflows) {\n    if (workflow.trigger.type === 'event') {\n      if (workflow.trigger.where !== undefined) {\n        assertWhereTree(workflow.trigger.where, `workflow '${workflow.id}' trigger where`);\n      }\n      if (workflow.trigger.filter !== undefined) {\n        assertProfileTree(workflow.trigger.filter, `workflow '${workflow.id}' trigger filter`);\n      }\n    }\n    if (workflow.goal !== undefined) {\n      assertProfileTree(workflow.goal.condition, `workflow '${workflow.id}' goal`);\n    }\n    if (workflow.exitWhen !== undefined) {\n      assertProfileTree(workflow.exitWhen, `workflow '${workflow.id}' exitWhen`);\n    }\n    assertNodeTrees(workflow.flow, `workflow '${workflow.id}'`);\n  }\n  for (const segment of segments) {\n    assertProfileTree(segment.condition, `segment '${segment.id}'`);\n  }\n}\n\n/** A profile-context tree: payload predicates may appear only under a performed.where. */\nfunction assertProfileTree(condition: ConditionIR, owner: string): void {\n  switch (condition.type) {\n    case 'and':\n    case 'or':\n      for (const child of condition.conditions) assertProfileTree(child, owner);\n      break;\n    case 'not':\n      assertProfileTree(condition.condition, owner);\n      break;\n    case 'performed':\n      if (condition.where !== undefined) assertWhereTree(condition.where, owner);\n      break;\n    case 'payload':\n      throw new Error(\n        `compileBundle: ${owner} uses a payload predicate outside a where clause — payload refs are only valid inside performed({ where }) or trigger.event({ where })`\n      );\n    default:\n      break; // property / segment\n  }\n}\n\n/** A where tree: payload predicates and combinators only — no profile facts in event scope. */\nfunction assertWhereTree(condition: ConditionIR, owner: string): void {\n  switch (condition.type) {\n    case 'and':\n    case 'or':\n      for (const child of condition.conditions) assertWhereTree(child, owner);\n      break;\n    case 'not':\n      assertWhereTree(condition.condition, owner);\n      break;\n    case 'payload':\n      break;\n    default:\n      throw new Error(\n        `compileBundle: ${owner} where clause may only contain payload predicates and and/or/not, found '${condition.type}'`\n      );\n  }\n}\n\nfunction assertNodeTrees(nodes: readonly NodeIR[], owner: string): void {\n  for (const node of nodes) {\n    switch (node.type) {\n      case 'wait_until':\n        assertProfileTree(node.condition, owner);\n        if (Array.isArray(node.onTimeout)) assertNodeTrees(node.onTimeout, owner);\n        break;\n      case 'branch':\n        for (const branchCase of node.cases) {\n          assertProfileTree(branchCase.condition, owner);\n          assertNodeTrees(branchCase.flow, owner);\n        }\n        if (node.otherwise) assertNodeTrees(node.otherwise, owner);\n        break;\n      case 'filter':\n        assertProfileTree(node.condition, owner);\n        break;\n      case 'cohort':\n        for (const arm of node.arms) assertNodeTrees(arm.flow, owner);\n        break;\n      default:\n        break;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;AAoBA,SAAgB,cAAc,OAMjB;CACX,MAAM,YAAY,MAAM,YAAY,CAAC,EAAA,CAAG,KAAK,YAAY;EACvD,MAAM,EAAE,IAAI,YAAY,KAAK,SAAS;EACtC,MAAM,WAAsB;GAC1B,WAAA;GACA;GAEA,aAAa,aAAa,UAAU;GACpC,WAAW;EACb;EACA,MAAM,SAAS;GACb,GAAI,MAAM,SAAS,KAAA,IAAY,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;GACtD,GAAI,MAAM,gBAAgB,KAAA,IAAY,EAAE,aAAa,KAAK,YAAY,IAAI,CAAC;GAC3E,GAAI,QAAQ,KAAA,IAAY,EAAE,IAAI,IAAI,CAAC;EACrC;EACA,IAAI,OAAO,KAAK,MAAM,CAAC,CAAC,SAAS,GAAG,SAAS,OAAO;EACpD,OAAO;CACT,CAAC;CAED,MAAM,aAAa,MAAM,aAAa,CAAC,EAAA,CAAG,KAAK,cAAc;EAC3D,WAAA;EACA,KAAK,SAAS;EACd,SAAS,WAAW,SAAS;CAC/B,EAAE;CAGF,MAAM,WAAW,MAAM,WAAW,CAAC,EAAA,CAAG,KAAK,OAAO;EAChD,WAAA;EACA,MAAM,EAAE;EACR,UAAU,EAAE;CACd,EAAE;CAEF,MAAM,YAAY,MAAM,UAAU,KAAK,YAAY,QAAQ,KAAK,CAAC;CAIjE,kBACE,UAAU,KAAK,MAAM,EAAE,EAAE,GACzB,UACF;CACA,kBACE,SAAS,KAAK,MAAM,EAAE,EAAE,GACxB,SACF;CAGA,kBACE,UAAU,KAAK,MAAM,GAAG,EAAE,QAAQ,GAAG,EAAE,KAAK,GAC5C,UACF;CACA,kBACE,QAAQ,KAAK,MAAM,EAAE,IAAI,GACzB,QACF;CAKA,yBAAyB,WAAW,QAAQ;CAK5C,yBAAyB,WAAW,QAAQ;CAK5C,wBAAwB,WAAW,OAAO;CAE1C,OAAOA,SAAe,MAAM;EAAE,WAAA;EAAuB;EAAW;EAAU;EAAW;CAAQ,CAAC;AAChG;AAEA,SAAS,kBAAkB,OAA0B,MAAoB;CACvE,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,IAAI,IAAI,GAAG,MAAM,IAAI,MAAM,4BAA4B,KAAK,SAAS,KAAK,EAAE;EACrF,KAAK,IAAI,IAAI;CACf;AACF;AAEA,SAAS,yBACP,WACA,UACM;CACN,MAAM,UAAU,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,EAAE,CAAC;CACjD,MAAM,SAAS,MAA2B,UAAwB;EAChE,KAAK,MAAM,OAAO,MAChB,IAAI,CAAC,QAAQ,IAAI,GAAG,GAClB,MAAM,IAAI,MACR,kBAAkB,MAAM,uBAAuB,IAAI,oDACrD;CAGN;CACA,KAAK,MAAM,YAAY,WACrB,MAAM,mBAAmB,QAAQ,GAAG,aAAa,SAAS,GAAG,EAAE;CAGjE,KAAK,MAAM,WAAW,UAAU;EAC9B,MAAM,uBAAO,IAAI,IAAY;EAC7B,qBAAqB,QAAQ,WAAW,IAAI;EAC5C,MAAM,MAAM,YAAY,QAAQ,GAAG,EAAE;CACvC;AACF;AAEA,SAAS,mBAAmB,UAAmC;CAC7D,MAAM,uBAAO,IAAI,IAAY;CAC7B,IAAI,SAAS,QAAQ,SAAS,WAAW,KAAK,IAAI,SAAS,QAAQ,OAAO;CAC1E,IAAI,SAAS,QAAQ,SAAS,WAAW,SAAS,QAAQ,WAAW,KAAA,GACnE,qBAAqB,SAAS,QAAQ,QAAQ,IAAI;CAEpD,IAAI,SAAS,SAAS,KAAA,GAAW,qBAAqB,SAAS,KAAK,WAAW,IAAI;CACnF,IAAI,SAAS,aAAa,KAAA,GAAW,qBAAqB,SAAS,UAAU,IAAI;CACjF,gBAAgB,SAAS,MAAM,IAAI;CACnC,OAAO;AACT;AAEA,SAAS,qBAAqB,WAAwB,MAAyB;CAC7E,QAAQ,UAAU,MAAlB;EACE,KAAK;EACL,KAAK;GACH,KAAK,MAAM,SAAS,UAAU,YAAY,qBAAqB,OAAO,IAAI;GAC1E;EACF,KAAK;GACH,qBAAqB,UAAU,WAAW,IAAI;GAC9C;EACF,KAAK,WACH,KAAK,IAAI,UAAU,OAAO;CAI9B;AACF;AAEA,SAAS,gBAAgB,OAA0B,MAAyB;CAC1E,KAAK,MAAM,QAAQ,OACjB,QAAQ,KAAK,MAAb;EACE,KAAK;GACH,qBAAqB,KAAK,WAAW,IAAI;GACzC,IAAI,MAAM,QAAQ,KAAK,SAAS,GAAG,gBAAgB,KAAK,WAAW,IAAI;GACvE;EACF,KAAK;GACH,KAAK,MAAM,cAAc,KAAK,OAAO;IACnC,qBAAqB,WAAW,WAAW,IAAI;IAC/C,gBAAgB,WAAW,MAAM,IAAI;GACvC;GACA,IAAI,KAAK,WAAW,gBAAgB,KAAK,WAAW,IAAI;GACxD;EACF,KAAK;GACH,qBAAqB,KAAK,WAAW,IAAI;GACzC;EACF,KAAK,UACH,KAAK,MAAM,OAAO,KAAK,MAAM,gBAAgB,IAAI,MAAM,IAAI;CAI/D;AAEJ;AAEA,SAAS,wBACP,WACA,SACM;CACN,MAAM,UAAU,IAAI,IAAI,QAAQ,KAAK,MAAM,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;CAChE,KAAK,MAAM,YAAY,WAAW;EAChC,MAAM,uBAAO,IAAI,IAAqC;EACtD,kBAAkB,SAAS,MAAM,IAAI;EACrC,KAAK,MAAM,CAAC,MAAM,eAAe,MAAM;GACrC,MAAM,eAAe,QAAQ,IAAI,IAAI;GACrC,IAAI,iBAAiB,KAAA,GACnB,MAAM,IAAI,MACR,4BAA4B,SAAS,GAAG,iBAAiB,KAAK,mDAChE;GAKF,KAAK,MAAM,YAAY,YACrB,IAAI,aAAa,KAAA,KAAa,aAAa,cACzC,MAAM,IAAI,MACR,4BAA4B,SAAS,GAAG,iBAAiB,KAAK,uFAChE;EAGN;CACF;AACF;;AAGA,SAAS,kBACP,OACA,MACM;CACN,KAAK,MAAM,QAAQ,OACjB,QAAQ,KAAK,MAAb;EACE,KAAK,UAAU;GACb,MAAM,OAAO,KAAK,IAAI,KAAK,MAAM,qBAAK,IAAI,IAAwB;GAClE,KAAK,IAAI,KAAK,QAAQ;GACtB,KAAK,IAAI,KAAK,QAAQ,IAAI;GAC1B;EACF;EACA,KAAK;GACH,IAAI,MAAM,QAAQ,KAAK,SAAS,GAAG,kBAAkB,KAAK,WAAW,IAAI;GACzE;EACF,KAAK;GACH,KAAK,MAAM,cAAc,KAAK,OAAO,kBAAkB,WAAW,MAAM,IAAI;GAC5E,IAAI,KAAK,WAAW,kBAAkB,KAAK,WAAW,IAAI;GAC1D;EACF,KAAK,UACH,KAAK,MAAM,OAAO,KAAK,MAAM,kBAAkB,IAAI,MAAM,IAAI;CAIjE;AAEJ;AAIA,SAAS,yBACP,WACA,UACM;CACN,KAAK,MAAM,YAAY,WAAW;EAChC,IAAI,SAAS,QAAQ,SAAS,SAAS;GACrC,IAAI,SAAS,QAAQ,UAAU,KAAA,GAC7B,gBAAgB,SAAS,QAAQ,OAAO,aAAa,SAAS,GAAG,gBAAgB;GAEnF,IAAI,SAAS,QAAQ,WAAW,KAAA,GAC9B,kBAAkB,SAAS,QAAQ,QAAQ,aAAa,SAAS,GAAG,iBAAiB;EAEzF;EACA,IAAI,SAAS,SAAS,KAAA,GACpB,kBAAkB,SAAS,KAAK,WAAW,aAAa,SAAS,GAAG,OAAO;EAE7E,IAAI,SAAS,aAAa,KAAA,GACxB,kBAAkB,SAAS,UAAU,aAAa,SAAS,GAAG,WAAW;EAE3E,gBAAgB,SAAS,MAAM,aAAa,SAAS,GAAG,EAAE;CAC5D;CACA,KAAK,MAAM,WAAW,UACpB,kBAAkB,QAAQ,WAAW,YAAY,QAAQ,GAAG,EAAE;AAElE;;AAGA,SAAS,kBAAkB,WAAwB,OAAqB;CACtE,QAAQ,UAAU,MAAlB;EACE,KAAK;EACL,KAAK;GACH,KAAK,MAAM,SAAS,UAAU,YAAY,kBAAkB,OAAO,KAAK;GACxE;EACF,KAAK;GACH,kBAAkB,UAAU,WAAW,KAAK;GAC5C;EACF,KAAK;GACH,IAAI,UAAU,UAAU,KAAA,GAAW,gBAAgB,UAAU,OAAO,KAAK;GACzE;EACF,KAAK,WACH,MAAM,IAAI,MACR,kBAAkB,MAAM,uIAC1B;CAGJ;AACF;;AAGA,SAAS,gBAAgB,WAAwB,OAAqB;CACpE,QAAQ,UAAU,MAAlB;EACE,KAAK;EACL,KAAK;GACH,KAAK,MAAM,SAAS,UAAU,YAAY,gBAAgB,OAAO,KAAK;GACtE;EACF,KAAK;GACH,gBAAgB,UAAU,WAAW,KAAK;GAC1C;EACF,KAAK,WACH;EACF,SACE,MAAM,IAAI,MACR,kBAAkB,MAAM,2EAA2E,UAAU,KAAK,EACpH;CACJ;AACF;AAEA,SAAS,gBAAgB,OAA0B,OAAqB;CACtE,KAAK,MAAM,QAAQ,OACjB,QAAQ,KAAK,MAAb;EACE,KAAK;GACH,kBAAkB,KAAK,WAAW,KAAK;GACvC,IAAI,MAAM,QAAQ,KAAK,SAAS,GAAG,gBAAgB,KAAK,WAAW,KAAK;GACxE;EACF,KAAK;GACH,KAAK,MAAM,cAAc,KAAK,OAAO;IACnC,kBAAkB,WAAW,WAAW,KAAK;IAC7C,gBAAgB,WAAW,MAAM,KAAK;GACxC;GACA,IAAI,KAAK,WAAW,gBAAgB,KAAK,WAAW,KAAK;GACzD;EACF,KAAK;GACH,kBAAkB,KAAK,WAAW,KAAK;GACvC;EACF,KAAK,UACH,KAAK,MAAM,OAAO,KAAK,MAAM,gBAAgB,IAAI,MAAM,KAAK;CAIhE;AAEJ"}
+{"version":3,"file":"bundle.mjs","names":["BundleIRSchema"],"sources":["../../src/dsl/bundle.ts"],"sourcesContent":["import { semanticHash } from '../hash';\nimport {\n  type BundleIR,\n  BundleIR as BundleIRSchema,\n  type ConditionIR,\n  IR_VERSION,\n  type NodeIR,\n  type SegmentIR,\n  type WorkflowIR,\n} from '../ir';\nimport { type AnyTemplate, CHANNEL_OF } from '../templates';\nimport type { ActionRef } from './action';\nimport type { SegmentInternal, SegmentRef } from './condition';\nimport type { WorkflowBuilder } from './workflow';\n\n/**\n * The deployment unit — compileBundle gathers workflows, segments and the\n * template manifest into one BundleIR snapshot (terraform-apply mental model);\n * the server diffs each definition by contentHash (see plan.ts).\n */\nexport function compileBundle(input: {\n  workflows: readonly WorkflowBuilder[];\n  segments?: readonly SegmentRef[];\n  /** The template manifest: these definitions, by channel and id. */\n  templates?: readonly AnyTemplate[];\n  actions?: readonly ActionRef[];\n}): BundleIR {\n  const segments = (input.segments ?? []).map((segment) => {\n    const { id, definition, loc, meta } = segment as SegmentInternal;\n    const compiled: SegmentIR = {\n      irVersion: IR_VERSION,\n      id,\n      // Labels and provenance both live in meta, which stripMeta drops before hashing\n      contentHash: semanticHash(definition),\n      condition: definition,\n    };\n    const merged = {\n      ...(meta?.name !== undefined ? { name: meta.name } : {}),\n      ...(meta?.description !== undefined ? { description: meta.description } : {}),\n      ...(loc !== undefined ? { loc } : {}),\n    };\n    if (Object.keys(merged).length > 0) compiled.meta = merged;\n    return compiled;\n  });\n\n  const templates = (input.templates ?? []).map((template) => ({\n    irVersion: IR_VERSION,\n    key: template.id,\n    channel: CHANNEL_OF[template.kind],\n  }));\n\n  // Manifest only — name and code-identity hash; the implementation ships in the Worker bundle, never in IR\n  const actions = (input.actions ?? []).map((a) => ({\n    irVersion: IR_VERSION,\n    name: a.name,\n    codeHash: a.codeHash,\n  }));\n\n  const workflows = input.workflows.map((builder) => builder.toIR());\n\n  // Names are wire identity (routing tables, entry ledger, by-name refs):\n  // duplicates would silently last-write-win on deploy, so fail the compile.\n  assertUniqueNames(\n    workflows.map((w) => w.id),\n    'workflow'\n  );\n  assertUniqueNames(\n    segments.map((s) => s.id),\n    'segment'\n  );\n  // A message node names its template by channel and key, so the key is unique per channel:\n  // an email and a push of one nudge may share it\n  assertUniqueNames(\n    templates.map((t) => `${t.channel}:${t.key}`),\n    'template'\n  );\n  assertUniqueNames(\n    actions.map((a) => a.name),\n    'action'\n  );\n\n  // Deploy replaces the whole segment table, so every by-name reference must\n  // resolve inside this bundle — catching it here turns a runtime \"Unknown\n  // segment\" in some user's journey into a compile error.\n  assertSegmentRefsResolve(workflows, segments);\n\n  // Payload predicates and profile predicates share the Condition type, so\n  // placement is checked here: payload only inside where-trees, and where-trees\n  // contain nothing but payload predicates and combinators.\n  assertConditionPlacement(workflows, segments);\n\n  // Same rationale as segments: the runtime registry is looked up by name, so\n  // an action a workflow runs must be in the bundle — and its codeHash must\n  // agree, or two same-named definitions are competing for one identity.\n  assertActionRefsResolve(workflows, actions);\n\n  return BundleIRSchema.parse({ irVersion: IR_VERSION, workflows, segments, templates, actions });\n}\n\nfunction assertUniqueNames(names: readonly string[], kind: string): void {\n  const seen = new Set<string>();\n  for (const name of names) {\n    if (seen.has(name)) throw new Error(`compileBundle: duplicate ${kind} name '${name}'`);\n    seen.add(name);\n  }\n}\n\nfunction assertSegmentRefsResolve(\n  workflows: readonly WorkflowIR[],\n  segments: readonly SegmentIR[]\n): void {\n  const defined = new Set(segments.map((s) => s.id));\n  const check = (refs: ReadonlySet<string>, owner: string): void => {\n    for (const ref of refs) {\n      if (!defined.has(ref)) {\n        throw new Error(\n          `compileBundle: ${owner} references segment '${ref}' that is not in the bundle — pass it in 'segments'`\n        );\n      }\n    }\n  };\n  for (const workflow of workflows) {\n    check(referencedSegments(workflow), `workflow '${workflow.id}'`);\n  }\n  // Segments may reference other segments; those must resolve too\n  for (const segment of segments) {\n    const refs = new Set<string>();\n    collectConditionRefs(segment.condition, refs);\n    check(refs, `segment '${segment.id}'`);\n  }\n}\n\nfunction referencedSegments(workflow: WorkflowIR): Set<string> {\n  const refs = new Set<string>();\n  if (workflow.trigger.type === 'segment') refs.add(workflow.trigger.segment);\n  if (workflow.trigger.type === 'event' && workflow.trigger.filter !== undefined) {\n    collectConditionRefs(workflow.trigger.filter, refs);\n  }\n  if (workflow.goal !== undefined) collectConditionRefs(workflow.goal.condition, refs);\n  if (workflow.exitWhen !== undefined) collectConditionRefs(workflow.exitWhen, refs);\n  collectNodeRefs(workflow.flow, refs);\n  return refs;\n}\n\nfunction collectConditionRefs(condition: ConditionIR, into: Set<string>): void {\n  switch (condition.type) {\n    case 'and':\n    case 'or':\n      for (const child of condition.conditions) collectConditionRefs(child, into);\n      break;\n    case 'not':\n      collectConditionRefs(condition.condition, into);\n      break;\n    case 'segment':\n      into.add(condition.segment);\n      break;\n    default:\n      break;\n  }\n}\n\nfunction collectNodeRefs(nodes: readonly NodeIR[], into: Set<string>): void {\n  for (const node of nodes) {\n    switch (node.type) {\n      case 'wait_until':\n        collectConditionRefs(node.condition, into);\n        if (Array.isArray(node.onTimeout)) collectNodeRefs(node.onTimeout, into);\n        break;\n      case 'branch':\n        for (const branchCase of node.cases) {\n          collectConditionRefs(branchCase.condition, into);\n          collectNodeRefs(branchCase.flow, into);\n        }\n        if (node.otherwise) collectNodeRefs(node.otherwise, into);\n        break;\n      case 'filter':\n        collectConditionRefs(node.condition, into);\n        break;\n      case 'cohort':\n        for (const arm of node.arms) collectNodeRefs(arm.flow, into);\n        break;\n      default:\n        break;\n    }\n  }\n}\n\nfunction assertActionRefsResolve(\n  workflows: readonly WorkflowIR[],\n  actions: readonly { name: string; codeHash: string }[]\n): void {\n  const defined = new Map(actions.map((a) => [a.name, a.codeHash]));\n  for (const workflow of workflows) {\n    const used = new Map<string, Set<string | undefined>>();\n    collectActionRefs(workflow.flow, used);\n    for (const [name, codeHashes] of used) {\n      const manifestHash = defined.get(name);\n      if (manifestHash === undefined) {\n        throw new Error(\n          `compileBundle: workflow '${workflow.id}' runs action '${name}' that is not in the bundle — pass it in 'actions'`\n        );\n      }\n      // Every node's hash is checked, not just one per name: with two\n      // definitions under one name, whichever the manifest holds, the *other*\n      // node is the one that would meet a mismatched implementation at run time.\n      for (const codeHash of codeHashes) {\n        if (codeHash !== undefined && codeHash !== manifestHash) {\n          throw new Error(\n            `compileBundle: workflow '${workflow.id}' runs action '${name}' whose code differs from the one in 'actions' — two definitions are sharing that name`\n          );\n        }\n      }\n    }\n  }\n}\n\n/** name → every codeHash seen under it; a name with two is exactly the case worth failing on. */\nfunction collectActionRefs(\n  nodes: readonly NodeIR[],\n  into: Map<string, Set<string | undefined>>\n): void {\n  for (const node of nodes) {\n    switch (node.type) {\n      case 'action': {\n        const seen = into.get(node.action) ?? new Set<string | undefined>();\n        seen.add(node.codeHash);\n        into.set(node.action, seen);\n        break;\n      }\n      case 'wait_until':\n        if (Array.isArray(node.onTimeout)) collectActionRefs(node.onTimeout, into);\n        break;\n      case 'branch':\n        for (const branchCase of node.cases) collectActionRefs(branchCase.flow, into);\n        if (node.otherwise) collectActionRefs(node.otherwise, into);\n        break;\n      case 'cohort':\n        for (const arm of node.arms) collectActionRefs(arm.flow, into);\n        break;\n      default:\n        break;\n    }\n  }\n}\n\n/* --------------------- payload / profile placement checks --------------------- */\n\nfunction assertConditionPlacement(\n  workflows: readonly WorkflowIR[],\n  segments: readonly SegmentIR[]\n): void {\n  for (const workflow of workflows) {\n    if (workflow.trigger.type === 'event') {\n      if (workflow.trigger.where !== undefined) {\n        assertWhereTree(workflow.trigger.where, `workflow '${workflow.id}' trigger where`);\n      }\n      if (workflow.trigger.filter !== undefined) {\n        assertProfileTree(workflow.trigger.filter, `workflow '${workflow.id}' trigger filter`);\n      }\n    }\n    if (workflow.goal !== undefined) {\n      assertProfileTree(workflow.goal.condition, `workflow '${workflow.id}' goal`);\n    }\n    if (workflow.exitWhen !== undefined) {\n      assertProfileTree(workflow.exitWhen, `workflow '${workflow.id}' exitWhen`);\n    }\n    assertNodeTrees(workflow.flow, `workflow '${workflow.id}'`);\n  }\n  for (const segment of segments) {\n    assertProfileTree(segment.condition, `segment '${segment.id}'`);\n  }\n}\n\n/** A profile-context tree: payload predicates may appear only under a performed.where. */\nfunction assertProfileTree(condition: ConditionIR, owner: string): void {\n  switch (condition.type) {\n    case 'and':\n    case 'or':\n      for (const child of condition.conditions) assertProfileTree(child, owner);\n      break;\n    case 'not':\n      assertProfileTree(condition.condition, owner);\n      break;\n    case 'performed':\n      if (condition.where !== undefined) assertWhereTree(condition.where, owner);\n      break;\n    case 'payload':\n      throw new Error(\n        `compileBundle: ${owner} uses a payload predicate outside a where clause — payload refs are only valid inside performed({ where }) or trigger.event({ where })`\n      );\n    default:\n      break; // property / segment\n  }\n}\n\n/** A where tree: payload predicates and combinators only — no profile facts in event scope. */\nfunction assertWhereTree(condition: ConditionIR, owner: string): void {\n  switch (condition.type) {\n    case 'and':\n    case 'or':\n      for (const child of condition.conditions) assertWhereTree(child, owner);\n      break;\n    case 'not':\n      assertWhereTree(condition.condition, owner);\n      break;\n    case 'payload':\n      break;\n    default:\n      throw new Error(\n        `compileBundle: ${owner} where clause may only contain payload predicates and and/or/not, found '${condition.type}'`\n      );\n  }\n}\n\nfunction assertNodeTrees(nodes: readonly NodeIR[], owner: string): void {\n  for (const node of nodes) {\n    switch (node.type) {\n      case 'wait_until':\n        assertProfileTree(node.condition, owner);\n        if (Array.isArray(node.onTimeout)) assertNodeTrees(node.onTimeout, owner);\n        break;\n      case 'branch':\n        for (const branchCase of node.cases) {\n          assertProfileTree(branchCase.condition, owner);\n          assertNodeTrees(branchCase.flow, owner);\n        }\n        if (node.otherwise) assertNodeTrees(node.otherwise, owner);\n        break;\n      case 'filter':\n        assertProfileTree(node.condition, owner);\n        break;\n      case 'cohort':\n        for (const arm of node.arms) assertNodeTrees(arm.flow, owner);\n        break;\n      default:\n        break;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;AAoBA,SAAgB,cAAc,OAMjB;CACX,MAAM,YAAY,MAAM,YAAY,CAAC,EAAA,CAAG,KAAK,YAAY;EACvD,MAAM,EAAE,IAAI,YAAY,KAAK,SAAS;EACtC,MAAM,WAAsB;GAC1B,WAAA;GACA;GAEA,aAAa,aAAa,UAAU;GACpC,WAAW;EACb;EACA,MAAM,SAAS;GACb,GAAI,MAAM,SAAS,KAAA,IAAY,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;GACtD,GAAI,MAAM,gBAAgB,KAAA,IAAY,EAAE,aAAa,KAAK,YAAY,IAAI,CAAC;GAC3E,GAAI,QAAQ,KAAA,IAAY,EAAE,IAAI,IAAI,CAAC;EACrC;EACA,IAAI,OAAO,KAAK,MAAM,CAAC,CAAC,SAAS,GAAG,SAAS,OAAO;EACpD,OAAO;CACT,CAAC;CAED,MAAM,aAAa,MAAM,aAAa,CAAC,EAAA,CAAG,KAAK,cAAc;EAC3D,WAAA;EACA,KAAK,SAAS;EACd,SAAS,WAAW,SAAS;CAC/B,EAAE;CAGF,MAAM,WAAW,MAAM,WAAW,CAAC,EAAA,CAAG,KAAK,OAAO;EAChD,WAAA;EACA,MAAM,EAAE;EACR,UAAU,EAAE;CACd,EAAE;CAEF,MAAM,YAAY,MAAM,UAAU,KAAK,YAAY,QAAQ,KAAK,CAAC;CAIjE,kBACE,UAAU,KAAK,MAAM,EAAE,EAAE,GACzB,UACF;CACA,kBACE,SAAS,KAAK,MAAM,EAAE,EAAE,GACxB,SACF;CAGA,kBACE,UAAU,KAAK,MAAM,GAAG,EAAE,QAAQ,GAAG,EAAE,KAAK,GAC5C,UACF;CACA,kBACE,QAAQ,KAAK,MAAM,EAAE,IAAI,GACzB,QACF;CAKA,yBAAyB,WAAW,QAAQ;CAK5C,yBAAyB,WAAW,QAAQ;CAK5C,wBAAwB,WAAW,OAAO;CAE1C,OAAOA,SAAe,MAAM;EAAE,WAAA;EAAuB;EAAW;EAAU;EAAW;CAAQ,CAAC;AAChG;AAEA,SAAS,kBAAkB,OAA0B,MAAoB;CACvE,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,IAAI,IAAI,GAAG,MAAM,IAAI,MAAM,4BAA4B,KAAK,SAAS,KAAK,EAAE;EACrF,KAAK,IAAI,IAAI;CACf;AACF;AAEA,SAAS,yBACP,WACA,UACM;CACN,MAAM,UAAU,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,EAAE,CAAC;CACjD,MAAM,SAAS,MAA2B,UAAwB;EAChE,KAAK,MAAM,OAAO,MAChB,IAAI,CAAC,QAAQ,IAAI,GAAG,GAClB,MAAM,IAAI,MACR,kBAAkB,MAAM,uBAAuB,IAAI,oDACrD;CAGN;CACA,KAAK,MAAM,YAAY,WACrB,MAAM,mBAAmB,QAAQ,GAAG,aAAa,SAAS,GAAG,EAAE;CAGjE,KAAK,MAAM,WAAW,UAAU;EAC9B,MAAM,uBAAO,IAAI,IAAY;EAC7B,qBAAqB,QAAQ,WAAW,IAAI;EAC5C,MAAM,MAAM,YAAY,QAAQ,GAAG,EAAE;CACvC;AACF;AAEA,SAAS,mBAAmB,UAAmC;CAC7D,MAAM,uBAAO,IAAI,IAAY;CAC7B,IAAI,SAAS,QAAQ,SAAS,WAAW,KAAK,IAAI,SAAS,QAAQ,OAAO;CAC1E,IAAI,SAAS,QAAQ,SAAS,WAAW,SAAS,QAAQ,WAAW,KAAA,GACnE,qBAAqB,SAAS,QAAQ,QAAQ,IAAI;CAEpD,IAAI,SAAS,SAAS,KAAA,GAAW,qBAAqB,SAAS,KAAK,WAAW,IAAI;CACnF,IAAI,SAAS,aAAa,KAAA,GAAW,qBAAqB,SAAS,UAAU,IAAI;CACjF,gBAAgB,SAAS,MAAM,IAAI;CACnC,OAAO;AACT;AAEA,SAAS,qBAAqB,WAAwB,MAAyB;CAC7E,QAAQ,UAAU,MAAlB;EACE,KAAK;EACL,KAAK;GACH,KAAK,MAAM,SAAS,UAAU,YAAY,qBAAqB,OAAO,IAAI;GAC1E;EACF,KAAK;GACH,qBAAqB,UAAU,WAAW,IAAI;GAC9C;EACF,KAAK,WACH,KAAK,IAAI,UAAU,OAAO;CAI9B;AACF;AAEA,SAAS,gBAAgB,OAA0B,MAAyB;CAC1E,KAAK,MAAM,QAAQ,OACjB,QAAQ,KAAK,MAAb;EACE,KAAK;GACH,qBAAqB,KAAK,WAAW,IAAI;GACzC,IAAI,MAAM,QAAQ,KAAK,SAAS,GAAG,gBAAgB,KAAK,WAAW,IAAI;GACvE;EACF,KAAK;GACH,KAAK,MAAM,cAAc,KAAK,OAAO;IACnC,qBAAqB,WAAW,WAAW,IAAI;IAC/C,gBAAgB,WAAW,MAAM,IAAI;GACvC;GACA,IAAI,KAAK,WAAW,gBAAgB,KAAK,WAAW,IAAI;GACxD;EACF,KAAK;GACH,qBAAqB,KAAK,WAAW,IAAI;GACzC;EACF,KAAK,UACH,KAAK,MAAM,OAAO,KAAK,MAAM,gBAAgB,IAAI,MAAM,IAAI;CAI/D;AAEJ;AAEA,SAAS,wBACP,WACA,SACM;CACN,MAAM,UAAU,IAAI,IAAI,QAAQ,KAAK,MAAM,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;CAChE,KAAK,MAAM,YAAY,WAAW;EAChC,MAAM,uBAAO,IAAI,IAAqC;EACtD,kBAAkB,SAAS,MAAM,IAAI;EACrC,KAAK,MAAM,CAAC,MAAM,eAAe,MAAM;GACrC,MAAM,eAAe,QAAQ,IAAI,IAAI;GACrC,IAAI,iBAAiB,KAAA,GACnB,MAAM,IAAI,MACR,4BAA4B,SAAS,GAAG,iBAAiB,KAAK,mDAChE;GAKF,KAAK,MAAM,YAAY,YACrB,IAAI,aAAa,KAAA,KAAa,aAAa,cACzC,MAAM,IAAI,MACR,4BAA4B,SAAS,GAAG,iBAAiB,KAAK,uFAChE;EAGN;CACF;AACF;;AAGA,SAAS,kBACP,OACA,MACM;CACN,KAAK,MAAM,QAAQ,OACjB,QAAQ,KAAK,MAAb;EACE,KAAK,UAAU;GACb,MAAM,OAAO,KAAK,IAAI,KAAK,MAAM,qBAAK,IAAI,IAAwB;GAClE,KAAK,IAAI,KAAK,QAAQ;GACtB,KAAK,IAAI,KAAK,QAAQ,IAAI;GAC1B;EACF;EACA,KAAK;GACH,IAAI,MAAM,QAAQ,KAAK,SAAS,GAAG,kBAAkB,KAAK,WAAW,IAAI;GACzE;EACF,KAAK;GACH,KAAK,MAAM,cAAc,KAAK,OAAO,kBAAkB,WAAW,MAAM,IAAI;GAC5E,IAAI,KAAK,WAAW,kBAAkB,KAAK,WAAW,IAAI;GAC1D;EACF,KAAK,UACH,KAAK,MAAM,OAAO,KAAK,MAAM,kBAAkB,IAAI,MAAM,IAAI;CAIjE;AAEJ;AAIA,SAAS,yBACP,WACA,UACM;CACN,KAAK,MAAM,YAAY,WAAW;EAChC,IAAI,SAAS,QAAQ,SAAS,SAAS;GACrC,IAAI,SAAS,QAAQ,UAAU,KAAA,GAC7B,gBAAgB,SAAS,QAAQ,OAAO,aAAa,SAAS,GAAG,gBAAgB;GAEnF,IAAI,SAAS,QAAQ,WAAW,KAAA,GAC9B,kBAAkB,SAAS,QAAQ,QAAQ,aAAa,SAAS,GAAG,iBAAiB;EAEzF;EACA,IAAI,SAAS,SAAS,KAAA,GACpB,kBAAkB,SAAS,KAAK,WAAW,aAAa,SAAS,GAAG,OAAO;EAE7E,IAAI,SAAS,aAAa,KAAA,GACxB,kBAAkB,SAAS,UAAU,aAAa,SAAS,GAAG,WAAW;EAE3E,gBAAgB,SAAS,MAAM,aAAa,SAAS,GAAG,EAAE;CAC5D;CACA,KAAK,MAAM,WAAW,UACpB,kBAAkB,QAAQ,WAAW,YAAY,QAAQ,GAAG,EAAE;AAElE;;AAGA,SAAS,kBAAkB,WAAwB,OAAqB;CACtE,QAAQ,UAAU,MAAlB;EACE,KAAK;EACL,KAAK;GACH,KAAK,MAAM,SAAS,UAAU,YAAY,kBAAkB,OAAO,KAAK;GACxE;EACF,KAAK;GACH,kBAAkB,UAAU,WAAW,KAAK;GAC5C;EACF,KAAK;GACH,IAAI,UAAU,UAAU,KAAA,GAAW,gBAAgB,UAAU,OAAO,KAAK;GACzE;EACF,KAAK,WACH,MAAM,IAAI,MACR,kBAAkB,MAAM,uIAC1B;CAGJ;AACF;;AAGA,SAAS,gBAAgB,WAAwB,OAAqB;CACpE,QAAQ,UAAU,MAAlB;EACE,KAAK;EACL,KAAK;GACH,KAAK,MAAM,SAAS,UAAU,YAAY,gBAAgB,OAAO,KAAK;GACtE;EACF,KAAK;GACH,gBAAgB,UAAU,WAAW,KAAK;GAC1C;EACF,KAAK,WACH;EACF,SACE,MAAM,IAAI,MACR,kBAAkB,MAAM,2EAA2E,UAAU,KAAK,EACpH;CACJ;AACF;AAEA,SAAS,gBAAgB,OAA0B,OAAqB;CACtE,KAAK,MAAM,QAAQ,OACjB,QAAQ,KAAK,MAAb;EACE,KAAK;GACH,kBAAkB,KAAK,WAAW,KAAK;GACvC,IAAI,MAAM,QAAQ,KAAK,SAAS,GAAG,gBAAgB,KAAK,WAAW,KAAK;GACxE;EACF,KAAK;GACH,KAAK,MAAM,cAAc,KAAK,OAAO;IACnC,kBAAkB,WAAW,WAAW,KAAK;IAC7C,gBAAgB,WAAW,MAAM,KAAK;GACxC;GACA,IAAI,KAAK,WAAW,gBAAgB,KAAK,WAAW,KAAK;GACzD;EACF,KAAK;GACH,kBAAkB,KAAK,WAAW,KAAK;GACvC;EACF,KAAK,UACH,KAAK,MAAM,OAAO,KAAK,MAAM,gBAAgB,IAAI,MAAM,KAAK;CAIhE;AAEJ"}

package/dist/dsl/flow.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"flow.cjs","names":["isTemplate","CHANNEL_OF","captureLoc","durationIR","timeOfDayMinutes","condIR"],"sources":["../../src/dsl/flow.ts"],"sourcesContent":["import type { ChannelIR, ConditionIR, NodeIR, PropValueIR, SourceLocIR } from '../ir';\nimport { captureLoc } from '../provenance';\nimport {\n  type AnyTemplate,\n  CHANNEL_OF,\n  type DiscordTemplate,\n  type EmailTemplate,\n  type PropsSchema,\n  type PushTemplate,\n  type SlackTemplate,\n  isTemplate,\n} from '../templates';\nimport type { ActionRef } from './action';\nimport { type Duration, type TimeOfDay, type Weekday, durationIR, timeOfDayMinutes } from './base';\nimport { type Condition, condIR } from './condition';\nimport type { EventRef, MessageArgs, PropInput, PropsInput } from './refs';\nimport type { PropsOf, TemplateRef } from './template';\n\n/**\n * The flow chain — FlowBuilder is the DSL's step surface (messages, delays,\n * flow control, data), and its implementation is the compiler front half: each\n * chained call executes no logic, it just collects one IR node (ids are\n * assigned later, in workflow.toIR()). Sub-flow callbacks run exactly once at\n * construction — builder in, builder out — so the output is always a static\n * tree.\n *\n * Every public method also captures its callsite (provenance): the loc lands\n * in the node's hash-excluded meta and is the anchor for future in-place\n * editing from the studio.\n */\n\ntype Scalar = string | number | boolean;\n\n/** An emitted field: a scalar (or a profile ref to one); a nested field cannot be sent. */\ntype EmitValue<T> = [NonNullable<T>] extends [Scalar] ? PropInput<T> : never;\n\n/** The payload `sendEvent` accepts for an event: its fields, scalar ones only. */\nexport type EmitPayload<P> = { [K in keyof P]: EmitValue<P[K]> };\n\n/** Payload may be omitted when the event declares no required field. */\nexport type EmitArgs<P> =\n  Record<never, never> extends P ? [payload?: EmitPayload<P>] : [payload: EmitPayload<P>];\n\n/** Per-node push options. */\nexport interface PushOptions {\n  /** Which devices get a copy: 'all' (the default) or only the most recently registered. */\n  devices?: 'all' | 'latest';\n}\n\n/** `prefer()` options. */\nexport interface PreferOptions {\n  /** The generated branch's name in IR (UI title / observability handle), as `branch(label, …)`. */\n  label?: string;\n}\n\n/** The candidates `prefer()` takes: one push and one email template, in priority order. */\ntype PreferPair = readonly [PushTemplate, EmailTemplate] | readonly [EmailTemplate, PushTemplate];\n\ntype NormalizeProps<P> = { -readonly [K in keyof P]: P[K] };\ntype Equal<A, B> =\n  (<T>() => T extends A ? 1 : 2) extends <T>() => T extends B ? 1 : 2 ? true : false;\n\n/** Both candidates render the one props object, so they must declare the same props type — not merely overlap. */\ntype SameProps<T extends PreferPair> =\n  Equal<NormalizeProps<PropsOf<T[0]>>, NormalizeProps<PropsOf<T[1]>>> extends true\n    ? unknown\n    : { readonly __prefer_error__: 'Both templates must declare the same props type' };\n\n/** Distributes, so a field only one member of a union variable has still counts as extra. */\ntype KeysOfUnion<A> = A extends unknown ? keyof A : never;\n/** Rejects known extra fields, which `{}` (an empty props schema) would otherwise accept. */\ntype NoExtra<A, P> = Record<Exclude<KeysOfUnion<A>, keyof P>, never>;\n\n/** prefer() is typed strictly, but a JS caller (or an `any`) reaches it unchecked — fail at the call, not at send time. */\nfunction checkPreferArgs(candidates: unknown, props: unknown, options: unknown): void {\n  if (!Array.isArray(candidates) || candidates.length !== 2) {\n    throw new TypeError('prefer(): candidates must be exactly two templates — one push, one email');\n  }\n  const channels = (candidates as unknown[]).map((candidate) =>\n    isTemplate(candidate) ? CHANNEL_OF[candidate.kind] : undefined\n  );\n  if (!channels.every((channel) => channel === 'push' || channel === 'email')) {\n    throw new TypeError('prefer(): each candidate must be a pushTemplate or an emailTemplate');\n  }\n  if (channels[0] === channels[1]) {\n    throw new TypeError('prefer(): candidates must be one push and one email template');\n  }\n  if (typeof props !== 'object' || props === null || Array.isArray(props)) {\n    throw new TypeError(\n      'prefer(): props must be an object — pass {} when the templates declare none'\n    );\n  }\n  if (options === undefined) return;\n  if (typeof options !== 'object' || options === null || Array.isArray(options)) {\n    throw new TypeError('prefer(): options must be an object');\n  }\n  for (const [name, value] of Object.entries(options)) {\n    if (name !== 'label') {\n      throw new TypeError(\n        `prefer(): unknown option '${name}' — props go in the second argument, options take only 'label'`\n      );\n    }\n    if (typeof value !== 'string') throw new TypeError(\"prefer(): 'label' must be a string\");\n  }\n}\n\n/** A reusable flow fragment (what `flow(...)` returns), referenced directly by branch arms. */\nexport interface Flow {\n  readonly __flow: true;\n}\n\ninterface FlowInternal extends Flow {\n  readonly nodes: NodeIR[];\n  readonly uses: readonly TemplateUse[];\n}\n\n/**\n * @internal A template definition a flow sends, kept beside the IR (which names it by id only):\n * compileConfig checks that the registered definition under that id is this very object, so the\n * schema that typed the call is the one that renders it. Never part of the IR or its hash.\n */\nexport interface TemplateUse {\n  readonly template: AnyTemplate;\n  readonly loc: SourceLocIR | undefined;\n}\n\n/** @internal The template definitions a workflow sends, sub-flows and fragments included. */\nexport function templateUses(builder: FlowBuilder): readonly TemplateUse[] {\n  return builder instanceof FlowBuilderImpl ? builder.uses : [];\n}\n\n/** Sub-flow: a named fragment, or an inline callback (runs once at construction — builder in, builder out). */\nexport type SubFlow = Flow | ((w: FlowBuilder) => FlowBuilder);\n\n/** A branch arm: the [condition, sub-flow] tuple — an [if, then] ordering convention. */\nexport type BranchCase = readonly [condition: Condition, flow: SubFlow];\n\n/**\n * A branch argument: either a tuple arm, or a bare sub-flow meaning the default\n * arm. The bare form may appear once, and must come last (checked at runtime).\n */\nexport type BranchArm = BranchCase | SubFlow;\n\n/**\n * A cohort arm name has two jobs, and both constrain its spelling:\n * - it is interpolated into the node ids of the arm's flow ('{id}.{name}.{j}'),\n *   and an id is a durable step name — a dot would fake a nesting level and can\n *   collide with a real one, an empty name gives '{id}..{j}';\n * - it is an object key, and JavaScript lists integer-like keys first in\n *   ascending numeric order however the author wrote them. The arms array is\n *   documented (and interpreted) as authoring order, and the bucketing walk\n *   accumulates weights along it, so an arm named '0' added to a live\n *   experiment would prepend itself and re-bucket everyone already in it.\n */\nconst ARM_NAME = /^[A-Za-z_][A-Za-z0-9_-]*$/;\n\n/** A sub-flow's nodes; the template definitions it sends are added to `uses`. */\nfunction resolveSubFlow(sub: SubFlow, uses: TemplateUse[]): NodeIR[] {\n  if (typeof sub === 'function') {\n    const builder = new FlowBuilderImpl();\n    const returned: unknown = sub(builder);\n    // An async callback would add its nodes after construction is over — after ids were assigned\n    if (typeof (returned as { then?: unknown } | undefined)?.then === 'function') {\n      throw new TypeError(\n        'sub-flow callbacks must be synchronous: they run once, while the workflow is defined'\n      );\n    }\n    uses.push(...builder.uses);\n    return builder.nodes;\n  }\n  uses.push(...(sub as FlowInternal).uses);\n  /*\n   * A named fragment is a value, and the convention is to reuse it — two branch\n   * arms may hold the same one. Handing out its own nodes aliases them into\n   * both places, and assignIds writes ids *in place*: the second prefix\n   * overwrites the first, so the two placements end up as one object under one\n   * id — one durable step name, one message idempotency key, one bucket seed.\n   * A copy per placement is what makes a fragment behave like a value.\n   */\n  return structuredClone((sub as FlowInternal).nodes);\n}\n\nexport interface FlowBuilder {\n  /* ---- Messages: every channel is one message node; separate methods buy channel-level typing ---- */\n  email<T extends EmailTemplate>(template: T, ...props: MessageArgs<PropsOf<T>>): this;\n  sms<P extends object>(template: TemplateRef<'sms', P>, ...props: MessageArgs<P>): this;\n  /**\n   * Push to the user's devices — every device the host's directory lists, or\n   * only the most recently registered with `{ devices: 'latest' }`. A user with\n   * no device is skipped (`prefer([pushTpl, emailTpl], props)` falls back to email).\n   */\n  push<T extends PushTemplate>(\n    template: T,\n    ...args: [...props: MessageArgs<PropsOf<T>>, options?: PushOptions]\n  ): this;\n  inApp<P extends object>(template: TemplateRef<'in_app', P>, ...props: MessageArgs<P>): this;\n  slack<T extends SlackTemplate<PropsSchema, never>>(\n    template: T,\n    ...props: MessageArgs<PropsOf<T>>\n  ): this;\n  discord<T extends DiscordTemplate<PropsSchema, never>>(\n    template: T,\n    ...props: MessageArgs<PropsOf<T>>\n  ): this;\n  survey<P extends object>(template: TemplateRef<'survey', P>, ...props: MessageArgs<P>): this;\n\n  /**\n   * Send one message on the first channel the user can be reached on: one push\n   * and one email template, in priority order, rendered with the same props.\n   * Sugar for the branch it compiles to — same IR, ids and hash as writing\n   *\n   *   .branch(label, [reachable(first.channel), (b) => b.<first>(first, props)], (b) => b.<second>(second, props))\n   *\n   * so the choice is made once, when the step is reached, and a first choice\n   * that fails to send retries as itself — it never falls through to the\n   * second. Props are always passed (`{}` for templates that declare none),\n   * and both templates must declare the same props type; for differing props\n   * or other channels, write the branch.\n   *\n   *   .prefer([push.tip, email.tip], { name: u.name }, { label: 'tip by channel' })\n   */\n  prefer<const T extends PreferPair, const A extends PropsInput<NoInfer<PropsOf<T[0]>>>>(\n    candidates: T & SameProps<NoInfer<T>>,\n    props: A & NoInfer<NoExtra<A, PropsOf<T[0]>>>,\n    options?: PreferOptions\n  ): this;\n\n  /* --------------------------------- Delays --------------------------------- */\n  /** Time Delay; passing { min, max } makes it a Randomized Delay. */\n  delay(duration: Duration): this;\n  delay(range: { min: Duration; max: Duration }): this;\n\n  /** Time Window: hold until inside the window (e.g. weekdays 09:00–17:00). tz: 'user' uses the user's timezone. */\n  timeWindow(opts: {\n    days?: readonly Weekday[];\n    between: readonly [TimeOfDay, TimeOfDay];\n    tz?: 'user' | (string & {});\n  }): this;\n\n  /**\n   * Wait Until: continue on the main line once the condition holds, or take\n   * onTimeout when it expires (default 'continue'). On the engine side this is\n   * \"await event racing a timer\" — a native primitive of durable runtimes.\n   */\n  waitUntil(\n    condition: Condition,\n    opts: { timeout: Duration; onTimeout?: 'continue' | 'exit' | SubFlow }\n  ): this;\n\n  /**\n   * Splice a fragment in place: a named `flow(...)` or a callback, expanded\n   * once while the workflow is defined — a composition step before compiling,\n   * not a node (the IR has no trace of it, and ids are assigned over the whole\n   * workflow as if the steps were written inline). Each use gets its own copy,\n   * so one fragment can be used in several places and workflows.\n   *\n   *   const officeHours = flow((w) => w.timeWindow({ days: ['mon', 'tue', 'wed', 'thu', 'fri'], between: ['09:00', '17:00'] }));\n   *   workflow({ id: 'onboarding', ... }).delay('1 day').use(officeHours).email(email.tip, { name: u.name })\n   */\n  use(fragment: SubFlow): this;\n\n  /* ------------------------------ Flow Control ------------------------------ */\n  /**\n   * Conditional branch: ordered first-match (same semantics as Step Functions\n   * Choice / Knock branch). This one primitive covers both the UI's True/False\n   * Branch (two arms) and Multi-Split Branch (N arms). Arms are\n   * [condition, sub-flow] tuples; a bare sub-flow in tail position is the\n   * default arm. With no match and no default, execution simply continues.\n   * Rejoin is structural: after the matching arm finishes, execution resumes\n   * at the node following the branch — to opt out, call .exit() inside the arm.\n   *\n   *   .branch([activeSubscriber, upgradeFlow], firstTimeFlow)   // True/False\n   *   .branch([vip, vipFlow], [trial, trialFlow], defaultFlow)  // Multi-Split\n   *   .branch([not(usedStaging), eduFlow])                      // single arm: no match continues\n   *\n   * The optional first argument `label` becomes the node's name in IR (UI title\n   * / observability handle). It is not a jump target — there is no goto here;\n   * looping is a future re-entry-policy topic (see sendEvent). Arm labels in\n   * the UI are derived from the condition.\n   */\n  branch(...arms: readonly BranchArm[]): this;\n  branch(label: string, ...arms: readonly BranchArm[]): this;\n\n  /**\n   * Gate: exit unless the condition holds, otherwise continue. A first-class\n   * node rather than sugar over branch — same semantics as Zapier's \"only\n   * continue if\" / Iterable's Filter tile, and rendered on its own in the UI.\n   * `reason` is the audit-log line — metadata, so rewording it is free\n   * (excluded from contentHash, see hash.ts).\n   */\n  filter(condition: Condition, opts?: { reason?: string }): this;\n\n  /**\n   * Random Cohort Branch (A/B): weights must sum to 100 (checked at runtime).\n   * `key` names the experiment: bucketing hashes `userId:key` instead of the\n   * structural node id, so assignments survive node insertion/moves and the\n   * experiment keeps one identity across workflow versions — set it for any\n   * A/B whose results you intend to read.\n   *\n   * Arm names become node id segments and are read back in authoring order, so\n   * they are restricted to letters, digits, '_' and '-', never starting with a\n   * digit (checked at runtime).\n   */\n  cohort(arms: Record<string, { weight: number; flow?: SubFlow }>, opts?: { key?: string }): this;\n\n  /**\n   * Exit: end the whole workflow immediately (the UI's Exit node); `reason`\n   * goes into the audit log and is metadata, so rewording it neither repins\n   * in-flight journeys nor shows up in plan. Inside a branch arm this means\n   * \"terminate, do not rejoin\" — it stops here instead of falling through,\n   * while an arm without exit rejoins naturally.\n   */\n  exit(reason?: string): this;\n\n  /* ---------------------------------- Data ---------------------------------- */\n  /**\n   * Emit a typed event (customer.io's Send Event). The event comes from an\n   * e.xxx reference, so payload types flow in the same way trigger.event works.\n   * This is how workflows compose: an event can trigger another workflow, and\n   * the resulting call graph is statically analyzable. Payload values may\n   * reference u.xxx. Only scalar fields can be sent (IR carries literals and\n   * profile refs, not nested JSON): an event whose payload requires a nested\n   * field cannot be emitted from a journey, and the types say so.\n   *\n   * Note on loops: a trailing self-triggering sendEvent will become the\n   * official periodic-flow shape *once a re-entry policy exists* — today the\n   * entry policy is once-per-user, so a self-trigger cannot re-enter and does\n   * not loop.\n   * TODO: the rest of the Data category — outbound webhook / profile update /\n   * journey attributes.\n   */\n  sendEvent<P extends object>(event: EventRef<P>, ...payload: EmitArgs<P>): this;\n\n  /**\n   * Run a custom action (see dsl/action.ts for the model). The chain records\n   * identity only — name, args, codeHash — never the code: the implementation\n   * ships inside the deployed Worker bundle and is resolved by name from the\n   * runtime registry. Args are typed by the ActionRef and may reference u.xxx,\n   * resolved at run time exactly like message props. Executed inside a durable\n   * step: retried on throw, checkpointed on success.\n   */\n  run<A extends object>(action: ActionRef<A>, ...args: MessageArgs<A>): this;\n}\n\nconst DEFINED_CHANNELS: ReadonlySet<ChannelIR> = new Set(Object.values(CHANNEL_OF));\n\n/** A message's template: a definition of the channel (named by its id), or a reference by key. */\ntype MessageTemplate = AnyTemplate | TemplateRef;\n\nfunction templateKey(channel: ChannelIR, tpl: MessageTemplate): string {\n  if (!DEFINED_CHANNELS.has(channel)) return (tpl as TemplateRef).key;\n  // Typed, but a JS caller (or an `any`) reaches it unchecked: fail where the workflow is written\n  if (!isTemplate(tpl) || CHANNEL_OF[tpl.kind] !== channel) {\n    throw new TypeError(`${channel}(): expects a ${channel} template definition`);\n  }\n  return tpl.id;\n}\n\nfunction messageNode(\n  channel: ChannelIR,\n  tpl: MessageTemplate,\n  props: object | undefined,\n  devices?: 'latest'\n): NodeIR {\n  return {\n    id: '',\n    type: 'message',\n    channel,\n    template: templateKey(channel, tpl),\n    props: (props ?? {}) as Record<string, PropValueIR>,\n    // Absent for 'all', so adding the option left every existing push's hash as it was\n    ...(devices !== undefined ? { devices } : {}),\n  };\n}\n\n/* oxlint-disable typescript/unbound-method --\n * `captureLoc(this.xxx)` passes the method by identity as the stack-trace\n * boundary for Error.captureStackTrace; it is never invoked, so `this`\n * scoping cannot go wrong. */\n/** @internal extended by WorkflowBuilderImpl; not part of the public API */\nexport class FlowBuilderImpl implements FlowBuilder {\n  /** Nodes as collected; ids are assigned in one pass inside toIR, so '' is a placeholder here. */\n  readonly nodes: NodeIR[] = [];\n  /** The template definitions sent, with where: compile-time only, never in the IR. */\n  readonly uses: TemplateUse[] = [];\n\n  /** Provenance: the callsite (captured in the public method) lands in meta.loc, outside the hash. */\n  private pushNode(node: NodeIR, loc: SourceLocIR | undefined): this {\n    this.nodes.push({ ...node, ...(loc !== undefined ? { meta: { loc } } : {}) });\n    return this;\n  }\n\n  private message(\n    channel: ChannelIR,\n    tpl: MessageTemplate,\n    props: object | undefined,\n    loc: SourceLocIR | undefined,\n    devices?: 'latest'\n  ): this {\n    this.pushNode(messageNode(channel, tpl, props, devices), loc);\n    if (isTemplate(tpl)) this.uses.push({ template: tpl, loc });\n    return this;\n  }\n\n  email<T extends EmailTemplate>(t: T, ...args: MessageArgs<PropsOf<T>>): this {\n    return this.message('email', t, args[0], captureLoc(this.email));\n  }\n  sms<P extends object>(t: TemplateRef<'sms', P>, ...args: MessageArgs<P>): this {\n    return this.message('sms', t, args[0], captureLoc(this.sms));\n  }\n  push<T extends PushTemplate>(\n    t: T,\n    ...args: [...props: MessageArgs<PropsOf<T>>, options?: PushOptions]\n  ): this {\n    const [props, options] = args as unknown as [object | undefined, PushOptions | undefined];\n    const devices = options?.devices === 'latest' ? 'latest' : undefined;\n    return this.message('push', t, props, captureLoc(this.push), devices);\n  }\n  inApp<P extends object>(t: TemplateRef<'in_app', P>, ...args: MessageArgs<P>): this {\n    return this.message('in_app', t, args[0], captureLoc(this.inApp));\n  }\n  slack<T extends SlackTemplate<PropsSchema, never>>(t: T, ...args: MessageArgs<PropsOf<T>>): this {\n    return this.message('slack', t, args[0], captureLoc(this.slack));\n  }\n  discord<T extends DiscordTemplate<PropsSchema, never>>(\n    t: T,\n    ...args: MessageArgs<PropsOf<T>>\n  ): this {\n    return this.message('discord', t, args[0], captureLoc(this.discord));\n  }\n  survey<P extends object>(t: TemplateRef<'survey', P>, ...args: MessageArgs<P>): this {\n    return this.message('survey', t, args[0], captureLoc(this.survey));\n  }\n\n  prefer<const T extends PreferPair, const A extends PropsInput<NoInfer<PropsOf<T[0]>>>>(\n    candidates: T & SameProps<NoInfer<T>>,\n    props: A & NoInfer<NoExtra<A, PropsOf<T[0]>>>,\n    options?: PreferOptions\n  ): this {\n    checkPreferArgs(candidates, props, options);\n    // Every generated node points at the author's prefer() call, not at this method's body\n    const loc = captureLoc(this.prefer);\n    const meta = loc !== undefined ? { meta: { loc } } : {};\n    const [first, second] = candidates as readonly (EmailTemplate | PushTemplate)[];\n    const channel = (tpl: EmailTemplate | PushTemplate) => CHANNEL_OF[tpl.kind] as 'email' | 'push';\n    // Both are sent from here as far as the registry check goes, the fallback included\n    this.uses.push({ template: first, loc }, { template: second, loc });\n    // A copy per message, as two separately written calls would hold\n    const arm = (tpl: EmailTemplate | PushTemplate): NodeIR[] => [\n      { ...messageNode(channel(tpl), tpl, { ...props }), ...meta },\n    ];\n    return this.pushNode(\n      {\n        id: '',\n        type: 'branch',\n        ...(options?.label !== undefined ? { label: options.label } : {}),\n        cases: [\n          { condition: { type: 'reachable', channel: channel(first), ...meta }, flow: arm(first) },\n        ],\n        otherwise: arm(second),\n      },\n      loc\n    );\n  }\n\n  delay(duration: Duration): this;\n  delay(range: { min: Duration; max: Duration }): this;\n  delay(d: Duration | { min: Duration; max: Duration }): this {\n    const loc = captureLoc(this.delay);\n    if (typeof d === 'string') {\n      return this.pushNode({ id: '', type: 'delay', duration: durationIR(d) }, loc);\n    }\n    const min = durationIR(d.min);\n    const max = durationIR(d.max);\n    /*\n     * The interpreter draws `min + random(max - min)` with the span clamped at\n     * zero, so a backwards range does not fail — it quietly collapses into a\n     * fixed `min` sleep. Reject it here, where the author can still see it.\n     */\n    if (max.ms < min.ms) {\n      throw new Error(\n        `delay(): 'max' must not be shorter than 'min', got { min: '${d.min}', max: '${d.max}' }`\n      );\n    }\n    return this.pushNode({ id: '', type: 'random_delay', min, max }, loc);\n  }\n\n  timeWindow(opts: {\n    days?: readonly Weekday[];\n    between: readonly [TimeOfDay, TimeOfDay];\n    tz?: 'user' | (string & {});\n  }): this {\n    const loc = captureLoc(this.timeWindow);\n    const start = timeOfDayMinutes(opts.between[0]);\n    const end = timeOfDayMinutes(opts.between[1]);\n    if (end <= start) {\n      throw new Error(\n        `timeWindow(): 'between' must open before it closes within one day, got [${opts.between[0]}, ${opts.between[1]}] (overnight windows are not supported yet)`\n      );\n    }\n    return this.pushNode(\n      {\n        id: '',\n        type: 'time_window',\n        days: [...(opts.days ?? (['mon', 'tue', 'wed', 'thu', 'fri', 'sat', 'sun'] as const))],\n        between: [opts.between[0], opts.between[1]],\n        tz: opts.tz ?? 'user',\n      },\n      loc\n    );\n  }\n\n  waitUntil(\n    condition: Condition,\n    opts: { timeout: Duration; onTimeout?: 'continue' | 'exit' | SubFlow }\n  ): this {\n    const loc = captureLoc(this.waitUntil);\n    const onTimeout = opts.onTimeout ?? 'continue';\n    return this.pushNode(\n      {\n        id: '',\n        type: 'wait_until',\n        condition: condIR(condition),\n        timeout: durationIR(opts.timeout),\n        onTimeout:\n          onTimeout === 'continue' || onTimeout === 'exit'\n            ? onTimeout\n            : resolveSubFlow(onTimeout, this.uses),\n      },\n      loc\n    );\n  }\n\n  use(fragment: SubFlow): this {\n    // The fragment's nodes carry their own provenance (where the fragment was written)\n    this.nodes.push(...resolveSubFlow(fragment, this.uses));\n    return this;\n  }\n\n  branch(...arms: readonly BranchArm[]): this;\n  branch(label: string, ...arms: readonly BranchArm[]): this;\n  branch(...args: readonly (string | BranchArm)[]): this {\n    const loc = captureLoc(this.branch);\n    const label = typeof args[0] === 'string' ? args[0] : undefined;\n    const arms = (label === undefined ? args : args.slice(1)) as readonly BranchArm[];\n\n    const cases: { condition: ConditionIR; flow: NodeIR[] }[] = [];\n    let otherwise: NodeIR[] | undefined;\n    arms.forEach((arm, i) => {\n      if (Array.isArray(arm)) {\n        if (otherwise !== undefined) {\n          throw new Error('branch(): default arm (bare sub-flow) must be the last argument');\n        }\n        const [condition, sub] = arm as BranchCase;\n        cases.push({ condition: condIR(condition), flow: resolveSubFlow(sub, this.uses) });\n      } else {\n        if (otherwise !== undefined) {\n          throw new Error('branch(): only one default arm (bare sub-flow) is allowed');\n        }\n        if (i !== arms.length - 1) {\n          throw new Error('branch(): default arm (bare sub-flow) must be the last argument');\n        }\n        otherwise = resolveSubFlow(arm as SubFlow, this.uses);\n      }\n    });\n\n    return this.pushNode(\n      {\n        id: '',\n        type: 'branch',\n        ...(label !== undefined ? { label } : {}),\n        cases,\n        ...(otherwise !== undefined ? { otherwise } : {}),\n      },\n      loc\n    );\n  }\n\n  filter(condition: Condition, opts?: { reason?: string }): this {\n    return this.pushNode(\n      {\n        id: '',\n        type: 'filter',\n        condition: condIR(condition),\n        ...(opts?.reason !== undefined ? { reason: opts.reason } : {}),\n      },\n      captureLoc(this.filter)\n    );\n  }\n\n  cohort(arms: Record<string, { weight: number; flow?: SubFlow }>, opts?: { key?: string }): this {\n    const loc = captureLoc(this.cohort);\n    const entries = Object.entries(arms);\n    /*\n     * Weights live on a 0.01% grid: the runtime buckets into 10,000 slots\n     * (basis points), so anything finer would be silently quantized — reject\n     * it here instead. Converting to integer basis points also makes the\n     * sum check exact; no epsilon needed.\n     */\n    const basisPoints = entries.map(([name, a]) => {\n      if (!ARM_NAME.test(name)) {\n        throw new Error(\n          `cohort(): arm name '${name}' must start with a letter or '_' and contain only letters, digits, '_' or '-' — arm names become node id segments, and integer-like names would silently reorder the arms`\n        );\n      }\n      const bp = a.weight * 100;\n      if (Math.abs(bp - Math.round(bp)) > 1e-6) {\n        throw new Error(\n          `cohort(): arm '${name}' weight ${a.weight} is finer than the 0.01% bucketing grid — use at most two decimal places`\n        );\n      }\n      /*\n       * The sum check alone accepts -50 / 150: the runtime walks the arms\n       * accumulating basis points and takes the first whose cumulative total\n       * clears the bucket, so a negative weight hands 100% of users to its\n       * neighbour instead of splitting anything.\n       */\n      if (bp < 0) {\n        throw new Error(`cohort(): arm '${name}' weight ${a.weight} must not be negative`);\n      }\n      return Math.round(bp);\n    });\n    const total = basisPoints.reduce((sum, bp) => sum + bp, 0);\n    if (total !== 10_000) {\n      throw new Error(`cohort(): weights must sum to 100, got ${total / 100}`);\n    }\n    return this.pushNode(\n      {\n        id: '',\n        type: 'cohort',\n        ...(opts?.key !== undefined ? { key: opts.key } : {}),\n        arms: entries.map(([name, a]) => ({\n          name,\n          weight: a.weight,\n          flow: a.flow ? resolveSubFlow(a.flow, this.uses) : [],\n        })),\n      },\n      loc\n    );\n  }\n\n  exit(reason?: string): this {\n    return this.pushNode(\n      { id: '', type: 'exit', ...(reason !== undefined ? { reason } : {}) },\n      captureLoc(this.exit)\n    );\n  }\n\n  sendEvent<P extends object>(ev: EventRef<P>, ...payload: EmitArgs<P>): this {\n    const values = (payload[0] ?? {}) as Record<string, unknown>;\n    for (const [field, value] of Object.entries(values)) {\n      const ref =\n        typeof value === 'object' &&\n        value !== null &&\n        (value as { type?: unknown }).type === 'user_property';\n      if (!ref && !['string', 'number', 'boolean'].includes(typeof value)) {\n        throw new TypeError(\n          `sendEvent('${ev.name}'): '${field}' is not a scalar or a u.xxx reference — an emitted payload carries scalar fields only`\n        );\n      }\n    }\n    return this.pushNode(\n      {\n        id: '',\n        type: 'send_event',\n        event: ev.name,\n        payload: values as Record<string, PropValueIR>,\n      },\n      captureLoc(this.sendEvent)\n    );\n  }\n\n  run<A extends object>(a: ActionRef<A>, ...args: MessageArgs<A>): this {\n    return this.pushNode(\n      {\n        id: '',\n        type: 'action',\n        action: a.name,\n        args: (args[0] ?? {}) as Record<string, PropValueIR>,\n        codeHash: a.codeHash,\n      },\n      captureLoc(this.run)\n    );\n  }\n}\n/* oxlint-enable typescript/unbound-method */\n\n/**\n * A reusable flow fragment: a free function. Once personalization goes through\n * u.xxx and events through e.xxx, the flow layer carries no schema generics.\n */\nexport function flow(build: (w: FlowBuilder) => FlowBuilder): Flow {\n  const builder = new FlowBuilderImpl();\n  build(builder);\n  const impl: FlowInternal = { __flow: true, nodes: builder.nodes, uses: builder.uses };\n  return impl;\n}\n"],"mappings":";;;;;;;AA0EA,SAAS,gBAAgB,YAAqB,OAAgB,SAAwB;CACpF,IAAI,CAAC,MAAM,QAAQ,UAAU,KAAK,WAAW,WAAW,GACtD,MAAM,IAAI,UAAU,0EAA0E;CAEhG,MAAM,WAAY,WAAyB,KAAK,cAC9CA,kBAAAA,WAAW,SAAS,IAAIC,kBAAAA,WAAW,UAAU,QAAQ,KAAA,CACvD;CACA,IAAI,CAAC,SAAS,OAAO,YAAY,YAAY,UAAU,YAAY,OAAO,GACxE,MAAM,IAAI,UAAU,qEAAqE;CAE3F,IAAI,SAAS,OAAO,SAAS,IAC3B,MAAM,IAAI,UAAU,8DAA8D;CAEpF,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GACpE,MAAM,IAAI,UACR,6EACF;CAEF,IAAI,YAAY,KAAA,GAAW;CAC3B,IAAI,OAAO,YAAY,YAAY,YAAY,QAAQ,MAAM,QAAQ,OAAO,GAC1E,MAAM,IAAI,UAAU,qCAAqC;CAE3D,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,OAAO,GAAG;EACnD,IAAI,SAAS,SACX,MAAM,IAAI,UACR,6BAA6B,KAAK,+DACpC;EAEF,IAAI,OAAO,UAAU,UAAU,MAAM,IAAI,UAAU,oCAAoC;CACzF;AACF;;AAuBA,SAAgB,aAAa,SAA8C;CACzE,OAAO,mBAAmB,kBAAkB,QAAQ,OAAO,CAAC;AAC9D;;;;;;;;;;;;AAyBA,MAAM,WAAW;;AAGjB,SAAS,eAAe,KAAc,MAA+B;CACnE,IAAI,OAAO,QAAQ,YAAY;EAC7B,MAAM,UAAU,IAAI,gBAAgB;EAGpC,IAAI,OAFsB,IAAI,OAEX,CAAC,EAAqC,SAAS,YAChE,MAAM,IAAI,UACR,sFACF;EAEF,KAAK,KAAK,GAAG,QAAQ,IAAI;EACzB,OAAO,QAAQ;CACjB;CACA,KAAK,KAAK,GAAI,IAAqB,IAAI;CASvC,OAAO,gBAAiB,IAAqB,KAAK;AACpD;AAoKA,MAAM,mBAA2C,IAAI,IAAI,OAAO,OAAOA,kBAAAA,UAAU,CAAC;AAKlF,SAAS,YAAY,SAAoB,KAA8B;CACrE,IAAI,CAAC,iBAAiB,IAAI,OAAO,GAAG,OAAQ,IAAoB;CAEhE,IAAI,CAACD,kBAAAA,WAAW,GAAG,KAAKC,kBAAAA,WAAW,IAAI,UAAU,SAC/C,MAAM,IAAI,UAAU,GAAG,QAAQ,gBAAgB,QAAQ,qBAAqB;CAE9E,OAAO,IAAI;AACb;AAEA,SAAS,YACP,SACA,KACA,OACA,SACQ;CACR,OAAO;EACL,IAAI;EACJ,MAAM;EACN;EACA,UAAU,YAAY,SAAS,GAAG;EAClC,OAAQ,SAAS,CAAC;EAElB,GAAI,YAAY,KAAA,IAAY,EAAE,QAAQ,IAAI,CAAC;CAC7C;AACF;;AAOA,IAAa,kBAAb,MAAoD;;CAElD,QAA2B,CAAC;;CAE5B,OAA+B,CAAC;;CAGhC,SAAiB,MAAc,KAAoC;EACjE,KAAK,MAAM,KAAK;GAAE,GAAG;GAAM,GAAI,QAAQ,KAAA,IAAY,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC;EAAG,CAAC;EAC5E,OAAO;CACT;CAEA,QACE,SACA,KACA,OACA,KACA,SACM;EACN,KAAK,SAAS,YAAY,SAAS,KAAK,OAAO,OAAO,GAAG,GAAG;EAC5D,IAAID,kBAAAA,WAAW,GAAG,GAAG,KAAK,KAAK,KAAK;GAAE,UAAU;GAAK;EAAI,CAAC;EAC1D,OAAO;CACT;CAEA,MAA+B,GAAM,GAAG,MAAqC;EAC3E,OAAO,KAAK,QAAQ,SAAS,GAAG,KAAK,IAAIE,mBAAAA,WAAW,KAAK,KAAK,CAAC;CACjE;CACA,IAAsB,GAA0B,GAAG,MAA4B;EAC7E,OAAO,KAAK,QAAQ,OAAO,GAAG,KAAK,IAAIA,mBAAAA,WAAW,KAAK,GAAG,CAAC;CAC7D;CACA,KACE,GACA,GAAG,MACG;EACN,MAAM,CAAC,OAAO,WAAW;EACzB,MAAM,UAAU,SAAS,YAAY,WAAW,WAAW,KAAA;EAC3D,OAAO,KAAK,QAAQ,QAAQ,GAAG,OAAOA,mBAAAA,WAAW,KAAK,IAAI,GAAG,OAAO;CACtE;CACA,MAAwB,GAA6B,GAAG,MAA4B;EAClF,OAAO,KAAK,QAAQ,UAAU,GAAG,KAAK,IAAIA,mBAAAA,WAAW,KAAK,KAAK,CAAC;CAClE;CACA,MAAmD,GAAM,GAAG,MAAqC;EAC/F,OAAO,KAAK,QAAQ,SAAS,GAAG,KAAK,IAAIA,mBAAAA,WAAW,KAAK,KAAK,CAAC;CACjE;CACA,QACE,GACA,GAAG,MACG;EACN,OAAO,KAAK,QAAQ,WAAW,GAAG,KAAK,IAAIA,mBAAAA,WAAW,KAAK,OAAO,CAAC;CACrE;CACA,OAAyB,GAA6B,GAAG,MAA4B;EACnF,OAAO,KAAK,QAAQ,UAAU,GAAG,KAAK,IAAIA,mBAAAA,WAAW,KAAK,MAAM,CAAC;CACnE;CAEA,OACE,YACA,OACA,SACM;EACN,gBAAgB,YAAY,OAAO,OAAO;EAE1C,MAAM,MAAMA,mBAAAA,WAAW,KAAK,MAAM;EAClC,MAAM,OAAO,QAAQ,KAAA,IAAY,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC;EACtD,MAAM,CAAC,OAAO,UAAU;EACxB,MAAM,WAAW,QAAsCD,kBAAAA,WAAW,IAAI;EAEtE,KAAK,KAAK,KAAK;GAAE,UAAU;GAAO;EAAI,GAAG;GAAE,UAAU;GAAQ;EAAI,CAAC;EAElE,MAAM,OAAO,QAAgD,CAC3D;GAAE,GAAG,YAAY,QAAQ,GAAG,GAAG,KAAK,EAAE,GAAG,MAAM,CAAC;GAAG,GAAG;EAAK,CAC7D;EACA,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,GAAI,SAAS,UAAU,KAAA,IAAY,EAAE,OAAO,QAAQ,MAAM,IAAI,CAAC;GAC/D,OAAO,CACL;IAAE,WAAW;KAAE,MAAM;KAAa,SAAS,QAAQ,KAAK;KAAG,GAAG;IAAK;IAAG,MAAM,IAAI,KAAK;GAAE,CACzF;GACA,WAAW,IAAI,MAAM;EACvB,GACA,GACF;CACF;CAIA,MAAM,GAAsD;EAC1D,MAAM,MAAMC,mBAAAA,WAAW,KAAK,KAAK;EACjC,IAAI,OAAO,MAAM,UACf,OAAO,KAAK,SAAS;GAAE,IAAI;GAAI,MAAM;GAAS,UAAUC,iBAAAA,WAAW,CAAC;EAAE,GAAG,GAAG;EAE9E,MAAM,MAAMA,iBAAAA,WAAW,EAAE,GAAG;EAC5B,MAAM,MAAMA,iBAAAA,WAAW,EAAE,GAAG;EAM5B,IAAI,IAAI,KAAK,IAAI,IACf,MAAM,IAAI,MACR,8DAA8D,EAAE,IAAI,WAAW,EAAE,IAAI,IACvF;EAEF,OAAO,KAAK,SAAS;GAAE,IAAI;GAAI,MAAM;GAAgB;GAAK;EAAI,GAAG,GAAG;CACtE;CAEA,WAAW,MAIF;EACP,MAAM,MAAMD,mBAAAA,WAAW,KAAK,UAAU;EACtC,MAAM,QAAQE,iBAAAA,iBAAiB,KAAK,QAAQ,EAAE;EAE9C,IADYA,iBAAAA,iBAAiB,KAAK,QAAQ,EACpC,KAAK,OACT,MAAM,IAAI,MACR,2EAA2E,KAAK,QAAQ,GAAG,IAAI,KAAK,QAAQ,GAAG,4CACjH;EAEF,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,MAAM,CAAC,GAAI,KAAK,QAAS;IAAC;IAAO;IAAO;IAAO;IAAO;IAAO;IAAO;GAAK,CAAY;GACrF,SAAS,CAAC,KAAK,QAAQ,IAAI,KAAK,QAAQ,EAAE;GAC1C,IAAI,KAAK,MAAM;EACjB,GACA,GACF;CACF;CAEA,UACE,WACA,MACM;EACN,MAAM,MAAMF,mBAAAA,WAAW,KAAK,SAAS;EACrC,MAAM,YAAY,KAAK,aAAa;EACpC,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,WAAWG,sBAAAA,OAAO,SAAS;GAC3B,SAASF,iBAAAA,WAAW,KAAK,OAAO;GAChC,WACE,cAAc,cAAc,cAAc,SACtC,YACA,eAAe,WAAW,KAAK,IAAI;EAC3C,GACA,GACF;CACF;CAEA,IAAI,UAAyB;EAE3B,KAAK,MAAM,KAAK,GAAG,eAAe,UAAU,KAAK,IAAI,CAAC;EACtD,OAAO;CACT;CAIA,OAAO,GAAG,MAA6C;EACrD,MAAM,MAAMD,mBAAAA,WAAW,KAAK,MAAM;EAClC,MAAM,QAAQ,OAAO,KAAK,OAAO,WAAW,KAAK,KAAK,KAAA;EACtD,MAAM,OAAQ,UAAU,KAAA,IAAY,OAAO,KAAK,MAAM,CAAC;EAEvD,MAAM,QAAsD,CAAC;EAC7D,IAAI;EACJ,KAAK,SAAS,KAAK,MAAM;GACvB,IAAI,MAAM,QAAQ,GAAG,GAAG;IACtB,IAAI,cAAc,KAAA,GAChB,MAAM,IAAI,MAAM,iEAAiE;IAEnF,MAAM,CAAC,WAAW,OAAO;IACzB,MAAM,KAAK;KAAE,WAAWG,sBAAAA,OAAO,SAAS;KAAG,MAAM,eAAe,KAAK,KAAK,IAAI;IAAE,CAAC;GACnF,OAAO;IACL,IAAI,cAAc,KAAA,GAChB,MAAM,IAAI,MAAM,2DAA2D;IAE7E,IAAI,MAAM,KAAK,SAAS,GACtB,MAAM,IAAI,MAAM,iEAAiE;IAEnF,YAAY,eAAe,KAAgB,KAAK,IAAI;GACtD;EACF,CAAC;EAED,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,GAAI,UAAU,KAAA,IAAY,EAAE,MAAM,IAAI,CAAC;GACvC;GACA,GAAI,cAAc,KAAA,IAAY,EAAE,UAAU,IAAI,CAAC;EACjD,GACA,GACF;CACF;CAEA,OAAO,WAAsB,MAAkC;EAC7D,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,WAAWA,sBAAAA,OAAO,SAAS;GAC3B,GAAI,MAAM,WAAW,KAAA,IAAY,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;EAC9D,GACAH,mBAAAA,WAAW,KAAK,MAAM,CACxB;CACF;CAEA,OAAO,MAA0D,MAA+B;EAC9F,MAAM,MAAMA,mBAAAA,WAAW,KAAK,MAAM;EAClC,MAAM,UAAU,OAAO,QAAQ,IAAI;EA8BnC,MAAM,QAvBc,QAAQ,KAAK,CAAC,MAAM,OAAO;GAC7C,IAAI,CAAC,SAAS,KAAK,IAAI,GACrB,MAAM,IAAI,MACR,uBAAuB,KAAK,2KAC9B;GAEF,MAAM,KAAK,EAAE,SAAS;GACtB,IAAI,KAAK,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC,IAAI,MAClC,MAAM,IAAI,MACR,kBAAkB,KAAK,WAAW,EAAE,OAAO,yEAC7C;GAQF,IAAI,KAAK,GACP,MAAM,IAAI,MAAM,kBAAkB,KAAK,WAAW,EAAE,OAAO,sBAAsB;GAEnF,OAAO,KAAK,MAAM,EAAE;EACtB,CACwB,CAAC,CAAC,QAAQ,KAAK,OAAO,MAAM,IAAI,CAAC;EACzD,IAAI,UAAU,KACZ,MAAM,IAAI,MAAM,0CAA0C,QAAQ,KAAK;EAEzE,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,GAAI,MAAM,QAAQ,KAAA,IAAY,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC;GACnD,MAAM,QAAQ,KAAK,CAAC,MAAM,QAAQ;IAChC;IACA,QAAQ,EAAE;IACV,MAAM,EAAE,OAAO,eAAe,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC;GACtD,EAAE;EACJ,GACA,GACF;CACF;CAEA,KAAK,QAAuB;EAC1B,OAAO,KAAK,SACV;GAAE,IAAI;GAAI,MAAM;GAAQ,GAAI,WAAW,KAAA,IAAY,EAAE,OAAO,IAAI,CAAC;EAAG,GACpEA,mBAAAA,WAAW,KAAK,IAAI,CACtB;CACF;CAEA,UAA4B,IAAiB,GAAG,SAA4B;EAC1E,MAAM,SAAU,QAAQ,MAAM,CAAC;EAC/B,KAAK,MAAM,CAAC,OAAO,UAAU,OAAO,QAAQ,MAAM,GAKhD,IAAI,EAHF,OAAO,UAAU,YACjB,UAAU,QACT,MAA6B,SAAS,oBAC7B,CAAC;GAAC;GAAU;GAAU;EAAS,CAAC,CAAC,SAAS,OAAO,KAAK,GAChE,MAAM,IAAI,UACR,cAAc,GAAG,KAAK,OAAO,MAAM,uFACrC;EAGJ,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,OAAO,GAAG;GACV,SAAS;EACX,GACAA,mBAAAA,WAAW,KAAK,SAAS,CAC3B;CACF;CAEA,IAAsB,GAAiB,GAAG,MAA4B;EACpE,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,QAAQ,EAAE;GACV,MAAO,KAAK,MAAM,CAAC;GACnB,UAAU,EAAE;EACd,GACAA,mBAAAA,WAAW,KAAK,GAAG,CACrB;CACF;AACF;;;;;AAOA,SAAgB,KAAK,OAA8C;CACjE,MAAM,UAAU,IAAI,gBAAgB;CACpC,MAAM,OAAO;CAEb,OAAO;EADsB,QAAQ;EAAM,OAAO,QAAQ;EAAO,MAAM,QAAQ;CACrE;AACZ"}
+{"version":3,"file":"flow.cjs","names":["isTemplate","CHANNEL_OF","captureLoc","durationIR","timeOfDayMinutes","condIR"],"sources":["../../src/dsl/flow.ts"],"sourcesContent":["import type { ChannelIR, ConditionIR, NodeIR, PropValueIR, SourceLocIR } from '../ir';\nimport { captureLoc } from '../provenance';\nimport {\n  type AnyTemplate,\n  CHANNEL_OF,\n  type DiscordTemplate,\n  type EmailTemplate,\n  type PropsSchema,\n  type PushTemplate,\n  type SlackTemplate,\n  isTemplate,\n} from '../templates';\nimport type { ActionRef } from './action';\nimport { type Duration, type TimeOfDay, type Weekday, durationIR, timeOfDayMinutes } from './base';\nimport { type Condition, condIR } from './condition';\nimport type { EventRef, MessageArgs, PropInput, PropsInput } from './refs';\nimport type { PropsOf, TemplateRef } from './template';\n\n/**\n * The flow chain — FlowBuilder is the DSL's step surface (messages, delays,\n * flow control, data), and its implementation is the compiler front half: each\n * chained call executes no logic, it just collects one IR node (ids are\n * assigned later, in workflow.toIR()). Sub-flow callbacks run exactly once at\n * construction — builder in, builder out — so the output is always a static\n * tree.\n *\n * Every public method also captures its callsite (provenance): the loc lands\n * in the node's hash-excluded meta and is the anchor for future in-place\n * editing from the studio.\n */\n\ntype Scalar = string | number | boolean;\n\n/** An emitted field: a scalar (or a profile ref to one); a nested field cannot be sent. */\ntype EmitValue<T> = [NonNullable<T>] extends [Scalar] ? PropInput<T> : never;\n\n/** The payload `sendEvent` accepts for an event: its fields, scalar ones only. */\nexport type EmitPayload<P> = { [K in keyof P]: EmitValue<P[K]> };\n\n/** Payload may be omitted when the event declares no required field. */\nexport type EmitArgs<P> =\n  Record<string, never> extends P ? [payload?: EmitPayload<P>] : [payload: EmitPayload<P>];\n\n/** Per-node push options. */\nexport interface PushOptions {\n  /** Which devices get a copy: 'all' (the default) or only the most recently registered. */\n  devices?: 'all' | 'latest';\n}\n\n/** `prefer()` options. */\nexport interface PreferOptions {\n  /** The generated branch's name in IR (UI title / observability handle), as `branch(label, …)`. */\n  label?: string;\n}\n\n/** The candidates `prefer()` takes: one push and one email template, in priority order. */\ntype PreferPair = readonly [PushTemplate, EmailTemplate] | readonly [EmailTemplate, PushTemplate];\n\ntype NormalizeProps<P> = { -readonly [K in keyof P]: P[K] };\ntype Equal<A, B> =\n  (<T>() => T extends A ? 1 : 2) extends <T>() => T extends B ? 1 : 2 ? true : false;\n\n/** Both candidates render the one props object, so they must declare the same props type — not merely overlap. */\ntype SameProps<T extends PreferPair> =\n  Equal<NormalizeProps<PropsOf<T[0]>>, NormalizeProps<PropsOf<T[1]>>> extends true\n    ? unknown\n    : { readonly __prefer_error__: 'Both templates must declare the same props type' };\n\n/** Distributes, so a field only one member of a union variable has still counts as extra. */\ntype KeysOfUnion<A> = A extends unknown ? keyof A : never;\n/** Rejects known extra fields, which `{}` (an empty props schema) would otherwise accept. */\ntype NoExtra<A, P> = Record<Exclude<KeysOfUnion<A>, keyof P>, never>;\n\n/** prefer() is typed strictly, but a JS caller (or an `any`) reaches it unchecked — fail at the call, not at send time. */\nfunction checkPreferArgs(candidates: unknown, props: unknown, options: unknown): void {\n  if (!Array.isArray(candidates) || candidates.length !== 2) {\n    throw new TypeError('prefer(): candidates must be exactly two templates — one push, one email');\n  }\n  const channels = (candidates as unknown[]).map((candidate) =>\n    isTemplate(candidate) ? CHANNEL_OF[candidate.kind] : undefined\n  );\n  if (!channels.every((channel) => channel === 'push' || channel === 'email')) {\n    throw new TypeError('prefer(): each candidate must be a pushTemplate or an emailTemplate');\n  }\n  if (channels[0] === channels[1]) {\n    throw new TypeError('prefer(): candidates must be one push and one email template');\n  }\n  if (typeof props !== 'object' || props === null || Array.isArray(props)) {\n    throw new TypeError(\n      'prefer(): props must be an object — pass {} when the templates declare none'\n    );\n  }\n  if (options === undefined) return;\n  if (typeof options !== 'object' || options === null || Array.isArray(options)) {\n    throw new TypeError('prefer(): options must be an object');\n  }\n  for (const [name, value] of Object.entries(options)) {\n    if (name !== 'label') {\n      throw new TypeError(\n        `prefer(): unknown option '${name}' — props go in the second argument, options take only 'label'`\n      );\n    }\n    if (typeof value !== 'string') throw new TypeError(\"prefer(): 'label' must be a string\");\n  }\n}\n\n/** A reusable flow fragment (what `flow(...)` returns), referenced directly by branch arms. */\nexport interface Flow {\n  readonly __flow: true;\n}\n\ninterface FlowInternal extends Flow {\n  readonly nodes: NodeIR[];\n  readonly uses: readonly TemplateUse[];\n}\n\n/**\n * @internal A template definition a flow sends, kept beside the IR (which names it by id only):\n * compileConfig checks that the registered definition under that id is this very object, so the\n * schema that typed the call is the one that renders it. Never part of the IR or its hash.\n */\nexport interface TemplateUse {\n  readonly template: AnyTemplate;\n  readonly loc: SourceLocIR | undefined;\n}\n\n/** @internal The template definitions a workflow sends, sub-flows and fragments included. */\nexport function templateUses(builder: FlowBuilder): readonly TemplateUse[] {\n  return builder instanceof FlowBuilderImpl ? builder.uses : [];\n}\n\n/** Sub-flow: a named fragment, or an inline callback (runs once at construction — builder in, builder out). */\nexport type SubFlow = Flow | ((w: FlowBuilder) => FlowBuilder);\n\n/** A branch arm: the [condition, sub-flow] tuple — an [if, then] ordering convention. */\nexport type BranchCase = readonly [condition: Condition, flow: SubFlow];\n\n/**\n * A branch argument: either a tuple arm, or a bare sub-flow meaning the default\n * arm. The bare form may appear once, and must come last (checked at runtime).\n */\nexport type BranchArm = BranchCase | SubFlow;\n\n/**\n * A cohort arm name has two jobs, and both constrain its spelling:\n * - it is interpolated into the node ids of the arm's flow ('{id}.{name}.{j}'),\n *   and an id is a durable step name — a dot would fake a nesting level and can\n *   collide with a real one, an empty name gives '{id}..{j}';\n * - it is an object key, and JavaScript lists integer-like keys first in\n *   ascending numeric order however the author wrote them. The arms array is\n *   documented (and interpreted) as authoring order, and the bucketing walk\n *   accumulates weights along it, so an arm named '0' added to a live\n *   experiment would prepend itself and re-bucket everyone already in it.\n */\nconst ARM_NAME = /^[A-Za-z_][A-Za-z0-9_-]*$/;\n\n/** A sub-flow's nodes; the template definitions it sends are added to `uses`. */\nfunction resolveSubFlow(sub: SubFlow, uses: TemplateUse[]): NodeIR[] {\n  if (typeof sub === 'function') {\n    const builder = new FlowBuilderImpl();\n    const returned: unknown = sub(builder);\n    // An async callback would add its nodes after construction is over — after ids were assigned\n    if (typeof (returned as { then?: unknown } | undefined)?.then === 'function') {\n      throw new TypeError(\n        'sub-flow callbacks must be synchronous: they run once, while the workflow is defined'\n      );\n    }\n    uses.push(...builder.uses);\n    return builder.nodes;\n  }\n  uses.push(...(sub as FlowInternal).uses);\n  /*\n   * A named fragment is a value, and the convention is to reuse it — two branch\n   * arms may hold the same one. Handing out its own nodes aliases them into\n   * both places, and assignIds writes ids *in place*: the second prefix\n   * overwrites the first, so the two placements end up as one object under one\n   * id — one durable step name, one message idempotency key, one bucket seed.\n   * A copy per placement is what makes a fragment behave like a value.\n   */\n  return structuredClone((sub as FlowInternal).nodes);\n}\n\nexport interface FlowBuilder {\n  /* ---- Messages: every channel is one message node; separate methods buy channel-level typing ---- */\n  email<T extends EmailTemplate>(template: T, ...props: MessageArgs<PropsOf<T>>): this;\n  sms<P extends object>(template: TemplateRef<'sms', P>, ...props: MessageArgs<P>): this;\n  /**\n   * Push to the user's devices — every device the host's directory lists, or\n   * only the most recently registered with `{ devices: 'latest' }`. A user with\n   * no device is skipped (`prefer([pushTpl, emailTpl], props)` falls back to email).\n   */\n  push<T extends PushTemplate>(\n    template: T,\n    ...args: [...props: MessageArgs<PropsOf<T>>, options?: PushOptions]\n  ): this;\n  inApp<P extends object>(template: TemplateRef<'in_app', P>, ...props: MessageArgs<P>): this;\n  slack<T extends SlackTemplate<PropsSchema, never>>(\n    template: T,\n    ...props: MessageArgs<PropsOf<T>>\n  ): this;\n  discord<T extends DiscordTemplate<PropsSchema, never>>(\n    template: T,\n    ...props: MessageArgs<PropsOf<T>>\n  ): this;\n  survey<P extends object>(template: TemplateRef<'survey', P>, ...props: MessageArgs<P>): this;\n\n  /**\n   * Send one message on the first channel the user can be reached on: one push\n   * and one email template, in priority order, rendered with the same props.\n   * Sugar for the branch it compiles to — same IR, ids and hash as writing\n   *\n   *   .branch(label, [reachable(first.channel), (b) => b.<first>(first, props)], (b) => b.<second>(second, props))\n   *\n   * so the choice is made once, when the step is reached, and a first choice\n   * that fails to send retries as itself — it never falls through to the\n   * second. Props are always passed (`{}` for templates that declare none),\n   * and both templates must declare the same props type; for differing props\n   * or other channels, write the branch.\n   *\n   *   .prefer([push.tip, email.tip], { name: u.name }, { label: 'tip by channel' })\n   */\n  prefer<const T extends PreferPair, const A extends PropsInput<NoInfer<PropsOf<T[0]>>>>(\n    candidates: T & SameProps<NoInfer<T>>,\n    props: A & NoInfer<NoExtra<A, PropsOf<T[0]>>>,\n    options?: PreferOptions\n  ): this;\n\n  /* --------------------------------- Delays --------------------------------- */\n  /** Time Delay; passing { min, max } makes it a Randomized Delay. */\n  delay(duration: Duration): this;\n  delay(range: { min: Duration; max: Duration }): this;\n\n  /** Time Window: hold until inside the window (e.g. weekdays 09:00–17:00). tz: 'user' uses the user's timezone. */\n  timeWindow(opts: {\n    days?: readonly Weekday[];\n    between: readonly [TimeOfDay, TimeOfDay];\n    tz?: 'user' | (string & {});\n  }): this;\n\n  /**\n   * Wait Until: continue on the main line once the condition holds, or take\n   * onTimeout when it expires (default 'continue'). On the engine side this is\n   * \"await event racing a timer\" — a native primitive of durable runtimes.\n   */\n  waitUntil(\n    condition: Condition,\n    opts: { timeout: Duration; onTimeout?: 'continue' | 'exit' | SubFlow }\n  ): this;\n\n  /**\n   * Splice a fragment in place: a named `flow(...)` or a callback, expanded\n   * once while the workflow is defined — a composition step before compiling,\n   * not a node (the IR has no trace of it, and ids are assigned over the whole\n   * workflow as if the steps were written inline). Each use gets its own copy,\n   * so one fragment can be used in several places and workflows.\n   *\n   *   const officeHours = flow((w) => w.timeWindow({ days: ['mon', 'tue', 'wed', 'thu', 'fri'], between: ['09:00', '17:00'] }));\n   *   workflow({ id: 'onboarding', ... }).delay('1 day').use(officeHours).email(email.tip, { name: u.name })\n   */\n  use(fragment: SubFlow): this;\n\n  /* ------------------------------ Flow Control ------------------------------ */\n  /**\n   * Conditional branch: ordered first-match (same semantics as Step Functions\n   * Choice / Knock branch). This one primitive covers both the UI's True/False\n   * Branch (two arms) and Multi-Split Branch (N arms). Arms are\n   * [condition, sub-flow] tuples; a bare sub-flow in tail position is the\n   * default arm. With no match and no default, execution simply continues.\n   * Rejoin is structural: after the matching arm finishes, execution resumes\n   * at the node following the branch — to opt out, call .exit() inside the arm.\n   *\n   *   .branch([activeSubscriber, upgradeFlow], firstTimeFlow)   // True/False\n   *   .branch([vip, vipFlow], [trial, trialFlow], defaultFlow)  // Multi-Split\n   *   .branch([not(usedStaging), eduFlow])                      // single arm: no match continues\n   *\n   * The optional first argument `label` becomes the node's name in IR (UI title\n   * / observability handle). It is not a jump target — there is no goto here;\n   * looping is a future re-entry-policy topic (see sendEvent). Arm labels in\n   * the UI are derived from the condition.\n   */\n  branch(...arms: readonly BranchArm[]): this;\n  branch(label: string, ...arms: readonly BranchArm[]): this;\n\n  /**\n   * Gate: exit unless the condition holds, otherwise continue. A first-class\n   * node rather than sugar over branch — same semantics as Zapier's \"only\n   * continue if\" / Iterable's Filter tile, and rendered on its own in the UI.\n   * `reason` is the audit-log line — metadata, so rewording it is free\n   * (excluded from contentHash, see hash.ts).\n   */\n  filter(condition: Condition, opts?: { reason?: string }): this;\n\n  /**\n   * Random Cohort Branch (A/B): weights must sum to 100 (checked at runtime).\n   * `key` names the experiment: bucketing hashes `userId:key` instead of the\n   * structural node id, so assignments survive node insertion/moves and the\n   * experiment keeps one identity across workflow versions — set it for any\n   * A/B whose results you intend to read.\n   *\n   * Arm names become node id segments and are read back in authoring order, so\n   * they are restricted to letters, digits, '_' and '-', never starting with a\n   * digit (checked at runtime).\n   */\n  cohort(arms: Record<string, { weight: number; flow?: SubFlow }>, opts?: { key?: string }): this;\n\n  /**\n   * Exit: end the whole workflow immediately (the UI's Exit node); `reason`\n   * goes into the audit log and is metadata, so rewording it neither repins\n   * in-flight journeys nor shows up in plan. Inside a branch arm this means\n   * \"terminate, do not rejoin\" — it stops here instead of falling through,\n   * while an arm without exit rejoins naturally.\n   */\n  exit(reason?: string): this;\n\n  /* ---------------------------------- Data ---------------------------------- */\n  /**\n   * Emit a typed event (customer.io's Send Event). The event comes from an\n   * e.xxx reference, so payload types flow in the same way trigger.event works.\n   * This is how workflows compose: an event can trigger another workflow, and\n   * the resulting call graph is statically analyzable. Payload values may\n   * reference u.xxx. Only scalar fields can be sent (IR carries literals and\n   * profile refs, not nested JSON): an event whose payload requires a nested\n   * field cannot be emitted from a journey, and the types say so.\n   *\n   * Note on loops: a trailing self-triggering sendEvent will become the\n   * official periodic-flow shape *once a re-entry policy exists* — today the\n   * entry policy is once-per-user, so a self-trigger cannot re-enter and does\n   * not loop.\n   * TODO: the rest of the Data category — outbound webhook / profile update /\n   * journey attributes.\n   */\n  sendEvent<P extends object>(event: EventRef<P>, ...payload: EmitArgs<P>): this;\n\n  /**\n   * Run a custom action (see dsl/action.ts for the model). The chain records\n   * identity only — name, args, codeHash — never the code: the implementation\n   * ships inside the deployed Worker bundle and is resolved by name from the\n   * runtime registry. Args are typed by the ActionRef and may reference u.xxx,\n   * resolved at run time exactly like message props. Executed inside a durable\n   * step: retried on throw, checkpointed on success.\n   */\n  run<A extends object>(action: ActionRef<A>, ...args: MessageArgs<A>): this;\n}\n\nconst DEFINED_CHANNELS: ReadonlySet<ChannelIR> = new Set(Object.values(CHANNEL_OF));\n\n/** A message's template: a definition of the channel (named by its id), or a reference by key. */\ntype MessageTemplate = AnyTemplate | TemplateRef;\n\nfunction templateKey(channel: ChannelIR, tpl: MessageTemplate): string {\n  if (!DEFINED_CHANNELS.has(channel)) return (tpl as TemplateRef).key;\n  // Typed, but a JS caller (or an `any`) reaches it unchecked: fail where the workflow is written\n  if (!isTemplate(tpl) || CHANNEL_OF[tpl.kind] !== channel) {\n    throw new TypeError(`${channel}(): expects a ${channel} template definition`);\n  }\n  return tpl.id;\n}\n\nfunction messageNode(\n  channel: ChannelIR,\n  tpl: MessageTemplate,\n  props: object | undefined,\n  devices?: 'latest'\n): NodeIR {\n  return {\n    id: '',\n    type: 'message',\n    channel,\n    template: templateKey(channel, tpl),\n    props: (props ?? {}) as Record<string, PropValueIR>,\n    // Absent for 'all', so adding the option left every existing push's hash as it was\n    ...(devices !== undefined ? { devices } : {}),\n  };\n}\n\n/* oxlint-disable typescript/unbound-method --\n * `captureLoc(this.xxx)` passes the method by identity as the stack-trace\n * boundary for Error.captureStackTrace; it is never invoked, so `this`\n * scoping cannot go wrong. */\n/** @internal extended by WorkflowBuilderImpl; not part of the public API */\nexport class FlowBuilderImpl implements FlowBuilder {\n  /** Nodes as collected; ids are assigned in one pass inside toIR, so '' is a placeholder here. */\n  readonly nodes: NodeIR[] = [];\n  /** The template definitions sent, with where: compile-time only, never in the IR. */\n  readonly uses: TemplateUse[] = [];\n\n  /** Provenance: the callsite (captured in the public method) lands in meta.loc, outside the hash. */\n  private pushNode(node: NodeIR, loc: SourceLocIR | undefined): this {\n    this.nodes.push({ ...node, ...(loc !== undefined ? { meta: { loc } } : {}) });\n    return this;\n  }\n\n  private message(\n    channel: ChannelIR,\n    tpl: MessageTemplate,\n    props: object | undefined,\n    loc: SourceLocIR | undefined,\n    devices?: 'latest'\n  ): this {\n    this.pushNode(messageNode(channel, tpl, props, devices), loc);\n    if (isTemplate(tpl)) this.uses.push({ template: tpl, loc });\n    return this;\n  }\n\n  email<T extends EmailTemplate>(t: T, ...args: MessageArgs<PropsOf<T>>): this {\n    return this.message('email', t, args[0], captureLoc(this.email));\n  }\n  sms<P extends object>(t: TemplateRef<'sms', P>, ...args: MessageArgs<P>): this {\n    return this.message('sms', t, args[0], captureLoc(this.sms));\n  }\n  push<T extends PushTemplate>(\n    t: T,\n    ...args: [...props: MessageArgs<PropsOf<T>>, options?: PushOptions]\n  ): this {\n    const [props, options] = args as unknown as [object | undefined, PushOptions | undefined];\n    const devices = options?.devices === 'latest' ? 'latest' : undefined;\n    return this.message('push', t, props, captureLoc(this.push), devices);\n  }\n  inApp<P extends object>(t: TemplateRef<'in_app', P>, ...args: MessageArgs<P>): this {\n    return this.message('in_app', t, args[0], captureLoc(this.inApp));\n  }\n  slack<T extends SlackTemplate<PropsSchema, never>>(t: T, ...args: MessageArgs<PropsOf<T>>): this {\n    return this.message('slack', t, args[0], captureLoc(this.slack));\n  }\n  discord<T extends DiscordTemplate<PropsSchema, never>>(\n    t: T,\n    ...args: MessageArgs<PropsOf<T>>\n  ): this {\n    return this.message('discord', t, args[0], captureLoc(this.discord));\n  }\n  survey<P extends object>(t: TemplateRef<'survey', P>, ...args: MessageArgs<P>): this {\n    return this.message('survey', t, args[0], captureLoc(this.survey));\n  }\n\n  prefer<const T extends PreferPair, const A extends PropsInput<NoInfer<PropsOf<T[0]>>>>(\n    candidates: T & SameProps<NoInfer<T>>,\n    props: A & NoInfer<NoExtra<A, PropsOf<T[0]>>>,\n    options?: PreferOptions\n  ): this {\n    checkPreferArgs(candidates, props, options);\n    // Every generated node points at the author's prefer() call, not at this method's body\n    const loc = captureLoc(this.prefer);\n    const meta = loc !== undefined ? { meta: { loc } } : {};\n    const [first, second] = candidates as readonly (EmailTemplate | PushTemplate)[];\n    const channel = (tpl: EmailTemplate | PushTemplate) => CHANNEL_OF[tpl.kind] as 'email' | 'push';\n    // Both are sent from here as far as the registry check goes, the fallback included\n    this.uses.push({ template: first, loc }, { template: second, loc });\n    // A copy per message, as two separately written calls would hold\n    const arm = (tpl: EmailTemplate | PushTemplate): NodeIR[] => [\n      { ...messageNode(channel(tpl), tpl, { ...props }), ...meta },\n    ];\n    return this.pushNode(\n      {\n        id: '',\n        type: 'branch',\n        ...(options?.label !== undefined ? { label: options.label } : {}),\n        cases: [\n          { condition: { type: 'reachable', channel: channel(first), ...meta }, flow: arm(first) },\n        ],\n        otherwise: arm(second),\n      },\n      loc\n    );\n  }\n\n  delay(duration: Duration): this;\n  delay(range: { min: Duration; max: Duration }): this;\n  delay(d: Duration | { min: Duration; max: Duration }): this {\n    const loc = captureLoc(this.delay);\n    if (typeof d === 'string') {\n      return this.pushNode({ id: '', type: 'delay', duration: durationIR(d) }, loc);\n    }\n    const min = durationIR(d.min);\n    const max = durationIR(d.max);\n    /*\n     * The interpreter draws `min + random(max - min)` with the span clamped at\n     * zero, so a backwards range does not fail — it quietly collapses into a\n     * fixed `min` sleep. Reject it here, where the author can still see it.\n     */\n    if (max.ms < min.ms) {\n      throw new Error(\n        `delay(): 'max' must not be shorter than 'min', got { min: '${d.min}', max: '${d.max}' }`\n      );\n    }\n    return this.pushNode({ id: '', type: 'random_delay', min, max }, loc);\n  }\n\n  timeWindow(opts: {\n    days?: readonly Weekday[];\n    between: readonly [TimeOfDay, TimeOfDay];\n    tz?: 'user' | (string & {});\n  }): this {\n    const loc = captureLoc(this.timeWindow);\n    const start = timeOfDayMinutes(opts.between[0]);\n    const end = timeOfDayMinutes(opts.between[1]);\n    if (end <= start) {\n      throw new Error(\n        `timeWindow(): 'between' must open before it closes within one day, got [${opts.between[0]}, ${opts.between[1]}] (overnight windows are not supported yet)`\n      );\n    }\n    return this.pushNode(\n      {\n        id: '',\n        type: 'time_window',\n        days: [...(opts.days ?? (['mon', 'tue', 'wed', 'thu', 'fri', 'sat', 'sun'] as const))],\n        between: [opts.between[0], opts.between[1]],\n        tz: opts.tz ?? 'user',\n      },\n      loc\n    );\n  }\n\n  waitUntil(\n    condition: Condition,\n    opts: { timeout: Duration; onTimeout?: 'continue' | 'exit' | SubFlow }\n  ): this {\n    const loc = captureLoc(this.waitUntil);\n    const onTimeout = opts.onTimeout ?? 'continue';\n    return this.pushNode(\n      {\n        id: '',\n        type: 'wait_until',\n        condition: condIR(condition),\n        timeout: durationIR(opts.timeout),\n        onTimeout:\n          onTimeout === 'continue' || onTimeout === 'exit'\n            ? onTimeout\n            : resolveSubFlow(onTimeout, this.uses),\n      },\n      loc\n    );\n  }\n\n  use(fragment: SubFlow): this {\n    // The fragment's nodes carry their own provenance (where the fragment was written)\n    this.nodes.push(...resolveSubFlow(fragment, this.uses));\n    return this;\n  }\n\n  branch(...arms: readonly BranchArm[]): this;\n  branch(label: string, ...arms: readonly BranchArm[]): this;\n  branch(...args: readonly (string | BranchArm)[]): this {\n    const loc = captureLoc(this.branch);\n    const label = typeof args[0] === 'string' ? args[0] : undefined;\n    const arms = (label === undefined ? args : args.slice(1)) as readonly BranchArm[];\n\n    const cases: { condition: ConditionIR; flow: NodeIR[] }[] = [];\n    let otherwise: NodeIR[] | undefined;\n    arms.forEach((arm, i) => {\n      if (Array.isArray(arm)) {\n        if (otherwise !== undefined) {\n          throw new Error('branch(): default arm (bare sub-flow) must be the last argument');\n        }\n        const [condition, sub] = arm as BranchCase;\n        cases.push({ condition: condIR(condition), flow: resolveSubFlow(sub, this.uses) });\n      } else {\n        if (otherwise !== undefined) {\n          throw new Error('branch(): only one default arm (bare sub-flow) is allowed');\n        }\n        if (i !== arms.length - 1) {\n          throw new Error('branch(): default arm (bare sub-flow) must be the last argument');\n        }\n        otherwise = resolveSubFlow(arm as SubFlow, this.uses);\n      }\n    });\n\n    return this.pushNode(\n      {\n        id: '',\n        type: 'branch',\n        ...(label !== undefined ? { label } : {}),\n        cases,\n        ...(otherwise !== undefined ? { otherwise } : {}),\n      },\n      loc\n    );\n  }\n\n  filter(condition: Condition, opts?: { reason?: string }): this {\n    return this.pushNode(\n      {\n        id: '',\n        type: 'filter',\n        condition: condIR(condition),\n        ...(opts?.reason !== undefined ? { reason: opts.reason } : {}),\n      },\n      captureLoc(this.filter)\n    );\n  }\n\n  cohort(arms: Record<string, { weight: number; flow?: SubFlow }>, opts?: { key?: string }): this {\n    const loc = captureLoc(this.cohort);\n    const entries = Object.entries(arms);\n    /*\n     * Weights live on a 0.01% grid: the runtime buckets into 10,000 slots\n     * (basis points), so anything finer would be silently quantized — reject\n     * it here instead. Converting to integer basis points also makes the\n     * sum check exact; no epsilon needed.\n     */\n    const basisPoints = entries.map(([name, a]) => {\n      if (!ARM_NAME.test(name)) {\n        throw new Error(\n          `cohort(): arm name '${name}' must start with a letter or '_' and contain only letters, digits, '_' or '-' — arm names become node id segments, and integer-like names would silently reorder the arms`\n        );\n      }\n      const bp = a.weight * 100;\n      if (Math.abs(bp - Math.round(bp)) > 1e-6) {\n        throw new Error(\n          `cohort(): arm '${name}' weight ${a.weight} is finer than the 0.01% bucketing grid — use at most two decimal places`\n        );\n      }\n      /*\n       * The sum check alone accepts -50 / 150: the runtime walks the arms\n       * accumulating basis points and takes the first whose cumulative total\n       * clears the bucket, so a negative weight hands 100% of users to its\n       * neighbour instead of splitting anything.\n       */\n      if (bp < 0) {\n        throw new Error(`cohort(): arm '${name}' weight ${a.weight} must not be negative`);\n      }\n      return Math.round(bp);\n    });\n    const total = basisPoints.reduce((sum, bp) => sum + bp, 0);\n    if (total !== 10_000) {\n      throw new Error(`cohort(): weights must sum to 100, got ${total / 100}`);\n    }\n    return this.pushNode(\n      {\n        id: '',\n        type: 'cohort',\n        ...(opts?.key !== undefined ? { key: opts.key } : {}),\n        arms: entries.map(([name, a]) => ({\n          name,\n          weight: a.weight,\n          flow: a.flow ? resolveSubFlow(a.flow, this.uses) : [],\n        })),\n      },\n      loc\n    );\n  }\n\n  exit(reason?: string): this {\n    return this.pushNode(\n      { id: '', type: 'exit', ...(reason !== undefined ? { reason } : {}) },\n      captureLoc(this.exit)\n    );\n  }\n\n  sendEvent<P extends object>(ev: EventRef<P>, ...payload: EmitArgs<P>): this {\n    const values = (payload[0] ?? {}) as Record<string, unknown>;\n    for (const [field, value] of Object.entries(values)) {\n      const ref =\n        typeof value === 'object' &&\n        value !== null &&\n        (value as { type?: unknown }).type === 'user_property';\n      if (!ref && !['string', 'number', 'boolean'].includes(typeof value)) {\n        throw new TypeError(\n          `sendEvent('${ev.name}'): '${field}' is not a scalar or a u.xxx reference — an emitted payload carries scalar fields only`\n        );\n      }\n    }\n    return this.pushNode(\n      {\n        id: '',\n        type: 'send_event',\n        event: ev.name,\n        payload: values as Record<string, PropValueIR>,\n      },\n      captureLoc(this.sendEvent)\n    );\n  }\n\n  run<A extends object>(a: ActionRef<A>, ...args: MessageArgs<A>): this {\n    return this.pushNode(\n      {\n        id: '',\n        type: 'action',\n        action: a.name,\n        args: (args[0] ?? {}) as Record<string, PropValueIR>,\n        codeHash: a.codeHash,\n      },\n      captureLoc(this.run)\n    );\n  }\n}\n/* oxlint-enable typescript/unbound-method */\n\n/**\n * A reusable flow fragment: a free function. Once personalization goes through\n * u.xxx and events through e.xxx, the flow layer carries no schema generics.\n */\nexport function flow(build: (w: FlowBuilder) => FlowBuilder): Flow {\n  const builder = new FlowBuilderImpl();\n  build(builder);\n  const impl: FlowInternal = { __flow: true, nodes: builder.nodes, uses: builder.uses };\n  return impl;\n}\n"],"mappings":";;;;;;;AA0EA,SAAS,gBAAgB,YAAqB,OAAgB,SAAwB;CACpF,IAAI,CAAC,MAAM,QAAQ,UAAU,KAAK,WAAW,WAAW,GACtD,MAAM,IAAI,UAAU,0EAA0E;CAEhG,MAAM,WAAY,WAAyB,KAAK,cAC9CA,kBAAAA,WAAW,SAAS,IAAIC,kBAAAA,WAAW,UAAU,QAAQ,KAAA,CACvD;CACA,IAAI,CAAC,SAAS,OAAO,YAAY,YAAY,UAAU,YAAY,OAAO,GACxE,MAAM,IAAI,UAAU,qEAAqE;CAE3F,IAAI,SAAS,OAAO,SAAS,IAC3B,MAAM,IAAI,UAAU,8DAA8D;CAEpF,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GACpE,MAAM,IAAI,UACR,6EACF;CAEF,IAAI,YAAY,KAAA,GAAW;CAC3B,IAAI,OAAO,YAAY,YAAY,YAAY,QAAQ,MAAM,QAAQ,OAAO,GAC1E,MAAM,IAAI,UAAU,qCAAqC;CAE3D,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,OAAO,GAAG;EACnD,IAAI,SAAS,SACX,MAAM,IAAI,UACR,6BAA6B,KAAK,+DACpC;EAEF,IAAI,OAAO,UAAU,UAAU,MAAM,IAAI,UAAU,oCAAoC;CACzF;AACF;;AAuBA,SAAgB,aAAa,SAA8C;CACzE,OAAO,mBAAmB,kBAAkB,QAAQ,OAAO,CAAC;AAC9D;;;;;;;;;;;;AAyBA,MAAM,WAAW;;AAGjB,SAAS,eAAe,KAAc,MAA+B;CACnE,IAAI,OAAO,QAAQ,YAAY;EAC7B,MAAM,UAAU,IAAI,gBAAgB;EAGpC,IAAI,OAFsB,IAAI,OAEX,CAAC,EAAqC,SAAS,YAChE,MAAM,IAAI,UACR,sFACF;EAEF,KAAK,KAAK,GAAG,QAAQ,IAAI;EACzB,OAAO,QAAQ;CACjB;CACA,KAAK,KAAK,GAAI,IAAqB,IAAI;CASvC,OAAO,gBAAiB,IAAqB,KAAK;AACpD;AAoKA,MAAM,mBAA2C,IAAI,IAAI,OAAO,OAAOA,kBAAAA,UAAU,CAAC;AAKlF,SAAS,YAAY,SAAoB,KAA8B;CACrE,IAAI,CAAC,iBAAiB,IAAI,OAAO,GAAG,OAAQ,IAAoB;CAEhE,IAAI,CAACD,kBAAAA,WAAW,GAAG,KAAKC,kBAAAA,WAAW,IAAI,UAAU,SAC/C,MAAM,IAAI,UAAU,GAAG,QAAQ,gBAAgB,QAAQ,qBAAqB;CAE9E,OAAO,IAAI;AACb;AAEA,SAAS,YACP,SACA,KACA,OACA,SACQ;CACR,OAAO;EACL,IAAI;EACJ,MAAM;EACN;EACA,UAAU,YAAY,SAAS,GAAG;EAClC,OAAQ,SAAS,CAAC;EAElB,GAAI,YAAY,KAAA,IAAY,EAAE,QAAQ,IAAI,CAAC;CAC7C;AACF;;AAOA,IAAa,kBAAb,MAAoD;;CAElD,QAA2B,CAAC;;CAE5B,OAA+B,CAAC;;CAGhC,SAAiB,MAAc,KAAoC;EACjE,KAAK,MAAM,KAAK;GAAE,GAAG;GAAM,GAAI,QAAQ,KAAA,IAAY,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC;EAAG,CAAC;EAC5E,OAAO;CACT;CAEA,QACE,SACA,KACA,OACA,KACA,SACM;EACN,KAAK,SAAS,YAAY,SAAS,KAAK,OAAO,OAAO,GAAG,GAAG;EAC5D,IAAID,kBAAAA,WAAW,GAAG,GAAG,KAAK,KAAK,KAAK;GAAE,UAAU;GAAK;EAAI,CAAC;EAC1D,OAAO;CACT;CAEA,MAA+B,GAAM,GAAG,MAAqC;EAC3E,OAAO,KAAK,QAAQ,SAAS,GAAG,KAAK,IAAIE,mBAAAA,WAAW,KAAK,KAAK,CAAC;CACjE;CACA,IAAsB,GAA0B,GAAG,MAA4B;EAC7E,OAAO,KAAK,QAAQ,OAAO,GAAG,KAAK,IAAIA,mBAAAA,WAAW,KAAK,GAAG,CAAC;CAC7D;CACA,KACE,GACA,GAAG,MACG;EACN,MAAM,CAAC,OAAO,WAAW;EACzB,MAAM,UAAU,SAAS,YAAY,WAAW,WAAW,KAAA;EAC3D,OAAO,KAAK,QAAQ,QAAQ,GAAG,OAAOA,mBAAAA,WAAW,KAAK,IAAI,GAAG,OAAO;CACtE;CACA,MAAwB,GAA6B,GAAG,MAA4B;EAClF,OAAO,KAAK,QAAQ,UAAU,GAAG,KAAK,IAAIA,mBAAAA,WAAW,KAAK,KAAK,CAAC;CAClE;CACA,MAAmD,GAAM,GAAG,MAAqC;EAC/F,OAAO,KAAK,QAAQ,SAAS,GAAG,KAAK,IAAIA,mBAAAA,WAAW,KAAK,KAAK,CAAC;CACjE;CACA,QACE,GACA,GAAG,MACG;EACN,OAAO,KAAK,QAAQ,WAAW,GAAG,KAAK,IAAIA,mBAAAA,WAAW,KAAK,OAAO,CAAC;CACrE;CACA,OAAyB,GAA6B,GAAG,MAA4B;EACnF,OAAO,KAAK,QAAQ,UAAU,GAAG,KAAK,IAAIA,mBAAAA,WAAW,KAAK,MAAM,CAAC;CACnE;CAEA,OACE,YACA,OACA,SACM;EACN,gBAAgB,YAAY,OAAO,OAAO;EAE1C,MAAM,MAAMA,mBAAAA,WAAW,KAAK,MAAM;EAClC,MAAM,OAAO,QAAQ,KAAA,IAAY,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC;EACtD,MAAM,CAAC,OAAO,UAAU;EACxB,MAAM,WAAW,QAAsCD,kBAAAA,WAAW,IAAI;EAEtE,KAAK,KAAK,KAAK;GAAE,UAAU;GAAO;EAAI,GAAG;GAAE,UAAU;GAAQ;EAAI,CAAC;EAElE,MAAM,OAAO,QAAgD,CAC3D;GAAE,GAAG,YAAY,QAAQ,GAAG,GAAG,KAAK,EAAE,GAAG,MAAM,CAAC;GAAG,GAAG;EAAK,CAC7D;EACA,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,GAAI,SAAS,UAAU,KAAA,IAAY,EAAE,OAAO,QAAQ,MAAM,IAAI,CAAC;GAC/D,OAAO,CACL;IAAE,WAAW;KAAE,MAAM;KAAa,SAAS,QAAQ,KAAK;KAAG,GAAG;IAAK;IAAG,MAAM,IAAI,KAAK;GAAE,CACzF;GACA,WAAW,IAAI,MAAM;EACvB,GACA,GACF;CACF;CAIA,MAAM,GAAsD;EAC1D,MAAM,MAAMC,mBAAAA,WAAW,KAAK,KAAK;EACjC,IAAI,OAAO,MAAM,UACf,OAAO,KAAK,SAAS;GAAE,IAAI;GAAI,MAAM;GAAS,UAAUC,iBAAAA,WAAW,CAAC;EAAE,GAAG,GAAG;EAE9E,MAAM,MAAMA,iBAAAA,WAAW,EAAE,GAAG;EAC5B,MAAM,MAAMA,iBAAAA,WAAW,EAAE,GAAG;EAM5B,IAAI,IAAI,KAAK,IAAI,IACf,MAAM,IAAI,MACR,8DAA8D,EAAE,IAAI,WAAW,EAAE,IAAI,IACvF;EAEF,OAAO,KAAK,SAAS;GAAE,IAAI;GAAI,MAAM;GAAgB;GAAK;EAAI,GAAG,GAAG;CACtE;CAEA,WAAW,MAIF;EACP,MAAM,MAAMD,mBAAAA,WAAW,KAAK,UAAU;EACtC,MAAM,QAAQE,iBAAAA,iBAAiB,KAAK,QAAQ,EAAE;EAE9C,IADYA,iBAAAA,iBAAiB,KAAK,QAAQ,EACpC,KAAK,OACT,MAAM,IAAI,MACR,2EAA2E,KAAK,QAAQ,GAAG,IAAI,KAAK,QAAQ,GAAG,4CACjH;EAEF,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,MAAM,CAAC,GAAI,KAAK,QAAS;IAAC;IAAO;IAAO;IAAO;IAAO;IAAO;IAAO;GAAK,CAAY;GACrF,SAAS,CAAC,KAAK,QAAQ,IAAI,KAAK,QAAQ,EAAE;GAC1C,IAAI,KAAK,MAAM;EACjB,GACA,GACF;CACF;CAEA,UACE,WACA,MACM;EACN,MAAM,MAAMF,mBAAAA,WAAW,KAAK,SAAS;EACrC,MAAM,YAAY,KAAK,aAAa;EACpC,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,WAAWG,sBAAAA,OAAO,SAAS;GAC3B,SAASF,iBAAAA,WAAW,KAAK,OAAO;GAChC,WACE,cAAc,cAAc,cAAc,SACtC,YACA,eAAe,WAAW,KAAK,IAAI;EAC3C,GACA,GACF;CACF;CAEA,IAAI,UAAyB;EAE3B,KAAK,MAAM,KAAK,GAAG,eAAe,UAAU,KAAK,IAAI,CAAC;EACtD,OAAO;CACT;CAIA,OAAO,GAAG,MAA6C;EACrD,MAAM,MAAMD,mBAAAA,WAAW,KAAK,MAAM;EAClC,MAAM,QAAQ,OAAO,KAAK,OAAO,WAAW,KAAK,KAAK,KAAA;EACtD,MAAM,OAAQ,UAAU,KAAA,IAAY,OAAO,KAAK,MAAM,CAAC;EAEvD,MAAM,QAAsD,CAAC;EAC7D,IAAI;EACJ,KAAK,SAAS,KAAK,MAAM;GACvB,IAAI,MAAM,QAAQ,GAAG,GAAG;IACtB,IAAI,cAAc,KAAA,GAChB,MAAM,IAAI,MAAM,iEAAiE;IAEnF,MAAM,CAAC,WAAW,OAAO;IACzB,MAAM,KAAK;KAAE,WAAWG,sBAAAA,OAAO,SAAS;KAAG,MAAM,eAAe,KAAK,KAAK,IAAI;IAAE,CAAC;GACnF,OAAO;IACL,IAAI,cAAc,KAAA,GAChB,MAAM,IAAI,MAAM,2DAA2D;IAE7E,IAAI,MAAM,KAAK,SAAS,GACtB,MAAM,IAAI,MAAM,iEAAiE;IAEnF,YAAY,eAAe,KAAgB,KAAK,IAAI;GACtD;EACF,CAAC;EAED,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,GAAI,UAAU,KAAA,IAAY,EAAE,MAAM,IAAI,CAAC;GACvC;GACA,GAAI,cAAc,KAAA,IAAY,EAAE,UAAU,IAAI,CAAC;EACjD,GACA,GACF;CACF;CAEA,OAAO,WAAsB,MAAkC;EAC7D,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,WAAWA,sBAAAA,OAAO,SAAS;GAC3B,GAAI,MAAM,WAAW,KAAA,IAAY,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;EAC9D,GACAH,mBAAAA,WAAW,KAAK,MAAM,CACxB;CACF;CAEA,OAAO,MAA0D,MAA+B;EAC9F,MAAM,MAAMA,mBAAAA,WAAW,KAAK,MAAM;EAClC,MAAM,UAAU,OAAO,QAAQ,IAAI;EA8BnC,MAAM,QAvBc,QAAQ,KAAK,CAAC,MAAM,OAAO;GAC7C,IAAI,CAAC,SAAS,KAAK,IAAI,GACrB,MAAM,IAAI,MACR,uBAAuB,KAAK,2KAC9B;GAEF,MAAM,KAAK,EAAE,SAAS;GACtB,IAAI,KAAK,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC,IAAI,MAClC,MAAM,IAAI,MACR,kBAAkB,KAAK,WAAW,EAAE,OAAO,yEAC7C;GAQF,IAAI,KAAK,GACP,MAAM,IAAI,MAAM,kBAAkB,KAAK,WAAW,EAAE,OAAO,sBAAsB;GAEnF,OAAO,KAAK,MAAM,EAAE;EACtB,CACwB,CAAC,CAAC,QAAQ,KAAK,OAAO,MAAM,IAAI,CAAC;EACzD,IAAI,UAAU,KACZ,MAAM,IAAI,MAAM,0CAA0C,QAAQ,KAAK;EAEzE,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,GAAI,MAAM,QAAQ,KAAA,IAAY,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC;GACnD,MAAM,QAAQ,KAAK,CAAC,MAAM,QAAQ;IAChC;IACA,QAAQ,EAAE;IACV,MAAM,EAAE,OAAO,eAAe,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC;GACtD,EAAE;EACJ,GACA,GACF;CACF;CAEA,KAAK,QAAuB;EAC1B,OAAO,KAAK,SACV;GAAE,IAAI;GAAI,MAAM;GAAQ,GAAI,WAAW,KAAA,IAAY,EAAE,OAAO,IAAI,CAAC;EAAG,GACpEA,mBAAAA,WAAW,KAAK,IAAI,CACtB;CACF;CAEA,UAA4B,IAAiB,GAAG,SAA4B;EAC1E,MAAM,SAAU,QAAQ,MAAM,CAAC;EAC/B,KAAK,MAAM,CAAC,OAAO,UAAU,OAAO,QAAQ,MAAM,GAKhD,IAAI,EAHF,OAAO,UAAU,YACjB,UAAU,QACT,MAA6B,SAAS,oBAC7B,CAAC;GAAC;GAAU;GAAU;EAAS,CAAC,CAAC,SAAS,OAAO,KAAK,GAChE,MAAM,IAAI,UACR,cAAc,GAAG,KAAK,OAAO,MAAM,uFACrC;EAGJ,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,OAAO,GAAG;GACV,SAAS;EACX,GACAA,mBAAAA,WAAW,KAAK,SAAS,CAC3B;CACF;CAEA,IAAsB,GAAiB,GAAG,MAA4B;EACpE,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,QAAQ,EAAE;GACV,MAAO,KAAK,MAAM,CAAC;GACnB,UAAU,EAAE;EACd,GACAA,mBAAAA,WAAW,KAAK,GAAG,CACrB;CACF;AACF;;;;;AAOA,SAAgB,KAAK,OAA8C;CACjE,MAAM,UAAU,IAAI,gBAAgB;CACpC,MAAM,OAAO;CAEb,OAAO;EADsB,QAAQ;EAAM,OAAO,QAAQ;EAAO,MAAM,QAAQ;CACrE;AACZ"}

package/dist/dsl/flow.d.cts

@@ -24,7 +24,7 @@ type EmitValue<T> = [NonNullable<T>] extends [Scalar] ? PropInput<T> : never;
 /** The payload `sendEvent` accepts for an event: its fields, scalar ones only. */
 export type EmitPayload<P> = { [K in keyof P]: EmitValue<P[K]>; };
 /** Payload may be omitted when the event declares no required field. */
-export type EmitArgs<P> = Record<never, never> extends P ? [payload?: EmitPayload<P>] : [payload: EmitPayload<P>];
+export type EmitArgs<P> = Record<string, never> extends P ? [payload?: EmitPayload<P>] : [payload: EmitPayload<P>];
 /** Per-node push options. */
 export interface PushOptions {
   /** Which devices get a copy: 'all' (the default) or only the most recently registered. */

package/dist/dsl/flow.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"flow.d.cts","names":[],"sources":["../../src/dsl/flow.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;KA+BK;;KAGA,UAAU,MAAM,YAAY,aAAa,UAAU,UAAU;;YAGtD,YAAY,QAAQ,WAAW,IAAI,UAAU,EAAE;;YAG/C,SAAS,KACnB,6BAA6B,KAAK,UAAU,YAAY,OAAO,SAAS,YAAY;;iBAGrE;;EAEf;;;iBAIe;;EAEf;;;KAIG,uBAAuB,cAAc,2BAA2B,eAAe;KAE/E,eAAe,kBAAkB,WAAW,IAAI,EAAE;KAClD,MAAM,GAAG,OACV,QAAQ,UAAU,qBAAoB,SAAQ,UAAU;;KAGvD,UAAU,UAAU,cACvB,MAAM,eAAe,QAAQ,QAAQ,eAAe,QAAQ;WAE7C;;;KAGZ,YAAY,KAAK,0BAA0B;;KAE3C,QAAQ,GAAG,KAAK,OAAO,QAAQ,YAAY,UAAU;;iBAoCzC;WACN;;;;;;;iBAaM;WACN,UAAU;WACV,KAAK;;;wBAIA,aAAa,SAAS,uBAAuB;;YAKjD,UAAU,SAAS,GAAG,gBAAgB;;YAGtC,uBAAuB,WAAW,WAAW,MAAM;;;;;YAMnD,YAAY,aAAa;iBAyCpB;EAEf,MAAM,UAAU,eAAe,UAAU,MAAM,OAAO,YAAY,QAAQ;EAC1E,IAAI,kBAAkB,UAAU,mBAAmB,OAAO,OAAO,YAAY;;;;;;EAM7E,KAAK,UAAU,cACb,UAAU,MACP,UAAU,OAAO,YAAY,QAAQ,KAAK,UAAU;EAEzD,MAAM,kBAAkB,UAAU,sBAAsB,OAAO,OAAO,YAAY;EAClF,MAAM,UAAU,cAAc,qBAC5B,UAAU,MACP,OAAO,YAAY,QAAQ;EAEhC,QAAQ,UAAU,gBAAgB,qBAChC,UAAU,MACP,OAAO,YAAY,QAAQ;EAEhC,OAAO,kBAAkB,UAAU,sBAAsB,OAAO,OAAO,YAAY;;;;;;;;;;;;;;;;EAiBnF,aAAa,UAAU,kBAAkB,UAAU,WAAW,QAAQ,QAAQ,SAC5E,YAAY,IAAI,UAAU,QAAQ,KAClC,OAAO,IAAI,QAAQ,QAAQ,GAAG,QAAQ,SACtC,UAAU;;EAKZ,MAAM,UAAU;EAChB,MAAM;IAAS,KAAK;IAAU,KAAK;;;EAGnC,WAAW;IACT,gBAAgB;IAChB,mBAAmB,WAAW;IAC9B;;;;;;;EAQF,UACE,WAAW,WACX;IAAQ,SAAS;IAAU,kCAAkC;;;;;;;;;;;;EAa/D,IAAI,UAAU;;;;;;;;;;;;;;;;;;;EAqBd,UAAU,eAAe;EACzB,OAAO,kBAAkB,eAAe;;;;;;;;EASxC,OAAO,WAAW,WAAW;IAAS;;;;;;;;;;;;;EAatC,OAAO,MAAM;IAAiB;IAAgB,OAAO;MAAY;IAAS;;;;;;;;;EAS1E,KAAK;;;;;;;;;;;;;;;;;EAmBL,UAAU,kBAAkB,OAAO,SAAS,OAAO,SAAS,SAAS;;;;;;;;;EAUrE,IAAI,kBAAkB,QAAQ,UAAU,OAAO,MAAM,YAAY;;;qBAuCtD,2BAA2B;;WAE7B,OAAO;;WAEP,MAAM;;UAGP;UAKA;EAYR,MAAM,UAAU,eAAe,GAAG,MAAM,MAAM,YAAY,QAAQ;EAGlE,IAAI,kBAAkB,GAAG,mBAAmB,OAAO,MAAM,YAAY;EAGrE,KAAK,UAAU,cACb,GAAG,MACA,UAAU,OAAO,YAAY,QAAQ,KAAK,UAAU;EAMzD,MAAM,kBAAkB,GAAG,sBAAsB,OAAO,MAAM,YAAY;EAG1E,MAAM,UAAU,cAAc,qBAAqB,GAAG,MAAM,MAAM,YAAY,QAAQ;EAGtF,QAAQ,UAAU,gBAAgB,qBAChC,GAAG,MACA,MAAM,YAAY,QAAQ;EAI/B,OAAO,kBAAkB,GAAG,sBAAsB,OAAO,MAAM,YAAY;EAI3E,aAAa,UAAU,kBAAkB,UAAU,WAAW,QAAQ,QAAQ,SAC5E,YAAY,IAAI,UAAU,QAAQ,KAClC,OAAO,IAAI,QAAQ,QAAQ,GAAG,QAAQ,SACtC,UAAU;EA4BZ,MAAM,UAAU;EAChB,MAAM;IAAS,KAAK;IAAU,KAAK;;EAqBnC,WAAW;IACT,gBAAgB;IAChB,mBAAmB,WAAW;IAC9B;;EAsBF,UACE,WAAW,WACX;IAAQ,SAAS;IAAU,kCAAkC;;EAmB/D,IAAI,UAAU;EAMd,UAAU,eAAe;EACzB,OAAO,kBAAkB,eAAe;EAsCxC,OAAO,WAAW,WAAW;IAAS;;EAYtC,OAAO,MAAM;IAAiB;IAAgB,OAAO;MAAY;IAAS;;EAmD1E,KAAK;EAOL,UAAU,kBAAkB,IAAI,SAAS,OAAO,SAAS,SAAS;EAwBlE,IAAI,kBAAkB,GAAG,UAAU,OAAO,MAAM,YAAY;;;;;;wBAmB9C,KAAK,QAAQ,GAAG,gBAAgB,cAAc"}
+{"version":3,"file":"flow.d.cts","names":[],"sources":["../../src/dsl/flow.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;KA+BK;;KAGA,UAAU,MAAM,YAAY,aAAa,UAAU,UAAU;;YAGtD,YAAY,QAAQ,WAAW,IAAI,UAAU,EAAE;;YAG/C,SAAS,KACnB,8BAA8B,KAAK,UAAU,YAAY,OAAO,SAAS,YAAY;;iBAGtE;;EAEf;;;iBAIe;;EAEf;;;KAIG,uBAAuB,cAAc,2BAA2B,eAAe;KAE/E,eAAe,kBAAkB,WAAW,IAAI,EAAE;KAClD,MAAM,GAAG,OACV,QAAQ,UAAU,qBAAoB,SAAQ,UAAU;;KAGvD,UAAU,UAAU,cACvB,MAAM,eAAe,QAAQ,QAAQ,eAAe,QAAQ;WAE7C;;;KAGZ,YAAY,KAAK,0BAA0B;;KAE3C,QAAQ,GAAG,KAAK,OAAO,QAAQ,YAAY,UAAU;;iBAoCzC;WACN;;;;;;;iBAaM;WACN,UAAU;WACV,KAAK;;;wBAIA,aAAa,SAAS,uBAAuB;;YAKjD,UAAU,SAAS,GAAG,gBAAgB;;YAGtC,uBAAuB,WAAW,WAAW,MAAM;;;;;YAMnD,YAAY,aAAa;iBAyCpB;EAEf,MAAM,UAAU,eAAe,UAAU,MAAM,OAAO,YAAY,QAAQ;EAC1E,IAAI,kBAAkB,UAAU,mBAAmB,OAAO,OAAO,YAAY;;;;;;EAM7E,KAAK,UAAU,cACb,UAAU,MACP,UAAU,OAAO,YAAY,QAAQ,KAAK,UAAU;EAEzD,MAAM,kBAAkB,UAAU,sBAAsB,OAAO,OAAO,YAAY;EAClF,MAAM,UAAU,cAAc,qBAC5B,UAAU,MACP,OAAO,YAAY,QAAQ;EAEhC,QAAQ,UAAU,gBAAgB,qBAChC,UAAU,MACP,OAAO,YAAY,QAAQ;EAEhC,OAAO,kBAAkB,UAAU,sBAAsB,OAAO,OAAO,YAAY;;;;;;;;;;;;;;;;EAiBnF,aAAa,UAAU,kBAAkB,UAAU,WAAW,QAAQ,QAAQ,SAC5E,YAAY,IAAI,UAAU,QAAQ,KAClC,OAAO,IAAI,QAAQ,QAAQ,GAAG,QAAQ,SACtC,UAAU;;EAKZ,MAAM,UAAU;EAChB,MAAM;IAAS,KAAK;IAAU,KAAK;;;EAGnC,WAAW;IACT,gBAAgB;IAChB,mBAAmB,WAAW;IAC9B;;;;;;;EAQF,UACE,WAAW,WACX;IAAQ,SAAS;IAAU,kCAAkC;;;;;;;;;;;;EAa/D,IAAI,UAAU;;;;;;;;;;;;;;;;;;;EAqBd,UAAU,eAAe;EACzB,OAAO,kBAAkB,eAAe;;;;;;;;EASxC,OAAO,WAAW,WAAW;IAAS;;;;;;;;;;;;;EAatC,OAAO,MAAM;IAAiB;IAAgB,OAAO;MAAY;IAAS;;;;;;;;;EAS1E,KAAK;;;;;;;;;;;;;;;;;EAmBL,UAAU,kBAAkB,OAAO,SAAS,OAAO,SAAS,SAAS;;;;;;;;;EAUrE,IAAI,kBAAkB,QAAQ,UAAU,OAAO,MAAM,YAAY;;;qBAuCtD,2BAA2B;;WAE7B,OAAO;;WAEP,MAAM;;UAGP;UAKA;EAYR,MAAM,UAAU,eAAe,GAAG,MAAM,MAAM,YAAY,QAAQ;EAGlE,IAAI,kBAAkB,GAAG,mBAAmB,OAAO,MAAM,YAAY;EAGrE,KAAK,UAAU,cACb,GAAG,MACA,UAAU,OAAO,YAAY,QAAQ,KAAK,UAAU;EAMzD,MAAM,kBAAkB,GAAG,sBAAsB,OAAO,MAAM,YAAY;EAG1E,MAAM,UAAU,cAAc,qBAAqB,GAAG,MAAM,MAAM,YAAY,QAAQ;EAGtF,QAAQ,UAAU,gBAAgB,qBAChC,GAAG,MACA,MAAM,YAAY,QAAQ;EAI/B,OAAO,kBAAkB,GAAG,sBAAsB,OAAO,MAAM,YAAY;EAI3E,aAAa,UAAU,kBAAkB,UAAU,WAAW,QAAQ,QAAQ,SAC5E,YAAY,IAAI,UAAU,QAAQ,KAClC,OAAO,IAAI,QAAQ,QAAQ,GAAG,QAAQ,SACtC,UAAU;EA4BZ,MAAM,UAAU;EAChB,MAAM;IAAS,KAAK;IAAU,KAAK;;EAqBnC,WAAW;IACT,gBAAgB;IAChB,mBAAmB,WAAW;IAC9B;;EAsBF,UACE,WAAW,WACX;IAAQ,SAAS;IAAU,kCAAkC;;EAmB/D,IAAI,UAAU;EAMd,UAAU,eAAe;EACzB,OAAO,kBAAkB,eAAe;EAsCxC,OAAO,WAAW,WAAW;IAAS;;EAYtC,OAAO,MAAM;IAAiB;IAAgB,OAAO;MAAY;IAAS;;EAmD1E,KAAK;EAOL,UAAU,kBAAkB,IAAI,SAAS,OAAO,SAAS,SAAS;EAwBlE,IAAI,kBAAkB,GAAG,UAAU,OAAO,MAAM,YAAY;;;;;;wBAmB9C,KAAK,QAAQ,GAAG,gBAAgB,cAAc"}

package/dist/dsl/flow.d.mts

@@ -24,7 +24,7 @@ type EmitValue<T> = [NonNullable<T>] extends [Scalar] ? PropInput<T> : never;
 /** The payload `sendEvent` accepts for an event: its fields, scalar ones only. */
 export type EmitPayload<P> = { [K in keyof P]: EmitValue<P[K]>; };
 /** Payload may be omitted when the event declares no required field. */
-export type EmitArgs<P> = Record<never, never> extends P ? [payload?: EmitPayload<P>] : [payload: EmitPayload<P>];
+export type EmitArgs<P> = Record<string, never> extends P ? [payload?: EmitPayload<P>] : [payload: EmitPayload<P>];
 /** Per-node push options. */
 export interface PushOptions {
   /** Which devices get a copy: 'all' (the default) or only the most recently registered. */

package/dist/dsl/flow.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"flow.d.mts","names":[],"sources":["../../src/dsl/flow.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;KA+BK;;KAGA,UAAU,MAAM,YAAY,aAAa,UAAU,UAAU;;YAGtD,YAAY,QAAQ,WAAW,IAAI,UAAU,EAAE;;YAG/C,SAAS,KACnB,6BAA6B,KAAK,UAAU,YAAY,OAAO,SAAS,YAAY;;iBAGrE;;EAEf;;;iBAIe;;EAEf;;;KAIG,uBAAuB,cAAc,2BAA2B,eAAe;KAE/E,eAAe,kBAAkB,WAAW,IAAI,EAAE;KAClD,MAAM,GAAG,OACV,QAAQ,UAAU,qBAAoB,SAAQ,UAAU;;KAGvD,UAAU,UAAU,cACvB,MAAM,eAAe,QAAQ,QAAQ,eAAe,QAAQ;WAE7C;;;KAGZ,YAAY,KAAK,0BAA0B;;KAE3C,QAAQ,GAAG,KAAK,OAAO,QAAQ,YAAY,UAAU;;iBAoCzC;WACN;;;;;;;iBAaM;WACN,UAAU;WACV,KAAK;;;wBAIA,aAAa,SAAS,uBAAuB;;YAKjD,UAAU,SAAS,GAAG,gBAAgB;;YAGtC,uBAAuB,WAAW,WAAW,MAAM;;;;;YAMnD,YAAY,aAAa;iBAyCpB;EAEf,MAAM,UAAU,eAAe,UAAU,MAAM,OAAO,YAAY,QAAQ;EAC1E,IAAI,kBAAkB,UAAU,mBAAmB,OAAO,OAAO,YAAY;;;;;;EAM7E,KAAK,UAAU,cACb,UAAU,MACP,UAAU,OAAO,YAAY,QAAQ,KAAK,UAAU;EAEzD,MAAM,kBAAkB,UAAU,sBAAsB,OAAO,OAAO,YAAY;EAClF,MAAM,UAAU,cAAc,qBAC5B,UAAU,MACP,OAAO,YAAY,QAAQ;EAEhC,QAAQ,UAAU,gBAAgB,qBAChC,UAAU,MACP,OAAO,YAAY,QAAQ;EAEhC,OAAO,kBAAkB,UAAU,sBAAsB,OAAO,OAAO,YAAY;;;;;;;;;;;;;;;;EAiBnF,aAAa,UAAU,kBAAkB,UAAU,WAAW,QAAQ,QAAQ,SAC5E,YAAY,IAAI,UAAU,QAAQ,KAClC,OAAO,IAAI,QAAQ,QAAQ,GAAG,QAAQ,SACtC,UAAU;;EAKZ,MAAM,UAAU;EAChB,MAAM;IAAS,KAAK;IAAU,KAAK;;;EAGnC,WAAW;IACT,gBAAgB;IAChB,mBAAmB,WAAW;IAC9B;;;;;;;EAQF,UACE,WAAW,WACX;IAAQ,SAAS;IAAU,kCAAkC;;;;;;;;;;;;EAa/D,IAAI,UAAU;;;;;;;;;;;;;;;;;;;EAqBd,UAAU,eAAe;EACzB,OAAO,kBAAkB,eAAe;;;;;;;;EASxC,OAAO,WAAW,WAAW;IAAS;;;;;;;;;;;;;EAatC,OAAO,MAAM;IAAiB;IAAgB,OAAO;MAAY;IAAS;;;;;;;;;EAS1E,KAAK;;;;;;;;;;;;;;;;;EAmBL,UAAU,kBAAkB,OAAO,SAAS,OAAO,SAAS,SAAS;;;;;;;;;EAUrE,IAAI,kBAAkB,QAAQ,UAAU,OAAO,MAAM,YAAY;;;qBAuCtD,2BAA2B;;WAE7B,OAAO;;WAEP,MAAM;;UAGP;UAKA;EAYR,MAAM,UAAU,eAAe,GAAG,MAAM,MAAM,YAAY,QAAQ;EAGlE,IAAI,kBAAkB,GAAG,mBAAmB,OAAO,MAAM,YAAY;EAGrE,KAAK,UAAU,cACb,GAAG,MACA,UAAU,OAAO,YAAY,QAAQ,KAAK,UAAU;EAMzD,MAAM,kBAAkB,GAAG,sBAAsB,OAAO,MAAM,YAAY;EAG1E,MAAM,UAAU,cAAc,qBAAqB,GAAG,MAAM,MAAM,YAAY,QAAQ;EAGtF,QAAQ,UAAU,gBAAgB,qBAChC,GAAG,MACA,MAAM,YAAY,QAAQ;EAI/B,OAAO,kBAAkB,GAAG,sBAAsB,OAAO,MAAM,YAAY;EAI3E,aAAa,UAAU,kBAAkB,UAAU,WAAW,QAAQ,QAAQ,SAC5E,YAAY,IAAI,UAAU,QAAQ,KAClC,OAAO,IAAI,QAAQ,QAAQ,GAAG,QAAQ,SACtC,UAAU;EA4BZ,MAAM,UAAU;EAChB,MAAM;IAAS,KAAK;IAAU,KAAK;;EAqBnC,WAAW;IACT,gBAAgB;IAChB,mBAAmB,WAAW;IAC9B;;EAsBF,UACE,WAAW,WACX;IAAQ,SAAS;IAAU,kCAAkC;;EAmB/D,IAAI,UAAU;EAMd,UAAU,eAAe;EACzB,OAAO,kBAAkB,eAAe;EAsCxC,OAAO,WAAW,WAAW;IAAS;;EAYtC,OAAO,MAAM;IAAiB;IAAgB,OAAO;MAAY;IAAS;;EAmD1E,KAAK;EAOL,UAAU,kBAAkB,IAAI,SAAS,OAAO,SAAS,SAAS;EAwBlE,IAAI,kBAAkB,GAAG,UAAU,OAAO,MAAM,YAAY;;;;;;wBAmB9C,KAAK,QAAQ,GAAG,gBAAgB,cAAc"}
+{"version":3,"file":"flow.d.mts","names":[],"sources":["../../src/dsl/flow.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;KA+BK;;KAGA,UAAU,MAAM,YAAY,aAAa,UAAU,UAAU;;YAGtD,YAAY,QAAQ,WAAW,IAAI,UAAU,EAAE;;YAG/C,SAAS,KACnB,8BAA8B,KAAK,UAAU,YAAY,OAAO,SAAS,YAAY;;iBAGtE;;EAEf;;;iBAIe;;EAEf;;;KAIG,uBAAuB,cAAc,2BAA2B,eAAe;KAE/E,eAAe,kBAAkB,WAAW,IAAI,EAAE;KAClD,MAAM,GAAG,OACV,QAAQ,UAAU,qBAAoB,SAAQ,UAAU;;KAGvD,UAAU,UAAU,cACvB,MAAM,eAAe,QAAQ,QAAQ,eAAe,QAAQ;WAE7C;;;KAGZ,YAAY,KAAK,0BAA0B;;KAE3C,QAAQ,GAAG,KAAK,OAAO,QAAQ,YAAY,UAAU;;iBAoCzC;WACN;;;;;;;iBAaM;WACN,UAAU;WACV,KAAK;;;wBAIA,aAAa,SAAS,uBAAuB;;YAKjD,UAAU,SAAS,GAAG,gBAAgB;;YAGtC,uBAAuB,WAAW,WAAW,MAAM;;;;;YAMnD,YAAY,aAAa;iBAyCpB;EAEf,MAAM,UAAU,eAAe,UAAU,MAAM,OAAO,YAAY,QAAQ;EAC1E,IAAI,kBAAkB,UAAU,mBAAmB,OAAO,OAAO,YAAY;;;;;;EAM7E,KAAK,UAAU,cACb,UAAU,MACP,UAAU,OAAO,YAAY,QAAQ,KAAK,UAAU;EAEzD,MAAM,kBAAkB,UAAU,sBAAsB,OAAO,OAAO,YAAY;EAClF,MAAM,UAAU,cAAc,qBAC5B,UAAU,MACP,OAAO,YAAY,QAAQ;EAEhC,QAAQ,UAAU,gBAAgB,qBAChC,UAAU,MACP,OAAO,YAAY,QAAQ;EAEhC,OAAO,kBAAkB,UAAU,sBAAsB,OAAO,OAAO,YAAY;;;;;;;;;;;;;;;;EAiBnF,aAAa,UAAU,kBAAkB,UAAU,WAAW,QAAQ,QAAQ,SAC5E,YAAY,IAAI,UAAU,QAAQ,KAClC,OAAO,IAAI,QAAQ,QAAQ,GAAG,QAAQ,SACtC,UAAU;;EAKZ,MAAM,UAAU;EAChB,MAAM;IAAS,KAAK;IAAU,KAAK;;;EAGnC,WAAW;IACT,gBAAgB;IAChB,mBAAmB,WAAW;IAC9B;;;;;;;EAQF,UACE,WAAW,WACX;IAAQ,SAAS;IAAU,kCAAkC;;;;;;;;;;;;EAa/D,IAAI,UAAU;;;;;;;;;;;;;;;;;;;EAqBd,UAAU,eAAe;EACzB,OAAO,kBAAkB,eAAe;;;;;;;;EASxC,OAAO,WAAW,WAAW;IAAS;;;;;;;;;;;;;EAatC,OAAO,MAAM;IAAiB;IAAgB,OAAO;MAAY;IAAS;;;;;;;;;EAS1E,KAAK;;;;;;;;;;;;;;;;;EAmBL,UAAU,kBAAkB,OAAO,SAAS,OAAO,SAAS,SAAS;;;;;;;;;EAUrE,IAAI,kBAAkB,QAAQ,UAAU,OAAO,MAAM,YAAY;;;qBAuCtD,2BAA2B;;WAE7B,OAAO;;WAEP,MAAM;;UAGP;UAKA;EAYR,MAAM,UAAU,eAAe,GAAG,MAAM,MAAM,YAAY,QAAQ;EAGlE,IAAI,kBAAkB,GAAG,mBAAmB,OAAO,MAAM,YAAY;EAGrE,KAAK,UAAU,cACb,GAAG,MACA,UAAU,OAAO,YAAY,QAAQ,KAAK,UAAU;EAMzD,MAAM,kBAAkB,GAAG,sBAAsB,OAAO,MAAM,YAAY;EAG1E,MAAM,UAAU,cAAc,qBAAqB,GAAG,MAAM,MAAM,YAAY,QAAQ;EAGtF,QAAQ,UAAU,gBAAgB,qBAChC,GAAG,MACA,MAAM,YAAY,QAAQ;EAI/B,OAAO,kBAAkB,GAAG,sBAAsB,OAAO,MAAM,YAAY;EAI3E,aAAa,UAAU,kBAAkB,UAAU,WAAW,QAAQ,QAAQ,SAC5E,YAAY,IAAI,UAAU,QAAQ,KAClC,OAAO,IAAI,QAAQ,QAAQ,GAAG,QAAQ,SACtC,UAAU;EA4BZ,MAAM,UAAU;EAChB,MAAM;IAAS,KAAK;IAAU,KAAK;;EAqBnC,WAAW;IACT,gBAAgB;IAChB,mBAAmB,WAAW;IAC9B;;EAsBF,UACE,WAAW,WACX;IAAQ,SAAS;IAAU,kCAAkC;;EAmB/D,IAAI,UAAU;EAMd,UAAU,eAAe;EACzB,OAAO,kBAAkB,eAAe;EAsCxC,OAAO,WAAW,WAAW;IAAS;;EAYtC,OAAO,MAAM;IAAiB;IAAgB,OAAO;MAAY;IAAS;;EAmD1E,KAAK;EAOL,UAAU,kBAAkB,IAAI,SAAS,OAAO,SAAS,SAAS;EAwBlE,IAAI,kBAAkB,GAAG,UAAU,OAAO,MAAM,YAAY;;;;;;wBAmB9C,KAAK,QAAQ,GAAG,gBAAgB,cAAc"}

package/dist/dsl/flow.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"flow.mjs","names":[],"sources":["../../src/dsl/flow.ts"],"sourcesContent":["import type { ChannelIR, ConditionIR, NodeIR, PropValueIR, SourceLocIR } from '../ir';\nimport { captureLoc } from '../provenance';\nimport {\n  type AnyTemplate,\n  CHANNEL_OF,\n  type DiscordTemplate,\n  type EmailTemplate,\n  type PropsSchema,\n  type PushTemplate,\n  type SlackTemplate,\n  isTemplate,\n} from '../templates';\nimport type { ActionRef } from './action';\nimport { type Duration, type TimeOfDay, type Weekday, durationIR, timeOfDayMinutes } from './base';\nimport { type Condition, condIR } from './condition';\nimport type { EventRef, MessageArgs, PropInput, PropsInput } from './refs';\nimport type { PropsOf, TemplateRef } from './template';\n\n/**\n * The flow chain — FlowBuilder is the DSL's step surface (messages, delays,\n * flow control, data), and its implementation is the compiler front half: each\n * chained call executes no logic, it just collects one IR node (ids are\n * assigned later, in workflow.toIR()). Sub-flow callbacks run exactly once at\n * construction — builder in, builder out — so the output is always a static\n * tree.\n *\n * Every public method also captures its callsite (provenance): the loc lands\n * in the node's hash-excluded meta and is the anchor for future in-place\n * editing from the studio.\n */\n\ntype Scalar = string | number | boolean;\n\n/** An emitted field: a scalar (or a profile ref to one); a nested field cannot be sent. */\ntype EmitValue<T> = [NonNullable<T>] extends [Scalar] ? PropInput<T> : never;\n\n/** The payload `sendEvent` accepts for an event: its fields, scalar ones only. */\nexport type EmitPayload<P> = { [K in keyof P]: EmitValue<P[K]> };\n\n/** Payload may be omitted when the event declares no required field. */\nexport type EmitArgs<P> =\n  Record<never, never> extends P ? [payload?: EmitPayload<P>] : [payload: EmitPayload<P>];\n\n/** Per-node push options. */\nexport interface PushOptions {\n  /** Which devices get a copy: 'all' (the default) or only the most recently registered. */\n  devices?: 'all' | 'latest';\n}\n\n/** `prefer()` options. */\nexport interface PreferOptions {\n  /** The generated branch's name in IR (UI title / observability handle), as `branch(label, …)`. */\n  label?: string;\n}\n\n/** The candidates `prefer()` takes: one push and one email template, in priority order. */\ntype PreferPair = readonly [PushTemplate, EmailTemplate] | readonly [EmailTemplate, PushTemplate];\n\ntype NormalizeProps<P> = { -readonly [K in keyof P]: P[K] };\ntype Equal<A, B> =\n  (<T>() => T extends A ? 1 : 2) extends <T>() => T extends B ? 1 : 2 ? true : false;\n\n/** Both candidates render the one props object, so they must declare the same props type — not merely overlap. */\ntype SameProps<T extends PreferPair> =\n  Equal<NormalizeProps<PropsOf<T[0]>>, NormalizeProps<PropsOf<T[1]>>> extends true\n    ? unknown\n    : { readonly __prefer_error__: 'Both templates must declare the same props type' };\n\n/** Distributes, so a field only one member of a union variable has still counts as extra. */\ntype KeysOfUnion<A> = A extends unknown ? keyof A : never;\n/** Rejects known extra fields, which `{}` (an empty props schema) would otherwise accept. */\ntype NoExtra<A, P> = Record<Exclude<KeysOfUnion<A>, keyof P>, never>;\n\n/** prefer() is typed strictly, but a JS caller (or an `any`) reaches it unchecked — fail at the call, not at send time. */\nfunction checkPreferArgs(candidates: unknown, props: unknown, options: unknown): void {\n  if (!Array.isArray(candidates) || candidates.length !== 2) {\n    throw new TypeError('prefer(): candidates must be exactly two templates — one push, one email');\n  }\n  const channels = (candidates as unknown[]).map((candidate) =>\n    isTemplate(candidate) ? CHANNEL_OF[candidate.kind] : undefined\n  );\n  if (!channels.every((channel) => channel === 'push' || channel === 'email')) {\n    throw new TypeError('prefer(): each candidate must be a pushTemplate or an emailTemplate');\n  }\n  if (channels[0] === channels[1]) {\n    throw new TypeError('prefer(): candidates must be one push and one email template');\n  }\n  if (typeof props !== 'object' || props === null || Array.isArray(props)) {\n    throw new TypeError(\n      'prefer(): props must be an object — pass {} when the templates declare none'\n    );\n  }\n  if (options === undefined) return;\n  if (typeof options !== 'object' || options === null || Array.isArray(options)) {\n    throw new TypeError('prefer(): options must be an object');\n  }\n  for (const [name, value] of Object.entries(options)) {\n    if (name !== 'label') {\n      throw new TypeError(\n        `prefer(): unknown option '${name}' — props go in the second argument, options take only 'label'`\n      );\n    }\n    if (typeof value !== 'string') throw new TypeError(\"prefer(): 'label' must be a string\");\n  }\n}\n\n/** A reusable flow fragment (what `flow(...)` returns), referenced directly by branch arms. */\nexport interface Flow {\n  readonly __flow: true;\n}\n\ninterface FlowInternal extends Flow {\n  readonly nodes: NodeIR[];\n  readonly uses: readonly TemplateUse[];\n}\n\n/**\n * @internal A template definition a flow sends, kept beside the IR (which names it by id only):\n * compileConfig checks that the registered definition under that id is this very object, so the\n * schema that typed the call is the one that renders it. Never part of the IR or its hash.\n */\nexport interface TemplateUse {\n  readonly template: AnyTemplate;\n  readonly loc: SourceLocIR | undefined;\n}\n\n/** @internal The template definitions a workflow sends, sub-flows and fragments included. */\nexport function templateUses(builder: FlowBuilder): readonly TemplateUse[] {\n  return builder instanceof FlowBuilderImpl ? builder.uses : [];\n}\n\n/** Sub-flow: a named fragment, or an inline callback (runs once at construction — builder in, builder out). */\nexport type SubFlow = Flow | ((w: FlowBuilder) => FlowBuilder);\n\n/** A branch arm: the [condition, sub-flow] tuple — an [if, then] ordering convention. */\nexport type BranchCase = readonly [condition: Condition, flow: SubFlow];\n\n/**\n * A branch argument: either a tuple arm, or a bare sub-flow meaning the default\n * arm. The bare form may appear once, and must come last (checked at runtime).\n */\nexport type BranchArm = BranchCase | SubFlow;\n\n/**\n * A cohort arm name has two jobs, and both constrain its spelling:\n * - it is interpolated into the node ids of the arm's flow ('{id}.{name}.{j}'),\n *   and an id is a durable step name — a dot would fake a nesting level and can\n *   collide with a real one, an empty name gives '{id}..{j}';\n * - it is an object key, and JavaScript lists integer-like keys first in\n *   ascending numeric order however the author wrote them. The arms array is\n *   documented (and interpreted) as authoring order, and the bucketing walk\n *   accumulates weights along it, so an arm named '0' added to a live\n *   experiment would prepend itself and re-bucket everyone already in it.\n */\nconst ARM_NAME = /^[A-Za-z_][A-Za-z0-9_-]*$/;\n\n/** A sub-flow's nodes; the template definitions it sends are added to `uses`. */\nfunction resolveSubFlow(sub: SubFlow, uses: TemplateUse[]): NodeIR[] {\n  if (typeof sub === 'function') {\n    const builder = new FlowBuilderImpl();\n    const returned: unknown = sub(builder);\n    // An async callback would add its nodes after construction is over — after ids were assigned\n    if (typeof (returned as { then?: unknown } | undefined)?.then === 'function') {\n      throw new TypeError(\n        'sub-flow callbacks must be synchronous: they run once, while the workflow is defined'\n      );\n    }\n    uses.push(...builder.uses);\n    return builder.nodes;\n  }\n  uses.push(...(sub as FlowInternal).uses);\n  /*\n   * A named fragment is a value, and the convention is to reuse it — two branch\n   * arms may hold the same one. Handing out its own nodes aliases them into\n   * both places, and assignIds writes ids *in place*: the second prefix\n   * overwrites the first, so the two placements end up as one object under one\n   * id — one durable step name, one message idempotency key, one bucket seed.\n   * A copy per placement is what makes a fragment behave like a value.\n   */\n  return structuredClone((sub as FlowInternal).nodes);\n}\n\nexport interface FlowBuilder {\n  /* ---- Messages: every channel is one message node; separate methods buy channel-level typing ---- */\n  email<T extends EmailTemplate>(template: T, ...props: MessageArgs<PropsOf<T>>): this;\n  sms<P extends object>(template: TemplateRef<'sms', P>, ...props: MessageArgs<P>): this;\n  /**\n   * Push to the user's devices — every device the host's directory lists, or\n   * only the most recently registered with `{ devices: 'latest' }`. A user with\n   * no device is skipped (`prefer([pushTpl, emailTpl], props)` falls back to email).\n   */\n  push<T extends PushTemplate>(\n    template: T,\n    ...args: [...props: MessageArgs<PropsOf<T>>, options?: PushOptions]\n  ): this;\n  inApp<P extends object>(template: TemplateRef<'in_app', P>, ...props: MessageArgs<P>): this;\n  slack<T extends SlackTemplate<PropsSchema, never>>(\n    template: T,\n    ...props: MessageArgs<PropsOf<T>>\n  ): this;\n  discord<T extends DiscordTemplate<PropsSchema, never>>(\n    template: T,\n    ...props: MessageArgs<PropsOf<T>>\n  ): this;\n  survey<P extends object>(template: TemplateRef<'survey', P>, ...props: MessageArgs<P>): this;\n\n  /**\n   * Send one message on the first channel the user can be reached on: one push\n   * and one email template, in priority order, rendered with the same props.\n   * Sugar for the branch it compiles to — same IR, ids and hash as writing\n   *\n   *   .branch(label, [reachable(first.channel), (b) => b.<first>(first, props)], (b) => b.<second>(second, props))\n   *\n   * so the choice is made once, when the step is reached, and a first choice\n   * that fails to send retries as itself — it never falls through to the\n   * second. Props are always passed (`{}` for templates that declare none),\n   * and both templates must declare the same props type; for differing props\n   * or other channels, write the branch.\n   *\n   *   .prefer([push.tip, email.tip], { name: u.name }, { label: 'tip by channel' })\n   */\n  prefer<const T extends PreferPair, const A extends PropsInput<NoInfer<PropsOf<T[0]>>>>(\n    candidates: T & SameProps<NoInfer<T>>,\n    props: A & NoInfer<NoExtra<A, PropsOf<T[0]>>>,\n    options?: PreferOptions\n  ): this;\n\n  /* --------------------------------- Delays --------------------------------- */\n  /** Time Delay; passing { min, max } makes it a Randomized Delay. */\n  delay(duration: Duration): this;\n  delay(range: { min: Duration; max: Duration }): this;\n\n  /** Time Window: hold until inside the window (e.g. weekdays 09:00–17:00). tz: 'user' uses the user's timezone. */\n  timeWindow(opts: {\n    days?: readonly Weekday[];\n    between: readonly [TimeOfDay, TimeOfDay];\n    tz?: 'user' | (string & {});\n  }): this;\n\n  /**\n   * Wait Until: continue on the main line once the condition holds, or take\n   * onTimeout when it expires (default 'continue'). On the engine side this is\n   * \"await event racing a timer\" — a native primitive of durable runtimes.\n   */\n  waitUntil(\n    condition: Condition,\n    opts: { timeout: Duration; onTimeout?: 'continue' | 'exit' | SubFlow }\n  ): this;\n\n  /**\n   * Splice a fragment in place: a named `flow(...)` or a callback, expanded\n   * once while the workflow is defined — a composition step before compiling,\n   * not a node (the IR has no trace of it, and ids are assigned over the whole\n   * workflow as if the steps were written inline). Each use gets its own copy,\n   * so one fragment can be used in several places and workflows.\n   *\n   *   const officeHours = flow((w) => w.timeWindow({ days: ['mon', 'tue', 'wed', 'thu', 'fri'], between: ['09:00', '17:00'] }));\n   *   workflow({ id: 'onboarding', ... }).delay('1 day').use(officeHours).email(email.tip, { name: u.name })\n   */\n  use(fragment: SubFlow): this;\n\n  /* ------------------------------ Flow Control ------------------------------ */\n  /**\n   * Conditional branch: ordered first-match (same semantics as Step Functions\n   * Choice / Knock branch). This one primitive covers both the UI's True/False\n   * Branch (two arms) and Multi-Split Branch (N arms). Arms are\n   * [condition, sub-flow] tuples; a bare sub-flow in tail position is the\n   * default arm. With no match and no default, execution simply continues.\n   * Rejoin is structural: after the matching arm finishes, execution resumes\n   * at the node following the branch — to opt out, call .exit() inside the arm.\n   *\n   *   .branch([activeSubscriber, upgradeFlow], firstTimeFlow)   // True/False\n   *   .branch([vip, vipFlow], [trial, trialFlow], defaultFlow)  // Multi-Split\n   *   .branch([not(usedStaging), eduFlow])                      // single arm: no match continues\n   *\n   * The optional first argument `label` becomes the node's name in IR (UI title\n   * / observability handle). It is not a jump target — there is no goto here;\n   * looping is a future re-entry-policy topic (see sendEvent). Arm labels in\n   * the UI are derived from the condition.\n   */\n  branch(...arms: readonly BranchArm[]): this;\n  branch(label: string, ...arms: readonly BranchArm[]): this;\n\n  /**\n   * Gate: exit unless the condition holds, otherwise continue. A first-class\n   * node rather than sugar over branch — same semantics as Zapier's \"only\n   * continue if\" / Iterable's Filter tile, and rendered on its own in the UI.\n   * `reason` is the audit-log line — metadata, so rewording it is free\n   * (excluded from contentHash, see hash.ts).\n   */\n  filter(condition: Condition, opts?: { reason?: string }): this;\n\n  /**\n   * Random Cohort Branch (A/B): weights must sum to 100 (checked at runtime).\n   * `key` names the experiment: bucketing hashes `userId:key` instead of the\n   * structural node id, so assignments survive node insertion/moves and the\n   * experiment keeps one identity across workflow versions — set it for any\n   * A/B whose results you intend to read.\n   *\n   * Arm names become node id segments and are read back in authoring order, so\n   * they are restricted to letters, digits, '_' and '-', never starting with a\n   * digit (checked at runtime).\n   */\n  cohort(arms: Record<string, { weight: number; flow?: SubFlow }>, opts?: { key?: string }): this;\n\n  /**\n   * Exit: end the whole workflow immediately (the UI's Exit node); `reason`\n   * goes into the audit log and is metadata, so rewording it neither repins\n   * in-flight journeys nor shows up in plan. Inside a branch arm this means\n   * \"terminate, do not rejoin\" — it stops here instead of falling through,\n   * while an arm without exit rejoins naturally.\n   */\n  exit(reason?: string): this;\n\n  /* ---------------------------------- Data ---------------------------------- */\n  /**\n   * Emit a typed event (customer.io's Send Event). The event comes from an\n   * e.xxx reference, so payload types flow in the same way trigger.event works.\n   * This is how workflows compose: an event can trigger another workflow, and\n   * the resulting call graph is statically analyzable. Payload values may\n   * reference u.xxx. Only scalar fields can be sent (IR carries literals and\n   * profile refs, not nested JSON): an event whose payload requires a nested\n   * field cannot be emitted from a journey, and the types say so.\n   *\n   * Note on loops: a trailing self-triggering sendEvent will become the\n   * official periodic-flow shape *once a re-entry policy exists* — today the\n   * entry policy is once-per-user, so a self-trigger cannot re-enter and does\n   * not loop.\n   * TODO: the rest of the Data category — outbound webhook / profile update /\n   * journey attributes.\n   */\n  sendEvent<P extends object>(event: EventRef<P>, ...payload: EmitArgs<P>): this;\n\n  /**\n   * Run a custom action (see dsl/action.ts for the model). The chain records\n   * identity only — name, args, codeHash — never the code: the implementation\n   * ships inside the deployed Worker bundle and is resolved by name from the\n   * runtime registry. Args are typed by the ActionRef and may reference u.xxx,\n   * resolved at run time exactly like message props. Executed inside a durable\n   * step: retried on throw, checkpointed on success.\n   */\n  run<A extends object>(action: ActionRef<A>, ...args: MessageArgs<A>): this;\n}\n\nconst DEFINED_CHANNELS: ReadonlySet<ChannelIR> = new Set(Object.values(CHANNEL_OF));\n\n/** A message's template: a definition of the channel (named by its id), or a reference by key. */\ntype MessageTemplate = AnyTemplate | TemplateRef;\n\nfunction templateKey(channel: ChannelIR, tpl: MessageTemplate): string {\n  if (!DEFINED_CHANNELS.has(channel)) return (tpl as TemplateRef).key;\n  // Typed, but a JS caller (or an `any`) reaches it unchecked: fail where the workflow is written\n  if (!isTemplate(tpl) || CHANNEL_OF[tpl.kind] !== channel) {\n    throw new TypeError(`${channel}(): expects a ${channel} template definition`);\n  }\n  return tpl.id;\n}\n\nfunction messageNode(\n  channel: ChannelIR,\n  tpl: MessageTemplate,\n  props: object | undefined,\n  devices?: 'latest'\n): NodeIR {\n  return {\n    id: '',\n    type: 'message',\n    channel,\n    template: templateKey(channel, tpl),\n    props: (props ?? {}) as Record<string, PropValueIR>,\n    // Absent for 'all', so adding the option left every existing push's hash as it was\n    ...(devices !== undefined ? { devices } : {}),\n  };\n}\n\n/* oxlint-disable typescript/unbound-method --\n * `captureLoc(this.xxx)` passes the method by identity as the stack-trace\n * boundary for Error.captureStackTrace; it is never invoked, so `this`\n * scoping cannot go wrong. */\n/** @internal extended by WorkflowBuilderImpl; not part of the public API */\nexport class FlowBuilderImpl implements FlowBuilder {\n  /** Nodes as collected; ids are assigned in one pass inside toIR, so '' is a placeholder here. */\n  readonly nodes: NodeIR[] = [];\n  /** The template definitions sent, with where: compile-time only, never in the IR. */\n  readonly uses: TemplateUse[] = [];\n\n  /** Provenance: the callsite (captured in the public method) lands in meta.loc, outside the hash. */\n  private pushNode(node: NodeIR, loc: SourceLocIR | undefined): this {\n    this.nodes.push({ ...node, ...(loc !== undefined ? { meta: { loc } } : {}) });\n    return this;\n  }\n\n  private message(\n    channel: ChannelIR,\n    tpl: MessageTemplate,\n    props: object | undefined,\n    loc: SourceLocIR | undefined,\n    devices?: 'latest'\n  ): this {\n    this.pushNode(messageNode(channel, tpl, props, devices), loc);\n    if (isTemplate(tpl)) this.uses.push({ template: tpl, loc });\n    return this;\n  }\n\n  email<T extends EmailTemplate>(t: T, ...args: MessageArgs<PropsOf<T>>): this {\n    return this.message('email', t, args[0], captureLoc(this.email));\n  }\n  sms<P extends object>(t: TemplateRef<'sms', P>, ...args: MessageArgs<P>): this {\n    return this.message('sms', t, args[0], captureLoc(this.sms));\n  }\n  push<T extends PushTemplate>(\n    t: T,\n    ...args: [...props: MessageArgs<PropsOf<T>>, options?: PushOptions]\n  ): this {\n    const [props, options] = args as unknown as [object | undefined, PushOptions | undefined];\n    const devices = options?.devices === 'latest' ? 'latest' : undefined;\n    return this.message('push', t, props, captureLoc(this.push), devices);\n  }\n  inApp<P extends object>(t: TemplateRef<'in_app', P>, ...args: MessageArgs<P>): this {\n    return this.message('in_app', t, args[0], captureLoc(this.inApp));\n  }\n  slack<T extends SlackTemplate<PropsSchema, never>>(t: T, ...args: MessageArgs<PropsOf<T>>): this {\n    return this.message('slack', t, args[0], captureLoc(this.slack));\n  }\n  discord<T extends DiscordTemplate<PropsSchema, never>>(\n    t: T,\n    ...args: MessageArgs<PropsOf<T>>\n  ): this {\n    return this.message('discord', t, args[0], captureLoc(this.discord));\n  }\n  survey<P extends object>(t: TemplateRef<'survey', P>, ...args: MessageArgs<P>): this {\n    return this.message('survey', t, args[0], captureLoc(this.survey));\n  }\n\n  prefer<const T extends PreferPair, const A extends PropsInput<NoInfer<PropsOf<T[0]>>>>(\n    candidates: T & SameProps<NoInfer<T>>,\n    props: A & NoInfer<NoExtra<A, PropsOf<T[0]>>>,\n    options?: PreferOptions\n  ): this {\n    checkPreferArgs(candidates, props, options);\n    // Every generated node points at the author's prefer() call, not at this method's body\n    const loc = captureLoc(this.prefer);\n    const meta = loc !== undefined ? { meta: { loc } } : {};\n    const [first, second] = candidates as readonly (EmailTemplate | PushTemplate)[];\n    const channel = (tpl: EmailTemplate | PushTemplate) => CHANNEL_OF[tpl.kind] as 'email' | 'push';\n    // Both are sent from here as far as the registry check goes, the fallback included\n    this.uses.push({ template: first, loc }, { template: second, loc });\n    // A copy per message, as two separately written calls would hold\n    const arm = (tpl: EmailTemplate | PushTemplate): NodeIR[] => [\n      { ...messageNode(channel(tpl), tpl, { ...props }), ...meta },\n    ];\n    return this.pushNode(\n      {\n        id: '',\n        type: 'branch',\n        ...(options?.label !== undefined ? { label: options.label } : {}),\n        cases: [\n          { condition: { type: 'reachable', channel: channel(first), ...meta }, flow: arm(first) },\n        ],\n        otherwise: arm(second),\n      },\n      loc\n    );\n  }\n\n  delay(duration: Duration): this;\n  delay(range: { min: Duration; max: Duration }): this;\n  delay(d: Duration | { min: Duration; max: Duration }): this {\n    const loc = captureLoc(this.delay);\n    if (typeof d === 'string') {\n      return this.pushNode({ id: '', type: 'delay', duration: durationIR(d) }, loc);\n    }\n    const min = durationIR(d.min);\n    const max = durationIR(d.max);\n    /*\n     * The interpreter draws `min + random(max - min)` with the span clamped at\n     * zero, so a backwards range does not fail — it quietly collapses into a\n     * fixed `min` sleep. Reject it here, where the author can still see it.\n     */\n    if (max.ms < min.ms) {\n      throw new Error(\n        `delay(): 'max' must not be shorter than 'min', got { min: '${d.min}', max: '${d.max}' }`\n      );\n    }\n    return this.pushNode({ id: '', type: 'random_delay', min, max }, loc);\n  }\n\n  timeWindow(opts: {\n    days?: readonly Weekday[];\n    between: readonly [TimeOfDay, TimeOfDay];\n    tz?: 'user' | (string & {});\n  }): this {\n    const loc = captureLoc(this.timeWindow);\n    const start = timeOfDayMinutes(opts.between[0]);\n    const end = timeOfDayMinutes(opts.between[1]);\n    if (end <= start) {\n      throw new Error(\n        `timeWindow(): 'between' must open before it closes within one day, got [${opts.between[0]}, ${opts.between[1]}] (overnight windows are not supported yet)`\n      );\n    }\n    return this.pushNode(\n      {\n        id: '',\n        type: 'time_window',\n        days: [...(opts.days ?? (['mon', 'tue', 'wed', 'thu', 'fri', 'sat', 'sun'] as const))],\n        between: [opts.between[0], opts.between[1]],\n        tz: opts.tz ?? 'user',\n      },\n      loc\n    );\n  }\n\n  waitUntil(\n    condition: Condition,\n    opts: { timeout: Duration; onTimeout?: 'continue' | 'exit' | SubFlow }\n  ): this {\n    const loc = captureLoc(this.waitUntil);\n    const onTimeout = opts.onTimeout ?? 'continue';\n    return this.pushNode(\n      {\n        id: '',\n        type: 'wait_until',\n        condition: condIR(condition),\n        timeout: durationIR(opts.timeout),\n        onTimeout:\n          onTimeout === 'continue' || onTimeout === 'exit'\n            ? onTimeout\n            : resolveSubFlow(onTimeout, this.uses),\n      },\n      loc\n    );\n  }\n\n  use(fragment: SubFlow): this {\n    // The fragment's nodes carry their own provenance (where the fragment was written)\n    this.nodes.push(...resolveSubFlow(fragment, this.uses));\n    return this;\n  }\n\n  branch(...arms: readonly BranchArm[]): this;\n  branch(label: string, ...arms: readonly BranchArm[]): this;\n  branch(...args: readonly (string | BranchArm)[]): this {\n    const loc = captureLoc(this.branch);\n    const label = typeof args[0] === 'string' ? args[0] : undefined;\n    const arms = (label === undefined ? args : args.slice(1)) as readonly BranchArm[];\n\n    const cases: { condition: ConditionIR; flow: NodeIR[] }[] = [];\n    let otherwise: NodeIR[] | undefined;\n    arms.forEach((arm, i) => {\n      if (Array.isArray(arm)) {\n        if (otherwise !== undefined) {\n          throw new Error('branch(): default arm (bare sub-flow) must be the last argument');\n        }\n        const [condition, sub] = arm as BranchCase;\n        cases.push({ condition: condIR(condition), flow: resolveSubFlow(sub, this.uses) });\n      } else {\n        if (otherwise !== undefined) {\n          throw new Error('branch(): only one default arm (bare sub-flow) is allowed');\n        }\n        if (i !== arms.length - 1) {\n          throw new Error('branch(): default arm (bare sub-flow) must be the last argument');\n        }\n        otherwise = resolveSubFlow(arm as SubFlow, this.uses);\n      }\n    });\n\n    return this.pushNode(\n      {\n        id: '',\n        type: 'branch',\n        ...(label !== undefined ? { label } : {}),\n        cases,\n        ...(otherwise !== undefined ? { otherwise } : {}),\n      },\n      loc\n    );\n  }\n\n  filter(condition: Condition, opts?: { reason?: string }): this {\n    return this.pushNode(\n      {\n        id: '',\n        type: 'filter',\n        condition: condIR(condition),\n        ...(opts?.reason !== undefined ? { reason: opts.reason } : {}),\n      },\n      captureLoc(this.filter)\n    );\n  }\n\n  cohort(arms: Record<string, { weight: number; flow?: SubFlow }>, opts?: { key?: string }): this {\n    const loc = captureLoc(this.cohort);\n    const entries = Object.entries(arms);\n    /*\n     * Weights live on a 0.01% grid: the runtime buckets into 10,000 slots\n     * (basis points), so anything finer would be silently quantized — reject\n     * it here instead. Converting to integer basis points also makes the\n     * sum check exact; no epsilon needed.\n     */\n    const basisPoints = entries.map(([name, a]) => {\n      if (!ARM_NAME.test(name)) {\n        throw new Error(\n          `cohort(): arm name '${name}' must start with a letter or '_' and contain only letters, digits, '_' or '-' — arm names become node id segments, and integer-like names would silently reorder the arms`\n        );\n      }\n      const bp = a.weight * 100;\n      if (Math.abs(bp - Math.round(bp)) > 1e-6) {\n        throw new Error(\n          `cohort(): arm '${name}' weight ${a.weight} is finer than the 0.01% bucketing grid — use at most two decimal places`\n        );\n      }\n      /*\n       * The sum check alone accepts -50 / 150: the runtime walks the arms\n       * accumulating basis points and takes the first whose cumulative total\n       * clears the bucket, so a negative weight hands 100% of users to its\n       * neighbour instead of splitting anything.\n       */\n      if (bp < 0) {\n        throw new Error(`cohort(): arm '${name}' weight ${a.weight} must not be negative`);\n      }\n      return Math.round(bp);\n    });\n    const total = basisPoints.reduce((sum, bp) => sum + bp, 0);\n    if (total !== 10_000) {\n      throw new Error(`cohort(): weights must sum to 100, got ${total / 100}`);\n    }\n    return this.pushNode(\n      {\n        id: '',\n        type: 'cohort',\n        ...(opts?.key !== undefined ? { key: opts.key } : {}),\n        arms: entries.map(([name, a]) => ({\n          name,\n          weight: a.weight,\n          flow: a.flow ? resolveSubFlow(a.flow, this.uses) : [],\n        })),\n      },\n      loc\n    );\n  }\n\n  exit(reason?: string): this {\n    return this.pushNode(\n      { id: '', type: 'exit', ...(reason !== undefined ? { reason } : {}) },\n      captureLoc(this.exit)\n    );\n  }\n\n  sendEvent<P extends object>(ev: EventRef<P>, ...payload: EmitArgs<P>): this {\n    const values = (payload[0] ?? {}) as Record<string, unknown>;\n    for (const [field, value] of Object.entries(values)) {\n      const ref =\n        typeof value === 'object' &&\n        value !== null &&\n        (value as { type?: unknown }).type === 'user_property';\n      if (!ref && !['string', 'number', 'boolean'].includes(typeof value)) {\n        throw new TypeError(\n          `sendEvent('${ev.name}'): '${field}' is not a scalar or a u.xxx reference — an emitted payload carries scalar fields only`\n        );\n      }\n    }\n    return this.pushNode(\n      {\n        id: '',\n        type: 'send_event',\n        event: ev.name,\n        payload: values as Record<string, PropValueIR>,\n      },\n      captureLoc(this.sendEvent)\n    );\n  }\n\n  run<A extends object>(a: ActionRef<A>, ...args: MessageArgs<A>): this {\n    return this.pushNode(\n      {\n        id: '',\n        type: 'action',\n        action: a.name,\n        args: (args[0] ?? {}) as Record<string, PropValueIR>,\n        codeHash: a.codeHash,\n      },\n      captureLoc(this.run)\n    );\n  }\n}\n/* oxlint-enable typescript/unbound-method */\n\n/**\n * A reusable flow fragment: a free function. Once personalization goes through\n * u.xxx and events through e.xxx, the flow layer carries no schema generics.\n */\nexport function flow(build: (w: FlowBuilder) => FlowBuilder): Flow {\n  const builder = new FlowBuilderImpl();\n  build(builder);\n  const impl: FlowInternal = { __flow: true, nodes: builder.nodes, uses: builder.uses };\n  return impl;\n}\n"],"mappings":";;;;;;AA0EA,SAAS,gBAAgB,YAAqB,OAAgB,SAAwB;CACpF,IAAI,CAAC,MAAM,QAAQ,UAAU,KAAK,WAAW,WAAW,GACtD,MAAM,IAAI,UAAU,0EAA0E;CAEhG,MAAM,WAAY,WAAyB,KAAK,cAC9C,WAAW,SAAS,IAAI,WAAW,UAAU,QAAQ,KAAA,CACvD;CACA,IAAI,CAAC,SAAS,OAAO,YAAY,YAAY,UAAU,YAAY,OAAO,GACxE,MAAM,IAAI,UAAU,qEAAqE;CAE3F,IAAI,SAAS,OAAO,SAAS,IAC3B,MAAM,IAAI,UAAU,8DAA8D;CAEpF,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GACpE,MAAM,IAAI,UACR,6EACF;CAEF,IAAI,YAAY,KAAA,GAAW;CAC3B,IAAI,OAAO,YAAY,YAAY,YAAY,QAAQ,MAAM,QAAQ,OAAO,GAC1E,MAAM,IAAI,UAAU,qCAAqC;CAE3D,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,OAAO,GAAG;EACnD,IAAI,SAAS,SACX,MAAM,IAAI,UACR,6BAA6B,KAAK,+DACpC;EAEF,IAAI,OAAO,UAAU,UAAU,MAAM,IAAI,UAAU,oCAAoC;CACzF;AACF;;AAuBA,SAAgB,aAAa,SAA8C;CACzE,OAAO,mBAAmB,kBAAkB,QAAQ,OAAO,CAAC;AAC9D;;;;;;;;;;;;AAyBA,MAAM,WAAW;;AAGjB,SAAS,eAAe,KAAc,MAA+B;CACnE,IAAI,OAAO,QAAQ,YAAY;EAC7B,MAAM,UAAU,IAAI,gBAAgB;EAGpC,IAAI,OAFsB,IAAI,OAEX,CAAC,EAAqC,SAAS,YAChE,MAAM,IAAI,UACR,sFACF;EAEF,KAAK,KAAK,GAAG,QAAQ,IAAI;EACzB,OAAO,QAAQ;CACjB;CACA,KAAK,KAAK,GAAI,IAAqB,IAAI;CASvC,OAAO,gBAAiB,IAAqB,KAAK;AACpD;AAoKA,MAAM,mBAA2C,IAAI,IAAI,OAAO,OAAO,UAAU,CAAC;AAKlF,SAAS,YAAY,SAAoB,KAA8B;CACrE,IAAI,CAAC,iBAAiB,IAAI,OAAO,GAAG,OAAQ,IAAoB;CAEhE,IAAI,CAAC,WAAW,GAAG,KAAK,WAAW,IAAI,UAAU,SAC/C,MAAM,IAAI,UAAU,GAAG,QAAQ,gBAAgB,QAAQ,qBAAqB;CAE9E,OAAO,IAAI;AACb;AAEA,SAAS,YACP,SACA,KACA,OACA,SACQ;CACR,OAAO;EACL,IAAI;EACJ,MAAM;EACN;EACA,UAAU,YAAY,SAAS,GAAG;EAClC,OAAQ,SAAS,CAAC;EAElB,GAAI,YAAY,KAAA,IAAY,EAAE,QAAQ,IAAI,CAAC;CAC7C;AACF;;AAOA,IAAa,kBAAb,MAAoD;;CAElD,QAA2B,CAAC;;CAE5B,OAA+B,CAAC;;CAGhC,SAAiB,MAAc,KAAoC;EACjE,KAAK,MAAM,KAAK;GAAE,GAAG;GAAM,GAAI,QAAQ,KAAA,IAAY,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC;EAAG,CAAC;EAC5E,OAAO;CACT;CAEA,QACE,SACA,KACA,OACA,KACA,SACM;EACN,KAAK,SAAS,YAAY,SAAS,KAAK,OAAO,OAAO,GAAG,GAAG;EAC5D,IAAI,WAAW,GAAG,GAAG,KAAK,KAAK,KAAK;GAAE,UAAU;GAAK;EAAI,CAAC;EAC1D,OAAO;CACT;CAEA,MAA+B,GAAM,GAAG,MAAqC;EAC3E,OAAO,KAAK,QAAQ,SAAS,GAAG,KAAK,IAAI,WAAW,KAAK,KAAK,CAAC;CACjE;CACA,IAAsB,GAA0B,GAAG,MAA4B;EAC7E,OAAO,KAAK,QAAQ,OAAO,GAAG,KAAK,IAAI,WAAW,KAAK,GAAG,CAAC;CAC7D;CACA,KACE,GACA,GAAG,MACG;EACN,MAAM,CAAC,OAAO,WAAW;EACzB,MAAM,UAAU,SAAS,YAAY,WAAW,WAAW,KAAA;EAC3D,OAAO,KAAK,QAAQ,QAAQ,GAAG,OAAO,WAAW,KAAK,IAAI,GAAG,OAAO;CACtE;CACA,MAAwB,GAA6B,GAAG,MAA4B;EAClF,OAAO,KAAK,QAAQ,UAAU,GAAG,KAAK,IAAI,WAAW,KAAK,KAAK,CAAC;CAClE;CACA,MAAmD,GAAM,GAAG,MAAqC;EAC/F,OAAO,KAAK,QAAQ,SAAS,GAAG,KAAK,IAAI,WAAW,KAAK,KAAK,CAAC;CACjE;CACA,QACE,GACA,GAAG,MACG;EACN,OAAO,KAAK,QAAQ,WAAW,GAAG,KAAK,IAAI,WAAW,KAAK,OAAO,CAAC;CACrE;CACA,OAAyB,GAA6B,GAAG,MAA4B;EACnF,OAAO,KAAK,QAAQ,UAAU,GAAG,KAAK,IAAI,WAAW,KAAK,MAAM,CAAC;CACnE;CAEA,OACE,YACA,OACA,SACM;EACN,gBAAgB,YAAY,OAAO,OAAO;EAE1C,MAAM,MAAM,WAAW,KAAK,MAAM;EAClC,MAAM,OAAO,QAAQ,KAAA,IAAY,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC;EACtD,MAAM,CAAC,OAAO,UAAU;EACxB,MAAM,WAAW,QAAsC,WAAW,IAAI;EAEtE,KAAK,KAAK,KAAK;GAAE,UAAU;GAAO;EAAI,GAAG;GAAE,UAAU;GAAQ;EAAI,CAAC;EAElE,MAAM,OAAO,QAAgD,CAC3D;GAAE,GAAG,YAAY,QAAQ,GAAG,GAAG,KAAK,EAAE,GAAG,MAAM,CAAC;GAAG,GAAG;EAAK,CAC7D;EACA,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,GAAI,SAAS,UAAU,KAAA,IAAY,EAAE,OAAO,QAAQ,MAAM,IAAI,CAAC;GAC/D,OAAO,CACL;IAAE,WAAW;KAAE,MAAM;KAAa,SAAS,QAAQ,KAAK;KAAG,GAAG;IAAK;IAAG,MAAM,IAAI,KAAK;GAAE,CACzF;GACA,WAAW,IAAI,MAAM;EACvB,GACA,GACF;CACF;CAIA,MAAM,GAAsD;EAC1D,MAAM,MAAM,WAAW,KAAK,KAAK;EACjC,IAAI,OAAO,MAAM,UACf,OAAO,KAAK,SAAS;GAAE,IAAI;GAAI,MAAM;GAAS,UAAU,WAAW,CAAC;EAAE,GAAG,GAAG;EAE9E,MAAM,MAAM,WAAW,EAAE,GAAG;EAC5B,MAAM,MAAM,WAAW,EAAE,GAAG;EAM5B,IAAI,IAAI,KAAK,IAAI,IACf,MAAM,IAAI,MACR,8DAA8D,EAAE,IAAI,WAAW,EAAE,IAAI,IACvF;EAEF,OAAO,KAAK,SAAS;GAAE,IAAI;GAAI,MAAM;GAAgB;GAAK;EAAI,GAAG,GAAG;CACtE;CAEA,WAAW,MAIF;EACP,MAAM,MAAM,WAAW,KAAK,UAAU;EACtC,MAAM,QAAQ,iBAAiB,KAAK,QAAQ,EAAE;EAE9C,IADY,iBAAiB,KAAK,QAAQ,EACpC,KAAK,OACT,MAAM,IAAI,MACR,2EAA2E,KAAK,QAAQ,GAAG,IAAI,KAAK,QAAQ,GAAG,4CACjH;EAEF,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,MAAM,CAAC,GAAI,KAAK,QAAS;IAAC;IAAO;IAAO;IAAO;IAAO;IAAO;IAAO;GAAK,CAAY;GACrF,SAAS,CAAC,KAAK,QAAQ,IAAI,KAAK,QAAQ,EAAE;GAC1C,IAAI,KAAK,MAAM;EACjB,GACA,GACF;CACF;CAEA,UACE,WACA,MACM;EACN,MAAM,MAAM,WAAW,KAAK,SAAS;EACrC,MAAM,YAAY,KAAK,aAAa;EACpC,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,WAAW,OAAO,SAAS;GAC3B,SAAS,WAAW,KAAK,OAAO;GAChC,WACE,cAAc,cAAc,cAAc,SACtC,YACA,eAAe,WAAW,KAAK,IAAI;EAC3C,GACA,GACF;CACF;CAEA,IAAI,UAAyB;EAE3B,KAAK,MAAM,KAAK,GAAG,eAAe,UAAU,KAAK,IAAI,CAAC;EACtD,OAAO;CACT;CAIA,OAAO,GAAG,MAA6C;EACrD,MAAM,MAAM,WAAW,KAAK,MAAM;EAClC,MAAM,QAAQ,OAAO,KAAK,OAAO,WAAW,KAAK,KAAK,KAAA;EACtD,MAAM,OAAQ,UAAU,KAAA,IAAY,OAAO,KAAK,MAAM,CAAC;EAEvD,MAAM,QAAsD,CAAC;EAC7D,IAAI;EACJ,KAAK,SAAS,KAAK,MAAM;GACvB,IAAI,MAAM,QAAQ,GAAG,GAAG;IACtB,IAAI,cAAc,KAAA,GAChB,MAAM,IAAI,MAAM,iEAAiE;IAEnF,MAAM,CAAC,WAAW,OAAO;IACzB,MAAM,KAAK;KAAE,WAAW,OAAO,SAAS;KAAG,MAAM,eAAe,KAAK,KAAK,IAAI;IAAE,CAAC;GACnF,OAAO;IACL,IAAI,cAAc,KAAA,GAChB,MAAM,IAAI,MAAM,2DAA2D;IAE7E,IAAI,MAAM,KAAK,SAAS,GACtB,MAAM,IAAI,MAAM,iEAAiE;IAEnF,YAAY,eAAe,KAAgB,KAAK,IAAI;GACtD;EACF,CAAC;EAED,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,GAAI,UAAU,KAAA,IAAY,EAAE,MAAM,IAAI,CAAC;GACvC;GACA,GAAI,cAAc,KAAA,IAAY,EAAE,UAAU,IAAI,CAAC;EACjD,GACA,GACF;CACF;CAEA,OAAO,WAAsB,MAAkC;EAC7D,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,WAAW,OAAO,SAAS;GAC3B,GAAI,MAAM,WAAW,KAAA,IAAY,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;EAC9D,GACA,WAAW,KAAK,MAAM,CACxB;CACF;CAEA,OAAO,MAA0D,MAA+B;EAC9F,MAAM,MAAM,WAAW,KAAK,MAAM;EAClC,MAAM,UAAU,OAAO,QAAQ,IAAI;EA8BnC,MAAM,QAvBc,QAAQ,KAAK,CAAC,MAAM,OAAO;GAC7C,IAAI,CAAC,SAAS,KAAK,IAAI,GACrB,MAAM,IAAI,MACR,uBAAuB,KAAK,2KAC9B;GAEF,MAAM,KAAK,EAAE,SAAS;GACtB,IAAI,KAAK,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC,IAAI,MAClC,MAAM,IAAI,MACR,kBAAkB,KAAK,WAAW,EAAE,OAAO,yEAC7C;GAQF,IAAI,KAAK,GACP,MAAM,IAAI,MAAM,kBAAkB,KAAK,WAAW,EAAE,OAAO,sBAAsB;GAEnF,OAAO,KAAK,MAAM,EAAE;EACtB,CACwB,CAAC,CAAC,QAAQ,KAAK,OAAO,MAAM,IAAI,CAAC;EACzD,IAAI,UAAU,KACZ,MAAM,IAAI,MAAM,0CAA0C,QAAQ,KAAK;EAEzE,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,GAAI,MAAM,QAAQ,KAAA,IAAY,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC;GACnD,MAAM,QAAQ,KAAK,CAAC,MAAM,QAAQ;IAChC;IACA,QAAQ,EAAE;IACV,MAAM,EAAE,OAAO,eAAe,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC;GACtD,EAAE;EACJ,GACA,GACF;CACF;CAEA,KAAK,QAAuB;EAC1B,OAAO,KAAK,SACV;GAAE,IAAI;GAAI,MAAM;GAAQ,GAAI,WAAW,KAAA,IAAY,EAAE,OAAO,IAAI,CAAC;EAAG,GACpE,WAAW,KAAK,IAAI,CACtB;CACF;CAEA,UAA4B,IAAiB,GAAG,SAA4B;EAC1E,MAAM,SAAU,QAAQ,MAAM,CAAC;EAC/B,KAAK,MAAM,CAAC,OAAO,UAAU,OAAO,QAAQ,MAAM,GAKhD,IAAI,EAHF,OAAO,UAAU,YACjB,UAAU,QACT,MAA6B,SAAS,oBAC7B,CAAC;GAAC;GAAU;GAAU;EAAS,CAAC,CAAC,SAAS,OAAO,KAAK,GAChE,MAAM,IAAI,UACR,cAAc,GAAG,KAAK,OAAO,MAAM,uFACrC;EAGJ,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,OAAO,GAAG;GACV,SAAS;EACX,GACA,WAAW,KAAK,SAAS,CAC3B;CACF;CAEA,IAAsB,GAAiB,GAAG,MAA4B;EACpE,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,QAAQ,EAAE;GACV,MAAO,KAAK,MAAM,CAAC;GACnB,UAAU,EAAE;EACd,GACA,WAAW,KAAK,GAAG,CACrB;CACF;AACF;;;;;AAOA,SAAgB,KAAK,OAA8C;CACjE,MAAM,UAAU,IAAI,gBAAgB;CACpC,MAAM,OAAO;CAEb,OAAO;EADsB,QAAQ;EAAM,OAAO,QAAQ;EAAO,MAAM,QAAQ;CACrE;AACZ"}
+{"version":3,"file":"flow.mjs","names":[],"sources":["../../src/dsl/flow.ts"],"sourcesContent":["import type { ChannelIR, ConditionIR, NodeIR, PropValueIR, SourceLocIR } from '../ir';\nimport { captureLoc } from '../provenance';\nimport {\n  type AnyTemplate,\n  CHANNEL_OF,\n  type DiscordTemplate,\n  type EmailTemplate,\n  type PropsSchema,\n  type PushTemplate,\n  type SlackTemplate,\n  isTemplate,\n} from '../templates';\nimport type { ActionRef } from './action';\nimport { type Duration, type TimeOfDay, type Weekday, durationIR, timeOfDayMinutes } from './base';\nimport { type Condition, condIR } from './condition';\nimport type { EventRef, MessageArgs, PropInput, PropsInput } from './refs';\nimport type { PropsOf, TemplateRef } from './template';\n\n/**\n * The flow chain — FlowBuilder is the DSL's step surface (messages, delays,\n * flow control, data), and its implementation is the compiler front half: each\n * chained call executes no logic, it just collects one IR node (ids are\n * assigned later, in workflow.toIR()). Sub-flow callbacks run exactly once at\n * construction — builder in, builder out — so the output is always a static\n * tree.\n *\n * Every public method also captures its callsite (provenance): the loc lands\n * in the node's hash-excluded meta and is the anchor for future in-place\n * editing from the studio.\n */\n\ntype Scalar = string | number | boolean;\n\n/** An emitted field: a scalar (or a profile ref to one); a nested field cannot be sent. */\ntype EmitValue<T> = [NonNullable<T>] extends [Scalar] ? PropInput<T> : never;\n\n/** The payload `sendEvent` accepts for an event: its fields, scalar ones only. */\nexport type EmitPayload<P> = { [K in keyof P]: EmitValue<P[K]> };\n\n/** Payload may be omitted when the event declares no required field. */\nexport type EmitArgs<P> =\n  Record<string, never> extends P ? [payload?: EmitPayload<P>] : [payload: EmitPayload<P>];\n\n/** Per-node push options. */\nexport interface PushOptions {\n  /** Which devices get a copy: 'all' (the default) or only the most recently registered. */\n  devices?: 'all' | 'latest';\n}\n\n/** `prefer()` options. */\nexport interface PreferOptions {\n  /** The generated branch's name in IR (UI title / observability handle), as `branch(label, …)`. */\n  label?: string;\n}\n\n/** The candidates `prefer()` takes: one push and one email template, in priority order. */\ntype PreferPair = readonly [PushTemplate, EmailTemplate] | readonly [EmailTemplate, PushTemplate];\n\ntype NormalizeProps<P> = { -readonly [K in keyof P]: P[K] };\ntype Equal<A, B> =\n  (<T>() => T extends A ? 1 : 2) extends <T>() => T extends B ? 1 : 2 ? true : false;\n\n/** Both candidates render the one props object, so they must declare the same props type — not merely overlap. */\ntype SameProps<T extends PreferPair> =\n  Equal<NormalizeProps<PropsOf<T[0]>>, NormalizeProps<PropsOf<T[1]>>> extends true\n    ? unknown\n    : { readonly __prefer_error__: 'Both templates must declare the same props type' };\n\n/** Distributes, so a field only one member of a union variable has still counts as extra. */\ntype KeysOfUnion<A> = A extends unknown ? keyof A : never;\n/** Rejects known extra fields, which `{}` (an empty props schema) would otherwise accept. */\ntype NoExtra<A, P> = Record<Exclude<KeysOfUnion<A>, keyof P>, never>;\n\n/** prefer() is typed strictly, but a JS caller (or an `any`) reaches it unchecked — fail at the call, not at send time. */\nfunction checkPreferArgs(candidates: unknown, props: unknown, options: unknown): void {\n  if (!Array.isArray(candidates) || candidates.length !== 2) {\n    throw new TypeError('prefer(): candidates must be exactly two templates — one push, one email');\n  }\n  const channels = (candidates as unknown[]).map((candidate) =>\n    isTemplate(candidate) ? CHANNEL_OF[candidate.kind] : undefined\n  );\n  if (!channels.every((channel) => channel === 'push' || channel === 'email')) {\n    throw new TypeError('prefer(): each candidate must be a pushTemplate or an emailTemplate');\n  }\n  if (channels[0] === channels[1]) {\n    throw new TypeError('prefer(): candidates must be one push and one email template');\n  }\n  if (typeof props !== 'object' || props === null || Array.isArray(props)) {\n    throw new TypeError(\n      'prefer(): props must be an object — pass {} when the templates declare none'\n    );\n  }\n  if (options === undefined) return;\n  if (typeof options !== 'object' || options === null || Array.isArray(options)) {\n    throw new TypeError('prefer(): options must be an object');\n  }\n  for (const [name, value] of Object.entries(options)) {\n    if (name !== 'label') {\n      throw new TypeError(\n        `prefer(): unknown option '${name}' — props go in the second argument, options take only 'label'`\n      );\n    }\n    if (typeof value !== 'string') throw new TypeError(\"prefer(): 'label' must be a string\");\n  }\n}\n\n/** A reusable flow fragment (what `flow(...)` returns), referenced directly by branch arms. */\nexport interface Flow {\n  readonly __flow: true;\n}\n\ninterface FlowInternal extends Flow {\n  readonly nodes: NodeIR[];\n  readonly uses: readonly TemplateUse[];\n}\n\n/**\n * @internal A template definition a flow sends, kept beside the IR (which names it by id only):\n * compileConfig checks that the registered definition under that id is this very object, so the\n * schema that typed the call is the one that renders it. Never part of the IR or its hash.\n */\nexport interface TemplateUse {\n  readonly template: AnyTemplate;\n  readonly loc: SourceLocIR | undefined;\n}\n\n/** @internal The template definitions a workflow sends, sub-flows and fragments included. */\nexport function templateUses(builder: FlowBuilder): readonly TemplateUse[] {\n  return builder instanceof FlowBuilderImpl ? builder.uses : [];\n}\n\n/** Sub-flow: a named fragment, or an inline callback (runs once at construction — builder in, builder out). */\nexport type SubFlow = Flow | ((w: FlowBuilder) => FlowBuilder);\n\n/** A branch arm: the [condition, sub-flow] tuple — an [if, then] ordering convention. */\nexport type BranchCase = readonly [condition: Condition, flow: SubFlow];\n\n/**\n * A branch argument: either a tuple arm, or a bare sub-flow meaning the default\n * arm. The bare form may appear once, and must come last (checked at runtime).\n */\nexport type BranchArm = BranchCase | SubFlow;\n\n/**\n * A cohort arm name has two jobs, and both constrain its spelling:\n * - it is interpolated into the node ids of the arm's flow ('{id}.{name}.{j}'),\n *   and an id is a durable step name — a dot would fake a nesting level and can\n *   collide with a real one, an empty name gives '{id}..{j}';\n * - it is an object key, and JavaScript lists integer-like keys first in\n *   ascending numeric order however the author wrote them. The arms array is\n *   documented (and interpreted) as authoring order, and the bucketing walk\n *   accumulates weights along it, so an arm named '0' added to a live\n *   experiment would prepend itself and re-bucket everyone already in it.\n */\nconst ARM_NAME = /^[A-Za-z_][A-Za-z0-9_-]*$/;\n\n/** A sub-flow's nodes; the template definitions it sends are added to `uses`. */\nfunction resolveSubFlow(sub: SubFlow, uses: TemplateUse[]): NodeIR[] {\n  if (typeof sub === 'function') {\n    const builder = new FlowBuilderImpl();\n    const returned: unknown = sub(builder);\n    // An async callback would add its nodes after construction is over — after ids were assigned\n    if (typeof (returned as { then?: unknown } | undefined)?.then === 'function') {\n      throw new TypeError(\n        'sub-flow callbacks must be synchronous: they run once, while the workflow is defined'\n      );\n    }\n    uses.push(...builder.uses);\n    return builder.nodes;\n  }\n  uses.push(...(sub as FlowInternal).uses);\n  /*\n   * A named fragment is a value, and the convention is to reuse it — two branch\n   * arms may hold the same one. Handing out its own nodes aliases them into\n   * both places, and assignIds writes ids *in place*: the second prefix\n   * overwrites the first, so the two placements end up as one object under one\n   * id — one durable step name, one message idempotency key, one bucket seed.\n   * A copy per placement is what makes a fragment behave like a value.\n   */\n  return structuredClone((sub as FlowInternal).nodes);\n}\n\nexport interface FlowBuilder {\n  /* ---- Messages: every channel is one message node; separate methods buy channel-level typing ---- */\n  email<T extends EmailTemplate>(template: T, ...props: MessageArgs<PropsOf<T>>): this;\n  sms<P extends object>(template: TemplateRef<'sms', P>, ...props: MessageArgs<P>): this;\n  /**\n   * Push to the user's devices — every device the host's directory lists, or\n   * only the most recently registered with `{ devices: 'latest' }`. A user with\n   * no device is skipped (`prefer([pushTpl, emailTpl], props)` falls back to email).\n   */\n  push<T extends PushTemplate>(\n    template: T,\n    ...args: [...props: MessageArgs<PropsOf<T>>, options?: PushOptions]\n  ): this;\n  inApp<P extends object>(template: TemplateRef<'in_app', P>, ...props: MessageArgs<P>): this;\n  slack<T extends SlackTemplate<PropsSchema, never>>(\n    template: T,\n    ...props: MessageArgs<PropsOf<T>>\n  ): this;\n  discord<T extends DiscordTemplate<PropsSchema, never>>(\n    template: T,\n    ...props: MessageArgs<PropsOf<T>>\n  ): this;\n  survey<P extends object>(template: TemplateRef<'survey', P>, ...props: MessageArgs<P>): this;\n\n  /**\n   * Send one message on the first channel the user can be reached on: one push\n   * and one email template, in priority order, rendered with the same props.\n   * Sugar for the branch it compiles to — same IR, ids and hash as writing\n   *\n   *   .branch(label, [reachable(first.channel), (b) => b.<first>(first, props)], (b) => b.<second>(second, props))\n   *\n   * so the choice is made once, when the step is reached, and a first choice\n   * that fails to send retries as itself — it never falls through to the\n   * second. Props are always passed (`{}` for templates that declare none),\n   * and both templates must declare the same props type; for differing props\n   * or other channels, write the branch.\n   *\n   *   .prefer([push.tip, email.tip], { name: u.name }, { label: 'tip by channel' })\n   */\n  prefer<const T extends PreferPair, const A extends PropsInput<NoInfer<PropsOf<T[0]>>>>(\n    candidates: T & SameProps<NoInfer<T>>,\n    props: A & NoInfer<NoExtra<A, PropsOf<T[0]>>>,\n    options?: PreferOptions\n  ): this;\n\n  /* --------------------------------- Delays --------------------------------- */\n  /** Time Delay; passing { min, max } makes it a Randomized Delay. */\n  delay(duration: Duration): this;\n  delay(range: { min: Duration; max: Duration }): this;\n\n  /** Time Window: hold until inside the window (e.g. weekdays 09:00–17:00). tz: 'user' uses the user's timezone. */\n  timeWindow(opts: {\n    days?: readonly Weekday[];\n    between: readonly [TimeOfDay, TimeOfDay];\n    tz?: 'user' | (string & {});\n  }): this;\n\n  /**\n   * Wait Until: continue on the main line once the condition holds, or take\n   * onTimeout when it expires (default 'continue'). On the engine side this is\n   * \"await event racing a timer\" — a native primitive of durable runtimes.\n   */\n  waitUntil(\n    condition: Condition,\n    opts: { timeout: Duration; onTimeout?: 'continue' | 'exit' | SubFlow }\n  ): this;\n\n  /**\n   * Splice a fragment in place: a named `flow(...)` or a callback, expanded\n   * once while the workflow is defined — a composition step before compiling,\n   * not a node (the IR has no trace of it, and ids are assigned over the whole\n   * workflow as if the steps were written inline). Each use gets its own copy,\n   * so one fragment can be used in several places and workflows.\n   *\n   *   const officeHours = flow((w) => w.timeWindow({ days: ['mon', 'tue', 'wed', 'thu', 'fri'], between: ['09:00', '17:00'] }));\n   *   workflow({ id: 'onboarding', ... }).delay('1 day').use(officeHours).email(email.tip, { name: u.name })\n   */\n  use(fragment: SubFlow): this;\n\n  /* ------------------------------ Flow Control ------------------------------ */\n  /**\n   * Conditional branch: ordered first-match (same semantics as Step Functions\n   * Choice / Knock branch). This one primitive covers both the UI's True/False\n   * Branch (two arms) and Multi-Split Branch (N arms). Arms are\n   * [condition, sub-flow] tuples; a bare sub-flow in tail position is the\n   * default arm. With no match and no default, execution simply continues.\n   * Rejoin is structural: after the matching arm finishes, execution resumes\n   * at the node following the branch — to opt out, call .exit() inside the arm.\n   *\n   *   .branch([activeSubscriber, upgradeFlow], firstTimeFlow)   // True/False\n   *   .branch([vip, vipFlow], [trial, trialFlow], defaultFlow)  // Multi-Split\n   *   .branch([not(usedStaging), eduFlow])                      // single arm: no match continues\n   *\n   * The optional first argument `label` becomes the node's name in IR (UI title\n   * / observability handle). It is not a jump target — there is no goto here;\n   * looping is a future re-entry-policy topic (see sendEvent). Arm labels in\n   * the UI are derived from the condition.\n   */\n  branch(...arms: readonly BranchArm[]): this;\n  branch(label: string, ...arms: readonly BranchArm[]): this;\n\n  /**\n   * Gate: exit unless the condition holds, otherwise continue. A first-class\n   * node rather than sugar over branch — same semantics as Zapier's \"only\n   * continue if\" / Iterable's Filter tile, and rendered on its own in the UI.\n   * `reason` is the audit-log line — metadata, so rewording it is free\n   * (excluded from contentHash, see hash.ts).\n   */\n  filter(condition: Condition, opts?: { reason?: string }): this;\n\n  /**\n   * Random Cohort Branch (A/B): weights must sum to 100 (checked at runtime).\n   * `key` names the experiment: bucketing hashes `userId:key` instead of the\n   * structural node id, so assignments survive node insertion/moves and the\n   * experiment keeps one identity across workflow versions — set it for any\n   * A/B whose results you intend to read.\n   *\n   * Arm names become node id segments and are read back in authoring order, so\n   * they are restricted to letters, digits, '_' and '-', never starting with a\n   * digit (checked at runtime).\n   */\n  cohort(arms: Record<string, { weight: number; flow?: SubFlow }>, opts?: { key?: string }): this;\n\n  /**\n   * Exit: end the whole workflow immediately (the UI's Exit node); `reason`\n   * goes into the audit log and is metadata, so rewording it neither repins\n   * in-flight journeys nor shows up in plan. Inside a branch arm this means\n   * \"terminate, do not rejoin\" — it stops here instead of falling through,\n   * while an arm without exit rejoins naturally.\n   */\n  exit(reason?: string): this;\n\n  /* ---------------------------------- Data ---------------------------------- */\n  /**\n   * Emit a typed event (customer.io's Send Event). The event comes from an\n   * e.xxx reference, so payload types flow in the same way trigger.event works.\n   * This is how workflows compose: an event can trigger another workflow, and\n   * the resulting call graph is statically analyzable. Payload values may\n   * reference u.xxx. Only scalar fields can be sent (IR carries literals and\n   * profile refs, not nested JSON): an event whose payload requires a nested\n   * field cannot be emitted from a journey, and the types say so.\n   *\n   * Note on loops: a trailing self-triggering sendEvent will become the\n   * official periodic-flow shape *once a re-entry policy exists* — today the\n   * entry policy is once-per-user, so a self-trigger cannot re-enter and does\n   * not loop.\n   * TODO: the rest of the Data category — outbound webhook / profile update /\n   * journey attributes.\n   */\n  sendEvent<P extends object>(event: EventRef<P>, ...payload: EmitArgs<P>): this;\n\n  /**\n   * Run a custom action (see dsl/action.ts for the model). The chain records\n   * identity only — name, args, codeHash — never the code: the implementation\n   * ships inside the deployed Worker bundle and is resolved by name from the\n   * runtime registry. Args are typed by the ActionRef and may reference u.xxx,\n   * resolved at run time exactly like message props. Executed inside a durable\n   * step: retried on throw, checkpointed on success.\n   */\n  run<A extends object>(action: ActionRef<A>, ...args: MessageArgs<A>): this;\n}\n\nconst DEFINED_CHANNELS: ReadonlySet<ChannelIR> = new Set(Object.values(CHANNEL_OF));\n\n/** A message's template: a definition of the channel (named by its id), or a reference by key. */\ntype MessageTemplate = AnyTemplate | TemplateRef;\n\nfunction templateKey(channel: ChannelIR, tpl: MessageTemplate): string {\n  if (!DEFINED_CHANNELS.has(channel)) return (tpl as TemplateRef).key;\n  // Typed, but a JS caller (or an `any`) reaches it unchecked: fail where the workflow is written\n  if (!isTemplate(tpl) || CHANNEL_OF[tpl.kind] !== channel) {\n    throw new TypeError(`${channel}(): expects a ${channel} template definition`);\n  }\n  return tpl.id;\n}\n\nfunction messageNode(\n  channel: ChannelIR,\n  tpl: MessageTemplate,\n  props: object | undefined,\n  devices?: 'latest'\n): NodeIR {\n  return {\n    id: '',\n    type: 'message',\n    channel,\n    template: templateKey(channel, tpl),\n    props: (props ?? {}) as Record<string, PropValueIR>,\n    // Absent for 'all', so adding the option left every existing push's hash as it was\n    ...(devices !== undefined ? { devices } : {}),\n  };\n}\n\n/* oxlint-disable typescript/unbound-method --\n * `captureLoc(this.xxx)` passes the method by identity as the stack-trace\n * boundary for Error.captureStackTrace; it is never invoked, so `this`\n * scoping cannot go wrong. */\n/** @internal extended by WorkflowBuilderImpl; not part of the public API */\nexport class FlowBuilderImpl implements FlowBuilder {\n  /** Nodes as collected; ids are assigned in one pass inside toIR, so '' is a placeholder here. */\n  readonly nodes: NodeIR[] = [];\n  /** The template definitions sent, with where: compile-time only, never in the IR. */\n  readonly uses: TemplateUse[] = [];\n\n  /** Provenance: the callsite (captured in the public method) lands in meta.loc, outside the hash. */\n  private pushNode(node: NodeIR, loc: SourceLocIR | undefined): this {\n    this.nodes.push({ ...node, ...(loc !== undefined ? { meta: { loc } } : {}) });\n    return this;\n  }\n\n  private message(\n    channel: ChannelIR,\n    tpl: MessageTemplate,\n    props: object | undefined,\n    loc: SourceLocIR | undefined,\n    devices?: 'latest'\n  ): this {\n    this.pushNode(messageNode(channel, tpl, props, devices), loc);\n    if (isTemplate(tpl)) this.uses.push({ template: tpl, loc });\n    return this;\n  }\n\n  email<T extends EmailTemplate>(t: T, ...args: MessageArgs<PropsOf<T>>): this {\n    return this.message('email', t, args[0], captureLoc(this.email));\n  }\n  sms<P extends object>(t: TemplateRef<'sms', P>, ...args: MessageArgs<P>): this {\n    return this.message('sms', t, args[0], captureLoc(this.sms));\n  }\n  push<T extends PushTemplate>(\n    t: T,\n    ...args: [...props: MessageArgs<PropsOf<T>>, options?: PushOptions]\n  ): this {\n    const [props, options] = args as unknown as [object | undefined, PushOptions | undefined];\n    const devices = options?.devices === 'latest' ? 'latest' : undefined;\n    return this.message('push', t, props, captureLoc(this.push), devices);\n  }\n  inApp<P extends object>(t: TemplateRef<'in_app', P>, ...args: MessageArgs<P>): this {\n    return this.message('in_app', t, args[0], captureLoc(this.inApp));\n  }\n  slack<T extends SlackTemplate<PropsSchema, never>>(t: T, ...args: MessageArgs<PropsOf<T>>): this {\n    return this.message('slack', t, args[0], captureLoc(this.slack));\n  }\n  discord<T extends DiscordTemplate<PropsSchema, never>>(\n    t: T,\n    ...args: MessageArgs<PropsOf<T>>\n  ): this {\n    return this.message('discord', t, args[0], captureLoc(this.discord));\n  }\n  survey<P extends object>(t: TemplateRef<'survey', P>, ...args: MessageArgs<P>): this {\n    return this.message('survey', t, args[0], captureLoc(this.survey));\n  }\n\n  prefer<const T extends PreferPair, const A extends PropsInput<NoInfer<PropsOf<T[0]>>>>(\n    candidates: T & SameProps<NoInfer<T>>,\n    props: A & NoInfer<NoExtra<A, PropsOf<T[0]>>>,\n    options?: PreferOptions\n  ): this {\n    checkPreferArgs(candidates, props, options);\n    // Every generated node points at the author's prefer() call, not at this method's body\n    const loc = captureLoc(this.prefer);\n    const meta = loc !== undefined ? { meta: { loc } } : {};\n    const [first, second] = candidates as readonly (EmailTemplate | PushTemplate)[];\n    const channel = (tpl: EmailTemplate | PushTemplate) => CHANNEL_OF[tpl.kind] as 'email' | 'push';\n    // Both are sent from here as far as the registry check goes, the fallback included\n    this.uses.push({ template: first, loc }, { template: second, loc });\n    // A copy per message, as two separately written calls would hold\n    const arm = (tpl: EmailTemplate | PushTemplate): NodeIR[] => [\n      { ...messageNode(channel(tpl), tpl, { ...props }), ...meta },\n    ];\n    return this.pushNode(\n      {\n        id: '',\n        type: 'branch',\n        ...(options?.label !== undefined ? { label: options.label } : {}),\n        cases: [\n          { condition: { type: 'reachable', channel: channel(first), ...meta }, flow: arm(first) },\n        ],\n        otherwise: arm(second),\n      },\n      loc\n    );\n  }\n\n  delay(duration: Duration): this;\n  delay(range: { min: Duration; max: Duration }): this;\n  delay(d: Duration | { min: Duration; max: Duration }): this {\n    const loc = captureLoc(this.delay);\n    if (typeof d === 'string') {\n      return this.pushNode({ id: '', type: 'delay', duration: durationIR(d) }, loc);\n    }\n    const min = durationIR(d.min);\n    const max = durationIR(d.max);\n    /*\n     * The interpreter draws `min + random(max - min)` with the span clamped at\n     * zero, so a backwards range does not fail — it quietly collapses into a\n     * fixed `min` sleep. Reject it here, where the author can still see it.\n     */\n    if (max.ms < min.ms) {\n      throw new Error(\n        `delay(): 'max' must not be shorter than 'min', got { min: '${d.min}', max: '${d.max}' }`\n      );\n    }\n    return this.pushNode({ id: '', type: 'random_delay', min, max }, loc);\n  }\n\n  timeWindow(opts: {\n    days?: readonly Weekday[];\n    between: readonly [TimeOfDay, TimeOfDay];\n    tz?: 'user' | (string & {});\n  }): this {\n    const loc = captureLoc(this.timeWindow);\n    const start = timeOfDayMinutes(opts.between[0]);\n    const end = timeOfDayMinutes(opts.between[1]);\n    if (end <= start) {\n      throw new Error(\n        `timeWindow(): 'between' must open before it closes within one day, got [${opts.between[0]}, ${opts.between[1]}] (overnight windows are not supported yet)`\n      );\n    }\n    return this.pushNode(\n      {\n        id: '',\n        type: 'time_window',\n        days: [...(opts.days ?? (['mon', 'tue', 'wed', 'thu', 'fri', 'sat', 'sun'] as const))],\n        between: [opts.between[0], opts.between[1]],\n        tz: opts.tz ?? 'user',\n      },\n      loc\n    );\n  }\n\n  waitUntil(\n    condition: Condition,\n    opts: { timeout: Duration; onTimeout?: 'continue' | 'exit' | SubFlow }\n  ): this {\n    const loc = captureLoc(this.waitUntil);\n    const onTimeout = opts.onTimeout ?? 'continue';\n    return this.pushNode(\n      {\n        id: '',\n        type: 'wait_until',\n        condition: condIR(condition),\n        timeout: durationIR(opts.timeout),\n        onTimeout:\n          onTimeout === 'continue' || onTimeout === 'exit'\n            ? onTimeout\n            : resolveSubFlow(onTimeout, this.uses),\n      },\n      loc\n    );\n  }\n\n  use(fragment: SubFlow): this {\n    // The fragment's nodes carry their own provenance (where the fragment was written)\n    this.nodes.push(...resolveSubFlow(fragment, this.uses));\n    return this;\n  }\n\n  branch(...arms: readonly BranchArm[]): this;\n  branch(label: string, ...arms: readonly BranchArm[]): this;\n  branch(...args: readonly (string | BranchArm)[]): this {\n    const loc = captureLoc(this.branch);\n    const label = typeof args[0] === 'string' ? args[0] : undefined;\n    const arms = (label === undefined ? args : args.slice(1)) as readonly BranchArm[];\n\n    const cases: { condition: ConditionIR; flow: NodeIR[] }[] = [];\n    let otherwise: NodeIR[] | undefined;\n    arms.forEach((arm, i) => {\n      if (Array.isArray(arm)) {\n        if (otherwise !== undefined) {\n          throw new Error('branch(): default arm (bare sub-flow) must be the last argument');\n        }\n        const [condition, sub] = arm as BranchCase;\n        cases.push({ condition: condIR(condition), flow: resolveSubFlow(sub, this.uses) });\n      } else {\n        if (otherwise !== undefined) {\n          throw new Error('branch(): only one default arm (bare sub-flow) is allowed');\n        }\n        if (i !== arms.length - 1) {\n          throw new Error('branch(): default arm (bare sub-flow) must be the last argument');\n        }\n        otherwise = resolveSubFlow(arm as SubFlow, this.uses);\n      }\n    });\n\n    return this.pushNode(\n      {\n        id: '',\n        type: 'branch',\n        ...(label !== undefined ? { label } : {}),\n        cases,\n        ...(otherwise !== undefined ? { otherwise } : {}),\n      },\n      loc\n    );\n  }\n\n  filter(condition: Condition, opts?: { reason?: string }): this {\n    return this.pushNode(\n      {\n        id: '',\n        type: 'filter',\n        condition: condIR(condition),\n        ...(opts?.reason !== undefined ? { reason: opts.reason } : {}),\n      },\n      captureLoc(this.filter)\n    );\n  }\n\n  cohort(arms: Record<string, { weight: number; flow?: SubFlow }>, opts?: { key?: string }): this {\n    const loc = captureLoc(this.cohort);\n    const entries = Object.entries(arms);\n    /*\n     * Weights live on a 0.01% grid: the runtime buckets into 10,000 slots\n     * (basis points), so anything finer would be silently quantized — reject\n     * it here instead. Converting to integer basis points also makes the\n     * sum check exact; no epsilon needed.\n     */\n    const basisPoints = entries.map(([name, a]) => {\n      if (!ARM_NAME.test(name)) {\n        throw new Error(\n          `cohort(): arm name '${name}' must start with a letter or '_' and contain only letters, digits, '_' or '-' — arm names become node id segments, and integer-like names would silently reorder the arms`\n        );\n      }\n      const bp = a.weight * 100;\n      if (Math.abs(bp - Math.round(bp)) > 1e-6) {\n        throw new Error(\n          `cohort(): arm '${name}' weight ${a.weight} is finer than the 0.01% bucketing grid — use at most two decimal places`\n        );\n      }\n      /*\n       * The sum check alone accepts -50 / 150: the runtime walks the arms\n       * accumulating basis points and takes the first whose cumulative total\n       * clears the bucket, so a negative weight hands 100% of users to its\n       * neighbour instead of splitting anything.\n       */\n      if (bp < 0) {\n        throw new Error(`cohort(): arm '${name}' weight ${a.weight} must not be negative`);\n      }\n      return Math.round(bp);\n    });\n    const total = basisPoints.reduce((sum, bp) => sum + bp, 0);\n    if (total !== 10_000) {\n      throw new Error(`cohort(): weights must sum to 100, got ${total / 100}`);\n    }\n    return this.pushNode(\n      {\n        id: '',\n        type: 'cohort',\n        ...(opts?.key !== undefined ? { key: opts.key } : {}),\n        arms: entries.map(([name, a]) => ({\n          name,\n          weight: a.weight,\n          flow: a.flow ? resolveSubFlow(a.flow, this.uses) : [],\n        })),\n      },\n      loc\n    );\n  }\n\n  exit(reason?: string): this {\n    return this.pushNode(\n      { id: '', type: 'exit', ...(reason !== undefined ? { reason } : {}) },\n      captureLoc(this.exit)\n    );\n  }\n\n  sendEvent<P extends object>(ev: EventRef<P>, ...payload: EmitArgs<P>): this {\n    const values = (payload[0] ?? {}) as Record<string, unknown>;\n    for (const [field, value] of Object.entries(values)) {\n      const ref =\n        typeof value === 'object' &&\n        value !== null &&\n        (value as { type?: unknown }).type === 'user_property';\n      if (!ref && !['string', 'number', 'boolean'].includes(typeof value)) {\n        throw new TypeError(\n          `sendEvent('${ev.name}'): '${field}' is not a scalar or a u.xxx reference — an emitted payload carries scalar fields only`\n        );\n      }\n    }\n    return this.pushNode(\n      {\n        id: '',\n        type: 'send_event',\n        event: ev.name,\n        payload: values as Record<string, PropValueIR>,\n      },\n      captureLoc(this.sendEvent)\n    );\n  }\n\n  run<A extends object>(a: ActionRef<A>, ...args: MessageArgs<A>): this {\n    return this.pushNode(\n      {\n        id: '',\n        type: 'action',\n        action: a.name,\n        args: (args[0] ?? {}) as Record<string, PropValueIR>,\n        codeHash: a.codeHash,\n      },\n      captureLoc(this.run)\n    );\n  }\n}\n/* oxlint-enable typescript/unbound-method */\n\n/**\n * A reusable flow fragment: a free function. Once personalization goes through\n * u.xxx and events through e.xxx, the flow layer carries no schema generics.\n */\nexport function flow(build: (w: FlowBuilder) => FlowBuilder): Flow {\n  const builder = new FlowBuilderImpl();\n  build(builder);\n  const impl: FlowInternal = { __flow: true, nodes: builder.nodes, uses: builder.uses };\n  return impl;\n}\n"],"mappings":";;;;;;AA0EA,SAAS,gBAAgB,YAAqB,OAAgB,SAAwB;CACpF,IAAI,CAAC,MAAM,QAAQ,UAAU,KAAK,WAAW,WAAW,GACtD,MAAM,IAAI,UAAU,0EAA0E;CAEhG,MAAM,WAAY,WAAyB,KAAK,cAC9C,WAAW,SAAS,IAAI,WAAW,UAAU,QAAQ,KAAA,CACvD;CACA,IAAI,CAAC,SAAS,OAAO,YAAY,YAAY,UAAU,YAAY,OAAO,GACxE,MAAM,IAAI,UAAU,qEAAqE;CAE3F,IAAI,SAAS,OAAO,SAAS,IAC3B,MAAM,IAAI,UAAU,8DAA8D;CAEpF,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GACpE,MAAM,IAAI,UACR,6EACF;CAEF,IAAI,YAAY,KAAA,GAAW;CAC3B,IAAI,OAAO,YAAY,YAAY,YAAY,QAAQ,MAAM,QAAQ,OAAO,GAC1E,MAAM,IAAI,UAAU,qCAAqC;CAE3D,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,OAAO,GAAG;EACnD,IAAI,SAAS,SACX,MAAM,IAAI,UACR,6BAA6B,KAAK,+DACpC;EAEF,IAAI,OAAO,UAAU,UAAU,MAAM,IAAI,UAAU,oCAAoC;CACzF;AACF;;AAuBA,SAAgB,aAAa,SAA8C;CACzE,OAAO,mBAAmB,kBAAkB,QAAQ,OAAO,CAAC;AAC9D;;;;;;;;;;;;AAyBA,MAAM,WAAW;;AAGjB,SAAS,eAAe,KAAc,MAA+B;CACnE,IAAI,OAAO,QAAQ,YAAY;EAC7B,MAAM,UAAU,IAAI,gBAAgB;EAGpC,IAAI,OAFsB,IAAI,OAEX,CAAC,EAAqC,SAAS,YAChE,MAAM,IAAI,UACR,sFACF;EAEF,KAAK,KAAK,GAAG,QAAQ,IAAI;EACzB,OAAO,QAAQ;CACjB;CACA,KAAK,KAAK,GAAI,IAAqB,IAAI;CASvC,OAAO,gBAAiB,IAAqB,KAAK;AACpD;AAoKA,MAAM,mBAA2C,IAAI,IAAI,OAAO,OAAO,UAAU,CAAC;AAKlF,SAAS,YAAY,SAAoB,KAA8B;CACrE,IAAI,CAAC,iBAAiB,IAAI,OAAO,GAAG,OAAQ,IAAoB;CAEhE,IAAI,CAAC,WAAW,GAAG,KAAK,WAAW,IAAI,UAAU,SAC/C,MAAM,IAAI,UAAU,GAAG,QAAQ,gBAAgB,QAAQ,qBAAqB;CAE9E,OAAO,IAAI;AACb;AAEA,SAAS,YACP,SACA,KACA,OACA,SACQ;CACR,OAAO;EACL,IAAI;EACJ,MAAM;EACN;EACA,UAAU,YAAY,SAAS,GAAG;EAClC,OAAQ,SAAS,CAAC;EAElB,GAAI,YAAY,KAAA,IAAY,EAAE,QAAQ,IAAI,CAAC;CAC7C;AACF;;AAOA,IAAa,kBAAb,MAAoD;;CAElD,QAA2B,CAAC;;CAE5B,OAA+B,CAAC;;CAGhC,SAAiB,MAAc,KAAoC;EACjE,KAAK,MAAM,KAAK;GAAE,GAAG;GAAM,GAAI,QAAQ,KAAA,IAAY,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC;EAAG,CAAC;EAC5E,OAAO;CACT;CAEA,QACE,SACA,KACA,OACA,KACA,SACM;EACN,KAAK,SAAS,YAAY,SAAS,KAAK,OAAO,OAAO,GAAG,GAAG;EAC5D,IAAI,WAAW,GAAG,GAAG,KAAK,KAAK,KAAK;GAAE,UAAU;GAAK;EAAI,CAAC;EAC1D,OAAO;CACT;CAEA,MAA+B,GAAM,GAAG,MAAqC;EAC3E,OAAO,KAAK,QAAQ,SAAS,GAAG,KAAK,IAAI,WAAW,KAAK,KAAK,CAAC;CACjE;CACA,IAAsB,GAA0B,GAAG,MAA4B;EAC7E,OAAO,KAAK,QAAQ,OAAO,GAAG,KAAK,IAAI,WAAW,KAAK,GAAG,CAAC;CAC7D;CACA,KACE,GACA,GAAG,MACG;EACN,MAAM,CAAC,OAAO,WAAW;EACzB,MAAM,UAAU,SAAS,YAAY,WAAW,WAAW,KAAA;EAC3D,OAAO,KAAK,QAAQ,QAAQ,GAAG,OAAO,WAAW,KAAK,IAAI,GAAG,OAAO;CACtE;CACA,MAAwB,GAA6B,GAAG,MAA4B;EAClF,OAAO,KAAK,QAAQ,UAAU,GAAG,KAAK,IAAI,WAAW,KAAK,KAAK,CAAC;CAClE;CACA,MAAmD,GAAM,GAAG,MAAqC;EAC/F,OAAO,KAAK,QAAQ,SAAS,GAAG,KAAK,IAAI,WAAW,KAAK,KAAK,CAAC;CACjE;CACA,QACE,GACA,GAAG,MACG;EACN,OAAO,KAAK,QAAQ,WAAW,GAAG,KAAK,IAAI,WAAW,KAAK,OAAO,CAAC;CACrE;CACA,OAAyB,GAA6B,GAAG,MAA4B;EACnF,OAAO,KAAK,QAAQ,UAAU,GAAG,KAAK,IAAI,WAAW,KAAK,MAAM,CAAC;CACnE;CAEA,OACE,YACA,OACA,SACM;EACN,gBAAgB,YAAY,OAAO,OAAO;EAE1C,MAAM,MAAM,WAAW,KAAK,MAAM;EAClC,MAAM,OAAO,QAAQ,KAAA,IAAY,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC;EACtD,MAAM,CAAC,OAAO,UAAU;EACxB,MAAM,WAAW,QAAsC,WAAW,IAAI;EAEtE,KAAK,KAAK,KAAK;GAAE,UAAU;GAAO;EAAI,GAAG;GAAE,UAAU;GAAQ;EAAI,CAAC;EAElE,MAAM,OAAO,QAAgD,CAC3D;GAAE,GAAG,YAAY,QAAQ,GAAG,GAAG,KAAK,EAAE,GAAG,MAAM,CAAC;GAAG,GAAG;EAAK,CAC7D;EACA,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,GAAI,SAAS,UAAU,KAAA,IAAY,EAAE,OAAO,QAAQ,MAAM,IAAI,CAAC;GAC/D,OAAO,CACL;IAAE,WAAW;KAAE,MAAM;KAAa,SAAS,QAAQ,KAAK;KAAG,GAAG;IAAK;IAAG,MAAM,IAAI,KAAK;GAAE,CACzF;GACA,WAAW,IAAI,MAAM;EACvB,GACA,GACF;CACF;CAIA,MAAM,GAAsD;EAC1D,MAAM,MAAM,WAAW,KAAK,KAAK;EACjC,IAAI,OAAO,MAAM,UACf,OAAO,KAAK,SAAS;GAAE,IAAI;GAAI,MAAM;GAAS,UAAU,WAAW,CAAC;EAAE,GAAG,GAAG;EAE9E,MAAM,MAAM,WAAW,EAAE,GAAG;EAC5B,MAAM,MAAM,WAAW,EAAE,GAAG;EAM5B,IAAI,IAAI,KAAK,IAAI,IACf,MAAM,IAAI,MACR,8DAA8D,EAAE,IAAI,WAAW,EAAE,IAAI,IACvF;EAEF,OAAO,KAAK,SAAS;GAAE,IAAI;GAAI,MAAM;GAAgB;GAAK;EAAI,GAAG,GAAG;CACtE;CAEA,WAAW,MAIF;EACP,MAAM,MAAM,WAAW,KAAK,UAAU;EACtC,MAAM,QAAQ,iBAAiB,KAAK,QAAQ,EAAE;EAE9C,IADY,iBAAiB,KAAK,QAAQ,EACpC,KAAK,OACT,MAAM,IAAI,MACR,2EAA2E,KAAK,QAAQ,GAAG,IAAI,KAAK,QAAQ,GAAG,4CACjH;EAEF,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,MAAM,CAAC,GAAI,KAAK,QAAS;IAAC;IAAO;IAAO;IAAO;IAAO;IAAO;IAAO;GAAK,CAAY;GACrF,SAAS,CAAC,KAAK,QAAQ,IAAI,KAAK,QAAQ,EAAE;GAC1C,IAAI,KAAK,MAAM;EACjB,GACA,GACF;CACF;CAEA,UACE,WACA,MACM;EACN,MAAM,MAAM,WAAW,KAAK,SAAS;EACrC,MAAM,YAAY,KAAK,aAAa;EACpC,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,WAAW,OAAO,SAAS;GAC3B,SAAS,WAAW,KAAK,OAAO;GAChC,WACE,cAAc,cAAc,cAAc,SACtC,YACA,eAAe,WAAW,KAAK,IAAI;EAC3C,GACA,GACF;CACF;CAEA,IAAI,UAAyB;EAE3B,KAAK,MAAM,KAAK,GAAG,eAAe,UAAU,KAAK,IAAI,CAAC;EACtD,OAAO;CACT;CAIA,OAAO,GAAG,MAA6C;EACrD,MAAM,MAAM,WAAW,KAAK,MAAM;EAClC,MAAM,QAAQ,OAAO,KAAK,OAAO,WAAW,KAAK,KAAK,KAAA;EACtD,MAAM,OAAQ,UAAU,KAAA,IAAY,OAAO,KAAK,MAAM,CAAC;EAEvD,MAAM,QAAsD,CAAC;EAC7D,IAAI;EACJ,KAAK,SAAS,KAAK,MAAM;GACvB,IAAI,MAAM,QAAQ,GAAG,GAAG;IACtB,IAAI,cAAc,KAAA,GAChB,MAAM,IAAI,MAAM,iEAAiE;IAEnF,MAAM,CAAC,WAAW,OAAO;IACzB,MAAM,KAAK;KAAE,WAAW,OAAO,SAAS;KAAG,MAAM,eAAe,KAAK,KAAK,IAAI;IAAE,CAAC;GACnF,OAAO;IACL,IAAI,cAAc,KAAA,GAChB,MAAM,IAAI,MAAM,2DAA2D;IAE7E,IAAI,MAAM,KAAK,SAAS,GACtB,MAAM,IAAI,MAAM,iEAAiE;IAEnF,YAAY,eAAe,KAAgB,KAAK,IAAI;GACtD;EACF,CAAC;EAED,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,GAAI,UAAU,KAAA,IAAY,EAAE,MAAM,IAAI,CAAC;GACvC;GACA,GAAI,cAAc,KAAA,IAAY,EAAE,UAAU,IAAI,CAAC;EACjD,GACA,GACF;CACF;CAEA,OAAO,WAAsB,MAAkC;EAC7D,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,WAAW,OAAO,SAAS;GAC3B,GAAI,MAAM,WAAW,KAAA,IAAY,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;EAC9D,GACA,WAAW,KAAK,MAAM,CACxB;CACF;CAEA,OAAO,MAA0D,MAA+B;EAC9F,MAAM,MAAM,WAAW,KAAK,MAAM;EAClC,MAAM,UAAU,OAAO,QAAQ,IAAI;EA8BnC,MAAM,QAvBc,QAAQ,KAAK,CAAC,MAAM,OAAO;GAC7C,IAAI,CAAC,SAAS,KAAK,IAAI,GACrB,MAAM,IAAI,MACR,uBAAuB,KAAK,2KAC9B;GAEF,MAAM,KAAK,EAAE,SAAS;GACtB,IAAI,KAAK,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC,IAAI,MAClC,MAAM,IAAI,MACR,kBAAkB,KAAK,WAAW,EAAE,OAAO,yEAC7C;GAQF,IAAI,KAAK,GACP,MAAM,IAAI,MAAM,kBAAkB,KAAK,WAAW,EAAE,OAAO,sBAAsB;GAEnF,OAAO,KAAK,MAAM,EAAE;EACtB,CACwB,CAAC,CAAC,QAAQ,KAAK,OAAO,MAAM,IAAI,CAAC;EACzD,IAAI,UAAU,KACZ,MAAM,IAAI,MAAM,0CAA0C,QAAQ,KAAK;EAEzE,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,GAAI,MAAM,QAAQ,KAAA,IAAY,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC;GACnD,MAAM,QAAQ,KAAK,CAAC,MAAM,QAAQ;IAChC;IACA,QAAQ,EAAE;IACV,MAAM,EAAE,OAAO,eAAe,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC;GACtD,EAAE;EACJ,GACA,GACF;CACF;CAEA,KAAK,QAAuB;EAC1B,OAAO,KAAK,SACV;GAAE,IAAI;GAAI,MAAM;GAAQ,GAAI,WAAW,KAAA,IAAY,EAAE,OAAO,IAAI,CAAC;EAAG,GACpE,WAAW,KAAK,IAAI,CACtB;CACF;CAEA,UAA4B,IAAiB,GAAG,SAA4B;EAC1E,MAAM,SAAU,QAAQ,MAAM,CAAC;EAC/B,KAAK,MAAM,CAAC,OAAO,UAAU,OAAO,QAAQ,MAAM,GAKhD,IAAI,EAHF,OAAO,UAAU,YACjB,UAAU,QACT,MAA6B,SAAS,oBAC7B,CAAC;GAAC;GAAU;GAAU;EAAS,CAAC,CAAC,SAAS,OAAO,KAAK,GAChE,MAAM,IAAI,UACR,cAAc,GAAG,KAAK,OAAO,MAAM,uFACrC;EAGJ,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,OAAO,GAAG;GACV,SAAS;EACX,GACA,WAAW,KAAK,SAAS,CAC3B;CACF;CAEA,IAAsB,GAAiB,GAAG,MAA4B;EACpE,OAAO,KAAK,SACV;GACE,IAAI;GACJ,MAAM;GACN,QAAQ,EAAE;GACV,MAAO,KAAK,MAAM,CAAC;GACnB,UAAU,EAAE;EACd,GACA,WAAW,KAAK,GAAG,CACrB;CACF;AACF;;;;;AAOA,SAAgB,KAAK,OAA8C;CACjE,MAAM,UAAU,IAAI,gBAAgB;CACpC,MAAM,OAAO;CAEb,OAAO;EADsB,QAAQ;EAAM,OAAO,QAAQ;EAAO,MAAM,QAAQ;CACrE;AACZ"}

package/dist/dsl/refs.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"refs.cjs","names":[],"sources":["../../src/dsl/refs.ts"],"sourcesContent":["import type { EventMap, UserPropertyBase } from './base';\n\n/**\n * Reference tables — the DSL's only two type-injection points (drizzle's\n * column-object pattern): `u = user<UserProperty>()` and `e = event<Event>()`.\n * Every other function in the DSL is generic-free and reads types off these\n * references.\n *\n * Type technique: phantom types. `UserPropertyRef<T>` carries the property's\n * type in an optional, never-assigned `__t` — purely so free functions like\n * `eq` can infer T from the reference. At runtime a ref is just\n * `{ type, path }`, produced by a Proxy on property access.\n */\n\n/**\n * User-property reference (drizzle's column equivalent), shared by predicates\n * (eq/gt/…) and message-prop personalization. The phantom type __t is how a\n * free function reads the property's type off the reference.\n */\nexport interface UserPropertyRef<T> {\n  readonly type: 'user_property';\n  readonly path: string;\n  readonly __t?: T;\n}\n\n/** Event reference: the argument to `performed`; future payload where-clauses and value refs hang off it. */\nexport interface EventRef<P = unknown> {\n  readonly type: 'event_ref';\n  readonly name: string;\n  readonly __p?: P;\n}\n\n/** Property reference table: `u.subscription_status` is a UserPropertyRef (drizzle's `users.email`). */\nexport type UserRefs<U> = { readonly [K in keyof U]-?: UserPropertyRef<U[K]> };\n\n/** Event reference table: `e.purchase` is an EventRef. */\nexport type EventRefs<E> = { readonly [K in keyof E]-?: EventRef<E[K]> };\n\n/**\n * Build the reference tables: the app calls each once in its schema module and\n * exports the result (implemented with a Proxy — property access *is* the reference).\n *\n *   export const u = user<UserProperty>();\n *   export const e = event<Event>();\n *\n * From then on predicates and personalization are all property access:\n * eq(u.subscription_status, 'active'), performed(e.purchase, { within: '30 days' }),\n * { plan: u.subscription_plan }.\n *\n * Properties are deliberately single-level: the data source is a database\n * table and is naturally flat, so nested paths are out of scope.\n */\nexport function user<U extends UserPropertyBase>(): UserRefs<U> {\n  return new Proxy({} as UserRefs<U>, {\n    get: (_target, prop) => ({ type: 'user_property', path: String(prop) }),\n  });\n}\n\nexport function event<E extends EventMap>(): EventRefs<E> {\n  return new Proxy({} as EventRefs<E>, {\n    get: (_target, prop) => ({ type: 'event_ref', name: String(prop) }),\n  });\n}\n\nexport type PropInput<T> = T | UserPropertyRef<T>;\nexport type PropsInput<P> = { [K in keyof P]: PropInput<P[K]> };\n\n/** Props may be omitted when a template declares none, and are required when it does. */\nexport type MessageArgs<P> =\n  Record<never, never> extends P ? [props?: PropsInput<P>] : [props: PropsInput<P>];\n\n/* ------------------------------ payload references ----------------------------- */\n\n/**\n * Where a payload ref keeps its own state. A payload ref doubles as the table\n * of its sub-fields, so every *string* key it answered for itself shadowed an\n * author's field of that name: with a payload field called `path`,\n * `performed(e.page_view, (p) => eq(p.path, '/pricing'))` type-checked, handed\n * `prop()` the ref's own prefix instead of a sub-ref, and compiled to a\n * *profile* predicate on a property named 'path' — a mistake that only\n * surfaced later, as a zod error nowhere near the line that caused it. A symbol\n * key cannot be reached by `p.<field>`, so no field name can collide with it.\n */\nexport const PAYLOAD_PATH: unique symbol = Symbol('workflow.payloadPath');\n\n/**\n * Event-payload reference: what a `where` callback's parameter hands out. The\n * path it carries is dotted for nested fields ('tags.utm_source'). Predicates\n * accept it alongside UserPropertyRef and compile to a `payload` condition —\n * which is only valid inside `performed({ where })` / the event trigger's\n * `where` (compileBundle enforces the placement).\n */\nexport interface PayloadRef<T> {\n  readonly [PAYLOAD_PATH]: string;\n  readonly __t?: T;\n}\n\n/** A payload field ref that is itself an object also acts as a table of its sub-field refs. */\nexport type PayloadRefNode<T> = [NonNullable<T>] extends [object]\n  ? PayloadRef<T> & {\n      readonly [K in keyof NonNullable<T> & string]-?: PayloadRefNode<NonNullable<T>[K]>;\n    }\n  : PayloadRef<T>;\n\n/** Payload reference table for an event's payload P — the `p` in `where: (p) => eq(p.platform, 'web')`. */\nexport type PayloadRefs<P> = [P] extends [object]\n  ? { readonly [K in keyof P & string]-?: PayloadRefNode<P[K]> }\n  : Record<string, PayloadRef<unknown>>;\n\n/**\n * Nested Proxy: every string key extends the dotted path, so an author's field\n * may be named anything — including `path` or `type`. The ref's own path reads\n * off PAYLOAD_PATH, the one key a field name cannot spell.\n * @internal used by performed() and trigger.event() to hand `p` to a where callback\n */\nexport function payloadRefs<P>(prefix = ''): PayloadRefs<P> {\n  return new Proxy({} as PayloadRefs<P>, {\n    get: (_target, prop) => {\n      if (prop === PAYLOAD_PATH) return prefix;\n      // Other symbols are the runtime's own probes (inspection, iteration, thenable checks), never fields\n      if (typeof prop === 'symbol') return undefined;\n      return payloadRefs(prefix === '' ? prop : `${prefix}.${prop}`);\n    },\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAoDA,SAAgB,OAAgD;CAC9D,OAAO,IAAI,MAAM,CAAC,GAAkB,EAClC,MAAM,SAAS,UAAU;EAAE,MAAM;EAAiB,MAAM,OAAO,IAAI;CAAE,GACvE,CAAC;AACH;AAEA,SAAgB,QAA0C;CACxD,OAAO,IAAI,MAAM,CAAC,GAAmB,EACnC,MAAM,SAAS,UAAU;EAAE,MAAM;EAAa,MAAM,OAAO,IAAI;CAAE,GACnE,CAAC;AACH;;;;;;;;;;;AAqBA,MAAa,eAA8B,OAAO,sBAAsB;;;;;;;AAgCxE,SAAgB,YAAe,SAAS,IAAoB;CAC1D,OAAO,IAAI,MAAM,CAAC,GAAqB,EACrC,MAAM,SAAS,SAAS;EACtB,IAAI,SAAS,cAAc,OAAO;EAElC,IAAI,OAAO,SAAS,UAAU,OAAO,KAAA;EACrC,OAAO,YAAY,WAAW,KAAK,OAAO,GAAG,OAAO,GAAG,MAAM;CAC/D,EACF,CAAC;AACH"}
+{"version":3,"file":"refs.cjs","names":[],"sources":["../../src/dsl/refs.ts"],"sourcesContent":["import type { EventMap, UserPropertyBase } from './base';\n\n/**\n * Reference tables — the DSL's only two type-injection points (drizzle's\n * column-object pattern): `u = user<UserProperty>()` and `e = event<Event>()`.\n * Every other function in the DSL is generic-free and reads types off these\n * references.\n *\n * Type technique: phantom types. `UserPropertyRef<T>` carries the property's\n * type in an optional, never-assigned `__t` — purely so free functions like\n * `eq` can infer T from the reference. At runtime a ref is just\n * `{ type, path }`, produced by a Proxy on property access.\n */\n\n/**\n * User-property reference (drizzle's column equivalent), shared by predicates\n * (eq/gt/…) and message-prop personalization. The phantom type __t is how a\n * free function reads the property's type off the reference.\n */\nexport interface UserPropertyRef<T> {\n  readonly type: 'user_property';\n  readonly path: string;\n  readonly __t?: T;\n}\n\n/** Event reference: the argument to `performed`; future payload where-clauses and value refs hang off it. */\nexport interface EventRef<P = unknown> {\n  readonly type: 'event_ref';\n  readonly name: string;\n  readonly __p?: P;\n}\n\n/** Property reference table: `u.subscription_status` is a UserPropertyRef (drizzle's `users.email`). */\nexport type UserRefs<U> = { readonly [K in keyof U]-?: UserPropertyRef<U[K]> };\n\n/** Event reference table: `e.purchase` is an EventRef. */\nexport type EventRefs<E> = { readonly [K in keyof E]-?: EventRef<E[K]> };\n\n/**\n * Build the reference tables: the app calls each once in its schema module and\n * exports the result (implemented with a Proxy — property access *is* the reference).\n *\n *   export const u = user<UserProperty>();\n *   export const e = event<Event>();\n *\n * From then on predicates and personalization are all property access:\n * eq(u.subscription_status, 'active'), performed(e.purchase, { within: '30 days' }),\n * { plan: u.subscription_plan }.\n *\n * Properties are deliberately single-level: the data source is a database\n * table and is naturally flat, so nested paths are out of scope.\n */\nexport function user<U extends UserPropertyBase>(): UserRefs<U> {\n  return new Proxy({} as UserRefs<U>, {\n    get: (_target, prop) => ({ type: 'user_property', path: String(prop) }),\n  });\n}\n\nexport function event<E extends EventMap>(): EventRefs<E> {\n  return new Proxy({} as EventRefs<E>, {\n    get: (_target, prop) => ({ type: 'event_ref', name: String(prop) }),\n  });\n}\n\n/** An impossible field cannot be supplied indirectly through a profile reference either. */\nexport type PropInput<T> = [T] extends [never] ? never : T | UserPropertyRef<T>;\nexport type PropsInput<P> = { [K in keyof P]: PropInput<P[K]> };\n\n/** Props may be omitted when a template declares none, and are required when it does. */\nexport type MessageArgs<P> =\n  Record<string, never> extends P ? [props?: PropsInput<P>] : [props: PropsInput<P>];\n\n/* ------------------------------ payload references ----------------------------- */\n\n/**\n * Where a payload ref keeps its own state. A payload ref doubles as the table\n * of its sub-fields, so every *string* key it answered for itself shadowed an\n * author's field of that name: with a payload field called `path`,\n * `performed(e.page_view, (p) => eq(p.path, '/pricing'))` type-checked, handed\n * `prop()` the ref's own prefix instead of a sub-ref, and compiled to a\n * *profile* predicate on a property named 'path' — a mistake that only\n * surfaced later, as a zod error nowhere near the line that caused it. A symbol\n * key cannot be reached by `p.<field>`, so no field name can collide with it.\n */\nexport const PAYLOAD_PATH: unique symbol = Symbol('workflow.payloadPath');\n\n/**\n * Event-payload reference: what a `where` callback's parameter hands out. The\n * path it carries is dotted for nested fields ('tags.utm_source'). Predicates\n * accept it alongside UserPropertyRef and compile to a `payload` condition —\n * which is only valid inside `performed({ where })` / the event trigger's\n * `where` (compileBundle enforces the placement).\n */\nexport interface PayloadRef<T> {\n  readonly [PAYLOAD_PATH]: string;\n  readonly __t?: T;\n}\n\n/** A payload field ref that is itself an object also acts as a table of its sub-field refs. */\nexport type PayloadRefNode<T> = [NonNullable<T>] extends [never]\n  ? PayloadRef<T>\n  : [NonNullable<T>] extends [object]\n    ? PayloadRef<T> & {\n        readonly [\n          K in keyof NonNullable<T> & string as [NonNullable<T>[K]] extends [never] ? never : K\n        ]-?: PayloadRefNode<NonNullable<T>[K]>;\n      }\n    : PayloadRef<T>;\n\n/** Payload reference table for an event's payload P — the `p` in `where: (p) => eq(p.platform, 'web')`. */\nexport type PayloadRefs<P> = [P] extends [object]\n  ? {\n      readonly [K in keyof P & string as [P[K]] extends [never] ? never : K]-?: PayloadRefNode<\n        P[K]\n      >;\n    }\n  : Record<string, PayloadRef<unknown>>;\n\n/**\n * Nested Proxy: every string key extends the dotted path, so an author's field\n * may be named anything — including `path` or `type`. The ref's own path reads\n * off PAYLOAD_PATH, the one key a field name cannot spell.\n * @internal used by performed() and trigger.event() to hand `p` to a where callback\n */\nexport function payloadRefs<P>(prefix = ''): PayloadRefs<P> {\n  return new Proxy({} as PayloadRefs<P>, {\n    get: (_target, prop) => {\n      if (prop === PAYLOAD_PATH) return prefix;\n      // Other symbols are the runtime's own probes (inspection, iteration, thenable checks), never fields\n      if (typeof prop === 'symbol') return undefined;\n      return payloadRefs(prefix === '' ? prop : `${prefix}.${prop}`);\n    },\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAoDA,SAAgB,OAAgD;CAC9D,OAAO,IAAI,MAAM,CAAC,GAAkB,EAClC,MAAM,SAAS,UAAU;EAAE,MAAM;EAAiB,MAAM,OAAO,IAAI;CAAE,GACvE,CAAC;AACH;AAEA,SAAgB,QAA0C;CACxD,OAAO,IAAI,MAAM,CAAC,GAAmB,EACnC,MAAM,SAAS,UAAU;EAAE,MAAM;EAAa,MAAM,OAAO,IAAI;CAAE,GACnE,CAAC;AACH;;;;;;;;;;;AAsBA,MAAa,eAA8B,OAAO,sBAAsB;;;;;;;AAwCxE,SAAgB,YAAe,SAAS,IAAoB;CAC1D,OAAO,IAAI,MAAM,CAAC,GAAqB,EACrC,MAAM,SAAS,SAAS;EACtB,IAAI,SAAS,cAAc,OAAO;EAElC,IAAI,OAAO,SAAS,UAAU,OAAO,KAAA;EACrC,OAAO,YAAY,WAAW,KAAK,OAAO,GAAG,OAAO,GAAG,MAAM;CAC/D,EACF,CAAC;AACH"}

package/dist/dsl/refs.d.cts

@@ -47,10 +47,11 @@ export type EventRefs<E> = { readonly [K in keyof E]-?: EventRef<E[K]>; };
  */
 export declare function user<U extends UserPropertyBase>(): UserRefs<U>;
 export declare function event<E extends EventMap>(): EventRefs<E>;
-export type PropInput<T> = T | UserPropertyRef<T>;
+/** An impossible field cannot be supplied indirectly through a profile reference either. */
+export type PropInput<T> = [T] extends [never] ? never : T | UserPropertyRef<T>;
 export type PropsInput<P> = { [K in keyof P]: PropInput<P[K]>; };
 /** Props may be omitted when a template declares none, and are required when it does. */
-export type MessageArgs<P> = Record<never, never> extends P ? [props?: PropsInput<P>] : [props: PropsInput<P>];
+export type MessageArgs<P> = Record<string, never> extends P ? [props?: PropsInput<P>] : [props: PropsInput<P>];
 /**
  * Where a payload ref keeps its own state. A payload ref doubles as the table
  * of its sub-fields, so every *string* key it answered for itself shadowed an
@@ -74,9 +75,9 @@ export interface PayloadRef<T> {
   readonly __t?: T;
 }
 /** A payload field ref that is itself an object also acts as a table of its sub-field refs. */
-export type PayloadRefNode<T> = [NonNullable<T>] extends [object] ? PayloadRef<T> & { readonly [K in keyof NonNullable<T> & string]-?: PayloadRefNode<NonNullable<T>[K]>; } : PayloadRef<T>;
+export type PayloadRefNode<T> = [NonNullable<T>] extends [never] ? PayloadRef<T> : [NonNullable<T>] extends [object] ? PayloadRef<T> & { readonly [K in keyof NonNullable<T> & string as [NonNullable<T>[K]] extends [never] ? never : K]-?: PayloadRefNode<NonNullable<T>[K]>; } : PayloadRef<T>;
 /** Payload reference table for an event's payload P — the `p` in `where: (p) => eq(p.platform, 'web')`. */
-export type PayloadRefs<P> = [P] extends [object] ? { readonly [K in keyof P & string]-?: PayloadRefNode<P[K]>; } : Record<string, PayloadRef<unknown>>;
+export type PayloadRefs<P> = [P] extends [object] ? { readonly [K in keyof P & string as [P[K]] extends [never] ? never : K]-?: PayloadRefNode<P[K]>; } : Record<string, PayloadRef<unknown>>;
 /**
  * Nested Proxy: every string key extends the dotted path, so an author's field
  * may be named anything — including `path` or `type`. The ref's own path reads

package/dist/dsl/refs.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"refs.d.cts","names":[],"sources":["../../src/dsl/refs.ts"],"mappings":";;;;;;;;;;;;;;;;;;iBAmBiB,gBAAgB;WACtB;WACA;WACA,MAAM;;;iBAIA,SAAS;WACf;WACA;WACA,MAAM;;;YAIL,SAAS,iBAAiB,WAAW,MAAM,gBAAgB,EAAE;;YAG7D,UAAU,iBAAiB,WAAW,MAAM,SAAS,EAAE;;;;;;;;;;;;;;;wBAgBnD,KAAK,UAAU,qBAAqB,SAAS;wBAM7C,MAAM,UAAU,aAAa,UAAU;YAM3C,UAAU,KAAK,IAAI,gBAAgB;YACnC,WAAW,QAAQ,WAAW,IAAI,UAAU,EAAE;;YAG9C,YAAY,KACtB,6BAA6B,KAAK,QAAQ,WAAW,OAAO,OAAO,WAAW;;;;;;;;;;;qBAcnE;;;;;;;;iBASI,WAAW;YAChB;WACD,MAAM;;;YAIL,eAAe,MAAM,YAAY,uBACzC,WAAW,iBACC,WAAW,YAAY,gBAAgB,eAAe,YAAY,GAAG,SAEjF,WAAW;;YAGH,YAAY,MAAM,kCACd,WAAW,eAAe,eAAe,EAAE,SACvD,eAAe;;;;;;;wBAQH,YAAY,GAAG,kBAAc,YAAY"}
+{"version":3,"file":"refs.d.cts","names":[],"sources":["../../src/dsl/refs.ts"],"mappings":";;;;;;;;;;;;;;;;;;iBAmBiB,gBAAgB;WACtB;WACA;WACA,MAAM;;;iBAIA,SAAS;WACf;WACA;WACA,MAAM;;;YAIL,SAAS,iBAAiB,WAAW,MAAM,gBAAgB,EAAE;;YAG7D,UAAU,iBAAiB,WAAW,MAAM,SAAS,EAAE;;;;;;;;;;;;;;;wBAgBnD,KAAK,UAAU,qBAAqB,SAAS;wBAM7C,MAAM,UAAU,aAAa,UAAU;;YAO3C,UAAU,MAAM,6BAA6B,IAAI,gBAAgB;YACjE,WAAW,QAAQ,WAAW,IAAI,UAAU,EAAE;;YAG9C,YAAY,KACtB,8BAA8B,KAAK,QAAQ,WAAW,OAAO,OAAO,WAAW;;;;;;;;;;;qBAcpE;;;;;;;;iBASI,WAAW;YAChB;WACD,MAAM;;;YAIL,eAAe,MAAM,YAAY,sBACzC,WAAW,MACV,YAAY,uBACX,WAAW,iBAEP,WAAW,YAAY,gBAAgB,YAAY,GAAG,8BAA8B,MACjF,eAAe,YAAY,GAAG,SAErC,WAAW;;YAGL,YAAY,MAAM,kCAEd,WAAW,eAAe,EAAE,8BAA8B,MAAM,eACxE,EAAE,SAGN,eAAe;;;;;;;wBAQH,YAAY,GAAG,kBAAc,YAAY"}