@unbrained/pm-cli 2026.6.11 → 2026.6.13

package/dist/core/validate/fix-planning.d.ts

@@ -0,0 +1,130 @@
+/**
+ * Fix planning for `pm validate --auto-fix` / `--prune-missing` (pm-c3sz,
+ * pm-8jss, pm-0v2m).
+ *
+ * Pure module: planners turn check findings into declarative
+ * {@link ValidateFixRecord}s; the validate command decides whether to apply
+ * them (apply mode), preview them (`--dry-run`), or withhold gated fixes
+ * (lifecycle structural changes require an explicit `--fix-scope lifecycle`).
+ *
+ * Safety invariants:
+ * - Every planned fix is deterministic and non-destructive: it only sets a
+ *   derivable field value or removes a stale LINK (never a real file).
+ * - No fix ever closes, deletes, or cancels an item.
+ * - Lifecycle fixes (reparent / unset parent) are structural, so they are
+ *   planned with `gate: "lifecycle"` and only applied when that scope was
+ *   explicitly granted.
+ */
+export type ValidateFixCheck = "metadata" | "resolution" | "lifecycle" | "files";
+export type ValidateFixKind = "set_resolution" | "set_close_reason" | "reparent" | "unset_parent" | "prune_file_link" | "prune_doc_link";
+export type ValidateFixScope = "metadata" | "resolution" | "lifecycle";
+/** Scopes auto-applied without an explicit `--fix-scope` (safe field backfills). */
+export declare const DEFAULT_GRANTED_FIX_SCOPES: readonly ValidateFixScope[];
+/** Scopes accepted by `--fix-scope` (lifecycle is the opt-in structural scope). */
+export declare const SUPPORTED_FIX_SCOPES: readonly ValidateFixScope[];
+export interface ValidateFixRecord {
+    /** Item the fix targets. */
+    item_id: string;
+    /** Validate check the finding came from. */
+    check: ValidateFixCheck;
+    /** Front-matter field (or link list) the fix changes. */
+    field: string;
+    /** Declarative fix kind the applier dispatches on. */
+    kind: ValidateFixKind;
+    /** Equivalent standalone `pm` command for the fix. */
+    command: string;
+    /** New value for set-field fixes. */
+    value?: string;
+    /** Stale link path for prune fixes. */
+    path?: string;
+    /** Target parent id for reparent fixes. */
+    parent_id?: string;
+    /**
+     * Fix scope the `--fix-scope` allowlist must grant for the fix to be
+     * applied. Every `--auto-fix` record carries one (the granted default is
+     * metadata+resolution; lifecycle must be named explicitly). Absent only on
+     * `--prune-missing` records, which are governed by their own flag.
+     */
+    gate?: ValidateFixScope;
+}
+/** Default resolution backfilled onto closed items with no derivable source text. */
+export declare const DEFAULT_RESOLUTION_BACKFILL_VALUE = "completed";
+export interface ResolutionBackfillRow {
+    id: string;
+    /** Resolution-check missing field keys for this closed item. */
+    missing_fields: readonly string[];
+    /** The item's close_reason, when present (preferred derivation source). */
+    close_reason?: string;
+}
+/**
+ * Plan resolution backfills for closed items flagged by the resolution check.
+ * Only the `resolution` field is mechanical enough to auto-fix: it derives
+ * from the item's own `close_reason` when present and falls back to the
+ * `"completed"` default. `expected_result` / `actual_result` stay hint-only —
+ * no deterministic source text exists for them.
+ */
+export declare function planResolutionBackfillFixes(rows: readonly ResolutionBackfillRow[]): ValidateFixRecord[];
+export interface CloseReasonBackfillRow {
+    id: string;
+    /** The item's resolution, when present (the only derivation source). */
+    resolution?: string;
+}
+/**
+ * Plan close_reason backfills for closed items flagged by the metadata check.
+ * Only derivable when the item already carries a resolution; items missing
+ * both stay hint-only (any synthesized reason would be fabricated, not
+ * derived).
+ */
+export declare function planCloseReasonBackfillFixes(rows: readonly CloseReasonBackfillRow[]): ValidateFixRecord[];
+export interface TerminalParentFixRow {
+    id: string;
+    parent_id: string;
+    /** The terminal parent's own parent, when one exists. */
+    grandparent_id?: string;
+    /** True when the grandparent exists and is NOT terminal (safe reparent target). */
+    grandparent_active?: boolean;
+}
+/**
+ * Plan lifecycle fixes for active items whose parent is terminal (pm-8jss /
+ * GH-168). When the terminal parent has an active grandparent, the child is
+ * reparented one level up (it stays inside the same hierarchy); otherwise the
+ * parent link is cleared so the item surfaces as unparented active work.
+ * Either way the item itself is never closed or mutated beyond `parent` —
+ * and every fix carries `gate: "lifecycle"` so it is only applied under an
+ * explicit `--fix-scope lifecycle`.
+ */
+export declare function planTerminalParentFixes(rows: readonly TerminalParentFixRow[]): ValidateFixRecord[];
+export interface StaleLinkPruneRow {
+    item_id: string;
+    path: string;
+    link_kind: "files" | "docs";
+    classification: "moved" | "deleted";
+}
+/**
+ * Plan link prunes for `--prune-missing` (pm-0v2m / GH-184). Only links whose
+ * stale path classified as `deleted` are pruned; `moved` links keep their
+ * relink candidates in the files-check details instead of being dropped, so
+ * recoverable link information is never destroyed. Link removal only — real
+ * files are never touched.
+ */
+export declare function planStaleLinkPruneFixes(rows: readonly StaleLinkPruneRow[]): ValidateFixRecord[];
+/**
+ * Resolve the granted `--fix-scope` set (repeatable and/or comma-separated).
+ * With no explicit scopes the safe field-backfill scopes (metadata,
+ * resolution) are granted; lifecycle must always be named explicitly. Unknown
+ * values fail fast with the supported list.
+ */
+export declare function resolveGrantedFixScopes(rawScopes: readonly string[] | undefined): Set<ValidateFixScope>;
+/**
+ * Split a fix plan into the records that may be applied under the granted
+ * scopes and the gated records that were withheld. `--fix-scope` is an exact
+ * allowlist: every `--auto-fix` record requires its gate scope in `granted`.
+ * Ungated records (`--prune-missing` link prunes, governed by their own flag)
+ * are always applicable.
+ */
+export declare function partitionFixesByGrant(fixes: readonly ValidateFixRecord[], granted: ReadonlySet<ValidateFixScope>): {
+    applicable: ValidateFixRecord[];
+    gated: ValidateFixRecord[];
+};
+/** Compact serialization of a fix for planned/applied output rows. */
+export declare function toFixOutputRow(fix: ValidateFixRecord): Record<string, unknown>;

