@unbrained/pm-cli 2026.7.20 → 2026.7.21

package/dist/cli-bundle/chunks/{chunk-GVT754PX.js → chunk-YCIUJJOD.js}

@@ -7,7 +7,7 @@ import {
 !(function() {
   try {
     var e = "undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof globalThis ? globalThis : "undefined" != typeof self ? self : {}, n = new e.Error().stack;
-    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "bef9b240-c34d-5d8b-a08f-e0fb77fceef5");
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "9aa996e2-ed73-50ce-9e1b-6ab181513082");
   } catch (e2) {
   }
 })();
@@ -39,8 +39,8 @@ function parseTags(raw) {
   if (trimmed === "") {
     return [];
   }
-  const source = coerceJsonTagArray(trimmed) ?? trimmed;
-  const tags = source.split(",").map((tag) => tag.trim()).filter(Boolean).map((tag) => tag.toLowerCase());
+  const source = coerceJsonTagArray(trimmed) ?? trimmed.split(",");
+  const tags = source.map((tag) => tag.trim()).filter(Boolean).map((tag) => tag.toLowerCase());
   return Array.from(new Set(tags)).sort((a, b) => a.localeCompare(b));
 }
 function collectTagFlagValues(values) {
@@ -136,7 +136,7 @@ function coerceJsonTagArray(trimmed) {
     return null;
   }
   const parsedArray = parsed;
-  return parsedArray.map((entry) => typeof entry === "string" || typeof entry === "number" || typeof entry === "boolean" ? String(entry).replace(/,/g, " ") : "").filter((entry) => entry.length > 0).join(",");
+  return parsedArray.map((entry) => typeof entry === "string" || typeof entry === "number" || typeof entry === "boolean" ? String(entry) : "").filter((entry) => entry.length > 0);
 }
 function normalizeLineEndings(value) {
   return value.replace(/\r\n/g, "\n");
@@ -191,6 +191,12 @@ function splitCsvSegments(raw) {
 function unquoteValue(value) {
   const trimmed = value.trim();
   if (trimmed.startsWith('"') && trimmed.endsWith('"')) {
+    try {
+      const parsed = JSON.parse(trimmed);
+      if (typeof parsed === "string")
+        return parsed;
+    } catch {
+    }
     return trimmed.slice(1, -1).replace(/\\"/g, '"');
   }
   return value;
@@ -406,4 +412,4 @@ export {
   parseOptionalNumber,
   parseOptionalNonNegativeInteger
 };
-//# sourceMappingURL=chunk-GVT754PX.js.map
+//# sourceMappingURL=chunk-YCIUJJOD.js.map

package/dist/cli-bundle/chunks/chunk-YCIUJJOD.js.map

@@ -0,0 +1,7 @@
+{
+  "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.split(\",\");\n  const tags = source\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)\n        : \"\",\n    )\n    .filter((entry) => entry.length > 0);\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    try {\n      const parsed = JSON.parse(trimmed) as unknown;\n      if (typeof parsed === \"string\") return parsed;\n    } catch {\n      // Preserve the legacy permissive quoted-value parser for non-JSON input.\n    }\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"],
+  "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,QAAQ,MAAM,GAAG;AAC/D,QAAM,OAAO,OACV,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,IACZ,EAAE,EAEP,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AACvC;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,QAAI;AACF,YAAM,SAAS,KAAK,MAAM,OAAO;AACjC,UAAI,OAAO,WAAW;AAAU,eAAO;IACzC,QAAQ;IAER;AACA,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;",
+  "names": []
+}

package/dist/cli-bundle/chunks/{chunk-IJNK6WW2.js → chunk-Z75ONV25.js}

@@ -10,7 +10,7 @@ import {
 !(function() {
   try {
     var e = "undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof globalThis ? globalThis : "undefined" != typeof self ? self : {}, n = new e.Error().stack;
-    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "987f91a5-6f98-55f4-b39b-5fb8b816c95a");
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "208d0dcd-c6b6-5959-acdb-6969b1005edd");
   } catch (e2) {
   }
 })();
@@ -26,6 +26,71 @@ function normalizeDependencyGraphTarget(target) {
   const normalized = normalizeDependencyReferenceTarget(target);
   return normalized?.toLowerCase() === "no-active-blocker" ? void 0 : normalized;
 }
+function resolveWorkspaceRelationshipKindRegistry() {
+  const registry = createRelationshipKindRegistry();
+  for (const registration of getActiveExtensionRegistrations()?.relationship_kinds ?? []) {
+    for (const definition of registration.definitions) {
+      registry.register(definition);
+    }
+  }
+  return registry;
+}
+function compareCaseFoldedText(left, right) {
+  const normalizedLeft = left.toLowerCase();
+  const normalizedRight = right.toLowerCase();
+  if (normalizedLeft !== normalizedRight)
+    return normalizedLeft < normalizedRight ? -1 : 1;
+  if (left !== right)
+    return left < right ? -1 : 1;
+  return 0;
+}
+function countDependencyRowIdentities(item) {
+  const occurrences = /* @__PURE__ */ new Map();
+  for (const dependency of item.dependencies ?? []) {
+    if (typeof dependency !== "object" || dependency === null)
+      continue;
+    const legacyDependency = dependency;
+    const target = normalizeDependencyReferenceTarget(legacyDependency.id);
+    if (!target)
+      continue;
+    const kind = typeof legacyDependency.kind === "string" ? legacyDependency.kind : "related";
+    const key = `${kind}\0${target.toLowerCase()}`;
+    const existing = occurrences.get(key);
+    if (existing)
+      existing.count += 1;
+    else
+      occurrences.set(key, { target_id: target, kind, count: 1 });
+  }
+  return occurrences;
+}
+function collectDuplicateDependencyRows(items, isTerminal = (status) => status === "closed" || status === "canceled") {
+  const rows = [];
+  for (const item of items) {
+    if (typeof item?.id !== "string" || item.id.trim().length === 0)
+      continue;
+    for (const entry of countDependencyRowIdentities(item).values()) {
+      if (entry.count < 2)
+        continue;
+      rows.push({
+        holder_id: item.id.trim(),
+        target_id: entry.target_id,
+        kind: entry.kind,
+        occurrences: entry.count,
+        holder_status: item.status,
+        legacy_terminal: isTerminal(item.status)
+      });
+    }
+  }
+  return rows.sort((left, right) => {
+    const holderCompare = compareCaseFoldedText(left.holder_id, right.holder_id);
+    if (holderCompare !== 0)
+      return holderCompare;
+    const targetCompare = compareCaseFoldedText(left.target_id, right.target_id);
+    if (targetCompare !== 0)
+      return targetCompare;
+    return compareCaseFoldedText(left.kind, right.kind);
+  });
+}
 function collectDanglingDependencyReferences(items, isTerminal = (status) => status === "closed" || status === "canceled") {
   const safeItems = items.filter((item) => typeof item?.id === "string" && item.id.trim().length > 0);
   const knownIds = new Set(safeItems.map((item) => item.id.trim().toLowerCase()));
@@ -78,14 +143,7 @@ function collectMissingDependencyTargetIds(dangling) {
   return [...targets.values()].sort((left, right) => left.localeCompare(right));
 }
 function assembleWorkspaceRelationshipGraph(items, isTerminal, registry) {
-  const relationshipRegistry = registry ?? createRelationshipKindRegistry();
-  if (registry === void 0) {
-    for (const registration of getActiveExtensionRegistrations()?.relationship_kinds ?? []) {
-      for (const definition of registration.definitions) {
-        relationshipRegistry.register(definition);
-      }
-    }
-  }
+  const relationshipRegistry = registry ?? resolveWorkspaceRelationshipKindRegistry();
   const safeItems = items.filter((item) => typeof item?.id === "string" && item.id.trim().length > 0);
   const canonicalIds = new Map(safeItems.map((item) => [item.id.trim().toLowerCase(), item.id.trim()]));
   const dangling = collectDanglingDependencyReferences(safeItems, isTerminal);
@@ -122,7 +180,8 @@ function assembleWorkspaceRelationshipGraph(items, isTerminal, registry) {
       ...safeItems.map((item) => ({
         id: item.id.trim(),
         title: item.title,
-        status: item.status
+        status: item.status,
+        ...typeof item.type === "string" && item.type.trim().length > 0 ? { type: item.type.trim() } : {}
       })),
       ...missingIds.map((id) => ({
         id,
@@ -131,13 +190,17 @@ function assembleWorkspaceRelationshipGraph(items, isTerminal, registry) {
       }))
     ],
     missingIdSet: new Set(missingIds.map((id) => id.toLowerCase())),
-    dangling
+    dangling,
+    duplicateRows: collectDuplicateDependencyRows(safeItems, isTerminal)
   };
 }
 
 export {
+  normalizeDependencyGraphTarget,
+  resolveWorkspaceRelationshipKindRegistry,
+  collectDuplicateDependencyRows,
   collectDanglingDependencyReferences,
   collectMissingDependencyTargetIds,
   assembleWorkspaceRelationshipGraph
 };
-//# sourceMappingURL=chunk-IJNK6WW2.js.map
+//# sourceMappingURL=chunk-Z75ONV25.js.map

package/dist/cli-bundle/chunks/chunk-Z75ONV25.js.map

@@ -0,0 +1,7 @@
+{
+  "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. */\nexport function normalizeDependencyGraphTarget(\n  target: unknown,\n): string | undefined {\n  const normalized = normalizeDependencyReferenceTarget(target);\n  return normalized?.toLowerCase() === \"no-active-blocker\"\n    ? undefined\n    : normalized;\n}\n\n/**\n * Resolve the default workspace relationship-kind registry: the built-in kinds\n * merged with every active extension-contributed relationship-kind\n * registration. Assembly, mutation advisories, and standalone graph consumers\n * share this resolution so custom ordering semantics apply identically on\n * every surface.\n */\nexport function resolveWorkspaceRelationshipKindRegistry(): RelationshipKindRegistry {\n  const registry = createRelationshipKindRegistry();\n  for (const registration of getActiveExtensionRegistrations()\n    ?.relationship_kinds ?? []) {\n    for (const definition of registration.definitions) {\n      registry.register(definition);\n    }\n  }\n  return registry;\n}\n\n/** One raw stored dependency row duplicated verbatim on a single holder. */\nexport interface DuplicateDependencyRow {\n  /** Item that stores the duplicated row. */\n  holder_id: string;\n  /** Referenced target id in its first stored spelling. */\n  target_id: string;\n  /** Stored relationship kind shared by every duplicate occurrence. */\n  kind: string;\n  /** Total stored occurrences of the identical row (always >= 2). */\n  occurrences: number;\n  /** Current lifecycle status of the holder. */\n  holder_status: ItemStatus;\n  /** Whether the holder is terminal and the duplication is historical debt. */\n  legacy_terminal: boolean;\n}\n\n/** Compare text case-insensitively with an exact-spelling deterministic tie-breaker. */\nfunction compareCaseFoldedText(left: string, right: string): number {\n  const normalizedLeft = left.toLowerCase();\n  const normalizedRight = right.toLowerCase();\n  if (normalizedLeft !== normalizedRight)\n    return normalizedLeft < normalizedRight ? -1 : 1;\n  if (left !== right) return left < right ? -1 : 1;\n  return 0;\n}\n\n/** Count one holder's dependency rows by their case-insensitive kind-plus-target identity. */\nfunction countDependencyRowIdentities(\n  item: DependencyReferenceHolder,\n): Map<string, { target_id: string; kind: string; count: number }> {\n  const occurrences = new Map<\n    string,\n    { target_id: string; kind: string; count: number }\n  >();\n  for (const dependency of item.dependencies ?? []) {\n    if (typeof dependency !== \"object\" || dependency === null) continue;\n    const legacyDependency = dependency as Partial<Dependency>;\n    const target = normalizeDependencyReferenceTarget(legacyDependency.id);\n    if (!target) continue;\n    const kind =\n      typeof legacyDependency.kind === \"string\"\n        ? legacyDependency.kind\n        : \"related\";\n    const key = `${kind}\\u0000${target.toLowerCase()}`;\n    const existing = occurrences.get(key);\n    if (existing) existing.count += 1;\n    else occurrences.set(key, { target_id: target, kind, count: 1 });\n  }\n  return occurrences;\n}\n\n/**\n * Collect raw stored dependency rows whose exact identity — holder, kind, and\n * case-insensitive target — appears more than once on one item. Graph\n * construction deduplicates these by edge identity, so the assembled graph and\n * every projection built on it cannot see them; this pre-assembly scan is the\n * only surface that reports the storage-layer defect.\n */\nexport function collectDuplicateDependencyRows(\n  items: readonly DependencyReferenceHolder[],\n  isTerminal: (status: ItemStatus) => boolean = (status) =>\n    status === \"closed\" || status === \"canceled\",\n): DuplicateDependencyRow[] {\n  const rows: DuplicateDependencyRow[] = [];\n  for (const item of items) {\n    if (typeof item?.id !== \"string\" || item.id.trim().length === 0) continue;\n    for (const entry of countDependencyRowIdentities(item).values()) {\n      if (entry.count < 2) continue;\n      rows.push({\n        holder_id: item.id.trim(),\n        target_id: entry.target_id,\n        kind: entry.kind,\n        occurrences: entry.count,\n        holder_status: item.status,\n        legacy_terminal: isTerminal(item.status),\n      });\n    }\n  }\n  return rows.sort((left, right) => {\n    const holderCompare = compareCaseFoldedText(\n      left.holder_id,\n      right.holder_id,\n    );\n    if (holderCompare !== 0) return holderCompare;\n    const targetCompare = compareCaseFoldedText(\n      left.target_id,\n      right.target_id,\n    );\n    if (targetCompare !== 0) return targetCompare;\n    return compareCaseFoldedText(left.kind, right.kind);\n  });\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  /** Optional item type powering per-type coverage profiles and policies. */\n  type?: 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  /** Item type when the source item declared one; absent on missing placeholders. */\n  type?: 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  /** Raw same-identity duplicated dependency rows found before graph dedup. */\n  duplicateRows: DuplicateDependencyRow[];\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 =\n    registry ?? resolveWorkspaceRelationshipKindRegistry();\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        ...(typeof item.type === \"string\" && item.type.trim().length > 0\n          ? { type: item.type.trim() }\n          : {}),\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    duplicateRows: collectDuplicateDependencyRows(safeItems, isTerminal),\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;AAGM,SAAU,+BACd,QAAe;AAEf,QAAM,aAAa,mCAAmC,MAAM;AAC5D,SAAO,YAAY,YAAW,MAAO,sBACjC,SACA;AACN;AASM,SAAU,2CAAwC;AACtD,QAAM,WAAW,+BAA8B;AAC/C,aAAW,gBAAgB,gCAA+B,GACtD,sBAAsB,CAAA,GAAI;AAC5B,eAAW,cAAc,aAAa,aAAa;AACjD,eAAS,SAAS,UAAU;IAC9B;EACF;AACA,SAAO;AACT;AAmBA,SAAS,sBAAsB,MAAc,OAAa;AACxD,QAAM,iBAAiB,KAAK,YAAW;AACvC,QAAM,kBAAkB,MAAM,YAAW;AACzC,MAAI,mBAAmB;AACrB,WAAO,iBAAiB,kBAAkB,KAAK;AACjD,MAAI,SAAS;AAAO,WAAO,OAAO,QAAQ,KAAK;AAC/C,SAAO;AACT;AAGA,SAAS,6BACP,MAA+B;AAE/B,QAAM,cAAc,oBAAI,IAAG;AAI3B,aAAW,cAAc,KAAK,gBAAgB,CAAA,GAAI;AAChD,QAAI,OAAO,eAAe,YAAY,eAAe;AAAM;AAC3D,UAAM,mBAAmB;AACzB,UAAM,SAAS,mCAAmC,iBAAiB,EAAE;AACrE,QAAI,CAAC;AAAQ;AACb,UAAM,OACJ,OAAO,iBAAiB,SAAS,WAC7B,iBAAiB,OACjB;AACN,UAAM,MAAM,GAAG,IAAI,KAAS,OAAO,YAAW,CAAE;AAChD,UAAM,WAAW,YAAY,IAAI,GAAG;AACpC,QAAI;AAAU,eAAS,SAAS;;AAC3B,kBAAY,IAAI,KAAK,EAAE,WAAW,QAAQ,MAAM,OAAO,EAAC,CAAE;EACjE;AACA,SAAO;AACT;AASM,SAAU,+BACd,OACA,aAA8C,CAAC,WAC7C,WAAW,YAAY,WAAW,YAAU;AAE9C,QAAM,OAAiC,CAAA;AACvC,aAAW,QAAQ,OAAO;AACxB,QAAI,OAAO,MAAM,OAAO,YAAY,KAAK,GAAG,KAAI,EAAG,WAAW;AAAG;AACjE,eAAW,SAAS,6BAA6B,IAAI,EAAE,OAAM,GAAI;AAC/D,UAAI,MAAM,QAAQ;AAAG;AACrB,WAAK,KAAK;QACR,WAAW,KAAK,GAAG,KAAI;QACvB,WAAW,MAAM;QACjB,MAAM,MAAM;QACZ,aAAa,MAAM;QACnB,eAAe,KAAK;QACpB,iBAAiB,WAAW,KAAK,MAAM;OACxC;IACH;EACF;AACA,SAAO,KAAK,KAAK,CAAC,MAAM,UAAS;AAC/B,UAAM,gBAAgB,sBACpB,KAAK,WACL,MAAM,SAAS;AAEjB,QAAI,kBAAkB;AAAG,aAAO;AAChC,UAAM,gBAAgB,sBACpB,KAAK,WACL,MAAM,SAAS;AAEjB,QAAI,kBAAkB;AAAG,aAAO;AAChC,WAAO,sBAAsB,KAAK,MAAM,MAAM,IAAI;EACpD,CAAC;AACH;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;AA2CM,SAAU,mCACd,OACA,YACA,UAAmC;AAEnC,QAAM,uBACJ,YAAY,yCAAwC;AACtD,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,GAAI,OAAO,KAAK,SAAS,YAAY,KAAK,KAAK,KAAI,EAAG,SAAS,IAC3D,EAAE,MAAM,KAAK,KAAK,KAAI,EAAE,IACxB,CAAA;QACJ;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;IACA,eAAe,+BAA+B,WAAW,UAAU;;AAEvE;",
+  "names": []
+}

package/dist/cli-bundle/chunks/{chunk-4L23AGQ7.js → chunk-Z7VWXXJM.js}

@@ -1,15 +1,13 @@
 
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="39fa5c19-48c3-5dc7-a02e-1e3edffb0668")}catch(e){}}();
+!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="1c0accd8-e100-5cf8-9144-fd399be61d5a")}catch(e){}}();
 import {
   ensureMaterializedHistoryTarget,
   readHistoryEntries,
   replayHistoryToTarget,
+  replayToCanonicalItemDocument,
   resolveHistorySubject,
   resolveHistoryTarget
-} from "./chunk-2BO4CA46.js";
-import {
-  replayToCanonicalItemDocument
-} from "./chunk-P7JTWYLH.js";
+} from "./chunk-PFNHX655.js";
 import {
   getActiveExtensionRegistrations,
   readSettings
@@ -58,6 +56,6 @@ async function getItemAt(id, target, options = {}) {
 export {
   getItemAt
 };
-//# sourceMappingURL=chunk-4L23AGQ7.js.map
+//# sourceMappingURL=chunk-Z7VWXXJM.js.map
 
-//# debugId=39fa5c19-48c3-5dc7-a02e-1e3edffb0668
+//# debugId=1c0accd8-e100-5cf8-9144-fd399be61d5a

package/dist/cli-bundle/chunks/{chunk-4L23AGQ7.js.map → chunk-Z7VWXXJM.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../../../../../../../../sdk/history-read.ts"],"sourcesContent":["/**\n * @module sdk/history-read\n *\n * Public, mutation-free item time-travel reads backed by the same verified\n * replay kernel used by `pm restore`. Integrators can use this primitive as a\n * building block for provenance browsers, immutable records, and VCS-like\n * systems without acquiring locks or appending history.\n */\nimport { getActiveExtensionRegistrations } from \"../core/extensions/index.js\";\nimport { pathExists } from \"../core/fs/fs-utils.js\";\nimport {\n  applyHistoryPatch,\n  ensureMaterializedHistoryTarget,\n  extractPatchFailureContext,\n  replayHistoryToTarget,\n  resolveHistoryTarget,\n  type ResolvedHistoryTarget,\n} from \"../core/history/projection.js\";\nimport { readHistoryEntries } from \"../core/history/read.js\";\nimport { replayToCanonicalItemDocument } from \"../core/history/replay.js\";\nimport { resolveItemTypeRegistry } from \"../core/item/type-registry.js\";\nimport { EXIT_CODE } from \"../core/shared/constants.js\";\nimport { PmCliError } from \"../core/shared/errors.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../core/store/paths.js\";\nimport { readSettings } from \"../core/store/settings.js\";\nimport type { ItemDocument } from \"../types/index.js\";\nimport { resolveHistorySubject } from \"./history-redact.js\";\n\n/** Workspace resolution controls accepted by {@link getItemAt}. */\nexport interface GetItemAtOptions {\n  /** Explicit tracker root, equivalent to the CLI global `--pm-path`. */\n  pmRoot?: string;\n  /** Working directory used when discovering the nearest tracker. */\n  cwd?: string;\n}\n\n/** Verified historical item projection returned by {@link getItemAt}. */\nexport interface GetItemAtResult {\n  /** Reconstructed canonical item document at the selected version. */\n  document: ItemDocument;\n  /** Always true, preventing consumers from confusing this with current state. */\n  reconstructed: true;\n  /** One-based version included in the projection. */\n  as_of_version: number;\n  /** Timestamp of the final included history entry. */\n  as_of_timestamp: string;\n  /** Normalized target resolution metadata shared with restore. */\n  target: ResolvedHistoryTarget;\n  /** Total number of entries currently available in the stream. */\n  history_length: number;\n}\n\n/**\n * Reconstruct one item at a one-based version or ISO timestamp without locks,\n * item writes, history writes, or derived-index mutations.\n */\nexport async function getItemAt(\n  id: string,\n  target: string,\n  options: GetItemAtOptions = {},\n): Promise<GetItemAtResult> {\n  const pmRoot = resolvePmRoot(options.cwd ?? process.cwd(), options.pmRoot);\n  if (!(await pathExists(getSettingsPath(pmRoot)))) {\n    throw new PmCliError(\n      `Tracker is not initialized at ${pmRoot}. Run pm init first.`,\n      EXIT_CODE.NOT_FOUND,\n    );\n  }\n  const settings = await readSettings(pmRoot);\n  const typeRegistry = resolveItemTypeRegistry(\n    settings,\n    getActiveExtensionRegistrations(),\n  );\n  const subject = await resolveHistorySubject(\n    pmRoot,\n    id,\n    settings,\n    typeRegistry.type_to_folder,\n  );\n  const history = await readHistoryEntries(subject.historyPath, subject.id);\n  if (history.length === 0) {\n    throw new PmCliError(\n      `No history exists for ${subject.id}; point-in-time reads are unavailable.`,\n      EXIT_CODE.NOT_FOUND,\n    );\n  }\n  const resolvedTarget = resolveHistoryTarget(target, history);\n  const replay = ensureMaterializedHistoryTarget(\n    replayHistoryToTarget(history, resolvedTarget.historyIndex),\n    resolvedTarget,\n  );\n  const document = replayToCanonicalItemDocument(replay, {\n    schema: settings.schema,\n  });\n  if (document.metadata.id !== subject.id) {\n    throw new PmCliError(\n      `History target resolved to item ${document.metadata.id}, expected ${subject.id}.`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n  const targetEntry = history[resolvedTarget.historyIndex];\n  return {\n    document,\n    reconstructed: true,\n    as_of_version: resolvedTarget.historyIndex + 1,\n    as_of_timestamp: targetEntry.ts,\n    target: resolvedTarget,\n    history_length: history.length,\n  };\n}\n\nexport {\n  applyHistoryPatch,\n  ensureMaterializedHistoryTarget,\n  extractPatchFailureContext,\n  readHistoryEntries,\n  replayHistoryToTarget,\n  resolveHistoryTarget,\n};\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAwDA,eAAsB,UACpB,IACA,QACA,UAA4B,CAAA,GAAE;AAE9B,QAAM,SAAS,cAAc,QAAQ,OAAO,QAAQ,IAAG,GAAI,QAAQ,MAAM;AACzE,MAAI,CAAE,MAAM,WAAW,gBAAgB,MAAM,CAAC,GAAI;AAChD,UAAM,IAAI,WACR,iCAAiC,MAAM,wBACvC,UAAU,SAAS;EAEvB;AACA,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,eAAe,wBACnB,UACA,gCAA+B,CAAE;AAEnC,QAAM,UAAU,MAAM,sBACpB,QACA,IACA,UACA,aAAa,cAAc;AAE7B,QAAM,UAAU,MAAM,mBAAmB,QAAQ,aAAa,QAAQ,EAAE;AACxE,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,WACR,yBAAyB,QAAQ,EAAE,0CACnC,UAAU,SAAS;EAEvB;AACA,QAAM,iBAAiB,qBAAqB,QAAQ,OAAO;AAC3D,QAAM,SAAS,gCACb,sBAAsB,SAAS,eAAe,YAAY,GAC1D,cAAc;AAEhB,QAAM,WAAW,8BAA8B,QAAQ;IACrD,QAAQ,SAAS;GAClB;AACD,MAAI,SAAS,SAAS,OAAO,QAAQ,IAAI;AACvC,UAAM,IAAI,WACR,mCAAmC,SAAS,SAAS,EAAE,cAAc,QAAQ,EAAE,KAC/E,UAAU,eAAe;EAE7B;AACA,QAAM,cAAc,QAAQ,eAAe,YAAY;AACvD,SAAO;IACL;IACA,eAAe;IACf,eAAe,eAAe,eAAe;IAC7C,iBAAiB,YAAY;IAC7B,QAAQ;IACR,gBAAgB,QAAQ;;AAE5B","debugId":"39fa5c19-48c3-5dc7-a02e-1e3edffb0668"}
+{"version":3,"sources":["../../../../../../../../sdk/history-read.ts"],"sourcesContent":["/**\n * @module sdk/history-read\n *\n * Public, mutation-free item time-travel reads backed by the same verified\n * replay kernel used by `pm restore`. Integrators can use this primitive as a\n * building block for provenance browsers, immutable records, and VCS-like\n * systems without acquiring locks or appending history.\n */\nimport { getActiveExtensionRegistrations } from \"../core/extensions/index.js\";\nimport { pathExists } from \"../core/fs/fs-utils.js\";\nimport {\n  applyHistoryPatch,\n  ensureMaterializedHistoryTarget,\n  extractPatchFailureContext,\n  replayHistoryToTarget,\n  resolveHistoryTarget,\n  type ResolvedHistoryTarget,\n} from \"../core/history/projection.js\";\nimport { readHistoryEntries } from \"../core/history/read.js\";\nimport { replayToCanonicalItemDocument } from \"../core/history/replay.js\";\nimport { resolveItemTypeRegistry } from \"../core/item/type-registry.js\";\nimport { EXIT_CODE } from \"../core/shared/constants.js\";\nimport { PmCliError } from \"../core/shared/errors.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../core/store/paths.js\";\nimport { readSettings } from \"../core/store/settings.js\";\nimport type { ItemDocument } from \"../types/index.js\";\nimport { resolveHistorySubject } from \"./history-redact.js\";\n\n/** Workspace resolution controls accepted by {@link getItemAt}. */\nexport interface GetItemAtOptions {\n  /** Explicit tracker root, equivalent to the CLI global `--pm-path`. */\n  pmRoot?: string;\n  /** Working directory used when discovering the nearest tracker. */\n  cwd?: string;\n}\n\n/** Verified historical item projection returned by {@link getItemAt}. */\nexport interface GetItemAtResult {\n  /** Reconstructed canonical item document at the selected version. */\n  document: ItemDocument;\n  /** Always true, preventing consumers from confusing this with current state. */\n  reconstructed: true;\n  /** One-based version included in the projection. */\n  as_of_version: number;\n  /** Timestamp of the final included history entry. */\n  as_of_timestamp: string;\n  /** Normalized target resolution metadata shared with restore. */\n  target: ResolvedHistoryTarget;\n  /** Total number of entries currently available in the stream. */\n  history_length: number;\n}\n\n/**\n * Reconstruct one item at a one-based version or ISO timestamp without locks,\n * item writes, history writes, or derived-index mutations.\n */\nexport async function getItemAt(\n  id: string,\n  target: string,\n  options: GetItemAtOptions = {},\n): Promise<GetItemAtResult> {\n  const pmRoot = resolvePmRoot(options.cwd ?? process.cwd(), options.pmRoot);\n  if (!(await pathExists(getSettingsPath(pmRoot)))) {\n    throw new PmCliError(\n      `Tracker is not initialized at ${pmRoot}. Run pm init first.`,\n      EXIT_CODE.NOT_FOUND,\n    );\n  }\n  const settings = await readSettings(pmRoot);\n  const typeRegistry = resolveItemTypeRegistry(\n    settings,\n    getActiveExtensionRegistrations(),\n  );\n  const subject = await resolveHistorySubject(\n    pmRoot,\n    id,\n    settings,\n    typeRegistry.type_to_folder,\n  );\n  const history = await readHistoryEntries(subject.historyPath, subject.id);\n  if (history.length === 0) {\n    throw new PmCliError(\n      `No history exists for ${subject.id}; point-in-time reads are unavailable.`,\n      EXIT_CODE.NOT_FOUND,\n    );\n  }\n  const resolvedTarget = resolveHistoryTarget(target, history);\n  const replay = ensureMaterializedHistoryTarget(\n    replayHistoryToTarget(history, resolvedTarget.historyIndex),\n    resolvedTarget,\n  );\n  const document = replayToCanonicalItemDocument(replay, {\n    schema: settings.schema,\n  });\n  if (document.metadata.id !== subject.id) {\n    throw new PmCliError(\n      `History target resolved to item ${document.metadata.id}, expected ${subject.id}.`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n  const targetEntry = history[resolvedTarget.historyIndex];\n  return {\n    document,\n    reconstructed: true,\n    as_of_version: resolvedTarget.historyIndex + 1,\n    as_of_timestamp: targetEntry.ts,\n    target: resolvedTarget,\n    history_length: history.length,\n  };\n}\n\nexport {\n  applyHistoryPatch,\n  ensureMaterializedHistoryTarget,\n  extractPatchFailureContext,\n  readHistoryEntries,\n  replayHistoryToTarget,\n  resolveHistoryTarget,\n};\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAwDA,eAAsB,UACpB,IACA,QACA,UAA4B,CAAA,GAAE;AAE9B,QAAM,SAAS,cAAc,QAAQ,OAAO,QAAQ,IAAG,GAAI,QAAQ,MAAM;AACzE,MAAI,CAAE,MAAM,WAAW,gBAAgB,MAAM,CAAC,GAAI;AAChD,UAAM,IAAI,WACR,iCAAiC,MAAM,wBACvC,UAAU,SAAS;EAEvB;AACA,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,eAAe,wBACnB,UACA,gCAA+B,CAAE;AAEnC,QAAM,UAAU,MAAM,sBACpB,QACA,IACA,UACA,aAAa,cAAc;AAE7B,QAAM,UAAU,MAAM,mBAAmB,QAAQ,aAAa,QAAQ,EAAE;AACxE,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,WACR,yBAAyB,QAAQ,EAAE,0CACnC,UAAU,SAAS;EAEvB;AACA,QAAM,iBAAiB,qBAAqB,QAAQ,OAAO;AAC3D,QAAM,SAAS,gCACb,sBAAsB,SAAS,eAAe,YAAY,GAC1D,cAAc;AAEhB,QAAM,WAAW,8BAA8B,QAAQ;IACrD,QAAQ,SAAS;GAClB;AACD,MAAI,SAAS,SAAS,OAAO,QAAQ,IAAI;AACvC,UAAM,IAAI,WACR,mCAAmC,SAAS,SAAS,EAAE,cAAc,QAAQ,EAAE,KAC/E,UAAU,eAAe;EAE7B;AACA,QAAM,cAAc,QAAQ,eAAe,YAAY;AACvD,SAAO;IACL;IACA,eAAe;IACf,eAAe,eAAe,eAAe;IAC7C,iBAAiB,YAAY;IAC7B,QAAQ;IACR,gBAAgB,QAAQ;;AAE5B","debugId":"1c0accd8-e100-5cf8-9144-fd399be61d5a"}

package/dist/cli-bundle/chunks/{chunk-YBT7O4KT.js → chunk-ZTVA4KLN.js}

@@ -1,7 +1,7 @@
 import {
   computeHistoryDiff,
   patchPathToChangedField
-} from "./chunk-TYHJDFYW.js";
+} from "./chunk-ZVZGXPQ5.js";
 import {
   collectRuntimeFilterValues,
   matchesRuntimeFilters,
@@ -24,13 +24,11 @@ import {
   computeActionabilityReport,
   resolveItemBlockers
 } from "./chunk-TVYYO5A7.js";
-import {
-  readHistoryEntries
-} from "./chunk-C3KD7U3T.js";
 import {
   normalizeReplayPatchOps,
+  readHistoryEntries,
   verifyHistoryChain
-} from "./chunk-E6LEMURX.js";
+} from "./chunk-2L6ZP22J.js";
 import {
   acquireLock,
   compareTimestampStrings,
@@ -3629,4 +3627,4 @@ export {
   renderNextMarkdown,
   collectStaleVectorizationIds
 };
-//# sourceMappingURL=chunk-YBT7O4KT.js.map
+//# sourceMappingURL=chunk-ZTVA4KLN.js.map