@unbrained/pm-cli 2026.6.13 → 2026.6.16

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

@@ -0,0 +1,394 @@
+
+!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]="d9c38660-7b8d-54c6-82c4-12f9a2204743")}catch(e){}}();
+import {
+  toNonEmptyStringOrUndefined
+} from "./chunk-KTVETP66.js";
+
+// dist/core/governance/metadata-coverage.js
+function normalizeStatus(status, registry) {
+  const trimmed = status.trim().toLowerCase();
+  return registry.alias_to_id.get(trimmed) ?? trimmed;
+}
+function lifecycleClassifierFromStatusRegistry(registry) {
+  return {
+    isTerminal(status) {
+      return registry.terminal_statuses.has(normalizeStatus(status, registry));
+    },
+    classify(status) {
+      const id = normalizeStatus(status, registry);
+      if (registry.terminal_canceled_statuses.has(id)) {
+        return "canceled";
+      }
+      if (registry.terminal_statuses.has(id)) {
+        return "closed";
+      }
+      if (registry.blocked_statuses.has(id)) {
+        return "blocked";
+      }
+      if (registry.draft_statuses.has(id)) {
+        return "draft";
+      }
+      if (id === registry.open_status) {
+        return "open";
+      }
+      if (registry.active_statuses.has(id)) {
+        return "in_progress";
+      }
+      return "other";
+    }
+  };
+}
+function isAcMissing(item) {
+  return toNonEmptyStringOrUndefined(item.acceptance_criteria) === void 0;
+}
+function isEstimateMissing(item) {
+  return !Number.isFinite(item.estimated_minutes);
+}
+function isResolutionMissing(item, classifier) {
+  if (!classifier.isTerminal(item.status)) {
+    return false;
+  }
+  return toNonEmptyStringOrUndefined(item.resolution) === void 0;
+}
+function isReviewerMissing(item) {
+  return toNonEmptyStringOrUndefined(item.reviewer) === void 0;
+}
+function isRiskMissing(item) {
+  return toNonEmptyStringOrUndefined(item.risk) === void 0;
+}
+function isConfidenceMissing(item) {
+  if (typeof item.confidence === "number") {
+    return !Number.isFinite(item.confidence);
+  }
+  return toNonEmptyStringOrUndefined(item.confidence) === void 0;
+}
+function isSprintMissing(item) {
+  return toNonEmptyStringOrUndefined(item.sprint) === void 0;
+}
+function isReleaseMissing(item) {
+  return toNonEmptyStringOrUndefined(item.release) === void 0;
+}
+function hasMissingMetadataFilter(filters) {
+  return Boolean(filters.acMissing || filters.estimatesMissing || filters.resolutionMissing || filters.reviewerMissing || filters.riskMissing || filters.confidenceMissing || filters.sprintMissing || filters.releaseMissing || filters.metadataMissing);
+}
+function itemMatchesMissingMetadata(item, filters, classifier) {
+  if (!hasMissingMetadataFilter(filters)) {
+    return true;
+  }
+  if (filters.acMissing && !isAcMissing(item)) {
+    return false;
+  }
+  if (filters.estimatesMissing && !isEstimateMissing(item)) {
+    return false;
+  }
+  if (filters.resolutionMissing && !isResolutionMissing(item, classifier)) {
+    return false;
+  }
+  if (filters.reviewerMissing && !isReviewerMissing(item)) {
+    return false;
+  }
+  if (filters.riskMissing && !isRiskMissing(item)) {
+    return false;
+  }
+  if (filters.confidenceMissing && !isConfidenceMissing(item)) {
+    return false;
+  }
+  if (filters.sprintMissing && !isSprintMissing(item)) {
+    return false;
+  }
+  if (filters.releaseMissing && !isReleaseMissing(item)) {
+    return false;
+  }
+  if (filters.metadataMissing) {
+    const anyMissing = isAcMissing(item) || isEstimateMissing(item) || isResolutionMissing(item, classifier);
+    if (!anyMissing) {
+      return false;
+    }
+  }
+  return true;
+}
+var COVERAGE_FIELD_ORDER = [
+  "acceptance_criteria",
+  "estimated_minutes",
+  "resolution",
+  "tags",
+  "parent"
+];
+function isFieldPresent(item, field) {
+  switch (field) {
+    case "acceptance_criteria":
+      return !isAcMissing(item);
+    case "estimated_minutes":
+      return !isEstimateMissing(item);
+    case "resolution":
+      return toNonEmptyStringOrUndefined(item.resolution) !== void 0;
+    case "tags":
+      return Array.isArray(item.tags) && item.tags.length > 0;
+    default:
+      return toNonEmptyStringOrUndefined(item.parent) !== void 0;
+  }
+}
+function isFieldApplicable(item, field, classifier) {
+  if (field === "resolution") {
+    return classifier.isTerminal(item.status);
+  }
+  return true;
+}
+function roundPercent(present, applicable) {
+  if (applicable === 0) {
+    return 100;
+  }
+  return Math.round(present / applicable * 1e3) / 10;
+}
+function emptyFieldCoverage() {
+  const record = {};
+  for (const field of COVERAGE_FIELD_ORDER) {
+    record[field] = { present: 0, applicable: 0, percent: 100 };
+  }
+  return record;
+}
+function accumulateCoverage(target, item, classifier) {
+  for (const field of COVERAGE_FIELD_ORDER) {
+    if (!isFieldApplicable(item, field, classifier)) {
+      continue;
+    }
+    const entry = target[field];
+    entry.applicable += 1;
+    if (isFieldPresent(item, field)) {
+      entry.present += 1;
+    }
+  }
+}
+function finalizePercentages(record) {
+  for (const field of COVERAGE_FIELD_ORDER) {
+    const entry = record[field];
+    entry.percent = roundPercent(entry.present, entry.applicable);
+  }
+}
+function computeMetadataCoverage(items, classifier) {
+  const overall = emptyFieldCoverage();
+  const byType = {};
+  for (const item of items) {
+    accumulateCoverage(overall, item, classifier);
+    const typeRecord = byType[item.type] ?? (byType[item.type] = emptyFieldCoverage());
+    accumulateCoverage(typeRecord, item, classifier);
+  }
+  finalizePercentages(overall);
+  for (const typeRecord of Object.values(byType)) {
+    finalizePercentages(typeRecord);
+  }
+  return { overall, by_type: byType };
+}
+var EMPTY_GROUP_LABELS = {
+  assignee: "(unassigned)",
+  priority: "(no priority)",
+  tag: "(untagged)",
+  parent: "(unparented)",
+  type: "(untyped)",
+  status: "(no status)"
+};
+function emptyGroupLabel(dimension) {
+  return EMPTY_GROUP_LABELS[dimension];
+}
+function emptyBuckets() {
+  return {
+    open: 0,
+    in_progress: 0,
+    blocked: 0,
+    draft: 0,
+    closed: 0,
+    canceled: 0,
+    other: 0
+  };
+}
+function groupKeysForItem(item, dimension, options) {
+  switch (dimension) {
+    case "assignee":
+      return [toNonEmptyStringOrUndefined(item.assignee) ?? null];
+    case "parent":
+      return [toNonEmptyStringOrUndefined(item.parent) ?? null];
+    case "type":
+      return [toNonEmptyStringOrUndefined(item.type) ?? null];
+    case "status":
+      return [toNonEmptyStringOrUndefined(item.status) ?? null];
+    case "priority":
+      return [typeof item.priority === "number" ? `P${item.priority}` : null];
+    default: {
+      const prefix = options.tagPrefix?.trim();
+      const tags = Array.isArray(item.tags) ? item.tags : [];
+      const matching = tags.filter((tag) => typeof tag === "string" && tag.length > 0 && (!prefix || tag.startsWith(prefix)));
+      return matching.length > 0 ? matching : [null];
+    }
+  }
+}
+function groupItemsByDimension(items, dimension, classifier, options = {}) {
+  const rows = /* @__PURE__ */ new Map();
+  let totalItems = 0;
+  for (const item of items) {
+    totalItems += 1;
+    const bucket = classifier.classify(item.status);
+    for (const key of groupKeysForItem(item, dimension, options)) {
+      const mapKey = key ?? "\0empty";
+      let row = rows.get(mapKey);
+      if (!row) {
+        row = {
+          label: key ?? emptyGroupLabel(dimension),
+          key,
+          buckets: emptyBuckets(),
+          total: 0
+        };
+        rows.set(mapKey, row);
+      }
+      row.buckets[bucket] += 1;
+      row.total += 1;
+    }
+  }
+  const sorted = [...rows.values()].sort((left, right) => {
+    if (right.total !== left.total) {
+      return right.total - left.total;
+    }
+    if (left.key === null) {
+      return 1;
+    }
+    if (right.key === null) {
+      return -1;
+    }
+    return left.label.localeCompare(right.label);
+  });
+  return { dimension, rows: sorted, total_items: totalItems };
+}
+
+// dist/core/governance/content-fields.js
+var CONTENT_FIELD_ORDER = [
+  "notes",
+  "learnings",
+  "files",
+  "docs",
+  "tests",
+  "comments",
+  "deps",
+  "body",
+  "linked_command"
+];
+function hasEntries(value) {
+  return Array.isArray(value) && value.length > 0;
+}
+function hasBody(body) {
+  return typeof body === "string" && body.trim().length > 0;
+}
+function hasLinkedCommand(tests) {
+  if (!Array.isArray(tests)) {
+    return false;
+  }
+  return tests.some((entry) => {
+    if (typeof entry !== "object" || entry === null) {
+      return false;
+    }
+    const command = entry.command;
+    return typeof command === "string" && command.trim().length > 0;
+  });
+}
+function isContentFieldPresent(item, field) {
+  switch (field) {
+    case "notes":
+      return hasEntries(item.notes);
+    case "learnings":
+      return hasEntries(item.learnings);
+    case "files":
+      return hasEntries(item.files);
+    case "docs":
+      return hasEntries(item.docs);
+    case "tests":
+      return hasEntries(item.tests);
+    case "comments":
+      return hasEntries(item.comments);
+    case "deps":
+      return hasEntries(item.dependencies);
+    case "body":
+      return hasBody(item.body);
+    case "linked_command":
+      return hasLinkedCommand(item.tests);
+  }
+}
+function hasContentFieldFilter(filters) {
+  return CONTENT_FIELD_ORDER.some((field) => filters[field] !== void 0);
+}
+function itemMatchesContentFilters(item, filters) {
+  for (const field of CONTENT_FIELD_ORDER) {
+    const selection = filters[field];
+    if (selection === void 0) {
+      continue;
+    }
+    const present = isContentFieldPresent(item, field);
+    if (selection === "present" && !present) {
+      return false;
+    }
+    if (selection === "absent" && present) {
+      return false;
+    }
+  }
+  return true;
+}
+function contentFiltersNeedCollections(filters) {
+  return CONTENT_FIELD_ORDER.some((field) => field !== "body" && filters[field] !== void 0);
+}
+function contentFiltersNeedBody(filters) {
+  return filters.body !== void 0;
+}
+function roundPercent2(present, total) {
+  if (total === 0) {
+    return 100;
+  }
+  return Math.round(present / total * 1e3) / 10;
+}
+function emptyUtilizationFields() {
+  const record = {};
+  for (const field of CONTENT_FIELD_ORDER) {
+    record[field] = { present: 0, total: 0, percent: 100 };
+  }
+  return record;
+}
+function computeContentFieldUtilization(items) {
+  const fields = emptyUtilizationFields();
+  const total = items.length;
+  for (const item of items) {
+    for (const field of CONTENT_FIELD_ORDER) {
+      if (isContentFieldPresent(item, field)) {
+        fields[field].present += 1;
+      }
+    }
+  }
+  for (const field of CONTENT_FIELD_ORDER) {
+    fields[field].total = total;
+    fields[field].percent = roundPercent2(fields[field].present, total);
+  }
+  const bodyPopulated = fields.body;
+  const emptyBodyCount = total - bodyPopulated.present;
+  const emptyBody = {
+    present: emptyBodyCount,
+    total,
+    percent: roundPercent2(emptyBodyCount, total)
+  };
+  return {
+    total_items: total,
+    fields,
+    body_populated: bodyPopulated,
+    empty_body: emptyBody
+  };
+}
+
+export {
+  lifecycleClassifierFromStatusRegistry,
+  hasMissingMetadataFilter,
+  itemMatchesMissingMetadata,
+  computeMetadataCoverage,
+  groupItemsByDimension,
+  hasContentFieldFilter,
+  itemMatchesContentFilters,
+  contentFiltersNeedCollections,
+  contentFiltersNeedBody,
+  computeContentFieldUtilization
+};
+//# sourceMappingURL=chunk-UAR2VNCK.js.map
+
+//# debugId=d9c38660-7b8d-54c6-82c4-12f9a2204743

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../../core/governance/metadata-coverage.ts","../../../../../../../../core/governance/content-fields.ts"],"sourcesContent":["/**\n * Metadata governance & coverage observability primitives.\n *\n * One dependency-light module that powers the whole metadata-governance\n * surface: missing-field selection (pm list / pm update-many), coverage\n * percentages (pm stats --metadata-coverage / pm validate), and grouped\n * lifecycle breakdowns (pm stats --by-assignee/--by-tag/--by-priority,\n * pm aggregate explicit labels).\n *\n * The module is pure: it performs no IO and imports no heavy runtime\n * dependencies. Lifecycle semantics are injected via a {@link LifecycleClassifier}\n * so callers map their runtime status registry to lifecycle buckets while the\n * pure logic here stays trivially testable with a fake classifier.\n */\n\nimport { toNonEmptyStringOrUndefined } from \"../shared/primitives.js\";\n\n/** Minimal structural shape this module needs from an item's front matter. */\nexport interface CoverageItem {\n  type: string;\n  status: string;\n  assignee?: string;\n  tags?: string[];\n  parent?: string;\n  priority?: number;\n  acceptance_criteria?: string;\n  estimated_minutes?: number;\n  resolution?: string;\n  reviewer?: string;\n  risk?: string;\n  /** Confidence is a string-like enum or a numeric score depending on workspace. */\n  confidence?: string | number;\n  sprint?: string;\n  release?: string;\n  [key: string]: unknown;\n}\n\n/** Lifecycle buckets used by grouped breakdowns and distributions. */\nexport type LifecycleBucket =\n  | \"open\"\n  | \"in_progress\"\n  | \"blocked\"\n  | \"draft\"\n  | \"closed\"\n  | \"canceled\"\n  | \"other\";\n\n/** Stable rendering order for lifecycle buckets. */\nexport const LIFECYCLE_BUCKET_ORDER: readonly LifecycleBucket[] = [\n  \"open\",\n  \"in_progress\",\n  \"blocked\",\n  \"draft\",\n  \"closed\",\n  \"canceled\",\n  \"other\",\n] as const;\n\n/**\n * Classifies a raw status string into a lifecycle bucket and reports whether a\n * status is terminal (closed/canceled). Callers build this from their resolved\n * runtime status registry via {@link lifecycleClassifierFromStatusRegistry}.\n */\nexport interface LifecycleClassifier {\n  classify(status: string): LifecycleBucket;\n  isTerminal(status: string): boolean;\n}\n\n/** The subset of a resolved runtime status registry this module consumes. */\nexport interface StatusRegistryLike {\n  alias_to_id: Map<string, string>;\n  terminal_statuses: Set<string>;\n  terminal_canceled_statuses: Set<string>;\n  blocked_statuses: Set<string>;\n  draft_statuses: Set<string>;\n  active_statuses: Set<string>;\n  open_status: string;\n}\n\nfunction normalizeStatus(status: string, registry: StatusRegistryLike): string {\n  const trimmed = status.trim().toLowerCase();\n  return registry.alias_to_id.get(trimmed) ?? trimmed;\n}\n\n/**\n * Adapt a resolved runtime status registry into a {@link LifecycleClassifier}.\n *\n * Precedence is deliberate and disjoint: canceled → closed → blocked → draft →\n * open → in_progress (active but not the default open status) → other.\n */\nexport function lifecycleClassifierFromStatusRegistry(registry: StatusRegistryLike): LifecycleClassifier {\n  return {\n    isTerminal(status: string): boolean {\n      return registry.terminal_statuses.has(normalizeStatus(status, registry));\n    },\n    classify(status: string): LifecycleBucket {\n      const id = normalizeStatus(status, registry);\n      if (registry.terminal_canceled_statuses.has(id)) {\n        return \"canceled\";\n      }\n      if (registry.terminal_statuses.has(id)) {\n        return \"closed\";\n      }\n      if (registry.blocked_statuses.has(id)) {\n        return \"blocked\";\n      }\n      if (registry.draft_statuses.has(id)) {\n        return \"draft\";\n      }\n      if (id === registry.open_status) {\n        return \"open\";\n      }\n      if (registry.active_statuses.has(id)) {\n        return \"in_progress\";\n      }\n      return \"other\";\n    },\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Missing-metadata predicates\n// ---------------------------------------------------------------------------\n\n/** True when an item has no non-empty acceptance_criteria. */\nexport function isAcMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.acceptance_criteria) === undefined;\n}\n\n/** True when an item has no finite estimated_minutes. */\nexport function isEstimateMissing(item: CoverageItem): boolean {\n  return !Number.isFinite(item.estimated_minutes);\n}\n\n/**\n * True when a terminal (closed/canceled) item has no non-empty resolution.\n * Resolution is only expected on terminal items, so open items are never\n * considered \"resolution-missing\".\n */\nexport function isResolutionMissing(item: CoverageItem, classifier: LifecycleClassifier): boolean {\n  if (!classifier.isTerminal(item.status)) {\n    return false;\n  }\n  return toNonEmptyStringOrUndefined(item.resolution) === undefined;\n}\n\n/** True when an item has no non-empty reviewer. */\nexport function isReviewerMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.reviewer) === undefined;\n}\n\n/** True when an item has no non-empty risk level. */\nexport function isRiskMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.risk) === undefined;\n}\n\n/**\n * True when an item has no confidence value. Confidence is a string-like enum\n * or a numeric score depending on workspace, so a finite number counts as\n * present and only blank/absent values are treated as missing.\n */\nexport function isConfidenceMissing(item: CoverageItem): boolean {\n  if (typeof item.confidence === \"number\") {\n    return !Number.isFinite(item.confidence);\n  }\n  return toNonEmptyStringOrUndefined(item.confidence) === undefined;\n}\n\n/** True when an item has no non-empty sprint. */\nexport function isSprintMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.sprint) === undefined;\n}\n\n/** True when an item has no non-empty release. */\nexport function isReleaseMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.release) === undefined;\n}\n\n/** Selection flags for {@link filterMissingMetadata}. */\nexport interface MissingMetadataFilters {\n  acMissing?: boolean;\n  estimatesMissing?: boolean;\n  resolutionMissing?: boolean;\n  reviewerMissing?: boolean;\n  riskMissing?: boolean;\n  confidenceMissing?: boolean;\n  sprintMissing?: boolean;\n  releaseMissing?: boolean;\n  /** Match items missing ANY of the tracked metadata fields (union). */\n  metadataMissing?: boolean;\n}\n\n/** True when any missing-metadata filter is requested. */\nexport function hasMissingMetadataFilter(filters: MissingMetadataFilters): boolean {\n  return Boolean(\n    filters.acMissing ||\n      filters.estimatesMissing ||\n      filters.resolutionMissing ||\n      filters.reviewerMissing ||\n      filters.riskMissing ||\n      filters.confidenceMissing ||\n      filters.sprintMissing ||\n      filters.releaseMissing ||\n      filters.metadataMissing,\n  );\n}\n\n/**\n * Does a single item satisfy the requested missing-metadata filters?\n *\n * Specific flags (acMissing/estimatesMissing/resolutionMissing plus the\n * governance flags reviewerMissing/riskMissing/confidenceMissing/sprintMissing/\n * releaseMissing) are ANDed together so callers can narrow precisely.\n * `metadataMissing` is ORed in as a union shortcut for \"missing any of the\n * core tracked fields\" (acceptance_criteria/estimated_minutes/resolution); it\n * deliberately excludes the governance fields so the long-standing flag keeps\n * its original meaning. When no filter is requested the item passes.\n */\nexport function itemMatchesMissingMetadata(\n  item: CoverageItem,\n  filters: MissingMetadataFilters,\n  classifier: LifecycleClassifier,\n): boolean {\n  if (!hasMissingMetadataFilter(filters)) {\n    return true;\n  }\n  if (filters.acMissing && !isAcMissing(item)) {\n    return false;\n  }\n  if (filters.estimatesMissing && !isEstimateMissing(item)) {\n    return false;\n  }\n  if (filters.resolutionMissing && !isResolutionMissing(item, classifier)) {\n    return false;\n  }\n  if (filters.reviewerMissing && !isReviewerMissing(item)) {\n    return false;\n  }\n  if (filters.riskMissing && !isRiskMissing(item)) {\n    return false;\n  }\n  if (filters.confidenceMissing && !isConfidenceMissing(item)) {\n    return false;\n  }\n  if (filters.sprintMissing && !isSprintMissing(item)) {\n    return false;\n  }\n  if (filters.releaseMissing && !isReleaseMissing(item)) {\n    return false;\n  }\n  if (filters.metadataMissing) {\n    const anyMissing =\n      isAcMissing(item) || isEstimateMissing(item) || isResolutionMissing(item, classifier);\n    if (!anyMissing) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/** Filter a list of items by the requested missing-metadata predicates. */\nexport function filterMissingMetadata<T extends CoverageItem>(\n  items: readonly T[],\n  filters: MissingMetadataFilters,\n  classifier: LifecycleClassifier,\n): T[] {\n  if (!hasMissingMetadataFilter(filters)) {\n    return [...items];\n  }\n  return items.filter((item) => itemMatchesMissingMetadata(item, filters, classifier));\n}\n\n// ---------------------------------------------------------------------------\n// Metadata coverage percentages\n// ---------------------------------------------------------------------------\n\n/** Coverage-tracked metadata fields. */\nexport type CoverageField =\n  | \"acceptance_criteria\"\n  | \"estimated_minutes\"\n  | \"resolution\"\n  | \"tags\"\n  | \"parent\";\n\n/** Stable ordering of coverage fields for rendering. */\nexport const COVERAGE_FIELD_ORDER: readonly CoverageField[] = [\n  \"acceptance_criteria\",\n  \"estimated_minutes\",\n  \"resolution\",\n  \"tags\",\n  \"parent\",\n] as const;\n\n/** Coverage of a single field: present vs applicable, with a rounded percent. */\nexport interface FieldCoverage {\n  present: number;\n  /** Items for which the field is expected (all items, except resolution = terminal only). */\n  applicable: number;\n  /** present/applicable * 100, rounded to one decimal; 100 when applicable is 0. */\n  percent: number;\n}\n\nexport interface MetadataCoverageReport {\n  overall: Record<CoverageField, FieldCoverage>;\n  by_type: Record<string, Record<CoverageField, FieldCoverage>>;\n}\n\nfunction isFieldPresent(item: CoverageItem, field: CoverageField): boolean {\n  switch (field) {\n    case \"acceptance_criteria\":\n      return !isAcMissing(item);\n    case \"estimated_minutes\":\n      return !isEstimateMissing(item);\n    case \"resolution\":\n      return toNonEmptyStringOrUndefined(item.resolution) !== undefined;\n    case \"tags\":\n      return Array.isArray(item.tags) && item.tags.length > 0;\n    default:\n      return toNonEmptyStringOrUndefined(item.parent) !== undefined;\n  }\n}\n\n/** Whether a field applies to a given item (resolution only applies to terminal items). */\nfunction isFieldApplicable(item: CoverageItem, field: CoverageField, classifier: LifecycleClassifier): boolean {\n  if (field === \"resolution\") {\n    return classifier.isTerminal(item.status);\n  }\n  return true;\n}\n\nfunction roundPercent(present: number, applicable: number): number {\n  if (applicable === 0) {\n    return 100;\n  }\n  return Math.round((present / applicable) * 1000) / 10;\n}\n\nfunction emptyFieldCoverage(): Record<CoverageField, FieldCoverage> {\n  const record = {} as Record<CoverageField, FieldCoverage>;\n  for (const field of COVERAGE_FIELD_ORDER) {\n    record[field] = { present: 0, applicable: 0, percent: 100 };\n  }\n  return record;\n}\n\nfunction accumulateCoverage(\n  target: Record<CoverageField, FieldCoverage>,\n  item: CoverageItem,\n  classifier: LifecycleClassifier,\n): void {\n  for (const field of COVERAGE_FIELD_ORDER) {\n    if (!isFieldApplicable(item, field, classifier)) {\n      continue;\n    }\n    const entry = target[field];\n    entry.applicable += 1;\n    if (isFieldPresent(item, field)) {\n      entry.present += 1;\n    }\n  }\n}\n\nfunction finalizePercentages(record: Record<CoverageField, FieldCoverage>): void {\n  for (const field of COVERAGE_FIELD_ORDER) {\n    const entry = record[field];\n    entry.percent = roundPercent(entry.present, entry.applicable);\n  }\n}\n\n/**\n * Compute metadata coverage overall and per item type. For each tracked field\n * we report present/applicable counts and a rounded percentage. Resolution is\n * scoped to terminal items (its only applicable population).\n */\nexport function computeMetadataCoverage(\n  items: readonly CoverageItem[],\n  classifier: LifecycleClassifier,\n): MetadataCoverageReport {\n  const overall = emptyFieldCoverage();\n  const byType: Record<string, Record<CoverageField, FieldCoverage>> = {};\n  for (const item of items) {\n    accumulateCoverage(overall, item, classifier);\n    const typeRecord = byType[item.type] ?? (byType[item.type] = emptyFieldCoverage());\n    accumulateCoverage(typeRecord, item, classifier);\n  }\n  finalizePercentages(overall);\n  for (const typeRecord of Object.values(byType)) {\n    finalizePercentages(typeRecord);\n  }\n  return { overall, by_type: byType };\n}\n\n// ---------------------------------------------------------------------------\n// Grouped lifecycle breakdowns\n// ---------------------------------------------------------------------------\n\n/** Dimensions a breakdown can group by. */\nexport type GroupDimension = \"assignee\" | \"priority\" | \"tag\" | \"parent\" | \"type\" | \"status\";\n\n/** Explicit labels for empty/blank group keys, by dimension. */\nconst EMPTY_GROUP_LABELS: Record<GroupDimension, string> = {\n  assignee: \"(unassigned)\",\n  priority: \"(no priority)\",\n  tag: \"(untagged)\",\n  parent: \"(unparented)\",\n  type: \"(untyped)\",\n  status: \"(no status)\",\n};\n\n/** Explicit label for an empty/blank group value for a given dimension. */\nexport function emptyGroupLabel(dimension: GroupDimension): string {\n  return EMPTY_GROUP_LABELS[dimension];\n}\n\nexport interface GroupRow {\n  /** Display label; explicit \"(unassigned)\"-style label for blank keys. */\n  label: string;\n  /** Stable structured key (null for the empty/blank group). */\n  key: string | null;\n  buckets: Record<LifecycleBucket, number>;\n  total: number;\n}\n\nexport interface GroupedBreakdown {\n  dimension: GroupDimension;\n  rows: GroupRow[];\n  /** Distinct items observed (an item can contribute to multiple tag rows). */\n  total_items: number;\n}\n\nexport interface GroupOptions {\n  /** For dimension=\"tag\": only consider tags starting with this prefix. */\n  tagPrefix?: string;\n}\n\nfunction emptyBuckets(): Record<LifecycleBucket, number> {\n  return {\n    open: 0,\n    in_progress: 0,\n    blocked: 0,\n    draft: 0,\n    closed: 0,\n    canceled: 0,\n    other: 0,\n  };\n}\n\n/**\n * Resolve the group keys an item belongs to for a dimension. Most dimensions\n * yield exactly one key (possibly null for blank); tag yields one key per\n * matching tag (or [null] when none match), so an item can span multiple rows.\n */\nfunction groupKeysForItem(item: CoverageItem, dimension: GroupDimension, options: GroupOptions): (string | null)[] {\n  switch (dimension) {\n    case \"assignee\":\n      return [toNonEmptyStringOrUndefined(item.assignee) ?? null];\n    case \"parent\":\n      return [toNonEmptyStringOrUndefined(item.parent) ?? null];\n    case \"type\":\n      return [toNonEmptyStringOrUndefined(item.type) ?? null];\n    case \"status\":\n      return [toNonEmptyStringOrUndefined(item.status) ?? null];\n    case \"priority\":\n      return [typeof item.priority === \"number\" ? `P${item.priority}` : null];\n    default: {\n      const prefix = options.tagPrefix?.trim();\n      const tags = Array.isArray(item.tags) ? item.tags : [];\n      const matching = tags.filter(\n        (tag) => typeof tag === \"string\" && tag.length > 0 && (!prefix || tag.startsWith(prefix)),\n      );\n      return matching.length > 0 ? matching : [null];\n    }\n  }\n}\n\n/**\n * Group items by a dimension into lifecycle-bucketed rows. Blank keys render\n * with an explicit \"(unassigned)\"-style label. Rows are sorted by total\n * descending, then label ascending, with the empty group sorted last on ties.\n */\nexport function groupItemsByDimension(\n  items: readonly CoverageItem[],\n  dimension: GroupDimension,\n  classifier: LifecycleClassifier,\n  options: GroupOptions = {},\n): GroupedBreakdown {\n  const rows = new Map<string, GroupRow>();\n  let totalItems = 0;\n  for (const item of items) {\n    totalItems += 1;\n    const bucket = classifier.classify(item.status);\n    for (const key of groupKeysForItem(item, dimension, options)) {\n      const mapKey = key ?? \"\u0000empty\";\n      let row = rows.get(mapKey);\n      if (!row) {\n        row = {\n          label: key ?? emptyGroupLabel(dimension),\n          key,\n          buckets: emptyBuckets(),\n          total: 0,\n        };\n        rows.set(mapKey, row);\n      }\n      row.buckets[bucket] += 1;\n      row.total += 1;\n    }\n  }\n  const sorted = [...rows.values()].sort((left, right) => {\n    if (right.total !== left.total) {\n      return right.total - left.total;\n    }\n    // All blank-key items collapse into a single row per dimension, so at most\n    // one row has key === null; it sorts last on ties.\n    if (left.key === null) {\n      return 1;\n    }\n    if (right.key === null) {\n      return -1;\n    }\n    return left.label.localeCompare(right.label);\n  });\n  return { dimension, rows: sorted, total_items: totalItems };\n}\n\n/** Lifecycle-bucket distribution across all items (for stats lifecycle section). */\nexport function computeLifecycleDistribution(\n  items: readonly CoverageItem[],\n  classifier: LifecycleClassifier,\n): Record<LifecycleBucket, number> {\n  const buckets = emptyBuckets();\n  for (const item of items) {\n    buckets[classifier.classify(item.status)] += 1;\n  }\n  return buckets;\n}\n","/**\n * Content-field governance & utilization primitives.\n *\n * \"Project management = context management\": these primitives let agents query\n * which items carry context (notes/learnings/files/docs/tests/comments/deps/\n * body, plus whether a linked test carries a runnable command) and which do\n * not. The surface powers content-field selection (pm list / pm update-many)\n * and field-utilization reporting (pm stats --field-utilization).\n *\n * The module is pure: it performs no IO and imports no heavy runtime\n * dependencies. Callers pass plain structural item shapes so the logic stays\n * trivially testable.\n */\n\n/** The content fields an item can carry context in. */\nexport type ContentField =\n  | \"notes\"\n  | \"learnings\"\n  | \"files\"\n  | \"docs\"\n  | \"tests\"\n  | \"comments\"\n  | \"deps\"\n  | \"body\"\n  | \"linked_command\";\n\n/** Stable rendering / iteration order for content fields. */\nexport const CONTENT_FIELD_ORDER: readonly ContentField[] = [\n  \"notes\",\n  \"learnings\",\n  \"files\",\n  \"docs\",\n  \"tests\",\n  \"comments\",\n  \"deps\",\n  \"body\",\n  \"linked_command\",\n] as const;\n\n/** Minimal structural shape needed: the collection arrays + optional body. */\nexport interface ContentFieldItem {\n  notes?: unknown[];\n  learnings?: unknown[];\n  files?: unknown[];\n  docs?: unknown[];\n  tests?: unknown[];\n  comments?: unknown[];\n  dependencies?: unknown[];\n  body?: string;\n  [key: string]: unknown;\n}\n\n/** True when `value` is a non-empty array. */\nfunction hasEntries(value: unknown): boolean {\n  return Array.isArray(value) && value.length > 0;\n}\n\n/** True when the body string carries non-whitespace content. */\nfunction hasBody(body: unknown): boolean {\n  return typeof body === \"string\" && body.trim().length > 0;\n}\n\n/**\n * True when at least one entry in the `tests` array carries a non-empty string\n * `command`. Tolerant of non-object / non-string entries.\n */\nfunction hasLinkedCommand(tests: unknown): boolean {\n  if (!Array.isArray(tests)) {\n    return false;\n  }\n  return tests.some((entry) => {\n    if (typeof entry !== \"object\" || entry === null) {\n      return false;\n    }\n    const command = (entry as { command?: unknown }).command;\n    return typeof command === \"string\" && command.trim().length > 0;\n  });\n}\n\n/**\n * True when the given content field carries context on this item.\n * - collection fields: `Array.isArray && length > 0`\n * - \"deps\": maps to the `dependencies` array\n * - \"body\": `typeof body === \"string\" && body.trim().length > 0`\n * - \"linked_command\": `tests` array has at least one entry with a non-empty\n *   string `command`\n */\nexport function isContentFieldPresent(item: ContentFieldItem, field: ContentField): boolean {\n  switch (field) {\n    case \"notes\":\n      return hasEntries(item.notes);\n    case \"learnings\":\n      return hasEntries(item.learnings);\n    case \"files\":\n      return hasEntries(item.files);\n    case \"docs\":\n      return hasEntries(item.docs);\n    case \"tests\":\n      return hasEntries(item.tests);\n    case \"comments\":\n      return hasEntries(item.comments);\n    case \"deps\":\n      return hasEntries(item.dependencies);\n    case \"body\":\n      return hasBody(item.body);\n    case \"linked_command\":\n      return hasLinkedCommand(item.tests);\n  }\n  // No default: every ContentField has an explicit case above, so TypeScript\n  // enforces exhaustiveness here — adding a new field without a case is a\n  // compile error rather than a silent fall-through (and no unreachable branch\n  // to dent the literal-100% coverage gate).\n}\n\n/** Per-field selection: 'present' requires the field populated, 'absent' requires it empty. */\nexport type ContentFieldSelection = \"present\" | \"absent\";\n\n/** Map of content fields to a present/absent requirement. */\nexport type ContentFieldFilters = Partial<Record<ContentField, ContentFieldSelection>>;\n\n/** True when at least one content-field selection is requested. */\nexport function hasContentFieldFilter(filters: ContentFieldFilters): boolean {\n  return CONTENT_FIELD_ORDER.some((field) => filters[field] !== undefined);\n}\n\n/**\n * Does a single item satisfy the requested content-field filters?\n *\n * AND semantics across all requested fields: each requested field must match\n * its present/absent requirement. When no filter is requested the item passes.\n */\nexport function itemMatchesContentFilters(item: ContentFieldItem, filters: ContentFieldFilters): boolean {\n  for (const field of CONTENT_FIELD_ORDER) {\n    const selection = filters[field];\n    if (selection === undefined) {\n      continue;\n    }\n    const present = isContentFieldPresent(item, field);\n    if (selection === \"present\" && !present) {\n      return false;\n    }\n    if (selection === \"absent\" && present) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/** Filter a list of items by the requested content-field selections. */\nexport function filterByContentFields<T extends ContentFieldItem>(\n  items: readonly T[],\n  filters: ContentFieldFilters,\n): T[] {\n  if (!hasContentFieldFilter(filters)) {\n    return [...items];\n  }\n  return items.filter((item) => itemMatchesContentFilters(item, filters));\n}\n\n/**\n * Whether a content-field filter set requires the heavy collections to be\n * loaded. True when any non-body field is requested (collections + tests'\n * linked command all live in the heavy front-matter arrays).\n */\nexport function contentFiltersNeedCollections(filters: ContentFieldFilters): boolean {\n  return CONTENT_FIELD_ORDER.some((field) => field !== \"body\" && filters[field] !== undefined);\n}\n\n/** Whether a content-field filter set requires the item body to be loaded. */\nexport function contentFiltersNeedBody(filters: ContentFieldFilters): boolean {\n  return filters.body !== undefined;\n}\n\n// ---------------------------------------------------------------------------\n// Field utilization\n// ---------------------------------------------------------------------------\n\n/** Utilization of a single content field: present vs total, with a rounded percent. */\nexport interface ContentFieldUtilization {\n  present: number;\n  total: number;\n  /** present/total * 100, rounded to one decimal; 100 when total is 0. */\n  percent: number;\n}\n\n/** Per-field utilization report for pm stats --field-utilization. */\nexport interface ContentFieldUtilizationReport {\n  total_items: number;\n  /** Utilization keyed by content field (includes body and linked_command). */\n  fields: Record<ContentField, ContentFieldUtilization>;\n  /** Convenience alias mirroring GH-241: identical to `fields.body`. */\n  body_populated: ContentFieldUtilization;\n  /** Items with an empty body; `present` counts the empty-bodied items. */\n  empty_body: ContentFieldUtilization;\n}\n\n/**\n * Round present/total into a one-decimal percentage. Matches the convention in\n * metadata-coverage.ts: a zero population reports 100 (nothing missing).\n */\nfunction roundPercent(present: number, total: number): number {\n  if (total === 0) {\n    return 100;\n  }\n  return Math.round((present / total) * 1000) / 10;\n}\n\nfunction emptyUtilizationFields(): Record<ContentField, ContentFieldUtilization> {\n  const record = {} as Record<ContentField, ContentFieldUtilization>;\n  for (const field of CONTENT_FIELD_ORDER) {\n    record[field] = { present: 0, total: 0, percent: 100 };\n  }\n  return record;\n}\n\n/**\n * Compute content-field utilization across a list of items. For each field we\n * report how many items populate it out of the total, plus a rounded\n * percentage. Convenience `body_populated`/`empty_body` aliases mirror GH-241.\n */\nexport function computeContentFieldUtilization(\n  items: readonly ContentFieldItem[],\n): ContentFieldUtilizationReport {\n  const fields = emptyUtilizationFields();\n  const total = items.length;\n  for (const item of items) {\n    for (const field of CONTENT_FIELD_ORDER) {\n      if (isContentFieldPresent(item, field)) {\n        fields[field].present += 1;\n      }\n    }\n  }\n  for (const field of CONTENT_FIELD_ORDER) {\n    fields[field].total = total;\n    fields[field].percent = roundPercent(fields[field].present, total);\n  }\n  const bodyPopulated = fields.body;\n  const emptyBodyCount = total - bodyPopulated.present;\n  const emptyBody: ContentFieldUtilization = {\n    present: emptyBodyCount,\n    total,\n    percent: roundPercent(emptyBodyCount, total),\n  };\n  return {\n    total_items: total,\n    fields,\n    body_populated: bodyPopulated,\n    empty_body: emptyBody,\n  };\n}\n"],"names":["roundPercent"],"mappings":";;;;;;;AA+EA,SAAS,gBAAgB,QAAgB,UAA4B;AACnE,QAAM,UAAU,OAAO,KAAI,EAAG,YAAW;AACzC,SAAO,SAAS,YAAY,IAAI,OAAO,KAAK;AAC9C;AAQM,SAAU,sCAAsC,UAA4B;AAChF,SAAO;IACL,WAAW,QAAc;AACvB,aAAO,SAAS,kBAAkB,IAAI,gBAAgB,QAAQ,QAAQ,CAAC;IACzE;IACA,SAAS,QAAc;AACrB,YAAM,KAAK,gBAAgB,QAAQ,QAAQ;AAC3C,UAAI,SAAS,2BAA2B,IAAI,EAAE,GAAG;AAC/C,eAAO;MACT;AACA,UAAI,SAAS,kBAAkB,IAAI,EAAE,GAAG;AACtC,eAAO;MACT;AACA,UAAI,SAAS,iBAAiB,IAAI,EAAE,GAAG;AACrC,eAAO;MACT;AACA,UAAI,SAAS,eAAe,IAAI,EAAE,GAAG;AACnC,eAAO;MACT;AACA,UAAI,OAAO,SAAS,aAAa;AAC/B,eAAO;MACT;AACA,UAAI,SAAS,gBAAgB,IAAI,EAAE,GAAG;AACpC,eAAO;MACT;AACA,aAAO;IACT;;AAEJ;AAOM,SAAU,YAAY,MAAkB;AAC5C,SAAO,4BAA4B,KAAK,mBAAmB,MAAM;AACnE;AAGM,SAAU,kBAAkB,MAAkB;AAClD,SAAO,CAAC,OAAO,SAAS,KAAK,iBAAiB;AAChD;AAOM,SAAU,oBAAoB,MAAoB,YAA+B;AACrF,MAAI,CAAC,WAAW,WAAW,KAAK,MAAM,GAAG;AACvC,WAAO;EACT;AACA,SAAO,4BAA4B,KAAK,UAAU,MAAM;AAC1D;AAGM,SAAU,kBAAkB,MAAkB;AAClD,SAAO,4BAA4B,KAAK,QAAQ,MAAM;AACxD;AAGM,SAAU,cAAc,MAAkB;AAC9C,SAAO,4BAA4B,KAAK,IAAI,MAAM;AACpD;AAOM,SAAU,oBAAoB,MAAkB;AACpD,MAAI,OAAO,KAAK,eAAe,UAAU;AACvC,WAAO,CAAC,OAAO,SAAS,KAAK,UAAU;EACzC;AACA,SAAO,4BAA4B,KAAK,UAAU,MAAM;AAC1D;AAGM,SAAU,gBAAgB,MAAkB;AAChD,SAAO,4BAA4B,KAAK,MAAM,MAAM;AACtD;AAGM,SAAU,iBAAiB,MAAkB;AACjD,SAAO,4BAA4B,KAAK,OAAO,MAAM;AACvD;AAiBM,SAAU,yBAAyB,SAA+B;AACtE,SAAO,QACL,QAAQ,aACN,QAAQ,oBACR,QAAQ,qBACR,QAAQ,mBACR,QAAQ,eACR,QAAQ,qBACR,QAAQ,iBACR,QAAQ,kBACR,QAAQ,eAAe;AAE7B;AAaM,SAAU,2BACd,MACA,SACA,YAA+B;AAE/B,MAAI,CAAC,yBAAyB,OAAO,GAAG;AACtC,WAAO;EACT;AACA,MAAI,QAAQ,aAAa,CAAC,YAAY,IAAI,GAAG;AAC3C,WAAO;EACT;AACA,MAAI,QAAQ,oBAAoB,CAAC,kBAAkB,IAAI,GAAG;AACxD,WAAO;EACT;AACA,MAAI,QAAQ,qBAAqB,CAAC,oBAAoB,MAAM,UAAU,GAAG;AACvE,WAAO;EACT;AACA,MAAI,QAAQ,mBAAmB,CAAC,kBAAkB,IAAI,GAAG;AACvD,WAAO;EACT;AACA,MAAI,QAAQ,eAAe,CAAC,cAAc,IAAI,GAAG;AAC/C,WAAO;EACT;AACA,MAAI,QAAQ,qBAAqB,CAAC,oBAAoB,IAAI,GAAG;AAC3D,WAAO;EACT;AACA,MAAI,QAAQ,iBAAiB,CAAC,gBAAgB,IAAI,GAAG;AACnD,WAAO;EACT;AACA,MAAI,QAAQ,kBAAkB,CAAC,iBAAiB,IAAI,GAAG;AACrD,WAAO;EACT;AACA,MAAI,QAAQ,iBAAiB;AAC3B,UAAM,aACJ,YAAY,IAAI,KAAK,kBAAkB,IAAI,KAAK,oBAAoB,MAAM,UAAU;AACtF,QAAI,CAAC,YAAY;AACf,aAAO;IACT;EACF;AACA,SAAO;AACT;AA2BO,IAAM,uBAAiD;EAC5D;EACA;EACA;EACA;EACA;;AAiBF,SAAS,eAAe,MAAoB,OAAoB;AAC9D,UAAQ,OAAO;IACb,KAAK;AACH,aAAO,CAAC,YAAY,IAAI;IAC1B,KAAK;AACH,aAAO,CAAC,kBAAkB,IAAI;IAChC,KAAK;AACH,aAAO,4BAA4B,KAAK,UAAU,MAAM;IAC1D,KAAK;AACH,aAAO,MAAM,QAAQ,KAAK,IAAI,KAAK,KAAK,KAAK,SAAS;IACxD;AACE,aAAO,4BAA4B,KAAK,MAAM,MAAM;EACxD;AACF;AAGA,SAAS,kBAAkB,MAAoB,OAAsB,YAA+B;AAClG,MAAI,UAAU,cAAc;AAC1B,WAAO,WAAW,WAAW,KAAK,MAAM;EAC1C;AACA,SAAO;AACT;AAEA,SAAS,aAAa,SAAiB,YAAkB;AACvD,MAAI,eAAe,GAAG;AACpB,WAAO;EACT;AACA,SAAO,KAAK,MAAO,UAAU,aAAc,GAAI,IAAI;AACrD;AAEA,SAAS,qBAAkB;AACzB,QAAM,SAAS,CAAA;AACf,aAAW,SAAS,sBAAsB;AACxC,WAAO,KAAK,IAAI,EAAE,SAAS,GAAG,YAAY,GAAG,SAAS,IAAG;EAC3D;AACA,SAAO;AACT;AAEA,SAAS,mBACP,QACA,MACA,YAA+B;AAE/B,aAAW,SAAS,sBAAsB;AACxC,QAAI,CAAC,kBAAkB,MAAM,OAAO,UAAU,GAAG;AAC/C;IACF;AACA,UAAM,QAAQ,OAAO,KAAK;AAC1B,UAAM,cAAc;AACpB,QAAI,eAAe,MAAM,KAAK,GAAG;AAC/B,YAAM,WAAW;IACnB;EACF;AACF;AAEA,SAAS,oBAAoB,QAA4C;AACvE,aAAW,SAAS,sBAAsB;AACxC,UAAM,QAAQ,OAAO,KAAK;AAC1B,UAAM,UAAU,aAAa,MAAM,SAAS,MAAM,UAAU;EAC9D;AACF;AAOM,SAAU,wBACd,OACA,YAA+B;AAE/B,QAAM,UAAU,mBAAkB;AAClC,QAAM,SAA+D,CAAA;AACrE,aAAW,QAAQ,OAAO;AACxB,uBAAmB,SAAS,MAAM,UAAU;AAC5C,UAAM,aAAa,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,IAAI,IAAI,mBAAkB;AAC/E,uBAAmB,YAAY,MAAM,UAAU;EACjD;AACA,sBAAoB,OAAO;AAC3B,aAAW,cAAc,OAAO,OAAO,MAAM,GAAG;AAC9C,wBAAoB,UAAU;EAChC;AACA,SAAO,EAAE,SAAS,SAAS,OAAM;AACnC;AAUA,IAAM,qBAAqD;EACzD,UAAU;EACV,UAAU;EACV,KAAK;EACL,QAAQ;EACR,MAAM;EACN,QAAQ;;AAIJ,SAAU,gBAAgB,WAAyB;AACvD,SAAO,mBAAmB,SAAS;AACrC;AAuBA,SAAS,eAAY;AACnB,SAAO;IACL,MAAM;IACN,aAAa;IACb,SAAS;IACT,OAAO;IACP,QAAQ;IACR,UAAU;IACV,OAAO;;AAEX;AAOA,SAAS,iBAAiB,MAAoB,WAA2B,SAAqB;AAC5F,UAAQ,WAAW;IACjB,KAAK;AACH,aAAO,CAAC,4BAA4B,KAAK,QAAQ,KAAK,IAAI;IAC5D,KAAK;AACH,aAAO,CAAC,4BAA4B,KAAK,MAAM,KAAK,IAAI;IAC1D,KAAK;AACH,aAAO,CAAC,4BAA4B,KAAK,IAAI,KAAK,IAAI;IACxD,KAAK;AACH,aAAO,CAAC,4BAA4B,KAAK,MAAM,KAAK,IAAI;IAC1D,KAAK;AACH,aAAO,CAAC,OAAO,KAAK,aAAa,WAAW,IAAI,KAAK,QAAQ,KAAK,IAAI;IACxE,SAAS;AACP,YAAM,SAAS,QAAQ,WAAW,KAAI;AACtC,YAAM,OAAO,MAAM,QAAQ,KAAK,IAAI,IAAI,KAAK,OAAO,CAAA;AACpD,YAAM,WAAW,KAAK,OACpB,CAAC,QAAQ,OAAO,QAAQ,YAAY,IAAI,SAAS,MAAM,CAAC,UAAU,IAAI,WAAW,MAAM,EAAE;AAE3F,aAAO,SAAS,SAAS,IAAI,WAAW,CAAC,IAAI;IAC/C;EACF;AACF;AAOM,SAAU,sBACd,OACA,WACA,YACA,UAAwB,CAAA,GAAE;AAE1B,QAAM,OAAO,oBAAI,IAAG;AACpB,MAAI,aAAa;AACjB,aAAW,QAAQ,OAAO;AACxB,kBAAc;AACd,UAAM,SAAS,WAAW,SAAS,KAAK,MAAM;AAC9C,eAAW,OAAO,iBAAiB,MAAM,WAAW,OAAO,GAAG;AAC5D,YAAM,SAAS,OAAO;AACtB,UAAI,MAAM,KAAK,IAAI,MAAM;AACzB,UAAI,CAAC,KAAK;AACR,cAAM;UACJ,OAAO,OAAO,gBAAgB,SAAS;UACvC;UACA,SAAS,aAAY;UACrB,OAAO;;AAET,aAAK,IAAI,QAAQ,GAAG;MACtB;AACA,UAAI,QAAQ,MAAM,KAAK;AACvB,UAAI,SAAS;IACf;EACF;AACA,QAAM,SAAS,CAAC,GAAG,KAAK,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAAS;AACrD,QAAI,MAAM,UAAU,KAAK,OAAO;AAC9B,aAAO,MAAM,QAAQ,KAAK;IAC5B;AAGA,QAAI,KAAK,QAAQ,MAAM;AACrB,aAAO;IACT;AACA,QAAI,MAAM,QAAQ,MAAM;AACtB,aAAO;IACT;AACA,WAAO,KAAK,MAAM,cAAc,MAAM,KAAK;EAC7C,CAAC;AACD,SAAO,EAAE,WAAW,MAAM,QAAQ,aAAa,WAAU;AAC3D;;;AC/eO,IAAM,sBAA+C;EAC1D;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;AAiBF,SAAS,WAAW,OAAc;AAChC,SAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,SAAS;AAChD;AAGA,SAAS,QAAQ,MAAa;AAC5B,SAAO,OAAO,SAAS,YAAY,KAAK,KAAI,EAAG,SAAS;AAC1D;AAMA,SAAS,iBAAiB,OAAc;AACtC,MAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACzB,WAAO;EACT;AACA,SAAO,MAAM,KAAK,CAAC,UAAS;AAC1B,QAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAC/C,aAAO;IACT;AACA,UAAM,UAAW,MAAgC;AACjD,WAAO,OAAO,YAAY,YAAY,QAAQ,KAAI,EAAG,SAAS;EAChE,CAAC;AACH;AAUM,SAAU,sBAAsB,MAAwB,OAAmB;AAC/E,UAAQ,OAAO;IACb,KAAK;AACH,aAAO,WAAW,KAAK,KAAK;IAC9B,KAAK;AACH,aAAO,WAAW,KAAK,SAAS;IAClC,KAAK;AACH,aAAO,WAAW,KAAK,KAAK;IAC9B,KAAK;AACH,aAAO,WAAW,KAAK,IAAI;IAC7B,KAAK;AACH,aAAO,WAAW,KAAK,KAAK;IAC9B,KAAK;AACH,aAAO,WAAW,KAAK,QAAQ;IACjC,KAAK;AACH,aAAO,WAAW,KAAK,YAAY;IACrC,KAAK;AACH,aAAO,QAAQ,KAAK,IAAI;IAC1B,KAAK;AACH,aAAO,iBAAiB,KAAK,KAAK;EACtC;AAKF;AASM,SAAU,sBAAsB,SAA4B;AAChE,SAAO,oBAAoB,KAAK,CAAC,UAAU,QAAQ,KAAK,MAAM,MAAS;AACzE;AAQM,SAAU,0BAA0B,MAAwB,SAA4B;AAC5F,aAAW,SAAS,qBAAqB;AACvC,UAAM,YAAY,QAAQ,KAAK;AAC/B,QAAI,cAAc,QAAW;AAC3B;IACF;AACA,UAAM,UAAU,sBAAsB,MAAM,KAAK;AACjD,QAAI,cAAc,aAAa,CAAC,SAAS;AACvC,aAAO;IACT;AACA,QAAI,cAAc,YAAY,SAAS;AACrC,aAAO;IACT;EACF;AACA,SAAO;AACT;AAkBM,SAAU,8BAA8B,SAA4B;AACxE,SAAO,oBAAoB,KAAK,CAAC,UAAU,UAAU,UAAU,QAAQ,KAAK,MAAM,MAAS;AAC7F;AAGM,SAAU,uBAAuB,SAA4B;AACjE,SAAO,QAAQ,SAAS;AAC1B;AA6BA,SAASA,cAAa,SAAiB,OAAa;AAClD,MAAI,UAAU,GAAG;AACf,WAAO;EACT;AACA,SAAO,KAAK,MAAO,UAAU,QAAS,GAAI,IAAI;AAChD;AAEA,SAAS,yBAAsB;AAC7B,QAAM,SAAS,CAAA;AACf,aAAW,SAAS,qBAAqB;AACvC,WAAO,KAAK,IAAI,EAAE,SAAS,GAAG,OAAO,GAAG,SAAS,IAAG;EACtD;AACA,SAAO;AACT;AAOM,SAAU,+BACd,OAAkC;AAElC,QAAM,SAAS,uBAAsB;AACrC,QAAM,QAAQ,MAAM;AACpB,aAAW,QAAQ,OAAO;AACxB,eAAW,SAAS,qBAAqB;AACvC,UAAI,sBAAsB,MAAM,KAAK,GAAG;AACtC,eAAO,KAAK,EAAE,WAAW;MAC3B;IACF;EACF;AACA,aAAW,SAAS,qBAAqB;AACvC,WAAO,KAAK,EAAE,QAAQ;AACtB,WAAO,KAAK,EAAE,UAAUA,cAAa,OAAO,KAAK,EAAE,SAAS,KAAK;EACnE;AACA,QAAM,gBAAgB,OAAO;AAC7B,QAAM,iBAAiB,QAAQ,cAAc;AAC7C,QAAM,YAAqC;IACzC,SAAS;IACT;IACA,SAASA,cAAa,gBAAgB,KAAK;;AAE7C,SAAO;IACL,aAAa;IACb;IACA,gBAAgB;IAChB,YAAY;;AAEhB","debugId":"d9c38660-7b8d-54c6-82c4-12f9a2204743"}

