@unbrained/pm-cli 2026.7.13 → 2026.7.14

package/dist/cli-bundle/chunks/{chunk-KQJVTQVK.js → chunk-ANSJHDOZ.js}

@@ -1,7 +1,7 @@
 import {
   BUILTIN_ITEM_TYPE_VALUES,
   toDefaultFolder
-} from "./chunk-XY3CC3EM.js";
+} from "./chunk-AFWZRL7M.js";
 
 // dist/core/schema/item-types-file.js
 !(function() {
@@ -263,4 +263,4 @@ export {
   buildInvalidTypeHint,
   buildInvalidTypeError
 };
-//# sourceMappingURL=chunk-KQJVTQVK.js.map
+//# sourceMappingURL=chunk-ANSJHDOZ.js.map

package/dist/cli-bundle/chunks/{chunk-OMT4NO7T.js → chunk-B5DZYTT3.js}

@@ -1,27 +1,67 @@
 import {
   getActiveExtensionRegistrations,
+  isTerminalStatus,
   listAllItemMetadataLight,
   readSettings
-} from "./chunk-QXYKH56X.js";
+} from "./chunk-T4BRCB6Z.js";
 import {
   EXIT_CODE,
   PmCliError,
   getSettingsPath,
   pathExists,
   resolveItemTypeRegistry,
-  resolvePmRoot
-} from "./chunk-XY3CC3EM.js";
+  resolvePmRoot,
+  resolveRuntimeStatusRegistry
+} from "./chunk-AFWZRL7M.js";
 
-// dist/cli/commands/deps.js
+// dist/sdk/dependencies.js
 !(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] = "b552e8a0-010d-55aa-b9d3-6f4c17b4051c");
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "27ed78ad-a876-57b7-8604-51a45d22d0f4");
   } catch (e2) {
   }
 })();
 var DEPS_FORMAT_VALUES = ["tree", "graph"];
 var DEPS_COLLAPSE_VALUES = ["none", "repeated"];