package/dist/core/validate/fix-planning.js

@@ -0,0 +1,202 @@
+/**
+ * Fix planning for `pm validate --auto-fix` / `--prune-missing` (pm-c3sz,
+ * pm-8jss, pm-0v2m).
+ *
+ * Pure module: planners turn check findings into declarative
+ * {@link ValidateFixRecord}s; the validate command decides whether to apply
+ * them (apply mode), preview them (`--dry-run`), or withhold gated fixes
+ * (lifecycle structural changes require an explicit `--fix-scope lifecycle`).
+ *
+ * Safety invariants:
+ * - Every planned fix is deterministic and non-destructive: it only sets a
+ *   derivable field value or removes a stale LINK (never a real file).
+ * - No fix ever closes, deletes, or cancels an item.
+ * - Lifecycle fixes (reparent / unset parent) are structural, so they are
+ *   planned with `gate: "lifecycle"` and only applied when that scope was
+ *   explicitly granted.
+ */
+
+!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]="7163fbbf-1a9c-52e0-a1d5-6034abefc50f")}catch(e){}}();
+import { EXIT_CODE } from "../shared/constants.js";
+import { PmCliError } from "../shared/errors.js";
+/** Scopes auto-applied without an explicit `--fix-scope` (safe field backfills). */
+export const DEFAULT_GRANTED_FIX_SCOPES = ["metadata", "resolution"];
+/** Scopes accepted by `--fix-scope` (lifecycle is the opt-in structural scope). */
+export const SUPPORTED_FIX_SCOPES = ["metadata", "resolution", "lifecycle"];
+/** Default resolution backfilled onto closed items with no derivable source text. */
+export const DEFAULT_RESOLUTION_BACKFILL_VALUE = "completed";
+function quoteForCommand(value) {
+    return `"${value.replaceAll("\\", "\\\\").replaceAll('"', '\\"')}"`;
+}
+function toMeaningfulValue(value) {
+    const trimmed = value?.trim();
+    return trimmed !== undefined && trimmed.length > 0 ? trimmed : undefined;
+}
+/**
+ * Plan resolution backfills for closed items flagged by the resolution check.
+ * Only the `resolution` field is mechanical enough to auto-fix: it derives
+ * from the item's own `close_reason` when present and falls back to the
+ * `"completed"` default. `expected_result` / `actual_result` stay hint-only —
+ * no deterministic source text exists for them.
+ */
+export function planResolutionBackfillFixes(rows) {
+    const fixes = [];
+    for (const row of rows) {
+        if (!row.missing_fields.includes("resolution")) {
+            continue;
+        }
+        const value = toMeaningfulValue(row.close_reason) ?? DEFAULT_RESOLUTION_BACKFILL_VALUE;
+        fixes.push({
+            item_id: row.id,
+            check: "resolution",
+            field: "resolution",
+            kind: "set_resolution",
+            value,
+            command: `pm update ${row.id} --resolution ${quoteForCommand(value)}`,
+            gate: "resolution",
+        });
+    }
+    return fixes;
+}
+/**
+ * Plan close_reason backfills for closed items flagged by the metadata check.
+ * Only derivable when the item already carries a resolution; items missing
+ * both stay hint-only (any synthesized reason would be fabricated, not
+ * derived).
+ */
+export function planCloseReasonBackfillFixes(rows) {
+    const fixes = [];
+    for (const row of rows) {
+        const value = toMeaningfulValue(row.resolution);
+        if (value === undefined) {
+            continue;
+        }
+        fixes.push({
+            item_id: row.id,
+            check: "metadata",
+            field: "close_reason",
+            kind: "set_close_reason",
+            value,
+            command: `pm update ${row.id} --close-reason ${quoteForCommand(value)}`,
+            gate: "metadata",
+        });
+    }
+    return fixes;
+}
+/**
+ * Plan lifecycle fixes for active items whose parent is terminal (pm-8jss /
+ * GH-168). When the terminal parent has an active grandparent, the child is
+ * reparented one level up (it stays inside the same hierarchy); otherwise the
+ * parent link is cleared so the item surfaces as unparented active work.
+ * Either way the item itself is never closed or mutated beyond `parent` —
+ * and every fix carries `gate: "lifecycle"` so it is only applied under an
+ * explicit `--fix-scope lifecycle`.
+ */
+export function planTerminalParentFixes(rows) {
+    return rows.map((row) => {
+        if (row.grandparent_id !== undefined && row.grandparent_active === true) {
+            return {
+                item_id: row.id,
+                check: "lifecycle",
+                field: "parent",
+                kind: "reparent",
+                parent_id: row.grandparent_id,
+                command: `pm update ${row.id} --parent ${row.grandparent_id}`,
+                gate: "lifecycle",
+            };
+        }
+        return {
+            item_id: row.id,
+            check: "lifecycle",
+            field: "parent",
+            kind: "unset_parent",
+            command: `pm update ${row.id} --unset parent`,
+            gate: "lifecycle",
+        };
+    });
+}
+/**
+ * Plan link prunes for `--prune-missing` (pm-0v2m / GH-184). Only links whose
+ * stale path classified as `deleted` are pruned; `moved` links keep their
+ * relink candidates in the files-check details instead of being dropped, so
+ * recoverable link information is never destroyed. Link removal only — real
+ * files are never touched.
+ */
+export function planStaleLinkPruneFixes(rows) {
+    const fixes = [];
+    for (const row of rows) {
+        if (row.classification !== "deleted") {
+            continue;
+        }
+        const noun = row.link_kind === "files" ? "files" : "docs";
+        fixes.push({
+            item_id: row.item_id,
+            check: "files",
+            field: row.link_kind,
+            kind: row.link_kind === "files" ? "prune_file_link" : "prune_doc_link",
+            path: row.path,
+            command: `pm ${noun} ${row.item_id} --remove ${quoteForCommand(row.path)}`,
+        });
+    }
+    return fixes;
+}
+/**
+ * Resolve the granted `--fix-scope` set (repeatable and/or comma-separated).
+ * With no explicit scopes the safe field-backfill scopes (metadata,
+ * resolution) are granted; lifecycle must always be named explicitly. Unknown
+ * values fail fast with the supported list.
+ */
+export function resolveGrantedFixScopes(rawScopes) {
+    const tokens = (rawScopes ?? [])
+        .flatMap((raw) => raw.split(","))
+        .map((raw) => raw.trim())
+        .filter((raw) => raw.length > 0);
+    if (tokens.length === 0) {
+        if (rawScopes !== undefined && rawScopes.length > 0) {
+            throw new PmCliError(`--fix-scope values must not be empty. Supported values: ${SUPPORTED_FIX_SCOPES.join(", ")}.`, EXIT_CODE.USAGE);
+        }
+        return new Set(DEFAULT_GRANTED_FIX_SCOPES);
+    }
+    const granted = new Set();
+    for (const raw of tokens) {
+        const normalized = raw.toLowerCase().replaceAll("-", "_");
+        if (SUPPORTED_FIX_SCOPES.includes(normalized)) {
+            granted.add(normalized);
+            continue;
+        }
+        throw new PmCliError(`Unknown --fix-scope value "${raw}". Supported values: ${SUPPORTED_FIX_SCOPES.join(", ")}.`, EXIT_CODE.USAGE);
+    }
+    return granted;
+}
+/**
+ * Split a fix plan into the records that may be applied under the granted
+ * scopes and the gated records that were withheld. `--fix-scope` is an exact
+ * allowlist: every `--auto-fix` record requires its gate scope in `granted`.
+ * Ungated records (`--prune-missing` link prunes, governed by their own flag)
+ * are always applicable.
+ */
+export function partitionFixesByGrant(fixes, granted) {
+    const applicable = [];
+    const gated = [];
+    for (const fix of fixes) {
+        if (fix.gate !== undefined && !granted.has(fix.gate)) {
+            gated.push(fix);
+        }
+        else {
+            applicable.push(fix);
+        }
+    }
+    return { applicable, gated };
+}
+/** Compact serialization of a fix for planned/applied output rows. */
+export function toFixOutputRow(fix) {
+    return {
+        item_id: fix.item_id,
+        check: fix.check,
+        field: fix.field,
+        command: fix.command,
+        ...(fix.gate !== undefined ? { gate: fix.gate } : {}),
+    };
+}
+//# sourceMappingURL=fix-planning.js.map
+//# debugId=7163fbbf-1a9c-52e0-a1d5-6034abefc50f