package/dist/cli-bundle/chunks/{chunk-NN6RKGFW.js → chunk-UBMCSJXX.js}

@@ -2,11 +2,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]="5290e29c-a147-56df-94c4-59907951e37f")}catch(e){}}();
 import {
   resolveTypeName
-} from "./chunk-32XSW44C.js";
+} from "./chunk-ZONXMSVB.js";
 import {
   EXIT_CODE,
   PmCliError
-} from "./chunk-S2CDTRJ6.js";
+} from "./chunk-KTVETP66.js";
 
 // dist/cli/shared-parsers.js
 function parseLimit(raw, label = "--limit") {
@@ -52,6 +52,6 @@ export {
   parsePriority,
   parseType
 };
-//# sourceMappingURL=chunk-NN6RKGFW.js.map
+//# sourceMappingURL=chunk-UBMCSJXX.js.map
 
 //# debugId=5290e29c-a147-56df-94c4-59907951e37f

package/dist/cli-bundle/chunks/{chunk-JE5IZXDS.js → chunk-UUKORJSN.js}

@@ -3,16 +3,16 @@
 import {
   hashDocument,
   toItemRecord
-} from "./chunk-L6YQONLM.js";
+} from "./chunk-7K2MXFMX.js";
 import {
   canonicalDocument
-} from "./chunk-QQG4HEX7.js";
+} from "./chunk-GAVE4MYM.js";
 import {
   FRONT_MATTER_KEY_ORDER,
   orderObject,
   sha256Hex,
   stableStringify
-} from "./chunk-S2CDTRJ6.js";
+} from "./chunk-KTVETP66.js";
 
 // dist/core/history/replay.js
 import jsonPatch from "fast-json-patch";