+function collectDanglingDependencyReferences(items, isTerminal = (status) => status === "closed" || status === "canceled") {
+  const knownIds = new Set(items.map((item) => item.id.trim().toLowerCase()));
+  const rows = /* @__PURE__ */ new Map();
+  const addReference = (item, target, kind, source) => {
+    const normalized = typeof target === "string" ? target.trim() : "";
+    if (!normalized || ["none", "null", "n/a", "na"].includes(normalized.toLowerCase()) || knownIds.has(normalized.toLowerCase())) {
+      return;
+    }
+    const row = {
+      holder_id: item.id,
+      target_id: normalized,
+      kind,
+      source,
+      holder_status: item.status,
+      legacy_terminal: isTerminal(item.status),
+      no_active_blocker_sentinel: normalized.toLowerCase() === "no-active-blocker"
+    };
+    rows.set(`${row.holder_id}::${row.target_id}::${row.kind}::${row.source}`, row);
+  };
+  for (const item of items) {
+    addReference(item, item.parent, "parent", "parent");
+    addReference(item, item.blocked_by, "blocked_by", "blocked_by");
+    for (const dependency of item.dependencies ?? []) {
+      if (typeof dependency !== "object" || dependency === null) {
+        continue;
+      }
+      const legacyDependency = dependency;
+      addReference(item, legacyDependency.id, typeof legacyDependency.kind === "string" ? legacyDependency.kind : "related", "dependency");
+    }
+  }
+  const sorted = [...rows.values()].sort((left, right) => left.holder_id.localeCompare(right.holder_id) || left.target_id.localeCompare(right.target_id) || left.kind.localeCompare(right.kind) || left.source.localeCompare(right.source));
+  const legacyTerminal = sorted.filter((row) => row.legacy_terminal);
+  return {
+    active: sorted.filter((row) => !row.legacy_terminal),
+    legacy_terminal: legacyTerminal,
+    no_active_blocker_sentinels: sorted.filter((row) => row.no_active_blocker_sentinel)
+  };
+}
 function parseFormat(raw) {
   const candidate = raw?.trim().toLowerCase() ?? "tree";
   if (DEPS_FORMAT_VALUES.includes(candidate)) {
@@ -50,20 +90,20 @@ function normalizeDependencies(dependencies) {
   if (!dependencies || dependencies.length === 0) {
     return [];
   }
-  const sorted = [...dependencies].sort((left, right) => {
+  const sorted = dependencies.map(({ id, kind }) => ({
+    id: id.trim(),
+    kind: kind.trim().toLowerCase()
+  })).sort((left, right) => {
     const byKind = left.kind.localeCompare(right.kind);
     if (byKind !== 0)
       return byKind;
-    const byId = left.id.localeCompare(right.id);
-    if (byId !== 0)
-      return byId;
-    return left.created_at.localeCompare(right.created_at);
+    return left.id.localeCompare(right.id);
   });
   const deduped = /* @__PURE__ */ new Map();
   for (const dependency of sorted) {
-    const key = `${dependency.kind}::${dependency.id}`;
+    const key = `${dependency.kind.toLowerCase()}::${dependency.id.toLowerCase()}`;
     if (!deduped.has(key)) {
-      deduped.set(key, dependency);
+      deduped.set(key, { id: dependency.id, kind: dependency.kind });
     }
   }
   return [...deduped.values()];
@@ -78,15 +118,16 @@ function toIndexedItem(item) {
   };
 }
 function toTreeNode(id, index, lineage, maxDepth, collapse, expanded, depth = 0, via) {
-  const item = index.get(id);
+  const lookupId = id.trim().toLowerCase();
+  const item = index.get(lookupId);
   const baseNode = {
-    id,
+    id: item?.id ?? id,
     title: item?.title,
     type: item?.type,
     status: item?.status,
     via,
     missing: !item,
-    cycle: lineage.has(id),
+    cycle: lineage.has(lookupId),
     dependencies: []
   };
   if (!item || baseNode.cycle) {
@@ -98,15 +139,15 @@ function toTreeNode(id, index, lineage, maxDepth, collapse, expanded, depth = 0,
     }
     return baseNode;
   }
-  if (collapse === "repeated" && expanded.has(id)) {
+  if (collapse === "repeated" && expanded.has(lookupId)) {
     baseNode.collapsed = true;
     return baseNode;
   }
   if (collapse === "repeated") {
-    expanded.add(id);
+    expanded.add(lookupId);
   }
   const nextLineage = new Set(lineage);
-  nextLineage.add(id);
+  nextLineage.add(lookupId);
   baseNode.dependencies = item.dependencies.map((dependency) => toTreeNode(dependency.id, index, nextLineage, maxDepth, collapse, expanded, depth + 1, dependency.kind));
   return baseNode;
 }
@@ -175,6 +216,40 @@ function toGraph(root) {
     missing_ids: missingIds
   };
 }
+function countDependencyGraph(rootId, index, maxDepth) {
+  const nodeIds = /* @__PURE__ */ new Set();
+  const edgeKeys = /* @__PURE__ */ new Set();
+  const missingIds = /* @__PURE__ */ new Set();
+  const expanded = /* @__PURE__ */ new Set();
+  const pending = [{ id: rootId, depth: 0 }];
+  let pendingIndex = 0;
+  while (pendingIndex < pending.length) {
+    const current = pending[pendingIndex++];
+    const lookupId = current.id.trim().toLowerCase();
+    nodeIds.add(lookupId);
+    const item = index.get(lookupId);
+    if (!item) {
+      missingIds.add(lookupId);
+      continue;
+    }
+    if (maxDepth !== void 0 && current.depth >= maxDepth) {
+      continue;
+    }
+    if (expanded.has(lookupId)) {
+      continue;
+    }
+    expanded.add(lookupId);
+    for (const dependency of item.dependencies) {
+      edgeKeys.add(`${lookupId}::${dependency.id.trim().toLowerCase()}::${dependency.kind}`);
+      pending.push({ id: dependency.id, depth: current.depth + 1 });
+    }
+  }
+  return {
+    node_count: nodeIds.size,
+    edge_count: edgeKeys.size,
+    missing_count: missingIds.size
+  };
+}
 async function runDeps(id, options, global2) {
   const pmRoot = resolvePmRoot(process.cwd(), global2.path);
   if (!await pathExists(getSettingsPath(pmRoot))) {
@@ -187,10 +262,26 @@ async function runDeps(id, options, global2) {
   const settings = await readSettings(pmRoot);
   const typeRegistry = resolveItemTypeRegistry(settings, getActiveExtensionRegistrations());
   const items = await listAllItemMetadataLight(pmRoot, settings.item_format, typeRegistry.type_to_folder, void 0, settings.schema);
-  const index = new Map(items.map((item) => [item.id, toIndexedItem(item)]));
-  if (!index.has(id)) {
+  const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);
+  const index = new Map(items.map((item) => [item.id.trim().toLowerCase(), toIndexedItem(item)]));
+  const dangling = collectDanglingDependencyReferences(items, (status) => isTerminalStatus(status, statusRegistry));
+  for (const reference of [...dangling.active, ...dangling.legacy_terminal]) {
+    const holder = index.get(reference.holder_id.trim().toLowerCase());
+    const referenceKind = reference.kind.trim().toLowerCase();
+    if (holder && !holder.dependencies.some((dependency) => dependency.id.trim().toLowerCase() === reference.target_id.trim().toLowerCase() && dependency.kind === referenceKind)) {
+      holder.dependencies.push({ id: reference.target_id, kind: referenceKind });
+    }
+  }
+  if (!index.has(id.trim().toLowerCase())) {
     throw new PmCliError(`Item ${id} not found`, EXIT_CODE.NOT_FOUND);
   }
+  if (summaryOnly) {
+    return {
+      id,
+      format,
+      ...countDependencyGraph(id, index, maxDepth)
+    };
+  }
   const tree = toTreeNode(id, index, /* @__PURE__ */ new Set(), maxDepth, collapse, /* @__PURE__ */ new Set());
   const graph = toGraph(tree);
   const baseResult = {
@@ -200,9 +291,6 @@ async function runDeps(id, options, global2) {
     edge_count: graph.edges.length,
     missing_count: graph.missing_ids.length
   };
-  if (summaryOnly) {
-    return baseResult;
-  }
   if (format === "tree") {
     return {
       ...baseResult,
@@ -218,6 +306,7 @@ async function runDeps(id, options, global2) {
 export {
   DEPS_FORMAT_VALUES,
   DEPS_COLLAPSE_VALUES,
+  collectDanglingDependencyReferences,
   runDeps
 };
-//# sourceMappingURL=chunk-OMT4NO7T.js.map
+//# sourceMappingURL=chunk-B5DZYTT3.js.map

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

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../../../../sdk/dependencies.ts"],
+  "sourcesContent": ["/**\n * @module sdk/dependencies\n *\n * Implements the pm deps command surface and its agent-facing runtime behavior.\n */\nimport { getActiveExtensionRegistrations } from \"../core/extensions/index.js\";\nimport { pathExists } from \"../core/fs/fs-utils.js\";\nimport { resolveItemTypeRegistry } from \"../core/item/type-registry.js\";\nimport { isTerminalStatus } from \"../core/item/status.js\";\nimport { resolveRuntimeStatusRegistry } from \"../core/schema/runtime-schema.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 { listAllItemMetadataLight } from \"../core/store/item-store.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../core/store/paths.js\";\nimport { readSettings } from \"../core/store/settings.js\";\nimport type {\n  Dependency,\n  ItemMetadata,\n  ItemStatus,\n  ItemType,\n} from \"../types/index.js\";\n\n/** Supported values accepted by the deps format contract. */\nexport const DEPS_FORMAT_VALUES = [\"tree\", \"graph\"] as const;\n/** Restricts deps format values accepted by command, SDK, and storage contracts. */\nexport type DepsFormat = (typeof DEPS_FORMAT_VALUES)[number];\n/** Supported values accepted by the deps collapse contract. */\nexport const DEPS_COLLAPSE_VALUES = [\"none\", \"repeated\"] as const;\n/** Restricts deps collapse mode values accepted by command, SDK, and storage contracts. */\nexport type DepsCollapseMode = (typeof DEPS_COLLAPSE_VALUES)[number];\n\n/** Documents the deps command options payload exchanged by command, SDK, and package integrations. */\nexport interface DepsCommandOptions {\n  /** Value that configures or reports format for this contract. */\n  format?: string;\n  /** Value that configures or reports max depth for this contract. */\n  maxDepth?: string | number;\n  /** Value that configures or reports collapse for this contract. */\n  collapse?: string;\n  /** Value that configures or reports summary for this contract. */\n  summary?: boolean;\n}\n\ninterface IndexedItem {\n  id: string;\n  title: string;\n  type: ItemType;\n  status: ItemStatus;\n  dependencies: IndexedDependency[];\n}\n\ninterface IndexedDependency {\n  id: string;\n  kind: string;\n}\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/**\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 knownIds = new Set(items.map((item) => item.id.trim().toLowerCase()));\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 = typeof target === \"string\" ? target.trim() : \"\";\n    if (\n      !normalized ||\n      [\"none\", \"null\", \"n/a\", \"na\"].includes(normalized.toLowerCase()) ||\n      knownIds.has(normalized.toLowerCase())\n    ) {\n      return;\n    }\n    const row: DanglingDependencyReference = {\n      holder_id: item.id,\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 items) {\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/** Documents the deps tree node payload exchanged by command, SDK, and package integrations. */\nexport interface DepsTreeNode {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports title for this contract. */\n  title?: string;\n  /** Schema type that determines the shape and validation rules for this value. */\n  type?: ItemType;\n  /** Lifecycle state reported for status. */\n  status?: ItemStatus;\n  /** Value that configures or reports via for this contract. */\n  via?: string;\n  /** Value that configures or reports missing for this contract. */\n  missing: boolean;\n  /** Value that configures or reports cycle for this contract. */\n  cycle: boolean;\n  /** Value that configures or reports truncated for this contract. */\n  truncated?: boolean;\n  /** Value that configures or reports collapsed for this contract. */\n  collapsed?: boolean;\n  /** Value that configures or reports dependencies for this contract. */\n  dependencies: DepsTreeNode[];\n}\n\n/** Documents the deps graph node payload exchanged by command, SDK, and package integrations. */\nexport interface DepsGraphNode {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports title for this contract. */\n  title?: string;\n  /** Schema type that determines the shape and validation rules for this value. */\n  type?: ItemType;\n  /** Lifecycle state reported for status. */\n  status?: ItemStatus;\n  /** Value that configures or reports missing for this contract. */\n  missing: boolean;\n}\n\n/** Documents the deps graph edge payload exchanged by command, SDK, and package integrations. */\nexport interface DepsGraphEdge {\n  /** Value that configures or reports from for this contract. */\n  from: string;\n  /** Value that configures or reports to for this contract. */\n  to: string;\n  /** Value that configures or reports kind for this contract. */\n  kind: string;\n}\n\n/** Documents the deps graph result payload exchanged by command, SDK, and package integrations. */\nexport interface DepsGraphResult {\n  /** Value that configures or reports root id for this contract. */\n  root_id: string;\n  /** Value that configures or reports nodes for this contract. */\n  nodes: DepsGraphNode[];\n  /** Value that configures or reports edges for this contract. */\n  edges: DepsGraphEdge[];\n  /** Value that configures or reports missing ids for this contract. */\n  missing_ids: string[];\n}\n\n/** Documents the deps result payload exchanged by command, SDK, and package integrations. */\nexport interface DepsResult {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports format for this contract. */\n  format: DepsFormat;\n  /** Number of node entries represented by this result. */\n  node_count: number;\n  /** Number of edge entries represented by this result. */\n  edge_count: number;\n  /** Number of missing entries represented by this result. */\n  missing_count: number;\n  /** Value that configures or reports tree for this contract. */\n  tree?: DepsTreeNode;\n  /** Value that configures or reports graph for this contract. */\n  graph?: DepsGraphResult;\n}\n\nfunction parseFormat(raw: string | undefined): DepsFormat {\n  const candidate = raw?.trim().toLowerCase() ?? \"tree\";\n  if ((DEPS_FORMAT_VALUES as readonly string[]).includes(candidate)) {\n    return candidate as DepsFormat;\n  }\n  throw new PmCliError(\n    `Invalid --format value \"${raw}\". Use \"tree\" or \"graph\".`,\n    EXIT_CODE.USAGE,\n  );\n}\n\nfunction parseMaxDepth(raw: string | number | undefined): number | undefined {\n  if (raw === undefined) {\n    return undefined;\n  }\n  const normalized = typeof raw === \"number\" ? raw : Number(raw.trim());\n  if (!Number.isInteger(normalized) || normalized < 0) {\n    throw new PmCliError(\n      `Invalid --max-depth value \"${raw}\". Use a non-negative integer.`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return normalized;\n}\n\nfunction parseCollapse(raw: string | undefined): DepsCollapseMode {\n  const candidate = raw?.trim().toLowerCase() ?? \"none\";\n  if ((DEPS_COLLAPSE_VALUES as readonly string[]).includes(candidate)) {\n    return candidate as DepsCollapseMode;\n  }\n  throw new PmCliError(\n    `Invalid --collapse value \"${raw}\". Use \"none\" or \"repeated\".`,\n    EXIT_CODE.USAGE,\n  );\n}\n\nfunction normalizeDependencies(\n  dependencies: Dependency[] | undefined,\n): IndexedDependency[] {\n  if (!dependencies || dependencies.length === 0) {\n    return [];\n  }\n  const sorted = dependencies.map(({ id, kind }) => ({\n    id: id.trim(),\n    kind: kind.trim().toLowerCase(),\n  })).sort((left, right) => {\n    const byKind = left.kind.localeCompare(right.kind);\n    if (byKind !== 0) return byKind;\n    return left.id.localeCompare(right.id);\n  });\n  const deduped = new Map<string, IndexedDependency>();\n  for (const dependency of sorted) {\n    const key = `${dependency.kind.toLowerCase()}::${dependency.id.toLowerCase()}`;\n    if (!deduped.has(key)) {\n      deduped.set(key, { id: dependency.id, kind: dependency.kind });\n    }\n  }\n  return [...deduped.values()];\n}\n\nfunction toIndexedItem(item: ItemMetadata): IndexedItem {\n  return {\n    id: item.id,\n    title: item.title,\n    type: item.type,\n    status: item.status,\n    dependencies: normalizeDependencies(item.dependencies),\n  };\n}\n\nfunction toTreeNode(\n  id: string,\n  index: Map<string, IndexedItem>,\n  lineage: Set<string>,\n  maxDepth: number | undefined,\n  collapse: DepsCollapseMode,\n  expanded: Set<string>,\n  depth = 0,\n  via?: string,\n): DepsTreeNode {\n  const lookupId = id.trim().toLowerCase();\n  const item = index.get(lookupId);\n  const baseNode: DepsTreeNode = {\n    id: item?.id ?? id,\n    title: item?.title,\n    type: item?.type,\n    status: item?.status,\n    via,\n    missing: !item,\n    cycle: lineage.has(lookupId),\n    dependencies: [],\n  };\n  if (!item || baseNode.cycle) {\n    return baseNode;\n  }\n  if (maxDepth !== undefined && depth >= maxDepth) {\n    if (item.dependencies.length > 0) {\n      baseNode.truncated = true;\n    }\n    return baseNode;\n  }\n  if (collapse === \"repeated\" && expanded.has(lookupId)) {\n    baseNode.collapsed = true;\n    return baseNode;\n  }\n  if (collapse === \"repeated\") {\n    expanded.add(lookupId);\n  }\n  const nextLineage = new Set(lineage);\n  nextLineage.add(lookupId);\n  baseNode.dependencies = item.dependencies.map((dependency) =>\n    toTreeNode(\n      dependency.id,\n      index,\n      nextLineage,\n      maxDepth,\n      collapse,\n      expanded,\n      depth + 1,\n      dependency.kind,\n    ),\n  );\n  return baseNode;\n}\n\nfunction mergeGraphNode(\n  existing: DepsGraphNode | undefined,\n  candidate: DepsGraphNode,\n): DepsGraphNode {\n  if (!existing) {\n    return candidate;\n  }\n  /* c8 ignore start -- defensive: mixed missing/non-missing duplicates only occur in malformed synthetic trees. */\n  if (existing.missing && !candidate.missing) return candidate;\n  /* c8 ignore stop */\n  return {\n    ...existing,\n    title: existing.title ?? candidate.title,\n    type: existing.type ?? candidate.type,\n    status: existing.status ?? candidate.status,\n  };\n}\n\nfunction toGraph(root: DepsTreeNode): DepsGraphResult {\n  const nodesById = new Map<string, DepsGraphNode>();\n  const edgesByKey = new Map<string, DepsGraphEdge>();\n\n  const visit = (node: DepsTreeNode): void => {\n    nodesById.set(\n      node.id,\n      mergeGraphNode(nodesById.get(node.id), {\n        id: node.id,\n        title: node.title,\n        type: node.type,\n        status: node.status,\n        missing: node.missing,\n      }),\n    );\n    for (const child of node.dependencies) {\n      nodesById.set(\n        child.id,\n        mergeGraphNode(nodesById.get(child.id), {\n          id: child.id,\n          title: child.title,\n          type: child.type,\n          status: child.status,\n          missing: child.missing,\n        }),\n      );\n      /* c8 ignore start -- legacy malformed dependency payloads may omit kind/via. */\n      const relationKind = child.via ?? \"related\";\n      const edgeKey = `${node.id}::${child.id}::${relationKind}`;\n      if (!edgesByKey.has(edgeKey)) {\n        edgesByKey.set(edgeKey, {\n          from: node.id,\n          to: child.id,\n          kind: relationKind,\n        });\n      }\n      /* c8 ignore stop */\n      if (!child.cycle) {\n        visit(child);\n      }\n    }\n  };\n\n  visit(root);\n\n  const nodes = [...nodesById.values()].sort((left, right) =>\n    left.id.localeCompare(right.id),\n  );\n  const edges = [...edgesByKey.values()].sort((left, right) => {\n    const byFrom = left.from.localeCompare(right.from);\n    if (byFrom !== 0) return byFrom;\n    const byTo = left.to.localeCompare(right.to);\n    if (byTo !== 0) return byTo;\n    return left.kind.localeCompare(right.kind);\n  });\n  const missingIds = nodes\n    .filter((node) => node.missing)\n    .map((node) => node.id);\n  return {\n    root_id: root.id,\n    nodes,\n    edges,\n    missing_ids: missingIds,\n  };\n}\n\n/** Count a dependency result without allocating its potentially exponential tree payload. */\nfunction countDependencyGraph(\n  rootId: string,\n  index: Map<string, IndexedItem>,\n  maxDepth: number | undefined,\n): Pick<DepsResult, \"node_count\" | \"edge_count\" | \"missing_count\"> {\n  const nodeIds = new Set<string>();\n  const edgeKeys = new Set<string>();\n  const missingIds = new Set<string>();\n  const expanded = new Set<string>();\n  const pending = [{ id: rootId, depth: 0 }];\n  let pendingIndex = 0;\n  while (pendingIndex < pending.length) {\n    const current = pending[pendingIndex++]!;\n    const lookupId = current.id.trim().toLowerCase();\n    nodeIds.add(lookupId);\n    const item = index.get(lookupId);\n    if (!item) {\n      missingIds.add(lookupId);\n      continue;\n    }\n    if (maxDepth !== undefined && current.depth >= maxDepth) {\n      continue;\n    }\n    if (expanded.has(lookupId)) {\n      continue;\n    }\n    expanded.add(lookupId);\n    for (const dependency of item.dependencies) {\n      edgeKeys.add(\n        `${lookupId}::${dependency.id.trim().toLowerCase()}::${dependency.kind}`,\n      );\n      pending.push({ id: dependency.id, depth: current.depth + 1 });\n    }\n  }\n  return {\n    node_count: nodeIds.size,\n    edge_count: edgeKeys.size,\n    missing_count: missingIds.size,\n  };\n}\n\n/** Implements run deps for the public runtime surface of this module. */\nexport async function runDeps(\n  id: string,\n  options: DepsCommandOptions,\n  global: GlobalOptions,\n): Promise<DepsResult> {\n  const pmRoot = resolvePmRoot(process.cwd(), global.path);\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 format = parseFormat(options.format);\n  const maxDepth = parseMaxDepth(options.maxDepth);\n  const collapse = parseCollapse(options.collapse);\n  const summaryOnly = options.summary === true;\n  const settings = await readSettings(pmRoot);\n  const typeRegistry = resolveItemTypeRegistry(\n    settings,\n    getActiveExtensionRegistrations(),\n  );\n  const items = await listAllItemMetadataLight(\n    pmRoot,\n    settings.item_format,\n    typeRegistry.type_to_folder,\n    undefined,\n    settings.schema,\n  );\n  const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);\n  const index = new Map(\n    items.map((item) => [item.id.trim().toLowerCase(), toIndexedItem(item)]),\n  );\n  const dangling = collectDanglingDependencyReferences(\n    items,\n    (status) => isTerminalStatus(status, statusRegistry),\n  );\n  for (const reference of [...dangling.active, ...dangling.legacy_terminal]) {\n    const holder = index.get(reference.holder_id.trim().toLowerCase());\n    const referenceKind = reference.kind.trim().toLowerCase();\n    if (\n      holder &&\n      !holder.dependencies.some(\n        (dependency) =>\n          dependency.id.trim().toLowerCase() === reference.target_id.trim().toLowerCase() &&\n          dependency.kind === referenceKind,\n      )\n    ) {\n      holder.dependencies.push({ id: reference.target_id, kind: referenceKind });\n    }\n  }\n  if (!index.has(id.trim().toLowerCase())) {\n    throw new PmCliError(`Item ${id} not found`, EXIT_CODE.NOT_FOUND);\n  }\n\n  if (summaryOnly) {\n    return {\n      id,\n      format,\n      ...countDependencyGraph(id, index, maxDepth),\n    };\n  }\n\n  const tree = toTreeNode(\n    id,\n    index,\n    new Set<string>(),\n    maxDepth,\n    collapse,\n    new Set<string>(),\n  );\n  const graph = toGraph(tree);\n  const baseResult = {\n    id,\n    format,\n    node_count: graph.nodes.length,\n    edge_count: graph.edges.length,\n    missing_count: graph.missing_ids.length,\n  };\n  if (format === \"tree\") {\n    return {\n      ...baseResult,\n      tree,\n    };\n  }\n  return {\n    ...baseResult,\n    graph,\n  };\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;AAwBO,IAAM,qBAAqB,CAAC,QAAQ,OAAO;AAI3C,IAAM,uBAAuB,CAAC,QAAQ,UAAU;AAiFjD,SAAU,oCACd,OACA,aAA8C,CAAC,WAC7C,WAAW,YAAY,WAAW,YAAU;AAE9C,QAAM,WAAW,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,KAAK,GAAG,KAAI,EAAG,YAAW,CAAE,CAAC;AAC1E,QAAM,OAAO,oBAAI,IAAG;AACpB,QAAM,eAAe,CACnB,MACA,QACA,MACA,WACQ;AACR,UAAM,aAAa,OAAO,WAAW,WAAW,OAAO,KAAI,IAAK;AAChE,QACE,CAAC,cACD,CAAC,QAAQ,QAAQ,OAAO,IAAI,EAAE,SAAS,WAAW,YAAW,CAAE,KAC/D,SAAS,IAAI,WAAW,YAAW,CAAE,GACrC;AACA;IACF;AACA,UAAM,MAAmC;MACvC,WAAW,KAAK;MAChB,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,OAAO;AACxB,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;AAgFA,SAAS,YAAY,KAAuB;AAC1C,QAAM,YAAY,KAAK,KAAI,EAAG,YAAW,KAAM;AAC/C,MAAK,mBAAyC,SAAS,SAAS,GAAG;AACjE,WAAO;EACT;AACA,QAAM,IAAI,WACR,2BAA2B,GAAG,6BAC9B,UAAU,KAAK;AAEnB;AAEA,SAAS,cAAc,KAAgC;AACrD,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,aAAa,OAAO,QAAQ,WAAW,MAAM,OAAO,IAAI,KAAI,CAAE;AACpE,MAAI,CAAC,OAAO,UAAU,UAAU,KAAK,aAAa,GAAG;AACnD,UAAM,IAAI,WACR,8BAA8B,GAAG,kCACjC,UAAU,KAAK;EAEnB;AACA,SAAO;AACT;AAEA,SAAS,cAAc,KAAuB;AAC5C,QAAM,YAAY,KAAK,KAAI,EAAG,YAAW,KAAM;AAC/C,MAAK,qBAA2C,SAAS,SAAS,GAAG;AACnE,WAAO;EACT;AACA,QAAM,IAAI,WACR,6BAA6B,GAAG,gCAChC,UAAU,KAAK;AAEnB;AAEA,SAAS,sBACP,cAAsC;AAEtC,MAAI,CAAC,gBAAgB,aAAa,WAAW,GAAG;AAC9C,WAAO,CAAA;EACT;AACA,QAAM,SAAS,aAAa,IAAI,CAAC,EAAE,IAAI,KAAI,OAAQ;IACjD,IAAI,GAAG,KAAI;IACX,MAAM,KAAK,KAAI,EAAG,YAAW;IAC7B,EAAE,KAAK,CAAC,MAAM,UAAS;AACvB,UAAM,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AACjD,QAAI,WAAW;AAAG,aAAO;AACzB,WAAO,KAAK,GAAG,cAAc,MAAM,EAAE;EACvC,CAAC;AACD,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,cAAc,QAAQ;AAC/B,UAAM,MAAM,GAAG,WAAW,KAAK,YAAW,CAAE,KAAK,WAAW,GAAG,YAAW,CAAE;AAC5E,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,KAAK,EAAE,IAAI,WAAW,IAAI,MAAM,WAAW,KAAI,CAAE;IAC/D;EACF;AACA,SAAO,CAAC,GAAG,QAAQ,OAAM,CAAE;AAC7B;AAEA,SAAS,cAAc,MAAkB;AACvC,SAAO;IACL,IAAI,KAAK;IACT,OAAO,KAAK;IACZ,MAAM,KAAK;IACX,QAAQ,KAAK;IACb,cAAc,sBAAsB,KAAK,YAAY;;AAEzD;AAEA,SAAS,WACP,IACA,OACA,SACA,UACA,UACA,UACA,QAAQ,GACR,KAAY;AAEZ,QAAM,WAAW,GAAG,KAAI,EAAG,YAAW;AACtC,QAAM,OAAO,MAAM,IAAI,QAAQ;AAC/B,QAAM,WAAyB;IAC7B,IAAI,MAAM,MAAM;IAChB,OAAO,MAAM;IACb,MAAM,MAAM;IACZ,QAAQ,MAAM;IACd;IACA,SAAS,CAAC;IACV,OAAO,QAAQ,IAAI,QAAQ;IAC3B,cAAc,CAAA;;AAEhB,MAAI,CAAC,QAAQ,SAAS,OAAO;AAC3B,WAAO;EACT;AACA,MAAI,aAAa,UAAa,SAAS,UAAU;AAC/C,QAAI,KAAK,aAAa,SAAS,GAAG;AAChC,eAAS,YAAY;IACvB;AACA,WAAO;EACT;AACA,MAAI,aAAa,cAAc,SAAS,IAAI,QAAQ,GAAG;AACrD,aAAS,YAAY;AACrB,WAAO;EACT;AACA,MAAI,aAAa,YAAY;AAC3B,aAAS,IAAI,QAAQ;EACvB;AACA,QAAM,cAAc,IAAI,IAAI,OAAO;AACnC,cAAY,IAAI,QAAQ;AACxB,WAAS,eAAe,KAAK,aAAa,IAAI,CAAC,eAC7C,WACE,WAAW,IACX,OACA,aACA,UACA,UACA,UACA,QAAQ,GACR,WAAW,IAAI,CAChB;AAEH,SAAO;AACT;AAEA,SAAS,eACP,UACA,WAAwB;AAExB,MAAI,CAAC,UAAU;AACb,WAAO;EACT;AAEA,MAAI,SAAS,WAAW,CAAC,UAAU;AAAS,WAAO;AAEnD,SAAO;IACL,GAAG;IACH,OAAO,SAAS,SAAS,UAAU;IACnC,MAAM,SAAS,QAAQ,UAAU;IACjC,QAAQ,SAAS,UAAU,UAAU;;AAEzC;AAEA,SAAS,QAAQ,MAAkB;AACjC,QAAM,YAAY,oBAAI,IAAG;AACzB,QAAM,aAAa,oBAAI,IAAG;AAE1B,QAAM,QAAQ,CAAC,SAA4B;AACzC,cAAU,IACR,KAAK,IACL,eAAe,UAAU,IAAI,KAAK,EAAE,GAAG;MACrC,IAAI,KAAK;MACT,OAAO,KAAK;MACZ,MAAM,KAAK;MACX,QAAQ,KAAK;MACb,SAAS,KAAK;KACf,CAAC;AAEJ,eAAW,SAAS,KAAK,cAAc;AACrC,gBAAU,IACR,MAAM,IACN,eAAe,UAAU,IAAI,MAAM,EAAE,GAAG;QACtC,IAAI,MAAM;QACV,OAAO,MAAM;QACb,MAAM,MAAM;QACZ,QAAQ,MAAM;QACd,SAAS,MAAM;OAChB,CAAC;AAGJ,YAAM,eAAe,MAAM,OAAO;AAClC,YAAM,UAAU,GAAG,KAAK,EAAE,KAAK,MAAM,EAAE,KAAK,YAAY;AACxD,UAAI,CAAC,WAAW,IAAI,OAAO,GAAG;AAC5B,mBAAW,IAAI,SAAS;UACtB,MAAM,KAAK;UACX,IAAI,MAAM;UACV,MAAM;SACP;MACH;AAEA,UAAI,CAAC,MAAM,OAAO;AAChB,cAAM,KAAK;MACb;IACF;EACF;AAEA,QAAM,IAAI;AAEV,QAAM,QAAQ,CAAC,GAAG,UAAU,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAChD,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AAEjC,QAAM,QAAQ,CAAC,GAAG,WAAW,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAAS;AAC1D,UAAM,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AACjD,QAAI,WAAW;AAAG,aAAO;AACzB,UAAM,OAAO,KAAK,GAAG,cAAc,MAAM,EAAE;AAC3C,QAAI,SAAS;AAAG,aAAO;AACvB,WAAO,KAAK,KAAK,cAAc,MAAM,IAAI;EAC3C,CAAC;AACD,QAAM,aAAa,MAChB,OAAO,CAAC,SAAS,KAAK,OAAO,EAC7B,IAAI,CAAC,SAAS,KAAK,EAAE;AACxB,SAAO;IACL,SAAS,KAAK;IACd;IACA;IACA,aAAa;;AAEjB;AAGA,SAAS,qBACP,QACA,OACA,UAA4B;AAE5B,QAAM,UAAU,oBAAI,IAAG;AACvB,QAAM,WAAW,oBAAI,IAAG;AACxB,QAAM,aAAa,oBAAI,IAAG;AAC1B,QAAM,WAAW,oBAAI,IAAG;AACxB,QAAM,UAAU,CAAC,EAAE,IAAI,QAAQ,OAAO,EAAC,CAAE;AACzC,MAAI,eAAe;AACnB,SAAO,eAAe,QAAQ,QAAQ;AACpC,UAAM,UAAU,QAAQ,cAAc;AACtC,UAAM,WAAW,QAAQ,GAAG,KAAI,EAAG,YAAW;AAC9C,YAAQ,IAAI,QAAQ;AACpB,UAAM,OAAO,MAAM,IAAI,QAAQ;AAC/B,QAAI,CAAC,MAAM;AACT,iBAAW,IAAI,QAAQ;AACvB;IACF;AACA,QAAI,aAAa,UAAa,QAAQ,SAAS,UAAU;AACvD;IACF;AACA,QAAI,SAAS,IAAI,QAAQ,GAAG;AAC1B;IACF;AACA,aAAS,IAAI,QAAQ;AACrB,eAAW,cAAc,KAAK,cAAc;AAC1C,eAAS,IACP,GAAG,QAAQ,KAAK,WAAW,GAAG,KAAI,EAAG,YAAW,CAAE,KAAK,WAAW,IAAI,EAAE;AAE1E,cAAQ,KAAK,EAAE,IAAI,WAAW,IAAI,OAAO,QAAQ,QAAQ,EAAC,CAAE;IAC9D;EACF;AACA,SAAO;IACL,YAAY,QAAQ;IACpB,YAAY,SAAS;IACrB,eAAe,WAAW;;AAE9B;AAGA,eAAsB,QACpB,IACA,SACAA,SAAqB;AAErB,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAIA,QAAO,IAAI;AACvD,MAAI,CAAE,MAAM,WAAW,gBAAgB,MAAM,CAAC,GAAI;AAChD,UAAM,IAAI,WACR,iCAAiC,MAAM,wBACvC,UAAU,SAAS;EAEvB;AACA,QAAM,SAAS,YAAY,QAAQ,MAAM;AACzC,QAAM,WAAW,cAAc,QAAQ,QAAQ;AAC/C,QAAM,WAAW,cAAc,QAAQ,QAAQ;AAC/C,QAAM,cAAc,QAAQ,YAAY;AACxC,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,eAAe,wBACnB,UACA,gCAA+B,CAAE;AAEnC,QAAM,QAAQ,MAAM,yBAClB,QACA,SAAS,aACT,aAAa,gBACb,QACA,SAAS,MAAM;AAEjB,QAAM,iBAAiB,6BAA6B,SAAS,MAAM;AACnE,QAAM,QAAQ,IAAI,IAChB,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,KAAI,EAAG,YAAW,GAAI,cAAc,IAAI,CAAC,CAAC,CAAC;AAE1E,QAAM,WAAW,oCACf,OACA,CAAC,WAAW,iBAAiB,QAAQ,cAAc,CAAC;AAEtD,aAAW,aAAa,CAAC,GAAG,SAAS,QAAQ,GAAG,SAAS,eAAe,GAAG;AACzE,UAAM,SAAS,MAAM,IAAI,UAAU,UAAU,KAAI,EAAG,YAAW,CAAE;AACjE,UAAM,gBAAgB,UAAU,KAAK,KAAI,EAAG,YAAW;AACvD,QACE,UACA,CAAC,OAAO,aAAa,KACnB,CAAC,eACC,WAAW,GAAG,KAAI,EAAG,YAAW,MAAO,UAAU,UAAU,KAAI,EAAG,YAAW,KAC7E,WAAW,SAAS,aAAa,GAErC;AACA,aAAO,aAAa,KAAK,EAAE,IAAI,UAAU,WAAW,MAAM,cAAa,CAAE;IAC3E;EACF;AACA,MAAI,CAAC,MAAM,IAAI,GAAG,KAAI,EAAG,YAAW,CAAE,GAAG;AACvC,UAAM,IAAI,WAAW,QAAQ,EAAE,cAAc,UAAU,SAAS;EAClE;AAEA,MAAI,aAAa;AACf,WAAO;MACL;MACA;MACA,GAAG,qBAAqB,IAAI,OAAO,QAAQ;;EAE/C;AAEA,QAAM,OAAO,WACX,IACA,OACA,oBAAI,IAAG,GACP,UACA,UACA,oBAAI,IAAG,CAAU;AAEnB,QAAM,QAAQ,QAAQ,IAAI;AAC1B,QAAM,aAAa;IACjB;IACA;IACA,YAAY,MAAM,MAAM;IACxB,YAAY,MAAM,MAAM;IACxB,eAAe,MAAM,YAAY;;AAEnC,MAAI,WAAW,QAAQ;AACrB,WAAO;MACL,GAAG;MACH;;EAEJ;AACA,SAAO;IACL,GAAG;IACH;;AAEJ;",
+  "names": ["global"]
+}

package/dist/cli-bundle/chunks/chunk-B7SWOIP6.js

@@ -0,0 +1,5 @@
+
+!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]="45eac7fa-f181-5cca-93b7-cfb58909dbb3")}catch(e){}}();
+//# sourceMappingURL=chunk-B7SWOIP6.js.map
+
+//# debugId=45eac7fa-f181-5cca-93b7-cfb58909dbb3

package/dist/cli-bundle/chunks/{chunk-D2LXG7WX.js → chunk-BN62TO2S.js}

@@ -1,11 +1,11 @@
 
-!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]="8d9b64ca-807b-5ee8-94dd-5700335cdbcd")}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]="db3e4dc9-8bda-5f4e-bf43-3c1ce147c9a2")}catch(e){}}();
 import {
   renameArtifactsResultKey,
   runLinkedArtifacts
-} from "./chunk-FCVVMAEX.js";
+} from "./chunk-P6MYFH6K.js";
 
