npm - @unbrained/pm-cli - Versions diffs - 2026.7.20 → 2026.7.21 - Mend

@unbrained/pm-cli 2026.7.20 → 2026.7.21

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (421) hide show

package/dist/cli-bundle/chunks/chunk-IJNK6WW2.js.map DELETED Viewed

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../../../../../../../sdk/graph/assembly.ts"],
-  "sourcesContent": ["/**\n * @module sdk/graph/assembly\n *\n * Builds the shared workspace relationship graph consumed by dependency\n * queries, bounded context packets, impact analysis, and governance audits.\n * Assembly normalizes hierarchy, legacy scalar blockers, and structured\n * dependency edges into one deterministic {@link RelationshipGraph}, classifies\n * dangling references without mutating their holders, and materializes missing\n * endpoints as placeholder nodes so bounded traversals can explain absent work\n * instead of silently dropping it.\n */\nimport type { Dependency, ItemStatus } from \"../../types/index.js\";\nimport { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport {\n  RelationshipGraph,\n  createRelationshipKindRegistry,\n  type RelationshipKindRegistry,\n} from \"../relationships.js\";\n\n/** Minimal item shape inspected by dependency-reference governance. */\nexport interface DependencyReferenceHolder {\n  /** Stable item identifier. */\n  id: string;\n  /** Lifecycle status used to separate actionable work from historical debt. */\n  status: ItemStatus;\n  /** Optional hierarchy parent reference. */\n  parent?: string;\n  /** Optional legacy scalar blocker reference. */\n  blocked_by?: string;\n  /** Structured dependency edges. */\n  dependencies?: Dependency[];\n}\n\n/** Storage surface that contributed a normalized dependency reference. */\nexport type DependencyReferenceSource = \"parent\" | \"blocked_by\" | \"dependency\";\n\n/** One normalized dependency reference whose target is absent from the tracker. */\nexport interface DanglingDependencyReference {\n  /** Item that owns the reference. */\n  holder_id: string;\n  /** Missing referenced item id or legacy sentinel. */\n  target_id: string;\n  /** Relationship field or dependency kind. */\n  kind: string;\n  /** Storage surface that owns the reference and determines its remediation. */\n  source: DependencyReferenceSource;\n  /** Current lifecycle status of the holder. */\n  holder_status: ItemStatus;\n  /** Whether the holder is terminal and therefore historical, non-actionable debt. */\n  legacy_terminal: boolean;\n  /** Whether the target is the pre-structured-dependency `no-active-blocker` sentinel. */\n  no_active_blocker_sentinel: boolean;\n}\n\n/** Actionable and historical partitions returned by dependency-reference governance. */\nexport interface DanglingDependencyReferenceSummary {\n  /** Missing references held by active items; these may affect scheduling and should gate validation. */\n  active: DanglingDependencyReference[];\n  /** Missing references held only by terminal items; retained as informational history debt. */\n  legacy_terminal: DanglingDependencyReference[];\n  /** Legacy sentinel rows across active and terminal holders, called out separately from typo-like ids. */\n  no_active_blocker_sentinels: DanglingDependencyReference[];\n}\n\n/** Normalize a decoded reference target and reject empty legacy placeholders. */\nfunction normalizeDependencyReferenceTarget(\n  target: unknown,\n): string | undefined {\n  if (typeof target !== \"string\") return undefined;\n  const normalized = target.trim();\n  if (\n    !normalized ||\n    [\"none\", \"null\", \"n/a\", \"na\"].includes(normalized.toLowerCase())\n  )\n    return undefined;\n  return normalized;\n}\n\n/** Normalize a graph target while removing the historical no-blocker marker. */\nfunction normalizeDependencyGraphTarget(target: unknown): string | undefined {\n  const normalized = normalizeDependencyReferenceTarget(target);\n  return normalized?.toLowerCase() === \"no-active-blocker\"\n    ? undefined\n    : normalized;\n}\n\n/**\n * Classify missing hierarchy and dependency targets without mutating their holders.\n *\n * Consumers provide the workspace's terminal-status predicate so custom lifecycle\n * schemas receive the same active-versus-historical behavior as the built-in\n * closed/canceled statuses.\n */\nexport function collectDanglingDependencyReferences(\n  items: readonly DependencyReferenceHolder[],\n  isTerminal: (status: ItemStatus) => boolean = (status) =>\n    status === \"closed\" || status === \"canceled\",\n): DanglingDependencyReferenceSummary {\n  const safeItems = items.filter(\n    (item) => typeof item?.id === \"string\" && item.id.trim().length > 0,\n  );\n  const knownIds = new Set(\n    safeItems.map((item) => item.id.trim().toLowerCase()),\n  );\n  const rows = new Map<string, DanglingDependencyReference>();\n  const addReference = (\n    item: DependencyReferenceHolder,\n    target: unknown,\n    kind: string,\n    source: DependencyReferenceSource,\n  ): void => {\n    const normalized = normalizeDependencyReferenceTarget(target);\n    if (!normalized || knownIds.has(normalized.toLowerCase())) {\n      return;\n    }\n    const row: DanglingDependencyReference = {\n      holder_id: item.id.trim(),\n      target_id: normalized,\n      kind,\n      source,\n      holder_status: item.status,\n      legacy_terminal: isTerminal(item.status),\n      no_active_blocker_sentinel:\n        normalized.toLowerCase() === \"no-active-blocker\",\n    };\n    rows.set(\n      `${row.holder_id}::${row.target_id}::${row.kind}::${row.source}`,\n      row,\n    );\n  };\n  for (const item of safeItems) {\n    addReference(item, item.parent, \"parent\", \"parent\");\n    addReference(item, item.blocked_by, \"blocked_by\", \"blocked_by\");\n    for (const dependency of item.dependencies ?? []) {\n      // Public SDK callers may supply legacy or JSON-decoded payloads that do\n      // not yet satisfy the current structured dependency contract.\n      if (typeof dependency !== \"object\" || dependency === null) {\n        continue;\n      }\n      const legacyDependency = dependency as Partial<Dependency>;\n      addReference(\n        item,\n        legacyDependency.id,\n        typeof legacyDependency.kind === \"string\"\n          ? legacyDependency.kind\n          : \"related\",\n        \"dependency\",\n      );\n    }\n  }\n  const sorted = [...rows.values()].sort(\n    (left, right) =>\n      left.holder_id.localeCompare(right.holder_id) ||\n      left.target_id.localeCompare(right.target_id) ||\n      left.kind.localeCompare(right.kind) ||\n      left.source.localeCompare(right.source),\n  );\n  const legacyTerminal = sorted.filter((row) => row.legacy_terminal);\n  return {\n    active: sorted.filter((row) => !row.legacy_terminal),\n    legacy_terminal: legacyTerminal,\n    no_active_blocker_sentinels: sorted.filter(\n      (row) => row.no_active_blocker_sentinel,\n    ),\n  };\n}\n\n/** Return unique real missing targets while excluding the legacy no-blocker sentinel. */\nexport function collectMissingDependencyTargetIds(\n  dangling: DanglingDependencyReferenceSummary,\n): string[] {\n  const targets = new Map<string, string>();\n  for (const reference of [...dangling.active, ...dangling.legacy_terminal]) {\n    if (reference.no_active_blocker_sentinel) continue;\n    const target = reference.target_id.trim();\n    const key = target.toLowerCase();\n    if (!targets.has(key)) targets.set(key, target);\n  }\n  return [...targets.values()].sort((left, right) => left.localeCompare(right));\n}\n\n/** Item shape accepted by workspace relationship-graph assembly. */\nexport interface WorkspaceRelationshipItem extends DependencyReferenceHolder {\n  /** Human-readable title projected into per-node details. */\n  title: string;\n}\n\n/** Compact node projection paired with the assembled graph. */\nexport interface WorkspaceRelationshipNodeDetails {\n  /** Stable node identifier. */\n  id: string;\n  /** Human-readable node title, or a `[missing]` marker for absent endpoints. */\n  title: string;\n  /** Lifecycle status, or the `missing` marker status for absent endpoints. */\n  status: string;\n}\n\n/** Assembled workspace relationship graph with governance side-products. */\nexport interface WorkspaceRelationshipAssembly {\n  /** Deterministic relationship graph including missing placeholder nodes. */\n  graph: RelationshipGraph;\n  /** Per-node compact details covering real and missing nodes. */\n  details: WorkspaceRelationshipNodeDetails[];\n  /** Lowercased identifiers of materialized missing endpoints. */\n  missingIdSet: Set<string>;\n  /** Dangling-reference classification computed during assembly. */\n  dangling: DanglingDependencyReferenceSummary;\n}\n\n/**\n * Build the shared workspace relationship graph including missing placeholder\n * nodes. One assembly serves every bounded query in an invocation — dependency\n * trees, context packets, impact analysis, path enumeration, and governance\n * audits — so the full-workspace normalization cost is paid once instead of\n * once per query surface.\n */\nexport function assembleWorkspaceRelationshipGraph(\n  items: readonly WorkspaceRelationshipItem[],\n  isTerminal?: (status: ItemStatus) => boolean,\n  registry?: RelationshipKindRegistry,\n): WorkspaceRelationshipAssembly {\n  const relationshipRegistry = registry ?? createRelationshipKindRegistry();\n  if (registry === undefined) {\n    // Preserve compatibility with activation payloads produced before this registry existed.\n    for (const registration of\n      getActiveExtensionRegistrations()?.relationship_kinds ?? []) {\n      for (const definition of registration.definitions) {\n        relationshipRegistry.register(definition);\n      }\n    }\n  }\n  const safeItems = items.filter(\n    (item) => typeof item?.id === \"string\" && item.id.trim().length > 0,\n  );\n  const canonicalIds = new Map(\n    safeItems.map((item) => [item.id.trim().toLowerCase(), item.id.trim()]),\n  );\n  const dangling = collectDanglingDependencyReferences(safeItems, isTerminal);\n  const missingIds = collectMissingDependencyTargetIds(dangling);\n  for (const id of missingIds) canonicalIds.set(id.toLowerCase(), id);\n  const graphItems = safeItems.map((item) => {\n    const parent = normalizeDependencyGraphTarget(item.parent);\n    const blocker = normalizeDependencyGraphTarget(item.blocked_by);\n    const dependencies = (item.dependencies ?? []).flatMap((rawDependency) => {\n      if (typeof rawDependency !== \"object\" || rawDependency === null)\n        return [];\n      const dependency = rawDependency as Partial<Dependency>;\n      const target = normalizeDependencyGraphTarget(dependency.id);\n      if (!target) return [];\n      return [\n        {\n          id: canonicalIds.get(target.toLowerCase())!,\n          kind:\n            typeof dependency.kind === \"string\" ? dependency.kind : \"related\",\n        },\n      ];\n    });\n    return {\n      id: item.id.trim(),\n      ...(parent ? { parent: canonicalIds.get(parent.toLowerCase())! } : {}),\n      ...(blocker\n        ? { blocked_by: canonicalIds.get(blocker.toLowerCase())! }\n        : {}),\n      dependencies,\n    };\n  });\n  return {\n    graph: RelationshipGraph.fromItems(\n      [...graphItems, ...missingIds.map((id) => ({ id }))],\n      relationshipRegistry,\n    ),\n    details: [\n      ...safeItems.map((item) => ({\n        id: item.id.trim(),\n        title: item.title,\n        status: item.status,\n      })),\n      ...missingIds.map((id) => ({\n        id,\n        title: `[missing] ${id}`,\n        status: \"missing\",\n      })),\n    ],\n    missingIdSet: new Set(missingIds.map((id) => id.toLowerCase())),\n    dangling,\n  };\n}\n"],
-  "mappings": ";;;;;;;;;;;;;;;;AAiEA,SAAS,mCACP,QAAe;AAEf,MAAI,OAAO,WAAW;AAAU,WAAO;AACvC,QAAM,aAAa,OAAO,KAAI;AAC9B,MACE,CAAC,cACD,CAAC,QAAQ,QAAQ,OAAO,IAAI,EAAE,SAAS,WAAW,YAAW,CAAE;AAE/D,WAAO;AACT,SAAO;AACT;AAGA,SAAS,+BAA+B,QAAe;AACrD,QAAM,aAAa,mCAAmC,MAAM;AAC5D,SAAO,YAAY,YAAW,MAAO,sBACjC,SACA;AACN;AASM,SAAU,oCACd,OACA,aAA8C,CAAC,WAC7C,WAAW,YAAY,WAAW,YAAU;AAE9C,QAAM,YAAY,MAAM,OACtB,CAAC,SAAS,OAAO,MAAM,OAAO,YAAY,KAAK,GAAG,KAAI,EAAG,SAAS,CAAC;AAErE,QAAM,WAAW,IAAI,IACnB,UAAU,IAAI,CAAC,SAAS,KAAK,GAAG,KAAI,EAAG,YAAW,CAAE,CAAC;AAEvD,QAAM,OAAO,oBAAI,IAAG;AACpB,QAAM,eAAe,CACnB,MACA,QACA,MACA,WACQ;AACR,UAAM,aAAa,mCAAmC,MAAM;AAC5D,QAAI,CAAC,cAAc,SAAS,IAAI,WAAW,YAAW,CAAE,GAAG;AACzD;IACF;AACA,UAAM,MAAmC;MACvC,WAAW,KAAK,GAAG,KAAI;MACvB,WAAW;MACX;MACA;MACA,eAAe,KAAK;MACpB,iBAAiB,WAAW,KAAK,MAAM;MACvC,4BACE,WAAW,YAAW,MAAO;;AAEjC,SAAK,IACH,GAAG,IAAI,SAAS,KAAK,IAAI,SAAS,KAAK,IAAI,IAAI,KAAK,IAAI,MAAM,IAC9D,GAAG;EAEP;AACA,aAAW,QAAQ,WAAW;AAC5B,iBAAa,MAAM,KAAK,QAAQ,UAAU,QAAQ;AAClD,iBAAa,MAAM,KAAK,YAAY,cAAc,YAAY;AAC9D,eAAW,cAAc,KAAK,gBAAgB,CAAA,GAAI;AAGhD,UAAI,OAAO,eAAe,YAAY,eAAe,MAAM;AACzD;MACF;AACA,YAAM,mBAAmB;AACzB,mBACE,MACA,iBAAiB,IACjB,OAAO,iBAAiB,SAAS,WAC7B,iBAAiB,OACjB,WACJ,YAAY;IAEhB;EACF;AACA,QAAM,SAAS,CAAC,GAAG,KAAK,OAAM,CAAE,EAAE,KAChC,CAAC,MAAM,UACL,KAAK,UAAU,cAAc,MAAM,SAAS,KAC5C,KAAK,UAAU,cAAc,MAAM,SAAS,KAC5C,KAAK,KAAK,cAAc,MAAM,IAAI,KAClC,KAAK,OAAO,cAAc,MAAM,MAAM,CAAC;AAE3C,QAAM,iBAAiB,OAAO,OAAO,CAAC,QAAQ,IAAI,eAAe;AACjE,SAAO;IACL,QAAQ,OAAO,OAAO,CAAC,QAAQ,CAAC,IAAI,eAAe;IACnD,iBAAiB;IACjB,6BAA6B,OAAO,OAClC,CAAC,QAAQ,IAAI,0BAA0B;;AAG7C;AAGM,SAAU,kCACd,UAA4C;AAE5C,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,aAAa,CAAC,GAAG,SAAS,QAAQ,GAAG,SAAS,eAAe,GAAG;AACzE,QAAI,UAAU;AAA4B;AAC1C,UAAM,SAAS,UAAU,UAAU,KAAI;AACvC,UAAM,MAAM,OAAO,YAAW;AAC9B,QAAI,CAAC,QAAQ,IAAI,GAAG;AAAG,cAAQ,IAAI,KAAK,MAAM;EAChD;AACA,SAAO,CAAC,GAAG,QAAQ,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AAC9E;AAqCM,SAAU,mCACd,OACA,YACA,UAAmC;AAEnC,QAAM,uBAAuB,YAAY,+BAA8B;AACvE,MAAI,aAAa,QAAW;AAE1B,eAAW,gBACT,gCAA+B,GAAI,sBAAsB,CAAA,GAAI;AAC7D,iBAAW,cAAc,aAAa,aAAa;AACjD,6BAAqB,SAAS,UAAU;MAC1C;IACF;EACF;AACA,QAAM,YAAY,MAAM,OACtB,CAAC,SAAS,OAAO,MAAM,OAAO,YAAY,KAAK,GAAG,KAAI,EAAG,SAAS,CAAC;AAErE,QAAM,eAAe,IAAI,IACvB,UAAU,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,KAAI,EAAG,YAAW,GAAI,KAAK,GAAG,KAAI,CAAE,CAAC,CAAC;AAEzE,QAAM,WAAW,oCAAoC,WAAW,UAAU;AAC1E,QAAM,aAAa,kCAAkC,QAAQ;AAC7D,aAAW,MAAM;AAAY,iBAAa,IAAI,GAAG,YAAW,GAAI,EAAE;AAClE,QAAM,aAAa,UAAU,IAAI,CAAC,SAAQ;AACxC,UAAM,SAAS,+BAA+B,KAAK,MAAM;AACzD,UAAM,UAAU,+BAA+B,KAAK,UAAU;AAC9D,UAAM,gBAAgB,KAAK,gBAAgB,CAAA,GAAI,QAAQ,CAAC,kBAAiB;AACvE,UAAI,OAAO,kBAAkB,YAAY,kBAAkB;AACzD,eAAO,CAAA;AACT,YAAM,aAAa;AACnB,YAAM,SAAS,+BAA+B,WAAW,EAAE;AAC3D,UAAI,CAAC;AAAQ,eAAO,CAAA;AACpB,aAAO;QACL;UACE,IAAI,aAAa,IAAI,OAAO,YAAW,CAAE;UACzC,MACE,OAAO,WAAW,SAAS,WAAW,WAAW,OAAO;;;IAGhE,CAAC;AACD,WAAO;MACL,IAAI,KAAK,GAAG,KAAI;MAChB,GAAI,SAAS,EAAE,QAAQ,aAAa,IAAI,OAAO,YAAW,CAAE,EAAE,IAAK,CAAA;MACnE,GAAI,UACA,EAAE,YAAY,aAAa,IAAI,QAAQ,YAAW,CAAE,EAAE,IACtD,CAAA;MACJ;;EAEJ,CAAC;AACD,SAAO;IACL,OAAO,kBAAkB,UACvB,CAAC,GAAG,YAAY,GAAG,WAAW,IAAI,CAAC,QAAQ,EAAE,GAAE,EAAG,CAAC,GACnD,oBAAoB;IAEtB,SAAS;MACP,GAAG,UAAU,IAAI,CAAC,UAAU;QAC1B,IAAI,KAAK,GAAG,KAAI;QAChB,OAAO,KAAK;QACZ,QAAQ,KAAK;QACb;MACF,GAAG,WAAW,IAAI,CAAC,QAAQ;QACzB;QACA,OAAO,aAAa,EAAE;QACtB,QAAQ;QACR;;IAEJ,cAAc,IAAI,IAAI,WAAW,IAAI,CAAC,OAAO,GAAG,YAAW,CAAE,CAAC;IAC9D;;AAEJ;",
-  "names": []
-}