@@ -232,6 +232,6 @@ export {
   reanchorHistoryEntries,
   historyEntriesToRaw
 };
-//# sourceMappingURL=chunk-JE5IZXDS.js.map
+//# sourceMappingURL=chunk-UUKORJSN.js.map
 
 //# debugId=eaf45328-2532-5e1c-9570-442b894b03d3

package/dist/cli-bundle/chunks/{chunk-R4VWYWRN.js → chunk-W3HFLORZ.js}

@@ -2,7 +2,7 @@
 !(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] = "d65fd5ea-fcaf-5004-97da-9cdcbc7b334a");
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "9264c187-2e9a-59c0-8e99-f7af400748ee");
   } catch (e2) {
   }
 })();
@@ -76,6 +76,11 @@ var REMEDIATION_REGISTRY = Object.freeze([
     command: "pm health --check-telemetry",
     summary: "Client schema is behind server; upgrade pm-cli to emit the latest event shape."
   },
+  {
+    code: "telemetry_otel_export_failing",
+    command: "pm health --check-telemetry",
+    summary: "OTLP trace spans are queued but the traces endpoint export is failing; spans retry automatically on the next reachable command, or set PM_TELEMETRY_OTEL_DISABLED=1 to skip OTLP export. Advisory only."
+  },
   // --- pm health: integrity ---
   {
     code: "integrity_item_unreadable",
@@ -309,4 +314,4 @@ export {
   buildRemediationMap,
   buildRemediationCommands
 };
-//# sourceMappingURL=chunk-R4VWYWRN.js.map
+//# sourceMappingURL=chunk-W3HFLORZ.js.map

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

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../../../../core/diagnostics/remediation.ts"],
+  "sourcesContent": ["/**\n * Shared machine-executable remediation registry.\n *\n * `pm health` and `pm validate` both emit stable, colon-delimited warning tokens\n * (for example `history_drift_missing_stream:pm-abcd` or\n * `validate_resolution_missing_fields:3`). Agents that gate on these commands\n * previously had to hardcode the mapping from a warning code to the `pm` command\n * that fixes it. This module is the single source of truth for that mapping so\n * `pm health --json` (per-check `remediation_map`) and `pm validate --fix-hints`\n * (per-check `fix_hints`) can both surface executable remediation without any\n * duplicated, drift-prone lookup tables.\n *\n * Semantics of {@link RemediationEntry.command}: the suggested next `pm` command\n * an operator/agent should run to resolve findings with that code. Per-item\n * findings use an `<id>` placeholder (callers that have the concrete id may\n * substitute it); findings whose only fix is a manual file edit point at the\n * most useful diagnostic/repair command and describe the manual step in\n * {@link RemediationEntry.summary}.\n */\n\nexport interface RemediationEntry {\n  /**\n   * Stable warning-code prefix this entry resolves. A warning matches when it\n   * equals this code or begins with `<code>:`. Registry codes are mutually\n   * exclusive under that colon-boundary rule (no code is a `:`-delimited prefix\n   * of another — e.g. `settings:id_prefix_empty` is distinct from a bare\n   * `settings`, which is intentionally not registered), so `resolveRemediation`\n   * uses first-match with no ordering dependency.\n   */\n  readonly code: string;\n  /** Executable `pm` command (or imperative) that resolves the finding. May contain an `<id>` placeholder. */\n  readonly command: string;\n  /** One-line description of what the command does / which manual step it covers. */\n  readonly summary: string;\n}\n\n/**\n * Registry of every non-extension `pm health` / `pm validate` warning code and\n * its remediation. Extension findings keep their richer, contextual\n * `details.triage.remediation` produced by the extension health triage and are\n * intentionally excluded here (see pm-0hnu: \"all non-extension checks\").\n */\nexport const REMEDIATION_REGISTRY: readonly RemediationEntry[] = Object.freeze([\n  // --- pm health: directories ---\n  {\n    code: \"missing_directory\",\n    command: \"pm init\",\n    summary: \"Recreate missing tracker directories (pm init is idempotent and restores the scaffold).\",\n  },\n  // --- pm health: settings (read/parse) ---\n  {\n    code: \"settings_read_invalid_json\",\n    command: \"pm config list --json\",\n    summary:\n      \"settings.json is not valid JSON and pm fell back to defaults; fix the syntax error in the reported path, then re-run.\",\n  },\n  {\n    code: \"settings_read_invalid_schema\",\n    command: \"pm config list --json\",\n    summary:\n      \"settings.json failed schema validation and pm fell back to defaults; correct the reported key in the file, then re-run.\",\n  },\n  {\n    code: \"settings_read_merge_failed\",\n    command: \"pm config list --json\",\n    summary: \"Global/project settings could not be merged; reconcile the conflicting keys in the reported settings files.\",\n  },\n  // --- pm health: settings_values ---\n  {\n    code: \"settings:id_prefix_empty\",\n    command: \"pm config list --json\",\n    summary: 'id_prefix is empty; set a non-empty \"id_prefix\" in settings.json so generated item ids are well-formed.',\n  },\n  {\n    code: \"settings:locks_ttl_non_positive\",\n    command: \"pm config list --json\",\n    summary: 'locks.ttl_seconds must be positive; set a positive \"locks.ttl_seconds\" in settings.json.',\n  },\n  // --- pm health: telemetry (advisory) ---\n  {\n    code: \"telemetry_state_invalid_json\",\n    command: \"pm health --check-telemetry\",\n    summary: \"Local telemetry state file is corrupt; pm recreates it on the next flush. Advisory only.\",\n  },\n  {\n    code: \"telemetry_queue_invalid_rows\",\n    command: \"pm health --check-telemetry\",\n    summary: \"The telemetry queue has unparseable rows; they are skipped on the next flush. Advisory only.\",\n  },\n  {\n    code: \"telemetry_queue_pending\",\n    command: \"pm health --check-telemetry\",\n    summary: \"Telemetry events are queued; they flush automatically on the next reachable command. Advisory only.\",\n  },\n  {\n    code: \"telemetry_queue_high_retries\",\n    command: \"pm telemetry flush\",\n    summary:\n      \"Some queued telemetry events are near retry exhaustion; flush now and verify endpoint reachability before entries are dropped.\",\n  },\n  {\n    code: \"telemetry_endpoint_probe_failed\",\n    command: \"pm health --check-telemetry\",\n    summary: \"The telemetry endpoint is unreachable; events stay queued until it recovers. Advisory only.\",\n  },\n  {\n    code: \"telemetry_endpoint_probe_http_status\",\n    command: \"pm health --check-telemetry\",\n    summary: \"The telemetry endpoint returned a non-success status; events stay queued until it recovers. Advisory only.\",\n  },\n  {\n    code: \"telemetry_schema_version_behind\",\n    command: \"pm health --check-telemetry\",\n    summary: \"Client schema is behind server; upgrade pm-cli to emit the latest event shape.\",\n  },\n  {\n    code: \"telemetry_otel_export_failing\",\n    command: \"pm health --check-telemetry\",\n    summary:\n      \"OTLP trace spans are queued but the traces endpoint export is failing; spans retry automatically on the next reachable command, or set PM_TELEMETRY_OTEL_DISABLED=1 to skip OTLP export. Advisory only.\",\n  },\n  // --- pm health: integrity ---\n  {\n    code: \"integrity_item_unreadable\",\n    command: \"pm validate --check-files --verbose-diagnostics\",\n    summary: \"An item file could not be read; restore or repair the file at the reported path.\",\n  },\n  {\n    code: \"integrity_item_parse_failed\",\n    command: \"pm validate --check-files --verbose-diagnostics\",\n    summary: \"An item file failed to parse; fix the malformed front matter at the reported path.\",\n  },\n  {\n    code: \"integrity_item_conflict_marker\",\n    command: \"pm validate --check-files --verbose-diagnostics\",\n    summary: \"An item file contains Git conflict markers; resolve the <<<<<<< / >>>>>>> markers at the reported line.\",\n  },\n  {\n    code: \"integrity_history_unreadable\",\n    command: \"pm history-repair <id>\",\n    summary: \"A history stream could not be read; re-anchor the affected item's history chain.\",\n  },\n  {\n    code: \"integrity_history_invalid_json\",\n    command: \"pm history-repair <id>\",\n    summary: \"A history stream contains invalid JSON; re-anchor the affected item's history chain.\",\n  },\n  {\n    code: \"integrity_history_conflict_marker\",\n    command: \"pm history-repair <id>\",\n    summary: \"A history stream contains Git conflict markers; resolve the markers, then re-anchor the chain.\",\n  },\n  // --- pm health: history_drift ---\n  // `pm health` rewrites these commands to `pm history-repair --all` in the\n  // per-check remediation_map when more than one stream is drifted.\n  {\n    code: \"history_drift_missing_stream\",\n    command: \"pm history-repair <id>\",\n    summary: \"The item has no history stream; re-anchor the chain to rebuild it (pm history-repair --all repairs every drifted stream in one pass).\",\n  },\n  {\n    code: \"history_drift_unreadable_stream\",\n    command: \"pm history-repair <id>\",\n    summary: \"The item's history stream is unreadable; re-anchor the chain (pm history-repair --all repairs every drifted stream in one pass).\",\n  },\n  {\n    code: \"history_drift_hash_mismatch\",\n    command: \"pm history-repair <id>\",\n    summary: \"The item's content hash no longer matches its history; re-anchor the chain (pm history-repair --all repairs every drifted stream in one pass).\",\n  },\n  {\n    code: \"history_drift_chain_mismatch\",\n    command: \"pm history-repair <id>\",\n    summary: \"The item's history chain is broken; re-anchor the chain (pm history-repair --all repairs every drifted stream in one pass).\",\n  },\n  // --- pm health: locks ---\n  {\n    code: \"locks_stale_count\",\n    command: \"pm gc --scope locks\",\n    summary:\n      \"Stale item-claim locks (embedded ttl elapsed) can block mutations; sweep them — gc retains active and unparseable locks.\",\n  },\n  {\n    code: \"locks_unreadable\",\n    command: \"pm gc --scope locks --dry-run\",\n    summary:\n      \"Some lock files could not be read; preview the sweep and inspect the unreadable files manually — gc never deletes what it cannot read.\",\n  },\n  // --- pm health: vectorization ---\n  {\n    code: \"vectorization_stale_items_remaining\",\n    command: \"pm health --refresh-vectors\",\n    summary: \"Some items have stale embeddings; refresh vectors so semantic search results stay current.\",\n  },\n  {\n    code: \"vectorization_embedding_identity_changed\",\n    command: \"pm reindex --mode semantic\",\n    summary: \"Embedding provider/model changed since the last index; run a semantic reindex to rebuild vectors.\",\n  },\n  // --- pm validate: metadata ---\n  // Note: validate_metadata_missing_author has no entry on purpose. `pm update\n  // --author` sets the mutation/audit author (history), not the item's\n  // `metadata.author` front-matter field, and there is no CLI flag that writes\n  // that field — so emitting a command here would record an audit entry without\n  // clearing the finding. A missing item author must be restored at the source.\n  {\n    code: \"validate_metadata_missing_acceptance_criteria\",\n    command: 'pm update <id> --acceptance-criteria \"<criteria>\"',\n    summary: \"Backfill the missing acceptance criteria on the reported item(s).\",\n  },\n  {\n    code: \"validate_metadata_missing_estimate\",\n    command: 'pm update <id> --estimate \"<estimate>\"',\n    summary: \"Backfill the missing estimate on the reported item(s).\",\n  },\n  {\n    code: \"validate_metadata_missing_close_reason\",\n    command: 'pm update <id> --close-reason \"<reason>\"',\n    summary: \"Backfill the missing close reason on the reported closed item(s).\",\n  },\n  {\n    code: \"validate_metadata_missing_reviewer\",\n    command: 'pm update <id> --reviewer \"<name>\"',\n    summary: \"Backfill the missing reviewer on the reported item(s).\",\n  },\n  {\n    code: \"validate_metadata_missing_risk\",\n    command: 'pm update <id> --risk \"<level>\"',\n    summary: \"Backfill the missing risk on the reported item(s).\",\n  },\n  {\n    code: \"validate_metadata_missing_confidence\",\n    command: 'pm update <id> --confidence \"<level>\"',\n    summary: \"Backfill the missing confidence on the reported item(s).\",\n  },\n  {\n    code: \"validate_metadata_missing_sprint\",\n    command: 'pm update <id> --sprint \"<sprint>\"',\n    summary: \"Backfill the missing sprint on the reported item(s).\",\n  },\n  {\n    code: \"validate_metadata_missing_release\",\n    command: 'pm update <id> --release \"<release>\"',\n    summary: \"Backfill the missing release on the reported item(s).\",\n  },\n  {\n    code: \"validate_metadata_custom_profile_missing_required_fields\",\n    command: 'pm config set metadata-required-fields --criterion \"<field>\"',\n    summary:\n      \"Config-driven finding: the custom metadata profile has no required fields configured and falls back to core, so configure the fields rather than mutating items.\",\n  },\n  // --- pm validate: resolution ---\n  {\n    code: \"validate_resolution_missing_fields\",\n    command: 'pm update <id> --resolution \"<how resolved>\"',\n    summary: \"Backfill resolution / expected_result / actual_result on the reported closed item(s).\",\n  },\n  // --- pm validate: lifecycle ---\n  {\n    code: \"validate_lifecycle_active_closure_like_metadata\",\n    command: \"pm update <id> --unset <closure-like-field>\",\n    summary:\n      \"Clear the closure-like field the validator flags on this active item — the detail row names it (resolution / actual-result / blocked-reason) — or close the item if it is actually done.\",\n  },\n  {\n    code: \"validate_lifecycle_active_terminal_parent\",\n    command: \"pm update <id> --parent <active-parent-id>\",\n    summary: \"Reopen the terminal parent or move the active child under a non-terminal parent.\",\n  },\n  {\n    code: \"validate_lifecycle_stale_blockers\",\n    command: \"pm update <id> --unset blocked-by --unset blocked-reason\",\n    summary:\n      \"Resolve the stale blocker the validator flags: clear blocked-by/blocked-reason when they linger on a non-blocked item or report a resolved blocker; if instead a blocked item is missing blocker context, add the context or move it out of a blocked status.\",\n  },\n  {\n    code: \"validate_lifecycle_dependency_cycles_error\",\n    command: \"pm update <id> --dep-remove <dep-id>\",\n    summary: \"Break the dependency cycle by removing one edge from the reported cycle.\",\n  },\n  {\n    code: \"validate_lifecycle_dependency_cycles\",\n    command: \"pm update <id> --dep-remove <dep-id>\",\n    summary: \"Break the dependency cycle by removing one edge from the reported cycle.\",\n  },\n  // --- pm validate: files ---\n  {\n    code: \"validate_files_missing_linked_paths\",\n    command: \"pm <files|docs> <id> --remove <path>\",\n    summary:\n      \"The check spans both item.files and item.docs under one code: restore the missing linked artifact, or unlink it with pm files (linked file) or pm docs (linked doc).\",\n  },\n  {\n    code: \"validate_files_orphaned_paths\",\n    command: \"pm <files|docs> <id> --add <path>\",\n    summary:\n      \"Link the orphaned artifact with pm files (file) or pm docs (doc), or remove it from the workspace.\",\n  },\n  {\n    code: \"validate_files_tracked_all_strict_forces_pm_internals\",\n    command: \"pm validate --check-files --include-pm-internals\",\n    summary: \"tracked-all-strict scan flagged pm internals; re-run with --include-pm-internals or a softer --scan-mode.\",\n  },\n  // --- pm validate: history_drift ---\n  {\n    code: \"validate_history_drift_missing_streams\",\n    command: \"pm history-repair <id>\",\n    summary: \"Re-anchor the history chains of the items missing a history stream.\",\n  },\n  {\n    code: \"validate_history_drift_unreadable_streams\",\n    command: \"pm history-repair <id>\",\n    summary: \"Re-anchor the history chains of the items with an unreadable history stream.\",\n  },\n  {\n    code: \"validate_history_drift_hash_mismatches\",\n    command: \"pm history-repair <id>\",\n    summary: \"Re-anchor the history chains of the items whose content hash drifted.\",\n  },\n  {\n    code: \"validate_history_drift_chain_mismatches\",\n    command: \"pm history-repair <id>\",\n    summary: \"Re-anchor the history chains of the items with a broken history chain.\",\n  },\n  // --- pm validate: command_references ---\n  {\n    code: \"validate_command_references_stale_pm_ids\",\n    command: 'pm update <id> --replace-tests --test \"command=<corrected-command>\" [--test ...]',\n    summary:\n      \"Correct the stale pm-ID inside the item's linked test command (the check scans tests[].command, not the body). --replace-tests overwrites the entire tests list, so re-include the item's other linked tests in the same call.\",\n  },\n]);\n\n/**\n * Resolve the remediation entry for a warning token, or `undefined` when no\n * entry is registered. A warning matches an entry when it equals the entry code\n * or begins with `<code>:` (the colon boundary keeps sibling codes such as\n * `validate_lifecycle_dependency_cycles` and\n * `validate_lifecycle_dependency_cycles_error` disjoint).\n *\n * First match is intentional and correct: registry codes are mutually exclusive\n * under the colon-boundary rule, so at most one entry can ever match a warning\n * and order is irrelevant. That invariant is enforced by a test (see\n * remediation-registry.spec.ts \"keeps every registry code mutually exclusive\"),\n * which is why this stays a simple linear scan rather than a longest-prefix\n * search — a longest-prefix tie-break is unreachable with disjoint codes.\n *\n * Accepts unknown input defensively (this is an exported helper SDK consumers\n * may call from untyped JS): a non-string `warning` resolves to `undefined`.\n */\nexport function resolveRemediation(warning: string): RemediationEntry | undefined {\n  if (typeof warning !== \"string\") {\n    return undefined;\n  }\n  const normalized = warning.trim();\n  for (const entry of REMEDIATION_REGISTRY) {\n    if (normalized === entry.code || normalized.startsWith(`${entry.code}:`)) {\n      return entry;\n    }\n  }\n  return undefined;\n}\n\n/**\n * Build a compact `remediation_map` (code -> command) for a set of warning\n * tokens. First match wins per code; unknown codes are skipped. Used by\n * `pm health --json` per-check details and as the source of deduped executable\n * commands for `pm validate --fix-hints`.\n */\nexport function buildRemediationMap(warnings: Iterable<string>): Record<string, string> {\n  const map: Record<string, string> = {};\n  for (const warning of warnings) {\n    const entry = resolveRemediation(warning);\n    if (entry !== undefined && !Object.prototype.hasOwnProperty.call(map, entry.code)) {\n      map[entry.code] = entry.command;\n    }\n  }\n  return map;\n}\n\n/**\n * Build a deduped, ordered list of executable remediation commands for a set of\n * warning tokens (one command per distinct matched code). Used by\n * `pm validate --fix-hints` for checks that do not already emit per-row\n * remediation commands.\n */\nexport function buildRemediationCommands(warnings: Iterable<string>): string[] {\n  return Object.values(buildRemediationMap(warnings));\n}\n"],
+  "mappings": ";;;;;;;;AA0CO,IAAM,uBAAoD,OAAO,OAAO;;EAE7E;IACE,MAAM;IACN,SAAS;IACT,SAAS;;;EAGX;IACE,MAAM;IACN,SAAS;IACT,SACE;;EAEJ;IACE,MAAM;IACN,SAAS;IACT,SACE;;EAEJ;IACE,MAAM;IACN,SAAS;IACT,SAAS;;;EAGX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;;EAGX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SACE;;EAEJ;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SACE;;;EAGJ;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;;;;EAKX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;;EAGX;IACE,MAAM;IACN,SAAS;IACT,SACE;;EAEJ;IACE,MAAM;IACN,SAAS;IACT,SACE;;;EAGJ;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;;;;;;;EAQX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SACE;;;EAGJ;IACE,MAAM;IACN,SAAS;IACT,SAAS;;;EAGX;IACE,MAAM;IACN,SAAS;IACT,SACE;;EAEJ;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SACE;;EAEJ;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;;EAGX;IACE,MAAM;IACN,SAAS;IACT,SACE;;EAEJ;IACE,MAAM;IACN,SAAS;IACT,SACE;;EAEJ;IACE,MAAM;IACN,SAAS;IACT,SAAS;;;EAGX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;EAEX;IACE,MAAM;IACN,SAAS;IACT,SAAS;;;EAGX;IACE,MAAM;IACN,SAAS;IACT,SACE;;CAEL;AAmBK,SAAU,mBAAmB,SAAe;AAChD,MAAI,OAAO,YAAY,UAAU;AAC/B,WAAO;EACT;AACA,QAAM,aAAa,QAAQ,KAAI;AAC/B,aAAW,SAAS,sBAAsB;AACxC,QAAI,eAAe,MAAM,QAAQ,WAAW,WAAW,GAAG,MAAM,IAAI,GAAG,GAAG;AACxE,aAAO;IACT;EACF;AACA,SAAO;AACT;AAQM,SAAU,oBAAoB,UAA0B;AAC5D,QAAM,MAA8B,CAAA;AACpC,aAAW,WAAW,UAAU;AAC9B,UAAM,QAAQ,mBAAmB,OAAO;AACxC,QAAI,UAAU,UAAa,CAAC,OAAO,UAAU,eAAe,KAAK,KAAK,MAAM,IAAI,GAAG;AACjF,UAAI,MAAM,IAAI,IAAI,MAAM;IAC1B;EACF;AACA,SAAO;AACT;AAQM,SAAU,yBAAyB,UAA0B;AACjE,SAAO,OAAO,OAAO,oBAAoB,QAAQ,CAAC;AACpD;",
+  "names": []
+}

package/dist/cli-bundle/chunks/{chunk-LGOXXQUW.js → chunk-WZCQVABQ.js}

@@ -1,7 +1,7 @@
 import {
   TYPE_TO_FOLDER,
   pathExists
-} from "./chunk-LFW5NQUP.js";
+} from "./chunk-LV5FFQ7M.js";
 
 // dist/core/item/id.js
 import crypto from "node:crypto";