package/dist/core/validate/fix-planning.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fix-planning.js","sources":["core/validate/fix-planning.ts"],"sourceRoot":"/","sourcesContent":["/**\n * Fix planning for `pm validate --auto-fix` / `--prune-missing` (pm-c3sz,\n * pm-8jss, pm-0v2m).\n *\n * Pure module: planners turn check findings into declarative\n * {@link ValidateFixRecord}s; the validate command decides whether to apply\n * them (apply mode), preview them (`--dry-run`), or withhold gated fixes\n * (lifecycle structural changes require an explicit `--fix-scope lifecycle`).\n *\n * Safety invariants:\n * - Every planned fix is deterministic and non-destructive: it only sets a\n *   derivable field value or removes a stale LINK (never a real file).\n * - No fix ever closes, deletes, or cancels an item.\n * - Lifecycle fixes (reparent / unset parent) are structural, so they are\n *   planned with `gate: \"lifecycle\"` and only applied when that scope was\n *   explicitly granted.\n */\n\nimport { EXIT_CODE } from \"../shared/constants.js\";\nimport { PmCliError } from \"../shared/errors.js\";\n\nexport type ValidateFixCheck = \"metadata\" | \"resolution\" | \"lifecycle\" | \"files\";\n\nexport type ValidateFixKind =\n  | \"set_resolution\"\n  | \"set_close_reason\"\n  | \"reparent\"\n  | \"unset_parent\"\n  | \"prune_file_link\"\n  | \"prune_doc_link\";\n\nexport type ValidateFixScope = \"metadata\" | \"resolution\" | \"lifecycle\";\n\n/** Scopes auto-applied without an explicit `--fix-scope` (safe field backfills). */\nexport const DEFAULT_GRANTED_FIX_SCOPES: readonly ValidateFixScope[] = [\"metadata\", \"resolution\"];\n\n/** Scopes accepted by `--fix-scope` (lifecycle is the opt-in structural scope). */\nexport const SUPPORTED_FIX_SCOPES: readonly ValidateFixScope[] = [\"metadata\", \"resolution\", \"lifecycle\"];\n\nexport interface ValidateFixRecord {\n  /** Item the fix targets. */\n  item_id: string;\n  /** Validate check the finding came from. */\n  check: ValidateFixCheck;\n  /** Front-matter field (or link list) the fix changes. */\n  field: string;\n  /** Declarative fix kind the applier dispatches on. */\n  kind: ValidateFixKind;\n  /** Equivalent standalone `pm` command for the fix. */\n  command: string;\n  /** New value for set-field fixes. */\n  value?: string;\n  /** Stale link path for prune fixes. */\n  path?: string;\n  /** Target parent id for reparent fixes. */\n  parent_id?: string;\n  /**\n   * Fix scope the `--fix-scope` allowlist must grant for the fix to be\n   * applied. Every `--auto-fix` record carries one (the granted default is\n   * metadata+resolution; lifecycle must be named explicitly). Absent only on\n   * `--prune-missing` records, which are governed by their own flag.\n   */\n  gate?: ValidateFixScope;\n}\n\n/** Default resolution backfilled onto closed items with no derivable source text. */\nexport const DEFAULT_RESOLUTION_BACKFILL_VALUE = \"completed\";\n\nfunction quoteForCommand(value: string): string {\n  return `\"${value.replaceAll(\"\\\\\", \"\\\\\\\\\").replaceAll('\"', '\\\\\"')}\"`;\n}\n\nfunction toMeaningfulValue(value: string | undefined): string | undefined {\n  const trimmed = value?.trim();\n  return trimmed !== undefined && trimmed.length > 0 ? trimmed : undefined;\n}\n\nexport interface ResolutionBackfillRow {\n  id: string;\n  /** Resolution-check missing field keys for this closed item. */\n  missing_fields: readonly string[];\n  /** The item's close_reason, when present (preferred derivation source). */\n  close_reason?: string;\n}\n\n/**\n * Plan resolution backfills for closed items flagged by the resolution check.\n * Only the `resolution` field is mechanical enough to auto-fix: it derives\n * from the item's own `close_reason` when present and falls back to the\n * `\"completed\"` default. `expected_result` / `actual_result` stay hint-only —\n * no deterministic source text exists for them.\n */\nexport function planResolutionBackfillFixes(rows: readonly ResolutionBackfillRow[]): ValidateFixRecord[] {\n  const fixes: ValidateFixRecord[] = [];\n  for (const row of rows) {\n    if (!row.missing_fields.includes(\"resolution\")) {\n      continue;\n    }\n    const value = toMeaningfulValue(row.close_reason) ?? DEFAULT_RESOLUTION_BACKFILL_VALUE;\n    fixes.push({\n      item_id: row.id,\n      check: \"resolution\",\n      field: \"resolution\",\n      kind: \"set_resolution\",\n      value,\n      command: `pm update ${row.id} --resolution ${quoteForCommand(value)}`,\n      gate: \"resolution\",\n    });\n  }\n  return fixes;\n}\n\nexport interface CloseReasonBackfillRow {\n  id: string;\n  /** The item's resolution, when present (the only derivation source). */\n  resolution?: string;\n}\n\n/**\n * Plan close_reason backfills for closed items flagged by the metadata check.\n * Only derivable when the item already carries a resolution; items missing\n * both stay hint-only (any synthesized reason would be fabricated, not\n * derived).\n */\nexport function planCloseReasonBackfillFixes(rows: readonly CloseReasonBackfillRow[]): ValidateFixRecord[] {\n  const fixes: ValidateFixRecord[] = [];\n  for (const row of rows) {\n    const value = toMeaningfulValue(row.resolution);\n    if (value === undefined) {\n      continue;\n    }\n    fixes.push({\n      item_id: row.id,\n      check: \"metadata\",\n      field: \"close_reason\",\n      kind: \"set_close_reason\",\n      value,\n      command: `pm update ${row.id} --close-reason ${quoteForCommand(value)}`,\n      gate: \"metadata\",\n    });\n  }\n  return fixes;\n}\n\nexport interface TerminalParentFixRow {\n  id: string;\n  parent_id: string;\n  /** The terminal parent's own parent, when one exists. */\n  grandparent_id?: string;\n  /** True when the grandparent exists and is NOT terminal (safe reparent target). */\n  grandparent_active?: boolean;\n}\n\n/**\n * Plan lifecycle fixes for active items whose parent is terminal (pm-8jss /\n * GH-168). When the terminal parent has an active grandparent, the child is\n * reparented one level up (it stays inside the same hierarchy); otherwise the\n * parent link is cleared so the item surfaces as unparented active work.\n * Either way the item itself is never closed or mutated beyond `parent` —\n * and every fix carries `gate: \"lifecycle\"` so it is only applied under an\n * explicit `--fix-scope lifecycle`.\n */\nexport function planTerminalParentFixes(rows: readonly TerminalParentFixRow[]): ValidateFixRecord[] {\n  return rows.map((row) => {\n    if (row.grandparent_id !== undefined && row.grandparent_active === true) {\n      return {\n        item_id: row.id,\n        check: \"lifecycle\" as const,\n        field: \"parent\",\n        kind: \"reparent\" as const,\n        parent_id: row.grandparent_id,\n        command: `pm update ${row.id} --parent ${row.grandparent_id}`,\n        gate: \"lifecycle\" as const,\n      };\n    }\n    return {\n      item_id: row.id,\n      check: \"lifecycle\" as const,\n      field: \"parent\",\n      kind: \"unset_parent\" as const,\n      command: `pm update ${row.id} --unset parent`,\n      gate: \"lifecycle\" as const,\n    };\n  });\n}\n\nexport interface StaleLinkPruneRow {\n  item_id: string;\n  path: string;\n  link_kind: \"files\" | \"docs\";\n  classification: \"moved\" | \"deleted\";\n}\n\n/**\n * Plan link prunes for `--prune-missing` (pm-0v2m / GH-184). Only links whose\n * stale path classified as `deleted` are pruned; `moved` links keep their\n * relink candidates in the files-check details instead of being dropped, so\n * recoverable link information is never destroyed. Link removal only — real\n * files are never touched.\n */\nexport function planStaleLinkPruneFixes(rows: readonly StaleLinkPruneRow[]): ValidateFixRecord[] {\n  const fixes: ValidateFixRecord[] = [];\n  for (const row of rows) {\n    if (row.classification !== \"deleted\") {\n      continue;\n    }\n    const noun = row.link_kind === \"files\" ? \"files\" : \"docs\";\n    fixes.push({\n      item_id: row.item_id,\n      check: \"files\",\n      field: row.link_kind,\n      kind: row.link_kind === \"files\" ? \"prune_file_link\" : \"prune_doc_link\",\n      path: row.path,\n      command: `pm ${noun} ${row.item_id} --remove ${quoteForCommand(row.path)}`,\n    });\n  }\n  return fixes;\n}\n\n/**\n * Resolve the granted `--fix-scope` set (repeatable and/or comma-separated).\n * With no explicit scopes the safe field-backfill scopes (metadata,\n * resolution) are granted; lifecycle must always be named explicitly. Unknown\n * values fail fast with the supported list.\n */\nexport function resolveGrantedFixScopes(rawScopes: readonly string[] | undefined): Set<ValidateFixScope> {\n  const tokens = (rawScopes ?? [])\n    .flatMap((raw) => raw.split(\",\"))\n    .map((raw) => raw.trim())\n    .filter((raw) => raw.length > 0);\n  if (tokens.length === 0) {\n    if (rawScopes !== undefined && rawScopes.length > 0) {\n      throw new PmCliError(\n        `--fix-scope values must not be empty. Supported values: ${SUPPORTED_FIX_SCOPES.join(\", \")}.`,\n        EXIT_CODE.USAGE,\n      );\n    }\n    return new Set(DEFAULT_GRANTED_FIX_SCOPES);\n  }\n  const granted = new Set<ValidateFixScope>();\n  for (const raw of tokens) {\n    const normalized = raw.toLowerCase().replaceAll(\"-\", \"_\");\n    if ((SUPPORTED_FIX_SCOPES as readonly string[]).includes(normalized)) {\n      granted.add(normalized as ValidateFixScope);\n      continue;\n    }\n    throw new PmCliError(\n      `Unknown --fix-scope value \"${raw}\". Supported values: ${SUPPORTED_FIX_SCOPES.join(\", \")}.`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return granted;\n}\n\n/**\n * Split a fix plan into the records that may be applied under the granted\n * scopes and the gated records that were withheld. `--fix-scope` is an exact\n * allowlist: every `--auto-fix` record requires its gate scope in `granted`.\n * Ungated records (`--prune-missing` link prunes, governed by their own flag)\n * are always applicable.\n */\nexport function partitionFixesByGrant(\n  fixes: readonly ValidateFixRecord[],\n  granted: ReadonlySet<ValidateFixScope>,\n): { applicable: ValidateFixRecord[]; gated: ValidateFixRecord[] } {\n  const applicable: ValidateFixRecord[] = [];\n  const gated: ValidateFixRecord[] = [];\n  for (const fix of fixes) {\n    if (fix.gate !== undefined && !granted.has(fix.gate)) {\n      gated.push(fix);\n    } else {\n      applicable.push(fix);\n    }\n  }\n  return { applicable, gated };\n}\n\n/** Compact serialization of a fix for planned/applied output rows. */\nexport function toFixOutputRow(fix: ValidateFixRecord): Record<string, unknown> {\n  return {\n    item_id: fix.item_id,\n    check: fix.check,\n    field: fix.field,\n    command: fix.command,\n    ...(fix.gate !== undefined ? { gate: fix.gate } : {}),\n  };\n}\n"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;;;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAcjD,oFAAoF;AACpF,MAAM,CAAC,MAAM,0BAA0B,GAAgC,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;AAElG,mFAAmF;AACnF,MAAM,CAAC,MAAM,oBAAoB,GAAgC,CAAC,UAAU,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;AA4BzG,qFAAqF;AACrF,MAAM,CAAC,MAAM,iCAAiC,GAAG,WAAW,CAAC;AAE7D,SAAS,eAAe,CAAC,KAAa;IACpC,OAAO,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC;AACtE,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAyB;IAClD,MAAM,OAAO,GAAG,KAAK,EAAE,IAAI,EAAE,CAAC;IAC9B,OAAO,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;AAC3E,CAAC;AAUD;;;;;;GAMG;AACH,MAAM,UAAU,2BAA2B,CAAC,IAAsC;IAChF,MAAM,KAAK,GAAwB,EAAE,CAAC;IACtC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;YAC/C,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,iBAAiB,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,iCAAiC,CAAC;QACvF,KAAK,CAAC,IAAI,CAAC;YACT,OAAO,EAAE,GAAG,CAAC,EAAE;YACf,KAAK,EAAE,YAAY;YACnB,KAAK,EAAE,YAAY;YACnB,IAAI,EAAE,gBAAgB;YACtB,KAAK;YACL,OAAO,EAAE,aAAa,GAAG,CAAC,EAAE,iBAAiB,eAAe,CAAC,KAAK,CAAC,EAAE;YACrE,IAAI,EAAE,YAAY;SACnB,CAAC,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAQD;;;;;GAKG;AACH,MAAM,UAAU,4BAA4B,CAAC,IAAuC;IAClF,MAAM,KAAK,GAAwB,EAAE,CAAC;IACtC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAChD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,SAAS;QACX,CAAC;QACD,KAAK,CAAC,IAAI,CAAC;YACT,OAAO,EAAE,GAAG,CAAC,EAAE;YACf,KAAK,EAAE,UAAU;YACjB,KAAK,EAAE,cAAc;YACrB,IAAI,EAAE,kBAAkB;YACxB,KAAK;YACL,OAAO,EAAE,aAAa,GAAG,CAAC,EAAE,mBAAmB,eAAe,CAAC,KAAK,CAAC,EAAE;YACvE,IAAI,EAAE,UAAU;SACjB,CAAC,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAWD;;;;;;;;GAQG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAqC;IAC3E,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACtB,IAAI,GAAG,CAAC,cAAc,KAAK,SAAS,IAAI,GAAG,CAAC,kBAAkB,KAAK,IAAI,EAAE,CAAC;YACxE,OAAO;gBACL,OAAO,EAAE,GAAG,CAAC,EAAE;gBACf,KAAK,EAAE,WAAoB;gBAC3B,KAAK,EAAE,QAAQ;gBACf,IAAI,EAAE,UAAmB;gBACzB,SAAS,EAAE,GAAG,CAAC,cAAc;gBAC7B,OAAO,EAAE,aAAa,GAAG,CAAC,EAAE,aAAa,GAAG,CAAC,cAAc,EAAE;gBAC7D,IAAI,EAAE,WAAoB;aAC3B,CAAC;QACJ,CAAC;QACD,OAAO;YACL,OAAO,EAAE,GAAG,CAAC,EAAE;YACf,KAAK,EAAE,WAAoB;YAC3B,KAAK,EAAE,QAAQ;YACf,IAAI,EAAE,cAAuB;YAC7B,OAAO,EAAE,aAAa,GAAG,CAAC,EAAE,iBAAiB;YAC7C,IAAI,EAAE,WAAoB;SAC3B,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AASD;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAkC;IACxE,MAAM,KAAK,GAAwB,EAAE,CAAC;IACtC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,GAAG,CAAC,cAAc,KAAK,SAAS,EAAE,CAAC;YACrC,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,GAAG,CAAC,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;QAC1D,KAAK,CAAC,IAAI,CAAC;YACT,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,KAAK,EAAE,OAAO;YACd,KAAK,EAAE,GAAG,CAAC,SAAS;YACpB,IAAI,EAAE,GAAG,CAAC,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,gBAAgB;YACtE,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,OAAO,EAAE,MAAM,IAAI,IAAI,GAAG,CAAC,OAAO,aAAa,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;SAC3E,CAAC,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,uBAAuB,CAAC,SAAwC;IAC9E,MAAM,MAAM,GAAG,CAAC,SAAS,IAAI,EAAE,CAAC;SAC7B,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;SAChC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;SACxB,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACnC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpD,MAAM,IAAI,UAAU,CAClB,2DAA2D,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAC7F,SAAS,CAAC,KAAK,CAChB,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,GAAG,CAAC,0BAA0B,CAAC,CAAC;IAC7C,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,MAAM,UAAU,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC1D,IAAK,oBAA0C,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;YACrE,OAAO,CAAC,GAAG,CAAC,UAA8B,CAAC,CAAC;YAC5C,SAAS;QACX,CAAC;QACD,MAAM,IAAI,UAAU,CAClB,8BAA8B,GAAG,wBAAwB,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAC3F,SAAS,CAAC,KAAK,CAChB,CAAC;IACJ,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAmC,EACnC,OAAsC;IAEtC,MAAM,UAAU,GAAwB,EAAE,CAAC;IAC3C,MAAM,KAAK,GAAwB,EAAE,CAAC;IACtC,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACrD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;aAAM,CAAC;YACN,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;AAC/B,CAAC;AAED,sEAAsE;AACtE,MAAM,UAAU,cAAc,CAAC,GAAsB;IACnD,OAAO;QACL,OAAO,EAAE,GAAG,CAAC,OAAO;QACpB,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,OAAO,EAAE,GAAG,CAAC,OAAO;QACpB,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACtD,CAAC;AACJ,CAAC","debugId":"7163fbbf-1a9c-52e0-a1d5-6034abefc50f"}

