@opengeni/jev 0.1.0-canary.36199476632001

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/client.ts","../src/circuit-breaker.ts","../src/code-search/config.ts","../src/code-search/judge.ts","../src/code-search/workspace.ts","../src/code-search/session.ts","../src/code-search/text.ts","../src/code-search/leads.ts","../src/code-search/windows.ts","../src/code-search/pack.ts","../src/code-search/recall.ts","../src/code-search/search.ts","../src/code-search/tool.ts"],"sourcesContent":["/**\n * Minimal client for TypeSafe Jev (\"System One\"): POST {baseUrl}/v1/systemone with\n * {state, model, questions} and get one typed answer per question back.\n *\n * - Splits a large question map across several requests so each stays inside the documented\n *   limits (32k tokens for state + longest question, 64k for state + all questions).\n * - Retries only network errors (including per-attempt timeouts), 429 and 5xx, with bounded\n *   backoff that honours `retry-after` up to `maxRetryAfterMs`. Other 4xx are never retried.\n * - The caller's AbortSignal cancels queued and in-flight requests and rejects with its reason.\n * - The API key is only ever sent in the Authorization header; it never appears in errors.\n */\n\nexport const JEV_DEFAULT_BASE_URL = \"https://api.typesafe.ai\";\nexport const JEV_DEFAULT_MODEL = \"jev-latest\";\n/** USD per 1M input tokens; output tokens are free. */\nexport const JEV_PRICE_PER_MILLION_INPUT_TOKENS_USD = 0.042;\n\n// ---------------------------------------------------------------------------\n// Questions and answers\n// ---------------------------------------------------------------------------\n\n/** Instructions and criteria may be a string or structured JSON. */\nexport type JevInstructions = string | Record<string, unknown> | unknown[];\n\nexport interface JevNoulQuestion {\n  type: \"noul\";\n  instructions: JevInstructions;\n  criteria?: { true?: JevInstructions; false?: JevInstructions };\n}\n\nexport interface JevChoiceQuestion {\n  type: \"choice\";\n  instructions: JevInstructions;\n  criteria: Record<string, JevInstructions | null>;\n}\n\nexport interface JevScoreQuestion {\n  type: \"score\";\n  instructions: JevInstructions;\n  criteria: JevInstructions[];\n}\n\nexport type JevQuestion = JevNoulQuestion | JevChoiceQuestion | JevScoreQuestion;\n\nexport interface JevNoulAnswer {\n  type: \"noul\";\n  /** Probability of \"yes\" in [0, 1]; NaN when the API returned no usable number. */\n  probability: number;\n}\n\nexport interface JevChoiceAnswer {\n  type: \"choice\";\n  option: string;\n  probabilities?: Record<string, number>;\n  confidence?: number;\n}\n\n/** Passed through as the API returns it. */\nexport interface JevScoreAnswer {\n  type: \"score\";\n  score: number;\n  legend?: Record<string, string>;\n  probabilities?: Record<string, number>;\n  confidence?: number;\n}\n\nexport type JevAnswer = JevNoulAnswer | JevChoiceAnswer | JevScoreAnswer;\n\nexport type JevAnswerFor<Q> = Q extends JevNoulQuestion\n  ? JevNoulAnswer\n  : Q extends JevChoiceQuestion\n    ? JevChoiceAnswer\n    : Q extends JevScoreQuestion\n      ? JevScoreAnswer\n      : JevAnswer;\n\nexport interface JevAskResult<Q extends Record<string, JevQuestion>> {\n  answers: { [K in keyof Q]: JevAnswerFor<Q[K]> };\n  /** Versioned model id that answered (for example jev-1.13.0). */\n  model: string;\n  usage: { inputTokens: number };\n  /** HTTP requests (chunks) that made up this ask. */\n  requests: number;\n  costUsd: number;\n}\n\nexport interface JevAskOptions {\n  /** Short label used in error messages (for example \"code_search:wave1\"). */\n  tag?: string | undefined;\n  signal?: AbortSignal | undefined;\n}\n\nexport function noul(\n  instructions: JevInstructions,\n  criteria?: { true?: JevInstructions; false?: JevInstructions },\n): JevNoulQuestion {\n  return criteria ? { type: \"noul\", instructions, criteria } : { type: \"noul\", instructions };\n}\n\nexport function jevCostUsd(inputTokens: number): number {\n  return (inputTokens * JEV_PRICE_PER_MILLION_INPUT_TOKENS_USD) / 1_000_000;\n}\n\n// ---------------------------------------------------------------------------\n// Errors\n// ---------------------------------------------------------------------------\n\nexport class JevError extends Error {\n  /** HTTP status of the failed response, when there was one. */\n  readonly status: number | undefined;\n  /** Machine-readable reason when known (for example \"max_tokens_exceeded\" or \"state_too_large\"). */\n  readonly code: string | undefined;\n\n  constructor(message: string, options: { status?: number; code?: string; cause?: unknown } = {}) {\n    super(message, options.cause === undefined ? undefined : { cause: options.cause });\n    this.name = new.target.name;\n    this.status = options.status;\n    this.code = options.code;\n  }\n}\n\n/** Jev cannot be used right now: network, timeout, 5xx, 429 after retries, or 401/402/403 auth and billing. */\nexport class JevUnavailableError extends JevError {}\n\n/** Jev rejected the request itself (other 4xx), or the request cannot fit the limits. Never retried. */\nexport class JevRequestError extends JevError {}\n\n// ---------------------------------------------------------------------------\n// Limits and chunking\n// ---------------------------------------------------------------------------\n\nexport interface JevLimits {\n  /** Documented: state + longest question. */\n  stateLongestMax: number;\n  /** Documented: state + all questions. */\n  stateAllMax: number;\n  /** Fraction of each limit used (token estimates are approximate). */\n  safety: number;\n  /** Measured fixed overhead per request (~265 tokens). */\n  perRequestOverhead: number;\n  /** Measured framing overhead per question (~7-10 tokens) on top of its own text. */\n  perQuestionOverhead: number;\n  /** No documented cap; keeps one request reasonable. */\n  maxQuestionsPerRequest: number;\n}\n\nexport const JEV_DEFAULT_LIMITS: JevLimits = {\n  stateLongestMax: 32_000,\n  stateAllMax: 64_000,\n  safety: 0.9,\n  perRequestOverhead: 300,\n  perQuestionOverhead: 12,\n  maxQuestionsPerRequest: 256,\n};\n\n/** Measured: TS code 3.2-3.5 chars/token, prose 4.4-4.7; 3.0 keeps the limit math conservative. */\nexport const JEV_CHARS_PER_TOKEN = 3.0;\n\nexport function estimateJevTokens(value: unknown, charsPerToken = JEV_CHARS_PER_TOKEN): number {\n  const s = typeof value === \"string\" ? value : JSON.stringify(value ?? \"\");\n  return Math.ceil(s.length / charsPerToken);\n}\n\n/**\n * Greedy packing of question ids into requests that respect both limits.\n * Throws JevRequestError (code state_too_large) when the state plus one question cannot fit.\n */\nexport function planChunks(\n  stateTokens: number,\n  questionTokens: ReadonlyArray<readonly [string, number]>,\n  limits: JevLimits = JEV_DEFAULT_LIMITS,\n): string[][] {\n  const longestCap = limits.stateLongestMax * limits.safety;\n  const allCap = limits.stateAllMax * limits.safety;\n  const base = stateTokens + limits.perRequestOverhead;\n  const chunks: string[][] = [];\n  let cur: string[] = [];\n  let curSum = 0;\n  for (const [id, qt] of questionTokens) {\n    const cost = qt + limits.perQuestionOverhead;\n    if (base + cost > longestCap) {\n      throw new JevRequestError(\n        `Jev state (~${stateTokens} tokens) plus question \"${id}\" (~${qt} tokens) exceeds ~${Math.floor(longestCap)} tokens`,\n        { code: \"state_too_large\" },\n      );\n    }\n    if (\n      cur.length > 0 &&\n      (base + curSum + cost > allCap || cur.length >= limits.maxQuestionsPerRequest)\n    ) {\n      chunks.push(cur);\n      cur = [];\n      curSum = 0;\n    }\n    cur.push(id);\n    curSum += cost;\n  }\n  if (cur.length) chunks.push(cur);\n  return chunks;\n}\n\n// ---------------------------------------------------------------------------\n// Concurrency limiter (abortable while queued)\n// ---------------------------------------------------------------------------\n\nexport class JevLimiter {\n  private active = 0;\n  private readonly queue: Array<{ grant: () => void }> = [];\n\n  constructor(readonly max: number) {}\n\n  async run<T>(fn: () => Promise<T>, signal?: AbortSignal): Promise<T> {\n    await this.acquire(signal);\n    try {\n      return await fn();\n    } finally {\n      this.release();\n    }\n  }\n\n  private acquire(signal?: AbortSignal): Promise<void> {\n    signal?.throwIfAborted();\n    if (this.active < this.max) {\n      this.active += 1;\n      return Promise.resolve();\n    }\n    return new Promise<void>((resolve, reject) => {\n      const onAbort = () => {\n        const i = this.queue.indexOf(entry);\n        if (i >= 0) this.queue.splice(i, 1);\n        reject(signal?.reason);\n      };\n      const entry = {\n        grant: () => {\n          signal?.removeEventListener(\"abort\", onAbort);\n          resolve();\n        },\n      };\n      this.queue.push(entry);\n      signal?.addEventListener(\"abort\", onAbort, { once: true });\n    });\n  }\n\n  /** A released slot passes straight to the next waiter, so `active` never overshoots `max`. */\n  private release(): void {\n    const next = this.queue.shift();\n    if (next) next.grant();\n    else this.active -= 1;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Client\n// ---------------------------------------------------------------------------\n\nexport type JevFetch = (url: string, init: RequestInit) => Promise<Response>;\n\nexport interface JevClientOptions {\n  apiKey: string;\n  baseUrl?: string | undefined;\n  model?: string | undefined;\n  /** Per-attempt timeout. */\n  timeoutMs?: number | undefined;\n  /** Retries after the first attempt. */\n  maxRetries?: number | undefined;\n  /** Cap on a server `retry-after` hint; an interactive tool fails fast rather than sleeping 30 s. */\n  maxRetryAfterMs?: number | undefined;\n  /** Max concurrent HTTP requests from this client. */\n  concurrency?: number | undefined;\n  /** First backoff delay; doubles per attempt up to maxRetryAfterMs. */\n  retryBaseDelayMs?: number | undefined;\n  fetch?: JevFetch | undefined;\n}\n\nconst RETRYABLE_STATUS = (status: number) => status === 429 || (status >= 500 && status <= 599);\nconst AUTH_STATUS = (status: number) => status === 401 || status === 402 || status === 403;\n/** Keep-alive connections are reused for a few seconds after a request; no warm-up is needed inside that window. */\nconst WARM_WINDOW_MS = 4_000;\nconst WARM_TIMEOUT_MS = 3_000;\nconst MAX_DETAIL_CHARS = 200;\n\nexport class JevClient {\n  readonly baseUrl: string;\n  readonly model: string;\n  private readonly apiKey: string;\n  private readonly timeoutMs: number;\n  private readonly maxRetries: number;\n  private readonly maxRetryAfterMs: number;\n  private readonly retryBaseDelayMs: number;\n  private readonly fetchImpl: JevFetch;\n  private readonly limiter: JevLimiter;\n  private lastActivityAt = -Infinity;\n\n  constructor(options: JevClientOptions) {\n    if (!options.apiKey) throw new JevUnavailableError(\"Jev API key is not configured\");\n    this.apiKey = options.apiKey;\n    this.baseUrl = (options.baseUrl ?? JEV_DEFAULT_BASE_URL).replace(/\\/+$/, \"\");\n    this.model = options.model ?? JEV_DEFAULT_MODEL;\n    this.timeoutMs = options.timeoutMs ?? 10_000;\n    this.maxRetries = Math.max(0, options.maxRetries ?? 2);\n    this.maxRetryAfterMs = Math.max(0, options.maxRetryAfterMs ?? 2_000);\n    this.retryBaseDelayMs = Math.max(0, options.retryBaseDelayMs ?? 250);\n    this.limiter = new JevLimiter(Math.max(1, options.concurrency ?? 16));\n    this.fetchImpl = options.fetch ?? ((url, init) => fetch(url, init));\n  }\n\n  /**\n   * Ask many questions about one state. Splits the questions into several requests when they exceed the\n   * limits, runs them concurrently (bounded by `concurrency`) and merges the answers.\n   */\n  async ask<Q extends Record<string, JevQuestion>>(\n    state: unknown,\n    questions: Q,\n    options: JevAskOptions = {},\n  ): Promise<JevAskResult<Q>> {\n    const { signal } = options;\n    signal?.throwIfAborted();\n    const ids = Object.keys(questions);\n    if (!ids.length) throw new JevRequestError(\"Jev ask() needs at least one question\");\n    const stateTokens = estimateJevTokens(state);\n    const chunks = planChunks(\n      stateTokens,\n      ids.map((id) => [id, estimateJevTokens(questions[id])] as const),\n    );\n    const label = options.tag ? `${options.tag}: ` : \"\";\n    const results = await Promise.all(\n      chunks.map((chunk) =>\n        this.limiter.run(\n          () =>\n            this.post(\n              JSON.stringify({\n                state,\n                model: this.model,\n                questions: Object.fromEntries(chunk.map((id) => [id, questions[id]])),\n              }),\n              label,\n              signal,\n            ),\n          signal,\n        ),\n      ),\n    );\n    const answers: Record<string, JevAnswer> = {};\n    let inputTokens = 0;\n    let model = \"\";\n    results.forEach((json, i) => {\n      const got = isRecord(json.answers) ? json.answers : {};\n      for (const id of chunks[i]!) {\n        const answer = normalizeAnswer(got[id]);\n        if (!answer)\n          throw new JevUnavailableError(`${label}Jev response is missing the answer \"${id}\"`);\n        answers[id] = answer;\n      }\n      const usage = isRecord(json.usage) ? json.usage : {};\n      inputTokens += Number(usage.input_tokens ?? 0) || 0;\n      if (typeof json.model === \"string\" && json.model) model = json.model;\n    });\n    return {\n      answers: answers as JevAskResult<Q>[\"answers\"],\n      model,\n      usage: { inputTokens },\n      requests: results.length,\n      costUsd: jevCostUsd(inputTokens),\n    };\n  }\n\n  /**\n   * Open keep-alive connections before a burst of parallel requests (a cold TLS connection costs ~0.7 s).\n   * GET /healthz is free. Skipped when the client was active within the last few seconds; never throws.\n   */\n  warmUp(connections: number): void {\n    const now = Date.now();\n    if (connections <= 0 || now - this.lastActivityAt < WARM_WINDOW_MS) return;\n    this.lastActivityAt = now;\n    for (let i = 0; i < connections; i++) {\n      const timeout = AbortSignal.timeout(WARM_TIMEOUT_MS);\n      this.fetchImpl(`${this.baseUrl}/healthz`, { method: \"GET\", signal: timeout })\n        .then((res) => res.arrayBuffer())\n        .catch(() => undefined);\n    }\n  }\n\n  /** One HTTP request with retries. Returns the parsed JSON body of a 2xx response. */\n  private async post(\n    body: string,\n    label: string,\n    signal: AbortSignal | undefined,\n  ): Promise<Record<string, unknown>> {\n    const url = `${this.baseUrl}/v1/systemone`;\n    const headers = { \"content-type\": \"application/json\", authorization: `Bearer ${this.apiKey}` };\n    let lastError = \"unknown error\";\n    let lastStatus: number | undefined;\n    for (let attempt = 0; attempt <= this.maxRetries; attempt++) {\n      signal?.throwIfAborted();\n      const attemptSignal = withTimeout(signal, this.timeoutMs);\n      let delay = this.backoff(attempt);\n      let response: { res: Response; text: string } | null = null;\n      try {\n        const res = await this.fetchImpl(url, {\n          method: \"POST\",\n          headers,\n          body,\n          signal: attemptSignal.signal,\n        });\n        response = { res, text: await res.text() };\n      } catch (error) {\n        if (signal?.aborted) throw signal.reason;\n        lastStatus = undefined;\n        lastError = attemptSignal.timedOut()\n          ? `timed out after ${this.timeoutMs} ms`\n          : describeError(error);\n      } finally {\n        attemptSignal.dispose();\n        this.lastActivityAt = Date.now();\n      }\n      if (response) {\n        const { res, text } = response;\n        if (res.ok) {\n          const json = parseJson(text);\n          if (!isRecord(json))\n            throw new JevUnavailableError(`${label}Jev returned an invalid response body`);\n          return json;\n        }\n        const detail = errorDetail(text);\n        const suffix = detail.message ? `: ${detail.message}` : \"\";\n        if (AUTH_STATUS(res.status)) {\n          const what = res.status === 402 ? \"billing or credits\" : \"authentication\";\n          throw new JevUnavailableError(\n            `${label}Jev ${what} failed (HTTP ${res.status}${suffix})`,\n            errorOptions(res.status, detail.code),\n          );\n        }\n        if (!RETRYABLE_STATUS(res.status)) {\n          throw new JevRequestError(\n            `${label}Jev rejected the request (HTTP ${res.status}${suffix})`,\n            errorOptions(res.status, detail.code),\n          );\n        }\n        lastStatus = res.status;\n        lastError = `HTTP ${res.status}${suffix}`;\n        const retryAfter = parseRetryAfter(res.headers.get(\"retry-after\"));\n        if (retryAfter !== null) delay = Math.min(retryAfter, this.maxRetryAfterMs);\n      }\n      if (attempt < this.maxRetries) await sleep(delay, signal);\n    }\n    throw new JevUnavailableError(\n      `${label}Jev unavailable after ${this.maxRetries + 1} attempts (${lastError})`,\n      lastStatus === undefined ? {} : { status: lastStatus },\n    );\n  }\n\n  private backoff(attempt: number): number {\n    const base = Math.min(this.maxRetryAfterMs, this.retryBaseDelayMs * 2 ** attempt);\n    return Math.round(base * (1 - Math.random() * 0.25));\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\nfunction parseJson(text: string): unknown {\n  try {\n    return text ? JSON.parse(text) : null;\n  } catch {\n    return null;\n  }\n}\n\nfunction normalizeAnswer(raw: unknown): JevAnswer | null {\n  if (!isRecord(raw)) return null;\n  if (raw.type === \"noul\") {\n    return { type: \"noul\", probability: typeof raw.noul === \"number\" ? raw.noul : Number.NaN };\n  }\n  if (raw.type === \"choice\") {\n    const answer: JevChoiceAnswer = {\n      type: \"choice\",\n      option: String(raw.choice ?? raw.option ?? \"\"),\n    };\n    if (isRecord(raw.probabilities))\n      answer.probabilities = raw.probabilities as Record<string, number>;\n    if (typeof raw.confidence === \"number\") answer.confidence = raw.confidence;\n    return answer;\n  }\n  if (raw.type === \"score\")\n    return { ...raw, type: \"score\", score: Number(raw.score) } as JevScoreAnswer;\n  return null;\n}\n\nfunction errorOptions(status: number, code: string | undefined): { status: number; code?: string } {\n  return code === undefined ? { status } : { status, code };\n}\n\n/** Best-effort code and message from an error body; bounded so a large body never floods a message. */\nfunction errorDetail(text: string): { code: string | undefined; message: string } {\n  const json = parseJson(text);\n  const codes: string[] = [];\n  let message = \"\";\n  const visit = (value: unknown) => {\n    if (typeof value === \"string\") {\n      if (!message) message = value;\n      return;\n    }\n    if (Array.isArray(value)) {\n      if (!message) message = JSON.stringify(value);\n      return;\n    }\n    if (!isRecord(value)) return;\n    for (const key of [\"code\", \"type\"]) {\n      const v = value[key];\n      if (typeof v === \"string\" && v !== \"error\") codes.push(v);\n    }\n    for (const key of [\"detail\", \"error\", \"message\", \"msg\"]) if (key in value) visit(value[key]);\n  };\n  if (json === null) message = text.trim();\n  else visit(json);\n  let code = codes[0];\n  if (!code && /^[a-z][a-z0-9_]{2,60}$/.test(message)) code = message;\n  return { code, message: message.replace(/\\s+/g, \" \").slice(0, MAX_DETAIL_CHARS) };\n}\n\nfunction parseRetryAfter(header: string | null): number | null {\n  if (!header) return null;\n  const secs = Number(header);\n  if (Number.isFinite(secs)) return Math.max(0, secs * 1000);\n  const at = Date.parse(header);\n  return Number.isFinite(at) ? Math.max(0, at - Date.now()) : null;\n}\n\nfunction describeError(error: unknown): string {\n  const text = error instanceof Error ? `${error.name}: ${error.message}` : String(error);\n  return text.slice(0, MAX_DETAIL_CHARS);\n}\n\n/** A per-attempt signal that fires on the caller's abort or after timeoutMs (no AbortSignal.any: Node 18). */\nfunction withTimeout(\n  parent: AbortSignal | undefined,\n  timeoutMs: number,\n): { signal: AbortSignal; timedOut: () => boolean; dispose: () => void } {\n  const controller = new AbortController();\n  let timedOut = false;\n  const onAbort = () => controller.abort(parent?.reason);\n  const timer = setTimeout(() => {\n    timedOut = true;\n    controller.abort(new JevUnavailableError(`Jev request timed out after ${timeoutMs} ms`));\n  }, timeoutMs);\n  if (parent?.aborted) controller.abort(parent.reason);\n  else parent?.addEventListener(\"abort\", onAbort, { once: true });\n  return {\n    signal: controller.signal,\n    timedOut: () => timedOut,\n    dispose: () => {\n      clearTimeout(timer);\n      parent?.removeEventListener(\"abort\", onAbort);\n    },\n  };\n}\n\nfunction sleep(ms: number, signal: AbortSignal | undefined): Promise<void> {\n  if (ms <= 0) return Promise.resolve();\n  return new Promise<void>((resolve, reject) => {\n    const onAbort = () => {\n      clearTimeout(timer);\n      reject(signal?.reason);\n    };\n    const timer = setTimeout(() => {\n      signal?.removeEventListener(\"abort\", onAbort);\n      resolve();\n    }, ms);\n    if (signal?.aborted) onAbort();\n    else signal?.addEventListener(\"abort\", onAbort, { once: true });\n  });\n}\n","/**\n * In-process circuit breaker for Jev. Consecutive JevUnavailableError failures open it for a cooldown, so a\n * Jev outage costs one fast refusal per call instead of a full retry cycle. After the cooldown the breaker is\n * half-open and tryAcquire() admits exactly one trial call at a time.\n *\n * Every admitted call gets a lease and settles it exactly once:\n * - recordSuccess(lease) from any call closes the breaker, because any success proves Jev works.\n * - recordFailure(unavailable, now, lease) from any call counts, and reopens a half-open breaker at once.\n * - release(lease) (the call never reached Jev) or recordFailure with another error (a rejected request, a\n *   workspace failure, an abort) neither counts nor resets the streak. It ends the trial only when that\n *   lease is the trial, so a call admitted while closed cannot free the slot of a trial running now.\n * isOpen() and status() are for metrics and diagnostics. Do not use them to decide which tools a turn is\n * offered: that list is part of the model's cached prompt prefix and must not change with transient health.\n * The worker keeps one breaker per process.\n */\nimport { JevUnavailableError } from \"./client\";\n\nexport interface JevCircuitBreakerOptions {\n  /** Consecutive unavailable failures that open the breaker. */\n  failureThreshold?: number | undefined;\n  /** Cooldown after an outage-style failure. */\n  cooldownMs?: number | undefined;\n  /** Cooldown when the opening failure was HTTP 401/402/403 (key or billing problem). */\n  authCooldownMs?: number | undefined;\n  /** A half-open trial that has not ended after this long no longer blocks the next trial. */\n  trialTimeoutMs?: number | undefined;\n}\n\n/** One admitted call. Leases are matched by identity, so only the issued object ends its trial. */\nexport interface JevCircuitLease {\n  readonly id: number;\n  /** This call is the half-open trial. */\n  readonly trial: boolean;\n}\n\nexport type JevCircuitState = \"closed\" | \"open\" | \"half_open\";\n\nexport interface JevCircuitStatus {\n  state: JevCircuitState;\n  consecutiveFailures: number;\n  /** Epoch ms until which calls are refused; null when not open. */\n  openUntil: number | null;\n  /** Half-open and the one trial call is running. */\n  trialInFlight: boolean;\n  lastFailure: { message: string; status: number | null; at: number } | null;\n}\n\nexport class JevCircuitBreaker {\n  private readonly failureThreshold: number;\n  private readonly cooldownMs: number;\n  private readonly authCooldownMs: number;\n  private readonly trialTimeoutMs: number;\n  private consecutiveFailures = 0;\n  private openUntil: number | null = null;\n  private trial: { lease: JevCircuitLease; startedAt: number } | null = null;\n  private nextLeaseId = 1;\n  private lastFailure: JevCircuitStatus[\"lastFailure\"] = null;\n\n  constructor(options: JevCircuitBreakerOptions = {}) {\n    this.failureThreshold = Math.max(1, options.failureThreshold ?? 3);\n    this.cooldownMs = options.cooldownMs ?? 5 * 60_000;\n    this.authCooldownMs = options.authCooldownMs ?? 30 * 60_000;\n    // Longer than one Jev retry cycle at the largest allowed request timeout (3 attempts of up to\n    // 120 s, OPENGENI_JEV_REQUEST_TIMEOUT_MS) plus backoff and sandbox recall, so a slow trial is not\n    // mistaken for a stuck one and joined by a second trial.\n    this.trialTimeoutMs = options.trialTimeoutMs ?? 10 * 60_000;\n  }\n\n  /** True while calls should be refused without contacting Jev (the cooldown is running). */\n  isOpen(now: number = Date.now()): boolean {\n    return this.openUntil !== null && now < this.openUntil;\n  }\n\n  /**\n   * Admit one call and return its lease, or null when refused. Closed: always. Open: never. Half-open:\n   * only the first caller, as the trial, until its lease is settled or it has run for trialTimeoutMs, so\n   * a trial that never ends cannot block the tool for good.\n   */\n  tryAcquire(now: number = Date.now()): JevCircuitLease | null {\n    if (this.openUntil === null) return this.issue(false);\n    if (now < this.openUntil) return null;\n    if (this.trial !== null && now - this.trial.startedAt < this.trialTimeoutMs) return null;\n    const lease = this.issue(true);\n    this.trial = { lease, startedAt: now };\n    return lease;\n  }\n\n  /** End an admitted call that did not contact Jev, so its outcome says nothing about Jev. */\n  release(lease: JevCircuitLease): void {\n    if (this.trial !== null && this.trial.lease === lease) this.trial = null;\n  }\n\n  /** Any call's success proves Jev works, so the lease does not change the outcome. */\n  recordSuccess(_lease?: JevCircuitLease | null): void {\n    this.consecutiveFailures = 0;\n    this.openUntil = null;\n    this.trial = null;\n  }\n\n  /** Settle a failed call. A failure without a lease counts the same but never ends a trial. */\n  recordFailure(error: unknown, now: number = Date.now(), lease?: JevCircuitLease | null): void {\n    if (!(error instanceof JevUnavailableError)) {\n      if (lease) this.release(lease);\n      return;\n    }\n    const halfOpen = this.openUntil !== null && now >= this.openUntil;\n    this.consecutiveFailures += 1;\n    this.lastFailure = { message: error.message, status: error.status ?? null, at: now };\n    if (halfOpen || this.consecutiveFailures >= this.failureThreshold) {\n      const auth = error.status === 401 || error.status === 402 || error.status === 403;\n      this.openUntil = now + (auth ? this.authCooldownMs : this.cooldownMs);\n      // A new cooldown starts: whatever trial was running no longer blocks the next one.\n      this.trial = null;\n    }\n  }\n\n  status(now: number = Date.now()): JevCircuitStatus {\n    const state: JevCircuitState =\n      this.openUntil === null ? \"closed\" : now < this.openUntil ? \"open\" : \"half_open\";\n    return {\n      state,\n      consecutiveFailures: this.consecutiveFailures,\n      openUntil: state === \"open\" ? this.openUntil : null,\n      trialInFlight:\n        state === \"half_open\" &&\n        this.trial !== null &&\n        now - this.trial.startedAt < this.trialTimeoutMs,\n      lastFailure: this.lastFailure,\n    };\n  }\n\n  private issue(trial: boolean): JevCircuitLease {\n    return Object.freeze({ id: this.nextLeaseId++, trial });\n  }\n}\n","/**\n * Every code_search threshold, budget and cap in one place. The defaults are scout-0.3.1's Jev\n * configuration, tuned on the E1 DEV split (2026-09-24); change them only with a new evaluation.\n */\n\nexport interface CodeSearchConfig {\n  recall: {\n    /** Candidate files passed to wave 1. */\n    maxCandidates: number;\n    /** Matching lines kept per file per keyword. */\n    maxMatchesPerFile: number;\n    /** rg --max-filesize (bytes); also the read cap for candidate files. */\n    maxFileBytes: number;\n    /** rg --max-columns: lines longer than this (minified / generated / data blobs) are ignored entirely. */\n    maxLineColumns: number;\n    /** Multiplier for test files unless the question is about tests. */\n    testWeight: number;\n    /** Path-name match bonus as a fraction of the keyword's IDF. */\n    pathBonus: number;\n    /** Extra weight per log(1 + matching lines) (tie breaker). */\n    hitCountWeight: number;\n    /** Single plain words up to this length are searched with a leading word boundary (`\\bturn`, not `return`). */\n    shortWordMaxLen: number;\n    /** Compound keywords with zero hits retry their 2-part fragments (e.g. shouldCompactContext -> compactContext). */\n    fragmentFallback: boolean;\n    /** If paths restrict the search and fewer candidates than this are found, widen to the whole workspace. */\n    minCandidatesBeforeWiden: number;\n    /** Extra rg exclude globs (on top of the built-in list). */\n    extraExcludes: string[];\n    /** Also search hidden files/dirs (.github/workflows, .env.example, .changeset); .git is always excluded. */\n    searchHidden: boolean;\n    /** Multiplier for release notes (CHANGELOG*, .changeset/) unless the question is about history/releases. */\n    changelogWeight: number;\n    /** Time limit per ripgrep call; a timed-out search continues with partial output. */\n    ripgrepTimeoutMs: number;\n  };\n  wave1: {\n    filesPerRequest: number;\n    hitLinesPerFile: number;\n    hitLineChars: number;\n    /** Hard cap on files selected for windowing. */\n    maxFiles: number;\n    /** Always take at least this many files by judge score (guards against an over-strict T1). */\n    minFiles: number;\n    /** Always keep the top-N lexical files (fusion guard against judge misses). */\n    lexicalGuard: number;\n  };\n  wave2: {\n    windowsPerFile: number;\n    /** How many of a file's strongest hit lines seed windows (before merging/splitting). */\n    seedHitsPerFile: number;\n    /** Max lines to walk up from a hit looking for the enclosing declaration. */\n    maxUp: number;\n    /** Max lines below a hit kept in its window. */\n    maxDown: number;\n    /** Windows longer than this are split around hit clusters. */\n    maxWindowLines: number;\n    /** Fallback context when no enclosing declaration is found within maxUp. */\n    fallbackBefore: number;\n    fallbackAfter: number;\n    /** Merge windows whose gap is at most this many lines. */\n    mergeGap: number;\n    /** Windows shorter than this get surrounding context. */\n    minWindowLines: number;\n    passagesPerRequest: number;\n    /** Max passage text chars per Jev request. */\n    maxRequestChars: number;\n    /** Max passages verified in wave 2. */\n    maxPassages: number;\n    /** Code lines longer than this are cut with an explicit marker. */\n    maxLineChars: number;\n    /** Same for prose files (md/mdx/txt/rst), which often have single-line paragraphs of 1-6k chars. */\n    maxProseLineChars: number;\n    /** Windows whose rendered text is longer are split into whole-line sub-windows around their hits. */\n    maxWindowChars: number;\n    /** Same for markdown (sections are long, paragraphs independent). */\n    maxProseWindowChars: number;\n  };\n  wave3: {\n    enabled: boolean;\n    maxLeadCandidates: number;\n    maxLeadsFollowed: number;\n    /** Leads are extracted from at most this many of the most relevant passages (all >= T2). */\n    seedPassages: number;\n    defsPerLead: number;\n  };\n  status: {\n    enabled: boolean;\n    /** Max evidence chars sent to the status check (best passages first); keeps the request under Jev's 32k-token limit. */\n    maxEvidenceChars: number;\n    /** sufficient: overall >= hi and every sub-question >= hi. */\n    hi: number;\n    /** partial: overall >= lo or any sub-question >= hi. */\n    lo: number;\n  };\n  pack: {\n    charsPerToken: number;\n    /** Include passages below T2 only if fewer than this many passed (top by score, above minRelevance). */\n    minPassages: number;\n    minRelevance: number;\n    /** Fill the remaining budget with passages below T2 (ranked). */\n    fillBudget: boolean;\n    moreCandidates: number;\n    leadsNotFollowed: number;\n    /** A trimmed passage must keep at least this many lines. */\n    minTrimLines: number;\n    /** File-diversity penalty: a second passage of one file must beat the first passage of another by this margin. */\n    filePenalty: number;\n    /** Passages whose rendered block is longer are trimmed around their hits to this many chars (0 = off). */\n    maxPassageChars: number;\n    /** Multiplier on the rel used for pack ORDERING of release-note passages; 1 = off. */\n    changelogPrior: number;\n    /** Same for prose docs (md/mdx/txt/rst, not release notes); 1 = off. */\n    docPrior: number;\n    /** Same for test files unless the question is about tests; 1 = off. */\n    testPrior: number;\n    /** Pack ordering score = (rel + lexWeight x lexical passage score) x prior. */\n    lexWeight: number;\n  };\n  jev: {\n    /** Inline the question text in every Jev question when it is at most this long; else reference `question`. */\n    inlineQuestionMaxChars: number;\n    /** Wave 1: put the true/false rubric on every file question instead of once in the state. */\n    fileCriteriaPerQuestion: boolean;\n    /** Keep-alive connections opened while recall runs (0 = off). */\n    warmConnections: number;\n  };\n  thresholds: {\n    /** Wave 1: file triage floor (p >= T1 selects, up to maxFiles). */\n    T1: number;\n    /** Wave 2: passage relevance floor for inclusion in the pack, lead seeding and sub-question coverage. */\n    T2: number;\n    /** Wave 3: lead floor (p >= T3 is followed, up to maxLeadsFollowed). */\n    T3: number;\n  };\n}\n\nexport type CodeSearchConfigOverride = {\n  [K in keyof CodeSearchConfig]?: Partial<CodeSearchConfig[K]>;\n};\n\nexport const DEFAULT_CODE_SEARCH_CONFIG: Readonly<CodeSearchConfig> = deepFreeze({\n  recall: {\n    maxCandidates: 240,\n    maxMatchesPerFile: 25,\n    maxFileBytes: 4_000_000,\n    maxLineColumns: 8000,\n    testWeight: 0.6,\n    pathBonus: 0.5,\n    hitCountWeight: 0.1,\n    shortWordMaxLen: 5,\n    fragmentFallback: true,\n    minCandidatesBeforeWiden: 5,\n    extraExcludes: [],\n    searchHidden: true,\n    changelogWeight: 0.6,\n    ripgrepTimeoutMs: 30_000,\n  },\n  wave1: {\n    filesPerRequest: 60,\n    hitLinesPerFile: 3,\n    hitLineChars: 160,\n    maxFiles: 16,\n    minFiles: 8,\n    lexicalGuard: 5,\n  },\n  wave2: {\n    windowsPerFile: 5,\n    seedHitsPerFile: 24,\n    maxUp: 40,\n    maxDown: 120,\n    maxWindowLines: 150,\n    fallbackBefore: 10,\n    fallbackAfter: 30,\n    mergeGap: 2,\n    minWindowLines: 12,\n    passagesPerRequest: 4,\n    maxRequestChars: 24_000,\n    maxPassages: 80,\n    maxLineChars: 400,\n    maxProseLineChars: 1600,\n    maxWindowChars: 8000,\n    maxProseWindowChars: 4000,\n  },\n  wave3: {\n    enabled: true,\n    maxLeadCandidates: 60,\n    maxLeadsFollowed: 6,\n    seedPassages: 12,\n    defsPerLead: 1,\n  },\n  status: { enabled: true, maxEvidenceChars: 60_000, hi: 0.7, lo: 0.4 },\n  pack: {\n    charsPerToken: 3.2,\n    minPassages: 4,\n    minRelevance: 0.1,\n    fillBudget: false,\n    moreCandidates: 10,\n    leadsNotFollowed: 8,\n    minTrimLines: 15,\n    filePenalty: 0.1,\n    maxPassageChars: 3200,\n    changelogPrior: 0.5,\n    docPrior: 0.85,\n    testPrior: 1,\n    lexWeight: 0,\n  },\n  jev: {\n    inlineQuestionMaxChars: 600,\n    fileCriteriaPerQuestion: false,\n    warmConnections: 12,\n  },\n  // calibrated on the DEV split from the observed score distributions (relevant files mostly 0.6-0.9;\n  // minFiles and the lexical guard keep recall when few files pass)\n  thresholds: { T1: 0.6, T2: 0.5, T3: 0.5 },\n});\n\n/** Defaults with a partial override merged on top (unknown keys and wrong types are rejected), validated. */\nexport function codeSearchConfig(override: CodeSearchConfigOverride = {}): CodeSearchConfig {\n  const base = structuredClone(DEFAULT_CODE_SEARCH_CONFIG) as CodeSearchConfig;\n  const out = base as unknown as Record<string, Record<string, unknown>>;\n  for (const [section, values] of Object.entries(override as Record<string, unknown>)) {\n    const target = out[section];\n    if (!target) throw new Error(`unknown code_search config section: ${section}`);\n    if (!isPlainObject(values)) throw new Error(`code_search config ${section}: expected object`);\n    for (const [key, value] of Object.entries(values)) {\n      if (!(key in target)) throw new Error(`unknown code_search config key: ${section}.${key}`);\n      const current = target[key];\n      if (Array.isArray(current) ? !Array.isArray(value) : typeof current !== typeof value) {\n        throw new Error(\n          `code_search config ${section}.${key}: expected ${Array.isArray(current) ? \"array\" : typeof current}`,\n        );\n      }\n      target[key] = value;\n    }\n  }\n  validateCodeSearchConfig(base);\n  return base;\n}\n\nexport function validateCodeSearchConfig(c: CodeSearchConfig): void {\n  const probs: string[] = [];\n  for (const [k, v] of Object.entries(c.thresholds))\n    if (!(v >= 0 && v <= 1)) probs.push(`thresholds.${k} must be in [0,1]`);\n  if (c.wave1.maxFiles < 1) probs.push(\"wave1.maxFiles must be >= 1\");\n  if (c.wave1.minFiles > c.wave1.maxFiles) probs.push(\"wave1.minFiles must be <= wave1.maxFiles\");\n  if (c.wave1.filesPerRequest < 1 || c.wave1.filesPerRequest > 250)\n    probs.push(\"wave1.filesPerRequest must be 1..250\");\n  if (c.wave2.passagesPerRequest < 1) probs.push(\"wave2.passagesPerRequest must be >= 1\");\n  if (c.wave2.maxWindowLines < 10) probs.push(\"wave2.maxWindowLines must be >= 10\");\n  if (c.wave2.maxWindowChars < 4 * c.wave2.maxLineChars)\n    probs.push(\"wave2.maxWindowChars must be >= 4 x wave2.maxLineChars\");\n  if (c.wave2.maxProseWindowChars < 2 * c.wave2.maxProseLineChars + 200) {\n    probs.push(\"wave2.maxProseWindowChars must be >= 2 x wave2.maxProseLineChars + 200\");\n  }\n  if (c.wave3.maxLeadCandidates > 250) probs.push(\"wave3.maxLeadCandidates must be <= 250\");\n  if (!(c.status.lo <= c.status.hi)) probs.push(\"status.lo must be <= status.hi\");\n  if (c.pack.charsPerToken <= 0) probs.push(\"pack.charsPerToken must be > 0\");\n  if (c.pack.filePenalty < 0) probs.push(\"pack.filePenalty must be >= 0\");\n  if (c.pack.maxPassageChars !== 0 && c.pack.maxPassageChars < 600)\n    probs.push(\"pack.maxPassageChars must be 0 or >= 600\");\n  for (const k of [\"changelogPrior\", \"docPrior\", \"testPrior\"] as const) {\n    if (!(c.pack[k] > 0 && c.pack[k] <= 1)) probs.push(`pack.${k} must be in (0,1]`);\n  }\n  if (!(c.pack.lexWeight >= 0)) probs.push(\"pack.lexWeight must be >= 0\");\n  if (!(c.recall.changelogWeight > 0 && c.recall.changelogWeight <= 1))\n    probs.push(\"recall.changelogWeight must be in (0,1]\");\n  if (!(c.recall.ripgrepTimeoutMs > 0)) probs.push(\"recall.ripgrepTimeoutMs must be > 0\");\n  if (probs.length) throw new Error(`invalid code_search config: ${probs.join(\"; \")}`);\n}\n\nfunction isPlainObject(x: unknown): x is Record<string, unknown> {\n  return typeof x === \"object\" && x !== null && !Array.isArray(x);\n}\n\nfunction deepFreeze<T>(value: T): T {\n  if (typeof value === \"object\" && value !== null) {\n    for (const v of Object.values(value)) deepFreeze(v);\n    Object.freeze(value);\n  }\n  return value;\n}\n","/**\n * judge.ts - the only place where scores come from: Jev answers one probability per judged item.\n *\n * All Jev wording lives in PROMPTS below (one place to review). Design rules followed:\n *  - one state + many narrow Nouls per request (fan-out); one Noul per candidate (multi-select)\n *  - criteria text is explicit (in the state for 60-file triage batches, per question for passages)\n *  - the literal question text is inlined in every question (no `collections[i]`-style indirection)\n *  - state holds only the candidates being judged (filtered by code first)\n *  - no counting, math or dates asked of Jev; code combines answers\n * A Jev failure is not replaced by lexical scores: it propagates and the whole search fails.\n */\nimport { noul, type JevAnswer, type JevClient, type JevNoulQuestion } from \"../client\";\nimport type { CodeSearchConfig } from \"./config\";\n\nexport interface JudgeContext {\n  question: string;\n  subQuestions: string[];\n}\n\nexport interface FileItem {\n  id: string;\n  path: string;\n  /** path + best hit lines, as shown to the judge */\n  descriptor: string;\n  /** Normalized lexical score; used only if Jev returns no usable number for this item. */\n  lex: number;\n}\n\nexport interface PassageItem {\n  id: string;\n  path: string;\n  start: number;\n  end: number;\n  /** rendered `N| text` */\n  text: string;\n  label?: string | undefined;\n  lex: number;\n  lexCov: number[];\n}\n\nexport interface LeadItem {\n  id: string;\n  name: string;\n  seenAt: string;\n  context: string;\n  lex: number;\n}\n\nexport interface PassageScore {\n  rel: number;\n  cov: number[];\n}\n\nexport interface StatusScore {\n  overall: number;\n  subs: number[];\n}\n\nexport interface StageStats {\n  requests: number;\n  inputTokens: number;\n  costUsd: number;\n  ms: number;\n}\n\nexport type JudgeEvent = (stage: string, data: Record<string, unknown>) => void;\n\n// ---------------------------------------------------------------------------\n// Prompts (all Jev wording; identical to scout-0.3.1)\n// ---------------------------------------------------------------------------\n\nexport const PROMPTS = {\n  fileTask:\n    \"Code search triage for a software repository. A developer asked `question`. `files` lists candidate files found by keyword search; each entry is the file path followed by up to 3 matching lines as `line: text`. Judge each file independently by its path and matching lines.\",\n  fileCriteria: {\n    yes: \"Reading this file would likely help answer the question: it probably implements, decides, computes, configures, enforces or documents the asked behavior. A doc or design note that explains the behavior counts.\",\n    no: \"The file probably only mentions the same words, imports or passes values through, belongs to an unrelated feature that shares keywords, or is a test that is not about the asked behavior.\",\n  },\n  fileQuestion: (id: string, path: string, q: string) =>\n    `Would reading file \\`files.${id}\\` (${path}) help answer the question${q}? Apply \\`criteria\\`.`,\n  fileQuestionPerQ: (id: string, path: string, q: string) =>\n    `Would reading file \\`files.${id}\\` (${path}) help answer the question${q}?`,\n\n  passageTask:\n    \"Evidence check for a question about a software repository. Each entry in `passages` is a verbatim excerpt of one repository file with its original line numbers (`N| text`). `in` names the enclosing declaration when the excerpt starts inside one. Judge each passage on its own content only.\",\n  passageQuestion: (id: string, path: string, a: number, b: number, q: string) =>\n    `Does \\`passages.${id}\\` (${path} lines ${a}-${b}) contain code or text needed to answer the question${q}?`,\n  passageCriteria: {\n    true: \"The passage implements, decides, computes, configures, enforces or documents part of the asked behavior. A helper that performs one asked step counts, and so does a doc passage that states the behavior.\",\n    false:\n      \"The passage only mentions, imports, calls or passes through names related to the question, is a test or type declaration that does not show the behavior, or is unrelated code that shares keywords.\",\n  },\n  coverageQuestion: (id: string, path: string, a: number, b: number, sub: string) =>\n    `Does \\`passages.${id}\\` (${path} lines ${a}-${b}) show the answer to this part of the question: \"${sub}\"?`,\n  coverageCriteria: {\n    true: \"The passage itself states or implements the answer to this part.\",\n    false:\n      \"The passage does not address this part, or only mentions it without showing the answer.\",\n  },\n\n  leadTask:\n    \"Follow-up selection for a question about a software repository. Evidence passages already found reference the identifiers in `leads`, whose definitions have not been read yet. Each lead shows the identifier, where it was seen, and the line it appears on.\",\n  leadCriteria: {\n    yes: \"The definition likely computes, decides, configures or enforces part of the asked behavior, or holds a constant, setting or rule that the answer depends on.\",\n    no: \"It is a generic helper (logging, formatting, errors, type plumbing, database or HTTP plumbing) or it is unrelated to the question.\",\n  },\n  leadQuestion: (id: string, name: string, q: string) =>\n    `Would reading where \\`${name}\\` (\\`leads.${id}\\`) is defined help answer the question${q}? Apply \\`criteria\\`.`,\n\n  statusTask:\n    \"Sufficiency check. `evidence` is a set of verbatim excerpts of repository files (with original line numbers) collected to answer `question`.\",\n  statusQuestion: (q: string) =>\n    `Do the \\`evidence\\` passages show the answer to the question${q}?`,\n  statusSubQuestion: (sub: string) =>\n    `Do the \\`evidence\\` passages show the answer to this part of the question: \"${sub}\"?`,\n  statusCriteria: {\n    true: \"Together the passages state or implement the answer concretely enough to cite file and line.\",\n    false:\n      \"Some part of the answer is missing: the passages only mention the topic, or the deciding code is elsewhere.\",\n  },\n};\n\nfunction inlineQ(question: string, maxChars: number): string {\n  return question.length <= maxChars ? `: \"${question}\"` : \" in `question`\";\n}\n\nfunction withSubs(ctx: JudgeContext): Record<string, unknown> {\n  return ctx.subQuestions.length\n    ? { sub_questions: Object.fromEntries(ctx.subQuestions.map((s, i) => [`s${i + 1}`, s])) }\n    : {};\n}\n\n// ---------------------------------------------------------------------------\n// Request builders (exported for tests)\n// ---------------------------------------------------------------------------\n\nexport function buildFileRequest(items: FileItem[], ctx: JudgeContext, cfg: CodeSearchConfig) {\n  const q = inlineQ(ctx.question, cfg.jev.inlineQuestionMaxChars);\n  // default: the rubric is stated once in the state and referenced (~65% fewer question tokens);\n  // fileCriteriaPerQuestion puts it on every Noul instead\n  const perQ = cfg.jev.fileCriteriaPerQuestion;\n  const state = {\n    task: PROMPTS.fileTask,\n    question: ctx.question,\n    ...withSubs(ctx),\n    ...(perQ ? {} : { criteria: PROMPTS.fileCriteria }),\n    files: Object.fromEntries(items.map((f) => [f.id, f.descriptor])),\n  };\n  const questions: Record<string, JevNoulQuestion> = Object.fromEntries(\n    items.map((f) => [\n      f.id,\n      perQ\n        ? noul(PROMPTS.fileQuestionPerQ(f.id, f.path, q), {\n            true: PROMPTS.fileCriteria.yes,\n            false: PROMPTS.fileCriteria.no,\n          })\n        : noul(PROMPTS.fileQuestion(f.id, f.path, q)),\n    ]),\n  );\n  return { state, questions };\n}\n\nexport function buildPassageRequest(\n  items: PassageItem[],\n  ctx: JudgeContext,\n  cfg: CodeSearchConfig,\n) {\n  const q = inlineQ(ctx.question, cfg.jev.inlineQuestionMaxChars);\n  const state = {\n    task: PROMPTS.passageTask,\n    question: ctx.question,\n    ...withSubs(ctx),\n    passages: Object.fromEntries(\n      items.map((p) => [\n        p.id,\n        {\n          file: p.path,\n          lines: `${p.start}-${p.end}`,\n          ...(p.label ? { in: p.label } : {}),\n          text: p.text,\n        },\n      ]),\n    ),\n  };\n  const questions: Record<string, JevNoulQuestion> = {};\n  for (const p of items) {\n    questions[`rel::${p.id}`] = noul(\n      PROMPTS.passageQuestion(p.id, p.path, p.start, p.end, q),\n      PROMPTS.passageCriteria,\n    );\n    ctx.subQuestions.forEach((sub, j) => {\n      questions[`cov::${p.id}::${j}`] = noul(\n        PROMPTS.coverageQuestion(p.id, p.path, p.start, p.end, sub),\n        PROMPTS.coverageCriteria,\n      );\n    });\n  }\n  return { state, questions };\n}\n\nexport function buildLeadRequest(items: LeadItem[], ctx: JudgeContext, cfg: CodeSearchConfig) {\n  const q = inlineQ(ctx.question, cfg.jev.inlineQuestionMaxChars);\n  const state = {\n    task: PROMPTS.leadTask,\n    question: ctx.question,\n    ...withSubs(ctx),\n    criteria: PROMPTS.leadCriteria,\n    leads: Object.fromEntries(\n      items.map((l) => [l.id, `${l.name}  (seen at ${l.seenAt})  ${l.context}`]),\n    ),\n  };\n  const questions: Record<string, JevNoulQuestion> = Object.fromEntries(\n    items.map((l) => [l.id, noul(PROMPTS.leadQuestion(l.id, l.name, q))]),\n  );\n  return { state, questions };\n}\n\nexport function buildStatusRequest(evidence: string, ctx: JudgeContext, cfg: CodeSearchConfig) {\n  const q = inlineQ(ctx.question, cfg.jev.inlineQuestionMaxChars);\n  const state = { task: PROMPTS.statusTask, question: ctx.question, ...withSubs(ctx), evidence };\n  const questions: Record<string, JevNoulQuestion> = {\n    overall: noul(PROMPTS.statusQuestion(q), PROMPTS.statusCriteria),\n  };\n  ctx.subQuestions.forEach((sub, j) => {\n    questions[`sub::${j}`] = noul(PROMPTS.statusSubQuestion(sub), PROMPTS.statusCriteria);\n  });\n  return { state, questions };\n}\n\n/** Group passages into requests: consecutive (same-file first) up to perRequest items and maxChars of text. */\nexport function chunkPassages(\n  items: PassageItem[],\n  perRequest: number,\n  maxChars: number,\n): PassageItem[][] {\n  const out: PassageItem[][] = [];\n  let cur: PassageItem[] = [];\n  let chars = 0;\n  for (const p of items) {\n    const c = p.text.length;\n    if (cur.length && (cur.length >= perRequest || chars + c > maxChars)) {\n      out.push(cur);\n      cur = [];\n      chars = 0;\n    }\n    cur.push(p);\n    chars += c;\n  }\n  if (cur.length) out.push(cur);\n  return out;\n}\n\n/** Split into the fewest groups of at most n items, as equal in size as possible (69 -> 35 + 34, not 60 + 9). */\nexport function chunkEven<T>(xs: T[], n: number): T[][] {\n  if (!xs.length) return [];\n  const groups = Math.ceil(xs.length / n);\n  const size = Math.ceil(xs.length / groups);\n  return chunk(xs, size);\n}\n\nfunction chunk<T>(xs: T[], n: number): T[][] {\n  const out: T[][] = [];\n  for (let i = 0; i < xs.length; i += n) out.push(xs.slice(i, i + n));\n  return out;\n}\n\nconst noulOf = (a: JevAnswer | undefined): number =>\n  a && a.type === \"noul\" && Number.isFinite(a.probability) ? a.probability : Number.NaN;\n\nfunction orLex(p: number, lex: number): number {\n  return Number.isFinite(p) ? p : lex;\n}\n\n// ---------------------------------------------------------------------------\n// Jev judge\n// ---------------------------------------------------------------------------\n\nexport class JevJudge {\n  private readonly stageStats: Record<string, StageStats> = {};\n  private jevModel: string | null = null;\n\n  constructor(\n    private readonly o: {\n      client: JevClient;\n      config: CodeSearchConfig;\n      signal: AbortSignal;\n      onEvent?: JudgeEvent | undefined;\n    },\n  ) {}\n\n  stats(): Record<string, StageStats> {\n    return this.stageStats;\n  }\n\n  model(): string | null {\n    return this.jevModel;\n  }\n\n  private stat(stage: string): StageStats {\n    return (this.stageStats[stage] ??= { requests: 0, inputTokens: 0, costUsd: 0, ms: 0 });\n  }\n\n  /** One logical request (the client may split its questions into several HTTP requests). */\n  private async ask(\n    stage: string,\n    state: unknown,\n    questions: Record<string, JevNoulQuestion>,\n  ): Promise<Record<string, JevAnswer>> {\n    const t0 = performance.now();\n    const r = await this.o.client.ask(state, questions, {\n      tag: stage,\n      signal: this.o.signal,\n    });\n    const st = this.stat(stage);\n    st.requests += r.requests;\n    st.inputTokens += r.usage.inputTokens;\n    st.costUsd += r.costUsd;\n    this.jevModel = r.model || this.jevModel;\n    this.o.onEvent?.(\"jev\", {\n      jevStage: stage,\n      ms: Math.round(performance.now() - t0),\n      requests: r.requests,\n      model: r.model,\n      inputTokens: r.usage.inputTokens,\n      costUsd: r.costUsd,\n      state,\n      questions,\n      answers: r.answers,\n    });\n    return r.answers;\n  }\n\n  /** Run a stage's batches in parallel; the first failure rejects the stage. */\n  private async stage<I, R>(\n    stage: string,\n    batches: I[][],\n    build: (b: I[]) => { state: unknown; questions: Record<string, JevNoulQuestion> },\n    read: (b: I[], answers: Record<string, JevAnswer>) => Array<[string, R]>,\n  ): Promise<Map<string, R>> {\n    const t0 = performance.now();\n    try {\n      const results = await Promise.all(\n        batches.map(async (b) => {\n          const req = build(b);\n          return read(b, await this.ask(stage, req.state, req.questions));\n        }),\n      );\n      return new Map(results.flat());\n    } finally {\n      this.stat(stage).ms += Math.round(performance.now() - t0);\n    }\n  }\n\n  async scoreFiles(items: FileItem[], ctx: JudgeContext): Promise<Map<string, number>> {\n    if (!items.length) return new Map();\n    return this.stage(\n      \"wave1\",\n      chunkEven(items, this.o.config.wave1.filesPerRequest),\n      (b) => buildFileRequest(b, ctx, this.o.config),\n      (b, a) => b.map((f) => [f.id, orLex(noulOf(a[f.id]), f.lex)]),\n    );\n  }\n\n  async scorePassages(\n    items: PassageItem[],\n    ctx: JudgeContext,\n    stage = \"wave2\",\n  ): Promise<Map<string, PassageScore>> {\n    if (!items.length) return new Map();\n    const w = this.o.config.wave2;\n    return this.stage(\n      stage,\n      chunkPassages(items, w.passagesPerRequest, w.maxRequestChars),\n      (b) => buildPassageRequest(b, ctx, this.o.config),\n      (b, a) =>\n        b.map((p) => [\n          p.id,\n          {\n            rel: orLex(noulOf(a[`rel::${p.id}`]), p.lex),\n            cov: ctx.subQuestions.map((_, j) =>\n              orLex(noulOf(a[`cov::${p.id}::${j}`]), p.lexCov[j] ?? 0),\n            ),\n          },\n        ]),\n    );\n  }\n\n  async scoreLeads(items: LeadItem[], ctx: JudgeContext): Promise<Map<string, number>> {\n    if (!items.length) return new Map();\n    return this.stage(\n      \"leads\",\n      chunk(items, 250),\n      (b) => buildLeadRequest(b, ctx, this.o.config),\n      (b, a) => b.map((l) => [l.id, orLex(noulOf(a[l.id]), l.lex)]),\n    );\n  }\n\n  /** null = nothing to check (empty evidence). */\n  async status(evidence: string, ctx: JudgeContext): Promise<StatusScore | null> {\n    if (!evidence.trim()) return null;\n    const req = buildStatusRequest(evidence, ctx, this.o.config);\n    const t0 = performance.now();\n    try {\n      const a = await this.ask(\"status\", req.state, req.questions);\n      return {\n        overall: noulOf(a.overall),\n        subs: ctx.subQuestions.map((_, j) => noulOf(a[`sub::${j}`])),\n      };\n    } finally {\n      this.stat(\"status\").ms += Math.round(performance.now() - t0);\n    }\n  }\n}\n","/**\n * The only way the code_search engine touches files and processes. The sandbox side implements it.\n *\n * The engine passes ripgrep only these flags, so an adapter may enforce an allowlist:\n * --files, --null, --line-number, --with-filename, --no-heading, --color never, -i, -w, --no-require-git,\n * --hidden, -m N, --max-columns N, --max-filesize N, -g GLOB, -e PATTERN, then `--` followed by\n * workspace-relative paths (\".\" or paths without a leading \"-\", no absolute paths, no \"..\").\n * A PATTERN is never longer than CODE_SEARCH_MAX_PATTERN_CHARS: the engine splits a longer alternation\n * into several ripgrep calls and merges their output.\n */\n\n/**\n * Longest `-e` pattern the engine passes to ripgrep, so an adapter may cap pattern length (the sandbox\n * adapter rejects patterns over 16,384 characters).\n */\nexport const CODE_SEARCH_MAX_PATTERN_CHARS = 16_000;\n\nexport type CodeSearchRipgrepResult = {\n  stdout: string;\n  exitCode: number | null;\n  truncated: boolean;\n  timedOut: boolean;\n};\n\nexport interface CodeSearchWorkspace {\n  /** Run ripgrep in the workspace root. `args` excludes the binary. stdout is exactly what rg prints (up to the adapter's byte cap; `truncated` reports a cut). exitCode follows rg: 0 matches, 1 none, 2 error. Throws CodeSearchWorkspaceError when ripgrep is missing or the workspace is unreachable. */\n  ripgrep(\n    args: readonly string[],\n    options: { signal?: AbortSignal; timeoutMs: number },\n  ): Promise<CodeSearchRipgrepResult>;\n  /** Read a workspace-relative file as UTF-8. Null when missing. */\n  readText(\n    path: string,\n    options: { signal?: AbortSignal; maxBytes: number },\n  ): Promise<{ text: string; truncated: boolean; binary: boolean } | null>;\n  /** Classify workspace-relative paths. */\n  pathKinds(\n    paths: readonly string[],\n    options: { signal?: AbortSignal },\n  ): Promise<Record<string, \"file\" | \"directory\" | \"missing\">>;\n}\n\nexport class CodeSearchWorkspaceError extends Error {}\n\n/**\n * Thrown by an adapter when the ripgrep binary is not installed, so the tool can tell the model to use\n * other search commands. A plain CodeSearchWorkspaceError whose message says ripgrep is missing is\n * recognised too.\n */\nexport class CodeSearchRipgrepMissingError extends CodeSearchWorkspaceError {\n  constructor(message = \"ripgrep (rg) is not installed in this workspace\") {\n    super(message);\n    this.name = \"CodeSearchRipgrepMissingError\";\n  }\n}\n","/**\n * session.ts - one search's view of the workspace: counts calls, records partial ripgrep output and\n * makes every call honour the search's AbortSignal.\n */\nimport { CodeSearchWorkspaceError, type CodeSearchWorkspace } from \"./workspace\";\n\n/** Parallel reads per search. */\nexport const READ_CONCURRENCY = 8;\n/** Parallel ripgrep calls for one pattern split under CODE_SEARCH_MAX_PATTERN_CHARS. */\nexport const RIPGREP_SPLIT_CONCURRENCY = 4;\n\nexport class WorkspaceSession {\n  calls = 0;\n  /** A ripgrep call returned output cut at the adapter's byte cap. */\n  truncated = false;\n  /** A ripgrep call hit its time limit (its output is partial). */\n  timedOut = false;\n\n  constructor(\n    private readonly workspace: CodeSearchWorkspace,\n    readonly signal: AbortSignal,\n    private readonly ripgrepTimeoutMs: number,\n  ) {}\n\n  get partial(): boolean {\n    return this.truncated || this.timedOut;\n  }\n\n  /**\n   * ripgrep stdout. Exit code 2 (error) with some output keeps the output (for example unreadable files);\n   * with no output it throws unless `allowFailure`, which then yields \"\".\n   */\n  async ripgrep(\n    args: readonly string[],\n    options: { allowFailure?: boolean } = {},\n  ): Promise<string> {\n    this.signal.throwIfAborted();\n    this.calls++;\n    const r = await this.workspace.ripgrep(args, {\n      signal: this.signal,\n      timeoutMs: this.ripgrepTimeoutMs,\n    });\n    this.signal.throwIfAborted();\n    if (r.truncated) this.truncated = true;\n    if (r.timedOut) this.timedOut = true;\n    if (r.exitCode === 2 && !r.stdout && !r.truncated && !r.timedOut && !options.allowFailure) {\n      throw new CodeSearchWorkspaceError(\"ripgrep failed (exit code 2) without output\");\n    }\n    return r.stdout;\n  }\n\n  /** File text, or null when missing or binary (NUL bytes). */\n  async readText(path: string, maxBytes: number): Promise<string | null> {\n    this.signal.throwIfAborted();\n    this.calls++;\n    const r = await this.workspace.readText(path, { signal: this.signal, maxBytes });\n    this.signal.throwIfAborted();\n    if (!r || r.binary || r.text.includes(\"\\u0000\")) return null;\n    return r.text;\n  }\n\n  async pathKinds(\n    paths: readonly string[],\n  ): Promise<Record<string, \"file\" | \"directory\" | \"missing\">> {\n    this.signal.throwIfAborted();\n    this.calls++;\n    const r = await this.workspace.pathKinds(paths, { signal: this.signal });\n    this.signal.throwIfAborted();\n    return r;\n  }\n}\n\n/** Map with at most `limit` calls in flight; results keep the input order. */\nexport async function mapLimit<T, R>(\n  items: readonly T[],\n  limit: number,\n  fn: (item: T) => Promise<R>,\n): Promise<R[]> {\n  const out = new Array<R>(items.length);\n  let next = 0;\n  const worker = async () => {\n    while (next < items.length) {\n      const i = next++;\n      out[i] = await fn(items[i]!);\n    }\n  };\n  await Promise.all(Array.from({ length: Math.min(limit, items.length) }, worker));\n  return out;\n}\n","/**\n * text.ts - keyword variants, word splitting, stopwords and small text helpers.\n */\n\n/** Split an identifier or phrase into lowercase words: fooBarBAZ_qux-v2 -> [foo, bar, baz, qux, v2]. */\nexport function splitWords(s: string): string[] {\n  return s\n    .replace(/([a-z0-9])([A-Z])/g, \"$1 $2\")\n    .replace(/([A-Z]+)([A-Z][a-z])/g, \"$1 $2\")\n    .split(/[^A-Za-z0-9]+/)\n    .filter(Boolean)\n    .map((w) => w.toLowerCase());\n}\n\nconst cap = (w: string) => (w ? w[0]!.toUpperCase() + w.slice(1) : w);\n\n/**\n * Identifier variants of a keyword. The search is case-insensitive, so only the\n * separator forms matter: concatenated (camel/Pascal/flat), snake/SCREAMING, kebab, spaced phrase.\n * Returned in display casing (camel, snake, kebab, spaced) for the trace; deduped case-insensitively.\n */\nexport function keywordVariants(kw: string): string[] {\n  const raw = kw.trim();\n  if (!raw) return [];\n  const words = splitWords(raw);\n  const out: string[] = [raw];\n  if (words.length >= 2) {\n    out.push(words[0] + words.slice(1).map(cap).join(\"\")); // camelCase (== PascalCase / flat under -i)\n    out.push(words.join(\"_\")); // snake_case (== SCREAMING_SNAKE under -i)\n    out.push(words.join(\"-\")); // kebab-case\n    out.push(words.join(\" \")); // spaced phrase (prose in docs)\n  }\n  const seen = new Set<string>();\n  return out.filter((v) => {\n    const k = v.toLowerCase();\n    if (seen.has(k) || k.length < 2) return false;\n    seen.add(k);\n    return true;\n  });\n}\n\n/** Contiguous 2-word fragments of a compound with >= 3 words (fallback when the full name has no hits). */\nexport function compoundFragments(kw: string): string[] {\n  const words = splitWords(kw);\n  if (words.length < 3) return [];\n  const out: string[] = [];\n  for (let i = 0; i + 1 < words.length; i++) {\n    const a = words[i]!;\n    const b = words[i + 1]!;\n    if (a.length + b.length < 8) continue; // skip tiny fragments like \"is\" + \"on\"\n    out.push(a + cap(b));\n  }\n  return [...new Set(out)];\n}\n\n/** A single plain word (no case change, no separator) short enough to need a word boundary. */\nexport function isShortPlainWord(kw: string, maxLen: number): boolean {\n  return /^[A-Za-z]+$/.test(kw) && kw.length <= maxLen && splitWords(kw).length === 1;\n}\n\n/** Escape for Rust regex (ripgrep). */\nexport function escapeRegex(s: string): string {\n  return s.replace(/[\\\\.+*?()|[\\]{}^$#&\\-~]/g, (m) => `\\\\${m}`);\n}\n\nexport const STOPWORDS = new Set(\n  (\n    \"a an and are as at be been but by can could did do does doing done for from had has have how i if in into is it its \" +\n    \"just me my no not of on or our should so some such than that the their them then there these they this those to \" +\n    \"too was we were what when where which while who why will with would you your also any each else ever every much \" +\n    \"more most other same very about above after again against all am before being below between both during few \" +\n    \"further here him his her hers himself itself let may might must nor now off once only own over under until up \" +\n    \"use used using want way get got make makes happen happens happening still actually really even whether instead \" +\n    \"rather something someone thing things one two three kind already mean means\"\n  ).split(\" \"),\n);\n\n/** Crude stemmer: good enough for overlap scoring (not for display). */\nexport function stem(w: string): string {\n  let s = w.toLowerCase();\n  if (s.length > 5 && s.endsWith(\"ies\")) s = s.slice(0, -3) + \"y\";\n  else if (s.length > 5 && (s.endsWith(\"ing\") || s.endsWith(\"ers\"))) s = s.slice(0, -3);\n  else if (s.length > 4 && (s.endsWith(\"ed\") || s.endsWith(\"es\") || s.endsWith(\"er\")))\n    s = s.slice(0, -2);\n  else if (s.length > 3 && s.endsWith(\"s\") && !s.endsWith(\"ss\")) s = s.slice(0, -1);\n  return s;\n}\n\n/** Content terms of a text (identifiers split into words, stopwords dropped, stemmed, deduped). */\nexport function contentTerms(text: string, minLen = 3): string[] {\n  const out = new Set<string>();\n  for (const tok of text.match(/[A-Za-z][A-Za-z0-9_]*/g) ?? []) {\n    for (const w of splitWords(tok)) {\n      if (w.length < minLen || STOPWORDS.has(w)) continue;\n      out.add(stem(w));\n    }\n  }\n  return [...out];\n}\n\n/** Fraction of `terms` present in `textTerms`. */\nexport function overlap(terms: string[], textTerms: Set<string>): number {\n  if (!terms.length) return 0;\n  let n = 0;\n  for (const t of terms) if (textTerms.has(t)) n++;\n  return n / terms.length;\n}\n\nexport function isTestPath(p: string): boolean {\n  return (\n    /(^|\\/)(test|tests|__tests__|spec|e2e|fixtures?)\\//.test(p) || /\\.(test|spec)\\.[a-z]+$/.test(p)\n  );\n}\n\n/** Release notes: CHANGELOG*, HISTORY*, RELEASE_NOTES*, .changeset/ entries (describe past changes, not current code). */\nexport function isChangelogPath(p: string): boolean {\n  return (\n    /(^|\\/)(CHANGELOG|HISTORY|RELEASE[-_]?NOTES)[^/]*$/i.test(p) || /(^|\\/)\\.changeset\\//.test(p)\n  );\n}\n\n/** Is the question about history / releases (then release notes are not down-weighted)? */\nexport function questionMentionsHistory(q: string): boolean {\n  return /\\b(changelog|release notes?|released|history|historical|when (?:was|did)|which version|since version|changed in)\\b/i.test(\n    q,\n  );\n}\n\nexport function isDocPath(p: string): boolean {\n  return /\\.(md|mdx|txt|rst)$/i.test(p);\n}\n\nexport function questionMentionsTests(q: string): boolean {\n  return /\\b(test|tests|testing|spec|specs|unit test|e2e|fixture)\\b/i.test(q);\n}\n\n/** Trim a line to maxChars around the first occurrence of any needle (case-insensitive). */\nexport function trimAround(line: string, needles: string[], maxChars: number): string {\n  const t = line.replace(/\\t/g, \"  \").trim();\n  if (t.length <= maxChars) return t;\n  const lower = t.toLowerCase();\n  let at = -1;\n  for (const n of needles) {\n    const i = lower.indexOf(n.toLowerCase());\n    if (i >= 0 && (at < 0 || i < at)) at = i;\n  }\n  if (at < 0) return t.slice(0, maxChars - 3) + \"...\";\n  const start = Math.max(0, Math.min(at - Math.floor(maxChars / 3), t.length - maxChars));\n  const s = t.slice(start, start + maxChars - 6);\n  return (start > 0 ? \"...\" : \"\") + s + (start + maxChars - 6 < t.length ? \"...\" : \"\");\n}\n\nexport function estTokens(chars: number, charsPerToken: number): number {\n  return Math.ceil(chars / charsPerToken);\n}\n\nexport function fmtK(n: number): string {\n  return n >= 1000 ? `${(n / 1000).toFixed(1)}k` : String(n);\n}\n","/**\n * leads.ts - wave 3: identifiers referenced by relevant passages whose definitions were not read.\n *\n * Extraction (code only): called functions, imported names, PascalCase types, UPPER_CASE constants,\n * env/config keys and camelCase member accesses. Excluded: names already searched (keywords and their\n * variants), names defined inside the selected passages, a stoplist of builtins/common helpers, and\n * names shorter than 4 chars. Definitions are located with one ripgrep regex call (a few when the names do\n * not fit one pattern under CODE_SEARCH_MAX_PATTERN_CHARS).\n */\nimport type { CodeSearchConfig } from \"./config\";\nimport { mapLimit, RIPGREP_SPLIT_CONCURRENCY, type WorkspaceSession } from \"./session\";\nimport { escapeRegex, isTestPath, splitWords } from \"./text\";\nimport { CODE_SEARCH_MAX_PATTERN_CHARS } from \"./workspace\";\n\nexport interface SeedPassage {\n  path: string;\n  start: number;\n  /** raw file lines of the passage (no `N|` prefixes) */\n  lines: string[];\n  rel: number;\n}\n\nexport interface LeadCandidate {\n  name: string;\n  /** weighted frequency: sum of relevance of seed passages mentioning it + occurrence bonus */\n  weight: number;\n  occurrences: number;\n  called: boolean;\n  seenAt: { path: string; line: number };\n  context: string;\n  kinds: string[];\n}\n\nexport const LEAD_STOPLIST = new Set(\n  // JS/TS builtins, globals, utility types\n  (\n    \"Promise Array Object String Number Boolean Map Set WeakMap WeakSet Symbol Error TypeError RangeError SyntaxError \" +\n    \"JSON Math Date RegExp BigInt Buffer URL URLSearchParams console require parseInt parseFloat setTimeout clearTimeout \" +\n    \"setInterval clearInterval setImmediate queueMicrotask isNaN isFinite encodeURIComponent decodeURIComponent \" +\n    \"structuredClone fetch Response Request Headers FormData Blob File AbortController AbortSignal TextEncoder TextDecoder \" +\n    \"Uint8Array Int32Array Float64Array ArrayBuffer DataView Record Partial Readonly ReadonlyArray Pick Omit Exclude Extract \" +\n    \"ReturnType Parameters Awaited NonNullable Required InstanceType Iterable AsyncIterable Generator AsyncGenerator \" +\n    \"PromiseLike Function Uppercase Lowercase keyof typeof instanceof undefined null true false this super \" +\n    \"process Bun Deno globalThis window document performance crypto \" +\n    // test helpers\n    \"expect describe test beforeEach afterEach beforeAll afterAll mock spyOn toBe toEqual toStrictEqual toMatch \" +\n    \"toContain toThrow toHaveBeenCalled toHaveBeenCalledWith toHaveLength toBeDefined toBeUndefined toBeNull toBeTruthy \" +\n    \"toBeFalsy toMatchObject toBeGreaterThan toBeLessThan resolves rejects \" +\n    // very common methods\n    \"push pop shift unshift map filter reduce forEach find findIndex some every includes join split slice splice concat \" +\n    \"indexOf lastIndexOf keys values entries from assign freeze stringify parse toString valueOf trim trimStart trimEnd \" +\n    \"replace replaceAll match matchAll exec startsWith endsWith toLowerCase toUpperCase padStart padEnd localeCompare \" +\n    \"then catch finally resolve reject allSettled race floor ceil round abs sqrt random sort reverse flat flatMap fill \" +\n    \"length size delete clear warn error info debug trace assert emit once listen close write read send next done \" +\n    \"toISOString getTime toFixed charAt charCodeAt codePointAt fromEntries isArray hasOwnProperty defineProperty \" +\n    \"getOwnPropertyNames create apply call bind \" +\n    // drizzle / zod / sql helpers\n    \"select insert update values returning where from innerJoin leftJoin orderBy groupBy limit offset execute \" +\n    \"inArray isNull isNotNull desc asc sql eq ne gt gte lt lte and or not like ilike between exists \" +\n    \"object string number boolean array optional nullable nullish literal union enum infer default describe \" +\n    \"safeParse parseAsync strict passthrough extend merge partial refine superRefine transform coerce positive \" +\n    \"nonnegative int min max email uuid regex \" +\n    // SQL functions\n    \"coalesce count now greatest least jsonb_build_object jsonb_set jsonb_agg array_agg format lower upper nullif \" +\n    \"current_setting set_config gen_random_uuid clock_timestamp \" +\n    // Rust\n    \"Ok Err Some None Box Vec Arc Mutex RwLock Option Result clone unwrap expect into iter collect map_err ok_or as_ref \" +\n    \"to_string to_owned println eprintln format vec\"\n  ).split(/\\s+/),\n);\n\nconst CONTROL = new Set([\n  \"if\",\n  \"for\",\n  \"while\",\n  \"switch\",\n  \"catch\",\n  \"return\",\n  \"function\",\n  \"typeof\",\n  \"await\",\n  \"async\",\n  \"new\",\n  \"else\",\n  \"case\",\n  \"void\",\n  \"delete\",\n  \"yield\",\n  \"import\",\n  \"export\",\n  \"constructor\",\n  \"super\",\n  \"this\",\n  \"static\",\n  \"private\",\n  \"public\",\n  \"protected\",\n]);\n\n/** Names declared inside a passage (so they are not leads). */\nexport function definedNames(text: string): Set<string> {\n  const out = new Set<string>();\n  const res = [\n    /\\bfunction\\*?\\s+([A-Za-z_$][\\w$]*)/g,\n    /\\b(?:const|let|var)\\s+([A-Za-z_$][\\w$]*)/g,\n    /\\b(?:class|interface|type|enum|namespace|struct|trait|fn|def|func|mod)\\s+([A-Za-z_$][\\w$]*)/g,\n    /(?:FUNCTION|function)\\s+(?:[\\w\"]+\\.)?\"?([A-Za-z_][\\w]*)\"?\\s*\\(/g,\n    /^\\s*(?:(?:public|private|protected|static|async|readonly|override|get|set)\\s+)*([A-Za-z_$][\\w$]*)\\s*(?:<[^>()]*>)?\\s*\\([^;]*\\)\\s*(?::[^={;]+)?\\{\\s*$/gm,\n  ];\n  for (const re of res) for (const m of text.matchAll(re)) if (!CONTROL.has(m[1]!)) out.add(m[1]!);\n  // destructured consts: const { a, b: c } = ...\n  for (const m of text.matchAll(/\\b(?:const|let|var)\\s*\\{([^}]*)\\}/g)) {\n    for (const part of m[1]!.split(\",\")) {\n      const name = part.split(\":\").pop()!.split(\"=\")[0]!.trim();\n      if (/^[A-Za-z_$][\\w$]*$/.test(name)) out.add(name);\n    }\n  }\n  return out;\n}\n\n/** Raw identifier occurrences (name, kind) in one line. */\nexport function identifiersInLine(line: string): Array<{ name: string; kind: string }> {\n  const out: Array<{ name: string; kind: string }> = [];\n  for (const m of line.matchAll(/\\b([A-Za-z_$][\\w$]*)\\s*(?:<[^<>()]*>)?\\s*\\(/g))\n    out.push({ name: m[1]!, kind: \"call\" });\n  const imp = /import\\s+(?:type\\s+)?\\{([^}]*)\\}/.exec(line);\n  if (imp) {\n    for (const part of imp[1]!.split(\",\")) {\n      const name = part\n        .replace(/^\\s*type\\s+/, \"\")\n        .split(/\\s+as\\s+/)[0]!\n        .trim();\n      if (/^[A-Za-z_$][\\w$]*$/.test(name)) out.push({ name, kind: \"import\" });\n    }\n  }\n  for (const m of line.matchAll(/\\b([A-Z][a-z0-9]+(?:[A-Z][A-Za-z0-9]*)+)\\b/g))\n    out.push({ name: m[1]!, kind: \"type\" });\n  for (const m of line.matchAll(/\\b([A-Z][A-Z0-9]*(?:_[A-Z0-9]+)+)\\b/g))\n    out.push({ name: m[1]!, kind: \"constant\" });\n  for (const m of line.matchAll(/\\.([a-z][a-z0-9]*[A-Z][A-Za-z0-9]*)\\b/g))\n    out.push({ name: m[1]!, kind: \"member\" });\n  return out;\n}\n\nfunction trimContext(line: string, name: string, max = 160): string {\n  const t = line.trim().replace(/\\s+/g, \" \");\n  if (t.length <= max) return t;\n  const i = Math.max(0, t.indexOf(name) - 50);\n  return (i > 0 ? \"...\" : \"\") + t.slice(i, i + max - 6) + \"...\";\n}\n\n/**\n * Extract lead candidates from seed passages (most relevant first), ranked by weighted frequency.\n * `searched` = lowercased keywords + variants (already searched; not leads).\n */\nexport function extractLeads(\n  seeds: SeedPassage[],\n  searched: Set<string>,\n  questionWords: Set<string>,\n  max: number,\n): LeadCandidate[] {\n  const defined = new Set<string>();\n  for (const s of seeds) for (const n of definedNames(s.lines.join(\"\\n\"))) defined.add(n);\n  const byName = new Map<string, LeadCandidate>();\n  for (const s of seeds) {\n    const inThis = new Set<string>();\n    const prose = /\\.(md|mdx|txt|rst)$/i.test(s.path);\n    const sql = /\\.sql$/i.test(s.path);\n    s.lines.forEach((line, i) => {\n      if (!prose && /^\\s*(\\/\\/|\\*|\\/\\*|#(?!\\[)|--)/.test(line)) return; // code comments: skip\n      // prose: only identifiers inside `backticks`\n      const scan = prose ? (line.match(/`[^`]+`/g) ?? []).join(\" \") : line;\n      if (!scan) return;\n      for (const { name, kind } of identifiersInLine(scan)) {\n        if (name.length < 4 || CONTROL.has(name) || LEAD_STOPLIST.has(name) || defined.has(name))\n          continue;\n        if (sql && /^[A-Z]+$/.test(name)) continue; // SQL keywords followed by \"(\" (CHECK, EXISTS, VALUES) are not calls\n        if (searched.has(name.toLowerCase()) || searched.has(splitWords(name).join(\" \"))) continue;\n        let c = byName.get(name);\n        if (!c) {\n          c = {\n            name,\n            weight: 0,\n            occurrences: 0,\n            called: false,\n            seenAt: { path: s.path, line: s.start + i },\n            context: trimContext(line, name),\n            kinds: [],\n          };\n          byName.set(name, c);\n        }\n        c.occurrences++;\n        if (kind === \"call\") c.called = true;\n        if (!c.kinds.includes(kind)) c.kinds.push(kind);\n        if (!inThis.has(name)) {\n          c.weight += s.rel;\n          inThis.add(name);\n        }\n      }\n    });\n  }\n  const score = (c: LeadCandidate) => {\n    const words = splitWords(c.name);\n    const ov = words.filter((w) => questionWords.has(w)).length / Math.max(1, words.length);\n    return c.weight + 0.1 * Math.min(5, c.occurrences - 1) + (c.called ? 0.2 : 0) + ov;\n  };\n  return [...byName.values()]\n    .sort((a, b) => score(b) - score(a) || (a.name < b.name ? -1 : 1))\n    .slice(0, max)\n    .map((c) => ({ ...c, weight: Math.round(score(c) * 1000) / 1000 }));\n}\n\nexport interface DefinitionHit {\n  name: string;\n  path: string;\n  line: number;\n  kind: \"decl\" | \"sqlfn\" | \"method\" | \"key\";\n  text: string;\n}\n\n/** The JS regexes used to classify an rg match line for one name (priority order). */\nexport function definitionKinds(name: string): Array<{ kind: DefinitionHit[\"kind\"]; re: RegExp }> {\n  const n = escapeRegex(name);\n  return [\n    {\n      kind: \"decl\",\n      re: new RegExp(\n        `\\\\b(?:function\\\\*?|const|let|var|class|interface|type|enum|namespace|struct|trait|fn|def|func|mod)\\\\s+${n}\\\\b`,\n      ),\n    },\n    { kind: \"sqlfn\", re: new RegExp(`\\\\bfunction\\\\s+(?:[\\\\w\"]+\\\\.)?\"?${n}\"?\\\\s*\\\\(`, \"i\") },\n    {\n      kind: \"method\",\n      re: new RegExp(\n        `^\\\\s*(?:(?:public|private|protected|static|async|readonly|override|get|set)\\\\s+)*${n}\\\\s*(?:<[^>()]*>)?\\\\s*\\\\([^;]*(?:\\\\{|\\\\(|,)\\\\s*$`,\n      ),\n    },\n    { kind: \"key\", re: new RegExp(`^\\\\s*[\"']?${n}[\"']?\\\\??\\\\s*[:=]`) },\n  ];\n}\n\n/**\n * rg pattern (ASCII mode) for definition-shaped lines of any of the names: declarations, SQL functions,\n * methods and object keys / fields / config keys. Classified per name in JS with definitionKinds().\n */\nexport function definitionPattern(names: readonly string[]): string {\n  const alt = names.map(escapeRegex).join(\"|\");\n  return (\n    \"(?-u:\" +\n    [\n      `\\\\b(?:function\\\\*?|const|let|var|class|interface|type|enum|namespace|struct|trait|fn|def|func|mod)\\\\s+(?:${alt})\\\\b`,\n      `(?i:function)\\\\s+(?:[\\\\w\"]+\\\\.)?\"?(?:${alt})\"?\\\\s*\\\\(`,\n      `^\\\\s*(?:(?:public|private|protected|static|async|readonly|override|get|set)\\\\s+)*(?:${alt})\\\\s*(?:<[^>()]*>)?\\\\s*\\\\(`,\n      `^\\\\s*[\"']?(?:${alt})[\"']?\\\\??\\\\s*[:=]`,\n    ].join(\"|\") +\n    \")\"\n  );\n}\n\n/**\n * definitionPattern over consecutive groups of names, each pattern at most maxChars. A name whose own pattern\n * is longer is left out: it gets no definition, as after a failed search.\n */\nexport function definitionPatterns(\n  names: readonly string[],\n  maxChars = CODE_SEARCH_MAX_PATTERN_CHARS,\n): string[] {\n  const out: string[] = [];\n  let group: string[] = [];\n  for (const name of names) {\n    if (definitionPattern([name]).length > maxChars) continue;\n    if (group.length && definitionPattern([...group, name]).length > maxChars) {\n      out.push(definitionPattern(group));\n      group = [];\n    }\n    group.push(name);\n  }\n  if (group.length) out.push(definitionPattern(group));\n  return out;\n}\n\nconst KIND_RANK: Record<DefinitionHit[\"kind\"], number> = { decl: 3, sqlfn: 3, method: 2, key: 1 };\n\n/** Package root of a path: the first two segments for apps/ and packages/ (apps/worker, packages/runtime), else the first. */\nexport function packageOf(path: string): string {\n  const parts = path.split(\"/\");\n  return /^(apps|packages|services|libs|crates)$/.test(parts[0] ?? \"\") && parts.length > 2\n    ? parts.slice(0, 2).join(\"/\")\n    : (parts[0] ?? \"\");\n}\n\n/**\n * Choose the best definitions per name. A name can be defined in many places (`search`, `isRecord`), so locality\n * dominates: the file where the lead was seen, then its package; then kind rank (declaration > method > key),\n * non-test, an already-selected file, a config-ish path for keys, path, line.\n */\nexport function chooseDefinitions(\n  hits: DefinitionHit[],\n  preferPaths: Set<string>,\n  perName: number,\n  allowTests = false,\n  seenAt: Map<string, string> = new Map(),\n): Map<string, DefinitionHit[]> {\n  const by = new Map<string, DefinitionHit[]>();\n  for (const h of hits) {\n    if (!allowTests && isTestPath(h.path)) continue;\n    const arr = by.get(h.name) ?? [];\n    arr.push(h);\n    by.set(h.name, arr);\n  }\n  const rank = (h: DefinitionHit) =>\n    (seenAt.get(h.name) === h.path ? 100 : 0) +\n    (seenAt.has(h.name) && packageOf(seenAt.get(h.name)!) === packageOf(h.path) ? 50 : 0) +\n    KIND_RANK[h.kind] * 10 +\n    (isTestPath(h.path) ? 0 : 4) +\n    (preferPaths.has(h.path) ? 2 : 0) +\n    (h.kind === \"key\" && /config|setting|schema|env/i.test(h.path) ? 1 : 0);\n  const out = new Map<string, DefinitionHit[]>();\n  for (const [name, arr] of by) {\n    arr.sort(\n      (a, b) => rank(b) - rank(a) || (a.path < b.path ? -1 : a.path > b.path ? 1 : a.line - b.line),\n    );\n    out.set(name, arr.slice(0, perName));\n  }\n  return out;\n}\n\nexport interface DefinitionSearch {\n  hits: DefinitionHit[];\n  /** name -> number of repository files that mention it as a word (for an IDF-style genericity penalty) */\n  fileCounts: Map<string, number>;\n  ms: number;\n}\n\n/** Files a definition search never needs: prose/data (definitions of code identifiers live in code or SQL). */\nexport const DEF_SCAN_EXCLUDES = [\"!*.{md,mdx,txt,rst,json,jsonc,html,csv,svg,snap,xml}\"];\n/** Test files, excluded from the definition scan unless the question is about tests. */\nexport const TEST_EXCLUDES = [\n  \"!**/test/**\",\n  \"!**/tests/**\",\n  \"!**/__tests__/**\",\n  \"!**/e2e/**\",\n  \"!**/fixtures/**\",\n  \"!*.test.*\",\n  \"!*.spec.*\",\n];\n\n/**\n * ONE rg pass (ASCII-mode regex, full lines) for definition-shaped lines of all names over code and SQL files\n * (tests only when the question is about tests), classified per name in JS: declarations/SQL functions/methods\n * first; object keys / fields / config keys (`name:` / `name =`) only for names without a stronger definition,\n * and a name whose only definitions are more than maxKeyOnlyDefs keys is a generic field (sessionId, accountId)\n * and gets none. fileCounts = files with any definition-shaped line for the name (generic fields and helpers\n * redefined everywhere score high), used as a genericity penalty. About 0.4 CPU-s on a 6k-file repository; a\n * second pass that counted every mention cost another ~0.7 CPU-s and full-line mention output was 80k lines.\n * Names that do not fit one pattern under the cap are searched in a few passes, merged line by line.\n * A failed definition search yields no hits (the leads are then dropped), as in scout.\n */\nexport async function locateDefinitions(\n  session: WorkspaceSession,\n  names: string[],\n  cfg: CodeSearchConfig,\n  excludeArgs: string[],\n  maxKeyOnlyDefs = 12,\n  allowTests = false,\n): Promise<DefinitionSearch> {\n  const t0 = performance.now();\n  if (!names.length) return { hits: [], fileCounts: new Map(), ms: 0 };\n  const extra = [...DEF_SCAN_EXCLUDES, ...(allowTests ? [] : TEST_EXCLUDES)].flatMap((g) => [\n    \"-g\",\n    g,\n  ]);\n  const defOuts = await mapLimit(definitionPatterns(names), RIPGREP_SPLIT_CONCURRENCY, (pattern) =>\n    session.ripgrep(\n      [\n        \"--null\",\n        \"--line-number\",\n        \"--with-filename\",\n        \"--no-heading\",\n        \"--color\",\n        \"never\",\n        \"--no-require-git\",\n        \"--max-columns\",\n        String(cfg.recall.maxLineColumns),\n        \"--max-filesize\",\n        String(cfg.recall.maxFileBytes),\n        ...excludeArgs,\n        ...extra,\n        \"-e\",\n        pattern,\n        \"--\",\n        \".\",\n      ],\n      { allowFailure: true },\n    ),\n  );\n  const kinds = new Map(names.map((n) => [n, definitionKinds(n)]));\n  const nameSet = new Set(names);\n  const files = new Map<string, Set<string>>();\n  const strong: DefinitionHit[] = [];\n  const keys: DefinitionHit[] = [];\n  const seenRows = new Set<string>();\n  for (const row of defOuts.flatMap((out) => out.split(\"\\n\"))) {\n    const z = row.indexOf(\"\\0\");\n    if (z <= 0) continue;\n    const colon = row.indexOf(\":\", z + 1);\n    if (colon < 0) continue;\n    // a line matched by two of the split patterns is classified once, as with one pattern\n    const at = row.slice(0, colon);\n    if (seenRows.has(at)) continue;\n    seenRows.add(at);\n    const text = row.slice(colon + 1);\n    if (text.length > 400 || text.startsWith(\"[Omitted long line\")) continue; // a definition line is short\n    const path = row.slice(0, z).replace(/^\\.\\//, \"\");\n    const line = Number(row.slice(z + 1, colon));\n    const present = new Set((text.match(/[A-Za-z_$][\\w$]*/g) ?? []).filter((t) => nameSet.has(t)));\n    for (const name of present) {\n      for (const k of kinds.get(name)!) {\n        if (!k.re.test(text)) continue;\n        (k.kind === \"key\" ? keys : strong).push({\n          name,\n          path,\n          line,\n          kind: k.kind,\n          text: text.trim().slice(0, 200),\n        });\n        let fs = files.get(name);\n        if (!fs) files.set(name, (fs = new Set()));\n        fs.add(path);\n        break;\n      }\n    }\n  }\n  const hasStrong = new Set(strong.map((h) => h.name));\n  const keyHits = keys.filter((h) => !hasStrong.has(h.name));\n  const keyCount = new Map<string, number>();\n  for (const h of keyHits) keyCount.set(h.name, (keyCount.get(h.name) ?? 0) + 1);\n  const hits = [...strong, ...keyHits.filter((h) => (keyCount.get(h.name) ?? 0) <= maxKeyOnlyDefs)];\n  hits.sort((a, b) => (a.path < b.path ? -1 : a.path > b.path ? 1 : a.line - b.line));\n  const fileCounts = new Map(names.map((n) => [n, files.get(n)?.size ?? 0]));\n  return { hits, fileCounts, ms: Math.round(performance.now() - t0) };\n}\n","/**\n * windows.ts - turn hit lines into readable passages.\n *\n * For each hit: walk up (<= maxUp lines) to the nearest declaration line at lower-or-equal indentation\n * whose block encloses the hit (function/class/const/export/interface/type/enum/describe/route handler,\n * markdown heading, SQL statement, python def/class), then walk down to where that block closes\n * (<= maxDown lines below the hit). No enclosing declaration -> fixed context around the hit, labelled\n * with the nearest enclosing declaration further up. Overlapping windows merge; windows longer than\n * maxWindowLines split around hit clusters; each file keeps its best windowsPerFile windows.\n * All line numbers in this module's public API are 1-based. A line past the end of the file as read (it\n * changed after ripgrep saw it, or could not be read) is skipped by the callers and treated as blank here.\n */\nimport type { CodeSearchConfig } from \"./config\";\nimport type { HitLine, KeywordInfo } from \"./recall\";\n\nexport type Lang = \"brace\" | \"indent\" | \"markdown\" | \"sql\" | \"other\";\n\nexport interface Window {\n  start: number;\n  end: number;\n  /** Hit lines inside the window (1-based). */\n  hits: number[];\n  /** Enclosing declaration when it is above the window start (or the window starts at it). */\n  label?: { line: number; text: string } | undefined;\n  kind: \"hit\" | \"header\" | \"def\";\n  score: number;\n}\n\nexport function langOf(path: string): Lang {\n  const ext = path.toLowerCase().split(\".\").pop() ?? \"\";\n  if (\n    [\n      \"ts\",\n      \"tsx\",\n      \"js\",\n      \"jsx\",\n      \"mjs\",\n      \"cjs\",\n      \"mts\",\n      \"cts\",\n      \"rs\",\n      \"go\",\n      \"java\",\n      \"c\",\n      \"h\",\n      \"cc\",\n      \"cpp\",\n      \"hpp\",\n      \"cs\",\n      \"swift\",\n      \"kt\",\n      \"scala\",\n      \"css\",\n      \"scss\",\n      \"json\",\n      \"jsonc\",\n      \"proto\",\n      \"tf\",\n      \"hcl\",\n    ].includes(ext)\n  ) {\n    return \"brace\";\n  }\n  if ([\"py\", \"yaml\", \"yml\"].includes(ext)) return \"indent\";\n  if ([\"md\", \"mdx\"].includes(ext)) return \"markdown\";\n  if (ext === \"sql\") return \"sql\";\n  return \"other\";\n}\n\nexport function indentOf(line: string): number {\n  let n = 0;\n  for (const ch of line) {\n    if (ch === \" \") n += 1;\n    else if (ch === \"\\t\") n += 4;\n    else break;\n  }\n  return n;\n}\n\nconst CONTROL = new Set([\n  \"if\",\n  \"for\",\n  \"while\",\n  \"switch\",\n  \"catch\",\n  \"return\",\n  \"else\",\n  \"do\",\n  \"try\",\n  \"with\",\n  \"await\",\n  \"new\",\n  \"typeof\",\n  \"function\",\n  \"throw\",\n  \"yield\",\n  \"delete\",\n  \"void\",\n  \"in\",\n  \"of\",\n  \"case\",\n  \"super\",\n  \"this\",\n  \"import\",\n  \"export\",\n]);\n\nconst TS_DECL =\n  /^\\s*(?:export\\s+)?(?:default\\s+)?(?:declare\\s+)?(?:abstract\\s+)?(?:async\\s+)?(?:function\\b|class\\s|interface\\s|type\\s+[A-Za-z_$][\\w$]*\\s*(?:<[^>]*>)?\\s*=|enum\\s|const\\s+[A-Za-z_$[{]|let\\s+[A-Za-z_$[{]|var\\s+[A-Za-z_$]|namespace\\s|module\\s)/;\nconst EXPORT_DEFAULT = /^\\s*export\\s+default\\b/;\nconst RUST_DECL =\n  /^\\s*(?:pub(?:\\([^)]*\\))?\\s+)?(?:async\\s+)?(?:unsafe\\s+)?(?:const\\s+)?(?:fn|struct|enum|trait|impl|mod|macro_rules!)[\\s<]/;\nconst GO_DECL = /^\\s*func\\s/;\nconst TEST_DECL = /^\\s*(?:describe|it|test)(?:\\.\\w+)?\\s*\\(/;\nconst METHOD =\n  /^\\s*(?:(?:public|private|protected|static|readonly|async|override|get|set)\\s+)*\\*?\\s*([A-Za-z_$][\\w$]*)\\s*(?:<[^>()]*>)?\\s*\\([^;]*$/;\nconst PROP_FN =\n  /^\\s*(?:(?:public|private|protected|static|readonly)\\s+)*[A-Za-z_$][\\w$]*\\s*[:=]\\s*(?:async\\s*)?(?:function\\b|\\([^)]*\\)?[^;]*=>|[A-Za-z_$][\\w$]*\\s*=>)/;\nconst OBJ_KEY_OPEN = /^\\s*[\"']?[A-Za-z_$][\\w$-]*[\"']?\\s*:\\s*(?:[\\w$.]+\\()?[{[]\\s*$/;\nconst CALLBACK_OPEN = /^\\s*(?:await\\s+)?[\\w$]+(?:\\.[\\w$]+)+\\s*\\(.*(?:=>|function\\b).*\\{\\s*$/;\nconst MD_HEADING = /^(#{1,6})\\s/;\nconst SQL_STMT =\n  /^(?:CREATE|ALTER|DROP|INSERT|UPDATE|DELETE|WITH|SELECT|DO|COMMENT|GRANT|REVOKE|BEGIN|SET|LOCK|TRUNCATE)\\b/i;\nconst PY_DECL = /^\\s*(?:async\\s+)?(?:def|class)\\s/;\nconst YAML_KEY = /^\\s*(?:- )?[\"']?[A-Za-z_$][\\w$ .-]*[\"']?\\s*:(?:\\s|$)/;\n\nexport function isDeclLine(line: string, lang: Lang): boolean {\n  if (!line.trim()) return false;\n  switch (lang) {\n    case \"markdown\":\n      return MD_HEADING.test(line);\n    case \"sql\":\n      return indentOf(line) === 0 && SQL_STMT.test(line);\n    case \"indent\":\n      return PY_DECL.test(line) || YAML_KEY.test(line);\n    case \"brace\": {\n      if (\n        TS_DECL.test(line) ||\n        EXPORT_DEFAULT.test(line) ||\n        RUST_DECL.test(line) ||\n        GO_DECL.test(line) ||\n        TEST_DECL.test(line)\n      )\n        return true;\n      if (PROP_FN.test(line) || OBJ_KEY_OPEN.test(line) || CALLBACK_OPEN.test(line)) return true;\n      const m = METHOD.exec(line);\n      if (\n        m &&\n        !CONTROL.has(m[1]!) &&\n        /(\\{|\\(|,)\\s*$/.test(line.trimEnd()) &&\n        !/^\\s*[\\w$]+\\s*\\(.*\\)\\s*;?\\s*$/.test(line)\n      ) {\n        return true;\n      }\n      return false;\n    }\n    default:\n      return false;\n  }\n}\n\n/** Remove string literals and comments so bracket counting is roughly right. */\nexport function stripForBrackets(line: string): string {\n  const t = line.trim();\n  if (t.startsWith(\"*\") || t.startsWith(\"/*\") || t.startsWith(\"//\")) return \"\";\n  return line\n    .replace(/\"(?:[^\"\\\\]|\\\\.)*\"/g, '\"\"')\n    .replace(/'(?:[^'\\\\]|\\\\.)*'/g, \"''\")\n    .replace(/`(?:[^`\\\\]|\\\\.)*`/g, \"``\")\n    .replace(/\\/\\*.*?\\*\\//g, \"\")\n    .replace(/\\/\\/.*$/, \"\");\n}\n\nconst blockEndCache = new WeakMap<string[], Map<number, number | null>>();\n\n/**\n * 0-based index of the last line of the block starting at 0-based line d, or null if unknown\n * (no structure, or longer than maxScan lines).\n */\nexport function blockEnd(lines: string[], d: number, lang: Lang, maxScan = 3000): number | null {\n  let cache = blockEndCache.get(lines);\n  if (!cache) {\n    cache = new Map();\n    blockEndCache.set(lines, cache);\n  }\n  const key = d * 8 + [\"brace\", \"indent\", \"markdown\", \"sql\", \"other\"].indexOf(lang);\n  if (cache.has(key)) return cache.get(key)!;\n  const r = computeBlockEnd(lines, d, lang, maxScan);\n  cache.set(key, r);\n  return r;\n}\n\nfunction computeBlockEnd(lines: string[], d: number, lang: Lang, maxScan: number): number | null {\n  const n = lines.length;\n  if (d < 0 || d >= n) return null;\n  const last = Math.min(n - 1, d + maxScan);\n  if (lang === \"brace\") {\n    let depth = 0;\n    let maxDepth = 0;\n    for (let i = d; i <= last; i++) {\n      const s = stripForBrackets(lines[i]!);\n      for (const ch of s) {\n        if (ch === \"{\" || ch === \"(\" || ch === \"[\") {\n          depth++;\n          if (depth > maxDepth) maxDepth = depth;\n        } else if (ch === \"}\" || ch === \")\" || ch === \"]\") depth--;\n      }\n      if (maxDepth > 0 && depth <= 0) return i;\n      if (maxDepth === 0 && /;\\s*$/.test(s)) return i;\n    }\n    return null;\n  }\n  if (lang === \"indent\") {\n    const ind = indentOf(lines[d]!);\n    let lastNonEmpty = d;\n    for (let i = d + 1; i <= last; i++) {\n      const l = lines[i]!;\n      if (!l.trim()) continue;\n      if (indentOf(l) <= ind) return lastNonEmpty;\n      lastNonEmpty = i;\n    }\n    return last === n - 1 ? lastNonEmpty : null;\n  }\n  if (lang === \"markdown\") {\n    const m = MD_HEADING.exec(lines[d]!);\n    if (!m) return null;\n    const level = m[1]!.length;\n    let inFence = false;\n    for (let i = d + 1; i <= last; i++) {\n      const l = lines[i]!;\n      if (/^\\s*(```|~~~)/.test(l)) inFence = !inFence;\n      if (inFence) continue;\n      const h = MD_HEADING.exec(l);\n      if (h && h[1]!.length <= level) return i - 1;\n    }\n    return last === n - 1 ? n - 1 : null;\n  }\n  if (lang === \"sql\") {\n    let inDollar = false;\n    for (let i = d; i <= last; i++) {\n      const l = lines[i]!.replace(/--.*$/, \"\");\n      const toggles = (l.match(/\\$[A-Za-z_]*\\$/g) ?? []).length;\n      if (toggles % 2 === 1) inDollar = !inDollar;\n      if (!inDollar && /;\\s*$/.test(l)) return i;\n    }\n    return null;\n  }\n  return null;\n}\n\nfunction isCommentOrDecorator(line: string): boolean {\n  return /^(\\/\\/|\\/\\*\\*?|\\*|#\\[|@[A-Za-z]|--)/.test(line.trim());\n}\n\n/** Include up to maxLines of doc comments / decorators directly above a declaration (0-based). */\nfunction leadingComments(lines: string[], d: number, lang: Lang, maxLines = 6): number {\n  if (lang === \"markdown\" || lang === \"other\") return d;\n  let s = d;\n  while (s > 0 && d - s < maxLines && isCommentOrDecorator(lines[s - 1] ?? \"\")) s--;\n  return s;\n}\n\n/** Nearest declaration above (0-based idx) with indentation below the given one; cheap, for labels only. */\nexport function nearestEnclosingLabel(\n  lines: string[],\n  idx: number,\n  lang: Lang,\n  maxScan = 2000,\n): { line: number; text: string } | undefined {\n  const ind = indentOf(lines[idx] ?? \"\");\n  for (let i = idx; i >= Math.max(0, idx - maxScan); i--) {\n    const l = lines[i] ?? \"\";\n    if (!isDeclLine(l, lang)) continue;\n    if (\n      lang === \"markdown\" ||\n      lang === \"sql\" ||\n      i === idx ||\n      indentOf(l) < ind ||\n      (ind === 0 && indentOf(l) === 0)\n    ) {\n      return { line: i + 1, text: l.trim().slice(0, 140) };\n    }\n  }\n  return undefined;\n}\n\n/** The window around one hit line (1-based in, 1-based out). */\nexport function enclosingWindow(\n  lines: string[],\n  hitLine: number,\n  lang: Lang,\n  cfg: CodeSearchConfig,\n): Window {\n  const w = cfg.wave2;\n  const hi = hitLine - 1;\n  const n = lines.length;\n  const hitIndent = indentOf(lines[hi] ?? \"\");\n  if (lang !== \"other\") {\n    for (let i = hi; i >= Math.max(0, hi - w.maxUp); i--) {\n      const l = lines[i] ?? \"\";\n      if (!isDeclLine(l, lang)) continue;\n      if ((lang === \"brace\" || lang === \"indent\") && i !== hi && indentOf(l) > hitIndent) continue;\n      const e = blockEnd(lines, i, lang);\n      if (e === null || e < hi) continue;\n      // a short statement starting on the hit line (`const x = f(...);`) does not enclose anything\n      if (i === hi && e - hi < 2) continue;\n      const start = leadingComments(lines, i, lang);\n      const end = Math.min(e, hi + w.maxDown, n - 1);\n      return padWindow(\n        {\n          start: start + 1,\n          end: end + 1,\n          hits: [hitLine],\n          label: { line: i + 1, text: l.trim().slice(0, 140) },\n          kind: \"hit\",\n          score: 0,\n        },\n        n,\n        cfg,\n      );\n    }\n  }\n  const start = Math.max(0, hi - w.fallbackBefore);\n  const end = Math.min(n - 1, hi + w.fallbackAfter);\n  const label = lang === \"other\" ? undefined : nearestEnclosingLabel(lines, hi, lang);\n  return { start: start + 1, end: end + 1, hits: [hitLine], label, kind: \"hit\", score: 0 };\n}\n\n/** Grow windows shorter than minWindowLines with surrounding context (1/3 above, 2/3 below). */\nexport function padWindow(win: Window, nLines: number, cfg: CodeSearchConfig): Window {\n  const min = cfg.wave2.minWindowLines;\n  const len = win.end - win.start + 1;\n  if (len >= min) return win;\n  const need = min - len;\n  const up = Math.floor(need / 3);\n  let start = Math.max(1, win.start - up);\n  let end = Math.min(nLines, win.end + (need - (win.start - start)));\n  if (end - start + 1 < min) start = Math.max(1, end - min + 1);\n  return { ...win, start, end };\n}\n\n/** Merge overlapping windows or windows separated by <= gap lines. Input any order; output by start. */\nexport function mergeWindows(ws: Window[], gap: number): Window[] {\n  const sorted = [...ws].sort((a, b) => a.start - b.start || a.end - b.end);\n  const out: Window[] = [];\n  for (const w of sorted) {\n    const prev = out[out.length - 1];\n    if (prev && w.start <= prev.end + gap + 1) {\n      prev.end = Math.max(prev.end, w.end);\n      prev.hits = [...new Set([...prev.hits, ...w.hits])].sort((a, b) => a - b);\n      // keep the outermost label (earliest declaration)\n      if (w.label && (!prev.label || w.label.line < prev.label.line)) prev.label = w.label;\n      if (prev.kind !== w.kind && w.kind === \"def\") prev.kind = \"def\";\n    } else {\n      out.push({ ...w, hits: [...w.hits] });\n    }\n  }\n  return out;\n}\n\n/** Split a window longer than maxLines into chunks around its hit clusters (chunks without hits are dropped). */\nexport function splitWindow(w: Window, maxLines: number, before = 20): Window[] {\n  if (w.end - w.start + 1 <= maxLines) return [w];\n  const hits = [...w.hits].sort((a, b) => a - b);\n  if (!hits.length) return [{ ...w, end: w.start + maxLines - 1 }];\n  const out: Window[] = [];\n  let i = 0;\n  while (i < hits.length) {\n    let start = Math.max(w.start, hits[i]! - before);\n    // keep the declaration line if it is close\n    if (w.start >= hits[i]! - 2 * before) start = w.start;\n    const end = Math.min(w.end, start + maxLines - 1);\n    const chunkHits: number[] = [];\n    while (i < hits.length && hits[i]! <= end) chunkHits.push(hits[i++]!);\n    if (!chunkHits.length) {\n      // hit before start cannot happen; guard against infinite loops\n      i++;\n      continue;\n    }\n    out.push({\n      ...w,\n      start,\n      end,\n      hits: chunkHits,\n      label: w.label && w.label.line < start ? w.label : w.label,\n    });\n  }\n  return out;\n}\n\n/** Keywords (indices) whose pattern occurs anywhere in lines[start..end] (1-based inclusive). */\nconst kwRegexCache = new WeakMap<KeywordInfo, RegExp | null>();\nexport function keywordRegex(k: KeywordInfo): RegExp | null {\n  if (!kwRegexCache.has(k)) {\n    let re: RegExp | null = null;\n    try {\n      re = new RegExp(k.pattern, \"i\");\n    } catch {\n      re = null;\n    }\n    kwRegexCache.set(k, re);\n  }\n  return kwRegexCache.get(k)!;\n}\n\nexport function textHasKeyword(text: string, k: KeywordInfo): boolean {\n  const re = keywordRegex(k);\n  if (re) return re.test(text);\n  const lower = text.toLowerCase();\n  return k.variants.some((v) => lower.includes(v.toLowerCase()));\n}\n\nexport function keywordsInRange(\n  lines: string[],\n  start: number,\n  end: number,\n  keywords: KeywordInfo[],\n): number[] {\n  const text = lines.slice(start - 1, end).join(\"\\n\");\n  return keywords.filter((k) => k.idf > 0 && textHasKeyword(text, k)).map((k) => k.index);\n}\n\nexport function scoreWindow(\n  lines: string[],\n  w: Window,\n  keywords: KeywordInfo[],\n  hitWeight = 0.1,\n): number {\n  const kws = keywordsInRange(lines, w.start, w.end, keywords);\n  return kws.reduce((s, k) => s + keywords[k]!.idf, 0) + hitWeight * Math.log(1 + w.hits.length);\n}\n\n/**\n * Windows for one file: window the strongest hit lines (skipping hits already covered), merge,\n * split long ones, score, keep the best windowsPerFile, return in line order.\n */\nexport function buildFileWindows(\n  lines: string[],\n  hitLines: HitLine[],\n  keywords: KeywordInfo[],\n  lang: Lang,\n  cfg: CodeSearchConfig,\n  render?: RenderOpts,\n): Window[] {\n  const w = cfg.wave2;\n  const ro: RenderOpts = render ?? { maxLineChars: w.maxLineChars };\n  // prose sections are long and their paragraphs independent: smaller sub-windows around each hit\n  const maxChars = lang === \"markdown\" ? w.maxProseWindowChars : w.maxWindowChars;\n  if (!lines.length) return [];\n  if (!hitLines.length) {\n    // path-only match: the top of the file (or its first section)\n    const e = lang === \"markdown\" ? Math.min(lines.length, 80) : Math.min(lines.length, 60);\n    return splitByChars(\n      lines,\n      { start: 1, end: e, hits: [], kind: \"header\", score: 0 },\n      maxChars,\n      ro,\n    ).slice(0, 1);\n  }\n  // hits past the end of the file as read (it changed after ripgrep saw it) are dropped\n  const inRange = hitLines.filter((h) => h.line >= 1 && h.line <= lines.length);\n  const weight = (h: HitLine) => h.kws.reduce((s, k) => s + (keywords[k]?.idf ?? 0), 0);\n  const ranked = [...inRange].sort((a, b) => weight(b) - weight(a) || a.line - b.line);\n  const budgetHits = w.seedHitsPerFile;\n  const raw: Window[] = [];\n  let used = 0;\n  for (const h of ranked) {\n    if (used >= budgetHits) break;\n    const inside = raw.find((r) => h.line >= r.start && h.line <= r.end);\n    if (inside) {\n      inside.hits.push(h.line);\n      continue;\n    }\n    raw.push(enclosingWindow(lines, h.line, lang, cfg));\n    used++;\n  }\n  // hits that fall inside kept windows but were not windowed themselves still count\n  for (const h of inRange) {\n    for (const r of raw)\n      if (h.line >= r.start && h.line <= r.end && !r.hits.includes(h.line)) r.hits.push(h.line);\n  }\n  const merged = mergeWindows(raw, w.mergeGap)\n    .flatMap((x) => splitWindow(x, w.maxWindowLines))\n    .flatMap((x) => splitByChars(lines, x, maxChars, ro));\n  for (const x of merged) x.score = scoreWindow(lines, x, keywords, cfg.recall.hitCountWeight);\n  return merged\n    .sort((a, b) => b.score - a.score || a.start - b.start)\n    .slice(0, w.windowsPerFile)\n    .sort((a, b) => a.start - b.start);\n}\n\n/** Window for a definition found at 1-based defLine (lead following). */\nexport function definitionWindow(\n  lines: string[],\n  defLine: number,\n  lang: Lang,\n  cfg: CodeSearchConfig,\n  render?: RenderOpts,\n): Window {\n  const w = cfg.wave2;\n  const d = defLine - 1;\n  const start = leadingComments(lines, d, lang);\n  const e = lang === \"other\" ? null : blockEnd(lines, d, lang);\n  let end =\n    e === null ? Math.min(lines.length - 1, d + w.fallbackAfter) : Math.min(e, d + w.maxDown);\n  end = Math.min(end, start + w.maxWindowLines - 1, lines.length - 1);\n  const win: Window = {\n    start: start + 1,\n    end: end + 1,\n    hits: [defLine],\n    label: { line: defLine, text: (lines[d] ?? \"\").trim().slice(0, 140) },\n    kind: \"def\",\n    score: 0,\n  };\n  // over the char cap: keep the part starting at the definition (the first sub-window)\n  const maxChars = lang === \"markdown\" ? w.maxProseWindowChars : w.maxWindowChars;\n  return splitByChars(\n    lines,\n    win,\n    maxChars,\n    render ?? { maxLineChars: w.maxLineChars },\n    defLine - win.start,\n  )[0]!;\n}\n\nexport interface RenderOpts {\n  /** Lines longer than this are cut (with an explicit marker). */\n  maxLineChars: number;\n  /** When a cut line has a match beyond the head, the cut keeps the region around the first match. */\n  needles?: RegExp[];\n}\n\n/**\n * Cut one over-long line to about maxChars, marked explicitly. If a needle matches beyond the first ~60% of\n * the budget, keep a short head plus the region around the match (prose docs such as AGENTS.md have\n * single-line paragraphs of 1-6k chars whose key sentence is often far from the start).\n */\nexport function cutLine(t: string, maxChars: number, needles: RegExp[] = []): string {\n  if (t.length <= maxChars) return t;\n  let at = -1;\n  for (const re of needles) {\n    const m = re.exec(t);\n    if (m && (at < 0 || m.index < at)) at = m.index;\n  }\n  if (at < 0 || at < maxChars * 0.6)\n    return `${t.slice(0, maxChars)} ...[line cut, ${t.length} chars]`;\n  const head = Math.floor(maxChars * 0.25);\n  const before = Math.floor(maxChars * 0.3);\n  const s = Math.max(head, at - before);\n  const e = Math.min(t.length, s + (maxChars - head));\n  return `${t.slice(0, head)} ...[cut]... ${t.slice(s, e)}${e < t.length ? ` ...[line cut, ${t.length} chars]` : \"\"}`;\n}\n\n/** Render lines[start..end] (1-based inclusive) as `N| text`, cutting very long lines with an explicit marker. */\nexport function renderLines(\n  lines: string[],\n  start: number,\n  end: number,\n  opts: number | RenderOpts,\n): string {\n  const o: RenderOpts = typeof opts === \"number\" ? { maxLineChars: opts } : opts;\n  const out: string[] = [];\n  for (let i = start; i <= end && i <= lines.length; i++) {\n    out.push(`${i}| ${cutLine(lines[i - 1]!.replace(/\\t/g, \"  \"), o.maxLineChars, o.needles)}`);\n  }\n  return out.join(\"\\n\");\n}\n\n/** Rendered length of one line (as renderLines would produce it, plus the newline). */\nexport function renderedLineLength(lines: string[], i: number, o: RenderOpts): number {\n  return renderLines(lines, i, i, o).length + 1;\n}\n\n/**\n * Split a window whose rendered text exceeds maxChars into whole-line sub-windows around its hits:\n * each sub-window starts a few lines above the first uncovered hit (up to a quarter of the budget) and\n * extends down until the budget is used. Windows without hits (headers, definitions) keep their top.\n */\nexport function splitByChars(\n  lines: string[],\n  w: Window,\n  maxChars: number,\n  o: RenderOpts,\n  ctxUp = 3,\n): Window[] {\n  const len = (i: number) => renderedLineLength(lines, i, o);\n  let total = 0;\n  for (let i = w.start; i <= w.end; i++) total += len(i);\n  if (total <= maxChars) return [w];\n  const hits = [...w.hits].filter((h) => h >= w.start && h <= w.end).sort((a, b) => a - b);\n  const anchors = hits.length ? hits : [w.start];\n  const out: Window[] = [];\n  let covered = w.start - 1;\n  for (const h of anchors) {\n    if (h <= covered) continue;\n    let s = h;\n    let used = len(h);\n    while (\n      s - 1 >= w.start &&\n      s - 1 > covered &&\n      h - (s - 1) <= ctxUp &&\n      used + len(s - 1) <= maxChars / 4\n    )\n      used += len(--s);\n    let e = h;\n    while (e + 1 <= w.end && used + len(e + 1) <= maxChars) used += len(++e);\n    out.push({ ...w, start: s, end: e, hits: hits.filter((x) => x >= s && x <= e) });\n    covered = e;\n  }\n  return out;\n}\n\nexport function splitLines(text: string): string[] {\n  const lines = text.split(/\\r?\\n/);\n  if (lines.length && lines[lines.length - 1] === \"\") lines.pop();\n  return lines;\n}\n","/**\n * pack.ts - bounded evidence pack.\n *\n * Priority: (1) for each sub-question, the best passage covering it (coverage >= T2), (2) passages with\n * relevance >= T2 by relevance, (3) if fewer than minPassages passed, the next best above minRelevance,\n * (4) optionally (fillBudget) the rest. Greedy under a char budget (tokens * charsPerToken); a passage that\n * does not fit is trimmed to whole lines around its hits (>= minTrimLines) and marked, never cut mid-line.\n * Output groups passages by file (files by best relevance, passages by line).\n */\nimport type { CodeSearchConfig } from \"./config\";\nimport { isChangelogPath, isDocPath, isTestPath } from \"./text\";\nimport { renderLines, type RenderOpts } from \"./windows\";\n\nexport interface EvidencePassage {\n  id: string;\n  path: string;\n  start: number;\n  end: number;\n  fileLines: string[];\n  hits: number[];\n  label?: { line: number; text: string } | undefined;\n  kind: \"hit\" | \"header\" | \"def\";\n  rel: number;\n  cov: number[];\n  /** Lexical passage score (used by pack.lexWeight). */\n  lex?: number | undefined;\n  lead?: string | undefined;\n  /** How lines are rendered (line cap + needles for cutting very long lines around a hit). */\n  render?: RenderOpts | undefined;\n}\n\nexport interface PackedPassage {\n  id: string;\n  path: string;\n  start: number;\n  end: number;\n  origStart: number;\n  origEnd: number;\n  trimmed: boolean;\n  rel: number;\n  cov: number[];\n  kind: EvidencePassage[\"kind\"];\n  lead?: string | undefined;\n  label?: { line: number; text: string } | undefined;\n  /** rendered block including its `==` header line */\n  block: string;\n}\n\nexport interface PackOptions {\n  subQuestions: string[];\n  T2: number;\n  /** Chars available for passage blocks (header/footer excluded). */\n  bodyChars: number;\n  cfg: CodeSearchConfig;\n  /** Apply pack.changelogPrior (false when the question is about history / releases). */\n  downweightChangelogs?: boolean;\n  /** Apply pack.testPrior (false when the question is about tests). */\n  downweightTests?: boolean;\n}\n\nexport interface PackBody {\n  included: PackedPassage[];\n  excluded: EvidencePassage[];\n  body: string;\n  priority: string[];\n}\n\nconst r2 = (x: number) => (Number.isFinite(x) ? x.toFixed(2) : \"?\");\n\n/**\n * Greedy file-diverse order: repeatedly take the passage with the highest eff(x) - penalty x (passages already\n * taken from its file). penalty 0 = plain descending eff.\n */\nexport function diverseOrder(\n  xs: EvidencePassage[],\n  eff: (x: EvidencePassage) => number,\n  penalty: number,\n  taken: Map<string, number>,\n): EvidencePassage[] {\n  const tie = (a: EvidencePassage, b: EvidencePassage) =>\n    a.path < b.path ? -1 : a.path > b.path ? 1 : a.start - b.start;\n  if (penalty <= 0) return [...xs].sort((a, b) => eff(b) - eff(a) || tie(a, b));\n  const left = [...xs];\n  const out: EvidencePassage[] = [];\n  while (left.length) {\n    let bi = 0;\n    let bv = -Infinity;\n    left.forEach((x, i) => {\n      const v = eff(x) - penalty * (taken.get(x.path) ?? 0);\n      if (v > bv || (v === bv && tie(x, left[bi]!) < 0)) {\n        bv = v;\n        bi = i;\n      }\n    });\n    const x = left.splice(bi, 1)[0]!;\n    taken.set(x.path, (taken.get(x.path) ?? 0) + 1);\n    out.push(x);\n  }\n  return out;\n}\n\n/** Path prior for pack ordering (release notes, prose docs, tests); 1 for code. */\nexport function pathPrior(\n  path: string,\n  o: Pick<PackOptions, \"cfg\" | \"downweightChangelogs\" | \"downweightTests\">,\n): number {\n  const p = o.cfg.pack;\n  if (isChangelogPath(path)) return o.downweightChangelogs !== false ? p.changelogPrior : 1;\n  if (isTestPath(path)) return o.downweightTests !== false ? p.testPrior : 1;\n  if (isDocPath(path)) return p.docPrior;\n  return 1;\n}\n\n/** Pack ordering score: (rel + lexWeight x lex) x path prior. Inclusion floors (T2, minRelevance) still use raw rel. */\nexport function packScore(\n  x: EvidencePassage,\n  o: Pick<PackOptions, \"cfg\" | \"downweightChangelogs\" | \"downweightTests\">,\n): number {\n  return (x.rel + o.cfg.pack.lexWeight * (x.lex ?? 0)) * pathPrior(x.path, o);\n}\n\nexport function priorityOrder(\n  passages: EvidencePassage[],\n  o: Pick<PackOptions, \"subQuestions\" | \"T2\" | \"cfg\" | \"downweightChangelogs\" | \"downweightTests\">,\n): EvidencePassage[] {\n  const p = o.cfg.pack;\n  const effCache = new Map<EvidencePassage, number>();\n  const eff = (x: EvidencePassage) => {\n    let v = effCache.get(x);\n    if (v === undefined) effCache.set(x, (v = packScore(x, o)));\n    return v;\n  };\n  const byRel = [...passages].sort(\n    (a, b) => eff(b) - eff(a) || (a.path < b.path ? -1 : a.path > b.path ? 1 : a.start - b.start),\n  );\n  const out: EvidencePassage[] = [];\n  const taken = new Map<string, number>();\n  const add = (x: EvidencePassage) => {\n    if (!out.includes(x)) {\n      out.push(x);\n      taken.set(x.path, (taken.get(x.path) ?? 0) + 1);\n    }\n  };\n  o.subQuestions.forEach((_, j) => {\n    const best = [...passages]\n      .filter((x) => (x.cov[j] ?? 0) >= o.T2 && x.rel >= p.minRelevance)\n      .sort((a, b) => (b.cov[j] ?? 0) - (a.cov[j] ?? 0) || b.rel - a.rel)[0];\n    if (best) add(best);\n  });\n  for (const x of diverseOrder(\n    byRel.filter((y) => y.rel >= o.T2 && !out.includes(y)),\n    eff,\n    p.filePenalty,\n    new Map(taken),\n  ))\n    add(x);\n  for (const x of byRel) {\n    if (out.length >= p.minPassages) break;\n    if (x.rel >= p.minRelevance) add(x);\n  }\n  if (p.fillBudget)\n    for (const x of diverseOrder(\n      byRel.filter((y) => y.rel >= p.minRelevance && !out.includes(y)),\n      eff,\n      p.filePenalty,\n      new Map(taken),\n    ))\n      add(x);\n  return out;\n}\n\nfunction blockHeader(x: EvidencePassage, start: number, end: number, o: PackOptions): string {\n  const covTags = o.subQuestions\n    .map((_, j) => ((x.cov[j] ?? 0) >= o.T2 ? `s${j + 1}` : \"\"))\n    .filter(Boolean);\n  const parts = [`== ${x.path}:${start}-${end}  rel ${r2(x.rel)}`];\n  if (covTags.length) parts.push(`[${covTags.join(\" \")}]`);\n  if (x.kind === \"def\" && x.lead) parts.push(`(definition of ${x.lead})`);\n  if (start !== x.start || end !== x.end) parts.push(`(trimmed from ${x.start}-${x.end})`);\n  let h = parts.join(\"  \");\n  if (x.label && x.label.line < start) h += `\\n   in L${x.label.line}: ${x.label.text}`;\n  return h;\n}\n\nexport function renderBlock(\n  x: EvidencePassage,\n  start: number,\n  end: number,\n  o: PackOptions,\n): string {\n  return `${blockHeader(x, start, end, o)}\\n${renderLines(x.fileLines, start, end, x.render ?? o.cfg.wave2.maxLineChars)}`;\n}\n\n/** Largest contiguous whole-line sub-range around the passage's hits whose block fits in maxChars. */\nexport function trimToFit(\n  x: EvidencePassage,\n  maxChars: number,\n  o: PackOptions,\n): { start: number; end: number } | null {\n  const lineLen = (i: number) =>\n    renderLines(x.fileLines, i, i, x.render ?? o.cfg.wave2.maxLineChars).length + 1;\n  const hdr = blockHeader(x, x.start, x.end, o).length + 40; // + \"(trimmed from a-b)\"\n  const inside = x.hits.filter((h) => h >= x.start && h <= x.end).sort((a, b) => a - b);\n  const center = inside.length ? inside[Math.floor((inside.length - 1) / 2)]! : x.start;\n  let s = center;\n  let e = center;\n  let used = hdr + lineLen(center);\n  if (used > maxChars) return null;\n  // grow 2 lines down per line up (code after a hit usually matters more), until neither side fits\n  let stuckUp = false;\n  let stuckDown = false;\n  let turn = 0;\n  while (!(stuckUp && stuckDown)) {\n    const goDown = !stuckDown && (stuckUp || turn % 3 !== 2);\n    turn++;\n    if (goDown) {\n      if (e + 1 > x.end) {\n        stuckDown = true;\n        continue;\n      }\n      const c = lineLen(e + 1);\n      if (used + c > maxChars) stuckDown = true;\n      else {\n        e++;\n        used += c;\n      }\n    } else {\n      if (s - 1 < x.start) {\n        stuckUp = true;\n        continue;\n      }\n      const c = lineLen(s - 1);\n      if (used + c > maxChars) stuckUp = true;\n      else {\n        s--;\n        used += c;\n      }\n    }\n  }\n  if (e - s + 1 < o.cfg.pack.minTrimLines && e - s + 1 < x.end - x.start + 1) return null;\n  return { start: s, end: e };\n}\n\nexport function packBody(passages: EvidencePassage[], o: PackOptions): PackBody {\n  const order = priorityOrder(passages, o);\n  let remaining = o.bodyChars;\n  const included: PackedPassage[] = [];\n  for (const x of order) {\n    if (remaining < 200) break;\n    let s = x.start;\n    let e = x.end;\n    let block = renderBlock(x, s, e, o);\n    const cap = o.cfg.pack.maxPassageChars;\n    if (cap > 0 && block.length > cap) {\n      const t = trimToFit(x, cap, o);\n      if (t) {\n        s = t.start;\n        e = t.end;\n        block = renderBlock(x, s, e, o);\n      }\n    }\n    if (block.length + 2 > remaining) {\n      const t = trimToFit({ ...x, start: s, end: e }, remaining - 2, o);\n      if (!t) continue;\n      s = t.start;\n      e = t.end;\n      block = renderBlock(x, s, e, o);\n      if (block.length + 2 > remaining) continue;\n    }\n    remaining -= block.length + 2;\n    included.push({\n      id: x.id,\n      path: x.path,\n      start: s,\n      end: e,\n      origStart: x.start,\n      origEnd: x.end,\n      trimmed: s !== x.start || e !== x.end,\n      rel: x.rel,\n      cov: x.cov,\n      kind: x.kind,\n      lead: x.lead,\n      label: x.label,\n      block,\n    });\n  }\n  const inc = new Set(included.map((p) => p.id));\n  const excluded = passages.filter((x) => !inc.has(x.id)).sort((a, b) => b.rel - a.rel);\n  // group by file: files by best relevance, passages by line\n  const fileBest = new Map<string, number>();\n  for (const p of included) fileBest.set(p.path, Math.max(fileBest.get(p.path) ?? 0, p.rel));\n  const grouped = [...included].sort(\n    (a, b) =>\n      fileBest.get(b.path)! - fileBest.get(a.path)! ||\n      (a.path < b.path ? -1 : a.path > b.path ? 1 : a.start - b.start),\n  );\n  return {\n    included: grouped,\n    excluded,\n    body: grouped.map((p) => p.block).join(\"\\n\\n\"),\n    priority: order.map((x) => x.id),\n  };\n}\n\nexport interface FooterInput {\n  excluded: EvidencePassage[];\n  otherFiles: Array<{ path: string; score: number }>;\n  leadsNotFollowed: Array<{ name: string; score: number; seenAt: string; note?: string }>;\n  zeroHitKeywords: Array<{ raw: string; fragments: string[] }>;\n  widenedNote?: string;\n  cfg: CodeSearchConfig;\n  maxChars: number;\n}\n\n/** Footer lines, dropping list entries from the end until it fits maxChars. */\nexport function renderFooter(f: FooterInput): string {\n  const p = f.cfg.pack;\n  const more: string[] = f.excluded\n    .slice(0, p.moreCandidates)\n    .map((x) => `${x.path}:${x.start}-${x.end} (${r2(x.rel)})`);\n  const moreFiles = f.otherFiles\n    .slice(0, Math.max(0, p.moreCandidates - more.length))\n    .map((x) => `${x.path} (${r2(x.score)})`);\n  const leads = f.leadsNotFollowed\n    .slice(0, p.leadsNotFollowed)\n    .map((l) => `${l.name} (${r2(l.score)}${l.note ? `, ${l.note}` : \"\"}) @${l.seenAt}`);\n  const zero = f.zeroHitKeywords.map((k) =>\n    k.fragments.length ? `${k.raw} (matched fragments: ${k.fragments.join(\", \")})` : k.raw,\n  );\n  const build = (m: string[], mf: string[], l: string[]) => {\n    const lines: string[] = [];\n    if (m.length || mf.length) {\n      lines.push(\"More candidates (not included; read if needed):\");\n      if (m.length) lines.push(`  ${m.join(\", \")}`);\n      if (mf.length) lines.push(`  files: ${mf.join(\", \")}`);\n    }\n    if (l.length) lines.push(`Leads not followed: ${l.join(\", \")}`);\n    if (zero.length) lines.push(`Keywords with zero hits: ${zero.join(\", \")}`);\n    if (f.widenedNote) lines.push(f.widenedNote);\n    return lines.join(\"\\n\");\n  };\n  let m = more;\n  let mf = moreFiles;\n  let l = leads;\n  let out = build(m, mf, l);\n  while (out.length > f.maxChars && (m.length || mf.length || l.length)) {\n    if (mf.length) mf = mf.slice(0, -1);\n    else if (l.length > 2) l = l.slice(0, -1);\n    else if (m.length) m = m.slice(0, -1);\n    else l = l.slice(0, -1);\n    out = build(m, mf, l);\n  }\n  return out;\n}\n","/**\n * recall.ts - wide, deterministic lexical recall with ripgrep.\n *\n * One ripgrep pass over the union of every keyword's identifier variants, searched case-insensitively\n * (camelCase <-> snake_case <-> kebab <-> spaced phrase; SCREAMING and Pascal forms are covered by -i);\n * a union longer than CODE_SEARCH_MAX_PATTERN_CHARS is split into several passes and merged. Lines are\n * attributed to keywords in JS. Short plain words get a leading word boundary so `turn` does not\n * match `return`. Per-file score = sum over DISTINCT matched keywords of IDF + path bonus + a small\n * hit-count tie breaker; tests are down-weighted unless the question is about tests.\n */\nimport type { CodeSearchConfig } from \"./config\";\nimport {\n  mapLimit,\n  READ_CONCURRENCY,\n  RIPGREP_SPLIT_CONCURRENCY,\n  type WorkspaceSession,\n} from \"./session\";\nimport {\n  compoundFragments,\n  escapeRegex,\n  isChangelogPath,\n  isDocPath,\n  isShortPlainWord,\n  isTestPath,\n  keywordVariants,\n  questionMentionsHistory,\n  questionMentionsTests,\n  splitWords,\n} from \"./text\";\nimport { CODE_SEARCH_MAX_PATTERN_CHARS } from \"./workspace\";\n\nexport const BUILTIN_EXCLUDES = [\n  \"!**/node_modules/**\",\n  \"!**/dist/**\",\n  \"!**/build/**\",\n  \"!**/.next/**\",\n  \"!**/coverage/**\",\n  \"!**/target/**\",\n  \"!**/vendor/**\",\n  \"!**/.git/**\",\n  // a linked worktree has a `.git` FILE (gitdir pointer), which --hidden would otherwise search\n  \"!**/.git\",\n  \"!**/.turbo/**\",\n  \"!*.lock\",\n  \"!**/package-lock.json\",\n  \"!**/pnpm-lock.yaml\",\n  \"!**/yarn.lock\",\n  \"!**/bun.lockb\",\n  \"!*.min.js\",\n  \"!*.min.css\",\n  \"!*.map\",\n  \"!*.snap\",\n  \"!**/*.gen.*\",\n  \"!**/*.generated.*\",\n  \"!**/gen/**\",\n  \"!**/*_pb.*\",\n  \"!**/*.pb.go\",\n  \"!*.{svg,png,jpg,jpeg,gif,ico,webp,woff,woff2,ttf,otf,eot,wasm,pdf,zip,gz,tgz,mp4,mp3,mov}\",\n];\n\nexport interface KeywordInfo {\n  index: number;\n  raw: string;\n  variants: string[];\n  /** \"phrase\" = any variant as a substring; \"word-prefix\" = `\\bword`. */\n  mode: \"phrase\" | \"word-prefix\";\n  /** JS-dialect pattern (attribution, window scoring, line cutting). */\n  pattern: string;\n  /** ripgrep-dialect pattern: same language, but word boundaries are ASCII `(?-u:\\b)`. */\n  rgPattern: string;\n  /** Number of files with at least one matching line (content). */\n  df: number;\n  /** Files whose path matches (no content needed). */\n  pathDf: number;\n  hitLines: number;\n  idf: number;\n  /** Fragments used because the full keyword had zero hits. */\n  fragments: string[];\n}\n\nexport interface HitLine {\n  line: number;\n  text: string;\n  kws: number[];\n}\n\nexport interface FileCandidate {\n  path: string;\n  lexScore: number;\n  /** keyword index -> matching line count */\n  kwHits: Record<number, number>;\n  pathKws: number[];\n  hitLines: Map<number, HitLine>;\n  isTest: boolean;\n  isDoc: boolean;\n}\n\nexport interface RecallResult {\n  keywords: KeywordInfo[];\n  totalFiles: number;\n  candidates: FileCandidate[];\n  scoredFiles: number;\n  searchPaths: string[];\n  widened: boolean;\n  /** Path prefixes that do not exist in the workspace (or are not workspace-relative); ignored. */\n  missingPrefixes: string[];\n  /** The path prefixes that exist, workspace-relative. */\n  validPrefixes: string[];\n  /** Path-only candidates dropped because their content is binary (NUL in the first 8 KB). */\n  binaryDropped: number;\n  ms: number;\n}\n\nexport interface RecallInput {\n  session: WorkspaceSession;\n  question: string;\n  keywords: string[];\n  pathPrefixes: string[];\n  config: CodeSearchConfig;\n}\n\nexport function excludeArgs(cfg: CodeSearchConfig): string[] {\n  return [\n    ...BUILTIN_EXCLUDES,\n    ...cfg.recall.extraExcludes.map((g) => (g.startsWith(\"!\") ? g : `!${g}`)),\n  ].flatMap((g) => [\"-g\", g]);\n}\n\n/** `--hidden` (rg skips dot-dirs such as .github/ by default); `.git/` stays excluded by BUILTIN_EXCLUDES. */\nexport function hiddenArgs(cfg: CodeSearchConfig): string[] {\n  return cfg.recall.searchHidden ? [\"--hidden\"] : [];\n}\n\nexport async function listFiles(\n  session: WorkspaceSession,\n  paths: string[],\n  cfg: CodeSearchConfig,\n): Promise<string[]> {\n  // exit 2 without output means nothing could be listed (for example only unreadable directories)\n  const out = await session.ripgrep(\n    [\n      \"--files\",\n      \"--no-require-git\",\n      ...hiddenArgs(cfg),\n      \"--max-filesize\",\n      String(cfg.recall.maxFileBytes),\n      ...excludeArgs(cfg),\n      \"--\",\n      ...paths,\n    ],\n    { allowFailure: true },\n  );\n  return out\n    .split(\"\\n\")\n    .filter(Boolean)\n    .map((p) => p.replace(/^\\.\\//, \"\"))\n    .sort();\n}\n\n/**\n * Search pattern for one keyword. `pattern` is JS-dialect; `rgPattern` is the same for ripgrep except that the\n * word boundary is ASCII: a Unicode `\\b` under -i disables ripgrep's fast engines (measured on repo-snap: 5.6 s\n * user CPU for one pass vs 0.2 s with `(?-u:\\b)`), and JS `\\b` is ASCII anyway.\n */\nexport function buildPattern(\n  kw: string,\n  cfg: CodeSearchConfig,\n): { pattern: string; rgPattern: string; mode: \"phrase\" | \"word-prefix\"; variants: string[] } {\n  const variants = keywordVariants(kw);\n  if (variants.length === 1 && isShortPlainWord(variants[0]!, cfg.recall.shortWordMaxLen)) {\n    const lit = escapeRegex(variants[0]!);\n    return { pattern: `\\\\b${lit}`, rgPattern: `(?-u:\\\\b)${lit}`, mode: \"word-prefix\", variants };\n  }\n  // spaced-phrase variants match any run of whitespace\n  const alts = variants.map((v) => escapeRegex(v).replace(/ /g, \"\\\\s+\"));\n  return { pattern: alts.join(\"|\"), rgPattern: alts.join(\"|\"), mode: \"phrase\", variants };\n}\n\n/** Pattern for the 2-word fragments of a compound keyword (used only if the full keyword has zero hits). */\nexport function fragmentPattern(frags: string[]): string {\n  return frags\n    .flatMap((f) => keywordVariants(f))\n    .map((v) => escapeRegex(v).replace(/ /g, \"\\\\s+\"))\n    .join(\"|\");\n}\n\nexport interface RgMatch {\n  path: string;\n  line: number;\n  text: string;\n}\n\n/** Parse `rg --null --line-number --with-filename --no-heading` output. Omitted long lines are skipped. */\nexport function parseRgOutput(out: string): RgMatch[] {\n  const matches: RgMatch[] = [];\n  let pos = 0;\n  while (pos < out.length) {\n    let nl = out.indexOf(\"\\n\", pos);\n    if (nl < 0) nl = out.length;\n    const z = out.indexOf(\"\\0\", pos);\n    if (z > pos && z < nl) {\n      const colon = out.indexOf(\":\", z + 1);\n      if (colon > z && colon < nl) {\n        const line = Number(out.slice(z + 1, colon));\n        const text = out.slice(colon + 1, nl).replace(/\\r$/, \"\");\n        if (Number.isFinite(line) && !text.startsWith(\"[Omitted long line\")) {\n          matches.push({ path: out.slice(pos, z).replace(/^\\.\\//, \"\"), line, text });\n        }\n      }\n    }\n    pos = nl + 1;\n  }\n  return matches;\n}\n\nconst byPathLine = (a: RgMatch, b: RgMatch) =>\n  a.path < b.path ? -1 : a.path > b.path ? 1 : a.line - b.line;\n\n/**\n * Whether a pattern built by this engine compiles: checked as a JS regex after mapping ripgrep's inline flag\n * groups (`(?-u:`, `(?i:`) to plain groups. It tells an invalid pattern apart from ripgrep's exit 2 for an\n * unreadable path.\n */\nexport function ripgrepPatternCompiles(pattern: string): boolean {\n  return jsRegex(pattern.replace(/\\(\\?[A-Za-z-]+:/g, \"(?:\")) !== null;\n}\n\n/** One rg pass for a pattern (any number of alternatives), all matching lines, sorted by path then line. */\nexport async function searchPattern(\n  session: WorkspaceSession,\n  pattern: string,\n  paths: string[],\n  cfg: CodeSearchConfig,\n  opts: { caseInsensitive?: boolean; word?: boolean; maxPerFile?: number } = {},\n): Promise<RgMatch[]> {\n  const args = [\n    \"--null\",\n    \"--line-number\",\n    \"--with-filename\",\n    \"--no-heading\",\n    \"--color\",\n    \"never\",\n    ...(opts.caseInsensitive === false ? [] : [\"-i\"]),\n    ...(opts.word ? [\"-w\"] : []),\n    \"--no-require-git\",\n    ...hiddenArgs(cfg),\n    ...(opts.maxPerFile ? [\"-m\", String(opts.maxPerFile)] : []),\n    // very long lines (minified / generated / data) are omitted by rg and skipped by the parser\n    \"--max-columns\",\n    String(cfg.recall.maxLineColumns),\n    \"--max-filesize\",\n    String(cfg.recall.maxFileBytes),\n    ...excludeArgs(cfg),\n    \"-e\",\n    pattern,\n    \"--\",\n    ...paths,\n  ];\n  // rg also exits 2 without output when nothing matched and some path was unreadable; that is no match\n  const out = await session.ripgrep(args, { allowFailure: ripgrepPatternCompiles(pattern) });\n  const matches = parseRgOutput(out);\n  // rg searches in parallel; sort for determinism (same effect as --sort path, without serializing the search)\n  matches.sort(byPathLine);\n  return matches;\n}\n\n/** Split a regex at its top-level `|` (outside groups, character classes and escapes). */\nexport function splitAlternation(pattern: string): string[] {\n  const out: string[] = [];\n  let depth = 0;\n  let inClass = false;\n  let start = 0;\n  for (let i = 0; i < pattern.length; i++) {\n    const ch = pattern[i];\n    if (ch === \"\\\\\") i++;\n    else if (inClass) inClass = ch !== \"]\";\n    else if (ch === \"[\") inClass = true;\n    else if (ch === \"(\") depth++;\n    else if (ch === \")\") depth--;\n    else if (ch === \"|\" && depth === 0) {\n      out.push(pattern.slice(start, i));\n      start = i + 1;\n    }\n  }\n  out.push(pattern.slice(start));\n  return out;\n}\n\n/**\n * Join alternatives with `|`, in order, into as few patterns of at most maxChars as possible. An alternative\n * longer than maxChars on its own gets a pattern of its own.\n */\nexport function packAlternatives(alternatives: readonly string[], maxChars: number): string[] {\n  const out: string[] = [];\n  let cur: string | null = null;\n  for (const alt of alternatives) {\n    if (cur !== null && cur.length + 1 + alt.length <= maxChars) {\n      cur += `|${alt}`;\n    } else {\n      if (cur !== null) out.push(cur);\n      cur = alt;\n    }\n  }\n  if (cur !== null) out.push(cur);\n  return out;\n}\n\n/** Matches of several searches, as one search over their union returns them: by path then line, each line once. */\nexport function mergeMatches(lists: readonly RgMatch[][]): RgMatch[] {\n  const all = lists.flat().sort(byPathLine);\n  return all.filter(\n    (m, i) => i === 0 || m.path !== all[i - 1]!.path || m.line !== all[i - 1]!.line,\n  );\n}\n\n/**\n * The lines matching `(?:a)|(?:b)|...` over the alternatives. A union longer than maxPatternChars is split\n * into several rg passes (an alternative too long on its own is split at its own top-level `|`), run a few\n * at a time and merged, so the result is the same as one pass. A part that still does not fit (a keyword\n * of thousands of characters) is not searched, so it reports zero hits.\n */\nexport async function searchAlternatives(\n  session: WorkspaceSession,\n  alternatives: readonly string[],\n  paths: string[],\n  cfg: CodeSearchConfig,\n  maxPatternChars = CODE_SEARCH_MAX_PATTERN_CHARS,\n): Promise<RgMatch[]> {\n  const groups = alternatives\n    .flatMap((p) =>\n      p.length + 4 <= maxPatternChars ? [`(?:${p})`] : splitAlternation(p).map((a) => `(?:${a})`),\n    )\n    .filter((g) => g.length <= maxPatternChars);\n  const patterns = packAlternatives(groups, maxPatternChars);\n  if (patterns.length <= 1) {\n    return patterns.length ? searchPattern(session, patterns[0]!, paths, cfg) : [];\n  }\n  const found = await mapLimit(patterns, RIPGREP_SPLIT_CONCURRENCY, (p) =>\n    searchPattern(session, p, paths, cfg),\n  );\n  return mergeMatches(found);\n}\n\nexport function idfOf(df: number, n: number): number {\n  return Math.log(1 + n / (1 + df));\n}\n\n/** Does the path mention the keyword (any variant, separators ignored)? */\nexport function pathMatches(path: string, variants: string[]): boolean {\n  const flatPath = path.toLowerCase().replace(/[-_ .]/g, \"\");\n  return variants.some((v) => {\n    const flat = v.toLowerCase().replace(/[-_ ]/g, \"\");\n    return flat.length >= 4 && flatPath.includes(flat);\n  });\n}\n\n/** JS regex for an rg pattern built by buildPattern/fragmentPattern (the escapes used are valid in both dialects). */\nexport function jsRegex(pattern: string): RegExp | null {\n  try {\n    return new RegExp(pattern, \"i\");\n  } catch {\n    return null;\n  }\n}\n\nexport interface Slot {\n  /** keyword index */\n  ki: number;\n  fragment: boolean;\n  re: RegExp | null;\n  literals: string[];\n}\n\n/**\n * Attribute rg lines to keyword slots. Returns per slot the matches (all lines; the caller caps what it stores).\n * A JS regex that fails to compile falls back to a case-insensitive literal test on the variants.\n */\nexport function attribute(matches: RgMatch[], slots: Slot[]): RgMatch[][] {\n  const out: RgMatch[][] = slots.map(() => []);\n  for (const m of matches) {\n    const lower = m.text.toLowerCase();\n    slots.forEach((s, i) => {\n      const hit = s.re ? s.re.test(m.text) : s.literals.some((l) => lower.includes(l));\n      if (hit) out[i]!.push(m);\n    });\n  }\n  return out;\n}\n\n/**\n * Normalize path prefixes to workspace-relative form (\"./src/\" -> \"src\"); prefixes that do not exist, are\n * absolute or climb out with \"..\" are reported as missing instead of crashing ripgrep (exit 2, no output).\n */\nexport async function normalizePrefixes(\n  session: WorkspaceSession,\n  prefixes: string[],\n): Promise<{ ok: string[]; missing: string[] }> {\n  const cleaned = prefixes.map((raw) => ({ raw, rel: cleanPrefix(raw) }));\n  const lookup = [\n    ...new Set(cleaned.map((c) => c.rel).filter((r): r is string => r !== null && r !== \".\")),\n  ];\n  const kinds = lookup.length ? await session.pathKinds(lookup) : {};\n  const ok: string[] = [];\n  const missing: string[] = [];\n  for (const { raw, rel } of cleaned) {\n    if (rel === \".\") ok.push(\".\");\n    else if (rel !== null && (kinds[rel] === \"file\" || kinds[rel] === \"directory\")) ok.push(rel);\n    else missing.push(raw);\n  }\n  return { ok: [...new Set(ok)], missing };\n}\n\n/** Workspace-relative form of a prefix, or null when it is absolute, climbs out, or starts with \"-\". */\nexport function cleanPrefix(p: string): string | null {\n  let s = p.trim().replace(/\\\\/g, \"/\");\n  if (!s || s.startsWith(\"/\") || s.startsWith(\"~\") || /^[A-Za-z]:\\//.test(s)) return null;\n  while (s.startsWith(\"./\")) s = s.slice(2);\n  s = s.replace(/\\/+$/, \"\").replace(/\\/{2,}/g, \"/\");\n  if (s === \"\" || s === \".\") return \".\";\n  if (s.startsWith(\"-\") || s.split(\"/\").some((seg) => seg === \"..\")) return null;\n  return s;\n}\n\n/** Binary (NUL in the first 8 KB, ripgrep's own heuristic) or unreadable. */\nasync function looksBinary(\n  session: WorkspaceSession,\n  path: string,\n  bytes = 8192,\n): Promise<boolean> {\n  return (await session.readText(path, bytes)) === null;\n}\n\nexport async function recall(input: RecallInput): Promise<RecallResult> {\n  const t0 = performance.now();\n  const cfg = input.config;\n  const session = input.session;\n  // any whitespace run (newline, tab) becomes one space: a literal newline is not allowed in an rg pattern\n  const kwsRaw = [\n    ...new Set(\n      input.keywords.map((k) => k.replace(/\\s+/g, \" \").trim()).filter((k) => k.length >= 2),\n    ),\n  ];\n  const prefixes = await normalizePrefixes(session, input.pathPrefixes);\n  let searchPaths = prefixes.ok.length ? prefixes.ok : [\".\"];\n  // every -p prefix missing: search the whole repository (reported as widened)\n  let widened = input.pathPrefixes.length > 0 && prefixes.ok.length === 0;\n\n  const keywordsFresh = (): KeywordInfo[] =>\n    kwsRaw.map((raw, index) => {\n      const { pattern, rgPattern, mode, variants } = buildPattern(raw, cfg);\n      return {\n        index,\n        raw,\n        variants,\n        mode,\n        pattern,\n        rgPattern,\n        df: 0,\n        pathDf: 0,\n        hitLines: 0,\n        idf: 0,\n        fragments: [],\n      };\n    });\n\n  /**\n   * ONE rg pass over the union of every keyword pattern (and, speculatively, the 2-word fragments of\n   * compound keywords); lines are then attributed to keywords in JS. ~0.2 s on a 6k-file repo versus\n   * ~1-2 s for one rg process per keyword. A union over the pattern cap takes a few passes instead.\n   */\n  const attempt = async (paths: string[]) => {\n    const keywords = keywordsFresh();\n    const slots: Slot[] = [];\n    const fragsOf = new Map<number, { frags: string[]; pattern: string }>();\n    for (const k of keywords) {\n      slots.push({\n        ki: k.index,\n        fragment: false,\n        re: jsRegex(k.pattern),\n        literals: k.variants.map((v) => v.toLowerCase()),\n      });\n      const frags = cfg.recall.fragmentFallback ? compoundFragments(k.raw) : [];\n      if (frags.length) {\n        const pattern = fragmentPattern(frags);\n        fragsOf.set(k.index, { frags, pattern });\n        slots.push({\n          ki: k.index,\n          fragment: true,\n          re: jsRegex(pattern),\n          literals: frags.flatMap((f) => keywordVariants(f)).map((v) => v.toLowerCase()),\n        });\n      }\n    }\n    const alternatives = [\n      ...keywords.map((k) => k.rgPattern),\n      ...[...fragsOf.values()].map((f) => f.pattern),\n    ];\n    const [files, matches] = await Promise.all([\n      listFiles(session, paths, cfg),\n      searchAlternatives(session, alternatives, paths, cfg),\n    ]);\n    const bySlot = attribute(matches, slots);\n    const results: RgMatch[][] = keywords.map(() => []);\n    slots.forEach((s, i) => {\n      if (!s.fragment) results[s.ki] = bySlot[i]!;\n    });\n    // zero-hit compound keywords use their fragments (the model guessed a name that does not exist)\n    slots.forEach((s, i) => {\n      if (s.fragment && results[s.ki]!.length === 0 && bySlot[i]!.length > 0) {\n        results[s.ki] = bySlot[i]!;\n        keywords[s.ki]!.fragments = fragsOf.get(s.ki)!.frags;\n      }\n    });\n    return { files, keywords, results };\n  };\n\n  let { files, keywords, results } = await attempt(searchPaths);\n  const countFiles = (rs: RgMatch[][]) => new Set(rs.flat().map((m) => m.path)).size;\n  if (prefixes.ok.length && countFiles(results) < cfg.recall.minCandidatesBeforeWiden) {\n    searchPaths = [\".\"];\n    widened = true;\n    ({ files, keywords, results } = await attempt(searchPaths));\n  }\n\n  const n = Math.max(files.length, 1);\n  const byPath = new Map<string, FileCandidate>();\n  const get = (path: string) => {\n    let c = byPath.get(path);\n    if (!c) {\n      c = {\n        path,\n        lexScore: 0,\n        kwHits: {},\n        pathKws: [],\n        hitLines: new Map(),\n        isTest: isTestPath(path),\n        isDoc: isDocPath(path),\n      };\n      byPath.set(path, c);\n    }\n    return c;\n  };\n  const kwFiles = keywords.map(() => new Set<string>());\n  const maxStored = cfg.recall.maxMatchesPerFile;\n  results.forEach((matches, ki) => {\n    const kw = keywords[ki]!;\n    const seen = kwFiles[ki]!;\n    for (const m of matches) {\n      seen.add(m.path);\n      const c = get(m.path);\n      const cnt = (c.kwHits[ki] = (c.kwHits[ki] ?? 0) + 1);\n      // every matching line counts for scoring; only the first maxMatchesPerFile per keyword are kept as hit lines\n      if (cnt > maxStored) continue;\n      let h = c.hitLines.get(m.line);\n      if (!h) {\n        h = { line: m.line, text: m.text, kws: [] };\n        c.hitLines.set(m.line, h);\n      }\n      if (!h.kws.includes(ki)) h.kws.push(ki);\n    }\n    kw.df = seen.size;\n    kw.hitLines = matches.length;\n  });\n  // path-name matches (also for files without content hits)\n  for (const kw of keywords) {\n    const variants = kw.fragments.length\n      ? kw.fragments.flatMap((f) => keywordVariants(f))\n      : kw.variants;\n    for (const f of files) {\n      if (pathMatches(f, variants)) {\n        kw.pathDf++;\n        kwFiles[kw.index]!.add(f);\n        const c = get(f);\n        if (!c.pathKws.includes(kw.index)) c.pathKws.push(kw.index);\n      }\n    }\n  }\n  // IDF over files matching by content OR path\n  for (const kw of keywords)\n    kw.idf = kwFiles[kw.index]!.size > 0 ? idfOf(kwFiles[kw.index]!.size, n) : 0;\n\n  const testsOk = questionMentionsTests(input.question);\n  const historyOk = questionMentionsHistory(input.question);\n  for (const c of byPath.values()) {\n    let s = 0;\n    let lines = 0;\n    for (const [ki, cnt] of Object.entries(c.kwHits)) {\n      s += keywords[Number(ki)]!.idf;\n      lines += cnt;\n    }\n    for (const ki of c.pathKws) s += cfg.recall.pathBonus * keywords[ki]!.idf;\n    s += cfg.recall.hitCountWeight * Math.log(1 + lines);\n    if (c.isTest && !testsOk) s *= cfg.recall.testWeight;\n    if (!historyOk && isChangelogPath(c.path)) s *= cfg.recall.changelogWeight;\n    c.lexScore = s;\n  }\n  const scored = [...byPath.values()].filter((c) => c.lexScore > 0);\n  scored.sort((a, b) => b.lexScore - a.lexScore || (a.path < b.path ? -1 : 1));\n  // `rg --files` lists binary files too; one that matches only by path (no content hit) would be windowed as text.\n  // Same result as a sequential scan: each batch holds at most the number of slots still open.\n  const candidates: FileCandidate[] = [];\n  let binaryDropped = 0;\n  let next = 0;\n  while (next < scored.length && candidates.length < cfg.recall.maxCandidates) {\n    const batch = scored.slice(next, next + cfg.recall.maxCandidates - candidates.length);\n    next += batch.length;\n    const pathOnly = batch.filter((c) => c.hitLines.size === 0);\n    const binary = new Set<FileCandidate>();\n    const flags = await mapLimit(pathOnly, READ_CONCURRENCY, (c) => looksBinary(session, c.path));\n    pathOnly.forEach((c, i) => {\n      if (flags[i]) binary.add(c);\n    });\n    for (const c of batch) {\n      if (binary.has(c)) binaryDropped++;\n      else candidates.push(c);\n    }\n  }\n  return {\n    keywords,\n    totalFiles: files.length,\n    candidates,\n    scoredFiles: scored.length,\n    searchPaths,\n    widened,\n    missingPrefixes: prefixes.missing,\n    validPrefixes: prefixes.ok,\n    binaryDropped,\n    ms: Math.round(performance.now() - t0),\n  };\n}\n\n/** Weight of one hit line: sum of IDF of the distinct keywords on it. */\nexport function lineWeight(h: HitLine, keywords: KeywordInfo[]): number {\n  return h.kws.reduce((s, k) => s + (keywords[k]?.idf ?? 0), 0);\n}\n\n/** Up to n best hit lines of a file (by distinct-keyword IDF), returned in line order (long lines are trimmed by the caller). */\nexport function bestHitLines(c: FileCandidate, keywords: KeywordInfo[], n: number): HitLine[] {\n  return [...c.hitLines.values()]\n    .sort((a, b) => lineWeight(b, keywords) - lineWeight(a, keywords) || a.line - b.line)\n    .slice(0, n)\n    .sort((a, b) => a.line - b.line);\n}\n\n/** Words of all keywords (for overlap scoring). */\nexport function keywordWords(keywords: KeywordInfo[]): Set<string> {\n  return new Set(keywords.flatMap((k) => splitWords(k.raw)));\n}\n","/**\n * search.ts - the code_search pipeline (scout-0.3.1 with the Jev judge):\n *\n *  1. recall   (ripgrep)                        -> top maxCandidates files by distinct-keyword IDF\n *  2. wave 1   (file triage, 1 Noul per file)   -> up to maxFiles files (+ lexical guard)\n *  3. wave 2   (passage verification)           -> relevance + per-sub-question coverage per passage\n *  4. wave 3   (leads, exactly one round)       -> <= maxLeadsFollowed definitions, verified like wave 2\n *  5. pack     (bounded, verbatim, line-numbered) + status (1 request over the packed evidence)\n *\n * Every file and process access goes through the injected CodeSearchWorkspace. A Jev failure fails the\n * search (JevUnavailableError / JevRequestError propagate); only a failed final status check keeps the\n * fully Jev-scored pack and reports the status as unknown.\n */\nimport { JevRequestError, JevUnavailableError, type JevClient } from \"../client\";\nimport { DEFAULT_CODE_SEARCH_CONFIG, type CodeSearchConfig } from \"./config\";\nimport {\n  JevJudge,\n  type FileItem,\n  type JudgeContext,\n  type LeadItem,\n  type PassageItem,\n} from \"./judge\";\nimport { chooseDefinitions, extractLeads, locateDefinitions, type LeadCandidate } from \"./leads\";\nimport { packBody, renderFooter, type EvidencePassage } from \"./pack\";\nimport {\n  bestHitLines,\n  excludeArgs,\n  idfOf,\n  recall,\n  type FileCandidate,\n  type KeywordInfo,\n  type RecallResult,\n} from \"./recall\";\nimport { mapLimit, READ_CONCURRENCY, WorkspaceSession } from \"./session\";\nimport {\n  contentTerms,\n  escapeRegex,\n  estTokens,\n  fmtK,\n  isDocPath,\n  keywordVariants,\n  overlap,\n  questionMentionsHistory,\n  questionMentionsTests,\n  splitWords,\n  STOPWORDS,\n  trimAround,\n} from \"./text\";\nimport {\n  buildFileWindows,\n  definitionWindow,\n  keywordRegex,\n  keywordsInRange,\n  langOf,\n  renderLines,\n  splitLines,\n  type RenderOpts,\n  type Window,\n} from \"./windows\";\nimport type { CodeSearchWorkspace } from \"./workspace\";\n\n/** The validated research version this engine ports (ranking, thresholds and defaults are unchanged). */\nexport const CODE_SEARCH_ENGINE_VERSION = \"scout-0.3.1\";\nexport const CODE_SEARCH_DEFAULT_BUDGET_TOKENS = 12_000;\n\nexport interface CodeSearchInput {\n  question: string;\n  keywords: string[];\n  subQuestions?: string[] | undefined;\n  /** Workspace-relative path prefixes to search; default the whole workspace. */\n  paths?: string[] | undefined;\n  workspace: CodeSearchWorkspace;\n  jev: JevClient;\n  signal?: AbortSignal | undefined;\n  /** Max pack size in tokens (default 12000). */\n  budgetTokens?: number | undefined;\n  /** Tuning and tests only; defaults to DEFAULT_CODE_SEARCH_CONFIG. */\n  config?: CodeSearchConfig | undefined;\n  /** In-memory stage trace (recall, wave1, wave2, leads, pack, summary, and one \"jev\" event per Jev request). */\n  onStage?: ((stage: string, data: Record<string, unknown>) => void) | undefined;\n}\n\nexport interface CodeSearchStatus {\n  label: \"sufficient\" | \"partial\" | \"insufficient\" | \"unknown\";\n  overall: number | null;\n  subs: Array<number | null>;\n  /** Set when the final Jev sufficiency check failed (the pack itself is fully Jev-scored). */\n  error?: string;\n}\n\nexport interface CodeSearchStats {\n  wallMs: number;\n  stageMs: Record<string, number>;\n  candidates: number;\n  filesSelected: number;\n  passagesVerified: number;\n  passagesIncluded: number;\n  packChars: number;\n  packTokensEst: number;\n  workspaceCalls: number;\n  /** A ripgrep call returned partial output (byte cap or time limit); the pack header says so. */\n  ripgrepTruncated: boolean;\n  jev: { requests: number; inputTokens: number; costUsd: number; model: string | null };\n}\n\nexport interface CodeSearchResult {\n  version: string;\n  /** The rendered pack: a status header line, verbatim line-numbered passages, then the footer. */\n  text: string;\n  status: CodeSearchStatus;\n  stats: CodeSearchStats;\n  /** The error of a failed final status check, for a circuit breaker (the search itself succeeded). */\n  statusCheckError?: JevUnavailableError | JevRequestError;\n}\n\nconst r2 = (x: number | null | undefined) =>\n  x === null || x === undefined || !Number.isFinite(x) ? \"?\" : x.toFixed(2);\n\n/** Lexical passage relevance in [0,1]: keyword IDF mass present, question-term overlap, file prior. */\nexport function lexicalPassageScore(\n  text: string,\n  kwPresent: number[],\n  keywords: KeywordInfo[],\n  qTerms: string[],\n  fileNorm: number,\n): number {\n  const total = keywords.reduce((s, k) => s + k.idf, 0) || 1;\n  const mass = kwPresent.reduce((s, k) => s + keywords[k]!.idf, 0) / total;\n  const qov = overlap(qTerms, new Set(contentTerms(text)));\n  return Math.max(0, Math.min(1, 0.55 * mass + 0.3 * qov + 0.15 * fileNorm));\n}\n\nexport function selectFiles(\n  cands: FileCandidate[],\n  scores: Map<string, number>,\n  ids: string[],\n  T1: number,\n  cfg: CodeSearchConfig,\n): { selected: number[]; ranked: number[] } {\n  // cands are in lexical order; ids[i] is the judge id of cands[i]\n  const ranked = cands\n    .map((_, i) => i)\n    .sort(\n      (a, b) =>\n        (scores.get(ids[b]!) ?? 0) - (scores.get(ids[a]!) ?? 0) ||\n        cands[b]!.lexScore - cands[a]!.lexScore ||\n        a - b,\n    );\n  const selected: number[] = [];\n  for (let i = 0; i < Math.min(cfg.wave1.lexicalGuard, cands.length); i++) selected.push(i);\n  ranked.forEach((i, rank) => {\n    if (selected.length >= cfg.wave1.maxFiles || selected.includes(i)) return;\n    if ((scores.get(ids[i]!) ?? 0) >= T1 || rank < cfg.wave1.minFiles) selected.push(i);\n  });\n  // priority order for windowing = judge rank order\n  selected.sort((a, b) => ranked.indexOf(a) - ranked.indexOf(b));\n  return { selected, ranked };\n}\n\n/** Round-robin across files (priority order), each file's windows by score, up to max. */\nexport function capPassages<T extends { score: number }>(perFile: T[][], max: number): T[][] {\n  const sorted = perFile.map((ws) => [...ws].sort((a, b) => b.score - a.score));\n  const out: T[][] = perFile.map(() => []);\n  let taken = 0;\n  for (let pass = 0; taken < max; pass++) {\n    let any = false;\n    for (let f = 0; f < sorted.length && taken < max; f++) {\n      const w = sorted[f]![pass];\n      if (w) {\n        out[f]!.push(w);\n        taken++;\n        any = true;\n      }\n    }\n    if (!any) break;\n  }\n  return out;\n}\n\n/** Evidence text for the status check: included passages, best first, up to maxChars (whole blocks only). */\nexport function statusEvidence(\n  included: Array<{ block: string; rel: number }>,\n  maxChars: number,\n): string {\n  const out: string[] = [];\n  let used = 0;\n  for (const p of [...included].sort((a, b) => b.rel - a.rel)) {\n    if (used + p.block.length + 2 > maxChars) continue;\n    out.push(p.block);\n    used += p.block.length + 2;\n  }\n  return out.join(\"\\n\\n\");\n}\n\nexport function statusLabel(\n  s: { overall: number; subs: number[] } | null,\n  cfg: CodeSearchConfig,\n): CodeSearchStatus {\n  if (!s || !Number.isFinite(s.overall)) return { label: \"unknown\", overall: null, subs: [] };\n  const { hi, lo } = cfg.status;\n  const subsOk = s.subs.every((x) => x >= hi);\n  const anySub = s.subs.some((x) => x >= hi);\n  const label =\n    s.overall >= hi && subsOk\n      ? \"sufficient\"\n      : s.overall >= lo || anySub\n        ? \"partial\"\n        : \"insufficient\";\n  return { label, overall: s.overall, subs: s.subs };\n}\n\n/** Footer note about paths that were missing, or a search that had to widen to the whole workspace. */\nexport function prefixNote(\n  rec: Pick<RecallResult, \"missingPrefixes\" | \"widened\" | \"validPrefixes\">,\n): string | undefined {\n  const notes: string[] = [];\n  if (rec.missingPrefixes.length) {\n    notes.push(\n      `Note: paths not found in the workspace (ignored): ${rec.missingPrefixes.join(\", \")}.`,\n    );\n  }\n  if (rec.widened) {\n    notes.push(\n      !rec.validPrefixes.length\n        ? \"Note: the whole workspace was searched.\"\n        : \"Note: nothing matched under the given paths; the whole workspace was searched.\",\n    );\n  }\n  return notes.length ? notes.join(\" \") : undefined;\n}\n\n/** Header label for partial ripgrep output, in the same position scout used for its other partial states. */\nfunction partialLabel(session: WorkspaceSession): string {\n  if (!session.partial) return \"\";\n  const why = session.timedOut\n    ? \"a ripgrep search hit its time limit\"\n    : \"ripgrep output was cut at its size limit\";\n  return `(partial search: ${why}; some matches may be missing)`;\n}\n\nexport async function runCodeSearch(input: CodeSearchInput): Promise<CodeSearchResult> {\n  const outer = input.signal;\n  outer?.throwIfAborted();\n  // One controller per search: an error in one parallel branch cancels the others.\n  const controller = new AbortController();\n  const onOuterAbort = () => controller.abort(outer?.reason);\n  outer?.addEventListener(\"abort\", onOuterAbort, { once: true });\n  try {\n    return await pipeline(input, controller.signal);\n  } catch (error) {\n    controller.abort(error);\n    if (outer?.aborted) throw outer.reason;\n    throw error;\n  } finally {\n    outer?.removeEventListener(\"abort\", onOuterAbort);\n  }\n}\n\nasync function pipeline(o: CodeSearchInput, signal: AbortSignal): Promise<CodeSearchResult> {\n  const cfg = o.config ?? DEFAULT_CODE_SEARCH_CONFIG;\n  const t0 = performance.now();\n  const stageMs: Record<string, number> = {};\n  const mark = (stage: string, since: number) => {\n    stageMs[stage] = Math.round(performance.now() - since);\n  };\n  const emit = (stage: string, data: Record<string, unknown>) => {\n    try {\n      o.onStage?.(stage, data);\n    } catch {\n      // tracing never breaks a search\n    }\n  };\n  const session = new WorkspaceSession(o.workspace, signal, cfg.recall.ripgrepTimeoutMs);\n  const judge = new JevJudge({ client: o.jev, config: cfg, signal, onEvent: emit });\n  const subQuestions = (o.subQuestions ?? [])\n    .map((s) => s.trim())\n    .filter(Boolean)\n    .slice(0, 4);\n  const ctx: JudgeContext = { question: o.question.trim(), subQuestions };\n  const budgetTokens = o.budgetTokens ?? CODE_SEARCH_DEFAULT_BUDGET_TOKENS;\n  const thr = cfg.thresholds;\n  emit(\"start\", {\n    version: CODE_SEARCH_ENGINE_VERSION,\n    question: ctx.question,\n    subQuestions,\n    keywords: o.keywords,\n    paths: o.paths ?? [],\n    budgetTokens,\n  });\n  // open keep-alive connections while recall runs\n  o.jev.warmUp(cfg.jev.warmConnections);\n\n  // ---- 1. recall\n  let ts = performance.now();\n  const rec: RecallResult = await recall({\n    session,\n    question: ctx.question + \" \" + subQuestions.join(\" \"),\n    keywords: o.keywords,\n    pathPrefixes: o.paths ?? [],\n    config: cfg,\n  });\n  mark(\"recall\", ts);\n  const kws = rec.keywords;\n  emit(\"recall\", {\n    ms: rec.ms,\n    totalFiles: rec.totalFiles,\n    scoredFiles: rec.scoredFiles,\n    searchPaths: rec.searchPaths,\n    widened: rec.widened,\n    missingPrefixes: rec.missingPrefixes,\n    binaryDropped: rec.binaryDropped,\n    partial: session.partial,\n    keywords: kws.map((k) => ({\n      raw: k.raw,\n      mode: k.mode,\n      pattern: k.pattern,\n      df: k.df,\n      pathDf: k.pathDf,\n      hitLines: k.hitLines,\n      idf: round(k.idf),\n      fragments: k.fragments,\n    })),\n    candidates: rec.candidates.map((c) => ({\n      path: c.path,\n      lex: round(c.lexScore),\n      kws: Object.keys(c.kwHits).map(Number),\n      pathKws: c.pathKws,\n      lines: c.hitLines.size,\n      test: c.isTest,\n    })),\n  });\n\n  // ---- 2. wave 1: file triage\n  ts = performance.now();\n  const maxLex = rec.candidates[0]?.lexScore || 1;\n  const fileIds = rec.candidates.map((_, i) => `f${String(i).padStart(3, \"0\")}`);\n  const fileItems: FileItem[] = rec.candidates.map((c, i) => {\n    const hits = bestHitLines(c, kws, cfg.wave1.hitLinesPerFile);\n    const needles = Object.keys(c.kwHits).flatMap((k) => kws[Number(k)]!.variants);\n    const lines = hits.map(\n      (h) => `  ${h.line}: ${trimAround(h.text, needles, cfg.wave1.hitLineChars)}`,\n    );\n    return {\n      id: fileIds[i]!,\n      path: c.path,\n      descriptor: [c.path, ...lines].join(\"\\n\"),\n      lex: c.lexScore / maxLex,\n    };\n  });\n  const fileScores = await judge.scoreFiles(fileItems, ctx);\n  const { selected, ranked } = selectFiles(rec.candidates, fileScores, fileIds, thr.T1, cfg);\n  mark(\"wave1\", ts);\n  emit(\"wave1\", {\n    T1: thr.T1,\n    scores: rec.candidates.map((c, i) => ({\n      path: c.path,\n      p: round(fileScores.get(fileIds[i]!) ?? Number.NaN),\n      lex: round(fileItems[i]!.lex),\n    })),\n    selected: selected.map((i) => rec.candidates[i]!.path),\n  });\n\n  // ---- 3. wave 2: windows + verification\n  ts = performance.now();\n  // file contents are read in parallel up front; the windowing below is synchronous\n  const fileLines = new Map<string, string[]>();\n  const loadLines = async (paths: string[]) => {\n    const missing = [...new Set(paths)].filter((p) => !fileLines.has(p));\n    const texts = await mapLimit(missing, READ_CONCURRENCY, (p) =>\n      session.readText(p, cfg.recall.maxFileBytes),\n    );\n    missing.forEach((p, i) => {\n      const text = texts[i];\n      // binary content (NUL bytes) is never rendered as a passage\n      fileLines.set(p, text === null || text === undefined ? [] : splitLines(text));\n    });\n  };\n  const readLines = (path: string): string[] => fileLines.get(path) ?? [];\n  await loadLines(selected.map((i) => rec.candidates[i]!.path));\n  const kwNeedles = kws\n    .filter((k) => k.idf > 0)\n    .map((k) => keywordRegex(k))\n    .filter((re): re is RegExp => re !== null);\n  const renderFor = (path: string, needles: RegExp[] = kwNeedles): RenderOpts => ({\n    maxLineChars: isDocPath(path) ? cfg.wave2.maxProseLineChars : cfg.wave2.maxLineChars,\n    needles,\n  });\n  const perFileWindows: Window[][] = selected.map((i) => {\n    const c = rec.candidates[i]!;\n    const lines = readLines(c.path);\n    const hits = [...c.hitLines.values()];\n    return buildFileWindows(lines, hits, kws, langOf(c.path), cfg, renderFor(c.path));\n  });\n  const capped = capPassages(perFileWindows, cfg.wave2.maxPassages);\n  const qTerms = contentTerms(ctx.question);\n  const subTerms = subQuestions.map((s) => contentTerms(s));\n  const evidence: EvidencePassage[] = [];\n  const passageItems: PassageItem[] = [];\n  let pid = 0;\n  const makePassage = (path: string, w: Window, fileNorm: number, lead?: string) => {\n    const lines = readLines(path);\n    const render = renderFor(path, lead ? [new RegExp(`\\\\b${escapeRegex(lead)}\\\\b`)] : kwNeedles);\n    const text = renderLines(lines, w.start, w.end, render);\n    const raw = lines.slice(w.start - 1, w.end).join(\"\\n\");\n    const present = keywordsInRange(lines, w.start, w.end, kws);\n    const rawTerms = new Set(contentTerms(raw));\n    const id = `p${String(pid++).padStart(3, \"0\")}`;\n    const lex = lexicalPassageScore(raw, present, kws, qTerms, fileNorm);\n    const lexCov = subTerms.map((t) => overlap(t, rawTerms));\n    const label =\n      w.label && w.label.line < w.start ? `L${w.label.line}: ${w.label.text}` : undefined;\n    passageItems.push({ id, path, start: w.start, end: w.end, text, label, lex, lexCov });\n    evidence.push({\n      id,\n      path,\n      start: w.start,\n      end: w.end,\n      fileLines: lines,\n      hits: w.hits,\n      label: w.label,\n      kind: w.kind,\n      rel: lex,\n      cov: lexCov,\n      lex,\n      lead,\n      render,\n    });\n  };\n  selected.forEach((ci, f) => {\n    const c = rec.candidates[ci]!;\n    for (const w of [...capped[f]!].sort((a, b) => a.start - b.start))\n      makePassage(c.path, w, c.lexScore / maxLex);\n  });\n  const wave2Scores = await judge.scorePassages(passageItems, ctx, \"wave2\");\n  for (const e of evidence) {\n    const s = wave2Scores.get(e.id);\n    if (s) {\n      e.rel = s.rel;\n      e.cov = s.cov;\n    }\n  }\n  mark(\"wave2\", ts);\n  emit(\"wave2\", {\n    T2: thr.T2,\n    passages: evidence.map((e) => ({\n      id: e.id,\n      path: e.path,\n      start: e.start,\n      end: e.end,\n      kind: e.kind,\n      hits: e.hits.length,\n      rel: round(e.rel),\n      cov: e.cov.map(round),\n      lex: round(e.lex ?? Number.NaN),\n    })),\n  });\n\n  // ---- 4. wave 3: leads (exactly one round)\n  ts = performance.now();\n  let leadCands: LeadCandidate[] = [];\n  let leadScores = new Map<string, number>();\n  const chosenNames = new Set<string>();\n  if (cfg.wave3.enabled) {\n    const leadsFollowed: Array<{ name: string; score: number; def: string | null }> = [];\n    const seeds = evidence\n      .filter((e) => e.rel >= thr.T2)\n      .sort((a, b) => b.rel - a.rel)\n      .slice(0, cfg.wave3.seedPassages)\n      .map((e) => ({\n        path: e.path,\n        start: e.start,\n        lines: e.fileLines.slice(e.start - 1, e.end),\n        rel: e.rel,\n      }));\n    const searched = new Set<string>();\n    for (const k of kws) {\n      for (const v of [...k.variants, ...k.fragments.flatMap((f) => keywordVariants(f))]) {\n        searched.add(v.toLowerCase());\n        searched.add(splitWords(v).join(\" \"));\n      }\n    }\n    const qWords = new Set(\n      [\n        ...splitWords(ctx.question + \" \" + subQuestions.join(\" \")),\n        ...kws.flatMap((k) => splitWords(k.raw)),\n      ].filter((w) => w.length >= 3 && !STOPWORDS.has(w)),\n    );\n    // extract generously, keep only leads whose definition exists and is not already in the evidence\n    const extracted = extractLeads(\n      seeds,\n      searched,\n      qWords,\n      Math.ceil(cfg.wave3.maxLeadCandidates * 1.5),\n    );\n    const selectedPaths = new Set(selected.map((i) => rec.candidates[i]!.path));\n    const allowTests = questionMentionsTests(ctx.question);\n    const defSearch = await locateDefinitions(\n      session,\n      extracted.map((l) => l.name),\n      cfg,\n      excludeArgs(cfg),\n      12,\n      allowTests,\n    );\n    const seenAt = new Map(extracted.map((l) => [l.name, l.seenAt.path]));\n    const defs = chooseDefinitions(\n      defSearch.hits,\n      selectedPaths,\n      cfg.wave3.defsPerLead,\n      allowTests,\n      seenAt,\n    );\n    const inEvidence = (path: string, line: number) =>\n      evidence.some((e) => e.path === path && line >= e.start && line <= e.end);\n    const leadDrops: Record<string, string> = {};\n    // genericity penalty: a name defined/used as a key in many files (sessionId, workspaceId, isRecord) is rarely\n    // what the answer hinges on\n    const nFiles = Math.max(rec.totalFiles, 1);\n    const genericity = (name: string) =>\n      idfOf(defSearch.fileCounts.get(name) ?? 0, nFiles) / idfOf(0, nFiles);\n    leadCands = extracted\n      .filter((l) => {\n        const ds = defs.get(l.name) ?? [];\n        if (!ds.length) leadDrops[l.name] = \"no definition found\";\n        else if (ds.every((d) => inEvidence(d.path, d.line)))\n          leadDrops[l.name] = \"definition already in evidence\";\n        return ds.length > 0 && !ds.every((d) => inEvidence(d.path, d.line));\n      })\n      .map((l) => ({ ...l, weight: Math.round(l.weight * genericity(l.name) * 1000) / 1000 }))\n      .sort((a, b) => b.weight - a.weight || (a.name < b.name ? -1 : 1))\n      .slice(0, cfg.wave3.maxLeadCandidates);\n    const maxW = Math.max(...leadCands.map((l) => l.weight), 1e-9);\n    const leadItems: LeadItem[] = leadCands.map((l, i) => ({\n      id: `l${String(i).padStart(3, \"0\")}`,\n      name: l.name,\n      seenAt: `${l.seenAt.path}:${l.seenAt.line}`,\n      context: l.context,\n      lex: l.weight / maxW,\n    }));\n    leadScores = await judge.scoreLeads(leadItems, ctx);\n    const chosen = leadItems\n      .map((l) => ({ l, p: leadScores.get(l.id) ?? 0 }))\n      .filter((x) => x.p >= thr.T3)\n      .sort((a, b) => b.p - a.p || (a.l.id < b.l.id ? -1 : 1))\n      .slice(0, cfg.wave3.maxLeadsFollowed);\n    for (const x of chosen) chosenNames.add(x.l.name);\n    await loadLines(chosen.flatMap((x) => (defs.get(x.l.name) ?? []).map((d) => d.path)));\n    const defItemsStart = passageItems.length;\n    for (const x of chosen) {\n      for (const d of defs.get(x.l.name) ?? []) {\n        const lines = readLines(d.path);\n        // the file could not be read as text (missing, binary, UTF-16) or changed after ripgrep saw it\n        if (d.line > lines.length) {\n          leadsFollowed.push({\n            name: x.l.name,\n            score: x.p,\n            def: `${d.path}:${d.line} (not in the file as read)`,\n          });\n          continue;\n        }\n        const w = definitionWindow(\n          lines,\n          d.line,\n          langOf(d.path),\n          cfg,\n          renderFor(d.path, [new RegExp(`\\\\b${escapeRegex(x.l.name)}\\\\b`)]),\n        );\n        const overlapsExisting = evidence.some(\n          (e) => e.path === d.path && !(w.end < e.start || w.start > e.end),\n        );\n        leadsFollowed.push({\n          name: x.l.name,\n          score: x.p,\n          def: `${d.path}:${d.line}${overlapsExisting ? \" (overlaps evidence)\" : \"\"}`,\n        });\n        if (overlapsExisting) continue;\n        makePassage(d.path, w, 0, x.l.name);\n      }\n    }\n    const defItems = passageItems.slice(defItemsStart);\n    if (defItems.length) {\n      const defScores = await judge.scorePassages(defItems, ctx, \"lead_defs\");\n      for (const e of evidence) {\n        const s = defScores.get(e.id);\n        if (s) {\n          e.rel = s.rel;\n          e.cov = s.cov;\n        }\n      }\n    }\n    emit(\"leads\", {\n      T3: thr.T3,\n      seeds: seeds.map((s) => `${s.path}:${s.start}`),\n      candidates: leadItems.map((l) => ({\n        id: l.id,\n        name: l.name,\n        seenAt: l.seenAt,\n        lex: round(l.lex),\n        p: round(leadScores.get(l.id) ?? Number.NaN),\n      })),\n      followed: leadsFollowed,\n      defsFound: defSearch.hits.length,\n      defSearchMs: defSearch.ms,\n      extracted: extracted.length,\n      dropped: leadDrops,\n      defPassages: evidence\n        .filter((e) => e.kind === \"def\")\n        .map((e) => ({\n          id: e.id,\n          path: e.path,\n          start: e.start,\n          end: e.end,\n          lead: e.lead,\n          rel: round(e.rel),\n        })),\n    });\n  }\n  mark(\"wave3\", ts);\n\n  // ---- 5. pack + status\n  ts = performance.now();\n  const cpt = cfg.pack.charsPerToken;\n  const totalChars = Math.floor(budgetTokens * cpt);\n  const headerReserve = 420 + subQuestions.reduce((s, q) => s + q.length + 8, 0);\n  const footerReserve = Math.min(1800, Math.floor(totalChars * 0.12));\n  const body = packBody(evidence, {\n    subQuestions,\n    T2: thr.T2,\n    bodyChars: Math.max(0, totalChars - headerReserve - footerReserve),\n    cfg,\n    downweightChangelogs: !questionMentionsHistory(ctx.question + \" \" + subQuestions.join(\" \")),\n    downweightTests: !questionMentionsTests(ctx.question),\n  });\n  const includedFiles = new Set(body.included.map((p) => p.path));\n  const windowedFiles = new Set(evidence.map((e) => e.path));\n  const otherFiles = ranked\n    .filter((i) => !windowedFiles.has(rec.candidates[i]!.path))\n    .map((i) => ({ path: rec.candidates[i]!.path, score: fileScores.get(fileIds[i]!) ?? 0 }))\n    .filter((x) => x.score > 0);\n  const leadIdByName = new Map(leadCands.map((l, i) => [l.name, `l${String(i).padStart(3, \"0\")}`]));\n  const notFollowed = leadCands\n    .filter((l) => !chosenNames.has(l.name))\n    .map((l) => ({\n      name: l.name,\n      score: leadScores.get(leadIdByName.get(l.name)!) ?? 0,\n      seenAt: `${l.seenAt.path}:${l.seenAt.line}`,\n    }))\n    .sort((a, b) => b.score - a.score);\n  const zero = kws.filter((k) => k.df === 0 && k.pathDf === 0);\n  const fragmentOnly = kws.filter((k) => k.fragments.length > 0 && (k.df > 0 || k.pathDf > 0));\n  const zeroHitKeywords = [\n    ...zero.map((k) => ({ raw: k.raw, fragments: [] as string[] })),\n    ...fragmentOnly.map((k) => ({ raw: k.raw, fragments: k.fragments })),\n  ];\n  const widenedNote = prefixNote(rec);\n  const footer = renderFooter({\n    excluded: body.excluded,\n    otherFiles,\n    leadsNotFollowed: notFollowed,\n    zeroHitKeywords,\n    ...(widenedNote ? { widenedNote } : {}),\n    cfg,\n    maxChars: footerReserve,\n  });\n  mark(\"pack\", ts);\n\n  // A failure of the status request alone (after the pack) keeps the Jev pack with status unknown.\n  ts = performance.now();\n  let status: CodeSearchStatus = { label: \"unknown\", overall: null, subs: [] };\n  let statusCheckError: JevUnavailableError | JevRequestError | undefined;\n  let statusEvidenceChars = 0;\n  if (cfg.status.enabled && body.included.length) {\n    const ev = statusEvidence(body.included, cfg.status.maxEvidenceChars);\n    statusEvidenceChars = ev.length;\n    try {\n      status = statusLabel(await judge.status(ev, ctx), cfg);\n    } catch (error) {\n      if (\n        signal.aborted ||\n        !(error instanceof JevUnavailableError || error instanceof JevRequestError)\n      )\n        throw error;\n      statusCheckError = error;\n      status = { label: \"unknown\", overall: null, subs: [], error: error.message.slice(0, 200) };\n    }\n  } else if (!body.included.length) {\n    status = { label: \"insufficient\", overall: null, subs: [] };\n  }\n  mark(\"status\", ts);\n  emit(\"pack\", {\n    T2: thr.T2,\n    budgetTokens,\n    totalChars,\n    priority: body.priority,\n    included: body.included.map((p) => ({\n      id: p.id,\n      path: p.path,\n      start: p.start,\n      end: p.end,\n      trimmed: p.trimmed,\n      rel: round(p.rel),\n      cov: p.cov.map(round),\n      chars: p.block.length,\n    })),\n    excluded: body.excluded.map((e) => ({\n      id: e.id,\n      path: e.path,\n      start: e.start,\n      end: e.end,\n      rel: round(e.rel),\n    })),\n    status,\n    statusEvidenceChars,\n  });\n\n  // ---- render\n  const jevTotals = Object.values(judge.stats()).reduce(\n    (a, s) => ({\n      requests: a.requests + s.requests,\n      inputTokens: a.inputTokens + s.inputTokens,\n      costUsd: a.costUsd + s.costUsd,\n    }),\n    { requests: 0, inputTokens: 0, costUsd: 0 },\n  );\n  const wallMs = Math.round(performance.now() - t0);\n  const label = partialLabel(session);\n  // A number, not a verdict: \"sufficient\" read as permission to stop, but the\n  // check only sees the passages the search returned.\n  const statusText =\n    status.label === \"unknown\" || status.overall === null\n      ? status.error\n        ? \"evidence rating unknown (check failed)\"\n        : \"evidence rating unknown (no check)\"\n      : `evidence rating ${r2(status.overall)}` +\n        (status.subs.length\n          ? ` (${status.subs.map((x, j) => `s${j + 1} ${r2(x)}`).join(\", \")})`\n          : \"\");\n  const buildText = (packTok: number) => {\n    const head = [\n      `code_search${label ? \" \" + label : \"\"}: ${statusText} | ${body.included.length} passages from ${includedFiles.size} files, ~${fmtK(packTok)} tokens | ${(wallMs / 1000).toFixed(1)}s`,\n    ];\n    if (subQuestions.length) head.push(subQuestions.map((s, j) => `s${j + 1}: ${s}`).join(\"\\n\"));\n    head.push(\n      body.included.length\n        ? \"Passages are verbatim with original line numbers (N| text), grouped by file, best first; rel = relevance, [sN] = covers sub-question N. The rating covers only these passages; it cannot see other entry points, defaults, flags or exceptions the search did not return.\"\n        : \"No passage passed verification. Try other keywords (exact identifiers, config keys, error strings) or read the candidates below.\",\n    );\n    return [head.join(\"\\n\"), body.body, footer].filter(Boolean).join(\"\\n\\n\") + \"\\n\";\n  };\n  let text = buildText(0);\n  text = buildText(estTokens(text.length, cpt));\n  const stats: CodeSearchStats = {\n    wallMs,\n    stageMs,\n    candidates: rec.candidates.length,\n    filesSelected: selected.length,\n    passagesVerified: evidence.length,\n    passagesIncluded: body.included.length,\n    packChars: text.length,\n    packTokensEst: estTokens(text.length, cpt),\n    workspaceCalls: session.calls,\n    ripgrepTruncated: session.partial,\n    jev: { ...jevTotals, model: judge.model() },\n  };\n  emit(\"summary\", { wallMs, stageMs, stats, status, jevByStage: judge.stats() });\n  const result: CodeSearchResult = { version: CODE_SEARCH_ENGINE_VERSION, text, status, stats };\n  if (statusCheckError) result.statusCheckError = statusCheckError;\n  return result;\n}\n\nfunction round(x: number): number {\n  return Number.isFinite(x) ? Math.round(x * 1000) / 1000 : x;\n}\n","/**\n * tool.ts - the model-facing surface of code_search: name, description, input schema, argument\n * parsing and short error texts. The worker wires these to runCodeSearch.\n */\nimport { JevRequestError, JevUnavailableError } from \"../client\";\nimport { CodeSearchRipgrepMissingError, CodeSearchWorkspaceError } from \"./workspace\";\n\nexport const CODE_SEARCH_TOOL_NAME = \"code_search\";\n\nexport const CODE_SEARCH_TOOL_DESCRIPTION =\n  \"Find where something is implemented, configured or decided in the code under the working directory, in one call \" +\n  \"instead of many separate searches and file reads. Give one precise question and 6-15 keywords: likely identifiers, \" +\n  \"file-name fragments, config keys, error strings and synonyms. Optional subQuestions split distinct parts (for \" +\n  \"'is X required?', add one for what could skip or override X); optional paths limit the search. It ranks files and \" +\n  \"passages with a fast relevance model, follows definitions one level, and returns the best passages verbatim with \" +\n  \"file paths and line numbers, plus an evidence rating for those passages. The rating cannot see what the search \" +\n  \"missed: use the passages instead of re-reading them, then check what they do not cover (other entry points, \" +\n  \"defaults, flags, exceptions) before concluding.\";\n\nexport const CODE_SEARCH_LIMITS = {\n  questionMinChars: 3,\n  questionMaxChars: 2000,\n  keywordsMax: 20,\n  keywordMaxChars: 120,\n  subQuestionsMax: 3,\n  subQuestionMaxChars: 1000,\n  pathsMax: 8,\n  pathMaxChars: 1000,\n} as const;\n\nconst L = CODE_SEARCH_LIMITS;\n\n/** Plain JSON (mutable arrays), so it fits any JSON-schema slot of a tool definition. */\nexport type CodeSearchJsonValue =\n  | string\n  | number\n  | boolean\n  | null\n  | CodeSearchJsonValue[]\n  | { [key: string]: CodeSearchJsonValue };\n\n/** JSON schema of the tool input; parseCodeSearchArguments enforces the same rules. */\nexport const codeSearchInputSchema: { [key: string]: CodeSearchJsonValue } = {\n  type: \"object\",\n  properties: {\n    question: {\n      type: \"string\",\n      minLength: L.questionMinChars,\n      maxLength: L.questionMaxChars,\n      description:\n        \"One precise question about the code, for example where a behavior is implemented or how a value is computed.\",\n    },\n    keywords: {\n      type: \"array\",\n      minItems: 1,\n      maxItems: L.keywordsMax,\n      items: { type: \"string\", minLength: 1, maxLength: L.keywordMaxChars },\n      description:\n        \"6-15 search keywords: likely identifiers (camelCase, snake_case, UPPER_CASE), file-name fragments, config or env keys, error strings, synonyms. Case and camel/snake/kebab variants are searched automatically.\",\n    },\n    subQuestions: {\n      type: \"array\",\n      maxItems: L.subQuestionsMax,\n      items: { type: \"string\", minLength: 1, maxLength: L.subQuestionMaxChars },\n      description: \"Optional: the distinct parts of a multi-part question, one per entry.\",\n    },\n    paths: {\n      type: \"array\",\n      maxItems: L.pathsMax,\n      items: { type: \"string\", minLength: 1, maxLength: L.pathMaxChars },\n      description:\n        \"Optional: workspace-relative directories or files to limit the search to. Default: the whole workspace.\",\n    },\n  },\n  required: [\"question\", \"keywords\"],\n  additionalProperties: false,\n};\n\nexport interface CodeSearchArguments {\n  question: string;\n  keywords: string[];\n  subQuestions: string[];\n  paths: string[];\n}\n\n/** Invalid tool arguments; the message is written for the model. */\nexport class CodeSearchArgumentError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = \"CodeSearchArgumentError\";\n  }\n}\n\nconst KNOWN_ARGUMENTS = new Set([\"question\", \"keywords\", \"subQuestions\", \"paths\"]);\n\n/** Validate and normalize tool arguments (trim, drop empty entries, dedupe, workspace-relative paths). */\nexport function parseCodeSearchArguments(args: Record<string, unknown>): CodeSearchArguments {\n  const unknown = Object.keys(args).filter((k) => !KNOWN_ARGUMENTS.has(k));\n  if (unknown.length) {\n    throw new CodeSearchArgumentError(\n      `unknown argument ${unknown.map((k) => `\"${k}\"`).join(\", \")}; allowed: question, keywords, subQuestions, paths`,\n    );\n  }\n\n  if (typeof args.question !== \"string\")\n    throw new CodeSearchArgumentError(\"question is required and must be a string\");\n  const question = args.question.trim();\n  if (question.length < L.questionMinChars)\n    throw new CodeSearchArgumentError(`question must be at least ${L.questionMinChars} characters`);\n  if (question.length > L.questionMaxChars)\n    throw new CodeSearchArgumentError(`question must be at most ${L.questionMaxChars} characters`);\n\n  const keywords = stringList(args.keywords, \"keywords\", true);\n  if (!keywords.length)\n    throw new CodeSearchArgumentError(\"keywords must contain at least one non-empty keyword\");\n  if (keywords.length > L.keywordsMax)\n    throw new CodeSearchArgumentError(\n      `keywords accepts at most ${L.keywordsMax} entries; keep the ${L.keywordsMax} most specific`,\n    );\n  const longKeyword = keywords.find((k) => k.length > L.keywordMaxChars);\n  if (longKeyword)\n    throw new CodeSearchArgumentError(\n      `each keyword must be at most ${L.keywordMaxChars} characters; use short identifiers or phrases`,\n    );\n\n  const subQuestions = stringList(args.subQuestions, \"subQuestions\", false);\n  if (subQuestions.length > L.subQuestionsMax)\n    throw new CodeSearchArgumentError(`subQuestions accepts at most ${L.subQuestionsMax} entries`);\n  if (subQuestions.some((s) => s.length > L.subQuestionMaxChars)) {\n    throw new CodeSearchArgumentError(\n      `each sub-question must be at most ${L.subQuestionMaxChars} characters`,\n    );\n  }\n\n  const paths = [...new Set(stringList(args.paths, \"paths\", false).map(normalizePath))];\n  if (paths.length > L.pathsMax)\n    throw new CodeSearchArgumentError(`paths accepts at most ${L.pathsMax} entries`);\n\n  return { question, keywords, subQuestions, paths };\n}\n\nfunction stringList(value: unknown, name: string, required: boolean): string[] {\n  if (value === undefined || value === null) {\n    if (required)\n      throw new CodeSearchArgumentError(`${name} is required and must be an array of strings`);\n    return [];\n  }\n  if (!Array.isArray(value) || value.some((v) => typeof v !== \"string\")) {\n    throw new CodeSearchArgumentError(`${name} must be an array of strings`);\n  }\n  return [...new Set((value as string[]).map((v) => v.trim()).filter(Boolean))];\n}\n\nfunction normalizePath(raw: string): string {\n  if (raw.length > L.pathMaxChars)\n    throw new CodeSearchArgumentError(`each path must be at most ${L.pathMaxChars} characters`);\n  if (raw.startsWith(\"/\") || raw.startsWith(\"~\") || /^[A-Za-z]:[\\\\/]/.test(raw)) {\n    throw new CodeSearchArgumentError(\n      `path \"${raw}\" is absolute; give paths relative to the working directory`,\n    );\n  }\n  let p = raw;\n  while (p.startsWith(\"./\")) p = p.slice(2);\n  p = p.replace(/\\/+$/, \"\");\n  if (!p) p = \".\";\n  if (p.split(\"/\").some((seg) => seg === \"..\")) {\n    throw new CodeSearchArgumentError(\n      `path \"${raw}\" leaves the working directory; \"..\" is not allowed`,\n    );\n  }\n  if (p.startsWith(\"-\")) throw new CodeSearchArgumentError(`path \"${raw}\" must not start with \"-\"`);\n  return p;\n}\n\nconst FALLBACK = \"Search with exec_command (rg, sed) instead.\";\n\n/** Short model-facing text for a failed code_search call. */\nexport function renderCodeSearchError(error: unknown): string {\n  const detail = (e: unknown) =>\n    (e instanceof Error ? e.message : String(e)).replace(/\\s+/g, \" \").trim().slice(0, 240);\n  if (error instanceof CodeSearchArgumentError)\n    return `code_search: invalid arguments: ${error.message}.`;\n  if (error instanceof JevUnavailableError)\n    return `code_search is unavailable right now (${detail(error)}). ${FALLBACK}`;\n  if (error instanceof JevRequestError)\n    return `code_search failed: the relevance model rejected the request (${detail(error)}). ${FALLBACK}`;\n  if (isRipgrepMissing(error)) {\n    return \"code_search cannot run here: ripgrep (rg) is not installed in this workspace. Search with exec_command (grep, find, sed) instead.\";\n  }\n  if (error instanceof CodeSearchWorkspaceError)\n    return `code_search could not search this workspace (${detail(error)}). ${FALLBACK}`;\n  if (isAbort(error)) return \"code_search was cancelled.\";\n  return `code_search failed unexpectedly (${detail(error)}). ${FALLBACK}`;\n}\n\nfunction isRipgrepMissing(error: unknown): boolean {\n  if (error instanceof CodeSearchRipgrepMissingError) return true;\n  if (!(error instanceof CodeSearchWorkspaceError)) return false;\n  const m = error.message;\n  return /ripgrep|\\brg\\b/i.test(m) && /not (installed|found)|missing|ENOENT|no such file/i.test(m);\n}\n\nfunction isAbort(error: unknown): boolean {\n  return (\n    typeof error === \"object\" &&\n    error !== null &&\n    (error as { name?: unknown }).name === \"AbortError\"\n  );\n}\n"],"mappings":";AAYO,IAAM,uBAAuB;AAC7B,IAAM,oBAAoB;AAE1B,IAAM,yCAAyC;AA6E/C,SAAS,KACd,cACA,UACiB;AACjB,SAAO,WAAW,EAAE,MAAM,QAAQ,cAAc,SAAS,IAAI,EAAE,MAAM,QAAQ,aAAa;AAC5F;AAEO,SAAS,WAAW,aAA6B;AACtD,SAAQ,cAAc,yCAA0C;AAClE;AAMO,IAAM,WAAN,cAAuB,MAAM;AAAA;AAAA,EAEzB;AAAA;AAAA,EAEA;AAAA,EAET,YAAY,SAAiB,UAA+D,CAAC,GAAG;AAC9F,UAAM,SAAS,QAAQ,UAAU,SAAY,SAAY,EAAE,OAAO,QAAQ,MAAM,CAAC;AACjF,SAAK,OAAO,WAAW;AACvB,SAAK,SAAS,QAAQ;AACtB,SAAK,OAAO,QAAQ;AAAA,EACtB;AACF;AAGO,IAAM,sBAAN,cAAkC,SAAS;AAAC;AAG5C,IAAM,kBAAN,cAA8B,SAAS;AAAC;AAqBxC,IAAM,qBAAgC;AAAA,EAC3C,iBAAiB;AAAA,EACjB,aAAa;AAAA,EACb,QAAQ;AAAA,EACR,oBAAoB;AAAA,EACpB,qBAAqB;AAAA,EACrB,wBAAwB;AAC1B;AAGO,IAAM,sBAAsB;AAE5B,SAAS,kBAAkB,OAAgB,gBAAgB,qBAA6B;AAC7F,QAAM,IAAI,OAAO,UAAU,WAAW,QAAQ,KAAK,UAAU,SAAS,EAAE;AACxE,SAAO,KAAK,KAAK,EAAE,SAAS,aAAa;AAC3C;AAMO,SAAS,WACd,aACA,gBACA,SAAoB,oBACR;AACZ,QAAM,aAAa,OAAO,kBAAkB,OAAO;AACnD,QAAM,SAAS,OAAO,cAAc,OAAO;AAC3C,QAAM,OAAO,cAAc,OAAO;AAClC,QAAM,SAAqB,CAAC;AAC5B,MAAI,MAAgB,CAAC;AACrB,MAAI,SAAS;AACb,aAAW,CAAC,IAAI,EAAE,KAAK,gBAAgB;AACrC,UAAM,OAAO,KAAK,OAAO;AACzB,QAAI,OAAO,OAAO,YAAY;AAC5B,YAAM,IAAI;AAAA,QACR,eAAe,WAAW,2BAA2B,EAAE,OAAO,EAAE,qBAAqB,KAAK,MAAM,UAAU,CAAC;AAAA,QAC3G,EAAE,MAAM,kBAAkB;AAAA,MAC5B;AAAA,IACF;AACA,QACE,IAAI,SAAS,MACZ,OAAO,SAAS,OAAO,UAAU,IAAI,UAAU,OAAO,yBACvD;AACA,aAAO,KAAK,GAAG;AACf,YAAM,CAAC;AACP,eAAS;AAAA,IACX;AACA,QAAI,KAAK,EAAE;AACX,cAAU;AAAA,EACZ;AACA,MAAI,IAAI,OAAQ,QAAO,KAAK,GAAG;AAC/B,SAAO;AACT;AAMO,IAAM,aAAN,MAAiB;AAAA,EAItB,YAAqB,KAAa;AAAb;AAAA,EAAc;AAAA,EAH3B,SAAS;AAAA,EACA,QAAsC,CAAC;AAAA,EAIxD,MAAM,IAAO,IAAsB,QAAkC;AACnE,UAAM,KAAK,QAAQ,MAAM;AACzB,QAAI;AACF,aAAO,MAAM,GAAG;AAAA,IAClB,UAAE;AACA,WAAK,QAAQ;AAAA,IACf;AAAA,EACF;AAAA,EAEQ,QAAQ,QAAqC;AACnD,YAAQ,eAAe;AACvB,QAAI,KAAK,SAAS,KAAK,KAAK;AAC1B,WAAK,UAAU;AACf,aAAO,QAAQ,QAAQ;AAAA,IACzB;AACA,WAAO,IAAI,QAAc,CAAC,SAAS,WAAW;AAC5C,YAAM,UAAU,MAAM;AACpB,cAAM,IAAI,KAAK,MAAM,QAAQ,KAAK;AAClC,YAAI,KAAK,EAAG,MAAK,MAAM,OAAO,GAAG,CAAC;AAClC,eAAO,QAAQ,MAAM;AAAA,MACvB;AACA,YAAM,QAAQ;AAAA,QACZ,OAAO,MAAM;AACX,kBAAQ,oBAAoB,SAAS,OAAO;AAC5C,kBAAQ;AAAA,QACV;AAAA,MACF;AACA,WAAK,MAAM,KAAK,KAAK;AACrB,cAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAAA,IAC3D,CAAC;AAAA,EACH;AAAA;AAAA,EAGQ,UAAgB;AACtB,UAAM,OAAO,KAAK,MAAM,MAAM;AAC9B,QAAI,KAAM,MAAK,MAAM;AAAA,QAChB,MAAK,UAAU;AAAA,EACtB;AACF;AAyBA,IAAM,mBAAmB,CAAC,WAAmB,WAAW,OAAQ,UAAU,OAAO,UAAU;AAC3F,IAAM,cAAc,CAAC,WAAmB,WAAW,OAAO,WAAW,OAAO,WAAW;AAEvF,IAAM,iBAAiB;AACvB,IAAM,kBAAkB;AACxB,IAAM,mBAAmB;AAElB,IAAM,YAAN,MAAgB;AAAA,EACZ;AAAA,EACA;AAAA,EACQ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACT,iBAAiB;AAAA,EAEzB,YAAY,SAA2B;AACrC,QAAI,CAAC,QAAQ,OAAQ,OAAM,IAAI,oBAAoB,+BAA+B;AAClF,SAAK,SAAS,QAAQ;AACtB,SAAK,WAAW,QAAQ,WAAW,sBAAsB,QAAQ,QAAQ,EAAE;AAC3E,SAAK,QAAQ,QAAQ,SAAS;AAC9B,SAAK,YAAY,QAAQ,aAAa;AACtC,SAAK,aAAa,KAAK,IAAI,GAAG,QAAQ,cAAc,CAAC;AACrD,SAAK,kBAAkB,KAAK,IAAI,GAAG,QAAQ,mBAAmB,GAAK;AACnE,SAAK,mBAAmB,KAAK,IAAI,GAAG,QAAQ,oBAAoB,GAAG;AACnE,SAAK,UAAU,IAAI,WAAW,KAAK,IAAI,GAAG,QAAQ,eAAe,EAAE,CAAC;AACpE,SAAK,YAAY,QAAQ,UAAU,CAAC,KAAK,SAAS,MAAM,KAAK,IAAI;AAAA,EACnE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,IACJ,OACA,WACA,UAAyB,CAAC,GACA;AAC1B,UAAM,EAAE,OAAO,IAAI;AACnB,YAAQ,eAAe;AACvB,UAAM,MAAM,OAAO,KAAK,SAAS;AACjC,QAAI,CAAC,IAAI,OAAQ,OAAM,IAAI,gBAAgB,uCAAuC;AAClF,UAAM,cAAc,kBAAkB,KAAK;AAC3C,UAAM,SAAS;AAAA,MACb;AAAA,MACA,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,kBAAkB,UAAU,EAAE,CAAC,CAAC,CAAU;AAAA,IACjE;AACA,UAAM,QAAQ,QAAQ,MAAM,GAAG,QAAQ,GAAG,OAAO;AACjD,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC5B,OAAO;AAAA,QAAI,CAACA,WACV,KAAK,QAAQ;AAAA,UACX,MACE,KAAK;AAAA,YACH,KAAK,UAAU;AAAA,cACb;AAAA,cACA,OAAO,KAAK;AAAA,cACZ,WAAW,OAAO,YAAYA,OAAM,IAAI,CAAC,OAAO,CAAC,IAAI,UAAU,EAAE,CAAC,CAAC,CAAC;AAAA,YACtE,CAAC;AAAA,YACD;AAAA,YACA;AAAA,UACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,UAAM,UAAqC,CAAC;AAC5C,QAAI,cAAc;AAClB,QAAI,QAAQ;AACZ,YAAQ,QAAQ,CAAC,MAAM,MAAM;AAC3B,YAAM,MAAM,SAAS,KAAK,OAAO,IAAI,KAAK,UAAU,CAAC;AACrD,iBAAW,MAAM,OAAO,CAAC,GAAI;AAC3B,cAAM,SAAS,gBAAgB,IAAI,EAAE,CAAC;AACtC,YAAI,CAAC;AACH,gBAAM,IAAI,oBAAoB,GAAG,KAAK,uCAAuC,EAAE,GAAG;AACpF,gBAAQ,EAAE,IAAI;AAAA,MAChB;AACA,YAAM,QAAQ,SAAS,KAAK,KAAK,IAAI,KAAK,QAAQ,CAAC;AACnD,qBAAe,OAAO,MAAM,gBAAgB,CAAC,KAAK;AAClD,UAAI,OAAO,KAAK,UAAU,YAAY,KAAK,MAAO,SAAQ,KAAK;AAAA,IACjE,CAAC;AACD,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,OAAO,EAAE,YAAY;AAAA,MACrB,UAAU,QAAQ;AAAA,MAClB,SAAS,WAAW,WAAW;AAAA,IACjC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,aAA2B;AAChC,UAAM,MAAM,KAAK,IAAI;AACrB,QAAI,eAAe,KAAK,MAAM,KAAK,iBAAiB,eAAgB;AACpE,SAAK,iBAAiB;AACtB,aAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,YAAM,UAAU,YAAY,QAAQ,eAAe;AACnD,WAAK,UAAU,GAAG,KAAK,OAAO,YAAY,EAAE,QAAQ,OAAO,QAAQ,QAAQ,CAAC,EACzE,KAAK,CAAC,QAAQ,IAAI,YAAY,CAAC,EAC/B,MAAM,MAAM,MAAS;AAAA,IAC1B;AAAA,EACF;AAAA;AAAA,EAGA,MAAc,KACZ,MACA,OACA,QACkC;AAClC,UAAM,MAAM,GAAG,KAAK,OAAO;AAC3B,UAAM,UAAU,EAAE,gBAAgB,oBAAoB,eAAe,UAAU,KAAK,MAAM,GAAG;AAC7F,QAAI,YAAY;AAChB,QAAI;AACJ,aAAS,UAAU,GAAG,WAAW,KAAK,YAAY,WAAW;AAC3D,cAAQ,eAAe;AACvB,YAAM,gBAAgB,YAAY,QAAQ,KAAK,SAAS;AACxD,UAAI,QAAQ,KAAK,QAAQ,OAAO;AAChC,UAAI,WAAmD;AACvD,UAAI;AACF,cAAM,MAAM,MAAM,KAAK,UAAU,KAAK;AAAA,UACpC,QAAQ;AAAA,UACR;AAAA,UACA;AAAA,UACA,QAAQ,cAAc;AAAA,QACxB,CAAC;AACD,mBAAW,EAAE,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE;AAAA,MAC3C,SAAS,OAAO;AACd,YAAI,QAAQ,QAAS,OAAM,OAAO;AAClC,qBAAa;AACb,oBAAY,cAAc,SAAS,IAC/B,mBAAmB,KAAK,SAAS,QACjC,cAAc,KAAK;AAAA,MACzB,UAAE;AACA,sBAAc,QAAQ;AACtB,aAAK,iBAAiB,KAAK,IAAI;AAAA,MACjC;AACA,UAAI,UAAU;AACZ,cAAM,EAAE,KAAK,KAAK,IAAI;AACtB,YAAI,IAAI,IAAI;AACV,gBAAM,OAAO,UAAU,IAAI;AAC3B,cAAI,CAAC,SAAS,IAAI;AAChB,kBAAM,IAAI,oBAAoB,GAAG,KAAK,uCAAuC;AAC/E,iBAAO;AAAA,QACT;AACA,cAAM,SAAS,YAAY,IAAI;AAC/B,cAAM,SAAS,OAAO,UAAU,KAAK,OAAO,OAAO,KAAK;AACxD,YAAI,YAAY,IAAI,MAAM,GAAG;AAC3B,gBAAM,OAAO,IAAI,WAAW,MAAM,uBAAuB;AACzD,gBAAM,IAAI;AAAA,YACR,GAAG,KAAK,OAAO,IAAI,iBAAiB,IAAI,MAAM,GAAG,MAAM;AAAA,YACvD,aAAa,IAAI,QAAQ,OAAO,IAAI;AAAA,UACtC;AAAA,QACF;AACA,YAAI,CAAC,iBAAiB,IAAI,MAAM,GAAG;AACjC,gBAAM,IAAI;AAAA,YACR,GAAG,KAAK,kCAAkC,IAAI,MAAM,GAAG,MAAM;AAAA,YAC7D,aAAa,IAAI,QAAQ,OAAO,IAAI;AAAA,UACtC;AAAA,QACF;AACA,qBAAa,IAAI;AACjB,oBAAY,QAAQ,IAAI,MAAM,GAAG,MAAM;AACvC,cAAM,aAAa,gBAAgB,IAAI,QAAQ,IAAI,aAAa,CAAC;AACjE,YAAI,eAAe,KAAM,SAAQ,KAAK,IAAI,YAAY,KAAK,eAAe;AAAA,MAC5E;AACA,UAAI,UAAU,KAAK,WAAY,OAAM,MAAM,OAAO,MAAM;AAAA,IAC1D;AACA,UAAM,IAAI;AAAA,MACR,GAAG,KAAK,yBAAyB,KAAK,aAAa,CAAC,cAAc,SAAS;AAAA,MAC3E,eAAe,SAAY,CAAC,IAAI,EAAE,QAAQ,WAAW;AAAA,IACvD;AAAA,EACF;AAAA,EAEQ,QAAQ,SAAyB;AACvC,UAAM,OAAO,KAAK,IAAI,KAAK,iBAAiB,KAAK,mBAAmB,KAAK,OAAO;AAChF,WAAO,KAAK,MAAM,QAAQ,IAAI,KAAK,OAAO,IAAI,KAAK;AAAA,EACrD;AACF;AAMA,SAAS,SAAS,OAAkD;AAClE,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;AAEA,SAAS,UAAU,MAAuB;AACxC,MAAI;AACF,WAAO,OAAO,KAAK,MAAM,IAAI,IAAI;AAAA,EACnC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,gBAAgB,KAAgC;AACvD,MAAI,CAAC,SAAS,GAAG,EAAG,QAAO;AAC3B,MAAI,IAAI,SAAS,QAAQ;AACvB,WAAO,EAAE,MAAM,QAAQ,aAAa,OAAO,IAAI,SAAS,WAAW,IAAI,OAAO,OAAO,IAAI;AAAA,EAC3F;AACA,MAAI,IAAI,SAAS,UAAU;AACzB,UAAM,SAA0B;AAAA,MAC9B,MAAM;AAAA,MACN,QAAQ,OAAO,IAAI,UAAU,IAAI,UAAU,EAAE;AAAA,IAC/C;AACA,QAAI,SAAS,IAAI,aAAa;AAC5B,aAAO,gBAAgB,IAAI;AAC7B,QAAI,OAAO,IAAI,eAAe,SAAU,QAAO,aAAa,IAAI;AAChE,WAAO;AAAA,EACT;AACA,MAAI,IAAI,SAAS;AACf,WAAO,EAAE,GAAG,KAAK,MAAM,SAAS,OAAO,OAAO,IAAI,KAAK,EAAE;AAC3D,SAAO;AACT;AAEA,SAAS,aAAa,QAAgB,MAA6D;AACjG,SAAO,SAAS,SAAY,EAAE,OAAO,IAAI,EAAE,QAAQ,KAAK;AAC1D;AAGA,SAAS,YAAY,MAA6D;AAChF,QAAM,OAAO,UAAU,IAAI;AAC3B,QAAM,QAAkB,CAAC;AACzB,MAAI,UAAU;AACd,QAAM,QAAQ,CAAC,UAAmB;AAChC,QAAI,OAAO,UAAU,UAAU;AAC7B,UAAI,CAAC,QAAS,WAAU;AACxB;AAAA,IACF;AACA,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAI,CAAC,QAAS,WAAU,KAAK,UAAU,KAAK;AAC5C;AAAA,IACF;AACA,QAAI,CAAC,SAAS,KAAK,EAAG;AACtB,eAAW,OAAO,CAAC,QAAQ,MAAM,GAAG;AAClC,YAAM,IAAI,MAAM,GAAG;AACnB,UAAI,OAAO,MAAM,YAAY,MAAM,QAAS,OAAM,KAAK,CAAC;AAAA,IAC1D;AACA,eAAW,OAAO,CAAC,UAAU,SAAS,WAAW,KAAK,EAAG,KAAI,OAAO,MAAO,OAAM,MAAM,GAAG,CAAC;AAAA,EAC7F;AACA,MAAI,SAAS,KAAM,WAAU,KAAK,KAAK;AAAA,MAClC,OAAM,IAAI;AACf,MAAI,OAAO,MAAM,CAAC;AAClB,MAAI,CAAC,QAAQ,yBAAyB,KAAK,OAAO,EAAG,QAAO;AAC5D,SAAO,EAAE,MAAM,SAAS,QAAQ,QAAQ,QAAQ,GAAG,EAAE,MAAM,GAAG,gBAAgB,EAAE;AAClF;AAEA,SAAS,gBAAgB,QAAsC;AAC7D,MAAI,CAAC,OAAQ,QAAO;AACpB,QAAM,OAAO,OAAO,MAAM;AAC1B,MAAI,OAAO,SAAS,IAAI,EAAG,QAAO,KAAK,IAAI,GAAG,OAAO,GAAI;AACzD,QAAM,KAAK,KAAK,MAAM,MAAM;AAC5B,SAAO,OAAO,SAAS,EAAE,IAAI,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,CAAC,IAAI;AAC9D;AAEA,SAAS,cAAc,OAAwB;AAC7C,QAAM,OAAO,iBAAiB,QAAQ,GAAG,MAAM,IAAI,KAAK,MAAM,OAAO,KAAK,OAAO,KAAK;AACtF,SAAO,KAAK,MAAM,GAAG,gBAAgB;AACvC;AAGA,SAAS,YACP,QACA,WACuE;AACvE,QAAM,aAAa,IAAI,gBAAgB;AACvC,MAAI,WAAW;AACf,QAAM,UAAU,MAAM,WAAW,MAAM,QAAQ,MAAM;AACrD,QAAM,QAAQ,WAAW,MAAM;AAC7B,eAAW;AACX,eAAW,MAAM,IAAI,oBAAoB,+BAA+B,SAAS,KAAK,CAAC;AAAA,EACzF,GAAG,SAAS;AACZ,MAAI,QAAQ,QAAS,YAAW,MAAM,OAAO,MAAM;AAAA,MAC9C,SAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAC9D,SAAO;AAAA,IACL,QAAQ,WAAW;AAAA,IACnB,UAAU,MAAM;AAAA,IAChB,SAAS,MAAM;AACb,mBAAa,KAAK;AAClB,cAAQ,oBAAoB,SAAS,OAAO;AAAA,IAC9C;AAAA,EACF;AACF;AAEA,SAAS,MAAM,IAAY,QAAgD;AACzE,MAAI,MAAM,EAAG,QAAO,QAAQ,QAAQ;AACpC,SAAO,IAAI,QAAc,CAAC,SAAS,WAAW;AAC5C,UAAM,UAAU,MAAM;AACpB,mBAAa,KAAK;AAClB,aAAO,QAAQ,MAAM;AAAA,IACvB;AACA,UAAM,QAAQ,WAAW,MAAM;AAC7B,cAAQ,oBAAoB,SAAS,OAAO;AAC5C,cAAQ;AAAA,IACV,GAAG,EAAE;AACL,QAAI,QAAQ,QAAS,SAAQ;AAAA,QACxB,SAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAAA,EAChE,CAAC;AACH;;;ACjhBO,IAAM,oBAAN,MAAwB;AAAA,EACZ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACT,sBAAsB;AAAA,EACtB,YAA2B;AAAA,EAC3B,QAA8D;AAAA,EAC9D,cAAc;AAAA,EACd,cAA+C;AAAA,EAEvD,YAAY,UAAoC,CAAC,GAAG;AAClD,SAAK,mBAAmB,KAAK,IAAI,GAAG,QAAQ,oBAAoB,CAAC;AACjE,SAAK,aAAa,QAAQ,cAAc,IAAI;AAC5C,SAAK,iBAAiB,QAAQ,kBAAkB,KAAK;AAIrD,SAAK,iBAAiB,QAAQ,kBAAkB,KAAK;AAAA,EACvD;AAAA;AAAA,EAGA,OAAO,MAAc,KAAK,IAAI,GAAY;AACxC,WAAO,KAAK,cAAc,QAAQ,MAAM,KAAK;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,MAAc,KAAK,IAAI,GAA2B;AAC3D,QAAI,KAAK,cAAc,KAAM,QAAO,KAAK,MAAM,KAAK;AACpD,QAAI,MAAM,KAAK,UAAW,QAAO;AACjC,QAAI,KAAK,UAAU,QAAQ,MAAM,KAAK,MAAM,YAAY,KAAK,eAAgB,QAAO;AACpF,UAAM,QAAQ,KAAK,MAAM,IAAI;AAC7B,SAAK,QAAQ,EAAE,OAAO,WAAW,IAAI;AACrC,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,QAAQ,OAA8B;AACpC,QAAI,KAAK,UAAU,QAAQ,KAAK,MAAM,UAAU,MAAO,MAAK,QAAQ;AAAA,EACtE;AAAA;AAAA,EAGA,cAAc,QAAuC;AACnD,SAAK,sBAAsB;AAC3B,SAAK,YAAY;AACjB,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA,EAGA,cAAc,OAAgB,MAAc,KAAK,IAAI,GAAG,OAAsC;AAC5F,QAAI,EAAE,iBAAiB,sBAAsB;AAC3C,UAAI,MAAO,MAAK,QAAQ,KAAK;AAC7B;AAAA,IACF;AACA,UAAM,WAAW,KAAK,cAAc,QAAQ,OAAO,KAAK;AACxD,SAAK,uBAAuB;AAC5B,SAAK,cAAc,EAAE,SAAS,MAAM,SAAS,QAAQ,MAAM,UAAU,MAAM,IAAI,IAAI;AACnF,QAAI,YAAY,KAAK,uBAAuB,KAAK,kBAAkB;AACjE,YAAM,OAAO,MAAM,WAAW,OAAO,MAAM,WAAW,OAAO,MAAM,WAAW;AAC9E,WAAK,YAAY,OAAO,OAAO,KAAK,iBAAiB,KAAK;AAE1D,WAAK,QAAQ;AAAA,IACf;AAAA,EACF;AAAA,EAEA,OAAO,MAAc,KAAK,IAAI,GAAqB;AACjD,UAAM,QACJ,KAAK,cAAc,OAAO,WAAW,MAAM,KAAK,YAAY,SAAS;AACvE,WAAO;AAAA,MACL;AAAA,MACA,qBAAqB,KAAK;AAAA,MAC1B,WAAW,UAAU,SAAS,KAAK,YAAY;AAAA,MAC/C,eACE,UAAU,eACV,KAAK,UAAU,QACf,MAAM,KAAK,MAAM,YAAY,KAAK;AAAA,MACpC,aAAa,KAAK;AAAA,IACpB;AAAA,EACF;AAAA,EAEQ,MAAM,OAAiC;AAC7C,WAAO,OAAO,OAAO,EAAE,IAAI,KAAK,eAAe,MAAM,CAAC;AAAA,EACxD;AACF;;;ACOO,IAAM,6BAAyD,WAAW;AAAA,EAC/E,QAAQ;AAAA,IACN,eAAe;AAAA,IACf,mBAAmB;AAAA,IACnB,cAAc;AAAA,IACd,gBAAgB;AAAA,IAChB,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,gBAAgB;AAAA,IAChB,iBAAiB;AAAA,IACjB,kBAAkB;AAAA,IAClB,0BAA0B;AAAA,IAC1B,eAAe,CAAC;AAAA,IAChB,cAAc;AAAA,IACd,iBAAiB;AAAA,IACjB,kBAAkB;AAAA,EACpB;AAAA,EACA,OAAO;AAAA,IACL,iBAAiB;AAAA,IACjB,iBAAiB;AAAA,IACjB,cAAc;AAAA,IACd,UAAU;AAAA,IACV,UAAU;AAAA,IACV,cAAc;AAAA,EAChB;AAAA,EACA,OAAO;AAAA,IACL,gBAAgB;AAAA,IAChB,iBAAiB;AAAA,IACjB,OAAO;AAAA,IACP,SAAS;AAAA,IACT,gBAAgB;AAAA,IAChB,gBAAgB;AAAA,IAChB,eAAe;AAAA,IACf,UAAU;AAAA,IACV,gBAAgB;AAAA,IAChB,oBAAoB;AAAA,IACpB,iBAAiB;AAAA,IACjB,aAAa;AAAA,IACb,cAAc;AAAA,IACd,mBAAmB;AAAA,IACnB,gBAAgB;AAAA,IAChB,qBAAqB;AAAA,EACvB;AAAA,EACA,OAAO;AAAA,IACL,SAAS;AAAA,IACT,mBAAmB;AAAA,IACnB,kBAAkB;AAAA,IAClB,cAAc;AAAA,IACd,aAAa;AAAA,EACf;AAAA,EACA,QAAQ,EAAE,SAAS,MAAM,kBAAkB,KAAQ,IAAI,KAAK,IAAI,IAAI;AAAA,EACpE,MAAM;AAAA,IACJ,eAAe;AAAA,IACf,aAAa;AAAA,IACb,cAAc;AAAA,IACd,YAAY;AAAA,IACZ,gBAAgB;AAAA,IAChB,kBAAkB;AAAA,IAClB,cAAc;AAAA,IACd,aAAa;AAAA,IACb,iBAAiB;AAAA,IACjB,gBAAgB;AAAA,IAChB,UAAU;AAAA,IACV,WAAW;AAAA,IACX,WAAW;AAAA,EACb;AAAA,EACA,KAAK;AAAA,IACH,wBAAwB;AAAA,IACxB,yBAAyB;AAAA,IACzB,iBAAiB;AAAA,EACnB;AAAA;AAAA;AAAA,EAGA,YAAY,EAAE,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI;AAC1C,CAAC;AAGM,SAAS,iBAAiB,WAAqC,CAAC,GAAqB;AAC1F,QAAM,OAAO,gBAAgB,0BAA0B;AACvD,QAAM,MAAM;AACZ,aAAW,CAAC,SAAS,MAAM,KAAK,OAAO,QAAQ,QAAmC,GAAG;AACnF,UAAM,SAAS,IAAI,OAAO;AAC1B,QAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,uCAAuC,OAAO,EAAE;AAC7E,QAAI,CAAC,cAAc,MAAM,EAAG,OAAM,IAAI,MAAM,sBAAsB,OAAO,mBAAmB;AAC5F,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AACjD,UAAI,EAAE,OAAO,QAAS,OAAM,IAAI,MAAM,mCAAmC,OAAO,IAAI,GAAG,EAAE;AACzF,YAAM,UAAU,OAAO,GAAG;AAC1B,UAAI,MAAM,QAAQ,OAAO,IAAI,CAAC,MAAM,QAAQ,KAAK,IAAI,OAAO,YAAY,OAAO,OAAO;AACpF,cAAM,IAAI;AAAA,UACR,sBAAsB,OAAO,IAAI,GAAG,cAAc,MAAM,QAAQ,OAAO,IAAI,UAAU,OAAO,OAAO;AAAA,QACrG;AAAA,MACF;AACA,aAAO,GAAG,IAAI;AAAA,IAChB;AAAA,EACF;AACA,2BAAyB,IAAI;AAC7B,SAAO;AACT;AAEO,SAAS,yBAAyB,GAA2B;AAClE,QAAM,QAAkB,CAAC;AACzB,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,EAAE,UAAU;AAC9C,QAAI,EAAE,KAAK,KAAK,KAAK,GAAI,OAAM,KAAK,cAAc,CAAC,mBAAmB;AACxE,MAAI,EAAE,MAAM,WAAW,EAAG,OAAM,KAAK,6BAA6B;AAClE,MAAI,EAAE,MAAM,WAAW,EAAE,MAAM,SAAU,OAAM,KAAK,0CAA0C;AAC9F,MAAI,EAAE,MAAM,kBAAkB,KAAK,EAAE,MAAM,kBAAkB;AAC3D,UAAM,KAAK,sCAAsC;AACnD,MAAI,EAAE,MAAM,qBAAqB,EAAG,OAAM,KAAK,uCAAuC;AACtF,MAAI,EAAE,MAAM,iBAAiB,GAAI,OAAM,KAAK,oCAAoC;AAChF,MAAI,EAAE,MAAM,iBAAiB,IAAI,EAAE,MAAM;AACvC,UAAM,KAAK,wDAAwD;AACrE,MAAI,EAAE,MAAM,sBAAsB,IAAI,EAAE,MAAM,oBAAoB,KAAK;AACrE,UAAM,KAAK,wEAAwE;AAAA,EACrF;AACA,MAAI,EAAE,MAAM,oBAAoB,IAAK,OAAM,KAAK,wCAAwC;AACxF,MAAI,EAAE,EAAE,OAAO,MAAM,EAAE,OAAO,IAAK,OAAM,KAAK,gCAAgC;AAC9E,MAAI,EAAE,KAAK,iBAAiB,EAAG,OAAM,KAAK,gCAAgC;AAC1E,MAAI,EAAE,KAAK,cAAc,EAAG,OAAM,KAAK,+BAA+B;AACtE,MAAI,EAAE,KAAK,oBAAoB,KAAK,EAAE,KAAK,kBAAkB;AAC3D,UAAM,KAAK,0CAA0C;AACvD,aAAW,KAAK,CAAC,kBAAkB,YAAY,WAAW,GAAY;AACpE,QAAI,EAAE,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,KAAK,CAAC,KAAK,GAAI,OAAM,KAAK,QAAQ,CAAC,mBAAmB;AAAA,EACjF;AACA,MAAI,EAAE,EAAE,KAAK,aAAa,GAAI,OAAM,KAAK,6BAA6B;AACtE,MAAI,EAAE,EAAE,OAAO,kBAAkB,KAAK,EAAE,OAAO,mBAAmB;AAChE,UAAM,KAAK,yCAAyC;AACtD,MAAI,EAAE,EAAE,OAAO,mBAAmB,GAAI,OAAM,KAAK,qCAAqC;AACtF,MAAI,MAAM,OAAQ,OAAM,IAAI,MAAM,+BAA+B,MAAM,KAAK,IAAI,CAAC,EAAE;AACrF;AAEA,SAAS,cAAc,GAA0C;AAC/D,SAAO,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,CAAC;AAChE;AAEA,SAAS,WAAc,OAAa;AAClC,MAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAC/C,eAAW,KAAK,OAAO,OAAO,KAAK,EAAG,YAAW,CAAC;AAClD,WAAO,OAAO,KAAK;AAAA,EACrB;AACA,SAAO;AACT;;;AClNO,IAAM,UAAU;AAAA,EACrB,UACE;AAAA,EACF,cAAc;AAAA,IACZ,KAAK;AAAA,IACL,IAAI;AAAA,EACN;AAAA,EACA,cAAc,CAAC,IAAY,MAAc,MACvC,8BAA8B,EAAE,OAAO,IAAI,6BAA6B,CAAC;AAAA,EAC3E,kBAAkB,CAAC,IAAY,MAAc,MAC3C,8BAA8B,EAAE,OAAO,IAAI,6BAA6B,CAAC;AAAA,EAE3E,aACE;AAAA,EACF,iBAAiB,CAAC,IAAY,MAAc,GAAW,GAAW,MAChE,mBAAmB,EAAE,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,uDAAuD,CAAC;AAAA,EAC1G,iBAAiB;AAAA,IACf,MAAM;AAAA,IACN,OACE;AAAA,EACJ;AAAA,EACA,kBAAkB,CAAC,IAAY,MAAc,GAAW,GAAW,QACjE,mBAAmB,EAAE,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,oDAAoD,GAAG;AAAA,EACzG,kBAAkB;AAAA,IAChB,MAAM;AAAA,IACN,OACE;AAAA,EACJ;AAAA,EAEA,UACE;AAAA,EACF,cAAc;AAAA,IACZ,KAAK;AAAA,IACL,IAAI;AAAA,EACN;AAAA,EACA,cAAc,CAAC,IAAY,MAAc,MACvC,yBAAyB,IAAI,eAAe,EAAE,0CAA0C,CAAC;AAAA,EAE3F,YACE;AAAA,EACF,gBAAgB,CAAC,MACf,+DAA+D,CAAC;AAAA,EAClE,mBAAmB,CAAC,QAClB,+EAA+E,GAAG;AAAA,EACpF,gBAAgB;AAAA,IACd,MAAM;AAAA,IACN,OACE;AAAA,EACJ;AACF;AAEA,SAAS,QAAQ,UAAkB,UAA0B;AAC3D,SAAO,SAAS,UAAU,WAAW,MAAM,QAAQ,MAAM;AAC3D;AAEA,SAAS,SAAS,KAA4C;AAC5D,SAAO,IAAI,aAAa,SACpB,EAAE,eAAe,OAAO,YAAY,IAAI,aAAa,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IACtF,CAAC;AACP;AAMO,SAAS,iBAAiB,OAAmB,KAAmB,KAAuB;AAC5F,QAAM,IAAI,QAAQ,IAAI,UAAU,IAAI,IAAI,sBAAsB;AAG9D,QAAM,OAAO,IAAI,IAAI;AACrB,QAAM,QAAQ;AAAA,IACZ,MAAM,QAAQ;AAAA,IACd,UAAU,IAAI;AAAA,IACd,GAAG,SAAS,GAAG;AAAA,IACf,GAAI,OAAO,CAAC,IAAI,EAAE,UAAU,QAAQ,aAAa;AAAA,IACjD,OAAO,OAAO,YAAY,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AAAA,EAClE;AACA,QAAM,YAA6C,OAAO;AAAA,IACxD,MAAM,IAAI,CAAC,MAAM;AAAA,MACf,EAAE;AAAA,MACF,OACI,KAAK,QAAQ,iBAAiB,EAAE,IAAI,EAAE,MAAM,CAAC,GAAG;AAAA,QAC9C,MAAM,QAAQ,aAAa;AAAA,QAC3B,OAAO,QAAQ,aAAa;AAAA,MAC9B,CAAC,IACD,KAAK,QAAQ,aAAa,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;AAAA,IAChD,CAAC;AAAA,EACH;AACA,SAAO,EAAE,OAAO,UAAU;AAC5B;AAEO,SAAS,oBACd,OACA,KACA,KACA;AACA,QAAM,IAAI,QAAQ,IAAI,UAAU,IAAI,IAAI,sBAAsB;AAC9D,QAAM,QAAQ;AAAA,IACZ,MAAM,QAAQ;AAAA,IACd,UAAU,IAAI;AAAA,IACd,GAAG,SAAS,GAAG;AAAA,IACf,UAAU,OAAO;AAAA,MACf,MAAM,IAAI,CAAC,MAAM;AAAA,QACf,EAAE;AAAA,QACF;AAAA,UACE,MAAM,EAAE;AAAA,UACR,OAAO,GAAG,EAAE,KAAK,IAAI,EAAE,GAAG;AAAA,UAC1B,GAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,IAAI,CAAC;AAAA,UACjC,MAAM,EAAE;AAAA,QACV;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AACA,QAAM,YAA6C,CAAC;AACpD,aAAW,KAAK,OAAO;AACrB,cAAU,QAAQ,EAAE,EAAE,EAAE,IAAI;AAAA,MAC1B,QAAQ,gBAAgB,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC;AAAA,MACvD,QAAQ;AAAA,IACV;AACA,QAAI,aAAa,QAAQ,CAAC,KAAK,MAAM;AACnC,gBAAU,QAAQ,EAAE,EAAE,KAAK,CAAC,EAAE,IAAI;AAAA,QAChC,QAAQ,iBAAiB,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,GAAG;AAAA,QAC1D,QAAQ;AAAA,MACV;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO,EAAE,OAAO,UAAU;AAC5B;AAEO,SAAS,iBAAiB,OAAmB,KAAmB,KAAuB;AAC5F,QAAM,IAAI,QAAQ,IAAI,UAAU,IAAI,IAAI,sBAAsB;AAC9D,QAAM,QAAQ;AAAA,IACZ,MAAM,QAAQ;AAAA,IACd,UAAU,IAAI;AAAA,IACd,GAAG,SAAS,GAAG;AAAA,IACf,UAAU,QAAQ;AAAA,IAClB,OAAO,OAAO;AAAA,MACZ,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,GAAG,EAAE,IAAI,cAAc,EAAE,MAAM,MAAM,EAAE,OAAO,EAAE,CAAC;AAAA,IAC3E;AAAA,EACF;AACA,QAAM,YAA6C,OAAO;AAAA,IACxD,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,KAAK,QAAQ,aAAa,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;AAAA,EACtE;AACA,SAAO,EAAE,OAAO,UAAU;AAC5B;AAEO,SAAS,mBAAmB,UAAkB,KAAmB,KAAuB;AAC7F,QAAM,IAAI,QAAQ,IAAI,UAAU,IAAI,IAAI,sBAAsB;AAC9D,QAAM,QAAQ,EAAE,MAAM,QAAQ,YAAY,UAAU,IAAI,UAAU,GAAG,SAAS,GAAG,GAAG,SAAS;AAC7F,QAAM,YAA6C;AAAA,IACjD,SAAS,KAAK,QAAQ,eAAe,CAAC,GAAG,QAAQ,cAAc;AAAA,EACjE;AACA,MAAI,aAAa,QAAQ,CAAC,KAAK,MAAM;AACnC,cAAU,QAAQ,CAAC,EAAE,IAAI,KAAK,QAAQ,kBAAkB,GAAG,GAAG,QAAQ,cAAc;AAAA,EACtF,CAAC;AACD,SAAO,EAAE,OAAO,UAAU;AAC5B;AAGO,SAAS,cACd,OACA,YACA,UACiB;AACjB,QAAM,MAAuB,CAAC;AAC9B,MAAI,MAAqB,CAAC;AAC1B,MAAI,QAAQ;AACZ,aAAW,KAAK,OAAO;AACrB,UAAM,IAAI,EAAE,KAAK;AACjB,QAAI,IAAI,WAAW,IAAI,UAAU,cAAc,QAAQ,IAAI,WAAW;AACpE,UAAI,KAAK,GAAG;AACZ,YAAM,CAAC;AACP,cAAQ;AAAA,IACV;AACA,QAAI,KAAK,CAAC;AACV,aAAS;AAAA,EACX;AACA,MAAI,IAAI,OAAQ,KAAI,KAAK,GAAG;AAC5B,SAAO;AACT;AAGO,SAAS,UAAa,IAAS,GAAkB;AACtD,MAAI,CAAC,GAAG,OAAQ,QAAO,CAAC;AACxB,QAAM,SAAS,KAAK,KAAK,GAAG,SAAS,CAAC;AACtC,QAAM,OAAO,KAAK,KAAK,GAAG,SAAS,MAAM;AACzC,SAAO,MAAM,IAAI,IAAI;AACvB;AAEA,SAAS,MAAS,IAAS,GAAkB;AAC3C,QAAM,MAAa,CAAC;AACpB,WAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK,EAAG,KAAI,KAAK,GAAG,MAAM,GAAG,IAAI,CAAC,CAAC;AAClE,SAAO;AACT;AAEA,IAAM,SAAS,CAAC,MACd,KAAK,EAAE,SAAS,UAAU,OAAO,SAAS,EAAE,WAAW,IAAI,EAAE,cAAc,OAAO;AAEpF,SAAS,MAAM,GAAW,KAAqB;AAC7C,SAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AAClC;AAMO,IAAM,WAAN,MAAe;AAAA,EAIpB,YACmB,GAMjB;AANiB;AAAA,EAMhB;AAAA,EAVc,aAAyC,CAAC;AAAA,EACnD,WAA0B;AAAA,EAWlC,QAAoC;AAClC,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,QAAuB;AACrB,WAAO,KAAK;AAAA,EACd;AAAA,EAEQ,KAAK,OAA2B;AACtC,WAAQ,KAAK,WAAW,KAAK,MAAM,EAAE,UAAU,GAAG,aAAa,GAAG,SAAS,GAAG,IAAI,EAAE;AAAA,EACtF;AAAA;AAAA,EAGA,MAAc,IACZ,OACA,OACA,WACoC;AACpC,UAAM,KAAK,YAAY,IAAI;AAC3B,UAAM,IAAI,MAAM,KAAK,EAAE,OAAO,IAAI,OAAO,WAAW;AAAA,MAClD,KAAK;AAAA,MACL,QAAQ,KAAK,EAAE;AAAA,IACjB,CAAC;AACD,UAAM,KAAK,KAAK,KAAK,KAAK;AAC1B,OAAG,YAAY,EAAE;AACjB,OAAG,eAAe,EAAE,MAAM;AAC1B,OAAG,WAAW,EAAE;AAChB,SAAK,WAAW,EAAE,SAAS,KAAK;AAChC,SAAK,EAAE,UAAU,OAAO;AAAA,MACtB,UAAU;AAAA,MACV,IAAI,KAAK,MAAM,YAAY,IAAI,IAAI,EAAE;AAAA,MACrC,UAAU,EAAE;AAAA,MACZ,OAAO,EAAE;AAAA,MACT,aAAa,EAAE,MAAM;AAAA,MACrB,SAAS,EAAE;AAAA,MACX;AAAA,MACA;AAAA,MACA,SAAS,EAAE;AAAA,IACb,CAAC;AACD,WAAO,EAAE;AAAA,EACX;AAAA;AAAA,EAGA,MAAc,MACZ,OACA,SACA,OACA,MACyB;AACzB,UAAM,KAAK,YAAY,IAAI;AAC3B,QAAI;AACF,YAAM,UAAU,MAAM,QAAQ;AAAA,QAC5B,QAAQ,IAAI,OAAO,MAAM;AACvB,gBAAM,MAAM,MAAM,CAAC;AACnB,iBAAO,KAAK,GAAG,MAAM,KAAK,IAAI,OAAO,IAAI,OAAO,IAAI,SAAS,CAAC;AAAA,QAChE,CAAC;AAAA,MACH;AACA,aAAO,IAAI,IAAI,QAAQ,KAAK,CAAC;AAAA,IAC/B,UAAE;AACA,WAAK,KAAK,KAAK,EAAE,MAAM,KAAK,MAAM,YAAY,IAAI,IAAI,EAAE;AAAA,IAC1D;AAAA,EACF;AAAA,EAEA,MAAM,WAAW,OAAmB,KAAiD;AACnF,QAAI,CAAC,MAAM,OAAQ,QAAO,oBAAI,IAAI;AAClC,WAAO,KAAK;AAAA,MACV;AAAA,MACA,UAAU,OAAO,KAAK,EAAE,OAAO,MAAM,eAAe;AAAA,MACpD,CAAC,MAAM,iBAAiB,GAAG,KAAK,KAAK,EAAE,MAAM;AAAA,MAC7C,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,MAAM,OAAO,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAAA,IAC9D;AAAA,EACF;AAAA,EAEA,MAAM,cACJ,OACA,KACA,QAAQ,SAC4B;AACpC,QAAI,CAAC,MAAM,OAAQ,QAAO,oBAAI,IAAI;AAClC,UAAM,IAAI,KAAK,EAAE,OAAO;AACxB,WAAO,KAAK;AAAA,MACV;AAAA,MACA,cAAc,OAAO,EAAE,oBAAoB,EAAE,eAAe;AAAA,MAC5D,CAAC,MAAM,oBAAoB,GAAG,KAAK,KAAK,EAAE,MAAM;AAAA,MAChD,CAAC,GAAG,MACF,EAAE,IAAI,CAAC,MAAM;AAAA,QACX,EAAE;AAAA,QACF;AAAA,UACE,KAAK,MAAM,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG;AAAA,UAC3C,KAAK,IAAI,aAAa;AAAA,YAAI,CAAC,GAAG,MAC5B,MAAM,OAAO,EAAE,QAAQ,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC;AAAA,UACzD;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACL;AAAA,EACF;AAAA,EAEA,MAAM,WAAW,OAAmB,KAAiD;AACnF,QAAI,CAAC,MAAM,OAAQ,QAAO,oBAAI,IAAI;AAClC,WAAO,KAAK;AAAA,MACV;AAAA,MACA,MAAM,OAAO,GAAG;AAAA,MAChB,CAAC,MAAM,iBAAiB,GAAG,KAAK,KAAK,EAAE,MAAM;AAAA,MAC7C,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,MAAM,OAAO,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAAA,IAC9D;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,OAAO,UAAkB,KAAgD;AAC7E,QAAI,CAAC,SAAS,KAAK,EAAG,QAAO;AAC7B,UAAM,MAAM,mBAAmB,UAAU,KAAK,KAAK,EAAE,MAAM;AAC3D,UAAM,KAAK,YAAY,IAAI;AAC3B,QAAI;AACF,YAAM,IAAI,MAAM,KAAK,IAAI,UAAU,IAAI,OAAO,IAAI,SAAS;AAC3D,aAAO;AAAA,QACL,SAAS,OAAO,EAAE,OAAO;AAAA,QACzB,MAAM,IAAI,aAAa,IAAI,CAAC,GAAG,MAAM,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;AAAA,MAC7D;AAAA,IACF,UAAE;AACA,WAAK,KAAK,QAAQ,EAAE,MAAM,KAAK,MAAM,YAAY,IAAI,IAAI,EAAE;AAAA,IAC7D;AAAA,EACF;AACF;;;AC7YO,IAAM,gCAAgC;AA2BtC,IAAM,2BAAN,cAAuC,MAAM;AAAC;AAO9C,IAAM,gCAAN,cAA4C,yBAAyB;AAAA,EAC1E,YAAY,UAAU,mDAAmD;AACvE,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;;;AC/CO,IAAM,mBAAmB;AAEzB,IAAM,4BAA4B;AAElC,IAAM,mBAAN,MAAuB;AAAA,EAO5B,YACmB,WACR,QACQ,kBACjB;AAHiB;AACR;AACQ;AAAA,EAChB;AAAA,EAVH,QAAQ;AAAA;AAAA,EAER,YAAY;AAAA;AAAA,EAEZ,WAAW;AAAA,EAQX,IAAI,UAAmB;AACrB,WAAO,KAAK,aAAa,KAAK;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,QACJ,MACA,UAAsC,CAAC,GACtB;AACjB,SAAK,OAAO,eAAe;AAC3B,SAAK;AACL,UAAM,IAAI,MAAM,KAAK,UAAU,QAAQ,MAAM;AAAA,MAC3C,QAAQ,KAAK;AAAA,MACb,WAAW,KAAK;AAAA,IAClB,CAAC;AACD,SAAK,OAAO,eAAe;AAC3B,QAAI,EAAE,UAAW,MAAK,YAAY;AAClC,QAAI,EAAE,SAAU,MAAK,WAAW;AAChC,QAAI,EAAE,aAAa,KAAK,CAAC,EAAE,UAAU,CAAC,EAAE,aAAa,CAAC,EAAE,YAAY,CAAC,QAAQ,cAAc;AACzF,YAAM,IAAI,yBAAyB,6CAA6C;AAAA,IAClF;AACA,WAAO,EAAE;AAAA,EACX;AAAA;AAAA,EAGA,MAAM,SAAS,MAAc,UAA0C;AACrE,SAAK,OAAO,eAAe;AAC3B,SAAK;AACL,UAAM,IAAI,MAAM,KAAK,UAAU,SAAS,MAAM,EAAE,QAAQ,KAAK,QAAQ,SAAS,CAAC;AAC/E,SAAK,OAAO,eAAe;AAC3B,QAAI,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,SAAS,IAAQ,EAAG,QAAO;AACxD,WAAO,EAAE;AAAA,EACX;AAAA,EAEA,MAAM,UACJ,OAC2D;AAC3D,SAAK,OAAO,eAAe;AAC3B,SAAK;AACL,UAAM,IAAI,MAAM,KAAK,UAAU,UAAU,OAAO,EAAE,QAAQ,KAAK,OAAO,CAAC;AACvE,SAAK,OAAO,eAAe;AAC3B,WAAO;AAAA,EACT;AACF;AAGA,eAAsB,SACpB,OACA,OACA,IACc;AACd,QAAM,MAAM,IAAI,MAAS,MAAM,MAAM;AACrC,MAAI,OAAO;AACX,QAAM,SAAS,YAAY;AACzB,WAAO,OAAO,MAAM,QAAQ;AAC1B,YAAM,IAAI;AACV,UAAI,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC,CAAE;AAAA,IAC7B;AAAA,EACF;AACA,QAAM,QAAQ,IAAI,MAAM,KAAK,EAAE,QAAQ,KAAK,IAAI,OAAO,MAAM,MAAM,EAAE,GAAG,MAAM,CAAC;AAC/E,SAAO;AACT;;;ACnFO,SAAS,WAAW,GAAqB;AAC9C,SAAO,EACJ,QAAQ,sBAAsB,OAAO,EACrC,QAAQ,yBAAyB,OAAO,EACxC,MAAM,eAAe,EACrB,OAAO,OAAO,EACd,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC;AAC/B;AAEA,IAAM,MAAM,CAAC,MAAe,IAAI,EAAE,CAAC,EAAG,YAAY,IAAI,EAAE,MAAM,CAAC,IAAI;AAO5D,SAAS,gBAAgB,IAAsB;AACpD,QAAM,MAAM,GAAG,KAAK;AACpB,MAAI,CAAC,IAAK,QAAO,CAAC;AAClB,QAAM,QAAQ,WAAW,GAAG;AAC5B,QAAM,MAAgB,CAAC,GAAG;AAC1B,MAAI,MAAM,UAAU,GAAG;AACrB,QAAI,KAAK,MAAM,CAAC,IAAI,MAAM,MAAM,CAAC,EAAE,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC;AACpD,QAAI,KAAK,MAAM,KAAK,GAAG,CAAC;AACxB,QAAI,KAAK,MAAM,KAAK,GAAG,CAAC;AACxB,QAAI,KAAK,MAAM,KAAK,GAAG,CAAC;AAAA,EAC1B;AACA,QAAM,OAAO,oBAAI,IAAY;AAC7B,SAAO,IAAI,OAAO,CAAC,MAAM;AACvB,UAAM,IAAI,EAAE,YAAY;AACxB,QAAI,KAAK,IAAI,CAAC,KAAK,EAAE,SAAS,EAAG,QAAO;AACxC,SAAK,IAAI,CAAC;AACV,WAAO;AAAA,EACT,CAAC;AACH;AAGO,SAAS,kBAAkB,IAAsB;AACtD,QAAM,QAAQ,WAAW,EAAE;AAC3B,MAAI,MAAM,SAAS,EAAG,QAAO,CAAC;AAC9B,QAAM,MAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,IAAI,MAAM,QAAQ,KAAK;AACzC,UAAM,IAAI,MAAM,CAAC;AACjB,UAAM,IAAI,MAAM,IAAI,CAAC;AACrB,QAAI,EAAE,SAAS,EAAE,SAAS,EAAG;AAC7B,QAAI,KAAK,IAAI,IAAI,CAAC,CAAC;AAAA,EACrB;AACA,SAAO,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC;AACzB;AAGO,SAAS,iBAAiB,IAAY,QAAyB;AACpE,SAAO,cAAc,KAAK,EAAE,KAAK,GAAG,UAAU,UAAU,WAAW,EAAE,EAAE,WAAW;AACpF;AAGO,SAAS,YAAY,GAAmB;AAC7C,SAAO,EAAE,QAAQ,4BAA4B,CAAC,MAAM,KAAK,CAAC,EAAE;AAC9D;AAEO,IAAM,YAAY,IAAI;AAAA,EAEzB,2uBAOA,MAAM,GAAG;AACb;AAGO,SAAS,KAAK,GAAmB;AACtC,MAAI,IAAI,EAAE,YAAY;AACtB,MAAI,EAAE,SAAS,KAAK,EAAE,SAAS,KAAK,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE,IAAI;AAAA,WACnD,EAAE,SAAS,MAAM,EAAE,SAAS,KAAK,KAAK,EAAE,SAAS,KAAK,GAAI,KAAI,EAAE,MAAM,GAAG,EAAE;AAAA,WAC3E,EAAE,SAAS,MAAM,EAAE,SAAS,IAAI,KAAK,EAAE,SAAS,IAAI,KAAK,EAAE,SAAS,IAAI;AAC/E,QAAI,EAAE,MAAM,GAAG,EAAE;AAAA,WACV,EAAE,SAAS,KAAK,EAAE,SAAS,GAAG,KAAK,CAAC,EAAE,SAAS,IAAI,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AAChF,SAAO;AACT;AAGO,SAAS,aAAa,MAAc,SAAS,GAAa;AAC/D,QAAM,MAAM,oBAAI,IAAY;AAC5B,aAAW,OAAO,KAAK,MAAM,wBAAwB,KAAK,CAAC,GAAG;AAC5D,eAAW,KAAK,WAAW,GAAG,GAAG;AAC/B,UAAI,EAAE,SAAS,UAAU,UAAU,IAAI,CAAC,EAAG;AAC3C,UAAI,IAAI,KAAK,CAAC,CAAC;AAAA,IACjB;AAAA,EACF;AACA,SAAO,CAAC,GAAG,GAAG;AAChB;AAGO,SAAS,QAAQ,OAAiB,WAAgC;AACvE,MAAI,CAAC,MAAM,OAAQ,QAAO;AAC1B,MAAI,IAAI;AACR,aAAW,KAAK,MAAO,KAAI,UAAU,IAAI,CAAC,EAAG;AAC7C,SAAO,IAAI,MAAM;AACnB;AAEO,SAAS,WAAW,GAAoB;AAC7C,SACE,oDAAoD,KAAK,CAAC,KAAK,yBAAyB,KAAK,CAAC;AAElG;AAGO,SAAS,gBAAgB,GAAoB;AAClD,SACE,qDAAqD,KAAK,CAAC,KAAK,sBAAsB,KAAK,CAAC;AAEhG;AAGO,SAAS,wBAAwB,GAAoB;AAC1D,SAAO,sHAAsH;AAAA,IAC3H;AAAA,EACF;AACF;AAEO,SAAS,UAAU,GAAoB;AAC5C,SAAO,uBAAuB,KAAK,CAAC;AACtC;AAEO,SAAS,sBAAsB,GAAoB;AACxD,SAAO,6DAA6D,KAAK,CAAC;AAC5E;AAGO,SAAS,WAAW,MAAc,SAAmB,UAA0B;AACpF,QAAM,IAAI,KAAK,QAAQ,OAAO,IAAI,EAAE,KAAK;AACzC,MAAI,EAAE,UAAU,SAAU,QAAO;AACjC,QAAM,QAAQ,EAAE,YAAY;AAC5B,MAAI,KAAK;AACT,aAAW,KAAK,SAAS;AACvB,UAAM,IAAI,MAAM,QAAQ,EAAE,YAAY,CAAC;AACvC,QAAI,KAAK,MAAM,KAAK,KAAK,IAAI,IAAK,MAAK;AAAA,EACzC;AACA,MAAI,KAAK,EAAG,QAAO,EAAE,MAAM,GAAG,WAAW,CAAC,IAAI;AAC9C,QAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,KAAK,MAAM,WAAW,CAAC,GAAG,EAAE,SAAS,QAAQ,CAAC;AACtF,QAAM,IAAI,EAAE,MAAM,OAAO,QAAQ,WAAW,CAAC;AAC7C,UAAQ,QAAQ,IAAI,QAAQ,MAAM,KAAK,QAAQ,WAAW,IAAI,EAAE,SAAS,QAAQ;AACnF;AAEO,SAAS,UAAU,OAAe,eAA+B;AACtE,SAAO,KAAK,KAAK,QAAQ,aAAa;AACxC;AAEO,SAAS,KAAK,GAAmB;AACtC,SAAO,KAAK,MAAO,IAAI,IAAI,KAAM,QAAQ,CAAC,CAAC,MAAM,OAAO,CAAC;AAC3D;;;AC7HO,IAAM,gBAAgB,IAAI;AAAA;AAAA,EAG7B,klFAgCA,MAAM,KAAK;AACf;AAEA,IAAM,UAAU,oBAAI,IAAI;AAAA,EACtB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAGM,SAAS,aAAa,MAA2B;AACtD,QAAM,MAAM,oBAAI,IAAY;AAC5B,QAAM,MAAM;AAAA,IACV;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,aAAW,MAAM,IAAK,YAAW,KAAK,KAAK,SAAS,EAAE,EAAG,KAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAE,EAAG,KAAI,IAAI,EAAE,CAAC,CAAE;AAE/F,aAAW,KAAK,KAAK,SAAS,oCAAoC,GAAG;AACnE,eAAW,QAAQ,EAAE,CAAC,EAAG,MAAM,GAAG,GAAG;AACnC,YAAM,OAAO,KAAK,MAAM,GAAG,EAAE,IAAI,EAAG,MAAM,GAAG,EAAE,CAAC,EAAG,KAAK;AACxD,UAAI,qBAAqB,KAAK,IAAI,EAAG,KAAI,IAAI,IAAI;AAAA,IACnD;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,kBAAkB,MAAqD;AACrF,QAAM,MAA6C,CAAC;AACpD,aAAW,KAAK,KAAK,SAAS,8CAA8C;AAC1E,QAAI,KAAK,EAAE,MAAM,EAAE,CAAC,GAAI,MAAM,OAAO,CAAC;AACxC,QAAM,MAAM,mCAAmC,KAAK,IAAI;AACxD,MAAI,KAAK;AACP,eAAW,QAAQ,IAAI,CAAC,EAAG,MAAM,GAAG,GAAG;AACrC,YAAM,OAAO,KACV,QAAQ,eAAe,EAAE,EACzB,MAAM,UAAU,EAAE,CAAC,EACnB,KAAK;AACR,UAAI,qBAAqB,KAAK,IAAI,EAAG,KAAI,KAAK,EAAE,MAAM,MAAM,SAAS,CAAC;AAAA,IACxE;AAAA,EACF;AACA,aAAW,KAAK,KAAK,SAAS,6CAA6C;AACzE,QAAI,KAAK,EAAE,MAAM,EAAE,CAAC,GAAI,MAAM,OAAO,CAAC;AACxC,aAAW,KAAK,KAAK,SAAS,sCAAsC;AAClE,QAAI,KAAK,EAAE,MAAM,EAAE,CAAC,GAAI,MAAM,WAAW,CAAC;AAC5C,aAAW,KAAK,KAAK,SAAS,wCAAwC;AACpE,QAAI,KAAK,EAAE,MAAM,EAAE,CAAC,GAAI,MAAM,SAAS,CAAC;AAC1C,SAAO;AACT;AAEA,SAAS,YAAY,MAAc,MAAc,MAAM,KAAa;AAClE,QAAM,IAAI,KAAK,KAAK,EAAE,QAAQ,QAAQ,GAAG;AACzC,MAAI,EAAE,UAAU,IAAK,QAAO;AAC5B,QAAM,IAAI,KAAK,IAAI,GAAG,EAAE,QAAQ,IAAI,IAAI,EAAE;AAC1C,UAAQ,IAAI,IAAI,QAAQ,MAAM,EAAE,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI;AAC1D;AAMO,SAAS,aACd,OACA,UACA,eACA,KACiB;AACjB,QAAM,UAAU,oBAAI,IAAY;AAChC,aAAW,KAAK,MAAO,YAAW,KAAK,aAAa,EAAE,MAAM,KAAK,IAAI,CAAC,EAAG,SAAQ,IAAI,CAAC;AACtF,QAAM,SAAS,oBAAI,IAA2B;AAC9C,aAAW,KAAK,OAAO;AACrB,UAAM,SAAS,oBAAI,IAAY;AAC/B,UAAM,QAAQ,uBAAuB,KAAK,EAAE,IAAI;AAChD,UAAM,MAAM,UAAU,KAAK,EAAE,IAAI;AACjC,MAAE,MAAM,QAAQ,CAAC,MAAM,MAAM;AAC3B,UAAI,CAAC,SAAS,gCAAgC,KAAK,IAAI,EAAG;AAE1D,YAAM,OAAO,SAAS,KAAK,MAAM,UAAU,KAAK,CAAC,GAAG,KAAK,GAAG,IAAI;AAChE,UAAI,CAAC,KAAM;AACX,iBAAW,EAAE,MAAM,KAAK,KAAK,kBAAkB,IAAI,GAAG;AACpD,YAAI,KAAK,SAAS,KAAK,QAAQ,IAAI,IAAI,KAAK,cAAc,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI;AACrF;AACF,YAAI,OAAO,WAAW,KAAK,IAAI,EAAG;AAClC,YAAI,SAAS,IAAI,KAAK,YAAY,CAAC,KAAK,SAAS,IAAI,WAAW,IAAI,EAAE,KAAK,GAAG,CAAC,EAAG;AAClF,YAAI,IAAI,OAAO,IAAI,IAAI;AACvB,YAAI,CAAC,GAAG;AACN,cAAI;AAAA,YACF;AAAA,YACA,QAAQ;AAAA,YACR,aAAa;AAAA,YACb,QAAQ;AAAA,YACR,QAAQ,EAAE,MAAM,EAAE,MAAM,MAAM,EAAE,QAAQ,EAAE;AAAA,YAC1C,SAAS,YAAY,MAAM,IAAI;AAAA,YAC/B,OAAO,CAAC;AAAA,UACV;AACA,iBAAO,IAAI,MAAM,CAAC;AAAA,QACpB;AACA,UAAE;AACF,YAAI,SAAS,OAAQ,GAAE,SAAS;AAChC,YAAI,CAAC,EAAE,MAAM,SAAS,IAAI,EAAG,GAAE,MAAM,KAAK,IAAI;AAC9C,YAAI,CAAC,OAAO,IAAI,IAAI,GAAG;AACrB,YAAE,UAAU,EAAE;AACd,iBAAO,IAAI,IAAI;AAAA,QACjB;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AACA,QAAM,QAAQ,CAAC,MAAqB;AAClC,UAAM,QAAQ,WAAW,EAAE,IAAI;AAC/B,UAAM,KAAK,MAAM,OAAO,CAAC,MAAM,cAAc,IAAI,CAAC,CAAC,EAAE,SAAS,KAAK,IAAI,GAAG,MAAM,MAAM;AACtF,WAAO,EAAE,SAAS,MAAM,KAAK,IAAI,GAAG,EAAE,cAAc,CAAC,KAAK,EAAE,SAAS,MAAM,KAAK;AAAA,EAClF;AACA,SAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EACvB,KAAK,CAAC,GAAG,MAAM,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE,EAChE,MAAM,GAAG,GAAG,EACZ,IAAI,CAAC,OAAO,EAAE,GAAG,GAAG,QAAQ,KAAK,MAAM,MAAM,CAAC,IAAI,GAAI,IAAI,IAAK,EAAE;AACtE;AAWO,SAAS,gBAAgB,MAAkE;AAChG,QAAM,IAAI,YAAY,IAAI;AAC1B,SAAO;AAAA,IACL;AAAA,MACE,MAAM;AAAA,MACN,IAAI,IAAI;AAAA,QACN,yGAAyG,CAAC;AAAA,MAC5G;AAAA,IACF;AAAA,IACA,EAAE,MAAM,SAAS,IAAI,IAAI,OAAO,mCAAmC,CAAC,aAAa,GAAG,EAAE;AAAA,IACtF;AAAA,MACE,MAAM;AAAA,MACN,IAAI,IAAI;AAAA,QACN,oFAAoF,CAAC;AAAA,MACvF;AAAA,IACF;AAAA,IACA,EAAE,MAAM,OAAO,IAAI,IAAI,OAAO,aAAa,CAAC,mBAAmB,EAAE;AAAA,EACnE;AACF;AAMO,SAAS,kBAAkB,OAAkC;AAClE,QAAM,MAAM,MAAM,IAAI,WAAW,EAAE,KAAK,GAAG;AAC3C,SACE,UACA;AAAA,IACE,4GAA4G,GAAG;AAAA,IAC/G,wCAAwC,GAAG;AAAA,IAC3C,uFAAuF,GAAG;AAAA,IAC1F,gBAAgB,GAAG;AAAA,EACrB,EAAE,KAAK,GAAG,IACV;AAEJ;AAMO,SAAS,mBACd,OACA,WAAW,+BACD;AACV,QAAM,MAAgB,CAAC;AACvB,MAAI,QAAkB,CAAC;AACvB,aAAW,QAAQ,OAAO;AACxB,QAAI,kBAAkB,CAAC,IAAI,CAAC,EAAE,SAAS,SAAU;AACjD,QAAI,MAAM,UAAU,kBAAkB,CAAC,GAAG,OAAO,IAAI,CAAC,EAAE,SAAS,UAAU;AACzE,UAAI,KAAK,kBAAkB,KAAK,CAAC;AACjC,cAAQ,CAAC;AAAA,IACX;AACA,UAAM,KAAK,IAAI;AAAA,EACjB;AACA,MAAI,MAAM,OAAQ,KAAI,KAAK,kBAAkB,KAAK,CAAC;AACnD,SAAO;AACT;AAEA,IAAM,YAAmD,EAAE,MAAM,GAAG,OAAO,GAAG,QAAQ,GAAG,KAAK,EAAE;AAGzF,SAAS,UAAU,MAAsB;AAC9C,QAAM,QAAQ,KAAK,MAAM,GAAG;AAC5B,SAAO,yCAAyC,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,MAAM,SAAS,IACnF,MAAM,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG,IACzB,MAAM,CAAC,KAAK;AACnB;AAOO,SAAS,kBACd,MACA,aACA,SACA,aAAa,OACb,SAA8B,oBAAI,IAAI,GACR;AAC9B,QAAM,KAAK,oBAAI,IAA6B;AAC5C,aAAW,KAAK,MAAM;AACpB,QAAI,CAAC,cAAc,WAAW,EAAE,IAAI,EAAG;AACvC,UAAM,MAAM,GAAG,IAAI,EAAE,IAAI,KAAK,CAAC;AAC/B,QAAI,KAAK,CAAC;AACV,OAAG,IAAI,EAAE,MAAM,GAAG;AAAA,EACpB;AACA,QAAM,OAAO,CAAC,OACX,OAAO,IAAI,EAAE,IAAI,MAAM,EAAE,OAAO,MAAM,MACtC,OAAO,IAAI,EAAE,IAAI,KAAK,UAAU,OAAO,IAAI,EAAE,IAAI,CAAE,MAAM,UAAU,EAAE,IAAI,IAAI,KAAK,KACnF,UAAU,EAAE,IAAI,IAAI,MACnB,WAAW,EAAE,IAAI,IAAI,IAAI,MACzB,YAAY,IAAI,EAAE,IAAI,IAAI,IAAI,MAC9B,EAAE,SAAS,SAAS,6BAA6B,KAAK,EAAE,IAAI,IAAI,IAAI;AACvE,QAAM,MAAM,oBAAI,IAA6B;AAC7C,aAAW,CAAC,MAAM,GAAG,KAAK,IAAI;AAC5B,QAAI;AAAA,MACF,CAAC,GAAG,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,IAAI,EAAE,OAAO,EAAE;AAAA,IAC1F;AACA,QAAI,IAAI,MAAM,IAAI,MAAM,GAAG,OAAO,CAAC;AAAA,EACrC;AACA,SAAO;AACT;AAUO,IAAM,oBAAoB,CAAC,sDAAsD;AAEjF,IAAM,gBAAgB;AAAA,EAC3B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAaA,eAAsB,kBACpB,SACA,OACA,KACAC,cACA,iBAAiB,IACjB,aAAa,OACc;AAC3B,QAAM,KAAK,YAAY,IAAI;AAC3B,MAAI,CAAC,MAAM,OAAQ,QAAO,EAAE,MAAM,CAAC,GAAG,YAAY,oBAAI,IAAI,GAAG,IAAI,EAAE;AACnE,QAAM,QAAQ,CAAC,GAAG,mBAAmB,GAAI,aAAa,CAAC,IAAI,aAAc,EAAE,QAAQ,CAAC,MAAM;AAAA,IACxF;AAAA,IACA;AAAA,EACF,CAAC;AACD,QAAM,UAAU,MAAM;AAAA,IAAS,mBAAmB,KAAK;AAAA,IAAG;AAAA,IAA2B,CAAC,YACpF,QAAQ;AAAA,MACN;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,OAAO,IAAI,OAAO,cAAc;AAAA,QAChC;AAAA,QACA,OAAO,IAAI,OAAO,YAAY;AAAA,QAC9B,GAAGA;AAAA,QACH,GAAG;AAAA,QACH;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,MACA,EAAE,cAAc,KAAK;AAAA,IACvB;AAAA,EACF;AACA,QAAM,QAAQ,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;AAC/D,QAAM,UAAU,IAAI,IAAI,KAAK;AAC7B,QAAM,QAAQ,oBAAI,IAAyB;AAC3C,QAAM,SAA0B,CAAC;AACjC,QAAM,OAAwB,CAAC;AAC/B,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,OAAO,QAAQ,QAAQ,CAAC,QAAQ,IAAI,MAAM,IAAI,CAAC,GAAG;AAC3D,UAAM,IAAI,IAAI,QAAQ,IAAI;AAC1B,QAAI,KAAK,EAAG;AACZ,UAAM,QAAQ,IAAI,QAAQ,KAAK,IAAI,CAAC;AACpC,QAAI,QAAQ,EAAG;AAEf,UAAM,KAAK,IAAI,MAAM,GAAG,KAAK;AAC7B,QAAI,SAAS,IAAI,EAAE,EAAG;AACtB,aAAS,IAAI,EAAE;AACf,UAAM,OAAO,IAAI,MAAM,QAAQ,CAAC;AAChC,QAAI,KAAK,SAAS,OAAO,KAAK,WAAW,oBAAoB,EAAG;AAChE,UAAM,OAAO,IAAI,MAAM,GAAG,CAAC,EAAE,QAAQ,SAAS,EAAE;AAChD,UAAM,OAAO,OAAO,IAAI,MAAM,IAAI,GAAG,KAAK,CAAC;AAC3C,UAAM,UAAU,IAAI,KAAK,KAAK,MAAM,mBAAmB,KAAK,CAAC,GAAG,OAAO,CAAC,MAAM,QAAQ,IAAI,CAAC,CAAC,CAAC;AAC7F,eAAW,QAAQ,SAAS;AAC1B,iBAAW,KAAK,MAAM,IAAI,IAAI,GAAI;AAChC,YAAI,CAAC,EAAE,GAAG,KAAK,IAAI,EAAG;AACtB,SAAC,EAAE,SAAS,QAAQ,OAAO,QAAQ,KAAK;AAAA,UACtC;AAAA,UACA;AAAA,UACA;AAAA,UACA,MAAM,EAAE;AAAA,UACR,MAAM,KAAK,KAAK,EAAE,MAAM,GAAG,GAAG;AAAA,QAChC,CAAC;AACD,YAAI,KAAK,MAAM,IAAI,IAAI;AACvB,YAAI,CAAC,GAAI,OAAM,IAAI,MAAO,KAAK,oBAAI,IAAI,CAAE;AACzC,WAAG,IAAI,IAAI;AACX;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,QAAM,YAAY,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AACnD,QAAM,UAAU,KAAK,OAAO,CAAC,MAAM,CAAC,UAAU,IAAI,EAAE,IAAI,CAAC;AACzD,QAAM,WAAW,oBAAI,IAAoB;AACzC,aAAW,KAAK,QAAS,UAAS,IAAI,EAAE,OAAO,SAAS,IAAI,EAAE,IAAI,KAAK,KAAK,CAAC;AAC7E,QAAM,OAAO,CAAC,GAAG,QAAQ,GAAG,QAAQ,OAAO,CAAC,OAAO,SAAS,IAAI,EAAE,IAAI,KAAK,MAAM,cAAc,CAAC;AAChG,OAAK,KAAK,CAAC,GAAG,MAAO,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,IAAI,EAAE,OAAO,EAAE,IAAK;AAClF,QAAM,aAAa,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;AACzE,SAAO,EAAE,MAAM,YAAY,IAAI,KAAK,MAAM,YAAY,IAAI,IAAI,EAAE,EAAE;AACpE;;;AC7ZO,SAAS,OAAO,MAAoB;AACzC,QAAM,MAAM,KAAK,YAAY,EAAE,MAAM,GAAG,EAAE,IAAI,KAAK;AACnD,MACE;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,SAAS,GAAG,GACd;AACA,WAAO;AAAA,EACT;AACA,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAE,SAAS,GAAG,EAAG,QAAO;AAChD,MAAI,CAAC,MAAM,KAAK,EAAE,SAAS,GAAG,EAAG,QAAO;AACxC,MAAI,QAAQ,MAAO,QAAO;AAC1B,SAAO;AACT;AAEO,SAAS,SAAS,MAAsB;AAC7C,MAAI,IAAI;AACR,aAAW,MAAM,MAAM;AACrB,QAAI,OAAO,IAAK,MAAK;AAAA,aACZ,OAAO,IAAM,MAAK;AAAA,QACtB;AAAA,EACP;AACA,SAAO;AACT;AAEA,IAAMC,WAAU,oBAAI,IAAI;AAAA,EACtB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,IAAM,UACJ;AACF,IAAM,iBAAiB;AACvB,IAAM,YACJ;AACF,IAAM,UAAU;AAChB,IAAM,YAAY;AAClB,IAAM,SACJ;AACF,IAAM,UACJ;AACF,IAAM,eAAe;AACrB,IAAM,gBAAgB;AACtB,IAAM,aAAa;AACnB,IAAM,WACJ;AACF,IAAM,UAAU;AAChB,IAAM,WAAW;AAEV,SAAS,WAAW,MAAc,MAAqB;AAC5D,MAAI,CAAC,KAAK,KAAK,EAAG,QAAO;AACzB,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO,WAAW,KAAK,IAAI;AAAA,IAC7B,KAAK;AACH,aAAO,SAAS,IAAI,MAAM,KAAK,SAAS,KAAK,IAAI;AAAA,IACnD,KAAK;AACH,aAAO,QAAQ,KAAK,IAAI,KAAK,SAAS,KAAK,IAAI;AAAA,IACjD,KAAK,SAAS;AACZ,UACE,QAAQ,KAAK,IAAI,KACjB,eAAe,KAAK,IAAI,KACxB,UAAU,KAAK,IAAI,KACnB,QAAQ,KAAK,IAAI,KACjB,UAAU,KAAK,IAAI;AAEnB,eAAO;AACT,UAAI,QAAQ,KAAK,IAAI,KAAK,aAAa,KAAK,IAAI,KAAK,cAAc,KAAK,IAAI,EAAG,QAAO;AACtF,YAAM,IAAI,OAAO,KAAK,IAAI;AAC1B,UACE,KACA,CAACA,SAAQ,IAAI,EAAE,CAAC,CAAE,KAClB,gBAAgB,KAAK,KAAK,QAAQ,CAAC,KACnC,CAAC,+BAA+B,KAAK,IAAI,GACzC;AACA,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAAA,IACA;AACE,aAAO;AAAA,EACX;AACF;AAGO,SAAS,iBAAiB,MAAsB;AACrD,QAAM,IAAI,KAAK,KAAK;AACpB,MAAI,EAAE,WAAW,GAAG,KAAK,EAAE,WAAW,IAAI,KAAK,EAAE,WAAW,IAAI,EAAG,QAAO;AAC1E,SAAO,KACJ,QAAQ,sBAAsB,IAAI,EAClC,QAAQ,sBAAsB,IAAI,EAClC,QAAQ,sBAAsB,IAAI,EAClC,QAAQ,gBAAgB,EAAE,EAC1B,QAAQ,WAAW,EAAE;AAC1B;AAEA,IAAM,gBAAgB,oBAAI,QAA8C;AAMjE,SAAS,SAAS,OAAiB,GAAW,MAAY,UAAU,KAAqB;AAC9F,MAAI,QAAQ,cAAc,IAAI,KAAK;AACnC,MAAI,CAAC,OAAO;AACV,YAAQ,oBAAI,IAAI;AAChB,kBAAc,IAAI,OAAO,KAAK;AAAA,EAChC;AACA,QAAM,MAAM,IAAI,IAAI,CAAC,SAAS,UAAU,YAAY,OAAO,OAAO,EAAE,QAAQ,IAAI;AAChF,MAAI,MAAM,IAAI,GAAG,EAAG,QAAO,MAAM,IAAI,GAAG;AACxC,QAAM,IAAI,gBAAgB,OAAO,GAAG,MAAM,OAAO;AACjD,QAAM,IAAI,KAAK,CAAC;AAChB,SAAO;AACT;AAEA,SAAS,gBAAgB,OAAiB,GAAW,MAAY,SAAgC;AAC/F,QAAM,IAAI,MAAM;AAChB,MAAI,IAAI,KAAK,KAAK,EAAG,QAAO;AAC5B,QAAM,OAAO,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO;AACxC,MAAI,SAAS,SAAS;AACpB,QAAI,QAAQ;AACZ,QAAI,WAAW;AACf,aAAS,IAAI,GAAG,KAAK,MAAM,KAAK;AAC9B,YAAM,IAAI,iBAAiB,MAAM,CAAC,CAAE;AACpC,iBAAW,MAAM,GAAG;AAClB,YAAI,OAAO,OAAO,OAAO,OAAO,OAAO,KAAK;AAC1C;AACA,cAAI,QAAQ,SAAU,YAAW;AAAA,QACnC,WAAW,OAAO,OAAO,OAAO,OAAO,OAAO,IAAK;AAAA,MACrD;AACA,UAAI,WAAW,KAAK,SAAS,EAAG,QAAO;AACvC,UAAI,aAAa,KAAK,QAAQ,KAAK,CAAC,EAAG,QAAO;AAAA,IAChD;AACA,WAAO;AAAA,EACT;AACA,MAAI,SAAS,UAAU;AACrB,UAAM,MAAM,SAAS,MAAM,CAAC,CAAE;AAC9B,QAAI,eAAe;AACnB,aAAS,IAAI,IAAI,GAAG,KAAK,MAAM,KAAK;AAClC,YAAM,IAAI,MAAM,CAAC;AACjB,UAAI,CAAC,EAAE,KAAK,EAAG;AACf,UAAI,SAAS,CAAC,KAAK,IAAK,QAAO;AAC/B,qBAAe;AAAA,IACjB;AACA,WAAO,SAAS,IAAI,IAAI,eAAe;AAAA,EACzC;AACA,MAAI,SAAS,YAAY;AACvB,UAAM,IAAI,WAAW,KAAK,MAAM,CAAC,CAAE;AACnC,QAAI,CAAC,EAAG,QAAO;AACf,UAAM,QAAQ,EAAE,CAAC,EAAG;AACpB,QAAI,UAAU;AACd,aAAS,IAAI,IAAI,GAAG,KAAK,MAAM,KAAK;AAClC,YAAM,IAAI,MAAM,CAAC;AACjB,UAAI,gBAAgB,KAAK,CAAC,EAAG,WAAU,CAAC;AACxC,UAAI,QAAS;AACb,YAAM,IAAI,WAAW,KAAK,CAAC;AAC3B,UAAI,KAAK,EAAE,CAAC,EAAG,UAAU,MAAO,QAAO,IAAI;AAAA,IAC7C;AACA,WAAO,SAAS,IAAI,IAAI,IAAI,IAAI;AAAA,EAClC;AACA,MAAI,SAAS,OAAO;AAClB,QAAI,WAAW;AACf,aAAS,IAAI,GAAG,KAAK,MAAM,KAAK;AAC9B,YAAM,IAAI,MAAM,CAAC,EAAG,QAAQ,SAAS,EAAE;AACvC,YAAM,WAAW,EAAE,MAAM,iBAAiB,KAAK,CAAC,GAAG;AACnD,UAAI,UAAU,MAAM,EAAG,YAAW,CAAC;AACnC,UAAI,CAAC,YAAY,QAAQ,KAAK,CAAC,EAAG,QAAO;AAAA,IAC3C;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,MAAuB;AACnD,SAAO,sCAAsC,KAAK,KAAK,KAAK,CAAC;AAC/D;AAGA,SAAS,gBAAgB,OAAiB,GAAW,MAAY,WAAW,GAAW;AACrF,MAAI,SAAS,cAAc,SAAS,QAAS,QAAO;AACpD,MAAI,IAAI;AACR,SAAO,IAAI,KAAK,IAAI,IAAI,YAAY,qBAAqB,MAAM,IAAI,CAAC,KAAK,EAAE,EAAG;AAC9E,SAAO;AACT;AAGO,SAAS,sBACd,OACA,KACA,MACA,UAAU,KACkC;AAC5C,QAAM,MAAM,SAAS,MAAM,GAAG,KAAK,EAAE;AACrC,WAAS,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,MAAM,OAAO,GAAG,KAAK;AACtD,UAAM,IAAI,MAAM,CAAC,KAAK;AACtB,QAAI,CAAC,WAAW,GAAG,IAAI,EAAG;AAC1B,QACE,SAAS,cACT,SAAS,SACT,MAAM,OACN,SAAS,CAAC,IAAI,OACb,QAAQ,KAAK,SAAS,CAAC,MAAM,GAC9B;AACA,aAAO,EAAE,MAAM,IAAI,GAAG,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,GAAG,EAAE;AAAA,IACrD;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,gBACd,OACA,SACA,MACA,KACQ;AACR,QAAM,IAAI,IAAI;AACd,QAAM,KAAK,UAAU;AACrB,QAAM,IAAI,MAAM;AAChB,QAAM,YAAY,SAAS,MAAM,EAAE,KAAK,EAAE;AAC1C,MAAI,SAAS,SAAS;AACpB,aAAS,IAAI,IAAI,KAAK,KAAK,IAAI,GAAG,KAAK,EAAE,KAAK,GAAG,KAAK;AACpD,YAAM,IAAI,MAAM,CAAC,KAAK;AACtB,UAAI,CAAC,WAAW,GAAG,IAAI,EAAG;AAC1B,WAAK,SAAS,WAAW,SAAS,aAAa,MAAM,MAAM,SAAS,CAAC,IAAI,UAAW;AACpF,YAAM,IAAI,SAAS,OAAO,GAAG,IAAI;AACjC,UAAI,MAAM,QAAQ,IAAI,GAAI;AAE1B,UAAI,MAAM,MAAM,IAAI,KAAK,EAAG;AAC5B,YAAMC,SAAQ,gBAAgB,OAAO,GAAG,IAAI;AAC5C,YAAMC,OAAM,KAAK,IAAI,GAAG,KAAK,EAAE,SAAS,IAAI,CAAC;AAC7C,aAAO;AAAA,QACL;AAAA,UACE,OAAOD,SAAQ;AAAA,UACf,KAAKC,OAAM;AAAA,UACX,MAAM,CAAC,OAAO;AAAA,UACd,OAAO,EAAE,MAAM,IAAI,GAAG,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,GAAG,EAAE;AAAA,UACnD,MAAM;AAAA,UACN,OAAO;AAAA,QACT;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,QAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,EAAE,cAAc;AAC/C,QAAM,MAAM,KAAK,IAAI,IAAI,GAAG,KAAK,EAAE,aAAa;AAChD,QAAM,QAAQ,SAAS,UAAU,SAAY,sBAAsB,OAAO,IAAI,IAAI;AAClF,SAAO,EAAE,OAAO,QAAQ,GAAG,KAAK,MAAM,GAAG,MAAM,CAAC,OAAO,GAAG,OAAO,MAAM,OAAO,OAAO,EAAE;AACzF;AAGO,SAAS,UAAU,KAAa,QAAgB,KAA+B;AACpF,QAAM,MAAM,IAAI,MAAM;AACtB,QAAM,MAAM,IAAI,MAAM,IAAI,QAAQ;AAClC,MAAI,OAAO,IAAK,QAAO;AACvB,QAAM,OAAO,MAAM;AACnB,QAAM,KAAK,KAAK,MAAM,OAAO,CAAC;AAC9B,MAAI,QAAQ,KAAK,IAAI,GAAG,IAAI,QAAQ,EAAE;AACtC,MAAI,MAAM,KAAK,IAAI,QAAQ,IAAI,OAAO,QAAQ,IAAI,QAAQ,OAAO;AACjE,MAAI,MAAM,QAAQ,IAAI,IAAK,SAAQ,KAAK,IAAI,GAAG,MAAM,MAAM,CAAC;AAC5D,SAAO,EAAE,GAAG,KAAK,OAAO,IAAI;AAC9B;AAGO,SAAS,aAAa,IAAc,KAAuB;AAChE,QAAM,SAAS,CAAC,GAAG,EAAE,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG;AACxE,QAAM,MAAgB,CAAC;AACvB,aAAW,KAAK,QAAQ;AACtB,UAAM,OAAO,IAAI,IAAI,SAAS,CAAC;AAC/B,QAAI,QAAQ,EAAE,SAAS,KAAK,MAAM,MAAM,GAAG;AACzC,WAAK,MAAM,KAAK,IAAI,KAAK,KAAK,EAAE,GAAG;AACnC,WAAK,OAAO,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAG,KAAK,MAAM,GAAG,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAExE,UAAI,EAAE,UAAU,CAAC,KAAK,SAAS,EAAE,MAAM,OAAO,KAAK,MAAM,MAAO,MAAK,QAAQ,EAAE;AAC/E,UAAI,KAAK,SAAS,EAAE,QAAQ,EAAE,SAAS,MAAO,MAAK,OAAO;AAAA,IAC5D,OAAO;AACL,UAAI,KAAK,EAAE,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC;AAAA,IACtC;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,YAAY,GAAW,UAAkB,SAAS,IAAc;AAC9E,MAAI,EAAE,MAAM,EAAE,QAAQ,KAAK,SAAU,QAAO,CAAC,CAAC;AAC9C,QAAM,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC7C,MAAI,CAAC,KAAK,OAAQ,QAAO,CAAC,EAAE,GAAG,GAAG,KAAK,EAAE,QAAQ,WAAW,EAAE,CAAC;AAC/D,QAAM,MAAgB,CAAC;AACvB,MAAI,IAAI;AACR,SAAO,IAAI,KAAK,QAAQ;AACtB,QAAI,QAAQ,KAAK,IAAI,EAAE,OAAO,KAAK,CAAC,IAAK,MAAM;AAE/C,QAAI,EAAE,SAAS,KAAK,CAAC,IAAK,IAAI,OAAQ,SAAQ,EAAE;AAChD,UAAM,MAAM,KAAK,IAAI,EAAE,KAAK,QAAQ,WAAW,CAAC;AAChD,UAAM,YAAsB,CAAC;AAC7B,WAAO,IAAI,KAAK,UAAU,KAAK,CAAC,KAAM,IAAK,WAAU,KAAK,KAAK,GAAG,CAAE;AACpE,QAAI,CAAC,UAAU,QAAQ;AAErB;AACA;AAAA,IACF;AACA,QAAI,KAAK;AAAA,MACP,GAAG;AAAA,MACH;AAAA,MACA;AAAA,MACA,MAAM;AAAA,MACN,OAAO,EAAE,SAAS,EAAE,MAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE;AAAA,IACvD,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAGA,IAAM,eAAe,oBAAI,QAAoC;AACtD,SAAS,aAAa,GAA+B;AAC1D,MAAI,CAAC,aAAa,IAAI,CAAC,GAAG;AACxB,QAAI,KAAoB;AACxB,QAAI;AACF,WAAK,IAAI,OAAO,EAAE,SAAS,GAAG;AAAA,IAChC,QAAQ;AACN,WAAK;AAAA,IACP;AACA,iBAAa,IAAI,GAAG,EAAE;AAAA,EACxB;AACA,SAAO,aAAa,IAAI,CAAC;AAC3B;AAEO,SAAS,eAAe,MAAc,GAAyB;AACpE,QAAM,KAAK,aAAa,CAAC;AACzB,MAAI,GAAI,QAAO,GAAG,KAAK,IAAI;AAC3B,QAAM,QAAQ,KAAK,YAAY;AAC/B,SAAO,EAAE,SAAS,KAAK,CAAC,MAAM,MAAM,SAAS,EAAE,YAAY,CAAC,CAAC;AAC/D;AAEO,SAAS,gBACd,OACA,OACA,KACA,UACU;AACV,QAAM,OAAO,MAAM,MAAM,QAAQ,GAAG,GAAG,EAAE,KAAK,IAAI;AAClD,SAAO,SAAS,OAAO,CAAC,MAAM,EAAE,MAAM,KAAK,eAAe,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK;AACxF;AAEO,SAAS,YACd,OACA,GACA,UACA,YAAY,KACJ;AACR,QAAM,MAAM,gBAAgB,OAAO,EAAE,OAAO,EAAE,KAAK,QAAQ;AAC3D,SAAO,IAAI,OAAO,CAAC,GAAG,MAAM,IAAI,SAAS,CAAC,EAAG,KAAK,CAAC,IAAI,YAAY,KAAK,IAAI,IAAI,EAAE,KAAK,MAAM;AAC/F;AAMO,SAAS,iBACd,OACA,UACA,UACA,MACA,KACA,QACU;AACV,QAAM,IAAI,IAAI;AACd,QAAM,KAAiB,UAAU,EAAE,cAAc,EAAE,aAAa;AAEhE,QAAM,WAAW,SAAS,aAAa,EAAE,sBAAsB,EAAE;AACjE,MAAI,CAAC,MAAM,OAAQ,QAAO,CAAC;AAC3B,MAAI,CAAC,SAAS,QAAQ;AAEpB,UAAM,IAAI,SAAS,aAAa,KAAK,IAAI,MAAM,QAAQ,EAAE,IAAI,KAAK,IAAI,MAAM,QAAQ,EAAE;AACtF,WAAO;AAAA,MACL;AAAA,MACA,EAAE,OAAO,GAAG,KAAK,GAAG,MAAM,CAAC,GAAG,MAAM,UAAU,OAAO,EAAE;AAAA,MACvD;AAAA,MACA;AAAA,IACF,EAAE,MAAM,GAAG,CAAC;AAAA,EACd;AAEA,QAAM,UAAU,SAAS,OAAO,CAAC,MAAM,EAAE,QAAQ,KAAK,EAAE,QAAQ,MAAM,MAAM;AAC5E,QAAM,SAAS,CAAC,MAAe,EAAE,IAAI,OAAO,CAAC,GAAG,MAAM,KAAK,SAAS,CAAC,GAAG,OAAO,IAAI,CAAC;AACpF,QAAM,SAAS,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,GAAG,MAAM,OAAO,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI;AACnF,QAAM,aAAa,EAAE;AACrB,QAAM,MAAgB,CAAC;AACvB,MAAI,OAAO;AACX,aAAW,KAAK,QAAQ;AACtB,QAAI,QAAQ,WAAY;AACxB,UAAM,SAAS,IAAI,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG;AACnE,QAAI,QAAQ;AACV,aAAO,KAAK,KAAK,EAAE,IAAI;AACvB;AAAA,IACF;AACA,QAAI,KAAK,gBAAgB,OAAO,EAAE,MAAM,MAAM,GAAG,CAAC;AAClD;AAAA,EACF;AAEA,aAAW,KAAK,SAAS;AACvB,eAAW,KAAK;AACd,UAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,KAAK,SAAS,EAAE,IAAI,EAAG,GAAE,KAAK,KAAK,EAAE,IAAI;AAAA,EAC5F;AACA,QAAM,SAAS,aAAa,KAAK,EAAE,QAAQ,EACxC,QAAQ,CAAC,MAAM,YAAY,GAAG,EAAE,cAAc,CAAC,EAC/C,QAAQ,CAAC,MAAM,aAAa,OAAO,GAAG,UAAU,EAAE,CAAC;AACtD,aAAW,KAAK,OAAQ,GAAE,QAAQ,YAAY,OAAO,GAAG,UAAU,IAAI,OAAO,cAAc;AAC3F,SAAO,OACJ,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EACrD,MAAM,GAAG,EAAE,cAAc,EACzB,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACrC;AAGO,SAAS,iBACd,OACA,SACA,MACA,KACA,QACQ;AACR,QAAM,IAAI,IAAI;AACd,QAAM,IAAI,UAAU;AACpB,QAAM,QAAQ,gBAAgB,OAAO,GAAG,IAAI;AAC5C,QAAM,IAAI,SAAS,UAAU,OAAO,SAAS,OAAO,GAAG,IAAI;AAC3D,MAAI,MACF,MAAM,OAAO,KAAK,IAAI,MAAM,SAAS,GAAG,IAAI,EAAE,aAAa,IAAI,KAAK,IAAI,GAAG,IAAI,EAAE,OAAO;AAC1F,QAAM,KAAK,IAAI,KAAK,QAAQ,EAAE,iBAAiB,GAAG,MAAM,SAAS,CAAC;AAClE,QAAM,MAAc;AAAA,IAClB,OAAO,QAAQ;AAAA,IACf,KAAK,MAAM;AAAA,IACX,MAAM,CAAC,OAAO;AAAA,IACd,OAAO,EAAE,MAAM,SAAS,OAAO,MAAM,CAAC,KAAK,IAAI,KAAK,EAAE,MAAM,GAAG,GAAG,EAAE;AAAA,IACpE,MAAM;AAAA,IACN,OAAO;AAAA,EACT;AAEA,QAAM,WAAW,SAAS,aAAa,EAAE,sBAAsB,EAAE;AACjE,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,EAAE,cAAc,EAAE,aAAa;AAAA,IACzC,UAAU,IAAI;AAAA,EAChB,EAAE,CAAC;AACL;AAcO,SAAS,QAAQ,GAAW,UAAkB,UAAoB,CAAC,GAAW;AACnF,MAAI,EAAE,UAAU,SAAU,QAAO;AACjC,MAAI,KAAK;AACT,aAAW,MAAM,SAAS;AACxB,UAAM,IAAI,GAAG,KAAK,CAAC;AACnB,QAAI,MAAM,KAAK,KAAK,EAAE,QAAQ,IAAK,MAAK,EAAE;AAAA,EAC5C;AACA,MAAI,KAAK,KAAK,KAAK,WAAW;AAC5B,WAAO,GAAG,EAAE,MAAM,GAAG,QAAQ,CAAC,kBAAkB,EAAE,MAAM;AAC1D,QAAM,OAAO,KAAK,MAAM,WAAW,IAAI;AACvC,QAAM,SAAS,KAAK,MAAM,WAAW,GAAG;AACxC,QAAM,IAAI,KAAK,IAAI,MAAM,KAAK,MAAM;AACpC,QAAM,IAAI,KAAK,IAAI,EAAE,QAAQ,KAAK,WAAW,KAAK;AAClD,SAAO,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC,gBAAgB,EAAE,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,SAAS,kBAAkB,EAAE,MAAM,YAAY,EAAE;AACnH;AAGO,SAAS,YACd,OACA,OACA,KACA,MACQ;AACR,QAAM,IAAgB,OAAO,SAAS,WAAW,EAAE,cAAc,KAAK,IAAI;AAC1E,QAAM,MAAgB,CAAC;AACvB,WAAS,IAAI,OAAO,KAAK,OAAO,KAAK,MAAM,QAAQ,KAAK;AACtD,QAAI,KAAK,GAAG,CAAC,KAAK,QAAQ,MAAM,IAAI,CAAC,EAAG,QAAQ,OAAO,IAAI,GAAG,EAAE,cAAc,EAAE,OAAO,CAAC,EAAE;AAAA,EAC5F;AACA,SAAO,IAAI,KAAK,IAAI;AACtB;AAGO,SAAS,mBAAmB,OAAiB,GAAW,GAAuB;AACpF,SAAO,YAAY,OAAO,GAAG,GAAG,CAAC,EAAE,SAAS;AAC9C;AAOO,SAAS,aACd,OACA,GACA,UACA,GACA,QAAQ,GACE;AACV,QAAM,MAAM,CAAC,MAAc,mBAAmB,OAAO,GAAG,CAAC;AACzD,MAAI,QAAQ;AACZ,WAAS,IAAI,EAAE,OAAO,KAAK,EAAE,KAAK,IAAK,UAAS,IAAI,CAAC;AACrD,MAAI,SAAS,SAAU,QAAO,CAAC,CAAC;AAChC,QAAM,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,OAAO,CAAC,MAAM,KAAK,EAAE,SAAS,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACvF,QAAM,UAAU,KAAK,SAAS,OAAO,CAAC,EAAE,KAAK;AAC7C,QAAM,MAAgB,CAAC;AACvB,MAAI,UAAU,EAAE,QAAQ;AACxB,aAAW,KAAK,SAAS;AACvB,QAAI,KAAK,QAAS;AAClB,QAAI,IAAI;AACR,QAAI,OAAO,IAAI,CAAC;AAChB,WACE,IAAI,KAAK,EAAE,SACX,IAAI,IAAI,WACR,KAAK,IAAI,MAAM,SACf,OAAO,IAAI,IAAI,CAAC,KAAK,WAAW;AAEhC,cAAQ,IAAI,EAAE,CAAC;AACjB,QAAI,IAAI;AACR,WAAO,IAAI,KAAK,EAAE,OAAO,OAAO,IAAI,IAAI,CAAC,KAAK,SAAU,SAAQ,IAAI,EAAE,CAAC;AACvE,QAAI,KAAK,EAAE,GAAG,GAAG,OAAO,GAAG,KAAK,GAAG,MAAM,KAAK,OAAO,CAAC,MAAM,KAAK,KAAK,KAAK,CAAC,EAAE,CAAC;AAC/E,cAAU;AAAA,EACZ;AACA,SAAO;AACT;AAEO,SAAS,WAAW,MAAwB;AACjD,QAAM,QAAQ,KAAK,MAAM,OAAO;AAChC,MAAI,MAAM,UAAU,MAAM,MAAM,SAAS,CAAC,MAAM,GAAI,OAAM,IAAI;AAC9D,SAAO;AACT;;;ACriBA,IAAM,KAAK,CAAC,MAAe,OAAO,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI;AAMxD,SAAS,aACd,IACA,KACA,SACA,OACmB;AACnB,QAAM,MAAM,CAAC,GAAoB,MAC/B,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,IAAI,EAAE,QAAQ,EAAE;AAC3D,MAAI,WAAW,EAAG,QAAO,CAAC,GAAG,EAAE,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC;AAC5E,QAAM,OAAO,CAAC,GAAG,EAAE;AACnB,QAAM,MAAyB,CAAC;AAChC,SAAO,KAAK,QAAQ;AAClB,QAAI,KAAK;AACT,QAAI,KAAK;AACT,SAAK,QAAQ,CAACC,IAAG,MAAM;AACrB,YAAM,IAAI,IAAIA,EAAC,IAAI,WAAW,MAAM,IAAIA,GAAE,IAAI,KAAK;AACnD,UAAI,IAAI,MAAO,MAAM,MAAM,IAAIA,IAAG,KAAK,EAAE,CAAE,IAAI,GAAI;AACjD,aAAK;AACL,aAAK;AAAA,MACP;AAAA,IACF,CAAC;AACD,UAAM,IAAI,KAAK,OAAO,IAAI,CAAC,EAAE,CAAC;AAC9B,UAAM,IAAI,EAAE,OAAO,MAAM,IAAI,EAAE,IAAI,KAAK,KAAK,CAAC;AAC9C,QAAI,KAAK,CAAC;AAAA,EACZ;AACA,SAAO;AACT;AAGO,SAAS,UACd,MACA,GACQ;AACR,QAAM,IAAI,EAAE,IAAI;AAChB,MAAI,gBAAgB,IAAI,EAAG,QAAO,EAAE,yBAAyB,QAAQ,EAAE,iBAAiB;AACxF,MAAI,WAAW,IAAI,EAAG,QAAO,EAAE,oBAAoB,QAAQ,EAAE,YAAY;AACzE,MAAI,UAAU,IAAI,EAAG,QAAO,EAAE;AAC9B,SAAO;AACT;AAGO,SAAS,UACd,GACA,GACQ;AACR,UAAQ,EAAE,MAAM,EAAE,IAAI,KAAK,aAAa,EAAE,OAAO,MAAM,UAAU,EAAE,MAAM,CAAC;AAC5E;AAEO,SAAS,cACd,UACA,GACmB;AACnB,QAAM,IAAI,EAAE,IAAI;AAChB,QAAM,WAAW,oBAAI,IAA6B;AAClD,QAAM,MAAM,CAAC,MAAuB;AAClC,QAAI,IAAI,SAAS,IAAI,CAAC;AACtB,QAAI,MAAM,OAAW,UAAS,IAAI,GAAI,IAAI,UAAU,GAAG,CAAC,CAAE;AAC1D,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,CAAC,GAAG,QAAQ,EAAE;AAAA,IAC1B,CAAC,GAAG,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,IAAI,EAAE,QAAQ,EAAE;AAAA,EACzF;AACA,QAAM,MAAyB,CAAC;AAChC,QAAM,QAAQ,oBAAI,IAAoB;AACtC,QAAM,MAAM,CAAC,MAAuB;AAClC,QAAI,CAAC,IAAI,SAAS,CAAC,GAAG;AACpB,UAAI,KAAK,CAAC;AACV,YAAM,IAAI,EAAE,OAAO,MAAM,IAAI,EAAE,IAAI,KAAK,KAAK,CAAC;AAAA,IAChD;AAAA,EACF;AACA,IAAE,aAAa,QAAQ,CAAC,GAAG,MAAM;AAC/B,UAAM,OAAO,CAAC,GAAG,QAAQ,EACtB,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,YAAY,EAChE,KAAK,CAAC,GAAG,OAAO,EAAE,IAAI,CAAC,KAAK,MAAM,EAAE,IAAI,CAAC,KAAK,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;AACvE,QAAI,KAAM,KAAI,IAAI;AAAA,EACpB,CAAC;AACD,aAAW,KAAK;AAAA,IACd,MAAM,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC,IAAI,SAAS,CAAC,CAAC;AAAA,IACrD;AAAA,IACA,EAAE;AAAA,IACF,IAAI,IAAI,KAAK;AAAA,EACf;AACE,QAAI,CAAC;AACP,aAAW,KAAK,OAAO;AACrB,QAAI,IAAI,UAAU,EAAE,YAAa;AACjC,QAAI,EAAE,OAAO,EAAE,aAAc,KAAI,CAAC;AAAA,EACpC;AACA,MAAI,EAAE;AACJ,eAAW,KAAK;AAAA,MACd,MAAM,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,gBAAgB,CAAC,IAAI,SAAS,CAAC,CAAC;AAAA,MAC/D;AAAA,MACA,EAAE;AAAA,MACF,IAAI,IAAI,KAAK;AAAA,IACf;AACE,UAAI,CAAC;AACT,SAAO;AACT;AAEA,SAAS,YAAY,GAAoB,OAAe,KAAa,GAAwB;AAC3F,QAAM,UAAU,EAAE,aACf,IAAI,CAAC,GAAG,OAAQ,EAAE,IAAI,CAAC,KAAK,MAAM,EAAE,KAAK,IAAI,IAAI,CAAC,KAAK,EAAG,EAC1D,OAAO,OAAO;AACjB,QAAM,QAAQ,CAAC,MAAM,EAAE,IAAI,IAAI,KAAK,IAAI,GAAG,SAAS,GAAG,EAAE,GAAG,CAAC,EAAE;AAC/D,MAAI,QAAQ,OAAQ,OAAM,KAAK,IAAI,QAAQ,KAAK,GAAG,CAAC,GAAG;AACvD,MAAI,EAAE,SAAS,SAAS,EAAE,KAAM,OAAM,KAAK,kBAAkB,EAAE,IAAI,GAAG;AACtE,MAAI,UAAU,EAAE,SAAS,QAAQ,EAAE,IAAK,OAAM,KAAK,iBAAiB,EAAE,KAAK,IAAI,EAAE,GAAG,GAAG;AACvF,MAAI,IAAI,MAAM,KAAK,IAAI;AACvB,MAAI,EAAE,SAAS,EAAE,MAAM,OAAO,MAAO,MAAK;AAAA,SAAY,EAAE,MAAM,IAAI,KAAK,EAAE,MAAM,IAAI;AACnF,SAAO;AACT;AAEO,SAAS,YACd,GACA,OACA,KACA,GACQ;AACR,SAAO,GAAG,YAAY,GAAG,OAAO,KAAK,CAAC,CAAC;AAAA,EAAK,YAAY,EAAE,WAAW,OAAO,KAAK,EAAE,UAAU,EAAE,IAAI,MAAM,YAAY,CAAC;AACxH;AAGO,SAAS,UACd,GACA,UACA,GACuC;AACvC,QAAM,UAAU,CAAC,MACf,YAAY,EAAE,WAAW,GAAG,GAAG,EAAE,UAAU,EAAE,IAAI,MAAM,YAAY,EAAE,SAAS;AAChF,QAAM,MAAM,YAAY,GAAG,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,SAAS;AACvD,QAAM,SAAS,EAAE,KAAK,OAAO,CAAC,MAAM,KAAK,EAAE,SAAS,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACpF,QAAM,SAAS,OAAO,SAAS,OAAO,KAAK,OAAO,OAAO,SAAS,KAAK,CAAC,CAAC,IAAK,EAAE;AAChF,MAAI,IAAI;AACR,MAAI,IAAI;AACR,MAAI,OAAO,MAAM,QAAQ,MAAM;AAC/B,MAAI,OAAO,SAAU,QAAO;AAE5B,MAAI,UAAU;AACd,MAAI,YAAY;AAChB,MAAI,OAAO;AACX,SAAO,EAAE,WAAW,YAAY;AAC9B,UAAM,SAAS,CAAC,cAAc,WAAW,OAAO,MAAM;AACtD;AACA,QAAI,QAAQ;AACV,UAAI,IAAI,IAAI,EAAE,KAAK;AACjB,oBAAY;AACZ;AAAA,MACF;AACA,YAAM,IAAI,QAAQ,IAAI,CAAC;AACvB,UAAI,OAAO,IAAI,SAAU,aAAY;AAAA,WAChC;AACH;AACA,gBAAQ;AAAA,MACV;AAAA,IACF,OAAO;AACL,UAAI,IAAI,IAAI,EAAE,OAAO;AACnB,kBAAU;AACV;AAAA,MACF;AACA,YAAM,IAAI,QAAQ,IAAI,CAAC;AACvB,UAAI,OAAO,IAAI,SAAU,WAAU;AAAA,WAC9B;AACH;AACA,gBAAQ;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACA,MAAI,IAAI,IAAI,IAAI,EAAE,IAAI,KAAK,gBAAgB,IAAI,IAAI,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAG,QAAO;AACnF,SAAO,EAAE,OAAO,GAAG,KAAK,EAAE;AAC5B;AAEO,SAAS,SAAS,UAA6B,GAA0B;AAC9E,QAAM,QAAQ,cAAc,UAAU,CAAC;AACvC,MAAI,YAAY,EAAE;AAClB,QAAM,WAA4B,CAAC;AACnC,aAAW,KAAK,OAAO;AACrB,QAAI,YAAY,IAAK;AACrB,QAAI,IAAI,EAAE;AACV,QAAI,IAAI,EAAE;AACV,QAAI,QAAQ,YAAY,GAAG,GAAG,GAAG,CAAC;AAClC,UAAMC,OAAM,EAAE,IAAI,KAAK;AACvB,QAAIA,OAAM,KAAK,MAAM,SAASA,MAAK;AACjC,YAAM,IAAI,UAAU,GAAGA,MAAK,CAAC;AAC7B,UAAI,GAAG;AACL,YAAI,EAAE;AACN,YAAI,EAAE;AACN,gBAAQ,YAAY,GAAG,GAAG,GAAG,CAAC;AAAA,MAChC;AAAA,IACF;AACA,QAAI,MAAM,SAAS,IAAI,WAAW;AAChC,YAAM,IAAI,UAAU,EAAE,GAAG,GAAG,OAAO,GAAG,KAAK,EAAE,GAAG,YAAY,GAAG,CAAC;AAChE,UAAI,CAAC,EAAG;AACR,UAAI,EAAE;AACN,UAAI,EAAE;AACN,cAAQ,YAAY,GAAG,GAAG,GAAG,CAAC;AAC9B,UAAI,MAAM,SAAS,IAAI,UAAW;AAAA,IACpC;AACA,iBAAa,MAAM,SAAS;AAC5B,aAAS,KAAK;AAAA,MACZ,IAAI,EAAE;AAAA,MACN,MAAM,EAAE;AAAA,MACR,OAAO;AAAA,MACP,KAAK;AAAA,MACL,WAAW,EAAE;AAAA,MACb,SAAS,EAAE;AAAA,MACX,SAAS,MAAM,EAAE,SAAS,MAAM,EAAE;AAAA,MAClC,KAAK,EAAE;AAAA,MACP,KAAK,EAAE;AAAA,MACP,MAAM,EAAE;AAAA,MACR,MAAM,EAAE;AAAA,MACR,OAAO,EAAE;AAAA,MACT;AAAA,IACF,CAAC;AAAA,EACH;AACA,QAAM,MAAM,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AAC7C,QAAM,WAAW,SAAS,OAAO,CAAC,MAAM,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG;AAEpF,QAAM,WAAW,oBAAI,IAAoB;AACzC,aAAW,KAAK,SAAU,UAAS,IAAI,EAAE,MAAM,KAAK,IAAI,SAAS,IAAI,EAAE,IAAI,KAAK,GAAG,EAAE,GAAG,CAAC;AACzF,QAAM,UAAU,CAAC,GAAG,QAAQ,EAAE;AAAA,IAC5B,CAAC,GAAG,MACF,SAAS,IAAI,EAAE,IAAI,IAAK,SAAS,IAAI,EAAE,IAAI,MAC1C,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,IAAI,EAAE,QAAQ,EAAE;AAAA,EAC9D;AACA,SAAO;AAAA,IACL,UAAU;AAAA,IACV;AAAA,IACA,MAAM,QAAQ,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,MAAM;AAAA,IAC7C,UAAU,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,EACjC;AACF;AAaO,SAAS,aAAa,GAAwB;AACnD,QAAM,IAAI,EAAE,IAAI;AAChB,QAAM,OAAiB,EAAE,SACtB,MAAM,GAAG,EAAE,cAAc,EACzB,IAAI,CAAC,MAAM,GAAG,EAAE,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE,GAAG,KAAK,GAAG,EAAE,GAAG,CAAC,GAAG;AAC5D,QAAM,YAAY,EAAE,WACjB,MAAM,GAAG,KAAK,IAAI,GAAG,EAAE,iBAAiB,KAAK,MAAM,CAAC,EACpD,IAAI,CAAC,MAAM,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE,KAAK,CAAC,GAAG;AAC1C,QAAM,QAAQ,EAAE,iBACb,MAAM,GAAG,EAAE,gBAAgB,EAC3B,IAAI,CAACC,OAAM,GAAGA,GAAE,IAAI,KAAK,GAAGA,GAAE,KAAK,CAAC,GAAGA,GAAE,OAAO,KAAKA,GAAE,IAAI,KAAK,EAAE,MAAMA,GAAE,MAAM,EAAE;AACrF,QAAM,OAAO,EAAE,gBAAgB;AAAA,IAAI,CAAC,MAClC,EAAE,UAAU,SAAS,GAAG,EAAE,GAAG,wBAAwB,EAAE,UAAU,KAAK,IAAI,CAAC,MAAM,EAAE;AAAA,EACrF;AACA,QAAM,QAAQ,CAACC,IAAaC,KAAcF,OAAgB;AACxD,UAAM,QAAkB,CAAC;AACzB,QAAIC,GAAE,UAAUC,IAAG,QAAQ;AACzB,YAAM,KAAK,iDAAiD;AAC5D,UAAID,GAAE,OAAQ,OAAM,KAAK,KAAKA,GAAE,KAAK,IAAI,CAAC,EAAE;AAC5C,UAAIC,IAAG,OAAQ,OAAM,KAAK,YAAYA,IAAG,KAAK,IAAI,CAAC,EAAE;AAAA,IACvD;AACA,QAAIF,GAAE,OAAQ,OAAM,KAAK,uBAAuBA,GAAE,KAAK,IAAI,CAAC,EAAE;AAC9D,QAAI,KAAK,OAAQ,OAAM,KAAK,4BAA4B,KAAK,KAAK,IAAI,CAAC,EAAE;AACzE,QAAI,EAAE,YAAa,OAAM,KAAK,EAAE,WAAW;AAC3C,WAAO,MAAM,KAAK,IAAI;AAAA,EACxB;AACA,MAAI,IAAI;AACR,MAAI,KAAK;AACT,MAAI,IAAI;AACR,MAAI,MAAM,MAAM,GAAG,IAAI,CAAC;AACxB,SAAO,IAAI,SAAS,EAAE,aAAa,EAAE,UAAU,GAAG,UAAU,EAAE,SAAS;AACrE,QAAI,GAAG,OAAQ,MAAK,GAAG,MAAM,GAAG,EAAE;AAAA,aACzB,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AAAA,aAC/B,EAAE,OAAQ,KAAI,EAAE,MAAM,GAAG,EAAE;AAAA,QAC/B,KAAI,EAAE,MAAM,GAAG,EAAE;AACtB,UAAM,MAAM,GAAG,IAAI,CAAC;AAAA,EACtB;AACA,SAAO;AACT;;;AClUO,IAAM,mBAAmB;AAAA,EAC9B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AA+DO,SAAS,YAAY,KAAiC;AAC3D,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAG,IAAI,OAAO,cAAc,IAAI,CAAC,MAAO,EAAE,WAAW,GAAG,IAAI,IAAI,IAAI,CAAC,EAAG;AAAA,EAC1E,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAC5B;AAGO,SAAS,WAAW,KAAiC;AAC1D,SAAO,IAAI,OAAO,eAAe,CAAC,UAAU,IAAI,CAAC;AACnD;AAEA,eAAsB,UACpB,SACA,OACA,KACmB;AAEnB,QAAM,MAAM,MAAM,QAAQ;AAAA,IACxB;AAAA,MACE;AAAA,MACA;AAAA,MACA,GAAG,WAAW,GAAG;AAAA,MACjB;AAAA,MACA,OAAO,IAAI,OAAO,YAAY;AAAA,MAC9B,GAAG,YAAY,GAAG;AAAA,MAClB;AAAA,MACA,GAAG;AAAA,IACL;AAAA,IACA,EAAE,cAAc,KAAK;AAAA,EACvB;AACA,SAAO,IACJ,MAAM,IAAI,EACV,OAAO,OAAO,EACd,IAAI,CAAC,MAAM,EAAE,QAAQ,SAAS,EAAE,CAAC,EACjC,KAAK;AACV;AAOO,SAAS,aACd,IACA,KAC4F;AAC5F,QAAM,WAAW,gBAAgB,EAAE;AACnC,MAAI,SAAS,WAAW,KAAK,iBAAiB,SAAS,CAAC,GAAI,IAAI,OAAO,eAAe,GAAG;AACvF,UAAM,MAAM,YAAY,SAAS,CAAC,CAAE;AACpC,WAAO,EAAE,SAAS,MAAM,GAAG,IAAI,WAAW,YAAY,GAAG,IAAI,MAAM,eAAe,SAAS;AAAA,EAC7F;AAEA,QAAM,OAAO,SAAS,IAAI,CAAC,MAAM,YAAY,CAAC,EAAE,QAAQ,MAAM,MAAM,CAAC;AACrE,SAAO,EAAE,SAAS,KAAK,KAAK,GAAG,GAAG,WAAW,KAAK,KAAK,GAAG,GAAG,MAAM,UAAU,SAAS;AACxF;AAGO,SAAS,gBAAgB,OAAyB;AACvD,SAAO,MACJ,QAAQ,CAAC,MAAM,gBAAgB,CAAC,CAAC,EACjC,IAAI,CAAC,MAAM,YAAY,CAAC,EAAE,QAAQ,MAAM,MAAM,CAAC,EAC/C,KAAK,GAAG;AACb;AASO,SAAS,cAAc,KAAwB;AACpD,QAAM,UAAqB,CAAC;AAC5B,MAAI,MAAM;AACV,SAAO,MAAM,IAAI,QAAQ;AACvB,QAAI,KAAK,IAAI,QAAQ,MAAM,GAAG;AAC9B,QAAI,KAAK,EAAG,MAAK,IAAI;AACrB,UAAM,IAAI,IAAI,QAAQ,MAAM,GAAG;AAC/B,QAAI,IAAI,OAAO,IAAI,IAAI;AACrB,YAAM,QAAQ,IAAI,QAAQ,KAAK,IAAI,CAAC;AACpC,UAAI,QAAQ,KAAK,QAAQ,IAAI;AAC3B,cAAM,OAAO,OAAO,IAAI,MAAM,IAAI,GAAG,KAAK,CAAC;AAC3C,cAAM,OAAO,IAAI,MAAM,QAAQ,GAAG,EAAE,EAAE,QAAQ,OAAO,EAAE;AACvD,YAAI,OAAO,SAAS,IAAI,KAAK,CAAC,KAAK,WAAW,oBAAoB,GAAG;AACnE,kBAAQ,KAAK,EAAE,MAAM,IAAI,MAAM,KAAK,CAAC,EAAE,QAAQ,SAAS,EAAE,GAAG,MAAM,KAAK,CAAC;AAAA,QAC3E;AAAA,MACF;AAAA,IACF;AACA,UAAM,KAAK;AAAA,EACb;AACA,SAAO;AACT;AAEA,IAAM,aAAa,CAAC,GAAY,MAC9B,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,IAAI,EAAE,OAAO,EAAE;AAOnD,SAAS,uBAAuB,SAA0B;AAC/D,SAAO,QAAQ,QAAQ,QAAQ,oBAAoB,KAAK,CAAC,MAAM;AACjE;AAGA,eAAsB,cACpB,SACA,SACA,OACA,KACA,OAA2E,CAAC,GACxD;AACpB,QAAM,OAAO;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAI,KAAK,oBAAoB,QAAQ,CAAC,IAAI,CAAC,IAAI;AAAA,IAC/C,GAAI,KAAK,OAAO,CAAC,IAAI,IAAI,CAAC;AAAA,IAC1B;AAAA,IACA,GAAG,WAAW,GAAG;AAAA,IACjB,GAAI,KAAK,aAAa,CAAC,MAAM,OAAO,KAAK,UAAU,CAAC,IAAI,CAAC;AAAA;AAAA,IAEzD;AAAA,IACA,OAAO,IAAI,OAAO,cAAc;AAAA,IAChC;AAAA,IACA,OAAO,IAAI,OAAO,YAAY;AAAA,IAC9B,GAAG,YAAY,GAAG;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAG;AAAA,EACL;AAEA,QAAM,MAAM,MAAM,QAAQ,QAAQ,MAAM,EAAE,cAAc,uBAAuB,OAAO,EAAE,CAAC;AACzF,QAAM,UAAU,cAAc,GAAG;AAEjC,UAAQ,KAAK,UAAU;AACvB,SAAO;AACT;AAGO,SAAS,iBAAiB,SAA2B;AAC1D,QAAM,MAAgB,CAAC;AACvB,MAAI,QAAQ;AACZ,MAAI,UAAU;AACd,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,UAAM,KAAK,QAAQ,CAAC;AACpB,QAAI,OAAO,KAAM;AAAA,aACR,QAAS,WAAU,OAAO;AAAA,aAC1B,OAAO,IAAK,WAAU;AAAA,aACtB,OAAO,IAAK;AAAA,aACZ,OAAO,IAAK;AAAA,aACZ,OAAO,OAAO,UAAU,GAAG;AAClC,UAAI,KAAK,QAAQ,MAAM,OAAO,CAAC,CAAC;AAChC,cAAQ,IAAI;AAAA,IACd;AAAA,EACF;AACA,MAAI,KAAK,QAAQ,MAAM,KAAK,CAAC;AAC7B,SAAO;AACT;AAMO,SAAS,iBAAiB,cAAiC,UAA4B;AAC5F,QAAM,MAAgB,CAAC;AACvB,MAAI,MAAqB;AACzB,aAAW,OAAO,cAAc;AAC9B,QAAI,QAAQ,QAAQ,IAAI,SAAS,IAAI,IAAI,UAAU,UAAU;AAC3D,aAAO,IAAI,GAAG;AAAA,IAChB,OAAO;AACL,UAAI,QAAQ,KAAM,KAAI,KAAK,GAAG;AAC9B,YAAM;AAAA,IACR;AAAA,EACF;AACA,MAAI,QAAQ,KAAM,KAAI,KAAK,GAAG;AAC9B,SAAO;AACT;AAGO,SAAS,aAAa,OAAwC;AACnE,QAAM,MAAM,MAAM,KAAK,EAAE,KAAK,UAAU;AACxC,SAAO,IAAI;AAAA,IACT,CAAC,GAAG,MAAM,MAAM,KAAK,EAAE,SAAS,IAAI,IAAI,CAAC,EAAG,QAAQ,EAAE,SAAS,IAAI,IAAI,CAAC,EAAG;AAAA,EAC7E;AACF;AAQA,eAAsB,mBACpB,SACA,cACA,OACA,KACA,kBAAkB,+BACE;AACpB,QAAM,SAAS,aACZ;AAAA,IAAQ,CAAC,MACR,EAAE,SAAS,KAAK,kBAAkB,CAAC,MAAM,CAAC,GAAG,IAAI,iBAAiB,CAAC,EAAE,IAAI,CAAC,MAAM,MAAM,CAAC,GAAG;AAAA,EAC5F,EACC,OAAO,CAAC,MAAM,EAAE,UAAU,eAAe;AAC5C,QAAM,WAAW,iBAAiB,QAAQ,eAAe;AACzD,MAAI,SAAS,UAAU,GAAG;AACxB,WAAO,SAAS,SAAS,cAAc,SAAS,SAAS,CAAC,GAAI,OAAO,GAAG,IAAI,CAAC;AAAA,EAC/E;AACA,QAAM,QAAQ,MAAM;AAAA,IAAS;AAAA,IAAU;AAAA,IAA2B,CAAC,MACjE,cAAc,SAAS,GAAG,OAAO,GAAG;AAAA,EACtC;AACA,SAAO,aAAa,KAAK;AAC3B;AAEO,SAAS,MAAM,IAAY,GAAmB;AACnD,SAAO,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG;AAClC;AAGO,SAAS,YAAY,MAAc,UAA6B;AACrE,QAAM,WAAW,KAAK,YAAY,EAAE,QAAQ,WAAW,EAAE;AACzD,SAAO,SAAS,KAAK,CAAC,MAAM;AAC1B,UAAM,OAAO,EAAE,YAAY,EAAE,QAAQ,UAAU,EAAE;AACjD,WAAO,KAAK,UAAU,KAAK,SAAS,SAAS,IAAI;AAAA,EACnD,CAAC;AACH;AAGO,SAAS,QAAQ,SAAgC;AACtD,MAAI;AACF,WAAO,IAAI,OAAO,SAAS,GAAG;AAAA,EAChC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAcO,SAAS,UAAU,SAAoB,OAA4B;AACxE,QAAM,MAAmB,MAAM,IAAI,MAAM,CAAC,CAAC;AAC3C,aAAW,KAAK,SAAS;AACvB,UAAM,QAAQ,EAAE,KAAK,YAAY;AACjC,UAAM,QAAQ,CAAC,GAAG,MAAM;AACtB,YAAM,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,IAAI,IAAI,EAAE,SAAS,KAAK,CAAC,MAAM,MAAM,SAAS,CAAC,CAAC;AAC/E,UAAI,IAAK,KAAI,CAAC,EAAG,KAAK,CAAC;AAAA,IACzB,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAMA,eAAsB,kBACpB,SACA,UAC8C;AAC9C,QAAM,UAAU,SAAS,IAAI,CAAC,SAAS,EAAE,KAAK,KAAK,YAAY,GAAG,EAAE,EAAE;AACtE,QAAM,SAAS;AAAA,IACb,GAAG,IAAI,IAAI,QAAQ,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,CAAC,MAAmB,MAAM,QAAQ,MAAM,GAAG,CAAC;AAAA,EAC1F;AACA,QAAM,QAAQ,OAAO,SAAS,MAAM,QAAQ,UAAU,MAAM,IAAI,CAAC;AACjE,QAAM,KAAe,CAAC;AACtB,QAAM,UAAoB,CAAC;AAC3B,aAAW,EAAE,KAAK,IAAI,KAAK,SAAS;AAClC,QAAI,QAAQ,IAAK,IAAG,KAAK,GAAG;AAAA,aACnB,QAAQ,SAAS,MAAM,GAAG,MAAM,UAAU,MAAM,GAAG,MAAM,aAAc,IAAG,KAAK,GAAG;AAAA,QACtF,SAAQ,KAAK,GAAG;AAAA,EACvB;AACA,SAAO,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,EAAE,CAAC,GAAG,QAAQ;AACzC;AAGO,SAAS,YAAY,GAA0B;AACpD,MAAI,IAAI,EAAE,KAAK,EAAE,QAAQ,OAAO,GAAG;AACnC,MAAI,CAAC,KAAK,EAAE,WAAW,GAAG,KAAK,EAAE,WAAW,GAAG,KAAK,eAAe,KAAK,CAAC,EAAG,QAAO;AACnF,SAAO,EAAE,WAAW,IAAI,EAAG,KAAI,EAAE,MAAM,CAAC;AACxC,MAAI,EAAE,QAAQ,QAAQ,EAAE,EAAE,QAAQ,WAAW,GAAG;AAChD,MAAI,MAAM,MAAM,MAAM,IAAK,QAAO;AAClC,MAAI,EAAE,WAAW,GAAG,KAAK,EAAE,MAAM,GAAG,EAAE,KAAK,CAAC,QAAQ,QAAQ,IAAI,EAAG,QAAO;AAC1E,SAAO;AACT;AAGA,eAAe,YACb,SACA,MACA,QAAQ,MACU;AAClB,SAAQ,MAAM,QAAQ,SAAS,MAAM,KAAK,MAAO;AACnD;AAEA,eAAsB,OAAO,OAA2C;AACtE,QAAM,KAAK,YAAY,IAAI;AAC3B,QAAM,MAAM,MAAM;AAClB,QAAM,UAAU,MAAM;AAEtB,QAAM,SAAS;AAAA,IACb,GAAG,IAAI;AAAA,MACL,MAAM,SAAS,IAAI,CAAC,MAAM,EAAE,QAAQ,QAAQ,GAAG,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC;AAAA,IACtF;AAAA,EACF;AACA,QAAM,WAAW,MAAM,kBAAkB,SAAS,MAAM,YAAY;AACpE,MAAI,cAAc,SAAS,GAAG,SAAS,SAAS,KAAK,CAAC,GAAG;AAEzD,MAAI,UAAU,MAAM,aAAa,SAAS,KAAK,SAAS,GAAG,WAAW;AAEtE,QAAM,gBAAgB,MACpB,OAAO,IAAI,CAAC,KAAK,UAAU;AACzB,UAAM,EAAE,SAAS,WAAW,MAAM,SAAS,IAAI,aAAa,KAAK,GAAG;AACpE,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,IAAI;AAAA,MACJ,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,KAAK;AAAA,MACL,WAAW,CAAC;AAAA,IACd;AAAA,EACF,CAAC;AAOH,QAAM,UAAU,OAAO,UAAoB;AACzC,UAAMG,YAAW,cAAc;AAC/B,UAAM,QAAgB,CAAC;AACvB,UAAM,UAAU,oBAAI,IAAkD;AACtE,eAAW,KAAKA,WAAU;AACxB,YAAM,KAAK;AAAA,QACT,IAAI,EAAE;AAAA,QACN,UAAU;AAAA,QACV,IAAI,QAAQ,EAAE,OAAO;AAAA,QACrB,UAAU,EAAE,SAAS,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC;AAAA,MACjD,CAAC;AACD,YAAM,QAAQ,IAAI,OAAO,mBAAmB,kBAAkB,EAAE,GAAG,IAAI,CAAC;AACxE,UAAI,MAAM,QAAQ;AAChB,cAAM,UAAU,gBAAgB,KAAK;AACrC,gBAAQ,IAAI,EAAE,OAAO,EAAE,OAAO,QAAQ,CAAC;AACvC,cAAM,KAAK;AAAA,UACT,IAAI,EAAE;AAAA,UACN,UAAU;AAAA,UACV,IAAI,QAAQ,OAAO;AAAA,UACnB,UAAU,MAAM,QAAQ,CAAC,MAAM,gBAAgB,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC;AAAA,QAC/E,CAAC;AAAA,MACH;AAAA,IACF;AACA,UAAM,eAAe;AAAA,MACnB,GAAGA,UAAS,IAAI,CAAC,MAAM,EAAE,SAAS;AAAA,MAClC,GAAG,CAAC,GAAG,QAAQ,OAAO,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO;AAAA,IAC/C;AACA,UAAM,CAACC,QAAO,OAAO,IAAI,MAAM,QAAQ,IAAI;AAAA,MACzC,UAAU,SAAS,OAAO,GAAG;AAAA,MAC7B,mBAAmB,SAAS,cAAc,OAAO,GAAG;AAAA,IACtD,CAAC;AACD,UAAM,SAAS,UAAU,SAAS,KAAK;AACvC,UAAMC,WAAuBF,UAAS,IAAI,MAAM,CAAC,CAAC;AAClD,UAAM,QAAQ,CAAC,GAAG,MAAM;AACtB,UAAI,CAAC,EAAE,SAAU,CAAAE,SAAQ,EAAE,EAAE,IAAI,OAAO,CAAC;AAAA,IAC3C,CAAC;AAED,UAAM,QAAQ,CAAC,GAAG,MAAM;AACtB,UAAI,EAAE,YAAYA,SAAQ,EAAE,EAAE,EAAG,WAAW,KAAK,OAAO,CAAC,EAAG,SAAS,GAAG;AACtE,QAAAA,SAAQ,EAAE,EAAE,IAAI,OAAO,CAAC;AACxB,QAAAF,UAAS,EAAE,EAAE,EAAG,YAAY,QAAQ,IAAI,EAAE,EAAE,EAAG;AAAA,MACjD;AAAA,IACF,CAAC;AACD,WAAO,EAAE,OAAAC,QAAO,UAAAD,WAAU,SAAAE,SAAQ;AAAA,EACpC;AAEA,MAAI,EAAE,OAAO,UAAU,QAAQ,IAAI,MAAM,QAAQ,WAAW;AAC5D,QAAM,aAAa,CAAC,OAAoB,IAAI,IAAI,GAAG,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE;AAC9E,MAAI,SAAS,GAAG,UAAU,WAAW,OAAO,IAAI,IAAI,OAAO,0BAA0B;AACnF,kBAAc,CAAC,GAAG;AAClB,cAAU;AACV,KAAC,EAAE,OAAO,UAAU,QAAQ,IAAI,MAAM,QAAQ,WAAW;AAAA,EAC3D;AAEA,QAAM,IAAI,KAAK,IAAI,MAAM,QAAQ,CAAC;AAClC,QAAM,SAAS,oBAAI,IAA2B;AAC9C,QAAM,MAAM,CAAC,SAAiB;AAC5B,QAAI,IAAI,OAAO,IAAI,IAAI;AACvB,QAAI,CAAC,GAAG;AACN,UAAI;AAAA,QACF;AAAA,QACA,UAAU;AAAA,QACV,QAAQ,CAAC;AAAA,QACT,SAAS,CAAC;AAAA,QACV,UAAU,oBAAI,IAAI;AAAA,QAClB,QAAQ,WAAW,IAAI;AAAA,QACvB,OAAO,UAAU,IAAI;AAAA,MACvB;AACA,aAAO,IAAI,MAAM,CAAC;AAAA,IACpB;AACA,WAAO;AAAA,EACT;AACA,QAAM,UAAU,SAAS,IAAI,MAAM,oBAAI,IAAY,CAAC;AACpD,QAAM,YAAY,IAAI,OAAO;AAC7B,UAAQ,QAAQ,CAAC,SAAS,OAAO;AAC/B,UAAM,KAAK,SAAS,EAAE;AACtB,UAAM,OAAO,QAAQ,EAAE;AACvB,eAAW,KAAK,SAAS;AACvB,WAAK,IAAI,EAAE,IAAI;AACf,YAAM,IAAI,IAAI,EAAE,IAAI;AACpB,YAAM,MAAO,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,KAAK;AAElD,UAAI,MAAM,UAAW;AACrB,UAAI,IAAI,EAAE,SAAS,IAAI,EAAE,IAAI;AAC7B,UAAI,CAAC,GAAG;AACN,YAAI,EAAE,MAAM,EAAE,MAAM,MAAM,EAAE,MAAM,KAAK,CAAC,EAAE;AAC1C,UAAE,SAAS,IAAI,EAAE,MAAM,CAAC;AAAA,MAC1B;AACA,UAAI,CAAC,EAAE,IAAI,SAAS,EAAE,EAAG,GAAE,IAAI,KAAK,EAAE;AAAA,IACxC;AACA,OAAG,KAAK,KAAK;AACb,OAAG,WAAW,QAAQ;AAAA,EACxB,CAAC;AAED,aAAW,MAAM,UAAU;AACzB,UAAM,WAAW,GAAG,UAAU,SAC1B,GAAG,UAAU,QAAQ,CAAC,MAAM,gBAAgB,CAAC,CAAC,IAC9C,GAAG;AACP,eAAW,KAAK,OAAO;AACrB,UAAI,YAAY,GAAG,QAAQ,GAAG;AAC5B,WAAG;AACH,gBAAQ,GAAG,KAAK,EAAG,IAAI,CAAC;AACxB,cAAM,IAAI,IAAI,CAAC;AACf,YAAI,CAAC,EAAE,QAAQ,SAAS,GAAG,KAAK,EAAG,GAAE,QAAQ,KAAK,GAAG,KAAK;AAAA,MAC5D;AAAA,IACF;AAAA,EACF;AAEA,aAAW,MAAM;AACf,OAAG,MAAM,QAAQ,GAAG,KAAK,EAAG,OAAO,IAAI,MAAM,QAAQ,GAAG,KAAK,EAAG,MAAM,CAAC,IAAI;AAE7E,QAAM,UAAU,sBAAsB,MAAM,QAAQ;AACpD,QAAM,YAAY,wBAAwB,MAAM,QAAQ;AACxD,aAAW,KAAK,OAAO,OAAO,GAAG;AAC/B,QAAI,IAAI;AACR,QAAI,QAAQ;AACZ,eAAW,CAAC,IAAI,GAAG,KAAK,OAAO,QAAQ,EAAE,MAAM,GAAG;AAChD,WAAK,SAAS,OAAO,EAAE,CAAC,EAAG;AAC3B,eAAS;AAAA,IACX;AACA,eAAW,MAAM,EAAE,QAAS,MAAK,IAAI,OAAO,YAAY,SAAS,EAAE,EAAG;AACtE,SAAK,IAAI,OAAO,iBAAiB,KAAK,IAAI,IAAI,KAAK;AACnD,QAAI,EAAE,UAAU,CAAC,QAAS,MAAK,IAAI,OAAO;AAC1C,QAAI,CAAC,aAAa,gBAAgB,EAAE,IAAI,EAAG,MAAK,IAAI,OAAO;AAC3D,MAAE,WAAW;AAAA,EACf;AACA,QAAM,SAAS,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC;AAChE,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE;AAG3E,QAAM,aAA8B,CAAC;AACrC,MAAI,gBAAgB;AACpB,MAAI,OAAO;AACX,SAAO,OAAO,OAAO,UAAU,WAAW,SAAS,IAAI,OAAO,eAAe;AAC3E,UAAM,QAAQ,OAAO,MAAM,MAAM,OAAO,IAAI,OAAO,gBAAgB,WAAW,MAAM;AACpF,YAAQ,MAAM;AACd,UAAM,WAAW,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,SAAS,CAAC;AAC1D,UAAM,SAAS,oBAAI,IAAmB;AACtC,UAAM,QAAQ,MAAM,SAAS,UAAU,kBAAkB,CAAC,MAAM,YAAY,SAAS,EAAE,IAAI,CAAC;AAC5F,aAAS,QAAQ,CAAC,GAAG,MAAM;AACzB,UAAI,MAAM,CAAC,EAAG,QAAO,IAAI,CAAC;AAAA,IAC5B,CAAC;AACD,eAAW,KAAK,OAAO;AACrB,UAAI,OAAO,IAAI,CAAC,EAAG;AAAA,UACd,YAAW,KAAK,CAAC;AAAA,IACxB;AAAA,EACF;AACA,SAAO;AAAA,IACL;AAAA,IACA,YAAY,MAAM;AAAA,IAClB;AAAA,IACA,aAAa,OAAO;AAAA,IACpB;AAAA,IACA;AAAA,IACA,iBAAiB,SAAS;AAAA,IAC1B,eAAe,SAAS;AAAA,IACxB;AAAA,IACA,IAAI,KAAK,MAAM,YAAY,IAAI,IAAI,EAAE;AAAA,EACvC;AACF;AAGO,SAAS,WAAW,GAAY,UAAiC;AACtE,SAAO,EAAE,IAAI,OAAO,CAAC,GAAG,MAAM,KAAK,SAAS,CAAC,GAAG,OAAO,IAAI,CAAC;AAC9D;AAGO,SAAS,aAAa,GAAkB,UAAyB,GAAsB;AAC5F,SAAO,CAAC,GAAG,EAAE,SAAS,OAAO,CAAC,EAC3B,KAAK,CAAC,GAAG,MAAM,WAAW,GAAG,QAAQ,IAAI,WAAW,GAAG,QAAQ,KAAK,EAAE,OAAO,EAAE,IAAI,EACnF,MAAM,GAAG,CAAC,EACV,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;AACnC;;;ACpkBO,IAAM,6BAA6B;AACnC,IAAM,oCAAoC;AAoDjD,IAAMC,MAAK,CAAC,MACV,MAAM,QAAQ,MAAM,UAAa,CAAC,OAAO,SAAS,CAAC,IAAI,MAAM,EAAE,QAAQ,CAAC;AAGnE,SAAS,oBACd,MACA,WACA,UACA,QACA,UACQ;AACR,QAAM,QAAQ,SAAS,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,KAAK,CAAC,KAAK;AACzD,QAAM,OAAO,UAAU,OAAO,CAAC,GAAG,MAAM,IAAI,SAAS,CAAC,EAAG,KAAK,CAAC,IAAI;AACnE,QAAM,MAAM,QAAQ,QAAQ,IAAI,IAAI,aAAa,IAAI,CAAC,CAAC;AACvD,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,OAAO,OAAO,MAAM,MAAM,OAAO,QAAQ,CAAC;AAC3E;AAEO,SAAS,YACd,OACA,QACA,KACA,IACA,KAC0C;AAE1C,QAAM,SAAS,MACZ,IAAI,CAAC,GAAG,MAAM,CAAC,EACf;AAAA,IACC,CAAC,GAAG,OACD,OAAO,IAAI,IAAI,CAAC,CAAE,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,CAAE,KAAK,MACrD,MAAM,CAAC,EAAG,WAAW,MAAM,CAAC,EAAG,YAC/B,IAAI;AAAA,EACR;AACF,QAAM,WAAqB,CAAC;AAC5B,WAAS,IAAI,GAAG,IAAI,KAAK,IAAI,IAAI,MAAM,cAAc,MAAM,MAAM,GAAG,IAAK,UAAS,KAAK,CAAC;AACxF,SAAO,QAAQ,CAAC,GAAG,SAAS;AAC1B,QAAI,SAAS,UAAU,IAAI,MAAM,YAAY,SAAS,SAAS,CAAC,EAAG;AACnE,SAAK,OAAO,IAAI,IAAI,CAAC,CAAE,KAAK,MAAM,MAAM,OAAO,IAAI,MAAM,SAAU,UAAS,KAAK,CAAC;AAAA,EACpF,CAAC;AAED,WAAS,KAAK,CAAC,GAAG,MAAM,OAAO,QAAQ,CAAC,IAAI,OAAO,QAAQ,CAAC,CAAC;AAC7D,SAAO,EAAE,UAAU,OAAO;AAC5B;AAGO,SAAS,YAAyC,SAAgB,KAAoB;AAC3F,QAAM,SAAS,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC;AAC5E,QAAM,MAAa,QAAQ,IAAI,MAAM,CAAC,CAAC;AACvC,MAAI,QAAQ;AACZ,WAAS,OAAO,GAAG,QAAQ,KAAK,QAAQ;AACtC,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,OAAO,UAAU,QAAQ,KAAK,KAAK;AACrD,YAAM,IAAI,OAAO,CAAC,EAAG,IAAI;AACzB,UAAI,GAAG;AACL,YAAI,CAAC,EAAG,KAAK,CAAC;AACd;AACA,cAAM;AAAA,MACR;AAAA,IACF;AACA,QAAI,CAAC,IAAK;AAAA,EACZ;AACA,SAAO;AACT;AAGO,SAAS,eACd,UACA,UACQ;AACR,QAAM,MAAgB,CAAC;AACvB,MAAI,OAAO;AACX,aAAW,KAAK,CAAC,GAAG,QAAQ,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG,GAAG;AAC3D,QAAI,OAAO,EAAE,MAAM,SAAS,IAAI,SAAU;AAC1C,QAAI,KAAK,EAAE,KAAK;AAChB,YAAQ,EAAE,MAAM,SAAS;AAAA,EAC3B;AACA,SAAO,IAAI,KAAK,MAAM;AACxB;AAEO,SAAS,YACd,GACA,KACkB;AAClB,MAAI,CAAC,KAAK,CAAC,OAAO,SAAS,EAAE,OAAO,EAAG,QAAO,EAAE,OAAO,WAAW,SAAS,MAAM,MAAM,CAAC,EAAE;AAC1F,QAAM,EAAE,IAAI,GAAG,IAAI,IAAI;AACvB,QAAM,SAAS,EAAE,KAAK,MAAM,CAAC,MAAM,KAAK,EAAE;AAC1C,QAAM,SAAS,EAAE,KAAK,KAAK,CAAC,MAAM,KAAK,EAAE;AACzC,QAAM,QACJ,EAAE,WAAW,MAAM,SACf,eACA,EAAE,WAAW,MAAM,SACjB,YACA;AACR,SAAO,EAAE,OAAO,SAAS,EAAE,SAAS,MAAM,EAAE,KAAK;AACnD;AAGO,SAAS,WACd,KACoB;AACpB,QAAM,QAAkB,CAAC;AACzB,MAAI,IAAI,gBAAgB,QAAQ;AAC9B,UAAM;AAAA,MACJ,qDAAqD,IAAI,gBAAgB,KAAK,IAAI,CAAC;AAAA,IACrF;AAAA,EACF;AACA,MAAI,IAAI,SAAS;AACf,UAAM;AAAA,MACJ,CAAC,IAAI,cAAc,SACf,4CACA;AAAA,IACN;AAAA,EACF;AACA,SAAO,MAAM,SAAS,MAAM,KAAK,GAAG,IAAI;AAC1C;AAGA,SAAS,aAAa,SAAmC;AACvD,MAAI,CAAC,QAAQ,QAAS,QAAO;AAC7B,QAAM,MAAM,QAAQ,WAChB,wCACA;AACJ,SAAO,oBAAoB,GAAG;AAChC;AAEA,eAAsB,cAAc,OAAmD;AACrF,QAAM,QAAQ,MAAM;AACpB,SAAO,eAAe;AAEtB,QAAM,aAAa,IAAI,gBAAgB;AACvC,QAAM,eAAe,MAAM,WAAW,MAAM,OAAO,MAAM;AACzD,SAAO,iBAAiB,SAAS,cAAc,EAAE,MAAM,KAAK,CAAC;AAC7D,MAAI;AACF,WAAO,MAAM,SAAS,OAAO,WAAW,MAAM;AAAA,EAChD,SAAS,OAAO;AACd,eAAW,MAAM,KAAK;AACtB,QAAI,OAAO,QAAS,OAAM,MAAM;AAChC,UAAM;AAAA,EACR,UAAE;AACA,WAAO,oBAAoB,SAAS,YAAY;AAAA,EAClD;AACF;AAEA,eAAe,SAAS,GAAoB,QAAgD;AAC1F,QAAM,MAAM,EAAE,UAAU;AACxB,QAAM,KAAK,YAAY,IAAI;AAC3B,QAAM,UAAkC,CAAC;AACzC,QAAM,OAAO,CAAC,OAAe,UAAkB;AAC7C,YAAQ,KAAK,IAAI,KAAK,MAAM,YAAY,IAAI,IAAI,KAAK;AAAA,EACvD;AACA,QAAM,OAAO,CAAC,OAAe,SAAkC;AAC7D,QAAI;AACF,QAAE,UAAU,OAAO,IAAI;AAAA,IACzB,QAAQ;AAAA,IAER;AAAA,EACF;AACA,QAAM,UAAU,IAAI,iBAAiB,EAAE,WAAW,QAAQ,IAAI,OAAO,gBAAgB;AACrF,QAAM,QAAQ,IAAI,SAAS,EAAE,QAAQ,EAAE,KAAK,QAAQ,KAAK,QAAQ,SAAS,KAAK,CAAC;AAChF,QAAM,gBAAgB,EAAE,gBAAgB,CAAC,GACtC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EACnB,OAAO,OAAO,EACd,MAAM,GAAG,CAAC;AACb,QAAM,MAAoB,EAAE,UAAU,EAAE,SAAS,KAAK,GAAG,aAAa;AACtE,QAAM,eAAe,EAAE,gBAAgB;AACvC,QAAM,MAAM,IAAI;AAChB,OAAK,SAAS;AAAA,IACZ,SAAS;AAAA,IACT,UAAU,IAAI;AAAA,IACd;AAAA,IACA,UAAU,EAAE;AAAA,IACZ,OAAO,EAAE,SAAS,CAAC;AAAA,IACnB;AAAA,EACF,CAAC;AAED,IAAE,IAAI,OAAO,IAAI,IAAI,eAAe;AAGpC,MAAI,KAAK,YAAY,IAAI;AACzB,QAAM,MAAoB,MAAM,OAAO;AAAA,IACrC;AAAA,IACA,UAAU,IAAI,WAAW,MAAM,aAAa,KAAK,GAAG;AAAA,IACpD,UAAU,EAAE;AAAA,IACZ,cAAc,EAAE,SAAS,CAAC;AAAA,IAC1B,QAAQ;AAAA,EACV,CAAC;AACD,OAAK,UAAU,EAAE;AACjB,QAAM,MAAM,IAAI;AAChB,OAAK,UAAU;AAAA,IACb,IAAI,IAAI;AAAA,IACR,YAAY,IAAI;AAAA,IAChB,aAAa,IAAI;AAAA,IACjB,aAAa,IAAI;AAAA,IACjB,SAAS,IAAI;AAAA,IACb,iBAAiB,IAAI;AAAA,IACrB,eAAe,IAAI;AAAA,IACnB,SAAS,QAAQ;AAAA,IACjB,UAAU,IAAI,IAAI,CAAC,OAAO;AAAA,MACxB,KAAK,EAAE;AAAA,MACP,MAAM,EAAE;AAAA,MACR,SAAS,EAAE;AAAA,MACX,IAAI,EAAE;AAAA,MACN,QAAQ,EAAE;AAAA,MACV,UAAU,EAAE;AAAA,MACZ,KAAK,MAAM,EAAE,GAAG;AAAA,MAChB,WAAW,EAAE;AAAA,IACf,EAAE;AAAA,IACF,YAAY,IAAI,WAAW,IAAI,CAAC,OAAO;AAAA,MACrC,MAAM,EAAE;AAAA,MACR,KAAK,MAAM,EAAE,QAAQ;AAAA,MACrB,KAAK,OAAO,KAAK,EAAE,MAAM,EAAE,IAAI,MAAM;AAAA,MACrC,SAAS,EAAE;AAAA,MACX,OAAO,EAAE,SAAS;AAAA,MAClB,MAAM,EAAE;AAAA,IACV,EAAE;AAAA,EACJ,CAAC;AAGD,OAAK,YAAY,IAAI;AACrB,QAAM,SAAS,IAAI,WAAW,CAAC,GAAG,YAAY;AAC9C,QAAM,UAAU,IAAI,WAAW,IAAI,CAAC,GAAG,MAAM,IAAI,OAAO,CAAC,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE;AAC7E,QAAM,YAAwB,IAAI,WAAW,IAAI,CAAC,GAAG,MAAM;AACzD,UAAM,OAAO,aAAa,GAAG,KAAK,IAAI,MAAM,eAAe;AAC3D,UAAM,UAAU,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,IAAI,OAAO,CAAC,CAAC,EAAG,QAAQ;AAC7E,UAAM,QAAQ,KAAK;AAAA,MACjB,CAAC,MAAM,KAAK,EAAE,IAAI,KAAK,WAAW,EAAE,MAAM,SAAS,IAAI,MAAM,YAAY,CAAC;AAAA,IAC5E;AACA,WAAO;AAAA,MACL,IAAI,QAAQ,CAAC;AAAA,MACb,MAAM,EAAE;AAAA,MACR,YAAY,CAAC,EAAE,MAAM,GAAG,KAAK,EAAE,KAAK,IAAI;AAAA,MACxC,KAAK,EAAE,WAAW;AAAA,IACpB;AAAA,EACF,CAAC;AACD,QAAM,aAAa,MAAM,MAAM,WAAW,WAAW,GAAG;AACxD,QAAM,EAAE,UAAU,OAAO,IAAI,YAAY,IAAI,YAAY,YAAY,SAAS,IAAI,IAAI,GAAG;AACzF,OAAK,SAAS,EAAE;AAChB,OAAK,SAAS;AAAA,IACZ,IAAI,IAAI;AAAA,IACR,QAAQ,IAAI,WAAW,IAAI,CAAC,GAAG,OAAO;AAAA,MACpC,MAAM,EAAE;AAAA,MACR,GAAG,MAAM,WAAW,IAAI,QAAQ,CAAC,CAAE,KAAK,OAAO,GAAG;AAAA,MAClD,KAAK,MAAM,UAAU,CAAC,EAAG,GAAG;AAAA,IAC9B,EAAE;AAAA,IACF,UAAU,SAAS,IAAI,CAAC,MAAM,IAAI,WAAW,CAAC,EAAG,IAAI;AAAA,EACvD,CAAC;AAGD,OAAK,YAAY,IAAI;AAErB,QAAM,YAAY,oBAAI,IAAsB;AAC5C,QAAM,YAAY,OAAO,UAAoB;AAC3C,UAAM,UAAU,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,UAAU,IAAI,CAAC,CAAC;AACnE,UAAM,QAAQ,MAAM;AAAA,MAAS;AAAA,MAAS;AAAA,MAAkB,CAAC,MACvD,QAAQ,SAAS,GAAG,IAAI,OAAO,YAAY;AAAA,IAC7C;AACA,YAAQ,QAAQ,CAAC,GAAG,MAAM;AACxB,YAAMC,QAAO,MAAM,CAAC;AAEpB,gBAAU,IAAI,GAAGA,UAAS,QAAQA,UAAS,SAAY,CAAC,IAAI,WAAWA,KAAI,CAAC;AAAA,IAC9E,CAAC;AAAA,EACH;AACA,QAAM,YAAY,CAAC,SAA2B,UAAU,IAAI,IAAI,KAAK,CAAC;AACtE,QAAM,UAAU,SAAS,IAAI,CAAC,MAAM,IAAI,WAAW,CAAC,EAAG,IAAI,CAAC;AAC5D,QAAM,YAAY,IACf,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,EACvB,IAAI,CAAC,MAAM,aAAa,CAAC,CAAC,EAC1B,OAAO,CAAC,OAAqB,OAAO,IAAI;AAC3C,QAAM,YAAY,CAAC,MAAc,UAAoB,eAA2B;AAAA,IAC9E,cAAc,UAAU,IAAI,IAAI,IAAI,MAAM,oBAAoB,IAAI,MAAM;AAAA,IACxE;AAAA,EACF;AACA,QAAM,iBAA6B,SAAS,IAAI,CAAC,MAAM;AACrD,UAAM,IAAI,IAAI,WAAW,CAAC;AAC1B,UAAM,QAAQ,UAAU,EAAE,IAAI;AAC9B,UAAM,OAAO,CAAC,GAAG,EAAE,SAAS,OAAO,CAAC;AACpC,WAAO,iBAAiB,OAAO,MAAM,KAAK,OAAO,EAAE,IAAI,GAAG,KAAK,UAAU,EAAE,IAAI,CAAC;AAAA,EAClF,CAAC;AACD,QAAM,SAAS,YAAY,gBAAgB,IAAI,MAAM,WAAW;AAChE,QAAM,SAAS,aAAa,IAAI,QAAQ;AACxC,QAAM,WAAW,aAAa,IAAI,CAAC,MAAM,aAAa,CAAC,CAAC;AACxD,QAAM,WAA8B,CAAC;AACrC,QAAM,eAA8B,CAAC;AACrC,MAAI,MAAM;AACV,QAAM,cAAc,CAAC,MAAc,GAAW,UAAkB,SAAkB;AAChF,UAAM,QAAQ,UAAU,IAAI;AAC5B,UAAM,SAAS,UAAU,MAAM,OAAO,CAAC,IAAI,OAAO,MAAM,YAAY,IAAI,CAAC,KAAK,CAAC,IAAI,SAAS;AAC5F,UAAMA,QAAO,YAAY,OAAO,EAAE,OAAO,EAAE,KAAK,MAAM;AACtD,UAAM,MAAM,MAAM,MAAM,EAAE,QAAQ,GAAG,EAAE,GAAG,EAAE,KAAK,IAAI;AACrD,UAAM,UAAU,gBAAgB,OAAO,EAAE,OAAO,EAAE,KAAK,GAAG;AAC1D,UAAM,WAAW,IAAI,IAAI,aAAa,GAAG,CAAC;AAC1C,UAAM,KAAK,IAAI,OAAO,KAAK,EAAE,SAAS,GAAG,GAAG,CAAC;AAC7C,UAAM,MAAM,oBAAoB,KAAK,SAAS,KAAK,QAAQ,QAAQ;AACnE,UAAM,SAAS,SAAS,IAAI,CAAC,MAAM,QAAQ,GAAG,QAAQ,CAAC;AACvD,UAAMC,SACJ,EAAE,SAAS,EAAE,MAAM,OAAO,EAAE,QAAQ,IAAI,EAAE,MAAM,IAAI,KAAK,EAAE,MAAM,IAAI,KAAK;AAC5E,iBAAa,KAAK,EAAE,IAAI,MAAM,OAAO,EAAE,OAAO,KAAK,EAAE,KAAK,MAAAD,OAAM,OAAAC,QAAO,KAAK,OAAO,CAAC;AACpF,aAAS,KAAK;AAAA,MACZ;AAAA,MACA;AAAA,MACA,OAAO,EAAE;AAAA,MACT,KAAK,EAAE;AAAA,MACP,WAAW;AAAA,MACX,MAAM,EAAE;AAAA,MACR,OAAO,EAAE;AAAA,MACT,MAAM,EAAE;AAAA,MACR,KAAK;AAAA,MACL,KAAK;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AACA,WAAS,QAAQ,CAAC,IAAI,MAAM;AAC1B,UAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,eAAW,KAAK,CAAC,GAAG,OAAO,CAAC,CAAE,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC9D,kBAAY,EAAE,MAAM,GAAG,EAAE,WAAW,MAAM;AAAA,EAC9C,CAAC;AACD,QAAM,cAAc,MAAM,MAAM,cAAc,cAAc,KAAK,OAAO;AACxE,aAAW,KAAK,UAAU;AACxB,UAAM,IAAI,YAAY,IAAI,EAAE,EAAE;AAC9B,QAAI,GAAG;AACL,QAAE,MAAM,EAAE;AACV,QAAE,MAAM,EAAE;AAAA,IACZ;AAAA,EACF;AACA,OAAK,SAAS,EAAE;AAChB,OAAK,SAAS;AAAA,IACZ,IAAI,IAAI;AAAA,IACR,UAAU,SAAS,IAAI,CAAC,OAAO;AAAA,MAC7B,IAAI,EAAE;AAAA,MACN,MAAM,EAAE;AAAA,MACR,OAAO,EAAE;AAAA,MACT,KAAK,EAAE;AAAA,MACP,MAAM,EAAE;AAAA,MACR,MAAM,EAAE,KAAK;AAAA,MACb,KAAK,MAAM,EAAE,GAAG;AAAA,MAChB,KAAK,EAAE,IAAI,IAAI,KAAK;AAAA,MACpB,KAAK,MAAM,EAAE,OAAO,OAAO,GAAG;AAAA,IAChC,EAAE;AAAA,EACJ,CAAC;AAGD,OAAK,YAAY,IAAI;AACrB,MAAI,YAA6B,CAAC;AAClC,MAAI,aAAa,oBAAI,IAAoB;AACzC,QAAM,cAAc,oBAAI,IAAY;AACpC,MAAI,IAAI,MAAM,SAAS;AACrB,UAAM,gBAA4E,CAAC;AACnF,UAAM,QAAQ,SACX,OAAO,CAAC,MAAM,EAAE,OAAO,IAAI,EAAE,EAC7B,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG,EAC5B,MAAM,GAAG,IAAI,MAAM,YAAY,EAC/B,IAAI,CAAC,OAAO;AAAA,MACX,MAAM,EAAE;AAAA,MACR,OAAO,EAAE;AAAA,MACT,OAAO,EAAE,UAAU,MAAM,EAAE,QAAQ,GAAG,EAAE,GAAG;AAAA,MAC3C,KAAK,EAAE;AAAA,IACT,EAAE;AACJ,UAAM,WAAW,oBAAI,IAAY;AACjC,eAAW,KAAK,KAAK;AACnB,iBAAW,KAAK,CAAC,GAAG,EAAE,UAAU,GAAG,EAAE,UAAU,QAAQ,CAAC,MAAM,gBAAgB,CAAC,CAAC,CAAC,GAAG;AAClF,iBAAS,IAAI,EAAE,YAAY,CAAC;AAC5B,iBAAS,IAAI,WAAW,CAAC,EAAE,KAAK,GAAG,CAAC;AAAA,MACtC;AAAA,IACF;AACA,UAAM,SAAS,IAAI;AAAA,MACjB;AAAA,QACE,GAAG,WAAW,IAAI,WAAW,MAAM,aAAa,KAAK,GAAG,CAAC;AAAA,QACzD,GAAG,IAAI,QAAQ,CAAC,MAAM,WAAW,EAAE,GAAG,CAAC;AAAA,MACzC,EAAE,OAAO,CAAC,MAAM,EAAE,UAAU,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;AAAA,IACpD;AAEA,UAAM,YAAY;AAAA,MAChB;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK,KAAK,IAAI,MAAM,oBAAoB,GAAG;AAAA,IAC7C;AACA,UAAM,gBAAgB,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,IAAI,WAAW,CAAC,EAAG,IAAI,CAAC;AAC1E,UAAM,aAAa,sBAAsB,IAAI,QAAQ;AACrD,UAAM,YAAY,MAAM;AAAA,MACtB;AAAA,MACA,UAAU,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,MAC3B;AAAA,MACA,YAAY,GAAG;AAAA,MACf;AAAA,MACA;AAAA,IACF;AACA,UAAM,SAAS,IAAI,IAAI,UAAU,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,OAAO,IAAI,CAAC,CAAC;AACpE,UAAM,OAAO;AAAA,MACX,UAAU;AAAA,MACV;AAAA,MACA,IAAI,MAAM;AAAA,MACV;AAAA,MACA;AAAA,IACF;AACA,UAAM,aAAa,CAAC,MAAc,SAChC,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,QAAQ,QAAQ,EAAE,SAAS,QAAQ,EAAE,GAAG;AAC1E,UAAM,YAAoC,CAAC;AAG3C,UAAM,SAAS,KAAK,IAAI,IAAI,YAAY,CAAC;AACzC,UAAM,aAAa,CAAC,SAClB,MAAM,UAAU,WAAW,IAAI,IAAI,KAAK,GAAG,MAAM,IAAI,MAAM,GAAG,MAAM;AACtE,gBAAY,UACT,OAAO,CAAC,MAAM;AACb,YAAM,KAAK,KAAK,IAAI,EAAE,IAAI,KAAK,CAAC;AAChC,UAAI,CAAC,GAAG,OAAQ,WAAU,EAAE,IAAI,IAAI;AAAA,eAC3B,GAAG,MAAM,CAAC,MAAM,WAAW,EAAE,MAAM,EAAE,IAAI,CAAC;AACjD,kBAAU,EAAE,IAAI,IAAI;AACtB,aAAO,GAAG,SAAS,KAAK,CAAC,GAAG,MAAM,CAAC,MAAM,WAAW,EAAE,MAAM,EAAE,IAAI,CAAC;AAAA,IACrE,CAAC,EACA,IAAI,CAAC,OAAO,EAAE,GAAG,GAAG,QAAQ,KAAK,MAAM,EAAE,SAAS,WAAW,EAAE,IAAI,IAAI,GAAI,IAAI,IAAK,EAAE,EACtF,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE,EAChE,MAAM,GAAG,IAAI,MAAM,iBAAiB;AACvC,UAAM,OAAO,KAAK,IAAI,GAAG,UAAU,IAAI,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;AAC7D,UAAM,YAAwB,UAAU,IAAI,CAAC,GAAG,OAAO;AAAA,MACrD,IAAI,IAAI,OAAO,CAAC,EAAE,SAAS,GAAG,GAAG,CAAC;AAAA,MAClC,MAAM,EAAE;AAAA,MACR,QAAQ,GAAG,EAAE,OAAO,IAAI,IAAI,EAAE,OAAO,IAAI;AAAA,MACzC,SAAS,EAAE;AAAA,MACX,KAAK,EAAE,SAAS;AAAA,IAClB,EAAE;AACF,iBAAa,MAAM,MAAM,WAAW,WAAW,GAAG;AAClD,UAAM,SAAS,UACZ,IAAI,CAAC,OAAO,EAAE,GAAG,GAAG,WAAW,IAAI,EAAE,EAAE,KAAK,EAAE,EAAE,EAChD,OAAO,CAAC,MAAM,EAAE,KAAK,IAAI,EAAE,EAC3B,KAAK,CAAC,GAAG,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,KAAK,EAAE,EACtD,MAAM,GAAG,IAAI,MAAM,gBAAgB;AACtC,eAAW,KAAK,OAAQ,aAAY,IAAI,EAAE,EAAE,IAAI;AAChD,UAAM,UAAU,OAAO,QAAQ,CAAC,OAAO,KAAK,IAAI,EAAE,EAAE,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AACpF,UAAM,gBAAgB,aAAa;AACnC,eAAW,KAAK,QAAQ;AACtB,iBAAW,KAAK,KAAK,IAAI,EAAE,EAAE,IAAI,KAAK,CAAC,GAAG;AACxC,cAAM,QAAQ,UAAU,EAAE,IAAI;AAE9B,YAAI,EAAE,OAAO,MAAM,QAAQ;AACzB,wBAAc,KAAK;AAAA,YACjB,MAAM,EAAE,EAAE;AAAA,YACV,OAAO,EAAE;AAAA,YACT,KAAK,GAAG,EAAE,IAAI,IAAI,EAAE,IAAI;AAAA,UAC1B,CAAC;AACD;AAAA,QACF;AACA,cAAM,IAAI;AAAA,UACR;AAAA,UACA,EAAE;AAAA,UACF,OAAO,EAAE,IAAI;AAAA,UACb;AAAA,UACA,UAAU,EAAE,MAAM,CAAC,IAAI,OAAO,MAAM,YAAY,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;AAAA,QAClE;AACA,cAAM,mBAAmB,SAAS;AAAA,UAChC,CAAC,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE;AAAA,QAC/D;AACA,sBAAc,KAAK;AAAA,UACjB,MAAM,EAAE,EAAE;AAAA,UACV,OAAO,EAAE;AAAA,UACT,KAAK,GAAG,EAAE,IAAI,IAAI,EAAE,IAAI,GAAG,mBAAmB,yBAAyB,EAAE;AAAA,QAC3E,CAAC;AACD,YAAI,iBAAkB;AACtB,oBAAY,EAAE,MAAM,GAAG,GAAG,EAAE,EAAE,IAAI;AAAA,MACpC;AAAA,IACF;AACA,UAAM,WAAW,aAAa,MAAM,aAAa;AACjD,QAAI,SAAS,QAAQ;AACnB,YAAM,YAAY,MAAM,MAAM,cAAc,UAAU,KAAK,WAAW;AACtE,iBAAW,KAAK,UAAU;AACxB,cAAM,IAAI,UAAU,IAAI,EAAE,EAAE;AAC5B,YAAI,GAAG;AACL,YAAE,MAAM,EAAE;AACV,YAAE,MAAM,EAAE;AAAA,QACZ;AAAA,MACF;AAAA,IACF;AACA,SAAK,SAAS;AAAA,MACZ,IAAI,IAAI;AAAA,MACR,OAAO,MAAM,IAAI,CAAC,MAAM,GAAG,EAAE,IAAI,IAAI,EAAE,KAAK,EAAE;AAAA,MAC9C,YAAY,UAAU,IAAI,CAAC,OAAO;AAAA,QAChC,IAAI,EAAE;AAAA,QACN,MAAM,EAAE;AAAA,QACR,QAAQ,EAAE;AAAA,QACV,KAAK,MAAM,EAAE,GAAG;AAAA,QAChB,GAAG,MAAM,WAAW,IAAI,EAAE,EAAE,KAAK,OAAO,GAAG;AAAA,MAC7C,EAAE;AAAA,MACF,UAAU;AAAA,MACV,WAAW,UAAU,KAAK;AAAA,MAC1B,aAAa,UAAU;AAAA,MACvB,WAAW,UAAU;AAAA,MACrB,SAAS;AAAA,MACT,aAAa,SACV,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,EAC9B,IAAI,CAAC,OAAO;AAAA,QACX,IAAI,EAAE;AAAA,QACN,MAAM,EAAE;AAAA,QACR,OAAO,EAAE;AAAA,QACT,KAAK,EAAE;AAAA,QACP,MAAM,EAAE;AAAA,QACR,KAAK,MAAM,EAAE,GAAG;AAAA,MAClB,EAAE;AAAA,IACN,CAAC;AAAA,EACH;AACA,OAAK,SAAS,EAAE;AAGhB,OAAK,YAAY,IAAI;AACrB,QAAM,MAAM,IAAI,KAAK;AACrB,QAAM,aAAa,KAAK,MAAM,eAAe,GAAG;AAChD,QAAM,gBAAgB,MAAM,aAAa,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,SAAS,GAAG,CAAC;AAC7E,QAAM,gBAAgB,KAAK,IAAI,MAAM,KAAK,MAAM,aAAa,IAAI,CAAC;AAClE,QAAM,OAAO,SAAS,UAAU;AAAA,IAC9B;AAAA,IACA,IAAI,IAAI;AAAA,IACR,WAAW,KAAK,IAAI,GAAG,aAAa,gBAAgB,aAAa;AAAA,IACjE;AAAA,IACA,sBAAsB,CAAC,wBAAwB,IAAI,WAAW,MAAM,aAAa,KAAK,GAAG,CAAC;AAAA,IAC1F,iBAAiB,CAAC,sBAAsB,IAAI,QAAQ;AAAA,EACtD,CAAC;AACD,QAAM,gBAAgB,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AAC9D,QAAM,gBAAgB,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AACzD,QAAM,aAAa,OAChB,OAAO,CAAC,MAAM,CAAC,cAAc,IAAI,IAAI,WAAW,CAAC,EAAG,IAAI,CAAC,EACzD,IAAI,CAAC,OAAO,EAAE,MAAM,IAAI,WAAW,CAAC,EAAG,MAAM,OAAO,WAAW,IAAI,QAAQ,CAAC,CAAE,KAAK,EAAE,EAAE,EACvF,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC;AAC5B,QAAM,eAAe,IAAI,IAAI,UAAU,IAAI,CAAC,GAAG,MAAM,CAAC,EAAE,MAAM,IAAI,OAAO,CAAC,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;AAChG,QAAM,cAAc,UACjB,OAAO,CAAC,MAAM,CAAC,YAAY,IAAI,EAAE,IAAI,CAAC,EACtC,IAAI,CAAC,OAAO;AAAA,IACX,MAAM,EAAE;AAAA,IACR,OAAO,WAAW,IAAI,aAAa,IAAI,EAAE,IAAI,CAAE,KAAK;AAAA,IACpD,QAAQ,GAAG,EAAE,OAAO,IAAI,IAAI,EAAE,OAAO,IAAI;AAAA,EAC3C,EAAE,EACD,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACnC,QAAM,OAAO,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO,KAAK,EAAE,WAAW,CAAC;AAC3D,QAAM,eAAe,IAAI,OAAO,CAAC,MAAM,EAAE,UAAU,SAAS,MAAM,EAAE,KAAK,KAAK,EAAE,SAAS,EAAE;AAC3F,QAAM,kBAAkB;AAAA,IACtB,GAAG,KAAK,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,WAAW,CAAC,EAAc,EAAE;AAAA,IAC9D,GAAG,aAAa,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,WAAW,EAAE,UAAU,EAAE;AAAA,EACrE;AACA,QAAM,cAAc,WAAW,GAAG;AAClC,QAAM,SAAS,aAAa;AAAA,IAC1B,UAAU,KAAK;AAAA,IACf;AAAA,IACA,kBAAkB;AAAA,IAClB;AAAA,IACA,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;AAAA,IACrC;AAAA,IACA,UAAU;AAAA,EACZ,CAAC;AACD,OAAK,QAAQ,EAAE;AAGf,OAAK,YAAY,IAAI;AACrB,MAAI,SAA2B,EAAE,OAAO,WAAW,SAAS,MAAM,MAAM,CAAC,EAAE;AAC3E,MAAI;AACJ,MAAI,sBAAsB;AAC1B,MAAI,IAAI,OAAO,WAAW,KAAK,SAAS,QAAQ;AAC9C,UAAM,KAAK,eAAe,KAAK,UAAU,IAAI,OAAO,gBAAgB;AACpE,0BAAsB,GAAG;AACzB,QAAI;AACF,eAAS,YAAY,MAAM,MAAM,OAAO,IAAI,GAAG,GAAG,GAAG;AAAA,IACvD,SAAS,OAAO;AACd,UACE,OAAO,WACP,EAAE,iBAAiB,uBAAuB,iBAAiB;AAE3D,cAAM;AACR,yBAAmB;AACnB,eAAS,EAAE,OAAO,WAAW,SAAS,MAAM,MAAM,CAAC,GAAG,OAAO,MAAM,QAAQ,MAAM,GAAG,GAAG,EAAE;AAAA,IAC3F;AAAA,EACF,WAAW,CAAC,KAAK,SAAS,QAAQ;AAChC,aAAS,EAAE,OAAO,gBAAgB,SAAS,MAAM,MAAM,CAAC,EAAE;AAAA,EAC5D;AACA,OAAK,UAAU,EAAE;AACjB,OAAK,QAAQ;AAAA,IACX,IAAI,IAAI;AAAA,IACR;AAAA,IACA;AAAA,IACA,UAAU,KAAK;AAAA,IACf,UAAU,KAAK,SAAS,IAAI,CAAC,OAAO;AAAA,MAClC,IAAI,EAAE;AAAA,MACN,MAAM,EAAE;AAAA,MACR,OAAO,EAAE;AAAA,MACT,KAAK,EAAE;AAAA,MACP,SAAS,EAAE;AAAA,MACX,KAAK,MAAM,EAAE,GAAG;AAAA,MAChB,KAAK,EAAE,IAAI,IAAI,KAAK;AAAA,MACpB,OAAO,EAAE,MAAM;AAAA,IACjB,EAAE;AAAA,IACF,UAAU,KAAK,SAAS,IAAI,CAAC,OAAO;AAAA,MAClC,IAAI,EAAE;AAAA,MACN,MAAM,EAAE;AAAA,MACR,OAAO,EAAE;AAAA,MACT,KAAK,EAAE;AAAA,MACP,KAAK,MAAM,EAAE,GAAG;AAAA,IAClB,EAAE;AAAA,IACF;AAAA,IACA;AAAA,EACF,CAAC;AAGD,QAAM,YAAY,OAAO,OAAO,MAAM,MAAM,CAAC,EAAE;AAAA,IAC7C,CAAC,GAAG,OAAO;AAAA,MACT,UAAU,EAAE,WAAW,EAAE;AAAA,MACzB,aAAa,EAAE,cAAc,EAAE;AAAA,MAC/B,SAAS,EAAE,UAAU,EAAE;AAAA,IACzB;AAAA,IACA,EAAE,UAAU,GAAG,aAAa,GAAG,SAAS,EAAE;AAAA,EAC5C;AACA,QAAM,SAAS,KAAK,MAAM,YAAY,IAAI,IAAI,EAAE;AAChD,QAAM,QAAQ,aAAa,OAAO;AAGlC,QAAM,aACJ,OAAO,UAAU,aAAa,OAAO,YAAY,OAC7C,OAAO,QACL,2CACA,uCACF,mBAAmBF,IAAG,OAAO,OAAO,CAAC,MACpC,OAAO,KAAK,SACT,KAAK,OAAO,KAAK,IAAI,CAAC,GAAG,MAAM,IAAI,IAAI,CAAC,IAAIA,IAAG,CAAC,CAAC,EAAE,EAAE,KAAK,IAAI,CAAC,MAC/D;AACV,QAAM,YAAY,CAAC,YAAoB;AACrC,UAAM,OAAO;AAAA,MACX,cAAc,QAAQ,MAAM,QAAQ,EAAE,KAAK,UAAU,MAAM,KAAK,SAAS,MAAM,kBAAkB,cAAc,IAAI,YAAY,KAAK,OAAO,CAAC,cAAc,SAAS,KAAM,QAAQ,CAAC,CAAC;AAAA,IACrL;AACA,QAAI,aAAa,OAAQ,MAAK,KAAK,aAAa,IAAI,CAAC,GAAG,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,IAAI,CAAC;AAC3F,SAAK;AAAA,MACH,KAAK,SAAS,SACV,8QACA;AAAA,IACN;AACA,WAAO,CAAC,KAAK,KAAK,IAAI,GAAG,KAAK,MAAM,MAAM,EAAE,OAAO,OAAO,EAAE,KAAK,MAAM,IAAI;AAAA,EAC7E;AACA,MAAI,OAAO,UAAU,CAAC;AACtB,SAAO,UAAU,UAAU,KAAK,QAAQ,GAAG,CAAC;AAC5C,QAAM,QAAyB;AAAA,IAC7B;AAAA,IACA;AAAA,IACA,YAAY,IAAI,WAAW;AAAA,IAC3B,eAAe,SAAS;AAAA,IACxB,kBAAkB,SAAS;AAAA,IAC3B,kBAAkB,KAAK,SAAS;AAAA,IAChC,WAAW,KAAK;AAAA,IAChB,eAAe,UAAU,KAAK,QAAQ,GAAG;AAAA,IACzC,gBAAgB,QAAQ;AAAA,IACxB,kBAAkB,QAAQ;AAAA,IAC1B,KAAK,EAAE,GAAG,WAAW,OAAO,MAAM,MAAM,EAAE;AAAA,EAC5C;AACA,OAAK,WAAW,EAAE,QAAQ,SAAS,OAAO,QAAQ,YAAY,MAAM,MAAM,EAAE,CAAC;AAC7E,QAAM,SAA2B,EAAE,SAAS,4BAA4B,MAAM,QAAQ,MAAM;AAC5F,MAAI,iBAAkB,QAAO,mBAAmB;AAChD,SAAO;AACT;AAEA,SAAS,MAAM,GAAmB;AAChC,SAAO,OAAO,SAAS,CAAC,IAAI,KAAK,MAAM,IAAI,GAAI,IAAI,MAAO;AAC5D;;;AC7vBO,IAAM,wBAAwB;AAE9B,IAAM,+BACX;AASK,IAAM,qBAAqB;AAAA,EAChC,kBAAkB;AAAA,EAClB,kBAAkB;AAAA,EAClB,aAAa;AAAA,EACb,iBAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,qBAAqB;AAAA,EACrB,UAAU;AAAA,EACV,cAAc;AAChB;AAEA,IAAM,IAAI;AAYH,IAAM,wBAAgE;AAAA,EAC3E,MAAM;AAAA,EACN,YAAY;AAAA,IACV,UAAU;AAAA,MACR,MAAM;AAAA,MACN,WAAW,EAAE;AAAA,MACb,WAAW,EAAE;AAAA,MACb,aACE;AAAA,IACJ;AAAA,IACA,UAAU;AAAA,MACR,MAAM;AAAA,MACN,UAAU;AAAA,MACV,UAAU,EAAE;AAAA,MACZ,OAAO,EAAE,MAAM,UAAU,WAAW,GAAG,WAAW,EAAE,gBAAgB;AAAA,MACpE,aACE;AAAA,IACJ;AAAA,IACA,cAAc;AAAA,MACZ,MAAM;AAAA,MACN,UAAU,EAAE;AAAA,MACZ,OAAO,EAAE,MAAM,UAAU,WAAW,GAAG,WAAW,EAAE,oBAAoB;AAAA,MACxE,aAAa;AAAA,IACf;AAAA,IACA,OAAO;AAAA,MACL,MAAM;AAAA,MACN,UAAU,EAAE;AAAA,MACZ,OAAO,EAAE,MAAM,UAAU,WAAW,GAAG,WAAW,EAAE,aAAa;AAAA,MACjE,aACE;AAAA,IACJ;AAAA,EACF;AAAA,EACA,UAAU,CAAC,YAAY,UAAU;AAAA,EACjC,sBAAsB;AACxB;AAUO,IAAM,0BAAN,cAAsC,MAAM;AAAA,EACjD,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAEA,IAAM,kBAAkB,oBAAI,IAAI,CAAC,YAAY,YAAY,gBAAgB,OAAO,CAAC;AAG1E,SAAS,yBAAyB,MAAoD;AAC3F,QAAM,UAAU,OAAO,KAAK,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,gBAAgB,IAAI,CAAC,CAAC;AACvE,MAAI,QAAQ,QAAQ;AAClB,UAAM,IAAI;AAAA,MACR,oBAAoB,QAAQ,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,KAAK,IAAI,CAAC;AAAA,IAC7D;AAAA,EACF;AAEA,MAAI,OAAO,KAAK,aAAa;AAC3B,UAAM,IAAI,wBAAwB,2CAA2C;AAC/E,QAAM,WAAW,KAAK,SAAS,KAAK;AACpC,MAAI,SAAS,SAAS,EAAE;AACtB,UAAM,IAAI,wBAAwB,6BAA6B,EAAE,gBAAgB,aAAa;AAChG,MAAI,SAAS,SAAS,EAAE;AACtB,UAAM,IAAI,wBAAwB,4BAA4B,EAAE,gBAAgB,aAAa;AAE/F,QAAM,WAAW,WAAW,KAAK,UAAU,YAAY,IAAI;AAC3D,MAAI,CAAC,SAAS;AACZ,UAAM,IAAI,wBAAwB,sDAAsD;AAC1F,MAAI,SAAS,SAAS,EAAE;AACtB,UAAM,IAAI;AAAA,MACR,4BAA4B,EAAE,WAAW,sBAAsB,EAAE,WAAW;AAAA,IAC9E;AACF,QAAM,cAAc,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,eAAe;AACrE,MAAI;AACF,UAAM,IAAI;AAAA,MACR,gCAAgC,EAAE,eAAe;AAAA,IACnD;AAEF,QAAM,eAAe,WAAW,KAAK,cAAc,gBAAgB,KAAK;AACxE,MAAI,aAAa,SAAS,EAAE;AAC1B,UAAM,IAAI,wBAAwB,gCAAgC,EAAE,eAAe,UAAU;AAC/F,MAAI,aAAa,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,mBAAmB,GAAG;AAC9D,UAAM,IAAI;AAAA,MACR,qCAAqC,EAAE,mBAAmB;AAAA,IAC5D;AAAA,EACF;AAEA,QAAM,QAAQ,CAAC,GAAG,IAAI,IAAI,WAAW,KAAK,OAAO,SAAS,KAAK,EAAE,IAAI,aAAa,CAAC,CAAC;AACpF,MAAI,MAAM,SAAS,EAAE;AACnB,UAAM,IAAI,wBAAwB,yBAAyB,EAAE,QAAQ,UAAU;AAEjF,SAAO,EAAE,UAAU,UAAU,cAAc,MAAM;AACnD;AAEA,SAAS,WAAW,OAAgB,MAAc,UAA6B;AAC7E,MAAI,UAAU,UAAa,UAAU,MAAM;AACzC,QAAI;AACF,YAAM,IAAI,wBAAwB,GAAG,IAAI,8CAA8C;AACzF,WAAO,CAAC;AAAA,EACV;AACA,MAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,KAAK,CAAC,MAAM,OAAO,MAAM,QAAQ,GAAG;AACrE,UAAM,IAAI,wBAAwB,GAAG,IAAI,8BAA8B;AAAA,EACzE;AACA,SAAO,CAAC,GAAG,IAAI,IAAK,MAAmB,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO,OAAO,CAAC,CAAC;AAC9E;AAEA,SAAS,cAAc,KAAqB;AAC1C,MAAI,IAAI,SAAS,EAAE;AACjB,UAAM,IAAI,wBAAwB,6BAA6B,EAAE,YAAY,aAAa;AAC5F,MAAI,IAAI,WAAW,GAAG,KAAK,IAAI,WAAW,GAAG,KAAK,kBAAkB,KAAK,GAAG,GAAG;AAC7E,UAAM,IAAI;AAAA,MACR,SAAS,GAAG;AAAA,IACd;AAAA,EACF;AACA,MAAI,IAAI;AACR,SAAO,EAAE,WAAW,IAAI,EAAG,KAAI,EAAE,MAAM,CAAC;AACxC,MAAI,EAAE,QAAQ,QAAQ,EAAE;AACxB,MAAI,CAAC,EAAG,KAAI;AACZ,MAAI,EAAE,MAAM,GAAG,EAAE,KAAK,CAAC,QAAQ,QAAQ,IAAI,GAAG;AAC5C,UAAM,IAAI;AAAA,MACR,SAAS,GAAG;AAAA,IACd;AAAA,EACF;AACA,MAAI,EAAE,WAAW,GAAG,EAAG,OAAM,IAAI,wBAAwB,SAAS,GAAG,2BAA2B;AAChG,SAAO;AACT;AAEA,IAAM,WAAW;AAGV,SAAS,sBAAsB,OAAwB;AAC5D,QAAM,SAAS,CAAC,OACb,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,GAAG,QAAQ,QAAQ,GAAG,EAAE,KAAK,EAAE,MAAM,GAAG,GAAG;AACvF,MAAI,iBAAiB;AACnB,WAAO,mCAAmC,MAAM,OAAO;AACzD,MAAI,iBAAiB;AACnB,WAAO,yCAAyC,OAAO,KAAK,CAAC,MAAM,QAAQ;AAC7E,MAAI,iBAAiB;AACnB,WAAO,iEAAiE,OAAO,KAAK,CAAC,MAAM,QAAQ;AACrG,MAAI,iBAAiB,KAAK,GAAG;AAC3B,WAAO;AAAA,EACT;AACA,MAAI,iBAAiB;AACnB,WAAO,gDAAgD,OAAO,KAAK,CAAC,MAAM,QAAQ;AACpF,MAAI,QAAQ,KAAK,EAAG,QAAO;AAC3B,SAAO,oCAAoC,OAAO,KAAK,CAAC,MAAM,QAAQ;AACxE;AAEA,SAAS,iBAAiB,OAAyB;AACjD,MAAI,iBAAiB,8BAA+B,QAAO;AAC3D,MAAI,EAAE,iBAAiB,0BAA2B,QAAO;AACzD,QAAM,IAAI,MAAM;AAChB,SAAO,kBAAkB,KAAK,CAAC,KAAK,qDAAqD,KAAK,CAAC;AACjG;AAEA,SAAS,QAAQ,OAAyB;AACxC,SACE,OAAO,UAAU,YACjB,UAAU,QACT,MAA6B,SAAS;AAE3C;","names":["chunk","excludeArgs","CONTROL","start","end","x","cap","l","m","mf","keywords","files","results","r2","text","label"]}