@@ -75,4 +75,4 @@ export {
   normalizeItemId,
   generateItemId
 };
-//# sourceMappingURL=chunk-LGOXXQUW.js.map
+//# sourceMappingURL=chunk-WZCQVABQ.js.map

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

@@ -0,0 +1,32 @@
+// dist/cli/commands/list-filter-shared.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]="a367b520-b891-596b-9893-1d7b3b9087e0")}catch(e){}}();
+function isActiveListFilterValue(value) {
+  return value != null && (typeof value !== "string" || value.split(",").some((entry) => entry.trim().length > 0));
+}
+function hasListFilters(list, status, options = {}) {
+  const includePagination = options.includePagination !== false;
+  return isActiveListFilterValue(status) || isActiveListFilterValue(list?.status) || isActiveListFilterValue(list?.type) || isActiveListFilterValue(list?.tag) || isActiveListFilterValue(list?.priority) || isActiveListFilterValue(list?.deadlineBefore) || isActiveListFilterValue(list?.deadlineAfter) || isActiveListFilterValue(list?.updatedAfter) || isActiveListFilterValue(list?.updatedBefore) || isActiveListFilterValue(list?.createdAfter) || isActiveListFilterValue(list?.createdBefore) || isActiveListFilterValue(list?.ids) || isActiveListFilterValue(list?.assignee) || isActiveListFilterValue(list?.assigneeFilter) || isActiveListFilterValue(list?.parent) || isActiveListFilterValue(list?.sprint) || isActiveListFilterValue(list?.release) || list?.filterAcMissing === true || list?.filterEstimatesMissing === true || list?.filterResolutionMissing === true || list?.filterMetadataMissing === true || list?.filterReviewerMissing === true || list?.filterRiskMissing === true || list?.filterConfidenceMissing === true || list?.filterSprintMissing === true || list?.filterReleaseMissing === true || list?.hasNotes === true || list?.hasLearnings === true || list?.hasFiles === true || list?.hasDocs === true || list?.hasTests === true || list?.hasComments === true || list?.hasDeps === true || list?.hasBody === true || list?.hasLinkedCommand === true || list?.noNotes === true || list?.noLearnings === true || list?.noFiles === true || list?.noDocs === true || list?.noTests === true || list?.noComments === true || list?.noDeps === true || list?.emptyBody === true || list?.noLinkedCommand === true || includePagination && isActiveListFilterValue(list?.limit) || includePagination && isActiveListFilterValue(list?.offset);
+}
+function buildListQueryFilters(filters) {
+  return {
+    type: filters.type,
+    tag: filters.tag,
+    priority: filters.priority,
+    deadlineBefore: filters.deadlineBefore,
+    deadlineAfter: filters.deadlineAfter,
+    assignee: filters.assignee,
+    assigneeFilter: filters.assigneeFilter,
+    parent: filters.parent,
+    sprint: filters.sprint,
+    release: filters.release
+  };
+}
+
+export {
+  hasListFilters,
+  buildListQueryFilters
+};
+//# sourceMappingURL=chunk-X3W5ESZQ.js.map
+
+//# debugId=a367b520-b891-596b-9893-1d7b3b9087e0