package/dist/core/validate/missing-by-type.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Per-item-type grouping of missing-required-field counts for
+ * `pm validate --check-metadata` (pm-pmyq / GH-172).
+ *
+ * Pure module: callers stream `(item_type, field)` pairs — one per missing
+ * required field occurrence — and receive a compact, deterministically sorted
+ * `missing_by_type` map of counts (never row dumps), e.g.
+ * `{ Task: { close_reason: 3, reviewer: 1 } }`.
+ */
+export interface MissingFieldOccurrence {
+    /** Item type name as stored in front matter (e.g. "Task"). */
+    item_type: string;
+    /** Required metadata field that is missing on the item. */
+    field: string;
+}
+/**
+ * Aggregate missing-field occurrences into `{ type: { field: count } }` with
+ * both levels sorted lexicographically for stable, diff-friendly output.
+ * Zero counts never appear (only observed occurrences are aggregated).
+ */
+export declare function buildMissingByTypeCounts(occurrences: Iterable<MissingFieldOccurrence>): Record<string, Record<string, number>>;

package/dist/core/validate/missing-by-type.js

@@ -0,0 +1,39 @@
+/**
+ * Per-item-type grouping of missing-required-field counts for
+ * `pm validate --check-metadata` (pm-pmyq / GH-172).
+ *
+ * Pure module: callers stream `(item_type, field)` pairs — one per missing
+ * required field occurrence — and receive a compact, deterministically sorted
+ * `missing_by_type` map of counts (never row dumps), e.g.
+ * `{ Task: { close_reason: 3, reviewer: 1 } }`.
+ */
+/**
+ * Aggregate missing-field occurrences into `{ type: { field: count } }` with
+ * both levels sorted lexicographically for stable, diff-friendly output.
+ * Zero counts never appear (only observed occurrences are aggregated).
+ */
+
+!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]="16988d98-5a10-5e0a-952c-0a6289ab5935")}catch(e){}}();
+export function buildMissingByTypeCounts(occurrences) {
+    const countsByType = new Map();
+    for (const occurrence of occurrences) {
+        let fieldCounts = countsByType.get(occurrence.item_type);
+        if (!fieldCounts) {
+            fieldCounts = new Map();
+            countsByType.set(occurrence.item_type, fieldCounts);
+        }
+        fieldCounts.set(occurrence.field, (fieldCounts.get(occurrence.field) ?? 0) + 1);
+    }
+    const result = {};
+    for (const type of [...countsByType.keys()].sort((left, right) => left.localeCompare(right))) {
+        const fieldCounts = countsByType.get(type);
+        const fields = {};
+        for (const field of [...fieldCounts.keys()].sort((left, right) => left.localeCompare(right))) {
+            fields[field] = fieldCounts.get(field);
+        }
+        result[type] = fields;
+    }
+    return result;
+}
+//# sourceMappingURL=missing-by-type.js.map
+//# debugId=16988d98-5a10-5e0a-952c-0a6289ab5935

