@unbrained/pm-cli 2026.7.6 → 2026.7.7

package/dist/cli-bundle/chunks/chunk-3VHSI5FL.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../../../../../core/item/status-filter.ts","../../../../../../../../core/schema/runtime-field-filters.ts","../../../../../../../../cli/commands/list.ts"],"sourcesContent":["/**\n * @module core/item/status-filter\n *\n * Defines item parsing, formatting, and lifecycle helpers for Status Filter.\n */\nimport { EXIT_CODE } from \"../shared/constants.js\";\nimport { PmCliError } from \"../shared/errors.js\";\nimport { levenshteinDistanceWithinLimit } from \"../shared/levenshtein.js\";\nimport type { RuntimeStatusRegistry } from \"../schema/runtime-schema.js\";\nimport type { ItemStatus } from \"../../types/index.js\";\nimport { normalizeStatusInput } from \"./status.js\";\n\n// Workflow-group aliases shared by every status-filter consumer so that the\n// agent-friendly `open`/`closed`/`canceled` shorthands resolve to whatever the\n// runtime workflow has configured as its open/close/cancel anchors, rather than\n// hardcoding the built-in status ids. `cancelled` is accepted as a spelling\n// variant of `canceled`.\nconst STATUS_GROUP_ALIASES: Readonly<Record<string, \"open_status\" | \"close_status\" | \"canceled_status\">> = {\n  open: \"open_status\",\n  closed: \"close_status\",\n  canceled: \"canceled_status\",\n  cancelled: \"canceled_status\",\n};\n\nconst STATUS_ALL_SENTINEL = \"all\";\n\n/** Return true when a status-filter input is the standalone all-status sentinel. */\nexport function isStatusAllFilterInput(raw: unknown): boolean {\n  if (typeof raw !== \"string\") {\n    return false;\n  }\n  const tokens = raw\n    .split(\",\")\n    .map((entry) => entry.trim().toLowerCase())\n    .filter((entry) => entry.length > 0);\n  return tokens.length === 1 && tokens[0] === STATUS_ALL_SENTINEL;\n}\n\n/**\n * Resolve a single status-filter token to a concrete runtime status id.\n *\n * Returns `undefined` when the token is not a recognized workflow-group alias\n * (open/closed/canceled) and does not normalize to a known registry status.\n * Callers decide whether an unrecognized token is an error (strict mode) or is\n * passed through verbatim (lenient mode) — see {@link parseStatusFilterCsv}.\n */\nexport function resolveStatusFilterToken(\n  token: string,\n  registry: RuntimeStatusRegistry,\n): ItemStatus | undefined {\n  const trimmed = token.trim().toLowerCase();\n  if (trimmed.length === 0) {\n    return undefined;\n  }\n  const group = STATUS_GROUP_ALIASES[trimmed];\n  if (group) {\n    return registry[group] as ItemStatus;\n  }\n  return normalizeStatusInput(token, registry);\n}\n\nfunction collectStatusSuggestionCandidates(registry: RuntimeStatusRegistry): string[] {\n  const candidates = new Set<string>(Object.keys(STATUS_GROUP_ALIASES));\n  for (const definition of registry.definitions) {\n    candidates.add(definition.id);\n    for (const alias of definition.aliases) {\n      candidates.add(alias);\n    }\n  }\n  return [...candidates];\n}\n\nfunction suggestClosestStatus(value: string, registry: RuntimeStatusRegistry): string | undefined {\n  // Only ever called for an unresolved, already-non-empty token (parseStatusFilterCsv\n  // filters blanks first), so no empty-input guard is needed here.\n  const normalized = value.trim().toLowerCase();\n  let best: string | undefined;\n  let bestDistance = Number.POSITIVE_INFINITY;\n  for (const candidate of collectStatusSuggestionCandidates(registry)) {\n    const distance = levenshteinDistanceWithinLimit(normalized, candidate.toLowerCase(), 2);\n    if (distance !== null && distance < bestDistance) {\n      best = candidate;\n      bestDistance = distance;\n    }\n  }\n  return best;\n}\n\n/**\n * Documents the parse status filter options payload exchanged by command, SDK, and package integrations.\n */\nexport interface ParseStatusFilterOptions {\n  /**\n   * When true, an unrecognized token throws a USAGE error with a did-you-mean\n   * hint. When false (default), an unrecognized token is passed through\n   * verbatim so custom/unknown statuses still compare against item values by\n   * their raw string — preserving the long-standing lenient `pm list` behavior.\n   */\n  strict?: boolean;\n  /** Flag label used in error messages (default: \"--status\"). */\n  flagLabel?: string;\n}\n\n/**\n * Parse a comma-separated status filter into a de-duplicated list of concrete\n * status ids. A standalone `all` sentinel intentionally resolves to no filter\n * so duplicate-discovery loops can search every lifecycle bucket with the same\n * `--status` flag shape. Shared by `pm list` (lenient) and `pm search`\n * (strict, with a did-you-mean hint on typos) so both surfaces resolve the\n * open/closed/canceled workflow-group aliases identically.\n */\nexport function parseStatusFilterCsv(\n  raw: unknown,\n  registry: RuntimeStatusRegistry,\n  options?: ParseStatusFilterOptions,\n): ItemStatus[] | undefined {\n  if (typeof raw !== \"string\") {\n    return undefined;\n  }\n  const strict = options?.strict === true;\n  const flagLabel = options?.flagLabel ?? \"--status\";\n  const tokens = raw\n    .split(\",\")\n    .map((entry) => entry.trim())\n    .filter((entry) => entry.length > 0);\n  if (tokens.length === 0) {\n    return undefined;\n  }\n  const allTokenCount = tokens.filter((token) => token.trim().toLowerCase() === STATUS_ALL_SENTINEL).length;\n  if (allTokenCount > 0) {\n    if (tokens.length === 1) {\n      return undefined;\n    }\n    throw new PmCliError(\n      `Invalid ${flagLabel} value \"all\". Use it by itself, or omit ${flagLabel} to search every status.`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  const resolved: ItemStatus[] = [];\n  for (const token of tokens) {\n    const status = resolveStatusFilterToken(token, registry);\n    if (status === undefined) {\n      if (strict) {\n        const suggestion = suggestClosestStatus(token, registry);\n        throw new PmCliError(\n          `Invalid ${flagLabel} value \"${token}\". Use open|closed|canceled or a configured status id${\n            suggestion ? `. Did you mean \"${suggestion}\"?` : \".\"\n          }`,\n          EXIT_CODE.USAGE,\n        );\n      }\n      resolved.push(token as ItemStatus);\n      continue;\n    }\n    resolved.push(status);\n  }\n  return [...new Set(resolved)];\n}\n","/**\n * @module core/schema/runtime-field-filters\n *\n * Resolves configurable schema, fields, statuses, and workflows for Runtime Field Filters.\n */\nimport { coerceRuntimeFieldValue, readRuntimeFieldOptionValue } from \"./runtime-field-values.js\";\nimport type { RuntimeFieldCommand, RuntimeFieldRegistry } from \"./runtime-schema.js\";\nimport { stableValueEquals } from \"../shared/serialization.js\";\n\nfunction valuesEqual(left: unknown, right: unknown): boolean {\n  return stableValueEquals(left, right);\n}\n\n/**\n * Implements collect runtime filter values for the public runtime surface of this module.\n */\nexport function collectRuntimeFilterValues(\n  options: Record<string, unknown>,\n  fieldRegistry: RuntimeFieldRegistry,\n  command: RuntimeFieldCommand,\n): Record<string, unknown> {\n  const filters: Record<string, unknown> = {};\n  for (const definition of fieldRegistry.command_to_fields.get(command) ?? []) {\n    const rawValue = readRuntimeFieldOptionValue(options, definition);\n    if (rawValue === undefined) {\n      continue;\n    }\n    filters[definition.metadata_key] = coerceRuntimeFieldValue(definition, rawValue);\n  }\n  return filters;\n}\n\n/**\n * Implements matches runtime filters for the public runtime surface of this module.\n */\nexport function matchesRuntimeFilters(item: Record<string, unknown>, filters: Record<string, unknown>): boolean {\n  for (const [fieldKey, expectedValue] of Object.entries(filters)) {\n    const actualValue = item[fieldKey];\n    if (Array.isArray(expectedValue)) {\n      if (Array.isArray(actualValue)) {\n        const normalizedActual = actualValue.map((value) => String(value));\n        const normalizedExpected = expectedValue.map((value) => String(value));\n        if (!normalizedExpected.every((value) => normalizedActual.includes(value))) {\n          return false;\n        }\n        continue;\n      }\n      if (!valuesEqual(actualValue, expectedValue[expectedValue.length - 1])) {\n        return false;\n      }\n      continue;\n    }\n    if (!valuesEqual(actualValue, expectedValue)) {\n      return false;\n    }\n  }\n  return true;\n}\n","/**\n * @module cli/commands/list\n *\n * Implements the pm list command surface and its agent-facing runtime behavior.\n */\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport { toItemRecord } from \"../../core/item/item-record.js\";\nimport { isTerminalStatus } from \"../../core/item/status.js\";\nimport { isStatusAllFilterInput, parseStatusFilterCsv } from \"../../core/item/status-filter.js\";\nimport { resolveItemTypeRegistry, type ItemTypeRegistry } from \"../../core/item/type-registry.js\";\nimport { parseIntegerLimit, parsePriority, parseType } from \"../shared-parsers.js\";\nimport { collectRuntimeFilterValues, matchesRuntimeFilters } from \"../../core/schema/runtime-field-filters.js\";\nimport {\n  hasMissingMetadataFilter,\n  itemMatchesMissingMetadata,\n  lifecycleClassifierFromStatusRegistry,\n  type MissingMetadataFilters,\n} from \"../../core/governance/metadata-coverage.js\";\nimport {\n  contentFiltersNeedBody,\n  contentFiltersNeedCollections,\n  hasContentFieldFilter,\n  itemMatchesContentFilters,\n  type ContentField,\n  type ContentFieldFilters,\n} from \"../../core/governance/content-fields.js\";\nimport {\n  resolveRuntimeFieldRegistry,\n  resolveRuntimeStatusRegistry,\n  type RuntimeStatusRegistry,\n} from \"../../core/schema/runtime-schema.js\";\nimport { EXIT_CODE, FRONT_MATTER_KEY_ORDER } from \"../../core/shared/constants.js\";\nimport type { GlobalOptions } from \"../../core/shared/command-types.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { compareTimestampStrings, nowIso, resolveIsoOrRelative } from \"../../core/shared/time.js\";\nimport { listAllFrontMatter, listAllFrontMatterLight, listAllFrontMatterWithBody } from \"../../core/store/item-store.js\";\nimport { HEAVY_METADATA_KEYS } from \"../../core/store/front-matter-cache.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport type { ItemFrontMatter, ItemStatus, ItemType } from \"../../types/index.js\";\nimport type { SharedItemFilterOptions } from \"./item-filter-options.js\";\n\n/**\n * Documents the list options payload exchanged by command, SDK, and package integrations.\n */\nexport interface ListOptions extends SharedItemFilterOptions {\n  ids?: string;\n  assigneeFilter?: string;\n  limit?: string;\n  offset?: string;\n  noTruncate?: boolean;\n  includeBody?: boolean;\n  compact?: boolean;\n  brief?: boolean;\n  full?: boolean;\n  fields?: string;\n  sort?: string;\n  order?: string;\n  tree?: boolean;\n  treeDepth?: string;\n  excludeTerminal?: boolean;\n  filterAcMissing?: boolean;\n  filterEstimatesMissing?: boolean;\n  filterResolutionMissing?: boolean;\n  filterMetadataMissing?: boolean;\n}\n\n/** Extract the missing-metadata selection filters from list/update-many options. */\nexport function resolveMissingMetadataFilters(options: {\n  filterAcMissing?: boolean;\n  filterEstimatesMissing?: boolean;\n  filterResolutionMissing?: boolean;\n  filterMetadataMissing?: boolean;\n  filterReviewerMissing?: boolean;\n  filterRiskMissing?: boolean;\n  filterConfidenceMissing?: boolean;\n  filterSprintMissing?: boolean;\n  filterReleaseMissing?: boolean;\n}): MissingMetadataFilters {\n  return {\n    acMissing: options.filterAcMissing === true,\n    estimatesMissing: options.filterEstimatesMissing === true,\n    resolutionMissing: options.filterResolutionMissing === true,\n    metadataMissing: options.filterMetadataMissing === true,\n    reviewerMissing: options.filterReviewerMissing === true,\n    riskMissing: options.filterRiskMissing === true,\n    confidenceMissing: options.filterConfidenceMissing === true,\n    sprintMissing: options.filterSprintMissing === true,\n    releaseMissing: options.filterReleaseMissing === true,\n  };\n}\n\n/** Per content field: the present flag and the absence flag on the options shape. */\ninterface ContentFieldFlagMapping {\n  field: ContentField;\n  presentKey: string;\n  absentKey: string;\n  /** Human flag names used in the conflict error message. */\n  presentFlag: string;\n  absentFlag: string;\n}\n\nconst CONTENT_FIELD_FLAG_MAPPINGS: readonly ContentFieldFlagMapping[] = [\n  { field: \"notes\", presentKey: \"hasNotes\", absentKey: \"noNotes\", presentFlag: \"--has-notes\", absentFlag: \"--no-notes\" },\n  { field: \"learnings\", presentKey: \"hasLearnings\", absentKey: \"noLearnings\", presentFlag: \"--has-learnings\", absentFlag: \"--no-learnings\" },\n  { field: \"files\", presentKey: \"hasFiles\", absentKey: \"noFiles\", presentFlag: \"--has-files\", absentFlag: \"--no-files\" },\n  { field: \"docs\", presentKey: \"hasDocs\", absentKey: \"noDocs\", presentFlag: \"--has-docs\", absentFlag: \"--no-docs\" },\n  { field: \"tests\", presentKey: \"hasTests\", absentKey: \"noTests\", presentFlag: \"--has-tests\", absentFlag: \"--no-tests\" },\n  { field: \"comments\", presentKey: \"hasComments\", absentKey: \"noComments\", presentFlag: \"--has-comments\", absentFlag: \"--no-comments\" },\n  { field: \"deps\", presentKey: \"hasDeps\", absentKey: \"noDeps\", presentFlag: \"--has-deps\", absentFlag: \"--no-deps\" },\n  { field: \"body\", presentKey: \"hasBody\", absentKey: \"emptyBody\", presentFlag: \"--has-body\", absentFlag: \"--empty-body\" },\n  { field: \"linked_command\", presentKey: \"hasLinkedCommand\", absentKey: \"noLinkedCommand\", presentFlag: \"--has-linked-command\", absentFlag: \"--no-linked-command\" },\n] as const;\n\n/**\n * Resolve the content-field presence/absence selections from list/search\n * options. A field requested both present AND absent is a usage error (the two\n * selections are mutually exclusive). Returns an empty object when no\n * content-field filter is active.\n */\nexport function resolveContentFieldFilters(options: Record<string, unknown>): ContentFieldFilters {\n  const filters: ContentFieldFilters = {};\n  for (const mapping of CONTENT_FIELD_FLAG_MAPPINGS) {\n    const present = options[mapping.presentKey] === true;\n    const absent = options[mapping.absentKey] === true;\n    if (present && absent) {\n      throw new PmCliError(\n        `Cannot combine ${mapping.presentFlag} with ${mapping.absentFlag} for the same field.`,\n        EXIT_CODE.USAGE,\n      );\n    }\n    if (present) {\n      filters[mapping.field] = \"present\";\n    } else if (absent) {\n      filters[mapping.field] = \"absent\";\n    }\n  }\n  return filters;\n}\n\n/**\n * Restricts listed item values accepted by command, SDK, and storage contracts.\n */\nexport type ListedItem = ItemFrontMatter | (ItemFrontMatter & { body: string });\n\ntype ListProjectionMode = \"full\" | \"compact\" | \"fields\";\n\ninterface ListProjectionConfig {\n  mode: ListProjectionMode;\n  fields: string[];\n}\n\nexport const LIST_SORT_FIELDS = [\"priority\", \"deadline\", \"updated_at\", \"created_at\", \"title\", \"parent\"] as const;\n/**\n * Restricts list sort field values accepted by command, SDK, and storage contracts.\n */\nexport type ListSortField = (typeof LIST_SORT_FIELDS)[number];\n\nexport const LIST_SORT_ORDER_VALUES = [\"asc\", \"desc\"] as const;\n/**\n * Restricts list sort order values accepted by command, SDK, and storage contracts.\n */\nexport type ListSortOrder = (typeof LIST_SORT_ORDER_VALUES)[number];\n\nconst DEFAULT_COMPACT_LIST_FIELDS = [\"id\", \"title\", \"status\", \"type\", \"priority\", \"parent\", \"updated_at\"] as const;\nconst BRIEF_LIST_FIELDS = [\"id\", \"status\", \"type\", \"title\"] as const;\nconst TREE_METADATA_FIELDS = [\"tree_depth\", \"tree_parent\", \"tree_children\", \"tree_title\"] as const;\n\n// A projection that selects any heavy collection field (or `--full`, which returns\n// items verbatim) must load the full metadata; everything else takes the light path.\n// Sourced from the single HEAVY_METADATA_KEYS definition in the cache layer so the\n// light/heavy split can never drift between the cache and the projection routing.\nconst HEAVY_PROJECTION_FIELDS: ReadonlySet<string> = new Set<string>(HEAVY_METADATA_KEYS);\n\ninterface ListResultBase {\n  items: ListedItem[];\n  count: number;\n  // Total rows matched before pagination; only emitted when --limit/--offset\n  // omitted rows, so agents know how many remain (GH-154).\n  total?: number;\n  warnings?: string[];\n}\n\n/**\n * Documents the list compact result payload exchanged by command, SDK, and package integrations.\n */\nexport interface ListCompactResult extends ListResultBase {\n  filters: Record<string, unknown>;\n  projection?: undefined;\n  sorting?: undefined;\n  now?: undefined;\n}\n\n/**\n * Documents the list verbose result payload exchanged by command, SDK, and package integrations.\n */\nexport interface ListVerboseResult extends ListResultBase {\n  filters: Record<string, unknown>;\n  projection: {\n    mode: ListProjectionMode;\n    fields: string[] | null;\n  };\n  sorting: {\n    sort: ListSortField | \"default\";\n    order: ListSortOrder;\n  };\n  now: string;\n}\n\n/**\n * Restricts list result values accepted by command, SDK, and storage contracts.\n */\nexport type ListResult = ListCompactResult | ListVerboseResult;\n\nfunction isNonEmptyRecord(value: unknown): value is Record<string, unknown> {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value) && Object.keys(value).length > 0;\n}\n\n// Active content-field filter flags, keyed by the options dest and the snake_case\n// summary key emitted in the filters echo (GH-242). Presence and absence are\n// distinct echo keys (has_notes vs no_notes; has_body vs empty_body).\nconst CONTENT_FILTER_ECHO_ENTRIES: ReadonlyArray<{ key: string; summaryKey: string }> = [\n  { key: \"hasNotes\", summaryKey: \"has_notes\" },\n  { key: \"hasLearnings\", summaryKey: \"has_learnings\" },\n  { key: \"hasFiles\", summaryKey: \"has_files\" },\n  { key: \"hasDocs\", summaryKey: \"has_docs\" },\n  { key: \"hasTests\", summaryKey: \"has_tests\" },\n  { key: \"hasComments\", summaryKey: \"has_comments\" },\n  { key: \"hasDeps\", summaryKey: \"has_deps\" },\n  { key: \"hasBody\", summaryKey: \"has_body\" },\n  { key: \"hasLinkedCommand\", summaryKey: \"has_linked_command\" },\n  { key: \"noNotes\", summaryKey: \"no_notes\" },\n  { key: \"noLearnings\", summaryKey: \"no_learnings\" },\n  { key: \"noFiles\", summaryKey: \"no_files\" },\n  { key: \"noDocs\", summaryKey: \"no_docs\" },\n  { key: \"noTests\", summaryKey: \"no_tests\" },\n  { key: \"noComments\", summaryKey: \"no_comments\" },\n  { key: \"noDeps\", summaryKey: \"no_deps\" },\n  { key: \"emptyBody\", summaryKey: \"empty_body\" },\n  { key: \"noLinkedCommand\", summaryKey: \"no_linked_command\" },\n] as const;\n\n// Active governance-missing filter flags (GH-236), keyed by options dest and the\n// snake_case summary key emitted in the filters echo.\nconst GOVERNANCE_MISSING_ECHO_ENTRIES: ReadonlyArray<{ key: string; summaryKey: string }> = [\n  { key: \"filterReviewerMissing\", summaryKey: \"filter_reviewer_missing\" },\n  { key: \"filterRiskMissing\", summaryKey: \"filter_risk_missing\" },\n  { key: \"filterConfidenceMissing\", summaryKey: \"filter_confidence_missing\" },\n  { key: \"filterSprintMissing\", summaryKey: \"filter_sprint_missing\" },\n  { key: \"filterReleaseMissing\", summaryKey: \"filter_release_missing\" },\n] as const;\n\nfunction applyContentFilterEcho(filters: Record<string, unknown>, options: Record<string, unknown>): void {\n  for (const entry of CONTENT_FILTER_ECHO_ENTRIES) {\n    if (options[entry.key] === true) {\n      filters[entry.summaryKey] = true;\n    }\n  }\n}\n\nfunction applyGovernanceMissingFilterEcho(filters: Record<string, unknown>, options: Record<string, unknown>): void {\n  for (const entry of GOVERNANCE_MISSING_ECHO_ENTRIES) {\n    if (options[entry.key] === true) {\n      filters[entry.summaryKey] = true;\n    }\n  }\n}\n\ninterface FilterValueEchoEntry {\n  optionKey: string;\n  summaryKey: string;\n  normalize?: (value: unknown) => unknown;\n}\n\n/**\n * Copies user-supplied option values into compact filter summaries.\n *\n * Compact list/search responses are optimized for agent context: they echo only\n * filters the caller actually supplied. Keeping this helper shared prevents the\n * list and search command summaries from drifting as new scalar filters are\n * added.\n */\nexport function applyFilterValueEcho(\n  filters: Record<string, unknown>,\n  options: Record<string, unknown>,\n  entries: ReadonlyArray<FilterValueEchoEntry>,\n): void {\n  for (const entry of entries) {\n    const value = options[entry.optionKey];\n    if (value !== undefined) {\n      filters[entry.summaryKey] = entry.normalize ? entry.normalize(value) : value;\n    }\n  }\n}\n\n/**\n * Implements build content filter echo for the public runtime surface of this module.\n */\nexport function buildContentFilterEcho(options: Record<string, unknown>): Record<string, true> {\n  const echo: Record<string, true> = {};\n  applyContentFilterEcho(echo, options);\n  return echo;\n}\n\n/**\n * Implements build governance missing filter echo for the public runtime surface of this module.\n */\nexport function buildGovernanceMissingFilterEcho(options: Record<string, unknown>): Record<string, true> {\n  const echo: Record<string, true> = {};\n  applyGovernanceMissingFilterEcho(echo, options);\n  return echo;\n}\n\nconst COMPACT_LIST_VALUE_FILTER_ECHO_ENTRIES: ReadonlyArray<FilterValueEchoEntry> = [\n  { optionKey: \"type\", summaryKey: \"type\" },\n  { optionKey: \"tag\", summaryKey: \"tag\" },\n  { optionKey: \"priority\", summaryKey: \"priority\" },\n  { optionKey: \"deadlineBefore\", summaryKey: \"deadline_before\" },\n  { optionKey: \"deadlineAfter\", summaryKey: \"deadline_after\" },\n  { optionKey: \"updatedAfter\", summaryKey: \"updated_after\" },\n  { optionKey: \"updatedBefore\", summaryKey: \"updated_before\" },\n  { optionKey: \"createdAfter\", summaryKey: \"created_after\" },\n  { optionKey: \"createdBefore\", summaryKey: \"created_before\" },\n  { optionKey: \"ids\", summaryKey: \"ids\" },\n  { optionKey: \"assignee\", summaryKey: \"assignee\" },\n  { optionKey: \"assigneeFilter\", summaryKey: \"assignee_filter\" },\n  { optionKey: \"parent\", summaryKey: \"parent\" },\n  { optionKey: \"sprint\", summaryKey: \"sprint\" },\n  { optionKey: \"release\", summaryKey: \"release\" },\n] as const;\n\nconst VERBOSE_LIST_VALUE_FILTER_ECHO_ENTRIES: ReadonlyArray<FilterValueEchoEntry> = [\n  { optionKey: \"type\", summaryKey: \"type\" },\n  { optionKey: \"tag\", summaryKey: \"tag\" },\n  { optionKey: \"priority\", summaryKey: \"priority\" },\n  { optionKey: \"deadlineBefore\", summaryKey: \"deadline_before\" },\n  { optionKey: \"deadlineAfter\", summaryKey: \"deadline_after\" },\n  { optionKey: \"updatedAfter\", summaryKey: \"updated_after\" },\n  { optionKey: \"updatedBefore\", summaryKey: \"updated_before\" },\n  { optionKey: \"createdAfter\", summaryKey: \"created_after\" },\n  { optionKey: \"createdBefore\", summaryKey: \"created_before\" },\n  { optionKey: \"ids\", summaryKey: \"ids\" },\n  { optionKey: \"assignee\", summaryKey: \"assignee\" },\n  { optionKey: \"assigneeFilter\", summaryKey: \"assignee_filter\" },\n  { optionKey: \"parent\", summaryKey: \"parent\" },\n  { optionKey: \"sprint\", summaryKey: \"sprint\" },\n  { optionKey: \"release\", summaryKey: \"release\" },\n  { optionKey: \"limit\", summaryKey: \"limit\" },\n  { optionKey: \"offset\", summaryKey: \"offset\" },\n  { optionKey: \"includeBody\", summaryKey: \"include_body\" },\n  { optionKey: \"compact\", summaryKey: \"compact\" },\n  { optionKey: \"fields\", summaryKey: \"fields\" },\n] as const;\n\nconst VERBOSE_LIST_BOOLEAN_FILTER_ECHO_ENTRIES: ReadonlyArray<{ key: string; summaryKey: string }> = [\n  { key: \"filterAcMissing\", summaryKey: \"filter_ac_missing\" },\n  { key: \"filterEstimatesMissing\", summaryKey: \"filter_estimates_missing\" },\n  { key: \"filterResolutionMissing\", summaryKey: \"filter_resolution_missing\" },\n  { key: \"filterMetadataMissing\", summaryKey: \"filter_metadata_missing\" },\n] as const;\n\nfunction buildCompactListFilterSummary(params: {\n  filtersStatus: string | string[] | null;\n  options: ListOptions;\n  treeEnabled: boolean;\n  treeDepth: number | undefined;\n  sortField: ListSortField | undefined;\n  sortOrder: ListSortOrder;\n  runtimeFieldFilters: Record<string, unknown>;\n}): Record<string, unknown> {\n  const {\n    filtersStatus,\n    options,\n    treeEnabled,\n    treeDepth,\n    sortField,\n    sortOrder,\n    runtimeFieldFilters,\n  } = params;\n  const filters: Record<string, unknown> = {};\n  if (filtersStatus !== null) {\n    filters.status = filtersStatus;\n  }\n  applyFilterValueEcho(filters, options, COMPACT_LIST_VALUE_FILTER_ECHO_ENTRIES);\n  if (options.filterAcMissing === true) {\n    filters.filter_ac_missing = true;\n  }\n  if (options.filterEstimatesMissing === true) {\n    filters.filter_estimates_missing = true;\n  }\n  if (options.filterResolutionMissing === true) {\n    filters.filter_resolution_missing = true;\n  }\n  if (options.filterMetadataMissing === true) {\n    filters.filter_metadata_missing = true;\n  }\n  applyGovernanceMissingFilterEcho(filters, options);\n  applyContentFilterEcho(filters, options);\n  if (options.limit !== undefined) {\n    filters.limit = options.limit;\n  }\n  if (options.offset !== undefined) {\n    filters.offset = options.offset;\n  }\n  if (options.includeBody === true) {\n    filters.include_body = true;\n  }\n  if (options.fields !== undefined) {\n    filters.fields = options.fields;\n  }\n  if (treeEnabled) {\n    filters.tree = true;\n    if (treeDepth !== undefined) {\n      filters.tree_depth = treeDepth;\n    }\n  }\n  if (sortField !== undefined) {\n    filters.sort = sortField;\n    filters.order = sortOrder;\n  }\n  if (isNonEmptyRecord(runtimeFieldFilters)) {\n    filters.runtime_filters = runtimeFieldFilters;\n  }\n  return filters;\n}\n\nfunction compareDefaultSort(left: ListedItem, right: ListedItem, statusRegistry: RuntimeStatusRegistry): number {\n  const leftTerminal = isTerminalStatus(left.status, statusRegistry);\n  const rightTerminal = isTerminalStatus(right.status, statusRegistry);\n  if (leftTerminal !== rightTerminal) {\n    return leftTerminal ? 1 : -1;\n  }\n  const byPriority = left.priority - right.priority;\n  if (byPriority !== 0) {\n    return byPriority;\n  }\n  const byUpdated = compareTimestampStrings(right.updated_at, left.updated_at);\n  if (byUpdated !== 0) {\n    return byUpdated;\n  }\n  return (left.id ?? \"\").localeCompare(right.id ?? \"\");\n}\n\nfunction sortItemsDefault(items: ListedItem[], statusRegistry: RuntimeStatusRegistry): ListedItem[] {\n  return [...items].sort((left, right) => compareDefaultSort(left, right, statusRegistry));\n}\n\nfunction parseDeadline(raw: string | undefined, fieldLabel: string): string | undefined {\n  if (raw === undefined) return undefined;\n  return resolveIsoOrRelative(raw, new Date(), fieldLabel);\n}\n\n// updated/created date-window filters share the deadline ISO+relative resolver\n// so agents doing incremental \"what changed since my last context window\" syncs\n// can pass either an ISO timestamp (the common case — feed back the previous\n// run's `now`) or a SIGNED relative offset where \"-2h\"/\"-7d\" reach into the\n// past and \"+1d\" into the future (units h/d/w/m, m = months — there is no\n// minutes unit, matching the deadline resolver).\nfunction parseTimestampWindow(raw: unknown, fieldLabel: string): string | undefined {\n  if (raw == null) return undefined;\n  const value = String(raw).trim();\n  if (value.length === 0) return undefined;\n  return resolveIsoOrRelative(value, new Date(), fieldLabel);\n}\n\nfunction parseIdsFilter(raw: unknown): Set<string> | undefined {\n  if (raw == null) return undefined;\n  const value = String(raw).trim();\n  if (value.length === 0) {\n    throw new PmCliError(\"--ids requires at least one non-empty item ID\", EXIT_CODE.USAGE);\n  }\n  const ids = value\n    .split(\",\")\n    .map((entry) => entry.trim())\n    .filter((entry) => entry.length > 0);\n  if (ids.length === 0) {\n    throw new PmCliError(\"--ids requires at least one non-empty item ID\", EXIT_CODE.USAGE);\n  }\n  return new Set(ids);\n}\n\nfunction parseOffset(raw: string | undefined): number | undefined {\n  if (raw === undefined) return undefined;\n  const parsed = Number(raw);\n  if (!Number.isInteger(parsed) || parsed < 0) {\n    throw new PmCliError(\"Offset filter must be a non-negative integer\", EXIT_CODE.USAGE);\n  }\n  return parsed;\n}\n\nfunction parseFieldSelectors(raw: string | undefined): string[] | undefined {\n  if (raw === undefined) {\n    return undefined;\n  }\n  const selectors = raw\n    .split(\",\")\n    .map((entry) => entry.trim())\n    .filter((entry) => entry.length > 0);\n  if (selectors.length === 0) {\n    throw new PmCliError(\"List --fields requires a comma-separated list of field names\", EXIT_CODE.USAGE);\n  }\n  return [...new Set(selectors)];\n}\n\nfunction parseProjectionConfig(options: ListOptions): ListProjectionConfig {\n  const compactRequested = options.compact === true;\n  const briefRequested = options.brief === true;\n  const fullRequested = options.full === true;\n  const fieldSelectors = parseFieldSelectors(options.fields);\n  const enabledModes =\n    Number(compactRequested) + Number(briefRequested) + Number(fullRequested) + Number(fieldSelectors !== undefined);\n  if (enabledModes > 1) {\n    throw new PmCliError(\n      \"List projection options are mutually exclusive. Use one of --compact, --brief, --full, or --fields.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (fullRequested) {\n    return {\n      mode: \"full\",\n      fields: [],\n    };\n  }\n  if (briefRequested) {\n    return {\n      mode: \"compact\",\n      fields: [...BRIEF_LIST_FIELDS],\n    };\n  }\n  if (compactRequested) {\n    return {\n      mode: \"compact\",\n      fields: [...DEFAULT_COMPACT_LIST_FIELDS],\n    };\n  }\n  if (fieldSelectors) {\n    return {\n      mode: \"fields\",\n      fields: fieldSelectors,\n    };\n  }\n  return {\n    mode: \"full\",\n    fields: [],\n  };\n}\n\nfunction normalizeProjectionField(field: string): string {\n  return field.startsWith(\"item.\") ? field.slice(\"item.\".length) : field;\n}\n\nfunction validateListProjectionFields(projection: ListProjectionConfig, runtimeMetadataKeys: Iterable<string>): void {\n  if (projection.mode !== \"fields\") {\n    return;\n  }\n  const allowed = new Set([...FRONT_MATTER_KEY_ORDER, \"body\", ...TREE_METADATA_FIELDS, ...runtimeMetadataKeys]);\n  const unknown = projection.fields.filter((field) => !allowed.has(normalizeProjectionField(field)));\n  if (unknown.length > 0) {\n    throw new PmCliError(`Unknown list --fields value(s): ${unknown.join(\", \")}`, EXIT_CODE.USAGE, {\n      code: \"unknown_field_projection\",\n      examples: [\n        \"pm list-open --fields id,title,status,type,updated_at\",\n        \"pm list --fields id,title,parent,priority --limit 10\",\n        \"pm list-all --fields id,title,body --limit 5\",\n      ],\n    });\n  }\n}\n\n// Convenience aliases so agents/humans who reach for the bare verb form\n// (e.g. `--sort updated`) land on the canonical timestamp fields instead of an error.\n// A Map (not a plain object) avoids prototype-chain lookups for keys like \"__proto__\".\nconst LIST_SORT_FIELD_ALIASES: ReadonlyMap<string, ListSortField> = new Map<string, ListSortField>([\n  [\"updated\", \"updated_at\"],\n  [\"update\", \"updated_at\"],\n  [\"modified\", \"updated_at\"],\n  [\"created\", \"created_at\"],\n  [\"create\", \"created_at\"],\n]);\n\nfunction parseSortField(raw: string | undefined): ListSortField | undefined {\n  if (raw === undefined) {\n    return undefined;\n  }\n  const normalized = raw.trim().toLowerCase();\n  const aliased = LIST_SORT_FIELD_ALIASES.get(normalized);\n  if (aliased) {\n    return aliased;\n  }\n  if (!LIST_SORT_FIELDS.includes(normalized as ListSortField)) {\n    throw new PmCliError(\n      `Sort field must be one of ${LIST_SORT_FIELDS.join(\"|\")} (aliases: updated->updated_at, created->created_at)`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return normalized as ListSortField;\n}\n\nfunction parseSortOrder(raw: string | undefined): ListSortOrder | undefined {\n  if (raw === undefined) {\n    return undefined;\n  }\n  const normalized = raw.trim().toLowerCase();\n  if (!LIST_SORT_ORDER_VALUES.includes(normalized as ListSortOrder)) {\n    throw new PmCliError(`Sort order must be one of ${LIST_SORT_ORDER_VALUES.join(\"|\")}`, EXIT_CODE.USAGE);\n  }\n  return normalized as ListSortOrder;\n}\n\nfunction parseTreeDepth(raw: string | undefined): number | undefined {\n  return parseIntegerLimit(raw, \"--tree-depth\");\n}\n\nfunction parseAssigneeFilter(raw: string | undefined): \"assigned\" | \"unassigned\" | undefined {\n  if (raw === undefined) {\n    return undefined;\n  }\n  const normalized = raw.trim().toLowerCase();\n  if (!normalized) {\n    throw new PmCliError(\"Assignee filter must be one of assigned|unassigned\", EXIT_CODE.USAGE);\n  }\n  if (normalized !== \"assigned\" && normalized !== \"unassigned\") {\n    throw new PmCliError(`Invalid assignee filter \"${raw}\". Allowed: assigned|unassigned`, EXIT_CODE.USAGE);\n  }\n  return normalized;\n}\n\n// `pm list` keeps lenient status parsing (an unknown token is passed through\n// verbatim and simply matches nothing) so custom/unknown statuses never error;\n// the shared CSV parser resolves the open/closed/canceled workflow-group aliases.\nfunction resolveStatusFilter(\n  status: ItemStatus | undefined,\n  statusRegistry: RuntimeStatusRegistry,\n): ItemStatus[] | undefined {\n  return parseStatusFilterCsv(status, statusRegistry, { strict: false });\n}\n\ninterface ListFilterSet {\n  idsFilter: Set<string> | undefined;\n  statusSet: Set<ItemStatus> | undefined;\n  excludeTerminal: boolean;\n  typeFilter: ItemType | undefined;\n  tagFilter: string | undefined;\n  priorityFilter: number | undefined;\n  deadlineBefore: string | undefined;\n  deadlineAfter: string | undefined;\n  updatedAfter: string | undefined;\n  updatedBefore: string | undefined;\n  createdAfter: string | undefined;\n  createdBefore: string | undefined;\n  assigneeFilter: string | undefined;\n  assigneeModeFilter: \"assigned\" | \"unassigned\" | undefined;\n  parentFilter: string | undefined;\n  treeEnabled: boolean;\n  sprintFilter: string | undefined;\n  releaseFilter: string | undefined;\n  missingMetadataFilters: MissingMetadataFilters;\n  missingMetadataActive: boolean;\n  lifecycleClassifier: ReturnType<typeof lifecycleClassifierFromStatusRegistry>;\n  contentFieldFilters: ContentFieldFilters;\n  contentFiltersActive: boolean;\n}\n\nfunction assertListAssigneeFilters(\n  assigneeFilter: string | undefined,\n  assigneeModeFilter: \"assigned\" | \"unassigned\" | undefined,\n): void {\n  if (assigneeFilter && (assigneeFilter.toLowerCase() === \"none\" || assigneeFilter.toLowerCase() === \"null\")) {\n    throw new PmCliError(\n      '--assignee no longer accepts \"none\" or \"null\". Use --assignee-filter unassigned.',\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (assigneeFilter !== undefined && assigneeModeFilter === \"unassigned\") {\n    throw new PmCliError(\"Cannot combine --assignee with --assignee-filter unassigned\", EXIT_CODE.USAGE);\n  }\n}\n\nfunction resolveListFilterSet(\n  status: ItemStatus[] | undefined,\n  options: ListOptions,\n  typeRegistry: ItemTypeRegistry,\n  statusRegistry: RuntimeStatusRegistry,\n): ListFilterSet {\n  const assigneeFilter = options.assignee?.trim();\n  const assigneeModeFilter = parseAssigneeFilter(options.assigneeFilter);\n  assertListAssigneeFilters(assigneeFilter, assigneeModeFilter);\n  const missingMetadataFilters = resolveMissingMetadataFilters(options);\n  const contentFieldFilters = resolveContentFieldFilters(options as Record<string, unknown>);\n  return {\n    idsFilter: parseIdsFilter(options.ids),\n    statusSet: status && status.length > 0 ? new Set<ItemStatus>(status) : undefined,\n    excludeTerminal: options.excludeTerminal === true,\n    typeFilter: parseType(options.type, typeRegistry),\n    tagFilter: options.tag?.trim().toLowerCase(),\n    priorityFilter: parsePriority(options.priority),\n    deadlineBefore: parseDeadline(options.deadlineBefore, \"deadline-before\"),\n    deadlineAfter: parseDeadline(options.deadlineAfter, \"deadline-after\"),\n    updatedAfter: parseTimestampWindow(options.updatedAfter, \"updated-after\"),\n    updatedBefore: parseTimestampWindow(options.updatedBefore, \"updated-before\"),\n    createdAfter: parseTimestampWindow(options.createdAfter, \"created-after\"),\n    createdBefore: parseTimestampWindow(options.createdBefore, \"created-before\"),\n    assigneeFilter,\n    assigneeModeFilter,\n    parentFilter: options.parent?.trim(),\n    treeEnabled: options.tree === true,\n    sprintFilter: options.sprint?.trim(),\n    releaseFilter: options.release?.trim(),\n    missingMetadataFilters,\n    missingMetadataActive: hasMissingMetadataFilter(missingMetadataFilters),\n    lifecycleClassifier: lifecycleClassifierFromStatusRegistry(statusRegistry),\n    contentFieldFilters,\n    contentFiltersActive: hasContentFieldFilter(contentFieldFilters),\n  };\n}\n\nfunction matchesListScalarFilters(\n  item: ListedItem,\n  filters: ListFilterSet,\n  statusRegistry: RuntimeStatusRegistry,\n): boolean {\n  return matchesListIdentityFilters(item, filters, statusRegistry) &&\n    matchesListDateFilters(item, filters) &&\n    matchesListAssigneeFilterSet(item, filters) &&\n    matchesListScopeFilters(item, filters);\n}\n\nfunction matchesListIdentityFilters(\n  item: ListedItem,\n  filters: ListFilterSet,\n  statusRegistry: RuntimeStatusRegistry,\n): boolean {\n  if (filters.idsFilter && !filters.idsFilter.has(item.id)) return false;\n  if (filters.statusSet && !filters.statusSet.has(item.status)) return false;\n  if (filters.excludeTerminal && isTerminalStatus(item.status, statusRegistry)) return false;\n  if (filters.typeFilter && item.type !== filters.typeFilter) return false;\n  if (filters.tagFilter && !(item.tags ?? []).includes(filters.tagFilter)) return false;\n  return filters.priorityFilter === undefined || item.priority === filters.priorityFilter;\n}\n\nfunction matchesListDateFilters(item: ListedItem, filters: ListFilterSet): boolean {\n  if (filters.deadlineBefore && (!item.deadline || compareTimestampStrings(item.deadline, filters.deadlineBefore) > 0)) return false;\n  if (filters.deadlineAfter && (!item.deadline || compareTimestampStrings(item.deadline, filters.deadlineAfter) < 0)) return false;\n  if (filters.updatedAfter && compareTimestampStrings(item.updated_at, filters.updatedAfter) < 0) return false;\n  if (filters.updatedBefore && compareTimestampStrings(item.updated_at, filters.updatedBefore) > 0) return false;\n  if (filters.createdAfter && compareTimestampStrings(item.created_at, filters.createdAfter) < 0) return false;\n  return !filters.createdBefore || compareTimestampStrings(item.created_at, filters.createdBefore) <= 0;\n}\n\nfunction matchesListAssigneeFilterSet(item: ListedItem, filters: ListFilterSet): boolean {\n  if (filters.assigneeModeFilter === \"assigned\" && !item.assignee) return false;\n  if (filters.assigneeModeFilter === \"unassigned\" && item.assignee) return false;\n  return filters.assigneeFilter === undefined || item.assignee === filters.assigneeFilter;\n}\n\nfunction matchesListScopeFilters(item: ListedItem, filters: ListFilterSet): boolean {\n  if (filters.parentFilter !== undefined && !filters.treeEnabled && item.parent !== filters.parentFilter) return false;\n  if (filters.sprintFilter !== undefined && item.sprint !== filters.sprintFilter) return false;\n  return filters.releaseFilter === undefined || item.release === filters.releaseFilter;\n}\n\nfunction matchesListFilterSet(\n  item: ListedItem,\n  filters: ListFilterSet,\n  statusRegistry: RuntimeStatusRegistry,\n  runtimeFieldFilters: Record<string, unknown>,\n): boolean {\n  if (!matchesListScalarFilters(item, filters, statusRegistry)) {\n    return false;\n  }\n  if (filters.missingMetadataActive && !itemMatchesMissingMetadata(item, filters.missingMetadataFilters, filters.lifecycleClassifier)) {\n    return false;\n  }\n  if (filters.contentFiltersActive && !itemMatchesContentFilters(item, filters.contentFieldFilters)) {\n    return false;\n  }\n  if (!matchesRuntimeFilters(item as Record<string, unknown>, runtimeFieldFilters)) {\n    return false;\n  }\n  return true;\n}\n\nfunction applyFilters(\n  items: ListedItem[],\n  status: ItemStatus[] | undefined,\n  options: ListOptions,\n  typeRegistry: ItemTypeRegistry,\n  statusRegistry: RuntimeStatusRegistry,\n  runtimeFieldFilters: Record<string, unknown>,\n): ListedItem[] {\n  const filters = resolveListFilterSet(status, options, typeRegistry, statusRegistry);\n  return items.filter((item) => matchesListFilterSet(item, filters, statusRegistry, runtimeFieldFilters));\n}\n\nfunction trimNonEmpty(value: string | undefined): string | undefined {\n  if (typeof value !== \"string\") {\n    return undefined;\n  }\n  const trimmed = value.trim();\n  return trimmed.length > 0 ? trimmed : undefined;\n}\n\nfunction withTreeMetadata(item: ListedItem, depth: number, childCount: number): ListedItem {\n  const itemRecord = toItemRecord(item);\n  const title = typeof itemRecord.title === \"string\" ? itemRecord.title : \"\";\n  const parent = trimNonEmpty(typeof itemRecord.parent === \"string\" ? itemRecord.parent : undefined) ?? null;\n  return {\n    ...item,\n    tree_depth: depth,\n    tree_parent: parent,\n    tree_children: childCount,\n    tree_title: `${\"  \".repeat(depth)}${title}`,\n  } as ListedItem;\n}\n\nfunction orderItemsAsTree(\n  sortedItems: ListedItem[],\n  parentRoot: string | undefined,\n  maxDepth: number | undefined,\n): ListedItem[] {\n  const byId = new Map<string, ListedItem>();\n  const childrenByParent = new Map<string, ListedItem[]>();\n  for (const item of sortedItems) {\n    byId.set(item.id, item);\n    const parentId = trimNonEmpty(item.parent);\n    if (!parentId) {\n      continue;\n    }\n    const bucket = childrenByParent.get(parentId);\n    if (bucket) {\n      bucket.push(item);\n    } else {\n      childrenByParent.set(parentId, [item]);\n    }\n  }\n\n  const roots = parentRoot\n    ? [...(childrenByParent.get(parentRoot) ?? [])]\n    : sortedItems.filter((item) => {\n        const parentId = trimNonEmpty(item.parent);\n        return !parentId || !byId.has(parentId);\n      });\n  const ordered: ListedItem[] = [];\n  const visited = new Set<string>();\n  const pushNode = (node: ListedItem, depth: number): void => {\n    if (visited.has(node.id)) {\n      return;\n    }\n    visited.add(node.id);\n    const children = childrenByParent.get(node.id) ?? [];\n    ordered.push(withTreeMetadata(node, depth, children.length));\n    if (maxDepth !== undefined && depth >= maxDepth) {\n      return;\n    }\n    for (const child of children) {\n      pushNode(child, depth + 1);\n    }\n  };\n  for (const root of roots) {\n    pushNode(root, 0);\n  }\n  return ordered;\n}\n\nfunction compareNullableString(left: string | null, right: string | null): number {\n  if (left === right) {\n    return 0;\n  }\n  if (left === null) {\n    return 1;\n  }\n  if (right === null) {\n    return -1;\n  }\n  return left.localeCompare(right);\n}\n\nfunction compareNullableTimestamp(left: string | null, right: string | null): number {\n  if (left === right) {\n    return 0;\n  }\n  if (left === null) {\n    return 1;\n  }\n  if (right === null) {\n    return -1;\n  }\n  return compareTimestampStrings(left, right);\n}\n\nfunction compareBySortField(left: ListedItem, right: ListedItem, field: ListSortField): number {\n  switch (field) {\n    case \"priority\":\n      return left.priority - right.priority;\n    case \"deadline\":\n      return compareNullableTimestamp(left.deadline ?? null, right.deadline ?? null);\n    case \"updated_at\":\n      return compareTimestampStrings(left.updated_at, right.updated_at);\n    case \"created_at\":\n      return compareTimestampStrings(left.created_at, right.created_at);\n    case \"title\":\n      return (left.title ?? \"\").localeCompare(right.title ?? \"\");\n    case \"parent\":\n      return compareNullableString(left.parent ?? null, right.parent ?? null);\n    default:\n      return 0;\n  }\n}\n\nfunction sortItems(\n  items: ListedItem[],\n  sortField: ListSortField | undefined,\n  sortOrder: ListSortOrder,\n  statusRegistry: RuntimeStatusRegistry,\n): ListedItem[] {\n  if (!sortField) {\n    return sortItemsDefault(items, statusRegistry);\n  }\n  return [...items].sort((left, right) => {\n    const byField = compareBySortField(left, right, sortField);\n    if (byField !== 0) {\n      return sortOrder === \"desc\" ? -byField : byField;\n    }\n    const fallback = compareDefaultSort(left, right, statusRegistry);\n    return sortOrder === \"desc\" ? -fallback : fallback;\n  });\n}\n\nfunction readListFieldValue(item: ListedItem, field: string, treeMode = false): unknown {\n  const normalized = normalizeProjectionField(field.trim());\n  if (normalized.length === 0) {\n    return null;\n  }\n  const itemRecord = toItemRecord(item);\n  if (treeMode && normalized === \"title\" && typeof itemRecord.tree_title === \"string\") {\n    return itemRecord.tree_title;\n  }\n  if (Object.prototype.hasOwnProperty.call(itemRecord, normalized)) {\n    return itemRecord[normalized] ?? null;\n  }\n  return null;\n}\n\nfunction projectListItems(items: ListedItem[], projection: ListProjectionConfig, treeMode = false): ListedItem[] {\n  if (projection.mode === \"full\") {\n    return items;\n  }\n  return items.map((item) => {\n    const projected: Record<string, unknown> = {};\n    for (const field of projection.fields) {\n      projected[field] = readListFieldValue(item, field, treeMode);\n    }\n    return projected as unknown as ListedItem;\n  });\n}\n\nfunction runtimeMetadataKeysForProjection(definitions: Array<{ metadata_key: string }>): string[] {\n  const keys: string[] = [];\n  for (const field of definitions) {\n    keys.push(field.metadata_key);\n  }\n  return keys;\n}\n\ninterface ListRuntimeContext {\n  pmRoot: string;\n  settings: Awaited<ReturnType<typeof readSettings>>;\n  statusRegistry: RuntimeStatusRegistry;\n  runtimeFieldFilters: Record<string, unknown>;\n  typeRegistry: ItemTypeRegistry;\n  projection: ListProjectionConfig;\n}\n\ninterface ListOrderingOptions {\n  sortField: ListSortField | undefined;\n  sortOrder: ListSortOrder;\n  treeEnabled: boolean;\n  treeDepth: number | undefined;\n  parentRoot: string | undefined;\n}\n\ninterface ResolvedListStatus {\n  resolvedStatus: ItemStatus[] | undefined;\n  explicitAllStatuses: boolean;\n  effectiveOptions: ListOptions;\n  filtersStatus: string | string[] | null;\n}\n\ninterface ListPageResult {\n  projected: ListedItem[];\n  totalMatched: number;\n  truncationExtras: { total: number } | Record<string, never>;\n}\n\nasync function resolveListRuntimeContext(options: ListOptions, global: GlobalOptions): Promise<ListRuntimeContext> {\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  const settings = await readSettings(pmRoot);\n  const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);\n  const runtimeFieldRegistry = resolveRuntimeFieldRegistry(settings.schema);\n  const projection = parseProjectionConfig(options);\n  validateListProjectionFields(projection, runtimeMetadataKeysForProjection(runtimeFieldRegistry.definitions));\n  return {\n    pmRoot,\n    settings,\n    statusRegistry,\n    runtimeFieldFilters: collectRuntimeFilterValues(options as Record<string, unknown>, runtimeFieldRegistry, \"list\"),\n    typeRegistry: resolveItemTypeRegistry(settings, getActiveExtensionRegistrations()),\n    projection,\n  };\n}\n\nasync function loadListItems(\n  options: ListOptions,\n  runtime: ListRuntimeContext,\n  listWarnings: string[],\n): Promise<ListedItem[]> {\n  const projectionNeedsBody = runtime.projection.fields.some((field) => normalizeProjectionField(field) === \"body\");\n  const projectionNeedsCollections =\n    runtime.projection.mode === \"full\" ||\n    runtime.projection.fields.some((field) => HEAVY_PROJECTION_FIELDS.has(normalizeProjectionField(field)));\n  const contentFieldFilters = resolveContentFieldFilters(options as Record<string, unknown>);\n  const contentNeedsCollections = contentFiltersNeedCollections(contentFieldFilters);\n  const contentNeedsBody = contentFiltersNeedBody(contentFieldFilters);\n  if (options.includeBody || projectionNeedsBody || contentNeedsBody) {\n    return await listAllFrontMatterWithBody(\n      runtime.pmRoot,\n      runtime.settings.item_format,\n      runtime.typeRegistry.type_to_folder,\n      listWarnings,\n      runtime.settings.schema,\n    );\n  }\n  if (projectionNeedsCollections || contentNeedsCollections) {\n    return await listAllFrontMatter(\n      runtime.pmRoot,\n      runtime.settings.item_format,\n      runtime.typeRegistry.type_to_folder,\n      listWarnings,\n      runtime.settings.schema,\n    );\n  }\n  return await listAllFrontMatterLight(\n    runtime.pmRoot,\n    runtime.settings.item_format,\n    runtime.typeRegistry.type_to_folder,\n    listWarnings,\n    runtime.settings.schema,\n  );\n}\n\nfunction resolveListOrderingOptions(options: ListOptions): ListOrderingOptions {\n  const sortField = parseSortField(options.sort);\n  const sortOrder = parseSortOrder(options.order) ?? \"asc\";\n  const treeEnabled = options.tree === true;\n  if (!treeEnabled && options.treeDepth !== undefined) {\n    throw new PmCliError(\"List --tree-depth requires --tree\", EXIT_CODE.USAGE);\n  }\n  if (!sortField && options.order !== undefined) {\n    throw new PmCliError(\"List --order requires --sort\", EXIT_CODE.USAGE);\n  }\n  return {\n    sortField,\n    sortOrder,\n    treeEnabled,\n    treeDepth: treeEnabled ? parseTreeDepth(options.treeDepth) : undefined,\n    parentRoot: treeEnabled ? trimNonEmpty(options.parent) : undefined,\n  };\n}\n\nfunction resolveListStatusSelection(\n  status: ItemStatus | undefined,\n  options: ListOptions,\n  statusRegistry: RuntimeStatusRegistry,\n): ResolvedListStatus {\n  const explicitStatus = resolveStatusFilter(options.status as ItemStatus | undefined, statusRegistry);\n  const resolvedStatus = explicitStatus ?? resolveStatusFilter(status, statusRegistry);\n  const explicitAllStatuses = isStatusAllFilterInput(options.status);\n  const effectiveOptions = explicitStatus || explicitAllStatuses ? { ...options, excludeTerminal: false } : options;\n  const filtersStatus =\n    explicitAllStatuses\n      ? \"all\"\n      : resolvedStatus === undefined\n        ? null\n        : resolvedStatus.length === 1\n          ? resolvedStatus[0]\n          : resolvedStatus;\n  return { resolvedStatus, explicitAllStatuses, effectiveOptions, filtersStatus };\n}\n\nfunction pageAndProjectListItems(\n  ordered: ListedItem[],\n  options: ListOptions,\n  projection: ListProjectionConfig,\n  treeEnabled: boolean,\n): ListPageResult {\n  const noTruncate = options.noTruncate === true;\n  const limit = noTruncate ? undefined : parseIntegerLimit(options.limit);\n  const offset = parseOffset(options.offset) ?? 0;\n  const limited = limit === undefined ? ordered.slice(offset) : ordered.slice(offset, offset + limit);\n  const projected = projectListItems(limited, projection, treeEnabled);\n  const totalMatched = ordered.length;\n  return {\n    projected,\n    totalMatched,\n    truncationExtras: projected.length < totalMatched ? { total: totalMatched } : {},\n  };\n}\n\nfunction buildVerboseListFilters(params: {\n  filtersStatus: string | string[] | null;\n  options: ListOptions;\n  noTruncate: boolean;\n  treeEnabled: boolean;\n  treeDepth: number | undefined;\n  sortField: ListSortField | undefined;\n  sortOrder: ListSortOrder;\n  runtimeFieldFilters: Record<string, unknown>;\n}): Record<string, unknown> {\n  const { filtersStatus, options, noTruncate, treeEnabled, treeDepth, sortField, sortOrder, runtimeFieldFilters } = params;\n  const filters: Record<string, unknown> = { status: filtersStatus };\n  const optionRecord = options as Record<string, unknown>;\n  for (const entry of VERBOSE_LIST_VALUE_FILTER_ECHO_ENTRIES) {\n    filters[entry.summaryKey] = optionRecord[entry.optionKey] ?? null;\n  }\n  for (const entry of VERBOSE_LIST_BOOLEAN_FILTER_ECHO_ENTRIES) {\n    if (optionRecord[entry.key] === true) {\n      filters[entry.summaryKey] = true;\n    }\n  }\n  Object.assign(filters, buildGovernanceMissingFilterEcho(options), buildContentFilterEcho(options));\n  if (noTruncate) {\n    filters.no_truncate = true;\n  }\n  if (treeEnabled) {\n    filters.tree = true;\n    filters.tree_depth = treeDepth ?? null;\n  }\n  filters.sort = sortField ?? null;\n  filters.order = sortField ? sortOrder : null;\n  filters.runtime_filters = runtimeFieldFilters;\n  return filters;\n}\n\n/**\n * Implements run list for the public runtime surface of this module.\n */\nexport async function runList(status: ItemStatus | undefined, options: ListOptions, global: GlobalOptions): Promise<ListResult> {\n  const runtime = await resolveListRuntimeContext(options, global);\n  const listWarnings: string[] = [];\n  const items = await loadListItems(options, runtime, listWarnings);\n  const ordering = resolveListOrderingOptions(options);\n  const statusSelection = resolveListStatusSelection(status, options, runtime.statusRegistry);\n  const filtered = applyFilters(\n    items,\n    statusSelection.resolvedStatus,\n    statusSelection.effectiveOptions,\n    runtime.typeRegistry,\n    runtime.statusRegistry,\n    runtime.runtimeFieldFilters,\n  );\n  const sorted = sortItems(filtered, ordering.sortField, ordering.sortOrder, runtime.statusRegistry);\n  const ordered = ordering.treeEnabled ? orderItemsAsTree(sorted, ordering.parentRoot, ordering.treeDepth) : sorted;\n  const noTruncate = options.noTruncate === true;\n  const page = pageAndProjectListItems(ordered, options, runtime.projection, ordering.treeEnabled);\n  const now = nowIso();\n  const warnings = [...new Set(listWarnings)].sort((left, right) => left.localeCompare(right));\n  const projectionFields = runtime.projection.mode === \"full\" ? null : [...runtime.projection.fields];\n  const compactSummaryMode = runtime.projection.mode === \"compact\" && options.compact === true;\n  if (compactSummaryMode) {\n    const compactFilters = buildCompactListFilterSummary({\n      filtersStatus: statusSelection.filtersStatus,\n      options,\n      treeEnabled: ordering.treeEnabled,\n      treeDepth: ordering.treeDepth,\n      sortField: ordering.sortField,\n      sortOrder: ordering.sortOrder,\n      runtimeFieldFilters: runtime.runtimeFieldFilters,\n    });\n    return {\n      items: page.projected,\n      count: page.projected.length,\n      ...page.truncationExtras,\n      filters: compactFilters,\n      ...(warnings.length > 0 ? { warnings } : {}),\n    };\n  }\n  return {\n    items: page.projected,\n    count: page.projected.length,\n    ...page.truncationExtras,\n    filters: buildVerboseListFilters({\n      filtersStatus: statusSelection.filtersStatus,\n      options,\n      noTruncate,\n      treeEnabled: ordering.treeEnabled,\n      treeDepth: ordering.treeDepth,\n      sortField: ordering.sortField,\n      sortOrder: ordering.sortOrder,\n      runtimeFieldFilters: runtime.runtimeFieldFilters,\n    }),\n    projection: {\n      mode: runtime.projection.mode,\n      fields: projectionFields,\n    },\n    sorting: {\n      sort: ordering.sortField ?? \"default\",\n      order: ordering.sortField ? ordering.sortOrder : \"asc\",\n    },\n    now,\n    ...(warnings.length > 0 ? { warnings } : {}),\n  };\n}\n\nexport const _testOnly = {\n  applyFilters,\n  buildCompactListFilterSummary,\n  buildContentFilterEcho,\n  buildGovernanceMissingFilterEcho,\n  resolveContentFieldFilters,\n  resolveMissingMetadataFilters,\n  compareBySortField,\n  compareDefaultSort,\n  compareNullableString,\n  compareNullableTimestamp,\n  normalizeProjectionField,\n  parseAssigneeFilter,\n  parseFieldSelectors,\n  parseIdsFilter,\n  parseOffset,\n  parseProjectionConfig,\n  parseSortField,\n  parseSortOrder,\n  orderItemsAsTree,\n  projectListItems,\n  readListFieldValue,\n  runtimeMetadataKeysForProjection,\n  sortItems,\n  trimNonEmpty,\n  withTreeMetadata,\n};\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiBA,IAAM,uBAAqG;EACzG,MAAM;EACN,QAAQ;EACR,UAAU;EACV,WAAW;;AAGb,IAAM,sBAAsB;AAGtB,SAAU,uBAAuB,KAAY;AACjD,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO;EACT;AACA,QAAM,SAAS,IACZ,MAAM,GAAG,EACT,IAAI,CAAC,UAAU,MAAM,KAAI,EAAG,YAAW,CAAE,EACzC,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AACrC,SAAO,OAAO,WAAW,KAAK,OAAO,CAAC,MAAM;AAC9C;AAUM,SAAU,yBACd,OACA,UAA+B;AAE/B,QAAM,UAAU,MAAM,KAAI,EAAG,YAAW;AACxC,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;EACT;AACA,QAAM,QAAQ,qBAAqB,OAAO;AAC1C,MAAI,OAAO;AACT,WAAO,SAAS,KAAK;EACvB;AACA,SAAO,qBAAqB,OAAO,QAAQ;AAC7C;AAEA,SAAS,kCAAkC,UAA+B;AACxE,QAAM,aAAa,IAAI,IAAY,OAAO,KAAK,oBAAoB,CAAC;AACpE,aAAW,cAAc,SAAS,aAAa;AAC7C,eAAW,IAAI,WAAW,EAAE;AAC5B,eAAW,SAAS,WAAW,SAAS;AACtC,iBAAW,IAAI,KAAK;IACtB;EACF;AACA,SAAO,CAAC,GAAG,UAAU;AACvB;AAEA,SAAS,qBAAqB,OAAe,UAA+B;AAG1E,QAAM,aAAa,MAAM,KAAI,EAAG,YAAW;AAC3C,MAAI;AACJ,MAAI,eAAe,OAAO;AAC1B,aAAW,aAAa,kCAAkC,QAAQ,GAAG;AACnE,UAAM,WAAW,+BAA+B,YAAY,UAAU,YAAW,GAAI,CAAC;AACtF,QAAI,aAAa,QAAQ,WAAW,cAAc;AAChD,aAAO;AACP,qBAAe;IACjB;EACF;AACA,SAAO;AACT;AAyBM,SAAU,qBACd,KACA,UACA,SAAkC;AAElC,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO;EACT;AACA,QAAM,SAAS,SAAS,WAAW;AACnC,QAAM,YAAY,SAAS,aAAa;AACxC,QAAM,SAAS,IACZ,MAAM,GAAG,EACT,IAAI,CAAC,UAAU,MAAM,KAAI,CAAE,EAC3B,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AACrC,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO;EACT;AACA,QAAM,gBAAgB,OAAO,OAAO,CAAC,UAAU,MAAM,KAAI,EAAG,YAAW,MAAO,mBAAmB,EAAE;AACnG,MAAI,gBAAgB,GAAG;AACrB,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO;IACT;AACA,UAAM,IAAI,WACR,WAAW,SAAS,2CAA2C,SAAS,4BACxE,UAAU,KAAK;EAEnB;AACA,QAAM,WAAyB,CAAA;AAC/B,aAAW,SAAS,QAAQ;AAC1B,UAAM,SAAS,yBAAyB,OAAO,QAAQ;AACvD,QAAI,WAAW,QAAW;AACxB,UAAI,QAAQ;AACV,cAAM,aAAa,qBAAqB,OAAO,QAAQ;AACvD,cAAM,IAAI,WACR,WAAW,SAAS,WAAW,KAAK,wDAClC,aAAa,mBAAmB,UAAU,OAAO,GACnD,IACA,UAAU,KAAK;MAEnB;AACA,eAAS,KAAK,KAAmB;AACjC;IACF;AACA,aAAS,KAAK,MAAM;EACtB;AACA,SAAO,CAAC,GAAG,IAAI,IAAI,QAAQ,CAAC;AAC9B;;;ACpJA,SAAS,YAAY,MAAe,OAAc;AAChD,SAAO,kBAAkB,MAAM,KAAK;AACtC;AAKM,SAAU,2BACd,SACA,eACA,SAA4B;AAE5B,QAAM,UAAmC,CAAA;AACzC,aAAW,cAAc,cAAc,kBAAkB,IAAI,OAAO,KAAK,CAAA,GAAI;AAC3E,UAAM,WAAW,4BAA4B,SAAS,UAAU;AAChE,QAAI,aAAa,QAAW;AAC1B;IACF;AACA,YAAQ,WAAW,YAAY,IAAI,wBAAwB,YAAY,QAAQ;EACjF;AACA,SAAO;AACT;AAKM,SAAU,sBAAsB,MAA+B,SAAgC;AACnG,aAAW,CAAC,UAAU,aAAa,KAAK,OAAO,QAAQ,OAAO,GAAG;AAC/D,UAAM,cAAc,KAAK,QAAQ;AACjC,QAAI,MAAM,QAAQ,aAAa,GAAG;AAChC,UAAI,MAAM,QAAQ,WAAW,GAAG;AAC9B,cAAM,mBAAmB,YAAY,IAAI,CAAC,UAAU,OAAO,KAAK,CAAC;AACjE,cAAM,qBAAqB,cAAc,IAAI,CAAC,UAAU,OAAO,KAAK,CAAC;AACrE,YAAI,CAAC,mBAAmB,MAAM,CAAC,UAAU,iBAAiB,SAAS,KAAK,CAAC,GAAG;AAC1E,iBAAO;QACT;AACA;MACF;AACA,UAAI,CAAC,YAAY,aAAa,cAAc,cAAc,SAAS,CAAC,CAAC,GAAG;AACtE,eAAO;MACT;AACA;IACF;AACA,QAAI,CAAC,YAAY,aAAa,aAAa,GAAG;AAC5C,aAAO;IACT;EACF;AACA,SAAO;AACT;;;ACYM,SAAU,8BAA8B,SAU7C;AACC,SAAO;IACL,WAAW,QAAQ,oBAAoB;IACvC,kBAAkB,QAAQ,2BAA2B;IACrD,mBAAmB,QAAQ,4BAA4B;IACvD,iBAAiB,QAAQ,0BAA0B;IACnD,iBAAiB,QAAQ,0BAA0B;IACnD,aAAa,QAAQ,sBAAsB;IAC3C,mBAAmB,QAAQ,4BAA4B;IACvD,eAAe,QAAQ,wBAAwB;IAC/C,gBAAgB,QAAQ,yBAAyB;;AAErD;AAYA,IAAM,8BAAkE;EACtE,EAAE,OAAO,SAAS,YAAY,YAAY,WAAW,WAAW,aAAa,eAAe,YAAY,aAAY;EACpH,EAAE,OAAO,aAAa,YAAY,gBAAgB,WAAW,eAAe,aAAa,mBAAmB,YAAY,iBAAgB;EACxI,EAAE,OAAO,SAAS,YAAY,YAAY,WAAW,WAAW,aAAa,eAAe,YAAY,aAAY;EACpH,EAAE,OAAO,QAAQ,YAAY,WAAW,WAAW,UAAU,aAAa,cAAc,YAAY,YAAW;EAC/G,EAAE,OAAO,SAAS,YAAY,YAAY,WAAW,WAAW,aAAa,eAAe,YAAY,aAAY;EACpH,EAAE,OAAO,YAAY,YAAY,eAAe,WAAW,cAAc,aAAa,kBAAkB,YAAY,gBAAe;EACnI,EAAE,OAAO,QAAQ,YAAY,WAAW,WAAW,UAAU,aAAa,cAAc,YAAY,YAAW;EAC/G,EAAE,OAAO,QAAQ,YAAY,WAAW,WAAW,aAAa,aAAa,cAAc,YAAY,eAAc;EACrH,EAAE,OAAO,kBAAkB,YAAY,oBAAoB,WAAW,mBAAmB,aAAa,wBAAwB,YAAY,sBAAqB;;AAS3J,SAAU,2BAA2B,SAAgC;AACzE,QAAM,UAA+B,CAAA;AACrC,aAAW,WAAW,6BAA6B;AACjD,UAAM,UAAU,QAAQ,QAAQ,UAAU,MAAM;AAChD,UAAM,SAAS,QAAQ,QAAQ,SAAS,MAAM;AAC9C,QAAI,WAAW,QAAQ;AACrB,YAAM,IAAI,WACR,kBAAkB,QAAQ,WAAW,SAAS,QAAQ,UAAU,wBAChE,UAAU,KAAK;IAEnB;AACA,QAAI,SAAS;AACX,cAAQ,QAAQ,KAAK,IAAI;IAC3B,WAAW,QAAQ;AACjB,cAAQ,QAAQ,KAAK,IAAI;IAC3B;EACF;AACA,SAAO;AACT;AAcO,IAAM,mBAAmB,CAAC,YAAY,YAAY,cAAc,cAAc,SAAS,QAAQ;AAM/F,IAAM,yBAAyB,CAAC,OAAO,MAAM;AAMpD,IAAM,8BAA8B,CAAC,MAAM,SAAS,UAAU,QAAQ,YAAY,UAAU,YAAY;AACxG,IAAM,oBAAoB,CAAC,MAAM,UAAU,QAAQ,OAAO;AAC1D,IAAM,uBAAuB,CAAC,cAAc,eAAe,iBAAiB,YAAY;AAMxF,IAAM,0BAA+C,IAAI,IAAY,mBAAmB;AA0CxF,SAAS,iBAAiB,OAAc;AACtC,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK,KAAK,OAAO,KAAK,KAAK,EAAE,SAAS;AAC7G;AAKA,IAAM,8BAAkF;EACtF,EAAE,KAAK,YAAY,YAAY,YAAW;EAC1C,EAAE,KAAK,gBAAgB,YAAY,gBAAe;EAClD,EAAE,KAAK,YAAY,YAAY,YAAW;EAC1C,EAAE,KAAK,WAAW,YAAY,WAAU;EACxC,EAAE,KAAK,YAAY,YAAY,YAAW;EAC1C,EAAE,KAAK,eAAe,YAAY,eAAc;EAChD,EAAE,KAAK,WAAW,YAAY,WAAU;EACxC,EAAE,KAAK,WAAW,YAAY,WAAU;EACxC,EAAE,KAAK,oBAAoB,YAAY,qBAAoB;EAC3D,EAAE,KAAK,WAAW,YAAY,WAAU;EACxC,EAAE,KAAK,eAAe,YAAY,eAAc;EAChD,EAAE,KAAK,WAAW,YAAY,WAAU;EACxC,EAAE,KAAK,UAAU,YAAY,UAAS;EACtC,EAAE,KAAK,WAAW,YAAY,WAAU;EACxC,EAAE,KAAK,cAAc,YAAY,cAAa;EAC9C,EAAE,KAAK,UAAU,YAAY,UAAS;EACtC,EAAE,KAAK,aAAa,YAAY,aAAY;EAC5C,EAAE,KAAK,mBAAmB,YAAY,oBAAmB;;AAK3D,IAAM,kCAAsF;EAC1F,EAAE,KAAK,yBAAyB,YAAY,0BAAyB;EACrE,EAAE,KAAK,qBAAqB,YAAY,sBAAqB;EAC7D,EAAE,KAAK,2BAA2B,YAAY,4BAA2B;EACzE,EAAE,KAAK,uBAAuB,YAAY,wBAAuB;EACjE,EAAE,KAAK,wBAAwB,YAAY,yBAAwB;;AAGrE,SAAS,uBAAuB,SAAkC,SAAgC;AAChG,aAAW,SAAS,6BAA6B;AAC/C,QAAI,QAAQ,MAAM,GAAG,MAAM,MAAM;AAC/B,cAAQ,MAAM,UAAU,IAAI;IAC9B;EACF;AACF;AAEA,SAAS,iCAAiC,SAAkC,SAAgC;AAC1G,aAAW,SAAS,iCAAiC;AACnD,QAAI,QAAQ,MAAM,GAAG,MAAM,MAAM;AAC/B,cAAQ,MAAM,UAAU,IAAI;IAC9B;EACF;AACF;AAgBM,SAAU,qBACd,SACA,SACA,SAA4C;AAE5C,aAAW,SAAS,SAAS;AAC3B,UAAM,QAAQ,QAAQ,MAAM,SAAS;AACrC,QAAI,UAAU,QAAW;AACvB,cAAQ,MAAM,UAAU,IAAI,MAAM,YAAY,MAAM,UAAU,KAAK,IAAI;IACzE;EACF;AACF;AAKM,SAAU,uBAAuB,SAAgC;AACrE,QAAM,OAA6B,CAAA;AACnC,yBAAuB,MAAM,OAAO;AACpC,SAAO;AACT;AAKM,SAAU,iCAAiC,SAAgC;AAC/E,QAAM,OAA6B,CAAA;AACnC,mCAAiC,MAAM,OAAO;AAC9C,SAAO;AACT;AAEA,IAAM,yCAA8E;EAClF,EAAE,WAAW,QAAQ,YAAY,OAAM;EACvC,EAAE,WAAW,OAAO,YAAY,MAAK;EACrC,EAAE,WAAW,YAAY,YAAY,WAAU;EAC/C,EAAE,WAAW,kBAAkB,YAAY,kBAAiB;EAC5D,EAAE,WAAW,iBAAiB,YAAY,iBAAgB;EAC1D,EAAE,WAAW,gBAAgB,YAAY,gBAAe;EACxD,EAAE,WAAW,iBAAiB,YAAY,iBAAgB;EAC1D,EAAE,WAAW,gBAAgB,YAAY,gBAAe;EACxD,EAAE,WAAW,iBAAiB,YAAY,iBAAgB;EAC1D,EAAE,WAAW,OAAO,YAAY,MAAK;EACrC,EAAE,WAAW,YAAY,YAAY,WAAU;EAC/C,EAAE,WAAW,kBAAkB,YAAY,kBAAiB;EAC5D,EAAE,WAAW,UAAU,YAAY,SAAQ;EAC3C,EAAE,WAAW,UAAU,YAAY,SAAQ;EAC3C,EAAE,WAAW,WAAW,YAAY,UAAS;;AAG/C,IAAM,yCAA8E;EAClF,EAAE,WAAW,QAAQ,YAAY,OAAM;EACvC,EAAE,WAAW,OAAO,YAAY,MAAK;EACrC,EAAE,WAAW,YAAY,YAAY,WAAU;EAC/C,EAAE,WAAW,kBAAkB,YAAY,kBAAiB;EAC5D,EAAE,WAAW,iBAAiB,YAAY,iBAAgB;EAC1D,EAAE,WAAW,gBAAgB,YAAY,gBAAe;EACxD,EAAE,WAAW,iBAAiB,YAAY,iBAAgB;EAC1D,EAAE,WAAW,gBAAgB,YAAY,gBAAe;EACxD,EAAE,WAAW,iBAAiB,YAAY,iBAAgB;EAC1D,EAAE,WAAW,OAAO,YAAY,MAAK;EACrC,EAAE,WAAW,YAAY,YAAY,WAAU;EAC/C,EAAE,WAAW,kBAAkB,YAAY,kBAAiB;EAC5D,EAAE,WAAW,UAAU,YAAY,SAAQ;EAC3C,EAAE,WAAW,UAAU,YAAY,SAAQ;EAC3C,EAAE,WAAW,WAAW,YAAY,UAAS;EAC7C,EAAE,WAAW,SAAS,YAAY,QAAO;EACzC,EAAE,WAAW,UAAU,YAAY,SAAQ;EAC3C,EAAE,WAAW,eAAe,YAAY,eAAc;EACtD,EAAE,WAAW,WAAW,YAAY,UAAS;EAC7C,EAAE,WAAW,UAAU,YAAY,SAAQ;;AAG7C,IAAM,2CAA+F;EACnG,EAAE,KAAK,mBAAmB,YAAY,oBAAmB;EACzD,EAAE,KAAK,0BAA0B,YAAY,2BAA0B;EACvE,EAAE,KAAK,2BAA2B,YAAY,4BAA2B;EACzE,EAAE,KAAK,yBAAyB,YAAY,0BAAyB;;AAGvE,SAAS,8BAA8B,QAQtC;AACC,QAAM,EACJ,eACA,SACA,aACA,WACA,WACA,WACA,oBAAmB,IACjB;AACJ,QAAM,UAAmC,CAAA;AACzC,MAAI,kBAAkB,MAAM;AAC1B,YAAQ,SAAS;EACnB;AACA,uBAAqB,SAAS,SAAS,sCAAsC;AAC7E,MAAI,QAAQ,oBAAoB,MAAM;AACpC,YAAQ,oBAAoB;EAC9B;AACA,MAAI,QAAQ,2BAA2B,MAAM;AAC3C,YAAQ,2BAA2B;EACrC;AACA,MAAI,QAAQ,4BAA4B,MAAM;AAC5C,YAAQ,4BAA4B;EACtC;AACA,MAAI,QAAQ,0BAA0B,MAAM;AAC1C,YAAQ,0BAA0B;EACpC;AACA,mCAAiC,SAAS,OAAO;AACjD,yBAAuB,SAAS,OAAO;AACvC,MAAI,QAAQ,UAAU,QAAW;AAC/B,YAAQ,QAAQ,QAAQ;EAC1B;AACA,MAAI,QAAQ,WAAW,QAAW;AAChC,YAAQ,SAAS,QAAQ;EAC3B;AACA,MAAI,QAAQ,gBAAgB,MAAM;AAChC,YAAQ,eAAe;EACzB;AACA,MAAI,QAAQ,WAAW,QAAW;AAChC,YAAQ,SAAS,QAAQ;EAC3B;AACA,MAAI,aAAa;AACf,YAAQ,OAAO;AACf,QAAI,cAAc,QAAW;AAC3B,cAAQ,aAAa;IACvB;EACF;AACA,MAAI,cAAc,QAAW;AAC3B,YAAQ,OAAO;AACf,YAAQ,QAAQ;EAClB;AACA,MAAI,iBAAiB,mBAAmB,GAAG;AACzC,YAAQ,kBAAkB;EAC5B;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,MAAkB,OAAmB,gBAAqC;AACpG,QAAM,eAAe,iBAAiB,KAAK,QAAQ,cAAc;AACjE,QAAM,gBAAgB,iBAAiB,MAAM,QAAQ,cAAc;AACnE,MAAI,iBAAiB,eAAe;AAClC,WAAO,eAAe,IAAI;EAC5B;AACA,QAAM,aAAa,KAAK,WAAW,MAAM;AACzC,MAAI,eAAe,GAAG;AACpB,WAAO;EACT;AACA,QAAM,YAAY,wBAAwB,MAAM,YAAY,KAAK,UAAU;AAC3E,MAAI,cAAc,GAAG;AACnB,WAAO;EACT;AACA,UAAQ,KAAK,MAAM,IAAI,cAAc,MAAM,MAAM,EAAE;AACrD;AAEA,SAAS,iBAAiB,OAAqB,gBAAqC;AAClF,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,MAAM,UAAU,mBAAmB,MAAM,OAAO,cAAc,CAAC;AACzF;AAEA,SAAS,cAAc,KAAyB,YAAkB;AAChE,MAAI,QAAQ;AAAW,WAAO;AAC9B,SAAO,qBAAqB,KAAK,oBAAI,KAAI,GAAI,UAAU;AACzD;AAQA,SAAS,qBAAqB,KAAc,YAAkB;AAC5D,MAAI,OAAO;AAAM,WAAO;AACxB,QAAM,QAAQ,OAAO,GAAG,EAAE,KAAI;AAC9B,MAAI,MAAM,WAAW;AAAG,WAAO;AAC/B,SAAO,qBAAqB,OAAO,oBAAI,KAAI,GAAI,UAAU;AAC3D;AAEA,SAAS,eAAe,KAAY;AAClC,MAAI,OAAO;AAAM,WAAO;AACxB,QAAM,QAAQ,OAAO,GAAG,EAAE,KAAI;AAC9B,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,WAAW,iDAAiD,UAAU,KAAK;EACvF;AACA,QAAM,MAAM,MACT,MAAM,GAAG,EACT,IAAI,CAAC,UAAU,MAAM,KAAI,CAAE,EAC3B,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AACrC,MAAI,IAAI,WAAW,GAAG;AACpB,UAAM,IAAI,WAAW,iDAAiD,UAAU,KAAK;EACvF;AACA,SAAO,IAAI,IAAI,GAAG;AACpB;AAEA,SAAS,YAAY,KAAuB;AAC1C,MAAI,QAAQ;AAAW,WAAO;AAC9B,QAAM,SAAS,OAAO,GAAG;AACzB,MAAI,CAAC,OAAO,UAAU,MAAM,KAAK,SAAS,GAAG;AAC3C,UAAM,IAAI,WAAW,gDAAgD,UAAU,KAAK;EACtF;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,KAAuB;AAClD,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,YAAY,IACf,MAAM,GAAG,EACT,IAAI,CAAC,UAAU,MAAM,KAAI,CAAE,EAC3B,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AACrC,MAAI,UAAU,WAAW,GAAG;AAC1B,UAAM,IAAI,WAAW,gEAAgE,UAAU,KAAK;EACtG;AACA,SAAO,CAAC,GAAG,IAAI,IAAI,SAAS,CAAC;AAC/B;AAEA,SAAS,sBAAsB,SAAoB;AACjD,QAAM,mBAAmB,QAAQ,YAAY;AAC7C,QAAM,iBAAiB,QAAQ,UAAU;AACzC,QAAM,gBAAgB,QAAQ,SAAS;AACvC,QAAM,iBAAiB,oBAAoB,QAAQ,MAAM;AACzD,QAAM,eACJ,OAAO,gBAAgB,IAAI,OAAO,cAAc,IAAI,OAAO,aAAa,IAAI,OAAO,mBAAmB,MAAS;AACjH,MAAI,eAAe,GAAG;AACpB,UAAM,IAAI,WACR,uGACA,UAAU,KAAK;EAEnB;AACA,MAAI,eAAe;AACjB,WAAO;MACL,MAAM;MACN,QAAQ,CAAA;;EAEZ;AACA,MAAI,gBAAgB;AAClB,WAAO;MACL,MAAM;MACN,QAAQ,CAAC,GAAG,iBAAiB;;EAEjC;AACA,MAAI,kBAAkB;AACpB,WAAO;MACL,MAAM;MACN,QAAQ,CAAC,GAAG,2BAA2B;;EAE3C;AACA,MAAI,gBAAgB;AAClB,WAAO;MACL,MAAM;MACN,QAAQ;;EAEZ;AACA,SAAO;IACL,MAAM;IACN,QAAQ,CAAA;;AAEZ;AAEA,SAAS,yBAAyB,OAAa;AAC7C,SAAO,MAAM,WAAW,OAAO,IAAI,MAAM,MAAM,QAAQ,MAAM,IAAI;AACnE;AAEA,SAAS,6BAA6B,YAAkC,qBAAqC;AAC3G,MAAI,WAAW,SAAS,UAAU;AAChC;EACF;AACA,QAAM,UAAU,oBAAI,IAAI,CAAC,GAAG,wBAAwB,QAAQ,GAAG,sBAAsB,GAAG,mBAAmB,CAAC;AAC5G,QAAM,UAAU,WAAW,OAAO,OAAO,CAAC,UAAU,CAAC,QAAQ,IAAI,yBAAyB,KAAK,CAAC,CAAC;AACjG,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,IAAI,WAAW,mCAAmC,QAAQ,KAAK,IAAI,CAAC,IAAI,UAAU,OAAO;MAC7F,MAAM;MACN,UAAU;QACR;QACA;QACA;;KAEH;EACH;AACF;AAKA,IAAM,0BAA8D,oBAAI,IAA2B;EACjG,CAAC,WAAW,YAAY;EACxB,CAAC,UAAU,YAAY;EACvB,CAAC,YAAY,YAAY;EACzB,CAAC,WAAW,YAAY;EACxB,CAAC,UAAU,YAAY;CACxB;AAED,SAAS,eAAe,KAAuB;AAC7C,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,QAAM,UAAU,wBAAwB,IAAI,UAAU;AACtD,MAAI,SAAS;AACX,WAAO;EACT;AACA,MAAI,CAAC,iBAAiB,SAAS,UAA2B,GAAG;AAC3D,UAAM,IAAI,WACR,6BAA6B,iBAAiB,KAAK,GAAG,CAAC,wDACvD,UAAU,KAAK;EAEnB;AACA,SAAO;AACT;AAEA,SAAS,eAAe,KAAuB;AAC7C,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,MAAI,CAAC,uBAAuB,SAAS,UAA2B,GAAG;AACjE,UAAM,IAAI,WAAW,6BAA6B,uBAAuB,KAAK,GAAG,CAAC,IAAI,UAAU,KAAK;EACvG;AACA,SAAO;AACT;AAEA,SAAS,eAAe,KAAuB;AAC7C,SAAO,kBAAkB,KAAK,cAAc;AAC9C;AAEA,SAAS,oBAAoB,KAAuB;AAClD,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,MAAI,CAAC,YAAY;AACf,UAAM,IAAI,WAAW,sDAAsD,UAAU,KAAK;EAC5F;AACA,MAAI,eAAe,cAAc,eAAe,cAAc;AAC5D,UAAM,IAAI,WAAW,4BAA4B,GAAG,mCAAmC,UAAU,KAAK;EACxG;AACA,SAAO;AACT;AAKA,SAAS,oBACP,QACA,gBAAqC;AAErC,SAAO,qBAAqB,QAAQ,gBAAgB,EAAE,QAAQ,MAAK,CAAE;AACvE;AA4BA,SAAS,0BACP,gBACA,oBAAyD;AAEzD,MAAI,mBAAmB,eAAe,YAAW,MAAO,UAAU,eAAe,YAAW,MAAO,SAAS;AAC1G,UAAM,IAAI,WACR,oFACA,UAAU,KAAK;EAEnB;AACA,MAAI,mBAAmB,UAAa,uBAAuB,cAAc;AACvE,UAAM,IAAI,WAAW,+DAA+D,UAAU,KAAK;EACrG;AACF;AAEA,SAAS,qBACP,QACA,SACA,cACA,gBAAqC;AAErC,QAAM,iBAAiB,QAAQ,UAAU,KAAI;AAC7C,QAAM,qBAAqB,oBAAoB,QAAQ,cAAc;AACrE,4BAA0B,gBAAgB,kBAAkB;AAC5D,QAAM,yBAAyB,8BAA8B,OAAO;AACpE,QAAM,sBAAsB,2BAA2B,OAAkC;AACzF,SAAO;IACL,WAAW,eAAe,QAAQ,GAAG;IACrC,WAAW,UAAU,OAAO,SAAS,IAAI,IAAI,IAAgB,MAAM,IAAI;IACvE,iBAAiB,QAAQ,oBAAoB;IAC7C,YAAY,UAAU,QAAQ,MAAM,YAAY;IAChD,WAAW,QAAQ,KAAK,KAAI,EAAG,YAAW;IAC1C,gBAAgB,cAAc,QAAQ,QAAQ;IAC9C,gBAAgB,cAAc,QAAQ,gBAAgB,iBAAiB;IACvE,eAAe,cAAc,QAAQ,eAAe,gBAAgB;IACpE,cAAc,qBAAqB,QAAQ,cAAc,eAAe;IACxE,eAAe,qBAAqB,QAAQ,eAAe,gBAAgB;IAC3E,cAAc,qBAAqB,QAAQ,cAAc,eAAe;IACxE,eAAe,qBAAqB,QAAQ,eAAe,gBAAgB;IAC3E;IACA;IACA,cAAc,QAAQ,QAAQ,KAAI;IAClC,aAAa,QAAQ,SAAS;IAC9B,cAAc,QAAQ,QAAQ,KAAI;IAClC,eAAe,QAAQ,SAAS,KAAI;IACpC;IACA,uBAAuB,yBAAyB,sBAAsB;IACtE,qBAAqB,sCAAsC,cAAc;IACzE;IACA,sBAAsB,sBAAsB,mBAAmB;;AAEnE;AAEA,SAAS,yBACP,MACA,SACA,gBAAqC;AAErC,SAAO,2BAA2B,MAAM,SAAS,cAAc,KAC7D,uBAAuB,MAAM,OAAO,KACpC,6BAA6B,MAAM,OAAO,KAC1C,wBAAwB,MAAM,OAAO;AACzC;AAEA,SAAS,2BACP,MACA,SACA,gBAAqC;AAErC,MAAI,QAAQ,aAAa,CAAC,QAAQ,UAAU,IAAI,KAAK,EAAE;AAAG,WAAO;AACjE,MAAI,QAAQ,aAAa,CAAC,QAAQ,UAAU,IAAI,KAAK,MAAM;AAAG,WAAO;AACrE,MAAI,QAAQ,mBAAmB,iBAAiB,KAAK,QAAQ,cAAc;AAAG,WAAO;AACrF,MAAI,QAAQ,cAAc,KAAK,SAAS,QAAQ;AAAY,WAAO;AACnE,MAAI,QAAQ,aAAa,EAAE,KAAK,QAAQ,CAAA,GAAI,SAAS,QAAQ,SAAS;AAAG,WAAO;AAChF,SAAO,QAAQ,mBAAmB,UAAa,KAAK,aAAa,QAAQ;AAC3E;AAEA,SAAS,uBAAuB,MAAkB,SAAsB;AACtE,MAAI,QAAQ,mBAAmB,CAAC,KAAK,YAAY,wBAAwB,KAAK,UAAU,QAAQ,cAAc,IAAI;AAAI,WAAO;AAC7H,MAAI,QAAQ,kBAAkB,CAAC,KAAK,YAAY,wBAAwB,KAAK,UAAU,QAAQ,aAAa,IAAI;AAAI,WAAO;AAC3H,MAAI,QAAQ,gBAAgB,wBAAwB,KAAK,YAAY,QAAQ,YAAY,IAAI;AAAG,WAAO;AACvG,MAAI,QAAQ,iBAAiB,wBAAwB,KAAK,YAAY,QAAQ,aAAa,IAAI;AAAG,WAAO;AACzG,MAAI,QAAQ,gBAAgB,wBAAwB,KAAK,YAAY,QAAQ,YAAY,IAAI;AAAG,WAAO;AACvG,SAAO,CAAC,QAAQ,iBAAiB,wBAAwB,KAAK,YAAY,QAAQ,aAAa,KAAK;AACtG;AAEA,SAAS,6BAA6B,MAAkB,SAAsB;AAC5E,MAAI,QAAQ,uBAAuB,cAAc,CAAC,KAAK;AAAU,WAAO;AACxE,MAAI,QAAQ,uBAAuB,gBAAgB,KAAK;AAAU,WAAO;AACzE,SAAO,QAAQ,mBAAmB,UAAa,KAAK,aAAa,QAAQ;AAC3E;AAEA,SAAS,wBAAwB,MAAkB,SAAsB;AACvE,MAAI,QAAQ,iBAAiB,UAAa,CAAC,QAAQ,eAAe,KAAK,WAAW,QAAQ;AAAc,WAAO;AAC/G,MAAI,QAAQ,iBAAiB,UAAa,KAAK,WAAW,QAAQ;AAAc,WAAO;AACvF,SAAO,QAAQ,kBAAkB,UAAa,KAAK,YAAY,QAAQ;AACzE;AAEA,SAAS,qBACP,MACA,SACA,gBACA,qBAA4C;AAE5C,MAAI,CAAC,yBAAyB,MAAM,SAAS,cAAc,GAAG;AAC5D,WAAO;EACT;AACA,MAAI,QAAQ,yBAAyB,CAAC,2BAA2B,MAAM,QAAQ,wBAAwB,QAAQ,mBAAmB,GAAG;AACnI,WAAO;EACT;AACA,MAAI,QAAQ,wBAAwB,CAAC,0BAA0B,MAAM,QAAQ,mBAAmB,GAAG;AACjG,WAAO;EACT;AACA,MAAI,CAAC,sBAAsB,MAAiC,mBAAmB,GAAG;AAChF,WAAO;EACT;AACA,SAAO;AACT;AAEA,SAAS,aACP,OACA,QACA,SACA,cACA,gBACA,qBAA4C;AAE5C,QAAM,UAAU,qBAAqB,QAAQ,SAAS,cAAc,cAAc;AAClF,SAAO,MAAM,OAAO,CAAC,SAAS,qBAAqB,MAAM,SAAS,gBAAgB,mBAAmB,CAAC;AACxG;AAEA,SAAS,aAAa,OAAyB;AAC7C,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO;EACT;AACA,QAAM,UAAU,MAAM,KAAI;AAC1B,SAAO,QAAQ,SAAS,IAAI,UAAU;AACxC;AAEA,SAAS,iBAAiB,MAAkB,OAAe,YAAkB;AAC3E,QAAM,aAAa,aAAa,IAAI;AACpC,QAAM,QAAQ,OAAO,WAAW,UAAU,WAAW,WAAW,QAAQ;AACxE,QAAM,SAAS,aAAa,OAAO,WAAW,WAAW,WAAW,WAAW,SAAS,MAAS,KAAK;AACtG,SAAO;IACL,GAAG;IACH,YAAY;IACZ,aAAa;IACb,eAAe;IACf,YAAY,GAAG,KAAK,OAAO,KAAK,CAAC,GAAG,KAAK;;AAE7C;AAEA,SAAS,iBACP,aACA,YACA,UAA4B;AAE5B,QAAM,OAAO,oBAAI,IAAG;AACpB,QAAM,mBAAmB,oBAAI,IAAG;AAChC,aAAW,QAAQ,aAAa;AAC9B,SAAK,IAAI,KAAK,IAAI,IAAI;AACtB,UAAM,WAAW,aAAa,KAAK,MAAM;AACzC,QAAI,CAAC,UAAU;AACb;IACF;AACA,UAAM,SAAS,iBAAiB,IAAI,QAAQ;AAC5C,QAAI,QAAQ;AACV,aAAO,KAAK,IAAI;IAClB,OAAO;AACL,uBAAiB,IAAI,UAAU,CAAC,IAAI,CAAC;IACvC;EACF;AAEA,QAAM,QAAQ,aACV,CAAC,GAAI,iBAAiB,IAAI,UAAU,KAAK,CAAA,CAAG,IAC5C,YAAY,OAAO,CAAC,SAAQ;AAC1B,UAAM,WAAW,aAAa,KAAK,MAAM;AACzC,WAAO,CAAC,YAAY,CAAC,KAAK,IAAI,QAAQ;EACxC,CAAC;AACL,QAAM,UAAwB,CAAA;AAC9B,QAAM,UAAU,oBAAI,IAAG;AACvB,QAAM,WAAW,CAAC,MAAkB,UAAuB;AACzD,QAAI,QAAQ,IAAI,KAAK,EAAE,GAAG;AACxB;IACF;AACA,YAAQ,IAAI,KAAK,EAAE;AACnB,UAAM,WAAW,iBAAiB,IAAI,KAAK,EAAE,KAAK,CAAA;AAClD,YAAQ,KAAK,iBAAiB,MAAM,OAAO,SAAS,MAAM,CAAC;AAC3D,QAAI,aAAa,UAAa,SAAS,UAAU;AAC/C;IACF;AACA,eAAW,SAAS,UAAU;AAC5B,eAAS,OAAO,QAAQ,CAAC;IAC3B;EACF;AACA,aAAW,QAAQ,OAAO;AACxB,aAAS,MAAM,CAAC;EAClB;AACA,SAAO;AACT;AAEA,SAAS,sBAAsB,MAAqB,OAAoB;AACtE,MAAI,SAAS,OAAO;AAClB,WAAO;EACT;AACA,MAAI,SAAS,MAAM;AACjB,WAAO;EACT;AACA,MAAI,UAAU,MAAM;AAClB,WAAO;EACT;AACA,SAAO,KAAK,cAAc,KAAK;AACjC;AAEA,SAAS,yBAAyB,MAAqB,OAAoB;AACzE,MAAI,SAAS,OAAO;AAClB,WAAO;EACT;AACA,MAAI,SAAS,MAAM;AACjB,WAAO;EACT;AACA,MAAI,UAAU,MAAM;AAClB,WAAO;EACT;AACA,SAAO,wBAAwB,MAAM,KAAK;AAC5C;AAEA,SAAS,mBAAmB,MAAkB,OAAmB,OAAoB;AACnF,UAAQ,OAAO;IACb,KAAK;AACH,aAAO,KAAK,WAAW,MAAM;IAC/B,KAAK;AACH,aAAO,yBAAyB,KAAK,YAAY,MAAM,MAAM,YAAY,IAAI;IAC/E,KAAK;AACH,aAAO,wBAAwB,KAAK,YAAY,MAAM,UAAU;IAClE,KAAK;AACH,aAAO,wBAAwB,KAAK,YAAY,MAAM,UAAU;IAClE,KAAK;AACH,cAAQ,KAAK,SAAS,IAAI,cAAc,MAAM,SAAS,EAAE;IAC3D,KAAK;AACH,aAAO,sBAAsB,KAAK,UAAU,MAAM,MAAM,UAAU,IAAI;IACxE;AACE,aAAO;EACX;AACF;AAEA,SAAS,UACP,OACA,WACA,WACA,gBAAqC;AAErC,MAAI,CAAC,WAAW;AACd,WAAO,iBAAiB,OAAO,cAAc;EAC/C;AACA,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,MAAM,UAAS;AACrC,UAAM,UAAU,mBAAmB,MAAM,OAAO,SAAS;AACzD,QAAI,YAAY,GAAG;AACjB,aAAO,cAAc,SAAS,CAAC,UAAU;IAC3C;AACA,UAAM,WAAW,mBAAmB,MAAM,OAAO,cAAc;AAC/D,WAAO,cAAc,SAAS,CAAC,WAAW;EAC5C,CAAC;AACH;AAEA,SAAS,mBAAmB,MAAkB,OAAe,WAAW,OAAK;AAC3E,QAAM,aAAa,yBAAyB,MAAM,KAAI,CAAE;AACxD,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;EACT;AACA,QAAM,aAAa,aAAa,IAAI;AACpC,MAAI,YAAY,eAAe,WAAW,OAAO,WAAW,eAAe,UAAU;AACnF,WAAO,WAAW;EACpB;AACA,MAAI,OAAO,UAAU,eAAe,KAAK,YAAY,UAAU,GAAG;AAChE,WAAO,WAAW,UAAU,KAAK;EACnC;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAqB,YAAkC,WAAW,OAAK;AAC/F,MAAI,WAAW,SAAS,QAAQ;AAC9B,WAAO;EACT;AACA,SAAO,MAAM,IAAI,CAAC,SAAQ;AACxB,UAAM,YAAqC,CAAA;AAC3C,eAAW,SAAS,WAAW,QAAQ;AACrC,gBAAU,KAAK,IAAI,mBAAmB,MAAM,OAAO,QAAQ;IAC7D;AACA,WAAO;EACT,CAAC;AACH;AAEA,SAAS,iCAAiC,aAA4C;AACpF,QAAM,OAAiB,CAAA;AACvB,aAAW,SAAS,aAAa;AAC/B,SAAK,KAAK,MAAM,YAAY;EAC9B;AACA,SAAO;AACT;AAgCA,eAAe,0BAA0B,SAAsB,QAAqB;AAClF,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;AACA,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,iBAAiB,6BAA6B,SAAS,MAAM;AACnE,QAAM,uBAAuB,4BAA4B,SAAS,MAAM;AACxE,QAAM,aAAa,sBAAsB,OAAO;AAChD,+BAA6B,YAAY,iCAAiC,qBAAqB,WAAW,CAAC;AAC3G,SAAO;IACL;IACA;IACA;IACA,qBAAqB,2BAA2B,SAAoC,sBAAsB,MAAM;IAChH,cAAc,wBAAwB,UAAU,gCAA+B,CAAE;IACjF;;AAEJ;AAEA,eAAe,cACb,SACA,SACA,cAAsB;AAEtB,QAAM,sBAAsB,QAAQ,WAAW,OAAO,KAAK,CAAC,UAAU,yBAAyB,KAAK,MAAM,MAAM;AAChH,QAAM,6BACJ,QAAQ,WAAW,SAAS,UAC5B,QAAQ,WAAW,OAAO,KAAK,CAAC,UAAU,wBAAwB,IAAI,yBAAyB,KAAK,CAAC,CAAC;AACxG,QAAM,sBAAsB,2BAA2B,OAAkC;AACzF,QAAM,0BAA0B,8BAA8B,mBAAmB;AACjF,QAAM,mBAAmB,uBAAuB,mBAAmB;AACnE,MAAI,QAAQ,eAAe,uBAAuB,kBAAkB;AAClE,WAAO,MAAM,2BACX,QAAQ,QACR,QAAQ,SAAS,aACjB,QAAQ,aAAa,gBACrB,cACA,QAAQ,SAAS,MAAM;EAE3B;AACA,MAAI,8BAA8B,yBAAyB;AACzD,WAAO,MAAM,mBACX,QAAQ,QACR,QAAQ,SAAS,aACjB,QAAQ,aAAa,gBACrB,cACA,QAAQ,SAAS,MAAM;EAE3B;AACA,SAAO,MAAM,wBACX,QAAQ,QACR,QAAQ,SAAS,aACjB,QAAQ,aAAa,gBACrB,cACA,QAAQ,SAAS,MAAM;AAE3B;AAEA,SAAS,2BAA2B,SAAoB;AACtD,QAAM,YAAY,eAAe,QAAQ,IAAI;AAC7C,QAAM,YAAY,eAAe,QAAQ,KAAK,KAAK;AACnD,QAAM,cAAc,QAAQ,SAAS;AACrC,MAAI,CAAC,eAAe,QAAQ,cAAc,QAAW;AACnD,UAAM,IAAI,WAAW,qCAAqC,UAAU,KAAK;EAC3E;AACA,MAAI,CAAC,aAAa,QAAQ,UAAU,QAAW;AAC7C,UAAM,IAAI,WAAW,gCAAgC,UAAU,KAAK;EACtE;AACA,SAAO;IACL;IACA;IACA;IACA,WAAW,cAAc,eAAe,QAAQ,SAAS,IAAI;IAC7D,YAAY,cAAc,aAAa,QAAQ,MAAM,IAAI;;AAE7D;AAEA,SAAS,2BACP,QACA,SACA,gBAAqC;AAErC,QAAM,iBAAiB,oBAAoB,QAAQ,QAAkC,cAAc;AACnG,QAAM,iBAAiB,kBAAkB,oBAAoB,QAAQ,cAAc;AACnF,QAAM,sBAAsB,uBAAuB,QAAQ,MAAM;AACjE,QAAM,mBAAmB,kBAAkB,sBAAsB,EAAE,GAAG,SAAS,iBAAiB,MAAK,IAAK;AAC1G,QAAM,gBACJ,sBACI,QACA,mBAAmB,SACjB,OACA,eAAe,WAAW,IACxB,eAAe,CAAC,IAChB;AACV,SAAO,EAAE,gBAAgB,qBAAqB,kBAAkB,cAAa;AAC/E;AAEA,SAAS,wBACP,SACA,SACA,YACA,aAAoB;AAEpB,QAAM,aAAa,QAAQ,eAAe;AAC1C,QAAM,QAAQ,aAAa,SAAY,kBAAkB,QAAQ,KAAK;AACtE,QAAM,SAAS,YAAY,QAAQ,MAAM,KAAK;AAC9C,QAAM,UAAU,UAAU,SAAY,QAAQ,MAAM,MAAM,IAAI,QAAQ,MAAM,QAAQ,SAAS,KAAK;AAClG,QAAM,YAAY,iBAAiB,SAAS,YAAY,WAAW;AACnE,QAAM,eAAe,QAAQ;AAC7B,SAAO;IACL;IACA;IACA,kBAAkB,UAAU,SAAS,eAAe,EAAE,OAAO,aAAY,IAAK,CAAA;;AAElF;AAEA,SAAS,wBAAwB,QAShC;AACC,QAAM,EAAE,eAAe,SAAS,YAAY,aAAa,WAAW,WAAW,WAAW,oBAAmB,IAAK;AAClH,QAAM,UAAmC,EAAE,QAAQ,cAAa;AAChE,QAAM,eAAe;AACrB,aAAW,SAAS,wCAAwC;AAC1D,YAAQ,MAAM,UAAU,IAAI,aAAa,MAAM,SAAS,KAAK;EAC/D;AACA,aAAW,SAAS,0CAA0C;AAC5D,QAAI,aAAa,MAAM,GAAG,MAAM,MAAM;AACpC,cAAQ,MAAM,UAAU,IAAI;IAC9B;EACF;AACA,SAAO,OAAO,SAAS,iCAAiC,OAAO,GAAG,uBAAuB,OAAO,CAAC;AACjG,MAAI,YAAY;AACd,YAAQ,cAAc;EACxB;AACA,MAAI,aAAa;AACf,YAAQ,OAAO;AACf,YAAQ,aAAa,aAAa;EACpC;AACA,UAAQ,OAAO,aAAa;AAC5B,UAAQ,QAAQ,YAAY,YAAY;AACxC,UAAQ,kBAAkB;AAC1B,SAAO;AACT;AAKA,eAAsB,QAAQ,QAAgC,SAAsB,QAAqB;AACvG,QAAM,UAAU,MAAM,0BAA0B,SAAS,MAAM;AAC/D,QAAM,eAAyB,CAAA;AAC/B,QAAM,QAAQ,MAAM,cAAc,SAAS,SAAS,YAAY;AAChE,QAAM,WAAW,2BAA2B,OAAO;AACnD,QAAM,kBAAkB,2BAA2B,QAAQ,SAAS,QAAQ,cAAc;AAC1F,QAAM,WAAW,aACf,OACA,gBAAgB,gBAChB,gBAAgB,kBAChB,QAAQ,cACR,QAAQ,gBACR,QAAQ,mBAAmB;AAE7B,QAAM,SAAS,UAAU,UAAU,SAAS,WAAW,SAAS,WAAW,QAAQ,cAAc;AACjG,QAAM,UAAU,SAAS,cAAc,iBAAiB,QAAQ,SAAS,YAAY,SAAS,SAAS,IAAI;AAC3G,QAAM,aAAa,QAAQ,eAAe;AAC1C,QAAM,OAAO,wBAAwB,SAAS,SAAS,QAAQ,YAAY,SAAS,WAAW;AAC/F,QAAM,MAAM,OAAM;AAClB,QAAM,WAAW,CAAC,GAAG,IAAI,IAAI,YAAY,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AAC3F,QAAM,mBAAmB,QAAQ,WAAW,SAAS,SAAS,OAAO,CAAC,GAAG,QAAQ,WAAW,MAAM;AAClG,QAAM,qBAAqB,QAAQ,WAAW,SAAS,aAAa,QAAQ,YAAY;AACxF,MAAI,oBAAoB;AACtB,UAAM,iBAAiB,8BAA8B;MACnD,eAAe,gBAAgB;MAC/B;MACA,aAAa,SAAS;MACtB,WAAW,SAAS;MACpB,WAAW,SAAS;MACpB,WAAW,SAAS;MACpB,qBAAqB,QAAQ;KAC9B;AACD,WAAO;MACL,OAAO,KAAK;MACZ,OAAO,KAAK,UAAU;MACtB,GAAG,KAAK;MACR,SAAS;MACT,GAAI,SAAS,SAAS,IAAI,EAAE,SAAQ,IAAK,CAAA;;EAE7C;AACA,SAAO;IACL,OAAO,KAAK;IACZ,OAAO,KAAK,UAAU;IACtB,GAAG,KAAK;IACR,SAAS,wBAAwB;MAC/B,eAAe,gBAAgB;MAC/B;MACA;MACA,aAAa,SAAS;MACtB,WAAW,SAAS;MACpB,WAAW,SAAS;MACpB,WAAW,SAAS;MACpB,qBAAqB,QAAQ;KAC9B;IACD,YAAY;MACV,MAAM,QAAQ,WAAW;MACzB,QAAQ;;IAEV,SAAS;MACP,MAAM,SAAS,aAAa;MAC5B,OAAO,SAAS,YAAY,SAAS,YAAY;;IAEnD;IACA,GAAI,SAAS,SAAS,IAAI,EAAE,SAAQ,IAAK,CAAA;;AAE7C;AAEO,IAAM,YAAY;EACvB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA","debugId":"c7b76be2-958a-52c6-890e-b9f04df75659"}

