acp-kernel 0.0.38 → 0.0.39

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/refs.ts","../src/state.ts","../src/prune.ts","../src/sync.ts","../src/config.ts","../src/boundaries.ts","../src/truncate-tools.ts","../src/hide-consumed.ts","../src/filter/registry.ts","../src/filter/apply.ts","../src/render-refs.ts","../src/protected.ts","../src/tool-pairs.ts","../src/reasoning-pairs.ts","../src/recommend.ts","../src/pipeline.ts","../src/compress.ts","../src/decompress.ts","../src/report.ts","../src/rebuild.ts","../src/transform-channel.ts","../src/search/stemmer.ts","../src/search/tokenizer.ts","../src/search/doc-cache.ts","../src/search/algorithms/substring.ts","../src/search/algorithms/bm25.ts","../src/search/algorithms/fuzzy.ts","../src/search/algorithms/hybrid.ts","../src/search/registry.ts","../src/search/types.ts","../src/search/index.ts"],"sourcesContent":["import type { CoreMessage, MessageRefMap } from \"./types.js\";\n\nconst REF_WIDTH = 5;\nconst MIN_INDEX = 1;\nconst MAX_INDEX = 99999;\nconst REF_PATTERN = /^m0*(\\d{1,5})$/;\n\nexport const BLOCKED_REF = \"BLOCKED\";\n\nexport function emptyRefMap(): MessageRefMap {\n  return { byRaw: {}, byRef: {} };\n}\n\nexport function indexToRef(index: number): string {\n  if (!Number.isInteger(index) || index < MIN_INDEX || index > MAX_INDEX) {\n    throw new RangeError(\n      `ref index out of bounds: ${index} (allowed ${MIN_INDEX}-${MAX_INDEX})`,\n    );\n  }\n  return `m${String(index).padStart(REF_WIDTH, \"0\")}`;\n}\n\nexport function refToIndex(ref: string): number | null {\n  const match = REF_PATTERN.exec(ref.trim().toLowerCase());\n  if (!match) return null;\n  const index = Number(match[1]);\n  if (index < MIN_INDEX || index > MAX_INDEX) return null;\n  return index;\n}\n\nexport function refForRaw(map: MessageRefMap, rawId: string): string | null {\n  return map.byRaw[rawId] ?? null;\n}\n\nexport function rawForRef(map: MessageRefMap, ref: string): string | null {\n  return map.byRef[ref] ?? null;\n}\n\nexport interface AssignRefsResult {\n  map: MessageRefMap;\n  nextIndex: number;\n  newlyAssigned: number;\n}\n\nexport interface AssignRefsOptions {\n  existing: MessageRefMap;\n  nextIndex: number;\n  isProtected?: (message: CoreMessage) => boolean;\n  shouldSkip?: (message: CoreMessage) => boolean;\n}\n\nexport function assignRefs(\n  messages: CoreMessage[],\n  options: AssignRefsOptions,\n): AssignRefsResult {\n  const map: MessageRefMap = {\n    byRaw: { ...options.existing.byRaw },\n    byRef: { ...options.existing.byRef },\n  };\n  let cursor =\n    Number.isInteger(options.nextIndex) && options.nextIndex >= MIN_INDEX\n      ? options.nextIndex\n      : MIN_INDEX;\n  let newlyAssigned = 0;\n\n  for (const message of messages) {\n    if (!message.id || options.shouldSkip?.(message)) continue;\n\n    if (map.byRaw[message.id]) continue;\n\n    if (options.isProtected?.(message)) {\n      map.byRaw[message.id] = BLOCKED_REF;\n      continue;\n    }\n\n    const ref = allocateFreeRef(map, cursor);\n    cursor = ref.index + 1;\n    map.byRaw[message.id] = ref.text;\n    map.byRef[ref.text] = message.id;\n    newlyAssigned++;\n  }\n\n  return { map, nextIndex: cursor, newlyAssigned };\n}\n\nfunction allocateFreeRef(\n  map: MessageRefMap,\n  start: number,\n): { text: string; index: number } {\n  let candidate = Math.max(start, MIN_INDEX);\n  while (candidate <= MAX_INDEX) {\n    const text = indexToRef(candidate);\n    if (!map.byRef[text]) {\n      return { text, index: candidate };\n    }\n    candidate++;\n  }\n  throw new Error(\n    `ref capacity exhausted: cannot allocate beyond ${indexToRef(MAX_INDEX)}`,\n  );\n}\n\nexport function rebuildRefIndex(map: MessageRefMap): MessageRefMap {\n  const byRef: Record<string, string> = {};\n  for (const [rawId, ref] of Object.entries(map.byRaw)) {\n    if (ref !== BLOCKED_REF) byRef[ref] = rawId;\n  }\n  return { byRaw: { ...map.byRaw }, byRef };\n}\n\nexport function highestUsedIndex(map: MessageRefMap): number {\n  let highest = 0;\n  for (const ref of Object.values(map.byRaw)) {\n    const index = ref === BLOCKED_REF ? null : refToIndex(ref);\n    if (index !== null && index > highest) highest = index;\n  }\n  return highest;\n}\n","import type { CompressionBlock, CompressionState } from \"./types.js\";\n\nexport function createInitialState(): CompressionState {\n  return {\n    blocks: [],\n    messageRefs: { byRaw: {}, byRef: {} },\n    tokenSnapshot: {},\n    nudge: {\n      lastPerMessageNudgeTokens: 0,\n      lastNudgeShownTokens: 0,\n      baselineTokens: 0,\n      anchors: {},\n      lastShownByTier: {},\n    },\n    stats: { tokensCompressed: 0, compressionCount: 0 },\n    nextBlockId: 1,\n    nextRunId: 1,\n  };\n}\n\nexport function allocateBlockId(state: CompressionState): string {\n  const id = state.nextBlockId;\n  state.nextBlockId = Math.max(1, id) + 1;\n  return `b${id}`;\n}\n\nexport function allocateRunId(state: CompressionState): string {\n  const id = state.nextRunId;\n  state.nextRunId = Math.max(1, id) + 1;\n  return `r${id}`;\n}\n\nexport function blockById(\n  state: CompressionState,\n  blockId: string,\n): CompressionBlock | undefined {\n  return state.blocks.find((block) => block.blockId === blockId);\n}\n\nexport function activeBlocks(state: CompressionState): CompressionBlock[] {\n  return state.blocks.filter((block) => block.active);\n}\n\nexport function coveredMessageIds(state: CompressionState): Set<string> {\n  const covered = new Set<string>();\n  for (const block of state.blocks) {\n    if (!block.active) continue;\n    for (const id of block.effectiveMessageIds) covered.add(id);\n  }\n  return covered;\n}\n\nexport function highestActiveTier(state: CompressionState): 0 | 1 | 2 | 3 {\n  let highest: 0 | 1 | 2 | 3 = 0;\n  for (const block of state.blocks) {\n    if (block.active && block.tier > highest) highest = block.tier;\n  }\n  return highest;\n}\n\nexport function advanceSurvival(\n  state: CompressionState,\n  promotionThreshold: number,\n): void {\n  for (const block of state.blocks) {\n    if (!block.active) continue;\n    block.survivedCount += 1;\n    if (block.survivedCount >= promotionThreshold) {\n      block.generation = \"old\";\n    }\n  }\n}\n","import { activeBlocks, coveredMessageIds } from \"./state.js\";\nimport type { CompressionState, CoreMessage } from \"./types.js\";\n\nexport const SUMMARY_HEADER = \"[Compressed conversation section]\";\n\n// Reserved prefix for rendered-summary ids. Hosts own their message ids and\n// must never assign one with this prefix; kernel-generated ids are mNNNNN\n// refs and bN block ids.\nconst SUMMARY_ID_PREFIX = \"acp_summary_\";\n\n/**\n * The transient visible id of an active block's rendered summary message.\n * This is a VIEW-ONLY representation: it must never be persisted into\n * `effectiveMessageIds`/`directMessageIds` (the durable coverage is the\n * block's raw message ids).\n */\nexport function summaryMessageId(blockId: string): string {\n  return `${SUMMARY_ID_PREFIX}${blockId}`;\n}\n\nexport function isSummaryMessageId(id: string): boolean {\n  return id.startsWith(SUMMARY_ID_PREFIX);\n}\n\n/**\n * True when a message is a rendered block summary (the exact shape prune\n * emits). The id prefix alone is not sufficient — a host-authored message\n * that happens to carry a reserved id must not be treated as a rendered\n * summary (it would be silently dropped from ranges or deleted by rebuild).\n */\nexport function isRenderedSummaryMessage(\n  message: Pick<CoreMessage, \"id\" | \"role\" | \"contentType\">,\n): boolean {\n  return (\n    isSummaryMessageId(message.id) &&\n    message.role === \"system\" &&\n    message.contentType === \"text\"\n  );\n}\n\nexport interface PruneOptions {\n  injectSummaries?: boolean;\n}\n\nexport function prune(\n  messages: CoreMessage[],\n  state: CompressionState,\n  options: PruneOptions = {},\n): CoreMessage[] {\n  const covered = coveredMessageIds(state);\n  if (covered.size === 0) return [...messages];\n\n  const inject = options.injectSummaries ?? true;\n  const firstUserIndex = messages.findIndex(\n    (message) => message.role === \"user\",\n  );\n\n  const indexById = new Map<string, number>();\n  const summaryIndexById = new Map<string, number>();\n  messages.forEach((message, index) => {\n    indexById.set(message.id, index);\n    if (isRenderedSummaryMessage(message))\n      summaryIndexById.set(message.id, index);\n  });\n\n  const anchors = inject\n    ? collectSummaryAnchors(state, indexById, summaryIndexById)\n    : [];\n\n  return stripOrphanedReasoning(\n    stripOrphanedToolResults(\n      stripOrphanedToolCalls(\n        rebuildMessages(messages, covered, firstUserIndex, anchors),\n      ),\n    ),\n  );\n}\n\ninterface SummaryAnchor {\n  blockId: string;\n  summary: string;\n  topic?: string;\n  insertAt: number;\n}\n\nfunction collectSummaryAnchors(\n  state: CompressionState,\n  indexById: Map<string, number>,\n  summaryIndexById: Map<string, number>,\n): SummaryAnchor[] {\n  const anchors: SummaryAnchor[] = [];\n  for (const block of activeBlocks(state)) {\n    // Prefer the position of an already-rendered summary (hosts may pass a\n    // previously-pruned view): keeps the summary stable in place instead of\n    // jumping to index 0 when the raw ids are no longer in the input.\n    const existingIndex = summaryIndexById.get(summaryMessageId(block.blockId));\n    if (existingIndex !== undefined) {\n      anchors.push({\n        blockId: block.blockId,\n        summary: block.summary,\n        topic: block.topic,\n        insertAt: existingIndex,\n      });\n      continue;\n    }\n    let earliest: number | null = null;\n    for (const id of block.effectiveMessageIds) {\n      const index = indexById.get(id);\n      if (index !== undefined && (earliest === null || index < earliest)) {\n        earliest = index;\n      }\n    }\n    anchors.push({\n      blockId: block.blockId,\n      summary: block.summary,\n      topic: block.topic,\n      insertAt: earliest ?? 0,\n    });\n  }\n  anchors.sort((left, right) => left.insertAt - right.insertAt);\n  return anchors;\n}\n\nfunction rebuildMessages(\n  messages: CoreMessage[],\n  covered: Set<string>,\n  firstUserIndex: number,\n  anchors: SummaryAnchor[],\n): CoreMessage[] {\n  const result: CoreMessage[] = [];\n  const pending = [...anchors];\n  const anchoredSummaryIds = new Set(\n    anchors.map((anchor) => summaryMessageId(anchor.blockId)),\n  );\n\n  for (let index = 0; index < messages.length; index++) {\n    while (pending.length > 0 && pending[0]!.insertAt === index) {\n      result.push(renderSummary(pending.shift()!));\n    }\n    if (index === firstUserIndex && firstUserIndex >= 0) {\n      result.push(messages[index]!);\n      continue;\n    }\n    if (covered.has(messages[index]!.id)) continue;\n    // A stale copy of this block's summary from a previously-pruned view:\n    // the freshly rendered one above replaces it. Only rendered-summary\n    // shaped messages qualify — a host message that merely reuses the\n    // reserved prefix is content, not a stale copy.\n    if (\n      isRenderedSummaryMessage(messages[index]!) &&\n      anchoredSummaryIds.has(messages[index]!.id)\n    )\n      continue;\n    result.push(messages[index]!);\n  }\n\n  while (pending.length > 0) {\n    result.push(renderSummary(pending.shift()!));\n  }\n\n  return result;\n}\n\nfunction renderSummary(anchor: SummaryAnchor): CoreMessage {\n  const body = anchor.summary.trim();\n  const topicLine = anchor.topic\n    ? `${SUMMARY_HEADER} — ${anchor.topic}`\n    : SUMMARY_HEADER;\n  const text = body.length === 0 ? topicLine : `${topicLine}\\n${body}`;\n  return {\n    id: summaryMessageId(anchor.blockId),\n    role: \"system\",\n    contentType: \"text\",\n    text,\n  };\n}\n\nfunction stripOrphanedToolResults(messages: CoreMessage[]): CoreMessage[] {\n  const knownCallIds = new Set<string>();\n  for (const m of messages) {\n    if (m.contentType === \"tool-call\" && m.toolCallId) {\n      knownCallIds.add(m.toolCallId);\n    }\n  }\n  return messages.filter(\n    (m) =>\n      m.contentType !== \"tool-result\" ||\n      !m.toolCallId ||\n      knownCallIds.has(m.toolCallId),\n  );\n}\n\nfunction stripOrphanedToolCalls(messages: CoreMessage[]): CoreMessage[] {\n  const knownResultIds = new Set<string>();\n  for (const m of messages) {\n    if (m.contentType === \"tool-result\" && m.toolCallId) {\n      knownResultIds.add(m.toolCallId);\n    }\n  }\n  return messages.filter(\n    (m) =>\n      m.contentType !== \"tool-call\" ||\n      !m.toolCallId ||\n      m.toolName === \"compress\" ||\n      knownResultIds.has(m.toolCallId),\n  );\n}\n\n/**\n * Defense-in-depth for reasoning/text pairing (analogue of\n * {@link stripOrphanedToolCalls}). A `reasoning` message is only meaningful\n * when immediately followed — after any same-run reasoning — by its companion\n * assistant text/tool-call; strict thinking models (DeepSeek et al.) reject\n * reasoning_content that has lost its response with HTTP 400. Compress-time\n * boundary expansion normally keeps the pair in one block, so this only fires\n * for degenerate straddles (block-boundary ranges, malformed input, or a\n * reasoning that never had a companion): drop the dangling run rather than\n * ship a 400-triggering half-pair. Runs AFTER tool stripping, since removing\n * an orphaned tool-call can leave its preceding reasoning dangling too.\n */\nfunction stripOrphanedReasoning(messages: CoreMessage[]): CoreMessage[] {\n  const drop = new Set<number>();\n  for (let i = 0; i < messages.length; i++) {\n    if (drop.has(i)) continue;\n    if (messages[i]!.contentType !== \"reasoning\") continue;\n    let j = i;\n    while (\n      j + 1 < messages.length &&\n      messages[j + 1]!.contentType === \"reasoning\"\n    ) {\n      j++;\n    }\n    const companion = messages[j + 1];\n    const hasCompanion =\n      companion !== undefined &&\n      companion.role === \"assistant\" &&\n      (companion.contentType === \"text\" ||\n        companion.contentType === \"tool-call\");\n    if (!hasCompanion) {\n      for (let k = i; k <= j; k++) drop.add(k);\n    }\n  }\n  if (drop.size === 0) return messages;\n  return messages.filter((_, i) => !drop.has(i));\n}\n","import { summaryMessageId } from \"./prune.js\";\nimport type { CompressionState, CoreMessage } from \"./types.js\";\n\nexport interface SyncResult {\n  state: CompressionState;\n  deactivated: string[];\n}\n\nexport function syncBlocks(\n  messages: CoreMessage[],\n  state: CompressionState,\n): SyncResult {\n  const presentIds = new Set(messages.map((message) => message.id));\n  const deactivated: string[] = [];\n  // Deep-clone (not just `{...state}`) so the caller's input state is never\n  // mutated: processTurn stamps `state.nudge.*` and reassigns `messageRefs`,\n  // and block sub-arrays must not alias the input. Previously nudge/stats/\n  // messageRefs were shared references → input-state mutation leak.\n  const result: CompressionState = {\n    blocks: state.blocks.map((block) => ({\n      ...block,\n      directMessageIds: [...block.directMessageIds],\n      effectiveMessageIds: [...block.effectiveMessageIds],\n      directBlockIds: [...block.directBlockIds],\n    })),\n    messageRefs: {\n      byRaw: { ...state.messageRefs.byRaw },\n      byRef: { ...state.messageRefs.byRef },\n    },\n    // Snapshot is keyed by ref with primitive values — shallow copy suffices.\n    tokenSnapshot: { ...(state.tokenSnapshot ?? {}) },\n    nudge: { ...state.nudge, anchors: { ...state.nudge.anchors } },\n    stats: { ...state.stats },\n    nextBlockId: state.nextBlockId,\n    nextRunId: state.nextRunId,\n  };\n\n  // Refs are additive (assignRefs never removes them from messageRefs), so\n  // prune the snapshot by currently-present message refs — otherwise it grows\n  // unboundedly as messages are compressed/deleted across a long session.\n  const liveRefs = new Set(\n    messages\n      .map((m) => result.messageRefs.byRaw[m.id])\n      .filter((r): r is string => typeof r === \"string\"),\n  );\n  if (Object.keys(result.tokenSnapshot).length !== liveRefs.size) {\n    const pruned: Record<string, number> = {};\n    for (const [ref, n] of Object.entries(result.tokenSnapshot)) {\n      if (liveRefs.has(ref)) pruned[ref] = n;\n    }\n    result.tokenSnapshot = pruned;\n  }\n\n  const consumedBlockIds = new Set<string>();\n  for (const block of result.blocks) {\n    for (const consumedId of block.directBlockIds) {\n      consumedBlockIds.add(consumedId);\n    }\n  }\n\n  for (const block of result.blocks) {\n    if (consumedBlockIds.has(block.blockId)) {\n      block.active = false;\n      continue;\n    }\n    block.active = true;\n    // A block whose raw messages were replaced by its rendered summary\n    // (pruned view) is still present — the summary IS the block's visible\n    // representation. Without this, hosts passing pruned views would lose\n    // block activity every turn.\n    const stillPresent =\n      block.effectiveMessageIds.some((id) => presentIds.has(id)) ||\n      presentIds.has(summaryMessageId(block.blockId));\n    if (!stillPresent) {\n      block.active = false;\n      deactivated.push(block.blockId);\n    }\n  }\n\n  return { state: result, deactivated };\n}\n","import type { Config } from \"./types.js\";\n\nexport function defaultConfig(\n  modelContextLimit: number,\n  overrides: Partial<Config> = {},\n): Config {\n  const base: Config = {\n    tiers: { enabled: true, tier2Trigger: 5, tier3Trigger: 10 },\n    nudge: {\n      maxContextLimitPct: 0.75,\n      minContextLimitPct: 0.45,\n      frequency: 5,\n      iterationThreshold: 15,\n      force: \"soft\",\n      growthRatio: 0.05,\n      growthFloor: 50000,\n      growthCap: 50000,\n      minGrowthFloor: 20000,\n      minGrowthRatio: 0.45,\n      emergencyThresholdPct: 0.95,\n      tier2GrowthMultiplier: 1.5,\n    },\n    promotionThreshold: 5,\n    truncate: { threshold: 0.95 },\n    compress: {\n      minCompressRange: 5000,\n      maxSummaryLength: 20000,\n      minSummaryLength: 50,\n    },\n    protectedTools: [],\n    preserveRecentMessages: 5,\n    preserveRecentTokens: 5000,\n    modelContextLimit,\n  };\n  return {\n    ...base,\n    ...overrides,\n    tiers: { ...base.tiers, ...overrides.tiers },\n    nudge: { ...base.nudge, ...overrides.nudge },\n    truncate: { ...base.truncate, ...overrides.truncate },\n    compress: { ...base.compress, ...overrides.compress },\n  };\n}\n\nexport function validateConfig(config: Config): string[] {\n  const errors: string[] = [];\n  if (\n    !Number.isFinite(config.modelContextLimit) ||\n    config.modelContextLimit <= 0\n  ) {\n    errors.push(\"modelContextLimit must be a positive number\");\n  }\n  if (config.nudge.minContextLimitPct > config.nudge.maxContextLimitPct) {\n    errors.push(\n      \"nudge.minContextLimitPct must not exceed nudge.maxContextLimitPct\",\n    );\n  }\n  if (config.nudge.maxContextLimitPct > config.nudge.emergencyThresholdPct) {\n    errors.push(\n      \"nudge.maxContextLimitPct must not exceed nudge.emergencyThresholdPct\",\n    );\n  }\n  if (config.promotionThreshold < 1) {\n    errors.push(\"promotionThreshold must be >= 1\");\n  }\n  if (config.truncate.threshold <= 0 || config.truncate.threshold > 1) {\n    errors.push(\"truncate.threshold must be in (0, 1]\");\n  }\n  for (const tier of [config.tiers.tier2Trigger, config.tiers.tier3Trigger]) {\n    if (tier < 1) errors.push(\"tier triggers must be >= 1\");\n  }\n  if (config.tiers.tier3Trigger <= config.tiers.tier2Trigger) {\n    errors.push(\"tiers.tier3Trigger must be greater than tiers.tier2Trigger\");\n  }\n  return errors;\n}\n","import { activeBlocks, blockById } from \"./state.js\";\nimport { isRenderedSummaryMessage, summaryMessageId } from \"./prune.js\";\nimport type {\n  CompressionBlock,\n  CompressionState,\n  CoreMessage,\n  ResolvedBoundary,\n} from \"./types.js\";\n\nexport type BoundaryKind = \"message\" | \"block\";\n\nexport interface ParsedBoundary {\n  kind: BoundaryKind;\n  numericId: number;\n  raw: string;\n}\n\nconst MESSAGE_REF_PATTERN = /^m0*(\\d{1,5})$/;\nconst BLOCK_REF_PATTERN = /^b(\\d{1,9})$/;\n\nexport function parseBoundary(ref: string): ParsedBoundary | null {\n  const normalized = ref.trim().toLowerCase();\n  const messageMatch = MESSAGE_REF_PATTERN.exec(normalized);\n  if (messageMatch) {\n    const numericId = Number(messageMatch[1]);\n    if (numericId >= 1 && numericId <= 99999) {\n      return { kind: \"message\", numericId, raw: normalized };\n    }\n  }\n  const blockMatch = BLOCK_REF_PATTERN.exec(normalized);\n  if (blockMatch) {\n    const numericId = Number(blockMatch[1]);\n    if (numericId >= 1) return { kind: \"block\", numericId, raw: normalized };\n  }\n  return null;\n}\n\n/**\n * Thrown when a boundary ref parses but cannot be anchored in the visible\n * context. `kind` distinguishes a ref that never existed (\"unknown\", e.g. a\n * typo or a ref from another session) from one that was consumed by an\n * existing block (\"consumed\", messages hidden by prune). `endpoint` names the\n * failing side of the range so callers can attribute the error precisely.\n */\nexport class BoundaryNotFoundError extends Error {\n  readonly code = \"BOUNDARY_NOT_FOUND\";\n  readonly kind: \"unknown\" | \"consumed\";\n  readonly endpoint: \"start\" | \"end\";\n\n  constructor(\n    kind: \"unknown\" | \"consumed\",\n    endpoint: \"start\" | \"end\",\n    message: string,\n  ) {\n    super(message);\n    this.name = \"BoundaryNotFoundError\";\n    this.code = \"BOUNDARY_NOT_FOUND\";\n    this.kind = kind;\n    this.endpoint = endpoint;\n  }\n}\n\nexport interface ResolveBoundariesInput {\n  startRef: string;\n  endRef: string;\n  messages: CoreMessage[];\n  state: CompressionState;\n}\n\nexport interface ResolvedRange {\n  startIndex: number;\n  endIndex: number;\n  messageIds: string[];\n  nestedBlockIds: string[];\n  boundaryKind: BoundaryKind;\n  protectedGaps: number[];\n  snappedBoundaries: string[];\n}\n\nexport function resolveBoundaries(\n  input: ResolveBoundariesInput,\n): ResolvedRange {\n  const start = parseBoundary(input.startRef);\n  const end = parseBoundary(input.endRef);\n  if (!start || !end) {\n    throw new Error(\n      `Invalid boundary ref(s): startId=\"${input.startRef}\", endId=\"${input.endRef}\". Use mNNNNN or bN.`,\n    );\n  }\n\n  const indexByMessageId = new Map<string, number>();\n  input.messages.forEach((message, index) =>\n    indexByMessageId.set(message.id, index),\n  );\n\n  let snappedBoundaries: string[] = [];\n  const startAnchor = resolveAnchorIndex(\n    start,\n    input.state,\n    indexByMessageId,\n    \"start\",\n  );\n  if (startAnchor.snapped) snappedBoundaries.push(startAnchor.snapped);\n  const endAnchor = resolveAnchorIndex(\n    end,\n    input.state,\n    indexByMessageId,\n    \"end\",\n  );\n  if (endAnchor.snapped) snappedBoundaries.push(endAnchor.snapped);\n  let startIndex = startAnchor.index;\n  let endIndex = endAnchor.index;\n\n  if (startIndex > endIndex) {\n    [startIndex, endIndex] = [endIndex, startIndex];\n  }\n\n  const messageIds: string[] = [];\n  for (let index = startIndex; index <= endIndex; index++) {\n    const message = input.messages[index];\n    // Synthetic summary messages are transient view representations, not\n    // compressible content: exclude them so they never leak into a new\n    // block's effectiveMessageIds/directMessageIds.\n    if (message && !isRenderedSummaryMessage(message))\n      messageIds.push(message.id);\n  }\n\n  const boundaryKind: BoundaryKind =\n    start.kind === \"block\" || end.kind === \"block\" ? \"block\" : \"message\";\n\n  const nestedBlockIds: string[] = [];\n  const nestedSeen = new Set<string>();\n  for (const block of activeBlocks(input.state)) {\n    const anchor = visibleBlockAnchor(block, indexByMessageId);\n    if (anchor !== null && anchor >= startIndex && anchor <= endIndex) {\n      if (!nestedSeen.has(block.blockId)) {\n        nestedSeen.add(block.blockId);\n        nestedBlockIds.push(block.blockId);\n      }\n    }\n  }\n\n  const protectedGaps: number[] = [];\n\n  return {\n    startIndex,\n    endIndex,\n    messageIds,\n    nestedBlockIds,\n    boundaryKind,\n    protectedGaps,\n    snappedBoundaries,\n  };\n}\n\ninterface AnchorResolution {\n  index: number;\n  snapped: string | null;\n}\n\nfunction resolveAnchorIndex(\n  boundary: ParsedBoundary,\n  state: CompressionState,\n  indexByMessageId: Map<string, number>,\n  endpoint: \"start\" | \"end\",\n): AnchorResolution {\n  const label = endpoint === \"start\" ? \"startId\" : \"endId\";\n  if (boundary.kind === \"message\") {\n    const rawId =\n      state.messageRefs.byRef[boundary.raw] ??\n      state.messageRefs.byRef[formatPaddedRef(boundary.numericId)];\n    if (!rawId) {\n      throw new BoundaryNotFoundError(\n        \"unknown\",\n        endpoint,\n        `${label}=\"${boundary.raw}\" does not exist in this session (typo or wrong session) — run acp_status for current refs.`,\n      );\n    }\n    const index = indexByMessageId.get(rawId);\n    if (index !== undefined) {\n      return { index, snapped: null };\n    }\n    const owner = activeOwnerAnchor(state, [rawId], indexByMessageId);\n    if (owner !== null) {\n      return {\n        index: owner,\n        snapped: `${label}=\"${boundary.raw}\" refers to a message already compressed into an active block — anchored to the active block covering it instead.`,\n      };\n    }\n    throw new BoundaryNotFoundError(\n      \"consumed\",\n      endpoint,\n      `${label}=\"${boundary.raw}\" not found in visible context (likely consumed by an existing block).`,\n    );\n  }\n\n  const block = blockById(state, `b${boundary.numericId}`);\n  if (!block) {\n    throw new BoundaryNotFoundError(\n      \"unknown\",\n      endpoint,\n      `${label}=\"b${boundary.numericId}\" does not exist in this session (typo or wrong session) — run acp_status for current refs.`,\n    );\n  }\n  if (block.active) {\n    const anchor = visibleBlockAnchor(block, indexByMessageId);\n    if (anchor !== null) {\n      return { index: anchor, snapped: null };\n    }\n  }\n  const owner = activeOwnerAnchor(\n    state,\n    block.effectiveMessageIds,\n    indexByMessageId,\n  );\n  if (owner !== null) {\n    return {\n      index: owner,\n      snapped: `${label}=\"b${boundary.numericId}\" was consumed by a higher-tier block — anchored to the active block covering its content instead.`,\n    };\n  }\n  if (!block.active) {\n    throw new BoundaryNotFoundError(\n      \"consumed\",\n      endpoint,\n      `${label}=\"b${boundary.numericId}\" not found in visible context (block distilled/consumed by a higher-tier block).`,\n    );\n  }\n  throw new BoundaryNotFoundError(\n    \"consumed\",\n    endpoint,\n    `${label}=\"b${boundary.numericId}\" is an active block but none of its content (raw messages or rendered summary) is visible in the current context — run acp_status to verify.`,\n  );\n}\n\n/**\n * Snap a consumed anchor to the active block that now owns its content.\n * Throwing instead dead-ends compress calls that follow nudge instructions\n * with older (already-distilled) refs — the livelock in dog/billion-context-pi#32.\n *\n * Only TRUE ANCESTORS qualify: an active block that INHERITED the content by\n * consuming another block. If the active block DIRECTLY compressed the\n * message itself, callers must get the \"already compressed — retry with the\n * block's bN ref\" guidance instead of a silent snap (which would turn a\n * message-range retry into a same-tier duplicate block).\n */\nfunction activeOwnerAnchor(\n  state: CompressionState,\n  ownedIds: string[],\n  indexByMessageId: Map<string, number>,\n): number | null {\n  if (ownedIds.length === 0) return null;\n  const owned = new Set(ownedIds);\n  let best: number | null = null;\n  for (const block of state.blocks) {\n    if (!block.active) continue;\n    const inherited = inheritedContentIds(state, block);\n    let ownsInherited = false;\n    for (const id of owned) {\n      if (inherited.has(id)) {\n        ownsInherited = true;\n        break;\n      }\n    }\n    if (!ownsInherited) continue;\n    const anchor = visibleBlockAnchor(block, indexByMessageId);\n    if (anchor === null) continue;\n    if (best === null || anchor < best) {\n      best = anchor;\n    }\n  }\n  return best;\n}\n\n/**\n * Content a block INHERITED by consuming other blocks: the union of its\n * children's effective coverage. Derived from `directBlockIds` rather than\n * inferred as effective−direct so imported or rebuilt state shapes cannot\n * flip the consumed-vs-snap decision.\n */\nfunction inheritedContentIds(\n  state: CompressionState,\n  block: CompressionBlock,\n): Set<string> {\n  const ids = new Set<string>();\n  for (const childId of block.directBlockIds) {\n    const child = blockById(state, childId);\n    if (!child) continue;\n    for (const id of child.effectiveMessageIds) ids.add(id);\n  }\n  return ids;\n}\n\nfunction formatPaddedRef(index: number): string {\n  return `m${String(index).padStart(5, \"0\")}`;\n}\n\n/**\n * Visible anchor index for a block: its rendered summary message if present\n * (post-prune views replace raw messages with `acp_summary_bN`), else the\n * earliest visible raw message it covers. Without the summary fallback an\n * active block whose raws were pruned becomes unresolvable and cannot be\n * promoted (dog/billion-context-pi#195).\n */\nexport function visibleBlockAnchor(\n  block: CompressionBlock,\n  indexByMessageId: Map<string, number>,\n): number | null {\n  const summaryIndex = indexByMessageId.get(summaryMessageId(block.blockId));\n  if (summaryIndex !== undefined) return summaryIndex;\n  return earliestIndexOfIds(block.effectiveMessageIds, indexByMessageId);\n}\n\nexport function earliestIndexOfIds(\n  ids: string[],\n  indexByMessageId: Map<string, number>,\n): number | null {\n  let earliest: number | null = null;\n  for (const id of ids) {\n    const index = indexByMessageId.get(id);\n    if (index !== undefined && (earliest === null || index < earliest)) {\n      earliest = index;\n    }\n  }\n  return earliest;\n}\n\nexport function toResolvedBoundary(range: ResolvedRange): ResolvedBoundary {\n  return {\n    startIndex: range.startIndex,\n    endIndex: range.endIndex,\n    protectedGaps: range.protectedGaps,\n  };\n}\n","import type { Config, CoreMessage } from \"./types.js\";\n\nexport interface TruncateOptions {\n    minOutputTokens?: number;\n    keepPrefixChars?: number;\n    keepSuffixChars?: number;\n    protectRecentMessages?: number;\n}\n\nexport interface TruncateResult {\n    messages: CoreMessage[];\n    truncatedCount: number;\n    savedTokens: number;\n}\n\nconst TRUNCATION_MARKER = \"[truncated for context space]\";\nconst DEFAULTS = {\n    minOutputTokens: 1000,\n    keepPrefixChars: 2000,\n    keepSuffixChars: 2000,\n    protectRecentMessages: 3,\n} as const;\n\nexport function truncateLargeToolOutputs(\n    messages: CoreMessage[],\n    tokenCount: number,\n    config: Config,\n    countTokens: (text: string) => number,\n    options: TruncateOptions = {},\n): TruncateResult {\n    const opts = { ...DEFAULTS, ...options };\n    if (config.modelContextLimit <= 0) return { messages, truncatedCount: 0, savedTokens: 0 };\n\n    const threshold = config.truncate.threshold * config.modelContextLimit;\n    if (tokenCount < threshold) return { messages, truncatedCount: 0, savedTokens: 0 };\n\n    const protectedIndex = messages.length - opts.protectRecentMessages;\n    const candidates: Array<{ index: number; tokens: number }> = [];\n\n    for (let index = 0; index < messages.length; index++) {\n        if (index >= protectedIndex) break;\n        const message = messages[index]!;\n        if (message.contentType !== \"tool-result\") continue;\n        const text = message.text ?? \"\";\n        if (text.length === 0 || text.includes(TRUNCATION_MARKER)) continue;\n        const tokens = countTokens(text);\n        if (tokens < opts.minOutputTokens) continue;\n        candidates.push({ index, tokens });\n    }\n\n    if (candidates.length === 0) return { messages, truncatedCount: 0, savedTokens: 0 };\n    candidates.sort((left, right) => right.tokens - left.tokens);\n\n    const targetTokens = threshold * 0.9;\n    let savedTokens = 0;\n    const edits = new Map<number, string>();\n    let truncatedCount = 0;\n\n    for (const candidate of candidates) {\n        if (tokenCount - savedTokens <= targetTokens) break;\n        const original = messages[candidate.index]!.text ?? \"\";\n        if (original.length <= opts.keepPrefixChars + opts.keepSuffixChars) continue;\n\n        const prefix = original.slice(0, opts.keepPrefixChars);\n        const suffix = original.slice(-opts.keepSuffixChars);\n        const replacement =\n            prefix +\n            `\\n\\n...${TRUNCATION_MARKER} — original ~${candidate.tokens} tokens]...\\n\\n` +\n            suffix;\n        edits.set(candidate.index, replacement);\n        savedTokens += candidate.tokens - countTokens(replacement);\n        truncatedCount++;\n    }\n\n    if (truncatedCount === 0) return { messages, truncatedCount: 0, savedTokens: 0 };\n\n    const updated = messages.map((message, index) =>\n        edits.has(index) ? { ...message, text: edits.get(index)! } : message,\n    );\n    return { messages: updated, truncatedCount, savedTokens };\n}\n","import type { CompressionState, CoreMessage } from \"./types.js\";\n\n// Orphaned compress calls (no matching block — failed attempts, or historical\n// calls whose blocks predate compressCallId recording) keep their NEWEST two\n// call+result pairs visible: failures must stay observable or a deterministic\n// model re-issues the same no-op compress forever, pinned at a fixed point\n// (billion-context-pi issue #9: 3,849 identical calls over 5h13m under\n// KEEP_LAST_ORPHANED=0). Older orphans are hidden, so the residue is bounded\n// at two pairs regardless of session length — PR #18's unbounded accumulation\n// does not return (its own live check showed the cap: 10 in → 6 out).\nconst KEEP_LAST_ORPHANED = 2;\n\nexport interface HideConsumedResult {\n    messages: CoreMessage[];\n    hidden: number;\n}\n\nfunction rangeKey(startRef: string, endRef: string): string {\n    return `${startRef}::${endRef}`;\n}\n\nfunction rewriteCompressText(text: string | undefined, liveKeys: Set<string>): string | null {\n    let parsed: unknown;\n    try {\n        parsed = JSON.parse(text ?? \"\");\n    } catch {\n        return null;\n    }\n    if (!parsed || typeof parsed !== \"object\") return null;\n    const obj = parsed as { content?: unknown };\n    const content = obj.content;\n    if (!Array.isArray(content) || content.length === 0) return null;\n\n    const kept = content.filter((entry): entry is Record<string, unknown> => {\n        if (!entry || typeof entry !== \"object\") return false;\n        const s = typeof entry.startId === \"string\" ? entry.startId : typeof entry.messageId === \"string\" ? entry.messageId : \"\";\n        const e = typeof entry.endId === \"string\" ? entry.endId : typeof entry.messageId === \"string\" ? entry.messageId : \"\";\n        return liveKeys.has(rangeKey(s, e));\n    });\n\n    if (kept.length === content.length || kept.length === 0) return null;\n\n    return JSON.stringify({ ...obj, content: kept });\n}\n\nexport function hideConsumedCompressCalls(\n    state: CompressionState,\n    messages: CoreMessage[],\n): HideConsumedResult {\n    const allBlockCallIds = new Set<string>();\n    const activeCallIds = new Set<string>();\n    const liveRangeKeysByCallId = new Map<string, Set<string>>();\n    const legacyLiveByCallId = new Set<string>();\n    for (const block of state.blocks) {\n        if (!block.compressCallId) continue;\n        allBlockCallIds.add(block.compressCallId);\n        if (!block.active) continue;\n        activeCallIds.add(block.compressCallId);\n        if (block.startRef === undefined || block.endRef === undefined) {\n            legacyLiveByCallId.add(block.compressCallId);\n            continue;\n        }\n        let keys = liveRangeKeysByCallId.get(block.compressCallId);\n        if (!keys) {\n            keys = new Set<string>();\n            liveRangeKeysByCallId.set(block.compressCallId, keys);\n        }\n        keys.add(rangeKey(block.startRef, block.endRef));\n    }\n\n    const lastOrphanedCallIds: string[] = [];\n    for (let i = messages.length - 1; i >= 0 && lastOrphanedCallIds.length < KEEP_LAST_ORPHANED; i--) {\n        const message = messages[i]!;\n        if (message.toolName !== \"compress\" || message.contentType !== \"tool-call\") continue;\n        const callId = message.toolCallId;\n        if (callId && !allBlockCallIds.has(callId)) {\n            lastOrphanedCallIds.push(callId);\n        }\n    }\n\n    const keepCallIds = new Set([...activeCallIds, ...lastOrphanedCallIds]);\n\n    const hiddenCallIds = new Set<string>();\n    for (const message of messages) {\n        if (\n            message.toolName === \"compress\" &&\n            message.contentType === \"tool-call\" &&\n            (!message.toolCallId || !keepCallIds.has(message.toolCallId))\n        ) {\n            if (message.toolCallId) hiddenCallIds.add(message.toolCallId);\n        }\n    }\n\n    let hidden = 0;\n    const result: CoreMessage[] = [];\n    for (const message of messages) {\n        if (\n            message.toolName === \"compress\" &&\n            message.contentType === \"tool-call\" &&\n            (!message.toolCallId || !keepCallIds.has(message.toolCallId))\n        ) {\n            hidden++;\n            continue;\n        }\n        if (\n            message.contentType === \"tool-result\" &&\n            message.toolCallId &&\n            hiddenCallIds.has(message.toolCallId)\n        ) {\n            hidden++;\n            continue;\n        }\n        if (\n            message.toolName === \"compress\" &&\n            message.contentType === \"tool-call\" &&\n            message.toolCallId &&\n            keepCallIds.has(message.toolCallId)\n        ) {\n            const liveKeys = liveRangeKeysByCallId.get(message.toolCallId);\n            if (liveKeys && liveKeys.size > 0 && !legacyLiveByCallId.has(message.toolCallId)) {\n                const rewritten = rewriteCompressText(message.text, liveKeys);\n                if (rewritten !== null) {\n                    result.push({ ...message, text: rewritten });\n                    continue;\n                }\n            }\n        }\n        result.push(message);\n    }\n\n    return { messages: result, hidden };\n}\n","import type { MessageFilter } from \"./types.js\";\n\nconst registry = new Map<string, MessageFilter>();\n\nexport function registerMessageFilter(filter: MessageFilter): void {\n    const existing = registry.get(filter.name);\n    if (existing && existing.version !== filter.version) {\n        throw new Error(\n            `Message filter \"${filter.name}\" already registered with version ${existing.version}, cannot register version ${filter.version}.`,\n        );\n    }\n    registry.set(filter.name, filter);\n}\n\nexport function getMessageFilter(name: string): MessageFilter | undefined {\n    return registry.get(name);\n}\n\nexport function listMessageFilters(): MessageFilter[] {\n    return [...registry.values()];\n}\n\nexport function clearMessageFilters(): void {\n    registry.clear();\n}\n","import { listMessageFilters } from \"./registry.js\";\nimport type { CoreMessage } from \"../types.js\";\nimport type { FilterResult, MessageFilterContext, MessageFiltersConfig } from \"./types.js\";\n\nexport interface ApplyResult {\n    messages: CoreMessage[];\n    partsFiltered: number;\n    partsDropped: number;\n    partsModified: number;\n}\n\nexport function applyMessageFilters(\n    messages: CoreMessage[],\n    config: MessageFiltersConfig | undefined,\n): ApplyResult {\n    if (!config?.enabled) {\n        return { messages, partsFiltered: 0, partsDropped: 0, partsModified: 0 };\n    }\n\n    const active = listMessageFilters().filter(\n        (filter) => config.filters?.[filter.name]?.enabled !== false,\n    );\n    if (active.length === 0) {\n        return { messages, partsFiltered: 0, partsDropped: 0, partsModified: 0 };\n    }\n\n    let working = messages.map((message) => ({ ...message }));\n    const tally = { partsFiltered: 0, partsDropped: 0, partsModified: 0 };\n    const total = working.length;\n\n    const immediate = active.filter((filter) => !filter.keepLastOnly);\n    for (let index = 0; index < working.length; index++) {\n        const message = working[index]!;\n        const text = message.text ?? \"\";\n        if (text.length === 0) continue;\n        let current = text;\n        const baseCtx: MessageFilterContext = {\n            text: current,\n            role: message.role,\n            messageIndex: index,\n            totalMessages: total,\n            toolName: message.toolName,\n        };\n        for (const filter of immediate) {\n            let decision: FilterResult;\n            try {\n                decision = filter.filter(baseCtx);\n            } catch {\n                continue;\n            }\n            if (decision.action === \"keep\") continue;\n            tally.partsFiltered++;\n            if (decision.action === \"drop\") {\n                current = \"\";\n                tally.partsDropped++;\n            } else if (decision.action === \"modify\" && decision.text !== undefined) {\n                current = decision.text;\n                tally.partsModified++;\n            }\n            baseCtx.text = current;\n        }\n        if (current !== text) working[index] = { ...message, text: current };\n    }\n\n    const keepLast = active.filter((filter) => filter.keepLastOnly);\n    for (const filter of keepLast) {\n        let foundLast = false;\n        for (let index = working.length - 1; index >= 0; index--) {\n            const message = working[index]!;\n            const text = message.text ?? \"\";\n            if (text.length === 0) continue;\n            const ctx: MessageFilterContext = {\n                text,\n                role: message.role,\n                messageIndex: index,\n                totalMessages: total,\n                toolName: message.toolName,\n            };\n            let decision: FilterResult;\n            try {\n                decision = filter.filter(ctx);\n            } catch {\n                continue;\n            }\n            if (decision.action !== \"drop\" && decision.action !== \"modify\") continue;\n            if (foundLast) {\n                tally.partsFiltered++;\n                tally.partsDropped++;\n                working[index] = { ...message, text: \"\" };\n            } else {\n                foundLast = true;\n                if (decision.action === \"modify\" && decision.text !== undefined) {\n                    tally.partsFiltered++;\n                    tally.partsModified++;\n                    working[index] = { ...message, text: decision.text };\n                }\n            }\n        }\n    }\n\n    return { messages: working, ...tally };\n}\n","import type { CoreMessage, CompressionState, MessageRefMap } from \"./types.js\";\nimport { refForRaw, BLOCKED_REF } from \"./refs.js\";\nimport type { PipelineNode, PipelineContext, NodeIO } from \"./pipeline.js\";\n\n/**\n * Controls which messages get an <acp> ref tag injected into their text.\n * Ref assignment (assignRefsNode) is unconditional — every message always\n * receives a ref in state.messageRefs regardless of this setting. This only\n * governs text rendering:\n *  - \"all\": tag every mapped message (in-process hosts like pai-acp)\n *  - \"text-only\": tag only user/assistant text; leave tool-call args and\n *    tool-result content pristine (proxy hosts — structured content must not\n *    be polluted)\n *  - \"none\": leave all text untouched (hosts that read the ref map directly)\n */\nexport type RenderStrategy = \"all\" | \"text-only\" | \"none\";\n\n/** Format token count: <1K raw, <10K \"X.YK\", >=10K \"XK\". */\nfunction formatTokens(tokens: number): string {\n  if (tokens < 1000) return String(tokens);\n  if (tokens < 10000) return (tokens / 1000).toFixed(1) + \"K\";\n  return Math.round(tokens / 1000) + \"K\";\n}\n\nfunction classifyType(message: CoreMessage): string {\n  if (\n    message.contentType === \"tool-call\" ||\n    message.contentType === \"tool-result\"\n  ) {\n    return message.toolName || \"tool\";\n  }\n  return message.contentType;\n}\n\nfunction escapeRegex(s: string): string {\n  return s.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\n\nconst LT = \"\\x3c\";\nconst GT = \"\\x3e\";\nconst TAG_OPEN = LT + \"acp \";\nconst TAG_CLOSE = LT + \"/acp\" + GT;\n\nfunction acpTag(ref: string, tokens: number, type: string): string {\n  return TAG_OPEN + 'tokens=\"' + formatTokens(tokens) + '\" type=\"' + type + '\"' + GT + ref + TAG_CLOSE;\n}\n\nfunction renderMessage(\n  message: CoreMessage,\n  map: MessageRefMap,\n  countTokens: (text: string) => number,\n  strategy: RenderStrategy,\n  snapshot: Record<string, number> | null = null,\n): CoreMessage {\n  const ref = refForRaw(map, message.id);\n  if (!ref || ref === BLOCKED_REF) return message;\n\n  // \"none\": host reads the ref map directly — never pollute text.\n  if (strategy === \"none\") return message;\n\n  // text-only: never tag structured tool content. Refs are still assigned.\n  if (strategy === \"text-only\" && message.contentType !== \"text\") {\n    return message;\n  }\n\n  // Strip own stale tag BEFORE computing tokens (idempotency).\n  // Match the message's own ref only — foreign tags survive (content-corruption fix).\n  const ownTagRe = new RegExp(\n    \"^\" + escapeRegex(TAG_OPEN) + \"[^>]*\" + GT + escapeRegex(ref) + escapeRegex(TAG_CLOSE) + \"\\\\n?\",\n  );\n  const cleanText = (message.text || \"\").replace(ownTagRe, \"\");\n\n  // Snapshot mode: token count is fixed at first render (stable prefix cache).\n  // Live mode (snapshot = null): recompute every render — legacy behavior.\n  const tokens = snapshot\n    ? (snapshot[ref] ?? (snapshot[ref] = countTokens(cleanText)))\n    : countTokens(cleanText);\n  const type = classifyType(message);\n  const prefix = acpTag(ref, tokens, type) + \"\\n\";\n\n  if (!cleanText) return { ...message, text: prefix };\n  return { ...message, text: prefix + cleanText };\n}\n\nexport function renderVisibleRefs(\n  messages: CoreMessage[],\n  state: CompressionState,\n  countTokens: (text: string) => number = (text) =>\n    Math.ceil(text.length / 4),\n  strategy: RenderStrategy = \"all\",\n): CoreMessage[] {\n  // Legacy behavior: recompute tokens every render (snapshot = null).\n  const map = state.messageRefs;\n  return messages.map((message) =>\n    renderMessage(message, map, countTokens, strategy),\n  );\n}\n\nexport interface RenderWithSnapshotResult {\n  messages: CoreMessage[];\n  tokenSnapshot: Record<string, number>;\n}\n\n/** Render with a stable token snapshot: token counts are written on first\n *  render and reused forever (keyed by ref). The snapshot starts as a shallow\n *  copy of the persisted state so old entries survive; new entries are added\n *  during this render. */\nexport function renderWithSnapshot(\n  messages: CoreMessage[],\n  state: CompressionState,\n  countTokens: (text: string) => number = (text) => Math.ceil(text.length / 4),\n  strategy: RenderStrategy = \"all\",\n): RenderWithSnapshotResult {\n  const map = state.messageRefs;\n  const snapshot = { ...(state.tokenSnapshot ?? {}) };\n  const rendered = messages.map((message) =>\n    renderMessage(message, map, countTokens, strategy, snapshot),\n  );\n  return { messages: rendered, tokenSnapshot: snapshot };\n}\n\n/** Factory: build a render-refs node bound to a specific render strategy. */\nexport function createRenderRefsNode(strategy: RenderStrategy): PipelineNode {\n  return {\n    name: \"render-refs\",\n    run(io: NodeIO, ctx: PipelineContext): NodeIO {\n      const { messages, tokenSnapshot } = renderWithSnapshot(\n        io.messages,\n        io.state,\n        ctx.countTokens,\n        strategy,\n      );\n      // Write the snapshot back only when it grew: steady-state (all hits)\n      // must not churn the state object and force an adapter save every turn.\n      const prev = io.state.tokenSnapshot;\n      const changed =\n        !prev || Object.keys(tokenSnapshot).length !== Object.keys(prev).length;\n      return changed\n        ? { ...io, messages, state: { ...io.state, tokenSnapshot } }\n        : { ...io, messages };\n    },\n  };\n}\n\n/** Backward compat: default render-refs node using strategy \"all\". */\nexport const renderRefsNode: PipelineNode = createRenderRefsNode(\"all\");\n","import type { Config, CoreMessage } from \"./types.js\";\n\n/** Tools that are ALWAYS protected, regardless of user config. These are ACP's\n *  own metadata tools whose records must remain in context: compress calls\n *  carry the summaries that decompress/search rely on, and the system prompt\n *  treats past compress calls as load-bearing metadata. Letting them be\n *  compressed away breaks decompress and the \"summary is historical\" contract. */\nexport const ALWAYS_PROTECTED_TOOLS = [\"compress\"] as const;\n\n/** Tool results that must NEVER participate in the soft-protected recent zone\n *  (preserveRecentMessages / preserveRecentTokens / last user message).\n *\n *  These tools return large content (restored blocks, search hits, file bodies,\n *  command output). If such a result lands in the last-N window it becomes\n *  un-compressible: the model cannot reclaim that context, and it never appears\n *  in the compressible-ranges recommendation list. Excluding these tools from\n *  the protected zone lets the model compress them again immediately, while\n *  still leaving them visible (the host's preserveRecent is about not\n *  compressing the active working set, not about which tool results are in\n *  scope).\n *\n *  - `decompress`: large restored content as an inline tool result.\n *  - `search_context`: large result lists (10 ranked hits with previews).\n *  - `read`: file/image contents — the largest common source of context bloat.\n *  - `bash`: command output (build/test/logs) — frequently large and spent.\n *\n *  Note: this only affects the recent-zone computation. Such messages remain\n *  fully visible and compressible like any ordinary message. */\nexport const NEVER_PRESERVE_RECENT_TOOLS = [\n  \"decompress\",\n  \"search_context\",\n  \"read\",\n  \"bash\",\n] as const;\n\n/** True for tool-call / tool-result messages whose toolName is in the\n *  NEVER_PRESERVE_RECENT_TOOLS list — i.e. tool results (like decompress)\n *  that should be excluded from the soft-protected recent zone. */\nexport function isNeverPreserveRecent(msg: CoreMessage): boolean {\n  if (msg.contentType !== \"tool-call\" && msg.contentType !== \"tool-result\") {\n    return false;\n  }\n  if (!msg.toolName) return false;\n  return (NEVER_PRESERVE_RECENT_TOOLS as readonly string[]).includes(msg.toolName);\n}\n\nexport function matchToolPattern(toolName: string, pattern: string): boolean {\n  if (pattern.endsWith(\"*\")) {\n    return toolName.startsWith(pattern.slice(0, -1));\n  }\n  return toolName === pattern;\n}\n\nexport function isMessageProtected(\n  msg: CoreMessage,\n  config: Pick<Config, \"protectedTools\" | \"isToolProtected\">,\n): boolean {\n  // tool-result carries the same toolName as its tool-call (the host projects\n  // it), so checking toolName covers both sides of a tool exchange.\n  if (\n    (msg.contentType !== \"tool-call\" && msg.contentType !== \"tool-result\") ||\n    !msg.toolName\n  ) {\n    return false;\n  }\n\n  // Hard-coded protection: ACP metadata tools are never compressible.\n  if ((ALWAYS_PROTECTED_TOOLS as readonly string[]).includes(msg.toolName)) {\n    return true;\n  }\n\n  for (const pattern of config.protectedTools) {\n    if (matchToolPattern(msg.toolName, pattern)) return true;\n  }\n\n  if (config.isToolProtected?.(msg.toolName, msg.text)) return true;\n\n  return false;\n}\n\n/** Build the set of toolCallIds whose tool-call is protected. Use this to also\n *  protect tool-results that lack a toolName (common when the host projects a\n *  tool-result with only toolCallId). Without it, the result half of a\n *  protected tool exchange leaks into compressible ranges. */\nexport function collectProtectedToolCallIds(\n  messages: CoreMessage[],\n  config: Pick<Config, \"protectedTools\" | \"isToolProtected\">,\n): Set<string> {\n  const ids = new Set<string>();\n  for (const m of messages) {\n    if (m.contentType === \"tool-call\" && m.toolCallId && isMessageProtected(m, config)) {\n      ids.add(m.toolCallId);\n    }\n  }\n  return ids;\n}\n\n/** Like isMessageProtected, but also matches tool-results by toolCallId against\n *  the protected call set. Use when you have the full message list available. */\nexport function isMessageProtectedWithPairing(\n  msg: CoreMessage,\n  config: Pick<Config, \"protectedTools\" | \"isToolProtected\">,\n  protectedCallIds: Set<string>,\n): boolean {\n  if (isMessageProtected(msg, config)) return true;\n  if (\n    msg.contentType === \"tool-result\" &&\n    msg.toolCallId &&\n    protectedCallIds.has(msg.toolCallId)\n  ) {\n    return true;\n  }\n  return false;\n}\n","import type { CoreMessage } from \"./types.js\";\n\n/**\n * Adjust compression range boundaries to include tool-call/result pairs.\n *\n * PREVENTIVE approach (adapted from opencode-acp PR #248): before compression\n * is applied, scan for tool-call or tool-result messages whose matching half\n * (the result for a call in range, or the call for a result in range) sits\n * outside the requested range. Pull the orphan half INTO the range so the\n * pair is compressed together — zero information loss.\n *\n * Only MESSAGE-boundary ranges are adjusted. Block-boundary ranges (bN) are\n * left untouched to preserve tier-detection correctness.\n *\n * @returns Adjusted { startIndex, endIndex } — may be wider than input.\n */\nexport function adjustBoundariesForToolPairs(\n    startIndex: number,\n    endIndex: number,\n    messages: CoreMessage[],\n    maxScan: number = 20,\n): { startIndex: number; endIndex: number } {\n    // Collect all toolCallIds in range (both tool-call and tool-result messages).\n    // Skip compress tool — it's force-protected and always survives pruning.\n    const callIdsInRange = new Set<string>();\n    for (let i = startIndex; i <= endIndex; i++) {\n        const msg = messages[i];\n        if (!msg || !msg.toolCallId) continue;\n        if (msg.toolName === \"compress\") continue;\n        callIdsInRange.add(msg.toolCallId);\n    }\n\n    if (callIdsInRange.size === 0) {\n        return { startIndex, endIndex };\n    }\n\n    // Extend FORWARD: tool-results typically follow their tool-call.\n    // Stop at the first gap after finding at least one matching message.\n    let newEndIndex = endIndex;\n    for (let i = endIndex + 1; i < messages.length && i <= endIndex + maxScan; i++) {\n        const msg = messages[i];\n        if (!msg) break;\n        if (msg.toolCallId && callIdsInRange.has(msg.toolCallId)) {\n            newEndIndex = i;\n        } else if (newEndIndex > endIndex) {\n            break;\n        }\n    }\n\n    // Extend BACKWARD: tool-calls typically precede their tool-result.\n    let newStartIndex = startIndex;\n    for (let i = startIndex - 1; i >= 0 && i >= startIndex - maxScan; i--) {\n        const msg = messages[i];\n        if (!msg) break;\n        if (msg.toolCallId && callIdsInRange.has(msg.toolCallId)) {\n            newStartIndex = i;\n        } else if (newStartIndex < startIndex) {\n            break;\n        }\n    }\n\n    return { startIndex: newStartIndex, endIndex: newEndIndex };\n}\n","import type { CoreMessage } from \"./types.js\";\n\n/**\n * Adjust compression range boundaries to keep a `reasoning` message together\n * with the assistant text/tool-call it belongs to.\n *\n * Reasoning models (DeepSeek-R1, GLM-4.6 thinking, Qwen-QwQ, Anthropic\n * thinking) emit a `reasoning_content` / thinking block that strict providers\n * require to be echoed back alongside the response on every subsequent\n * request. In acp-kernel that block is a separate `contentType: \"reasoning\"`\n * message immediately preceding the assistant text/tool-call of the same turn.\n * If a compression range covers only one half of the pair, the rebuilt\n * conversation ships reasoning without its response (or vice versa) and the\n * provider returns HTTP 400 (DeepSeek: \"reasoning_content in the thinking mode\n * must be passed back to the API\").\n *\n * This is the reasoning analogue of {@link adjustBoundariesForToolPairs}:\n * before a range is applied, pull the orphan half INTO the range so the pair\n * compresses together — zero information loss. Only MESSAGE-boundary ranges\n * are adjusted (block-boundary ranges are left untouched, like tool pairs).\n *\n * Pairing is adjacency-based — there is no shared id (unlike toolCallId). A\n * `reasoning` message pairs with the assistant text/tool-call immediately\n * following its reasoning run, and an assistant text/tool-call pairs with the\n * reasoning run immediately preceding it. This matches the round-trip contract\n * every adapter relies on when reconstructing reasoning_content.\n *\n * @returns Adjusted { startIndex, endIndex } — may be wider than input.\n */\nexport function adjustBoundariesForReasoningPairs(\n  startIndex: number,\n  endIndex: number,\n  messages: CoreMessage[],\n): { startIndex: number; endIndex: number } {\n  if (startIndex > endIndex) {\n    return { startIndex, endIndex };\n  }\n  let newStartIndex = startIndex;\n  let newEndIndex = endIndex;\n\n  for (let i = startIndex; i <= endIndex && i < messages.length; i++) {\n    const msg = messages[i];\n    if (!msg) continue;\n\n    if (msg.contentType === \"reasoning\") {\n      // Forward: pull the companion assistant text/tool-call that follows\n      // this reasoning run into the range.\n      let j = i;\n      while (\n        j + 1 < messages.length &&\n        messages[j + 1]!.contentType === \"reasoning\"\n      ) {\n        j++;\n      }\n      const companion = messages[j + 1];\n      if (\n        companion !== undefined &&\n        companion.role === \"assistant\" &&\n        (companion.contentType === \"text\" ||\n          companion.contentType === \"tool-call\") &&\n        j + 1 > newEndIndex\n      ) {\n        newEndIndex = j + 1;\n      }\n    }\n\n    if (\n      msg.role === \"assistant\" &&\n      (msg.contentType === \"text\" || msg.contentType === \"tool-call\")\n    ) {\n      // Backward: pull the reasoning run immediately preceding this assistant\n      // message into the range.\n      let k = i - 1;\n      while (k >= 0 && messages[k]!.contentType === \"reasoning\") {\n        k--;\n      }\n      const runStart = k + 1;\n      if (\n        runStart < i &&\n        runStart >= 0 &&\n        messages[runStart]!.contentType === \"reasoning\" &&\n        runStart < newStartIndex\n      ) {\n        newStartIndex = runStart;\n      }\n    }\n  }\n\n  return { startIndex: newStartIndex, endIndex: newEndIndex };\n}\n","/**\n * Recommendation engine — compression protection + recommendation.\n *\n * Clean-room reimplementation of the recommendation algorithm (MIT, ours).\n * These pure functions answer two questions every turn:\n *\n *  1. **Protection** — which messages must NOT be compressed? (protected tools,\n *     recent messages, recent tokens)\n *  2. **Recommendation** — which remaining ranges are actually WORTH compressing?\n *     (growth-aware threshold; suppress nudges when ranges are too small)\n *\n * Called by the `recommend` pipeline node. No side effects, no state mutation.\n */\n\nimport type {\n  CompressibleRange,\n  Config,\n  ContextRanges,\n  CoreMessage,\n  ProtectedRange,\n} from \"./types.js\";\nimport type { CompressionState } from \"./types.js\";\nimport {\n  collectProtectedToolCallIds,\n  isMessageProtectedWithPairing,\n  isNeverPreserveRecent,\n} from \"./protected.js\";\n\n// ─── Helpers ──────────────────────────────────────────────────────────────────\n\nfunction refNum(ref: string): number {\n  const n = parseInt(ref.slice(1), 10);\n  return Number.isNaN(n) ? -1 : n;\n}\n\n/** Default token estimate (chars/4) used when the caller doesn't inject a\n *  countTokens — preserves the historical behavior for backwards compat. */\nfunction estimateTextTokens(text: string): number {\n  return Math.ceil(text.length / 4);\n}\n\nfunction isToolMessage(message: CoreMessage): boolean {\n  return message.contentType === \"tool-call\" || message.contentType === \"tool-result\";\n}\n\n\nfunction isSyntheticOrPruned(\n  message: CoreMessage,\n  state: CompressionState,\n): boolean {\n  if (message.text?.startsWith(\"[Compressed conversation section]\")) return true;\n  for (const block of state.blocks) {\n    if (block.active && block.effectiveMessageIds.includes(message.id)) return true;\n  }\n  return false;\n}\n\n// ─── 1. Protected Refs (soft protection zone) ─────────────────────────────────\n\n/**\n * Compute the set of protected message refs (mNNNNN) that form the\n * \"soft-protected zone\" at the tail of the conversation.\n *\n * Combines two rules:\n *   1. Last N messages (`config.preserveRecentMessages`)\n *   2. Last N tokens expanding backward (`config.preserveRecentTokens`)\n *\n * Only considers visible, non-synthetic, non-pruned messages that have refs.\n */\nexport function computeProtectedRefs(\n  messages: CoreMessage[],\n  state: CompressionState,\n  config: Config,\n  countTokens: (text: string) => number = estimateTextTokens,\n): Set<string> {\n  const preserveN = config.preserveRecentMessages;\n  const preserveTokens = config.preserveRecentTokens;\n\n  const result = new Set<string>();\n  const visible: { ref: string; tokens: number }[] = [];\n\n  for (const msg of messages) {\n    if (isSyntheticOrPruned(msg, state)) continue;\n    // Exclude decompress-style tool results from the recent-zone window.\n    // These are large inline restorations that the model should be free to\n    // compress again immediately; counting them toward the last-N window\n    // would make them un-compressible and hide them from recommendations.\n    // The message stays fully visible — this only affects protection scope.\n    if (isNeverPreserveRecent(msg)) continue;\n    const ref = state.messageRefs.byRaw[msg.id];\n    if (!ref || ref === \"BLOCKED\") continue;\n    visible.push({ ref, tokens: countTokens(msg.text ?? \"\") });\n  }\n\n  // Rule 1: last N messages\n  if (preserveN > 0) {\n    for (const m of visible.slice(-preserveN)) {\n      result.add(m.ref);\n    }\n  }\n\n  // Rule 2: last N tokens (expand backward from tail)\n  if (preserveTokens > 0) {\n    let tokenAccum = 0;\n    for (let i = visible.length - 1; i >= 0 && tokenAccum < preserveTokens; i--) {\n      result.add(visible[i]!.ref);\n      tokenAccum += visible[i]!.tokens;\n    }\n  }\n\n  // Rule 3: last visible user message. Protected whenever recent-message\n  // protection is on (preserveRecentMessages > 0) — this couples it to the\n  // same switch as Rule 1, so setting preserveRecentMessages = 0 fully opts\n  // out (needed by tests that compress the tail). Production defaultConfig\n  // uses 5, so the last user message is always protected in practice.\n  // Note: we scan the raw messages array (not `visible`) here so the last\n  // user message is still found even when a decompress tool result was\n  // skipped above — user intent is always protected regardless of recent\n  // tool results.\n  if (preserveN > 0) {\n    for (let i = messages.length - 1; i >= 0; i--) {\n      const msg = messages[i]!;\n      if (msg.role !== \"user\" || isSyntheticOrPruned(msg, state)) continue;\n      const ref = state.messageRefs.byRaw[msg.id];\n      if (ref && ref !== \"BLOCKED\") result.add(ref);\n      break;\n    }\n  }\n\n  return result;\n}\n\n// ─── 2. Build Compressible + Protected Ranges ────────────────────────────────\n\n/**\n * Build compressible and protected range groups from the message list.\n *\n * Messages are classified into:\n *   - **compressible**: normal messages outside the protected zone\n *   - **protected**: messages from protected tools (e.g., skill, task)\n *   - **skipped**: covered by blocks, synthetic, or in the protected zone\n *\n * Compressible messages are grouped into contiguous ranges. The protected\n * zone (from `computeProtectedRefs`) splits groups — the unprotected head\n * survives as its own range.\n */\nexport function buildCompressibleRanges(\n  messages: CoreMessage[],\n  state: CompressionState,\n  config: Config,\n  protectedZoneRefs?: Set<string>,\n  countTokens: (text: string) => number = estimateTextTokens,\n): ContextRanges {\n  const compressibleMsgs: {\n    ref: string;\n    refNum: number;\n    tokens: number;\n    chars: number;\n    isTool: boolean;\n    isUser: boolean;\n  }[] = [];\n  const protectedMsgs: {\n    ref: string;\n    refNum: number;\n    tokens: number;\n    tools: string[];\n  }[] = [];\n\n  // Pairing: a tool-result may carry only toolCallId (no toolName). Collect the\n  // callIds of protected tool-calls first, then protect matching results too.\n  const protectedCallIds = collectProtectedToolCallIds(messages, config);\n\n  for (const msg of messages) {\n    if (isSyntheticOrPruned(msg, state)) continue;\n    const ref = state.messageRefs.byRaw[msg.id];\n    if (!ref || ref === \"BLOCKED\") continue;\n\n    const rn = refNum(ref);\n\n    if (isMessageProtectedWithPairing(msg, config, protectedCallIds)) {\n      protectedMsgs.push({\n        ref,\n        refNum: rn,\n        tokens: countTokens(msg.text ?? \"\"),\n        tools: msg.toolName ? [msg.toolName] : [],\n      });\n      continue;\n    }\n\n    if (protectedZoneRefs?.has(ref)) {\n      continue;\n    }\n\n    compressibleMsgs.push({\n      ref,\n      refNum: rn,\n      tokens: countTokens(msg.text ?? \"\"),\n      chars: (msg.text ?? \"\").length,\n      isTool: isToolMessage(msg),\n      isUser: msg.role === \"user\",\n    });\n  }\n\n  // Build compressible groups (contiguous, split at ref gaps and at user\n  // messages once a group has >= 3 messages). Splitting at user boundaries\n  // keeps each compressible range aligned to roughly one user turn, instead\n  // of producing one giant range spanning many turns (or, conversely, a\n  // fragment per message when ref gaps appear). Mirrors opencode-acp's\n  // buildCompressibleRanges condition.\n  const compressible: CompressibleRange[] = [];\n  let cur: CompressibleRange | null = null;\n  let prevRefNum = -2;\n\n  for (const info of compressibleMsgs) {\n    const hasGap = info.refNum > prevRefNum + 1;\n    if (cur && ((info.isUser && cur.count >= 3) || hasGap)) {\n      compressible.push(cur);\n      cur = null;\n    }\n    prevRefNum = info.refNum;\n    if (!cur) {\n      cur = {\n        startRef: info.ref,\n        endRef: info.ref,\n        count: 1,\n        tokens: info.tokens,\n        chars: info.chars,\n        toolPct: info.isTool ? 100 : 0,\n        textPct: info.isTool ? 0 : 100,\n      };\n    } else {\n      cur.endRef = info.ref;\n      cur.count++;\n      cur.tokens += info.tokens;\n      cur.chars = (cur.chars ?? 0) + info.chars;\n      if (info.isTool) {\n        cur.toolPct = Math.round((cur.toolPct * (cur.count - 1) + 100) / cur.count);\n      } else {\n        cur.toolPct = Math.round((cur.toolPct * (cur.count - 1)) / cur.count);\n      }\n      cur.textPct = 100 - cur.toolPct;\n    }\n  }\n  if (cur) compressible.push(cur);\n\n  // Build protected groups (contiguous)\n  const protectedRanges: ProtectedRange[] = [];\n  let pcur: ProtectedRange | null = null;\n  let pPrevRefNum = -2;\n\n  for (const info of protectedMsgs) {\n    const hasGap = info.refNum > pPrevRefNum + 1;\n    if (pcur && hasGap) {\n      protectedRanges.push(pcur);\n      pcur = null;\n    }\n    pPrevRefNum = info.refNum;\n    if (!pcur) {\n      pcur = {\n        startRef: info.ref,\n        endRef: info.ref,\n        count: 1,\n        tokens: info.tokens,\n        tools: [...info.tools],\n      };\n    } else {\n      pcur.endRef = info.ref;\n      pcur.count++;\n      pcur.tokens += info.tokens;\n      for (const t of info.tools) {\n        if (!pcur!.tools.includes(t)) pcur!.tools.push(t);\n      }\n    }\n  }\n  if (pcur) protectedRanges.push(pcur);\n\n  return {\n    compressible: compressible.filter((g) => g.tokens > 0),\n    protected: protectedRanges,\n  };\n}\n\nfunction mergeBatch(batch: CompressibleRange[]): CompressibleRange {\n  const first = batch[0]!;\n  const last = batch[batch.length - 1]!;\n  const count = batch.reduce((s, r) => s + r.count, 0);\n  const tokens = batch.reduce((s, r) => s + r.tokens, 0);\n  const chars = batch.reduce((s, r) => s + rangeChars(r), 0);\n  const toolPct = Math.round(\n    batch.reduce((s, r) => s + r.toolPct * r.count, 0) / count,\n  );\n  const merged: CompressibleRange = {\n    startRef: first.startRef,\n    endRef: last.endRef,\n    count,\n    tokens,\n    chars,\n    toolPct,\n    textPct: 100 - toolPct,\n  };\n  if (batch.some((r) => r.dangerous === true)) {\n    merged.dangerous = true;\n  }\n  return merged;\n}\n\n/** Effective size of a range in characters — the unit the apply-side\n *  minCompressRange gate uses. Falls back to the historical tokens*4\n *  estimate only for hand-built ranges that predate the `chars` field. */\nfunction rangeChars(r: CompressibleRange): number {\n  return r.chars ?? r.tokens * 4;\n}\n\n/** Merge adjacent ranges into batches that clear `minChars` of REAL text —\n *  the same accounting `applyCompression` uses — so a recommended range is\n *  never below the threshold the kernel would atomically reject. Batching by\n *  token estimates (tokens*4) instead broke whenever the host injected a\n *  tokenizer where tokens != chars/4 (CJK-aware estimators are ~1:1, so\n *  tokens*4 overestimated size ~4x and nudge recommended ranges the apply\n *  side then refused). A sub-threshold tail batch is still emitted — callers\n *  filter by effectiveness separately (see pendingByTier). */\nexport function mergeRangesToThreshold(\n  ranges: CompressibleRange[],\n  minChars: number,\n): CompressibleRange[] {\n  if (minChars <= 0 || ranges.length === 0) return ranges;\n  const result: CompressibleRange[] = [];\n  let batch: CompressibleRange[] = [];\n  let batchChars = 0;\n  for (const r of ranges) {\n    batch.push(r);\n    batchChars += rangeChars(r);\n    if (batchChars >= minChars) {\n      result.push(mergeBatch(batch));\n      batch = [];\n      batchChars = 0;\n    }\n  }\n  if (batch.length > 0) {\n    result.push(mergeBatch(batch));\n  }\n  return result;\n}\n","import type { CompressionState, CoreMessage, NudgeDecision } from \"./types.js\";\n\nexport interface PipelineContext {\n  readonly config: import(\"./types.js\").Config;\n  readonly tokenCount: number;\n  readonly countTokens: (text: string) => number;\n}\n\nexport interface NodeEffects {\n  nudge?: NudgeDecision;\n  recommendation?: import(\"./types.js\").Recommendation;\n  truncatedCount?: number;\n  readonly [key: string]: unknown;\n}\n\nexport interface NodeIO {\n  messages: CoreMessage[];\n  state: CompressionState;\n  effects: NodeEffects;\n}\n\nexport interface PipelineNode {\n  readonly name: string;\n  run(io: NodeIO, ctx: PipelineContext): NodeIO;\n  enabled?: (io: NodeIO, ctx: PipelineContext) => boolean;\n}\n\nexport function makeIO(\n  messages: CoreMessage[],\n  state: CompressionState,\n  effects: NodeEffects = {},\n): NodeIO {\n  return { messages, state, effects };\n}\n\nexport function runPipeline(\n  nodes: readonly PipelineNode[],\n  initial: NodeIO,\n  ctx: PipelineContext,\n): NodeIO {\n  let io = initial;\n  for (const node of nodes) {\n    if (node.enabled && !node.enabled(io, ctx)) continue;\n    io = node.run(io, ctx);\n  }\n  return io;\n}\n","import { assignRefs, highestUsedIndex } from \"./refs.js\";\nimport { prune, isSummaryMessageId } from \"./prune.js\";\nimport { syncBlocks } from \"./sync.js\";\nimport { advanceSurvival, activeBlocks, blockById } from \"./state.js\";\nimport { allocateBlockId, allocateRunId, createInitialState } from \"./state.js\";\nimport { defaultCountTokens } from \"./tokenize.js\";\nimport { validateConfig } from \"./config.js\";\nimport {\n  BoundaryNotFoundError,\n  resolveBoundaries,\n  visibleBlockAnchor,\n} from \"./boundaries.js\";\nimport type { ResolvedRange } from \"./boundaries.js\";\nimport { truncateLargeToolOutputs } from \"./truncate-tools.js\";\nimport { hideConsumedCompressCalls } from \"./hide-consumed.js\";\nimport { applyMessageFilters, listMessageFilters } from \"./filter/index.js\";\nimport { createRenderRefsNode } from \"./render-refs.js\";\nimport type { RenderStrategy } from \"./render-refs.js\";\nimport { isMessageProtected } from \"./protected.js\";\nimport { adjustBoundariesForToolPairs } from \"./tool-pairs.js\";\nimport { adjustBoundariesForReasoningPairs } from \"./reasoning-pairs.js\";\nimport {\n  computeProtectedRefs,\n  buildCompressibleRanges,\n  mergeRangesToThreshold,\n} from \"./recommend.js\";\nimport {\n  runPipeline,\n  type PipelineContext,\n  type PipelineNode,\n  type NodeIO,\n} from \"./pipeline.js\";\nimport type {\n  ApplyCompressionResult,\n  CompressionBlock,\n  CompressionState,\n  CompressionTier,\n  Config,\n  ContextBreakdown,\n  CoreMessage,\n  NudgeConfig,\n  NudgeDecision,\n  ProcessTurnResult,\n  Recommendation,\n  StatusReport,\n} from \"./types.js\";\n\nexport interface Ports {\n  countTokens?: (text: string) => number;\n}\n\nexport interface CompressionCore {\n  processTurn(input: ProcessTurnInput): ProcessTurnResult;\n  applyCompression(input: ApplyCompressionInput): ApplyCompressionResult;\n  defaultNodes(): PipelineNode[];\n  decompress(\n    blockId: string,\n    state: CompressionState,\n  ): CompressionBlock | undefined;\n  search(query: string, state: CompressionState): CompressionBlock[];\n  status(\n    state: CompressionState,\n    tokenCount: number,\n    config: Config,\n  ): StatusReport;\n}\n\nexport interface ProcessTurnInput {\n  messages: CoreMessage[];\n  state: CompressionState;\n  config: Config;\n  tokenCount: number;\n  /**\n   * Which messages get an <acp> ref tag injected into their text\n   * (the render-refs pipeline node). Refs are ALWAYS assigned regardless\n   * (assign-refs node runs unconditionally).\n   *   - \"all\" (default): tag every mapped message — in-process hosts\n   *     like pai-acp want tags for the LLM to reference compress ranges.\n   *   - \"text-only\": tag only user/assistant text; leave tool-call args\n   *     and tool-result content pristine — proxy hosts where structured\n   *     content must not be polluted.\n   *   - \"none\": leave all text untouched — hosts that read the ref map\n   *     directly from result.state.messageRefs.\n   */\n  renderTags?: RenderStrategy;\n}\n\nexport interface ApplyCompressionInput {\n  ranges: {\n    startRef: string;\n    endRef: string;\n    summary: string;\n    topic?: string;\n    compressCallId?: string;\n    summaryMaxChars?: number;\n  }[];\n  messages: CoreMessage[];\n  state: CompressionState;\n  config: Config;\n  protectedMessageIds?: Set<string>;\n}\n\n/**\n * Per-range classification from a single resolveBoundaries pass. \"ok\" ranges\n * go on to applySingleRange (which re-resolves internally for tool-pair\n * adjustment); \"consumed\" means the refs existed but their messages were\n * hidden by an existing block; \"unknown\" means a ref never existed in this\n * session; \"invalid\" means a ref failed to parse (e.g. \"foo\").\n */\ntype RangeResolution =\n  | { status: \"ok\"; resolved: ResolvedRange }\n  | { status: \"consumed\"; error: BoundaryNotFoundError }\n  | { status: \"unknown\"; error: BoundaryNotFoundError }\n  | { status: \"invalid\"; error: Error };\n\nfunction rangeError(\n  spec: { startRef: string; endRef: string },\n  message: string,\n): string {\n  return `range ${spec.startRef}..${spec.endRef}: ${message}`;\n}\n\nfunction numericBlockId(id: string): number {\n  const parsed = /^b(\\d+)$/.exec(id);\n  return parsed ? Number(parsed[1]) : 0;\n}\n\nexport function createCore(ports: Ports = {}): CompressionCore {\n  const countTokens = ports.countTokens ?? defaultCountTokens;\n\n  function applyCompression(\n    input: ApplyCompressionInput,\n  ): ApplyCompressionResult {\n    const state: CompressionState = cloneState(input.state);\n    const runId = allocateRunId(state);\n    let blocksCreated = 0;\n    let tokensCompressed = 0;\n    const errors: string[] = [];\n    const warnings: string[] = [];\n\n    // Default to the soft-protected zone (recent-N + last user message) when the\n    // caller doesn't pass an explicit set. This makes applyCompression safe by\n    // default; applySingleRange enforces it as a hard backstop.\n    const protectedMessageIds =\n      input.protectedMessageIds ??\n      computeProtectedRefs(\n        input.messages,\n        input.state,\n        input.config,\n        countTokens,\n      );\n\n    const preExistingCoverage = collectCoverage(state);\n\n    // Classify every requested range ONCE. The result feeds overlap\n    // skipSpecs, the minCompressRange pre-check, and the per-range loop —\n    // previously each re-resolved and silently swallowed failures, so\n    // consumed/unknown ranges produced misleading \"too small\" errors.\n    const classifications = new Map<\n      (typeof input.ranges)[number],\n      RangeResolution\n    >();\n    const classificationErrors: string[] = [];\n    const consumedRanges: typeof input.ranges = [];\n    for (const spec of input.ranges) {\n      try {\n        const resolved = resolveBoundaries({\n          startRef: spec.startRef,\n          endRef: spec.endRef,\n          messages: input.messages,\n          state,\n        });\n        classifications.set(spec, { status: \"ok\", resolved });\n      } catch (error) {\n        if (error instanceof BoundaryNotFoundError) {\n          classifications.set(\n            spec,\n            error.kind === \"unknown\"\n              ? { status: \"unknown\", error }\n              : { status: \"consumed\", error },\n          );\n          if (error.kind === \"consumed\") {\n            consumedRanges.push(spec);\n          } else {\n            classificationErrors.push(rangeError(spec, error.message));\n          }\n        } else {\n          classifications.set(spec, {\n            status: \"invalid\",\n            error: error instanceof Error ? error : new Error(String(error)),\n          });\n          classificationErrors.push(\n            rangeError(\n              spec,\n              error instanceof Error ? error.message : String(error),\n            ),\n          );\n        }\n      }\n    }\n\n    let resolvableCount = 0;\n    let unknownCount = 0;\n    for (const resolution of classifications.values()) {\n      if (resolution.status === \"ok\") resolvableCount++;\n      else if (resolution.status === \"unknown\") unknownCount++;\n    }\n\n    // Overlap detection uses resolved boundary indices, not messageIds: a\n    // summary-only range (block refs over a pruned view) has empty\n    // messageIds after synthetic-id filtering but still occupies its\n    // [startIndex, endIndex] span.\n    const rangeSpans: {\n      spec: (typeof input.ranges)[number];\n      start: number;\n      end: number;\n    }[] = [];\n    for (const [spec, resolution] of classifications) {\n      if (resolution.status !== \"ok\") continue;\n      rangeSpans.push({\n        spec,\n        start: resolution.resolved.startIndex,\n        end: resolution.resolved.endIndex,\n      });\n    }\n    const sortedRanges = [...rangeSpans].sort((a, b) => a.start - b.start);\n    // Overlapping ranges warn+skip (earliest wins) rather than aborting the\n    // whole batch — see ISSUE-42 / dog/billion-context-pi#21.\n    const skipSpecs = new Set<(typeof input.ranges)[number]>();\n    let acceptedMaxIndex = -1;\n    for (const entry of sortedRanges) {\n      if (entry.start <= acceptedMaxIndex) {\n        skipSpecs.add(entry.spec);\n        warnings.push(\n          `Skipped range (${entry.spec.startRef}..${entry.spec.endRef}) — overlaps an earlier range in the batch; the earlier range takes precedence. Keep ranges disjoint.`,\n        );\n        continue;\n      }\n      if (entry.end > acceptedMaxIndex) acceptedMaxIndex = entry.end;\n    }\n\n    if (input.config.compress.minCompressRange > 0 && input.ranges.length > 0) {\n      let totalRangeChars = 0;\n      let hasBlockBoundaryRange = false;\n      let countedRanges = 0;\n      for (const [spec, resolution] of classifications) {\n        if (resolution.status !== \"ok\" || skipSpecs.has(spec)) continue;\n        if (resolution.resolved.boundaryKind === \"block\") {\n          hasBlockBoundaryRange = true;\n          continue;\n        }\n        countedRanges++;\n        for (const id of resolution.resolved.messageIds) {\n          const msg = input.messages.find((m) => m.id === id);\n          totalRangeChars += msg?.text?.length ?? 0;\n        }\n      }\n      if (\n        !hasBlockBoundaryRange &&\n        totalRangeChars < input.config.compress.minCompressRange\n      ) {\n        const live = activeBlocks(state)\n          .map((b) => b.blockId)\n          .sort((x, y) => numericBlockId(x) - numericBlockId(y));\n        const liveHint =\n          live.length > 0\n            ? ` Current active blocks span ${live[0]}..${live[live.length - 1]} — retry with startId/endId set to active block IDs in that span.`\n            : \"\";\n        const gateMessage =\n          resolvableCount === 0 &&\n          consumedRanges.length === 0 &&\n          unknownCount > 0\n            ? `None of the ${input.ranges.length} requested range(s) resolved — every ref failed with \"does not exist in this session\". Refs recorded before an earlier compress are stale: each successful compress renumbers the remaining refs. Run acp_status, then re-issue the compress in the same turn using only the refs it reports.`\n            : consumedRanges.length > 0\n              ? `Requested range(s) already compressed (e.g. ${consumedRanges[0]!.startRef}..${consumedRanges[0]!.endRef}); remaining compressible content ${totalRangeChars} chars < min ${input.config.compress.minCompressRange}. Nothing to do.${liveHint}`\n              : `Total compressible content too small (${totalRangeChars} chars across ${countedRanges} range(s), min ${input.config.compress.minCompressRange}). Combine more messages into your range(s) to meet the threshold.`;\n        return {\n          state: input.state,\n          result: {\n            blocksCreated: 0,\n            tokensCompressed: 0,\n            errors: [gateMessage, ...classificationErrors],\n            warnings: [],\n          },\n        };\n      }\n    }\n\n    for (const spec of input.ranges) {\n      if (skipSpecs.has(spec)) continue;\n      const resolution = classifications.get(spec);\n      if (resolution === undefined) continue;\n      if (resolution.status === \"consumed\") {\n        warnings.push(\n          `Skipped range (${spec.startRef}..${spec.endRef}) — already compressed (messages consumed by existing block(s)); nothing to compress.`,\n        );\n        continue;\n      }\n      if (resolution.status === \"unknown\" || resolution.status === \"invalid\") {\n        errors.push(rangeError(spec, resolution.error.message));\n        continue;\n      }\n      warnings.push(...resolution.resolved.snappedBoundaries);\n      try {\n        const outcome = applySingleRange({\n          spec,\n          messages: input.messages,\n          state,\n          runId,\n          config: input.config,\n          protectedMessageIds,\n          countTokens,\n          preExistingCoverage,\n        });\n        blocksCreated++;\n        tokensCompressed += outcome.tokens;\n        warnings.push(...outcome.warnings);\n      } catch (error) {\n        errors.push(\n          rangeError(\n            spec,\n            error instanceof Error ? error.message : String(error),\n          ),\n        );\n      }\n    }\n\n    state.stats.compressionCount += blocksCreated;\n    state.stats.tokensCompressed += tokensCompressed;\n\n    if (blocksCreated > 0) {\n      // Compress succeeded: clear the growth baseline so the next turn\n      // re-establishes it at the new (lower) token count. Without this the\n      // nudge re-fires in a feedback loop (the §5.7 baseline-reset bug).\n      state.nudge.lastPerMessageNudgeTokens = 0;\n      state.nudge.lastNudgeShownTokens = 0;\n      // Clearing the per-tier cadence too: after a successful compression\n      // (which may have consumed blocks of tier N to produce tier N+1), every\n      // tier should be eligible to re-evaluate from the new token count.\n      state.nudge.lastShownByTier = {};\n    }\n\n    return {\n      state,\n      result: { blocksCreated, tokensCompressed, errors, warnings },\n    };\n  }\n\n  function processTurn(input: ProcessTurnInput): ProcessTurnResult {\n    const configErrors = validateConfig(input.config);\n    if (configErrors.length > 0) {\n      console.warn(\n        `[acp-kernel] Config validation warnings: ${configErrors.join(\"; \")}. Thresholds may not fire correctly.`,\n      );\n    }\n    const ctx: PipelineContext = {\n      config: input.config,\n      tokenCount: input.tokenCount,\n      countTokens,\n    };\n    const initial: NodeIO = {\n      messages: input.messages,\n      state: input.state,\n      effects: {},\n    };\n    // Conversion (assign-refs) and rendering (render-refs) are separate\n    // concerns. Refs are always assigned; renderTags only controls which\n    // message texts receive an <acp> tag.\n    const strategy: RenderStrategy = input.renderTags ?? \"all\";\n    const nodes = buildNodes(strategy);\n    const result = runPipeline(nodes, initial, ctx);\n    return {\n      messages: result.messages,\n      state: result.state,\n      nudge: result.effects.nudge,\n    };\n  }\n\n  function decompress(blockId: string, state: CompressionState) {\n    return blockById(state, blockId);\n  }\n\n  function search(query: string, state: CompressionState): CompressionBlock[] {\n    const terms = query\n      .toLowerCase()\n      .split(/\\s+/)\n      .filter((term) => term.length > 0);\n    if (terms.length === 0) return [];\n    const scored = activeBlocks(state)\n      .map((block) => ({ block, score: scoreRelevance(block, terms) }))\n      .filter((entry) => entry.score > 0.1)\n      .sort((left, right) => right.score - left.score);\n    return scored.map((entry) => entry.block);\n  }\n\n  function status(\n    state: CompressionState,\n    tokenCount: number,\n    config: Config,\n  ): StatusReport {\n    const active = activeBlocks(state);\n    const usage =\n      config.modelContextLimit > 0 ? tokenCount / config.modelContextLimit : 0;\n    return {\n      contextUsage: usage,\n      tokenCount,\n      modelContextLimit: config.modelContextLimit,\n      activeBlocks: active.length,\n      totalBlocks: state.blocks.length,\n      tokensCompressed: state.stats.tokensCompressed,\n      breakdown: { active: active.length, total: state.blocks.length },\n    };\n  }\n\n  function defaultNodes(): PipelineNode[] {\n    return buildNodes(\"all\");\n  }\n\n  /** Build the pipeline node list for a given render strategy. \"none\" omits\n   *  the render-refs node entirely; \"all\"/\"text-only\" append a render-refs\n   *  node bound to that strategy. */\n  function buildNodes(strategy: RenderStrategy): PipelineNode[] {\n    const base: PipelineNode[] = [\n      assignRefsNode,\n      syncBlocksNode,\n      pruneNode,\n      filterNode,\n      hideCompressCallsNode,\n      recommendNode,\n      nudgeNode,\n      emergencyTruncateNode,\n    ];\n    if (strategy === \"none\") return base;\n    return [...base, createRenderRefsNode(strategy)];\n  }\n\n  return {\n    processTurn,\n    applyCompression,\n    defaultNodes,\n    decompress,\n    search,\n    status,\n  };\n}\n\n// --- Pipeline nodes -------------------------------------------------------\n// Each node owns ONE concern. The ref map has a SINGLE writer (assignRefsNode);\n// tags are DERIVED at the end (renderRefsNode) — no dual source of truth, so\n// the old stripHallucinations band-aid is gone. Truncation is the LAST\n// token-reducing safety valve; render-refs is the final annotation pass.\n\nconst assignRefsNode: PipelineNode = {\n  name: \"assign-refs\",\n  run(io, ctx) {\n    const hasProtection =\n      ctx.config.protectedTools.length > 0 || !!ctx.config.isToolProtected;\n    const protectedFn = hasProtection\n      ? (m: CoreMessage) => isMessageProtected(m, ctx.config)\n      : undefined;\n    const refResult = assignRefs(io.messages, {\n      existing: io.state.messageRefs,\n      nextIndex: highestUsedIndex(io.state.messageRefs) + 1,\n      isProtected: protectedFn,\n    });\n    return { ...io, state: { ...io.state, messageRefs: refResult.map } };\n  },\n};\n\nconst syncBlocksNode: PipelineNode = {\n  name: \"sync-blocks\",\n  run(io, ctx) {\n    const synced = syncBlocks(io.messages, io.state);\n    advanceSurvival(synced.state, ctx.config.promotionThreshold);\n    return { ...io, state: synced.state };\n  },\n};\n\nconst pruneNode: PipelineNode = {\n  name: \"prune\",\n  run(io) {\n    return { ...io, messages: prune(io.messages, io.state) };\n  },\n};\n\nconst filterNode: PipelineNode = {\n  name: \"filter\",\n  enabled: (_io, ctx) =>\n    !!ctx.config.messageFilters?.enabled && listMessageFilters().length > 0,\n  run(io, ctx) {\n    const applied = applyMessageFilters(io.messages, ctx.config.messageFilters);\n    return { ...io, messages: applied.messages };\n  },\n};\n\nconst hideCompressCallsNode: PipelineNode = {\n  name: \"hide-compress-calls\",\n  run(io) {\n    const hidden = hideConsumedCompressCalls(io.state, io.messages);\n    return { ...io, messages: hidden.messages };\n  },\n};\n\nconst recommendNode: PipelineNode = {\n  name: \"recommend\",\n  run(io, ctx) {\n    const protectedRefs = computeProtectedRefs(\n      io.messages,\n      io.state,\n      ctx.config,\n      ctx.countTokens,\n    );\n    const contextRanges = buildCompressibleRanges(\n      io.messages,\n      io.state,\n      ctx.config,\n      protectedRefs,\n      ctx.countTokens,\n    );\n    const nothingToCompress = contextRanges.compressible.length === 0;\n    const recommendation: Recommendation = {\n      contextRanges,\n      recommendedRanges: mergeRangesToThreshold(\n        contextRanges.compressible,\n        ctx.config.compress.minCompressRange,\n      ),\n      nothingToCompress,\n    };\n    return { ...io, effects: { ...io.effects, recommendation } };\n  },\n};\n\nconst nudgeNode: PipelineNode = {\n  name: \"nudge-inject\",\n  run(io, ctx) {\n    const nudge = decideNudge({\n      tokenCount: ctx.tokenCount,\n      config: ctx.config,\n      state: io.state,\n      messages: io.messages,\n      recommendation: io.effects.recommendation,\n      countTokens: ctx.countTokens,\n    });\n\n    const baseline = io.state.nudge.lastPerMessageNudgeTokens;\n    const nudgeGrowthTokens = resolveAdaptiveGrowth(\n      ctx.config.modelContextLimit,\n      ctx.config.nudge,\n    );\n\n    let stamped = { ...io.state.nudge };\n\n    if (baseline > 0 && ctx.tokenCount < baseline - nudgeGrowthTokens) {\n      stamped.lastPerMessageNudgeTokens = ctx.tokenCount;\n      stamped.lastNudgeShownTokens = 0;\n      // The context shrank dramatically — host compaction, or a tokenCount\n      // scale switch (an adapter moving from session-tree accounting to\n      // sent-view estimation). Per-tier cadence stamps recorded at the old\n      // scale would otherwise make `tokenCount - lastShownByTier[t] >=\n      // growthFloor` unreachable (a stamp above the window never re-arms),\n      // suppressing mid-band nudges until the absolute overLimit band fires.\n      // Restart tier cadence from the new baseline, mirroring the full stamp\n      // reset a successful applyCompression performs.\n      stamped.lastShownByTier = {};\n    }\n\n    if (stamped.lastPerMessageNudgeTokens === 0) {\n      stamped.lastPerMessageNudgeTokens = ctx.tokenCount;\n    }\n\n    if (nudge.shouldInject) {\n      stamped.lastNudgeShownTokens = ctx.tokenCount;\n      // Record the injected tier's own cadence baseline. Shared baseline\n      // (lastNudgeShownTokens) suppresses lower-priority tiers within this\n      // turn; the per-tier entry throttles re-firing of the SAME tier.\n      if (nudge.tier !== null) {\n        stamped.lastShownByTier = {\n          ...stamped.lastShownByTier,\n          [nudge.tier]: ctx.tokenCount,\n        };\n      }\n    }\n\n    return {\n      ...io,\n      state: { ...io.state, nudge: stamped },\n      effects: { ...io.effects, nudge },\n    };\n  },\n};\n\nconst emergencyTruncateNode: PipelineNode = {\n  name: \"emergency-truncate\",\n  run(io, ctx) {\n    const usage =\n      ctx.config.modelContextLimit > 0\n        ? ctx.tokenCount / ctx.config.modelContextLimit\n        : 0;\n    if (usage < ctx.config.truncate.threshold) return io;\n    const trunc = truncateLargeToolOutputs(\n      io.messages,\n      ctx.tokenCount,\n      ctx.config,\n      ctx.countTokens,\n      { protectRecentMessages: ctx.config.preserveRecentMessages },\n    );\n    return {\n      ...io,\n      messages: trunc.messages,\n      effects: { ...io.effects, truncatedCount: trunc.truncatedCount },\n    };\n  },\n};\n\ninterface SingleRangeInput {\n  spec: {\n    startRef: string;\n    endRef: string;\n    summary: string;\n    topic?: string;\n    compressCallId?: string;\n    summaryMaxChars?: number;\n  };\n  messages: CoreMessage[];\n  state: CompressionState;\n  runId: string;\n  config: Config;\n  protectedMessageIds?: Set<string>;\n  countTokens: (text: string) => number;\n  preExistingCoverage: Set<string>;\n}\n\ninterface SingleRangeOutcome {\n  tokens: number;\n  warnings: string[];\n}\n\nfunction applySingleRange(input: SingleRangeInput): SingleRangeOutcome {\n  const warnings: string[] = [];\n  const resolved = resolveBoundaries({\n    startRef: input.spec.startRef,\n    endRef: input.spec.endRef,\n    messages: input.messages,\n    state: input.state,\n  });\n\n  const rangeMessageIds = applyPairBoundaryAdjustments(\n    resolved,\n    input.messages,\n  ).filter((id) => !isSummaryMessageId(id));\n\n  // Re-scan for nested blocks in the ADJUSTED range (tool-pair extension may\n  // have pulled in messages that are anchors of existing blocks).\n  if (rangeMessageIds.length > resolved.messageIds.length) {\n    const indexByMessageId = new Map<string, number>();\n    input.messages.forEach((m, i) => indexByMessageId.set(m.id, i));\n    const adjustedStart =\n      rangeMessageIds.length > 0\n        ? (indexByMessageId.get(rangeMessageIds[0]!) ?? resolved.startIndex)\n        : resolved.startIndex;\n    const adjustedEnd =\n      rangeMessageIds.length > 0\n        ? (indexByMessageId.get(rangeMessageIds[rangeMessageIds.length - 1]!) ??\n          resolved.endIndex)\n        : resolved.endIndex;\n    const nestedSeen = new Set(resolved.nestedBlockIds);\n    for (const block of activeBlocks(input.state)) {\n      if (nestedSeen.has(block.blockId)) continue;\n      const anchor = visibleBlockAnchor(block, indexByMessageId);\n      if (anchor !== null && anchor >= adjustedStart && anchor <= adjustedEnd) {\n        nestedSeen.add(block.blockId);\n        resolved.nestedBlockIds.push(block.blockId);\n      }\n    }\n  }\n\n  const isBlockBoundary = resolved.boundaryKind === \"block\";\n  const targetTier = resolveTargetTier(\n    input.state,\n    resolved.nestedBlockIds,\n    isBlockBoundary,\n  );\n  const outputTier = isBlockBoundary\n    ? (Math.min(3, targetTier + 1) as CompressionTier)\n    : 1;\n\n  const consumedBlockIds = resolved.nestedBlockIds.filter((id) => {\n    const block = blockById(input.state, id);\n    return block?.active && block.tier === targetTier;\n  });\n\n  const effectiveMessageIds = new Set<string>(rangeMessageIds);\n  for (const consumedId of consumedBlockIds) {\n    const consumed = blockById(input.state, consumedId);\n    if (consumed) {\n      for (const id of consumed.effectiveMessageIds)\n        effectiveMessageIds.add(id);\n    }\n  }\n\n  const directMessageIds = [...effectiveMessageIds].filter(\n    (id) => !input.preExistingCoverage.has(id),\n  );\n\n  let filteredIds = filterProtectedToolMessages(\n    directMessageIds,\n    input.messages,\n    input.config,\n  );\n\n  // filterProtectedToolMessages drops protected tool calls (and their paired\n  // results) from the compressible set. They must also leave effectiveMessageIds,\n  // otherwise the block would record them as covered and hide them from view.\n  // (Bug 39: protected tool messages folded into a block.)\n  if (filteredIds.length < directMessageIds.length) {\n    const kept = new Set(filteredIds);\n    for (const id of directMessageIds) {\n      if (!kept.has(id)) effectiveMessageIds.delete(id);\n    }\n  }\n\n  // SOFT PROTECTION: the recent-N / last-user-message zone is advisory-only at\n  // compress time. Instead of failing the whole range when it brushes protected\n  // messages, exclude those messages and proceed with the rest (so the model\n  // isn't blocked when it picks a range that slightly overlaps the recent\n  // window). If excluding them empties the range entirely AND there are no\n  // consumed blocks to merge, we still fail — there is genuinely nothing to\n  // compress. `protectedMessageIds` holds REF ids (mNNNNN) from\n  // computeProtectedRefs; filteredIds holds RAW message ids, so convert via\n  // state.messageRefs.byRaw before testing membership.\n  const protectedRefs = input.protectedMessageIds;\n  const hitProtectedRaw = protectedRefs\n    ? filteredIds.filter((id) => {\n        const ref = input.state.messageRefs.byRaw[id];\n        return ref !== undefined && protectedRefs.has(ref);\n      })\n    : [];\n  if (hitProtectedRaw.length > 0) {\n    const protectedSet = new Set(hitProtectedRaw);\n    filteredIds = filteredIds.filter((id) => !protectedSet.has(id));\n    // Remove protected messages from effective coverage too, so they are NOT\n    // hidden by the new block (they must stay fully visible).\n    for (const id of hitProtectedRaw) effectiveMessageIds.delete(id);\n\n    const hitRefs = hitProtectedRaw\n      .map((id) => input.state.messageRefs.byRaw[id])\n      .filter((v): v is string => typeof v === \"string\");\n\n    if (filteredIds.length === 0 && consumedBlockIds.length === 0) {\n      const recentN = input.config.preserveRecentMessages;\n      throw new Error(\n        `Range is entirely within the protected zone (the last ${recentN} messages and/or the most recent user message): ${hitRefs.join(\n          \", \",\n        )}. Adjust startId/endId to older messages.`,\n      );\n    }\n    warnings.push(\n      `Excluded ${hitProtectedRaw.length} protected message(s) ${hitRefs.join(\n        \", \",\n      )} from compression range (recent/last-user zone).`,\n    );\n  }\n\n  validateCompressionRange(input, filteredIds, consumedBlockIds.length);\n\n  let compressedTokens = 0;\n  for (const id of filteredIds) {\n    const message = input.messages.find((entry) => entry.id === id);\n    compressedTokens += input.countTokens(message?.text ?? \"\");\n  }\n  for (const consumedId of consumedBlockIds) {\n    const consumed = blockById(input.state, consumedId);\n    if (consumed) {\n      compressedTokens += input.countTokens(consumed.summary);\n    }\n  }\n\n  const blockId = allocateBlockId(input.state);\n  const block: CompressionBlock = {\n    blockId,\n    runId: input.runId,\n    tier: outputTier,\n    topic: input.spec.topic,\n    summary: input.spec.summary,\n    directMessageIds: filteredIds,\n    effectiveMessageIds: [...effectiveMessageIds],\n    directBlockIds: [...consumedBlockIds],\n    compressedTokens,\n    createdAt: Date.now(),\n    survivedCount: 0,\n    generation: \"young\",\n    active: true,\n    compressCallId: input.spec.compressCallId,\n    startRef: input.spec.startRef,\n    endRef: input.spec.endRef,\n  };\n  input.state.blocks.push(block);\n\n  for (const consumedId of consumedBlockIds) {\n    const consumed = blockById(input.state, consumedId);\n    if (consumed) consumed.active = false;\n  }\n\n  return { tokens: compressedTokens, warnings };\n}\n\nfunction applyPairBoundaryAdjustments(\n  resolved: {\n    startIndex: number;\n    endIndex: number;\n    messageIds: string[];\n    boundaryKind: string;\n  },\n  messages: CoreMessage[],\n): string[] {\n  if (resolved.boundaryKind === \"block\") {\n    return resolved.messageIds;\n  }\n  // Compose tool-pair and reasoning-pair boundary adjustments to a fixpoint\n  // (≤2 passes). Reasoning may pull in a tool-call whose result tool-pairs\n  // then extends for; tool-pairs may pull in a tool-call whose preceding\n  // reasoning is then drawn in. Both only ever WIDEN the range.\n  let startIndex = resolved.startIndex;\n  let endIndex = resolved.endIndex;\n  for (let pass = 0; pass < 2; pass++) {\n    const reasoningAdjusted = adjustBoundariesForReasoningPairs(\n      startIndex,\n      endIndex,\n      messages,\n    );\n    const toolAdjusted = adjustBoundariesForToolPairs(\n      reasoningAdjusted.startIndex,\n      reasoningAdjusted.endIndex,\n      messages,\n    );\n    const changed =\n      toolAdjusted.startIndex !== startIndex ||\n      toolAdjusted.endIndex !== endIndex;\n    startIndex = toolAdjusted.startIndex;\n    endIndex = toolAdjusted.endIndex;\n    if (!changed) break;\n  }\n  if (startIndex === resolved.startIndex && endIndex === resolved.endIndex) {\n    return resolved.messageIds;\n  }\n  const ids: string[] = [];\n  for (let i = startIndex; i <= endIndex; i++) {\n    const msg = messages[i];\n    if (msg) ids.push(msg.id);\n  }\n  return ids;\n}\n\nfunction validateCompressionRange(\n  input: SingleRangeInput,\n  directMessageIds: string[],\n  consumedBlockCount: number,\n): void {\n  const cfg = input.config.compress;\n  const summary = input.spec.summary?.trim() ?? \"\";\n\n  if (summary.length === 0) {\n    throw new Error(\n      \"Summary is empty — provide a meaningful summary of the compressed range.\",\n    );\n  }\n\n  if (cfg.minSummaryLength > 0 && summary.length < cfg.minSummaryLength) {\n    throw new Error(\n      `Summary too short (${summary.length} chars, min ${cfg.minSummaryLength}). The summary must capture the compressed range's key information.`,\n    );\n  }\n\n  const effectiveMax = input.spec.summaryMaxChars ?? cfg.maxSummaryLength;\n  if (effectiveMax > 0 && summary.length > effectiveMax) {\n    throw new Error(\n      `Summary too long (${summary.length} chars, max ${effectiveMax}). Strip noise — keep critical paths, decisions, errors, and code references. Or pass summaryMaxChars to increase the limit — don't lose critical info just to fit.`,\n    );\n  }\n\n  if (directMessageIds.length === 0 && consumedBlockCount === 0) {\n    throw new Error(\n      \"Range contains no compressible messages — all are already covered by active blocks or protected.\",\n    );\n  }\n}\n\nfunction filterProtectedToolMessages(\n  directMessageIds: string[],\n  messages: CoreMessage[],\n  config: Config,\n): string[] {\n  // Protected tool calls (and their results, paired by toolCallId) stay in\n  // visible context and are simply dropped from the compressible set. They are\n  // NOT folded into the summary — the summary reflects what the author wrote,\n  // nothing auto-appended.\n  const protectedCallIds = new Set<string>();\n  const removedIds = new Set<string>();\n  for (const msg of messages) {\n    if (isMessageProtected(msg, config) && msg.toolCallId) {\n      protectedCallIds.add(msg.toolCallId);\n    }\n  }\n\n  for (const id of directMessageIds) {\n    const msg = messages.find((m) => m.id === id);\n    if (!msg) continue;\n    if (isMessageProtected(msg, config)) {\n      removedIds.add(id);\n      if (msg.toolCallId) protectedCallIds.add(msg.toolCallId);\n    }\n  }\n\n  for (const id of directMessageIds) {\n    if (removedIds.has(id)) continue;\n    const msg = messages.find((m) => m.id === id);\n    if (!msg) continue;\n    if (\n      msg.contentType === \"tool-result\" &&\n      msg.toolCallId &&\n      protectedCallIds.has(msg.toolCallId)\n    ) {\n      removedIds.add(id);\n    }\n  }\n\n  return directMessageIds.filter((id) => !removedIds.has(id));\n}\n\nfunction resolveTargetTier(\n  state: CompressionState,\n  nestedBlockIds: string[],\n  isBlockBoundary: boolean,\n): CompressionTier {\n  if (!isBlockBoundary) return 1;\n  if (nestedBlockIds.length === 0) return 1;\n  let minTier: CompressionTier = 3;\n  for (const id of nestedBlockIds) {\n    const block = blockById(state, id);\n    if (block && block.tier < minTier) minTier = block.tier;\n  }\n  return minTier;\n}\n\nfunction collectCoverage(state: CompressionState): Set<string> {\n  const coverage = new Set<string>();\n  for (const block of activeBlocks(state)) {\n    for (const id of block.effectiveMessageIds) coverage.add(id);\n  }\n  return coverage;\n}\n\ninterface NudgeInput {\n  tokenCount: number;\n  config: Config;\n  state: CompressionState;\n  messages: CoreMessage[];\n  recommendation?: Recommendation;\n  countTokens: (t: string) => number;\n}\n\nfunction resolveAdaptiveGrowth(\n  modelContextLimit: number,\n  nudge: NudgeConfig,\n): number {\n  if (!modelContextLimit || modelContextLimit <= 0) return nudge.growthFloor;\n  return Math.min(\n    nudge.growthCap,\n    Math.max(\n      nudge.growthFloor,\n      Math.round(modelContextLimit * nudge.growthRatio),\n    ),\n  );\n}\n\n/** Compressible amount for each tier. T1 = EFFECTIVE merged-range tokens —\n *  only ranges whose real char count >= minCompressRange count (avoids\n *  inflation from fragmentation; matches the apply-side gate, which counts\n *  raw `msg.text.length`, so a nudge never offers a range the kernel would\n *  atomically reject — see CompressibleRange.chars); T2 = total summary\n *  tokens of all active tier-1 blocks; T3 = total summary tokens of all\n *  active tier-2 blocks. */\nfunction pendingByTier(\n  state: CompressionState,\n  recommendation: Recommendation | undefined,\n  countTokens: (t: string) => number,\n  minCompressRange: number,\n): Record<number, { pending: number; targetBlocks: CompressionBlock[] }> {\n  const out: Record<\n    number,\n    { pending: number; targetBlocks: CompressionBlock[] }\n  > = {};\n  const merged = recommendation?.recommendedRanges ?? [];\n  const effective =\n    minCompressRange > 0\n      ? merged.filter((r) => (r.chars ?? r.tokens * 4) >= minCompressRange)\n      : merged;\n  out[1] = {\n    pending: effective.reduce((s, r) => s + r.tokens, 0),\n    targetBlocks: [],\n  };\n  const active = activeBlocks(state);\n  const t1 = active.filter((b) => b.tier === 1);\n  const t2 = active.filter((b) => b.tier === 2);\n  out[2] = {\n    pending: t1.reduce((s, b) => s + countTokens(b.summary), 0),\n    targetBlocks: t1,\n  };\n  out[3] = {\n    pending: t2.reduce((s, b) => s + countTokens(b.summary), 0),\n    targetBlocks: t2,\n  };\n  return out;\n}\n\nfunction decideNudge(input: NudgeInput): NudgeDecision {\n  const { config, state, tokenCount, recommendation, countTokens } = input;\n  const limit = config.modelContextLimit;\n  const usage = limit > 0 ? tokenCount / limit : 0;\n\n  const nudgeGrowthTokens = resolveAdaptiveGrowth(limit, config.nudge);\n\n  const overLimit = usage >= config.nudge.maxContextLimitPct;\n  const emergencyOverride = usage >= config.nudge.emergencyThresholdPct;\n  // High-pressure band: over maxContextLimitPct (subsumes the emergency\n  // threshold). Bypasses growth gate + cadence; gated on effective pending.\n  const pressure = overLimit || emergencyOverride;\n\n  const baseline = state.nudge.lastPerMessageNudgeTokens;\n  const hadPendingNudge = state.nudge.lastNudgeShownTokens > 0;\n\n  const hasPendingNudge = hadPendingNudge;\n  const effectiveThreshold = hasPendingNudge\n    ? Math.floor(nudgeGrowthTokens / 2)\n    : nudgeGrowthTokens;\n\n  const growthReference =\n    state.nudge.lastNudgeShownTokens > 0\n      ? state.nudge.lastNudgeShownTokens\n      : baseline > 0\n        ? baseline\n        : tokenCount;\n\n  const growthFloor = Math.max(\n    config.nudge.minGrowthFloor,\n    config.nudge.minGrowthRatio * nudgeGrowthTokens,\n  );\n\n  const growthSinceReference = tokenCount - growthReference;\n\n  const rec = recommendation;\n  const tiers = pendingByTier(\n    state,\n    rec,\n    countTokens,\n    config.compress.minCompressRange,\n  );\n\n  // Tier arbitration. Emergency (usage >= emergencyThresholdPct) ignores tier\n  // priority and picks the tier with the MAX pending. Non-emergency defaults to\n  // T1; T2 and T3 override when each crossed the shared 1.5x threshold AND\n  // exceeds the effective pending of every lower tier (T2 > T1 effective;\n  // T3 > T2 and > T1 effective).\n  const tier2Threshold = Math.round(\n    nudgeGrowthTokens * (config.nudge.tier2GrowthMultiplier ?? 1.5),\n  );\n  let injectedTier: CompressionTier | null = null;\n  let injectedReason = \"\";\n  const growthReady = growthSinceReference >= growthFloor;\n  const t1Eff = tiers[1]?.pending ?? 0;\n  const t2Pen = tiers[2]?.pending ?? 0;\n  const t3Pen = tiers[3]?.pending ?? 0;\n\n  if (pressure) {\n    // High pressure: pick the tier with the MAX pending so pressure can route\n    // to distillation when that reclaims the most tokens. Gated on effective\n    // pending (real chars >= minCompressRange for T1) so we never offer ranges\n    // the kernel would atomically reject. emergency vs over-limit only\n    // changes the reason label/voice; truncate.threshold remains the\n    // independent last resort when there is genuinely nothing to compress.\n    const candidates: CompressionTier[] = [1];\n    if (config.tiers.enabled) {\n      candidates.push(2, 3);\n    }\n    let best: CompressionTier | null = null;\n    let bestPending = 0;\n    for (const t of candidates) {\n      const p = tiers[t]?.pending ?? 0;\n      if (p > bestPending) {\n        bestPending = p;\n        best = t;\n      }\n    }\n    if (best !== null && bestPending > 0) {\n      injectedTier = best;\n      const label = emergencyOverride ? \"EMERGENCY\" : \"OVER-LIMIT\";\n      injectedReason =\n        best === 1\n          ? `${label} T1: max effective pending ${bestPending}, usage ${Math.round(usage * 100)}%`\n          : `${label} T${best} distill: max pending ${bestPending} (T1 effective ${t1Eff}, T2 ${t2Pen}, T3 ${t3Pen}), usage ${Math.round(usage * 100)}%`;\n    }\n  } else if (growthReady) {\n    if (t1Eff >= nudgeGrowthTokens) {\n      injectedTier = 1;\n      injectedReason = `T1 effective ${t1Eff} >= ${nudgeGrowthTokens}, growth ${growthSinceReference}, usage ${Math.round(usage * 100)}%`;\n    } else if (\n      config.tiers.enabled &&\n      t2Pen >= tier2Threshold &&\n      t2Pen > t1Eff\n    ) {\n      const lastShown = state.nudge.lastShownByTier[2] ?? 0;\n      const cadenceMet =\n        lastShown === 0 || tokenCount - lastShown >= growthFloor;\n      if (cadenceMet) {\n        injectedTier = 2;\n        injectedReason = `T2 distill ready: ${tiers[2]!.targetBlocks.length} tier-1 blocks (${t2Pen} tokens) >= ${tier2Threshold} (1.5x) and > T1 effective ${t1Eff}, usage ${Math.round(usage * 100)}%`;\n      }\n    } else if (\n      config.tiers.enabled &&\n      t3Pen >= tier2Threshold &&\n      t3Pen > t2Pen &&\n      t3Pen > t1Eff\n    ) {\n      const lastShown = state.nudge.lastShownByTier[3] ?? 0;\n      const cadenceMet =\n        lastShown === 0 || tokenCount - lastShown >= growthFloor;\n      if (cadenceMet) {\n        injectedTier = 3;\n        injectedReason = `T3 condense ready: ${tiers[3]!.targetBlocks.length} tier-2 blocks (${t3Pen} tokens) >= ${tier2Threshold} (1.5x) and > T2 ${t2Pen} and > T1 effective ${t1Eff}, usage ${Math.round(usage * 100)}%`;\n      }\n    }\n  }\n\n  const shouldInject = injectedTier !== null;\n\n  let reason: string;\n  if (injectedTier !== null) {\n    reason = injectedReason;\n  } else if (pressure) {\n    const label = emergencyOverride ? \"EMERGENCY\" : \"OVER-LIMIT\";\n    reason = `${label}: usage ${Math.round(usage * 100)}% but no tier has effective compressible content (T1 effective ${t1Eff}, T2 ${t2Pen}, T3 ${t3Pen}) — nudge suppressed to avoid offering ranges below minCompressRange`;\n  } else {\n    const tiersList = [1, 2, 3] as const;\n    const eligible = tiersList.filter((t) => config.tiers.enabled || t === 1);\n    const ready = eligible\n      .filter((t) => (tiers[t]?.pending ?? 0) >= nudgeGrowthTokens)\n      .map((t) => `T${t} ${tiers[t]!.pending}`);\n    const readyHint = ready.length > 0 ? `, ready: ${ready.join(\", \")}` : \"\";\n    const blocked = eligible\n      .filter(\n        (t) =>\n          (tiers[t]?.pending ?? 0) >= nudgeGrowthTokens &&\n          (state.nudge.lastShownByTier[t] ?? 0) > 0 &&\n          tokenCount - (state.nudge.lastShownByTier[t] ?? 0) < growthFloor,\n      )\n      .map((t) => `T${t} (cadence)`);\n    const blockedHint =\n      blocked.length > 0 ? `, blocked: ${blocked.join(\", \")}` : \"\";\n    const maxPending = Math.max(\n      0,\n      ...Object.values(tiers).map((t) => t.pending),\n    );\n    // Report the ACTUAL blocking condition, not a fixed template. A session\n    // can have plenty to compress (pending >= threshold) but still not\n    // inject because growth/floor/cadence isn't met — the old fixed\n    // \"< threshold\" string lied in that case.\n    const pendingShort = maxPending < nudgeGrowthTokens;\n    const growthShort = growthSinceReference < growthFloor;\n    const parts: string[] = [];\n    if (pendingShort)\n      parts.push(\n        `max compressible ${maxPending} < threshold ${nudgeGrowthTokens}`,\n      );\n    if (growthShort)\n      parts.push(`growth ${growthSinceReference} < floor ${growthFloor}`);\n    if (parts.length === 0)\n      parts.push(\n        `max compressible ${maxPending}, growth ${growthSinceReference}`,\n      );\n    reason = `${parts.join(\"; \")}${readyHint}${blockedHint}`;\n  }\n\n  const ctxBreakdown = computeContextBreakdown(\n    input.messages,\n    tokenCount,\n    growthSinceReference,\n    countTokens,\n  );\n\n  return {\n    shouldInject,\n    reason,\n    compressibleRanges: rec?.recommendedRanges ?? [],\n    protectedRanges: rec?.contextRanges.protected ?? [],\n    tierTargetBlocks: injectedTier ? tiers[injectedTier]!.targetBlocks : [],\n    contextUsage: usage,\n    tier: injectedTier,\n    breakdown: {\n      usage,\n      growth: growthSinceReference,\n      growthReference,\n      effectiveThreshold,\n      nudgeGrowthTokens,\n      growthFloor,\n      hasPendingNudge: hasPendingNudge ? 1 : 0,\n      overLimit: overLimit ? 1 : 0,\n      emergencyOverride: emergencyOverride ? 1 : 0,\n      pendingT1: tiers[1]!.pending,\n      pendingT2: tiers[2]!.pending,\n      pendingT3: tiers[3]!.pending,\n    },\n    contextBreakdown: ctxBreakdown,\n  };\n}\n\nfunction computeContextBreakdown(\n  messages: CoreMessage[],\n  total: number,\n  growth: number,\n  countTokens: (t: string) => number,\n): ContextBreakdown {\n  const count = countTokens ?? ((t: string) => Math.ceil(t.length / 4));\n  let system = 0,\n    tool = 0,\n    summaries = 0,\n    code = 0,\n    text = 0;\n  for (const msg of messages) {\n    const tokens = count(msg.text ?? \"\");\n    if (msg.text?.startsWith(\"[Compressed conversation section]\")) {\n      summaries += tokens;\n    } else if (\n      msg.contentType === \"tool-call\" ||\n      msg.contentType === \"tool-result\"\n    ) {\n      tool += tokens;\n    } else if (msg.role === \"system\") {\n      system += tokens;\n    } else if (msg.text?.includes(\"```\")) {\n      code += tokens;\n    } else {\n      text += tokens;\n    }\n  }\n  return { system, tool, summaries, code, text, total, growth };\n}\n\nfunction cloneState(state: CompressionState): CompressionState {\n  return {\n    blocks: state.blocks.map((block) => ({\n      ...block,\n      directMessageIds: [...block.directMessageIds],\n      effectiveMessageIds: [...block.effectiveMessageIds],\n      directBlockIds: [...block.directBlockIds],\n    })),\n    messageRefs: {\n      byRaw: { ...state.messageRefs.byRaw },\n      byRef: { ...state.messageRefs.byRef },\n    },\n    tokenSnapshot: { ...(state.tokenSnapshot ?? {}) },\n    nudge: { ...state.nudge, anchors: { ...state.nudge.anchors } },\n    stats: { ...state.stats },\n    nextBlockId: state.nextBlockId,\n    nextRunId: state.nextRunId,\n  };\n}\n\nfunction scoreRelevance(block: CompressionBlock, terms: string[]): number {\n  const topic = (block.topic ?? \"\").toLowerCase();\n  const summary = block.summary.toLowerCase();\n  let score = 0;\n  for (const term of terms) {\n    const topicHits = countOccurrences(topic, term);\n    if (topicHits > 0) score += Math.min(topicHits * 0.15, 0.45);\n    const summaryHits = countOccurrences(summary, term);\n    if (summaryHits > 0) score += Math.min(summaryHits * 0.04, 0.2);\n  }\n  return Math.min(score, 1);\n}\n\nfunction countOccurrences(haystack: string, needle: string): number {\n  if (!haystack || !needle) return 0;\n  let count = 0;\n  let position = 0;\n  while ((position = haystack.indexOf(needle, position)) !== -1) {\n    count++;\n    position += needle.length;\n  }\n  return count;\n}\n\nexport { createInitialState };\n","import { SUMMARY_HEADER } from \"./prune.js\";\nimport type { CompressionBlock, CompressionState, CoreMessage } from \"./types.js\";\n\nexport function parseBlockIdArg(arg: string): string | null {\n    const normalized = arg.trim().toLowerCase();\n    const refMatch = /^b0*(\\d+)$/.exec(normalized);\n    if (refMatch && refMatch[1] !== undefined) return `b${refMatch[1]}`;\n    const numMatch = /^(\\d+)$/.exec(normalized);\n    if (numMatch && numMatch[1] !== undefined) return `b${numMatch[1]}`;\n    return null;\n}\n\nexport function findBlocksOverlappingMessages(\n    state: CompressionState,\n    messageIds: Set<string>,\n): CompressionBlock[] {\n    if (messageIds.size === 0) return [];\n    const matched: CompressionBlock[] = [];\n    for (const block of state.blocks) {\n        if (!block.active) continue;\n        if (block.effectiveMessageIds.some((id) => messageIds.has(id))) {\n            matched.push(block);\n        }\n    }\n    return matched.sort((a, b) => numericPart(a.blockId) - numericPart(b.blockId));\n}\n\nexport function findActiveAncestor(state: CompressionState, blockId: string): string | null {\n    const start = state.blocks.find((b) => b.blockId === blockId);\n    if (!start) return null;\n    const queue: string[] = [...start.directBlockIds];\n    const visited = new Set<string>();\n    while (queue.length > 0) {\n        const currentId = queue.shift()!;\n        if (visited.has(currentId)) continue;\n        visited.add(currentId);\n        const current = state.blocks.find((b) => b.blockId === currentId);\n        if (!current) continue;\n        if (current.active) return current.blockId;\n        for (const ancestorId of current.directBlockIds) {\n            if (!visited.has(ancestorId)) queue.push(ancestorId);\n        }\n    }\n    return null;\n}\n\nexport interface DeactivateOptions {\n    deep?: boolean;\n}\n\nexport function deactivateBlock(\n    state: CompressionState,\n    blockIds: string[],\n    options: DeactivateOptions = {},\n): CompressionState {\n    const targets = new Set(blockIds);\n\n    const updated = state.blocks.map((block) => {\n        if (!targets.has(block.blockId) || !block.active) return block;\n        return {\n            ...block,\n            active: false,\n            durationMs: block.durationMs,\n            createdAt: block.createdAt,\n        };\n    });\n\n    let final = updated;\n    if (options.deep) {\n        const visited = new Set<string>();\n        const queue: string[] = [];\n        for (const id of blockIds) {\n            const block = updated.find((b) => b.blockId === id);\n            if (block) queue.push(...block.directBlockIds);\n        }\n        while (queue.length > 0) {\n            const id = queue.shift()!;\n            if (visited.has(id)) continue;\n            visited.add(id);\n            final = final.map((block) => {\n                if (block.blockId !== id) return block;\n                queue.push(...block.directBlockIds);\n                return block.active ? { ...block, active: false } : block;\n            });\n        }\n    }\n\n    return { ...state, blocks: final };\n}\n\nexport interface RestoredPreviewResult {\n    preview: string;\n    restoredCount: number;\n}\n\nexport function buildRestoredContentPreview(\n    messages: CoreMessage[],\n    beforeActiveMessageIds: Set<string>,\n    state: CompressionState,\n): RestoredPreviewResult {\n    const restored: CoreMessage[] = [];\n    for (const message of messages) {\n        if (!beforeActiveMessageIds.has(message.id)) continue;\n        const stillCovered = state.blocks.some(\n            (b) => b.active && b.effectiveMessageIds.includes(message.id),\n        );\n        if (!stillCovered) restored.push(message);\n    }\n\n    if (restored.length === 0) return { preview: \"\", restoredCount: 0 };\n\n    const lines: string[] = [];\n    let totalLength = 0;\n    const MAX_PREVIEW = 2000;\n    const MAX_PER_MESSAGE = 200;\n\n    for (const message of restored) {\n        if (totalLength >= MAX_PREVIEW) break;\n        const text = message.text ?? \"\";\n        const truncated = text.length > MAX_PER_MESSAGE ? text.slice(0, MAX_PER_MESSAGE) + \"...\" : text;\n        const label =\n            message.toolName && message.contentType !== \"text\"\n                ? `${message.toolName}: ${truncated}`\n                : `[${message.role}] ${truncated}`;\n        lines.push(label);\n        totalLength += label.length + 1;\n    }\n\n    return { preview: lines.join(\"\\n\"), restoredCount: restored.length };\n}\n\nexport interface CollectedContentResult {\n    /** Rendered, human-readable content string (empty when count is 0). */\n    text: string;\n    /** Number of items rendered: direct messages + nested summaries (full=false) or all messages (full=true). */\n    count: number;\n}\n\nexport interface CollectContentOptions {\n    /** When true, recurse through all nested tiers to original messages. Default: false (one tier up — nested active children stay folded, their summaries shown). */\n    full?: boolean;\n}\n\n/**\n * Collect a block's content as a readable string WITHOUT modifying state.\n *\n * This is the cache-safe decompress primitive: the block stays compressed\n * (folded), its summary stays in place, and the full content is returned as\n * text for the caller to surface (e.g. as a tool result appended to the\n * conversation). Unlike deactivateBlock + prune, this does not mutate the\n * message-array prefix, so prompt cache is preserved.\n *\n * full=false (default): one tier up. Nested ACTIVE children of this block\n *   stay folded; their summaries are rendered in place of their messages.\n *   The block's own direct messages (not covered by any active child) are\n *   rendered in full.\n * full=true: recurse through all nested tiers; every effective message is\n *   rendered in full.\n *\n * Returns { text: \"\", count: 0 } when the block covers no messages.\n */\nexport function collectBlockContent(\n    state: CompressionState,\n    block: CompressionBlock,\n    messages: CoreMessage[],\n    options: CollectContentOptions = {},\n): CollectedContentResult {\n    const full = options.full ?? false;\n    const targetIds = new Set(block.effectiveMessageIds);\n\n    if (full) {\n        const msgs = messages.filter((m) => targetIds.has(m.id));\n        if (msgs.length === 0) return { text: \"\", count: 0 };\n        return { text: msgs.map(formatMessage).join(\"\\n\\n\"), count: msgs.length };\n    }\n\n    // One tier up: messages covered by nested ACTIVE children stay folded\n    // (their summaries shown); the block's own direct messages shown in full.\n    const nestedChildren: CompressionBlock[] = [];\n    const nestedCovered = new Set<string>();\n    for (const childId of block.directBlockIds) {\n        const child = state.blocks.find((b) => b.blockId === childId);\n        if (!child?.active) continue;\n        nestedChildren.push(child);\n        for (const id of child.effectiveMessageIds) nestedCovered.add(id);\n    }\n\n    const parts: string[] = [];\n    for (const child of nestedChildren) {\n        const label = child.topic ? `${child.blockId}: ${child.topic}` : child.blockId;\n        parts.push(`${SUMMARY_HEADER} — ${label}\\n${child.summary}`);\n    }\n\n    let directCount = 0;\n    for (const m of messages) {\n        if (targetIds.has(m.id) && !nestedCovered.has(m.id)) {\n            parts.push(formatMessage(m));\n            directCount++;\n        }\n    }\n\n    const count = directCount + nestedChildren.length;\n    if (count === 0) return { text: \"\", count: 0 };\n    return { text: parts.join(\"\\n\\n\"), count };\n}\n\nfunction formatMessage(message: CoreMessage): string {\n    const text = message.text ?? \"\";\n    if (message.toolName && message.contentType !== \"text\") {\n        return `[${message.role} • ${message.toolName}]\\n${text}`;\n    }\n    return `[${message.role}]\\n${text}`;\n}\n\nfunction numericPart(blockId: string): number {\n    const match = /^b(\\d+)$/.exec(blockId);\n    return match && match[1] !== undefined ? Number(match[1]) : 0;\n}\n","import { refForRaw } from \"./refs.js\";\nimport type { CompressionBlock, CompressionState, CoreMessage } from \"./types.js\";\n\nfunction formatTokens(n: number): string {\n    if (!Number.isFinite(n) || n <= 0) return \"0\";\n    return n >= 1000 ? `${(n / 1000).toFixed(1)}K` : String(n);\n}\n\nfunction pct(n: number, total: number): number {\n    if (n <= 0 || total <= 0) return 0;\n    return Math.max(1, Math.round((n / total) * 100));\n}\n\nfunction numericPart(blockId: string): number {\n    const match = /^b(\\d+)$/.exec(blockId);\n    return match && match[1] !== undefined ? Number(match[1]) : 0;\n}\n\nfunction summaryTokensOf(block: CompressionBlock, countTokens: (t: string) => number): number {\n    return countTokens(block.summary);\n}\n\nfunction effectiveCompressedTokens(\n    block: CompressionBlock,\n    _state: CompressionState,\n    _countTokens: (t: string) => number,\n): number {\n    // block.compressedTokens already records the full input token count of the\n    // operation that created this block: for a tier-1 block that is the raw\n    // messages; for a tier-2 block it is the tier-1 summaries + the new\n    // messages it spans. Recursing into directBlockIds and summing children's\n    // compressedTokens double-counts the consumed children, so we return the\n    // block's own value directly. (The previous recursion inflated tier-2+\n    // \"original\" figures and mis-ordered the status report.)\n    return block.compressedTokens;\n}\n\nfunction tierLabel(block: CompressionBlock): string {\n    return `T${block.tier}`;\n}\n\nfunction tierBreakdown(\n    blocks: CompressionBlock[],\n    countTokens: (t: string) => number,\n): string | null {\n    const tierTokens: Record<number, number> = {};\n    for (const block of blocks) {\n        tierTokens[block.tier] = (tierTokens[block.tier] ?? 0) + summaryTokensOf(block, countTokens);\n    }\n    const tiers = Object.keys(tierTokens).map(Number);\n    if (tiers.length <= 1) return null;\n    const parts: string[] = [];\n    for (const tier of [1, 2, 3]) {\n        if (tierTokens[tier]) parts.push(`T${tier}: ${formatTokens(tierTokens[tier])}`);\n    }\n    return parts.join(\" | \");\n}\n\ninterface VisibleMessageInfo {\n    ref: string;\n    tokens: number;\n    tool: string;\n    index: number;\n}\n\nfunction collectVisible(\n    messages: CoreMessage[],\n    state: CompressionState,\n    countTokens: (t: string) => number,\n): { visible: VisibleMessageInfo[]; summaryTokens: number } {\n    const coveredIds = new Set<string>();\n    for (const block of state.blocks) {\n        if (!block.active) continue;\n        for (const id of block.effectiveMessageIds) coveredIds.add(id);\n    }\n    let summaryTokens = 0;\n    for (const block of state.blocks) {\n        if (block.active) summaryTokens += summaryTokensOf(block, countTokens);\n    }\n    const visible: VisibleMessageInfo[] = [];\n    messages.forEach((message, index) => {\n        if (coveredIds.has(message.id)) return;\n        const ref = refForRaw(state.messageRefs, message.id);\n        if (!ref) return;\n        const tokens = countTokens(message.text ?? \"\");\n        const tool = message.toolName ?? \"text\";\n        if (tokens > 0) visible.push({ ref, tokens, tool, index });\n    });\n    return { visible, summaryTokens };\n}\n\nexport interface StatusReportOptions {\n    scope?: \"compressed\" | \"uncompressed\";\n    view?: \"ranges\" | \"messages\";\n    tool?: string;\n    sort?: \"size\" | \"time\" | \"tool\" | \"age\";\n    limit?: number;\n}\n\nexport function buildStatusReport(\n    state: CompressionState,\n    messages: CoreMessage[],\n    countTokens: (t: string) => number,\n    options: StatusReportOptions = {},\n): string {\n    const scope = options.scope;\n    const view = options.view ?? \"ranges\";\n    const toolFilter = options.tool;\n    const sort = options.sort ?? \"size\";\n    const limit = options.limit ?? 30;\n\n    const activeBlocks = state.blocks\n        .filter((b) => b.active)\n        .sort((a, b) => numericPart(a.blockId) - numericPart(b.blockId));\n\n    if (scope === \"compressed\") {\n        return renderCompressedDrilldown(activeBlocks, state, sort, limit, countTokens);\n    }\n\n    const { visible, summaryTokens } = collectVisible(messages, state, countTokens);\n\n    if (scope === \"uncompressed\") {\n        if (view === \"messages\") {\n            return renderMessageDrilldown(visible, toolFilter, sort, limit);\n        }\n        return renderUncompressedRanges(visible);\n    }\n\n    return renderOverview(visible, summaryTokens, activeBlocks, state, countTokens, limit);\n}\n\nfunction renderOverview(\n    visible: VisibleMessageInfo[],\n    summaryTokens: number,\n    blocks: CompressionBlock[],\n    state: CompressionState,\n    countTokens: (t: string) => number,\n    limit: number,\n): string {\n    const lines: string[] = [];\n    const toolTypeMap = new Map<string, number>();\n    for (const message of visible) {\n        toolTypeMap.set(message.tool, (toolTypeMap.get(message.tool) ?? 0) + message.tokens);\n    }\n    const topTool = [...toolTypeMap.entries()].sort((a, b) => b[1] - a[1])[0]?.[0];\n\n    const totalTool = visible\n        .filter((m) => m.tool !== \"text\")\n        .reduce((sum, m) => sum + m.tokens, 0);\n    const totalText = visible\n        .filter((m) => m.tool === \"text\")\n        .reduce((sum, m) => sum + m.tokens, 0);\n    const total = summaryTokens + totalTool + totalText;\n\n    lines.push(\"CONTEXT BREAKDOWN\");\n    lines.push(\n        `  ${formatTokens(totalTool)} tool (${pct(totalTool, total)}%) | ${formatTokens(totalText)} text (${pct(totalText, total)}%) | ${formatTokens(summaryTokens)} summaries (${pct(summaryTokens, total)}%)`,\n    );\n    const topTypes = [...toolTypeMap.entries()]\n        .sort((a, b) => b[1] - a[1])\n        .slice(0, 3);\n    if (topTypes.length > 0) {\n        lines.push(`  Top tools: ${topTypes.map(([t, n]) => `${t} (${pct(n, total)}%)`).join(\", \")}`);\n    }\n\n    lines.push(\"\");\n    if (blocks.length === 0) {\n        lines.push(\"COMPRESSED BLOCKS\");\n        lines.push(\"  No compressed blocks.\");\n    } else {\n        const totalSummary = blocks.reduce((s, b) => s + summaryTokensOf(b, countTokens), 0);\n        const totalEffective = blocks.reduce(\n            (s, b) => s + effectiveCompressedTokens(b, state, countTokens),\n            0,\n        );\n        lines.push(\n            `COMPRESSED BLOCKS — ${blocks.length} active (${formatTokens(totalSummary)} summary, ${formatTokens(totalEffective)} original)`,\n        );\n        const breakdown = tierBreakdown(blocks, countTokens);\n        if (breakdown) lines.push(`  Tier usage: ${breakdown}`);\n        lines.push(\"\");\n        const sorted = [...blocks].sort(\n            (a, b) =>\n                effectiveCompressedTokens(b, state, countTokens) -\n                    effectiveCompressedTokens(a, state, countTokens) ||\n                b.createdAt - a.createdAt,\n        );\n        for (const block of sorted.slice(0, limit)) {\n            const topic = block.topic ?? \"(no topic)\";\n            const eff = effectiveCompressedTokens(block, state, countTokens);\n            lines.push(\n                `  ${block.blockId} (${tierLabel(block)})  ${formatTokens(eff)}→${formatTokens(summaryTokensOf(block, countTokens))}  ${block.effectiveMessageIds.length} msgs  \"${topic}\"`,\n            );\n        }\n    }\n\n    lines.push(\"\");\n    lines.push(\n        `Tip: buildStatusReport({scope:\"uncompressed\", view:\"messages\", tool:\"${topTool ?? \"bash\"}\"}) for per-message listing`,\n    );\n    return lines.join(\"\\n\");\n}\n\nfunction renderUncompressedRanges(visible: VisibleMessageInfo[]): string {\n    const lines: string[] = [];\n    const totalTokens = visible.reduce((s, m) => s + m.tokens, 0);\n    lines.push(`UNCOMPRESSED — ${formatTokens(totalTokens)} | ${visible.length} visible messages`);\n    lines.push(\"\");\n    if (visible.length === 0) {\n        lines.push(\"  (no uncompressed messages)\");\n        return lines.join(\"\\n\");\n    }\n    // Merge consecutive messages into ranges (by numeric ref), aggregating\n    // token counts and dominant tool so the view reads as blocks, not a\n    // per-message firehose — mirroring the Compressible Ranges output.\n    interface Merged { startRef: string; endRef: string; startNum: number; count: number; tokens: number; tool: string; }\n    const refNum = (ref: string): number => {\n        const m = ref.match(/\\d+/);\n        return m ? parseInt(m[0], 10) : 0;\n    };\n    const merged: Merged[] = [];\n    for (const m of visible) {\n        const num = refNum(m.ref);\n        const last = merged[merged.length - 1];\n        if (last && num === last.startNum + last.count) {\n            last.endRef = m.ref;\n            last.count += 1;\n            last.tokens += m.tokens;\n        } else {\n            merged.push({ startRef: m.ref, endRef: m.ref, startNum: num, count: 1, tokens: m.tokens, tool: m.tool });\n        }\n    }\n    for (const r of merged.slice(0, 30)) {\n        const range = r.count === 1 ? r.startRef : `${r.startRef}–${r.endRef}`;\n        lines.push(`  ${range}  (${r.count} msgs, ${formatTokens(r.tokens)}${r.count > 1 ? ` (${Math.round(r.tokens / r.count)}/msg)` : \"\"}) ${r.tool}`);\n    }\n    if (merged.length > 30) {\n        lines.push(`  ... and ${merged.length - 30} more ranges`);\n    }\n    return lines.join(\"\\n\");\n}\n\nfunction renderMessageDrilldown(\n    visible: VisibleMessageInfo[],\n    toolFilter: string | undefined,\n    sort: string,\n    limit: number,\n): string {\n    let filtered = visible;\n    if (toolFilter) filtered = filtered.filter((m) => m.tool === toolFilter);\n\n    if (sort === \"time\") filtered.sort((a, b) => a.index - b.index);\n    else if (sort === \"tool\") filtered.sort((a, b) => a.tool.localeCompare(b.tool) || b.tokens - a.tokens);\n    else filtered.sort((a, b) => b.tokens - a.tokens);\n\n    const totalTokens = filtered.reduce((s, m) => s + m.tokens, 0);\n    const allTokens = visible.reduce((s, m) => s + m.tokens, 0);\n    const header = toolFilter\n        ? `UNCOMPRESSED — ${toolFilter}: ${formatTokens(totalTokens)} | ${filtered.length} msgs | ${pct(totalTokens, allTokens)}% of visible`\n        : `UNCOMPRESSED — ${formatTokens(totalTokens)} | ${filtered.length} msgs`;\n    const lines = [header, `Sorted by ${sort}`, \"\"];\n    const shown = filtered.slice(0, limit);\n    for (const message of shown) {\n        lines.push(`  ${message.ref} (${formatTokens(message.tokens)}) ${message.tool}`);\n    }\n    if (filtered.length > shown.length) {\n        lines.push(\"\");\n        lines.push(`${shown.length} of ${filtered.length} shown.`);\n    }\n    return lines.join(\"\\n\");\n}\n\nfunction renderCompressedDrilldown(\n    blocks: CompressionBlock[],\n    state: CompressionState,\n    sort: string,\n    limit: number,\n    countTokens: (t: string) => number,\n): string {\n    let sorted = [...blocks];\n    if (sort === \"time\") sorted.sort((a, b) => a.createdAt - b.createdAt);\n    else if (sort === \"age\") sorted.sort((a, b) => b.survivedCount - a.survivedCount);\n    else\n        sorted.sort(\n            (a, b) =>\n                effectiveCompressedTokens(b, state, countTokens) -\n                    effectiveCompressedTokens(a, state, countTokens) ||\n                b.createdAt - a.createdAt,\n        );\n\n    const totalSummary = sorted.reduce((s, b) => s + summaryTokensOf(b, countTokens), 0);\n    const totalEffective = sorted.reduce(\n        (s, b) => s + effectiveCompressedTokens(b, state, countTokens),\n        0,\n    );\n    const lines = [\n        `COMPRESSED — ${sorted.length} blocks | ${formatTokens(totalEffective)} original → ${formatTokens(totalSummary)} summary`,\n    ];\n    const breakdown = tierBreakdown(sorted, countTokens);\n    if (breakdown) lines.push(`Tier usage: ${breakdown}`);\n    lines.push(\"\");\n    const shown = sorted.slice(0, limit);\n    for (const block of shown) {\n        const nested = block.directBlockIds.length > 0 ? ` nested=[${block.directBlockIds.join(\",\")}]` : \"\";\n        const topic = block.topic ?? \"(no topic)\";\n        const eff = effectiveCompressedTokens(block, state, countTokens);\n        lines.push(\n            `  ${block.blockId} (${tierLabel(block)})  ${formatTokens(eff)}→${formatTokens(summaryTokensOf(block, countTokens))}  ${block.effectiveMessageIds.length} msgs  age=${block.survivedCount} ${block.generation}${nested}`,\n        );\n        lines.push(`    \"${topic}\"`);\n    }\n    if (sorted.length > shown.length) {\n        lines.push(\"\");\n        lines.push(`${shown.length} of ${sorted.length} shown.`);\n    }\n    return lines.join(\"\\n\");\n}\n\nexport function buildRecap(\n    state: CompressionState,\n    blockId?: string,\n): string {\n    const activeBlocks = state.blocks\n        .filter((b) => b.active)\n        .sort((a, b) => numericPart(a.blockId) - numericPart(b.blockId));\n\n    if (blockId !== undefined) {\n        const block = state.blocks.find((b) => b.blockId === blockId);\n        if (!block) {\n            const activeList = activeBlocks.map((b) => b.blockId).join(\", \");\n            return `Block ${blockId} not found. Active blocks: ${activeList}`;\n        }\n        if (!block.active) {\n            return `Block ${blockId} is inactive (deactivated by nested compression).`;\n        }\n        const range = `${block.effectiveMessageIds.length} messages`;\n        return `[Compressed conversation section]\\n${block.summary}\\n\\n[${blockId} | ${range} | topic: \"${block.topic ?? \"(none)\"}\"]`;\n    }\n\n    if (activeBlocks.length === 0) return \"No active compression blocks.\";\n\n    const lines = [`Active compression blocks (${activeBlocks.length}):`];\n    for (const block of activeBlocks) {\n        const range = `${block.effectiveMessageIds.length} messages`;\n        const preview = block.summary.slice(0, 200);\n        lines.push(`\\n${block.blockId} | ${range} | \"${block.topic ?? \"(none)\"}\"`);\n        lines.push(`  ${preview}${block.summary.length > 200 ? \"...\" : \"\"}`);\n    }\n    lines.push(`\\nCall with blockId to get the full summary.`);\n    return lines.join(\"\\n\");\n}\n","import { createCore } from \"./compress.js\";\nimport { assignRefs, highestUsedIndex } from \"./refs.js\";\nimport { defaultCountTokens } from \"./tokenize.js\";\nimport type { CompressionState, CoreMessage } from \"./types.js\";\n\nexport interface CompressInputEntry {\n    startId?: string;\n    endId?: string;\n    messageId?: string;\n    summary: string;\n    topic?: string;\n}\n\nexport interface RebuildResult {\n    state: CompressionState;\n    blocksRebuilt: number;\n}\n\nexport interface RebuildPorts {\n    countTokens?: (text: string) => number;\n}\n\n/**\n * Fork-recovery: reconstruct compression state by replaying historical\n * `compress` tool-call messages. Message refs (mNNNNN) are assigned by\n * message order, so they are fork-stable — a ref in a historical compress\n * input points to the same logical message after a fork regenerates IDs.\n * The rebuilt state is an approximation: only raw model summaries are\n * replayed (no protected-content enrichments).\n */\nexport function rebuildCompressionState(\n    state: CompressionState,\n    messages: CoreMessage[],\n    config: import(\"./types.js\").Config,\n    ports: RebuildPorts = {},\n): RebuildResult {\n    const core = createCore({ countTokens: ports.countTokens ?? defaultCountTokens });\n    const refResult = assignRefs(messages, {\n        existing: state.messageRefs,\n        nextIndex: highestUsedIndex(state.messageRefs) + 1,\n    });\n    let working: CompressionState = { ...state, messageRefs: refResult.map };\n\n    const invocations = collectCompressInvocations(messages);\n    let blocksRebuilt = 0;\n\n    for (const invocation of invocations) {\n        const ranges = extractRanges(invocation.input, invocation.callId);\n        if (ranges.length === 0) continue;\n        const result = core.applyCompression({ ranges, messages, state: working, config });\n        working = result.state;\n        blocksRebuilt += result.result.blocksCreated;\n    }\n\n    return { state: working, blocksRebuilt };\n}\n\ninterface CompressInvocation {\n    callId: string | undefined;\n    input: unknown;\n}\n\nfunction collectCompressInvocations(messages: CoreMessage[]): CompressInvocation[] {\n    const invocations: CompressInvocation[] = [];\n    for (const message of messages) {\n        if (message.toolName !== \"compress\" || message.contentType !== \"tool-call\") continue;\n        let input: unknown;\n        try {\n            input = JSON.parse(message.text ?? \"\");\n        } catch {\n            continue;\n        }\n        invocations.push({ callId: message.toolCallId, input });\n    }\n    return invocations;\n}\n\nfunction extractRanges(\n    input: unknown,\n    callId: string | undefined,\n): Array<{\n    startRef: string;\n    endRef: string;\n    summary: string;\n    topic?: string;\n    compressCallId?: string;\n}> {\n    const content = (input as { content?: unknown[] })?.content;\n    if (!Array.isArray(content)) return [];\n    const ranges = [];\n    for (const entry of content) {\n        if (!entry || typeof entry !== \"object\") continue;\n        const e = entry as CompressInputEntry;\n        if (typeof e.summary !== \"string\") continue;\n        const start = e.startId ?? e.messageId;\n        const end = e.endId ?? e.messageId;\n        if (typeof start !== \"string\" || typeof end !== \"string\") continue;\n        ranges.push({\n            startRef: start,\n            endRef: end,\n            summary: e.summary,\n            topic: typeof e.topic === \"string\" ? e.topic : undefined,\n            compressCallId: callId,\n        });\n    }\n    return ranges;\n}\n","export type TransformChannel = \"message\" | \"wire\";\n\n/**\n * Pick the transform channel: an explicit preference always wins; otherwise\n * the wire channel is used only when the caller's host actually applies the\n * wire-payload replacement (adapters pass `wireViable` — e.g. the body format\n * is in WIRE_FORMATS and the host honors the hook's return value).\n */\nexport function resolveTransformChannel(\n  explicit: TransformChannel | undefined,\n  wireViable: boolean,\n): TransformChannel {\n  return explicit ?? (wireViable ? \"wire\" : \"message\");\n}\n","/**\n * Lightweight English stemmer (suffix stripping, Porter-inspired).\n * Zero dependencies. Good enough for IR morphology normalization:\n *   tokens → token, running → runn, compressed → compress,\n *   authentication → authentic, handling → handl, subagents → subagent\n *\n * Not a full Porter stemmer — intentionally simpler and faster. CJK is\n * untouched (handled by bigram tokenization, not stemming).\n */\nexport function stem(word: string): string {\n    let w = word;\n    if (w.length <= 3) return w;\n    if (w.endsWith(\"ies\")) w = w.slice(0, -3) + \"y\";\n    else if (w.endsWith(\"ses\") || w.endsWith(\"xes\") || w.endsWith(\"zes\")) w = w.slice(0, -2);\n    else if (w.endsWith(\"ches\") || w.endsWith(\"shes\")) w = w.slice(0, -2);\n    else if (w.endsWith(\"s\") && !w.endsWith(\"ss\")) w = w.slice(0, -1);\n    if (w.endsWith(\"ing\") && w.length > 5) w = w.slice(0, -3);\n    if (w.endsWith(\"ed\") && w.length > 4) w = w.slice(0, -2);\n    if (w.endsWith(\"ation\") && w.length > 6) w = w.slice(0, -3);\n    else if (w.endsWith(\"tion\") && w.length > 5) w = w.slice(0, -4) + \"t\";\n    else if (w.endsWith(\"ion\") && w.length > 4) w = w.slice(0, -3);\n    if (w.endsWith(\"ment\") && w.length > 6) w = w.slice(0, -4);\n    if (w.endsWith(\"ness\") && w.length > 6) w = w.slice(0, -4);\n    if (w.endsWith(\"ly\") && w.length > 4) w = w.slice(0, -2);\n    return w;\n}\n","/**\n * Search tokenizer.\n *\n * Handles mixed Latin + CJK content — the single biggest quality lever\n * over plain substring search. Latin is split on non-word boundaries;\n * CJK (no spaces) is word-segmented via Intl.Segmenter (CLDR dictionary),\n * falling back to overlapping bigrams on out-of-vocabulary text so a query\n * like \"身份验证\" still scores against doc text \"身份验证流程\".\n *\n * CJK segmentation is a SINGLE segment() pass over the whole text, not one\n * call per CJK run: a segment() call has fixed overhead (~3µs), and\n * run-heavy text (logs: dozens of short runs per line) made per-run calls\n * 10-16× slower than one bulk pass. ICU never merges CJK words across\n * non-CJK boundaries, so bulk segmentation yields the same words per run\n * (differential-verified against the per-run implementation across a\n * mixed-script stress corpus); run boundaries are re-derived below to keep\n * the all-OOV bigram fallback.\n */\n\n/**\n * CJK ideograph/kana/hangul class — the one shared definition of \"non-Latin\n * script that must be handled specially\". Exported so fuzzy.ts relaxes its\n * short-query gate for the SAME range tokenizer.ts segments: two hand-copied\n * regexes would silently drift apart. Latin is deliberately absent — 2-char\n * English tokens (\"to\", \"of\") carry no meaning, while nearly all CJK words\n * are 2-char atomic units (登录/缓存), so the two scripts need opposite rules.\n */\nimport { stem } from \"./stemmer.js\";\n\nexport const CJK = /[\\u3400-\\u9fff\\uf900-\\ufaff\\u3040-\\u30ff\\uac00-\\ud7af]/;\nconst LATIN_WORD = /[a-z][a-z0-9_]*[a-z0-9]|[a-z0-9]/g;\n\nconst cjkSegmenter = new Intl.Segmenter(\"zh\", { granularity: \"word\" });\n\n/**\n * CJK segment groups → tokens, with the all-OOV fallback.\n *\n * `segs` are the word segments the segmenter produced for ONE contiguous\n * CJK run. Multi-char words are kept as whole terms, so \"国际化\" matches\n * \"国际化\" and \"试验证明\" no longer scores against \"验证\" through accidental\n * char runs. When the dictionary finds no multi-char word at all (all-OOV\n * text) we fall back to overlapping bigrams + single chars so recall is\n * preserved — this also covers single-char queries like \"验\".\n */\nfunction cjkRunTokens(segs: string[]): string[] {\n    const words = segs.filter((w) => w.length >= 2);\n    if (words.length > 0) return words;\n    const run = segs.join(\"\");\n    const out: string[] = [];\n    for (let i = 0; i < run.length - 1; i++) out.push(run.slice(i, i + 2));\n    for (const ch of run) out.push(ch);\n    return out;\n}\n\nexport interface TokenizeOptions {\n    stem?: boolean;\n}\n\nexport function tokenize(text: string, opts: TokenizeOptions = {}): string[] {\n    const lower = text.toLowerCase();\n    const tokens: string[] = [];\n\n    const latin = lower.match(LATIN_WORD) ?? [];\n    for (let w of latin) {\n        if (w.length >= 2) {\n            if (opts.stem) w = stem(w);\n            tokens.push(w);\n        }\n    }\n\n    // CJK: one segmenter pass over the whole text instead of one\n    // segment() call per CJK run. A segment() call has fixed overhead\n    // (~3µs), and run-heavy text (logs: dozens of short runs per line) made\n    // per-run calls 10-16× slower than one bulk pass. ICU never merges CJK\n    // words across non-CJK boundaries, so bulk segmentation yields the same\n    // words per run (differential-verified against the per-run\n    // implementation across a mixed-script stress corpus); run boundaries\n    // are re-derived below to keep the all-OOV bigram fallback.\n    //\n    // Guard: skip the segmenter entirely when the text has no CJK at all —\n    // the old code never called it for pure-Latin text, and a bulk pass\n    // would pay a full-text scan (12ms → 33ms per MB of English) for nothing.\n    if (!CJK.test(lower)) return tokens;\n\n    // Group the bulk segments back into CJK runs: a non-CJK segment is a run\n    // boundary (the segmenter never puts non-CJK inside a CJK word segment).\n    const runSegs: string[][] = [];\n    let cur: string[] | null = null;\n    for (const s of cjkSegmenter.segment(lower)) {\n        const t = s.segment;\n        if (t.length === 0) continue;\n        if (CJK.test(t)) {\n            (cur ??= []).push(t);\n        } else if (cur) {\n            runSegs.push(cur);\n            cur = null;\n        }\n    }\n    if (cur) runSegs.push(cur);\n\n    for (const segs of runSegs) {\n        tokens.push(...cjkRunTokens(segs));\n    }\n\n    return tokens;\n}\n\n/** Character bigrams over arbitrary text — used by fuzzy matching. */\nexport function charBigrams(text: string): string[] {\n    const grams: string[] = [];\n    for (let i = 0; i < text.length - 1; i++) {\n        const pair = text.slice(i, i + 2);\n        if (pair.trim().length === pair.length) grams.push(pair);\n    }\n    return grams;\n}\n\n/** Term-frequency map. */\nexport function tfMap(text: string, stem: boolean): Map<string, number> {\n    const m = new Map<string, number>();\n    for (const t of tokenize(text, { stem })) m.set(t, (m.get(t) ?? 0) + 1);\n    return m;\n}\n","/**\n * Per-doc derived features, memoized across search calls.\n *\n * A search over the compressed history re-scores the SAME immutable docs on\n * every call — compressed block summaries and folded message text never\n * change. Without this cache, every search_context call re-tokenized the\n * entire corpus (segmenter CJK pass ≈ 0.3s/MB cold) plus re-lowercased it\n * and rebuilt the bigram set for each channel: a 5MB session cost ~3s PER\n * CALL, growing linearly with session length. With the cache the corpus is\n * processed once; later searches are O(docs × query-terms).\n *\n * Keyed by doc text (immutable). Bounded by total cached source chars —\n * oldest docs are evicted when the cap is exceeded, so a long-lived\n * process serving many sessions cannot grow unboundedly. Hosts that want to\n * release the memory eagerly on session shutdown/switch can call\n * clearDocFeatures() (optional: the cap already bounds it).\n */\n\nimport { charBigrams, tfMap } from \"./tokenizer.js\";\n\nexport interface DocFeatures {\n    /** Stemmed term frequencies (BM25 channel). */\n    tf: Map<string, number>;\n    /** Total term count (BM25 length normalization). */\n    len: number;\n    /** Lower-cased text (substring + fuzzy channels). */\n    lower: string;\n    /** Unique char bigrams of `lower` (fuzzy channel). */\n    grams: Set<string>;\n}\n\nconst DEFAULT_CAP_CHARS = 8 * 1024 * 1024;\nlet capChars = DEFAULT_CAP_CHARS;\nconst cache = new Map<string, DocFeatures>();\nlet cachedChars = 0;\n\nfunction build(text: string): DocFeatures {\n    const tf = tfMap(text, true);\n    let len = 0;\n    for (const v of tf.values()) len += v;\n    const lower = text.toLowerCase();\n    return { tf, len, lower, grams: new Set(charBigrams(lower)) };\n}\n\nexport function docFeatures(text: string): DocFeatures {\n    const hit = cache.get(text);\n    if (hit) return hit;\n    const f = build(text);\n    if (text.length > 0 && text.length <= capChars) {\n        while (cachedChars + text.length > capChars && cache.size > 0) {\n            const k = cache.keys().next().value as string;\n            cachedChars -= k.length;\n            cache.delete(k);\n        }\n        cache.set(text, f);\n        cachedChars += text.length;\n    }\n    return f;\n}\n\n/** Drop all cached features (e.g. on session shutdown/switch). */\nexport function clearDocFeatures(): void {\n    cache.clear();\n    cachedChars = 0;\n}\n\n/**\n * Set the cache cap in source chars. Docs larger than the cap are never\n * cached. Also used by tests to exercise eviction.\n */\nexport function setDocCacheCap(chars: number): void {\n    capChars = Math.max(1, chars);\n    while (cachedChars > capChars && cache.size > 0) {\n        const k = cache.keys().next().value as string;\n        cachedChars -= k.length;\n        cache.delete(k);\n    }\n}\n\n/** Cache occupancy — for diagnostics. */\nexport function docCacheInfo(): { entries: number; chars: number } {\n    return { entries: cache.size, chars: cachedChars };\n}\n","import type { SearchAlgorithm, SearchDoc, ScoredBlock } from \"../types.js\";\nimport { docFeatures } from \"../doc-cache.js\";\n\n/**\n * Substring counting — the original baseline algorithm.\n * Exact, lowercased substring occurrence counts. Predictable but blind to\n * morphology, typos, and CJK word boundaries. Kept for backward compat and\n * as a deterministic reference.\n */\nexport const substringAlgorithm: SearchAlgorithm = {\n    name: \"substring\",\n    description: \"Exact substring counting (original baseline). Predictable, no normalization.\",\n    score(docs: SearchDoc[], query: string): ScoredBlock[] {\n        const terms = query.toLowerCase().trim().split(/\\s+/).filter((t) => t.length > 0);\n        if (terms.length === 0) return docs.map((d) => ({ ref: d.ref, score: 0 }));\n        return docs.map((d) => {\n            const haystack = docFeatures(d.text).lower; // memoized across calls\n            let score = 0;\n            for (const term of terms) score += countOccurrences(haystack, term);\n            return { ref: d.ref, score };\n        });\n    },\n};\n\nfunction countOccurrences(haystack: string, needle: string): number {\n    if (!needle) return 0;\n    return haystack.split(needle).length - 1;\n}\n","import type { SearchAlgorithm, SearchDoc, ScoredBlock } from \"../types.js\";\nimport { tokenize } from \"../tokenizer.js\";\nimport { docFeatures } from \"../doc-cache.js\";\n\n/**\n * BM25 with stemming + CJK bigram tokenization.\n *\n * k1=1.2, b=0.75 (standard IR). IDF down-weights terms common across the\n * corpus; length normalization prevents long summaries from dominating by\n * raw term count. Stemming collapses English morphology\n * (compress/compressed/compression → ~compress).\n *\n * On the 32-block mixed EN/CJK benchmark: MRR 0.833 / R@1 0.833 / R@3 0.833\n * vs 0.797 / 0.792 / 0.792 for substring — better in isolation on every\n * metric, and the precision component of the hybrid default (see hybrid.ts).\n */\nexport const bm25Algorithm: SearchAlgorithm = {\n    name: \"bm25\",\n    description: \"BM25 with stemming + CJK bigram tokenization. IR-standard relevance ranking.\",\n    score(docs: SearchDoc[], query: string): ScoredBlock[] {\n        const N = docs.length;\n        const k1 = 1.2;\n        const b = 0.75;\n        const parsed = docs.map((d) => {\n            const f = docFeatures(d.text); // memoized: tf + length, cached across calls\n            return { id: d.ref, tf: f.tf, len: f.len };\n        });\n        const avgdl = parsed.reduce((s, d) => s + d.len, 0) / (N || 1);\n\n        const qTerms = tokenize(query, { stem: true });\n        if (qTerms.length === 0) return docs.map((d) => ({ ref: d.ref, score: 0 }));\n\n        const idf = new Map<string, number>();\n        for (const t of new Set(qTerms)) {\n            let df = 0;\n            for (const d of parsed) if (d.tf.has(t)) df++;\n            idf.set(t, Math.log(1 + (N - df + 0.5) / (df + 0.5)));\n        }\n\n        return parsed.map((d) => {\n            let score = 0;\n            for (const t of qTerms) {\n                const f = d.tf.get(t) ?? 0;\n                if (f === 0) continue;\n                const idfT = idf.get(t) ?? 0;\n                score += (idfT * (f * (k1 + 1))) / (f + k1 * (1 - b + (b * d.len) / (avgdl || 1)));\n            }\n            return { ref: d.id, score };\n        });\n    },\n};\n","import type { SearchAlgorithm, SearchDoc, ScoredBlock } from \"../types.js\";\nimport { charBigrams, CJK } from \"../tokenizer.js\";\nimport { docFeatures } from \"../doc-cache.js\";\n\n/**\n * Fuzzy character-bigram matching (Jaccard-style).\n *\n * Decomposes the query into character bigrams and measures overlap with\n * each doc. Robust to typos (tokan≈token), partial words, and works\n * uniformly across all scripts (CJK benefits most).\n *\n * Query-token gate — CJK gets its own length rule; Latin is frozen:\n *   length >= 4 (any script)   typo-tolerant bigram rescue needs a couple of\n *       chars before it means anything; 2-3-char Latin tokens (\"to\", \"of\",\n *       \"us\") are stop-word noise whose bigrams overlap nearly every doc.\n *   length >= 2 && CJK         Chinese/Japanese/Korean words are mostly\n *       2-character atomic units (登录/缓存/図表), so the Latin-style >= 4 rule\n *       would lock the whole CJK query space out of this recall channel\n *       (that gap is what bench \"缓存 → nothing\" exposed). Single CJK chars\n *       stay excluded — one char cannot form a bigram, nothing to compare.\n *\n * On benchmark: lowest MRR of any single algorithm (0.795 — a hair under\n * substring's 0.797) — precision is weak, but it is the recall boost in the\n * hybrid default.\n */\nexport const fuzzyAlgorithm: SearchAlgorithm = {\n    name: \"fuzzy\",\n    description: \"Character bigram overlap. Typo-tolerant, script-agnostic, high recall.\",\n    score(docs: SearchDoc[], query: string): ScoredBlock[] {\n        // Gate (see header): Latin short tokens are noise, 2-char CJK words\n        // are real terms — admit the latter so 缓存/登录 reach the scorer.\n        const qTokens = query.toLowerCase().split(/[\\s,]+/).filter((t) => t.length >= 4 || (t.length >= 2 && CJK.test(t)));\n        if (qTokens.length === 0) return docs.map((d) => ({ ref: d.ref, score: 0 }));\n\n        const qGrams = new Set<string>();\n        for (const t of qTokens) for (const g of charBigrams(t)) qGrams.add(g);\n        if (qGrams.size === 0) return docs.map((d) => ({ ref: d.ref, score: 0 }));\n\n        return docs.map((d) => {\n            const docGrams = docFeatures(d.text).grams; // memoized bigram set\n            let hits = 0;\n            for (const g of qGrams) if (docGrams.has(g)) hits++;\n            return { ref: d.ref, score: hits / qGrams.size };\n        });\n    },\n};\n","import type { SearchAlgorithm, SearchDoc, ScoredBlock } from \"../types.js\";\nimport { bm25Algorithm } from \"./bm25.js\";\nimport { fuzzyAlgorithm } from \"./fuzzy.js\";\n\n/**\n * Hybrid: normalized BM25(stem) + fuzzy n-gram, weighted 0.7 / 0.3.\n *\n * BM25 supplies precision on real terms (with morphology + IDF + length\n * norm); fuzzy supplies recall on typos, partials, and cross-script.\n * Each component is max-normalized to [0,1] before weighting so their\n * scales are comparable regardless of corpus size.\n *\n * Benchmark (32 blocks, 48 mixed EN/CJK queries, final code — segmenter\n * tokenizer + CJK fuzzy gate):\n *   substring  MRR 0.797  R@1 0.792  R@3 0.792\n *   bm25       MRR 0.833  R@1 0.833  R@3 0.833\n *   fuzzy      MRR 0.795  R@1 0.708  R@3 0.875\n *   hybrid     MRR 0.898  R@1 0.875  R@3 0.917   ← best on every metric\n * The weight ratio is robust: 0.6–0.8 for BM25 all score within 0.001 MRR.\n */\n\nconst W_BM25 = 0.7;\nconst W_FUZZY = 0.3;\n\nexport const hybridAlgorithm: SearchAlgorithm = {\n    name: \"hybrid\",\n    description: \"Weighted BM25(stem) + fuzzy n-gram. Default — best precision + recall.\",\n    score(docs: SearchDoc[], query: string): ScoredBlock[] {\n        const bm = bm25Algorithm.score(docs, query);\n        const fz = fuzzyAlgorithm.score(docs, query);\n        const maxBm = Math.max(...bm.map((r) => r.score), 1e-9);\n        const maxFz = Math.max(...fz.map((r) => r.score), 1e-9);\n        const bmMap = new Map(bm.map((r) => [r.ref, r.score / maxBm]));\n        const fzMap = new Map(fz.map((r) => [r.ref, r.score / maxFz]));\n        return docs.map((d) => ({\n            ref: d.ref,\n            score: W_BM25 * (bmMap.get(d.ref) ?? 0) + W_FUZZY * (fzMap.get(d.ref) ?? 0),\n        }));\n    },\n};\n","/**\n * Algorithm registry. Builtins are pre-registered; hosts may register\n * additional algorithms (e.g. an embedding-based semantic provider) via\n * registerSearchAlgorithm and reference them by name in SearchOptions.\n */\nimport type { AnySearchAlgorithm } from \"./types.js\";\nimport { substringAlgorithm } from \"./algorithms/substring.js\";\nimport { bm25Algorithm } from \"./algorithms/bm25.js\";\nimport { fuzzyAlgorithm } from \"./algorithms/fuzzy.js\";\nimport { hybridAlgorithm } from \"./algorithms/hybrid.js\";\n\nconst registry = new Map<string, AnySearchAlgorithm>();\n\nexport function registerSearchAlgorithm(algo: AnySearchAlgorithm): void {\n    registry.set(algo.name, algo);\n}\n\nexport function getSearchAlgorithm(name: string): AnySearchAlgorithm | undefined {\n    return registry.get(name);\n}\n\nexport function listSearchAlgorithms(): AnySearchAlgorithm[] {\n    return [...registry.values()];\n}\n\n// Pre-register builtins. Hybrid is the default (see types.ts DEFAULT_ALGORITHM).\nregisterSearchAlgorithm(substringAlgorithm);\nregisterSearchAlgorithm(bm25Algorithm);\nregisterSearchAlgorithm(fuzzyAlgorithm);\nregisterSearchAlgorithm(hybridAlgorithm);\n","/**\n * Search type definitions.\n *\n * Two data sources are searchable:\n *  - Compressed blocks (summary text; ref = \"b{id}\")\n *  - Historical messages (original text from the append-only session log;\n *    ref = \"m{NNNNN}\"). These let the model locate detail that compression\n *    turned into a short summary — search to pinpoint, then decompress the\n *    owning block for the full content.\n *\n * A SearchAlgorithm is a stateless scorer over a unified SearchDoc[]. Roles\n * carry a configurable weight (user intent > assistant reasoning > tool noise).\n */\n\n/** Where a searchable document came from. */\nexport type SearchDocKind = \"block\" | \"message\";\n\nexport type MessageRole = \"user\" | \"assistant\" | \"tool\";\n\n/** A unified searchable document — either a block summary or a message. */\nexport interface SearchDoc {\n    kind: SearchDocKind;\n    /** Stable ref for decompress: \"b3\" for a block, \"m00350\" for a message. */\n    ref: string;\n    /** Text this doc is scored against (topic+summary for blocks; content for messages). */\n    text: string;\n    /** For preview/title display. */\n    title: string;\n    /** Message role (messages only); undefined for blocks. Drives role weighting. */\n    role?: MessageRole;\n    /** Block owning this doc. For blocks: the block itself. For messages: the block\n     *  that compressed it (so the model knows which block to decompress for detail). */\n    blockId?: string;\n    /** Tier of the owning block (display + grouping). */\n    tier?: number;\n    /** Approx token size (for \"how big is this\" display). */\n    tokens?: number;\n}\n\n/** Per-role score multipliers. Defaults favor user intent over tool noise. */\nexport interface RoleWeights {\n    user?: number;\n    assistant?: number;\n    tool?: number;\n    block?: number;\n}\n\nexport const DEFAULT_ROLE_WEIGHTS: Required<RoleWeights> = {\n    user: 1.5,\n    assistant: 1.0,\n    tool: 0.6,\n    block: 1.0,\n};\n\nexport interface ScoredBlock {\n    ref: string;\n    score: number;\n}\n\nexport interface SearchAlgorithm {\n    name: string;\n    description: string;\n    score(docs: SearchDoc[], query: string): ScoredBlock[];\n}\n\nexport interface AsyncSearchAlgorithm {\n    name: string;\n    description: string;\n    score(docs: SearchDoc[], query: string): Promise<ScoredBlock[]>;\n}\n\nexport type AnySearchAlgorithm = SearchAlgorithm | AsyncSearchAlgorithm;\n\nexport interface SearchResult {\n    /** \"block\" or \"message\". */\n    kind: SearchDocKind;\n    /** Ref to pass to decompress: \"b3\" or \"m00350\". */\n    ref: string;\n    /** Owning block id (for messages: the block that compressed it). */\n    blockId?: string;\n    tier: number;\n    score: number;\n    title: string;\n    preview: string;\n    role?: MessageRole;\n    tokens?: number;\n}\n\nexport interface SearchOptions {\n    algorithm?: string;\n    limit?: number;\n    previewLength?: number;\n    minScore?: number;\n    /** Per-role weights (default DEFAULT_ROLE_WEIGHTS). */\n    roleWeights?: RoleWeights;\n}\n\n/** Host-supplied historical message, turned into a message SearchDoc. */\nexport interface MessageInput {\n    ref: string;\n    role: MessageRole;\n    text: string;\n    tokens?: number;\n    /** Block id that compressed this message (undefined if still visible). */\n    blockId?: string;\n    tier?: number;\n}\n\nexport const DEFAULT_ALGORITHM = \"hybrid\";\n","/**\n * searchBlocks — public search entry point.\n *\n * Scores a unified document set (block summaries + historical messages)\n * and returns ranked results. The model uses search to cheaply locate\n * detail that compression folded into summaries, then decompresses the\n * owning block for the full content.\n *\n * Two entry points:\n *  - searchBlocks()      — sync. Works for all lexical algorithms.\n *  - searchBlocksAsync() — async. Also supports embedding-based semantic\n *                          algorithms whose score() returns a Promise.\n */\n\nimport type { CompressionState, CompressionBlock } from \"../types.js\";\nimport { getSearchAlgorithm } from \"./registry.js\";\nimport type { SearchDoc, ScoredBlock, MessageInput } from \"./types.js\";\nimport type { SearchResult, SearchOptions, RoleWeights } from \"./types.js\";\nimport { DEFAULT_ALGORITHM, DEFAULT_ROLE_WEIGHTS } from \"./types.js\";\n\n/** Build SearchDoc[] from all blocks (active AND inactive) of the state. */\nexport function blockDocs(state: CompressionState): SearchDoc[] {\n    return state.blocks.map((b: CompressionBlock): SearchDoc => ({\n        kind: \"block\",\n        ref: b.blockId,\n        text: `${b.topic ?? \"\"} ${b.summary ?? \"\"}`,\n        title: b.topic ?? b.blockId,\n        blockId: b.blockId,\n        tier: b.tier ?? 1,\n        tokens: b.compressedTokens,\n    }));\n}\n\n/**\n * Build SearchDoc[] from historical messages supplied by the host. The host\n * (pai-acp) reads these from the append-only session log — they include the\n * original text of messages that compression later folded into block summaries.\n *\n * `ownerOf(ref)` maps a message ref to the block id that compressed it, so a\n * message hit tells the model exactly which block to decompress for detail.\n */\nexport function messageDocs(msgs: MessageInput[]): SearchDoc[] {\n    return msgs.map((m): SearchDoc => ({\n        kind: \"message\",\n        ref: m.ref,\n        text: m.text,\n        title: `${m.role}: ${m.text.slice(0, 60)}`,\n        role: m.role,\n        blockId: m.blockId,\n        tier: m.tier,\n        tokens: m.tokens,\n    }));\n}\n\nfunction applyRoleWeight(scored: ScoredBlock[], docs: SearchDoc[], rw: Required<RoleWeights>): ScoredBlock[] {\n    if (docs.length === 0) return scored;\n    const docByRef = new Map(docs.map((d) => [d.ref, d]));\n    return scored.map((s) => {\n        const doc = docByRef.get(s.ref);\n        if (!doc) return s;\n        const w =\n            doc.kind === \"message\"\n                ? doc.role === \"user\"\n                    ? rw.user\n                    : doc.role === \"assistant\"\n                      ? rw.assistant\n                      : rw.tool\n                : rw.block;\n        return { ref: s.ref, score: s.score * w };\n    });\n}\n\nfunction runSearch(\n    docs: SearchDoc[],\n    query: string,\n    options: SearchOptions,\n): SearchResult[] | Promise<SearchResult[]> {\n    const limit = options.limit ?? 10;\n    const previewLength = options.previewLength ?? 200;\n    const minScore = options.minScore ?? 0.01;\n    const algoName = options.algorithm ?? DEFAULT_ALGORITHM;\n    const rw = { ...DEFAULT_ROLE_WEIGHTS, ...options.roleWeights };\n\n    const algo = getSearchAlgorithm(algoName);\n    if (!algo) return [];\n    if (docs.length === 0) return [];\n\n    const scoredOrPromise = algo.score(docs, query);\n\n    const buildResults = (weighted: ScoredBlock[]): SearchResult[] => {\n        const byRef = new Map(docs.map((d) => [d.ref, d]));\n        return weighted\n            .map((s): SearchResult | null => {\n                const doc = byRef.get(s.ref);\n                if (!doc) return null;\n                return {\n                    kind: doc.kind,\n                    ref: doc.ref,\n                    blockId: doc.blockId,\n                    tier: doc.tier ?? 1,\n                    score: s.score,\n                    title: doc.title,\n                    preview: makePreview(doc.text, query, previewLength),\n                    role: doc.role,\n                    tokens: doc.tokens,\n                };\n            })\n            .filter((r): r is SearchResult => r !== null && r.score >= minScore)\n            .sort((a, b) => b.score - a.score)\n            .slice(0, limit);\n    };\n\n    if (scoredOrPromise instanceof Promise) {\n        return scoredOrPromise.then((raw) => buildResults(applyRoleWeight(raw, docs, rw)));\n    }\n    return buildResults(applyRoleWeight(scoredOrPromise, docs, rw));\n}\n\n/** Sync entry — throws for async algorithms. Pass docs from blockDocs() + messageDocs(). */\nexport function searchBlocks(docs: SearchDoc[], query: string, options: SearchOptions = {}): SearchResult[] {\n    const result = runSearch(docs, query, options);\n    if (result instanceof Promise) {\n        throw new Error(\n            `searchBlocks: algorithm \"${options.algorithm ?? DEFAULT_ALGORITHM}\" is async (e.g. semantic). Use searchBlocksAsync() instead.`,\n        );\n    }\n    return result;\n}\n\nexport { clearDocFeatures, docCacheInfo, docFeatures, setDocCacheCap } from \"./doc-cache.js\";\nexport type { DocFeatures } from \"./doc-cache.js\";\n\nexport async function searchBlocksAsync(docs: SearchDoc[], query: string, options: SearchOptions = {}): Promise<SearchResult[]> {\n    return await runSearch(docs, query, options);\n}\n\n/**\n * Preview centered on the first query-term hit (case-insensitive).\n * Falls back to the head when no term hits.\n */\nfunction makePreview(text: string, query: string, len: number): string {\n    if (!text) return \"\";\n    const terms = query.toLowerCase().trim().split(/\\s+/).filter((t) => t.length > 1);\n    if (terms.length === 0) return text.slice(0, len);\n\n    const lower = text.toLowerCase();\n    let hitIdx = -1;\n    for (const term of terms) {\n        const idx = lower.indexOf(term);\n        if (idx >= 0) {\n            hitIdx = idx;\n            break;\n        }\n    }\n\n    if (hitIdx < 0) return text.slice(0, len);\n\n    const half = Math.max(0, Math.floor(len / 2) - 10);\n    const start = Math.max(0, hitIdx - half);\n    const end = Math.min(text.length, start + len);\n    const prefix = start > 0 ? \"…\" : \"\";\n    const suffix = end < text.length ? \"…\" : \"\";\n    return prefix + text.slice(start, end).trim() + suffix;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAEA,IAAM,YAAY;AAClB,IAAM,YAAY;AAClB,IAAM,YAAY;AAClB,IAAM,cAAc;AAEb,IAAM,cAAc;AAEpB,SAAS,cAA6B;AAC3C,SAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAChC;AAEO,SAAS,WAAW,OAAuB;AAChD,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,aAAa,QAAQ,WAAW;AACtE,UAAM,IAAI;AAAA,MACR,4BAA4B,KAAK,aAAa,SAAS,IAAI,SAAS;AAAA,IACtE;AAAA,EACF;AACA,SAAO,IAAI,OAAO,KAAK,EAAE,SAAS,WAAW,GAAG,CAAC;AACnD;AAEO,SAAS,WAAW,KAA4B;AACrD,QAAM,QAAQ,YAAY,KAAK,IAAI,KAAK,EAAE,YAAY,CAAC;AACvD,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,QAAQ,OAAO,MAAM,CAAC,CAAC;AAC7B,MAAI,QAAQ,aAAa,QAAQ,UAAW,QAAO;AACnD,SAAO;AACT;AAEO,SAAS,UAAU,KAAoB,OAA8B;AAC1E,SAAO,IAAI,MAAM,KAAK,KAAK;AAC7B;AAEO,SAAS,UAAU,KAAoB,KAA4B;AACxE,SAAO,IAAI,MAAM,GAAG,KAAK;AAC3B;AAeO,SAAS,WACd,UACA,SACkB;AAClB,QAAM,MAAqB;AAAA,IACzB,OAAO,EAAE,GAAG,QAAQ,SAAS,MAAM;AAAA,IACnC,OAAO,EAAE,GAAG,QAAQ,SAAS,MAAM;AAAA,EACrC;AACA,MAAI,SACF,OAAO,UAAU,QAAQ,SAAS,KAAK,QAAQ,aAAa,YACxD,QAAQ,YACR;AACN,MAAI,gBAAgB;AAEpB,aAAW,WAAW,UAAU;AAC9B,QAAI,CAAC,QAAQ,MAAM,QAAQ,aAAa,OAAO,EAAG;AAElD,QAAI,IAAI,MAAM,QAAQ,EAAE,EAAG;AAE3B,QAAI,QAAQ,cAAc,OAAO,GAAG;AAClC,UAAI,MAAM,QAAQ,EAAE,IAAI;AACxB;AAAA,IACF;AAEA,UAAM,MAAM,gBAAgB,KAAK,MAAM;AACvC,aAAS,IAAI,QAAQ;AACrB,QAAI,MAAM,QAAQ,EAAE,IAAI,IAAI;AAC5B,QAAI,MAAM,IAAI,IAAI,IAAI,QAAQ;AAC9B;AAAA,EACF;AAEA,SAAO,EAAE,KAAK,WAAW,QAAQ,cAAc;AACjD;AAEA,SAAS,gBACP,KACA,OACiC;AACjC,MAAI,YAAY,KAAK,IAAI,OAAO,SAAS;AACzC,SAAO,aAAa,WAAW;AAC7B,UAAM,OAAO,WAAW,SAAS;AACjC,QAAI,CAAC,IAAI,MAAM,IAAI,GAAG;AACpB,aAAO,EAAE,MAAM,OAAO,UAAU;AAAA,IAClC;AACA;AAAA,EACF;AACA,QAAM,IAAI;AAAA,IACR,kDAAkD,WAAW,SAAS,CAAC;AAAA,EACzE;AACF;AAUO,SAAS,iBAAiB,KAA4B;AAC3D,MAAI,UAAU;AACd,aAAW,OAAO,OAAO,OAAO,IAAI,KAAK,GAAG;AAC1C,UAAM,QAAQ,QAAQ,cAAc,OAAO,WAAW,GAAG;AACzD,QAAI,UAAU,QAAQ,QAAQ,QAAS,WAAU;AAAA,EACnD;AACA,SAAO;AACT;;;ACnHO,SAAS,qBAAuC;AACrD,SAAO;AAAA,IACL,QAAQ,CAAC;AAAA,IACT,aAAa,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,IACpC,eAAe,CAAC;AAAA,IAChB,OAAO;AAAA,MACL,2BAA2B;AAAA,MAC3B,sBAAsB;AAAA,MACtB,gBAAgB;AAAA,MAChB,SAAS,CAAC;AAAA,MACV,iBAAiB,CAAC;AAAA,IACpB;AAAA,IACA,OAAO,EAAE,kBAAkB,GAAG,kBAAkB,EAAE;AAAA,IAClD,aAAa;AAAA,IACb,WAAW;AAAA,EACb;AACF;AAEO,SAAS,gBAAgB,OAAiC;AAC/D,QAAM,KAAK,MAAM;AACjB,QAAM,cAAc,KAAK,IAAI,GAAG,EAAE,IAAI;AACtC,SAAO,IAAI,EAAE;AACf;AAEO,SAAS,cAAc,OAAiC;AAC7D,QAAM,KAAK,MAAM;AACjB,QAAM,YAAY,KAAK,IAAI,GAAG,EAAE,IAAI;AACpC,SAAO,IAAI,EAAE;AACf;AAEO,SAAS,UACd,OACA,SAC8B;AAC9B,SAAO,MAAM,OAAO,KAAK,CAAC,UAAU,MAAM,YAAY,OAAO;AAC/D;AAEO,SAAS,aAAa,OAA6C;AACxE,SAAO,MAAM,OAAO,OAAO,CAAC,UAAU,MAAM,MAAM;AACpD;AAEO,SAAS,kBAAkB,OAAsC;AACtE,QAAM,UAAU,oBAAI,IAAY;AAChC,aAAW,SAAS,MAAM,QAAQ;AAChC,QAAI,CAAC,MAAM,OAAQ;AACnB,eAAW,MAAM,MAAM,oBAAqB,SAAQ,IAAI,EAAE;AAAA,EAC5D;AACA,SAAO;AACT;AAEO,SAAS,kBAAkB,OAAwC;AACxE,MAAI,UAAyB;AAC7B,aAAW,SAAS,MAAM,QAAQ;AAChC,QAAI,MAAM,UAAU,MAAM,OAAO,QAAS,WAAU,MAAM;AAAA,EAC5D;AACA,SAAO;AACT;AAEO,SAAS,gBACd,OACA,oBACM;AACN,aAAW,SAAS,MAAM,QAAQ;AAChC,QAAI,CAAC,MAAM,OAAQ;AACnB,UAAM,iBAAiB;AACvB,QAAI,MAAM,iBAAiB,oBAAoB;AAC7C,YAAM,aAAa;AAAA,IACrB;AAAA,EACF;AACF;;;ACpEO,IAAM,iBAAiB;AAK9B,IAAM,oBAAoB;AAQnB,SAAS,iBAAiB,SAAyB;AACxD,SAAO,GAAG,iBAAiB,GAAG,OAAO;AACvC;AAEO,SAAS,mBAAmB,IAAqB;AACtD,SAAO,GAAG,WAAW,iBAAiB;AACxC;AAQO,SAAS,yBACd,SACS;AACT,SACE,mBAAmB,QAAQ,EAAE,KAC7B,QAAQ,SAAS,YACjB,QAAQ,gBAAgB;AAE5B;AAMO,SAAS,MACd,UACA,OACA,UAAwB,CAAC,GACV;AACf,QAAM,UAAU,kBAAkB,KAAK;AACvC,MAAI,QAAQ,SAAS,EAAG,QAAO,CAAC,GAAG,QAAQ;AAE3C,QAAM,SAAS,QAAQ,mBAAmB;AAC1C,QAAM,iBAAiB,SAAS;AAAA,IAC9B,CAAC,YAAY,QAAQ,SAAS;AAAA,EAChC;AAEA,QAAM,YAAY,oBAAI,IAAoB;AAC1C,QAAM,mBAAmB,oBAAI,IAAoB;AACjD,WAAS,QAAQ,CAAC,SAAS,UAAU;AACnC,cAAU,IAAI,QAAQ,IAAI,KAAK;AAC/B,QAAI,yBAAyB,OAAO;AAClC,uBAAiB,IAAI,QAAQ,IAAI,KAAK;AAAA,EAC1C,CAAC;AAED,QAAM,UAAU,SACZ,sBAAsB,OAAO,WAAW,gBAAgB,IACxD,CAAC;AAEL,SAAO;AAAA,IACL;AAAA,MACE;AAAA,QACE,gBAAgB,UAAU,SAAS,gBAAgB,OAAO;AAAA,MAC5D;AAAA,IACF;AAAA,EACF;AACF;AASA,SAAS,sBACP,OACA,WACA,kBACiB;AACjB,QAAM,UAA2B,CAAC;AAClC,aAAW,SAAS,aAAa,KAAK,GAAG;AAIvC,UAAM,gBAAgB,iBAAiB,IAAI,iBAAiB,MAAM,OAAO,CAAC;AAC1E,QAAI,kBAAkB,QAAW;AAC/B,cAAQ,KAAK;AAAA,QACX,SAAS,MAAM;AAAA,QACf,SAAS,MAAM;AAAA,QACf,OAAO,MAAM;AAAA,QACb,UAAU;AAAA,MACZ,CAAC;AACD;AAAA,IACF;AACA,QAAI,WAA0B;AAC9B,eAAW,MAAM,MAAM,qBAAqB;AAC1C,YAAM,QAAQ,UAAU,IAAI,EAAE;AAC9B,UAAI,UAAU,WAAc,aAAa,QAAQ,QAAQ,WAAW;AAClE,mBAAW;AAAA,MACb;AAAA,IACF;AACA,YAAQ,KAAK;AAAA,MACX,SAAS,MAAM;AAAA,MACf,SAAS,MAAM;AAAA,MACf,OAAO,MAAM;AAAA,MACb,UAAU,YAAY;AAAA,IACxB,CAAC;AAAA,EACH;AACA,UAAQ,KAAK,CAAC,MAAM,UAAU,KAAK,WAAW,MAAM,QAAQ;AAC5D,SAAO;AACT;AAEA,SAAS,gBACP,UACA,SACA,gBACA,SACe;AACf,QAAM,SAAwB,CAAC;AAC/B,QAAM,UAAU,CAAC,GAAG,OAAO;AAC3B,QAAM,qBAAqB,IAAI;AAAA,IAC7B,QAAQ,IAAI,CAAC,WAAW,iBAAiB,OAAO,OAAO,CAAC;AAAA,EAC1D;AAEA,WAAS,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS;AACpD,WAAO,QAAQ,SAAS,KAAK,QAAQ,CAAC,EAAG,aAAa,OAAO;AAC3D,aAAO,KAAK,cAAc,QAAQ,MAAM,CAAE,CAAC;AAAA,IAC7C;AACA,QAAI,UAAU,kBAAkB,kBAAkB,GAAG;AACnD,aAAO,KAAK,SAAS,KAAK,CAAE;AAC5B;AAAA,IACF;AACA,QAAI,QAAQ,IAAI,SAAS,KAAK,EAAG,EAAE,EAAG;AAKtC,QACE,yBAAyB,SAAS,KAAK,CAAE,KACzC,mBAAmB,IAAI,SAAS,KAAK,EAAG,EAAE;AAE1C;AACF,WAAO,KAAK,SAAS,KAAK,CAAE;AAAA,EAC9B;AAEA,SAAO,QAAQ,SAAS,GAAG;AACzB,WAAO,KAAK,cAAc,QAAQ,MAAM,CAAE,CAAC;AAAA,EAC7C;AAEA,SAAO;AACT;AAEA,SAAS,cAAc,QAAoC;AACzD,QAAM,OAAO,OAAO,QAAQ,KAAK;AACjC,QAAM,YAAY,OAAO,QACrB,GAAG,cAAc,WAAM,OAAO,KAAK,KACnC;AACJ,QAAM,OAAO,KAAK,WAAW,IAAI,YAAY,GAAG,SAAS;AAAA,EAAK,IAAI;AAClE,SAAO;AAAA,IACL,IAAI,iBAAiB,OAAO,OAAO;AAAA,IACnC,MAAM;AAAA,IACN,aAAa;AAAA,IACb;AAAA,EACF;AACF;AAEA,SAAS,yBAAyB,UAAwC;AACxE,QAAM,eAAe,oBAAI,IAAY;AACrC,aAAW,KAAK,UAAU;AACxB,QAAI,EAAE,gBAAgB,eAAe,EAAE,YAAY;AACjD,mBAAa,IAAI,EAAE,UAAU;AAAA,IAC/B;AAAA,EACF;AACA,SAAO,SAAS;AAAA,IACd,CAAC,MACC,EAAE,gBAAgB,iBAClB,CAAC,EAAE,cACH,aAAa,IAAI,EAAE,UAAU;AAAA,EACjC;AACF;AAEA,SAAS,uBAAuB,UAAwC;AACtE,QAAM,iBAAiB,oBAAI,IAAY;AACvC,aAAW,KAAK,UAAU;AACxB,QAAI,EAAE,gBAAgB,iBAAiB,EAAE,YAAY;AACnD,qBAAe,IAAI,EAAE,UAAU;AAAA,IACjC;AAAA,EACF;AACA,SAAO,SAAS;AAAA,IACd,CAAC,MACC,EAAE,gBAAgB,eAClB,CAAC,EAAE,cACH,EAAE,aAAa,cACf,eAAe,IAAI,EAAE,UAAU;AAAA,EACnC;AACF;AAcA,SAAS,uBAAuB,UAAwC;AACtE,QAAM,OAAO,oBAAI,IAAY;AAC7B,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,QAAI,KAAK,IAAI,CAAC,EAAG;AACjB,QAAI,SAAS,CAAC,EAAG,gBAAgB,YAAa;AAC9C,QAAI,IAAI;AACR,WACE,IAAI,IAAI,SAAS,UACjB,SAAS,IAAI,CAAC,EAAG,gBAAgB,aACjC;AACA;AAAA,IACF;AACA,UAAM,YAAY,SAAS,IAAI,CAAC;AAChC,UAAM,eACJ,cAAc,UACd,UAAU,SAAS,gBAClB,UAAU,gBAAgB,UACzB,UAAU,gBAAgB;AAC9B,QAAI,CAAC,cAAc;AACjB,eAAS,IAAI,GAAG,KAAK,GAAG,IAAK,MAAK,IAAI,CAAC;AAAA,IACzC;AAAA,EACF;AACA,MAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,SAAO,SAAS,OAAO,CAAC,GAAG,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC;AAC/C;;;AC5OO,SAAS,WACd,UACA,OACY;AACZ,QAAM,aAAa,IAAI,IAAI,SAAS,IAAI,CAAC,YAAY,QAAQ,EAAE,CAAC;AAChE,QAAM,cAAwB,CAAC;AAK/B,QAAM,SAA2B;AAAA,IAC/B,QAAQ,MAAM,OAAO,IAAI,CAAC,WAAW;AAAA,MACnC,GAAG;AAAA,MACH,kBAAkB,CAAC,GAAG,MAAM,gBAAgB;AAAA,MAC5C,qBAAqB,CAAC,GAAG,MAAM,mBAAmB;AAAA,MAClD,gBAAgB,CAAC,GAAG,MAAM,cAAc;AAAA,IAC1C,EAAE;AAAA,IACF,aAAa;AAAA,MACX,OAAO,EAAE,GAAG,MAAM,YAAY,MAAM;AAAA,MACpC,OAAO,EAAE,GAAG,MAAM,YAAY,MAAM;AAAA,IACtC;AAAA;AAAA,IAEA,eAAe,EAAE,GAAI,MAAM,iBAAiB,CAAC,EAAG;AAAA,IAChD,OAAO,EAAE,GAAG,MAAM,OAAO,SAAS,EAAE,GAAG,MAAM,MAAM,QAAQ,EAAE;AAAA,IAC7D,OAAO,EAAE,GAAG,MAAM,MAAM;AAAA,IACxB,aAAa,MAAM;AAAA,IACnB,WAAW,MAAM;AAAA,EACnB;AAKA,QAAM,WAAW,IAAI;AAAA,IACnB,SACG,IAAI,CAAC,MAAM,OAAO,YAAY,MAAM,EAAE,EAAE,CAAC,EACzC,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AAAA,EACrD;AACA,MAAI,OAAO,KAAK,OAAO,aAAa,EAAE,WAAW,SAAS,MAAM;AAC9D,UAAM,SAAiC,CAAC;AACxC,eAAW,CAAC,KAAK,CAAC,KAAK,OAAO,QAAQ,OAAO,aAAa,GAAG;AAC3D,UAAI,SAAS,IAAI,GAAG,EAAG,QAAO,GAAG,IAAI;AAAA,IACvC;AACA,WAAO,gBAAgB;AAAA,EACzB;AAEA,QAAM,mBAAmB,oBAAI,IAAY;AACzC,aAAW,SAAS,OAAO,QAAQ;AACjC,eAAW,cAAc,MAAM,gBAAgB;AAC7C,uBAAiB,IAAI,UAAU;AAAA,IACjC;AAAA,EACF;AAEA,aAAW,SAAS,OAAO,QAAQ;AACjC,QAAI,iBAAiB,IAAI,MAAM,OAAO,GAAG;AACvC,YAAM,SAAS;AACf;AAAA,IACF;AACA,UAAM,SAAS;AAKf,UAAM,eACJ,MAAM,oBAAoB,KAAK,CAAC,OAAO,WAAW,IAAI,EAAE,CAAC,KACzD,WAAW,IAAI,iBAAiB,MAAM,OAAO,CAAC;AAChD,QAAI,CAAC,cAAc;AACjB,YAAM,SAAS;AACf,kBAAY,KAAK,MAAM,OAAO;AAAA,IAChC;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,QAAQ,YAAY;AACtC;;;AC9EO,SAAS,cACd,mBACA,YAA6B,CAAC,GACtB;AACR,QAAM,OAAe;AAAA,IACnB,OAAO,EAAE,SAAS,MAAM,cAAc,GAAG,cAAc,GAAG;AAAA,IAC1D,OAAO;AAAA,MACL,oBAAoB;AAAA,MACpB,oBAAoB;AAAA,MACpB,WAAW;AAAA,MACX,oBAAoB;AAAA,MACpB,OAAO;AAAA,MACP,aAAa;AAAA,MACb,aAAa;AAAA,MACb,WAAW;AAAA,MACX,gBAAgB;AAAA,MAChB,gBAAgB;AAAA,MAChB,uBAAuB;AAAA,MACvB,uBAAuB;AAAA,IACzB;AAAA,IACA,oBAAoB;AAAA,IACpB,UAAU,EAAE,WAAW,KAAK;AAAA,IAC5B,UAAU;AAAA,MACR,kBAAkB;AAAA,MAClB,kBAAkB;AAAA,MAClB,kBAAkB;AAAA,IACpB;AAAA,IACA,gBAAgB,CAAC;AAAA,IACjB,wBAAwB;AAAA,IACxB,sBAAsB;AAAA,IACtB;AAAA,EACF;AACA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAG;AAAA,IACH,OAAO,EAAE,GAAG,KAAK,OAAO,GAAG,UAAU,MAAM;AAAA,IAC3C,OAAO,EAAE,GAAG,KAAK,OAAO,GAAG,UAAU,MAAM;AAAA,IAC3C,UAAU,EAAE,GAAG,KAAK,UAAU,GAAG,UAAU,SAAS;AAAA,IACpD,UAAU,EAAE,GAAG,KAAK,UAAU,GAAG,UAAU,SAAS;AAAA,EACtD;AACF;AAEO,SAAS,eAAe,QAA0B;AACvD,QAAM,SAAmB,CAAC;AAC1B,MACE,CAAC,OAAO,SAAS,OAAO,iBAAiB,KACzC,OAAO,qBAAqB,GAC5B;AACA,WAAO,KAAK,6CAA6C;AAAA,EAC3D;AACA,MAAI,OAAO,MAAM,qBAAqB,OAAO,MAAM,oBAAoB;AACrE,WAAO;AAAA,MACL;AAAA,IACF;AAAA,EACF;AACA,MAAI,OAAO,MAAM,qBAAqB,OAAO,MAAM,uBAAuB;AACxE,WAAO;AAAA,MACL;AAAA,IACF;AAAA,EACF;AACA,MAAI,OAAO,qBAAqB,GAAG;AACjC,WAAO,KAAK,iCAAiC;AAAA,EAC/C;AACA,MAAI,OAAO,SAAS,aAAa,KAAK,OAAO,SAAS,YAAY,GAAG;AACnE,WAAO,KAAK,sCAAsC;AAAA,EACpD;AACA,aAAW,QAAQ,CAAC,OAAO,MAAM,cAAc,OAAO,MAAM,YAAY,GAAG;AACzE,QAAI,OAAO,EAAG,QAAO,KAAK,4BAA4B;AAAA,EACxD;AACA,MAAI,OAAO,MAAM,gBAAgB,OAAO,MAAM,cAAc;AAC1D,WAAO,KAAK,4DAA4D;AAAA,EAC1E;AACA,SAAO;AACT;;;AC1DA,IAAM,sBAAsB;AAC5B,IAAM,oBAAoB;AAEnB,SAAS,cAAc,KAAoC;AAChE,QAAM,aAAa,IAAI,KAAK,EAAE,YAAY;AAC1C,QAAM,eAAe,oBAAoB,KAAK,UAAU;AACxD,MAAI,cAAc;AAChB,UAAM,YAAY,OAAO,aAAa,CAAC,CAAC;AACxC,QAAI,aAAa,KAAK,aAAa,OAAO;AACxC,aAAO,EAAE,MAAM,WAAW,WAAW,KAAK,WAAW;AAAA,IACvD;AAAA,EACF;AACA,QAAM,aAAa,kBAAkB,KAAK,UAAU;AACpD,MAAI,YAAY;AACd,UAAM,YAAY,OAAO,WAAW,CAAC,CAAC;AACtC,QAAI,aAAa,EAAG,QAAO,EAAE,MAAM,SAAS,WAAW,KAAK,WAAW;AAAA,EACzE;AACA,SAAO;AACT;AASO,IAAM,wBAAN,cAAoC,MAAM;AAAA,EACtC,OAAO;AAAA,EACP;AAAA,EACA;AAAA,EAET,YACE,MACA,UACA,SACA;AACA,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,WAAW;AAAA,EAClB;AACF;AAmBO,SAAS,kBACd,OACe;AACf,QAAM,QAAQ,cAAc,MAAM,QAAQ;AAC1C,QAAM,MAAM,cAAc,MAAM,MAAM;AACtC,MAAI,CAAC,SAAS,CAAC,KAAK;AAClB,UAAM,IAAI;AAAA,MACR,qCAAqC,MAAM,QAAQ,aAAa,MAAM,MAAM;AAAA,IAC9E;AAAA,EACF;AAEA,QAAM,mBAAmB,oBAAI,IAAoB;AACjD,QAAM,SAAS;AAAA,IAAQ,CAAC,SAAS,UAC/B,iBAAiB,IAAI,QAAQ,IAAI,KAAK;AAAA,EACxC;AAEA,MAAI,oBAA8B,CAAC;AACnC,QAAM,cAAc;AAAA,IAClB;AAAA,IACA,MAAM;AAAA,IACN;AAAA,IACA;AAAA,EACF;AACA,MAAI,YAAY,QAAS,mBAAkB,KAAK,YAAY,OAAO;AACnE,QAAM,YAAY;AAAA,IAChB;AAAA,IACA,MAAM;AAAA,IACN;AAAA,IACA;AAAA,EACF;AACA,MAAI,UAAU,QAAS,mBAAkB,KAAK,UAAU,OAAO;AAC/D,MAAI,aAAa,YAAY;AAC7B,MAAI,WAAW,UAAU;AAEzB,MAAI,aAAa,UAAU;AACzB,KAAC,YAAY,QAAQ,IAAI,CAAC,UAAU,UAAU;AAAA,EAChD;AAEA,QAAM,aAAuB,CAAC;AAC9B,WAAS,QAAQ,YAAY,SAAS,UAAU,SAAS;AACvD,UAAM,UAAU,MAAM,SAAS,KAAK;AAIpC,QAAI,WAAW,CAAC,yBAAyB,OAAO;AAC9C,iBAAW,KAAK,QAAQ,EAAE;AAAA,EAC9B;AAEA,QAAM,eACJ,MAAM,SAAS,WAAW,IAAI,SAAS,UAAU,UAAU;AAE7D,QAAM,iBAA2B,CAAC;AAClC,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,SAAS,aAAa,MAAM,KAAK,GAAG;AAC7C,UAAM,SAAS,mBAAmB,OAAO,gBAAgB;AACzD,QAAI,WAAW,QAAQ,UAAU,cAAc,UAAU,UAAU;AACjE,UAAI,CAAC,WAAW,IAAI,MAAM,OAAO,GAAG;AAClC,mBAAW,IAAI,MAAM,OAAO;AAC5B,uBAAe,KAAK,MAAM,OAAO;AAAA,MACnC;AAAA,IACF;AAAA,EACF;AAEA,QAAM,gBAA0B,CAAC;AAEjC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAOA,SAAS,mBACP,UACA,OACA,kBACA,UACkB;AAClB,QAAM,QAAQ,aAAa,UAAU,YAAY;AACjD,MAAI,SAAS,SAAS,WAAW;AAC/B,UAAM,QACJ,MAAM,YAAY,MAAM,SAAS,GAAG,KACpC,MAAM,YAAY,MAAM,gBAAgB,SAAS,SAAS,CAAC;AAC7D,QAAI,CAAC,OAAO;AACV,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,QACA,GAAG,KAAK,KAAK,SAAS,GAAG;AAAA,MAC3B;AAAA,IACF;AACA,UAAM,QAAQ,iBAAiB,IAAI,KAAK;AACxC,QAAI,UAAU,QAAW;AACvB,aAAO,EAAE,OAAO,SAAS,KAAK;AAAA,IAChC;AACA,UAAMA,SAAQ,kBAAkB,OAAO,CAAC,KAAK,GAAG,gBAAgB;AAChE,QAAIA,WAAU,MAAM;AAClB,aAAO;AAAA,QACL,OAAOA;AAAA,QACP,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG;AAAA,MACpC;AAAA,IACF;AACA,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,MACA,GAAG,KAAK,KAAK,SAAS,GAAG;AAAA,IAC3B;AAAA,EACF;AAEA,QAAM,QAAQ,UAAU,OAAO,IAAI,SAAS,SAAS,EAAE;AACvD,MAAI,CAAC,OAAO;AACV,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,MACA,GAAG,KAAK,MAAM,SAAS,SAAS;AAAA,IAClC;AAAA,EACF;AACA,MAAI,MAAM,QAAQ;AAChB,UAAM,SAAS,mBAAmB,OAAO,gBAAgB;AACzD,QAAI,WAAW,MAAM;AACnB,aAAO,EAAE,OAAO,QAAQ,SAAS,KAAK;AAAA,IACxC;AAAA,EACF;AACA,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA,MAAM;AAAA,IACN;AAAA,EACF;AACA,MAAI,UAAU,MAAM;AAClB,WAAO;AAAA,MACL,OAAO;AAAA,MACP,SAAS,GAAG,KAAK,MAAM,SAAS,SAAS;AAAA,IAC3C;AAAA,EACF;AACA,MAAI,CAAC,MAAM,QAAQ;AACjB,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,MACA,GAAG,KAAK,MAAM,SAAS,SAAS;AAAA,IAClC;AAAA,EACF;AACA,QAAM,IAAI;AAAA,IACR;AAAA,IACA;AAAA,IACA,GAAG,KAAK,MAAM,SAAS,SAAS;AAAA,EAClC;AACF;AAaA,SAAS,kBACP,OACA,UACA,kBACe;AACf,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,QAAM,QAAQ,IAAI,IAAI,QAAQ;AAC9B,MAAI,OAAsB;AAC1B,aAAW,SAAS,MAAM,QAAQ;AAChC,QAAI,CAAC,MAAM,OAAQ;AACnB,UAAM,YAAY,oBAAoB,OAAO,KAAK;AAClD,QAAI,gBAAgB;AACpB,eAAW,MAAM,OAAO;AACtB,UAAI,UAAU,IAAI,EAAE,GAAG;AACrB,wBAAgB;AAChB;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,cAAe;AACpB,UAAM,SAAS,mBAAmB,OAAO,gBAAgB;AACzD,QAAI,WAAW,KAAM;AACrB,QAAI,SAAS,QAAQ,SAAS,MAAM;AAClC,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAQA,SAAS,oBACP,OACA,OACa;AACb,QAAM,MAAM,oBAAI,IAAY;AAC5B,aAAW,WAAW,MAAM,gBAAgB;AAC1C,UAAM,QAAQ,UAAU,OAAO,OAAO;AACtC,QAAI,CAAC,MAAO;AACZ,eAAW,MAAM,MAAM,oBAAqB,KAAI,IAAI,EAAE;AAAA,EACxD;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,OAAuB;AAC9C,SAAO,IAAI,OAAO,KAAK,EAAE,SAAS,GAAG,GAAG,CAAC;AAC3C;AASO,SAAS,mBACd,OACA,kBACe;AACf,QAAM,eAAe,iBAAiB,IAAI,iBAAiB,MAAM,OAAO,CAAC;AACzE,MAAI,iBAAiB,OAAW,QAAO;AACvC,SAAO,mBAAmB,MAAM,qBAAqB,gBAAgB;AACvE;AAEO,SAAS,mBACd,KACA,kBACe;AACf,MAAI,WAA0B;AAC9B,aAAW,MAAM,KAAK;AACpB,UAAM,QAAQ,iBAAiB,IAAI,EAAE;AACrC,QAAI,UAAU,WAAc,aAAa,QAAQ,QAAQ,WAAW;AAClE,iBAAW;AAAA,IACb;AAAA,EACF;AACA,SAAO;AACT;;;ACtTA,IAAM,oBAAoB;AAC1B,IAAM,WAAW;AAAA,EACb,iBAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,uBAAuB;AAC3B;AAEO,SAAS,yBACZ,UACA,YACA,QACA,aACA,UAA2B,CAAC,GACd;AACd,QAAM,OAAO,EAAE,GAAG,UAAU,GAAG,QAAQ;AACvC,MAAI,OAAO,qBAAqB,EAAG,QAAO,EAAE,UAAU,gBAAgB,GAAG,aAAa,EAAE;AAExF,QAAM,YAAY,OAAO,SAAS,YAAY,OAAO;AACrD,MAAI,aAAa,UAAW,QAAO,EAAE,UAAU,gBAAgB,GAAG,aAAa,EAAE;AAEjF,QAAM,iBAAiB,SAAS,SAAS,KAAK;AAC9C,QAAM,aAAuD,CAAC;AAE9D,WAAS,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS;AAClD,QAAI,SAAS,eAAgB;AAC7B,UAAM,UAAU,SAAS,KAAK;AAC9B,QAAI,QAAQ,gBAAgB,cAAe;AAC3C,UAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAI,KAAK,WAAW,KAAK,KAAK,SAAS,iBAAiB,EAAG;AAC3D,UAAM,SAAS,YAAY,IAAI;AAC/B,QAAI,SAAS,KAAK,gBAAiB;AACnC,eAAW,KAAK,EAAE,OAAO,OAAO,CAAC;AAAA,EACrC;AAEA,MAAI,WAAW,WAAW,EAAG,QAAO,EAAE,UAAU,gBAAgB,GAAG,aAAa,EAAE;AAClF,aAAW,KAAK,CAAC,MAAM,UAAU,MAAM,SAAS,KAAK,MAAM;AAE3D,QAAM,eAAe,YAAY;AACjC,MAAI,cAAc;AAClB,QAAM,QAAQ,oBAAI,IAAoB;AACtC,MAAI,iBAAiB;AAErB,aAAW,aAAa,YAAY;AAChC,QAAI,aAAa,eAAe,aAAc;AAC9C,UAAM,WAAW,SAAS,UAAU,KAAK,EAAG,QAAQ;AACpD,QAAI,SAAS,UAAU,KAAK,kBAAkB,KAAK,gBAAiB;AAEpE,UAAM,SAAS,SAAS,MAAM,GAAG,KAAK,eAAe;AACrD,UAAM,SAAS,SAAS,MAAM,CAAC,KAAK,eAAe;AACnD,UAAM,cACF,SACA;AAAA;AAAA,KAAU,iBAAiB,qBAAgB,UAAU,MAAM;AAAA;AAAA,IAC3D;AACJ,UAAM,IAAI,UAAU,OAAO,WAAW;AACtC,mBAAe,UAAU,SAAS,YAAY,WAAW;AACzD;AAAA,EACJ;AAEA,MAAI,mBAAmB,EAAG,QAAO,EAAE,UAAU,gBAAgB,GAAG,aAAa,EAAE;AAE/E,QAAM,UAAU,SAAS;AAAA,IAAI,CAAC,SAAS,UACnC,MAAM,IAAI,KAAK,IAAI,EAAE,GAAG,SAAS,MAAM,MAAM,IAAI,KAAK,EAAG,IAAI;AAAA,EACjE;AACA,SAAO,EAAE,UAAU,SAAS,gBAAgB,YAAY;AAC5D;;;ACtEA,IAAM,qBAAqB;AAO3B,SAAS,SAAS,UAAkB,QAAwB;AACxD,SAAO,GAAG,QAAQ,KAAK,MAAM;AACjC;AAEA,SAAS,oBAAoB,MAA0B,UAAsC;AACzF,MAAI;AACJ,MAAI;AACA,aAAS,KAAK,MAAM,QAAQ,EAAE;AAAA,EAClC,QAAQ;AACJ,WAAO;AAAA,EACX;AACA,MAAI,CAAC,UAAU,OAAO,WAAW,SAAU,QAAO;AAClD,QAAM,MAAM;AACZ,QAAM,UAAU,IAAI;AACpB,MAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,QAAQ,WAAW,EAAG,QAAO;AAE5D,QAAM,OAAO,QAAQ,OAAO,CAAC,UAA4C;AACrE,QAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,UAAM,IAAI,OAAO,MAAM,YAAY,WAAW,MAAM,UAAU,OAAO,MAAM,cAAc,WAAW,MAAM,YAAY;AACtH,UAAM,IAAI,OAAO,MAAM,UAAU,WAAW,MAAM,QAAQ,OAAO,MAAM,cAAc,WAAW,MAAM,YAAY;AAClH,WAAO,SAAS,IAAI,SAAS,GAAG,CAAC,CAAC;AAAA,EACtC,CAAC;AAED,MAAI,KAAK,WAAW,QAAQ,UAAU,KAAK,WAAW,EAAG,QAAO;AAEhE,SAAO,KAAK,UAAU,EAAE,GAAG,KAAK,SAAS,KAAK,CAAC;AACnD;AAEO,SAAS,0BACZ,OACA,UACkB;AAClB,QAAM,kBAAkB,oBAAI,IAAY;AACxC,QAAM,gBAAgB,oBAAI,IAAY;AACtC,QAAM,wBAAwB,oBAAI,IAAyB;AAC3D,QAAM,qBAAqB,oBAAI,IAAY;AAC3C,aAAW,SAAS,MAAM,QAAQ;AAC9B,QAAI,CAAC,MAAM,eAAgB;AAC3B,oBAAgB,IAAI,MAAM,cAAc;AACxC,QAAI,CAAC,MAAM,OAAQ;AACnB,kBAAc,IAAI,MAAM,cAAc;AACtC,QAAI,MAAM,aAAa,UAAa,MAAM,WAAW,QAAW;AAC5D,yBAAmB,IAAI,MAAM,cAAc;AAC3C;AAAA,IACJ;AACA,QAAI,OAAO,sBAAsB,IAAI,MAAM,cAAc;AACzD,QAAI,CAAC,MAAM;AACP,aAAO,oBAAI,IAAY;AACvB,4BAAsB,IAAI,MAAM,gBAAgB,IAAI;AAAA,IACxD;AACA,SAAK,IAAI,SAAS,MAAM,UAAU,MAAM,MAAM,CAAC;AAAA,EACnD;AAEA,QAAM,sBAAgC,CAAC;AACvC,WAAS,IAAI,SAAS,SAAS,GAAG,KAAK,KAAK,oBAAoB,SAAS,oBAAoB,KAAK;AAC9F,UAAM,UAAU,SAAS,CAAC;AAC1B,QAAI,QAAQ,aAAa,cAAc,QAAQ,gBAAgB,YAAa;AAC5E,UAAM,SAAS,QAAQ;AACvB,QAAI,UAAU,CAAC,gBAAgB,IAAI,MAAM,GAAG;AACxC,0BAAoB,KAAK,MAAM;AAAA,IACnC;AAAA,EACJ;AAEA,QAAM,cAAc,oBAAI,IAAI,CAAC,GAAG,eAAe,GAAG,mBAAmB,CAAC;AAEtE,QAAM,gBAAgB,oBAAI,IAAY;AACtC,aAAW,WAAW,UAAU;AAC5B,QACI,QAAQ,aAAa,cACrB,QAAQ,gBAAgB,gBACvB,CAAC,QAAQ,cAAc,CAAC,YAAY,IAAI,QAAQ,UAAU,IAC7D;AACE,UAAI,QAAQ,WAAY,eAAc,IAAI,QAAQ,UAAU;AAAA,IAChE;AAAA,EACJ;AAEA,MAAI,SAAS;AACb,QAAM,SAAwB,CAAC;AAC/B,aAAW,WAAW,UAAU;AAC5B,QACI,QAAQ,aAAa,cACrB,QAAQ,gBAAgB,gBACvB,CAAC,QAAQ,cAAc,CAAC,YAAY,IAAI,QAAQ,UAAU,IAC7D;AACE;AACA;AAAA,IACJ;AACA,QACI,QAAQ,gBAAgB,iBACxB,QAAQ,cACR,cAAc,IAAI,QAAQ,UAAU,GACtC;AACE;AACA;AAAA,IACJ;AACA,QACI,QAAQ,aAAa,cACrB,QAAQ,gBAAgB,eACxB,QAAQ,cACR,YAAY,IAAI,QAAQ,UAAU,GACpC;AACE,YAAM,WAAW,sBAAsB,IAAI,QAAQ,UAAU;AAC7D,UAAI,YAAY,SAAS,OAAO,KAAK,CAAC,mBAAmB,IAAI,QAAQ,UAAU,GAAG;AAC9E,cAAM,YAAY,oBAAoB,QAAQ,MAAM,QAAQ;AAC5D,YAAI,cAAc,MAAM;AACpB,iBAAO,KAAK,EAAE,GAAG,SAAS,MAAM,UAAU,CAAC;AAC3C;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,WAAO,KAAK,OAAO;AAAA,EACvB;AAEA,SAAO,EAAE,UAAU,QAAQ,OAAO;AACtC;;;ACjIA,IAAM,WAAW,oBAAI,IAA2B;AAEzC,SAAS,sBAAsB,QAA6B;AAC/D,QAAM,WAAW,SAAS,IAAI,OAAO,IAAI;AACzC,MAAI,YAAY,SAAS,YAAY,OAAO,SAAS;AACjD,UAAM,IAAI;AAAA,MACN,mBAAmB,OAAO,IAAI,qCAAqC,SAAS,OAAO,6BAA6B,OAAO,OAAO;AAAA,IAClI;AAAA,EACJ;AACA,WAAS,IAAI,OAAO,MAAM,MAAM;AACpC;AAEO,SAAS,iBAAiB,MAAyC;AACtE,SAAO,SAAS,IAAI,IAAI;AAC5B;AAEO,SAAS,qBAAsC;AAClD,SAAO,CAAC,GAAG,SAAS,OAAO,CAAC;AAChC;AAEO,SAAS,sBAA4B;AACxC,WAAS,MAAM;AACnB;;;ACbO,SAAS,oBACZ,UACA,QACW;AACX,MAAI,CAAC,QAAQ,SAAS;AAClB,WAAO,EAAE,UAAU,eAAe,GAAG,cAAc,GAAG,eAAe,EAAE;AAAA,EAC3E;AAEA,QAAM,SAAS,mBAAmB,EAAE;AAAA,IAChC,CAAC,WAAW,OAAO,UAAU,OAAO,IAAI,GAAG,YAAY;AAAA,EAC3D;AACA,MAAI,OAAO,WAAW,GAAG;AACrB,WAAO,EAAE,UAAU,eAAe,GAAG,cAAc,GAAG,eAAe,EAAE;AAAA,EAC3E;AAEA,MAAI,UAAU,SAAS,IAAI,CAAC,aAAa,EAAE,GAAG,QAAQ,EAAE;AACxD,QAAM,QAAQ,EAAE,eAAe,GAAG,cAAc,GAAG,eAAe,EAAE;AACpE,QAAM,QAAQ,QAAQ;AAEtB,QAAM,YAAY,OAAO,OAAO,CAAC,WAAW,CAAC,OAAO,YAAY;AAChE,WAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS;AACjD,UAAM,UAAU,QAAQ,KAAK;AAC7B,UAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAI,KAAK,WAAW,EAAG;AACvB,QAAI,UAAU;AACd,UAAM,UAAgC;AAAA,MAClC,MAAM;AAAA,MACN,MAAM,QAAQ;AAAA,MACd,cAAc;AAAA,MACd,eAAe;AAAA,MACf,UAAU,QAAQ;AAAA,IACtB;AACA,eAAW,UAAU,WAAW;AAC5B,UAAI;AACJ,UAAI;AACA,mBAAW,OAAO,OAAO,OAAO;AAAA,MACpC,QAAQ;AACJ;AAAA,MACJ;AACA,UAAI,SAAS,WAAW,OAAQ;AAChC,YAAM;AACN,UAAI,SAAS,WAAW,QAAQ;AAC5B,kBAAU;AACV,cAAM;AAAA,MACV,WAAW,SAAS,WAAW,YAAY,SAAS,SAAS,QAAW;AACpE,kBAAU,SAAS;AACnB,cAAM;AAAA,MACV;AACA,cAAQ,OAAO;AAAA,IACnB;AACA,QAAI,YAAY,KAAM,SAAQ,KAAK,IAAI,EAAE,GAAG,SAAS,MAAM,QAAQ;AAAA,EACvE;AAEA,QAAM,WAAW,OAAO,OAAO,CAAC,WAAW,OAAO,YAAY;AAC9D,aAAW,UAAU,UAAU;AAC3B,QAAI,YAAY;AAChB,aAAS,QAAQ,QAAQ,SAAS,GAAG,SAAS,GAAG,SAAS;AACtD,YAAM,UAAU,QAAQ,KAAK;AAC7B,YAAM,OAAO,QAAQ,QAAQ;AAC7B,UAAI,KAAK,WAAW,EAAG;AACvB,YAAM,MAA4B;AAAA,QAC9B;AAAA,QACA,MAAM,QAAQ;AAAA,QACd,cAAc;AAAA,QACd,eAAe;AAAA,QACf,UAAU,QAAQ;AAAA,MACtB;AACA,UAAI;AACJ,UAAI;AACA,mBAAW,OAAO,OAAO,GAAG;AAAA,MAChC,QAAQ;AACJ;AAAA,MACJ;AACA,UAAI,SAAS,WAAW,UAAU,SAAS,WAAW,SAAU;AAChE,UAAI,WAAW;AACX,cAAM;AACN,cAAM;AACN,gBAAQ,KAAK,IAAI,EAAE,GAAG,SAAS,MAAM,GAAG;AAAA,MAC5C,OAAO;AACH,oBAAY;AACZ,YAAI,SAAS,WAAW,YAAY,SAAS,SAAS,QAAW;AAC7D,gBAAM;AACN,gBAAM;AACN,kBAAQ,KAAK,IAAI,EAAE,GAAG,SAAS,MAAM,SAAS,KAAK;AAAA,QACvD;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAEA,SAAO,EAAE,UAAU,SAAS,GAAG,MAAM;AACzC;;;ACnFA,SAAS,aAAa,QAAwB;AAC5C,MAAI,SAAS,IAAM,QAAO,OAAO,MAAM;AACvC,MAAI,SAAS,IAAO,SAAQ,SAAS,KAAM,QAAQ,CAAC,IAAI;AACxD,SAAO,KAAK,MAAM,SAAS,GAAI,IAAI;AACrC;AAEA,SAAS,aAAa,SAA8B;AAClD,MACE,QAAQ,gBAAgB,eACxB,QAAQ,gBAAgB,eACxB;AACA,WAAO,QAAQ,YAAY;AAAA,EAC7B;AACA,SAAO,QAAQ;AACjB;AAEA,SAAS,YAAY,GAAmB;AACtC,SAAO,EAAE,QAAQ,uBAAuB,MAAM;AAChD;AAEA,IAAM,KAAK;AACX,IAAM,KAAK;AACX,IAAM,WAAW,KAAK;AACtB,IAAM,YAAY,KAAK,SAAS;AAEhC,SAAS,OAAO,KAAa,QAAgB,MAAsB;AACjE,SAAO,WAAW,aAAa,aAAa,MAAM,IAAI,aAAa,OAAO,MAAM,KAAK,MAAM;AAC7F;AAEA,SAAS,cACP,SACA,KACA,aACA,UACA,WAA0C,MAC7B;AACb,QAAM,MAAM,UAAU,KAAK,QAAQ,EAAE;AACrC,MAAI,CAAC,OAAO,QAAQ,YAAa,QAAO;AAGxC,MAAI,aAAa,OAAQ,QAAO;AAGhC,MAAI,aAAa,eAAe,QAAQ,gBAAgB,QAAQ;AAC9D,WAAO;AAAA,EACT;AAIA,QAAM,WAAW,IAAI;AAAA,IACnB,MAAM,YAAY,QAAQ,IAAI,UAAU,KAAK,YAAY,GAAG,IAAI,YAAY,SAAS,IAAI;AAAA,EAC3F;AACA,QAAM,aAAa,QAAQ,QAAQ,IAAI,QAAQ,UAAU,EAAE;AAI3D,QAAM,SAAS,WACV,SAAS,GAAG,MAAM,SAAS,GAAG,IAAI,YAAY,SAAS,KACxD,YAAY,SAAS;AACzB,QAAM,OAAO,aAAa,OAAO;AACjC,QAAM,SAAS,OAAO,KAAK,QAAQ,IAAI,IAAI;AAE3C,MAAI,CAAC,UAAW,QAAO,EAAE,GAAG,SAAS,MAAM,OAAO;AAClD,SAAO,EAAE,GAAG,SAAS,MAAM,SAAS,UAAU;AAChD;AAEO,SAAS,kBACd,UACA,OACA,cAAwC,CAAC,SACvC,KAAK,KAAK,KAAK,SAAS,CAAC,GAC3B,WAA2B,OACZ;AAEf,QAAM,MAAM,MAAM;AAClB,SAAO,SAAS;AAAA,IAAI,CAAC,YACnB,cAAc,SAAS,KAAK,aAAa,QAAQ;AAAA,EACnD;AACF;AAWO,SAAS,mBACd,UACA,OACA,cAAwC,CAAC,SAAS,KAAK,KAAK,KAAK,SAAS,CAAC,GAC3E,WAA2B,OACD;AAC1B,QAAM,MAAM,MAAM;AAClB,QAAM,WAAW,EAAE,GAAI,MAAM,iBAAiB,CAAC,EAAG;AAClD,QAAM,WAAW,SAAS;AAAA,IAAI,CAAC,YAC7B,cAAc,SAAS,KAAK,aAAa,UAAU,QAAQ;AAAA,EAC7D;AACA,SAAO,EAAE,UAAU,UAAU,eAAe,SAAS;AACvD;AAGO,SAAS,qBAAqB,UAAwC;AAC3E,SAAO;AAAA,IACL,MAAM;AAAA,IACN,IAAI,IAAY,KAA8B;AAC5C,YAAM,EAAE,UAAU,cAAc,IAAI;AAAA,QAClC,GAAG;AAAA,QACH,GAAG;AAAA,QACH,IAAI;AAAA,QACJ;AAAA,MACF;AAGA,YAAM,OAAO,GAAG,MAAM;AACtB,YAAM,UACJ,CAAC,QAAQ,OAAO,KAAK,aAAa,EAAE,WAAW,OAAO,KAAK,IAAI,EAAE;AACnE,aAAO,UACH,EAAE,GAAG,IAAI,UAAU,OAAO,EAAE,GAAG,GAAG,OAAO,cAAc,EAAE,IACzD,EAAE,GAAG,IAAI,SAAS;AAAA,IACxB;AAAA,EACF;AACF;AAGO,IAAM,iBAA+B,qBAAqB,KAAK;;;AC1I/D,IAAM,yBAAyB,CAAC,UAAU;AAqB1C,IAAM,8BAA8B;AAAA,EACzC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAKO,SAAS,sBAAsB,KAA2B;AAC/D,MAAI,IAAI,gBAAgB,eAAe,IAAI,gBAAgB,eAAe;AACxE,WAAO;AAAA,EACT;AACA,MAAI,CAAC,IAAI,SAAU,QAAO;AAC1B,SAAQ,4BAAkD,SAAS,IAAI,QAAQ;AACjF;AAEO,SAAS,iBAAiB,UAAkB,SAA0B;AAC3E,MAAI,QAAQ,SAAS,GAAG,GAAG;AACzB,WAAO,SAAS,WAAW,QAAQ,MAAM,GAAG,EAAE,CAAC;AAAA,EACjD;AACA,SAAO,aAAa;AACtB;AAEO,SAAS,mBACd,KACA,QACS;AAGT,MACG,IAAI,gBAAgB,eAAe,IAAI,gBAAgB,iBACxD,CAAC,IAAI,UACL;AACA,WAAO;AAAA,EACT;AAGA,MAAK,uBAA6C,SAAS,IAAI,QAAQ,GAAG;AACxE,WAAO;AAAA,EACT;AAEA,aAAW,WAAW,OAAO,gBAAgB;AAC3C,QAAI,iBAAiB,IAAI,UAAU,OAAO,EAAG,QAAO;AAAA,EACtD;AAEA,MAAI,OAAO,kBAAkB,IAAI,UAAU,IAAI,IAAI,EAAG,QAAO;AAE7D,SAAO;AACT;AAMO,SAAS,4BACd,UACA,QACa;AACb,QAAM,MAAM,oBAAI,IAAY;AAC5B,aAAW,KAAK,UAAU;AACxB,QAAI,EAAE,gBAAgB,eAAe,EAAE,cAAc,mBAAmB,GAAG,MAAM,GAAG;AAClF,UAAI,IAAI,EAAE,UAAU;AAAA,IACtB;AAAA,EACF;AACA,SAAO;AACT;AAIO,SAAS,8BACd,KACA,QACA,kBACS;AACT,MAAI,mBAAmB,KAAK,MAAM,EAAG,QAAO;AAC5C,MACE,IAAI,gBAAgB,iBACpB,IAAI,cACJ,iBAAiB,IAAI,IAAI,UAAU,GACnC;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;;;ACjGO,SAAS,6BACZ,YACA,UACA,UACA,UAAkB,IACsB;AAGxC,QAAM,iBAAiB,oBAAI,IAAY;AACvC,WAAS,IAAI,YAAY,KAAK,UAAU,KAAK;AACzC,UAAM,MAAM,SAAS,CAAC;AACtB,QAAI,CAAC,OAAO,CAAC,IAAI,WAAY;AAC7B,QAAI,IAAI,aAAa,WAAY;AACjC,mBAAe,IAAI,IAAI,UAAU;AAAA,EACrC;AAEA,MAAI,eAAe,SAAS,GAAG;AAC3B,WAAO,EAAE,YAAY,SAAS;AAAA,EAClC;AAIA,MAAI,cAAc;AAClB,WAAS,IAAI,WAAW,GAAG,IAAI,SAAS,UAAU,KAAK,WAAW,SAAS,KAAK;AAC5E,UAAM,MAAM,SAAS,CAAC;AACtB,QAAI,CAAC,IAAK;AACV,QAAI,IAAI,cAAc,eAAe,IAAI,IAAI,UAAU,GAAG;AACtD,oBAAc;AAAA,IAClB,WAAW,cAAc,UAAU;AAC/B;AAAA,IACJ;AAAA,EACJ;AAGA,MAAI,gBAAgB;AACpB,WAAS,IAAI,aAAa,GAAG,KAAK,KAAK,KAAK,aAAa,SAAS,KAAK;AACnE,UAAM,MAAM,SAAS,CAAC;AACtB,QAAI,CAAC,IAAK;AACV,QAAI,IAAI,cAAc,eAAe,IAAI,IAAI,UAAU,GAAG;AACtD,sBAAgB;AAAA,IACpB,WAAW,gBAAgB,YAAY;AACnC;AAAA,IACJ;AAAA,EACJ;AAEA,SAAO,EAAE,YAAY,eAAe,UAAU,YAAY;AAC9D;;;ACjCO,SAAS,kCACd,YACA,UACA,UAC0C;AAC1C,MAAI,aAAa,UAAU;AACzB,WAAO,EAAE,YAAY,SAAS;AAAA,EAChC;AACA,MAAI,gBAAgB;AACpB,MAAI,cAAc;AAElB,WAAS,IAAI,YAAY,KAAK,YAAY,IAAI,SAAS,QAAQ,KAAK;AAClE,UAAM,MAAM,SAAS,CAAC;AACtB,QAAI,CAAC,IAAK;AAEV,QAAI,IAAI,gBAAgB,aAAa;AAGnC,UAAI,IAAI;AACR,aACE,IAAI,IAAI,SAAS,UACjB,SAAS,IAAI,CAAC,EAAG,gBAAgB,aACjC;AACA;AAAA,MACF;AACA,YAAM,YAAY,SAAS,IAAI,CAAC;AAChC,UACE,cAAc,UACd,UAAU,SAAS,gBAClB,UAAU,gBAAgB,UACzB,UAAU,gBAAgB,gBAC5B,IAAI,IAAI,aACR;AACA,sBAAc,IAAI;AAAA,MACpB;AAAA,IACF;AAEA,QACE,IAAI,SAAS,gBACZ,IAAI,gBAAgB,UAAU,IAAI,gBAAgB,cACnD;AAGA,UAAI,IAAI,IAAI;AACZ,aAAO,KAAK,KAAK,SAAS,CAAC,EAAG,gBAAgB,aAAa;AACzD;AAAA,MACF;AACA,YAAM,WAAW,IAAI;AACrB,UACE,WAAW,KACX,YAAY,KACZ,SAAS,QAAQ,EAAG,gBAAgB,eACpC,WAAW,eACX;AACA,wBAAgB;AAAA,MAClB;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,YAAY,eAAe,UAAU,YAAY;AAC5D;;;AC3DA,SAAS,OAAO,KAAqB;AACnC,QAAM,IAAI,SAAS,IAAI,MAAM,CAAC,GAAG,EAAE;AACnC,SAAO,OAAO,MAAM,CAAC,IAAI,KAAK;AAChC;AAIA,SAAS,mBAAmB,MAAsB;AAChD,SAAO,KAAK,KAAK,KAAK,SAAS,CAAC;AAClC;AAEA,SAAS,cAAc,SAA+B;AACpD,SAAO,QAAQ,gBAAgB,eAAe,QAAQ,gBAAgB;AACxE;AAGA,SAAS,oBACP,SACA,OACS;AACT,MAAI,QAAQ,MAAM,WAAW,mCAAmC,EAAG,QAAO;AAC1E,aAAW,SAAS,MAAM,QAAQ;AAChC,QAAI,MAAM,UAAU,MAAM,oBAAoB,SAAS,QAAQ,EAAE,EAAG,QAAO;AAAA,EAC7E;AACA,SAAO;AACT;AAcO,SAAS,qBACd,UACA,OACA,QACA,cAAwC,oBAC3B;AACb,QAAM,YAAY,OAAO;AACzB,QAAM,iBAAiB,OAAO;AAE9B,QAAM,SAAS,oBAAI,IAAY;AAC/B,QAAM,UAA6C,CAAC;AAEpD,aAAW,OAAO,UAAU;AAC1B,QAAI,oBAAoB,KAAK,KAAK,EAAG;AAMrC,QAAI,sBAAsB,GAAG,EAAG;AAChC,UAAM,MAAM,MAAM,YAAY,MAAM,IAAI,EAAE;AAC1C,QAAI,CAAC,OAAO,QAAQ,UAAW;AAC/B,YAAQ,KAAK,EAAE,KAAK,QAAQ,YAAY,IAAI,QAAQ,EAAE,EAAE,CAAC;AAAA,EAC3D;AAGA,MAAI,YAAY,GAAG;AACjB,eAAW,KAAK,QAAQ,MAAM,CAAC,SAAS,GAAG;AACzC,aAAO,IAAI,EAAE,GAAG;AAAA,IAClB;AAAA,EACF;AAGA,MAAI,iBAAiB,GAAG;AACtB,QAAI,aAAa;AACjB,aAAS,IAAI,QAAQ,SAAS,GAAG,KAAK,KAAK,aAAa,gBAAgB,KAAK;AAC3E,aAAO,IAAI,QAAQ,CAAC,EAAG,GAAG;AAC1B,oBAAc,QAAQ,CAAC,EAAG;AAAA,IAC5B;AAAA,EACF;AAWA,MAAI,YAAY,GAAG;AACjB,aAAS,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AAC7C,YAAM,MAAM,SAAS,CAAC;AACtB,UAAI,IAAI,SAAS,UAAU,oBAAoB,KAAK,KAAK,EAAG;AAC5D,YAAM,MAAM,MAAM,YAAY,MAAM,IAAI,EAAE;AAC1C,UAAI,OAAO,QAAQ,UAAW,QAAO,IAAI,GAAG;AAC5C;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAgBO,SAAS,wBACd,UACA,OACA,QACA,mBACA,cAAwC,oBACzB;AACf,QAAM,mBAOA,CAAC;AACP,QAAM,gBAKA,CAAC;AAIP,QAAM,mBAAmB,4BAA4B,UAAU,MAAM;AAErE,aAAW,OAAO,UAAU;AAC1B,QAAI,oBAAoB,KAAK,KAAK,EAAG;AACrC,UAAM,MAAM,MAAM,YAAY,MAAM,IAAI,EAAE;AAC1C,QAAI,CAAC,OAAO,QAAQ,UAAW;AAE/B,UAAM,KAAK,OAAO,GAAG;AAErB,QAAI,8BAA8B,KAAK,QAAQ,gBAAgB,GAAG;AAChE,oBAAc,KAAK;AAAA,QACjB;AAAA,QACA,QAAQ;AAAA,QACR,QAAQ,YAAY,IAAI,QAAQ,EAAE;AAAA,QAClC,OAAO,IAAI,WAAW,CAAC,IAAI,QAAQ,IAAI,CAAC;AAAA,MAC1C,CAAC;AACD;AAAA,IACF;AAEA,QAAI,mBAAmB,IAAI,GAAG,GAAG;AAC/B;AAAA,IACF;AAEA,qBAAiB,KAAK;AAAA,MACpB;AAAA,MACA,QAAQ;AAAA,MACR,QAAQ,YAAY,IAAI,QAAQ,EAAE;AAAA,MAClC,QAAQ,IAAI,QAAQ,IAAI;AAAA,MACxB,QAAQ,cAAc,GAAG;AAAA,MACzB,QAAQ,IAAI,SAAS;AAAA,IACvB,CAAC;AAAA,EACH;AAQA,QAAM,eAAoC,CAAC;AAC3C,MAAI,MAAgC;AACpC,MAAI,aAAa;AAEjB,aAAW,QAAQ,kBAAkB;AACnC,UAAM,SAAS,KAAK,SAAS,aAAa;AAC1C,QAAI,QAAS,KAAK,UAAU,IAAI,SAAS,KAAM,SAAS;AACtD,mBAAa,KAAK,GAAG;AACrB,YAAM;AAAA,IACR;AACA,iBAAa,KAAK;AAClB,QAAI,CAAC,KAAK;AACR,YAAM;AAAA,QACJ,UAAU,KAAK;AAAA,QACf,QAAQ,KAAK;AAAA,QACb,OAAO;AAAA,QACP,QAAQ,KAAK;AAAA,QACb,OAAO,KAAK;AAAA,QACZ,SAAS,KAAK,SAAS,MAAM;AAAA,QAC7B,SAAS,KAAK,SAAS,IAAI;AAAA,MAC7B;AAAA,IACF,OAAO;AACL,UAAI,SAAS,KAAK;AAClB,UAAI;AACJ,UAAI,UAAU,KAAK;AACnB,UAAI,SAAS,IAAI,SAAS,KAAK,KAAK;AACpC,UAAI,KAAK,QAAQ;AACf,YAAI,UAAU,KAAK,OAAO,IAAI,WAAW,IAAI,QAAQ,KAAK,OAAO,IAAI,KAAK;AAAA,MAC5E,OAAO;AACL,YAAI,UAAU,KAAK,MAAO,IAAI,WAAW,IAAI,QAAQ,KAAM,IAAI,KAAK;AAAA,MACtE;AACA,UAAI,UAAU,MAAM,IAAI;AAAA,IAC1B;AAAA,EACF;AACA,MAAI,IAAK,cAAa,KAAK,GAAG;AAG9B,QAAM,kBAAoC,CAAC;AAC3C,MAAI,OAA8B;AAClC,MAAI,cAAc;AAElB,aAAW,QAAQ,eAAe;AAChC,UAAM,SAAS,KAAK,SAAS,cAAc;AAC3C,QAAI,QAAQ,QAAQ;AAClB,sBAAgB,KAAK,IAAI;AACzB,aAAO;AAAA,IACT;AACA,kBAAc,KAAK;AACnB,QAAI,CAAC,MAAM;AACT,aAAO;AAAA,QACL,UAAU,KAAK;AAAA,QACf,QAAQ,KAAK;AAAA,QACb,OAAO;AAAA,QACP,QAAQ,KAAK;AAAA,QACb,OAAO,CAAC,GAAG,KAAK,KAAK;AAAA,MACvB;AAAA,IACF,OAAO;AACL,WAAK,SAAS,KAAK;AACnB,WAAK;AACL,WAAK,UAAU,KAAK;AACpB,iBAAW,KAAK,KAAK,OAAO;AAC1B,YAAI,CAAC,KAAM,MAAM,SAAS,CAAC,EAAG,MAAM,MAAM,KAAK,CAAC;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AACA,MAAI,KAAM,iBAAgB,KAAK,IAAI;AAEnC,SAAO;AAAA,IACL,cAAc,aAAa,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAAA,IACrD,WAAW;AAAA,EACb;AACF;AAEA,SAAS,WAAW,OAA+C;AACjE,QAAM,QAAQ,MAAM,CAAC;AACrB,QAAM,OAAO,MAAM,MAAM,SAAS,CAAC;AACnC,QAAM,QAAQ,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,OAAO,CAAC;AACnD,QAAM,SAAS,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AACrD,QAAM,QAAQ,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,WAAW,CAAC,GAAG,CAAC;AACzD,QAAM,UAAU,KAAK;AAAA,IACnB,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,UAAU,EAAE,OAAO,CAAC,IAAI;AAAA,EACvD;AACA,QAAM,SAA4B;AAAA,IAChC,UAAU,MAAM;AAAA,IAChB,QAAQ,KAAK;AAAA,IACb;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,MAAM;AAAA,EACjB;AACA,MAAI,MAAM,KAAK,CAAC,MAAM,EAAE,cAAc,IAAI,GAAG;AAC3C,WAAO,YAAY;AAAA,EACrB;AACA,SAAO;AACT;AAKA,SAAS,WAAW,GAA8B;AAChD,SAAO,EAAE,SAAS,EAAE,SAAS;AAC/B;AAUO,SAAS,uBACd,QACA,UACqB;AACrB,MAAI,YAAY,KAAK,OAAO,WAAW,EAAG,QAAO;AACjD,QAAM,SAA8B,CAAC;AACrC,MAAI,QAA6B,CAAC;AAClC,MAAI,aAAa;AACjB,aAAW,KAAK,QAAQ;AACtB,UAAM,KAAK,CAAC;AACZ,kBAAc,WAAW,CAAC;AAC1B,QAAI,cAAc,UAAU;AAC1B,aAAO,KAAK,WAAW,KAAK,CAAC;AAC7B,cAAQ,CAAC;AACT,mBAAa;AAAA,IACf;AAAA,EACF;AACA,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO,KAAK,WAAW,KAAK,CAAC;AAAA,EAC/B;AACA,SAAO;AACT;;;AC3TO,SAAS,OACd,UACA,OACA,UAAuB,CAAC,GAChB;AACR,SAAO,EAAE,UAAU,OAAO,QAAQ;AACpC;AAEO,SAAS,YACd,OACA,SACA,KACQ;AACR,MAAI,KAAK;AACT,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,WAAW,CAAC,KAAK,QAAQ,IAAI,GAAG,EAAG;AAC5C,SAAK,KAAK,IAAI,IAAI,GAAG;AAAA,EACvB;AACA,SAAO;AACT;;;ACqEA,SAAS,WACP,MACA,SACQ;AACR,SAAO,SAAS,KAAK,QAAQ,KAAK,KAAK,MAAM,KAAK,OAAO;AAC3D;AAEA,SAAS,eAAe,IAAoB;AAC1C,QAAM,SAAS,WAAW,KAAK,EAAE;AACjC,SAAO,SAAS,OAAO,OAAO,CAAC,CAAC,IAAI;AACtC;AAEO,SAAS,WAAW,QAAe,CAAC,GAAoB;AAC7D,QAAM,cAAc,MAAM,eAAe;AAEzC,WAAS,iBACP,OACwB;AACxB,UAAM,QAA0B,WAAW,MAAM,KAAK;AACtD,UAAM,QAAQ,cAAc,KAAK;AACjC,QAAI,gBAAgB;AACpB,QAAI,mBAAmB;AACvB,UAAM,SAAmB,CAAC;AAC1B,UAAM,WAAqB,CAAC;AAK5B,UAAM,sBACJ,MAAM,uBACN;AAAA,MACE,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN;AAAA,IACF;AAEF,UAAM,sBAAsB,gBAAgB,KAAK;AAMjD,UAAM,kBAAkB,oBAAI,IAG1B;AACF,UAAM,uBAAiC,CAAC;AACxC,UAAM,iBAAsC,CAAC;AAC7C,eAAW,QAAQ,MAAM,QAAQ;AAC/B,UAAI;AACF,cAAM,WAAW,kBAAkB;AAAA,UACjC,UAAU,KAAK;AAAA,UACf,QAAQ,KAAK;AAAA,UACb,UAAU,MAAM;AAAA,UAChB;AAAA,QACF,CAAC;AACD,wBAAgB,IAAI,MAAM,EAAE,QAAQ,MAAM,SAAS,CAAC;AAAA,MACtD,SAAS,OAAO;AACd,YAAI,iBAAiB,uBAAuB;AAC1C,0BAAgB;AAAA,YACd;AAAA,YACA,MAAM,SAAS,YACX,EAAE,QAAQ,WAAW,MAAM,IAC3B,EAAE,QAAQ,YAAY,MAAM;AAAA,UAClC;AACA,cAAI,MAAM,SAAS,YAAY;AAC7B,2BAAe,KAAK,IAAI;AAAA,UAC1B,OAAO;AACL,iCAAqB,KAAK,WAAW,MAAM,MAAM,OAAO,CAAC;AAAA,UAC3D;AAAA,QACF,OAAO;AACL,0BAAgB,IAAI,MAAM;AAAA,YACxB,QAAQ;AAAA,YACR,OAAO,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC;AAAA,UACjE,CAAC;AACD,+BAAqB;AAAA,YACnB;AAAA,cACE;AAAA,cACA,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,YACvD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,kBAAkB;AACtB,QAAI,eAAe;AACnB,eAAW,cAAc,gBAAgB,OAAO,GAAG;AACjD,UAAI,WAAW,WAAW,KAAM;AAAA,eACvB,WAAW,WAAW,UAAW;AAAA,IAC5C;AAMA,UAAM,aAIA,CAAC;AACP,eAAW,CAAC,MAAM,UAAU,KAAK,iBAAiB;AAChD,UAAI,WAAW,WAAW,KAAM;AAChC,iBAAW,KAAK;AAAA,QACd;AAAA,QACA,OAAO,WAAW,SAAS;AAAA,QAC3B,KAAK,WAAW,SAAS;AAAA,MAC3B,CAAC;AAAA,IACH;AACA,UAAM,eAAe,CAAC,GAAG,UAAU,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAGrE,UAAM,YAAY,oBAAI,IAAmC;AACzD,QAAI,mBAAmB;AACvB,eAAW,SAAS,cAAc;AAChC,UAAI,MAAM,SAAS,kBAAkB;AACnC,kBAAU,IAAI,MAAM,IAAI;AACxB,iBAAS;AAAA,UACP,kBAAkB,MAAM,KAAK,QAAQ,KAAK,MAAM,KAAK,MAAM;AAAA,QAC7D;AACA;AAAA,MACF;AACA,UAAI,MAAM,MAAM,iBAAkB,oBAAmB,MAAM;AAAA,IAC7D;AAEA,QAAI,MAAM,OAAO,SAAS,mBAAmB,KAAK,MAAM,OAAO,SAAS,GAAG;AACzE,UAAI,kBAAkB;AACtB,UAAI,wBAAwB;AAC5B,UAAI,gBAAgB;AACpB,iBAAW,CAAC,MAAM,UAAU,KAAK,iBAAiB;AAChD,YAAI,WAAW,WAAW,QAAQ,UAAU,IAAI,IAAI,EAAG;AACvD,YAAI,WAAW,SAAS,iBAAiB,SAAS;AAChD,kCAAwB;AACxB;AAAA,QACF;AACA;AACA,mBAAW,MAAM,WAAW,SAAS,YAAY;AAC/C,gBAAM,MAAM,MAAM,SAAS,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AAClD,6BAAmB,KAAK,MAAM,UAAU;AAAA,QAC1C;AAAA,MACF;AACA,UACE,CAAC,yBACD,kBAAkB,MAAM,OAAO,SAAS,kBACxC;AACA,cAAM,OAAO,aAAa,KAAK,EAC5B,IAAI,CAAC,MAAM,EAAE,OAAO,EACpB,KAAK,CAAC,GAAG,MAAM,eAAe,CAAC,IAAI,eAAe,CAAC,CAAC;AACvD,cAAM,WACJ,KAAK,SAAS,IACV,+BAA+B,KAAK,CAAC,CAAC,KAAK,KAAK,KAAK,SAAS,CAAC,CAAC,2EAChE;AACN,cAAM,cACJ,oBAAoB,KACpB,eAAe,WAAW,KAC1B,eAAe,IACX,eAAe,MAAM,OAAO,MAAM,uSAClC,eAAe,SAAS,IACtB,+CAA+C,eAAe,CAAC,EAAG,QAAQ,KAAK,eAAe,CAAC,EAAG,MAAM,qCAAqC,eAAe,gBAAgB,MAAM,OAAO,SAAS,gBAAgB,mBAAmB,QAAQ,KAC7O,yCAAyC,eAAe,iBAAiB,aAAa,kBAAkB,MAAM,OAAO,SAAS,gBAAgB;AACtJ,eAAO;AAAA,UACL,OAAO,MAAM;AAAA,UACb,QAAQ;AAAA,YACN,eAAe;AAAA,YACf,kBAAkB;AAAA,YAClB,QAAQ,CAAC,aAAa,GAAG,oBAAoB;AAAA,YAC7C,UAAU,CAAC;AAAA,UACb;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,eAAW,QAAQ,MAAM,QAAQ;AAC/B,UAAI,UAAU,IAAI,IAAI,EAAG;AACzB,YAAM,aAAa,gBAAgB,IAAI,IAAI;AAC3C,UAAI,eAAe,OAAW;AAC9B,UAAI,WAAW,WAAW,YAAY;AACpC,iBAAS;AAAA,UACP,kBAAkB,KAAK,QAAQ,KAAK,KAAK,MAAM;AAAA,QACjD;AACA;AAAA,MACF;AACA,UAAI,WAAW,WAAW,aAAa,WAAW,WAAW,WAAW;AACtE,eAAO,KAAK,WAAW,MAAM,WAAW,MAAM,OAAO,CAAC;AACtD;AAAA,MACF;AACA,eAAS,KAAK,GAAG,WAAW,SAAS,iBAAiB;AACtD,UAAI;AACF,cAAM,UAAU,iBAAiB;AAAA,UAC/B;AAAA,UACA,UAAU,MAAM;AAAA,UAChB;AAAA,UACA;AAAA,UACA,QAAQ,MAAM;AAAA,UACd;AAAA,UACA;AAAA,UACA;AAAA,QACF,CAAC;AACD;AACA,4BAAoB,QAAQ;AAC5B,iBAAS,KAAK,GAAG,QAAQ,QAAQ;AAAA,MACnC,SAAS,OAAO;AACd,eAAO;AAAA,UACL;AAAA,YACE;AAAA,YACA,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,UACvD;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,UAAM,MAAM,oBAAoB;AAChC,UAAM,MAAM,oBAAoB;AAEhC,QAAI,gBAAgB,GAAG;AAIrB,YAAM,MAAM,4BAA4B;AACxC,YAAM,MAAM,uBAAuB;AAInC,YAAM,MAAM,kBAAkB,CAAC;AAAA,IACjC;AAEA,WAAO;AAAA,MACL;AAAA,MACA,QAAQ,EAAE,eAAe,kBAAkB,QAAQ,SAAS;AAAA,IAC9D;AAAA,EACF;AAEA,WAAS,YAAY,OAA4C;AAC/D,UAAM,eAAe,eAAe,MAAM,MAAM;AAChD,QAAI,aAAa,SAAS,GAAG;AAC3B,cAAQ;AAAA,QACN,4CAA4C,aAAa,KAAK,IAAI,CAAC;AAAA,MACrE;AAAA,IACF;AACA,UAAM,MAAuB;AAAA,MAC3B,QAAQ,MAAM;AAAA,MACd,YAAY,MAAM;AAAA,MAClB;AAAA,IACF;AACA,UAAM,UAAkB;AAAA,MACtB,UAAU,MAAM;AAAA,MAChB,OAAO,MAAM;AAAA,MACb,SAAS,CAAC;AAAA,IACZ;AAIA,UAAM,WAA2B,MAAM,cAAc;AACrD,UAAM,QAAQ,WAAW,QAAQ;AACjC,UAAM,SAAS,YAAY,OAAO,SAAS,GAAG;AAC9C,WAAO;AAAA,MACL,UAAU,OAAO;AAAA,MACjB,OAAO,OAAO;AAAA,MACd,OAAO,OAAO,QAAQ;AAAA,IACxB;AAAA,EACF;AAEA,WAAS,WAAW,SAAiB,OAAyB;AAC5D,WAAO,UAAU,OAAO,OAAO;AAAA,EACjC;AAEA,WAAS,OAAO,OAAe,OAA6C;AAC1E,UAAM,QAAQ,MACX,YAAY,EACZ,MAAM,KAAK,EACX,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC;AACnC,QAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAChC,UAAM,SAAS,aAAa,KAAK,EAC9B,IAAI,CAAC,WAAW,EAAE,OAAO,OAAO,eAAe,OAAO,KAAK,EAAE,EAAE,EAC/D,OAAO,CAAC,UAAU,MAAM,QAAQ,GAAG,EACnC,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,KAAK;AACjD,WAAO,OAAO,IAAI,CAAC,UAAU,MAAM,KAAK;AAAA,EAC1C;AAEA,WAAS,OACP,OACA,YACA,QACc;AACd,UAAM,SAAS,aAAa,KAAK;AACjC,UAAM,QACJ,OAAO,oBAAoB,IAAI,aAAa,OAAO,oBAAoB;AACzE,WAAO;AAAA,MACL,cAAc;AAAA,MACd;AAAA,MACA,mBAAmB,OAAO;AAAA,MAC1B,cAAc,OAAO;AAAA,MACrB,aAAa,MAAM,OAAO;AAAA,MAC1B,kBAAkB,MAAM,MAAM;AAAA,MAC9B,WAAW,EAAE,QAAQ,OAAO,QAAQ,OAAO,MAAM,OAAO,OAAO;AAAA,IACjE;AAAA,EACF;AAEA,WAAS,eAA+B;AACtC,WAAO,WAAW,KAAK;AAAA,EACzB;AAKA,WAAS,WAAW,UAA0C;AAC5D,UAAM,OAAuB;AAAA,MAC3B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,QAAI,aAAa,OAAQ,QAAO;AAChC,WAAO,CAAC,GAAG,MAAM,qBAAqB,QAAQ,CAAC;AAAA,EACjD;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAQA,IAAM,iBAA+B;AAAA,EACnC,MAAM;AAAA,EACN,IAAI,IAAI,KAAK;AACX,UAAM,gBACJ,IAAI,OAAO,eAAe,SAAS,KAAK,CAAC,CAAC,IAAI,OAAO;AACvD,UAAM,cAAc,gBAChB,CAAC,MAAmB,mBAAmB,GAAG,IAAI,MAAM,IACpD;AACJ,UAAM,YAAY,WAAW,GAAG,UAAU;AAAA,MACxC,UAAU,GAAG,MAAM;AAAA,MACnB,WAAW,iBAAiB,GAAG,MAAM,WAAW,IAAI;AAAA,MACpD,aAAa;AAAA,IACf,CAAC;AACD,WAAO,EAAE,GAAG,IAAI,OAAO,EAAE,GAAG,GAAG,OAAO,aAAa,UAAU,IAAI,EAAE;AAAA,EACrE;AACF;AAEA,IAAM,iBAA+B;AAAA,EACnC,MAAM;AAAA,EACN,IAAI,IAAI,KAAK;AACX,UAAM,SAAS,WAAW,GAAG,UAAU,GAAG,KAAK;AAC/C,oBAAgB,OAAO,OAAO,IAAI,OAAO,kBAAkB;AAC3D,WAAO,EAAE,GAAG,IAAI,OAAO,OAAO,MAAM;AAAA,EACtC;AACF;AAEA,IAAM,YAA0B;AAAA,EAC9B,MAAM;AAAA,EACN,IAAI,IAAI;AACN,WAAO,EAAE,GAAG,IAAI,UAAU,MAAM,GAAG,UAAU,GAAG,KAAK,EAAE;AAAA,EACzD;AACF;AAEA,IAAM,aAA2B;AAAA,EAC/B,MAAM;AAAA,EACN,SAAS,CAAC,KAAK,QACb,CAAC,CAAC,IAAI,OAAO,gBAAgB,WAAW,mBAAmB,EAAE,SAAS;AAAA,EACxE,IAAI,IAAI,KAAK;AACX,UAAM,UAAU,oBAAoB,GAAG,UAAU,IAAI,OAAO,cAAc;AAC1E,WAAO,EAAE,GAAG,IAAI,UAAU,QAAQ,SAAS;AAAA,EAC7C;AACF;AAEA,IAAM,wBAAsC;AAAA,EAC1C,MAAM;AAAA,EACN,IAAI,IAAI;AACN,UAAM,SAAS,0BAA0B,GAAG,OAAO,GAAG,QAAQ;AAC9D,WAAO,EAAE,GAAG,IAAI,UAAU,OAAO,SAAS;AAAA,EAC5C;AACF;AAEA,IAAM,gBAA8B;AAAA,EAClC,MAAM;AAAA,EACN,IAAI,IAAI,KAAK;AACX,UAAM,gBAAgB;AAAA,MACpB,GAAG;AAAA,MACH,GAAG;AAAA,MACH,IAAI;AAAA,MACJ,IAAI;AAAA,IACN;AACA,UAAM,gBAAgB;AAAA,MACpB,GAAG;AAAA,MACH,GAAG;AAAA,MACH,IAAI;AAAA,MACJ;AAAA,MACA,IAAI;AAAA,IACN;AACA,UAAM,oBAAoB,cAAc,aAAa,WAAW;AAChE,UAAM,iBAAiC;AAAA,MACrC;AAAA,MACA,mBAAmB;AAAA,QACjB,cAAc;AAAA,QACd,IAAI,OAAO,SAAS;AAAA,MACtB;AAAA,MACA;AAAA,IACF;AACA,WAAO,EAAE,GAAG,IAAI,SAAS,EAAE,GAAG,GAAG,SAAS,eAAe,EAAE;AAAA,EAC7D;AACF;AAEA,IAAM,YAA0B;AAAA,EAC9B,MAAM;AAAA,EACN,IAAI,IAAI,KAAK;AACX,UAAM,QAAQ,YAAY;AAAA,MACxB,YAAY,IAAI;AAAA,MAChB,QAAQ,IAAI;AAAA,MACZ,OAAO,GAAG;AAAA,MACV,UAAU,GAAG;AAAA,MACb,gBAAgB,GAAG,QAAQ;AAAA,MAC3B,aAAa,IAAI;AAAA,IACnB,CAAC;AAED,UAAM,WAAW,GAAG,MAAM,MAAM;AAChC,UAAM,oBAAoB;AAAA,MACxB,IAAI,OAAO;AAAA,MACX,IAAI,OAAO;AAAA,IACb;AAEA,QAAI,UAAU,EAAE,GAAG,GAAG,MAAM,MAAM;AAElC,QAAI,WAAW,KAAK,IAAI,aAAa,WAAW,mBAAmB;AACjE,cAAQ,4BAA4B,IAAI;AACxC,cAAQ,uBAAuB;AAS/B,cAAQ,kBAAkB,CAAC;AAAA,IAC7B;AAEA,QAAI,QAAQ,8BAA8B,GAAG;AAC3C,cAAQ,4BAA4B,IAAI;AAAA,IAC1C;AAEA,QAAI,MAAM,cAAc;AACtB,cAAQ,uBAAuB,IAAI;AAInC,UAAI,MAAM,SAAS,MAAM;AACvB,gBAAQ,kBAAkB;AAAA,UACxB,GAAG,QAAQ;AAAA,UACX,CAAC,MAAM,IAAI,GAAG,IAAI;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL,GAAG;AAAA,MACH,OAAO,EAAE,GAAG,GAAG,OAAO,OAAO,QAAQ;AAAA,MACrC,SAAS,EAAE,GAAG,GAAG,SAAS,MAAM;AAAA,IAClC;AAAA,EACF;AACF;AAEA,IAAM,wBAAsC;AAAA,EAC1C,MAAM;AAAA,EACN,IAAI,IAAI,KAAK;AACX,UAAM,QACJ,IAAI,OAAO,oBAAoB,IAC3B,IAAI,aAAa,IAAI,OAAO,oBAC5B;AACN,QAAI,QAAQ,IAAI,OAAO,SAAS,UAAW,QAAO;AAClD,UAAM,QAAQ;AAAA,MACZ,GAAG;AAAA,MACH,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,EAAE,uBAAuB,IAAI,OAAO,uBAAuB;AAAA,IAC7D;AACA,WAAO;AAAA,MACL,GAAG;AAAA,MACH,UAAU,MAAM;AAAA,MAChB,SAAS,EAAE,GAAG,GAAG,SAAS,gBAAgB,MAAM,eAAe;AAAA,IACjE;AAAA,EACF;AACF;AAyBA,SAAS,iBAAiB,OAA6C;AACrE,QAAM,WAAqB,CAAC;AAC5B,QAAM,WAAW,kBAAkB;AAAA,IACjC,UAAU,MAAM,KAAK;AAAA,IACrB,QAAQ,MAAM,KAAK;AAAA,IACnB,UAAU,MAAM;AAAA,IAChB,OAAO,MAAM;AAAA,EACf,CAAC;AAED,QAAM,kBAAkB;AAAA,IACtB;AAAA,IACA,MAAM;AAAA,EACR,EAAE,OAAO,CAAC,OAAO,CAAC,mBAAmB,EAAE,CAAC;AAIxC,MAAI,gBAAgB,SAAS,SAAS,WAAW,QAAQ;AACvD,UAAM,mBAAmB,oBAAI,IAAoB;AACjD,UAAM,SAAS,QAAQ,CAAC,GAAG,MAAM,iBAAiB,IAAI,EAAE,IAAI,CAAC,CAAC;AAC9D,UAAM,gBACJ,gBAAgB,SAAS,IACpB,iBAAiB,IAAI,gBAAgB,CAAC,CAAE,KAAK,SAAS,aACvD,SAAS;AACf,UAAM,cACJ,gBAAgB,SAAS,IACpB,iBAAiB,IAAI,gBAAgB,gBAAgB,SAAS,CAAC,CAAE,KAClE,SAAS,WACT,SAAS;AACf,UAAM,aAAa,IAAI,IAAI,SAAS,cAAc;AAClD,eAAWC,UAAS,aAAa,MAAM,KAAK,GAAG;AAC7C,UAAI,WAAW,IAAIA,OAAM,OAAO,EAAG;AACnC,YAAM,SAAS,mBAAmBA,QAAO,gBAAgB;AACzD,UAAI,WAAW,QAAQ,UAAU,iBAAiB,UAAU,aAAa;AACvE,mBAAW,IAAIA,OAAM,OAAO;AAC5B,iBAAS,eAAe,KAAKA,OAAM,OAAO;AAAA,MAC5C;AAAA,IACF;AAAA,EACF;AAEA,QAAM,kBAAkB,SAAS,iBAAiB;AAClD,QAAM,aAAa;AAAA,IACjB,MAAM;AAAA,IACN,SAAS;AAAA,IACT;AAAA,EACF;AACA,QAAM,aAAa,kBACd,KAAK,IAAI,GAAG,aAAa,CAAC,IAC3B;AAEJ,QAAM,mBAAmB,SAAS,eAAe,OAAO,CAAC,OAAO;AAC9D,UAAMA,SAAQ,UAAU,MAAM,OAAO,EAAE;AACvC,WAAOA,QAAO,UAAUA,OAAM,SAAS;AAAA,EACzC,CAAC;AAED,QAAM,sBAAsB,IAAI,IAAY,eAAe;AAC3D,aAAW,cAAc,kBAAkB;AACzC,UAAM,WAAW,UAAU,MAAM,OAAO,UAAU;AAClD,QAAI,UAAU;AACZ,iBAAW,MAAM,SAAS;AACxB,4BAAoB,IAAI,EAAE;AAAA,IAC9B;AAAA,EACF;AAEA,QAAM,mBAAmB,CAAC,GAAG,mBAAmB,EAAE;AAAA,IAChD,CAAC,OAAO,CAAC,MAAM,oBAAoB,IAAI,EAAE;AAAA,EAC3C;AAEA,MAAI,cAAc;AAAA,IAChB;AAAA,IACA,MAAM;AAAA,IACN,MAAM;AAAA,EACR;AAMA,MAAI,YAAY,SAAS,iBAAiB,QAAQ;AAChD,UAAM,OAAO,IAAI,IAAI,WAAW;AAChC,eAAW,MAAM,kBAAkB;AACjC,UAAI,CAAC,KAAK,IAAI,EAAE,EAAG,qBAAoB,OAAO,EAAE;AAAA,IAClD;AAAA,EACF;AAWA,QAAM,gBAAgB,MAAM;AAC5B,QAAM,kBAAkB,gBACpB,YAAY,OAAO,CAAC,OAAO;AACzB,UAAM,MAAM,MAAM,MAAM,YAAY,MAAM,EAAE;AAC5C,WAAO,QAAQ,UAAa,cAAc,IAAI,GAAG;AAAA,EACnD,CAAC,IACD,CAAC;AACL,MAAI,gBAAgB,SAAS,GAAG;AAC9B,UAAM,eAAe,IAAI,IAAI,eAAe;AAC5C,kBAAc,YAAY,OAAO,CAAC,OAAO,CAAC,aAAa,IAAI,EAAE,CAAC;AAG9D,eAAW,MAAM,gBAAiB,qBAAoB,OAAO,EAAE;AAE/D,UAAM,UAAU,gBACb,IAAI,CAAC,OAAO,MAAM,MAAM,YAAY,MAAM,EAAE,CAAC,EAC7C,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AAEnD,QAAI,YAAY,WAAW,KAAK,iBAAiB,WAAW,GAAG;AAC7D,YAAM,UAAU,MAAM,OAAO;AAC7B,YAAM,IAAI;AAAA,QACR,yDAAyD,OAAO,mDAAmD,QAAQ;AAAA,UACzH;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AACA,aAAS;AAAA,MACP,YAAY,gBAAgB,MAAM,yBAAyB,QAAQ;AAAA,QACjE;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,2BAAyB,OAAO,aAAa,iBAAiB,MAAM;AAEpE,MAAI,mBAAmB;AACvB,aAAW,MAAM,aAAa;AAC5B,UAAM,UAAU,MAAM,SAAS,KAAK,CAAC,UAAU,MAAM,OAAO,EAAE;AAC9D,wBAAoB,MAAM,YAAY,SAAS,QAAQ,EAAE;AAAA,EAC3D;AACA,aAAW,cAAc,kBAAkB;AACzC,UAAM,WAAW,UAAU,MAAM,OAAO,UAAU;AAClD,QAAI,UAAU;AACZ,0BAAoB,MAAM,YAAY,SAAS,OAAO;AAAA,IACxD;AAAA,EACF;AAEA,QAAM,UAAU,gBAAgB,MAAM,KAAK;AAC3C,QAAM,QAA0B;AAAA,IAC9B;AAAA,IACA,OAAO,MAAM;AAAA,IACb,MAAM;AAAA,IACN,OAAO,MAAM,KAAK;AAAA,IAClB,SAAS,MAAM,KAAK;AAAA,IACpB,kBAAkB;AAAA,IAClB,qBAAqB,CAAC,GAAG,mBAAmB;AAAA,IAC5C,gBAAgB,CAAC,GAAG,gBAAgB;AAAA,IACpC;AAAA,IACA,WAAW,KAAK,IAAI;AAAA,IACpB,eAAe;AAAA,IACf,YAAY;AAAA,IACZ,QAAQ;AAAA,IACR,gBAAgB,MAAM,KAAK;AAAA,IAC3B,UAAU,MAAM,KAAK;AAAA,IACrB,QAAQ,MAAM,KAAK;AAAA,EACrB;AACA,QAAM,MAAM,OAAO,KAAK,KAAK;AAE7B,aAAW,cAAc,kBAAkB;AACzC,UAAM,WAAW,UAAU,MAAM,OAAO,UAAU;AAClD,QAAI,SAAU,UAAS,SAAS;AAAA,EAClC;AAEA,SAAO,EAAE,QAAQ,kBAAkB,SAAS;AAC9C;AAEA,SAAS,6BACP,UAMA,UACU;AACV,MAAI,SAAS,iBAAiB,SAAS;AACrC,WAAO,SAAS;AAAA,EAClB;AAKA,MAAI,aAAa,SAAS;AAC1B,MAAI,WAAW,SAAS;AACxB,WAAS,OAAO,GAAG,OAAO,GAAG,QAAQ;AACnC,UAAM,oBAAoB;AAAA,MACxB;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,UAAM,eAAe;AAAA,MACnB,kBAAkB;AAAA,MAClB,kBAAkB;AAAA,MAClB;AAAA,IACF;AACA,UAAM,UACJ,aAAa,eAAe,cAC5B,aAAa,aAAa;AAC5B,iBAAa,aAAa;AAC1B,eAAW,aAAa;AACxB,QAAI,CAAC,QAAS;AAAA,EAChB;AACA,MAAI,eAAe,SAAS,cAAc,aAAa,SAAS,UAAU;AACxE,WAAO,SAAS;AAAA,EAClB;AACA,QAAM,MAAgB,CAAC;AACvB,WAAS,IAAI,YAAY,KAAK,UAAU,KAAK;AAC3C,UAAM,MAAM,SAAS,CAAC;AACtB,QAAI,IAAK,KAAI,KAAK,IAAI,EAAE;AAAA,EAC1B;AACA,SAAO;AACT;AAEA,SAAS,yBACP,OACA,kBACA,oBACM;AACN,QAAM,MAAM,MAAM,OAAO;AACzB,QAAM,UAAU,MAAM,KAAK,SAAS,KAAK,KAAK;AAE9C,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,MAAI,IAAI,mBAAmB,KAAK,QAAQ,SAAS,IAAI,kBAAkB;AACrE,UAAM,IAAI;AAAA,MACR,sBAAsB,QAAQ,MAAM,eAAe,IAAI,gBAAgB;AAAA,IACzE;AAAA,EACF;AAEA,QAAM,eAAe,MAAM,KAAK,mBAAmB,IAAI;AACvD,MAAI,eAAe,KAAK,QAAQ,SAAS,cAAc;AACrD,UAAM,IAAI;AAAA,MACR,qBAAqB,QAAQ,MAAM,eAAe,YAAY;AAAA,IAChE;AAAA,EACF;AAEA,MAAI,iBAAiB,WAAW,KAAK,uBAAuB,GAAG;AAC7D,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,4BACP,kBACA,UACA,QACU;AAKV,QAAM,mBAAmB,oBAAI,IAAY;AACzC,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,OAAO,UAAU;AAC1B,QAAI,mBAAmB,KAAK,MAAM,KAAK,IAAI,YAAY;AACrD,uBAAiB,IAAI,IAAI,UAAU;AAAA,IACrC;AAAA,EACF;AAEA,aAAW,MAAM,kBAAkB;AACjC,UAAM,MAAM,SAAS,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AAC5C,QAAI,CAAC,IAAK;AACV,QAAI,mBAAmB,KAAK,MAAM,GAAG;AACnC,iBAAW,IAAI,EAAE;AACjB,UAAI,IAAI,WAAY,kBAAiB,IAAI,IAAI,UAAU;AAAA,IACzD;AAAA,EACF;AAEA,aAAW,MAAM,kBAAkB;AACjC,QAAI,WAAW,IAAI,EAAE,EAAG;AACxB,UAAM,MAAM,SAAS,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AAC5C,QAAI,CAAC,IAAK;AACV,QACE,IAAI,gBAAgB,iBACpB,IAAI,cACJ,iBAAiB,IAAI,IAAI,UAAU,GACnC;AACA,iBAAW,IAAI,EAAE;AAAA,IACnB;AAAA,EACF;AAEA,SAAO,iBAAiB,OAAO,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC;AAC5D;AAEA,SAAS,kBACP,OACA,gBACA,iBACiB;AACjB,MAAI,CAAC,gBAAiB,QAAO;AAC7B,MAAI,eAAe,WAAW,EAAG,QAAO;AACxC,MAAI,UAA2B;AAC/B,aAAW,MAAM,gBAAgB;AAC/B,UAAM,QAAQ,UAAU,OAAO,EAAE;AACjC,QAAI,SAAS,MAAM,OAAO,QAAS,WAAU,MAAM;AAAA,EACrD;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,OAAsC;AAC7D,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,SAAS,aAAa,KAAK,GAAG;AACvC,eAAW,MAAM,MAAM,oBAAqB,UAAS,IAAI,EAAE;AAAA,EAC7D;AACA,SAAO;AACT;AAWA,SAAS,sBACP,mBACA,OACQ;AACR,MAAI,CAAC,qBAAqB,qBAAqB,EAAG,QAAO,MAAM;AAC/D,SAAO,KAAK;AAAA,IACV,MAAM;AAAA,IACN,KAAK;AAAA,MACH,MAAM;AAAA,MACN,KAAK,MAAM,oBAAoB,MAAM,WAAW;AAAA,IAClD;AAAA,EACF;AACF;AASA,SAAS,cACP,OACA,gBACA,aACA,kBACuE;AACvE,QAAM,MAGF,CAAC;AACL,QAAM,SAAS,gBAAgB,qBAAqB,CAAC;AACrD,QAAM,YACJ,mBAAmB,IACf,OAAO,OAAO,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,MAAM,gBAAgB,IAClE;AACN,MAAI,CAAC,IAAI;AAAA,IACP,SAAS,UAAU,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AAAA,IACnD,cAAc,CAAC;AAAA,EACjB;AACA,QAAM,SAAS,aAAa,KAAK;AACjC,QAAM,KAAK,OAAO,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC5C,QAAM,KAAK,OAAO,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC5C,MAAI,CAAC,IAAI;AAAA,IACP,SAAS,GAAG,OAAO,CAAC,GAAG,MAAM,IAAI,YAAY,EAAE,OAAO,GAAG,CAAC;AAAA,IAC1D,cAAc;AAAA,EAChB;AACA,MAAI,CAAC,IAAI;AAAA,IACP,SAAS,GAAG,OAAO,CAAC,GAAG,MAAM,IAAI,YAAY,EAAE,OAAO,GAAG,CAAC;AAAA,IAC1D,cAAc;AAAA,EAChB;AACA,SAAO;AACT;AAEA,SAAS,YAAY,OAAkC;AACrD,QAAM,EAAE,QAAQ,OAAO,YAAY,gBAAgB,YAAY,IAAI;AACnE,QAAM,QAAQ,OAAO;AACrB,QAAM,QAAQ,QAAQ,IAAI,aAAa,QAAQ;AAE/C,QAAM,oBAAoB,sBAAsB,OAAO,OAAO,KAAK;AAEnE,QAAM,YAAY,SAAS,OAAO,MAAM;AACxC,QAAM,oBAAoB,SAAS,OAAO,MAAM;AAGhD,QAAM,WAAW,aAAa;AAE9B,QAAM,WAAW,MAAM,MAAM;AAC7B,QAAM,kBAAkB,MAAM,MAAM,uBAAuB;AAE3D,QAAM,kBAAkB;AACxB,QAAM,qBAAqB,kBACvB,KAAK,MAAM,oBAAoB,CAAC,IAChC;AAEJ,QAAM,kBACJ,MAAM,MAAM,uBAAuB,IAC/B,MAAM,MAAM,uBACZ,WAAW,IACT,WACA;AAER,QAAM,cAAc,KAAK;AAAA,IACvB,OAAO,MAAM;AAAA,IACb,OAAO,MAAM,iBAAiB;AAAA,EAChC;AAEA,QAAM,uBAAuB,aAAa;AAE1C,QAAM,MAAM;AACZ,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,SAAS;AAAA,EAClB;AAOA,QAAM,iBAAiB,KAAK;AAAA,IAC1B,qBAAqB,OAAO,MAAM,yBAAyB;AAAA,EAC7D;AACA,MAAI,eAAuC;AAC3C,MAAI,iBAAiB;AACrB,QAAM,cAAc,wBAAwB;AAC5C,QAAM,QAAQ,MAAM,CAAC,GAAG,WAAW;AACnC,QAAM,QAAQ,MAAM,CAAC,GAAG,WAAW;AACnC,QAAM,QAAQ,MAAM,CAAC,GAAG,WAAW;AAEnC,MAAI,UAAU;AAOZ,UAAM,aAAgC,CAAC,CAAC;AACxC,QAAI,OAAO,MAAM,SAAS;AACxB,iBAAW,KAAK,GAAG,CAAC;AAAA,IACtB;AACA,QAAI,OAA+B;AACnC,QAAI,cAAc;AAClB,eAAW,KAAK,YAAY;AAC1B,YAAM,IAAI,MAAM,CAAC,GAAG,WAAW;AAC/B,UAAI,IAAI,aAAa;AACnB,sBAAc;AACd,eAAO;AAAA,MACT;AAAA,IACF;AACA,QAAI,SAAS,QAAQ,cAAc,GAAG;AACpC,qBAAe;AACf,YAAM,QAAQ,oBAAoB,cAAc;AAChD,uBACE,SAAS,IACL,GAAG,KAAK,8BAA8B,WAAW,WAAW,KAAK,MAAM,QAAQ,GAAG,CAAC,MACnF,GAAG,KAAK,KAAK,IAAI,yBAAyB,WAAW,kBAAkB,KAAK,QAAQ,KAAK,QAAQ,KAAK,YAAY,KAAK,MAAM,QAAQ,GAAG,CAAC;AAAA,IACjJ;AAAA,EACF,WAAW,aAAa;AACtB,QAAI,SAAS,mBAAmB;AAC9B,qBAAe;AACf,uBAAiB,gBAAgB,KAAK,OAAO,iBAAiB,YAAY,oBAAoB,WAAW,KAAK,MAAM,QAAQ,GAAG,CAAC;AAAA,IAClI,WACE,OAAO,MAAM,WACb,SAAS,kBACT,QAAQ,OACR;AACA,YAAM,YAAY,MAAM,MAAM,gBAAgB,CAAC,KAAK;AACpD,YAAM,aACJ,cAAc,KAAK,aAAa,aAAa;AAC/C,UAAI,YAAY;AACd,uBAAe;AACf,yBAAiB,qBAAqB,MAAM,CAAC,EAAG,aAAa,MAAM,mBAAmB,KAAK,eAAe,cAAc,8BAA8B,KAAK,WAAW,KAAK,MAAM,QAAQ,GAAG,CAAC;AAAA,MAC/L;AAAA,IACF,WACE,OAAO,MAAM,WACb,SAAS,kBACT,QAAQ,SACR,QAAQ,OACR;AACA,YAAM,YAAY,MAAM,MAAM,gBAAgB,CAAC,KAAK;AACpD,YAAM,aACJ,cAAc,KAAK,aAAa,aAAa;AAC/C,UAAI,YAAY;AACd,uBAAe;AACf,yBAAiB,sBAAsB,MAAM,CAAC,EAAG,aAAa,MAAM,mBAAmB,KAAK,eAAe,cAAc,oBAAoB,KAAK,uBAAuB,KAAK,WAAW,KAAK,MAAM,QAAQ,GAAG,CAAC;AAAA,MAClN;AAAA,IACF;AAAA,EACF;AAEA,QAAM,eAAe,iBAAiB;AAEtC,MAAI;AACJ,MAAI,iBAAiB,MAAM;AACzB,aAAS;AAAA,EACX,WAAW,UAAU;AACnB,UAAM,QAAQ,oBAAoB,cAAc;AAChD,aAAS,GAAG,KAAK,WAAW,KAAK,MAAM,QAAQ,GAAG,CAAC,kEAAkE,KAAK,QAAQ,KAAK,QAAQ,KAAK;AAAA,EACtJ,OAAO;AACL,UAAM,YAAY,CAAC,GAAG,GAAG,CAAC;AAC1B,UAAM,WAAW,UAAU,OAAO,CAAC,MAAM,OAAO,MAAM,WAAW,MAAM,CAAC;AACxE,UAAM,QAAQ,SACX,OAAO,CAAC,OAAO,MAAM,CAAC,GAAG,WAAW,MAAM,iBAAiB,EAC3D,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,MAAM,CAAC,EAAG,OAAO,EAAE;AAC1C,UAAM,YAAY,MAAM,SAAS,IAAI,YAAY,MAAM,KAAK,IAAI,CAAC,KAAK;AACtE,UAAM,UAAU,SACb;AAAA,MACC,CAAC,OACE,MAAM,CAAC,GAAG,WAAW,MAAM,sBAC3B,MAAM,MAAM,gBAAgB,CAAC,KAAK,KAAK,KACxC,cAAc,MAAM,MAAM,gBAAgB,CAAC,KAAK,KAAK;AAAA,IACzD,EACC,IAAI,CAAC,MAAM,IAAI,CAAC,YAAY;AAC/B,UAAM,cACJ,QAAQ,SAAS,IAAI,cAAc,QAAQ,KAAK,IAAI,CAAC,KAAK;AAC5D,UAAM,aAAa,KAAK;AAAA,MACtB;AAAA,MACA,GAAG,OAAO,OAAO,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO;AAAA,IAC9C;AAKA,UAAM,eAAe,aAAa;AAClC,UAAM,cAAc,uBAAuB;AAC3C,UAAM,QAAkB,CAAC;AACzB,QAAI;AACF,YAAM;AAAA,QACJ,oBAAoB,UAAU,gBAAgB,iBAAiB;AAAA,MACjE;AACF,QAAI;AACF,YAAM,KAAK,UAAU,oBAAoB,YAAY,WAAW,EAAE;AACpE,QAAI,MAAM,WAAW;AACnB,YAAM;AAAA,QACJ,oBAAoB,UAAU,YAAY,oBAAoB;AAAA,MAChE;AACF,aAAS,GAAG,MAAM,KAAK,IAAI,CAAC,GAAG,SAAS,GAAG,WAAW;AAAA,EACxD;AAEA,QAAM,eAAe;AAAA,IACnB,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,oBAAoB,KAAK,qBAAqB,CAAC;AAAA,IAC/C,iBAAiB,KAAK,cAAc,aAAa,CAAC;AAAA,IAClD,kBAAkB,eAAe,MAAM,YAAY,EAAG,eAAe,CAAC;AAAA,IACtE,cAAc;AAAA,IACd,MAAM;AAAA,IACN,WAAW;AAAA,MACT;AAAA,MACA,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,iBAAiB,kBAAkB,IAAI;AAAA,MACvC,WAAW,YAAY,IAAI;AAAA,MAC3B,mBAAmB,oBAAoB,IAAI;AAAA,MAC3C,WAAW,MAAM,CAAC,EAAG;AAAA,MACrB,WAAW,MAAM,CAAC,EAAG;AAAA,MACrB,WAAW,MAAM,CAAC,EAAG;AAAA,IACvB;AAAA,IACA,kBAAkB;AAAA,EACpB;AACF;AAEA,SAAS,wBACP,UACA,OACA,QACA,aACkB;AAClB,QAAM,QAAQ,gBAAgB,CAAC,MAAc,KAAK,KAAK,EAAE,SAAS,CAAC;AACnE,MAAI,SAAS,GACX,OAAO,GACP,YAAY,GACZ,OAAO,GACP,OAAO;AACT,aAAW,OAAO,UAAU;AAC1B,UAAM,SAAS,MAAM,IAAI,QAAQ,EAAE;AACnC,QAAI,IAAI,MAAM,WAAW,mCAAmC,GAAG;AAC7D,mBAAa;AAAA,IACf,WACE,IAAI,gBAAgB,eACpB,IAAI,gBAAgB,eACpB;AACA,cAAQ;AAAA,IACV,WAAW,IAAI,SAAS,UAAU;AAChC,gBAAU;AAAA,IACZ,WAAW,IAAI,MAAM,SAAS,KAAK,GAAG;AACpC,cAAQ;AAAA,IACV,OAAO;AACL,cAAQ;AAAA,IACV;AAAA,EACF;AACA,SAAO,EAAE,QAAQ,MAAM,WAAW,MAAM,MAAM,OAAO,OAAO;AAC9D;AAEA,SAAS,WAAW,OAA2C;AAC7D,SAAO;AAAA,IACL,QAAQ,MAAM,OAAO,IAAI,CAAC,WAAW;AAAA,MACnC,GAAG;AAAA,MACH,kBAAkB,CAAC,GAAG,MAAM,gBAAgB;AAAA,MAC5C,qBAAqB,CAAC,GAAG,MAAM,mBAAmB;AAAA,MAClD,gBAAgB,CAAC,GAAG,MAAM,cAAc;AAAA,IAC1C,EAAE;AAAA,IACF,aAAa;AAAA,MACX,OAAO,EAAE,GAAG,MAAM,YAAY,MAAM;AAAA,MACpC,OAAO,EAAE,GAAG,MAAM,YAAY,MAAM;AAAA,IACtC;AAAA,IACA,eAAe,EAAE,GAAI,MAAM,iBAAiB,CAAC,EAAG;AAAA,IAChD,OAAO,EAAE,GAAG,MAAM,OAAO,SAAS,EAAE,GAAG,MAAM,MAAM,QAAQ,EAAE;AAAA,IAC7D,OAAO,EAAE,GAAG,MAAM,MAAM;AAAA,IACxB,aAAa,MAAM;AAAA,IACnB,WAAW,MAAM;AAAA,EACnB;AACF;AAEA,SAAS,eAAe,OAAyB,OAAyB;AACxE,QAAM,SAAS,MAAM,SAAS,IAAI,YAAY;AAC9C,QAAM,UAAU,MAAM,QAAQ,YAAY;AAC1C,MAAI,QAAQ;AACZ,aAAW,QAAQ,OAAO;AACxB,UAAM,YAAY,iBAAiB,OAAO,IAAI;AAC9C,QAAI,YAAY,EAAG,UAAS,KAAK,IAAI,YAAY,MAAM,IAAI;AAC3D,UAAM,cAAc,iBAAiB,SAAS,IAAI;AAClD,QAAI,cAAc,EAAG,UAAS,KAAK,IAAI,cAAc,MAAM,GAAG;AAAA,EAChE;AACA,SAAO,KAAK,IAAI,OAAO,CAAC;AAC1B;AAEA,SAAS,iBAAiB,UAAkB,QAAwB;AAClE,MAAI,CAAC,YAAY,CAAC,OAAQ,QAAO;AACjC,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,UAAQ,WAAW,SAAS,QAAQ,QAAQ,QAAQ,OAAO,IAAI;AAC7D;AACA,gBAAY,OAAO;AAAA,EACrB;AACA,SAAO;AACT;;;ACtwCO,SAAS,gBAAgB,KAA4B;AACxD,QAAM,aAAa,IAAI,KAAK,EAAE,YAAY;AAC1C,QAAM,WAAW,aAAa,KAAK,UAAU;AAC7C,MAAI,YAAY,SAAS,CAAC,MAAM,OAAW,QAAO,IAAI,SAAS,CAAC,CAAC;AACjE,QAAM,WAAW,UAAU,KAAK,UAAU;AAC1C,MAAI,YAAY,SAAS,CAAC,MAAM,OAAW,QAAO,IAAI,SAAS,CAAC,CAAC;AACjE,SAAO;AACX;AAEO,SAAS,8BACZ,OACA,YACkB;AAClB,MAAI,WAAW,SAAS,EAAG,QAAO,CAAC;AACnC,QAAM,UAA8B,CAAC;AACrC,aAAW,SAAS,MAAM,QAAQ;AAC9B,QAAI,CAAC,MAAM,OAAQ;AACnB,QAAI,MAAM,oBAAoB,KAAK,CAAC,OAAO,WAAW,IAAI,EAAE,CAAC,GAAG;AAC5D,cAAQ,KAAK,KAAK;AAAA,IACtB;AAAA,EACJ;AACA,SAAO,QAAQ,KAAK,CAAC,GAAG,MAAM,YAAY,EAAE,OAAO,IAAI,YAAY,EAAE,OAAO,CAAC;AACjF;AAEO,SAAS,mBAAmB,OAAyB,SAAgC;AACxF,QAAM,QAAQ,MAAM,OAAO,KAAK,CAAC,MAAM,EAAE,YAAY,OAAO;AAC5D,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,QAAkB,CAAC,GAAG,MAAM,cAAc;AAChD,QAAM,UAAU,oBAAI,IAAY;AAChC,SAAO,MAAM,SAAS,GAAG;AACrB,UAAM,YAAY,MAAM,MAAM;AAC9B,QAAI,QAAQ,IAAI,SAAS,EAAG;AAC5B,YAAQ,IAAI,SAAS;AACrB,UAAM,UAAU,MAAM,OAAO,KAAK,CAAC,MAAM,EAAE,YAAY,SAAS;AAChE,QAAI,CAAC,QAAS;AACd,QAAI,QAAQ,OAAQ,QAAO,QAAQ;AACnC,eAAW,cAAc,QAAQ,gBAAgB;AAC7C,UAAI,CAAC,QAAQ,IAAI,UAAU,EAAG,OAAM,KAAK,UAAU;AAAA,IACvD;AAAA,EACJ;AACA,SAAO;AACX;AAMO,SAAS,gBACZ,OACA,UACA,UAA6B,CAAC,GACd;AAChB,QAAM,UAAU,IAAI,IAAI,QAAQ;AAEhC,QAAM,UAAU,MAAM,OAAO,IAAI,CAAC,UAAU;AACxC,QAAI,CAAC,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC,MAAM,OAAQ,QAAO;AACzD,WAAO;AAAA,MACH,GAAG;AAAA,MACH,QAAQ;AAAA,MACR,YAAY,MAAM;AAAA,MAClB,WAAW,MAAM;AAAA,IACrB;AAAA,EACJ,CAAC;AAED,MAAI,QAAQ;AACZ,MAAI,QAAQ,MAAM;AACd,UAAM,UAAU,oBAAI,IAAY;AAChC,UAAM,QAAkB,CAAC;AACzB,eAAW,MAAM,UAAU;AACvB,YAAM,QAAQ,QAAQ,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE;AAClD,UAAI,MAAO,OAAM,KAAK,GAAG,MAAM,cAAc;AAAA,IACjD;AACA,WAAO,MAAM,SAAS,GAAG;AACrB,YAAM,KAAK,MAAM,MAAM;AACvB,UAAI,QAAQ,IAAI,EAAE,EAAG;AACrB,cAAQ,IAAI,EAAE;AACd,cAAQ,MAAM,IAAI,CAAC,UAAU;AACzB,YAAI,MAAM,YAAY,GAAI,QAAO;AACjC,cAAM,KAAK,GAAG,MAAM,cAAc;AAClC,eAAO,MAAM,SAAS,EAAE,GAAG,OAAO,QAAQ,MAAM,IAAI;AAAA,MACxD,CAAC;AAAA,IACL;AAAA,EACJ;AAEA,SAAO,EAAE,GAAG,OAAO,QAAQ,MAAM;AACrC;AAOO,SAAS,4BACZ,UACA,wBACA,OACqB;AACrB,QAAM,WAA0B,CAAC;AACjC,aAAW,WAAW,UAAU;AAC5B,QAAI,CAAC,uBAAuB,IAAI,QAAQ,EAAE,EAAG;AAC7C,UAAM,eAAe,MAAM,OAAO;AAAA,MAC9B,CAAC,MAAM,EAAE,UAAU,EAAE,oBAAoB,SAAS,QAAQ,EAAE;AAAA,IAChE;AACA,QAAI,CAAC,aAAc,UAAS,KAAK,OAAO;AAAA,EAC5C;AAEA,MAAI,SAAS,WAAW,EAAG,QAAO,EAAE,SAAS,IAAI,eAAe,EAAE;AAElE,QAAM,QAAkB,CAAC;AACzB,MAAI,cAAc;AAClB,QAAM,cAAc;AACpB,QAAM,kBAAkB;AAExB,aAAW,WAAW,UAAU;AAC5B,QAAI,eAAe,YAAa;AAChC,UAAM,OAAO,QAAQ,QAAQ;AAC7B,UAAM,YAAY,KAAK,SAAS,kBAAkB,KAAK,MAAM,GAAG,eAAe,IAAI,QAAQ;AAC3F,UAAM,QACF,QAAQ,YAAY,QAAQ,gBAAgB,SACtC,GAAG,QAAQ,QAAQ,KAAK,SAAS,KACjC,IAAI,QAAQ,IAAI,KAAK,SAAS;AACxC,UAAM,KAAK,KAAK;AAChB,mBAAe,MAAM,SAAS;AAAA,EAClC;AAEA,SAAO,EAAE,SAAS,MAAM,KAAK,IAAI,GAAG,eAAe,SAAS,OAAO;AACvE;AAgCO,SAAS,oBACZ,OACA,OACA,UACA,UAAiC,CAAC,GACZ;AACtB,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,YAAY,IAAI,IAAI,MAAM,mBAAmB;AAEnD,MAAI,MAAM;AACN,UAAM,OAAO,SAAS,OAAO,CAAC,MAAM,UAAU,IAAI,EAAE,EAAE,CAAC;AACvD,QAAI,KAAK,WAAW,EAAG,QAAO,EAAE,MAAM,IAAI,OAAO,EAAE;AACnD,WAAO,EAAE,MAAM,KAAK,IAAI,aAAa,EAAE,KAAK,MAAM,GAAG,OAAO,KAAK,OAAO;AAAA,EAC5E;AAIA,QAAM,iBAAqC,CAAC;AAC5C,QAAM,gBAAgB,oBAAI,IAAY;AACtC,aAAW,WAAW,MAAM,gBAAgB;AACxC,UAAM,QAAQ,MAAM,OAAO,KAAK,CAAC,MAAM,EAAE,YAAY,OAAO;AAC5D,QAAI,CAAC,OAAO,OAAQ;AACpB,mBAAe,KAAK,KAAK;AACzB,eAAW,MAAM,MAAM,oBAAqB,eAAc,IAAI,EAAE;AAAA,EACpE;AAEA,QAAM,QAAkB,CAAC;AACzB,aAAW,SAAS,gBAAgB;AAChC,UAAM,QAAQ,MAAM,QAAQ,GAAG,MAAM,OAAO,KAAK,MAAM,KAAK,KAAK,MAAM;AACvE,UAAM,KAAK,GAAG,cAAc,WAAM,KAAK;AAAA,EAAK,MAAM,OAAO,EAAE;AAAA,EAC/D;AAEA,MAAI,cAAc;AAClB,aAAW,KAAK,UAAU;AACtB,QAAI,UAAU,IAAI,EAAE,EAAE,KAAK,CAAC,cAAc,IAAI,EAAE,EAAE,GAAG;AACjD,YAAM,KAAK,cAAc,CAAC,CAAC;AAC3B;AAAA,IACJ;AAAA,EACJ;AAEA,QAAM,QAAQ,cAAc,eAAe;AAC3C,MAAI,UAAU,EAAG,QAAO,EAAE,MAAM,IAAI,OAAO,EAAE;AAC7C,SAAO,EAAE,MAAM,MAAM,KAAK,MAAM,GAAG,MAAM;AAC7C;AAEA,SAAS,cAAc,SAA8B;AACjD,QAAM,OAAO,QAAQ,QAAQ;AAC7B,MAAI,QAAQ,YAAY,QAAQ,gBAAgB,QAAQ;AACpD,WAAO,IAAI,QAAQ,IAAI,WAAM,QAAQ,QAAQ;AAAA,EAAM,IAAI;AAAA,EAC3D;AACA,SAAO,IAAI,QAAQ,IAAI;AAAA,EAAM,IAAI;AACrC;AAEA,SAAS,YAAY,SAAyB;AAC1C,QAAM,QAAQ,WAAW,KAAK,OAAO;AACrC,SAAO,SAAS,MAAM,CAAC,MAAM,SAAY,OAAO,MAAM,CAAC,CAAC,IAAI;AAChE;;;ACtNA,SAASC,cAAa,GAAmB;AACrC,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,KAAK,EAAG,QAAO;AAC1C,SAAO,KAAK,MAAO,IAAI,IAAI,KAAM,QAAQ,CAAC,CAAC,MAAM,OAAO,CAAC;AAC7D;AAEA,SAAS,IAAI,GAAW,OAAuB;AAC3C,MAAI,KAAK,KAAK,SAAS,EAAG,QAAO;AACjC,SAAO,KAAK,IAAI,GAAG,KAAK,MAAO,IAAI,QAAS,GAAG,CAAC;AACpD;AAEA,SAASC,aAAY,SAAyB;AAC1C,QAAM,QAAQ,WAAW,KAAK,OAAO;AACrC,SAAO,SAAS,MAAM,CAAC,MAAM,SAAY,OAAO,MAAM,CAAC,CAAC,IAAI;AAChE;AAEA,SAAS,gBAAgB,OAAyB,aAA4C;AAC1F,SAAO,YAAY,MAAM,OAAO;AACpC;AAEA,SAAS,0BACL,OACA,QACA,cACM;AAQN,SAAO,MAAM;AACjB;AAEA,SAAS,UAAU,OAAiC;AAChD,SAAO,IAAI,MAAM,IAAI;AACzB;AAEA,SAAS,cACL,QACA,aACa;AACb,QAAM,aAAqC,CAAC;AAC5C,aAAW,SAAS,QAAQ;AACxB,eAAW,MAAM,IAAI,KAAK,WAAW,MAAM,IAAI,KAAK,KAAK,gBAAgB,OAAO,WAAW;AAAA,EAC/F;AACA,QAAM,QAAQ,OAAO,KAAK,UAAU,EAAE,IAAI,MAAM;AAChD,MAAI,MAAM,UAAU,EAAG,QAAO;AAC9B,QAAM,QAAkB,CAAC;AACzB,aAAW,QAAQ,CAAC,GAAG,GAAG,CAAC,GAAG;AAC1B,QAAI,WAAW,IAAI,EAAG,OAAM,KAAK,IAAI,IAAI,KAAKD,cAAa,WAAW,IAAI,CAAC,CAAC,EAAE;AAAA,EAClF;AACA,SAAO,MAAM,KAAK,KAAK;AAC3B;AASA,SAAS,eACL,UACA,OACA,aACwD;AACxD,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,SAAS,MAAM,QAAQ;AAC9B,QAAI,CAAC,MAAM,OAAQ;AACnB,eAAW,MAAM,MAAM,oBAAqB,YAAW,IAAI,EAAE;AAAA,EACjE;AACA,MAAI,gBAAgB;AACpB,aAAW,SAAS,MAAM,QAAQ;AAC9B,QAAI,MAAM,OAAQ,kBAAiB,gBAAgB,OAAO,WAAW;AAAA,EACzE;AACA,QAAM,UAAgC,CAAC;AACvC,WAAS,QAAQ,CAAC,SAAS,UAAU;AACjC,QAAI,WAAW,IAAI,QAAQ,EAAE,EAAG;AAChC,UAAM,MAAM,UAAU,MAAM,aAAa,QAAQ,EAAE;AACnD,QAAI,CAAC,IAAK;AACV,UAAM,SAAS,YAAY,QAAQ,QAAQ,EAAE;AAC7C,UAAM,OAAO,QAAQ,YAAY;AACjC,QAAI,SAAS,EAAG,SAAQ,KAAK,EAAE,KAAK,QAAQ,MAAM,MAAM,CAAC;AAAA,EAC7D,CAAC;AACD,SAAO,EAAE,SAAS,cAAc;AACpC;AAUO,SAAS,kBACZ,OACA,UACA,aACA,UAA+B,CAAC,GAC1B;AACN,QAAM,QAAQ,QAAQ;AACtB,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,aAAa,QAAQ;AAC3B,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,QAAQ,QAAQ,SAAS;AAE/B,QAAME,gBAAe,MAAM,OACtB,OAAO,CAAC,MAAM,EAAE,MAAM,EACtB,KAAK,CAAC,GAAG,MAAMD,aAAY,EAAE,OAAO,IAAIA,aAAY,EAAE,OAAO,CAAC;AAEnE,MAAI,UAAU,cAAc;AACxB,WAAO,0BAA0BC,eAAc,OAAO,MAAM,OAAO,WAAW;AAAA,EAClF;AAEA,QAAM,EAAE,SAAS,cAAc,IAAI,eAAe,UAAU,OAAO,WAAW;AAE9E,MAAI,UAAU,gBAAgB;AAC1B,QAAI,SAAS,YAAY;AACrB,aAAO,uBAAuB,SAAS,YAAY,MAAM,KAAK;AAAA,IAClE;AACA,WAAO,yBAAyB,OAAO;AAAA,EAC3C;AAEA,SAAO,eAAe,SAAS,eAAeA,eAAc,OAAO,aAAa,KAAK;AACzF;AAEA,SAAS,eACL,SACA,eACA,QACA,OACA,aACA,OACM;AACN,QAAM,QAAkB,CAAC;AACzB,QAAM,cAAc,oBAAI,IAAoB;AAC5C,aAAW,WAAW,SAAS;AAC3B,gBAAY,IAAI,QAAQ,OAAO,YAAY,IAAI,QAAQ,IAAI,KAAK,KAAK,QAAQ,MAAM;AAAA,EACvF;AACA,QAAM,UAAU,CAAC,GAAG,YAAY,QAAQ,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC;AAE7E,QAAM,YAAY,QACb,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,EAC/B,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,QAAQ,CAAC;AACzC,QAAM,YAAY,QACb,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,EAC/B,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,QAAQ,CAAC;AACzC,QAAM,QAAQ,gBAAgB,YAAY;AAE1C,QAAM,KAAK,mBAAmB;AAC9B,QAAM;AAAA,IACF,KAAKF,cAAa,SAAS,CAAC,UAAU,IAAI,WAAW,KAAK,CAAC,QAAQA,cAAa,SAAS,CAAC,UAAU,IAAI,WAAW,KAAK,CAAC,QAAQA,cAAa,aAAa,CAAC,eAAe,IAAI,eAAe,KAAK,CAAC;AAAA,EACxM;AACA,QAAM,WAAW,CAAC,GAAG,YAAY,QAAQ,CAAC,EACrC,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,CAAC;AACf,MAAI,SAAS,SAAS,GAAG;AACrB,UAAM,KAAK,gBAAgB,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE;AAAA,EAChG;AAEA,QAAM,KAAK,EAAE;AACb,MAAI,OAAO,WAAW,GAAG;AACrB,UAAM,KAAK,mBAAmB;AAC9B,UAAM,KAAK,yBAAyB;AAAA,EACxC,OAAO;AACH,UAAM,eAAe,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,gBAAgB,GAAG,WAAW,GAAG,CAAC;AACnF,UAAM,iBAAiB,OAAO;AAAA,MAC1B,CAAC,GAAG,MAAM,IAAI,0BAA0B,GAAG,OAAO,WAAW;AAAA,MAC7D;AAAA,IACJ;AACA,UAAM;AAAA,MACF,4BAAuB,OAAO,MAAM,YAAYA,cAAa,YAAY,CAAC,aAAaA,cAAa,cAAc,CAAC;AAAA,IACvH;AACA,UAAM,YAAY,cAAc,QAAQ,WAAW;AACnD,QAAI,UAAW,OAAM,KAAK,iBAAiB,SAAS,EAAE;AACtD,UAAM,KAAK,EAAE;AACb,UAAM,SAAS,CAAC,GAAG,MAAM,EAAE;AAAA,MACvB,CAAC,GAAG,MACA,0BAA0B,GAAG,OAAO,WAAW,IAC3C,0BAA0B,GAAG,OAAO,WAAW,KACnD,EAAE,YAAY,EAAE;AAAA,IACxB;AACA,eAAW,SAAS,OAAO,MAAM,GAAG,KAAK,GAAG;AACxC,YAAM,QAAQ,MAAM,SAAS;AAC7B,YAAM,MAAM,0BAA0B,OAAO,OAAO,WAAW;AAC/D,YAAM;AAAA,QACF,KAAK,MAAM,OAAO,KAAK,UAAU,KAAK,CAAC,MAAMA,cAAa,GAAG,CAAC,SAAIA,cAAa,gBAAgB,OAAO,WAAW,CAAC,CAAC,KAAK,MAAM,oBAAoB,MAAM,WAAW,KAAK;AAAA,MAC5K;AAAA,IACJ;AAAA,EACJ;AAEA,QAAM,KAAK,EAAE;AACb,QAAM;AAAA,IACF,wEAAwE,WAAW,MAAM;AAAA,EAC7F;AACA,SAAO,MAAM,KAAK,IAAI;AAC1B;AAEA,SAAS,yBAAyB,SAAuC;AACrE,QAAM,QAAkB,CAAC;AACzB,QAAM,cAAc,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AAC5D,QAAM,KAAK,uBAAkBA,cAAa,WAAW,CAAC,MAAM,QAAQ,MAAM,mBAAmB;AAC7F,QAAM,KAAK,EAAE;AACb,MAAI,QAAQ,WAAW,GAAG;AACtB,UAAM,KAAK,8BAA8B;AACzC,WAAO,MAAM,KAAK,IAAI;AAAA,EAC1B;AAKA,QAAMG,UAAS,CAAC,QAAwB;AACpC,UAAM,IAAI,IAAI,MAAM,KAAK;AACzB,WAAO,IAAI,SAAS,EAAE,CAAC,GAAG,EAAE,IAAI;AAAA,EACpC;AACA,QAAM,SAAmB,CAAC;AAC1B,aAAW,KAAK,SAAS;AACrB,UAAM,MAAMA,QAAO,EAAE,GAAG;AACxB,UAAM,OAAO,OAAO,OAAO,SAAS,CAAC;AACrC,QAAI,QAAQ,QAAQ,KAAK,WAAW,KAAK,OAAO;AAC5C,WAAK,SAAS,EAAE;AAChB,WAAK,SAAS;AACd,WAAK,UAAU,EAAE;AAAA,IACrB,OAAO;AACH,aAAO,KAAK,EAAE,UAAU,EAAE,KAAK,QAAQ,EAAE,KAAK,UAAU,KAAK,OAAO,GAAG,QAAQ,EAAE,QAAQ,MAAM,EAAE,KAAK,CAAC;AAAA,IAC3G;AAAA,EACJ;AACA,aAAW,KAAK,OAAO,MAAM,GAAG,EAAE,GAAG;AACjC,UAAM,QAAQ,EAAE,UAAU,IAAI,EAAE,WAAW,GAAG,EAAE,QAAQ,SAAI,EAAE,MAAM;AACpE,UAAM,KAAK,KAAK,KAAK,MAAM,EAAE,KAAK,UAAUH,cAAa,EAAE,MAAM,CAAC,GAAG,EAAE,QAAQ,IAAI,KAAK,KAAK,MAAM,EAAE,SAAS,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE;AAAA,EACnJ;AACA,MAAI,OAAO,SAAS,IAAI;AACpB,UAAM,KAAK,aAAa,OAAO,SAAS,EAAE,cAAc;AAAA,EAC5D;AACA,SAAO,MAAM,KAAK,IAAI;AAC1B;AAEA,SAAS,uBACL,SACA,YACA,MACA,OACM;AACN,MAAI,WAAW;AACf,MAAI,WAAY,YAAW,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU;AAEvE,MAAI,SAAS,OAAQ,UAAS,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAAA,WACrD,SAAS,OAAQ,UAAS,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,cAAc,EAAE,IAAI,KAAK,EAAE,SAAS,EAAE,MAAM;AAAA,MAChG,UAAS,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AAEhD,QAAM,cAAc,SAAS,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AAC7D,QAAM,YAAY,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AAC1D,QAAM,SAAS,aACT,uBAAkB,UAAU,KAAKA,cAAa,WAAW,CAAC,MAAM,SAAS,MAAM,WAAW,IAAI,aAAa,SAAS,CAAC,iBACrH,uBAAkBA,cAAa,WAAW,CAAC,MAAM,SAAS,MAAM;AACtE,QAAM,QAAQ,CAAC,QAAQ,aAAa,IAAI,IAAI,EAAE;AAC9C,QAAM,QAAQ,SAAS,MAAM,GAAG,KAAK;AACrC,aAAW,WAAW,OAAO;AACzB,UAAM,KAAK,KAAK,QAAQ,GAAG,KAAKA,cAAa,QAAQ,MAAM,CAAC,KAAK,QAAQ,IAAI,EAAE;AAAA,EACnF;AACA,MAAI,SAAS,SAAS,MAAM,QAAQ;AAChC,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,GAAG,MAAM,MAAM,OAAO,SAAS,MAAM,SAAS;AAAA,EAC7D;AACA,SAAO,MAAM,KAAK,IAAI;AAC1B;AAEA,SAAS,0BACL,QACA,OACA,MACA,OACA,aACM;AACN,MAAI,SAAS,CAAC,GAAG,MAAM;AACvB,MAAI,SAAS,OAAQ,QAAO,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AAAA,WAC3D,SAAS,MAAO,QAAO,KAAK,CAAC,GAAG,MAAM,EAAE,gBAAgB,EAAE,aAAa;AAAA;AAE5E,WAAO;AAAA,MACH,CAAC,GAAG,MACA,0BAA0B,GAAG,OAAO,WAAW,IAC3C,0BAA0B,GAAG,OAAO,WAAW,KACnD,EAAE,YAAY,EAAE;AAAA,IACxB;AAEJ,QAAM,eAAe,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,gBAAgB,GAAG,WAAW,GAAG,CAAC;AACnF,QAAM,iBAAiB,OAAO;AAAA,IAC1B,CAAC,GAAG,MAAM,IAAI,0BAA0B,GAAG,OAAO,WAAW;AAAA,IAC7D;AAAA,EACJ;AACA,QAAM,QAAQ;AAAA,IACV,qBAAgB,OAAO,MAAM,aAAaA,cAAa,cAAc,CAAC,oBAAeA,cAAa,YAAY,CAAC;AAAA,EACnH;AACA,QAAM,YAAY,cAAc,QAAQ,WAAW;AACnD,MAAI,UAAW,OAAM,KAAK,eAAe,SAAS,EAAE;AACpD,QAAM,KAAK,EAAE;AACb,QAAM,QAAQ,OAAO,MAAM,GAAG,KAAK;AACnC,aAAW,SAAS,OAAO;AACvB,UAAM,SAAS,MAAM,eAAe,SAAS,IAAI,YAAY,MAAM,eAAe,KAAK,GAAG,CAAC,MAAM;AACjG,UAAM,QAAQ,MAAM,SAAS;AAC7B,UAAM,MAAM,0BAA0B,OAAO,OAAO,WAAW;AAC/D,UAAM;AAAA,MACF,KAAK,MAAM,OAAO,KAAK,UAAU,KAAK,CAAC,MAAMA,cAAa,GAAG,CAAC,SAAIA,cAAa,gBAAgB,OAAO,WAAW,CAAC,CAAC,KAAK,MAAM,oBAAoB,MAAM,cAAc,MAAM,aAAa,IAAI,MAAM,UAAU,GAAG,MAAM;AAAA,IAC1N;AACA,UAAM,KAAK,QAAQ,KAAK,GAAG;AAAA,EAC/B;AACA,MAAI,OAAO,SAAS,MAAM,QAAQ;AAC9B,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,GAAG,MAAM,MAAM,OAAO,OAAO,MAAM,SAAS;AAAA,EAC3D;AACA,SAAO,MAAM,KAAK,IAAI;AAC1B;AAEO,SAAS,WACZ,OACA,SACM;AACN,QAAME,gBAAe,MAAM,OACtB,OAAO,CAAC,MAAM,EAAE,MAAM,EACtB,KAAK,CAAC,GAAG,MAAMD,aAAY,EAAE,OAAO,IAAIA,aAAY,EAAE,OAAO,CAAC;AAEnE,MAAI,YAAY,QAAW;AACvB,UAAM,QAAQ,MAAM,OAAO,KAAK,CAAC,MAAM,EAAE,YAAY,OAAO;AAC5D,QAAI,CAAC,OAAO;AACR,YAAM,aAAaC,cAAa,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,IAAI;AAC/D,aAAO,SAAS,OAAO,8BAA8B,UAAU;AAAA,IACnE;AACA,QAAI,CAAC,MAAM,QAAQ;AACf,aAAO,SAAS,OAAO;AAAA,IAC3B;AACA,UAAM,QAAQ,GAAG,MAAM,oBAAoB,MAAM;AACjD,WAAO;AAAA,EAAsC,MAAM,OAAO;AAAA;AAAA,GAAQ,OAAO,MAAM,KAAK,cAAc,MAAM,SAAS,QAAQ;AAAA,EAC7H;AAEA,MAAIA,cAAa,WAAW,EAAG,QAAO;AAEtC,QAAM,QAAQ,CAAC,8BAA8BA,cAAa,MAAM,IAAI;AACpE,aAAW,SAASA,eAAc;AAC9B,UAAM,QAAQ,GAAG,MAAM,oBAAoB,MAAM;AACjD,UAAM,UAAU,MAAM,QAAQ,MAAM,GAAG,GAAG;AAC1C,UAAM,KAAK;AAAA,EAAK,MAAM,OAAO,MAAM,KAAK,OAAO,MAAM,SAAS,QAAQ,GAAG;AACzE,UAAM,KAAK,KAAK,OAAO,GAAG,MAAM,QAAQ,SAAS,MAAM,QAAQ,EAAE,EAAE;AAAA,EACvE;AACA,QAAM,KAAK;AAAA,2CAA8C;AACzD,SAAO,MAAM,KAAK,IAAI;AAC1B;;;AChUO,SAAS,wBACZ,OACA,UACA,QACA,QAAsB,CAAC,GACV;AACb,QAAM,OAAO,WAAW,EAAE,aAAa,MAAM,eAAe,mBAAmB,CAAC;AAChF,QAAM,YAAY,WAAW,UAAU;AAAA,IACnC,UAAU,MAAM;AAAA,IAChB,WAAW,iBAAiB,MAAM,WAAW,IAAI;AAAA,EACrD,CAAC;AACD,MAAI,UAA4B,EAAE,GAAG,OAAO,aAAa,UAAU,IAAI;AAEvE,QAAM,cAAc,2BAA2B,QAAQ;AACvD,MAAI,gBAAgB;AAEpB,aAAW,cAAc,aAAa;AAClC,UAAM,SAAS,cAAc,WAAW,OAAO,WAAW,MAAM;AAChE,QAAI,OAAO,WAAW,EAAG;AACzB,UAAM,SAAS,KAAK,iBAAiB,EAAE,QAAQ,UAAU,OAAO,SAAS,OAAO,CAAC;AACjF,cAAU,OAAO;AACjB,qBAAiB,OAAO,OAAO;AAAA,EACnC;AAEA,SAAO,EAAE,OAAO,SAAS,cAAc;AAC3C;AAOA,SAAS,2BAA2B,UAA+C;AAC/E,QAAM,cAAoC,CAAC;AAC3C,aAAW,WAAW,UAAU;AAC5B,QAAI,QAAQ,aAAa,cAAc,QAAQ,gBAAgB,YAAa;AAC5E,QAAI;AACJ,QAAI;AACA,cAAQ,KAAK,MAAM,QAAQ,QAAQ,EAAE;AAAA,IACzC,QAAQ;AACJ;AAAA,IACJ;AACA,gBAAY,KAAK,EAAE,QAAQ,QAAQ,YAAY,MAAM,CAAC;AAAA,EAC1D;AACA,SAAO;AACX;AAEA,SAAS,cACL,OACA,QAOD;AACC,QAAM,UAAW,OAAmC;AACpD,MAAI,CAAC,MAAM,QAAQ,OAAO,EAAG,QAAO,CAAC;AACrC,QAAM,SAAS,CAAC;AAChB,aAAW,SAAS,SAAS;AACzB,QAAI,CAAC,SAAS,OAAO,UAAU,SAAU;AACzC,UAAM,IAAI;AACV,QAAI,OAAO,EAAE,YAAY,SAAU;AACnC,UAAM,QAAQ,EAAE,WAAW,EAAE;AAC7B,UAAM,MAAM,EAAE,SAAS,EAAE;AACzB,QAAI,OAAO,UAAU,YAAY,OAAO,QAAQ,SAAU;AAC1D,WAAO,KAAK;AAAA,MACR,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,SAAS,EAAE;AAAA,MACX,OAAO,OAAO,EAAE,UAAU,WAAW,EAAE,QAAQ;AAAA,MAC/C,gBAAgB;AAAA,IACpB,CAAC;AAAA,EACL;AACA,SAAO;AACX;;;AClGO,SAAS,wBACd,UACA,YACkB;AAClB,SAAO,aAAa,aAAa,SAAS;AAC5C;;;ACJO,SAAS,KAAK,MAAsB;AACvC,MAAI,IAAI;AACR,MAAI,EAAE,UAAU,EAAG,QAAO;AAC1B,MAAI,EAAE,SAAS,KAAK,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE,IAAI;AAAA,WACnC,EAAE,SAAS,KAAK,KAAK,EAAE,SAAS,KAAK,KAAK,EAAE,SAAS,KAAK,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AAAA,WAC9E,EAAE,SAAS,MAAM,KAAK,EAAE,SAAS,MAAM,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AAAA,WAC3D,EAAE,SAAS,GAAG,KAAK,CAAC,EAAE,SAAS,IAAI,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AAChE,MAAI,EAAE,SAAS,KAAK,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AACxD,MAAI,EAAE,SAAS,IAAI,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AACvD,MAAI,EAAE,SAAS,OAAO,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AAAA,WACjD,EAAE,SAAS,MAAM,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE,IAAI;AAAA,WACzD,EAAE,SAAS,KAAK,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AAC7D,MAAI,EAAE,SAAS,MAAM,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AACzD,MAAI,EAAE,SAAS,MAAM,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AACzD,MAAI,EAAE,SAAS,IAAI,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AACvD,SAAO;AACX;;;ACIO,IAAM,MAAM;AACnB,IAAM,aAAa;AAEnB,IAAM,eAAe,IAAI,KAAK,UAAU,MAAM,EAAE,aAAa,OAAO,CAAC;AAYrE,SAAS,aAAa,MAA0B;AAC5C,QAAM,QAAQ,KAAK,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC;AAC9C,MAAI,MAAM,SAAS,EAAG,QAAO;AAC7B,QAAM,MAAM,KAAK,KAAK,EAAE;AACxB,QAAM,MAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,IAAI,SAAS,GAAG,IAAK,KAAI,KAAK,IAAI,MAAM,GAAG,IAAI,CAAC,CAAC;AACrE,aAAW,MAAM,IAAK,KAAI,KAAK,EAAE;AACjC,SAAO;AACX;AAMO,SAAS,SAAS,MAAc,OAAwB,CAAC,GAAa;AACzE,QAAM,QAAQ,KAAK,YAAY;AAC/B,QAAM,SAAmB,CAAC;AAE1B,QAAM,QAAQ,MAAM,MAAM,UAAU,KAAK,CAAC;AAC1C,WAAS,KAAK,OAAO;AACjB,QAAI,EAAE,UAAU,GAAG;AACf,UAAI,KAAK,KAAM,KAAI,KAAK,CAAC;AACzB,aAAO,KAAK,CAAC;AAAA,IACjB;AAAA,EACJ;AAcA,MAAI,CAAC,IAAI,KAAK,KAAK,EAAG,QAAO;AAI7B,QAAM,UAAsB,CAAC;AAC7B,MAAI,MAAuB;AAC3B,aAAW,KAAK,aAAa,QAAQ,KAAK,GAAG;AACzC,UAAM,IAAI,EAAE;AACZ,QAAI,EAAE,WAAW,EAAG;AACpB,QAAI,IAAI,KAAK,CAAC,GAAG;AACb,OAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;AAAA,IACvB,WAAW,KAAK;AACZ,cAAQ,KAAK,GAAG;AAChB,YAAM;AAAA,IACV;AAAA,EACJ;AACA,MAAI,IAAK,SAAQ,KAAK,GAAG;AAEzB,aAAW,QAAQ,SAAS;AACxB,WAAO,KAAK,GAAG,aAAa,IAAI,CAAC;AAAA,EACrC;AAEA,SAAO;AACX;AAGO,SAAS,YAAY,MAAwB;AAChD,QAAM,QAAkB,CAAC;AACzB,WAAS,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK;AACtC,UAAM,OAAO,KAAK,MAAM,GAAG,IAAI,CAAC;AAChC,QAAI,KAAK,KAAK,EAAE,WAAW,KAAK,OAAQ,OAAM,KAAK,IAAI;AAAA,EAC3D;AACA,SAAO;AACX;AAGO,SAAS,MAAM,MAAcE,OAAoC;AACpE,QAAM,IAAI,oBAAI,IAAoB;AAClC,aAAW,KAAK,SAAS,MAAM,EAAE,MAAAA,MAAK,CAAC,EAAG,GAAE,IAAI,IAAI,EAAE,IAAI,CAAC,KAAK,KAAK,CAAC;AACtE,SAAO;AACX;;;AC3FA,IAAM,oBAAoB,IAAI,OAAO;AACrC,IAAI,WAAW;AACf,IAAM,QAAQ,oBAAI,IAAyB;AAC3C,IAAI,cAAc;AAElB,SAAS,MAAM,MAA2B;AACtC,QAAM,KAAK,MAAM,MAAM,IAAI;AAC3B,MAAI,MAAM;AACV,aAAW,KAAK,GAAG,OAAO,EAAG,QAAO;AACpC,QAAM,QAAQ,KAAK,YAAY;AAC/B,SAAO,EAAE,IAAI,KAAK,OAAO,OAAO,IAAI,IAAI,YAAY,KAAK,CAAC,EAAE;AAChE;AAEO,SAAS,YAAY,MAA2B;AACnD,QAAM,MAAM,MAAM,IAAI,IAAI;AAC1B,MAAI,IAAK,QAAO;AAChB,QAAM,IAAI,MAAM,IAAI;AACpB,MAAI,KAAK,SAAS,KAAK,KAAK,UAAU,UAAU;AAC5C,WAAO,cAAc,KAAK,SAAS,YAAY,MAAM,OAAO,GAAG;AAC3D,YAAM,IAAI,MAAM,KAAK,EAAE,KAAK,EAAE;AAC9B,qBAAe,EAAE;AACjB,YAAM,OAAO,CAAC;AAAA,IAClB;AACA,UAAM,IAAI,MAAM,CAAC;AACjB,mBAAe,KAAK;AAAA,EACxB;AACA,SAAO;AACX;AAGO,SAAS,mBAAyB;AACrC,QAAM,MAAM;AACZ,gBAAc;AAClB;AAMO,SAAS,eAAe,OAAqB;AAChD,aAAW,KAAK,IAAI,GAAG,KAAK;AAC5B,SAAO,cAAc,YAAY,MAAM,OAAO,GAAG;AAC7C,UAAM,IAAI,MAAM,KAAK,EAAE,KAAK,EAAE;AAC9B,mBAAe,EAAE;AACjB,UAAM,OAAO,CAAC;AAAA,EAClB;AACJ;AAGO,SAAS,eAAmD;AAC/D,SAAO,EAAE,SAAS,MAAM,MAAM,OAAO,YAAY;AACrD;;;ACzEO,IAAM,qBAAsC;AAAA,EAC/C,MAAM;AAAA,EACN,aAAa;AAAA,EACb,MAAM,MAAmB,OAA8B;AACnD,UAAM,QAAQ,MAAM,YAAY,EAAE,KAAK,EAAE,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAChF,QAAI,MAAM,WAAW,EAAG,QAAO,KAAK,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,OAAO,EAAE,EAAE;AACzE,WAAO,KAAK,IAAI,CAAC,MAAM;AACnB,YAAM,WAAW,YAAY,EAAE,IAAI,EAAE;AACrC,UAAI,QAAQ;AACZ,iBAAW,QAAQ,MAAO,UAASC,kBAAiB,UAAU,IAAI;AAClE,aAAO,EAAE,KAAK,EAAE,KAAK,MAAM;AAAA,IAC/B,CAAC;AAAA,EACL;AACJ;AAEA,SAASA,kBAAiB,UAAkB,QAAwB;AAChE,MAAI,CAAC,OAAQ,QAAO;AACpB,SAAO,SAAS,MAAM,MAAM,EAAE,SAAS;AAC3C;;;ACXO,IAAM,gBAAiC;AAAA,EAC1C,MAAM;AAAA,EACN,aAAa;AAAA,EACb,MAAM,MAAmB,OAA8B;AACnD,UAAM,IAAI,KAAK;AACf,UAAM,KAAK;AACX,UAAM,IAAI;AACV,UAAM,SAAS,KAAK,IAAI,CAAC,MAAM;AAC3B,YAAM,IAAI,YAAY,EAAE,IAAI;AAC5B,aAAO,EAAE,IAAI,EAAE,KAAK,IAAI,EAAE,IAAI,KAAK,EAAE,IAAI;AAAA,IAC7C,CAAC;AACD,UAAM,QAAQ,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,KAAK,CAAC,KAAK,KAAK;AAE5D,UAAM,SAAS,SAAS,OAAO,EAAE,MAAM,KAAK,CAAC;AAC7C,QAAI,OAAO,WAAW,EAAG,QAAO,KAAK,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,OAAO,EAAE,EAAE;AAE1E,UAAM,MAAM,oBAAI,IAAoB;AACpC,eAAW,KAAK,IAAI,IAAI,MAAM,GAAG;AAC7B,UAAI,KAAK;AACT,iBAAW,KAAK,OAAQ,KAAI,EAAE,GAAG,IAAI,CAAC,EAAG;AACzC,UAAI,IAAI,GAAG,KAAK,IAAI,KAAK,IAAI,KAAK,QAAQ,KAAK,IAAI,CAAC;AAAA,IACxD;AAEA,WAAO,OAAO,IAAI,CAAC,MAAM;AACrB,UAAI,QAAQ;AACZ,iBAAW,KAAK,QAAQ;AACpB,cAAM,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK;AACzB,YAAI,MAAM,EAAG;AACb,cAAM,OAAO,IAAI,IAAI,CAAC,KAAK;AAC3B,iBAAU,QAAQ,KAAK,KAAK,OAAQ,IAAI,MAAM,IAAI,IAAK,IAAI,EAAE,OAAQ,SAAS;AAAA,MAClF;AACA,aAAO,EAAE,KAAK,EAAE,IAAI,MAAM;AAAA,IAC9B,CAAC;AAAA,EACL;AACJ;;;ACzBO,IAAM,iBAAkC;AAAA,EAC3C,MAAM;AAAA,EACN,aAAa;AAAA,EACb,MAAM,MAAmB,OAA8B;AAGnD,UAAM,UAAU,MAAM,YAAY,EAAE,MAAM,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,UAAU,KAAM,EAAE,UAAU,KAAK,IAAI,KAAK,CAAC,CAAE;AACjH,QAAI,QAAQ,WAAW,EAAG,QAAO,KAAK,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,OAAO,EAAE,EAAE;AAE3E,UAAM,SAAS,oBAAI,IAAY;AAC/B,eAAW,KAAK,QAAS,YAAW,KAAK,YAAY,CAAC,EAAG,QAAO,IAAI,CAAC;AACrE,QAAI,OAAO,SAAS,EAAG,QAAO,KAAK,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,OAAO,EAAE,EAAE;AAExE,WAAO,KAAK,IAAI,CAAC,MAAM;AACnB,YAAM,WAAW,YAAY,EAAE,IAAI,EAAE;AACrC,UAAI,OAAO;AACX,iBAAW,KAAK,OAAQ,KAAI,SAAS,IAAI,CAAC,EAAG;AAC7C,aAAO,EAAE,KAAK,EAAE,KAAK,OAAO,OAAO,OAAO,KAAK;AAAA,IACnD,CAAC;AAAA,EACL;AACJ;;;ACxBA,IAAM,SAAS;AACf,IAAM,UAAU;AAET,IAAM,kBAAmC;AAAA,EAC5C,MAAM;AAAA,EACN,aAAa;AAAA,EACb,MAAM,MAAmB,OAA8B;AACnD,UAAM,KAAK,cAAc,MAAM,MAAM,KAAK;AAC1C,UAAM,KAAK,eAAe,MAAM,MAAM,KAAK;AAC3C,UAAM,QAAQ,KAAK,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,GAAG,IAAI;AACtD,UAAM,QAAQ,KAAK,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,GAAG,IAAI;AACtD,UAAM,QAAQ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,QAAQ,KAAK,CAAC,CAAC;AAC7D,UAAM,QAAQ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,QAAQ,KAAK,CAAC,CAAC;AAC7D,WAAO,KAAK,IAAI,CAAC,OAAO;AAAA,MACpB,KAAK,EAAE;AAAA,MACP,OAAO,UAAU,MAAM,IAAI,EAAE,GAAG,KAAK,KAAK,WAAW,MAAM,IAAI,EAAE,GAAG,KAAK;AAAA,IAC7E,EAAE;AAAA,EACN;AACJ;;;AC5BA,IAAMC,YAAW,oBAAI,IAAgC;AAE9C,SAAS,wBAAwB,MAAgC;AACpE,EAAAA,UAAS,IAAI,KAAK,MAAM,IAAI;AAChC;AAEO,SAAS,mBAAmB,MAA8C;AAC7E,SAAOA,UAAS,IAAI,IAAI;AAC5B;AAEO,SAAS,uBAA6C;AACzD,SAAO,CAAC,GAAGA,UAAS,OAAO,CAAC;AAChC;AAGA,wBAAwB,kBAAkB;AAC1C,wBAAwB,aAAa;AACrC,wBAAwB,cAAc;AACtC,wBAAwB,eAAe;;;ACkBhC,IAAM,uBAA8C;AAAA,EACvD,MAAM;AAAA,EACN,WAAW;AAAA,EACX,MAAM;AAAA,EACN,OAAO;AACX;AAwDO,IAAM,oBAAoB;;;ACvF1B,SAAS,UAAU,OAAsC;AAC5D,SAAO,MAAM,OAAO,IAAI,CAAC,OAAoC;AAAA,IACzD,MAAM;AAAA,IACN,KAAK,EAAE;AAAA,IACP,MAAM,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,WAAW,EAAE;AAAA,IACzC,OAAO,EAAE,SAAS,EAAE;AAAA,IACpB,SAAS,EAAE;AAAA,IACX,MAAM,EAAE,QAAQ;AAAA,IAChB,QAAQ,EAAE;AAAA,EACd,EAAE;AACN;AAUO,SAAS,YAAY,MAAmC;AAC3D,SAAO,KAAK,IAAI,CAAC,OAAkB;AAAA,IAC/B,MAAM;AAAA,IACN,KAAK,EAAE;AAAA,IACP,MAAM,EAAE;AAAA,IACR,OAAO,GAAG,EAAE,IAAI,KAAK,EAAE,KAAK,MAAM,GAAG,EAAE,CAAC;AAAA,IACxC,MAAM,EAAE;AAAA,IACR,SAAS,EAAE;AAAA,IACX,MAAM,EAAE;AAAA,IACR,QAAQ,EAAE;AAAA,EACd,EAAE;AACN;AAEA,SAAS,gBAAgB,QAAuB,MAAmB,IAA0C;AACzG,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,QAAM,WAAW,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AACpD,SAAO,OAAO,IAAI,CAAC,MAAM;AACrB,UAAM,MAAM,SAAS,IAAI,EAAE,GAAG;AAC9B,QAAI,CAAC,IAAK,QAAO;AACjB,UAAM,IACF,IAAI,SAAS,YACP,IAAI,SAAS,SACT,GAAG,OACH,IAAI,SAAS,cACX,GAAG,YACH,GAAG,OACT,GAAG;AACb,WAAO,EAAE,KAAK,EAAE,KAAK,OAAO,EAAE,QAAQ,EAAE;AAAA,EAC5C,CAAC;AACL;AAEA,SAAS,UACL,MACA,OACA,SACwC;AACxC,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,gBAAgB,QAAQ,iBAAiB;AAC/C,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,WAAW,QAAQ,aAAa;AACtC,QAAM,KAAK,EAAE,GAAG,sBAAsB,GAAG,QAAQ,YAAY;AAE7D,QAAM,OAAO,mBAAmB,QAAQ;AACxC,MAAI,CAAC,KAAM,QAAO,CAAC;AACnB,MAAI,KAAK,WAAW,EAAG,QAAO,CAAC;AAE/B,QAAM,kBAAkB,KAAK,MAAM,MAAM,KAAK;AAE9C,QAAM,eAAe,CAAC,aAA4C;AAC9D,UAAM,QAAQ,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AACjD,WAAO,SACF,IAAI,CAAC,MAA2B;AAC7B,YAAM,MAAM,MAAM,IAAI,EAAE,GAAG;AAC3B,UAAI,CAAC,IAAK,QAAO;AACjB,aAAO;AAAA,QACH,MAAM,IAAI;AAAA,QACV,KAAK,IAAI;AAAA,QACT,SAAS,IAAI;AAAA,QACb,MAAM,IAAI,QAAQ;AAAA,QAClB,OAAO,EAAE;AAAA,QACT,OAAO,IAAI;AAAA,QACX,SAAS,YAAY,IAAI,MAAM,OAAO,aAAa;AAAA,QACnD,MAAM,IAAI;AAAA,QACV,QAAQ,IAAI;AAAA,MAChB;AAAA,IACJ,CAAC,EACA,OAAO,CAAC,MAAyB,MAAM,QAAQ,EAAE,SAAS,QAAQ,EAClE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,KAAK;AAAA,EACvB;AAEA,MAAI,2BAA2B,SAAS;AACpC,WAAO,gBAAgB,KAAK,CAAC,QAAQ,aAAa,gBAAgB,KAAK,MAAM,EAAE,CAAC,CAAC;AAAA,EACrF;AACA,SAAO,aAAa,gBAAgB,iBAAiB,MAAM,EAAE,CAAC;AAClE;AAGO,SAAS,aAAa,MAAmB,OAAe,UAAyB,CAAC,GAAmB;AACxG,QAAM,SAAS,UAAU,MAAM,OAAO,OAAO;AAC7C,MAAI,kBAAkB,SAAS;AAC3B,UAAM,IAAI;AAAA,MACN,4BAA4B,QAAQ,aAAa,iBAAiB;AAAA,IACtE;AAAA,EACJ;AACA,SAAO;AACX;AAKA,eAAsB,kBAAkB,MAAmB,OAAe,UAAyB,CAAC,GAA4B;AAC5H,SAAO,MAAM,UAAU,MAAM,OAAO,OAAO;AAC/C;AAMA,SAAS,YAAY,MAAc,OAAe,KAAqB;AACnE,MAAI,CAAC,KAAM,QAAO;AAClB,QAAM,QAAQ,MAAM,YAAY,EAAE,KAAK,EAAE,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAChF,MAAI,MAAM,WAAW,EAAG,QAAO,KAAK,MAAM,GAAG,GAAG;AAEhD,QAAM,QAAQ,KAAK,YAAY;AAC/B,MAAI,SAAS;AACb,aAAW,QAAQ,OAAO;AACtB,UAAM,MAAM,MAAM,QAAQ,IAAI;AAC9B,QAAI,OAAO,GAAG;AACV,eAAS;AACT;AAAA,IACJ;AAAA,EACJ;AAEA,MAAI,SAAS,EAAG,QAAO,KAAK,MAAM,GAAG,GAAG;AAExC,QAAM,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,MAAM,CAAC,IAAI,EAAE;AACjD,QAAM,QAAQ,KAAK,IAAI,GAAG,SAAS,IAAI;AACvC,QAAM,MAAM,KAAK,IAAI,KAAK,QAAQ,QAAQ,GAAG;AAC7C,QAAM,SAAS,QAAQ,IAAI,WAAM;AACjC,QAAM,SAAS,MAAM,KAAK,SAAS,WAAM;AACzC,SAAO,SAAS,KAAK,MAAM,OAAO,GAAG,EAAE,KAAK,IAAI;AACpD;","names":["owner","block","formatTokens","numericPart","activeBlocks","refNum","stem","countOccurrences","registry"]}
+{"version":3,"sources":["../src/refs.ts","../src/state.ts","../src/prune.ts","../src/sync.ts","../src/config.ts","../src/boundaries.ts","../src/truncate-tools.ts","../src/hide-consumed.ts","../src/filter/registry.ts","../src/filter/apply.ts","../src/render-refs.ts","../src/protected.ts","../src/tool-pairs.ts","../src/reasoning-pairs.ts","../src/recommend.ts","../src/pipeline.ts","../src/compress.ts","../src/decompress.ts","../src/report.ts","../src/rebuild.ts","../src/transform-channel.ts","../src/search/stemmer.ts","../src/search/tokenizer.ts","../src/search/doc-cache.ts","../src/search/algorithms/substring.ts","../src/search/algorithms/bm25.ts","../src/search/algorithms/fuzzy.ts","../src/search/algorithms/hybrid.ts","../src/search/registry.ts","../src/search/types.ts","../src/search/index.ts"],"sourcesContent":["import type { CoreMessage, MessageRefMap } from \"./types.js\";\n\nconst REF_WIDTH = 5;\nconst MIN_INDEX = 1;\nconst MAX_INDEX = 99999;\nconst REF_PATTERN = /^m0*(\\d{1,5})$/;\n\nexport const BLOCKED_REF = \"BLOCKED\";\n\nexport function emptyRefMap(): MessageRefMap {\n  return { byRaw: {}, byRef: {} };\n}\n\nexport function indexToRef(index: number): string {\n  if (!Number.isInteger(index) || index < MIN_INDEX || index > MAX_INDEX) {\n    throw new RangeError(\n      `ref index out of bounds: ${index} (allowed ${MIN_INDEX}-${MAX_INDEX})`,\n    );\n  }\n  return `m${String(index).padStart(REF_WIDTH, \"0\")}`;\n}\n\nexport function refToIndex(ref: string): number | null {\n  const match = REF_PATTERN.exec(ref.trim().toLowerCase());\n  if (!match) return null;\n  const index = Number(match[1]);\n  if (index < MIN_INDEX || index > MAX_INDEX) return null;\n  return index;\n}\n\nexport function refForRaw(map: MessageRefMap, rawId: string): string | null {\n  return map.byRaw[rawId] ?? null;\n}\n\nexport function rawForRef(map: MessageRefMap, ref: string): string | null {\n  return map.byRef[ref] ?? null;\n}\n\nexport interface AssignRefsResult {\n  map: MessageRefMap;\n  nextIndex: number;\n  newlyAssigned: number;\n}\n\nexport interface AssignRefsOptions {\n  existing: MessageRefMap;\n  nextIndex: number;\n  isProtected?: (message: CoreMessage) => boolean;\n  shouldSkip?: (message: CoreMessage) => boolean;\n}\n\nexport function assignRefs(\n  messages: CoreMessage[],\n  options: AssignRefsOptions,\n): AssignRefsResult {\n  const map: MessageRefMap = {\n    byRaw: { ...options.existing.byRaw },\n    byRef: { ...options.existing.byRef },\n  };\n  let cursor =\n    Number.isInteger(options.nextIndex) && options.nextIndex >= MIN_INDEX\n      ? options.nextIndex\n      : MIN_INDEX;\n  let newlyAssigned = 0;\n\n  for (const message of messages) {\n    if (!message.id || options.shouldSkip?.(message)) continue;\n\n    if (map.byRaw[message.id]) continue;\n\n    if (options.isProtected?.(message)) {\n      map.byRaw[message.id] = BLOCKED_REF;\n      continue;\n    }\n\n    const ref = allocateFreeRef(map, cursor);\n    cursor = ref.index + 1;\n    map.byRaw[message.id] = ref.text;\n    map.byRef[ref.text] = message.id;\n    newlyAssigned++;\n  }\n\n  return { map, nextIndex: cursor, newlyAssigned };\n}\n\nfunction allocateFreeRef(\n  map: MessageRefMap,\n  start: number,\n): { text: string; index: number } {\n  let candidate = Math.max(start, MIN_INDEX);\n  while (candidate <= MAX_INDEX) {\n    const text = indexToRef(candidate);\n    if (!map.byRef[text]) {\n      return { text, index: candidate };\n    }\n    candidate++;\n  }\n  throw new Error(\n    `ref capacity exhausted: cannot allocate beyond ${indexToRef(MAX_INDEX)}`,\n  );\n}\n\nexport function rebuildRefIndex(map: MessageRefMap): MessageRefMap {\n  const byRef: Record<string, string> = {};\n  for (const [rawId, ref] of Object.entries(map.byRaw)) {\n    if (ref !== BLOCKED_REF) byRef[ref] = rawId;\n  }\n  return { byRaw: { ...map.byRaw }, byRef };\n}\n\nexport function highestUsedIndex(map: MessageRefMap): number {\n  let highest = 0;\n  for (const ref of Object.values(map.byRaw)) {\n    const index = ref === BLOCKED_REF ? null : refToIndex(ref);\n    if (index !== null && index > highest) highest = index;\n  }\n  return highest;\n}\n","import type { CompressionBlock, CompressionState } from \"./types.js\";\n\nexport function createInitialState(): CompressionState {\n  return {\n    blocks: [],\n    messageRefs: { byRaw: {}, byRef: {} },\n    tokenSnapshot: {},\n    nudge: {\n      lastPerMessageNudgeTokens: 0,\n      lastNudgeShownTokens: 0,\n      baselineTokens: 0,\n      anchors: {},\n      lastShownByTier: {},\n    },\n    stats: { tokensCompressed: 0, compressionCount: 0 },\n    nextBlockId: 1,\n    nextRunId: 1,\n  };\n}\n\nexport function allocateBlockId(state: CompressionState): string {\n  const id = state.nextBlockId;\n  state.nextBlockId = Math.max(1, id) + 1;\n  return `b${id}`;\n}\n\nexport function allocateRunId(state: CompressionState): string {\n  const id = state.nextRunId;\n  state.nextRunId = Math.max(1, id) + 1;\n  return `r${id}`;\n}\n\nexport function blockById(\n  state: CompressionState,\n  blockId: string,\n): CompressionBlock | undefined {\n  return state.blocks.find((block) => block.blockId === blockId);\n}\n\nexport function activeBlocks(state: CompressionState): CompressionBlock[] {\n  return state.blocks.filter((block) => block.active);\n}\n\nexport function coveredMessageIds(state: CompressionState): Set<string> {\n  const covered = new Set<string>();\n  for (const block of state.blocks) {\n    if (!block.active) continue;\n    for (const id of block.effectiveMessageIds) covered.add(id);\n  }\n  return covered;\n}\n\nexport function highestActiveTier(state: CompressionState): 0 | 1 | 2 | 3 {\n  let highest: 0 | 1 | 2 | 3 = 0;\n  for (const block of state.blocks) {\n    if (block.active && block.tier > highest) highest = block.tier;\n  }\n  return highest;\n}\n\nexport function advanceSurvival(\n  state: CompressionState,\n  promotionThreshold: number,\n): void {\n  for (const block of state.blocks) {\n    if (!block.active) continue;\n    block.survivedCount += 1;\n    if (block.survivedCount >= promotionThreshold) {\n      block.generation = \"old\";\n    }\n  }\n}\n","import { activeBlocks, coveredMessageIds } from \"./state.js\";\nimport type { CompressionState, CoreMessage } from \"./types.js\";\n\nexport const SUMMARY_HEADER = \"[Compressed conversation section]\";\n\n// Reserved prefix for rendered-summary ids. Hosts own their message ids and\n// must never assign one with this prefix; kernel-generated ids are mNNNNN\n// refs and bN block ids.\nconst SUMMARY_ID_PREFIX = \"acp_summary_\";\n\n/**\n * The transient visible id of an active block's rendered summary message.\n * This is a VIEW-ONLY representation: it must never be persisted into\n * `effectiveMessageIds`/`directMessageIds` (the durable coverage is the\n * block's raw message ids).\n */\nexport function summaryMessageId(blockId: string): string {\n  return `${SUMMARY_ID_PREFIX}${blockId}`;\n}\n\nexport function isSummaryMessageId(id: string): boolean {\n  return id.startsWith(SUMMARY_ID_PREFIX);\n}\n\n/**\n * True when a message is a rendered block summary (the exact shape prune\n * emits). The id prefix alone is not sufficient — a host-authored message\n * that happens to carry a reserved id must not be treated as a rendered\n * summary (it would be silently dropped from ranges or deleted by rebuild).\n */\nexport function isRenderedSummaryMessage(\n  message: Pick<CoreMessage, \"id\" | \"role\" | \"contentType\">,\n): boolean {\n  return (\n    isSummaryMessageId(message.id) &&\n    message.role === \"system\" &&\n    message.contentType === \"text\"\n  );\n}\n\nexport interface PruneOptions {\n  injectSummaries?: boolean;\n}\n\nexport function prune(\n  messages: CoreMessage[],\n  state: CompressionState,\n  options: PruneOptions = {},\n): CoreMessage[] {\n  const covered = coveredMessageIds(state);\n  if (covered.size === 0) return [...messages];\n\n  const inject = options.injectSummaries ?? true;\n  const firstUserIndex = messages.findIndex(\n    (message) => message.role === \"user\",\n  );\n\n  const indexById = new Map<string, number>();\n  const summaryIndexById = new Map<string, number>();\n  messages.forEach((message, index) => {\n    indexById.set(message.id, index);\n    if (isRenderedSummaryMessage(message))\n      summaryIndexById.set(message.id, index);\n  });\n\n  const anchors = inject\n    ? collectSummaryAnchors(state, indexById, summaryIndexById)\n    : [];\n\n  return stripOrphanedReasoning(\n    stripOrphanedToolResults(\n      stripOrphanedToolCalls(\n        rebuildMessages(messages, covered, firstUserIndex, anchors),\n      ),\n    ),\n  );\n}\n\ninterface SummaryAnchor {\n  blockId: string;\n  summary: string;\n  topic?: string;\n  insertAt: number;\n}\n\nfunction collectSummaryAnchors(\n  state: CompressionState,\n  indexById: Map<string, number>,\n  summaryIndexById: Map<string, number>,\n): SummaryAnchor[] {\n  const anchors: SummaryAnchor[] = [];\n  for (const block of activeBlocks(state)) {\n    // Prefer the position of an already-rendered summary (hosts may pass a\n    // previously-pruned view): keeps the summary stable in place instead of\n    // jumping to index 0 when the raw ids are no longer in the input.\n    const existingIndex = summaryIndexById.get(summaryMessageId(block.blockId));\n    if (existingIndex !== undefined) {\n      anchors.push({\n        blockId: block.blockId,\n        summary: block.summary,\n        topic: block.topic,\n        insertAt: existingIndex,\n      });\n      continue;\n    }\n    let earliest: number | null = null;\n    for (const id of block.effectiveMessageIds) {\n      const index = indexById.get(id);\n      if (index !== undefined && (earliest === null || index < earliest)) {\n        earliest = index;\n      }\n    }\n    anchors.push({\n      blockId: block.blockId,\n      summary: block.summary,\n      topic: block.topic,\n      insertAt: earliest ?? 0,\n    });\n  }\n  anchors.sort((left, right) => left.insertAt - right.insertAt);\n  return anchors;\n}\n\nfunction rebuildMessages(\n  messages: CoreMessage[],\n  covered: Set<string>,\n  firstUserIndex: number,\n  anchors: SummaryAnchor[],\n): CoreMessage[] {\n  const result: CoreMessage[] = [];\n  const pending = [...anchors];\n  const anchoredSummaryIds = new Set(\n    anchors.map((anchor) => summaryMessageId(anchor.blockId)),\n  );\n\n  for (let index = 0; index < messages.length; index++) {\n    while (pending.length > 0 && pending[0]!.insertAt === index) {\n      result.push(renderSummary(pending.shift()!));\n    }\n    if (index === firstUserIndex && firstUserIndex >= 0) {\n      result.push(messages[index]!);\n      continue;\n    }\n    if (covered.has(messages[index]!.id)) continue;\n    // A stale copy of this block's summary from a previously-pruned view:\n    // the freshly rendered one above replaces it. Only rendered-summary\n    // shaped messages qualify — a host message that merely reuses the\n    // reserved prefix is content, not a stale copy.\n    if (\n      isRenderedSummaryMessage(messages[index]!) &&\n      anchoredSummaryIds.has(messages[index]!.id)\n    )\n      continue;\n    result.push(messages[index]!);\n  }\n\n  while (pending.length > 0) {\n    result.push(renderSummary(pending.shift()!));\n  }\n\n  return result;\n}\n\nfunction renderSummary(anchor: SummaryAnchor): CoreMessage {\n  const body = anchor.summary.trim();\n  const topicLine = anchor.topic\n    ? `${SUMMARY_HEADER} — ${anchor.topic}`\n    : SUMMARY_HEADER;\n  const text = body.length === 0 ? topicLine : `${topicLine}\\n${body}`;\n  return {\n    id: summaryMessageId(anchor.blockId),\n    role: \"system\",\n    contentType: \"text\",\n    text,\n  };\n}\n\nfunction stripOrphanedToolResults(messages: CoreMessage[]): CoreMessage[] {\n  const knownCallIds = new Set<string>();\n  for (const m of messages) {\n    if (m.contentType === \"tool-call\" && m.toolCallId) {\n      knownCallIds.add(m.toolCallId);\n    }\n  }\n  return messages.filter(\n    (m) =>\n      m.contentType !== \"tool-result\" ||\n      !m.toolCallId ||\n      knownCallIds.has(m.toolCallId),\n  );\n}\n\nfunction stripOrphanedToolCalls(messages: CoreMessage[]): CoreMessage[] {\n  const knownResultIds = new Set<string>();\n  for (const m of messages) {\n    if (m.contentType === \"tool-result\" && m.toolCallId) {\n      knownResultIds.add(m.toolCallId);\n    }\n  }\n  return messages.filter(\n    (m) =>\n      m.contentType !== \"tool-call\" ||\n      !m.toolCallId ||\n      m.toolName === \"compress\" ||\n      knownResultIds.has(m.toolCallId),\n  );\n}\n\n/**\n * Defense-in-depth for reasoning/text pairing (analogue of\n * {@link stripOrphanedToolCalls}). A `reasoning` message is only meaningful\n * when immediately followed — after any same-run reasoning — by its companion\n * assistant text/tool-call; strict thinking models (DeepSeek et al.) reject\n * reasoning_content that has lost its response with HTTP 400. Compress-time\n * boundary expansion normally keeps the pair in one block, so this only fires\n * for degenerate straddles (block-boundary ranges, malformed input, or a\n * reasoning that never had a companion): drop the dangling run rather than\n * ship a 400-triggering half-pair. Runs AFTER tool stripping, since removing\n * an orphaned tool-call can leave its preceding reasoning dangling too.\n */\nfunction stripOrphanedReasoning(messages: CoreMessage[]): CoreMessage[] {\n  const drop = new Set<number>();\n  for (let i = 0; i < messages.length; i++) {\n    if (drop.has(i)) continue;\n    if (messages[i]!.contentType !== \"reasoning\") continue;\n    let j = i;\n    while (\n      j + 1 < messages.length &&\n      messages[j + 1]!.contentType === \"reasoning\"\n    ) {\n      j++;\n    }\n    const companion = messages[j + 1];\n    const hasCompanion =\n      companion !== undefined &&\n      companion.role === \"assistant\" &&\n      (companion.contentType === \"text\" ||\n        companion.contentType === \"tool-call\");\n    if (!hasCompanion) {\n      for (let k = i; k <= j; k++) drop.add(k);\n    }\n  }\n  if (drop.size === 0) return messages;\n  return messages.filter((_, i) => !drop.has(i));\n}\n","import { summaryMessageId } from \"./prune.js\";\nimport type { CompressionState, CoreMessage } from \"./types.js\";\n\nexport interface SyncResult {\n  state: CompressionState;\n  deactivated: string[];\n}\n\nexport function syncBlocks(\n  messages: CoreMessage[],\n  state: CompressionState,\n): SyncResult {\n  const presentIds = new Set(messages.map((message) => message.id));\n  const deactivated: string[] = [];\n  // Deep-clone (not just `{...state}`) so the caller's input state is never\n  // mutated: processTurn stamps `state.nudge.*` and reassigns `messageRefs`,\n  // and block sub-arrays must not alias the input. Previously nudge/stats/\n  // messageRefs were shared references → input-state mutation leak.\n  const result: CompressionState = {\n    blocks: state.blocks.map((block) => ({\n      ...block,\n      directMessageIds: [...block.directMessageIds],\n      effectiveMessageIds: [...block.effectiveMessageIds],\n      directBlockIds: [...block.directBlockIds],\n    })),\n    messageRefs: {\n      byRaw: { ...state.messageRefs.byRaw },\n      byRef: { ...state.messageRefs.byRef },\n    },\n    // Snapshot is keyed by ref with primitive values — shallow copy suffices.\n    tokenSnapshot: { ...(state.tokenSnapshot ?? {}) },\n    nudge: { ...state.nudge, anchors: { ...state.nudge.anchors } },\n    stats: { ...state.stats },\n    nextBlockId: state.nextBlockId,\n    nextRunId: state.nextRunId,\n  };\n\n  // Refs are additive (assignRefs never removes them from messageRefs), so\n  // prune the snapshot by currently-present message refs — otherwise it grows\n  // unboundedly as messages are compressed/deleted across a long session.\n  const liveRefs = new Set(\n    messages\n      .map((m) => result.messageRefs.byRaw[m.id])\n      .filter((r): r is string => typeof r === \"string\"),\n  );\n  if (Object.keys(result.tokenSnapshot).length !== liveRefs.size) {\n    const pruned: Record<string, number> = {};\n    for (const [ref, n] of Object.entries(result.tokenSnapshot)) {\n      if (liveRefs.has(ref)) pruned[ref] = n;\n    }\n    result.tokenSnapshot = pruned;\n  }\n\n  const consumedBlockIds = new Set<string>();\n  for (const block of result.blocks) {\n    for (const consumedId of block.directBlockIds) {\n      consumedBlockIds.add(consumedId);\n    }\n  }\n\n  for (const block of result.blocks) {\n    if (consumedBlockIds.has(block.blockId)) {\n      block.active = false;\n      continue;\n    }\n    block.active = true;\n    // A block whose raw messages were replaced by its rendered summary\n    // (pruned view) is still present — the summary IS the block's visible\n    // representation. Without this, hosts passing pruned views would lose\n    // block activity every turn.\n    const stillPresent =\n      block.effectiveMessageIds.some((id) => presentIds.has(id)) ||\n      presentIds.has(summaryMessageId(block.blockId));\n    if (!stillPresent) {\n      block.active = false;\n      deactivated.push(block.blockId);\n    }\n  }\n\n  return { state: result, deactivated };\n}\n","import type { Config } from \"./types.js\";\n\nexport function defaultConfig(\n  modelContextLimit: number,\n  overrides: Partial<Config> = {},\n): Config {\n  const base: Config = {\n    tiers: { enabled: true, tier2Trigger: 5, tier3Trigger: 10 },\n    nudge: {\n      maxContextLimitPct: 0.75,\n      minContextLimitPct: 0.45,\n      frequency: 5,\n      iterationThreshold: 15,\n      force: \"soft\",\n      growthRatio: 0.05,\n      growthFloor: 50000,\n      growthCap: 50000,\n      minGrowthFloor: 20000,\n      minGrowthRatio: 0.45,\n      emergencyThresholdPct: 0.95,\n      tier2GrowthMultiplier: 1.5,\n    },\n    promotionThreshold: 5,\n    truncate: { threshold: 0.95 },\n    compress: {\n      minCompressRange: 5000,\n      maxSummaryLength: 20000,\n      minSummaryLength: 50,\n    },\n    protectedTools: [],\n    preserveRecentMessages: 5,\n    preserveRecentTokens: 5000,\n    modelContextLimit,\n  };\n  return {\n    ...base,\n    ...overrides,\n    tiers: { ...base.tiers, ...overrides.tiers },\n    nudge: { ...base.nudge, ...overrides.nudge },\n    truncate: { ...base.truncate, ...overrides.truncate },\n    compress: { ...base.compress, ...overrides.compress },\n  };\n}\n\nexport function validateConfig(config: Config): string[] {\n  const errors: string[] = [];\n  if (\n    !Number.isFinite(config.modelContextLimit) ||\n    config.modelContextLimit <= 0\n  ) {\n    errors.push(\"modelContextLimit must be a positive number\");\n  }\n  if (config.nudge.minContextLimitPct > config.nudge.maxContextLimitPct) {\n    errors.push(\n      \"nudge.minContextLimitPct must not exceed nudge.maxContextLimitPct\",\n    );\n  }\n  if (config.nudge.maxContextLimitPct > config.nudge.emergencyThresholdPct) {\n    errors.push(\n      \"nudge.maxContextLimitPct must not exceed nudge.emergencyThresholdPct\",\n    );\n  }\n  if (config.promotionThreshold < 1) {\n    errors.push(\"promotionThreshold must be >= 1\");\n  }\n  if (config.truncate.threshold <= 0 || config.truncate.threshold > 1) {\n    errors.push(\"truncate.threshold must be in (0, 1]\");\n  }\n  for (const tier of [config.tiers.tier2Trigger, config.tiers.tier3Trigger]) {\n    if (tier < 1) errors.push(\"tier triggers must be >= 1\");\n  }\n  if (config.tiers.tier3Trigger <= config.tiers.tier2Trigger) {\n    errors.push(\"tiers.tier3Trigger must be greater than tiers.tier2Trigger\");\n  }\n  return errors;\n}\n","import { activeBlocks, blockById } from \"./state.js\";\nimport { isRenderedSummaryMessage, summaryMessageId } from \"./prune.js\";\nimport type {\n  CompressionBlock,\n  CompressionState,\n  CoreMessage,\n  ResolvedBoundary,\n} from \"./types.js\";\n\nexport type BoundaryKind = \"message\" | \"block\";\n\nexport interface ParsedBoundary {\n  kind: BoundaryKind;\n  numericId: number;\n  raw: string;\n}\n\nconst MESSAGE_REF_PATTERN = /^m0*(\\d{1,5})$/;\nconst BLOCK_REF_PATTERN = /^b(\\d{1,9})$/;\n\nexport function parseBoundary(ref: string): ParsedBoundary | null {\n  const normalized = ref.trim().toLowerCase();\n  const messageMatch = MESSAGE_REF_PATTERN.exec(normalized);\n  if (messageMatch) {\n    const numericId = Number(messageMatch[1]);\n    if (numericId >= 1 && numericId <= 99999) {\n      return { kind: \"message\", numericId, raw: normalized };\n    }\n  }\n  const blockMatch = BLOCK_REF_PATTERN.exec(normalized);\n  if (blockMatch) {\n    const numericId = Number(blockMatch[1]);\n    if (numericId >= 1) return { kind: \"block\", numericId, raw: normalized };\n  }\n  return null;\n}\n\n/**\n * Thrown when a boundary ref parses but cannot be anchored in the visible\n * context. `kind` distinguishes a ref that never existed (\"unknown\", e.g. a\n * typo or a ref from another session) from one that was consumed by an\n * existing block (\"consumed\", messages hidden by prune). `endpoint` names the\n * failing side of the range so callers can attribute the error precisely.\n */\nexport class BoundaryNotFoundError extends Error {\n  readonly code = \"BOUNDARY_NOT_FOUND\";\n  readonly kind: \"unknown\" | \"consumed\";\n  readonly endpoint: \"start\" | \"end\";\n\n  constructor(\n    kind: \"unknown\" | \"consumed\",\n    endpoint: \"start\" | \"end\",\n    message: string,\n  ) {\n    super(message);\n    this.name = \"BoundaryNotFoundError\";\n    this.code = \"BOUNDARY_NOT_FOUND\";\n    this.kind = kind;\n    this.endpoint = endpoint;\n  }\n}\n\nexport interface ResolveBoundariesInput {\n  startRef: string;\n  endRef: string;\n  messages: CoreMessage[];\n  state: CompressionState;\n}\n\nexport interface ResolvedRange {\n  startIndex: number;\n  endIndex: number;\n  messageIds: string[];\n  nestedBlockIds: string[];\n  boundaryKind: BoundaryKind;\n  protectedGaps: number[];\n  snappedBoundaries: string[];\n}\n\nexport function resolveBoundaries(\n  input: ResolveBoundariesInput,\n): ResolvedRange {\n  const start = parseBoundary(input.startRef);\n  const end = parseBoundary(input.endRef);\n  if (!start || !end) {\n    throw new Error(\n      `Invalid boundary ref(s): startId=\"${input.startRef}\", endId=\"${input.endRef}\". Use mNNNNN or bN.`,\n    );\n  }\n\n  const indexByMessageId = new Map<string, number>();\n  input.messages.forEach((message, index) =>\n    indexByMessageId.set(message.id, index),\n  );\n\n  let snappedBoundaries: string[] = [];\n  const startAnchor = resolveAnchorIndex(\n    start,\n    input.state,\n    indexByMessageId,\n    \"start\",\n  );\n  if (startAnchor.snapped) snappedBoundaries.push(startAnchor.snapped);\n  const endAnchor = resolveAnchorIndex(\n    end,\n    input.state,\n    indexByMessageId,\n    \"end\",\n  );\n  if (endAnchor.snapped) snappedBoundaries.push(endAnchor.snapped);\n  let startIndex = startAnchor.index;\n  let endIndex = endAnchor.index;\n\n  if (startIndex > endIndex) {\n    [startIndex, endIndex] = [endIndex, startIndex];\n  }\n\n  const messageIds: string[] = [];\n  for (let index = startIndex; index <= endIndex; index++) {\n    const message = input.messages[index];\n    // Synthetic summary messages are transient view representations, not\n    // compressible content: exclude them so they never leak into a new\n    // block's effectiveMessageIds/directMessageIds.\n    if (message && !isRenderedSummaryMessage(message))\n      messageIds.push(message.id);\n  }\n\n  const boundaryKind: BoundaryKind =\n    start.kind === \"block\" || end.kind === \"block\" ? \"block\" : \"message\";\n\n  const nestedBlockIds: string[] = [];\n  const nestedSeen = new Set<string>();\n  for (const block of activeBlocks(input.state)) {\n    if (blockVisibleInRange(block, indexByMessageId, startIndex, endIndex)) {\n      if (!nestedSeen.has(block.blockId)) {\n        nestedSeen.add(block.blockId);\n        nestedBlockIds.push(block.blockId);\n      }\n    }\n  }\n\n  const protectedGaps: number[] = [];\n\n  return {\n    startIndex,\n    endIndex,\n    messageIds,\n    nestedBlockIds,\n    boundaryKind,\n    protectedGaps,\n    snappedBoundaries,\n  };\n}\n\ninterface AnchorResolution {\n  index: number;\n  snapped: string | null;\n}\n\nfunction resolveAnchorIndex(\n  boundary: ParsedBoundary,\n  state: CompressionState,\n  indexByMessageId: Map<string, number>,\n  endpoint: \"start\" | \"end\",\n): AnchorResolution {\n  const label = endpoint === \"start\" ? \"startId\" : \"endId\";\n  if (boundary.kind === \"message\") {\n    const rawId =\n      state.messageRefs.byRef[boundary.raw] ??\n      state.messageRefs.byRef[formatPaddedRef(boundary.numericId)];\n    if (!rawId) {\n      throw new BoundaryNotFoundError(\n        \"unknown\",\n        endpoint,\n        `${label}=\"${boundary.raw}\" does not exist in this session (typo or wrong session) — run acp_status for current refs.`,\n      );\n    }\n    const index = indexByMessageId.get(rawId);\n    if (index !== undefined) {\n      return { index, snapped: null };\n    }\n    const owner = activeOwnerAnchor(state, [rawId], indexByMessageId);\n    if (owner !== null) {\n      return {\n        index: owner,\n        snapped: `${label}=\"${boundary.raw}\" refers to a message already compressed into an active block — anchored to the active block covering it instead.`,\n      };\n    }\n    throw new BoundaryNotFoundError(\n      \"consumed\",\n      endpoint,\n      `${label}=\"${boundary.raw}\" not found in visible context (likely consumed by an existing block).`,\n    );\n  }\n\n  const block = blockById(state, `b${boundary.numericId}`);\n  if (!block) {\n    throw new BoundaryNotFoundError(\n      \"unknown\",\n      endpoint,\n      `${label}=\"b${boundary.numericId}\" does not exist in this session (typo or wrong session) — run acp_status for current refs.`,\n    );\n  }\n  if (block.active) {\n    const anchor = visibleBlockAnchor(block, indexByMessageId);\n    if (anchor !== null) {\n      return { index: anchor, snapped: null };\n    }\n  }\n  const owner = activeOwnerAnchor(\n    state,\n    block.effectiveMessageIds,\n    indexByMessageId,\n  );\n  if (owner !== null) {\n    return {\n      index: owner,\n      snapped: `${label}=\"b${boundary.numericId}\" was consumed by a higher-tier block — anchored to the active block covering its content instead.`,\n    };\n  }\n  if (!block.active) {\n    throw new BoundaryNotFoundError(\n      \"consumed\",\n      endpoint,\n      `${label}=\"b${boundary.numericId}\" not found in visible context (block distilled/consumed by a higher-tier block).`,\n    );\n  }\n  throw new BoundaryNotFoundError(\n    \"consumed\",\n    endpoint,\n    `${label}=\"b${boundary.numericId}\" is an active block but none of its content (raw messages or rendered summary) is visible in the current context — run acp_status to verify.`,\n  );\n}\n\n/**\n * Snap a consumed anchor to the active block that now owns its content.\n * Throwing instead dead-ends compress calls that follow nudge instructions\n * with older (already-distilled) refs — the livelock in dog/billion-context-pi#32.\n *\n * Only TRUE ANCESTORS qualify: an active block that INHERITED the content by\n * consuming another block. If the active block DIRECTLY compressed the\n * message itself, callers must get the \"already compressed — retry with the\n * block's bN ref\" guidance instead of a silent snap (which would turn a\n * message-range retry into a same-tier duplicate block).\n */\nfunction activeOwnerAnchor(\n  state: CompressionState,\n  ownedIds: string[],\n  indexByMessageId: Map<string, number>,\n): number | null {\n  if (ownedIds.length === 0) return null;\n  const owned = new Set(ownedIds);\n  let best: number | null = null;\n  for (const block of state.blocks) {\n    if (!block.active) continue;\n    const inherited = inheritedContentIds(state, block);\n    let ownsInherited = false;\n    for (const id of owned) {\n      if (inherited.has(id)) {\n        ownsInherited = true;\n        break;\n      }\n    }\n    if (!ownsInherited) continue;\n    const anchor = visibleBlockAnchor(block, indexByMessageId);\n    if (anchor === null) continue;\n    if (best === null || anchor < best) {\n      best = anchor;\n    }\n  }\n  return best;\n}\n\n/**\n * Content a block INHERITED by consuming other blocks: the union of its\n * children's effective coverage. Derived from `directBlockIds` rather than\n * inferred as effective−direct so imported or rebuilt state shapes cannot\n * flip the consumed-vs-snap decision.\n */\nfunction inheritedContentIds(\n  state: CompressionState,\n  block: CompressionBlock,\n): Set<string> {\n  const ids = new Set<string>();\n  for (const childId of block.directBlockIds) {\n    const child = blockById(state, childId);\n    if (!child) continue;\n    for (const id of child.effectiveMessageIds) ids.add(id);\n  }\n  return ids;\n}\n\nfunction formatPaddedRef(index: number): string {\n  return `m${String(index).padStart(5, \"0\")}`;\n}\n\n/**\n * Visible anchor index for a block: its rendered summary message if present\n * (post-prune views replace raw messages with `acp_summary_bN`), else the\n * earliest visible raw message it covers. Without the summary fallback an\n * active block whose raws were pruned becomes unresolvable and cannot be\n * promoted (dog/billion-context-pi#195).\n */\nexport function visibleBlockAnchor(\n  block: CompressionBlock,\n  indexByMessageId: Map<string, number>,\n): number | null {\n  const summaryIndex = indexByMessageId.get(summaryMessageId(block.blockId));\n  if (summaryIndex !== undefined) return summaryIndex;\n  return earliestIndexOfIds(block.effectiveMessageIds, indexByMessageId);\n}\n\n// A block participates in a range when ANY of its visible representations\n// (rendered summary or earliest surviving raw) falls inside it. The summary\n// alone is not sufficient: when a block covers the session's first user\n// message, prune keeps that one raw and inserts the summary BEFORE it, so the\n// summary index can sit outside a range that still contains the raw.\nexport function blockVisibleInRange(\n  block: CompressionBlock,\n  indexByMessageId: Map<string, number>,\n  startIndex: number,\n  endIndex: number,\n): boolean {\n  const summaryIndex = indexByMessageId.get(summaryMessageId(block.blockId));\n  if (\n    summaryIndex !== undefined &&\n    summaryIndex >= startIndex &&\n    summaryIndex <= endIndex\n  ) {\n    return true;\n  }\n  const rawIndex = earliestIndexOfIds(\n    block.effectiveMessageIds,\n    indexByMessageId,\n  );\n  return rawIndex !== null && rawIndex >= startIndex && rawIndex <= endIndex;\n}\n\nexport function earliestIndexOfIds(\n  ids: string[],\n  indexByMessageId: Map<string, number>,\n): number | null {\n  let earliest: number | null = null;\n  for (const id of ids) {\n    const index = indexByMessageId.get(id);\n    if (index !== undefined && (earliest === null || index < earliest)) {\n      earliest = index;\n    }\n  }\n  return earliest;\n}\n\nexport function toResolvedBoundary(range: ResolvedRange): ResolvedBoundary {\n  return {\n    startIndex: range.startIndex,\n    endIndex: range.endIndex,\n    protectedGaps: range.protectedGaps,\n  };\n}\n","import type { Config, CoreMessage } from \"./types.js\";\n\nexport interface TruncateOptions {\n    minOutputTokens?: number;\n    keepPrefixChars?: number;\n    keepSuffixChars?: number;\n    protectRecentMessages?: number;\n}\n\nexport interface TruncateResult {\n    messages: CoreMessage[];\n    truncatedCount: number;\n    savedTokens: number;\n}\n\nconst TRUNCATION_MARKER = \"[truncated for context space]\";\nconst DEFAULTS = {\n    minOutputTokens: 1000,\n    keepPrefixChars: 2000,\n    keepSuffixChars: 2000,\n    protectRecentMessages: 3,\n} as const;\n\nexport function truncateLargeToolOutputs(\n    messages: CoreMessage[],\n    tokenCount: number,\n    config: Config,\n    countTokens: (text: string) => number,\n    options: TruncateOptions = {},\n): TruncateResult {\n    const opts = { ...DEFAULTS, ...options };\n    if (config.modelContextLimit <= 0) return { messages, truncatedCount: 0, savedTokens: 0 };\n\n    const threshold = config.truncate.threshold * config.modelContextLimit;\n    if (tokenCount < threshold) return { messages, truncatedCount: 0, savedTokens: 0 };\n\n    const protectedIndex = messages.length - opts.protectRecentMessages;\n    const candidates: Array<{ index: number; tokens: number }> = [];\n\n    for (let index = 0; index < messages.length; index++) {\n        if (index >= protectedIndex) break;\n        const message = messages[index]!;\n        if (message.contentType !== \"tool-result\") continue;\n        const text = message.text ?? \"\";\n        if (text.length === 0 || text.includes(TRUNCATION_MARKER)) continue;\n        const tokens = countTokens(text);\n        if (tokens < opts.minOutputTokens) continue;\n        candidates.push({ index, tokens });\n    }\n\n    if (candidates.length === 0) return { messages, truncatedCount: 0, savedTokens: 0 };\n    candidates.sort((left, right) => right.tokens - left.tokens);\n\n    const targetTokens = threshold * 0.9;\n    let savedTokens = 0;\n    const edits = new Map<number, string>();\n    let truncatedCount = 0;\n\n    for (const candidate of candidates) {\n        if (tokenCount - savedTokens <= targetTokens) break;\n        const original = messages[candidate.index]!.text ?? \"\";\n        if (original.length <= opts.keepPrefixChars + opts.keepSuffixChars) continue;\n\n        const prefix = original.slice(0, opts.keepPrefixChars);\n        const suffix = original.slice(-opts.keepSuffixChars);\n        const replacement =\n            prefix +\n            `\\n\\n...${TRUNCATION_MARKER} — original ~${candidate.tokens} tokens]...\\n\\n` +\n            suffix;\n        edits.set(candidate.index, replacement);\n        savedTokens += candidate.tokens - countTokens(replacement);\n        truncatedCount++;\n    }\n\n    if (truncatedCount === 0) return { messages, truncatedCount: 0, savedTokens: 0 };\n\n    const updated = messages.map((message, index) =>\n        edits.has(index) ? { ...message, text: edits.get(index)! } : message,\n    );\n    return { messages: updated, truncatedCount, savedTokens };\n}\n","import type { CompressionState, CoreMessage } from \"./types.js\";\n\n// Orphaned compress calls (no matching block — failed attempts, or historical\n// calls whose blocks predate compressCallId recording) keep their NEWEST two\n// call+result pairs visible: failures must stay observable or a deterministic\n// model re-issues the same no-op compress forever, pinned at a fixed point\n// (billion-context-pi issue #9: 3,849 identical calls over 5h13m under\n// KEEP_LAST_ORPHANED=0). Older orphans are hidden, so the residue is bounded\n// at two pairs regardless of session length — PR #18's unbounded accumulation\n// does not return (its own live check showed the cap: 10 in → 6 out).\nconst KEEP_LAST_ORPHANED = 2;\n\nexport interface HideConsumedResult {\n    messages: CoreMessage[];\n    hidden: number;\n}\n\nfunction rangeKey(startRef: string, endRef: string): string {\n    return `${startRef}::${endRef}`;\n}\n\nfunction rewriteCompressText(text: string | undefined, liveKeys: Set<string>): string | null {\n    let parsed: unknown;\n    try {\n        parsed = JSON.parse(text ?? \"\");\n    } catch {\n        return null;\n    }\n    if (!parsed || typeof parsed !== \"object\") return null;\n    const obj = parsed as { content?: unknown };\n    const content = obj.content;\n    if (!Array.isArray(content) || content.length === 0) return null;\n\n    const kept = content.filter((entry): entry is Record<string, unknown> => {\n        if (!entry || typeof entry !== \"object\") return false;\n        const s = typeof entry.startId === \"string\" ? entry.startId : typeof entry.messageId === \"string\" ? entry.messageId : \"\";\n        const e = typeof entry.endId === \"string\" ? entry.endId : typeof entry.messageId === \"string\" ? entry.messageId : \"\";\n        return liveKeys.has(rangeKey(s, e));\n    });\n\n    if (kept.length === content.length || kept.length === 0) return null;\n\n    return JSON.stringify({ ...obj, content: kept });\n}\n\nexport function hideConsumedCompressCalls(\n    state: CompressionState,\n    messages: CoreMessage[],\n): HideConsumedResult {\n    const allBlockCallIds = new Set<string>();\n    const activeCallIds = new Set<string>();\n    const liveRangeKeysByCallId = new Map<string, Set<string>>();\n    const legacyLiveByCallId = new Set<string>();\n    for (const block of state.blocks) {\n        if (!block.compressCallId) continue;\n        allBlockCallIds.add(block.compressCallId);\n        if (!block.active) continue;\n        activeCallIds.add(block.compressCallId);\n        if (block.startRef === undefined || block.endRef === undefined) {\n            legacyLiveByCallId.add(block.compressCallId);\n            continue;\n        }\n        let keys = liveRangeKeysByCallId.get(block.compressCallId);\n        if (!keys) {\n            keys = new Set<string>();\n            liveRangeKeysByCallId.set(block.compressCallId, keys);\n        }\n        keys.add(rangeKey(block.startRef, block.endRef));\n    }\n\n    const lastOrphanedCallIds: string[] = [];\n    for (let i = messages.length - 1; i >= 0 && lastOrphanedCallIds.length < KEEP_LAST_ORPHANED; i--) {\n        const message = messages[i]!;\n        if (message.toolName !== \"compress\" || message.contentType !== \"tool-call\") continue;\n        const callId = message.toolCallId;\n        if (callId && !allBlockCallIds.has(callId)) {\n            lastOrphanedCallIds.push(callId);\n        }\n    }\n\n    const keepCallIds = new Set([...activeCallIds, ...lastOrphanedCallIds]);\n\n    const hiddenCallIds = new Set<string>();\n    for (const message of messages) {\n        if (\n            message.toolName === \"compress\" &&\n            message.contentType === \"tool-call\" &&\n            (!message.toolCallId || !keepCallIds.has(message.toolCallId))\n        ) {\n            if (message.toolCallId) hiddenCallIds.add(message.toolCallId);\n        }\n    }\n\n    let hidden = 0;\n    const result: CoreMessage[] = [];\n    for (const message of messages) {\n        if (\n            message.toolName === \"compress\" &&\n            message.contentType === \"tool-call\" &&\n            (!message.toolCallId || !keepCallIds.has(message.toolCallId))\n        ) {\n            hidden++;\n            continue;\n        }\n        if (\n            message.contentType === \"tool-result\" &&\n            message.toolCallId &&\n            hiddenCallIds.has(message.toolCallId)\n        ) {\n            hidden++;\n            continue;\n        }\n        if (\n            message.toolName === \"compress\" &&\n            message.contentType === \"tool-call\" &&\n            message.toolCallId &&\n            keepCallIds.has(message.toolCallId)\n        ) {\n            const liveKeys = liveRangeKeysByCallId.get(message.toolCallId);\n            if (liveKeys && liveKeys.size > 0 && !legacyLiveByCallId.has(message.toolCallId)) {\n                const rewritten = rewriteCompressText(message.text, liveKeys);\n                if (rewritten !== null) {\n                    result.push({ ...message, text: rewritten });\n                    continue;\n                }\n            }\n        }\n        result.push(message);\n    }\n\n    return { messages: result, hidden };\n}\n","import type { MessageFilter } from \"./types.js\";\n\nconst registry = new Map<string, MessageFilter>();\n\nexport function registerMessageFilter(filter: MessageFilter): void {\n    const existing = registry.get(filter.name);\n    if (existing && existing.version !== filter.version) {\n        throw new Error(\n            `Message filter \"${filter.name}\" already registered with version ${existing.version}, cannot register version ${filter.version}.`,\n        );\n    }\n    registry.set(filter.name, filter);\n}\n\nexport function getMessageFilter(name: string): MessageFilter | undefined {\n    return registry.get(name);\n}\n\nexport function listMessageFilters(): MessageFilter[] {\n    return [...registry.values()];\n}\n\nexport function clearMessageFilters(): void {\n    registry.clear();\n}\n","import { listMessageFilters } from \"./registry.js\";\nimport type { CoreMessage } from \"../types.js\";\nimport type { FilterResult, MessageFilterContext, MessageFiltersConfig } from \"./types.js\";\n\nexport interface ApplyResult {\n    messages: CoreMessage[];\n    partsFiltered: number;\n    partsDropped: number;\n    partsModified: number;\n}\n\nexport function applyMessageFilters(\n    messages: CoreMessage[],\n    config: MessageFiltersConfig | undefined,\n): ApplyResult {\n    if (!config?.enabled) {\n        return { messages, partsFiltered: 0, partsDropped: 0, partsModified: 0 };\n    }\n\n    const active = listMessageFilters().filter(\n        (filter) => config.filters?.[filter.name]?.enabled !== false,\n    );\n    if (active.length === 0) {\n        return { messages, partsFiltered: 0, partsDropped: 0, partsModified: 0 };\n    }\n\n    let working = messages.map((message) => ({ ...message }));\n    const tally = { partsFiltered: 0, partsDropped: 0, partsModified: 0 };\n    const total = working.length;\n\n    const immediate = active.filter((filter) => !filter.keepLastOnly);\n    for (let index = 0; index < working.length; index++) {\n        const message = working[index]!;\n        const text = message.text ?? \"\";\n        if (text.length === 0) continue;\n        let current = text;\n        const baseCtx: MessageFilterContext = {\n            text: current,\n            role: message.role,\n            messageIndex: index,\n            totalMessages: total,\n            toolName: message.toolName,\n        };\n        for (const filter of immediate) {\n            let decision: FilterResult;\n            try {\n                decision = filter.filter(baseCtx);\n            } catch {\n                continue;\n            }\n            if (decision.action === \"keep\") continue;\n            tally.partsFiltered++;\n            if (decision.action === \"drop\") {\n                current = \"\";\n                tally.partsDropped++;\n            } else if (decision.action === \"modify\" && decision.text !== undefined) {\n                current = decision.text;\n                tally.partsModified++;\n            }\n            baseCtx.text = current;\n        }\n        if (current !== text) working[index] = { ...message, text: current };\n    }\n\n    const keepLast = active.filter((filter) => filter.keepLastOnly);\n    for (const filter of keepLast) {\n        let foundLast = false;\n        for (let index = working.length - 1; index >= 0; index--) {\n            const message = working[index]!;\n            const text = message.text ?? \"\";\n            if (text.length === 0) continue;\n            const ctx: MessageFilterContext = {\n                text,\n                role: message.role,\n                messageIndex: index,\n                totalMessages: total,\n                toolName: message.toolName,\n            };\n            let decision: FilterResult;\n            try {\n                decision = filter.filter(ctx);\n            } catch {\n                continue;\n            }\n            if (decision.action !== \"drop\" && decision.action !== \"modify\") continue;\n            if (foundLast) {\n                tally.partsFiltered++;\n                tally.partsDropped++;\n                working[index] = { ...message, text: \"\" };\n            } else {\n                foundLast = true;\n                if (decision.action === \"modify\" && decision.text !== undefined) {\n                    tally.partsFiltered++;\n                    tally.partsModified++;\n                    working[index] = { ...message, text: decision.text };\n                }\n            }\n        }\n    }\n\n    return { messages: working, ...tally };\n}\n","import type { CoreMessage, CompressionState, MessageRefMap } from \"./types.js\";\nimport { refForRaw, BLOCKED_REF } from \"./refs.js\";\nimport type { PipelineNode, PipelineContext, NodeIO } from \"./pipeline.js\";\n\n/**\n * Controls which messages get an <acp> ref tag injected into their text.\n * Ref assignment (assignRefsNode) is unconditional — every message always\n * receives a ref in state.messageRefs regardless of this setting. This only\n * governs text rendering:\n *  - \"all\": tag every mapped message (in-process hosts like pai-acp)\n *  - \"text-only\": tag only user/assistant text; leave tool-call args and\n *    tool-result content pristine (proxy hosts — structured content must not\n *    be polluted)\n *  - \"none\": leave all text untouched (hosts that read the ref map directly)\n */\nexport type RenderStrategy = \"all\" | \"text-only\" | \"none\";\n\n/** Format token count: <1K raw, <10K \"X.YK\", >=10K \"XK\". */\nfunction formatTokens(tokens: number): string {\n  if (tokens < 1000) return String(tokens);\n  if (tokens < 10000) return (tokens / 1000).toFixed(1) + \"K\";\n  return Math.round(tokens / 1000) + \"K\";\n}\n\nfunction classifyType(message: CoreMessage): string {\n  if (\n    message.contentType === \"tool-call\" ||\n    message.contentType === \"tool-result\"\n  ) {\n    return message.toolName || \"tool\";\n  }\n  return message.contentType;\n}\n\nfunction escapeRegex(s: string): string {\n  return s.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\n\nconst LT = \"\\x3c\";\nconst GT = \"\\x3e\";\nconst TAG_OPEN = LT + \"acp \";\nconst TAG_CLOSE = LT + \"/acp\" + GT;\n\nfunction acpTag(ref: string, tokens: number, type: string): string {\n  return TAG_OPEN + 'tokens=\"' + formatTokens(tokens) + '\" type=\"' + type + '\"' + GT + ref + TAG_CLOSE;\n}\n\nfunction renderMessage(\n  message: CoreMessage,\n  map: MessageRefMap,\n  countTokens: (text: string) => number,\n  strategy: RenderStrategy,\n  snapshot: Record<string, number> | null = null,\n): CoreMessage {\n  const ref = refForRaw(map, message.id);\n  if (!ref || ref === BLOCKED_REF) return message;\n\n  // \"none\": host reads the ref map directly — never pollute text.\n  if (strategy === \"none\") return message;\n\n  // text-only: never tag structured tool content. Refs are still assigned.\n  if (strategy === \"text-only\" && message.contentType !== \"text\") {\n    return message;\n  }\n\n  // Strip own stale tag BEFORE computing tokens (idempotency).\n  // Match the message's own ref only — foreign tags survive (content-corruption fix).\n  const ownTagRe = new RegExp(\n    \"^\" + escapeRegex(TAG_OPEN) + \"[^>]*\" + GT + escapeRegex(ref) + escapeRegex(TAG_CLOSE) + \"\\\\n?\",\n  );\n  const cleanText = (message.text || \"\").replace(ownTagRe, \"\");\n\n  // Snapshot mode: token count is fixed at first render (stable prefix cache).\n  // Live mode (snapshot = null): recompute every render — legacy behavior.\n  const tokens = snapshot\n    ? (snapshot[ref] ?? (snapshot[ref] = countTokens(cleanText)))\n    : countTokens(cleanText);\n  const type = classifyType(message);\n  const prefix = acpTag(ref, tokens, type) + \"\\n\";\n\n  if (!cleanText) return { ...message, text: prefix };\n  return { ...message, text: prefix + cleanText };\n}\n\nexport function renderVisibleRefs(\n  messages: CoreMessage[],\n  state: CompressionState,\n  countTokens: (text: string) => number = (text) =>\n    Math.ceil(text.length / 4),\n  strategy: RenderStrategy = \"all\",\n): CoreMessage[] {\n  // Legacy behavior: recompute tokens every render (snapshot = null).\n  const map = state.messageRefs;\n  return messages.map((message) =>\n    renderMessage(message, map, countTokens, strategy),\n  );\n}\n\nexport interface RenderWithSnapshotResult {\n  messages: CoreMessage[];\n  tokenSnapshot: Record<string, number>;\n}\n\n/** Render with a stable token snapshot: token counts are written on first\n *  render and reused forever (keyed by ref). The snapshot starts as a shallow\n *  copy of the persisted state so old entries survive; new entries are added\n *  during this render. */\nexport function renderWithSnapshot(\n  messages: CoreMessage[],\n  state: CompressionState,\n  countTokens: (text: string) => number = (text) => Math.ceil(text.length / 4),\n  strategy: RenderStrategy = \"all\",\n): RenderWithSnapshotResult {\n  const map = state.messageRefs;\n  const snapshot = { ...(state.tokenSnapshot ?? {}) };\n  const rendered = messages.map((message) =>\n    renderMessage(message, map, countTokens, strategy, snapshot),\n  );\n  return { messages: rendered, tokenSnapshot: snapshot };\n}\n\n/** Factory: build a render-refs node bound to a specific render strategy. */\nexport function createRenderRefsNode(strategy: RenderStrategy): PipelineNode {\n  return {\n    name: \"render-refs\",\n    run(io: NodeIO, ctx: PipelineContext): NodeIO {\n      const { messages, tokenSnapshot } = renderWithSnapshot(\n        io.messages,\n        io.state,\n        ctx.countTokens,\n        strategy,\n      );\n      // Write the snapshot back only when it grew: steady-state (all hits)\n      // must not churn the state object and force an adapter save every turn.\n      const prev = io.state.tokenSnapshot;\n      const changed =\n        !prev || Object.keys(tokenSnapshot).length !== Object.keys(prev).length;\n      return changed\n        ? { ...io, messages, state: { ...io.state, tokenSnapshot } }\n        : { ...io, messages };\n    },\n  };\n}\n\n/** Backward compat: default render-refs node using strategy \"all\". */\nexport const renderRefsNode: PipelineNode = createRenderRefsNode(\"all\");\n","import type { Config, CoreMessage } from \"./types.js\";\n\n/** Tools that are ALWAYS protected, regardless of user config. These are ACP's\n *  own metadata tools whose records must remain in context: compress calls\n *  carry the summaries that decompress/search rely on, and the system prompt\n *  treats past compress calls as load-bearing metadata. Letting them be\n *  compressed away breaks decompress and the \"summary is historical\" contract. */\nexport const ALWAYS_PROTECTED_TOOLS = [\"compress\"] as const;\n\n/** Tool results that must NEVER participate in the soft-protected recent zone\n *  (preserveRecentMessages / preserveRecentTokens / last user message).\n *\n *  These tools return large content (restored blocks, search hits, file bodies,\n *  command output). If such a result lands in the last-N window it becomes\n *  un-compressible: the model cannot reclaim that context, and it never appears\n *  in the compressible-ranges recommendation list. Excluding these tools from\n *  the protected zone lets the model compress them again immediately, while\n *  still leaving them visible (the host's preserveRecent is about not\n *  compressing the active working set, not about which tool results are in\n *  scope).\n *\n *  - `decompress`: large restored content as an inline tool result.\n *  - `search_context`: large result lists (10 ranked hits with previews).\n *  - `read`: file/image contents — the largest common source of context bloat.\n *  - `bash`: command output (build/test/logs) — frequently large and spent.\n *\n *  Note: this only affects the recent-zone computation. Such messages remain\n *  fully visible and compressible like any ordinary message. */\nexport const NEVER_PRESERVE_RECENT_TOOLS = [\n  \"decompress\",\n  \"search_context\",\n  \"read\",\n  \"bash\",\n] as const;\n\n/** True for tool-call / tool-result messages whose toolName is in the\n *  NEVER_PRESERVE_RECENT_TOOLS list — i.e. tool results (like decompress)\n *  that should be excluded from the soft-protected recent zone. */\nexport function isNeverPreserveRecent(msg: CoreMessage): boolean {\n  if (msg.contentType !== \"tool-call\" && msg.contentType !== \"tool-result\") {\n    return false;\n  }\n  if (!msg.toolName) return false;\n  return (NEVER_PRESERVE_RECENT_TOOLS as readonly string[]).includes(msg.toolName);\n}\n\nexport function matchToolPattern(toolName: string, pattern: string): boolean {\n  if (pattern.endsWith(\"*\")) {\n    return toolName.startsWith(pattern.slice(0, -1));\n  }\n  return toolName === pattern;\n}\n\nexport function isMessageProtected(\n  msg: CoreMessage,\n  config: Pick<Config, \"protectedTools\" | \"isToolProtected\">,\n): boolean {\n  // tool-result carries the same toolName as its tool-call (the host projects\n  // it), so checking toolName covers both sides of a tool exchange.\n  if (\n    (msg.contentType !== \"tool-call\" && msg.contentType !== \"tool-result\") ||\n    !msg.toolName\n  ) {\n    return false;\n  }\n\n  // Hard-coded protection: ACP metadata tools are never compressible.\n  if ((ALWAYS_PROTECTED_TOOLS as readonly string[]).includes(msg.toolName)) {\n    return true;\n  }\n\n  for (const pattern of config.protectedTools) {\n    if (matchToolPattern(msg.toolName, pattern)) return true;\n  }\n\n  if (config.isToolProtected?.(msg.toolName, msg.text)) return true;\n\n  return false;\n}\n\n/** Build the set of toolCallIds whose tool-call is protected. Use this to also\n *  protect tool-results that lack a toolName (common when the host projects a\n *  tool-result with only toolCallId). Without it, the result half of a\n *  protected tool exchange leaks into compressible ranges. */\nexport function collectProtectedToolCallIds(\n  messages: CoreMessage[],\n  config: Pick<Config, \"protectedTools\" | \"isToolProtected\">,\n): Set<string> {\n  const ids = new Set<string>();\n  for (const m of messages) {\n    if (m.contentType === \"tool-call\" && m.toolCallId && isMessageProtected(m, config)) {\n      ids.add(m.toolCallId);\n    }\n  }\n  return ids;\n}\n\n/** Like isMessageProtected, but also matches tool-results by toolCallId against\n *  the protected call set. Use when you have the full message list available. */\nexport function isMessageProtectedWithPairing(\n  msg: CoreMessage,\n  config: Pick<Config, \"protectedTools\" | \"isToolProtected\">,\n  protectedCallIds: Set<string>,\n): boolean {\n  if (isMessageProtected(msg, config)) return true;\n  if (\n    msg.contentType === \"tool-result\" &&\n    msg.toolCallId &&\n    protectedCallIds.has(msg.toolCallId)\n  ) {\n    return true;\n  }\n  return false;\n}\n","import type { CoreMessage } from \"./types.js\";\n\n/**\n * Adjust compression range boundaries to include tool-call/result pairs.\n *\n * PREVENTIVE approach (adapted from opencode-acp PR #248): before compression\n * is applied, scan for tool-call or tool-result messages whose matching half\n * (the result for a call in range, or the call for a result in range) sits\n * outside the requested range. Pull the orphan half INTO the range so the\n * pair is compressed together — zero information loss.\n *\n * Only MESSAGE-boundary ranges are adjusted. Block-boundary ranges (bN) are\n * left untouched to preserve tier-detection correctness.\n *\n * @returns Adjusted { startIndex, endIndex } — may be wider than input.\n */\nexport function adjustBoundariesForToolPairs(\n    startIndex: number,\n    endIndex: number,\n    messages: CoreMessage[],\n    maxScan: number = 20,\n): { startIndex: number; endIndex: number } {\n    // Collect all toolCallIds in range (both tool-call and tool-result messages).\n    // Skip compress tool — it's force-protected and always survives pruning.\n    const callIdsInRange = new Set<string>();\n    for (let i = startIndex; i <= endIndex; i++) {\n        const msg = messages[i];\n        if (!msg || !msg.toolCallId) continue;\n        if (msg.toolName === \"compress\") continue;\n        callIdsInRange.add(msg.toolCallId);\n    }\n\n    if (callIdsInRange.size === 0) {\n        return { startIndex, endIndex };\n    }\n\n    // Extend FORWARD: tool-results typically follow their tool-call.\n    // Stop at the first gap after finding at least one matching message.\n    let newEndIndex = endIndex;\n    for (let i = endIndex + 1; i < messages.length && i <= endIndex + maxScan; i++) {\n        const msg = messages[i];\n        if (!msg) break;\n        if (msg.toolCallId && callIdsInRange.has(msg.toolCallId)) {\n            newEndIndex = i;\n        } else if (newEndIndex > endIndex) {\n            break;\n        }\n    }\n\n    // Extend BACKWARD: tool-calls typically precede their tool-result.\n    let newStartIndex = startIndex;\n    for (let i = startIndex - 1; i >= 0 && i >= startIndex - maxScan; i--) {\n        const msg = messages[i];\n        if (!msg) break;\n        if (msg.toolCallId && callIdsInRange.has(msg.toolCallId)) {\n            newStartIndex = i;\n        } else if (newStartIndex < startIndex) {\n            break;\n        }\n    }\n\n    return { startIndex: newStartIndex, endIndex: newEndIndex };\n}\n","import type { CoreMessage } from \"./types.js\";\n\n/**\n * Adjust compression range boundaries to keep a `reasoning` message together\n * with the assistant text/tool-call it belongs to.\n *\n * Reasoning models (DeepSeek-R1, GLM-4.6 thinking, Qwen-QwQ, Anthropic\n * thinking) emit a `reasoning_content` / thinking block that strict providers\n * require to be echoed back alongside the response on every subsequent\n * request. In acp-kernel that block is a separate `contentType: \"reasoning\"`\n * message immediately preceding the assistant text/tool-call of the same turn.\n * If a compression range covers only one half of the pair, the rebuilt\n * conversation ships reasoning without its response (or vice versa) and the\n * provider returns HTTP 400 (DeepSeek: \"reasoning_content in the thinking mode\n * must be passed back to the API\").\n *\n * This is the reasoning analogue of {@link adjustBoundariesForToolPairs}:\n * before a range is applied, pull the orphan half INTO the range so the pair\n * compresses together — zero information loss. Only MESSAGE-boundary ranges\n * are adjusted (block-boundary ranges are left untouched, like tool pairs).\n *\n * Pairing is adjacency-based — there is no shared id (unlike toolCallId). A\n * `reasoning` message pairs with the assistant text/tool-call immediately\n * following its reasoning run, and an assistant text/tool-call pairs with the\n * reasoning run immediately preceding it. This matches the round-trip contract\n * every adapter relies on when reconstructing reasoning_content.\n *\n * @returns Adjusted { startIndex, endIndex } — may be wider than input.\n */\nexport function adjustBoundariesForReasoningPairs(\n  startIndex: number,\n  endIndex: number,\n  messages: CoreMessage[],\n): { startIndex: number; endIndex: number } {\n  if (startIndex > endIndex) {\n    return { startIndex, endIndex };\n  }\n  let newStartIndex = startIndex;\n  let newEndIndex = endIndex;\n\n  for (let i = startIndex; i <= endIndex && i < messages.length; i++) {\n    const msg = messages[i];\n    if (!msg) continue;\n\n    if (msg.contentType === \"reasoning\") {\n      // Forward: pull the companion assistant text/tool-call that follows\n      // this reasoning run into the range.\n      let j = i;\n      while (\n        j + 1 < messages.length &&\n        messages[j + 1]!.contentType === \"reasoning\"\n      ) {\n        j++;\n      }\n      const companion = messages[j + 1];\n      if (\n        companion !== undefined &&\n        companion.role === \"assistant\" &&\n        (companion.contentType === \"text\" ||\n          companion.contentType === \"tool-call\") &&\n        j + 1 > newEndIndex\n      ) {\n        newEndIndex = j + 1;\n      }\n    }\n\n    if (\n      msg.role === \"assistant\" &&\n      (msg.contentType === \"text\" || msg.contentType === \"tool-call\")\n    ) {\n      // Backward: pull the reasoning run immediately preceding this assistant\n      // message into the range.\n      let k = i - 1;\n      while (k >= 0 && messages[k]!.contentType === \"reasoning\") {\n        k--;\n      }\n      const runStart = k + 1;\n      if (\n        runStart < i &&\n        runStart >= 0 &&\n        messages[runStart]!.contentType === \"reasoning\" &&\n        runStart < newStartIndex\n      ) {\n        newStartIndex = runStart;\n      }\n    }\n  }\n\n  return { startIndex: newStartIndex, endIndex: newEndIndex };\n}\n","/**\n * Recommendation engine — compression protection + recommendation.\n *\n * Clean-room reimplementation of the recommendation algorithm (MIT, ours).\n * These pure functions answer two questions every turn:\n *\n *  1. **Protection** — which messages must NOT be compressed? (protected tools,\n *     recent messages, recent tokens)\n *  2. **Recommendation** — which remaining ranges are actually WORTH compressing?\n *     (growth-aware threshold; suppress nudges when ranges are too small)\n *\n * Called by the `recommend` pipeline node. No side effects, no state mutation.\n */\n\nimport type {\n  CompressibleRange,\n  Config,\n  ContextRanges,\n  CoreMessage,\n  ProtectedRange,\n} from \"./types.js\";\nimport type { CompressionState } from \"./types.js\";\nimport {\n  collectProtectedToolCallIds,\n  isMessageProtectedWithPairing,\n  isNeverPreserveRecent,\n} from \"./protected.js\";\n\n// ─── Helpers ──────────────────────────────────────────────────────────────────\n\nfunction refNum(ref: string): number {\n  const n = parseInt(ref.slice(1), 10);\n  return Number.isNaN(n) ? -1 : n;\n}\n\n/** Default token estimate (chars/4) used when the caller doesn't inject a\n *  countTokens — preserves the historical behavior for backwards compat. */\nfunction estimateTextTokens(text: string): number {\n  return Math.ceil(text.length / 4);\n}\n\nfunction isToolMessage(message: CoreMessage): boolean {\n  return message.contentType === \"tool-call\" || message.contentType === \"tool-result\";\n}\n\n\nfunction isSyntheticOrPruned(\n  message: CoreMessage,\n  state: CompressionState,\n): boolean {\n  if (message.text?.startsWith(\"[Compressed conversation section]\")) return true;\n  for (const block of state.blocks) {\n    if (block.active && block.effectiveMessageIds.includes(message.id)) return true;\n  }\n  return false;\n}\n\n// ─── 1. Protected Refs (soft protection zone) ─────────────────────────────────\n\n/**\n * Compute the set of protected message refs (mNNNNN) that form the\n * \"soft-protected zone\" at the tail of the conversation.\n *\n * Combines two rules:\n *   1. Last N messages (`config.preserveRecentMessages`)\n *   2. Last N tokens expanding backward (`config.preserveRecentTokens`)\n *\n * Only considers visible, non-synthetic, non-pruned messages that have refs.\n */\nexport function computeProtectedRefs(\n  messages: CoreMessage[],\n  state: CompressionState,\n  config: Config,\n  countTokens: (text: string) => number = estimateTextTokens,\n): Set<string> {\n  const preserveN = config.preserveRecentMessages;\n  const preserveTokens = config.preserveRecentTokens;\n\n  const result = new Set<string>();\n  const visible: { ref: string; tokens: number }[] = [];\n\n  for (const msg of messages) {\n    if (isSyntheticOrPruned(msg, state)) continue;\n    // Exclude decompress-style tool results from the recent-zone window.\n    // These are large inline restorations that the model should be free to\n    // compress again immediately; counting them toward the last-N window\n    // would make them un-compressible and hide them from recommendations.\n    // The message stays fully visible — this only affects protection scope.\n    if (isNeverPreserveRecent(msg)) continue;\n    const ref = state.messageRefs.byRaw[msg.id];\n    if (!ref || ref === \"BLOCKED\") continue;\n    visible.push({ ref, tokens: countTokens(msg.text ?? \"\") });\n  }\n\n  // Rule 1: last N messages\n  if (preserveN > 0) {\n    for (const m of visible.slice(-preserveN)) {\n      result.add(m.ref);\n    }\n  }\n\n  // Rule 2: last N tokens (expand backward from tail)\n  if (preserveTokens > 0) {\n    let tokenAccum = 0;\n    for (let i = visible.length - 1; i >= 0 && tokenAccum < preserveTokens; i--) {\n      result.add(visible[i]!.ref);\n      tokenAccum += visible[i]!.tokens;\n    }\n  }\n\n  // Rule 3: last visible user message. Protected whenever recent-message\n  // protection is on (preserveRecentMessages > 0) — this couples it to the\n  // same switch as Rule 1, so setting preserveRecentMessages = 0 fully opts\n  // out (needed by tests that compress the tail). Production defaultConfig\n  // uses 5, so the last user message is always protected in practice.\n  // Note: we scan the raw messages array (not `visible`) here so the last\n  // user message is still found even when a decompress tool result was\n  // skipped above — user intent is always protected regardless of recent\n  // tool results.\n  if (preserveN > 0) {\n    for (let i = messages.length - 1; i >= 0; i--) {\n      const msg = messages[i]!;\n      if (msg.role !== \"user\" || isSyntheticOrPruned(msg, state)) continue;\n      const ref = state.messageRefs.byRaw[msg.id];\n      if (ref && ref !== \"BLOCKED\") result.add(ref);\n      break;\n    }\n  }\n\n  return result;\n}\n\n// ─── 2. Build Compressible + Protected Ranges ────────────────────────────────\n\n/**\n * Build compressible and protected range groups from the message list.\n *\n * Messages are classified into:\n *   - **compressible**: normal messages outside the protected zone\n *   - **protected**: messages from protected tools (e.g., skill, task)\n *   - **skipped**: covered by blocks, synthetic, or in the protected zone\n *\n * Compressible messages are grouped into contiguous ranges. The protected\n * zone (from `computeProtectedRefs`) splits groups — the unprotected head\n * survives as its own range.\n */\nexport function buildCompressibleRanges(\n  messages: CoreMessage[],\n  state: CompressionState,\n  config: Config,\n  protectedZoneRefs?: Set<string>,\n  countTokens: (text: string) => number = estimateTextTokens,\n): ContextRanges {\n  const compressibleMsgs: {\n    ref: string;\n    refNum: number;\n    tokens: number;\n    chars: number;\n    isTool: boolean;\n    isUser: boolean;\n  }[] = [];\n  const protectedMsgs: {\n    ref: string;\n    refNum: number;\n    tokens: number;\n    tools: string[];\n  }[] = [];\n\n  // Pairing: a tool-result may carry only toolCallId (no toolName). Collect the\n  // callIds of protected tool-calls first, then protect matching results too.\n  const protectedCallIds = collectProtectedToolCallIds(messages, config);\n\n  for (const msg of messages) {\n    if (isSyntheticOrPruned(msg, state)) continue;\n    const ref = state.messageRefs.byRaw[msg.id];\n    if (!ref || ref === \"BLOCKED\") continue;\n\n    const rn = refNum(ref);\n\n    if (isMessageProtectedWithPairing(msg, config, protectedCallIds)) {\n      protectedMsgs.push({\n        ref,\n        refNum: rn,\n        tokens: countTokens(msg.text ?? \"\"),\n        tools: msg.toolName ? [msg.toolName] : [],\n      });\n      continue;\n    }\n\n    if (protectedZoneRefs?.has(ref)) {\n      continue;\n    }\n\n    compressibleMsgs.push({\n      ref,\n      refNum: rn,\n      tokens: countTokens(msg.text ?? \"\"),\n      chars: (msg.text ?? \"\").length,\n      isTool: isToolMessage(msg),\n      isUser: msg.role === \"user\",\n    });\n  }\n\n  // Build compressible groups (contiguous, split at ref gaps and at user\n  // messages once a group has >= 3 messages). Splitting at user boundaries\n  // keeps each compressible range aligned to roughly one user turn, instead\n  // of producing one giant range spanning many turns (or, conversely, a\n  // fragment per message when ref gaps appear). Mirrors opencode-acp's\n  // buildCompressibleRanges condition.\n  const compressible: CompressibleRange[] = [];\n  let cur: CompressibleRange | null = null;\n  let prevRefNum = -2;\n\n  for (const info of compressibleMsgs) {\n    const hasGap = info.refNum > prevRefNum + 1;\n    if (cur && ((info.isUser && cur.count >= 3) || hasGap)) {\n      compressible.push(cur);\n      cur = null;\n    }\n    prevRefNum = info.refNum;\n    if (!cur) {\n      cur = {\n        startRef: info.ref,\n        endRef: info.ref,\n        count: 1,\n        tokens: info.tokens,\n        chars: info.chars,\n        toolPct: info.isTool ? 100 : 0,\n        textPct: info.isTool ? 0 : 100,\n      };\n    } else {\n      cur.endRef = info.ref;\n      cur.count++;\n      cur.tokens += info.tokens;\n      cur.chars = (cur.chars ?? 0) + info.chars;\n      if (info.isTool) {\n        cur.toolPct = Math.round((cur.toolPct * (cur.count - 1) + 100) / cur.count);\n      } else {\n        cur.toolPct = Math.round((cur.toolPct * (cur.count - 1)) / cur.count);\n      }\n      cur.textPct = 100 - cur.toolPct;\n    }\n  }\n  if (cur) compressible.push(cur);\n\n  // Build protected groups (contiguous)\n  const protectedRanges: ProtectedRange[] = [];\n  let pcur: ProtectedRange | null = null;\n  let pPrevRefNum = -2;\n\n  for (const info of protectedMsgs) {\n    const hasGap = info.refNum > pPrevRefNum + 1;\n    if (pcur && hasGap) {\n      protectedRanges.push(pcur);\n      pcur = null;\n    }\n    pPrevRefNum = info.refNum;\n    if (!pcur) {\n      pcur = {\n        startRef: info.ref,\n        endRef: info.ref,\n        count: 1,\n        tokens: info.tokens,\n        tools: [...info.tools],\n      };\n    } else {\n      pcur.endRef = info.ref;\n      pcur.count++;\n      pcur.tokens += info.tokens;\n      for (const t of info.tools) {\n        if (!pcur!.tools.includes(t)) pcur!.tools.push(t);\n      }\n    }\n  }\n  if (pcur) protectedRanges.push(pcur);\n\n  return {\n    compressible: compressible.filter((g) => g.tokens > 0),\n    protected: protectedRanges,\n  };\n}\n\nfunction mergeBatch(batch: CompressibleRange[]): CompressibleRange {\n  const first = batch[0]!;\n  const last = batch[batch.length - 1]!;\n  const count = batch.reduce((s, r) => s + r.count, 0);\n  const tokens = batch.reduce((s, r) => s + r.tokens, 0);\n  const chars = batch.reduce((s, r) => s + rangeChars(r), 0);\n  const toolPct = Math.round(\n    batch.reduce((s, r) => s + r.toolPct * r.count, 0) / count,\n  );\n  const merged: CompressibleRange = {\n    startRef: first.startRef,\n    endRef: last.endRef,\n    count,\n    tokens,\n    chars,\n    toolPct,\n    textPct: 100 - toolPct,\n  };\n  if (batch.some((r) => r.dangerous === true)) {\n    merged.dangerous = true;\n  }\n  return merged;\n}\n\n/** Effective size of a range in characters — the unit the apply-side\n *  minCompressRange gate uses. Falls back to the historical tokens*4\n *  estimate only for hand-built ranges that predate the `chars` field. */\nfunction rangeChars(r: CompressibleRange): number {\n  return r.chars ?? r.tokens * 4;\n}\n\n/** Merge adjacent ranges into batches that clear `minChars` of REAL text —\n *  the same accounting `applyCompression` uses — so a recommended range is\n *  never below the threshold the kernel would atomically reject. Batching by\n *  token estimates (tokens*4) instead broke whenever the host injected a\n *  tokenizer where tokens != chars/4 (CJK-aware estimators are ~1:1, so\n *  tokens*4 overestimated size ~4x and nudge recommended ranges the apply\n *  side then refused). A sub-threshold tail batch is still emitted — callers\n *  filter by effectiveness separately (see pendingByTier). */\nexport function mergeRangesToThreshold(\n  ranges: CompressibleRange[],\n  minChars: number,\n): CompressibleRange[] {\n  if (minChars <= 0 || ranges.length === 0) return ranges;\n  const result: CompressibleRange[] = [];\n  let batch: CompressibleRange[] = [];\n  let batchChars = 0;\n  for (const r of ranges) {\n    batch.push(r);\n    batchChars += rangeChars(r);\n    if (batchChars >= minChars) {\n      result.push(mergeBatch(batch));\n      batch = [];\n      batchChars = 0;\n    }\n  }\n  if (batch.length > 0) {\n    result.push(mergeBatch(batch));\n  }\n  return result;\n}\n","import type { CompressionState, CoreMessage, NudgeDecision } from \"./types.js\";\n\nexport interface PipelineContext {\n  readonly config: import(\"./types.js\").Config;\n  readonly tokenCount: number;\n  readonly countTokens: (text: string) => number;\n}\n\nexport interface NodeEffects {\n  nudge?: NudgeDecision;\n  recommendation?: import(\"./types.js\").Recommendation;\n  truncatedCount?: number;\n  readonly [key: string]: unknown;\n}\n\nexport interface NodeIO {\n  messages: CoreMessage[];\n  state: CompressionState;\n  effects: NodeEffects;\n}\n\nexport interface PipelineNode {\n  readonly name: string;\n  run(io: NodeIO, ctx: PipelineContext): NodeIO;\n  enabled?: (io: NodeIO, ctx: PipelineContext) => boolean;\n}\n\nexport function makeIO(\n  messages: CoreMessage[],\n  state: CompressionState,\n  effects: NodeEffects = {},\n): NodeIO {\n  return { messages, state, effects };\n}\n\nexport function runPipeline(\n  nodes: readonly PipelineNode[],\n  initial: NodeIO,\n  ctx: PipelineContext,\n): NodeIO {\n  let io = initial;\n  for (const node of nodes) {\n    if (node.enabled && !node.enabled(io, ctx)) continue;\n    io = node.run(io, ctx);\n  }\n  return io;\n}\n","import { assignRefs, highestUsedIndex } from \"./refs.js\";\nimport { prune, isSummaryMessageId } from \"./prune.js\";\nimport { syncBlocks } from \"./sync.js\";\nimport { advanceSurvival, activeBlocks, blockById } from \"./state.js\";\nimport { allocateBlockId, allocateRunId, createInitialState } from \"./state.js\";\nimport { defaultCountTokens } from \"./tokenize.js\";\nimport { validateConfig } from \"./config.js\";\nimport {\n  BoundaryNotFoundError,\n  resolveBoundaries,\n  blockVisibleInRange,\n} from \"./boundaries.js\";\nimport type { ResolvedRange } from \"./boundaries.js\";\nimport { truncateLargeToolOutputs } from \"./truncate-tools.js\";\nimport { hideConsumedCompressCalls } from \"./hide-consumed.js\";\nimport { applyMessageFilters, listMessageFilters } from \"./filter/index.js\";\nimport { createRenderRefsNode } from \"./render-refs.js\";\nimport type { RenderStrategy } from \"./render-refs.js\";\nimport { isMessageProtected } from \"./protected.js\";\nimport { adjustBoundariesForToolPairs } from \"./tool-pairs.js\";\nimport { adjustBoundariesForReasoningPairs } from \"./reasoning-pairs.js\";\nimport {\n  computeProtectedRefs,\n  buildCompressibleRanges,\n  mergeRangesToThreshold,\n} from \"./recommend.js\";\nimport {\n  runPipeline,\n  type PipelineContext,\n  type PipelineNode,\n  type NodeIO,\n} from \"./pipeline.js\";\nimport type {\n  ApplyCompressionResult,\n  CompressionBlock,\n  CompressionState,\n  CompressionTier,\n  Config,\n  ContextBreakdown,\n  CoreMessage,\n  NudgeConfig,\n  NudgeDecision,\n  ProcessTurnResult,\n  Recommendation,\n  StatusReport,\n} from \"./types.js\";\n\nexport interface Ports {\n  countTokens?: (text: string) => number;\n}\n\nexport interface CompressionCore {\n  processTurn(input: ProcessTurnInput): ProcessTurnResult;\n  applyCompression(input: ApplyCompressionInput): ApplyCompressionResult;\n  defaultNodes(): PipelineNode[];\n  decompress(\n    blockId: string,\n    state: CompressionState,\n  ): CompressionBlock | undefined;\n  search(query: string, state: CompressionState): CompressionBlock[];\n  status(\n    state: CompressionState,\n    tokenCount: number,\n    config: Config,\n  ): StatusReport;\n}\n\nexport interface ProcessTurnInput {\n  messages: CoreMessage[];\n  state: CompressionState;\n  config: Config;\n  tokenCount: number;\n  /**\n   * Which messages get an <acp> ref tag injected into their text\n   * (the render-refs pipeline node). Refs are ALWAYS assigned regardless\n   * (assign-refs node runs unconditionally).\n   *   - \"all\" (default): tag every mapped message — in-process hosts\n   *     like pai-acp want tags for the LLM to reference compress ranges.\n   *   - \"text-only\": tag only user/assistant text; leave tool-call args\n   *     and tool-result content pristine — proxy hosts where structured\n   *     content must not be polluted.\n   *   - \"none\": leave all text untouched — hosts that read the ref map\n   *     directly from result.state.messageRefs.\n   */\n  renderTags?: RenderStrategy;\n}\n\nexport interface ApplyCompressionInput {\n  ranges: {\n    startRef: string;\n    endRef: string;\n    summary: string;\n    topic?: string;\n    compressCallId?: string;\n    summaryMaxChars?: number;\n  }[];\n  messages: CoreMessage[];\n  state: CompressionState;\n  config: Config;\n  protectedMessageIds?: Set<string>;\n}\n\n/**\n * Per-range classification from a single resolveBoundaries pass. \"ok\" ranges\n * go on to applySingleRange (which re-resolves internally for tool-pair\n * adjustment); \"consumed\" means the refs existed but their messages were\n * hidden by an existing block; \"unknown\" means a ref never existed in this\n * session; \"invalid\" means a ref failed to parse (e.g. \"foo\").\n */\ntype RangeResolution =\n  | { status: \"ok\"; resolved: ResolvedRange }\n  | { status: \"consumed\"; error: BoundaryNotFoundError }\n  | { status: \"unknown\"; error: BoundaryNotFoundError }\n  | { status: \"invalid\"; error: Error };\n\nfunction rangeError(\n  spec: { startRef: string; endRef: string },\n  message: string,\n): string {\n  return `range ${spec.startRef}..${spec.endRef}: ${message}`;\n}\n\nfunction numericBlockId(id: string): number {\n  const parsed = /^b(\\d+)$/.exec(id);\n  return parsed ? Number(parsed[1]) : 0;\n}\n\nexport function createCore(ports: Ports = {}): CompressionCore {\n  const countTokens = ports.countTokens ?? defaultCountTokens;\n\n  function applyCompression(\n    input: ApplyCompressionInput,\n  ): ApplyCompressionResult {\n    const state: CompressionState = cloneState(input.state);\n    const runId = allocateRunId(state);\n    let blocksCreated = 0;\n    let tokensCompressed = 0;\n    const errors: string[] = [];\n    const warnings: string[] = [];\n\n    // Default to the soft-protected zone (recent-N + last user message) when the\n    // caller doesn't pass an explicit set. This makes applyCompression safe by\n    // default; applySingleRange enforces it as a hard backstop.\n    const protectedMessageIds =\n      input.protectedMessageIds ??\n      computeProtectedRefs(\n        input.messages,\n        input.state,\n        input.config,\n        countTokens,\n      );\n\n    const preExistingCoverage = collectCoverage(state);\n\n    // Classify every requested range ONCE. The result feeds overlap\n    // skipSpecs, the minCompressRange pre-check, and the per-range loop —\n    // previously each re-resolved and silently swallowed failures, so\n    // consumed/unknown ranges produced misleading \"too small\" errors.\n    const classifications = new Map<\n      (typeof input.ranges)[number],\n      RangeResolution\n    >();\n    const classificationErrors: string[] = [];\n    const consumedRanges: typeof input.ranges = [];\n    for (const spec of input.ranges) {\n      try {\n        const resolved = resolveBoundaries({\n          startRef: spec.startRef,\n          endRef: spec.endRef,\n          messages: input.messages,\n          state,\n        });\n        classifications.set(spec, { status: \"ok\", resolved });\n      } catch (error) {\n        if (error instanceof BoundaryNotFoundError) {\n          classifications.set(\n            spec,\n            error.kind === \"unknown\"\n              ? { status: \"unknown\", error }\n              : { status: \"consumed\", error },\n          );\n          if (error.kind === \"consumed\") {\n            consumedRanges.push(spec);\n          } else {\n            classificationErrors.push(rangeError(spec, error.message));\n          }\n        } else {\n          classifications.set(spec, {\n            status: \"invalid\",\n            error: error instanceof Error ? error : new Error(String(error)),\n          });\n          classificationErrors.push(\n            rangeError(\n              spec,\n              error instanceof Error ? error.message : String(error),\n            ),\n          );\n        }\n      }\n    }\n\n    let resolvableCount = 0;\n    let unknownCount = 0;\n    for (const resolution of classifications.values()) {\n      if (resolution.status === \"ok\") resolvableCount++;\n      else if (resolution.status === \"unknown\") unknownCount++;\n    }\n\n    // Overlap detection uses resolved boundary indices, not messageIds: a\n    // summary-only range (block refs over a pruned view) has empty\n    // messageIds after synthetic-id filtering but still occupies its\n    // [startIndex, endIndex] span.\n    const rangeSpans: {\n      spec: (typeof input.ranges)[number];\n      start: number;\n      end: number;\n    }[] = [];\n    for (const [spec, resolution] of classifications) {\n      if (resolution.status !== \"ok\") continue;\n      rangeSpans.push({\n        spec,\n        start: resolution.resolved.startIndex,\n        end: resolution.resolved.endIndex,\n      });\n    }\n    const sortedRanges = [...rangeSpans].sort((a, b) => a.start - b.start);\n    // Overlapping ranges warn+skip (earliest wins) rather than aborting the\n    // whole batch — see ISSUE-42 / dog/billion-context-pi#21.\n    const skipSpecs = new Set<(typeof input.ranges)[number]>();\n    let acceptedMaxIndex = -1;\n    for (const entry of sortedRanges) {\n      if (entry.start <= acceptedMaxIndex) {\n        skipSpecs.add(entry.spec);\n        warnings.push(\n          `Skipped range (${entry.spec.startRef}..${entry.spec.endRef}) — overlaps an earlier range in the batch; the earlier range takes precedence. Keep ranges disjoint.`,\n        );\n        continue;\n      }\n      if (entry.end > acceptedMaxIndex) acceptedMaxIndex = entry.end;\n    }\n\n    if (input.config.compress.minCompressRange > 0 && input.ranges.length > 0) {\n      let totalRangeChars = 0;\n      let hasBlockBoundaryRange = false;\n      let countedRanges = 0;\n      for (const [spec, resolution] of classifications) {\n        if (resolution.status !== \"ok\" || skipSpecs.has(spec)) continue;\n        if (resolution.resolved.boundaryKind === \"block\") {\n          hasBlockBoundaryRange = true;\n          continue;\n        }\n        countedRanges++;\n        for (const id of resolution.resolved.messageIds) {\n          const msg = input.messages.find((m) => m.id === id);\n          totalRangeChars += msg?.text?.length ?? 0;\n        }\n      }\n      if (\n        !hasBlockBoundaryRange &&\n        totalRangeChars < input.config.compress.minCompressRange\n      ) {\n        const live = activeBlocks(state)\n          .map((b) => b.blockId)\n          .sort((x, y) => numericBlockId(x) - numericBlockId(y));\n        const liveHint =\n          live.length > 0\n            ? ` Current active blocks span ${live[0]}..${live[live.length - 1]} — retry with startId/endId set to active block IDs in that span.`\n            : \"\";\n        const gateMessage =\n          resolvableCount === 0 &&\n          consumedRanges.length === 0 &&\n          unknownCount > 0\n            ? `None of the ${input.ranges.length} requested range(s) resolved — every ref failed with \"does not exist in this session\". Refs recorded before an earlier compress are stale: each successful compress renumbers the remaining refs. Run acp_status, then re-issue the compress in the same turn using only the refs it reports.`\n            : consumedRanges.length > 0\n              ? `Requested range(s) already compressed (e.g. ${consumedRanges[0]!.startRef}..${consumedRanges[0]!.endRef}); remaining compressible content ${totalRangeChars} chars < min ${input.config.compress.minCompressRange}. Nothing to do.${liveHint}`\n              : `Total compressible content too small (${totalRangeChars} chars across ${countedRanges} range(s), min ${input.config.compress.minCompressRange}). Combine more messages into your range(s) to meet the threshold.`;\n        return {\n          state: input.state,\n          result: {\n            blocksCreated: 0,\n            tokensCompressed: 0,\n            errors: [gateMessage, ...classificationErrors],\n            warnings: [],\n          },\n        };\n      }\n    }\n\n    for (const spec of input.ranges) {\n      if (skipSpecs.has(spec)) continue;\n      const resolution = classifications.get(spec);\n      if (resolution === undefined) continue;\n      if (resolution.status === \"consumed\") {\n        warnings.push(\n          `Skipped range (${spec.startRef}..${spec.endRef}) — already compressed (messages consumed by existing block(s)); nothing to compress.`,\n        );\n        continue;\n      }\n      if (resolution.status === \"unknown\" || resolution.status === \"invalid\") {\n        errors.push(rangeError(spec, resolution.error.message));\n        continue;\n      }\n      warnings.push(...resolution.resolved.snappedBoundaries);\n      try {\n        const outcome = applySingleRange({\n          spec,\n          messages: input.messages,\n          state,\n          runId,\n          config: input.config,\n          protectedMessageIds,\n          countTokens,\n          preExistingCoverage,\n        });\n        blocksCreated++;\n        tokensCompressed += outcome.tokens;\n        warnings.push(...outcome.warnings);\n      } catch (error) {\n        errors.push(\n          rangeError(\n            spec,\n            error instanceof Error ? error.message : String(error),\n          ),\n        );\n      }\n    }\n\n    state.stats.compressionCount += blocksCreated;\n    state.stats.tokensCompressed += tokensCompressed;\n\n    if (blocksCreated > 0) {\n      // Compress succeeded: clear the growth baseline so the next turn\n      // re-establishes it at the new (lower) token count. Without this the\n      // nudge re-fires in a feedback loop (the §5.7 baseline-reset bug).\n      state.nudge.lastPerMessageNudgeTokens = 0;\n      state.nudge.lastNudgeShownTokens = 0;\n      // Clearing the per-tier cadence too: after a successful compression\n      // (which may have consumed blocks of tier N to produce tier N+1), every\n      // tier should be eligible to re-evaluate from the new token count.\n      state.nudge.lastShownByTier = {};\n    }\n\n    return {\n      state,\n      result: { blocksCreated, tokensCompressed, errors, warnings },\n    };\n  }\n\n  function processTurn(input: ProcessTurnInput): ProcessTurnResult {\n    const configErrors = validateConfig(input.config);\n    if (configErrors.length > 0) {\n      console.warn(\n        `[acp-kernel] Config validation warnings: ${configErrors.join(\"; \")}. Thresholds may not fire correctly.`,\n      );\n    }\n    const ctx: PipelineContext = {\n      config: input.config,\n      tokenCount: input.tokenCount,\n      countTokens,\n    };\n    const initial: NodeIO = {\n      messages: input.messages,\n      state: input.state,\n      effects: {},\n    };\n    // Conversion (assign-refs) and rendering (render-refs) are separate\n    // concerns. Refs are always assigned; renderTags only controls which\n    // message texts receive an <acp> tag.\n    const strategy: RenderStrategy = input.renderTags ?? \"all\";\n    const nodes = buildNodes(strategy);\n    const result = runPipeline(nodes, initial, ctx);\n    return {\n      messages: result.messages,\n      state: result.state,\n      nudge: result.effects.nudge,\n    };\n  }\n\n  function decompress(blockId: string, state: CompressionState) {\n    return blockById(state, blockId);\n  }\n\n  function search(query: string, state: CompressionState): CompressionBlock[] {\n    const terms = query\n      .toLowerCase()\n      .split(/\\s+/)\n      .filter((term) => term.length > 0);\n    if (terms.length === 0) return [];\n    const scored = activeBlocks(state)\n      .map((block) => ({ block, score: scoreRelevance(block, terms) }))\n      .filter((entry) => entry.score > 0.1)\n      .sort((left, right) => right.score - left.score);\n    return scored.map((entry) => entry.block);\n  }\n\n  function status(\n    state: CompressionState,\n    tokenCount: number,\n    config: Config,\n  ): StatusReport {\n    const active = activeBlocks(state);\n    const usage =\n      config.modelContextLimit > 0 ? tokenCount / config.modelContextLimit : 0;\n    return {\n      contextUsage: usage,\n      tokenCount,\n      modelContextLimit: config.modelContextLimit,\n      activeBlocks: active.length,\n      totalBlocks: state.blocks.length,\n      tokensCompressed: state.stats.tokensCompressed,\n      breakdown: { active: active.length, total: state.blocks.length },\n    };\n  }\n\n  function defaultNodes(): PipelineNode[] {\n    return buildNodes(\"all\");\n  }\n\n  /** Build the pipeline node list for a given render strategy. \"none\" omits\n   *  the render-refs node entirely; \"all\"/\"text-only\" append a render-refs\n   *  node bound to that strategy. */\n  function buildNodes(strategy: RenderStrategy): PipelineNode[] {\n    const base: PipelineNode[] = [\n      assignRefsNode,\n      syncBlocksNode,\n      pruneNode,\n      filterNode,\n      hideCompressCallsNode,\n      recommendNode,\n      nudgeNode,\n      emergencyTruncateNode,\n    ];\n    if (strategy === \"none\") return base;\n    return [...base, createRenderRefsNode(strategy)];\n  }\n\n  return {\n    processTurn,\n    applyCompression,\n    defaultNodes,\n    decompress,\n    search,\n    status,\n  };\n}\n\n// --- Pipeline nodes -------------------------------------------------------\n// Each node owns ONE concern. The ref map has a SINGLE writer (assignRefsNode);\n// tags are DERIVED at the end (renderRefsNode) — no dual source of truth, so\n// the old stripHallucinations band-aid is gone. Truncation is the LAST\n// token-reducing safety valve; render-refs is the final annotation pass.\n\nconst assignRefsNode: PipelineNode = {\n  name: \"assign-refs\",\n  run(io, ctx) {\n    const hasProtection =\n      ctx.config.protectedTools.length > 0 || !!ctx.config.isToolProtected;\n    const protectedFn = hasProtection\n      ? (m: CoreMessage) => isMessageProtected(m, ctx.config)\n      : undefined;\n    const refResult = assignRefs(io.messages, {\n      existing: io.state.messageRefs,\n      nextIndex: highestUsedIndex(io.state.messageRefs) + 1,\n      isProtected: protectedFn,\n    });\n    return { ...io, state: { ...io.state, messageRefs: refResult.map } };\n  },\n};\n\nconst syncBlocksNode: PipelineNode = {\n  name: \"sync-blocks\",\n  run(io, ctx) {\n    const synced = syncBlocks(io.messages, io.state);\n    advanceSurvival(synced.state, ctx.config.promotionThreshold);\n    return { ...io, state: synced.state };\n  },\n};\n\nconst pruneNode: PipelineNode = {\n  name: \"prune\",\n  run(io) {\n    return { ...io, messages: prune(io.messages, io.state) };\n  },\n};\n\nconst filterNode: PipelineNode = {\n  name: \"filter\",\n  enabled: (_io, ctx) =>\n    !!ctx.config.messageFilters?.enabled && listMessageFilters().length > 0,\n  run(io, ctx) {\n    const applied = applyMessageFilters(io.messages, ctx.config.messageFilters);\n    return { ...io, messages: applied.messages };\n  },\n};\n\nconst hideCompressCallsNode: PipelineNode = {\n  name: \"hide-compress-calls\",\n  run(io) {\n    const hidden = hideConsumedCompressCalls(io.state, io.messages);\n    return { ...io, messages: hidden.messages };\n  },\n};\n\nconst recommendNode: PipelineNode = {\n  name: \"recommend\",\n  run(io, ctx) {\n    const protectedRefs = computeProtectedRefs(\n      io.messages,\n      io.state,\n      ctx.config,\n      ctx.countTokens,\n    );\n    const contextRanges = buildCompressibleRanges(\n      io.messages,\n      io.state,\n      ctx.config,\n      protectedRefs,\n      ctx.countTokens,\n    );\n    const nothingToCompress = contextRanges.compressible.length === 0;\n    const recommendation: Recommendation = {\n      contextRanges,\n      recommendedRanges: mergeRangesToThreshold(\n        contextRanges.compressible,\n        ctx.config.compress.minCompressRange,\n      ),\n      nothingToCompress,\n    };\n    return { ...io, effects: { ...io.effects, recommendation } };\n  },\n};\n\nconst nudgeNode: PipelineNode = {\n  name: \"nudge-inject\",\n  run(io, ctx) {\n    const nudge = decideNudge({\n      tokenCount: ctx.tokenCount,\n      config: ctx.config,\n      state: io.state,\n      messages: io.messages,\n      recommendation: io.effects.recommendation,\n      countTokens: ctx.countTokens,\n    });\n\n    const baseline = io.state.nudge.lastPerMessageNudgeTokens;\n    const nudgeGrowthTokens = resolveAdaptiveGrowth(\n      ctx.config.modelContextLimit,\n      ctx.config.nudge,\n    );\n\n    let stamped = { ...io.state.nudge };\n\n    if (baseline > 0 && ctx.tokenCount < baseline - nudgeGrowthTokens) {\n      stamped.lastPerMessageNudgeTokens = ctx.tokenCount;\n      stamped.lastNudgeShownTokens = 0;\n      // The context shrank dramatically — host compaction, or a tokenCount\n      // scale switch (an adapter moving from session-tree accounting to\n      // sent-view estimation). Per-tier cadence stamps recorded at the old\n      // scale would otherwise make `tokenCount - lastShownByTier[t] >=\n      // growthFloor` unreachable (a stamp above the window never re-arms),\n      // suppressing mid-band nudges until the absolute overLimit band fires.\n      // Restart tier cadence from the new baseline, mirroring the full stamp\n      // reset a successful applyCompression performs.\n      stamped.lastShownByTier = {};\n    }\n\n    if (stamped.lastPerMessageNudgeTokens === 0) {\n      stamped.lastPerMessageNudgeTokens = ctx.tokenCount;\n    }\n\n    if (nudge.shouldInject) {\n      stamped.lastNudgeShownTokens = ctx.tokenCount;\n      // Record the injected tier's own cadence baseline. Shared baseline\n      // (lastNudgeShownTokens) suppresses lower-priority tiers within this\n      // turn; the per-tier entry throttles re-firing of the SAME tier.\n      if (nudge.tier !== null) {\n        stamped.lastShownByTier = {\n          ...stamped.lastShownByTier,\n          [nudge.tier]: ctx.tokenCount,\n        };\n      }\n    }\n\n    return {\n      ...io,\n      state: { ...io.state, nudge: stamped },\n      effects: { ...io.effects, nudge },\n    };\n  },\n};\n\nconst emergencyTruncateNode: PipelineNode = {\n  name: \"emergency-truncate\",\n  run(io, ctx) {\n    const usage =\n      ctx.config.modelContextLimit > 0\n        ? ctx.tokenCount / ctx.config.modelContextLimit\n        : 0;\n    if (usage < ctx.config.truncate.threshold) return io;\n    const trunc = truncateLargeToolOutputs(\n      io.messages,\n      ctx.tokenCount,\n      ctx.config,\n      ctx.countTokens,\n      { protectRecentMessages: ctx.config.preserveRecentMessages },\n    );\n    return {\n      ...io,\n      messages: trunc.messages,\n      effects: { ...io.effects, truncatedCount: trunc.truncatedCount },\n    };\n  },\n};\n\ninterface SingleRangeInput {\n  spec: {\n    startRef: string;\n    endRef: string;\n    summary: string;\n    topic?: string;\n    compressCallId?: string;\n    summaryMaxChars?: number;\n  };\n  messages: CoreMessage[];\n  state: CompressionState;\n  runId: string;\n  config: Config;\n  protectedMessageIds?: Set<string>;\n  countTokens: (text: string) => number;\n  preExistingCoverage: Set<string>;\n}\n\ninterface SingleRangeOutcome {\n  tokens: number;\n  warnings: string[];\n}\n\nfunction applySingleRange(input: SingleRangeInput): SingleRangeOutcome {\n  const warnings: string[] = [];\n  const resolved = resolveBoundaries({\n    startRef: input.spec.startRef,\n    endRef: input.spec.endRef,\n    messages: input.messages,\n    state: input.state,\n  });\n\n  const rangeMessageIds = applyPairBoundaryAdjustments(\n    resolved,\n    input.messages,\n  ).filter((id) => !isSummaryMessageId(id));\n\n  // Re-scan for nested blocks in the ADJUSTED range (tool-pair extension may\n  // have pulled in messages that are anchors of existing blocks).\n  if (rangeMessageIds.length > resolved.messageIds.length) {\n    const indexByMessageId = new Map<string, number>();\n    input.messages.forEach((m, i) => indexByMessageId.set(m.id, i));\n    const adjustedStart =\n      rangeMessageIds.length > 0\n        ? (indexByMessageId.get(rangeMessageIds[0]!) ?? resolved.startIndex)\n        : resolved.startIndex;\n    const adjustedEnd =\n      rangeMessageIds.length > 0\n        ? (indexByMessageId.get(rangeMessageIds[rangeMessageIds.length - 1]!) ??\n          resolved.endIndex)\n        : resolved.endIndex;\n    const nestedSeen = new Set(resolved.nestedBlockIds);\n    for (const block of activeBlocks(input.state)) {\n      if (nestedSeen.has(block.blockId)) continue;\n      if (\n        blockVisibleInRange(block, indexByMessageId, adjustedStart, adjustedEnd)\n      ) {\n        nestedSeen.add(block.blockId);\n        resolved.nestedBlockIds.push(block.blockId);\n      }\n    }\n  }\n\n  const isBlockBoundary = resolved.boundaryKind === \"block\";\n  const targetTier = resolveTargetTier(\n    input.state,\n    resolved.nestedBlockIds,\n    isBlockBoundary,\n  );\n  const outputTier = isBlockBoundary\n    ? (Math.min(3, targetTier + 1) as CompressionTier)\n    : 1;\n\n  const consumedBlockIds = resolved.nestedBlockIds.filter((id) => {\n    const block = blockById(input.state, id);\n    return block?.active && block.tier === targetTier;\n  });\n\n  const effectiveMessageIds = new Set<string>(rangeMessageIds);\n  for (const consumedId of consumedBlockIds) {\n    const consumed = blockById(input.state, consumedId);\n    if (consumed) {\n      for (const id of consumed.effectiveMessageIds)\n        effectiveMessageIds.add(id);\n    }\n  }\n\n  const directMessageIds = [...effectiveMessageIds].filter(\n    (id) => !input.preExistingCoverage.has(id),\n  );\n\n  let filteredIds = filterProtectedToolMessages(\n    directMessageIds,\n    input.messages,\n    input.config,\n  );\n\n  // filterProtectedToolMessages drops protected tool calls (and their paired\n  // results) from the compressible set. They must also leave effectiveMessageIds,\n  // otherwise the block would record them as covered and hide them from view.\n  // (Bug 39: protected tool messages folded into a block.)\n  if (filteredIds.length < directMessageIds.length) {\n    const kept = new Set(filteredIds);\n    for (const id of directMessageIds) {\n      if (!kept.has(id)) effectiveMessageIds.delete(id);\n    }\n  }\n\n  // SOFT PROTECTION: the recent-N / last-user-message zone is advisory-only at\n  // compress time. Instead of failing the whole range when it brushes protected\n  // messages, exclude those messages and proceed with the rest (so the model\n  // isn't blocked when it picks a range that slightly overlaps the recent\n  // window). If excluding them empties the range entirely AND there are no\n  // consumed blocks to merge, we still fail — there is genuinely nothing to\n  // compress. `protectedMessageIds` holds REF ids (mNNNNN) from\n  // computeProtectedRefs; filteredIds holds RAW message ids, so convert via\n  // state.messageRefs.byRaw before testing membership.\n  const protectedRefs = input.protectedMessageIds;\n  const hitProtectedRaw = protectedRefs\n    ? filteredIds.filter((id) => {\n        const ref = input.state.messageRefs.byRaw[id];\n        return ref !== undefined && protectedRefs.has(ref);\n      })\n    : [];\n  if (hitProtectedRaw.length > 0) {\n    const protectedSet = new Set(hitProtectedRaw);\n    filteredIds = filteredIds.filter((id) => !protectedSet.has(id));\n    // Remove protected messages from effective coverage too, so they are NOT\n    // hidden by the new block (they must stay fully visible).\n    for (const id of hitProtectedRaw) effectiveMessageIds.delete(id);\n\n    const hitRefs = hitProtectedRaw\n      .map((id) => input.state.messageRefs.byRaw[id])\n      .filter((v): v is string => typeof v === \"string\");\n\n    if (filteredIds.length === 0 && consumedBlockIds.length === 0) {\n      const recentN = input.config.preserveRecentMessages;\n      throw new Error(\n        `Range is entirely within the protected zone (the last ${recentN} messages and/or the most recent user message): ${hitRefs.join(\n          \", \",\n        )}. Adjust startId/endId to older messages.`,\n      );\n    }\n    warnings.push(\n      `Excluded ${hitProtectedRaw.length} protected message(s) ${hitRefs.join(\n        \", \",\n      )} from compression range (recent/last-user zone).`,\n    );\n  }\n\n  validateCompressionRange(input, filteredIds, consumedBlockIds.length);\n\n  let compressedTokens = 0;\n  for (const id of filteredIds) {\n    const message = input.messages.find((entry) => entry.id === id);\n    compressedTokens += input.countTokens(message?.text ?? \"\");\n  }\n  for (const consumedId of consumedBlockIds) {\n    const consumed = blockById(input.state, consumedId);\n    if (consumed) {\n      compressedTokens += input.countTokens(consumed.summary);\n    }\n  }\n\n  const blockId = allocateBlockId(input.state);\n  const block: CompressionBlock = {\n    blockId,\n    runId: input.runId,\n    tier: outputTier,\n    topic: input.spec.topic,\n    summary: input.spec.summary,\n    directMessageIds: filteredIds,\n    effectiveMessageIds: [...effectiveMessageIds],\n    directBlockIds: [...consumedBlockIds],\n    compressedTokens,\n    createdAt: Date.now(),\n    survivedCount: 0,\n    generation: \"young\",\n    active: true,\n    compressCallId: input.spec.compressCallId,\n    startRef: input.spec.startRef,\n    endRef: input.spec.endRef,\n  };\n  input.state.blocks.push(block);\n\n  for (const consumedId of consumedBlockIds) {\n    const consumed = blockById(input.state, consumedId);\n    if (consumed) consumed.active = false;\n  }\n\n  return { tokens: compressedTokens, warnings };\n}\n\nfunction applyPairBoundaryAdjustments(\n  resolved: {\n    startIndex: number;\n    endIndex: number;\n    messageIds: string[];\n    boundaryKind: string;\n  },\n  messages: CoreMessage[],\n): string[] {\n  if (resolved.boundaryKind === \"block\") {\n    return resolved.messageIds;\n  }\n  // Compose tool-pair and reasoning-pair boundary adjustments to a fixpoint\n  // (≤2 passes). Reasoning may pull in a tool-call whose result tool-pairs\n  // then extends for; tool-pairs may pull in a tool-call whose preceding\n  // reasoning is then drawn in. Both only ever WIDEN the range.\n  let startIndex = resolved.startIndex;\n  let endIndex = resolved.endIndex;\n  for (let pass = 0; pass < 2; pass++) {\n    const reasoningAdjusted = adjustBoundariesForReasoningPairs(\n      startIndex,\n      endIndex,\n      messages,\n    );\n    const toolAdjusted = adjustBoundariesForToolPairs(\n      reasoningAdjusted.startIndex,\n      reasoningAdjusted.endIndex,\n      messages,\n    );\n    const changed =\n      toolAdjusted.startIndex !== startIndex ||\n      toolAdjusted.endIndex !== endIndex;\n    startIndex = toolAdjusted.startIndex;\n    endIndex = toolAdjusted.endIndex;\n    if (!changed) break;\n  }\n  if (startIndex === resolved.startIndex && endIndex === resolved.endIndex) {\n    return resolved.messageIds;\n  }\n  const ids: string[] = [];\n  for (let i = startIndex; i <= endIndex; i++) {\n    const msg = messages[i];\n    if (msg) ids.push(msg.id);\n  }\n  return ids;\n}\n\nfunction validateCompressionRange(\n  input: SingleRangeInput,\n  directMessageIds: string[],\n  consumedBlockCount: number,\n): void {\n  const cfg = input.config.compress;\n  const summary = input.spec.summary?.trim() ?? \"\";\n\n  if (summary.length === 0) {\n    throw new Error(\n      \"Summary is empty — provide a meaningful summary of the compressed range.\",\n    );\n  }\n\n  if (cfg.minSummaryLength > 0 && summary.length < cfg.minSummaryLength) {\n    throw new Error(\n      `Summary too short (${summary.length} chars, min ${cfg.minSummaryLength}). The summary must capture the compressed range's key information.`,\n    );\n  }\n\n  const effectiveMax = input.spec.summaryMaxChars ?? cfg.maxSummaryLength;\n  if (effectiveMax > 0 && summary.length > effectiveMax) {\n    throw new Error(\n      `Summary too long (${summary.length} chars, max ${effectiveMax}). Strip noise — keep critical paths, decisions, errors, and code references. Or pass summaryMaxChars to increase the limit — don't lose critical info just to fit.`,\n    );\n  }\n\n  if (directMessageIds.length === 0 && consumedBlockCount === 0) {\n    throw new Error(\n      \"Range contains no compressible messages — all are already covered by active blocks or protected.\",\n    );\n  }\n}\n\nfunction filterProtectedToolMessages(\n  directMessageIds: string[],\n  messages: CoreMessage[],\n  config: Config,\n): string[] {\n  // Protected tool calls (and their results, paired by toolCallId) stay in\n  // visible context and are simply dropped from the compressible set. They are\n  // NOT folded into the summary — the summary reflects what the author wrote,\n  // nothing auto-appended.\n  const protectedCallIds = new Set<string>();\n  const removedIds = new Set<string>();\n  for (const msg of messages) {\n    if (isMessageProtected(msg, config) && msg.toolCallId) {\n      protectedCallIds.add(msg.toolCallId);\n    }\n  }\n\n  for (const id of directMessageIds) {\n    const msg = messages.find((m) => m.id === id);\n    if (!msg) continue;\n    if (isMessageProtected(msg, config)) {\n      removedIds.add(id);\n      if (msg.toolCallId) protectedCallIds.add(msg.toolCallId);\n    }\n  }\n\n  for (const id of directMessageIds) {\n    if (removedIds.has(id)) continue;\n    const msg = messages.find((m) => m.id === id);\n    if (!msg) continue;\n    if (\n      msg.contentType === \"tool-result\" &&\n      msg.toolCallId &&\n      protectedCallIds.has(msg.toolCallId)\n    ) {\n      removedIds.add(id);\n    }\n  }\n\n  return directMessageIds.filter((id) => !removedIds.has(id));\n}\n\nfunction resolveTargetTier(\n  state: CompressionState,\n  nestedBlockIds: string[],\n  isBlockBoundary: boolean,\n): CompressionTier {\n  if (!isBlockBoundary) return 1;\n  if (nestedBlockIds.length === 0) return 1;\n  let minTier: CompressionTier = 3;\n  for (const id of nestedBlockIds) {\n    const block = blockById(state, id);\n    if (block && block.tier < minTier) minTier = block.tier;\n  }\n  return minTier;\n}\n\nfunction collectCoverage(state: CompressionState): Set<string> {\n  const coverage = new Set<string>();\n  for (const block of activeBlocks(state)) {\n    for (const id of block.effectiveMessageIds) coverage.add(id);\n  }\n  return coverage;\n}\n\ninterface NudgeInput {\n  tokenCount: number;\n  config: Config;\n  state: CompressionState;\n  messages: CoreMessage[];\n  recommendation?: Recommendation;\n  countTokens: (t: string) => number;\n}\n\nfunction resolveAdaptiveGrowth(\n  modelContextLimit: number,\n  nudge: NudgeConfig,\n): number {\n  if (!modelContextLimit || modelContextLimit <= 0) return nudge.growthFloor;\n  return Math.min(\n    nudge.growthCap,\n    Math.max(\n      nudge.growthFloor,\n      Math.round(modelContextLimit * nudge.growthRatio),\n    ),\n  );\n}\n\n/** Compressible amount for each tier. T1 = EFFECTIVE merged-range tokens —\n *  only ranges whose real char count >= minCompressRange count (avoids\n *  inflation from fragmentation; matches the apply-side gate, which counts\n *  raw `msg.text.length`, so a nudge never offers a range the kernel would\n *  atomically reject — see CompressibleRange.chars); T2 = total summary\n *  tokens of all active tier-1 blocks; T3 = total summary tokens of all\n *  active tier-2 blocks. */\nfunction pendingByTier(\n  state: CompressionState,\n  recommendation: Recommendation | undefined,\n  countTokens: (t: string) => number,\n  minCompressRange: number,\n): Record<number, { pending: number; targetBlocks: CompressionBlock[] }> {\n  const out: Record<\n    number,\n    { pending: number; targetBlocks: CompressionBlock[] }\n  > = {};\n  const merged = recommendation?.recommendedRanges ?? [];\n  const effective =\n    minCompressRange > 0\n      ? merged.filter((r) => (r.chars ?? r.tokens * 4) >= minCompressRange)\n      : merged;\n  out[1] = {\n    pending: effective.reduce((s, r) => s + r.tokens, 0),\n    targetBlocks: [],\n  };\n  const active = activeBlocks(state);\n  const t1 = active.filter((b) => b.tier === 1);\n  const t2 = active.filter((b) => b.tier === 2);\n  out[2] = {\n    pending: t1.reduce((s, b) => s + countTokens(b.summary), 0),\n    targetBlocks: t1,\n  };\n  out[3] = {\n    pending: t2.reduce((s, b) => s + countTokens(b.summary), 0),\n    targetBlocks: t2,\n  };\n  return out;\n}\n\nfunction decideNudge(input: NudgeInput): NudgeDecision {\n  const { config, state, tokenCount, recommendation, countTokens } = input;\n  const limit = config.modelContextLimit;\n  const usage = limit > 0 ? tokenCount / limit : 0;\n\n  const nudgeGrowthTokens = resolveAdaptiveGrowth(limit, config.nudge);\n\n  const overLimit = usage >= config.nudge.maxContextLimitPct;\n  const emergencyOverride = usage >= config.nudge.emergencyThresholdPct;\n  // High-pressure band: over maxContextLimitPct (subsumes the emergency\n  // threshold). Bypasses growth gate + cadence; gated on effective pending.\n  const pressure = overLimit || emergencyOverride;\n\n  const baseline = state.nudge.lastPerMessageNudgeTokens;\n  const hadPendingNudge = state.nudge.lastNudgeShownTokens > 0;\n\n  const hasPendingNudge = hadPendingNudge;\n  const effectiveThreshold = hasPendingNudge\n    ? Math.floor(nudgeGrowthTokens / 2)\n    : nudgeGrowthTokens;\n\n  const growthReference =\n    state.nudge.lastNudgeShownTokens > 0\n      ? state.nudge.lastNudgeShownTokens\n      : baseline > 0\n        ? baseline\n        : tokenCount;\n\n  const growthFloor = Math.max(\n    config.nudge.minGrowthFloor,\n    config.nudge.minGrowthRatio * nudgeGrowthTokens,\n  );\n\n  const growthSinceReference = tokenCount - growthReference;\n\n  const rec = recommendation;\n  const tiers = pendingByTier(\n    state,\n    rec,\n    countTokens,\n    config.compress.minCompressRange,\n  );\n\n  // Tier arbitration. Emergency (usage >= emergencyThresholdPct) ignores tier\n  // priority and picks the tier with the MAX pending. Non-emergency defaults to\n  // T1; T2 and T3 override when each crossed the shared 1.5x threshold AND\n  // exceeds the effective pending of every lower tier (T2 > T1 effective;\n  // T3 > T2 and > T1 effective).\n  const tier2Threshold = Math.round(\n    nudgeGrowthTokens * (config.nudge.tier2GrowthMultiplier ?? 1.5),\n  );\n  let injectedTier: CompressionTier | null = null;\n  let injectedReason = \"\";\n  const growthReady = growthSinceReference >= growthFloor;\n  const t1Eff = tiers[1]?.pending ?? 0;\n  const t2Pen = tiers[2]?.pending ?? 0;\n  const t3Pen = tiers[3]?.pending ?? 0;\n\n  if (pressure) {\n    // High pressure: pick the tier with the MAX pending so pressure can route\n    // to distillation when that reclaims the most tokens. Gated on effective\n    // pending (real chars >= minCompressRange for T1) so we never offer ranges\n    // the kernel would atomically reject. emergency vs over-limit only\n    // changes the reason label/voice; truncate.threshold remains the\n    // independent last resort when there is genuinely nothing to compress.\n    const candidates: CompressionTier[] = [1];\n    if (config.tiers.enabled) {\n      candidates.push(2, 3);\n    }\n    let best: CompressionTier | null = null;\n    let bestPending = 0;\n    for (const t of candidates) {\n      const p = tiers[t]?.pending ?? 0;\n      if (p > bestPending) {\n        bestPending = p;\n        best = t;\n      }\n    }\n    if (best !== null && bestPending > 0) {\n      injectedTier = best;\n      const label = emergencyOverride ? \"EMERGENCY\" : \"OVER-LIMIT\";\n      injectedReason =\n        best === 1\n          ? `${label} T1: max effective pending ${bestPending}, usage ${Math.round(usage * 100)}%`\n          : `${label} T${best} distill: max pending ${bestPending} (T1 effective ${t1Eff}, T2 ${t2Pen}, T3 ${t3Pen}), usage ${Math.round(usage * 100)}%`;\n    }\n  } else if (growthReady) {\n    if (t1Eff >= nudgeGrowthTokens) {\n      injectedTier = 1;\n      injectedReason = `T1 effective ${t1Eff} >= ${nudgeGrowthTokens}, growth ${growthSinceReference}, usage ${Math.round(usage * 100)}%`;\n    } else if (\n      config.tiers.enabled &&\n      t2Pen >= tier2Threshold &&\n      t2Pen > t1Eff\n    ) {\n      const lastShown = state.nudge.lastShownByTier[2] ?? 0;\n      const cadenceMet =\n        lastShown === 0 || tokenCount - lastShown >= growthFloor;\n      if (cadenceMet) {\n        injectedTier = 2;\n        injectedReason = `T2 distill ready: ${tiers[2]!.targetBlocks.length} tier-1 blocks (${t2Pen} tokens) >= ${tier2Threshold} (1.5x) and > T1 effective ${t1Eff}, usage ${Math.round(usage * 100)}%`;\n      }\n    } else if (\n      config.tiers.enabled &&\n      t3Pen >= tier2Threshold &&\n      t3Pen > t2Pen &&\n      t3Pen > t1Eff\n    ) {\n      const lastShown = state.nudge.lastShownByTier[3] ?? 0;\n      const cadenceMet =\n        lastShown === 0 || tokenCount - lastShown >= growthFloor;\n      if (cadenceMet) {\n        injectedTier = 3;\n        injectedReason = `T3 condense ready: ${tiers[3]!.targetBlocks.length} tier-2 blocks (${t3Pen} tokens) >= ${tier2Threshold} (1.5x) and > T2 ${t2Pen} and > T1 effective ${t1Eff}, usage ${Math.round(usage * 100)}%`;\n      }\n    }\n  }\n\n  const shouldInject = injectedTier !== null;\n\n  let reason: string;\n  if (injectedTier !== null) {\n    reason = injectedReason;\n  } else if (pressure) {\n    const label = emergencyOverride ? \"EMERGENCY\" : \"OVER-LIMIT\";\n    reason = `${label}: usage ${Math.round(usage * 100)}% but no tier has effective compressible content (T1 effective ${t1Eff}, T2 ${t2Pen}, T3 ${t3Pen}) — nudge suppressed to avoid offering ranges below minCompressRange`;\n  } else {\n    const tiersList = [1, 2, 3] as const;\n    const eligible = tiersList.filter((t) => config.tiers.enabled || t === 1);\n    const ready = eligible\n      .filter((t) => (tiers[t]?.pending ?? 0) >= nudgeGrowthTokens)\n      .map((t) => `T${t} ${tiers[t]!.pending}`);\n    const readyHint = ready.length > 0 ? `, ready: ${ready.join(\", \")}` : \"\";\n    const blocked = eligible\n      .filter(\n        (t) =>\n          (tiers[t]?.pending ?? 0) >= nudgeGrowthTokens &&\n          (state.nudge.lastShownByTier[t] ?? 0) > 0 &&\n          tokenCount - (state.nudge.lastShownByTier[t] ?? 0) < growthFloor,\n      )\n      .map((t) => `T${t} (cadence)`);\n    const blockedHint =\n      blocked.length > 0 ? `, blocked: ${blocked.join(\", \")}` : \"\";\n    const maxPending = Math.max(\n      0,\n      ...Object.values(tiers).map((t) => t.pending),\n    );\n    // Report the ACTUAL blocking condition, not a fixed template. A session\n    // can have plenty to compress (pending >= threshold) but still not\n    // inject because growth/floor/cadence isn't met — the old fixed\n    // \"< threshold\" string lied in that case.\n    const pendingShort = maxPending < nudgeGrowthTokens;\n    const growthShort = growthSinceReference < growthFloor;\n    const parts: string[] = [];\n    if (pendingShort)\n      parts.push(\n        `max compressible ${maxPending} < threshold ${nudgeGrowthTokens}`,\n      );\n    if (growthShort)\n      parts.push(`growth ${growthSinceReference} < floor ${growthFloor}`);\n    if (parts.length === 0)\n      parts.push(\n        `max compressible ${maxPending}, growth ${growthSinceReference}`,\n      );\n    reason = `${parts.join(\"; \")}${readyHint}${blockedHint}`;\n  }\n\n  const ctxBreakdown = computeContextBreakdown(\n    input.messages,\n    tokenCount,\n    growthSinceReference,\n    countTokens,\n  );\n\n  return {\n    shouldInject,\n    reason,\n    compressibleRanges: rec?.recommendedRanges ?? [],\n    protectedRanges: rec?.contextRanges.protected ?? [],\n    tierTargetBlocks: injectedTier ? tiers[injectedTier]!.targetBlocks : [],\n    contextUsage: usage,\n    tier: injectedTier,\n    breakdown: {\n      usage,\n      growth: growthSinceReference,\n      growthReference,\n      effectiveThreshold,\n      nudgeGrowthTokens,\n      growthFloor,\n      hasPendingNudge: hasPendingNudge ? 1 : 0,\n      overLimit: overLimit ? 1 : 0,\n      emergencyOverride: emergencyOverride ? 1 : 0,\n      pendingT1: tiers[1]!.pending,\n      pendingT2: tiers[2]!.pending,\n      pendingT3: tiers[3]!.pending,\n    },\n    contextBreakdown: ctxBreakdown,\n  };\n}\n\nfunction computeContextBreakdown(\n  messages: CoreMessage[],\n  total: number,\n  growth: number,\n  countTokens: (t: string) => number,\n): ContextBreakdown {\n  const count = countTokens ?? ((t: string) => Math.ceil(t.length / 4));\n  let system = 0,\n    tool = 0,\n    summaries = 0,\n    code = 0,\n    text = 0;\n  for (const msg of messages) {\n    const tokens = count(msg.text ?? \"\");\n    if (msg.text?.startsWith(\"[Compressed conversation section]\")) {\n      summaries += tokens;\n    } else if (\n      msg.contentType === \"tool-call\" ||\n      msg.contentType === \"tool-result\"\n    ) {\n      tool += tokens;\n    } else if (msg.role === \"system\") {\n      system += tokens;\n    } else if (msg.text?.includes(\"```\")) {\n      code += tokens;\n    } else {\n      text += tokens;\n    }\n  }\n  return { system, tool, summaries, code, text, total, growth };\n}\n\nfunction cloneState(state: CompressionState): CompressionState {\n  return {\n    blocks: state.blocks.map((block) => ({\n      ...block,\n      directMessageIds: [...block.directMessageIds],\n      effectiveMessageIds: [...block.effectiveMessageIds],\n      directBlockIds: [...block.directBlockIds],\n    })),\n    messageRefs: {\n      byRaw: { ...state.messageRefs.byRaw },\n      byRef: { ...state.messageRefs.byRef },\n    },\n    tokenSnapshot: { ...(state.tokenSnapshot ?? {}) },\n    nudge: { ...state.nudge, anchors: { ...state.nudge.anchors } },\n    stats: { ...state.stats },\n    nextBlockId: state.nextBlockId,\n    nextRunId: state.nextRunId,\n  };\n}\n\nfunction scoreRelevance(block: CompressionBlock, terms: string[]): number {\n  const topic = (block.topic ?? \"\").toLowerCase();\n  const summary = block.summary.toLowerCase();\n  let score = 0;\n  for (const term of terms) {\n    const topicHits = countOccurrences(topic, term);\n    if (topicHits > 0) score += Math.min(topicHits * 0.15, 0.45);\n    const summaryHits = countOccurrences(summary, term);\n    if (summaryHits > 0) score += Math.min(summaryHits * 0.04, 0.2);\n  }\n  return Math.min(score, 1);\n}\n\nfunction countOccurrences(haystack: string, needle: string): number {\n  if (!haystack || !needle) return 0;\n  let count = 0;\n  let position = 0;\n  while ((position = haystack.indexOf(needle, position)) !== -1) {\n    count++;\n    position += needle.length;\n  }\n  return count;\n}\n\nexport { createInitialState };\n","import { SUMMARY_HEADER } from \"./prune.js\";\nimport type { CompressionBlock, CompressionState, CoreMessage } from \"./types.js\";\n\nexport function parseBlockIdArg(arg: string): string | null {\n    const normalized = arg.trim().toLowerCase();\n    const refMatch = /^b0*(\\d+)$/.exec(normalized);\n    if (refMatch && refMatch[1] !== undefined) return `b${refMatch[1]}`;\n    const numMatch = /^(\\d+)$/.exec(normalized);\n    if (numMatch && numMatch[1] !== undefined) return `b${numMatch[1]}`;\n    return null;\n}\n\nexport function findBlocksOverlappingMessages(\n    state: CompressionState,\n    messageIds: Set<string>,\n): CompressionBlock[] {\n    if (messageIds.size === 0) return [];\n    const matched: CompressionBlock[] = [];\n    for (const block of state.blocks) {\n        if (!block.active) continue;\n        if (block.effectiveMessageIds.some((id) => messageIds.has(id))) {\n            matched.push(block);\n        }\n    }\n    return matched.sort((a, b) => numericPart(a.blockId) - numericPart(b.blockId));\n}\n\nexport function findActiveAncestor(state: CompressionState, blockId: string): string | null {\n    const start = state.blocks.find((b) => b.blockId === blockId);\n    if (!start) return null;\n    const queue: string[] = [...start.directBlockIds];\n    const visited = new Set<string>();\n    while (queue.length > 0) {\n        const currentId = queue.shift()!;\n        if (visited.has(currentId)) continue;\n        visited.add(currentId);\n        const current = state.blocks.find((b) => b.blockId === currentId);\n        if (!current) continue;\n        if (current.active) return current.blockId;\n        for (const ancestorId of current.directBlockIds) {\n            if (!visited.has(ancestorId)) queue.push(ancestorId);\n        }\n    }\n    return null;\n}\n\nexport interface DeactivateOptions {\n    deep?: boolean;\n}\n\nexport function deactivateBlock(\n    state: CompressionState,\n    blockIds: string[],\n    options: DeactivateOptions = {},\n): CompressionState {\n    const targets = new Set(blockIds);\n\n    const updated = state.blocks.map((block) => {\n        if (!targets.has(block.blockId) || !block.active) return block;\n        return {\n            ...block,\n            active: false,\n            durationMs: block.durationMs,\n            createdAt: block.createdAt,\n        };\n    });\n\n    let final = updated;\n    if (options.deep) {\n        const visited = new Set<string>();\n        const queue: string[] = [];\n        for (const id of blockIds) {\n            const block = updated.find((b) => b.blockId === id);\n            if (block) queue.push(...block.directBlockIds);\n        }\n        while (queue.length > 0) {\n            const id = queue.shift()!;\n            if (visited.has(id)) continue;\n            visited.add(id);\n            final = final.map((block) => {\n                if (block.blockId !== id) return block;\n                queue.push(...block.directBlockIds);\n                return block.active ? { ...block, active: false } : block;\n            });\n        }\n    }\n\n    return { ...state, blocks: final };\n}\n\nexport interface RestoredPreviewResult {\n    preview: string;\n    restoredCount: number;\n}\n\nexport function buildRestoredContentPreview(\n    messages: CoreMessage[],\n    beforeActiveMessageIds: Set<string>,\n    state: CompressionState,\n): RestoredPreviewResult {\n    const restored: CoreMessage[] = [];\n    for (const message of messages) {\n        if (!beforeActiveMessageIds.has(message.id)) continue;\n        const stillCovered = state.blocks.some(\n            (b) => b.active && b.effectiveMessageIds.includes(message.id),\n        );\n        if (!stillCovered) restored.push(message);\n    }\n\n    if (restored.length === 0) return { preview: \"\", restoredCount: 0 };\n\n    const lines: string[] = [];\n    let totalLength = 0;\n    const MAX_PREVIEW = 2000;\n    const MAX_PER_MESSAGE = 200;\n\n    for (const message of restored) {\n        if (totalLength >= MAX_PREVIEW) break;\n        const text = message.text ?? \"\";\n        const truncated = text.length > MAX_PER_MESSAGE ? text.slice(0, MAX_PER_MESSAGE) + \"...\" : text;\n        const label =\n            message.toolName && message.contentType !== \"text\"\n                ? `${message.toolName}: ${truncated}`\n                : `[${message.role}] ${truncated}`;\n        lines.push(label);\n        totalLength += label.length + 1;\n    }\n\n    return { preview: lines.join(\"\\n\"), restoredCount: restored.length };\n}\n\nexport interface CollectedContentResult {\n    /** Rendered, human-readable content string (empty when count is 0). */\n    text: string;\n    /** Number of items rendered: direct messages + nested summaries (full=false) or all messages (full=true). */\n    count: number;\n}\n\nexport interface CollectContentOptions {\n    /** When true, recurse through all nested tiers to original messages. Default: false (one tier up — nested active children stay folded, their summaries shown). */\n    full?: boolean;\n}\n\n/**\n * Collect a block's content as a readable string WITHOUT modifying state.\n *\n * This is the cache-safe decompress primitive: the block stays compressed\n * (folded), its summary stays in place, and the full content is returned as\n * text for the caller to surface (e.g. as a tool result appended to the\n * conversation). Unlike deactivateBlock + prune, this does not mutate the\n * message-array prefix, so prompt cache is preserved.\n *\n * full=false (default): one tier up. Nested ACTIVE children of this block\n *   stay folded; their summaries are rendered in place of their messages.\n *   The block's own direct messages (not covered by any active child) are\n *   rendered in full.\n * full=true: recurse through all nested tiers; every effective message is\n *   rendered in full.\n *\n * Returns { text: \"\", count: 0 } when the block covers no messages.\n */\nexport function collectBlockContent(\n    state: CompressionState,\n    block: CompressionBlock,\n    messages: CoreMessage[],\n    options: CollectContentOptions = {},\n): CollectedContentResult {\n    const full = options.full ?? false;\n    const targetIds = new Set(block.effectiveMessageIds);\n\n    if (full) {\n        const msgs = messages.filter((m) => targetIds.has(m.id));\n        if (msgs.length === 0) return { text: \"\", count: 0 };\n        return { text: msgs.map(formatMessage).join(\"\\n\\n\"), count: msgs.length };\n    }\n\n    // One tier up: messages covered by nested ACTIVE children stay folded\n    // (their summaries shown); the block's own direct messages shown in full.\n    const nestedChildren: CompressionBlock[] = [];\n    const nestedCovered = new Set<string>();\n    for (const childId of block.directBlockIds) {\n        const child = state.blocks.find((b) => b.blockId === childId);\n        if (!child?.active) continue;\n        nestedChildren.push(child);\n        for (const id of child.effectiveMessageIds) nestedCovered.add(id);\n    }\n\n    const parts: string[] = [];\n    for (const child of nestedChildren) {\n        const label = child.topic ? `${child.blockId}: ${child.topic}` : child.blockId;\n        parts.push(`${SUMMARY_HEADER} — ${label}\\n${child.summary}`);\n    }\n\n    let directCount = 0;\n    for (const m of messages) {\n        if (targetIds.has(m.id) && !nestedCovered.has(m.id)) {\n            parts.push(formatMessage(m));\n            directCount++;\n        }\n    }\n\n    const count = directCount + nestedChildren.length;\n    if (count === 0) return { text: \"\", count: 0 };\n    return { text: parts.join(\"\\n\\n\"), count };\n}\n\nfunction formatMessage(message: CoreMessage): string {\n    const text = message.text ?? \"\";\n    if (message.toolName && message.contentType !== \"text\") {\n        return `[${message.role} • ${message.toolName}]\\n${text}`;\n    }\n    return `[${message.role}]\\n${text}`;\n}\n\nfunction numericPart(blockId: string): number {\n    const match = /^b(\\d+)$/.exec(blockId);\n    return match && match[1] !== undefined ? Number(match[1]) : 0;\n}\n","import { refForRaw } from \"./refs.js\";\nimport type { CompressionBlock, CompressionState, CoreMessage } from \"./types.js\";\n\nfunction formatTokens(n: number): string {\n    if (!Number.isFinite(n) || n <= 0) return \"0\";\n    return n >= 1000 ? `${(n / 1000).toFixed(1)}K` : String(n);\n}\n\nfunction pct(n: number, total: number): number {\n    if (n <= 0 || total <= 0) return 0;\n    return Math.max(1, Math.round((n / total) * 100));\n}\n\nfunction numericPart(blockId: string): number {\n    const match = /^b(\\d+)$/.exec(blockId);\n    return match && match[1] !== undefined ? Number(match[1]) : 0;\n}\n\nfunction summaryTokensOf(block: CompressionBlock, countTokens: (t: string) => number): number {\n    return countTokens(block.summary);\n}\n\nfunction effectiveCompressedTokens(\n    block: CompressionBlock,\n    _state: CompressionState,\n    _countTokens: (t: string) => number,\n): number {\n    // block.compressedTokens already records the full input token count of the\n    // operation that created this block: for a tier-1 block that is the raw\n    // messages; for a tier-2 block it is the tier-1 summaries + the new\n    // messages it spans. Recursing into directBlockIds and summing children's\n    // compressedTokens double-counts the consumed children, so we return the\n    // block's own value directly. (The previous recursion inflated tier-2+\n    // \"original\" figures and mis-ordered the status report.)\n    return block.compressedTokens;\n}\n\nfunction tierLabel(block: CompressionBlock): string {\n    return `T${block.tier}`;\n}\n\nfunction tierBreakdown(\n    blocks: CompressionBlock[],\n    countTokens: (t: string) => number,\n): string | null {\n    const tierTokens: Record<number, number> = {};\n    for (const block of blocks) {\n        tierTokens[block.tier] = (tierTokens[block.tier] ?? 0) + summaryTokensOf(block, countTokens);\n    }\n    const tiers = Object.keys(tierTokens).map(Number);\n    if (tiers.length <= 1) return null;\n    const parts: string[] = [];\n    for (const tier of [1, 2, 3]) {\n        if (tierTokens[tier]) parts.push(`T${tier}: ${formatTokens(tierTokens[tier])}`);\n    }\n    return parts.join(\" | \");\n}\n\ninterface VisibleMessageInfo {\n    ref: string;\n    tokens: number;\n    tool: string;\n    index: number;\n}\n\nfunction collectVisible(\n    messages: CoreMessage[],\n    state: CompressionState,\n    countTokens: (t: string) => number,\n): { visible: VisibleMessageInfo[]; summaryTokens: number } {\n    const coveredIds = new Set<string>();\n    for (const block of state.blocks) {\n        if (!block.active) continue;\n        for (const id of block.effectiveMessageIds) coveredIds.add(id);\n    }\n    let summaryTokens = 0;\n    for (const block of state.blocks) {\n        if (block.active) summaryTokens += summaryTokensOf(block, countTokens);\n    }\n    const visible: VisibleMessageInfo[] = [];\n    messages.forEach((message, index) => {\n        if (coveredIds.has(message.id)) return;\n        const ref = refForRaw(state.messageRefs, message.id);\n        if (!ref) return;\n        const tokens = countTokens(message.text ?? \"\");\n        const tool = message.toolName ?? \"text\";\n        if (tokens > 0) visible.push({ ref, tokens, tool, index });\n    });\n    return { visible, summaryTokens };\n}\n\nexport interface StatusReportOptions {\n    scope?: \"compressed\" | \"uncompressed\";\n    view?: \"ranges\" | \"messages\";\n    tool?: string;\n    sort?: \"size\" | \"time\" | \"tool\" | \"age\";\n    limit?: number;\n}\n\nexport function buildStatusReport(\n    state: CompressionState,\n    messages: CoreMessage[],\n    countTokens: (t: string) => number,\n    options: StatusReportOptions = {},\n): string {\n    const scope = options.scope;\n    const view = options.view ?? \"ranges\";\n    const toolFilter = options.tool;\n    const sort = options.sort ?? \"size\";\n    const limit = options.limit ?? 30;\n\n    const activeBlocks = state.blocks\n        .filter((b) => b.active)\n        .sort((a, b) => numericPart(a.blockId) - numericPart(b.blockId));\n\n    if (scope === \"compressed\") {\n        return renderCompressedDrilldown(activeBlocks, state, sort, limit, countTokens);\n    }\n\n    const { visible, summaryTokens } = collectVisible(messages, state, countTokens);\n\n    if (scope === \"uncompressed\") {\n        if (view === \"messages\") {\n            return renderMessageDrilldown(visible, toolFilter, sort, limit);\n        }\n        return renderUncompressedRanges(visible);\n    }\n\n    return renderOverview(visible, summaryTokens, activeBlocks, state, countTokens, limit);\n}\n\nfunction renderOverview(\n    visible: VisibleMessageInfo[],\n    summaryTokens: number,\n    blocks: CompressionBlock[],\n    state: CompressionState,\n    countTokens: (t: string) => number,\n    limit: number,\n): string {\n    const lines: string[] = [];\n    const toolTypeMap = new Map<string, number>();\n    for (const message of visible) {\n        toolTypeMap.set(message.tool, (toolTypeMap.get(message.tool) ?? 0) + message.tokens);\n    }\n    const topTool = [...toolTypeMap.entries()].sort((a, b) => b[1] - a[1])[0]?.[0];\n\n    const totalTool = visible\n        .filter((m) => m.tool !== \"text\")\n        .reduce((sum, m) => sum + m.tokens, 0);\n    const totalText = visible\n        .filter((m) => m.tool === \"text\")\n        .reduce((sum, m) => sum + m.tokens, 0);\n    const total = summaryTokens + totalTool + totalText;\n\n    lines.push(\"CONTEXT BREAKDOWN\");\n    lines.push(\n        `  ${formatTokens(totalTool)} tool (${pct(totalTool, total)}%) | ${formatTokens(totalText)} text (${pct(totalText, total)}%) | ${formatTokens(summaryTokens)} summaries (${pct(summaryTokens, total)}%)`,\n    );\n    const topTypes = [...toolTypeMap.entries()]\n        .sort((a, b) => b[1] - a[1])\n        .slice(0, 3);\n    if (topTypes.length > 0) {\n        lines.push(`  Top tools: ${topTypes.map(([t, n]) => `${t} (${pct(n, total)}%)`).join(\", \")}`);\n    }\n\n    lines.push(\"\");\n    if (blocks.length === 0) {\n        lines.push(\"COMPRESSED BLOCKS\");\n        lines.push(\"  No compressed blocks.\");\n    } else {\n        const totalSummary = blocks.reduce((s, b) => s + summaryTokensOf(b, countTokens), 0);\n        const totalEffective = blocks.reduce(\n            (s, b) => s + effectiveCompressedTokens(b, state, countTokens),\n            0,\n        );\n        lines.push(\n            `COMPRESSED BLOCKS — ${blocks.length} active (${formatTokens(totalSummary)} summary, ${formatTokens(totalEffective)} original)`,\n        );\n        const breakdown = tierBreakdown(blocks, countTokens);\n        if (breakdown) lines.push(`  Tier usage: ${breakdown}`);\n        lines.push(\"\");\n        const sorted = [...blocks].sort(\n            (a, b) =>\n                effectiveCompressedTokens(b, state, countTokens) -\n                    effectiveCompressedTokens(a, state, countTokens) ||\n                b.createdAt - a.createdAt,\n        );\n        for (const block of sorted.slice(0, limit)) {\n            const topic = block.topic ?? \"(no topic)\";\n            const eff = effectiveCompressedTokens(block, state, countTokens);\n            lines.push(\n                `  ${block.blockId} (${tierLabel(block)})  ${formatTokens(eff)}→${formatTokens(summaryTokensOf(block, countTokens))}  ${block.effectiveMessageIds.length} msgs  \"${topic}\"`,\n            );\n        }\n    }\n\n    lines.push(\"\");\n    lines.push(\n        `Tip: buildStatusReport({scope:\"uncompressed\", view:\"messages\", tool:\"${topTool ?? \"bash\"}\"}) for per-message listing`,\n    );\n    return lines.join(\"\\n\");\n}\n\nfunction renderUncompressedRanges(visible: VisibleMessageInfo[]): string {\n    const lines: string[] = [];\n    const totalTokens = visible.reduce((s, m) => s + m.tokens, 0);\n    lines.push(`UNCOMPRESSED — ${formatTokens(totalTokens)} | ${visible.length} visible messages`);\n    lines.push(\"\");\n    if (visible.length === 0) {\n        lines.push(\"  (no uncompressed messages)\");\n        return lines.join(\"\\n\");\n    }\n    // Merge consecutive messages into ranges (by numeric ref), aggregating\n    // token counts and dominant tool so the view reads as blocks, not a\n    // per-message firehose — mirroring the Compressible Ranges output.\n    interface Merged { startRef: string; endRef: string; startNum: number; count: number; tokens: number; tool: string; }\n    const refNum = (ref: string): number => {\n        const m = ref.match(/\\d+/);\n        return m ? parseInt(m[0], 10) : 0;\n    };\n    const merged: Merged[] = [];\n    for (const m of visible) {\n        const num = refNum(m.ref);\n        const last = merged[merged.length - 1];\n        if (last && num === last.startNum + last.count) {\n            last.endRef = m.ref;\n            last.count += 1;\n            last.tokens += m.tokens;\n        } else {\n            merged.push({ startRef: m.ref, endRef: m.ref, startNum: num, count: 1, tokens: m.tokens, tool: m.tool });\n        }\n    }\n    for (const r of merged.slice(0, 30)) {\n        const range = r.count === 1 ? r.startRef : `${r.startRef}–${r.endRef}`;\n        lines.push(`  ${range}  (${r.count} msgs, ${formatTokens(r.tokens)}${r.count > 1 ? ` (${Math.round(r.tokens / r.count)}/msg)` : \"\"}) ${r.tool}`);\n    }\n    if (merged.length > 30) {\n        lines.push(`  ... and ${merged.length - 30} more ranges`);\n    }\n    return lines.join(\"\\n\");\n}\n\nfunction renderMessageDrilldown(\n    visible: VisibleMessageInfo[],\n    toolFilter: string | undefined,\n    sort: string,\n    limit: number,\n): string {\n    let filtered = visible;\n    if (toolFilter) filtered = filtered.filter((m) => m.tool === toolFilter);\n\n    if (sort === \"time\") filtered.sort((a, b) => a.index - b.index);\n    else if (sort === \"tool\") filtered.sort((a, b) => a.tool.localeCompare(b.tool) || b.tokens - a.tokens);\n    else filtered.sort((a, b) => b.tokens - a.tokens);\n\n    const totalTokens = filtered.reduce((s, m) => s + m.tokens, 0);\n    const allTokens = visible.reduce((s, m) => s + m.tokens, 0);\n    const header = toolFilter\n        ? `UNCOMPRESSED — ${toolFilter}: ${formatTokens(totalTokens)} | ${filtered.length} msgs | ${pct(totalTokens, allTokens)}% of visible`\n        : `UNCOMPRESSED — ${formatTokens(totalTokens)} | ${filtered.length} msgs`;\n    const lines = [header, `Sorted by ${sort}`, \"\"];\n    const shown = filtered.slice(0, limit);\n    for (const message of shown) {\n        lines.push(`  ${message.ref} (${formatTokens(message.tokens)}) ${message.tool}`);\n    }\n    if (filtered.length > shown.length) {\n        lines.push(\"\");\n        lines.push(`${shown.length} of ${filtered.length} shown.`);\n    }\n    return lines.join(\"\\n\");\n}\n\nfunction renderCompressedDrilldown(\n    blocks: CompressionBlock[],\n    state: CompressionState,\n    sort: string,\n    limit: number,\n    countTokens: (t: string) => number,\n): string {\n    let sorted = [...blocks];\n    if (sort === \"time\") sorted.sort((a, b) => a.createdAt - b.createdAt);\n    else if (sort === \"age\") sorted.sort((a, b) => b.survivedCount - a.survivedCount);\n    else\n        sorted.sort(\n            (a, b) =>\n                effectiveCompressedTokens(b, state, countTokens) -\n                    effectiveCompressedTokens(a, state, countTokens) ||\n                b.createdAt - a.createdAt,\n        );\n\n    const totalSummary = sorted.reduce((s, b) => s + summaryTokensOf(b, countTokens), 0);\n    const totalEffective = sorted.reduce(\n        (s, b) => s + effectiveCompressedTokens(b, state, countTokens),\n        0,\n    );\n    const lines = [\n        `COMPRESSED — ${sorted.length} blocks | ${formatTokens(totalEffective)} original → ${formatTokens(totalSummary)} summary`,\n    ];\n    const breakdown = tierBreakdown(sorted, countTokens);\n    if (breakdown) lines.push(`Tier usage: ${breakdown}`);\n    lines.push(\"\");\n    const shown = sorted.slice(0, limit);\n    for (const block of shown) {\n        const nested = block.directBlockIds.length > 0 ? ` nested=[${block.directBlockIds.join(\",\")}]` : \"\";\n        const topic = block.topic ?? \"(no topic)\";\n        const eff = effectiveCompressedTokens(block, state, countTokens);\n        lines.push(\n            `  ${block.blockId} (${tierLabel(block)})  ${formatTokens(eff)}→${formatTokens(summaryTokensOf(block, countTokens))}  ${block.effectiveMessageIds.length} msgs  age=${block.survivedCount} ${block.generation}${nested}`,\n        );\n        lines.push(`    \"${topic}\"`);\n    }\n    if (sorted.length > shown.length) {\n        lines.push(\"\");\n        lines.push(`${shown.length} of ${sorted.length} shown.`);\n    }\n    return lines.join(\"\\n\");\n}\n\nexport function buildRecap(\n    state: CompressionState,\n    blockId?: string,\n): string {\n    const activeBlocks = state.blocks\n        .filter((b) => b.active)\n        .sort((a, b) => numericPart(a.blockId) - numericPart(b.blockId));\n\n    if (blockId !== undefined) {\n        const block = state.blocks.find((b) => b.blockId === blockId);\n        if (!block) {\n            const activeList = activeBlocks.map((b) => b.blockId).join(\", \");\n            return `Block ${blockId} not found. Active blocks: ${activeList}`;\n        }\n        if (!block.active) {\n            return `Block ${blockId} is inactive (deactivated by nested compression).`;\n        }\n        const range = `${block.effectiveMessageIds.length} messages`;\n        return `[Compressed conversation section]\\n${block.summary}\\n\\n[${blockId} | ${range} | topic: \"${block.topic ?? \"(none)\"}\"]`;\n    }\n\n    if (activeBlocks.length === 0) return \"No active compression blocks.\";\n\n    const lines = [`Active compression blocks (${activeBlocks.length}):`];\n    for (const block of activeBlocks) {\n        const range = `${block.effectiveMessageIds.length} messages`;\n        const preview = block.summary.slice(0, 200);\n        lines.push(`\\n${block.blockId} | ${range} | \"${block.topic ?? \"(none)\"}\"`);\n        lines.push(`  ${preview}${block.summary.length > 200 ? \"...\" : \"\"}`);\n    }\n    lines.push(`\\nCall with blockId to get the full summary.`);\n    return lines.join(\"\\n\");\n}\n","import { createCore } from \"./compress.js\";\nimport { assignRefs, highestUsedIndex } from \"./refs.js\";\nimport { defaultCountTokens } from \"./tokenize.js\";\nimport type { CompressionState, CoreMessage } from \"./types.js\";\n\nexport interface CompressInputEntry {\n    startId?: string;\n    endId?: string;\n    messageId?: string;\n    summary: string;\n    topic?: string;\n}\n\nexport interface RebuildResult {\n    state: CompressionState;\n    blocksRebuilt: number;\n}\n\nexport interface RebuildPorts {\n    countTokens?: (text: string) => number;\n}\n\n/**\n * Fork-recovery: reconstruct compression state by replaying historical\n * `compress` tool-call messages. Message refs (mNNNNN) are assigned by\n * message order, so they are fork-stable — a ref in a historical compress\n * input points to the same logical message after a fork regenerates IDs.\n * The rebuilt state is an approximation: only raw model summaries are\n * replayed (no protected-content enrichments).\n */\nexport function rebuildCompressionState(\n    state: CompressionState,\n    messages: CoreMessage[],\n    config: import(\"./types.js\").Config,\n    ports: RebuildPorts = {},\n): RebuildResult {\n    const core = createCore({ countTokens: ports.countTokens ?? defaultCountTokens });\n    const refResult = assignRefs(messages, {\n        existing: state.messageRefs,\n        nextIndex: highestUsedIndex(state.messageRefs) + 1,\n    });\n    let working: CompressionState = { ...state, messageRefs: refResult.map };\n\n    const invocations = collectCompressInvocations(messages);\n    let blocksRebuilt = 0;\n\n    for (const invocation of invocations) {\n        const ranges = extractRanges(invocation.input, invocation.callId);\n        if (ranges.length === 0) continue;\n        const result = core.applyCompression({ ranges, messages, state: working, config });\n        working = result.state;\n        blocksRebuilt += result.result.blocksCreated;\n    }\n\n    return { state: working, blocksRebuilt };\n}\n\ninterface CompressInvocation {\n    callId: string | undefined;\n    input: unknown;\n}\n\nfunction collectCompressInvocations(messages: CoreMessage[]): CompressInvocation[] {\n    const invocations: CompressInvocation[] = [];\n    for (const message of messages) {\n        if (message.toolName !== \"compress\" || message.contentType !== \"tool-call\") continue;\n        let input: unknown;\n        try {\n            input = JSON.parse(message.text ?? \"\");\n        } catch {\n            continue;\n        }\n        invocations.push({ callId: message.toolCallId, input });\n    }\n    return invocations;\n}\n\nfunction extractRanges(\n    input: unknown,\n    callId: string | undefined,\n): Array<{\n    startRef: string;\n    endRef: string;\n    summary: string;\n    topic?: string;\n    compressCallId?: string;\n}> {\n    const content = (input as { content?: unknown[] })?.content;\n    if (!Array.isArray(content)) return [];\n    const ranges = [];\n    for (const entry of content) {\n        if (!entry || typeof entry !== \"object\") continue;\n        const e = entry as CompressInputEntry;\n        if (typeof e.summary !== \"string\") continue;\n        const start = e.startId ?? e.messageId;\n        const end = e.endId ?? e.messageId;\n        if (typeof start !== \"string\" || typeof end !== \"string\") continue;\n        ranges.push({\n            startRef: start,\n            endRef: end,\n            summary: e.summary,\n            topic: typeof e.topic === \"string\" ? e.topic : undefined,\n            compressCallId: callId,\n        });\n    }\n    return ranges;\n}\n","export type TransformChannel = \"message\" | \"wire\";\n\n/**\n * Pick the transform channel: an explicit preference always wins; otherwise\n * the wire channel is used only when the caller's host actually applies the\n * wire-payload replacement (adapters pass `wireViable` — e.g. the body format\n * is in WIRE_FORMATS and the host honors the hook's return value).\n */\nexport function resolveTransformChannel(\n  explicit: TransformChannel | undefined,\n  wireViable: boolean,\n): TransformChannel {\n  return explicit ?? (wireViable ? \"wire\" : \"message\");\n}\n","/**\n * Lightweight English stemmer (suffix stripping, Porter-inspired).\n * Zero dependencies. Good enough for IR morphology normalization:\n *   tokens → token, running → runn, compressed → compress,\n *   authentication → authentic, handling → handl, subagents → subagent\n *\n * Not a full Porter stemmer — intentionally simpler and faster. CJK is\n * untouched (handled by bigram tokenization, not stemming).\n */\nexport function stem(word: string): string {\n    let w = word;\n    if (w.length <= 3) return w;\n    if (w.endsWith(\"ies\")) w = w.slice(0, -3) + \"y\";\n    else if (w.endsWith(\"ses\") || w.endsWith(\"xes\") || w.endsWith(\"zes\")) w = w.slice(0, -2);\n    else if (w.endsWith(\"ches\") || w.endsWith(\"shes\")) w = w.slice(0, -2);\n    else if (w.endsWith(\"s\") && !w.endsWith(\"ss\")) w = w.slice(0, -1);\n    if (w.endsWith(\"ing\") && w.length > 5) w = w.slice(0, -3);\n    if (w.endsWith(\"ed\") && w.length > 4) w = w.slice(0, -2);\n    if (w.endsWith(\"ation\") && w.length > 6) w = w.slice(0, -3);\n    else if (w.endsWith(\"tion\") && w.length > 5) w = w.slice(0, -4) + \"t\";\n    else if (w.endsWith(\"ion\") && w.length > 4) w = w.slice(0, -3);\n    if (w.endsWith(\"ment\") && w.length > 6) w = w.slice(0, -4);\n    if (w.endsWith(\"ness\") && w.length > 6) w = w.slice(0, -4);\n    if (w.endsWith(\"ly\") && w.length > 4) w = w.slice(0, -2);\n    return w;\n}\n","/**\n * Search tokenizer.\n *\n * Handles mixed Latin + CJK content — the single biggest quality lever\n * over plain substring search. Latin is split on non-word boundaries;\n * CJK (no spaces) is word-segmented via Intl.Segmenter (CLDR dictionary),\n * falling back to overlapping bigrams on out-of-vocabulary text so a query\n * like \"身份验证\" still scores against doc text \"身份验证流程\".\n *\n * CJK segmentation is a SINGLE segment() pass over the whole text, not one\n * call per CJK run: a segment() call has fixed overhead (~3µs), and\n * run-heavy text (logs: dozens of short runs per line) made per-run calls\n * 10-16× slower than one bulk pass. ICU never merges CJK words across\n * non-CJK boundaries, so bulk segmentation yields the same words per run\n * (differential-verified against the per-run implementation across a\n * mixed-script stress corpus); run boundaries are re-derived below to keep\n * the all-OOV bigram fallback.\n */\n\n/**\n * CJK ideograph/kana/hangul class — the one shared definition of \"non-Latin\n * script that must be handled specially\". Exported so fuzzy.ts relaxes its\n * short-query gate for the SAME range tokenizer.ts segments: two hand-copied\n * regexes would silently drift apart. Latin is deliberately absent — 2-char\n * English tokens (\"to\", \"of\") carry no meaning, while nearly all CJK words\n * are 2-char atomic units (登录/缓存), so the two scripts need opposite rules.\n */\nimport { stem } from \"./stemmer.js\";\n\nexport const CJK = /[\\u3400-\\u9fff\\uf900-\\ufaff\\u3040-\\u30ff\\uac00-\\ud7af]/;\nconst LATIN_WORD = /[a-z][a-z0-9_]*[a-z0-9]|[a-z0-9]/g;\n\nconst cjkSegmenter = new Intl.Segmenter(\"zh\", { granularity: \"word\" });\n\n/**\n * CJK segment groups → tokens, with the all-OOV fallback.\n *\n * `segs` are the word segments the segmenter produced for ONE contiguous\n * CJK run. Multi-char words are kept as whole terms, so \"国际化\" matches\n * \"国际化\" and \"试验证明\" no longer scores against \"验证\" through accidental\n * char runs. When the dictionary finds no multi-char word at all (all-OOV\n * text) we fall back to overlapping bigrams + single chars so recall is\n * preserved — this also covers single-char queries like \"验\".\n */\nfunction cjkRunTokens(segs: string[]): string[] {\n    const words = segs.filter((w) => w.length >= 2);\n    if (words.length > 0) return words;\n    const run = segs.join(\"\");\n    const out: string[] = [];\n    for (let i = 0; i < run.length - 1; i++) out.push(run.slice(i, i + 2));\n    for (const ch of run) out.push(ch);\n    return out;\n}\n\nexport interface TokenizeOptions {\n    stem?: boolean;\n}\n\nexport function tokenize(text: string, opts: TokenizeOptions = {}): string[] {\n    const lower = text.toLowerCase();\n    const tokens: string[] = [];\n\n    const latin = lower.match(LATIN_WORD) ?? [];\n    for (let w of latin) {\n        if (w.length >= 2) {\n            if (opts.stem) w = stem(w);\n            tokens.push(w);\n        }\n    }\n\n    // CJK: one segmenter pass over the whole text instead of one\n    // segment() call per CJK run. A segment() call has fixed overhead\n    // (~3µs), and run-heavy text (logs: dozens of short runs per line) made\n    // per-run calls 10-16× slower than one bulk pass. ICU never merges CJK\n    // words across non-CJK boundaries, so bulk segmentation yields the same\n    // words per run (differential-verified against the per-run\n    // implementation across a mixed-script stress corpus); run boundaries\n    // are re-derived below to keep the all-OOV bigram fallback.\n    //\n    // Guard: skip the segmenter entirely when the text has no CJK at all —\n    // the old code never called it for pure-Latin text, and a bulk pass\n    // would pay a full-text scan (12ms → 33ms per MB of English) for nothing.\n    if (!CJK.test(lower)) return tokens;\n\n    // Group the bulk segments back into CJK runs: a non-CJK segment is a run\n    // boundary (the segmenter never puts non-CJK inside a CJK word segment).\n    const runSegs: string[][] = [];\n    let cur: string[] | null = null;\n    for (const s of cjkSegmenter.segment(lower)) {\n        const t = s.segment;\n        if (t.length === 0) continue;\n        if (CJK.test(t)) {\n            (cur ??= []).push(t);\n        } else if (cur) {\n            runSegs.push(cur);\n            cur = null;\n        }\n    }\n    if (cur) runSegs.push(cur);\n\n    for (const segs of runSegs) {\n        tokens.push(...cjkRunTokens(segs));\n    }\n\n    return tokens;\n}\n\n/** Character bigrams over arbitrary text — used by fuzzy matching. */\nexport function charBigrams(text: string): string[] {\n    const grams: string[] = [];\n    for (let i = 0; i < text.length - 1; i++) {\n        const pair = text.slice(i, i + 2);\n        if (pair.trim().length === pair.length) grams.push(pair);\n    }\n    return grams;\n}\n\n/** Term-frequency map. */\nexport function tfMap(text: string, stem: boolean): Map<string, number> {\n    const m = new Map<string, number>();\n    for (const t of tokenize(text, { stem })) m.set(t, (m.get(t) ?? 0) + 1);\n    return m;\n}\n","/**\n * Per-doc derived features, memoized across search calls.\n *\n * A search over the compressed history re-scores the SAME immutable docs on\n * every call — compressed block summaries and folded message text never\n * change. Without this cache, every search_context call re-tokenized the\n * entire corpus (segmenter CJK pass ≈ 0.3s/MB cold) plus re-lowercased it\n * and rebuilt the bigram set for each channel: a 5MB session cost ~3s PER\n * CALL, growing linearly with session length. With the cache the corpus is\n * processed once; later searches are O(docs × query-terms).\n *\n * Keyed by doc text (immutable). Bounded by total cached source chars —\n * oldest docs are evicted when the cap is exceeded, so a long-lived\n * process serving many sessions cannot grow unboundedly. Hosts that want to\n * release the memory eagerly on session shutdown/switch can call\n * clearDocFeatures() (optional: the cap already bounds it).\n */\n\nimport { charBigrams, tfMap } from \"./tokenizer.js\";\n\nexport interface DocFeatures {\n    /** Stemmed term frequencies (BM25 channel). */\n    tf: Map<string, number>;\n    /** Total term count (BM25 length normalization). */\n    len: number;\n    /** Lower-cased text (substring + fuzzy channels). */\n    lower: string;\n    /** Unique char bigrams of `lower` (fuzzy channel). */\n    grams: Set<string>;\n}\n\nconst DEFAULT_CAP_CHARS = 8 * 1024 * 1024;\nlet capChars = DEFAULT_CAP_CHARS;\nconst cache = new Map<string, DocFeatures>();\nlet cachedChars = 0;\n\nfunction build(text: string): DocFeatures {\n    const tf = tfMap(text, true);\n    let len = 0;\n    for (const v of tf.values()) len += v;\n    const lower = text.toLowerCase();\n    return { tf, len, lower, grams: new Set(charBigrams(lower)) };\n}\n\nexport function docFeatures(text: string): DocFeatures {\n    const hit = cache.get(text);\n    if (hit) return hit;\n    const f = build(text);\n    if (text.length > 0 && text.length <= capChars) {\n        while (cachedChars + text.length > capChars && cache.size > 0) {\n            const k = cache.keys().next().value as string;\n            cachedChars -= k.length;\n            cache.delete(k);\n        }\n        cache.set(text, f);\n        cachedChars += text.length;\n    }\n    return f;\n}\n\n/** Drop all cached features (e.g. on session shutdown/switch). */\nexport function clearDocFeatures(): void {\n    cache.clear();\n    cachedChars = 0;\n}\n\n/**\n * Set the cache cap in source chars. Docs larger than the cap are never\n * cached. Also used by tests to exercise eviction.\n */\nexport function setDocCacheCap(chars: number): void {\n    capChars = Math.max(1, chars);\n    while (cachedChars > capChars && cache.size > 0) {\n        const k = cache.keys().next().value as string;\n        cachedChars -= k.length;\n        cache.delete(k);\n    }\n}\n\n/** Cache occupancy — for diagnostics. */\nexport function docCacheInfo(): { entries: number; chars: number } {\n    return { entries: cache.size, chars: cachedChars };\n}\n","import type { SearchAlgorithm, SearchDoc, ScoredBlock } from \"../types.js\";\nimport { docFeatures } from \"../doc-cache.js\";\n\n/**\n * Substring counting — the original baseline algorithm.\n * Exact, lowercased substring occurrence counts. Predictable but blind to\n * morphology, typos, and CJK word boundaries. Kept for backward compat and\n * as a deterministic reference.\n */\nexport const substringAlgorithm: SearchAlgorithm = {\n    name: \"substring\",\n    description: \"Exact substring counting (original baseline). Predictable, no normalization.\",\n    score(docs: SearchDoc[], query: string): ScoredBlock[] {\n        const terms = query.toLowerCase().trim().split(/\\s+/).filter((t) => t.length > 0);\n        if (terms.length === 0) return docs.map((d) => ({ ref: d.ref, score: 0 }));\n        return docs.map((d) => {\n            const haystack = docFeatures(d.text).lower; // memoized across calls\n            let score = 0;\n            for (const term of terms) score += countOccurrences(haystack, term);\n            return { ref: d.ref, score };\n        });\n    },\n};\n\nfunction countOccurrences(haystack: string, needle: string): number {\n    if (!needle) return 0;\n    return haystack.split(needle).length - 1;\n}\n","import type { SearchAlgorithm, SearchDoc, ScoredBlock } from \"../types.js\";\nimport { tokenize } from \"../tokenizer.js\";\nimport { docFeatures } from \"../doc-cache.js\";\n\n/**\n * BM25 with stemming + CJK bigram tokenization.\n *\n * k1=1.2, b=0.75 (standard IR). IDF down-weights terms common across the\n * corpus; length normalization prevents long summaries from dominating by\n * raw term count. Stemming collapses English morphology\n * (compress/compressed/compression → ~compress).\n *\n * On the 32-block mixed EN/CJK benchmark: MRR 0.833 / R@1 0.833 / R@3 0.833\n * vs 0.797 / 0.792 / 0.792 for substring — better in isolation on every\n * metric, and the precision component of the hybrid default (see hybrid.ts).\n */\nexport const bm25Algorithm: SearchAlgorithm = {\n    name: \"bm25\",\n    description: \"BM25 with stemming + CJK bigram tokenization. IR-standard relevance ranking.\",\n    score(docs: SearchDoc[], query: string): ScoredBlock[] {\n        const N = docs.length;\n        const k1 = 1.2;\n        const b = 0.75;\n        const parsed = docs.map((d) => {\n            const f = docFeatures(d.text); // memoized: tf + length, cached across calls\n            return { id: d.ref, tf: f.tf, len: f.len };\n        });\n        const avgdl = parsed.reduce((s, d) => s + d.len, 0) / (N || 1);\n\n        const qTerms = tokenize(query, { stem: true });\n        if (qTerms.length === 0) return docs.map((d) => ({ ref: d.ref, score: 0 }));\n\n        const idf = new Map<string, number>();\n        for (const t of new Set(qTerms)) {\n            let df = 0;\n            for (const d of parsed) if (d.tf.has(t)) df++;\n            idf.set(t, Math.log(1 + (N - df + 0.5) / (df + 0.5)));\n        }\n\n        return parsed.map((d) => {\n            let score = 0;\n            for (const t of qTerms) {\n                const f = d.tf.get(t) ?? 0;\n                if (f === 0) continue;\n                const idfT = idf.get(t) ?? 0;\n                score += (idfT * (f * (k1 + 1))) / (f + k1 * (1 - b + (b * d.len) / (avgdl || 1)));\n            }\n            return { ref: d.id, score };\n        });\n    },\n};\n","import type { SearchAlgorithm, SearchDoc, ScoredBlock } from \"../types.js\";\nimport { charBigrams, CJK } from \"../tokenizer.js\";\nimport { docFeatures } from \"../doc-cache.js\";\n\n/**\n * Fuzzy character-bigram matching (Jaccard-style).\n *\n * Decomposes the query into character bigrams and measures overlap with\n * each doc. Robust to typos (tokan≈token), partial words, and works\n * uniformly across all scripts (CJK benefits most).\n *\n * Query-token gate — CJK gets its own length rule; Latin is frozen:\n *   length >= 4 (any script)   typo-tolerant bigram rescue needs a couple of\n *       chars before it means anything; 2-3-char Latin tokens (\"to\", \"of\",\n *       \"us\") are stop-word noise whose bigrams overlap nearly every doc.\n *   length >= 2 && CJK         Chinese/Japanese/Korean words are mostly\n *       2-character atomic units (登录/缓存/図表), so the Latin-style >= 4 rule\n *       would lock the whole CJK query space out of this recall channel\n *       (that gap is what bench \"缓存 → nothing\" exposed). Single CJK chars\n *       stay excluded — one char cannot form a bigram, nothing to compare.\n *\n * On benchmark: lowest MRR of any single algorithm (0.795 — a hair under\n * substring's 0.797) — precision is weak, but it is the recall boost in the\n * hybrid default.\n */\nexport const fuzzyAlgorithm: SearchAlgorithm = {\n    name: \"fuzzy\",\n    description: \"Character bigram overlap. Typo-tolerant, script-agnostic, high recall.\",\n    score(docs: SearchDoc[], query: string): ScoredBlock[] {\n        // Gate (see header): Latin short tokens are noise, 2-char CJK words\n        // are real terms — admit the latter so 缓存/登录 reach the scorer.\n        const qTokens = query.toLowerCase().split(/[\\s,]+/).filter((t) => t.length >= 4 || (t.length >= 2 && CJK.test(t)));\n        if (qTokens.length === 0) return docs.map((d) => ({ ref: d.ref, score: 0 }));\n\n        const qGrams = new Set<string>();\n        for (const t of qTokens) for (const g of charBigrams(t)) qGrams.add(g);\n        if (qGrams.size === 0) return docs.map((d) => ({ ref: d.ref, score: 0 }));\n\n        return docs.map((d) => {\n            const docGrams = docFeatures(d.text).grams; // memoized bigram set\n            let hits = 0;\n            for (const g of qGrams) if (docGrams.has(g)) hits++;\n            return { ref: d.ref, score: hits / qGrams.size };\n        });\n    },\n};\n","import type { SearchAlgorithm, SearchDoc, ScoredBlock } from \"../types.js\";\nimport { bm25Algorithm } from \"./bm25.js\";\nimport { fuzzyAlgorithm } from \"./fuzzy.js\";\n\n/**\n * Hybrid: normalized BM25(stem) + fuzzy n-gram, weighted 0.7 / 0.3.\n *\n * BM25 supplies precision on real terms (with morphology + IDF + length\n * norm); fuzzy supplies recall on typos, partials, and cross-script.\n * Each component is max-normalized to [0,1] before weighting so their\n * scales are comparable regardless of corpus size.\n *\n * Benchmark (32 blocks, 48 mixed EN/CJK queries, final code — segmenter\n * tokenizer + CJK fuzzy gate):\n *   substring  MRR 0.797  R@1 0.792  R@3 0.792\n *   bm25       MRR 0.833  R@1 0.833  R@3 0.833\n *   fuzzy      MRR 0.795  R@1 0.708  R@3 0.875\n *   hybrid     MRR 0.898  R@1 0.875  R@3 0.917   ← best on every metric\n * The weight ratio is robust: 0.6–0.8 for BM25 all score within 0.001 MRR.\n */\n\nconst W_BM25 = 0.7;\nconst W_FUZZY = 0.3;\n\nexport const hybridAlgorithm: SearchAlgorithm = {\n    name: \"hybrid\",\n    description: \"Weighted BM25(stem) + fuzzy n-gram. Default — best precision + recall.\",\n    score(docs: SearchDoc[], query: string): ScoredBlock[] {\n        const bm = bm25Algorithm.score(docs, query);\n        const fz = fuzzyAlgorithm.score(docs, query);\n        const maxBm = Math.max(...bm.map((r) => r.score), 1e-9);\n        const maxFz = Math.max(...fz.map((r) => r.score), 1e-9);\n        const bmMap = new Map(bm.map((r) => [r.ref, r.score / maxBm]));\n        const fzMap = new Map(fz.map((r) => [r.ref, r.score / maxFz]));\n        return docs.map((d) => ({\n            ref: d.ref,\n            score: W_BM25 * (bmMap.get(d.ref) ?? 0) + W_FUZZY * (fzMap.get(d.ref) ?? 0),\n        }));\n    },\n};\n","/**\n * Algorithm registry. Builtins are pre-registered; hosts may register\n * additional algorithms (e.g. an embedding-based semantic provider) via\n * registerSearchAlgorithm and reference them by name in SearchOptions.\n */\nimport type { AnySearchAlgorithm } from \"./types.js\";\nimport { substringAlgorithm } from \"./algorithms/substring.js\";\nimport { bm25Algorithm } from \"./algorithms/bm25.js\";\nimport { fuzzyAlgorithm } from \"./algorithms/fuzzy.js\";\nimport { hybridAlgorithm } from \"./algorithms/hybrid.js\";\n\nconst registry = new Map<string, AnySearchAlgorithm>();\n\nexport function registerSearchAlgorithm(algo: AnySearchAlgorithm): void {\n    registry.set(algo.name, algo);\n}\n\nexport function getSearchAlgorithm(name: string): AnySearchAlgorithm | undefined {\n    return registry.get(name);\n}\n\nexport function listSearchAlgorithms(): AnySearchAlgorithm[] {\n    return [...registry.values()];\n}\n\n// Pre-register builtins. Hybrid is the default (see types.ts DEFAULT_ALGORITHM).\nregisterSearchAlgorithm(substringAlgorithm);\nregisterSearchAlgorithm(bm25Algorithm);\nregisterSearchAlgorithm(fuzzyAlgorithm);\nregisterSearchAlgorithm(hybridAlgorithm);\n","/**\n * Search type definitions.\n *\n * Two data sources are searchable:\n *  - Compressed blocks (summary text; ref = \"b{id}\")\n *  - Historical messages (original text from the append-only session log;\n *    ref = \"m{NNNNN}\"). These let the model locate detail that compression\n *    turned into a short summary — search to pinpoint, then decompress the\n *    owning block for the full content.\n *\n * A SearchAlgorithm is a stateless scorer over a unified SearchDoc[]. Roles\n * carry a configurable weight (user intent > assistant reasoning > tool noise).\n */\n\n/** Where a searchable document came from. */\nexport type SearchDocKind = \"block\" | \"message\";\n\nexport type MessageRole = \"user\" | \"assistant\" | \"tool\";\n\n/** A unified searchable document — either a block summary or a message. */\nexport interface SearchDoc {\n    kind: SearchDocKind;\n    /** Stable ref for decompress: \"b3\" for a block, \"m00350\" for a message. */\n    ref: string;\n    /** Text this doc is scored against (topic+summary for blocks; content for messages). */\n    text: string;\n    /** For preview/title display. */\n    title: string;\n    /** Message role (messages only); undefined for blocks. Drives role weighting. */\n    role?: MessageRole;\n    /** Block owning this doc. For blocks: the block itself. For messages: the block\n     *  that compressed it (so the model knows which block to decompress for detail). */\n    blockId?: string;\n    /** Tier of the owning block (display + grouping). */\n    tier?: number;\n    /** Approx token size (for \"how big is this\" display). */\n    tokens?: number;\n}\n\n/** Per-role score multipliers. Defaults favor user intent over tool noise. */\nexport interface RoleWeights {\n    user?: number;\n    assistant?: number;\n    tool?: number;\n    block?: number;\n}\n\nexport const DEFAULT_ROLE_WEIGHTS: Required<RoleWeights> = {\n    user: 1.5,\n    assistant: 1.0,\n    tool: 0.6,\n    block: 1.0,\n};\n\nexport interface ScoredBlock {\n    ref: string;\n    score: number;\n}\n\nexport interface SearchAlgorithm {\n    name: string;\n    description: string;\n    score(docs: SearchDoc[], query: string): ScoredBlock[];\n}\n\nexport interface AsyncSearchAlgorithm {\n    name: string;\n    description: string;\n    score(docs: SearchDoc[], query: string): Promise<ScoredBlock[]>;\n}\n\nexport type AnySearchAlgorithm = SearchAlgorithm | AsyncSearchAlgorithm;\n\nexport interface SearchResult {\n    /** \"block\" or \"message\". */\n    kind: SearchDocKind;\n    /** Ref to pass to decompress: \"b3\" or \"m00350\". */\n    ref: string;\n    /** Owning block id (for messages: the block that compressed it). */\n    blockId?: string;\n    tier: number;\n    score: number;\n    title: string;\n    preview: string;\n    role?: MessageRole;\n    tokens?: number;\n}\n\nexport interface SearchOptions {\n    algorithm?: string;\n    limit?: number;\n    previewLength?: number;\n    minScore?: number;\n    /** Per-role weights (default DEFAULT_ROLE_WEIGHTS). */\n    roleWeights?: RoleWeights;\n}\n\n/** Host-supplied historical message, turned into a message SearchDoc. */\nexport interface MessageInput {\n    ref: string;\n    role: MessageRole;\n    text: string;\n    tokens?: number;\n    /** Block id that compressed this message (undefined if still visible). */\n    blockId?: string;\n    tier?: number;\n}\n\nexport const DEFAULT_ALGORITHM = \"hybrid\";\n","/**\n * searchBlocks — public search entry point.\n *\n * Scores a unified document set (block summaries + historical messages)\n * and returns ranked results. The model uses search to cheaply locate\n * detail that compression folded into summaries, then decompresses the\n * owning block for the full content.\n *\n * Two entry points:\n *  - searchBlocks()      — sync. Works for all lexical algorithms.\n *  - searchBlocksAsync() — async. Also supports embedding-based semantic\n *                          algorithms whose score() returns a Promise.\n */\n\nimport type { CompressionState, CompressionBlock } from \"../types.js\";\nimport { getSearchAlgorithm } from \"./registry.js\";\nimport type { SearchDoc, ScoredBlock, MessageInput } from \"./types.js\";\nimport type { SearchResult, SearchOptions, RoleWeights } from \"./types.js\";\nimport { DEFAULT_ALGORITHM, DEFAULT_ROLE_WEIGHTS } from \"./types.js\";\n\n/** Build SearchDoc[] from all blocks (active AND inactive) of the state. */\nexport function blockDocs(state: CompressionState): SearchDoc[] {\n    return state.blocks.map((b: CompressionBlock): SearchDoc => ({\n        kind: \"block\",\n        ref: b.blockId,\n        text: `${b.topic ?? \"\"} ${b.summary ?? \"\"}`,\n        title: b.topic ?? b.blockId,\n        blockId: b.blockId,\n        tier: b.tier ?? 1,\n        tokens: b.compressedTokens,\n    }));\n}\n\n/**\n * Build SearchDoc[] from historical messages supplied by the host. The host\n * (pai-acp) reads these from the append-only session log — they include the\n * original text of messages that compression later folded into block summaries.\n *\n * `ownerOf(ref)` maps a message ref to the block id that compressed it, so a\n * message hit tells the model exactly which block to decompress for detail.\n */\nexport function messageDocs(msgs: MessageInput[]): SearchDoc[] {\n    return msgs.map((m): SearchDoc => ({\n        kind: \"message\",\n        ref: m.ref,\n        text: m.text,\n        title: `${m.role}: ${m.text.slice(0, 60)}`,\n        role: m.role,\n        blockId: m.blockId,\n        tier: m.tier,\n        tokens: m.tokens,\n    }));\n}\n\nfunction applyRoleWeight(scored: ScoredBlock[], docs: SearchDoc[], rw: Required<RoleWeights>): ScoredBlock[] {\n    if (docs.length === 0) return scored;\n    const docByRef = new Map(docs.map((d) => [d.ref, d]));\n    return scored.map((s) => {\n        const doc = docByRef.get(s.ref);\n        if (!doc) return s;\n        const w =\n            doc.kind === \"message\"\n                ? doc.role === \"user\"\n                    ? rw.user\n                    : doc.role === \"assistant\"\n                      ? rw.assistant\n                      : rw.tool\n                : rw.block;\n        return { ref: s.ref, score: s.score * w };\n    });\n}\n\nfunction runSearch(\n    docs: SearchDoc[],\n    query: string,\n    options: SearchOptions,\n): SearchResult[] | Promise<SearchResult[]> {\n    const limit = options.limit ?? 10;\n    const previewLength = options.previewLength ?? 200;\n    const minScore = options.minScore ?? 0.01;\n    const algoName = options.algorithm ?? DEFAULT_ALGORITHM;\n    const rw = { ...DEFAULT_ROLE_WEIGHTS, ...options.roleWeights };\n\n    const algo = getSearchAlgorithm(algoName);\n    if (!algo) return [];\n    if (docs.length === 0) return [];\n\n    const scoredOrPromise = algo.score(docs, query);\n\n    const buildResults = (weighted: ScoredBlock[]): SearchResult[] => {\n        const byRef = new Map(docs.map((d) => [d.ref, d]));\n        return weighted\n            .map((s): SearchResult | null => {\n                const doc = byRef.get(s.ref);\n                if (!doc) return null;\n                return {\n                    kind: doc.kind,\n                    ref: doc.ref,\n                    blockId: doc.blockId,\n                    tier: doc.tier ?? 1,\n                    score: s.score,\n                    title: doc.title,\n                    preview: makePreview(doc.text, query, previewLength),\n                    role: doc.role,\n                    tokens: doc.tokens,\n                };\n            })\n            .filter((r): r is SearchResult => r !== null && r.score >= minScore)\n            .sort((a, b) => b.score - a.score)\n            .slice(0, limit);\n    };\n\n    if (scoredOrPromise instanceof Promise) {\n        return scoredOrPromise.then((raw) => buildResults(applyRoleWeight(raw, docs, rw)));\n    }\n    return buildResults(applyRoleWeight(scoredOrPromise, docs, rw));\n}\n\n/** Sync entry — throws for async algorithms. Pass docs from blockDocs() + messageDocs(). */\nexport function searchBlocks(docs: SearchDoc[], query: string, options: SearchOptions = {}): SearchResult[] {\n    const result = runSearch(docs, query, options);\n    if (result instanceof Promise) {\n        throw new Error(\n            `searchBlocks: algorithm \"${options.algorithm ?? DEFAULT_ALGORITHM}\" is async (e.g. semantic). Use searchBlocksAsync() instead.`,\n        );\n    }\n    return result;\n}\n\nexport { clearDocFeatures, docCacheInfo, docFeatures, setDocCacheCap } from \"./doc-cache.js\";\nexport type { DocFeatures } from \"./doc-cache.js\";\n\nexport async function searchBlocksAsync(docs: SearchDoc[], query: string, options: SearchOptions = {}): Promise<SearchResult[]> {\n    return await runSearch(docs, query, options);\n}\n\n/**\n * Preview centered on the first query-term hit (case-insensitive).\n * Falls back to the head when no term hits.\n */\nfunction makePreview(text: string, query: string, len: number): string {\n    if (!text) return \"\";\n    const terms = query.toLowerCase().trim().split(/\\s+/).filter((t) => t.length > 1);\n    if (terms.length === 0) return text.slice(0, len);\n\n    const lower = text.toLowerCase();\n    let hitIdx = -1;\n    for (const term of terms) {\n        const idx = lower.indexOf(term);\n        if (idx >= 0) {\n            hitIdx = idx;\n            break;\n        }\n    }\n\n    if (hitIdx < 0) return text.slice(0, len);\n\n    const half = Math.max(0, Math.floor(len / 2) - 10);\n    const start = Math.max(0, hitIdx - half);\n    const end = Math.min(text.length, start + len);\n    const prefix = start > 0 ? \"…\" : \"\";\n    const suffix = end < text.length ? \"…\" : \"\";\n    return prefix + text.slice(start, end).trim() + suffix;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAEA,IAAM,YAAY;AAClB,IAAM,YAAY;AAClB,IAAM,YAAY;AAClB,IAAM,cAAc;AAEb,IAAM,cAAc;AAEpB,SAAS,cAA6B;AAC3C,SAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAChC;AAEO,SAAS,WAAW,OAAuB;AAChD,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,aAAa,QAAQ,WAAW;AACtE,UAAM,IAAI;AAAA,MACR,4BAA4B,KAAK,aAAa,SAAS,IAAI,SAAS;AAAA,IACtE;AAAA,EACF;AACA,SAAO,IAAI,OAAO,KAAK,EAAE,SAAS,WAAW,GAAG,CAAC;AACnD;AAEO,SAAS,WAAW,KAA4B;AACrD,QAAM,QAAQ,YAAY,KAAK,IAAI,KAAK,EAAE,YAAY,CAAC;AACvD,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,QAAQ,OAAO,MAAM,CAAC,CAAC;AAC7B,MAAI,QAAQ,aAAa,QAAQ,UAAW,QAAO;AACnD,SAAO;AACT;AAEO,SAAS,UAAU,KAAoB,OAA8B;AAC1E,SAAO,IAAI,MAAM,KAAK,KAAK;AAC7B;AAEO,SAAS,UAAU,KAAoB,KAA4B;AACxE,SAAO,IAAI,MAAM,GAAG,KAAK;AAC3B;AAeO,SAAS,WACd,UACA,SACkB;AAClB,QAAM,MAAqB;AAAA,IACzB,OAAO,EAAE,GAAG,QAAQ,SAAS,MAAM;AAAA,IACnC,OAAO,EAAE,GAAG,QAAQ,SAAS,MAAM;AAAA,EACrC;AACA,MAAI,SACF,OAAO,UAAU,QAAQ,SAAS,KAAK,QAAQ,aAAa,YACxD,QAAQ,YACR;AACN,MAAI,gBAAgB;AAEpB,aAAW,WAAW,UAAU;AAC9B,QAAI,CAAC,QAAQ,MAAM,QAAQ,aAAa,OAAO,EAAG;AAElD,QAAI,IAAI,MAAM,QAAQ,EAAE,EAAG;AAE3B,QAAI,QAAQ,cAAc,OAAO,GAAG;AAClC,UAAI,MAAM,QAAQ,EAAE,IAAI;AACxB;AAAA,IACF;AAEA,UAAM,MAAM,gBAAgB,KAAK,MAAM;AACvC,aAAS,IAAI,QAAQ;AACrB,QAAI,MAAM,QAAQ,EAAE,IAAI,IAAI;AAC5B,QAAI,MAAM,IAAI,IAAI,IAAI,QAAQ;AAC9B;AAAA,EACF;AAEA,SAAO,EAAE,KAAK,WAAW,QAAQ,cAAc;AACjD;AAEA,SAAS,gBACP,KACA,OACiC;AACjC,MAAI,YAAY,KAAK,IAAI,OAAO,SAAS;AACzC,SAAO,aAAa,WAAW;AAC7B,UAAM,OAAO,WAAW,SAAS;AACjC,QAAI,CAAC,IAAI,MAAM,IAAI,GAAG;AACpB,aAAO,EAAE,MAAM,OAAO,UAAU;AAAA,IAClC;AACA;AAAA,EACF;AACA,QAAM,IAAI;AAAA,IACR,kDAAkD,WAAW,SAAS,CAAC;AAAA,EACzE;AACF;AAUO,SAAS,iBAAiB,KAA4B;AAC3D,MAAI,UAAU;AACd,aAAW,OAAO,OAAO,OAAO,IAAI,KAAK,GAAG;AAC1C,UAAM,QAAQ,QAAQ,cAAc,OAAO,WAAW,GAAG;AACzD,QAAI,UAAU,QAAQ,QAAQ,QAAS,WAAU;AAAA,EACnD;AACA,SAAO;AACT;;;ACnHO,SAAS,qBAAuC;AACrD,SAAO;AAAA,IACL,QAAQ,CAAC;AAAA,IACT,aAAa,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,IACpC,eAAe,CAAC;AAAA,IAChB,OAAO;AAAA,MACL,2BAA2B;AAAA,MAC3B,sBAAsB;AAAA,MACtB,gBAAgB;AAAA,MAChB,SAAS,CAAC;AAAA,MACV,iBAAiB,CAAC;AAAA,IACpB;AAAA,IACA,OAAO,EAAE,kBAAkB,GAAG,kBAAkB,EAAE;AAAA,IAClD,aAAa;AAAA,IACb,WAAW;AAAA,EACb;AACF;AAEO,SAAS,gBAAgB,OAAiC;AAC/D,QAAM,KAAK,MAAM;AACjB,QAAM,cAAc,KAAK,IAAI,GAAG,EAAE,IAAI;AACtC,SAAO,IAAI,EAAE;AACf;AAEO,SAAS,cAAc,OAAiC;AAC7D,QAAM,KAAK,MAAM;AACjB,QAAM,YAAY,KAAK,IAAI,GAAG,EAAE,IAAI;AACpC,SAAO,IAAI,EAAE;AACf;AAEO,SAAS,UACd,OACA,SAC8B;AAC9B,SAAO,MAAM,OAAO,KAAK,CAAC,UAAU,MAAM,YAAY,OAAO;AAC/D;AAEO,SAAS,aAAa,OAA6C;AACxE,SAAO,MAAM,OAAO,OAAO,CAAC,UAAU,MAAM,MAAM;AACpD;AAEO,SAAS,kBAAkB,OAAsC;AACtE,QAAM,UAAU,oBAAI,IAAY;AAChC,aAAW,SAAS,MAAM,QAAQ;AAChC,QAAI,CAAC,MAAM,OAAQ;AACnB,eAAW,MAAM,MAAM,oBAAqB,SAAQ,IAAI,EAAE;AAAA,EAC5D;AACA,SAAO;AACT;AAEO,SAAS,kBAAkB,OAAwC;AACxE,MAAI,UAAyB;AAC7B,aAAW,SAAS,MAAM,QAAQ;AAChC,QAAI,MAAM,UAAU,MAAM,OAAO,QAAS,WAAU,MAAM;AAAA,EAC5D;AACA,SAAO;AACT;AAEO,SAAS,gBACd,OACA,oBACM;AACN,aAAW,SAAS,MAAM,QAAQ;AAChC,QAAI,CAAC,MAAM,OAAQ;AACnB,UAAM,iBAAiB;AACvB,QAAI,MAAM,iBAAiB,oBAAoB;AAC7C,YAAM,aAAa;AAAA,IACrB;AAAA,EACF;AACF;;;ACpEO,IAAM,iBAAiB;AAK9B,IAAM,oBAAoB;AAQnB,SAAS,iBAAiB,SAAyB;AACxD,SAAO,GAAG,iBAAiB,GAAG,OAAO;AACvC;AAEO,SAAS,mBAAmB,IAAqB;AACtD,SAAO,GAAG,WAAW,iBAAiB;AACxC;AAQO,SAAS,yBACd,SACS;AACT,SACE,mBAAmB,QAAQ,EAAE,KAC7B,QAAQ,SAAS,YACjB,QAAQ,gBAAgB;AAE5B;AAMO,SAAS,MACd,UACA,OACA,UAAwB,CAAC,GACV;AACf,QAAM,UAAU,kBAAkB,KAAK;AACvC,MAAI,QAAQ,SAAS,EAAG,QAAO,CAAC,GAAG,QAAQ;AAE3C,QAAM,SAAS,QAAQ,mBAAmB;AAC1C,QAAM,iBAAiB,SAAS;AAAA,IAC9B,CAAC,YAAY,QAAQ,SAAS;AAAA,EAChC;AAEA,QAAM,YAAY,oBAAI,IAAoB;AAC1C,QAAM,mBAAmB,oBAAI,IAAoB;AACjD,WAAS,QAAQ,CAAC,SAAS,UAAU;AACnC,cAAU,IAAI,QAAQ,IAAI,KAAK;AAC/B,QAAI,yBAAyB,OAAO;AAClC,uBAAiB,IAAI,QAAQ,IAAI,KAAK;AAAA,EAC1C,CAAC;AAED,QAAM,UAAU,SACZ,sBAAsB,OAAO,WAAW,gBAAgB,IACxD,CAAC;AAEL,SAAO;AAAA,IACL;AAAA,MACE;AAAA,QACE,gBAAgB,UAAU,SAAS,gBAAgB,OAAO;AAAA,MAC5D;AAAA,IACF;AAAA,EACF;AACF;AASA,SAAS,sBACP,OACA,WACA,kBACiB;AACjB,QAAM,UAA2B,CAAC;AAClC,aAAW,SAAS,aAAa,KAAK,GAAG;AAIvC,UAAM,gBAAgB,iBAAiB,IAAI,iBAAiB,MAAM,OAAO,CAAC;AAC1E,QAAI,kBAAkB,QAAW;AAC/B,cAAQ,KAAK;AAAA,QACX,SAAS,MAAM;AAAA,QACf,SAAS,MAAM;AAAA,QACf,OAAO,MAAM;AAAA,QACb,UAAU;AAAA,MACZ,CAAC;AACD;AAAA,IACF;AACA,QAAI,WAA0B;AAC9B,eAAW,MAAM,MAAM,qBAAqB;AAC1C,YAAM,QAAQ,UAAU,IAAI,EAAE;AAC9B,UAAI,UAAU,WAAc,aAAa,QAAQ,QAAQ,WAAW;AAClE,mBAAW;AAAA,MACb;AAAA,IACF;AACA,YAAQ,KAAK;AAAA,MACX,SAAS,MAAM;AAAA,MACf,SAAS,MAAM;AAAA,MACf,OAAO,MAAM;AAAA,MACb,UAAU,YAAY;AAAA,IACxB,CAAC;AAAA,EACH;AACA,UAAQ,KAAK,CAAC,MAAM,UAAU,KAAK,WAAW,MAAM,QAAQ;AAC5D,SAAO;AACT;AAEA,SAAS,gBACP,UACA,SACA,gBACA,SACe;AACf,QAAM,SAAwB,CAAC;AAC/B,QAAM,UAAU,CAAC,GAAG,OAAO;AAC3B,QAAM,qBAAqB,IAAI;AAAA,IAC7B,QAAQ,IAAI,CAAC,WAAW,iBAAiB,OAAO,OAAO,CAAC;AAAA,EAC1D;AAEA,WAAS,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS;AACpD,WAAO,QAAQ,SAAS,KAAK,QAAQ,CAAC,EAAG,aAAa,OAAO;AAC3D,aAAO,KAAK,cAAc,QAAQ,MAAM,CAAE,CAAC;AAAA,IAC7C;AACA,QAAI,UAAU,kBAAkB,kBAAkB,GAAG;AACnD,aAAO,KAAK,SAAS,KAAK,CAAE;AAC5B;AAAA,IACF;AACA,QAAI,QAAQ,IAAI,SAAS,KAAK,EAAG,EAAE,EAAG;AAKtC,QACE,yBAAyB,SAAS,KAAK,CAAE,KACzC,mBAAmB,IAAI,SAAS,KAAK,EAAG,EAAE;AAE1C;AACF,WAAO,KAAK,SAAS,KAAK,CAAE;AAAA,EAC9B;AAEA,SAAO,QAAQ,SAAS,GAAG;AACzB,WAAO,KAAK,cAAc,QAAQ,MAAM,CAAE,CAAC;AAAA,EAC7C;AAEA,SAAO;AACT;AAEA,SAAS,cAAc,QAAoC;AACzD,QAAM,OAAO,OAAO,QAAQ,KAAK;AACjC,QAAM,YAAY,OAAO,QACrB,GAAG,cAAc,WAAM,OAAO,KAAK,KACnC;AACJ,QAAM,OAAO,KAAK,WAAW,IAAI,YAAY,GAAG,SAAS;AAAA,EAAK,IAAI;AAClE,SAAO;AAAA,IACL,IAAI,iBAAiB,OAAO,OAAO;AAAA,IACnC,MAAM;AAAA,IACN,aAAa;AAAA,IACb;AAAA,EACF;AACF;AAEA,SAAS,yBAAyB,UAAwC;AACxE,QAAM,eAAe,oBAAI,IAAY;AACrC,aAAW,KAAK,UAAU;AACxB,QAAI,EAAE,gBAAgB,eAAe,EAAE,YAAY;AACjD,mBAAa,IAAI,EAAE,UAAU;AAAA,IAC/B;AAAA,EACF;AACA,SAAO,SAAS;AAAA,IACd,CAAC,MACC,EAAE,gBAAgB,iBAClB,CAAC,EAAE,cACH,aAAa,IAAI,EAAE,UAAU;AAAA,EACjC;AACF;AAEA,SAAS,uBAAuB,UAAwC;AACtE,QAAM,iBAAiB,oBAAI,IAAY;AACvC,aAAW,KAAK,UAAU;AACxB,QAAI,EAAE,gBAAgB,iBAAiB,EAAE,YAAY;AACnD,qBAAe,IAAI,EAAE,UAAU;AAAA,IACjC;AAAA,EACF;AACA,SAAO,SAAS;AAAA,IACd,CAAC,MACC,EAAE,gBAAgB,eAClB,CAAC,EAAE,cACH,EAAE,aAAa,cACf,eAAe,IAAI,EAAE,UAAU;AAAA,EACnC;AACF;AAcA,SAAS,uBAAuB,UAAwC;AACtE,QAAM,OAAO,oBAAI,IAAY;AAC7B,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,QAAI,KAAK,IAAI,CAAC,EAAG;AACjB,QAAI,SAAS,CAAC,EAAG,gBAAgB,YAAa;AAC9C,QAAI,IAAI;AACR,WACE,IAAI,IAAI,SAAS,UACjB,SAAS,IAAI,CAAC,EAAG,gBAAgB,aACjC;AACA;AAAA,IACF;AACA,UAAM,YAAY,SAAS,IAAI,CAAC;AAChC,UAAM,eACJ,cAAc,UACd,UAAU,SAAS,gBAClB,UAAU,gBAAgB,UACzB,UAAU,gBAAgB;AAC9B,QAAI,CAAC,cAAc;AACjB,eAAS,IAAI,GAAG,KAAK,GAAG,IAAK,MAAK,IAAI,CAAC;AAAA,IACzC;AAAA,EACF;AACA,MAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,SAAO,SAAS,OAAO,CAAC,GAAG,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC;AAC/C;;;AC5OO,SAAS,WACd,UACA,OACY;AACZ,QAAM,aAAa,IAAI,IAAI,SAAS,IAAI,CAAC,YAAY,QAAQ,EAAE,CAAC;AAChE,QAAM,cAAwB,CAAC;AAK/B,QAAM,SAA2B;AAAA,IAC/B,QAAQ,MAAM,OAAO,IAAI,CAAC,WAAW;AAAA,MACnC,GAAG;AAAA,MACH,kBAAkB,CAAC,GAAG,MAAM,gBAAgB;AAAA,MAC5C,qBAAqB,CAAC,GAAG,MAAM,mBAAmB;AAAA,MAClD,gBAAgB,CAAC,GAAG,MAAM,cAAc;AAAA,IAC1C,EAAE;AAAA,IACF,aAAa;AAAA,MACX,OAAO,EAAE,GAAG,MAAM,YAAY,MAAM;AAAA,MACpC,OAAO,EAAE,GAAG,MAAM,YAAY,MAAM;AAAA,IACtC;AAAA;AAAA,IAEA,eAAe,EAAE,GAAI,MAAM,iBAAiB,CAAC,EAAG;AAAA,IAChD,OAAO,EAAE,GAAG,MAAM,OAAO,SAAS,EAAE,GAAG,MAAM,MAAM,QAAQ,EAAE;AAAA,IAC7D,OAAO,EAAE,GAAG,MAAM,MAAM;AAAA,IACxB,aAAa,MAAM;AAAA,IACnB,WAAW,MAAM;AAAA,EACnB;AAKA,QAAM,WAAW,IAAI;AAAA,IACnB,SACG,IAAI,CAAC,MAAM,OAAO,YAAY,MAAM,EAAE,EAAE,CAAC,EACzC,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AAAA,EACrD;AACA,MAAI,OAAO,KAAK,OAAO,aAAa,EAAE,WAAW,SAAS,MAAM;AAC9D,UAAM,SAAiC,CAAC;AACxC,eAAW,CAAC,KAAK,CAAC,KAAK,OAAO,QAAQ,OAAO,aAAa,GAAG;AAC3D,UAAI,SAAS,IAAI,GAAG,EAAG,QAAO,GAAG,IAAI;AAAA,IACvC;AACA,WAAO,gBAAgB;AAAA,EACzB;AAEA,QAAM,mBAAmB,oBAAI,IAAY;AACzC,aAAW,SAAS,OAAO,QAAQ;AACjC,eAAW,cAAc,MAAM,gBAAgB;AAC7C,uBAAiB,IAAI,UAAU;AAAA,IACjC;AAAA,EACF;AAEA,aAAW,SAAS,OAAO,QAAQ;AACjC,QAAI,iBAAiB,IAAI,MAAM,OAAO,GAAG;AACvC,YAAM,SAAS;AACf;AAAA,IACF;AACA,UAAM,SAAS;AAKf,UAAM,eACJ,MAAM,oBAAoB,KAAK,CAAC,OAAO,WAAW,IAAI,EAAE,CAAC,KACzD,WAAW,IAAI,iBAAiB,MAAM,OAAO,CAAC;AAChD,QAAI,CAAC,cAAc;AACjB,YAAM,SAAS;AACf,kBAAY,KAAK,MAAM,OAAO;AAAA,IAChC;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,QAAQ,YAAY;AACtC;;;AC9EO,SAAS,cACd,mBACA,YAA6B,CAAC,GACtB;AACR,QAAM,OAAe;AAAA,IACnB,OAAO,EAAE,SAAS,MAAM,cAAc,GAAG,cAAc,GAAG;AAAA,IAC1D,OAAO;AAAA,MACL,oBAAoB;AAAA,MACpB,oBAAoB;AAAA,MACpB,WAAW;AAAA,MACX,oBAAoB;AAAA,MACpB,OAAO;AAAA,MACP,aAAa;AAAA,MACb,aAAa;AAAA,MACb,WAAW;AAAA,MACX,gBAAgB;AAAA,MAChB,gBAAgB;AAAA,MAChB,uBAAuB;AAAA,MACvB,uBAAuB;AAAA,IACzB;AAAA,IACA,oBAAoB;AAAA,IACpB,UAAU,EAAE,WAAW,KAAK;AAAA,IAC5B,UAAU;AAAA,MACR,kBAAkB;AAAA,MAClB,kBAAkB;AAAA,MAClB,kBAAkB;AAAA,IACpB;AAAA,IACA,gBAAgB,CAAC;AAAA,IACjB,wBAAwB;AAAA,IACxB,sBAAsB;AAAA,IACtB;AAAA,EACF;AACA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAG;AAAA,IACH,OAAO,EAAE,GAAG,KAAK,OAAO,GAAG,UAAU,MAAM;AAAA,IAC3C,OAAO,EAAE,GAAG,KAAK,OAAO,GAAG,UAAU,MAAM;AAAA,IAC3C,UAAU,EAAE,GAAG,KAAK,UAAU,GAAG,UAAU,SAAS;AAAA,IACpD,UAAU,EAAE,GAAG,KAAK,UAAU,GAAG,UAAU,SAAS;AAAA,EACtD;AACF;AAEO,SAAS,eAAe,QAA0B;AACvD,QAAM,SAAmB,CAAC;AAC1B,MACE,CAAC,OAAO,SAAS,OAAO,iBAAiB,KACzC,OAAO,qBAAqB,GAC5B;AACA,WAAO,KAAK,6CAA6C;AAAA,EAC3D;AACA,MAAI,OAAO,MAAM,qBAAqB,OAAO,MAAM,oBAAoB;AACrE,WAAO;AAAA,MACL;AAAA,IACF;AAAA,EACF;AACA,MAAI,OAAO,MAAM,qBAAqB,OAAO,MAAM,uBAAuB;AACxE,WAAO;AAAA,MACL;AAAA,IACF;AAAA,EACF;AACA,MAAI,OAAO,qBAAqB,GAAG;AACjC,WAAO,KAAK,iCAAiC;AAAA,EAC/C;AACA,MAAI,OAAO,SAAS,aAAa,KAAK,OAAO,SAAS,YAAY,GAAG;AACnE,WAAO,KAAK,sCAAsC;AAAA,EACpD;AACA,aAAW,QAAQ,CAAC,OAAO,MAAM,cAAc,OAAO,MAAM,YAAY,GAAG;AACzE,QAAI,OAAO,EAAG,QAAO,KAAK,4BAA4B;AAAA,EACxD;AACA,MAAI,OAAO,MAAM,gBAAgB,OAAO,MAAM,cAAc;AAC1D,WAAO,KAAK,4DAA4D;AAAA,EAC1E;AACA,SAAO;AACT;;;AC1DA,IAAM,sBAAsB;AAC5B,IAAM,oBAAoB;AAEnB,SAAS,cAAc,KAAoC;AAChE,QAAM,aAAa,IAAI,KAAK,EAAE,YAAY;AAC1C,QAAM,eAAe,oBAAoB,KAAK,UAAU;AACxD,MAAI,cAAc;AAChB,UAAM,YAAY,OAAO,aAAa,CAAC,CAAC;AACxC,QAAI,aAAa,KAAK,aAAa,OAAO;AACxC,aAAO,EAAE,MAAM,WAAW,WAAW,KAAK,WAAW;AAAA,IACvD;AAAA,EACF;AACA,QAAM,aAAa,kBAAkB,KAAK,UAAU;AACpD,MAAI,YAAY;AACd,UAAM,YAAY,OAAO,WAAW,CAAC,CAAC;AACtC,QAAI,aAAa,EAAG,QAAO,EAAE,MAAM,SAAS,WAAW,KAAK,WAAW;AAAA,EACzE;AACA,SAAO;AACT;AASO,IAAM,wBAAN,cAAoC,MAAM;AAAA,EACtC,OAAO;AAAA,EACP;AAAA,EACA;AAAA,EAET,YACE,MACA,UACA,SACA;AACA,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,WAAW;AAAA,EAClB;AACF;AAmBO,SAAS,kBACd,OACe;AACf,QAAM,QAAQ,cAAc,MAAM,QAAQ;AAC1C,QAAM,MAAM,cAAc,MAAM,MAAM;AACtC,MAAI,CAAC,SAAS,CAAC,KAAK;AAClB,UAAM,IAAI;AAAA,MACR,qCAAqC,MAAM,QAAQ,aAAa,MAAM,MAAM;AAAA,IAC9E;AAAA,EACF;AAEA,QAAM,mBAAmB,oBAAI,IAAoB;AACjD,QAAM,SAAS;AAAA,IAAQ,CAAC,SAAS,UAC/B,iBAAiB,IAAI,QAAQ,IAAI,KAAK;AAAA,EACxC;AAEA,MAAI,oBAA8B,CAAC;AACnC,QAAM,cAAc;AAAA,IAClB;AAAA,IACA,MAAM;AAAA,IACN;AAAA,IACA;AAAA,EACF;AACA,MAAI,YAAY,QAAS,mBAAkB,KAAK,YAAY,OAAO;AACnE,QAAM,YAAY;AAAA,IAChB;AAAA,IACA,MAAM;AAAA,IACN;AAAA,IACA;AAAA,EACF;AACA,MAAI,UAAU,QAAS,mBAAkB,KAAK,UAAU,OAAO;AAC/D,MAAI,aAAa,YAAY;AAC7B,MAAI,WAAW,UAAU;AAEzB,MAAI,aAAa,UAAU;AACzB,KAAC,YAAY,QAAQ,IAAI,CAAC,UAAU,UAAU;AAAA,EAChD;AAEA,QAAM,aAAuB,CAAC;AAC9B,WAAS,QAAQ,YAAY,SAAS,UAAU,SAAS;AACvD,UAAM,UAAU,MAAM,SAAS,KAAK;AAIpC,QAAI,WAAW,CAAC,yBAAyB,OAAO;AAC9C,iBAAW,KAAK,QAAQ,EAAE;AAAA,EAC9B;AAEA,QAAM,eACJ,MAAM,SAAS,WAAW,IAAI,SAAS,UAAU,UAAU;AAE7D,QAAM,iBAA2B,CAAC;AAClC,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,SAAS,aAAa,MAAM,KAAK,GAAG;AAC7C,QAAI,oBAAoB,OAAO,kBAAkB,YAAY,QAAQ,GAAG;AACtE,UAAI,CAAC,WAAW,IAAI,MAAM,OAAO,GAAG;AAClC,mBAAW,IAAI,MAAM,OAAO;AAC5B,uBAAe,KAAK,MAAM,OAAO;AAAA,MACnC;AAAA,IACF;AAAA,EACF;AAEA,QAAM,gBAA0B,CAAC;AAEjC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAOA,SAAS,mBACP,UACA,OACA,kBACA,UACkB;AAClB,QAAM,QAAQ,aAAa,UAAU,YAAY;AACjD,MAAI,SAAS,SAAS,WAAW;AAC/B,UAAM,QACJ,MAAM,YAAY,MAAM,SAAS,GAAG,KACpC,MAAM,YAAY,MAAM,gBAAgB,SAAS,SAAS,CAAC;AAC7D,QAAI,CAAC,OAAO;AACV,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,QACA,GAAG,KAAK,KAAK,SAAS,GAAG;AAAA,MAC3B;AAAA,IACF;AACA,UAAM,QAAQ,iBAAiB,IAAI,KAAK;AACxC,QAAI,UAAU,QAAW;AACvB,aAAO,EAAE,OAAO,SAAS,KAAK;AAAA,IAChC;AACA,UAAMA,SAAQ,kBAAkB,OAAO,CAAC,KAAK,GAAG,gBAAgB;AAChE,QAAIA,WAAU,MAAM;AAClB,aAAO;AAAA,QACL,OAAOA;AAAA,QACP,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG;AAAA,MACpC;AAAA,IACF;AACA,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,MACA,GAAG,KAAK,KAAK,SAAS,GAAG;AAAA,IAC3B;AAAA,EACF;AAEA,QAAM,QAAQ,UAAU,OAAO,IAAI,SAAS,SAAS,EAAE;AACvD,MAAI,CAAC,OAAO;AACV,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,MACA,GAAG,KAAK,MAAM,SAAS,SAAS;AAAA,IAClC;AAAA,EACF;AACA,MAAI,MAAM,QAAQ;AAChB,UAAM,SAAS,mBAAmB,OAAO,gBAAgB;AACzD,QAAI,WAAW,MAAM;AACnB,aAAO,EAAE,OAAO,QAAQ,SAAS,KAAK;AAAA,IACxC;AAAA,EACF;AACA,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA,MAAM;AAAA,IACN;AAAA,EACF;AACA,MAAI,UAAU,MAAM;AAClB,WAAO;AAAA,MACL,OAAO;AAAA,MACP,SAAS,GAAG,KAAK,MAAM,SAAS,SAAS;AAAA,IAC3C;AAAA,EACF;AACA,MAAI,CAAC,MAAM,QAAQ;AACjB,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,MACA,GAAG,KAAK,MAAM,SAAS,SAAS;AAAA,IAClC;AAAA,EACF;AACA,QAAM,IAAI;AAAA,IACR;AAAA,IACA;AAAA,IACA,GAAG,KAAK,MAAM,SAAS,SAAS;AAAA,EAClC;AACF;AAaA,SAAS,kBACP,OACA,UACA,kBACe;AACf,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,QAAM,QAAQ,IAAI,IAAI,QAAQ;AAC9B,MAAI,OAAsB;AAC1B,aAAW,SAAS,MAAM,QAAQ;AAChC,QAAI,CAAC,MAAM,OAAQ;AACnB,UAAM,YAAY,oBAAoB,OAAO,KAAK;AAClD,QAAI,gBAAgB;AACpB,eAAW,MAAM,OAAO;AACtB,UAAI,UAAU,IAAI,EAAE,GAAG;AACrB,wBAAgB;AAChB;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,cAAe;AACpB,UAAM,SAAS,mBAAmB,OAAO,gBAAgB;AACzD,QAAI,WAAW,KAAM;AACrB,QAAI,SAAS,QAAQ,SAAS,MAAM;AAClC,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAQA,SAAS,oBACP,OACA,OACa;AACb,QAAM,MAAM,oBAAI,IAAY;AAC5B,aAAW,WAAW,MAAM,gBAAgB;AAC1C,UAAM,QAAQ,UAAU,OAAO,OAAO;AACtC,QAAI,CAAC,MAAO;AACZ,eAAW,MAAM,MAAM,oBAAqB,KAAI,IAAI,EAAE;AAAA,EACxD;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,OAAuB;AAC9C,SAAO,IAAI,OAAO,KAAK,EAAE,SAAS,GAAG,GAAG,CAAC;AAC3C;AASO,SAAS,mBACd,OACA,kBACe;AACf,QAAM,eAAe,iBAAiB,IAAI,iBAAiB,MAAM,OAAO,CAAC;AACzE,MAAI,iBAAiB,OAAW,QAAO;AACvC,SAAO,mBAAmB,MAAM,qBAAqB,gBAAgB;AACvE;AAOO,SAAS,oBACd,OACA,kBACA,YACA,UACS;AACT,QAAM,eAAe,iBAAiB,IAAI,iBAAiB,MAAM,OAAO,CAAC;AACzE,MACE,iBAAiB,UACjB,gBAAgB,cAChB,gBAAgB,UAChB;AACA,WAAO;AAAA,EACT;AACA,QAAM,WAAW;AAAA,IACf,MAAM;AAAA,IACN;AAAA,EACF;AACA,SAAO,aAAa,QAAQ,YAAY,cAAc,YAAY;AACpE;AAEO,SAAS,mBACd,KACA,kBACe;AACf,MAAI,WAA0B;AAC9B,aAAW,MAAM,KAAK;AACpB,UAAM,QAAQ,iBAAiB,IAAI,EAAE;AACrC,QAAI,UAAU,WAAc,aAAa,QAAQ,QAAQ,WAAW;AAClE,iBAAW;AAAA,IACb;AAAA,EACF;AACA,SAAO;AACT;;;AC/UA,IAAM,oBAAoB;AAC1B,IAAM,WAAW;AAAA,EACb,iBAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,uBAAuB;AAC3B;AAEO,SAAS,yBACZ,UACA,YACA,QACA,aACA,UAA2B,CAAC,GACd;AACd,QAAM,OAAO,EAAE,GAAG,UAAU,GAAG,QAAQ;AACvC,MAAI,OAAO,qBAAqB,EAAG,QAAO,EAAE,UAAU,gBAAgB,GAAG,aAAa,EAAE;AAExF,QAAM,YAAY,OAAO,SAAS,YAAY,OAAO;AACrD,MAAI,aAAa,UAAW,QAAO,EAAE,UAAU,gBAAgB,GAAG,aAAa,EAAE;AAEjF,QAAM,iBAAiB,SAAS,SAAS,KAAK;AAC9C,QAAM,aAAuD,CAAC;AAE9D,WAAS,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS;AAClD,QAAI,SAAS,eAAgB;AAC7B,UAAM,UAAU,SAAS,KAAK;AAC9B,QAAI,QAAQ,gBAAgB,cAAe;AAC3C,UAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAI,KAAK,WAAW,KAAK,KAAK,SAAS,iBAAiB,EAAG;AAC3D,UAAM,SAAS,YAAY,IAAI;AAC/B,QAAI,SAAS,KAAK,gBAAiB;AACnC,eAAW,KAAK,EAAE,OAAO,OAAO,CAAC;AAAA,EACrC;AAEA,MAAI,WAAW,WAAW,EAAG,QAAO,EAAE,UAAU,gBAAgB,GAAG,aAAa,EAAE;AAClF,aAAW,KAAK,CAAC,MAAM,UAAU,MAAM,SAAS,KAAK,MAAM;AAE3D,QAAM,eAAe,YAAY;AACjC,MAAI,cAAc;AAClB,QAAM,QAAQ,oBAAI,IAAoB;AACtC,MAAI,iBAAiB;AAErB,aAAW,aAAa,YAAY;AAChC,QAAI,aAAa,eAAe,aAAc;AAC9C,UAAM,WAAW,SAAS,UAAU,KAAK,EAAG,QAAQ;AACpD,QAAI,SAAS,UAAU,KAAK,kBAAkB,KAAK,gBAAiB;AAEpE,UAAM,SAAS,SAAS,MAAM,GAAG,KAAK,eAAe;AACrD,UAAM,SAAS,SAAS,MAAM,CAAC,KAAK,eAAe;AACnD,UAAM,cACF,SACA;AAAA;AAAA,KAAU,iBAAiB,qBAAgB,UAAU,MAAM;AAAA;AAAA,IAC3D;AACJ,UAAM,IAAI,UAAU,OAAO,WAAW;AACtC,mBAAe,UAAU,SAAS,YAAY,WAAW;AACzD;AAAA,EACJ;AAEA,MAAI,mBAAmB,EAAG,QAAO,EAAE,UAAU,gBAAgB,GAAG,aAAa,EAAE;AAE/E,QAAM,UAAU,SAAS;AAAA,IAAI,CAAC,SAAS,UACnC,MAAM,IAAI,KAAK,IAAI,EAAE,GAAG,SAAS,MAAM,MAAM,IAAI,KAAK,EAAG,IAAI;AAAA,EACjE;AACA,SAAO,EAAE,UAAU,SAAS,gBAAgB,YAAY;AAC5D;;;ACtEA,IAAM,qBAAqB;AAO3B,SAAS,SAAS,UAAkB,QAAwB;AACxD,SAAO,GAAG,QAAQ,KAAK,MAAM;AACjC;AAEA,SAAS,oBAAoB,MAA0B,UAAsC;AACzF,MAAI;AACJ,MAAI;AACA,aAAS,KAAK,MAAM,QAAQ,EAAE;AAAA,EAClC,QAAQ;AACJ,WAAO;AAAA,EACX;AACA,MAAI,CAAC,UAAU,OAAO,WAAW,SAAU,QAAO;AAClD,QAAM,MAAM;AACZ,QAAM,UAAU,IAAI;AACpB,MAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,QAAQ,WAAW,EAAG,QAAO;AAE5D,QAAM,OAAO,QAAQ,OAAO,CAAC,UAA4C;AACrE,QAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,UAAM,IAAI,OAAO,MAAM,YAAY,WAAW,MAAM,UAAU,OAAO,MAAM,cAAc,WAAW,MAAM,YAAY;AACtH,UAAM,IAAI,OAAO,MAAM,UAAU,WAAW,MAAM,QAAQ,OAAO,MAAM,cAAc,WAAW,MAAM,YAAY;AAClH,WAAO,SAAS,IAAI,SAAS,GAAG,CAAC,CAAC;AAAA,EACtC,CAAC;AAED,MAAI,KAAK,WAAW,QAAQ,UAAU,KAAK,WAAW,EAAG,QAAO;AAEhE,SAAO,KAAK,UAAU,EAAE,GAAG,KAAK,SAAS,KAAK,CAAC;AACnD;AAEO,SAAS,0BACZ,OACA,UACkB;AAClB,QAAM,kBAAkB,oBAAI,IAAY;AACxC,QAAM,gBAAgB,oBAAI,IAAY;AACtC,QAAM,wBAAwB,oBAAI,IAAyB;AAC3D,QAAM,qBAAqB,oBAAI,IAAY;AAC3C,aAAW,SAAS,MAAM,QAAQ;AAC9B,QAAI,CAAC,MAAM,eAAgB;AAC3B,oBAAgB,IAAI,MAAM,cAAc;AACxC,QAAI,CAAC,MAAM,OAAQ;AACnB,kBAAc,IAAI,MAAM,cAAc;AACtC,QAAI,MAAM,aAAa,UAAa,MAAM,WAAW,QAAW;AAC5D,yBAAmB,IAAI,MAAM,cAAc;AAC3C;AAAA,IACJ;AACA,QAAI,OAAO,sBAAsB,IAAI,MAAM,cAAc;AACzD,QAAI,CAAC,MAAM;AACP,aAAO,oBAAI,IAAY;AACvB,4BAAsB,IAAI,MAAM,gBAAgB,IAAI;AAAA,IACxD;AACA,SAAK,IAAI,SAAS,MAAM,UAAU,MAAM,MAAM,CAAC;AAAA,EACnD;AAEA,QAAM,sBAAgC,CAAC;AACvC,WAAS,IAAI,SAAS,SAAS,GAAG,KAAK,KAAK,oBAAoB,SAAS,oBAAoB,KAAK;AAC9F,UAAM,UAAU,SAAS,CAAC;AAC1B,QAAI,QAAQ,aAAa,cAAc,QAAQ,gBAAgB,YAAa;AAC5E,UAAM,SAAS,QAAQ;AACvB,QAAI,UAAU,CAAC,gBAAgB,IAAI,MAAM,GAAG;AACxC,0BAAoB,KAAK,MAAM;AAAA,IACnC;AAAA,EACJ;AAEA,QAAM,cAAc,oBAAI,IAAI,CAAC,GAAG,eAAe,GAAG,mBAAmB,CAAC;AAEtE,QAAM,gBAAgB,oBAAI,IAAY;AACtC,aAAW,WAAW,UAAU;AAC5B,QACI,QAAQ,aAAa,cACrB,QAAQ,gBAAgB,gBACvB,CAAC,QAAQ,cAAc,CAAC,YAAY,IAAI,QAAQ,UAAU,IAC7D;AACE,UAAI,QAAQ,WAAY,eAAc,IAAI,QAAQ,UAAU;AAAA,IAChE;AAAA,EACJ;AAEA,MAAI,SAAS;AACb,QAAM,SAAwB,CAAC;AAC/B,aAAW,WAAW,UAAU;AAC5B,QACI,QAAQ,aAAa,cACrB,QAAQ,gBAAgB,gBACvB,CAAC,QAAQ,cAAc,CAAC,YAAY,IAAI,QAAQ,UAAU,IAC7D;AACE;AACA;AAAA,IACJ;AACA,QACI,QAAQ,gBAAgB,iBACxB,QAAQ,cACR,cAAc,IAAI,QAAQ,UAAU,GACtC;AACE;AACA;AAAA,IACJ;AACA,QACI,QAAQ,aAAa,cACrB,QAAQ,gBAAgB,eACxB,QAAQ,cACR,YAAY,IAAI,QAAQ,UAAU,GACpC;AACE,YAAM,WAAW,sBAAsB,IAAI,QAAQ,UAAU;AAC7D,UAAI,YAAY,SAAS,OAAO,KAAK,CAAC,mBAAmB,IAAI,QAAQ,UAAU,GAAG;AAC9E,cAAM,YAAY,oBAAoB,QAAQ,MAAM,QAAQ;AAC5D,YAAI,cAAc,MAAM;AACpB,iBAAO,KAAK,EAAE,GAAG,SAAS,MAAM,UAAU,CAAC;AAC3C;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,WAAO,KAAK,OAAO;AAAA,EACvB;AAEA,SAAO,EAAE,UAAU,QAAQ,OAAO;AACtC;;;ACjIA,IAAM,WAAW,oBAAI,IAA2B;AAEzC,SAAS,sBAAsB,QAA6B;AAC/D,QAAM,WAAW,SAAS,IAAI,OAAO,IAAI;AACzC,MAAI,YAAY,SAAS,YAAY,OAAO,SAAS;AACjD,UAAM,IAAI;AAAA,MACN,mBAAmB,OAAO,IAAI,qCAAqC,SAAS,OAAO,6BAA6B,OAAO,OAAO;AAAA,IAClI;AAAA,EACJ;AACA,WAAS,IAAI,OAAO,MAAM,MAAM;AACpC;AAEO,SAAS,iBAAiB,MAAyC;AACtE,SAAO,SAAS,IAAI,IAAI;AAC5B;AAEO,SAAS,qBAAsC;AAClD,SAAO,CAAC,GAAG,SAAS,OAAO,CAAC;AAChC;AAEO,SAAS,sBAA4B;AACxC,WAAS,MAAM;AACnB;;;ACbO,SAAS,oBACZ,UACA,QACW;AACX,MAAI,CAAC,QAAQ,SAAS;AAClB,WAAO,EAAE,UAAU,eAAe,GAAG,cAAc,GAAG,eAAe,EAAE;AAAA,EAC3E;AAEA,QAAM,SAAS,mBAAmB,EAAE;AAAA,IAChC,CAAC,WAAW,OAAO,UAAU,OAAO,IAAI,GAAG,YAAY;AAAA,EAC3D;AACA,MAAI,OAAO,WAAW,GAAG;AACrB,WAAO,EAAE,UAAU,eAAe,GAAG,cAAc,GAAG,eAAe,EAAE;AAAA,EAC3E;AAEA,MAAI,UAAU,SAAS,IAAI,CAAC,aAAa,EAAE,GAAG,QAAQ,EAAE;AACxD,QAAM,QAAQ,EAAE,eAAe,GAAG,cAAc,GAAG,eAAe,EAAE;AACpE,QAAM,QAAQ,QAAQ;AAEtB,QAAM,YAAY,OAAO,OAAO,CAAC,WAAW,CAAC,OAAO,YAAY;AAChE,WAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS;AACjD,UAAM,UAAU,QAAQ,KAAK;AAC7B,UAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAI,KAAK,WAAW,EAAG;AACvB,QAAI,UAAU;AACd,UAAM,UAAgC;AAAA,MAClC,MAAM;AAAA,MACN,MAAM,QAAQ;AAAA,MACd,cAAc;AAAA,MACd,eAAe;AAAA,MACf,UAAU,QAAQ;AAAA,IACtB;AACA,eAAW,UAAU,WAAW;AAC5B,UAAI;AACJ,UAAI;AACA,mBAAW,OAAO,OAAO,OAAO;AAAA,MACpC,QAAQ;AACJ;AAAA,MACJ;AACA,UAAI,SAAS,WAAW,OAAQ;AAChC,YAAM;AACN,UAAI,SAAS,WAAW,QAAQ;AAC5B,kBAAU;AACV,cAAM;AAAA,MACV,WAAW,SAAS,WAAW,YAAY,SAAS,SAAS,QAAW;AACpE,kBAAU,SAAS;AACnB,cAAM;AAAA,MACV;AACA,cAAQ,OAAO;AAAA,IACnB;AACA,QAAI,YAAY,KAAM,SAAQ,KAAK,IAAI,EAAE,GAAG,SAAS,MAAM,QAAQ;AAAA,EACvE;AAEA,QAAM,WAAW,OAAO,OAAO,CAAC,WAAW,OAAO,YAAY;AAC9D,aAAW,UAAU,UAAU;AAC3B,QAAI,YAAY;AAChB,aAAS,QAAQ,QAAQ,SAAS,GAAG,SAAS,GAAG,SAAS;AACtD,YAAM,UAAU,QAAQ,KAAK;AAC7B,YAAM,OAAO,QAAQ,QAAQ;AAC7B,UAAI,KAAK,WAAW,EAAG;AACvB,YAAM,MAA4B;AAAA,QAC9B;AAAA,QACA,MAAM,QAAQ;AAAA,QACd,cAAc;AAAA,QACd,eAAe;AAAA,QACf,UAAU,QAAQ;AAAA,MACtB;AACA,UAAI;AACJ,UAAI;AACA,mBAAW,OAAO,OAAO,GAAG;AAAA,MAChC,QAAQ;AACJ;AAAA,MACJ;AACA,UAAI,SAAS,WAAW,UAAU,SAAS,WAAW,SAAU;AAChE,UAAI,WAAW;AACX,cAAM;AACN,cAAM;AACN,gBAAQ,KAAK,IAAI,EAAE,GAAG,SAAS,MAAM,GAAG;AAAA,MAC5C,OAAO;AACH,oBAAY;AACZ,YAAI,SAAS,WAAW,YAAY,SAAS,SAAS,QAAW;AAC7D,gBAAM;AACN,gBAAM;AACN,kBAAQ,KAAK,IAAI,EAAE,GAAG,SAAS,MAAM,SAAS,KAAK;AAAA,QACvD;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAEA,SAAO,EAAE,UAAU,SAAS,GAAG,MAAM;AACzC;;;ACnFA,SAAS,aAAa,QAAwB;AAC5C,MAAI,SAAS,IAAM,QAAO,OAAO,MAAM;AACvC,MAAI,SAAS,IAAO,SAAQ,SAAS,KAAM,QAAQ,CAAC,IAAI;AACxD,SAAO,KAAK,MAAM,SAAS,GAAI,IAAI;AACrC;AAEA,SAAS,aAAa,SAA8B;AAClD,MACE,QAAQ,gBAAgB,eACxB,QAAQ,gBAAgB,eACxB;AACA,WAAO,QAAQ,YAAY;AAAA,EAC7B;AACA,SAAO,QAAQ;AACjB;AAEA,SAAS,YAAY,GAAmB;AACtC,SAAO,EAAE,QAAQ,uBAAuB,MAAM;AAChD;AAEA,IAAM,KAAK;AACX,IAAM,KAAK;AACX,IAAM,WAAW,KAAK;AACtB,IAAM,YAAY,KAAK,SAAS;AAEhC,SAAS,OAAO,KAAa,QAAgB,MAAsB;AACjE,SAAO,WAAW,aAAa,aAAa,MAAM,IAAI,aAAa,OAAO,MAAM,KAAK,MAAM;AAC7F;AAEA,SAAS,cACP,SACA,KACA,aACA,UACA,WAA0C,MAC7B;AACb,QAAM,MAAM,UAAU,KAAK,QAAQ,EAAE;AACrC,MAAI,CAAC,OAAO,QAAQ,YAAa,QAAO;AAGxC,MAAI,aAAa,OAAQ,QAAO;AAGhC,MAAI,aAAa,eAAe,QAAQ,gBAAgB,QAAQ;AAC9D,WAAO;AAAA,EACT;AAIA,QAAM,WAAW,IAAI;AAAA,IACnB,MAAM,YAAY,QAAQ,IAAI,UAAU,KAAK,YAAY,GAAG,IAAI,YAAY,SAAS,IAAI;AAAA,EAC3F;AACA,QAAM,aAAa,QAAQ,QAAQ,IAAI,QAAQ,UAAU,EAAE;AAI3D,QAAM,SAAS,WACV,SAAS,GAAG,MAAM,SAAS,GAAG,IAAI,YAAY,SAAS,KACxD,YAAY,SAAS;AACzB,QAAM,OAAO,aAAa,OAAO;AACjC,QAAM,SAAS,OAAO,KAAK,QAAQ,IAAI,IAAI;AAE3C,MAAI,CAAC,UAAW,QAAO,EAAE,GAAG,SAAS,MAAM,OAAO;AAClD,SAAO,EAAE,GAAG,SAAS,MAAM,SAAS,UAAU;AAChD;AAEO,SAAS,kBACd,UACA,OACA,cAAwC,CAAC,SACvC,KAAK,KAAK,KAAK,SAAS,CAAC,GAC3B,WAA2B,OACZ;AAEf,QAAM,MAAM,MAAM;AAClB,SAAO,SAAS;AAAA,IAAI,CAAC,YACnB,cAAc,SAAS,KAAK,aAAa,QAAQ;AAAA,EACnD;AACF;AAWO,SAAS,mBACd,UACA,OACA,cAAwC,CAAC,SAAS,KAAK,KAAK,KAAK,SAAS,CAAC,GAC3E,WAA2B,OACD;AAC1B,QAAM,MAAM,MAAM;AAClB,QAAM,WAAW,EAAE,GAAI,MAAM,iBAAiB,CAAC,EAAG;AAClD,QAAM,WAAW,SAAS;AAAA,IAAI,CAAC,YAC7B,cAAc,SAAS,KAAK,aAAa,UAAU,QAAQ;AAAA,EAC7D;AACA,SAAO,EAAE,UAAU,UAAU,eAAe,SAAS;AACvD;AAGO,SAAS,qBAAqB,UAAwC;AAC3E,SAAO;AAAA,IACL,MAAM;AAAA,IACN,IAAI,IAAY,KAA8B;AAC5C,YAAM,EAAE,UAAU,cAAc,IAAI;AAAA,QAClC,GAAG;AAAA,QACH,GAAG;AAAA,QACH,IAAI;AAAA,QACJ;AAAA,MACF;AAGA,YAAM,OAAO,GAAG,MAAM;AACtB,YAAM,UACJ,CAAC,QAAQ,OAAO,KAAK,aAAa,EAAE,WAAW,OAAO,KAAK,IAAI,EAAE;AACnE,aAAO,UACH,EAAE,GAAG,IAAI,UAAU,OAAO,EAAE,GAAG,GAAG,OAAO,cAAc,EAAE,IACzD,EAAE,GAAG,IAAI,SAAS;AAAA,IACxB;AAAA,EACF;AACF;AAGO,IAAM,iBAA+B,qBAAqB,KAAK;;;AC1I/D,IAAM,yBAAyB,CAAC,UAAU;AAqB1C,IAAM,8BAA8B;AAAA,EACzC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAKO,SAAS,sBAAsB,KAA2B;AAC/D,MAAI,IAAI,gBAAgB,eAAe,IAAI,gBAAgB,eAAe;AACxE,WAAO;AAAA,EACT;AACA,MAAI,CAAC,IAAI,SAAU,QAAO;AAC1B,SAAQ,4BAAkD,SAAS,IAAI,QAAQ;AACjF;AAEO,SAAS,iBAAiB,UAAkB,SAA0B;AAC3E,MAAI,QAAQ,SAAS,GAAG,GAAG;AACzB,WAAO,SAAS,WAAW,QAAQ,MAAM,GAAG,EAAE,CAAC;AAAA,EACjD;AACA,SAAO,aAAa;AACtB;AAEO,SAAS,mBACd,KACA,QACS;AAGT,MACG,IAAI,gBAAgB,eAAe,IAAI,gBAAgB,iBACxD,CAAC,IAAI,UACL;AACA,WAAO;AAAA,EACT;AAGA,MAAK,uBAA6C,SAAS,IAAI,QAAQ,GAAG;AACxE,WAAO;AAAA,EACT;AAEA,aAAW,WAAW,OAAO,gBAAgB;AAC3C,QAAI,iBAAiB,IAAI,UAAU,OAAO,EAAG,QAAO;AAAA,EACtD;AAEA,MAAI,OAAO,kBAAkB,IAAI,UAAU,IAAI,IAAI,EAAG,QAAO;AAE7D,SAAO;AACT;AAMO,SAAS,4BACd,UACA,QACa;AACb,QAAM,MAAM,oBAAI,IAAY;AAC5B,aAAW,KAAK,UAAU;AACxB,QAAI,EAAE,gBAAgB,eAAe,EAAE,cAAc,mBAAmB,GAAG,MAAM,GAAG;AAClF,UAAI,IAAI,EAAE,UAAU;AAAA,IACtB;AAAA,EACF;AACA,SAAO;AACT;AAIO,SAAS,8BACd,KACA,QACA,kBACS;AACT,MAAI,mBAAmB,KAAK,MAAM,EAAG,QAAO;AAC5C,MACE,IAAI,gBAAgB,iBACpB,IAAI,cACJ,iBAAiB,IAAI,IAAI,UAAU,GACnC;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;;;ACjGO,SAAS,6BACZ,YACA,UACA,UACA,UAAkB,IACsB;AAGxC,QAAM,iBAAiB,oBAAI,IAAY;AACvC,WAAS,IAAI,YAAY,KAAK,UAAU,KAAK;AACzC,UAAM,MAAM,SAAS,CAAC;AACtB,QAAI,CAAC,OAAO,CAAC,IAAI,WAAY;AAC7B,QAAI,IAAI,aAAa,WAAY;AACjC,mBAAe,IAAI,IAAI,UAAU;AAAA,EACrC;AAEA,MAAI,eAAe,SAAS,GAAG;AAC3B,WAAO,EAAE,YAAY,SAAS;AAAA,EAClC;AAIA,MAAI,cAAc;AAClB,WAAS,IAAI,WAAW,GAAG,IAAI,SAAS,UAAU,KAAK,WAAW,SAAS,KAAK;AAC5E,UAAM,MAAM,SAAS,CAAC;AACtB,QAAI,CAAC,IAAK;AACV,QAAI,IAAI,cAAc,eAAe,IAAI,IAAI,UAAU,GAAG;AACtD,oBAAc;AAAA,IAClB,WAAW,cAAc,UAAU;AAC/B;AAAA,IACJ;AAAA,EACJ;AAGA,MAAI,gBAAgB;AACpB,WAAS,IAAI,aAAa,GAAG,KAAK,KAAK,KAAK,aAAa,SAAS,KAAK;AACnE,UAAM,MAAM,SAAS,CAAC;AACtB,QAAI,CAAC,IAAK;AACV,QAAI,IAAI,cAAc,eAAe,IAAI,IAAI,UAAU,GAAG;AACtD,sBAAgB;AAAA,IACpB,WAAW,gBAAgB,YAAY;AACnC;AAAA,IACJ;AAAA,EACJ;AAEA,SAAO,EAAE,YAAY,eAAe,UAAU,YAAY;AAC9D;;;ACjCO,SAAS,kCACd,YACA,UACA,UAC0C;AAC1C,MAAI,aAAa,UAAU;AACzB,WAAO,EAAE,YAAY,SAAS;AAAA,EAChC;AACA,MAAI,gBAAgB;AACpB,MAAI,cAAc;AAElB,WAAS,IAAI,YAAY,KAAK,YAAY,IAAI,SAAS,QAAQ,KAAK;AAClE,UAAM,MAAM,SAAS,CAAC;AACtB,QAAI,CAAC,IAAK;AAEV,QAAI,IAAI,gBAAgB,aAAa;AAGnC,UAAI,IAAI;AACR,aACE,IAAI,IAAI,SAAS,UACjB,SAAS,IAAI,CAAC,EAAG,gBAAgB,aACjC;AACA;AAAA,MACF;AACA,YAAM,YAAY,SAAS,IAAI,CAAC;AAChC,UACE,cAAc,UACd,UAAU,SAAS,gBAClB,UAAU,gBAAgB,UACzB,UAAU,gBAAgB,gBAC5B,IAAI,IAAI,aACR;AACA,sBAAc,IAAI;AAAA,MACpB;AAAA,IACF;AAEA,QACE,IAAI,SAAS,gBACZ,IAAI,gBAAgB,UAAU,IAAI,gBAAgB,cACnD;AAGA,UAAI,IAAI,IAAI;AACZ,aAAO,KAAK,KAAK,SAAS,CAAC,EAAG,gBAAgB,aAAa;AACzD;AAAA,MACF;AACA,YAAM,WAAW,IAAI;AACrB,UACE,WAAW,KACX,YAAY,KACZ,SAAS,QAAQ,EAAG,gBAAgB,eACpC,WAAW,eACX;AACA,wBAAgB;AAAA,MAClB;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,YAAY,eAAe,UAAU,YAAY;AAC5D;;;AC3DA,SAAS,OAAO,KAAqB;AACnC,QAAM,IAAI,SAAS,IAAI,MAAM,CAAC,GAAG,EAAE;AACnC,SAAO,OAAO,MAAM,CAAC,IAAI,KAAK;AAChC;AAIA,SAAS,mBAAmB,MAAsB;AAChD,SAAO,KAAK,KAAK,KAAK,SAAS,CAAC;AAClC;AAEA,SAAS,cAAc,SAA+B;AACpD,SAAO,QAAQ,gBAAgB,eAAe,QAAQ,gBAAgB;AACxE;AAGA,SAAS,oBACP,SACA,OACS;AACT,MAAI,QAAQ,MAAM,WAAW,mCAAmC,EAAG,QAAO;AAC1E,aAAW,SAAS,MAAM,QAAQ;AAChC,QAAI,MAAM,UAAU,MAAM,oBAAoB,SAAS,QAAQ,EAAE,EAAG,QAAO;AAAA,EAC7E;AACA,SAAO;AACT;AAcO,SAAS,qBACd,UACA,OACA,QACA,cAAwC,oBAC3B;AACb,QAAM,YAAY,OAAO;AACzB,QAAM,iBAAiB,OAAO;AAE9B,QAAM,SAAS,oBAAI,IAAY;AAC/B,QAAM,UAA6C,CAAC;AAEpD,aAAW,OAAO,UAAU;AAC1B,QAAI,oBAAoB,KAAK,KAAK,EAAG;AAMrC,QAAI,sBAAsB,GAAG,EAAG;AAChC,UAAM,MAAM,MAAM,YAAY,MAAM,IAAI,EAAE;AAC1C,QAAI,CAAC,OAAO,QAAQ,UAAW;AAC/B,YAAQ,KAAK,EAAE,KAAK,QAAQ,YAAY,IAAI,QAAQ,EAAE,EAAE,CAAC;AAAA,EAC3D;AAGA,MAAI,YAAY,GAAG;AACjB,eAAW,KAAK,QAAQ,MAAM,CAAC,SAAS,GAAG;AACzC,aAAO,IAAI,EAAE,GAAG;AAAA,IAClB;AAAA,EACF;AAGA,MAAI,iBAAiB,GAAG;AACtB,QAAI,aAAa;AACjB,aAAS,IAAI,QAAQ,SAAS,GAAG,KAAK,KAAK,aAAa,gBAAgB,KAAK;AAC3E,aAAO,IAAI,QAAQ,CAAC,EAAG,GAAG;AAC1B,oBAAc,QAAQ,CAAC,EAAG;AAAA,IAC5B;AAAA,EACF;AAWA,MAAI,YAAY,GAAG;AACjB,aAAS,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;AAC7C,YAAM,MAAM,SAAS,CAAC;AACtB,UAAI,IAAI,SAAS,UAAU,oBAAoB,KAAK,KAAK,EAAG;AAC5D,YAAM,MAAM,MAAM,YAAY,MAAM,IAAI,EAAE;AAC1C,UAAI,OAAO,QAAQ,UAAW,QAAO,IAAI,GAAG;AAC5C;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAgBO,SAAS,wBACd,UACA,OACA,QACA,mBACA,cAAwC,oBACzB;AACf,QAAM,mBAOA,CAAC;AACP,QAAM,gBAKA,CAAC;AAIP,QAAM,mBAAmB,4BAA4B,UAAU,MAAM;AAErE,aAAW,OAAO,UAAU;AAC1B,QAAI,oBAAoB,KAAK,KAAK,EAAG;AACrC,UAAM,MAAM,MAAM,YAAY,MAAM,IAAI,EAAE;AAC1C,QAAI,CAAC,OAAO,QAAQ,UAAW;AAE/B,UAAM,KAAK,OAAO,GAAG;AAErB,QAAI,8BAA8B,KAAK,QAAQ,gBAAgB,GAAG;AAChE,oBAAc,KAAK;AAAA,QACjB;AAAA,QACA,QAAQ;AAAA,QACR,QAAQ,YAAY,IAAI,QAAQ,EAAE;AAAA,QAClC,OAAO,IAAI,WAAW,CAAC,IAAI,QAAQ,IAAI,CAAC;AAAA,MAC1C,CAAC;AACD;AAAA,IACF;AAEA,QAAI,mBAAmB,IAAI,GAAG,GAAG;AAC/B;AAAA,IACF;AAEA,qBAAiB,KAAK;AAAA,MACpB;AAAA,MACA,QAAQ;AAAA,MACR,QAAQ,YAAY,IAAI,QAAQ,EAAE;AAAA,MAClC,QAAQ,IAAI,QAAQ,IAAI;AAAA,MACxB,QAAQ,cAAc,GAAG;AAAA,MACzB,QAAQ,IAAI,SAAS;AAAA,IACvB,CAAC;AAAA,EACH;AAQA,QAAM,eAAoC,CAAC;AAC3C,MAAI,MAAgC;AACpC,MAAI,aAAa;AAEjB,aAAW,QAAQ,kBAAkB;AACnC,UAAM,SAAS,KAAK,SAAS,aAAa;AAC1C,QAAI,QAAS,KAAK,UAAU,IAAI,SAAS,KAAM,SAAS;AACtD,mBAAa,KAAK,GAAG;AACrB,YAAM;AAAA,IACR;AACA,iBAAa,KAAK;AAClB,QAAI,CAAC,KAAK;AACR,YAAM;AAAA,QACJ,UAAU,KAAK;AAAA,QACf,QAAQ,KAAK;AAAA,QACb,OAAO;AAAA,QACP,QAAQ,KAAK;AAAA,QACb,OAAO,KAAK;AAAA,QACZ,SAAS,KAAK,SAAS,MAAM;AAAA,QAC7B,SAAS,KAAK,SAAS,IAAI;AAAA,MAC7B;AAAA,IACF,OAAO;AACL,UAAI,SAAS,KAAK;AAClB,UAAI;AACJ,UAAI,UAAU,KAAK;AACnB,UAAI,SAAS,IAAI,SAAS,KAAK,KAAK;AACpC,UAAI,KAAK,QAAQ;AACf,YAAI,UAAU,KAAK,OAAO,IAAI,WAAW,IAAI,QAAQ,KAAK,OAAO,IAAI,KAAK;AAAA,MAC5E,OAAO;AACL,YAAI,UAAU,KAAK,MAAO,IAAI,WAAW,IAAI,QAAQ,KAAM,IAAI,KAAK;AAAA,MACtE;AACA,UAAI,UAAU,MAAM,IAAI;AAAA,IAC1B;AAAA,EACF;AACA,MAAI,IAAK,cAAa,KAAK,GAAG;AAG9B,QAAM,kBAAoC,CAAC;AAC3C,MAAI,OAA8B;AAClC,MAAI,cAAc;AAElB,aAAW,QAAQ,eAAe;AAChC,UAAM,SAAS,KAAK,SAAS,cAAc;AAC3C,QAAI,QAAQ,QAAQ;AAClB,sBAAgB,KAAK,IAAI;AACzB,aAAO;AAAA,IACT;AACA,kBAAc,KAAK;AACnB,QAAI,CAAC,MAAM;AACT,aAAO;AAAA,QACL,UAAU,KAAK;AAAA,QACf,QAAQ,KAAK;AAAA,QACb,OAAO;AAAA,QACP,QAAQ,KAAK;AAAA,QACb,OAAO,CAAC,GAAG,KAAK,KAAK;AAAA,MACvB;AAAA,IACF,OAAO;AACL,WAAK,SAAS,KAAK;AACnB,WAAK;AACL,WAAK,UAAU,KAAK;AACpB,iBAAW,KAAK,KAAK,OAAO;AAC1B,YAAI,CAAC,KAAM,MAAM,SAAS,CAAC,EAAG,MAAM,MAAM,KAAK,CAAC;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AACA,MAAI,KAAM,iBAAgB,KAAK,IAAI;AAEnC,SAAO;AAAA,IACL,cAAc,aAAa,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAAA,IACrD,WAAW;AAAA,EACb;AACF;AAEA,SAAS,WAAW,OAA+C;AACjE,QAAM,QAAQ,MAAM,CAAC;AACrB,QAAM,OAAO,MAAM,MAAM,SAAS,CAAC;AACnC,QAAM,QAAQ,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,OAAO,CAAC;AACnD,QAAM,SAAS,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AACrD,QAAM,QAAQ,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,WAAW,CAAC,GAAG,CAAC;AACzD,QAAM,UAAU,KAAK;AAAA,IACnB,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,UAAU,EAAE,OAAO,CAAC,IAAI;AAAA,EACvD;AACA,QAAM,SAA4B;AAAA,IAChC,UAAU,MAAM;AAAA,IAChB,QAAQ,KAAK;AAAA,IACb;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,MAAM;AAAA,EACjB;AACA,MAAI,MAAM,KAAK,CAAC,MAAM,EAAE,cAAc,IAAI,GAAG;AAC3C,WAAO,YAAY;AAAA,EACrB;AACA,SAAO;AACT;AAKA,SAAS,WAAW,GAA8B;AAChD,SAAO,EAAE,SAAS,EAAE,SAAS;AAC/B;AAUO,SAAS,uBACd,QACA,UACqB;AACrB,MAAI,YAAY,KAAK,OAAO,WAAW,EAAG,QAAO;AACjD,QAAM,SAA8B,CAAC;AACrC,MAAI,QAA6B,CAAC;AAClC,MAAI,aAAa;AACjB,aAAW,KAAK,QAAQ;AACtB,UAAM,KAAK,CAAC;AACZ,kBAAc,WAAW,CAAC;AAC1B,QAAI,cAAc,UAAU;AAC1B,aAAO,KAAK,WAAW,KAAK,CAAC;AAC7B,cAAQ,CAAC;AACT,mBAAa;AAAA,IACf;AAAA,EACF;AACA,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO,KAAK,WAAW,KAAK,CAAC;AAAA,EAC/B;AACA,SAAO;AACT;;;AC3TO,SAAS,OACd,UACA,OACA,UAAuB,CAAC,GAChB;AACR,SAAO,EAAE,UAAU,OAAO,QAAQ;AACpC;AAEO,SAAS,YACd,OACA,SACA,KACQ;AACR,MAAI,KAAK;AACT,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,WAAW,CAAC,KAAK,QAAQ,IAAI,GAAG,EAAG;AAC5C,SAAK,KAAK,IAAI,IAAI,GAAG;AAAA,EACvB;AACA,SAAO;AACT;;;ACqEA,SAAS,WACP,MACA,SACQ;AACR,SAAO,SAAS,KAAK,QAAQ,KAAK,KAAK,MAAM,KAAK,OAAO;AAC3D;AAEA,SAAS,eAAe,IAAoB;AAC1C,QAAM,SAAS,WAAW,KAAK,EAAE;AACjC,SAAO,SAAS,OAAO,OAAO,CAAC,CAAC,IAAI;AACtC;AAEO,SAAS,WAAW,QAAe,CAAC,GAAoB;AAC7D,QAAM,cAAc,MAAM,eAAe;AAEzC,WAAS,iBACP,OACwB;AACxB,UAAM,QAA0B,WAAW,MAAM,KAAK;AACtD,UAAM,QAAQ,cAAc,KAAK;AACjC,QAAI,gBAAgB;AACpB,QAAI,mBAAmB;AACvB,UAAM,SAAmB,CAAC;AAC1B,UAAM,WAAqB,CAAC;AAK5B,UAAM,sBACJ,MAAM,uBACN;AAAA,MACE,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN;AAAA,IACF;AAEF,UAAM,sBAAsB,gBAAgB,KAAK;AAMjD,UAAM,kBAAkB,oBAAI,IAG1B;AACF,UAAM,uBAAiC,CAAC;AACxC,UAAM,iBAAsC,CAAC;AAC7C,eAAW,QAAQ,MAAM,QAAQ;AAC/B,UAAI;AACF,cAAM,WAAW,kBAAkB;AAAA,UACjC,UAAU,KAAK;AAAA,UACf,QAAQ,KAAK;AAAA,UACb,UAAU,MAAM;AAAA,UAChB;AAAA,QACF,CAAC;AACD,wBAAgB,IAAI,MAAM,EAAE,QAAQ,MAAM,SAAS,CAAC;AAAA,MACtD,SAAS,OAAO;AACd,YAAI,iBAAiB,uBAAuB;AAC1C,0BAAgB;AAAA,YACd;AAAA,YACA,MAAM,SAAS,YACX,EAAE,QAAQ,WAAW,MAAM,IAC3B,EAAE,QAAQ,YAAY,MAAM;AAAA,UAClC;AACA,cAAI,MAAM,SAAS,YAAY;AAC7B,2BAAe,KAAK,IAAI;AAAA,UAC1B,OAAO;AACL,iCAAqB,KAAK,WAAW,MAAM,MAAM,OAAO,CAAC;AAAA,UAC3D;AAAA,QACF,OAAO;AACL,0BAAgB,IAAI,MAAM;AAAA,YACxB,QAAQ;AAAA,YACR,OAAO,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC;AAAA,UACjE,CAAC;AACD,+BAAqB;AAAA,YACnB;AAAA,cACE;AAAA,cACA,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,YACvD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,kBAAkB;AACtB,QAAI,eAAe;AACnB,eAAW,cAAc,gBAAgB,OAAO,GAAG;AACjD,UAAI,WAAW,WAAW,KAAM;AAAA,eACvB,WAAW,WAAW,UAAW;AAAA,IAC5C;AAMA,UAAM,aAIA,CAAC;AACP,eAAW,CAAC,MAAM,UAAU,KAAK,iBAAiB;AAChD,UAAI,WAAW,WAAW,KAAM;AAChC,iBAAW,KAAK;AAAA,QACd;AAAA,QACA,OAAO,WAAW,SAAS;AAAA,QAC3B,KAAK,WAAW,SAAS;AAAA,MAC3B,CAAC;AAAA,IACH;AACA,UAAM,eAAe,CAAC,GAAG,UAAU,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAGrE,UAAM,YAAY,oBAAI,IAAmC;AACzD,QAAI,mBAAmB;AACvB,eAAW,SAAS,cAAc;AAChC,UAAI,MAAM,SAAS,kBAAkB;AACnC,kBAAU,IAAI,MAAM,IAAI;AACxB,iBAAS;AAAA,UACP,kBAAkB,MAAM,KAAK,QAAQ,KAAK,MAAM,KAAK,MAAM;AAAA,QAC7D;AACA;AAAA,MACF;AACA,UAAI,MAAM,MAAM,iBAAkB,oBAAmB,MAAM;AAAA,IAC7D;AAEA,QAAI,MAAM,OAAO,SAAS,mBAAmB,KAAK,MAAM,OAAO,SAAS,GAAG;AACzE,UAAI,kBAAkB;AACtB,UAAI,wBAAwB;AAC5B,UAAI,gBAAgB;AACpB,iBAAW,CAAC,MAAM,UAAU,KAAK,iBAAiB;AAChD,YAAI,WAAW,WAAW,QAAQ,UAAU,IAAI,IAAI,EAAG;AACvD,YAAI,WAAW,SAAS,iBAAiB,SAAS;AAChD,kCAAwB;AACxB;AAAA,QACF;AACA;AACA,mBAAW,MAAM,WAAW,SAAS,YAAY;AAC/C,gBAAM,MAAM,MAAM,SAAS,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AAClD,6BAAmB,KAAK,MAAM,UAAU;AAAA,QAC1C;AAAA,MACF;AACA,UACE,CAAC,yBACD,kBAAkB,MAAM,OAAO,SAAS,kBACxC;AACA,cAAM,OAAO,aAAa,KAAK,EAC5B,IAAI,CAAC,MAAM,EAAE,OAAO,EACpB,KAAK,CAAC,GAAG,MAAM,eAAe,CAAC,IAAI,eAAe,CAAC,CAAC;AACvD,cAAM,WACJ,KAAK,SAAS,IACV,+BAA+B,KAAK,CAAC,CAAC,KAAK,KAAK,KAAK,SAAS,CAAC,CAAC,2EAChE;AACN,cAAM,cACJ,oBAAoB,KACpB,eAAe,WAAW,KAC1B,eAAe,IACX,eAAe,MAAM,OAAO,MAAM,uSAClC,eAAe,SAAS,IACtB,+CAA+C,eAAe,CAAC,EAAG,QAAQ,KAAK,eAAe,CAAC,EAAG,MAAM,qCAAqC,eAAe,gBAAgB,MAAM,OAAO,SAAS,gBAAgB,mBAAmB,QAAQ,KAC7O,yCAAyC,eAAe,iBAAiB,aAAa,kBAAkB,MAAM,OAAO,SAAS,gBAAgB;AACtJ,eAAO;AAAA,UACL,OAAO,MAAM;AAAA,UACb,QAAQ;AAAA,YACN,eAAe;AAAA,YACf,kBAAkB;AAAA,YAClB,QAAQ,CAAC,aAAa,GAAG,oBAAoB;AAAA,YAC7C,UAAU,CAAC;AAAA,UACb;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,eAAW,QAAQ,MAAM,QAAQ;AAC/B,UAAI,UAAU,IAAI,IAAI,EAAG;AACzB,YAAM,aAAa,gBAAgB,IAAI,IAAI;AAC3C,UAAI,eAAe,OAAW;AAC9B,UAAI,WAAW,WAAW,YAAY;AACpC,iBAAS;AAAA,UACP,kBAAkB,KAAK,QAAQ,KAAK,KAAK,MAAM;AAAA,QACjD;AACA;AAAA,MACF;AACA,UAAI,WAAW,WAAW,aAAa,WAAW,WAAW,WAAW;AACtE,eAAO,KAAK,WAAW,MAAM,WAAW,MAAM,OAAO,CAAC;AACtD;AAAA,MACF;AACA,eAAS,KAAK,GAAG,WAAW,SAAS,iBAAiB;AACtD,UAAI;AACF,cAAM,UAAU,iBAAiB;AAAA,UAC/B;AAAA,UACA,UAAU,MAAM;AAAA,UAChB;AAAA,UACA;AAAA,UACA,QAAQ,MAAM;AAAA,UACd;AAAA,UACA;AAAA,UACA;AAAA,QACF,CAAC;AACD;AACA,4BAAoB,QAAQ;AAC5B,iBAAS,KAAK,GAAG,QAAQ,QAAQ;AAAA,MACnC,SAAS,OAAO;AACd,eAAO;AAAA,UACL;AAAA,YACE;AAAA,YACA,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,UACvD;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,UAAM,MAAM,oBAAoB;AAChC,UAAM,MAAM,oBAAoB;AAEhC,QAAI,gBAAgB,GAAG;AAIrB,YAAM,MAAM,4BAA4B;AACxC,YAAM,MAAM,uBAAuB;AAInC,YAAM,MAAM,kBAAkB,CAAC;AAAA,IACjC;AAEA,WAAO;AAAA,MACL;AAAA,MACA,QAAQ,EAAE,eAAe,kBAAkB,QAAQ,SAAS;AAAA,IAC9D;AAAA,EACF;AAEA,WAAS,YAAY,OAA4C;AAC/D,UAAM,eAAe,eAAe,MAAM,MAAM;AAChD,QAAI,aAAa,SAAS,GAAG;AAC3B,cAAQ;AAAA,QACN,4CAA4C,aAAa,KAAK,IAAI,CAAC;AAAA,MACrE;AAAA,IACF;AACA,UAAM,MAAuB;AAAA,MAC3B,QAAQ,MAAM;AAAA,MACd,YAAY,MAAM;AAAA,MAClB;AAAA,IACF;AACA,UAAM,UAAkB;AAAA,MACtB,UAAU,MAAM;AAAA,MAChB,OAAO,MAAM;AAAA,MACb,SAAS,CAAC;AAAA,IACZ;AAIA,UAAM,WAA2B,MAAM,cAAc;AACrD,UAAM,QAAQ,WAAW,QAAQ;AACjC,UAAM,SAAS,YAAY,OAAO,SAAS,GAAG;AAC9C,WAAO;AAAA,MACL,UAAU,OAAO;AAAA,MACjB,OAAO,OAAO;AAAA,MACd,OAAO,OAAO,QAAQ;AAAA,IACxB;AAAA,EACF;AAEA,WAAS,WAAW,SAAiB,OAAyB;AAC5D,WAAO,UAAU,OAAO,OAAO;AAAA,EACjC;AAEA,WAAS,OAAO,OAAe,OAA6C;AAC1E,UAAM,QAAQ,MACX,YAAY,EACZ,MAAM,KAAK,EACX,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC;AACnC,QAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAChC,UAAM,SAAS,aAAa,KAAK,EAC9B,IAAI,CAAC,WAAW,EAAE,OAAO,OAAO,eAAe,OAAO,KAAK,EAAE,EAAE,EAC/D,OAAO,CAAC,UAAU,MAAM,QAAQ,GAAG,EACnC,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,KAAK;AACjD,WAAO,OAAO,IAAI,CAAC,UAAU,MAAM,KAAK;AAAA,EAC1C;AAEA,WAAS,OACP,OACA,YACA,QACc;AACd,UAAM,SAAS,aAAa,KAAK;AACjC,UAAM,QACJ,OAAO,oBAAoB,IAAI,aAAa,OAAO,oBAAoB;AACzE,WAAO;AAAA,MACL,cAAc;AAAA,MACd;AAAA,MACA,mBAAmB,OAAO;AAAA,MAC1B,cAAc,OAAO;AAAA,MACrB,aAAa,MAAM,OAAO;AAAA,MAC1B,kBAAkB,MAAM,MAAM;AAAA,MAC9B,WAAW,EAAE,QAAQ,OAAO,QAAQ,OAAO,MAAM,OAAO,OAAO;AAAA,IACjE;AAAA,EACF;AAEA,WAAS,eAA+B;AACtC,WAAO,WAAW,KAAK;AAAA,EACzB;AAKA,WAAS,WAAW,UAA0C;AAC5D,UAAM,OAAuB;AAAA,MAC3B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,QAAI,aAAa,OAAQ,QAAO;AAChC,WAAO,CAAC,GAAG,MAAM,qBAAqB,QAAQ,CAAC;AAAA,EACjD;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAQA,IAAM,iBAA+B;AAAA,EACnC,MAAM;AAAA,EACN,IAAI,IAAI,KAAK;AACX,UAAM,gBACJ,IAAI,OAAO,eAAe,SAAS,KAAK,CAAC,CAAC,IAAI,OAAO;AACvD,UAAM,cAAc,gBAChB,CAAC,MAAmB,mBAAmB,GAAG,IAAI,MAAM,IACpD;AACJ,UAAM,YAAY,WAAW,GAAG,UAAU;AAAA,MACxC,UAAU,GAAG,MAAM;AAAA,MACnB,WAAW,iBAAiB,GAAG,MAAM,WAAW,IAAI;AAAA,MACpD,aAAa;AAAA,IACf,CAAC;AACD,WAAO,EAAE,GAAG,IAAI,OAAO,EAAE,GAAG,GAAG,OAAO,aAAa,UAAU,IAAI,EAAE;AAAA,EACrE;AACF;AAEA,IAAM,iBAA+B;AAAA,EACnC,MAAM;AAAA,EACN,IAAI,IAAI,KAAK;AACX,UAAM,SAAS,WAAW,GAAG,UAAU,GAAG,KAAK;AAC/C,oBAAgB,OAAO,OAAO,IAAI,OAAO,kBAAkB;AAC3D,WAAO,EAAE,GAAG,IAAI,OAAO,OAAO,MAAM;AAAA,EACtC;AACF;AAEA,IAAM,YAA0B;AAAA,EAC9B,MAAM;AAAA,EACN,IAAI,IAAI;AACN,WAAO,EAAE,GAAG,IAAI,UAAU,MAAM,GAAG,UAAU,GAAG,KAAK,EAAE;AAAA,EACzD;AACF;AAEA,IAAM,aAA2B;AAAA,EAC/B,MAAM;AAAA,EACN,SAAS,CAAC,KAAK,QACb,CAAC,CAAC,IAAI,OAAO,gBAAgB,WAAW,mBAAmB,EAAE,SAAS;AAAA,EACxE,IAAI,IAAI,KAAK;AACX,UAAM,UAAU,oBAAoB,GAAG,UAAU,IAAI,OAAO,cAAc;AAC1E,WAAO,EAAE,GAAG,IAAI,UAAU,QAAQ,SAAS;AAAA,EAC7C;AACF;AAEA,IAAM,wBAAsC;AAAA,EAC1C,MAAM;AAAA,EACN,IAAI,IAAI;AACN,UAAM,SAAS,0BAA0B,GAAG,OAAO,GAAG,QAAQ;AAC9D,WAAO,EAAE,GAAG,IAAI,UAAU,OAAO,SAAS;AAAA,EAC5C;AACF;AAEA,IAAM,gBAA8B;AAAA,EAClC,MAAM;AAAA,EACN,IAAI,IAAI,KAAK;AACX,UAAM,gBAAgB;AAAA,MACpB,GAAG;AAAA,MACH,GAAG;AAAA,MACH,IAAI;AAAA,MACJ,IAAI;AAAA,IACN;AACA,UAAM,gBAAgB;AAAA,MACpB,GAAG;AAAA,MACH,GAAG;AAAA,MACH,IAAI;AAAA,MACJ;AAAA,MACA,IAAI;AAAA,IACN;AACA,UAAM,oBAAoB,cAAc,aAAa,WAAW;AAChE,UAAM,iBAAiC;AAAA,MACrC;AAAA,MACA,mBAAmB;AAAA,QACjB,cAAc;AAAA,QACd,IAAI,OAAO,SAAS;AAAA,MACtB;AAAA,MACA;AAAA,IACF;AACA,WAAO,EAAE,GAAG,IAAI,SAAS,EAAE,GAAG,GAAG,SAAS,eAAe,EAAE;AAAA,EAC7D;AACF;AAEA,IAAM,YAA0B;AAAA,EAC9B,MAAM;AAAA,EACN,IAAI,IAAI,KAAK;AACX,UAAM,QAAQ,YAAY;AAAA,MACxB,YAAY,IAAI;AAAA,MAChB,QAAQ,IAAI;AAAA,MACZ,OAAO,GAAG;AAAA,MACV,UAAU,GAAG;AAAA,MACb,gBAAgB,GAAG,QAAQ;AAAA,MAC3B,aAAa,IAAI;AAAA,IACnB,CAAC;AAED,UAAM,WAAW,GAAG,MAAM,MAAM;AAChC,UAAM,oBAAoB;AAAA,MACxB,IAAI,OAAO;AAAA,MACX,IAAI,OAAO;AAAA,IACb;AAEA,QAAI,UAAU,EAAE,GAAG,GAAG,MAAM,MAAM;AAElC,QAAI,WAAW,KAAK,IAAI,aAAa,WAAW,mBAAmB;AACjE,cAAQ,4BAA4B,IAAI;AACxC,cAAQ,uBAAuB;AAS/B,cAAQ,kBAAkB,CAAC;AAAA,IAC7B;AAEA,QAAI,QAAQ,8BAA8B,GAAG;AAC3C,cAAQ,4BAA4B,IAAI;AAAA,IAC1C;AAEA,QAAI,MAAM,cAAc;AACtB,cAAQ,uBAAuB,IAAI;AAInC,UAAI,MAAM,SAAS,MAAM;AACvB,gBAAQ,kBAAkB;AAAA,UACxB,GAAG,QAAQ;AAAA,UACX,CAAC,MAAM,IAAI,GAAG,IAAI;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL,GAAG;AAAA,MACH,OAAO,EAAE,GAAG,GAAG,OAAO,OAAO,QAAQ;AAAA,MACrC,SAAS,EAAE,GAAG,GAAG,SAAS,MAAM;AAAA,IAClC;AAAA,EACF;AACF;AAEA,IAAM,wBAAsC;AAAA,EAC1C,MAAM;AAAA,EACN,IAAI,IAAI,KAAK;AACX,UAAM,QACJ,IAAI,OAAO,oBAAoB,IAC3B,IAAI,aAAa,IAAI,OAAO,oBAC5B;AACN,QAAI,QAAQ,IAAI,OAAO,SAAS,UAAW,QAAO;AAClD,UAAM,QAAQ;AAAA,MACZ,GAAG;AAAA,MACH,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,EAAE,uBAAuB,IAAI,OAAO,uBAAuB;AAAA,IAC7D;AACA,WAAO;AAAA,MACL,GAAG;AAAA,MACH,UAAU,MAAM;AAAA,MAChB,SAAS,EAAE,GAAG,GAAG,SAAS,gBAAgB,MAAM,eAAe;AAAA,IACjE;AAAA,EACF;AACF;AAyBA,SAAS,iBAAiB,OAA6C;AACrE,QAAM,WAAqB,CAAC;AAC5B,QAAM,WAAW,kBAAkB;AAAA,IACjC,UAAU,MAAM,KAAK;AAAA,IACrB,QAAQ,MAAM,KAAK;AAAA,IACnB,UAAU,MAAM;AAAA,IAChB,OAAO,MAAM;AAAA,EACf,CAAC;AAED,QAAM,kBAAkB;AAAA,IACtB;AAAA,IACA,MAAM;AAAA,EACR,EAAE,OAAO,CAAC,OAAO,CAAC,mBAAmB,EAAE,CAAC;AAIxC,MAAI,gBAAgB,SAAS,SAAS,WAAW,QAAQ;AACvD,UAAM,mBAAmB,oBAAI,IAAoB;AACjD,UAAM,SAAS,QAAQ,CAAC,GAAG,MAAM,iBAAiB,IAAI,EAAE,IAAI,CAAC,CAAC;AAC9D,UAAM,gBACJ,gBAAgB,SAAS,IACpB,iBAAiB,IAAI,gBAAgB,CAAC,CAAE,KAAK,SAAS,aACvD,SAAS;AACf,UAAM,cACJ,gBAAgB,SAAS,IACpB,iBAAiB,IAAI,gBAAgB,gBAAgB,SAAS,CAAC,CAAE,KAClE,SAAS,WACT,SAAS;AACf,UAAM,aAAa,IAAI,IAAI,SAAS,cAAc;AAClD,eAAWC,UAAS,aAAa,MAAM,KAAK,GAAG;AAC7C,UAAI,WAAW,IAAIA,OAAM,OAAO,EAAG;AACnC,UACE,oBAAoBA,QAAO,kBAAkB,eAAe,WAAW,GACvE;AACA,mBAAW,IAAIA,OAAM,OAAO;AAC5B,iBAAS,eAAe,KAAKA,OAAM,OAAO;AAAA,MAC5C;AAAA,IACF;AAAA,EACF;AAEA,QAAM,kBAAkB,SAAS,iBAAiB;AAClD,QAAM,aAAa;AAAA,IACjB,MAAM;AAAA,IACN,SAAS;AAAA,IACT;AAAA,EACF;AACA,QAAM,aAAa,kBACd,KAAK,IAAI,GAAG,aAAa,CAAC,IAC3B;AAEJ,QAAM,mBAAmB,SAAS,eAAe,OAAO,CAAC,OAAO;AAC9D,UAAMA,SAAQ,UAAU,MAAM,OAAO,EAAE;AACvC,WAAOA,QAAO,UAAUA,OAAM,SAAS;AAAA,EACzC,CAAC;AAED,QAAM,sBAAsB,IAAI,IAAY,eAAe;AAC3D,aAAW,cAAc,kBAAkB;AACzC,UAAM,WAAW,UAAU,MAAM,OAAO,UAAU;AAClD,QAAI,UAAU;AACZ,iBAAW,MAAM,SAAS;AACxB,4BAAoB,IAAI,EAAE;AAAA,IAC9B;AAAA,EACF;AAEA,QAAM,mBAAmB,CAAC,GAAG,mBAAmB,EAAE;AAAA,IAChD,CAAC,OAAO,CAAC,MAAM,oBAAoB,IAAI,EAAE;AAAA,EAC3C;AAEA,MAAI,cAAc;AAAA,IAChB;AAAA,IACA,MAAM;AAAA,IACN,MAAM;AAAA,EACR;AAMA,MAAI,YAAY,SAAS,iBAAiB,QAAQ;AAChD,UAAM,OAAO,IAAI,IAAI,WAAW;AAChC,eAAW,MAAM,kBAAkB;AACjC,UAAI,CAAC,KAAK,IAAI,EAAE,EAAG,qBAAoB,OAAO,EAAE;AAAA,IAClD;AAAA,EACF;AAWA,QAAM,gBAAgB,MAAM;AAC5B,QAAM,kBAAkB,gBACpB,YAAY,OAAO,CAAC,OAAO;AACzB,UAAM,MAAM,MAAM,MAAM,YAAY,MAAM,EAAE;AAC5C,WAAO,QAAQ,UAAa,cAAc,IAAI,GAAG;AAAA,EACnD,CAAC,IACD,CAAC;AACL,MAAI,gBAAgB,SAAS,GAAG;AAC9B,UAAM,eAAe,IAAI,IAAI,eAAe;AAC5C,kBAAc,YAAY,OAAO,CAAC,OAAO,CAAC,aAAa,IAAI,EAAE,CAAC;AAG9D,eAAW,MAAM,gBAAiB,qBAAoB,OAAO,EAAE;AAE/D,UAAM,UAAU,gBACb,IAAI,CAAC,OAAO,MAAM,MAAM,YAAY,MAAM,EAAE,CAAC,EAC7C,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AAEnD,QAAI,YAAY,WAAW,KAAK,iBAAiB,WAAW,GAAG;AAC7D,YAAM,UAAU,MAAM,OAAO;AAC7B,YAAM,IAAI;AAAA,QACR,yDAAyD,OAAO,mDAAmD,QAAQ;AAAA,UACzH;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AACA,aAAS;AAAA,MACP,YAAY,gBAAgB,MAAM,yBAAyB,QAAQ;AAAA,QACjE;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,2BAAyB,OAAO,aAAa,iBAAiB,MAAM;AAEpE,MAAI,mBAAmB;AACvB,aAAW,MAAM,aAAa;AAC5B,UAAM,UAAU,MAAM,SAAS,KAAK,CAAC,UAAU,MAAM,OAAO,EAAE;AAC9D,wBAAoB,MAAM,YAAY,SAAS,QAAQ,EAAE;AAAA,EAC3D;AACA,aAAW,cAAc,kBAAkB;AACzC,UAAM,WAAW,UAAU,MAAM,OAAO,UAAU;AAClD,QAAI,UAAU;AACZ,0BAAoB,MAAM,YAAY,SAAS,OAAO;AAAA,IACxD;AAAA,EACF;AAEA,QAAM,UAAU,gBAAgB,MAAM,KAAK;AAC3C,QAAM,QAA0B;AAAA,IAC9B;AAAA,IACA,OAAO,MAAM;AAAA,IACb,MAAM;AAAA,IACN,OAAO,MAAM,KAAK;AAAA,IAClB,SAAS,MAAM,KAAK;AAAA,IACpB,kBAAkB;AAAA,IAClB,qBAAqB,CAAC,GAAG,mBAAmB;AAAA,IAC5C,gBAAgB,CAAC,GAAG,gBAAgB;AAAA,IACpC;AAAA,IACA,WAAW,KAAK,IAAI;AAAA,IACpB,eAAe;AAAA,IACf,YAAY;AAAA,IACZ,QAAQ;AAAA,IACR,gBAAgB,MAAM,KAAK;AAAA,IAC3B,UAAU,MAAM,KAAK;AAAA,IACrB,QAAQ,MAAM,KAAK;AAAA,EACrB;AACA,QAAM,MAAM,OAAO,KAAK,KAAK;AAE7B,aAAW,cAAc,kBAAkB;AACzC,UAAM,WAAW,UAAU,MAAM,OAAO,UAAU;AAClD,QAAI,SAAU,UAAS,SAAS;AAAA,EAClC;AAEA,SAAO,EAAE,QAAQ,kBAAkB,SAAS;AAC9C;AAEA,SAAS,6BACP,UAMA,UACU;AACV,MAAI,SAAS,iBAAiB,SAAS;AACrC,WAAO,SAAS;AAAA,EAClB;AAKA,MAAI,aAAa,SAAS;AAC1B,MAAI,WAAW,SAAS;AACxB,WAAS,OAAO,GAAG,OAAO,GAAG,QAAQ;AACnC,UAAM,oBAAoB;AAAA,MACxB;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,UAAM,eAAe;AAAA,MACnB,kBAAkB;AAAA,MAClB,kBAAkB;AAAA,MAClB;AAAA,IACF;AACA,UAAM,UACJ,aAAa,eAAe,cAC5B,aAAa,aAAa;AAC5B,iBAAa,aAAa;AAC1B,eAAW,aAAa;AACxB,QAAI,CAAC,QAAS;AAAA,EAChB;AACA,MAAI,eAAe,SAAS,cAAc,aAAa,SAAS,UAAU;AACxE,WAAO,SAAS;AAAA,EAClB;AACA,QAAM,MAAgB,CAAC;AACvB,WAAS,IAAI,YAAY,KAAK,UAAU,KAAK;AAC3C,UAAM,MAAM,SAAS,CAAC;AACtB,QAAI,IAAK,KAAI,KAAK,IAAI,EAAE;AAAA,EAC1B;AACA,SAAO;AACT;AAEA,SAAS,yBACP,OACA,kBACA,oBACM;AACN,QAAM,MAAM,MAAM,OAAO;AACzB,QAAM,UAAU,MAAM,KAAK,SAAS,KAAK,KAAK;AAE9C,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,MAAI,IAAI,mBAAmB,KAAK,QAAQ,SAAS,IAAI,kBAAkB;AACrE,UAAM,IAAI;AAAA,MACR,sBAAsB,QAAQ,MAAM,eAAe,IAAI,gBAAgB;AAAA,IACzE;AAAA,EACF;AAEA,QAAM,eAAe,MAAM,KAAK,mBAAmB,IAAI;AACvD,MAAI,eAAe,KAAK,QAAQ,SAAS,cAAc;AACrD,UAAM,IAAI;AAAA,MACR,qBAAqB,QAAQ,MAAM,eAAe,YAAY;AAAA,IAChE;AAAA,EACF;AAEA,MAAI,iBAAiB,WAAW,KAAK,uBAAuB,GAAG;AAC7D,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,4BACP,kBACA,UACA,QACU;AAKV,QAAM,mBAAmB,oBAAI,IAAY;AACzC,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,OAAO,UAAU;AAC1B,QAAI,mBAAmB,KAAK,MAAM,KAAK,IAAI,YAAY;AACrD,uBAAiB,IAAI,IAAI,UAAU;AAAA,IACrC;AAAA,EACF;AAEA,aAAW,MAAM,kBAAkB;AACjC,UAAM,MAAM,SAAS,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AAC5C,QAAI,CAAC,IAAK;AACV,QAAI,mBAAmB,KAAK,MAAM,GAAG;AACnC,iBAAW,IAAI,EAAE;AACjB,UAAI,IAAI,WAAY,kBAAiB,IAAI,IAAI,UAAU;AAAA,IACzD;AAAA,EACF;AAEA,aAAW,MAAM,kBAAkB;AACjC,QAAI,WAAW,IAAI,EAAE,EAAG;AACxB,UAAM,MAAM,SAAS,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AAC5C,QAAI,CAAC,IAAK;AACV,QACE,IAAI,gBAAgB,iBACpB,IAAI,cACJ,iBAAiB,IAAI,IAAI,UAAU,GACnC;AACA,iBAAW,IAAI,EAAE;AAAA,IACnB;AAAA,EACF;AAEA,SAAO,iBAAiB,OAAO,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC;AAC5D;AAEA,SAAS,kBACP,OACA,gBACA,iBACiB;AACjB,MAAI,CAAC,gBAAiB,QAAO;AAC7B,MAAI,eAAe,WAAW,EAAG,QAAO;AACxC,MAAI,UAA2B;AAC/B,aAAW,MAAM,gBAAgB;AAC/B,UAAM,QAAQ,UAAU,OAAO,EAAE;AACjC,QAAI,SAAS,MAAM,OAAO,QAAS,WAAU,MAAM;AAAA,EACrD;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,OAAsC;AAC7D,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,SAAS,aAAa,KAAK,GAAG;AACvC,eAAW,MAAM,MAAM,oBAAqB,UAAS,IAAI,EAAE;AAAA,EAC7D;AACA,SAAO;AACT;AAWA,SAAS,sBACP,mBACA,OACQ;AACR,MAAI,CAAC,qBAAqB,qBAAqB,EAAG,QAAO,MAAM;AAC/D,SAAO,KAAK;AAAA,IACV,MAAM;AAAA,IACN,KAAK;AAAA,MACH,MAAM;AAAA,MACN,KAAK,MAAM,oBAAoB,MAAM,WAAW;AAAA,IAClD;AAAA,EACF;AACF;AASA,SAAS,cACP,OACA,gBACA,aACA,kBACuE;AACvE,QAAM,MAGF,CAAC;AACL,QAAM,SAAS,gBAAgB,qBAAqB,CAAC;AACrD,QAAM,YACJ,mBAAmB,IACf,OAAO,OAAO,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,MAAM,gBAAgB,IAClE;AACN,MAAI,CAAC,IAAI;AAAA,IACP,SAAS,UAAU,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AAAA,IACnD,cAAc,CAAC;AAAA,EACjB;AACA,QAAM,SAAS,aAAa,KAAK;AACjC,QAAM,KAAK,OAAO,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC5C,QAAM,KAAK,OAAO,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC5C,MAAI,CAAC,IAAI;AAAA,IACP,SAAS,GAAG,OAAO,CAAC,GAAG,MAAM,IAAI,YAAY,EAAE,OAAO,GAAG,CAAC;AAAA,IAC1D,cAAc;AAAA,EAChB;AACA,MAAI,CAAC,IAAI;AAAA,IACP,SAAS,GAAG,OAAO,CAAC,GAAG,MAAM,IAAI,YAAY,EAAE,OAAO,GAAG,CAAC;AAAA,IAC1D,cAAc;AAAA,EAChB;AACA,SAAO;AACT;AAEA,SAAS,YAAY,OAAkC;AACrD,QAAM,EAAE,QAAQ,OAAO,YAAY,gBAAgB,YAAY,IAAI;AACnE,QAAM,QAAQ,OAAO;AACrB,QAAM,QAAQ,QAAQ,IAAI,aAAa,QAAQ;AAE/C,QAAM,oBAAoB,sBAAsB,OAAO,OAAO,KAAK;AAEnE,QAAM,YAAY,SAAS,OAAO,MAAM;AACxC,QAAM,oBAAoB,SAAS,OAAO,MAAM;AAGhD,QAAM,WAAW,aAAa;AAE9B,QAAM,WAAW,MAAM,MAAM;AAC7B,QAAM,kBAAkB,MAAM,MAAM,uBAAuB;AAE3D,QAAM,kBAAkB;AACxB,QAAM,qBAAqB,kBACvB,KAAK,MAAM,oBAAoB,CAAC,IAChC;AAEJ,QAAM,kBACJ,MAAM,MAAM,uBAAuB,IAC/B,MAAM,MAAM,uBACZ,WAAW,IACT,WACA;AAER,QAAM,cAAc,KAAK;AAAA,IACvB,OAAO,MAAM;AAAA,IACb,OAAO,MAAM,iBAAiB;AAAA,EAChC;AAEA,QAAM,uBAAuB,aAAa;AAE1C,QAAM,MAAM;AACZ,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,SAAS;AAAA,EAClB;AAOA,QAAM,iBAAiB,KAAK;AAAA,IAC1B,qBAAqB,OAAO,MAAM,yBAAyB;AAAA,EAC7D;AACA,MAAI,eAAuC;AAC3C,MAAI,iBAAiB;AACrB,QAAM,cAAc,wBAAwB;AAC5C,QAAM,QAAQ,MAAM,CAAC,GAAG,WAAW;AACnC,QAAM,QAAQ,MAAM,CAAC,GAAG,WAAW;AACnC,QAAM,QAAQ,MAAM,CAAC,GAAG,WAAW;AAEnC,MAAI,UAAU;AAOZ,UAAM,aAAgC,CAAC,CAAC;AACxC,QAAI,OAAO,MAAM,SAAS;AACxB,iBAAW,KAAK,GAAG,CAAC;AAAA,IACtB;AACA,QAAI,OAA+B;AACnC,QAAI,cAAc;AAClB,eAAW,KAAK,YAAY;AAC1B,YAAM,IAAI,MAAM,CAAC,GAAG,WAAW;AAC/B,UAAI,IAAI,aAAa;AACnB,sBAAc;AACd,eAAO;AAAA,MACT;AAAA,IACF;AACA,QAAI,SAAS,QAAQ,cAAc,GAAG;AACpC,qBAAe;AACf,YAAM,QAAQ,oBAAoB,cAAc;AAChD,uBACE,SAAS,IACL,GAAG,KAAK,8BAA8B,WAAW,WAAW,KAAK,MAAM,QAAQ,GAAG,CAAC,MACnF,GAAG,KAAK,KAAK,IAAI,yBAAyB,WAAW,kBAAkB,KAAK,QAAQ,KAAK,QAAQ,KAAK,YAAY,KAAK,MAAM,QAAQ,GAAG,CAAC;AAAA,IACjJ;AAAA,EACF,WAAW,aAAa;AACtB,QAAI,SAAS,mBAAmB;AAC9B,qBAAe;AACf,uBAAiB,gBAAgB,KAAK,OAAO,iBAAiB,YAAY,oBAAoB,WAAW,KAAK,MAAM,QAAQ,GAAG,CAAC;AAAA,IAClI,WACE,OAAO,MAAM,WACb,SAAS,kBACT,QAAQ,OACR;AACA,YAAM,YAAY,MAAM,MAAM,gBAAgB,CAAC,KAAK;AACpD,YAAM,aACJ,cAAc,KAAK,aAAa,aAAa;AAC/C,UAAI,YAAY;AACd,uBAAe;AACf,yBAAiB,qBAAqB,MAAM,CAAC,EAAG,aAAa,MAAM,mBAAmB,KAAK,eAAe,cAAc,8BAA8B,KAAK,WAAW,KAAK,MAAM,QAAQ,GAAG,CAAC;AAAA,MAC/L;AAAA,IACF,WACE,OAAO,MAAM,WACb,SAAS,kBACT,QAAQ,SACR,QAAQ,OACR;AACA,YAAM,YAAY,MAAM,MAAM,gBAAgB,CAAC,KAAK;AACpD,YAAM,aACJ,cAAc,KAAK,aAAa,aAAa;AAC/C,UAAI,YAAY;AACd,uBAAe;AACf,yBAAiB,sBAAsB,MAAM,CAAC,EAAG,aAAa,MAAM,mBAAmB,KAAK,eAAe,cAAc,oBAAoB,KAAK,uBAAuB,KAAK,WAAW,KAAK,MAAM,QAAQ,GAAG,CAAC;AAAA,MAClN;AAAA,IACF;AAAA,EACF;AAEA,QAAM,eAAe,iBAAiB;AAEtC,MAAI;AACJ,MAAI,iBAAiB,MAAM;AACzB,aAAS;AAAA,EACX,WAAW,UAAU;AACnB,UAAM,QAAQ,oBAAoB,cAAc;AAChD,aAAS,GAAG,KAAK,WAAW,KAAK,MAAM,QAAQ,GAAG,CAAC,kEAAkE,KAAK,QAAQ,KAAK,QAAQ,KAAK;AAAA,EACtJ,OAAO;AACL,UAAM,YAAY,CAAC,GAAG,GAAG,CAAC;AAC1B,UAAM,WAAW,UAAU,OAAO,CAAC,MAAM,OAAO,MAAM,WAAW,MAAM,CAAC;AACxE,UAAM,QAAQ,SACX,OAAO,CAAC,OAAO,MAAM,CAAC,GAAG,WAAW,MAAM,iBAAiB,EAC3D,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,MAAM,CAAC,EAAG,OAAO,EAAE;AAC1C,UAAM,YAAY,MAAM,SAAS,IAAI,YAAY,MAAM,KAAK,IAAI,CAAC,KAAK;AACtE,UAAM,UAAU,SACb;AAAA,MACC,CAAC,OACE,MAAM,CAAC,GAAG,WAAW,MAAM,sBAC3B,MAAM,MAAM,gBAAgB,CAAC,KAAK,KAAK,KACxC,cAAc,MAAM,MAAM,gBAAgB,CAAC,KAAK,KAAK;AAAA,IACzD,EACC,IAAI,CAAC,MAAM,IAAI,CAAC,YAAY;AAC/B,UAAM,cACJ,QAAQ,SAAS,IAAI,cAAc,QAAQ,KAAK,IAAI,CAAC,KAAK;AAC5D,UAAM,aAAa,KAAK;AAAA,MACtB;AAAA,MACA,GAAG,OAAO,OAAO,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO;AAAA,IAC9C;AAKA,UAAM,eAAe,aAAa;AAClC,UAAM,cAAc,uBAAuB;AAC3C,UAAM,QAAkB,CAAC;AACzB,QAAI;AACF,YAAM;AAAA,QACJ,oBAAoB,UAAU,gBAAgB,iBAAiB;AAAA,MACjE;AACF,QAAI;AACF,YAAM,KAAK,UAAU,oBAAoB,YAAY,WAAW,EAAE;AACpE,QAAI,MAAM,WAAW;AACnB,YAAM;AAAA,QACJ,oBAAoB,UAAU,YAAY,oBAAoB;AAAA,MAChE;AACF,aAAS,GAAG,MAAM,KAAK,IAAI,CAAC,GAAG,SAAS,GAAG,WAAW;AAAA,EACxD;AAEA,QAAM,eAAe;AAAA,IACnB,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,oBAAoB,KAAK,qBAAqB,CAAC;AAAA,IAC/C,iBAAiB,KAAK,cAAc,aAAa,CAAC;AAAA,IAClD,kBAAkB,eAAe,MAAM,YAAY,EAAG,eAAe,CAAC;AAAA,IACtE,cAAc;AAAA,IACd,MAAM;AAAA,IACN,WAAW;AAAA,MACT;AAAA,MACA,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,iBAAiB,kBAAkB,IAAI;AAAA,MACvC,WAAW,YAAY,IAAI;AAAA,MAC3B,mBAAmB,oBAAoB,IAAI;AAAA,MAC3C,WAAW,MAAM,CAAC,EAAG;AAAA,MACrB,WAAW,MAAM,CAAC,EAAG;AAAA,MACrB,WAAW,MAAM,CAAC,EAAG;AAAA,IACvB;AAAA,IACA,kBAAkB;AAAA,EACpB;AACF;AAEA,SAAS,wBACP,UACA,OACA,QACA,aACkB;AAClB,QAAM,QAAQ,gBAAgB,CAAC,MAAc,KAAK,KAAK,EAAE,SAAS,CAAC;AACnE,MAAI,SAAS,GACX,OAAO,GACP,YAAY,GACZ,OAAO,GACP,OAAO;AACT,aAAW,OAAO,UAAU;AAC1B,UAAM,SAAS,MAAM,IAAI,QAAQ,EAAE;AACnC,QAAI,IAAI,MAAM,WAAW,mCAAmC,GAAG;AAC7D,mBAAa;AAAA,IACf,WACE,IAAI,gBAAgB,eACpB,IAAI,gBAAgB,eACpB;AACA,cAAQ;AAAA,IACV,WAAW,IAAI,SAAS,UAAU;AAChC,gBAAU;AAAA,IACZ,WAAW,IAAI,MAAM,SAAS,KAAK,GAAG;AACpC,cAAQ;AAAA,IACV,OAAO;AACL,cAAQ;AAAA,IACV;AAAA,EACF;AACA,SAAO,EAAE,QAAQ,MAAM,WAAW,MAAM,MAAM,OAAO,OAAO;AAC9D;AAEA,SAAS,WAAW,OAA2C;AAC7D,SAAO;AAAA,IACL,QAAQ,MAAM,OAAO,IAAI,CAAC,WAAW;AAAA,MACnC,GAAG;AAAA,MACH,kBAAkB,CAAC,GAAG,MAAM,gBAAgB;AAAA,MAC5C,qBAAqB,CAAC,GAAG,MAAM,mBAAmB;AAAA,MAClD,gBAAgB,CAAC,GAAG,MAAM,cAAc;AAAA,IAC1C,EAAE;AAAA,IACF,aAAa;AAAA,MACX,OAAO,EAAE,GAAG,MAAM,YAAY,MAAM;AAAA,MACpC,OAAO,EAAE,GAAG,MAAM,YAAY,MAAM;AAAA,IACtC;AAAA,IACA,eAAe,EAAE,GAAI,MAAM,iBAAiB,CAAC,EAAG;AAAA,IAChD,OAAO,EAAE,GAAG,MAAM,OAAO,SAAS,EAAE,GAAG,MAAM,MAAM,QAAQ,EAAE;AAAA,IAC7D,OAAO,EAAE,GAAG,MAAM,MAAM;AAAA,IACxB,aAAa,MAAM;AAAA,IACnB,WAAW,MAAM;AAAA,EACnB;AACF;AAEA,SAAS,eAAe,OAAyB,OAAyB;AACxE,QAAM,SAAS,MAAM,SAAS,IAAI,YAAY;AAC9C,QAAM,UAAU,MAAM,QAAQ,YAAY;AAC1C,MAAI,QAAQ;AACZ,aAAW,QAAQ,OAAO;AACxB,UAAM,YAAY,iBAAiB,OAAO,IAAI;AAC9C,QAAI,YAAY,EAAG,UAAS,KAAK,IAAI,YAAY,MAAM,IAAI;AAC3D,UAAM,cAAc,iBAAiB,SAAS,IAAI;AAClD,QAAI,cAAc,EAAG,UAAS,KAAK,IAAI,cAAc,MAAM,GAAG;AAAA,EAChE;AACA,SAAO,KAAK,IAAI,OAAO,CAAC;AAC1B;AAEA,SAAS,iBAAiB,UAAkB,QAAwB;AAClE,MAAI,CAAC,YAAY,CAAC,OAAQ,QAAO;AACjC,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,UAAQ,WAAW,SAAS,QAAQ,QAAQ,QAAQ,OAAO,IAAI;AAC7D;AACA,gBAAY,OAAO;AAAA,EACrB;AACA,SAAO;AACT;;;ACvwCO,SAAS,gBAAgB,KAA4B;AACxD,QAAM,aAAa,IAAI,KAAK,EAAE,YAAY;AAC1C,QAAM,WAAW,aAAa,KAAK,UAAU;AAC7C,MAAI,YAAY,SAAS,CAAC,MAAM,OAAW,QAAO,IAAI,SAAS,CAAC,CAAC;AACjE,QAAM,WAAW,UAAU,KAAK,UAAU;AAC1C,MAAI,YAAY,SAAS,CAAC,MAAM,OAAW,QAAO,IAAI,SAAS,CAAC,CAAC;AACjE,SAAO;AACX;AAEO,SAAS,8BACZ,OACA,YACkB;AAClB,MAAI,WAAW,SAAS,EAAG,QAAO,CAAC;AACnC,QAAM,UAA8B,CAAC;AACrC,aAAW,SAAS,MAAM,QAAQ;AAC9B,QAAI,CAAC,MAAM,OAAQ;AACnB,QAAI,MAAM,oBAAoB,KAAK,CAAC,OAAO,WAAW,IAAI,EAAE,CAAC,GAAG;AAC5D,cAAQ,KAAK,KAAK;AAAA,IACtB;AAAA,EACJ;AACA,SAAO,QAAQ,KAAK,CAAC,GAAG,MAAM,YAAY,EAAE,OAAO,IAAI,YAAY,EAAE,OAAO,CAAC;AACjF;AAEO,SAAS,mBAAmB,OAAyB,SAAgC;AACxF,QAAM,QAAQ,MAAM,OAAO,KAAK,CAAC,MAAM,EAAE,YAAY,OAAO;AAC5D,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,QAAkB,CAAC,GAAG,MAAM,cAAc;AAChD,QAAM,UAAU,oBAAI,IAAY;AAChC,SAAO,MAAM,SAAS,GAAG;AACrB,UAAM,YAAY,MAAM,MAAM;AAC9B,QAAI,QAAQ,IAAI,SAAS,EAAG;AAC5B,YAAQ,IAAI,SAAS;AACrB,UAAM,UAAU,MAAM,OAAO,KAAK,CAAC,MAAM,EAAE,YAAY,SAAS;AAChE,QAAI,CAAC,QAAS;AACd,QAAI,QAAQ,OAAQ,QAAO,QAAQ;AACnC,eAAW,cAAc,QAAQ,gBAAgB;AAC7C,UAAI,CAAC,QAAQ,IAAI,UAAU,EAAG,OAAM,KAAK,UAAU;AAAA,IACvD;AAAA,EACJ;AACA,SAAO;AACX;AAMO,SAAS,gBACZ,OACA,UACA,UAA6B,CAAC,GACd;AAChB,QAAM,UAAU,IAAI,IAAI,QAAQ;AAEhC,QAAM,UAAU,MAAM,OAAO,IAAI,CAAC,UAAU;AACxC,QAAI,CAAC,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC,MAAM,OAAQ,QAAO;AACzD,WAAO;AAAA,MACH,GAAG;AAAA,MACH,QAAQ;AAAA,MACR,YAAY,MAAM;AAAA,MAClB,WAAW,MAAM;AAAA,IACrB;AAAA,EACJ,CAAC;AAED,MAAI,QAAQ;AACZ,MAAI,QAAQ,MAAM;AACd,UAAM,UAAU,oBAAI,IAAY;AAChC,UAAM,QAAkB,CAAC;AACzB,eAAW,MAAM,UAAU;AACvB,YAAM,QAAQ,QAAQ,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE;AAClD,UAAI,MAAO,OAAM,KAAK,GAAG,MAAM,cAAc;AAAA,IACjD;AACA,WAAO,MAAM,SAAS,GAAG;AACrB,YAAM,KAAK,MAAM,MAAM;AACvB,UAAI,QAAQ,IAAI,EAAE,EAAG;AACrB,cAAQ,IAAI,EAAE;AACd,cAAQ,MAAM,IAAI,CAAC,UAAU;AACzB,YAAI,MAAM,YAAY,GAAI,QAAO;AACjC,cAAM,KAAK,GAAG,MAAM,cAAc;AAClC,eAAO,MAAM,SAAS,EAAE,GAAG,OAAO,QAAQ,MAAM,IAAI;AAAA,MACxD,CAAC;AAAA,IACL;AAAA,EACJ;AAEA,SAAO,EAAE,GAAG,OAAO,QAAQ,MAAM;AACrC;AAOO,SAAS,4BACZ,UACA,wBACA,OACqB;AACrB,QAAM,WAA0B,CAAC;AACjC,aAAW,WAAW,UAAU;AAC5B,QAAI,CAAC,uBAAuB,IAAI,QAAQ,EAAE,EAAG;AAC7C,UAAM,eAAe,MAAM,OAAO;AAAA,MAC9B,CAAC,MAAM,EAAE,UAAU,EAAE,oBAAoB,SAAS,QAAQ,EAAE;AAAA,IAChE;AACA,QAAI,CAAC,aAAc,UAAS,KAAK,OAAO;AAAA,EAC5C;AAEA,MAAI,SAAS,WAAW,EAAG,QAAO,EAAE,SAAS,IAAI,eAAe,EAAE;AAElE,QAAM,QAAkB,CAAC;AACzB,MAAI,cAAc;AAClB,QAAM,cAAc;AACpB,QAAM,kBAAkB;AAExB,aAAW,WAAW,UAAU;AAC5B,QAAI,eAAe,YAAa;AAChC,UAAM,OAAO,QAAQ,QAAQ;AAC7B,UAAM,YAAY,KAAK,SAAS,kBAAkB,KAAK,MAAM,GAAG,eAAe,IAAI,QAAQ;AAC3F,UAAM,QACF,QAAQ,YAAY,QAAQ,gBAAgB,SACtC,GAAG,QAAQ,QAAQ,KAAK,SAAS,KACjC,IAAI,QAAQ,IAAI,KAAK,SAAS;AACxC,UAAM,KAAK,KAAK;AAChB,mBAAe,MAAM,SAAS;AAAA,EAClC;AAEA,SAAO,EAAE,SAAS,MAAM,KAAK,IAAI,GAAG,eAAe,SAAS,OAAO;AACvE;AAgCO,SAAS,oBACZ,OACA,OACA,UACA,UAAiC,CAAC,GACZ;AACtB,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,YAAY,IAAI,IAAI,MAAM,mBAAmB;AAEnD,MAAI,MAAM;AACN,UAAM,OAAO,SAAS,OAAO,CAAC,MAAM,UAAU,IAAI,EAAE,EAAE,CAAC;AACvD,QAAI,KAAK,WAAW,EAAG,QAAO,EAAE,MAAM,IAAI,OAAO,EAAE;AACnD,WAAO,EAAE,MAAM,KAAK,IAAI,aAAa,EAAE,KAAK,MAAM,GAAG,OAAO,KAAK,OAAO;AAAA,EAC5E;AAIA,QAAM,iBAAqC,CAAC;AAC5C,QAAM,gBAAgB,oBAAI,IAAY;AACtC,aAAW,WAAW,MAAM,gBAAgB;AACxC,UAAM,QAAQ,MAAM,OAAO,KAAK,CAAC,MAAM,EAAE,YAAY,OAAO;AAC5D,QAAI,CAAC,OAAO,OAAQ;AACpB,mBAAe,KAAK,KAAK;AACzB,eAAW,MAAM,MAAM,oBAAqB,eAAc,IAAI,EAAE;AAAA,EACpE;AAEA,QAAM,QAAkB,CAAC;AACzB,aAAW,SAAS,gBAAgB;AAChC,UAAM,QAAQ,MAAM,QAAQ,GAAG,MAAM,OAAO,KAAK,MAAM,KAAK,KAAK,MAAM;AACvE,UAAM,KAAK,GAAG,cAAc,WAAM,KAAK;AAAA,EAAK,MAAM,OAAO,EAAE;AAAA,EAC/D;AAEA,MAAI,cAAc;AAClB,aAAW,KAAK,UAAU;AACtB,QAAI,UAAU,IAAI,EAAE,EAAE,KAAK,CAAC,cAAc,IAAI,EAAE,EAAE,GAAG;AACjD,YAAM,KAAK,cAAc,CAAC,CAAC;AAC3B;AAAA,IACJ;AAAA,EACJ;AAEA,QAAM,QAAQ,cAAc,eAAe;AAC3C,MAAI,UAAU,EAAG,QAAO,EAAE,MAAM,IAAI,OAAO,EAAE;AAC7C,SAAO,EAAE,MAAM,MAAM,KAAK,MAAM,GAAG,MAAM;AAC7C;AAEA,SAAS,cAAc,SAA8B;AACjD,QAAM,OAAO,QAAQ,QAAQ;AAC7B,MAAI,QAAQ,YAAY,QAAQ,gBAAgB,QAAQ;AACpD,WAAO,IAAI,QAAQ,IAAI,WAAM,QAAQ,QAAQ;AAAA,EAAM,IAAI;AAAA,EAC3D;AACA,SAAO,IAAI,QAAQ,IAAI;AAAA,EAAM,IAAI;AACrC;AAEA,SAAS,YAAY,SAAyB;AAC1C,QAAM,QAAQ,WAAW,KAAK,OAAO;AACrC,SAAO,SAAS,MAAM,CAAC,MAAM,SAAY,OAAO,MAAM,CAAC,CAAC,IAAI;AAChE;;;ACtNA,SAASC,cAAa,GAAmB;AACrC,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,KAAK,EAAG,QAAO;AAC1C,SAAO,KAAK,MAAO,IAAI,IAAI,KAAM,QAAQ,CAAC,CAAC,MAAM,OAAO,CAAC;AAC7D;AAEA,SAAS,IAAI,GAAW,OAAuB;AAC3C,MAAI,KAAK,KAAK,SAAS,EAAG,QAAO;AACjC,SAAO,KAAK,IAAI,GAAG,KAAK,MAAO,IAAI,QAAS,GAAG,CAAC;AACpD;AAEA,SAASC,aAAY,SAAyB;AAC1C,QAAM,QAAQ,WAAW,KAAK,OAAO;AACrC,SAAO,SAAS,MAAM,CAAC,MAAM,SAAY,OAAO,MAAM,CAAC,CAAC,IAAI;AAChE;AAEA,SAAS,gBAAgB,OAAyB,aAA4C;AAC1F,SAAO,YAAY,MAAM,OAAO;AACpC;AAEA,SAAS,0BACL,OACA,QACA,cACM;AAQN,SAAO,MAAM;AACjB;AAEA,SAAS,UAAU,OAAiC;AAChD,SAAO,IAAI,MAAM,IAAI;AACzB;AAEA,SAAS,cACL,QACA,aACa;AACb,QAAM,aAAqC,CAAC;AAC5C,aAAW,SAAS,QAAQ;AACxB,eAAW,MAAM,IAAI,KAAK,WAAW,MAAM,IAAI,KAAK,KAAK,gBAAgB,OAAO,WAAW;AAAA,EAC/F;AACA,QAAM,QAAQ,OAAO,KAAK,UAAU,EAAE,IAAI,MAAM;AAChD,MAAI,MAAM,UAAU,EAAG,QAAO;AAC9B,QAAM,QAAkB,CAAC;AACzB,aAAW,QAAQ,CAAC,GAAG,GAAG,CAAC,GAAG;AAC1B,QAAI,WAAW,IAAI,EAAG,OAAM,KAAK,IAAI,IAAI,KAAKD,cAAa,WAAW,IAAI,CAAC,CAAC,EAAE;AAAA,EAClF;AACA,SAAO,MAAM,KAAK,KAAK;AAC3B;AASA,SAAS,eACL,UACA,OACA,aACwD;AACxD,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,SAAS,MAAM,QAAQ;AAC9B,QAAI,CAAC,MAAM,OAAQ;AACnB,eAAW,MAAM,MAAM,oBAAqB,YAAW,IAAI,EAAE;AAAA,EACjE;AACA,MAAI,gBAAgB;AACpB,aAAW,SAAS,MAAM,QAAQ;AAC9B,QAAI,MAAM,OAAQ,kBAAiB,gBAAgB,OAAO,WAAW;AAAA,EACzE;AACA,QAAM,UAAgC,CAAC;AACvC,WAAS,QAAQ,CAAC,SAAS,UAAU;AACjC,QAAI,WAAW,IAAI,QAAQ,EAAE,EAAG;AAChC,UAAM,MAAM,UAAU,MAAM,aAAa,QAAQ,EAAE;AACnD,QAAI,CAAC,IAAK;AACV,UAAM,SAAS,YAAY,QAAQ,QAAQ,EAAE;AAC7C,UAAM,OAAO,QAAQ,YAAY;AACjC,QAAI,SAAS,EAAG,SAAQ,KAAK,EAAE,KAAK,QAAQ,MAAM,MAAM,CAAC;AAAA,EAC7D,CAAC;AACD,SAAO,EAAE,SAAS,cAAc;AACpC;AAUO,SAAS,kBACZ,OACA,UACA,aACA,UAA+B,CAAC,GAC1B;AACN,QAAM,QAAQ,QAAQ;AACtB,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,aAAa,QAAQ;AAC3B,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,QAAQ,QAAQ,SAAS;AAE/B,QAAME,gBAAe,MAAM,OACtB,OAAO,CAAC,MAAM,EAAE,MAAM,EACtB,KAAK,CAAC,GAAG,MAAMD,aAAY,EAAE,OAAO,IAAIA,aAAY,EAAE,OAAO,CAAC;AAEnE,MAAI,UAAU,cAAc;AACxB,WAAO,0BAA0BC,eAAc,OAAO,MAAM,OAAO,WAAW;AAAA,EAClF;AAEA,QAAM,EAAE,SAAS,cAAc,IAAI,eAAe,UAAU,OAAO,WAAW;AAE9E,MAAI,UAAU,gBAAgB;AAC1B,QAAI,SAAS,YAAY;AACrB,aAAO,uBAAuB,SAAS,YAAY,MAAM,KAAK;AAAA,IAClE;AACA,WAAO,yBAAyB,OAAO;AAAA,EAC3C;AAEA,SAAO,eAAe,SAAS,eAAeA,eAAc,OAAO,aAAa,KAAK;AACzF;AAEA,SAAS,eACL,SACA,eACA,QACA,OACA,aACA,OACM;AACN,QAAM,QAAkB,CAAC;AACzB,QAAM,cAAc,oBAAI,IAAoB;AAC5C,aAAW,WAAW,SAAS;AAC3B,gBAAY,IAAI,QAAQ,OAAO,YAAY,IAAI,QAAQ,IAAI,KAAK,KAAK,QAAQ,MAAM;AAAA,EACvF;AACA,QAAM,UAAU,CAAC,GAAG,YAAY,QAAQ,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC;AAE7E,QAAM,YAAY,QACb,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,EAC/B,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,QAAQ,CAAC;AACzC,QAAM,YAAY,QACb,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,EAC/B,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,QAAQ,CAAC;AACzC,QAAM,QAAQ,gBAAgB,YAAY;AAE1C,QAAM,KAAK,mBAAmB;AAC9B,QAAM;AAAA,IACF,KAAKF,cAAa,SAAS,CAAC,UAAU,IAAI,WAAW,KAAK,CAAC,QAAQA,cAAa,SAAS,CAAC,UAAU,IAAI,WAAW,KAAK,CAAC,QAAQA,cAAa,aAAa,CAAC,eAAe,IAAI,eAAe,KAAK,CAAC;AAAA,EACxM;AACA,QAAM,WAAW,CAAC,GAAG,YAAY,QAAQ,CAAC,EACrC,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,CAAC;AACf,MAAI,SAAS,SAAS,GAAG;AACrB,UAAM,KAAK,gBAAgB,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE;AAAA,EAChG;AAEA,QAAM,KAAK,EAAE;AACb,MAAI,OAAO,WAAW,GAAG;AACrB,UAAM,KAAK,mBAAmB;AAC9B,UAAM,KAAK,yBAAyB;AAAA,EACxC,OAAO;AACH,UAAM,eAAe,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,gBAAgB,GAAG,WAAW,GAAG,CAAC;AACnF,UAAM,iBAAiB,OAAO;AAAA,MAC1B,CAAC,GAAG,MAAM,IAAI,0BAA0B,GAAG,OAAO,WAAW;AAAA,MAC7D;AAAA,IACJ;AACA,UAAM;AAAA,MACF,4BAAuB,OAAO,MAAM,YAAYA,cAAa,YAAY,CAAC,aAAaA,cAAa,cAAc,CAAC;AAAA,IACvH;AACA,UAAM,YAAY,cAAc,QAAQ,WAAW;AACnD,QAAI,UAAW,OAAM,KAAK,iBAAiB,SAAS,EAAE;AACtD,UAAM,KAAK,EAAE;AACb,UAAM,SAAS,CAAC,GAAG,MAAM,EAAE;AAAA,MACvB,CAAC,GAAG,MACA,0BAA0B,GAAG,OAAO,WAAW,IAC3C,0BAA0B,GAAG,OAAO,WAAW,KACnD,EAAE,YAAY,EAAE;AAAA,IACxB;AACA,eAAW,SAAS,OAAO,MAAM,GAAG,KAAK,GAAG;AACxC,YAAM,QAAQ,MAAM,SAAS;AAC7B,YAAM,MAAM,0BAA0B,OAAO,OAAO,WAAW;AAC/D,YAAM;AAAA,QACF,KAAK,MAAM,OAAO,KAAK,UAAU,KAAK,CAAC,MAAMA,cAAa,GAAG,CAAC,SAAIA,cAAa,gBAAgB,OAAO,WAAW,CAAC,CAAC,KAAK,MAAM,oBAAoB,MAAM,WAAW,KAAK;AAAA,MAC5K;AAAA,IACJ;AAAA,EACJ;AAEA,QAAM,KAAK,EAAE;AACb,QAAM;AAAA,IACF,wEAAwE,WAAW,MAAM;AAAA,EAC7F;AACA,SAAO,MAAM,KAAK,IAAI;AAC1B;AAEA,SAAS,yBAAyB,SAAuC;AACrE,QAAM,QAAkB,CAAC;AACzB,QAAM,cAAc,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AAC5D,QAAM,KAAK,uBAAkBA,cAAa,WAAW,CAAC,MAAM,QAAQ,MAAM,mBAAmB;AAC7F,QAAM,KAAK,EAAE;AACb,MAAI,QAAQ,WAAW,GAAG;AACtB,UAAM,KAAK,8BAA8B;AACzC,WAAO,MAAM,KAAK,IAAI;AAAA,EAC1B;AAKA,QAAMG,UAAS,CAAC,QAAwB;AACpC,UAAM,IAAI,IAAI,MAAM,KAAK;AACzB,WAAO,IAAI,SAAS,EAAE,CAAC,GAAG,EAAE,IAAI;AAAA,EACpC;AACA,QAAM,SAAmB,CAAC;AAC1B,aAAW,KAAK,SAAS;AACrB,UAAM,MAAMA,QAAO,EAAE,GAAG;AACxB,UAAM,OAAO,OAAO,OAAO,SAAS,CAAC;AACrC,QAAI,QAAQ,QAAQ,KAAK,WAAW,KAAK,OAAO;AAC5C,WAAK,SAAS,EAAE;AAChB,WAAK,SAAS;AACd,WAAK,UAAU,EAAE;AAAA,IACrB,OAAO;AACH,aAAO,KAAK,EAAE,UAAU,EAAE,KAAK,QAAQ,EAAE,KAAK,UAAU,KAAK,OAAO,GAAG,QAAQ,EAAE,QAAQ,MAAM,EAAE,KAAK,CAAC;AAAA,IAC3G;AAAA,EACJ;AACA,aAAW,KAAK,OAAO,MAAM,GAAG,EAAE,GAAG;AACjC,UAAM,QAAQ,EAAE,UAAU,IAAI,EAAE,WAAW,GAAG,EAAE,QAAQ,SAAI,EAAE,MAAM;AACpE,UAAM,KAAK,KAAK,KAAK,MAAM,EAAE,KAAK,UAAUH,cAAa,EAAE,MAAM,CAAC,GAAG,EAAE,QAAQ,IAAI,KAAK,KAAK,MAAM,EAAE,SAAS,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE;AAAA,EACnJ;AACA,MAAI,OAAO,SAAS,IAAI;AACpB,UAAM,KAAK,aAAa,OAAO,SAAS,EAAE,cAAc;AAAA,EAC5D;AACA,SAAO,MAAM,KAAK,IAAI;AAC1B;AAEA,SAAS,uBACL,SACA,YACA,MACA,OACM;AACN,MAAI,WAAW;AACf,MAAI,WAAY,YAAW,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU;AAEvE,MAAI,SAAS,OAAQ,UAAS,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAAA,WACrD,SAAS,OAAQ,UAAS,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,cAAc,EAAE,IAAI,KAAK,EAAE,SAAS,EAAE,MAAM;AAAA,MAChG,UAAS,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AAEhD,QAAM,cAAc,SAAS,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AAC7D,QAAM,YAAY,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AAC1D,QAAM,SAAS,aACT,uBAAkB,UAAU,KAAKA,cAAa,WAAW,CAAC,MAAM,SAAS,MAAM,WAAW,IAAI,aAAa,SAAS,CAAC,iBACrH,uBAAkBA,cAAa,WAAW,CAAC,MAAM,SAAS,MAAM;AACtE,QAAM,QAAQ,CAAC,QAAQ,aAAa,IAAI,IAAI,EAAE;AAC9C,QAAM,QAAQ,SAAS,MAAM,GAAG,KAAK;AACrC,aAAW,WAAW,OAAO;AACzB,UAAM,KAAK,KAAK,QAAQ,GAAG,KAAKA,cAAa,QAAQ,MAAM,CAAC,KAAK,QAAQ,IAAI,EAAE;AAAA,EACnF;AACA,MAAI,SAAS,SAAS,MAAM,QAAQ;AAChC,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,GAAG,MAAM,MAAM,OAAO,SAAS,MAAM,SAAS;AAAA,EAC7D;AACA,SAAO,MAAM,KAAK,IAAI;AAC1B;AAEA,SAAS,0BACL,QACA,OACA,MACA,OACA,aACM;AACN,MAAI,SAAS,CAAC,GAAG,MAAM;AACvB,MAAI,SAAS,OAAQ,QAAO,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AAAA,WAC3D,SAAS,MAAO,QAAO,KAAK,CAAC,GAAG,MAAM,EAAE,gBAAgB,EAAE,aAAa;AAAA;AAE5E,WAAO;AAAA,MACH,CAAC,GAAG,MACA,0BAA0B,GAAG,OAAO,WAAW,IAC3C,0BAA0B,GAAG,OAAO,WAAW,KACnD,EAAE,YAAY,EAAE;AAAA,IACxB;AAEJ,QAAM,eAAe,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,gBAAgB,GAAG,WAAW,GAAG,CAAC;AACnF,QAAM,iBAAiB,OAAO;AAAA,IAC1B,CAAC,GAAG,MAAM,IAAI,0BAA0B,GAAG,OAAO,WAAW;AAAA,IAC7D;AAAA,EACJ;AACA,QAAM,QAAQ;AAAA,IACV,qBAAgB,OAAO,MAAM,aAAaA,cAAa,cAAc,CAAC,oBAAeA,cAAa,YAAY,CAAC;AAAA,EACnH;AACA,QAAM,YAAY,cAAc,QAAQ,WAAW;AACnD,MAAI,UAAW,OAAM,KAAK,eAAe,SAAS,EAAE;AACpD,QAAM,KAAK,EAAE;AACb,QAAM,QAAQ,OAAO,MAAM,GAAG,KAAK;AACnC,aAAW,SAAS,OAAO;AACvB,UAAM,SAAS,MAAM,eAAe,SAAS,IAAI,YAAY,MAAM,eAAe,KAAK,GAAG,CAAC,MAAM;AACjG,UAAM,QAAQ,MAAM,SAAS;AAC7B,UAAM,MAAM,0BAA0B,OAAO,OAAO,WAAW;AAC/D,UAAM;AAAA,MACF,KAAK,MAAM,OAAO,KAAK,UAAU,KAAK,CAAC,MAAMA,cAAa,GAAG,CAAC,SAAIA,cAAa,gBAAgB,OAAO,WAAW,CAAC,CAAC,KAAK,MAAM,oBAAoB,MAAM,cAAc,MAAM,aAAa,IAAI,MAAM,UAAU,GAAG,MAAM;AAAA,IAC1N;AACA,UAAM,KAAK,QAAQ,KAAK,GAAG;AAAA,EAC/B;AACA,MAAI,OAAO,SAAS,MAAM,QAAQ;AAC9B,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,GAAG,MAAM,MAAM,OAAO,OAAO,MAAM,SAAS;AAAA,EAC3D;AACA,SAAO,MAAM,KAAK,IAAI;AAC1B;AAEO,SAAS,WACZ,OACA,SACM;AACN,QAAME,gBAAe,MAAM,OACtB,OAAO,CAAC,MAAM,EAAE,MAAM,EACtB,KAAK,CAAC,GAAG,MAAMD,aAAY,EAAE,OAAO,IAAIA,aAAY,EAAE,OAAO,CAAC;AAEnE,MAAI,YAAY,QAAW;AACvB,UAAM,QAAQ,MAAM,OAAO,KAAK,CAAC,MAAM,EAAE,YAAY,OAAO;AAC5D,QAAI,CAAC,OAAO;AACR,YAAM,aAAaC,cAAa,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,IAAI;AAC/D,aAAO,SAAS,OAAO,8BAA8B,UAAU;AAAA,IACnE;AACA,QAAI,CAAC,MAAM,QAAQ;AACf,aAAO,SAAS,OAAO;AAAA,IAC3B;AACA,UAAM,QAAQ,GAAG,MAAM,oBAAoB,MAAM;AACjD,WAAO;AAAA,EAAsC,MAAM,OAAO;AAAA;AAAA,GAAQ,OAAO,MAAM,KAAK,cAAc,MAAM,SAAS,QAAQ;AAAA,EAC7H;AAEA,MAAIA,cAAa,WAAW,EAAG,QAAO;AAEtC,QAAM,QAAQ,CAAC,8BAA8BA,cAAa,MAAM,IAAI;AACpE,aAAW,SAASA,eAAc;AAC9B,UAAM,QAAQ,GAAG,MAAM,oBAAoB,MAAM;AACjD,UAAM,UAAU,MAAM,QAAQ,MAAM,GAAG,GAAG;AAC1C,UAAM,KAAK;AAAA,EAAK,MAAM,OAAO,MAAM,KAAK,OAAO,MAAM,SAAS,QAAQ,GAAG;AACzE,UAAM,KAAK,KAAK,OAAO,GAAG,MAAM,QAAQ,SAAS,MAAM,QAAQ,EAAE,EAAE;AAAA,EACvE;AACA,QAAM,KAAK;AAAA,2CAA8C;AACzD,SAAO,MAAM,KAAK,IAAI;AAC1B;;;AChUO,SAAS,wBACZ,OACA,UACA,QACA,QAAsB,CAAC,GACV;AACb,QAAM,OAAO,WAAW,EAAE,aAAa,MAAM,eAAe,mBAAmB,CAAC;AAChF,QAAM,YAAY,WAAW,UAAU;AAAA,IACnC,UAAU,MAAM;AAAA,IAChB,WAAW,iBAAiB,MAAM,WAAW,IAAI;AAAA,EACrD,CAAC;AACD,MAAI,UAA4B,EAAE,GAAG,OAAO,aAAa,UAAU,IAAI;AAEvE,QAAM,cAAc,2BAA2B,QAAQ;AACvD,MAAI,gBAAgB;AAEpB,aAAW,cAAc,aAAa;AAClC,UAAM,SAAS,cAAc,WAAW,OAAO,WAAW,MAAM;AAChE,QAAI,OAAO,WAAW,EAAG;AACzB,UAAM,SAAS,KAAK,iBAAiB,EAAE,QAAQ,UAAU,OAAO,SAAS,OAAO,CAAC;AACjF,cAAU,OAAO;AACjB,qBAAiB,OAAO,OAAO;AAAA,EACnC;AAEA,SAAO,EAAE,OAAO,SAAS,cAAc;AAC3C;AAOA,SAAS,2BAA2B,UAA+C;AAC/E,QAAM,cAAoC,CAAC;AAC3C,aAAW,WAAW,UAAU;AAC5B,QAAI,QAAQ,aAAa,cAAc,QAAQ,gBAAgB,YAAa;AAC5E,QAAI;AACJ,QAAI;AACA,cAAQ,KAAK,MAAM,QAAQ,QAAQ,EAAE;AAAA,IACzC,QAAQ;AACJ;AAAA,IACJ;AACA,gBAAY,KAAK,EAAE,QAAQ,QAAQ,YAAY,MAAM,CAAC;AAAA,EAC1D;AACA,SAAO;AACX;AAEA,SAAS,cACL,OACA,QAOD;AACC,QAAM,UAAW,OAAmC;AACpD,MAAI,CAAC,MAAM,QAAQ,OAAO,EAAG,QAAO,CAAC;AACrC,QAAM,SAAS,CAAC;AAChB,aAAW,SAAS,SAAS;AACzB,QAAI,CAAC,SAAS,OAAO,UAAU,SAAU;AACzC,UAAM,IAAI;AACV,QAAI,OAAO,EAAE,YAAY,SAAU;AACnC,UAAM,QAAQ,EAAE,WAAW,EAAE;AAC7B,UAAM,MAAM,EAAE,SAAS,EAAE;AACzB,QAAI,OAAO,UAAU,YAAY,OAAO,QAAQ,SAAU;AAC1D,WAAO,KAAK;AAAA,MACR,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,SAAS,EAAE;AAAA,MACX,OAAO,OAAO,EAAE,UAAU,WAAW,EAAE,QAAQ;AAAA,MAC/C,gBAAgB;AAAA,IACpB,CAAC;AAAA,EACL;AACA,SAAO;AACX;;;AClGO,SAAS,wBACd,UACA,YACkB;AAClB,SAAO,aAAa,aAAa,SAAS;AAC5C;;;ACJO,SAAS,KAAK,MAAsB;AACvC,MAAI,IAAI;AACR,MAAI,EAAE,UAAU,EAAG,QAAO;AAC1B,MAAI,EAAE,SAAS,KAAK,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE,IAAI;AAAA,WACnC,EAAE,SAAS,KAAK,KAAK,EAAE,SAAS,KAAK,KAAK,EAAE,SAAS,KAAK,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AAAA,WAC9E,EAAE,SAAS,MAAM,KAAK,EAAE,SAAS,MAAM,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AAAA,WAC3D,EAAE,SAAS,GAAG,KAAK,CAAC,EAAE,SAAS,IAAI,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AAChE,MAAI,EAAE,SAAS,KAAK,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AACxD,MAAI,EAAE,SAAS,IAAI,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AACvD,MAAI,EAAE,SAAS,OAAO,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AAAA,WACjD,EAAE,SAAS,MAAM,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE,IAAI;AAAA,WACzD,EAAE,SAAS,KAAK,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AAC7D,MAAI,EAAE,SAAS,MAAM,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AACzD,MAAI,EAAE,SAAS,MAAM,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AACzD,MAAI,EAAE,SAAS,IAAI,KAAK,EAAE,SAAS,EAAG,KAAI,EAAE,MAAM,GAAG,EAAE;AACvD,SAAO;AACX;;;ACIO,IAAM,MAAM;AACnB,IAAM,aAAa;AAEnB,IAAM,eAAe,IAAI,KAAK,UAAU,MAAM,EAAE,aAAa,OAAO,CAAC;AAYrE,SAAS,aAAa,MAA0B;AAC5C,QAAM,QAAQ,KAAK,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC;AAC9C,MAAI,MAAM,SAAS,EAAG,QAAO;AAC7B,QAAM,MAAM,KAAK,KAAK,EAAE;AACxB,QAAM,MAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,IAAI,SAAS,GAAG,IAAK,KAAI,KAAK,IAAI,MAAM,GAAG,IAAI,CAAC,CAAC;AACrE,aAAW,MAAM,IAAK,KAAI,KAAK,EAAE;AACjC,SAAO;AACX;AAMO,SAAS,SAAS,MAAc,OAAwB,CAAC,GAAa;AACzE,QAAM,QAAQ,KAAK,YAAY;AAC/B,QAAM,SAAmB,CAAC;AAE1B,QAAM,QAAQ,MAAM,MAAM,UAAU,KAAK,CAAC;AAC1C,WAAS,KAAK,OAAO;AACjB,QAAI,EAAE,UAAU,GAAG;AACf,UAAI,KAAK,KAAM,KAAI,KAAK,CAAC;AACzB,aAAO,KAAK,CAAC;AAAA,IACjB;AAAA,EACJ;AAcA,MAAI,CAAC,IAAI,KAAK,KAAK,EAAG,QAAO;AAI7B,QAAM,UAAsB,CAAC;AAC7B,MAAI,MAAuB;AAC3B,aAAW,KAAK,aAAa,QAAQ,KAAK,GAAG;AACzC,UAAM,IAAI,EAAE;AACZ,QAAI,EAAE,WAAW,EAAG;AACpB,QAAI,IAAI,KAAK,CAAC,GAAG;AACb,OAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;AAAA,IACvB,WAAW,KAAK;AACZ,cAAQ,KAAK,GAAG;AAChB,YAAM;AAAA,IACV;AAAA,EACJ;AACA,MAAI,IAAK,SAAQ,KAAK,GAAG;AAEzB,aAAW,QAAQ,SAAS;AACxB,WAAO,KAAK,GAAG,aAAa,IAAI,CAAC;AAAA,EACrC;AAEA,SAAO;AACX;AAGO,SAAS,YAAY,MAAwB;AAChD,QAAM,QAAkB,CAAC;AACzB,WAAS,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK;AACtC,UAAM,OAAO,KAAK,MAAM,GAAG,IAAI,CAAC;AAChC,QAAI,KAAK,KAAK,EAAE,WAAW,KAAK,OAAQ,OAAM,KAAK,IAAI;AAAA,EAC3D;AACA,SAAO;AACX;AAGO,SAAS,MAAM,MAAcE,OAAoC;AACpE,QAAM,IAAI,oBAAI,IAAoB;AAClC,aAAW,KAAK,SAAS,MAAM,EAAE,MAAAA,MAAK,CAAC,EAAG,GAAE,IAAI,IAAI,EAAE,IAAI,CAAC,KAAK,KAAK,CAAC;AACtE,SAAO;AACX;;;AC3FA,IAAM,oBAAoB,IAAI,OAAO;AACrC,IAAI,WAAW;AACf,IAAM,QAAQ,oBAAI,IAAyB;AAC3C,IAAI,cAAc;AAElB,SAAS,MAAM,MAA2B;AACtC,QAAM,KAAK,MAAM,MAAM,IAAI;AAC3B,MAAI,MAAM;AACV,aAAW,KAAK,GAAG,OAAO,EAAG,QAAO;AACpC,QAAM,QAAQ,KAAK,YAAY;AAC/B,SAAO,EAAE,IAAI,KAAK,OAAO,OAAO,IAAI,IAAI,YAAY,KAAK,CAAC,EAAE;AAChE;AAEO,SAAS,YAAY,MAA2B;AACnD,QAAM,MAAM,MAAM,IAAI,IAAI;AAC1B,MAAI,IAAK,QAAO;AAChB,QAAM,IAAI,MAAM,IAAI;AACpB,MAAI,KAAK,SAAS,KAAK,KAAK,UAAU,UAAU;AAC5C,WAAO,cAAc,KAAK,SAAS,YAAY,MAAM,OAAO,GAAG;AAC3D,YAAM,IAAI,MAAM,KAAK,EAAE,KAAK,EAAE;AAC9B,qBAAe,EAAE;AACjB,YAAM,OAAO,CAAC;AAAA,IAClB;AACA,UAAM,IAAI,MAAM,CAAC;AACjB,mBAAe,KAAK;AAAA,EACxB;AACA,SAAO;AACX;AAGO,SAAS,mBAAyB;AACrC,QAAM,MAAM;AACZ,gBAAc;AAClB;AAMO,SAAS,eAAe,OAAqB;AAChD,aAAW,KAAK,IAAI,GAAG,KAAK;AAC5B,SAAO,cAAc,YAAY,MAAM,OAAO,GAAG;AAC7C,UAAM,IAAI,MAAM,KAAK,EAAE,KAAK,EAAE;AAC9B,mBAAe,EAAE;AACjB,UAAM,OAAO,CAAC;AAAA,EAClB;AACJ;AAGO,SAAS,eAAmD;AAC/D,SAAO,EAAE,SAAS,MAAM,MAAM,OAAO,YAAY;AACrD;;;ACzEO,IAAM,qBAAsC;AAAA,EAC/C,MAAM;AAAA,EACN,aAAa;AAAA,EACb,MAAM,MAAmB,OAA8B;AACnD,UAAM,QAAQ,MAAM,YAAY,EAAE,KAAK,EAAE,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAChF,QAAI,MAAM,WAAW,EAAG,QAAO,KAAK,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,OAAO,EAAE,EAAE;AACzE,WAAO,KAAK,IAAI,CAAC,MAAM;AACnB,YAAM,WAAW,YAAY,EAAE,IAAI,EAAE;AACrC,UAAI,QAAQ;AACZ,iBAAW,QAAQ,MAAO,UAASC,kBAAiB,UAAU,IAAI;AAClE,aAAO,EAAE,KAAK,EAAE,KAAK,MAAM;AAAA,IAC/B,CAAC;AAAA,EACL;AACJ;AAEA,SAASA,kBAAiB,UAAkB,QAAwB;AAChE,MAAI,CAAC,OAAQ,QAAO;AACpB,SAAO,SAAS,MAAM,MAAM,EAAE,SAAS;AAC3C;;;ACXO,IAAM,gBAAiC;AAAA,EAC1C,MAAM;AAAA,EACN,aAAa;AAAA,EACb,MAAM,MAAmB,OAA8B;AACnD,UAAM,IAAI,KAAK;AACf,UAAM,KAAK;AACX,UAAM,IAAI;AACV,UAAM,SAAS,KAAK,IAAI,CAAC,MAAM;AAC3B,YAAM,IAAI,YAAY,EAAE,IAAI;AAC5B,aAAO,EAAE,IAAI,EAAE,KAAK,IAAI,EAAE,IAAI,KAAK,EAAE,IAAI;AAAA,IAC7C,CAAC;AACD,UAAM,QAAQ,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,KAAK,CAAC,KAAK,KAAK;AAE5D,UAAM,SAAS,SAAS,OAAO,EAAE,MAAM,KAAK,CAAC;AAC7C,QAAI,OAAO,WAAW,EAAG,QAAO,KAAK,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,OAAO,EAAE,EAAE;AAE1E,UAAM,MAAM,oBAAI,IAAoB;AACpC,eAAW,KAAK,IAAI,IAAI,MAAM,GAAG;AAC7B,UAAI,KAAK;AACT,iBAAW,KAAK,OAAQ,KAAI,EAAE,GAAG,IAAI,CAAC,EAAG;AACzC,UAAI,IAAI,GAAG,KAAK,IAAI,KAAK,IAAI,KAAK,QAAQ,KAAK,IAAI,CAAC;AAAA,IACxD;AAEA,WAAO,OAAO,IAAI,CAAC,MAAM;AACrB,UAAI,QAAQ;AACZ,iBAAW,KAAK,QAAQ;AACpB,cAAM,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK;AACzB,YAAI,MAAM,EAAG;AACb,cAAM,OAAO,IAAI,IAAI,CAAC,KAAK;AAC3B,iBAAU,QAAQ,KAAK,KAAK,OAAQ,IAAI,MAAM,IAAI,IAAK,IAAI,EAAE,OAAQ,SAAS;AAAA,MAClF;AACA,aAAO,EAAE,KAAK,EAAE,IAAI,MAAM;AAAA,IAC9B,CAAC;AAAA,EACL;AACJ;;;ACzBO,IAAM,iBAAkC;AAAA,EAC3C,MAAM;AAAA,EACN,aAAa;AAAA,EACb,MAAM,MAAmB,OAA8B;AAGnD,UAAM,UAAU,MAAM,YAAY,EAAE,MAAM,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,UAAU,KAAM,EAAE,UAAU,KAAK,IAAI,KAAK,CAAC,CAAE;AACjH,QAAI,QAAQ,WAAW,EAAG,QAAO,KAAK,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,OAAO,EAAE,EAAE;AAE3E,UAAM,SAAS,oBAAI,IAAY;AAC/B,eAAW,KAAK,QAAS,YAAW,KAAK,YAAY,CAAC,EAAG,QAAO,IAAI,CAAC;AACrE,QAAI,OAAO,SAAS,EAAG,QAAO,KAAK,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,OAAO,EAAE,EAAE;AAExE,WAAO,KAAK,IAAI,CAAC,MAAM;AACnB,YAAM,WAAW,YAAY,EAAE,IAAI,EAAE;AACrC,UAAI,OAAO;AACX,iBAAW,KAAK,OAAQ,KAAI,SAAS,IAAI,CAAC,EAAG;AAC7C,aAAO,EAAE,KAAK,EAAE,KAAK,OAAO,OAAO,OAAO,KAAK;AAAA,IACnD,CAAC;AAAA,EACL;AACJ;;;ACxBA,IAAM,SAAS;AACf,IAAM,UAAU;AAET,IAAM,kBAAmC;AAAA,EAC5C,MAAM;AAAA,EACN,aAAa;AAAA,EACb,MAAM,MAAmB,OAA8B;AACnD,UAAM,KAAK,cAAc,MAAM,MAAM,KAAK;AAC1C,UAAM,KAAK,eAAe,MAAM,MAAM,KAAK;AAC3C,UAAM,QAAQ,KAAK,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,GAAG,IAAI;AACtD,UAAM,QAAQ,KAAK,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,GAAG,IAAI;AACtD,UAAM,QAAQ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,QAAQ,KAAK,CAAC,CAAC;AAC7D,UAAM,QAAQ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,QAAQ,KAAK,CAAC,CAAC;AAC7D,WAAO,KAAK,IAAI,CAAC,OAAO;AAAA,MACpB,KAAK,EAAE;AAAA,MACP,OAAO,UAAU,MAAM,IAAI,EAAE,GAAG,KAAK,KAAK,WAAW,MAAM,IAAI,EAAE,GAAG,KAAK;AAAA,IAC7E,EAAE;AAAA,EACN;AACJ;;;AC5BA,IAAMC,YAAW,oBAAI,IAAgC;AAE9C,SAAS,wBAAwB,MAAgC;AACpE,EAAAA,UAAS,IAAI,KAAK,MAAM,IAAI;AAChC;AAEO,SAAS,mBAAmB,MAA8C;AAC7E,SAAOA,UAAS,IAAI,IAAI;AAC5B;AAEO,SAAS,uBAA6C;AACzD,SAAO,CAAC,GAAGA,UAAS,OAAO,CAAC;AAChC;AAGA,wBAAwB,kBAAkB;AAC1C,wBAAwB,aAAa;AACrC,wBAAwB,cAAc;AACtC,wBAAwB,eAAe;;;ACkBhC,IAAM,uBAA8C;AAAA,EACvD,MAAM;AAAA,EACN,WAAW;AAAA,EACX,MAAM;AAAA,EACN,OAAO;AACX;AAwDO,IAAM,oBAAoB;;;ACvF1B,SAAS,UAAU,OAAsC;AAC5D,SAAO,MAAM,OAAO,IAAI,CAAC,OAAoC;AAAA,IACzD,MAAM;AAAA,IACN,KAAK,EAAE;AAAA,IACP,MAAM,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,WAAW,EAAE;AAAA,IACzC,OAAO,EAAE,SAAS,EAAE;AAAA,IACpB,SAAS,EAAE;AAAA,IACX,MAAM,EAAE,QAAQ;AAAA,IAChB,QAAQ,EAAE;AAAA,EACd,EAAE;AACN;AAUO,SAAS,YAAY,MAAmC;AAC3D,SAAO,KAAK,IAAI,CAAC,OAAkB;AAAA,IAC/B,MAAM;AAAA,IACN,KAAK,EAAE;AAAA,IACP,MAAM,EAAE;AAAA,IACR,OAAO,GAAG,EAAE,IAAI,KAAK,EAAE,KAAK,MAAM,GAAG,EAAE,CAAC;AAAA,IACxC,MAAM,EAAE;AAAA,IACR,SAAS,EAAE;AAAA,IACX,MAAM,EAAE;AAAA,IACR,QAAQ,EAAE;AAAA,EACd,EAAE;AACN;AAEA,SAAS,gBAAgB,QAAuB,MAAmB,IAA0C;AACzG,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,QAAM,WAAW,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AACpD,SAAO,OAAO,IAAI,CAAC,MAAM;AACrB,UAAM,MAAM,SAAS,IAAI,EAAE,GAAG;AAC9B,QAAI,CAAC,IAAK,QAAO;AACjB,UAAM,IACF,IAAI,SAAS,YACP,IAAI,SAAS,SACT,GAAG,OACH,IAAI,SAAS,cACX,GAAG,YACH,GAAG,OACT,GAAG;AACb,WAAO,EAAE,KAAK,EAAE,KAAK,OAAO,EAAE,QAAQ,EAAE;AAAA,EAC5C,CAAC;AACL;AAEA,SAAS,UACL,MACA,OACA,SACwC;AACxC,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,gBAAgB,QAAQ,iBAAiB;AAC/C,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,WAAW,QAAQ,aAAa;AACtC,QAAM,KAAK,EAAE,GAAG,sBAAsB,GAAG,QAAQ,YAAY;AAE7D,QAAM,OAAO,mBAAmB,QAAQ;AACxC,MAAI,CAAC,KAAM,QAAO,CAAC;AACnB,MAAI,KAAK,WAAW,EAAG,QAAO,CAAC;AAE/B,QAAM,kBAAkB,KAAK,MAAM,MAAM,KAAK;AAE9C,QAAM,eAAe,CAAC,aAA4C;AAC9D,UAAM,QAAQ,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AACjD,WAAO,SACF,IAAI,CAAC,MAA2B;AAC7B,YAAM,MAAM,MAAM,IAAI,EAAE,GAAG;AAC3B,UAAI,CAAC,IAAK,QAAO;AACjB,aAAO;AAAA,QACH,MAAM,IAAI;AAAA,QACV,KAAK,IAAI;AAAA,QACT,SAAS,IAAI;AAAA,QACb,MAAM,IAAI,QAAQ;AAAA,QAClB,OAAO,EAAE;AAAA,QACT,OAAO,IAAI;AAAA,QACX,SAAS,YAAY,IAAI,MAAM,OAAO,aAAa;AAAA,QACnD,MAAM,IAAI;AAAA,QACV,QAAQ,IAAI;AAAA,MAChB;AAAA,IACJ,CAAC,EACA,OAAO,CAAC,MAAyB,MAAM,QAAQ,EAAE,SAAS,QAAQ,EAClE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,KAAK;AAAA,EACvB;AAEA,MAAI,2BAA2B,SAAS;AACpC,WAAO,gBAAgB,KAAK,CAAC,QAAQ,aAAa,gBAAgB,KAAK,MAAM,EAAE,CAAC,CAAC;AAAA,EACrF;AACA,SAAO,aAAa,gBAAgB,iBAAiB,MAAM,EAAE,CAAC;AAClE;AAGO,SAAS,aAAa,MAAmB,OAAe,UAAyB,CAAC,GAAmB;AACxG,QAAM,SAAS,UAAU,MAAM,OAAO,OAAO;AAC7C,MAAI,kBAAkB,SAAS;AAC3B,UAAM,IAAI;AAAA,MACN,4BAA4B,QAAQ,aAAa,iBAAiB;AAAA,IACtE;AAAA,EACJ;AACA,SAAO;AACX;AAKA,eAAsB,kBAAkB,MAAmB,OAAe,UAAyB,CAAC,GAA4B;AAC5H,SAAO,MAAM,UAAU,MAAM,OAAO,OAAO;AAC/C;AAMA,SAAS,YAAY,MAAc,OAAe,KAAqB;AACnE,MAAI,CAAC,KAAM,QAAO;AAClB,QAAM,QAAQ,MAAM,YAAY,EAAE,KAAK,EAAE,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAChF,MAAI,MAAM,WAAW,EAAG,QAAO,KAAK,MAAM,GAAG,GAAG;AAEhD,QAAM,QAAQ,KAAK,YAAY;AAC/B,MAAI,SAAS;AACb,aAAW,QAAQ,OAAO;AACtB,UAAM,MAAM,MAAM,QAAQ,IAAI;AAC9B,QAAI,OAAO,GAAG;AACV,eAAS;AACT;AAAA,IACJ;AAAA,EACJ;AAEA,MAAI,SAAS,EAAG,QAAO,KAAK,MAAM,GAAG,GAAG;AAExC,QAAM,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,MAAM,CAAC,IAAI,EAAE;AACjD,QAAM,QAAQ,KAAK,IAAI,GAAG,SAAS,IAAI;AACvC,QAAM,MAAM,KAAK,IAAI,KAAK,QAAQ,QAAQ,GAAG;AAC7C,QAAM,SAAS,QAAQ,IAAI,WAAM;AACjC,QAAM,SAAS,MAAM,KAAK,SAAS,WAAM;AACzC,SAAO,SAAS,KAAK,MAAM,OAAO,GAAG,EAAE,KAAK,IAAI;AACpD;","names":["owner","block","formatTokens","numericPart","activeBlocks","refNum","stem","countOccurrences","registry"]}