@unbrained/pm-cli 2026.7.2 → 2026.7.3

package/dist/cli-bundle/chunks/validate-W7H5TEDC.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../../../../../cli/commands/validate.ts","../../../../../../../../core/validate/fix-planning.ts","../../../../../../../../core/governance/issue-codes.ts","../../../../../../../../core/validate/missing-by-type.ts","../../../../../../../../core/validate/stale-file-classification.ts","../../../../../../../../core/validate/missing-link-owners.ts"],"sourcesContent":["/**\n * @module cli/commands/validate\n *\n * Implements the pm validate command surface and its agent-facing runtime behavior.\n */\nimport fs from \"node:fs/promises\";\nimport { realpathSync } from \"node:fs\";\nimport type { Dirent } from \"node:fs\";\nimport { execFile } from \"node:child_process\";\nimport path from \"node:path\";\nimport { promisify } from \"node:util\";\nimport { buildRemediationCommands } from \"../../core/diagnostics/remediation.js\";\nimport { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { scanHistoryDrift } from \"../../core/history/drift-scan.js\";\nimport { normalizeStatusInput } from \"../../core/item/status.js\";\nimport { resolveItemTypeRegistry } from \"../../core/item/type-registry.js\";\nimport { resolveRuntimeStatusRegistry, type RuntimeStatusRegistry } from \"../../core/schema/runtime-schema.js\";\nimport {\n  DEFAULT_VALIDATE_CLOSURE_LIKE_METADATA_FIELD_PATTERNS,\n  DEFAULT_VALIDATE_STALE_BLOCKER_REASON_PATTERNS,\n  EXIT_CODE,\n  PM_DIRNAME,\n} from \"../../core/shared/constants.js\";\nimport type { GlobalOptions } from \"../../core/shared/command-types.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { toNonEmptyStringOrUndefined } from \"../../core/shared/primitives.js\";\nimport { nowIso } from \"../../core/shared/time.js\";\nimport {\n  CURRENT_ITEM_FORMAT_VERSION,\n  effectiveItemFormatVersion,\n  scanItemFormatVersions,\n} from \"../../core/item/item-format-version.js\";\nimport { listAllFrontMatterWithBody } from \"../../core/store/item-store.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport {\n  partitionFixesByGrant,\n  planCloseReasonBackfillFixes,\n  planEstimateBackfillFixes,\n  planResolutionBackfillFixes,\n  planStaleLinkPruneFixes,\n  planTerminalParentFixes,\n  resolveGrantedFixScopes,\n  toFixOutputRow,\n  type CloseReasonBackfillRow,\n  type EstimateBackfillRow,\n  type ResolutionBackfillRow,\n  type StaleLinkPruneRow,\n  type TerminalParentFixRow,\n  type ValidateFixScope,\n  type ValidateFixRecord,\n} from \"../../core/validate/fix-planning.js\";\nimport { findDuplicateIssueCodes, type DuplicateIssueCode } from \"../../core/governance/issue-codes.js\";\nimport { buildMissingByTypeCounts, type MissingFieldOccurrence } from \"../../core/validate/missing-by-type.js\";\nimport {\n  classifyStaleLinkedPaths,\n  summarizeStaleLinkedPathClassifications,\n} from \"../../core/validate/stale-file-classification.js\";\nimport { isRemoteLinkedArtifactReference } from \"../../core/validate/linked-artifact-reference.js\";\nimport {\n  buildMissingLinkedPathRows,\n  summarizeMissingLinkedPathRows,\n  type StaleLinkOwnerInput,\n} from \"../../core/validate/missing-link-owners.js\";\nimport type { ValidateMetadataProfile, ValidateMetadataRequiredField } from \"../../types/index.js\";\nimport { extractReferencedPmItemIdsFromCommand } from \"./test.js\";\n\ntype ValidateCheckName =\n  | \"metadata\"\n  | \"resolution\"\n  | \"lifecycle\"\n  | \"files\"\n  | \"command_references\"\n  | \"history_drift\"\n  | \"format_version\";\ntype ValidateStatus = \"ok\" | \"warn\" | \"error\";\ntype ValidateDependencyCycleSeverity = \"off\" | \"warn\" | \"error\";\ntype ValidateFileScanMode = \"default\" | \"tracked-all\" | \"tracked-all-strict\";\ntype ItemWithBody = Awaited<ReturnType<typeof listAllFrontMatterWithBody>>[number];\ntype FileCandidateSource = \"default-curated\" | \"tracked-git\" | \"tracked-all-fallback-default\";\ntype OrphanedPathClassification = \"docs_unowned\" | \"tests_unowned\" | \"source_unowned\" | \"unlinked_existing\";\n\nconst FILE_SCAN_DIRECTORIES = [\"src\", \"tests\", \"docs\"] as const;\nconst FILE_SCAN_ROOT_FILES = [\n  \"README.md\",\n  \"PRD.md\",\n  \"CHANGELOG.md\",\n  \"AGENTS.md\",\n  \"CONTRIBUTING.md\",\n  \"SECURITY.md\",\n  \"CODE_OF_CONDUCT.md\",\n  \"LICENSE\",\n] as const;\nconst DIRECTORY_IGNORE_SET = new Set([\"node_modules\", \".git\", \".cursor\", \".agents\", \"dist\", \"coverage\"]);\nconst RESOLUTION_FIELD_KEYS = [\"resolution\", \"expected_result\", \"actual_result\"] as const;\ntype ResolutionFieldKey = (typeof RESOLUTION_FIELD_KEYS)[number];\nconst VALIDATE_FILE_SCAN_MODES = [\"default\", \"tracked-all\", \"tracked-all-strict\"] as const;\nconst VALIDATE_METADATA_PROFILE_VALUES = [\"core\", \"strict\", \"custom\"] as const;\nconst VALIDATE_DEPENDENCY_CYCLE_SEVERITY_VALUES = [\"off\", \"warn\", \"error\"] as const;\nconst LIFECYCLE_PATTERN_FIELD_KEYS = [\"blocked_reason\", \"resolution\", \"actual_result\"] as const;\ntype LifecyclePatternFieldKey = (typeof LIFECYCLE_PATTERN_FIELD_KEYS)[number];\nconst CORE_METADATA_REQUIRED_FIELDS = [\"author\", \"acceptance_criteria\", \"estimated_minutes\", \"close_reason\"] as const;\nconst STRICT_METADATA_REQUIRED_FIELDS = [\n  ...CORE_METADATA_REQUIRED_FIELDS,\n  \"reviewer\",\n  \"risk\",\n  \"confidence\",\n  \"sprint\",\n  \"release\",\n] as const;\n// Keep this deduplicated so future list edits cannot double-count metadata diagnostics.\nconst SUPPORTED_METADATA_REQUIRED_FIELDS: readonly ValidateMetadataRequiredField[] = Array.from(\n  new Set<ValidateMetadataRequiredField>(STRICT_METADATA_REQUIRED_FIELDS),\n);\nconst METADATA_REQUIRED_FIELD_ALIASES: Record<string, ValidateMetadataRequiredField> = {\n  author: \"author\",\n  acceptance_criteria: \"acceptance_criteria\",\n  \"acceptance-criteria\": \"acceptance_criteria\",\n  estimated_minutes: \"estimated_minutes\",\n  \"estimated-minutes\": \"estimated_minutes\",\n  estimate: \"estimated_minutes\",\n  close_reason: \"close_reason\",\n  \"close-reason\": \"close_reason\",\n  reviewer: \"reviewer\",\n  risk: \"risk\",\n  confidence: \"confidence\",\n  sprint: \"sprint\",\n  release: \"release\",\n};\nconst METADATA_WARNING_TOKEN_BY_FIELD: Record<ValidateMetadataRequiredField, string> = {\n  author: \"validate_metadata_missing_author\",\n  acceptance_criteria: \"validate_metadata_missing_acceptance_criteria\",\n  estimated_minutes: \"validate_metadata_missing_estimate\",\n  close_reason: \"validate_metadata_missing_close_reason\",\n  reviewer: \"validate_metadata_missing_reviewer\",\n  risk: \"validate_metadata_missing_risk\",\n  confidence: \"validate_metadata_missing_confidence\",\n  sprint: \"validate_metadata_missing_sprint\",\n  release: \"validate_metadata_missing_release\",\n};\nconst METADATA_COUNT_KEY_BY_FIELD: Record<ValidateMetadataRequiredField, string> = {\n  author: \"missing_author\",\n  acceptance_criteria: \"missing_acceptance_criteria\",\n  estimated_minutes: \"missing_estimated_minutes\",\n  close_reason: \"closed_missing_close_reason\",\n  reviewer: \"missing_reviewer\",\n  risk: \"missing_risk\",\n  confidence: \"missing_confidence\",\n  sprint: \"missing_sprint\",\n  release: \"missing_release\",\n};\nconst METADATA_ITEM_IDS_KEY_BY_FIELD: Record<ValidateMetadataRequiredField, string> = {\n  author: \"missing_author_item_ids\",\n  acceptance_criteria: \"missing_acceptance_criteria_item_ids\",\n  estimated_minutes: \"missing_estimated_minutes_item_ids\",\n  close_reason: \"closed_missing_close_reason_item_ids\",\n  reviewer: \"missing_reviewer_item_ids\",\n  risk: \"missing_risk_item_ids\",\n  confidence: \"missing_confidence_item_ids\",\n  sprint: \"missing_sprint_item_ids\",\n  release: \"missing_release_item_ids\",\n};\nconst METADATA_TRUNCATED_KEY_BY_FIELD: Record<ValidateMetadataRequiredField, string> = {\n  author: \"missing_author_truncated\",\n  acceptance_criteria: \"missing_acceptance_criteria_truncated\",\n  estimated_minutes: \"missing_estimated_minutes_truncated\",\n  close_reason: \"closed_missing_close_reason_truncated\",\n  reviewer: \"missing_reviewer_truncated\",\n  risk: \"missing_risk_truncated\",\n  confidence: \"missing_confidence_truncated\",\n  sprint: \"missing_sprint_truncated\",\n  release: \"missing_release_truncated\",\n};\nconst GIT_LS_FILES_MAX_BUFFER = 32 * 1024 * 1024;\nconst FILE_LIST_SUMMARY_LIMIT = 40;\nconst DIAGNOSTIC_LIST_SUMMARY_LIMIT = 5;\nconst execFileAsync = promisify(execFile);\n\n/**\n * Documents the validate command options payload exchanged by command, SDK, and package integrations.\n */\nexport interface ValidateCommandOptions {\n  checkMetadata?: boolean;\n  checkResolution?: boolean;\n  checkLifecycle?: boolean;\n  checkStaleBlockers?: boolean;\n  dependencyCycleSeverity?: string;\n  parentCycleSeverity?: string;\n  checkFiles?: boolean;\n  includePmInternals?: boolean;\n  verboseFileLists?: boolean;\n  verboseDiagnostics?: boolean;\n  /** Emit complete *_item_ids diagnostic lists (no 5-item cap); implied by --json. */\n  allAffectedIds?: boolean;\n  checkHistoryDrift?: boolean;\n  checkCommandReferences?: boolean;\n  scanMode?: string;\n  metadataProfile?: string;\n  fixHints?: boolean;\n  autoFix?: boolean;\n  dryRun?: boolean;\n  fixScope?: string[];\n  pruneMissing?: boolean;\n}\n\n/**\n * Documents the validate check payload exchanged by command, SDK, and package integrations.\n */\nexport interface ValidateCheck {\n  name: ValidateCheckName;\n  status: ValidateStatus;\n  details: Record<string, unknown>;\n}\n\n/**\n * Documents the validate fixes summary payload exchanged by command, SDK, and package integrations.\n */\nexport interface ValidateFixesSummary {\n  mode: \"apply\" | \"dry_run\";\n  auto_fix: boolean;\n  prune_missing: boolean;\n  granted_fix_scopes: string[];\n  planned_count: number;\n  applied_count: number;\n  gated_count: number;\n  failed_count: number;\n  planned_fixes: Array<Record<string, unknown>>;\n  applied_fixes: Array<Record<string, unknown>>;\n  gated_fixes: Array<Record<string, unknown>>;\n  failed_fixes: Array<Record<string, unknown>>;\n}\n\n/**\n * Documents the validate result payload exchanged by command, SDK, and package integrations.\n */\nexport interface ValidateResult {\n  ok: boolean;\n  has_warnings: boolean;\n  checks: ValidateCheck[];\n  warnings: string[];\n  /** Present when --auto-fix or --prune-missing was requested; checks always reflect the PRE-fix state. */\n  fixes?: ValidateFixesSummary;\n  generated_at: string;\n}\n\nfunction normalizeRelativePath(value: string): string {\n  return value.replaceAll(\"\\\\\", \"/\").replace(/^\\.\\/+/, \"\").replace(/^\\/+/, \"\");\n}\n\nfunction normalizeRelativeDirectoryPath(value: string): string {\n  const normalized = normalizeRelativePath(value);\n  return normalized.replace(/\\/+$/, \"\");\n}\n\n\n\nfunction toMeaningfulString(value: unknown): string | undefined {\n  const normalized = toNonEmptyStringOrUndefined(value);\n  if (!normalized) {\n    return undefined;\n  }\n  const lowered = normalized.toLowerCase();\n  if (lowered === \"none\" || lowered === \"null\" || lowered === \"n/a\" || lowered === \"na\") {\n    return undefined;\n  }\n  return normalized;\n}\n\n/* c8 ignore start -- runtime-status alias normalization is covered by status-registry integration tests */\nfunction normalizeStatusForRegistry(status: string, statusRegistry: RuntimeStatusRegistry): string {\n  return normalizeStatusInput(status, statusRegistry) ?? status;\n}\n/* c8 ignore stop */\n\nfunction isTerminalStatus(status: string, statusRegistry: RuntimeStatusRegistry): boolean {\n  return statusRegistry.terminal_statuses.has(normalizeStatusForRegistry(status, statusRegistry));\n}\n\ninterface ValidateMetadataPolicy {\n  profile: ValidateMetadataProfile;\n  profile_source: \"default\" | \"settings\" | \"option\";\n  required_fields: ValidateMetadataRequiredField[];\n  configured_custom_fields: ValidateMetadataRequiredField[];\n  fallback_to_core: boolean;\n  warnings: string[];\n}\n\ntype LifecyclePatternSource = \"default\" | \"settings\";\n\ninterface LifecyclePatternPolicy {\n  stale_blocker_reason_patterns: string[];\n  stale_blocker_reason_pattern_source: LifecyclePatternSource;\n  closure_like_metadata_field_patterns: Record<LifecyclePatternFieldKey, string[]>;\n  closure_like_metadata_field_pattern_sources: Record<LifecyclePatternFieldKey, LifecyclePatternSource>;\n}\n\ninterface LifecyclePatternSettingsSource {\n  validation: {\n    lifecycle_stale_blocker_reason_patterns: string[];\n    lifecycle_closure_like_blocked_reason_patterns: string[];\n    lifecycle_closure_like_resolution_patterns: string[];\n    lifecycle_closure_like_actual_result_patterns: string[];\n  };\n}\n\n/* c8 ignore start -- lifecycle pattern normalization/default-vs-settings matrix is covered by lifecycle integration tests */\nfunction normalizeLifecyclePatternList(values: readonly string[] | undefined): string[] {\n  return [...new Set((values ?? []).map((value) => value.trim().toLowerCase()).filter((value) => value.length > 0))].sort(\n    (left, right) => left.localeCompare(right),\n  );\n}\n\nfunction areSortedStringListsEqual(left: readonly string[], right: readonly string[]): boolean {\n  if (left.length !== right.length) {\n    return false;\n  }\n  return left.every((value, index) => value === right[index]);\n}\n\nfunction resolveLifecyclePatternPolicy(settings: LifecyclePatternSettingsSource): LifecyclePatternPolicy {\n  const defaultStalePatterns = normalizeLifecyclePatternList(DEFAULT_VALIDATE_STALE_BLOCKER_REASON_PATTERNS);\n  const defaultClosureLikePatterns = {\n    blocked_reason: normalizeLifecyclePatternList(DEFAULT_VALIDATE_CLOSURE_LIKE_METADATA_FIELD_PATTERNS.blocked_reason),\n    resolution: normalizeLifecyclePatternList(DEFAULT_VALIDATE_CLOSURE_LIKE_METADATA_FIELD_PATTERNS.resolution),\n    actual_result: normalizeLifecyclePatternList(DEFAULT_VALIDATE_CLOSURE_LIKE_METADATA_FIELD_PATTERNS.actual_result),\n  } satisfies Record<LifecyclePatternFieldKey, string[]>;\n  const staleBlockerReasonPatterns = normalizeLifecyclePatternList(\n    settings.validation.lifecycle_stale_blocker_reason_patterns,\n  );\n  const closureLikePatterns = {\n    blocked_reason: normalizeLifecyclePatternList(settings.validation.lifecycle_closure_like_blocked_reason_patterns),\n    resolution: normalizeLifecyclePatternList(settings.validation.lifecycle_closure_like_resolution_patterns),\n    actual_result: normalizeLifecyclePatternList(settings.validation.lifecycle_closure_like_actual_result_patterns),\n  } satisfies Record<LifecyclePatternFieldKey, string[]>;\n  return {\n    stale_blocker_reason_patterns: staleBlockerReasonPatterns,\n    stale_blocker_reason_pattern_source: areSortedStringListsEqual(staleBlockerReasonPatterns, defaultStalePatterns)\n      ? \"default\"\n      : \"settings\",\n    closure_like_metadata_field_patterns: closureLikePatterns,\n    closure_like_metadata_field_pattern_sources: {\n      blocked_reason: areSortedStringListsEqual(closureLikePatterns.blocked_reason, defaultClosureLikePatterns.blocked_reason)\n        ? \"default\"\n        : \"settings\",\n      resolution: areSortedStringListsEqual(closureLikePatterns.resolution, defaultClosureLikePatterns.resolution)\n        ? \"default\"\n        : \"settings\",\n      actual_result: areSortedStringListsEqual(closureLikePatterns.actual_result, defaultClosureLikePatterns.actual_result)\n        ? \"default\"\n        : \"settings\",\n    },\n  };\n}\n/* c8 ignore stop */\n\nfunction resolveValidateMetadataProfile(value: string | undefined): ValidateMetadataProfile {\n  const normalized = value?.trim().toLowerCase();\n  if (!normalized || normalized.length === 0) {\n    return \"core\";\n  }\n  if ((VALIDATE_METADATA_PROFILE_VALUES as readonly string[]).includes(normalized)) {\n    return normalized as ValidateMetadataProfile;\n  }\n  throw new PmCliError(\n    `Unknown --metadata-profile value \"${value}\". Supported values: ${VALIDATE_METADATA_PROFILE_VALUES.join(\", \")}.`,\n    EXIT_CODE.USAGE,\n  );\n}\n\nfunction resolveDependencyCycleSeverity(value: string | undefined): ValidateDependencyCycleSeverity {\n  const normalized = value?.trim().toLowerCase();\n  if (!normalized || normalized.length === 0) {\n    return \"warn\";\n  }\n  if ((VALIDATE_DEPENDENCY_CYCLE_SEVERITY_VALUES as readonly string[]).includes(normalized)) {\n    return normalized as ValidateDependencyCycleSeverity;\n  }\n  throw new PmCliError(\n    `Unknown --dependency-cycle-severity value \"${value}\". Supported values: ${VALIDATE_DEPENDENCY_CYCLE_SEVERITY_VALUES.join(\", \")}.`,\n    EXIT_CODE.USAGE,\n  );\n}\n\nfunction resolveParentCycleSeverity(value: string | undefined): ValidateDependencyCycleSeverity {\n  const normalized = value?.trim().toLowerCase();\n  if (!normalized || normalized.length === 0) {\n    return \"warn\";\n  }\n  if ((VALIDATE_DEPENDENCY_CYCLE_SEVERITY_VALUES as readonly string[]).includes(normalized)) {\n    return normalized as ValidateDependencyCycleSeverity;\n  }\n  throw new PmCliError(\n    `Unknown --parent-cycle-severity value \"${value}\". Supported values: ${VALIDATE_DEPENDENCY_CYCLE_SEVERITY_VALUES.join(\", \")}.`,\n    EXIT_CODE.USAGE,\n  );\n}\n\n/* c8 ignore start -- metadata required-field alias normalization is covered by metadata-policy integration tests */\nfunction normalizeMetadataRequiredFieldsFromSettings(\n  values: readonly ValidateMetadataRequiredField[] | undefined,\n): ValidateMetadataRequiredField[] {\n  const normalized = [...new Set((values ?? []).map((value) => value.trim().toLowerCase().replaceAll(\"-\", \"_\")))];\n  return normalized\n    .map((value) => METADATA_REQUIRED_FIELD_ALIASES[value])\n    .filter((value): value is ValidateMetadataRequiredField => value !== undefined)\n    .sort((left, right) => left.localeCompare(right));\n}\n/* c8 ignore stop */\n\nfunction resolveValidateMetadataPolicy(\n  profile: ValidateMetadataProfile,\n  profileSource: \"default\" | \"settings\" | \"option\",\n  configuredCustomFields: readonly ValidateMetadataRequiredField[],\n): ValidateMetadataPolicy {\n  const normalizedCustomFields = normalizeMetadataRequiredFieldsFromSettings(configuredCustomFields);\n  if (profile === \"core\") {\n    return {\n      profile,\n      profile_source: profileSource,\n      required_fields: [...CORE_METADATA_REQUIRED_FIELDS],\n      configured_custom_fields: normalizedCustomFields,\n      fallback_to_core: false,\n      warnings: [],\n    };\n  }\n  if (profile === \"strict\") {\n    return {\n      profile,\n      profile_source: profileSource,\n      required_fields: [...STRICT_METADATA_REQUIRED_FIELDS],\n      configured_custom_fields: normalizedCustomFields,\n      fallback_to_core: false,\n      warnings: [],\n    };\n  }\n  if (normalizedCustomFields.length > 0) {\n    return {\n      profile,\n      profile_source: profileSource,\n      required_fields: normalizedCustomFields,\n      configured_custom_fields: normalizedCustomFields,\n      fallback_to_core: false,\n      warnings: [],\n    };\n  }\n  return {\n    profile,\n    profile_source: profileSource,\n    required_fields: [...CORE_METADATA_REQUIRED_FIELDS],\n    configured_custom_fields: normalizedCustomFields,\n    fallback_to_core: true,\n    warnings: [\"validate_metadata_custom_profile_missing_required_fields:0\"],\n  };\n}\n\n/**\n * Planning fields whose absence is only actionable on live work (GH-276): an\n * agent backfills an estimate or acceptance criteria to plan/execute an item,\n * so flagging them on a terminal (closed/canceled) historical item is pure\n * noise. Under the `strict` profile these are still enforced everywhere for\n * projects that want full historical coverage.\n */\nconst TERMINAL_EXEMPT_PLANNING_FIELDS: ReadonlySet<ValidateMetadataRequiredField> = new Set([\n  \"acceptance_criteria\",\n  \"estimated_minutes\",\n]);\n\nfunction isMetadataFieldMissing(\n  item: ItemWithBody,\n  field: ValidateMetadataRequiredField,\n  statusRegistry: RuntimeStatusRegistry,\n  enforcePlanningFieldsOnTerminal: boolean,\n): boolean {\n  // GH-276: skip planning-field gaps on retired (closed/canceled) items unless\n  // the resolved profile explicitly demands strict historical coverage.\n  if (\n    !enforcePlanningFieldsOnTerminal &&\n    TERMINAL_EXEMPT_PLANNING_FIELDS.has(field) &&\n    isTerminalStatus(item.status, statusRegistry)\n  ) {\n    return false;\n  }\n  if (field === \"author\") {\n    return !toNonEmptyStringOrUndefined(item.author);\n  }\n  if (field === \"acceptance_criteria\") {\n    return !toNonEmptyStringOrUndefined(item.acceptance_criteria);\n  }\n  if (field === \"estimated_minutes\") {\n    return !Number.isFinite(item.estimated_minutes);\n  }\n  if (field === \"close_reason\") {\n    return normalizeStatusForRegistry(item.status, statusRegistry) === statusRegistry.close_status && !toNonEmptyStringOrUndefined(item.close_reason);\n  }\n  if (field === \"reviewer\") {\n    return !toNonEmptyStringOrUndefined(item.reviewer);\n  }\n  if (field === \"risk\") {\n    return !toNonEmptyStringOrUndefined(item.risk);\n  }\n  if (field === \"confidence\") {\n    if (typeof item.confidence === \"number\") {\n      return !Number.isFinite(item.confidence);\n    }\n    return !toNonEmptyStringOrUndefined(item.confidence);\n  }\n  if (field === \"sprint\") {\n    return !toNonEmptyStringOrUndefined(item.sprint);\n  }\n  return !toNonEmptyStringOrUndefined(item.release);\n}\n\nfunction resolveFileScanMode(scanMode: string | undefined): ValidateFileScanMode {\n  if (scanMode === undefined) {\n    return \"default\";\n  }\n  const normalized = scanMode.trim().toLowerCase();\n  if (normalized.length === 0) {\n    return \"default\";\n  }\n  if (normalized === \"default\") {\n    return \"default\";\n  }\n  if (normalized === \"tracked-all\" || normalized === \"tracked_all\") {\n    return \"tracked-all\";\n  }\n  if (normalized === \"tracked-all-strict\" || normalized === \"tracked_all_strict\") {\n    return \"tracked-all-strict\";\n  }\n  throw new PmCliError(\n    `Unknown --scan-mode value \"${scanMode}\". Supported values: ${VALIDATE_FILE_SCAN_MODES.join(\", \")}.`,\n    EXIT_CODE.USAGE,\n  );\n}\n\nfunction resolveWorkspaceRoot(pmRoot: string): string {\n  const resolvedPmRoot = path.resolve(pmRoot);\n  const normalizedPmRoot = resolvedPmRoot.replaceAll(\"\\\\\", \"/\");\n  if (normalizedPmRoot.endsWith(\"/.agents/pm\")) {\n    return path.dirname(path.dirname(resolvedPmRoot));\n  }\n  const resolvedCwd = path.resolve(process.cwd());\n  const canonicalPmRoot = realpathForWorkspaceRoot(resolvedPmRoot);\n  const canonicalCwd = realpathForWorkspaceRoot(resolvedCwd);\n  const relativeFromPmRoot = path.relative(canonicalPmRoot, canonicalCwd);\n  const cwdInsidePmRoot =\n    relativeFromPmRoot.length === 0 ||\n    (!relativeFromPmRoot.startsWith(\"..\") && !path.isAbsolute(relativeFromPmRoot));\n  if (cwdInsidePmRoot) {\n    return resolvedPmRoot;\n  }\n  /* c8 ignore next 2 -- non-standard PM root layouts are integration-only edge cases. */\n  return resolvedCwd;\n}\n\nfunction realpathForWorkspaceRoot(inputPath: string): string {\n  try {\n    return realpathSync.native(inputPath);\n  } catch {\n    return path.resolve(inputPath);\n  }\n}\n\n/* c8 ignore start -- recursive file-walk dirent/permission edge cases are covered by filesystem integration suites */\nasync function listFilesRecursive(basePath: string, relativePath: string, output: string[]): Promise<void> {\n  const targetDirectory = relativePath.length > 0 ? path.join(basePath, relativePath) : basePath;\n  let entries: Dirent[];\n  try {\n    entries = await fs.readdir(targetDirectory, { withFileTypes: true });\n  } catch (error: unknown) {\n    if (typeof error === \"object\" && error !== null && \"code\" in error && (error as { code?: string }).code === \"ENOENT\") {\n      return;\n    }\n    throw error;\n  }\n\n  for (const entry of entries) {\n    if (entry.name.startsWith(\".\")) {\n      continue;\n    }\n    const childRelative = relativePath.length > 0 ? path.join(relativePath, entry.name) : entry.name;\n    if (entry.isDirectory()) {\n      if (DIRECTORY_IGNORE_SET.has(entry.name)) {\n        continue;\n      }\n      await listFilesRecursive(basePath, childRelative, output);\n      continue;\n    }\n    /* c8 ignore next 3 -- non-file dirent variants (symlink/socket) are filesystem-specific. */\n    if (!entry.isFile()) {\n      continue;\n    }\n    output.push(normalizeRelativePath(childRelative));\n  }\n}\n/* c8 ignore stop */\n\nasync function collectDefaultProjectFileCandidates(workspaceRoot: string): Promise<string[]> {\n  const discovered: string[] = [];\n  for (const directory of FILE_SCAN_DIRECTORIES) {\n    await listFilesRecursive(workspaceRoot, directory, discovered);\n  }\n  for (const candidate of FILE_SCAN_ROOT_FILES) {\n    const absolute = path.join(workspaceRoot, candidate);\n    try {\n      const stats = await fs.stat(absolute);\n      /* c8 ignore start -- root-candidate presence depends on fixture workspace composition. */\n      if (stats.isFile()) {\n        discovered.push(normalizeRelativePath(candidate));\n      }\n      /* c8 ignore stop */\n    } catch {\n      // Ignore root-file candidates that are not present in this workspace.\n    }\n  }\n  return [...new Set(discovered)].sort((left, right) => left.localeCompare(right));\n}\n\nasync function collectTrackedGitFileCandidates(workspaceRoot: string): Promise<string[] | null> {\n  try {\n    const { stdout } = await execFileAsync(\"git\", [\"ls-files\", \"-z\"], {\n      cwd: workspaceRoot,\n      encoding: \"utf8\",\n      maxBuffer: GIT_LS_FILES_MAX_BUFFER,\n      windowsHide: true,\n    });\n    const discovered = stdout\n      .split(\"\\0\")\n      .map((value) => normalizeRelativePath(value))\n      .filter((value) => value.length > 0);\n    return [...new Set(discovered)].sort((left, right) => left.localeCompare(right));\n  } catch {\n    /* c8 ignore start -- fallback path exercised only when git metadata is unavailable. */\n    return null;\n    /* c8 ignore stop */\n  }\n}\n\ninterface FileCandidateCollection {\n  requestedMode: ValidateFileScanMode;\n  appliedMode: ValidateFileScanMode;\n  source: FileCandidateSource;\n  candidateFiles: string[];\n  candidateTotal: number;\n  candidateScanned: number;\n}\n\n/* c8 ignore start -- PM-internal prefix derivation permutations are covered by file-scan integration tests */\nfunction resolvePmInternalCandidatePrefixes(pmRoot: string, workspaceRoot: string): string[] {\n  const prefixes = new Set<string>();\n  const configuredDefault = normalizeRelativeDirectoryPath(PM_DIRNAME);\n  if (configuredDefault.length > 0) {\n    prefixes.add(configuredDefault);\n  }\n  const relativePmRoot = normalizeRelativeDirectoryPath(path.relative(workspaceRoot, pmRoot));\n  if (relativePmRoot.length > 0 && !relativePmRoot.startsWith(\"..\")) {\n    prefixes.add(relativePmRoot);\n  }\n  return [...prefixes].sort((left, right) => left.localeCompare(right));\n}\n/* c8 ignore stop */\n\nfunction hasPathPrefix(candidate: string, prefixes: string[]): boolean {\n  for (const prefix of prefixes) {\n    if (candidate === prefix || candidate.startsWith(`${prefix}/`)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nasync function collectProjectFileCandidates(\n  workspaceRoot: string,\n  scanMode: ValidateFileScanMode,\n): Promise<FileCandidateCollection> {\n  if (scanMode === \"tracked-all\" || scanMode === \"tracked-all-strict\") {\n    const trackedCandidates = await collectTrackedGitFileCandidates(workspaceRoot);\n    /* c8 ignore start -- tracked-git availability fallback is covered by git/non-git integration fixtures */\n    if (trackedCandidates) {\n      return {\n        requestedMode: scanMode,\n        appliedMode: scanMode,\n        source: \"tracked-git\",\n        candidateFiles: trackedCandidates,\n        candidateTotal: trackedCandidates.length,\n        candidateScanned: trackedCandidates.length,\n      };\n    }\n    /* c8 ignore stop */\n    /* c8 ignore start -- deterministic fallback retained for non-git workspaces. */\n    const fallbackCandidates = await collectDefaultProjectFileCandidates(workspaceRoot);\n    return {\n      requestedMode: scanMode,\n      appliedMode: \"default\",\n      source: \"tracked-all-fallback-default\",\n      candidateFiles: fallbackCandidates,\n      candidateTotal: fallbackCandidates.length,\n      candidateScanned: fallbackCandidates.length,\n    };\n    /* c8 ignore stop */\n  }\n\n  const defaultCandidates = await collectDefaultProjectFileCandidates(workspaceRoot);\n  return {\n    requestedMode: scanMode,\n    appliedMode: \"default\",\n    source: \"default-curated\",\n    candidateFiles: defaultCandidates,\n    candidateTotal: defaultCandidates.length,\n    candidateScanned: defaultCandidates.length,\n  };\n}\n\nfunction summarizeList(values: string[], limit = DIAGNOSTIC_LIST_SUMMARY_LIMIT): { values: string[]; truncated: boolean } {\n  /* c8 ignore start -- truncation behavior only surfaces with very large synthetic datasets. */\n  if (values.length <= limit) {\n    return { values, truncated: false };\n  }\n  return {\n    values: values.slice(0, limit),\n    truncated: true,\n  };\n  /* c8 ignore stop */\n}\n\nfunction summarizeFileList(\n  values: string[],\n  verboseFileLists: boolean,\n): {\n  values: string[];\n  truncated: boolean;\n  total: number;\n} {\n  if (verboseFileLists) {\n    return {\n      values,\n      truncated: false,\n      total: values.length,\n    };\n  }\n  const summary = summarizeList(values, FILE_LIST_SUMMARY_LIMIT);\n  return {\n    values: summary.values,\n    truncated: summary.truncated,\n    total: values.length,\n  };\n}\n\nconst RESOLUTION_REMEDIATION_FLAG_BY_FIELD: Record<ResolutionFieldKey, string> = {\n  resolution: \"--resolution\",\n  expected_result: \"--expected-result\",\n  actual_result: \"--actual-result\",\n};\n\nconst RESOLUTION_REMEDIATION_PLACEHOLDER_BY_FIELD: Record<ResolutionFieldKey, string> = {\n  resolution: \"Describe how this item was resolved\",\n  expected_result: \"Describe the expected result\",\n  actual_result: \"Describe the actual result\",\n};\n\nfunction buildResolutionRemediationCommand(row: { id: string; missing_fields: ResolutionFieldKey[] }): string {\n  const fieldArguments = row.missing_fields\n    .map((field) => `${RESOLUTION_REMEDIATION_FLAG_BY_FIELD[field]} \\\"${RESOLUTION_REMEDIATION_PLACEHOLDER_BY_FIELD[field]}\\\"`)\n    .join(\" \");\n  return `pm update ${row.id} ${fieldArguments} --message \\\"Backfill resolution metadata\\\"`;\n}\n\n/**\n * Attach a uniform, machine-executable `fix_hints` array to a validate check's\n * details when `--fix-hints` is requested. The resolution check's existing\n * per-row remediation commands (which already carry concrete item ids) are\n * aliased in so agents read one uniform field across every check; all other\n * checks derive one generic command per distinct warning code from the shared\n * remediation registry. Generic hints may contain `<id>`/`<field>`/`<path>`\n * placeholders the caller substitutes before running — they are templates, not\n * always directly executable as-is. Read-only: this only enriches the diagnostic\n * output, never mutates any item.\n */\n/* c8 ignore start -- fix-hint projection/truncation combinations are covered by validate output integration tests */\nfunction attachValidateFixHints(check: ValidateCheck, checkWarnings: string[]): void {\n  const existingResolutionHints = check.details?.missing_resolution_remediation_hints;\n  const aliasedResolution = Array.isArray(existingResolutionHints) && existingResolutionHints.length > 0;\n  const fixHints = aliasedResolution\n    ? (existingResolutionHints as unknown[]).filter((hint): hint is string => typeof hint === \"string\")\n    : buildRemediationCommands(checkWarnings);\n  if (fixHints.length === 0) {\n    return;\n  }\n  // The resolution check truncates its per-row hint list for low-token output;\n  // carry that marker onto fix_hints so an agent knows the list is partial and\n  // there are more items to repair beyond the ones shown.\n  const truncated = aliasedResolution && check.details?.missing_resolution_remediation_hints_truncated === true;\n  check.details = {\n    ...check.details,\n    fix_hints: fixHints,\n    ...(truncated ? { fix_hints_truncated: true } : {}),\n  };\n}\n/* c8 ignore stop */\n\nfunction resolveRequestedChecks(options: ValidateCommandOptions): Set<ValidateCheckName> {\n  const requested = new Set<ValidateCheckName>();\n  if (options.checkMetadata) {\n    requested.add(\"metadata\");\n  }\n  if (options.checkResolution) {\n    requested.add(\"resolution\");\n  }\n  if (options.checkLifecycle || options.checkStaleBlockers) {\n    requested.add(\"lifecycle\");\n  }\n  if (options.checkFiles) {\n    requested.add(\"files\");\n  }\n  if (options.checkHistoryDrift) {\n    requested.add(\"history_drift\");\n  }\n  if (options.checkCommandReferences) {\n    requested.add(\"command_references\");\n  }\n  if (requested.size === 0) {\n    // Remediation flags without explicit --check-* flags scope the run to the\n    // checks that can produce fixes: --auto-fix plans metadata/resolution\n    // backfills and gated lifecycle fixes; --prune-missing needs the files\n    // scan. With neither, the historical run-everything default applies.\n    if (options.autoFix) {\n      requested.add(\"metadata\");\n      requested.add(\"resolution\");\n      requested.add(\"lifecycle\");\n    }\n    if (options.pruneMissing) {\n      requested.add(\"files\");\n    }\n    if (requested.size === 0) {\n      requested.add(\"metadata\");\n      requested.add(\"resolution\");\n      requested.add(\"lifecycle\");\n      requested.add(\"files\");\n      requested.add(\"command_references\");\n      requested.add(\"history_drift\");\n      requested.add(\"format_version\");\n    }\n    return requested;\n  }\n  // Explicit check flags are respected as-is, except --prune-missing always\n  // needs the files scan it acts on.\n  if (options.pruneMissing) {\n    requested.add(\"files\");\n  }\n  return requested;\n}\n\nconst DUPLICATE_ISSUE_CODE_WARNING_TOKEN = \"validate_metadata_duplicate_issue_codes\";\n\n/**\n * Project the duplicate logical issue-code findings (GH-235) into the\n * metadata-check `details` shape plus an advisory warning token. Duplicate\n * codes are advisory (warn), never an error — matching every other metadata\n * finding — so an otherwise clean tracker that simply reuses a title prefix is\n * not failed by `pm validate`. Kept outside the c8-ignored builder block so the\n * projection/remediation logic is fully covered by unit tests.\n */\nfunction summarizeDuplicateIssueCodes(\n  duplicates: DuplicateIssueCode[],\n  verboseDiagnostics: boolean,\n): { rows: Array<Record<string, unknown>>; truncated: boolean; warnings: string[] } {\n  if (duplicates.length === 0) {\n    return { rows: [], truncated: false, warnings: [] };\n  }\n  const limit = verboseDiagnostics ? duplicates.length : DIAGNOSTIC_LIST_SUMMARY_LIMIT;\n  const shown = duplicates.slice(0, limit);\n  const rows = shown.map((duplicate) => ({\n    code: duplicate.code,\n    count: duplicate.count,\n    ids: duplicate.ids,\n    titles: duplicate.titles,\n    remediation_hint: `Items ${duplicate.ids.join(\", \")} share issue code \"${duplicate.code}\"; rename or merge so each logical code maps to one item.`,\n  }));\n  return {\n    rows,\n    truncated: shown.length < duplicates.length,\n    warnings: [`${DUPLICATE_ISSUE_CODE_WARNING_TOKEN}:${duplicates.length}`],\n  };\n}\n\nfunction initializeMissingMetadataByField(): Record<ValidateMetadataRequiredField, string[]> {\n  return Object.fromEntries(\n    SUPPORTED_METADATA_REQUIRED_FIELDS.map((field) => [field, [] as string[]]),\n  ) as Record<ValidateMetadataRequiredField, string[]>;\n}\n\nfunction collectMissingMetadataByField(\n  items: ItemWithBody[],\n  statusRegistry: RuntimeStatusRegistry,\n  enforcePlanningFieldsOnTerminal: boolean,\n): Record<ValidateMetadataRequiredField, string[]> {\n  const missingByField = initializeMissingMetadataByField();\n  for (const item of items) {\n    for (const field of SUPPORTED_METADATA_REQUIRED_FIELDS) {\n      if (isMetadataFieldMissing(item, field, statusRegistry, enforcePlanningFieldsOnTerminal)) {\n        missingByField[field].push(item.id);\n      }\n    }\n  }\n  return missingByField;\n}\n\nfunction buildMetadataWarningTokens(\n  metadataPolicy: ValidateMetadataPolicy,\n  missingByField: Record<ValidateMetadataRequiredField, string[]>,\n  duplicateWarnings: string[],\n): string[] {\n  const warningTokens = [...metadataPolicy.warnings];\n  for (const field of metadataPolicy.required_fields) {\n    const missingItems = missingByField[field];\n    if (missingItems.length > 0) {\n      warningTokens.push(`${METADATA_WARNING_TOKEN_BY_FIELD[field]}:${missingItems.length}`);\n    }\n  }\n  warningTokens.push(...duplicateWarnings);\n  return warningTokens;\n}\n\nfunction buildMetadataCounts(\n  metadataPolicy: ValidateMetadataPolicy,\n  missingByField: Record<ValidateMetadataRequiredField, string[]>,\n): Record<string, number> {\n  const counts: Record<string, number> = {};\n  for (const field of metadataPolicy.required_fields) {\n    const missing = missingByField[field];\n    const value = missing ? missing.length : 0;\n    const countKey = METADATA_COUNT_KEY_BY_FIELD[field];\n    if (value > 0 && countKey) {\n      counts[countKey] = value;\n    }\n  }\n  return counts;\n}\n\nfunction buildMissingFieldOccurrences(\n  metadataPolicy: ValidateMetadataPolicy,\n  missingByField: Record<ValidateMetadataRequiredField, string[]>,\n  itemsById: Map<string, ItemWithBody>,\n): MissingFieldOccurrence[] {\n  const occurrences: MissingFieldOccurrence[] = [];\n  for (const field of metadataPolicy.required_fields) {\n    const missing = missingByField[field];\n    if (!missing) {\n      continue;\n    }\n    for (const itemId of missing) {\n      const itemType = itemsById.get(itemId)?.type;\n      const normalizedItemType = typeof itemType === \"string\" && itemType.length > 0 ? itemType : \"Unknown\";\n      occurrences.push({ item_type: normalizedItemType, field });\n    }\n  }\n  return occurrences;\n}\n\n/* v8 ignore start -- metadata policy keys are validated before this summarizer; fallback branches are defensive */\nfunction attachMissingMetadataItemIds(\n  details: Record<string, unknown>,\n  metadataPolicy: ValidateMetadataPolicy,\n  missingByField: Record<ValidateMetadataRequiredField, string[]>,\n  verboseDiagnostics: boolean,\n): void {\n  for (const field of metadataPolicy.required_fields) {\n    const missing = missingByField[field];\n    if (!missing || missing.length === 0) {\n      continue;\n    }\n    const idsKey = METADATA_ITEM_IDS_KEY_BY_FIELD[field];\n    const truncatedKey = METADATA_TRUNCATED_KEY_BY_FIELD[field];\n    if (!idsKey || !truncatedKey) {\n      continue;\n    }\n    const summarized = summarizeList(missing, verboseDiagnostics ? missing.length : DIAGNOSTIC_LIST_SUMMARY_LIMIT);\n    details[idsKey] = summarized.values;\n    details[truncatedKey] = summarized.truncated;\n  }\n}\n/* v8 ignore stop */\n\nfunction buildCloseReasonBackfillRows(\n  metadataPolicy: ValidateMetadataPolicy,\n  missingByField: Record<ValidateMetadataRequiredField, string[]>,\n  itemsById: Map<string, ItemWithBody>,\n): CloseReasonBackfillRow[] {\n  if (!metadataPolicy.required_fields.includes(\"close_reason\")) {\n    return [];\n  }\n  const missing = missingByField.close_reason;\n  if (!missing) {\n    return [];\n  }\n  return missing.map((itemId) => ({\n    id: itemId,\n    resolution: toNonEmptyStringOrUndefined(itemsById.get(itemId)?.resolution),\n  }));\n}\n\nfunction buildEstimateBackfillRows(\n  metadataPolicy: ValidateMetadataPolicy,\n  missingByField: Record<ValidateMetadataRequiredField, string[]>,\n  itemsById: Map<string, ItemWithBody>,\n): EstimateBackfillRow[] {\n  if (!metadataPolicy.required_fields.includes(\"estimated_minutes\")) {\n    return [];\n  }\n  const missing = missingByField.estimated_minutes;\n  if (!missing) {\n    return [];\n  }\n  return missing.map((itemId) => ({\n    id: itemId,\n    type: toNonEmptyStringOrUndefined(itemsById.get(itemId)?.type),\n  }));\n}\n\n/* c8 ignore start -- metadata diagnostics/backfill planning permutations are covered by validate integration suites */\nfunction buildMetadataCheck(\n  items: ItemWithBody[],\n  metadataPolicy: ValidateMetadataPolicy,\n  statusRegistry: RuntimeStatusRegistry,\n  verboseDiagnostics: boolean,\n): {\n  check: ValidateCheck;\n  warnings: string[];\n  closeReasonBackfillRows: CloseReasonBackfillRow[];\n  estimateBackfillRows: EstimateBackfillRow[];\n} {\n  const itemsById = new Map(items.map((item) => [item.id, item]));\n\n  // GH-276: only the `strict` profile enforces planning fields on terminal\n  // (closed/canceled) historical items; core/minimal/custom profiles treat a\n  // retired item's missing estimate or acceptance criteria as resolved.\n  const enforcePlanningFieldsOnTerminal = metadataPolicy.profile === \"strict\";\n  const missingByField = collectMissingMetadataByField(items, statusRegistry, enforcePlanningFieldsOnTerminal);\n\n  // Duplicate logical issue-code detection (GH-235): advisory warning when two\n  // or more items share a leading title issue code (e.g. `ISSUE-004`).\n  const duplicateIssueCodes = findDuplicateIssueCodes(items);\n  const duplicateIssueCodeSummary = summarizeDuplicateIssueCodes(duplicateIssueCodes, verboseDiagnostics);\n  const warningTokens = buildMetadataWarningTokens(metadataPolicy, missingByField, duplicateIssueCodeSummary.warnings);\n\n  // Zero-suppress counts to reduce agent token cost (telemetry pm-tylj).\n  // Only emit counts for the ACTIVE required fields of the resolved profile so a\n  // looser profile (e.g. core) never reports missing reviewer/risk/sprint/etc.\n  // Defensive guards (Gemini high #1, PR #78 follow-up): a future settings\n  // shape could include an unsupported field in required_fields — fall back\n  // to 0 instead of throwing TypeError, and skip writing when the count-key\n  // mapping is undefined.\n  const counts = buildMetadataCounts(metadataPolicy, missingByField);\n  // Per-item-type grouping of missing required-field counts (pm-pmyq /\n  // GH-172): counts only — never row dumps — and only for the ACTIVE required\n  // fields, so the grouping mirrors `counts` at type granularity (e.g.\n  // `{ Task: { close_reason: 3 } }`). Zero-suppressed at both levels.\n  const missingFieldOccurrences = buildMissingFieldOccurrences(metadataPolicy, missingByField, itemsById);\n  const missingByType = buildMissingByTypeCounts(missingFieldOccurrences);\n  const details: Record<string, unknown> = {\n    checked_items: items.length,\n    metadata_profile: metadataPolicy.profile,\n    metadata_profile_source: metadataPolicy.profile_source,\n    metadata_profile_fallback_to_core: metadataPolicy.fallback_to_core,\n    required_fields: [...metadataPolicy.required_fields],\n    supported_required_fields: [...SUPPORTED_METADATA_REQUIRED_FIELDS],\n    counts,\n    missing_by_type: missingByType,\n    duplicate_issue_codes_count: duplicateIssueCodes.length,\n    duplicate_issue_codes: duplicateIssueCodeSummary.rows,\n    duplicate_issue_codes_truncated: duplicateIssueCodeSummary.truncated,\n  };\n  if (metadataPolicy.configured_custom_fields.length > 0) {\n    details.configured_custom_required_fields = [...metadataPolicy.configured_custom_fields];\n  }\n\n  // Only emit per-field item_ids/truncated keys for the ACTIVE required fields of\n  // the resolved profile (and only when there are missing items). This stops a\n  // looser profile (e.g. core) from emitting the identical full ID array for\n  // reviewer/risk/confidence/sprint/release that it does not even require\n  // (pm-edge #2 — ~150 redundant lines per validate run on minimal/core).\n  // Defensive guard (Gemini high #2, PR #78 follow-up): same optional-chain\n  // safety as the counts loop above — never throw if a future settings shape\n  // includes an unsupported field.\n  attachMissingMetadataItemIds(details, metadataPolicy, missingByField, verboseDiagnostics);\n\n  // Auto-fix planning input (pm-c3sz): closed items flagged for a missing\n  // close_reason whose resolution can serve as the derivable source value.\n  // Only collected when close_reason is an active required field, so fixes\n  // always trace back to an actual finding of this run.\n  const closeReasonBackfillRows = buildCloseReasonBackfillRows(metadataPolicy, missingByField, itemsById);\n\n  // Estimate auto-fix planning input (GH-212): items flagged for a missing\n  // estimated_minutes whose type drives the config-driven default backfill.\n  // Only collected when estimated_minutes is an active required field, so fixes\n  // always trace back to an actual finding of this run.\n  const estimateBackfillRows = buildEstimateBackfillRows(metadataPolicy, missingByField, itemsById);\n\n  return {\n    check: {\n      name: \"metadata\",\n      status: warningTokens.length === 0 ? \"ok\" : \"warn\",\n      details,\n    },\n    warnings: warningTokens,\n    closeReasonBackfillRows,\n    estimateBackfillRows,\n  };\n}\n/* c8 ignore stop */\n\nfunction buildResolutionCheck(\n  items: ItemWithBody[],\n  statusRegistry: RuntimeStatusRegistry,\n  verboseDiagnostics: boolean,\n): { check: ValidateCheck; warnings: string[]; resolutionBackfillRows: ResolutionBackfillRow[] } {\n  const terminalDoneStatuses = new Set<string>(statusRegistry.terminal_done_statuses);\n  terminalDoneStatuses.add(statusRegistry.close_status);\n  const closedItems = items.filter((item) => terminalDoneStatuses.has(normalizeStatusForRegistry(item.status, statusRegistry)));\n  const missingResolutionRows: Array<{ id: string; missing_fields: ResolutionFieldKey[] }> = [];\n  const resolutionBackfillRows: ResolutionBackfillRow[] = [];\n\n  for (const item of closedItems) {\n    const missingFields = RESOLUTION_FIELD_KEYS.filter((field) => !toNonEmptyStringOrUndefined(item[field]));\n    if (missingFields.length === 0) {\n      continue;\n    }\n    missingResolutionRows.push({\n      id: item.id,\n      missing_fields: missingFields,\n    });\n    // Auto-fix planning input (pm-c3sz): the planner backfills only the\n    // `resolution` field, deriving from the item's close_reason when present.\n    resolutionBackfillRows.push({\n      id: item.id,\n      missing_fields: missingFields,\n      close_reason: toNonEmptyStringOrUndefined(item.close_reason),\n    });\n  }\n\n  const warnings =\n    missingResolutionRows.length > 0 ? [`validate_resolution_missing_fields:${missingResolutionRows.length}`] : [];\n  const diagnosticLimit = verboseDiagnostics ? Number.POSITIVE_INFINITY : DIAGNOSTIC_LIST_SUMMARY_LIMIT;\n  const summarizedRows = summarizeList(\n    missingResolutionRows.map((row) => `${row.id}:${row.missing_fields.join(\",\")}`),\n    diagnosticLimit,\n  );\n  const remediationHints = missingResolutionRows.map((row) => buildResolutionRemediationCommand(row));\n  const summarizedHints = summarizeList(remediationHints, diagnosticLimit);\n  return {\n    check: {\n      name: \"resolution\",\n      status: warnings.length === 0 ? \"ok\" : \"warn\",\n      details: {\n        checked_closed_items: closedItems.length,\n        missing_resolution_items: missingResolutionRows.length,\n        missing_resolution_rows: summarizedRows.values,\n        missing_resolution_rows_truncated: summarizedRows.truncated,\n        missing_resolution_remediation_hints: summarizedHints.values,\n        missing_resolution_remediation_hints_truncated: summarizedHints.truncated,\n      },\n    },\n    warnings,\n    resolutionBackfillRows,\n  };\n}\n\n/* c8 ignore start -- lifecycle dependency-graph cycle analysis is covered by lifecycle integration fixtures */\nfunction escapeRegExp(value: string): string {\n  return value.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\n\nfunction buildLifecycleDependencyGraph(activeItems: ItemWithBody[], idPrefix = \"pm\"): Map<string, string[]> {\n  const activeItemIds = new Set(activeItems.map((item) => item.id));\n  const graph = new Map<string, string[]>();\n  const sortedItems = [...activeItems].sort((left, right) => left.id.localeCompare(right.id));\n  for (const item of sortedItems) {\n    const edges = new Set<string>();\n    const blockedBy = toMeaningfulString(item.blocked_by);\n    if (blockedBy && activeItemIds.has(blockedBy)) {\n      edges.add(blockedBy);\n    }\n    for (const dependency of item.dependencies ?? []) {\n      const dependencyId = toMeaningfulString(dependency.id);\n      if (!dependencyId || !activeItemIds.has(dependencyId)) {\n        continue;\n      }\n      edges.add(dependencyId);\n    }\n    const definitionOfReady = toMeaningfulString(item.definition_of_ready);\n    if (definitionOfReady) {\n      for (const referencedId of extractItemIds(definitionOfReady, idPrefix)) {\n        if (activeItemIds.has(referencedId)) {\n          edges.add(referencedId);\n        }\n      }\n    }\n    graph.set(item.id, [...edges].sort((left, right) => left.localeCompare(right)));\n  }\n  return graph;\n}\n/* c8 ignore stop */\n\nfunction extractItemIds(value: string, idPrefix = \"pm\"): string[] {\n  const normalizedPrefix = (idPrefix.trim().toLowerCase() || \"pm\").replace(/-+$/g, \"\");\n  const pattern = new RegExp(`(?:^|[^a-z0-9-])(${escapeRegExp(normalizedPrefix)}-[a-z0-9][a-z0-9-]*)`, \"gi\");\n  return [...new Set([...value.matchAll(pattern)].map((match) => match[1]!.toLowerCase()))].sort(\n    (left, right) => left.localeCompare(right),\n  );\n}\n\n/* c8 ignore start -- Tarjan SCC traversal branch matrix is covered by lifecycle cycle integration fixtures */\nfunction findLifecycleDependencyCycleComponents(graph: Map<string, string[]>): string[][] {\n  let nextIndex = 0;\n  const indexById = new Map<string, number>();\n  const lowLinkById = new Map<string, number>();\n  const stack: string[] = [];\n  const inStack = new Set<string>();\n  const components: string[][] = [];\n\n  const visit = (id: string): void => {\n    indexById.set(id, nextIndex);\n    lowLinkById.set(id, nextIndex);\n    nextIndex += 1;\n    stack.push(id);\n    inStack.add(id);\n\n    for (const dependencyId of graph.get(id) ?? []) {\n      if (!indexById.has(dependencyId)) {\n        visit(dependencyId);\n        lowLinkById.set(id, Math.min(lowLinkById.get(id)!, lowLinkById.get(dependencyId)!));\n      } else if (inStack.has(dependencyId)) {\n        lowLinkById.set(id, Math.min(lowLinkById.get(id)!, indexById.get(dependencyId)!));\n      }\n    }\n\n    if (lowLinkById.get(id) !== indexById.get(id)) {\n      return;\n    }\n    const component: string[] = [];\n    while (stack.length > 0) {\n      const member = stack.pop()!;\n      inStack.delete(member);\n      component.push(member);\n      if (member === id) {\n        break;\n      }\n    }\n    component.sort((left, right) => left.localeCompare(right));\n    components.push(component);\n  };\n\n  const sortedNodeIds = [...graph.keys()].sort((left, right) => left.localeCompare(right));\n  for (const id of sortedNodeIds) {\n    if (!indexById.has(id)) {\n      visit(id);\n    }\n  }\n\n  const cycleComponents = components.filter((component) => {\n    if (component.length > 1) {\n      return true;\n    }\n    const selfId = component[0];\n    return (graph.get(selfId) ?? []).includes(selfId);\n  });\n  return cycleComponents.sort(\n    (left, right) =>\n      left[0].localeCompare(right[0]) ||\n      left.length - right.length ||\n      left.join(\",\").localeCompare(right.join(\",\")),\n  );\n}\n/* c8 ignore stop */\n\n/* c8 ignore start -- cycle sample-path fallback branches are covered by lifecycle graph integration tests */\nfunction resolveLifecycleDependencyCycleSamplePath(component: string[], graph: Map<string, string[]>): string[] {\n  const start = component[0];\n  if (component.length === 1) {\n    return [start, start];\n  }\n  const componentSet = new Set(component);\n  const path: string[] = [start];\n  const visited = new Set<string>([start]);\n\n  const search = (current: string): boolean => {\n    const neighbors = (graph.get(current) ?? []).filter((candidate) => componentSet.has(candidate));\n    for (const next of neighbors) {\n      if (next === start && path.length > 1) {\n        path.push(start);\n        return true;\n      }\n      if (visited.has(next)) {\n        continue;\n      }\n      visited.add(next);\n      path.push(next);\n      if (search(next)) {\n        return true;\n      }\n      path.pop();\n      visited.delete(next);\n    }\n    return false;\n  };\n\n  if (search(start)) {\n    return [...path];\n  }\n  return [...component, start];\n}\n/* c8 ignore stop */\n\nfunction detectLifecycleDependencyCycles(activeItems: ItemWithBody[], idPrefix = \"pm\"): {\n  cycle_count: number;\n  cycle_item_ids: string[];\n  cycle_sample_paths: string[];\n} {\n  const graph = buildLifecycleDependencyGraph(activeItems, idPrefix);\n  const cycleComponents = findLifecycleDependencyCycleComponents(graph);\n  const cycleItemIds = [...new Set(cycleComponents.flat())].sort((left, right) => left.localeCompare(right));\n  const cycleSamplePaths = cycleComponents.map((component) =>\n    resolveLifecycleDependencyCycleSamplePath(component, graph).join(\"->\"),\n  );\n  return {\n    cycle_count: cycleComponents.length,\n    cycle_item_ids: cycleItemIds,\n    cycle_sample_paths: cycleSamplePaths,\n  };\n}\n\n// Parent (composition) cycle detection (pm-8vul / GH-280). The dependency-cycle\n// path above only walks blocked_by/definition_of_ready edges across ACTIVE items;\n// it never traverses item.parent, so a parent cycle (A.parent=B, B.parent=A, or\n// any longer ring) goes undetected while it silently breaks `pm list --tree`,\n// orphan detection, and progress rollups. We reuse the generic Tarjan SCC helper\n// on a child->[parent] adjacency map. Unlike dependency cycles we scan ALL items\n// (not just active ones) because a parent cycle among closed items is still\n// structural corruption of the hierarchy.\nfunction buildLifecycleParentGraph(items: ItemWithBody[]): Map<string, string[]> {\n  // PR #279 made parent matching case-insensitive (e.g. `parent: PM-FK49`\n  // resolves to `id: pm-fk49`). Resolve parent references to their canonical\n  // item id the same way so a casing mismatch can never silently drop a cycle\n  // edge and hide a parent cycle (false negative).\n  const canonicalIdByLowercase = new Map(items.map((item) => [item.id.toLowerCase(), item.id]));\n  const graph = new Map<string, string[]>();\n  const sortedItems = [...items].sort((left, right) => left.id.localeCompare(right.id));\n  for (const item of sortedItems) {\n    const edges: string[] = [];\n    const parentId = toMeaningfulString(item.parent);\n    const canonicalParentId = parentId ? canonicalIdByLowercase.get(parentId.toLowerCase()) : undefined;\n    if (canonicalParentId) {\n      edges.push(canonicalParentId);\n    }\n    graph.set(item.id, edges);\n  }\n  return graph;\n}\n\nfunction detectLifecycleParentCycles(items: ItemWithBody[]): {\n  cycle_count: number;\n  cycle_item_ids: string[];\n  cycle_sample_paths: string[];\n} {\n  const graph = buildLifecycleParentGraph(items);\n  const cycleComponents = findLifecycleDependencyCycleComponents(graph);\n  const cycleItemIds = [...new Set(cycleComponents.flat())].sort((left, right) => left.localeCompare(right));\n  const cycleSamplePaths = cycleComponents.map((component) =>\n    resolveLifecycleDependencyCycleSamplePath(component, graph).join(\"->\"),\n  );\n  return {\n    cycle_count: cycleComponents.length,\n    cycle_item_ids: cycleItemIds,\n    cycle_sample_paths: cycleSamplePaths,\n  };\n}\n\ninterface OrphanedPathRow {\n  path: string;\n  classification: OrphanedPathClassification;\n  owner_candidate: {\n    id: string;\n    type: string;\n    title: string;\n    status: string;\n    confidence: \"path_prefix\" | \"same_directory\" | \"shared_directory\";\n  } | null;\n  remediation_hint: string;\n}\n\nfunction classifyOrphanedPath(pathValue: string): OrphanedPathClassification {\n  if (pathValue.startsWith(\"docs/\")) {\n    return \"docs_unowned\";\n  }\n  if (pathValue.startsWith(\"tests/\")) {\n    return \"tests_unowned\";\n  }\n  if (pathValue.startsWith(\"src/\")) {\n    return \"source_unowned\";\n  }\n  if (pathValue.endsWith(\".md\")) {\n    return \"docs_unowned\";\n  }\n  return \"unlinked_existing\";\n}\n\nfunction directoryOf(relativePath: string): string {\n  const slash = relativePath.lastIndexOf(\"/\");\n  return slash === -1 ? \"\" : relativePath.slice(0, slash);\n}\n\nfunction sharedDirectoryPrefixLength(left: string, right: string): number {\n  const leftParts = directoryOf(left).split(\"/\").filter(Boolean);\n  const rightParts = directoryOf(right).split(\"/\").filter(Boolean);\n  let count = 0;\n  while (count < leftParts.length && count < rightParts.length && leftParts[count] === rightParts[count]) {\n    count += 1;\n  }\n  return count;\n}\n\ninterface OrphanOwnerCandidateScore {\n  score: number;\n  confidence: \"path_prefix\" | \"same_directory\" | \"shared_directory\";\n}\n\nfunction scoreOrphanOwnerCandidate(pathValue: string, linkedPath: string): OrphanOwnerCandidateScore | null {\n  const linkedDir = directoryOf(linkedPath);\n  const orphanDir = directoryOf(pathValue);\n  const directoryPrefix = linkedPath.endsWith(\"/\") ? linkedPath : `${linkedPath}/`;\n  const isDirectoryPrefix = pathValue.startsWith(directoryPrefix);\n  const sameDirectory = linkedDir.length > 0 && linkedDir === orphanDir;\n  const sharedPrefixLength = sharedDirectoryPrefixLength(pathValue, linkedPath);\n  if (!isDirectoryPrefix && !sameDirectory && sharedPrefixLength === 0) {\n    return null;\n  }\n  if (isDirectoryPrefix) {\n    return { score: linkedPath.length + 1000, confidence: \"path_prefix\" };\n  }\n  return sameDirectory\n    ? { score: sharedPrefixLength + 500, confidence: \"same_directory\" }\n    : { score: sharedPrefixLength, confidence: \"shared_directory\" };\n}\n\nfunction shouldReplaceOrphanOwnerCandidate(\n  best: { item: ItemWithBody; score: number } | undefined,\n  item: ItemWithBody,\n  score: number,\n): boolean {\n  return best === undefined || score > best.score || (score === best.score && item.id.localeCompare(best.item.id) < 0);\n}\n\nfunction findOrphanOwnerCandidate(\n  pathValue: string,\n  classification: OrphanedPathClassification,\n  items: readonly ItemWithBody[],\n): OrphanedPathRow[\"owner_candidate\"] {\n  const linkKind = classification === \"docs_unowned\" ? \"docs\" : \"files\";\n  let best:\n    | {\n      item: ItemWithBody;\n      score: number;\n      confidence: \"path_prefix\" | \"same_directory\" | \"shared_directory\";\n    }\n    | undefined;\n  for (const item of items) {\n    const links = linkKind === \"docs\" ? item.docs ?? [] : item.files ?? [];\n    for (const link of links) {\n      if (link.scope !== \"project\") {\n        continue;\n      }\n      const linkedPath = normalizeRelativePath(link.path);\n      if (linkedPath.length === 0 || linkedPath === pathValue) {\n        continue;\n      }\n      const scored = scoreOrphanOwnerCandidate(pathValue, linkedPath);\n      if (scored === null) {\n        continue;\n      }\n      if (shouldReplaceOrphanOwnerCandidate(best, item, scored.score)) {\n        best = {\n          item,\n          score: scored.score,\n          confidence: scored.confidence,\n        };\n      }\n    }\n  }\n  if (!best) {\n    return null;\n  }\n  return {\n    id: best.item.id,\n    type: best.item.type,\n    title: best.item.title,\n    status: best.item.status,\n    confidence: best.confidence,\n  };\n}\n\nfunction buildOrphanedPathRows(orphanedFiles: readonly string[], items: readonly ItemWithBody[]): OrphanedPathRow[] {\n  return orphanedFiles.map((pathValue) => {\n    const classification = classifyOrphanedPath(pathValue);\n    const linkCommand = classification === \"docs_unowned\" ? \"docs\" : \"files\";\n    const ownerCandidate = findOrphanOwnerCandidate(pathValue, classification, items);\n    const target = ownerCandidate?.id ?? \"<id>\";\n    return {\n      path: pathValue,\n      classification,\n      owner_candidate: ownerCandidate,\n      remediation_hint: `pm ${linkCommand} ${target} --add path=${pathValue},scope=project,note=\"<why this artifact belongs to the item>\"`,\n    };\n  });\n}\n\nfunction summarizeOrphanedPathRows(rows: readonly OrphanedPathRow[]): string[] {\n  return rows.map(\n    (row) =>\n      `${row.path}:${row.classification} owner_candidate=${row.owner_candidate?.id ?? \"unowned\"} hint=${JSON.stringify(row.remediation_hint)}`,\n  );\n}\n\ninterface LifecycleScanRows {\n  activeItems: ItemWithBody[];\n  closureLikeRows: Array<{ id: string; fields: string[] }>;\n  terminalParentRows: Array<{ id: string; parent_id: string; parent_status: string }>;\n  terminalParentFixRows: TerminalParentFixRow[];\n  staleBlockerRows: Array<{ id: string; status: string; reasons: string[] }>;\n}\n\nfunction closureLikeFieldsForItem(item: ItemWithBody, lifecyclePatternPolicy: LifecyclePatternPolicy): string[] {\n  return Object.entries(lifecyclePatternPolicy.closure_like_metadata_field_patterns)\n    .filter(([field, patterns]) => {\n      const value = toMeaningfulString(item[field as keyof ItemWithBody]);\n      return value ? patterns.some((pattern) => value.toLowerCase().includes(pattern)) : false;\n    })\n    .map(([field]) => field)\n    .sort((left, right) => left.localeCompare(right));\n}\n\nfunction buildTerminalParentFixRow(\n  item: ItemWithBody,\n  parent: ItemWithBody,\n  itemsById: Map<string, ItemWithBody>,\n  canonicalIdByLowercase: Map<string, string>,\n  statusRegistry: RuntimeStatusRegistry,\n): TerminalParentFixRow {\n  const grandparentId = toMeaningfulString(parent.parent);\n  const grandparent = grandparentId\n    ? itemsById.get(canonicalIdByLowercase.get(grandparentId.toLowerCase()) ?? grandparentId)\n    : undefined;\n  return {\n    id: item.id,\n    parent_id: parent.id,\n    grandparent_id: grandparent?.id,\n    grandparent_active: grandparent !== undefined && !isTerminalStatus(grandparent.status, statusRegistry),\n  };\n}\n\n/* v8 ignore start -- stale-blocker reason variants are covered through command-level diagnostics; helper branch counters are defensive */\nfunction staleBlockerReasonsForItem(\n  item: ItemWithBody,\n  blockedStatuses: Set<string>,\n  statusRegistry: RuntimeStatusRegistry,\n  lifecyclePatternPolicy: LifecyclePatternPolicy,\n): string[] {\n  const blockedBy = toMeaningfulString(item.blocked_by);\n  const blockedReason = toMeaningfulString(item.blocked_reason);\n  const blockedReasonNormalized = blockedReason?.toLowerCase();\n  const normalizedStatus = normalizeStatusForRegistry(item.status, statusRegistry);\n  const reasons: string[] = [];\n  if (!blockedStatuses.has(normalizedStatus)) {\n    if (blockedBy) {\n      reasons.push(\"non_blocked_status_has_blocked_by\");\n    }\n    if (blockedReason) {\n      reasons.push(\"non_blocked_status_has_blocked_reason\");\n    }\n    return reasons;\n  }\n  if (!blockedBy && !blockedReason) {\n    /* v8 ignore start -- blocked-status creation paths seed either blocked_by or blocked_reason before lifecycle validation */\n    reasons.push(\"blocked_status_missing_blocker_context\");\n    /* v8 ignore stop */\n  }\n  if (blockedReasonNormalized?.includes(\"no active blocker\")) {\n    reasons.push(\"blocked_status_reason_reports_no_active_blocker\");\n  }\n  if (\n    blockedReasonNormalized &&\n    lifecyclePatternPolicy.stale_blocker_reason_patterns.some((pattern) => blockedReasonNormalized.includes(pattern))\n  ) {\n    reasons.push(\"blocked_status_reason_matches_stale_pattern\");\n  }\n  return reasons;\n}\n/* v8 ignore stop */\n\nfunction collectLifecycleScanRows(\n  items: ItemWithBody[],\n  includeStaleBlockers: boolean,\n  statusRegistry: RuntimeStatusRegistry,\n  lifecyclePatternPolicy: LifecyclePatternPolicy,\n): LifecycleScanRows {\n  const itemsById = new Map(items.map((item) => [item.id, item]));\n  const canonicalIdByLowercase = new Map(items.map((item) => [item.id.toLowerCase(), item.id]));\n  /* v8 ignore start -- runtime status registry normally supplies blocked statuses; fallback preserves legacy settings safety */\n  const blockedStatuses =\n    statusRegistry.blocked_statuses.size > 0 ? statusRegistry.blocked_statuses : new Set<string>([\"blocked\"]);\n  /* v8 ignore stop */\n  const rows: LifecycleScanRows = {\n    activeItems: items.filter((item) => !isTerminalStatus(item.status, statusRegistry)),\n    closureLikeRows: [],\n    terminalParentRows: [],\n    terminalParentFixRows: [],\n    staleBlockerRows: [],\n  };\n  for (const item of rows.activeItems) {\n    const closureLikeFields = closureLikeFieldsForItem(item, lifecyclePatternPolicy);\n    if (closureLikeFields.length > 0) {\n      rows.closureLikeRows.push({ id: item.id, fields: closureLikeFields });\n    }\n    const parentId = toMeaningfulString(item.parent);\n    const parent = parentId ? itemsById.get(canonicalIdByLowercase.get(parentId.toLowerCase()) ?? parentId) : undefined;\n    if (parent && isTerminalStatus(parent.status, statusRegistry)) {\n      rows.terminalParentRows.push({ id: item.id, parent_id: parent.id, parent_status: parent.status });\n      rows.terminalParentFixRows.push(buildTerminalParentFixRow(item, parent, itemsById, canonicalIdByLowercase, statusRegistry));\n    }\n    /* v8 ignore start -- stale-blocker reason presence is covered by command diagnostics; branch accounting here is defensive */\n    if (includeStaleBlockers) {\n      const reasons = staleBlockerReasonsForItem(item, blockedStatuses, statusRegistry, lifecyclePatternPolicy);\n      if (reasons.length > 0) {\n        rows.staleBlockerRows.push({\n          id: item.id,\n          status: item.status,\n          reasons: [...new Set(reasons)].sort((left, right) => left.localeCompare(right)),\n        });\n      }\n    }\n    /* v8 ignore stop */\n  }\n  return rows;\n}\n\nfunction sortLifecycleScanRows(rows: LifecycleScanRows): void {\n  rows.closureLikeRows.sort((left, right) => left.id.localeCompare(right.id));\n  /* v8 ignore start -- parent-id tie breakers only matter for duplicate legacy ids, which the tracker writer prevents */\n  rows.terminalParentRows.sort(\n    (left, right) => left.id.localeCompare(right.id) || left.parent_id.localeCompare(right.parent_id),\n  );\n  rows.terminalParentFixRows.sort(\n    (left, right) => left.id.localeCompare(right.id) || left.parent_id.localeCompare(right.parent_id),\n  );\n  /* v8 ignore stop */\n  rows.staleBlockerRows.sort((left, right) => left.id.localeCompare(right.id));\n}\n\nfunction lifecycleCycleWarningToken(\n  prefix: \"validate_lifecycle_dependency_cycles\" | \"validate_hierarchy_parent_cycle\",\n  severity: ValidateDependencyCycleSeverity,\n  count: number,\n): string | null {\n  if (count <= 0 || severity === \"off\") {\n    return null;\n  }\n  return `${severity === \"error\" ? `${prefix}_error` : prefix}:${count}`;\n}\n\nfunction buildLifecycleWarnings(\n  rows: LifecycleScanRows,\n  includeStaleBlockers: boolean,\n  dependencyCycleSeverity: ValidateDependencyCycleSeverity,\n  parentCycleSeverity: ValidateDependencyCycleSeverity,\n  dependencyCycleCount: number,\n  parentCycleCount: number,\n): string[] {\n  const warnings: string[] = [];\n  if (rows.closureLikeRows.length > 0) {\n    warnings.push(`validate_lifecycle_active_closure_like_metadata:${rows.closureLikeRows.length}`);\n  }\n  if (rows.terminalParentRows.length > 0) {\n    warnings.push(`validate_lifecycle_active_terminal_parent:${rows.terminalParentRows.length}`);\n  }\n  if (includeStaleBlockers && rows.staleBlockerRows.length > 0) {\n    warnings.push(`validate_lifecycle_stale_blockers:${rows.staleBlockerRows.length}`);\n  }\n  const dependencyWarning = lifecycleCycleWarningToken(\n    \"validate_lifecycle_dependency_cycles\",\n    dependencyCycleSeverity,\n    dependencyCycleCount,\n  );\n  const parentWarning = lifecycleCycleWarningToken(\"validate_hierarchy_parent_cycle\", parentCycleSeverity, parentCycleCount);\n  return [...warnings, ...(dependencyWarning ? [dependencyWarning] : []), ...(parentWarning ? [parentWarning] : [])];\n}\n\ninterface LinkedPathScanState {\n  linkedProjectPaths: Set<string>;\n  remoteLinkedPaths: Set<string>;\n  missingLinkedPaths: string[];\n  staleLinkRows: Array<{ item_id: string; path: string; link_kind: \"files\" | \"docs\" }>;\n}\n\nasync function linkedArtifactIsMissing(workspaceRoot: string, artifactPath: string): Promise<boolean> {\n  const absolutePath = path.isAbsolute(artifactPath) ? artifactPath : path.resolve(workspaceRoot, artifactPath);\n  try {\n    const stats = await fs.stat(absolutePath);\n    return !stats.isFile() && !stats.isDirectory();\n  } catch (error) {\n    const code =\n      typeof error === \"object\" && error !== null && \"code\" in error\n        ? (error as { code?: unknown }).code\n        : undefined;\n    return code === \"ENOENT\" || code === \"ENOTDIR\";\n  }\n}\n\nasync function collectLinkedPathScanState(items: ItemWithBody[], workspaceRoot: string): Promise<LinkedPathScanState> {\n  const state: LinkedPathScanState = {\n    linkedProjectPaths: new Set<string>(),\n    remoteLinkedPaths: new Set<string>(),\n    missingLinkedPaths: [],\n    staleLinkRows: [],\n  };\n  for (const item of items) {\n    const linkedArtifactGroups = [\n      { link_kind: \"files\" as const, artifacts: item.files ?? [] },\n      { link_kind: \"docs\" as const, artifacts: item.docs ?? [] },\n    ];\n    for (const group of linkedArtifactGroups) {\n      for (const artifact of group.artifacts) {\n        if (artifact.scope !== \"project\") {\n          continue;\n        }\n        if (isRemoteLinkedArtifactReference(artifact.path)) {\n          state.remoteLinkedPaths.add(artifact.path.trim());\n          continue;\n        }\n        const normalizedPath = normalizeRelativePath(artifact.path);\n        if (normalizedPath.length === 0) {\n          continue;\n        }\n        state.linkedProjectPaths.add(normalizedPath);\n        if (await linkedArtifactIsMissing(workspaceRoot, artifact.path)) {\n          state.missingLinkedPaths.push(normalizedPath);\n          state.staleLinkRows.push({ item_id: item.id, path: normalizedPath, link_kind: group.link_kind });\n        }\n      }\n    }\n  }\n  return state;\n}\n\ninterface FileCandidatePartition {\n  strictTrackedAllMode: boolean;\n  strictModeForcesPmInternals: boolean;\n  includePmInternalsEffective: boolean;\n  pmInternalCandidatePrefixes: string[];\n  excludedPmInternalPaths: string[];\n  candidateFiles: string[];\n  excludedByReason: Record<string, unknown>;\n}\n\nfunction partitionFileCandidates(\n  fileCandidates: FileCandidateCollection,\n  pmRoot: string,\n  workspaceRoot: string,\n  fileScanMode: ValidateFileScanMode,\n  includePmInternals: boolean,\n  verboseFileLists: boolean,\n): FileCandidatePartition {\n  const strictTrackedAllMode = fileScanMode === \"tracked-all-strict\";\n  const strictModeForcesPmInternals = strictTrackedAllMode && !includePmInternals;\n  const includePmInternalsEffective = includePmInternals || strictTrackedAllMode;\n  const pmInternalCandidatePrefixes = includePmInternalsEffective ? [] : resolvePmInternalCandidatePrefixes(pmRoot, workspaceRoot);\n  const excludedPmInternalPaths =\n    pmInternalCandidatePrefixes.length === 0\n      ? []\n      : fileCandidates.candidateFiles.filter((candidate) => hasPathPrefix(candidate, pmInternalCandidatePrefixes));\n  const candidateFiles =\n    pmInternalCandidatePrefixes.length === 0\n      ? fileCandidates.candidateFiles\n      : fileCandidates.candidateFiles.filter((candidate) => !hasPathPrefix(candidate, pmInternalCandidatePrefixes));\n  const excludedByReason: Record<string, unknown> = {};\n  if (excludedPmInternalPaths.length > 0) {\n    const summarizedPmInternalPaths = summarizeFileList(excludedPmInternalPaths, verboseFileLists);\n    excludedByReason.pm_internals = {\n      count: excludedPmInternalPaths.length,\n      paths: summarizedPmInternalPaths.values,\n      paths_truncated: summarizedPmInternalPaths.truncated,\n      paths_total: summarizedPmInternalPaths.total,\n    };\n  }\n  return {\n    strictTrackedAllMode,\n    strictModeForcesPmInternals,\n    includePmInternalsEffective,\n    pmInternalCandidatePrefixes,\n    excludedPmInternalPaths,\n    candidateFiles,\n    excludedByReason,\n  };\n}\n\n/* c8 ignore start -- lifecycle stale/terminal/dependency diagnostics matrix is covered by end-to-end validate integration runs */\nfunction buildLifecycleCheck(\n  items: ItemWithBody[],\n  includeStaleBlockers: boolean,\n  dependencyCycleSeverity: ValidateDependencyCycleSeverity,\n  parentCycleSeverity: ValidateDependencyCycleSeverity,\n  statusRegistry: RuntimeStatusRegistry,\n  lifecyclePatternPolicy: LifecyclePatternPolicy,\n  verboseDiagnostics: boolean,\n  idPrefix = \"pm\",\n): { check: ValidateCheck; warnings: string[]; terminalParentFixRows: TerminalParentFixRow[] } {\n  const rows = collectLifecycleScanRows(items, includeStaleBlockers, statusRegistry, lifecyclePatternPolicy);\n  sortLifecycleScanRows(rows);\n  const dependencyCycleDiagnostics = detectLifecycleDependencyCycles(rows.activeItems, idPrefix);\n  const parentCycleDiagnostics = detectLifecycleParentCycles(items);\n  const warnings = buildLifecycleWarnings(\n    rows,\n    includeStaleBlockers,\n    dependencyCycleSeverity,\n    parentCycleSeverity,\n    dependencyCycleDiagnostics.cycle_count,\n    parentCycleDiagnostics.cycle_count,\n  );\n\n  const diagnosticLimit = verboseDiagnostics ? Number.POSITIVE_INFINITY : DIAGNOSTIC_LIST_SUMMARY_LIMIT;\n  const summarizedClosureLikeRows = summarizeList(\n    rows.closureLikeRows.map((row) => `${row.id}:${row.fields.join(\",\")}`),\n    diagnosticLimit,\n  );\n  const summarizedTerminalParentRows = summarizeList(\n    rows.terminalParentRows.map((row) => `${row.id}:${row.parent_id}:${row.parent_status}`),\n    diagnosticLimit,\n  );\n  const summarizedStaleBlockerRows = summarizeList(\n    rows.staleBlockerRows.map((row) => `${row.id}:${row.status}:${row.reasons.join(\",\")}`),\n    diagnosticLimit,\n  );\n  const summarizedDependencyCycleItemIds = summarizeList(dependencyCycleDiagnostics.cycle_item_ids, diagnosticLimit);\n  const summarizedDependencyCycleSamplePaths = summarizeList(dependencyCycleDiagnostics.cycle_sample_paths, diagnosticLimit);\n  const summarizedParentCycleItemIds = summarizeList(parentCycleDiagnostics.cycle_item_ids, diagnosticLimit);\n  const summarizedParentCycleSamplePaths = summarizeList(parentCycleDiagnostics.cycle_sample_paths, diagnosticLimit);\n\n  const hasErrorSeverityCycle =\n    (dependencyCycleDiagnostics.cycle_count > 0 && dependencyCycleSeverity === \"error\") ||\n    (parentCycleDiagnostics.cycle_count > 0 && parentCycleSeverity === \"error\");\n\n  return {\n    check: {\n      name: \"lifecycle\",\n      status: hasErrorSeverityCycle\n        ? \"error\"\n        : warnings.length === 0\n          ? \"ok\"\n          : \"warn\",\n      details: {\n        checked_active_items: rows.activeItems.length,\n        active_closure_like_metadata_items: rows.closureLikeRows.length,\n        active_closure_like_metadata_rows: summarizedClosureLikeRows.values,\n        active_closure_like_metadata_rows_truncated: summarizedClosureLikeRows.truncated,\n        active_terminal_parent_items: rows.terminalParentRows.length,\n        active_terminal_parent_rows: summarizedTerminalParentRows.values,\n        active_terminal_parent_rows_truncated: summarizedTerminalParentRows.truncated,\n        stale_blocker_checks_enabled: includeStaleBlockers,\n        stale_blocker_items: rows.staleBlockerRows.length,\n        stale_blocker_rows: summarizedStaleBlockerRows.values,\n        stale_blocker_rows_truncated: summarizedStaleBlockerRows.truncated,\n        dependency_cycle_severity_policy: dependencyCycleSeverity,\n        dependency_cycle_count: dependencyCycleDiagnostics.cycle_count,\n        dependency_cycle_item_count: dependencyCycleDiagnostics.cycle_item_ids.length,\n        dependency_cycle_item_ids: summarizedDependencyCycleItemIds.values,\n        dependency_cycle_item_ids_truncated: summarizedDependencyCycleItemIds.truncated,\n        dependency_cycle_sample_paths: summarizedDependencyCycleSamplePaths.values,\n        dependency_cycle_sample_paths_truncated: summarizedDependencyCycleSamplePaths.truncated,\n        parent_cycle_severity_policy: parentCycleSeverity,\n        parent_cycle_count: parentCycleDiagnostics.cycle_count,\n        parent_cycle_item_count: parentCycleDiagnostics.cycle_item_ids.length,\n        parent_cycle_item_ids: summarizedParentCycleItemIds.values,\n        parent_cycle_item_ids_truncated: summarizedParentCycleItemIds.truncated,\n        parent_cycle_sample_paths: summarizedParentCycleSamplePaths.values,\n        parent_cycle_sample_paths_truncated: summarizedParentCycleSamplePaths.truncated,\n        stale_blocker_reason_patterns: [...lifecyclePatternPolicy.stale_blocker_reason_patterns],\n        stale_blocker_reason_pattern_source: lifecyclePatternPolicy.stale_blocker_reason_pattern_source,\n        closure_like_blocked_reason_patterns: [\n          ...lifecyclePatternPolicy.closure_like_metadata_field_patterns.blocked_reason,\n        ],\n        closure_like_blocked_reason_pattern_source:\n          lifecyclePatternPolicy.closure_like_metadata_field_pattern_sources.blocked_reason,\n        closure_like_resolution_patterns: [...lifecyclePatternPolicy.closure_like_metadata_field_patterns.resolution],\n        closure_like_resolution_pattern_source:\n          lifecyclePatternPolicy.closure_like_metadata_field_pattern_sources.resolution,\n        closure_like_actual_result_patterns: [...lifecyclePatternPolicy.closure_like_metadata_field_patterns.actual_result],\n        closure_like_actual_result_pattern_source:\n          lifecyclePatternPolicy.closure_like_metadata_field_pattern_sources.actual_result,\n      },\n    },\n    warnings,\n    terminalParentFixRows: rows.terminalParentFixRows,\n  };\n}\n/* c8 ignore stop */\n\n/* c8 ignore start -- files-check candidate filtering/classification permutations are covered by file-audit integration suites */\nasync function buildFilesCheck(\n  items: ItemWithBody[],\n  workspaceRoot: string,\n  pmRoot: string,\n  fileScanMode: ValidateFileScanMode,\n  includePmInternals: boolean,\n  verboseFileLists: boolean,\n): Promise<{ check: ValidateCheck; warnings: string[]; staleLinkPruneRows: StaleLinkPruneRow[] }> {\n  const linkedPathState = await collectLinkedPathScanState(items, workspaceRoot);\n  const itemsById = new Map(items.map((item) => [item.id, item]));\n  const uniqueMissingLinkedPaths = [...new Set(linkedPathState.missingLinkedPaths)].sort((left, right) => left.localeCompare(right));\n  const fileCandidates = await collectProjectFileCandidates(workspaceRoot, fileScanMode);\n  const partition = partitionFileCandidates(fileCandidates, pmRoot, workspaceRoot, fileScanMode, includePmInternals, verboseFileLists);\n  const orphanedFiles = partition.candidateFiles.filter((candidate) => !linkedPathState.linkedProjectPaths.has(candidate));\n  const orphanedPathRows = buildOrphanedPathRows(orphanedFiles, items);\n  // Stale-path classification (pm-0v2m / GH-184): a missing linked path whose\n  // basename still exists in the candidate scan is reported as `moved` (with\n  // relink candidates); otherwise it is `deleted` and safe to prune.\n  const classifiedStalePaths = classifyStaleLinkedPaths(uniqueMissingLinkedPaths, partition.candidateFiles);\n  const classificationByPath = new Map(classifiedStalePaths.map((entry) => [entry.path, entry.classification]));\n  const movedStalePathCount = classifiedStalePaths.filter((entry) => entry.classification === \"moved\").length;\n  const staleLinkPruneRows: StaleLinkPruneRow[] = linkedPathState.staleLinkRows\n    .map((row) => ({\n      ...row,\n      classification: classificationByPath.get(row.path) ?? (\"deleted\" as const),\n    }))\n    .sort(\n      (left, right) =>\n        left.item_id.localeCompare(right.item_id) ||\n        left.path.localeCompare(right.path) ||\n        left.link_kind.localeCompare(right.link_kind),\n    );\n  const warnings: string[] = [];\n  if (partition.strictModeForcesPmInternals) {\n    warnings.push(\"validate_files_tracked_all_strict_forces_pm_internals\");\n  }\n  if (uniqueMissingLinkedPaths.length > 0) {\n    warnings.push(`validate_files_missing_linked_paths:${uniqueMissingLinkedPaths.length}`);\n  }\n  if (orphanedFiles.length > 0) {\n    warnings.push(`validate_files_orphaned_paths:${orphanedFiles.length}`);\n  }\n  const uniqueRemoteLinkedPaths = [...linkedPathState.remoteLinkedPaths].sort((left, right) => left.localeCompare(right));\n  const summarizedRemote = summarizeFileList(uniqueRemoteLinkedPaths, verboseFileLists);\n  const summarizedMissing = summarizeFileList(uniqueMissingLinkedPaths, verboseFileLists);\n  const summarizedOrphaned = summarizeFileList(orphanedFiles, verboseFileLists);\n  const summarizedOrphanedClassifications = summarizeFileList(\n    orphanedPathRows.map((row) => `${row.path}:${row.classification}:owner_candidate=${row.owner_candidate?.id ?? \"unowned\"}`),\n    verboseFileLists,\n  );\n  const orphanedPathRowDetail = verboseFileLists\n    ? orphanedPathRows\n    : summarizeFileList(summarizeOrphanedPathRows(orphanedPathRows), false).values;\n  const summarizedClassifications = summarizeFileList(\n    summarizeStaleLinkedPathClassifications(classifiedStalePaths),\n    verboseFileLists,\n  );\n  // Owner attribution for missing linked paths (GH-210): per-path rows naming\n  // the owning item(s) so cleanup is evidence-based instead of requiring a\n  // reverse lookup. Full structured objects under --verbose-file-lists; compact\n  // `path:classification owner=… field=…` one-liners (capped) otherwise — same\n  // full/summary split as the other file-check lists (file_list_detail_mode).\n  const missingLinkedPathRows: StaleLinkOwnerInput[] = staleLinkPruneRows.map((row) => ({\n    item_id: row.item_id,\n    path: row.path,\n    link_kind: row.link_kind,\n    classification: row.classification,\n  }));\n  const ownerRows = buildMissingLinkedPathRows(missingLinkedPathRows, (id) => {\n    const owner = itemsById.get(id);\n    return owner ? { type: owner.type, title: owner.title, status: owner.status } : undefined;\n  });\n  // Default to token-efficient compact one-liners; expose the full structured\n  // rows (the GH-210 JSON shape) under --verbose-file-lists.\n  const ownerRowDetail = verboseFileLists\n    ? ownerRows\n    : summarizeFileList(summarizeMissingLinkedPathRows(ownerRows), false).values;\n\n  return {\n    check: {\n      name: \"files\",\n      status: warnings.length === 0 ? \"ok\" : \"warn\",\n      details: {\n        workspace_root: workspaceRoot,\n        scan_mode_requested: fileCandidates.requestedMode,\n        scan_mode_applied: fileCandidates.appliedMode,\n        strict_tracked_all_mode: partition.strictTrackedAllMode,\n        strict_mode_forces_pm_internals: partition.strictModeForcesPmInternals,\n        strict_mode_forces_pm_internals_notice: partition.strictModeForcesPmInternals\n          ? \"tracked-all-strict force-enables PM internals; pass --include-pm-internals to make inclusion explicit.\"\n          : null,\n        file_list_detail_mode: verboseFileLists ? \"full\" : \"summary\",\n        file_list_summary_limit: FILE_LIST_SUMMARY_LIMIT,\n        candidate_scan_source: fileCandidates.source,\n        include_pm_internals: partition.includePmInternalsEffective,\n        include_pm_internals_requested: includePmInternals,\n        pm_internal_candidate_prefixes: partition.pmInternalCandidatePrefixes,\n        pm_internal_excluded_count: partition.excludedPmInternalPaths.length,\n        excluded_total: partition.excludedPmInternalPaths.length,\n        excluded_by_reason: partition.excludedByReason,\n        linked_project_paths: linkedPathState.linkedProjectPaths.size,\n        remote_linked_paths_count: uniqueRemoteLinkedPaths.length,\n        remote_linked_paths_total: summarizedRemote.total,\n        remote_linked_paths: summarizedRemote.values,\n        remote_linked_paths_truncated: summarizedRemote.truncated,\n        candidate_total_raw: fileCandidates.candidateTotal,\n        candidate_scanned_raw: fileCandidates.candidateScanned,\n        candidate_total: partition.candidateFiles.length,\n        candidate_scanned: partition.candidateFiles.length,\n        scanned_candidate_files: partition.candidateFiles.length,\n        missing_linked_paths_count: uniqueMissingLinkedPaths.length,\n        missing_linked_paths_total: summarizedMissing.total,\n        missing_linked_paths: summarizedMissing.values,\n        missing_linked_paths_truncated: summarizedMissing.truncated,\n        missing_linked_paths_moved_count: movedStalePathCount,\n        missing_linked_paths_deleted_count: uniqueMissingLinkedPaths.length - movedStalePathCount,\n        missing_linked_path_classifications: summarizedClassifications.values,\n        missing_linked_path_classifications_truncated: summarizedClassifications.truncated,\n        missing_linked_path_rows_count: ownerRows.length,\n        missing_linked_path_rows: ownerRowDetail,\n        orphaned_paths_count: orphanedFiles.length,\n        orphaned_paths_total: summarizedOrphaned.total,\n        orphaned_paths: summarizedOrphaned.values,\n        orphaned_paths_truncated: summarizedOrphaned.truncated,\n        orphaned_path_classifications: summarizedOrphanedClassifications.values,\n        orphaned_path_classifications_truncated: summarizedOrphanedClassifications.truncated,\n        orphaned_path_rows_count: orphanedPathRows.length,\n        orphaned_path_rows: orphanedPathRowDetail,\n      },\n    },\n    warnings,\n    staleLinkPruneRows,\n  };\n}\n/* c8 ignore stop */\n\n/* c8 ignore start -- history-drift warning/count projection permutations are covered by drift integration tests */\nasync function buildHistoryDriftCheck(\n  pmRoot: string,\n  items: ItemWithBody[],\n  verboseDiagnostics: boolean,\n): Promise<{ check: ValidateCheck; warnings: string[] }> {\n  const { missingStreams, unreadableStreams, hashMismatches, chainMismatches, driftedItems } = await scanHistoryDrift(\n    pmRoot,\n    items,\n  );\n  const warnings: string[] = [];\n  if (missingStreams.length > 0) {\n    warnings.push(`validate_history_drift_missing_streams:${missingStreams.length}`);\n  }\n  if (unreadableStreams.length > 0) {\n    warnings.push(`validate_history_drift_unreadable_streams:${unreadableStreams.length}`);\n  }\n  if (hashMismatches.length > 0) {\n    warnings.push(`validate_history_drift_hash_mismatches:${hashMismatches.length}`);\n  }\n  if (chainMismatches.length > 0) {\n    warnings.push(`validate_history_drift_chain_mismatches:${chainMismatches.length}`);\n  }\n  const diagnosticLimit = verboseDiagnostics ? Number.POSITIVE_INFINITY : DIAGNOSTIC_LIST_SUMMARY_LIMIT;\n  const summarizedDrifted = summarizeList(driftedItems, diagnosticLimit);\n  return {\n    check: {\n      name: \"history_drift\",\n      status: warnings.length === 0 ? \"ok\" : \"warn\",\n      details: {\n        checked_items: items.length,\n        drifted_items_count: driftedItems.length,\n        drifted_items: summarizedDrifted.values,\n        drifted_items_truncated: summarizedDrifted.truncated,\n        counts: {\n          missing_streams: missingStreams.length,\n          unreadable_streams: unreadableStreams.length,\n          hash_mismatches: hashMismatches.length,\n          chain_mismatches: chainMismatches.length,\n        },\n      },\n    },\n    warnings,\n  };\n}\n/* c8 ignore stop */\n\n/* c8 ignore start -- command preview truncation formatting is covered by command-reference integration fixtures */\nfunction summarizeCommandReferenceRow(ownerId: string, referencedId: string, command: string): string {\n  const normalizedCommand = command.trim().replaceAll(/\\s+/g, \" \");\n  const commandPreview = normalizedCommand.length > 120 ? `${normalizedCommand.slice(0, 117)}...` : normalizedCommand;\n  return `${ownerId}:${referencedId}:${commandPreview}`;\n}\n/* c8 ignore stop */\n\n/* c8 ignore start -- command-reference discovery/stale-id permutations are covered by linked-test integration suites */\nfunction buildCommandReferencesCheck(\n  items: ItemWithBody[],\n  idPrefix: string,\n  verboseDiagnostics: boolean,\n): { check: ValidateCheck; warnings: string[] } {\n  const knownIds = new Set(items.map((item) => item.id.toLowerCase()));\n  let linkedCommandsScanned = 0;\n  let referencedPmIdCount = 0;\n  const referencedPmIds = new Set<string>();\n  const staleReferenceRows: string[] = [];\n\n  for (const item of items) {\n    for (const linkedTest of item.tests ?? []) {\n      if (typeof linkedTest.command !== \"string\" || linkedTest.command.trim().length === 0) {\n        continue;\n      }\n      linkedCommandsScanned += 1;\n      const referencedIds = extractReferencedPmItemIdsFromCommand(linkedTest.command, idPrefix);\n      if (referencedIds.length === 0) {\n        continue;\n      }\n      referencedPmIdCount += referencedIds.length;\n      for (const referencedId of referencedIds) {\n        referencedPmIds.add(referencedId);\n        if (!knownIds.has(referencedId.toLowerCase())) {\n          staleReferenceRows.push(summarizeCommandReferenceRow(item.id, referencedId, linkedTest.command));\n        }\n      }\n    }\n  }\n\n  const uniqueStaleReferenceRows = [...new Set(staleReferenceRows)].sort((left, right) => left.localeCompare(right));\n  const stalePmIds = [...new Set(uniqueStaleReferenceRows.map((row) => row.split(\":\")[1] ?? \"\"))]\n    .filter((value) => value.length > 0)\n    .sort((left, right) => left.localeCompare(right));\n  const warnings =\n    uniqueStaleReferenceRows.length > 0 ? [`validate_command_references_stale_pm_ids:${uniqueStaleReferenceRows.length}`] : [];\n  const diagnosticLimit = verboseDiagnostics ? Number.POSITIVE_INFINITY : DIAGNOSTIC_LIST_SUMMARY_LIMIT;\n  const summarizedRows = summarizeList(uniqueStaleReferenceRows, diagnosticLimit);\n  const summarizedStalePmIds = summarizeList(stalePmIds, diagnosticLimit);\n  const summarizedReferencedPmIds = summarizeList(\n    [...referencedPmIds].sort((left, right) => left.localeCompare(right)),\n    diagnosticLimit,\n  );\n\n  return {\n    check: {\n      name: \"command_references\",\n      status: warnings.length === 0 ? \"ok\" : \"warn\",\n      details: {\n        checked_items: items.length,\n        linked_commands_scanned: linkedCommandsScanned,\n        referenced_pm_ids_count: referencedPmIdCount,\n        unique_referenced_pm_ids_count: referencedPmIds.size,\n        unique_referenced_pm_ids: summarizedReferencedPmIds.values,\n        unique_referenced_pm_ids_truncated: summarizedReferencedPmIds.truncated,\n        stale_pm_id_references_count: uniqueStaleReferenceRows.length,\n        stale_pm_ids_count: stalePmIds.length,\n        stale_pm_ids: summarizedStalePmIds.values,\n        stale_pm_ids_truncated: summarizedStalePmIds.truncated,\n        stale_pm_id_reference_rows: summarizedRows.values,\n        stale_pm_id_reference_rows_truncated: summarizedRows.truncated,\n      },\n    },\n    warnings,\n  };\n}\n/* c8 ignore stop */\n\n/* c8 ignore start -- format-version diagnostics projection is covered by validate format-version integration fixtures */\nfunction buildFormatVersionCheck(\n  items: ItemWithBody[],\n  verboseDiagnostics: boolean,\n): { check: ValidateCheck; warnings: string[] } {\n  const scan = scanItemFormatVersions(\n    items.map((item) => ({ ref: item.id, version: effectiveItemFormatVersion(item) })),\n  );\n  const warnings: string[] = [];\n  if (scan.outdated.length > 0) {\n    warnings.push(`validate_format_version_outdated_items:${scan.outdated.length}`);\n  }\n  if (scan.ahead.length > 0) {\n    warnings.push(`validate_format_version_ahead_items:${scan.ahead.length}`);\n  }\n  const diagnosticLimit = verboseDiagnostics ? Number.POSITIVE_INFINITY : DIAGNOSTIC_LIST_SUMMARY_LIMIT;\n  const summarizedOutdated = summarizeList(scan.outdated, diagnosticLimit);\n  const summarizedAhead = summarizeList(scan.ahead, diagnosticLimit);\n  // `ahead` items were written by a newer pm than this runtime: validation\n  // cannot vouch for fields it does not understand, so it is an error (upgrade\n  // pm). `outdated` items are a non-fatal warning (a migration would rewrite\n  // them). At the current baseline version neither list is populated.\n  const status: ValidateStatus = scan.ahead.length > 0 ? \"error\" : scan.outdated.length > 0 ? \"warn\" : \"ok\";\n  return {\n    check: {\n      name: \"format_version\",\n      status,\n      details: {\n        checked_items: items.length,\n        current_format_version: CURRENT_ITEM_FORMAT_VERSION,\n        outdated_items_count: scan.outdated.length,\n        outdated_items: summarizedOutdated.values,\n        outdated_items_truncated: summarizedOutdated.truncated,\n        ahead_items_count: scan.ahead.length,\n        ahead_items: summarizedAhead.values,\n        ahead_items_truncated: summarizedAhead.truncated,\n      },\n    },\n    warnings,\n  };\n}\n/* c8 ignore stop */\n\nconst VALIDATE_AUTO_FIX_MESSAGE = \"pm validate auto-fix\";\n\n/**\n * Apply one planned fix through the SAME audited command paths an operator\n * would use by hand (`pm update` / `pm files --remove` / `pm docs --remove`),\n * so every applied fix carries normal history, locking, and hook behavior.\n * Command modules are imported lazily: plain validate runs stay read-only and\n * never pay the mutation-stack import cost.\n */\n/* c8 ignore start -- lazy mutation-command dispatch branches are covered by validate auto-fix integration tests */\nasync function applyValidateFix(fix: ValidateFixRecord, global: GlobalOptions): Promise<void> {\n  switch (fix.kind) {\n    case \"set_resolution\":\n    case \"set_close_reason\":\n    case \"set_estimate\":\n    case \"reparent\":\n    case \"unset_parent\": {\n      const { runUpdate } = await import(\"./update.js\");\n      const updateOptions: Record<string, unknown> = { message: VALIDATE_AUTO_FIX_MESSAGE };\n      if (fix.kind === \"set_resolution\") {\n        updateOptions.resolution = fix.value;\n      } else if (fix.kind === \"set_close_reason\") {\n        updateOptions.closeReason = fix.value;\n      } else if (fix.kind === \"set_estimate\") {\n        updateOptions.estimatedMinutes = fix.value;\n      } else if (fix.kind === \"reparent\") {\n        updateOptions.parent = fix.parent_id;\n      } else {\n        updateOptions.unset = [\"parent\"];\n      }\n      await runUpdate(fix.item_id, updateOptions, global);\n      return;\n    }\n    case \"prune_file_link\": {\n      throw new Error(`Unsupported non-batched fix kind: ${fix.kind}`);\n    }\n    case \"prune_doc_link\": {\n      throw new Error(`Unsupported non-batched fix kind: ${fix.kind}`);\n    }\n  }\n}\n/* c8 ignore stop */\n\nfunction pruneBatchKey(fix: ValidateFixRecord): string | null {\n  if (fix.kind !== \"prune_file_link\" && fix.kind !== \"prune_doc_link\") {\n    return null;\n  }\n  return `${fix.kind}:${fix.item_id}`;\n}\n\n/* c8 ignore start -- batched prune/apply failure fan-out permutations are covered by auto-fix integration suites */\nasync function applyValidateFixes(applicable: ValidateFixRecord[], global: GlobalOptions): Promise<{\n  applied: ValidateFixRecord[];\n  failed: Array<{ fix: ValidateFixRecord; error: unknown }>;\n}> {\n  const applied: ValidateFixRecord[] = [];\n  const failed: Array<{ fix: ValidateFixRecord; error: unknown }> = [];\n  const pruneBatches = new Map<string, ValidateFixRecord[]>();\n\n  for (const fix of applicable) {\n    const batchKey = pruneBatchKey(fix);\n    if (batchKey === null) {\n      try {\n        await applyValidateFix(fix, global);\n        applied.push(fix);\n      } catch (error) {\n        failed.push({ fix, error });\n      }\n      continue;\n    }\n    const existing = pruneBatches.get(batchKey);\n    if (existing) {\n      existing.push(fix);\n    } else {\n      pruneBatches.set(batchKey, [fix]);\n    }\n  }\n\n  for (const batch of pruneBatches.values()) {\n    const first = batch[0];\n    /* c8 ignore next 2 -- pruneBatches values are only created with at least one fix */\n    if (!first) {\n      continue;\n    }\n    const remove = batch\n      .map((fix) => fix.path)\n      .filter((value): value is string => typeof value === \"string\" && value.length > 0);\n    try {\n      if (first.kind === \"prune_file_link\") {\n        const { runFiles } = await import(\"./files.js\");\n        await runFiles(first.item_id, { remove, message: VALIDATE_AUTO_FIX_MESSAGE }, global);\n      } else {\n        const { runDocs } = await import(\"./docs.js\");\n        await runDocs(first.item_id, { remove, message: VALIDATE_AUTO_FIX_MESSAGE }, global);\n      }\n      applied.push(...batch);\n    } catch (error) {\n      failed.push(...batch.map((fix) => ({ fix, error })));\n    }\n  }\n\n  return { applied, failed };\n}\n/* c8 ignore stop */\n\nexport const _testOnlyValidateCommand = {\n  applyValidateFix,\n  applyValidateFixes,\n  attachValidateFixHints,\n  buildCommandReferencesCheck,\n  buildCloseReasonBackfillRows,\n  buildFilesCheck,\n  buildLifecycleCheck,\n  buildLifecycleDependencyGraph,\n  buildLifecycleParentGraph,\n  buildEstimateBackfillRows,\n  buildMetadataCounts,\n  buildMissingFieldOccurrences,\n  buildOrphanedPathRows,\n  classifyOrphanedPath,\n  collectDefaultProjectFileCandidates,\n  collectTrackedGitFileCandidates,\n  detectLifecycleDependencyCycles,\n  detectLifecycleParentCycles,\n  escapeRegExp,\n  extractItemIds,\n  findLifecycleDependencyCycleComponents,\n  isMetadataFieldMissing,\n  listFilesRecursive,\n  resolveDependencyCycleSeverity,\n  resolveParentCycleSeverity,\n  resolveFileScanMode,\n  resolveLifecycleDependencyCycleSamplePath,\n  resolveRequestedChecks,\n  resolveValidateMetadataProfile,\n  resolveWorkspaceRoot,\n  sharedDirectoryPrefixLength,\n  summarizeOrphanedPathRows,\n  summarizeDuplicateIssueCodes,\n  toMeaningfulString,\n};\n\ntype LoadedValidateSettings = Awaited<ReturnType<typeof readSettings>>;\n\ninterface ValidateCheckExecutionState {\n  checks: ValidateCheck[];\n  warnings: string[];\n  closeReasonBackfillRows: CloseReasonBackfillRow[];\n  estimateBackfillRows: EstimateBackfillRow[];\n  resolutionBackfillRows: ResolutionBackfillRow[];\n  terminalParentFixRows: TerminalParentFixRow[];\n  staleLinkPruneRows: StaleLinkPruneRow[];\n}\n\nfunction recordValidateCheck(\n  state: ValidateCheckExecutionState,\n  built: { check: ValidateCheck; warnings: string[] },\n  fixHintsEnabled: boolean,\n): void {\n  if (fixHintsEnabled) {\n    attachValidateFixHints(built.check, built.warnings);\n  }\n  state.checks.push(built.check);\n  state.warnings.push(...built.warnings);\n}\n\nasync function executeRequestedValidateChecks(params: {\n  requestedChecks: Set<ValidateCheckName>;\n  options: ValidateCommandOptions;\n  global: GlobalOptions;\n  pmRoot: string;\n  workspaceRoot: string;\n  settings: LoadedValidateSettings;\n  items: ItemWithBody[];\n  statusRegistry: RuntimeStatusRegistry;\n  metadataPolicy: ValidateMetadataPolicy;\n  lifecyclePatternPolicy: LifecyclePatternPolicy;\n  dependencyCycleSeverity: ValidateDependencyCycleSeverity;\n  parentCycleSeverity: ValidateDependencyCycleSeverity;\n  fileScanMode: ValidateFileScanMode;\n  initialWarnings: string[];\n}): Promise<ValidateCheckExecutionState> {\n  const state: ValidateCheckExecutionState = {\n    checks: [],\n    warnings: [...params.initialWarnings],\n    closeReasonBackfillRows: [],\n    estimateBackfillRows: [],\n    resolutionBackfillRows: [],\n    terminalParentFixRows: [],\n    staleLinkPruneRows: [],\n  };\n  const fixHintsEnabled = params.options.fixHints === true;\n  const fullDiagnostics =\n    params.options.verboseDiagnostics === true || params.options.allAffectedIds === true || params.global.json === true;\n  if (params.requestedChecks.has(\"metadata\")) {\n    const built = buildMetadataCheck(params.items, params.metadataPolicy, params.statusRegistry, fullDiagnostics);\n    state.closeReasonBackfillRows = built.closeReasonBackfillRows;\n    state.estimateBackfillRows = built.estimateBackfillRows;\n    recordValidateCheck(state, built, fixHintsEnabled);\n  }\n  if (params.requestedChecks.has(\"resolution\")) {\n    const built = buildResolutionCheck(params.items, params.statusRegistry, fullDiagnostics);\n    state.resolutionBackfillRows = built.resolutionBackfillRows;\n    recordValidateCheck(state, built, fixHintsEnabled);\n  }\n  if (params.requestedChecks.has(\"lifecycle\")) {\n    const built = buildLifecycleCheck(\n      params.items,\n      Boolean(params.options.checkStaleBlockers),\n      params.dependencyCycleSeverity,\n      params.parentCycleSeverity,\n      params.statusRegistry,\n      params.lifecyclePatternPolicy,\n      fullDiagnostics,\n      params.settings.id_prefix,\n    );\n    state.terminalParentFixRows = built.terminalParentFixRows;\n    recordValidateCheck(state, built, fixHintsEnabled);\n  }\n  if (params.requestedChecks.has(\"files\")) {\n    const built = await buildFilesCheck(\n      params.items,\n      params.workspaceRoot,\n      params.pmRoot,\n      params.fileScanMode,\n      Boolean(params.options.includePmInternals),\n      Boolean(params.options.verboseFileLists),\n    );\n    state.staleLinkPruneRows = built.staleLinkPruneRows;\n    recordValidateCheck(state, built, fixHintsEnabled);\n  }\n  if (params.requestedChecks.has(\"command_references\")) {\n    recordValidateCheck(\n      state,\n      buildCommandReferencesCheck(params.items, params.settings.id_prefix, fullDiagnostics),\n      fixHintsEnabled,\n    );\n  }\n  if (params.requestedChecks.has(\"history_drift\")) {\n    recordValidateCheck(state, await buildHistoryDriftCheck(params.pmRoot, params.items, fullDiagnostics), fixHintsEnabled);\n  }\n  if (params.requestedChecks.has(\"format_version\")) {\n    recordValidateCheck(state, buildFormatVersionCheck(params.items, fullDiagnostics), fixHintsEnabled);\n  }\n  return state;\n}\n\nfunction planValidateFixes(\n  options: ValidateCommandOptions,\n  state: ValidateCheckExecutionState,\n  settings: LoadedValidateSettings,\n): ValidateFixRecord[] {\n  const planned: ValidateFixRecord[] = [];\n  if (options.autoFix === true) {\n    planned.push(...planCloseReasonBackfillFixes(state.closeReasonBackfillRows));\n    planned.push(...planResolutionBackfillFixes(state.resolutionBackfillRows));\n    planned.push(...planEstimateBackfillFixes(state.estimateBackfillRows, settings.validation.estimate_defaults_by_type));\n    planned.push(...planTerminalParentFixes(state.terminalParentFixRows));\n  }\n  if (options.pruneMissing === true) {\n    planned.push(...planStaleLinkPruneFixes(state.staleLinkPruneRows));\n  }\n  return planned;\n}\n\n/* v8 ignore start -- validate fix-summary matrix is covered end-to-end; direct helper fallback branches are defensive */\nasync function buildValidateFixesSummary(\n  options: ValidateCommandOptions,\n  state: ValidateCheckExecutionState,\n  settings: LoadedValidateSettings,\n  grantedFixScopes: Set<ValidateFixScope>,\n  global: GlobalOptions,\n): Promise<ValidateFixesSummary | undefined> {\n  if (options.autoFix !== true && options.pruneMissing !== true) {\n    return undefined;\n  }\n  const planned = planValidateFixes(options, state, settings);\n  const { applicable, gated } = partitionFixesByGrant(planned, grantedFixScopes);\n  const dryRun = options.dryRun === true;\n  const appliedFixRows: Array<Record<string, unknown>> = [];\n  const failedFixRows: Array<Record<string, unknown>> = [];\n  if (!dryRun) {\n    const applied = await applyValidateFixes(applicable, global);\n    appliedFixRows.push(...applied.applied.map(toFixOutputRow));\n    failedFixRows.push(\n      ...applied.failed.map(({ fix, error }) => ({\n        ...toFixOutputRow(fix),\n        error: error instanceof Error ? error.message : String(error),\n      })),\n    );\n  }\n  return {\n    mode: dryRun ? \"dry_run\" : \"apply\",\n    auto_fix: options.autoFix === true,\n    prune_missing: options.pruneMissing === true,\n    granted_fix_scopes: [...grantedFixScopes].sort((left, right) => left.localeCompare(right)),\n    planned_count: planned.length,\n    applied_count: appliedFixRows.length,\n    gated_count: gated.length,\n    failed_count: failedFixRows.length,\n    planned_fixes: planned.map(toFixOutputRow),\n    applied_fixes: appliedFixRows,\n    gated_fixes: gated.map((fix) => ({\n      ...toFixOutputRow(fix),\n      gate_hint: `Withheld: re-run with --fix-scope ${fix.gate} to apply.`,\n    })),\n    failed_fixes: failedFixRows,\n  };\n}\n/* v8 ignore stop */\n\n/* c8 ignore start -- validate orchestration + fix-application matrices are covered by end-to-end command integration runs */\n/**\n * Implements run validate for the public runtime surface of this module.\n */\nexport async function runValidate(options: ValidateCommandOptions, global: GlobalOptions): Promise<ValidateResult> {\n  const fixesRequested = options.autoFix === true || options.pruneMissing === true;\n  if (options.dryRun === true && !fixesRequested) {\n    throw new PmCliError(\n      \"--dry-run requires --auto-fix or --prune-missing (there is nothing to preview otherwise).\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (options.fixScope !== undefined && options.fixScope.length > 0 && options.autoFix !== true) {\n    throw new PmCliError(\"--fix-scope requires --auto-fix.\", EXIT_CODE.USAGE);\n  }\n  // Resolved up-front so unknown --fix-scope values fail fast before any scan.\n  const grantedFixScopes = resolveGrantedFixScopes(options.fixScope);\n  const pmRoot = resolvePmRoot(process.cwd(), global.path);\n  if (!(await pathExists(getSettingsPath(pmRoot)))) {\n    throw new PmCliError(`Tracker is not initialized at ${pmRoot}. Run pm init first.`, EXIT_CODE.NOT_FOUND);\n  }\n\n  const settings = await readSettings(pmRoot);\n  const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);\n  const typeRegistry = resolveItemTypeRegistry(settings, getActiveExtensionRegistrations());\n  const itemReadWarnings: string[] = [];\n  const items = await listAllFrontMatterWithBody(\n    pmRoot,\n    settings.item_format,\n    typeRegistry.type_to_folder,\n    itemReadWarnings,\n    settings.schema,\n  );\n  const requestedChecks = resolveRequestedChecks(options);\n  const metadataProfileSource: \"default\" | \"settings\" | \"option\" =\n    typeof options.metadataProfile === \"string\" ? \"option\" : \"settings\";\n  const metadataProfile = resolveValidateMetadataProfile(\n    typeof options.metadataProfile === \"string\" ? options.metadataProfile : settings.validation.metadata_profile,\n  );\n  const metadataPolicy = resolveValidateMetadataPolicy(\n    metadataProfile,\n    metadataProfileSource,\n    settings.validation.metadata_required_fields,\n  );\n  const lifecyclePatternPolicy = resolveLifecyclePatternPolicy(settings);\n  const dependencyCycleSeverity = resolveDependencyCycleSeverity(options.dependencyCycleSeverity);\n  const parentCycleSeverity = resolveParentCycleSeverity(options.parentCycleSeverity);\n  const fileScanMode = resolveFileScanMode(options.scanMode);\n  const workspaceRoot = resolveWorkspaceRoot(pmRoot);\n  const state = await executeRequestedValidateChecks({\n    requestedChecks,\n    options,\n    global,\n    pmRoot,\n    workspaceRoot,\n    settings,\n    items,\n    statusRegistry,\n    metadataPolicy,\n    lifecyclePatternPolicy,\n    dependencyCycleSeverity,\n    parentCycleSeverity,\n    fileScanMode,\n    initialWarnings: [...new Set(itemReadWarnings)],\n  });\n\n  // Remediation phase (pm-c3sz / pm-8jss / pm-0v2m). Plans are derived from\n  // the findings of THIS run; checks above always report the pre-fix state.\n  // Safe field backfills apply by default under --auto-fix; gated lifecycle\n  // fixes are planned but withheld unless --fix-scope lifecycle grants them;\n  // --dry-run previews without mutating; failures never abort the run.\n  const fixes = fixesRequested\n    ? await buildValidateFixesSummary(options, state, settings, grantedFixScopes, global)\n    : undefined;\n\n  const normalizedWarnings = [...new Set(state.warnings)].sort((left, right) => left.localeCompare(right));\n  const hasErrors = state.checks.some((check) => check.status === \"error\");\n  return {\n    ok: !hasErrors,\n    has_warnings: normalizedWarnings.length > 0,\n    checks: state.checks,\n    warnings: normalizedWarnings,\n    ...(fixes !== undefined ? { fixes } : {}),\n    generated_at: nowIso(),\n  };\n}\n/* c8 ignore stop */\n","/**\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\";\nimport { resolveEstimateDefaultMinutes } from \"./estimate-defaults.js\";\n\n/**\n * Restricts validate fix check values accepted by command, SDK, and storage contracts.\n */\nexport type ValidateFixCheck = \"metadata\" | \"resolution\" | \"lifecycle\" | \"files\";\n\n/**\n * Restricts validate fix kind values accepted by command, SDK, and storage contracts.\n */\nexport type ValidateFixKind =\n  | \"set_resolution\"\n  | \"set_close_reason\"\n  | \"set_estimate\"\n  | \"reparent\"\n  | \"unset_parent\"\n  | \"prune_file_link\"\n  | \"prune_doc_link\";\n\n/**\n * Restricts validate fix scope values accepted by command, SDK, and storage contracts.\n */\nexport type ValidateFixScope = \"metadata\" | \"resolution\" | \"estimates\" | \"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/**\n * Scopes accepted by `--fix-scope`. `estimates` and `lifecycle` are opt-in:\n * estimate backfills are heuristic per-type guesses (not derived facts) and\n * lifecycle changes are structural, so neither is granted by default.\n */\nexport const SUPPORTED_FIX_SCOPES: readonly ValidateFixScope[] = [\"metadata\", \"resolution\", \"estimates\", \"lifecycle\"];\n\n/**\n * Documents the validate fix record payload exchanged by command, SDK, and package integrations.\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\n/**\n * Documents the resolution backfill row payload exchanged by command, SDK, and package integrations.\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\n/**\n * Documents the close reason backfill row payload exchanged by command, SDK, and package integrations.\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\n/**\n * Documents the estimate backfill row payload exchanged by command, SDK, and package integrations.\n */\nexport interface EstimateBackfillRow {\n  id: string;\n  /** Item type, used to resolve the per-type default estimate. */\n  type?: string;\n}\n\n/**\n * Plan estimate backfills for items flagged by the metadata check as missing\n * `estimated_minutes` (GH-212). The value is a config-driven per-type default\n * (overrides > built-in map > fallback), never a derived fact — so these fixes\n * carry `gate: \"estimates\"`, an opt-in scope that is NOT granted by default.\n * `overrides` is the already-normalized `validation.estimate_defaults_by_type`\n * map; pass `undefined`/`{}` to use the built-in defaults.\n */\nexport function planEstimateBackfillFixes(\n  rows: readonly EstimateBackfillRow[],\n  overrides?: Readonly<Record<string, number>>,\n): ValidateFixRecord[] {\n  return rows.map((row) => {\n    const minutes = resolveEstimateDefaultMinutes(row.type, overrides);\n    return {\n      item_id: row.id,\n      check: \"metadata\" as const,\n      field: \"estimated_minutes\",\n      kind: \"set_estimate\" as const,\n      value: String(minutes),\n      command: `pm update ${row.id} --estimate ${minutes}`,\n      gate: \"estimates\" as const,\n    };\n  });\n}\n\n/**\n * Documents the terminal parent fix row payload exchanged by command, SDK, and package integrations.\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\n/**\n * Documents the stale link prune row payload exchanged by command, SDK, and package integrations.\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","/**\n * Logical issue-code governance primitives (GH-235).\n *\n * Trackers frequently adopt a title convention that embeds a logical issue\n * code at the START of the title, e.g. `ISSUE-004: ...`, `BUG-12 ...`,\n * `TASK-7 — ...`, `ADR-001`, `RFC-9`. When two distinct items share the same\n * logical code, auditability and duplicate detection both suffer: a human or\n * agent searching for \"ISSUE-004\" can no longer assume a single canonical item.\n *\n * These primitives detect that condition. They are pure: no IO, no heavy\n * runtime dependencies. Callers pass plain structural item shapes so the logic\n * stays trivially unit-testable.\n */\n\n/** Minimal structural shape needed to detect duplicate issue codes. */\nexport interface IssueCodeItem {\n  id: string;\n  title?: string | null;\n  /**\n   * The id of this item's parent, when it is a child in a hierarchy. Used to\n   * suppress false positives where a child intentionally reuses its parent's\n   * code prefix (the `PARENT` + `PARENT-T0n` task-breakdown convention, GH-275):\n   * when an item's parent is another item in the same code group, the shared\n   * code is by design and the child does not constitute a collision.\n   */\n  parent?: string | null;\n  /**\n   * The id of the canonical item this one was closed as a duplicate of, when\n   * set. A closed-as-duplicate item has already been adjudicated, so it is\n   * excluded from collision detection entirely (GH-278) — re-flagging a\n   * resolved duplicate is permanent noise that erodes trust in `validate`.\n   */\n  duplicate_of?: string | null;\n}\n\n/** A logical issue code shared by two or more items. */\nexport interface DuplicateIssueCode {\n  /** The canonical (normalized, upper-case) issue code, e.g. `ISSUE-004`. */\n  code: string;\n  /** How many items carry this code. */\n  count: number;\n  /** The ids of the items carrying this code, sorted ascending. */\n  ids: string[];\n  /** The titles of the items carrying this code, in the same order as `ids`. */\n  titles: string[];\n}\n\n/**\n * Match a conventional leading logical issue code: an upper-case alphanumeric\n * prefix (starting with a letter) followed by a `-` separator and a number, at\n * the very start of the title (after optional leading whitespace).\n *\n * Examples that match: `ISSUE-004`, `BUG-12`, `TASK-7`, `ADR-001`, `RFC-9`,\n * `GH-235`, `PM2-14`. The trailing `\\b` requires the digit run to end at a word\n * boundary, so `ISSUE-004-extra` extracts `ISSUE-004` while `ISSUE-004foo`\n * (digit immediately followed by a letter — no boundary) does not match.\n */\nconst ISSUE_CODE_PATTERN = /^([A-Z][A-Z0-9]*-\\d+)\\b/;\n\n/**\n * Extract the leading logical issue code from a title, or `null` when the title\n * does not begin with one. The title is trimmed and upper-cased before matching\n * so case differences (`issue-004` vs `ISSUE-004`) collapse to one logical\n * code; the returned code is therefore always normalized upper-case.\n *\n * Accepts unknown-ish input defensively (exported helper SDK consumers may call\n * from untyped JS): a non-string or empty title resolves to `null`.\n */\nexport function extractIssueCode(title: string | null | undefined): string | null {\n  if (typeof title !== \"string\") {\n    return null;\n  }\n  const normalized = title.trim().toUpperCase();\n  if (normalized.length === 0) {\n    return null;\n  }\n  const match = ISSUE_CODE_PATTERN.exec(normalized);\n  return match ? match[1] : null;\n}\n\n/** Test whether a value is a usable (non-empty after trim) item-id reference. */\nfunction isNonEmptyIdReference(value: string | null | undefined): value is string {\n  return typeof value === \"string\" && value.trim().length > 0;\n}\n\n/**\n * Find logical issue codes used by 2+ items. Any item whose title begins with a\n * conventional issue code contributes; codes used by a single item are not\n * reported. Status is intentionally NOT considered for genuine collisions — a\n * closed item and an open item sharing a code still collide for audit purposes.\n *\n * Two adjudicated/by-design cases are excluded so `validate` output stays\n * trustworthy in real trackers (GH-275, GH-278):\n *\n * - **Closed-as-duplicate** (GH-278): an item with a non-empty `duplicate_of`\n *   has already been resolved against its canonical keeper, so it is dropped\n *   before grouping and never contributes to a collision.\n * - **Parent/child prefix sharing** (GH-275): the `PARENT` + `PARENT-T0n`\n *   task-breakdown convention makes a child's title share the parent's code.\n *   Within each code group, any item whose `parent` is another item in the same\n *   group is dropped, because the shared code is intentional hierarchy, not a\n *   collision. A genuine duplicate (two items with the same code, neither the\n *   parent of the other) still surfaces after this filtering.\n *\n * Results are deterministic: duplicate groups are sorted by code, and the\n * `ids`/`titles` within each group are sorted by id. The first-seen title for a\n * given (id) is used; duplicate ids (should not occur for a valid corpus) are\n * de-duplicated so an item never inflates its own code's count.\n */\nexport function findDuplicateIssueCodes(items: readonly IssueCodeItem[]): DuplicateIssueCode[] {\n  const byCode = new Map<string, Array<{ id: string; title: string; parent: string | null }>>();\n  for (const item of items) {\n    // A non-string title can never carry a code, so skip it before extraction;\n    // this also guarantees every stored title below is a real string.\n    if (typeof item.title !== \"string\") {\n      continue;\n    }\n    // GH-278: an item closed as a duplicate of another is already adjudicated.\n    if (isNonEmptyIdReference(item.duplicate_of)) {\n      continue;\n    }\n    const code = extractIssueCode(item.title);\n    if (code === null) {\n      continue;\n    }\n    let entries = byCode.get(code);\n    if (!entries) {\n      entries = [];\n      byCode.set(code, entries);\n    }\n    if (!entries.some((entry) => entry.id === item.id)) {\n      entries.push({ id: item.id, title: item.title, parent: isNonEmptyIdReference(item.parent) ? item.parent.trim() : null });\n    }\n  }\n\n  const duplicates: DuplicateIssueCode[] = [];\n  for (const [code, entries] of byCode) {\n    if (entries.length < 2) {\n      continue;\n    }\n    // GH-275: drop children whose parent is another item carrying the same code\n    // (intentional `PARENT` + `PARENT-T0n` breakdown), then re-check the group.\n    // The parent reference is resolved only against the same-code group on\n    // purpose: a child is by-design noise solely when its parent shares the code\n    // (resolving against the full corpus would suppress genuinely colliding\n    // siblings whose parent merely exists elsewhere). Comparison is\n    // case-insensitive so a `parent` reference recorded in a different case than\n    // the canonical id (e.g. an upper-case `id_prefix`) still matches.\n    const idsInGroup = new Set(entries.map((entry) => entry.id.toLowerCase()));\n    const collisionEntries = entries.filter(\n      (entry) => entry.parent === null || !idsInGroup.has(entry.parent.toLowerCase()),\n    );\n    if (collisionEntries.length < 2) {\n      continue;\n    }\n    const sorted = [...collisionEntries].sort((left, right) => left.id.localeCompare(right.id));\n    duplicates.push({\n      code,\n      count: sorted.length,\n      ids: sorted.map((entry) => entry.id),\n      titles: sorted.map((entry) => entry.title),\n    });\n  }\n  return duplicates.sort((left, right) => left.code.localeCompare(right.code));\n}\n","/**\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\n/** One missing required metadata field observed on an item of a specific type. */\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","/**\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\n/** Classification labels for linked paths that no longer exist on disk. */\nexport type StaleLinkedPathClassification = \"moved\" | \"deleted\";\n\n/**\n * Documents the classified stale linked path payload exchanged by command, SDK, and package integrations.\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","/**\n * Owner attribution for stale linked paths reported by `pm validate --check-files`.\n *\n * The files check collects, per item, the linked paths (from the item's `files`\n * and `docs` link lists) that no longer resolve on disk. By default those are\n * surfaced as bare path strings + `path:classification` rows, which forces a\n * reverse lookup to discover which item owns each stale link. This module turns\n * the already-collected stale-link rows into owner-attributed, path-grouped rows\n * so an agent can perform evidence-based cleanup (relink/prune) without that\n * reverse lookup.\n *\n * Pure module (GH-210): no filesystem access and no heavy imports — callers pass\n * the already-collected stale-link rows plus a metadata `lookup` closure.\n */\n\n/** Classification assigned to a stale linked path during files validation. */\nexport type StaleLinkClassification = \"moved\" | \"deleted\";\n\n/**\n * Documents the stale link owner input payload exchanged by command, SDK, and package integrations.\n */\nexport interface StaleLinkOwnerInput {\n  item_id: string;\n  /** Normalized workspace-relative path that no longer resolves. */\n  path: string;\n  /** Which link list of the owning item the path lives in. */\n  link_kind: \"files\" | \"docs\";\n  classification: StaleLinkClassification;\n}\n\n/**\n * Documents the missing linked path owner payload exchanged by command, SDK, and package integrations.\n */\nexport interface MissingLinkedPathOwner {\n  id: string;\n  /** Owning item type, `\"Unknown\"` if metadata is absent. */\n  type: string;\n  /** Owning item title, `\"\"` if absent. */\n  title: string;\n  /** Owning item status, `\"\"` if absent. */\n  status: string;\n  /** The link list the path lives in (= the input `link_kind`). */\n  field: \"files\" | \"docs\";\n}\n\n/**\n * Documents the missing linked path row payload exchanged by command, SDK, and package integrations.\n */\nexport interface MissingLinkedPathRow {\n  path: string;\n  classification: StaleLinkClassification;\n  items: MissingLinkedPathOwner[];\n}\n\n/**\n * Documents the owner item metadata payload exchanged by command, SDK, and package integrations.\n */\nexport interface OwnerItemMetadata {\n  type?: string;\n  title?: string;\n  status?: string;\n}\n\ninterface PathBucket {\n  classification: StaleLinkClassification;\n  /** Keyed by `<id> <field>` so identical owners de-duplicate. */\n  owners: Map<string, StaleLinkOwnerInput>;\n}\n\n/**\n * `moved` wins over `deleted` when a single path's rows disagree on\n * classification: `moved` means a relink candidate exists, which is the safer,\n * more-actionable signal (relink instead of risk pruning a still-reachable\n * link). In practice all rows for one path share a classification; this is a\n * deterministic tie-break for the degenerate case.\n */\nfunction preferClassification(\n  current: StaleLinkClassification,\n  next: StaleLinkClassification,\n): StaleLinkClassification {\n  return current === \"moved\" || next === \"moved\" ? \"moved\" : \"deleted\";\n}\n\nfunction ownerKey(input: StaleLinkOwnerInput): string {\n  return `${input.item_id} ${input.link_kind}`;\n}\n\n/**\n * Group stale-link owner inputs by linked path and attach owning-item metadata.\n *\n * - Paths sorted ascending (`localeCompare`); items within a path sorted by `id`\n *   then `field`.\n * - De-duplicates identical `(id, field)` owners for the same path.\n * - `classification` per path follows {@link preferClassification} (moved wins).\n * - Missing metadata falls back: type `\"Unknown\"`, title `\"\"`, status `\"\"`.\n */\nexport function buildMissingLinkedPathRows(\n  rows: readonly StaleLinkOwnerInput[],\n  lookup: (itemId: string) => OwnerItemMetadata | undefined,\n): MissingLinkedPathRow[] {\n  const buckets = new Map<string, PathBucket>();\n  for (const row of rows) {\n    const bucket = buckets.get(row.path);\n    if (bucket) {\n      bucket.classification = preferClassification(bucket.classification, row.classification);\n      bucket.owners.set(ownerKey(row), row);\n    } else {\n      buckets.set(row.path, {\n        classification: row.classification,\n        owners: new Map([[ownerKey(row), row]]),\n      });\n    }\n  }\n\n  return [...buckets.entries()]\n    .sort(([left], [right]) => left.localeCompare(right))\n    .map(([path, bucket]) => ({\n      path,\n      classification: bucket.classification,\n      items: [...bucket.owners.values()]\n        .map((owner): MissingLinkedPathOwner => {\n          const metadata = lookup(owner.item_id);\n          return {\n            id: owner.item_id,\n            type: metadata?.type ?? \"Unknown\",\n            title: metadata?.title ?? \"\",\n            status: metadata?.status ?? \"\",\n            field: owner.link_kind,\n          };\n        })\n        .sort((leftOwner, rightOwner) => {\n          const byId = leftOwner.id.localeCompare(rightOwner.id);\n          return byId !== 0 ? byId : leftOwner.field.localeCompare(rightOwner.field);\n        }),\n    }));\n}\n\nfunction escapeTitle(title: string): string {\n  return title.replace(/\\\\/g, \"\\\\\\\\\").replace(/\"/g, '\\\\\"');\n}\n\n/**\n * Token-efficient one-line-per-owner serialization for the files-check details\n * (compact text counterpart to the full {@link MissingLinkedPathRow} objects).\n * Format per owner row:\n *   `<path>:<classification> owner=<id> status=<status> field=<field> title=\"<title>\"`\n * Title is double-quoted with backslash/quote escaping; empty status/title still\n * render (`status=` and `title=\"\"`). Order follows\n * {@link buildMissingLinkedPathRows} output order.\n */\nexport function summarizeMissingLinkedPathRows(rows: readonly MissingLinkedPathRow[]): string[] {\n  const lines: string[] = [];\n  for (const row of rows) {\n    for (const owner of row.items) {\n      lines.push(\n        `${row.path}:${row.classification} owner=${owner.id} status=${owner.status} field=${owner.field} title=\"${escapeTitle(owner.title)}\"`,\n      );\n    }\n  }\n  return lines;\n}\n"],"names":["path","path"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAKA,OAAO,QAAQ;AACf,SAAS,oBAAoB;AAE7B,SAAS,gBAAgB;AACzB,OAAO,UAAU;AACjB,SAAS,iBAAiB;;;ACmCnB,IAAM,6BAA0D,CAAC,YAAY,YAAY;AAOzF,IAAM,uBAAoD,CAAC,YAAY,cAAc,aAAa,WAAW;AAgC7G,IAAM,oCAAoC;AAEjD,SAAS,gBAAgB,OAAa;AACpC,SAAO,IAAI,MAAM,WAAW,MAAM,MAAM,EAAE,WAAW,KAAK,KAAK,CAAC;AAClE;AAEA,SAAS,kBAAkB,OAAyB;AAClD,QAAM,UAAU,OAAO,KAAI;AAC3B,SAAO,YAAY,UAAa,QAAQ,SAAS,IAAI,UAAU;AACjE;AAoBM,SAAU,4BAA4B,MAAsC;AAChF,QAAM,QAA6B,CAAA;AACnC,aAAW,OAAO,MAAM;AACtB,QAAI,CAAC,IAAI,eAAe,SAAS,YAAY,GAAG;AAC9C;IACF;AACA,UAAM,QAAQ,kBAAkB,IAAI,YAAY,KAAK;AACrD,UAAM,KAAK;MACT,SAAS,IAAI;MACb,OAAO;MACP,OAAO;MACP,MAAM;MACN;MACA,SAAS,aAAa,IAAI,EAAE,iBAAiB,gBAAgB,KAAK,CAAC;MACnE,MAAM;KACP;EACH;AACA,SAAO;AACT;AAiBM,SAAU,6BAA6B,MAAuC;AAClF,QAAM,QAA6B,CAAA;AACnC,aAAW,OAAO,MAAM;AACtB,UAAM,QAAQ,kBAAkB,IAAI,UAAU;AAC9C,QAAI,UAAU,QAAW;AACvB;IACF;AACA,UAAM,KAAK;MACT,SAAS,IAAI;MACb,OAAO;MACP,OAAO;MACP,MAAM;MACN;MACA,SAAS,aAAa,IAAI,EAAE,mBAAmB,gBAAgB,KAAK,CAAC;MACrE,MAAM;KACP;EACH;AACA,SAAO;AACT;AAmBM,SAAU,0BACd,MACA,WAA4C;AAE5C,SAAO,KAAK,IAAI,CAAC,QAAO;AACtB,UAAM,UAAU,8BAA8B,IAAI,MAAM,SAAS;AACjE,WAAO;MACL,SAAS,IAAI;MACb,OAAO;MACP,OAAO;MACP,MAAM;MACN,OAAO,OAAO,OAAO;MACrB,SAAS,aAAa,IAAI,EAAE,eAAe,OAAO;MAClD,MAAM;;EAEV,CAAC;AACH;AAuBM,SAAU,wBAAwB,MAAqC;AAC3E,SAAO,KAAK,IAAI,CAAC,QAAO;AACtB,QAAI,IAAI,mBAAmB,UAAa,IAAI,uBAAuB,MAAM;AACvE,aAAO;QACL,SAAS,IAAI;QACb,OAAO;QACP,OAAO;QACP,MAAM;QACN,WAAW,IAAI;QACf,SAAS,aAAa,IAAI,EAAE,aAAa,IAAI,cAAc;QAC3D,MAAM;;IAEV;AACA,WAAO;MACL,SAAS,IAAI;MACb,OAAO;MACP,OAAO;MACP,MAAM;MACN,SAAS,aAAa,IAAI,EAAE;MAC5B,MAAM;;EAEV,CAAC;AACH;AAmBM,SAAU,wBAAwB,MAAkC;AACxE,QAAM,QAA6B,CAAA;AACnC,aAAW,OAAO,MAAM;AACtB,QAAI,IAAI,mBAAmB,WAAW;AACpC;IACF;AACA,UAAM,OAAO,IAAI,cAAc,UAAU,UAAU;AACnD,UAAM,KAAK;MACT,SAAS,IAAI;MACb,OAAO;MACP,OAAO,IAAI;MACX,MAAM,IAAI,cAAc,UAAU,oBAAoB;MACtD,MAAM,IAAI;MACV,SAAS,MAAM,IAAI,IAAI,IAAI,OAAO,aAAa,gBAAgB,IAAI,IAAI,CAAC;KACzE;EACH;AACA,SAAO;AACT;AAQM,SAAU,wBAAwB,WAAwC;AAC9E,QAAM,UAAU,aAAa,CAAA,GAC1B,QAAQ,CAAC,QAAQ,IAAI,MAAM,GAAG,CAAC,EAC/B,IAAI,CAAC,QAAQ,IAAI,KAAI,CAAE,EACvB,OAAO,CAAC,QAAQ,IAAI,SAAS,CAAC;AACjC,MAAI,OAAO,WAAW,GAAG;AACvB,QAAI,cAAc,UAAa,UAAU,SAAS,GAAG;AACnD,YAAM,IAAI,WACR,2DAA2D,qBAAqB,KAAK,IAAI,CAAC,KAC1F,UAAU,KAAK;IAEnB;AACA,WAAO,IAAI,IAAI,0BAA0B;EAC3C;AACA,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,OAAO,QAAQ;AACxB,UAAM,aAAa,IAAI,YAAW,EAAG,WAAW,KAAK,GAAG;AACxD,QAAK,qBAA2C,SAAS,UAAU,GAAG;AACpE,cAAQ,IAAI,UAA8B;AAC1C;IACF;AACA,UAAM,IAAI,WACR,8BAA8B,GAAG,wBAAwB,qBAAqB,KAAK,IAAI,CAAC,KACxF,UAAU,KAAK;EAEnB;AACA,SAAO;AACT;AASM,SAAU,sBACd,OACA,SAAsC;AAEtC,QAAM,aAAkC,CAAA;AACxC,QAAM,QAA6B,CAAA;AACnC,aAAW,OAAO,OAAO;AACvB,QAAI,IAAI,SAAS,UAAa,CAAC,QAAQ,IAAI,IAAI,IAAI,GAAG;AACpD,YAAM,KAAK,GAAG;IAChB,OAAO;AACL,iBAAW,KAAK,GAAG;IACrB;EACF;AACA,SAAO,EAAE,YAAY,MAAK;AAC5B;AAGM,SAAU,eAAe,KAAsB;AACnD,SAAO;IACL,SAAS,IAAI;IACb,OAAO,IAAI;IACX,OAAO,IAAI;IACX,SAAS,IAAI;IACb,GAAI,IAAI,SAAS,SAAY,EAAE,MAAM,IAAI,KAAI,IAAK,CAAA;;AAEtD;;;ACtSA,IAAM,qBAAqB;AAWrB,SAAU,iBAAiB,OAAgC;AAC/D,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO;EACT;AACA,QAAM,aAAa,MAAM,KAAI,EAAG,YAAW;AAC3C,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;EACT;AACA,QAAM,QAAQ,mBAAmB,KAAK,UAAU;AAChD,SAAO,QAAQ,MAAM,CAAC,IAAI;AAC5B;AAGA,SAAS,sBAAsB,OAAgC;AAC7D,SAAO,OAAO,UAAU,YAAY,MAAM,KAAI,EAAG,SAAS;AAC5D;AA0BM,SAAU,wBAAwB,OAA+B;AACrE,QAAM,SAAS,oBAAI,IAAG;AACtB,aAAW,QAAQ,OAAO;AAGxB,QAAI,OAAO,KAAK,UAAU,UAAU;AAClC;IACF;AAEA,QAAI,sBAAsB,KAAK,YAAY,GAAG;AAC5C;IACF;AACA,UAAM,OAAO,iBAAiB,KAAK,KAAK;AACxC,QAAI,SAAS,MAAM;AACjB;IACF;AACA,QAAI,UAAU,OAAO,IAAI,IAAI;AAC7B,QAAI,CAAC,SAAS;AACZ,gBAAU,CAAA;AACV,aAAO,IAAI,MAAM,OAAO;IAC1B;AACA,QAAI,CAAC,QAAQ,KAAK,CAAC,UAAU,MAAM,OAAO,KAAK,EAAE,GAAG;AAClD,cAAQ,KAAK,EAAE,IAAI,KAAK,IAAI,OAAO,KAAK,OAAO,QAAQ,sBAAsB,KAAK,MAAM,IAAI,KAAK,OAAO,KAAI,IAAK,KAAI,CAAE;IACzH;EACF;AAEA,QAAM,aAAmC,CAAA;AACzC,aAAW,CAAC,MAAM,OAAO,KAAK,QAAQ;AACpC,QAAI,QAAQ,SAAS,GAAG;AACtB;IACF;AASA,UAAM,aAAa,IAAI,IAAI,QAAQ,IAAI,CAAC,UAAU,MAAM,GAAG,YAAW,CAAE,CAAC;AACzE,UAAM,mBAAmB,QAAQ,OAC/B,CAAC,UAAU,MAAM,WAAW,QAAQ,CAAC,WAAW,IAAI,MAAM,OAAO,YAAW,CAAE,CAAC;AAEjF,QAAI,iBAAiB,SAAS,GAAG;AAC/B;IACF;AACA,UAAM,SAAS,CAAC,GAAG,gBAAgB,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AAC1F,eAAW,KAAK;MACd;MACA,OAAO,OAAO;MACd,KAAK,OAAO,IAAI,CAAC,UAAU,MAAM,EAAE;MACnC,QAAQ,OAAO,IAAI,CAAC,UAAU,MAAM,KAAK;KAC1C;EACH;AACA,SAAO,WAAW,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC;AAC7E;;;AC7IM,SAAU,yBACd,aAA6C;AAE7C,QAAM,eAAe,oBAAI,IAAG;AAC5B,aAAW,cAAc,aAAa;AACpC,QAAI,cAAc,aAAa,IAAI,WAAW,SAAS;AACvD,QAAI,CAAC,aAAa;AAChB,oBAAc,oBAAI,IAAG;AACrB,mBAAa,IAAI,WAAW,WAAW,WAAW;IACpD;AACA,gBAAY,IAAI,WAAW,QAAQ,YAAY,IAAI,WAAW,KAAK,KAAK,KAAK,CAAC;EAChF;AAEA,QAAM,SAAiD,CAAA;AACvD,aAAW,QAAQ,CAAC,GAAG,aAAa,KAAI,CAAE,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC,GAAG;AAC5F,UAAM,cAAc,aAAa,IAAI,IAAI;AACzC,UAAM,SAAiC,CAAA;AACvC,eAAW,SAAS,CAAC,GAAG,YAAY,KAAI,CAAE,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC,GAAG;AAC5F,aAAO,KAAK,IAAI,YAAY,IAAI,KAAK;IACvC;AACA,WAAO,IAAI,IAAI;EACjB;AACA,SAAO;AACT;;;ACbO,IAAM,qCAAqC;AAElD,SAAS,WAAW,cAAoB;AACtC,QAAM,YAAY,KAAK,IAAI,aAAa,YAAY,GAAG,GAAG,aAAa,YAAY,IAAI,CAAC;AACxF,SAAO,cAAc,KAAK,eAAe,aAAa,MAAM,YAAY,CAAC;AAC3E;AASM,SAAU,yBACd,YACA,gBACA,iBAAyB,oCAAkC;AAE3D,QAAM,QAAQ,OAAO,SAAS,cAAc,KAAK,kBAAkB,IAAI,KAAK,MAAM,cAAc,IAAI;AACpG,QAAM,uBAAuB,oBAAI,IAAG;AACpC,aAAW,aAAa,gBAAgB;AACtC,UAAM,WAAW,WAAW,SAAS;AACrC,QAAI,SAAS,WAAW,GAAG;AACzB;IACF;AACA,UAAM,SAAS,qBAAqB,IAAI,QAAQ;AAChD,QAAI,QAAQ;AACV,aAAO,KAAK,SAAS;IACvB,OAAO;AACL,2BAAqB,IAAI,UAAU,CAAC,SAAS,CAAC;IAChD;EACF;AAEA,SAAO,WAAW,IAAI,CAAC,cAAa;AAClC,UAAM,WAAW,qBAAqB,IAAI,WAAW,SAAS,CAAC,KAAK,CAAA,GACjE,OAAO,CAAC,cAAc,cAAc,SAAS,EAC7C,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AAClD,QAAI,QAAQ,WAAW,GAAG;AACxB,aAAO;QACL,MAAM;QACN,gBAAgB;QAChB,YAAY,CAAA;QACZ,sBAAsB;;IAE1B;AACA,WAAO;MACL,MAAM;MACN,gBAAgB;MAChB,YAAY,QAAQ,MAAM,GAAG,KAAK;MAClC,sBAAsB,QAAQ,SAAS;;EAE3C,CAAC;AACH;AAOM,SAAU,wCAAwC,YAAgD;AACtG,SAAO,WAAW,IAAI,CAAC,UACrB,MAAM,mBAAmB,UAAU,GAAG,MAAM,IAAI,UAAU,MAAM,WAAW,CAAC,CAAC,KAAK,GAAG,MAAM,IAAI,UAAU;AAE7G;;;ACrBA,SAAS,qBACP,SACA,MAA6B;AAE7B,SAAO,YAAY,WAAW,SAAS,UAAU,UAAU;AAC7D;AAEA,SAAS,SAAS,OAA0B;AAC1C,SAAO,GAAG,MAAM,OAAO,IAAI,MAAM,SAAS;AAC5C;AAWM,SAAU,2BACd,MACA,QAAyD;AAEzD,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,OAAO,MAAM;AACtB,UAAM,SAAS,QAAQ,IAAI,IAAI,IAAI;AACnC,QAAI,QAAQ;AACV,aAAO,iBAAiB,qBAAqB,OAAO,gBAAgB,IAAI,cAAc;AACtF,aAAO,OAAO,IAAI,SAAS,GAAG,GAAG,GAAG;IACtC,OAAO;AACL,cAAQ,IAAI,IAAI,MAAM;QACpB,gBAAgB,IAAI;QACpB,QAAQ,oBAAI,IAAI,CAAC,CAAC,SAAS,GAAG,GAAG,GAAG,CAAC,CAAC;OACvC;IACH;EACF;AAEA,SAAO,CAAC,GAAG,QAAQ,QAAO,CAAE,EACzB,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MAAM,KAAK,cAAc,KAAK,CAAC,EACnD,IAAI,CAAC,CAACA,OAAM,MAAM,OAAO;IACxB,MAAAA;IACA,gBAAgB,OAAO;IACvB,OAAO,CAAC,GAAG,OAAO,OAAO,OAAM,CAAE,EAC9B,IAAI,CAAC,UAAiC;AACrC,YAAM,WAAW,OAAO,MAAM,OAAO;AACrC,aAAO;QACL,IAAI,MAAM;QACV,MAAM,UAAU,QAAQ;QACxB,OAAO,UAAU,SAAS;QAC1B,QAAQ,UAAU,UAAU;QAC5B,OAAO,MAAM;;IAEjB,CAAC,EACA,KAAK,CAAC,WAAW,eAAc;AAC9B,YAAM,OAAO,UAAU,GAAG,cAAc,WAAW,EAAE;AACrD,aAAO,SAAS,IAAI,OAAO,UAAU,MAAM,cAAc,WAAW,KAAK;IAC3E,CAAC;IACH;AACN;AAEA,SAAS,YAAY,OAAa;AAChC,SAAO,MAAM,QAAQ,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAK;AACzD;AAWM,SAAU,+BAA+B,MAAqC;AAClF,QAAM,QAAkB,CAAA;AACxB,aAAW,OAAO,MAAM;AACtB,eAAW,SAAS,IAAI,OAAO;AAC7B,YAAM,KACJ,GAAG,IAAI,IAAI,IAAI,IAAI,cAAc,UAAU,MAAM,EAAE,WAAW,MAAM,MAAM,UAAU,MAAM,KAAK,WAAW,YAAY,MAAM,KAAK,CAAC,GAAG;IAEzI;EACF;AACA,SAAO;AACT;;;AL7EA,IAAM,wBAAwB,CAAC,OAAO,SAAS,MAAM;AACrD,IAAM,uBAAuB;EAC3B;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;AAEF,IAAM,uBAAuB,oBAAI,IAAI,CAAC,gBAAgB,QAAQ,WAAW,WAAW,QAAQ,UAAU,CAAC;AACvG,IAAM,wBAAwB,CAAC,cAAc,mBAAmB,eAAe;AAE/E,IAAM,2BAA2B,CAAC,WAAW,eAAe,oBAAoB;AAChF,IAAM,mCAAmC,CAAC,QAAQ,UAAU,QAAQ;AACpE,IAAM,4CAA4C,CAAC,OAAO,QAAQ,OAAO;AAGzE,IAAM,gCAAgC,CAAC,UAAU,uBAAuB,qBAAqB,cAAc;AAC3G,IAAM,kCAAkC;EACtC,GAAG;EACH;EACA;EACA;EACA;EACA;;AAGF,IAAM,qCAA+E,MAAM,KACzF,IAAI,IAAmC,+BAA+B,CAAC;AAEzE,IAAM,kCAAiF;EACrF,QAAQ;EACR,qBAAqB;EACrB,uBAAuB;EACvB,mBAAmB;EACnB,qBAAqB;EACrB,UAAU;EACV,cAAc;EACd,gBAAgB;EAChB,UAAU;EACV,MAAM;EACN,YAAY;EACZ,QAAQ;EACR,SAAS;;AAEX,IAAM,kCAAiF;EACrF,QAAQ;EACR,qBAAqB;EACrB,mBAAmB;EACnB,cAAc;EACd,UAAU;EACV,MAAM;EACN,YAAY;EACZ,QAAQ;EACR,SAAS;;AAEX,IAAM,8BAA6E;EACjF,QAAQ;EACR,qBAAqB;EACrB,mBAAmB;EACnB,cAAc;EACd,UAAU;EACV,MAAM;EACN,YAAY;EACZ,QAAQ;EACR,SAAS;;AAEX,IAAM,iCAAgF;EACpF,QAAQ;EACR,qBAAqB;EACrB,mBAAmB;EACnB,cAAc;EACd,UAAU;EACV,MAAM;EACN,YAAY;EACZ,QAAQ;EACR,SAAS;;AAEX,IAAM,kCAAiF;EACrF,QAAQ;EACR,qBAAqB;EACrB,mBAAmB;EACnB,cAAc;EACd,UAAU;EACV,MAAM;EACN,YAAY;EACZ,QAAQ;EACR,SAAS;;AAEX,IAAM,0BAA0B,KAAK,OAAO;AAC5C,IAAM,0BAA0B;AAChC,IAAM,gCAAgC;AACtC,IAAM,gBAAgB,UAAU,QAAQ;AAqExC,SAAS,sBAAsB,OAAa;AAC1C,SAAO,MAAM,WAAW,MAAM,GAAG,EAAE,QAAQ,UAAU,EAAE,EAAE,QAAQ,QAAQ,EAAE;AAC7E;AAEA,SAAS,+BAA+B,OAAa;AACnD,QAAM,aAAa,sBAAsB,KAAK;AAC9C,SAAO,WAAW,QAAQ,QAAQ,EAAE;AACtC;AAIA,SAAS,mBAAmB,OAAc;AACxC,QAAM,aAAa,4BAA4B,KAAK;AACpD,MAAI,CAAC,YAAY;AACf,WAAO;EACT;AACA,QAAM,UAAU,WAAW,YAAW;AACtC,MAAI,YAAY,UAAU,YAAY,UAAU,YAAY,SAAS,YAAY,MAAM;AACrF,WAAO;EACT;AACA,SAAO;AACT;AAGA,SAAS,2BAA2B,QAAgB,gBAAqC;AACvF,SAAO,qBAAqB,QAAQ,cAAc,KAAK;AACzD;AAGA,SAAS,iBAAiB,QAAgB,gBAAqC;AAC7E,SAAO,eAAe,kBAAkB,IAAI,2BAA2B,QAAQ,cAAc,CAAC;AAChG;AA8BA,SAAS,8BAA8B,QAAqC;AAC1E,SAAO,CAAC,GAAG,IAAI,KAAK,UAAU,CAAA,GAAI,IAAI,CAAC,UAAU,MAAM,KAAI,EAAG,YAAW,CAAE,EAAE,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC,CAAC,CAAC,EAAE,KACjH,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AAE9C;AAEA,SAAS,0BAA0B,MAAyB,OAAwB;AAClF,MAAI,KAAK,WAAW,MAAM,QAAQ;AAChC,WAAO;EACT;AACA,SAAO,KAAK,MAAM,CAAC,OAAO,UAAU,UAAU,MAAM,KAAK,CAAC;AAC5D;AAEA,SAAS,8BAA8B,UAAwC;AAC7E,QAAM,uBAAuB,8BAA8B,8CAA8C;AACzG,QAAM,6BAA6B;IACjC,gBAAgB,8BAA8B,sDAAsD,cAAc;IAClH,YAAY,8BAA8B,sDAAsD,UAAU;IAC1G,eAAe,8BAA8B,sDAAsD,aAAa;;AAElH,QAAM,6BAA6B,8BACjC,SAAS,WAAW,uCAAuC;AAE7D,QAAM,sBAAsB;IAC1B,gBAAgB,8BAA8B,SAAS,WAAW,8CAA8C;IAChH,YAAY,8BAA8B,SAAS,WAAW,0CAA0C;IACxG,eAAe,8BAA8B,SAAS,WAAW,6CAA6C;;AAEhH,SAAO;IACL,+BAA+B;IAC/B,qCAAqC,0BAA0B,4BAA4B,oBAAoB,IAC3G,YACA;IACJ,sCAAsC;IACtC,6CAA6C;MAC3C,gBAAgB,0BAA0B,oBAAoB,gBAAgB,2BAA2B,cAAc,IACnH,YACA;MACJ,YAAY,0BAA0B,oBAAoB,YAAY,2BAA2B,UAAU,IACvG,YACA;MACJ,eAAe,0BAA0B,oBAAoB,eAAe,2BAA2B,aAAa,IAChH,YACA;;;AAGV;AAGA,SAAS,+BAA+B,OAAyB;AAC/D,QAAM,aAAa,OAAO,KAAI,EAAG,YAAW;AAC5C,MAAI,CAAC,cAAc,WAAW,WAAW,GAAG;AAC1C,WAAO;EACT;AACA,MAAK,iCAAuD,SAAS,UAAU,GAAG;AAChF,WAAO;EACT;AACA,QAAM,IAAI,WACR,qCAAqC,KAAK,wBAAwB,iCAAiC,KAAK,IAAI,CAAC,KAC7G,UAAU,KAAK;AAEnB;AAEA,SAAS,+BAA+B,OAAyB;AAC/D,QAAM,aAAa,OAAO,KAAI,EAAG,YAAW;AAC5C,MAAI,CAAC,cAAc,WAAW,WAAW,GAAG;AAC1C,WAAO;EACT;AACA,MAAK,0CAAgE,SAAS,UAAU,GAAG;AACzF,WAAO;EACT;AACA,QAAM,IAAI,WACR,8CAA8C,KAAK,wBAAwB,0CAA0C,KAAK,IAAI,CAAC,KAC/H,UAAU,KAAK;AAEnB;AAEA,SAAS,2BAA2B,OAAyB;AAC3D,QAAM,aAAa,OAAO,KAAI,EAAG,YAAW;AAC5C,MAAI,CAAC,cAAc,WAAW,WAAW,GAAG;AAC1C,WAAO;EACT;AACA,MAAK,0CAAgE,SAAS,UAAU,GAAG;AACzF,WAAO;EACT;AACA,QAAM,IAAI,WACR,0CAA0C,KAAK,wBAAwB,0CAA0C,KAAK,IAAI,CAAC,KAC3H,UAAU,KAAK;AAEnB;AAGA,SAAS,4CACP,QAA4D;AAE5D,QAAM,aAAa,CAAC,GAAG,IAAI,KAAK,UAAU,CAAA,GAAI,IAAI,CAAC,UAAU,MAAM,KAAI,EAAG,YAAW,EAAG,WAAW,KAAK,GAAG,CAAC,CAAC,CAAC;AAC9G,SAAO,WACJ,IAAI,CAAC,UAAU,gCAAgC,KAAK,CAAC,EACrD,OAAO,CAAC,UAAkD,UAAU,MAAS,EAC7E,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACpD;AAGA,SAAS,8BACP,SACA,eACA,wBAAgE;AAEhE,QAAM,yBAAyB,4CAA4C,sBAAsB;AACjG,MAAI,YAAY,QAAQ;AACtB,WAAO;MACL;MACA,gBAAgB;MAChB,iBAAiB,CAAC,GAAG,6BAA6B;MAClD,0BAA0B;MAC1B,kBAAkB;MAClB,UAAU,CAAA;;EAEd;AACA,MAAI,YAAY,UAAU;AACxB,WAAO;MACL;MACA,gBAAgB;MAChB,iBAAiB,CAAC,GAAG,+BAA+B;MACpD,0BAA0B;MAC1B,kBAAkB;MAClB,UAAU,CAAA;;EAEd;AACA,MAAI,uBAAuB,SAAS,GAAG;AACrC,WAAO;MACL;MACA,gBAAgB;MAChB,iBAAiB;MACjB,0BAA0B;MAC1B,kBAAkB;MAClB,UAAU,CAAA;;EAEd;AACA,SAAO;IACL;IACA,gBAAgB;IAChB,iBAAiB,CAAC,GAAG,6BAA6B;IAClD,0BAA0B;IAC1B,kBAAkB;IAClB,UAAU,CAAC,4DAA4D;;AAE3E;AASA,IAAM,kCAA8E,oBAAI,IAAI;EAC1F;EACA;CACD;AAED,SAAS,uBACP,MACA,OACA,gBACA,iCAAwC;AAIxC,MACE,CAAC,mCACD,gCAAgC,IAAI,KAAK,KACzC,iBAAiB,KAAK,QAAQ,cAAc,GAC5C;AACA,WAAO;EACT;AACA,MAAI,UAAU,UAAU;AACtB,WAAO,CAAC,4BAA4B,KAAK,MAAM;EACjD;AACA,MAAI,UAAU,uBAAuB;AACnC,WAAO,CAAC,4BAA4B,KAAK,mBAAmB;EAC9D;AACA,MAAI,UAAU,qBAAqB;AACjC,WAAO,CAAC,OAAO,SAAS,KAAK,iBAAiB;EAChD;AACA,MAAI,UAAU,gBAAgB;AAC5B,WAAO,2BAA2B,KAAK,QAAQ,cAAc,MAAM,eAAe,gBAAgB,CAAC,4BAA4B,KAAK,YAAY;EAClJ;AACA,MAAI,UAAU,YAAY;AACxB,WAAO,CAAC,4BAA4B,KAAK,QAAQ;EACnD;AACA,MAAI,UAAU,QAAQ;AACpB,WAAO,CAAC,4BAA4B,KAAK,IAAI;EAC/C;AACA,MAAI,UAAU,cAAc;AAC1B,QAAI,OAAO,KAAK,eAAe,UAAU;AACvC,aAAO,CAAC,OAAO,SAAS,KAAK,UAAU;IACzC;AACA,WAAO,CAAC,4BAA4B,KAAK,UAAU;EACrD;AACA,MAAI,UAAU,UAAU;AACtB,WAAO,CAAC,4BAA4B,KAAK,MAAM;EACjD;AACA,SAAO,CAAC,4BAA4B,KAAK,OAAO;AAClD;AAEA,SAAS,oBAAoB,UAA4B;AACvD,MAAI,aAAa,QAAW;AAC1B,WAAO;EACT;AACA,QAAM,aAAa,SAAS,KAAI,EAAG,YAAW;AAC9C,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;EACT;AACA,MAAI,eAAe,WAAW;AAC5B,WAAO;EACT;AACA,MAAI,eAAe,iBAAiB,eAAe,eAAe;AAChE,WAAO;EACT;AACA,MAAI,eAAe,wBAAwB,eAAe,sBAAsB;AAC9E,WAAO;EACT;AACA,QAAM,IAAI,WACR,8BAA8B,QAAQ,wBAAwB,yBAAyB,KAAK,IAAI,CAAC,KACjG,UAAU,KAAK;AAEnB;AAEA,SAAS,qBAAqB,QAAc;AAC1C,QAAM,iBAAiB,KAAK,QAAQ,MAAM;AAC1C,QAAM,mBAAmB,eAAe,WAAW,MAAM,GAAG;AAC5D,MAAI,iBAAiB,SAAS,aAAa,GAAG;AAC5C,WAAO,KAAK,QAAQ,KAAK,QAAQ,cAAc,CAAC;EAClD;AACA,QAAM,cAAc,KAAK,QAAQ,QAAQ,IAAG,CAAE;AAC9C,QAAM,kBAAkB,yBAAyB,cAAc;AAC/D,QAAM,eAAe,yBAAyB,WAAW;AACzD,QAAM,qBAAqB,KAAK,SAAS,iBAAiB,YAAY;AACtE,QAAM,kBACJ,mBAAmB,WAAW,KAC7B,CAAC,mBAAmB,WAAW,IAAI,KAAK,CAAC,KAAK,WAAW,kBAAkB;AAC9E,MAAI,iBAAiB;AACnB,WAAO;EACT;AAEA,SAAO;AACT;AAEA,SAAS,yBAAyB,WAAiB;AACjD,MAAI;AACF,WAAO,aAAa,OAAO,SAAS;EACtC,QAAQ;AACN,WAAO,KAAK,QAAQ,SAAS;EAC/B;AACF;AAGA,eAAe,mBAAmB,UAAkB,cAAsB,QAAgB;AACxF,QAAM,kBAAkB,aAAa,SAAS,IAAI,KAAK,KAAK,UAAU,YAAY,IAAI;AACtF,MAAI;AACJ,MAAI;AACF,cAAU,MAAM,GAAG,QAAQ,iBAAiB,EAAE,eAAe,KAAI,CAAE;EACrE,SAAS,OAAgB;AACvB,QAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,UAAU,SAAU,MAA4B,SAAS,UAAU;AACpH;IACF;AACA,UAAM;EACR;AAEA,aAAW,SAAS,SAAS;AAC3B,QAAI,MAAM,KAAK,WAAW,GAAG,GAAG;AAC9B;IACF;AACA,UAAM,gBAAgB,aAAa,SAAS,IAAI,KAAK,KAAK,cAAc,MAAM,IAAI,IAAI,MAAM;AAC5F,QAAI,MAAM,YAAW,GAAI;AACvB,UAAI,qBAAqB,IAAI,MAAM,IAAI,GAAG;AACxC;MACF;AACA,YAAM,mBAAmB,UAAU,eAAe,MAAM;AACxD;IACF;AAEA,QAAI,CAAC,MAAM,OAAM,GAAI;AACnB;IACF;AACA,WAAO,KAAK,sBAAsB,aAAa,CAAC;EAClD;AACF;AAGA,eAAe,oCAAoC,eAAqB;AACtE,QAAM,aAAuB,CAAA;AAC7B,aAAW,aAAa,uBAAuB;AAC7C,UAAM,mBAAmB,eAAe,WAAW,UAAU;EAC/D;AACA,aAAW,aAAa,sBAAsB;AAC5C,UAAM,WAAW,KAAK,KAAK,eAAe,SAAS;AACnD,QAAI;AACF,YAAM,QAAQ,MAAM,GAAG,KAAK,QAAQ;AAEpC,UAAI,MAAM,OAAM,GAAI;AAClB,mBAAW,KAAK,sBAAsB,SAAS,CAAC;MAClD;IAEF,QAAQ;IAER;EACF;AACA,SAAO,CAAC,GAAG,IAAI,IAAI,UAAU,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACjF;AAEA,eAAe,gCAAgC,eAAqB;AAClE,MAAI;AACF,UAAM,EAAE,OAAM,IAAK,MAAM,cAAc,OAAO,CAAC,YAAY,IAAI,GAAG;MAChE,KAAK;MACL,UAAU;MACV,WAAW;MACX,aAAa;KACd;AACD,UAAM,aAAa,OAChB,MAAM,IAAI,EACV,IAAI,CAAC,UAAU,sBAAsB,KAAK,CAAC,EAC3C,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AACrC,WAAO,CAAC,GAAG,IAAI,IAAI,UAAU,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;EACjF,QAAQ;AAEN,WAAO;EAET;AACF;AAYA,SAAS,mCAAmC,QAAgB,eAAqB;AAC/E,QAAM,WAAW,oBAAI,IAAG;AACxB,QAAM,oBAAoB,+BAA+B,UAAU;AACnE,MAAI,kBAAkB,SAAS,GAAG;AAChC,aAAS,IAAI,iBAAiB;EAChC;AACA,QAAM,iBAAiB,+BAA+B,KAAK,SAAS,eAAe,MAAM,CAAC;AAC1F,MAAI,eAAe,SAAS,KAAK,CAAC,eAAe,WAAW,IAAI,GAAG;AACjE,aAAS,IAAI,cAAc;EAC7B;AACA,SAAO,CAAC,GAAG,QAAQ,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACtE;AAGA,SAAS,cAAc,WAAmB,UAAkB;AAC1D,aAAW,UAAU,UAAU;AAC7B,QAAI,cAAc,UAAU,UAAU,WAAW,GAAG,MAAM,GAAG,GAAG;AAC9D,aAAO;IACT;EACF;AACA,SAAO;AACT;AAEA,eAAe,6BACb,eACA,UAA8B;AAE9B,MAAI,aAAa,iBAAiB,aAAa,sBAAsB;AACnE,UAAM,oBAAoB,MAAM,gCAAgC,aAAa;AAE7E,QAAI,mBAAmB;AACrB,aAAO;QACL,eAAe;QACf,aAAa;QACb,QAAQ;QACR,gBAAgB;QAChB,gBAAgB,kBAAkB;QAClC,kBAAkB,kBAAkB;;IAExC;AAGA,UAAM,qBAAqB,MAAM,oCAAoC,aAAa;AAClF,WAAO;MACL,eAAe;MACf,aAAa;MACb,QAAQ;MACR,gBAAgB;MAChB,gBAAgB,mBAAmB;MACnC,kBAAkB,mBAAmB;;EAGzC;AAEA,QAAM,oBAAoB,MAAM,oCAAoC,aAAa;AACjF,SAAO;IACL,eAAe;IACf,aAAa;IACb,QAAQ;IACR,gBAAgB;IAChB,gBAAgB,kBAAkB;IAClC,kBAAkB,kBAAkB;;AAExC;AAEA,SAAS,cAAc,QAAkB,QAAQ,+BAA6B;AAE5E,MAAI,OAAO,UAAU,OAAO;AAC1B,WAAO,EAAE,QAAQ,WAAW,MAAK;EACnC;AACA,SAAO;IACL,QAAQ,OAAO,MAAM,GAAG,KAAK;IAC7B,WAAW;;AAGf;AAEA,SAAS,kBACP,QACA,kBAAyB;AAMzB,MAAI,kBAAkB;AACpB,WAAO;MACL;MACA,WAAW;MACX,OAAO,OAAO;;EAElB;AACA,QAAM,UAAU,cAAc,QAAQ,uBAAuB;AAC7D,SAAO;IACL,QAAQ,QAAQ;IAChB,WAAW,QAAQ;IACnB,OAAO,OAAO;;AAElB;AAEA,IAAM,uCAA2E;EAC/E,YAAY;EACZ,iBAAiB;EACjB,eAAe;;AAGjB,IAAM,8CAAkF;EACtF,YAAY;EACZ,iBAAiB;EACjB,eAAe;;AAGjB,SAAS,kCAAkC,KAAyD;AAClG,QAAM,iBAAiB,IAAI,eACxB,IAAI,CAAC,UAAU,GAAG,qCAAqC,KAAK,CAAC,KAAM,4CAA4C,KAAK,CAAC,GAAI,EACzH,KAAK,GAAG;AACX,SAAO,aAAa,IAAI,EAAE,IAAI,cAAc;AAC9C;AAcA,SAAS,uBAAuB,OAAsB,eAAuB;AAC3E,QAAM,0BAA0B,MAAM,SAAS;AAC/C,QAAM,oBAAoB,MAAM,QAAQ,uBAAuB,KAAK,wBAAwB,SAAS;AACrG,QAAM,WAAW,oBACZ,wBAAsC,OAAO,CAAC,SAAyB,OAAO,SAAS,QAAQ,IAChG,yBAAyB,aAAa;AAC1C,MAAI,SAAS,WAAW,GAAG;AACzB;EACF;AAIA,QAAM,YAAY,qBAAqB,MAAM,SAAS,mDAAmD;AACzG,QAAM,UAAU;IACd,GAAG,MAAM;IACT,WAAW;IACX,GAAI,YAAY,EAAE,qBAAqB,KAAI,IAAK,CAAA;;AAEpD;AAGA,SAAS,uBAAuB,SAA+B;AAC7D,QAAM,YAAY,oBAAI,IAAG;AACzB,MAAI,QAAQ,eAAe;AACzB,cAAU,IAAI,UAAU;EAC1B;AACA,MAAI,QAAQ,iBAAiB;AAC3B,cAAU,IAAI,YAAY;EAC5B;AACA,MAAI,QAAQ,kBAAkB,QAAQ,oBAAoB;AACxD,cAAU,IAAI,WAAW;EAC3B;AACA,MAAI,QAAQ,YAAY;AACtB,cAAU,IAAI,OAAO;EACvB;AACA,MAAI,QAAQ,mBAAmB;AAC7B,cAAU,IAAI,eAAe;EAC/B;AACA,MAAI,QAAQ,wBAAwB;AAClC,cAAU,IAAI,oBAAoB;EACpC;AACA,MAAI,UAAU,SAAS,GAAG;AAKxB,QAAI,QAAQ,SAAS;AACnB,gBAAU,IAAI,UAAU;AACxB,gBAAU,IAAI,YAAY;AAC1B,gBAAU,IAAI,WAAW;IAC3B;AACA,QAAI,QAAQ,cAAc;AACxB,gBAAU,IAAI,OAAO;IACvB;AACA,QAAI,UAAU,SAAS,GAAG;AACxB,gBAAU,IAAI,UAAU;AACxB,gBAAU,IAAI,YAAY;AAC1B,gBAAU,IAAI,WAAW;AACzB,gBAAU,IAAI,OAAO;AACrB,gBAAU,IAAI,oBAAoB;AAClC,gBAAU,IAAI,eAAe;AAC7B,gBAAU,IAAI,gBAAgB;IAChC;AACA,WAAO;EACT;AAGA,MAAI,QAAQ,cAAc;AACxB,cAAU,IAAI,OAAO;EACvB;AACA,SAAO;AACT;AAEA,IAAM,qCAAqC;AAU3C,SAAS,6BACP,YACA,oBAA2B;AAE3B,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,EAAE,MAAM,CAAA,GAAI,WAAW,OAAO,UAAU,CAAA,EAAE;EACnD;AACA,QAAM,QAAQ,qBAAqB,WAAW,SAAS;AACvD,QAAM,QAAQ,WAAW,MAAM,GAAG,KAAK;AACvC,QAAM,OAAO,MAAM,IAAI,CAAC,eAAe;IACrC,MAAM,UAAU;IAChB,OAAO,UAAU;IACjB,KAAK,UAAU;IACf,QAAQ,UAAU;IAClB,kBAAkB,SAAS,UAAU,IAAI,KAAK,IAAI,CAAC,sBAAsB,UAAU,IAAI;IACvF;AACF,SAAO;IACL;IACA,WAAW,MAAM,SAAS,WAAW;IACrC,UAAU,CAAC,GAAG,kCAAkC,IAAI,WAAW,MAAM,EAAE;;AAE3E;AAEA,SAAS,mCAAgC;AACvC,SAAO,OAAO,YACZ,mCAAmC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAA,CAAc,CAAC,CAAC;AAE9E;AAEA,SAAS,8BACP,OACA,gBACA,iCAAwC;AAExC,QAAM,iBAAiB,iCAAgC;AACvD,aAAW,QAAQ,OAAO;AACxB,eAAW,SAAS,oCAAoC;AACtD,UAAI,uBAAuB,MAAM,OAAO,gBAAgB,+BAA+B,GAAG;AACxF,uBAAe,KAAK,EAAE,KAAK,KAAK,EAAE;MACpC;IACF;EACF;AACA,SAAO;AACT;AAEA,SAAS,2BACP,gBACA,gBACA,mBAA2B;AAE3B,QAAM,gBAAgB,CAAC,GAAG,eAAe,QAAQ;AACjD,aAAW,SAAS,eAAe,iBAAiB;AAClD,UAAM,eAAe,eAAe,KAAK;AACzC,QAAI,aAAa,SAAS,GAAG;AAC3B,oBAAc,KAAK,GAAG,gCAAgC,KAAK,CAAC,IAAI,aAAa,MAAM,EAAE;IACvF;EACF;AACA,gBAAc,KAAK,GAAG,iBAAiB;AACvC,SAAO;AACT;AAEA,SAAS,oBACP,gBACA,gBAA+D;AAE/D,QAAM,SAAiC,CAAA;AACvC,aAAW,SAAS,eAAe,iBAAiB;AAClD,UAAM,UAAU,eAAe,KAAK;AACpC,UAAM,QAAQ,UAAU,QAAQ,SAAS;AACzC,UAAM,WAAW,4BAA4B,KAAK;AAClD,QAAI,QAAQ,KAAK,UAAU;AACzB,aAAO,QAAQ,IAAI;IACrB;EACF;AACA,SAAO;AACT;AAEA,SAAS,6BACP,gBACA,gBACA,WAAoC;AAEpC,QAAM,cAAwC,CAAA;AAC9C,aAAW,SAAS,eAAe,iBAAiB;AAClD,UAAM,UAAU,eAAe,KAAK;AACpC,QAAI,CAAC,SAAS;AACZ;IACF;AACA,eAAW,UAAU,SAAS;AAC5B,YAAM,WAAW,UAAU,IAAI,MAAM,GAAG;AACxC,YAAM,qBAAqB,OAAO,aAAa,YAAY,SAAS,SAAS,IAAI,WAAW;AAC5F,kBAAY,KAAK,EAAE,WAAW,oBAAoB,MAAK,CAAE;IAC3D;EACF;AACA,SAAO;AACT;AAGA,SAAS,6BACP,SACA,gBACA,gBACA,oBAA2B;AAE3B,aAAW,SAAS,eAAe,iBAAiB;AAClD,UAAM,UAAU,eAAe,KAAK;AACpC,QAAI,CAAC,WAAW,QAAQ,WAAW,GAAG;AACpC;IACF;AACA,UAAM,SAAS,+BAA+B,KAAK;AACnD,UAAM,eAAe,gCAAgC,KAAK;AAC1D,QAAI,CAAC,UAAU,CAAC,cAAc;AAC5B;IACF;AACA,UAAM,aAAa,cAAc,SAAS,qBAAqB,QAAQ,SAAS,6BAA6B;AAC7G,YAAQ,MAAM,IAAI,WAAW;AAC7B,YAAQ,YAAY,IAAI,WAAW;EACrC;AACF;AAGA,SAAS,6BACP,gBACA,gBACA,WAAoC;AAEpC,MAAI,CAAC,eAAe,gBAAgB,SAAS,cAAc,GAAG;AAC5D,WAAO,CAAA;EACT;AACA,QAAM,UAAU,eAAe;AAC/B,MAAI,CAAC,SAAS;AACZ,WAAO,CAAA;EACT;AACA,SAAO,QAAQ,IAAI,CAAC,YAAY;IAC9B,IAAI;IACJ,YAAY,4BAA4B,UAAU,IAAI,MAAM,GAAG,UAAU;IACzE;AACJ;AAEA,SAAS,0BACP,gBACA,gBACA,WAAoC;AAEpC,MAAI,CAAC,eAAe,gBAAgB,SAAS,mBAAmB,GAAG;AACjE,WAAO,CAAA;EACT;AACA,QAAM,UAAU,eAAe;AAC/B,MAAI,CAAC,SAAS;AACZ,WAAO,CAAA;EACT;AACA,SAAO,QAAQ,IAAI,CAAC,YAAY;IAC9B,IAAI;IACJ,MAAM,4BAA4B,UAAU,IAAI,MAAM,GAAG,IAAI;IAC7D;AACJ;AAGA,SAAS,mBACP,OACA,gBACA,gBACA,oBAA2B;AAO3B,QAAM,YAAY,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;AAK9D,QAAM,kCAAkC,eAAe,YAAY;AACnE,QAAM,iBAAiB,8BAA8B,OAAO,gBAAgB,+BAA+B;AAI3G,QAAM,sBAAsB,wBAAwB,KAAK;AACzD,QAAM,4BAA4B,6BAA6B,qBAAqB,kBAAkB;AACtG,QAAM,gBAAgB,2BAA2B,gBAAgB,gBAAgB,0BAA0B,QAAQ;AASnH,QAAM,SAAS,oBAAoB,gBAAgB,cAAc;AAKjE,QAAM,0BAA0B,6BAA6B,gBAAgB,gBAAgB,SAAS;AACtG,QAAM,gBAAgB,yBAAyB,uBAAuB;AACtE,QAAM,UAAmC;IACvC,eAAe,MAAM;IACrB,kBAAkB,eAAe;IACjC,yBAAyB,eAAe;IACxC,mCAAmC,eAAe;IAClD,iBAAiB,CAAC,GAAG,eAAe,eAAe;IACnD,2BAA2B,CAAC,GAAG,kCAAkC;IACjE;IACA,iBAAiB;IACjB,6BAA6B,oBAAoB;IACjD,uBAAuB,0BAA0B;IACjD,iCAAiC,0BAA0B;;AAE7D,MAAI,eAAe,yBAAyB,SAAS,GAAG;AACtD,YAAQ,oCAAoC,CAAC,GAAG,eAAe,wBAAwB;EACzF;AAUA,+BAA6B,SAAS,gBAAgB,gBAAgB,kBAAkB;AAMxF,QAAM,0BAA0B,6BAA6B,gBAAgB,gBAAgB,SAAS;AAMtG,QAAM,uBAAuB,0BAA0B,gBAAgB,gBAAgB,SAAS;AAEhG,SAAO;IACL,OAAO;MACL,MAAM;MACN,QAAQ,cAAc,WAAW,IAAI,OAAO;MAC5C;;IAEF,UAAU;IACV;IACA;;AAEJ;AAGA,SAAS,qBACP,OACA,gBACA,oBAA2B;AAE3B,QAAM,uBAAuB,IAAI,IAAY,eAAe,sBAAsB;AAClF,uBAAqB,IAAI,eAAe,YAAY;AACpD,QAAM,cAAc,MAAM,OAAO,CAAC,SAAS,qBAAqB,IAAI,2BAA2B,KAAK,QAAQ,cAAc,CAAC,CAAC;AAC5H,QAAM,wBAAqF,CAAA;AAC3F,QAAM,yBAAkD,CAAA;AAExD,aAAW,QAAQ,aAAa;AAC9B,UAAM,gBAAgB,sBAAsB,OAAO,CAAC,UAAU,CAAC,4BAA4B,KAAK,KAAK,CAAC,CAAC;AACvG,QAAI,cAAc,WAAW,GAAG;AAC9B;IACF;AACA,0BAAsB,KAAK;MACzB,IAAI,KAAK;MACT,gBAAgB;KACjB;AAGD,2BAAuB,KAAK;MAC1B,IAAI,KAAK;MACT,gBAAgB;MAChB,cAAc,4BAA4B,KAAK,YAAY;KAC5D;EACH;AAEA,QAAM,WACJ,sBAAsB,SAAS,IAAI,CAAC,sCAAsC,sBAAsB,MAAM,EAAE,IAAI,CAAA;AAC9G,QAAM,kBAAkB,qBAAqB,OAAO,oBAAoB;AACxE,QAAM,iBAAiB,cACrB,sBAAsB,IAAI,CAAC,QAAQ,GAAG,IAAI,EAAE,IAAI,IAAI,eAAe,KAAK,GAAG,CAAC,EAAE,GAC9E,eAAe;AAEjB,QAAM,mBAAmB,sBAAsB,IAAI,CAAC,QAAQ,kCAAkC,GAAG,CAAC;AAClG,QAAM,kBAAkB,cAAc,kBAAkB,eAAe;AACvE,SAAO;IACL,OAAO;MACL,MAAM;MACN,QAAQ,SAAS,WAAW,IAAI,OAAO;MACvC,SAAS;QACP,sBAAsB,YAAY;QAClC,0BAA0B,sBAAsB;QAChD,yBAAyB,eAAe;QACxC,mCAAmC,eAAe;QAClD,sCAAsC,gBAAgB;QACtD,gDAAgD,gBAAgB;;;IAGpE;IACA;;AAEJ;AAGA,SAAS,aAAa,OAAa;AACjC,SAAO,MAAM,QAAQ,uBAAuB,MAAM;AACpD;AAEA,SAAS,8BAA8B,aAA6B,WAAW,MAAI;AACjF,QAAM,gBAAgB,IAAI,IAAI,YAAY,IAAI,CAAC,SAAS,KAAK,EAAE,CAAC;AAChE,QAAM,QAAQ,oBAAI,IAAG;AACrB,QAAM,cAAc,CAAC,GAAG,WAAW,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AAC1F,aAAW,QAAQ,aAAa;AAC9B,UAAM,QAAQ,oBAAI,IAAG;AACrB,UAAM,YAAY,mBAAmB,KAAK,UAAU;AACpD,QAAI,aAAa,cAAc,IAAI,SAAS,GAAG;AAC7C,YAAM,IAAI,SAAS;IACrB;AACA,eAAW,cAAc,KAAK,gBAAgB,CAAA,GAAI;AAChD,YAAM,eAAe,mBAAmB,WAAW,EAAE;AACrD,UAAI,CAAC,gBAAgB,CAAC,cAAc,IAAI,YAAY,GAAG;AACrD;MACF;AACA,YAAM,IAAI,YAAY;IACxB;AACA,UAAM,oBAAoB,mBAAmB,KAAK,mBAAmB;AACrE,QAAI,mBAAmB;AACrB,iBAAW,gBAAgB,eAAe,mBAAmB,QAAQ,GAAG;AACtE,YAAI,cAAc,IAAI,YAAY,GAAG;AACnC,gBAAM,IAAI,YAAY;QACxB;MACF;IACF;AACA,UAAM,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC,CAAC;EAChF;AACA,SAAO;AACT;AAGA,SAAS,eAAe,OAAe,WAAW,MAAI;AACpD,QAAM,oBAAoB,SAAS,KAAI,EAAG,YAAW,KAAM,MAAM,QAAQ,QAAQ,EAAE;AACnF,QAAM,UAAU,IAAI,OAAO,oBAAoB,aAAa,gBAAgB,CAAC,wBAAwB,IAAI;AACzG,SAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,MAAM,SAAS,OAAO,CAAC,EAAE,IAAI,CAAC,UAAU,MAAM,CAAC,EAAG,YAAW,CAAE,CAAC,CAAC,EAAE,KACxF,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AAE9C;AAGA,SAAS,uCAAuC,OAA4B;AAC1E,MAAI,YAAY;AAChB,QAAM,YAAY,oBAAI,IAAG;AACzB,QAAM,cAAc,oBAAI,IAAG;AAC3B,QAAM,QAAkB,CAAA;AACxB,QAAM,UAAU,oBAAI,IAAG;AACvB,QAAM,aAAyB,CAAA;AAE/B,QAAM,QAAQ,CAAC,OAAoB;AACjC,cAAU,IAAI,IAAI,SAAS;AAC3B,gBAAY,IAAI,IAAI,SAAS;AAC7B,iBAAa;AACb,UAAM,KAAK,EAAE;AACb,YAAQ,IAAI,EAAE;AAEd,eAAW,gBAAgB,MAAM,IAAI,EAAE,KAAK,CAAA,GAAI;AAC9C,UAAI,CAAC,UAAU,IAAI,YAAY,GAAG;AAChC,cAAM,YAAY;AAClB,oBAAY,IAAI,IAAI,KAAK,IAAI,YAAY,IAAI,EAAE,GAAI,YAAY,IAAI,YAAY,CAAE,CAAC;MACpF,WAAW,QAAQ,IAAI,YAAY,GAAG;AACpC,oBAAY,IAAI,IAAI,KAAK,IAAI,YAAY,IAAI,EAAE,GAAI,UAAU,IAAI,YAAY,CAAE,CAAC;MAClF;IACF;AAEA,QAAI,YAAY,IAAI,EAAE,MAAM,UAAU,IAAI,EAAE,GAAG;AAC7C;IACF;AACA,UAAM,YAAsB,CAAA;AAC5B,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,SAAS,MAAM,IAAG;AACxB,cAAQ,OAAO,MAAM;AACrB,gBAAU,KAAK,MAAM;AACrB,UAAI,WAAW,IAAI;AACjB;MACF;IACF;AACA,cAAU,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACzD,eAAW,KAAK,SAAS;EAC3B;AAEA,QAAM,gBAAgB,CAAC,GAAG,MAAM,KAAI,CAAE,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACvF,aAAW,MAAM,eAAe;AAC9B,QAAI,CAAC,UAAU,IAAI,EAAE,GAAG;AACtB,YAAM,EAAE;IACV;EACF;AAEA,QAAM,kBAAkB,WAAW,OAAO,CAAC,cAAa;AACtD,QAAI,UAAU,SAAS,GAAG;AACxB,aAAO;IACT;AACA,UAAM,SAAS,UAAU,CAAC;AAC1B,YAAQ,MAAM,IAAI,MAAM,KAAK,CAAA,GAAI,SAAS,MAAM;EAClD,CAAC;AACD,SAAO,gBAAgB,KACrB,CAAC,MAAM,UACL,KAAK,CAAC,EAAE,cAAc,MAAM,CAAC,CAAC,KAC9B,KAAK,SAAS,MAAM,UACpB,KAAK,KAAK,GAAG,EAAE,cAAc,MAAM,KAAK,GAAG,CAAC,CAAC;AAEnD;AAIA,SAAS,0CAA0C,WAAqB,OAA4B;AAClG,QAAM,QAAQ,UAAU,CAAC;AACzB,MAAI,UAAU,WAAW,GAAG;AAC1B,WAAO,CAAC,OAAO,KAAK;EACtB;AACA,QAAM,eAAe,IAAI,IAAI,SAAS;AACtC,QAAMC,QAAiB,CAAC,KAAK;AAC7B,QAAM,UAAU,oBAAI,IAAY,CAAC,KAAK,CAAC;AAEvC,QAAM,SAAS,CAAC,YAA4B;AAC1C,UAAM,aAAa,MAAM,IAAI,OAAO,KAAK,CAAA,GAAI,OAAO,CAAC,cAAc,aAAa,IAAI,SAAS,CAAC;AAC9F,eAAW,QAAQ,WAAW;AAC5B,UAAI,SAAS,SAASA,MAAK,SAAS,GAAG;AACrC,QAAAA,MAAK,KAAK,KAAK;AACf,eAAO;MACT;AACA,UAAI,QAAQ,IAAI,IAAI,GAAG;AACrB;MACF;AACA,cAAQ,IAAI,IAAI;AAChB,MAAAA,MAAK,KAAK,IAAI;AACd,UAAI,OAAO,IAAI,GAAG;AAChB,eAAO;MACT;AACA,MAAAA,MAAK,IAAG;AACR,cAAQ,OAAO,IAAI;IACrB;AACA,WAAO;EACT;AAEA,MAAI,OAAO,KAAK,GAAG;AACjB,WAAO,CAAC,GAAGA,KAAI;EACjB;AACA,SAAO,CAAC,GAAG,WAAW,KAAK;AAC7B;AAGA,SAAS,gCAAgC,aAA6B,WAAW,MAAI;AAKnF,QAAM,QAAQ,8BAA8B,aAAa,QAAQ;AACjE,QAAM,kBAAkB,uCAAuC,KAAK;AACpE,QAAM,eAAe,CAAC,GAAG,IAAI,IAAI,gBAAgB,KAAI,CAAE,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACzG,QAAM,mBAAmB,gBAAgB,IAAI,CAAC,cAC5C,0CAA0C,WAAW,KAAK,EAAE,KAAK,IAAI,CAAC;AAExE,SAAO;IACL,aAAa,gBAAgB;IAC7B,gBAAgB;IAChB,oBAAoB;;AAExB;AAUA,SAAS,0BAA0B,OAAqB;AAKtD,QAAM,yBAAyB,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,YAAW,GAAI,KAAK,EAAE,CAAC,CAAC;AAC5F,QAAM,QAAQ,oBAAI,IAAG;AACrB,QAAM,cAAc,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AACpF,aAAW,QAAQ,aAAa;AAC9B,UAAM,QAAkB,CAAA;AACxB,UAAM,WAAW,mBAAmB,KAAK,MAAM;AAC/C,UAAM,oBAAoB,WAAW,uBAAuB,IAAI,SAAS,YAAW,CAAE,IAAI;AAC1F,QAAI,mBAAmB;AACrB,YAAM,KAAK,iBAAiB;IAC9B;AACA,UAAM,IAAI,KAAK,IAAI,KAAK;EAC1B;AACA,SAAO;AACT;AAEA,SAAS,4BAA4B,OAAqB;AAKxD,QAAM,QAAQ,0BAA0B,KAAK;AAC7C,QAAM,kBAAkB,uCAAuC,KAAK;AACpE,QAAM,eAAe,CAAC,GAAG,IAAI,IAAI,gBAAgB,KAAI,CAAE,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACzG,QAAM,mBAAmB,gBAAgB,IAAI,CAAC,cAC5C,0CAA0C,WAAW,KAAK,EAAE,KAAK,IAAI,CAAC;AAExE,SAAO;IACL,aAAa,gBAAgB;IAC7B,gBAAgB;IAChB,oBAAoB;;AAExB;AAeA,SAAS,qBAAqB,WAAiB;AAC7C,MAAI,UAAU,WAAW,OAAO,GAAG;AACjC,WAAO;EACT;AACA,MAAI,UAAU,WAAW,QAAQ,GAAG;AAClC,WAAO;EACT;AACA,MAAI,UAAU,WAAW,MAAM,GAAG;AAChC,WAAO;EACT;AACA,MAAI,UAAU,SAAS,KAAK,GAAG;AAC7B,WAAO;EACT;AACA,SAAO;AACT;AAEA,SAAS,YAAY,cAAoB;AACvC,QAAM,QAAQ,aAAa,YAAY,GAAG;AAC1C,SAAO,UAAU,KAAK,KAAK,aAAa,MAAM,GAAG,KAAK;AACxD;AAEA,SAAS,4BAA4B,MAAc,OAAa;AAC9D,QAAM,YAAY,YAAY,IAAI,EAAE,MAAM,GAAG,EAAE,OAAO,OAAO;AAC7D,QAAM,aAAa,YAAY,KAAK,EAAE,MAAM,GAAG,EAAE,OAAO,OAAO;AAC/D,MAAI,QAAQ;AACZ,SAAO,QAAQ,UAAU,UAAU,QAAQ,WAAW,UAAU,UAAU,KAAK,MAAM,WAAW,KAAK,GAAG;AACtG,aAAS;EACX;AACA,SAAO;AACT;AAOA,SAAS,0BAA0B,WAAmB,YAAkB;AACtE,QAAM,YAAY,YAAY,UAAU;AACxC,QAAM,YAAY,YAAY,SAAS;AACvC,QAAM,kBAAkB,WAAW,SAAS,GAAG,IAAI,aAAa,GAAG,UAAU;AAC7E,QAAM,oBAAoB,UAAU,WAAW,eAAe;AAC9D,QAAM,gBAAgB,UAAU,SAAS,KAAK,cAAc;AAC5D,QAAM,qBAAqB,4BAA4B,WAAW,UAAU;AAC5E,MAAI,CAAC,qBAAqB,CAAC,iBAAiB,uBAAuB,GAAG;AACpE,WAAO;EACT;AACA,MAAI,mBAAmB;AACrB,WAAO,EAAE,OAAO,WAAW,SAAS,KAAM,YAAY,cAAa;EACrE;AACA,SAAO,gBACH,EAAE,OAAO,qBAAqB,KAAK,YAAY,iBAAgB,IAC/D,EAAE,OAAO,oBAAoB,YAAY,mBAAkB;AACjE;AAEA,SAAS,kCACP,MACA,MACA,OAAa;AAEb,SAAO,SAAS,UAAa,QAAQ,KAAK,SAAU,UAAU,KAAK,SAAS,KAAK,GAAG,cAAc,KAAK,KAAK,EAAE,IAAI;AACpH;AAEA,SAAS,yBACP,WACA,gBACA,OAA8B;AAE9B,QAAM,WAAW,mBAAmB,iBAAiB,SAAS;AAC9D,MAAI;AAOJ,aAAW,QAAQ,OAAO;AACxB,UAAM,QAAQ,aAAa,SAAS,KAAK,QAAQ,CAAA,IAAK,KAAK,SAAS,CAAA;AACpE,eAAW,QAAQ,OAAO;AACxB,UAAI,KAAK,UAAU,WAAW;AAC5B;MACF;AACA,YAAM,aAAa,sBAAsB,KAAK,IAAI;AAClD,UAAI,WAAW,WAAW,KAAK,eAAe,WAAW;AACvD;MACF;AACA,YAAM,SAAS,0BAA0B,WAAW,UAAU;AAC9D,UAAI,WAAW,MAAM;AACnB;MACF;AACA,UAAI,kCAAkC,MAAM,MAAM,OAAO,KAAK,GAAG;AAC/D,eAAO;UACL;UACA,OAAO,OAAO;UACd,YAAY,OAAO;;MAEvB;IACF;EACF;AACA,MAAI,CAAC,MAAM;AACT,WAAO;EACT;AACA,SAAO;IACL,IAAI,KAAK,KAAK;IACd,MAAM,KAAK,KAAK;IAChB,OAAO,KAAK,KAAK;IACjB,QAAQ,KAAK,KAAK;IAClB,YAAY,KAAK;;AAErB;AAEA,SAAS,sBAAsB,eAAkC,OAA8B;AAC7F,SAAO,cAAc,IAAI,CAAC,cAAa;AACrC,UAAM,iBAAiB,qBAAqB,SAAS;AACrD,UAAM,cAAc,mBAAmB,iBAAiB,SAAS;AACjE,UAAM,iBAAiB,yBAAyB,WAAW,gBAAgB,KAAK;AAChF,UAAM,SAAS,gBAAgB,MAAM;AACrC,WAAO;MACL,MAAM;MACN;MACA,iBAAiB;MACjB,kBAAkB,MAAM,WAAW,IAAI,MAAM,eAAe,SAAS;;EAEzE,CAAC;AACH;AAEA,SAAS,0BAA0B,MAAgC;AACjE,SAAO,KAAK,IACV,CAAC,QACC,GAAG,IAAI,IAAI,IAAI,IAAI,cAAc,oBAAoB,IAAI,iBAAiB,MAAM,SAAS,SAAS,KAAK,UAAU,IAAI,gBAAgB,CAAC,EAAE;AAE9I;AAUA,SAAS,yBAAyB,MAAoB,wBAA8C;AAClG,SAAO,OAAO,QAAQ,uBAAuB,oCAAoC,EAC9E,OAAO,CAAC,CAAC,OAAO,QAAQ,MAAK;AAC5B,UAAM,QAAQ,mBAAmB,KAAK,KAA2B,CAAC;AAClE,WAAO,QAAQ,SAAS,KAAK,CAAC,YAAY,MAAM,YAAW,EAAG,SAAS,OAAO,CAAC,IAAI;EACrF,CAAC,EACA,IAAI,CAAC,CAAC,KAAK,MAAM,KAAK,EACtB,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACpD;AAEA,SAAS,0BACP,MACA,QACA,WACA,wBACA,gBAAqC;AAErC,QAAM,gBAAgB,mBAAmB,OAAO,MAAM;AACtD,QAAM,cAAc,gBAChB,UAAU,IAAI,uBAAuB,IAAI,cAAc,YAAW,CAAE,KAAK,aAAa,IACtF;AACJ,SAAO;IACL,IAAI,KAAK;IACT,WAAW,OAAO;IAClB,gBAAgB,aAAa;IAC7B,oBAAoB,gBAAgB,UAAa,CAAC,iBAAiB,YAAY,QAAQ,cAAc;;AAEzG;AAGA,SAAS,2BACP,MACA,iBACA,gBACA,wBAA8C;AAE9C,QAAM,YAAY,mBAAmB,KAAK,UAAU;AACpD,QAAM,gBAAgB,mBAAmB,KAAK,cAAc;AAC5D,QAAM,0BAA0B,eAAe,YAAW;AAC1D,QAAM,mBAAmB,2BAA2B,KAAK,QAAQ,cAAc;AAC/E,QAAM,UAAoB,CAAA;AAC1B,MAAI,CAAC,gBAAgB,IAAI,gBAAgB,GAAG;AAC1C,QAAI,WAAW;AACb,cAAQ,KAAK,mCAAmC;IAClD;AACA,QAAI,eAAe;AACjB,cAAQ,KAAK,uCAAuC;IACtD;AACA,WAAO;EACT;AACA,MAAI,CAAC,aAAa,CAAC,eAAe;AAEhC,YAAQ,KAAK,wCAAwC;EAEvD;AACA,MAAI,yBAAyB,SAAS,mBAAmB,GAAG;AAC1D,YAAQ,KAAK,iDAAiD;EAChE;AACA,MACE,2BACA,uBAAuB,8BAA8B,KAAK,CAAC,YAAY,wBAAwB,SAAS,OAAO,CAAC,GAChH;AACA,YAAQ,KAAK,6CAA6C;EAC5D;AACA,SAAO;AACT;AAGA,SAAS,yBACP,OACA,sBACA,gBACA,wBAA8C;AAE9C,QAAM,YAAY,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;AAC9D,QAAM,yBAAyB,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,YAAW,GAAI,KAAK,EAAE,CAAC,CAAC;AAE5F,QAAM,kBACJ,eAAe,iBAAiB,OAAO,IAAI,eAAe,mBAAmB,oBAAI,IAAY,CAAC,SAAS,CAAC;AAE1G,QAAM,OAA0B;IAC9B,aAAa,MAAM,OAAO,CAAC,SAAS,CAAC,iBAAiB,KAAK,QAAQ,cAAc,CAAC;IAClF,iBAAiB,CAAA;IACjB,oBAAoB,CAAA;IACpB,uBAAuB,CAAA;IACvB,kBAAkB,CAAA;;AAEpB,aAAW,QAAQ,KAAK,aAAa;AACnC,UAAM,oBAAoB,yBAAyB,MAAM,sBAAsB;AAC/E,QAAI,kBAAkB,SAAS,GAAG;AAChC,WAAK,gBAAgB,KAAK,EAAE,IAAI,KAAK,IAAI,QAAQ,kBAAiB,CAAE;IACtE;AACA,UAAM,WAAW,mBAAmB,KAAK,MAAM;AAC/C,UAAM,SAAS,WAAW,UAAU,IAAI,uBAAuB,IAAI,SAAS,YAAW,CAAE,KAAK,QAAQ,IAAI;AAC1G,QAAI,UAAU,iBAAiB,OAAO,QAAQ,cAAc,GAAG;AAC7D,WAAK,mBAAmB,KAAK,EAAE,IAAI,KAAK,IAAI,WAAW,OAAO,IAAI,eAAe,OAAO,OAAM,CAAE;AAChG,WAAK,sBAAsB,KAAK,0BAA0B,MAAM,QAAQ,WAAW,wBAAwB,cAAc,CAAC;IAC5H;AAEA,QAAI,sBAAsB;AACxB,YAAM,UAAU,2BAA2B,MAAM,iBAAiB,gBAAgB,sBAAsB;AACxG,UAAI,QAAQ,SAAS,GAAG;AACtB,aAAK,iBAAiB,KAAK;UACzB,IAAI,KAAK;UACT,QAAQ,KAAK;UACb,SAAS,CAAC,GAAG,IAAI,IAAI,OAAO,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;SAC/E;MACH;IACF;EAEF;AACA,SAAO;AACT;AAEA,SAAS,sBAAsB,MAAuB;AACpD,OAAK,gBAAgB,KAAK,CAAC,MAAM,UAAU,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AAE1E,OAAK,mBAAmB,KACtB,CAAC,MAAM,UAAU,KAAK,GAAG,cAAc,MAAM,EAAE,KAAK,KAAK,UAAU,cAAc,MAAM,SAAS,CAAC;AAEnG,OAAK,sBAAsB,KACzB,CAAC,MAAM,UAAU,KAAK,GAAG,cAAc,MAAM,EAAE,KAAK,KAAK,UAAU,cAAc,MAAM,SAAS,CAAC;AAGnG,OAAK,iBAAiB,KAAK,CAAC,MAAM,UAAU,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AAC7E;AAEA,SAAS,2BACP,QACA,UACA,OAAa;AAEb,MAAI,SAAS,KAAK,aAAa,OAAO;AACpC,WAAO;EACT;AACA,SAAO,GAAG,aAAa,UAAU,GAAG,MAAM,WAAW,MAAM,IAAI,KAAK;AACtE;AAEA,SAAS,uBACP,MACA,sBACA,yBACA,qBACA,sBACA,kBAAwB;AAExB,QAAM,WAAqB,CAAA;AAC3B,MAAI,KAAK,gBAAgB,SAAS,GAAG;AACnC,aAAS,KAAK,mDAAmD,KAAK,gBAAgB,MAAM,EAAE;EAChG;AACA,MAAI,KAAK,mBAAmB,SAAS,GAAG;AACtC,aAAS,KAAK,6CAA6C,KAAK,mBAAmB,MAAM,EAAE;EAC7F;AACA,MAAI,wBAAwB,KAAK,iBAAiB,SAAS,GAAG;AAC5D,aAAS,KAAK,qCAAqC,KAAK,iBAAiB,MAAM,EAAE;EACnF;AACA,QAAM,oBAAoB,2BACxB,wCACA,yBACA,oBAAoB;AAEtB,QAAM,gBAAgB,2BAA2B,mCAAmC,qBAAqB,gBAAgB;AACzH,SAAO,CAAC,GAAG,UAAU,GAAI,oBAAoB,CAAC,iBAAiB,IAAI,CAAA,GAAK,GAAI,gBAAgB,CAAC,aAAa,IAAI,CAAA,CAAG;AACnH;AASA,eAAe,wBAAwB,eAAuB,cAAoB;AAChF,QAAM,eAAe,KAAK,WAAW,YAAY,IAAI,eAAe,KAAK,QAAQ,eAAe,YAAY;AAC5G,MAAI;AACF,UAAM,QAAQ,MAAM,GAAG,KAAK,YAAY;AACxC,WAAO,CAAC,MAAM,OAAM,KAAM,CAAC,MAAM,YAAW;EAC9C,SAAS,OAAO;AACd,UAAM,OACJ,OAAO,UAAU,YAAY,UAAU,QAAQ,UAAU,QACpD,MAA6B,OAC9B;AACN,WAAO,SAAS,YAAY,SAAS;EACvC;AACF;AAEA,eAAe,2BAA2B,OAAuB,eAAqB;AACpF,QAAM,QAA6B;IACjC,oBAAoB,oBAAI,IAAG;IAC3B,mBAAmB,oBAAI,IAAG;IAC1B,oBAAoB,CAAA;IACpB,eAAe,CAAA;;AAEjB,aAAW,QAAQ,OAAO;AACxB,UAAM,uBAAuB;MAC3B,EAAE,WAAW,SAAkB,WAAW,KAAK,SAAS,CAAA,EAAE;MAC1D,EAAE,WAAW,QAAiB,WAAW,KAAK,QAAQ,CAAA,EAAE;;AAE1D,eAAW,SAAS,sBAAsB;AACxC,iBAAW,YAAY,MAAM,WAAW;AACtC,YAAI,SAAS,UAAU,WAAW;AAChC;QACF;AACA,YAAI,gCAAgC,SAAS,IAAI,GAAG;AAClD,gBAAM,kBAAkB,IAAI,SAAS,KAAK,KAAI,CAAE;AAChD;QACF;AACA,cAAM,iBAAiB,sBAAsB,SAAS,IAAI;AAC1D,YAAI,eAAe,WAAW,GAAG;AAC/B;QACF;AACA,cAAM,mBAAmB,IAAI,cAAc;AAC3C,YAAI,MAAM,wBAAwB,eAAe,SAAS,IAAI,GAAG;AAC/D,gBAAM,mBAAmB,KAAK,cAAc;AAC5C,gBAAM,cAAc,KAAK,EAAE,SAAS,KAAK,IAAI,MAAM,gBAAgB,WAAW,MAAM,UAAS,CAAE;QACjG;MACF;IACF;EACF;AACA,SAAO;AACT;AAYA,SAAS,wBACP,gBACA,QACA,eACA,cACA,oBACA,kBAAyB;AAEzB,QAAM,uBAAuB,iBAAiB;AAC9C,QAAM,8BAA8B,wBAAwB,CAAC;AAC7D,QAAM,8BAA8B,sBAAsB;AAC1D,QAAM,8BAA8B,8BAA8B,CAAA,IAAK,mCAAmC,QAAQ,aAAa;AAC/H,QAAM,0BACJ,4BAA4B,WAAW,IACnC,CAAA,IACA,eAAe,eAAe,OAAO,CAAC,cAAc,cAAc,WAAW,2BAA2B,CAAC;AAC/G,QAAM,iBACJ,4BAA4B,WAAW,IACnC,eAAe,iBACf,eAAe,eAAe,OAAO,CAAC,cAAc,CAAC,cAAc,WAAW,2BAA2B,CAAC;AAChH,QAAM,mBAA4C,CAAA;AAClD,MAAI,wBAAwB,SAAS,GAAG;AACtC,UAAM,4BAA4B,kBAAkB,yBAAyB,gBAAgB;AAC7F,qBAAiB,eAAe;MAC9B,OAAO,wBAAwB;MAC/B,OAAO,0BAA0B;MACjC,iBAAiB,0BAA0B;MAC3C,aAAa,0BAA0B;;EAE3C;AACA,SAAO;IACL;IACA;IACA;IACA;IACA;IACA;IACA;;AAEJ;AAGA,SAAS,oBACP,OACA,sBACA,yBACA,qBACA,gBACA,wBACA,oBACA,WAAW,MAAI;AAEf,QAAM,OAAO,yBAAyB,OAAO,sBAAsB,gBAAgB,sBAAsB;AACzG,wBAAsB,IAAI;AAC1B,QAAM,6BAA6B,gCAAgC,KAAK,aAAa,QAAQ;AAC7F,QAAM,yBAAyB,4BAA4B,KAAK;AAChE,QAAM,WAAW,uBACf,MACA,sBACA,yBACA,qBACA,2BAA2B,aAC3B,uBAAuB,WAAW;AAGpC,QAAM,kBAAkB,qBAAqB,OAAO,oBAAoB;AACxE,QAAM,4BAA4B,cAChC,KAAK,gBAAgB,IAAI,CAAC,QAAQ,GAAG,IAAI,EAAE,IAAI,IAAI,OAAO,KAAK,GAAG,CAAC,EAAE,GACrE,eAAe;AAEjB,QAAM,+BAA+B,cACnC,KAAK,mBAAmB,IAAI,CAAC,QAAQ,GAAG,IAAI,EAAE,IAAI,IAAI,SAAS,IAAI,IAAI,aAAa,EAAE,GACtF,eAAe;AAEjB,QAAM,6BAA6B,cACjC,KAAK,iBAAiB,IAAI,CAAC,QAAQ,GAAG,IAAI,EAAE,IAAI,IAAI,MAAM,IAAI,IAAI,QAAQ,KAAK,GAAG,CAAC,EAAE,GACrF,eAAe;AAEjB,QAAM,mCAAmC,cAAc,2BAA2B,gBAAgB,eAAe;AACjH,QAAM,uCAAuC,cAAc,2BAA2B,oBAAoB,eAAe;AACzH,QAAM,+BAA+B,cAAc,uBAAuB,gBAAgB,eAAe;AACzG,QAAM,mCAAmC,cAAc,uBAAuB,oBAAoB,eAAe;AAEjH,QAAM,wBACH,2BAA2B,cAAc,KAAK,4BAA4B,WAC1E,uBAAuB,cAAc,KAAK,wBAAwB;AAErE,SAAO;IACL,OAAO;MACL,MAAM;MACN,QAAQ,wBACJ,UACA,SAAS,WAAW,IAClB,OACA;MACN,SAAS;QACP,sBAAsB,KAAK,YAAY;QACvC,oCAAoC,KAAK,gBAAgB;QACzD,mCAAmC,0BAA0B;QAC7D,6CAA6C,0BAA0B;QACvE,8BAA8B,KAAK,mBAAmB;QACtD,6BAA6B,6BAA6B;QAC1D,uCAAuC,6BAA6B;QACpE,8BAA8B;QAC9B,qBAAqB,KAAK,iBAAiB;QAC3C,oBAAoB,2BAA2B;QAC/C,8BAA8B,2BAA2B;QACzD,kCAAkC;QAClC,wBAAwB,2BAA2B;QACnD,6BAA6B,2BAA2B,eAAe;QACvE,2BAA2B,iCAAiC;QAC5D,qCAAqC,iCAAiC;QACtE,+BAA+B,qCAAqC;QACpE,yCAAyC,qCAAqC;QAC9E,8BAA8B;QAC9B,oBAAoB,uBAAuB;QAC3C,yBAAyB,uBAAuB,eAAe;QAC/D,uBAAuB,6BAA6B;QACpD,iCAAiC,6BAA6B;QAC9D,2BAA2B,iCAAiC;QAC5D,qCAAqC,iCAAiC;QACtE,+BAA+B,CAAC,GAAG,uBAAuB,6BAA6B;QACvF,qCAAqC,uBAAuB;QAC5D,sCAAsC;UACpC,GAAG,uBAAuB,qCAAqC;;QAEjE,4CACE,uBAAuB,4CAA4C;QACrE,kCAAkC,CAAC,GAAG,uBAAuB,qCAAqC,UAAU;QAC5G,wCACE,uBAAuB,4CAA4C;QACrE,qCAAqC,CAAC,GAAG,uBAAuB,qCAAqC,aAAa;QAClH,2CACE,uBAAuB,4CAA4C;;;IAGzE;IACA,uBAAuB,KAAK;;AAEhC;AAIA,eAAe,gBACb,OACA,eACA,QACA,cACA,oBACA,kBAAyB;AAEzB,QAAM,kBAAkB,MAAM,2BAA2B,OAAO,aAAa;AAC7E,QAAM,YAAY,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;AAC9D,QAAM,2BAA2B,CAAC,GAAG,IAAI,IAAI,gBAAgB,kBAAkB,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACjI,QAAM,iBAAiB,MAAM,6BAA6B,eAAe,YAAY;AACrF,QAAM,YAAY,wBAAwB,gBAAgB,QAAQ,eAAe,cAAc,oBAAoB,gBAAgB;AACnI,QAAM,gBAAgB,UAAU,eAAe,OAAO,CAAC,cAAc,CAAC,gBAAgB,mBAAmB,IAAI,SAAS,CAAC;AACvH,QAAM,mBAAmB,sBAAsB,eAAe,KAAK;AAInE,QAAM,uBAAuB,yBAAyB,0BAA0B,UAAU,cAAc;AACxG,QAAM,uBAAuB,IAAI,IAAI,qBAAqB,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,MAAM,cAAc,CAAC,CAAC;AAC5G,QAAM,sBAAsB,qBAAqB,OAAO,CAAC,UAAU,MAAM,mBAAmB,OAAO,EAAE;AACrG,QAAM,qBAA0C,gBAAgB,cAC7D,IAAI,CAAC,SAAS;IACb,GAAG;IACH,gBAAgB,qBAAqB,IAAI,IAAI,IAAI,KAAM;IACvD,EACD,KACC,CAAC,MAAM,UACL,KAAK,QAAQ,cAAc,MAAM,OAAO,KACxC,KAAK,KAAK,cAAc,MAAM,IAAI,KAClC,KAAK,UAAU,cAAc,MAAM,SAAS,CAAC;AAEnD,QAAM,WAAqB,CAAA;AAC3B,MAAI,UAAU,6BAA6B;AACzC,aAAS,KAAK,uDAAuD;EACvE;AACA,MAAI,yBAAyB,SAAS,GAAG;AACvC,aAAS,KAAK,uCAAuC,yBAAyB,MAAM,EAAE;EACxF;AACA,MAAI,cAAc,SAAS,GAAG;AAC5B,aAAS,KAAK,iCAAiC,cAAc,MAAM,EAAE;EACvE;AACA,QAAM,0BAA0B,CAAC,GAAG,gBAAgB,iBAAiB,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACtH,QAAM,mBAAmB,kBAAkB,yBAAyB,gBAAgB;AACpF,QAAM,oBAAoB,kBAAkB,0BAA0B,gBAAgB;AACtF,QAAM,qBAAqB,kBAAkB,eAAe,gBAAgB;AAC5E,QAAM,oCAAoC,kBACxC,iBAAiB,IAAI,CAAC,QAAQ,GAAG,IAAI,IAAI,IAAI,IAAI,cAAc,oBAAoB,IAAI,iBAAiB,MAAM,SAAS,EAAE,GACzH,gBAAgB;AAElB,QAAM,wBAAwB,mBAC1B,mBACA,kBAAkB,0BAA0B,gBAAgB,GAAG,KAAK,EAAE;AAC1E,QAAM,4BAA4B,kBAChC,wCAAwC,oBAAoB,GAC5D,gBAAgB;AAOlB,QAAM,wBAA+C,mBAAmB,IAAI,CAAC,SAAS;IACpF,SAAS,IAAI;IACb,MAAM,IAAI;IACV,WAAW,IAAI;IACf,gBAAgB,IAAI;IACpB;AACF,QAAM,YAAY,2BAA2B,uBAAuB,CAAC,OAAM;AACzE,UAAM,QAAQ,UAAU,IAAI,EAAE;AAC9B,WAAO,QAAQ,EAAE,MAAM,MAAM,MAAM,OAAO,MAAM,OAAO,QAAQ,MAAM,OAAM,IAAK;EAClF,CAAC;AAGD,QAAM,iBAAiB,mBACnB,YACA,kBAAkB,+BAA+B,SAAS,GAAG,KAAK,EAAE;AAExE,SAAO;IACL,OAAO;MACL,MAAM;MACN,QAAQ,SAAS,WAAW,IAAI,OAAO;MACvC,SAAS;QACP,gBAAgB;QAChB,qBAAqB,eAAe;QACpC,mBAAmB,eAAe;QAClC,yBAAyB,UAAU;QACnC,iCAAiC,UAAU;QAC3C,wCAAwC,UAAU,8BAC9C,2GACA;QACJ,uBAAuB,mBAAmB,SAAS;QACnD,yBAAyB;QACzB,uBAAuB,eAAe;QACtC,sBAAsB,UAAU;QAChC,gCAAgC;QAChC,gCAAgC,UAAU;QAC1C,4BAA4B,UAAU,wBAAwB;QAC9D,gBAAgB,UAAU,wBAAwB;QAClD,oBAAoB,UAAU;QAC9B,sBAAsB,gBAAgB,mBAAmB;QACzD,2BAA2B,wBAAwB;QACnD,2BAA2B,iBAAiB;QAC5C,qBAAqB,iBAAiB;QACtC,+BAA+B,iBAAiB;QAChD,qBAAqB,eAAe;QACpC,uBAAuB,eAAe;QACtC,iBAAiB,UAAU,eAAe;QAC1C,mBAAmB,UAAU,eAAe;QAC5C,yBAAyB,UAAU,eAAe;QAClD,4BAA4B,yBAAyB;QACrD,4BAA4B,kBAAkB;QAC9C,sBAAsB,kBAAkB;QACxC,gCAAgC,kBAAkB;QAClD,kCAAkC;QAClC,oCAAoC,yBAAyB,SAAS;QACtE,qCAAqC,0BAA0B;QAC/D,+CAA+C,0BAA0B;QACzE,gCAAgC,UAAU;QAC1C,0BAA0B;QAC1B,sBAAsB,cAAc;QACpC,sBAAsB,mBAAmB;QACzC,gBAAgB,mBAAmB;QACnC,0BAA0B,mBAAmB;QAC7C,+BAA+B,kCAAkC;QACjE,yCAAyC,kCAAkC;QAC3E,0BAA0B,iBAAiB;QAC3C,oBAAoB;;;IAGxB;IACA;;AAEJ;AAIA,eAAe,uBACb,QACA,OACA,oBAA2B;AAE3B,QAAM,EAAE,gBAAgB,mBAAmB,gBAAgB,iBAAiB,aAAY,IAAK,MAAM,iBACjG,QACA,KAAK;AAEP,QAAM,WAAqB,CAAA;AAC3B,MAAI,eAAe,SAAS,GAAG;AAC7B,aAAS,KAAK,0CAA0C,eAAe,MAAM,EAAE;EACjF;AACA,MAAI,kBAAkB,SAAS,GAAG;AAChC,aAAS,KAAK,6CAA6C,kBAAkB,MAAM,EAAE;EACvF;AACA,MAAI,eAAe,SAAS,GAAG;AAC7B,aAAS,KAAK,0CAA0C,eAAe,MAAM,EAAE;EACjF;AACA,MAAI,gBAAgB,SAAS,GAAG;AAC9B,aAAS,KAAK,2CAA2C,gBAAgB,MAAM,EAAE;EACnF;AACA,QAAM,kBAAkB,qBAAqB,OAAO,oBAAoB;AACxE,QAAM,oBAAoB,cAAc,cAAc,eAAe;AACrE,SAAO;IACL,OAAO;MACL,MAAM;MACN,QAAQ,SAAS,WAAW,IAAI,OAAO;MACvC,SAAS;QACP,eAAe,MAAM;QACrB,qBAAqB,aAAa;QAClC,eAAe,kBAAkB;QACjC,yBAAyB,kBAAkB;QAC3C,QAAQ;UACN,iBAAiB,eAAe;UAChC,oBAAoB,kBAAkB;UACtC,iBAAiB,eAAe;UAChC,kBAAkB,gBAAgB;;;;IAIxC;;AAEJ;AAIA,SAAS,6BAA6B,SAAiB,cAAsB,SAAe;AAC1F,QAAM,oBAAoB,QAAQ,KAAI,EAAG,WAAW,QAAQ,GAAG;AAC/D,QAAM,iBAAiB,kBAAkB,SAAS,MAAM,GAAG,kBAAkB,MAAM,GAAG,GAAG,CAAC,QAAQ;AAClG,SAAO,GAAG,OAAO,IAAI,YAAY,IAAI,cAAc;AACrD;AAIA,SAAS,4BACP,OACA,UACA,oBAA2B;AAE3B,QAAM,WAAW,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,KAAK,GAAG,YAAW,CAAE,CAAC;AACnE,MAAI,wBAAwB;AAC5B,MAAI,sBAAsB;AAC1B,QAAM,kBAAkB,oBAAI,IAAG;AAC/B,QAAM,qBAA+B,CAAA;AAErC,aAAW,QAAQ,OAAO;AACxB,eAAW,cAAc,KAAK,SAAS,CAAA,GAAI;AACzC,UAAI,OAAO,WAAW,YAAY,YAAY,WAAW,QAAQ,KAAI,EAAG,WAAW,GAAG;AACpF;MACF;AACA,+BAAyB;AACzB,YAAM,gBAAgB,sCAAsC,WAAW,SAAS,QAAQ;AACxF,UAAI,cAAc,WAAW,GAAG;AAC9B;MACF;AACA,6BAAuB,cAAc;AACrC,iBAAW,gBAAgB,eAAe;AACxC,wBAAgB,IAAI,YAAY;AAChC,YAAI,CAAC,SAAS,IAAI,aAAa,YAAW,CAAE,GAAG;AAC7C,6BAAmB,KAAK,6BAA6B,KAAK,IAAI,cAAc,WAAW,OAAO,CAAC;QACjG;MACF;IACF;EACF;AAEA,QAAM,2BAA2B,CAAC,GAAG,IAAI,IAAI,kBAAkB,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACjH,QAAM,aAAa,CAAC,GAAG,IAAI,IAAI,yBAAyB,IAAI,CAAC,QAAQ,IAAI,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,EAC3F,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC,EAClC,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AAClD,QAAM,WACJ,yBAAyB,SAAS,IAAI,CAAC,4CAA4C,yBAAyB,MAAM,EAAE,IAAI,CAAA;AAC1H,QAAM,kBAAkB,qBAAqB,OAAO,oBAAoB;AACxE,QAAM,iBAAiB,cAAc,0BAA0B,eAAe;AAC9E,QAAM,uBAAuB,cAAc,YAAY,eAAe;AACtE,QAAM,4BAA4B,cAChC,CAAC,GAAG,eAAe,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC,GACpE,eAAe;AAGjB,SAAO;IACL,OAAO;MACL,MAAM;MACN,QAAQ,SAAS,WAAW,IAAI,OAAO;MACvC,SAAS;QACP,eAAe,MAAM;QACrB,yBAAyB;QACzB,yBAAyB;QACzB,gCAAgC,gBAAgB;QAChD,0BAA0B,0BAA0B;QACpD,oCAAoC,0BAA0B;QAC9D,8BAA8B,yBAAyB;QACvD,oBAAoB,WAAW;QAC/B,cAAc,qBAAqB;QACnC,wBAAwB,qBAAqB;QAC7C,4BAA4B,eAAe;QAC3C,sCAAsC,eAAe;;;IAGzD;;AAEJ;AAIA,SAAS,wBACP,OACA,oBAA2B;AAE3B,QAAM,OAAO,uBACX,MAAM,IAAI,CAAC,UAAU,EAAE,KAAK,KAAK,IAAI,SAAS,2BAA2B,IAAI,EAAC,EAAG,CAAC;AAEpF,QAAM,WAAqB,CAAA;AAC3B,MAAI,KAAK,SAAS,SAAS,GAAG;AAC5B,aAAS,KAAK,0CAA0C,KAAK,SAAS,MAAM,EAAE;EAChF;AACA,MAAI,KAAK,MAAM,SAAS,GAAG;AACzB,aAAS,KAAK,uCAAuC,KAAK,MAAM,MAAM,EAAE;EAC1E;AACA,QAAM,kBAAkB,qBAAqB,OAAO,oBAAoB;AACxE,QAAM,qBAAqB,cAAc,KAAK,UAAU,eAAe;AACvE,QAAM,kBAAkB,cAAc,KAAK,OAAO,eAAe;AAKjE,QAAM,SAAyB,KAAK,MAAM,SAAS,IAAI,UAAU,KAAK,SAAS,SAAS,IAAI,SAAS;AACrG,SAAO;IACL,OAAO;MACL,MAAM;MACN;MACA,SAAS;QACP,eAAe,MAAM;QACrB,wBAAwB;QACxB,sBAAsB,KAAK,SAAS;QACpC,gBAAgB,mBAAmB;QACnC,0BAA0B,mBAAmB;QAC7C,mBAAmB,KAAK,MAAM;QAC9B,aAAa,gBAAgB;QAC7B,uBAAuB,gBAAgB;;;IAG3C;;AAEJ;AAGA,IAAM,4BAA4B;AAUlC,eAAe,iBAAiB,KAAwB,QAAqB;AAC3E,UAAQ,IAAI,MAAM;IAChB,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK,gBAAgB;AACnB,YAAM,EAAE,UAAS,IAAK,MAAM,OAAO,sBAAa;AAChD,YAAM,gBAAyC,EAAE,SAAS,0BAAyB;AACnF,UAAI,IAAI,SAAS,kBAAkB;AACjC,sBAAc,aAAa,IAAI;MACjC,WAAW,IAAI,SAAS,oBAAoB;AAC1C,sBAAc,cAAc,IAAI;MAClC,WAAW,IAAI,SAAS,gBAAgB;AACtC,sBAAc,mBAAmB,IAAI;MACvC,WAAW,IAAI,SAAS,YAAY;AAClC,sBAAc,SAAS,IAAI;MAC7B,OAAO;AACL,sBAAc,QAAQ,CAAC,QAAQ;MACjC;AACA,YAAM,UAAU,IAAI,SAAS,eAAe,MAAM;AAClD;IACF;IACA,KAAK,mBAAmB;AACtB,YAAM,IAAI,MAAM,qCAAqC,IAAI,IAAI,EAAE;IACjE;IACA,KAAK,kBAAkB;AACrB,YAAM,IAAI,MAAM,qCAAqC,IAAI,IAAI,EAAE;IACjE;EACF;AACF;AAGA,SAAS,cAAc,KAAsB;AAC3C,MAAI,IAAI,SAAS,qBAAqB,IAAI,SAAS,kBAAkB;AACnE,WAAO;EACT;AACA,SAAO,GAAG,IAAI,IAAI,IAAI,IAAI,OAAO;AACnC;AAGA,eAAe,mBAAmB,YAAiC,QAAqB;AAItF,QAAM,UAA+B,CAAA;AACrC,QAAM,SAA4D,CAAA;AAClE,QAAM,eAAe,oBAAI,IAAG;AAE5B,aAAW,OAAO,YAAY;AAC5B,UAAM,WAAW,cAAc,GAAG;AAClC,QAAI,aAAa,MAAM;AACrB,UAAI;AACF,cAAM,iBAAiB,KAAK,MAAM;AAClC,gBAAQ,KAAK,GAAG;MAClB,SAAS,OAAO;AACd,eAAO,KAAK,EAAE,KAAK,MAAK,CAAE;MAC5B;AACA;IACF;AACA,UAAM,WAAW,aAAa,IAAI,QAAQ;AAC1C,QAAI,UAAU;AACZ,eAAS,KAAK,GAAG;IACnB,OAAO;AACL,mBAAa,IAAI,UAAU,CAAC,GAAG,CAAC;IAClC;EACF;AAEA,aAAW,SAAS,aAAa,OAAM,GAAI;AACzC,UAAM,QAAQ,MAAM,CAAC;AAErB,QAAI,CAAC,OAAO;AACV;IACF;AACA,UAAM,SAAS,MACZ,IAAI,CAAC,QAAQ,IAAI,IAAI,EACrB,OAAO,CAAC,UAA2B,OAAO,UAAU,YAAY,MAAM,SAAS,CAAC;AACnF,QAAI;AACF,UAAI,MAAM,SAAS,mBAAmB;AACpC,cAAM,EAAE,SAAQ,IAAK,MAAM,OAAO,qBAAY;AAC9C,cAAM,SAAS,MAAM,SAAS,EAAE,QAAQ,SAAS,0BAAyB,GAAI,MAAM;MACtF,OAAO;AACL,cAAM,EAAE,QAAO,IAAK,MAAM,OAAO,oBAAW;AAC5C,cAAM,QAAQ,MAAM,SAAS,EAAE,QAAQ,SAAS,0BAAyB,GAAI,MAAM;MACrF;AACA,cAAQ,KAAK,GAAG,KAAK;IACvB,SAAS,OAAO;AACd,aAAO,KAAK,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,KAAK,MAAK,EAAG,CAAC;IACrD;EACF;AAEA,SAAO,EAAE,SAAS,OAAM;AAC1B;AAGO,IAAM,2BAA2B;EACtC;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;AAeF,SAAS,oBACP,OACA,OACA,iBAAwB;AAExB,MAAI,iBAAiB;AACnB,2BAAuB,MAAM,OAAO,MAAM,QAAQ;EACpD;AACA,QAAM,OAAO,KAAK,MAAM,KAAK;AAC7B,QAAM,SAAS,KAAK,GAAG,MAAM,QAAQ;AACvC;AAEA,eAAe,+BAA+B,QAe7C;AACC,QAAM,QAAqC;IACzC,QAAQ,CAAA;IACR,UAAU,CAAC,GAAG,OAAO,eAAe;IACpC,yBAAyB,CAAA;IACzB,sBAAsB,CAAA;IACtB,wBAAwB,CAAA;IACxB,uBAAuB,CAAA;IACvB,oBAAoB,CAAA;;AAEtB,QAAM,kBAAkB,OAAO,QAAQ,aAAa;AACpD,QAAM,kBACJ,OAAO,QAAQ,uBAAuB,QAAQ,OAAO,QAAQ,mBAAmB,QAAQ,OAAO,OAAO,SAAS;AACjH,MAAI,OAAO,gBAAgB,IAAI,UAAU,GAAG;AAC1C,UAAM,QAAQ,mBAAmB,OAAO,OAAO,OAAO,gBAAgB,OAAO,gBAAgB,eAAe;AAC5G,UAAM,0BAA0B,MAAM;AACtC,UAAM,uBAAuB,MAAM;AACnC,wBAAoB,OAAO,OAAO,eAAe;EACnD;AACA,MAAI,OAAO,gBAAgB,IAAI,YAAY,GAAG;AAC5C,UAAM,QAAQ,qBAAqB,OAAO,OAAO,OAAO,gBAAgB,eAAe;AACvF,UAAM,yBAAyB,MAAM;AACrC,wBAAoB,OAAO,OAAO,eAAe;EACnD;AACA,MAAI,OAAO,gBAAgB,IAAI,WAAW,GAAG;AAC3C,UAAM,QAAQ,oBACZ,OAAO,OACP,QAAQ,OAAO,QAAQ,kBAAkB,GACzC,OAAO,yBACP,OAAO,qBACP,OAAO,gBACP,OAAO,wBACP,iBACA,OAAO,SAAS,SAAS;AAE3B,UAAM,wBAAwB,MAAM;AACpC,wBAAoB,OAAO,OAAO,eAAe;EACnD;AACA,MAAI,OAAO,gBAAgB,IAAI,OAAO,GAAG;AACvC,UAAM,QAAQ,MAAM,gBAClB,OAAO,OACP,OAAO,eACP,OAAO,QACP,OAAO,cACP,QAAQ,OAAO,QAAQ,kBAAkB,GACzC,QAAQ,OAAO,QAAQ,gBAAgB,CAAC;AAE1C,UAAM,qBAAqB,MAAM;AACjC,wBAAoB,OAAO,OAAO,eAAe;EACnD;AACA,MAAI,OAAO,gBAAgB,IAAI,oBAAoB,GAAG;AACpD,wBACE,OACA,4BAA4B,OAAO,OAAO,OAAO,SAAS,WAAW,eAAe,GACpF,eAAe;EAEnB;AACA,MAAI,OAAO,gBAAgB,IAAI,eAAe,GAAG;AAC/C,wBAAoB,OAAO,MAAM,uBAAuB,OAAO,QAAQ,OAAO,OAAO,eAAe,GAAG,eAAe;EACxH;AACA,MAAI,OAAO,gBAAgB,IAAI,gBAAgB,GAAG;AAChD,wBAAoB,OAAO,wBAAwB,OAAO,OAAO,eAAe,GAAG,eAAe;EACpG;AACA,SAAO;AACT;AAEA,SAAS,kBACP,SACA,OACA,UAAgC;AAEhC,QAAM,UAA+B,CAAA;AACrC,MAAI,QAAQ,YAAY,MAAM;AAC5B,YAAQ,KAAK,GAAG,6BAA6B,MAAM,uBAAuB,CAAC;AAC3E,YAAQ,KAAK,GAAG,4BAA4B,MAAM,sBAAsB,CAAC;AACzE,YAAQ,KAAK,GAAG,0BAA0B,MAAM,sBAAsB,SAAS,WAAW,yBAAyB,CAAC;AACpH,YAAQ,KAAK,GAAG,wBAAwB,MAAM,qBAAqB,CAAC;EACtE;AACA,MAAI,QAAQ,iBAAiB,MAAM;AACjC,YAAQ,KAAK,GAAG,wBAAwB,MAAM,kBAAkB,CAAC;EACnE;AACA,SAAO;AACT;AAGA,eAAe,0BACb,SACA,OACA,UACA,kBACA,QAAqB;AAErB,MAAI,QAAQ,YAAY,QAAQ,QAAQ,iBAAiB,MAAM;AAC7D,WAAO;EACT;AACA,QAAM,UAAU,kBAAkB,SAAS,OAAO,QAAQ;AAC1D,QAAM,EAAE,YAAY,MAAK,IAAK,sBAAsB,SAAS,gBAAgB;AAC7E,QAAM,SAAS,QAAQ,WAAW;AAClC,QAAM,iBAAiD,CAAA;AACvD,QAAM,gBAAgD,CAAA;AACtD,MAAI,CAAC,QAAQ;AACX,UAAM,UAAU,MAAM,mBAAmB,YAAY,MAAM;AAC3D,mBAAe,KAAK,GAAG,QAAQ,QAAQ,IAAI,cAAc,CAAC;AAC1D,kBAAc,KACZ,GAAG,QAAQ,OAAO,IAAI,CAAC,EAAE,KAAK,MAAK,OAAQ;MACzC,GAAG,eAAe,GAAG;MACrB,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;MAC5D,CAAC;EAEP;AACA,SAAO;IACL,MAAM,SAAS,YAAY;IAC3B,UAAU,QAAQ,YAAY;IAC9B,eAAe,QAAQ,iBAAiB;IACxC,oBAAoB,CAAC,GAAG,gBAAgB,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;IACzF,eAAe,QAAQ;IACvB,eAAe,eAAe;IAC9B,aAAa,MAAM;IACnB,cAAc,cAAc;IAC5B,eAAe,QAAQ,IAAI,cAAc;IACzC,eAAe;IACf,aAAa,MAAM,IAAI,CAAC,SAAS;MAC/B,GAAG,eAAe,GAAG;MACrB,WAAW,qCAAqC,IAAI,IAAI;MACxD;IACF,cAAc;;AAElB;AAOA,eAAsB,YAAY,SAAiC,QAAqB;AACtF,QAAM,iBAAiB,QAAQ,YAAY,QAAQ,QAAQ,iBAAiB;AAC5E,MAAI,QAAQ,WAAW,QAAQ,CAAC,gBAAgB;AAC9C,UAAM,IAAI,WACR,6FACA,UAAU,KAAK;EAEnB;AACA,MAAI,QAAQ,aAAa,UAAa,QAAQ,SAAS,SAAS,KAAK,QAAQ,YAAY,MAAM;AAC7F,UAAM,IAAI,WAAW,oCAAoC,UAAU,KAAK;EAC1E;AAEA,QAAM,mBAAmB,wBAAwB,QAAQ,QAAQ;AACjE,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAI,OAAO,IAAI;AACvD,MAAI,CAAE,MAAM,WAAW,gBAAgB,MAAM,CAAC,GAAI;AAChD,UAAM,IAAI,WAAW,iCAAiC,MAAM,wBAAwB,UAAU,SAAS;EACzG;AAEA,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,iBAAiB,6BAA6B,SAAS,MAAM;AACnE,QAAM,eAAe,wBAAwB,UAAU,gCAA+B,CAAE;AACxF,QAAM,mBAA6B,CAAA;AACnC,QAAM,QAAQ,MAAM,2BAClB,QACA,SAAS,aACT,aAAa,gBACb,kBACA,SAAS,MAAM;AAEjB,QAAM,kBAAkB,uBAAuB,OAAO;AACtD,QAAM,wBACJ,OAAO,QAAQ,oBAAoB,WAAW,WAAW;AAC3D,QAAM,kBAAkB,+BACtB,OAAO,QAAQ,oBAAoB,WAAW,QAAQ,kBAAkB,SAAS,WAAW,gBAAgB;AAE9G,QAAM,iBAAiB,8BACrB,iBACA,uBACA,SAAS,WAAW,wBAAwB;AAE9C,QAAM,yBAAyB,8BAA8B,QAAQ;AACrE,QAAM,0BAA0B,+BAA+B,QAAQ,uBAAuB;AAC9F,QAAM,sBAAsB,2BAA2B,QAAQ,mBAAmB;AAClF,QAAM,eAAe,oBAAoB,QAAQ,QAAQ;AACzD,QAAM,gBAAgB,qBAAqB,MAAM;AACjD,QAAM,QAAQ,MAAM,+BAA+B;IACjD;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA,iBAAiB,CAAC,GAAG,IAAI,IAAI,gBAAgB,CAAC;GAC/C;AAOD,QAAM,QAAQ,iBACV,MAAM,0BAA0B,SAAS,OAAO,UAAU,kBAAkB,MAAM,IAClF;AAEJ,QAAM,qBAAqB,CAAC,GAAG,IAAI,IAAI,MAAM,QAAQ,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACvG,QAAM,YAAY,MAAM,OAAO,KAAK,CAAC,UAAU,MAAM,WAAW,OAAO;AACvE,SAAO;IACL,IAAI,CAAC;IACL,cAAc,mBAAmB,SAAS;IAC1C,QAAQ,MAAM;IACd,UAAU;IACV,GAAI,UAAU,SAAY,EAAE,MAAK,IAAK,CAAA;IACtC,cAAc,OAAM;;AAExB","debugId":"0642e966-0611-51ff-ad2f-1a0d7416c80b"}