@remnic/core 9.69.55 → 9.69.57

package/dist/chunk-K4KE5MYE.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/orchestration/orchestrator-helpers.ts"],"sourcesContent":["/**\n * Orchestrator module-level helpers — relocated from orchestrator.ts\n * (issue #1526, seam 25).\n *\n * Pure functions, types, and constants that previously lived at module\n * level in orchestrator.ts: recall-mode planning, recall snapshots and\n * parsers, abort/race helpers, artifact recall limits, replay\n * source-time slicing, day-summary date utilities, and QMD startup\n * checks. orchestrator.ts re-exports the previously-public names so\n * every existing importer (coordinators, tests, root shims) keeps\n * working unchanged.\n *\n * Behavior-preserving move — no logic changes.\n */\n\nimport { createHash } from \"node:crypto\";\nimport os from \"node:os\";\nimport path from \"node:path\";\nimport { abortError as sharedAbortError, throwIfAborted as sharedThrowIfAborted } from \"../abort-error.js\";\nimport type { CapabilitySet } from \"../capabilities.js\";\nimport { buildCompressionGuidelinesMarkdown as buildCompressionGuidelinesMarkdownV2 } from \"../compression-optimizer.js\";\nimport { FallbackLlmClient } from \"../fallback-llm.js\";\nimport { hasBroadGraphIntent, planRecallMode } from \"../intent.js\";\nimport { resolveLifecycleState } from \"../lifecycle.js\";\nimport { log } from \"../logger.js\";\nimport type { GraphRecallRankedResult, GraphRecallShadowComparison } from \"./graph-recall-coordinator.js\";\nimport { parseQmdExplain } from \"../qmd.js\";\nimport type { GraphRecallExpandedEntry } from \"../recall-state.js\";\nimport type { RecallXrayServedBy } from \"../recall-xray.js\";\nimport type { RecallContextComposition } from \"../recall-context-composition.js\";\nimport { type BufferTurn, type MemoryActionEvent, type MemoryFile, type MemoryFrontmatter, type MemoryIntent, type PluginConfig, type QmdSearchResult, type RecallPlanMode, confidenceTier } from \"../types.js\";\nimport { categoryDirName } from \"../utils/category-dir.js\";\nimport { parseFlexibleIsoTimestamp } from \"../utils/iso-timestamp.js\";\n\n/** Freshness window for the artifact source status cache read by NamespaceReadFanoutCoordinator. */\nexport const ARTIFACT_STATUS_CACHE_TTL_MS = 60_000;\nexport interface BulkImportBatchIngestResult {\n  attemptedTurnCount: number;\n  extractionCount: number;\n  persistedCount: number;\n  durableOutputCount: number;\n  skippedCount: number;\n  failedCount: number;\n  postPersistMetadataFailureCount: number;\n  processedTurnCount: number;\n}\n\nexport class BulkImportBatchPartialFailureError extends Error {\n  readonly partialResult: BulkImportBatchIngestResult;\n\n  readonly originalError: unknown;\n\n  constructor(\n    message: string,\n    partialResult: BulkImportBatchIngestResult,\n    originalError: unknown,\n  ) {\n    super(message);\n    this.name = \"BulkImportBatchPartialFailureError\";\n    this.partialResult = partialResult;\n    this.originalError = originalError;\n  }\n}\n\nexport interface GraphRecallSnapshot {\n  recordedAt: string;\n  mode: RecallPlanMode | string;\n  queryHash: string;\n  queryLength: number;\n  namespaces: string[];\n  seedCount: number;\n  expandedCount: number;\n  seeds: string[];\n  expanded: GraphRecallExpandedEntry[];\n  status?: \"completed\" | \"skipped\" | \"aborted\";\n  reason?: string;\n  shadowMode?: boolean;\n  queryIntent?: MemoryIntent;\n  seedResults?: GraphRecallRankedResult[];\n  finalResults?: GraphRecallRankedResult[];\n  shadowComparison?: GraphRecallShadowComparison;\n}\n\nexport interface IntentDebugSnapshot {\n  recordedAt: string;\n  promptHash: string;\n  promptLength: number;\n  retrievalQueryHash: string;\n  retrievalQueryLength: number;\n  plannerEnabled: boolean;\n  plannedMode: RecallPlanMode;\n  effectiveMode: RecallPlanMode;\n  recallResultLimit: number;\n  queryIntent: MemoryIntent;\n  graphExpandedIntentDetected: boolean;\n  graphDecision: {\n    status: \"not_requested\" | \"skipped\" | \"completed\" | \"aborted\";\n    reason?: string;\n    shadowMode: boolean;\n    qmdAvailable: boolean;\n    graphRecallEnabled: boolean;\n    multiGraphMemoryEnabled: boolean;\n  };\n}\n\nexport interface QmdRecallSnapshot {\n  recordedAt: string;\n  queryHash: string;\n  queryLength: number;\n  collection?: string;\n  namespaces: string[];\n  fetchLimit: number;\n  primaryResultCount: number;\n  hybridResultCount: number;\n  queryAwareSeedCount: number;\n  resultCount: number;\n  intentHint?: string;\n  explainEnabled: boolean;\n  hybridTopUpUsed: boolean;\n  hybridTopUpSkippedReason?: string;\n  results: QmdSearchResult[];\n}\n\nexport interface RecallModeDecision {\n  plannedMode: RecallPlanMode;\n  effectiveMode: RecallPlanMode;\n  graphExpandedIntentDetected: boolean;\n  graphReason?: string;\n  /**\n   * Where `plannedMode` came from (issue #1367 / Option C). `\"heuristic\"` for\n   * the regex planner; `\"llm\"` when the LLM planner classified it; and\n   * `\"heuristic-fallback\"` when the LLM was enabled but errored/timed out and we\n   * fell back. Absent on the synchronous heuristic-only path.\n   */\n  plannerSource?: \"heuristic\" | \"llm\" | \"heuristic-fallback\";\n  /** Short rationale from the planner (for telemetry / x-ray). */\n  plannerReason?: string;\n  /** Wall-clock spent in the LLM planner call, when one was made. */\n  plannerLatencyMs?: number;\n  /** True when the LLM planner was enabled but fell back to the heuristic. */\n  plannerFallbackUsed?: boolean;\n  /** Model that served the LLM classification, when one was used. */\n  plannerModelUsed?: string;\n  /**\n   * The regex-heuristic baseline mode, captured whenever the LLM planner ran\n   * (any source). Lets operators compare planned-vs-heuristic during rollout —\n   * distinct from `plannedMode`, which on the LLM path is the LLM's choice.\n   */\n  plannerHeuristicMode?: RecallPlanMode;\n  /**\n   * In shadow mode, the mode the LLM *would* have chosen (recorded for\n   * comparison) while `effectiveMode` stays on the heuristic decision.\n   */\n  shadowLlmMode?: RecallPlanMode;\n}\n\n/**\n * Map the orchestrator's internal `recallSource` strings to the\n * X-ray `servedBy` vocabulary (issue #570 PR 1).  The X-ray tier\n * ladder intentionally flattens QMD / embedding / cold-fallback to\n * the `hybrid` tier because they all materialize through the same\n * hybrid BM25+vector pipeline from the caller's perspective.  The\n * `recent_scan` path gets its own dedicated tier because it bypasses\n * the hybrid pipeline entirely.  `none` is treated as `hybrid` on the\n * theory that a query that returned nothing still routed through the\n * hybrid pipeline — but callers should normally gate capture on\n * `recalledMemoryIds.length > 0`.\n */\nexport function mapRecallSourceToXrayServedBy(\n  source:\n    | \"none\"\n    | \"hot_qmd\"\n    | \"hot_embedding\"\n    | \"cold_fallback\"\n    | \"recent_scan\",\n): RecallXrayServedBy {\n  // Exhaustive switch: every current union member is explicitly\n  // listed so TypeScript surfaces a compile error if a new source is\n  // added without a deliberate mapping.  The `never`-typed fallthrough\n  // keeps the function total at runtime — if the caller passes an\n  // unexpected value that slipped past the type system (e.g. a JSON\n  // deserialization), we still fall back to `hybrid`.\n  switch (source) {\n    case \"recent_scan\":\n      return \"recent-scan\";\n    case \"hot_qmd\":\n    case \"hot_embedding\":\n    case \"cold_fallback\":\n    case \"none\":\n      return \"hybrid\";\n  }\n  const _exhaustive: never = source;\n  void _exhaustive;\n  return \"hybrid\";\n}\n\nexport interface RecallInvocationOptions {\n  namespace?: string;\n  topK?: number;\n  mode?: RecallPlanMode;\n  abortSignal?: AbortSignal;\n  /** Server-resolved identity of the connector performing this recall. */\n  sourceConnector?: string;\n  /**\n   * Capture a `RecallXraySnapshot` for this recall (issue #570).  When\n   * `true`, the orchestrator builds a snapshot from the data it has\n   * already gathered and stashes it in memory, accessible via\n   * `getLastXraySnapshot()`.  When `false` or absent, nothing is\n   * captured and recall behavior is unchanged (schema-only slice).\n   */\n  xrayCapture?: boolean;\n  /**\n   * Per-invocation override for `recallBudgetChars` (issue #570 PR 3/4).\n   * Flows through `getRecallBudgetChars()` for this recall only — no\n   * shared config mutation, so concurrent recalls on the same\n   * orchestrator are not affected (CLAUDE.md rule 47: no shared\n   * mutable state across async boundaries).  Must be a non-negative\n   * finite integer; non-conforming values are ignored and the\n   * configured budget is used.\n   */\n  budgetCharsOverride?: number;\n  /**\n   * Per-invocation principal override (issue #570 PR 4).  When set,\n   * the orchestrator uses this principal for ACL / namespace checks\n   * instead of `resolvePrincipal(sessionKey, config)`.  This is the\n   * escape hatch for access surfaces (HTTP / MCP) that have already\n   * authenticated the caller upstream — threading an unmapped\n   * principal through the session-key-based resolver would otherwise\n   * collapse it to `\"default\"` and produce false denials in\n   * namespace-enabled deployments (CLAUDE.md rule 42).\n   */\n  principalOverride?: string;\n  /**\n   * Historical recall point (issue #680).  When set, the orchestrator\n   * filters out memories whose `valid_at` is after this timestamp OR\n   * whose `invalid_at` is at-or-before this timestamp, so callers see\n   * the corpus as it existed at `asOf`.  ISO 8601 string; comparisons\n   * use `Date.parse()` so timezone-aware values round-trip correctly\n   * (CLAUDE.md gotcha — never compare ISO strings lexicographically).\n   * Invalid values must be rejected at input boundaries (CLAUDE.md\n   * rule 51); the orchestrator does NOT silently fall back here.\n   */\n  asOf?: string;\n  /**\n   * Issue #681 — when `true`, bypasses `graphTraversalConfidenceFloor`\n   * and includes edges below the floor in graph traversal.  Useful for\n   * diagnostic recall queries that need to surface results that would\n   * normally be pruned by confidence decay.  Default `false`.\n   */\n  includeLowConfidence?: boolean;\n  /**\n   * #1952 — per-call override enabling state-aware recall views for this\n   * recall only (MCP `stateView` boolean). ORs with the `recallStateViews`\n   * config flag; a change-intent query is still required for any effect.\n   */\n  stateView?: boolean;\n  /**\n   * User-aware context scopes active for this recall. Used by X-ray\n   * provenance safety checks so boundary-scoped memories are evaluated\n   * against the caller's real context.\n   */\n  currentContextScopes?: readonly unknown[];\n  /**\n   * Wall-clock ms the caller waited to begin execution — per-principal\n   * semaphore queue + single-flight wait (issue #1906). Folded into\n   * recall-timings additively as `queueWaitMs`; omitted phases are simply\n   * absent, so existing timing consumers are unaffected.\n   */\n  queueWaitMs?: number;\n  onContextComposition?: (composition: RecallContextComposition) => void | PromiseLike<void>;\n}\n\nexport type QueryAwarePrefilter = {\n  candidatePaths: Set<string> | null;\n  temporalFromDate: string | null;\n  matchedTags: string[];\n  expandedTags: string[];\n  combination: \"none\" | \"temporal\" | \"tag\" | \"intersection\" | \"union\";\n  filteredToFullSearch: boolean;\n};\n\n// Recall-specific abort helpers.  Thin wrappers over the shared\n// `abort-error.ts` module so every abort in the codebase shares the\n// same `name === \"AbortError\"` classification contract (`isAbortError`\n// works uniformly).  We keep the \"recall aborted\" default message for\n// back-compat with call-site logs; callers that pass an explicit\n// message (e.g. \"extraction aborted (before_extract)\") are unaffected.\nexport const abortRecallError = sharedAbortError;\n\nexport function throwIfRecallAborted(\n  signal?: AbortSignal,\n  message = \"recall aborted\",\n): void {\n  sharedThrowIfAborted(signal, message);\n}\n\nexport async function raceRecallAbort<T>(\n  promise: Promise<T>,\n  signal?: AbortSignal,\n  message = \"recall aborted\",\n): Promise<T> {\n  throwIfRecallAborted(signal, message);\n  if (!signal) return promise;\n\n  let onAbort: (() => void) | null = null;\n  const abortPromise = new Promise<T>((_resolve, reject) => {\n    onAbort = () => reject(abortRecallError(message));\n    signal.addEventListener(\"abort\", onAbort, { once: true });\n  });\n\n  try {\n    return await Promise.race([promise, abortPromise]);\n  } finally {\n    if (onAbort) {\n      signal.removeEventListener(\"abort\", onAbort);\n    }\n  }\n}\n\n/** Maximum age (ms) before a compaction-reset signal file is considered stale and removed. */\nexport const COMPACTION_SIGNAL_MAX_AGE_MS = 60 * 60 * 1000; // 1 hour\n\nexport const DEFAULT_QMD_STARTUP_COLLECTION_CHECK_TIMEOUT_MS = 10_000;\n\nexport type DaySummaryGatherOptions = {\n  timeZone?: string;\n  now?: Date;\n  /** Opt-in location context (issue #2925); false/absent keeps output byte-identical. */\n  includeLocation?: boolean;\n};\n\nexport function normalizeIanaTimeZone(value: unknown): string | undefined {\n  if (typeof value !== \"string\") return undefined;\n  const trimmed = value.trim();\n  if (!trimmed) return undefined;\n  try {\n    Intl.DateTimeFormat(undefined, { timeZone: trimmed });\n    return trimmed;\n  } catch {\n    return undefined;\n  }\n}\n\nexport function formatDateInTimeZone(date: Date, timeZone: string): string {\n  const parts = new Intl.DateTimeFormat(\"en-US\", {\n    timeZone,\n    year: \"numeric\",\n    month: \"2-digit\",\n    day: \"2-digit\",\n  }).formatToParts(date);\n  const get = (type: string): string => parts.find((part) => part.type === type)?.value ?? \"\";\n  return `${get(\"year\")}-${get(\"month\")}-${get(\"day\")}`;\n}\n\nexport function utcDateKey(date: Date): string {\n  return date.toISOString().slice(0, 10);\n}\n\nexport function utcDateKeysAround(date: Date): string[] {\n  const dayMs = 86_400_000;\n  const keys = [\n    utcDateKey(new Date(date.getTime() - dayMs)),\n    utcDateKey(date),\n    utcDateKey(new Date(date.getTime() + dayMs)),\n  ];\n  return keys.filter((value, index, array) => array.indexOf(value) === index);\n}\n\nexport function utcDateKeysForLocalDay(date: Date, timeZone: string): string[] {\n  const targetLocalDate = formatDateInTimeZone(date, timeZone);\n  const keys = new Set<string>();\n  const hourMs = 3_600_000;\n  const scanStart = date.getTime() - 48 * hourMs;\n  const scanEnd = date.getTime() + 48 * hourMs;\n  for (let ms = scanStart; ms <= scanEnd; ms += hourMs) {\n    const candidate = new Date(ms);\n    if (formatDateInTimeZone(candidate, timeZone) === targetLocalDate) {\n      keys.add(utcDateKey(candidate));\n    }\n  }\n  return keys.size > 0 ? [...keys].sort() : utcDateKeysAround(date);\n}\n\nexport function parseFiniteDate(value: unknown): Date | null {\n  if (typeof value !== \"string\" || value.trim().length === 0) return null;\n  const parsed = new Date(value);\n  return Number.isFinite(parsed.getTime()) ? parsed : null;\n}\n\nexport function filterHourlySummaryMarkdownForLocalDay(\n  raw: string,\n  utcDate: string,\n  timeZone: string,\n  targetLocalDate: string,\n): string | null {\n  const hourHeaderPattern = /^## ([01]\\d|2[0-3]):00[ \\t]*$/gm;\n  const matches = Array.from(raw.matchAll(hourHeaderPattern));\n  if (matches.length === 0) return null;\n\n  const firstSectionStart = matches[0]?.index ?? 0;\n  const preamble = raw.slice(0, firstSectionStart).trim();\n  const sections: string[] = [];\n  for (let index = 0; index < matches.length; index += 1) {\n    const match = matches[index];\n    const hour = match[1];\n    if (!hour) continue;\n    const sectionTimestamp = parseFiniteDate(`${utcDate}T${hour}:00:00.000Z`);\n    if (\n      !sectionTimestamp ||\n      formatDateInTimeZone(sectionTimestamp, timeZone) !== targetLocalDate\n    ) {\n      continue;\n    }\n    const sectionStart = match.index ?? 0;\n    const sectionEnd = matches[index + 1]?.index ?? raw.length;\n    const section = raw.slice(sectionStart, sectionEnd).trim();\n    if (section.length > 0) sections.push(section);\n  }\n\n  if (sections.length === 0) return null;\n  return [preamble, ...sections]\n    .filter((section) => section.length > 0)\n    .join(\"\\n\\n\");\n}\n\nexport type SearchCollectionState = \"present\" | \"missing\" | \"unknown\" | \"skipped\";\n\nexport function qmdStartupCollectionCheckTimeoutMs(): number {\n  const raw =\n    process.env.REMNIC_QMD_STARTUP_COLLECTION_CHECK_TIMEOUT_MS ??\n    process.env.ENGRAM_QMD_STARTUP_COLLECTION_CHECK_TIMEOUT_MS;\n  if (raw === undefined) return DEFAULT_QMD_STARTUP_COLLECTION_CHECK_TIMEOUT_MS;\n  const parsed = Number(raw);\n  return Number.isFinite(parsed) && parsed >= 1_000\n    ? Math.floor(parsed)\n    : DEFAULT_QMD_STARTUP_COLLECTION_CHECK_TIMEOUT_MS;\n}\n\nexport async function qmdStartupCollectionCheckWithTimeout(\n  promise: Promise<SearchCollectionState>,\n  controller: AbortController,\n  label: string,\n): Promise<SearchCollectionState> {\n  const timeoutMs = qmdStartupCollectionCheckTimeoutMs();\n  let timer: NodeJS.Timeout | undefined;\n  let settled = false;\n\n  const timeoutPromise = new Promise<SearchCollectionState>((resolve) => {\n    timer = setTimeout(() => {\n      if (settled) return;\n      controller.abort();\n      log.warn(\n        `QMD startup collection check for ${label} timed out after ${timeoutMs}ms; keeping search enabled fail-open`,\n      );\n      resolve(\"unknown\");\n    }, timeoutMs);\n    timer.unref?.();\n  });\n\n  const checkedPromise = promise\n    .catch((err): SearchCollectionState => {\n      log.warn(\n        `QMD startup collection check for ${label} failed; keeping search enabled fail-open: ${err}`,\n      );\n      return \"unknown\";\n    })\n    .finally(() => {\n      settled = true;\n      if (timer) clearTimeout(timer);\n    });\n\n  return await Promise.race([checkedPromise, timeoutPromise]);\n}\n\n/** Default workspace directory when no per-agent or config workspace is available. */\nexport function defaultWorkspaceDir(): string {\n  return path.join(os.homedir(), \".openclaw\", \"workspace\");\n}\n\n/**\n * Produce a collision-resistant, filesystem-safe identifier from a session key.\n *\n * Session keys follow colon-delimited forms (e.g., `agent:gpucodebot:main`).\n * A naive replace (`:` → `_`) is lossy: different keys like `agent:alpha` and\n * `agent/alpha` would collide. Instead we append a short SHA-256 hash of the\n * original key to the human-readable sanitized prefix, guaranteeing uniqueness\n * while keeping filenames debuggable.\n *\n * Format: `<sanitized>-<12-char-hex-hash>`\n * Example: `agent:gpucodebot:main` → `agent_gpucodebot_main-a1b2c3d4e5f6`\n */\nexport function sanitizeSessionKeyForFilename(sessionKey: string): string {\n  const readable = sessionKey.replace(/[^a-zA-Z0-9._-]/g, \"_\");\n  const hash = createHash(\"sha256\")\n    .update(sessionKey)\n    .digest(\"hex\")\n    .slice(0, 12);\n  return `${readable}-${hash}`;\n}\n\nexport function sourceValidAtMs(turn: BufferTurn): number | null {\n  if (typeof turn.sourceValidAt !== \"string\") return null;\n  return parseFlexibleIsoTimestamp(turn.sourceValidAt.trim());\n}\n\nexport const SOURCE_VALID_AT_CONTEXT_TURNS = 2;\n\nexport function sourceValidAtSliceKey(turn: BufferTurn, index: number): string {\n  const validAtMs = sourceValidAtMs(turn);\n  return validAtMs === null ? `unknown:${index}` : String(validAtMs);\n}\n\nexport function asExtractionContextTurn(turn: BufferTurn): BufferTurn {\n  return { ...turn, extractionContextOnly: true };\n}\n\nexport function asExtractionTargetTurn(turn: BufferTurn): BufferTurn {\n  const { extractionContextOnly: _contextOnly, ...targetTurn } = turn;\n  return targetTurn;\n}\n\nexport function sourceValidAtContextTurns(\n  turns: readonly BufferTurn[],\n  targetStart: number,\n  targetEnd: number,\n  targetValidAtMs: number | null,\n): BufferTurn[] {\n  if (targetValidAtMs === null) return [];\n  return turns\n    .flatMap((turn, index) => {\n      if (index >= targetStart && index < targetEnd) return [];\n      const contextValidAtMs = sourceValidAtMs(turn);\n      if (contextValidAtMs === null || contextValidAtMs > targetValidAtMs) {\n        return [];\n      }\n      return [{ turn, index, validAtMs: contextValidAtMs }];\n    })\n    .sort((a, b) => {\n      if (a.validAtMs < b.validAtMs) return -1;\n      if (a.validAtMs > b.validAtMs) return 1;\n      if (a.index === b.index) return 0;\n      return a.index < b.index ? -1 : 1;\n    })\n    .slice(-SOURCE_VALID_AT_CONTEXT_TURNS)\n    .map(({ turn }) => asExtractionContextTurn(turn));\n}\n\nexport function targetSourceValidAtSortMs(turns: readonly BufferTurn[]): number {\n  let latestMs: number | null = null;\n  for (const turn of turns) {\n    if (turn.extractionContextOnly === true) continue;\n    const validAtMs = sourceValidAtMs(turn);\n    if (validAtMs === null) continue;\n    if (latestMs === null || validAtMs > latestMs) {\n      latestMs = validAtMs;\n    }\n  }\n  return latestMs ?? Number.POSITIVE_INFINITY;\n}\n\nexport function sortSourceValidAtSlicesChronologically(\n  slices: BufferTurn[][],\n): BufferTurn[][] {\n  return slices\n    .map((turns, order) => ({\n      turns,\n      order,\n      targetValidAtMs: targetSourceValidAtSortMs(turns),\n    }))\n    .sort((a, b) => {\n      if (a.targetValidAtMs < b.targetValidAtMs) return -1;\n      if (a.targetValidAtMs > b.targetValidAtMs) return 1;\n      if (a.order === b.order) return 0;\n      return a.order < b.order ? -1 : 1;\n    })\n    .map((slice) => slice.turns);\n}\n\nexport function splitTurnsBySourceValidAt(\n  turns: readonly BufferTurn[],\n  options: { includeContext?: boolean } = {},\n): BufferTurn[][] {\n  if (turns.length === 0) return [];\n  if (!turns.some((turn) => sourceValidAtMs(turn) !== null)) {\n    return [[...turns]];\n  }\n\n  const slices: BufferTurn[][] = [];\n  let start = 0;\n  while (start < turns.length) {\n    const targetValidAtMs = sourceValidAtMs(turns[start]);\n    const activeKey = sourceValidAtSliceKey(turns[start], start);\n    let end = start + 1;\n    while (\n      end < turns.length &&\n      sourceValidAtSliceKey(turns[end], end) === activeKey\n    ) {\n      end += 1;\n    }\n\n    const contextTurns =\n      options.includeContext === false\n        ? []\n        : sourceValidAtContextTurns(turns, start, end, targetValidAtMs);\n    slices.push([\n      ...contextTurns,\n      ...turns.slice(start, end).map(asExtractionTargetTurn),\n    ]);\n    start = end;\n  }\n  return sortSourceValidAtSlicesChronologically(slices);\n}\n\nexport function isArtifactMemoryPath(filePath: string): boolean {\n  return /(?:^|[\\\\/])artifacts(?:[\\\\/]|$)/i.test(filePath);\n}\n\n/**\n * Meeting records (issue #1900) live at\n * `<root>/meetings/<YYYY-MM-DD>/mtg-<YYYY-MM-DD>-<hash>.md` — inside the QMD\n * collection root (full-text searchable) but NEVER surfaced through generic\n * recall, exactly like `artifacts/`. The predicate matches the FULL record\n * shape (anchored at the filename) rather than any `meetings` path segment, so\n * a namespaced deployment whose non-default namespace is literally named\n * `meetings` (`.../namespaces/meetings/facts/…`) keeps its ordinary memories in\n * recall — only true meeting records are excluded.\n */\nexport function isMeetingRecordPath(filePath: string): boolean {\n  return /(?:^|[\\\\/])meetings[\\\\/]\\d{4}-\\d{2}-\\d{2}[\\\\/]mtg-\\d{4}-\\d{2}-\\d{2}-[0-9a-f]{8}\\.md$/i.test(filePath);\n}\n\n/** Exactly `activity/<YYYY-MM-DD>.md`, at the top level of a memory root. */\nconst ACTIVITY_DIGEST_TOPLEVEL = /^activity[\\\\/]\\d{4}-\\d{2}-\\d{2}\\.md$/i;\n/** The digest FILE shape anywhere in a path (root-unaware best-effort). */\nconst ACTIVITY_DIGEST_ANYWHERE = /(?:^|[\\\\/])activity[\\\\/]\\d{4}-\\d{2}-\\d{2}\\.md$/i;\n\n/**\n * Activity day-digests live at `<memoryRoot>/activity/<YYYY-MM-DD>.md` — a\n * dedicated searchable surface (explicit activity search), never generic recall.\n * Captured screen text must not auto-inject into ordinary prompts (issue #1899).\n * Keyed on the path (parseFrontmatter drops the digest's `kind` marker).\n *\n * Root-aware: when `memoryRoot` is given, the path is resolved relative to it and\n * must be the TOP-LEVEL `activity/<date>.md`, so an ordinary memory nested under\n * a category (e.g. `facts/proj/activity/<date>.md`) stays recallable. Without a\n * root, falls back to the digest file shape anywhere (best-effort).\n */\nexport function isActivityDigestPath(filePath: string, memoryRoot?: string): boolean {\n  if (memoryRoot !== undefined && memoryRoot.length > 0) {\n    const relative = path.relative(memoryRoot, path.resolve(memoryRoot, filePath));\n    return ACTIVITY_DIGEST_TOPLEVEL.test(relative);\n  }\n  return ACTIVITY_DIGEST_ANYWHERE.test(filePath);\n}\n\n/** Exactly `locations/<YYYY-MM-DD>.md`, at the top level of a memory root. */\nconst LOCATION_DAY_TOPLEVEL = /^locations[\\\\/]\\d{4}-\\d{2}-\\d{2}\\.md$/i;\n/** The day-file shape anywhere in a path (root-unaware best-effort). */\nconst LOCATION_DAY_ANYWHERE = /(?:^|[\\\\/])locations[\\\\/]\\d{4}-\\d{2}-\\d{2}\\.md$/i;\n\n/**\n * Location day documents (issue #2044) live at\n * `<memoryRoot>/locations/<YYYY-MM-DD>.md` — a dedicated searchable surface,\n * never generic recall (place history must not auto-inject into ordinary\n * prompts). Root-aware exactly like `isActivityDigestPath`: with a root, only\n * the top-level `locations/<date>.md` matches, so an ordinary memory nested\n * under a category (e.g. `facts/locations-note.md`) stays recallable; without\n * a root, falls back to the day-file shape anywhere (best-effort).\n */\nexport function isLocationDayPath(filePath: string, memoryRoot?: string): boolean {\n  if (memoryRoot !== undefined && memoryRoot.length > 0) {\n    const relative = path.relative(memoryRoot, path.resolve(memoryRoot, filePath));\n    return LOCATION_DAY_TOPLEVEL.test(relative);\n  }\n  return LOCATION_DAY_ANYWHERE.test(filePath);\n}\n\nexport function buildCompressionGuidelinesMarkdown(\n  events: MemoryActionEvent[],\n  generatedAtIso: string = new Date().toISOString(),\n): string {\n  return buildCompressionGuidelinesMarkdownV2(events, generatedAtIso);\n}\n\n\nexport function applyQueryAwareCandidateFilter(\n  candidates: QmdSearchResult[],\n  candidatePaths: Set<string> | null,\n): QmdSearchResult[] {\n  if (!candidatePaths) return candidates;\n  if (candidatePaths.size === 0) return [];\n  const filtered = candidates.filter((candidate) =>\n    candidatePaths.has(candidate.path),\n  );\n  return filtered.length > 0 ? filtered : candidates;\n}\n\nexport function tokenizeRecallQuery(prompt: string): string[] {\n  return prompt\n    .toLowerCase()\n    .split(/[^a-z0-9]+/i)\n    .map((t) => t.trim())\n    .filter((t) => t.length >= 3);\n}\n\nexport function hasLifecycleMetadata(frontmatter: MemoryFrontmatter): boolean {\n  return (\n    frontmatter.lifecycleState !== undefined ||\n    frontmatter.verificationState !== undefined ||\n    frontmatter.policyClass !== undefined ||\n    frontmatter.lastValidatedAt !== undefined ||\n    frontmatter.decayScore !== undefined ||\n    frontmatter.heatScore !== undefined\n  );\n}\n\nexport function shouldFilterLifecycleRecallCandidate(\n  frontmatter: MemoryFrontmatter,\n  options: {\n    lifecyclePolicyEnabled: boolean;\n    lifecycleFilterStaleEnabled: boolean;\n  },\n): boolean {\n  if (!options.lifecyclePolicyEnabled || !options.lifecycleFilterStaleEnabled)\n    return false;\n  if (!hasLifecycleMetadata(frontmatter)) return false;\n  const lifecycleState = resolveLifecycleState(frontmatter);\n  return lifecycleState === \"stale\" || lifecycleState === \"archived\";\n}\n\nexport function lifecycleRecallScoreAdjustment(\n  frontmatter: MemoryFrontmatter,\n  options: {\n    lifecyclePolicyEnabled: boolean;\n  },\n): number {\n  if (!options.lifecyclePolicyEnabled) return 0;\n  if (!hasLifecycleMetadata(frontmatter)) return 0;\n\n  let delta = 0;\n  const lifecycleState = resolveLifecycleState(frontmatter);\n  switch (lifecycleState) {\n    case \"active\":\n      delta += 0.05;\n      break;\n    case \"validated\":\n      delta += 0.03;\n      break;\n    case \"candidate\":\n      delta -= 0.01;\n      break;\n    case \"stale\":\n      delta -= 0.06;\n      break;\n    case \"archived\":\n      delta -= 0.08;\n      break;\n  }\n  if (frontmatter.verificationState === \"disputed\") {\n    delta -= 0.12;\n  }\n  return delta;\n}\n\nexport function computeArtifactRecallLimit(\n  recallMode: RecallPlanMode,\n  recallResultLimit: number,\n  verbatimArtifactsMaxRecall: number,\n): number {\n  if (recallMode === \"no_recall\") return 0;\n  if (Math.max(0, recallResultLimit) === 0) return 0;\n  const base = Math.max(0, verbatimArtifactsMaxRecall);\n  if (recallMode === \"minimal\") {\n    return Math.min(base, Math.max(0, recallResultLimit));\n  }\n  return base;\n}\n\nexport function resolveEffectiveRecallMode(options: {\n  plannerEnabled: boolean;\n  graphRecallEnabled: boolean;\n  multiGraphMemoryEnabled: boolean;\n  graphExpandedIntentEnabled?: boolean;\n  prompt: string;\n}): RecallPlanMode {\n  return resolveRecallModeDecision(options).effectiveMode;\n}\n\nexport interface RecallModeGraphOptions {\n  plannerEnabled: boolean;\n  graphRecallEnabled: boolean;\n  multiGraphMemoryEnabled: boolean;\n  graphExpandedIntentEnabled?: boolean;\n  prompt: string;\n}\n\n/**\n * Apply the graph-mode overlay + gating to a planner-produced mode.\n *\n * Shared by the heuristic ({@link resolveRecallModeDecision}) and LLM\n * ({@link resolveRecallModeDecisionAsync}) paths so graph promotion and the\n * \"graph disabled → fall back to full\" gating behave identically regardless of\n * which planner produced `plannedModeRaw` (gotcha #39).\n */\nexport function finalizeRecallModeDecision(\n  plannedModeRaw: RecallPlanMode,\n  options: RecallModeGraphOptions,\n): RecallModeDecision {\n  let plannedMode: RecallPlanMode = plannedModeRaw;\n  const graphExpandedIntentDetected =\n    options.plannerEnabled &&\n    options.graphExpandedIntentEnabled === true &&\n    hasBroadGraphIntent(options.prompt);\n  if (plannedMode !== \"graph_mode\" && graphExpandedIntentDetected) {\n    plannedMode = \"graph_mode\";\n  }\n  if (\n    plannedMode === \"graph_mode\" &&\n    (!options.graphRecallEnabled || !options.multiGraphMemoryEnabled)\n  ) {\n    return {\n      plannedMode,\n      effectiveMode: \"full\",\n      graphExpandedIntentDetected,\n      graphReason: !options.graphRecallEnabled\n        ? \"graph recall disabled by config\"\n        : \"multi-graph memory disabled by config\",\n    };\n  }\n  return {\n    plannedMode,\n    effectiveMode: plannedMode,\n    graphExpandedIntentDetected,\n  };\n}\n\nexport function resolveRecallModeDecision(options: RecallModeGraphOptions): RecallModeDecision {\n  const plannedMode: RecallPlanMode = options.plannerEnabled\n    ? planRecallMode(options.prompt)\n    : \"full\";\n  return finalizeRecallModeDecision(plannedMode, options);\n}\n\n/**\n * Async recall-mode decision with optional LLM-based planning (issue #1367 /\n * Option C). Falls back to the heuristic decision when the LLM planner is\n * disabled, in shadow mode, or unavailable/failed — so this is always safe to\n * await on the recall hot path. Provider-agnostic: the LLM call routes through\n * the gateway/fallback chain.\n *\n * `recallPlannerEnabled === false` keeps the legacy \"always full\" behavior and\n * skips the LLM entirely (the planner as a whole is off).\n */\nexport async function resolveRecallModeDecisionAsync(\n  options: RecallModeGraphOptions & {\n    config: PluginConfig;\n    /**\n     * Recall-operation capability gates (issue #1523). REQUIRED: the recall\n     * orchestrator always passes a resolved set — the LLM planner gate reads\n     * `caps.recallPlannerLlm`, never re-derives from config.\n     */\n    caps: CapabilitySet;\n    hints?: string[];\n    llm?: FallbackLlmClient;\n    signal?: AbortSignal;\n  },\n): Promise<RecallModeDecision> {\n  const heuristicDecision = resolveRecallModeDecision(options);\n\n  // Planner globally off, or LLM planning not opted into → heuristic only.\n  // Read the resolved capability (issue #1523) — never re-derive from config.\n  const plannerLlmEnabled = options.caps.recallPlannerLlm;\n  if (!options.plannerEnabled || !plannerLlmEnabled) {\n    return heuristicDecision;\n  }\n\n  const { planRecallModeLLM } = await import(\"../recall-planner-llm.js\");\n  const planned = await planRecallModeLLM(\n    options.prompt,\n    options.hints,\n    options.config,\n    options.caps,\n    options.llm,\n    options.signal,\n  );\n\n  // Shadow mode: record what the LLM would have chosen but keep the heuristic\n  // effective decision (safe rollout / comparison — gotcha #30).\n  if (options.config.recallPlannerShadowMode) {\n    return {\n      ...heuristicDecision,\n      plannerSource: planned.source,\n      plannerReason: `shadow:${planned.reason}`,\n      plannerLatencyMs: planned.latencyMs,\n      plannerFallbackUsed: planned.fallbackUsed,\n      plannerModelUsed: planned.modelUsed,\n      plannerHeuristicMode: planned.heuristicMode,\n      shadowLlmMode: planned.mode,\n    };\n  }\n\n  const llmDecision = finalizeRecallModeDecision(planned.mode, options);\n  return {\n    ...llmDecision,\n    plannerSource: planned.source,\n    plannerReason: planned.reason,\n    plannerLatencyMs: planned.latencyMs,\n    plannerFallbackUsed: planned.fallbackUsed,\n    plannerModelUsed: planned.modelUsed,\n    plannerHeuristicMode: planned.heuristicMode,\n  };\n}\n\nexport function computeArtifactCandidateFetchLimit(\n  targetCount: number,\n): number {\n  const cappedTarget = Math.max(0, targetCount);\n  if (cappedTarget === 0) return 0;\n  const headroom = Math.max(8, cappedTarget * 4);\n  return Math.min(200, cappedTarget + headroom);\n}\n\nexport function computeQmdHybridFetchLimit(\n  recallFetchLimit: number,\n  artifactsEnabled: boolean,\n  maxArtifactRecall: number,\n): number {\n  const cappedRecallLimit = Math.max(0, recallFetchLimit);\n  if (cappedRecallLimit === 0) return 0;\n  if (!artifactsEnabled) return cappedRecallLimit;\n  // Overscan when artifacts are enabled, then filter artifact paths before\n  // re-applying the recall cap to avoid artifact-dominated top-N starvation.\n  const artifactHeadroom = Math.max(20, Math.max(0, maxArtifactRecall) * 8);\n  return Math.min(400, cappedRecallLimit + artifactHeadroom);\n}\n\nexport function summarizeGraphShadowComparison(\n  baseline: QmdSearchResult[],\n  merged: QmdSearchResult[],\n  topN: number,\n): {\n  baselineCount: number;\n  graphCount: number;\n  overlapCount: number;\n  overlapRatio: number;\n  averageOverlapDelta: number;\n} {\n  const limit = Math.max(0, Math.floor(topN));\n  const baselineTop = limit > 0 ? baseline.slice(0, limit) : [];\n  const graphTop = limit > 0 ? merged.slice(0, limit) : [];\n  const baselineByPath = new Map(\n    baselineTop.map((item) => [item.path, item.score]),\n  );\n  const graphByPath = new Map(graphTop.map((item) => [item.path, item.score]));\n\n  let overlapCount = 0;\n  let overlapDeltaSum = 0;\n  for (const [p, baselineScore] of baselineByPath.entries()) {\n    const graphScore = graphByPath.get(p);\n    if (typeof graphScore !== \"number\") continue;\n    overlapCount += 1;\n    overlapDeltaSum += graphScore - baselineScore;\n  }\n\n  const baselineCount = baselineTop.length;\n  return {\n    baselineCount,\n    graphCount: graphTop.length,\n    overlapCount,\n    overlapRatio: baselineCount > 0 ? overlapCount / baselineCount : 0,\n    averageOverlapDelta: overlapCount > 0 ? overlapDeltaSum / overlapCount : 0,\n  };\n}\n\nexport function parseGraphRecallRankedResults(\n  value: unknown,\n): GraphRecallRankedResult[] {\n  if (!Array.isArray(value)) return [];\n  const parsed: GraphRecallRankedResult[] = [];\n  for (const entry of value) {\n    if (!entry || typeof entry !== \"object\") continue;\n    const candidate = entry as Partial<GraphRecallRankedResult>;\n    if (\n      typeof candidate.path !== \"string\" ||\n      typeof candidate.score !== \"number\"\n    )\n      continue;\n    parsed.push({\n      path: candidate.path,\n      score: candidate.score,\n      docid: typeof candidate.docid === \"string\" ? candidate.docid : undefined,\n      sourceLabels: Array.isArray(candidate.sourceLabels)\n        ? candidate.sourceLabels.filter(\n            (item): item is string => typeof item === \"string\",\n          )\n        : [],\n    });\n  }\n  return parsed.slice(0, 64);\n}\n\nexport function parseMemoryIntentSnapshot(value: unknown): MemoryIntent {\n  const candidate =\n    value && typeof value === \"object\" ? (value as Partial<MemoryIntent>) : {};\n  return {\n    goal: typeof candidate.goal === \"string\" ? candidate.goal : \"unknown\",\n    actionType:\n      typeof candidate.actionType === \"string\"\n        ? candidate.actionType\n        : \"unknown\",\n    entityTypes: Array.isArray(candidate.entityTypes)\n      ? candidate.entityTypes.filter(\n          (item): item is string => typeof item === \"string\",\n        )\n      : [],\n    taskInitiation: candidate.taskInitiation === true,\n  };\n}\n\nexport function buildQmdIntentHint(intent: MemoryIntent): string | undefined {\n  const parts: string[] = [];\n  if (intent.goal !== \"unknown\") {\n    parts.push(`goal:${intent.goal.replace(/_/g, \" \")}`);\n  }\n  if (intent.actionType !== \"unknown\") {\n    parts.push(`action:${intent.actionType.replace(/_/g, \" \")}`);\n  }\n  if (intent.entityTypes.length > 0) {\n    parts.push(`entities:${intent.entityTypes.join(\",\")}`);\n  }\n  if (intent.taskInitiation === true) {\n    parts.push(\"task_initiation\");\n  }\n  return parts.length > 0 ? parts.join(\" \") : undefined;\n}\n\nexport function parseQmdRecallResults(value: unknown): QmdSearchResult[] {\n  if (!Array.isArray(value)) return [];\n  const parsed: QmdSearchResult[] = [];\n  for (const entry of value) {\n    if (!entry || typeof entry !== \"object\") continue;\n    const candidate = entry as Partial<QmdSearchResult>;\n    if (\n      typeof candidate.path !== \"string\" ||\n      typeof candidate.score !== \"number\"\n    )\n      continue;\n    parsed.push({\n      docid: typeof candidate.docid === \"string\" ? candidate.docid : \"\",\n      path: candidate.path,\n      snippet: typeof candidate.snippet === \"string\" ? candidate.snippet : \"\",\n      score: candidate.score,\n      explain: parseQmdExplain(candidate.explain),\n      transport:\n        candidate.transport === \"daemon\" ||\n        candidate.transport === \"subprocess\" ||\n        candidate.transport === \"hybrid\" ||\n        candidate.transport === \"scoped_prefilter\"\n          ? candidate.transport\n          : undefined,\n    });\n  }\n  return parsed.slice(0, 32);\n}\n\nexport function mergeArtifactRecallCandidates(\n  candidatesByNamespace: MemoryFile[][],\n  limit: number,\n): MemoryFile[] {\n  const cappedLimit = Math.max(0, limit);\n  if (cappedLimit === 0) return [];\n\n  const out: MemoryFile[] = [];\n  const seen = new Set<string>();\n  let offset = 0;\n  while (out.length < cappedLimit) {\n    let hasAnyCandidateAtOffset = false;\n    for (const list of candidatesByNamespace) {\n      if (offset >= list.length) continue;\n      hasAnyCandidateAtOffset = true;\n      const item = list[offset];\n      const dedupeKey = `${item.frontmatter.id}:${item.frontmatter.sourceMemoryId ?? \"\"}:${item.content}`;\n      if (seen.has(dedupeKey)) continue;\n      seen.add(dedupeKey);\n      out.push(item);\n      if (out.length >= cappedLimit) break;\n    }\n    if (!hasAnyCandidateAtOffset) break;\n    offset += 1;\n  }\n  return out;\n}\n\nexport function resolveRecentThreadMemoryPaths(options: {\n  threadEpisodeIds: string[];\n  currentMemoryId: string;\n  allMemsForGraph: MemoryFile[] | null | undefined;\n  pathById?: Map<string, string>;\n  storageDir: string;\n  maxRecent: number;\n}): string[] {\n  const maxRecent = Math.max(0, options.maxRecent);\n  if (options.threadEpisodeIds.length === 0 || maxRecent === 0) return [];\n  const pathById =\n    options.pathById ??\n    buildMemoryPathById(options.allMemsForGraph, options.storageDir);\n  if (pathById.size === 0) return [];\n\n  // #1635 (defensive): skip pending_review ids from legacy episode sets.\n  const pendingReviewIds = new Set<string>(\n    (options.allMemsForGraph ?? [])\n      .filter((m) => m.frontmatter.status === \"pending_review\" && m.frontmatter.id)\n      .map((m) => m.frontmatter.id as string),\n  );\n\n  return options.threadEpisodeIds\n    .filter((id) => id !== options.currentMemoryId)\n    .filter((id) => !pendingReviewIds.has(id))\n    .slice(-maxRecent)\n    .map((id) => pathById.get(id))\n    .filter((p): p is string => typeof p === \"string\" && p.length > 0);\n}\n\nexport function buildMemoryPathById(\n  allMemsForGraph: MemoryFile[] | null | undefined,\n  storageDir: string,\n): Map<string, string> {\n  const pathById = new Map<string, string>();\n  for (const mem of allMemsForGraph ?? []) {\n    const id = mem.frontmatter.id;\n    if (!id) continue;\n    pathById.set(id, path.relative(storageDir, mem.path));\n  }\n  return pathById;\n}\n\nexport function appendMemoryToGraphContext(options: {\n  allMemsForGraph: MemoryFile[] | null | undefined;\n  storageDir: string;\n  memoryRelPath: string;\n  memoryId: string;\n  category: MemoryFile[\"frontmatter\"][\"category\"];\n  content: string;\n  entityRef: string | undefined;\n}): void {\n  if (!Array.isArray(options.allMemsForGraph)) return;\n\n  const nowIso = new Date().toISOString();\n  options.allMemsForGraph.push({\n    path: path.join(options.storageDir, options.memoryRelPath),\n    content: options.content,\n    frontmatter: {\n      id: options.memoryId,\n      category: options.category,\n      created: nowIso,\n      updated: nowIso,\n      source: \"extraction\",\n      confidence: 0.8,\n      confidenceTier: \"implied\",\n      tags: [],\n      entityRef: options.entityRef,\n      status: \"active\",\n    },\n  });\n}\n\nexport function resolvePersistedMemoryRelativePath(options: {\n  memoryId: string;\n  pathById: Map<string, string>;\n  category: string;\n}): string {\n  const persisted = options.pathById.get(options.memoryId);\n  if (persisted) return persisted;\n  if (options.category === \"correction\") {\n    return path.join(\"corrections\", `${options.memoryId}.md`);\n  }\n  // Pick the subtree that matches the StorageManager.writeMemory routing\n  // so fallback paths (used before memoryPathById has seen the fresh\n  // write) agree with where the file actually lives. Routing goes through\n  // the shared categoryDirName() chokepoint (utils/category-dir.ts) so\n  // every category — decisions/, preferences/, reasoning-traces/, ... —\n  // resolves to the same dir the writer used; otherwise graph edges point\n  // at the wrong subtree and graph expansion silently drops those nodes\n  // when readMemoryByPath cannot resolve them (issue #564 PR 3 / #1546).\n  const subtree = categoryDirName(options.category);\n  const idParts = options.memoryId.split(\"-\");\n  const maybeTimestamp = Number(idParts[1]);\n  if (Number.isFinite(maybeTimestamp) && maybeTimestamp > 0) {\n    const day = new Date(maybeTimestamp).toISOString().slice(0, 10);\n    return path.join(subtree, day, `${options.memoryId}.md`);\n  }\n  return path.join(subtree, `${options.memoryId}.md`);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAeA,SAAS,kBAAkB;AAC3B,OAAO,QAAQ;AACf,OAAO,UAAU;AAkBV,IAAM,+BAA+B;AAYrC,IAAM,qCAAN,cAAiD,MAAM;AAAA,EACnD;AAAA,EAEA;AAAA,EAET,YACE,SACA,eACA,eACA;AACA,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,SAAK,gBAAgB;AACrB,SAAK,gBAAgB;AAAA,EACvB;AACF;AA0GO,SAAS,8BACd,QAMoB;AAOpB,UAAQ,QAAQ;AAAA,IACd,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,EACX;AACA,QAAM,cAAqB;AAC3B,OAAK;AACL,SAAO;AACT;AA6FO,IAAM,mBAAmB;AAEzB,SAAS,qBACd,QACA,UAAU,kBACJ;AACN,iBAAqB,QAAQ,OAAO;AACtC;AAEA,eAAsB,gBACpB,SACA,QACA,UAAU,kBACE;AACZ,uBAAqB,QAAQ,OAAO;AACpC,MAAI,CAAC,OAAQ,QAAO;AAEpB,MAAI,UAA+B;AACnC,QAAM,eAAe,IAAI,QAAW,CAAC,UAAU,WAAW;AACxD,cAAU,MAAM,OAAO,iBAAiB,OAAO,CAAC;AAChD,WAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAAA,EAC1D,CAAC;AAED,MAAI;AACF,WAAO,MAAM,QAAQ,KAAK,CAAC,SAAS,YAAY,CAAC;AAAA,EACnD,UAAE;AACA,QAAI,SAAS;AACX,aAAO,oBAAoB,SAAS,OAAO;AAAA,IAC7C;AAAA,EACF;AACF;AAGO,IAAM,+BAA+B,KAAK,KAAK;AAE/C,IAAM,kDAAkD;AASxD,SAAS,sBAAsB,OAAoC;AACxE,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,CAAC,QAAS,QAAO;AACrB,MAAI;AACF,SAAK,eAAe,QAAW,EAAE,UAAU,QAAQ,CAAC;AACpD,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEO,SAAS,qBAAqB,MAAY,UAA0B;AACzE,QAAM,QAAQ,IAAI,KAAK,eAAe,SAAS;AAAA,IAC7C;AAAA,IACA,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAK;AAAA,EACP,CAAC,EAAE,cAAc,IAAI;AACrB,QAAM,MAAM,CAAC,SAAyB,MAAM,KAAK,CAAC,SAAS,KAAK,SAAS,IAAI,GAAG,SAAS;AACzF,SAAO,GAAG,IAAI,MAAM,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,IAAI,KAAK,CAAC;AACrD;AAEO,SAAS,WAAW,MAAoB;AAC7C,SAAO,KAAK,YAAY,EAAE,MAAM,GAAG,EAAE;AACvC;AAEO,SAAS,kBAAkB,MAAsB;AACtD,QAAM,QAAQ;AACd,QAAM,OAAO;AAAA,IACX,WAAW,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC;AAAA,IAC3C,WAAW,IAAI;AAAA,IACf,WAAW,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC;AAAA,EAC7C;AACA,SAAO,KAAK,OAAO,CAAC,OAAO,OAAO,UAAU,MAAM,QAAQ,KAAK,MAAM,KAAK;AAC5E;AAEO,SAAS,uBAAuB,MAAY,UAA4B;AAC7E,QAAM,kBAAkB,qBAAqB,MAAM,QAAQ;AAC3D,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,SAAS;AACf,QAAM,YAAY,KAAK,QAAQ,IAAI,KAAK;AACxC,QAAM,UAAU,KAAK,QAAQ,IAAI,KAAK;AACtC,WAAS,KAAK,WAAW,MAAM,SAAS,MAAM,QAAQ;AACpD,UAAM,YAAY,IAAI,KAAK,EAAE;AAC7B,QAAI,qBAAqB,WAAW,QAAQ,MAAM,iBAAiB;AACjE,WAAK,IAAI,WAAW,SAAS,CAAC;AAAA,IAChC;AAAA,EACF;AACA,SAAO,KAAK,OAAO,IAAI,CAAC,GAAG,IAAI,EAAE,KAAK,IAAI,kBAAkB,IAAI;AAClE;AAEO,SAAS,gBAAgB,OAA6B;AAC3D,MAAI,OAAO,UAAU,YAAY,MAAM,KAAK,EAAE,WAAW,EAAG,QAAO;AACnE,QAAM,SAAS,IAAI,KAAK,KAAK;AAC7B,SAAO,OAAO,SAAS,OAAO,QAAQ,CAAC,IAAI,SAAS;AACtD;AAEO,SAAS,uCACd,KACA,SACA,UACA,iBACe;AACf,QAAM,oBAAoB;AAC1B,QAAM,UAAU,MAAM,KAAK,IAAI,SAAS,iBAAiB,CAAC;AAC1D,MAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,QAAM,oBAAoB,QAAQ,CAAC,GAAG,SAAS;AAC/C,QAAM,WAAW,IAAI,MAAM,GAAG,iBAAiB,EAAE,KAAK;AACtD,QAAM,WAAqB,CAAC;AAC5B,WAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACtD,UAAM,QAAQ,QAAQ,KAAK;AAC3B,UAAM,OAAO,MAAM,CAAC;AACpB,QAAI,CAAC,KAAM;AACX,UAAM,mBAAmB,gBAAgB,GAAG,OAAO,IAAI,IAAI,aAAa;AACxE,QACE,CAAC,oBACD,qBAAqB,kBAAkB,QAAQ,MAAM,iBACrD;AACA;AAAA,IACF;AACA,UAAM,eAAe,MAAM,SAAS;AACpC,UAAM,aAAa,QAAQ,QAAQ,CAAC,GAAG,SAAS,IAAI;AACpD,UAAM,UAAU,IAAI,MAAM,cAAc,UAAU,EAAE,KAAK;AACzD,QAAI,QAAQ,SAAS,EAAG,UAAS,KAAK,OAAO;AAAA,EAC/C;AAEA,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,SAAO,CAAC,UAAU,GAAG,QAAQ,EAC1B,OAAO,CAAC,YAAY,QAAQ,SAAS,CAAC,EACtC,KAAK,MAAM;AAChB;AAIO,SAAS,qCAA6C;AAC3D,QAAM,MACJ,QAAQ,IAAI,kDACZ,QAAQ,IAAI;AACd,MAAI,QAAQ,OAAW,QAAO;AAC9B,QAAM,SAAS,OAAO,GAAG;AACzB,SAAO,OAAO,SAAS,MAAM,KAAK,UAAU,MACxC,KAAK,MAAM,MAAM,IACjB;AACN;AAEA,eAAsB,qCACpB,SACA,YACA,OACgC;AAChC,QAAM,YAAY,mCAAmC;AACrD,MAAI;AACJ,MAAI,UAAU;AAEd,QAAM,iBAAiB,IAAI,QAA+B,CAAC,YAAY;AACrE,YAAQ,WAAW,MAAM;AACvB,UAAI,QAAS;AACb,iBAAW,MAAM;AACjB,UAAI;AAAA,QACF,oCAAoC,KAAK,oBAAoB,SAAS;AAAA,MACxE;AACA,cAAQ,SAAS;AAAA,IACnB,GAAG,SAAS;AACZ,UAAM,QAAQ;AAAA,EAChB,CAAC;AAED,QAAM,iBAAiB,QACpB,MAAM,CAAC,QAA+B;AACrC,QAAI;AAAA,MACF,oCAAoC,KAAK,8CAA8C,GAAG;AAAA,IAC5F;AACA,WAAO;AAAA,EACT,CAAC,EACA,QAAQ,MAAM;AACb,cAAU;AACV,QAAI,MAAO,cAAa,KAAK;AAAA,EAC/B,CAAC;AAEH,SAAO,MAAM,QAAQ,KAAK,CAAC,gBAAgB,cAAc,CAAC;AAC5D;AAGO,SAAS,sBAA8B;AAC5C,SAAO,KAAK,KAAK,GAAG,QAAQ,GAAG,aAAa,WAAW;AACzD;AAcO,SAAS,8BAA8B,YAA4B;AACxE,QAAM,WAAW,WAAW,QAAQ,oBAAoB,GAAG;AAC3D,QAAM,OAAO,WAAW,QAAQ,EAC7B,OAAO,UAAU,EACjB,OAAO,KAAK,EACZ,MAAM,GAAG,EAAE;AACd,SAAO,GAAG,QAAQ,IAAI,IAAI;AAC5B;AAEO,SAAS,gBAAgB,MAAiC;AAC/D,MAAI,OAAO,KAAK,kBAAkB,SAAU,QAAO;AACnD,SAAO,0BAA0B,KAAK,cAAc,KAAK,CAAC;AAC5D;AAEO,IAAM,gCAAgC;AAEtC,SAAS,sBAAsB,MAAkB,OAAuB;AAC7E,QAAM,YAAY,gBAAgB,IAAI;AACtC,SAAO,cAAc,OAAO,WAAW,KAAK,KAAK,OAAO,SAAS;AACnE;AAEO,SAAS,wBAAwB,MAA8B;AACpE,SAAO,EAAE,GAAG,MAAM,uBAAuB,KAAK;AAChD;AAEO,SAAS,uBAAuB,MAA8B;AACnE,QAAM,EAAE,uBAAuB,cAAc,GAAG,WAAW,IAAI;AAC/D,SAAO;AACT;AAEO,SAAS,0BACd,OACA,aACA,WACA,iBACc;AACd,MAAI,oBAAoB,KAAM,QAAO,CAAC;AACtC,SAAO,MACJ,QAAQ,CAAC,MAAM,UAAU;AACxB,QAAI,SAAS,eAAe,QAAQ,UAAW,QAAO,CAAC;AACvD,UAAM,mBAAmB,gBAAgB,IAAI;AAC7C,QAAI,qBAAqB,QAAQ,mBAAmB,iBAAiB;AACnE,aAAO,CAAC;AAAA,IACV;AACA,WAAO,CAAC,EAAE,MAAM,OAAO,WAAW,iBAAiB,CAAC;AAAA,EACtD,CAAC,EACA,KAAK,CAAC,GAAG,MAAM;AACd,QAAI,EAAE,YAAY,EAAE,UAAW,QAAO;AACtC,QAAI,EAAE,YAAY,EAAE,UAAW,QAAO;AACtC,QAAI,EAAE,UAAU,EAAE,MAAO,QAAO;AAChC,WAAO,EAAE,QAAQ,EAAE,QAAQ,KAAK;AAAA,EAClC,CAAC,EACA,MAAM,CAAC,6BAA6B,EACpC,IAAI,CAAC,EAAE,KAAK,MAAM,wBAAwB,IAAI,CAAC;AACpD;AAEO,SAAS,0BAA0B,OAAsC;AAC9E,MAAI,WAA0B;AAC9B,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,0BAA0B,KAAM;AACzC,UAAM,YAAY,gBAAgB,IAAI;AACtC,QAAI,cAAc,KAAM;AACxB,QAAI,aAAa,QAAQ,YAAY,UAAU;AAC7C,iBAAW;AAAA,IACb;AAAA,EACF;AACA,SAAO,YAAY,OAAO;AAC5B;AAEO,SAAS,uCACd,QACgB;AAChB,SAAO,OACJ,IAAI,CAAC,OAAO,WAAW;AAAA,IACtB;AAAA,IACA;AAAA,IACA,iBAAiB,0BAA0B,KAAK;AAAA,EAClD,EAAE,EACD,KAAK,CAAC,GAAG,MAAM;AACd,QAAI,EAAE,kBAAkB,EAAE,gBAAiB,QAAO;AAClD,QAAI,EAAE,kBAAkB,EAAE,gBAAiB,QAAO;AAClD,QAAI,EAAE,UAAU,EAAE,MAAO,QAAO;AAChC,WAAO,EAAE,QAAQ,EAAE,QAAQ,KAAK;AAAA,EAClC,CAAC,EACA,IAAI,CAAC,UAAU,MAAM,KAAK;AAC/B;AAEO,SAAS,0BACd,OACA,UAAwC,CAAC,GACzB;AAChB,MAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAChC,MAAI,CAAC,MAAM,KAAK,CAAC,SAAS,gBAAgB,IAAI,MAAM,IAAI,GAAG;AACzD,WAAO,CAAC,CAAC,GAAG,KAAK,CAAC;AAAA,EACpB;AAEA,QAAM,SAAyB,CAAC;AAChC,MAAI,QAAQ;AACZ,SAAO,QAAQ,MAAM,QAAQ;AAC3B,UAAM,kBAAkB,gBAAgB,MAAM,KAAK,CAAC;AACpD,UAAM,YAAY,sBAAsB,MAAM,KAAK,GAAG,KAAK;AAC3D,QAAI,MAAM,QAAQ;AAClB,WACE,MAAM,MAAM,UACZ,sBAAsB,MAAM,GAAG,GAAG,GAAG,MAAM,WAC3C;AACA,aAAO;AAAA,IACT;AAEA,UAAM,eACJ,QAAQ,mBAAmB,QACvB,CAAC,IACD,0BAA0B,OAAO,OAAO,KAAK,eAAe;AAClE,WAAO,KAAK;AAAA,MACV,GAAG;AAAA,MACH,GAAG,MAAM,MAAM,OAAO,GAAG,EAAE,IAAI,sBAAsB;AAAA,IACvD,CAAC;AACD,YAAQ;AAAA,EACV;AACA,SAAO,uCAAuC,MAAM;AACtD;AAEO,SAAS,qBAAqB,UAA2B;AAC9D,SAAO,mCAAmC,KAAK,QAAQ;AACzD;AAYO,SAAS,oBAAoB,UAA2B;AAC7D,SAAO,wFAAwF,KAAK,QAAQ;AAC9G;AAGA,IAAM,2BAA2B;AAEjC,IAAM,2BAA2B;AAa1B,SAAS,qBAAqB,UAAkB,YAA8B;AACnF,MAAI,eAAe,UAAa,WAAW,SAAS,GAAG;AACrD,UAAM,WAAW,KAAK,SAAS,YAAY,KAAK,QAAQ,YAAY,QAAQ,CAAC;AAC7E,WAAO,yBAAyB,KAAK,QAAQ;AAAA,EAC/C;AACA,SAAO,yBAAyB,KAAK,QAAQ;AAC/C;AAGA,IAAM,wBAAwB;AAE9B,IAAM,wBAAwB;AAWvB,SAAS,kBAAkB,UAAkB,YAA8B;AAChF,MAAI,eAAe,UAAa,WAAW,SAAS,GAAG;AACrD,UAAM,WAAW,KAAK,SAAS,YAAY,KAAK,QAAQ,YAAY,QAAQ,CAAC;AAC7E,WAAO,sBAAsB,KAAK,QAAQ;AAAA,EAC5C;AACA,SAAO,sBAAsB,KAAK,QAAQ;AAC5C;AAEO,SAASA,oCACd,QACA,kBAAyB,oBAAI,KAAK,GAAE,YAAY,GACxC;AACR,SAAO,mCAAqC,QAAQ,cAAc;AACpE;AAGO,SAAS,+BACd,YACA,gBACmB;AACnB,MAAI,CAAC,eAAgB,QAAO;AAC5B,MAAI,eAAe,SAAS,EAAG,QAAO,CAAC;AACvC,QAAM,WAAW,WAAW;AAAA,IAAO,CAAC,cAClC,eAAe,IAAI,UAAU,IAAI;AAAA,EACnC;AACA,SAAO,SAAS,SAAS,IAAI,WAAW;AAC1C;AAEO,SAAS,oBAAoB,QAA0B;AAC5D,SAAO,OACJ,YAAY,EACZ,MAAM,aAAa,EACnB,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EACnB,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC;AAChC;AAEO,SAAS,qBAAqB,aAAyC;AAC5E,SACE,YAAY,mBAAmB,UAC/B,YAAY,sBAAsB,UAClC,YAAY,gBAAgB,UAC5B,YAAY,oBAAoB,UAChC,YAAY,eAAe,UAC3B,YAAY,cAAc;AAE9B;AAEO,SAAS,qCACd,aACA,SAIS;AACT,MAAI,CAAC,QAAQ,0BAA0B,CAAC,QAAQ;AAC9C,WAAO;AACT,MAAI,CAAC,qBAAqB,WAAW,EAAG,QAAO;AAC/C,QAAM,iBAAiB,sBAAsB,WAAW;AACxD,SAAO,mBAAmB,WAAW,mBAAmB;AAC1D;AAEO,SAAS,+BACd,aACA,SAGQ;AACR,MAAI,CAAC,QAAQ,uBAAwB,QAAO;AAC5C,MAAI,CAAC,qBAAqB,WAAW,EAAG,QAAO;AAE/C,MAAI,QAAQ;AACZ,QAAM,iBAAiB,sBAAsB,WAAW;AACxD,UAAQ,gBAAgB;AAAA,IACtB,KAAK;AACH,eAAS;AACT;AAAA,IACF,KAAK;AACH,eAAS;AACT;AAAA,IACF,KAAK;AACH,eAAS;AACT;AAAA,IACF,KAAK;AACH,eAAS;AACT;AAAA,IACF,KAAK;AACH,eAAS;AACT;AAAA,EACJ;AACA,MAAI,YAAY,sBAAsB,YAAY;AAChD,aAAS;AAAA,EACX;AACA,SAAO;AACT;AAEO,SAAS,2BACd,YACA,mBACA,4BACQ;AACR,MAAI,eAAe,YAAa,QAAO;AACvC,MAAI,KAAK,IAAI,GAAG,iBAAiB,MAAM,EAAG,QAAO;AACjD,QAAM,OAAO,KAAK,IAAI,GAAG,0BAA0B;AACnD,MAAI,eAAe,WAAW;AAC5B,WAAO,KAAK,IAAI,MAAM,KAAK,IAAI,GAAG,iBAAiB,CAAC;AAAA,EACtD;AACA,SAAO;AACT;AAEO,SAAS,2BAA2B,SAMxB;AACjB,SAAO,0BAA0B,OAAO,EAAE;AAC5C;AAkBO,SAAS,2BACd,gBACA,SACoB;AACpB,MAAI,cAA8B;AAClC,QAAM,8BACJ,QAAQ,kBACR,QAAQ,+BAA+B,QACvC,oBAAoB,QAAQ,MAAM;AACpC,MAAI,gBAAgB,gBAAgB,6BAA6B;AAC/D,kBAAc;AAAA,EAChB;AACA,MACE,gBAAgB,iBACf,CAAC,QAAQ,sBAAsB,CAAC,QAAQ,0BACzC;AACA,WAAO;AAAA,MACL;AAAA,MACA,eAAe;AAAA,MACf;AAAA,MACA,aAAa,CAAC,QAAQ,qBAClB,oCACA;AAAA,IACN;AAAA,EACF;AACA,SAAO;AAAA,IACL;AAAA,IACA,eAAe;AAAA,IACf;AAAA,EACF;AACF;AAEO,SAAS,0BAA0B,SAAqD;AAC7F,QAAM,cAA8B,QAAQ,iBACxC,eAAe,QAAQ,MAAM,IAC7B;AACJ,SAAO,2BAA2B,aAAa,OAAO;AACxD;AAYA,eAAsB,+BACpB,SAY6B;AAC7B,QAAM,oBAAoB,0BAA0B,OAAO;AAI3D,QAAM,oBAAoB,QAAQ,KAAK;AACvC,MAAI,CAAC,QAAQ,kBAAkB,CAAC,mBAAmB;AACjD,WAAO;AAAA,EACT;AAEA,QAAM,EAAE,kBAAkB,IAAI,MAAM,OAAO,yBAA0B;AACrE,QAAM,UAAU,MAAM;AAAA,IACpB,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,EACV;AAIA,MAAI,QAAQ,OAAO,yBAAyB;AAC1C,WAAO;AAAA,MACL,GAAG;AAAA,MACH,eAAe,QAAQ;AAAA,MACvB,eAAe,UAAU,QAAQ,MAAM;AAAA,MACvC,kBAAkB,QAAQ;AAAA,MAC1B,qBAAqB,QAAQ;AAAA,MAC7B,kBAAkB,QAAQ;AAAA,MAC1B,sBAAsB,QAAQ;AAAA,MAC9B,eAAe,QAAQ;AAAA,IACzB;AAAA,EACF;AAEA,QAAM,cAAc,2BAA2B,QAAQ,MAAM,OAAO;AACpE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,eAAe,QAAQ;AAAA,IACvB,eAAe,QAAQ;AAAA,IACvB,kBAAkB,QAAQ;AAAA,IAC1B,qBAAqB,QAAQ;AAAA,IAC7B,kBAAkB,QAAQ;AAAA,IAC1B,sBAAsB,QAAQ;AAAA,EAChC;AACF;AAEO,SAAS,mCACd,aACQ;AACR,QAAM,eAAe,KAAK,IAAI,GAAG,WAAW;AAC5C,MAAI,iBAAiB,EAAG,QAAO;AAC/B,QAAM,WAAW,KAAK,IAAI,GAAG,eAAe,CAAC;AAC7C,SAAO,KAAK,IAAI,KAAK,eAAe,QAAQ;AAC9C;AAEO,SAAS,2BACd,kBACA,kBACA,mBACQ;AACR,QAAM,oBAAoB,KAAK,IAAI,GAAG,gBAAgB;AACtD,MAAI,sBAAsB,EAAG,QAAO;AACpC,MAAI,CAAC,iBAAkB,QAAO;AAG9B,QAAM,mBAAmB,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,iBAAiB,IAAI,CAAC;AACxE,SAAO,KAAK,IAAI,KAAK,oBAAoB,gBAAgB;AAC3D;AAEO,SAAS,+BACd,UACA,QACA,MAOA;AACA,QAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,IAAI,CAAC;AAC1C,QAAM,cAAc,QAAQ,IAAI,SAAS,MAAM,GAAG,KAAK,IAAI,CAAC;AAC5D,QAAM,WAAW,QAAQ,IAAI,OAAO,MAAM,GAAG,KAAK,IAAI,CAAC;AACvD,QAAM,iBAAiB,IAAI;AAAA,IACzB,YAAY,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM,KAAK,KAAK,CAAC;AAAA,EACnD;AACA,QAAM,cAAc,IAAI,IAAI,SAAS,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM,KAAK,KAAK,CAAC,CAAC;AAE3E,MAAI,eAAe;AACnB,MAAI,kBAAkB;AACtB,aAAW,CAAC,GAAG,aAAa,KAAK,eAAe,QAAQ,GAAG;AACzD,UAAM,aAAa,YAAY,IAAI,CAAC;AACpC,QAAI,OAAO,eAAe,SAAU;AACpC,oBAAgB;AAChB,uBAAmB,aAAa;AAAA,EAClC;AAEA,QAAM,gBAAgB,YAAY;AAClC,SAAO;AAAA,IACL;AAAA,IACA,YAAY,SAAS;AAAA,IACrB;AAAA,IACA,cAAc,gBAAgB,IAAI,eAAe,gBAAgB;AAAA,IACjE,qBAAqB,eAAe,IAAI,kBAAkB,eAAe;AAAA,EAC3E;AACF;AAEO,SAAS,8BACd,OAC2B;AAC3B,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,QAAO,CAAC;AACnC,QAAM,SAAoC,CAAC;AAC3C,aAAW,SAAS,OAAO;AACzB,QAAI,CAAC,SAAS,OAAO,UAAU,SAAU;AACzC,UAAM,YAAY;AAClB,QACE,OAAO,UAAU,SAAS,YAC1B,OAAO,UAAU,UAAU;AAE3B;AACF,WAAO,KAAK;AAAA,MACV,MAAM,UAAU;AAAA,MAChB,OAAO,UAAU;AAAA,MACjB,OAAO,OAAO,UAAU,UAAU,WAAW,UAAU,QAAQ;AAAA,MAC/D,cAAc,MAAM,QAAQ,UAAU,YAAY,IAC9C,UAAU,aAAa;AAAA,QACrB,CAAC,SAAyB,OAAO,SAAS;AAAA,MAC5C,IACA,CAAC;AAAA,IACP,CAAC;AAAA,EACH;AACA,SAAO,OAAO,MAAM,GAAG,EAAE;AAC3B;AAEO,SAAS,0BAA0B,OAA8B;AACtE,QAAM,YACJ,SAAS,OAAO,UAAU,WAAY,QAAkC,CAAC;AAC3E,SAAO;AAAA,IACL,MAAM,OAAO,UAAU,SAAS,WAAW,UAAU,OAAO;AAAA,IAC5D,YACE,OAAO,UAAU,eAAe,WAC5B,UAAU,aACV;AAAA,IACN,aAAa,MAAM,QAAQ,UAAU,WAAW,IAC5C,UAAU,YAAY;AAAA,MACpB,CAAC,SAAyB,OAAO,SAAS;AAAA,IAC5C,IACA,CAAC;AAAA,IACL,gBAAgB,UAAU,mBAAmB;AAAA,EAC/C;AACF;AAEO,SAAS,mBAAmB,QAA0C;AAC3E,QAAM,QAAkB,CAAC;AACzB,MAAI,OAAO,SAAS,WAAW;AAC7B,UAAM,KAAK,QAAQ,OAAO,KAAK,QAAQ,MAAM,GAAG,CAAC,EAAE;AAAA,EACrD;AACA,MAAI,OAAO,eAAe,WAAW;AACnC,UAAM,KAAK,UAAU,OAAO,WAAW,QAAQ,MAAM,GAAG,CAAC,EAAE;AAAA,EAC7D;AACA,MAAI,OAAO,YAAY,SAAS,GAAG;AACjC,UAAM,KAAK,YAAY,OAAO,YAAY,KAAK,GAAG,CAAC,EAAE;AAAA,EACvD;AACA,MAAI,OAAO,mBAAmB,MAAM;AAClC,UAAM,KAAK,iBAAiB;AAAA,EAC9B;AACA,SAAO,MAAM,SAAS,IAAI,MAAM,KAAK,GAAG,IAAI;AAC9C;AAEO,SAAS,sBAAsB,OAAmC;AACvE,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,QAAO,CAAC;AACnC,QAAM,SAA4B,CAAC;AACnC,aAAW,SAAS,OAAO;AACzB,QAAI,CAAC,SAAS,OAAO,UAAU,SAAU;AACzC,UAAM,YAAY;AAClB,QACE,OAAO,UAAU,SAAS,YAC1B,OAAO,UAAU,UAAU;AAE3B;AACF,WAAO,KAAK;AAAA,MACV,OAAO,OAAO,UAAU,UAAU,WAAW,UAAU,QAAQ;AAAA,MAC/D,MAAM,UAAU;AAAA,MAChB,SAAS,OAAO,UAAU,YAAY,WAAW,UAAU,UAAU;AAAA,MACrE,OAAO,UAAU;AAAA,MACjB,SAAS,gBAAgB,UAAU,OAAO;AAAA,MAC1C,WACE,UAAU,cAAc,YACxB,UAAU,cAAc,gBACxB,UAAU,cAAc,YACxB,UAAU,cAAc,qBACpB,UAAU,YACV;AAAA,IACR,CAAC;AAAA,EACH;AACA,SAAO,OAAO,MAAM,GAAG,EAAE;AAC3B;AAEO,SAAS,8BACd,uBACA,OACc;AACd,QAAM,cAAc,KAAK,IAAI,GAAG,KAAK;AACrC,MAAI,gBAAgB,EAAG,QAAO,CAAC;AAE/B,QAAM,MAAoB,CAAC;AAC3B,QAAM,OAAO,oBAAI,IAAY;AAC7B,MAAI,SAAS;AACb,SAAO,IAAI,SAAS,aAAa;AAC/B,QAAI,0BAA0B;AAC9B,eAAW,QAAQ,uBAAuB;AACxC,UAAI,UAAU,KAAK,OAAQ;AAC3B,gCAA0B;AAC1B,YAAM,OAAO,KAAK,MAAM;AACxB,YAAM,YAAY,GAAG,KAAK,YAAY,EAAE,IAAI,KAAK,YAAY,kBAAkB,EAAE,IAAI,KAAK,OAAO;AACjG,UAAI,KAAK,IAAI,SAAS,EAAG;AACzB,WAAK,IAAI,SAAS;AAClB,UAAI,KAAK,IAAI;AACb,UAAI,IAAI,UAAU,YAAa;AAAA,IACjC;AACA,QAAI,CAAC,wBAAyB;AAC9B,cAAU;AAAA,EACZ;AACA,SAAO;AACT;AAEO,SAAS,+BAA+B,SAOlC;AACX,QAAM,YAAY,KAAK,IAAI,GAAG,QAAQ,SAAS;AAC/C,MAAI,QAAQ,iBAAiB,WAAW,KAAK,cAAc,EAAG,QAAO,CAAC;AACtE,QAAM,WACJ,QAAQ,YACR,oBAAoB,QAAQ,iBAAiB,QAAQ,UAAU;AACjE,MAAI,SAAS,SAAS,EAAG,QAAO,CAAC;AAGjC,QAAM,mBAAmB,IAAI;AAAA,KAC1B,QAAQ,mBAAmB,CAAC,GAC1B,OAAO,CAAC,MAAM,EAAE,YAAY,WAAW,oBAAoB,EAAE,YAAY,EAAE,EAC3E,IAAI,CAAC,MAAM,EAAE,YAAY,EAAY;AAAA,EAC1C;AAEA,SAAO,QAAQ,iBACZ,OAAO,CAAC,OAAO,OAAO,QAAQ,eAAe,EAC7C,OAAO,CAAC,OAAO,CAAC,iBAAiB,IAAI,EAAE,CAAC,EACxC,MAAM,CAAC,SAAS,EAChB,IAAI,CAAC,OAAO,SAAS,IAAI,EAAE,CAAC,EAC5B,OAAO,CAAC,MAAmB,OAAO,MAAM,YAAY,EAAE,SAAS,CAAC;AACrE;AAEO,SAAS,oBACd,iBACA,YACqB;AACrB,QAAM,WAAW,oBAAI,IAAoB;AACzC,aAAW,OAAO,mBAAmB,CAAC,GAAG;AACvC,UAAM,KAAK,IAAI,YAAY;AAC3B,QAAI,CAAC,GAAI;AACT,aAAS,IAAI,IAAI,KAAK,SAAS,YAAY,IAAI,IAAI,CAAC;AAAA,EACtD;AACA,SAAO;AACT;AAEO,SAAS,2BAA2B,SAQlC;AACP,MAAI,CAAC,MAAM,QAAQ,QAAQ,eAAe,EAAG;AAE7C,QAAM,UAAS,oBAAI,KAAK,GAAE,YAAY;AACtC,UAAQ,gBAAgB,KAAK;AAAA,IAC3B,MAAM,KAAK,KAAK,QAAQ,YAAY,QAAQ,aAAa;AAAA,IACzD,SAAS,QAAQ;AAAA,IACjB,aAAa;AAAA,MACX,IAAI,QAAQ;AAAA,MACZ,UAAU,QAAQ;AAAA,MAClB,SAAS;AAAA,MACT,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,YAAY;AAAA,MACZ,gBAAgB;AAAA,MAChB,MAAM,CAAC;AAAA,MACP,WAAW,QAAQ;AAAA,MACnB,QAAQ;AAAA,IACV;AAAA,EACF,CAAC;AACH;AAEO,SAAS,mCAAmC,SAIxC;AACT,QAAM,YAAY,QAAQ,SAAS,IAAI,QAAQ,QAAQ;AACvD,MAAI,UAAW,QAAO;AACtB,MAAI,QAAQ,aAAa,cAAc;AACrC,WAAO,KAAK,KAAK,eAAe,GAAG,QAAQ,QAAQ,KAAK;AAAA,EAC1D;AASA,QAAM,UAAU,gBAAgB,QAAQ,QAAQ;AAChD,QAAM,UAAU,QAAQ,SAAS,MAAM,GAAG;AAC1C,QAAM,iBAAiB,OAAO,QAAQ,CAAC,CAAC;AACxC,MAAI,OAAO,SAAS,cAAc,KAAK,iBAAiB,GAAG;AACzD,UAAM,MAAM,IAAI,KAAK,cAAc,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE;AAC9D,WAAO,KAAK,KAAK,SAAS,KAAK,GAAG,QAAQ,QAAQ,KAAK;AAAA,EACzD;AACA,SAAO,KAAK,KAAK,SAAS,GAAG,QAAQ,QAAQ,KAAK;AACpD;","names":["buildCompressionGuidelinesMarkdown"]}