package/dist/cli-bundle/chunks/chunk-425E4QL5.js

@@ -1,278 +0,0 @@
-import {
-  runSearch
-} from "./chunk-3KTN6IBA.js";
-import {
-  PmCliError
-} from "./chunk-SHQY2IDC.js";
-import {
-  EXIT_CODE,
-  coercePositiveInteger,
-  getSettingsPath,
-  pathExists,
-  resolvePmRoot
-} from "./chunk-LK6XLOGP.js";
-
-// dist/cli/commands/eval.js
-import fs from "node:fs/promises";
-import path from "node:path";
-
-// dist/core/search/eval.js
-!(function() {
-  try {
-    var e = "undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof globalThis ? globalThis : "undefined" != typeof self ? self : {}, n = new e.Error().stack;
-    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "4ed89138-1775-503e-a08f-7e94a0bd24eb");
-  } catch (e2) {
-  }
-})();
-var DEFAULT_EVAL_K = 10;
-var EvalQuerySetError = class extends Error {
-  /** Construct an error describing why a golden-query set failed validation. */
-  constructor(message) {
-    super(message);
-    this.name = "EvalQuerySetError";
-  }
-};
-var VALID_EVAL_MODES = /* @__PURE__ */ new Set(["keyword", "semantic", "hybrid"]);
-function dcgAtK(relevanceGains, k) {
-  let dcg = 0;
-  const limit = Math.min(k, relevanceGains.length);
-  for (let index = 0; index < limit; index += 1) {
-    dcg += relevanceGains[index] / Math.log2(index + 2);
-  }
-  return dcg;
-}
-function ndcgAtK(rankedIds, relevantIds, k) {
-  if (relevantIds.size === 0) {
-    return 0;
-  }
-  const gains = rankedIds.map((id) => relevantIds.has(id) ? 1 : 0);
-  const dcg = dcgAtK(gains, k);
-  const idealGains = Array.from({ length: relevantIds.size }, () => 1);
-  const idealDcg = dcgAtK(idealGains, k);
-  return idealDcg === 0 ? 0 : dcg / idealDcg;
-}
-function reciprocalRankAtK(rankedIds, relevantIds, k) {
-  const limit = Math.min(k, rankedIds.length);
-  for (let index = 0; index < limit; index += 1) {
-    if (relevantIds.has(rankedIds[index])) {
-      return 1 / (index + 1);
-    }
-  }
-  return 0;
-}
-function countRelevantInTopK(rankedIds, relevantIds, k) {
-  const limit = Math.min(k, rankedIds.length);
-  let hits = 0;
-  for (let index = 0; index < limit; index += 1) {
-    if (relevantIds.has(rankedIds[index])) {
-      hits += 1;
-    }
-  }
-  return hits;
-}
-function precisionAtK(rankedIds, relevantIds, k) {
-  if (k <= 0) {
-    return 0;
-  }
-  return countRelevantInTopK(rankedIds, relevantIds, k) / k;
-}
-function recallAtK(rankedIds, relevantIds, k) {
-  if (relevantIds.size === 0) {
-    return 0;
-  }
-  return countRelevantInTopK(rankedIds, relevantIds, k) / relevantIds.size;
-}
-function evaluateRanking(rankedIds, relevantIds, k) {
-  return {
-    ndcg: ndcgAtK(rankedIds, relevantIds, k),
-    mrr: reciprocalRankAtK(rankedIds, relevantIds, k),
-    precision: precisionAtK(rankedIds, relevantIds, k),
-    recall: recallAtK(rankedIds, relevantIds, k),
-    relevant_total: relevantIds.size,
-    retrieved_relevant: countRelevantInTopK(rankedIds, relevantIds, k)
-  };
-}
-function aggregateEvalMetrics(perQuery) {
-  const queryCount = perQuery.length;
-  if (queryCount === 0) {
-    return { ndcg: 0, mrr: 0, precision: 0, recall: 0, query_count: 0 };
-  }
-  const sum = perQuery.reduce((accumulator, metrics) => ({
-    ndcg: accumulator.ndcg + metrics.ndcg,
-    mrr: accumulator.mrr + metrics.mrr,
-    precision: accumulator.precision + metrics.precision,
-    recall: accumulator.recall + metrics.recall
-  }), { ndcg: 0, mrr: 0, precision: 0, recall: 0 });
-  return {
-    ndcg: sum.ndcg / queryCount,
-    mrr: sum.mrr / queryCount,
-    precision: sum.precision / queryCount,
-    recall: sum.recall / queryCount,
-    query_count: queryCount
-  };
-}
-function parseEvalQueryEntry(raw, index) {
-  if (typeof raw !== "object" || raw === null) {
-    throw new EvalQuerySetError(`Eval query at index ${index} must be an object`);
-  }
-  const entry = raw;
-  const query = typeof entry.query === "string" ? entry.query.trim() : "";
-  if (query.length === 0) {
-    throw new EvalQuerySetError(`Eval query at index ${index} must have a non-empty "query" string`);
-  }
-  if (!Array.isArray(entry.relevant_ids)) {
-    throw new EvalQuerySetError(`Eval query at index ${index} must have a "relevant_ids" array`);
-  }
-  if (entry.relevant_ids.some((value) => typeof value !== "string")) {
-    throw new EvalQuerySetError(`Eval query at index ${index} must have a "relevant_ids" array of strings`);
-  }
-  const relevantIds = [
-    ...new Set(entry.relevant_ids.map((value) => value.trim()).filter((value) => value.length > 0))
-  ];
-  if (relevantIds.length === 0) {
-    throw new EvalQuerySetError(`Eval query at index ${index} must list at least one relevant id`);
-  }
-  if (entry.mode !== void 0 && (typeof entry.mode !== "string" || !VALID_EVAL_MODES.has(entry.mode))) {
-    throw new EvalQuerySetError(`Eval query at index ${index} has an invalid mode (expected keyword|semantic|hybrid)`);
-  }
-  return {
-    query,
-    relevant_ids: relevantIds,
-    ...entry.mode !== void 0 ? { mode: entry.mode } : {},
-    ...typeof entry.description === "string" && entry.description.trim().length > 0 ? { description: entry.description.trim() } : {}
-  };
-}
-function parseEvalQuerySet(raw) {
-  const rawQueries = Array.isArray(raw) ? raw : typeof raw === "object" && raw !== null ? raw.queries : void 0;
-  if (!Array.isArray(rawQueries)) {
-    throw new EvalQuerySetError('Eval query set must be an array of queries or an object with a "queries" array');
-  }
-  if (rawQueries.length === 0) {
-    throw new EvalQuerySetError("Eval query set must contain at least one query");
-  }
-  return {
-    queries: rawQueries.map((entry, index) => parseEvalQueryEntry(entry, index))
-  };
-}
-
-// dist/cli/commands/eval.js
-!(function() {
-  try {
-    var e = "undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof globalThis ? globalThis : "undefined" != typeof self ? self : {}, n = new e.Error().stack;
-    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "fa1fece2-ddfb-537d-af39-fcd4ab8b5972");
-  } catch (e2) {
-  }
-})();
-var DEFAULT_EVAL_QUERIES_RELATIVE_PATH = path.join("search", "eval-queries.json");
-var VALID_EVAL_MODES2 = /* @__PURE__ */ new Set(["keyword", "semantic", "hybrid"]);
-function parseEvalMode(raw) {
-  if (raw === void 0) {
-    return "keyword";
-  }
-  const normalized = raw.trim().toLowerCase();
-  if (!VALID_EVAL_MODES2.has(normalized)) {
-    throw new PmCliError("Eval --mode must be one of keyword|semantic|hybrid", EXIT_CODE.USAGE);
-  }
-  return normalized;
-}
-function parseEvalK(raw) {
-  if (raw === void 0 || raw === "") {
-    return DEFAULT_EVAL_K;
-  }
-  const parsed = coercePositiveInteger(raw);
-  if (parsed === null) {
-    throw new PmCliError("Eval --k must be a positive integer", EXIT_CODE.USAGE);
-  }
-  return parsed;
-}
-function parseFailUnder(raw) {
-  if (raw === void 0 || raw === "") {
-    return void 0;
-  }
-  const parsed = typeof raw === "number" ? raw : Number(String(raw).trim());
-  if (!Number.isFinite(parsed) || parsed < 0 || parsed > 1) {
-    throw new PmCliError("Eval --fail-under must be a number in the range [0, 1]", EXIT_CODE.USAGE);
-  }
-  return parsed;
-}
-function roundMetric(value) {
-  return Math.round(value * 1e4) / 1e4;
-}
-async function loadEvalQuerySet(queriesPath) {
-  let raw;
-  try {
-    raw = await fs.readFile(queriesPath, "utf8");
-  } catch {
-    throw new PmCliError(`Eval query set not found at ${queriesPath}`, EXIT_CODE.NOT_FOUND, {
-      examples: [
-        `echo '[{"query":"offline search","relevant_ids":["pm-75k9"]}]' > ` + queriesPath,
-        "pm eval --queries ./my-eval.json"
-      ],
-      nextSteps: [
-        "Create a git-tracked golden-query JSON file (an array of {query, relevant_ids, mode?} objects), then re-run pm eval."
-      ]
-    });
-  }
-  let parsed;
-  try {
-    parsed = JSON.parse(raw);
-  } catch (error) {
-    throw new PmCliError(`Eval query set at ${queriesPath} is not valid JSON: ${error.message}`, EXIT_CODE.USAGE);
-  }
-  try {
-    return parseEvalQuerySet(parsed);
-  } catch (error) {
-    throw new PmCliError(error.message, EXIT_CODE.USAGE);
-  }
-}
-async function runEval(options, global2) {
-  const pmRoot = resolvePmRoot(process.cwd(), global2.path);
-  if (!await pathExists(getSettingsPath(pmRoot))) {
-    throw new PmCliError(`Tracker is not initialized at ${pmRoot}. Run pm init first.`, EXIT_CODE.NOT_FOUND);
-  }
-  const k = parseEvalK(options.k);
-  const defaultMode = parseEvalMode(options.mode);
-  const failUnder = parseFailUnder(options.failUnder);
-  const queriesPath = options.queries ? path.resolve(process.cwd(), options.queries) : path.join(pmRoot, DEFAULT_EVAL_QUERIES_RELATIVE_PATH);
-  const querySet = await loadEvalQuerySet(queriesPath);
-  const reports = [];
-  const rawMetrics = [];
-  for (const evalQuery of querySet.queries) {
-    const mode = evalQuery.mode ?? defaultMode;
-    const searchResult = await runSearch(evalQuery.query, { mode, limit: String(k), fields: "id" }, global2);
-    const rankedIds = searchResult.items.map((item) => item.id).filter((id) => typeof id === "string");
-    const metrics = evaluateRanking(rankedIds, new Set(evalQuery.relevant_ids), k);
-    rawMetrics.push(metrics);
-    reports.push({
-      query: evalQuery.query,
-      mode,
-      relevant_total: metrics.relevant_total,
-      retrieved_relevant: metrics.retrieved_relevant,
-      ndcg: roundMetric(metrics.ndcg),
-      mrr: roundMetric(metrics.mrr),
-      precision: roundMetric(metrics.precision),
-      recall: roundMetric(metrics.recall)
-    });
-  }
-  const aggregate = aggregateEvalMetrics(rawMetrics);
-  const passed = failUnder === void 0 || aggregate.ndcg >= failUnder;
-  return {
-    k,
-    query_count: querySet.queries.length,
-    aggregate: {
-      ndcg: roundMetric(aggregate.ndcg),
-      mrr: roundMetric(aggregate.mrr),
-      precision: roundMetric(aggregate.precision),
-      recall: roundMetric(aggregate.recall)
-    },
-    queries: reports,
-    ...failUnder !== void 0 ? { fail_under: failUnder } : {},
-    passed
-  };
-}
-
-export {
-  DEFAULT_EVAL_QUERIES_RELATIVE_PATH,
-  runEval
-};
-//# sourceMappingURL=chunk-425E4QL5.js.map