package/dist/core/validate/missing-by-type.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"missing-by-type.js","sources":["core/validate/missing-by-type.ts"],"sourceRoot":"/","sourcesContent":["/**\n * Per-item-type grouping of missing-required-field counts for\n * `pm validate --check-metadata` (pm-pmyq / GH-172).\n *\n * Pure module: callers stream `(item_type, field)` pairs — one per missing\n * required field occurrence — and receive a compact, deterministically sorted\n * `missing_by_type` map of counts (never row dumps), e.g.\n * `{ Task: { close_reason: 3, reviewer: 1 } }`.\n */\n\nexport interface MissingFieldOccurrence {\n  /** Item type name as stored in front matter (e.g. \"Task\"). */\n  item_type: string;\n  /** Required metadata field that is missing on the item. */\n  field: string;\n}\n\n/**\n * Aggregate missing-field occurrences into `{ type: { field: count } }` with\n * both levels sorted lexicographically for stable, diff-friendly output.\n * Zero counts never appear (only observed occurrences are aggregated).\n */\nexport function buildMissingByTypeCounts(\n  occurrences: Iterable<MissingFieldOccurrence>,\n): Record<string, Record<string, number>> {\n  const countsByType = new Map<string, Map<string, number>>();\n  for (const occurrence of occurrences) {\n    let fieldCounts = countsByType.get(occurrence.item_type);\n    if (!fieldCounts) {\n      fieldCounts = new Map<string, number>();\n      countsByType.set(occurrence.item_type, fieldCounts);\n    }\n    fieldCounts.set(occurrence.field, (fieldCounts.get(occurrence.field) ?? 0) + 1);\n  }\n\n  const result: Record<string, Record<string, number>> = {};\n  for (const type of [...countsByType.keys()].sort((left, right) => left.localeCompare(right))) {\n    const fieldCounts = countsByType.get(type)!;\n    const fields: Record<string, number> = {};\n    for (const field of [...fieldCounts.keys()].sort((left, right) => left.localeCompare(right))) {\n      fields[field] = fieldCounts.get(field)!;\n    }\n    result[type] = fields;\n  }\n  return result;\n}\n"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AASH;;;;GAIG;;;AACH,MAAM,UAAU,wBAAwB,CACtC,WAA6C;IAE7C,MAAM,YAAY,GAAG,IAAI,GAAG,EAA+B,CAAC;IAC5D,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;QACrC,IAAI,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QACzD,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;YACxC,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QACtD,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClF,CAAC;IAED,MAAM,MAAM,GAA2C,EAAE,CAAC;IAC1D,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QAC7F,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QAC5C,MAAM,MAAM,GAA2B,EAAE,CAAC;QAC1C,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAC7F,MAAM,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;QAC1C,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;IACxB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","debugId":"16988d98-5a10-5e0a-952c-0a6289ab5935"}

package/dist/core/validate/stale-file-classification.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Classification of stale linked paths reported by `pm validate --check-files`.
+ *
+ * A linked file path that no longer exists is either:
+ * - `moved`: a file with the same basename still exists elsewhere in the
+ *   scanned candidate set — the candidates are reported so an agent can relink
+ *   the item to the new location instead of dropping the link, or
+ * - `deleted`: no candidate with that basename exists anywhere in the scan,
+ *   so the link points at content that is gone and pruning it is safe.
+ *
+ * Pure module (pm-0v2m / GH-184): no filesystem access — callers pass the
+ * already-collected candidate file list from the files check scan.
+ */
+export type StaleLinkedPathClassification = "moved" | "deleted";
+export interface ClassifiedStaleLinkedPath {
+    /** Normalized workspace-relative stale linked path. */
+    path: string;
+    classification: StaleLinkedPathClassification;
+    /**
+     * Candidate new locations (same basename, different path), sorted and capped
+     * at `candidateLimit`. Empty for `deleted`.
+     */
+    candidates: string[];
+    /** True when more candidates existed than `candidateLimit` allowed. */
+    candidates_truncated: boolean;
+}
+export declare const DEFAULT_STALE_PATH_CANDIDATE_LIMIT = 3;
+/**
+ * Classify each stale (missing) linked path as `moved` or `deleted` by
+ * matching its basename against the candidate file list. Output preserves the
+ * input order of `stalePaths` (callers pass an already-sorted unique list).
+ * A candidate equal to the stale path itself never matches (the path is known
+ * missing; an identical candidate would be self-referential noise).
+ */
+export declare function classifyStaleLinkedPaths(stalePaths: readonly string[], candidateFiles: readonly string[], candidateLimit?: number): ClassifiedStaleLinkedPath[];
+/**
+ * Render compact `<path>:moved:<top-candidate>` / `<path>:deleted` rows for
+ * the files check details (token-efficient counterpart to the full
+ * classification objects).
+ */
+export declare function summarizeStaleLinkedPathClassifications(classified: readonly ClassifiedStaleLinkedPath[]): string[];

package/dist/core/validate/stale-file-classification.js

@@ -0,0 +1,73 @@
+/**
+ * Classification of stale linked paths reported by `pm validate --check-files`.
+ *
+ * A linked file path that no longer exists is either:
+ * - `moved`: a file with the same basename still exists elsewhere in the
+ *   scanned candidate set — the candidates are reported so an agent can relink
+ *   the item to the new location instead of dropping the link, or
+ * - `deleted`: no candidate with that basename exists anywhere in the scan,
+ *   so the link points at content that is gone and pruning it is safe.
+ *
+ * Pure module (pm-0v2m / GH-184): no filesystem access — callers pass the
+ * already-collected candidate file list from the files check scan.
+ */
+
+!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]="2df68560-32a7-5762-9470-cf82e978a90d")}catch(e){}}();
+export const DEFAULT_STALE_PATH_CANDIDATE_LIMIT = 3;
+function basenameOf(relativePath) {
+    const lastSlash = Math.max(relativePath.lastIndexOf("/"), relativePath.lastIndexOf("\\"));
+    return lastSlash === -1 ? relativePath : relativePath.slice(lastSlash + 1);
+}
+/**
+ * Classify each stale (missing) linked path as `moved` or `deleted` by
+ * matching its basename against the candidate file list. Output preserves the
+ * input order of `stalePaths` (callers pass an already-sorted unique list).
+ * A candidate equal to the stale path itself never matches (the path is known
+ * missing; an identical candidate would be self-referential noise).
+ */
+export function classifyStaleLinkedPaths(stalePaths, candidateFiles, candidateLimit = DEFAULT_STALE_PATH_CANDIDATE_LIMIT) {
+    const limit = Number.isFinite(candidateLimit) && candidateLimit >= 1 ? Math.floor(candidateLimit) : DEFAULT_STALE_PATH_CANDIDATE_LIMIT;
+    const candidatesByBasename = new Map();
+    for (const candidate of candidateFiles) {
+        const basename = basenameOf(candidate);
+        if (basename.length === 0) {
+            continue;
+        }
+        const bucket = candidatesByBasename.get(basename);
+        if (bucket) {
+            bucket.push(candidate);
+        }
+        else {
+            candidatesByBasename.set(basename, [candidate]);
+        }
+    }
+    return stalePaths.map((stalePath) => {
+        const matches = (candidatesByBasename.get(basenameOf(stalePath)) ?? [])
+            .filter((candidate) => candidate !== stalePath)
+            .sort((left, right) => left.localeCompare(right));
+        if (matches.length === 0) {
+            return {
+                path: stalePath,
+                classification: "deleted",
+                candidates: [],
+                candidates_truncated: false,
+            };
+        }
+        return {
+            path: stalePath,
+            classification: "moved",
+            candidates: matches.slice(0, limit),
+            candidates_truncated: matches.length > limit,
+        };
+    });
+}
+/**
+ * Render compact `<path>:moved:<top-candidate>` / `<path>:deleted` rows for
+ * the files check details (token-efficient counterpart to the full
+ * classification objects).
+ */
+export function summarizeStaleLinkedPathClassifications(classified) {
+    return classified.map((entry) => entry.classification === "moved" ? `${entry.path}:moved:${entry.candidates[0]}` : `${entry.path}:deleted`);
+}
+//# sourceMappingURL=stale-file-classification.js.map
+//# debugId=2df68560-32a7-5762-9470-cf82e978a90d