package/dist/cli-bundle/chunks/chunk-INSTSQNZ.js.map DELETED Viewed

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../../../../../../../sdk/merge/three-way.ts", "../../../../../../../../sdk/merge/driver.ts"],
-  "sourcesContent": ["/**\n * @module sdk/merge/three-way\n *\n * Field-aware three-way merge primitives for every mergeable tracker artifact\n * class: append-only history JSONL streams, item documents (TOON or\n * JSON+Markdown), and key-level JSON configuration/schema files. These\n * primitives are pure (content in, content out) so the CLI merge driver, the\n * MCP surface, and package integrations all share one merge semantics\n * definition for multi-branch agent workflows.\n */\nimport {\n  historyEntriesToRaw,\n  reanchorHistoryEntries,\n} from \"../../core/history/replay.js\";\nimport {\n  canonicalDocument,\n  parseItemDocument,\n  serializeItemDocument,\n  type ItemDocumentFormatOptions,\n} from \"../../core/item/item-format.js\";\nimport { EXIT_CODE } from \"../../core/shared/constants.js\";\nimport { findFirstMergeConflictMarker } from \"../../core/shared/conflict-markers.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { stableStringify } from \"../../core/shared/serialization.js\";\nimport { compareTimestampStrings } from \"../../core/shared/time.js\";\nimport type {\n  HistoryEntry,\n  ItemDocument,\n  ItemMetadata,\n} from \"../../types/index.js\";\n\n/** Restricts which side of a three-way merge wins an unresolvable conflict. */\nexport type MergePreferredSide = \"ours\" | \"theirs\";\n\n/** Restricts the strategy labels reported by the history stream merge. */\nexport type HistoryMergeStrategy =\n  | \"identical\"\n  | \"fast_forward_ours\"\n  | \"fast_forward_theirs\"\n  | \"union_reanchor\";\n\n/** Documents the history stream merge result payload exchanged by command, SDK, and package integrations. */\nexport interface HistoryMergeResult {\n  /** Merged JSONL content ready to be written as the resolved history stream. */\n  merged: string;\n  /** Strategy the merge used: identical inputs, one-sided fast-forward, or a deterministic union with a re-anchored hash chain. */\n  strategy: HistoryMergeStrategy;\n  /** Number of entries shared by both sides before their streams diverged. */\n  common_entries: number;\n  /** Number of divergent entries contributed by the ours side. */\n  entries_from_ours: number;\n  /** Number of divergent entries contributed by the theirs side. */\n  entries_from_theirs: number;\n  /** Total entries in the merged stream. */\n  entries_total: number;\n  /** Whether the merged chain required hash re-anchoring (true for every union merge). */\n  reanchored: boolean;\n}\n\nfunction parseHistoryJsonl(raw: string, label: string): HistoryEntry[] {\n  const conflictMarker = findFirstMergeConflictMarker(raw);\n  if (conflictMarker) {\n    throw new PmCliError(\n      `History merge input (${label}) contains unresolved conflict markers at line ${conflictMarker.line}. Merge drivers must receive clean per-side versions.`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n  const entries: HistoryEntry[] = [];\n  for (const [index, rawLine] of raw.split(/\\r?\\n/).entries()) {\n    const line = rawLine.trim();\n    if (!line) {\n      continue;\n    }\n    try {\n      const parsed = JSON.parse(line) as unknown;\n      if (typeof parsed !== \"object\" || parsed === null || Array.isArray(parsed)) {\n        throw new TypeError(\"history entry must be an object\");\n      }\n      entries.push(parsed as HistoryEntry);\n    } catch {\n      throw new PmCliError(\n        `History merge input (${label}) contains invalid JSON at line ${index + 1}.`,\n        EXIT_CODE.GENERIC_FAILURE,\n      );\n    }\n  }\n  return entries;\n}\n\nfunction historyEntryIdentity(entry: HistoryEntry): string {\n  return stableStringify({\n    ts: entry.ts,\n    author: entry.author,\n    op: entry.op,\n    patch: entry.patch,\n    message: entry.message ?? null,\n  });\n}\n\nfunction commonHistoryPrefixLength(\n  ours: HistoryEntry[],\n  theirs: HistoryEntry[],\n): number {\n  const limit = Math.min(ours.length, theirs.length);\n  let shared = 0;\n  while (\n    shared < limit &&\n    historyEntryIdentity(ours[shared]) === historyEntryIdentity(theirs[shared])\n  ) {\n    shared += 1;\n  }\n  return shared;\n}\n\n/**\n * Deterministically merge two diverged versions of one append-only history\n * JSONL stream. Identical streams and one-sided fast-forwards keep the winning\n * side byte-for-byte; genuinely diverged streams are merged as the shared\n * prefix plus both suffixes ordered by timestamp (ours-first on ties), then\n * hash re-anchored so the resulting chain verifies again. No side's events are\n * ever discarded: content divergence is preserved for the post-merge\n * reconciliation pass (`pm validate` + `pm history-repair`) instead of being\n * silently resolved by last-writer-wins.\n */\nexport function mergeHistoryStreams(\n  baseRaw: string,\n  oursRaw: string,\n  theirsRaw: string,\n): HistoryMergeResult {\n  parseHistoryJsonl(baseRaw, \"base\");\n  const ours = parseHistoryJsonl(oursRaw, \"ours\");\n  const theirs = parseHistoryJsonl(theirsRaw, \"theirs\");\n  const shared = commonHistoryPrefixLength(ours, theirs);\n\n  if (shared === ours.length && shared === theirs.length) {\n    return {\n      merged: historyEntriesToRaw(ours),\n      strategy: \"identical\",\n      common_entries: shared,\n      entries_from_ours: 0,\n      entries_from_theirs: 0,\n      entries_total: ours.length,\n      reanchored: false,\n    };\n  }\n  if (shared === theirs.length) {\n    return {\n      merged: historyEntriesToRaw(ours),\n      strategy: \"fast_forward_ours\",\n      common_entries: shared,\n      entries_from_ours: ours.length - shared,\n      entries_from_theirs: 0,\n      entries_total: ours.length,\n      reanchored: false,\n    };\n  }\n  if (shared === ours.length) {\n    return {\n      merged: historyEntriesToRaw(theirs),\n      strategy: \"fast_forward_theirs\",\n      common_entries: shared,\n      entries_from_ours: 0,\n      entries_from_theirs: theirs.length - shared,\n      entries_total: theirs.length,\n      reanchored: false,\n    };\n  }\n\n  const oursSuffix = ours.slice(shared);\n  const seenIdentities = new Set(oursSuffix.map(historyEntryIdentity));\n  const theirsSuffix = theirs\n    .slice(shared)\n    .filter((entry) => !seenIdentities.has(historyEntryIdentity(entry)));\n  const mergedSuffix = [...oursSuffix, ...theirsSuffix].sort((left, right) => {\n    const byTs = compareTimestampStrings(left.ts, right.ts);\n    if (byTs !== 0) {\n      return byTs;\n    }\n    const leftFromOurs = seenIdentities.has(historyEntryIdentity(left));\n    const rightFromOurs = seenIdentities.has(historyEntryIdentity(right));\n    if (leftFromOurs !== rightFromOurs) {\n      return Number(rightFromOurs) - Number(leftFromOurs);\n    }\n    return historyEntryIdentity(left).localeCompare(historyEntryIdentity(right));\n  });\n  const reanchored = reanchorHistoryEntries([\n    ...ours.slice(0, shared),\n    ...mergedSuffix,\n  ]);\n  return {\n    merged: historyEntriesToRaw(reanchored.entries),\n    strategy: \"union_reanchor\",\n    common_entries: shared,\n    entries_from_ours: oursSuffix.length,\n    entries_from_theirs: theirsSuffix.length,\n    entries_total: reanchored.entries.length,\n    reanchored: true,\n  };\n}\n\n/** Documents the relationship event stream merge result payload exchanged by command, SDK, and package integrations. */\nexport interface RelationshipStreamMergeResult {\n  /** Merged JSONL content with consecutively renumbered `sequence` values, ready to be written as the resolved event store. */\n  merged: string;\n  /** Strategy the merge used: identical inputs, one-sided fast-forward, or a deterministic union with renumbered sequences. */\n  strategy: HistoryMergeStrategy;\n  /** Number of events shared by both sides before their streams diverged. */\n  common_entries: number;\n  /** Number of divergent events contributed by the ours side. */\n  entries_from_ours: number;\n  /** Number of divergent events contributed by the theirs side. */\n  entries_from_theirs: number;\n  /** Total events in the merged stream. */\n  entries_total: number;\n  /** Whether merged events required sequence renumbering (true for every union merge). */\n  reanchored: boolean;\n}\n\ninterface RelationshipStreamEvent {\n  /** Globally unique event identity used for prefix detection and suffix deduplication. */\n  eventId: string;\n  /** One-based append sequence; rewritten consecutively in the merged stream. */\n  sequence: number;\n  /** ISO timestamp used to order divergent suffixes deterministically. */\n  timestamp?: string;\n  /** Remaining event payload fields, preserved verbatim. */\n  [key: string]: unknown;\n}\n\nfunction parseRelationshipJsonl(\n  raw: string,\n  label: string,\n): RelationshipStreamEvent[] {\n  const conflictMarker = findFirstMergeConflictMarker(raw);\n  if (conflictMarker) {\n    throw new PmCliError(\n      `Relationship merge input (${label}) contains unresolved conflict markers at line ${conflictMarker.line}. Merge drivers must receive clean per-side versions.`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n  const events: RelationshipStreamEvent[] = [];\n  for (const [index, rawLine] of raw.split(/\\r?\\n/).entries()) {\n    const line = rawLine.trim();\n    if (!line) {\n      continue;\n    }\n    let parsed: unknown;\n    try {\n      parsed = JSON.parse(line) as unknown;\n    } catch {\n      throw new PmCliError(\n        `Relationship merge input (${label}) contains invalid JSON at line ${index + 1}.`,\n        EXIT_CODE.GENERIC_FAILURE,\n      );\n    }\n    if (\n      typeof parsed !== \"object\" ||\n      parsed === null ||\n      Array.isArray(parsed) ||\n      typeof (parsed as { eventId?: unknown }).eventId !== \"string\" ||\n      typeof (parsed as { sequence?: unknown }).sequence !== \"number\"\n    ) {\n      throw new PmCliError(\n        `Relationship merge input (${label}) line ${index + 1} is not a relationship event (eventId + sequence required).`,\n        EXIT_CODE.GENERIC_FAILURE,\n      );\n    }\n    events.push(parsed as RelationshipStreamEvent);\n  }\n  return events;\n}\n\nfunction relationshipEventsToRaw(events: RelationshipStreamEvent[]): string {\n  return events.length === 0\n    ? \"\"\n    : `${events.map((event) => JSON.stringify(event)).join(\"\\n\")}\\n`;\n}\n\nfunction renumberRelationshipEvents(\n  events: RelationshipStreamEvent[],\n): RelationshipStreamEvent[] {\n  return events.map((event, index) => ({ ...event, sequence: index + 1 }));\n}\n\n/**\n * Deterministically merge two diverged versions of one append-only\n * relationship event JSONL store. The store's loader enforces strictly\n * consecutive one-based `sequence` values, so a plain text union of two\n * diverged streams is always unreadable; this merge keeps the shared prefix,\n * unions both divergent suffixes by `eventId` (ordered by event timestamp,\n * ours-first on ties), and renumbers every merged sequence consecutively so\n * the resulting stream loads again. No side's events are ever discarded.\n */\nexport function mergeRelationshipEventStreams(\n  baseRaw: string,\n  oursRaw: string,\n  theirsRaw: string,\n): RelationshipStreamMergeResult {\n  parseRelationshipJsonl(baseRaw, \"base\");\n  const ours = parseRelationshipJsonl(oursRaw, \"ours\");\n  const theirs = parseRelationshipJsonl(theirsRaw, \"theirs\");\n  const limit = Math.min(ours.length, theirs.length);\n  let shared = 0;\n  while (shared < limit && ours[shared].eventId === theirs[shared].eventId) {\n    shared += 1;\n  }\n\n  if (shared === ours.length && shared === theirs.length) {\n    return {\n      merged: relationshipEventsToRaw(ours),\n      strategy: \"identical\",\n      common_entries: shared,\n      entries_from_ours: 0,\n      entries_from_theirs: 0,\n      entries_total: ours.length,\n      reanchored: false,\n    };\n  }\n  if (shared === theirs.length) {\n    return {\n      merged: relationshipEventsToRaw(ours),\n      strategy: \"fast_forward_ours\",\n      common_entries: shared,\n      entries_from_ours: ours.length - shared,\n      entries_from_theirs: 0,\n      entries_total: ours.length,\n      reanchored: false,\n    };\n  }\n  if (shared === ours.length) {\n    return {\n      merged: relationshipEventsToRaw(theirs),\n      strategy: \"fast_forward_theirs\",\n      common_entries: shared,\n      entries_from_ours: 0,\n      entries_from_theirs: theirs.length - shared,\n      entries_total: theirs.length,\n      reanchored: false,\n    };\n  }\n\n  const oursSuffix = ours.slice(shared);\n  const oursEventIds = new Set(oursSuffix.map((event) => event.eventId));\n  const theirsSuffix = theirs\n    .slice(shared)\n    .filter((event) => !oursEventIds.has(event.eventId));\n  const mergedSuffix = [...oursSuffix, ...theirsSuffix].sort((left, right) => {\n    if (left.timestamp !== undefined && right.timestamp !== undefined) {\n      const byTs = compareTimestampStrings(left.timestamp, right.timestamp);\n      if (byTs !== 0) {\n        return byTs;\n      }\n    } else if (left.timestamp === undefined && right.timestamp !== undefined) {\n      return 1;\n    } else if (left.timestamp !== undefined) {\n      return -1;\n    }\n    const leftFromOurs = oursEventIds.has(left.eventId);\n    const rightFromOurs = oursEventIds.has(right.eventId);\n    if (leftFromOurs !== rightFromOurs) {\n      return Number(rightFromOurs) - Number(leftFromOurs);\n    }\n    // Array.prototype.sort is stable: returning zero preserves each side's\n    // original append order when its events share a timestamp.\n    return 0;\n  });\n  const merged = renumberRelationshipEvents([\n    ...ours.slice(0, shared),\n    ...mergedSuffix,\n  ]);\n  return {\n    merged: relationshipEventsToRaw(merged),\n    strategy: \"union_reanchor\",\n    common_entries: shared,\n    entries_from_ours: oursSuffix.length,\n    entries_from_theirs: theirsSuffix.length,\n    entries_total: merged.length,\n    reanchored: true,\n  };\n}\n\n/**\n * Item metadata collections merged by element-identity set semantics instead\n * of whole-field three-way comparison: concurrent commutative appends from two\n * branches (notes on A, tags on B, a test run on each) must merge cleanly.\n * Element identity is the stable serialization of the normalized element, so\n * an element edited on one side counts as remove-old + add-new and both sides'\n * contributions survive. Plan collections are deliberately excluded: plan\n * steps carry cross-element ordering invariants that set-union would corrupt,\n * so they stay under scalar three-way semantics with explicit conflicts.\n */\nexport const ITEM_UNION_COLLECTION_FIELDS = [\n  \"tags\",\n  \"dependencies\",\n  \"comments\",\n  \"notes\",\n  \"learnings\",\n  \"files\",\n  \"tests\",\n  \"test_runs\",\n  \"docs\",\n  \"reminders\",\n  \"events\",\n] as const;\n\n/** Item metadata fields resolved by deterministic latest-timestamp-wins instead of three-way conflict, so disjoint-field edits never conflict on the shared freshness scalar every mutation rewrites. */\nexport const ITEM_LATEST_TIMESTAMP_FIELDS = [\"updated_at\"] as const;\n\n/** Documents the item document merge result payload exchanged by command, SDK, and package integrations. */\nexport interface ItemDocumentMergeResult {\n  /** Serialized merged item document (always parseable; count headers recomputed by canonical serialization). */\n  merged: string;\n  /** Metadata fields (plus `body`) where both sides changed to different values; resolved toward the preferred side. */\n  conflict_fields: string[];\n  /** Fields taken from the theirs side by clean three-way resolution. */\n  fields_from_theirs: string[];\n  /** Collection fields that merged by element-identity union. */\n  union_fields: string[];\n  /** Which side unresolvable conflicts were resolved toward. */\n  preferred: MergePreferredSide;\n}\n\nfunction jsonEquals(left: unknown, right: unknown): boolean {\n  return stableStringify(left ?? null) === stableStringify(right ?? null);\n}\n\nfunction unionCollection(\n  base: unknown,\n  ours: unknown,\n  theirs: unknown,\n): unknown[] {\n  const toEntries = (value: unknown): unknown[] =>\n    Array.isArray(value) ? value : [];\n  const baseIds = new Set(toEntries(base).map((entry) => stableStringify(entry)));\n  const oursEntries = toEntries(ours);\n  const oursIds = new Set(oursEntries.map((entry) => stableStringify(entry)));\n  const theirsEntries = toEntries(theirs);\n  const theirsIds = new Set(\n    theirsEntries.map((entry) => stableStringify(entry)),\n  );\n  const merged = oursEntries.filter((entry) => {\n    const identity = stableStringify(entry);\n    // An element kept by ours survives unless theirs deleted it (present in\n    // base, absent from theirs).\n    return !baseIds.has(identity) || theirsIds.has(identity);\n  });\n  for (const entry of theirsEntries) {\n    const identity = stableStringify(entry);\n    if (!oursIds.has(identity) && !baseIds.has(identity)) {\n      merged.push(entry);\n    }\n  }\n  return merged;\n}\n\nfunction latestTimestamp(ours: unknown, theirs: unknown): unknown {\n  return compareTimestampStrings(String(ours), String(theirs)) >= 0\n    ? ours\n    : theirs;\n}\n\ninterface ScalarMergeOutcome {\n  value: unknown;\n  from_theirs: boolean;\n  conflict: boolean;\n}\n\nfunction mergeScalarThreeWay(\n  base: unknown,\n  ours: unknown,\n  theirs: unknown,\n  preferred: MergePreferredSide,\n): ScalarMergeOutcome {\n  if (jsonEquals(ours, theirs)) {\n    return { value: ours, from_theirs: false, conflict: false };\n  }\n  if (jsonEquals(base, ours)) {\n    return { value: theirs, from_theirs: true, conflict: false };\n  }\n  if (jsonEquals(base, theirs)) {\n    return { value: ours, from_theirs: false, conflict: false };\n  }\n  return {\n    value: preferred === \"theirs\" ? theirs : ours,\n    from_theirs: preferred === \"theirs\",\n    conflict: true,\n  };\n}\n\nfunction toMetadataRecord(document: ItemDocument): Record<string, unknown> {\n  return { ...(document.metadata as unknown as Record<string, unknown>) };\n}\n\nfunction parseItemMergeSide(\n  raw: string,\n  label: string,\n  options: ItemDocumentFormatOptions,\n): ItemDocument {\n  try {\n    return canonicalDocument(parseItemDocument(raw, options), options);\n  } catch (error) {\n    throw new PmCliError(\n      `Item merge input (${label}) is not a readable item document: ${String(error)}`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n}\n\ninterface ItemMetadataMergeAccumulator {\n  /** Merged metadata values keyed by canonical field name. */\n  merged: Record<string, unknown>;\n  /** Scalar fields where both sides diverged from the base. */\n  conflictFields: string[];\n  /** Scalar fields cleanly selected from the other branch. */\n  fieldsFromTheirs: string[];\n  /** Collection fields whose final union differs from ours. */\n  unionFields: string[];\n}\n\nfunction mergeItemMetadataRecords(\n  baseRecord: Record<string, unknown>,\n  oursRecord: Record<string, unknown>,\n  theirsRecord: Record<string, unknown>,\n  preferred: MergePreferredSide,\n): ItemMetadataMergeAccumulator {\n  const unionFieldSet = new Set<string>(ITEM_UNION_COLLECTION_FIELDS);\n  const latestFieldSet = new Set<string>(ITEM_LATEST_TIMESTAMP_FIELDS);\n  const fieldNames = [\n    ...new Set([...Object.keys(oursRecord), ...Object.keys(theirsRecord)]),\n  ].sort((left, right) => left.localeCompare(right));\n  const accumulator: ItemMetadataMergeAccumulator = {\n    merged: {},\n    conflictFields: [],\n    fieldsFromTheirs: [],\n    unionFields: [],\n  };\n\n  for (const field of fieldNames) {\n    const baseValue = baseRecord[field];\n    const oursValue = oursRecord[field];\n    const theirsValue = theirsRecord[field];\n    if (unionFieldSet.has(field)) {\n      const union = unionCollection(baseValue, oursValue, theirsValue);\n      // `fieldNames` is derived from both records' own keys, so a collection\n      // reached here is declared by at least one side. Preserve even an empty\n      // result (`tags` is required) so serialization never drops it.\n      accumulator.merged[field] = union;\n      if (!jsonEquals(union, oursValue)) {\n        accumulator.unionFields.push(field);\n      }\n      continue;\n    }\n    if (latestFieldSet.has(field)) {\n      accumulator.merged[field] = latestTimestamp(oursValue, theirsValue);\n      continue;\n    }\n    const outcome = mergeScalarThreeWay(\n      baseValue,\n      oursValue,\n      theirsValue,\n      preferred,\n    );\n    if (outcome.value !== undefined) {\n      accumulator.merged[field] = outcome.value;\n    }\n    if (outcome.conflict) {\n      accumulator.conflictFields.push(field);\n    } else if (outcome.from_theirs) {\n      accumulator.fieldsFromTheirs.push(field);\n    }\n  }\n  return accumulator;\n}\n\n/**\n * Field-aware three-way merge of one tracker item document. Commutative\n * collections (notes, tags, tests, ...) union by element identity so\n * concurrent appends never conflict; `updated_at` resolves to the latest\n * timestamp so disjoint-field edits never collide on the shared freshness\n * scalar; every other metadata field and the body use classic three-way\n * resolution. Unresolvable both-sides-changed conflicts are resolved toward\n * the preferred side but reported in `conflict_fields`, and the merged output\n * is always canonically serialized — count-prefixed TOON array headers are\n * recomputed, so the hand-resolution corruption class (stale `notes[N]`\n * headers) cannot be produced by this merge.\n */\nexport function mergeItemDocuments(\n  baseRaw: string,\n  oursRaw: string,\n  theirsRaw: string,\n  options: ItemDocumentFormatOptions & {\n    /** Side that wins unresolvable conflicts (default \"ours\"). */\n    preferred?: MergePreferredSide;\n  } = {},\n): ItemDocumentMergeResult {\n  const preferred: MergePreferredSide = options.preferred ?? \"ours\";\n  // An empty base means both branches created the file independently\n  // (add/add); three-way falls back to treating every differing field as an\n  // ours/theirs decision, which the scalar resolver already models.\n  const hasBase = baseRaw.trim().length > 0;\n  const ours = parseItemMergeSide(oursRaw, \"ours\", options);\n  const theirs = parseItemMergeSide(theirsRaw, \"theirs\", options);\n  const base = hasBase ? parseItemMergeSide(baseRaw, \"base\", options) : ours;\n\n  const baseRecord = hasBase\n    ? toMetadataRecord(base)\n    : ({} as Record<string, unknown>);\n  const oursRecord = toMetadataRecord(ours);\n  const theirsRecord = toMetadataRecord(theirs);\n  const { merged, conflictFields, fieldsFromTheirs, unionFields } =\n    mergeItemMetadataRecords(baseRecord, oursRecord, theirsRecord, preferred);\n\n  const bodyOutcome = mergeScalarThreeWay(\n    hasBase ? base.body : \"\",\n    ours.body,\n    theirs.body,\n    preferred,\n  );\n  if (bodyOutcome.conflict) {\n    conflictFields.push(\"body\");\n  } else if (bodyOutcome.from_theirs) {\n    fieldsFromTheirs.push(\"body\");\n  }\n\n  const mergedRaw = serializeItemDocument(\n    {\n      metadata: merged as unknown as ItemMetadata,\n      body: bodyOutcome.value as string,\n    },\n    options,\n  );\n  return {\n    merged: mergedRaw,\n    conflict_fields: conflictFields,\n    fields_from_theirs: fieldsFromTheirs,\n    union_fields: unionFields,\n    preferred,\n  };\n}\n\n/** Documents the JSON document merge result payload exchanged by command, SDK, and package integrations. */\nexport interface JsonDocumentMergeResult {\n  /** Serialized merged JSON document (two-space indent, trailing newline — the tracker's canonical config style). */\n  merged: string;\n  /** Dotted key paths where both sides changed to different values; resolved toward the preferred side. */\n  conflict_paths: string[];\n  /** Dotted key paths taken from the theirs side by clean three-way resolution. */\n  paths_from_theirs: string[];\n  /** Which side unresolvable conflicts were resolved toward. */\n  preferred: MergePreferredSide;\n}\n\nfunction isPlainObject(value: unknown): value is Record<string, unknown> {\n  return (\n    typeof value === \"object\" &&\n    value !== null &&\n    !Array.isArray(value)\n  );\n}\n\nfunction parseJsonSide(raw: string, label: string): unknown {\n  const conflictMarker = findFirstMergeConflictMarker(raw);\n  if (conflictMarker) {\n    throw new PmCliError(\n      `JSON merge input (${label}) contains unresolved conflict markers at line ${conflictMarker.line}.`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n  if (raw.trim().length === 0) {\n    return undefined;\n  }\n  try {\n    return JSON.parse(raw) as unknown;\n  } catch {\n    throw new PmCliError(\n      `JSON merge input (${label}) is not valid JSON.`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n}\n\nfunction mergeJsonValue(\n  base: unknown,\n  ours: unknown,\n  theirs: unknown,\n  preferred: MergePreferredSide,\n  pathPrefix: string,\n  conflictPaths: string[],\n  pathsFromTheirs: string[],\n): unknown {\n  if (jsonEquals(ours, theirs)) {\n    return ours;\n  }\n  if (isPlainObject(ours) && isPlainObject(theirs)) {\n    const baseObject = isPlainObject(base) ? base : {};\n    const merged: Record<string, unknown> = {};\n    const keys = [\n      ...new Set([...Object.keys(ours), ...Object.keys(theirs)]),\n    ].sort((left, right) => left.localeCompare(right));\n    for (const key of keys) {\n      const childPath = pathPrefix.length > 0 ? `${pathPrefix}.${key}` : key;\n      const child = mergeJsonKey(\n        baseObject,\n        ours,\n        theirs,\n        key,\n        preferred,\n        childPath,\n        conflictPaths,\n        pathsFromTheirs,\n      );\n      if (child !== undefined) {\n        merged[key] = child;\n      }\n    }\n    return merged;\n  }\n  const outcome = mergeScalarThreeWay(base, ours, theirs, preferred);\n  if (outcome.conflict) {\n    conflictPaths.push(pathPrefix);\n  } else if (outcome.from_theirs) {\n    pathsFromTheirs.push(pathPrefix);\n  }\n  return outcome.value;\n}\n\nfunction mergeJsonKey(\n  base: Record<string, unknown>,\n  ours: Record<string, unknown>,\n  theirs: Record<string, unknown>,\n  key: string,\n  preferred: MergePreferredSide,\n  childPath: string,\n  conflictPaths: string[],\n  pathsFromTheirs: string[],\n): unknown {\n  const inOurs = Object.prototype.hasOwnProperty.call(ours, key);\n  const inTheirs = Object.prototype.hasOwnProperty.call(theirs, key);\n  const inBase = Object.prototype.hasOwnProperty.call(base, key);\n  if (inOurs && inTheirs) {\n    return mergeJsonValue(\n      base[key],\n      ours[key],\n      theirs[key],\n      preferred,\n      childPath,\n      conflictPaths,\n      pathsFromTheirs,\n    );\n  }\n  if (inOurs) {\n    // Present only in ours: either ours added it (keep) or theirs deleted it\n    // (honor the delete when ours left it untouched from base).\n    if (inBase && jsonEquals(base[key], ours[key])) {\n      pathsFromTheirs.push(childPath);\n      return undefined;\n    }\n    if (inBase) {\n      conflictPaths.push(childPath);\n      return preferred === \"theirs\" ? undefined : ours[key];\n    }\n    return ours[key];\n  }\n  // Present only in theirs (mirror of the branch above).\n  if (inBase && jsonEquals(base[key], theirs[key])) {\n    return undefined;\n  }\n  if (inBase) {\n    conflictPaths.push(childPath);\n    return preferred === \"theirs\" ? theirs[key] : undefined;\n  }\n  pathsFromTheirs.push(childPath);\n  return theirs[key];\n}\n\n/**\n * Key-level three-way merge for the tracker's single-file JSON configuration\n * artifacts (`settings.json`, `schema/*.json`). Nested objects merge\n * recursively per key so two branches editing disjoint settings never\n * conflict; both-sides-changed leaf values resolve toward the preferred side\n * and are reported in `conflict_paths`. The output is always valid JSON, so a\n * merged configuration can never regress into the silent-defaults fallback\n * that raw conflict markers cause.\n */\nexport function mergeJsonDocuments(\n  baseRaw: string,\n  oursRaw: string,\n  theirsRaw: string,\n  options: {\n    /** Side that wins unresolvable conflicts (default \"ours\"). */\n    preferred?: MergePreferredSide;\n  } = {},\n): JsonDocumentMergeResult {\n  const preferred: MergePreferredSide = options.preferred ?? \"ours\";\n  const base = parseJsonSide(baseRaw, \"base\");\n  const ours = parseJsonSide(oursRaw, \"ours\");\n  const theirs = parseJsonSide(theirsRaw, \"theirs\");\n  const conflictPaths: string[] = [];\n  const pathsFromTheirs: string[] = [];\n  const merged = mergeJsonValue(\n    base,\n    ours,\n    theirs,\n    preferred,\n    \"\",\n    conflictPaths,\n    pathsFromTheirs,\n  );\n  return {\n    merged: `${JSON.stringify(merged ?? null, null, 2)}\\n`,\n    conflict_paths: conflictPaths,\n    paths_from_theirs: pathsFromTheirs,\n    preferred,\n  };\n}\n", "/**\n * @module sdk/merge/driver\n *\n * File-level git merge driver runner for tracker artifacts. Git invokes the\n * driver with the base (%O), ours (%A), and theirs (%B) temporary files; the\n * driver writes the merged content back to the ours path and reports whether\n * unresolvable conflicts remain. Conflicted artifacts are still written as\n * parseable documents (resolved toward the preferred side) so a conflicted\n * merge never corrupts tracker storage the way raw conflict markers do.\n */\nimport { readFile, writeFile } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport { collectRegisteredItemFieldNames } from \"../../core/extensions/item-fields.js\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { EXIT_CODE } from \"../../core/shared/constants.js\";\nimport type { GlobalOptions } from \"../../core/shared/command-types.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { nowIso } from \"../../core/shared/time.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport type { ItemFormat, PmSettings } from \"../../types/index.js\";\nimport {\n  mergeHistoryStreams,\n  mergeItemDocuments,\n  mergeJsonDocuments,\n  mergeRelationshipEventStreams,\n  type MergePreferredSide,\n} from \"./three-way.js\";\n\n/** Supported values accepted by the merge driver artifact contract across CLI, SDK, and MCP surfaces. */\nexport const MERGE_DRIVER_ARTIFACT_VALUES = [\n  \"item\",\n  \"history\",\n  \"relationship\",\n  \"json\",\n] as const;\n/** Restricts merge driver artifact values accepted by command, SDK, and storage contracts. */\nexport type MergeDriverArtifact = (typeof MERGE_DRIVER_ARTIFACT_VALUES)[number];\n\n/** Documents the merge driver options payload exchanged by command, SDK, and package integrations. */\nexport interface MergeDriverOptions {\n  /** Artifact class being merged: item document, history JSONL stream, relationship event JSONL store, or key-level JSON config. */\n  artifact: string;\n  /** Path to the common-ancestor version (git %O). */\n  basePath: string;\n  /** Path to the current-branch version (git %A); also the default output path per the git merge-driver protocol. */\n  oursPath: string;\n  /** Path to the other-branch version (git %B). */\n  theirsPath: string;\n  /** Optional explicit output path overriding the git default of writing to the ours path. */\n  outputPath?: string;\n  /** Original repository-relative item path supplied by Git as `%P`, used to detect item format when temporary side paths lack extensions. */\n  itemPath?: string;\n  /** Side that wins unresolvable conflicts (default \"ours\"). */\n  prefer?: string;\n}\n\n/** Documents the merge driver result payload exchanged by command, SDK, and package integrations. */\nexport interface MergeDriverResult {\n  /** Whether the merge completed without unresolvable conflicts. */\n  ok: boolean;\n  /** Artifact class that was merged. */\n  artifact: MergeDriverArtifact;\n  /** Path the merged content was written to. */\n  output_path: string;\n  /** Side unresolvable conflicts were resolved toward. */\n  preferred: MergePreferredSide;\n  /** Unresolvable conflict labels: metadata field names (item), dotted key paths (json). Empty for history merges. */\n  conflicts: string[];\n  /** History-merge strategy and entry accounting; present only for the history artifact. */\n  history?: {\n    strategy: string;\n    common_entries: number;\n    entries_from_ours: number;\n    entries_from_theirs: number;\n    entries_total: number;\n    reanchored: boolean;\n  };\n  /** Relationship-event-merge strategy and accounting; present only for the relationship artifact. */\n  relationship?: {\n    strategy: string;\n    common_entries: number;\n    entries_from_ours: number;\n    entries_from_theirs: number;\n    entries_total: number;\n    reanchored: boolean;\n  };\n  /** Item-merge field accounting; present only for the item artifact. */\n  item?: {\n    fields_from_theirs: string[];\n    union_fields: string[];\n  };\n  /** JSON-merge key accounting; present only for the json artifact. */\n  json?: {\n    paths_from_theirs: string[];\n  };\n  /** Guidance for resolving remaining conflicts or verifying the merged workspace. */\n  guidance: string[];\n  /** ISO 8601 timestamp recording when generated occurred. */\n  generated_at: string;\n}\n\nfunction resolveArtifact(value: string): MergeDriverArtifact {\n  const normalized = value.trim().toLowerCase();\n  if (\n    (MERGE_DRIVER_ARTIFACT_VALUES as readonly string[]).includes(normalized)\n  ) {\n    return normalized as MergeDriverArtifact;\n  }\n  throw new PmCliError(\n    `Unknown merge artifact \"${value}\". Supported values: ${MERGE_DRIVER_ARTIFACT_VALUES.join(\", \")}.`,\n    EXIT_CODE.USAGE,\n  );\n}\n\nfunction resolvePreferredSide(value: string | undefined): MergePreferredSide {\n  if (value === undefined) {\n    return \"ours\";\n  }\n  const normalized = value.trim().toLowerCase();\n  if (normalized === \"ours\" || normalized === \"theirs\") {\n    return normalized;\n  }\n  throw new PmCliError(\n    `Unknown --prefer value \"${value}\". Supported values: ours, theirs.`,\n    EXIT_CODE.USAGE,\n  );\n}\n\nasync function readSideFile(filePath: string, label: string): Promise<string> {\n  try {\n    return await readFile(filePath, \"utf8\");\n  } catch {\n    throw new PmCliError(\n      `Cannot read merge ${label} file at ${filePath}.`,\n      EXIT_CODE.NOT_FOUND,\n    );\n  }\n}\n\n/**\n * Load the workspace settings when a tracker is initialized at the resolved pm\n * root, or fall back to format defaults when the driver runs outside a tracker\n * (git can invoke merge drivers before `pm init`, e.g. while rebasing the\n * commit that introduces the tracker).\n */\nasync function loadOptionalSettings(\n  global: GlobalOptions,\n): Promise<PmSettings | null> {\n  const pmRoot = resolvePmRoot(process.cwd(), global.path);\n  if (!(await pathExists(getSettingsPath(pmRoot)))) {\n    return null;\n  }\n  return readSettings(pmRoot);\n}\n\nfunction itemFormatForPath(\n  filePath: string,\n  settings: PmSettings | null,\n): ItemFormat {\n  if (filePath.endsWith(\".md\")) {\n    return \"json_markdown\";\n  }\n  if (filePath.endsWith(\".toon\")) {\n    return \"toon\";\n  }\n  return settings?.item_format ?? \"toon\";\n}\n\n/**\n * Execute one git merge-driver invocation for a tracker artifact. Reads the\n * three per-side versions, applies the artifact's field-aware merge semantics,\n * writes the merged content (parseable even when conflicted) to the output\n * path, and reports remaining conflicts so the CLI can exit non-zero and let\n * git mark the path unmerged.\n */\nexport async function runMergeDriver(\n  options: MergeDriverOptions,\n  global: GlobalOptions,\n): Promise<MergeDriverResult> {\n  const artifact = resolveArtifact(options.artifact);\n  const preferred = resolvePreferredSide(options.prefer);\n  const outputPath = path.resolve(options.outputPath ?? options.oursPath);\n  const [baseRaw, oursRaw, theirsRaw] = await Promise.all([\n    readSideFile(options.basePath, \"base\"),\n    readSideFile(options.oursPath, \"ours\"),\n    readSideFile(options.theirsPath, \"theirs\"),\n  ]);\n\n  let merged: string;\n  const conflicts: string[] = [];\n  const result: Partial<MergeDriverResult> = {};\n  if (artifact === \"history\") {\n    const historyMerge = mergeHistoryStreams(baseRaw, oursRaw, theirsRaw);\n    merged = historyMerge.merged;\n    result.history = {\n      strategy: historyMerge.strategy,\n      common_entries: historyMerge.common_entries,\n      entries_from_ours: historyMerge.entries_from_ours,\n      entries_from_theirs: historyMerge.entries_from_theirs,\n      entries_total: historyMerge.entries_total,\n      reanchored: historyMerge.reanchored,\n    };\n  } else if (artifact === \"relationship\") {\n    const relationshipMerge = mergeRelationshipEventStreams(\n      baseRaw,\n      oursRaw,\n      theirsRaw,\n    );\n    merged = relationshipMerge.merged;\n    result.relationship = {\n      strategy: relationshipMerge.strategy,\n      common_entries: relationshipMerge.common_entries,\n      entries_from_ours: relationshipMerge.entries_from_ours,\n      entries_from_theirs: relationshipMerge.entries_from_theirs,\n      entries_total: relationshipMerge.entries_total,\n      reanchored: relationshipMerge.reanchored,\n    };\n  } else if (artifact === \"item\") {\n    const settings = await loadOptionalSettings(global);\n    const itemMerge = mergeItemDocuments(baseRaw, oursRaw, theirsRaw, {\n      format: itemFormatForPath(options.itemPath ?? outputPath, settings),\n      schema: settings?.schema,\n      extensionFieldNames: collectRegisteredItemFieldNames(\n        getActiveExtensionRegistrations(),\n      ),\n      preferred,\n    });\n    merged = itemMerge.merged;\n    conflicts.push(...itemMerge.conflict_fields);\n    result.item = {\n      fields_from_theirs: itemMerge.fields_from_theirs,\n      union_fields: itemMerge.union_fields,\n    };\n  } else {\n    const jsonMerge = mergeJsonDocuments(baseRaw, oursRaw, theirsRaw, {\n      preferred,\n    });\n    merged = jsonMerge.merged;\n    conflicts.push(...jsonMerge.conflict_paths);\n    result.json = {\n      paths_from_theirs: jsonMerge.paths_from_theirs,\n    };\n  }\n\n  await writeFile(outputPath, merged, \"utf8\");\n  const guidance: string[] = [];\n  if (conflicts.length > 0) {\n    guidance.push(\n      `Both branches changed ${conflicts.join(\", \")}; the ${preferred} value was kept. Review the merged file, re-apply the losing change if needed, then \"git add\" it.`,\n    );\n  }\n  if (artifact === \"history\" && result.history?.reanchored) {\n    guidance.push(\n      'The merged history chain was re-anchored. Run \"pm validate --check-history-drift\" and \"pm history-repair --all\" after the merge to reconcile item state with merged history.',\n    );\n  }\n  return {\n    ok: conflicts.length === 0,\n    artifact,\n    output_path: outputPath,\n    preferred,\n    conflicts,\n    ...result,\n    guidance,\n    generated_at: nowIso(),\n  };\n}\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2DA,SAAS,kBAAkB,KAAa,OAAa;AACnD,QAAM,iBAAiB,6BAA6B,GAAG;AACvD,MAAI,gBAAgB;AAClB,UAAM,IAAI,WACR,wBAAwB,KAAK,kDAAkD,eAAe,IAAI,yDAClG,UAAU,eAAe;EAE7B;AACA,QAAM,UAA0B,CAAA;AAChC,aAAW,CAAC,OAAO,OAAO,KAAK,IAAI,MAAM,OAAO,EAAE,QAAO,GAAI;AAC3D,UAAM,OAAO,QAAQ,KAAI;AACzB,QAAI,CAAC,MAAM;AACT;IACF;AACA,QAAI;AACF,YAAM,SAAS,KAAK,MAAM,IAAI;AAC9B,UAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,MAAM,QAAQ,MAAM,GAAG;AAC1E,cAAM,IAAI,UAAU,iCAAiC;MACvD;AACA,cAAQ,KAAK,MAAsB;IACrC,QAAQ;AACN,YAAM,IAAI,WACR,wBAAwB,KAAK,mCAAmC,QAAQ,CAAC,KACzE,UAAU,eAAe;IAE7B;EACF;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,OAAmB;AAC/C,SAAO,gBAAgB;IACrB,IAAI,MAAM;IACV,QAAQ,MAAM;IACd,IAAI,MAAM;IACV,OAAO,MAAM;IACb,SAAS,MAAM,WAAW;GAC3B;AACH;AAEA,SAAS,0BACP,MACA,QAAsB;AAEtB,QAAM,QAAQ,KAAK,IAAI,KAAK,QAAQ,OAAO,MAAM;AACjD,MAAI,SAAS;AACb,SACE,SAAS,SACT,qBAAqB,KAAK,MAAM,CAAC,MAAM,qBAAqB,OAAO,MAAM,CAAC,GAC1E;AACA,cAAU;EACZ;AACA,SAAO;AACT;AAYM,SAAU,oBACd,SACA,SACA,WAAiB;AAEjB,oBAAkB,SAAS,MAAM;AACjC,QAAM,OAAO,kBAAkB,SAAS,MAAM;AAC9C,QAAM,SAAS,kBAAkB,WAAW,QAAQ;AACpD,QAAM,SAAS,0BAA0B,MAAM,MAAM;AAErD,MAAI,WAAW,KAAK,UAAU,WAAW,OAAO,QAAQ;AACtD,WAAO;MACL,QAAQ,oBAAoB,IAAI;MAChC,UAAU;MACV,gBAAgB;MAChB,mBAAmB;MACnB,qBAAqB;MACrB,eAAe,KAAK;MACpB,YAAY;;EAEhB;AACA,MAAI,WAAW,OAAO,QAAQ;AAC5B,WAAO;MACL,QAAQ,oBAAoB,IAAI;MAChC,UAAU;MACV,gBAAgB;MAChB,mBAAmB,KAAK,SAAS;MACjC,qBAAqB;MACrB,eAAe,KAAK;MACpB,YAAY;;EAEhB;AACA,MAAI,WAAW,KAAK,QAAQ;AAC1B,WAAO;MACL,QAAQ,oBAAoB,MAAM;MAClC,UAAU;MACV,gBAAgB;MAChB,mBAAmB;MACnB,qBAAqB,OAAO,SAAS;MACrC,eAAe,OAAO;MACtB,YAAY;;EAEhB;AAEA,QAAM,aAAa,KAAK,MAAM,MAAM;AACpC,QAAM,iBAAiB,IAAI,IAAI,WAAW,IAAI,oBAAoB,CAAC;AACnE,QAAM,eAAe,OAClB,MAAM,MAAM,EACZ,OAAO,CAAC,UAAU,CAAC,eAAe,IAAI,qBAAqB,KAAK,CAAC,CAAC;AACrE,QAAM,eAAe,CAAC,GAAG,YAAY,GAAG,YAAY,EAAE,KAAK,CAAC,MAAM,UAAS;AACzE,UAAM,OAAO,wBAAwB,KAAK,IAAI,MAAM,EAAE;AACtD,QAAI,SAAS,GAAG;AACd,aAAO;IACT;AACA,UAAM,eAAe,eAAe,IAAI,qBAAqB,IAAI,CAAC;AAClE,UAAM,gBAAgB,eAAe,IAAI,qBAAqB,KAAK,CAAC;AACpE,QAAI,iBAAiB,eAAe;AAClC,aAAO,OAAO,aAAa,IAAI,OAAO,YAAY;IACpD;AACA,WAAO,qBAAqB,IAAI,EAAE,cAAc,qBAAqB,KAAK,CAAC;EAC7E,CAAC;AACD,QAAM,aAAa,uBAAuB;IACxC,GAAG,KAAK,MAAM,GAAG,MAAM;IACvB,GAAG;GACJ;AACD,SAAO;IACL,QAAQ,oBAAoB,WAAW,OAAO;IAC9C,UAAU;IACV,gBAAgB;IAChB,mBAAmB,WAAW;IAC9B,qBAAqB,aAAa;IAClC,eAAe,WAAW,QAAQ;IAClC,YAAY;;AAEhB;AA+BA,SAAS,uBACP,KACA,OAAa;AAEb,QAAM,iBAAiB,6BAA6B,GAAG;AACvD,MAAI,gBAAgB;AAClB,UAAM,IAAI,WACR,6BAA6B,KAAK,kDAAkD,eAAe,IAAI,yDACvG,UAAU,eAAe;EAE7B;AACA,QAAM,SAAoC,CAAA;AAC1C,aAAW,CAAC,OAAO,OAAO,KAAK,IAAI,MAAM,OAAO,EAAE,QAAO,GAAI;AAC3D,UAAM,OAAO,QAAQ,KAAI;AACzB,QAAI,CAAC,MAAM;AACT;IACF;AACA,QAAI;AACJ,QAAI;AACF,eAAS,KAAK,MAAM,IAAI;IAC1B,QAAQ;AACN,YAAM,IAAI,WACR,6BAA6B,KAAK,mCAAmC,QAAQ,CAAC,KAC9E,UAAU,eAAe;IAE7B;AACA,QACE,OAAO,WAAW,YAClB,WAAW,QACX,MAAM,QAAQ,MAAM,KACpB,OAAQ,OAAiC,YAAY,YACrD,OAAQ,OAAkC,aAAa,UACvD;AACA,YAAM,IAAI,WACR,6BAA6B,KAAK,UAAU,QAAQ,CAAC,+DACrD,UAAU,eAAe;IAE7B;AACA,WAAO,KAAK,MAAiC;EAC/C;AACA,SAAO;AACT;AAEA,SAAS,wBAAwB,QAAiC;AAChE,SAAO,OAAO,WAAW,IACrB,KACA,GAAG,OAAO,IAAI,CAAC,UAAU,KAAK,UAAU,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC;;AAChE;AAEA,SAAS,2BACP,QAAiC;AAEjC,SAAO,OAAO,IAAI,CAAC,OAAO,WAAW,EAAE,GAAG,OAAO,UAAU,QAAQ,EAAC,EAAG;AACzE;AAWM,SAAU,8BACd,SACA,SACA,WAAiB;AAEjB,yBAAuB,SAAS,MAAM;AACtC,QAAM,OAAO,uBAAuB,SAAS,MAAM;AACnD,QAAM,SAAS,uBAAuB,WAAW,QAAQ;AACzD,QAAM,QAAQ,KAAK,IAAI,KAAK,QAAQ,OAAO,MAAM;AACjD,MAAI,SAAS;AACb,SAAO,SAAS,SAAS,KAAK,MAAM,EAAE,YAAY,OAAO,MAAM,EAAE,SAAS;AACxE,cAAU;EACZ;AAEA,MAAI,WAAW,KAAK,UAAU,WAAW,OAAO,QAAQ;AACtD,WAAO;MACL,QAAQ,wBAAwB,IAAI;MACpC,UAAU;MACV,gBAAgB;MAChB,mBAAmB;MACnB,qBAAqB;MACrB,eAAe,KAAK;MACpB,YAAY;;EAEhB;AACA,MAAI,WAAW,OAAO,QAAQ;AAC5B,WAAO;MACL,QAAQ,wBAAwB,IAAI;MACpC,UAAU;MACV,gBAAgB;MAChB,mBAAmB,KAAK,SAAS;MACjC,qBAAqB;MACrB,eAAe,KAAK;MACpB,YAAY;;EAEhB;AACA,MAAI,WAAW,KAAK,QAAQ;AAC1B,WAAO;MACL,QAAQ,wBAAwB,MAAM;MACtC,UAAU;MACV,gBAAgB;MAChB,mBAAmB;MACnB,qBAAqB,OAAO,SAAS;MACrC,eAAe,OAAO;MACtB,YAAY;;EAEhB;AAEA,QAAM,aAAa,KAAK,MAAM,MAAM;AACpC,QAAM,eAAe,IAAI,IAAI,WAAW,IAAI,CAAC,UAAU,MAAM,OAAO,CAAC;AACrE,QAAM,eAAe,OAClB,MAAM,MAAM,EACZ,OAAO,CAAC,UAAU,CAAC,aAAa,IAAI,MAAM,OAAO,CAAC;AACrD,QAAM,eAAe,CAAC,GAAG,YAAY,GAAG,YAAY,EAAE,KAAK,CAAC,MAAM,UAAS;AACzE,QAAI,KAAK,cAAc,UAAa,MAAM,cAAc,QAAW;AACjE,YAAM,OAAO,wBAAwB,KAAK,WAAW,MAAM,SAAS;AACpE,UAAI,SAAS,GAAG;AACd,eAAO;MACT;IACF,WAAW,KAAK,cAAc,UAAa,MAAM,cAAc,QAAW;AACxE,aAAO;IACT,WAAW,KAAK,cAAc,QAAW;AACvC,aAAO;IACT;AACA,UAAM,eAAe,aAAa,IAAI,KAAK,OAAO;AAClD,UAAM,gBAAgB,aAAa,IAAI,MAAM,OAAO;AACpD,QAAI,iBAAiB,eAAe;AAClC,aAAO,OAAO,aAAa,IAAI,OAAO,YAAY;IACpD;AAGA,WAAO;EACT,CAAC;AACD,QAAM,SAAS,2BAA2B;IACxC,GAAG,KAAK,MAAM,GAAG,MAAM;IACvB,GAAG;GACJ;AACD,SAAO;IACL,QAAQ,wBAAwB,MAAM;IACtC,UAAU;IACV,gBAAgB;IAChB,mBAAmB,WAAW;IAC9B,qBAAqB,aAAa;IAClC,eAAe,OAAO;IACtB,YAAY;;AAEhB;AAYO,IAAM,+BAA+B;EAC1C;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;AAIK,IAAM,+BAA+B,CAAC,YAAY;AAgBzD,SAAS,WAAW,MAAe,OAAc;AAC/C,SAAO,gBAAgB,QAAQ,IAAI,MAAM,gBAAgB,SAAS,IAAI;AACxE;AAEA,SAAS,gBACP,MACA,MACA,QAAe;AAEf,QAAM,YAAY,CAAC,UACjB,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAA;AACjC,QAAM,UAAU,IAAI,IAAI,UAAU,IAAI,EAAE,IAAI,CAAC,UAAU,gBAAgB,KAAK,CAAC,CAAC;AAC9E,QAAM,cAAc,UAAU,IAAI;AAClC,QAAM,UAAU,IAAI,IAAI,YAAY,IAAI,CAAC,UAAU,gBAAgB,KAAK,CAAC,CAAC;AAC1E,QAAM,gBAAgB,UAAU,MAAM;AACtC,QAAM,YAAY,IAAI,IACpB,cAAc,IAAI,CAAC,UAAU,gBAAgB,KAAK,CAAC,CAAC;AAEtD,QAAM,SAAS,YAAY,OAAO,CAAC,UAAS;AAC1C,UAAM,WAAW,gBAAgB,KAAK;AAGtC,WAAO,CAAC,QAAQ,IAAI,QAAQ,KAAK,UAAU,IAAI,QAAQ;EACzD,CAAC;AACD,aAAW,SAAS,eAAe;AACjC,UAAM,WAAW,gBAAgB,KAAK;AACtC,QAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,CAAC,QAAQ,IAAI,QAAQ,GAAG;AACpD,aAAO,KAAK,KAAK;IACnB;EACF;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,MAAe,QAAe;AACrD,SAAO,wBAAwB,OAAO,IAAI,GAAG,OAAO,MAAM,CAAC,KAAK,IAC5D,OACA;AACN;AAQA,SAAS,oBACP,MACA,MACA,QACA,WAA6B;AAE7B,MAAI,WAAW,MAAM,MAAM,GAAG;AAC5B,WAAO,EAAE,OAAO,MAAM,aAAa,OAAO,UAAU,MAAK;EAC3D;AACA,MAAI,WAAW,MAAM,IAAI,GAAG;AAC1B,WAAO,EAAE,OAAO,QAAQ,aAAa,MAAM,UAAU,MAAK;EAC5D;AACA,MAAI,WAAW,MAAM,MAAM,GAAG;AAC5B,WAAO,EAAE,OAAO,MAAM,aAAa,OAAO,UAAU,MAAK;EAC3D;AACA,SAAO;IACL,OAAO,cAAc,WAAW,SAAS;IACzC,aAAa,cAAc;IAC3B,UAAU;;AAEd;AAEA,SAAS,iBAAiB,UAAsB;AAC9C,SAAO,EAAE,GAAI,SAAS,SAA+C;AACvE;AAEA,SAAS,mBACP,KACA,OACA,SAAkC;AAElC,MAAI;AACF,WAAO,kBAAkB,kBAAkB,KAAK,OAAO,GAAG,OAAO;EACnE,SAAS,OAAO;AACd,UAAM,IAAI,WACR,qBAAqB,KAAK,sCAAsC,OAAO,KAAK,CAAC,IAC7E,UAAU,eAAe;EAE7B;AACF;AAaA,SAAS,yBACP,YACA,YACA,cACA,WAA6B;AAE7B,QAAM,gBAAgB,IAAI,IAAY,4BAA4B;AAClE,QAAM,iBAAiB,IAAI,IAAY,4BAA4B;AACnE,QAAM,aAAa;IACjB,GAAG,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,UAAU,GAAG,GAAG,OAAO,KAAK,YAAY,CAAC,CAAC;IACrE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACjD,QAAM,cAA4C;IAChD,QAAQ,CAAA;IACR,gBAAgB,CAAA;IAChB,kBAAkB,CAAA;IAClB,aAAa,CAAA;;AAGf,aAAW,SAAS,YAAY;AAC9B,UAAM,YAAY,WAAW,KAAK;AAClC,UAAM,YAAY,WAAW,KAAK;AAClC,UAAM,cAAc,aAAa,KAAK;AACtC,QAAI,cAAc,IAAI,KAAK,GAAG;AAC5B,YAAM,QAAQ,gBAAgB,WAAW,WAAW,WAAW;AAI/D,kBAAY,OAAO,KAAK,IAAI;AAC5B,UAAI,CAAC,WAAW,OAAO,SAAS,GAAG;AACjC,oBAAY,YAAY,KAAK,KAAK;MACpC;AACA;IACF;AACA,QAAI,eAAe,IAAI,KAAK,GAAG;AAC7B,kBAAY,OAAO,KAAK,IAAI,gBAAgB,WAAW,WAAW;AAClE;IACF;AACA,UAAM,UAAU,oBACd,WACA,WACA,aACA,SAAS;AAEX,QAAI,QAAQ,UAAU,QAAW;AAC/B,kBAAY,OAAO,KAAK,IAAI,QAAQ;IACtC;AACA,QAAI,QAAQ,UAAU;AACpB,kBAAY,eAAe,KAAK,KAAK;IACvC,WAAW,QAAQ,aAAa;AAC9B,kBAAY,iBAAiB,KAAK,KAAK;IACzC;EACF;AACA,SAAO;AACT;AAcM,SAAU,mBACd,SACA,SACA,WACA,UAGI,CAAA,GAAE;AAEN,QAAM,YAAgC,QAAQ,aAAa;AAI3D,QAAM,UAAU,QAAQ,KAAI,EAAG,SAAS;AACxC,QAAM,OAAO,mBAAmB,SAAS,QAAQ,OAAO;AACxD,QAAM,SAAS,mBAAmB,WAAW,UAAU,OAAO;AAC9D,QAAM,OAAO,UAAU,mBAAmB,SAAS,QAAQ,OAAO,IAAI;AAEtE,QAAM,aAAa,UACf,iBAAiB,IAAI,IACpB,CAAA;AACL,QAAM,aAAa,iBAAiB,IAAI;AACxC,QAAM,eAAe,iBAAiB,MAAM;AAC5C,QAAM,EAAE,QAAQ,gBAAgB,kBAAkB,YAAW,IAC3D,yBAAyB,YAAY,YAAY,cAAc,SAAS;AAE1E,QAAM,cAAc,oBAClB,UAAU,KAAK,OAAO,IACtB,KAAK,MACL,OAAO,MACP,SAAS;AAEX,MAAI,YAAY,UAAU;AACxB,mBAAe,KAAK,MAAM;EAC5B,WAAW,YAAY,aAAa;AAClC,qBAAiB,KAAK,MAAM;EAC9B;AAEA,QAAM,YAAY,sBAChB;IACE,UAAU;IACV,MAAM,YAAY;KAEpB,OAAO;AAET,SAAO;IACL,QAAQ;IACR,iBAAiB;IACjB,oBAAoB;IACpB,cAAc;IACd;;AAEJ;AAcA,SAAS,cAAc,OAAc;AACnC,SACE,OAAO,UAAU,YACjB,UAAU,QACV,CAAC,MAAM,QAAQ,KAAK;AAExB;AAEA,SAAS,cAAc,KAAa,OAAa;AAC/C,QAAM,iBAAiB,6BAA6B,GAAG;AACvD,MAAI,gBAAgB;AAClB,UAAM,IAAI,WACR,qBAAqB,KAAK,kDAAkD,eAAe,IAAI,KAC/F,UAAU,eAAe;EAE7B;AACA,MAAI,IAAI,KAAI,EAAG,WAAW,GAAG;AAC3B,WAAO;EACT;AACA,MAAI;AACF,WAAO,KAAK,MAAM,GAAG;EACvB,QAAQ;AACN,UAAM,IAAI,WACR,qBAAqB,KAAK,wBAC1B,UAAU,eAAe;EAE7B;AACF;AAEA,SAAS,eACP,MACA,MACA,QACA,WACA,YACA,eACA,iBAAyB;AAEzB,MAAI,WAAW,MAAM,MAAM,GAAG;AAC5B,WAAO;EACT;AACA,MAAI,cAAc,IAAI,KAAK,cAAc,MAAM,GAAG;AAChD,UAAM,aAAa,cAAc,IAAI,IAAI,OAAO,CAAA;AAChD,UAAM,SAAkC,CAAA;AACxC,UAAM,OAAO;MACX,GAAG,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,IAAI,GAAG,GAAG,OAAO,KAAK,MAAM,CAAC,CAAC;MACzD,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACjD,eAAW,OAAO,MAAM;AACtB,YAAM,YAAY,WAAW,SAAS,IAAI,GAAG,UAAU,IAAI,GAAG,KAAK;AACnE,YAAM,QAAQ,aACZ,YACA,MACA,QACA,KACA,WACA,WACA,eACA,eAAe;AAEjB,UAAI,UAAU,QAAW;AACvB,eAAO,GAAG,IAAI;MAChB;IACF;AACA,WAAO;EACT;AACA,QAAM,UAAU,oBAAoB,MAAM,MAAM,QAAQ,SAAS;AACjE,MAAI,QAAQ,UAAU;AACpB,kBAAc,KAAK,UAAU;EAC/B,WAAW,QAAQ,aAAa;AAC9B,oBAAgB,KAAK,UAAU;EACjC;AACA,SAAO,QAAQ;AACjB;AAEA,SAAS,aACP,MACA,MACA,QACA,KACA,WACA,WACA,eACA,iBAAyB;AAEzB,QAAM,SAAS,OAAO,UAAU,eAAe,KAAK,MAAM,GAAG;AAC7D,QAAM,WAAW,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG;AACjE,QAAM,SAAS,OAAO,UAAU,eAAe,KAAK,MAAM,GAAG;AAC7D,MAAI,UAAU,UAAU;AACtB,WAAO,eACL,KAAK,GAAG,GACR,KAAK,GAAG,GACR,OAAO,GAAG,GACV,WACA,WACA,eACA,eAAe;EAEnB;AACA,MAAI,QAAQ;AAGV,QAAI,UAAU,WAAW,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC,GAAG;AAC9C,sBAAgB,KAAK,SAAS;AAC9B,aAAO;IACT;AACA,QAAI,QAAQ;AACV,oBAAc,KAAK,SAAS;AAC5B,aAAO,cAAc,WAAW,SAAY,KAAK,GAAG;IACtD;AACA,WAAO,KAAK,GAAG;EACjB;AAEA,MAAI,UAAU,WAAW,KAAK,GAAG,GAAG,OAAO,GAAG,CAAC,GAAG;AAChD,WAAO;EACT;AACA,MAAI,QAAQ;AACV,kBAAc,KAAK,SAAS;AAC5B,WAAO,cAAc,WAAW,OAAO,GAAG,IAAI;EAChD;AACA,kBAAgB,KAAK,SAAS;AAC9B,SAAO,OAAO,GAAG;AACnB;AAWM,SAAU,mBACd,SACA,SACA,WACA,UAGI,CAAA,GAAE;AAEN,QAAM,YAAgC,QAAQ,aAAa;AAC3D,QAAM,OAAO,cAAc,SAAS,MAAM;AAC1C,QAAM,OAAO,cAAc,SAAS,MAAM;AAC1C,QAAM,SAAS,cAAc,WAAW,QAAQ;AAChD,QAAM,gBAA0B,CAAA;AAChC,QAAM,kBAA4B,CAAA;AAClC,QAAM,SAAS,eACb,MACA,MACA,QACA,WACA,IACA,eACA,eAAe;AAEjB,SAAO;IACL,QAAQ,GAAG,KAAK,UAAU,UAAU,MAAM,MAAM,CAAC,CAAC;;IAClD,gBAAgB;IAChB,mBAAmB;IACnB;;AAEJ;;;ACpyBA,SAAS,UAAU,iBAAiB;AACpC,OAAO,UAAU;;;;;;;;AAoBV,IAAM,+BAA+B;EAC1C;EACA;EACA;EACA;;AAoEF,SAAS,gBAAgB,OAAa;AACpC,QAAM,aAAa,MAAM,KAAI,EAAG,YAAW;AAC3C,MACG,6BAAmD,SAAS,UAAU,GACvE;AACA,WAAO;EACT;AACA,QAAM,IAAI,WACR,2BAA2B,KAAK,wBAAwB,6BAA6B,KAAK,IAAI,CAAC,KAC/F,UAAU,KAAK;AAEnB;AAEA,SAAS,qBAAqB,OAAyB;AACrD,MAAI,UAAU,QAAW;AACvB,WAAO;EACT;AACA,QAAM,aAAa,MAAM,KAAI,EAAG,YAAW;AAC3C,MAAI,eAAe,UAAU,eAAe,UAAU;AACpD,WAAO;EACT;AACA,QAAM,IAAI,WACR,2BAA2B,KAAK,sCAChC,UAAU,KAAK;AAEnB;AAEA,eAAe,aAAa,UAAkB,OAAa;AACzD,MAAI;AACF,WAAO,MAAM,SAAS,UAAU,MAAM;EACxC,QAAQ;AACN,UAAM,IAAI,WACR,qBAAqB,KAAK,YAAY,QAAQ,KAC9C,UAAU,SAAS;EAEvB;AACF;AAQA,eAAe,qBACbA,SAAqB;AAErB,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAIA,QAAO,IAAI;AACvD,MAAI,CAAE,MAAM,WAAW,gBAAgB,MAAM,CAAC,GAAI;AAChD,WAAO;EACT;AACA,SAAO,aAAa,MAAM;AAC5B;AAEA,SAAS,kBACP,UACA,UAA2B;AAE3B,MAAI,SAAS,SAAS,KAAK,GAAG;AAC5B,WAAO;EACT;AACA,MAAI,SAAS,SAAS,OAAO,GAAG;AAC9B,WAAO;EACT;AACA,SAAO,UAAU,eAAe;AAClC;AASA,eAAsB,eACpB,SACAA,SAAqB;AAErB,QAAM,WAAW,gBAAgB,QAAQ,QAAQ;AACjD,QAAM,YAAY,qBAAqB,QAAQ,MAAM;AACrD,QAAM,aAAa,KAAK,QAAQ,QAAQ,cAAc,QAAQ,QAAQ;AACtE,QAAM,CAAC,SAAS,SAAS,SAAS,IAAI,MAAM,QAAQ,IAAI;IACtD,aAAa,QAAQ,UAAU,MAAM;IACrC,aAAa,QAAQ,UAAU,MAAM;IACrC,aAAa,QAAQ,YAAY,QAAQ;GAC1C;AAED,MAAI;AACJ,QAAM,YAAsB,CAAA;AAC5B,QAAM,SAAqC,CAAA;AAC3C,MAAI,aAAa,WAAW;AAC1B,UAAM,eAAe,oBAAoB,SAAS,SAAS,SAAS;AACpE,aAAS,aAAa;AACtB,WAAO,UAAU;MACf,UAAU,aAAa;MACvB,gBAAgB,aAAa;MAC7B,mBAAmB,aAAa;MAChC,qBAAqB,aAAa;MAClC,eAAe,aAAa;MAC5B,YAAY,aAAa;;EAE7B,WAAW,aAAa,gBAAgB;AACtC,UAAM,oBAAoB,8BACxB,SACA,SACA,SAAS;AAEX,aAAS,kBAAkB;AAC3B,WAAO,eAAe;MACpB,UAAU,kBAAkB;MAC5B,gBAAgB,kBAAkB;MAClC,mBAAmB,kBAAkB;MACrC,qBAAqB,kBAAkB;MACvC,eAAe,kBAAkB;MACjC,YAAY,kBAAkB;;EAElC,WAAW,aAAa,QAAQ;AAC9B,UAAM,WAAW,MAAM,qBAAqBA,OAAM;AAClD,UAAM,YAAY,mBAAmB,SAAS,SAAS,WAAW;MAChE,QAAQ,kBAAkB,QAAQ,YAAY,YAAY,QAAQ;MAClE,QAAQ,UAAU;MAClB,qBAAqB,gCACnB,gCAA+B,CAAE;MAEnC;KACD;AACD,aAAS,UAAU;AACnB,cAAU,KAAK,GAAG,UAAU,eAAe;AAC3C,WAAO,OAAO;MACZ,oBAAoB,UAAU;MAC9B,cAAc,UAAU;;EAE5B,OAAO;AACL,UAAM,YAAY,mBAAmB,SAAS,SAAS,WAAW;MAChE;KACD;AACD,aAAS,UAAU;AACnB,cAAU,KAAK,GAAG,UAAU,cAAc;AAC1C,WAAO,OAAO;MACZ,mBAAmB,UAAU;;EAEjC;AAEA,QAAM,UAAU,YAAY,QAAQ,MAAM;AAC1C,QAAM,WAAqB,CAAA;AAC3B,MAAI,UAAU,SAAS,GAAG;AACxB,aAAS,KACP,yBAAyB,UAAU,KAAK,IAAI,CAAC,SAAS,SAAS,mGAAmG;EAEtK;AACA,MAAI,aAAa,aAAa,OAAO,SAAS,YAAY;AACxD,aAAS,KACP,8KAA8K;EAElL;AACA,SAAO;IACL,IAAI,UAAU,WAAW;IACzB;IACA,aAAa;IACb;IACA;IACA,GAAG;IACH;IACA,cAAc,OAAM;;AAExB;A",
-  "names": ["global"]
-}