-// dist/cli/commands/docs.js
+// dist/sdk/docs.js
 async function runDocs(id, options, global) {
   const result = await runLinkedArtifacts(id, options, global, {
     metadataKey: "docs",
@@ -19,6 +19,6 @@ async function runDocs(id, options, global) {
 export {
   runDocs
 };
-//# sourceMappingURL=chunk-D2LXG7WX.js.map
+//# sourceMappingURL=chunk-BN62TO2S.js.map
 
-//# debugId=8d9b64ca-807b-5ee8-94dd-5700335cdbcd
+//# debugId=db3e4dc9-8bda-5f4e-bf43-3c1ce147c9a2

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../../sdk/docs.ts"],"sourcesContent":["/**\n * @module sdk/docs\n *\n * Implements the pm docs command surface and its agent-facing runtime behavior.\n */\nimport type { GlobalOptions } from \"../core/shared/command-types.js\";\nimport type { LinkedDoc } from \"../types/index.js\";\nimport {\n  renameArtifactsResultKey,\n  runLinkedArtifacts,\n  type LinkedArtifactResult,\n  type LinkedPathValidation,\n} from \"./linked-artifacts.js\";\n\n/** Documents the docs command options payload exchanged by command, SDK, and package integrations. */\nexport interface DocsCommandOptions {\n  /** Value that configures or reports add for this contract. */\n  add?: string[];\n  /** Value that configures or reports add glob for this contract. */\n  addGlob?: string[];\n  /** Value that configures or reports remove for this contract. */\n  remove?: string[];\n  /** Value that configures or reports migrate for this contract. */\n  migrate?: string[];\n  /** GH-170 (pm-pfnx): standalone note applied to every --add/--add-glob link in this invocation. */\n  note?: string;\n  /** Value that configures or reports list for this contract. */\n  list?: boolean;\n  /** Value that configures or reports validate paths for this contract. */\n  validatePaths?: boolean;\n  /** Value that configures or reports author for this contract. */\n  author?: string;\n  /** Human-readable explanation suitable for logs and agent-facing output. */\n  message?: string;\n  /** Value that configures or reports force for this contract. */\n  force?: boolean;\n}\n\n/** Documents the docs result payload exchanged by command, SDK, and package integrations. */\nexport interface DocsResult {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports docs for this contract. */\n  docs: LinkedDoc[];\n  /** Value that configures or reports changed for this contract. */\n  changed: boolean;\n  /** Value that configures or reports count for this contract. */\n  count: number;\n  /** Value that configures or reports migrations applied for this contract. */\n  migrations_applied?: number;\n  /** Value that configures or reports validation for this contract. */\n  validation?: LinkedPathValidation;\n}\n\n/** Implements run docs for the public runtime surface of this module. */\nexport async function runDocs(\n  id: string,\n  options: DocsCommandOptions,\n  global: GlobalOptions,\n): Promise<DocsResult> {\n  const result: LinkedArtifactResult = await runLinkedArtifacts(\n    id,\n    options,\n    global,\n    {\n      metadataKey: \"docs\",\n      op: \"docs_add\",\n      bareNoun: \"doc\",\n      supportsAppendStable: false,\n    },\n  );\n  return renameArtifactsResultKey(result, \"docs\");\n}\n"],"names":[],"mappings":";;;;;;;;AAuDA,eAAsB,QACpB,IACA,SACA,QAAqB;AAErB,QAAM,SAA+B,MAAM,mBACzC,IACA,SACA,QACA;IACE,aAAa;IACb,IAAI;IACJ,UAAU;IACV,sBAAsB;GACvB;AAEH,SAAO,yBAAyB,QAAQ,MAAM;AAChD","debugId":"db3e4dc9-8bda-5f4e-bf43-3c1ce147c9a2"}