package/dist/cli-bundle/chunks/chunk-425E4QL5.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../../../../../../../cli/commands/eval.ts", "../../../../../../../../core/search/eval.ts"],
-  "sourcesContent": ["/**\n * @module cli/commands/eval\n *\n * Implements the `pm eval` command surface (pm-u8n5): a search-relevance\n * evaluation runner that scores a human-curated golden-query set against the\n * live retrieval path and reports nDCG@k, MRR@k, precision@k, and recall@k per\n * query plus the macro average. With `--fail-under` it doubles as a CI gate so\n * relevance regressions — from corpus changes, hybrid-weight changes, or\n * provider swaps (including the offline BM25 provider, pm-75k9) — fail the build\n * instead of silently degrading retrieval quality.\n */\nimport fs from \"node:fs/promises\";\nimport path from \"node:path\";\nimport {\n  aggregateEvalMetrics,\n  DEFAULT_EVAL_K,\n  evaluateRanking,\n  parseEvalQuerySet,\n  type EvalSearchMode,\n  type QueryEvalMetrics,\n} from \"../../core/search/eval.js\";\nimport { EXIT_CODE } from \"../../core/shared/constants.js\";\nimport type { GlobalOptions } from \"../../core/shared/command-types.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { coercePositiveInteger } from \"../../core/shared/primitives.js\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { runSearch } from \"./search.js\";\n\n/**\n * Relative location (under the pm root) of the default golden-query set. A\n * git-tracked, human-curated file so relevance ground truth lives alongside the\n * tracker it evaluates.\n */\nexport const DEFAULT_EVAL_QUERIES_RELATIVE_PATH = path.join(\"search\", \"eval-queries.json\");\n\n/**\n * Documents the eval command options payload exchanged by command, SDK, and package integrations.\n */\nexport interface EvalOptions {\n  /** Default retrieval mode for queries that do not set their own (keyword|semantic|hybrid). */\n  mode?: string;\n  /** Metric cutoff (`@k`); positive integer, defaults to {@link DEFAULT_EVAL_K}. */\n  k?: string | number;\n  /** Gate threshold: exit non-zero when the aggregate nDCG@k falls below this `[0,1]` value. */\n  failUnder?: string | number;\n  /** Override path to the golden-query JSON file (defaults to `<pmRoot>/search/eval-queries.json`). */\n  queries?: string;\n  /** Output format override: json|toon. */\n  format?: string;\n}\n\n/** Per-query relevance report row emitted by {@link runEval}. */\nexport interface EvalQueryReport {\n  query: string;\n  mode: EvalSearchMode;\n  relevant_total: number;\n  retrieved_relevant: number;\n  ndcg: number;\n  mrr: number;\n  precision: number;\n  recall: number;\n}\n\n/**\n * Documents the eval result payload exchanged by command, SDK, and package integrations.\n */\nexport interface EvalResult {\n  k: number;\n  query_count: number;\n  aggregate: {\n    ndcg: number;\n    mrr: number;\n    precision: number;\n    recall: number;\n  };\n  queries: EvalQueryReport[];\n  /** Present only when `--fail-under` was supplied. */\n  fail_under?: number;\n  /** Whether the aggregate nDCG met the gate (always true when no gate is set). */\n  passed: boolean;\n}\n\nconst VALID_EVAL_MODES: ReadonlySet<string> = new Set<EvalSearchMode>([\"keyword\", \"semantic\", \"hybrid\"]);\n\nfunction parseEvalMode(raw: string | undefined): EvalSearchMode {\n  if (raw === undefined) {\n    return \"keyword\";\n  }\n  const normalized = raw.trim().toLowerCase();\n  if (!VALID_EVAL_MODES.has(normalized)) {\n    throw new PmCliError(\"Eval --mode must be one of keyword|semantic|hybrid\", EXIT_CODE.USAGE);\n  }\n  return normalized as EvalSearchMode;\n}\n\nfunction parseEvalK(raw: string | number | undefined): number {\n  if (raw === undefined || raw === \"\") {\n    return DEFAULT_EVAL_K;\n  }\n  const parsed = coercePositiveInteger(raw);\n  if (parsed === null) {\n    throw new PmCliError(\"Eval --k must be a positive integer\", EXIT_CODE.USAGE);\n  }\n  return parsed;\n}\n\nfunction parseFailUnder(raw: string | number | undefined): number | undefined {\n  if (raw === undefined || raw === \"\") {\n    return undefined;\n  }\n  const parsed = typeof raw === \"number\" ? raw : Number(String(raw).trim());\n  if (!Number.isFinite(parsed) || parsed < 0 || parsed > 1) {\n    throw new PmCliError(\"Eval --fail-under must be a number in the range [0, 1]\", EXIT_CODE.USAGE);\n  }\n  return parsed;\n}\n\n/** Round a metric to four decimals to keep the JSON output compact and stable. */\nfunction roundMetric(value: number): number {\n  return Math.round(value * 10_000) / 10_000;\n}\n\nasync function loadEvalQuerySet(queriesPath: string): Promise<ReturnType<typeof parseEvalQuerySet>> {\n  let raw: string;\n  try {\n    raw = await fs.readFile(queriesPath, \"utf8\");\n  } catch {\n    throw new PmCliError(`Eval query set not found at ${queriesPath}`, EXIT_CODE.NOT_FOUND, {\n      examples: [\n        'echo \\'[{\"query\":\"offline search\",\"relevant_ids\":[\"pm-75k9\"]}]\\' > ' + queriesPath,\n        \"pm eval --queries ./my-eval.json\",\n      ],\n      nextSteps: [\n        \"Create a git-tracked golden-query JSON file (an array of {query, relevant_ids, mode?} objects), then re-run pm eval.\",\n      ],\n    });\n  }\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(raw);\n  } catch (error: unknown) {\n    // JSON.parse only ever throws a SyntaxError (an Error subclass).\n    throw new PmCliError(\n      `Eval query set at ${queriesPath} is not valid JSON: ${(error as Error).message}`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  try {\n    return parseEvalQuerySet(parsed);\n  } catch (error: unknown) {\n    // parseEvalQuerySet only ever throws EvalQuerySetError (an Error subclass\n    // with a precise, author-actionable message) — surface it as a usage error.\n    throw new PmCliError((error as Error).message, EXIT_CODE.USAGE);\n  }\n}\n\n/**\n * Run the search-relevance evaluation (pm-u8n5). Loads the golden-query set\n * (default `<pmRoot>/search/eval-queries.json`, overridable via `--queries`),\n * runs each query through {@link runSearch} at the resolved mode, scores the\n * returned ranking with the nDCG/MRR/precision/recall metrics, and macro-averages\n * across queries. When `--fail-under` is supplied, `passed` reflects whether the\n * aggregate nDCG@k cleared the threshold; the CLI layer maps a failed gate to a\n * non-zero exit code.\n */\nexport async function runEval(options: EvalOptions, global: GlobalOptions): Promise<EvalResult> {\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  const k = parseEvalK(options.k);\n  const defaultMode = parseEvalMode(options.mode);\n  const failUnder = parseFailUnder(options.failUnder);\n  const queriesPath = options.queries\n    ? path.resolve(process.cwd(), options.queries)\n    : path.join(pmRoot, DEFAULT_EVAL_QUERIES_RELATIVE_PATH);\n  const querySet = await loadEvalQuerySet(queriesPath);\n\n  const reports: EvalQueryReport[] = [];\n  // Aggregate and gate on the UNROUNDED metrics; rounding is applied only to the\n  // emitted report values so display precision never flips a --fail-under decision.\n  const rawMetrics: QueryEvalMetrics[] = [];\n  for (const evalQuery of querySet.queries) {\n    const mode = evalQuery.mode ?? defaultMode;\n    const searchResult = await runSearch(\n      evalQuery.query,\n      { mode, limit: String(k), fields: \"id\" },\n      global,\n    );\n    const rankedIds = searchResult.items\n      .map((item) => (item as { id?: unknown }).id)\n      .filter((id): id is string => typeof id === \"string\");\n    const metrics = evaluateRanking(rankedIds, new Set(evalQuery.relevant_ids), k);\n    rawMetrics.push(metrics);\n    reports.push({\n      query: evalQuery.query,\n      mode,\n      relevant_total: metrics.relevant_total,\n      retrieved_relevant: metrics.retrieved_relevant,\n      ndcg: roundMetric(metrics.ndcg),\n      mrr: roundMetric(metrics.mrr),\n      precision: roundMetric(metrics.precision),\n      recall: roundMetric(metrics.recall),\n    });\n  }\n\n  const aggregate = aggregateEvalMetrics(rawMetrics);\n  const passed = failUnder === undefined || aggregate.ndcg >= failUnder;\n  return {\n    k,\n    query_count: querySet.queries.length,\n    aggregate: {\n      ndcg: roundMetric(aggregate.ndcg),\n      mrr: roundMetric(aggregate.mrr),\n      precision: roundMetric(aggregate.precision),\n      recall: roundMetric(aggregate.recall),\n    },\n    queries: reports,\n    ...(failUnder !== undefined ? { fail_under: failUnder } : {}),\n    passed,\n  };\n}\n", "/**\n * @module core/search/eval\n *\n * Search relevance evaluation primitives (pm-u8n5). Implements the standard\n * offline ranking metrics — nDCG@k, MRR@k, precision@k, recall@k — over a\n * human-curated golden-query set, plus the loader/validator for that set. The\n * `pm eval` command (src/cli/commands/eval.ts) runs each golden query through\n * the live retrieval path and feeds the ranked ids here, so relevance\n * regressions from corpus changes, hybrid-weight changes, or provider swaps are\n * measurable and gateable in CI.\n *\n * Relevance is binary: an id is either in a query's `relevant_ids` set or it is\n * not. This keeps the golden set cheap to curate while still supporting the\n * graded-discount behavior of DCG (earlier hits are worth more).\n */\n\n/**\n * Retrieval mode a golden query is evaluated under. Mirrors the `pm search`\n * mode surface; omitting it on a query defers to the eval run's default mode.\n */\nexport type EvalSearchMode = \"keyword\" | \"semantic\" | \"hybrid\";\n\n/** Default cutoff (`@k`) used for every metric when the caller does not override it. */\nexport const DEFAULT_EVAL_K = 10;\n\n/**\n * One curated golden query: the query text, the set of item ids considered\n * relevant, an optional per-query retrieval mode override, and an optional\n * human-readable description of the relevance intent.\n */\nexport interface EvalQuery {\n  query: string;\n  relevant_ids: string[];\n  mode?: EvalSearchMode;\n  description?: string;\n}\n\n/** A parsed, validated golden-query set. */\nexport interface EvalQuerySet {\n  queries: EvalQuery[];\n}\n\n/**\n * Thrown by {@link parseEvalQuerySet} when the raw golden-query payload is\n * structurally invalid. Carries a precise, human-actionable message naming the\n * offending query index/field so an author can fix the JSON directly.\n */\nexport class EvalQuerySetError extends Error {\n  /** Construct an error describing why a golden-query set failed validation. */\n  constructor(message: string) {\n    super(message);\n    this.name = \"EvalQuerySetError\";\n  }\n}\n\nconst VALID_EVAL_MODES: ReadonlySet<string> = new Set<EvalSearchMode>([\"keyword\", \"semantic\", \"hybrid\"]);\n\n/**\n * Compute Discounted Cumulative Gain at cutoff `k` for an ordered list of binary\n * relevance gains (`1` relevant, `0` not). Position `i` (1-based) contributes\n * `gain / log2(i + 1)`, so a relevant hit ranked first is worth `1` and later\n * hits are progressively discounted. Gains beyond `k` are ignored.\n */\nexport function dcgAtK(relevanceGains: number[], k: number): number {\n  let dcg = 0;\n  const limit = Math.min(k, relevanceGains.length);\n  for (let index = 0; index < limit; index += 1) {\n    dcg += relevanceGains[index] / Math.log2(index + 2);\n  }\n  return dcg;\n}\n\n/**\n * Normalized DCG at cutoff `k`: the ranking's DCG divided by the DCG of the\n * ideal ranking (all relevant ids first). Returns `0` when the query has no\n * relevant ids (the ideal DCG is `0` and the score is undefined), giving a\n * stable lower bound for aggregation. Result is in `[0, 1]`.\n */\nexport function ndcgAtK(rankedIds: string[], relevantIds: ReadonlySet<string>, k: number): number {\n  if (relevantIds.size === 0) {\n    return 0;\n  }\n  const gains = rankedIds.map((id) => (relevantIds.has(id) ? 1 : 0));\n  const dcg = dcgAtK(gains, k);\n  const idealGains = Array.from({ length: relevantIds.size }, () => 1);\n  const idealDcg = dcgAtK(idealGains, k);\n  return idealDcg === 0 ? 0 : dcg / idealDcg;\n}\n\n/**\n * Reciprocal rank of the first relevant id within the top `k` results: `1/rank`\n * (rank is 1-based), or `0` when no relevant id appears in the cutoff. Averaged\n * across queries this is Mean Reciprocal Rank (MRR@k).\n */\nexport function reciprocalRankAtK(rankedIds: string[], relevantIds: ReadonlySet<string>, k: number): number {\n  const limit = Math.min(k, rankedIds.length);\n  for (let index = 0; index < limit; index += 1) {\n    if (relevantIds.has(rankedIds[index])) {\n      return 1 / (index + 1);\n    }\n  }\n  return 0;\n}\n\n/**\n * Count relevant ids within the top `k` results (shared by precision and\n * recall).\n */\nfunction countRelevantInTopK(rankedIds: string[], relevantIds: ReadonlySet<string>, k: number): number {\n  const limit = Math.min(k, rankedIds.length);\n  let hits = 0;\n  for (let index = 0; index < limit; index += 1) {\n    if (relevantIds.has(rankedIds[index])) {\n      hits += 1;\n    }\n  }\n  return hits;\n}\n\n/**\n * Precision at cutoff `k`: relevant ids retrieved in the top `k` divided by `k`.\n * Returns `0` for a non-positive `k`.\n */\nexport function precisionAtK(rankedIds: string[], relevantIds: ReadonlySet<string>, k: number): number {\n  if (k <= 0) {\n    return 0;\n  }\n  return countRelevantInTopK(rankedIds, relevantIds, k) / k;\n}\n\n/**\n * Recall at cutoff `k`: relevant ids retrieved in the top `k` divided by the\n * total number of relevant ids. Returns `0` when the query has no relevant ids.\n */\nexport function recallAtK(rankedIds: string[], relevantIds: ReadonlySet<string>, k: number): number {\n  if (relevantIds.size === 0) {\n    return 0;\n  }\n  return countRelevantInTopK(rankedIds, relevantIds, k) / relevantIds.size;\n}\n\n/** The four ranking metrics computed for a single query, plus match counts. */\nexport interface QueryEvalMetrics {\n  ndcg: number;\n  mrr: number;\n  precision: number;\n  recall: number;\n  relevant_total: number;\n  retrieved_relevant: number;\n}\n\n/**\n * Evaluate one ranking against its relevant-id set at cutoff `k`, returning all\n * four metrics together so callers compute the document ranking once and read\n * every score off the result.\n */\nexport function evaluateRanking(rankedIds: string[], relevantIds: ReadonlySet<string>, k: number): QueryEvalMetrics {\n  return {\n    ndcg: ndcgAtK(rankedIds, relevantIds, k),\n    mrr: reciprocalRankAtK(rankedIds, relevantIds, k),\n    precision: precisionAtK(rankedIds, relevantIds, k),\n    recall: recallAtK(rankedIds, relevantIds, k),\n    relevant_total: relevantIds.size,\n    retrieved_relevant: countRelevantInTopK(rankedIds, relevantIds, k),\n  };\n}\n\n/** Macro-averaged metrics across all evaluated queries. */\nexport interface AggregateEvalMetrics {\n  ndcg: number;\n  mrr: number;\n  precision: number;\n  recall: number;\n  query_count: number;\n}\n\n/**\n * Macro-average per-query metrics (each query weighted equally). Returns all\n * zeros with `query_count: 0` for an empty input so the gate path has a stable\n * shape to compare against.\n */\nexport function aggregateEvalMetrics(perQuery: QueryEvalMetrics[]): AggregateEvalMetrics {\n  const queryCount = perQuery.length;\n  if (queryCount === 0) {\n    return { ndcg: 0, mrr: 0, precision: 0, recall: 0, query_count: 0 };\n  }\n  const sum = perQuery.reduce(\n    (accumulator, metrics) => ({\n      ndcg: accumulator.ndcg + metrics.ndcg,\n      mrr: accumulator.mrr + metrics.mrr,\n      precision: accumulator.precision + metrics.precision,\n      recall: accumulator.recall + metrics.recall,\n    }),\n    { ndcg: 0, mrr: 0, precision: 0, recall: 0 },\n  );\n  return {\n    ndcg: sum.ndcg / queryCount,\n    mrr: sum.mrr / queryCount,\n    precision: sum.precision / queryCount,\n    recall: sum.recall / queryCount,\n    query_count: queryCount,\n  };\n}\n\n/**\n * Validate one raw golden-query entry, returning a typed {@link EvalQuery}.\n * Throws {@link EvalQuerySetError} (with the entry index) for a missing/empty\n * `query`, a `relevant_ids` that is not a non-empty string array, or an invalid\n * `mode`. `relevant_ids` are trimmed and de-duplicated; `description` is kept\n * only when it is a non-empty string.\n */\nfunction parseEvalQueryEntry(raw: unknown, index: number): EvalQuery {\n  if (typeof raw !== \"object\" || raw === null) {\n    throw new EvalQuerySetError(`Eval query at index ${index} must be an object`);\n  }\n  const entry = raw as { query?: unknown; relevant_ids?: unknown; mode?: unknown; description?: unknown };\n  const query = typeof entry.query === \"string\" ? entry.query.trim() : \"\";\n  if (query.length === 0) {\n    throw new EvalQuerySetError(`Eval query at index ${index} must have a non-empty \"query\" string`);\n  }\n  if (!Array.isArray(entry.relevant_ids)) {\n    throw new EvalQuerySetError(`Eval query at index ${index} must have a \"relevant_ids\" array`);\n  }\n  if (entry.relevant_ids.some((value) => typeof value !== \"string\")) {\n    // Reject (rather than silently drop) non-string members: malformed golden\n    // data must fail loudly so it can never quietly change relevance judgments.\n    throw new EvalQuerySetError(`Eval query at index ${index} must have a \"relevant_ids\" array of strings`);\n  }\n  const relevantIds = [\n    ...new Set((entry.relevant_ids as string[]).map((value) => value.trim()).filter((value) => value.length > 0)),\n  ];\n  if (relevantIds.length === 0) {\n    throw new EvalQuerySetError(`Eval query at index ${index} must list at least one relevant id`);\n  }\n  if (entry.mode !== undefined && (typeof entry.mode !== \"string\" || !VALID_EVAL_MODES.has(entry.mode))) {\n    throw new EvalQuerySetError(`Eval query at index ${index} has an invalid mode (expected keyword|semantic|hybrid)`);\n  }\n  return {\n    query,\n    relevant_ids: relevantIds,\n    ...(entry.mode !== undefined ? { mode: entry.mode as EvalSearchMode } : {}),\n    ...(typeof entry.description === \"string\" && entry.description.trim().length > 0\n      ? { description: entry.description.trim() }\n      : {}),\n  };\n}\n\n/**\n * Parse and validate a raw golden-query payload (typically `JSON.parse` of\n * `.agents/pm/search/eval-queries.json`). Accepts either a bare array of query\n * entries or an object with a `queries` array. Throws {@link EvalQuerySetError}\n * with a precise message when the payload is not an array/object, when\n * `queries` is missing/not an array, when the set is empty, or when any entry\n * fails {@link parseEvalQueryEntry}.\n */\nexport function parseEvalQuerySet(raw: unknown): EvalQuerySet {\n  const rawQueries = Array.isArray(raw)\n    ? raw\n    : typeof raw === \"object\" && raw !== null\n      ? (raw as { queries?: unknown }).queries\n      : undefined;\n  if (!Array.isArray(rawQueries)) {\n    throw new EvalQuerySetError('Eval query set must be an array of queries or an object with a \"queries\" array');\n  }\n  if (rawQueries.length === 0) {\n    throw new EvalQuerySetError(\"Eval query set must contain at least one query\");\n  }\n  return {\n    queries: rawQueries.map((entry, index) => parseEvalQueryEntry(entry, index)),\n  };\n}\n"],
-  "mappings": ";;;;;;;;;;;;;;;AAWA,OAAO,QAAQ;AACf,OAAO,UAAU;;;;;;;;;;ACWV,IAAM,iBAAiB;AAwBxB,IAAO,oBAAP,cAAiC,MAAK;;EAE1C,YAAY,SAAe;AACzB,UAAM,OAAO;AACb,SAAK,OAAO;EACd;;AAGF,IAAM,mBAAwC,oBAAI,IAAoB,CAAC,WAAW,YAAY,QAAQ,CAAC;AAQjG,SAAU,OAAO,gBAA0B,GAAS;AACxD,MAAI,MAAM;AACV,QAAM,QAAQ,KAAK,IAAI,GAAG,eAAe,MAAM;AAC/C,WAAS,QAAQ,GAAG,QAAQ,OAAO,SAAS,GAAG;AAC7C,WAAO,eAAe,KAAK,IAAI,KAAK,KAAK,QAAQ,CAAC;EACpD;AACA,SAAO;AACT;AAQM,SAAU,QAAQ,WAAqB,aAAkC,GAAS;AACtF,MAAI,YAAY,SAAS,GAAG;AAC1B,WAAO;EACT;AACA,QAAM,QAAQ,UAAU,IAAI,CAAC,OAAQ,YAAY,IAAI,EAAE,IAAI,IAAI,CAAE;AACjE,QAAM,MAAM,OAAO,OAAO,CAAC;AAC3B,QAAM,aAAa,MAAM,KAAK,EAAE,QAAQ,YAAY,KAAI,GAAI,MAAM,CAAC;AACnE,QAAM,WAAW,OAAO,YAAY,CAAC;AACrC,SAAO,aAAa,IAAI,IAAI,MAAM;AACpC;AAOM,SAAU,kBAAkB,WAAqB,aAAkC,GAAS;AAChG,QAAM,QAAQ,KAAK,IAAI,GAAG,UAAU,MAAM;AAC1C,WAAS,QAAQ,GAAG,QAAQ,OAAO,SAAS,GAAG;AAC7C,QAAI,YAAY,IAAI,UAAU,KAAK,CAAC,GAAG;AACrC,aAAO,KAAK,QAAQ;IACtB;EACF;AACA,SAAO;AACT;AAMA,SAAS,oBAAoB,WAAqB,aAAkC,GAAS;AAC3F,QAAM,QAAQ,KAAK,IAAI,GAAG,UAAU,MAAM;AAC1C,MAAI,OAAO;AACX,WAAS,QAAQ,GAAG,QAAQ,OAAO,SAAS,GAAG;AAC7C,QAAI,YAAY,IAAI,UAAU,KAAK,CAAC,GAAG;AACrC,cAAQ;IACV;EACF;AACA,SAAO;AACT;AAMM,SAAU,aAAa,WAAqB,aAAkC,GAAS;AAC3F,MAAI,KAAK,GAAG;AACV,WAAO;EACT;AACA,SAAO,oBAAoB,WAAW,aAAa,CAAC,IAAI;AAC1D;AAMM,SAAU,UAAU,WAAqB,aAAkC,GAAS;AACxF,MAAI,YAAY,SAAS,GAAG;AAC1B,WAAO;EACT;AACA,SAAO,oBAAoB,WAAW,aAAa,CAAC,IAAI,YAAY;AACtE;AAiBM,SAAU,gBAAgB,WAAqB,aAAkC,GAAS;AAC9F,SAAO;IACL,MAAM,QAAQ,WAAW,aAAa,CAAC;IACvC,KAAK,kBAAkB,WAAW,aAAa,CAAC;IAChD,WAAW,aAAa,WAAW,aAAa,CAAC;IACjD,QAAQ,UAAU,WAAW,aAAa,CAAC;IAC3C,gBAAgB,YAAY;IAC5B,oBAAoB,oBAAoB,WAAW,aAAa,CAAC;;AAErE;AAgBM,SAAU,qBAAqB,UAA4B;AAC/D,QAAM,aAAa,SAAS;AAC5B,MAAI,eAAe,GAAG;AACpB,WAAO,EAAE,MAAM,GAAG,KAAK,GAAG,WAAW,GAAG,QAAQ,GAAG,aAAa,EAAC;EACnE;AACA,QAAM,MAAM,SAAS,OACnB,CAAC,aAAa,aAAa;IACzB,MAAM,YAAY,OAAO,QAAQ;IACjC,KAAK,YAAY,MAAM,QAAQ;IAC/B,WAAW,YAAY,YAAY,QAAQ;IAC3C,QAAQ,YAAY,SAAS,QAAQ;MAEvC,EAAE,MAAM,GAAG,KAAK,GAAG,WAAW,GAAG,QAAQ,EAAC,CAAE;AAE9C,SAAO;IACL,MAAM,IAAI,OAAO;IACjB,KAAK,IAAI,MAAM;IACf,WAAW,IAAI,YAAY;IAC3B,QAAQ,IAAI,SAAS;IACrB,aAAa;;AAEjB;AASA,SAAS,oBAAoB,KAAc,OAAa;AACtD,MAAI,OAAO,QAAQ,YAAY,QAAQ,MAAM;AAC3C,UAAM,IAAI,kBAAkB,uBAAuB,KAAK,oBAAoB;EAC9E;AACA,QAAM,QAAQ;AACd,QAAM,QAAQ,OAAO,MAAM,UAAU,WAAW,MAAM,MAAM,KAAI,IAAK;AACrE,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,kBAAkB,uBAAuB,KAAK,uCAAuC;EACjG;AACA,MAAI,CAAC,MAAM,QAAQ,MAAM,YAAY,GAAG;AACtC,UAAM,IAAI,kBAAkB,uBAAuB,KAAK,mCAAmC;EAC7F;AACA,MAAI,MAAM,aAAa,KAAK,CAAC,UAAU,OAAO,UAAU,QAAQ,GAAG;AAGjE,UAAM,IAAI,kBAAkB,uBAAuB,KAAK,8CAA8C;EACxG;AACA,QAAM,cAAc;IAClB,GAAG,IAAI,IAAK,MAAM,aAA0B,IAAI,CAAC,UAAU,MAAM,KAAI,CAAE,EAAE,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC,CAAC;;AAE9G,MAAI,YAAY,WAAW,GAAG;AAC5B,UAAM,IAAI,kBAAkB,uBAAuB,KAAK,qCAAqC;EAC/F;AACA,MAAI,MAAM,SAAS,WAAc,OAAO,MAAM,SAAS,YAAY,CAAC,iBAAiB,IAAI,MAAM,IAAI,IAAI;AACrG,UAAM,IAAI,kBAAkB,uBAAuB,KAAK,yDAAyD;EACnH;AACA,SAAO;IACL;IACA,cAAc;IACd,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,KAAsB,IAAK,CAAA;IACxE,GAAI,OAAO,MAAM,gBAAgB,YAAY,MAAM,YAAY,KAAI,EAAG,SAAS,IAC3E,EAAE,aAAa,MAAM,YAAY,KAAI,EAAE,IACvC,CAAA;;AAER;AAUM,SAAU,kBAAkB,KAAY;AAC5C,QAAM,aAAa,MAAM,QAAQ,GAAG,IAChC,MACA,OAAO,QAAQ,YAAY,QAAQ,OAChC,IAA8B,UAC/B;AACN,MAAI,CAAC,MAAM,QAAQ,UAAU,GAAG;AAC9B,UAAM,IAAI,kBAAkB,gFAAgF;EAC9G;AACA,MAAI,WAAW,WAAW,GAAG;AAC3B,UAAM,IAAI,kBAAkB,gDAAgD;EAC9E;AACA,SAAO;IACL,SAAS,WAAW,IAAI,CAAC,OAAO,UAAU,oBAAoB,OAAO,KAAK,CAAC;;AAE/E;;;;;;;;;;AD5OO,IAAM,qCAAqC,KAAK,KAAK,UAAU,mBAAmB;AAiDzF,IAAMA,oBAAwC,oBAAI,IAAoB,CAAC,WAAW,YAAY,QAAQ,CAAC;AAEvG,SAAS,cAAc,KAAuB;AAC5C,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,MAAI,CAACA,kBAAiB,IAAI,UAAU,GAAG;AACrC,UAAM,IAAI,WAAW,sDAAsD,UAAU,KAAK;EAC5F;AACA,SAAO;AACT;AAEA,SAAS,WAAW,KAAgC;AAClD,MAAI,QAAQ,UAAa,QAAQ,IAAI;AACnC,WAAO;EACT;AACA,QAAM,SAAS,sBAAsB,GAAG;AACxC,MAAI,WAAW,MAAM;AACnB,UAAM,IAAI,WAAW,uCAAuC,UAAU,KAAK;EAC7E;AACA,SAAO;AACT;AAEA,SAAS,eAAe,KAAgC;AACtD,MAAI,QAAQ,UAAa,QAAQ,IAAI;AACnC,WAAO;EACT;AACA,QAAM,SAAS,OAAO,QAAQ,WAAW,MAAM,OAAO,OAAO,GAAG,EAAE,KAAI,CAAE;AACxE,MAAI,CAAC,OAAO,SAAS,MAAM,KAAK,SAAS,KAAK,SAAS,GAAG;AACxD,UAAM,IAAI,WAAW,0DAA0D,UAAU,KAAK;EAChG;AACA,SAAO;AACT;AAGA,SAAS,YAAY,OAAa;AAChC,SAAO,KAAK,MAAM,QAAQ,GAAM,IAAI;AACtC;AAEA,eAAe,iBAAiB,aAAmB;AACjD,MAAI;AACJ,MAAI;AACF,UAAM,MAAM,GAAG,SAAS,aAAa,MAAM;EAC7C,QAAQ;AACN,UAAM,IAAI,WAAW,+BAA+B,WAAW,IAAI,UAAU,WAAW;MACtF,UAAU;QACR,sEAAwE;QACxE;;MAEF,WAAW;QACT;;KAEH;EACH;AACA,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,GAAG;EACzB,SAAS,OAAgB;AAEvB,UAAM,IAAI,WACR,qBAAqB,WAAW,uBAAwB,MAAgB,OAAO,IAC/E,UAAU,KAAK;EAEnB;AACA,MAAI;AACF,WAAO,kBAAkB,MAAM;EACjC,SAAS,OAAgB;AAGvB,UAAM,IAAI,WAAY,MAAgB,SAAS,UAAU,KAAK;EAChE;AACF;AAWA,eAAsB,QAAQ,SAAsBC,SAAqB;AACvE,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAIA,QAAO,IAAI;AACvD,MAAI,CAAE,MAAM,WAAW,gBAAgB,MAAM,CAAC,GAAI;AAChD,UAAM,IAAI,WAAW,iCAAiC,MAAM,wBAAwB,UAAU,SAAS;EACzG;AACA,QAAM,IAAI,WAAW,QAAQ,CAAC;AAC9B,QAAM,cAAc,cAAc,QAAQ,IAAI;AAC9C,QAAM,YAAY,eAAe,QAAQ,SAAS;AAClD,QAAM,cAAc,QAAQ,UACxB,KAAK,QAAQ,QAAQ,IAAG,GAAI,QAAQ,OAAO,IAC3C,KAAK,KAAK,QAAQ,kCAAkC;AACxD,QAAM,WAAW,MAAM,iBAAiB,WAAW;AAEnD,QAAM,UAA6B,CAAA;AAGnC,QAAM,aAAiC,CAAA;AACvC,aAAW,aAAa,SAAS,SAAS;AACxC,UAAM,OAAO,UAAU,QAAQ;AAC/B,UAAM,eAAe,MAAM,UACzB,UAAU,OACV,EAAE,MAAM,OAAO,OAAO,CAAC,GAAG,QAAQ,KAAI,GACtCA,OAAM;AAER,UAAM,YAAY,aAAa,MAC5B,IAAI,CAAC,SAAU,KAA0B,EAAE,EAC3C,OAAO,CAAC,OAAqB,OAAO,OAAO,QAAQ;AACtD,UAAM,UAAU,gBAAgB,WAAW,IAAI,IAAI,UAAU,YAAY,GAAG,CAAC;AAC7E,eAAW,KAAK,OAAO;AACvB,YAAQ,KAAK;MACX,OAAO,UAAU;MACjB;MACA,gBAAgB,QAAQ;MACxB,oBAAoB,QAAQ;MAC5B,MAAM,YAAY,QAAQ,IAAI;MAC9B,KAAK,YAAY,QAAQ,GAAG;MAC5B,WAAW,YAAY,QAAQ,SAAS;MACxC,QAAQ,YAAY,QAAQ,MAAM;KACnC;EACH;AAEA,QAAM,YAAY,qBAAqB,UAAU;AACjD,QAAM,SAAS,cAAc,UAAa,UAAU,QAAQ;AAC5D,SAAO;IACL;IACA,aAAa,SAAS,QAAQ;IAC9B,WAAW;MACT,MAAM,YAAY,UAAU,IAAI;MAChC,KAAK,YAAY,UAAU,GAAG;MAC9B,WAAW,YAAY,UAAU,SAAS;MAC1C,QAAQ,YAAY,UAAU,MAAM;;IAEtC,SAAS;IACT,GAAI,cAAc,SAAY,EAAE,YAAY,UAAS,IAAK,CAAA;IAC1D;;AAEJ;",
-  "names": ["VALID_EVAL_MODES", "global"]
-}