package/dist/core/validate/stale-file-classification.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stale-file-classification.js","sources":["core/validate/stale-file-classification.ts"],"sourceRoot":"/","sourcesContent":["/**\n * Classification of stale linked paths reported by `pm validate --check-files`.\n *\n * A linked file path that no longer exists is either:\n * - `moved`: a file with the same basename still exists elsewhere in the\n *   scanned candidate set — the candidates are reported so an agent can relink\n *   the item to the new location instead of dropping the link, or\n * - `deleted`: no candidate with that basename exists anywhere in the scan,\n *   so the link points at content that is gone and pruning it is safe.\n *\n * Pure module (pm-0v2m / GH-184): no filesystem access — callers pass the\n * already-collected candidate file list from the files check scan.\n */\n\nexport type StaleLinkedPathClassification = \"moved\" | \"deleted\";\n\nexport interface ClassifiedStaleLinkedPath {\n  /** Normalized workspace-relative stale linked path. */\n  path: string;\n  classification: StaleLinkedPathClassification;\n  /**\n   * Candidate new locations (same basename, different path), sorted and capped\n   * at `candidateLimit`. Empty for `deleted`.\n   */\n  candidates: string[];\n  /** True when more candidates existed than `candidateLimit` allowed. */\n  candidates_truncated: boolean;\n}\n\nexport const DEFAULT_STALE_PATH_CANDIDATE_LIMIT = 3;\n\nfunction basenameOf(relativePath: string): string {\n  const lastSlash = Math.max(relativePath.lastIndexOf(\"/\"), relativePath.lastIndexOf(\"\\\\\"));\n  return lastSlash === -1 ? relativePath : relativePath.slice(lastSlash + 1);\n}\n\n/**\n * Classify each stale (missing) linked path as `moved` or `deleted` by\n * matching its basename against the candidate file list. Output preserves the\n * input order of `stalePaths` (callers pass an already-sorted unique list).\n * A candidate equal to the stale path itself never matches (the path is known\n * missing; an identical candidate would be self-referential noise).\n */\nexport function classifyStaleLinkedPaths(\n  stalePaths: readonly string[],\n  candidateFiles: readonly string[],\n  candidateLimit: number = DEFAULT_STALE_PATH_CANDIDATE_LIMIT,\n): ClassifiedStaleLinkedPath[] {\n  const limit = Number.isFinite(candidateLimit) && candidateLimit >= 1 ? Math.floor(candidateLimit) : DEFAULT_STALE_PATH_CANDIDATE_LIMIT;\n  const candidatesByBasename = new Map<string, string[]>();\n  for (const candidate of candidateFiles) {\n    const basename = basenameOf(candidate);\n    if (basename.length === 0) {\n      continue;\n    }\n    const bucket = candidatesByBasename.get(basename);\n    if (bucket) {\n      bucket.push(candidate);\n    } else {\n      candidatesByBasename.set(basename, [candidate]);\n    }\n  }\n\n  return stalePaths.map((stalePath) => {\n    const matches = (candidatesByBasename.get(basenameOf(stalePath)) ?? [])\n      .filter((candidate) => candidate !== stalePath)\n      .sort((left, right) => left.localeCompare(right));\n    if (matches.length === 0) {\n      return {\n        path: stalePath,\n        classification: \"deleted\" as const,\n        candidates: [],\n        candidates_truncated: false,\n      };\n    }\n    return {\n      path: stalePath,\n      classification: \"moved\" as const,\n      candidates: matches.slice(0, limit),\n      candidates_truncated: matches.length > limit,\n    };\n  });\n}\n\n/**\n * Render compact `<path>:moved:<top-candidate>` / `<path>:deleted` rows for\n * the files check details (token-efficient counterpart to the full\n * classification objects).\n */\nexport function summarizeStaleLinkedPathClassifications(classified: readonly ClassifiedStaleLinkedPath[]): string[] {\n  return classified.map((entry) =>\n    entry.classification === \"moved\" ? `${entry.path}:moved:${entry.candidates[0]}` : `${entry.path}:deleted`,\n  );\n}\n"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;;;AAiBH,MAAM,CAAC,MAAM,kCAAkC,GAAG,CAAC,CAAC;AAEpD,SAAS,UAAU,CAAC,YAAoB;IACtC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,YAAY,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1F,OAAO,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;AAC7E,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,wBAAwB,CACtC,UAA6B,EAC7B,cAAiC,EACjC,iBAAyB,kCAAkC;IAE3D,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,cAAc,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,kCAAkC,CAAC;IACvI,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzD,KAAK,MAAM,SAAS,IAAI,cAAc,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;QACvC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GAAG,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAClD,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,oBAAoB,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE;QAClC,MAAM,OAAO,GAAG,CAAC,oBAAoB,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC;aACpE,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,KAAK,SAAS,CAAC;aAC9C,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;QACpD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO;gBACL,IAAI,EAAE,SAAS;gBACf,cAAc,EAAE,SAAkB;gBAClC,UAAU,EAAE,EAAE;gBACd,oBAAoB,EAAE,KAAK;aAC5B,CAAC;QACJ,CAAC;QACD,OAAO;YACL,IAAI,EAAE,SAAS;YACf,cAAc,EAAE,OAAgB;YAChC,UAAU,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;YACnC,oBAAoB,EAAE,OAAO,CAAC,MAAM,GAAG,KAAK;SAC7C,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,uCAAuC,CAAC,UAAgD;IACtG,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAC9B,KAAK,CAAC,cAAc,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,UAAU,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,UAAU,CAC1G,CAAC;AACJ,CAAC","debugId":"2df68560-32a7-5762-9470-cf82e978a90d"}

package/dist/mcp/server.d.ts

@@ -8,4 +8,5 @@ interface JsonRpcRequest {
 export declare function handleRequest(request: JsonRpcRequest): Promise<Record<string, unknown> | undefined>;
 export declare function processRpcLine(line: string): Promise<void>;
 export declare function startMcpServer(): void;
+export declare function isInvokedAsMcpMainModule(argvPath: string | undefined, moduleUrl: string): boolean;
 export {};