@unbrained/pm-cli 2026.7.6 → 2026.7.8

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../../cli/commands/activity.ts","../../../../../../../../cli/commands/aggregate.ts","../../../../../../../../cli/commands/calendar.ts","../../../../../../../../cli/commands/context.ts","../../../../../../../../cli/commands/search.ts","../../../../../../../../core/shared/text-normalization.ts","../../../../../../../../core/search/relevance.ts","../../../../../../../../core/search/bm25.ts","../../../../../../../../cli/commands/eval.ts","../../../../../../../../core/search/eval.ts","../../../../../../../../cli/commands/get.ts","../../../../../../../../cli/commands/next.ts"],"sourcesContent":["/**\n * @module cli/commands/activity\n *\n * Implements the pm activity command surface and its agent-facing runtime behavior.\n */\nimport fs from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { getActiveExtensionRegistrations, runActiveOnReadHooks } from \"../../core/extensions/index.js\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { enforceHistoryStreamPolicyForItems } from \"../../core/history/history-stream-policy.js\";\nimport { resolveItemTypeRegistry } from \"../../core/item/type-registry.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 { compareTimestampStrings, nowIso, resolveIsoOrRelative } from \"../../core/shared/time.js\";\nimport { listAllFrontMatterLight } from \"../../core/store/item-store.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport { readHistoryEntries } from \"./history.js\";\nimport { parseLimit } from \"../shared-parsers.js\";\nimport type { HistoryEntry } from \"../../types/index.js\";\n\n/**\n * Documents the activity command options payload exchanged by command, SDK, and package integrations.\n */\nexport interface ActivityCommandOptions {\n  id?: string;\n  op?: string;\n  author?: string;\n  from?: string;\n  to?: string;\n  limit?: string;\n  compact?: boolean;\n}\n\n/**\n * Documents the activity entry payload exchanged by command, SDK, and package integrations.\n */\nexport interface ActivityEntry extends HistoryEntry {\n  id: string;\n}\n\n/**\n * Documents the compact activity entry payload exchanged by command, SDK, and package integrations.\n */\nexport interface CompactActivityEntry {\n  id: string;\n  op: string;\n  ts: string;\n  author: string;\n  msg?: string;\n}\n\n/**\n * Documents the activity result payload exchanged by command, SDK, and package integrations.\n */\nexport interface ActivityResult {\n  activity: ActivityEntry[];\n  compact_activity?: CompactActivityEntry[];\n  compact: boolean;\n  count: number;\n  limit: number | null;\n}\n\ninterface ActivityFilters {\n  id: string | undefined;\n  op: string | undefined;\n  author: string | undefined;\n  from: string | undefined;\n  to: string | undefined;\n  limit: number | undefined;\n}\n\ninterface ActivityRuntimeContext {\n  pmRoot: string;\n  settings: Awaited<ReturnType<typeof readSettings>>;\n}\n\nfunction parseNonEmptyFilter(raw: string | undefined, flagLabel: string): string | undefined {\n  if (raw === undefined) return undefined;\n  const normalized = raw.trim();\n  if (normalized.length === 0) {\n    throw new PmCliError(`${flagLabel} must not be empty`, EXIT_CODE.USAGE);\n  }\n  return normalized;\n}\n\nfunction parseRangeBound(raw: string | undefined, nowValue: string, fieldLabel: string): string | undefined {\n  if (raw === undefined) return undefined;\n  const normalized = raw.trim();\n  if (normalized.length === 0) {\n    throw new PmCliError(\"Activity time bounds must not be empty\", EXIT_CODE.USAGE);\n  }\n  return resolveIsoOrRelative(normalized, new Date(nowValue), fieldLabel);\n}\n\nfunction includeByTimeWindow(entry: ActivityEntry, from: string | undefined, to: string | undefined): boolean {\n  if (entry.ts.length === 0 && (from || to)) {\n    return false;\n  }\n  if (from && compareTimestampStrings(entry.ts, from) < 0) {\n    return false;\n  }\n  if (to && compareTimestampStrings(entry.ts, to) >= 0) {\n    return false;\n  }\n  return true;\n}\n\nfunction limitEntries<T>(values: T[], limit: number | undefined): T[] {\n  if (limit === undefined) return values;\n  return values.slice(0, limit);\n}\n\nfunction readActivityString(value: unknown, fallback = \"\"): string {\n  return typeof value === \"string\" ? value : fallback;\n}\n\nfunction normalizeActivityEntry(id: string, entry: HistoryEntry): ActivityEntry {\n  return {\n    ...entry,\n    id,\n    ts: readActivityString(entry.ts),\n    author: readActivityString(entry.author, \"unknown\"),\n    op: readActivityString(entry.op, \"unknown\"),\n    patch: Array.isArray(entry.patch) ? entry.patch : [],\n    before_hash: readActivityString(entry.before_hash),\n    after_hash: readActivityString(entry.after_hash),\n  };\n}\n\nfunction sortActivity(entries: ActivityEntry[]): ActivityEntry[] {\n  return [...entries].sort((a, b) => {\n    const byTimestamp = b.ts.localeCompare(a.ts);\n    if (byTimestamp !== 0) return byTimestamp;\n    const byId = a.id.localeCompare(b.id);\n    if (byId !== 0) return byId;\n    return a.op.localeCompare(b.op);\n  });\n}\n\nasync function listHistoryFiles(historyDir: string): Promise<string[]> {\n  try {\n    return (await fs.readdir(historyDir))\n      .filter((entry) => entry.endsWith(\".jsonl\"))\n      .sort((a, b) => a.localeCompare(b));\n  } catch (error: unknown) {\n    // Activity should degrade gracefully when optional history storage is absent.\n    if ((error as NodeJS.ErrnoException).code === \"ENOENT\") {\n      return [];\n    }\n    throw error;\n  }\n}\n\nfunction resolveActivityFilters(options: ActivityCommandOptions): ActivityFilters {\n  const nowValue = nowIso();\n  const from = parseRangeBound(options.from, nowValue, \"--from\");\n  const to = parseRangeBound(options.to, nowValue, \"--to\");\n  if (from && to && compareTimestampStrings(from, to) >= 0) {\n    throw new PmCliError(\"Activity --from must be before --to\", EXIT_CODE.USAGE);\n  }\n  return {\n    id: parseNonEmptyFilter(options.id, \"Activity --id\"),\n    op: parseNonEmptyFilter(options.op, \"Activity --op\"),\n    author: parseNonEmptyFilter(options.author, \"Activity --author\"),\n    from,\n    to,\n    limit: parseLimit(options.limit),\n  };\n}\n\nasync function resolveActivityRuntimeContext(global: GlobalOptions): Promise<ActivityRuntimeContext> {\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  return {\n    pmRoot,\n    settings: await readSettings(pmRoot),\n  };\n}\n\nasync function prepareActivityHistoryRead(context: ActivityRuntimeContext): Promise<string> {\n  const typeRegistry = resolveItemTypeRegistry(context.settings, getActiveExtensionRegistrations());\n  const items = await listAllFrontMatterLight(\n    context.pmRoot,\n    context.settings.item_format,\n    typeRegistry.type_to_folder,\n    undefined,\n    context.settings.schema,\n  );\n  await enforceHistoryStreamPolicyForItems({\n    pmRoot: context.pmRoot,\n    settings: context.settings,\n    itemIds: items.map((item) => item.id),\n    commandLabel: \"activity\",\n  });\n  const historyDir = path.join(context.pmRoot, \"history\");\n  await runActiveOnReadHooks({\n    path: historyDir,\n    scope: \"project\",\n  });\n  return historyDir;\n}\n\nfunction includeActivityEntry(entry: HistoryEntry, candidate: ActivityEntry, filters: ActivityFilters): boolean {\n  // Preserve legacy filter semantics: op/author filters compare the raw\n  // history row before missing metadata is normalized to \"unknown\" for display.\n  if (filters.op && entry.op !== filters.op) {\n    return false;\n  }\n  if (filters.author && entry.author !== filters.author) {\n    return false;\n  }\n  return includeByTimeWindow(candidate, filters.from, filters.to);\n}\n\nasync function collectActivityEntries(historyDir: string, filters: ActivityFilters): Promise<ActivityEntry[]> {\n  const combined: ActivityEntry[] = [];\n  for (const file of await listHistoryFiles(historyDir)) {\n    const id = file.slice(0, -\".jsonl\".length);\n    if (filters.id && id !== filters.id) {\n      continue;\n    }\n    const entries = await readHistoryEntries(path.join(historyDir, file), id);\n    for (const entry of entries) {\n      const candidate = normalizeActivityEntry(id, entry);\n      if (includeActivityEntry(entry, candidate, filters)) {\n        combined.push(candidate);\n      }\n    }\n  }\n  return combined;\n}\n\nfunction formatCompactActivity(activity: ActivityEntry[]): CompactActivityEntry[] {\n  return activity.map((entry): CompactActivityEntry => ({\n    id: entry.id,\n    op: entry.op,\n    ts: entry.ts,\n    author: entry.author,\n    ...(entry.message ? { msg: entry.message } : {}),\n  }));\n}\n\nexport const _testOnly = {\n  parseNonEmptyFilter,\n  parseRangeBound,\n  includeByTimeWindow,\n  limitEntries,\n  readActivityString,\n  normalizeActivityEntry,\n  sortActivity,\n  listHistoryFiles,\n};\n\n/**\n * Implements run activity for the public runtime surface of this module.\n */\nexport async function runActivity(options: ActivityCommandOptions, global: GlobalOptions): Promise<ActivityResult> {\n  const context = await resolveActivityRuntimeContext(global);\n  const filters = resolveActivityFilters(options);\n  const historyDir = await prepareActivityHistoryRead(context);\n  const activity = limitEntries(sortActivity(await collectActivityEntries(historyDir, filters)), filters.limit);\n  const compact = options.compact === true;\n  const compactActivity = compact ? formatCompactActivity(activity) : undefined;\n  return {\n    activity: compact ? [] : activity,\n    compact_activity: compactActivity,\n    compact,\n    count: activity.length,\n    limit: filters.limit ?? null,\n  };\n}\n","/**\n * @module cli/commands/aggregate\n *\n * Implements the pm aggregate command surface and its agent-facing runtime behavior.\n */\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 { splitCommaList } from \"../../core/shared/split-comma-list.js\";\nimport { nowIso } from \"../../core/shared/time.js\";\nimport { normalizeStatusInput } from \"../../core/item/status.js\";\nimport { parseStatusFilterCsv } from \"../../core/item/status-filter.js\";\nimport { resolveRuntimeStatusRegistry, type RuntimeStatusRegistry } from \"../../core/schema/runtime-schema.js\";\nimport { resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport { type ItemStatus } from \"../../types/index.js\";\nimport { buildListQueryFilters } from \"./list-filter-shared.js\";\nimport { runList } from \"./list.js\";\n\ntype AggregateGroupField = \"parent\" | \"type\" | \"priority\" | \"status\" | \"assignee\" | \"tags\" | \"sprint\" | \"release\";\ntype AggregateGroupValue = string | number | null;\ntype AggregateGroupRecord = Partial<Record<AggregateGroupField, AggregateGroupValue>>;\ntype AggregateListedItem = {\n  type: string;\n  status: ItemStatus;\n  priority: number;\n  parent?: string;\n  assignee?: string;\n  tags: string[];\n  sprint?: string;\n  release?: string;\n};\n\nconst AGGREGATE_GROUP_FIELDS: AggregateGroupField[] = [\n  \"parent\",\n  \"type\",\n  \"priority\",\n  \"status\",\n  \"assignee\",\n  \"tags\",\n  \"sprint\",\n  \"release\",\n];\n\n/**\n * Documents the aggregate options payload exchanged by command, SDK, and package integrations.\n */\nexport interface AggregateOptions {\n  groupBy?: string;\n  count?: boolean;\n  completion?: boolean;\n  sum?: string;\n  avg?: string;\n  includeUnparented?: boolean;\n  status?: string;\n  type?: string;\n  tag?: string;\n  priority?: string;\n  deadlineBefore?: string;\n  deadlineAfter?: string;\n  assignee?: string;\n  assigneeFilter?: string;\n  parent?: string;\n  sprint?: string;\n  release?: string;\n}\n\n/**\n * Documents the aggregate row payload exchanged by command, SDK, and package integrations.\n */\nexport interface AggregateRow {\n  group: AggregateGroupRecord;\n  /**\n   * Human-readable display label for this group. Blank/null group values render\n   * with an explicit \"(unassigned)\"-style label (per dimension) so terminal and\n   * grep-based consumers are never faced with an ambiguous empty key. The\n   * structured `group` record keeps the raw null for machine consumers.\n   */\n  group_label: string;\n  count: number;\n  open?: number;\n  in_progress?: number;\n  closed?: number;\n  other?: number;\n  completion_pct?: number;\n  null_count?: number;\n  sum?: number | null;\n  avg?: number | null;\n}\n\n/**\n * Documents the aggregate result payload exchanged by command, SDK, and package integrations.\n */\nexport interface AggregateResult {\n  groups: AggregateRow[];\n  count: number;\n  totals: {\n    items_considered: number;\n    items_grouped: number;\n    items_skipped_unparented: number;\n  };\n  filters: {\n    group_by: AggregateGroupField[];\n    count: boolean;\n    completion: boolean;\n    sum?: string | null;\n    avg?: string | null;\n    numeric_field?: string | null;\n    include_unparented: boolean;\n    status: ItemStatus | null;\n    type: string | null;\n    tag: string | null;\n    priority: string | null;\n    deadline_before: string | null;\n    deadline_after: string | null;\n    assignee: string | null;\n    assignee_filter: string | null;\n    parent: string | null;\n    sprint: string | null;\n    release: string | null;\n  };\n  now: string;\n  warnings?: string[];\n}\n\nfunction parseStatus(raw: string | undefined, statusRegistry: RuntimeStatusRegistry): ItemStatus | undefined {\n  const statuses = parseStatusFilterCsv(raw, statusRegistry, { strict: true, flagLabel: \"--status\" });\n  if (!statuses || statuses.length === 0) {\n    return undefined;\n  }\n  if (statuses.length > 1) {\n    throw new PmCliError(\n      'Aggregate --status accepts one status, or the standalone \"all\" sentinel.',\n      EXIT_CODE.USAGE,\n    );\n  }\n  return statuses[0];\n}\n\ninterface NumericAggregation {\n  field: string;\n  sum: boolean;\n  avg: boolean;\n}\n\nfunction parseNumericAggregation(options: AggregateOptions): NumericAggregation | null {\n  const sumField = options.sum?.trim();\n  const avgField = options.avg?.trim();\n  const normalizedSum = sumField && sumField.length > 0 ? sumField : undefined;\n  const normalizedAvg = avgField && avgField.length > 0 ? avgField : undefined;\n  if (!normalizedSum && !normalizedAvg) {\n    return null;\n  }\n  if (normalizedSum && normalizedAvg && normalizedSum !== normalizedAvg) {\n    throw new PmCliError(\"Aggregate --sum and --avg must target the same numeric field\", EXIT_CODE.USAGE);\n  }\n  return {\n    field: normalizedSum ?? normalizedAvg!,\n    sum: normalizedSum !== undefined,\n    avg: normalizedAvg !== undefined,\n  };\n}\n\nfunction parseGroupBy(raw: string | undefined): AggregateGroupField[] {\n  const value = raw?.trim() ?? \"status\";\n  if (value.length === 0) {\n    throw new PmCliError(\"--group-by requires at least one field name\", EXIT_CODE.USAGE);\n  }\n  const requested = splitCommaList(value);\n  if (requested.length === 0) {\n    throw new PmCliError(\"--group-by requires a comma-separated list of fields\", EXIT_CODE.USAGE);\n  }\n  for (const field of requested) {\n    if (!AGGREGATE_GROUP_FIELDS.includes(field as AggregateGroupField)) {\n      throw new PmCliError(\n        `Aggregate group fields must be one of ${AGGREGATE_GROUP_FIELDS.join(\"|\")}; received \"${field}\"`,\n        EXIT_CODE.USAGE,\n      );\n    }\n  }\n  return requested as AggregateGroupField[];\n}\n\nfunction normalizeTagGroupValue(tags: string[]): string | null {\n  const normalized = [...new Set(tags.map((tag) => tag.trim().toLowerCase()).filter((tag) => tag.length > 0))].sort((left, right) =>\n    left.localeCompare(right),\n  );\n  if (normalized.length === 0) {\n    return null;\n  }\n  return normalized.join(\",\");\n}\n\nfunction resolveGroupValue(field: AggregateGroupField, item: AggregateListedItem): AggregateGroupValue {\n  switch (field) {\n    case \"parent\":\n      return item.parent ?? null;\n    case \"type\":\n      return item.type;\n    case \"priority\":\n      return item.priority;\n    case \"status\":\n      return item.status;\n    case \"assignee\":\n      return item.assignee ?? null;\n    case \"tags\":\n      return normalizeTagGroupValue(item.tags);\n    case \"sprint\":\n      return item.sprint ?? null;\n    case \"release\":\n      return item.release ?? null;\n    default:\n      return null;\n  }\n}\n\nfunction compareNullableGroupValue(left: AggregateGroupValue | undefined, right: AggregateGroupValue | undefined): number {\n  const leftValue = left ?? null;\n  const rightValue = right ?? null;\n  if (leftValue === rightValue) {\n    return 0;\n  }\n  if (leftValue === null) {\n    return 1;\n  }\n  if (rightValue === null) {\n    return -1;\n  }\n  if (typeof leftValue === \"number\" && typeof rightValue === \"number\") {\n    return leftValue - rightValue;\n  }\n  return String(leftValue).localeCompare(String(rightValue));\n}\n\nfunction buildGroupKey(groupBy: AggregateGroupField[], group: AggregateGroupRecord): string {\n  return groupBy.map((field) => `${field}:${JSON.stringify(group[field] ?? null)}`).join(\"|\");\n}\n\n/** Explicit display label for an empty/blank group value, keyed by dimension. */\nconst EMPTY_AGGREGATE_GROUP_LABELS: Record<AggregateGroupField, string> = {\n  parent: \"(unparented)\",\n  type: \"(untyped)\",\n  priority: \"(no priority)\",\n  status: \"(no status)\",\n  assignee: \"(unassigned)\",\n  tags: \"(untagged)\",\n  sprint: \"(no sprint)\",\n  release: \"(no release)\",\n};\n\n/** Render a single group field's value, substituting an explicit label for null. */\nfunction formatGroupFieldLabel(field: AggregateGroupField, value: AggregateGroupValue | undefined): string {\n  if (value === null || value === undefined || value === \"\") {\n    return EMPTY_AGGREGATE_GROUP_LABELS[field];\n  }\n  return String(value);\n}\n\n/**\n * Build the human-readable label for an aggregate row. Single-field grouping\n * yields the bare (possibly substituted) value; multi-field grouping joins each\n * \"field=value\" pair so composite groups stay unambiguous.\n */\nfunction buildGroupLabel(groupBy: AggregateGroupField[], group: AggregateGroupRecord): string {\n  if (groupBy.length === 1) {\n    return formatGroupFieldLabel(groupBy[0], group[groupBy[0]]);\n  }\n  return groupBy.map((field) => `${field}=${formatGroupFieldLabel(field, group[field])}`).join(\" | \");\n}\n\nfunction compareAggregateRows(\n  left: AggregateRow,\n  right: AggregateRow,\n  groupBy: AggregateGroupField[],\n): number {\n  for (const field of groupBy) {\n    const byField = compareNullableGroupValue(left.group[field], right.group[field]);\n    if (byField !== 0) {\n      return byField;\n    }\n  }\n  return 0;\n}\n\nfunction readNumericAggregateValue(item: AggregateListedItem, field: string): number | null {\n  const source = item as unknown as Record<string, unknown>;\n  const raw = source[field];\n  if (typeof raw === \"number\" && Number.isFinite(raw)) {\n    return raw;\n  }\n  if (typeof raw === \"string\") {\n    const trimmed = raw.trim();\n    if (trimmed.length === 0) {\n      return null;\n    }\n    const parsed = Number(trimmed);\n    if (Number.isFinite(parsed)) {\n      return parsed;\n    }\n  }\n  return null;\n}\n\ninterface AggregateAccumulator {\n  /** group_label is derived once at finalization, so the accumulator omits it. */\n  row: Omit<AggregateRow, \"group_label\">;\n  numeric_count: number;\n  numeric_sum: number;\n  null_count: number;\n  open_count: number;\n  in_progress_count: number;\n  closed_count: number;\n  other_count: number;\n}\n\nfunction completionPct(closed: number, total: number): number {\n  if (total <= 0) {\n    return 0;\n  }\n  return Math.round((closed / total) * 10000) / 100;\n}\n\nfunction updateCompletionCounts(accumulator: AggregateAccumulator, status: ItemStatus, statusRegistry: RuntimeStatusRegistry): void {\n  const normalizedStatus = normalizeStatusInput(String(status), statusRegistry) ?? status;\n  if (normalizedStatus === statusRegistry.open_status) {\n    accumulator.open_count += 1;\n    return;\n  }\n  if (normalizedStatus === \"in_progress\" || (statusRegistry.active_statuses.has(normalizedStatus) && normalizedStatus !== statusRegistry.open_status)) {\n    accumulator.in_progress_count += 1;\n    return;\n  }\n  if (statusRegistry.terminal_done_statuses.has(normalizedStatus) || normalizedStatus === statusRegistry.close_status) {\n    accumulator.closed_count += 1;\n    return;\n  }\n  accumulator.other_count += 1;\n}\n\nfunction createAggregateAccumulator(\n  group: AggregateGroupRecord,\n  numericValue: number | null,\n): AggregateAccumulator {\n  return {\n    row: {\n      group,\n      count: 1,\n    },\n    numeric_count: numericValue === null ? 0 : 1,\n    numeric_sum: numericValue ?? 0,\n    null_count: numericValue === null ? 1 : 0,\n    open_count: 0,\n    in_progress_count: 0,\n    closed_count: 0,\n    other_count: 0,\n  };\n}\n\nfunction updateNumericAggregation(accumulator: AggregateAccumulator, numericValue: number | null): void {\n  if (numericValue === null) {\n    accumulator.null_count += 1;\n    return;\n  }\n  accumulator.numeric_count += 1;\n  accumulator.numeric_sum += numericValue;\n}\n\nfunction updateAggregateAccumulator(params: {\n  accumulator: AggregateAccumulator;\n  item: AggregateListedItem;\n  statusRegistry: RuntimeStatusRegistry;\n  includeCompletion: boolean;\n  numericAggregation: NumericAggregation | null;\n  numericValue: number | null;\n}): void {\n  params.accumulator.row.count += 1;\n  if (params.includeCompletion) {\n    updateCompletionCounts(params.accumulator, params.item.status, params.statusRegistry);\n  }\n  if (params.numericAggregation !== null) {\n    updateNumericAggregation(params.accumulator, params.numericValue);\n  }\n}\n\nfunction buildAggregateGroup(groupBy: AggregateGroupField[], item: AggregateListedItem): AggregateGroupRecord {\n  const group: AggregateGroupRecord = {};\n  for (const field of groupBy) {\n    group[field] = resolveGroupValue(field, item);\n  }\n  return group;\n}\n\nfunction finalizeAggregateRow(\n  entry: AggregateAccumulator,\n  groupBy: AggregateGroupField[],\n  includeCompletion: boolean,\n  numericAggregation: NumericAggregation | null,\n): AggregateRow {\n  const row: AggregateRow = {\n    ...entry.row,\n    group_label: buildGroupLabel(groupBy, entry.row.group),\n  };\n  if (includeCompletion) {\n    row.open = entry.open_count;\n    row.in_progress = entry.in_progress_count;\n    row.closed = entry.closed_count;\n    row.other = entry.other_count;\n    row.completion_pct = completionPct(entry.closed_count, entry.row.count);\n  }\n  if (numericAggregation !== null) {\n    row.null_count = entry.null_count;\n    if (numericAggregation.sum) {\n      row.sum = entry.numeric_sum;\n    }\n    if (numericAggregation.avg) {\n      row.avg = entry.numeric_count === 0 ? null : entry.numeric_sum / entry.numeric_count;\n    }\n  }\n  return row;\n}\n\nfunction buildAggregateFilters(params: {\n  groupBy: AggregateGroupField[];\n  includeCompletion: boolean;\n  includeUnparented: boolean;\n  status: ItemStatus | undefined;\n  options: AggregateOptions;\n  numericAggregation: NumericAggregation | null;\n}): AggregateResult[\"filters\"] {\n  return {\n    group_by: params.groupBy,\n    count: true,\n    completion: params.includeCompletion,\n    include_unparented: params.includeUnparented,\n    status: params.status ?? null,\n    type: params.options.type ?? null,\n    tag: params.options.tag ?? null,\n    priority: params.options.priority ?? null,\n    deadline_before: params.options.deadlineBefore ?? null,\n    deadline_after: params.options.deadlineAfter ?? null,\n    assignee: params.options.assignee ?? null,\n    assignee_filter: params.options.assigneeFilter ?? null,\n    parent: params.options.parent ?? null,\n    sprint: params.options.sprint ?? null,\n    release: params.options.release ?? null,\n    ...(params.numericAggregation !== null\n      ? {\n          sum: params.options.sum ?? null,\n          avg: params.options.avg ?? null,\n          numeric_field: params.numericAggregation.field,\n        }\n      : {}),\n  };\n}\n\n/**\n * Implements run aggregate for the public runtime surface of this module.\n */\nexport async function runAggregate(options: AggregateOptions, global: GlobalOptions): Promise<AggregateResult> {\n  if (options.count === false) {\n    throw new PmCliError(\"Aggregate grouped counts are always enabled; omit count=false.\", EXIT_CODE.USAGE);\n  }\n\n  const pmRoot = resolvePmRoot(process.cwd(), global.path);\n  const settings = await readSettings(pmRoot);\n  const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);\n  const groupBy = parseGroupBy(options.groupBy);\n  const status = parseStatus(options.status, statusRegistry);\n  const numericAggregation = parseNumericAggregation(options);\n  const includeCompletion = options.completion === true;\n  const includeUnparented = options.includeUnparented === true;\n\n  const listed = await runList(\n    status,\n    buildListQueryFilters(options),\n    global,\n  );\n\n  const grouped = new Map<string, AggregateAccumulator>();\n  let skippedUnparented = 0;\n  let groupedItemCount = 0;\n\n  for (const listedItem of listed.items) {\n    const item = listedItem as AggregateListedItem;\n    const group = buildAggregateGroup(groupBy, item);\n    if (groupBy.includes(\"parent\") && group.parent === null && !includeUnparented) {\n      skippedUnparented += 1;\n      continue;\n    }\n    const key = buildGroupKey(groupBy, group);\n    const existing = grouped.get(key);\n    const numericValue =\n      numericAggregation === null\n        ? null\n        : readNumericAggregateValue(item, numericAggregation.field);\n    if (existing) {\n      updateAggregateAccumulator({\n        accumulator: existing,\n        item,\n        statusRegistry,\n        includeCompletion,\n        numericAggregation,\n        numericValue,\n      });\n    } else {\n      const accumulator = createAggregateAccumulator(group, numericValue);\n      if (includeCompletion) {\n        updateCompletionCounts(accumulator, item.status, statusRegistry);\n      }\n      grouped.set(key, accumulator);\n    }\n    groupedItemCount += 1;\n  }\n\n  const groups = [...grouped.values()]\n    .map((entry) => finalizeAggregateRow(entry, groupBy, includeCompletion, numericAggregation))\n    .sort((left, right) => compareAggregateRows(left, right, groupBy));\n  const warnings = listed.warnings && listed.warnings.length > 0 ? listed.warnings : undefined;\n\n  return {\n    groups,\n    count: groups.length,\n    totals: {\n      items_considered: listed.items.length,\n      items_grouped: groupedItemCount,\n      items_skipped_unparented: skippedUnparented,\n    },\n    filters: buildAggregateFilters({ groupBy, includeCompletion, includeUnparented, status, options, numericAggregation }),\n    now: nowIso(),\n    ...(warnings ? { warnings } : {}),\n  };\n}\n\nexport const _testOnlyAggregateCommand = {\n  buildGroupKey,\n  compareAggregateRows,\n  compareNullableGroupValue,\n  completionPct,\n  normalizeTagGroupValue,\n  parseGroupBy,\n  parseNumericAggregation,\n  parseStatus,\n  readNumericAggregateValue,\n  resolveGroupValue,\n  updateCompletionCounts,\n};\n","/**\n * @module cli/commands/calendar\n *\n * Implements the pm calendar command surface and its agent-facing runtime behavior.\n */\nimport { encode as encodeToon } from \"@toon-format/toon\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport { resolveItemTypeRegistry, type ItemTypeRegistry } from \"../../core/item/type-registry.js\";\nimport { parseIntegerLimit, parsePriority, parseType } from \"../shared-parsers.js\";\nimport { normalizeStatusInput } from \"../../core/item/status.js\";\nimport { collectRuntimeFilterValues, matchesRuntimeFilters } from \"../../core/schema/runtime-field-filters.js\";\nimport {\n  resolveRuntimeFieldRegistry,\n  resolveRuntimeStatusRegistry,\n  type RuntimeStatusRegistry,\n} from \"../../core/schema/runtime-schema.js\";\nimport { EXIT_CODE } from \"../../core/shared/constants.js\";\nimport type { GlobalOptions } from \"../../core/shared/command-types.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { levenshteinDistanceWithinLimit } from \"../../core/shared/levenshtein.js\";\nimport { compareTimestampStrings, nowIso, resolveIsoOrRelative } from \"../../core/shared/time.js\";\nimport { listAllFrontMatterLight } from \"../../core/store/item-store.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport type { ItemFrontMatter, ItemStatus, ItemType, RecurrenceRule } from \"../../types/index.js\";\nimport { RECURRENCE_WEEKDAY_VALUES, weekdayOrderIndex } from \"../../types/index.js\";\n\nconst CALENDAR_VIEW_VALUES = [\"agenda\", \"day\", \"week\", \"month\"] as const;\n/**\n * Restricts calendar view values accepted by command, SDK, and storage contracts.\n */\nexport type CalendarView = (typeof CALENDAR_VIEW_VALUES)[number];\n\nconst CALENDAR_OUTPUT_VALUES = [\"markdown\", \"toon\", \"json\"] as const;\n/**\n * Restricts calendar output format values accepted by command, SDK, and storage contracts.\n */\nexport type CalendarOutputFormat = (typeof CALENDAR_OUTPUT_VALUES)[number];\n\n/**\n * Documents the calendar options payload exchanged by command, SDK, and package integrations.\n */\nexport interface CalendarOptions {\n  view?: string;\n  date?: string;\n  from?: string;\n  to?: string;\n  past?: boolean;\n  fullPeriod?: boolean;\n  limit?: string;\n  type?: string;\n  tag?: string;\n  priority?: string;\n  status?: string;\n  assignee?: string;\n  assigneeFilter?: string;\n  sprint?: string;\n  release?: string;\n  include?: string;\n  recurrenceLookaheadDays?: string;\n  recurrenceLookbackDays?: string;\n  occurrenceLimit?: string;\n  format?: string;\n  [key: string]: unknown;\n}\n\n/**\n * Documents the calendar row payload exchanged by command, SDK, and package integrations.\n */\nexport interface CalendarRow {\n  at: string;\n  date: string;\n  kind: \"deadline\" | \"reminder\" | \"event\";\n  reminder_text: string | null;\n  event_title: string | null;\n  event_end: string | null;\n  event_location: string | null;\n  event_all_day: boolean | null;\n  event_timezone: string | null;\n  event_recurring: boolean | null;\n  event_recurrence_rule: string | null;\n  item_id: string;\n  item_title: string;\n  item_type: ItemType;\n  item_status: ItemStatus;\n  item_priority: number;\n  item_assignee: string | null;\n  item_deadline: string | null;\n  item_tags: string[];\n}\n\n/**\n * Documents the calendar day bucket payload exchanged by command, SDK, and package integrations.\n */\nexport interface CalendarDayBucket {\n  date: string;\n  count: number;\n  events: CalendarRow[];\n}\n\n/**\n * Documents the calendar result payload exchanged by command, SDK, and package integrations.\n */\nexport interface CalendarResult {\n  view: CalendarView;\n  output_default: \"markdown\";\n  now: string;\n  anchor: string;\n  range: {\n    start: string | null;\n    end: string | null;\n    period_start: string | null;\n    period_end: string | null;\n    full_period: boolean;\n    past: boolean;\n    from: string | null;\n    to: string | null;\n  };\n  filters: {\n    type: string | null;\n    tag: string | null;\n    priority: string | null;\n    status: string | null;\n    assignee: string | null;\n    assignee_filter: string | null;\n    sprint: string | null;\n    release: string | null;\n    runtime_filters?: Record<string, unknown>;\n    limit: string | null;\n    include: string | null;\n    full_period: string | null;\n    recurrence_lookahead_days: string | null;\n    recurrence_lookback_days: string | null;\n    occurrence_limit: string | null;\n  };\n  summary: {\n    events: number;\n    items: number;\n    deadlines: number;\n    reminders: number;\n    scheduled: number;\n    by_kind: {\n      deadline: number;\n      reminder: number;\n      event: number;\n    };\n    by_type: Record<string, number>;\n    by_status: Record<string, number>;\n    recurring_events: number;\n  };\n  events: CalendarRow[];\n  days: CalendarDayBucket[];\n  warnings?: string[];\n}\n\nconst UTC_DAY_TO_WEEKDAY = [\"sun\", \"mon\", \"tue\", \"wed\", \"thu\", \"fri\", \"sat\"] as const;\nconst DEFAULT_RECURRENCE_LOOKAHEAD_DAYS = 365;\nconst DEFAULT_RECURRENCE_LOOKBACK_DAYS = 365;\nconst DEFAULT_EVENTS_ONLY_LOOKAHEAD_DAYS = 28;\nconst MAX_RECURRENCE_OCCURRENCES = 1000;\n\nfunction parseNonNegativeInteger(raw: string | undefined, label: string): number | undefined {\n  if (raw === undefined) return undefined;\n  const parsed = Number(raw);\n  if (!Number.isInteger(parsed) || parsed < 0) {\n    throw new PmCliError(`${label} must be a non-negative integer`, EXIT_CODE.USAGE);\n  }\n  return parsed;\n}\n\ntype CalendarIncludeKind = \"deadlines\" | \"reminders\" | \"events\";\n\nfunction parseIncludeSources(raw: string | undefined): Set<CalendarIncludeKind> {\n  if (!raw) {\n    return new Set([\"deadlines\", \"reminders\", \"events\"]);\n  }\n  const normalized = raw.trim().toLowerCase();\n  if (normalized === \"all\") {\n    return new Set([\"deadlines\", \"reminders\", \"events\"]);\n  }\n  const values = normalized\n    .split(/[|,]/)\n    .map((value) => value.trim())\n    .filter((value) => value.length > 0);\n  if (values.length === 0) {\n    throw new PmCliError(\"Calendar include filter must not be empty\", EXIT_CODE.USAGE);\n  }\n  const include = new Set<CalendarIncludeKind>();\n  for (const value of values) {\n    if (value === \"deadlines\" || value === \"deadline\") {\n      include.add(\"deadlines\");\n      continue;\n    }\n    if (value === \"reminders\" || value === \"reminder\") {\n      include.add(\"reminders\");\n      continue;\n    }\n    if (value === \"events\" || value === \"event\" || value === \"scheduled\") {\n      include.add(\"events\");\n      continue;\n    }\n    throw new PmCliError(\"Calendar include filter must be deadlines|reminders|events|scheduled|all\", EXIT_CODE.USAGE);\n  }\n  return include;\n}\n\n/**\n * Suggest the closest valid choice for a mistyped enum value (within edit\n * distance 2) so an agent gets an actionable \"did you mean\" hint instead of just\n * a list of choices (never-block UX).\n */\nfunction suggestClosestChoice(value: string, choices: readonly string[]): string | undefined {\n  let best: { choice: string; distance: number } | undefined;\n  for (const choice of choices) {\n    const distance = levenshteinDistanceWithinLimit(value, choice, 2);\n    if (distance !== null && (best === undefined || distance < best.distance)) {\n      best = { choice, distance };\n    }\n  }\n  return best?.choice;\n}\n\nfunction parseView(raw: string | undefined): CalendarView {\n  if (!raw) return \"agenda\";\n  const normalized = raw.trim().toLowerCase();\n  if (!CALENDAR_VIEW_VALUES.includes(normalized as CalendarView)) {\n    const suggestion = suggestClosestChoice(normalized, CALENDAR_VIEW_VALUES);\n    throw new PmCliError(\n      `Calendar view must be one of ${CALENDAR_VIEW_VALUES.join(\"|\")}${suggestion ? `. Did you mean \"${suggestion}\"?` : \".\"}`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return normalized as CalendarView;\n}\n\nfunction parseOutputFormat(raw: string | undefined): CalendarOutputFormat | undefined {\n  if (!raw) return undefined;\n  const normalized = raw.trim().toLowerCase();\n  if (!CALENDAR_OUTPUT_VALUES.includes(normalized as CalendarOutputFormat)) {\n    const suggestion = suggestClosestChoice(normalized, CALENDAR_OUTPUT_VALUES);\n    throw new PmCliError(\n      `Calendar format must be one of ${CALENDAR_OUTPUT_VALUES.join(\"|\")}${suggestion ? `. Did you mean \"${suggestion}\"?` : \".\"}`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return normalized as CalendarOutputFormat;\n}\n\n/**\n * Implements resolve calendar output format for the public runtime surface of this module.\n */\nexport function resolveCalendarOutputFormat(options: CalendarOptions, global: GlobalOptions): CalendarOutputFormat {\n  const commandFormat = parseOutputFormat(options.format);\n  if (global.json && commandFormat && commandFormat !== \"json\") {\n    throw new PmCliError(\"Cannot combine --json with --format markdown|toon\", EXIT_CODE.USAGE);\n  }\n  if (global.json) {\n    return \"json\";\n  }\n  return commandFormat ?? \"markdown\";\n}\n\nfunction parseStatus(raw: string | undefined, statusRegistry: RuntimeStatusRegistry): ItemStatus | undefined {\n  if (raw === undefined) return undefined;\n  const normalized = normalizeStatusInput(raw, statusRegistry);\n  if (!normalized) {\n    const allowedStatuses = statusRegistry.definitions.map((definition) => definition.id);\n    throw new PmCliError(`Calendar status filter must be one of ${allowedStatuses.join(\"|\")}`, EXIT_CODE.USAGE);\n  }\n  return normalized;\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(\"Calendar assignee filter must be one of assigned|unassigned\", EXIT_CODE.USAGE);\n  }\n  if (normalized !== \"assigned\" && normalized !== \"unassigned\") {\n    throw new PmCliError(`Invalid calendar assignee filter \"${raw}\". Allowed: assigned|unassigned`, EXIT_CODE.USAGE);\n  }\n  return normalized;\n}\n\nfunction toUtcDayKey(timestamp: string): string {\n  return new Date(timestamp).toISOString().slice(0, 10);\n}\n\n/**\n * Calendar day (YYYY-MM-DD) the instant falls on in the given IANA timezone.\n * Events carry an optional `timezone`; bucketing and clock rendering use it so a\n * 23:30Z instant tagged Asia/Tokyo correctly lands on the next local day rather\n * than the UTC day. Falls back to the UTC day when no/invalid timezone is given,\n * so existing UTC behavior is unchanged. Uses Intl (no timezone dependency).\n */\nfunction toLocalDayKey(timestamp: string, timezone?: string | null): string {\n  if (!timezone || timezone === \"UTC\") {\n    return toUtcDayKey(timestamp);\n  }\n  try {\n    const parts = new Intl.DateTimeFormat(\"en-CA\", {\n      timeZone: timezone,\n      year: \"numeric\",\n      month: \"2-digit\",\n      day: \"2-digit\",\n    }).formatToParts(new Date(timestamp));\n    const year = parts.find((part) => part.type === \"year\")?.value;\n    const month = parts.find((part) => part.type === \"month\")?.value;\n    const day = parts.find((part) => part.type === \"day\")?.value;\n    if (year && month && day) {\n      return `${year}-${month}-${day}`;\n    }\n  } catch {\n    // Invalid IANA zone — fall back to the UTC day key below.\n  }\n  return toUtcDayKey(timestamp);\n}\n\nfunction startOfUtcDay(timestamp: string): string {\n  const date = new Date(timestamp);\n  return new Date(Date.UTC(date.getUTCFullYear(), date.getUTCMonth(), date.getUTCDate(), 0, 0, 0, 0)).toISOString();\n}\n\nfunction addUtcDays(timestamp: string, days: number): string {\n  const date = new Date(timestamp);\n  return new Date(date.getTime() + days * 24 * 60 * 60 * 1000).toISOString();\n}\n\nfunction startOfUtcWeekMonday(timestamp: string): string {\n  const base = new Date(startOfUtcDay(timestamp));\n  const day = base.getUTCDay();\n  const delta = day === 0 ? -6 : 1 - day;\n  return addUtcDays(base.toISOString(), delta);\n}\n\nfunction startOfUtcMonth(timestamp: string): string {\n  const date = new Date(timestamp);\n  return new Date(Date.UTC(date.getUTCFullYear(), date.getUTCMonth(), 1, 0, 0, 0, 0)).toISOString();\n}\n\nfunction startOfNextUtcMonth(timestamp: string): string {\n  const date = new Date(timestamp);\n  return new Date(Date.UTC(date.getUTCFullYear(), date.getUTCMonth() + 1, 1, 0, 0, 0, 0)).toISOString();\n}\n\nfunction maxTimestamp(left: string, right: string): string {\n  return compareTimestampStrings(left, right) >= 0 ? left : right;\n}\n\nfunction toSortedCountRecord(values: Map<string, number>): Record<string, number> {\n  return Object.fromEntries([...values.entries()].sort(([left], [right]) => left.localeCompare(right)));\n}\n\nfunction incrementCount(values: Map<string, number>, key: string): void {\n  values.set(key, (values.get(key) ?? 0) + 1);\n}\n\nfunction formatRecurrenceRuleForSummary(rule: RecurrenceRule | undefined): string | null {\n  if (!rule) {\n    return null;\n  }\n  const parts: string[] = [`freq=${rule.freq}`];\n  if (rule.interval !== undefined) {\n    parts.push(`interval=${rule.interval}`);\n  }\n  if (rule.count !== undefined) {\n    parts.push(`count=${rule.count}`);\n  }\n  if (rule.until) {\n    parts.push(`until=${rule.until}`);\n  }\n  if (rule.by_weekday && rule.by_weekday.length > 0) {\n    const weekdays = [...rule.by_weekday].sort((left, right) => weekdayOrderIndex(left) - weekdayOrderIndex(right));\n    parts.push(`by_weekday=${weekdays.join(\"|\")}`);\n  }\n  if (rule.by_month_day && rule.by_month_day.length > 0) {\n    const monthDays = [...rule.by_month_day].sort((left, right) => left - right);\n    parts.push(`by_month_day=${monthDays.join(\"|\")}`);\n  }\n  if (rule.exdates && rule.exdates.length > 0) {\n    const exdates = [...rule.exdates].sort((left, right) => left.localeCompare(right));\n    parts.push(`exdates=${exdates.join(\"|\")}`);\n  }\n  return parts.join(\",\");\n}\n\nfunction buildUtcTimestamp(year: number, month: number, day: number, timeSource: Date): string | undefined {\n  const candidate = new Date(\n    Date.UTC(\n      year,\n      month,\n      day,\n      timeSource.getUTCHours(),\n      timeSource.getUTCMinutes(),\n      timeSource.getUTCSeconds(),\n      timeSource.getUTCMilliseconds(),\n    ),\n  );\n  if (candidate.getUTCFullYear() !== year || candidate.getUTCMonth() !== month || candidate.getUTCDate() !== day) {\n    return undefined;\n  }\n  return candidate.toISOString();\n}\n\nfunction weekdayToken(timestamp: string): (typeof UTC_DAY_TO_WEEKDAY)[number] {\n  return UTC_DAY_TO_WEEKDAY[new Date(timestamp).getUTCDay()];\n}\n\nfunction normalizeInstantKey(timestamp: string): string | null {\n  const parsed = Date.parse(timestamp);\n  return Number.isFinite(parsed) ? new Date(parsed).toISOString() : null;\n}\n\nfunction buildExcludedInstantSet(exdates: readonly string[] | undefined): Set<string> {\n  const excluded = new Set<string>();\n  for (const exdate of exdates ?? []) {\n    const instantKey = normalizeInstantKey(exdate);\n    if (instantKey) {\n      excluded.add(instantKey);\n    }\n  }\n  return excluded;\n}\n\nfunction buildRecurringEventWindow(\n  start: string | undefined,\n  end: string | undefined,\n  nowValue: string,\n  lookbackDays: number | undefined,\n  lookaheadDays: number | undefined,\n): { start: string; end: string } {\n  const windowStart = start ?? addUtcDays(nowValue, -(lookbackDays ?? DEFAULT_RECURRENCE_LOOKBACK_DAYS));\n  const windowEnd = end ?? addUtcDays(start ?? nowValue, lookaheadDays ?? DEFAULT_RECURRENCE_LOOKAHEAD_DAYS);\n  return {\n    start: windowStart,\n    end: compareTimestampStrings(windowEnd, windowStart) > 0 ? windowEnd : addUtcDays(windowStart, 1),\n  };\n}\n\ninterface RecurrenceExpansionContext {\n  startAt: string;\n  startDate: Date;\n  window: { start: string; end: string };\n  maxOccurrences: number;\n  interval: number;\n  countLimit: number;\n  until: string | undefined;\n  excluded: Set<string>;\n  weekdayFilter: Set<string> | undefined;\n  monthDayFilter: Set<number> | undefined;\n  sortedWeekdays: Array<(typeof RECURRENCE_WEEKDAY_VALUES)[number]>;\n  sortedMonthDays: number[];\n  occurrences: string[];\n  produced: number;\n}\n\nfunction buildRecurrenceExpansionContext(\n  startAt: string,\n  recurrence: RecurrenceRule,\n  window: { start: string; end: string },\n  occurrenceLimit: number | undefined,\n): RecurrenceExpansionContext {\n  // Omitted filters default to the series start; explicit empty filters intentionally match no occurrences.\n  const recurrenceWeekdays = recurrence.by_weekday !== undefined ? [...recurrence.by_weekday] : [weekdayToken(startAt)];\n  const recurrenceMonthDays =\n    recurrence.by_month_day !== undefined ? [...recurrence.by_month_day] : [new Date(startAt).getUTCDate()];\n  return {\n    startAt,\n    startDate: new Date(startAt),\n    window,\n    maxOccurrences: occurrenceLimit ?? MAX_RECURRENCE_OCCURRENCES,\n    interval: recurrence.interval ?? 1,\n    countLimit: recurrence.count ?? Number.POSITIVE_INFINITY,\n    until: recurrence.until,\n    excluded: buildExcludedInstantSet(recurrence.exdates),\n    weekdayFilter: recurrence.by_weekday !== undefined ? new Set(recurrence.by_weekday) : undefined,\n    monthDayFilter: recurrence.by_month_day !== undefined ? new Set(recurrence.by_month_day) : undefined,\n    sortedWeekdays: [...new Set(recurrenceWeekdays)].sort(\n      (left, right) => weekdayOrderIndex(left) - weekdayOrderIndex(right),\n    ),\n    sortedMonthDays: [...new Set(recurrenceMonthDays)].sort((left, right) => left - right),\n    occurrences: [],\n    produced: 0,\n  };\n}\n\nfunction consumeRecurrenceCandidate(context: RecurrenceExpansionContext, candidateAt: string): \"continue\" | \"stop\" {\n  if (compareTimestampStrings(candidateAt, context.startAt) < 0) {\n    return \"continue\";\n  }\n  if (context.until && compareTimestampStrings(candidateAt, context.until) > 0) {\n    return \"stop\";\n  }\n  if (compareTimestampStrings(candidateAt, context.window.end) >= 0) {\n    return \"stop\";\n  }\n  if (context.excluded.has(candidateAt)) {\n    return \"continue\";\n  }\n  context.produced += 1;\n  if (compareTimestampStrings(candidateAt, context.window.start) >= 0) {\n    context.occurrences.push(candidateAt);\n  }\n  return context.produced >= context.countLimit || context.occurrences.length >= context.maxOccurrences ? \"stop\" : \"continue\";\n}\n\nfunction recurrenceDayMatchesFilters(context: RecurrenceExpansionContext, candidateAt: string): boolean {\n  const candidateWeekday = weekdayToken(candidateAt);\n  const candidateMonthDay = new Date(candidateAt).getUTCDate();\n  const weekdayMatches = !context.weekdayFilter || context.weekdayFilter.has(candidateWeekday);\n  const monthDayMatches = !context.monthDayFilter || context.monthDayFilter.has(candidateMonthDay);\n  return weekdayMatches && monthDayMatches;\n}\n\nfunction expandDailyOccurrences(context: RecurrenceExpansionContext): string[] {\n  let candidateAt = context.startAt;\n  for (let iteration = 0; iteration < context.maxOccurrences; iteration += 1) {\n    if (recurrenceDayMatchesFilters(context, candidateAt) && consumeRecurrenceCandidate(context, candidateAt) === \"stop\") {\n      break;\n    }\n    candidateAt = addUtcDays(candidateAt, context.interval);\n  }\n  return context.occurrences;\n}\n\nfunction buildWeeklyCandidateAt(context: RecurrenceExpansionContext, candidateWeekStart: string, weekday: string): string {\n  const dayOffset = weekdayOrderIndex(weekday as (typeof RECURRENCE_WEEKDAY_VALUES)[number]);\n  const candidateDay = addUtcDays(candidateWeekStart, dayOffset);\n  const dayDate = new Date(candidateDay);\n  return new Date(\n    Date.UTC(\n      dayDate.getUTCFullYear(),\n      dayDate.getUTCMonth(),\n      dayDate.getUTCDate(),\n      context.startDate.getUTCHours(),\n      context.startDate.getUTCMinutes(),\n      context.startDate.getUTCSeconds(),\n      context.startDate.getUTCMilliseconds(),\n    ),\n  ).toISOString();\n}\n\nfunction expandWeeklyOccurrences(context: RecurrenceExpansionContext): string[] {\n  const weekStart = startOfUtcWeekMonday(context.startAt);\n  for (let step = 0; step < context.maxOccurrences; step += 1) {\n    const candidateWeekStart = addUtcDays(weekStart, step * context.interval * 7);\n    for (const weekday of context.sortedWeekdays) {\n      const candidateAt = buildWeeklyCandidateAt(context, candidateWeekStart, weekday);\n      if (!recurrenceDayMatchesFilters(context, candidateAt)) {\n        continue;\n      }\n      if (consumeRecurrenceCandidate(context, candidateAt) === \"stop\") {\n        return context.occurrences;\n      }\n    }\n  }\n  return context.occurrences;\n}\n\nfunction expandMonthlyOccurrences(context: RecurrenceExpansionContext): string[] {\n  const startYear = context.startDate.getUTCFullYear();\n  const startMonth = context.startDate.getUTCMonth();\n  for (let step = 0; step < context.maxOccurrences; step += 1) {\n    const monthAnchor = new Date(Date.UTC(startYear, startMonth + step * context.interval, 1, 0, 0, 0, 0));\n    for (const monthDay of context.sortedMonthDays) {\n      const candidateAt = buildUtcTimestamp(monthAnchor.getUTCFullYear(), monthAnchor.getUTCMonth(), monthDay, context.startDate);\n      if (!candidateAt || !recurrenceDayMatchesFilters(context, candidateAt)) {\n        continue;\n      }\n      if (consumeRecurrenceCandidate(context, candidateAt) === \"stop\") {\n        return context.occurrences;\n      }\n    }\n  }\n  return context.occurrences;\n}\n\nfunction expandYearlyOccurrences(context: RecurrenceExpansionContext): string[] {\n  const year = context.startDate.getUTCFullYear();\n  const month = context.startDate.getUTCMonth();\n  for (let step = 0; step < context.maxOccurrences; step += 1) {\n    const candidateYear = year + step * context.interval;\n    for (const monthDay of context.sortedMonthDays) {\n      const candidateAt = buildUtcTimestamp(candidateYear, month, monthDay, context.startDate);\n      if (!candidateAt || !recurrenceDayMatchesFilters(context, candidateAt)) {\n        continue;\n      }\n      if (consumeRecurrenceCandidate(context, candidateAt) === \"stop\") {\n        return context.occurrences;\n      }\n    }\n  }\n  return context.occurrences;\n}\n\nfunction expandRecurringOccurrences(\n  startAt: string,\n  recurrence: RecurrenceRule,\n  window: { start: string; end: string },\n  occurrenceLimit: number | undefined,\n): string[] {\n  const context = buildRecurrenceExpansionContext(startAt, recurrence, window, occurrenceLimit);\n  if (recurrence.freq === \"daily\") {\n    return expandDailyOccurrences(context);\n  }\n\n  if (recurrence.freq === \"weekly\") {\n    return expandWeeklyOccurrences(context);\n  }\n\n  if (recurrence.freq === \"monthly\") {\n    return expandMonthlyOccurrences(context);\n  }\n\n  return expandYearlyOccurrences(context);\n}\n\nfunction sortEvents(values: CalendarRow[]): CalendarRow[] {\n  return [...values].sort((a, b) => {\n    const byAt = compareTimestampStrings(a.at, b.at);\n    if (byAt !== 0) return byAt;\n    const byPriority = a.item_priority - b.item_priority;\n    if (byPriority !== 0) return byPriority;\n    const byId = a.item_id.localeCompare(b.item_id);\n    if (byId !== 0) return byId;\n    const byKind = a.kind.localeCompare(b.kind);\n    if (byKind !== 0) return byKind;\n    const byEventTitle = String(a.event_title).localeCompare(String(b.event_title));\n    if (byEventTitle !== 0) return byEventTitle;\n    return String(a.reminder_text).localeCompare(String(b.reminder_text));\n  });\n}\n\nfunction buildItemCalendarRowBase(item: ItemFrontMatter): Pick<\n  CalendarRow,\n  \"item_id\" | \"item_title\" | \"item_type\" | \"item_status\" | \"item_priority\" | \"item_assignee\" | \"item_deadline\" | \"item_tags\"\n> {\n  return {\n    item_id: item.id,\n    item_title: item.title,\n    item_type: item.type,\n    item_status: item.status,\n    item_priority: item.priority,\n    item_assignee: item.assignee ?? null,\n    item_deadline: item.deadline ?? null,\n    item_tags: item.tags,\n  };\n}\n\nfunction buildDeadlineRow(item: ItemFrontMatter): CalendarRow | null {\n  if (!item.deadline) {\n    return null;\n  }\n  return {\n    at: item.deadline,\n    date: toUtcDayKey(item.deadline),\n    kind: \"deadline\",\n    reminder_text: null,\n    event_title: null,\n    event_end: null,\n    event_location: null,\n    event_all_day: null,\n    event_timezone: null,\n    event_recurring: null,\n    event_recurrence_rule: null,\n    ...buildItemCalendarRowBase(item),\n    item_deadline: item.deadline,\n  };\n}\n\nfunction buildReminderRows(item: ItemFrontMatter): CalendarRow[] {\n  return (item.reminders ?? []).map((reminder) => ({\n    at: reminder.at,\n    date: toUtcDayKey(reminder.at),\n    kind: \"reminder\",\n    reminder_text: reminder.text,\n    event_title: null,\n    event_end: null,\n    event_location: null,\n    event_all_day: null,\n    event_timezone: null,\n    event_recurring: null,\n    event_recurrence_rule: null,\n    ...buildItemCalendarRowBase(item),\n  }));\n}\n\nfunction recurringDurationMs(startAt: string, endAt: string | undefined): number | null {\n  if (!endAt) {\n    return null;\n  }\n  const duration = Date.parse(endAt) - Date.parse(startAt);\n  return Number.isFinite(duration) && duration > 0 ? duration : null;\n}\n\nfunction eventOccurrenceEnd(\n  occurrenceAt: string,\n  event: NonNullable<ItemFrontMatter[\"events\"]>[number],\n  durationMs: number | null,\n): string | null {\n  return event.recurrence && durationMs !== null\n    ? new Date(new Date(occurrenceAt).getTime() + durationMs).toISOString()\n    : (event.end_at ?? null);\n}\n\nfunction buildScheduledEventRows(\n  item: ItemFrontMatter,\n  event: NonNullable<ItemFrontMatter[\"events\"]>[number],\n  recurringWindow: { start: string; end: string },\n  occurrenceLimit: number | undefined,\n): CalendarRow[] {\n  const recurrenceRuleSummary = formatRecurrenceRuleForSummary(event.recurrence);\n  const durationMs = recurringDurationMs(event.start_at, event.end_at);\n  const occurrences = event.recurrence\n    ? expandRecurringOccurrences(event.start_at, event.recurrence, recurringWindow, occurrenceLimit)\n    : [event.start_at];\n  return occurrences.map((occurrenceAt) => ({\n    at: occurrenceAt,\n    // All-day events are timezone-agnostic calendar dates: bucket by the\n    // literal start date. Timed events bucket by their local day in the\n    // event's timezone (defaults to UTC when unset).\n    date: event.all_day === true ? occurrenceAt.slice(0, 10) : toLocalDayKey(occurrenceAt, event.timezone),\n    kind: \"event\",\n    reminder_text: event.description ?? null,\n    event_title: event.title ?? item.title,\n    event_end: eventOccurrenceEnd(occurrenceAt, event, durationMs),\n    event_location: event.location ?? null,\n    event_all_day: event.all_day ?? null,\n    event_timezone: event.timezone ?? null,\n    event_recurring: event.recurrence ? true : false,\n    event_recurrence_rule: recurrenceRuleSummary,\n    ...buildItemCalendarRowBase(item),\n  }));\n}\n\nfunction buildEventSeed(\n  items: ItemFrontMatter[],\n  recurringWindow: { start: string; end: string },\n  includeSources: Set<CalendarIncludeKind>,\n  occurrenceLimit: number | undefined,\n): CalendarRow[] {\n  const events: CalendarRow[] = [];\n  for (const item of items) {\n    const deadlineRow = includeSources.has(\"deadlines\") ? buildDeadlineRow(item) : null;\n    if (deadlineRow) {\n      events.push(deadlineRow);\n    }\n    if (includeSources.has(\"reminders\")) {\n      events.push(...buildReminderRows(item));\n    }\n    for (const event of includeSources.has(\"events\") ? (item.events ?? []) : []) {\n      events.push(...buildScheduledEventRows(item, event, recurringWindow, occurrenceLimit));\n    }\n  }\n  return sortEvents(events);\n}\n\nfunction filterItems(\n  items: ItemFrontMatter[],\n  options: CalendarOptions,\n  typeRegistry: ItemTypeRegistry,\n  statusRegistry: RuntimeStatusRegistry,\n  runtimeFieldFilters: Record<string, unknown>,\n): ItemFrontMatter[] {\n  const typeFilter = parseType(options.type, typeRegistry);\n  const tagFilter = options.tag?.trim().toLowerCase();\n  const priorityFilter = parsePriority(options.priority);\n  const statusFilter = parseStatus(options.status, statusRegistry);\n  const assigneeFilter = options.assignee?.trim();\n  const assigneeModeFilter = parseAssigneeFilter(options.assigneeFilter);\n  const sprintFilter = options.sprint?.trim();\n  const releaseFilter = options.release?.trim();\n\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  return items.filter((item) =>\n    itemMatchesCalendarFilters(item, {\n      typeFilter,\n      tagFilter,\n      priorityFilter,\n      statusFilter,\n      assigneeFilter,\n      assigneeModeFilter,\n      sprintFilter,\n      releaseFilter,\n      runtimeFieldFilters,\n    }),\n  );\n}\n\nfunction itemMatchesCalendarFilters(\n  item: ItemFrontMatter,\n  filters: {\n    typeFilter: ItemType | undefined;\n    tagFilter: string | undefined;\n    priorityFilter: number | undefined;\n    statusFilter: ItemStatus | undefined;\n    assigneeFilter: string | undefined;\n    assigneeModeFilter: \"assigned\" | \"unassigned\" | undefined;\n    sprintFilter: string | undefined;\n    releaseFilter: string | undefined;\n    runtimeFieldFilters: Record<string, unknown>;\n  },\n): boolean {\n  return (\n    itemMatchesCalendarIdentityFilters(item, filters) &&\n    itemMatchesCalendarOwnerFilters(item, filters) &&\n    matchesRuntimeFilters(item as Record<string, unknown>, filters.runtimeFieldFilters)\n  );\n}\n\nfunction itemMatchesCalendarIdentityFilters(\n  item: ItemFrontMatter,\n  filters: Parameters<typeof itemMatchesCalendarFilters>[1],\n): boolean {\n  if (filters.typeFilter && item.type !== filters.typeFilter) return false;\n  if (filters.tagFilter && !item.tags.some((tag) => tag.trim().toLowerCase() === filters.tagFilter)) return false;\n  if (filters.priorityFilter !== undefined && item.priority !== filters.priorityFilter) return false;\n  if (filters.statusFilter && item.status !== filters.statusFilter) return false;\n  return true;\n}\n\nfunction itemMatchesCalendarOwnerFilters(\n  item: ItemFrontMatter,\n  filters: Parameters<typeof itemMatchesCalendarFilters>[1],\n): boolean {\n  if (filters.assigneeModeFilter === \"assigned\" && !item.assignee) return false;\n  if (filters.assigneeModeFilter === \"unassigned\" && item.assignee) return false;\n  if (filters.assigneeFilter !== undefined && item.assignee !== filters.assigneeFilter) return false;\n  if (filters.sprintFilter !== undefined && item.sprint !== filters.sprintFilter) return false;\n  if (filters.releaseFilter !== undefined && item.release !== filters.releaseFilter) return false;\n  return true;\n}\n\nfunction includeEventInWindow(event: CalendarRow, start: string | undefined, end: string | undefined): boolean {\n  if (start && compareTimestampStrings(event.at, start) < 0) {\n    return false;\n  }\n  if (end && compareTimestampStrings(event.at, end) >= 0) {\n    return false;\n  }\n  return true;\n}\n\nfunction resolveCalendarBoundaryInput(raw: string, nowValue: string, fieldLabel: \"--date\" | \"--from\" | \"--to\"): string {\n  if (raw.trim().toLowerCase() === \"today\") {\n    return startOfUtcDay(nowValue);\n  }\n  return resolveIsoOrRelative(raw, new Date(nowValue), fieldLabel);\n}\n\nfunction buildRange(\n  view: CalendarView,\n  options: CalendarOptions,\n  nowValue: string,\n): {\n  anchor: string;\n  start?: string;\n  end?: string;\n  periodStart?: string;\n  periodEnd?: string;\n  fullPeriod: boolean;\n} {\n  const anchor = options.date ? resolveCalendarBoundaryInput(options.date, nowValue, \"--date\") : nowValue;\n  const includePast = options.past === true;\n  const fullPeriodRequested = options.fullPeriod === true;\n\n  const from = options.from ? resolveCalendarBoundaryInput(options.from, nowValue, \"--from\") : undefined;\n  const to = options.to ? resolveCalendarBoundaryInput(options.to, nowValue, \"--to\") : undefined;\n  if (from && to && compareTimestampStrings(from, to) >= 0) {\n    throw new PmCliError(\"Calendar --from must be before --to\", EXIT_CODE.USAGE);\n  }\n\n  if (view !== \"agenda\" && (options.from !== undefined || options.to !== undefined)) {\n    throw new PmCliError(\"--from and --to are only supported for --view agenda\", EXIT_CODE.USAGE);\n  }\n\n  if (view === \"agenda\") {\n    return buildAgendaRange(anchor, options, nowValue, includePast, fullPeriodRequested, from, to);\n  }\n\n  if (view === \"day\") {\n    const dayStart = startOfUtcDay(anchor);\n    return buildFixedPeriodRange(anchor, nowValue, includePast, fullPeriodRequested, dayStart, addUtcDays(dayStart, 1));\n  }\n\n  if (view === \"week\") {\n    const weekStart = startOfUtcWeekMonday(anchor);\n    return buildFixedPeriodRange(anchor, nowValue, includePast, fullPeriodRequested, weekStart, addUtcDays(weekStart, 7));\n  }\n\n  const monthStart = startOfUtcMonth(anchor);\n  return buildFixedPeriodRange(anchor, nowValue, includePast, fullPeriodRequested, monthStart, startOfNextUtcMonth(anchor));\n}\n\nfunction buildAgendaRange(\n  anchor: string,\n  options: CalendarOptions,\n  nowValue: string,\n  includePast: boolean,\n  fullPeriodRequested: boolean,\n  from: string | undefined,\n  to: string | undefined,\n): ReturnType<typeof buildRange> {\n  if (fullPeriodRequested) {\n    throw new PmCliError(\n      \"--full-period is only supported for --view day|week|month. For agenda windows, use --from and --to.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  return {\n    anchor,\n    start: from ?? (options.date ? anchor : includePast ? undefined : nowValue),\n    end: to,\n    fullPeriod: false,\n  };\n}\n\nfunction buildFixedPeriodRange(\n  anchor: string,\n  nowValue: string,\n  includePast: boolean,\n  fullPeriodRequested: boolean,\n  periodStart: string,\n  periodEnd: string,\n): ReturnType<typeof buildRange> {\n  const fullPeriod = includePast || fullPeriodRequested;\n  return {\n    anchor,\n    start: fullPeriod ? periodStart : maxTimestamp(periodStart, nowValue),\n    end: periodEnd,\n    periodStart,\n    periodEnd,\n    fullPeriod,\n  };\n}\n\nfunction bucketEventsByDay(events: CalendarRow[]): CalendarDayBucket[] {\n  const dayMap = new Map<string, CalendarRow[]>();\n  for (const event of events) {\n    const list = dayMap.get(event.date) ?? [];\n    list.push(event);\n    dayMap.set(event.date, list);\n  }\n  return [...dayMap.entries()]\n    .sort(([left], [right]) => left.localeCompare(right))\n    .map(([date, dayEvents]) => ({\n      date,\n      count: dayEvents.length,\n      events: sortEvents(dayEvents),\n    }));\n}\n\nfunction summarize(events: CalendarRow[]): CalendarResult[\"summary\"] {\n  const itemIds = new Set<string>();\n  const byType = new Map<string, number>();\n  const byStatus = new Map<string, number>();\n  let deadlines = 0;\n  let reminders = 0;\n  let scheduled = 0;\n  let recurringEvents = 0;\n  for (const event of events) {\n    itemIds.add(event.item_id);\n    incrementCount(byType, event.item_type);\n    incrementCount(byStatus, event.item_status);\n    if (event.kind === \"deadline\") {\n      deadlines += 1;\n    } else if (event.kind === \"reminder\") {\n      reminders += 1;\n    } else {\n      scheduled += 1;\n      if (event.event_recurring === true) {\n        recurringEvents += 1;\n      }\n    }\n  }\n  return {\n    events: events.length,\n    items: itemIds.size,\n    deadlines,\n    reminders,\n    scheduled,\n    by_kind: {\n      deadline: deadlines,\n      reminder: reminders,\n      event: scheduled,\n    },\n    by_type: toSortedCountRecord(byType),\n    by_status: toSortedCountRecord(byStatus),\n    recurring_events: recurringEvents,\n  };\n}\n\nfunction formatWindow(range: CalendarResult[\"range\"]): string {\n  const start = range.start ?? \"unbounded\";\n  const end = range.end ?? \"unbounded\";\n  return `${start} -> ${end}`;\n}\n\nfunction formatClock(timestamp: string, timezone?: string | null): string {\n  if (timezone && timezone !== \"UTC\") {\n    try {\n      const parts = new Intl.DateTimeFormat(\"en-GB\", {\n        timeZone: timezone,\n        hour: \"2-digit\",\n        minute: \"2-digit\",\n        hourCycle: \"h23\",\n      }).formatToParts(new Date(timestamp));\n      const hour = parts.find((part) => part.type === \"hour\")?.value;\n      const minute = parts.find((part) => part.type === \"minute\")?.value;\n      if (hour && minute) {\n        // Local wall-clock time; the event line already prints `timezone=<zone>`.\n        return `${hour}:${minute}`;\n      }\n    } catch {\n      // Invalid IANA zone — fall back to the UTC clock below.\n    }\n  }\n  return `${new Date(timestamp).toISOString().slice(11, 16)}Z`;\n}\n\nfunction formatSummaryCountRecord(values: Record<string, number>): string {\n  const entries = Object.entries(values);\n  if (entries.length === 0) {\n    return \"empty\";\n  }\n  return entries.map(([key, value]) => `${key}=${value}`).join(\", \");\n}\n\nfunction formatEventEnd(event: CalendarRow): string | null {\n  if (!event.event_end) {\n    return null;\n  }\n  if (event.event_all_day === true) {\n    return event.event_end.slice(0, 10);\n  }\n  if (event.date === toLocalDayKey(event.event_end, event.event_timezone)) {\n    return formatClock(event.event_end, event.event_timezone);\n  }\n  return event.event_end;\n}\n\nfunction formatEventLine(event: CalendarRow): string {\n  const core = `${formatClock(event.at, event.event_timezone)} [${event.kind}] ${event.item_id} type=${event.item_type} p${event.item_priority} ${event.item_status} ${event.item_title}`;\n  if (event.kind === \"reminder\") {\n    const reminderText = event.reminder_text ?? \"\";\n    return `${core} — ${reminderText} reminder=${JSON.stringify(reminderText)}`;\n  }\n  if (event.kind === \"event\") {\n    const details: string[] = [];\n    const title = event.event_title ?? event.item_title;\n    const titleDiffers = event.event_title !== null && event.event_title !== event.item_title;\n    if (titleDiffers) {\n      details.push(title);\n      details.push(`title=${JSON.stringify(title)}`);\n    }\n    if (event.event_recurring) {\n      details.push(\"(recurring)\");\n      details.push(\"recurring=true\");\n    }\n    const end = formatEventEnd(event);\n    if (end) {\n      details.push(`end=${end}`);\n    }\n    if (event.event_all_day !== null) {\n      details.push(`all_day=${event.event_all_day ? \"true\" : \"false\"}`);\n    }\n    if (event.event_timezone) {\n      details.push(`timezone=${event.event_timezone}`);\n    }\n    if (event.event_location) {\n      details.push(`@ ${event.event_location}`);\n      details.push(`location=${JSON.stringify(event.event_location)}`);\n    }\n    if (event.event_recurrence_rule) {\n      details.push(`recurrence=${event.event_recurrence_rule}`);\n    }\n    if (event.reminder_text) {\n      details.push(`description=${JSON.stringify(event.reminder_text)}`);\n    }\n    return `${core} — ${details.join(\" \")}`;\n  }\n  return core;\n}\n\n/**\n * Implements render calendar markdown for the public runtime surface of this module.\n */\nexport function renderCalendarMarkdown(result: CalendarResult): string {\n  const lines: string[] = [];\n  lines.push(`# pm calendar (${result.view})`);\n  lines.push(\"\");\n  lines.push(`- now: ${result.now}`);\n  lines.push(`- window: ${formatWindow(result.range)}`);\n  if (result.range.period_start && result.range.period_end) {\n    lines.push(`- period: ${result.range.period_start} -> ${result.range.period_end}`);\n    lines.push(`- period-mode: ${result.range.full_period ? \"full-period\" : \"active-window\"}`);\n  }\n  lines.push(\n    `- events: ${result.summary.events} (deadlines: ${result.summary.deadlines}, reminders: ${result.summary.reminders}, scheduled: ${result.summary.scheduled})`,\n  );\n  lines.push(`- items: ${result.summary.items}`);\n  lines.push(`- by-kind: ${formatSummaryCountRecord(result.summary.by_kind)}`);\n  lines.push(`- by-type: ${formatSummaryCountRecord(result.summary.by_type)}`);\n  lines.push(`- by-status: ${formatSummaryCountRecord(result.summary.by_status)}`);\n  lines.push(`- recurring-events: ${result.summary.recurring_events}`);\n  lines.push(\"\");\n\n  if (result.events.length === 0) {\n    lines.push(\"No calendar events matched the selected filters.\");\n    return lines.join(\"\\n\");\n  }\n\n  for (const day of result.days) {\n    lines.push(`## ${day.date} (${day.count})`);\n    for (const event of day.events) {\n      lines.push(`- ${formatEventLine(event)}`);\n    }\n    lines.push(\"\");\n  }\n  if (result.warnings && result.warnings.length > 0) {\n    lines.push(\"### warnings\");\n    for (const warning of result.warnings) {\n      lines.push(`- ${warning}`);\n    }\n    lines.push(\"\");\n  }\n  return trimTrailingNewlines(lines.join(\"\\n\"));\n}\n\n/**\n * Serializes a CalendarResult as TOON (the project's structured output format).\n *\n * The calendar result is JSON-serializable end-to-end (only strings, numbers,\n * booleans, null, plain objects, and arrays), so the value is fed directly to\n * `@toon-format/toon`'s encoder.\n */\nexport function renderCalendarToon(result: CalendarResult): string {\n  return encodeToon(result as unknown as Parameters<typeof encodeToon>[0]);\n}\n\nfunction trimTrailingNewlines(value: string): string {\n  let end = value.length;\n  while (end > 0 && value[end - 1] === \"\\n\") {\n    end -= 1;\n  }\n  return value.slice(0, end);\n}\n\ninterface CalendarExecutionInputs {\n  nowValue: string;\n  view: CalendarView;\n  rangeBounds: ReturnType<typeof buildRange>;\n  limit: number | undefined;\n  includeSources: Set<CalendarIncludeKind>;\n  occurrenceLimit: number | undefined;\n  recurrenceLookaheadDays: number | undefined;\n  recurrenceLookbackWindowDays: number | undefined;\n  eventsOnlyCapApplied: boolean;\n}\n\nfunction resolveCalendarExecutionInputs(options: CalendarOptions): CalendarExecutionInputs {\n  const nowValue = nowIso();\n  const view = parseView(options.view);\n  const rangeBounds = buildRange(view, options, nowValue);\n  const limit = parseIntegerLimit(options.limit);\n  const includeSources = parseIncludeSources(options.include);\n  const explicitLookahead = parseNonNegativeInteger(options.recurrenceLookaheadDays, \"Calendar recurrence lookahead days\");\n  const recurrenceLookbackDays = parseNonNegativeInteger(options.recurrenceLookbackDays, \"Calendar recurrence lookback days\");\n  const occurrenceLimit = parseNonNegativeInteger(options.occurrenceLimit, \"Calendar occurrence limit\");\n  if (occurrenceLimit !== undefined && occurrenceLimit < 1) {\n    throw new PmCliError(\"Calendar occurrence limit must be >= 1\", EXIT_CODE.USAGE);\n  }\n  const eventsOnly = includeSources.has(\"events\") && !includeSources.has(\"deadlines\") && !includeSources.has(\"reminders\");\n  const hasExplicitBounds =\n    options.to !== undefined ||\n    explicitLookahead !== undefined ||\n    recurrenceLookbackDays !== undefined ||\n    occurrenceLimit !== undefined;\n  const eventsOnlyCapApplied = eventsOnly && !hasExplicitBounds;\n  return {\n    nowValue,\n    view,\n    rangeBounds,\n    limit,\n    includeSources,\n    occurrenceLimit,\n    recurrenceLookaheadDays: eventsOnlyCapApplied ? DEFAULT_EVENTS_ONLY_LOOKAHEAD_DAYS : explicitLookahead,\n    recurrenceLookbackWindowDays: eventsOnlyCapApplied && recurrenceLookbackDays === undefined ? 0 : recurrenceLookbackDays,\n    eventsOnlyCapApplied,\n  };\n}\n\nfunction appendCalendarCapWarning(warnings: string[], capApplied: boolean): void {\n  if (!capApplied) {\n    return;\n  }\n  warnings.push(\n    `recurring_events_default_cap_applied:lookback=0d,lookahead=${DEFAULT_EVENTS_ONLY_LOOKAHEAD_DAYS}d -- use --recurrence-lookback-days/--recurrence-lookahead-days or --to for wider range`,\n  );\n}\n\nfunction buildCalendarFiltersResult(\n  options: CalendarOptions,\n  runtimeFieldFilters: Record<string, unknown>,\n): CalendarResult[\"filters\"] {\n  return {\n    type: options.type ?? null,\n    tag: options.tag ?? null,\n    priority: options.priority ?? null,\n    status: options.status ?? null,\n    assignee: options.assignee ?? null,\n    assignee_filter: options.assigneeFilter ?? null,\n    sprint: options.sprint ?? null,\n    release: options.release ?? null,\n    runtime_filters: runtimeFieldFilters,\n    limit: options.limit ?? null,\n    include: options.include ?? null,\n    full_period: options.fullPeriod === true ? \"true\" : null,\n    recurrence_lookahead_days: options.recurrenceLookaheadDays ?? null,\n    recurrence_lookback_days: options.recurrenceLookbackDays ?? null,\n    occurrence_limit: options.occurrenceLimit ?? null,\n  };\n}\n\nfunction buildCalendarRangeResult(\n  options: CalendarOptions,\n  rangeBounds: ReturnType<typeof buildRange>,\n): CalendarResult[\"range\"] {\n  return {\n    start: rangeBounds.start ?? null,\n    end: rangeBounds.end ?? null,\n    period_start: rangeBounds.periodStart ?? null,\n    period_end: rangeBounds.periodEnd ?? null,\n    full_period: rangeBounds.fullPeriod,\n    past: options.past === true,\n    from: options.from ?? null,\n    to: options.to ?? null,\n  };\n}\n\n/**\n * Implements run calendar for the public runtime surface of this module.\n */\nexport async function runCalendar(options: CalendarOptions, global: GlobalOptions): Promise<CalendarResult> {\n  const pmRoot = resolvePmRoot(process.cwd(), global.path);\n  if (!(await pathExists(getSettingsPath(pmRoot)))) {\n    throw new PmCliError(`Tracker is not initialized at ${pmRoot}. Run pm init first.`, EXIT_CODE.NOT_FOUND);\n  }\n\n  const inputs = resolveCalendarExecutionInputs(options);\n\n  const settings = await readSettings(pmRoot);\n  const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);\n  const runtimeFieldRegistry = resolveRuntimeFieldRegistry(settings.schema);\n  const runtimeFieldFilters = collectRuntimeFilterValues(options as Record<string, unknown>, runtimeFieldRegistry, \"calendar\");\n  const typeRegistry = resolveItemTypeRegistry(settings, getActiveExtensionRegistrations());\n  const listWarnings: string[] = [];\n  appendCalendarCapWarning(listWarnings, inputs.eventsOnlyCapApplied);\n  const items = await listAllFrontMatterLight(pmRoot, settings.item_format, typeRegistry.type_to_folder, listWarnings, settings.schema);\n  const filteredItems = filterItems(items, options, typeRegistry, statusRegistry, runtimeFieldFilters);\n  const recurringWindow = buildRecurringEventWindow(\n    inputs.rangeBounds.start,\n    inputs.rangeBounds.end,\n    inputs.nowValue,\n    inputs.recurrenceLookbackWindowDays,\n    inputs.recurrenceLookaheadDays,\n  );\n  const seededEvents = buildEventSeed(filteredItems, recurringWindow, inputs.includeSources, inputs.occurrenceLimit);\n  const rangedEvents = seededEvents.filter((event) => includeEventInWindow(event, inputs.rangeBounds.start, inputs.rangeBounds.end));\n  const limitedEvents = inputs.limit === undefined ? rangedEvents : rangedEvents.slice(0, inputs.limit);\n  const days = bucketEventsByDay(limitedEvents);\n  const warnings = [...new Set(listWarnings)].sort((left, right) => left.localeCompare(right));\n\n  return {\n    view: inputs.view,\n    output_default: \"markdown\",\n    now: inputs.nowValue,\n    anchor: inputs.rangeBounds.anchor,\n    range: buildCalendarRangeResult(options, inputs.rangeBounds),\n    filters: buildCalendarFiltersResult(options, runtimeFieldFilters),\n    summary: summarize(limitedEvents),\n    events: limitedEvents,\n    days,\n    ...(warnings.length > 0 ? { warnings } : {}),\n  };\n}\n","/**\n * @module cli/commands/context\n *\n * Implements the pm context command surface and its agent-facing runtime behavior.\n */\nimport { SETTINGS_DEFAULTS, EXIT_CODE } from \"../../core/shared/constants.js\";\nimport type { GlobalOptions } from \"../../core/shared/command-types.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { compareTimestampStrings, nowIso } from \"../../core/shared/time.js\";\nimport { isTerminalStatus, normalizeStatusForRegistry, normalizeStatusInput } from \"../../core/item/status.js\";\nimport { resolveRuntimeStatusRegistry, type RuntimeStatusRegistry } from \"../../core/schema/runtime-schema.js\";\nimport { resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport type {\n  ContextDepth,\n  ContextSectionName,\n  ContextSettings,\n  ItemFrontMatter,\n  ItemStatus,\n  PmSettings,\n} from \"../../types/index.js\";\nimport { CONTEXT_DEPTH_VALUES, CONTEXT_SECTION_VALUES } from \"../../types/index.js\";\nimport { parseIntegerLimit } from \"../shared-parsers.js\";\nimport { runCalendar, type CalendarOptions, type CalendarRow } from \"./calendar.js\";\nimport { runList, type ListOptions } from \"./list.js\";\nimport { runActivity, type CompactActivityEntry } from \"./activity.js\";\n\n// ---------------------------------------------------------------------------\n// Output format\n// ---------------------------------------------------------------------------\n\nexport const CONTEXT_OUTPUT_VALUES = [\"markdown\", \"toon\", \"json\"] as const;\n/**\n * Restricts context output format values accepted by command, SDK, and storage contracts.\n */\nexport type ContextOutputFormat = (typeof CONTEXT_OUTPUT_VALUES)[number];\n\n// ---------------------------------------------------------------------------\n// Options\n// ---------------------------------------------------------------------------\n\n/**\n * Documents the context options payload exchanged by command, SDK, and package integrations.\n */\nexport interface ContextOptions {\n  date?: string;\n  from?: string;\n  to?: string;\n  past?: boolean;\n  type?: string;\n  tag?: string;\n  priority?: string;\n  assignee?: string;\n  assigneeFilter?: string;\n  sprint?: string;\n  release?: string;\n  limit?: string;\n  maxItems?: string;\n  format?: string;\n  depth?: string;\n  fields?: string;\n  section?: string[];\n  activityLimit?: string;\n  staleThreshold?: string;\n  parent?: string;\n  [key: string]: unknown;\n}\n\n// ---------------------------------------------------------------------------\n// Focus item (unchanged from original)\n// ---------------------------------------------------------------------------\n\n/**\n * Documents the context focus item payload exchanged by command, SDK, and package integrations.\n */\nexport interface ContextFocusItem {\n  id: string;\n  title: string;\n  type: string;\n  status: ItemStatus;\n  priority: number;\n  order: number | null;\n  deadline: string | null;\n  assignee: string | null;\n  tags: string[];\n  updated_at: string;\n  parent: string | null;\n  children_total?: number;\n  children_closed?: number;\n  completion_pct?: number;\n}\n\n// ---------------------------------------------------------------------------\n// Section data types\n// ---------------------------------------------------------------------------\n\n/**\n * Documents the hierarchy child payload exchanged by command, SDK, and package integrations.\n */\nexport interface HierarchyChild {\n  id: string;\n  title: string;\n  type: string;\n  status: ItemStatus;\n  children_total: number;\n  children_closed: number;\n}\n\n/**\n * Documents the hierarchy node payload exchanged by command, SDK, and package integrations.\n */\nexport interface HierarchyNode {\n  id: string;\n  title: string;\n  type: string;\n  status: ItemStatus;\n  children_total: number;\n  children_closed: number;\n  children_open: number;\n  children_in_progress: number;\n  children_blocked: number;\n  children: HierarchyChild[];\n}\n\n/**\n * Documents the progress entry payload exchanged by command, SDK, and package integrations.\n */\nexport interface ProgressEntry {\n  id: string;\n  title: string;\n  type: string;\n  total: number;\n  closed: number;\n  open: number;\n  in_progress: number;\n  blocked: number;\n  completion_pct: number;\n}\n\n/**\n * Documents the blocker entry payload exchanged by command, SDK, and package integrations.\n */\nexport interface BlockerEntry {\n  id: string;\n  title: string;\n  blocked_by: string | null;\n  blocked_by_title: string | null;\n  blocked_by_status: ItemStatus | null;\n  blocked_reason: string | null;\n  unblock_note: string | null;\n}\n\n/**\n * Documents the hot file payload exchanged by command, SDK, and package integrations.\n */\nexport interface HotFile {\n  path: string;\n  references: number;\n  items: string[];\n}\n\n/**\n * Documents the workload entry payload exchanged by command, SDK, and package integrations.\n */\nexport interface WorkloadEntry {\n  assignee: string | null;\n  active: number;\n  in_progress: number;\n  items: string[];\n}\n\n/**\n * Documents the stale entry payload exchanged by command, SDK, and package integrations.\n */\nexport interface StaleEntry {\n  id: string;\n  title: string;\n  status: ItemStatus;\n  updated_at: string;\n  stale_days: number;\n}\n\n/**\n * Documents the recent context item payload exchanged by command, SDK, and package integrations.\n */\nexport interface RecentContextItem extends ContextFocusItem {\n  created_at?: string;\n}\n\n/**\n * Documents the test health summary payload exchanged by command, SDK, and package integrations.\n */\nexport interface TestHealthSummary {\n  items_with_tests: number;\n  items_with_recent_runs: number;\n  recent_runs: {\n    passed: number;\n    failed: number;\n    skipped: number;\n  };\n  items_failing: string[];\n}\n\n// ---------------------------------------------------------------------------\n// Agenda / summary (unchanged)\n// ---------------------------------------------------------------------------\n\ninterface ContextAgendaSummary {\n  events: number;\n  items: number;\n  deadlines: number;\n  reminders: number;\n  scheduled: number;\n}\n\ninterface ContextSummary {\n  active_items: number;\n  in_progress: number;\n  open: number;\n  blocked: number;\n  blocked_fallback_used: boolean;\n  high_level: number;\n  low_level: number;\n  agenda_events: number;\n  total_items?: number;\n  closed?: number;\n  canceled?: number;\n}\n\n// ---------------------------------------------------------------------------\n// Result\n// ---------------------------------------------------------------------------\n\n/**\n * Documents the context result payload exchanged by command, SDK, and package integrations.\n */\nexport interface ContextResult {\n  output_default: \"toon\";\n  now: string;\n  depth: ContextDepth;\n  sections_included: ContextSectionName[];\n  window: {\n    anchor: string;\n    start: string | null;\n    end: string | null;\n    past: boolean;\n    from: string | null;\n    to: string | null;\n  };\n  filters: {\n    type: string | null;\n    tag: string | null;\n    priority: string | null;\n    assignee: string | null;\n    assignee_filter: string | null;\n    sprint: string | null;\n    release: string | null;\n    limit: string | null;\n    parent: string | null;\n    runtime_filters?: Record<string, unknown>;\n  };\n  summary: ContextSummary;\n  high_level: ContextFocusItem[];\n  low_level: ContextFocusItem[];\n  blocked_fallback: ContextFocusItem[];\n  agenda: {\n    summary: ContextAgendaSummary;\n    events: CalendarRow[];\n  };\n  hierarchy?: HierarchyNode[];\n  activity?: CompactActivityEntry[];\n  progress?: ProgressEntry[];\n  blockers?: BlockerEntry[];\n  recently_created?: RecentContextItem[];\n  unparented?: ContextFocusItem[];\n  files?: HotFile[];\n  workload?: WorkloadEntry[];\n  staleness?: StaleEntry[];\n  tests?: TestHealthSummary;\n  suggestions?: string[];\n  /** Focus-row field subset requested via --fields; null/omitted means full rows. */\n  focus_fields?: string[];\n  warnings?: string[];\n}\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\nconst HIGH_LEVEL_TYPES = new Set<string>([\"Epic\", \"Feature\"]);\nconst DEFAULT_CONTEXT_LIMIT = 10;\n\nconst STANDARD_SECTIONS: ContextSectionName[] = [\"hierarchy\", \"activity\", \"progress\", \"recently_created\", \"unparented\", \"workload\"];\nconst DEEP_SECTIONS: ContextSectionName[] = [\n  ...STANDARD_SECTIONS,\n  \"blockers\",\n  \"files\",\n  \"staleness\",\n  \"tests\",\n];\nconst LEADING_HYPHEN_DATE = /^(\\d{4})-(\\d{2})-(\\d{2})/;\nconst LEADING_COMPACT_DATE = /^(\\d{4})(\\d{2})(\\d{2})(?:[T ]?\\d{2}|$)/;\nconst COMPACT_DATE = /^(\\d{4})(\\d{2})(\\d{2})$/;\nconst COMPACT_DATETIME = /^(\\d{4})(\\d{2})(\\d{2})(?:[T\\s]?)(\\d{2})(\\d{2})(\\d{2})?(Z|[+-]\\d{2}:?\\d{2})?$/i;\n\n// ---------------------------------------------------------------------------\n// Parsers\n// ---------------------------------------------------------------------------\n\nfunction parseOutputFormat(raw: string | undefined): ContextOutputFormat | undefined {\n  if (!raw) return undefined;\n  const normalized = raw.trim().toLowerCase();\n  if (!CONTEXT_OUTPUT_VALUES.includes(normalized as ContextOutputFormat)) {\n    throw new PmCliError(\"Context format must be one of markdown|toon|json\", EXIT_CODE.USAGE);\n  }\n  return normalized as ContextOutputFormat;\n}\n\n// Fields selectable by `pm context --fields` for focus-row projection. Every\n// ContextFocusItem scalar plus `created_at` (carried by recently-created rows)\n// is addressable; unknown names are rejected with a usage hint.\nconst FOCUS_PROJECTION_FIELDS = new Set<string>([\n  \"id\",\n  \"title\",\n  \"type\",\n  \"status\",\n  \"priority\",\n  \"order\",\n  \"deadline\",\n  \"assignee\",\n  \"tags\",\n  \"updated_at\",\n  \"parent\",\n  \"children_total\",\n  \"children_closed\",\n  \"completion_pct\",\n  \"created_at\",\n]);\n\n/**\n * Parses the comma-separated `--fields` value into a validated, de-duplicated\n * focus-row projection list. Returns undefined when no projection was requested.\n */\nexport function parseContextFocusFields(raw: string | undefined): string[] | undefined {\n  if (raw === undefined) return undefined;\n  const fields: string[] = [];\n  for (const token of raw.split(\",\")) {\n    const normalized = token.trim().toLowerCase();\n    if (normalized.length === 0) continue;\n    if (!FOCUS_PROJECTION_FIELDS.has(normalized)) {\n      throw new PmCliError(\n        `Context --fields value not projectable: ${normalized} (valid: ${[...FOCUS_PROJECTION_FIELDS].join(\", \")})`,\n        EXIT_CODE.USAGE,\n      );\n    }\n    if (!fields.includes(normalized)) fields.push(normalized);\n  }\n  if (fields.length === 0) {\n    throw new PmCliError(\"Context --fields requires at least one field name\", EXIT_CODE.USAGE);\n  }\n  return fields;\n}\n\n/**\n * Projects focus rows onto the requested field subset, preserving field order so\n * the rendered/serialized output mirrors the `--fields` argument.\n */\nexport function projectContextFocusRows<T extends ContextFocusItem>(rows: T[], fields: string[]): ContextFocusItem[] {\n  return rows.map((row) => {\n    const projected: Record<string, unknown> = {};\n    const source = row as Record<string, unknown>;\n    for (const field of fields) {\n      projected[field] = source[field] ?? null;\n    }\n    return projected as unknown as ContextFocusItem;\n  });\n}\n\n/**\n * Implements resolve context output format for the public runtime surface of this module.\n */\nexport function resolveContextOutputFormat(options: ContextOptions, global: GlobalOptions): ContextOutputFormat {\n  const commandFormat = parseOutputFormat(options.format);\n  if (global.json && commandFormat && commandFormat !== \"json\") {\n    throw new PmCliError(\"Cannot combine --json with --format markdown|toon\", EXIT_CODE.USAGE);\n  }\n  if (global.json) {\n    return \"json\";\n  }\n  return commandFormat ?? \"toon\";\n}\n\n// --depth full surfaces the entire backlog: when no explicit --limit is given,\n// every section returns all rows instead of the default top-N sample.\nfunction parseContextLimit(raw: string | undefined, depth: ContextDepth): number {\n  return parseIntegerLimit(raw, \"--limit\") ?? (depth === \"full\" ? Number.MAX_SAFE_INTEGER : DEFAULT_CONTEXT_LIMIT);\n}\n\n/**\n * Implements parse context depth for the public runtime surface of this module.\n */\nexport function parseContextDepth(raw: string | undefined, settings: ContextSettings): ContextDepth {\n  if (!raw) return settings.default_depth;\n  const normalized = raw.trim().toLowerCase();\n  if (!CONTEXT_DEPTH_VALUES.includes(normalized as ContextDepth)) {\n    throw new PmCliError(`Context --depth must be one of ${CONTEXT_DEPTH_VALUES.join(\"|\")}`, EXIT_CODE.USAGE);\n  }\n  return normalized as ContextDepth;\n}\n\n/**\n * Implements parse context sections for the public runtime surface of this module.\n */\nexport function parseContextSections(\n  raw: string[] | undefined,\n  depth: ContextDepth,\n  settings: ContextSettings,\n): ContextSectionName[] {\n  if (raw && raw.length > 0) {\n    const sections: ContextSectionName[] = [];\n    for (const value of raw) {\n      const normalized = value.trim().toLowerCase();\n      if (!CONTEXT_SECTION_VALUES.includes(normalized as ContextSectionName)) {\n        throw new PmCliError(\n          `Context --section must be one of ${CONTEXT_SECTION_VALUES.join(\"|\")}`,\n          EXIT_CODE.USAGE,\n        );\n      }\n      if (!sections.includes(normalized as ContextSectionName)) {\n        sections.push(normalized as ContextSectionName);\n      }\n    }\n    return sections;\n  }\n  if (depth === \"brief\") return [];\n  // --depth full is the comprehensive snapshot: every known section, regardless\n  // of the per-section settings toggles that brief/standard/deep respect.\n  if (depth === \"full\") return [...CONTEXT_SECTION_VALUES];\n  const pool = depth === \"deep\" ? DEEP_SECTIONS : STANDARD_SECTIONS;\n  return pool.filter((section) => settings.sections[section]);\n}\n\nfunction parseActivityLimit(raw: string | undefined, settings: ContextSettings): number {\n  if (!raw) return settings.activity_limit;\n  const parsed = parseIntegerLimit(raw, \"--activity-limit\");\n  /* c8 ignore start -- parseIntegerLimit either throws or returns a number; fallback is defensive typing guard */\n  return parsed ?? settings.activity_limit;\n  /* c8 ignore stop */\n}\n\nfunction parseStaleThresholdDays(raw: string | undefined, settings: ContextSettings): number {\n  if (!raw) return settings.stale_threshold_days;\n  const trimmed = raw.trim().toLowerCase();\n  const match = /^(\\d+)d?$/.exec(trimmed);\n  if (!match) {\n    throw new PmCliError(\"--stale-threshold must be a number of days (e.g. 7 or 7d)\", EXIT_CODE.USAGE);\n  }\n  const days = parseInt(match[1], 10);\n  if (days <= 0) {\n    throw new PmCliError(\"--stale-threshold must be positive\", EXIT_CODE.USAGE);\n  }\n  return days;\n}\n\n// ---------------------------------------------------------------------------\n// Status helpers\n// ---------------------------------------------------------------------------\n\nfunction statusRank(status: ItemStatus, statusRegistry: RuntimeStatusRegistry): number {\n  const normalizedStatus = normalizeStatusForRegistry(status, statusRegistry);\n  const inProgressStatus = normalizeStatusInput(\"in_progress\", statusRegistry);\n  const openStatus = normalizeStatusInput(\"open\", statusRegistry);\n  const blockedStatus = normalizeStatusInput(\"blocked\", statusRegistry);\n  const draftStatus = normalizeStatusInput(\"draft\", statusRegistry);\n  if (inProgressStatus && normalizedStatus === inProgressStatus) return 0;\n  if (openStatus && normalizedStatus === openStatus) return 1;\n  if (blockedStatus && normalizedStatus === blockedStatus) return 2;\n  if (draftStatus && normalizedStatus === draftStatus) return 3;\n  if (statusRegistry.active_statuses.has(normalizedStatus)) return 4;\n  if (statusRegistry.blocked_statuses.has(normalizedStatus)) return 5;\n  if (statusRegistry.terminal_statuses.has(normalizedStatus)) return 7;\n  return 6;\n}\n\nfunction isClosedStatus(status: ItemStatus, statusRegistry: RuntimeStatusRegistry): boolean {\n  const closeStatus = normalizeStatusInput(\"closed\", statusRegistry);\n  return normalizeStatusForRegistry(status, statusRegistry) === closeStatus;\n}\n\nfunction isInProgressStatus(status: ItemStatus, statusRegistry: RuntimeStatusRegistry): boolean {\n  const inProgressStatus = normalizeStatusInput(\"in_progress\", statusRegistry);\n  return normalizeStatusForRegistry(status, statusRegistry) === inProgressStatus;\n}\n\nfunction isOpenStatus(status: ItemStatus, statusRegistry: RuntimeStatusRegistry): boolean {\n  const openStatus = normalizeStatusInput(\"open\", statusRegistry);\n  return normalizeStatusForRegistry(status, statusRegistry) === openStatus;\n}\n\nfunction isBlockedStatus(status: ItemStatus, statusRegistry: RuntimeStatusRegistry): boolean {\n  return statusRegistry.blocked_statuses.has(normalizeStatusForRegistry(status, statusRegistry));\n}\n\n// Projection flags belong to list/calendar/activity output shaping and must not\n// leak into runContext's downstream calls, which need full ItemFrontMatter rows.\n// --parent is a context-level subtree scope computed here transitively, so it\n// must not reach runList (whose --parent matches direct children only).\nconst LIST_PROJECTION_FLAGS = [\"compact\", \"brief\", \"fields\", \"includeBody\", \"include_body\", \"parent\"] as const;\n\nfunction stripListProjectionFlags(options: ContextOptions): Record<string, unknown> {\n  const copy: Record<string, unknown> = { ...(options as Record<string, unknown>) };\n  for (const key of LIST_PROJECTION_FLAGS) {\n    delete copy[key];\n  }\n  return copy;\n}\n\n/**\n * Resolves the transitive subtree (the anchor item plus every descendant via\n * parent links) so `--parent` can scope a snapshot to one epic/milestone. Reuses\n * the same {@link buildChildrenByParent}/{@link collectDescendants} helpers the\n * hierarchy section relies on, so subtree membership stays consistent across the\n * snapshot. Ids are normalized to lowercase for case-insensitive membership; the\n * `found` flag is false when the anchor id is absent from the corpus. Exported so\n * sibling read commands (e.g. `pm next`) can apply the same subtree scoping.\n */\nexport function collectSubtreeIds(corpus: ItemFrontMatter[], parentId: string): { ids: Set<string>; found: boolean } {\n  const target = parentId.trim().toLowerCase();\n  const anchor = corpus.find((item) => item.id.trim().toLowerCase() === target);\n  if (!anchor) {\n    return { ids: new Set<string>(), found: false };\n  }\n  const childrenByParent = buildChildrenByParent(corpus);\n  const descendants = collectDescendants(anchor.id, childrenByParent);\n  // Store normalized ids so membership checks are case-insensitive end-to-end.\n  const ids = new Set<string>([anchor.id, ...descendants.map((item) => item.id)].map((id) => id.trim().toLowerCase()));\n  return { ids, found: true };\n}\n\nfunction parseContextParent(raw: string | undefined): string | undefined {\n  if (raw === undefined) return undefined;\n  const trimmed = raw.trim();\n  if (trimmed.length === 0) {\n    throw new PmCliError(\"Context --parent requires an item id\", EXIT_CODE.USAGE);\n  }\n  return trimmed;\n}\n\n// ---------------------------------------------------------------------------\n// Sorting / mapping helpers (unchanged from original)\n// ---------------------------------------------------------------------------\n\nfunction compareOptionalOrder(left: number | null | undefined, right: number | null | undefined): number {\n  const leftValue = left ?? null;\n  const rightValue = right ?? null;\n  if (leftValue === null && rightValue === null) return 0;\n  if (leftValue === null) return 1;\n  if (rightValue === null) return -1;\n  return leftValue - rightValue;\n}\n\nfunction compareOptionalDeadline(left: string | null | undefined, right: string | null | undefined): number {\n  const leftValue = left ?? null;\n  const rightValue = right ?? null;\n  if (leftValue === null && rightValue === null) return 0;\n  if (leftValue === null) return 1;\n  if (rightValue === null) return -1;\n  return compareTimestampStrings(leftValue, rightValue);\n}\n\nfunction daysInUtcMonth(year: number, monthIndex: number): number {\n  return new Date(Date.UTC(year, monthIndex + 1, 0)).getUTCDate();\n}\n\nfunction hasNoInvalidDatePrefix(value: string): boolean {\n  const match = LEADING_HYPHEN_DATE.exec(value) ?? LEADING_COMPACT_DATE.exec(value);\n  if (!match) {\n    return true;\n  }\n  const year = Number.parseInt(match[1], 10);\n  const month = Number.parseInt(match[2], 10);\n  const day = Number.parseInt(match[3], 10);\n  return month >= 1 && month <= 12 && day >= 1 && day <= daysInUtcMonth(year, month - 1);\n}\n\nfunction normalizeTimestampCandidate(value: string): string {\n  const compactDate = COMPACT_DATE.exec(value);\n  if (compactDate) {\n    return `${compactDate[1]}-${compactDate[2]}-${compactDate[3]}`;\n  }\n  const compactDateTime = COMPACT_DATETIME.exec(value);\n  if (compactDateTime) {\n    const [, year, month, day, hour, minute, secondRaw, offsetRaw] = compactDateTime;\n    const second = secondRaw ? `:${secondRaw}` : \"\";\n    const offset = offsetRaw && offsetRaw.length === 5 && offsetRaw !== \"Z\" ? `${offsetRaw.slice(0, 3)}:${offsetRaw.slice(3)}` : offsetRaw ?? \"\";\n    return `${year}-${month}-${day}T${hour}:${minute}${second}${offset}`;\n  }\n  return value;\n}\n\nfunction parseContextTimestampMs(value: unknown): number {\n  if (typeof value !== \"string\") {\n    return Number.NaN;\n  }\n  const trimmed = value.trim();\n  if (trimmed.length === 0 || !hasNoInvalidDatePrefix(trimmed)) {\n    return Number.NaN;\n  }\n  const parsed = Date.parse(normalizeTimestampCandidate(trimmed));\n  return Number.isFinite(parsed) ? parsed : Number.NaN;\n}\n\nfunction sortableTimestamp(value: unknown): string {\n  const parsed = parseContextTimestampMs(value);\n  return Number.isFinite(parsed) ? new Date(parsed).toISOString() : \"\";\n}\n\nfunction dateTokenForTimestamp(value: unknown): string {\n  const parsed = parseContextTimestampMs(value);\n  return Number.isFinite(parsed) ? new Date(parsed).toISOString().slice(0, 10) : \"unknown\";\n}\n\nfunction normalizedParentId(value: unknown): string | null {\n  if (typeof value !== \"string\") {\n    return null;\n  }\n  const trimmed = value.trim();\n  return trimmed.length > 0 ? trimmed : null;\n}\n\n/**\n * Ranks two items by work criticality: in-progress before open before blocked\n * before draft (via {@link statusRank}), then ascending priority, explicit order,\n * earliest deadline, most-recently-updated, and finally id for a total order.\n * Exported as the canonical focus ordering so sibling read commands (e.g.\n * `pm next`) recommend work in the exact same sequence as `pm context`.\n */\nexport function compareCriticalItems(left: ItemFrontMatter, right: ItemFrontMatter, statusRegistry: RuntimeStatusRegistry): number {\n  const byStatus = statusRank(left.status, statusRegistry) - statusRank(right.status, statusRegistry);\n  if (byStatus !== 0) return byStatus;\n  const byPriority = left.priority - right.priority;\n  if (byPriority !== 0) return byPriority;\n  const byOrder = compareOptionalOrder(left.order, right.order);\n  if (byOrder !== 0) return byOrder;\n  const byDeadline = compareOptionalDeadline(left.deadline, right.deadline);\n  if (byDeadline !== 0) return byDeadline;\n  const byUpdated = compareTimestampStrings(sortableTimestamp(right.updated_at), sortableTimestamp(left.updated_at));\n  const byId = left.id.localeCompare(right.id);\n  return byUpdated !== 0 ? byUpdated : byId;\n}\n\nfunction completionPct(closed: number, total: number): number {\n  return total > 0 ? Math.round((closed / total) * 100) : 0;\n}\n\n/**\n * Indexes items by their parent id, yielding a parent→direct-children map used by\n * the hierarchy/progress rollups and by focus-row child completion. Items without\n * a parent are skipped. Exported so sibling read commands reuse the same index.\n */\nexport function buildChildrenByParent(allItems: ItemFrontMatter[]): Map<string, ItemFrontMatter[]> {\n  const childrenByParent = new Map<string, ItemFrontMatter[]>();\n  for (const item of allItems) {\n    const parent = normalizedParentId(item.parent);\n    if (!parent) continue;\n    const children = childrenByParent.get(parent) ?? [];\n    children.push(item);\n    childrenByParent.set(parent, children);\n  }\n  return childrenByParent;\n}\n\n/**\n * Projects an item onto the compact {@link ContextFocusItem} focus row. When both\n * a status registry and a parent→children index are supplied, it also folds in the\n * descendant rollup (`children_total`/`children_closed`/`completion_pct`). Exported\n * so sibling read commands (e.g. `pm next`) emit identically-shaped focus rows.\n */\nexport function toContextFocusItem(\n  item: ItemFrontMatter,\n  statusRegistry?: RuntimeStatusRegistry,\n  childrenByParent?: Map<string, ItemFrontMatter[]>,\n): ContextFocusItem {\n  const focus: ContextFocusItem = {\n    id: item.id,\n    title: item.title,\n    type: item.type,\n    status: item.status,\n    priority: item.priority,\n    order: item.order ?? null,\n    deadline: item.deadline ?? null,\n    assignee: item.assignee ?? null,\n    tags: Array.isArray(item.tags) ? [...item.tags] : [],\n    updated_at: item.updated_at,\n    parent: normalizedParentId(item.parent),\n  };\n  if (statusRegistry && childrenByParent) {\n    const descendants = collectDescendants(item.id, childrenByParent);\n    const total = descendants.length;\n    if (total > 0) {\n      const closed = descendants.filter((desc) => isClosedStatus(desc.status, statusRegistry)).length;\n      focus.children_total = total;\n      focus.children_closed = closed;\n      focus.completion_pct = completionPct(closed, total);\n    }\n  }\n  return focus;\n}\n\nfunction summarizeAgenda(events: CalendarRow[]): ContextAgendaSummary {\n  let deadlines = 0;\n  let reminders = 0;\n  let scheduled = 0;\n  const itemIds = new Set<string>();\n  for (const event of events) {\n    itemIds.add(event.item_id);\n    if (event.kind === \"deadline\") {\n      deadlines += 1;\n      continue;\n    }\n    if (event.kind === \"reminder\") {\n      reminders += 1;\n      continue;\n    }\n    scheduled += 1;\n  }\n  return {\n    events: events.length,\n    items: itemIds.size,\n    deadlines,\n    reminders,\n    scheduled,\n  };\n}\n\nfunction mergeSortedWarnings(...warningGroups: Array<string[] | undefined>): string[] {\n  return [...new Set(warningGroups.flatMap((group) => group ?? []))].sort((left, right) => left.localeCompare(right));\n}\n\nfunction filterTerminalCalendarEvents(events: CalendarRow[], statusRegistry: RuntimeStatusRegistry): CalendarRow[] {\n  return events.filter((event) => !statusRegistry.terminal_statuses.has(normalizeStatusForRegistry(event.item_status, statusRegistry)));\n}\n\n// ---------------------------------------------------------------------------\n// Section builders\n// ---------------------------------------------------------------------------\n\nfunction buildHierarchy(\n  allItems: ItemFrontMatter[],\n  activeItems: ItemFrontMatter[],\n  statusRegistry: RuntimeStatusRegistry,\n  limit: number,\n): HierarchyNode[] {\n  const itemMap = new Map<string, ItemFrontMatter>();\n  for (const item of allItems) {\n    itemMap.set(item.id, item);\n  }\n\n  const childrenByParent = buildChildrenByParent(allItems);\n\n  const activeHighLevelIds = new Set(\n    activeItems.filter((item) => HIGH_LEVEL_TYPES.has(item.type)).map((item) => item.id),\n  );\n\n  const nodes: HierarchyNode[] = [];\n  for (const parentId of activeHighLevelIds) {\n    const parent = itemMap.get(parentId);\n    if (!parent) continue;\n    const allDescendants = collectDescendants(parentId, childrenByParent);\n    const childItems = childrenByParent.get(parentId) ?? [];\n\n    let closedCount = 0;\n    let openCount = 0;\n    let inProgressCount = 0;\n    let blockedCount = 0;\n    /* c8 ignore start -- chained status-classification branch accounting is noisy under v8 for mixed descendant sets */\n    for (const desc of allDescendants) {\n      if (isClosedStatus(desc.status, statusRegistry)) closedCount++;\n      else if (isInProgressStatus(desc.status, statusRegistry)) inProgressCount++;\n      else if (isBlockedStatus(desc.status, statusRegistry)) blockedCount++;\n      else if (isOpenStatus(desc.status, statusRegistry)) openCount++;\n    }\n    /* c8 ignore stop */\n\n    const children: HierarchyChild[] = childItems\n      .sort((a, b) => compareCriticalItems(a, b, statusRegistry))\n      .slice(0, limit)\n      .map((child) => {\n        const grandchildren = collectDescendants(child.id, childrenByParent);\n        const gcClosed = grandchildren.filter((gc) => isClosedStatus(gc.status, statusRegistry)).length;\n        return {\n          id: child.id,\n          title: child.title,\n          type: child.type,\n          status: child.status,\n          children_total: grandchildren.length,\n          children_closed: gcClosed,\n        };\n      });\n\n    nodes.push({\n      id: parent.id,\n      title: parent.title,\n      type: parent.type,\n      status: parent.status,\n      children_total: allDescendants.length,\n      children_closed: closedCount,\n      children_open: openCount,\n      children_in_progress: inProgressCount,\n      children_blocked: blockedCount,\n      children,\n    });\n  }\n\n  return nodes\n    .sort((a, b) => {\n      const aParent = itemMap.get(a.id)!;\n      const bParent = itemMap.get(b.id)!;\n      return compareCriticalItems(aParent, bParent, statusRegistry);\n    })\n    .slice(0, limit);\n}\n\nfunction collectDescendants(\n  parentId: string,\n  childrenByParent: Map<string, ItemFrontMatter[]>,\n): ItemFrontMatter[] {\n  const result: ItemFrontMatter[] = [];\n  const stack = [parentId];\n  const visited = new Set<string>();\n  while (stack.length > 0) {\n    const current = stack.pop()!;\n    if (visited.has(current)) continue;\n    visited.add(current);\n    const children = childrenByParent.get(current) ?? [];\n    for (const child of children) {\n      result.push(child);\n      stack.push(child.id);\n    }\n  }\n  return result;\n}\n\nexport const _testOnly = {\n  buildActivity,\n  buildBlockers,\n  buildChildrenByParent,\n  buildHierarchy,\n  buildHotFiles,\n  buildProgress,\n  buildRecentlyCreated,\n  buildStaleness,\n  buildTestHealth,\n  buildUnparented,\n  buildWorkload,\n  collectDescendants,\n  collectSubtreeIds,\n  compareCriticalItems,\n  compareOptionalDeadline,\n  compareOptionalOrder,\n  completionPct,\n  dateTokenForTimestamp,\n  filterTerminalCalendarEvents,\n  isBlockedStatus,\n  isClosedStatus,\n  isInProgressStatus,\n  isOpenStatus,\n  mergeSortedWarnings,\n  normalizedParentId,\n  parseActivityLimit,\n  parseContextLimit,\n  parseContextParent,\n  parseContextTimestampMs,\n  parseStaleThresholdDays,\n  sortableTimestamp,\n  statusRank,\n  stripListProjectionFlags,\n  summarizeAgenda,\n  toContextFocusItem,\n};\n\nasync function buildActivity(\n  activityLimit: number,\n  global: GlobalOptions,\n): Promise<CompactActivityEntry[]> {\n  const result = await runActivity({ compact: true, limit: String(activityLimit) }, global);\n  return result.compact_activity ?? [];\n}\n\nfunction buildProgress(\n  allItems: ItemFrontMatter[],\n  activeItems: ItemFrontMatter[],\n  statusRegistry: RuntimeStatusRegistry,\n  limit: number,\n): ProgressEntry[] {\n  const childrenByParent = new Map<string, ItemFrontMatter[]>();\n  for (const item of allItems) {\n    if (!item.parent) continue;\n    const children = childrenByParent.get(item.parent) ?? [];\n    children.push(item);\n    childrenByParent.set(item.parent, children);\n  }\n\n  const activeHighLevel = activeItems.filter((item) => HIGH_LEVEL_TYPES.has(item.type));\n  const entries: ProgressEntry[] = [];\n  for (const parent of activeHighLevel) {\n    const descendants = collectDescendants(parent.id, childrenByParent);\n    const total = descendants.length;\n    if (total === 0) continue;\n\n    let closed = 0;\n    let open = 0;\n    let inProgress = 0;\n    let blocked = 0;\n    /* c8 ignore start -- chained status-classification branch accounting is noisy under v8 for mixed descendant sets */\n    for (const desc of descendants) {\n      if (isClosedStatus(desc.status, statusRegistry)) closed++;\n      else if (isInProgressStatus(desc.status, statusRegistry)) inProgress++;\n      else if (isBlockedStatus(desc.status, statusRegistry)) blocked++;\n      else if (isOpenStatus(desc.status, statusRegistry)) open++;\n    }\n    /* c8 ignore stop */\n\n    entries.push({\n      id: parent.id,\n      title: parent.title,\n      type: parent.type,\n      total,\n      closed,\n      open,\n      in_progress: inProgress,\n      blocked,\n      completion_pct: completionPct(closed, total),\n    });\n  }\n\n  return entries\n    .sort((a, b) => a.completion_pct - b.completion_pct)\n    .slice(0, limit);\n}\n\nfunction buildBlockers(\n  blockedItems: ItemFrontMatter[],\n  itemMap: Map<string, ItemFrontMatter>,\n  limit: number,\n): BlockerEntry[] {\n  return blockedItems.slice(0, limit).map((item) => {\n    const blockerItem = item.blocked_by ? itemMap.get(item.blocked_by) : undefined;\n    return {\n      id: item.id,\n      title: item.title,\n      blocked_by: item.blocked_by ?? null,\n      blocked_by_title: blockerItem?.title ?? null,\n      blocked_by_status: blockerItem?.status ?? null,\n      blocked_reason: item.blocked_reason ?? null,\n      unblock_note: item.unblock_note ?? null,\n    };\n  });\n}\n\nfunction buildHotFiles(\n  activeItems: ItemFrontMatter[],\n  limit: number,\n): HotFile[] {\n  const fileMap = new Map<string, Set<string>>();\n  for (const item of activeItems) {\n    for (const file of item.files ?? []) {\n      const existing = fileMap.get(file.path) ?? new Set<string>();\n      existing.add(item.id);\n      fileMap.set(file.path, existing);\n    }\n  }\n\n  return [...fileMap.entries()]\n    .map(([filePath, itemIds]) => ({\n      path: filePath,\n      references: itemIds.size,\n      items: [...itemIds].sort(),\n    }))\n    .sort((a, b) => b.references - a.references)\n    .slice(0, limit);\n}\n\nfunction buildWorkload(\n  activeItems: ItemFrontMatter[],\n  statusRegistry: RuntimeStatusRegistry,\n  limit: number,\n): WorkloadEntry[] {\n  const groups = new Map<string | null, ItemFrontMatter[]>();\n  for (const item of activeItems) {\n    const key = item.assignee ?? null;\n    const existing = groups.get(key) ?? [];\n    existing.push(item);\n    groups.set(key, existing);\n  }\n\n  return [...groups.entries()]\n    .map(([assignee, items]) => ({\n      assignee,\n      active: items.length,\n      in_progress: items.filter((item) => isInProgressStatus(item.status, statusRegistry)).length,\n      items: items.map((item) => item.id).sort(),\n    }))\n    .sort((a, b) => b.active - a.active)\n    .slice(0, limit);\n}\n\nfunction buildStaleness(\n  allNonTerminal: ItemFrontMatter[],\n  staleThresholdDays: number,\n  now: string,\n  limit: number,\n): StaleEntry[] {\n  const cutoffMs = new Date(now).getTime() - staleThresholdDays * 24 * 60 * 60 * 1000;\n\n  return allNonTerminal\n    .filter((item) => new Date(item.updated_at).getTime() < cutoffMs)\n    .map((item) => ({\n      id: item.id,\n      title: item.title,\n      status: item.status,\n      updated_at: item.updated_at,\n      stale_days: Math.floor((new Date(now).getTime() - new Date(item.updated_at).getTime()) / (24 * 60 * 60 * 1000)),\n    }))\n    .sort((a, b) => b.stale_days - a.stale_days)\n    .slice(0, limit);\n}\n\nfunction buildRecentlyCreated(\n  allNonTerminal: ItemFrontMatter[],\n  statusRegistry: RuntimeStatusRegistry,\n  childrenByParent: Map<string, ItemFrontMatter[]>,\n  limit: number,\n): RecentContextItem[] {\n  return allNonTerminal\n    .map((item) => ({ item, sortKey: sortableTimestamp(item.created_at) }))\n    .sort((left, right) => {\n      const byCreated = compareTimestampStrings(right.sortKey, left.sortKey);\n      return byCreated !== 0 ? byCreated : left.item.id.localeCompare(right.item.id);\n    })\n    .slice(0, limit)\n    .map(({ item }) => ({\n      ...toContextFocusItem(item, statusRegistry, childrenByParent),\n      created_at: item.created_at,\n    }));\n}\n\nfunction buildUnparented(\n  allNonTerminal: ItemFrontMatter[],\n  statusRegistry: RuntimeStatusRegistry,\n  childrenByParent: Map<string, ItemFrontMatter[]>,\n  limit: number,\n): ContextFocusItem[] {\n  return allNonTerminal\n    .filter((item) => !normalizedParentId(item.parent) && !HIGH_LEVEL_TYPES.has(item.type))\n    .sort((left, right) => compareCriticalItems(left, right, statusRegistry))\n    .slice(0, limit)\n    .map((item) => toContextFocusItem(item, statusRegistry, childrenByParent));\n}\n\nfunction buildTestHealth(\n  activeItems: ItemFrontMatter[],\n): TestHealthSummary {\n  let itemsWithTests = 0;\n  let itemsWithRecentRuns = 0;\n  let passed = 0;\n  let failed = 0;\n  let skipped = 0;\n  const itemsFailing: string[] = [];\n\n  for (const item of activeItems) {\n    if ((item.tests ?? []).length > 0) {\n      itemsWithTests++;\n    }\n    const runs = item.test_runs ?? [];\n    if (runs.length > 0) {\n      itemsWithRecentRuns++;\n      let itemHasFailure = false;\n      for (const run of runs) {\n        passed += run.passed ?? 0;\n        failed += run.failed ?? 0;\n        skipped += run.skipped ?? 0;\n        if ((run.failed ?? 0) > 0) {\n          itemHasFailure = true;\n        }\n      }\n      if (itemHasFailure) {\n        itemsFailing.push(item.id);\n      }\n    }\n  }\n\n  return {\n    items_with_tests: itemsWithTests,\n    items_with_recent_runs: itemsWithRecentRuns,\n    recent_runs: { passed, failed, skipped },\n    items_failing: itemsFailing.sort(),\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Markdown formatting\n// ---------------------------------------------------------------------------\n\nfunction formatClock(timestamp: string): string {\n  return `${new Date(timestamp).toISOString().slice(11, 16)}Z`;\n}\n\nfunction formatFocusLine(item: ContextFocusItem): string {\n  const orderToken = item.order === null ? \"-\" : String(item.order);\n  const deadlineToken = item.deadline ?? \"-\";\n  const parentToken = item.parent ? ` parent:${item.parent}` : \"\";\n  const progressToken =\n    item.children_total !== undefined && item.children_closed !== undefined && item.completion_pct !== undefined\n      ? ` children:${item.children_closed}/${item.children_total} done:${item.completion_pct}%`\n      : \"\";\n  return `${item.id} p${item.priority} ${item.status} ${item.type} order:${orderToken} deadline:${deadlineToken}${parentToken}${progressToken} ${item.title}`;\n}\n\n// Renders a focus row projected to a `--fields` subset as space-separated\n// field:value tokens, mirroring the projection field order. Array values join\n// with commas; missing/null values render as `-`.\nfunction formatProjectedFocusLine(item: ContextFocusItem, fields: string[]): string {\n  const source = item as unknown as Record<string, unknown>;\n  return fields\n    .map((field) => {\n      const value = source[field];\n      if (Array.isArray(value)) return `${field}:${value.join(\",\")}`;\n      return `${field}:${value ?? \"-\"}`;\n    })\n    .join(\" \");\n}\n\nfunction formatAgendaLine(event: CalendarRow): string {\n  const base = `${formatClock(event.at)} [${event.kind}] ${event.item_id} p${event.item_priority} ${event.item_status} ${event.item_title}`;\n  if (event.kind === \"reminder\") {\n    return `${base} — ${event.reminder_text}`;\n  }\n  if (event.kind === \"event\") {\n    const recurringSuffix = event.event_recurring ? \" (recurring)\" : \"\";\n    const title = event.event_title ?? event.item_title;\n    return `${base} — ${title}${recurringSuffix}`;\n  }\n  return base;\n}\n\nfunction pushContextFocusSection(\n  lines: string[],\n  title: string,\n  rows: ContextFocusItem[],\n  emptyText: string,\n  renderFocus: (item: ContextFocusItem) => string,\n): void {\n  lines.push(`## ${title}`);\n  if (rows.length === 0) {\n    lines.push(emptyText);\n  } else {\n    for (const item of rows) {\n      lines.push(`- ${renderFocus(item)}`);\n    }\n  }\n  lines.push(\"\");\n}\n\nfunction pushBlockedFallbackSection(\n  lines: string[],\n  result: ContextResult,\n  renderFocus: (item: ContextFocusItem) => string,\n): void {\n  if (result.blocked_fallback.length === 0) {\n    return;\n  }\n  lines.push(\"## Blocked fallback\");\n  for (const item of result.blocked_fallback) {\n    lines.push(`- ${renderFocus(item)}`);\n  }\n  lines.push(\"\");\n}\n\nfunction pushAgendaSection(lines: string[], result: ContextResult): void {\n  lines.push(\"## Agenda\");\n  lines.push(\n    `- events: ${result.agenda.summary.events} (deadlines: ${result.agenda.summary.deadlines}, reminders: ${result.agenda.summary.reminders}, scheduled: ${result.agenda.summary.scheduled})`,\n  );\n  if (result.agenda.events.length === 0) {\n    lines.push(\"No agenda events matched the selected filters.\");\n  } else {\n    for (const event of result.agenda.events) {\n      lines.push(`- ${formatAgendaLine(event)}`);\n    }\n  }\n  lines.push(\"\");\n}\n\nfunction pushHierarchySection(lines: string[], result: ContextResult): void {\n  if (!result.hierarchy || result.hierarchy.length === 0) {\n    return;\n  }\n  lines.push(\"## Hierarchy\");\n  for (const node of result.hierarchy) {\n    const pct = node.children_total > 0 ? Math.round((node.children_closed / node.children_total) * 100) : 0;\n    lines.push(`- ${node.id} ${node.type} ${node.status} \"${node.title}\" [${node.children_closed}/${node.children_total} done ${pct}%]`);\n    for (const child of node.children) {\n      const cpct = child.children_total > 0 ? Math.round((child.children_closed / child.children_total) * 100) : 0;\n      lines.push(`  - ${child.id} ${child.type} ${child.status} \"${child.title}\" [${child.children_closed}/${child.children_total} done ${cpct}%]`);\n    }\n  }\n  lines.push(\"\");\n}\n\nfunction pushProgressSection(lines: string[], result: ContextResult): void {\n  if (!result.progress || result.progress.length === 0) {\n    return;\n  }\n  lines.push(\"## Progress\");\n  for (const entry of result.progress) {\n    lines.push(`- ${entry.id} \"${entry.title}\" ${entry.completion_pct}% (${entry.closed}/${entry.total} closed, ${entry.in_progress} wip, ${entry.open} open, ${entry.blocked} blocked)`);\n  }\n  lines.push(\"\");\n}\n\nfunction pushRecentlyCreatedSection(\n  lines: string[],\n  result: ContextResult,\n  focusFields: string[] | undefined,\n  renderFocus: (item: ContextFocusItem) => string,\n): void {\n  if (!result.recently_created || result.recently_created.length === 0) {\n    return;\n  }\n  lines.push(\"## Recently created\");\n  for (const item of result.recently_created) {\n    lines.push(focusFields ? `- ${renderFocus(item)}` : `- ${dateTokenForTimestamp(item.created_at)} ${formatFocusLine(item)}`);\n  }\n  lines.push(\"\");\n}\n\nfunction pushUnparentedSection(\n  lines: string[],\n  result: ContextResult,\n  renderFocus: (item: ContextFocusItem) => string,\n): void {\n  if (!result.unparented || result.unparented.length === 0) {\n    return;\n  }\n  lines.push(\"## Unparented\");\n  for (const item of result.unparented) {\n    lines.push(`- ${renderFocus(item)}`);\n  }\n  lines.push(\"\");\n}\n\nfunction pushActivitySection(lines: string[], result: ContextResult): void {\n  if (!result.activity || result.activity.length === 0) {\n    return;\n  }\n  lines.push(\"## Recent activity\");\n  for (const entry of result.activity) {\n    const msg = entry.msg ? ` ${entry.msg}` : \"\";\n    lines.push(`- ${entry.ts.slice(0, 16)}Z ${entry.id} ${entry.op} by:${entry.author}${msg}`);\n  }\n  lines.push(\"\");\n}\n\nfunction pushBlockersSection(lines: string[], result: ContextResult): void {\n  if (!result.blockers || result.blockers.length === 0) {\n    return;\n  }\n  lines.push(\"## Blockers\");\n  for (const entry of result.blockers) {\n    const by = entry.blocked_by ? `blocked_by:${entry.blocked_by}(${entry.blocked_by_status ?? \"?\"})` : \"blocked_by:-\";\n    const reason = entry.blocked_reason ? ` reason:\"${entry.blocked_reason}\"` : \"\";\n    const note = entry.unblock_note ? ` unblock:\"${entry.unblock_note}\"` : \"\";\n    lines.push(`- ${entry.id} \"${entry.title}\" ${by}${reason}${note}`);\n  }\n  lines.push(\"\");\n}\n\nfunction pushFilesSection(lines: string[], result: ContextResult): void {\n  if (!result.files || result.files.length === 0) {\n    return;\n  }\n  lines.push(\"## Hot files\");\n  for (const file of result.files) {\n    lines.push(`- ${file.path} refs:${file.references} items:[${file.items.join(\",\")}]`);\n  }\n  lines.push(\"\");\n}\n\nfunction pushWorkloadSection(lines: string[], result: ContextResult): void {\n  if (!result.workload || result.workload.length === 0) {\n    return;\n  }\n  lines.push(\"## Workload\");\n  for (const entry of result.workload) {\n    const who = entry.assignee ?? \"(unassigned)\";\n    lines.push(`- ${who} active:${entry.active} wip:${entry.in_progress} items:[${entry.items.join(\",\")}]`);\n  }\n  lines.push(\"\");\n}\n\nfunction pushStalenessSection(lines: string[], result: ContextResult): void {\n  if (!result.staleness || result.staleness.length === 0) {\n    return;\n  }\n  lines.push(\"## Stale items\");\n  for (const entry of result.staleness) {\n    lines.push(`- ${entry.id} ${entry.status} stale:${entry.stale_days}d last:${entry.updated_at.slice(0, 10)} \"${entry.title}\"`);\n  }\n  lines.push(\"\");\n}\n\nfunction pushTestHealthSection(lines: string[], result: ContextResult): void {\n  if (!result.tests) {\n    return;\n  }\n  lines.push(\"## Test health\");\n  lines.push(`- items_with_tests: ${result.tests.items_with_tests}`);\n  lines.push(`- items_with_recent_runs: ${result.tests.items_with_recent_runs}`);\n  lines.push(`- passed: ${result.tests.recent_runs.passed}, failed: ${result.tests.recent_runs.failed}, skipped: ${result.tests.recent_runs.skipped}`);\n  if (result.tests.items_failing.length > 0) {\n    lines.push(`- items_failing: [${result.tests.items_failing.join(\",\")}]`);\n  }\n  lines.push(\"\");\n}\n\nfunction pushEmptyContextSuggestions(lines: string[], result: ContextResult): void {\n  const isEmpty =\n    result.summary.active_items === 0 &&\n    result.summary.blocked === 0 &&\n    result.agenda.summary.events === 0;\n  if (!isEmpty) {\n    return;\n  }\n  lines.push(\"## Suggestions\");\n  lines.push(\"No active work items or upcoming events. Consider:\");\n  lines.push(\"- `pm create --type Task --title \\\"...\\\"` to add a new work item\");\n  lines.push(\"- `pm list --status closed --limit 5` to review recent completions\");\n  lines.push(\"- `pm search <keywords>` to find related past work\");\n  lines.push(\"- `pm aggregate` for a full project status overview\");\n}\n\n/**\n * Implements render context markdown for the public runtime surface of this module.\n */\nexport function renderContextMarkdown(result: ContextResult): string {\n  const lines: string[] = [];\n  const focusFields = result.focus_fields;\n  const renderFocus = (item: ContextFocusItem): string =>\n    focusFields ? formatProjectedFocusLine(item, focusFields) : formatFocusLine(item);\n  lines.push(\"# pm context\");\n  lines.push(\"\");\n  lines.push(`- now: ${result.now}`);\n  lines.push(`- depth: ${result.depth}`);\n  if (result.filters.parent) {\n    lines.push(`- scope: subtree of ${result.filters.parent}`);\n  }\n  lines.push(`- active_items: ${result.summary.active_items} (in_progress: ${result.summary.in_progress}, open: ${result.summary.open})`);\n  if (result.summary.total_items !== undefined) {\n    lines.push(`- total_items: ${result.summary.total_items} (closed: ${result.summary.closed ?? 0}, canceled: ${result.summary.canceled ?? 0})`);\n  }\n  lines.push(`- agenda_events: ${result.summary.agenda_events}`);\n  lines.push(`- blocked_fallback_used: ${result.summary.blocked_fallback_used}`);\n  const renderedSections = result.sections_included.filter(\n    (section) => section !== \"blockers\" || (result.blockers?.length ?? 0) > 0,\n  );\n  if (renderedSections.length > 0) {\n    lines.push(`- sections: ${renderedSections.join(\", \")}`);\n  }\n  lines.push(\"\");\n\n  pushContextFocusSection(lines, \"High-level focus\", result.high_level, \"No high-level active items.\", renderFocus);\n  pushContextFocusSection(lines, \"Low-level focus\", result.low_level, \"No low-level active items.\", renderFocus);\n  pushBlockedFallbackSection(lines, result, renderFocus);\n  pushAgendaSection(lines, result);\n  pushHierarchySection(lines, result);\n  pushProgressSection(lines, result);\n  pushRecentlyCreatedSection(lines, result, focusFields, renderFocus);\n  pushUnparentedSection(lines, result, renderFocus);\n  pushActivitySection(lines, result);\n  pushBlockersSection(lines, result);\n  pushFilesSection(lines, result);\n  pushWorkloadSection(lines, result);\n  pushStalenessSection(lines, result);\n  pushTestHealthSection(lines, result);\n  pushEmptyContextSuggestions(lines, result);\n\n  return lines.join(\"\\n\");\n}\n\n// ---------------------------------------------------------------------------\n// Main runner\n// ---------------------------------------------------------------------------\n\ninterface ContextRuntime {\n  settings: PmSettings;\n  contextSettings: ContextSettings;\n  statusRegistry: RuntimeStatusRegistry;\n  depth: ContextDepth;\n  limit: number;\n  sectionsIncluded: ContextSectionName[];\n  activityLimit: number;\n  staleThresholdDays: number;\n  parentScope: string | undefined;\n  focusFields: string[] | undefined;\n  baseListOptions: Record<string, unknown>;\n}\n\ninterface ContextCorpus {\n  listed: Awaited<ReturnType<typeof runList>>;\n  listedFrontMatter: ItemFrontMatter[];\n  allItems: ItemFrontMatter[];\n  fullCorpus: ItemFrontMatter[];\n  subtreeIds: Set<string> | undefined;\n}\n\ninterface ContextFocusGroups {\n  activeItems: ItemFrontMatter[];\n  blockedItems: ItemFrontMatter[];\n  highLevel: ContextFocusItem[];\n  lowLevel: ContextFocusItem[];\n  blockedFallback: ContextFocusItem[];\n  blockedFallbackUsed: boolean;\n}\n\ninterface ContextOptionalSections {\n  hierarchy?: HierarchyNode[];\n  activity?: CompactActivityEntry[];\n  progress?: ProgressEntry[];\n  blockersSection?: BlockerEntry[];\n  recentlyCreated?: RecentContextItem[];\n  unparented?: ContextFocusItem[];\n  filesSection?: HotFile[];\n  workload?: WorkloadEntry[];\n  staleness?: StaleEntry[];\n  tests?: TestHealthSummary;\n}\n\nasync function resolveContextRuntime(options: ContextOptions, global: GlobalOptions): Promise<ContextRuntime> {\n  const pmRoot = resolvePmRoot(process.cwd(), global.path);\n  const settings = await readSettings(pmRoot);\n  /* c8 ignore start -- settings persistence currently always materializes context defaults */\n  const contextSettings = settings.context ?? SETTINGS_DEFAULTS.context;\n  /* c8 ignore stop */\n  const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);\n  const depth = parseContextDepth(options.depth, contextSettings);\n  return {\n    settings,\n    contextSettings,\n    statusRegistry,\n    depth,\n    limit: parseContextLimit(options.limit ?? options.maxItems, depth),\n    sectionsIncluded: parseContextSections(options.section, depth, contextSettings),\n    activityLimit: parseActivityLimit(options.activityLimit, contextSettings),\n    staleThresholdDays: parseStaleThresholdDays(options.staleThreshold, contextSettings),\n    parentScope: parseContextParent(options.parent),\n    focusFields: parseContextFocusFields(options.fields),\n    baseListOptions: stripListProjectionFlags(options),\n  };\n}\n\nfunction contextNeedsAllItems(sectionsIncluded: ContextSectionName[]): boolean {\n  return sectionsIncluded.some((section) =>\n    [\"hierarchy\", \"progress\", \"blockers\", \"staleness\", \"recently_created\", \"unparented\"].includes(section),\n  );\n}\n\nfunction buildUnpaginatedContextListOptions(baseListOptions: Record<string, unknown>, extra: Partial<ListOptions>): ListOptions {\n  return {\n    ...baseListOptions,\n    ...extra,\n    noTruncate: true,\n    limit: undefined,\n    offset: undefined,\n  };\n}\n\nasync function loadContextCorpus(\n  options: ContextOptions,\n  global: GlobalOptions,\n  runtime: ContextRuntime,\n): Promise<ContextCorpus> {\n  const needsAllItems = contextNeedsAllItems(runtime.sectionsIncluded);\n  const listOptions: ListOptions = runtime.parentScope === undefined\n    ? { ...runtime.baseListOptions, excludeTerminal: true }\n    : buildUnpaginatedContextListOptions(runtime.baseListOptions, { excludeTerminal: true });\n  const listed = await runList(undefined, listOptions, global);\n  let listedFrontMatter = listed.items as ItemFrontMatter[];\n  let allItems: ItemFrontMatter[] = listedFrontMatter;\n  if (needsAllItems || runtime.parentScope !== undefined) {\n    const allListed = await runList(\n      undefined,\n      buildUnpaginatedContextListOptions(runtime.baseListOptions, { excludeTerminal: false }),\n      global,\n    );\n    allItems = allListed.items as ItemFrontMatter[];\n  }\n  const fullCorpus = allItems;\n  const subtreeIds = resolveContextSubtreeIds(runtime.parentScope, fullCorpus);\n  if (subtreeIds) {\n    listedFrontMatter = listedFrontMatter.filter((item) => subtreeIds.has(item.id.trim().toLowerCase()));\n    allItems = allItems.filter((item) => subtreeIds.has(item.id.trim().toLowerCase()));\n  }\n  return { listed, listedFrontMatter, allItems, fullCorpus, subtreeIds };\n}\n\nfunction resolveContextSubtreeIds(parentScope: string | undefined, fullCorpus: ItemFrontMatter[]): Set<string> | undefined {\n  if (parentScope === undefined) {\n    return undefined;\n  }\n  const subtree = collectSubtreeIds(fullCorpus, parentScope);\n  if (!subtree.found) {\n    throw new PmCliError(`Context --parent item not found: ${parentScope}`, EXIT_CODE.NOT_FOUND);\n  }\n  return subtree.ids;\n}\n\nfunction resolveContextFocusGroups(\n  listedFrontMatter: ItemFrontMatter[],\n  allItems: ItemFrontMatter[],\n  statusRegistry: RuntimeStatusRegistry,\n  sectionsIncluded: ContextSectionName[],\n  limit: number,\n): ContextFocusGroups {\n  const ranked = [...listedFrontMatter].sort((left, right) => compareCriticalItems(left, right, statusRegistry));\n  const activeStatuses = statusRegistry.active_statuses;\n  const activeItems = ranked.filter((item) => activeStatuses.has(normalizeStatusForRegistry(item.status, statusRegistry)));\n  const blockedItems = ranked.filter((item) =>\n    statusRegistry.blocked_statuses.has(normalizeStatusForRegistry(item.status, statusRegistry)),\n  );\n  const childrenByParent = buildChildrenByParent(allItems);\n  const focusChildrenByParent = contextNeedsAllItems(sectionsIncluded) ? childrenByParent : undefined;\n  const highLevel = activeItems\n    .filter((item) => HIGH_LEVEL_TYPES.has(item.type))\n    .slice(0, limit)\n    .map((item) => toContextFocusItem(item, statusRegistry, focusChildrenByParent));\n  const lowLevel = activeItems\n    .filter((item) => !HIGH_LEVEL_TYPES.has(item.type))\n    .slice(0, limit)\n    .map((item) => toContextFocusItem(item, statusRegistry, focusChildrenByParent));\n  const blockedFallbackUsed = activeItems.length === 0;\n  return {\n    activeItems,\n    blockedItems,\n    highLevel,\n    lowLevel,\n    blockedFallback: blockedFallbackUsed\n      ? blockedItems.slice(0, limit).map((item) => toContextFocusItem(item, statusRegistry, focusChildrenByParent))\n      : [],\n    blockedFallbackUsed,\n  };\n}\n\nasync function buildContextAgenda(\n  options: ContextOptions,\n  global: GlobalOptions,\n  runtime: ContextRuntime,\n  subtreeIds: Set<string> | undefined,\n): Promise<{ agenda: Awaited<ReturnType<typeof runCalendar>>; agendaEvents: CalendarRow[]; agendaSummary: ContextAgendaSummary }> {\n  const calendarOptions: CalendarOptions = {\n    ...runtime.baseListOptions,\n    view: \"agenda\",\n    include: \"all\",\n    limit: runtime.parentScope === undefined ? String(runtime.limit) : undefined,\n  };\n  const agenda = await runCalendar(calendarOptions, global);\n  const scopedAgenda =\n    subtreeIds === undefined\n      ? agenda.events\n      : agenda.events.filter((event) => subtreeIds.has(event.item_id.trim().toLowerCase()));\n  const agendaEvents = filterTerminalCalendarEvents(scopedAgenda, runtime.statusRegistry).slice(0, runtime.limit);\n  return { agenda, agendaEvents, agendaSummary: summarizeAgenda(agendaEvents) };\n}\n\nfunction countContextStatus(items: ItemFrontMatter[], status: string | undefined, statusRegistry: RuntimeStatusRegistry): number {\n  const targetStatus = String(status);\n  return items.filter((item) => normalizeStatusForRegistry(item.status, statusRegistry) === targetStatus).length;\n}\n\nasync function buildOptionalContextSections(params: {\n  runtime: ContextRuntime;\n  allItems: ItemFrontMatter[];\n  fullCorpus: ItemFrontMatter[];\n  focusGroups: ContextFocusGroups;\n  now: string;\n  global: GlobalOptions;\n}): Promise<ContextOptionalSections> {\n  const { runtime, allItems, fullCorpus, focusGroups, now, global } = params;\n  const childrenByParent = buildChildrenByParent(allItems);\n  const itemMap = new Map(fullCorpus.map((item) => [item.id, item]));\n  const allNonTerminal = allItems.filter((item) => !isTerminalStatus(item.status, runtime.statusRegistry));\n  const has = (section: ContextSectionName) => runtime.sectionsIncluded.includes(section);\n  return {\n    hierarchy: has(\"hierarchy\") ? buildHierarchy(allItems, focusGroups.activeItems, runtime.statusRegistry, runtime.limit) : undefined,\n    activity: has(\"activity\") ? await buildActivity(runtime.activityLimit, global) : undefined,\n    progress: has(\"progress\") ? buildProgress(allItems, focusGroups.activeItems, runtime.statusRegistry, runtime.limit) : undefined,\n    blockersSection: has(\"blockers\") ? buildBlockers(focusGroups.blockedItems, itemMap, runtime.limit) : undefined,\n    recentlyCreated: has(\"recently_created\")\n      ? buildRecentlyCreated(allNonTerminal, runtime.statusRegistry, childrenByParent, runtime.limit)\n      : undefined,\n    unparented: has(\"unparented\") ? buildUnparented(allNonTerminal, runtime.statusRegistry, childrenByParent, runtime.limit) : undefined,\n    filesSection: has(\"files\") ? buildHotFiles(focusGroups.activeItems, runtime.limit) : undefined,\n    workload: has(\"workload\") ? buildWorkload(focusGroups.activeItems, runtime.statusRegistry, runtime.limit) : undefined,\n    staleness: has(\"staleness\") ? buildStaleness(allNonTerminal, runtime.staleThresholdDays, now, runtime.limit) : undefined,\n    tests: has(\"tests\") ? buildTestHealth(focusGroups.activeItems) : undefined,\n  };\n}\n\nfunction buildContextSummaryExtras(\n  needsAllItems: boolean,\n  allItems: ItemFrontMatter[],\n  statusRegistry: RuntimeStatusRegistry,\n): Pick<ContextSummary, \"total_items\" | \"closed\" | \"canceled\"> {\n  if (!needsAllItems) {\n    return {};\n  }\n  const canceledStatus = normalizeStatusInput(\"canceled\", statusRegistry);\n  return {\n    total_items: allItems.length,\n    closed: allItems.filter((item) => isClosedStatus(item.status, statusRegistry)).length,\n    canceled: allItems.filter((item) => normalizeStatusForRegistry(item.status, statusRegistry) === canceledStatus).length,\n  };\n}\n\nfunction attachOptionalContextSections(result: ContextResult, sections: ContextOptionalSections): void {\n  if (sections.hierarchy) result.hierarchy = sections.hierarchy;\n  if (sections.activity) result.activity = sections.activity;\n  if (sections.progress) result.progress = sections.progress;\n  if (sections.blockersSection) result.blockers = sections.blockersSection;\n  if (sections.recentlyCreated) result.recently_created = sections.recentlyCreated;\n  if (sections.unparented) result.unparented = sections.unparented;\n  if (sections.filesSection) result.files = sections.filesSection;\n  if (sections.workload) result.workload = sections.workload;\n  if (sections.staleness) result.staleness = sections.staleness;\n  if (sections.tests) result.tests = sections.tests;\n}\n\nfunction applyContextFocusProjection(result: ContextResult, focusFields: string[] | undefined): void {\n  if (!focusFields) {\n    return;\n  }\n  result.focus_fields = focusFields;\n  result.high_level = projectContextFocusRows(result.high_level, focusFields);\n  result.low_level = projectContextFocusRows(result.low_level, focusFields);\n  result.blocked_fallback = projectContextFocusRows(result.blocked_fallback, focusFields);\n  if (result.recently_created) {\n    result.recently_created = projectContextFocusRows(result.recently_created, focusFields) as RecentContextItem[];\n  }\n  if (result.unparented) {\n    result.unparented = projectContextFocusRows(result.unparented, focusFields);\n  }\n}\n\nfunction maybeAttachEmptyContextSuggestions(result: ContextResult, activeItems: ItemFrontMatter[], blockedItems: ItemFrontMatter[]): void {\n  if (activeItems.length > 0 || blockedItems.length > 0 || result.agenda.events.length > 0) {\n    return;\n  }\n  result.suggestions = [\n    'pm create --type Task --title \"...\" to add a new work item',\n    \"pm list --status closed --limit 5 to review recent completions\",\n    \"pm search <keywords> to find related past work\",\n    \"pm aggregate for a full project status overview\",\n  ];\n}\n\n/**\n * Implements run context for the public runtime surface of this module.\n */\nexport async function runContext(options: ContextOptions, global: GlobalOptions): Promise<ContextResult> {\n  const runtime = await resolveContextRuntime(options, global);\n  const corpus = await loadContextCorpus(options, global, runtime);\n  const focusGroups = resolveContextFocusGroups(\n    corpus.listedFrontMatter,\n    corpus.allItems,\n    runtime.statusRegistry,\n    runtime.sectionsIncluded,\n    runtime.limit,\n  );\n  const agendaContext = await buildContextAgenda(options, global, runtime, corpus.subtreeIds);\n  const warnings = mergeSortedWarnings(corpus.listed.warnings, agendaContext.agenda.warnings);\n  const inProgressCount = countContextStatus(\n    focusGroups.activeItems,\n    normalizeStatusInput(\"in_progress\", runtime.statusRegistry),\n    runtime.statusRegistry,\n  );\n  const openCount = countContextStatus(\n    focusGroups.activeItems,\n    normalizeStatusInput(\"open\", runtime.statusRegistry),\n    runtime.statusRegistry,\n  );\n  const sections = await buildOptionalContextSections({\n    runtime,\n    allItems: corpus.allItems,\n    fullCorpus: corpus.fullCorpus,\n    focusGroups,\n    now: agendaContext.agenda.now,\n    global,\n  });\n  const summaryExtras = buildContextSummaryExtras(\n    contextNeedsAllItems(runtime.sectionsIncluded),\n    corpus.allItems,\n    runtime.statusRegistry,\n  );\n\n  const result: ContextResult = {\n    output_default: \"toon\",\n    now: agendaContext.agenda.now,\n    depth: runtime.depth,\n    sections_included: runtime.sectionsIncluded,\n    window: {\n      anchor: agendaContext.agenda.anchor,\n      start: agendaContext.agenda.range.start,\n      end: agendaContext.agenda.range.end,\n      past: agendaContext.agenda.range.past,\n      from: agendaContext.agenda.range.from,\n      to: agendaContext.agenda.range.to,\n    },\n    filters: {\n      type: options.type ?? null,\n      tag: options.tag ?? null,\n      priority: options.priority ?? null,\n      assignee: options.assignee ?? null,\n      assignee_filter: options.assigneeFilter ?? null,\n      sprint: options.sprint ?? null,\n      release: options.release ?? null,\n      limit: options.limit ?? options.maxItems ?? null,\n      parent: runtime.parentScope ?? null,\n      /* c8 ignore next -- listed/calendar runtime filters are always materialized by their command handlers */\n      runtime_filters: (corpus.listed.filters.runtime_filters ?? agendaContext.agenda.filters.runtime_filters ?? {}) as Record<string, unknown>,\n    },\n    summary: {\n      active_items: focusGroups.activeItems.length,\n      in_progress: inProgressCount,\n      open: openCount,\n      blocked: focusGroups.blockedItems.length,\n      blocked_fallback_used: focusGroups.blockedFallbackUsed,\n      high_level: focusGroups.highLevel.length,\n      low_level: focusGroups.lowLevel.length,\n      agenda_events: agendaContext.agendaSummary.events,\n      ...summaryExtras,\n    },\n    high_level: focusGroups.highLevel,\n    low_level: focusGroups.lowLevel,\n    blocked_fallback: focusGroups.blockedFallback,\n    agenda: {\n      summary: agendaContext.agendaSummary,\n      events: agendaContext.agendaEvents,\n    },\n  };\n\n  attachOptionalContextSections(result, sections);\n  applyContextFocusProjection(result, runtime.focusFields);\n  if (warnings.length > 0) result.warnings = warnings;\n  maybeAttachEmptyContextSuggestions(result, focusGroups.activeItems, focusGroups.blockedItems);\n\n  return result;\n}\n","/**\n * @module cli/commands/search\n *\n * Implements the pm search command surface and its agent-facing runtime behavior.\n */\nimport fs from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { coerceNumberInRange, toNonEmptyStringOrUndefined } from \"../../core/shared/primitives.js\";\nimport { isPathWithinDirectory } from \"../../core/fs/path-utils.js\";\nimport { getActiveExtensionRegistrations, runActiveOnReadHooks } from \"../../core/extensions/index.js\";\nimport { collectRegisteredItemFieldNames } from \"../../core/extensions/item-fields.js\";\nimport {\n  resolveRegisteredSearchProvider,\n  resolveRegisteredVectorStoreAdapter,\n} from \"../../core/extensions/runtime-registrations.js\";\nimport { resolveItemTypeRegistry, type ItemTypeRegistry } from \"../../core/item/type-registry.js\";\nimport { parseLimit, parsePriority, parseType } from \"../shared-parsers.js\";\nimport {\n  executeEmbeddingRequest,\n  resolveEmbeddingProviders,\n  type EmbeddingProviderConfig,\n  type EmbeddingProviderResolution,\n} from \"../../core/search/providers.js\";\nimport {\n  buildDeterministicQueryExpansions,\n  mergeQueryExpansions,\n  normalizeQueryExpansionOutput,\n  normalizeRerankOutput,\n  rerankCandidatesWithEmbeddings,\n  resolveQueryExpansionConfig,\n  resolveRerankConfig,\n  type QueryExpansionConfig,\n  type RerankCandidate,\n  type RerankConfig,\n} from \"../../core/search/relevance.js\";\nimport { resolveSettingsWithSemanticRuntimeDefaults } from \"../../core/search/semantic-defaults.js\";\nimport {\n  executeVectorQuery,\n  resolveVectorStores,\n  type VectorQueryHit,\n  type VectorStoreConfig,\n  type VectorStoreResolution,\n} from \"../../core/search/vector-stores.js\";\nimport { readVectorizationStatusLedger } from \"../../core/search/cache.js\";\nimport {\n  buildEventCorpus,\n  buildPlanFlatCorpus,\n  buildReminderCorpus,\n  buildSearchCorpus,\n  resolveSearchCorpusFields,\n} from \"../../core/search/corpus.js\";\nimport {\n  buildBm25Index,\n  flattenSearchCorpusText,\n  resolveBm25Params,\n  scoreBm25Query,\n  tokenizeBm25,\n  type Bm25Params,\n} from \"../../core/search/bm25.js\";\nimport { collectStaleVectorizationIds } from \"../../core/search/staleness.js\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { parseItemDocument } from \"../../core/item/item-format.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 { collectRuntimeFilterValues, matchesRuntimeFilters } from \"../../core/schema/runtime-field-filters.js\";\nimport {\n  hasMissingMetadataFilter,\n  itemMatchesMissingMetadata,\n  lifecycleClassifierFromStatusRegistry,\n  type LifecycleClassifier,\n} from \"../../core/governance/metadata-coverage.js\";\nimport {\n  hasContentFieldFilter,\n  itemMatchesContentFilters,\n} from \"../../core/governance/content-fields.js\";\nimport {\n  applyFilterValueEcho,\n  buildContentFilterEcho,\n  buildGovernanceMissingFilterEcho,\n  resolveContentFieldFilters,\n  resolveMissingMetadataFilters,\n} from \"./list.js\";\nimport {\n  resolveRuntimeFieldRegistry,\n  resolveRuntimeStatusRegistry,\n  type RuntimeFieldRegistry,\n  type RuntimeStatusRegistry,\n} from \"../../core/schema/runtime-schema.js\";\nimport { EXIT_CODE } from \"../../core/shared/constants.js\";\nimport type { GlobalOptions } from \"../../core/shared/command-types.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { tokenizeAlphaNumeric } from \"../../core/shared/text-normalization.js\";\nimport { compareTimestampStrings, nowIso, resolveIsoOrRelative } from \"../../core/shared/time.js\";\nimport { listAllDocumentCandidatesCached } from \"../../core/store/front-matter-cache.js\";\nimport { listAllFrontMatter } from \"../../core/store/item-store.js\";\nimport { getItemPath, getSettingsPath, resolveGlobalPmRoot, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport type { ItemDocument, ItemFormat, ItemFrontMatter, ItemStatus, ItemType, PmSettings } from \"../../types/index.js\";\nimport type { SharedItemFilterOptions } from \"./item-filter-options.js\";\n\n/**\n * Documents the search options payload exchanged by command, SDK, and package integrations.\n */\nexport interface SearchOptions extends SharedItemFilterOptions {\n  mode?: string;\n  matchMode?: string;\n  minScore?: string | number;\n  count?: boolean;\n  semanticWeight?: string | number;\n  includeLinked?: boolean;\n  titleExact?: boolean;\n  phraseExact?: boolean;\n  limit?: string;\n  compact?: boolean;\n  full?: boolean;\n  fields?: string;\n  // GH-157: emit per-field matched-text snippets on each hit (off by default for\n  // token efficiency). Highlighted spans are wrapped with the «…» markers.\n  highlight?: boolean;\n}\n\n/**\n * Restricts search match mode values accepted by command, SDK, and storage contracts.\n */\nexport type SearchMatchMode = \"and\" | \"or\" | \"exact\";\n\ntype SearchMode = \"keyword\" | \"semantic\" | \"hybrid\";\ntype SearchProjectionMode = \"compact\" | \"full\" | \"fields\";\n\ninterface SearchProjectionConfig {\n  mode: SearchProjectionMode;\n  fields: string[];\n}\n\nconst DEFAULT_COMPACT_SEARCH_FIELDS = [\n  \"id\",\n  \"title\",\n  \"status\",\n  \"type\",\n  \"priority\",\n  \"updated_at\",\n  \"score\",\n  \"matched_fields\",\n] as const;\n\nconst SEARCH_HIT_FIELD_KEYS = new Set([\"score\", \"matched_fields\", \"highlights\"]);\nconst SEARCH_ITEM_FIELD_KEYS = new Set([\n  \"id\",\n  \"title\",\n  \"description\",\n  \"type\",\n  \"status\",\n  \"priority\",\n  \"tags\",\n  \"created_at\",\n  \"updated_at\",\n  \"deadline\",\n  \"assignee\",\n  \"author\",\n  \"estimated_minutes\",\n  \"acceptance_criteria\",\n  \"dependencies\",\n  \"comments\",\n  \"notes\",\n  \"learnings\",\n  \"reminders\",\n  \"events\",\n  \"files\",\n  \"tests\",\n  \"docs\",\n  \"close_reason\",\n  \"parent\",\n  \"reviewer\",\n  \"risk\",\n  \"confidence\",\n  \"sprint\",\n  \"release\",\n  \"blocked_by\",\n  \"blocked_reason\",\n  \"reporter\",\n  \"severity\",\n  \"environment\",\n  \"repro_steps\",\n  \"resolution\",\n  \"expected_result\",\n  \"actual_result\",\n  \"affected_version\",\n  \"fixed_version\",\n  \"component\",\n  \"regression\",\n  \"customer_impact\",\n  \"definition_of_ready\",\n  \"order\",\n  \"rank\",\n  \"goal\",\n  \"objective\",\n  \"value\",\n  \"impact\",\n  \"outcome\",\n  \"why_now\",\n  \"plan\",\n]);\n\nconst LONG_QUERY_TOKEN_THRESHOLD = 2;\nconst LONG_QUERY_TITLE_EXACT_BONUS = 120;\nconst LONG_QUERY_PHRASE_MULTIPLIER = 6;\n// GH-181: in default (OR) match mode, multi-token queries that match EVERY\n// distinct query token in some searchable field get an additive ranking bonus so\n// items covering all terms outrank items matching only a subset. This is a\n// RANKING preference, not a hard filter (use --match-mode and for that).\nconst ALL_TERMS_COVERAGE_BONUS = 40;\nconst EXACT_ID_MATCH_SCORE = 1_000;\nconst SHORT_ID_MATCH_SCORE = 900;\n\n// GH-157 matched-text highlighting (--highlight): markers wrapping each matching\n// token run, and the number of characters of surrounding context retained on\n// each side of the first match in a field. The «…» guillemets are single\n// characters with negligible collision risk against item text, keeping the\n// snippet token-cheap while staying visually unambiguous for agents.\nconst HIGHLIGHT_OPEN = \"«\";\nconst HIGHLIGHT_CLOSE = \"»\";\nconst HIGHLIGHT_SNIPPET_RADIUS = 60;\n\n// GH-157 inline query syntax: bare `field:value` tokens parsed out of the query\n// string and applied as the equivalent filter. The value may itself contain\n// colons (e.g. `tag:area:search`), so only the FIRST colon delimits field from\n// value. Explicit --field flags take precedence over an inline token (see\n// resolveInlineQueryFilters).\nconst INLINE_QUERY_FILTER_FIELDS = [\"tag\", \"status\", \"type\", \"priority\"] as const;\ntype InlineQueryFilterField = (typeof INLINE_QUERY_FILTER_FIELDS)[number];\n\nconst COMPACT_SEARCH_VALUE_FILTER_ECHO_ENTRIES = [\n  {\n    optionKey: \"status\",\n    summaryKey: \"status\",\n    normalize: (value: unknown) => (isStatusAllFilterInput(value) ? \"all\" : value),\n  },\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: \"assignee\", summaryKey: \"assignee\" },\n  { optionKey: \"sprint\", summaryKey: \"sprint\" },\n  { optionKey: \"release\", summaryKey: \"release\" },\n  { optionKey: \"parent\", summaryKey: \"parent\" },\n] as const;\n\n/**\n * Documents the search hit payload exchanged by command, SDK, and package integrations.\n */\nexport interface SearchHit {\n  item: ItemFrontMatter;\n  score: number;\n  matched_fields: string[];\n  // GH-181: whether every distinct query token matched some searchable field.\n  // Used by --match-mode and (hard filter) and the default all-terms ranking\n  // bonus. Not projected into output rows.\n  matched_all_terms?: boolean;\n  // GH-281: marks the keyword hit produced by the exact full-ID / short-ID\n  // early-return in scoreDocument(). The semantic & hybrid ranking paths use it\n  // to guarantee the exact-ID target ALWAYS ranks #1 (and is exempt from the\n  // score threshold / limit), so the keyword-mode exact-ID guarantee is never\n  // lost once vector blending is active. SHORT_ID matches keep score=900 and\n  // full-ID matches keep score=1000, so sortHits still orders full above short.\n  // Not projected into output rows.\n  exact_id_match?: boolean;\n  // GH-157: per-field matched-text snippets, populated only when the caller\n  // passes --highlight. Each entry pairs a matched field name with a snippet of\n  // its text where the matching token runs are wrapped in the «…» markers.\n  highlights?: SearchHitHighlight[];\n}\n\n/**\n * Pairs a matched field name with a snippet of its text where every matching\n * token run is wrapped in the {@link HIGHLIGHT_OPEN}/{@link HIGHLIGHT_CLOSE}\n * markers. Emitted on {@link SearchHit.highlights} when `--highlight` is set.\n */\nexport interface SearchHitHighlight {\n  field: string;\n  snippet: string;\n}\n\n/**\n * Restricts search result item values accepted by command, SDK, and storage contracts.\n */\nexport type SearchResultItem = SearchHit | Record<string, unknown>;\n\ninterface SearchResultBase {\n  query: string;\n  mode: SearchMode;\n  items: SearchResultItem[];\n  count: number;\n  // GH-181: total matched hits after filters/threshold but BEFORE the limit\n  // truncation. Lets callers see how many matched before the (now-default)\n  // keyword limit dropped rows. Only emitted when it differs from count.\n  total?: number;\n  // --count mode: count-only response carries the matched total and skips the\n  // hit rows entirely (items is empty). `count` reflects the same total.\n  count_only?: boolean;\n  warnings?: string[];\n}\n\n/**\n * Documents the search compact result payload exchanged by command, SDK, and package integrations.\n */\nexport interface SearchCompactResult extends SearchResultBase {\n  filters: Record<string, unknown>;\n  projection?: undefined;\n  now?: undefined;\n}\n\n/**\n * Documents the search verbose result payload exchanged by command, SDK, and package integrations.\n */\nexport interface SearchVerboseResult extends SearchResultBase {\n  filters: Record<string, unknown>;\n  projection: {\n    mode: SearchProjectionMode;\n    fields: string[] | null;\n  };\n  now: string;\n}\n\n/**\n * Restricts search result values accepted by command, SDK, and storage contracts.\n */\nexport type SearchResult = SearchCompactResult | SearchVerboseResult;\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\nfunction buildCompactSearchFilterSummary(params: {\n  mode: SearchMode;\n  matchMode: SearchMatchMode;\n  options: SearchOptions;\n  includeLinked: boolean;\n  titleExact: boolean;\n  phraseExact: boolean;\n  scoreThreshold: number;\n  hybridSemanticWeight: number;\n  runtimeFieldFilters?: Record<string, unknown>;\n}): Record<string, unknown> {\n  const {\n    mode,\n    matchMode,\n    options,\n    includeLinked,\n    titleExact,\n    phraseExact,\n    scoreThreshold,\n    hybridSemanticWeight,\n    runtimeFieldFilters,\n  } = params;\n  const filters: Record<string, unknown> = {};\n  applyFilterValueEcho(filters, options, COMPACT_SEARCH_VALUE_FILTER_ECHO_ENTRIES);\n  Object.assign(filters, buildGovernanceMissingFilterEcho(options as Record<string, unknown>));\n  Object.assign(filters, buildContentFilterEcho(options as Record<string, unknown>));\n  if (matchMode !== \"or\") {\n    filters.match_mode = matchMode;\n  }\n  if (includeLinked) {\n    filters.include_linked = true;\n  }\n  if (titleExact) {\n    filters.title_exact = true;\n  }\n  if (phraseExact) {\n    filters.phrase_exact = true;\n  }\n  if (scoreThreshold > 0) {\n    filters.score_threshold = scoreThreshold;\n  }\n  if (mode === \"hybrid\" && options.semanticWeight !== undefined) {\n    filters.hybrid_semantic_weight = hybridSemanticWeight;\n  }\n  if (options.limit !== undefined) {\n    filters.limit = options.limit;\n  }\n  if (isNonEmptyRecord(runtimeFieldFilters)) {\n    filters.runtime_filters = runtimeFieldFilters;\n  }\n  return filters;\n}\n\n// Shared verbose (non-compact) filters echo. Keeps the count-only, empty-result,\n// and primary return paths emitting an identical filter shape (GH-181/pm-13nx).\nfunction buildVerboseSearchFilters(params: {\n  effectiveMode: SearchMode;\n  matchMode: SearchMatchMode;\n  options: SearchOptions;\n  includeLinked: boolean;\n  titleExact: boolean;\n  phraseExact: boolean;\n  scoreThreshold: number;\n  hybridSemanticWeight: number;\n  queryExpansion: QueryExpansionConfig;\n  rerank: RerankConfig;\n  runtimeFieldFilters: Record<string, unknown>;\n}): Record<string, unknown> {\n  const {\n    effectiveMode,\n    matchMode,\n    options,\n    includeLinked,\n    titleExact,\n    phraseExact,\n    scoreThreshold,\n    hybridSemanticWeight,\n    queryExpansion,\n    rerank,\n    runtimeFieldFilters,\n  } = params;\n  return {\n    mode: effectiveMode,\n    match_mode: matchMode,\n    status: isStatusAllFilterInput(options.status) ? \"all\" : valueOrNull(options.status),\n    type: valueOrNull(options.type),\n    tag: valueOrNull(options.tag),\n    priority: valueOrNull(options.priority),\n    deadline_before: valueOrNull(options.deadlineBefore),\n    deadline_after: valueOrNull(options.deadlineAfter),\n    updated_after: valueOrNull(options.updatedAfter),\n    updated_before: valueOrNull(options.updatedBefore),\n    created_after: valueOrNull(options.createdAfter),\n    created_before: valueOrNull(options.createdBefore),\n    assignee: valueOrNull(options.assignee),\n    sprint: valueOrNull(options.sprint),\n    release: valueOrNull(options.release),\n    parent: valueOrNull(options.parent),\n    ...buildGovernanceMissingFilterEcho(options as Record<string, unknown>),\n    ...buildContentFilterEcho(options as Record<string, unknown>),\n    include_linked: includeLinked,\n    title_exact: titleExact,\n    phrase_exact: phraseExact,\n    score_threshold: scoreThreshold,\n    hybrid_semantic_weight: effectiveMode === \"hybrid\" ? hybridSemanticWeight : null,\n    query_expansion_enabled: queryExpansion.enabled,\n    query_expansion_provider: queryExpansion.provider,\n    rerank_enabled: rerank.enabled,\n    rerank_model: rerank.model,\n    rerank_top_k: rerank.top_k,\n    limit: valueOrNull(options.limit),\n    runtime_filters: runtimeFieldFilters,\n  };\n}\n\nfunction valueOrNull(value: unknown): unknown {\n  return value ?? null;\n}\n\ninterface ExtensionSearchProviderContext {\n  query: string;\n  mode: SearchMode;\n  tokens: string[];\n  options: SearchOptions;\n  settings: PmSettings;\n  documents: ItemDocument[];\n}\n\ninterface ExtensionSearchProviderHit {\n  id: string;\n  score: number;\n  matched_fields?: string[];\n}\n\ntype ExtensionSearchProviderQuery = (\n  context: ExtensionSearchProviderContext,\n) => Promise<ExtensionSearchProviderHit[] | { hits?: ExtensionSearchProviderHit[] }> | ExtensionSearchProviderHit[] | { hits?: ExtensionSearchProviderHit[] };\n\ninterface ExtensionSearchProviderQueryExpansionContext {\n  query: string;\n  mode: Exclude<SearchMode, \"keyword\">;\n  settings: PmSettings;\n}\n\ntype ExtensionSearchProviderQueryExpansion = (\n  context: ExtensionSearchProviderQueryExpansionContext,\n) => Promise<string[] | { queries?: string[] }> | string[] | { queries?: string[] };\n\ninterface ExtensionSearchProviderRerankCandidate {\n  id: string;\n  text: string;\n  score: number;\n}\n\ninterface ExtensionSearchProviderRerankContext {\n  query: string;\n  mode: \"hybrid\";\n  model: string;\n  top_k: number;\n  settings: PmSettings;\n  candidates: ExtensionSearchProviderRerankCandidate[];\n}\n\ntype ExtensionSearchProviderRerank = (\n  context: ExtensionSearchProviderRerankContext,\n) => Promise<Array<{ id?: unknown; score?: unknown }> | { hits?: Array<{ id?: unknown; score?: unknown }> }>\n  | Array<{ id?: unknown; score?: unknown }>\n  | { hits?: Array<{ id?: unknown; score?: unknown }> };\n\ntype ExtensionVectorQuery = (\n  context: {\n    vector: number[];\n    limit: number;\n    settings: PmSettings;\n  },\n) => Promise<VectorQueryHit[]> | VectorQueryHit[];\n\ntype ExtensionVectorUpsert = (context: {\n  points: Array<{\n    id: string;\n    vector: number[];\n    payload: Record<string, unknown>;\n  }>;\n  settings: PmSettings;\n}) => Promise<void> | void;\n\ntype ExtensionVectorAdapter = {\n  adapterName: string;\n  query?: ExtensionVectorQuery;\n  upsert?: ExtensionVectorUpsert;\n};\n\n\n\ninterface SearchModeContext {\n  hasProvider: boolean;\n  hasVectorStore: boolean;\n}\n\ntype ImplicitSemanticFallbackReason = \"timeout\" | \"connection\" | \"error\";\n\n/**\n * Aggregate the `code` strings found along an error's `cause` chain.\n *\n * undici (Node's fetch) collapses connection errors to the generic message\n * \"fetch failed\" and stashes the real syscall code (e.g. `ECONNREFUSED`) on\n * `error.cause.code`. Walking the chain (bounded depth) lets the fallback\n * classifier label a downed/unreachable Ollama backend as \"connection\" rather\n * than the catch-all \"error\".\n */\nexport function collectErrorCauseCodes(error: unknown): string {\n  const codes: string[] = [];\n  let current: unknown = error;\n  for (let depth = 0; depth < 5 && current && typeof current === \"object\"; depth += 1) {\n    const code = (current as { code?: unknown }).code;\n    if (typeof code === \"string\") {\n      codes.push(code.toLowerCase());\n    }\n    current = (current as { cause?: unknown }).cause;\n  }\n  return codes.join(\" \");\n}\n\n/**\n * Classify why an implicit/explicit semantic search degraded to keyword mode,\n * inspecting both the error message and the {@link collectErrorCauseCodes} chain\n * so undici's generic \"fetch failed\" is recognised as a connection failure.\n */\nexport function classifyImplicitSemanticFallbackReason(error: unknown): ImplicitSemanticFallbackReason {\n  const message = (error instanceof Error ? error.message : String(error)).toLowerCase();\n  const causeCodes = collectErrorCauseCodes(error);\n  const haystack = `${message} ${causeCodes}`;\n  if (haystack.includes(\"timed out\") || haystack.includes(\"timeout\") || haystack.includes(\"etimedout\")) {\n    return \"timeout\";\n  }\n  if (\n    haystack.includes(\"econnrefused\") ||\n    haystack.includes(\"connection refused\") ||\n    haystack.includes(\"connect \") ||\n    haystack.includes(\"enotfound\") ||\n    haystack.includes(\"eai_again\") ||\n    haystack.includes(\"econnreset\") ||\n    haystack.includes(\"fetch failed\")\n  ) {\n    return \"connection\";\n  }\n  return \"error\";\n}\n\n// Explicit --semantic/--hybrid searches must never hard-fail an agent when the\n// embedding/vector backend is unreachable or unconfigured: degrade to keyword\n// search and surface a machine-readable warning instead of an unknown_error.\nfunction buildExplicitSemanticFallbackWarning(requestedMode: SearchMode, error: unknown): string {\n  const reason = classifyImplicitSemanticFallbackReason(error);\n  return `search_${requestedMode}_fallback:${reason}:using_keyword_mode`;\n}\n\n/**\n * Compare the vectorization-status ledger against the filtered corpus and, when\n * the vector index is behind, emit a one-line stderr warning plus a structured\n * `vector_index_stale:N` entry in the JSON warnings array. Best-effort: ledger\n * read failures fall through silently — the existing semantic/hybrid fallback\n * paths cover backend errors.\n */\nasync function maybeEmitVectorIndexStaleWarning(\n  pmRoot: string,\n  filteredDocuments: ItemDocument[],\n  warnings: string[],\n): Promise<void> {\n  try {\n    const ledger = await readVectorizationStatusLedger(pmRoot);\n    if (ledger.warnings.length > 0) {\n      warnings.push(...ledger.warnings);\n    }\n    const staleIds = collectStaleVectorizationIds(\n      filteredDocuments.map((document) => ({\n        id: document.metadata.id,\n        updated_at: document.metadata.updated_at,\n      })),\n      ledger.entries,\n    );\n    if (staleIds.length === 0) {\n      return;\n    }\n    warnings.push(`vector_index_stale:${staleIds.length}`);\n    /* c8 ignore start -- singular/plural warning text branches are cosmetic and validated in integration UX tests */\n    process.stderr.write(\n      `[pm] warning: ${staleIds.length} item${staleIds.length === 1 ? \" is\" : \"s are\"} new or modified since the last reindex and ${staleIds.length === 1 ? \"is\" : \"are\"} NOT in the semantic index yet — they will be missing from semantic/hybrid results until you run 'pm reindex --mode hybrid'. (Write-time embedding is governed by search.mutation_refresh_policy; staleness means the embed was skipped, failed, or the backend was unreachable.)\\n`,\n    );\n    /* c8 ignore stop */\n  } catch {\n    // Best-effort: missing/unreadable ledger is not a query-blocking concern.\n  }\n}\n\nfunction parseMode(raw: string | undefined, _context: SearchModeContext): SearchMode {\n  if (raw === undefined) {\n    return \"keyword\";\n  }\n  const normalized = raw.trim().toLowerCase();\n  if (normalized !== \"keyword\" && normalized !== \"semantic\" && normalized !== \"hybrid\") {\n    throw new PmCliError(\"Search mode must be one of keyword|semantic|hybrid\", EXIT_CODE.USAGE);\n  }\n  return normalized;\n}\n\nfunction parseIncludeLinked(raw: boolean | undefined): boolean {\n  return raw === true;\n}\n\nfunction parseTitleExact(raw: boolean | undefined): boolean {\n  return raw === true;\n}\n\nfunction parsePhraseExact(raw: boolean | undefined): boolean {\n  return raw === true;\n}\n\nfunction parseSemanticWeightOverride(raw: unknown): number | undefined {\n  return coerceNumberInRange(raw, 0, 1) ?? undefined;\n}\n\nfunction parseMatchMode(raw: string | undefined): SearchMatchMode {\n  if (raw === undefined) {\n    return \"or\";\n  }\n  const normalized = raw.trim().toLowerCase();\n  if (normalized !== \"and\" && normalized !== \"or\" && normalized !== \"exact\") {\n    throw new PmCliError(\"Search --match-mode must be one of and|or|exact\", EXIT_CODE.USAGE);\n  }\n  return normalized;\n}\n\n// Per-query --min-score overrides the persistent search.score_threshold for this\n// query only. Accepts a finite number >= 0; anything else is a usage error.\nfunction parseMinScoreOverride(raw: unknown): number | undefined {\n  if (raw === undefined || raw === null || raw === \"\") {\n    return undefined;\n  }\n  /* c8 ignore start -- numeric-vs-string coercion branch is exercised via integration CLI parsing */\n  const parsed = typeof raw === \"number\" ? raw : Number(String(raw).trim());\n  /* c8 ignore stop */\n  if (!Number.isFinite(parsed) || parsed < 0) {\n    throw new PmCliError(\"Search --min-score must be a finite number >= 0\", EXIT_CODE.USAGE);\n  }\n  return parsed;\n}\n\n// updated/created date-window filters share the deadline ISO+relative resolver\n// so `pm search` matches `pm list` semantics exactly: pass an ISO timestamp or a\n// SIGNED relative offset (\"-2h\"/\"-7d\" reach into the past, \"+1d\" the future;\n// units h/d/w/m, m = months — there is no minutes unit).\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 normalizeSearchPhrase(value: string): string {\n  return value\n    .toLowerCase()\n    .replace(/\\s+/g, \" \")\n    .trim();\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\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(\"Search --fields requires a comma-separated list of field names\", EXIT_CODE.USAGE);\n  }\n  return [...new Set(selectors)];\n}\n\nfunction parseProjectionConfig(options: SearchOptions): SearchProjectionConfig {\n  const compactRequested = options.compact === true;\n  const fullRequested = options.full === true;\n  const fieldSelectors = parseFieldSelectors(options.fields);\n  const enabledModes = Number(compactRequested) + Number(fullRequested) + Number(fieldSelectors !== undefined);\n  if (enabledModes > 1) {\n    throw new PmCliError(\n      \"Search projection options are mutually exclusive. Use one of --compact, --full, or --fields.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (compactRequested) {\n    return {\n      mode: \"compact\",\n      fields: [...DEFAULT_COMPACT_SEARCH_FIELDS],\n    };\n  }\n  if (fullRequested) {\n    return {\n      mode: \"full\",\n      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\nexport const _testOnlySearchCommand = {\n  applyFilters,\n  applyExactQueryFilters,\n  applyInlineQueryFilters,\n  buildHitHighlights,\n  buildVerboseSearchFilters,\n  buildExplicitSemanticFallbackWarning,\n  buildCompactSearchFilterSummary,\n  buildHybridLexicalScore,\n  buildRerankCorpus,\n  buildSemanticHits,\n  classifyImplicitSemanticFallbackReason,\n  collectErrorCauseCodes,\n  collectExactPhraseFields,\n  collectLinkedPaths,\n  combineHybridHits,\n  computeBuiltInBm25Hits,\n  computeSemanticOrHybridHits,\n  resolveBuiltInBm25Mode,\n  countOccurrences,\n  dependencyEntries,\n  documentContainsExactPhrase,\n  emptySearchResult,\n  highlightFieldSnippet,\n  loadDocuments,\n  markTokenRuns,\n  parseInlineQueryFilters,\n  maybeEmitVectorIndexStaleWarning,\n  loadLinkedCorpus,\n  mergeVectorHitsById,\n  normalizeExtensionProviderHits,\n  normalizeScoreMap,\n  parseProjectionConfig,\n  parseTimestampWindow,\n  parseTokens,\n  readSearchFieldValue,\n  requireSemanticDependencies,\n  resolveExtensionSearchProvider,\n  resolveExtensionSearchProviderByName,\n  resolveExtensionVectorAdapter,\n  resolveLinkedCorpusRoots,\n  scoreDocument,\n  sortHits,\n  stringArray,\n  textEntries,\n  validateSearchProjectionFields,\n};\n\n/* c8 ignore start -- projection/runtime-field validation edge permutations are covered by integration query-contract tests */\nfunction validateSearchProjectionFields(projection: SearchProjectionConfig, runtimeFieldRegistry: RuntimeFieldRegistry): void {\n  if (projection.mode !== \"fields\") {\n    return;\n  }\n  const runtimeKeys = new Set(runtimeFieldRegistry.definitions.flatMap((field) => [field.key, field.metadata_key]));\n  const unknown = projection.fields.filter((field) => {\n    const normalized = field.trim();\n    const itemKey = normalized.startsWith(\"item.\") ? normalized.slice(\"item.\".length) : normalized;\n    return !SEARCH_HIT_FIELD_KEYS.has(normalized) && !SEARCH_ITEM_FIELD_KEYS.has(itemKey) && !runtimeKeys.has(itemKey);\n  });\n  if (unknown.length > 0) {\n    throw new PmCliError(`Unknown search --fields value(s): ${unknown.join(\", \")}`, EXIT_CODE.USAGE, {\n      examples: [\n        \"pm search <query> --fields id,title,status,score\",\n        \"pm search <query> --fields id,title,item.description,matched_fields\",\n      ],\n      nextSteps: [\"Use item.<field> for explicit item metadata fields, or run pm search --help for projection examples.\"],\n    });\n  }\n}\n/* c8 ignore stop */\n\nfunction parseTokens(query: string): string[] {\n  const normalized = normalizeSearchPhrase(query);\n  if (!normalized) {\n    throw new PmCliError(\"Search query must not be empty\", EXIT_CODE.USAGE);\n  }\n  return normalized.split(/\\s+/).filter(Boolean);\n}\n\n/**\n * Result of extracting inline `field:value` tokens from a raw search query.\n */\ninterface InlineQueryParse {\n  /** The query with all recognized inline filter tokens removed. */\n  residualQuery: string;\n  /** Recognized inline filters keyed by field name; first occurrence per field wins. */\n  inlineFilters: Partial<Record<InlineQueryFilterField, string>>;\n}\n\n/**\n * Split a raw search query into its residual keyword text and any inline\n * `field:value` filter tokens (GH-157). Recognized fields are\n * {@link INLINE_QUERY_FILTER_FIELDS}; the value runs to the end of the token so\n * colon-bearing values like `tag:area:search` parse as `{ tag: \"area:search\" }`.\n * Only the first occurrence of each field is captured — later duplicates are left\n * in the residual query so they are never silently dropped. Tokens whose prefix\n * is not a recognized field (`foo:bar`) stay in the residual query verbatim.\n */\nfunction parseInlineQueryFilters(query: string): InlineQueryParse {\n  const inlineFilters: Partial<Record<InlineQueryFilterField, string>> = {};\n  const residualTokens: string[] = [];\n  for (const token of query.split(/\\s+/).filter((entry) => entry.length > 0)) {\n    const separatorIndex = token.indexOf(\":\");\n    const field = separatorIndex > 0 ? token.slice(0, separatorIndex).toLowerCase() : \"\";\n    const value = separatorIndex > 0 ? token.slice(separatorIndex + 1) : \"\";\n    const matchedField = (INLINE_QUERY_FILTER_FIELDS as ReadonlyArray<string>).includes(field)\n      ? (field as InlineQueryFilterField)\n      : undefined;\n    if (matchedField && value.length > 0 && inlineFilters[matchedField] === undefined) {\n      inlineFilters[matchedField] = value;\n      continue;\n    }\n    residualTokens.push(token);\n  }\n  return {\n    residualQuery: residualTokens.join(\" \"),\n    inlineFilters,\n  };\n}\n\n/**\n * Merge inline `field:value` filters into a search options object (GH-157).\n * Explicit `--field` flags always win: an inline token is applied only when the\n * corresponding option is not already set, and a conflicting inline token is\n * recorded as a `search_inline_filter_ignored:<field>:flag_takes_precedence`\n * warning so the override is observable rather than silent. Returns a fresh\n * options object — the caller's input is never mutated.\n */\nfunction applyInlineQueryFilters(\n  options: SearchOptions,\n  inlineFilters: Partial<Record<InlineQueryFilterField, string>>,\n  warnings: string[],\n): SearchOptions {\n  const merged: SearchOptions = { ...options };\n  for (const field of INLINE_QUERY_FILTER_FIELDS) {\n    const inlineValue = inlineFilters[field];\n    if (inlineValue === undefined) {\n      continue;\n    }\n    if (toNonEmptyStringOrUndefined(merged[field]) !== undefined) {\n      warnings.push(`search_inline_filter_ignored:${field}:flag_takes_precedence`);\n      continue;\n    }\n    merged[field] = inlineValue;\n  }\n  return merged;\n}\n\nfunction stringArray(value: unknown): string[] {\n  return Array.isArray(value) ? value.filter((entry): entry is string => typeof entry === \"string\") : [];\n}\n\nfunction textEntries(value: unknown): Array<{ text: string }> {\n  return Array.isArray(value)\n    ? value.filter((entry): entry is { text: string } =>\n        typeof entry === \"object\" && entry !== null && typeof (entry as { text?: unknown }).text === \"string\",\n      )\n    : [];\n}\n\nfunction dependencyEntries(value: unknown): Array<{ id: string; kind: string }> {\n  return Array.isArray(value)\n    ? value.filter((entry): entry is { id: string; kind: string } =>\n        typeof entry === \"object\" &&\n        entry !== null &&\n        typeof (entry as { id?: unknown }).id === \"string\" &&\n        typeof (entry as { kind?: unknown }).kind === \"string\",\n      )\n    : [];\n}\n\nfunction collectExactPhraseFields(document: ItemDocument): string[] {\n  const item = document.metadata;\n  return [\n    item.title,\n    item.description,\n    item.status,\n    stringArray(item.tags).join(\" \"),\n    document.body,\n    textEntries(item.comments).map((entry) => entry.text).join(\" \"),\n    textEntries(item.notes).map((entry) => entry.text).join(\" \"),\n    textEntries(item.learnings).map((entry) => entry.text).join(\" \"),\n    buildReminderCorpus(item).join(\" \"),\n    buildEventCorpus(item).join(\" \"),\n    dependencyEntries(item.dependencies).map((entry) => `${entry.id} ${entry.kind}`).join(\" \"),\n    buildPlanFlatCorpus(item),\n  ];\n}\n\nfunction documentContainsExactPhrase(document: ItemDocument, normalizedQuery: string): boolean {\n  return collectExactPhraseFields(document).some((fieldValue) =>\n    normalizeSearchPhrase(fieldValue).includes(normalizedQuery),\n  );\n}\n\nfunction applyExactQueryFilters(\n  items: ItemDocument[],\n  normalizedQuery: string,\n  options: { titleExact: boolean; phraseExact: boolean },\n): ItemDocument[] {\n  if (!options.titleExact && !options.phraseExact) {\n    return items;\n  }\n  return items.filter((document) => {\n    if (options.titleExact && normalizeSearchPhrase(document.metadata.title) !== normalizedQuery) {\n      return false;\n    }\n    if (options.phraseExact && !documentContainsExactPhrase(document, normalizedQuery)) {\n      return false;\n    }\n    return true;\n  });\n}\n\ntype SearchMissingMetadataFilters = ReturnType<typeof resolveMissingMetadataFilters>;\ntype SearchContentFieldFilters = ReturnType<typeof resolveContentFieldFilters>;\n\ninterface SearchMetadataFilterSet {\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  sprintFilter: string | undefined;\n  releaseFilter: string | undefined;\n  parentFilter: string | undefined;\n  statusSet: Set<ItemStatus> | undefined;\n  missingMetadataFilters: SearchMissingMetadataFilters;\n  missingMetadataActive: boolean;\n  contentFieldFilters: SearchContentFieldFilters;\n  contentFiltersActive: boolean;\n}\n\nfunction assertSearchAssigneeFilter(assigneeFilter: string | undefined): void {\n  // Match pm list: --assignee no longer accepts none/null (unassigned filtering\n  // belongs to a dedicated flag there; pm search has no presence flag so reject\n  // the sentinel values explicitly rather than silently matching a literal).\n  if (assigneeFilter && (assigneeFilter.toLowerCase() === \"none\" || assigneeFilter.toLowerCase() === \"null\")) {\n    throw new PmCliError('--assignee no longer accepts \"none\" or \"null\".', EXIT_CODE.USAGE);\n  }\n}\n\nfunction resolveSearchMetadataFilterSet(\n  options: SearchOptions,\n  typeRegistry: ItemTypeRegistry,\n  statusFilter: ItemStatus[] | undefined,\n): SearchMetadataFilterSet {\n  const assigneeFilter = options.assignee?.trim();\n  assertSearchAssigneeFilter(assigneeFilter);\n  const missingMetadataFilters = resolveMissingMetadataFilters(options);\n  const contentFieldFilters = resolveContentFieldFilters(options as Record<string, unknown>);\n  return {\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    sprintFilter: options.sprint?.trim(),\n    releaseFilter: options.release?.trim(),\n    parentFilter: options.parent?.trim(),\n    statusSet: statusFilter && statusFilter.length > 0 ? new Set<ItemStatus>(statusFilter) : undefined,\n    missingMetadataFilters,\n    missingMetadataActive: hasMissingMetadataFilter(missingMetadataFilters),\n    contentFieldFilters,\n    contentFiltersActive: hasContentFieldFilter(contentFieldFilters),\n  };\n}\n\nfunction matchesScalarSearchFilters(item: ItemFrontMatter, filters: SearchMetadataFilterSet): boolean {\n  return (\n    matchesIdentitySearchFilters(item, filters) &&\n    matchesTimestampSearchFilters(item, filters) &&\n    matchesOwnerSearchFilters(item, filters)\n  );\n}\n\nfunction matchesIdentitySearchFilters(item: ItemFrontMatter, filters: SearchMetadataFilterSet): boolean {\n  if (filters.statusSet && !filters.statusSet.has(item.status)) return false;\n  if (filters.typeFilter && item.type !== filters.typeFilter) return false;\n  if (filters.tagFilter && !stringArray(item.tags).includes(filters.tagFilter)) return false;\n  if (filters.priorityFilter !== undefined && item.priority !== filters.priorityFilter) return false;\n  return true;\n}\n\nfunction matchesTimestampSearchFilters(item: ItemFrontMatter, filters: SearchMetadataFilterSet): 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  if (filters.createdBefore && compareTimestampStrings(item.created_at, filters.createdBefore) > 0) return false;\n  return true;\n}\n\nfunction matchesOwnerSearchFilters(item: ItemFrontMatter, filters: SearchMetadataFilterSet): boolean {\n  if (filters.assigneeFilter !== undefined && item.assignee !== filters.assigneeFilter) return false;\n  if (filters.sprintFilter !== undefined && item.sprint !== filters.sprintFilter) return false;\n  /* c8 ignore start -- release/parent metadata filter combinations are covered by integration search fixtures */\n  if (filters.releaseFilter !== undefined && item.release !== filters.releaseFilter) return false;\n  if (filters.parentFilter !== undefined && item.parent !== filters.parentFilter) return false;\n  /* c8 ignore stop */\n  return true;\n}\n\nfunction matchesSearchMetadataFilters(\n  document: ItemDocument,\n  filters: SearchMetadataFilterSet,\n  runtimeFieldFilters: Record<string, unknown>,\n  lifecycleClassifier: LifecycleClassifier,\n): boolean {\n  const item = document.metadata;\n  if (!matchesScalarSearchFilters(item, filters)) {\n    return false;\n  }\n  if (!matchesRuntimeFilters(item as Record<string, unknown>, runtimeFieldFilters)) {\n    return false;\n  }\n  if (filters.missingMetadataActive && !itemMatchesMissingMetadata(item, filters.missingMetadataFilters, lifecycleClassifier)) {\n    return false;\n  }\n  if (filters.contentFiltersActive && !itemMatchesContentFilters(item, filters.contentFieldFilters)) {\n    return false;\n  }\n  return true;\n}\n\nfunction applyFilters(\n  items: ItemDocument[],\n  options: SearchOptions,\n  typeRegistry: ItemTypeRegistry,\n  runtimeFieldFilters: Record<string, unknown>,\n  statusFilter: ItemStatus[] | undefined,\n  lifecycleClassifier: LifecycleClassifier,\n): ItemDocument[] {\n  const filters = resolveSearchMetadataFilterSet(options, typeRegistry, statusFilter);\n  return items.filter((document) =>\n    matchesSearchMetadataFilters(document, filters, runtimeFieldFilters, lifecycleClassifier),\n  );\n}\n\nfunction countOccurrences(haystack: string, needle: string): number {\n  let count = 0;\n  let index = 0;\n  while (true) {\n    const foundAt = haystack.indexOf(needle, index);\n    if (foundAt < 0) {\n      return count;\n    }\n    count += 1;\n    index = foundAt + needle.length;\n  }\n}\n\nfunction tokenizeForExactTokenMatch(value: string): string[] {\n  return tokenizeAlphaNumeric(value);\n}\n\nfunction collectLinkedPaths(item: ItemFrontMatter): Array<{ scope: \"project\" | \"global\"; path: string }> {\n  const fromFiles = (item.files ?? []).map((entry) => ({\n    scope: entry.scope,\n    path: entry.path.trim(),\n  }));\n  const fromDocs = (item.docs ?? []).map((entry) => ({\n    scope: entry.scope,\n    path: entry.path.trim(),\n  }));\n  const fromTests = (item.tests ?? [])\n    .filter((entry): entry is typeof entry & { path: string } => typeof entry.path === \"string\" && entry.path.trim().length > 0)\n    .map((entry) => ({\n      scope: entry.scope,\n      path: entry.path.trim(),\n    }));\n  const sorted = [...fromFiles, ...fromDocs, ...fromTests]\n    .filter((entry) => entry.path.length > 0)\n    .sort((a, b) => a.scope.localeCompare(b.scope) || a.path.localeCompare(b.path));\n  const deduped = new Map<string, { scope: \"project\" | \"global\"; path: string }>();\n  for (const entry of sorted) {\n    deduped.set(`${entry.scope}:${entry.path}`, entry);\n  }\n  return [...deduped.values()];\n}\n\ninterface ContainmentRoot {\n  resolved: string;\n  realpath: string;\n}\n\ninterface LinkedCorpusRoots {\n  projectContainmentRoot: ContainmentRoot | null;\n  globalContainmentRoot: ContainmentRoot | null;\n}\n\nasync function resolveContainmentRoot(root: string): Promise<ContainmentRoot | null> {\n  const resolved = path.resolve(root);\n  try {\n    const realpathRoot = await fs.realpath(resolved);\n    return {\n      resolved,\n      realpath: realpathRoot,\n    };\n  } catch {\n    return null;\n  }\n}\n\nasync function resolveLinkedCorpusRoots(projectRoot: string, globalRoot: string): Promise<LinkedCorpusRoots> {\n  const [projectContainmentRoot, globalContainmentRoot] = await Promise.all([\n    resolveContainmentRoot(projectRoot),\n    resolveContainmentRoot(globalRoot),\n  ]);\n  return {\n    projectContainmentRoot,\n    globalContainmentRoot,\n  };\n}\n\nasync function loadLinkedCorpus(\n  document: ItemDocument,\n  roots: LinkedCorpusRoots,\n): Promise<string> {\n  const linkedPaths = collectLinkedPaths(document.metadata);\n  const chunks: string[] = [];\n  for (const linkedPath of linkedPaths) {\n    const containmentRoot = linkedPath.scope === \"global\" ? roots.globalContainmentRoot : roots.projectContainmentRoot;\n    if (!containmentRoot) {\n      continue;\n    }\n    const resolved = path.resolve(containmentRoot.resolved, linkedPath.path);\n    if (!isPathWithinDirectory(containmentRoot.resolved, resolved)) {\n      continue;\n    }\n    let linkedRealpath: string;\n    try {\n      linkedRealpath = await fs.realpath(resolved);\n    } catch {\n      continue;\n    }\n    if (!isPathWithinDirectory(containmentRoot.realpath, linkedRealpath)) {\n      continue;\n    }\n    try {\n      await runActiveOnReadHooks({\n        path: resolved,\n        scope: linkedPath.scope,\n      });\n      chunks.push(await fs.readFile(resolved, \"utf8\"));\n    } catch {\n      // Best-effort linked-content indexing: unreadable paths are ignored.\n    }\n  }\n  return chunks.join(\"\\n\");\n}\n\n/**\n * Documents the search tuning payload exchanged by command, SDK, and package integrations.\n */\nexport interface SearchTuning {\n  title_exact_bonus: number;\n  title_weight: number;\n  description_weight: number;\n  tags_weight: number;\n  status_weight: number;\n  body_weight: number;\n  comments_weight: number;\n  notes_weight: number;\n  learnings_weight: number;\n  reminders_weight: number;\n  events_weight: number;\n  dependencies_weight: number;\n  linked_content_weight: number;\n}\n\n/**\n * Canonical definition of the document-derived searchable fields shared by the\n * lexical scorer ({@link scoreDocument}) and the matched-text highlighter\n * ({@link buildHitHighlights}). Keeping a single source of field name → text\n * extractor → tuning weight guarantees the highlighter can only ever produce\n * snippets for fields the scorer actually inspected. The `linked_content` field\n * is appended separately by the scorer because its text is supplied per-query\n * rather than derived from the document.\n */\nconst SEARCHABLE_FIELD_BUILDERS: ReadonlyArray<{\n  name: string;\n  weightKey: keyof SearchTuning;\n  value: (document: ItemDocument) => string;\n}> = [\n  { name: \"title\", weightKey: \"title_weight\", value: (document) => document.metadata.title },\n  { name: \"description\", weightKey: \"description_weight\", value: (document) => document.metadata.description },\n  { name: \"tags\", weightKey: \"tags_weight\", value: (document) => stringArray(document.metadata.tags).join(\" \") },\n  {\n    name: \"status\",\n    weightKey: \"status_weight\",\n    value: (document) => (typeof document.metadata.status === \"string\" ? document.metadata.status : \"\"),\n  },\n  { name: \"body\", weightKey: \"body_weight\", value: (document) => document.body },\n  {\n    name: \"comments\",\n    weightKey: \"comments_weight\",\n    value: (document) => textEntries(document.metadata.comments).map((entry) => entry.text).join(\" \"),\n  },\n  {\n    name: \"notes\",\n    weightKey: \"notes_weight\",\n    value: (document) => textEntries(document.metadata.notes).map((entry) => entry.text).join(\" \"),\n  },\n  {\n    name: \"learnings\",\n    weightKey: \"learnings_weight\",\n    value: (document) => textEntries(document.metadata.learnings).map((entry) => entry.text).join(\" \"),\n  },\n  { name: \"reminders\", weightKey: \"reminders_weight\", value: (document) => buildReminderCorpus(document.metadata).join(\" \") },\n  { name: \"events\", weightKey: \"events_weight\", value: (document) => buildEventCorpus(document.metadata).join(\" \") },\n  {\n    name: \"dependencies\",\n    weightKey: \"dependencies_weight\",\n    value: (document) => dependencyEntries(document.metadata.dependencies).map((entry) => `${entry.id} ${entry.kind}`).join(\" \"),\n  },\n  { name: \"plan\", weightKey: \"body_weight\", value: (document) => buildPlanFlatCorpus(document.metadata) },\n];\n\n// Name → builder index so the highlighter can resolve a matched field to its\n// text extractor in O(1) and evaluate ONLY the matched fields' values, instead\n// of materializing all twelve (several of which join/build corpora) per hit.\nconst SEARCHABLE_FIELD_BUILDER_BY_NAME = new Map(SEARCHABLE_FIELD_BUILDERS.map((builder) => [builder.name, builder]));\n\nfunction escapeRegExpLiteral(value: string): string {\n  return value.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\n\n/**\n * Wrap every case-insensitive occurrence of any query token in `text` with the\n * {@link HIGHLIGHT_OPEN}/{@link HIGHLIGHT_CLOSE} markers. Token boundaries follow\n * the same substring semantics as the lexical scorer (a token highlights inside\n * longer words, matching how it scored), and overlapping matches are coalesced\n * by the single combined alternation so markers never nest.\n */\nfunction markTokenRuns(text: string, tokens: string[]): string {\n  // Sort by length descending before building the alternation so a longer token\n  // wins over a shorter token that is its prefix (regex alternation is greedy\n  // left-to-right, so `auth|authority` would mark «auth»ority instead of\n  // «authority»). `.filter` already returns a fresh array, so the in-place sort\n  // never mutates the caller's token list.\n  const escaped = tokens\n    .filter((token) => token.length > 0)\n    .sort((left, right) => right.length - left.length)\n    .map(escapeRegExpLiteral);\n  if (escaped.length === 0) {\n    return text;\n  }\n  const pattern = new RegExp(escaped.join(\"|\"), \"gi\");\n  return text.replace(pattern, (match) => `${HIGHLIGHT_OPEN}${match}${HIGHLIGHT_CLOSE}`);\n}\n\n/**\n * Build a single highlighted snippet for one field value (GH-157), or null when\n * no token matches. The snippet is a window of {@link HIGHLIGHT_SNIPPET_RADIUS}\n * characters on each side of the first match with the matching token runs\n * wrapped in markers, prefixed/suffixed with an ellipsis when the field text was\n * trimmed. Returning null lets the caller skip fields with no concrete textual\n * match (e.g. a field flagged purely by the phrase-coverage bonus).\n */\nfunction highlightFieldSnippet(text: string, tokens: string[]): string | null {\n  if (text.length === 0) {\n    return null;\n  }\n  const lowerText = text.toLowerCase();\n  let firstMatchIndex = -1;\n  for (const token of tokens) {\n    if (token.length === 0) {\n      continue;\n    }\n    const index = lowerText.indexOf(token);\n    if (index >= 0 && (firstMatchIndex < 0 || index < firstMatchIndex)) {\n      firstMatchIndex = index;\n    }\n  }\n  if (firstMatchIndex < 0) {\n    return null;\n  }\n  const windowStart = Math.max(0, firstMatchIndex - HIGHLIGHT_SNIPPET_RADIUS);\n  const windowEnd = Math.min(text.length, firstMatchIndex + HIGHLIGHT_SNIPPET_RADIUS);\n  const marked = markTokenRuns(text.slice(windowStart, windowEnd), tokens);\n  const prefix = windowStart > 0 ? \"…\" : \"\";\n  const suffix = windowEnd < text.length ? \"…\" : \"\";\n  return `${prefix}${marked}${suffix}`;\n}\n\n/**\n * Produce per-field matched-text snippets for a hit (GH-157, `--highlight`).\n * Iterates the hit's already-sorted `matched_fields`, retains only the\n * document-derived searchable fields (skipping synthetic markers like `id`,\n * `semantic`, `rerank`, and `linked_content`), and emits a snippet for each\n * field that still contains a concrete token match.\n */\nfunction buildHitHighlights(document: ItemDocument, matchedFields: string[], tokens: string[]): SearchHitHighlight[] {\n  const highlights: SearchHitHighlight[] = [];\n  for (const field of matchedFields) {\n    const builder = SEARCHABLE_FIELD_BUILDER_BY_NAME.get(field);\n    if (builder === undefined) {\n      continue;\n    }\n    const snippet = highlightFieldSnippet(builder.value(document), tokens);\n    if (snippet !== null) {\n      highlights.push({ field, snippet });\n    }\n  }\n  return highlights;\n}\n\ninterface SearchableScoringField {\n  name: string;\n  value: string;\n  weight: number;\n}\n\ninterface SearchScoreState {\n  score: number;\n  matched: Set<string>;\n  matchedTokens: Set<string>;\n}\n\nfunction buildSearchableScoringFields(document: ItemDocument, linkedCorpus: string, tuning: SearchTuning): SearchableScoringField[] {\n  return [\n    ...SEARCHABLE_FIELD_BUILDERS.map((builder) => ({\n      name: builder.name,\n      value: builder.value(document),\n      weight: tuning[builder.weightKey],\n    })),\n    { name: \"linked_content\", value: linkedCorpus, weight: tuning.linked_content_weight },\n  ];\n}\n\nfunction buildExactIdSearchHit(item: ItemFrontMatter, normalizedQuery: string, idPrefix: string): SearchHit | null {\n  const normalizedId = normalizeSearchPhrase(item.id);\n  const normalizedIdPrefix = typeof idPrefix === \"string\" ? idPrefix.trim().toLowerCase() : \"\";\n  const normalizedIdPrefixPhrase = normalizeSearchPhrase(normalizedIdPrefix);\n  const normalizedShortId =\n    normalizedIdPrefixPhrase.length > 0 && normalizedId.startsWith(normalizedIdPrefixPhrase)\n      ? normalizedId.slice(normalizedIdPrefixPhrase.length).trim()\n      : normalizedId;\n  if (normalizedQuery !== normalizedId && normalizedQuery !== normalizedShortId) {\n    return null;\n  }\n  return {\n    item,\n    score: normalizedQuery === normalizedId ? EXACT_ID_MATCH_SCORE : SHORT_ID_MATCH_SCORE,\n    matched_fields: [\"id\"],\n    matched_all_terms: true,\n    exact_id_match: true,\n  };\n}\n\nfunction scoreTokenMatches(\n  tokens: string[],\n  titleTokenCounts: Map<string, number>,\n  searchableFields: SearchableScoringField[],\n  tuning: SearchTuning,\n  state: SearchScoreState,\n): void {\n  for (const token of tokens) {\n    const exactTitleMatches = titleTokenCounts.get(token) ?? 0;\n    if (exactTitleMatches > 0) {\n      state.score += exactTitleMatches * tuning.title_exact_bonus;\n      state.matched.add(\"title\");\n      state.matchedTokens.add(token);\n    }\n    for (const field of searchableFields) {\n      const occurrences = countOccurrences(field.value.toLowerCase(), token);\n      if (occurrences > 0) {\n        state.score += occurrences * field.weight;\n        state.matched.add(field.name);\n        state.matchedTokens.add(token);\n      }\n    }\n  }\n}\n\nfunction scorePhraseMatches(\n  item: ItemFrontMatter,\n  normalizedQuery: string,\n  searchableFields: SearchableScoringField[],\n  state: SearchScoreState,\n): void {\n  const normalizedTitle = normalizeSearchPhrase(item.title);\n  if (normalizedTitle === normalizedQuery) {\n    state.score += LONG_QUERY_TITLE_EXACT_BONUS;\n    state.matched.add(\"title\");\n  }\n  for (const field of searchableFields) {\n    const phraseOccurrences = countOccurrences(normalizeSearchPhrase(field.value), normalizedQuery);\n    if (phraseOccurrences > 0) {\n      state.score += phraseOccurrences * field.weight * LONG_QUERY_PHRASE_MULTIPLIER;\n      state.matched.add(field.name);\n    }\n  }\n}\n\nfunction scoreDocument(\n  document: ItemDocument,\n  tokens: string[],\n  normalizedQuery: string,\n  linkedCorpus: string,\n  tuning: SearchTuning,\n  idPrefix: string,\n  applyCoverageBonus = false,\n): SearchHit | null {\n  const item = document.metadata;\n  const exactIdHit = buildExactIdSearchHit(item, normalizedQuery, idPrefix);\n  if (exactIdHit) {\n    return exactIdHit;\n  }\n  const titleTokenCounts = new Map<string, number>();\n  for (const token of tokenizeForExactTokenMatch(item.title)) {\n    titleTokenCounts.set(token, (titleTokenCounts.get(token) ?? 0) + 1);\n  }\n  const searchableFields = buildSearchableScoringFields(document, linkedCorpus, tuning);\n  const state: SearchScoreState = { score: 0, matched: new Set(), matchedTokens: new Set() };\n  scoreTokenMatches(tokens, titleTokenCounts, searchableFields, tuning, state);\n  const distinctTokens = new Set(tokens);\n  // matchedTokens only ever holds entries drawn from `tokens`, so it is always a\n  // subset of distinctTokens — exact size equality means every distinct term matched.\n  const matchedAllTerms = distinctTokens.size > 0 && state.matchedTokens.size === distinctTokens.size;\n  // GH-181 default-mode all-terms ranking bonus: only meaningful for multi-token\n  // queries where every distinct token matched somewhere.\n  if (applyCoverageBonus && distinctTokens.size > 1 && matchedAllTerms) {\n    state.score += ALL_TERMS_COVERAGE_BONUS;\n  }\n\n  const isLongPhraseQuery = tokens.length >= LONG_QUERY_TOKEN_THRESHOLD && normalizedQuery.includes(\" \");\n  if (isLongPhraseQuery) {\n    scorePhraseMatches(item, normalizedQuery, searchableFields, state);\n  }\n\n  if (state.score <= 0) {\n    return null;\n  }\n\n  return {\n    item,\n    score: state.score,\n    matched_fields: [...state.matched].sort((a, b) => a.localeCompare(b)),\n    matched_all_terms: matchedAllTerms,\n  };\n}\n\nfunction sortHits(items: SearchHit[], statusRegistry: RuntimeStatusRegistry): SearchHit[] {\n  return [...items].sort((a, b) => {\n    const byScore = b.score - a.score;\n    if (byScore !== 0) return byScore;\n    const aTerminal = isTerminalStatus(a.item.status, statusRegistry);\n    const bTerminal = isTerminalStatus(b.item.status, statusRegistry);\n    if (aTerminal !== bTerminal) {\n      return aTerminal ? 1 : -1;\n    }\n    const byPriority = a.item.priority - b.item.priority;\n    if (byPriority !== 0) return byPriority;\n    const byUpdated = compareTimestampStrings(b.item.updated_at, a.item.updated_at);\n    if (byUpdated !== 0) return byUpdated;\n    return a.item.id.localeCompare(b.item.id);\n  });\n}\n\nfunction buildHybridLexicalScore(\n  document: ItemDocument,\n  tokens: string[],\n  normalizedQuery: string,\n  includeLinked: boolean,\n  linkedCorpusById: Map<string, string>,\n  tuning: SearchTuning,\n  idPrefix: string,\n  applyCoverageBonus = false,\n): SearchHit | null {\n  /* c8 ignore start -- linked corpus presence branch is covered by keyword/hybrid integration query tests */\n  return scoreDocument(\n    document,\n    tokens,\n    normalizedQuery,\n    includeLinked ? linkedCorpusById.get(document.metadata.id) ?? \"\" : \"\",\n    tuning,\n    idPrefix,\n    applyCoverageBonus,\n  );\n  /* c8 ignore stop */\n}\n\nfunction normalizeScoreMap(scoreById: Map<string, number>): Map<string, number> {\n  if (scoreById.size === 0) {\n    return new Map();\n  }\n  const values = [...scoreById.values()];\n  const minScore = Math.min(...values);\n  const maxScore = Math.max(...values);\n  if (maxScore === minScore) {\n    return new Map([...scoreById.keys()].map((id) => [id, 1]));\n  }\n  const normalized = new Map<string, number>();\n  for (const [id, score] of scoreById) {\n    normalized.set(id, (score - minScore) / (maxScore - minScore));\n  }\n  return normalized;\n}\n\n/**\n * Implements resolve search max results for the public runtime surface of this module.\n */\nexport function resolveSearchMaxResults(settings: unknown): number {\n  const candidate = (settings as { search?: { max_results?: unknown } }).search?.max_results;\n  if (typeof candidate === \"number\" && Number.isFinite(candidate) && candidate > 0) {\n    return Math.floor(candidate);\n  }\n  return 50;\n}\n\n/**\n * Implements resolve search score threshold for the public runtime surface of this module.\n */\nexport function resolveSearchScoreThreshold(settings: unknown): number {\n  const candidate = (settings as { search?: { score_threshold?: unknown } }).search?.score_threshold;\n  if (typeof candidate === \"number\" && Number.isFinite(candidate)) {\n    return candidate;\n  }\n  return 0;\n}\n\n/**\n * Implements resolve hybrid semantic weight for the public runtime surface of this module.\n */\nexport function resolveHybridSemanticWeight(settings: unknown): number {\n  const candidate = (settings as { search?: { hybrid_semantic_weight?: unknown } }).search?.hybrid_semantic_weight;\n  if (typeof candidate === \"number\" && Number.isFinite(candidate) && candidate >= 0 && candidate <= 1) {\n    return candidate;\n  }\n  return 0.7;\n}\n\n/**\n * Implements resolve search tuning for the public runtime surface of this module.\n */\nexport function resolveSearchTuning(settings: unknown): SearchTuning {\n  const defaults: SearchTuning = {\n    title_exact_bonus: 10,\n    title_weight: 8,\n    description_weight: 5,\n    tags_weight: 6,\n    status_weight: 2,\n    body_weight: 1,\n    comments_weight: 1,\n    notes_weight: 1,\n    learnings_weight: 1,\n    reminders_weight: 2,\n    events_weight: 2,\n    dependencies_weight: 3,\n    linked_content_weight: 1,\n  };\n  const tuning = (settings as { search?: { tuning?: Partial<SearchTuning> } }).search?.tuning;\n  if (!tuning) return defaults;\n\n  const resolveWeight = (candidate: unknown, fallback: number) => {\n    if (typeof candidate === \"number\" && Number.isFinite(candidate) && candidate >= 0) {\n      return candidate;\n    }\n    return fallback;\n  };\n\n  return {\n    title_exact_bonus: resolveWeight(tuning.title_exact_bonus, defaults.title_exact_bonus),\n    title_weight: resolveWeight(tuning.title_weight, defaults.title_weight),\n    description_weight: resolveWeight(tuning.description_weight, defaults.description_weight),\n    tags_weight: resolveWeight(tuning.tags_weight, defaults.tags_weight),\n    status_weight: resolveWeight(tuning.status_weight, defaults.status_weight),\n    body_weight: resolveWeight(tuning.body_weight, defaults.body_weight),\n    comments_weight: resolveWeight(tuning.comments_weight, defaults.comments_weight),\n    notes_weight: resolveWeight(tuning.notes_weight, defaults.notes_weight),\n    learnings_weight: resolveWeight(tuning.learnings_weight, defaults.learnings_weight),\n    reminders_weight: resolveWeight(tuning.reminders_weight, defaults.reminders_weight),\n    events_weight: resolveWeight(tuning.events_weight, defaults.events_weight),\n    dependencies_weight: resolveWeight(tuning.dependencies_weight, defaults.dependencies_weight),\n    linked_content_weight: resolveWeight(tuning.linked_content_weight, defaults.linked_content_weight),\n  };\n}\n\n/* c8 ignore start -- empty-result projection/count/warnings shape matrix is validated by integration response-contract tests */\nfunction emptySearchResult(\n  query: string,\n  mode: SearchMode,\n  matchMode: SearchMatchMode,\n  options: SearchOptions,\n  includeLinked: boolean,\n  scoreThreshold: number,\n  hybridSemanticWeight: number,\n  queryExpansion: QueryExpansionConfig,\n  rerank: RerankConfig,\n  projection: SearchProjectionConfig,\n  warnings: string[],\n  runtimeFieldFilters?: Record<string, unknown>,\n  countOnly = false,\n): SearchResult {\n  // --count consistency: a count-only query that matches nothing must still\n  // carry the same { count_only: true, total } shape as the non-empty path.\n  const countExtras = countOnly ? { total: 0, count_only: true } : {};\n  const compactSummaryMode = projection.mode === \"compact\" && options.compact === true;\n  if (compactSummaryMode) {\n    const compactFilters = buildCompactSearchFilterSummary({\n      mode,\n      matchMode,\n      options,\n      includeLinked,\n      titleExact: options.titleExact === true,\n      phraseExact: options.phraseExact === true,\n      scoreThreshold,\n      hybridSemanticWeight,\n      runtimeFieldFilters,\n    });\n    return {\n      query: query.trim(),\n      mode,\n      items: [],\n      count: 0,\n      ...countExtras,\n      filters: compactFilters,\n      ...(warnings.length > 0 ? { warnings } : {}),\n    };\n  }\n  const projectionFields = projection.mode === \"full\" ? null : [...projection.fields];\n  return {\n    query: query.trim(),\n    mode,\n    items: [],\n    count: 0,\n    ...countExtras,\n    filters: buildVerboseSearchFilters({\n      effectiveMode: mode,\n      matchMode,\n      options,\n      includeLinked,\n      titleExact: options.titleExact === true,\n      phraseExact: options.phraseExact === true,\n      scoreThreshold,\n      hybridSemanticWeight,\n      queryExpansion,\n      rerank,\n      runtimeFieldFilters: runtimeFieldFilters ?? {},\n    }),\n    projection: {\n      mode: projection.mode,\n      fields: projectionFields,\n    },\n    now: nowIso(),\n    ...(warnings.length > 0 ? { warnings } : {}),\n  };\n}\n/* c8 ignore stop */\n\nfunction requireSemanticDependencies(\n  requestedMode: Exclude<SearchMode, \"keyword\">,\n  providerResolution: EmbeddingProviderResolution,\n  vectorResolution: VectorStoreResolution,\n  hasExtensionVectorQuery: boolean,\n): { provider: EmbeddingProviderConfig; vectorStore: VectorStoreConfig | null } {\n  if (!providerResolution.active) {\n    throw new PmCliError(\n      `Search mode '${requestedMode}' requires a configured embedding provider in settings.providers.openai or settings.providers.ollama`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (!vectorResolution.active && !hasExtensionVectorQuery) {\n    throw new PmCliError(\n      `Search mode '${requestedMode}' requires a configured vector store in settings.vector_store.qdrant/settings.vector_store.lancedb or an extension adapter selected by settings.vector_store.adapter`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return {\n    provider: providerResolution.active,\n    vectorStore: vectorResolution.active ?? null,\n  };\n}\n\nconst toOptionalNonEmptyString = toNonEmptyStringOrUndefined;\n\ninterface ExtensionSearchProviderHooks {\n  providerName: string;\n  query?: ExtensionSearchProviderQuery;\n  queryExpansion?: ExtensionSearchProviderQueryExpansion;\n  rerank?: ExtensionSearchProviderRerank;\n}\n\n/* c8 ignore start -- extension search-provider registration permutations are covered by extension integration suites */\nfunction resolveExtensionSearchProviderByName(providerName: string | undefined): ExtensionSearchProviderHooks | null {\n  const registrations = getActiveExtensionRegistrations();\n  const resolved = resolveRegisteredSearchProvider(registrations, providerName);\n  if (!resolved) {\n    return null;\n  }\n  const runtimeDefinition = resolved.runtime_definition ?? resolved.definition;\n  const query = (runtimeDefinition as { query?: unknown }).query;\n  const queryExpansion =\n    (runtimeDefinition as { queryExpansion?: unknown; query_expansion?: unknown }).queryExpansion ??\n    (runtimeDefinition as { queryExpansion?: unknown; query_expansion?: unknown }).query_expansion;\n  const rerank = (runtimeDefinition as { rerank?: unknown }).rerank;\n  const registeredName =\n    toOptionalNonEmptyString((runtimeDefinition as { name?: unknown }).name) ??\n    toOptionalNonEmptyString((resolved.definition as { name?: unknown }).name) ??\n    providerName;\n  /* c8 ignore next 2 -- providerName is required for lookup and remains a non-empty fallback */\n  if (!registeredName) {\n    return null;\n  }\n  const hooks: ExtensionSearchProviderHooks = {\n    providerName: registeredName,\n    ...(typeof query === \"function\" ? { query: query as ExtensionSearchProviderQuery } : {}),\n    ...(typeof queryExpansion === \"function\"\n      ? { queryExpansion: queryExpansion as ExtensionSearchProviderQueryExpansion }\n      : {}),\n    ...(typeof rerank === \"function\" ? { rerank: rerank as ExtensionSearchProviderRerank } : {}),\n  };\n  if (!hooks.query && !hooks.queryExpansion && !hooks.rerank) {\n    return null;\n  }\n  return hooks;\n}\n/* c8 ignore stop */\n\nfunction resolveExtensionSearchProvider(settings: PmSettings): { providerName: string; query: ExtensionSearchProviderQuery } | null {\n  const providerName = toOptionalNonEmptyString((settings.search as { provider?: unknown } | undefined)?.provider);\n  const resolved = resolveExtensionSearchProviderByName(providerName);\n  if (!resolved?.query) {\n    return null;\n  }\n  return {\n    providerName: resolved.providerName,\n    query: resolved.query,\n  };\n}\n\n/* c8 ignore start -- vector adapter runtime definition permutations are covered by extension integration suites */\nfunction resolveExtensionVectorAdapter(settings: PmSettings): ExtensionVectorAdapter | null {\n  const registrations = getActiveExtensionRegistrations();\n  const adapterName = toOptionalNonEmptyString((settings.vector_store as { adapter?: unknown } | undefined)?.adapter);\n  const resolved = resolveRegisteredVectorStoreAdapter(registrations, adapterName);\n  if (!resolved) {\n    return null;\n  }\n  const runtimeDefinition = resolved.runtime_definition ?? resolved.definition;\n  const query = (runtimeDefinition as { query?: unknown }).query;\n  if (typeof query !== \"function\") {\n    return null;\n  }\n  const upsert = (runtimeDefinition as { upsert?: unknown }).upsert;\n  const runtimeAdapterName =\n    toOptionalNonEmptyString((runtimeDefinition as { name?: unknown }).name) ??\n    toOptionalNonEmptyString((resolved.definition as { name?: unknown }).name) ??\n    adapterName ??\n    \"extension\";\n  return {\n    adapterName: runtimeAdapterName,\n    query: query as ExtensionVectorQuery,\n    ...(typeof upsert === \"function\" ? { upsert: upsert as ExtensionVectorUpsert } : {}),\n  };\n}\n/* c8 ignore stop */\n\nfunction normalizeExtensionProviderHits(\n  providerName: string,\n  raw: unknown,\n  filteredById: Map<string, ItemDocument>,\n): SearchHit[] {\n  const rawHits = Array.isArray(raw)\n    ? raw\n    : (raw as { hits?: unknown } | null | undefined)?.hits;\n  if (!Array.isArray(rawHits)) {\n    throw new PmCliError(\n      `Extension search provider \"${providerName}\" must return an array of hits or { hits: [...] }`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n\n  const seen = new Set<string>();\n  const hits: SearchHit[] = [];\n  for (const rawHit of rawHits) {\n    if (typeof rawHit !== \"object\" || rawHit === null) {\n      continue;\n    }\n    const id = toOptionalNonEmptyString((rawHit as { id?: unknown }).id);\n    const score = (rawHit as { score?: unknown }).score;\n    if (!id || typeof score !== \"number\" || !Number.isFinite(score) || seen.has(id)) {\n      continue;\n    }\n    const document = filteredById.get(id);\n    if (!document) {\n      continue;\n    }\n    const matchedFieldsRaw = (rawHit as { matched_fields?: unknown }).matched_fields;\n    const matchedFields =\n      Array.isArray(matchedFieldsRaw) && matchedFieldsRaw.every((entry) => typeof entry === \"string\")\n        ? [...new Set((matchedFieldsRaw as string[]).map((entry) => entry.trim()).filter((entry) => entry.length > 0))].sort((a, b) =>\n            a.localeCompare(b),\n          )\n        : [`provider:${providerName}`];\n    seen.add(id);\n    hits.push({\n      item: document.metadata,\n      score,\n      matched_fields: matchedFields,\n    });\n  }\n  return hits;\n}\n\nfunction buildSemanticHits(\n  vectorHits: VectorQueryHit[],\n  filteredById: Map<string, ItemDocument>,\n): { semanticHits: SearchHit[]; semanticScores: Map<string, number> } {\n  const semanticHits: SearchHit[] = [];\n  const semanticScores = new Map<string, number>();\n  for (const vectorHit of vectorHits) {\n    if (semanticScores.has(vectorHit.id)) {\n      continue;\n    }\n    const document = filteredById.get(vectorHit.id);\n    if (!document) {\n      continue;\n    }\n    semanticScores.set(vectorHit.id, vectorHit.score);\n    semanticHits.push({\n      item: document.metadata,\n      score: vectorHit.score,\n      matched_fields: [\"semantic\"],\n    });\n  }\n  return {\n    semanticHits,\n    semanticScores,\n  };\n}\n\n// GH-281: in semantic & hybrid mode the blended/vector scores live on an\n// arbitrary scale (blended hybrid scores are [0,1]; raw vector similarities are\n// provider-defined), so an exact full-ID or short-ID keyword match can be\n// out-ranked by a high-semantic body mention. This reattaches the exact-ID\n// keyword hit(s) to the top of the ranked set in a reserved band ABOVE every\n// other hit, preserving matched_fields:[\"id\"] and keeping full-ID above\n// short-ID. The reserved scores are derived from the current max so the\n// guarantee holds no matter what scale the backend returns, and the hit is\n// re-inserted even if it was dropped from `rankedHits` (e.g. it had no semantic\n// vector match) so it is never lost to the threshold or the result-limit slice.\nfunction forceExactIdHitsToTop(rankedHits: SearchHit[], keywordHits: SearchHit[]): SearchHit[] {\n  const exactIdHits = keywordHits.filter((hit) => hit.exact_id_match === true);\n  if (exactIdHits.length === 0) {\n    return rankedHits;\n  }\n  const exactIdIds = new Set(exactIdHits.map((hit) => hit.item.id));\n  const remaining = rankedHits.filter((hit) => !exactIdIds.has(hit.item.id));\n  // reduce (not Math.max(...spread)) so a very large pre-truncation candidate\n  // set can never overflow the call stack.\n  const maxRemainingScore = remaining.reduce((max, hit) => Math.max(max, hit.score), 0);\n  // Full-ID hits (score 1000) must rank above short-ID hits (score 900): rank\n  // within the exact-ID band by the original keyword score (descending) so a\n  // full-ID match always precedes a short-ID match for the same query, then\n  // offset the whole band above every remaining hit. ids are unique, so two\n  // exact-ID hits can never tie on score — sorting on score alone is total.\n  // exactIdHits is already a fresh array from keywordHits.filter(...), so sort\n  // it in place — no defensive copy needed.\n  const orderedExactHits = exactIdHits.sort((left, right) => right.score - left.score);\n  const bandBase = maxRemainingScore + orderedExactHits.length + 1;\n  const promoted = orderedExactHits.map((hit, index) => ({\n    // Spread the original keyword hit so flags like matched_all_terms /\n    // exact_id_match are preserved; only the band-slot score and the id-only\n    // matched_fields are overridden.\n    ...hit,\n    // Higher band slot for earlier (higher original keyword score) hits.\n    score: bandBase - index,\n    matched_fields: [\"id\"],\n  }));\n  return [...promoted, ...remaining];\n}\n\nfunction combineHybridHits(\n  filteredById: Map<string, ItemDocument>,\n  semanticScores: Map<string, number>,\n  keywordHits: SearchHit[],\n  hybridSemanticWeight: number,\n  // Matched-field label for the dense-ranking component. Defaults to \"semantic\"\n  // (vector retrieval); the offline BM25 hybrid path passes \"bm25\" so hits carry\n  // an honest provenance marker instead of implying a vector match (pm-75k9).\n  semanticFieldLabel = \"semantic\",\n): SearchHit[] {\n  const keywordScores = new Map(keywordHits.map((entry) => [entry.item.id, entry.score]));\n  const keywordMatches = new Map(keywordHits.map((entry) => [entry.item.id, entry.matched_fields]));\n  const normalizedSemantic = normalizeScoreMap(semanticScores);\n  const normalizedKeyword = normalizeScoreMap(keywordScores);\n  const candidateIds = new Set<string>([...semanticScores.keys(), ...keywordScores.keys()]);\n  const keywordWeight = 1 - hybridSemanticWeight;\n  return [...candidateIds]\n    .map((id) => {\n      const document = filteredById.get(id)!;\n      const semanticScore = normalizedSemantic.get(id) ?? 0;\n      const keywordScore = normalizedKeyword.get(id) ?? 0;\n      const combinedScore = (semanticScore * hybridSemanticWeight) + (keywordScore * keywordWeight);\n      if (combinedScore <= 0) {\n        return null;\n      }\n      const matchedFields = new Set<string>();\n      if (semanticScores.has(id)) {\n        matchedFields.add(semanticFieldLabel);\n      }\n      for (const field of keywordMatches.get(id) ?? []) {\n        matchedFields.add(field);\n      }\n      return {\n        item: document.metadata,\n        score: combinedScore,\n        matched_fields: [...matchedFields].sort((a, b) => a.localeCompare(b)),\n      };\n    })\n    .filter((entry): entry is SearchHit => entry !== null);\n}\n\n/**\n * Built-in BM25 activation outcome for semantic/hybrid search (pm-75k9):\n * - `\"explicit\"`: `search.provider` is `bm25` — the user opted into offline\n *   lexical ranking, so it is used even if an embedding provider is configured.\n * - `\"auto-fallback\"`: `search.provider` is `auto` and neither an embedding\n *   provider nor an extension search provider is available — BM25 is used in\n *   place of degrading to the naive field-weighted keyword scorer.\n * - `null`: BM25 does not apply; the existing embedding/extension path runs.\n */\ntype BuiltInBm25Mode = \"explicit\" | \"auto-fallback\";\n\nfunction resolveBuiltInBm25Mode(params: {\n  configuredProvider: string | undefined;\n  hasEmbeddingProvider: boolean;\n  hasExtensionSearchProvider: boolean;\n}): BuiltInBm25Mode | null {\n  const normalized = params.configuredProvider?.trim().toLowerCase();\n  if (normalized === \"bm25\") {\n    return \"explicit\";\n  }\n  if (normalized === \"auto\" && !params.hasEmbeddingProvider && !params.hasExtensionSearchProvider) {\n    return \"auto-fallback\";\n  }\n  return null;\n}\n\n/**\n * Rank the filtered corpus with the offline BM25 provider (pm-75k9). Builds a\n * BM25 index over each document's resolved search corpus (honoring\n * `search.corpus_fields`), scores the query, and shapes hits for the requested\n * mode: semantic mode returns pure BM25-ranked hits tagged\n * `matched_fields: [\"bm25\"]`, while hybrid mode blends the BM25 scores with the\n * locally computed keyword scores via {@link combineHybridHits}. The exact\n * full-ID / short-ID guarantee is preserved in both modes via\n * {@link forceExactIdHitsToTop}. No network, embedding service, or vector store\n * is involved, so this path cannot fail on a backend error.\n */\nfunction computeBuiltInBm25Hits(params: {\n  requestedMode: Exclude<SearchMode, \"keyword\">;\n  query: string;\n  filteredDocuments: ItemDocument[];\n  keywordHits: SearchHit[];\n  corpusFields: string[];\n  bm25Params: Bm25Params;\n  hybridSemanticWeight: number;\n}): SearchHit[] {\n  const bm25Documents = params.filteredDocuments.map((document) => ({\n    id: document.metadata.id,\n    text: flattenSearchCorpusText(buildSearchCorpus(document, { fields: params.corpusFields })),\n  }));\n  const index = buildBm25Index(bm25Documents);\n  const bm25Scores = scoreBm25Query(index, tokenizeBm25(params.query), params.bm25Params);\n  const filteredById = new Map(params.filteredDocuments.map((document) => [document.metadata.id, document]));\n  if (params.requestedMode === \"semantic\") {\n    const semanticHits: SearchHit[] = [...bm25Scores].map(([id, score]) => ({\n      item: filteredById.get(id)!.metadata,\n      score,\n      matched_fields: [\"bm25\"],\n    }));\n    return forceExactIdHitsToTop(semanticHits, params.keywordHits);\n  }\n  const hybridHits = combineHybridHits(\n    filteredById,\n    bm25Scores,\n    params.keywordHits,\n    params.hybridSemanticWeight,\n    \"bm25\",\n  );\n  return forceExactIdHitsToTop(hybridHits, params.keywordHits);\n}\n\ninterface SemanticQueryContext {\n  requestedMode: Exclude<SearchMode, \"keyword\">;\n  query: string;\n  filteredDocuments: ItemDocument[];\n  keywordHits: SearchHit[];\n  hybridSemanticWeight: number;\n  limit: number | undefined;\n  maxResults: number;\n  provider: EmbeddingProviderConfig;\n  vectorStore: VectorStoreConfig | null;\n  extensionVectorAdapter: ExtensionVectorAdapter | null;\n  queryExpansion: QueryExpansionConfig;\n  queryExpansionExtension: { providerName: string; expand: ExtensionSearchProviderQueryExpansion } | null;\n  rerank: RerankConfig;\n  rerankExtension: { providerName: string; rerank: ExtensionSearchProviderRerank } | null;\n  warnings: string[];\n  settings: PmSettings;\n  embeddingTimeoutMs?: number;\n  vectorQueryTimeoutMs?: number;\n}\n\ninterface SemanticQueryResult {\n  hits: SearchHit[];\n  // Number of documents returned by the vector stage for this query after the\n  // current metadata filters. When this is 0 the semantic/hybrid query ran\n  // successfully, but vector ranking contributed nothing to the returned hits.\n  vectorMatchCount: number;\n}\n\nfunction mergeVectorHitsById(vectorHitGroups: VectorQueryHit[][]): VectorQueryHit[] {\n  const bestById = new Map<string, VectorQueryHit>();\n  for (const group of vectorHitGroups) {\n    for (const hit of group) {\n      const existing = bestById.get(hit.id);\n      if (!existing || hit.score > existing.score) {\n        bestById.set(hit.id, hit);\n      }\n    }\n  }\n  const merged = [...bestById.values()];\n  merged.sort((left, right) => {\n    if (left.score !== right.score) {\n      return right.score - left.score;\n    }\n    return left.id.localeCompare(right.id);\n  });\n  return merged;\n}\n\n/* c8 ignore start -- rerank corpus metadata-shape permutations are covered by semantic integration tests */\nfunction buildRerankCorpus(document: ItemDocument): string {\n  const metadata = (document as { metadata?: ItemDocument[\"metadata\"] | null }).metadata;\n  const tags = Array.isArray(metadata?.tags) ? metadata.tags.join(\" \") : \"\";\n  return [\n    metadata?.title,\n    metadata?.description,\n    metadata?.type,\n    metadata?.status,\n    tags,\n    document.body,\n  ]\n    .map((entry) => (typeof entry === \"string\" ? entry.trim() : \"\"))\n    .filter((entry) => entry.length > 0)\n    .join(\"\\n\");\n}\n/* c8 ignore stop */\n\n/* c8 ignore start -- semantic expansion/rerank fallback matrices are covered by end-to-end semantic search tests */\nasync function resolveExpandedSemanticQueries(context: SemanticQueryContext, queryTrimmed: string): Promise<string[]> {\n  const baseExpandedQueries = context.queryExpansion.enabled\n    ? buildDeterministicQueryExpansions(queryTrimmed, context.queryExpansion.max_queries)\n    : [queryTrimmed];\n  const expandedQueries = baseExpandedQueries.length > 0 ? baseExpandedQueries : [queryTrimmed];\n  if (!context.queryExpansion.enabled) {\n    return expandedQueries;\n  }\n  if (context.queryExpansionExtension?.expand) {\n    try {\n      const rawExpansion = await Promise.resolve(\n        context.queryExpansionExtension.expand({\n          query: queryTrimmed,\n          mode: context.requestedMode,\n          settings: context.settings,\n        }),\n      );\n      return mergeQueryExpansions(\n        expandedQueries,\n        normalizeQueryExpansionOutput(rawExpansion),\n        context.queryExpansion.max_queries,\n      );\n    } catch {\n      context.warnings.push(\n        `search_query_expansion_provider_failed:${context.queryExpansionExtension.providerName}:using_builtin`,\n      );\n      return expandedQueries;\n    }\n  }\n  if (\n    context.queryExpansion.provider &&\n    context.queryExpansion.provider !== \"openai\" &&\n    context.queryExpansion.provider !== \"ollama\"\n  ) {\n    context.warnings.push(`search_query_expansion_provider_unavailable:${context.queryExpansion.provider}:using_builtin`);\n  }\n  return expandedQueries;\n}\n\nasync function executeSemanticVectorQuery(\n  context: SemanticQueryContext,\n  semanticVector: number[],\n  semanticLimit: number,\n  vectorQueryOptions: { timeout_ms?: number },\n): Promise<VectorQueryHit[]> {\n  if (context.extensionVectorAdapter?.query) {\n    try {\n      return await Promise.resolve(\n        context.extensionVectorAdapter.query({\n          vector: semanticVector,\n          limit: semanticLimit,\n          settings: context.settings,\n        }),\n      );\n    } catch (error: unknown) {\n      if (!context.vectorStore) {\n        throw new PmCliError(\n          `Extension vector adapter query failed and no built-in fallback store is configured (${error instanceof Error ? error.message : String(error)})`,\n          EXIT_CODE.GENERIC_FAILURE,\n        );\n      }\n      context.warnings.push(`search_vector_adapter_failed:${context.extensionVectorAdapter.adapterName}:using_builtin`);\n      return await executeVectorQuery(context.vectorStore, semanticVector, semanticLimit, vectorQueryOptions);\n    }\n  }\n  if (context.vectorStore) {\n    return await executeVectorQuery(context.vectorStore, semanticVector, semanticLimit, vectorQueryOptions);\n  }\n  throw new PmCliError(\n    \"Semantic search requires either a configured vector store or an extension vector adapter query handler\",\n    EXIT_CODE.USAGE,\n  );\n}\n\nfunction buildRerankCandidateContexts(\n  hybridHits: SearchHit[],\n  filteredById: Map<string, ItemDocument>,\n  topK: number,\n): Array<{ hit: SearchHit; text: string }> {\n  const sortedForCandidates = [...hybridHits].sort((left, right) => {\n    if (left.score !== right.score) {\n      return right.score - left.score;\n    }\n    return left.item.id.localeCompare(right.item.id);\n  });\n  return sortedForCandidates\n    .slice(0, topK)\n    .map((hit) => {\n      const document = filteredById.get(hit.item.id);\n      return document ? { hit, text: buildRerankCorpus(document) } : null;\n    })\n    .filter((entry): entry is { hit: SearchHit; text: string } => entry !== null);\n}\n\nasync function resolveExtensionRerankScores(\n  context: SemanticQueryContext,\n  queryTrimmed: string,\n  candidateContexts: Array<{ hit: SearchHit; text: string }>,\n): Promise<Map<string, number> | null> {\n  if (!context.rerankExtension?.rerank) {\n    return null;\n  }\n  try {\n    const rawRerank = await Promise.resolve(\n      context.rerankExtension.rerank({\n        query: queryTrimmed,\n        mode: \"hybrid\",\n        model: context.rerank.model,\n        top_k: context.rerank.top_k,\n        settings: context.settings,\n        candidates: candidateContexts.map((entry) => ({\n          id: entry.hit.item.id,\n          text: entry.text,\n          score: entry.hit.score,\n        })),\n      }),\n    );\n    const normalizedRerank = normalizeRerankOutput(rawRerank);\n    if (normalizedRerank.length > 0) {\n      return new Map(normalizedRerank.map((entry) => [entry.id, entry.score]));\n    }\n    context.warnings.push(\n      `search_rerank_provider_invalid_response:${context.rerankExtension.providerName}:using_builtin`,\n    );\n    return null;\n  } catch {\n    context.warnings.push(`search_rerank_provider_failed:${context.rerankExtension.providerName}:using_builtin`);\n    return null;\n  }\n}\n\nasync function resolveRerankScores(\n  context: SemanticQueryContext,\n  queryTrimmed: string,\n  candidateContexts: Array<{ hit: SearchHit; text: string }>,\n): Promise<Map<string, number> | null> {\n  const extensionScores = await resolveExtensionRerankScores(context, queryTrimmed, candidateContexts);\n  if (extensionScores) {\n    return extensionScores;\n  }\n  const rerankCandidates: RerankCandidate[] = candidateContexts.map((entry) => ({\n    id: entry.hit.item.id,\n    text: entry.text,\n  }));\n  try {\n    return await rerankCandidatesWithEmbeddings(\n      context.provider,\n      context.rerank.model,\n      queryTrimmed,\n      rerankCandidates,\n      context.embeddingTimeoutMs,\n    );\n  } catch {\n    context.warnings.push(\"search_rerank_failed:using_hybrid_scores\");\n    return null;\n  }\n}\n\nfunction applyRerankScores(hybridHits: SearchHit[], rerankScores: Map<string, number>): SearchHit[] {\n  const rerankedIds = new Set(rerankScores.keys());\n  const rerankedHits = hybridHits.map((hit) => {\n    const rerankScore = rerankScores.get(hit.item.id);\n    if (rerankScore === undefined) {\n      return hit;\n    }\n    const matchedFields = new Set(hit.matched_fields);\n    matchedFields.add(\"rerank\");\n    return {\n      ...hit,\n      score: rerankScore,\n      matched_fields: [...matchedFields].sort((left, right) => left.localeCompare(right)),\n    };\n  });\n  rerankedHits.sort((left, right) => {\n    const leftWasReranked = rerankedIds.has(left.item.id);\n    const rightWasReranked = rerankedIds.has(right.item.id);\n    if (leftWasReranked !== rightWasReranked) {\n      return leftWasReranked ? -1 : 1;\n    }\n    if (left.score !== right.score) {\n      return right.score - left.score;\n    }\n    return left.item.id.localeCompare(right.item.id);\n  });\n  return rerankedHits;\n}\n\nasync function applyHybridRerank(\n  context: SemanticQueryContext,\n  queryTrimmed: string,\n  hybridHits: SearchHit[],\n  filteredById: Map<string, ItemDocument>,\n): Promise<SearchHit[]> {\n  if (!context.rerank.enabled || hybridHits.length <= 1) {\n    return hybridHits;\n  }\n  const candidateContexts = buildRerankCandidateContexts(hybridHits, filteredById, context.rerank.top_k);\n  const rerankScores = await resolveRerankScores(context, queryTrimmed, candidateContexts);\n  return rerankScores && rerankScores.size > 0 ? applyRerankScores(hybridHits, rerankScores) : hybridHits;\n}\n\nasync function computeSemanticOrHybridHits(context: SemanticQueryContext): Promise<SemanticQueryResult> {\n  const semanticLimit = Math.max(context.limit ?? context.maxResults, context.maxResults);\n  const embeddingOptions = context.embeddingTimeoutMs !== undefined ? { timeout_ms: context.embeddingTimeoutMs } : {};\n  const vectorQueryOptions = context.vectorQueryTimeoutMs !== undefined ? { timeout_ms: context.vectorQueryTimeoutMs } : {};\n  const queryTrimmed = context.query.trim();\n  const expandedQueries = await resolveExpandedSemanticQueries(context, queryTrimmed);\n  const queryVectors = await executeEmbeddingRequest(context.provider, expandedQueries, embeddingOptions);\n  const queryVectorGroups = await Promise.all(\n    queryVectors.map(async (semanticVector) =>\n      await executeSemanticVectorQuery(context, semanticVector, semanticLimit, vectorQueryOptions)),\n  );\n  const vectorHits = mergeVectorHitsById(queryVectorGroups);\n  const filteredById = new Map(context.filteredDocuments.map((document) => [document.metadata.id, document]));\n  const { semanticHits, semanticScores } = buildSemanticHits(vectorHits, filteredById);\n  const vectorMatchCount = semanticScores.size;\n  if (context.requestedMode === \"semantic\") {\n    // GH-281: guarantee an exact full-ID / short-ID match ranks #1 even in pure\n    // semantic mode, where it otherwise carries no vector hit at all.\n    return { hits: forceExactIdHitsToTop(semanticHits, context.keywordHits), vectorMatchCount };\n  }\n  const hybridHits = await applyHybridRerank(\n    context,\n    queryTrimmed,\n    combineHybridHits(filteredById, semanticScores, context.keywordHits, context.hybridSemanticWeight),\n    filteredById,\n  );\n  return {\n    // GH-281: applied LAST (after any rerank reordering) so an exact full-ID /\n    // short-ID keyword match always ranks #1 in hybrid mode regardless of the\n    // semantic blend weight or rerank scores.\n    hits: forceExactIdHitsToTop(hybridHits, context.keywordHits),\n    vectorMatchCount,\n  };\n}\n/* c8 ignore stop */\n\n/* c8 ignore start -- item body fallback read-path combinations are covered by document-cache integration tests */\nasync function loadDocuments(\n  pmRoot: string,\n  itemFormat: ItemFormat,\n  typeToFolder: Record<string, string>,\n  schema: PmSettings[\"schema\"],\n): Promise<{ documents: ItemDocument[]; warnings: string[] }> {\n  const extensionFieldNames = collectRegisteredItemFieldNames(getActiveExtensionRegistrations());\n  const readDocumentBody = async (\n    metadata: ItemFrontMatter,\n    preferredPath: string,\n    preferredFormat: ItemFormat,\n  ): Promise<string> => {\n    const tryRead = async (targetPath: string, format: ItemFormat): Promise<string> => {\n      await runActiveOnReadHooks({ path: targetPath, scope: \"project\" });\n      const raw = await fs.readFile(targetPath, \"utf8\");\n      const parsed = parseItemDocument(raw, {\n        format,\n        schema,\n        extensionFieldNames,\n        onWarning: (warning) => listWarnings.push(warning),\n      });\n      return parsed.body;\n    };\n\n    try {\n      return await tryRead(preferredPath, preferredFormat);\n    } catch {\n      const alternateFormat: ItemFormat = preferredFormat === \"toon\" ? \"json_markdown\" : \"toon\";\n      const alternatePath = getItemPath(pmRoot, metadata.type as ItemType, metadata.id, alternateFormat, typeToFolder);\n      try {\n        return await tryRead(alternatePath, alternateFormat);\n      } catch {\n        listWarnings.push(`item_list_item_read_failed:${path.relative(pmRoot, alternatePath)}`);\n        return \"\";\n      }\n    }\n  };\n\n  const listWarnings: string[] = [];\n  const cachedDocuments = await listAllDocumentCandidatesCached(pmRoot, itemFormat, typeToFolder, listWarnings, schema);\n  const documents: ItemDocument[] = [];\n  if (cachedDocuments.length === 0) {\n    const frontMatterDocuments = await listAllFrontMatter(pmRoot, itemFormat, typeToFolder, listWarnings, schema);\n    for (const metadata of frontMatterDocuments) {\n      const preferredPath = getItemPath(pmRoot, metadata.type as ItemType, metadata.id, itemFormat, typeToFolder);\n      const body = await readDocumentBody(metadata, preferredPath, itemFormat);\n      documents.push({ metadata, body });\n    }\n    return {\n      documents,\n      warnings: [...new Set(listWarnings)].sort((left, right) => left.localeCompare(right)),\n    };\n  }\n\n  for (const cachedDocument of cachedDocuments) {\n    if (typeof cachedDocument.body === \"string\") {\n      documents.push({\n        metadata: cachedDocument.metadata,\n        body: cachedDocument.body,\n      });\n      continue;\n    }\n    const body = await readDocumentBody(cachedDocument.metadata, cachedDocument.item_path, cachedDocument.item_format);\n    documents.push({\n      metadata: cachedDocument.metadata,\n      body,\n    });\n  }\n  return {\n    documents,\n    warnings: [...new Set(listWarnings)].sort((left, right) => left.localeCompare(right)),\n  };\n}\n/* c8 ignore stop */\n\n/* c8 ignore start -- field projection lookup precedence is validated by output-shaping integration tests */\nfunction readSearchFieldValue(hit: SearchHit, field: string): unknown {\n  const normalized = field.trim();\n  if (normalized.length === 0) {\n    return null;\n  }\n  if (normalized === \"score\") {\n    return hit.score;\n  }\n  if (normalized === \"matched_fields\") {\n    return hit.matched_fields;\n  }\n  if (normalized.startsWith(\"item.\")) {\n    const itemKey = normalized.slice(\"item.\".length);\n    if (itemKey.length === 0) {\n      return null;\n    }\n    const itemRecord = toItemRecord(hit.item);\n    return itemRecord[itemKey] ?? null;\n  }\n  const hitRecord = hit as unknown as Record<string, unknown>;\n  const itemRecord = toItemRecord(hit.item);\n  if (Object.prototype.hasOwnProperty.call(itemRecord, normalized)) {\n    return itemRecord[normalized] ?? null;\n  }\n  if (Object.prototype.hasOwnProperty.call(hitRecord, normalized)) {\n    return hitRecord[normalized] ?? null;\n  }\n  return null;\n}\n/* c8 ignore stop */\n\nfunction projectSearchHits(hits: SearchHit[], projection: SearchProjectionConfig): SearchResultItem[] {\n  if (projection.mode === \"full\") {\n    // matched_all_terms is an internal ranking signal (GH-181); strip it from\n    // full-mode output rows so the public hit shape stays { item, score, matched_fields }.\n    return hits.map(({ matched_all_terms: _matchedAllTerms, ...hit }) => hit);\n  }\n  return hits.map((hit) => {\n    const projected: Record<string, unknown> = {};\n    for (const field of projection.fields) {\n      projected[field] = readSearchFieldValue(hit, field);\n    }\n    return projected;\n  });\n}\n\ninterface PreparedSearchInput {\n  query: string;\n  options: SearchOptions;\n  inlineWarnings: string[];\n  highlight: boolean;\n  includeLinked: boolean;\n  titleExact: boolean;\n  phraseExact: boolean;\n  matchMode: SearchMatchMode;\n  minScoreOverride: number | undefined;\n  countOnly: boolean;\n  tokens: string[];\n  normalizedQuery: string;\n  limit: number | undefined;\n  projection: SearchProjectionConfig;\n  modeWasExplicit: boolean;\n}\n\ninterface SearchRuntimeContext {\n  pmRoot: string;\n  settings: PmSettings;\n  statusRegistry: RuntimeStatusRegistry;\n  runtimeFieldRegistry: RuntimeFieldRegistry;\n  runtimeFieldFilters: Record<string, unknown>;\n  typeRegistry: ItemTypeRegistry;\n  maxResults: number;\n  scoreThreshold: number;\n  semanticWeightProvided: boolean;\n  semanticWeightOverride: number | undefined;\n  hybridSemanticWeight: number;\n  tuning: SearchTuning;\n  providerResolution: EmbeddingProviderResolution;\n  vectorResolution: VectorStoreResolution;\n  extensionSearchProvider: ReturnType<typeof resolveExtensionSearchProvider>;\n  extensionVectorAdapter: ReturnType<typeof resolveExtensionVectorAdapter>;\n  bm25Mode: BuiltInBm25Mode | null;\n  queryExpansion: QueryExpansionConfig;\n  queryExpansionExtension: { providerName: string; expand: ExtensionSearchProviderQueryExpansion } | null;\n  rerank: RerankConfig;\n  rerankExtension: { providerName: string; rerank: ExtensionSearchProviderRerank } | null;\n  effectiveMode: SearchMode;\n}\n\ninterface FilteredSearchCorpus {\n  warnings: string[];\n  allDocuments: ItemDocument[];\n  filteredDocuments: ItemDocument[];\n}\n\ninterface SearchResponseContext {\n  query: string;\n  effectiveMode: SearchMode;\n  matchMode: SearchMatchMode;\n  options: SearchOptions;\n  includeLinked: boolean;\n  titleExact: boolean;\n  phraseExact: boolean;\n  scoreThreshold: number;\n  hybridSemanticWeight: number;\n  queryExpansion: QueryExpansionConfig;\n  rerank: RerankConfig;\n  projection: SearchProjectionConfig;\n  warnings: string[];\n  runtimeFieldFilters: Record<string, unknown>;\n}\n\ninterface SearchModeExecutionInput {\n  prepared: PreparedSearchInput;\n  runtime: SearchRuntimeContext;\n  filteredDocuments: ItemDocument[];\n  keywordHits: SearchHit[];\n  warnings: string[];\n  modeWasExplicit: boolean;\n}\n\ninterface SearchModeExecutionResult {\n  effectiveMode: SearchMode;\n  hits: SearchHit[];\n}\n\nfunction resolveQueryExpansionExtension(\n  queryExpansion: QueryExpansionConfig,\n): { providerName: string; expand: ExtensionSearchProviderQueryExpansion } | null {\n  const provider = resolveExtensionSearchProviderByName(queryExpansion.provider ?? undefined);\n  return provider?.queryExpansion ? { providerName: provider.providerName, expand: provider.queryExpansion } : null;\n}\n\nfunction resolveRerankExtension(settings: PmSettings): { providerName: string; rerank: ExtensionSearchProviderRerank } | null {\n  const provider = resolveExtensionSearchProviderByName(toOptionalNonEmptyString(settings.search?.provider));\n  return provider?.rerank ? { providerName: provider.providerName, rerank: provider.rerank } : null;\n}\n\nfunction prepareSearchInput(rawQuery: string, rawOptions: SearchOptions): PreparedSearchInput {\n  const inlineWarnings: string[] = [];\n  const inlineParse = parseInlineQueryFilters(rawQuery);\n  const hasInlineFilters = Object.keys(inlineParse.inlineFilters).length > 0;\n  if (hasInlineFilters && inlineParse.residualQuery.trim().length === 0) {\n    throw new PmCliError(\n      \"Inline field:value tokens consumed the entire query, leaving no search terms.\",\n      EXIT_CODE.USAGE,\n      {\n        examples: [\"pm search auth tag:area:search\", \"pm list --tag area:search --status open\"],\n        nextSteps: [\n          \"Add keyword terms alongside the inline filters, or use pm list for pure tag/status/type/priority filtering.\",\n        ],\n      },\n    );\n  }\n  const query = hasInlineFilters ? inlineParse.residualQuery : rawQuery;\n  const options = applyInlineQueryFilters(rawOptions, inlineParse.inlineFilters, inlineWarnings);\n  return {\n    query,\n    options,\n    inlineWarnings,\n    highlight: options.highlight === true,\n    includeLinked: parseIncludeLinked(options.includeLinked),\n    titleExact: parseTitleExact(options.titleExact),\n    phraseExact: parsePhraseExact(options.phraseExact),\n    matchMode: parseMatchMode(typeof options.matchMode === \"string\" ? options.matchMode : undefined),\n    minScoreOverride: parseMinScoreOverride(options.minScore),\n    countOnly: options.count === true,\n    tokens: parseTokens(query),\n    normalizedQuery: normalizeSearchPhrase(query),\n    limit: parseLimit(options.limit),\n    projection: parseProjectionConfig(options),\n    modeWasExplicit: typeof options.mode === \"string\" && options.mode.trim().length > 0,\n  };\n}\n\nasync function resolveSearchRuntimeContext(\n  prepared: PreparedSearchInput,\n  global: GlobalOptions,\n): Promise<SearchRuntimeContext> {\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 storedSettings = await readSettings(pmRoot);\n  const settings = resolveSettingsWithSemanticRuntimeDefaults(storedSettings).settings;\n  const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);\n  const runtimeFieldRegistry = resolveRuntimeFieldRegistry(settings.schema);\n  validateSearchProjectionFields(prepared.projection, runtimeFieldRegistry);\n  const runtimeFieldFilters = collectRuntimeFilterValues(\n    prepared.options as Record<string, unknown>,\n    runtimeFieldRegistry,\n    \"search\",\n  );\n  const typeRegistry = resolveItemTypeRegistry(settings, getActiveExtensionRegistrations());\n  const providerResolution = resolveEmbeddingProviders(settings);\n  const vectorResolution = resolveVectorStores(settings, pmRoot);\n  const extensionSearchProvider = resolveExtensionSearchProvider(settings);\n  const extensionVectorAdapter = resolveExtensionVectorAdapter(settings);\n  const semanticWeightOverride = parseSemanticWeightOverride(prepared.options.semanticWeight);\n  const queryExpansion = resolveQueryExpansionConfig(settings, providerResolution.active?.name ?? null);\n  const rerank = resolveRerankConfig(\n    settings,\n    providerResolution.active?.model ?? toOptionalNonEmptyString(settings.search?.embedding_model) ?? \"text-embedding-3-small\",\n  );\n  return {\n    pmRoot,\n    settings,\n    statusRegistry,\n    runtimeFieldRegistry,\n    runtimeFieldFilters,\n    typeRegistry,\n    maxResults: resolveSearchMaxResults(settings),\n    scoreThreshold: prepared.minScoreOverride ?? resolveSearchScoreThreshold(settings),\n    semanticWeightProvided: prepared.options.semanticWeight !== undefined,\n    semanticWeightOverride,\n    hybridSemanticWeight: semanticWeightOverride ?? resolveHybridSemanticWeight(settings),\n    tuning: resolveSearchTuning(settings),\n    providerResolution,\n    vectorResolution,\n    extensionSearchProvider,\n    extensionVectorAdapter,\n    bm25Mode: resolveBuiltInBm25Mode({\n      configuredProvider: toOptionalNonEmptyString(settings.search?.provider),\n      hasEmbeddingProvider: providerResolution.active !== null,\n      hasExtensionSearchProvider: extensionSearchProvider !== null,\n    }),\n    queryExpansion,\n    queryExpansionExtension: resolveQueryExpansionExtension(queryExpansion),\n    rerank,\n    rerankExtension: resolveRerankExtension(settings),\n    effectiveMode: parseMode(prepared.options.mode, {\n      hasProvider: providerResolution.active !== null || extensionSearchProvider !== null,\n      hasVectorStore: vectorResolution.active !== null || extensionVectorAdapter !== null,\n    }),\n  };\n}\n\nasync function loadFilteredSearchCorpus(\n  prepared: PreparedSearchInput,\n  runtime: SearchRuntimeContext,\n): Promise<FilteredSearchCorpus> {\n  const loadedDocuments = await loadDocuments(\n    runtime.pmRoot,\n    runtime.settings.item_format ?? \"toon\",\n    runtime.typeRegistry.type_to_folder,\n    runtime.settings.schema,\n  );\n  const statusFilter = parseStatusFilterCsv(\n    typeof prepared.options.status === \"string\" ? prepared.options.status : undefined,\n    runtime.statusRegistry,\n    { strict: true },\n  );\n  const lifecycleClassifier = lifecycleClassifierFromStatusRegistry(runtime.statusRegistry);\n  const metadataFilteredDocuments = applyFilters(\n    loadedDocuments.documents,\n    prepared.options,\n    runtime.typeRegistry,\n    runtime.runtimeFieldFilters,\n    statusFilter,\n    lifecycleClassifier,\n  );\n  return {\n    warnings: loadedDocuments.warnings,\n    allDocuments: loadedDocuments.documents,\n    filteredDocuments: applyExactQueryFilters(metadataFilteredDocuments, prepared.normalizedQuery, {\n      titleExact: prepared.titleExact,\n      phraseExact: prepared.phraseExact || prepared.matchMode === \"exact\",\n    }),\n  };\n}\n\nasync function collectLinkedCorpusById(\n  includeLinked: boolean,\n  effectiveMode: SearchMode,\n  filteredDocuments: ItemDocument[],\n): Promise<Map<string, string>> {\n  const linkedCorpusById = new Map<string, string>();\n  if (!includeLinked || (effectiveMode !== \"keyword\" && effectiveMode !== \"hybrid\")) {\n    return linkedCorpusById;\n  }\n  const projectRoot = process.cwd();\n  const linkedCorpusRoots = await resolveLinkedCorpusRoots(projectRoot, resolveGlobalPmRoot(projectRoot));\n  const linkedCorpusEntries = await Promise.all(\n    filteredDocuments.map(async (document) => [document.metadata.id, await loadLinkedCorpus(document, linkedCorpusRoots)] as const),\n  );\n  for (const [id, corpus] of linkedCorpusEntries) {\n    linkedCorpusById.set(id, corpus);\n  }\n  return linkedCorpusById;\n}\n\nasync function computeKeywordSearchHits(\n  prepared: PreparedSearchInput,\n  runtime: SearchRuntimeContext,\n  filteredDocuments: ItemDocument[],\n): Promise<SearchHit[]> {\n  const linkedCorpusById = await collectLinkedCorpusById(prepared.includeLinked, runtime.effectiveMode, filteredDocuments);\n  const applyCoverageBonus = prepared.matchMode === \"or\";\n  return filteredDocuments\n    .map((document) =>\n      buildHybridLexicalScore(\n        document,\n        prepared.tokens,\n        prepared.normalizedQuery,\n        prepared.includeLinked,\n        linkedCorpusById,\n        runtime.tuning,\n        runtime.settings.id_prefix,\n        applyCoverageBonus,\n      ),\n    )\n    .filter((entry): entry is SearchHit => entry !== null)\n    .filter((entry) => prepared.matchMode !== \"and\" || entry.matched_all_terms === true);\n}\n\nfunction buildEmptySearchResultFromContext(\n  response: SearchResponseContext,\n  countOnly: boolean,\n): SearchResult {\n  return emptySearchResult(\n    response.query,\n    response.effectiveMode,\n    response.matchMode,\n    response.options,\n    response.includeLinked,\n    response.scoreThreshold,\n    response.hybridSemanticWeight,\n    response.queryExpansion,\n    response.rerank,\n    response.projection,\n    response.warnings,\n    response.runtimeFieldFilters,\n    countOnly,\n  );\n}\n\nasync function executeBuiltInBm25Search(\n  prepared: PreparedSearchInput,\n  runtime: SearchRuntimeContext,\n  filteredDocuments: ItemDocument[],\n  keywordHits: SearchHit[],\n  warnings: string[],\n): Promise<SearchHit[] | null> {\n  if (runtime.bm25Mode === null || runtime.effectiveMode === \"keyword\") {\n    return null;\n  }\n  const hits = computeBuiltInBm25Hits({\n    requestedMode: runtime.effectiveMode,\n    query: prepared.query,\n    filteredDocuments,\n    keywordHits,\n    corpusFields: resolveSearchCorpusFields(runtime.settings),\n    bm25Params: resolveBm25Params(runtime.settings),\n    hybridSemanticWeight: runtime.hybridSemanticWeight,\n  });\n  if (runtime.bm25Mode === \"auto-fallback\") {\n    warnings.push(`search_${runtime.effectiveMode}_offline_bm25:no_embedding_provider:using_lexical_bm25`);\n  }\n  return hits;\n}\n\nasync function executeExtensionSearchProvider(\n  prepared: PreparedSearchInput,\n  runtime: SearchRuntimeContext,\n  filteredDocuments: ItemDocument[],\n  filteredById: Map<string, ItemDocument>,\n): Promise<SearchHit[] | null> {\n  if (!runtime.extensionSearchProvider) {\n    return null;\n  }\n  const canUseBuiltInSemantic =\n    runtime.providerResolution.active !== null &&\n    (runtime.vectorResolution.active !== null || runtime.extensionVectorAdapter !== null);\n  try {\n    const providerResponse = await Promise.resolve(\n      runtime.extensionSearchProvider.query({\n        query: prepared.query,\n        mode: runtime.effectiveMode,\n        tokens: prepared.tokens,\n        options: prepared.options,\n        settings: runtime.settings,\n        documents: filteredDocuments,\n      }),\n    );\n    return normalizeExtensionProviderHits(runtime.extensionSearchProvider.providerName, providerResponse, filteredById);\n  } catch (error: unknown) {\n    if (!canUseBuiltInSemantic) {\n      throw new PmCliError(\n        `Extension search provider \"${runtime.extensionSearchProvider.providerName}\" failed: ${error instanceof Error ? error.message : String(error)}`,\n        EXIT_CODE.GENERIC_FAILURE,\n      );\n    }\n    return null;\n  }\n}\n\nfunction maybeApplyNoVectorFallback(\n  effectiveMode: Exclude<SearchMode, \"keyword\">,\n  semanticResult: Awaited<ReturnType<typeof computeSemanticOrHybridHits>>,\n  keywordHits: SearchHit[],\n  warnings: string[],\n): SearchHit[] {\n  if (semanticResult.vectorMatchCount > 0) {\n    return semanticResult.hits;\n  }\n  warnings.push(`search_${effectiveMode}_degraded:no_vector_matches:results_are_lexical`);\n  return effectiveMode === \"semantic\" ? keywordHits : semanticResult.hits;\n}\n\nasync function prepareBuiltInSemanticSearch(\n  runtime: SearchRuntimeContext,\n  effectiveMode: Exclude<SearchMode, \"keyword\">,\n  filteredDocuments: ItemDocument[],\n  warnings: string[],\n  modeWasExplicit: boolean,\n): Promise<void> {\n  const builtInSemanticWillRun =\n    !runtime.extensionSearchProvider &&\n    runtime.providerResolution.active !== null &&\n    (runtime.vectorResolution.active !== null || runtime.extensionVectorAdapter !== null);\n  if (modeWasExplicit && builtInSemanticWillRun) {\n    await maybeEmitVectorIndexStaleWarning(runtime.pmRoot, filteredDocuments, warnings);\n  }\n  if (!runtime.extensionSearchProvider) {\n    requireSemanticDependencies(\n      effectiveMode,\n      runtime.providerResolution,\n      runtime.vectorResolution,\n      runtime.extensionVectorAdapter !== null,\n    );\n  }\n}\n\nasync function executeSemanticSearch(input: SearchModeExecutionInput): Promise<SearchModeExecutionResult> {\n  const { prepared, runtime, filteredDocuments, keywordHits, warnings, modeWasExplicit } = input;\n  let hits = keywordHits;\n  const bm25Hits = await executeBuiltInBm25Search(prepared, runtime, filteredDocuments, keywordHits, warnings);\n  const semanticMode = runtime.effectiveMode;\n  if (bm25Hits !== null || semanticMode === \"keyword\") {\n    return { effectiveMode: runtime.effectiveMode, hits: bm25Hits ?? hits };\n  }\n  try {\n    await prepareBuiltInSemanticSearch(runtime, semanticMode, filteredDocuments, warnings, modeWasExplicit);\n    if (filteredDocuments.length === 0 || prepared.limit === 0) {\n      return { effectiveMode: runtime.effectiveMode, hits: [] };\n    }\n    const filteredById = new Map(filteredDocuments.map((document) => [document.metadata.id, document]));\n    hits = await executeExtensionSearchProvider(prepared, runtime, filteredDocuments, filteredById) ?? hits;\n    if (hits === keywordHits) {\n      const { provider, vectorStore } = requireSemanticDependencies(\n        semanticMode,\n        runtime.providerResolution,\n        runtime.vectorResolution,\n        runtime.extensionVectorAdapter !== null,\n      );\n      const semanticResult = await computeSemanticOrHybridHits({\n        requestedMode: semanticMode,\n        query: prepared.query,\n        filteredDocuments,\n        keywordHits,\n        hybridSemanticWeight: runtime.hybridSemanticWeight,\n        limit: prepared.limit,\n        maxResults: runtime.maxResults,\n        provider,\n        vectorStore,\n        extensionVectorAdapter: runtime.extensionVectorAdapter,\n        queryExpansion: runtime.queryExpansion,\n        queryExpansionExtension: runtime.queryExpansionExtension,\n        rerank: runtime.rerank,\n        rerankExtension: runtime.rerankExtension,\n        warnings,\n        settings: runtime.settings,\n      });\n      hits = maybeApplyNoVectorFallback(semanticMode, semanticResult, keywordHits, warnings);\n    }\n    return { effectiveMode: runtime.effectiveMode, hits };\n  } catch (error: unknown) {\n    warnings.push(buildExplicitSemanticFallbackWarning(runtime.effectiveMode, error));\n    return { effectiveMode: \"keyword\", hits: keywordHits };\n  }\n}\n\nfunction buildCountOnlySearchResult(response: SearchResponseContext, total: number): SearchResult {\n  if (response.projection.mode === \"compact\" && response.options.compact === true) {\n    return withSearchWarnings({\n      query: response.query.trim(),\n      mode: response.effectiveMode,\n      items: [],\n      count: total,\n      total,\n      count_only: true,\n      filters: buildCompactSearchFilterSummary({\n        mode: response.effectiveMode,\n        matchMode: response.matchMode,\n        options: response.options,\n        includeLinked: response.includeLinked,\n        titleExact: response.titleExact,\n        phraseExact: response.phraseExact,\n        scoreThreshold: response.scoreThreshold,\n        hybridSemanticWeight: response.hybridSemanticWeight,\n        runtimeFieldFilters: response.runtimeFieldFilters,\n      }),\n    }, response.warnings);\n  }\n  const projectionFields = response.projection.mode === \"full\" ? null : [...response.projection.fields];\n  return withSearchWarnings({\n    query: response.query.trim(),\n    mode: response.effectiveMode,\n    items: [],\n    count: total,\n    total,\n    count_only: true,\n    filters: buildVerboseSearchFilters({\n      effectiveMode: response.effectiveMode,\n      matchMode: response.matchMode,\n      options: response.options,\n      includeLinked: response.includeLinked,\n      titleExact: response.titleExact,\n      phraseExact: response.phraseExact,\n      scoreThreshold: response.scoreThreshold,\n      hybridSemanticWeight: response.hybridSemanticWeight,\n      queryExpansion: response.queryExpansion,\n      rerank: response.rerank,\n      runtimeFieldFilters: response.runtimeFieldFilters,\n    }),\n    projection: {\n      mode: response.projection.mode,\n      fields: projectionFields,\n    },\n    now: nowIso(),\n  }, response.warnings);\n}\n\nfunction withSearchWarnings(result: SearchResult, warnings: string[]): SearchResult {\n  if (warnings.length === 0) {\n    return result;\n  }\n  return { ...result, warnings };\n}\n\nfunction attachSearchHighlights(\n  prepared: PreparedSearchInput,\n  filteredDocuments: ItemDocument[],\n  limited: SearchHit[],\n): { hits: SearchHit[]; projection: SearchProjectionConfig } {\n  if (!prepared.highlight) {\n    return { hits: limited, projection: prepared.projection };\n  }\n  const documentById = new Map(filteredDocuments.map((document) => [document.metadata.id, document]));\n  const hits = limited.map((hit) => ({\n    ...hit,\n    highlights: buildHitHighlights(documentById.get(hit.item.id)!, hit.matched_fields, prepared.tokens),\n  }));\n  if (prepared.projection.mode === \"full\" || prepared.projection.fields.includes(\"highlights\")) {\n    return { hits, projection: prepared.projection };\n  }\n  return { hits, projection: { mode: prepared.projection.mode, fields: [...prepared.projection.fields, \"highlights\"] } };\n}\n\nfunction buildSearchResultForHits(\n  response: SearchResponseContext,\n  projectedItems: SearchResultItem[],\n  total: number,\n  limitedCount: number,\n  effectiveProjection: SearchProjectionConfig,\n): SearchResult {\n  const truncationExtras = limitedCount < total ? { total } : {};\n  if (response.projection.mode === \"compact\" && response.options.compact === true) {\n    return withSearchWarnings({\n      query: response.query.trim(),\n      mode: response.effectiveMode,\n      items: projectedItems,\n      count: projectedItems.length,\n      ...truncationExtras,\n      filters: buildCompactSearchFilterSummary({\n        mode: response.effectiveMode,\n        matchMode: response.matchMode,\n        options: response.options,\n        includeLinked: response.includeLinked,\n        titleExact: response.titleExact,\n        phraseExact: response.phraseExact,\n        scoreThreshold: response.scoreThreshold,\n        hybridSemanticWeight: response.hybridSemanticWeight,\n        runtimeFieldFilters: response.runtimeFieldFilters,\n      }),\n    }, response.warnings);\n  }\n  const finalProjectionFields = effectiveProjection.mode === \"full\" ? null : [...effectiveProjection.fields];\n  return {\n    query: response.query.trim(),\n    mode: response.effectiveMode,\n    items: projectedItems,\n    count: projectedItems.length,\n    ...truncationExtras,\n    filters: buildVerboseSearchFilters({\n      effectiveMode: response.effectiveMode,\n      matchMode: response.matchMode,\n      options: response.options,\n      includeLinked: response.includeLinked,\n      titleExact: response.titleExact,\n      phraseExact: response.phraseExact,\n      scoreThreshold: response.scoreThreshold,\n      hybridSemanticWeight: response.hybridSemanticWeight,\n      queryExpansion: response.queryExpansion,\n      rerank: response.rerank,\n      runtimeFieldFilters: response.runtimeFieldFilters,\n    }),\n    projection: {\n      mode: effectiveProjection.mode,\n      fields: finalProjectionFields,\n    },\n    now: nowIso(),\n    ...(response.warnings.length > 0 ? { warnings: response.warnings } : {}),\n  };\n}\n\n/**\n * Implements run search for the public runtime surface of this module.\n */\nexport async function runSearch(rawQuery: string, rawOptions: SearchOptions, global: GlobalOptions): Promise<SearchResult> {\n  const prepared = prepareSearchInput(rawQuery, rawOptions);\n  const runtime = await resolveSearchRuntimeContext(prepared, global);\n  const corpus = await loadFilteredSearchCorpus(prepared, runtime);\n  const warnings = corpus.warnings;\n  warnings.push(...prepared.inlineWarnings);\n  if (runtime.effectiveMode === \"hybrid\" && runtime.semanticWeightProvided && runtime.semanticWeightOverride === undefined) {\n    warnings.push(\"search_hybrid_semantic_weight_override_invalid:using_settings_default\");\n  }\n  const responseBase = {\n    query: prepared.query,\n    matchMode: prepared.matchMode,\n    options: prepared.options,\n    includeLinked: prepared.includeLinked,\n    titleExact: prepared.titleExact,\n    phraseExact: prepared.phraseExact,\n    scoreThreshold: runtime.scoreThreshold,\n    hybridSemanticWeight: runtime.hybridSemanticWeight,\n    queryExpansion: runtime.queryExpansion,\n    rerank: runtime.rerank,\n    projection: prepared.projection,\n    warnings,\n    runtimeFieldFilters: runtime.runtimeFieldFilters,\n  };\n  if (runtime.effectiveMode === \"keyword\" && (corpus.filteredDocuments.length === 0 || prepared.limit === 0)) {\n    return buildEmptySearchResultFromContext(\n      { ...responseBase, effectiveMode: runtime.effectiveMode },\n      prepared.countOnly,\n    );\n  }\n  const keywordHits = await computeKeywordSearchHits(prepared, runtime, corpus.filteredDocuments);\n  const modeResult = await executeSemanticSearch({\n    prepared,\n    runtime,\n    filteredDocuments: corpus.filteredDocuments,\n    keywordHits,\n    warnings,\n    modeWasExplicit: prepared.modeWasExplicit,\n  });\n  if (modeResult.effectiveMode !== \"keyword\" && modeResult.hits.length === 0 && (corpus.filteredDocuments.length === 0 || prepared.limit === 0)) {\n    return buildEmptySearchResultFromContext(\n      { ...responseBase, effectiveMode: modeResult.effectiveMode },\n      prepared.countOnly,\n    );\n  }\n  const thresholded = modeResult.hits.filter((entry) => entry.exact_id_match === true || entry.score >= runtime.scoreThreshold);\n  const sorted = sortHits(thresholded, runtime.statusRegistry);\n  const total = sorted.length;\n  const resolvedLimit = prepared.limit ?? runtime.maxResults;\n  const limited = sorted.slice(0, resolvedLimit);\n  const response = { ...responseBase, effectiveMode: modeResult.effectiveMode };\n  if (prepared.countOnly) {\n    return buildCountOnlySearchResult(response, total);\n  }\n  const { hits: projectedHits, projection: effectiveProjection } = attachSearchHighlights(\n    prepared,\n    corpus.filteredDocuments,\n    limited,\n  );\n  const projectedItems = projectSearchHits(projectedHits, effectiveProjection);\n  return buildSearchResultForHits(response, projectedItems, total, limited.length, effectiveProjection);\n}\n","/**\n * @module core/shared/text-normalization\n *\n * Provides shared primitives and utilities for Text Normalization.\n */\n/**\n * Normalizes text to lowercase whitespace-collapsed form for stable matching and comparison.\n */\nexport function normalizeLowercaseWhitespace(value: string): string {\n  return value\n    .trim()\n    .toLowerCase()\n    .replace(/\\s+/g, \" \");\n}\n\n/**\n * Implements tokenize alpha numeric for the public runtime surface of this module.\n */\nexport function tokenizeAlphaNumeric(value: string): string[] {\n  return normalizeLowercaseWhitespace(value)\n    .split(/[^a-z0-9]+/)\n    .filter((token) => token.length > 0);\n}\n\n/**\n * Implements jaccard similarity for the public runtime surface of this module.\n */\nexport function jaccardSimilarity(leftTokens: string[], rightTokens: string[]): number {\n  if (leftTokens.length === 0 && rightTokens.length === 0) {\n    return 1;\n  }\n  if (leftTokens.length === 0 || rightTokens.length === 0) {\n    return 0;\n  }\n  const leftSet = new Set(leftTokens);\n  const rightSet = new Set(rightTokens);\n  let intersection = 0;\n  for (const token of leftSet) {\n    if (rightSet.has(token)) {\n      intersection += 1;\n    }\n  }\n  // Both token sets are non-empty here (guarded above), so union is always >= 1.\n  const union = new Set([...leftSet, ...rightSet]).size;\n  return intersection / union;\n}\n","/**\n * @module core/search/relevance\n *\n * Powers search, embeddings, and semantic retrieval behavior for Relevance.\n */\nimport type { PmSettings } from \"../../types.js\";\nimport { coercePositiveInteger, toNonEmptyString } from \"../shared/primitives.js\";\nimport { tokenizeAlphaNumeric } from \"../shared/text-normalization.js\";\nimport { executeEmbeddingRequest, type EmbeddingProviderConfig } from \"./providers.js\";\n\nexport const DEFAULT_QUERY_EXPANSION_MAX_QUERIES = 4;\nexport const DEFAULT_RERANK_TOP_K = 20;\nconst MAX_RERANK_TOP_K = 200;\n\nconst QUERY_EXPANSION_STOP_WORDS = new Set([\n  \"a\",\n  \"an\",\n  \"and\",\n  \"for\",\n  \"from\",\n  \"in\",\n  \"into\",\n  \"of\",\n  \"on\",\n  \"or\",\n  \"the\",\n  \"to\",\n  \"with\",\n]);\n\n/**\n * Documents the query expansion config payload exchanged by command, SDK, and package integrations.\n */\nexport interface QueryExpansionConfig {\n  enabled: boolean;\n  provider: string | null;\n  max_queries: number;\n}\n\n/**\n * Documents the rerank config payload exchanged by command, SDK, and package integrations.\n */\nexport interface RerankConfig {\n  enabled: boolean;\n  model: string;\n  top_k: number;\n}\n\n/**\n * Documents the rerank candidate payload exchanged by command, SDK, and package integrations.\n */\nexport interface RerankCandidate {\n  id: string;\n  text: string;\n}\n\n/**\n * Documents the rerank scored hit payload exchanged by command, SDK, and package integrations.\n */\nexport interface RerankScoredHit {\n  id: string;\n  score: number;\n}\n\nfunction dedupeQueries(values: string[], limit: number): string[] {\n  const deduped: string[] = [];\n  const seen = new Set<string>();\n  for (const entry of values) {\n    const normalized = entry.trim().replaceAll(/\\s+/g, \" \");\n    if (normalized.length === 0) {\n      continue;\n    }\n    const dedupeKey = normalized.toLowerCase();\n    if (seen.has(dedupeKey)) {\n      continue;\n    }\n    seen.add(dedupeKey);\n    deduped.push(normalized);\n    if (deduped.length >= limit) {\n      break;\n    }\n  }\n  return deduped;\n}\n\nfunction singularizeSimple(token: string): string {\n  const normalizedToken = token.toLowerCase();\n  if (normalizedToken.length > 4 && normalizedToken.endsWith(\"ies\")) {\n    return `${normalizedToken.slice(0, -3)}y`;\n  }\n  if (\n    normalizedToken.length > 4 &&\n    (normalizedToken.endsWith(\"ches\") ||\n      normalizedToken.endsWith(\"shes\") ||\n      normalizedToken.endsWith(\"xes\") ||\n      normalizedToken.endsWith(\"zes\") ||\n      normalizedToken.endsWith(\"sses\"))\n  ) {\n    return normalizedToken.slice(0, -2);\n  }\n  if (\n    normalizedToken.length > 3 &&\n    normalizedToken.endsWith(\"s\") &&\n    !normalizedToken.endsWith(\"ss\") &&\n    !normalizedToken.endsWith(\"us\") &&\n    !normalizedToken.endsWith(\"is\") &&\n    !normalizedToken.endsWith(\"as\")\n  ) {\n    return normalizedToken.slice(0, -1);\n  }\n  return normalizedToken;\n}\n\nfunction pluralizeSimple(token: string): string {\n  const normalizedToken = token.toLowerCase();\n  if (normalizedToken.length > 2 && (!normalizedToken.endsWith(\"s\") || normalizedToken.endsWith(\"ss\"))) {\n    if (normalizedToken.endsWith(\"y\") && !/[aeiou]y$/u.test(normalizedToken)) {\n      return `${normalizedToken.slice(0, -1)}ies`;\n    }\n    if (\n      normalizedToken.endsWith(\"ch\") ||\n      normalizedToken.endsWith(\"sh\") ||\n      normalizedToken.endsWith(\"x\") ||\n      normalizedToken.endsWith(\"z\") ||\n      normalizedToken.endsWith(\"ss\")\n    ) {\n      return `${normalizedToken}es`;\n    }\n    return `${normalizedToken}s`;\n  }\n  return normalizedToken;\n}\n\n/**\n * Implements build deterministic query expansions for the public runtime surface of this module.\n */\nexport function buildDeterministicQueryExpansions(\n  query: string,\n  maxQueries = DEFAULT_QUERY_EXPANSION_MAX_QUERIES,\n): string[] {\n  const normalizedQuery = query.trim().replaceAll(/\\s+/g, \" \");\n  if (normalizedQuery.length === 0) {\n    return [];\n  }\n  const tokens = tokenizeAlphaNumeric(normalizedQuery);\n  if (tokens.length === 0) {\n    return [normalizedQuery];\n  }\n  const contentTokens = tokens.filter((token) => !QUERY_EXPANSION_STOP_WORDS.has(token.toLowerCase()));\n  const singularized = tokens.map((token) => singularizeSimple(token));\n  const pluralized = contentTokens.map((token) => pluralizeSimple(token));\n  return dedupeQueries(\n    [\n      normalizedQuery,\n      tokens.join(\" \"),\n      contentTokens.join(\" \"),\n      singularized.join(\" \"),\n      pluralized.join(\" \"),\n    ],\n    Math.max(1, maxQueries),\n  );\n}\n\n/**\n * Implements normalize query expansion output for the public runtime surface of this module.\n */\nexport function normalizeQueryExpansionOutput(raw: unknown): string[] {\n  const rawQueries = Array.isArray(raw)\n    ? raw\n    : (raw as { queries?: unknown } | null | undefined)?.queries;\n  if (!Array.isArray(rawQueries)) {\n    return [];\n  }\n  return dedupeQueries(\n    rawQueries.filter((entry): entry is string => typeof entry === \"string\"),\n    DEFAULT_QUERY_EXPANSION_MAX_QUERIES,\n  );\n}\n\n/**\n * Implements merge query expansions for the public runtime surface of this module.\n */\nexport function mergeQueryExpansions(base: string[], extra: string[], maxQueries: number): string[] {\n  return dedupeQueries([...base, ...extra], Math.max(1, maxQueries));\n}\n\n/**\n * Implements resolve query expansion config for the public runtime surface of this module.\n */\nexport function resolveQueryExpansionConfig(\n  settings: PmSettings,\n  fallbackProviderName: string | null,\n): QueryExpansionConfig {\n  const search = (settings as { search?: { query_expansion?: { enabled?: unknown; provider?: unknown } } }).search;\n  const queryExpansion = search?.query_expansion;\n  const configuredProvider = toNonEmptyString(queryExpansion?.provider);\n  return {\n    enabled: queryExpansion?.enabled === true,\n    provider: configuredProvider ?? fallbackProviderName,\n    max_queries: DEFAULT_QUERY_EXPANSION_MAX_QUERIES,\n  };\n}\n\n/**\n * Implements resolve rerank config for the public runtime surface of this module.\n */\nexport function resolveRerankConfig(settings: PmSettings, fallbackModel: string): RerankConfig {\n  const search = (settings as { search?: { rerank?: { enabled?: unknown; model?: unknown; top_k?: unknown } } }).search;\n  const rerank = search?.rerank;\n  const configuredModel = toNonEmptyString(rerank?.model);\n  const configuredTopK = coercePositiveInteger(rerank?.top_k);\n  const normalizedTopK = configuredTopK ?? DEFAULT_RERANK_TOP_K;\n  return {\n    enabled: rerank?.enabled === true,\n    model: configuredModel ?? fallbackModel,\n    top_k: Math.min(MAX_RERANK_TOP_K, normalizedTopK),\n  };\n}\n\n/**\n * Implements normalize rerank output for the public runtime surface of this module.\n */\nexport function normalizeRerankOutput(raw: unknown): RerankScoredHit[] {\n  const rawHits = Array.isArray(raw)\n    ? raw\n    : (raw as { hits?: unknown } | null | undefined)?.hits;\n  if (!Array.isArray(rawHits)) {\n    return [];\n  }\n  const bestById = new Map<string, number>();\n  for (const entry of rawHits) {\n    if (typeof entry !== \"object\" || entry === null) {\n      continue;\n    }\n    const id = toNonEmptyString((entry as { id?: unknown }).id);\n    const score = (entry as { score?: unknown }).score;\n    if (!id || typeof score !== \"number\" || !Number.isFinite(score)) {\n      continue;\n    }\n    const existing = bestById.get(id);\n    if (existing === undefined || score > existing) {\n      bestById.set(id, score);\n    }\n  }\n  const normalized = [...bestById.entries()].map(([id, score]) => ({ id, score }));\n  normalized.sort((left, right) => {\n    if (left.score !== right.score) {\n      return right.score - left.score;\n    }\n    return left.id.localeCompare(right.id);\n  });\n  return normalized;\n}\n\nfunction dotProduct(left: number[], right: number[]): number {\n  const size = left.length;\n  let result = 0;\n  for (let index = 0; index < size; index += 1) {\n    result += left[index] * right[index];\n  }\n  return result;\n}\n\nfunction l2Norm(vector: number[]): number {\n  let sumSquares = 0;\n  for (let index = 0; index < vector.length; index += 1) {\n    sumSquares += vector[index] * vector[index];\n  }\n  return Math.sqrt(sumSquares);\n}\n\nfunction cosineSimilarityWithKnownLeftNorm(\n  left: number[] | null | undefined,\n  right: number[] | null | undefined,\n  leftNorm: number,\n): number {\n  if (!left || !right || left.length === 0 || right.length === 0 || left.length !== right.length) {\n    return 0;\n  }\n  const numerator = dotProduct(left, right);\n  const rightNorm = l2Norm(right);\n  const denominator = leftNorm * rightNorm;\n  if (\n    !Number.isFinite(numerator) ||\n    !Number.isFinite(leftNorm) ||\n    !Number.isFinite(rightNorm) ||\n    !Number.isFinite(denominator) ||\n    denominator === 0\n  ) {\n    return 0;\n  }\n  return Math.max(-1, Math.min(1, numerator / denominator));\n}\n\n/**\n * Implements rerank candidates with embeddings for the public runtime surface of this module.\n */\nexport async function rerankCandidatesWithEmbeddings(\n  provider: EmbeddingProviderConfig,\n  model: string,\n  query: string,\n  candidates: RerankCandidate[],\n  timeoutMs?: number,\n): Promise<Map<string, number>> {\n  if (candidates.length === 0) {\n    return new Map();\n  }\n  const effectiveModel = toNonEmptyString(model) ?? provider.model;\n  const rerankProvider: EmbeddingProviderConfig =\n    effectiveModel === provider.model ? provider : { ...provider, model: effectiveModel };\n  const payload = [query.trim(), ...candidates.map((entry) => entry.text)];\n  const vectors = await executeEmbeddingRequest(rerankProvider, payload, timeoutMs ? { timeout_ms: timeoutMs } : {});\n  const queryVector = vectors[0];\n  if (!queryVector) {\n    return new Map();\n  }\n  const queryNorm = l2Norm(queryVector);\n  const scoreById = new Map<string, number>();\n  for (let index = 0; index < candidates.length; index += 1) {\n    const candidate = candidates[index];\n    const candidateVector = vectors[index + 1];\n    if (!candidateVector) {\n      continue;\n    }\n    const similarity = cosineSimilarityWithKnownLeftNorm(queryVector, candidateVector, queryNorm);\n    scoreById.set(candidate.id, Math.max(0, Math.min(1, (similarity + 1) / 2)));\n  }\n  return scoreById;\n}\n","/**\n * @module core/search/bm25\n *\n * Offline BM25 lexical retrieval (pm-75k9). Provides an Okapi BM25 ranker that\n * scores the in-memory item corpus with no embedding service, vector store, or\n * network dependency, so semantic/hybrid search degrades to a dense-quality\n * lexical ranker — rather than the naive field-weighted scorer — in air-gapped,\n * CI, and zero-setup environments.\n *\n * BM25 improves on raw term-frequency counting in three ways the legacy keyword\n * scorer cannot: inverse document frequency down-weights terms common across the\n * whole corpus, term-frequency saturation (`k1`) caps the contribution of a term\n * repeated many times in one document, and length normalization (`b`) prevents\n * long documents from dominating purely by size.\n */\nimport type { PmSettings } from \"../../types/index.js\";\nimport { tokenizeAlphaNumeric } from \"../shared/text-normalization.js\";\n\n/**\n * Default Okapi BM25 term-frequency saturation parameter. `1.2` is the widely\n * used Lucene/Elasticsearch default: higher values reduce the diminishing\n * returns of repeated terms more slowly (terms keep accruing weight), lower\n * values saturate sooner.\n */\nexport const DEFAULT_BM25_K1 = 1.2;\n\n/**\n * Default Okapi BM25 length-normalization parameter. `0.75` is the Lucene\n * default: `0` disables length normalization entirely, `1` fully normalizes a\n * document's score by its length relative to the corpus average.\n */\nexport const DEFAULT_BM25_B = 0.75;\n\n/**\n * Resolved BM25 tuning parameters. Both are clamped to sane ranges by\n * {@link resolveBm25Params} before scoring.\n */\nexport interface Bm25Params {\n  /** Term-frequency saturation (`k1`); finite and `>= 0`. */\n  k1: number;\n  /** Length normalization (`b`); finite and within `[0, 1]`. */\n  b: number;\n}\n\n/**\n * One corpus document supplied to {@link buildBm25Index}: a stable id and the\n * already-concatenated searchable text. Callers build the text from whichever\n * fields they want indexed (typically the resolved `search.corpus_fields`).\n */\nexport interface Bm25Document {\n  id: string;\n  text: string;\n}\n\n/**\n * Per-document statistics retained in a {@link Bm25Index}: the term-frequency\n * map and the document length (total token count) used for length\n * normalization.\n */\ninterface Bm25DocumentStats {\n  id: string;\n  termFrequencies: Map<string, number>;\n  length: number;\n}\n\n/**\n * An immutable BM25 index built from a document set. Carries the per-document\n * term frequencies, per-term document frequencies, corpus size, and average\n * document length needed to score any query. Build once per query batch with\n * {@link buildBm25Index}, then score with {@link scoreBm25Query}.\n */\nexport interface Bm25Index {\n  documents: Bm25DocumentStats[];\n  documentFrequency: Map<string, number>;\n  documentCount: number;\n  averageDocumentLength: number;\n}\n\n/**\n * Tokenize a document/query string into BM25 terms. Shares\n * {@link tokenizeAlphaNumeric} with the lexical scorer so the BM25 vocabulary is\n * identical to the rest of search: lowercase, alphanumeric runs, no stop-word\n * removal or stemming (kept deliberately simple and language-agnostic).\n */\nexport function tokenizeBm25(text: string): string[] {\n  return tokenizeAlphaNumeric(text);\n}\n\n/**\n * Count occurrences of each token in a token list.\n */\nfunction buildTermFrequencies(tokens: string[]): Map<string, number> {\n  const frequencies = new Map<string, number>();\n  for (const token of tokens) {\n    frequencies.set(token, (frequencies.get(token) ?? 0) + 1);\n  }\n  return frequencies;\n}\n\n/**\n * Build a BM25 index from a corpus. Computes each document's term frequencies\n * and length, the per-term document frequency, the corpus size, and the average\n * document length. Empty documents (no tokens) are retained with length `0` so\n * they can still be scored (they simply never match a query term). An empty\n * corpus yields an index with `averageDocumentLength` `0`, which\n * {@link scoreBm25Query} handles without dividing by zero.\n */\nexport function buildBm25Index(documents: Bm25Document[]): Bm25Index {\n  const stats: Bm25DocumentStats[] = [];\n  const documentFrequency = new Map<string, number>();\n  let totalLength = 0;\n  for (const document of documents) {\n    const tokens = tokenizeBm25(document.text);\n    const termFrequencies = buildTermFrequencies(tokens);\n    totalLength += tokens.length;\n    for (const term of termFrequencies.keys()) {\n      documentFrequency.set(term, (documentFrequency.get(term) ?? 0) + 1);\n    }\n    stats.push({ id: document.id, termFrequencies, length: tokens.length });\n  }\n  const documentCount = stats.length;\n  return {\n    documents: stats,\n    documentFrequency,\n    documentCount,\n    averageDocumentLength: documentCount > 0 ? totalLength / documentCount : 0,\n  };\n}\n\n/**\n * Inverse document frequency for one term using the BM25 \"plus-one\" variant\n * (`ln(1 + (N - n + 0.5) / (n + 0.5))`) used by Lucene. The `1 +` inside the\n * logarithm keeps the IDF strictly non-negative even for a term that appears in\n * every document, so a common term can never subtract from a document's score.\n */\nfunction inverseDocumentFrequency(documentCount: number, termDocumentFrequency: number): number {\n  return Math.log(1 + (documentCount - termDocumentFrequency + 0.5) / (termDocumentFrequency + 0.5));\n}\n\n/**\n * Score every document in the index against a query and return an id → score\n * map containing only documents with a strictly positive score (a document that\n * matches no query term is omitted, mirroring the lexical scorer's \"no match →\n * no hit\" contract). Query tokens are de-duplicated so a token repeated in the\n * query does not multiply its own contribution. Returns an empty map for an\n * empty index, an empty query, or a query whose terms appear in no document.\n */\nexport function scoreBm25Query(index: Bm25Index, queryTokens: string[], params: Bm25Params): Map<string, number> {\n  const scores = new Map<string, number>();\n  // Empty corpus, or a corpus where every document is empty (avgdl 0): no term\n  // can match, so return early. Guarding here also guarantees a non-zero\n  // average document length below, keeping the length-normalization division\n  // safe without an unreachable fallback branch.\n  if (index.documentCount === 0 || index.averageDocumentLength === 0) {\n    return scores;\n  }\n  const distinctQueryTerms = [...new Set(queryTokens.filter((token) => token.length > 0))];\n  if (distinctQueryTerms.length === 0) {\n    return scores;\n  }\n  // Precompute the IDF for each query term once rather than per document.\n  const idfByTerm = new Map<string, number>();\n  for (const term of distinctQueryTerms) {\n    const termDocumentFrequency = index.documentFrequency.get(term);\n    if (termDocumentFrequency === undefined) {\n      continue;\n    }\n    idfByTerm.set(term, inverseDocumentFrequency(index.documentCount, termDocumentFrequency));\n  }\n  if (idfByTerm.size === 0) {\n    return scores;\n  }\n  for (const document of index.documents) {\n    let score = 0;\n    for (const [term, idf] of idfByTerm) {\n      const termFrequency = document.termFrequencies.get(term);\n      if (termFrequency === undefined) {\n        continue;\n      }\n      const lengthNormalization =\n        1 - params.b + (params.b * document.length) / index.averageDocumentLength;\n      const denominator = termFrequency + params.k1 * lengthNormalization;\n      score += idf * ((termFrequency * (params.k1 + 1)) / denominator);\n    }\n    if (score > 0) {\n      scores.set(document.id, score);\n    }\n  }\n  return scores;\n}\n\n/**\n * Coerce one persisted BM25 parameter to a finite number within `[min, max]`.\n * A finite number is clamped to the range (preserving user intent — e.g.\n * `k1=5000` becomes `1000` rather than being silently ignored); any non-number\n * or non-finite value (string, `NaN`, `Infinity`, missing) falls back to\n * `fallback` so a malformed `settings.json` can never crash or skew scoring.\n */\nfunction resolveClampedParam(candidate: unknown, fallback: number, min: number, max: number): number {\n  if (typeof candidate !== \"number\" || !Number.isFinite(candidate)) {\n    return fallback;\n  }\n  return Math.min(max, Math.max(min, candidate));\n}\n\n/**\n * Flatten a structured search-corpus record (the shape produced by\n * `buildSearchCorpus`) into a single whitespace-joined string of its *values*\n * only — field names/object keys are deliberately excluded so corpus-wide keys\n * (`title`, `description`, …) never enter the BM25 vocabulary and skew IDF.\n * Strings and numbers contribute their text; arrays and nested objects (tags,\n * dependencies, the plan corpus) are walked recursively; everything else is\n * dropped.\n */\nexport function flattenSearchCorpusText(corpus: Record<string, unknown>): string {\n  const collectValueText = (value: unknown): string[] => {\n    if (typeof value === \"string\") {\n      return [value];\n    }\n    if (typeof value === \"number\") {\n      return [String(value)];\n    }\n    if (Array.isArray(value)) {\n      return value.flatMap(collectValueText);\n    }\n    if (typeof value === \"object\" && value !== null) {\n      return Object.values(value).flatMap(collectValueText);\n    }\n    return [];\n  };\n  return collectValueText(Object.values(corpus)).join(\" \");\n}\n\n/**\n * Resolve the effective BM25 parameters from `settings.search.bm25`, applying\n * {@link DEFAULT_BM25_K1}/{@link DEFAULT_BM25_B} when unset and clamping `k1` to\n * `[0, 1000]` and `b` to `[0, 1]`. Tolerant of partial/invalid config: each\n * knob is resolved independently so one bad value does not discard the other.\n */\nexport function resolveBm25Params(settings: Pick<PmSettings, \"search\"> | undefined): Bm25Params {\n  const bm25 = (settings?.search as { bm25?: { k1?: unknown; b?: unknown } } | undefined)?.bm25;\n  return {\n    k1: resolveClampedParam(bm25?.k1, DEFAULT_BM25_K1, 0, 1_000),\n    b: resolveClampedParam(bm25?.b, DEFAULT_BM25_B, 0, 1),\n  };\n}\n","/**\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","/**\n * @module cli/commands/get\n *\n * Implements the pm get 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 { resolveItemTypeRegistry } from \"../../core/item/type-registry.js\";\nimport { resolveRuntimeFieldRegistry, resolveRuntimeStatusRegistry } from \"../../core/schema/runtime-schema.js\";\nimport { isTerminalStatus } from \"../../core/item/status.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 { buildItemNotFoundError, listAllFrontMatterLight, locateItem, readLocatedItem } from \"../../core/store/item-store.js\";\nimport { getHistoryPath, getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport { parseIntegerLimit } from \"../shared-parsers.js\";\nimport type { ItemFrontMatter, LinkedDoc, LinkedFile, LinkedTest } from \"../../types/index.js\";\nimport { readHistoryEntries } from \"./history.js\";\nimport { runList } from \"./list.js\";\n\ninterface ClaimHistoryContext {\n  ts: string;\n  author: string;\n  message: string | null;\n}\n\ninterface ClaimHistoryEntry {\n  op: string;\n  ts: string;\n  author: string;\n  message?: string;\n}\n\ninterface ClaimStateContext {\n  claimed: boolean;\n  assignee: string | null;\n  last_claim: ClaimHistoryContext | null;\n  last_release: ClaimHistoryContext | null;\n}\n\ninterface ChildRollupContext {\n  count: number;\n  active: number;\n  by_status: Record<string, number>;\n}\n\n// GH-155 (pm-gcm3): only container types get the inline child rollup so leaf\n// item reads keep avoiding the corpus scan that the rollup requires.\nconst CHILD_ROLLUP_TYPES = new Set([\"milestone\", \"epic\"]);\n\n/**\n * Documents the get result payload exchanged by command, SDK, and package integrations.\n */\nexport interface GetResult {\n  // `body` lives inside `item` (alongside `description`/`acceptance_criteria`)\n  // for parity with `pm list --include-body`, so agents reliably find it at\n  // `.item.body` in JSON output instead of a top-level sibling.\n  item: Partial<ItemFrontMatter> & { body?: string };\n  linked?: {\n    files: LinkedFile[];\n    tests: LinkedTest[];\n    docs: LinkedDoc[];\n  };\n  claim_state?: ClaimStateContext;\n  children?: ChildRollupContext;\n  tree?: {\n    root_id: string;\n    root_title: string | null;\n    depth_limit: number | null;\n    count: number;\n    items: Record<string, unknown>[];\n  };\n}\n\nconst GET_DEPTH_VALUES = [\"brief\", \"standard\", \"deep\"] as const;\n\ntype GetDepth = (typeof GET_DEPTH_VALUES)[number];\n\n/**\n * Documents the get options payload exchanged by command, SDK, and package integrations.\n */\nexport interface GetOptions {\n  depth?: string;\n  fields?: string;\n  full?: boolean;\n  tree?: boolean;\n  treeDepth?: string;\n}\n\nfunction toClaimHistoryContext(\n  entry: ClaimHistoryEntry,\n): ClaimHistoryContext {\n  return {\n    ts: entry.ts,\n    author: entry.author,\n    message: entry.message ?? null,\n  };\n}\n\nfunction resolveClaimStateContext(\n  assigneeValue: string | undefined,\n  history: ClaimHistoryEntry[],\n): ClaimStateContext {\n  const assignee = assigneeValue?.trim();\n  const normalizedAssignee = assignee && assignee.length > 0 ? assignee : null;\n  const lastClaim = [...history].reverse().find((entry) => entry.op === \"claim\");\n  const lastRelease = [...history].reverse().find((entry) => entry.op === \"release\");\n  return {\n    claimed: normalizedAssignee !== null,\n    assignee: normalizedAssignee,\n    last_claim: lastClaim ? toClaimHistoryContext(lastClaim) : null,\n    last_release: lastRelease ? toClaimHistoryContext(lastRelease) : null,\n  };\n}\n\nfunction parseGetDepth(raw: string | undefined): GetDepth {\n  if (raw === undefined || raw.trim().length === 0) {\n    return \"standard\";\n  }\n  const normalized = raw.trim().toLowerCase();\n  if (normalized === \"full\") {\n    return \"deep\";\n  }\n  if (GET_DEPTH_VALUES.includes(normalized as GetDepth)) {\n    return normalized as GetDepth;\n  }\n  throw new PmCliError(\"Get --depth must be one of brief|standard|deep|full\", EXIT_CODE.USAGE);\n}\n\nfunction projectItemForDepth(item: ItemFrontMatter, depth: GetDepth): Partial<ItemFrontMatter> {\n  if (depth === \"deep\") {\n    return item;\n  }\n  const {\n    comments: _comments,\n    notes: _notes,\n    learnings: _learnings,\n    files: _files,\n    tests: _tests,\n    docs: _docs,\n    reminders: _reminders,\n    events: _events,\n    ...projected\n  } = item;\n  return projected;\n}\n\nfunction parseGetFields(raw: string | undefined): string[] | null {\n  if (raw === undefined) {\n    return null;\n  }\n  const fields = raw\n    .split(\",\")\n    .map((entry) => entry.trim())\n    .filter((entry) => entry.length > 0);\n  if (fields.length === 0) {\n    throw new PmCliError(\"Get --fields requires a comma-separated list of field names\", EXIT_CODE.USAGE);\n  }\n  return fields;\n}\n\nfunction normalizeGetField(field: string): string {\n  return field.startsWith(\"item.\") ? field.slice(\"item.\".length) : field;\n}\n\nfunction validateGetFields(fields: string[] | null, runtimeMetadataKeys: Iterable<string>): void {\n  if (fields === null) {\n    return;\n  }\n  const itemFields = new Set([...FRONT_MATTER_KEY_ORDER, ...runtimeMetadataKeys]);\n  const allowedRootFields = new Set([\"body\", \"linked\", \"claim_state\", \"children\"]);\n  const allowedLinkedFields = new Set([\"linked.files\", \"linked.tests\", \"linked.docs\"]);\n  const allowedClaimStateFields = new Set([\"claim_state.claimed\", \"claim_state.assignee\", \"claim_state.last_claim\", \"claim_state.last_release\"]);\n  const unknown = fields.filter((field) => {\n    const normalized = normalizeGetField(field);\n    return (\n      !itemFields.has(normalized) &&\n      !allowedRootFields.has(normalized) &&\n      !allowedLinkedFields.has(normalized) &&\n      !allowedClaimStateFields.has(normalized)\n    );\n  });\n  if (unknown.length > 0) {\n    throw new PmCliError(`Unknown get --fields value(s): ${unknown.join(\", \")}`, EXIT_CODE.USAGE, {\n      code: \"unknown_field_projection\",\n      examples: [\n        \"pm get <id> --fields id,title,status,type,updated_at\",\n        \"pm get <id> --fields id,title,claim_state\",\n        \"pm get <id> --fields id,title,body,linked.files\",\n      ],\n    });\n  }\n}\n\nfunction projectItemForFields(item: ItemFrontMatter, fields: string[]): Partial<ItemFrontMatter> {\n  const source = toItemRecord(item);\n  const projected: Record<string, unknown> = {};\n  for (const field of fields) {\n    const normalized = field.startsWith(\"item.\") ? field.slice(\"item.\".length) : field;\n    if (normalized === \"body\" || normalized === \"linked\" || normalized.startsWith(\"linked.\")) {\n      continue;\n    }\n    projected[normalized] = source[normalized];\n  }\n  return projected as Partial<ItemFrontMatter>;\n}\n\nfunction fieldsInclude(fields: string[] | null, name: string): boolean {\n  return fields?.some((field) => field === name || field === `item.${name}`) ?? false;\n}\n\nfunction fieldsIncludeRoot(fields: string[], name: string): boolean {\n  return fields.some((field) => field === name || field.startsWith(`${name}.`));\n}\n\ninterface ResolvedGetProjection {\n  depth: GetDepth;\n  treeDepth: number | undefined;\n  fields: string[] | null;\n  fieldProjection: boolean;\n}\n\ninterface GetItemContext {\n  pmRoot: string;\n  settings: Awaited<ReturnType<typeof readSettings>>;\n  typeToFolder: Record<string, string>;\n  locatedId: string;\n  metadata: ItemFrontMatter;\n  body: string;\n}\n\nfunction resolveGetProjection(options: GetOptions): ResolvedGetProjection {\n  if (options.full && (options.fields !== undefined || options.depth !== undefined)) {\n    throw new PmCliError(\"Get projection options are mutually exclusive; remove the extra projection flag and retry.\", EXIT_CODE.USAGE);\n  }\n  if (options.tree !== true && options.treeDepth !== undefined) {\n    throw new PmCliError(\"Get --tree-depth requires --tree\", EXIT_CODE.USAGE);\n  }\n  return {\n    depth: options.full ? \"deep\" : parseGetDepth(options.depth),\n    treeDepth: options.tree === true ? parseIntegerLimit(options.treeDepth, \"--tree-depth\") : undefined,\n    fields: parseGetFields(options.fields),\n    fieldProjection: options.fields !== undefined,\n  };\n}\n\nasync function loadGetItemContext(id: string, global: GlobalOptions): Promise<GetItemContext> {\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 typeRegistry = resolveItemTypeRegistry(settings, getActiveExtensionRegistrations());\n  const located = await locateItem(pmRoot, id, settings.id_prefix, settings.item_format, typeRegistry.type_to_folder);\n  if (!located) {\n    throw await buildItemNotFoundError(pmRoot, id, settings.id_prefix, typeRegistry.type_to_folder);\n  }\n  const loaded = await readLocatedItem(located, { schema: settings.schema });\n  return {\n    pmRoot,\n    settings,\n    typeToFolder: typeRegistry.type_to_folder,\n    locatedId: located.id,\n    metadata: loaded.document.metadata,\n    body: loaded.document.body,\n  };\n}\n\nfunction validateGetProjectionFields(fields: string[] | null, settings: Awaited<ReturnType<typeof readSettings>>): void {\n  const runtimeMetadataKeys = resolveRuntimeFieldRegistry(settings.schema).definitions.map((field) => field.metadata_key);\n  validateGetFields(fields, runtimeMetadataKeys);\n}\n\nfunction shouldIncludeGetField(params: {\n  fieldProjection: boolean;\n  depth: GetDepth;\n  fields: string[] | null;\n  field: \"body\" | \"linked\" | \"claim_state\" | \"children\";\n  itemType?: string;\n}): boolean {\n  const { fieldProjection, depth, fields, field, itemType } = params;\n  if (fieldProjection) {\n    if (field === \"body\" || field === \"linked\") {\n      return fieldsInclude(fields, field);\n    }\n    return fieldsIncludeRoot(fields as string[], field);\n  }\n  if (field === \"children\") {\n    return depth !== \"brief\" && CHILD_ROLLUP_TYPES.has(itemType as string);\n  }\n  return depth !== \"brief\";\n}\n\nasync function resolveGetClaimState(context: GetItemContext, includeClaimState: boolean): Promise<ClaimStateContext | undefined> {\n  if (!includeClaimState) {\n    return undefined;\n  }\n  const historyPath = getHistoryPath(context.pmRoot, context.locatedId);\n  const history = await readHistoryEntries(historyPath, context.locatedId);\n  return resolveClaimStateContext(context.metadata.assignee, history);\n}\n\nfunction attachGetLinked(\n  result: GetResult,\n  context: GetItemContext,\n  fields: string[] | null,\n  includeLinked: boolean,\n): void {\n  const includeLinkedFiles = includeLinked || fieldsInclude(fields, \"linked.files\");\n  const includeLinkedTests = includeLinked || fieldsInclude(fields, \"linked.tests\");\n  const includeLinkedDocs = includeLinked || fieldsInclude(fields, \"linked.docs\");\n  if (!includeLinked && !includeLinkedFiles && !includeLinkedTests && !includeLinkedDocs) {\n    return;\n  }\n  result.linked = {\n    files: includeLinkedFiles ? context.metadata.files ?? [] : [],\n    tests: includeLinkedTests ? context.metadata.tests ?? [] : [],\n    docs: includeLinkedDocs ? context.metadata.docs ?? [] : [],\n  };\n}\n\nasync function buildGetChildrenRollup(context: GetItemContext, includeChildren: boolean): Promise<ChildRollupContext | undefined> {\n  if (!includeChildren) {\n    return undefined;\n  }\n  const statusRegistry = resolveRuntimeStatusRegistry(context.settings.schema);\n  const corpus = await listAllFrontMatterLight(\n    context.pmRoot,\n    context.settings.item_format,\n    context.typeToFolder,\n    undefined,\n    context.settings.schema,\n  );\n  const byStatus: Record<string, number> = {};\n  let active = 0;\n  let count = 0;\n  const locatedId = context.locatedId.trim().toLowerCase();\n  for (const candidate of corpus) {\n    const parentId = typeof candidate.parent === \"string\" ? candidate.parent.trim().toLowerCase() : \"\";\n    if (parentId !== locatedId) continue;\n    const candidateStatus = candidate.status.trim().toLowerCase();\n    count += 1;\n    byStatus[candidateStatus] = (byStatus[candidateStatus] ?? 0) + 1;\n    if (!isTerminalStatus(candidateStatus, statusRegistry)) {\n      active += 1;\n    }\n  }\n  return { count, active, by_status: byStatus };\n}\n\nasync function buildGetTree(\n  context: GetItemContext,\n  options: GetOptions,\n  treeDepth: number | undefined,\n  global: GlobalOptions,\n): Promise<GetResult[\"tree\"] | undefined> {\n  if (options.tree !== true) {\n    return undefined;\n  }\n  const subtree = await runList(\n    undefined,\n    {\n      parent: context.locatedId,\n      tree: true,\n      treeDepth: treeDepth === undefined ? undefined : String(treeDepth),\n      full: true,\n    },\n    global,\n  );\n  return {\n    root_id: context.locatedId,\n    root_title: context.metadata.title,\n    depth_limit: treeDepth ?? null,\n    count: subtree.count,\n    items: subtree.items.map((entry) => toItemRecord(entry)),\n  };\n}\n\n/**\n * Implements run get for the public runtime surface of this module.\n */\nexport async function runGet(id: string, global: GlobalOptions, options: GetOptions = {}): Promise<GetResult> {\n  const projection = resolveGetProjection(options);\n  const context = await loadGetItemContext(id, global);\n  validateGetProjectionFields(projection.fields, context.settings);\n  const includeBody = shouldIncludeGetField({ ...projection, field: \"body\" });\n  const includeLinked = shouldIncludeGetField({ ...projection, field: \"linked\" });\n  const includeClaimState = shouldIncludeGetField({ ...projection, field: \"claim_state\" });\n  const itemType = context.metadata.type.trim().toLowerCase();\n  const includeChildren = shouldIncludeGetField({ ...projection, field: \"children\", itemType });\n  const claimState = await resolveGetClaimState(context, includeClaimState);\n  const result: GetResult = {\n    item: projection.fieldProjection\n      ? projectItemForFields(context.metadata, projection.fields as string[])\n      : projectItemForDepth(context.metadata, projection.depth),\n  };\n  if (includeBody) {\n    result.item.body = context.body;\n  }\n  attachGetLinked(result, context, projection.fields, includeLinked);\n  if (claimState) {\n    result.claim_state = claimState;\n  }\n  result.children = await buildGetChildrenRollup(context, includeChildren);\n  result.tree = await buildGetTree(context, options, projection.treeDepth, global);\n  return result;\n}\n","/**\n * @module cli/commands/next\n *\n * Implements the `pm next` command: the distilled \"what should I work on now?\"\n * query. It loads the active corpus, computes dependency-aware actionability\n * (ready vs blocked leaf work), and returns a single ranked recommendation with a\n * deterministic rationale plus the ranked ready/blocked queues — so an agent gets\n * the next action and the reason for it in one token-efficient read instead of\n * re-deriving readiness from a full `pm context` snapshot every turn.\n */\nimport {\n  collectBlockedByIds,\n  computeActionabilityReport,\n  type ActionableEntry,\n} from \"../../core/item/actionability.js\";\nimport { resolveRuntimeStatusRegistry, type RuntimeStatusRegistry } from \"../../core/schema/runtime-schema.js\";\nimport { EXIT_CODE } from \"../../core/shared/constants.js\";\nimport type { GlobalOptions } from \"../../core/shared/command-types.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { nowIso } from \"../../core/shared/time.js\";\nimport { normalizeStatusInput, normalizeStatusForRegistry } from \"../../core/item/status.js\";\nimport { resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport type { ItemFrontMatter, ItemStatus } from \"../../types/index.js\";\nimport { parseIntegerLimit } from \"../shared-parsers.js\";\nimport {\n  buildChildrenByParent,\n  collectSubtreeIds,\n  compareCriticalItems,\n  toContextFocusItem,\n  type ContextFocusItem,\n} from \"./context.js\";\nimport { runList, type ListOptions } from \"./list.js\";\n\nexport const NEXT_OUTPUT_VALUES = [\"markdown\", \"toon\", \"json\"] as const;\n/**\n * Restricts `pm next` output format values accepted by command, SDK, and storage contracts.\n */\nexport type NextOutputFormat = (typeof NEXT_OUTPUT_VALUES)[number];\n\nconst DEFAULT_NEXT_LIMIT = 5;\nconst MS_PER_DAY = 24 * 60 * 60 * 1000;\n\n/**\n * Documents the `pm next` options payload exchanged by command, SDK, and package integrations.\n */\nexport interface NextOptions {\n  type?: string;\n  tag?: string;\n  priority?: string;\n  assignee?: string;\n  assigneeFilter?: string;\n  sprint?: string;\n  release?: string;\n  parent?: string;\n  limit?: string;\n  blockedLimit?: string;\n  readyOnly?: boolean;\n  format?: string;\n  [key: string]: unknown;\n}\n\n/** A blocker reference projected onto the `pm next` output. */\nexport interface NextBlockerRef {\n  id: string;\n  title: string | null;\n  status: ItemStatus | null;\n}\n\n/**\n * A classified actionable item on the `pm next` output: a {@link ContextFocusItem}\n * focus row augmented with its open-blocker references and the downstream items it\n * would unblock.\n */\nexport interface NextActionableItem extends ContextFocusItem {\n  open_blocker_count: number;\n  blockers: NextBlockerRef[];\n  unblocks: string[];\n}\n\n/** The single recommended next item: an actionable row plus its rationale. */\nexport interface NextRecommendation extends NextActionableItem {\n  reasons: string[];\n}\n\ninterface NextSummary {\n  recommended: boolean;\n  ready: number;\n  blocked: number;\n  in_progress: number;\n  candidates: number;\n  containers: number;\n}\n\n/**\n * Documents the `pm next` result payload exchanged by command, SDK, and package integrations.\n */\nexport interface NextResult {\n  output_default: \"toon\";\n  now: string;\n  recommended: NextRecommendation | null;\n  ready: NextActionableItem[];\n  blocked: NextActionableItem[];\n  summary: NextSummary;\n  filters: {\n    type: string | null;\n    tag: string | null;\n    priority: string | null;\n    assignee: string | null;\n    assignee_filter: string | null;\n    sprint: string | null;\n    release: string | null;\n    parent: string | null;\n    limit: number;\n    blocked_limit: number;\n    ready_only: boolean;\n  };\n  suggestions?: string[];\n  warnings?: string[];\n}\n\nfunction parseNextOutputFormat(raw: string | undefined): NextOutputFormat | undefined {\n  if (!raw) return undefined;\n  const normalized = raw.trim().toLowerCase();\n  if (!NEXT_OUTPUT_VALUES.includes(normalized as NextOutputFormat)) {\n    throw new PmCliError(\"Next format must be one of markdown|toon|json\", EXIT_CODE.USAGE);\n  }\n  return normalized as NextOutputFormat;\n}\n\n/**\n * Resolves the effective `pm next` output format from the command `--format` flag\n * and the global `--json` switch, rejecting the contradictory `--json --format\n * markdown|toon` combination. Defaults to `toon`.\n */\nexport function resolveNextOutputFormat(options: NextOptions, global: GlobalOptions): NextOutputFormat {\n  const commandFormat = parseNextOutputFormat(options.format);\n  if (global.json && commandFormat && commandFormat !== \"json\") {\n    throw new PmCliError(\"Cannot combine --json with --format markdown|toon\", EXIT_CODE.USAGE);\n  }\n  if (global.json) {\n    return \"json\";\n  }\n  return commandFormat ?? \"toon\";\n}\n\n// Per-section row cap. A non-positive or absent value falls back to the default;\n// invalid (non-integer) values throw via parseIntegerLimit.\nfunction parseNextLimit(raw: string | undefined, flag: string, fallback: number): number {\n  const parsed = parseIntegerLimit(raw, flag);\n  if (parsed === undefined || parsed <= 0) return fallback;\n  return parsed;\n}\n\n// Projects an actionable entry onto its output row. Ready entries carry no\n// blockers; blocked entries surface their unresolved blockers for the agent.\nfunction toNextActionableItem(\n  entry: ActionableEntry,\n  statusRegistry: RuntimeStatusRegistry,\n  childrenByParent: Map<string, ItemFrontMatter[]>,\n): NextActionableItem {\n  return {\n    ...toContextFocusItem(entry.item, statusRegistry, childrenByParent),\n    open_blocker_count: entry.open_blockers.length,\n    blockers: entry.open_blockers.map((blocker) => ({ id: blocker.id, title: blocker.title, status: blocker.status })),\n    unblocks: entry.unblocks,\n  };\n}\n\n// Builds the human+agent readable rationale for the recommended item, ordering\n// clauses from most to least decisive (status, priority, deadline, blocker\n// clearance, parent advancement, downstream unblocks).\nfunction buildRecommendationReasons(\n  entry: ActionableEntry,\n  statusRegistry: RuntimeStatusRegistry,\n  now: string,\n  completedContainer: boolean,\n): string[] {\n  const item = entry.item;\n  const reasons: string[] = [];\n  const inProgressStatus = normalizeStatusInput(\"in_progress\", statusRegistry);\n  reasons.push(\n    normalizeStatusForRegistry(item.status, statusRegistry) === inProgressStatus\n      ? \"in progress — resume to finish\"\n      : \"open and ready to start\",\n  );\n  if (completedContainer) {\n    reasons.push(\"completed container — governance closeout\");\n  }\n  reasons.push(`priority p${item.priority}${item.priority === 0 ? \" (highest)\" : \"\"}`);\n  if (typeof item.deadline === \"string\" && item.deadline.trim().length > 0) {\n    reasons.push(describeDeadline(item.deadline, now));\n  }\n  reasons.push(collectBlockedByIds(item).length > 0 ? \"all blockers resolved\" : \"no blockers\");\n  if (typeof item.parent === \"string\" && item.parent.trim().length > 0) {\n    reasons.push(`advances ${item.parent.trim()}`);\n  }\n  if (entry.unblocks.length > 0) {\n    reasons.push(`unblocks ${entry.unblocks.length} item(s): ${entry.unblocks.join(\", \")}`);\n  }\n  return reasons;\n}\n\n// Renders a deadline as a date token plus a relative tag (overdue/today/in Nd).\n// The relative delta is computed on UTC calendar dates (both sides normalized to\n// midnight) so a deadline due today never reads as \"overdue 1d\" just because the\n// wall-clock time of `now` has passed midnight. Unparseable deadlines degrade to\n// the raw token (defensive — stored deadlines are always valid ISO).\nfunction describeDeadline(deadline: string, now: string): string {\n  const deadlineMs = Date.parse(deadline);\n  /* c8 ignore start -- defensive: a stored deadline that fails Date.parse still surfaces its raw token */\n  if (!Number.isFinite(deadlineMs)) {\n    return `deadline ${deadline.trim()}`;\n  }\n  /* c8 ignore stop */\n  const dateToken = new Date(deadlineMs).toISOString().slice(0, 10);\n  const nowToken = new Date(Date.parse(now)).toISOString().slice(0, 10);\n  const days = Math.round((Date.parse(dateToken) - Date.parse(nowToken)) / MS_PER_DAY);\n  if (days < 0) return `deadline ${dateToken} (overdue ${-days}d)`;\n  if (days === 0) return `deadline ${dateToken} (due today)`;\n  return `deadline ${dateToken} (in ${days}d)`;\n}\n\nfunction inProgressReadyCount(ready: NextActionableItem[], statusRegistry: RuntimeStatusRegistry): number {\n  const inProgressStatus = normalizeStatusInput(\"in_progress\", statusRegistry);\n  return ready.filter((item) => normalizeStatusForRegistry(item.status, statusRegistry) === inProgressStatus).length;\n}\n\n// Returns true when an otherwise-ready item still has terminal descendants. Such\n// rows are useful governance closeout context, but concrete leaf work should rank\n// ahead of them in the default agent loop.\nfunction hasCompletedDescendants(item: ItemFrontMatter, childrenByParent: Map<string, ItemFrontMatter[]>): boolean {\n  return (childrenByParent.get(item.id.trim().toLowerCase()) ?? []).length > 0;\n}\n\n// Strips projection/pagination flags so the corpus reads stay full: limits are\n// per-section display caps applied after classification, never corpus filters.\nfunction nextListOptions(options: NextOptions, extra: Partial<ListOptions>): ListOptions {\n  return {\n    type: options.type,\n    tag: options.tag,\n    priority: options.priority,\n    assignee: options.assignee,\n    assigneeFilter: options.assigneeFilter,\n    sprint: options.sprint,\n    release: options.release,\n    noTruncate: true,\n    ...extra,\n  };\n}\n\nfunction rankNextReadyEntries(\n  ready: ActionableEntry[],\n  childrenByParent: Map<string, ItemFrontMatter[]>,\n  statusRegistry: RuntimeStatusRegistry,\n): ActionableEntry[] {\n  return [...ready].sort((left, right) => {\n    const leftCompletedContainer = hasCompletedDescendants(left.item, childrenByParent);\n    const rightCompletedContainer = hasCompletedDescendants(right.item, childrenByParent);\n    if (leftCompletedContainer !== rightCompletedContainer) {\n      return Number(leftCompletedContainer) - Number(rightCompletedContainer);\n    }\n    return compareCriticalItems(left.item, right.item, statusRegistry);\n  });\n}\n\nfunction buildNextRecommendation(params: {\n  projectedReady: ActionableEntry[];\n  readyRows: NextActionableItem[];\n  statusRegistry: RuntimeStatusRegistry;\n  now: string;\n  completedContainer: boolean;\n}): NextRecommendation | null {\n  if (params.projectedReady.length === 0) {\n    return null;\n  }\n  return {\n    ...params.readyRows[0],\n    reasons: buildRecommendationReasons(\n      params.projectedReady[0],\n      params.statusRegistry,\n      params.now,\n      params.completedContainer,\n    ),\n  };\n}\n\nfunction buildNextSuggestions(recommended: NextRecommendation | null, blockedRows: NextActionableItem[]): string[] | undefined {\n  if (recommended !== null) {\n    return undefined;\n  }\n  if (blockedRows.length > 0) {\n    return [\n      `${blockedRows.length} item(s) are blocked; unblock the top one by closing ${blockedRows[0].blockers\n        .map((blocker) => blocker.id)\n        .join(\", \")}`,\n      \"pm next --ready-only after a blocker closes to re-check ready work\",\n      'pm create --type Task --title \"...\" to add new ready work',\n    ];\n  }\n  return [\n    'pm create --type Task --title \"...\" to add a new work item',\n    \"pm list --status in_progress to review work already underway\",\n    \"pm context --depth deep for the full project snapshot\",\n  ];\n}\n\nfunction filterCandidatesByParentScope(\n  candidates: ItemFrontMatter[],\n  corpus: ItemFrontMatter[],\n  parentScope: string,\n): ItemFrontMatter[] {\n  if (!parentScope) {\n    return candidates;\n  }\n  const subtree = collectSubtreeIds(corpus, parentScope);\n  if (!subtree.found) {\n    throw new PmCliError(`Next --parent item not found: ${parentScope}`, EXIT_CODE.NOT_FOUND);\n  }\n  return candidates.filter((item) => subtree.ids.has(item.id.trim().toLowerCase()));\n}\n\n/**\n * Implements `pm next`: computes the ranked ready/blocked actionable queues and a\n * single recommended next item with rationale for the public runtime surface.\n */\nexport async function runNext(options: NextOptions, global: GlobalOptions): Promise<NextResult> {\n  const pmRoot = resolvePmRoot(process.cwd(), global.path);\n  const settings = await readSettings(pmRoot);\n  const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);\n  const now = nowIso();\n  const limit = parseNextLimit(options.limit, \"--limit\", DEFAULT_NEXT_LIMIT);\n  const blockedLimit = parseNextLimit(options.blockedLimit, \"--blocked-limit\", limit);\n  const readyOnly = options.readyOnly === true;\n  const parentScope = typeof options.parent === \"string\" ? options.parent.trim() : \"\";\n\n  // Active (non-terminal) candidates honor the caller's filters; the corpus is the\n  // FULL, UNFILTERED set (every status, every item) so blocker and descendant\n  // resolution still sees items outside the caller's filters or --parent subtree —\n  // otherwise a real blocker assigned to someone else (or a parent of a different\n  // type) would be missing and the blocked item misread as ready.\n  const candidatesList = await runList(undefined, nextListOptions(options, { excludeTerminal: true }), global);\n  const corpusList = await runList(undefined, { excludeTerminal: false, noTruncate: true }, global);\n  const candidates = filterCandidatesByParentScope(candidatesList.items as ItemFrontMatter[], corpusList.items as ItemFrontMatter[], parentScope);\n  const corpus = corpusList.items as ItemFrontMatter[];\n\n  const report = computeActionabilityReport(candidates, corpus, statusRegistry);\n  const childrenByParent = buildChildrenByParent(corpus);\n  const rankedReady = rankNextReadyEntries(report.ready, childrenByParent, statusRegistry);\n  const rankedBlocked = [...report.blocked].sort((left, right) =>\n    compareCriticalItems(left.item, right.item, statusRegistry),\n  );\n  const concreteReady = rankedReady.filter((entry) => !hasCompletedDescendants(entry.item, childrenByParent));\n  const projectedReady = concreteReady.length > 0 ? concreteReady : rankedReady;\n\n  const readyRows = projectedReady.map((entry) => toNextActionableItem(entry, statusRegistry, childrenByParent));\n  const blockedRows = rankedBlocked.map((entry) => toNextActionableItem(entry, statusRegistry, childrenByParent));\n\n  const recommended = buildNextRecommendation({\n    projectedReady,\n    readyRows,\n    statusRegistry,\n    now,\n    completedContainer: concreteReady.length === 0,\n  });\n\n  const result: NextResult = {\n    output_default: \"toon\",\n    now,\n    recommended,\n    ready: readyRows.slice(0, limit),\n    blocked: readyOnly ? [] : blockedRows.slice(0, blockedLimit),\n    summary: {\n      recommended: recommended !== null,\n      ready: readyRows.length,\n      blocked: blockedRows.length,\n      in_progress: inProgressReadyCount(readyRows, statusRegistry),\n      candidates: report.active_count,\n      containers: report.container_count,\n    },\n    filters: {\n      type: options.type ?? null,\n      tag: options.tag ?? null,\n      priority: options.priority ?? null,\n      assignee: options.assignee ?? null,\n      assignee_filter: options.assigneeFilter ?? null,\n      sprint: options.sprint ?? null,\n      release: options.release ?? null,\n      parent: parentScope.length > 0 ? parentScope : null,\n      limit,\n      blocked_limit: blockedLimit,\n      ready_only: readyOnly,\n    },\n  };\n\n  const warnings = [...new Set([...(candidatesList.warnings ?? []), ...(corpusList.warnings ?? [])])].sort((a, b) =>\n    a.localeCompare(b),\n  );\n  if (warnings.length > 0) result.warnings = warnings;\n\n  result.suggestions = buildNextSuggestions(recommended, blockedRows);\n\n  return result;\n}\n\n/**\n * Renders a {@link NextResult} as compact agent-readable markdown: the\n * recommendation with its rationale, the ranked ready queue, and (unless\n * `--ready-only`) the blocked queue annotated with each item's open blockers.\n */\nexport function renderNextMarkdown(result: NextResult): string {\n  const lines: string[] = [\"# pm next\", \"\"];\n  lines.push(`- now: ${result.now}`);\n  lines.push(\n    `- ready: ${result.summary.ready} (in_progress: ${result.summary.in_progress}), blocked: ${result.summary.blocked}, candidates: ${result.summary.candidates}`,\n  );\n  if (result.filters.parent) {\n    lines.push(`- scope: subtree of ${result.filters.parent}`);\n  }\n  lines.push(\"\");\n\n  lines.push(\"## Recommended\");\n  if (result.recommended) {\n    lines.push(`- ${formatNextLine(result.recommended)}`);\n    lines.push(`  why: ${result.recommended.reasons.join(\"; \")}`);\n  } else {\n    lines.push(\"No ready work.\");\n  }\n  lines.push(\"\");\n\n  lines.push(\"## Ready\");\n  if (result.ready.length === 0) {\n    lines.push(\"No ready items.\");\n  } else {\n    for (const item of result.ready) {\n      lines.push(`- ${formatNextLine(item)}`);\n    }\n  }\n  lines.push(\"\");\n\n  if (!result.filters.ready_only) {\n    lines.push(\"## Blocked\");\n    if (result.blocked.length === 0) {\n      lines.push(\"No blocked items.\");\n    } else {\n      for (const item of result.blocked) {\n        const by = item.blockers\n          .map((blocker) => `${blocker.id}(${blocker.status ?? \"?\"})`)\n          .join(\", \");\n        lines.push(`- ${formatNextLine(item)} blocked_by:${by}`);\n      }\n    }\n    lines.push(\"\");\n  }\n\n  if (result.suggestions && result.suggestions.length > 0) {\n    lines.push(\"## Suggestions\");\n    for (const suggestion of result.suggestions) {\n      lines.push(`- ${suggestion}`);\n    }\n  }\n\n  return lines.join(\"\\n\").trimEnd();\n}\n\n// Formats a single actionable row: id, priority, status, type, deadline, parent,\n// downstream-unblock count, and title. Mirrors the context focus-line shape.\nfunction formatNextLine(item: NextActionableItem): string {\n  const deadlineToken = item.deadline ?? \"-\";\n  const parentToken = item.parent ? ` parent:${item.parent}` : \"\";\n  const unblocksToken = item.unblocks.length > 0 ? ` unblocks:${item.unblocks.length}` : \"\";\n  return `${item.id} p${item.priority} ${item.status} ${item.type} deadline:${deadlineToken}${parentToken}${unblocksToken} ${item.title}`;\n}\n"],"names":["parseStatus","parseOutputFormat","completionPct","completionPct","formatClock","fs","path","path","fs","itemRecord","fs","path","path","VALID_EVAL_MODES","fs"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAKA,OAAO,QAAQ;AACf,OAAO,UAAU;AAwEjB,SAAS,oBAAoB,KAAyB,WAAiB;AACrE,MAAI,QAAQ;AAAW,WAAO;AAC9B,QAAM,aAAa,IAAI,KAAI;AAC3B,MAAI,WAAW,WAAW,GAAG;AAC3B,UAAM,IAAI,WAAW,GAAG,SAAS,sBAAsB,UAAU,KAAK;EACxE;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,KAAyB,UAAkB,YAAkB;AACpF,MAAI,QAAQ;AAAW,WAAO;AAC9B,QAAM,aAAa,IAAI,KAAI;AAC3B,MAAI,WAAW,WAAW,GAAG;AAC3B,UAAM,IAAI,WAAW,0CAA0C,UAAU,KAAK;EAChF;AACA,SAAO,qBAAqB,YAAY,IAAI,KAAK,QAAQ,GAAG,UAAU;AACxE;AAEA,SAAS,oBAAoB,OAAsB,MAA0B,IAAsB;AACjG,MAAI,MAAM,GAAG,WAAW,MAAM,QAAQ,KAAK;AACzC,WAAO;EACT;AACA,MAAI,QAAQ,wBAAwB,MAAM,IAAI,IAAI,IAAI,GAAG;AACvD,WAAO;EACT;AACA,MAAI,MAAM,wBAAwB,MAAM,IAAI,EAAE,KAAK,GAAG;AACpD,WAAO;EACT;AACA,SAAO;AACT;AAEA,SAAS,aAAgB,QAAa,OAAyB;AAC7D,MAAI,UAAU;AAAW,WAAO;AAChC,SAAO,OAAO,MAAM,GAAG,KAAK;AAC9B;AAEA,SAAS,mBAAmB,OAAgB,WAAW,IAAE;AACvD,SAAO,OAAO,UAAU,WAAW,QAAQ;AAC7C;AAEA,SAAS,uBAAuB,IAAY,OAAmB;AAC7D,SAAO;IACL,GAAG;IACH;IACA,IAAI,mBAAmB,MAAM,EAAE;IAC/B,QAAQ,mBAAmB,MAAM,QAAQ,SAAS;IAClD,IAAI,mBAAmB,MAAM,IAAI,SAAS;IAC1C,OAAO,MAAM,QAAQ,MAAM,KAAK,IAAI,MAAM,QAAQ,CAAA;IAClD,aAAa,mBAAmB,MAAM,WAAW;IACjD,YAAY,mBAAmB,MAAM,UAAU;;AAEnD;AAEA,SAAS,aAAa,SAAwB;AAC5C,SAAO,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,GAAG,MAAK;AAChC,UAAM,cAAc,EAAE,GAAG,cAAc,EAAE,EAAE;AAC3C,QAAI,gBAAgB;AAAG,aAAO;AAC9B,UAAM,OAAO,EAAE,GAAG,cAAc,EAAE,EAAE;AACpC,QAAI,SAAS;AAAG,aAAO;AACvB,WAAO,EAAE,GAAG,cAAc,EAAE,EAAE;EAChC,CAAC;AACH;AAEA,eAAe,iBAAiB,YAAkB;AAChD,MAAI;AACF,YAAQ,MAAM,GAAG,QAAQ,UAAU,GAChC,OAAO,CAAC,UAAU,MAAM,SAAS,QAAQ,CAAC,EAC1C,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC;EACtC,SAAS,OAAgB;AAEvB,QAAK,MAAgC,SAAS,UAAU;AACtD,aAAO,CAAA;IACT;AACA,UAAM;EACR;AACF;AAEA,SAAS,uBAAuB,SAA+B;AAC7D,QAAM,WAAW,OAAM;AACvB,QAAM,OAAO,gBAAgB,QAAQ,MAAM,UAAU,QAAQ;AAC7D,QAAM,KAAK,gBAAgB,QAAQ,IAAI,UAAU,MAAM;AACvD,MAAI,QAAQ,MAAM,wBAAwB,MAAM,EAAE,KAAK,GAAG;AACxD,UAAM,IAAI,WAAW,uCAAuC,UAAU,KAAK;EAC7E;AACA,SAAO;IACL,IAAI,oBAAoB,QAAQ,IAAI,eAAe;IACnD,IAAI,oBAAoB,QAAQ,IAAI,eAAe;IACnD,QAAQ,oBAAoB,QAAQ,QAAQ,mBAAmB;IAC/D;IACA;IACA,OAAO,WAAW,QAAQ,KAAK;;AAEnC;AAEA,eAAe,8BAA8B,QAAqB;AAChE,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,SAAO;IACL;IACA,UAAU,MAAM,aAAa,MAAM;;AAEvC;AAEA,eAAe,2BAA2B,SAA+B;AACvE,QAAM,eAAe,wBAAwB,QAAQ,UAAU,gCAA+B,CAAE;AAChG,QAAM,QAAQ,MAAM,wBAClB,QAAQ,QACR,QAAQ,SAAS,aACjB,aAAa,gBACb,QACA,QAAQ,SAAS,MAAM;AAEzB,QAAM,mCAAmC;IACvC,QAAQ,QAAQ;IAChB,UAAU,QAAQ;IAClB,SAAS,MAAM,IAAI,CAAC,SAAS,KAAK,EAAE;IACpC,cAAc;GACf;AACD,QAAM,aAAa,KAAK,KAAK,QAAQ,QAAQ,SAAS;AACtD,QAAM,qBAAqB;IACzB,MAAM;IACN,OAAO;GACR;AACD,SAAO;AACT;AAEA,SAAS,qBAAqB,OAAqB,WAA0B,SAAwB;AAGnG,MAAI,QAAQ,MAAM,MAAM,OAAO,QAAQ,IAAI;AACzC,WAAO;EACT;AACA,MAAI,QAAQ,UAAU,MAAM,WAAW,QAAQ,QAAQ;AACrD,WAAO;EACT;AACA,SAAO,oBAAoB,WAAW,QAAQ,MAAM,QAAQ,EAAE;AAChE;AAEA,eAAe,uBAAuB,YAAoB,SAAwB;AAChF,QAAM,WAA4B,CAAA;AAClC,aAAW,QAAQ,MAAM,iBAAiB,UAAU,GAAG;AACrD,UAAM,KAAK,KAAK,MAAM,GAAG,CAAC,SAAS,MAAM;AACzC,QAAI,QAAQ,MAAM,OAAO,QAAQ,IAAI;AACnC;IACF;AACA,UAAM,UAAU,MAAM,mBAAmB,KAAK,KAAK,YAAY,IAAI,GAAG,EAAE;AACxE,eAAW,SAAS,SAAS;AAC3B,YAAM,YAAY,uBAAuB,IAAI,KAAK;AAClD,UAAI,qBAAqB,OAAO,WAAW,OAAO,GAAG;AACnD,iBAAS,KAAK,SAAS;MACzB;IACF;EACF;AACA,SAAO;AACT;AAEA,SAAS,sBAAsB,UAAyB;AACtD,SAAO,SAAS,IAAI,CAAC,WAAiC;IACpD,IAAI,MAAM;IACV,IAAI,MAAM;IACV,IAAI,MAAM;IACV,QAAQ,MAAM;IACd,GAAI,MAAM,UAAU,EAAE,KAAK,MAAM,QAAO,IAAK,CAAA;IAC7C;AACJ;AAgBA,eAAsB,YAAY,SAAiC,QAAqB;AACtF,QAAM,UAAU,MAAM,8BAA8B,MAAM;AAC1D,QAAM,UAAU,uBAAuB,OAAO;AAC9C,QAAM,aAAa,MAAM,2BAA2B,OAAO;AAC3D,QAAM,WAAW,aAAa,aAAa,MAAM,uBAAuB,YAAY,OAAO,CAAC,GAAG,QAAQ,KAAK;AAC5G,QAAM,UAAU,QAAQ,YAAY;AACpC,QAAM,kBAAkB,UAAU,sBAAsB,QAAQ,IAAI;AACpE,SAAO;IACL,UAAU,UAAU,CAAA,IAAK;IACzB,kBAAkB;IAClB;IACA,OAAO,SAAS;IAChB,OAAO,QAAQ,SAAS;;AAE5B;;;ACjPA,IAAM,yBAAgD;EACpD;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;AAoFF,SAAS,YAAY,KAAyB,gBAAqC;AACjF,QAAM,WAAW,qBAAqB,KAAK,gBAAgB,EAAE,QAAQ,MAAM,WAAW,WAAU,CAAE;AAClG,MAAI,CAAC,YAAY,SAAS,WAAW,GAAG;AACtC,WAAO;EACT;AACA,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,IAAI,WACR,4EACA,UAAU,KAAK;EAEnB;AACA,SAAO,SAAS,CAAC;AACnB;AAQA,SAAS,wBAAwB,SAAyB;AACxD,QAAM,WAAW,QAAQ,KAAK,KAAI;AAClC,QAAM,WAAW,QAAQ,KAAK,KAAI;AAClC,QAAM,gBAAgB,YAAY,SAAS,SAAS,IAAI,WAAW;AACnE,QAAM,gBAAgB,YAAY,SAAS,SAAS,IAAI,WAAW;AACnE,MAAI,CAAC,iBAAiB,CAAC,eAAe;AACpC,WAAO;EACT;AACA,MAAI,iBAAiB,iBAAiB,kBAAkB,eAAe;AACrE,UAAM,IAAI,WAAW,gEAAgE,UAAU,KAAK;EACtG;AACA,SAAO;IACL,OAAO,iBAAiB;IACxB,KAAK,kBAAkB;IACvB,KAAK,kBAAkB;;AAE3B;AAEA,SAAS,aAAa,KAAuB;AAC3C,QAAM,QAAQ,KAAK,KAAI,KAAM;AAC7B,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,WAAW,+CAA+C,UAAU,KAAK;EACrF;AACA,QAAM,YAAY,eAAe,KAAK;AACtC,MAAI,UAAU,WAAW,GAAG;AAC1B,UAAM,IAAI,WAAW,wDAAwD,UAAU,KAAK;EAC9F;AACA,aAAW,SAAS,WAAW;AAC7B,QAAI,CAAC,uBAAuB,SAAS,KAA4B,GAAG;AAClE,YAAM,IAAI,WACR,yCAAyC,uBAAuB,KAAK,GAAG,CAAC,eAAe,KAAK,KAC7F,UAAU,KAAK;IAEnB;EACF;AACA,SAAO;AACT;AAEA,SAAS,uBAAuB,MAAc;AAC5C,QAAM,aAAa,CAAC,GAAG,IAAI,IAAI,KAAK,IAAI,CAAC,QAAQ,IAAI,KAAI,EAAG,YAAW,CAAE,EAAE,OAAO,CAAC,QAAQ,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,UACvH,KAAK,cAAc,KAAK,CAAC;AAE3B,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;EACT;AACA,SAAO,WAAW,KAAK,GAAG;AAC5B;AAEA,SAAS,kBAAkB,OAA4B,MAAyB;AAC9E,UAAQ,OAAO;IACb,KAAK;AACH,aAAO,KAAK,UAAU;IACxB,KAAK;AACH,aAAO,KAAK;IACd,KAAK;AACH,aAAO,KAAK;IACd,KAAK;AACH,aAAO,KAAK;IACd,KAAK;AACH,aAAO,KAAK,YAAY;IAC1B,KAAK;AACH,aAAO,uBAAuB,KAAK,IAAI;IACzC,KAAK;AACH,aAAO,KAAK,UAAU;IACxB,KAAK;AACH,aAAO,KAAK,WAAW;IACzB;AACE,aAAO;EACX;AACF;AAEA,SAAS,0BAA0B,MAAuC,OAAsC;AAC9G,QAAM,YAAY,QAAQ;AAC1B,QAAM,aAAa,SAAS;AAC5B,MAAI,cAAc,YAAY;AAC5B,WAAO;EACT;AACA,MAAI,cAAc,MAAM;AACtB,WAAO;EACT;AACA,MAAI,eAAe,MAAM;AACvB,WAAO;EACT;AACA,MAAI,OAAO,cAAc,YAAY,OAAO,eAAe,UAAU;AACnE,WAAO,YAAY;EACrB;AACA,SAAO,OAAO,SAAS,EAAE,cAAc,OAAO,UAAU,CAAC;AAC3D;AAEA,SAAS,cAAc,SAAgC,OAA2B;AAChF,SAAO,QAAQ,IAAI,CAAC,UAAU,GAAG,KAAK,IAAI,KAAK,UAAU,MAAM,KAAK,KAAK,IAAI,CAAC,EAAE,EAAE,KAAK,GAAG;AAC5F;AAGA,IAAM,+BAAoE;EACxE,QAAQ;EACR,MAAM;EACN,UAAU;EACV,QAAQ;EACR,UAAU;EACV,MAAM;EACN,QAAQ;EACR,SAAS;;AAIX,SAAS,sBAAsB,OAA4B,OAAsC;AAC/F,MAAI,UAAU,QAAQ,UAAU,UAAa,UAAU,IAAI;AACzD,WAAO,6BAA6B,KAAK;EAC3C;AACA,SAAO,OAAO,KAAK;AACrB;AAOA,SAAS,gBAAgB,SAAgC,OAA2B;AAClF,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO,sBAAsB,QAAQ,CAAC,GAAG,MAAM,QAAQ,CAAC,CAAC,CAAC;EAC5D;AACA,SAAO,QAAQ,IAAI,CAAC,UAAU,GAAG,KAAK,IAAI,sBAAsB,OAAO,MAAM,KAAK,CAAC,CAAC,EAAE,EAAE,KAAK,KAAK;AACpG;AAEA,SAAS,qBACP,MACA,OACA,SAA8B;AAE9B,aAAW,SAAS,SAAS;AAC3B,UAAM,UAAU,0BAA0B,KAAK,MAAM,KAAK,GAAG,MAAM,MAAM,KAAK,CAAC;AAC/E,QAAI,YAAY,GAAG;AACjB,aAAO;IACT;EACF;AACA,SAAO;AACT;AAEA,SAAS,0BAA0B,MAA2B,OAAa;AACzE,QAAM,SAAS;AACf,QAAM,MAAM,OAAO,KAAK;AACxB,MAAI,OAAO,QAAQ,YAAY,OAAO,SAAS,GAAG,GAAG;AACnD,WAAO;EACT;AACA,MAAI,OAAO,QAAQ,UAAU;AAC3B,UAAM,UAAU,IAAI,KAAI;AACxB,QAAI,QAAQ,WAAW,GAAG;AACxB,aAAO;IACT;AACA,UAAM,SAAS,OAAO,OAAO;AAC7B,QAAI,OAAO,SAAS,MAAM,GAAG;AAC3B,aAAO;IACT;EACF;AACA,SAAO;AACT;AAcA,SAAS,cAAc,QAAgB,OAAa;AAClD,MAAI,SAAS,GAAG;AACd,WAAO;EACT;AACA,SAAO,KAAK,MAAO,SAAS,QAAS,GAAK,IAAI;AAChD;AAEA,SAAS,uBAAuB,aAAmC,QAAoB,gBAAqC;AAC1H,QAAM,mBAAmB,qBAAqB,OAAO,MAAM,GAAG,cAAc,KAAK;AACjF,MAAI,qBAAqB,eAAe,aAAa;AACnD,gBAAY,cAAc;AAC1B;EACF;AACA,MAAI,qBAAqB,iBAAkB,eAAe,gBAAgB,IAAI,gBAAgB,KAAK,qBAAqB,eAAe,aAAc;AACnJ,gBAAY,qBAAqB;AACjC;EACF;AACA,MAAI,eAAe,uBAAuB,IAAI,gBAAgB,KAAK,qBAAqB,eAAe,cAAc;AACnH,gBAAY,gBAAgB;AAC5B;EACF;AACA,cAAY,eAAe;AAC7B;AAEA,SAAS,2BACP,OACA,cAA2B;AAE3B,SAAO;IACL,KAAK;MACH;MACA,OAAO;;IAET,eAAe,iBAAiB,OAAO,IAAI;IAC3C,aAAa,gBAAgB;IAC7B,YAAY,iBAAiB,OAAO,IAAI;IACxC,YAAY;IACZ,mBAAmB;IACnB,cAAc;IACd,aAAa;;AAEjB;AAEA,SAAS,yBAAyB,aAAmC,cAA2B;AAC9F,MAAI,iBAAiB,MAAM;AACzB,gBAAY,cAAc;AAC1B;EACF;AACA,cAAY,iBAAiB;AAC7B,cAAY,eAAe;AAC7B;AAEA,SAAS,2BAA2B,QAOnC;AACC,SAAO,YAAY,IAAI,SAAS;AAChC,MAAI,OAAO,mBAAmB;AAC5B,2BAAuB,OAAO,aAAa,OAAO,KAAK,QAAQ,OAAO,cAAc;EACtF;AACA,MAAI,OAAO,uBAAuB,MAAM;AACtC,6BAAyB,OAAO,aAAa,OAAO,YAAY;EAClE;AACF;AAEA,SAAS,oBAAoB,SAAgC,MAAyB;AACpF,QAAM,QAA8B,CAAA;AACpC,aAAW,SAAS,SAAS;AAC3B,UAAM,KAAK,IAAI,kBAAkB,OAAO,IAAI;EAC9C;AACA,SAAO;AACT;AAEA,SAAS,qBACP,OACA,SACA,mBACA,oBAA6C;AAE7C,QAAM,MAAoB;IACxB,GAAG,MAAM;IACT,aAAa,gBAAgB,SAAS,MAAM,IAAI,KAAK;;AAEvD,MAAI,mBAAmB;AACrB,QAAI,OAAO,MAAM;AACjB,QAAI,cAAc,MAAM;AACxB,QAAI,SAAS,MAAM;AACnB,QAAI,QAAQ,MAAM;AAClB,QAAI,iBAAiB,cAAc,MAAM,cAAc,MAAM,IAAI,KAAK;EACxE;AACA,MAAI,uBAAuB,MAAM;AAC/B,QAAI,aAAa,MAAM;AACvB,QAAI,mBAAmB,KAAK;AAC1B,UAAI,MAAM,MAAM;IAClB;AACA,QAAI,mBAAmB,KAAK;AAC1B,UAAI,MAAM,MAAM,kBAAkB,IAAI,OAAO,MAAM,cAAc,MAAM;IACzE;EACF;AACA,SAAO;AACT;AAEA,SAAS,sBAAsB,QAO9B;AACC,SAAO;IACL,UAAU,OAAO;IACjB,OAAO;IACP,YAAY,OAAO;IACnB,oBAAoB,OAAO;IAC3B,QAAQ,OAAO,UAAU;IACzB,MAAM,OAAO,QAAQ,QAAQ;IAC7B,KAAK,OAAO,QAAQ,OAAO;IAC3B,UAAU,OAAO,QAAQ,YAAY;IACrC,iBAAiB,OAAO,QAAQ,kBAAkB;IAClD,gBAAgB,OAAO,QAAQ,iBAAiB;IAChD,UAAU,OAAO,QAAQ,YAAY;IACrC,iBAAiB,OAAO,QAAQ,kBAAkB;IAClD,QAAQ,OAAO,QAAQ,UAAU;IACjC,QAAQ,OAAO,QAAQ,UAAU;IACjC,SAAS,OAAO,QAAQ,WAAW;IACnC,GAAI,OAAO,uBAAuB,OAC9B;MACE,KAAK,OAAO,QAAQ,OAAO;MAC3B,KAAK,OAAO,QAAQ,OAAO;MAC3B,eAAe,OAAO,mBAAmB;QAE3C,CAAA;;AAER;AAKA,eAAsB,aAAa,SAA2B,QAAqB;AACjF,MAAI,QAAQ,UAAU,OAAO;AAC3B,UAAM,IAAI,WAAW,kEAAkE,UAAU,KAAK;EACxG;AAEA,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAI,OAAO,IAAI;AACvD,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,iBAAiB,6BAA6B,SAAS,MAAM;AACnE,QAAM,UAAU,aAAa,QAAQ,OAAO;AAC5C,QAAM,SAAS,YAAY,QAAQ,QAAQ,cAAc;AACzD,QAAM,qBAAqB,wBAAwB,OAAO;AAC1D,QAAM,oBAAoB,QAAQ,eAAe;AACjD,QAAM,oBAAoB,QAAQ,sBAAsB;AAExD,QAAM,SAAS,MAAM,QACnB,QACA,sBAAsB,OAAO,GAC7B,MAAM;AAGR,QAAM,UAAU,oBAAI,IAAG;AACvB,MAAI,oBAAoB;AACxB,MAAI,mBAAmB;AAEvB,aAAW,cAAc,OAAO,OAAO;AACrC,UAAM,OAAO;AACb,UAAM,QAAQ,oBAAoB,SAAS,IAAI;AAC/C,QAAI,QAAQ,SAAS,QAAQ,KAAK,MAAM,WAAW,QAAQ,CAAC,mBAAmB;AAC7E,2BAAqB;AACrB;IACF;AACA,UAAM,MAAM,cAAc,SAAS,KAAK;AACxC,UAAM,WAAW,QAAQ,IAAI,GAAG;AAChC,UAAM,eACJ,uBAAuB,OACnB,OACA,0BAA0B,MAAM,mBAAmB,KAAK;AAC9D,QAAI,UAAU;AACZ,iCAA2B;QACzB,aAAa;QACb;QACA;QACA;QACA;QACA;OACD;IACH,OAAO;AACL,YAAM,cAAc,2BAA2B,OAAO,YAAY;AAClE,UAAI,mBAAmB;AACrB,+BAAuB,aAAa,KAAK,QAAQ,cAAc;MACjE;AACA,cAAQ,IAAI,KAAK,WAAW;IAC9B;AACA,wBAAoB;EACtB;AAEA,QAAM,SAAS,CAAC,GAAG,QAAQ,OAAM,CAAE,EAChC,IAAI,CAAC,UAAU,qBAAqB,OAAO,SAAS,mBAAmB,kBAAkB,CAAC,EAC1F,KAAK,CAAC,MAAM,UAAU,qBAAqB,MAAM,OAAO,OAAO,CAAC;AACnE,QAAM,WAAW,OAAO,YAAY,OAAO,SAAS,SAAS,IAAI,OAAO,WAAW;AAEnF,SAAO;IACL;IACA,OAAO,OAAO;IACd,QAAQ;MACN,kBAAkB,OAAO,MAAM;MAC/B,eAAe;MACf,0BAA0B;;IAE5B,SAAS,sBAAsB,EAAE,SAAS,mBAAmB,mBAAmB,QAAQ,SAAS,mBAAkB,CAAE;IACrH,KAAK,OAAM;IACX,GAAI,WAAW,EAAE,SAAQ,IAAK,CAAA;;AAElC;;;AC9gBA,SAAS,UAAU,kBAAkB;AAuBrC,IAAM,uBAAuB,CAAC,UAAU,OAAO,QAAQ,OAAO;AAM9D,IAAM,yBAAyB,CAAC,YAAY,QAAQ,MAAM;AA0H1D,IAAM,qBAAqB,CAAC,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,KAAK;AAC3E,IAAM,oCAAoC;AAC1C,IAAM,mCAAmC;AACzC,IAAM,qCAAqC;AAC3C,IAAM,6BAA6B;AAEnC,SAAS,wBAAwB,KAAyB,OAAa;AACrE,MAAI,QAAQ;AAAW,WAAO;AAC9B,QAAM,SAAS,OAAO,GAAG;AACzB,MAAI,CAAC,OAAO,UAAU,MAAM,KAAK,SAAS,GAAG;AAC3C,UAAM,IAAI,WAAW,GAAG,KAAK,mCAAmC,UAAU,KAAK;EACjF;AACA,SAAO;AACT;AAIA,SAAS,oBAAoB,KAAuB;AAClD,MAAI,CAAC,KAAK;AACR,WAAO,oBAAI,IAAI,CAAC,aAAa,aAAa,QAAQ,CAAC;EACrD;AACA,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,MAAI,eAAe,OAAO;AACxB,WAAO,oBAAI,IAAI,CAAC,aAAa,aAAa,QAAQ,CAAC;EACrD;AACA,QAAM,SAAS,WACZ,MAAM,MAAM,EACZ,IAAI,CAAC,UAAU,MAAM,KAAI,CAAE,EAC3B,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AACrC,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,WAAW,6CAA6C,UAAU,KAAK;EACnF;AACA,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,SAAS,QAAQ;AAC1B,QAAI,UAAU,eAAe,UAAU,YAAY;AACjD,cAAQ,IAAI,WAAW;AACvB;IACF;AACA,QAAI,UAAU,eAAe,UAAU,YAAY;AACjD,cAAQ,IAAI,WAAW;AACvB;IACF;AACA,QAAI,UAAU,YAAY,UAAU,WAAW,UAAU,aAAa;AACpE,cAAQ,IAAI,QAAQ;AACpB;IACF;AACA,UAAM,IAAI,WAAW,4EAA4E,UAAU,KAAK;EAClH;AACA,SAAO;AACT;AAOA,SAAS,qBAAqB,OAAe,SAA0B;AACrE,MAAI;AACJ,aAAW,UAAU,SAAS;AAC5B,UAAM,WAAW,+BAA+B,OAAO,QAAQ,CAAC;AAChE,QAAI,aAAa,SAAS,SAAS,UAAa,WAAW,KAAK,WAAW;AACzE,aAAO,EAAE,QAAQ,SAAQ;IAC3B;EACF;AACA,SAAO,MAAM;AACf;AAEA,SAAS,UAAU,KAAuB;AACxC,MAAI,CAAC;AAAK,WAAO;AACjB,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,MAAI,CAAC,qBAAqB,SAAS,UAA0B,GAAG;AAC9D,UAAM,aAAa,qBAAqB,YAAY,oBAAoB;AACxE,UAAM,IAAI,WACR,gCAAgC,qBAAqB,KAAK,GAAG,CAAC,GAAG,aAAa,mBAAmB,UAAU,OAAO,GAAG,IACrH,UAAU,KAAK;EAEnB;AACA,SAAO;AACT;AAEA,SAAS,kBAAkB,KAAuB;AAChD,MAAI,CAAC;AAAK,WAAO;AACjB,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,MAAI,CAAC,uBAAuB,SAAS,UAAkC,GAAG;AACxE,UAAM,aAAa,qBAAqB,YAAY,sBAAsB;AAC1E,UAAM,IAAI,WACR,kCAAkC,uBAAuB,KAAK,GAAG,CAAC,GAAG,aAAa,mBAAmB,UAAU,OAAO,GAAG,IACzH,UAAU,KAAK;EAEnB;AACA,SAAO;AACT;AAKM,SAAU,4BAA4B,SAA0B,QAAqB;AACzF,QAAM,gBAAgB,kBAAkB,QAAQ,MAAM;AACtD,MAAI,OAAO,QAAQ,iBAAiB,kBAAkB,QAAQ;AAC5D,UAAM,IAAI,WAAW,qDAAqD,UAAU,KAAK;EAC3F;AACA,MAAI,OAAO,MAAM;AACf,WAAO;EACT;AACA,SAAO,iBAAiB;AAC1B;AAEA,SAASA,aAAY,KAAyB,gBAAqC;AACjF,MAAI,QAAQ;AAAW,WAAO;AAC9B,QAAM,aAAa,qBAAqB,KAAK,cAAc;AAC3D,MAAI,CAAC,YAAY;AACf,UAAM,kBAAkB,eAAe,YAAY,IAAI,CAAC,eAAe,WAAW,EAAE;AACpF,UAAM,IAAI,WAAW,yCAAyC,gBAAgB,KAAK,GAAG,CAAC,IAAI,UAAU,KAAK;EAC5G;AACA,SAAO;AACT;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,+DAA+D,UAAU,KAAK;EACrG;AACA,MAAI,eAAe,cAAc,eAAe,cAAc;AAC5D,UAAM,IAAI,WAAW,qCAAqC,GAAG,mCAAmC,UAAU,KAAK;EACjH;AACA,SAAO;AACT;AAEA,SAAS,YAAY,WAAiB;AACpC,SAAO,IAAI,KAAK,SAAS,EAAE,YAAW,EAAG,MAAM,GAAG,EAAE;AACtD;AASA,SAAS,cAAc,WAAmB,UAAwB;AAChE,MAAI,CAAC,YAAY,aAAa,OAAO;AACnC,WAAO,YAAY,SAAS;EAC9B;AACA,MAAI;AACF,UAAM,QAAQ,IAAI,KAAK,eAAe,SAAS;MAC7C,UAAU;MACV,MAAM;MACN,OAAO;MACP,KAAK;KACN,EAAE,cAAc,IAAI,KAAK,SAAS,CAAC;AACpC,UAAM,OAAO,MAAM,KAAK,CAAC,SAAS,KAAK,SAAS,MAAM,GAAG;AACzD,UAAM,QAAQ,MAAM,KAAK,CAAC,SAAS,KAAK,SAAS,OAAO,GAAG;AAC3D,UAAM,MAAM,MAAM,KAAK,CAAC,SAAS,KAAK,SAAS,KAAK,GAAG;AACvD,QAAI,QAAQ,SAAS,KAAK;AACxB,aAAO,GAAG,IAAI,IAAI,KAAK,IAAI,GAAG;IAChC;EACF,QAAQ;EAER;AACA,SAAO,YAAY,SAAS;AAC9B;AAEA,SAAS,cAAc,WAAiB;AACtC,QAAM,OAAO,IAAI,KAAK,SAAS;AAC/B,SAAO,IAAI,KAAK,KAAK,IAAI,KAAK,eAAc,GAAI,KAAK,YAAW,GAAI,KAAK,WAAU,GAAI,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,YAAW;AACjH;AAEA,SAAS,WAAW,WAAmB,MAAY;AACjD,QAAM,OAAO,IAAI,KAAK,SAAS;AAC/B,SAAO,IAAI,KAAK,KAAK,QAAO,IAAK,OAAO,KAAK,KAAK,KAAK,GAAI,EAAE,YAAW;AAC1E;AAEA,SAAS,qBAAqB,WAAiB;AAC7C,QAAM,OAAO,IAAI,KAAK,cAAc,SAAS,CAAC;AAC9C,QAAM,MAAM,KAAK,UAAS;AAC1B,QAAM,QAAQ,QAAQ,IAAI,KAAK,IAAI;AACnC,SAAO,WAAW,KAAK,YAAW,GAAI,KAAK;AAC7C;AAEA,SAAS,gBAAgB,WAAiB;AACxC,QAAM,OAAO,IAAI,KAAK,SAAS;AAC/B,SAAO,IAAI,KAAK,KAAK,IAAI,KAAK,eAAc,GAAI,KAAK,YAAW,GAAI,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,YAAW;AACjG;AAEA,SAAS,oBAAoB,WAAiB;AAC5C,QAAM,OAAO,IAAI,KAAK,SAAS;AAC/B,SAAO,IAAI,KAAK,KAAK,IAAI,KAAK,eAAc,GAAI,KAAK,YAAW,IAAK,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,YAAW;AACrG;AAEA,SAAS,aAAa,MAAc,OAAa;AAC/C,SAAO,wBAAwB,MAAM,KAAK,KAAK,IAAI,OAAO;AAC5D;AAEA,SAAS,oBAAoB,QAA2B;AACtD,SAAO,OAAO,YAAY,CAAC,GAAG,OAAO,QAAO,CAAE,EAAE,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MAAM,KAAK,cAAc,KAAK,CAAC,CAAC;AACtG;AAEA,SAAS,eAAe,QAA6B,KAAW;AAC9D,SAAO,IAAI,MAAM,OAAO,IAAI,GAAG,KAAK,KAAK,CAAC;AAC5C;AAEA,SAAS,+BAA+B,MAAgC;AACtE,MAAI,CAAC,MAAM;AACT,WAAO;EACT;AACA,QAAM,QAAkB,CAAC,QAAQ,KAAK,IAAI,EAAE;AAC5C,MAAI,KAAK,aAAa,QAAW;AAC/B,UAAM,KAAK,YAAY,KAAK,QAAQ,EAAE;EACxC;AACA,MAAI,KAAK,UAAU,QAAW;AAC5B,UAAM,KAAK,SAAS,KAAK,KAAK,EAAE;EAClC;AACA,MAAI,KAAK,OAAO;AACd,UAAM,KAAK,SAAS,KAAK,KAAK,EAAE;EAClC;AACA,MAAI,KAAK,cAAc,KAAK,WAAW,SAAS,GAAG;AACjD,UAAM,WAAW,CAAC,GAAG,KAAK,UAAU,EAAE,KAAK,CAAC,MAAM,UAAU,kBAAkB,IAAI,IAAI,kBAAkB,KAAK,CAAC;AAC9G,UAAM,KAAK,cAAc,SAAS,KAAK,GAAG,CAAC,EAAE;EAC/C;AACA,MAAI,KAAK,gBAAgB,KAAK,aAAa,SAAS,GAAG;AACrD,UAAM,YAAY,CAAC,GAAG,KAAK,YAAY,EAAE,KAAK,CAAC,MAAM,UAAU,OAAO,KAAK;AAC3E,UAAM,KAAK,gBAAgB,UAAU,KAAK,GAAG,CAAC,EAAE;EAClD;AACA,MAAI,KAAK,WAAW,KAAK,QAAQ,SAAS,GAAG;AAC3C,UAAM,UAAU,CAAC,GAAG,KAAK,OAAO,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACjF,UAAM,KAAK,WAAW,QAAQ,KAAK,GAAG,CAAC,EAAE;EAC3C;AACA,SAAO,MAAM,KAAK,GAAG;AACvB;AAEA,SAAS,kBAAkB,MAAc,OAAe,KAAa,YAAgB;AACnF,QAAM,YAAY,IAAI,KACpB,KAAK,IACH,MACA,OACA,KACA,WAAW,YAAW,GACtB,WAAW,cAAa,GACxB,WAAW,cAAa,GACxB,WAAW,mBAAkB,CAAE,CAChC;AAEH,MAAI,UAAU,eAAc,MAAO,QAAQ,UAAU,YAAW,MAAO,SAAS,UAAU,WAAU,MAAO,KAAK;AAC9G,WAAO;EACT;AACA,SAAO,UAAU,YAAW;AAC9B;AAEA,SAAS,aAAa,WAAiB;AACrC,SAAO,mBAAmB,IAAI,KAAK,SAAS,EAAE,UAAS,CAAE;AAC3D;AAEA,SAAS,oBAAoB,WAAiB;AAC5C,QAAM,SAAS,KAAK,MAAM,SAAS;AACnC,SAAO,OAAO,SAAS,MAAM,IAAI,IAAI,KAAK,MAAM,EAAE,YAAW,IAAK;AACpE;AAEA,SAAS,wBAAwB,SAAsC;AACrE,QAAM,WAAW,oBAAI,IAAG;AACxB,aAAW,UAAU,WAAW,CAAA,GAAI;AAClC,UAAM,aAAa,oBAAoB,MAAM;AAC7C,QAAI,YAAY;AACd,eAAS,IAAI,UAAU;IACzB;EACF;AACA,SAAO;AACT;AAEA,SAAS,0BACP,OACA,KACA,UACA,cACA,eAAiC;AAEjC,QAAM,cAAc,SAAS,WAAW,UAAU,EAAE,gBAAgB,iCAAiC;AACrG,QAAM,YAAY,OAAO,WAAW,SAAS,UAAU,iBAAiB,iCAAiC;AACzG,SAAO;IACL,OAAO;IACP,KAAK,wBAAwB,WAAW,WAAW,IAAI,IAAI,YAAY,WAAW,aAAa,CAAC;;AAEpG;AAmBA,SAAS,gCACP,SACA,YACA,QACA,iBAAmC;AAGnC,QAAM,qBAAqB,WAAW,eAAe,SAAY,CAAC,GAAG,WAAW,UAAU,IAAI,CAAC,aAAa,OAAO,CAAC;AACpH,QAAM,sBACJ,WAAW,iBAAiB,SAAY,CAAC,GAAG,WAAW,YAAY,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,WAAU,CAAE;AACxG,SAAO;IACL;IACA,WAAW,IAAI,KAAK,OAAO;IAC3B;IACA,gBAAgB,mBAAmB;IACnC,UAAU,WAAW,YAAY;IACjC,YAAY,WAAW,SAAS,OAAO;IACvC,OAAO,WAAW;IAClB,UAAU,wBAAwB,WAAW,OAAO;IACpD,eAAe,WAAW,eAAe,SAAY,IAAI,IAAI,WAAW,UAAU,IAAI;IACtF,gBAAgB,WAAW,iBAAiB,SAAY,IAAI,IAAI,WAAW,YAAY,IAAI;IAC3F,gBAAgB,CAAC,GAAG,IAAI,IAAI,kBAAkB,CAAC,EAAE,KAC/C,CAAC,MAAM,UAAU,kBAAkB,IAAI,IAAI,kBAAkB,KAAK,CAAC;IAErE,iBAAiB,CAAC,GAAG,IAAI,IAAI,mBAAmB,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,OAAO,KAAK;IACrF,aAAa,CAAA;IACb,UAAU;;AAEd;AAEA,SAAS,2BAA2B,SAAqC,aAAmB;AAC1F,MAAI,wBAAwB,aAAa,QAAQ,OAAO,IAAI,GAAG;AAC7D,WAAO;EACT;AACA,MAAI,QAAQ,SAAS,wBAAwB,aAAa,QAAQ,KAAK,IAAI,GAAG;AAC5E,WAAO;EACT;AACA,MAAI,wBAAwB,aAAa,QAAQ,OAAO,GAAG,KAAK,GAAG;AACjE,WAAO;EACT;AACA,MAAI,QAAQ,SAAS,IAAI,WAAW,GAAG;AACrC,WAAO;EACT;AACA,UAAQ,YAAY;AACpB,MAAI,wBAAwB,aAAa,QAAQ,OAAO,KAAK,KAAK,GAAG;AACnE,YAAQ,YAAY,KAAK,WAAW;EACtC;AACA,SAAO,QAAQ,YAAY,QAAQ,cAAc,QAAQ,YAAY,UAAU,QAAQ,iBAAiB,SAAS;AACnH;AAEA,SAAS,4BAA4B,SAAqC,aAAmB;AAC3F,QAAM,mBAAmB,aAAa,WAAW;AACjD,QAAM,oBAAoB,IAAI,KAAK,WAAW,EAAE,WAAU;AAC1D,QAAM,iBAAiB,CAAC,QAAQ,iBAAiB,QAAQ,cAAc,IAAI,gBAAgB;AAC3F,QAAM,kBAAkB,CAAC,QAAQ,kBAAkB,QAAQ,eAAe,IAAI,iBAAiB;AAC/F,SAAO,kBAAkB;AAC3B;AAEA,SAAS,uBAAuB,SAAmC;AACjE,MAAI,cAAc,QAAQ;AAC1B,WAAS,YAAY,GAAG,YAAY,QAAQ,gBAAgB,aAAa,GAAG;AAC1E,QAAI,4BAA4B,SAAS,WAAW,KAAK,2BAA2B,SAAS,WAAW,MAAM,QAAQ;AACpH;IACF;AACA,kBAAc,WAAW,aAAa,QAAQ,QAAQ;EACxD;AACA,SAAO,QAAQ;AACjB;AAEA,SAAS,uBAAuB,SAAqC,oBAA4B,SAAe;AAC9G,QAAM,YAAY,kBAAkB,OAAqD;AACzF,QAAM,eAAe,WAAW,oBAAoB,SAAS;AAC7D,QAAM,UAAU,IAAI,KAAK,YAAY;AACrC,SAAO,IAAI,KACT,KAAK,IACH,QAAQ,eAAc,GACtB,QAAQ,YAAW,GACnB,QAAQ,WAAU,GAClB,QAAQ,UAAU,YAAW,GAC7B,QAAQ,UAAU,cAAa,GAC/B,QAAQ,UAAU,cAAa,GAC/B,QAAQ,UAAU,mBAAkB,CAAE,CACvC,EACD,YAAW;AACf;AAEA,SAAS,wBAAwB,SAAmC;AAClE,QAAM,YAAY,qBAAqB,QAAQ,OAAO;AACtD,WAAS,OAAO,GAAG,OAAO,QAAQ,gBAAgB,QAAQ,GAAG;AAC3D,UAAM,qBAAqB,WAAW,WAAW,OAAO,QAAQ,WAAW,CAAC;AAC5E,eAAW,WAAW,QAAQ,gBAAgB;AAC5C,YAAM,cAAc,uBAAuB,SAAS,oBAAoB,OAAO;AAC/E,UAAI,CAAC,4BAA4B,SAAS,WAAW,GAAG;AACtD;MACF;AACA,UAAI,2BAA2B,SAAS,WAAW,MAAM,QAAQ;AAC/D,eAAO,QAAQ;MACjB;IACF;EACF;AACA,SAAO,QAAQ;AACjB;AAEA,SAAS,yBAAyB,SAAmC;AACnE,QAAM,YAAY,QAAQ,UAAU,eAAc;AAClD,QAAM,aAAa,QAAQ,UAAU,YAAW;AAChD,WAAS,OAAO,GAAG,OAAO,QAAQ,gBAAgB,QAAQ,GAAG;AAC3D,UAAM,cAAc,IAAI,KAAK,KAAK,IAAI,WAAW,aAAa,OAAO,QAAQ,UAAU,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;AACrG,eAAW,YAAY,QAAQ,iBAAiB;AAC9C,YAAM,cAAc,kBAAkB,YAAY,eAAc,GAAI,YAAY,YAAW,GAAI,UAAU,QAAQ,SAAS;AAC1H,UAAI,CAAC,eAAe,CAAC,4BAA4B,SAAS,WAAW,GAAG;AACtE;MACF;AACA,UAAI,2BAA2B,SAAS,WAAW,MAAM,QAAQ;AAC/D,eAAO,QAAQ;MACjB;IACF;EACF;AACA,SAAO,QAAQ;AACjB;AAEA,SAAS,wBAAwB,SAAmC;AAClE,QAAM,OAAO,QAAQ,UAAU,eAAc;AAC7C,QAAM,QAAQ,QAAQ,UAAU,YAAW;AAC3C,WAAS,OAAO,GAAG,OAAO,QAAQ,gBAAgB,QAAQ,GAAG;AAC3D,UAAM,gBAAgB,OAAO,OAAO,QAAQ;AAC5C,eAAW,YAAY,QAAQ,iBAAiB;AAC9C,YAAM,cAAc,kBAAkB,eAAe,OAAO,UAAU,QAAQ,SAAS;AACvF,UAAI,CAAC,eAAe,CAAC,4BAA4B,SAAS,WAAW,GAAG;AACtE;MACF;AACA,UAAI,2BAA2B,SAAS,WAAW,MAAM,QAAQ;AAC/D,eAAO,QAAQ;MACjB;IACF;EACF;AACA,SAAO,QAAQ;AACjB;AAEA,SAAS,2BACP,SACA,YACA,QACA,iBAAmC;AAEnC,QAAM,UAAU,gCAAgC,SAAS,YAAY,QAAQ,eAAe;AAC5F,MAAI,WAAW,SAAS,SAAS;AAC/B,WAAO,uBAAuB,OAAO;EACvC;AAEA,MAAI,WAAW,SAAS,UAAU;AAChC,WAAO,wBAAwB,OAAO;EACxC;AAEA,MAAI,WAAW,SAAS,WAAW;AACjC,WAAO,yBAAyB,OAAO;EACzC;AAEA,SAAO,wBAAwB,OAAO;AACxC;AAEA,SAAS,WAAW,QAAqB;AACvC,SAAO,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAK;AAC/B,UAAM,OAAO,wBAAwB,EAAE,IAAI,EAAE,EAAE;AAC/C,QAAI,SAAS;AAAG,aAAO;AACvB,UAAM,aAAa,EAAE,gBAAgB,EAAE;AACvC,QAAI,eAAe;AAAG,aAAO;AAC7B,UAAM,OAAO,EAAE,QAAQ,cAAc,EAAE,OAAO;AAC9C,QAAI,SAAS;AAAG,aAAO;AACvB,UAAM,SAAS,EAAE,KAAK,cAAc,EAAE,IAAI;AAC1C,QAAI,WAAW;AAAG,aAAO;AACzB,UAAM,eAAe,OAAO,EAAE,WAAW,EAAE,cAAc,OAAO,EAAE,WAAW,CAAC;AAC9E,QAAI,iBAAiB;AAAG,aAAO;AAC/B,WAAO,OAAO,EAAE,aAAa,EAAE,cAAc,OAAO,EAAE,aAAa,CAAC;EACtE,CAAC;AACH;AAEA,SAAS,yBAAyB,MAAqB;AAIrD,SAAO;IACL,SAAS,KAAK;IACd,YAAY,KAAK;IACjB,WAAW,KAAK;IAChB,aAAa,KAAK;IAClB,eAAe,KAAK;IACpB,eAAe,KAAK,YAAY;IAChC,eAAe,KAAK,YAAY;IAChC,WAAW,KAAK;;AAEpB;AAEA,SAAS,iBAAiB,MAAqB;AAC7C,MAAI,CAAC,KAAK,UAAU;AAClB,WAAO;EACT;AACA,SAAO;IACL,IAAI,KAAK;IACT,MAAM,YAAY,KAAK,QAAQ;IAC/B,MAAM;IACN,eAAe;IACf,aAAa;IACb,WAAW;IACX,gBAAgB;IAChB,eAAe;IACf,gBAAgB;IAChB,iBAAiB;IACjB,uBAAuB;IACvB,GAAG,yBAAyB,IAAI;IAChC,eAAe,KAAK;;AAExB;AAEA,SAAS,kBAAkB,MAAqB;AAC9C,UAAQ,KAAK,aAAa,CAAA,GAAI,IAAI,CAAC,cAAc;IAC/C,IAAI,SAAS;IACb,MAAM,YAAY,SAAS,EAAE;IAC7B,MAAM;IACN,eAAe,SAAS;IACxB,aAAa;IACb,WAAW;IACX,gBAAgB;IAChB,eAAe;IACf,gBAAgB;IAChB,iBAAiB;IACjB,uBAAuB;IACvB,GAAG,yBAAyB,IAAI;IAChC;AACJ;AAEA,SAAS,oBAAoB,SAAiB,OAAyB;AACrE,MAAI,CAAC,OAAO;AACV,WAAO;EACT;AACA,QAAM,WAAW,KAAK,MAAM,KAAK,IAAI,KAAK,MAAM,OAAO;AACvD,SAAO,OAAO,SAAS,QAAQ,KAAK,WAAW,IAAI,WAAW;AAChE;AAEA,SAAS,mBACP,cACA,OACA,YAAyB;AAEzB,SAAO,MAAM,cAAc,eAAe,OACtC,IAAI,KAAK,IAAI,KAAK,YAAY,EAAE,QAAO,IAAK,UAAU,EAAE,YAAW,IAClE,MAAM,UAAU;AACvB;AAEA,SAAS,wBACP,MACA,OACA,iBACA,iBAAmC;AAEnC,QAAM,wBAAwB,+BAA+B,MAAM,UAAU;AAC7E,QAAM,aAAa,oBAAoB,MAAM,UAAU,MAAM,MAAM;AACnE,QAAM,cAAc,MAAM,aACtB,2BAA2B,MAAM,UAAU,MAAM,YAAY,iBAAiB,eAAe,IAC7F,CAAC,MAAM,QAAQ;AACnB,SAAO,YAAY,IAAI,CAAC,kBAAkB;IACxC,IAAI;;;;IAIJ,MAAM,MAAM,YAAY,OAAO,aAAa,MAAM,GAAG,EAAE,IAAI,cAAc,cAAc,MAAM,QAAQ;IACrG,MAAM;IACN,eAAe,MAAM,eAAe;IACpC,aAAa,MAAM,SAAS,KAAK;IACjC,WAAW,mBAAmB,cAAc,OAAO,UAAU;IAC7D,gBAAgB,MAAM,YAAY;IAClC,eAAe,MAAM,WAAW;IAChC,gBAAgB,MAAM,YAAY;IAClC,iBAAiB,MAAM,aAAa,OAAO;IAC3C,uBAAuB;IACvB,GAAG,yBAAyB,IAAI;IAChC;AACJ;AAEA,SAAS,eACP,OACA,iBACA,gBACA,iBAAmC;AAEnC,QAAM,SAAwB,CAAA;AAC9B,aAAW,QAAQ,OAAO;AACxB,UAAM,cAAc,eAAe,IAAI,WAAW,IAAI,iBAAiB,IAAI,IAAI;AAC/E,QAAI,aAAa;AACf,aAAO,KAAK,WAAW;IACzB;AACA,QAAI,eAAe,IAAI,WAAW,GAAG;AACnC,aAAO,KAAK,GAAG,kBAAkB,IAAI,CAAC;IACxC;AACA,eAAW,SAAS,eAAe,IAAI,QAAQ,IAAK,KAAK,UAAU,CAAA,IAAM,CAAA,GAAI;AAC3E,aAAO,KAAK,GAAG,wBAAwB,MAAM,OAAO,iBAAiB,eAAe,CAAC;IACvF;EACF;AACA,SAAO,WAAW,MAAM;AAC1B;AAEA,SAAS,YACP,OACA,SACA,cACA,gBACA,qBAA4C;AAE5C,QAAM,aAAa,UAAU,QAAQ,MAAM,YAAY;AACvD,QAAM,YAAY,QAAQ,KAAK,KAAI,EAAG,YAAW;AACjD,QAAM,iBAAiB,cAAc,QAAQ,QAAQ;AACrD,QAAM,eAAeA,aAAY,QAAQ,QAAQ,cAAc;AAC/D,QAAM,iBAAiB,QAAQ,UAAU,KAAI;AAC7C,QAAM,qBAAqB,oBAAoB,QAAQ,cAAc;AACrE,QAAM,eAAe,QAAQ,QAAQ,KAAI;AACzC,QAAM,gBAAgB,QAAQ,SAAS,KAAI;AAE3C,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;AAEA,SAAO,MAAM,OAAO,CAAC,SACnB,2BAA2B,MAAM;IAC/B;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;GACD,CAAC;AAEN;AAEA,SAAS,2BACP,MACA,SAUC;AAED,SACE,mCAAmC,MAAM,OAAO,KAChD,gCAAgC,MAAM,OAAO,KAC7C,sBAAsB,MAAiC,QAAQ,mBAAmB;AAEtF;AAEA,SAAS,mCACP,MACA,SAAyD;AAEzD,MAAI,QAAQ,cAAc,KAAK,SAAS,QAAQ;AAAY,WAAO;AACnE,MAAI,QAAQ,aAAa,CAAC,KAAK,KAAK,KAAK,CAAC,QAAQ,IAAI,KAAI,EAAG,YAAW,MAAO,QAAQ,SAAS;AAAG,WAAO;AAC1G,MAAI,QAAQ,mBAAmB,UAAa,KAAK,aAAa,QAAQ;AAAgB,WAAO;AAC7F,MAAI,QAAQ,gBAAgB,KAAK,WAAW,QAAQ;AAAc,WAAO;AACzE,SAAO;AACT;AAEA,SAAS,gCACP,MACA,SAAyD;AAEzD,MAAI,QAAQ,uBAAuB,cAAc,CAAC,KAAK;AAAU,WAAO;AACxE,MAAI,QAAQ,uBAAuB,gBAAgB,KAAK;AAAU,WAAO;AACzE,MAAI,QAAQ,mBAAmB,UAAa,KAAK,aAAa,QAAQ;AAAgB,WAAO;AAC7F,MAAI,QAAQ,iBAAiB,UAAa,KAAK,WAAW,QAAQ;AAAc,WAAO;AACvF,MAAI,QAAQ,kBAAkB,UAAa,KAAK,YAAY,QAAQ;AAAe,WAAO;AAC1F,SAAO;AACT;AAEA,SAAS,qBAAqB,OAAoB,OAA2B,KAAuB;AAClG,MAAI,SAAS,wBAAwB,MAAM,IAAI,KAAK,IAAI,GAAG;AACzD,WAAO;EACT;AACA,MAAI,OAAO,wBAAwB,MAAM,IAAI,GAAG,KAAK,GAAG;AACtD,WAAO;EACT;AACA,SAAO;AACT;AAEA,SAAS,6BAA6B,KAAa,UAAkB,YAAwC;AAC3G,MAAI,IAAI,KAAI,EAAG,YAAW,MAAO,SAAS;AACxC,WAAO,cAAc,QAAQ;EAC/B;AACA,SAAO,qBAAqB,KAAK,IAAI,KAAK,QAAQ,GAAG,UAAU;AACjE;AAEA,SAAS,WACP,MACA,SACA,UAAgB;AAShB,QAAM,SAAS,QAAQ,OAAO,6BAA6B,QAAQ,MAAM,UAAU,QAAQ,IAAI;AAC/F,QAAM,cAAc,QAAQ,SAAS;AACrC,QAAM,sBAAsB,QAAQ,eAAe;AAEnD,QAAM,OAAO,QAAQ,OAAO,6BAA6B,QAAQ,MAAM,UAAU,QAAQ,IAAI;AAC7F,QAAM,KAAK,QAAQ,KAAK,6BAA6B,QAAQ,IAAI,UAAU,MAAM,IAAI;AACrF,MAAI,QAAQ,MAAM,wBAAwB,MAAM,EAAE,KAAK,GAAG;AACxD,UAAM,IAAI,WAAW,uCAAuC,UAAU,KAAK;EAC7E;AAEA,MAAI,SAAS,aAAa,QAAQ,SAAS,UAAa,QAAQ,OAAO,SAAY;AACjF,UAAM,IAAI,WAAW,wDAAwD,UAAU,KAAK;EAC9F;AAEA,MAAI,SAAS,UAAU;AACrB,WAAO,iBAAiB,QAAQ,SAAS,UAAU,aAAa,qBAAqB,MAAM,EAAE;EAC/F;AAEA,MAAI,SAAS,OAAO;AAClB,UAAM,WAAW,cAAc,MAAM;AACrC,WAAO,sBAAsB,QAAQ,UAAU,aAAa,qBAAqB,UAAU,WAAW,UAAU,CAAC,CAAC;EACpH;AAEA,MAAI,SAAS,QAAQ;AACnB,UAAM,YAAY,qBAAqB,MAAM;AAC7C,WAAO,sBAAsB,QAAQ,UAAU,aAAa,qBAAqB,WAAW,WAAW,WAAW,CAAC,CAAC;EACtH;AAEA,QAAM,aAAa,gBAAgB,MAAM;AACzC,SAAO,sBAAsB,QAAQ,UAAU,aAAa,qBAAqB,YAAY,oBAAoB,MAAM,CAAC;AAC1H;AAEA,SAAS,iBACP,QACA,SACA,UACA,aACA,qBACA,MACA,IAAsB;AAEtB,MAAI,qBAAqB;AACvB,UAAM,IAAI,WACR,uGACA,UAAU,KAAK;EAEnB;AACA,SAAO;IACL;IACA,OAAO,SAAS,QAAQ,OAAO,SAAS,cAAc,SAAY;IAClE,KAAK;IACL,YAAY;;AAEhB;AAEA,SAAS,sBACP,QACA,UACA,aACA,qBACA,aACA,WAAiB;AAEjB,QAAM,aAAa,eAAe;AAClC,SAAO;IACL;IACA,OAAO,aAAa,cAAc,aAAa,aAAa,QAAQ;IACpE,KAAK;IACL;IACA;IACA;;AAEJ;AAEA,SAAS,kBAAkB,QAAqB;AAC9C,QAAM,SAAS,oBAAI,IAAG;AACtB,aAAW,SAAS,QAAQ;AAC1B,UAAM,OAAO,OAAO,IAAI,MAAM,IAAI,KAAK,CAAA;AACvC,SAAK,KAAK,KAAK;AACf,WAAO,IAAI,MAAM,MAAM,IAAI;EAC7B;AACA,SAAO,CAAC,GAAG,OAAO,QAAO,CAAE,EACxB,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MAAM,KAAK,cAAc,KAAK,CAAC,EACnD,IAAI,CAAC,CAAC,MAAM,SAAS,OAAO;IAC3B;IACA,OAAO,UAAU;IACjB,QAAQ,WAAW,SAAS;IAC5B;AACN;AAEA,SAAS,UAAU,QAAqB;AACtC,QAAM,UAAU,oBAAI,IAAG;AACvB,QAAM,SAAS,oBAAI,IAAG;AACtB,QAAM,WAAW,oBAAI,IAAG;AACxB,MAAI,YAAY;AAChB,MAAI,YAAY;AAChB,MAAI,YAAY;AAChB,MAAI,kBAAkB;AACtB,aAAW,SAAS,QAAQ;AAC1B,YAAQ,IAAI,MAAM,OAAO;AACzB,mBAAe,QAAQ,MAAM,SAAS;AACtC,mBAAe,UAAU,MAAM,WAAW;AAC1C,QAAI,MAAM,SAAS,YAAY;AAC7B,mBAAa;IACf,WAAW,MAAM,SAAS,YAAY;AACpC,mBAAa;IACf,OAAO;AACL,mBAAa;AACb,UAAI,MAAM,oBAAoB,MAAM;AAClC,2BAAmB;MACrB;IACF;EACF;AACA,SAAO;IACL,QAAQ,OAAO;IACf,OAAO,QAAQ;IACf;IACA;IACA;IACA,SAAS;MACP,UAAU;MACV,UAAU;MACV,OAAO;;IAET,SAAS,oBAAoB,MAAM;IACnC,WAAW,oBAAoB,QAAQ;IACvC,kBAAkB;;AAEtB;AAEA,SAAS,aAAa,OAA8B;AAClD,QAAM,QAAQ,MAAM,SAAS;AAC7B,QAAM,MAAM,MAAM,OAAO;AACzB,SAAO,GAAG,KAAK,OAAO,GAAG;AAC3B;AAEA,SAAS,YAAY,WAAmB,UAAwB;AAC9D,MAAI,YAAY,aAAa,OAAO;AAClC,QAAI;AACF,YAAM,QAAQ,IAAI,KAAK,eAAe,SAAS;QAC7C,UAAU;QACV,MAAM;QACN,QAAQ;QACR,WAAW;OACZ,EAAE,cAAc,IAAI,KAAK,SAAS,CAAC;AACpC,YAAM,OAAO,MAAM,KAAK,CAAC,SAAS,KAAK,SAAS,MAAM,GAAG;AACzD,YAAM,SAAS,MAAM,KAAK,CAAC,SAAS,KAAK,SAAS,QAAQ,GAAG;AAC7D,UAAI,QAAQ,QAAQ;AAElB,eAAO,GAAG,IAAI,IAAI,MAAM;MAC1B;IACF,QAAQ;IAER;EACF;AACA,SAAO,GAAG,IAAI,KAAK,SAAS,EAAE,YAAW,EAAG,MAAM,IAAI,EAAE,CAAC;AAC3D;AAEA,SAAS,yBAAyB,QAA8B;AAC9D,QAAM,UAAU,OAAO,QAAQ,MAAM;AACrC,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;EACT;AACA,SAAO,QAAQ,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,GAAG,GAAG,IAAI,KAAK,EAAE,EAAE,KAAK,IAAI;AACnE;AAEA,SAAS,eAAe,OAAkB;AACxC,MAAI,CAAC,MAAM,WAAW;AACpB,WAAO;EACT;AACA,MAAI,MAAM,kBAAkB,MAAM;AAChC,WAAO,MAAM,UAAU,MAAM,GAAG,EAAE;EACpC;AACA,MAAI,MAAM,SAAS,cAAc,MAAM,WAAW,MAAM,cAAc,GAAG;AACvE,WAAO,YAAY,MAAM,WAAW,MAAM,cAAc;EAC1D;AACA,SAAO,MAAM;AACf;AAEA,SAAS,gBAAgB,OAAkB;AACzC,QAAM,OAAO,GAAG,YAAY,MAAM,IAAI,MAAM,cAAc,CAAC,KAAK,MAAM,IAAI,KAAK,MAAM,OAAO,SAAS,MAAM,SAAS,KAAK,MAAM,aAAa,IAAI,MAAM,WAAW,IAAI,MAAM,UAAU;AACrL,MAAI,MAAM,SAAS,YAAY;AAC7B,UAAM,eAAe,MAAM,iBAAiB;AAC5C,WAAO,GAAG,IAAI,WAAM,YAAY,aAAa,KAAK,UAAU,YAAY,CAAC;EAC3E;AACA,MAAI,MAAM,SAAS,SAAS;AAC1B,UAAM,UAAoB,CAAA;AAC1B,UAAM,QAAQ,MAAM,eAAe,MAAM;AACzC,UAAM,eAAe,MAAM,gBAAgB,QAAQ,MAAM,gBAAgB,MAAM;AAC/E,QAAI,cAAc;AAChB,cAAQ,KAAK,KAAK;AAClB,cAAQ,KAAK,SAAS,KAAK,UAAU,KAAK,CAAC,EAAE;IAC/C;AACA,QAAI,MAAM,iBAAiB;AACzB,cAAQ,KAAK,aAAa;AAC1B,cAAQ,KAAK,gBAAgB;IAC/B;AACA,UAAM,MAAM,eAAe,KAAK;AAChC,QAAI,KAAK;AACP,cAAQ,KAAK,OAAO,GAAG,EAAE;IAC3B;AACA,QAAI,MAAM,kBAAkB,MAAM;AAChC,cAAQ,KAAK,WAAW,MAAM,gBAAgB,SAAS,OAAO,EAAE;IAClE;AACA,QAAI,MAAM,gBAAgB;AACxB,cAAQ,KAAK,YAAY,MAAM,cAAc,EAAE;IACjD;AACA,QAAI,MAAM,gBAAgB;AACxB,cAAQ,KAAK,KAAK,MAAM,cAAc,EAAE;AACxC,cAAQ,KAAK,YAAY,KAAK,UAAU,MAAM,cAAc,CAAC,EAAE;IACjE;AACA,QAAI,MAAM,uBAAuB;AAC/B,cAAQ,KAAK,cAAc,MAAM,qBAAqB,EAAE;IAC1D;AACA,QAAI,MAAM,eAAe;AACvB,cAAQ,KAAK,eAAe,KAAK,UAAU,MAAM,aAAa,CAAC,EAAE;IACnE;AACA,WAAO,GAAG,IAAI,WAAM,QAAQ,KAAK,GAAG,CAAC;EACvC;AACA,SAAO;AACT;AAKM,SAAU,uBAAuB,QAAsB;AAC3D,QAAM,QAAkB,CAAA;AACxB,QAAM,KAAK,kBAAkB,OAAO,IAAI,GAAG;AAC3C,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,UAAU,OAAO,GAAG,EAAE;AACjC,QAAM,KAAK,aAAa,aAAa,OAAO,KAAK,CAAC,EAAE;AACpD,MAAI,OAAO,MAAM,gBAAgB,OAAO,MAAM,YAAY;AACxD,UAAM,KAAK,aAAa,OAAO,MAAM,YAAY,OAAO,OAAO,MAAM,UAAU,EAAE;AACjF,UAAM,KAAK,kBAAkB,OAAO,MAAM,cAAc,gBAAgB,eAAe,EAAE;EAC3F;AACA,QAAM,KACJ,aAAa,OAAO,QAAQ,MAAM,gBAAgB,OAAO,QAAQ,SAAS,gBAAgB,OAAO,QAAQ,SAAS,gBAAgB,OAAO,QAAQ,SAAS,GAAG;AAE/J,QAAM,KAAK,YAAY,OAAO,QAAQ,KAAK,EAAE;AAC7C,QAAM,KAAK,cAAc,yBAAyB,OAAO,QAAQ,OAAO,CAAC,EAAE;AAC3E,QAAM,KAAK,cAAc,yBAAyB,OAAO,QAAQ,OAAO,CAAC,EAAE;AAC3E,QAAM,KAAK,gBAAgB,yBAAyB,OAAO,QAAQ,SAAS,CAAC,EAAE;AAC/E,QAAM,KAAK,uBAAuB,OAAO,QAAQ,gBAAgB,EAAE;AACnE,QAAM,KAAK,EAAE;AAEb,MAAI,OAAO,OAAO,WAAW,GAAG;AAC9B,UAAM,KAAK,kDAAkD;AAC7D,WAAO,MAAM,KAAK,IAAI;EACxB;AAEA,aAAW,OAAO,OAAO,MAAM;AAC7B,UAAM,KAAK,MAAM,IAAI,IAAI,KAAK,IAAI,KAAK,GAAG;AAC1C,eAAW,SAAS,IAAI,QAAQ;AAC9B,YAAM,KAAK,KAAK,gBAAgB,KAAK,CAAC,EAAE;IAC1C;AACA,UAAM,KAAK,EAAE;EACf;AACA,MAAI,OAAO,YAAY,OAAO,SAAS,SAAS,GAAG;AACjD,UAAM,KAAK,cAAc;AACzB,eAAW,WAAW,OAAO,UAAU;AACrC,YAAM,KAAK,KAAK,OAAO,EAAE;IAC3B;AACA,UAAM,KAAK,EAAE;EACf;AACA,SAAO,qBAAqB,MAAM,KAAK,IAAI,CAAC;AAC9C;AASM,SAAU,mBAAmB,QAAsB;AACvD,SAAO,WAAW,MAAqD;AACzE;AAEA,SAAS,qBAAqB,OAAa;AACzC,MAAI,MAAM,MAAM;AAChB,SAAO,MAAM,KAAK,MAAM,MAAM,CAAC,MAAM,MAAM;AACzC,WAAO;EACT;AACA,SAAO,MAAM,MAAM,GAAG,GAAG;AAC3B;AAcA,SAAS,+BAA+B,SAAwB;AAC9D,QAAM,WAAW,OAAM;AACvB,QAAM,OAAO,UAAU,QAAQ,IAAI;AACnC,QAAM,cAAc,WAAW,MAAM,SAAS,QAAQ;AACtD,QAAM,QAAQ,kBAAkB,QAAQ,KAAK;AAC7C,QAAM,iBAAiB,oBAAoB,QAAQ,OAAO;AAC1D,QAAM,oBAAoB,wBAAwB,QAAQ,yBAAyB,oCAAoC;AACvH,QAAM,yBAAyB,wBAAwB,QAAQ,wBAAwB,mCAAmC;AAC1H,QAAM,kBAAkB,wBAAwB,QAAQ,iBAAiB,2BAA2B;AACpG,MAAI,oBAAoB,UAAa,kBAAkB,GAAG;AACxD,UAAM,IAAI,WAAW,0CAA0C,UAAU,KAAK;EAChF;AACA,QAAM,aAAa,eAAe,IAAI,QAAQ,KAAK,CAAC,eAAe,IAAI,WAAW,KAAK,CAAC,eAAe,IAAI,WAAW;AACtH,QAAM,oBACJ,QAAQ,OAAO,UACf,sBAAsB,UACtB,2BAA2B,UAC3B,oBAAoB;AACtB,QAAM,uBAAuB,cAAc,CAAC;AAC5C,SAAO;IACL;IACA;IACA;IACA;IACA;IACA;IACA,yBAAyB,uBAAuB,qCAAqC;IACrF,8BAA8B,wBAAwB,2BAA2B,SAAY,IAAI;IACjG;;AAEJ;AAEA,SAAS,yBAAyB,UAAoB,YAAmB;AACvE,MAAI,CAAC,YAAY;AACf;EACF;AACA,WAAS,KACP,8DAA8D,kCAAkC,yFAAyF;AAE7L;AAEA,SAAS,2BACP,SACA,qBAA4C;AAE5C,SAAO;IACL,MAAM,QAAQ,QAAQ;IACtB,KAAK,QAAQ,OAAO;IACpB,UAAU,QAAQ,YAAY;IAC9B,QAAQ,QAAQ,UAAU;IAC1B,UAAU,QAAQ,YAAY;IAC9B,iBAAiB,QAAQ,kBAAkB;IAC3C,QAAQ,QAAQ,UAAU;IAC1B,SAAS,QAAQ,WAAW;IAC5B,iBAAiB;IACjB,OAAO,QAAQ,SAAS;IACxB,SAAS,QAAQ,WAAW;IAC5B,aAAa,QAAQ,eAAe,OAAO,SAAS;IACpD,2BAA2B,QAAQ,2BAA2B;IAC9D,0BAA0B,QAAQ,0BAA0B;IAC5D,kBAAkB,QAAQ,mBAAmB;;AAEjD;AAEA,SAAS,yBACP,SACA,aAA0C;AAE1C,SAAO;IACL,OAAO,YAAY,SAAS;IAC5B,KAAK,YAAY,OAAO;IACxB,cAAc,YAAY,eAAe;IACzC,YAAY,YAAY,aAAa;IACrC,aAAa,YAAY;IACzB,MAAM,QAAQ,SAAS;IACvB,MAAM,QAAQ,QAAQ;IACtB,IAAI,QAAQ,MAAM;;AAEtB;AAKA,eAAsB,YAAY,SAA0B,QAAqB;AAC/E,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAI,OAAO,IAAI;AACvD,MAAI,CAAE,MAAM,WAAW,gBAAgB,MAAM,CAAC,GAAI;AAChD,UAAM,IAAI,WAAW,iCAAiC,MAAM,wBAAwB,UAAU,SAAS;EACzG;AAEA,QAAM,SAAS,+BAA+B,OAAO;AAErD,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,iBAAiB,6BAA6B,SAAS,MAAM;AACnE,QAAM,uBAAuB,4BAA4B,SAAS,MAAM;AACxE,QAAM,sBAAsB,2BAA2B,SAAoC,sBAAsB,UAAU;AAC3H,QAAM,eAAe,wBAAwB,UAAU,gCAA+B,CAAE;AACxF,QAAM,eAAyB,CAAA;AAC/B,2BAAyB,cAAc,OAAO,oBAAoB;AAClE,QAAM,QAAQ,MAAM,wBAAwB,QAAQ,SAAS,aAAa,aAAa,gBAAgB,cAAc,SAAS,MAAM;AACpI,QAAM,gBAAgB,YAAY,OAAO,SAAS,cAAc,gBAAgB,mBAAmB;AACnG,QAAM,kBAAkB,0BACtB,OAAO,YAAY,OACnB,OAAO,YAAY,KACnB,OAAO,UACP,OAAO,8BACP,OAAO,uBAAuB;AAEhC,QAAM,eAAe,eAAe,eAAe,iBAAiB,OAAO,gBAAgB,OAAO,eAAe;AACjH,QAAM,eAAe,aAAa,OAAO,CAAC,UAAU,qBAAqB,OAAO,OAAO,YAAY,OAAO,OAAO,YAAY,GAAG,CAAC;AACjI,QAAM,gBAAgB,OAAO,UAAU,SAAY,eAAe,aAAa,MAAM,GAAG,OAAO,KAAK;AACpG,QAAM,OAAO,kBAAkB,aAAa;AAC5C,QAAM,WAAW,CAAC,GAAG,IAAI,IAAI,YAAY,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AAE3F,SAAO;IACL,MAAM,OAAO;IACb,gBAAgB;IAChB,KAAK,OAAO;IACZ,QAAQ,OAAO,YAAY;IAC3B,OAAO,yBAAyB,SAAS,OAAO,WAAW;IAC3D,SAAS,2BAA2B,SAAS,mBAAmB;IAChE,SAAS,UAAU,aAAa;IAChC,QAAQ;IACR;IACA,GAAI,SAAS,SAAS,IAAI,EAAE,SAAQ,IAAK,CAAA;;AAE7C;;;AClvCO,IAAM,wBAAwB,CAAC,YAAY,QAAQ,MAAM;AAkQhE,IAAM,mBAAmB,oBAAI,IAAY,CAAC,QAAQ,SAAS,CAAC;AAC5D,IAAM,wBAAwB;AAE9B,IAAM,oBAA0C,CAAC,aAAa,YAAY,YAAY,oBAAoB,cAAc,UAAU;AAClI,IAAM,gBAAsC;EAC1C,GAAG;EACH;EACA;EACA;EACA;;AAEF,IAAM,sBAAsB;AAC5B,IAAM,uBAAuB;AAC7B,IAAM,eAAe;AACrB,IAAM,mBAAmB;AAMzB,SAASC,mBAAkB,KAAuB;AAChD,MAAI,CAAC;AAAK,WAAO;AACjB,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,MAAI,CAAC,sBAAsB,SAAS,UAAiC,GAAG;AACtE,UAAM,IAAI,WAAW,oDAAoD,UAAU,KAAK;EAC1F;AACA,SAAO;AACT;AAKA,IAAM,0BAA0B,oBAAI,IAAY;EAC9C;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACD;AAMK,SAAU,wBAAwB,KAAuB;AAC7D,MAAI,QAAQ;AAAW,WAAO;AAC9B,QAAM,SAAmB,CAAA;AACzB,aAAW,SAAS,IAAI,MAAM,GAAG,GAAG;AAClC,UAAM,aAAa,MAAM,KAAI,EAAG,YAAW;AAC3C,QAAI,WAAW,WAAW;AAAG;AAC7B,QAAI,CAAC,wBAAwB,IAAI,UAAU,GAAG;AAC5C,YAAM,IAAI,WACR,2CAA2C,UAAU,YAAY,CAAC,GAAG,uBAAuB,EAAE,KAAK,IAAI,CAAC,KACxG,UAAU,KAAK;IAEnB;AACA,QAAI,CAAC,OAAO,SAAS,UAAU;AAAG,aAAO,KAAK,UAAU;EAC1D;AACA,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,WAAW,qDAAqD,UAAU,KAAK;EAC3F;AACA,SAAO;AACT;AAMM,SAAU,wBAAoD,MAAW,QAAgB;AAC7F,SAAO,KAAK,IAAI,CAAC,QAAO;AACtB,UAAM,YAAqC,CAAA;AAC3C,UAAM,SAAS;AACf,eAAW,SAAS,QAAQ;AAC1B,gBAAU,KAAK,IAAI,OAAO,KAAK,KAAK;IACtC;AACA,WAAO;EACT,CAAC;AACH;AAKM,SAAU,2BAA2B,SAAyB,QAAqB;AACvF,QAAM,gBAAgBA,mBAAkB,QAAQ,MAAM;AACtD,MAAI,OAAO,QAAQ,iBAAiB,kBAAkB,QAAQ;AAC5D,UAAM,IAAI,WAAW,qDAAqD,UAAU,KAAK;EAC3F;AACA,MAAI,OAAO,MAAM;AACf,WAAO;EACT;AACA,SAAO,iBAAiB;AAC1B;AAIA,SAAS,kBAAkB,KAAyB,OAAmB;AACrE,SAAO,kBAAkB,KAAK,SAAS,MAAM,UAAU,SAAS,OAAO,mBAAmB;AAC5F;AAKM,SAAU,kBAAkB,KAAyB,UAAyB;AAClF,MAAI,CAAC;AAAK,WAAO,SAAS;AAC1B,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,MAAI,CAAC,qBAAqB,SAAS,UAA0B,GAAG;AAC9D,UAAM,IAAI,WAAW,kCAAkC,qBAAqB,KAAK,GAAG,CAAC,IAAI,UAAU,KAAK;EAC1G;AACA,SAAO;AACT;AAKM,SAAU,qBACd,KACA,OACA,UAAyB;AAEzB,MAAI,OAAO,IAAI,SAAS,GAAG;AACzB,UAAM,WAAiC,CAAA;AACvC,eAAW,SAAS,KAAK;AACvB,YAAM,aAAa,MAAM,KAAI,EAAG,YAAW;AAC3C,UAAI,CAAC,uBAAuB,SAAS,UAAgC,GAAG;AACtE,cAAM,IAAI,WACR,oCAAoC,uBAAuB,KAAK,GAAG,CAAC,IACpE,UAAU,KAAK;MAEnB;AACA,UAAI,CAAC,SAAS,SAAS,UAAgC,GAAG;AACxD,iBAAS,KAAK,UAAgC;MAChD;IACF;AACA,WAAO;EACT;AACA,MAAI,UAAU;AAAS,WAAO,CAAA;AAG9B,MAAI,UAAU;AAAQ,WAAO,CAAC,GAAG,sBAAsB;AACvD,QAAM,OAAO,UAAU,SAAS,gBAAgB;AAChD,SAAO,KAAK,OAAO,CAAC,YAAY,SAAS,SAAS,OAAO,CAAC;AAC5D;AAEA,SAAS,mBAAmB,KAAyB,UAAyB;AAC5E,MAAI,CAAC;AAAK,WAAO,SAAS;AAC1B,QAAM,SAAS,kBAAkB,KAAK,kBAAkB;AAExD,SAAO,UAAU,SAAS;AAE5B;AAEA,SAAS,wBAAwB,KAAyB,UAAyB;AACjF,MAAI,CAAC;AAAK,WAAO,SAAS;AAC1B,QAAM,UAAU,IAAI,KAAI,EAAG,YAAW;AACtC,QAAM,QAAQ,YAAY,KAAK,OAAO;AACtC,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,WAAW,6DAA6D,UAAU,KAAK;EACnG;AACA,QAAM,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AAClC,MAAI,QAAQ,GAAG;AACb,UAAM,IAAI,WAAW,sCAAsC,UAAU,KAAK;EAC5E;AACA,SAAO;AACT;AAMA,SAAS,WAAW,QAAoB,gBAAqC;AAC3E,QAAM,mBAAmB,2BAA2B,QAAQ,cAAc;AAC1E,QAAM,mBAAmB,qBAAqB,eAAe,cAAc;AAC3E,QAAM,aAAa,qBAAqB,QAAQ,cAAc;AAC9D,QAAM,gBAAgB,qBAAqB,WAAW,cAAc;AACpE,QAAM,cAAc,qBAAqB,SAAS,cAAc;AAChE,MAAI,oBAAoB,qBAAqB;AAAkB,WAAO;AACtE,MAAI,cAAc,qBAAqB;AAAY,WAAO;AAC1D,MAAI,iBAAiB,qBAAqB;AAAe,WAAO;AAChE,MAAI,eAAe,qBAAqB;AAAa,WAAO;AAC5D,MAAI,eAAe,gBAAgB,IAAI,gBAAgB;AAAG,WAAO;AACjE,MAAI,eAAe,iBAAiB,IAAI,gBAAgB;AAAG,WAAO;AAClE,MAAI,eAAe,kBAAkB,IAAI,gBAAgB;AAAG,WAAO;AACnE,SAAO;AACT;AAEA,SAAS,eAAe,QAAoB,gBAAqC;AAC/E,QAAM,cAAc,qBAAqB,UAAU,cAAc;AACjE,SAAO,2BAA2B,QAAQ,cAAc,MAAM;AAChE;AAEA,SAAS,mBAAmB,QAAoB,gBAAqC;AACnF,QAAM,mBAAmB,qBAAqB,eAAe,cAAc;AAC3E,SAAO,2BAA2B,QAAQ,cAAc,MAAM;AAChE;AAEA,SAAS,aAAa,QAAoB,gBAAqC;AAC7E,QAAM,aAAa,qBAAqB,QAAQ,cAAc;AAC9D,SAAO,2BAA2B,QAAQ,cAAc,MAAM;AAChE;AAEA,SAAS,gBAAgB,QAAoB,gBAAqC;AAChF,SAAO,eAAe,iBAAiB,IAAI,2BAA2B,QAAQ,cAAc,CAAC;AAC/F;AAMA,IAAM,wBAAwB,CAAC,WAAW,SAAS,UAAU,eAAe,gBAAgB,QAAQ;AAEpG,SAAS,yBAAyB,SAAuB;AACvD,QAAM,OAAgC,EAAE,GAAI,QAAmC;AAC/E,aAAW,OAAO,uBAAuB;AACvC,WAAO,KAAK,GAAG;EACjB;AACA,SAAO;AACT;AAWM,SAAU,kBAAkB,QAA2B,UAAgB;AAC3E,QAAM,SAAS,SAAS,KAAI,EAAG,YAAW;AAC1C,QAAM,SAAS,OAAO,KAAK,CAAC,SAAS,KAAK,GAAG,KAAI,EAAG,YAAW,MAAO,MAAM;AAC5E,MAAI,CAAC,QAAQ;AACX,WAAO,EAAE,KAAK,oBAAI,IAAG,GAAY,OAAO,MAAK;EAC/C;AACA,QAAM,mBAAmB,sBAAsB,MAAM;AACrD,QAAM,cAAc,mBAAmB,OAAO,IAAI,gBAAgB;AAElE,QAAM,MAAM,IAAI,IAAY,CAAC,OAAO,IAAI,GAAG,YAAY,IAAI,CAAC,SAAS,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,GAAG,KAAI,EAAG,YAAW,CAAE,CAAC;AACnH,SAAO,EAAE,KAAK,OAAO,KAAI;AAC3B;AAEA,SAAS,mBAAmB,KAAuB;AACjD,MAAI,QAAQ;AAAW,WAAO;AAC9B,QAAM,UAAU,IAAI,KAAI;AACxB,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,WAAW,wCAAwC,UAAU,KAAK;EAC9E;AACA,SAAO;AACT;AAMA,SAAS,qBAAqB,MAAiC,OAAgC;AAC7F,QAAM,YAAY,QAAQ;AAC1B,QAAM,aAAa,SAAS;AAC5B,MAAI,cAAc,QAAQ,eAAe;AAAM,WAAO;AACtD,MAAI,cAAc;AAAM,WAAO;AAC/B,MAAI,eAAe;AAAM,WAAO;AAChC,SAAO,YAAY;AACrB;AAEA,SAAS,wBAAwB,MAAiC,OAAgC;AAChG,QAAM,YAAY,QAAQ;AAC1B,QAAM,aAAa,SAAS;AAC5B,MAAI,cAAc,QAAQ,eAAe;AAAM,WAAO;AACtD,MAAI,cAAc;AAAM,WAAO;AAC/B,MAAI,eAAe;AAAM,WAAO;AAChC,SAAO,wBAAwB,WAAW,UAAU;AACtD;AAEA,SAAS,eAAe,MAAc,YAAkB;AACtD,SAAO,IAAI,KAAK,KAAK,IAAI,MAAM,aAAa,GAAG,CAAC,CAAC,EAAE,WAAU;AAC/D;AAEA,SAAS,uBAAuB,OAAa;AAC3C,QAAM,QAAQ,oBAAoB,KAAK,KAAK,KAAK,qBAAqB,KAAK,KAAK;AAChF,MAAI,CAAC,OAAO;AACV,WAAO;EACT;AACA,QAAM,OAAO,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AACzC,QAAM,QAAQ,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AAC1C,QAAM,MAAM,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AACxC,SAAO,SAAS,KAAK,SAAS,MAAM,OAAO,KAAK,OAAO,eAAe,MAAM,QAAQ,CAAC;AACvF;AAEA,SAAS,4BAA4B,OAAa;AAChD,QAAM,cAAc,aAAa,KAAK,KAAK;AAC3C,MAAI,aAAa;AACf,WAAO,GAAG,YAAY,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC;EAC9D;AACA,QAAM,kBAAkB,iBAAiB,KAAK,KAAK;AACnD,MAAI,iBAAiB;AACnB,UAAM,CAAC,EAAE,MAAM,OAAO,KAAK,MAAM,QAAQ,WAAW,SAAS,IAAI;AACjE,UAAM,SAAS,YAAY,IAAI,SAAS,KAAK;AAC7C,UAAM,SAAS,aAAa,UAAU,WAAW,KAAK,cAAc,MAAM,GAAG,UAAU,MAAM,GAAG,CAAC,CAAC,IAAI,UAAU,MAAM,CAAC,CAAC,KAAK,aAAa;AAC1I,WAAO,GAAG,IAAI,IAAI,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,MAAM,GAAG,MAAM,GAAG,MAAM;EACpE;AACA,SAAO;AACT;AAEA,SAAS,wBAAwB,OAAc;AAC7C,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,OAAO;EAChB;AACA,QAAM,UAAU,MAAM,KAAI;AAC1B,MAAI,QAAQ,WAAW,KAAK,CAAC,uBAAuB,OAAO,GAAG;AAC5D,WAAO,OAAO;EAChB;AACA,QAAM,SAAS,KAAK,MAAM,4BAA4B,OAAO,CAAC;AAC9D,SAAO,OAAO,SAAS,MAAM,IAAI,SAAS,OAAO;AACnD;AAEA,SAAS,kBAAkB,OAAc;AACvC,QAAM,SAAS,wBAAwB,KAAK;AAC5C,SAAO,OAAO,SAAS,MAAM,IAAI,IAAI,KAAK,MAAM,EAAE,YAAW,IAAK;AACpE;AAEA,SAAS,sBAAsB,OAAc;AAC3C,QAAM,SAAS,wBAAwB,KAAK;AAC5C,SAAO,OAAO,SAAS,MAAM,IAAI,IAAI,KAAK,MAAM,EAAE,YAAW,EAAG,MAAM,GAAG,EAAE,IAAI;AACjF;AAEA,SAAS,mBAAmB,OAAc;AACxC,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO;EACT;AACA,QAAM,UAAU,MAAM,KAAI;AAC1B,SAAO,QAAQ,SAAS,IAAI,UAAU;AACxC;AASM,SAAU,qBAAqB,MAAuB,OAAwB,gBAAqC;AACvH,QAAM,WAAW,WAAW,KAAK,QAAQ,cAAc,IAAI,WAAW,MAAM,QAAQ,cAAc;AAClG,MAAI,aAAa;AAAG,WAAO;AAC3B,QAAM,aAAa,KAAK,WAAW,MAAM;AACzC,MAAI,eAAe;AAAG,WAAO;AAC7B,QAAM,UAAU,qBAAqB,KAAK,OAAO,MAAM,KAAK;AAC5D,MAAI,YAAY;AAAG,WAAO;AAC1B,QAAM,aAAa,wBAAwB,KAAK,UAAU,MAAM,QAAQ;AACxE,MAAI,eAAe;AAAG,WAAO;AAC7B,QAAM,YAAY,wBAAwB,kBAAkB,MAAM,UAAU,GAAG,kBAAkB,KAAK,UAAU,CAAC;AACjH,QAAM,OAAO,KAAK,GAAG,cAAc,MAAM,EAAE;AAC3C,SAAO,cAAc,IAAI,YAAY;AACvC;AAEA,SAASC,eAAc,QAAgB,OAAa;AAClD,SAAO,QAAQ,IAAI,KAAK,MAAO,SAAS,QAAS,GAAG,IAAI;AAC1D;AAOM,SAAU,sBAAsB,UAA2B;AAC/D,QAAM,mBAAmB,oBAAI,IAAG;AAChC,aAAW,QAAQ,UAAU;AAC3B,UAAM,SAAS,mBAAmB,KAAK,MAAM;AAC7C,QAAI,CAAC;AAAQ;AACb,UAAM,WAAW,iBAAiB,IAAI,MAAM,KAAK,CAAA;AACjD,aAAS,KAAK,IAAI;AAClB,qBAAiB,IAAI,QAAQ,QAAQ;EACvC;AACA,SAAO;AACT;AAQM,SAAU,mBACd,MACA,gBACA,kBAAiD;AAEjD,QAAM,QAA0B;IAC9B,IAAI,KAAK;IACT,OAAO,KAAK;IACZ,MAAM,KAAK;IACX,QAAQ,KAAK;IACb,UAAU,KAAK;IACf,OAAO,KAAK,SAAS;IACrB,UAAU,KAAK,YAAY;IAC3B,UAAU,KAAK,YAAY;IAC3B,MAAM,MAAM,QAAQ,KAAK,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,CAAA;IAClD,YAAY,KAAK;IACjB,QAAQ,mBAAmB,KAAK,MAAM;;AAExC,MAAI,kBAAkB,kBAAkB;AACtC,UAAM,cAAc,mBAAmB,KAAK,IAAI,gBAAgB;AAChE,UAAM,QAAQ,YAAY;AAC1B,QAAI,QAAQ,GAAG;AACb,YAAM,SAAS,YAAY,OAAO,CAAC,SAAS,eAAe,KAAK,QAAQ,cAAc,CAAC,EAAE;AACzF,YAAM,iBAAiB;AACvB,YAAM,kBAAkB;AACxB,YAAM,iBAAiBA,eAAc,QAAQ,KAAK;IACpD;EACF;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,QAAqB;AAC5C,MAAI,YAAY;AAChB,MAAI,YAAY;AAChB,MAAI,YAAY;AAChB,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,SAAS,QAAQ;AAC1B,YAAQ,IAAI,MAAM,OAAO;AACzB,QAAI,MAAM,SAAS,YAAY;AAC7B,mBAAa;AACb;IACF;AACA,QAAI,MAAM,SAAS,YAAY;AAC7B,mBAAa;AACb;IACF;AACA,iBAAa;EACf;AACA,SAAO;IACL,QAAQ,OAAO;IACf,OAAO,QAAQ;IACf;IACA;IACA;;AAEJ;AAEA,SAAS,uBAAuB,eAA0C;AACxE,SAAO,CAAC,GAAG,IAAI,IAAI,cAAc,QAAQ,CAAC,UAAU,SAAS,CAAA,CAAE,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACpH;AAEA,SAAS,6BAA6B,QAAuB,gBAAqC;AAChG,SAAO,OAAO,OAAO,CAAC,UAAU,CAAC,eAAe,kBAAkB,IAAI,2BAA2B,MAAM,aAAa,cAAc,CAAC,CAAC;AACtI;AAMA,SAAS,eACP,UACA,aACA,gBACA,OAAa;AAEb,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,QAAQ,UAAU;AAC3B,YAAQ,IAAI,KAAK,IAAI,IAAI;EAC3B;AAEA,QAAM,mBAAmB,sBAAsB,QAAQ;AAEvD,QAAM,qBAAqB,IAAI,IAC7B,YAAY,OAAO,CAAC,SAAS,iBAAiB,IAAI,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,SAAS,KAAK,EAAE,CAAC;AAGtF,QAAM,QAAyB,CAAA;AAC/B,aAAW,YAAY,oBAAoB;AACzC,UAAM,SAAS,QAAQ,IAAI,QAAQ;AACnC,QAAI,CAAC;AAAQ;AACb,UAAM,iBAAiB,mBAAmB,UAAU,gBAAgB;AACpE,UAAM,aAAa,iBAAiB,IAAI,QAAQ,KAAK,CAAA;AAErD,QAAI,cAAc;AAClB,QAAI,YAAY;AAChB,QAAI,kBAAkB;AACtB,QAAI,eAAe;AAEnB,eAAW,QAAQ,gBAAgB;AACjC,UAAI,eAAe,KAAK,QAAQ,cAAc;AAAG;eACxC,mBAAmB,KAAK,QAAQ,cAAc;AAAG;eACjD,gBAAgB,KAAK,QAAQ,cAAc;AAAG;eAC9C,aAAa,KAAK,QAAQ,cAAc;AAAG;IACtD;AAGA,UAAM,WAA6B,WAChC,KAAK,CAAC,GAAG,MAAM,qBAAqB,GAAG,GAAG,cAAc,CAAC,EACzD,MAAM,GAAG,KAAK,EACd,IAAI,CAAC,UAAS;AACb,YAAM,gBAAgB,mBAAmB,MAAM,IAAI,gBAAgB;AACnE,YAAM,WAAW,cAAc,OAAO,CAAC,OAAO,eAAe,GAAG,QAAQ,cAAc,CAAC,EAAE;AACzF,aAAO;QACL,IAAI,MAAM;QACV,OAAO,MAAM;QACb,MAAM,MAAM;QACZ,QAAQ,MAAM;QACd,gBAAgB,cAAc;QAC9B,iBAAiB;;IAErB,CAAC;AAEH,UAAM,KAAK;MACT,IAAI,OAAO;MACX,OAAO,OAAO;MACd,MAAM,OAAO;MACb,QAAQ,OAAO;MACf,gBAAgB,eAAe;MAC/B,iBAAiB;MACjB,eAAe;MACf,sBAAsB;MACtB,kBAAkB;MAClB;KACD;EACH;AAEA,SAAO,MACJ,KAAK,CAAC,GAAG,MAAK;AACb,UAAM,UAAU,QAAQ,IAAI,EAAE,EAAE;AAChC,UAAM,UAAU,QAAQ,IAAI,EAAE,EAAE;AAChC,WAAO,qBAAqB,SAAS,SAAS,cAAc;EAC9D,CAAC,EACA,MAAM,GAAG,KAAK;AACnB;AAEA,SAAS,mBACP,UACA,kBAAgD;AAEhD,QAAM,SAA4B,CAAA;AAClC,QAAM,QAAQ,CAAC,QAAQ;AACvB,QAAM,UAAU,oBAAI,IAAG;AACvB,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,UAAU,MAAM,IAAG;AACzB,QAAI,QAAQ,IAAI,OAAO;AAAG;AAC1B,YAAQ,IAAI,OAAO;AACnB,UAAM,WAAW,iBAAiB,IAAI,OAAO,KAAK,CAAA;AAClD,eAAW,SAAS,UAAU;AAC5B,aAAO,KAAK,KAAK;AACjB,YAAM,KAAK,MAAM,EAAE;IACrB;EACF;AACA,SAAO;AACT;AAwCA,eAAe,cACb,eACA,QAAqB;AAErB,QAAM,SAAS,MAAM,YAAY,EAAE,SAAS,MAAM,OAAO,OAAO,aAAa,EAAC,GAAI,MAAM;AACxF,SAAO,OAAO,oBAAoB,CAAA;AACpC;AAEA,SAAS,cACP,UACA,aACA,gBACA,OAAa;AAEb,QAAM,mBAAmB,oBAAI,IAAG;AAChC,aAAW,QAAQ,UAAU;AAC3B,QAAI,CAAC,KAAK;AAAQ;AAClB,UAAM,WAAW,iBAAiB,IAAI,KAAK,MAAM,KAAK,CAAA;AACtD,aAAS,KAAK,IAAI;AAClB,qBAAiB,IAAI,KAAK,QAAQ,QAAQ;EAC5C;AAEA,QAAM,kBAAkB,YAAY,OAAO,CAAC,SAAS,iBAAiB,IAAI,KAAK,IAAI,CAAC;AACpF,QAAM,UAA2B,CAAA;AACjC,aAAW,UAAU,iBAAiB;AACpC,UAAM,cAAc,mBAAmB,OAAO,IAAI,gBAAgB;AAClE,UAAM,QAAQ,YAAY;AAC1B,QAAI,UAAU;AAAG;AAEjB,QAAI,SAAS;AACb,QAAI,OAAO;AACX,QAAI,aAAa;AACjB,QAAI,UAAU;AAEd,eAAW,QAAQ,aAAa;AAC9B,UAAI,eAAe,KAAK,QAAQ,cAAc;AAAG;eACxC,mBAAmB,KAAK,QAAQ,cAAc;AAAG;eACjD,gBAAgB,KAAK,QAAQ,cAAc;AAAG;eAC9C,aAAa,KAAK,QAAQ,cAAc;AAAG;IACtD;AAGA,YAAQ,KAAK;MACX,IAAI,OAAO;MACX,OAAO,OAAO;MACd,MAAM,OAAO;MACb;MACA;MACA;MACA,aAAa;MACb;MACA,gBAAgBC,eAAc,QAAQ,KAAK;KAC5C;EACH;AAEA,SAAO,QACJ,KAAK,CAAC,GAAG,MAAM,EAAE,iBAAiB,EAAE,cAAc,EAClD,MAAM,GAAG,KAAK;AACnB;AAEA,SAAS,cACP,cACA,SACA,OAAa;AAEb,SAAO,aAAa,MAAM,GAAG,KAAK,EAAE,IAAI,CAAC,SAAQ;AAC/C,UAAM,cAAc,KAAK,aAAa,QAAQ,IAAI,KAAK,UAAU,IAAI;AACrE,WAAO;MACL,IAAI,KAAK;MACT,OAAO,KAAK;MACZ,YAAY,KAAK,cAAc;MAC/B,kBAAkB,aAAa,SAAS;MACxC,mBAAmB,aAAa,UAAU;MAC1C,gBAAgB,KAAK,kBAAkB;MACvC,cAAc,KAAK,gBAAgB;;EAEvC,CAAC;AACH;AAEA,SAAS,cACP,aACA,OAAa;AAEb,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,QAAQ,aAAa;AAC9B,eAAW,QAAQ,KAAK,SAAS,CAAA,GAAI;AACnC,YAAM,WAAW,QAAQ,IAAI,KAAK,IAAI,KAAK,oBAAI,IAAG;AAClD,eAAS,IAAI,KAAK,EAAE;AACpB,cAAQ,IAAI,KAAK,MAAM,QAAQ;IACjC;EACF;AAEA,SAAO,CAAC,GAAG,QAAQ,QAAO,CAAE,EACzB,IAAI,CAAC,CAAC,UAAU,OAAO,OAAO;IAC7B,MAAM;IACN,YAAY,QAAQ;IACpB,OAAO,CAAC,GAAG,OAAO,EAAE,KAAI;IACxB,EACD,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU,EAC1C,MAAM,GAAG,KAAK;AACnB;AAEA,SAAS,cACP,aACA,gBACA,OAAa;AAEb,QAAM,SAAS,oBAAI,IAAG;AACtB,aAAW,QAAQ,aAAa;AAC9B,UAAM,MAAM,KAAK,YAAY;AAC7B,UAAM,WAAW,OAAO,IAAI,GAAG,KAAK,CAAA;AACpC,aAAS,KAAK,IAAI;AAClB,WAAO,IAAI,KAAK,QAAQ;EAC1B;AAEA,SAAO,CAAC,GAAG,OAAO,QAAO,CAAE,EACxB,IAAI,CAAC,CAAC,UAAU,KAAK,OAAO;IAC3B;IACA,QAAQ,MAAM;IACd,aAAa,MAAM,OAAO,CAAC,SAAS,mBAAmB,KAAK,QAAQ,cAAc,CAAC,EAAE;IACrF,OAAO,MAAM,IAAI,CAAC,SAAS,KAAK,EAAE,EAAE,KAAI;IACxC,EACD,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM,EAClC,MAAM,GAAG,KAAK;AACnB;AAEA,SAAS,eACP,gBACA,oBACA,KACA,OAAa;AAEb,QAAM,WAAW,IAAI,KAAK,GAAG,EAAE,QAAO,IAAK,qBAAqB,KAAK,KAAK,KAAK;AAE/E,SAAO,eACJ,OAAO,CAAC,SAAS,IAAI,KAAK,KAAK,UAAU,EAAE,QAAO,IAAK,QAAQ,EAC/D,IAAI,CAAC,UAAU;IACd,IAAI,KAAK;IACT,OAAO,KAAK;IACZ,QAAQ,KAAK;IACb,YAAY,KAAK;IACjB,YAAY,KAAK,OAAO,IAAI,KAAK,GAAG,EAAE,QAAO,IAAK,IAAI,KAAK,KAAK,UAAU,EAAE,QAAO,MAAO,KAAK,KAAK,KAAK,IAAK;IAC9G,EACD,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU,EAC1C,MAAM,GAAG,KAAK;AACnB;AAEA,SAAS,qBACP,gBACA,gBACA,kBACA,OAAa;AAEb,SAAO,eACJ,IAAI,CAAC,UAAU,EAAE,MAAM,SAAS,kBAAkB,KAAK,UAAU,EAAC,EAAG,EACrE,KAAK,CAAC,MAAM,UAAS;AACpB,UAAM,YAAY,wBAAwB,MAAM,SAAS,KAAK,OAAO;AACrE,WAAO,cAAc,IAAI,YAAY,KAAK,KAAK,GAAG,cAAc,MAAM,KAAK,EAAE;EAC/E,CAAC,EACA,MAAM,GAAG,KAAK,EACd,IAAI,CAAC,EAAE,KAAI,OAAQ;IAClB,GAAG,mBAAmB,MAAM,gBAAgB,gBAAgB;IAC5D,YAAY,KAAK;IACjB;AACN;AAEA,SAAS,gBACP,gBACA,gBACA,kBACA,OAAa;AAEb,SAAO,eACJ,OAAO,CAAC,SAAS,CAAC,mBAAmB,KAAK,MAAM,KAAK,CAAC,iBAAiB,IAAI,KAAK,IAAI,CAAC,EACrF,KAAK,CAAC,MAAM,UAAU,qBAAqB,MAAM,OAAO,cAAc,CAAC,EACvE,MAAM,GAAG,KAAK,EACd,IAAI,CAAC,SAAS,mBAAmB,MAAM,gBAAgB,gBAAgB,CAAC;AAC7E;AAEA,SAAS,gBACP,aAA8B;AAE9B,MAAI,iBAAiB;AACrB,MAAI,sBAAsB;AAC1B,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,UAAU;AACd,QAAM,eAAyB,CAAA;AAE/B,aAAW,QAAQ,aAAa;AAC9B,SAAK,KAAK,SAAS,CAAA,GAAI,SAAS,GAAG;AACjC;IACF;AACA,UAAM,OAAO,KAAK,aAAa,CAAA;AAC/B,QAAI,KAAK,SAAS,GAAG;AACnB;AACA,UAAI,iBAAiB;AACrB,iBAAW,OAAO,MAAM;AACtB,kBAAU,IAAI,UAAU;AACxB,kBAAU,IAAI,UAAU;AACxB,mBAAW,IAAI,WAAW;AAC1B,aAAK,IAAI,UAAU,KAAK,GAAG;AACzB,2BAAiB;QACnB;MACF;AACA,UAAI,gBAAgB;AAClB,qBAAa,KAAK,KAAK,EAAE;MAC3B;IACF;EACF;AAEA,SAAO;IACL,kBAAkB;IAClB,wBAAwB;IACxB,aAAa,EAAE,QAAQ,QAAQ,QAAO;IACtC,eAAe,aAAa,KAAI;;AAEpC;AAMA,SAASC,aAAY,WAAiB;AACpC,SAAO,GAAG,IAAI,KAAK,SAAS,EAAE,YAAW,EAAG,MAAM,IAAI,EAAE,CAAC;AAC3D;AAEA,SAAS,gBAAgB,MAAsB;AAC7C,QAAM,aAAa,KAAK,UAAU,OAAO,MAAM,OAAO,KAAK,KAAK;AAChE,QAAM,gBAAgB,KAAK,YAAY;AACvC,QAAM,cAAc,KAAK,SAAS,WAAW,KAAK,MAAM,KAAK;AAC7D,QAAM,gBACJ,KAAK,mBAAmB,UAAa,KAAK,oBAAoB,UAAa,KAAK,mBAAmB,SAC/F,aAAa,KAAK,eAAe,IAAI,KAAK,cAAc,SAAS,KAAK,cAAc,MACpF;AACN,SAAO,GAAG,KAAK,EAAE,KAAK,KAAK,QAAQ,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,UAAU,UAAU,aAAa,aAAa,GAAG,WAAW,GAAG,aAAa,IAAI,KAAK,KAAK;AAC3J;AAKA,SAAS,yBAAyB,MAAwB,QAAgB;AACxE,QAAM,SAAS;AACf,SAAO,OACJ,IAAI,CAAC,UAAS;AACb,UAAM,QAAQ,OAAO,KAAK;AAC1B,QAAI,MAAM,QAAQ,KAAK;AAAG,aAAO,GAAG,KAAK,IAAI,MAAM,KAAK,GAAG,CAAC;AAC5D,WAAO,GAAG,KAAK,IAAI,SAAS,GAAG;EACjC,CAAC,EACA,KAAK,GAAG;AACb;AAEA,SAAS,iBAAiB,OAAkB;AAC1C,QAAM,OAAO,GAAGA,aAAY,MAAM,EAAE,CAAC,KAAK,MAAM,IAAI,KAAK,MAAM,OAAO,KAAK,MAAM,aAAa,IAAI,MAAM,WAAW,IAAI,MAAM,UAAU;AACvI,MAAI,MAAM,SAAS,YAAY;AAC7B,WAAO,GAAG,IAAI,WAAM,MAAM,aAAa;EACzC;AACA,MAAI,MAAM,SAAS,SAAS;AAC1B,UAAM,kBAAkB,MAAM,kBAAkB,iBAAiB;AACjE,UAAM,QAAQ,MAAM,eAAe,MAAM;AACzC,WAAO,GAAG,IAAI,WAAM,KAAK,GAAG,eAAe;EAC7C;AACA,SAAO;AACT;AAEA,SAAS,wBACP,OACA,OACA,MACA,WACA,aAA+C;AAE/C,QAAM,KAAK,MAAM,KAAK,EAAE;AACxB,MAAI,KAAK,WAAW,GAAG;AACrB,UAAM,KAAK,SAAS;EACtB,OAAO;AACL,eAAW,QAAQ,MAAM;AACvB,YAAM,KAAK,KAAK,YAAY,IAAI,CAAC,EAAE;IACrC;EACF;AACA,QAAM,KAAK,EAAE;AACf;AAEA,SAAS,2BACP,OACA,QACA,aAA+C;AAE/C,MAAI,OAAO,iBAAiB,WAAW,GAAG;AACxC;EACF;AACA,QAAM,KAAK,qBAAqB;AAChC,aAAW,QAAQ,OAAO,kBAAkB;AAC1C,UAAM,KAAK,KAAK,YAAY,IAAI,CAAC,EAAE;EACrC;AACA,QAAM,KAAK,EAAE;AACf;AAEA,SAAS,kBAAkB,OAAiB,QAAqB;AAC/D,QAAM,KAAK,WAAW;AACtB,QAAM,KACJ,aAAa,OAAO,OAAO,QAAQ,MAAM,gBAAgB,OAAO,OAAO,QAAQ,SAAS,gBAAgB,OAAO,OAAO,QAAQ,SAAS,gBAAgB,OAAO,OAAO,QAAQ,SAAS,GAAG;AAE3L,MAAI,OAAO,OAAO,OAAO,WAAW,GAAG;AACrC,UAAM,KAAK,gDAAgD;EAC7D,OAAO;AACL,eAAW,SAAS,OAAO,OAAO,QAAQ;AACxC,YAAM,KAAK,KAAK,iBAAiB,KAAK,CAAC,EAAE;IAC3C;EACF;AACA,QAAM,KAAK,EAAE;AACf;AAEA,SAAS,qBAAqB,OAAiB,QAAqB;AAClE,MAAI,CAAC,OAAO,aAAa,OAAO,UAAU,WAAW,GAAG;AACtD;EACF;AACA,QAAM,KAAK,cAAc;AACzB,aAAW,QAAQ,OAAO,WAAW;AACnC,UAAM,MAAM,KAAK,iBAAiB,IAAI,KAAK,MAAO,KAAK,kBAAkB,KAAK,iBAAkB,GAAG,IAAI;AACvG,UAAM,KAAK,KAAK,KAAK,EAAE,IAAI,KAAK,IAAI,IAAI,KAAK,MAAM,KAAK,KAAK,KAAK,MAAM,KAAK,eAAe,IAAI,KAAK,cAAc,SAAS,GAAG,IAAI;AACnI,eAAW,SAAS,KAAK,UAAU;AACjC,YAAM,OAAO,MAAM,iBAAiB,IAAI,KAAK,MAAO,MAAM,kBAAkB,MAAM,iBAAkB,GAAG,IAAI;AAC3G,YAAM,KAAK,OAAO,MAAM,EAAE,IAAI,MAAM,IAAI,IAAI,MAAM,MAAM,KAAK,MAAM,KAAK,MAAM,MAAM,eAAe,IAAI,MAAM,cAAc,SAAS,IAAI,IAAI;IAC9I;EACF;AACA,QAAM,KAAK,EAAE;AACf;AAEA,SAAS,oBAAoB,OAAiB,QAAqB;AACjE,MAAI,CAAC,OAAO,YAAY,OAAO,SAAS,WAAW,GAAG;AACpD;EACF;AACA,QAAM,KAAK,aAAa;AACxB,aAAW,SAAS,OAAO,UAAU;AACnC,UAAM,KAAK,KAAK,MAAM,EAAE,KAAK,MAAM,KAAK,KAAK,MAAM,cAAc,MAAM,MAAM,MAAM,IAAI,MAAM,KAAK,YAAY,MAAM,WAAW,SAAS,MAAM,IAAI,UAAU,MAAM,OAAO,WAAW;EACtL;AACA,QAAM,KAAK,EAAE;AACf;AAEA,SAAS,2BACP,OACA,QACA,aACA,aAA+C;AAE/C,MAAI,CAAC,OAAO,oBAAoB,OAAO,iBAAiB,WAAW,GAAG;AACpE;EACF;AACA,QAAM,KAAK,qBAAqB;AAChC,aAAW,QAAQ,OAAO,kBAAkB;AAC1C,UAAM,KAAK,cAAc,KAAK,YAAY,IAAI,CAAC,KAAK,KAAK,sBAAsB,KAAK,UAAU,CAAC,IAAI,gBAAgB,IAAI,CAAC,EAAE;EAC5H;AACA,QAAM,KAAK,EAAE;AACf;AAEA,SAAS,sBACP,OACA,QACA,aAA+C;AAE/C,MAAI,CAAC,OAAO,cAAc,OAAO,WAAW,WAAW,GAAG;AACxD;EACF;AACA,QAAM,KAAK,eAAe;AAC1B,aAAW,QAAQ,OAAO,YAAY;AACpC,UAAM,KAAK,KAAK,YAAY,IAAI,CAAC,EAAE;EACrC;AACA,QAAM,KAAK,EAAE;AACf;AAEA,SAAS,oBAAoB,OAAiB,QAAqB;AACjE,MAAI,CAAC,OAAO,YAAY,OAAO,SAAS,WAAW,GAAG;AACpD;EACF;AACA,QAAM,KAAK,oBAAoB;AAC/B,aAAW,SAAS,OAAO,UAAU;AACnC,UAAM,MAAM,MAAM,MAAM,IAAI,MAAM,GAAG,KAAK;AAC1C,UAAM,KAAK,KAAK,MAAM,GAAG,MAAM,GAAG,EAAE,CAAC,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,OAAO,MAAM,MAAM,GAAG,GAAG,EAAE;EAC3F;AACA,QAAM,KAAK,EAAE;AACf;AAEA,SAAS,oBAAoB,OAAiB,QAAqB;AACjE,MAAI,CAAC,OAAO,YAAY,OAAO,SAAS,WAAW,GAAG;AACpD;EACF;AACA,QAAM,KAAK,aAAa;AACxB,aAAW,SAAS,OAAO,UAAU;AACnC,UAAM,KAAK,MAAM,aAAa,cAAc,MAAM,UAAU,IAAI,MAAM,qBAAqB,GAAG,MAAM;AACpG,UAAM,SAAS,MAAM,iBAAiB,YAAY,MAAM,cAAc,MAAM;AAC5E,UAAM,OAAO,MAAM,eAAe,aAAa,MAAM,YAAY,MAAM;AACvE,UAAM,KAAK,KAAK,MAAM,EAAE,KAAK,MAAM,KAAK,KAAK,EAAE,GAAG,MAAM,GAAG,IAAI,EAAE;EACnE;AACA,QAAM,KAAK,EAAE;AACf;AAEA,SAAS,iBAAiB,OAAiB,QAAqB;AAC9D,MAAI,CAAC,OAAO,SAAS,OAAO,MAAM,WAAW,GAAG;AAC9C;EACF;AACA,QAAM,KAAK,cAAc;AACzB,aAAW,QAAQ,OAAO,OAAO;AAC/B,UAAM,KAAK,KAAK,KAAK,IAAI,SAAS,KAAK,UAAU,WAAW,KAAK,MAAM,KAAK,GAAG,CAAC,GAAG;EACrF;AACA,QAAM,KAAK,EAAE;AACf;AAEA,SAAS,oBAAoB,OAAiB,QAAqB;AACjE,MAAI,CAAC,OAAO,YAAY,OAAO,SAAS,WAAW,GAAG;AACpD;EACF;AACA,QAAM,KAAK,aAAa;AACxB,aAAW,SAAS,OAAO,UAAU;AACnC,UAAM,MAAM,MAAM,YAAY;AAC9B,UAAM,KAAK,KAAK,GAAG,WAAW,MAAM,MAAM,QAAQ,MAAM,WAAW,WAAW,MAAM,MAAM,KAAK,GAAG,CAAC,GAAG;EACxG;AACA,QAAM,KAAK,EAAE;AACf;AAEA,SAAS,qBAAqB,OAAiB,QAAqB;AAClE,MAAI,CAAC,OAAO,aAAa,OAAO,UAAU,WAAW,GAAG;AACtD;EACF;AACA,QAAM,KAAK,gBAAgB;AAC3B,aAAW,SAAS,OAAO,WAAW;AACpC,UAAM,KAAK,KAAK,MAAM,EAAE,IAAI,MAAM,MAAM,UAAU,MAAM,UAAU,UAAU,MAAM,WAAW,MAAM,GAAG,EAAE,CAAC,KAAK,MAAM,KAAK,GAAG;EAC9H;AACA,QAAM,KAAK,EAAE;AACf;AAEA,SAAS,sBAAsB,OAAiB,QAAqB;AACnE,MAAI,CAAC,OAAO,OAAO;AACjB;EACF;AACA,QAAM,KAAK,gBAAgB;AAC3B,QAAM,KAAK,uBAAuB,OAAO,MAAM,gBAAgB,EAAE;AACjE,QAAM,KAAK,6BAA6B,OAAO,MAAM,sBAAsB,EAAE;AAC7E,QAAM,KAAK,aAAa,OAAO,MAAM,YAAY,MAAM,aAAa,OAAO,MAAM,YAAY,MAAM,cAAc,OAAO,MAAM,YAAY,OAAO,EAAE;AACnJ,MAAI,OAAO,MAAM,cAAc,SAAS,GAAG;AACzC,UAAM,KAAK,qBAAqB,OAAO,MAAM,cAAc,KAAK,GAAG,CAAC,GAAG;EACzE;AACA,QAAM,KAAK,EAAE;AACf;AAEA,SAAS,4BAA4B,OAAiB,QAAqB;AACzE,QAAM,UACJ,OAAO,QAAQ,iBAAiB,KAChC,OAAO,QAAQ,YAAY,KAC3B,OAAO,OAAO,QAAQ,WAAW;AACnC,MAAI,CAAC,SAAS;AACZ;EACF;AACA,QAAM,KAAK,gBAAgB;AAC3B,QAAM,KAAK,oDAAoD;AAC/D,QAAM,KAAK,gEAAkE;AAC7E,QAAM,KAAK,oEAAoE;AAC/E,QAAM,KAAK,oDAAoD;AAC/D,QAAM,KAAK,qDAAqD;AAClE;AAKM,SAAU,sBAAsB,QAAqB;AACzD,QAAM,QAAkB,CAAA;AACxB,QAAM,cAAc,OAAO;AAC3B,QAAM,cAAc,CAAC,SACnB,cAAc,yBAAyB,MAAM,WAAW,IAAI,gBAAgB,IAAI;AAClF,QAAM,KAAK,cAAc;AACzB,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,UAAU,OAAO,GAAG,EAAE;AACjC,QAAM,KAAK,YAAY,OAAO,KAAK,EAAE;AACrC,MAAI,OAAO,QAAQ,QAAQ;AACzB,UAAM,KAAK,uBAAuB,OAAO,QAAQ,MAAM,EAAE;EAC3D;AACA,QAAM,KAAK,mBAAmB,OAAO,QAAQ,YAAY,kBAAkB,OAAO,QAAQ,WAAW,WAAW,OAAO,QAAQ,IAAI,GAAG;AACtI,MAAI,OAAO,QAAQ,gBAAgB,QAAW;AAC5C,UAAM,KAAK,kBAAkB,OAAO,QAAQ,WAAW,aAAa,OAAO,QAAQ,UAAU,CAAC,eAAe,OAAO,QAAQ,YAAY,CAAC,GAAG;EAC9I;AACA,QAAM,KAAK,oBAAoB,OAAO,QAAQ,aAAa,EAAE;AAC7D,QAAM,KAAK,4BAA4B,OAAO,QAAQ,qBAAqB,EAAE;AAC7E,QAAM,mBAAmB,OAAO,kBAAkB,OAChD,CAAC,YAAY,YAAY,eAAe,OAAO,UAAU,UAAU,KAAK,CAAC;AAE3E,MAAI,iBAAiB,SAAS,GAAG;AAC/B,UAAM,KAAK,eAAe,iBAAiB,KAAK,IAAI,CAAC,EAAE;EACzD;AACA,QAAM,KAAK,EAAE;AAEb,0BAAwB,OAAO,oBAAoB,OAAO,YAAY,+BAA+B,WAAW;AAChH,0BAAwB,OAAO,mBAAmB,OAAO,WAAW,8BAA8B,WAAW;AAC7G,6BAA2B,OAAO,QAAQ,WAAW;AACrD,oBAAkB,OAAO,MAAM;AAC/B,uBAAqB,OAAO,MAAM;AAClC,sBAAoB,OAAO,MAAM;AACjC,6BAA2B,OAAO,QAAQ,aAAa,WAAW;AAClE,wBAAsB,OAAO,QAAQ,WAAW;AAChD,sBAAoB,OAAO,MAAM;AACjC,sBAAoB,OAAO,MAAM;AACjC,mBAAiB,OAAO,MAAM;AAC9B,sBAAoB,OAAO,MAAM;AACjC,uBAAqB,OAAO,MAAM;AAClC,wBAAsB,OAAO,MAAM;AACnC,8BAA4B,OAAO,MAAM;AAEzC,SAAO,MAAM,KAAK,IAAI;AACxB;AAkDA,eAAe,sBAAsB,SAAyB,QAAqB;AACjF,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAI,OAAO,IAAI;AACvD,QAAM,WAAW,MAAM,aAAa,MAAM;AAE1C,QAAM,kBAAkB,SAAS,WAAW,kBAAkB;AAE9D,QAAM,iBAAiB,6BAA6B,SAAS,MAAM;AACnE,QAAM,QAAQ,kBAAkB,QAAQ,OAAO,eAAe;AAC9D,SAAO;IACL;IACA;IACA;IACA;IACA,OAAO,kBAAkB,QAAQ,SAAS,QAAQ,UAAU,KAAK;IACjE,kBAAkB,qBAAqB,QAAQ,SAAS,OAAO,eAAe;IAC9E,eAAe,mBAAmB,QAAQ,eAAe,eAAe;IACxE,oBAAoB,wBAAwB,QAAQ,gBAAgB,eAAe;IACnF,aAAa,mBAAmB,QAAQ,MAAM;IAC9C,aAAa,wBAAwB,QAAQ,MAAM;IACnD,iBAAiB,yBAAyB,OAAO;;AAErD;AAEA,SAAS,qBAAqB,kBAAsC;AAClE,SAAO,iBAAiB,KAAK,CAAC,YAC5B,CAAC,aAAa,YAAY,YAAY,aAAa,oBAAoB,YAAY,EAAE,SAAS,OAAO,CAAC;AAE1G;AAEA,SAAS,mCAAmC,iBAA0C,OAA2B;AAC/G,SAAO;IACL,GAAG;IACH,GAAG;IACH,YAAY;IACZ,OAAO;IACP,QAAQ;;AAEZ;AAEA,eAAe,kBACb,SACA,QACA,SAAuB;AAEvB,QAAM,gBAAgB,qBAAqB,QAAQ,gBAAgB;AACnE,QAAM,cAA2B,QAAQ,gBAAgB,SACrD,EAAE,GAAG,QAAQ,iBAAiB,iBAAiB,KAAI,IACnD,mCAAmC,QAAQ,iBAAiB,EAAE,iBAAiB,KAAI,CAAE;AACzF,QAAM,SAAS,MAAM,QAAQ,QAAW,aAAa,MAAM;AAC3D,MAAI,oBAAoB,OAAO;AAC/B,MAAI,WAA8B;AAClC,MAAI,iBAAiB,QAAQ,gBAAgB,QAAW;AACtD,UAAM,YAAY,MAAM,QACtB,QACA,mCAAmC,QAAQ,iBAAiB,EAAE,iBAAiB,MAAK,CAAE,GACtF,MAAM;AAER,eAAW,UAAU;EACvB;AACA,QAAM,aAAa;AACnB,QAAM,aAAa,yBAAyB,QAAQ,aAAa,UAAU;AAC3E,MAAI,YAAY;AACd,wBAAoB,kBAAkB,OAAO,CAAC,SAAS,WAAW,IAAI,KAAK,GAAG,KAAI,EAAG,YAAW,CAAE,CAAC;AACnG,eAAW,SAAS,OAAO,CAAC,SAAS,WAAW,IAAI,KAAK,GAAG,KAAI,EAAG,YAAW,CAAE,CAAC;EACnF;AACA,SAAO,EAAE,QAAQ,mBAAmB,UAAU,YAAY,WAAU;AACtE;AAEA,SAAS,yBAAyB,aAAiC,YAA6B;AAC9F,MAAI,gBAAgB,QAAW;AAC7B,WAAO;EACT;AACA,QAAM,UAAU,kBAAkB,YAAY,WAAW;AACzD,MAAI,CAAC,QAAQ,OAAO;AAClB,UAAM,IAAI,WAAW,oCAAoC,WAAW,IAAI,UAAU,SAAS;EAC7F;AACA,SAAO,QAAQ;AACjB;AAEA,SAAS,0BACP,mBACA,UACA,gBACA,kBACA,OAAa;AAEb,QAAM,SAAS,CAAC,GAAG,iBAAiB,EAAE,KAAK,CAAC,MAAM,UAAU,qBAAqB,MAAM,OAAO,cAAc,CAAC;AAC7G,QAAM,iBAAiB,eAAe;AACtC,QAAM,cAAc,OAAO,OAAO,CAAC,SAAS,eAAe,IAAI,2BAA2B,KAAK,QAAQ,cAAc,CAAC,CAAC;AACvH,QAAM,eAAe,OAAO,OAAO,CAAC,SAClC,eAAe,iBAAiB,IAAI,2BAA2B,KAAK,QAAQ,cAAc,CAAC,CAAC;AAE9F,QAAM,mBAAmB,sBAAsB,QAAQ;AACvD,QAAM,wBAAwB,qBAAqB,gBAAgB,IAAI,mBAAmB;AAC1F,QAAM,YAAY,YACf,OAAO,CAAC,SAAS,iBAAiB,IAAI,KAAK,IAAI,CAAC,EAChD,MAAM,GAAG,KAAK,EACd,IAAI,CAAC,SAAS,mBAAmB,MAAM,gBAAgB,qBAAqB,CAAC;AAChF,QAAM,WAAW,YACd,OAAO,CAAC,SAAS,CAAC,iBAAiB,IAAI,KAAK,IAAI,CAAC,EACjD,MAAM,GAAG,KAAK,EACd,IAAI,CAAC,SAAS,mBAAmB,MAAM,gBAAgB,qBAAqB,CAAC;AAChF,QAAM,sBAAsB,YAAY,WAAW;AACnD,SAAO;IACL;IACA;IACA;IACA;IACA,iBAAiB,sBACb,aAAa,MAAM,GAAG,KAAK,EAAE,IAAI,CAAC,SAAS,mBAAmB,MAAM,gBAAgB,qBAAqB,CAAC,IAC1G,CAAA;IACJ;;AAEJ;AAEA,eAAe,mBACb,SACA,QACA,SACA,YAAmC;AAEnC,QAAM,kBAAmC;IACvC,GAAG,QAAQ;IACX,MAAM;IACN,SAAS;IACT,OAAO,QAAQ,gBAAgB,SAAY,OAAO,QAAQ,KAAK,IAAI;;AAErE,QAAM,SAAS,MAAM,YAAY,iBAAiB,MAAM;AACxD,QAAM,eACJ,eAAe,SACX,OAAO,SACP,OAAO,OAAO,OAAO,CAAC,UAAU,WAAW,IAAI,MAAM,QAAQ,KAAI,EAAG,YAAW,CAAE,CAAC;AACxF,QAAM,eAAe,6BAA6B,cAAc,QAAQ,cAAc,EAAE,MAAM,GAAG,QAAQ,KAAK;AAC9G,SAAO,EAAE,QAAQ,cAAc,eAAe,gBAAgB,YAAY,EAAC;AAC7E;AAEA,SAAS,mBAAmB,OAA0B,QAA4B,gBAAqC;AACrH,QAAM,eAAe,OAAO,MAAM;AAClC,SAAO,MAAM,OAAO,CAAC,SAAS,2BAA2B,KAAK,QAAQ,cAAc,MAAM,YAAY,EAAE;AAC1G;AAEA,eAAe,6BAA6B,QAO3C;AACC,QAAM,EAAE,SAAS,UAAU,YAAY,aAAa,KAAK,OAAM,IAAK;AACpE,QAAM,mBAAmB,sBAAsB,QAAQ;AACvD,QAAM,UAAU,IAAI,IAAI,WAAW,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;AACjE,QAAM,iBAAiB,SAAS,OAAO,CAAC,SAAS,CAAC,iBAAiB,KAAK,QAAQ,QAAQ,cAAc,CAAC;AACvG,QAAM,MAAM,CAAC,YAAgC,QAAQ,iBAAiB,SAAS,OAAO;AACtF,SAAO;IACL,WAAW,IAAI,WAAW,IAAI,eAAe,UAAU,YAAY,aAAa,QAAQ,gBAAgB,QAAQ,KAAK,IAAI;IACzH,UAAU,IAAI,UAAU,IAAI,MAAM,cAAc,QAAQ,eAAe,MAAM,IAAI;IACjF,UAAU,IAAI,UAAU,IAAI,cAAc,UAAU,YAAY,aAAa,QAAQ,gBAAgB,QAAQ,KAAK,IAAI;IACtH,iBAAiB,IAAI,UAAU,IAAI,cAAc,YAAY,cAAc,SAAS,QAAQ,KAAK,IAAI;IACrG,iBAAiB,IAAI,kBAAkB,IACnC,qBAAqB,gBAAgB,QAAQ,gBAAgB,kBAAkB,QAAQ,KAAK,IAC5F;IACJ,YAAY,IAAI,YAAY,IAAI,gBAAgB,gBAAgB,QAAQ,gBAAgB,kBAAkB,QAAQ,KAAK,IAAI;IAC3H,cAAc,IAAI,OAAO,IAAI,cAAc,YAAY,aAAa,QAAQ,KAAK,IAAI;IACrF,UAAU,IAAI,UAAU,IAAI,cAAc,YAAY,aAAa,QAAQ,gBAAgB,QAAQ,KAAK,IAAI;IAC5G,WAAW,IAAI,WAAW,IAAI,eAAe,gBAAgB,QAAQ,oBAAoB,KAAK,QAAQ,KAAK,IAAI;IAC/G,OAAO,IAAI,OAAO,IAAI,gBAAgB,YAAY,WAAW,IAAI;;AAErE;AAEA,SAAS,0BACP,eACA,UACA,gBAAqC;AAErC,MAAI,CAAC,eAAe;AAClB,WAAO,CAAA;EACT;AACA,QAAM,iBAAiB,qBAAqB,YAAY,cAAc;AACtE,SAAO;IACL,aAAa,SAAS;IACtB,QAAQ,SAAS,OAAO,CAAC,SAAS,eAAe,KAAK,QAAQ,cAAc,CAAC,EAAE;IAC/E,UAAU,SAAS,OAAO,CAAC,SAAS,2BAA2B,KAAK,QAAQ,cAAc,MAAM,cAAc,EAAE;;AAEpH;AAEA,SAAS,8BAA8B,QAAuB,UAAiC;AAC7F,MAAI,SAAS;AAAW,WAAO,YAAY,SAAS;AACpD,MAAI,SAAS;AAAU,WAAO,WAAW,SAAS;AAClD,MAAI,SAAS;AAAU,WAAO,WAAW,SAAS;AAClD,MAAI,SAAS;AAAiB,WAAO,WAAW,SAAS;AACzD,MAAI,SAAS;AAAiB,WAAO,mBAAmB,SAAS;AACjE,MAAI,SAAS;AAAY,WAAO,aAAa,SAAS;AACtD,MAAI,SAAS;AAAc,WAAO,QAAQ,SAAS;AACnD,MAAI,SAAS;AAAU,WAAO,WAAW,SAAS;AAClD,MAAI,SAAS;AAAW,WAAO,YAAY,SAAS;AACpD,MAAI,SAAS;AAAO,WAAO,QAAQ,SAAS;AAC9C;AAEA,SAAS,4BAA4B,QAAuB,aAAiC;AAC3F,MAAI,CAAC,aAAa;AAChB;EACF;AACA,SAAO,eAAe;AACtB,SAAO,aAAa,wBAAwB,OAAO,YAAY,WAAW;AAC1E,SAAO,YAAY,wBAAwB,OAAO,WAAW,WAAW;AACxE,SAAO,mBAAmB,wBAAwB,OAAO,kBAAkB,WAAW;AACtF,MAAI,OAAO,kBAAkB;AAC3B,WAAO,mBAAmB,wBAAwB,OAAO,kBAAkB,WAAW;EACxF;AACA,MAAI,OAAO,YAAY;AACrB,WAAO,aAAa,wBAAwB,OAAO,YAAY,WAAW;EAC5E;AACF;AAEA,SAAS,mCAAmC,QAAuB,aAAgC,cAA+B;AAChI,MAAI,YAAY,SAAS,KAAK,aAAa,SAAS,KAAK,OAAO,OAAO,OAAO,SAAS,GAAG;AACxF;EACF;AACA,SAAO,cAAc;IACnB;IACA;IACA;IACA;;AAEJ;AAKA,eAAsB,WAAW,SAAyB,QAAqB;AAC7E,QAAM,UAAU,MAAM,sBAAsB,SAAS,MAAM;AAC3D,QAAM,SAAS,MAAM,kBAAkB,SAAS,QAAQ,OAAO;AAC/D,QAAM,cAAc,0BAClB,OAAO,mBACP,OAAO,UACP,QAAQ,gBACR,QAAQ,kBACR,QAAQ,KAAK;AAEf,QAAM,gBAAgB,MAAM,mBAAmB,SAAS,QAAQ,SAAS,OAAO,UAAU;AAC1F,QAAM,WAAW,oBAAoB,OAAO,OAAO,UAAU,cAAc,OAAO,QAAQ;AAC1F,QAAM,kBAAkB,mBACtB,YAAY,aACZ,qBAAqB,eAAe,QAAQ,cAAc,GAC1D,QAAQ,cAAc;AAExB,QAAM,YAAY,mBAChB,YAAY,aACZ,qBAAqB,QAAQ,QAAQ,cAAc,GACnD,QAAQ,cAAc;AAExB,QAAM,WAAW,MAAM,6BAA6B;IAClD;IACA,UAAU,OAAO;IACjB,YAAY,OAAO;IACnB;IACA,KAAK,cAAc,OAAO;IAC1B;GACD;AACD,QAAM,gBAAgB,0BACpB,qBAAqB,QAAQ,gBAAgB,GAC7C,OAAO,UACP,QAAQ,cAAc;AAGxB,QAAM,SAAwB;IAC5B,gBAAgB;IAChB,KAAK,cAAc,OAAO;IAC1B,OAAO,QAAQ;IACf,mBAAmB,QAAQ;IAC3B,QAAQ;MACN,QAAQ,cAAc,OAAO;MAC7B,OAAO,cAAc,OAAO,MAAM;MAClC,KAAK,cAAc,OAAO,MAAM;MAChC,MAAM,cAAc,OAAO,MAAM;MACjC,MAAM,cAAc,OAAO,MAAM;MACjC,IAAI,cAAc,OAAO,MAAM;;IAEjC,SAAS;MACP,MAAM,QAAQ,QAAQ;MACtB,KAAK,QAAQ,OAAO;MACpB,UAAU,QAAQ,YAAY;MAC9B,UAAU,QAAQ,YAAY;MAC9B,iBAAiB,QAAQ,kBAAkB;MAC3C,QAAQ,QAAQ,UAAU;MAC1B,SAAS,QAAQ,WAAW;MAC5B,OAAO,QAAQ,SAAS,QAAQ,YAAY;MAC5C,QAAQ,QAAQ,eAAe;;MAE/B,iBAAkB,OAAO,OAAO,QAAQ,mBAAmB,cAAc,OAAO,QAAQ,mBAAmB,CAAA;;IAE7G,SAAS;MACP,cAAc,YAAY,YAAY;MACtC,aAAa;MACb,MAAM;MACN,SAAS,YAAY,aAAa;MAClC,uBAAuB,YAAY;MACnC,YAAY,YAAY,UAAU;MAClC,WAAW,YAAY,SAAS;MAChC,eAAe,cAAc,cAAc;MAC3C,GAAG;;IAEL,YAAY,YAAY;IACxB,WAAW,YAAY;IACvB,kBAAkB,YAAY;IAC9B,QAAQ;MACN,SAAS,cAAc;MACvB,QAAQ,cAAc;;;AAI1B,gCAA8B,QAAQ,QAAQ;AAC9C,8BAA4B,QAAQ,QAAQ,WAAW;AACvD,MAAI,SAAS,SAAS;AAAG,WAAO,WAAW;AAC3C,qCAAmC,QAAQ,YAAY,aAAa,YAAY,YAAY;AAE5F,SAAO;AACT;;;ACvtDA,OAAOC,SAAQ;AACf,OAAOC,WAAU;;;ACEX,SAAU,6BAA6B,OAAa;AACxD,SAAO,MACJ,KAAI,EACJ,YAAW,EACX,QAAQ,QAAQ,GAAG;AACxB;AAKM,SAAU,qBAAqB,OAAa;AAChD,SAAO,6BAA6B,KAAK,EACtC,MAAM,YAAY,EAClB,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AACvC;AAKM,SAAU,kBAAkB,YAAsB,aAAqB;AAC3E,MAAI,WAAW,WAAW,KAAK,YAAY,WAAW,GAAG;AACvD,WAAO;EACT;AACA,MAAI,WAAW,WAAW,KAAK,YAAY,WAAW,GAAG;AACvD,WAAO;EACT;AACA,QAAM,UAAU,IAAI,IAAI,UAAU;AAClC,QAAM,WAAW,IAAI,IAAI,WAAW;AACpC,MAAI,eAAe;AACnB,aAAW,SAAS,SAAS;AAC3B,QAAI,SAAS,IAAI,KAAK,GAAG;AACvB,sBAAgB;IAClB;EACF;AAEA,QAAM,SAAQ,oBAAI,IAAI,CAAC,GAAG,SAAS,GAAG,QAAQ,CAAC,GAAE;AACjD,SAAO,eAAe;AACxB;;;ACnCO,IAAM,sCAAsC;AAC5C,IAAM,uBAAuB;AACpC,IAAM,mBAAmB;AAEzB,IAAM,6BAA6B,oBAAI,IAAI;EACzC;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACD;AAoCD,SAAS,cAAc,QAAkB,OAAa;AACpD,QAAM,UAAoB,CAAA;AAC1B,QAAM,OAAO,oBAAI,IAAG;AACpB,aAAW,SAAS,QAAQ;AAC1B,UAAM,aAAa,MAAM,KAAI,EAAG,WAAW,QAAQ,GAAG;AACtD,QAAI,WAAW,WAAW,GAAG;AAC3B;IACF;AACA,UAAM,YAAY,WAAW,YAAW;AACxC,QAAI,KAAK,IAAI,SAAS,GAAG;AACvB;IACF;AACA,SAAK,IAAI,SAAS;AAClB,YAAQ,KAAK,UAAU;AACvB,QAAI,QAAQ,UAAU,OAAO;AAC3B;IACF;EACF;AACA,SAAO;AACT;AAEA,SAAS,kBAAkB,OAAa;AACtC,QAAM,kBAAkB,MAAM,YAAW;AACzC,MAAI,gBAAgB,SAAS,KAAK,gBAAgB,SAAS,KAAK,GAAG;AACjE,WAAO,GAAG,gBAAgB,MAAM,GAAG,EAAE,CAAC;EACxC;AACA,MACE,gBAAgB,SAAS,MACxB,gBAAgB,SAAS,MAAM,KAC9B,gBAAgB,SAAS,MAAM,KAC/B,gBAAgB,SAAS,KAAK,KAC9B,gBAAgB,SAAS,KAAK,KAC9B,gBAAgB,SAAS,MAAM,IACjC;AACA,WAAO,gBAAgB,MAAM,GAAG,EAAE;EACpC;AACA,MACE,gBAAgB,SAAS,KACzB,gBAAgB,SAAS,GAAG,KAC5B,CAAC,gBAAgB,SAAS,IAAI,KAC9B,CAAC,gBAAgB,SAAS,IAAI,KAC9B,CAAC,gBAAgB,SAAS,IAAI,KAC9B,CAAC,gBAAgB,SAAS,IAAI,GAC9B;AACA,WAAO,gBAAgB,MAAM,GAAG,EAAE;EACpC;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,OAAa;AACpC,QAAM,kBAAkB,MAAM,YAAW;AACzC,MAAI,gBAAgB,SAAS,MAAM,CAAC,gBAAgB,SAAS,GAAG,KAAK,gBAAgB,SAAS,IAAI,IAAI;AACpG,QAAI,gBAAgB,SAAS,GAAG,KAAK,CAAC,aAAa,KAAK,eAAe,GAAG;AACxE,aAAO,GAAG,gBAAgB,MAAM,GAAG,EAAE,CAAC;IACxC;AACA,QACE,gBAAgB,SAAS,IAAI,KAC7B,gBAAgB,SAAS,IAAI,KAC7B,gBAAgB,SAAS,GAAG,KAC5B,gBAAgB,SAAS,GAAG,KAC5B,gBAAgB,SAAS,IAAI,GAC7B;AACA,aAAO,GAAG,eAAe;IAC3B;AACA,WAAO,GAAG,eAAe;EAC3B;AACA,SAAO;AACT;AAKM,SAAU,kCACd,OACA,aAAa,qCAAmC;AAEhD,QAAM,kBAAkB,MAAM,KAAI,EAAG,WAAW,QAAQ,GAAG;AAC3D,MAAI,gBAAgB,WAAW,GAAG;AAChC,WAAO,CAAA;EACT;AACA,QAAM,SAAS,qBAAqB,eAAe;AACnD,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,CAAC,eAAe;EACzB;AACA,QAAM,gBAAgB,OAAO,OAAO,CAAC,UAAU,CAAC,2BAA2B,IAAI,MAAM,YAAW,CAAE,CAAC;AACnG,QAAM,eAAe,OAAO,IAAI,CAAC,UAAU,kBAAkB,KAAK,CAAC;AACnE,QAAM,aAAa,cAAc,IAAI,CAAC,UAAU,gBAAgB,KAAK,CAAC;AACtE,SAAO,cACL;IACE;IACA,OAAO,KAAK,GAAG;IACf,cAAc,KAAK,GAAG;IACtB,aAAa,KAAK,GAAG;IACrB,WAAW,KAAK,GAAG;KAErB,KAAK,IAAI,GAAG,UAAU,CAAC;AAE3B;AAKM,SAAU,8BAA8B,KAAY;AACxD,QAAM,aAAa,MAAM,QAAQ,GAAG,IAChC,MACC,KAAkD;AACvD,MAAI,CAAC,MAAM,QAAQ,UAAU,GAAG;AAC9B,WAAO,CAAA;EACT;AACA,SAAO,cACL,WAAW,OAAO,CAAC,UAA2B,OAAO,UAAU,QAAQ,GACvE,mCAAmC;AAEvC;AAKM,SAAU,qBAAqB,MAAgB,OAAiB,YAAkB;AACtF,SAAO,cAAc,CAAC,GAAG,MAAM,GAAG,KAAK,GAAG,KAAK,IAAI,GAAG,UAAU,CAAC;AACnE;AAKM,SAAU,4BACd,UACA,sBAAmC;AAEnC,QAAM,SAAU,SAA0F;AAC1G,QAAM,iBAAiB,QAAQ;AAC/B,QAAM,qBAAqB,iBAAiB,gBAAgB,QAAQ;AACpE,SAAO;IACL,SAAS,gBAAgB,YAAY;IACrC,UAAU,sBAAsB;IAChC,aAAa;;AAEjB;AAKM,SAAU,oBAAoB,UAAsB,eAAqB;AAC7E,QAAM,SAAU,SAA+F;AAC/G,QAAM,SAAS,QAAQ;AACvB,QAAM,kBAAkB,iBAAiB,QAAQ,KAAK;AACtD,QAAM,iBAAiB,sBAAsB,QAAQ,KAAK;AAC1D,QAAM,iBAAiB,kBAAkB;AACzC,SAAO;IACL,SAAS,QAAQ,YAAY;IAC7B,OAAO,mBAAmB;IAC1B,OAAO,KAAK,IAAI,kBAAkB,cAAc;;AAEpD;AAKM,SAAU,sBAAsB,KAAY;AAChD,QAAM,UAAU,MAAM,QAAQ,GAAG,IAC7B,MACC,KAA+C;AACpD,MAAI,CAAC,MAAM,QAAQ,OAAO,GAAG;AAC3B,WAAO,CAAA;EACT;AACA,QAAM,WAAW,oBAAI,IAAG;AACxB,aAAW,SAAS,SAAS;AAC3B,QAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAC/C;IACF;AACA,UAAM,KAAK,iBAAkB,MAA2B,EAAE;AAC1D,UAAM,QAAS,MAA8B;AAC7C,QAAI,CAAC,MAAM,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GAAG;AAC/D;IACF;AACA,UAAM,WAAW,SAAS,IAAI,EAAE;AAChC,QAAI,aAAa,UAAa,QAAQ,UAAU;AAC9C,eAAS,IAAI,IAAI,KAAK;IACxB;EACF;AACA,QAAM,aAAa,CAAC,GAAG,SAAS,QAAO,CAAE,EAAE,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,IAAI,MAAK,EAAG;AAC/E,aAAW,KAAK,CAAC,MAAM,UAAS;AAC9B,QAAI,KAAK,UAAU,MAAM,OAAO;AAC9B,aAAO,MAAM,QAAQ,KAAK;IAC5B;AACA,WAAO,KAAK,GAAG,cAAc,MAAM,EAAE;EACvC,CAAC;AACD,SAAO;AACT;AAEA,SAAS,WAAW,MAAgB,OAAe;AACjD,QAAM,OAAO,KAAK;AAClB,MAAI,SAAS;AACb,WAAS,QAAQ,GAAG,QAAQ,MAAM,SAAS,GAAG;AAC5C,cAAU,KAAK,KAAK,IAAI,MAAM,KAAK;EACrC;AACA,SAAO;AACT;AAEA,SAAS,OAAO,QAAgB;AAC9B,MAAI,aAAa;AACjB,WAAS,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;AACrD,kBAAc,OAAO,KAAK,IAAI,OAAO,KAAK;EAC5C;AACA,SAAO,KAAK,KAAK,UAAU;AAC7B;AAEA,SAAS,kCACP,MACA,OACA,UAAgB;AAEhB,MAAI,CAAC,QAAQ,CAAC,SAAS,KAAK,WAAW,KAAK,MAAM,WAAW,KAAK,KAAK,WAAW,MAAM,QAAQ;AAC9F,WAAO;EACT;AACA,QAAM,YAAY,WAAW,MAAM,KAAK;AACxC,QAAM,YAAY,OAAO,KAAK;AAC9B,QAAM,cAAc,WAAW;AAC/B,MACE,CAAC,OAAO,SAAS,SAAS,KAC1B,CAAC,OAAO,SAAS,QAAQ,KACzB,CAAC,OAAO,SAAS,SAAS,KAC1B,CAAC,OAAO,SAAS,WAAW,KAC5B,gBAAgB,GAChB;AACA,WAAO;EACT;AACA,SAAO,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,YAAY,WAAW,CAAC;AAC1D;AAKA,eAAsB,+BACpB,UACA,OACA,OACA,YACA,WAAkB;AAElB,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,oBAAI,IAAG;EAChB;AACA,QAAM,iBAAiB,iBAAiB,KAAK,KAAK,SAAS;AAC3D,QAAM,iBACJ,mBAAmB,SAAS,QAAQ,WAAW,EAAE,GAAG,UAAU,OAAO,eAAc;AACrF,QAAM,UAAU,CAAC,MAAM,KAAI,GAAI,GAAG,WAAW,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC;AACvE,QAAM,UAAU,MAAM,wBAAwB,gBAAgB,SAAS,YAAY,EAAE,YAAY,UAAS,IAAK,CAAA,CAAE;AACjH,QAAM,cAAc,QAAQ,CAAC;AAC7B,MAAI,CAAC,aAAa;AAChB,WAAO,oBAAI,IAAG;EAChB;AACA,QAAM,YAAY,OAAO,WAAW;AACpC,QAAM,YAAY,oBAAI,IAAG;AACzB,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS,GAAG;AACzD,UAAM,YAAY,WAAW,KAAK;AAClC,UAAM,kBAAkB,QAAQ,QAAQ,CAAC;AACzC,QAAI,CAAC,iBAAiB;AACpB;IACF;AACA,UAAM,aAAa,kCAAkC,aAAa,iBAAiB,SAAS;AAC5F,cAAU,IAAI,UAAU,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,aAAa,KAAK,CAAC,CAAC,CAAC;EAC5E;AACA,SAAO;AACT;;;AChTO,IAAM,kBAAkB;AAOxB,IAAM,iBAAiB;AAqDxB,SAAU,aAAa,MAAY;AACvC,SAAO,qBAAqB,IAAI;AAClC;AAKA,SAAS,qBAAqB,QAAgB;AAC5C,QAAM,cAAc,oBAAI,IAAG;AAC3B,aAAW,SAAS,QAAQ;AAC1B,gBAAY,IAAI,QAAQ,YAAY,IAAI,KAAK,KAAK,KAAK,CAAC;EAC1D;AACA,SAAO;AACT;AAUM,SAAU,eAAe,WAAyB;AACtD,QAAM,QAA6B,CAAA;AACnC,QAAM,oBAAoB,oBAAI,IAAG;AACjC,MAAI,cAAc;AAClB,aAAW,YAAY,WAAW;AAChC,UAAM,SAAS,aAAa,SAAS,IAAI;AACzC,UAAM,kBAAkB,qBAAqB,MAAM;AACnD,mBAAe,OAAO;AACtB,eAAW,QAAQ,gBAAgB,KAAI,GAAI;AACzC,wBAAkB,IAAI,OAAO,kBAAkB,IAAI,IAAI,KAAK,KAAK,CAAC;IACpE;AACA,UAAM,KAAK,EAAE,IAAI,SAAS,IAAI,iBAAiB,QAAQ,OAAO,OAAM,CAAE;EACxE;AACA,QAAM,gBAAgB,MAAM;AAC5B,SAAO;IACL,WAAW;IACX;IACA;IACA,uBAAuB,gBAAgB,IAAI,cAAc,gBAAgB;;AAE7E;AAQA,SAAS,yBAAyB,eAAuB,uBAA6B;AACpF,SAAO,KAAK,IAAI,KAAK,gBAAgB,wBAAwB,QAAQ,wBAAwB,IAAI;AACnG;AAUM,SAAU,eAAe,OAAkB,aAAuB,QAAkB;AACxF,QAAM,SAAS,oBAAI,IAAG;AAKtB,MAAI,MAAM,kBAAkB,KAAK,MAAM,0BAA0B,GAAG;AAClE,WAAO;EACT;AACA,QAAM,qBAAqB,CAAC,GAAG,IAAI,IAAI,YAAY,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC,CAAC,CAAC;AACvF,MAAI,mBAAmB,WAAW,GAAG;AACnC,WAAO;EACT;AAEA,QAAM,YAAY,oBAAI,IAAG;AACzB,aAAW,QAAQ,oBAAoB;AACrC,UAAM,wBAAwB,MAAM,kBAAkB,IAAI,IAAI;AAC9D,QAAI,0BAA0B,QAAW;AACvC;IACF;AACA,cAAU,IAAI,MAAM,yBAAyB,MAAM,eAAe,qBAAqB,CAAC;EAC1F;AACA,MAAI,UAAU,SAAS,GAAG;AACxB,WAAO;EACT;AACA,aAAW,YAAY,MAAM,WAAW;AACtC,QAAI,QAAQ;AACZ,eAAW,CAAC,MAAM,GAAG,KAAK,WAAW;AACnC,YAAM,gBAAgB,SAAS,gBAAgB,IAAI,IAAI;AACvD,UAAI,kBAAkB,QAAW;AAC/B;MACF;AACA,YAAM,sBACJ,IAAI,OAAO,IAAK,OAAO,IAAI,SAAS,SAAU,MAAM;AACtD,YAAM,cAAc,gBAAgB,OAAO,KAAK;AAChD,eAAS,OAAQ,iBAAiB,OAAO,KAAK,KAAM;IACtD;AACA,QAAI,QAAQ,GAAG;AACb,aAAO,IAAI,SAAS,IAAI,KAAK;IAC/B;EACF;AACA,SAAO;AACT;AASA,SAAS,oBAAoB,WAAoB,UAAkB,KAAa,KAAW;AACzF,MAAI,OAAO,cAAc,YAAY,CAAC,OAAO,SAAS,SAAS,GAAG;AAChE,WAAO;EACT;AACA,SAAO,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,SAAS,CAAC;AAC/C;AAWM,SAAU,wBAAwB,QAA+B;AACrE,QAAM,mBAAmB,CAAC,UAA4B;AACpD,QAAI,OAAO,UAAU,UAAU;AAC7B,aAAO,CAAC,KAAK;IACf;AACA,QAAI,OAAO,UAAU,UAAU;AAC7B,aAAO,CAAC,OAAO,KAAK,CAAC;IACvB;AACA,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,aAAO,MAAM,QAAQ,gBAAgB;IACvC;AACA,QAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAC/C,aAAO,OAAO,OAAO,KAAK,EAAE,QAAQ,gBAAgB;IACtD;AACA,WAAO,CAAA;EACT;AACA,SAAO,iBAAiB,OAAO,OAAO,MAAM,CAAC,EAAE,KAAK,GAAG;AACzD;AAQM,SAAU,kBAAkB,UAAgD;AAChF,QAAM,OAAQ,UAAU,QAAiE;AACzF,SAAO;IACL,IAAI,oBAAoB,MAAM,IAAI,iBAAiB,GAAG,GAAK;IAC3D,GAAG,oBAAoB,MAAM,GAAG,gBAAgB,GAAG,CAAC;;AAExD;;;AH9GA,IAAM,gCAAgC;EACpC;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;AAGF,IAAM,wBAAwB,oBAAI,IAAI,CAAC,SAAS,kBAAkB,YAAY,CAAC;AAC/E,IAAM,yBAAyB,oBAAI,IAAI;EACrC;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACD;AAED,IAAM,6BAA6B;AACnC,IAAM,+BAA+B;AACrC,IAAM,+BAA+B;AAKrC,IAAM,2BAA2B;AACjC,IAAM,uBAAuB;AAC7B,IAAM,uBAAuB;AAO7B,IAAM,iBAAiB;AACvB,IAAM,kBAAkB;AACxB,IAAM,2BAA2B;AAOjC,IAAM,6BAA6B,CAAC,OAAO,UAAU,QAAQ,UAAU;AAGvE,IAAM,2CAA2C;EAC/C;IACE,WAAW;IACX,YAAY;IACZ,WAAW,CAAC,UAAoB,uBAAuB,KAAK,IAAI,QAAQ;;EAE1E,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,YAAY,YAAY,WAAU;EAC/C,EAAE,WAAW,UAAU,YAAY,SAAQ;EAC3C,EAAE,WAAW,WAAW,YAAY,UAAS;EAC7C,EAAE,WAAW,UAAU,YAAY,SAAQ;;AAoF7C,SAAS,iBAAiB,OAAc;AACtC,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK,KAAK,OAAO,KAAK,KAAK,EAAE,SAAS;AAC7G;AAEA,SAAS,gCAAgC,QAUxC;AACC,QAAM,EACJ,MACA,WACA,SACA,eACA,YACA,aACA,gBACA,sBACA,oBAAmB,IACjB;AACJ,QAAM,UAAmC,CAAA;AACzC,uBAAqB,SAAS,SAAS,wCAAwC;AAC/E,SAAO,OAAO,SAAS,iCAAiC,OAAkC,CAAC;AAC3F,SAAO,OAAO,SAAS,uBAAuB,OAAkC,CAAC;AACjF,MAAI,cAAc,MAAM;AACtB,YAAQ,aAAa;EACvB;AACA,MAAI,eAAe;AACjB,YAAQ,iBAAiB;EAC3B;AACA,MAAI,YAAY;AACd,YAAQ,cAAc;EACxB;AACA,MAAI,aAAa;AACf,YAAQ,eAAe;EACzB;AACA,MAAI,iBAAiB,GAAG;AACtB,YAAQ,kBAAkB;EAC5B;AACA,MAAI,SAAS,YAAY,QAAQ,mBAAmB,QAAW;AAC7D,YAAQ,yBAAyB;EACnC;AACA,MAAI,QAAQ,UAAU,QAAW;AAC/B,YAAQ,QAAQ,QAAQ;EAC1B;AACA,MAAI,iBAAiB,mBAAmB,GAAG;AACzC,YAAQ,kBAAkB;EAC5B;AACA,SAAO;AACT;AAIA,SAAS,0BAA0B,QAYlC;AACC,QAAM,EACJ,eACA,WACA,SACA,eACA,YACA,aACA,gBACA,sBACA,gBACA,QACA,oBAAmB,IACjB;AACJ,SAAO;IACL,MAAM;IACN,YAAY;IACZ,QAAQ,uBAAuB,QAAQ,MAAM,IAAI,QAAQ,YAAY,QAAQ,MAAM;IACnF,MAAM,YAAY,QAAQ,IAAI;IAC9B,KAAK,YAAY,QAAQ,GAAG;IAC5B,UAAU,YAAY,QAAQ,QAAQ;IACtC,iBAAiB,YAAY,QAAQ,cAAc;IACnD,gBAAgB,YAAY,QAAQ,aAAa;IACjD,eAAe,YAAY,QAAQ,YAAY;IAC/C,gBAAgB,YAAY,QAAQ,aAAa;IACjD,eAAe,YAAY,QAAQ,YAAY;IAC/C,gBAAgB,YAAY,QAAQ,aAAa;IACjD,UAAU,YAAY,QAAQ,QAAQ;IACtC,QAAQ,YAAY,QAAQ,MAAM;IAClC,SAAS,YAAY,QAAQ,OAAO;IACpC,QAAQ,YAAY,QAAQ,MAAM;IAClC,GAAG,iCAAiC,OAAkC;IACtE,GAAG,uBAAuB,OAAkC;IAC5D,gBAAgB;IAChB,aAAa;IACb,cAAc;IACd,iBAAiB;IACjB,wBAAwB,kBAAkB,WAAW,uBAAuB;IAC5E,yBAAyB,eAAe;IACxC,0BAA0B,eAAe;IACzC,gBAAgB,OAAO;IACvB,cAAc,OAAO;IACrB,cAAc,OAAO;IACrB,OAAO,YAAY,QAAQ,KAAK;IAChC,iBAAiB;;AAErB;AAEA,SAAS,YAAY,OAAc;AACjC,SAAO,SAAS;AAClB;AA6FM,SAAU,uBAAuB,OAAc;AACnD,QAAM,QAAkB,CAAA;AACxB,MAAI,UAAmB;AACvB,WAAS,QAAQ,GAAG,QAAQ,KAAK,WAAW,OAAO,YAAY,UAAU,SAAS,GAAG;AACnF,UAAM,OAAQ,QAA+B;AAC7C,QAAI,OAAO,SAAS,UAAU;AAC5B,YAAM,KAAK,KAAK,YAAW,CAAE;IAC/B;AACA,cAAW,QAAgC;EAC7C;AACA,SAAO,MAAM,KAAK,GAAG;AACvB;AAOM,SAAU,uCAAuC,OAAc;AACnE,QAAM,WAAW,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,GAAG,YAAW;AACpF,QAAM,aAAa,uBAAuB,KAAK;AAC/C,QAAM,WAAW,GAAG,OAAO,IAAI,UAAU;AACzC,MAAI,SAAS,SAAS,WAAW,KAAK,SAAS,SAAS,SAAS,KAAK,SAAS,SAAS,WAAW,GAAG;AACpG,WAAO;EACT;AACA,MACE,SAAS,SAAS,cAAc,KAChC,SAAS,SAAS,oBAAoB,KACtC,SAAS,SAAS,UAAU,KAC5B,SAAS,SAAS,WAAW,KAC7B,SAAS,SAAS,WAAW,KAC7B,SAAS,SAAS,YAAY,KAC9B,SAAS,SAAS,cAAc,GAChC;AACA,WAAO;EACT;AACA,SAAO;AACT;AAKA,SAAS,qCAAqC,eAA2B,OAAc;AACrF,QAAM,SAAS,uCAAuC,KAAK;AAC3D,SAAO,UAAU,aAAa,aAAa,MAAM;AACnD;AASA,eAAe,iCACb,QACA,mBACA,UAAkB;AAElB,MAAI;AACF,UAAM,SAAS,MAAM,8BAA8B,MAAM;AACzD,QAAI,OAAO,SAAS,SAAS,GAAG;AAC9B,eAAS,KAAK,GAAG,OAAO,QAAQ;IAClC;AACA,UAAM,WAAW,6BACf,kBAAkB,IAAI,CAAC,cAAc;MACnC,IAAI,SAAS,SAAS;MACtB,YAAY,SAAS,SAAS;MAC9B,GACF,OAAO,OAAO;AAEhB,QAAI,SAAS,WAAW,GAAG;AACzB;IACF;AACA,aAAS,KAAK,sBAAsB,SAAS,MAAM,EAAE;AAErD,YAAQ,OAAO,MACb,iBAAiB,SAAS,MAAM,QAAQ,SAAS,WAAW,IAAI,QAAQ,OAAO,+CAA+C,SAAS,WAAW,IAAI,OAAO,KAAK;CAAqR;EAG3b,QAAQ;EAER;AACF;AAEA,SAAS,UAAU,KAAyB,UAA2B;AACrE,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,MAAI,eAAe,aAAa,eAAe,cAAc,eAAe,UAAU;AACpF,UAAM,IAAI,WAAW,sDAAsD,UAAU,KAAK;EAC5F;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,KAAwB;AAClD,SAAO,QAAQ;AACjB;AAEA,SAAS,gBAAgB,KAAwB;AAC/C,SAAO,QAAQ;AACjB;AAEA,SAAS,iBAAiB,KAAwB;AAChD,SAAO,QAAQ;AACjB;AAEA,SAAS,4BAA4B,KAAY;AAC/C,SAAO,oBAAoB,KAAK,GAAG,CAAC,KAAK;AAC3C;AAEA,SAAS,eAAe,KAAuB;AAC7C,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,MAAI,eAAe,SAAS,eAAe,QAAQ,eAAe,SAAS;AACzE,UAAM,IAAI,WAAW,mDAAmD,UAAU,KAAK;EACzF;AACA,SAAO;AACT;AAIA,SAAS,sBAAsB,KAAY;AACzC,MAAI,QAAQ,UAAa,QAAQ,QAAQ,QAAQ,IAAI;AACnD,WAAO;EACT;AAEA,QAAM,SAAS,OAAO,QAAQ,WAAW,MAAM,OAAO,OAAO,GAAG,EAAE,KAAI,CAAE;AAExE,MAAI,CAAC,OAAO,SAAS,MAAM,KAAK,SAAS,GAAG;AAC1C,UAAM,IAAI,WAAW,mDAAmD,UAAU,KAAK;EACzF;AACA,SAAO;AACT;AAMA,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,sBAAsB,OAAa;AAC1C,SAAO,MACJ,YAAW,EACX,QAAQ,QAAQ,GAAG,EACnB,KAAI;AACT;AAEA,SAAS,cAAc,KAAyB,YAAkB;AAChE,MAAI,QAAQ;AAAW,WAAO;AAC9B,SAAO,qBAAqB,KAAK,oBAAI,KAAI,GAAI,UAAU;AACzD;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,kEAAkE,UAAU,KAAK;EACxG;AACA,SAAO,CAAC,GAAG,IAAI,IAAI,SAAS,CAAC;AAC/B;AAEA,SAAS,sBAAsB,SAAsB;AACnD,QAAM,mBAAmB,QAAQ,YAAY;AAC7C,QAAM,gBAAgB,QAAQ,SAAS;AACvC,QAAM,iBAAiB,oBAAoB,QAAQ,MAAM;AACzD,QAAM,eAAe,OAAO,gBAAgB,IAAI,OAAO,aAAa,IAAI,OAAO,mBAAmB,MAAS;AAC3G,MAAI,eAAe,GAAG;AACpB,UAAM,IAAI,WACR,gGACA,UAAU,KAAK;EAEnB;AACA,MAAI,kBAAkB;AACpB,WAAO;MACL,MAAM;MACN,QAAQ,CAAC,GAAG,6BAA6B;;EAE7C;AACA,MAAI,eAAe;AACjB,WAAO;MACL,MAAM;MACN,QAAQ,CAAA;;EAEZ;AACA,MAAI,gBAAgB;AAClB,WAAO;MACL,MAAM;MACN,QAAQ;;EAEZ;AACA,SAAO;IACL,MAAM;IACN,QAAQ,CAAA;;AAEZ;AAmDA,SAAS,+BAA+B,YAAoC,sBAA0C;AACpH,MAAI,WAAW,SAAS,UAAU;AAChC;EACF;AACA,QAAM,cAAc,IAAI,IAAI,qBAAqB,YAAY,QAAQ,CAAC,UAAU,CAAC,MAAM,KAAK,MAAM,YAAY,CAAC,CAAC;AAChH,QAAM,UAAU,WAAW,OAAO,OAAO,CAAC,UAAS;AACjD,UAAM,aAAa,MAAM,KAAI;AAC7B,UAAM,UAAU,WAAW,WAAW,OAAO,IAAI,WAAW,MAAM,QAAQ,MAAM,IAAI;AACpF,WAAO,CAAC,sBAAsB,IAAI,UAAU,KAAK,CAAC,uBAAuB,IAAI,OAAO,KAAK,CAAC,YAAY,IAAI,OAAO;EACnH,CAAC;AACD,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,IAAI,WAAW,qCAAqC,QAAQ,KAAK,IAAI,CAAC,IAAI,UAAU,OAAO;MAC/F,UAAU;QACR;QACA;;MAEF,WAAW,CAAC,sGAAsG;KACnH;EACH;AACF;AAGA,SAAS,YAAY,OAAa;AAChC,QAAM,aAAa,sBAAsB,KAAK;AAC9C,MAAI,CAAC,YAAY;AACf,UAAM,IAAI,WAAW,kCAAkC,UAAU,KAAK;EACxE;AACA,SAAO,WAAW,MAAM,KAAK,EAAE,OAAO,OAAO;AAC/C;AAqBA,SAAS,wBAAwB,OAAa;AAC5C,QAAM,gBAAiE,CAAA;AACvE,QAAM,iBAA2B,CAAA;AACjC,aAAW,SAAS,MAAM,MAAM,KAAK,EAAE,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC,GAAG;AAC1E,UAAM,iBAAiB,MAAM,QAAQ,GAAG;AACxC,UAAM,QAAQ,iBAAiB,IAAI,MAAM,MAAM,GAAG,cAAc,EAAE,YAAW,IAAK;AAClF,UAAM,QAAQ,iBAAiB,IAAI,MAAM,MAAM,iBAAiB,CAAC,IAAI;AACrE,UAAM,eAAgB,2BAAqD,SAAS,KAAK,IACpF,QACD;AACJ,QAAI,gBAAgB,MAAM,SAAS,KAAK,cAAc,YAAY,MAAM,QAAW;AACjF,oBAAc,YAAY,IAAI;AAC9B;IACF;AACA,mBAAe,KAAK,KAAK;EAC3B;AACA,SAAO;IACL,eAAe,eAAe,KAAK,GAAG;IACtC;;AAEJ;AAUA,SAAS,wBACP,SACA,eACA,UAAkB;AAElB,QAAM,SAAwB,EAAE,GAAG,QAAO;AAC1C,aAAW,SAAS,4BAA4B;AAC9C,UAAM,cAAc,cAAc,KAAK;AACvC,QAAI,gBAAgB,QAAW;AAC7B;IACF;AACA,QAAI,4BAA4B,OAAO,KAAK,CAAC,MAAM,QAAW;AAC5D,eAAS,KAAK,gCAAgC,KAAK,wBAAwB;AAC3E;IACF;AACA,WAAO,KAAK,IAAI;EAClB;AACA,SAAO;AACT;AAEA,SAAS,YAAY,OAAc;AACjC,SAAO,MAAM,QAAQ,KAAK,IAAI,MAAM,OAAO,CAAC,UAA2B,OAAO,UAAU,QAAQ,IAAI,CAAA;AACtG;AAEA,SAAS,YAAY,OAAc;AACjC,SAAO,MAAM,QAAQ,KAAK,IACtB,MAAM,OAAO,CAAC,UACZ,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAQ,MAA6B,SAAS,QAAQ,IAEvG,CAAA;AACN;AAEA,SAAS,kBAAkB,OAAc;AACvC,SAAO,MAAM,QAAQ,KAAK,IACtB,MAAM,OAAO,CAAC,UACZ,OAAO,UAAU,YACjB,UAAU,QACV,OAAQ,MAA2B,OAAO,YAC1C,OAAQ,MAA6B,SAAS,QAAQ,IAExD,CAAA;AACN;AAEA,SAAS,yBAAyB,UAAsB;AACtD,QAAM,OAAO,SAAS;AACtB,SAAO;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,YAAY,KAAK,IAAI,EAAE,KAAK,GAAG;IAC/B,SAAS;IACT,YAAY,KAAK,QAAQ,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI,EAAE,KAAK,GAAG;IAC9D,YAAY,KAAK,KAAK,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI,EAAE,KAAK,GAAG;IAC3D,YAAY,KAAK,SAAS,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI,EAAE,KAAK,GAAG;IAC/D,oBAAoB,IAAI,EAAE,KAAK,GAAG;IAClC,iBAAiB,IAAI,EAAE,KAAK,GAAG;IAC/B,kBAAkB,KAAK,YAAY,EAAE,IAAI,CAAC,UAAU,GAAG,MAAM,EAAE,IAAI,MAAM,IAAI,EAAE,EAAE,KAAK,GAAG;IACzF,oBAAoB,IAAI;;AAE5B;AAEA,SAAS,4BAA4B,UAAwB,iBAAuB;AAClF,SAAO,yBAAyB,QAAQ,EAAE,KAAK,CAAC,eAC9C,sBAAsB,UAAU,EAAE,SAAS,eAAe,CAAC;AAE/D;AAEA,SAAS,uBACP,OACA,iBACA,SAAsD;AAEtD,MAAI,CAAC,QAAQ,cAAc,CAAC,QAAQ,aAAa;AAC/C,WAAO;EACT;AACA,SAAO,MAAM,OAAO,CAAC,aAAY;AAC/B,QAAI,QAAQ,cAAc,sBAAsB,SAAS,SAAS,KAAK,MAAM,iBAAiB;AAC5F,aAAO;IACT;AACA,QAAI,QAAQ,eAAe,CAAC,4BAA4B,UAAU,eAAe,GAAG;AAClF,aAAO;IACT;AACA,WAAO;EACT,CAAC;AACH;AA0BA,SAAS,2BAA2B,gBAAkC;AAIpE,MAAI,mBAAmB,eAAe,YAAW,MAAO,UAAU,eAAe,YAAW,MAAO,SAAS;AAC1G,UAAM,IAAI,WAAW,kDAAkD,UAAU,KAAK;EACxF;AACF;AAEA,SAAS,+BACP,SACA,cACA,cAAsC;AAEtC,QAAM,iBAAiB,QAAQ,UAAU,KAAI;AAC7C,6BAA2B,cAAc;AACzC,QAAM,yBAAyB,8BAA8B,OAAO;AACpE,QAAM,sBAAsB,2BAA2B,OAAkC;AACzF,SAAO;IACL,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,cAAc,QAAQ,QAAQ,KAAI;IAClC,eAAe,QAAQ,SAAS,KAAI;IACpC,cAAc,QAAQ,QAAQ,KAAI;IAClC,WAAW,gBAAgB,aAAa,SAAS,IAAI,IAAI,IAAgB,YAAY,IAAI;IACzF;IACA,uBAAuB,yBAAyB,sBAAsB;IACtE;IACA,sBAAsB,sBAAsB,mBAAmB;;AAEnE;AAEA,SAAS,2BAA2B,MAAuB,SAAgC;AACzF,SACE,6BAA6B,MAAM,OAAO,KAC1C,8BAA8B,MAAM,OAAO,KAC3C,0BAA0B,MAAM,OAAO;AAE3C;AAEA,SAAS,6BAA6B,MAAuB,SAAgC;AAC3F,MAAI,QAAQ,aAAa,CAAC,QAAQ,UAAU,IAAI,KAAK,MAAM;AAAG,WAAO;AACrE,MAAI,QAAQ,cAAc,KAAK,SAAS,QAAQ;AAAY,WAAO;AACnE,MAAI,QAAQ,aAAa,CAAC,YAAY,KAAK,IAAI,EAAE,SAAS,QAAQ,SAAS;AAAG,WAAO;AACrF,MAAI,QAAQ,mBAAmB,UAAa,KAAK,aAAa,QAAQ;AAAgB,WAAO;AAC7F,SAAO;AACT;AAEA,SAAS,8BAA8B,MAAuB,SAAgC;AAC5F,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,MAAI,QAAQ,iBAAiB,wBAAwB,KAAK,YAAY,QAAQ,aAAa,IAAI;AAAG,WAAO;AACzG,SAAO;AACT;AAEA,SAAS,0BAA0B,MAAuB,SAAgC;AACxF,MAAI,QAAQ,mBAAmB,UAAa,KAAK,aAAa,QAAQ;AAAgB,WAAO;AAC7F,MAAI,QAAQ,iBAAiB,UAAa,KAAK,WAAW,QAAQ;AAAc,WAAO;AAEvF,MAAI,QAAQ,kBAAkB,UAAa,KAAK,YAAY,QAAQ;AAAe,WAAO;AAC1F,MAAI,QAAQ,iBAAiB,UAAa,KAAK,WAAW,QAAQ;AAAc,WAAO;AAEvF,SAAO;AACT;AAEA,SAAS,6BACP,UACA,SACA,qBACA,qBAAwC;AAExC,QAAM,OAAO,SAAS;AACtB,MAAI,CAAC,2BAA2B,MAAM,OAAO,GAAG;AAC9C,WAAO;EACT;AACA,MAAI,CAAC,sBAAsB,MAAiC,mBAAmB,GAAG;AAChF,WAAO;EACT;AACA,MAAI,QAAQ,yBAAyB,CAAC,2BAA2B,MAAM,QAAQ,wBAAwB,mBAAmB,GAAG;AAC3H,WAAO;EACT;AACA,MAAI,QAAQ,wBAAwB,CAAC,0BAA0B,MAAM,QAAQ,mBAAmB,GAAG;AACjG,WAAO;EACT;AACA,SAAO;AACT;AAEA,SAAS,aACP,OACA,SACA,cACA,qBACA,cACA,qBAAwC;AAExC,QAAM,UAAU,+BAA+B,SAAS,cAAc,YAAY;AAClF,SAAO,MAAM,OAAO,CAAC,aACnB,6BAA6B,UAAU,SAAS,qBAAqB,mBAAmB,CAAC;AAE7F;AAEA,SAAS,iBAAiB,UAAkB,QAAc;AACxD,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,SAAO,MAAM;AACX,UAAM,UAAU,SAAS,QAAQ,QAAQ,KAAK;AAC9C,QAAI,UAAU,GAAG;AACf,aAAO;IACT;AACA,aAAS;AACT,YAAQ,UAAU,OAAO;EAC3B;AACF;AAEA,SAAS,2BAA2B,OAAa;AAC/C,SAAO,qBAAqB,KAAK;AACnC;AAEA,SAAS,mBAAmB,MAAqB;AAC/C,QAAM,aAAa,KAAK,SAAS,CAAA,GAAI,IAAI,CAAC,WAAW;IACnD,OAAO,MAAM;IACb,MAAM,MAAM,KAAK,KAAI;IACrB;AACF,QAAM,YAAY,KAAK,QAAQ,CAAA,GAAI,IAAI,CAAC,WAAW;IACjD,OAAO,MAAM;IACb,MAAM,MAAM,KAAK,KAAI;IACrB;AACF,QAAM,aAAa,KAAK,SAAS,CAAA,GAC9B,OAAO,CAAC,UAAoD,OAAO,MAAM,SAAS,YAAY,MAAM,KAAK,KAAI,EAAG,SAAS,CAAC,EAC1H,IAAI,CAAC,WAAW;IACf,OAAO,MAAM;IACb,MAAM,MAAM,KAAK,KAAI;IACrB;AACJ,QAAM,SAAS,CAAC,GAAG,WAAW,GAAG,UAAU,GAAG,SAAS,EACpD,OAAO,CAAC,UAAU,MAAM,KAAK,SAAS,CAAC,EACvC,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,cAAc,EAAE,KAAK,KAAK,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AAChF,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,SAAS,QAAQ;AAC1B,YAAQ,IAAI,GAAG,MAAM,KAAK,IAAI,MAAM,IAAI,IAAI,KAAK;EACnD;AACA,SAAO,CAAC,GAAG,QAAQ,OAAM,CAAE;AAC7B;AAYA,eAAe,uBAAuB,MAAY;AAChD,QAAM,WAAWC,MAAK,QAAQ,IAAI;AAClC,MAAI;AACF,UAAM,eAAe,MAAMC,IAAG,SAAS,QAAQ;AAC/C,WAAO;MACL;MACA,UAAU;;EAEd,QAAQ;AACN,WAAO;EACT;AACF;AAEA,eAAe,yBAAyB,aAAqB,YAAkB;AAC7E,QAAM,CAAC,wBAAwB,qBAAqB,IAAI,MAAM,QAAQ,IAAI;IACxE,uBAAuB,WAAW;IAClC,uBAAuB,UAAU;GAClC;AACD,SAAO;IACL;IACA;;AAEJ;AAEA,eAAe,iBACb,UACA,OAAwB;AAExB,QAAM,cAAc,mBAAmB,SAAS,QAAQ;AACxD,QAAM,SAAmB,CAAA;AACzB,aAAW,cAAc,aAAa;AACpC,UAAM,kBAAkB,WAAW,UAAU,WAAW,MAAM,wBAAwB,MAAM;AAC5F,QAAI,CAAC,iBAAiB;AACpB;IACF;AACA,UAAM,WAAWD,MAAK,QAAQ,gBAAgB,UAAU,WAAW,IAAI;AACvE,QAAI,CAAC,sBAAsB,gBAAgB,UAAU,QAAQ,GAAG;AAC9D;IACF;AACA,QAAI;AACJ,QAAI;AACF,uBAAiB,MAAMC,IAAG,SAAS,QAAQ;IAC7C,QAAQ;AACN;IACF;AACA,QAAI,CAAC,sBAAsB,gBAAgB,UAAU,cAAc,GAAG;AACpE;IACF;AACA,QAAI;AACF,YAAM,qBAAqB;QACzB,MAAM;QACN,OAAO,WAAW;OACnB;AACD,aAAO,KAAK,MAAMA,IAAG,SAAS,UAAU,MAAM,CAAC;IACjD,QAAQ;IAER;EACF;AACA,SAAO,OAAO,KAAK,IAAI;AACzB;AA8BA,IAAM,4BAID;EACH,EAAE,MAAM,SAAS,WAAW,gBAAgB,OAAO,CAAC,aAAa,SAAS,SAAS,MAAK;EACxF,EAAE,MAAM,eAAe,WAAW,sBAAsB,OAAO,CAAC,aAAa,SAAS,SAAS,YAAW;EAC1G,EAAE,MAAM,QAAQ,WAAW,eAAe,OAAO,CAAC,aAAa,YAAY,SAAS,SAAS,IAAI,EAAE,KAAK,GAAG,EAAC;EAC5G;IACE,MAAM;IACN,WAAW;IACX,OAAO,CAAC,aAAc,OAAO,SAAS,SAAS,WAAW,WAAW,SAAS,SAAS,SAAS;;EAElG,EAAE,MAAM,QAAQ,WAAW,eAAe,OAAO,CAAC,aAAa,SAAS,KAAI;EAC5E;IACE,MAAM;IACN,WAAW;IACX,OAAO,CAAC,aAAa,YAAY,SAAS,SAAS,QAAQ,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI,EAAE,KAAK,GAAG;;EAElG;IACE,MAAM;IACN,WAAW;IACX,OAAO,CAAC,aAAa,YAAY,SAAS,SAAS,KAAK,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI,EAAE,KAAK,GAAG;;EAE/F;IACE,MAAM;IACN,WAAW;IACX,OAAO,CAAC,aAAa,YAAY,SAAS,SAAS,SAAS,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI,EAAE,KAAK,GAAG;;EAEnG,EAAE,MAAM,aAAa,WAAW,oBAAoB,OAAO,CAAC,aAAa,oBAAoB,SAAS,QAAQ,EAAE,KAAK,GAAG,EAAC;EACzH,EAAE,MAAM,UAAU,WAAW,iBAAiB,OAAO,CAAC,aAAa,iBAAiB,SAAS,QAAQ,EAAE,KAAK,GAAG,EAAC;EAChH;IACE,MAAM;IACN,WAAW;IACX,OAAO,CAAC,aAAa,kBAAkB,SAAS,SAAS,YAAY,EAAE,IAAI,CAAC,UAAU,GAAG,MAAM,EAAE,IAAI,MAAM,IAAI,EAAE,EAAE,KAAK,GAAG;;EAE7H,EAAE,MAAM,QAAQ,WAAW,eAAe,OAAO,CAAC,aAAa,oBAAoB,SAAS,QAAQ,EAAC;;AAMvG,IAAM,mCAAmC,IAAI,IAAI,0BAA0B,IAAI,CAAC,YAAY,CAAC,QAAQ,MAAM,OAAO,CAAC,CAAC;AAEpH,SAAS,oBAAoB,OAAa;AACxC,SAAO,MAAM,QAAQ,uBAAuB,MAAM;AACpD;AASA,SAAS,cAAc,MAAc,QAAgB;AAMnD,QAAM,UAAU,OACb,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC,EAClC,KAAK,CAAC,MAAM,UAAU,MAAM,SAAS,KAAK,MAAM,EAChD,IAAI,mBAAmB;AAC1B,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;EACT;AACA,QAAM,UAAU,IAAI,OAAO,QAAQ,KAAK,GAAG,GAAG,IAAI;AAClD,SAAO,KAAK,QAAQ,SAAS,CAAC,UAAU,GAAG,cAAc,GAAG,KAAK,GAAG,eAAe,EAAE;AACvF;AAUA,SAAS,sBAAsB,MAAc,QAAgB;AAC3D,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO;EACT;AACA,QAAM,YAAY,KAAK,YAAW;AAClC,MAAI,kBAAkB;AACtB,aAAW,SAAS,QAAQ;AAC1B,QAAI,MAAM,WAAW,GAAG;AACtB;IACF;AACA,UAAM,QAAQ,UAAU,QAAQ,KAAK;AACrC,QAAI,SAAS,MAAM,kBAAkB,KAAK,QAAQ,kBAAkB;AAClE,wBAAkB;IACpB;EACF;AACA,MAAI,kBAAkB,GAAG;AACvB,WAAO;EACT;AACA,QAAM,cAAc,KAAK,IAAI,GAAG,kBAAkB,wBAAwB;AAC1E,QAAM,YAAY,KAAK,IAAI,KAAK,QAAQ,kBAAkB,wBAAwB;AAClF,QAAM,SAAS,cAAc,KAAK,MAAM,aAAa,SAAS,GAAG,MAAM;AACvE,QAAM,SAAS,cAAc,IAAI,WAAM;AACvC,QAAM,SAAS,YAAY,KAAK,SAAS,WAAM;AAC/C,SAAO,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM;AACpC;AASA,SAAS,mBAAmB,UAAwB,eAAyB,QAAgB;AAC3F,QAAM,aAAmC,CAAA;AACzC,aAAW,SAAS,eAAe;AACjC,UAAM,UAAU,iCAAiC,IAAI,KAAK;AAC1D,QAAI,YAAY,QAAW;AACzB;IACF;AACA,UAAM,UAAU,sBAAsB,QAAQ,MAAM,QAAQ,GAAG,MAAM;AACrE,QAAI,YAAY,MAAM;AACpB,iBAAW,KAAK,EAAE,OAAO,QAAO,CAAE;IACpC;EACF;AACA,SAAO;AACT;AAcA,SAAS,6BAA6B,UAAwB,cAAsB,QAAoB;AACtG,SAAO;IACL,GAAG,0BAA0B,IAAI,CAAC,aAAa;MAC7C,MAAM,QAAQ;MACd,OAAO,QAAQ,MAAM,QAAQ;MAC7B,QAAQ,OAAO,QAAQ,SAAS;MAChC;IACF,EAAE,MAAM,kBAAkB,OAAO,cAAc,QAAQ,OAAO,sBAAqB;;AAEvF;AAEA,SAAS,sBAAsB,MAAuB,iBAAyB,UAAgB;AAC7F,QAAM,eAAe,sBAAsB,KAAK,EAAE;AAClD,QAAM,qBAAqB,OAAO,aAAa,WAAW,SAAS,KAAI,EAAG,YAAW,IAAK;AAC1F,QAAM,2BAA2B,sBAAsB,kBAAkB;AACzE,QAAM,oBACJ,yBAAyB,SAAS,KAAK,aAAa,WAAW,wBAAwB,IACnF,aAAa,MAAM,yBAAyB,MAAM,EAAE,KAAI,IACxD;AACN,MAAI,oBAAoB,gBAAgB,oBAAoB,mBAAmB;AAC7E,WAAO;EACT;AACA,SAAO;IACL;IACA,OAAO,oBAAoB,eAAe,uBAAuB;IACjE,gBAAgB,CAAC,IAAI;IACrB,mBAAmB;IACnB,gBAAgB;;AAEpB;AAEA,SAAS,kBACP,QACA,kBACA,kBACA,QACA,OAAuB;AAEvB,aAAW,SAAS,QAAQ;AAC1B,UAAM,oBAAoB,iBAAiB,IAAI,KAAK,KAAK;AACzD,QAAI,oBAAoB,GAAG;AACzB,YAAM,SAAS,oBAAoB,OAAO;AAC1C,YAAM,QAAQ,IAAI,OAAO;AACzB,YAAM,cAAc,IAAI,KAAK;IAC/B;AACA,eAAW,SAAS,kBAAkB;AACpC,YAAM,cAAc,iBAAiB,MAAM,MAAM,YAAW,GAAI,KAAK;AACrE,UAAI,cAAc,GAAG;AACnB,cAAM,SAAS,cAAc,MAAM;AACnC,cAAM,QAAQ,IAAI,MAAM,IAAI;AAC5B,cAAM,cAAc,IAAI,KAAK;MAC/B;IACF;EACF;AACF;AAEA,SAAS,mBACP,MACA,iBACA,kBACA,OAAuB;AAEvB,QAAM,kBAAkB,sBAAsB,KAAK,KAAK;AACxD,MAAI,oBAAoB,iBAAiB;AACvC,UAAM,SAAS;AACf,UAAM,QAAQ,IAAI,OAAO;EAC3B;AACA,aAAW,SAAS,kBAAkB;AACpC,UAAM,oBAAoB,iBAAiB,sBAAsB,MAAM,KAAK,GAAG,eAAe;AAC9F,QAAI,oBAAoB,GAAG;AACzB,YAAM,SAAS,oBAAoB,MAAM,SAAS;AAClD,YAAM,QAAQ,IAAI,MAAM,IAAI;IAC9B;EACF;AACF;AAEA,SAAS,cACP,UACA,QACA,iBACA,cACA,QACA,UACA,qBAAqB,OAAK;AAE1B,QAAM,OAAO,SAAS;AACtB,QAAM,aAAa,sBAAsB,MAAM,iBAAiB,QAAQ;AACxE,MAAI,YAAY;AACd,WAAO;EACT;AACA,QAAM,mBAAmB,oBAAI,IAAG;AAChC,aAAW,SAAS,2BAA2B,KAAK,KAAK,GAAG;AAC1D,qBAAiB,IAAI,QAAQ,iBAAiB,IAAI,KAAK,KAAK,KAAK,CAAC;EACpE;AACA,QAAM,mBAAmB,6BAA6B,UAAU,cAAc,MAAM;AACpF,QAAM,QAA0B,EAAE,OAAO,GAAG,SAAS,oBAAI,IAAG,GAAI,eAAe,oBAAI,IAAG,EAAE;AACxF,oBAAkB,QAAQ,kBAAkB,kBAAkB,QAAQ,KAAK;AAC3E,QAAM,iBAAiB,IAAI,IAAI,MAAM;AAGrC,QAAM,kBAAkB,eAAe,OAAO,KAAK,MAAM,cAAc,SAAS,eAAe;AAG/F,MAAI,sBAAsB,eAAe,OAAO,KAAK,iBAAiB;AACpE,UAAM,SAAS;EACjB;AAEA,QAAM,oBAAoB,OAAO,UAAU,8BAA8B,gBAAgB,SAAS,GAAG;AACrG,MAAI,mBAAmB;AACrB,uBAAmB,MAAM,iBAAiB,kBAAkB,KAAK;EACnE;AAEA,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO;EACT;AAEA,SAAO;IACL;IACA,OAAO,MAAM;IACb,gBAAgB,CAAC,GAAG,MAAM,OAAO,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC;IACpE,mBAAmB;;AAEvB;AAEA,SAAS,SAAS,OAAoB,gBAAqC;AACzE,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAK;AAC9B,UAAM,UAAU,EAAE,QAAQ,EAAE;AAC5B,QAAI,YAAY;AAAG,aAAO;AAC1B,UAAM,YAAY,iBAAiB,EAAE,KAAK,QAAQ,cAAc;AAChE,UAAM,YAAY,iBAAiB,EAAE,KAAK,QAAQ,cAAc;AAChE,QAAI,cAAc,WAAW;AAC3B,aAAO,YAAY,IAAI;IACzB;AACA,UAAM,aAAa,EAAE,KAAK,WAAW,EAAE,KAAK;AAC5C,QAAI,eAAe;AAAG,aAAO;AAC7B,UAAM,YAAY,wBAAwB,EAAE,KAAK,YAAY,EAAE,KAAK,UAAU;AAC9E,QAAI,cAAc;AAAG,aAAO;AAC5B,WAAO,EAAE,KAAK,GAAG,cAAc,EAAE,KAAK,EAAE;EAC1C,CAAC;AACH;AAEA,SAAS,wBACP,UACA,QACA,iBACA,eACA,kBACA,QACA,UACA,qBAAqB,OAAK;AAG1B,SAAO,cACL,UACA,QACA,iBACA,gBAAgB,iBAAiB,IAAI,SAAS,SAAS,EAAE,KAAK,KAAK,IACnE,QACA,UACA,kBAAkB;AAGtB;AAEA,SAAS,kBAAkB,WAA8B;AACvD,MAAI,UAAU,SAAS,GAAG;AACxB,WAAO,oBAAI,IAAG;EAChB;AACA,QAAM,SAAS,CAAC,GAAG,UAAU,OAAM,CAAE;AACrC,QAAM,WAAW,KAAK,IAAI,GAAG,MAAM;AACnC,QAAM,WAAW,KAAK,IAAI,GAAG,MAAM;AACnC,MAAI,aAAa,UAAU;AACzB,WAAO,IAAI,IAAI,CAAC,GAAG,UAAU,KAAI,CAAE,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;EAC3D;AACA,QAAM,aAAa,oBAAI,IAAG;AAC1B,aAAW,CAAC,IAAI,KAAK,KAAK,WAAW;AACnC,eAAW,IAAI,KAAK,QAAQ,aAAa,WAAW,SAAS;EAC/D;AACA,SAAO;AACT;AAKM,SAAU,wBAAwB,UAAiB;AACvD,QAAM,YAAa,SAAoD,QAAQ;AAC/E,MAAI,OAAO,cAAc,YAAY,OAAO,SAAS,SAAS,KAAK,YAAY,GAAG;AAChF,WAAO,KAAK,MAAM,SAAS;EAC7B;AACA,SAAO;AACT;AAKM,SAAU,4BAA4B,UAAiB;AAC3D,QAAM,YAAa,SAAwD,QAAQ;AACnF,MAAI,OAAO,cAAc,YAAY,OAAO,SAAS,SAAS,GAAG;AAC/D,WAAO;EACT;AACA,SAAO;AACT;AAKM,SAAU,4BAA4B,UAAiB;AAC3D,QAAM,YAAa,SAA+D,QAAQ;AAC1F,MAAI,OAAO,cAAc,YAAY,OAAO,SAAS,SAAS,KAAK,aAAa,KAAK,aAAa,GAAG;AACnG,WAAO;EACT;AACA,SAAO;AACT;AAKM,SAAU,oBAAoB,UAAiB;AACnD,QAAM,WAAyB;IAC7B,mBAAmB;IACnB,cAAc;IACd,oBAAoB;IACpB,aAAa;IACb,eAAe;IACf,aAAa;IACb,iBAAiB;IACjB,cAAc;IACd,kBAAkB;IAClB,kBAAkB;IAClB,eAAe;IACf,qBAAqB;IACrB,uBAAuB;;AAEzB,QAAM,SAAU,SAA6D,QAAQ;AACrF,MAAI,CAAC;AAAQ,WAAO;AAEpB,QAAM,gBAAgB,CAAC,WAAoB,aAAoB;AAC7D,QAAI,OAAO,cAAc,YAAY,OAAO,SAAS,SAAS,KAAK,aAAa,GAAG;AACjF,aAAO;IACT;AACA,WAAO;EACT;AAEA,SAAO;IACL,mBAAmB,cAAc,OAAO,mBAAmB,SAAS,iBAAiB;IACrF,cAAc,cAAc,OAAO,cAAc,SAAS,YAAY;IACtE,oBAAoB,cAAc,OAAO,oBAAoB,SAAS,kBAAkB;IACxF,aAAa,cAAc,OAAO,aAAa,SAAS,WAAW;IACnE,eAAe,cAAc,OAAO,eAAe,SAAS,aAAa;IACzE,aAAa,cAAc,OAAO,aAAa,SAAS,WAAW;IACnE,iBAAiB,cAAc,OAAO,iBAAiB,SAAS,eAAe;IAC/E,cAAc,cAAc,OAAO,cAAc,SAAS,YAAY;IACtE,kBAAkB,cAAc,OAAO,kBAAkB,SAAS,gBAAgB;IAClF,kBAAkB,cAAc,OAAO,kBAAkB,SAAS,gBAAgB;IAClF,eAAe,cAAc,OAAO,eAAe,SAAS,aAAa;IACzE,qBAAqB,cAAc,OAAO,qBAAqB,SAAS,mBAAmB;IAC3F,uBAAuB,cAAc,OAAO,uBAAuB,SAAS,qBAAqB;;AAErG;AAGA,SAAS,kBACP,OACA,MACA,WACA,SACA,eACA,gBACA,sBACA,gBACA,QACA,YACA,UACA,qBACA,YAAY,OAAK;AAIjB,QAAM,cAAc,YAAY,EAAE,OAAO,GAAG,YAAY,KAAI,IAAK,CAAA;AACjE,QAAM,qBAAqB,WAAW,SAAS,aAAa,QAAQ,YAAY;AAChF,MAAI,oBAAoB;AACtB,UAAM,iBAAiB,gCAAgC;MACrD;MACA;MACA;MACA;MACA,YAAY,QAAQ,eAAe;MACnC,aAAa,QAAQ,gBAAgB;MACrC;MACA;MACA;KACD;AACD,WAAO;MACL,OAAO,MAAM,KAAI;MACjB;MACA,OAAO,CAAA;MACP,OAAO;MACP,GAAG;MACH,SAAS;MACT,GAAI,SAAS,SAAS,IAAI,EAAE,SAAQ,IAAK,CAAA;;EAE7C;AACA,QAAM,mBAAmB,WAAW,SAAS,SAAS,OAAO,CAAC,GAAG,WAAW,MAAM;AAClF,SAAO;IACL,OAAO,MAAM,KAAI;IACjB;IACA,OAAO,CAAA;IACP,OAAO;IACP,GAAG;IACH,SAAS,0BAA0B;MACjC,eAAe;MACf;MACA;MACA;MACA,YAAY,QAAQ,eAAe;MACnC,aAAa,QAAQ,gBAAgB;MACrC;MACA;MACA;MACA;MACA,qBAAqB,uBAAuB,CAAA;KAC7C;IACD,YAAY;MACV,MAAM,WAAW;MACjB,QAAQ;;IAEV,KAAK,OAAM;IACX,GAAI,SAAS,SAAS,IAAI,EAAE,SAAQ,IAAK,CAAA;;AAE7C;AAGA,SAAS,4BACP,eACA,oBACA,kBACA,yBAAgC;AAEhC,MAAI,CAAC,mBAAmB,QAAQ;AAC9B,UAAM,IAAI,WACR,gBAAgB,aAAa,wGAC7B,UAAU,KAAK;EAEnB;AACA,MAAI,CAAC,iBAAiB,UAAU,CAAC,yBAAyB;AACxD,UAAM,IAAI,WACR,gBAAgB,aAAa,wKAC7B,UAAU,KAAK;EAEnB;AACA,SAAO;IACL,UAAU,mBAAmB;IAC7B,aAAa,iBAAiB,UAAU;;AAE5C;AAEA,IAAM,2BAA2B;AAUjC,SAAS,qCAAqC,cAAgC;AAC5E,QAAM,gBAAgB,gCAA+B;AACrD,QAAM,WAAW,gCAAgC,eAAe,YAAY;AAC5E,MAAI,CAAC,UAAU;AACb,WAAO;EACT;AACA,QAAM,oBAAoB,SAAS,sBAAsB,SAAS;AAClE,QAAM,QAAS,kBAA0C;AACzD,QAAM,iBACH,kBAA8E,kBAC9E,kBAA8E;AACjF,QAAM,SAAU,kBAA2C;AAC3D,QAAM,iBACJ,yBAA0B,kBAAyC,IAAI,KACvE,yBAA0B,SAAS,WAAkC,IAAI,KACzE;AAEF,MAAI,CAAC,gBAAgB;AACnB,WAAO;EACT;AACA,QAAM,QAAsC;IAC1C,cAAc;IACd,GAAI,OAAO,UAAU,aAAa,EAAE,MAA4C,IAAK,CAAA;IACrF,GAAI,OAAO,mBAAmB,aAC1B,EAAE,eAAuE,IACzE,CAAA;IACJ,GAAI,OAAO,WAAW,aAAa,EAAE,OAA+C,IAAK,CAAA;;AAE3F,MAAI,CAAC,MAAM,SAAS,CAAC,MAAM,kBAAkB,CAAC,MAAM,QAAQ;AAC1D,WAAO;EACT;AACA,SAAO;AACT;AAGA,SAAS,+BAA+B,UAAoB;AAC1D,QAAM,eAAe,yBAA0B,SAAS,QAA+C,QAAQ;AAC/G,QAAM,WAAW,qCAAqC,YAAY;AAClE,MAAI,CAAC,UAAU,OAAO;AACpB,WAAO;EACT;AACA,SAAO;IACL,cAAc,SAAS;IACvB,OAAO,SAAS;;AAEpB;AAGA,SAAS,8BAA8B,UAAoB;AACzD,QAAM,gBAAgB,gCAA+B;AACrD,QAAM,cAAc,yBAA0B,SAAS,cAAoD,OAAO;AAClH,QAAM,WAAW,oCAAoC,eAAe,WAAW;AAC/E,MAAI,CAAC,UAAU;AACb,WAAO;EACT;AACA,QAAM,oBAAoB,SAAS,sBAAsB,SAAS;AAClE,QAAM,QAAS,kBAA0C;AACzD,MAAI,OAAO,UAAU,YAAY;AAC/B,WAAO;EACT;AACA,QAAM,SAAU,kBAA2C;AAC3D,QAAM,qBACJ,yBAA0B,kBAAyC,IAAI,KACvE,yBAA0B,SAAS,WAAkC,IAAI,KACzE,eACA;AACF,SAAO;IACL,aAAa;IACb;IACA,GAAI,OAAO,WAAW,aAAa,EAAE,OAAuC,IAAK,CAAA;;AAErF;AAGA,SAAS,+BACP,cACA,KACA,cAAuC;AAEvC,QAAM,UAAU,MAAM,QAAQ,GAAG,IAC7B,MACC,KAA+C;AACpD,MAAI,CAAC,MAAM,QAAQ,OAAO,GAAG;AAC3B,UAAM,IAAI,WACR,8BAA8B,YAAY,qDAC1C,UAAU,eAAe;EAE7B;AAEA,QAAM,OAAO,oBAAI,IAAG;AACpB,QAAM,OAAoB,CAAA;AAC1B,aAAW,UAAU,SAAS;AAC5B,QAAI,OAAO,WAAW,YAAY,WAAW,MAAM;AACjD;IACF;AACA,UAAM,KAAK,yBAA0B,OAA4B,EAAE;AACnE,UAAM,QAAS,OAA+B;AAC9C,QAAI,CAAC,MAAM,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,KAAK,KAAK,IAAI,EAAE,GAAG;AAC/E;IACF;AACA,UAAM,WAAW,aAAa,IAAI,EAAE;AACpC,QAAI,CAAC,UAAU;AACb;IACF;AACA,UAAM,mBAAoB,OAAwC;AAClE,UAAM,gBACJ,MAAM,QAAQ,gBAAgB,KAAK,iBAAiB,MAAM,CAAC,UAAU,OAAO,UAAU,QAAQ,IAC1F,CAAC,GAAG,IAAI,IAAK,iBAA8B,IAAI,CAAC,UAAU,MAAM,KAAI,CAAE,EAAE,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,MACrH,EAAE,cAAc,CAAC,CAAC,IAEpB,CAAC,YAAY,YAAY,EAAE;AACjC,SAAK,IAAI,EAAE;AACX,SAAK,KAAK;MACR,MAAM,SAAS;MACf;MACA,gBAAgB;KACjB;EACH;AACA,SAAO;AACT;AAEA,SAAS,kBACP,YACA,cAAuC;AAEvC,QAAM,eAA4B,CAAA;AAClC,QAAM,iBAAiB,oBAAI,IAAG;AAC9B,aAAW,aAAa,YAAY;AAClC,QAAI,eAAe,IAAI,UAAU,EAAE,GAAG;AACpC;IACF;AACA,UAAM,WAAW,aAAa,IAAI,UAAU,EAAE;AAC9C,QAAI,CAAC,UAAU;AACb;IACF;AACA,mBAAe,IAAI,UAAU,IAAI,UAAU,KAAK;AAChD,iBAAa,KAAK;MAChB,MAAM,SAAS;MACf,OAAO,UAAU;MACjB,gBAAgB,CAAC,UAAU;KAC5B;EACH;AACA,SAAO;IACL;IACA;;AAEJ;AAYA,SAAS,sBAAsB,YAAyB,aAAwB;AAC9E,QAAM,cAAc,YAAY,OAAO,CAAC,QAAQ,IAAI,mBAAmB,IAAI;AAC3E,MAAI,YAAY,WAAW,GAAG;AAC5B,WAAO;EACT;AACA,QAAM,aAAa,IAAI,IAAI,YAAY,IAAI,CAAC,QAAQ,IAAI,KAAK,EAAE,CAAC;AAChE,QAAM,YAAY,WAAW,OAAO,CAAC,QAAQ,CAAC,WAAW,IAAI,IAAI,KAAK,EAAE,CAAC;AAGzE,QAAM,oBAAoB,UAAU,OAAO,CAAC,KAAK,QAAQ,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,CAAC;AAQpF,QAAM,mBAAmB,YAAY,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,KAAK;AACnF,QAAM,WAAW,oBAAoB,iBAAiB,SAAS;AAC/D,QAAM,WAAW,iBAAiB,IAAI,CAAC,KAAK,WAAW;;;;IAIrD,GAAG;;IAEH,OAAO,WAAW;IAClB,gBAAgB,CAAC,IAAI;IACrB;AACF,SAAO,CAAC,GAAG,UAAU,GAAG,SAAS;AACnC;AAEA,SAAS,kBACP,cACA,gBACA,aACA,sBAIA,qBAAqB,YAAU;AAE/B,QAAM,gBAAgB,IAAI,IAAI,YAAY,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,IAAI,MAAM,KAAK,CAAC,CAAC;AACtF,QAAM,iBAAiB,IAAI,IAAI,YAAY,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,IAAI,MAAM,cAAc,CAAC,CAAC;AAChG,QAAM,qBAAqB,kBAAkB,cAAc;AAC3D,QAAM,oBAAoB,kBAAkB,aAAa;AACzD,QAAM,eAAe,oBAAI,IAAY,CAAC,GAAG,eAAe,KAAI,GAAI,GAAG,cAAc,KAAI,CAAE,CAAC;AACxF,QAAM,gBAAgB,IAAI;AAC1B,SAAO,CAAC,GAAG,YAAY,EACpB,IAAI,CAAC,OAAM;AACV,UAAM,WAAW,aAAa,IAAI,EAAE;AACpC,UAAM,gBAAgB,mBAAmB,IAAI,EAAE,KAAK;AACpD,UAAM,eAAe,kBAAkB,IAAI,EAAE,KAAK;AAClD,UAAM,gBAAiB,gBAAgB,uBAAyB,eAAe;AAC/E,QAAI,iBAAiB,GAAG;AACtB,aAAO;IACT;AACA,UAAM,gBAAgB,oBAAI,IAAG;AAC7B,QAAI,eAAe,IAAI,EAAE,GAAG;AAC1B,oBAAc,IAAI,kBAAkB;IACtC;AACA,eAAW,SAAS,eAAe,IAAI,EAAE,KAAK,CAAA,GAAI;AAChD,oBAAc,IAAI,KAAK;IACzB;AACA,WAAO;MACL,MAAM,SAAS;MACf,OAAO;MACP,gBAAgB,CAAC,GAAG,aAAa,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC;;EAExE,CAAC,EACA,OAAO,CAAC,UAA8B,UAAU,IAAI;AACzD;AAaA,SAAS,uBAAuB,QAI/B;AACC,QAAM,aAAa,OAAO,oBAAoB,KAAI,EAAG,YAAW;AAChE,MAAI,eAAe,QAAQ;AACzB,WAAO;EACT;AACA,MAAI,eAAe,UAAU,CAAC,OAAO,wBAAwB,CAAC,OAAO,4BAA4B;AAC/F,WAAO;EACT;AACA,SAAO;AACT;AAaA,SAAS,uBAAuB,QAQ/B;AACC,QAAM,gBAAgB,OAAO,kBAAkB,IAAI,CAAC,cAAc;IAChE,IAAI,SAAS,SAAS;IACtB,MAAM,wBAAwB,kBAAkB,UAAU,EAAE,QAAQ,OAAO,aAAY,CAAE,CAAC;IAC1F;AACF,QAAM,QAAQ,eAAe,aAAa;AAC1C,QAAM,aAAa,eAAe,OAAO,aAAa,OAAO,KAAK,GAAG,OAAO,UAAU;AACtF,QAAM,eAAe,IAAI,IAAI,OAAO,kBAAkB,IAAI,CAAC,aAAa,CAAC,SAAS,SAAS,IAAI,QAAQ,CAAC,CAAC;AACzG,MAAI,OAAO,kBAAkB,YAAY;AACvC,UAAM,eAA4B,CAAC,GAAG,UAAU,EAAE,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;MACtE,MAAM,aAAa,IAAI,EAAE,EAAG;MAC5B;MACA,gBAAgB,CAAC,MAAM;MACvB;AACF,WAAO,sBAAsB,cAAc,OAAO,WAAW;EAC/D;AACA,QAAM,aAAa,kBACjB,cACA,YACA,OAAO,aACP,OAAO,sBACP,MAAM;AAER,SAAO,sBAAsB,YAAY,OAAO,WAAW;AAC7D;AA+BA,SAAS,oBAAoB,iBAAmC;AAC9D,QAAM,WAAW,oBAAI,IAAG;AACxB,aAAW,SAAS,iBAAiB;AACnC,eAAW,OAAO,OAAO;AACvB,YAAM,WAAW,SAAS,IAAI,IAAI,EAAE;AACpC,UAAI,CAAC,YAAY,IAAI,QAAQ,SAAS,OAAO;AAC3C,iBAAS,IAAI,IAAI,IAAI,GAAG;MAC1B;IACF;EACF;AACA,QAAM,SAAS,CAAC,GAAG,SAAS,OAAM,CAAE;AACpC,SAAO,KAAK,CAAC,MAAM,UAAS;AAC1B,QAAI,KAAK,UAAU,MAAM,OAAO;AAC9B,aAAO,MAAM,QAAQ,KAAK;IAC5B;AACA,WAAO,KAAK,GAAG,cAAc,MAAM,EAAE;EACvC,CAAC;AACD,SAAO;AACT;AAGA,SAAS,kBAAkB,UAAsB;AAC/C,QAAM,WAAY,SAA4D;AAC9E,QAAM,OAAO,MAAM,QAAQ,UAAU,IAAI,IAAI,SAAS,KAAK,KAAK,GAAG,IAAI;AACvE,SAAO;IACL,UAAU;IACV,UAAU;IACV,UAAU;IACV,UAAU;IACV;IACA,SAAS;IAER,IAAI,CAAC,UAAW,OAAO,UAAU,WAAW,MAAM,KAAI,IAAK,EAAG,EAC9D,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC,EAClC,KAAK,IAAI;AACd;AAIA,eAAe,+BAA+B,SAA+B,cAAoB;AAC/F,QAAM,sBAAsB,QAAQ,eAAe,UAC/C,kCAAkC,cAAc,QAAQ,eAAe,WAAW,IAClF,CAAC,YAAY;AACjB,QAAM,kBAAkB,oBAAoB,SAAS,IAAI,sBAAsB,CAAC,YAAY;AAC5F,MAAI,CAAC,QAAQ,eAAe,SAAS;AACnC,WAAO;EACT;AACA,MAAI,QAAQ,yBAAyB,QAAQ;AAC3C,QAAI;AACF,YAAM,eAAe,MAAM,QAAQ,QACjC,QAAQ,wBAAwB,OAAO;QACrC,OAAO;QACP,MAAM,QAAQ;QACd,UAAU,QAAQ;OACnB,CAAC;AAEJ,aAAO,qBACL,iBACA,8BAA8B,YAAY,GAC1C,QAAQ,eAAe,WAAW;IAEtC,QAAQ;AACN,cAAQ,SAAS,KACf,0CAA0C,QAAQ,wBAAwB,YAAY,gBAAgB;AAExG,aAAO;IACT;EACF;AACA,MACE,QAAQ,eAAe,YACvB,QAAQ,eAAe,aAAa,YACpC,QAAQ,eAAe,aAAa,UACpC;AACA,YAAQ,SAAS,KAAK,+CAA+C,QAAQ,eAAe,QAAQ,gBAAgB;EACtH;AACA,SAAO;AACT;AAEA,eAAe,2BACb,SACA,gBACA,eACA,oBAA2C;AAE3C,MAAI,QAAQ,wBAAwB,OAAO;AACzC,QAAI;AACF,aAAO,MAAM,QAAQ,QACnB,QAAQ,uBAAuB,MAAM;QACnC,QAAQ;QACR,OAAO;QACP,UAAU,QAAQ;OACnB,CAAC;IAEN,SAAS,OAAgB;AACvB,UAAI,CAAC,QAAQ,aAAa;AACxB,cAAM,IAAI,WACR,uFAAuF,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,KAC7I,UAAU,eAAe;MAE7B;AACA,cAAQ,SAAS,KAAK,gCAAgC,QAAQ,uBAAuB,WAAW,gBAAgB;AAChH,aAAO,MAAM,mBAAmB,QAAQ,aAAa,gBAAgB,eAAe,kBAAkB;IACxG;EACF;AACA,MAAI,QAAQ,aAAa;AACvB,WAAO,MAAM,mBAAmB,QAAQ,aAAa,gBAAgB,eAAe,kBAAkB;EACxG;AACA,QAAM,IAAI,WACR,0GACA,UAAU,KAAK;AAEnB;AAEA,SAAS,6BACP,YACA,cACA,MAAY;AAEZ,QAAM,sBAAsB,CAAC,GAAG,UAAU,EAAE,KAAK,CAAC,MAAM,UAAS;AAC/D,QAAI,KAAK,UAAU,MAAM,OAAO;AAC9B,aAAO,MAAM,QAAQ,KAAK;IAC5B;AACA,WAAO,KAAK,KAAK,GAAG,cAAc,MAAM,KAAK,EAAE;EACjD,CAAC;AACD,SAAO,oBACJ,MAAM,GAAG,IAAI,EACb,IAAI,CAAC,QAAO;AACX,UAAM,WAAW,aAAa,IAAI,IAAI,KAAK,EAAE;AAC7C,WAAO,WAAW,EAAE,KAAK,MAAM,kBAAkB,QAAQ,EAAC,IAAK;EACjE,CAAC,EACA,OAAO,CAAC,UAAqD,UAAU,IAAI;AAChF;AAEA,eAAe,6BACb,SACA,cACA,mBAA0D;AAE1D,MAAI,CAAC,QAAQ,iBAAiB,QAAQ;AACpC,WAAO;EACT;AACA,MAAI;AACF,UAAM,YAAY,MAAM,QAAQ,QAC9B,QAAQ,gBAAgB,OAAO;MAC7B,OAAO;MACP,MAAM;MACN,OAAO,QAAQ,OAAO;MACtB,OAAO,QAAQ,OAAO;MACtB,UAAU,QAAQ;MAClB,YAAY,kBAAkB,IAAI,CAAC,WAAW;QAC5C,IAAI,MAAM,IAAI,KAAK;QACnB,MAAM,MAAM;QACZ,OAAO,MAAM,IAAI;QACjB;KACH,CAAC;AAEJ,UAAM,mBAAmB,sBAAsB,SAAS;AACxD,QAAI,iBAAiB,SAAS,GAAG;AAC/B,aAAO,IAAI,IAAI,iBAAiB,IAAI,CAAC,UAAU,CAAC,MAAM,IAAI,MAAM,KAAK,CAAC,CAAC;IACzE;AACA,YAAQ,SAAS,KACf,2CAA2C,QAAQ,gBAAgB,YAAY,gBAAgB;AAEjG,WAAO;EACT,QAAQ;AACN,YAAQ,SAAS,KAAK,iCAAiC,QAAQ,gBAAgB,YAAY,gBAAgB;AAC3G,WAAO;EACT;AACF;AAEA,eAAe,oBACb,SACA,cACA,mBAA0D;AAE1D,QAAM,kBAAkB,MAAM,6BAA6B,SAAS,cAAc,iBAAiB;AACnG,MAAI,iBAAiB;AACnB,WAAO;EACT;AACA,QAAM,mBAAsC,kBAAkB,IAAI,CAAC,WAAW;IAC5E,IAAI,MAAM,IAAI,KAAK;IACnB,MAAM,MAAM;IACZ;AACF,MAAI;AACF,WAAO,MAAM,+BACX,QAAQ,UACR,QAAQ,OAAO,OACf,cACA,kBACA,QAAQ,kBAAkB;EAE9B,QAAQ;AACN,YAAQ,SAAS,KAAK,0CAA0C;AAChE,WAAO;EACT;AACF;AAEA,SAAS,kBAAkB,YAAyB,cAAiC;AACnF,QAAM,cAAc,IAAI,IAAI,aAAa,KAAI,CAAE;AAC/C,QAAM,eAAe,WAAW,IAAI,CAAC,QAAO;AAC1C,UAAM,cAAc,aAAa,IAAI,IAAI,KAAK,EAAE;AAChD,QAAI,gBAAgB,QAAW;AAC7B,aAAO;IACT;AACA,UAAM,gBAAgB,IAAI,IAAI,IAAI,cAAc;AAChD,kBAAc,IAAI,QAAQ;AAC1B,WAAO;MACL,GAAG;MACH,OAAO;MACP,gBAAgB,CAAC,GAAG,aAAa,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;;EAEtF,CAAC;AACD,eAAa,KAAK,CAAC,MAAM,UAAS;AAChC,UAAM,kBAAkB,YAAY,IAAI,KAAK,KAAK,EAAE;AACpD,UAAM,mBAAmB,YAAY,IAAI,MAAM,KAAK,EAAE;AACtD,QAAI,oBAAoB,kBAAkB;AACxC,aAAO,kBAAkB,KAAK;IAChC;AACA,QAAI,KAAK,UAAU,MAAM,OAAO;AAC9B,aAAO,MAAM,QAAQ,KAAK;IAC5B;AACA,WAAO,KAAK,KAAK,GAAG,cAAc,MAAM,KAAK,EAAE;EACjD,CAAC;AACD,SAAO;AACT;AAEA,eAAe,kBACb,SACA,cACA,YACA,cAAuC;AAEvC,MAAI,CAAC,QAAQ,OAAO,WAAW,WAAW,UAAU,GAAG;AACrD,WAAO;EACT;AACA,QAAM,oBAAoB,6BAA6B,YAAY,cAAc,QAAQ,OAAO,KAAK;AACrG,QAAM,eAAe,MAAM,oBAAoB,SAAS,cAAc,iBAAiB;AACvF,SAAO,gBAAgB,aAAa,OAAO,IAAI,kBAAkB,YAAY,YAAY,IAAI;AAC/F;AAEA,eAAe,4BAA4B,SAA6B;AACtE,QAAM,gBAAgB,KAAK,IAAI,QAAQ,SAAS,QAAQ,YAAY,QAAQ,UAAU;AACtF,QAAM,mBAAmB,QAAQ,uBAAuB,SAAY,EAAE,YAAY,QAAQ,mBAAkB,IAAK,CAAA;AACjH,QAAM,qBAAqB,QAAQ,yBAAyB,SAAY,EAAE,YAAY,QAAQ,qBAAoB,IAAK,CAAA;AACvH,QAAM,eAAe,QAAQ,MAAM,KAAI;AACvC,QAAM,kBAAkB,MAAM,+BAA+B,SAAS,YAAY;AAClF,QAAM,eAAe,MAAM,wBAAwB,QAAQ,UAAU,iBAAiB,gBAAgB;AACtG,QAAM,oBAAoB,MAAM,QAAQ,IACtC,aAAa,IAAI,OAAO,mBACtB,MAAM,2BAA2B,SAAS,gBAAgB,eAAe,kBAAkB,CAAC,CAAC;AAEjG,QAAM,aAAa,oBAAoB,iBAAiB;AACxD,QAAM,eAAe,IAAI,IAAI,QAAQ,kBAAkB,IAAI,CAAC,aAAa,CAAC,SAAS,SAAS,IAAI,QAAQ,CAAC,CAAC;AAC1G,QAAM,EAAE,cAAc,eAAc,IAAK,kBAAkB,YAAY,YAAY;AACnF,QAAM,mBAAmB,eAAe;AACxC,MAAI,QAAQ,kBAAkB,YAAY;AAGxC,WAAO,EAAE,MAAM,sBAAsB,cAAc,QAAQ,WAAW,GAAG,iBAAgB;EAC3F;AACA,QAAM,aAAa,MAAM,kBACvB,SACA,cACA,kBAAkB,cAAc,gBAAgB,QAAQ,aAAa,QAAQ,oBAAoB,GACjG,YAAY;AAEd,SAAO;;;;IAIL,MAAM,sBAAsB,YAAY,QAAQ,WAAW;IAC3D;;AAEJ;AAIA,eAAe,cACb,QACA,YACA,cACA,QAA4B;AAE5B,QAAM,sBAAsB,gCAAgC,gCAA+B,CAAE;AAC7F,QAAM,mBAAmB,OACvB,UACA,eACA,oBACmB;AACnB,UAAM,UAAU,OAAO,YAAoB,WAAuC;AAChF,YAAM,qBAAqB,EAAE,MAAM,YAAY,OAAO,UAAS,CAAE;AACjE,YAAM,MAAM,MAAMA,IAAG,SAAS,YAAY,MAAM;AAChD,YAAM,SAAS,kBAAkB,KAAK;QACpC;QACA;QACA;QACA,WAAW,CAAC,YAAY,aAAa,KAAK,OAAO;OAClD;AACD,aAAO,OAAO;IAChB;AAEA,QAAI;AACF,aAAO,MAAM,QAAQ,eAAe,eAAe;IACrD,QAAQ;AACN,YAAM,kBAA8B,oBAAoB,SAAS,kBAAkB;AACnF,YAAM,gBAAgB,YAAY,QAAQ,SAAS,MAAkB,SAAS,IAAI,iBAAiB,YAAY;AAC/G,UAAI;AACF,eAAO,MAAM,QAAQ,eAAe,eAAe;MACrD,QAAQ;AACN,qBAAa,KAAK,8BAA8BD,MAAK,SAAS,QAAQ,aAAa,CAAC,EAAE;AACtF,eAAO;MACT;IACF;EACF;AAEA,QAAM,eAAyB,CAAA;AAC/B,QAAM,kBAAkB,MAAM,gCAAgC,QAAQ,YAAY,cAAc,cAAc,MAAM;AACpH,QAAM,YAA4B,CAAA;AAClC,MAAI,gBAAgB,WAAW,GAAG;AAChC,UAAM,uBAAuB,MAAM,mBAAmB,QAAQ,YAAY,cAAc,cAAc,MAAM;AAC5G,eAAW,YAAY,sBAAsB;AAC3C,YAAM,gBAAgB,YAAY,QAAQ,SAAS,MAAkB,SAAS,IAAI,YAAY,YAAY;AAC1G,YAAM,OAAO,MAAM,iBAAiB,UAAU,eAAe,UAAU;AACvE,gBAAU,KAAK,EAAE,UAAU,KAAI,CAAE;IACnC;AACA,WAAO;MACL;MACA,UAAU,CAAC,GAAG,IAAI,IAAI,YAAY,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;;EAExF;AAEA,aAAW,kBAAkB,iBAAiB;AAC5C,QAAI,OAAO,eAAe,SAAS,UAAU;AAC3C,gBAAU,KAAK;QACb,UAAU,eAAe;QACzB,MAAM,eAAe;OACtB;AACD;IACF;AACA,UAAM,OAAO,MAAM,iBAAiB,eAAe,UAAU,eAAe,WAAW,eAAe,WAAW;AACjH,cAAU,KAAK;MACb,UAAU,eAAe;MACzB;KACD;EACH;AACA,SAAO;IACL;IACA,UAAU,CAAC,GAAG,IAAI,IAAI,YAAY,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;;AAExF;AAIA,SAAS,qBAAqB,KAAgB,OAAa;AACzD,QAAM,aAAa,MAAM,KAAI;AAC7B,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;EACT;AACA,MAAI,eAAe,SAAS;AAC1B,WAAO,IAAI;EACb;AACA,MAAI,eAAe,kBAAkB;AACnC,WAAO,IAAI;EACb;AACA,MAAI,WAAW,WAAW,OAAO,GAAG;AAClC,UAAM,UAAU,WAAW,MAAM,QAAQ,MAAM;AAC/C,QAAI,QAAQ,WAAW,GAAG;AACxB,aAAO;IACT;AACA,UAAME,cAAa,aAAa,IAAI,IAAI;AACxC,WAAOA,YAAW,OAAO,KAAK;EAChC;AACA,QAAM,YAAY;AAClB,QAAM,aAAa,aAAa,IAAI,IAAI;AACxC,MAAI,OAAO,UAAU,eAAe,KAAK,YAAY,UAAU,GAAG;AAChE,WAAO,WAAW,UAAU,KAAK;EACnC;AACA,MAAI,OAAO,UAAU,eAAe,KAAK,WAAW,UAAU,GAAG;AAC/D,WAAO,UAAU,UAAU,KAAK;EAClC;AACA,SAAO;AACT;AAGA,SAAS,kBAAkB,MAAmB,YAAkC;AAC9E,MAAI,WAAW,SAAS,QAAQ;AAG9B,WAAO,KAAK,IAAI,CAAC,EAAE,mBAAmB,kBAAkB,GAAG,IAAG,MAAO,GAAG;EAC1E;AACA,SAAO,KAAK,IAAI,CAAC,QAAO;AACtB,UAAM,YAAqC,CAAA;AAC3C,eAAW,SAAS,WAAW,QAAQ;AACrC,gBAAU,KAAK,IAAI,qBAAqB,KAAK,KAAK;IACpD;AACA,WAAO;EACT,CAAC;AACH;AAkFA,SAAS,+BACP,gBAAoC;AAEpC,QAAM,WAAW,qCAAqC,eAAe,YAAY,MAAS;AAC1F,SAAO,UAAU,iBAAiB,EAAE,cAAc,SAAS,cAAc,QAAQ,SAAS,eAAc,IAAK;AAC/G;AAEA,SAAS,uBAAuB,UAAoB;AAClD,QAAM,WAAW,qCAAqC,yBAAyB,SAAS,QAAQ,QAAQ,CAAC;AACzG,SAAO,UAAU,SAAS,EAAE,cAAc,SAAS,cAAc,QAAQ,SAAS,OAAM,IAAK;AAC/F;AAEA,SAAS,mBAAmB,UAAkB,YAAyB;AACrE,QAAM,iBAA2B,CAAA;AACjC,QAAM,cAAc,wBAAwB,QAAQ;AACpD,QAAM,mBAAmB,OAAO,KAAK,YAAY,aAAa,EAAE,SAAS;AACzE,MAAI,oBAAoB,YAAY,cAAc,KAAI,EAAG,WAAW,GAAG;AACrE,UAAM,IAAI,WACR,iFACA,UAAU,OACV;MACE,UAAU,CAAC,kCAAkC,yCAAyC;MACtF,WAAW;QACT;;KAEH;EAEL;AACA,QAAM,QAAQ,mBAAmB,YAAY,gBAAgB;AAC7D,QAAM,UAAU,wBAAwB,YAAY,YAAY,eAAe,cAAc;AAC7F,SAAO;IACL;IACA;IACA;IACA,WAAW,QAAQ,cAAc;IACjC,eAAe,mBAAmB,QAAQ,aAAa;IACvD,YAAY,gBAAgB,QAAQ,UAAU;IAC9C,aAAa,iBAAiB,QAAQ,WAAW;IACjD,WAAW,eAAe,OAAO,QAAQ,cAAc,WAAW,QAAQ,YAAY,MAAS;IAC/F,kBAAkB,sBAAsB,QAAQ,QAAQ;IACxD,WAAW,QAAQ,UAAU;IAC7B,QAAQ,YAAY,KAAK;IACzB,iBAAiB,sBAAsB,KAAK;IAC5C,OAAO,WAAW,QAAQ,KAAK;IAC/B,YAAY,sBAAsB,OAAO;IACzC,iBAAiB,OAAO,QAAQ,SAAS,YAAY,QAAQ,KAAK,KAAI,EAAG,SAAS;;AAEtF;AAEA,eAAe,4BACb,UACA,QAAqB;AAErB,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,iBAAiB,MAAM,aAAa,MAAM;AAChD,QAAM,WAAW,2CAA2C,cAAc,EAAE;AAC5E,QAAM,iBAAiB,6BAA6B,SAAS,MAAM;AACnE,QAAM,uBAAuB,4BAA4B,SAAS,MAAM;AACxE,iCAA+B,SAAS,YAAY,oBAAoB;AACxE,QAAM,sBAAsB,2BAC1B,SAAS,SACT,sBACA,QAAQ;AAEV,QAAM,eAAe,wBAAwB,UAAU,gCAA+B,CAAE;AACxF,QAAM,qBAAqB,0BAA0B,QAAQ;AAC7D,QAAM,mBAAmB,oBAAoB,UAAU,MAAM;AAC7D,QAAM,0BAA0B,+BAA+B,QAAQ;AACvE,QAAM,yBAAyB,8BAA8B,QAAQ;AACrE,QAAM,yBAAyB,4BAA4B,SAAS,QAAQ,cAAc;AAC1F,QAAM,iBAAiB,4BAA4B,UAAU,mBAAmB,QAAQ,QAAQ,IAAI;AACpG,QAAM,SAAS,oBACb,UACA,mBAAmB,QAAQ,SAAS,yBAAyB,SAAS,QAAQ,eAAe,KAAK,wBAAwB;AAE5H,SAAO;IACL;IACA;IACA;IACA;IACA;IACA;IACA,YAAY,wBAAwB,QAAQ;IAC5C,gBAAgB,SAAS,oBAAoB,4BAA4B,QAAQ;IACjF,wBAAwB,SAAS,QAAQ,mBAAmB;IAC5D;IACA,sBAAsB,0BAA0B,4BAA4B,QAAQ;IACpF,QAAQ,oBAAoB,QAAQ;IACpC;IACA;IACA;IACA;IACA,UAAU,uBAAuB;MAC/B,oBAAoB,yBAAyB,SAAS,QAAQ,QAAQ;MACtE,sBAAsB,mBAAmB,WAAW;MACpD,4BAA4B,4BAA4B;KACzD;IACD;IACA,yBAAyB,+BAA+B,cAAc;IACtE;IACA,iBAAiB,uBAAuB,QAAQ;IAChD,eAAe,UAAU,SAAS,QAAQ,MAAM;MAC9C,aAAa,mBAAmB,WAAW,QAAQ,4BAA4B;MAC/E,gBAAgB,iBAAiB,WAAW,QAAQ,2BAA2B;KAChF;;AAEL;AAEA,eAAe,yBACb,UACA,SAA6B;AAE7B,QAAM,kBAAkB,MAAM,cAC5B,QAAQ,QACR,QAAQ,SAAS,eAAe,QAChC,QAAQ,aAAa,gBACrB,QAAQ,SAAS,MAAM;AAEzB,QAAM,eAAe,qBACnB,OAAO,SAAS,QAAQ,WAAW,WAAW,SAAS,QAAQ,SAAS,QACxE,QAAQ,gBACR,EAAE,QAAQ,KAAI,CAAE;AAElB,QAAM,sBAAsB,sCAAsC,QAAQ,cAAc;AACxF,QAAM,4BAA4B,aAChC,gBAAgB,WAChB,SAAS,SACT,QAAQ,cACR,QAAQ,qBACR,cACA,mBAAmB;AAErB,SAAO;IACL,UAAU,gBAAgB;IAC1B,cAAc,gBAAgB;IAC9B,mBAAmB,uBAAuB,2BAA2B,SAAS,iBAAiB;MAC7F,YAAY,SAAS;MACrB,aAAa,SAAS,eAAe,SAAS,cAAc;KAC7D;;AAEL;AAEA,eAAe,wBACb,eACA,eACA,mBAAiC;AAEjC,QAAM,mBAAmB,oBAAI,IAAG;AAChC,MAAI,CAAC,iBAAkB,kBAAkB,aAAa,kBAAkB,UAAW;AACjF,WAAO;EACT;AACA,QAAM,cAAc,QAAQ,IAAG;AAC/B,QAAM,oBAAoB,MAAM,yBAAyB,aAAa,oBAAoB,WAAW,CAAC;AACtG,QAAM,sBAAsB,MAAM,QAAQ,IACxC,kBAAkB,IAAI,OAAO,aAAa,CAAC,SAAS,SAAS,IAAI,MAAM,iBAAiB,UAAU,iBAAiB,CAAC,CAAU,CAAC;AAEjI,aAAW,CAAC,IAAI,MAAM,KAAK,qBAAqB;AAC9C,qBAAiB,IAAI,IAAI,MAAM;EACjC;AACA,SAAO;AACT;AAEA,eAAe,yBACb,UACA,SACA,mBAAiC;AAEjC,QAAM,mBAAmB,MAAM,wBAAwB,SAAS,eAAe,QAAQ,eAAe,iBAAiB;AACvH,QAAM,qBAAqB,SAAS,cAAc;AAClD,SAAO,kBACJ,IAAI,CAAC,aACJ,wBACE,UACA,SAAS,QACT,SAAS,iBACT,SAAS,eACT,kBACA,QAAQ,QACR,QAAQ,SAAS,WACjB,kBAAkB,CACnB,EAEF,OAAO,CAAC,UAA8B,UAAU,IAAI,EACpD,OAAO,CAAC,UAAU,SAAS,cAAc,SAAS,MAAM,sBAAsB,IAAI;AACvF;AAEA,SAAS,kCACP,UACA,WAAkB;AAElB,SAAO,kBACL,SAAS,OACT,SAAS,eACT,SAAS,WACT,SAAS,SACT,SAAS,eACT,SAAS,gBACT,SAAS,sBACT,SAAS,gBACT,SAAS,QACT,SAAS,YACT,SAAS,UACT,SAAS,qBACT,SAAS;AAEb;AAEA,eAAe,yBACb,UACA,SACA,mBACA,aACA,UAAkB;AAElB,MAAI,QAAQ,aAAa,QAAQ,QAAQ,kBAAkB,WAAW;AACpE,WAAO;EACT;AACA,QAAM,OAAO,uBAAuB;IAClC,eAAe,QAAQ;IACvB,OAAO,SAAS;IAChB;IACA;IACA,cAAc,0BAA0B,QAAQ,QAAQ;IACxD,YAAY,kBAAkB,QAAQ,QAAQ;IAC9C,sBAAsB,QAAQ;GAC/B;AACD,MAAI,QAAQ,aAAa,iBAAiB;AACxC,aAAS,KAAK,UAAU,QAAQ,aAAa,wDAAwD;EACvG;AACA,SAAO;AACT;AAEA,eAAe,+BACb,UACA,SACA,mBACA,cAAuC;AAEvC,MAAI,CAAC,QAAQ,yBAAyB;AACpC,WAAO;EACT;AACA,QAAM,wBACJ,QAAQ,mBAAmB,WAAW,SACrC,QAAQ,iBAAiB,WAAW,QAAQ,QAAQ,2BAA2B;AAClF,MAAI;AACF,UAAM,mBAAmB,MAAM,QAAQ,QACrC,QAAQ,wBAAwB,MAAM;MACpC,OAAO,SAAS;MAChB,MAAM,QAAQ;MACd,QAAQ,SAAS;MACjB,SAAS,SAAS;MAClB,UAAU,QAAQ;MAClB,WAAW;KACZ,CAAC;AAEJ,WAAO,+BAA+B,QAAQ,wBAAwB,cAAc,kBAAkB,YAAY;EACpH,SAAS,OAAgB;AACvB,QAAI,CAAC,uBAAuB;AAC1B,YAAM,IAAI,WACR,8BAA8B,QAAQ,wBAAwB,YAAY,aAAa,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,IAC7I,UAAU,eAAe;IAE7B;AACA,WAAO;EACT;AACF;AAEA,SAAS,2BACP,eACA,gBACA,aACA,UAAkB;AAElB,MAAI,eAAe,mBAAmB,GAAG;AACvC,WAAO,eAAe;EACxB;AACA,WAAS,KAAK,UAAU,aAAa,iDAAiD;AACtF,SAAO,kBAAkB,aAAa,cAAc,eAAe;AACrE;AAEA,eAAe,6BACb,SACA,eACA,mBACA,UACA,iBAAwB;AAExB,QAAM,yBACJ,CAAC,QAAQ,2BACT,QAAQ,mBAAmB,WAAW,SACrC,QAAQ,iBAAiB,WAAW,QAAQ,QAAQ,2BAA2B;AAClF,MAAI,mBAAmB,wBAAwB;AAC7C,UAAM,iCAAiC,QAAQ,QAAQ,mBAAmB,QAAQ;EACpF;AACA,MAAI,CAAC,QAAQ,yBAAyB;AACpC,gCACE,eACA,QAAQ,oBACR,QAAQ,kBACR,QAAQ,2BAA2B,IAAI;EAE3C;AACF;AAEA,eAAe,sBAAsB,OAA+B;AAClE,QAAM,EAAE,UAAU,SAAS,mBAAmB,aAAa,UAAU,gBAAe,IAAK;AACzF,MAAI,OAAO;AACX,QAAM,WAAW,MAAM,yBAAyB,UAAU,SAAS,mBAAmB,aAAa,QAAQ;AAC3G,QAAM,eAAe,QAAQ;AAC7B,MAAI,aAAa,QAAQ,iBAAiB,WAAW;AACnD,WAAO,EAAE,eAAe,QAAQ,eAAe,MAAM,YAAY,KAAI;EACvE;AACA,MAAI;AACF,UAAM,6BAA6B,SAAS,cAAc,mBAAmB,UAAU,eAAe;AACtG,QAAI,kBAAkB,WAAW,KAAK,SAAS,UAAU,GAAG;AAC1D,aAAO,EAAE,eAAe,QAAQ,eAAe,MAAM,CAAA,EAAE;IACzD;AACA,UAAM,eAAe,IAAI,IAAI,kBAAkB,IAAI,CAAC,aAAa,CAAC,SAAS,SAAS,IAAI,QAAQ,CAAC,CAAC;AAClG,WAAO,MAAM,+BAA+B,UAAU,SAAS,mBAAmB,YAAY,KAAK;AACnG,QAAI,SAAS,aAAa;AACxB,YAAM,EAAE,UAAU,YAAW,IAAK,4BAChC,cACA,QAAQ,oBACR,QAAQ,kBACR,QAAQ,2BAA2B,IAAI;AAEzC,YAAM,iBAAiB,MAAM,4BAA4B;QACvD,eAAe;QACf,OAAO,SAAS;QAChB;QACA;QACA,sBAAsB,QAAQ;QAC9B,OAAO,SAAS;QAChB,YAAY,QAAQ;QACpB;QACA;QACA,wBAAwB,QAAQ;QAChC,gBAAgB,QAAQ;QACxB,yBAAyB,QAAQ;QACjC,QAAQ,QAAQ;QAChB,iBAAiB,QAAQ;QACzB;QACA,UAAU,QAAQ;OACnB;AACD,aAAO,2BAA2B,cAAc,gBAAgB,aAAa,QAAQ;IACvF;AACA,WAAO,EAAE,eAAe,QAAQ,eAAe,KAAI;EACrD,SAAS,OAAgB;AACvB,aAAS,KAAK,qCAAqC,QAAQ,eAAe,KAAK,CAAC;AAChF,WAAO,EAAE,eAAe,WAAW,MAAM,YAAW;EACtD;AACF;AAEA,SAAS,2BAA2B,UAAiC,OAAa;AAChF,MAAI,SAAS,WAAW,SAAS,aAAa,SAAS,QAAQ,YAAY,MAAM;AAC/E,WAAO,mBAAmB;MACxB,OAAO,SAAS,MAAM,KAAI;MAC1B,MAAM,SAAS;MACf,OAAO,CAAA;MACP,OAAO;MACP;MACA,YAAY;MACZ,SAAS,gCAAgC;QACvC,MAAM,SAAS;QACf,WAAW,SAAS;QACpB,SAAS,SAAS;QAClB,eAAe,SAAS;QACxB,YAAY,SAAS;QACrB,aAAa,SAAS;QACtB,gBAAgB,SAAS;QACzB,sBAAsB,SAAS;QAC/B,qBAAqB,SAAS;OAC/B;OACA,SAAS,QAAQ;EACtB;AACA,QAAM,mBAAmB,SAAS,WAAW,SAAS,SAAS,OAAO,CAAC,GAAG,SAAS,WAAW,MAAM;AACpG,SAAO,mBAAmB;IACxB,OAAO,SAAS,MAAM,KAAI;IAC1B,MAAM,SAAS;IACf,OAAO,CAAA;IACP,OAAO;IACP;IACA,YAAY;IACZ,SAAS,0BAA0B;MACjC,eAAe,SAAS;MACxB,WAAW,SAAS;MACpB,SAAS,SAAS;MAClB,eAAe,SAAS;MACxB,YAAY,SAAS;MACrB,aAAa,SAAS;MACtB,gBAAgB,SAAS;MACzB,sBAAsB,SAAS;MAC/B,gBAAgB,SAAS;MACzB,QAAQ,SAAS;MACjB,qBAAqB,SAAS;KAC/B;IACD,YAAY;MACV,MAAM,SAAS,WAAW;MAC1B,QAAQ;;IAEV,KAAK,OAAM;KACV,SAAS,QAAQ;AACtB;AAEA,SAAS,mBAAmB,QAAsB,UAAkB;AAClE,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO;EACT;AACA,SAAO,EAAE,GAAG,QAAQ,SAAQ;AAC9B;AAEA,SAAS,uBACP,UACA,mBACA,SAAoB;AAEpB,MAAI,CAAC,SAAS,WAAW;AACvB,WAAO,EAAE,MAAM,SAAS,YAAY,SAAS,WAAU;EACzD;AACA,QAAM,eAAe,IAAI,IAAI,kBAAkB,IAAI,CAAC,aAAa,CAAC,SAAS,SAAS,IAAI,QAAQ,CAAC,CAAC;AAClG,QAAM,OAAO,QAAQ,IAAI,CAAC,SAAS;IACjC,GAAG;IACH,YAAY,mBAAmB,aAAa,IAAI,IAAI,KAAK,EAAE,GAAI,IAAI,gBAAgB,SAAS,MAAM;IAClG;AACF,MAAI,SAAS,WAAW,SAAS,UAAU,SAAS,WAAW,OAAO,SAAS,YAAY,GAAG;AAC5F,WAAO,EAAE,MAAM,YAAY,SAAS,WAAU;EAChD;AACA,SAAO,EAAE,MAAM,YAAY,EAAE,MAAM,SAAS,WAAW,MAAM,QAAQ,CAAC,GAAG,SAAS,WAAW,QAAQ,YAAY,EAAC,EAAE;AACtH;AAEA,SAAS,yBACP,UACA,gBACA,OACA,cACA,qBAA2C;AAE3C,QAAM,mBAAmB,eAAe,QAAQ,EAAE,MAAK,IAAK,CAAA;AAC5D,MAAI,SAAS,WAAW,SAAS,aAAa,SAAS,QAAQ,YAAY,MAAM;AAC/E,WAAO,mBAAmB;MACxB,OAAO,SAAS,MAAM,KAAI;MAC1B,MAAM,SAAS;MACf,OAAO;MACP,OAAO,eAAe;MACtB,GAAG;MACH,SAAS,gCAAgC;QACvC,MAAM,SAAS;QACf,WAAW,SAAS;QACpB,SAAS,SAAS;QAClB,eAAe,SAAS;QACxB,YAAY,SAAS;QACrB,aAAa,SAAS;QACtB,gBAAgB,SAAS;QACzB,sBAAsB,SAAS;QAC/B,qBAAqB,SAAS;OAC/B;OACA,SAAS,QAAQ;EACtB;AACA,QAAM,wBAAwB,oBAAoB,SAAS,SAAS,OAAO,CAAC,GAAG,oBAAoB,MAAM;AACzG,SAAO;IACL,OAAO,SAAS,MAAM,KAAI;IAC1B,MAAM,SAAS;IACf,OAAO;IACP,OAAO,eAAe;IACtB,GAAG;IACH,SAAS,0BAA0B;MACjC,eAAe,SAAS;MACxB,WAAW,SAAS;MACpB,SAAS,SAAS;MAClB,eAAe,SAAS;MACxB,YAAY,SAAS;MACrB,aAAa,SAAS;MACtB,gBAAgB,SAAS;MACzB,sBAAsB,SAAS;MAC/B,gBAAgB,SAAS;MACzB,QAAQ,SAAS;MACjB,qBAAqB,SAAS;KAC/B;IACD,YAAY;MACV,MAAM,oBAAoB;MAC1B,QAAQ;;IAEV,KAAK,OAAM;IACX,GAAI,SAAS,SAAS,SAAS,IAAI,EAAE,UAAU,SAAS,SAAQ,IAAK,CAAA;;AAEzE;AAKA,eAAsB,UAAU,UAAkB,YAA2B,QAAqB;AAChG,QAAM,WAAW,mBAAmB,UAAU,UAAU;AACxD,QAAM,UAAU,MAAM,4BAA4B,UAAU,MAAM;AAClE,QAAM,SAAS,MAAM,yBAAyB,UAAU,OAAO;AAC/D,QAAM,WAAW,OAAO;AACxB,WAAS,KAAK,GAAG,SAAS,cAAc;AACxC,MAAI,QAAQ,kBAAkB,YAAY,QAAQ,0BAA0B,QAAQ,2BAA2B,QAAW;AACxH,aAAS,KAAK,uEAAuE;EACvF;AACA,QAAM,eAAe;IACnB,OAAO,SAAS;IAChB,WAAW,SAAS;IACpB,SAAS,SAAS;IAClB,eAAe,SAAS;IACxB,YAAY,SAAS;IACrB,aAAa,SAAS;IACtB,gBAAgB,QAAQ;IACxB,sBAAsB,QAAQ;IAC9B,gBAAgB,QAAQ;IACxB,QAAQ,QAAQ;IAChB,YAAY,SAAS;IACrB;IACA,qBAAqB,QAAQ;;AAE/B,MAAI,QAAQ,kBAAkB,cAAc,OAAO,kBAAkB,WAAW,KAAK,SAAS,UAAU,IAAI;AAC1G,WAAO,kCACL,EAAE,GAAG,cAAc,eAAe,QAAQ,cAAa,GACvD,SAAS,SAAS;EAEtB;AACA,QAAM,cAAc,MAAM,yBAAyB,UAAU,SAAS,OAAO,iBAAiB;AAC9F,QAAM,aAAa,MAAM,sBAAsB;IAC7C;IACA;IACA,mBAAmB,OAAO;IAC1B;IACA;IACA,iBAAiB,SAAS;GAC3B;AACD,MAAI,WAAW,kBAAkB,aAAa,WAAW,KAAK,WAAW,MAAM,OAAO,kBAAkB,WAAW,KAAK,SAAS,UAAU,IAAI;AAC7I,WAAO,kCACL,EAAE,GAAG,cAAc,eAAe,WAAW,cAAa,GAC1D,SAAS,SAAS;EAEtB;AACA,QAAM,cAAc,WAAW,KAAK,OAAO,CAAC,UAAU,MAAM,mBAAmB,QAAQ,MAAM,SAAS,QAAQ,cAAc;AAC5H,QAAM,SAAS,SAAS,aAAa,QAAQ,cAAc;AAC3D,QAAM,QAAQ,OAAO;AACrB,QAAM,gBAAgB,SAAS,SAAS,QAAQ;AAChD,QAAM,UAAU,OAAO,MAAM,GAAG,aAAa;AAC7C,QAAM,WAAW,EAAE,GAAG,cAAc,eAAe,WAAW,cAAa;AAC3E,MAAI,SAAS,WAAW;AACtB,WAAO,2BAA2B,UAAU,KAAK;EACnD;AACA,QAAM,EAAE,MAAM,eAAe,YAAY,oBAAmB,IAAK,uBAC/D,UACA,OAAO,mBACP,OAAO;AAET,QAAM,iBAAiB,kBAAkB,eAAe,mBAAmB;AAC3E,SAAO,yBAAyB,UAAU,gBAAgB,OAAO,QAAQ,QAAQ,mBAAmB;AACtG;;;AIniGA,OAAOC,SAAQ;AACf,OAAOC,WAAU;;;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,qCAAqCC,MAAK,KAAK,UAAU,mBAAmB;AAiDzF,IAAMC,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,MAAMC,IAAG,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,SAAsB,QAAqB;AACvE,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,IAAI,WAAW,QAAQ,CAAC;AAC9B,QAAM,cAAc,cAAc,QAAQ,IAAI;AAC9C,QAAM,YAAY,eAAe,QAAQ,SAAS;AAClD,QAAM,cAAc,QAAQ,UACxBF,MAAK,QAAQ,QAAQ,IAAG,GAAI,QAAQ,OAAO,IAC3CA,MAAK,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,GACtC,MAAM;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;;;AE5KA,IAAM,qBAAqB,oBAAI,IAAI,CAAC,aAAa,MAAM,CAAC;AA0BxD,IAAM,mBAAmB,CAAC,SAAS,YAAY,MAAM;AAerD,SAAS,sBACP,OAAwB;AAExB,SAAO;IACL,IAAI,MAAM;IACV,QAAQ,MAAM;IACd,SAAS,MAAM,WAAW;;AAE9B;AAEA,SAAS,yBACP,eACA,SAA4B;AAE5B,QAAM,WAAW,eAAe,KAAI;AACpC,QAAM,qBAAqB,YAAY,SAAS,SAAS,IAAI,WAAW;AACxE,QAAM,YAAY,CAAC,GAAG,OAAO,EAAE,QAAO,EAAG,KAAK,CAAC,UAAU,MAAM,OAAO,OAAO;AAC7E,QAAM,cAAc,CAAC,GAAG,OAAO,EAAE,QAAO,EAAG,KAAK,CAAC,UAAU,MAAM,OAAO,SAAS;AACjF,SAAO;IACL,SAAS,uBAAuB;IAChC,UAAU;IACV,YAAY,YAAY,sBAAsB,SAAS,IAAI;IAC3D,cAAc,cAAc,sBAAsB,WAAW,IAAI;;AAErE;AAEA,SAAS,cAAc,KAAuB;AAC5C,MAAI,QAAQ,UAAa,IAAI,KAAI,EAAG,WAAW,GAAG;AAChD,WAAO;EACT;AACA,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,MAAI,eAAe,QAAQ;AACzB,WAAO;EACT;AACA,MAAI,iBAAiB,SAAS,UAAsB,GAAG;AACrD,WAAO;EACT;AACA,QAAM,IAAI,WAAW,uDAAuD,UAAU,KAAK;AAC7F;AAEA,SAAS,oBAAoB,MAAuB,OAAe;AACjE,MAAI,UAAU,QAAQ;AACpB,WAAO;EACT;AACA,QAAM,EACJ,UAAU,WACV,OAAO,QACP,WAAW,YACX,OAAO,QACP,OAAO,QACP,MAAM,OACN,WAAW,YACX,QAAQ,SACR,GAAG,UAAS,IACV;AACJ,SAAO;AACT;AAEA,SAAS,eAAe,KAAuB;AAC7C,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,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,UAAM,IAAI,WAAW,+DAA+D,UAAU,KAAK;EACrG;AACA,SAAO;AACT;AAEA,SAAS,kBAAkB,OAAa;AACtC,SAAO,MAAM,WAAW,OAAO,IAAI,MAAM,MAAM,QAAQ,MAAM,IAAI;AACnE;AAEA,SAAS,kBAAkB,QAAyB,qBAAqC;AACvF,MAAI,WAAW,MAAM;AACnB;EACF;AACA,QAAM,aAAa,oBAAI,IAAI,CAAC,GAAG,wBAAwB,GAAG,mBAAmB,CAAC;AAC9E,QAAM,oBAAoB,oBAAI,IAAI,CAAC,QAAQ,UAAU,eAAe,UAAU,CAAC;AAC/E,QAAM,sBAAsB,oBAAI,IAAI,CAAC,gBAAgB,gBAAgB,aAAa,CAAC;AACnF,QAAM,0BAA0B,oBAAI,IAAI,CAAC,uBAAuB,wBAAwB,0BAA0B,0BAA0B,CAAC;AAC7I,QAAM,UAAU,OAAO,OAAO,CAAC,UAAS;AACtC,UAAM,aAAa,kBAAkB,KAAK;AAC1C,WACE,CAAC,WAAW,IAAI,UAAU,KAC1B,CAAC,kBAAkB,IAAI,UAAU,KACjC,CAAC,oBAAoB,IAAI,UAAU,KACnC,CAAC,wBAAwB,IAAI,UAAU;EAE3C,CAAC;AACD,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,IAAI,WAAW,kCAAkC,QAAQ,KAAK,IAAI,CAAC,IAAI,UAAU,OAAO;MAC5F,MAAM;MACN,UAAU;QACR;QACA;QACA;;KAEH;EACH;AACF;AAEA,SAAS,qBAAqB,MAAuB,QAAgB;AACnE,QAAM,SAAS,aAAa,IAAI;AAChC,QAAM,YAAqC,CAAA;AAC3C,aAAW,SAAS,QAAQ;AAC1B,UAAM,aAAa,MAAM,WAAW,OAAO,IAAI,MAAM,MAAM,QAAQ,MAAM,IAAI;AAC7E,QAAI,eAAe,UAAU,eAAe,YAAY,WAAW,WAAW,SAAS,GAAG;AACxF;IACF;AACA,cAAU,UAAU,IAAI,OAAO,UAAU;EAC3C;AACA,SAAO;AACT;AAEA,SAAS,cAAc,QAAyB,MAAY;AAC1D,SAAO,QAAQ,KAAK,CAAC,UAAU,UAAU,QAAQ,UAAU,QAAQ,IAAI,EAAE,KAAK;AAChF;AAEA,SAAS,kBAAkB,QAAkB,MAAY;AACvD,SAAO,OAAO,KAAK,CAAC,UAAU,UAAU,QAAQ,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC;AAC9E;AAkBA,SAAS,qBAAqB,SAAmB;AAC/C,MAAI,QAAQ,SAAS,QAAQ,WAAW,UAAa,QAAQ,UAAU,SAAY;AACjF,UAAM,IAAI,WAAW,8FAA8F,UAAU,KAAK;EACpI;AACA,MAAI,QAAQ,SAAS,QAAQ,QAAQ,cAAc,QAAW;AAC5D,UAAM,IAAI,WAAW,oCAAoC,UAAU,KAAK;EAC1E;AACA,SAAO;IACL,OAAO,QAAQ,OAAO,SAAS,cAAc,QAAQ,KAAK;IAC1D,WAAW,QAAQ,SAAS,OAAO,kBAAkB,QAAQ,WAAW,cAAc,IAAI;IAC1F,QAAQ,eAAe,QAAQ,MAAM;IACrC,iBAAiB,QAAQ,WAAW;;AAExC;AAEA,eAAe,mBAAmB,IAAY,QAAqB;AACjE,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAI,OAAO,IAAI;AACvD,MAAI,CAAE,MAAM,WAAW,gBAAgB,MAAM,CAAC,GAAI;AAChD,UAAM,IAAI,WAAW,iCAAiC,MAAM,wBAAwB,UAAU,SAAS;EACzG;AACA,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,eAAe,wBAAwB,UAAU,gCAA+B,CAAE;AACxF,QAAM,UAAU,MAAM,WAAW,QAAQ,IAAI,SAAS,WAAW,SAAS,aAAa,aAAa,cAAc;AAClH,MAAI,CAAC,SAAS;AACZ,UAAM,MAAM,uBAAuB,QAAQ,IAAI,SAAS,WAAW,aAAa,cAAc;EAChG;AACA,QAAM,SAAS,MAAM,gBAAgB,SAAS,EAAE,QAAQ,SAAS,OAAM,CAAE;AACzE,SAAO;IACL;IACA;IACA,cAAc,aAAa;IAC3B,WAAW,QAAQ;IACnB,UAAU,OAAO,SAAS;IAC1B,MAAM,OAAO,SAAS;;AAE1B;AAEA,SAAS,4BAA4B,QAAyB,UAAkD;AAC9G,QAAM,sBAAsB,4BAA4B,SAAS,MAAM,EAAE,YAAY,IAAI,CAAC,UAAU,MAAM,YAAY;AACtH,oBAAkB,QAAQ,mBAAmB;AAC/C;AAEA,SAAS,sBAAsB,QAM9B;AACC,QAAM,EAAE,iBAAiB,OAAO,QAAQ,OAAO,SAAQ,IAAK;AAC5D,MAAI,iBAAiB;AACnB,QAAI,UAAU,UAAU,UAAU,UAAU;AAC1C,aAAO,cAAc,QAAQ,KAAK;IACpC;AACA,WAAO,kBAAkB,QAAoB,KAAK;EACpD;AACA,MAAI,UAAU,YAAY;AACxB,WAAO,UAAU,WAAW,mBAAmB,IAAI,QAAkB;EACvE;AACA,SAAO,UAAU;AACnB;AAEA,eAAe,qBAAqB,SAAyB,mBAA0B;AACrF,MAAI,CAAC,mBAAmB;AACtB,WAAO;EACT;AACA,QAAM,cAAc,eAAe,QAAQ,QAAQ,QAAQ,SAAS;AACpE,QAAM,UAAU,MAAM,mBAAmB,aAAa,QAAQ,SAAS;AACvE,SAAO,yBAAyB,QAAQ,SAAS,UAAU,OAAO;AACpE;AAEA,SAAS,gBACP,QACA,SACA,QACA,eAAsB;AAEtB,QAAM,qBAAqB,iBAAiB,cAAc,QAAQ,cAAc;AAChF,QAAM,qBAAqB,iBAAiB,cAAc,QAAQ,cAAc;AAChF,QAAM,oBAAoB,iBAAiB,cAAc,QAAQ,aAAa;AAC9E,MAAI,CAAC,iBAAiB,CAAC,sBAAsB,CAAC,sBAAsB,CAAC,mBAAmB;AACtF;EACF;AACA,SAAO,SAAS;IACd,OAAO,qBAAqB,QAAQ,SAAS,SAAS,CAAA,IAAK,CAAA;IAC3D,OAAO,qBAAqB,QAAQ,SAAS,SAAS,CAAA,IAAK,CAAA;IAC3D,MAAM,oBAAoB,QAAQ,SAAS,QAAQ,CAAA,IAAK,CAAA;;AAE5D;AAEA,eAAe,uBAAuB,SAAyB,iBAAwB;AACrF,MAAI,CAAC,iBAAiB;AACpB,WAAO;EACT;AACA,QAAM,iBAAiB,6BAA6B,QAAQ,SAAS,MAAM;AAC3E,QAAM,SAAS,MAAM,wBACnB,QAAQ,QACR,QAAQ,SAAS,aACjB,QAAQ,cACR,QACA,QAAQ,SAAS,MAAM;AAEzB,QAAM,WAAmC,CAAA;AACzC,MAAI,SAAS;AACb,MAAI,QAAQ;AACZ,QAAM,YAAY,QAAQ,UAAU,KAAI,EAAG,YAAW;AACtD,aAAW,aAAa,QAAQ;AAC9B,UAAM,WAAW,OAAO,UAAU,WAAW,WAAW,UAAU,OAAO,KAAI,EAAG,YAAW,IAAK;AAChG,QAAI,aAAa;AAAW;AAC5B,UAAM,kBAAkB,UAAU,OAAO,KAAI,EAAG,YAAW;AAC3D,aAAS;AACT,aAAS,eAAe,KAAK,SAAS,eAAe,KAAK,KAAK;AAC/D,QAAI,CAAC,iBAAiB,iBAAiB,cAAc,GAAG;AACtD,gBAAU;IACZ;EACF;AACA,SAAO,EAAE,OAAO,QAAQ,WAAW,SAAQ;AAC7C;AAEA,eAAe,aACb,SACA,SACA,WACA,QAAqB;AAErB,MAAI,QAAQ,SAAS,MAAM;AACzB,WAAO;EACT;AACA,QAAM,UAAU,MAAM,QACpB,QACA;IACE,QAAQ,QAAQ;IAChB,MAAM;IACN,WAAW,cAAc,SAAY,SAAY,OAAO,SAAS;IACjE,MAAM;KAER,MAAM;AAER,SAAO;IACL,SAAS,QAAQ;IACjB,YAAY,QAAQ,SAAS;IAC7B,aAAa,aAAa;IAC1B,OAAO,QAAQ;IACf,OAAO,QAAQ,MAAM,IAAI,CAAC,UAAU,aAAa,KAAK,CAAC;;AAE3D;AAKA,eAAsB,OAAO,IAAY,QAAuB,UAAsB,CAAA,GAAE;AACtF,QAAM,aAAa,qBAAqB,OAAO;AAC/C,QAAM,UAAU,MAAM,mBAAmB,IAAI,MAAM;AACnD,8BAA4B,WAAW,QAAQ,QAAQ,QAAQ;AAC/D,QAAM,cAAc,sBAAsB,EAAE,GAAG,YAAY,OAAO,OAAM,CAAE;AAC1E,QAAM,gBAAgB,sBAAsB,EAAE,GAAG,YAAY,OAAO,SAAQ,CAAE;AAC9E,QAAM,oBAAoB,sBAAsB,EAAE,GAAG,YAAY,OAAO,cAAa,CAAE;AACvF,QAAM,WAAW,QAAQ,SAAS,KAAK,KAAI,EAAG,YAAW;AACzD,QAAM,kBAAkB,sBAAsB,EAAE,GAAG,YAAY,OAAO,YAAY,SAAQ,CAAE;AAC5F,QAAM,aAAa,MAAM,qBAAqB,SAAS,iBAAiB;AACxE,QAAM,SAAoB;IACxB,MAAM,WAAW,kBACb,qBAAqB,QAAQ,UAAU,WAAW,MAAkB,IACpE,oBAAoB,QAAQ,UAAU,WAAW,KAAK;;AAE5D,MAAI,aAAa;AACf,WAAO,KAAK,OAAO,QAAQ;EAC7B;AACA,kBAAgB,QAAQ,SAAS,WAAW,QAAQ,aAAa;AACjE,MAAI,YAAY;AACd,WAAO,cAAc;EACvB;AACA,SAAO,WAAW,MAAM,uBAAuB,SAAS,eAAe;AACvE,SAAO,OAAO,MAAM,aAAa,SAAS,SAAS,WAAW,WAAW,MAAM;AAC/E,SAAO;AACT;;;ACtXO,IAAM,qBAAqB,CAAC,YAAY,QAAQ,MAAM;AAM7D,IAAM,qBAAqB;AAC3B,IAAM,aAAa,KAAK,KAAK,KAAK;AAgFlC,SAAS,sBAAsB,KAAuB;AACpD,MAAI,CAAC;AAAK,WAAO;AACjB,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW;AACzC,MAAI,CAAC,mBAAmB,SAAS,UAA8B,GAAG;AAChE,UAAM,IAAI,WAAW,iDAAiD,UAAU,KAAK;EACvF;AACA,SAAO;AACT;AAOM,SAAU,wBAAwB,SAAsB,QAAqB;AACjF,QAAM,gBAAgB,sBAAsB,QAAQ,MAAM;AAC1D,MAAI,OAAO,QAAQ,iBAAiB,kBAAkB,QAAQ;AAC5D,UAAM,IAAI,WAAW,qDAAqD,UAAU,KAAK;EAC3F;AACA,MAAI,OAAO,MAAM;AACf,WAAO;EACT;AACA,SAAO,iBAAiB;AAC1B;AAIA,SAAS,eAAe,KAAyB,MAAc,UAAgB;AAC7E,QAAM,SAAS,kBAAkB,KAAK,IAAI;AAC1C,MAAI,WAAW,UAAa,UAAU;AAAG,WAAO;AAChD,SAAO;AACT;AAIA,SAAS,qBACP,OACA,gBACA,kBAAgD;AAEhD,SAAO;IACL,GAAG,mBAAmB,MAAM,MAAM,gBAAgB,gBAAgB;IAClE,oBAAoB,MAAM,cAAc;IACxC,UAAU,MAAM,cAAc,IAAI,CAAC,aAAa,EAAE,IAAI,QAAQ,IAAI,OAAO,QAAQ,OAAO,QAAQ,QAAQ,OAAM,EAAG;IACjH,UAAU,MAAM;;AAEpB;AAKA,SAAS,2BACP,OACA,gBACA,KACA,oBAA2B;AAE3B,QAAM,OAAO,MAAM;AACnB,QAAM,UAAoB,CAAA;AAC1B,QAAM,mBAAmB,qBAAqB,eAAe,cAAc;AAC3E,UAAQ,KACN,2BAA2B,KAAK,QAAQ,cAAc,MAAM,mBACxD,wCACA,yBAAyB;AAE/B,MAAI,oBAAoB;AACtB,YAAQ,KAAK,gDAA2C;EAC1D;AACA,UAAQ,KAAK,aAAa,KAAK,QAAQ,GAAG,KAAK,aAAa,IAAI,eAAe,EAAE,EAAE;AACnF,MAAI,OAAO,KAAK,aAAa,YAAY,KAAK,SAAS,KAAI,EAAG,SAAS,GAAG;AACxE,YAAQ,KAAK,iBAAiB,KAAK,UAAU,GAAG,CAAC;EACnD;AACA,UAAQ,KAAK,oBAAoB,IAAI,EAAE,SAAS,IAAI,0BAA0B,aAAa;AAC3F,MAAI,OAAO,KAAK,WAAW,YAAY,KAAK,OAAO,KAAI,EAAG,SAAS,GAAG;AACpE,YAAQ,KAAK,YAAY,KAAK,OAAO,KAAI,CAAE,EAAE;EAC/C;AACA,MAAI,MAAM,SAAS,SAAS,GAAG;AAC7B,YAAQ,KAAK,YAAY,MAAM,SAAS,MAAM,aAAa,MAAM,SAAS,KAAK,IAAI,CAAC,EAAE;EACxF;AACA,SAAO;AACT;AAOA,SAAS,iBAAiB,UAAkB,KAAW;AACrD,QAAM,aAAa,KAAK,MAAM,QAAQ;AAEtC,MAAI,CAAC,OAAO,SAAS,UAAU,GAAG;AAChC,WAAO,YAAY,SAAS,KAAI,CAAE;EACpC;AAEA,QAAM,YAAY,IAAI,KAAK,UAAU,EAAE,YAAW,EAAG,MAAM,GAAG,EAAE;AAChE,QAAM,WAAW,IAAI,KAAK,KAAK,MAAM,GAAG,CAAC,EAAE,YAAW,EAAG,MAAM,GAAG,EAAE;AACpE,QAAM,OAAO,KAAK,OAAO,KAAK,MAAM,SAAS,IAAI,KAAK,MAAM,QAAQ,KAAK,UAAU;AACnF,MAAI,OAAO;AAAG,WAAO,YAAY,SAAS,aAAa,CAAC,IAAI;AAC5D,MAAI,SAAS;AAAG,WAAO,YAAY,SAAS;AAC5C,SAAO,YAAY,SAAS,QAAQ,IAAI;AAC1C;AAEA,SAAS,qBAAqB,OAA6B,gBAAqC;AAC9F,QAAM,mBAAmB,qBAAqB,eAAe,cAAc;AAC3E,SAAO,MAAM,OAAO,CAAC,SAAS,2BAA2B,KAAK,QAAQ,cAAc,MAAM,gBAAgB,EAAE;AAC9G;AAKA,SAAS,wBAAwB,MAAuB,kBAAgD;AACtG,UAAQ,iBAAiB,IAAI,KAAK,GAAG,KAAI,EAAG,YAAW,CAAE,KAAK,CAAA,GAAI,SAAS;AAC7E;AAIA,SAAS,gBAAgB,SAAsB,OAA2B;AACxE,SAAO;IACL,MAAM,QAAQ;IACd,KAAK,QAAQ;IACb,UAAU,QAAQ;IAClB,UAAU,QAAQ;IAClB,gBAAgB,QAAQ;IACxB,QAAQ,QAAQ;IAChB,SAAS,QAAQ;IACjB,YAAY;IACZ,GAAG;;AAEP;AAEA,SAAS,qBACP,OACA,kBACA,gBAAqC;AAErC,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,MAAM,UAAS;AACrC,UAAM,yBAAyB,wBAAwB,KAAK,MAAM,gBAAgB;AAClF,UAAM,0BAA0B,wBAAwB,MAAM,MAAM,gBAAgB;AACpF,QAAI,2BAA2B,yBAAyB;AACtD,aAAO,OAAO,sBAAsB,IAAI,OAAO,uBAAuB;IACxE;AACA,WAAO,qBAAqB,KAAK,MAAM,MAAM,MAAM,cAAc;EACnE,CAAC;AACH;AAEA,SAAS,wBAAwB,QAMhC;AACC,MAAI,OAAO,eAAe,WAAW,GAAG;AACtC,WAAO;EACT;AACA,SAAO;IACL,GAAG,OAAO,UAAU,CAAC;IACrB,SAAS,2BACP,OAAO,eAAe,CAAC,GACvB,OAAO,gBACP,OAAO,KACP,OAAO,kBAAkB;;AAG/B;AAEA,SAAS,qBAAqB,aAAwC,aAAiC;AACrG,MAAI,gBAAgB,MAAM;AACxB,WAAO;EACT;AACA,MAAI,YAAY,SAAS,GAAG;AAC1B,WAAO;MACL,GAAG,YAAY,MAAM,wDAAwD,YAAY,CAAC,EAAE,SACzF,IAAI,CAAC,YAAY,QAAQ,EAAE,EAC3B,KAAK,IAAI,CAAC;MACb;MACA;;EAEJ;AACA,SAAO;IACL;IACA;IACA;;AAEJ;AAEA,SAAS,8BACP,YACA,QACA,aAAmB;AAEnB,MAAI,CAAC,aAAa;AAChB,WAAO;EACT;AACA,QAAM,UAAU,kBAAkB,QAAQ,WAAW;AACrD,MAAI,CAAC,QAAQ,OAAO;AAClB,UAAM,IAAI,WAAW,iCAAiC,WAAW,IAAI,UAAU,SAAS;EAC1F;AACA,SAAO,WAAW,OAAO,CAAC,SAAS,QAAQ,IAAI,IAAI,KAAK,GAAG,KAAI,EAAG,YAAW,CAAE,CAAC;AAClF;AAMA,eAAsB,QAAQ,SAAsB,QAAqB;AACvE,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAI,OAAO,IAAI;AACvD,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,iBAAiB,6BAA6B,SAAS,MAAM;AACnE,QAAM,MAAM,OAAM;AAClB,QAAM,QAAQ,eAAe,QAAQ,OAAO,WAAW,kBAAkB;AACzE,QAAM,eAAe,eAAe,QAAQ,cAAc,mBAAmB,KAAK;AAClF,QAAM,YAAY,QAAQ,cAAc;AACxC,QAAM,cAAc,OAAO,QAAQ,WAAW,WAAW,QAAQ,OAAO,KAAI,IAAK;AAOjF,QAAM,iBAAiB,MAAM,QAAQ,QAAW,gBAAgB,SAAS,EAAE,iBAAiB,KAAI,CAAE,GAAG,MAAM;AAC3G,QAAM,aAAa,MAAM,QAAQ,QAAW,EAAE,iBAAiB,OAAO,YAAY,KAAI,GAAI,MAAM;AAChG,QAAM,aAAa,8BAA8B,eAAe,OAA4B,WAAW,OAA4B,WAAW;AAC9I,QAAM,SAAS,WAAW;AAE1B,QAAM,SAAS,2BAA2B,YAAY,QAAQ,cAAc;AAC5E,QAAM,mBAAmB,sBAAsB,MAAM;AACrD,QAAM,cAAc,qBAAqB,OAAO,OAAO,kBAAkB,cAAc;AACvF,QAAM,gBAAgB,CAAC,GAAG,OAAO,OAAO,EAAE,KAAK,CAAC,MAAM,UACpD,qBAAqB,KAAK,MAAM,MAAM,MAAM,cAAc,CAAC;AAE7D,QAAM,gBAAgB,YAAY,OAAO,CAAC,UAAU,CAAC,wBAAwB,MAAM,MAAM,gBAAgB,CAAC;AAC1G,QAAM,iBAAiB,cAAc,SAAS,IAAI,gBAAgB;AAElE,QAAM,YAAY,eAAe,IAAI,CAAC,UAAU,qBAAqB,OAAO,gBAAgB,gBAAgB,CAAC;AAC7G,QAAM,cAAc,cAAc,IAAI,CAAC,UAAU,qBAAqB,OAAO,gBAAgB,gBAAgB,CAAC;AAE9G,QAAM,cAAc,wBAAwB;IAC1C;IACA;IACA;IACA;IACA,oBAAoB,cAAc,WAAW;GAC9C;AAED,QAAM,SAAqB;IACzB,gBAAgB;IAChB;IACA;IACA,OAAO,UAAU,MAAM,GAAG,KAAK;IAC/B,SAAS,YAAY,CAAA,IAAK,YAAY,MAAM,GAAG,YAAY;IAC3D,SAAS;MACP,aAAa,gBAAgB;MAC7B,OAAO,UAAU;MACjB,SAAS,YAAY;MACrB,aAAa,qBAAqB,WAAW,cAAc;MAC3D,YAAY,OAAO;MACnB,YAAY,OAAO;;IAErB,SAAS;MACP,MAAM,QAAQ,QAAQ;MACtB,KAAK,QAAQ,OAAO;MACpB,UAAU,QAAQ,YAAY;MAC9B,UAAU,QAAQ,YAAY;MAC9B,iBAAiB,QAAQ,kBAAkB;MAC3C,QAAQ,QAAQ,UAAU;MAC1B,SAAS,QAAQ,WAAW;MAC5B,QAAQ,YAAY,SAAS,IAAI,cAAc;MAC/C;MACA,eAAe;MACf,YAAY;;;AAIhB,QAAM,WAAW,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAI,eAAe,YAAY,CAAA,GAAK,GAAI,WAAW,YAAY,CAAA,CAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,MAC3G,EAAE,cAAc,CAAC,CAAC;AAEpB,MAAI,SAAS,SAAS;AAAG,WAAO,WAAW;AAE3C,SAAO,cAAc,qBAAqB,aAAa,WAAW;AAElE,SAAO;AACT;AAOM,SAAU,mBAAmB,QAAkB;AACnD,QAAM,QAAkB,CAAC,aAAa,EAAE;AACxC,QAAM,KAAK,UAAU,OAAO,GAAG,EAAE;AACjC,QAAM,KACJ,YAAY,OAAO,QAAQ,KAAK,kBAAkB,OAAO,QAAQ,WAAW,eAAe,OAAO,QAAQ,OAAO,iBAAiB,OAAO,QAAQ,UAAU,EAAE;AAE/J,MAAI,OAAO,QAAQ,QAAQ;AACzB,UAAM,KAAK,uBAAuB,OAAO,QAAQ,MAAM,EAAE;EAC3D;AACA,QAAM,KAAK,EAAE;AAEb,QAAM,KAAK,gBAAgB;AAC3B,MAAI,OAAO,aAAa;AACtB,UAAM,KAAK,KAAK,eAAe,OAAO,WAAW,CAAC,EAAE;AACpD,UAAM,KAAK,UAAU,OAAO,YAAY,QAAQ,KAAK,IAAI,CAAC,EAAE;EAC9D,OAAO;AACL,UAAM,KAAK,gBAAgB;EAC7B;AACA,QAAM,KAAK,EAAE;AAEb,QAAM,KAAK,UAAU;AACrB,MAAI,OAAO,MAAM,WAAW,GAAG;AAC7B,UAAM,KAAK,iBAAiB;EAC9B,OAAO;AACL,eAAW,QAAQ,OAAO,OAAO;AAC/B,YAAM,KAAK,KAAK,eAAe,IAAI,CAAC,EAAE;IACxC;EACF;AACA,QAAM,KAAK,EAAE;AAEb,MAAI,CAAC,OAAO,QAAQ,YAAY;AAC9B,UAAM,KAAK,YAAY;AACvB,QAAI,OAAO,QAAQ,WAAW,GAAG;AAC/B,YAAM,KAAK,mBAAmB;IAChC,OAAO;AACL,iBAAW,QAAQ,OAAO,SAAS;AACjC,cAAM,KAAK,KAAK,SACb,IAAI,CAAC,YAAY,GAAG,QAAQ,EAAE,IAAI,QAAQ,UAAU,GAAG,GAAG,EAC1D,KAAK,IAAI;AACZ,cAAM,KAAK,KAAK,eAAe,IAAI,CAAC,eAAe,EAAE,EAAE;MACzD;IACF;AACA,UAAM,KAAK,EAAE;EACf;AAEA,MAAI,OAAO,eAAe,OAAO,YAAY,SAAS,GAAG;AACvD,UAAM,KAAK,gBAAgB;AAC3B,eAAW,cAAc,OAAO,aAAa;AAC3C,YAAM,KAAK,KAAK,UAAU,EAAE;IAC9B;EACF;AAEA,SAAO,MAAM,KAAK,IAAI,EAAE,QAAO;AACjC;AAIA,SAAS,eAAe,MAAwB;AAC9C,QAAM,gBAAgB,KAAK,YAAY;AACvC,QAAM,cAAc,KAAK,SAAS,WAAW,KAAK,MAAM,KAAK;AAC7D,QAAM,gBAAgB,KAAK,SAAS,SAAS,IAAI,aAAa,KAAK,SAAS,MAAM,KAAK;AACvF,SAAO,GAAG,KAAK,EAAE,KAAK,KAAK,QAAQ,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,aAAa,aAAa,GAAG,WAAW,GAAG,aAAa,IAAI,KAAK,KAAK;AACvI","debugId":"aeca411c-81f3-59f5-a9aa-aec1f3098c77"}