package/dist/cli-bundle/chunks/chunk-J4FBIFU6.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"sources":["../../../../../../../../core/item/parse.ts"],"sourcesContent":["/**\n * @module core/item/parse\n *\n * Defines item parsing, formatting, and lifecycle helpers for Parse.\n */\nimport { PmCliError } from \"../shared/errors.js\";\nimport { EXIT_CODE } from \"../shared/constants.js\";\n\nconst STDIN_TOKEN = \"-\";\nconst CONTINUABLE_VALUE_KEYS = new Set([\n \"actual_result\",\n \"body\",\n \"cmd\",\n \"command\",\n \"customer_impact\",\n \"description\",\n \"environment\",\n \"expected_result\",\n \"impact\",\n \"location\",\n \"message\",\n \"note\",\n \"outcome\",\n \"repro_steps\",\n \"resolution\",\n \"text\",\n \"title\",\n \"unblock_note\",\n \"value\",\n \"why_now\",\n]);\n\n/** Implements parse tags for the public runtime surface of this module. */\nexport function parseTags(raw: string): string[] {\n const trimmed = raw.trim();\n if (trimmed === \"\") {\n return [];\n }\n const source = coerceJsonTagArray(trimmed) ?? trimmed;\n const tags = source\n .split(\",\")\n .map((tag) => tag.trim())\n .filter(Boolean)\n .map((tag) => tag.toLowerCase());\n return Array.from(new Set(tags)).sort((a, b) => a.localeCompare(b));\n}\n\n/** Merge repeated `--add-tags` / `--remove-tags` values into a single normalized tag list. Each entry can itself be CSV or a JSON array, mirroring the format accepted by `--tags`. Returns a deterministically sorted, deduped list. */\nexport function collectTagFlagValues(\n values: readonly string[] | undefined,\n): string[] {\n if (!Array.isArray(values) || values.length === 0) {\n return [];\n }\n const collected: string[] = [];\n for (const raw of values) {\n if (typeof raw !== \"string\") {\n continue;\n }\n for (const tag of parseTags(raw)) {\n collected.push(tag);\n }\n }\n return Array.from(new Set(collected)).sort((a, b) => a.localeCompare(b));\n}\n\n/** Normalize a base tag list to the canonical form pm stores: trimmed, lowercased, non-empty. Existing item-metadata tags are almost always already canonical (parseTags lowercases on write), but legacy or hand-edited `.toon` files can carry mixed-case entries — normalizing here keeps additive and subtractive mutations case-insensitive (so `--add-tags beta` dedupes against an existing `Beta`, and `--remove-tags alpha` removes an existing `Alpha`). */\nfunction normalizeBaseTags(baseTags: readonly string[]): string[] {\n // Defensive: item-metadata parsed from corrupted/hand-edited `.toon` (or an\n // external SDK caller) could pass a non-array or non-string entries despite\n // the `string[]` type — guard the array and skip non-strings rather than\n // throwing on `.filter`/`.trim()`.\n if (!Array.isArray(baseTags)) {\n return [];\n }\n return baseTags\n .filter((tag): tag is string => typeof tag === \"string\")\n .map((tag) => tag.trim().toLowerCase())\n .filter(Boolean);\n}\n\n/** Split a stored `acceptance_criteria` value into its individual criteria. Criteria are stored as one string joined with `\"; \"` (repeated `--ac` values accumulate that way), so the semicolon is the criterion boundary and cannot appear inside one criterion; entries are trimmed and blanks dropped. Non-string/absent values yield an empty list. */\nexport function splitAcceptanceCriteria(value: unknown): string[] {\n if (typeof value !== \"string\") {\n return [];\n }\n return value\n .split(\";\")\n .map((criterion) => criterion.trim())\n .filter(Boolean);\n}\n\n/** Apply additive/subtractive acceptance-criteria mutations to a base criteria list. Used by `pm update --add-ac/--remove-ac` so individual semicolon-free criteria can be edited without replacing the whole `acceptance_criteria` value (tag-API parity; disjoint additions merge cleanly across branches). Additions append in argv order and dedupe on exact trimmed text; removals match exact trimmed text and report unmatched selectors so a typo never becomes a silent no-op. */\nexport function applyAcceptanceCriteriaMutations(\n baseCriteria: readonly string[],\n add: readonly string[] | undefined,\n remove: readonly string[] | undefined,\n): { criteria: string[]; unmatchedRemovals: string[] } {\n const criteria = baseCriteria\n .map((criterion) => criterion.trim())\n .filter(Boolean);\n for (const raw of add ?? []) {\n const criterion = raw.trim();\n if (criterion.includes(\";\")) {\n throw new PmCliError(\n 'Acceptance criteria added with --add-ac cannot contain \";\" because semicolons delimit stored criteria',\n EXIT_CODE.USAGE,\n {\n code: \"acceptance_criteria_semicolon_forbidden\",\n required: \"Pass one semicolon-free criterion per --add-ac value\",\n why: \"A semicolon inside one criterion would be re-read as multiple criteria\",\n nextSteps: [\n \"Split the text into repeated --add-ac values, or replace the semicolon with punctuation that is not the storage delimiter\",\n ],\n },\n );\n }\n if (criterion.length > 0 && !criteria.includes(criterion)) {\n criteria.push(criterion);\n }\n }\n const unmatchedRemovals: string[] = [];\n let remaining = criteria;\n for (const raw of remove ?? []) {\n const criterion = raw.trim();\n if (criterion.length === 0) {\n continue;\n }\n if (!remaining.includes(criterion)) {\n unmatchedRemovals.push(criterion);\n continue;\n }\n remaining = remaining.filter((entry) => entry !== criterion);\n }\n return { criteria: remaining, unmatchedRemovals };\n}\n\n/** Apply an additive tag mutation to a base tag list. Used by `pm create` and `pm update` so `--add-tags` extends `--tags` (or the existing tags) without replacing them. Output is sorted + deduped lowercase, matching `parseTags`. */\nexport function mergeAdditiveTags(\n baseTags: readonly string[],\n add: readonly string[] | undefined,\n): string[] {\n const normalizedBase = normalizeBaseTags(baseTags);\n if (!add || add.length === 0) {\n return Array.from(new Set(normalizedBase)).sort((a, b) =>\n a.localeCompare(b),\n );\n }\n const merged = new Set<string>(normalizedBase);\n for (const tag of collectTagFlagValues(add)) {\n merged.add(tag);\n }\n return Array.from(merged).sort((a, b) => a.localeCompare(b));\n}\n\n/** Apply a subtractive tag mutation to a base tag list. Used by `pm update` so `--remove-tags x,y` prunes those entries without rewriting the full set. Removal is case-insensitive: both the base list and the removal selectors are normalized to canonical lowercase before matching. */\nexport function applyTagRemovals(\n baseTags: readonly string[],\n remove: readonly string[] | undefined,\n): string[] {\n const normalizedBase = Array.from(new Set(normalizeBaseTags(baseTags))).sort(\n (a, b) => a.localeCompare(b),\n );\n if (!remove || remove.length === 0) {\n return normalizedBase;\n }\n const removeSet = new Set(collectTagFlagValues(remove));\n if (removeSet.size === 0) {\n return normalizedBase;\n }\n return normalizedBase.filter((tag) => !removeSet.has(tag));\n}\n\n// Agents and MCP callers frequently pass --tags as a JSON array (e.g.\n// `--tags '[\"a\",\"b\"]'`). The MCP server normalizes that upstream, but direct\n// CLI invocations used to write the raw bracket string into item metadata,\n// silently corrupting tags. Accept JSON arrays of primitives transparently.\nfunction coerceJsonTagArray(trimmed: string): string | null {\n if (!trimmed.startsWith(\"[\")) {\n return null;\n }\n let parsed: unknown;\n try {\n parsed = JSON.parse(trimmed);\n } catch {\n return null;\n }\n const parsedArray = parsed as unknown[];\n return parsedArray\n .map((entry) =>\n typeof entry === \"string\" ||\n typeof entry === \"number\" ||\n typeof entry === \"boolean\"\n ? String(entry).replace(/,/g, \" \")\n : \"\",\n )\n .filter((entry) => entry.length > 0)\n .join(\",\");\n}\n\nfunction normalizeLineEndings(value: string): string {\n return value.replace(/\\r\\n/g, \"\\n\");\n}\n\nfunction stripCodeFenceEnvelope(value: string): string {\n const normalized = normalizeLineEndings(value).trim();\n if (!normalized.startsWith(\"```\")) {\n return value;\n }\n const lines = normalized.split(\"\\n\");\n if (lines.length < 2) {\n return value;\n }\n if (lines.at(-1)?.trim() !== \"```\") {\n return value;\n }\n return lines.slice(1, -1).join(\"\\n\");\n}\n\nfunction splitCsvSegments(raw: string): string[] {\n const segments: string[] = [];\n let current = \"\";\n let inQuotes = false;\n let escaped = false;\n\n for (const char of raw) {\n if (escaped) {\n current += char;\n escaped = false;\n continue;\n }\n if (char === \"\\\\\") {\n current += char;\n escaped = true;\n continue;\n }\n if (char === '\"') {\n inQuotes = !inQuotes;\n current += char;\n continue;\n }\n if (char === \",\" && !inQuotes) {\n segments.push(current.trim());\n current = \"\";\n continue;\n }\n current += char;\n }\n if (current.trim()) {\n segments.push(current.trim());\n }\n return segments;\n}\n\nfunction unquoteValue(value: string): string {\n const trimmed = value.trim();\n if (trimmed.startsWith('\"') && trimmed.endsWith('\"')) {\n return trimmed.slice(1, -1).replace(/\\\\\"/g, '\"');\n }\n return value;\n}\n\nfunction findKeyValueDelimiter(segment: string): number {\n const equalsIndex = segment.indexOf(\"=\");\n const colonIndex = segment.indexOf(\":\");\n const hasEquals = equalsIndex > 0;\n const hasColon = colonIndex > 0;\n if (hasEquals && hasColon) {\n return Math.min(equalsIndex, colonIndex);\n }\n if (hasEquals) {\n return equalsIndex;\n }\n if (hasColon) {\n return colonIndex;\n }\n return -1;\n}\n\nfunction buildOptionSpecificKvGuidance(\n raw: string,\n optionName: string,\n): string {\n if (optionName === \"--add\" || optionName === \"--add-glob\") {\n const looksLikePath =\n /[./\\\\]/.test(raw) || /\\.[a-z]{1,6}$/i.test(raw.trim());\n if (looksLikePath) {\n return \"For file/doc paths use: path=<file-path>[,scope=project|global]. The scope field is optional and defaults to project (example: path=src/api.ts or path=README.md,scope=project). \";\n }\n }\n if (optionName !== \"--event\") {\n return \"\";\n }\n const lowered = raw.toLowerCase();\n const recurrenceHint =\n lowered.includes(\"recur_\") || lowered.includes(\"recurrence\")\n ? ' Recurrence list values must stay in one field and use \"|\" delimiters (for example recur_by_weekday=mon|wed or recur_by_month_day=1|15).'\n : \"\";\n const weekdayAliasHint = lowered.includes(\"recur_byweekday\")\n ? \" Use recur_by_weekday (with underscores) for weekday recurrence filters.\"\n : \"\";\n return `${recurrenceHint}${weekdayAliasHint}`;\n}\n\nfunction buildInvalidKvMessage(raw: string, optionName: string): string {\n const condensed = raw.replaceAll(/\\s+/g, \" \").trim();\n const preview =\n condensed.length > 160 ? `${condensed.slice(0, 157)}...` : condensed;\n const optionSpecificGuidance = buildOptionSpecificKvGuidance(raw, optionName);\n return (\n `Invalid ${optionName} value \"${preview}\". Expected key=value entries separated by commas. ` +\n optionSpecificGuidance +\n 'Also accepts markdown-style key/value lines (for example \"- path: README.md\"). ' +\n `Use ${optionName} ${STDIN_TOKEN} to read piped stdin input.`\n );\n}\n\nfunction parseMarkdownKeyValueLines(\n raw: string,\n): Record<string, string> | null {\n const normalized = stripCodeFenceEnvelope(raw).trim();\n if (normalized.length === 0) {\n return null;\n }\n if (\n !normalized.includes(\"\\n\") &&\n !normalized.startsWith(\"-\") &&\n !normalized.startsWith(\"*\") &&\n !normalized.startsWith(\"+\")\n ) {\n return null;\n }\n\n const result: Record<string, string> = {};\n let activeKey: string | undefined;\n const lines = normalizeLineEndings(normalized)\n .split(\"\\n\")\n .map((line) => line.trim())\n .filter((line) => line.length > 0);\n\n for (const line of lines) {\n const match = line.match(/^(?:[-*+]\\s+)?([a-zA-Z0-9_.-]+)\\s*(=|:)\\s*(.*)$/);\n if (match) {\n const key = match[1].trim();\n result[key] = unquoteValue(match[3].trim());\n activeKey = key;\n continue;\n }\n if (activeKey && CONTINUABLE_VALUE_KEYS.has(activeKey.toLowerCase())) {\n result[activeKey] = `${result[activeKey]}\\n${line}`;\n continue;\n }\n return null;\n }\n\n return result;\n}\n\n/** Implements parse csv kv for the public runtime surface of this module. */\nexport function parseCsvKv(\n raw: string,\n optionName: string,\n): Record<string, string> {\n const trimmed = stripCodeFenceEnvelope(raw).trim();\n if (!trimmed) {\n throw new PmCliError(`${optionName} cannot be empty`, EXIT_CODE.USAGE);\n }\n\n const markdownStyle = parseMarkdownKeyValueLines(trimmed);\n if (markdownStyle) {\n return markdownStyle;\n }\n\n const result: Record<string, string> = {};\n let activeKey: string | undefined;\n const segments = splitCsvSegments(trimmed);\n\n for (const segment of segments) {\n const delimiterIndex = findKeyValueDelimiter(segment);\n if (delimiterIndex > 0) {\n const key = segment.slice(0, delimiterIndex).trim();\n const value = unquoteValue(segment.slice(delimiterIndex + 1).trim());\n result[key] = value;\n activeKey = key;\n continue;\n }\n if (activeKey && CONTINUABLE_VALUE_KEYS.has(activeKey.toLowerCase())) {\n result[activeKey] = `${result[activeKey]},${segment.trim()}`;\n continue;\n }\n throw new PmCliError(\n buildInvalidKvMessage(raw, optionName),\n EXIT_CODE.USAGE,\n );\n }\n\n return result;\n}\n\nconst WINDOWS_ABSOLUTE_PATH_PATTERN = /^[A-Za-z]:[\\\\/]/;\nconst GENERIC_LEADING_KV_KEY_PATTERN =\n /^(?:[-*+]\\s+)?[A-Za-z_][A-Za-z0-9_.-]*\\s*=/;\n\n/**\n * Detect a CSV/markdown entry that opens with a generic `key=` token even when\n * that key is unknown (e.g. a typo like `lable=main,path=README.md`). Callers\n * combine this with their known-key prefix check so a first-key typo is routed\n * through structured parsing and rejected by {@link assertNoUnknownCsvKeys}\n * (GH-258) instead of being silently swallowed as a bare path/value.\n *\n * Windows absolute paths (`C:\\…`) are excluded so a drive-lettered bare path is\n * never misread as a `C=…` key/value entry.\n */\nexport function looksLikeGenericKeyValueEntry(raw: string): boolean {\n const trimmed = raw.trim();\n if (WINDOWS_ABSOLUTE_PATH_PATTERN.test(trimmed)) {\n return false;\n }\n return GENERIC_LEADING_KV_KEY_PATTERN.test(trimmed);\n}\n\n/**\n * Reject any key in a parsed CSV/markdown key/value map that is not part of the\n * caller's allowed-key contract, mirroring the strict `test --add` behavior\n * (see linked-test-parsers). This closes the cross-command consistency defect\n * (GH-258) where structured link/metadata parsers silently DROPPED typoed keys\n * (e.g. `lable=` instead of `label=`), storing data the author never intended.\n *\n * Comparison is case-insensitive so a key the downstream reader would accept\n * (e.g. `Path`) is never falsely rejected; the emitted \"Allowed keys\" list\n * preserves the canonical casing the caller passes in. Recognized keys are then\n * normalized in-place to their lowercase canonical form so downstream readers\n * (`kv.path`, `kv.id`, `kv.at`, …) see the value even when the input used mixed\n * casing — otherwise `Path=README.md` would pass validation yet read back as an\n * undefined `path` and surface a confusing \"requires path\" error. A key that\n * collides with another after normalization (e.g. `path=a,Path=b`) is rejected.\n *\n * Parsers with an intentional plaintext fallback (`--comment`/`--note`/\n * `--learning`, annotation `--add`) deliberately do NOT call this — there an\n * unrecognized key means \"treat the whole entry as plaintext\", not an error.\n */\nexport function assertNoUnknownCsvKeys(\n kv: Record<string, string>,\n optionName: string,\n allowedKeys: readonly string[],\n): void {\n const allowed = new Set(allowedKeys.map((key) => key.toLowerCase()));\n const unknownKeys = Object.keys(kv).filter(\n (key) => !allowed.has(key.toLowerCase()),\n );\n if (unknownKeys.length > 0) {\n throw new PmCliError(\n `${optionName} does not recognize key${unknownKeys.length > 1 ? \"s\" : \"\"} ${unknownKeys\n .map((key) => `\"${key}\"`)\n .join(\", \")}. Allowed keys: ${allowedKeys.join(\", \")}.`,\n EXIT_CODE.USAGE,\n );\n }\n for (const key of Object.keys(kv)) {\n const normalizedKey = key.toLowerCase();\n if (normalizedKey === key) {\n continue;\n }\n if (Object.hasOwn(kv, normalizedKey)) {\n throw new PmCliError(\n `${optionName} provides key \"${key}\" more than once after case normalization.`,\n EXIT_CODE.USAGE,\n );\n }\n kv[normalizedKey] = kv[key];\n delete kv[key];\n }\n}\n\nasync function readStdinText(optionName: string): Promise<string> {\n if (process.stdin.isTTY === true) {\n throw new PmCliError(\n `${optionName} value \"${STDIN_TOKEN}\" requires piped stdin input. Pipe content into the command, or end manual stdin with Ctrl+D (Unix/macOS) or Ctrl+Z then Enter (Windows).`,\n EXIT_CODE.USAGE,\n );\n }\n process.stdin.setEncoding(\"utf8\");\n return await new Promise<string>((resolve, reject) => {\n let input = \"\";\n process.stdin.on(\"data\", (chunk: string) => {\n input += chunk;\n });\n process.stdin.on(\"end\", () => {\n resolve(normalizeLineEndings(input));\n });\n process.stdin.on(\"error\", (error) => {\n reject(error);\n });\n });\n}\n\n/** Documents the stdin token resolver payload exchanged by command, SDK, and package integrations. */\nexport interface StdinTokenResolver {\n /** Value that configures or reports resolve value for this contract. */\n resolveValue(\n value: string | undefined,\n optionName: string,\n ): Promise<string | undefined>;\n /** Value that configures or reports resolve list for this contract. */\n resolveList(\n values: string[] | undefined,\n optionName: string,\n ): Promise<string[] | undefined>;\n}\n\n/** Implements create stdin token resolver for the public runtime surface of this module. */\nexport function createStdinTokenResolver(): StdinTokenResolver {\n let stdinValuePromise: Promise<string> | undefined;\n let stdinConsumerOption: string | undefined;\n\n const consumeStdin = async (optionName: string): Promise<string> => {\n if (stdinConsumerOption && stdinConsumerOption !== optionName) {\n throw new PmCliError(\n `Only one option may use \"${STDIN_TOKEN}\" stdin token per command invocation. Already used by ${stdinConsumerOption}.`,\n EXIT_CODE.USAGE,\n );\n }\n stdinConsumerOption = optionName;\n if (!stdinValuePromise) {\n stdinValuePromise = readStdinText(optionName);\n }\n return await stdinValuePromise;\n };\n\n const resolveValue = async (\n value: string | undefined,\n optionName: string,\n ): Promise<string | undefined> => {\n if (value === undefined) {\n return undefined;\n }\n if (value.trim() !== STDIN_TOKEN) {\n return value;\n }\n return await consumeStdin(optionName);\n };\n\n const resolveList = async (\n values: string[] | undefined,\n optionName: string,\n ): Promise<string[] | undefined> => {\n if (!values) {\n return undefined;\n }\n const tokenIndexes = values\n .map((entry, index) => (entry.trim() === STDIN_TOKEN ? index : -1))\n .filter((index) => index >= 0);\n if (tokenIndexes.length === 0) {\n return values;\n }\n if (tokenIndexes.length > 1) {\n throw new PmCliError(\n `${optionName} accepts \"${STDIN_TOKEN}\" stdin token at most once per command invocation`,\n EXIT_CODE.USAGE,\n );\n }\n const stdinValue = await consumeStdin(optionName);\n const next = [...values];\n next[tokenIndexes[0]] = stdinValue;\n return next;\n };\n\n return {\n resolveValue,\n resolveList,\n };\n}\n\n/** Implements parse optional number for the public runtime surface of this module. */\nexport function parseOptionalNumber(raw: string, optionName: string): number {\n const value = Number(raw);\n if (!Number.isFinite(value)) {\n throw new PmCliError(\n `Invalid ${optionName} value \"${raw}\"`,\n EXIT_CODE.USAGE,\n );\n }\n return value;\n}\n\n/** Parse a non-negative integer option such as an item duration estimate. */\nexport function parseOptionalNonNegativeInteger(\n raw: string,\n optionName: string,\n): number {\n const trimmed = raw.trim();\n const value = Number(trimmed);\n if (trimmed === \"\" || !Number.isInteger(value) || value < 0) {\n throw new PmCliError(\n `Invalid ${optionName} value \"${raw}\". Expected a non-negative integer.`,\n EXIT_CODE.USAGE,\n );\n }\n return value;\n}\n\n/** Public contract for test only, shared by SDK and presentation-layer consumers. */\nexport const _testOnly = {\n coerceJsonTagArray,\n stripCodeFenceEnvelope,\n parseMarkdownKeyValueLines,\n};\n"],"names":[],"mappings":";;;;;;;;AAQA,IAAM,cAAc;AACpB,IAAM,yBAAyB,oBAAI,IAAI;EACrC;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACD;AAGK,SAAU,UAAU,KAAW;AACnC,QAAM,UAAU,IAAI,KAAI;AACxB,MAAI,YAAY,IAAI;AAClB,WAAO,CAAA;EACT;AACA,QAAM,SAAS,mBAAmB,OAAO,KAAK;AAC9C,QAAM,OAAO,OACV,MAAM,GAAG,EACT,IAAI,CAAC,QAAQ,IAAI,KAAI,CAAE,EACvB,OAAO,OAAO,EACd,IAAI,CAAC,QAAQ,IAAI,YAAW,CAAE;AACjC,SAAO,MAAM,KAAK,IAAI,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC;AACpE;AAGM,SAAU,qBACd,QAAqC;AAErC,MAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW,GAAG;AACjD,WAAO,CAAA;EACT;AACA,QAAM,YAAsB,CAAA;AAC5B,aAAW,OAAO,QAAQ;AACxB,QAAI,OAAO,QAAQ,UAAU;AAC3B;IACF;AACA,eAAW,OAAO,UAAU,GAAG,GAAG;AAChC,gBAAU,KAAK,GAAG;IACpB;EACF;AACA,SAAO,MAAM,KAAK,IAAI,IAAI,SAAS,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC;AACzE;AAGA,SAAS,kBAAkB,UAA2B;AAKpD,MAAI,CAAC,MAAM,QAAQ,QAAQ,GAAG;AAC5B,WAAO,CAAA;EACT;AACA,SAAO,SACJ,OAAO,CAAC,QAAuB,OAAO,QAAQ,QAAQ,EACtD,IAAI,CAAC,QAAQ,IAAI,KAAI,EAAG,YAAW,CAAE,EACrC,OAAO,OAAO;AACnB;AAGM,SAAU,wBAAwB,OAAc;AACpD,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,CAAA;EACT;AACA,SAAO,MACJ,MAAM,GAAG,EACT,IAAI,CAAC,cAAc,UAAU,KAAI,CAAE,EACnC,OAAO,OAAO;AACnB;AAGM,SAAU,iCACd,cACA,KACA,QAAqC;AAErC,QAAM,WAAW,aACd,IAAI,CAAC,cAAc,UAAU,KAAI,CAAE,EACnC,OAAO,OAAO;AACjB,aAAW,OAAO,OAAO,CAAA,GAAI;AAC3B,UAAM,YAAY,IAAI,KAAI;AAC1B,QAAI,UAAU,SAAS,GAAG,GAAG;AAC3B,YAAM,IAAI,WACR,yGACA,UAAU,OACV;QACE,MAAM;QACN,UAAU;QACV,KAAK;QACL,WAAW;UACT;;OAEH;IAEL;AACA,QAAI,UAAU,SAAS,KAAK,CAAC,SAAS,SAAS,SAAS,GAAG;AACzD,eAAS,KAAK,SAAS;IACzB;EACF;AACA,QAAM,oBAA8B,CAAA;AACpC,MAAI,YAAY;AAChB,aAAW,OAAO,UAAU,CAAA,GAAI;AAC9B,UAAM,YAAY,IAAI,KAAI;AAC1B,QAAI,UAAU,WAAW,GAAG;AAC1B;IACF;AACA,QAAI,CAAC,UAAU,SAAS,SAAS,GAAG;AAClC,wBAAkB,KAAK,SAAS;AAChC;IACF;AACA,gBAAY,UAAU,OAAO,CAAC,UAAU,UAAU,SAAS;EAC7D;AACA,SAAO,EAAE,UAAU,WAAW,kBAAiB;AACjD;AAGM,SAAU,kBACd,UACA,KAAkC;AAElC,QAAM,iBAAiB,kBAAkB,QAAQ;AACjD,MAAI,CAAC,OAAO,IAAI,WAAW,GAAG;AAC5B,WAAO,MAAM,KAAK,IAAI,IAAI,cAAc,CAAC,EAAE,KAAK,CAAC,GAAG,MAClD,EAAE,cAAc,CAAC,CAAC;EAEtB;AACA,QAAM,SAAS,IAAI,IAAY,cAAc;AAC7C,aAAW,OAAO,qBAAqB,GAAG,GAAG;AAC3C,WAAO,IAAI,GAAG;EAChB;AACA,SAAO,MAAM,KAAK,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC;AAC7D;AAGM,SAAU,iBACd,UACA,QAAqC;AAErC,QAAM,iBAAiB,MAAM,KAAK,IAAI,IAAI,kBAAkB,QAAQ,CAAC,CAAC,EAAE,KACtE,CAAC,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC;AAE9B,MAAI,CAAC,UAAU,OAAO,WAAW,GAAG;AAClC,WAAO;EACT;AACA,QAAM,YAAY,IAAI,IAAI,qBAAqB,MAAM,CAAC;AACtD,MAAI,UAAU,SAAS,GAAG;AACxB,WAAO;EACT;AACA,SAAO,eAAe,OAAO,CAAC,QAAQ,CAAC,UAAU,IAAI,GAAG,CAAC;AAC3D;AAMA,SAAS,mBAAmB,SAAe;AACzC,MAAI,CAAC,QAAQ,WAAW,GAAG,GAAG;AAC5B,WAAO;EACT;AACA,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,OAAO;EAC7B,QAAQ;AACN,WAAO;EACT;AACA,QAAM,cAAc;AACpB,SAAO,YACJ,IAAI,CAAC,UACJ,OAAO,UAAU,YACjB,OAAO,UAAU,YACjB,OAAO,UAAU,YACb,OAAO,KAAK,EAAE,QAAQ,MAAM,GAAG,IAC/B,EAAE,EAEP,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC,EAClC,KAAK,GAAG;AACb;AAEA,SAAS,qBAAqB,OAAa;AACzC,SAAO,MAAM,QAAQ,SAAS,IAAI;AACpC;AAEA,SAAS,uBAAuB,OAAa;AAC3C,QAAM,aAAa,qBAAqB,KAAK,EAAE,KAAI;AACnD,MAAI,CAAC,WAAW,WAAW,KAAK,GAAG;AACjC,WAAO;EACT;AACA,QAAM,QAAQ,WAAW,MAAM,IAAI;AACnC,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO;EACT;AACA,MAAI,MAAM,GAAG,EAAE,GAAG,KAAI,MAAO,OAAO;AAClC,WAAO;EACT;AACA,SAAO,MAAM,MAAM,GAAG,EAAE,EAAE,KAAK,IAAI;AACrC;AAEA,SAAS,iBAAiB,KAAW;AACnC,QAAM,WAAqB,CAAA;AAC3B,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,UAAU;AAEd,aAAW,QAAQ,KAAK;AACtB,QAAI,SAAS;AACX,iBAAW;AACX,gBAAU;AACV;IACF;AACA,QAAI,SAAS,MAAM;AACjB,iBAAW;AACX,gBAAU;AACV;IACF;AACA,QAAI,SAAS,KAAK;AAChB,iBAAW,CAAC;AACZ,iBAAW;AACX;IACF;AACA,QAAI,SAAS,OAAO,CAAC,UAAU;AAC7B,eAAS,KAAK,QAAQ,KAAI,CAAE;AAC5B,gBAAU;AACV;IACF;AACA,eAAW;EACb;AACA,MAAI,QAAQ,KAAI,GAAI;AAClB,aAAS,KAAK,QAAQ,KAAI,CAAE;EAC9B;AACA,SAAO;AACT;AAEA,SAAS,aAAa,OAAa;AACjC,QAAM,UAAU,MAAM,KAAI;AAC1B,MAAI,QAAQ,WAAW,GAAG,KAAK,QAAQ,SAAS,GAAG,GAAG;AACpD,WAAO,QAAQ,MAAM,GAAG,EAAE,EAAE,QAAQ,QAAQ,GAAG;EACjD;AACA,SAAO;AACT;AAEA,SAAS,sBAAsB,SAAe;AAC5C,QAAM,cAAc,QAAQ,QAAQ,GAAG;AACvC,QAAM,aAAa,QAAQ,QAAQ,GAAG;AACtC,QAAM,YAAY,cAAc;AAChC,QAAM,WAAW,aAAa;AAC9B,MAAI,aAAa,UAAU;AACzB,WAAO,KAAK,IAAI,aAAa,UAAU;EACzC;AACA,MAAI,WAAW;AACb,WAAO;EACT;AACA,MAAI,UAAU;AACZ,WAAO;EACT;AACA,SAAO;AACT;AAEA,SAAS,8BACP,KACA,YAAkB;AAElB,MAAI,eAAe,WAAW,eAAe,cAAc;AACzD,UAAM,gBACJ,SAAS,KAAK,GAAG,KAAK,iBAAiB,KAAK,IAAI,KAAI,CAAE;AACxD,QAAI,eAAe;AACjB,aAAO;IACT;EACF;AACA,MAAI,eAAe,WAAW;AAC5B,WAAO;EACT;AACA,QAAM,UAAU,IAAI,YAAW;AAC/B,QAAM,iBACJ,QAAQ,SAAS,QAAQ,KAAK,QAAQ,SAAS,YAAY,IACvD,6IACA;AACN,QAAM,mBAAmB,QAAQ,SAAS,iBAAiB,IACvD,6EACA;AACJ,SAAO,GAAG,cAAc,GAAG,gBAAgB;AAC7C;AAEA,SAAS,sBAAsB,KAAa,YAAkB;AAC5D,QAAM,YAAY,IAAI,WAAW,QAAQ,GAAG,EAAE,KAAI;AAClD,QAAM,UACJ,UAAU,SAAS,MAAM,GAAG,UAAU,MAAM,GAAG,GAAG,CAAC,QAAQ;AAC7D,QAAM,yBAAyB,8BAA8B,KAAK,UAAU;AAC5E,SACE,WAAW,UAAU,WAAW,OAAO,wDACvC,yBACA,sFACO,UAAU,IAAI,WAAW;AAEpC;AAEA,SAAS,2BACP,KAAW;AAEX,QAAM,aAAa,uBAAuB,GAAG,EAAE,KAAI;AACnD,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;EACT;AACA,MACE,CAAC,WAAW,SAAS,IAAI,KACzB,CAAC,WAAW,WAAW,GAAG,KAC1B,CAAC,WAAW,WAAW,GAAG,KAC1B,CAAC,WAAW,WAAW,GAAG,GAC1B;AACA,WAAO;EACT;AAEA,QAAM,SAAiC,CAAA;AACvC,MAAI;AACJ,QAAM,QAAQ,qBAAqB,UAAU,EAC1C,MAAM,IAAI,EACV,IAAI,CAAC,SAAS,KAAK,KAAI,CAAE,EACzB,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC;AAEnC,aAAW,QAAQ,OAAO;AACxB,UAAM,QAAQ,KAAK,MAAM,iDAAiD;AAC1E,QAAI,OAAO;AACT,YAAM,MAAM,MAAM,CAAC,EAAE,KAAI;AACzB,aAAO,GAAG,IAAI,aAAa,MAAM,CAAC,EAAE,KAAI,CAAE;AAC1C,kBAAY;AACZ;IACF;AACA,QAAI,aAAa,uBAAuB,IAAI,UAAU,YAAW,CAAE,GAAG;AACpE,aAAO,SAAS,IAAI,GAAG,OAAO,SAAS,CAAC;EAAK,IAAI;AACjD;IACF;AACA,WAAO;EACT;AAEA,SAAO;AACT;AAGM,SAAU,WACd,KACA,YAAkB;AAElB,QAAM,UAAU,uBAAuB,GAAG,EAAE,KAAI;AAChD,MAAI,CAAC,SAAS;AACZ,UAAM,IAAI,WAAW,GAAG,UAAU,oBAAoB,UAAU,KAAK;EACvE;AAEA,QAAM,gBAAgB,2BAA2B,OAAO;AACxD,MAAI,eAAe;AACjB,WAAO;EACT;AAEA,QAAM,SAAiC,CAAA;AACvC,MAAI;AACJ,QAAM,WAAW,iBAAiB,OAAO;AAEzC,aAAW,WAAW,UAAU;AAC9B,UAAM,iBAAiB,sBAAsB,OAAO;AACpD,QAAI,iBAAiB,GAAG;AACtB,YAAM,MAAM,QAAQ,MAAM,GAAG,cAAc,EAAE,KAAI;AACjD,YAAM,QAAQ,aAAa,QAAQ,MAAM,iBAAiB,CAAC,EAAE,KAAI,CAAE;AACnE,aAAO,GAAG,IAAI;AACd,kBAAY;AACZ;IACF;AACA,QAAI,aAAa,uBAAuB,IAAI,UAAU,YAAW,CAAE,GAAG;AACpE,aAAO,SAAS,IAAI,GAAG,OAAO,SAAS,CAAC,IAAI,QAAQ,KAAI,CAAE;AAC1D;IACF;AACA,UAAM,IAAI,WACR,sBAAsB,KAAK,UAAU,GACrC,UAAU,KAAK;EAEnB;AAEA,SAAO;AACT;AAEA,IAAM,gCAAgC;AACtC,IAAM,iCACJ;AAYI,SAAU,8BAA8B,KAAW;AACvD,QAAM,UAAU,IAAI,KAAI;AACxB,MAAI,8BAA8B,KAAK,OAAO,GAAG;AAC/C,WAAO;EACT;AACA,SAAO,+BAA+B,KAAK,OAAO;AACpD;AAsBM,SAAU,uBACd,IACA,YACA,aAA8B;AAE9B,QAAM,UAAU,IAAI,IAAI,YAAY,IAAI,CAAC,QAAQ,IAAI,YAAW,CAAE,CAAC;AACnE,QAAM,cAAc,OAAO,KAAK,EAAE,EAAE,OAClC,CAAC,QAAQ,CAAC,QAAQ,IAAI,IAAI,YAAW,CAAE,CAAC;AAE1C,MAAI,YAAY,SAAS,GAAG;AAC1B,UAAM,IAAI,WACR,GAAG,UAAU,0BAA0B,YAAY,SAAS,IAAI,MAAM,EAAE,IAAI,YACzE,IAAI,CAAC,QAAQ,IAAI,GAAG,GAAG,EACvB,KAAK,IAAI,CAAC,mBAAmB,YAAY,KAAK,IAAI,CAAC,KACtD,UAAU,KAAK;EAEnB;AACA,aAAW,OAAO,OAAO,KAAK,EAAE,GAAG;AACjC,UAAM,gBAAgB,IAAI,YAAW;AACrC,QAAI,kBAAkB,KAAK;AACzB;IACF;AACA,QAAI,OAAO,OAAO,IAAI,aAAa,GAAG;AACpC,YAAM,IAAI,WACR,GAAG,UAAU,kBAAkB,GAAG,8CAClC,UAAU,KAAK;IAEnB;AACA,OAAG,aAAa,IAAI,GAAG,GAAG;AAC1B,WAAO,GAAG,GAAG;EACf;AACF;AAEA,eAAe,cAAc,YAAkB;AAC7C,MAAI,QAAQ,MAAM,UAAU,MAAM;AAChC,UAAM,IAAI,WACR,GAAG,UAAU,WAAW,WAAW,6IACnC,UAAU,KAAK;EAEnB;AACA,UAAQ,MAAM,YAAY,MAAM;AAChC,SAAO,MAAM,IAAI,QAAgB,CAAC,SAAS,WAAU;AACnD,QAAI,QAAQ;AACZ,YAAQ,MAAM,GAAG,QAAQ,CAAC,UAAiB;AACzC,eAAS;IACX,CAAC;AACD,YAAQ,MAAM,GAAG,OAAO,MAAK;AAC3B,cAAQ,qBAAqB,KAAK,CAAC;IACrC,CAAC;AACD,YAAQ,MAAM,GAAG,SAAS,CAAC,UAAS;AAClC,aAAO,KAAK;IACd,CAAC;EACH,CAAC;AACH;AAiBM,SAAU,2BAAwB;AACtC,MAAI;AACJ,MAAI;AAEJ,QAAM,eAAe,OAAO,eAAuC;AACjE,QAAI,uBAAuB,wBAAwB,YAAY;AAC7D,YAAM,IAAI,WACR,4BAA4B,WAAW,yDAAyD,mBAAmB,KACnH,UAAU,KAAK;IAEnB;AACA,0BAAsB;AACtB,QAAI,CAAC,mBAAmB;AACtB,0BAAoB,cAAc,UAAU;IAC9C;AACA,WAAO,MAAM;EACf;AAEA,QAAM,eAAe,OACnB,OACA,eAC+B;AAC/B,QAAI,UAAU,QAAW;AACvB,aAAO;IACT;AACA,QAAI,MAAM,KAAI,MAAO,aAAa;AAChC,aAAO;IACT;AACA,WAAO,MAAM,aAAa,UAAU;EACtC;AAEA,QAAM,cAAc,OAClB,QACA,eACiC;AACjC,QAAI,CAAC,QAAQ;AACX,aAAO;IACT;AACA,UAAM,eAAe,OAClB,IAAI,CAAC,OAAO,UAAW,MAAM,KAAI,MAAO,cAAc,QAAQ,EAAG,EACjE,OAAO,CAAC,UAAU,SAAS,CAAC;AAC/B,QAAI,aAAa,WAAW,GAAG;AAC7B,aAAO;IACT;AACA,QAAI,aAAa,SAAS,GAAG;AAC3B,YAAM,IAAI,WACR,GAAG,UAAU,aAAa,WAAW,qDACrC,UAAU,KAAK;IAEnB;AACA,UAAM,aAAa,MAAM,aAAa,UAAU;AAChD,UAAM,OAAO,CAAC,GAAG,MAAM;AACvB,SAAK,aAAa,CAAC,CAAC,IAAI;AACxB,WAAO;EACT;AAEA,SAAO;IACL;IACA;;AAEJ;AAGM,SAAU,oBAAoB,KAAa,YAAkB;AACjE,QAAM,QAAQ,OAAO,GAAG;AACxB,MAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAC3B,UAAM,IAAI,WACR,WAAW,UAAU,WAAW,GAAG,KACnC,UAAU,KAAK;EAEnB;AACA,SAAO;AACT;AAGM,SAAU,gCACd,KACA,YAAkB;AAElB,QAAM,UAAU,IAAI,KAAI;AACxB,QAAM,QAAQ,OAAO,OAAO;AAC5B,MAAI,YAAY,MAAM,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG;AAC3D,UAAM,IAAI,WACR,WAAW,UAAU,WAAW,GAAG,uCACnC,UAAU,KAAK;EAEnB;AACA,SAAO;AACT","debugId":"2ee716ac-cc07-5826-bc55-11be6f5e5e96"}