kordoc 4.4.1 → 4.6.0

package/dist/chunk-TGAWXMXB.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/ocr/ruling-lines.ts","../src/ocr/engine.ts","../src/ocr/pdf-ocr.ts"],"sourcesContent":["/**\n * 래스터 괘선 감지 — 스캔/이미지 페이지의 픽셀에서 표 괘선(수평/수직 선)을\n * 찾아 선 기반 표 파이프라인(line-detector → table-grid)에 공급한다.\n *\n * PDF 그래픽 ops 가 없는 OCR 경로는 종전에 클러스터 감지기만 탔는데,\n * 병합 라벨 셀 + 다중줄 서술형 서식(정부 제출 서식류)은 라인 클러스터로\n * 행 경계를 잡을 수 없다. 괘선은 이미지에 실존하므로 이진화 + 런렝스로\n * 직접 감지한다 — ML 없음, 축 정렬 전제(스캔 스큐 보정은 스코프 밖).\n *\n * 오탐 방어 3겹 (실측: 우수사례 제출 서식 스캔 — 진짜 괘선은 길고 얇음):\n * - 최소 길이 20pt: 글리프 획(가로 ≤한 글자폭·세로 ≤글자높이)은 걸러짐\n * - 두께 상한 2.5pt: 굵은 제목 획(6~13px)·텍스트 줄 밴드·채운 색상바 탈락\n * - 양측 잉크 포위 제외: 색상바(붙임 박스 등) 안 흰 글자 틈새 슬리버 탈락\n */\n\nimport type { LineSegment } from \"../pdf/line-types.js\"\n\n/** 잉크 판정 휘도 상한 — 셀 배경 음영(회색 ~220)은 통과, 실선(진회~검정·남색)만 잉크 */\nconst INK_LUMA_MAX = 190\n/** 최소 선 길이 (pt) — 최소 셀 변(≈7mm)과 대형 글리프 획(≤1em) 사이 */\nconst MIN_LINE_LENGTH_PT = 20\n/** 선 두께 상한 (pt) — 진짜 괘선(0.12~0.7mm ≈ 0.3~2pt)과 굵은 글리프 획(2pt+) 분리 */\nconst MAX_LINE_WIDTH_PT = 2.5\n/** 런 내 허용 끊김 (px) — 스캔 노이즈/JPEG 아티팩트 */\nconst GAP_TOL_PX = 2\n/** 밴드 병합 시 요구하는 x(또는 y) 범위 겹침 비율 (짧은 쪽 기준) */\nconst BAND_OVERLAP_RATIO = 0.5\n/** 밴드 양측(±2px)이 이 비율 이상 잉크면 채운 영역 내부 슬리버로 판정 */\nconst SURROUND_INK_RATIO = 0.35\n\n/** 픽셀 공간(top-left origin) 선분 — 두께는 밴드 픽셀 수 */\nexport interface PxSegment {\n  x1: number; y1: number\n  x2: number; y2: number\n  thicknessPx: number\n}\n\nexport interface RulingLines {\n  horizontals: PxSegment[]\n  verticals: PxSegment[]\n}\n\n/**\n * RGBA 래스터에서 수평/수직 괘선 감지.\n * @param scale 렌더 스케일 (px/pt) — 길이·두께 임계를 pt 기준으로 환산\n */\nexport function detectRulingLines(\n  rgba: Uint8Array,\n  width: number,\n  height: number,\n  scale: number,\n): RulingLines {\n  const minLenPx = Math.round(MIN_LINE_LENGTH_PT * scale)\n  const maxThickPx = Math.max(1, Math.floor(MAX_LINE_WIDTH_PT * scale))\n\n  // 잉크 마스크 1회 구축 — 수평/수직 두 패스가 공유\n  const ink = new Uint8Array(width * height)\n  for (let p = 0, i = 0; p < ink.length; p++, i += 4) {\n    // ITU-R BT.601 휘도 근사 (정수 시프트)\n    const luma = (rgba[i] * 77 + rgba[i + 1] * 150 + rgba[i + 2] * 29) >> 8\n    if (luma <= INK_LUMA_MAX && rgba[i + 3] >= 128) ink[p] = 1\n  }\n\n  const horizontals = detectBands(ink, width, height, minLenPx, maxThickPx, false)\n  const verticals = detectBands(ink, width, height, minLenPx, maxThickPx, true)\n  return { horizontals, verticals }\n}\n\n/** 열린 밴드 — 인접 스캔라인의 런을 누적 */\ninterface Band {\n  lo: number // 런 진행축 시작 (h: x1, v: y1)\n  hi: number // 런 진행축 끝\n  first: number // 직교축 시작 스캔라인 (h: yTop, v: xLeft)\n  last: number // 직교축 마지막 스캔라인\n}\n\n/**\n * 스캔라인 런렝스 → 인접 라인 밴드 병합 → 두께 필터 → 선분 방출.\n * transpose=false 면 수평선(행 스캔), true 면 수직선(열 스캔).\n */\nfunction detectBands(\n  ink: Uint8Array,\n  width: number,\n  height: number,\n  minLenPx: number,\n  maxThickPx: number,\n  transpose: boolean,\n): PxSegment[] {\n  const lines = transpose ? width : height // 스캔라인 개수 (직교축)\n  const span = transpose ? height : width // 런 진행축 길이\n  const at = transpose\n    ? (line: number, pos: number) => ink[pos * width + line]\n    : (line: number, pos: number) => ink[line * width + pos]\n\n  const out: PxSegment[] = []\n  let open: Band[] = []\n\n  /** 밴드 양측(±2px 스캔라인)의 잉크 비율 — 채운 색상바 안 흰 글자 틈새 슬리버 판별 */\n  const surroundInkRatio = (b: Band, side: number): number => {\n    if (side < 0 || side >= lines) return 0\n    let dark = 0, total = 0\n    for (let pos = b.lo; pos <= b.hi; pos += 3) {\n      total++\n      if (at(side, pos) === 1) dark++\n    }\n    return total > 0 ? dark / total : 0\n  }\n\n  const emit = (b: Band) => {\n    const thick = b.last - b.first + 1\n    if (thick > maxThickPx) return // 색상바·텍스트 밴드\n    if (\n      surroundInkRatio(b, b.first - 2) >= SURROUND_INK_RATIO &&\n      surroundInkRatio(b, b.last + 2) >= SURROUND_INK_RATIO\n    ) return // 채운 영역 내부 슬리버\n    const center = (b.first + b.last) / 2\n    out.push(\n      transpose\n        ? { x1: center, y1: b.lo, x2: center, y2: b.hi, thicknessPx: thick }\n        : { x1: b.lo, y1: center, x2: b.hi, y2: center, thicknessPx: thick },\n    )\n  }\n\n  for (let line = 0; line < lines; line++) {\n    // 1) 이 스캔라인의 잉크 런 수집 (GAP_TOL_PX 이하 끊김 허용)\n    const runs: Array<{ lo: number; hi: number }> = []\n    let runStart = -1\n    let gap = 0\n    for (let pos = 0; pos <= span; pos++) {\n      const on = pos < span && at(line, pos) === 1\n      if (on) {\n        if (runStart < 0) runStart = pos\n        gap = 0\n      } else if (runStart >= 0) {\n        if (++gap > GAP_TOL_PX || pos >= span) {\n          const hi = pos - gap\n          if (hi - runStart + 1 >= minLenPx) runs.push({ lo: runStart, hi })\n          runStart = -1\n          gap = 0\n        }\n      }\n    }\n\n    // 2) 열린 밴드와 병합 — 직전 스캔라인까지 이어졌고 범위가 겹치면 확장\n    const next: Band[] = []\n    const used = new Set<number>()\n    for (const band of open) {\n      if (band.last !== line - 1) { emit(band); continue } // 연속 끊김 → 확정\n      let merged = false\n      for (let r = 0; r < runs.length; r++) {\n        if (used.has(r)) continue\n        const run = runs[r]\n        const overlap = Math.min(band.hi, run.hi) - Math.max(band.lo, run.lo) + 1\n        const shorter = Math.min(band.hi - band.lo, run.hi - run.lo) + 1\n        if (overlap >= shorter * BAND_OVERLAP_RATIO) {\n          band.lo = Math.min(band.lo, run.lo)\n          band.hi = Math.max(band.hi, run.hi)\n          band.last = line\n          next.push(band)\n          used.add(r)\n          merged = true\n          break\n        }\n      }\n      if (!merged) emit(band)\n    }\n    for (let r = 0; r < runs.length; r++) {\n      if (!used.has(r)) next.push({ lo: runs[r].lo, hi: runs[r].hi, first: line, last: line })\n    }\n    open = next\n  }\n  for (const band of open) emit(band)\n  return out\n}\n\n/**\n * 픽셀 선분 → PDF pt LineSegment (bottom-up, classifyAndAdd 규약:\n * 수평선 y1==y2·x1<x2, 수직선 x1==x2·y1<y2).\n */\nexport function rulingToPdfLines(\n  ruling: RulingLines,\n  scale: number,\n  pdfHeight: number,\n): { horizontals: LineSegment[]; verticals: LineSegment[] } {\n  const horizontals: LineSegment[] = ruling.horizontals.map(s => {\n    const y = pdfHeight - (s.y1 + s.y2) / 2 / scale\n    return {\n      x1: Math.min(s.x1, s.x2) / scale,\n      y1: y,\n      x2: Math.max(s.x1, s.x2) / scale,\n      y2: y,\n      lineWidth: s.thicknessPx / scale,\n    }\n  })\n  const verticals: LineSegment[] = ruling.verticals.map(s => {\n    const x = (s.x1 + s.x2) / 2 / scale\n    const yA = pdfHeight - Math.max(s.y1, s.y2) / scale\n    const yB = pdfHeight - Math.min(s.y1, s.y2) / scale\n    return { x1: x, y1: yA, x2: x, y2: yB, lineWidth: s.thicknessPx / scale }\n  })\n  return { horizontals, verticals }\n}\n","/**\n * 내장 텍스트 OCR 엔진 — PP-OCRv5 korean (det DBNet + rec SVTR/CTC) ONNX 추론.\n *\n * 파이프라인: 페이지 RGBA → det(선 검출) → 라인 crop → rec(CTC 인식) → OcrItem[]\n * (좌표는 입력 픽셀 기준 top-left origin — 호출자가 PDF 좌표계로 변환).\n *\n * 전·후처리는 공식 inference.yml 스펙 그대로:\n *  - det: BGR, 긴 변 960 리사이즈(32 배수), mean/std [0.485,0.456,0.406]/[0.229,0.224,0.225],\n *         DBPostProcess thresh 0.3 / box_thresh 0.6 / unclip_ratio 1.5\n *  - rec: BGR, 높이 48 고정 비율 리사이즈 + 우측 zero-pad, (x/255-0.5)/0.5,\n *         CTC 디코드 (blank=0, 1..N=사전, N+1=공백), text_score 0.5\n * DB 후처리의 contour+minAreaRect 는 축정렬 connected-component bbox 로 근사\n * (공문서 스캔은 수평 텍스트가 지배적 — 회전 텍스트는 v1 범위 밖).\n *\n * 의존성(onnxruntime-node, sharp)은 optional — 미설치 시 create()가 명확한 에러.\n * 모델 미다운로드 시에도 즉시 실패 — 호출자가 ensureOcrModels() 먼저.\n */\n\nimport type { InferenceSession } from \"onnxruntime-node\"\nimport { readFile } from \"fs/promises\"\nimport { join } from \"path\"\nimport {\n  OCR_DET_MODEL,\n  OCR_REC_MODEL,\n  OCR_REC_DICT,\n  getOcrModelsDir,\n  parseCharacterDict,\n} from \"./models.js\"\n\n/** OCR 인식 결과 한 줄 — 좌표는 입력 이미지 픽셀 (top-left origin, y down) */\nexport interface OcrItem {\n  text: string\n  x: number\n  y: number\n  w: number\n  h: number\n  /** CTC 평균 신뢰도 0~1 */\n  confidence: number\n}\n\n/** det 입력 긴 변 (공식 resize_long) — 1920 보존 실험은 recall Δ median +0.04pp에\n *  속도 -25%로 기각 (bench/ocr-accuracy.mjs 실측, 2026-08-02) */\nconst DET_LONG_SIDE = 960\nconst DET_THRESH = 0.3\nconst DET_BOX_THRESH = 0.6\nconst DET_UNCLIP_RATIO = 1.5\nconst DET_MIN_SIZE = 3\nconst DET_MAX_BOXES = 1000\nconst REC_HEIGHT = 48\nconst REC_MIN_WIDTH = 320\nconst REC_MAX_WIDTH = 3200\nconst TEXT_SCORE = 0.5\n\n// det: BGR 채널 순서에 yml 기재 순서 그대로 적용 (mean[0]→B)\nconst DET_MEAN = [0.485, 0.456, 0.406]\nconst DET_STD = [0.229, 0.224, 0.225]\n\ntype SharpFactory = (\n  input: Uint8Array | Buffer,\n  options?: { raw?: { width: number; height: number; channels: number } },\n) => SharpChain\ninterface SharpChain {\n  extract(region: { left: number; top: number; width: number; height: number }): SharpChain\n  resize(w: number, h: number, opts?: { fit?: string }): SharpChain\n  removeAlpha(): SharpChain\n  raw(): { toBuffer(): Promise<Buffer> }\n}\n\nexport class OcrEngine {\n  private det: InferenceSession\n  private rec: InferenceSession\n  private dict: string[]\n  private ort: typeof import(\"onnxruntime-node\")\n  private sharp: SharpFactory\n\n  private constructor(parts: {\n    det: InferenceSession\n    rec: InferenceSession\n    dict: string[]\n    ort: typeof import(\"onnxruntime-node\")\n    sharp: SharpFactory\n  }) {\n    this.det = parts.det\n    this.rec = parts.rec\n    this.dict = parts.dict\n    this.ort = parts.ort\n    this.sharp = parts.sharp\n  }\n\n  static async create(): Promise<OcrEngine> {\n    const [ortMod, sharpModRaw] = await Promise.all([\n      tryImport<typeof import(\"onnxruntime-node\")>(\"onnxruntime-node\", () => import(\"onnxruntime-node\")),\n      tryImport<{ default?: SharpFactory } & SharpFactory>(\n        \"sharp\",\n        () => import(\"sharp\") as unknown as Promise<{ default?: SharpFactory } & SharpFactory>,\n      ),\n    ])\n    const sharpAny = sharpModRaw as { default?: SharpFactory } | SharpFactory\n    const sharpMod: SharpFactory =\n      typeof sharpAny === \"function\" ? sharpAny : (sharpAny.default ?? (sharpAny as unknown as SharpFactory))\n\n    const dir = getOcrModelsDir()\n    const sessionOpts: import(\"onnxruntime-node\").InferenceSession.SessionOptions = {\n      graphOptimizationLevel: \"all\",\n      executionProviders: [\"cpu\"],\n      logSeverityLevel: 3, // paddle2onnx 변환 잔여물 W 로그 폭주 억제\n    }\n    const [det, rec, dictYml] = await Promise.all([\n      ortMod.InferenceSession.create(join(dir, OCR_DET_MODEL.filename), sessionOpts),\n      ortMod.InferenceSession.create(join(dir, OCR_REC_MODEL.filename), sessionOpts),\n      readFile(join(dir, OCR_REC_DICT.filename), \"utf-8\"),\n    ])\n    const dict = parseCharacterDict(dictYml)\n    if (dict.length === 0) throw new Error(\"OCR 사전 파싱 실패 — 모델 캐시를 삭제 후 재다운로드하세요\")\n\n    return new OcrEngine({ det, rec, dict, ort: ortMod, sharp: sharpMod })\n  }\n\n  /** onnxruntime-node 1.14+ InferenceSession.release() — 구버전은 무시 */\n  async destroy(): Promise<void> {\n    for (const s of [this.det, this.rec]) {\n      const rel = (s as unknown as { release?: () => Promise<void> }).release\n      if (typeof rel === \"function\") {\n        try { await rel.call(s) } catch { /* ignore */ }\n      }\n    }\n  }\n\n  /**\n   * 페이지 RGBA 픽셀 → 텍스트 라인 인식.\n   * 반환 좌표는 입력 픽셀 기준. 라인은 위→아래, 좌→우 정렬.\n   */\n  async recognizePage(rgba: Uint8Array, width: number, height: number): Promise<OcrItem[]> {\n    if (width < DET_MIN_SIZE || height < DET_MIN_SIZE) return []\n    const boxes = await this.detect(rgba, width, height)\n    const items: OcrItem[] = []\n    for (const b of boxes) {\n      const r = await this.recognizeLine(rgba, width, height, b)\n      if (r && r.confidence >= TEXT_SCORE && r.text.trim()) items.push(r)\n    }\n    items.sort((a, b) => (a.y - b.y) || (a.x - b.x))\n    return items\n  }\n\n  // ─── det ─────────────────────────────────────────────\n\n  private async detect(\n    rgba: Uint8Array,\n    width: number,\n    height: number,\n  ): Promise<Array<{ x: number; y: number; w: number; h: number }>> {\n    const ratio = DET_LONG_SIDE / Math.max(width, height)\n    const dw = Math.max(32, Math.round((width * ratio) / 32) * 32)\n    const dh = Math.max(32, Math.round((height * ratio) / 32) * 32)\n\n    const rgb = await this.sharp(rgba, { raw: { width, height, channels: 4 } })\n      .resize(dw, dh, { fit: \"fill\" })\n      .removeAlpha()\n      .raw()\n      .toBuffer()\n\n    // HWC RGB → CHW BGR float32 정규화\n    const plane = dw * dh\n    const input = new Float32Array(3 * plane)\n    for (let i = 0; i < plane; i++) {\n      const r = rgb[i * 3] / 255\n      const g = rgb[i * 3 + 1] / 255\n      const b = rgb[i * 3 + 2] / 255\n      input[i] = (b - DET_MEAN[0]) / DET_STD[0]\n      input[plane + i] = (g - DET_MEAN[1]) / DET_STD[1]\n      input[2 * plane + i] = (r - DET_MEAN[2]) / DET_STD[2]\n    }\n\n    const tensor = new this.ort.Tensor(\"float32\", input, [1, 3, dh, dw])\n    const out = await this.det.run({ [this.det.inputNames[0]]: tensor })\n    const probMap = out[this.det.outputNames[0]].data as Float32Array\n\n    const rawBoxes = componentBoxes(probMap, dw, dh)\n    const sx = width / dw\n    const sy = height / dh\n    const boxes: Array<{ x: number; y: number; w: number; h: number }> = []\n    for (const rb of rawBoxes.slice(0, DET_MAX_BOXES)) {\n      // unclip: DB 는 학습 시 텍스트 영역을 수축시키므로 검출 박스를 되팽창\n      const bw = rb.x2 - rb.x1 + 1\n      const bh = rb.y2 - rb.y1 + 1\n      const delta = (bw * bh * DET_UNCLIP_RATIO) / (2 * (bw + bh))\n      const x1 = Math.max(0, Math.floor((rb.x1 - delta) * sx))\n      const y1 = Math.max(0, Math.floor((rb.y1 - delta) * sy))\n      const x2 = Math.min(width, Math.ceil((rb.x2 + 1 + delta) * sx))\n      const y2 = Math.min(height, Math.ceil((rb.y2 + 1 + delta) * sy))\n      if (x2 - x1 < DET_MIN_SIZE || y2 - y1 < DET_MIN_SIZE) continue\n      boxes.push({ x: x1, y: y1, w: x2 - x1, h: y2 - y1 })\n    }\n    return boxes\n  }\n\n  // ─── rec ─────────────────────────────────────────────\n\n  private async recognizeLine(\n    rgba: Uint8Array,\n    width: number,\n    height: number,\n    box: { x: number; y: number; w: number; h: number },\n  ): Promise<OcrItem | null> {\n    const rw = Math.min(REC_MAX_WIDTH, Math.max(16, Math.round((box.w * REC_HEIGHT) / box.h)))\n    const padded = Math.max(REC_MIN_WIDTH, rw)\n\n    const rgb = await this.sharp(rgba, { raw: { width, height, channels: 4 } })\n      .extract({ left: box.x, top: box.y, width: box.w, height: box.h })\n      .resize(rw, REC_HEIGHT, { fit: \"fill\" })\n      .removeAlpha()\n      .raw()\n      .toBuffer()\n\n    // HWC RGB → CHW BGR, (x/255-0.5)/0.5, 우측 zero-pad\n    const plane = padded * REC_HEIGHT\n    const input = new Float32Array(3 * plane) // pad 영역은 0 (=정규화 후 회색 아님 주의: PP 도 0 pad)\n    for (let y = 0; y < REC_HEIGHT; y++) {\n      for (let x = 0; x < rw; x++) {\n        const src = (y * rw + x) * 3\n        const dst = y * padded + x\n        input[dst] = rgb[src + 2] / 255 / 0.5 - 1 // B\n        input[plane + dst] = rgb[src + 1] / 255 / 0.5 - 1 // G\n        input[2 * plane + dst] = rgb[src] / 255 / 0.5 - 1 // R\n      }\n    }\n\n    const tensor = new this.ort.Tensor(\"float32\", input, [1, 3, REC_HEIGHT, padded])\n    const out = await this.rec.run({ [this.rec.inputNames[0]]: tensor })\n    const logits = out[this.rec.outputNames[0]]\n    const [, T, C] = logits.dims as number[]\n    const data = logits.data as Float32Array\n\n    const decoded = ctcDecode(data, T, C, this.dict)\n    if (!decoded) return null\n    return { text: decoded.text, x: box.x, y: box.y, w: box.w, h: box.h, confidence: decoded.confidence }\n  }\n}\n\n/** CTC greedy 디코드 — 연속 중복 붕괴 → blank(0) 제거 → 사전 매핑 (테스트용 export) */\nexport function ctcDecode(\n  data: Float32Array,\n  T: number,\n  C: number,\n  dict: string[],\n): { text: string; confidence: number } | null {\n  let text = \"\"\n  let confSum = 0\n  let confCount = 0\n  let prev = -1\n  for (let t = 0; t < T; t++) {\n    const off = t * C\n    let best = 0\n    let bestV = data[off]\n    for (let c = 1; c < C; c++) {\n      const v = data[off + c]\n      if (v > bestV) { bestV = v; best = c }\n    }\n    const repeat = best === prev\n    prev = best\n    if (best === 0 || repeat) continue\n    // 모델 출력이 softmax 확률이 아니면 (>1) 해당 스텝만 정규화\n    let p = bestV\n    if (p > 1.0001 || p < 0) {\n      let denom = 0\n      for (let c = 0; c < C; c++) denom += Math.exp(data[off + c] - bestV)\n      p = 1 / denom\n    }\n    confSum += p\n    confCount++\n    if (best >= 1 && best <= dict.length) text += dict[best - 1]\n    else if (best === dict.length + 1) text += \" \"\n  }\n  if (!text) return null\n  return { text, confidence: confCount > 0 ? confSum / confCount : 0 }\n}\n\n/** 이진화 확률맵의 4-연결 성분 bbox (score = 성분 평균 확률, 테스트용 export) */\nexport function componentBoxes(\n  prob: Float32Array,\n  w: number,\n  h: number,\n): Array<{ x1: number; y1: number; x2: number; y2: number }> {\n  const visited = new Uint8Array(w * h)\n  const boxes: Array<{ x1: number; y1: number; x2: number; y2: number; score: number }> = []\n  const stack: number[] = []\n\n  for (let start = 0; start < w * h; start++) {\n    if (visited[start] || prob[start] <= DET_THRESH) continue\n    let x1 = start % w, x2 = x1, y1 = (start / w) | 0, y2 = y1\n    let sum = 0\n    let count = 0\n    stack.length = 0\n    stack.push(start)\n    visited[start] = 1\n    while (stack.length) {\n      const p = stack.pop()!\n      const px = p % w\n      const py = (p / w) | 0\n      sum += prob[p]\n      count++\n      if (px < x1) x1 = px\n      if (px > x2) x2 = px\n      if (py < y1) y1 = py\n      if (py > y2) y2 = py\n      // 4-이웃\n      if (px > 0 && !visited[p - 1] && prob[p - 1] > DET_THRESH) { visited[p - 1] = 1; stack.push(p - 1) }\n      if (px < w - 1 && !visited[p + 1] && prob[p + 1] > DET_THRESH) { visited[p + 1] = 1; stack.push(p + 1) }\n      if (py > 0 && !visited[p - w] && prob[p - w] > DET_THRESH) { visited[p - w] = 1; stack.push(p - w) }\n      if (py < h - 1 && !visited[p + w] && prob[p + w] > DET_THRESH) { visited[p + w] = 1; stack.push(p + w) }\n    }\n    if (x2 - x1 + 1 < DET_MIN_SIZE && y2 - y1 + 1 < DET_MIN_SIZE) continue\n    boxes.push({ x1, y1, x2, y2, score: sum / count })\n  }\n\n  return boxes\n    .filter(b => b.score >= DET_BOX_THRESH)\n    .sort((a, b) => (a.y1 - b.y1) || (a.x1 - b.x1))\n}\n\nasync function tryImport<T>(name: string, loader: () => Promise<T>): Promise<T> {\n  try {\n    return await loader()\n  } catch (e) {\n    throw new Error(\n      `내장 OCR 을 사용하려면 optional dependency '${name}' 이 필요합니다. ` +\n        `\\`npm install ${name}\\` 후 다시 실행하세요. 원인: ${(e as Error).message}`,\n    )\n  }\n}\n\n// ─── 엔진 싱글턴 (watch/서버 장기 실행에서 세션 재사용) ───\nlet enginePromise: Promise<OcrEngine> | null = null\n\nexport function getOcrEngine(): Promise<OcrEngine> {\n  if (!enginePromise) {\n    enginePromise = OcrEngine.create().catch(err => {\n      enginePromise = null // 실패는 캐시하지 않음 — 모델 설치 후 재시도 가능\n      throw err\n    })\n  }\n  return enginePromise\n}\n","/**\n * PDF OCR 브릿지 — 대상 페이지를 pdfium 으로 래스터해 내장 엔진 또는\n * 사용자 OcrProvider 로 인식하고, 페이지별 IRBlock[] 을 돌려준다.\n *\n * - 내장 엔진: OcrItem 좌표를 PDF 포인트로 환산해 기존 블록 파이프라인\n *   (extractPageBlocksWithLines — xy-cut 읽기순서·클러스터 표 감지)에 태운다.\n *   스캔 문서도 표 구조 복원이 가능한 이유.\n * - 사용자 프로바이더: 페이지 PNG → 텍스트 → 페이지당 paragraph 블록 (종전 계약).\n *\n * 에러 계약 (v4.1.0 리뷰 F6/F7):\n * - 환경 오류(의존성·모델 미설치, PDF 오픈 실패)는 throw — 호출자가 NEEDS_OCR 폴백.\n * - 페이지 단위 실패는 본문 오염 대신 warnings(OCR_FAILED) 로 기록하고 계속.\n */\n\nimport type { IRBlock, OcrProvider, ParseWarning } from \"../types.js\"\nimport type { NormItem } from \"../pdf/text-line.js\"\nimport type { LineSegment } from \"../pdf/line-types.js\"\nimport { extractPageBlocksWithLines } from \"../pdf/page-blocks.js\"\nimport { detectRulingLines, rulingToPdfLines } from \"./ruling-lines.js\"\nimport { getOcrEngine, type OcrItem } from \"./engine.js\"\nimport { ensureOcrModels } from \"./models.js\"\n\n/** OCR 렌더 스케일 (72dpi × 3 = 216dpi) — 10pt 본문이 rec 입력 높이(48px)에 근접 */\nconst OCR_RENDER_SCALE = 3\n/** 페이지 하나당 OCR 타임아웃 — det+rec 수십 라인 기준 넉넉히 */\nconst PAGE_TIMEOUT_MS = 120_000\n\nexport type OcrMode = \"builtin\" | OcrProvider\n\n/**\n * 대상 페이지들을 OCR 해 페이지별 블록 맵 반환.\n * @param buffer 원본 PDF (pdfjs 가 detach 하기 전에 clone 해 둔 것)\n * @param targets 1-based 페이지 번호 집합\n */\nexport async function runPdfOcr(\n  buffer: ArrayBuffer,\n  targets: Set<number>,\n  mode: OcrMode,\n  warnings: ParseWarning[],\n  onProgress?: (current: number, total: number) => void,\n): Promise<Map<number, IRBlock[]>> {\n  const result = new Map<number, IRBlock[]>()\n  if (targets.size === 0) return result\n\n  // 환경 준비 — 실패는 그대로 throw (호출자가 NEEDS_OCR 폴백)\n  const pdfiumMod = await tryImport<typeof import(\"@hyzyla/pdfium\")>(\n    \"@hyzyla/pdfium\",\n    () => import(\"@hyzyla/pdfium\"),\n  )\n  if (mode === \"builtin\") {\n    await ensureOcrModels(p => {\n      if (p.phase === \"download\" && p.downloaded === 0) {\n        process.stderr.write(`[kordoc-ocr] ${p.spec.name} 다운로드 중 (~${p.spec.sizeMb}MB)...\\n`)\n      }\n    })\n  }\n  const engine = mode === \"builtin\" ? await getOcrEngine() : null\n\n  const pdfium = await pdfiumMod.PDFiumLibrary.init()\n  const doc = await pdfium.loadDocument(new Uint8Array(buffer))\n  try {\n    let done = 0\n    for (const page of doc.pages()) {\n      // pdfium page.number 는 0-based pageIndex — 대외 계약(1-based)으로 환산\n      const pageNo = page.number + 1\n      if (!targets.has(pageNo)) continue\n      onProgress?.(++done, targets.size)\n      try {\n        const blocks = await withTimeout(\n          ocrOnePage(page, pageNo, mode, engine, warnings),\n          PAGE_TIMEOUT_MS,\n          `OCR 페이지 ${pageNo} 타임아웃 (${PAGE_TIMEOUT_MS / 1000}초)`,\n        )\n        result.set(pageNo, blocks)\n      } catch (e) {\n        warnings.push({\n          page: pageNo,\n          message: `페이지 ${pageNo} OCR 실패: ${e instanceof Error ? e.message : String(e)}`,\n          code: \"OCR_FAILED\",\n        })\n      }\n    }\n  } finally {\n    doc.destroy()\n    pdfium.destroy()\n  }\n  return result\n}\n\nasync function ocrOnePage(\n  page: import(\"@hyzyla/pdfium\").PDFiumPage,\n  pageNo: number,\n  mode: OcrMode,\n  engine: Awaited<ReturnType<typeof getOcrEngine>> | null,\n  warnings: ParseWarning[],\n): Promise<IRBlock[]> {\n  const { originalWidth: pdfW, originalHeight: pdfH } = page.getOriginalSize()\n  const rendered = await page.render({\n    scale: OCR_RENDER_SCALE,\n    render: async ({ data }) => data,\n  })\n  const { data: bgra, width: rw, height: rh } = rendered\n  const rgba = bgraToRgba(bgra)\n\n  if (mode === \"builtin\") {\n    const items = await engine!.recognizePage(rgba, rw, rh)\n    // 래스터에서 표 괘선 감지 — 스캔본 병합셀 서식도 선 기반 표 파이프라인을 탄다\n    const scale = rh / pdfH\n    const ruling = detectRulingLines(rgba, rw, rh, scale)\n    const extraLines = rulingToPdfLines(ruling, scale, pdfH)\n    return ocrItemsToBlocks(items, pageNo, pdfW, pdfH, scale, extraLines)\n  }\n\n  // 사용자 프로바이더 — PNG 인코딩 후 호출, 페이지당 paragraph (종전 계약)\n  type SharpPngFactory = (\n    input: Uint8Array,\n    opts: { raw: { width: number; height: number; channels: number } },\n  ) => { png(): { toBuffer(): Promise<Buffer> } }\n  const sharpModRaw = await tryImport<{ default?: SharpPngFactory } & SharpPngFactory>(\n    \"sharp\",\n    () => import(\"sharp\") as unknown as Promise<{ default?: SharpPngFactory } & SharpPngFactory>,\n  )\n  const sharpAny = sharpModRaw as { default?: SharpPngFactory } | SharpPngFactory\n  const sharp: SharpPngFactory =\n    typeof sharpAny === \"function\" ? sharpAny : (sharpAny.default ?? (sharpAny as unknown as SharpPngFactory))\n  const png = await sharp(rgba, { raw: { width: rw, height: rh, channels: 4 } })\n    .png()\n    .toBuffer()\n\n  const text = await mode(new Uint8Array(png), pageNo, \"image/png\")\n  if (!text.trim()) {\n    warnings.push({ page: pageNo, message: `페이지 ${pageNo} OCR 결과 없음`, code: \"OCR_FAILED\" })\n    return []\n  }\n  return [{ type: \"paragraph\", text: text.trim(), pageNumber: pageNo }]\n}\n\n/**\n * OcrItem(렌더 픽셀, top-left origin) → NormItem(PDF pt, bottom-up baseline)\n * 으로 환산해 기존 블록 파이프라인에 태운다. 괘선은 그래픽 ops 대신\n * 래스터 감지 결과(extraLines)로 공급 — 없으면 클러스터 감지기 몫이다.\n * (이미지 직접 입력 경로 image-ocr.ts 와 공유)\n */\nexport function ocrItemsToBlocks(\n  items: OcrItem[],\n  pageNumber: number,\n  pdfW: number,\n  pdfH: number,\n  scale: number,\n  extraLines?: { horizontals: LineSegment[]; verticals: LineSegment[] },\n): IRBlock[] {\n  const norm: NormItem[] = items.map(it => {\n    const h = it.h / scale\n    return {\n      text: it.text,\n      x: Math.round(it.x / scale),\n      // NormItem.y 는 pdfjs transform[5] = 베이스라인 (bottom-up) — 박스 하단으로 근사\n      y: Math.round(pdfH - (it.y + it.h) / scale),\n      w: Math.round(it.w / scale),\n      h: Math.round(h),\n      fontSize: Math.max(1, Math.round(h * 0.8)), // 박스높이는 어센더+디센더 포함 — 글자크기 근사\n      fontName: \"ocr\",\n      isHidden: false,\n    }\n  })\n  return extractPageBlocksWithLines(norm, pageNumber, { fnArray: [], argsArray: [] }, pdfW, pdfH, extraLines)\n}\n\nasync function tryImport<T>(name: string, loader: () => Promise<T>): Promise<T> {\n  try {\n    return await loader()\n  } catch (e) {\n    throw new Error(\n      `OCR 을 사용하려면 optional dependency '${name}' 이 필요합니다. ` +\n        `\\`npm install ${name}\\` 후 다시 실행하세요. 원인: ${(e as Error).message}`,\n    )\n  }\n}\n\nasync function withTimeout<T>(promise: Promise<T>, ms: number, msg: string): Promise<T> {\n  // 타임아웃 패배 후 원 promise 의 사후 reject 가 unhandled rejection 이 되지 않게 흡수\n  promise.catch(() => {})\n  let timer: NodeJS.Timeout | undefined\n  try {\n    return await Promise.race([\n      promise,\n      new Promise<never>((_, reject) => {\n        timer = setTimeout(() => reject(new Error(msg)), ms)\n      }),\n    ])\n  } finally {\n    if (timer) clearTimeout(timer)\n  }\n}\n\n/** pdfium BGRA → RGBA */\nfunction bgraToRgba(bgra: Uint8Array): Uint8Array {\n  const out = new Uint8Array(bgra.length)\n  for (let i = 0; i < bgra.length; i += 4) {\n    out[i] = bgra[i + 2]\n    out[i + 1] = bgra[i + 1]\n    out[i + 2] = bgra[i]\n    out[i + 3] = bgra[i + 3]\n  }\n  return out\n}\n"],"mappings":";;;;;;;;;;;;;;AAkBA,IAAM,eAAe;AAErB,IAAM,qBAAqB;AAE3B,IAAM,oBAAoB;AAE1B,IAAM,aAAa;AAEnB,IAAM,qBAAqB;AAE3B,IAAM,qBAAqB;AAkBpB,SAAS,kBACd,MACA,OACA,QACA,OACa;AACb,QAAM,WAAW,KAAK,MAAM,qBAAqB,KAAK;AACtD,QAAM,aAAa,KAAK,IAAI,GAAG,KAAK,MAAM,oBAAoB,KAAK,CAAC;AAGpE,QAAM,MAAM,IAAI,WAAW,QAAQ,MAAM;AACzC,WAAS,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,KAAK,GAAG;AAElD,UAAM,OAAQ,KAAK,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,IAAI,MAAM,KAAK,IAAI,CAAC,IAAI,MAAO;AACtE,QAAI,QAAQ,gBAAgB,KAAK,IAAI,CAAC,KAAK,IAAK,KAAI,CAAC,IAAI;AAAA,EAC3D;AAEA,QAAM,cAAc,YAAY,KAAK,OAAO,QAAQ,UAAU,YAAY,KAAK;AAC/E,QAAM,YAAY,YAAY,KAAK,OAAO,QAAQ,UAAU,YAAY,IAAI;AAC5E,SAAO,EAAE,aAAa,UAAU;AAClC;AAcA,SAAS,YACP,KACA,OACA,QACA,UACA,YACA,WACa;AACb,QAAM,QAAQ,YAAY,QAAQ;AAClC,QAAM,OAAO,YAAY,SAAS;AAClC,QAAM,KAAK,YACP,CAAC,MAAc,QAAgB,IAAI,MAAM,QAAQ,IAAI,IACrD,CAAC,MAAc,QAAgB,IAAI,OAAO,QAAQ,GAAG;AAEzD,QAAM,MAAmB,CAAC;AAC1B,MAAI,OAAe,CAAC;AAGpB,QAAM,mBAAmB,CAAC,GAAS,SAAyB;AAC1D,QAAI,OAAO,KAAK,QAAQ,MAAO,QAAO;AACtC,QAAI,OAAO,GAAG,QAAQ;AACtB,aAAS,MAAM,EAAE,IAAI,OAAO,EAAE,IAAI,OAAO,GAAG;AAC1C;AACA,UAAI,GAAG,MAAM,GAAG,MAAM,EAAG;AAAA,IAC3B;AACA,WAAO,QAAQ,IAAI,OAAO,QAAQ;AAAA,EACpC;AAEA,QAAM,OAAO,CAAC,MAAY;AACxB,UAAM,QAAQ,EAAE,OAAO,EAAE,QAAQ;AACjC,QAAI,QAAQ,WAAY;AACxB,QACE,iBAAiB,GAAG,EAAE,QAAQ,CAAC,KAAK,sBACpC,iBAAiB,GAAG,EAAE,OAAO,CAAC,KAAK,mBACnC;AACF,UAAM,UAAU,EAAE,QAAQ,EAAE,QAAQ;AACpC,QAAI;AAAA,MACF,YACI,EAAE,IAAI,QAAQ,IAAI,EAAE,IAAI,IAAI,QAAQ,IAAI,EAAE,IAAI,aAAa,MAAM,IACjE,EAAE,IAAI,EAAE,IAAI,IAAI,QAAQ,IAAI,EAAE,IAAI,IAAI,QAAQ,aAAa,MAAM;AAAA,IACvE;AAAA,EACF;AAEA,WAAS,OAAO,GAAG,OAAO,OAAO,QAAQ;AAEvC,UAAM,OAA0C,CAAC;AACjD,QAAI,WAAW;AACf,QAAI,MAAM;AACV,aAAS,MAAM,GAAG,OAAO,MAAM,OAAO;AACpC,YAAM,KAAK,MAAM,QAAQ,GAAG,MAAM,GAAG,MAAM;AAC3C,UAAI,IAAI;AACN,YAAI,WAAW,EAAG,YAAW;AAC7B,cAAM;AAAA,MACR,WAAW,YAAY,GAAG;AACxB,YAAI,EAAE,MAAM,cAAc,OAAO,MAAM;AACrC,gBAAM,KAAK,MAAM;AACjB,cAAI,KAAK,WAAW,KAAK,SAAU,MAAK,KAAK,EAAE,IAAI,UAAU,GAAG,CAAC;AACjE,qBAAW;AACX,gBAAM;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAGA,UAAM,OAAe,CAAC;AACtB,UAAM,OAAO,oBAAI,IAAY;AAC7B,eAAW,QAAQ,MAAM;AACvB,UAAI,KAAK,SAAS,OAAO,GAAG;AAAE,aAAK,IAAI;AAAG;AAAA,MAAS;AACnD,UAAI,SAAS;AACb,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAI,KAAK,IAAI,CAAC,EAAG;AACjB,cAAM,MAAM,KAAK,CAAC;AAClB,cAAM,UAAU,KAAK,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI;AACxE,cAAM,UAAU,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,IAAI,KAAK,IAAI,EAAE,IAAI;AAC/D,YAAI,WAAW,UAAU,oBAAoB;AAC3C,eAAK,KAAK,KAAK,IAAI,KAAK,IAAI,IAAI,EAAE;AAClC,eAAK,KAAK,KAAK,IAAI,KAAK,IAAI,IAAI,EAAE;AAClC,eAAK,OAAO;AACZ,eAAK,KAAK,IAAI;AACd,eAAK,IAAI,CAAC;AACV,mBAAS;AACT;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,OAAQ,MAAK,IAAI;AAAA,IACxB;AACA,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAI,CAAC,KAAK,IAAI,CAAC,EAAG,MAAK,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,IAAI,IAAI,KAAK,CAAC,EAAE,IAAI,OAAO,MAAM,MAAM,KAAK,CAAC;AAAA,IACzF;AACA,WAAO;AAAA,EACT;AACA,aAAW,QAAQ,KAAM,MAAK,IAAI;AAClC,SAAO;AACT;AAMO,SAAS,iBACd,QACA,OACA,WAC0D;AAC1D,QAAM,cAA6B,OAAO,YAAY,IAAI,OAAK;AAC7D,UAAM,IAAI,aAAa,EAAE,KAAK,EAAE,MAAM,IAAI;AAC1C,WAAO;AAAA,MACL,IAAI,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI;AAAA,MAC3B,IAAI;AAAA,MACJ,IAAI,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI;AAAA,MAC3B,IAAI;AAAA,MACJ,WAAW,EAAE,cAAc;AAAA,IAC7B;AAAA,EACF,CAAC;AACD,QAAM,YAA2B,OAAO,UAAU,IAAI,OAAK;AACzD,UAAM,KAAK,EAAE,KAAK,EAAE,MAAM,IAAI;AAC9B,UAAM,KAAK,YAAY,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI;AAC9C,UAAM,KAAK,YAAY,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI;AAC9C,WAAO,EAAE,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,WAAW,EAAE,cAAc,MAAM;AAAA,EAC1E,CAAC;AACD,SAAO,EAAE,aAAa,UAAU;AAClC;;;ACtLA,SAAS,gBAAgB;AACzB,SAAS,YAAY;AAsBrB,IAAM,gBAAgB;AACtB,IAAM,aAAa;AACnB,IAAM,iBAAiB;AACvB,IAAM,mBAAmB;AACzB,IAAM,eAAe;AACrB,IAAM,gBAAgB;AACtB,IAAM,aAAa;AACnB,IAAM,gBAAgB;AACtB,IAAM,gBAAgB;AACtB,IAAM,aAAa;AAGnB,IAAM,WAAW,CAAC,OAAO,OAAO,KAAK;AACrC,IAAM,UAAU,CAAC,OAAO,OAAO,KAAK;AAa7B,IAAM,YAAN,MAAM,WAAU;AAAA,EACb;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEA,YAAY,OAMjB;AACD,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,OAAO,MAAM;AAClB,SAAK,MAAM,MAAM;AACjB,SAAK,QAAQ,MAAM;AAAA,EACrB;AAAA,EAEA,aAAa,SAA6B;AACxC,UAAM,CAAC,QAAQ,WAAW,IAAI,MAAM,QAAQ,IAAI;AAAA,MAC9C,UAA6C,oBAAoB,MAAM,OAAO,kBAAkB,CAAC;AAAA,MACjG;AAAA,QACE;AAAA,QACA,MAAM,OAAO,OAAO;AAAA,MACtB;AAAA,IACF,CAAC;AACD,UAAM,WAAW;AACjB,UAAM,WACJ,OAAO,aAAa,aAAa,WAAY,SAAS,WAAY;AAEpE,UAAM,MAAM,gBAAgB;AAC5B,UAAM,cAA0E;AAAA,MAC9E,wBAAwB;AAAA,MACxB,oBAAoB,CAAC,KAAK;AAAA,MAC1B,kBAAkB;AAAA;AAAA,IACpB;AACA,UAAM,CAAC,KAAK,KAAK,OAAO,IAAI,MAAM,QAAQ,IAAI;AAAA,MAC5C,OAAO,iBAAiB,OAAO,KAAK,KAAK,cAAc,QAAQ,GAAG,WAAW;AAAA,MAC7E,OAAO,iBAAiB,OAAO,KAAK,KAAK,cAAc,QAAQ,GAAG,WAAW;AAAA,MAC7E,SAAS,KAAK,KAAK,aAAa,QAAQ,GAAG,OAAO;AAAA,IACpD,CAAC;AACD,UAAM,OAAO,mBAAmB,OAAO;AACvC,QAAI,KAAK,WAAW,EAAG,OAAM,IAAI,MAAM,wJAAqC;AAE5E,WAAO,IAAI,WAAU,EAAE,KAAK,KAAK,MAAM,KAAK,QAAQ,OAAO,SAAS,CAAC;AAAA,EACvE;AAAA;AAAA,EAGA,MAAM,UAAyB;AAC7B,eAAW,KAAK,CAAC,KAAK,KAAK,KAAK,GAAG,GAAG;AACpC,YAAM,MAAO,EAAmD;AAChE,UAAI,OAAO,QAAQ,YAAY;AAC7B,YAAI;AAAE,gBAAM,IAAI,KAAK,CAAC;AAAA,QAAE,QAAQ;AAAA,QAAe;AAAA,MACjD;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,cAAc,MAAkB,OAAe,QAAoC;AACvF,QAAI,QAAQ,gBAAgB,SAAS,aAAc,QAAO,CAAC;AAC3D,UAAM,QAAQ,MAAM,KAAK,OAAO,MAAM,OAAO,MAAM;AACnD,UAAM,QAAmB,CAAC;AAC1B,eAAW,KAAK,OAAO;AACrB,YAAM,IAAI,MAAM,KAAK,cAAc,MAAM,OAAO,QAAQ,CAAC;AACzD,UAAI,KAAK,EAAE,cAAc,cAAc,EAAE,KAAK,KAAK,EAAG,OAAM,KAAK,CAAC;AAAA,IACpE;AACA,UAAM,KAAK,CAAC,GAAG,MAAO,EAAE,IAAI,EAAE,KAAO,EAAE,IAAI,EAAE,CAAE;AAC/C,WAAO;AAAA,EACT;AAAA;AAAA,EAIA,MAAc,OACZ,MACA,OACA,QACgE;AAChE,UAAM,QAAQ,gBAAgB,KAAK,IAAI,OAAO,MAAM;AACpD,UAAM,KAAK,KAAK,IAAI,IAAI,KAAK,MAAO,QAAQ,QAAS,EAAE,IAAI,EAAE;AAC7D,UAAM,KAAK,KAAK,IAAI,IAAI,KAAK,MAAO,SAAS,QAAS,EAAE,IAAI,EAAE;AAE9D,UAAM,MAAM,MAAM,KAAK,MAAM,MAAM,EAAE,KAAK,EAAE,OAAO,QAAQ,UAAU,EAAE,EAAE,CAAC,EACvE,OAAO,IAAI,IAAI,EAAE,KAAK,OAAO,CAAC,EAC9B,YAAY,EACZ,IAAI,EACJ,SAAS;AAGZ,UAAM,QAAQ,KAAK;AACnB,UAAM,QAAQ,IAAI,aAAa,IAAI,KAAK;AACxC,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,YAAM,IAAI,IAAI,IAAI,CAAC,IAAI;AACvB,YAAM,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI;AAC3B,YAAM,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI;AAC3B,YAAM,CAAC,KAAK,IAAI,SAAS,CAAC,KAAK,QAAQ,CAAC;AACxC,YAAM,QAAQ,CAAC,KAAK,IAAI,SAAS,CAAC,KAAK,QAAQ,CAAC;AAChD,YAAM,IAAI,QAAQ,CAAC,KAAK,IAAI,SAAS,CAAC,KAAK,QAAQ,CAAC;AAAA,IACtD;AAEA,UAAM,SAAS,IAAI,KAAK,IAAI,OAAO,WAAW,OAAO,CAAC,GAAG,GAAG,IAAI,EAAE,CAAC;AACnE,UAAM,MAAM,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC,KAAK,IAAI,WAAW,CAAC,CAAC,GAAG,OAAO,CAAC;AACnE,UAAM,UAAU,IAAI,KAAK,IAAI,YAAY,CAAC,CAAC,EAAE;AAE7C,UAAM,WAAW,eAAe,SAAS,IAAI,EAAE;AAC/C,UAAM,KAAK,QAAQ;AACnB,UAAM,KAAK,SAAS;AACpB,UAAM,QAA+D,CAAC;AACtE,eAAW,MAAM,SAAS,MAAM,GAAG,aAAa,GAAG;AAEjD,YAAM,KAAK,GAAG,KAAK,GAAG,KAAK;AAC3B,YAAM,KAAK,GAAG,KAAK,GAAG,KAAK;AAC3B,YAAM,QAAS,KAAK,KAAK,oBAAqB,KAAK,KAAK;AACxD,YAAM,KAAK,KAAK,IAAI,GAAG,KAAK,OAAO,GAAG,KAAK,SAAS,EAAE,CAAC;AACvD,YAAM,KAAK,KAAK,IAAI,GAAG,KAAK,OAAO,GAAG,KAAK,SAAS,EAAE,CAAC;AACvD,YAAM,KAAK,KAAK,IAAI,OAAO,KAAK,MAAM,GAAG,KAAK,IAAI,SAAS,EAAE,CAAC;AAC9D,YAAM,KAAK,KAAK,IAAI,QAAQ,KAAK,MAAM,GAAG,KAAK,IAAI,SAAS,EAAE,CAAC;AAC/D,UAAI,KAAK,KAAK,gBAAgB,KAAK,KAAK,aAAc;AACtD,YAAM,KAAK,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,GAAG,CAAC;AAAA,IACrD;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAIA,MAAc,cACZ,MACA,OACA,QACA,KACyB;AACzB,UAAM,KAAK,KAAK,IAAI,eAAe,KAAK,IAAI,IAAI,KAAK,MAAO,IAAI,IAAI,aAAc,IAAI,CAAC,CAAC,CAAC;AACzF,UAAM,SAAS,KAAK,IAAI,eAAe,EAAE;AAEzC,UAAM,MAAM,MAAM,KAAK,MAAM,MAAM,EAAE,KAAK,EAAE,OAAO,QAAQ,UAAU,EAAE,EAAE,CAAC,EACvE,QAAQ,EAAE,MAAM,IAAI,GAAG,KAAK,IAAI,GAAG,OAAO,IAAI,GAAG,QAAQ,IAAI,EAAE,CAAC,EAChE,OAAO,IAAI,YAAY,EAAE,KAAK,OAAO,CAAC,EACtC,YAAY,EACZ,IAAI,EACJ,SAAS;AAGZ,UAAM,QAAQ,SAAS;AACvB,UAAM,QAAQ,IAAI,aAAa,IAAI,KAAK;AACxC,aAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,eAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,cAAM,OAAO,IAAI,KAAK,KAAK;AAC3B,cAAM,MAAM,IAAI,SAAS;AACzB,cAAM,GAAG,IAAI,IAAI,MAAM,CAAC,IAAI,MAAM,MAAM;AACxC,cAAM,QAAQ,GAAG,IAAI,IAAI,MAAM,CAAC,IAAI,MAAM,MAAM;AAChD,cAAM,IAAI,QAAQ,GAAG,IAAI,IAAI,GAAG,IAAI,MAAM,MAAM;AAAA,MAClD;AAAA,IACF;AAEA,UAAM,SAAS,IAAI,KAAK,IAAI,OAAO,WAAW,OAAO,CAAC,GAAG,GAAG,YAAY,MAAM,CAAC;AAC/E,UAAM,MAAM,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC,KAAK,IAAI,WAAW,CAAC,CAAC,GAAG,OAAO,CAAC;AACnE,UAAM,SAAS,IAAI,KAAK,IAAI,YAAY,CAAC,CAAC;AAC1C,UAAM,CAAC,EAAE,GAAG,CAAC,IAAI,OAAO;AACxB,UAAM,OAAO,OAAO;AAEpB,UAAM,UAAU,UAAU,MAAM,GAAG,GAAG,KAAK,IAAI;AAC/C,QAAI,CAAC,QAAS,QAAO;AACrB,WAAO,EAAE,MAAM,QAAQ,MAAM,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,YAAY,QAAQ,WAAW;AAAA,EACtG;AACF;AAGO,SAAS,UACd,MACA,GACA,GACA,MAC6C;AAC7C,MAAI,OAAO;AACX,MAAI,UAAU;AACd,MAAI,YAAY;AAChB,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,MAAM,IAAI;AAChB,QAAI,OAAO;AACX,QAAI,QAAQ,KAAK,GAAG;AACpB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAM,IAAI,KAAK,MAAM,CAAC;AACtB,UAAI,IAAI,OAAO;AAAE,gBAAQ;AAAG,eAAO;AAAA,MAAE;AAAA,IACvC;AACA,UAAM,SAAS,SAAS;AACxB,WAAO;AACP,QAAI,SAAS,KAAK,OAAQ;AAE1B,QAAI,IAAI;AACR,QAAI,IAAI,UAAU,IAAI,GAAG;AACvB,UAAI,QAAQ;AACZ,eAAS,IAAI,GAAG,IAAI,GAAG,IAAK,UAAS,KAAK,IAAI,KAAK,MAAM,CAAC,IAAI,KAAK;AACnE,UAAI,IAAI;AAAA,IACV;AACA,eAAW;AACX;AACA,QAAI,QAAQ,KAAK,QAAQ,KAAK,OAAQ,SAAQ,KAAK,OAAO,CAAC;AAAA,aAClD,SAAS,KAAK,SAAS,EAAG,SAAQ;AAAA,EAC7C;AACA,MAAI,CAAC,KAAM,QAAO;AAClB,SAAO,EAAE,MAAM,YAAY,YAAY,IAAI,UAAU,YAAY,EAAE;AACrE;AAGO,SAAS,eACd,MACA,GACA,GAC2D;AAC3D,QAAM,UAAU,IAAI,WAAW,IAAI,CAAC;AACpC,QAAM,QAAkF,CAAC;AACzF,QAAM,QAAkB,CAAC;AAEzB,WAAS,QAAQ,GAAG,QAAQ,IAAI,GAAG,SAAS;AAC1C,QAAI,QAAQ,KAAK,KAAK,KAAK,KAAK,KAAK,WAAY;AACjD,QAAI,KAAK,QAAQ,GAAG,KAAK,IAAI,KAAM,QAAQ,IAAK,GAAG,KAAK;AACxD,QAAI,MAAM;AACV,QAAI,QAAQ;AACZ,UAAM,SAAS;AACf,UAAM,KAAK,KAAK;AAChB,YAAQ,KAAK,IAAI;AACjB,WAAO,MAAM,QAAQ;AACnB,YAAM,IAAI,MAAM,IAAI;AACpB,YAAM,KAAK,IAAI;AACf,YAAM,KAAM,IAAI,IAAK;AACrB,aAAO,KAAK,CAAC;AACb;AACA,UAAI,KAAK,GAAI,MAAK;AAClB,UAAI,KAAK,GAAI,MAAK;AAClB,UAAI,KAAK,GAAI,MAAK;AAClB,UAAI,KAAK,GAAI,MAAK;AAElB,UAAI,KAAK,KAAK,CAAC,QAAQ,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,IAAI,YAAY;AAAE,gBAAQ,IAAI,CAAC,IAAI;AAAG,cAAM,KAAK,IAAI,CAAC;AAAA,MAAE;AACnG,UAAI,KAAK,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,IAAI,YAAY;AAAE,gBAAQ,IAAI,CAAC,IAAI;AAAG,cAAM,KAAK,IAAI,CAAC;AAAA,MAAE;AACvG,UAAI,KAAK,KAAK,CAAC,QAAQ,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,IAAI,YAAY;AAAE,gBAAQ,IAAI,CAAC,IAAI;AAAG,cAAM,KAAK,IAAI,CAAC;AAAA,MAAE;AACnG,UAAI,KAAK,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,IAAI,YAAY;AAAE,gBAAQ,IAAI,CAAC,IAAI;AAAG,cAAM,KAAK,IAAI,CAAC;AAAA,MAAE;AAAA,IACzG;AACA,QAAI,KAAK,KAAK,IAAI,gBAAgB,KAAK,KAAK,IAAI,aAAc;AAC9D,UAAM,KAAK,EAAE,IAAI,IAAI,IAAI,IAAI,OAAO,MAAM,MAAM,CAAC;AAAA,EACnD;AAEA,SAAO,MACJ,OAAO,OAAK,EAAE,SAAS,cAAc,EACrC,KAAK,CAAC,GAAG,MAAO,EAAE,KAAK,EAAE,MAAQ,EAAE,KAAK,EAAE,EAAG;AAClD;AAEA,eAAe,UAAa,MAAc,QAAsC;AAC9E,MAAI;AACF,WAAO,MAAM,OAAO;AAAA,EACtB,SAAS,GAAG;AACV,UAAM,IAAI;AAAA,MACR,+EAAuC,IAAI,0DACxB,IAAI,wEAAuB,EAAY,OAAO;AAAA,IACnE;AAAA,EACF;AACF;AAGA,IAAI,gBAA2C;AAExC,SAAS,eAAmC;AACjD,MAAI,CAAC,eAAe;AAClB,oBAAgB,UAAU,OAAO,EAAE,MAAM,SAAO;AAC9C,sBAAgB;AAChB,YAAM;AAAA,IACR,CAAC;AAAA,EACH;AACA,SAAO;AACT;;;AC/TA,IAAM,mBAAmB;AAEzB,IAAM,kBAAkB;AASxB,eAAsB,UACpB,QACA,SACA,MACA,UACA,YACiC;AACjC,QAAM,SAAS,oBAAI,IAAuB;AAC1C,MAAI,QAAQ,SAAS,EAAG,QAAO;AAG/B,QAAM,YAAY,MAAMA;AAAA,IACtB;AAAA,IACA,MAAM,OAAO,gBAAgB;AAAA,EAC/B;AACA,MAAI,SAAS,WAAW;AACtB,UAAM,gBAAgB,OAAK;AACzB,UAAI,EAAE,UAAU,cAAc,EAAE,eAAe,GAAG;AAChD,gBAAQ,OAAO,MAAM,gBAAgB,EAAE,KAAK,IAAI,sCAAa,EAAE,KAAK,MAAM;AAAA,CAAU;AAAA,MACtF;AAAA,IACF,CAAC;AAAA,EACH;AACA,QAAM,SAAS,SAAS,YAAY,MAAM,aAAa,IAAI;AAE3D,QAAM,SAAS,MAAM,UAAU,cAAc,KAAK;AAClD,QAAM,MAAM,MAAM,OAAO,aAAa,IAAI,WAAW,MAAM,CAAC;AAC5D,MAAI;AACF,QAAI,OAAO;AACX,eAAW,QAAQ,IAAI,MAAM,GAAG;AAE9B,YAAM,SAAS,KAAK,SAAS;AAC7B,UAAI,CAAC,QAAQ,IAAI,MAAM,EAAG;AAC1B,mBAAa,EAAE,MAAM,QAAQ,IAAI;AACjC,UAAI;AACF,cAAM,SAAS,MAAM;AAAA,UACnB,WAAW,MAAM,QAAQ,MAAM,QAAQ,QAAQ;AAAA,UAC/C;AAAA,UACA,0BAAW,MAAM,8BAAU,kBAAkB,GAAI;AAAA,QACnD;AACA,eAAO,IAAI,QAAQ,MAAM;AAAA,MAC3B,SAAS,GAAG;AACV,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,SAAS,sBAAO,MAAM,sBAAY,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,CAAC;AAAA,UAC5E,MAAM;AAAA,QACR,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,UAAE;AACA,QAAI,QAAQ;AACZ,WAAO,QAAQ;AAAA,EACjB;AACA,SAAO;AACT;AAEA,eAAe,WACb,MACA,QACA,MACA,QACA,UACoB;AACpB,QAAM,EAAE,eAAe,MAAM,gBAAgB,KAAK,IAAI,KAAK,gBAAgB;AAC3E,QAAM,WAAW,MAAM,KAAK,OAAO;AAAA,IACjC,OAAO;AAAA,IACP,QAAQ,OAAO,EAAE,KAAK,MAAM;AAAA,EAC9B,CAAC;AACD,QAAM,EAAE,MAAM,MAAM,OAAO,IAAI,QAAQ,GAAG,IAAI;AAC9C,QAAM,OAAO,WAAW,IAAI;AAE5B,MAAI,SAAS,WAAW;AACtB,UAAM,QAAQ,MAAM,OAAQ,cAAc,MAAM,IAAI,EAAE;AAEtD,UAAM,QAAQ,KAAK;AACnB,UAAM,SAAS,kBAAkB,MAAM,IAAI,IAAI,KAAK;AACpD,UAAM,aAAa,iBAAiB,QAAQ,OAAO,IAAI;AACvD,WAAO,iBAAiB,OAAO,QAAQ,MAAM,MAAM,OAAO,UAAU;AAAA,EACtE;AAOA,QAAM,cAAc,MAAMA;AAAA,IACxB;AAAA,IACA,MAAM,OAAO,OAAO;AAAA,EACtB;AACA,QAAM,WAAW;AACjB,QAAM,QACJ,OAAO,aAAa,aAAa,WAAY,SAAS,WAAY;AACpE,QAAM,MAAM,MAAM,MAAM,MAAM,EAAE,KAAK,EAAE,OAAO,IAAI,QAAQ,IAAI,UAAU,EAAE,EAAE,CAAC,EAC1E,IAAI,EACJ,SAAS;AAEZ,QAAM,OAAO,MAAM,KAAK,IAAI,WAAW,GAAG,GAAG,QAAQ,WAAW;AAChE,MAAI,CAAC,KAAK,KAAK,GAAG;AAChB,aAAS,KAAK,EAAE,MAAM,QAAQ,SAAS,sBAAO,MAAM,kCAAc,MAAM,aAAa,CAAC;AACtF,WAAO,CAAC;AAAA,EACV;AACA,SAAO,CAAC,EAAE,MAAM,aAAa,MAAM,KAAK,KAAK,GAAG,YAAY,OAAO,CAAC;AACtE;AAQO,SAAS,iBACd,OACA,YACA,MACA,MACA,OACA,YACW;AACX,QAAM,OAAmB,MAAM,IAAI,QAAM;AACvC,UAAM,IAAI,GAAG,IAAI;AACjB,WAAO;AAAA,MACL,MAAM,GAAG;AAAA,MACT,GAAG,KAAK,MAAM,GAAG,IAAI,KAAK;AAAA;AAAA,MAE1B,GAAG,KAAK,MAAM,QAAQ,GAAG,IAAI,GAAG,KAAK,KAAK;AAAA,MAC1C,GAAG,KAAK,MAAM,GAAG,IAAI,KAAK;AAAA,MAC1B,GAAG,KAAK,MAAM,CAAC;AAAA,MACf,UAAU,KAAK,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,CAAC;AAAA;AAAA,MACzC,UAAU;AAAA,MACV,UAAU;AAAA,IACZ;AAAA,EACF,CAAC;AACD,SAAO,2BAA2B,MAAM,YAAY,EAAE,SAAS,CAAC,GAAG,WAAW,CAAC,EAAE,GAAG,MAAM,MAAM,UAAU;AAC5G;AAEA,eAAeA,WAAa,MAAc,QAAsC;AAC9E,MAAI;AACF,WAAO,MAAM,OAAO;AAAA,EACtB,SAAS,GAAG;AACV,UAAM,IAAI;AAAA,MACR,kEAAoC,IAAI,0DACrB,IAAI,wEAAuB,EAAY,OAAO;AAAA,IACnE;AAAA,EACF;AACF;AAEA,eAAe,YAAe,SAAqB,IAAY,KAAyB;AAEtF,UAAQ,MAAM,MAAM;AAAA,EAAC,CAAC;AACtB,MAAI;AACJ,MAAI;AACF,WAAO,MAAM,QAAQ,KAAK;AAAA,MACxB;AAAA,MACA,IAAI,QAAe,CAAC,GAAG,WAAW;AAChC,gBAAQ,WAAW,MAAM,OAAO,IAAI,MAAM,GAAG,CAAC,GAAG,EAAE;AAAA,MACrD,CAAC;AAAA,IACH,CAAC;AAAA,EACH,UAAE;AACA,QAAI,MAAO,cAAa,KAAK;AAAA,EAC/B;AACF;AAGA,SAAS,WAAW,MAA8B;AAChD,QAAM,MAAM,IAAI,WAAW,KAAK,MAAM;AACtC,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACvC,QAAI,CAAC,IAAI,KAAK,IAAI,CAAC;AACnB,QAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;AACvB,QAAI,IAAI,CAAC,IAAI,KAAK,CAAC;AACnB,QAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,EACzB;AACA,SAAO;AACT;","names":["tryImport"]}

package/dist/chunk-UA53AA7R.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/shared/pua.ts","../src/table/builder.ts","../src/image/transcode.ts"],"sourcesContent":["/**\n * 한컴 PUA(Private Use Area) 문자 → 유니코드 표준 문자 매핑.\n *\n * 한글(HWP)은 글머리표·문자표 기호를 Symbol/Wingdings 계열 PUA 코드포인트\n * (U+F020~U+F0FF)와 한컴 자체 Supplementary PUA-A 영역(U+F0000대)에 저장한다.\n * 매핑 없이 마크다운에 내보내면 빈 네모로 깨진다.\n *\n * 매핑 출처: rhwp (MIT, https://github.com/edwardkim/rhwp)\n * paragraph_layout.rs map_pua_bullet_char — 한컴 PDF 정답지 시각 검증 테이블.\n */\n\n/** BMP Symbol 영역 (U+F020~U+F0FF) 매핑 — 키는 (code - 0xF000) */\nconst BMP_SYMBOL_MAP: Record<number, string> = {\n  // 도형/기호\n  0x6c: \"●\", // ●\n  0x6d: \"●\", // ● (그림자 원 근사)\n  0x6e: \"■\", // ■\n  0x6f: \"□\", // □\n  0x70: \"□\", // □ (굵은 흰 사각 근사)\n  0x71: \"□\", // □ (그림자 근사)\n  0x72: \"□\", // □ (그림자 근사)\n  0x73: \"⬧\", // ⬧\n  0x74: \"⧫\", // ⧫\n  0x75: \"◆\", // ◆\n  0x76: \"❖\", // ❖\n  0x77: \"⬥\", // ⬥\n  // 체크/별/점\n  0x9e: \"·\", // ·\n  0x9f: \"•\", // •\n  0xa0: \"·\", // · (한컴 PDF 정답지 정합 — ▪ 아님)\n  0xa1: \"⚪\", // ⚪\n  0xa2: \"○\", // ○\n  0xa3: \"○\", // ○\n  0xa4: \"◉\", // ◉\n  0xa5: \"◎\", // ◎\n  0xa7: \"▪\", // ▪\n  0xa8: \"◻\", // ◻\n  0xaa: \"✦\", // ✦\n  0xab: \"★\", // ★\n  0xac: \"✶\", // ✶\n  0xad: \"✴\", // ✴\n  0xae: \"✹\", // ✹\n  // 손 모양\n  0x45: \"☜\", // ☜\n  0x46: \"☞\", // ☞\n  0x47: \"☝\", // ☝\n  0x48: \"☟\", // ☟\n  // 체크마크\n  0xfb: \"✗\", // ✗\n  0xfc: \"✔\", // ✔\n  0xfd: \"☒\", // ☒\n  0xfe: \"☑\", // ☑\n  // 화살표\n  0xe8: \"➔\", // ➔ (heavy wide-headed — 한컴 PDF 정답지 정합)\n  0xef: \"⇦\", // ⇦\n  0xf0: \"⇨\", // ⇨\n  0xf1: \"⇧\", // ⇧\n  0xf2: \"⇩\", // ⇩\n  // 기타\n  0x22: \"✂\", // ✂\n  0x36: \"⌛\", // ⌛\n  0x4a: \"☺\", // ☺\n  0x4e: \"☠\", // ☠\n  0x52: \"☼\", // ☼\n  0x54: \"❄\", // ❄\n  0x58: \"✠\", // ✠\n  0x59: \"✡\", // ✡\n}\n\n/** Supplementary PUA-A (U+F0000대) — 한컴 자체 영역 매핑.\n *  매핑 없는 코드는 호출부가 **삭제**하므로(sanitizeText) 누락은 곧 글자 증발이다.\n *  범위 추정으로 채우지 말 것 — PUA는 글꼴별 사적 영역이라 한컴 PDF 대조로 확인된 것만 넣는다. */\nconst SUPPLEMENTARY_MAP: Record<number, string> = {\n  0xf003b: \"↓\", // ↓\n  0xf02ef: \"·\", // ·\n  0xf0854: \"《\", // 《\n  0xf0855: \"》\", // 》\n  0xf00da: \"▸\", // ▸\n  0xf080f: \"━\", // ━\n  0xf0827: \"■\", // ■\n  0xf03c5: \"□\", // □ 글머리 — HWP3→HWP5 한컴 변환본 보존 코드, 한컴오피스 표시값 (rhwp #1105)\n  // 아래 5종 — rhwp 44cabad9 verified_hancom_pua 표 (한컴 PDF 대조 확정)\n  0xf012b: \"(인)\", // 결재·서명란\n  0xf02fc: \"►\", // 2025 행정업무운영 편람 callout 글머리\n  0xf031c: \"■\", // 2025 행정업무운영 편람 목차 글머리\n  0xf03a0: \"↵\", // 하이퍼텍스트 안내문의 Enter 키 픽토그램\n  // 머리말 회사명 6자 (HWP3 johab 0x37C0~0x37C5의 HWP5/HWPX 변환본 대응 코드)\n  0xf03ef: \"한\",\n  0xf03f0: \"글\",\n  0xf03f1: \"과\",\n  0xf03f2: \"컴\",\n  0xf03f3: \"퓨\",\n  0xf03f4: \"터\",\n}\n\n/** 사각 안 숫자 ①~⑳ (U+F02B1~F02C4) — 한컴 전용 글리프.\n *  렌더는 사각 글리프를 위해 원문 유지가 맞지만, 마크다운은 폰트 없는 소비자(RAG·grep)가\n *  읽으므로 둘러싸인 숫자로 옮긴다 (rhwp b74b5098 / #3385 — 실문서에서 5건 유출 확인). */\nconst BOXED_NUMBER_START = 0xf02b1\nconst BOXED_NUMBER_END = 0xf02c4\n\n/** 단일 코드포인트 매핑 — 매핑 없으면 원본 유지 */\nfunction mapPuaChar(code: number): string | undefined {\n  if (code >= 0xf020 && code <= 0xf0ff) {\n    return BMP_SYMBOL_MAP[code - 0xf000]\n  }\n  if (code >= BOXED_NUMBER_START && code <= BOXED_NUMBER_END) {\n    return String.fromCodePoint(0x2460 + (code - BOXED_NUMBER_START))\n  }\n  if (code >= 0xf0000 && code <= 0xf09ff) {\n    return SUPPLEMENTARY_MAP[code]\n  }\n  return undefined\n}\n\n/**\n * 문자열 내 한컴 PUA 문자를 표준 유니코드로 치환.\n * 매핑 없는 BMP PUA는 원본 유지(옛한글 한양PUA 가능성 — 제거하면 안 됨),\n * 매핑 없는 Supplementary PUA-A는 호출부의 기존 제거 로직에 위임한다.\n */\nexport function mapPuaText(text: string): string {\n  let out = \"\"\n  for (const ch of text) {\n    const code = ch.codePointAt(0)!\n    out += mapPuaChar(code) ?? ch\n  }\n  return out\n}\n","/** 2-pass colSpan/rowSpan 테이블 빌더 및 Markdown 변환 */\n\nimport type { CellContext, IRBlock, IRCell, IRSpan, IRTable } from \"../types.js\"\nimport { sanitizeHref } from \"../utils.js\"\nimport { mapPuaText } from \"../shared/pua.js\"\n\n/** 테이블 열 수 상한 — 한국 공공문서 기준 충분한 값 */\nexport const MAX_COLS = 200\n/** 테이블 행 수 상한 — 메모리 폭주 방지 */\nexport const MAX_ROWS = 10000\n\nexport interface BuildTableOptions {\n  /** 실제 셀 앵커가 있는 빈 후행 열(서식 문서의 입력란)을 보존한다 (#47).\n   *  앵커 없는 유령 열(span 인플레이션)은 이 옵션과 무관하게 트림.\n   *  기본 false: 종전대로 텍스트 기준 전부 트림 (마크다운 가독성·벤치 계약). */\n  keepAnchoredEmptyCols?: boolean\n  /** 셀 텍스트를 trim하지 않고 선/후행 개행(빈 문단 줄)을 보존한다 (#57).\n   *  ParseOptions.keepEmptyParagraphs 연동 — 파서가 문단별로 이미 정돈한 텍스트를\n   *  `\\n` 결합해 넘기는 경로 전용. 기본 false: 종전대로 trim. */\n  keepEmptyParagraphs?: boolean\n}\n\nexport function buildTable(rows: CellContext[][], options?: BuildTableOptions): IRTable {\n  if (rows.length > MAX_ROWS) rows = rows.slice(0, MAX_ROWS)\n  const numRows = rows.length\n\n  // colAddr/rowAddr가 있으면 직접 배치 (HWPX cellAddr, HWP5 colAddr/rowAddr)\n  const hasAddr = rows.some(row => row.some(c => c.colAddr !== undefined && c.rowAddr !== undefined))\n  if (hasAddr) return buildTableDirect(rows, numRows, options)\n\n  // Pass 1: maxCols 계산 — 2D 배열 사용 (동적 확장)\n  let maxCols = 0\n  const tempOccupied: boolean[][] = Array.from({ length: numRows }, () => [])\n\n  for (let rowIdx = 0; rowIdx < numRows; rowIdx++) {\n    let colIdx = 0\n    for (const cell of rows[rowIdx]) {\n      while (colIdx < MAX_COLS && tempOccupied[rowIdx][colIdx]) colIdx++\n      if (colIdx >= MAX_COLS) break\n\n      for (let r = rowIdx; r < Math.min(rowIdx + cell.rowSpan, numRows); r++) {\n        for (let c = colIdx; c < Math.min(colIdx + cell.colSpan, MAX_COLS); c++) {\n          tempOccupied[r][c] = true\n        }\n      }\n      colIdx += cell.colSpan\n      if (colIdx > maxCols) maxCols = colIdx\n    }\n  }\n\n  if (maxCols === 0) return { rows: 0, cols: 0, cells: [], hasHeader: false }\n\n  // Pass 2: 실제 배치\n  const grid: IRCell[][] = Array.from({ length: numRows }, () =>\n    Array.from({ length: maxCols }, () => ({ text: \"\", colSpan: 1, rowSpan: 1 }))\n  )\n  const occupied: boolean[][] = Array.from({ length: numRows }, () => Array(maxCols).fill(false))\n  const anchorCols = new Set<number>()\n\n  for (let rowIdx = 0; rowIdx < numRows; rowIdx++) {\n    let colIdx = 0\n    let cellIdx = 0\n\n    while (colIdx < maxCols && cellIdx < rows[rowIdx].length) {\n      while (colIdx < maxCols && occupied[rowIdx][colIdx]) colIdx++\n      if (colIdx >= maxCols) break\n\n      const cell = rows[rowIdx][cellIdx]\n      anchorCols.add(colIdx)\n      grid[rowIdx][colIdx] = {\n        text: options?.keepEmptyParagraphs ? cell.text : cell.text.trim(),\n        colSpan: cell.colSpan,\n        rowSpan: cell.rowSpan,\n      }\n\n      for (let r = rowIdx; r < Math.min(rowIdx + cell.rowSpan, numRows); r++) {\n        for (let c = colIdx; c < Math.min(colIdx + cell.colSpan, maxCols); c++) {\n          occupied[r][c] = true\n        }\n      }\n\n      colIdx += cell.colSpan\n      cellIdx++\n    }\n  }\n\n  return trimAndReturn(grid, numRows, maxCols, anchorCols, options)\n}\n\n/** colAddr/rowAddr 절대 좌표 기반 직접 배치 */\nfunction buildTableDirect(rows: CellContext[][], numRows: number, options?: BuildTableOptions): IRTable {\n  // 전체 셀에서 maxCols 계산 (MAX_COLS 상한 적용)\n  let maxCols = 0\n  for (const row of rows) {\n    for (const cell of row) {\n      const end = (cell.colAddr ?? 0) + cell.colSpan\n      if (end > maxCols) maxCols = end\n    }\n  }\n  if (maxCols > MAX_COLS) maxCols = MAX_COLS\n  if (maxCols === 0) return { rows: 0, cols: 0, cells: [], hasHeader: false }\n\n  const grid: IRCell[][] = Array.from({ length: numRows }, () =>\n    Array.from({ length: maxCols }, () => ({ text: \"\", colSpan: 1, rowSpan: 1 }))\n  )\n\n  const anchorCols = new Set<number>()\n  for (const row of rows) {\n    for (const cell of row) {\n      const r = cell.rowAddr ?? 0\n      const c = cell.colAddr ?? 0\n      if (r >= numRows || c >= maxCols || r < 0 || c < 0) continue\n\n      anchorCols.add(c)\n      grid[r][c] = { text: options?.keepEmptyParagraphs ? cell.text : cell.text.trim(), colSpan: cell.colSpan, rowSpan: cell.rowSpan }\n\n      // 병합 영역 마킹\n      for (let dr = 0; dr < cell.rowSpan; dr++) {\n        for (let dc = 0; dc < cell.colSpan; dc++) {\n          if (dr === 0 && dc === 0) continue\n          if (r + dr < numRows && c + dc < maxCols) {\n            grid[r + dr][c + dc] = { text: \"\", colSpan: 1, rowSpan: 1 }\n          }\n        }\n      }\n    }\n  }\n\n  return trimAndReturn(grid, numRows, maxCols, anchorCols, options)\n}\n\n/** 빈 후행 열 제거 후 IRTable 반환 — 기본 텍스트 기준 전부, keepAnchoredEmptyCols면 앵커 없는 유령 열만 (#47) */\nfunction trimAndReturn(grid: IRCell[][], numRows: number, maxCols: number, anchorCols: Set<number>, options?: BuildTableOptions): IRTable {\n  let effectiveCols = maxCols\n  while (effectiveCols > 0) {\n    const colEmpty = grid.every(row => !row[effectiveCols - 1]?.text?.trim())\n    if (!colEmpty) break\n    // 실제 셀 앵커가 있는 빈 열은 서식 문서의 입력란 — 옵션 시 트림하지 않는다 (#47)\n    if (options?.keepAnchoredEmptyCols && anchorCols.has(effectiveCols - 1)) break\n    effectiveCols--\n  }\n  if (effectiveCols < maxCols && effectiveCols > 0) {\n    const trimmed = grid.map(row => row.slice(0, effectiveCols))\n    return { rows: numRows, cols: effectiveCols, cells: trimmed, hasHeader: numRows > 1 }\n  }\n  return { rows: numRows, cols: maxCols, cells: grid, hasHeader: numRows > 1 }\n}\n\nexport function convertTableToText(rows: CellContext[][]): string {\n  return rows\n    .map(row =>\n      row\n        .map(c => c.text.trim().replace(/\\n/g, \" \").replace(/\\|/g, \"\\\\|\"))\n        .filter(Boolean)\n        .join(\" / \")\n    )\n    .filter(Boolean)\n    .join(\"\\n\")\n}\n\n/** 마크다운 GFM 특수문자 이스케이프 — remark-gfm 오해석 방지 */\nfunction escapeGfm(text: string): string {\n  // ~ → \\~ (GFM strikethrough 방지), * → \\* (emphasis/HR·마스킹 별표 \"******\" 방지),\n  // _ → \\_ (emphasis 방지), ` → \\` (inline code 방지).\n  // 단 $...$ / $$...$$ 수식 스팬은 KaTeX 문법이라 이스케이프하면 파스 에러가 나므로 보호한다\n  // (스팬을 임시 필러로 가린 뒤 escape → 복원). NUL 필러는 마크다운 본문에 등장하지 않는다.\n  // ![image](image_001.png) 이미지 참조 스팬과 링크 URL부 `](스킴...)`(sanitizeHref 허용\n  // 스킴 한정 — 우연한 \"[라벨](식별자)\" 평문은 제외)도 동일 보호 — _ 이스케이프 시 문법 파괴.\n  const NUL = String.fromCharCode(0) // 마크다운 본문에 없는 안전한 필러 (소스에 raw NUL 미기입)\n  const spans: string[] = []\n  const masked = text.replace(/!\\[[^\\]]*\\]\\([^)\\n]*\\)|\\]\\((?:https?:|mailto:|tel:|#)[^)\\n]*\\)|\\$\\$[^$]*\\$\\$|\\$[^$\\n]*\\$/gi, (m) => {\n    spans.push(m)\n    return NUL + (spans.length - 1) + NUL\n  })\n  const escaped = masked.replace(/([~*_`])/g, \"\\\\$1\")\n  return escaped.replace(new RegExp(NUL + \"(\\\\d+)\" + NUL, \"g\"), (_, n) => spans[Number(n)])\n}\n\n/** HWP 자동생성 도형/개체 대체텍스트 정규식 — 한컴오피스가 삽입하는 모든 알려진 패턴.\n *  행 전체 일치(^…$m)로 한정 — 무앵커면 \"붙임 문서는 표 입니다.\" 같은 본문 중간을 오삭제한다 */\nconst HWP_SHAPE_ALT_TEXT_RE = /^(?:모서리가 둥근 |둥근 )?(?:사각형|직사각형|정사각형|원|타원|삼각형|이등변 삼각형|직각 삼각형|선|직선|곡선|화살표|굵은 화살표|이중 화살표|오각형|육각형|팔각형|별|[4-8]점별|십자|십자형|구름|구름형|마름모|도넛|평행사변형|사다리꼴|부채꼴|호|반원|물결|번개|하트|빗금|블록 화살표|수식|표|그림|개체|그리기\\s?개체|묶음\\s?개체|글상자|수식\\s?개체|OLE\\s?개체)\\s?입니다\\.?$/gm\n\n/** HWP PUA 특수문자 및 도형 대체텍스트 제거 — 모든 포맷 공통 */\nfunction sanitizeText(text: string): string {\n  // 한컴 PUA → 표준 유니코드 매핑 (rhwp 검증 테이블) — 제거 regex보다 먼저 적용\n  let result = mapPuaText(text)\n    // Supplementary Private Use Area (U+F0000-U+FFFFD) — HWP 전용 기호 (매핑 안 된 잔여분)\n    .replace(/[\\u{F0000}-\\u{FFFFD}]/gu, \"\")\n    // HWP 도형/개체 자동생성 대체텍스트 제거\n    .replace(HWP_SHAPE_ALT_TEXT_RE, \"\")\n    .replace(/  +/g, \" \")\n    .trim()\n  // 균등배분 스페이스 정리 (\"현 장 대 응 단 장\" → \"현장대응단장\")\n  // 짧은 텍스트(30자 이하)에서 70%+ 토큰이 한글 1글자면 균등배분으로 판단\n  if (result.length <= 30 && result.includes(\" \")) {\n    const tokens = result.split(\" \")\n    // 한글 1글자 토큰만 카운트 — ASCII 특수문자(< > & 등)는 균등배분이 아님\n    const koreanSingleCharCount = tokens.filter(t => t.length === 1 && /[\\uAC00-\\uD7AF\\u3131-\\u318E]/.test(t)).length\n    if (tokens.length >= 3 && koreanSingleCharCount / tokens.length >= 0.7) {\n      result = tokens.join(\"\")\n    }\n  }\n  return result\n}\n\n/**\n * 레이아웃 테이블 감지 및 해체 — IRBlock 레벨에서 수행\n * 적은 행(≤3) + 셀 내 줄바꿈 다량 → table 블록을 paragraph 블록들로 분해\n * heading 감지 전에 호출해야 해체된 텍스트에 heading 감지 적용 가능\n *\n * 호출 정책(의도): HWP5 파서만 호출한다. 구형 HWP5 문서는 제목/본문을 표로\n * 감싼 레이아웃 표가 흔하지만, HWPX는 그 관행이 드물고 무엇보다 patchHwpx/\n * fillHwpx 무손실 라운드트립이 \"파서 렌더 = 소스맵 표 서수\" 대응에 의존하므로\n * HWPX에서 표를 문단으로 해체하면 표 매핑이 깨진다. HWPX 적용은 코퍼스\n * 전/후 정량 비교 + 라운드트립 e2e 검증이 선행되어야 한다.\n */\nexport function flattenLayoutTables(blocks: IRBlock[]): IRBlock[] {\n  const result: IRBlock[] = []\n\n  for (const block of blocks) {\n    if (block.type !== \"table\" || !block.table) {\n      result.push(block)\n      continue\n    }\n\n    const { rows: numRows, cols: numCols, cells } = block.table\n\n    // 1x1 테이블은 기존 로직(tableToMarkdown)에서 처리\n    if (numRows === 1 && numCols === 1) {\n      result.push(block)\n      continue\n    }\n\n    // 레이아웃 테이블 휴리스틱\n    if (numRows <= 3) {\n      let totalNewlines = 0\n      let totalTextLen = 0\n      for (let r = 0; r < numRows; r++) {\n        for (let c = 0; c < numCols; c++) {\n          const t = cells[r]?.[c]?.text || \"\"\n          totalNewlines += (t.match(/\\n/g) || []).length\n          totalTextLen += t.length\n        }\n      }\n\n      // 레이아웃 테이블 판정: 많은 줄바꿈(>5), 또는 적은 행에 비해 총 텍스트 과다(>300)\n      // 단, 열이 4개 이상이면 헤더-값 구조의 데이터 표일 가능성이 높아 해체하지 않는다\n      // (실증: 2×10 모집프로그램 표가 문단으로 해체되어 헤더↔값 연결 파괴)\n      if (numCols < 4 && (totalNewlines > 5 || (numRows <= 2 && totalTextLen > 300))) {\n        // 레이아웃 테이블 → 각 셀을 paragraph 블록으로 분해\n        for (let r = 0; r < numRows; r++) {\n          for (let c = 0; c < numCols; c++) {\n            const cell = cells[r]?.[c]\n            if (!cell) continue\n            // 셀에 구조화 블록(중첩표·이미지·다중문단)이 있으면 재귀 해체로 구조 보존.\n            // 중첩 spec 표(numRows>3)는 해체되지 않고 실제 table 블록으로 살아남는다\n            // (text의 \" / \" 평탄화 폴백으로만 남아 유실되던 버그 수정). 셀 blocks는\n            // 이미 같은 pageNumber로 생성되므로 그대로 보존된다.\n            if (cell.blocks?.length) {\n              result.push(...flattenLayoutTables(cell.blocks))\n              continue\n            }\n            const cellText = cell.text?.trim()\n            if (!cellText) continue\n            // 셀 내 줄바꿈을 별도 paragraph로 분리\n            for (const line of cellText.split(\"\\n\")) {\n              const trimmed = line.trim()\n              if (!trimmed) continue\n              result.push({ type: \"paragraph\", text: trimmed, pageNumber: block.pageNumber })\n            }\n          }\n        }\n        continue\n      }\n    }\n\n    result.push(block)\n  }\n\n  return result\n}\n\n/** 러닝 헤더 후보 판정 최대 길이 — 긴 본문 문단을 헤더로 오인하지 않도록 */\nconst RUNNING_HEADER_MAX_LEN = 40\n/** 러닝 헤더로 판정할 최소 반복 횟수 — 페이지마다 재삽입되는 노이즈만 제거 */\nconst RUNNING_HEADER_MIN_FREQ = 3\n\n/** 러닝 헤더 후보 여부 — 짧은 번호매김 섹션 제목(\"2. 과제 구축 내용\")만 */\nfunction isRunningHeaderCandidate(block: IRBlock): boolean {\n  if (block.type !== \"paragraph\" && block.type !== \"heading\") return false\n  const text = block.text?.trim()\n  if (!text || text.length > RUNNING_HEADER_MAX_LEN) return false\n  return /^\\d+\\.\\s/.test(text)\n}\n\n/**\n * 페이지 레이아웃 표에서 유래한 반복 러닝 헤더 문단 중복 제거 — IRBlock 레벨.\n *\n * 배경: 구형 HWP5 문서(군 제안서 등)는 본문 전체를 \"페이지 = N×1 표\" 사슬로\n * 구성하고 각 표의 cell(0,0)에 동일한 섹션 헤더(\"2. 과제 구축 내용\")를 반복\n * 배치한다. flattenLayoutTables가 이 표들을 문단으로 해체하면 같은 헤더가\n * 페이지마다 1회씩 독립 문단으로 남아 본문 사이에 노이즈로 흩어진다. HWP\n * 머리말/꼬리말(CTRL_HEAD/CTRL_FOOT)은 applyHeaderFooterEffect에서 이미\n * dedupe되지만, 본문 레이아웃 표의 러닝 헤더는 그 대상이 아니다.\n *\n * 정책(보수적): \"짧은 번호매김 섹션 제목\"이 정확히 동일 텍스트로 3회 이상\n * 반복될 때만 최초 1회를 남기고 이후 중복을 제거한다. 비후보 블록과 3회 미만\n * 후보는 원형 그대로 통과시킨다(본문 삭제 위험 최소화). 위치 무관 — 평탄화된\n * 블록 스트림 전체를 대상으로 하며, 입력 블록을 변형하지 않고 새 배열을 반환한다.\n */\nexport function dedupeRunningHeaders(blocks: IRBlock[]): IRBlock[] {\n  // Pass 1: 후보 텍스트 빈도 집계\n  const freq = new Map<string, number>()\n  for (const block of blocks) {\n    if (!isRunningHeaderCandidate(block)) continue\n    const text = block.text!.trim()\n    freq.set(text, (freq.get(text) ?? 0) + 1)\n  }\n\n  // Pass 2: 빈도 ≥ 임계값인 후보는 최초 1회만 유지, 이후 중복 제거\n  const seen = new Set<string>()\n  const result: IRBlock[] = []\n  for (const block of blocks) {\n    if (isRunningHeaderCandidate(block)) {\n      const text = block.text!.trim()\n      if ((freq.get(text) ?? 0) >= RUNNING_HEADER_MIN_FREQ) {\n        if (seen.has(text)) continue // 이후 중복 — 제거\n        seen.add(text)\n      }\n    }\n    result.push(block)\n  }\n\n  return result\n}\n\n/**\n * 왕복 채널 run-span → 강조 마커 재방출. 마커는 텍스트에 밀착해야 유효하므로\n * span 가장자리 공백은 마커 밖으로 옮긴다. 코드 span 내부는 이스케이프 없이 원문.\n */\nfunction spansToMarkdown(spans: IRSpan[]): string {\n  let out = \"\"\n  for (const s of spans) {\n    if (!s.text) continue\n    let marker = s.code ? \"`\" : s.bold && s.italic ? \"***\" : s.bold ? \"**\" : s.italic ? \"*\" : \"\"\n    if (s.strike && !s.code) marker = `~~${marker}` // 닫힘은 아래 close 에서 역순 조합 (~~**…**~~)\n    if (!marker) {\n      out += escapeGfm(s.text)\n      continue\n    }\n    const m = /^(\\s*)([\\s\\S]*?)(\\s*)$/.exec(s.text)!\n    const core = m[2]\n    if (!core) {\n      out += s.text\n      continue\n    }\n    const close = [...marker].reverse().join(\"\")\n    out += m[1] + marker + (s.code ? core : escapeGfm(core)) + close + m[3]\n  }\n  return out\n}\n\nexport function blocksToMarkdown(blocks: IRBlock[]): string {\n  const lines: string[] = []\n\n  for (let i = 0; i < blocks.length; i++) {\n    const block = blocks[i]\n\n    // 헤딩 블록 — escapeGfm 필수: 마스킹 별표(\"홍**\")가 볼드로 소비·삭제되는 것 방지\n    if (block.type === \"heading\" && block.text) {\n      const prefix = \"#\".repeat(Math.min(block.level || 2, 6))\n      const headingText = sanitizeText(block.text)\n      if (headingText) lines.push(\"\", `${prefix} ${escapeGfm(headingText)}`, \"\")\n      continue\n    }\n\n    // 이미지 블록 — ![alt](filename) 참조\n    if (block.type === \"image\" && block.text) {\n      lines.push(\"\", `![image](${block.text})`, \"\")\n      continue\n    }\n\n    // 구분선 블록\n    if (block.type === \"separator\") {\n      lines.push(\"\", \"---\", \"\")\n      continue\n    }\n\n    // 리스트 블록\n    if (block.type === \"list\" && block.text) {\n      const listText = sanitizeText(block.text)\n      if (!listText) continue\n      // 텍스트가 이미 번호로 시작하면 그대로 출력 (원래 번호 보존)\n      const alreadyNumbered = block.listType === \"ordered\" && /^\\d+\\.\\s/.test(listText)\n      const prefix = alreadyNumbered ? \"\" : block.listType === \"ordered\" ? \"1. \" : \"- \"\n      lines.push(`${prefix}${escapeGfm(listText)}`)\n      if (block.children) {\n        for (const child of block.children) {\n          const childPrefix = child.listType === \"ordered\" ? \"1.\" : \"-\"\n          lines.push(`  ${childPrefix} ${escapeGfm(child.text || \"\")}`)\n        }\n      }\n      continue\n    }\n\n    if (block.type === \"paragraph\" && block.text) {\n      let text = sanitizeText(block.text)\n      if (!text) continue\n\n      // 별표 패턴 (기존 호환)\n      if (/^\\[별표\\s*\\d+/.test(text)) {\n        const nextBlock = blocks[i + 1]\n        if (nextBlock?.type === \"paragraph\" && nextBlock.text && /관련\\)?$/.test(nextBlock.text)) {\n          lines.push(\"\", `## ${escapeGfm(text)} ${escapeGfm(nextBlock.text)}`, \"\")\n          i++\n        } else {\n          lines.push(\"\", `## ${escapeGfm(text)}`, \"\")\n        }\n        continue\n      }\n\n      if (/^\\([^)]*조[^)]*관련\\)$/.test(text)) {\n        lines.push(`*${escapeGfm(text)}*`, \"\")\n        continue\n      }\n\n      // gongmun 리스트 depth 선행 공백 (v4.0.5) — sanitizeText가 선두 공백을 지우므로\n      // 텍스트가 아니라 방출 시점에 붙인다. 2칸/단계 = md-runs 리스트 그리드와 동일\n      const listIndent = block.listDepth ? \"  \".repeat(block.listDepth) : \"\"\n\n      // 인라인 강조 run-span (왕복 채널 — 자사 생성 파일 + 외래 실속성 복원) → 마커 재방출.\n      // 마커 자체는 이스케이프 대상이 아니므로 span 내부 텍스트만 escapeGfm 후 감싼다\n      if (block.spans?.length) {\n        let rendered = spansToMarkdown(block.spans)\n        if (block.href) {\n          const href = sanitizeHref(block.href)\n          if (href) rendered = `[${rendered}](${href})`\n        }\n        if (block.footnoteText) rendered += ` (주: ${block.footnoteText})`\n        lines.push(block.quote ? \"> \" + rendered : listIndent + rendered, \"\")\n        continue\n      }\n\n      // 하이퍼링크가 있으면 텍스트에 링크 삽입 (javascript: 등 위험 스킴 제거)\n      if (block.href) {\n        const href = sanitizeHref(block.href)\n        if (href) text = `[${text}](${href})`\n      }\n\n      // 각주가 있으면 괄호로 인라인 삽입\n      if (block.footnoteText) {\n        text += ` (주: ${block.footnoteText})`\n      }\n\n      lines.push(block.quote ? \"> \" + escapeGfm(text) : listIndent + escapeGfm(text), \"\")\n    } else if (block.type === \"table\" && block.table) {\n      // 테이블 앞에 빈 줄 보장 (마크다운 렌더링 필수)\n      if (lines.length > 0 && lines[lines.length - 1] !== \"\") {\n        lines.push(\"\")\n      }\n      // 표 캡션 — 표 위에 강조 문단으로 출력 (v3.0)\n      if (block.table.caption) {\n        const caption = sanitizeText(block.table.caption)\n        if (caption) lines.push(`**${escapeGfm(caption)}**`, \"\")\n      }\n      const tableMd = tableToMarkdown(block.table)\n      if (tableMd) {\n        lines.push(tableMd)\n        lines.push(\"\")\n      }\n    }\n  }\n\n  return lines.join(\"\\n\").trim()\n}\n\n/** 병합 셀 존재 여부 확인 */\nfunction hasMergedCells(table: IRTable): boolean {\n  for (const row of table.cells) {\n    for (const cell of row) {\n      if (cell.colSpan > 1 || cell.rowSpan > 1) return true\n    }\n  }\n  return false\n}\n\n/** 셀 내부에 중첩 표 블록 존재 여부 — v3.0 */\nfunction hasNestedTables(table: IRTable): boolean {\n  for (const row of table.cells) {\n    for (const cell of row) {\n      if (cell.blocks?.some(b => b.type === \"table\" && b.table)) return true\n    }\n  }\n  return false\n}\n\n/** 셀 내부 콘텐츠 → HTML — blocks(중첩표/다중문단) 있으면 구조 보존 재귀 렌더링 */\nfunction cellInnerHtml(cell: IRCell): string {\n  if (cell.blocks?.length) {\n    return cell.blocks\n      .map(b => {\n        if (b.type === \"table\" && b.table) {\n          // 중첩표 캡션도 보존 — 표 위에 텍스트로\n          const cap = b.table.caption ? sanitizeText(b.table.caption) : \"\"\n          return (cap ? cap + \"<br>\" : \"\") + tableToHtml(b.table)\n        }\n        if (b.type === \"image\" && b.text) return `<img src=\"${b.text}\" alt=\"image\">`\n        const t = sanitizeText(b.text ?? \"\")\n        return t ? t.replace(/\\n/g, \"<br>\") : \"\"\n      })\n      .filter(Boolean)\n      .join(\"<br>\")\n  }\n  return sanitizeText(cell.text).replace(/\\n/g, \"<br>\")\n}\n\nfunction containsInlineMath(text: string): boolean {\n  // 교대 중복 금지: [^$\\n\\\\]가 백슬래시를 제외해 \\\\.와 겹치지 않는다 —\n  // 겹치면 \"$\"+백슬래시 연속 입력에서 지수 백트래킹(ReDoS)\n  return /(^|[^\\\\])\\$(?=\\S)(?:[^$\\n\\\\]|\\\\.)+?\\S\\$/.test(text)\n}\n\nfunction tableContainsInlineMath(table: IRTable): boolean {\n  for (const row of table.cells) {\n    for (const cell of row) {\n      if (containsInlineMath(cell.text)) return true\n    }\n  }\n  return false\n}\n\n/** 병합 테이블 → HTML <table> 출력 (rowspan/colspan 보존) */\nfunction tableToHtml(table: IRTable): string {\n  const { cells, rows: numRows, cols: numCols } = table\n  const skip = new Set<string>()\n  const lines: string[] = [\"<table>\"]\n\n  for (let r = 0; r < numRows; r++) {\n    const tag = r === 0 ? \"th\" : \"td\"\n    const rowHtml: string[] = []\n    for (let c = 0; c < numCols; c++) {\n      if (skip.has(`${r},${c}`)) continue\n      const cell = cells[r]?.[c]\n      if (!cell) continue\n\n      // 병합 영역 skip 마킹\n      for (let dr = 0; dr < cell.rowSpan; dr++) {\n        for (let dc = 0; dc < cell.colSpan; dc++) {\n          if (dr === 0 && dc === 0) continue\n          if (r + dr < numRows && c + dc < numCols) skip.add(`${r + dr},${c + dc}`)\n        }\n      }\n\n      const text = cellInnerHtml(cell)\n      const attrs: string[] = []\n      if (cell.colSpan > 1) attrs.push(`colspan=\"${cell.colSpan}\"`)\n      if (cell.rowSpan > 1) attrs.push(`rowspan=\"${cell.rowSpan}\"`)\n      const attrStr = attrs.length ? \" \" + attrs.join(\" \") : \"\"\n      rowHtml.push(`<${tag}${attrStr}>${text}</${tag}>`)\n    }\n    if (rowHtml.length) lines.push(`<tr>${rowHtml.join(\"\")}</tr>`)\n  }\n\n  lines.push(\"</table>\")\n  return lines.join(\"\\n\")\n}\n\nfunction tableToMarkdown(table: IRTable): string {\n  if (table.rows === 0 || table.cols === 0) return \"\"\n\n  const { cells, rows: numRows, cols: numCols } = table\n\n  // 병합 셀·중첩표가 있으면 HTML 테이블로 출력하되, 수식이 있으면 GFM 표로 출력한다.\n  // 많은 Markdown 렌더러가 raw HTML table 내부의 $...$를 수식으로 다시 처리하지 않는다.\n  if ((hasMergedCells(table) || hasNestedTables(table)) && !tableContainsInlineMath(table)) {\n    return tableToHtml(table)\n  }\n\n  // 1행 1열 → 구조화된 텍스트 (빈 셀이면 스킵)\n  if (numRows === 1 && numCols === 1) {\n    const content = sanitizeText(cells[0][0].text)\n    if (!content) return \"\"\n    return content\n      .split(/\\n/)\n      .map(line => {\n        const trimmed = line.trim()\n        if (!trimmed) return \"\"\n        if (/^\\d+\\.\\s/.test(trimmed)) return `**${escapeGfm(trimmed)}**`\n        if (/^[가-힣]\\.\\s/.test(trimmed)) return `  ${escapeGfm(trimmed)}`\n        return escapeGfm(trimmed)\n      })\n      .filter(Boolean)\n      .join(\"\\n\")\n  }\n\n  // 1열 다행 테이블 → 각 행을 별도 라인으로 출력 (목록성 데이터)\n  if (numCols === 1 && numRows >= 2) {\n    return cells\n      .map(row => escapeGfm(sanitizeText(row[0].text)).replace(/\\n/g, \" \"))\n      .filter(Boolean)\n      .join(\"\\n\")\n  }\n\n  // 병합 셀: 행/열 병합된 셀은 빈 칸으로\n  const display: string[][] = Array.from({ length: numRows }, () => Array(numCols).fill(\"\"))\n  const skip = new Set<string>()\n\n  for (let r = 0; r < numRows; r++) {\n    for (let c = 0; c < numCols; c++) {\n      if (skip.has(`${r},${c}`)) continue\n      const cell = cells[r]?.[c]\n      if (!cell) continue\n      // 왕복 채널 셀 spans (v4.0.4) — 강조 마커 재방출 (문단별, 개행은 <br> 규약)\n      display[r][c] = (cell.blocks?.some(b => b.spans)\n        ? cell.blocks\n          .map(b => b.type === \"image\" && b.text\n            ? `![image](${b.text})`\n            : b.spans ? spansToMarkdown(b.spans) : escapeGfm(sanitizeText(b.text ?? \"\")))\n          .filter(Boolean)\n          .join(\"<br>\")\n        : escapeGfm(sanitizeText(cell.text)).replace(/\\n/g, \"<br>\")\n      ).replace(/\\|/g, \"\\\\|\")\n\n      // colSpan/rowSpan: 병합된 열은 빈 칸으로 유지 (텍스트 중복 방지)\n      for (let dr = 0; dr < cell.rowSpan; dr++) {\n        for (let dc = 0; dc < cell.colSpan; dc++) {\n          if (dr === 0 && dc === 0) continue\n          if (r + dr < numRows && c + dc < numCols) {\n            skip.add(`${r + dr},${c + dc}`)\n          }\n        }\n      }\n      // colSpan > 1이면 display 열 인덱스를 건너뜀\n      c += cell.colSpan - 1\n    }\n  }\n\n  // rowSpan 잔류 처리:\n  // 1) 완전 빈 행 제거\n  // 2) \"첫 열만 값, 나머지 빈\" 행 → 다음 데이터 행의 첫 열에 값을 전파\n  //    단, colSpan으로 인한 빈 열(skip 셀)은 이 대상이 아님\n  const uniqueRows: string[][] = []\n  let pendingLabelRow: string[] | null = null\n  for (let r = 0; r < display.length; r++) {\n    const row = display[r]\n    if (row.every(cell => cell === \"\")) {\n      // rowSpan 잔류 행(병합 커버 셀 포함 — 병합+수식 GFM 경로)만 제거.\n      // 앵커 셀이 전부 빈 텍스트인 진짜 빈 행은 문서 구조 — 보존해야 왕복이 성립한다.\n      if (row.some((_, c) => skip.has(`${r},${c}`))) continue\n      if (pendingLabelRow) { uniqueRows.push(pendingLabelRow); pendingLabelRow = null }\n      uniqueRows.push(row)\n      continue\n    }\n\n    // 첫 열만 값이 있고 나머지 모두 빈 행 → 다음 데이터 행의 첫 열에 전파\n    // 단, colSpan으로 인한 빈 열(skip 셀)은 \"진짜 빈\"이 아니므로 제외\n    const nonEmptyCols = row.filter(cell => cell !== \"\")\n    const hasSkipInRow = row.some((_, c) => skip.has(`${r},${c}`))\n    if (!hasSkipInRow && nonEmptyCols.length === 1 && row[0] !== \"\" && row.slice(1).every(c => c === \"\")) {\n      if (pendingLabelRow) uniqueRows.push(pendingLabelRow) // 연속 보류 — 앞 행 소실 방지\n      pendingLabelRow = row\n      continue\n    }\n\n    // 보류한 첫 열 값을 현재 행의 빈 첫 열에 전파, 전파 불가면 보류 행 그대로 출력\n    if (pendingLabelRow) {\n      if (row[0] === \"\") row[0] = pendingLabelRow[0]\n      else uniqueRows.push(pendingLabelRow)\n      pendingLabelRow = null\n    }\n    uniqueRows.push(row)\n  }\n  if (pendingLabelRow) uniqueRows.push(pendingLabelRow) // 표 끝 보류 행 소실 방지\n\n  if (uniqueRows.length === 0) return \"\"\n\n  const md: string[] = []\n  md.push(\"| \" + uniqueRows[0].join(\" | \") + \" |\")\n  md.push(\"| \" + uniqueRows[0].map(() => \"---\").join(\" | \") + \" |\")\n  for (let i = 1; i < uniqueRows.length; i++) {\n    md.push(\"| \" + uniqueRows[i].join(\" | \") + \" |\")\n  }\n  return md.join(\"\\n\")\n}\n","/**\n * 순수 JS BMP → PNG 트랜스코더 + 마크다운 이미지 인라이너.\n *\n * HWP5 BinData 임베드 이미지는 비압축 BMP(수 MB)인 경우가 많다. AI 에이전트가\n * 자체 완결형 마크다운을 받도록, BMP 를 PNG(무손실 압축)로 변환한 뒤 base64\n * data URI 로 마크다운에 인라인한다.\n *\n * 의존성 최소화 원칙 — Node 내장(node:zlib, Buffer)만 사용한다.\n */\n\nimport { deflateSync } from \"node:zlib\"\n\n// ─── CRC32 (PNG 청크용) ──────────────────────────────\n\nconst CRC_TABLE = (() => {\n  const table = new Uint32Array(256)\n  for (let n = 0; n < 256; n++) {\n    let c = n\n    for (let k = 0; k < 8; k++) {\n      c = (c & 1) ? (0xedb88320 ^ (c >>> 1)) : (c >>> 1)\n    }\n    table[n] = c >>> 0\n  }\n  return table\n})()\n\n/** 표준 PNG CRC32 (다항식 0xEDB88320) */\nfunction crc32(bytes: Uint8Array): number {\n  let c = 0xffffffff\n  for (let i = 0; i < bytes.length; i++) {\n    c = CRC_TABLE[(c ^ bytes[i]) & 0xff] ^ (c >>> 8)\n  }\n  return (c ^ 0xffffffff) >>> 0\n}\n\n// ─── BMP 디코드 ──────────────────────────────────────\n\nconst BI_RGB = 0\n/** 폭·높이 상한 — 비정상 헤더에 의한 과대 할당 방지 */\nconst MAX_DIM = 0x7fff\n/**\n * 총 픽셀(W×H) 상한 — MAX_DIM 은 각 변만 제한하므로 곱의 폭주(과대 할당 + 긴 deflateSync\n * 동기 블로킹)를 별도로 차단한다. raw 저장 BMP 는 상위 inflate 100MB 캡을 우회하므로 필요.\n * 36MP = A4 전면 600dpi 스캔(≈35MP)까지 허용 — 그 이상은 rgba+raw 로 300MB 를 넘겨\n * MCP 서버 이벤트루프를 수 초 세우므로 원본 바이트 폴백으로 돌린다.\n */\nconst MAX_PIXELS = 36_000_000\n\n/**\n * 비압축 BMP(24/32bpp, BI_RGB) → PNG(8bit RGBA).\n *\n * 지원: BITMAPFILEHEADER + BITMAPINFOHEADER(biSize>=40), biBitCount 24/32,\n * biCompression BI_RGB, bottom-up(양수 biHeight)/top-down(음수), 24bpp 4바이트 행 패딩.\n * 미지원 변형(팔레트/8bpp·RLE·BITFIELDS·OS/2 헤더 등)은 null 을 반환하여\n * 호출부가 원본 바이트로 폴백하게 한다.\n */\nexport function bmpToPng(bmp: Uint8Array): Uint8Array | null {\n  // BITMAPFILEHEADER(14) + BITMAPINFOHEADER(40)\n  if (bmp.length < 54) return null\n  if (bmp[0] !== 0x42 || bmp[1] !== 0x4d) return null // \"BM\"\n\n  const dv = new DataView(bmp.buffer, bmp.byteOffset, bmp.byteLength)\n  const dataOffset = dv.getUint32(10, true)\n  const headerSize = dv.getUint32(14, true)\n  if (headerSize < 40) return null // OS/2 BITMAPCOREHEADER 등 미지원\n\n  const width = dv.getInt32(18, true)\n  const rawHeight = dv.getInt32(22, true)\n  const bitCount = dv.getUint16(28, true)\n  const compression = dv.getUint32(30, true)\n\n  if (compression !== BI_RGB) return null // RLE / BITFIELDS 미지원\n  if (bitCount !== 24 && bitCount !== 32) return null // 팔레트 / 8bpp 등 미지원\n  if (width <= 0 || rawHeight === 0) return null\n  if (width > MAX_DIM || Math.abs(rawHeight) > MAX_DIM) return null\n\n  const topDown = rawHeight < 0\n  const height = Math.abs(rawHeight)\n  // 총 픽셀 상한 검사 — rgba/raw 할당·deflate 전에 조기 차단 (각 변은 MAX_DIM 이하여도 곱은 폭주 가능)\n  if (width * height > MAX_PIXELS) return null\n  const bytesPerPixel = bitCount >> 3\n  // 행 스트라이드 — 4바이트 경계 패딩 (24bpp 에서 유효)\n  const rowStride = (width * bytesPerPixel + 3) & ~3\n  if (dataOffset + rowStride * height > bmp.length) return null // 잘린 파일\n\n  const rgba = new Uint8Array(width * height * 4)\n  let anyAlpha = 0\n\n  for (let y = 0; y < height; y++) {\n    // bottom-up 은 첫 행이 이미지 맨 아래 → 뒤집어 읽는다\n    const srcRow = topDown ? y : height - 1 - y\n    let src = dataOffset + srcRow * rowStride\n    let dst = y * width * 4\n    for (let x = 0; x < width; x++) {\n      // BMP 픽셀은 BGR(A) 순\n      rgba[dst] = bmp[src + 2]     // R\n      rgba[dst + 1] = bmp[src + 1] // G\n      rgba[dst + 2] = bmp[src]     // B\n      const a = bitCount === 32 ? bmp[src + 3] : 255\n      rgba[dst + 3] = a\n      anyAlpha |= a\n      src += bytesPerPixel\n      dst += 4\n    }\n  }\n\n  // 32bpp BI_RGB 의 4번째 바이트는 \"미정의\" — 전부 0 이면 전면 투명으로 오해되므로\n  // 불투명(255)으로 승격한다. 실제 알파가 있으면(anyAlpha!=0) 그대로 보존.\n  if (bitCount === 32 && anyAlpha === 0) {\n    for (let i = 3; i < rgba.length; i += 4) rgba[i] = 255\n  }\n\n  return encodePng(width, height, rgba)\n}\n\n// ─── PNG 인코드 (8bit RGBA, color type 6) ────────────\n\nconst PNG_SIGNATURE = Uint8Array.of(0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a)\n\n/** [4B 길이][4B 타입][데이터][4B CRC] 청크 조립. CRC 는 (타입+데이터) 기준. */\nfunction chunk(type: string, data: Uint8Array): Uint8Array {\n  const body = new Uint8Array(4 + data.length)\n  body[0] = type.charCodeAt(0)\n  body[1] = type.charCodeAt(1)\n  body[2] = type.charCodeAt(2)\n  body[3] = type.charCodeAt(3)\n  body.set(data, 4)\n\n  const out = new Uint8Array(8 + data.length + 4)\n  const dv = new DataView(out.buffer)\n  dv.setUint32(0, data.length, false) // 길이(데이터만, big-endian)\n  out.set(body, 4)\n  dv.setUint32(8 + data.length, crc32(body), false)\n  return out\n}\n\n/** 8bit RGBA 픽셀 버퍼 → PNG (PDF 이미지 XObject 추출에서도 사용) */\nexport function encodePng(width: number, height: number, rgba: Uint8Array): Uint8Array {\n  // IHDR: width, height, bit depth 8, color type 6(RGBA), compression 0, filter 0, interlace 0\n  const ihdr = new Uint8Array(13)\n  const iv = new DataView(ihdr.buffer)\n  iv.setUint32(0, width, false)\n  iv.setUint32(4, height, false)\n  ihdr[8] = 8\n  ihdr[9] = 6\n\n  // IDAT: 각 스캔라인 앞에 필터 바이트 0(None) 을 붙인 raw 데이터를 zlib deflate\n  const stride = width * 4\n  const raw = new Uint8Array((stride + 1) * height)\n  for (let y = 0; y < height; y++) {\n    const rowStart = y * (stride + 1)\n    raw[rowStart] = 0 // filter: None\n    raw.set(rgba.subarray(y * stride, y * stride + stride), rowStart + 1)\n  }\n  const idat = deflateSync(raw)\n\n  const ihdrChunk = chunk(\"IHDR\", ihdr)\n  const idatChunk = chunk(\"IDAT\", idat)\n  const iendChunk = chunk(\"IEND\", new Uint8Array(0))\n\n  const out = new Uint8Array(PNG_SIGNATURE.length + ihdrChunk.length + idatChunk.length + iendChunk.length)\n  let o = 0\n  out.set(PNG_SIGNATURE, o); o += PNG_SIGNATURE.length\n  out.set(ihdrChunk, o); o += ihdrChunk.length\n  out.set(idatChunk, o); o += idatChunk.length\n  out.set(iendChunk, o)\n  return out\n}\n\n// ─── 마크다운 이미지 인라이너 ────────────────────────\n\ninterface InlineImage {\n  filename: string\n  data: Uint8Array\n  mimeType: string\n}\n\n/**\n * 마크다운의 이미지 참조를 base64 data URI 로 치환해 자체 완결형 마크다운을 만든다.\n * 두 방출 형태를 모두 커버한다:\n * - `![image](FILENAME)` / `![image](images/FILENAME)` — 일반 문단 (CLI 접두사 포함)\n * - `<img src=\"FILENAME\">` — 병합/중첩 표 셀 (table/builder.ts HTML 표 경로).\n *   이걸 빼면 CLI `--inline-images` 가 이미지 저장을 생략하면서 표 셀 이미지만\n *   dangling 참조로 유실된다.\n *\n * @param opts.compress 기본 true. `image/bmp` 는 PNG 로 트랜스코딩 후 인라인하며,\n *                      트랜스코딩 실패 시 원본 바이트+원본 MIME 으로 폴백한다.\n */\nexport function inlineImagesIntoMarkdown(\n  markdown: string,\n  images: ReadonlyArray<InlineImage>,\n  opts?: { compress?: boolean },\n): string {\n  const compress = opts?.compress !== false\n  // 파일명 → data URI 사전 구축 후 단일 패스 치환 — 이미지 k개마다 전문 재스캔하던\n  // O(k²) 제거. 맵에 없는 파일명 참조는 원문 그대로 둔다 (기존 계약 동일).\n  const uris = new Map<string, string>()\n  for (const img of images) {\n    let bytes = img.data\n    let mime = img.mimeType\n    if (compress && mime === \"image/bmp\") {\n      const png = bmpToPng(img.data)\n      if (png) {\n        bytes = png\n        mime = \"image/png\"\n      }\n    }\n    uris.set(img.filename, `data:${mime};base64,${Buffer.from(bytes).toString(\"base64\")}`)\n  }\n  if (uris.size === 0) return markdown\n  // FILENAME 과 images/FILENAME 접두사를 모두 정확한 파일명 기준으로 치환\n  let out = markdown.replace(/!\\[image\\]\\((?:images\\/)?([^()\\s]+)\\)/g, (m, name: string) => {\n    const uri = uris.get(name)\n    return uri !== undefined ? `![image](${uri})` : m\n  })\n  out = out.replace(/(<img\\b[^>]*\\bsrc=\")(?:images\\/)?([^\"]*)(\")/g, (m, pre: string, name: string, post: string) => {\n    const uri = uris.get(name)\n    return uri !== undefined ? `${pre}${uri}${post}` : m\n  })\n  return out\n}\n"],"mappings":";;;;;AAYA,IAAM,iBAAyC;AAAA;AAAA,EAE7C,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA;AAAA,EAEN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA;AAAA,EAEN,IAAM;AAAA;AAAA,EACN,IAAM;AAAA;AAAA,EACN,IAAM;AAAA;AAAA,EACN,IAAM;AAAA;AAAA;AAAA,EAEN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA;AAAA,EAEN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA,EACN,KAAM;AAAA;AAAA;AAAA,EAEN,IAAM;AAAA;AAAA,EACN,IAAM;AAAA;AAAA,EACN,IAAM;AAAA;AAAA,EACN,IAAM;AAAA;AAAA,EACN,IAAM;AAAA;AAAA,EACN,IAAM;AAAA;AAAA,EACN,IAAM;AAAA;AAAA,EACN,IAAM;AAAA;AACR;AAKA,IAAM,oBAA4C;AAAA,EAChD,QAAS;AAAA;AAAA,EACT,QAAS;AAAA;AAAA,EACT,QAAS;AAAA;AAAA,EACT,QAAS;AAAA;AAAA,EACT,QAAS;AAAA;AAAA,EACT,QAAS;AAAA;AAAA,EACT,QAAS;AAAA;AAAA,EACT,QAAS;AAAA;AAAA;AAAA,EAET,QAAS;AAAA;AAAA,EACT,QAAS;AAAA;AAAA,EACT,QAAS;AAAA;AAAA,EACT,QAAS;AAAA;AAAA;AAAA,EAET,QAAS;AAAA,EACT,QAAS;AAAA,EACT,QAAS;AAAA,EACT,QAAS;AAAA,EACT,QAAS;AAAA,EACT,QAAS;AACX;AAKA,IAAM,qBAAqB;AAC3B,IAAM,mBAAmB;AAGzB,SAAS,WAAW,MAAkC;AACpD,MAAI,QAAQ,SAAU,QAAQ,OAAQ;AACpC,WAAO,eAAe,OAAO,KAAM;AAAA,EACrC;AACA,MAAI,QAAQ,sBAAsB,QAAQ,kBAAkB;AAC1D,WAAO,OAAO,cAAc,QAAU,OAAO,mBAAmB;AAAA,EAClE;AACA,MAAI,QAAQ,UAAW,QAAQ,QAAS;AACtC,WAAO,kBAAkB,IAAI;AAAA,EAC/B;AACA,SAAO;AACT;AAOO,SAAS,WAAW,MAAsB;AAC/C,MAAI,MAAM;AACV,aAAW,MAAM,MAAM;AACrB,UAAM,OAAO,GAAG,YAAY,CAAC;AAC7B,WAAO,WAAW,IAAI,KAAK;AAAA,EAC7B;AACA,SAAO;AACT;;;ACxHO,IAAM,WAAW;AAEjB,IAAM,WAAW;AAajB,SAAS,WAAW,MAAuB,SAAsC;AACtF,MAAI,KAAK,SAAS,SAAU,QAAO,KAAK,MAAM,GAAG,QAAQ;AACzD,QAAM,UAAU,KAAK;AAGrB,QAAM,UAAU,KAAK,KAAK,SAAO,IAAI,KAAK,OAAK,EAAE,YAAY,UAAa,EAAE,YAAY,MAAS,CAAC;AAClG,MAAI,QAAS,QAAO,iBAAiB,MAAM,SAAS,OAAO;AAG3D,MAAI,UAAU;AACd,QAAM,eAA4B,MAAM,KAAK,EAAE,QAAQ,QAAQ,GAAG,MAAM,CAAC,CAAC;AAE1E,WAAS,SAAS,GAAG,SAAS,SAAS,UAAU;AAC/C,QAAI,SAAS;AACb,eAAW,QAAQ,KAAK,MAAM,GAAG;AAC/B,aAAO,SAAS,YAAY,aAAa,MAAM,EAAE,MAAM,EAAG;AAC1D,UAAI,UAAU,SAAU;AAExB,eAAS,IAAI,QAAQ,IAAI,KAAK,IAAI,SAAS,KAAK,SAAS,OAAO,GAAG,KAAK;AACtE,iBAAS,IAAI,QAAQ,IAAI,KAAK,IAAI,SAAS,KAAK,SAAS,QAAQ,GAAG,KAAK;AACvE,uBAAa,CAAC,EAAE,CAAC,IAAI;AAAA,QACvB;AAAA,MACF;AACA,gBAAU,KAAK;AACf,UAAI,SAAS,QAAS,WAAU;AAAA,IAClC;AAAA,EACF;AAEA,MAAI,YAAY,EAAG,QAAO,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,GAAG,WAAW,MAAM;AAG1E,QAAM,OAAmB,MAAM;AAAA,IAAK,EAAE,QAAQ,QAAQ;AAAA,IAAG,MACvD,MAAM,KAAK,EAAE,QAAQ,QAAQ,GAAG,OAAO,EAAE,MAAM,IAAI,SAAS,GAAG,SAAS,EAAE,EAAE;AAAA,EAC9E;AACA,QAAM,WAAwB,MAAM,KAAK,EAAE,QAAQ,QAAQ,GAAG,MAAM,MAAM,OAAO,EAAE,KAAK,KAAK,CAAC;AAC9F,QAAM,aAAa,oBAAI,IAAY;AAEnC,WAAS,SAAS,GAAG,SAAS,SAAS,UAAU;AAC/C,QAAI,SAAS;AACb,QAAI,UAAU;AAEd,WAAO,SAAS,WAAW,UAAU,KAAK,MAAM,EAAE,QAAQ;AACxD,aAAO,SAAS,WAAW,SAAS,MAAM,EAAE,MAAM,EAAG;AACrD,UAAI,UAAU,QAAS;AAEvB,YAAM,OAAO,KAAK,MAAM,EAAE,OAAO;AACjC,iBAAW,IAAI,MAAM;AACrB,WAAK,MAAM,EAAE,MAAM,IAAI;AAAA,QACrB,MAAM,SAAS,sBAAsB,KAAK,OAAO,KAAK,KAAK,KAAK;AAAA,QAChE,SAAS,KAAK;AAAA,QACd,SAAS,KAAK;AAAA,MAChB;AAEA,eAAS,IAAI,QAAQ,IAAI,KAAK,IAAI,SAAS,KAAK,SAAS,OAAO,GAAG,KAAK;AACtE,iBAAS,IAAI,QAAQ,IAAI,KAAK,IAAI,SAAS,KAAK,SAAS,OAAO,GAAG,KAAK;AACtE,mBAAS,CAAC,EAAE,CAAC,IAAI;AAAA,QACnB;AAAA,MACF;AAEA,gBAAU,KAAK;AACf;AAAA,IACF;AAAA,EACF;AAEA,SAAO,cAAc,MAAM,SAAS,SAAS,YAAY,OAAO;AAClE;AAGA,SAAS,iBAAiB,MAAuB,SAAiB,SAAsC;AAEtG,MAAI,UAAU;AACd,aAAW,OAAO,MAAM;AACtB,eAAW,QAAQ,KAAK;AACtB,YAAM,OAAO,KAAK,WAAW,KAAK,KAAK;AACvC,UAAI,MAAM,QAAS,WAAU;AAAA,IAC/B;AAAA,EACF;AACA,MAAI,UAAU,SAAU,WAAU;AAClC,MAAI,YAAY,EAAG,QAAO,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,GAAG,WAAW,MAAM;AAE1E,QAAM,OAAmB,MAAM;AAAA,IAAK,EAAE,QAAQ,QAAQ;AAAA,IAAG,MACvD,MAAM,KAAK,EAAE,QAAQ,QAAQ,GAAG,OAAO,EAAE,MAAM,IAAI,SAAS,GAAG,SAAS,EAAE,EAAE;AAAA,EAC9E;AAEA,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,OAAO,MAAM;AACtB,eAAW,QAAQ,KAAK;AACtB,YAAM,IAAI,KAAK,WAAW;AAC1B,YAAM,IAAI,KAAK,WAAW;AAC1B,UAAI,KAAK,WAAW,KAAK,WAAW,IAAI,KAAK,IAAI,EAAG;AAEpD,iBAAW,IAAI,CAAC;AAChB,WAAK,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,SAAS,sBAAsB,KAAK,OAAO,KAAK,KAAK,KAAK,GAAG,SAAS,KAAK,SAAS,SAAS,KAAK,QAAQ;AAG/H,eAAS,KAAK,GAAG,KAAK,KAAK,SAAS,MAAM;AACxC,iBAAS,KAAK,GAAG,KAAK,KAAK,SAAS,MAAM;AACxC,cAAI,OAAO,KAAK,OAAO,EAAG;AAC1B,cAAI,IAAI,KAAK,WAAW,IAAI,KAAK,SAAS;AACxC,iBAAK,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,IAAI,SAAS,GAAG,SAAS,EAAE;AAAA,UAC5D;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,cAAc,MAAM,SAAS,SAAS,YAAY,OAAO;AAClE;AAGA,SAAS,cAAc,MAAkB,SAAiB,SAAiB,YAAyB,SAAsC;AACxI,MAAI,gBAAgB;AACpB,SAAO,gBAAgB,GAAG;AACxB,UAAM,WAAW,KAAK,MAAM,SAAO,CAAC,IAAI,gBAAgB,CAAC,GAAG,MAAM,KAAK,CAAC;AACxE,QAAI,CAAC,SAAU;AAEf,QAAI,SAAS,yBAAyB,WAAW,IAAI,gBAAgB,CAAC,EAAG;AACzE;AAAA,EACF;AACA,MAAI,gBAAgB,WAAW,gBAAgB,GAAG;AAChD,UAAM,UAAU,KAAK,IAAI,SAAO,IAAI,MAAM,GAAG,aAAa,CAAC;AAC3D,WAAO,EAAE,MAAM,SAAS,MAAM,eAAe,OAAO,SAAS,WAAW,UAAU,EAAE;AAAA,EACtF;AACA,SAAO,EAAE,MAAM,SAAS,MAAM,SAAS,OAAO,MAAM,WAAW,UAAU,EAAE;AAC7E;AAEO,SAAS,mBAAmB,MAA+B;AAChE,SAAO,KACJ;AAAA,IAAI,SACH,IACG,IAAI,OAAK,EAAE,KAAK,KAAK,EAAE,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,KAAK,CAAC,EAChE,OAAO,OAAO,EACd,KAAK,KAAK;AAAA,EACf,EACC,OAAO,OAAO,EACd,KAAK,IAAI;AACd;AAGA,SAAS,UAAU,MAAsB;AAOvC,QAAM,MAAM,OAAO,aAAa,CAAC;AACjC,QAAM,QAAkB,CAAC;AACzB,QAAM,SAAS,KAAK,QAAQ,8FAA8F,CAAC,MAAM;AAC/H,UAAM,KAAK,CAAC;AACZ,WAAO,OAAO,MAAM,SAAS,KAAK;AAAA,EACpC,CAAC;AACD,QAAM,UAAU,OAAO,QAAQ,aAAa,MAAM;AAClD,SAAO,QAAQ,QAAQ,IAAI,OAAO,MAAM,WAAW,KAAK,GAAG,GAAG,CAAC,GAAG,MAAM,MAAM,OAAO,CAAC,CAAC,CAAC;AAC1F;AAIA,IAAM,wBAAwB;AAG9B,SAAS,aAAa,MAAsB;AAE1C,MAAI,SAAS,WAAW,IAAI,EAEzB,QAAQ,2BAA2B,EAAE,EAErC,QAAQ,uBAAuB,EAAE,EACjC,QAAQ,QAAQ,GAAG,EACnB,KAAK;AAGR,MAAI,OAAO,UAAU,MAAM,OAAO,SAAS,GAAG,GAAG;AAC/C,UAAM,SAAS,OAAO,MAAM,GAAG;AAE/B,UAAM,wBAAwB,OAAO,OAAO,OAAK,EAAE,WAAW,KAAK,+BAA+B,KAAK,CAAC,CAAC,EAAE;AAC3G,QAAI,OAAO,UAAU,KAAK,wBAAwB,OAAO,UAAU,KAAK;AACtE,eAAS,OAAO,KAAK,EAAE;AAAA,IACzB;AAAA,EACF;AACA,SAAO;AACT;AAaO,SAAS,oBAAoB,QAA8B;AAChE,QAAM,SAAoB,CAAC;AAE3B,aAAW,SAAS,QAAQ;AAC1B,QAAI,MAAM,SAAS,WAAW,CAAC,MAAM,OAAO;AAC1C,aAAO,KAAK,KAAK;AACjB;AAAA,IACF;AAEA,UAAM,EAAE,MAAM,SAAS,MAAM,SAAS,MAAM,IAAI,MAAM;AAGtD,QAAI,YAAY,KAAK,YAAY,GAAG;AAClC,aAAO,KAAK,KAAK;AACjB;AAAA,IACF;AAGA,QAAI,WAAW,GAAG;AAChB,UAAI,gBAAgB;AACpB,UAAI,eAAe;AACnB,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,iBAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,gBAAM,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ;AACjC,4BAAkB,EAAE,MAAM,KAAK,KAAK,CAAC,GAAG;AACxC,0BAAgB,EAAE;AAAA,QACpB;AAAA,MACF;AAKA,UAAI,UAAU,MAAM,gBAAgB,KAAM,WAAW,KAAK,eAAe,MAAO;AAE9E,iBAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,mBAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,kBAAM,OAAO,MAAM,CAAC,IAAI,CAAC;AACzB,gBAAI,CAAC,KAAM;AAKX,gBAAI,KAAK,QAAQ,QAAQ;AACvB,qBAAO,KAAK,GAAG,oBAAoB,KAAK,MAAM,CAAC;AAC/C;AAAA,YACF;AACA,kBAAM,WAAW,KAAK,MAAM,KAAK;AACjC,gBAAI,CAAC,SAAU;AAEf,uBAAW,QAAQ,SAAS,MAAM,IAAI,GAAG;AACvC,oBAAM,UAAU,KAAK,KAAK;AAC1B,kBAAI,CAAC,QAAS;AACd,qBAAO,KAAK,EAAE,MAAM,aAAa,MAAM,SAAS,YAAY,MAAM,WAAW,CAAC;AAAA,YAChF;AAAA,UACF;AAAA,QACF;AACA;AAAA,MACF;AAAA,IACF;AAEA,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,SAAO;AACT;AAGA,IAAM,yBAAyB;AAE/B,IAAM,0BAA0B;AAGhC,SAAS,yBAAyB,OAAyB;AACzD,MAAI,MAAM,SAAS,eAAe,MAAM,SAAS,UAAW,QAAO;AACnE,QAAM,OAAO,MAAM,MAAM,KAAK;AAC9B,MAAI,CAAC,QAAQ,KAAK,SAAS,uBAAwB,QAAO;AAC1D,SAAO,WAAW,KAAK,IAAI;AAC7B;AAiBO,SAAS,qBAAqB,QAA8B;AAEjE,QAAM,OAAO,oBAAI,IAAoB;AACrC,aAAW,SAAS,QAAQ;AAC1B,QAAI,CAAC,yBAAyB,KAAK,EAAG;AACtC,UAAM,OAAO,MAAM,KAAM,KAAK;AAC9B,SAAK,IAAI,OAAO,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,EAC1C;AAGA,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,SAAoB,CAAC;AAC3B,aAAW,SAAS,QAAQ;AAC1B,QAAI,yBAAyB,KAAK,GAAG;AACnC,YAAM,OAAO,MAAM,KAAM,KAAK;AAC9B,WAAK,KAAK,IAAI,IAAI,KAAK,MAAM,yBAAyB;AACpD,YAAI,KAAK,IAAI,IAAI,EAAG;AACpB,aAAK,IAAI,IAAI;AAAA,MACf;AAAA,IACF;AACA,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,SAAO;AACT;AAMA,SAAS,gBAAgB,OAAyB;AAChD,MAAI,MAAM;AACV,aAAW,KAAK,OAAO;AACrB,QAAI,CAAC,EAAE,KAAM;AACb,QAAI,SAAS,EAAE,OAAO,MAAM,EAAE,QAAQ,EAAE,SAAS,QAAQ,EAAE,OAAO,OAAO,EAAE,SAAS,MAAM;AAC1F,QAAI,EAAE,UAAU,CAAC,EAAE,KAAM,UAAS,KAAK,MAAM;AAC7C,QAAI,CAAC,QAAQ;AACX,aAAO,UAAU,EAAE,IAAI;AACvB;AAAA,IACF;AACA,UAAM,IAAI,yBAAyB,KAAK,EAAE,IAAI;AAC9C,UAAM,OAAO,EAAE,CAAC;AAChB,QAAI,CAAC,MAAM;AACT,aAAO,EAAE;AACT;AAAA,IACF;AACA,UAAM,QAAQ,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE;AAC3C,WAAO,EAAE,CAAC,IAAI,UAAU,EAAE,OAAO,OAAO,UAAU,IAAI,KAAK,QAAQ,EAAE,CAAC;AAAA,EACxE;AACA,SAAO;AACT;AAEO,SAAS,iBAAiB,QAA2B;AAC1D,QAAM,QAAkB,CAAC;AAEzB,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,QAAQ,OAAO,CAAC;AAGtB,QAAI,MAAM,SAAS,aAAa,MAAM,MAAM;AAC1C,YAAM,SAAS,IAAI,OAAO,KAAK,IAAI,MAAM,SAAS,GAAG,CAAC,CAAC;AACvD,YAAM,cAAc,aAAa,MAAM,IAAI;AAC3C,UAAI,YAAa,OAAM,KAAK,IAAI,GAAG,MAAM,IAAI,UAAU,WAAW,CAAC,IAAI,EAAE;AACzE;AAAA,IACF;AAGA,QAAI,MAAM,SAAS,WAAW,MAAM,MAAM;AACxC,YAAM,KAAK,IAAI,YAAY,MAAM,IAAI,KAAK,EAAE;AAC5C;AAAA,IACF;AAGA,QAAI,MAAM,SAAS,aAAa;AAC9B,YAAM,KAAK,IAAI,OAAO,EAAE;AACxB;AAAA,IACF;AAGA,QAAI,MAAM,SAAS,UAAU,MAAM,MAAM;AACvC,YAAM,WAAW,aAAa,MAAM,IAAI;AACxC,UAAI,CAAC,SAAU;AAEf,YAAM,kBAAkB,MAAM,aAAa,aAAa,WAAW,KAAK,QAAQ;AAChF,YAAM,SAAS,kBAAkB,KAAK,MAAM,aAAa,YAAY,QAAQ;AAC7E,YAAM,KAAK,GAAG,MAAM,GAAG,UAAU,QAAQ,CAAC,EAAE;AAC5C,UAAI,MAAM,UAAU;AAClB,mBAAW,SAAS,MAAM,UAAU;AAClC,gBAAM,cAAc,MAAM,aAAa,YAAY,OAAO;AAC1D,gBAAM,KAAK,KAAK,WAAW,IAAI,UAAU,MAAM,QAAQ,EAAE,CAAC,EAAE;AAAA,QAC9D;AAAA,MACF;AACA;AAAA,IACF;AAEA,QAAI,MAAM,SAAS,eAAe,MAAM,MAAM;AAC5C,UAAI,OAAO,aAAa,MAAM,IAAI;AAClC,UAAI,CAAC,KAAM;AAGX,UAAI,cAAc,KAAK,IAAI,GAAG;AAC5B,cAAM,YAAY,OAAO,IAAI,CAAC;AAC9B,YAAI,WAAW,SAAS,eAAe,UAAU,QAAQ,SAAS,KAAK,UAAU,IAAI,GAAG;AACtF,gBAAM,KAAK,IAAI,MAAM,UAAU,IAAI,CAAC,IAAI,UAAU,UAAU,IAAI,CAAC,IAAI,EAAE;AACvE;AAAA,QACF,OAAO;AACL,gBAAM,KAAK,IAAI,MAAM,UAAU,IAAI,CAAC,IAAI,EAAE;AAAA,QAC5C;AACA;AAAA,MACF;AAEA,UAAI,sBAAsB,KAAK,IAAI,GAAG;AACpC,cAAM,KAAK,IAAI,UAAU,IAAI,CAAC,KAAK,EAAE;AACrC;AAAA,MACF;AAIA,YAAM,aAAa,MAAM,YAAY,KAAK,OAAO,MAAM,SAAS,IAAI;AAIpE,UAAI,MAAM,OAAO,QAAQ;AACvB,YAAI,WAAW,gBAAgB,MAAM,KAAK;AAC1C,YAAI,MAAM,MAAM;AACd,gBAAM,OAAO,aAAa,MAAM,IAAI;AACpC,cAAI,KAAM,YAAW,IAAI,QAAQ,KAAK,IAAI;AAAA,QAC5C;AACA,YAAI,MAAM,aAAc,aAAY,aAAQ,MAAM,YAAY;AAC9D,cAAM,KAAK,MAAM,QAAQ,OAAO,WAAW,aAAa,UAAU,EAAE;AACpE;AAAA,MACF;AAGA,UAAI,MAAM,MAAM;AACd,cAAM,OAAO,aAAa,MAAM,IAAI;AACpC,YAAI,KAAM,QAAO,IAAI,IAAI,KAAK,IAAI;AAAA,MACpC;AAGA,UAAI,MAAM,cAAc;AACtB,gBAAQ,aAAQ,MAAM,YAAY;AAAA,MACpC;AAEA,YAAM,KAAK,MAAM,QAAQ,OAAO,UAAU,IAAI,IAAI,aAAa,UAAU,IAAI,GAAG,EAAE;AAAA,IACpF,WAAW,MAAM,SAAS,WAAW,MAAM,OAAO;AAEhD,UAAI,MAAM,SAAS,KAAK,MAAM,MAAM,SAAS,CAAC,MAAM,IAAI;AACtD,cAAM,KAAK,EAAE;AAAA,MACf;AAEA,UAAI,MAAM,MAAM,SAAS;AACvB,cAAM,UAAU,aAAa,MAAM,MAAM,OAAO;AAChD,YAAI,QAAS,OAAM,KAAK,KAAK,UAAU,OAAO,CAAC,MAAM,EAAE;AAAA,MACzD;AACA,YAAM,UAAU,gBAAgB,MAAM,KAAK;AAC3C,UAAI,SAAS;AACX,cAAM,KAAK,OAAO;AAClB,cAAM,KAAK,EAAE;AAAA,MACf;AAAA,IACF;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,IAAI,EAAE,KAAK;AAC/B;AAGA,SAAS,eAAe,OAAyB;AAC/C,aAAW,OAAO,MAAM,OAAO;AAC7B,eAAW,QAAQ,KAAK;AACtB,UAAI,KAAK,UAAU,KAAK,KAAK,UAAU,EAAG,QAAO;AAAA,IACnD;AAAA,EACF;AACA,SAAO;AACT;AAGA,SAAS,gBAAgB,OAAyB;AAChD,aAAW,OAAO,MAAM,OAAO;AAC7B,eAAW,QAAQ,KAAK;AACtB,UAAI,KAAK,QAAQ,KAAK,OAAK,EAAE,SAAS,WAAW,EAAE,KAAK,EAAG,QAAO;AAAA,IACpE;AAAA,EACF;AACA,SAAO;AACT;AAGA,SAAS,cAAc,MAAsB;AAC3C,MAAI,KAAK,QAAQ,QAAQ;AACvB,WAAO,KAAK,OACT,IAAI,OAAK;AACR,UAAI,EAAE,SAAS,WAAW,EAAE,OAAO;AAEjC,cAAM,MAAM,EAAE,MAAM,UAAU,aAAa,EAAE,MAAM,OAAO,IAAI;AAC9D,gBAAQ,MAAM,MAAM,SAAS,MAAM,YAAY,EAAE,KAAK;AAAA,MACxD;AACA,UAAI,EAAE,SAAS,WAAW,EAAE,KAAM,QAAO,aAAa,EAAE,IAAI;AAC5D,YAAM,IAAI,aAAa,EAAE,QAAQ,EAAE;AACnC,aAAO,IAAI,EAAE,QAAQ,OAAO,MAAM,IAAI;AAAA,IACxC,CAAC,EACA,OAAO,OAAO,EACd,KAAK,MAAM;AAAA,EAChB;AACA,SAAO,aAAa,KAAK,IAAI,EAAE,QAAQ,OAAO,MAAM;AACtD;AAEA,SAAS,mBAAmB,MAAuB;AAGjD,SAAO,0CAA0C,KAAK,IAAI;AAC5D;AAEA,SAAS,wBAAwB,OAAyB;AACxD,aAAW,OAAO,MAAM,OAAO;AAC7B,eAAW,QAAQ,KAAK;AACtB,UAAI,mBAAmB,KAAK,IAAI,EAAG,QAAO;AAAA,IAC5C;AAAA,EACF;AACA,SAAO;AACT;AAGA,SAAS,YAAY,OAAwB;AAC3C,QAAM,EAAE,OAAO,MAAM,SAAS,MAAM,QAAQ,IAAI;AAChD,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,QAAkB,CAAC,SAAS;AAElC,WAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,UAAM,MAAM,MAAM,IAAI,OAAO;AAC7B,UAAM,UAAoB,CAAC;AAC3B,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,UAAI,KAAK,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,EAAG;AAC3B,YAAM,OAAO,MAAM,CAAC,IAAI,CAAC;AACzB,UAAI,CAAC,KAAM;AAGX,eAAS,KAAK,GAAG,KAAK,KAAK,SAAS,MAAM;AACxC,iBAAS,KAAK,GAAG,KAAK,KAAK,SAAS,MAAM;AACxC,cAAI,OAAO,KAAK,OAAO,EAAG;AAC1B,cAAI,IAAI,KAAK,WAAW,IAAI,KAAK,QAAS,MAAK,IAAI,GAAG,IAAI,EAAE,IAAI,IAAI,EAAE,EAAE;AAAA,QAC1E;AAAA,MACF;AAEA,YAAM,OAAO,cAAc,IAAI;AAC/B,YAAM,QAAkB,CAAC;AACzB,UAAI,KAAK,UAAU,EAAG,OAAM,KAAK,YAAY,KAAK,OAAO,GAAG;AAC5D,UAAI,KAAK,UAAU,EAAG,OAAM,KAAK,YAAY,KAAK,OAAO,GAAG;AAC5D,YAAM,UAAU,MAAM,SAAS,MAAM,MAAM,KAAK,GAAG,IAAI;AACvD,cAAQ,KAAK,IAAI,GAAG,GAAG,OAAO,IAAI,IAAI,KAAK,GAAG,GAAG;AAAA,IACnD;AACA,QAAI,QAAQ,OAAQ,OAAM,KAAK,OAAO,QAAQ,KAAK,EAAE,CAAC,OAAO;AAAA,EAC/D;AAEA,QAAM,KAAK,UAAU;AACrB,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,gBAAgB,OAAwB;AAC/C,MAAI,MAAM,SAAS,KAAK,MAAM,SAAS,EAAG,QAAO;AAEjD,QAAM,EAAE,OAAO,MAAM,SAAS,MAAM,QAAQ,IAAI;AAIhD,OAAK,eAAe,KAAK,KAAK,gBAAgB,KAAK,MAAM,CAAC,wBAAwB,KAAK,GAAG;AACxF,WAAO,YAAY,KAAK;AAAA,EAC1B;AAGA,MAAI,YAAY,KAAK,YAAY,GAAG;AAClC,UAAM,UAAU,aAAa,MAAM,CAAC,EAAE,CAAC,EAAE,IAAI;AAC7C,QAAI,CAAC,QAAS,QAAO;AACrB,WAAO,QACJ,MAAM,IAAI,EACV,IAAI,UAAQ;AACX,YAAM,UAAU,KAAK,KAAK;AAC1B,UAAI,CAAC,QAAS,QAAO;AACrB,UAAI,WAAW,KAAK,OAAO,EAAG,QAAO,KAAK,UAAU,OAAO,CAAC;AAC5D,UAAI,aAAa,KAAK,OAAO,EAAG,QAAO,KAAK,UAAU,OAAO,CAAC;AAC9D,aAAO,UAAU,OAAO;AAAA,IAC1B,CAAC,EACA,OAAO,OAAO,EACd,KAAK,IAAI;AAAA,EACd;AAGA,MAAI,YAAY,KAAK,WAAW,GAAG;AACjC,WAAO,MACJ,IAAI,SAAO,UAAU,aAAa,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,QAAQ,OAAO,GAAG,CAAC,EACnE,OAAO,OAAO,EACd,KAAK,IAAI;AAAA,EACd;AAGA,QAAM,UAAsB,MAAM,KAAK,EAAE,QAAQ,QAAQ,GAAG,MAAM,MAAM,OAAO,EAAE,KAAK,EAAE,CAAC;AACzF,QAAM,OAAO,oBAAI,IAAY;AAE7B,WAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,UAAI,KAAK,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,EAAG;AAC3B,YAAM,OAAO,MAAM,CAAC,IAAI,CAAC;AACzB,UAAI,CAAC,KAAM;AAEX,cAAQ,CAAC,EAAE,CAAC,KAAK,KAAK,QAAQ,KAAK,OAAK,EAAE,KAAK,IAC3C,KAAK,OACJ,IAAI,OAAK,EAAE,SAAS,WAAW,EAAE,OAC9B,YAAY,EAAE,IAAI,MAClB,EAAE,QAAQ,gBAAgB,EAAE,KAAK,IAAI,UAAU,aAAa,EAAE,QAAQ,EAAE,CAAC,CAAC,EAC7E,OAAO,OAAO,EACd,KAAK,MAAM,IACZ,UAAU,aAAa,KAAK,IAAI,CAAC,EAAE,QAAQ,OAAO,MAAM,GAC1D,QAAQ,OAAO,KAAK;AAGtB,eAAS,KAAK,GAAG,KAAK,KAAK,SAAS,MAAM;AACxC,iBAAS,KAAK,GAAG,KAAK,KAAK,SAAS,MAAM;AACxC,cAAI,OAAO,KAAK,OAAO,EAAG;AAC1B,cAAI,IAAI,KAAK,WAAW,IAAI,KAAK,SAAS;AACxC,iBAAK,IAAI,GAAG,IAAI,EAAE,IAAI,IAAI,EAAE,EAAE;AAAA,UAChC;AAAA,QACF;AAAA,MACF;AAEA,WAAK,KAAK,UAAU;AAAA,IACtB;AAAA,EACF;AAMA,QAAM,aAAyB,CAAC;AAChC,MAAI,kBAAmC;AACvC,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,UAAM,MAAM,QAAQ,CAAC;AACrB,QAAI,IAAI,MAAM,UAAQ,SAAS,EAAE,GAAG;AAGlC,UAAI,IAAI,KAAK,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAG;AAC/C,UAAI,iBAAiB;AAAE,mBAAW,KAAK,eAAe;AAAG,0BAAkB;AAAA,MAAK;AAChF,iBAAW,KAAK,GAAG;AACnB;AAAA,IACF;AAIA,UAAM,eAAe,IAAI,OAAO,UAAQ,SAAS,EAAE;AACnD,UAAM,eAAe,IAAI,KAAK,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAC7D,QAAI,CAAC,gBAAgB,aAAa,WAAW,KAAK,IAAI,CAAC,MAAM,MAAM,IAAI,MAAM,CAAC,EAAE,MAAM,OAAK,MAAM,EAAE,GAAG;AACpG,UAAI,gBAAiB,YAAW,KAAK,eAAe;AACpD,wBAAkB;AAClB;AAAA,IACF;AAGA,QAAI,iBAAiB;AACnB,UAAI,IAAI,CAAC,MAAM,GAAI,KAAI,CAAC,IAAI,gBAAgB,CAAC;AAAA,UACxC,YAAW,KAAK,eAAe;AACpC,wBAAkB;AAAA,IACpB;AACA,eAAW,KAAK,GAAG;AAAA,EACrB;AACA,MAAI,gBAAiB,YAAW,KAAK,eAAe;AAEpD,MAAI,WAAW,WAAW,EAAG,QAAO;AAEpC,QAAM,KAAe,CAAC;AACtB,KAAG,KAAK,OAAO,WAAW,CAAC,EAAE,KAAK,KAAK,IAAI,IAAI;AAC/C,KAAG,KAAK,OAAO,WAAW,CAAC,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAAK,IAAI,IAAI;AAChE,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,OAAG,KAAK,OAAO,WAAW,CAAC,EAAE,KAAK,KAAK,IAAI,IAAI;AAAA,EACjD;AACA,SAAO,GAAG,KAAK,IAAI;AACrB;;;ACjqBA,SAAS,mBAAmB;AAI5B,IAAM,aAAa,MAAM;AACvB,QAAM,QAAQ,IAAI,YAAY,GAAG;AACjC,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,QAAI,IAAI;AACR,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAK,IAAI,IAAM,aAAc,MAAM,IAAO,MAAM;AAAA,IAClD;AACA,UAAM,CAAC,IAAI,MAAM;AAAA,EACnB;AACA,SAAO;AACT,GAAG;AAGH,SAAS,MAAM,OAA2B;AACxC,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,QAAI,WAAW,IAAI,MAAM,CAAC,KAAK,GAAI,IAAK,MAAM;AAAA,EAChD;AACA,UAAQ,IAAI,gBAAgB;AAC9B;AAIA,IAAM,SAAS;AAEf,IAAM,UAAU;AAOhB,IAAM,aAAa;AAUZ,SAAS,SAAS,KAAoC;AAE3D,MAAI,IAAI,SAAS,GAAI,QAAO;AAC5B,MAAI,IAAI,CAAC,MAAM,MAAQ,IAAI,CAAC,MAAM,GAAM,QAAO;AAE/C,QAAM,KAAK,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;AAClE,QAAM,aAAa,GAAG,UAAU,IAAI,IAAI;AACxC,QAAM,aAAa,GAAG,UAAU,IAAI,IAAI;AACxC,MAAI,aAAa,GAAI,QAAO;AAE5B,QAAM,QAAQ,GAAG,SAAS,IAAI,IAAI;AAClC,QAAM,YAAY,GAAG,SAAS,IAAI,IAAI;AACtC,QAAM,WAAW,GAAG,UAAU,IAAI,IAAI;AACtC,QAAM,cAAc,GAAG,UAAU,IAAI,IAAI;AAEzC,MAAI,gBAAgB,OAAQ,QAAO;AACnC,MAAI,aAAa,MAAM,aAAa,GAAI,QAAO;AAC/C,MAAI,SAAS,KAAK,cAAc,EAAG,QAAO;AAC1C,MAAI,QAAQ,WAAW,KAAK,IAAI,SAAS,IAAI,QAAS,QAAO;AAE7D,QAAM,UAAU,YAAY;AAC5B,QAAM,SAAS,KAAK,IAAI,SAAS;AAEjC,MAAI,QAAQ,SAAS,WAAY,QAAO;AACxC,QAAM,gBAAgB,YAAY;AAElC,QAAM,YAAa,QAAQ,gBAAgB,IAAK,CAAC;AACjD,MAAI,aAAa,YAAY,SAAS,IAAI,OAAQ,QAAO;AAEzD,QAAM,OAAO,IAAI,WAAW,QAAQ,SAAS,CAAC;AAC9C,MAAI,WAAW;AAEf,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAE/B,UAAM,SAAS,UAAU,IAAI,SAAS,IAAI;AAC1C,QAAI,MAAM,aAAa,SAAS;AAChC,QAAI,MAAM,IAAI,QAAQ;AACtB,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAE9B,WAAK,GAAG,IAAI,IAAI,MAAM,CAAC;AACvB,WAAK,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC;AAC3B,WAAK,MAAM,CAAC,IAAI,IAAI,GAAG;AACvB,YAAM,IAAI,aAAa,KAAK,IAAI,MAAM,CAAC,IAAI;AAC3C,WAAK,MAAM,CAAC,IAAI;AAChB,kBAAY;AACZ,aAAO;AACP,aAAO;AAAA,IACT;AAAA,EACF;AAIA,MAAI,aAAa,MAAM,aAAa,GAAG;AACrC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,EAAG,MAAK,CAAC,IAAI;AAAA,EACrD;AAEA,SAAO,UAAU,OAAO,QAAQ,IAAI;AACtC;AAIA,IAAM,gBAAgB,WAAW,GAAG,KAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,EAAI;AAGlF,SAAS,MAAM,MAAc,MAA8B;AACzD,QAAM,OAAO,IAAI,WAAW,IAAI,KAAK,MAAM;AAC3C,OAAK,CAAC,IAAI,KAAK,WAAW,CAAC;AAC3B,OAAK,CAAC,IAAI,KAAK,WAAW,CAAC;AAC3B,OAAK,CAAC,IAAI,KAAK,WAAW,CAAC;AAC3B,OAAK,CAAC,IAAI,KAAK,WAAW,CAAC;AAC3B,OAAK,IAAI,MAAM,CAAC;AAEhB,QAAM,MAAM,IAAI,WAAW,IAAI,KAAK,SAAS,CAAC;AAC9C,QAAM,KAAK,IAAI,SAAS,IAAI,MAAM;AAClC,KAAG,UAAU,GAAG,KAAK,QAAQ,KAAK;AAClC,MAAI,IAAI,MAAM,CAAC;AACf,KAAG,UAAU,IAAI,KAAK,QAAQ,MAAM,IAAI,GAAG,KAAK;AAChD,SAAO;AACT;AAGO,SAAS,UAAU,OAAe,QAAgB,MAA8B;AAErF,QAAM,OAAO,IAAI,WAAW,EAAE;AAC9B,QAAM,KAAK,IAAI,SAAS,KAAK,MAAM;AACnC,KAAG,UAAU,GAAG,OAAO,KAAK;AAC5B,KAAG,UAAU,GAAG,QAAQ,KAAK;AAC7B,OAAK,CAAC,IAAI;AACV,OAAK,CAAC,IAAI;AAGV,QAAM,SAAS,QAAQ;AACvB,QAAM,MAAM,IAAI,YAAY,SAAS,KAAK,MAAM;AAChD,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAM,WAAW,KAAK,SAAS;AAC/B,QAAI,QAAQ,IAAI;AAChB,QAAI,IAAI,KAAK,SAAS,IAAI,QAAQ,IAAI,SAAS,MAAM,GAAG,WAAW,CAAC;AAAA,EACtE;AACA,QAAM,OAAO,YAAY,GAAG;AAE5B,QAAM,YAAY,MAAM,QAAQ,IAAI;AACpC,QAAM,YAAY,MAAM,QAAQ,IAAI;AACpC,QAAM,YAAY,MAAM,QAAQ,IAAI,WAAW,CAAC,CAAC;AAEjD,QAAM,MAAM,IAAI,WAAW,cAAc,SAAS,UAAU,SAAS,UAAU,SAAS,UAAU,MAAM;AACxG,MAAI,IAAI;AACR,MAAI,IAAI,eAAe,CAAC;AAAG,OAAK,cAAc;AAC9C,MAAI,IAAI,WAAW,CAAC;AAAG,OAAK,UAAU;AACtC,MAAI,IAAI,WAAW,CAAC;AAAG,OAAK,UAAU;AACtC,MAAI,IAAI,WAAW,CAAC;AACpB,SAAO;AACT;AAqBO,SAAS,yBACd,UACA,QACA,MACQ;AACR,QAAM,WAAW,MAAM,aAAa;AAGpC,QAAM,OAAO,oBAAI,IAAoB;AACrC,aAAW,OAAO,QAAQ;AACxB,QAAI,QAAQ,IAAI;AAChB,QAAI,OAAO,IAAI;AACf,QAAI,YAAY,SAAS,aAAa;AACpC,YAAM,MAAM,SAAS,IAAI,IAAI;AAC7B,UAAI,KAAK;AACP,gBAAQ;AACR,eAAO;AAAA,MACT;AAAA,IACF;AACA,SAAK,IAAI,IAAI,UAAU,QAAQ,IAAI,WAAW,OAAO,KAAK,KAAK,EAAE,SAAS,QAAQ,CAAC,EAAE;AAAA,EACvF;AACA,MAAI,KAAK,SAAS,EAAG,QAAO;AAE5B,MAAI,MAAM,SAAS,QAAQ,0CAA0C,CAAC,GAAG,SAAiB;AACxF,UAAM,MAAM,KAAK,IAAI,IAAI;AACzB,WAAO,QAAQ,SAAY,YAAY,GAAG,MAAM;AAAA,EAClD,CAAC;AACD,QAAM,IAAI,QAAQ,gDAAgD,CAAC,GAAG,KAAa,MAAc,SAAiB;AAChH,UAAM,MAAM,KAAK,IAAI,IAAI;AACzB,WAAO,QAAQ,SAAY,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,KAAK;AAAA,EACrD,CAAC;AACD,SAAO;AACT;","names":[]}

package/dist/chunk-UAFSPWU7.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/pdf/formula/models.ts"],"sourcesContent":["/**\n * 수식 OCR 모델 자동 다운로드 + SHA-256 검증\n *\n * 캐시 위치: `~/.cache/kordoc/models/pix2text/`\n * 총 ~155MB (MFD 44MB + MFR encoder 87MB + MFR decoder 30MB + tokenizer 40KB)\n *\n * HF URL + SHA 는 Docufinder archive/rust-formula-ocr-wip 에서 검증 완료됨.\n * 모델 버전 갱신 시 URL + SHA 를 함께 갱신해야 한다.\n */\n\nimport { createHash } from \"crypto\"\nimport { createReadStream } from \"fs\"\nimport { mkdir, stat, unlink, rename } from \"fs/promises\"\nimport { createWriteStream } from \"fs\"\nimport { homedir } from \"os\"\nimport { join, dirname } from \"path\"\nimport { pipeline } from \"stream/promises\"\nimport { Readable } from \"stream\"\n\nexport interface ModelSpec {\n  name: string\n  filename: string\n  url: string\n  sha256: string\n  sizeMb: number\n}\n\n/** 모델 스펙 (SHA-256 은 실제 다운로드로 검증됨 — 변경 금지) */\nexport const MFD_MODEL: ModelSpec = {\n  name: \"Pix2Text MFD\",\n  filename: \"mfd.onnx\",\n  url: \"https://huggingface.co/breezedeus/pix2text-mfd/resolve/main/mfd-v20240618.onnx\",\n  sha256: \"51a8854743b17ae654729af8db82a630c1ccfa06debf4856c8b28055f87d02c1\",\n  sizeMb: 42,\n}\n\nexport const MFR_ENCODER_MODEL: ModelSpec = {\n  name: \"Pix2Text MFR encoder\",\n  filename: \"encoder_model.onnx\",\n  url: \"https://huggingface.co/breezedeus/pix2text-mfr/resolve/main/encoder_model.onnx\",\n  sha256: \"bd8d5c322792e9ec45793af5569e9748f82a3d728a9e00213dbfc56c1486f37d\",\n  sizeMb: 87,\n}\n\nexport const MFR_DECODER_MODEL: ModelSpec = {\n  name: \"Pix2Text MFR decoder\",\n  filename: \"decoder_model.onnx\",\n  url: \"https://huggingface.co/breezedeus/pix2text-mfr/resolve/main/decoder_model.onnx\",\n  sha256: \"fd0f92d7a012f3dae41e1ac79421aea0ea888b5a66cb3f9a004e424f82f3daed\",\n  sizeMb: 30,\n}\n\nexport const MFR_TOKENIZER: ModelSpec = {\n  name: \"Pix2Text MFR tokenizer\",\n  filename: \"tokenizer.json\",\n  url: \"https://huggingface.co/breezedeus/pix2text-mfr/resolve/main/tokenizer.json\",\n  sha256: \"3e2ab757277d22639bec28c9d7972e352d3d1dba223051fa674002dc5ab64df3\",\n  sizeMb: 1,\n}\n\nexport const ALL_FORMULA_MODELS: ReadonlyArray<ModelSpec> = [\n  MFD_MODEL,\n  MFR_ENCODER_MODEL,\n  MFR_DECODER_MODEL,\n  MFR_TOKENIZER,\n]\n\n/**\n * 모델 캐시 하위 디렉토리 경로. 환경 변수 `KORDOC_MODEL_CACHE` 가 설정되면\n * 해당 경로를 우선 사용, 없으면 `~/.cache/kordoc/models/<subdir>/`.\n * (수식 OCR 외 텍스트 OCR 등 다른 모델군도 공용 — subdir 로 격리)\n */\nexport function getModelsDir(subdir: string): string {\n  const override = process.env.KORDOC_MODEL_CACHE\n  if (override && override.trim()) {\n    return join(override, subdir)\n  }\n  return join(homedir(), \".cache\", \"kordoc\", \"models\", subdir)\n}\n\nexport function getFormulaModelsDir(): string {\n  return getModelsDir(\"pix2text\")\n}\n\nexport interface ModelStatus {\n  spec: ModelSpec\n  localPath: string\n  exists: boolean\n  /** SHA 검증까지 끝났는가 (exists && valid) */\n  verified: boolean\n  /** 검증 실패 시 이유 */\n  invalidReason?: string\n}\n\n/** 지정 모델군의 존재/유효성 상태 반환 (다운로드 없이 확인만) */\nexport async function getModelStatusIn(dir: string, specs: ReadonlyArray<ModelSpec>): Promise<ModelStatus[]> {\n  const result: ModelStatus[] = []\n  for (const spec of specs) {\n    const localPath = join(dir, spec.filename)\n    let exists = false\n    try {\n      const s = await stat(localPath)\n      exists = s.isFile() && s.size > 0\n    } catch {\n      exists = false\n    }\n    if (!exists) {\n      result.push({ spec, localPath, exists: false, verified: false })\n      continue\n    }\n    try {\n      const actual = await sha256OfFile(localPath)\n      if (actual === spec.sha256) {\n        result.push({ spec, localPath, exists: true, verified: true })\n      } else {\n        result.push({\n          spec,\n          localPath,\n          exists: true,\n          verified: false,\n          invalidReason: `SHA256 mismatch: expected ${spec.sha256}, got ${actual}`,\n        })\n      }\n    } catch (e) {\n      result.push({\n        spec,\n        localPath,\n        exists: true,\n        verified: false,\n        invalidReason: `SHA compute failed: ${(e as Error).message}`,\n      })\n    }\n  }\n  return result\n}\n\n/** 모든 수식 모델의 존재/유효성 상태 반환 (다운로드 없이 확인만) */\nexport async function getFormulaModelStatus(): Promise<ModelStatus[]> {\n  return getModelStatusIn(getFormulaModelsDir(), ALL_FORMULA_MODELS)\n}\n\nexport interface DownloadProgress {\n  spec: ModelSpec\n  /** 현재까지 다운로드한 바이트 */\n  downloaded: number\n  /** 전체 바이트 (알 수 있으면) */\n  total: number | null\n  /** \"download\" | \"verify\" | \"done\" | \"skip\" */\n  phase: \"download\" | \"verify\" | \"done\" | \"skip\" | \"error\"\n  message?: string\n}\n\nexport type ProgressHandler = (p: DownloadProgress) => void\n\n/**\n * 지정 모델군을 다운로드/검증한다.\n * - 이미 있고 SHA 일치 → skip\n * - 없음 → 다운로드 후 SHA 검증. 실패 시 파일 삭제.\n */\nexport async function ensureModelsIn(dir: string, specs: ReadonlyArray<ModelSpec>, onProgress?: ProgressHandler): Promise<void> {\n  await mkdir(dir, { recursive: true })\n\n  for (const spec of specs) {\n    const localPath = join(dir, spec.filename)\n\n    if (await isExistingValid(localPath, spec.sha256)) {\n      onProgress?.({\n        spec,\n        downloaded: 0,\n        total: null,\n        phase: \"skip\",\n        message: \"이미 존재 + SHA 일치\",\n      })\n      continue\n    }\n\n    // 기존 파일 있지만 SHA 불일치 → 삭제\n    try {\n      await unlink(localPath)\n    } catch {\n      // 없을 수 있음\n    }\n\n    await downloadToFile(spec, localPath, onProgress)\n  }\n}\n\n/** 필요한 모든 수식 모델을 다운로드/검증한다. */\nexport async function ensureFormulaModels(onProgress?: ProgressHandler): Promise<void> {\n  return ensureModelsIn(getFormulaModelsDir(), ALL_FORMULA_MODELS, onProgress)\n}\n\n/** 단일 모델만 확인/다운로드 (진단 UI 에서 개별 상태 새로고침용) */\nexport async function ensureSingleModel(spec: ModelSpec, onProgress?: ProgressHandler): Promise<void> {\n  const dir = getFormulaModelsDir()\n  await mkdir(dir, { recursive: true })\n  const localPath = join(dir, spec.filename)\n  if (await isExistingValid(localPath, spec.sha256)) {\n    onProgress?.({ spec, downloaded: 0, total: null, phase: \"skip\" })\n    return\n  }\n  try {\n    await unlink(localPath)\n  } catch {\n    // 재다운로드 전 손상/잔존 파일 정리 best-effort — 애초에 없으면 실패해도 무방\n  }\n  await downloadToFile(spec, localPath, onProgress)\n}\n\nasync function isExistingValid(localPath: string, sha256Expected: string): Promise<boolean> {\n  try {\n    const s = await stat(localPath)\n    if (!s.isFile() || s.size === 0) return false\n  } catch {\n    return false\n  }\n  try {\n    const actual = await sha256OfFile(localPath)\n    return actual === sha256Expected\n  } catch {\n    return false\n  }\n}\n\nasync function downloadToFile(\n  spec: ModelSpec,\n  localPath: string,\n  onProgress?: ProgressHandler,\n): Promise<void> {\n  // 먼저 .part 로 받고 검증 후 rename — 중단된 다운로드가 \"정상 파일\"로 오인되는 걸 방지\n  const partPath = `${localPath}.part`\n  await mkdir(dirname(localPath), { recursive: true })\n\n  const resp = await fetch(spec.url, {\n    headers: {\n      // HF CDN 은 UA 없으면 가끔 403 을 뱉는다\n      \"User-Agent\": \"kordoc-formula-ocr/1.0 (+https://github.com/chrisryugj/kordoc)\",\n    },\n  })\n  if (!resp.ok || !resp.body) {\n    throw new Error(\n      `${spec.name} 다운로드 실패: HTTP ${resp.status} ${resp.statusText} (${spec.url})`,\n    )\n  }\n\n  const lenHeader = resp.headers.get(\"content-length\")\n  const total = lenHeader ? Number.parseInt(lenHeader, 10) : null\n  let downloaded = 0\n\n  const ws = createWriteStream(partPath)\n  try {\n    const reader = Readable.fromWeb(resp.body as unknown as import(\"stream/web\").ReadableStream)\n    reader.on(\"data\", (chunk: Buffer | Uint8Array) => {\n      downloaded += chunk.length\n      onProgress?.({\n        spec,\n        downloaded,\n        total,\n        phase: \"download\",\n      })\n    })\n    await pipeline(reader, ws)\n  } catch (e) {\n    try {\n      await unlink(partPath)\n    } catch {\n      // .part 임시파일 정리 best-effort — 본 에러(스트리밍 실패)를 가리지 않도록 무시\n    }\n    throw new Error(`${spec.name} 스트리밍 실패: ${(e as Error).message}`)\n  }\n\n  onProgress?.({\n    spec,\n    downloaded,\n    total,\n    phase: \"verify\",\n  })\n\n  // SHA 검증\n  let actual: string\n  try {\n    actual = await sha256OfFile(partPath)\n  } catch (e) {\n    try {\n      await unlink(partPath)\n    } catch {\n      // .part 임시파일 정리 best-effort — 본 에러(SHA 계산 실패)를 가리지 않도록 무시\n    }\n    throw new Error(`${spec.name} SHA 계산 실패: ${(e as Error).message}`)\n  }\n\n  if (actual !== spec.sha256) {\n    try {\n      await unlink(partPath)\n    } catch {\n      // 오염된 .part 정리 best-effort — 본 에러(SHA mismatch)를 가리지 않도록 무시\n    }\n    throw new Error(\n      `${spec.name} SHA256 mismatch: expected ${spec.sha256}, got ${actual} — 모델 URL 이 오염되었거나 전송 중 손상되었습니다.`,\n    )\n  }\n\n  await rename(partPath, localPath)\n  onProgress?.({\n    spec,\n    downloaded,\n    total,\n    phase: \"done\",\n  })\n}\n\nasync function sha256OfFile(p: string): Promise<string> {\n  const h = createHash(\"sha256\")\n  const stream = createReadStream(p)\n  await pipeline(stream, async function* (src) {\n    for await (const chunk of src) {\n      h.update(chunk)\n      // yield 안 함 (소비만)\n    }\n  })\n  return h.digest(\"hex\")\n}\n"],"mappings":";;;AAUA,SAAS,kBAAkB;AAC3B,SAAS,wBAAwB;AACjC,SAAS,OAAO,MAAM,QAAQ,cAAc;AAC5C,SAAS,yBAAyB;AAClC,SAAS,eAAe;AACxB,SAAS,MAAM,eAAe;AAC9B,SAAS,gBAAgB;AACzB,SAAS,gBAAgB;AAWlB,IAAM,YAAuB;AAAA,EAClC,MAAM;AAAA,EACN,UAAU;AAAA,EACV,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,QAAQ;AACV;AAEO,IAAM,oBAA+B;AAAA,EAC1C,MAAM;AAAA,EACN,UAAU;AAAA,EACV,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,QAAQ;AACV;AAEO,IAAM,oBAA+B;AAAA,EAC1C,MAAM;AAAA,EACN,UAAU;AAAA,EACV,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,QAAQ;AACV;AAEO,IAAM,gBAA2B;AAAA,EACtC,MAAM;AAAA,EACN,UAAU;AAAA,EACV,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,QAAQ;AACV;AAEO,IAAM,qBAA+C;AAAA,EAC1D;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAOO,SAAS,aAAa,QAAwB;AACnD,QAAM,WAAW,QAAQ,IAAI;AAC7B,MAAI,YAAY,SAAS,KAAK,GAAG;AAC/B,WAAO,KAAK,UAAU,MAAM;AAAA,EAC9B;AACA,SAAO,KAAK,QAAQ,GAAG,UAAU,UAAU,UAAU,MAAM;AAC7D;AAEO,SAAS,sBAA8B;AAC5C,SAAO,aAAa,UAAU;AAChC;AAaA,eAAsB,iBAAiB,KAAa,OAAyD;AAC3G,QAAM,SAAwB,CAAC;AAC/B,aAAW,QAAQ,OAAO;AACxB,UAAM,YAAY,KAAK,KAAK,KAAK,QAAQ;AACzC,QAAI,SAAS;AACb,QAAI;AACF,YAAM,IAAI,MAAM,KAAK,SAAS;AAC9B,eAAS,EAAE,OAAO,KAAK,EAAE,OAAO;AAAA,IAClC,QAAQ;AACN,eAAS;AAAA,IACX;AACA,QAAI,CAAC,QAAQ;AACX,aAAO,KAAK,EAAE,MAAM,WAAW,QAAQ,OAAO,UAAU,MAAM,CAAC;AAC/D;AAAA,IACF;AACA,QAAI;AACF,YAAM,SAAS,MAAM,aAAa,SAAS;AAC3C,UAAI,WAAW,KAAK,QAAQ;AAC1B,eAAO,KAAK,EAAE,MAAM,WAAW,QAAQ,MAAM,UAAU,KAAK,CAAC;AAAA,MAC/D,OAAO;AACL,eAAO,KAAK;AAAA,UACV;AAAA,UACA;AAAA,UACA,QAAQ;AAAA,UACR,UAAU;AAAA,UACV,eAAe,6BAA6B,KAAK,MAAM,SAAS,MAAM;AAAA,QACxE,CAAC;AAAA,MACH;AAAA,IACF,SAAS,GAAG;AACV,aAAO,KAAK;AAAA,QACV;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,eAAe,uBAAwB,EAAY,OAAO;AAAA,MAC5D,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAGA,eAAsB,wBAAgD;AACpE,SAAO,iBAAiB,oBAAoB,GAAG,kBAAkB;AACnE;AAoBA,eAAsB,eAAe,KAAa,OAAiC,YAA6C;AAC9H,QAAM,MAAM,KAAK,EAAE,WAAW,KAAK,CAAC;AAEpC,aAAW,QAAQ,OAAO;AACxB,UAAM,YAAY,KAAK,KAAK,KAAK,QAAQ;AAEzC,QAAI,MAAM,gBAAgB,WAAW,KAAK,MAAM,GAAG;AACjD,mBAAa;AAAA,QACX;AAAA,QACA,YAAY;AAAA,QACZ,OAAO;AAAA,QACP,OAAO;AAAA,QACP,SAAS;AAAA,MACX,CAAC;AACD;AAAA,IACF;AAGA,QAAI;AACF,YAAM,OAAO,SAAS;AAAA,IACxB,QAAQ;AAAA,IAER;AAEA,UAAM,eAAe,MAAM,WAAW,UAAU;AAAA,EAClD;AACF;AAGA,eAAsB,oBAAoB,YAA6C;AACrF,SAAO,eAAe,oBAAoB,GAAG,oBAAoB,UAAU;AAC7E;AAGA,eAAsB,kBAAkB,MAAiB,YAA6C;AACpG,QAAM,MAAM,oBAAoB;AAChC,QAAM,MAAM,KAAK,EAAE,WAAW,KAAK,CAAC;AACpC,QAAM,YAAY,KAAK,KAAK,KAAK,QAAQ;AACzC,MAAI,MAAM,gBAAgB,WAAW,KAAK,MAAM,GAAG;AACjD,iBAAa,EAAE,MAAM,YAAY,GAAG,OAAO,MAAM,OAAO,OAAO,CAAC;AAChE;AAAA,EACF;AACA,MAAI;AACF,UAAM,OAAO,SAAS;AAAA,EACxB,QAAQ;AAAA,EAER;AACA,QAAM,eAAe,MAAM,WAAW,UAAU;AAClD;AAEA,eAAe,gBAAgB,WAAmB,gBAA0C;AAC1F,MAAI;AACF,UAAM,IAAI,MAAM,KAAK,SAAS;AAC9B,QAAI,CAAC,EAAE,OAAO,KAAK,EAAE,SAAS,EAAG,QAAO;AAAA,EAC1C,QAAQ;AACN,WAAO;AAAA,EACT;AACA,MAAI;AACF,UAAM,SAAS,MAAM,aAAa,SAAS;AAC3C,WAAO,WAAW;AAAA,EACpB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,eACb,MACA,WACA,YACe;AAEf,QAAM,WAAW,GAAG,SAAS;AAC7B,QAAM,MAAM,QAAQ,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AAEnD,QAAM,OAAO,MAAM,MAAM,KAAK,KAAK;AAAA,IACjC,SAAS;AAAA;AAAA,MAEP,cAAc;AAAA,IAChB;AAAA,EACF,CAAC;AACD,MAAI,CAAC,KAAK,MAAM,CAAC,KAAK,MAAM;AAC1B,UAAM,IAAI;AAAA,MACR,GAAG,KAAK,IAAI,gDAAkB,KAAK,MAAM,IAAI,KAAK,UAAU,KAAK,KAAK,GAAG;AAAA,IAC3E;AAAA,EACF;AAEA,QAAM,YAAY,KAAK,QAAQ,IAAI,gBAAgB;AACnD,QAAM,QAAQ,YAAY,OAAO,SAAS,WAAW,EAAE,IAAI;AAC3D,MAAI,aAAa;AAEjB,QAAM,KAAK,kBAAkB,QAAQ;AACrC,MAAI;AACF,UAAM,SAAS,SAAS,QAAQ,KAAK,IAAsD;AAC3F,WAAO,GAAG,QAAQ,CAAC,UAA+B;AAChD,oBAAc,MAAM;AACpB,mBAAa;AAAA,QACX;AAAA,QACA;AAAA,QACA;AAAA,QACA,OAAO;AAAA,MACT,CAAC;AAAA,IACH,CAAC;AACD,UAAM,SAAS,QAAQ,EAAE;AAAA,EAC3B,SAAS,GAAG;AACV,QAAI;AACF,YAAM,OAAO,QAAQ;AAAA,IACvB,QAAQ;AAAA,IAER;AACA,UAAM,IAAI,MAAM,GAAG,KAAK,IAAI,2CAAc,EAAY,OAAO,EAAE;AAAA,EACjE;AAEA,eAAa;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO;AAAA,EACT,CAAC;AAGD,MAAI;AACJ,MAAI;AACF,aAAS,MAAM,aAAa,QAAQ;AAAA,EACtC,SAAS,GAAG;AACV,QAAI;AACF,YAAM,OAAO,QAAQ;AAAA,IACvB,QAAQ;AAAA,IAER;AACA,UAAM,IAAI,MAAM,GAAG,KAAK,IAAI,mCAAgB,EAAY,OAAO,EAAE;AAAA,EACnE;AAEA,MAAI,WAAW,KAAK,QAAQ;AAC1B,QAAI;AACF,YAAM,OAAO,QAAQ;AAAA,IACvB,QAAQ;AAAA,IAER;AACA,UAAM,IAAI;AAAA,MACR,GAAG,KAAK,IAAI,8BAA8B,KAAK,MAAM,SAAS,MAAM;AAAA,IACtE;AAAA,EACF;AAEA,QAAM,OAAO,UAAU,SAAS;AAChC,eAAa;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO;AAAA,EACT,CAAC;AACH;AAEA,eAAe,aAAa,GAA4B;AACtD,QAAM,IAAI,WAAW,QAAQ;AAC7B,QAAM,SAAS,iBAAiB,CAAC;AACjC,QAAM,SAAS,QAAQ,iBAAiB,KAAK;AAC3C,qBAAiB,SAAS,KAAK;AAC7B,QAAE,OAAO,KAAK;AAAA,IAEhB;AAAA,EACF,CAAC;AACD,SAAO,EAAE,OAAO,KAAK;AACvB;","names":[]}

package/dist/chunk-WA7XLWZW.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/utils.ts"],"sourcesContent":["/** kordoc 공용 유틸리티 */\n\n/** 빌드 타임에 tsup define으로 주입되는 버전 */\ndeclare const __KORDOC_VERSION__: string\nexport const VERSION: string = typeof __KORDOC_VERSION__ !== \"undefined\" ? __KORDOC_VERSION__ : \"0.0.0-dev\"\n\n/**\n * Node.js Buffer → ArrayBuffer 변환\n * pool Buffer의 공유 ArrayBuffer 문제를 안전하게 처리.\n * offset=0이고 전체 ArrayBuffer를 차지하면 복사 없이 직접 반환.\n */\nexport function toArrayBuffer(buf: Buffer): ArrayBuffer {\n  if (buf.byteOffset === 0 && buf.byteLength === buf.buffer.byteLength) {\n    return buf.buffer as ArrayBuffer\n  }\n  return buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength) as ArrayBuffer\n}\n\n/**\n * kordoc 내부 에러 클래스 — 사용자에게 노출해도 안전한 메시지만 포함.\n * MCP 에러 정제에서 instanceof로 판별하여 allowlist 패턴 매칭 없이 안전하게 통과.\n */\nexport class KordocError extends Error {\n  constructor(message: string) {\n    super(message)\n    this.name = \"KordocError\"\n  }\n}\n\n/**\n * 에러 메시지 정제 — KordocError는 그대로, 나머지는 일반 메시지로 대체.\n * 파일시스템 경로, 스택 트레이스 등 내부 정보 노출 방지.\n */\nexport function sanitizeError(err: unknown): string {\n  if (err instanceof KordocError) return err.message\n  return \"문서 처리 중 오류가 발생했습니다\"\n}\n\n/**\n * ZIP 엔트리 경로의 경로 순회 여부 판별.\n * 백슬래시 정규화, .., 절대경로, Windows 드라이브 문자 모두 차단.\n */\nexport function isPathTraversal(name: string): boolean {\n  if (name.includes(\"\\x00\")) return true\n  const normalized = name.replace(/\\\\/g, \"/\")\n  const segments = normalized.split(\"/\")\n  return segments.some(s => s === \"..\") || normalized.startsWith(\"/\") || /^[A-Za-z]:/.test(normalized)\n}\n\n// ─── HWPX 섹션 href 해석 (parser/roundtrip 공용) ────────────────────\n\n/**\n * manifest href를 본문 섹션 경로(`Contents/sectionN.xml`)로 정규화.\n * 비본문 XML(header/script/settings)·path traversal·드라이브 경로는 null로 거른다.\n * 백슬래시 구분자를 슬래시로 통일해 parser와 roundtrip이 동일한 목록을 만든다.\n */\nexport function normalizeSectionHref(href: string): string | null {\n  if (!href) return null\n  let normalized = href.replace(/\\\\/g, \"/\").replace(/^\\/+/, \"\")\n  if (isPathTraversal(normalized)) return null\n  if (/^[Ss]ection\\d+\\.xml$/.test(normalized)) normalized = \"Contents/\" + normalized\n  return /(?:^|\\/)[Ss]ection\\d+\\.xml$/.test(normalized) ? normalized : null\n}\n\n/** sectionN.xml을 N 숫자 순서로 정렬 (section10 > section2). */\nexport function compareSectionPaths(a: string, b: string): number {\n  const ai = Number(a.match(/[Ss]ection(\\d+)\\.xml$/)?.[1] ?? Number.MAX_SAFE_INTEGER)\n  const bi = Number(b.match(/[Ss]ection(\\d+)\\.xml$/)?.[1] ?? Number.MAX_SAFE_INTEGER)\n  return ai === bi ? a.localeCompare(b) : ai - bi\n}\n\n// ─── ZIP 안전 로딩 (ZIP bomb 방지) ────────────────────\n\n/**\n * ZIP bomb 사전 검사 — Central Directory에서 비압축 합계와 엔트리 수 확인.\n * HWPX/XLSX/DOCX 등 모든 ZIP 기반 포맷에서 공통 사용.\n */\nexport function precheckZipSize(\n  buffer: ArrayBuffer,\n  maxUncompressedSize = 256 * 1024 * 1024, // parser-shared MAX_DECOMPRESS_SIZE 와 동기\n  maxEntries = 500,\n): { totalUncompressed: number; entryCount: number } {\n  try {\n    const data = new DataView(buffer)\n    const len = buffer.byteLength\n    // EOCD 시그니처 역방향 스캔\n    let eocdOffset = -1\n    for (let i = len - 22; i >= Math.max(0, len - 65557); i--) {\n      if (data.getUint32(i, true) === 0x06054b50) { eocdOffset = i; break }\n    }\n    if (eocdOffset < 0) return { totalUncompressed: 0, entryCount: 0 }\n\n    const entryCount = data.getUint16(eocdOffset + 10, true)\n    if (entryCount > maxEntries) {\n      throw new KordocError(`ZIP 엔트리 수 초과: ${entryCount} (최대 ${maxEntries})`)\n    }\n\n    const cdSize = data.getUint32(eocdOffset + 12, true)\n    const cdOffset = data.getUint32(eocdOffset + 16, true)\n    if (cdOffset + cdSize > len) return { totalUncompressed: 0, entryCount }\n\n    let totalUncompressed = 0\n    let pos = cdOffset\n    for (let i = 0; i < entryCount && pos + 46 <= cdOffset + cdSize; i++) {\n      if (data.getUint32(pos, true) !== 0x02014b50) break\n      totalUncompressed += data.getUint32(pos + 24, true)\n      const nameLen = data.getUint16(pos + 28, true)\n      const extraLen = data.getUint16(pos + 30, true)\n      const commentLen = data.getUint16(pos + 32, true)\n      pos += 46 + nameLen + extraLen + commentLen\n    }\n\n    if (totalUncompressed > maxUncompressedSize) {\n      throw new KordocError(`ZIP 비압축 크기 초과: ${(totalUncompressed / 1024 / 1024).toFixed(1)}MB (최대 ${maxUncompressedSize / 1024 / 1024}MB)`)\n    }\n\n    return { totalUncompressed, entryCount }\n  } catch (err) {\n    if (err instanceof KordocError) throw err\n    return { totalUncompressed: 0, entryCount: 0 }\n  }\n}\n\n/** XXE/Billion Laughs 방지 — DOCTYPE 제거 (내부 DTD 서브셋 포함) */\nexport function stripDtd(xml: string): string {\n  return xml.replace(/<!DOCTYPE\\s[^[>]*(\\[[\\s\\S]*?\\])?\\s*>/gi, \"\")\n}\n\n/** 하이퍼링크 URL 살균 — javascript: 등 XSS 위험 스킴 차단 */\nconst SAFE_HREF_RE = /^(?:https?:|mailto:|tel:|#)/i\nexport function sanitizeHref(href: string): string | null {\n  const trimmed = href.trim()\n  if (!trimmed || !SAFE_HREF_RE.test(trimmed)) return null\n  // 괄호 percent-encoding — 마크다운 링크 목적지에서 불균형 ')'는 링크를 조기 종료시켜\n  // 문법이 깨진다 (원문 하이퍼링크에 ')'가 박힌 실문서 존재). %28/%29는 의미 동일.\n  return trimmed.replace(/\\(/g, \"%28\").replace(/\\)/g, \"%29\")\n}\n\n// ─── 안전한 min/max (스택 오버플로 방지) ─────────────\n\n/** Math.min(...arr) 대체 — 대형 배열에서 스택 오버플로 방지 */\nexport function safeMin(arr: number[]): number {\n  let min = Infinity\n  for (let i = 0; i < arr.length; i++) if (arr[i] < min) min = arr[i]\n  return min\n}\n\n/** Math.max(...arr) 대체 — 대형 배열에서 스택 오버플로 방지 */\nexport function safeMax(arr: number[]): number {\n  let max = -Infinity\n  for (let i = 0; i < arr.length; i++) if (arr[i] > max) max = arr[i]\n  return max\n}\n\n// ─── 에러 분류 ──────────────────────────────────────\n\nimport type { ErrorCode } from \"./types.js\"\n\n/** 에러를 구조화된 ErrorCode로 분류 — KordocError 메시지 패턴 매칭 */\nexport function classifyError(err: unknown): ErrorCode {\n  if (!(err instanceof Error)) return \"PARSE_ERROR\"\n  const msg = err.message\n  // DRM 을 암호화보다 먼저 — \"DRM 암호화된 HWPX…\" 류 메시지가 ENCRYPTED 로 떨어지지 않도록\n  if (msg.includes(\"DRM\")) return \"DRM_PROTECTED\"\n  if (msg.includes(\"암호화\") || msg.includes(\"암호로 보호\")) return \"ENCRYPTED\"\n  if (msg.includes(\"optional dependency\")) return \"MISSING_DEPENDENCY\"\n  if (msg.includes(\"ZIP bomb\") || msg.includes(\"ZIP 비압축 크기 초과\") || msg.includes(\"ZIP 엔트리 수 초과\")) return \"ZIP_BOMB\"\n  if (msg.includes(\"bomb\") || msg.includes(\"크기 초과\") || msg.includes(\"압축 해제\")) return \"DECOMPRESSION_BOMB\"\n  if (msg.includes(\"이미지 기반\")) return \"IMAGE_BASED_PDF\"\n  if (msg.includes(\"섹션\") && (msg.includes(\"찾을 수 없\") || msg.includes(\"없음\"))) return \"NO_SECTIONS\"\n  if (msg.includes(\"시그니처\") || msg.includes(\"복구할 수 없\")) return \"CORRUPTED\"\n  return \"PARSE_ERROR\"\n}\n"],"mappings":";;;AAIO,IAAM,UAAkB,OAA4C,UAAqB;AAOzF,SAAS,cAAc,KAA0B;AACtD,MAAI,IAAI,eAAe,KAAK,IAAI,eAAe,IAAI,OAAO,YAAY;AACpE,WAAO,IAAI;AAAA,EACb;AACA,SAAO,IAAI,OAAO,MAAM,IAAI,YAAY,IAAI,aAAa,IAAI,UAAU;AACzE;AAMO,IAAM,cAAN,cAA0B,MAAM;AAAA,EACrC,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAMO,SAAS,cAAc,KAAsB;AAClD,MAAI,eAAe,YAAa,QAAO,IAAI;AAC3C,SAAO;AACT;AAMO,SAAS,gBAAgB,MAAuB;AACrD,MAAI,KAAK,SAAS,IAAM,EAAG,QAAO;AAClC,QAAM,aAAa,KAAK,QAAQ,OAAO,GAAG;AAC1C,QAAM,WAAW,WAAW,MAAM,GAAG;AACrC,SAAO,SAAS,KAAK,OAAK,MAAM,IAAI,KAAK,WAAW,WAAW,GAAG,KAAK,aAAa,KAAK,UAAU;AACrG;AASO,SAAS,qBAAqB,MAA6B;AAChE,MAAI,CAAC,KAAM,QAAO;AAClB,MAAI,aAAa,KAAK,QAAQ,OAAO,GAAG,EAAE,QAAQ,QAAQ,EAAE;AAC5D,MAAI,gBAAgB,UAAU,EAAG,QAAO;AACxC,MAAI,uBAAuB,KAAK,UAAU,EAAG,cAAa,cAAc;AACxE,SAAO,8BAA8B,KAAK,UAAU,IAAI,aAAa;AACvE;AAGO,SAAS,oBAAoB,GAAW,GAAmB;AAChE,QAAM,KAAK,OAAO,EAAE,MAAM,uBAAuB,IAAI,CAAC,KAAK,OAAO,gBAAgB;AAClF,QAAM,KAAK,OAAO,EAAE,MAAM,uBAAuB,IAAI,CAAC,KAAK,OAAO,gBAAgB;AAClF,SAAO,OAAO,KAAK,EAAE,cAAc,CAAC,IAAI,KAAK;AAC/C;AAQO,SAAS,gBACd,QACA,sBAAsB,MAAM,OAAO,MACnC,aAAa,KACsC;AACnD,MAAI;AACF,UAAM,OAAO,IAAI,SAAS,MAAM;AAChC,UAAM,MAAM,OAAO;AAEnB,QAAI,aAAa;AACjB,aAAS,IAAI,MAAM,IAAI,KAAK,KAAK,IAAI,GAAG,MAAM,KAAK,GAAG,KAAK;AACzD,UAAI,KAAK,UAAU,GAAG,IAAI,MAAM,WAAY;AAAE,qBAAa;AAAG;AAAA,MAAM;AAAA,IACtE;AACA,QAAI,aAAa,EAAG,QAAO,EAAE,mBAAmB,GAAG,YAAY,EAAE;AAEjE,UAAM,aAAa,KAAK,UAAU,aAAa,IAAI,IAAI;AACvD,QAAI,aAAa,YAAY;AAC3B,YAAM,IAAI,YAAY,+CAAiB,UAAU,kBAAQ,UAAU,GAAG;AAAA,IACxE;AAEA,UAAM,SAAS,KAAK,UAAU,aAAa,IAAI,IAAI;AACnD,UAAM,WAAW,KAAK,UAAU,aAAa,IAAI,IAAI;AACrD,QAAI,WAAW,SAAS,IAAK,QAAO,EAAE,mBAAmB,GAAG,WAAW;AAEvE,QAAI,oBAAoB;AACxB,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,cAAc,MAAM,MAAM,WAAW,QAAQ,KAAK;AACpE,UAAI,KAAK,UAAU,KAAK,IAAI,MAAM,SAAY;AAC9C,2BAAqB,KAAK,UAAU,MAAM,IAAI,IAAI;AAClD,YAAM,UAAU,KAAK,UAAU,MAAM,IAAI,IAAI;AAC7C,YAAM,WAAW,KAAK,UAAU,MAAM,IAAI,IAAI;AAC9C,YAAM,aAAa,KAAK,UAAU,MAAM,IAAI,IAAI;AAChD,aAAO,KAAK,UAAU,WAAW;AAAA,IACnC;AAEA,QAAI,oBAAoB,qBAAqB;AAC3C,YAAM,IAAI,YAAY,sDAAmB,oBAAoB,OAAO,MAAM,QAAQ,CAAC,CAAC,oBAAU,sBAAsB,OAAO,IAAI,KAAK;AAAA,IACtI;AAEA,WAAO,EAAE,mBAAmB,WAAW;AAAA,EACzC,SAAS,KAAK;AACZ,QAAI,eAAe,YAAa,OAAM;AACtC,WAAO,EAAE,mBAAmB,GAAG,YAAY,EAAE;AAAA,EAC/C;AACF;AAGO,SAAS,SAAS,KAAqB;AAC5C,SAAO,IAAI,QAAQ,0CAA0C,EAAE;AACjE;AAGA,IAAM,eAAe;AACd,SAAS,aAAa,MAA6B;AACxD,QAAM,UAAU,KAAK,KAAK;AAC1B,MAAI,CAAC,WAAW,CAAC,aAAa,KAAK,OAAO,EAAG,QAAO;AAGpD,SAAO,QAAQ,QAAQ,OAAO,KAAK,EAAE,QAAQ,OAAO,KAAK;AAC3D;AAKO,SAAS,QAAQ,KAAuB;AAC7C,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,IAAK,KAAI,IAAI,CAAC,IAAI,IAAK,OAAM,IAAI,CAAC;AAClE,SAAO;AACT;AAGO,SAAS,QAAQ,KAAuB;AAC7C,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,IAAK,KAAI,IAAI,CAAC,IAAI,IAAK,OAAM,IAAI,CAAC;AAClE,SAAO;AACT;AAOO,SAAS,cAAc,KAAyB;AACrD,MAAI,EAAE,eAAe,OAAQ,QAAO;AACpC,QAAM,MAAM,IAAI;AAEhB,MAAI,IAAI,SAAS,KAAK,EAAG,QAAO;AAChC,MAAI,IAAI,SAAS,oBAAK,KAAK,IAAI,SAAS,iCAAQ,EAAG,QAAO;AAC1D,MAAI,IAAI,SAAS,qBAAqB,EAAG,QAAO;AAChD,MAAI,IAAI,SAAS,UAAU,KAAK,IAAI,SAAS,kDAAe,KAAK,IAAI,SAAS,4CAAc,EAAG,QAAO;AACtG,MAAI,IAAI,SAAS,MAAM,KAAK,IAAI,SAAS,2BAAO,KAAK,IAAI,SAAS,2BAAO,EAAG,QAAO;AACnF,MAAI,IAAI,SAAS,iCAAQ,EAAG,QAAO;AACnC,MAAI,IAAI,SAAS,cAAI,MAAM,IAAI,SAAS,4BAAQ,KAAK,IAAI,SAAS,cAAI,GAAI,QAAO;AACjF,MAAI,IAAI,SAAS,0BAAM,KAAK,IAAI,SAAS,kCAAS,EAAG,QAAO;AAC5D,SAAO;AACT;","names":[]}

package/dist/chunk-ZV5OKQ3Z.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/Users/mong-e/workspace/kordoc/dist/chunk-ZV5OKQ3Z.cjs","../src/pdf/formula/models.ts"],"names":[],"mappings":"AAAA;ACUA,gCAA2B;AAC3B,wBAAiC;AACjC,uCAA4C;AAC5C;AACA,wBAAwB;AACxB,4BAA8B;AAC9B,4CAAyB;AACzB,gCAAyB;AAWlB,IAAM,UAAA,EAAuB;AAAA,EAClC,IAAA,EAAM,cAAA;AAAA,EACN,QAAA,EAAU,UAAA;AAAA,EACV,GAAA,EAAK,gFAAA;AAAA,EACL,MAAA,EAAQ,kEAAA;AAAA,EACR,MAAA,EAAQ;AACV,CAAA;AAEO,IAAM,kBAAA,EAA+B;AAAA,EAC1C,IAAA,EAAM,sBAAA;AAAA,EACN,QAAA,EAAU,oBAAA;AAAA,EACV,GAAA,EAAK,gFAAA;AAAA,EACL,MAAA,EAAQ,kEAAA;AAAA,EACR,MAAA,EAAQ;AACV,CAAA;AAEO,IAAM,kBAAA,EAA+B;AAAA,EAC1C,IAAA,EAAM,sBAAA;AAAA,EACN,QAAA,EAAU,oBAAA;AAAA,EACV,GAAA,EAAK,gFAAA;AAAA,EACL,MAAA,EAAQ,kEAAA;AAAA,EACR,MAAA,EAAQ;AACV,CAAA;AAEO,IAAM,cAAA,EAA2B;AAAA,EACtC,IAAA,EAAM,wBAAA;AAAA,EACN,QAAA,EAAU,gBAAA;AAAA,EACV,GAAA,EAAK,4EAAA;AAAA,EACL,MAAA,EAAQ,kEAAA;AAAA,EACR,MAAA,EAAQ;AACV,CAAA;AAEO,IAAM,mBAAA,EAA+C;AAAA,EAC1D,SAAA;AAAA,EACA,iBAAA;AAAA,EACA,iBAAA;AAAA,EACA;AACF,CAAA;AAOO,SAAS,YAAA,CAAa,MAAA,EAAwB;AACnD,EAAA,MAAM,SAAA,EAAW,OAAA,CAAQ,GAAA,CAAI,kBAAA;AAC7B,EAAA,GAAA,CAAI,SAAA,GAAY,QAAA,CAAS,IAAA,CAAK,CAAA,EAAG;AAC/B,IAAA,OAAO,wBAAA,QAAK,EAAU,MAAM,CAAA;AAAA,EAC9B;AACA,EAAA,OAAO,wBAAA,yBAAK,CAAQ,EAAG,QAAA,EAAU,QAAA,EAAU,QAAA,EAAU,MAAM,CAAA;AAC7D;AAEO,SAAS,mBAAA,CAAA,EAA8B;AAC5C,EAAA,OAAO,YAAA,CAAa,UAAU,CAAA;AAChC;AAaA,MAAA,SAAsB,gBAAA,CAAiB,GAAA,EAAa,KAAA,EAAyD;AAC3G,EAAA,MAAM,OAAA,EAAwB,CAAC,CAAA;AAC/B,EAAA,IAAA,CAAA,MAAW,KAAA,GAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,UAAA,EAAY,wBAAA,GAAK,EAAK,IAAA,CAAK,QAAQ,CAAA;AACzC,IAAA,IAAI,OAAA,EAAS,KAAA;AACb,IAAA,IAAI;AACF,MAAA,MAAM,EAAA,EAAI,MAAM,4BAAA,SAAc,CAAA;AAC9B,MAAA,OAAA,EAAS,CAAA,CAAE,MAAA,CAAO,EAAA,GAAK,CAAA,CAAE,KAAA,EAAO,CAAA;AAAA,IAClC,EAAA,WAAQ;AACN,MAAA,OAAA,EAAS,KAAA;AAAA,IACX;AACA,IAAA,GAAA,CAAI,CAAC,MAAA,EAAQ;AACX,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,SAAA,EAAW,MAAA,EAAQ,KAAA,EAAO,QAAA,EAAU,MAAM,CAAC,CAAA;AAC/D,MAAA,QAAA;AAAA,IACF;AACA,IAAA,IAAI;AACF,MAAA,MAAM,OAAA,EAAS,MAAM,YAAA,CAAa,SAAS,CAAA;AAC3C,MAAA,GAAA,CAAI,OAAA,IAAW,IAAA,CAAK,MAAA,EAAQ;AAC1B,QAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,SAAA,EAAW,MAAA,EAAQ,IAAA,EAAM,QAAA,EAAU,KAAK,CAAC,CAAA;AAAA,MAC/D,EAAA,KAAO;AACL,QAAA,MAAA,CAAO,IAAA,CAAK;AAAA,UACV,IAAA;AAAA,UACA,SAAA;AAAA,UACA,MAAA,EAAQ,IAAA;AAAA,UACR,QAAA,EAAU,KAAA;AAAA,UACV,aAAA,EAAe,CAAA,0BAAA,EAA6B,IAAA,CAAK,MAAM,CAAA,MAAA,EAAS,MAAM,CAAA;AAAA,QAAA;AACvE,MAAA;AACH,IAAA;AAEA,MAAA;AAAY,QAAA;AACV,QAAA;AACA,QAAA;AACQ,QAAA;AACE,QAAA;AACgD,MAAA;AAC3D,IAAA;AACH,EAAA;AAEF,EAAA;AACF;AAGA;AACE,EAAA;AACF;AAoBA;AACE,EAAA;AAEA,EAAA;AACE,IAAA;AAEA,IAAA;AACE,sBAAA;AAAa,QAAA;AACX,QAAA;AACY,QAAA;AACL,QAAA;AACA,QAAA;AACE,MAAA;AAEX,MAAA;AAAA,IAAA;AAIF,IAAA;AACE,MAAA;AAAsB,IAAA;AAChB,IAAA;AAIR,IAAA;AAAgD,EAAA;AAEpD;AAGA;AACE,EAAA;AACF;AAGA;AACE,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACE,oBAAA;AACA,IAAA;AAAA,EAAA;AAEF,EAAA;AACE,IAAA;AAAsB,EAAA;AAChB,EAAA;AAGR,EAAA;AACF;AAEA;AACE,EAAA;AACE,IAAA;AACA,IAAA;AAAwC,EAAA;AAExC,IAAA;AAAO,EAAA;AAET,EAAA;AACE,IAAA;AACA,IAAA;AAAkB,EAAA;AAElB,IAAA;AAAO,EAAA;AAEX;AAEA;AAME,EAAA;AACA,EAAA;AAEA,EAAA;AAAmC,IAAA;AACxB;AAAA,MAAA;AAEO,IAAA;AAChB,EAAA;AAEF,EAAA;AACE,IAAA;AAAU,MAAA;AACiE,IAAA;AAC3E,EAAA;AAGF,EAAA;AACA,EAAA;AACA,EAAA;AAEA,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACE,MAAA;AACA,sBAAA;AAAa,QAAA;AACX,QAAA;AACA,QAAA;AACA,QAAA;AACO,MAAA;AACR,IAAA;AAEH,IAAA;AAAyB,EAAA;AAEzB,IAAA;AACE,MAAA;AAAqB,IAAA;AACf,IAAA;AAGR,IAAA;AAA+D,EAAA;AAGjE,kBAAA;AAAa,IAAA;AACX,IAAA;AACA,IAAA;AACA,IAAA;AACO,EAAA;AAIT,EAAA;AACA,EAAA;AACE,IAAA;AAAoC,EAAA;AAEpC,IAAA;AACE,MAAA;AAAqB,IAAA;AACf,IAAA;AAGR,IAAA;AAAiE,EAAA;AAGnE,EAAA;AACE,IAAA;AACE,MAAA;AAAqB,IAAA;AACf,IAAA;AAGR,IAAA;AAAU,MAAA;AAC4D,IAAA;AACtE,EAAA;AAGF,EAAA;AACA,kBAAA;AAAa,IAAA;AACX,IAAA;AACA,IAAA;AACA,IAAA;AACO,EAAA;AAEX;AAEA;AACE,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AACE,MAAA;AAAc,IAAA;AAEhB,EAAA;AAEF,EAAA;AACF;AD7FA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"/Users/mong-e/workspace/kordoc/dist/chunk-ZV5OKQ3Z.cjs","sourcesContent":[null,"/**\n * 수식 OCR 모델 자동 다운로드 + SHA-256 검증\n *\n * 캐시 위치: `~/.cache/kordoc/models/pix2text/`\n * 총 ~155MB (MFD 44MB + MFR encoder 87MB + MFR decoder 30MB + tokenizer 40KB)\n *\n * HF URL + SHA 는 Docufinder archive/rust-formula-ocr-wip 에서 검증 완료됨.\n * 모델 버전 갱신 시 URL + SHA 를 함께 갱신해야 한다.\n */\n\nimport { createHash } from \"crypto\"\nimport { createReadStream } from \"fs\"\nimport { mkdir, stat, unlink, rename } from \"fs/promises\"\nimport { createWriteStream } from \"fs\"\nimport { homedir } from \"os\"\nimport { join, dirname } from \"path\"\nimport { pipeline } from \"stream/promises\"\nimport { Readable } from \"stream\"\n\nexport interface ModelSpec {\n  name: string\n  filename: string\n  url: string\n  sha256: string\n  sizeMb: number\n}\n\n/** 모델 스펙 (SHA-256 은 실제 다운로드로 검증됨 — 변경 금지) */\nexport const MFD_MODEL: ModelSpec = {\n  name: \"Pix2Text MFD\",\n  filename: \"mfd.onnx\",\n  url: \"https://huggingface.co/breezedeus/pix2text-mfd/resolve/main/mfd-v20240618.onnx\",\n  sha256: \"51a8854743b17ae654729af8db82a630c1ccfa06debf4856c8b28055f87d02c1\",\n  sizeMb: 42,\n}\n\nexport const MFR_ENCODER_MODEL: ModelSpec = {\n  name: \"Pix2Text MFR encoder\",\n  filename: \"encoder_model.onnx\",\n  url: \"https://huggingface.co/breezedeus/pix2text-mfr/resolve/main/encoder_model.onnx\",\n  sha256: \"bd8d5c322792e9ec45793af5569e9748f82a3d728a9e00213dbfc56c1486f37d\",\n  sizeMb: 87,\n}\n\nexport const MFR_DECODER_MODEL: ModelSpec = {\n  name: \"Pix2Text MFR decoder\",\n  filename: \"decoder_model.onnx\",\n  url: \"https://huggingface.co/breezedeus/pix2text-mfr/resolve/main/decoder_model.onnx\",\n  sha256: \"fd0f92d7a012f3dae41e1ac79421aea0ea888b5a66cb3f9a004e424f82f3daed\",\n  sizeMb: 30,\n}\n\nexport const MFR_TOKENIZER: ModelSpec = {\n  name: \"Pix2Text MFR tokenizer\",\n  filename: \"tokenizer.json\",\n  url: \"https://huggingface.co/breezedeus/pix2text-mfr/resolve/main/tokenizer.json\",\n  sha256: \"3e2ab757277d22639bec28c9d7972e352d3d1dba223051fa674002dc5ab64df3\",\n  sizeMb: 1,\n}\n\nexport const ALL_FORMULA_MODELS: ReadonlyArray<ModelSpec> = [\n  MFD_MODEL,\n  MFR_ENCODER_MODEL,\n  MFR_DECODER_MODEL,\n  MFR_TOKENIZER,\n]\n\n/**\n * 모델 캐시 하위 디렉토리 경로. 환경 변수 `KORDOC_MODEL_CACHE` 가 설정되면\n * 해당 경로를 우선 사용, 없으면 `~/.cache/kordoc/models/<subdir>/`.\n * (수식 OCR 외 텍스트 OCR 등 다른 모델군도 공용 — subdir 로 격리)\n */\nexport function getModelsDir(subdir: string): string {\n  const override = process.env.KORDOC_MODEL_CACHE\n  if (override && override.trim()) {\n    return join(override, subdir)\n  }\n  return join(homedir(), \".cache\", \"kordoc\", \"models\", subdir)\n}\n\nexport function getFormulaModelsDir(): string {\n  return getModelsDir(\"pix2text\")\n}\n\nexport interface ModelStatus {\n  spec: ModelSpec\n  localPath: string\n  exists: boolean\n  /** SHA 검증까지 끝났는가 (exists && valid) */\n  verified: boolean\n  /** 검증 실패 시 이유 */\n  invalidReason?: string\n}\n\n/** 지정 모델군의 존재/유효성 상태 반환 (다운로드 없이 확인만) */\nexport async function getModelStatusIn(dir: string, specs: ReadonlyArray<ModelSpec>): Promise<ModelStatus[]> {\n  const result: ModelStatus[] = []\n  for (const spec of specs) {\n    const localPath = join(dir, spec.filename)\n    let exists = false\n    try {\n      const s = await stat(localPath)\n      exists = s.isFile() && s.size > 0\n    } catch {\n      exists = false\n    }\n    if (!exists) {\n      result.push({ spec, localPath, exists: false, verified: false })\n      continue\n    }\n    try {\n      const actual = await sha256OfFile(localPath)\n      if (actual === spec.sha256) {\n        result.push({ spec, localPath, exists: true, verified: true })\n      } else {\n        result.push({\n          spec,\n          localPath,\n          exists: true,\n          verified: false,\n          invalidReason: `SHA256 mismatch: expected ${spec.sha256}, got ${actual}`,\n        })\n      }\n    } catch (e) {\n      result.push({\n        spec,\n        localPath,\n        exists: true,\n        verified: false,\n        invalidReason: `SHA compute failed: ${(e as Error).message}`,\n      })\n    }\n  }\n  return result\n}\n\n/** 모든 수식 모델의 존재/유효성 상태 반환 (다운로드 없이 확인만) */\nexport async function getFormulaModelStatus(): Promise<ModelStatus[]> {\n  return getModelStatusIn(getFormulaModelsDir(), ALL_FORMULA_MODELS)\n}\n\nexport interface DownloadProgress {\n  spec: ModelSpec\n  /** 현재까지 다운로드한 바이트 */\n  downloaded: number\n  /** 전체 바이트 (알 수 있으면) */\n  total: number | null\n  /** \"download\" | \"verify\" | \"done\" | \"skip\" */\n  phase: \"download\" | \"verify\" | \"done\" | \"skip\" | \"error\"\n  message?: string\n}\n\nexport type ProgressHandler = (p: DownloadProgress) => void\n\n/**\n * 지정 모델군을 다운로드/검증한다.\n * - 이미 있고 SHA 일치 → skip\n * - 없음 → 다운로드 후 SHA 검증. 실패 시 파일 삭제.\n */\nexport async function ensureModelsIn(dir: string, specs: ReadonlyArray<ModelSpec>, onProgress?: ProgressHandler): Promise<void> {\n  await mkdir(dir, { recursive: true })\n\n  for (const spec of specs) {\n    const localPath = join(dir, spec.filename)\n\n    if (await isExistingValid(localPath, spec.sha256)) {\n      onProgress?.({\n        spec,\n        downloaded: 0,\n        total: null,\n        phase: \"skip\",\n        message: \"이미 존재 + SHA 일치\",\n      })\n      continue\n    }\n\n    // 기존 파일 있지만 SHA 불일치 → 삭제\n    try {\n      await unlink(localPath)\n    } catch {\n      // 없을 수 있음\n    }\n\n    await downloadToFile(spec, localPath, onProgress)\n  }\n}\n\n/** 필요한 모든 수식 모델을 다운로드/검증한다. */\nexport async function ensureFormulaModels(onProgress?: ProgressHandler): Promise<void> {\n  return ensureModelsIn(getFormulaModelsDir(), ALL_FORMULA_MODELS, onProgress)\n}\n\n/** 단일 모델만 확인/다운로드 (진단 UI 에서 개별 상태 새로고침용) */\nexport async function ensureSingleModel(spec: ModelSpec, onProgress?: ProgressHandler): Promise<void> {\n  const dir = getFormulaModelsDir()\n  await mkdir(dir, { recursive: true })\n  const localPath = join(dir, spec.filename)\n  if (await isExistingValid(localPath, spec.sha256)) {\n    onProgress?.({ spec, downloaded: 0, total: null, phase: \"skip\" })\n    return\n  }\n  try {\n    await unlink(localPath)\n  } catch {\n    // 재다운로드 전 손상/잔존 파일 정리 best-effort — 애초에 없으면 실패해도 무방\n  }\n  await downloadToFile(spec, localPath, onProgress)\n}\n\nasync function isExistingValid(localPath: string, sha256Expected: string): Promise<boolean> {\n  try {\n    const s = await stat(localPath)\n    if (!s.isFile() || s.size === 0) return false\n  } catch {\n    return false\n  }\n  try {\n    const actual = await sha256OfFile(localPath)\n    return actual === sha256Expected\n  } catch {\n    return false\n  }\n}\n\nasync function downloadToFile(\n  spec: ModelSpec,\n  localPath: string,\n  onProgress?: ProgressHandler,\n): Promise<void> {\n  // 먼저 .part 로 받고 검증 후 rename — 중단된 다운로드가 \"정상 파일\"로 오인되는 걸 방지\n  const partPath = `${localPath}.part`\n  await mkdir(dirname(localPath), { recursive: true })\n\n  const resp = await fetch(spec.url, {\n    headers: {\n      // HF CDN 은 UA 없으면 가끔 403 을 뱉는다\n      \"User-Agent\": \"kordoc-formula-ocr/1.0 (+https://github.com/chrisryugj/kordoc)\",\n    },\n  })\n  if (!resp.ok || !resp.body) {\n    throw new Error(\n      `${spec.name} 다운로드 실패: HTTP ${resp.status} ${resp.statusText} (${spec.url})`,\n    )\n  }\n\n  const lenHeader = resp.headers.get(\"content-length\")\n  const total = lenHeader ? Number.parseInt(lenHeader, 10) : null\n  let downloaded = 0\n\n  const ws = createWriteStream(partPath)\n  try {\n    const reader = Readable.fromWeb(resp.body as unknown as import(\"stream/web\").ReadableStream)\n    reader.on(\"data\", (chunk: Buffer | Uint8Array) => {\n      downloaded += chunk.length\n      onProgress?.({\n        spec,\n        downloaded,\n        total,\n        phase: \"download\",\n      })\n    })\n    await pipeline(reader, ws)\n  } catch (e) {\n    try {\n      await unlink(partPath)\n    } catch {\n      // .part 임시파일 정리 best-effort — 본 에러(스트리밍 실패)를 가리지 않도록 무시\n    }\n    throw new Error(`${spec.name} 스트리밍 실패: ${(e as Error).message}`)\n  }\n\n  onProgress?.({\n    spec,\n    downloaded,\n    total,\n    phase: \"verify\",\n  })\n\n  // SHA 검증\n  let actual: string\n  try {\n    actual = await sha256OfFile(partPath)\n  } catch (e) {\n    try {\n      await unlink(partPath)\n    } catch {\n      // .part 임시파일 정리 best-effort — 본 에러(SHA 계산 실패)를 가리지 않도록 무시\n    }\n    throw new Error(`${spec.name} SHA 계산 실패: ${(e as Error).message}`)\n  }\n\n  if (actual !== spec.sha256) {\n    try {\n      await unlink(partPath)\n    } catch {\n      // 오염된 .part 정리 best-effort — 본 에러(SHA mismatch)를 가리지 않도록 무시\n    }\n    throw new Error(\n      `${spec.name} SHA256 mismatch: expected ${spec.sha256}, got ${actual} — 모델 URL 이 오염되었거나 전송 중 손상되었습니다.`,\n    )\n  }\n\n  await rename(partPath, localPath)\n  onProgress?.({\n    spec,\n    downloaded,\n    total,\n    phase: \"done\",\n  })\n}\n\nasync function sha256OfFile(p: string): Promise<string> {\n  const h = createHash(\"sha256\")\n  const stream = createReadStream(p)\n  await pipeline(stream, async function* (src) {\n    for await (const chunk of src) {\n      h.update(chunk)\n      // yield 안 함 (소비만)\n    }\n  })\n  return h.digest(\"hex\")\n}\n"]}

package/dist/chunks-FMZK4QHL.js

@@ -1,10 +0,0 @@
-#!/usr/bin/env node
-import {
-  blocksToChunks
-} from "./chunk-7MDLAKVO.js";
-import "./chunk-SMPEZINI.js";
-import "./chunk-WA7XLWZW.js";
-export {
-  blocksToChunks
-};
-//# sourceMappingURL=chunks-FMZK4QHL.js.map

package/dist/formula-CG4S7TWO.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/Users/mong-e/workspace/kordoc/dist/formula-CG4S7TWO.cjs","../src/pdf/formula/postprocess.ts","../src/pdf/formula/detector.ts","../src/pdf/formula/recognizer.ts","../src/pdf/formula/pipeline.ts"],"names":[],"mappings":"AAAA;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B;AACA;ACHA,IAAM,yBAAA,EAA2B;AAAA,EAC/B,KAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,QAAA;AAAA,EACA,SAAA;AAAA,EACA,WAAA;AAAA,EACA;AACF,CAAA;AAEO,SAAS,gBAAA,CAAiB,KAAA,EAAuB;AACtD,EAAA,IAAI,EAAA,EAAI,uBAAA,CAAwB,KAAK,CAAA;AACrC,EAAA,EAAA,EAAI,cAAA,CAAe,CAAC,CAAA;AACpB,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,EAAA,EAAI,CAAA,EAAA,EAAK;AAC3B,IAAA,MAAM,KAAA,EAAO,gBAAA,CAAiB,CAAC,CAAA;AAC/B,IAAA,GAAA,CAAI,KAAA,IAAS,CAAA,EAAG,KAAA;AAChB,IAAA,EAAA,EAAI,IAAA;AAAA,EACN;AACA,EAAA,EAAA,EAAI,eAAA,CAAgB,CAAC,CAAA;AACrB,EAAA,EAAA,EAAI,uBAAA,CAAwB,CAAC,CAAA;AAC7B,EAAA,EAAA,EAAI,CAAA,CAAE,IAAA,CAAK,CAAA;AAEX,EAAA,GAAA,CAAI,gBAAA,CAAiB,CAAC,CAAA,EAAG,OAAO,EAAA;AAChC,EAAA,OAAO,CAAA;AACT;AAEO,SAAS,uBAAA,CAAwB,CAAA,EAAmB;AACzD,EAAA,IAAI,EAAA,EAAI,CAAA;AAER,EAAA,IAAA,CAAA,EAAA,EAAA,EAAS;AACP,IAAA,MAAM,QAAA,EAAU,CAAA,CAAE,OAAA,CAAQ,QAAA,EAAU,EAAE,CAAA;AACtC,IAAA,IAAI,QAAA,EAAU,KAAA;AACd,IAAA,IAAA,CAAA,MAAW,EAAA,GAAK,wBAAA,EAA0B;AACxC,MAAA,GAAA,CAAI,OAAA,CAAQ,QAAA,CAAS,CAAC,CAAA,EAAG;AACvB,QAAA,EAAA,EAAI,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,OAAA,CAAQ,OAAA,EAAS,CAAA,CAAE,MAAM,CAAA;AAC9C,QAAA,QAAA,EAAU,IAAA;AACV,QAAA,KAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,GAAA,CAAI,CAAC,OAAA,EAAS,OAAO,OAAA;AAAA,EACvB;AACF;AAEO,SAAS,cAAA,CAAe,CAAA,EAAmB;AAChD,EAAA,IAAI,IAAA,EAAM,EAAA;AACV,EAAA,IAAI,UAAA,EAAY,KAAA;AAChB,EAAA,IAAA,CAAA,MAAW,EAAA,GAAK,CAAA,EAAG;AACjB,IAAA,GAAA,CAAI,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,EAAG;AAChB,MAAA,GAAA,CAAI,CAAC,SAAA,EAAW;AACd,QAAA,IAAA,GAAO,GAAA;AACP,QAAA,UAAA,EAAY,IAAA;AAAA,MACd;AAAA,IACF,EAAA,KAAO;AACL,MAAA,IAAA,GAAO,CAAA;AACP,MAAA,UAAA,EAAY,KAAA;AAAA,IACd;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAKO,SAAS,gBAAA,CAAiB,CAAA,EAAmB;AAClD,EAAA,IAAI,IAAA,EAAM,EAAA;AACV,EAAA,IAAI,EAAA,EAAI,CAAA;AACR,EAAA,MAAM,MAAA,EAAQ,CAAA;AACd,EAAA,MAAA,CAAO,EAAA,EAAI,KAAA,CAAM,MAAA,EAAQ;AACvB,IAAA,MAAM,GAAA,EAAK,KAAA,CAAM,CAAC,CAAA;AAClB,IAAA,GAAA,CAAI,GAAA,IAAO,GAAA,EAAK;AAEd,MAAA,IAAI,EAAA,EAAI,EAAA,EAAI,CAAA;AACZ,MAAA,MAAA,CAAO,EAAA,EAAI,KAAA,CAAM,OAAA,GAAU,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA,EAAG,CAAA,EAAA;AAChD,MAAA,GAAA,CAAI,EAAA,EAAI,KAAA,CAAM,OAAA,GAAU,KAAA,CAAM,CAAC,EAAA,IAAM,GAAA,EAAK;AAExC,QAAA,MAAA,CAAO,GAAA,CAAI,QAAA,CAAS,GAAG,EAAA,GAAK,GAAA,CAAI,QAAA,CAAS,GAAI,CAAA,EAAG;AAC9C,UAAA,IAAA,EAAM,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,CAAA,CAAE,CAAA;AAAA,QACvB;AACA,QAAA,GAAA,CAAI,GAAA,CAAI,QAAA,CAAS,GAAG,EAAA,GAAK,GAAA,CAAI,QAAA,CAAS,GAAG,CAAA,EAAG;AAC1C,UAAA,IAAA,EAAM,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,CAAA,CAAE,CAAA;AAAA,QACvB,EAAA,KAAO;AAEL,UAAA,IAAI,EAAA,EAAI,GAAA,CAAI,MAAA;AACZ,UAAA,MAAA,CAAO,EAAA,EAAI,EAAA,GAAK,UAAA,CAAW,IAAA,CAAK,GAAA,CAAI,EAAA,EAAI,CAAC,CAAC,CAAA,EAAG,CAAA,EAAA;AAC7C,UAAA,GAAA,CAAI,EAAA,EAAI,EAAA,GAAK,GAAA,CAAI,EAAA,EAAI,CAAC,EAAA,IAAM,KAAA,GAAQ,EAAA,EAAI,GAAA,CAAI,MAAA,EAAQ;AAClD,YAAA,IAAA,EAAM,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,EAAA,EAAI,CAAC,CAAA;AAAA,UAC1B;AAAA,QAEF;AACA,QAAA,EAAA,EAAI,EAAA,EAAI,CAAA;AACR,QAAA,QAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAA,GAAO,EAAA;AACP,IAAA,CAAA,EAAA;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAOA,IAAM,iBAAA,kBAAwC,IAAI,GAAA,CAAI;AAAA;AAAA,EAEpD,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,OAAA;AAAA,EAC3C,OAAA;AAAA,EAAS,KAAA;AAAA,EAAO,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,QAAA;AAAA,EACnD,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,MAAA;AAAA;AAAA,EAE7B,QAAA;AAAA,EAAU,OAAA;AAAA,EAAS,KAAA;AAAA,EAAO,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,OAAA;AAAA,EAAS,MAAA;AAAA,EAChD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,QAAA;AAAA,EAChE,QAAA;AAAA,EAAU,UAAA;AAAA,EAAY,MAAA;AAAA;AAAA,EAEtB,IAAA;AAAA,EAAM,OAAA;AAAA,EAAS,IAAA;AAAA,EAAM,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,UAAA;AAAA,EAAY,UAAA;AAAA,EACrD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,UAAA;AAAA,EAAY,YAAA;AAAA,EAC9C,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,SAAA;AAAA,EAAW,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,OAAA;AAAA;AAAA,EAEpE,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,SAAA;AAAA,EAAW,YAAA;AAAA,EAC9C,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,OAAA;AAAA,EAAS,UAAA;AAAA,EAAY,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,QAAA;AAAA,EACrD,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,SAAA;AAAA,EAAW,IAAA;AAAA,EAAM,OAAA;AAAA,EAAS,KAAA;AAAA,EAAO,QAAA;AAAA,EACnD,OAAA;AAAA,EAAS,UAAA;AAAA,EAAY,KAAA;AAAA,EAAO,SAAA;AAAA,EAAW,KAAA;AAAA,EAAO,QAAA;AAAA,EAC9C,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,OAAA;AAAA;AAAA,EAEd,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,OAAA;AAAA,EACjD,SAAA;AAAA,EAAW,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,OAAA;AAAA;AAAA,EAEzB,IAAA;AAAA,EAAM,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,YAAA;AAAA,EAAc,WAAA;AAAA,EAAa,gBAAA;AAAA,EACnD,YAAA;AAAA,EAAc,WAAA;AAAA,EAAa,gBAAA;AAAA,EAAkB,SAAA;AAAA,EAAW,WAAA;AAAA,EACxD,gBAAA;AAAA,EAAkB,eAAA;AAAA,EAAiB,YAAA;AAAA;AAAA,EAEnC,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,UAAA;AAAA,EAAY,WAAA;AAAA;AAAA,EAErE,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACnC,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAC9C,KAAA;AAAA,EAAO,IAAA;AAAA,EAAM,IAAA;AAAA,EAAM,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,QAAA;AAAA,EAAU,QAAA;AAAA,EAC3C,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA;AAAA,EAE7E,OAAA;AAAA,EAAS,SAAA;AAAA,EAAW,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,IAAA;AAAA,EAAM,IAAA;AAAA,EACpE,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,OAAA;AAAA;AAAA,EAEhC,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ;AACzC,CAAC,CAAA;AAWM,SAAS,eAAA,CAAgB,CAAA,EAAmB;AACjD,EAAA,IAAI,IAAA,EAAM,EAAA;AACV,EAAA,IAAI,EAAA,EAAI,CAAA;AACR,EAAA,MAAA,CAAO,EAAA,EAAI,CAAA,CAAE,MAAA,EAAQ;AACnB,IAAA,GAAA,CAAI,CAAA,CAAE,CAAC,EAAA,IAAM,KAAA,GAAQ,EAAA,EAAI,EAAA,EAAI,CAAA,CAAE,OAAA,GAAU,UAAA,CAAW,IAAA,CAAK,CAAA,CAAE,EAAA,EAAI,CAAC,CAAC,CAAA,EAAG;AAElE,MAAA,IAAI,EAAA,EAAI,EAAA,EAAI,CAAA;AACZ,MAAA,MAAA,CAAO,EAAA,EAAI,CAAA,CAAE,OAAA,GAAU,UAAA,CAAW,IAAA,CAAK,CAAA,CAAE,CAAC,CAAC,CAAA,EAAG,CAAA,EAAA;AAC9C,MAAA,MAAM,KAAA,EAAO,CAAA,CAAE,KAAA,CAAM,EAAA,EAAI,CAAA,EAAG,CAAC,CAAA;AAC7B,MAAA,MAAM,SAAA,EAAW,EAAA,EAAI,CAAA,CAAE,OAAA,EAAS,CAAA,CAAE,CAAC,EAAA,EAAI,EAAA;AAGvC,MAAA,GAAA,CAAI,SAAA,IAAa,GAAA,EAAK;AACpB,QAAA,IAAA,GAAO,KAAA,EAAO,IAAA;AACd,QAAA,EAAA,EAAI,CAAA;AACJ,QAAA,QAAA;AAAA,MACF;AAGA,MAAA,IAAI,QAAA,EAAU,IAAA,CAAK,MAAA;AACnB,MAAA,GAAA,CAAI,CAAC,gBAAA,CAAiB,GAAA,CAAI,IAAI,EAAA,GAAK,IAAA,CAAK,OAAA,GAAU,CAAA,EAAG;AAEnD,QAAA,IAAA,CAAA,IAAS,IAAA,EAAM,IAAA,CAAK,OAAA,EAAS,CAAA,EAAG,IAAA,GAAO,CAAA,EAAG,GAAA,EAAA,EAAO;AAC/C,UAAA,GAAA,CAAI,gBAAA,CAAiB,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,GAAG,CAAC,CAAA,EAAG;AAC5C,YAAA,QAAA,EAAU,GAAA;AACV,YAAA,KAAA;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,MAAA,IAAA,GAAO,KAAA,EAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,OAAO,CAAA;AACnC,MAAA,GAAA,CAAI,QAAA,EAAU,IAAA,CAAK,MAAA,EAAQ;AACzB,QAAA,IAAA,GAAO,IAAA,EAAM,IAAA,CAAK,KAAA,CAAM,OAAO,CAAA;AAAA,MACjC;AACA,MAAA,EAAA,EAAI,CAAA;AAAA,IACN,EAAA,KAAO;AACL,MAAA,IAAA,GAAO,CAAA,CAAE,CAAC,CAAA;AACV,MAAA,CAAA,EAAA;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAcO,SAAS,gBAAA,CAAiB,CAAA,EAAoB;AACnD,EAAA,MAAM,EAAA,EAAI,CAAA,CAAE,IAAA,CAAK,CAAA;AACjB,EAAA,GAAA,CAAI,CAAA,CAAE,OAAA,IAAW,CAAA,EAAG,OAAO,IAAA;AAG3B,EAAA,MAAM,SAAA,EAAW,CAAA,CAAE,OAAA,CAAQ,SAAA,EAAW,EAAE,CAAA;AACxC,EAAA,GAAA,CAAI,QAAA,CAAS,OAAA,GAAU,CAAA,EAAG,OAAO,IAAA;AAGjC,EAAA,GAAA,CAAI,eAAA,CAAgB,IAAA,CAAK,CAAC,CAAA,EAAG,OAAO,IAAA;AAGpC,EAAA,GAAA,CACE,8FAAA,CAA+F,IAAA;AAAA,IAC7F;AAAA,EACF,CAAA;AAEA,IAAA,OAAO,IAAA;AAET,EAAA,MAAM,OAAA,EAAS,aAAA,CAAc,CAAC,CAAA;AAG9B,EAAA,GAAA,CAAI,MAAA,CAAO,OAAA,GAAU,CAAA,EAAG;AACtB,IAAA,MAAM,KAAA,kBAAO,IAAI,GAAA,CAAoB,CAAA;AACrC,IAAA,IAAA,CAAA,MAAW,IAAA,GAAO,MAAA,EAAQ,IAAA,CAAK,GAAA,CAAI,GAAA,EAAA,kBAAM,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,UAAK,GAAA,EAAA,EAAK,CAAC,CAAA;AAChE,IAAA,IAAI,SAAA,EAAW,CAAA;AACf,IAAA,IAAA,CAAA,MAAW,EAAA,GAAK,IAAA,CAAK,MAAA,CAAO,CAAA,EAAG,GAAA,CAAI,EAAA,EAAI,QAAA,EAAU,SAAA,EAAW,CAAA;AAC5D,IAAA,GAAA,CAAI,SAAA,GAAY,EAAA,GAAK,SAAA,EAAW,MAAA,CAAO,OAAA,GAAU,GAAA,EAAK,OAAO,IAAA;AAAA,EAC/D;AAIA,EAAA,GAAA,CAAI,MAAA,CAAO,OAAA,GAAU,EAAA,GAAK,MAAA,CAAO,OAAA,GAAU,CAAA,EAAG;AAC5C,IAAA,MAAM,WAAA,EAAa,MAAA,CAAO,IAAA;AAAA,MAAK,CAAC,GAAA,EAAA,GAC9B,cAAA,CAAe,IAAA,CAAK,GAAG,EAAA,GAAK,SAAA,CAAU,IAAA,CAAK,GAAG;AAAA,IAChD,CAAA;AACA,IAAA,GAAA,CAAI,CAAC,UAAA,EAAY,OAAO,IAAA;AAAA,EAC1B;AAKA,EAAA,GAAA,CAAI,iBAAA,CAAkB,CAAC,CAAA,EAAG,OAAO,IAAA;AAIjC,EAAA,GAAA,CAAI,CAAA,CAAE,QAAA,CAAS,UAAU,CAAA,EAAG,OAAO,IAAA;AAInC,EAAA,GAAA,CAAI,kBAAA,CAAmB,IAAA,CAAK,CAAA,CAAE,OAAA,CAAQ,WAAA,EAAa,EAAE,CAAC,CAAA,EAAG,OAAO,IAAA;AAIhE,EAAA,GAAA,CAAI,wBAAA,CAAyB,IAAA,CAAK,CAAC,CAAA,EAAG,OAAO,IAAA;AAC7C,EAAA,GAAA,CAAI,kCAAA,CAAmC,IAAA,CAAK,CAAC,CAAA,EAAG,OAAO,IAAA;AAIvD,EAAA,MAAM,SAAA,EAAW,CAAA,CAAE,KAAA,CAAM,mCAAmC,CAAA;AAC5D,EAAA,GAAA,CAAI,QAAA,EAAU;AACZ,IAAA,MAAM,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,CAAE,KAAA,CAAM,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,EAAA,GAAM,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA;AACvD,IAAA,GAAA,CAAI,IAAA,CAAK,OAAA,GAAU,CAAA,EAAG;AACpB,MAAA,MAAM,KAAA,kBAAO,IAAI,GAAA,CAAoB,CAAA;AACrC,MAAA,IAAA,CAAA,MAAW,EAAA,GAAK,IAAA,EAAM,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,CAAA,EAAA,kBAAI,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,UAAK,GAAA,EAAA,EAAK,CAAC,CAAA;AAC/D,MAAA,IAAA,CAAA,MAAW,CAAC,EAAE,CAAC,EAAA,GAAK,IAAA,EAAM;AACxB,QAAA,GAAA,CAAI,EAAA,GAAK,EAAA,GAAK,EAAA,EAAI,IAAA,CAAK,OAAA,GAAU,GAAA,EAAK,OAAO,IAAA;AAAA,MAC/C;AAAA,IACF;AAAA,EACF;AAKA,EAAA,GAAA,CAAI,0BAAA,CAA2B,IAAA,CAAK,CAAC,CAAA,EAAG,OAAO,IAAA;AAE/C,EAAA,GAAA,CAAI,sCAAA,CAAuC,IAAA,CAAK,CAAC,CAAA,EAAG,OAAO,IAAA;AAI3D,EAAA,GAAA,CAAI,+CAAA,CAAgD,IAAA,CAAK,CAAC,CAAA,EAAG;AAC3D,IAAA,MAAM,WAAA,EAAA,kBAAc,CAAA,CAAE,KAAA,CAAM,UAAU,CAAA,UAAK,CAAC,GAAA,CAAA,CAAG,MAAA;AAC/C,IAAA,GAAA,CAAI,WAAA,GAAc,CAAA,EAAG,OAAO,IAAA;AAAA,EAC9B;AAIA,EAAA,GAAA,CAAI,MAAA,CAAO,OAAA,GAAU,EAAA,EAAI;AACvB,IAAA,MAAM,YAAA,EAAA,kBAAe,CAAA,CAAE,KAAA,CAAM,aAAa,CAAA,UAAK,CAAC,GAAA,CAAA,CAAG,MAAA;AACnD,IAAA,GAAA,CAAI,YAAA,GAAe,CAAA,EAAG;AAEpB,MAAA,MAAM,YAAA,EAAc,aAAA,CAAc,IAAA,CAAK,CAAC,EAAA,GAAK,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA;AACxD,MAAA,GAAA,CAAI,CAAC,WAAA,EAAa,OAAO,IAAA;AAAA,IAC3B;AAAA,EACF;AAGA,EAAA,GAAA,CAAI,8CAAA,CAA+C,IAAA,CAAK,CAAC,CAAA,EAAG,OAAO,IAAA;AAInE,EAAA,GAAA,CAAI,6DAAA,CAA8D,IAAA,CAAK,CAAC,CAAA,EAAG,OAAO,IAAA;AAIlF,EAAA,GAAA,CAAI,8BAAA,CAA+B,IAAA,CAAK,CAAC,CAAA,EAAG,OAAO,IAAA;AAInD,EAAA,GAAA,CAAI,oBAAA,CAAqB,IAAA,CAAK,CAAC,EAAA,GAAK,CAAC,CAAA,CAAE,QAAA,CAAS,GAAG,CAAA,EAAG,OAAO,IAAA;AAG7D,EAAA,GAAA,CAAI,mBAAA,CAAoB,IAAA,CAAK,CAAC,EAAA,GAAA,kBAAM,CAAA,CAAE,KAAA,CAAM,cAAc,CAAA,UAAK,CAAC,GAAA,CAAA,CAAG,OAAA,GAAU,CAAA,EAAG,OAAO,IAAA;AAEvF,EAAA,OAAO,KAAA;AACT;AAWO,SAAS,iBAAA,CAAkB,CAAA,EAAoB;AACpD,EAAA,GAAA,CAAI,CAAA,CAAE,OAAA,EAAS,EAAA,EAAI,OAAO,KAAA;AAE1B,EAAA,IAAA,CAAA,IAAS,IAAA,EAAM,CAAA,EAAG,IAAA,GAAO,EAAA,EAAI,GAAA,EAAA,EAAO;AAElC,IAAA,GAAA,CAAI,IAAA,EAAM,EAAA,EAAI,CAAA,CAAE,MAAA,EAAQ,KAAA;AACxB,IAAA,MAAM,KAAA,kBAAO,IAAI,GAAA,CAAoB,CAAA;AACrC,IAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,GAAK,CAAA,CAAE,OAAA,EAAS,GAAA,EAAK,CAAA,EAAA,EAAK;AACxC,MAAA,MAAM,IAAA,EAAM,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,EAAA,EAAI,GAAG,CAAA;AAC9B,MAAA,GAAA,CAAI,CAAC,UAAA,CAAW,IAAA,CAAK,GAAG,CAAA,EAAG,QAAA;AAC3B,MAAA,IAAA,CAAK,GAAA,CAAI,GAAA,EAAA,kBAAM,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,UAAK,GAAA,EAAA,EAAK,CAAC,CAAA;AAAA,IACxC;AACA,IAAA,IAAA,CAAA,MAAW,CAAC,EAAE,KAAK,EAAA,GAAK,IAAA,EAAM;AAC5B,MAAA,GAAA,CAAI,MAAA,EAAQ,CAAA,EAAG,QAAA;AAGf,MAAA,GAAA,CAAK,MAAA,EAAQ,IAAA,EAAO,CAAA,CAAE,OAAA,GAAU,GAAA,EAAK,OAAO,IAAA;AAAA,IAC9C;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAMA,SAAS,aAAA,CAAc,CAAA,EAAqB;AAC1C,EAAA,MAAM,OAAA,EAAmB,CAAC,CAAA;AAC1B,EAAA,IAAI,EAAA,EAAI,CAAA;AACR,EAAA,MAAA,CAAO,EAAA,EAAI,CAAA,CAAE,MAAA,EAAQ;AACnB,IAAA,MAAM,EAAA,EAAI,CAAA,CAAE,CAAC,CAAA;AACb,IAAA,GAAA,CAAI,EAAA,IAAM,IAAA,EAAM;AACd,MAAA,IAAI,EAAA,EAAI,EAAA,EAAI,CAAA;AACZ,MAAA,MAAA,CAAO,EAAA,EAAI,CAAA,CAAE,OAAA,GAAU,UAAA,CAAW,IAAA,CAAK,CAAA,CAAE,CAAC,CAAC,CAAA,EAAG,CAAA,EAAA;AAC9C,MAAA,GAAA,CAAI,EAAA,IAAM,EAAA,EAAI,EAAA,GAAK,EAAA,EAAI,CAAA,CAAE,MAAA,EAAQ,CAAA,EAAA;AACjC,MAAA,MAAA,CAAO,IAAA,CAAK,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA;AACzB,MAAA,EAAA,EAAI,CAAA;AAAA,IACN,EAAA,KAAA,GAAA,CAAW,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,EAAG;AACvB,MAAA,CAAA,EAAA;AAAA,IACF,EAAA,KAAO;AACL,MAAA,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA;AACb,MAAA,CAAA,EAAA;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAaO,SAAS,uBAAA,CAAwB,CAAA,EAAmB;AAEzD,EAAA,MAAM,OAAA,EAAmB,CAAC,CAAA;AAC1B,EAAA,IAAI,EAAA,EAAI,CAAA;AACR,EAAA,MAAA,CAAO,EAAA,EAAI,CAAA,CAAE,MAAA,EAAQ;AACnB,IAAA,MAAM,EAAA,EAAI,CAAA,CAAE,CAAC,CAAA;AACb,IAAA,GAAA,CAAI,EAAA,IAAM,IAAA,EAAM;AACd,MAAA,IAAI,EAAA,EAAI,EAAA,EAAI,CAAA;AACZ,MAAA,MAAA,CAAO,EAAA,EAAI,CAAA,CAAE,OAAA,GAAU,UAAA,CAAW,IAAA,CAAK,CAAA,CAAE,CAAC,CAAC,CAAA,EAAG,CAAA,EAAA;AAC9C,MAAA,GAAA,CAAI,EAAA,IAAM,EAAA,EAAI,EAAA,GAAK,EAAA,EAAI,CAAA,CAAE,MAAA,EAAQ,CAAA,EAAA;AACjC,MAAA,MAAA,CAAO,IAAA,CAAK,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA;AACzB,MAAA,EAAA,EAAI,CAAA;AAAA,IACN,EAAA,KAAA,GAAA,CAAW,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,EAAG;AACvB,MAAA,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA;AACf,MAAA,CAAA,EAAA;AAAA,IACF,EAAA,KAAO;AACL,MAAA,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA;AACb,MAAA,CAAA,EAAA;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,IAAA,EAAgB,CAAC,CAAA;AACvB,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,MAAA,CAAO,MAAA,EAAQ,CAAA,EAAA,EAAK;AACtC,IAAA,GAAA,CAAI,MAAA,CAAO,CAAC,EAAA,IAAM,GAAA,EAAK;AACrB,MAAA,GAAA,CAAI,IAAA,CAAK,MAAA,CAAO,CAAC,CAAC,CAAA;AAClB,MAAA,QAAA;AAAA,IACF;AAGA,IAAA,IAAI,KAAA,EAAO,EAAA;AACX,IAAA,IAAA,CAAA,IAAS,EAAA,EAAI,EAAA,EAAI,CAAA,EAAG,EAAA,GAAK,CAAA,EAAG,CAAA,EAAA,EAAK;AAC/B,MAAA,GAAA,CAAI,MAAA,CAAO,CAAC,EAAA,IAAM,GAAA,EAAK;AACrB,QAAA,KAAA,EAAO,MAAA,CAAO,CAAC,CAAA;AACf,QAAA,KAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,KAAA,EAAO,EAAA;AACX,IAAA,IAAA,CAAA,IAAS,EAAA,EAAI,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,MAAA,CAAO,MAAA,EAAQ,CAAA,EAAA,EAAK;AAC1C,MAAA,GAAA,CAAI,MAAA,CAAO,CAAC,EAAA,IAAM,GAAA,EAAK;AACrB,QAAA,KAAA,EAAO,MAAA,CAAO,CAAC,CAAA;AACf,QAAA,KAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,MAAM,UAAA,EAAY,eAAA,CAAgB,IAAA,CAAK,IAAI,CAAA;AAC3C,IAAA,MAAM,YAAA,EAAc,YAAA,CAAa,IAAA,CAAK,IAAI,CAAA;AAC1C,IAAA,GAAA,CAAI,UAAA,GAAa,WAAA,EAAa;AAE5B,MAAA,GAAA,CAAI,GAAA,CAAI,OAAA,IAAW,EAAA,GAAK,GAAA,CAAI,GAAA,CAAI,OAAA,EAAS,CAAC,EAAA,IAAM,GAAA,EAAK;AACnD,QAAA,GAAA,CAAI,IAAA,CAAK,GAAG,CAAA;AAAA,MACd;AAAA,IACF;AAAA,EAEF;AAGA,EAAA,MAAA,CAAO,GAAA,CAAI,OAAA,EAAS,EAAA,GAAK,GAAA,CAAI,CAAC,EAAA,IAAM,GAAA,EAAK,GAAA,CAAI,KAAA,CAAM,CAAA;AACnD,EAAA,MAAA,CAAO,GAAA,CAAI,OAAA,EAAS,EAAA,GAAK,GAAA,CAAI,GAAA,CAAI,OAAA,EAAS,CAAC,EAAA,IAAM,GAAA,EAAK,GAAA,CAAI,GAAA,CAAI,CAAA;AAE9D,EAAA,OAAO,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AACpB;ADQA;AACA;AEzcA,IAAM,aAAA,EAAe,GAAA;AACrB,IAAM,gBAAA,EAAkB,CAAA;AACxB,IAAM,aAAA,EAAe,EAAA,EAAI,eAAA;AAEzB,IAAM,gBAAA,EAAkB,GAAA;AAExB,IAAM,iBAAA,EAAmB,GAAA;AACzB,IAAM,kBAAA,EAAoB,IAAA;AAE1B,IAAM,aAAA,EAAe,EAAA;AACrB,IAAM,UAAA,EAAY,IAAA,EAAM,GAAA;AAexB,MAAA,SAAsB,oBAAA,CACpB,OAAA,EACA,KAAA,EACA,GAAA,EACyC;AACzC,EAAA,MAAM,EAAE,KAAA,EAAO,IAAA,EAAM,IAAA,EAAM,OAAO,EAAA,EAAI,SAAA,CAAU,KAAA,EAAO,YAAY,CAAA;AAEnE,EAAA,MAAM,MAAA,EAAQ,IAAI,GAAA,CAAI,MAAA,CAAO,SAAA,EAAW,MAAA,EAAQ,CAAC,CAAA,EAAG,CAAA,EAAG,YAAA,EAAc,YAAY,CAAC,CAAA;AAClF,EAAA,MAAM,MAAA,EAAgC,EAAE,MAAA,EAAQ,MAAM,CAAA;AACtD,EAAA,MAAM,QAAA,EAAU,MAAM,OAAA,CAAQ,GAAA,CAAI,KAAK,CAAA;AAEvC,EAAA,MAAM,SAAA,EAAW,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA,CAAE,CAAC,CAAA;AACvC,EAAA,MAAM,IAAA,EAAM,OAAA,CAAQ,QAAQ,CAAA;AAC5B,EAAA,GAAA,CAAI,CAAC,IAAA,GAAO,GAAA,CAAI,KAAA,IAAS,SAAA,EAAW;AAClC,IAAA,MAAM,IAAI,KAAA,CAAM,qEAAwB,CAAA;AAAA,EAC1C;AAEA,EAAA,MAAM,QAAA,EAAU,GAAA,CAAI,IAAA;AACpB,EAAA,GAAA,CAAI,OAAA,CAAQ,OAAA,IAAW,CAAA,EAAG;AACxB,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,2DAAA,EAAsB,OAAA,CAAQ,MAAM,CAAA,GAAA,EAAM,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,EAChF;AACA,EAAA,MAAM,SAAA,EAAW,OAAA,CAAQ,CAAC,CAAA;AAC1B,EAAA,MAAM,QAAA,EAAU,OAAA,CAAQ,CAAC,CAAA;AACzB,EAAA,GAAA,CAAI,SAAA,IAAa,YAAA,EAAc;AAC7B,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,qCAAA,EAAe,YAAY,CAAA,eAAA,EAAQ,QAAQ,CAAA,CAAA;AAC7D,EAAA;AAC0B,EAAA;AAET,EAAA;AACmB,EAAA;AAEF,EAAA;AACf,IAAA;AACU,IAAA;AACG,IAAA;AACA,IAAA;AAEhB,IAAA;AACE,IAAA;AAC0B,IAAA;AACJ,MAAA;AACjB,MAAA;AACL,QAAA;AACF,QAAA;AACZ,MAAA;AACF,IAAA;AAEqD,IAAA;AAC1B,IAAA;AAGI,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAEE,IAAA;AACC,IAAA;AACD,IAAA;AACC,IAAA;AAEF,IAAA;AAEU,IAAA;AAE1B,IAAA;AACd,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACkC,MAAA;AAC3B,MAAA;AACR,IAAA;AACH,EAAA;AAG8B,EAAA;AAC6B,EAAA;AACF,IAAA;AACZ,IAAA;AAC7C,EAAA;AAG8C,EAAA;AAEtB,EAAA;AACyB,IAAA;AACvC,IAAA;AACC,IAAA;AACT,EAAA;AACJ;AAauE;AACrD,EAAA;AACA,EAAA;AAC6B,EAAA;AACC,EAAA;AACA,EAAA;AACf,EAAA;AACA,EAAA;AACH,EAAA;AACA,EAAA;AAEjB,EAAA;AACgC,EAAA;AACtB,EAAA;AAKH,EAAA;AACC,EAAA;AACA,EAAA;AAEY,EAAA;AACoC,IAAA;AAClC,IAAA;AACoC,MAAA;AAC/B,MAAA;AACd,MAAA;AACI,MAAA;AACA,MAAA;AAET,MAAA;AACA,MAAA;AACO,MAAA;AACJ,MAAA;AACU,MAAA;AACI,MAAA;AAClC,IAAA;AACF,EAAA;AAEmC,EAAA;AACrC;AAE0E;AACd,EAAA;AAC5B,EAAA;AACH,EAAA;AACd,IAAA;AACW,IAAA;AACa,MAAA;AACxB,QAAA;AACP,QAAA;AACF,MAAA;AACF,IAAA;AACwB,IAAA;AAC1B,EAAA;AACO,EAAA;AACT;AAKU;AACsB,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACI,EAAA;AACA,EAAA;AACX,EAAA;AACyC,EAAA;AACA,EAAA;AAClC,EAAA;AACE,EAAA;AAClC;AAE0D;AACrC,EAAA;AACA,EAAA;AACZ,EAAA;AACT;AF0YmG;AACA;AGxlB9E;AACE;AACI;AACR;AACA;AAgBA;AAC+B,EAAA;AACH,EAAA;AAE0C,EAAA;AAC1B,EAAA;AAGmB,EAAA;AACjD,EAAA;AACiB,EAAA;AACX,IAAA;AACrC,EAAA;AAC0B,EAAA;AACA,EAAA;AACmC,IAAA;AAC7D,EAAA;AACwB,EAAA;AACG,EAAA;AACO,EAAA;AAC0C,IAAA;AAC5E,EAAA;AAC0B,EAAA;AAGU,EAAA;AAEkB,EAAA;AAC9B,IAAA;AACwC,IAAA;AACD,IAAA;AAGrB,IAAA;AACmC,IAAA;AAE1C,IAAA;AACpB,MAAA;AACY,MAAA;AACxB,IAAA;AAG8E,IAAA;AAC3C,IAAA;AACkB,IAAA;AACb,MAAA;AACzC,IAAA;AAC0B,IAAA;AACH,IAAA;AACmC,MAAA;AAC1D,IAAA;AACqB,IAAA;AACD,IAAA;AACY,IAAA;AAGE,IAAA;AACrB,IAAA;AACC,IAAA;AACkB,IAAA;AACO,MAAA;AAClB,MAAA;AACP,QAAA;AACD,QAAA;AACX,MAAA;AACF,IAAA;AACkB,IAAA;AACS,IAAA;AAC7B,EAAA;AAGwB,EAAA;AACgB,EAAA;AACpB,IAAA;AACI,IAAA;AACA,IAAA;AACX,IAAA;AACA,IAAA;AACb,EAAA;AAGgE,EAAA;AACrC,EAAA;AAC7B;AAQ+E;AAClE,EAAA;AAC6B,EAAA;AACS,EAAA;AAGpB,EAAA;AACmD,IAAA;AACjD,IAAA;AACmD,MAAA;AAC5C,MAAA;AACd,MAAA;AACI,MAAA;AACA,MAAA;AAEH,MAAA;AACE,MAAA;AACU,MAAA;AACI,MAAA;AACvC,IAAA;AACF,EAAA;AACO,EAAA;AACT;AHgjBmG;AACA;AIzqB9E;AAGA;AA6BQ;AACnB,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAWL,EAAA;AACgB,IAAA;AACI,IAAA;AACA,IAAA;AACE,IAAA;AACN,IAAA;AACE,IAAA;AACC,IAAA;AACF,IAAA;AACpB,EAAA;AAAA;AAAA;AAAA;AAAA;AAMgF,EAAA;AAC/B,IAAA;AACpB,MAAA;AACwB,MAAA;AACR,MAAA;AAC3C,IAAA;AAEkE,IAAA;AAChE,MAAA;AACE,QAAA;AAC+B,QAAA;AACjC,MAAA;AACA,MAAA;AACE,QAAA;AACoB,QAAA;AACtB,MAAA;AACA,MAAA;AACE,QAAA;AACwC,QAAA;AAC1C,MAAA;AACA,MAAA;AACE,QAAA;AAC6B,QAAA;AAC/B,MAAA;AACD,IAAA;AAEgB,IAAA;AAIW,IAAA;AAEU,IAAA;AACY,IAAA;AACQ,IAAA;AACA,IAAA;AACJ,IAAA;AAE0B,IAAA;AACtD,MAAA;AACE,MAAA;AAC5B,IAAA;AAGkD,IAAA;AACG,MAAA;AACA,MAAA;AACA,MAAA;AACpD,IAAA;AAI8C,IAAA;AACkB,IAAA;AACpC,IAAA;AAIyB,IAAA;AAEJ,IAAA;AAEvB,IAAA;AACzB,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACK,MAAA;AACE,MAAA;AACP,MAAA;AACA,MAAA;AACD,IAAA;AACH,EAAA;AAAA;AAG+B,EAAA;AAEzB,IAAA;AACkB,MAAA;AACd,IAAA;AAER,IAAA;AACF,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAYgC,EAAA;AAC4C,IAAA;AACX,IAAA;AAC3D,IAAA;AACkC,MAAA;AACJ,MAAA;AAGD,QAAA;AACc,QAAA;AAEA,wBAAA;AAEvC,QAAA;AACmB,UAAA;AACU,YAAA;AACnB,YAAA;AACuD,YAAA;AACnE,UAAA;AAC6B,UAAA;AACnB,QAAA;AAEK,UAAA;AACmD,YAAA;AAAA;AAClE,UAAA;AACF,QAAA;AACF,MAAA;AACO,MAAA;AACP,IAAA;AACY,MAAA;AACd,IAAA;AACF,EAAA;AAKqC,EAAA;AACiD,IAAA;AAE7D,IAAA;AACY,IAAA;AAChB,MAAA;AAC0B,MAAA;AAElC,QAAA;AACT,MAAA;AACD,IAAA;AAE6C,IAAA;AAClB,IAAA;AAEsC,IAAA;AAGO,IAAA;AAC9C,IAAA;AACoE,MAAA;AAC/F,IAAA;AAE4D,IAAA;AAC1B,IAAA;AAGV,IAAA;AACsB,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AAC5B,MAAA;AACA,MAAA;AACM,MAAA;AAGiB,MAAA;AACK,QAAA;AAIhC,MAAA;AAE0E,MAAA;AAE1E,MAAA;AACR,MAAA;AACY,QAAA;AACZ,UAAA;AACgB,YAAA;AACA,YAAA;AACE,YAAA;AACN,YAAA;AACZ,UAAA;AACA,UAAA;AACF,QAAA;AACU,MAAA;AACK,QAAA;AACsF,UAAA;AAAO;AAC5G,QAAA;AACQ,QAAA;AACV,MAAA;AAE4B,MAAA;AAC9B,IAAA;AAEO,IAAA;AACL,MAAA;AACe,MAAA;AACC,MAAA;AAChB,MAAA;AACA,MAAA;AACA,MAAA;AACF,IAAA;AACF,EAAA;AACF;AAEgF;AAC1E,EAAA;AACkB,IAAA;AACV,EAAA;AACA,IAAA;AACmC,MAAA;AAE7C,IAAA;AACF,EAAA;AACF;AAEwF;AAGlE,EAAA;AAAE,EAAA;AAClB,EAAA;AACA,EAAA;AACwB,IAAA;AACxB,MAAA;AACkC,MAAA;AACmB,QAAA;AACpD,MAAA;AACF,IAAA;AACD,EAAA;AAC6B,IAAA;AAC/B,EAAA;AACF;AAGkD;AACV,EAAA;AACG,EAAA;AACpB,IAAA;AACI,IAAA;AACJ,IAAA;AACI,IAAA;AACzB,EAAA;AACO,EAAA;AACT;AJ0kBmG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"/Users/mong-e/workspace/kordoc/dist/formula-CG4S7TWO.cjs","sourcesContent":[null,"/**\n * LaTeX 후처리 — Pix2Text `latex_ocr.py` 의 post_process 간소화 + 자체 필터\n *\n * 1) 후행 whitespace command 제거 (\\, \\: \\; \\! \\quad \\qquad \\enspace \\thinspace \\ )\n * 2) 연속 공백 → 1개\n * 3) 빈 그룹 반복 제거 (^{} _{} \\hat{} \\bar{} \\vec{} 등)\n * 4) \\cmd 뒤 영문자 공백 분리 (\\cdotd → \\cdot d, \\timesd → \\times d)\n * 5) isTrivialFormula — 다이어그램 단일 글자/반복/장식 오탐 제거\n */\n\nconst TRAILING_WHITESPACE_CMDS = [\n  \"\\\\,\",\n  \"\\\\:\",\n  \"\\\\;\",\n  \"\\\\!\",\n  \"\\\\ \",\n  \"\\\\quad\",\n  \"\\\\qquad\",\n  \"\\\\enspace\",\n  \"\\\\thinspace\",\n] as const\n\nexport function postProcessLatex(latex: string): string {\n  let s = stripTrailingWhitespace(latex)\n  s = collapseSpaces(s)\n  for (let i = 0; i < 10; i++) {\n    const next = stripEmptyGroups(s)\n    if (next === s) break\n    s = next\n  }\n  s = fixLatexSpacing(s)\n  s = normalizeFormulaSpacing(s)\n  s = s.trim()\n  // trivial 이면 빈 문자열 반환 — 상위(pipeline/parser) 에서 latex.trim() 비었을 때 skip.\n  if (isTrivialFormula(s)) return \"\"\n  return s\n}\n\nexport function stripTrailingWhitespace(s: string): string {\n  let t = s\n  // 바깥 loop: 한 번 제거 후 다시 체크 (중첩 \"\\\\, \\\\quad\" 같은 경우)\n  for (;;) {\n    const trimmed = t.replace(/[\\s]+$/, \"\")\n    let changed = false\n    for (const p of TRAILING_WHITESPACE_CMDS) {\n      if (trimmed.endsWith(p)) {\n        t = trimmed.slice(0, trimmed.length - p.length)\n        changed = true\n        break\n      }\n    }\n    if (!changed) return trimmed\n  }\n}\n\nexport function collapseSpaces(s: string): string {\n  let out = \"\"\n  let prevSpace = false\n  for (const c of s) {\n    if (/\\s/.test(c)) {\n      if (!prevSpace) {\n        out += \" \"\n        prevSpace = true\n      }\n    } else {\n      out += c\n      prevSpace = false\n    }\n  }\n  return out\n}\n\n/**\n * 빈 그룹 `{}` 또는 `{\\s+}` 를 찾아 선행하는 `^`, `_`, 또는 `\\cmd` 와 함께 제거.\n */\nexport function stripEmptyGroups(s: string): string {\n  let out = \"\"\n  let i = 0\n  const bytes = s\n  while (i < bytes.length) {\n    const ch = bytes[i]\n    if (ch === \"{\") {\n      // 빈 { \\s* } 스캔\n      let j = i + 1\n      while (j < bytes.length && /\\s/.test(bytes[j])) j++\n      if (j < bytes.length && bytes[j] === \"}\") {\n        // 앞쪽 공백 제거\n        while (out.endsWith(\" \") || out.endsWith(\"\\t\")) {\n          out = out.slice(0, -1)\n        }\n        if (out.endsWith(\"^\") || out.endsWith(\"_\")) {\n          out = out.slice(0, -1)\n        } else {\n          // \\cmd 형태인지 탐색\n          let k = out.length\n          while (k > 0 && /[A-Za-z]/.test(out[k - 1])) k--\n          if (k > 0 && out[k - 1] === \"\\\\\" && k < out.length) {\n            out = out.slice(0, k - 1)\n          }\n          // 아니면 아무것도 안 함 — 빈 {} 만 제거\n        }\n        i = j + 1\n        continue\n      }\n    }\n    out += ch\n    i++\n  }\n  return out\n}\n\n/**\n * LaTeX 명령어 화이트리스트 — 공백 누락 감지에 사용.\n * MFR 이 `\\cdot d` 를 `\\cdotd` 로 합쳐 출력할 때, 어느 지점에서 명령어가 끝나는지\n * 알려진 커맨드명으로 판단한다. 완전한 리스트는 아니며 OCR 에서 실제 관찰된 케이스 중심.\n */\nconst KNOWN_LATEX_CMDS: ReadonlySet<string> = new Set([\n  // 연산자\n  \"cdot\", \"cdots\", \"ldots\", \"dots\", \"vdots\", \"ddots\",\n  \"times\", \"div\", \"pm\", \"mp\", \"ast\", \"star\", \"circ\", \"bullet\",\n  \"oplus\", \"ominus\", \"otimes\", \"odot\",\n  // 관계\n  \"approx\", \"equiv\", \"neq\", \"ne\", \"sim\", \"simeq\", \"cong\",\n  \"leq\", \"geq\", \"le\", \"ge\", \"ll\", \"gg\", \"prec\", \"succ\", \"preceq\", \"succeq\",\n  \"propto\", \"parallel\", \"perp\",\n  // 집합/논리\n  \"in\", \"notin\", \"ni\", \"subset\", \"supset\", \"subseteq\", \"supseteq\",\n  \"cap\", \"cup\", \"bigcap\", \"bigcup\", \"emptyset\", \"varnothing\",\n  \"forall\", \"exists\", \"nexists\", \"neg\", \"lnot\", \"land\", \"lor\", \"vee\", \"wedge\",\n  // 그리스 소문자\n  \"alpha\", \"beta\", \"gamma\", \"delta\", \"epsilon\", \"varepsilon\",\n  \"zeta\", \"eta\", \"theta\", \"vartheta\", \"iota\", \"kappa\", \"lambda\",\n  \"mu\", \"nu\", \"xi\", \"omicron\", \"pi\", \"varpi\", \"rho\", \"varrho\",\n  \"sigma\", \"varsigma\", \"tau\", \"upsilon\", \"phi\", \"varphi\",\n  \"chi\", \"psi\", \"omega\",\n  // 그리스 대문자\n  \"Gamma\", \"Delta\", \"Theta\", \"Lambda\", \"Xi\", \"Pi\", \"Sigma\",\n  \"Upsilon\", \"Phi\", \"Psi\", \"Omega\",\n  // 화살표\n  \"to\", \"gets\", \"mapsto\", \"rightarrow\", \"leftarrow\", \"leftrightarrow\",\n  \"Rightarrow\", \"Leftarrow\", \"Leftrightarrow\", \"uparrow\", \"downarrow\",\n  \"longrightarrow\", \"longleftarrow\", \"longmapsto\",\n  // 큰 연산자\n  \"sum\", \"prod\", \"coprod\", \"int\", \"iint\", \"iiint\", \"oint\", \"bigoplus\", \"bigotimes\",\n  // 함수명\n  \"sin\", \"cos\", \"tan\", \"sec\", \"csc\", \"cot\",\n  \"arcsin\", \"arccos\", \"arctan\", \"sinh\", \"cosh\", \"tanh\",\n  \"log\", \"ln\", \"lg\", \"exp\", \"lim\", \"liminf\", \"limsup\",\n  \"sup\", \"inf\", \"max\", \"min\", \"arg\", \"det\", \"dim\", \"gcd\", \"deg\", \"hom\", \"ker\", \"mod\",\n  // 특수 기호/수식\n  \"infty\", \"partial\", \"nabla\", \"prime\", \"aleph\", \"ell\", \"hbar\", \"Re\", \"Im\",\n  \"top\", \"bot\", \"angle\", \"vdash\", \"dashv\",\n  // 기타\n  \"left\", \"right\", \"big\", \"Big\", \"bigg\", \"Bigg\",\n])\n\n/**\n * `\\cmd` 뒤에 영문자가 바로 붙으면 공백 분리 (e.g. `\\cdotd` → `\\cdot d`, `\\timesd_{k}` → `\\times d_{k}`).\n *\n * MFR 이 좁은 영역에서 가끔 `\\cdot` 과 다음 변수 사이 공백을 누락. 그대로 두면 LaTeX 파서가\n * `\\cdotd` 를 undefined command 로 처리 (KaTeX: 에러 / TeX: 정의되지 않은 제어 시퀀스).\n * 알려진 LaTeX 명령어 prefix 중 가장 긴 것을 찾아 분할하면 렌더 안정성 확보.\n *\n * `\\cmd{..}` (영문자 뒤 `{`) 는 인자 포함 형태로 간주해 분리하지 않음.\n */\nexport function fixLatexSpacing(s: string): string {\n  let out = \"\"\n  let i = 0\n  while (i < s.length) {\n    if (s[i] === \"\\\\\" && i + 1 < s.length && /[A-Za-z]/.test(s[i + 1])) {\n      // \\cmd 최장일치\n      let j = i + 1\n      while (j < s.length && /[A-Za-z]/.test(s[j])) j++\n      const full = s.slice(i + 1, j) // 명령어 이름 (앞 \\ 제거)\n      const nextChar = j < s.length ? s[j] : \"\"\n\n      // \\cmd{..} 형태 — 인자로 이어지므로 분리하지 않음\n      if (nextChar === \"{\") {\n        out += \"\\\\\" + full\n        i = j\n        continue\n      }\n\n      // 자체가 알려진 명령어이거나, 긴 prefix 가 없으면 그대로\n      let splitAt = full.length\n      if (!KNOWN_LATEX_CMDS.has(full) && full.length >= 3) {\n        // 뒤에서부터 prefix 길이를 줄이며 가장 긴 known cmd 찾기\n        for (let len = full.length - 1; len >= 2; len--) {\n          if (KNOWN_LATEX_CMDS.has(full.slice(0, len))) {\n            splitAt = len\n            break\n          }\n        }\n      }\n\n      out += \"\\\\\" + full.slice(0, splitAt)\n      if (splitAt < full.length) {\n        out += \" \" + full.slice(splitAt)\n      }\n      i = j\n    } else {\n      out += s[i]\n      i++\n    }\n  }\n  return out\n}\n\n/**\n * trivial(noise) 수식 판정.\n *\n * true 인 케이스 (MFD 오탐 주범):\n *   1) 공백/중괄호 제거 후 2자 이하 (e.g. `O`, `a`, `.`, `n`)\n *   2) 단일 `\\cmd` (e.g. `\\imath`, `\\pi`, `\\eta`, `\\sigma`, `\\theta`, `\\emptyset`, `\\varPi`)\n *   3) 단일 `\\mathrm{..}` / `\\textrm{..}` / `\\operatorname{..}` 류 + 짧은 내용 (e.g. `\\mathrm{fcloc}`)\n *   4) 동일 토큰이 3회 이상 + 전체의 50% 이상 (e.g. `\\pm \\pm \\pm \\pm`, `\\cap \\exists \\exists \\rceil`)\n *\n * false 유지 (의미 있는 수식):\n *   `O(1)`, `d_{k}=64`, `\\sqrt{d_{k}}`, `PE_{pos+k}`, 등\n */\nexport function isTrivialFormula(s: string): boolean {\n  const t = s.trim()\n  if (t.length === 0) return true\n\n  // 1) 공백/중괄호 제거 후 길이 ≤ 2\n  const stripped = t.replace(/[\\s{}]/g, \"\")\n  if (stripped.length <= 2) return true\n\n  // 2) 단일 \\cmd (e.g. \\imath, \\varPi, \\pi)\n  if (/^\\\\[A-Za-z]+$/.test(t)) return true\n\n  // 3) 단일 \\mathrm{..} / \\textrm{..} / \\operatorname{..} / \\mathit{..} / \\mathbf{..} / \\mathcal{..} + 짧은 내용\n  if (\n    /^\\\\(?:mathrm|textrm|text|operatorname|mathit|mathbf|mathcal|mathsf|mathtt)\\{[A-Za-z]{1,6}\\}$/.test(\n      t,\n    )\n  )\n    return true\n\n  const tokens = tokenizeLatex(t)\n\n  // 4) 반복 토큰 dominant (e.g. \"\\\\pm \\\\pm \\\\pm \\\\pm\")\n  if (tokens.length >= 3) {\n    const freq = new Map<string, number>()\n    for (const tok of tokens) freq.set(tok, (freq.get(tok) ?? 0) + 1)\n    let maxCount = 0\n    for (const c of freq.values()) if (c > maxCount) maxCount = c\n    if (maxCount >= 3 && maxCount / tokens.length >= 0.5) return true\n  }\n\n  // 5) 심볼만 구성된 짧은 식 — 토큰 2~4개이고 연산자/숫자 없음 (e.g. \"\\\\cap \\\\exists \\\\exists \\\\rceil\")\n  //    의미 있는 수식은 대개 `=` 또는 숫자가 포함됨. 허용되는 연산자: = + - / * < > 숫자\n  if (tokens.length >= 2 && tokens.length <= 4) {\n    const hasOpOrNum = tokens.some((tok) =>\n      /^[=+\\-/*<>]$/.test(tok) || /^[0-9]$/.test(tok),\n    )\n    if (!hasOpOrNum) return true\n  }\n\n  // 6) substring 반복 패턴 — 동일 5~15자 substring 이 3회 이상 + 커버리지 60%+\n  //    (e.g. \"\\\\alpha_{1}=\\\\alpha_{2}=\\\\alpha_{3}=...\" 의 `\\\\alpha_{` 반복,\n  //           \"c_{c}^{\\\\prime}\\\\phi_{c}^{\\\\prime}=c_{c}^{\\\\prime}...\" 의 `c_{c}^{\\\\prime}` 반복)\n  if (hasHighRepetition(t)) return true\n\n  // 7) MFR placeholder 인 `\\square` 포함 — 인식 실패 영역을 `\\square` 로 대체하는 특성\n  //    정당한 수식에 `\\square` 가 나오는 경우는 거의 없음 (대부분 `\\Box`, `\\blacksquare` 등 사용)\n  if (t.includes(\"\\\\square\")) return true\n\n  // 8) 단독 숫자/실수 (e.g. \"$1.0$\", \"$42$\", \"$-3.14$\")\n  //    공백/중괄호/백슬래시 제거 후 순수 숫자/부호/소수점만 남으면 trivial\n  if (/^[-+]?\\d+\\.?\\d*$/.test(t.replace(/[\\s{}\\\\]/g, \"\"))) return true\n\n  // 9) `(X)(X)` 또는 `{X}{X}` 연속 중복 — 동일 그룹 반복 (e.g. \"$C(T_{2})(T_{2})$\")\n  //    한 단계 중첩 허용: `{k_{c}}` 같이 내부에 `{...}` 하나 포함 가능.\n  if (/(\\([^()]{2,15}\\))\\s*\\1/.test(t)) return true\n  if (/(\\{(?:[^{}]|\\{[^{}]*\\})+\\})\\s*\\1/.test(t)) return true\n\n  // 10) 동일 인자 반복 — 괄호 인자 중 쉼표 구분 3개 중 2개 이상 동일 (e.g. `C(\\tau_{2},\\mu^{\\prime},\\mu^{\\prime})`)\n  //     완전 일치 인자가 2회+ 반복이면 OCR 반복 오류로 간주\n  const argMatch = t.match(/^[A-Za-z\\\\][A-Za-z]*\\(([^()]+)\\)$/)\n  if (argMatch) {\n    const args = argMatch[1].split(\",\").map((a) => a.trim())\n    if (args.length >= 2) {\n      const freq = new Map<string, number>()\n      for (const a of args) if (a) freq.set(a, (freq.get(a) ?? 0) + 1)\n      for (const [, c] of freq) {\n        if (c >= 2 && c / args.length >= 0.5) return true\n      }\n    }\n  }\n\n  // 11) X/X 또는 \\frac{X}{X} — 분자=분모 = 1, 의미 없는 수식\n  //     수식 **어디에나** 나타나면 trivial (e.g. \"$k<\\\\frac{\\\\eta}{\\\\eta}$\" 도 포함)\n  //     정당한 수식에서 $\\\\frac{a}{a}$ 를 쓰는 경우는 거의 없음 (대수적으로 1).\n  if (/\\\\frac\\{([^{}]+)\\}\\{\\1\\}/.test(t)) return true\n  // X/X 꼴 (단일 변수 또는 \\cmd)\n  if (/(\\\\[A-Za-z]+|\\b[A-Za-z])\\s*\\/\\s*\\1\\b/.test(t)) return true\n\n  // 12) `\\begin{matrix}` 내부 `\\cdots` 여러 번 — MFR 이 다이어그램/표를 matrix 로 오인식\n  //     본문 수식의 matrix 는 구체적 원소가 있어 `\\cdots` 가 2회 이상 나오는 경우 거의 없음\n  if (/\\\\begin\\{(?:matrix|pmatrix|bmatrix|vmatrix)\\}/.test(t)) {\n    const cdotsCount = (t.match(/\\\\cdots/g) ?? []).length\n    if (cdotsCount >= 2) return true\n  }\n\n  // 13) 다이어그램 텍스트 레이블 — `\\mathrm{word}` 가 2회+ 포함된 짧은 식 (토큰 수 ≤ 12)\n  //     또는 `[a-z]{1,3}_\\{\\mathrm{word}\\}` 꼴의 비정상 변수명 (e.g. `cl_{\\mathrm{model}}`)\n  if (tokens.length <= 12) {\n    const mathrmCount = (t.match(/\\\\mathrm\\{/g) ?? []).length\n    if (mathrmCount >= 2) {\n      // 연산자/등호/숫자가 거의 없어 \"단순 레이블\" 로 보이는지 추가 확인\n      const hasRealMath = /[=+\\-*/<>^]/.test(t) && /\\d/.test(t)\n      if (!hasRealMath) return true\n    }\n  }\n  // 비정상 변수명: 2-3자 영문 접두 + _{\\mathrm{긴단어}} 단독 (e.g. `cl_{\\mathrm{model}}`, `to_{\\mathrm{max}}`)\n  // 정상 변수명은 보통 단일 문자 (`d_{\\mathrm{model}}`, `W_{i}`) — 2자 이상이면 다이어그램 오인식\n  if (/^[a-zA-Z]{2,3}_\\{\\\\mathrm\\{[a-zA-Z]{3,}\\}\\}$/.test(t)) return true\n\n  // 14) `\\mathrm{word}` + 이항 연산자 + single 요소 꼴 — 다이어그램 \"word → value\" 레이블\n  //     (e.g. `\\mathrm{to}-\\infty`, `\\mathrm{to}+\\infty`)\n  if (/^\\\\mathrm\\{[a-z]{2,}\\}[-+][-+]?(?:\\\\[a-zA-Z]+|[a-zA-Z0-9])$/.test(t)) return true\n\n  // 15) `\\mathsf`, `\\mathtt`, `\\texttt` 는 본문 수식에 거의 쓰이지 않고 다이어그램 타이포그래피 오인식이 대부분\n  //     — 포함만으로 trivial (e.g. `\\mathtt{Welgnt}`, `\\mathsf{Tr}_{s}`, `\\texttt{wg}`)\n  if (/\\\\(?:mathsf|mathtt|texttt)\\{/.test(t)) return true\n\n  // 16) `\\begin{aligned}` 이지만 `=` 없음 — 정당한 aligned 는 항상 등호 포함 (여러 줄 equation)\n  //     등호 없으면 OCR garbage 조합\n  if (/\\\\begin\\{aligned\\}/.test(t) && !t.includes(\"=\")) return true\n\n  // 17) `\\begin{matrix}` + `\\downarrow` 2회+ — 네트워크 architecture 다이어그램 오인식\n  if (/\\\\begin\\{matrix\\}/.test(t) && (t.match(/\\\\downarrow/g) ?? []).length >= 2) return true\n\n  return false\n}\n\n/**\n * substring 반복 탐지 — 동일한 N자 substring 이 3회 이상 나타나고\n * 그 반복 총 길이가 전체의 60% 이상이면 true.\n *\n * 5~15자 범위만 검사 (짧으면 정상 수식의 `^{2}` 같은 패턴도 걸림, 길면 노이즈 거의 없음).\n * 영문자 포함 substring 만 검사 (구두점만 반복은 정상 수식에도 많음).\n *\n * 정당한 수식은 다양한 구조로 거의 겹치지 않아 false-positive 낮음.\n */\nexport function hasHighRepetition(s: string): boolean {\n  if (s.length < 15) return false\n\n  for (let len = 5; len <= 15; len++) {\n    // substring 길이 × 3회가 전체보다 길면 의미 없음\n    if (len * 3 > s.length) break\n    const seen = new Map<string, number>()\n    for (let i = 0; i <= s.length - len; i++) {\n      const sub = s.slice(i, i + len)\n      if (!/[a-zA-Z]/.test(sub)) continue\n      seen.set(sub, (seen.get(sub) ?? 0) + 1)\n    }\n    for (const [, count] of seen) {\n      if (count < 3) continue\n      // 겹치지 않는 점유율 추정: count*len (overlapping 포함이라 약간 과대)\n      // 보수적 판정 위해 최소 3회 + 60% 커버리지\n      if ((count * len) / s.length >= 0.6) return true\n    }\n  }\n  return false\n}\n\n/**\n * LaTeX 를 단순 토큰 배열로 분할 — `\\cmd` 는 하나의 토큰, 그 외는 non-space 단일 문자.\n * isTrivialFormula 의 반복 감지용.\n */\nfunction tokenizeLatex(s: string): string[] {\n  const result: string[] = []\n  let i = 0\n  while (i < s.length) {\n    const c = s[i]\n    if (c === \"\\\\\") {\n      let j = i + 1\n      while (j < s.length && /[A-Za-z]/.test(s[j])) j++\n      if (j === i + 1 && j < s.length) j++ // `\\\\` 또는 `\\{` 같은 단일 escape\n      result.push(s.slice(i, j))\n      i = j\n    } else if (/\\s/.test(c)) {\n      i++\n    } else {\n      result.push(c)\n      i++\n    }\n  }\n  return result\n}\n\n/**\n * MFR tokenizer 가 LaTeX 토큰 사이에 삽입하는 과도한 공백을 정리.\n *\n * 예: `\\mathrm { m o d d }` → `\\mathrm{modd}`, `6 4` → `64`, `( Q, K, V )` → `(Q,K,V)`\n *\n * 규칙: 공백을 앞뒤 토큰 기준으로 유지/제거 결정.\n *   - 직전이 `\\cmd` 이고 직후가 영문자 → **유지** (e.g. `\\cdot d`, `\\alpha b` — 공백 없으면 greedy 로 `\\cdotd` 가 명령어로 해석될 수 있음)\n *   - 그 외 → **제거** (숫자/괄호/중괄호/첨자/구두점 주변 공백은 LaTeX 의미를 바꾸지 않음)\n *\n * `fixLatexSpacing` 이후에 호출되는 것을 전제 — 먼저 공백 누락을 복원한 뒤 과도한 공백을 걷어냄.\n */\nexport function normalizeFormulaSpacing(s: string): string {\n  // `\\cmd`, 단일 escape, 공백, 일반 문자 단위로 토큰화 (공백도 토큰으로 유지)\n  const tokens: string[] = []\n  let i = 0\n  while (i < s.length) {\n    const c = s[i]\n    if (c === \"\\\\\") {\n      let j = i + 1\n      while (j < s.length && /[A-Za-z]/.test(s[j])) j++\n      if (j === i + 1 && j < s.length) j++ // 단일 escape (`\\\\`, `\\{` 등)\n      tokens.push(s.slice(i, j))\n      i = j\n    } else if (/\\s/.test(c)) {\n      tokens.push(\" \")\n      i++\n    } else {\n      tokens.push(c)\n      i++\n    }\n  }\n\n  const out: string[] = []\n  for (let k = 0; k < tokens.length; k++) {\n    if (tokens[k] !== \" \") {\n      out.push(tokens[k])\n      continue\n    }\n    // 공백 토큰 — 유지 여부 결정\n    // 연속 공백은 나중에 병합 (아래 로직은 앞뒤 non-space 토큰 기준)\n    let prev = \"\"\n    for (let p = k - 1; p >= 0; p--) {\n      if (tokens[p] !== \" \") {\n        prev = tokens[p]\n        break\n      }\n    }\n    let next = \"\"\n    for (let q = k + 1; q < tokens.length; q++) {\n      if (tokens[q] !== \" \") {\n        next = tokens[q]\n        break\n      }\n    }\n    const prevIsCmd = /^\\\\[A-Za-z]+$/.test(prev)\n    const nextIsAlpha = /^[A-Za-z]$/.test(next)\n    if (prevIsCmd && nextIsAlpha) {\n      // 앞 cmd 와 뒤 변수 분리용 공백 (연속 공백이더라도 하나만 남김)\n      if (out.length === 0 || out[out.length - 1] !== \" \") {\n        out.push(\" \")\n      }\n    }\n    // 그 외 공백은 drop\n  }\n\n  // 앞/뒤 공백 제거\n  while (out.length > 0 && out[0] === \" \") out.shift()\n  while (out.length > 0 && out[out.length - 1] === \" \") out.pop()\n\n  return out.join(\"\")\n}\n","/**\n * MFD (Mathematical Formula Detection) — YOLOv8 기반 수식 영역 검출\n *\n * 모델: breezedeus/pix2text-mfd (YOLOv8 small, imgsz=768, stride=32)\n * 출력: [1, 6, 12096] — (cx, cy, w, h, class0_score, class1_score) × anchors\n *   - class 0 = embedding (inline 수식)\n *   - class 1 = isolated (display 수식)\n *\n * 전처리: letterbox (긴 변 비율 유지 + 회색 패딩 114)\n * 후처리: conf ≥ 0.25 → class-per-class NMS (IoU ≥ 0.45)\n */\n\nimport type { InferenceSession, Tensor } from \"onnxruntime-node\"\nimport type { FormulaKind, PixelFrame, FormulaRegion } from \"./types.js\"\n\nconst MFD_IMG_SIZE = 768\nconst MFD_NUM_CLASSES = 2\nconst MFD_CHANNELS = 4 + MFD_NUM_CLASSES\n/** 기본 confidence 임계값 (Pix2Text 원본 0.25 — 누락은 적지만 noise 발생) */\nconst MFD_CONF_INLINE = 0.30\n/** display 수식 임계값 — diagram/figure 오탐 감소 목적으로 inline 보다 높게 */\nconst MFD_CONF_DISPLAY = 0.40\nconst MFD_IOU_THRESHOLD = 0.45\n/** 최소 bbox 면적 (px²) — 이보다 작으면 OCR noise 가능성 높음 */\nconst MFD_MIN_AREA = 80\nconst PAD_VALUE = 114 / 255\n\ninterface RawDetection {\n  x1: number\n  y1: number\n  x2: number\n  y2: number\n  kind: FormulaKind\n  score: number\n}\n\n/**\n * 단일 페이지 이미지에서 수식 영역 검출 (인식 없음 — recognizer 로 넘김).\n * bbox 는 원본 이미지 좌표계.\n */\nexport async function detectFormulaRegions(\n  session: InferenceSession,\n  frame: PixelFrame,\n  ort: typeof import(\"onnxruntime-node\"),\n): Promise<Omit<FormulaRegion, \"latex\">[]> {\n  const { scale, padX, padY, tensor } = letterbox(frame, MFD_IMG_SIZE)\n\n  const input = new ort.Tensor(\"float32\", tensor, [1, 3, MFD_IMG_SIZE, MFD_IMG_SIZE])\n  const feeds: Record<string, Tensor> = { images: input }\n  const outputs = await session.run(feeds)\n\n  const firstKey = Object.keys(outputs)[0]\n  const out = outputs[firstKey]\n  if (!out || out.type !== \"float32\") {\n    throw new Error(\"MFD 출력 없음 또는 dtype 불일치\")\n  }\n\n  const outDims = out.dims\n  if (outDims.length !== 3) {\n    throw new Error(`MFD 출력 차원 예상 3, 실제 ${outDims.length}: [${outDims.join(\",\")}]`)\n  }\n  const channels = outDims[1]\n  const anchors = outDims[2]\n  if (channels !== MFD_CHANNELS) {\n    throw new Error(`MFD 채널 수 예상 ${MFD_CHANNELS}, 실제 ${channels}`)\n  }\n  if (anchors <= 0) return []\n\n  const data = out.data as Float32Array\n  const candidates: RawDetection[] = []\n\n  for (let a = 0; a < anchors; a++) {\n    const cx = data[a]\n    const cy = data[anchors + a]\n    const w = data[2 * anchors + a]\n    const h = data[3 * anchors + a]\n\n    let bestCls = 0\n    let bestScore = 0\n    for (let c = 0; c < MFD_NUM_CLASSES; c++) {\n      const s = data[(4 + c) * anchors + a]\n      if (s > bestScore) {\n        bestScore = s\n        bestCls = c\n      }\n    }\n    // 클래스별 임계값 — display 쪽은 diagram/figure 오탐 감소 목적으로 inline 보다 엄격.\n    const threshold = bestCls === 1 ? MFD_CONF_DISPLAY : MFD_CONF_INLINE\n    if (bestScore < threshold) continue\n\n    // letterbox → 원본 좌표\n    let x1 = (cx - w / 2 - padX) / scale\n    let y1 = (cy - h / 2 - padY) / scale\n    let x2 = (cx + w / 2 - padX) / scale\n    let y2 = (cy + h / 2 - padY) / scale\n\n    x1 = clamp(x1, 0, frame.width - 1)\n    y1 = clamp(y1, 0, frame.height - 1)\n    x2 = clamp(x2, 0, frame.width - 1)\n    y2 = clamp(y2, 0, frame.height - 1)\n\n    if (x2 - x1 < 2 || y2 - y1 < 2) continue\n    // 너무 작은 bbox (픽셀 단위 noise 로 보이는 영역) 제외\n    if ((x2 - x1) * (y2 - y1) < MFD_MIN_AREA) continue\n\n    candidates.push({\n      x1,\n      y1,\n      x2,\n      y2,\n      kind: bestCls === 1 ? \"display\" : \"inline\",\n      score: bestScore,\n    })\n  }\n\n  // 클래스별 NMS (혼합 클래스 bbox 간 중복은 허용 — Pix2Text 원본 동작)\n  const kept: RawDetection[] = []\n  for (const kind of [\"inline\", \"display\"] as FormulaKind[]) {\n    const subset = candidates.filter((c) => c.kind === kind)\n    kept.push(...nms(subset, MFD_IOU_THRESHOLD))\n  }\n\n  // 읽기 순서 정렬 (위→아래, 왼→오른쪽)\n  kept.sort((a, b) => a.y1 - b.y1 || a.x1 - b.x1)\n\n  return kept.map((d) => ({\n    bbox: { x1: d.x1, y1: d.y1, x2: d.x2, y2: d.y2 },\n    kind: d.kind,\n    score: d.score,\n  }))\n}\n\n/**\n * YOLOv8 letterbox 전처리 — RGBA 프레임을 target×target float32 CHW tensor 로.\n *\n * - 긴 변 기준으로 비율 유지 리사이즈\n * - 가운데 패딩 (회색 114)\n * - /255 정규화\n * - CHW 레이아웃\n */\nexport function letterbox(\n  frame: PixelFrame,\n  target: number,\n): { scale: number; padX: number; padY: number; tensor: Float32Array } {\n  const w = frame.width\n  const h = frame.height\n  const scale = Math.min(target / w, target / h)\n  const newW = Math.max(1, Math.round(w * scale))\n  const newH = Math.max(1, Math.round(h * scale))\n  const padX = (target - newW) / 2\n  const padY = (target - newH) / 2\n  const offX = Math.floor(padX)\n  const offY = Math.floor(padY)\n\n  const ts = target\n  const tensor = new Float32Array(3 * ts * ts)\n  tensor.fill(PAD_VALUE)\n\n  // RGBA 원본 → 먼저 nearest-neighbor resize 한 뒤 복사.\n  // (sharp 로 정확한 bilinear 가능하지만, 여기선 이미 렌더링된 bitmap 이 충분히 해상도 높음 —\n  //  결과는 동일한 수준으로 수식 박스 위치 맞춤. Rust 구현도 Triangle 사용.)\n  const src = frame.data\n  const srcW = frame.width\n  const srcH = frame.height\n\n  for (let y = 0; y < newH; y++) {\n    const sy = Math.min(srcH - 1, Math.floor((y + 0.5) / newH * srcH))\n    for (let x = 0; x < newW; x++) {\n      const sx = Math.min(srcW - 1, Math.floor((x + 0.5) / newW * srcW))\n      const srcIdx = (sy * srcW + sx) * 4\n      const r = src[srcIdx]\n      const g = src[srcIdx + 1]\n      const b = src[srcIdx + 2]\n\n      const tx = x + offX\n      const ty = y + offY\n      const idx = ty * ts + tx\n      tensor[idx] = r / 255\n      tensor[ts * ts + idx] = g / 255\n      tensor[2 * ts * ts + idx] = b / 255\n    }\n  }\n\n  return { scale, padX, padY, tensor }\n}\n\nfunction nms(cands: RawDetection[], iouThreshold: number): RawDetection[] {\n  const sorted = [...cands].sort((a, b) => b.score - a.score)\n  const kept: RawDetection[] = []\n  for (const cand of sorted) {\n    let keep = true\n    for (const k of kept) {\n      if (iou(cand, k) > iouThreshold) {\n        keep = false\n        break\n      }\n    }\n    if (keep) kept.push(cand)\n  }\n  return kept\n}\n\nfunction iou(\n  a: { x1: number; y1: number; x2: number; y2: number },\n  b: { x1: number; y1: number; x2: number; y2: number },\n): number {\n  const x1 = Math.max(a.x1, b.x1)\n  const y1 = Math.max(a.y1, b.y1)\n  const x2 = Math.min(a.x2, b.x2)\n  const y2 = Math.min(a.y2, b.y2)\n  const interW = Math.max(0, x2 - x1)\n  const interH = Math.max(0, y2 - y1)\n  const inter = interW * interH\n  const areaA = Math.max(0, a.x2 - a.x1) * Math.max(0, a.y2 - a.y1)\n  const areaB = Math.max(0, b.x2 - b.x1) * Math.max(0, b.y2 - b.y1)\n  const union = areaA + areaB - inter\n  return union <= 0 ? 0 : inter / union\n}\n\nfunction clamp(v: number, lo: number, hi: number): number {\n  if (v < lo) return lo\n  if (v > hi) return hi\n  return v\n}\n\n// 테스트 용도로만 export\nexport const __internal = { nms, iou, letterbox }\n","/**\n * MFR (Mathematical Formula Recognition) — DeiT encoder + TrOCR decoder\n *\n * 모델: breezedeus/pix2text-mfr\n *   - encoder: DeiT distilled, input 384×384 → output [1, 578, 384]\n *   - decoder: TrOCR (no KV cache), vocab=1200, EOS=2\n *\n * 전처리 (DeiT): Catmull-Rom resize → /255 → (x - 0.5) / 0.5  == x*2 - 1\n *\n * 디코딩: greedy, start=[2], stop at 2 또는 max_new_tokens=256\n *         decoder 는 매 스텝 전체 시퀀스를 재계산 (no KV cache — 모델 고정)\n */\n\nimport type { InferenceSession, Tensor } from \"onnxruntime-node\"\nimport type { PreTrainedTokenizer } from \"@huggingface/transformers\"\nimport { postProcessLatex } from \"./postprocess.js\"\nimport type { PixelFrame } from \"./types.js\"\n\nconst MFR_IMG_SIZE = 384\nconst MFR_ENC_HIDDEN = 384\nconst MFR_MAX_NEW_TOKENS = 256\nconst MFR_EOS_ID = 2\nconst MFR_PAD_ID = 0\n\nexport interface RecognizeDeps {\n  encoder: InferenceSession\n  decoder: InferenceSession\n  tokenizer: PreTrainedTokenizer\n  ort: typeof import(\"onnxruntime-node\")\n}\n\n/**\n * 단일 수식 crop 을 LaTeX 로 인식.\n * 입력 frame 은 이미 해당 영역만 잘린 RGBA 이미지이어야 한다 (recognizer 가 resize 수행).\n */\nexport async function recognizeFormula(\n  deps: RecognizeDeps,\n  crop: PixelFrame,\n): Promise<string> {\n  const tensor = deitPreprocess(crop, MFR_IMG_SIZE)\n  const { ort, encoder, decoder, tokenizer } = deps\n\n  const pixelInput = new ort.Tensor(\"float32\", tensor, [1, 3, MFR_IMG_SIZE, MFR_IMG_SIZE])\n  const encOut = await encoder.run({ pixel_values: pixelInput })\n\n  const encKey =\n    Object.keys(encOut).find((k) => k.includes(\"hidden\")) ?? Object.keys(encOut)[0]\n  const encTensor = encOut[encKey]\n  if (!encTensor || encTensor.type !== \"float32\") {\n    throw new Error(\"MFR encoder 출력 없음\")\n  }\n  const encDims = encTensor.dims\n  if (encDims.length !== 3) {\n    throw new Error(`MFR encoder 차원 예상 3, 실제 ${encDims.length}`)\n  }\n  const encSeq = encDims[1]\n  const encHidden = encDims[2]\n  if (encHidden !== MFR_ENC_HIDDEN) {\n    throw new Error(`MFR encoder hidden 예상 ${MFR_ENC_HIDDEN}, 실제 ${encHidden}`)\n  }\n  const encData = encTensor.data as Float32Array\n\n  // greedy decode\n  const tokens: number[] = [MFR_EOS_ID] // decoder_start_token_id\n\n  for (let step = 0; step < MFR_MAX_NEW_TOKENS; step++) {\n    const seqLen = tokens.length\n    const idsArr = BigInt64Array.from(tokens.map((t) => BigInt(t)))\n    const idsTensor = new ort.Tensor(\"int64\", idsArr, [1, seqLen])\n\n    // encoder_hidden_states 는 매 스텝 동일 — 복사 필요 (Tensor 는 buffer 소유)\n    const hidCopy = new Float32Array(encData)\n    const hidTensor = new ort.Tensor(\"float32\", hidCopy, [1, encSeq, encHidden])\n\n    const decOut = await decoder.run({\n      input_ids: idsTensor,\n      encoder_hidden_states: hidTensor,\n    })\n\n    const logitKey =\n      Object.keys(decOut).find((k) => k.includes(\"logit\")) ?? Object.keys(decOut)[0]\n    const logitsTensor = decOut[logitKey]\n    if (!logitsTensor || logitsTensor.type !== \"float32\") {\n      throw new Error(\"MFR decoder logits 없음\")\n    }\n    const dims = logitsTensor.dims\n    if (dims.length !== 3) {\n      throw new Error(`MFR decoder 차원 예상 3, 실제 ${dims.length}`)\n    }\n    const decSeq = dims[1]\n    const vocab = dims[2]\n    const logitsData = logitsTensor.data as Float32Array\n\n    // 마지막 step logits 만\n    const lastOffset = (decSeq - 1) * vocab\n    let bestId = 0\n    let bestVal = -Infinity\n    for (let v = 0; v < vocab; v++) {\n      const val = logitsData[lastOffset + v]\n      if (val > bestVal) {\n        bestVal = val\n        bestId = v\n      }\n    }\n    tokens.push(bestId)\n    if (bestId === MFR_EOS_ID) break\n  }\n\n  // 첫 start 토큰 제외 + EOS/PAD 제거\n  const body: number[] = []\n  for (let i = 1; i < tokens.length; i++) {\n    const t = tokens[i]\n    if (t === MFR_EOS_ID) break\n    if (t === MFR_PAD_ID) continue\n    if (t < 0) continue\n    body.push(t)\n  }\n\n  // Transformers.js tokenizer.decode 는 skip_special_tokens=true 기본\n  const raw = tokenizer.decode(body, { skip_special_tokens: true })\n  return postProcessLatex(raw)\n}\n\n/**\n * DeiT preprocess:\n *   resize to 384×384 (bilinear)\n *   (pixel/255 - 0.5) / 0.5  ==  pixel/127.5 - 1\n *   CHW layout\n */\nexport function deitPreprocess(crop: PixelFrame, target: number): Float32Array {\n  const ts = target\n  const out = new Float32Array(3 * ts * ts)\n  const { data: src, width: srcW, height: srcH } = crop\n\n  // 단순 nearest (이미 수식 crop 은 300DPI 근방이라 충분). 필요시 sharp bilinear 로 교체.\n  for (let y = 0; y < ts; y++) {\n    const sy = Math.min(srcH - 1, Math.max(0, Math.floor(((y + 0.5) / ts) * srcH)))\n    for (let x = 0; x < ts; x++) {\n      const sx = Math.min(srcW - 1, Math.max(0, Math.floor(((x + 0.5) / ts) * srcW)))\n      const srcIdx = (sy * srcW + sx) * 4\n      const r = src[srcIdx]\n      const g = src[srcIdx + 1]\n      const b = src[srcIdx + 2]\n\n      const idx = y * ts + x\n      out[idx] = r / 127.5 - 1\n      out[ts * ts + idx] = g / 127.5 - 1\n      out[2 * ts * ts + idx] = b / 127.5 - 1\n    }\n  }\n  return out\n}\n","/**\n * 수식 OCR 파이프라인 — PDFium 렌더 + MFD + MFR 통합\n *\n * 한 번 생성된 FormulaPipeline 인스턴스는 ONNX 세션을 재사용해 여러 PDF 에 적용 가능.\n * Docufinder 는 CLI 프로세스 단위로 새로 띄우기 때문에 세션 재사용은 PDF 내부 페이지 루프에만 적용됨.\n */\n\nimport type { PDFiumLibrary, PDFiumDocument } from \"@hyzyla/pdfium\"\nimport type { InferenceSession } from \"onnxruntime-node\"\nimport type { PreTrainedTokenizer } from \"@huggingface/transformers\"\n\n/** sharp 은 CommonJS `export =` 형태라 타입을 직접 import 하기 까다로움. 함수형 시그니처만 사용. */\ntype SharpFactory = (\n  input: Uint8Array | Buffer,\n  options?: { raw?: { width: number; height: number; channels: number } },\n) => {\n  extract(region: { left: number; top: number; width: number; height: number }): {\n    raw(): { toBuffer(): Promise<Buffer> }\n  }\n}\n\nimport { detectFormulaRegions } from \"./detector.js\"\nimport { recognizeFormula } from \"./recognizer.js\"\nimport {\n  getFormulaModelsDir,\n  MFD_MODEL,\n  MFR_ENCODER_MODEL,\n  MFR_DECODER_MODEL,\n  MFR_TOKENIZER,\n} from \"./models.js\"\nimport type { FormulaRegion, PixelFrame } from \"./types.js\"\nimport { join } from \"path\"\n\n/** PDF 페이지 렌더 해상도 (scale=2 → 약 144 DPI). 수식 인식에는 이 이상은 과함. */\nconst RENDER_SCALE = 2\n\nexport interface FormulaPipelineOptions {\n  /** 수식 인식 페이지 스케일 (기본 2). 값을 올리면 작은 수식 인식률 ↑, 속도 ↓. */\n  scale?: number\n  /** 페이지별 최대 수식 수 (안전 상한). 기본 50. */\n  maxRegionsPerPage?: number\n  /** 페이지 하나당 타임아웃 (ms, 기본 60000 = 1분). 초과 시 해당 페이지 skip. */\n  pageTimeoutMs?: number\n}\n\nexport interface PageFormulaResult {\n  pageNumber: number\n  /** 페이지 전체 렌더 이미지의 가로/세로 (원본 좌표계, scale 반영됨) */\n  renderedWidth: number\n  renderedHeight: number\n  /** 원본 PDF 포인트 기준 너비/높이 (pdfjs 와 좌표 매핑용) */\n  pdfWidth: number\n  pdfHeight: number\n  regions: FormulaRegion[]\n}\n\n/**\n * 수식 OCR 실행 컨텍스트. 처음 호출 시 무겁게 초기화 (ONNX 세션 로드),\n * 이후 runOnBuffer / runOnPages 를 여러 번 호출해 재사용 가능.\n *\n * 모든 의존성(onnxruntime-node, @huggingface/transformers, @hyzyla/pdfium, sharp)은\n * optional 이므로 dynamic import. 미설치 시 초기화에서 명확한 에러 메시지 반환.\n */\nexport class FormulaPipeline {\n  private mfd: InferenceSession\n  private encoder: InferenceSession\n  private decoder: InferenceSession\n  private tokenizer: PreTrainedTokenizer\n  private ort: typeof import(\"onnxruntime-node\")\n  private sharp: SharpFactory\n  private pdfium: PDFiumLibrary\n  private opts: Required<FormulaPipelineOptions>\n\n  private constructor(parts: {\n    mfd: InferenceSession\n    encoder: InferenceSession\n    decoder: InferenceSession\n    tokenizer: PreTrainedTokenizer\n    ort: typeof import(\"onnxruntime-node\")\n    sharp: SharpFactory\n    pdfium: PDFiumLibrary\n    opts: Required<FormulaPipelineOptions>\n  }) {\n    this.mfd = parts.mfd\n    this.encoder = parts.encoder\n    this.decoder = parts.decoder\n    this.tokenizer = parts.tokenizer\n    this.ort = parts.ort\n    this.sharp = parts.sharp\n    this.pdfium = parts.pdfium\n    this.opts = parts.opts\n  }\n\n  /**\n   * 수식 OCR 엔진 초기화. 모델 파일이 로컬에 없으면 즉시 실패 — 호출자가\n   * `ensureFormulaModels()` 를 먼저 돌려야 한다.\n   */\n  static async create(options?: FormulaPipelineOptions): Promise<FormulaPipeline> {\n    const opts: Required<FormulaPipelineOptions> = {\n      scale: options?.scale ?? RENDER_SCALE,\n      maxRegionsPerPage: options?.maxRegionsPerPage ?? 50,\n      pageTimeoutMs: options?.pageTimeoutMs ?? 60_000,\n    }\n\n    const [ortMod, sharpModRaw, hfMod, pdfiumMod] = await Promise.all([\n      tryImport<typeof import(\"onnxruntime-node\")>(\n        \"onnxruntime-node\",\n        () => import(\"onnxruntime-node\"),\n      ),\n      tryImport<{ default?: SharpFactory } & SharpFactory>(\n        \"sharp\",\n        () => import(\"sharp\") as unknown as Promise<{ default?: SharpFactory } & SharpFactory>,\n      ),\n      tryImport<typeof import(\"@huggingface/transformers\")>(\n        \"@huggingface/transformers\",\n        () => import(\"@huggingface/transformers\"),\n      ),\n      tryImport<typeof import(\"@hyzyla/pdfium\")>(\n        \"@hyzyla/pdfium\",\n        () => import(\"@hyzyla/pdfium\"),\n      ),\n    ])\n    // CJS `export =` + ESM interop → default 속성에 래핑될 때도, 안 될 때도 있음.\n    const sharpAny = sharpModRaw as { default?: SharpFactory } | SharpFactory\n    const sharpMod: SharpFactory =\n      typeof sharpAny === \"function\"\n        ? sharpAny\n        : (sharpAny.default ?? (sharpAny as unknown as SharpFactory))\n\n    const modelsDir = getFormulaModelsDir()\n    const mfdPath = join(modelsDir, MFD_MODEL.filename)\n    const encPath = join(modelsDir, MFR_ENCODER_MODEL.filename)\n    const decPath = join(modelsDir, MFR_DECODER_MODEL.filename)\n    const tokPath = join(modelsDir, MFR_TOKENIZER.filename)\n\n    const sessionOpts: import(\"onnxruntime-node\").InferenceSession.SessionOptions = {\n      graphOptimizationLevel: \"all\",\n      executionProviders: [\"cpu\"],\n    }\n\n    // 각 세션은 I/O 바운드 아님 → 병렬 로드로 1~2초 단축\n    const [mfd, encoder, decoder] = await Promise.all([\n      ortMod.InferenceSession.create(mfdPath, sessionOpts),\n      ortMod.InferenceSession.create(encPath, sessionOpts),\n      ortMod.InferenceSession.create(decPath, sessionOpts),\n    ])\n\n    // Transformers.js 의 PreTrainedTokenizer 를 로컬 tokenizer.json 으로 로드.\n    // AutoTokenizer.from_pretrained 는 HF hub 접근을 시도하므로 우회.\n    const { readFile } = await import(\"fs/promises\")\n    const tokenizerJson = JSON.parse(await readFile(tokPath, \"utf-8\"))\n    const PretrainedCtor = hfMod.PreTrainedTokenizer as unknown as new (\n      json: unknown,\n      config: Record<string, unknown>,\n    ) => PreTrainedTokenizer\n    const tokenizer = new PretrainedCtor(tokenizerJson, {})\n\n    const pdfium = await pdfiumMod.PDFiumLibrary.init()\n\n    return new FormulaPipeline({\n      mfd,\n      encoder,\n      decoder,\n      tokenizer,\n      ort: ortMod,\n      sharp: sharpMod,\n      pdfium,\n      opts,\n    })\n  }\n\n  /** 리소스 해제 — 더 이상 사용하지 않을 때 호출. */\n  async destroy(): Promise<void> {\n    // onnxruntime-node InferenceSession 은 release() 없음 (GC 의존).\n    try {\n      this.pdfium.destroy()\n    } catch {\n      // ignore\n    }\n  }\n\n  /**\n   * PDF 버퍼를 열어 페이지별 수식 영역을 인식한다.\n   * 실패한 페이지는 skip (에러 전파 없음 — 로그만).\n   *\n   * @param pageFilter null 이면 전체 페이지. Set 이면 1-based 페이지 번호 일치만.\n   */\n  async runOnBuffer(\n    buffer: ArrayBuffer | Uint8Array,\n    pageFilter: Set<number> | null = null,\n    onPageProgress?: (pageNumber: number, total: number) => void,\n  ): Promise<PageFormulaResult[]> {\n    const view = buffer instanceof Uint8Array ? buffer : new Uint8Array(buffer)\n    const doc: PDFiumDocument = await this.pdfium.loadDocument(view)\n    try {\n      const pages: PageFormulaResult[] = []\n      for (const page of doc.pages()) {\n        // pdfium page.number 는 0-based pageIndex — pdfjs 블록/pageFilter 는 1-based.\n        // 환산 없이는 필터가 한 페이지 밀리고 수식이 이전 페이지 블록에 붙는다 (off-by-one).\n        const pageNo = page.number + 1\n        if (pageFilter && !pageFilter.has(pageNo)) continue\n\n        onPageProgress?.(pageNo, doc.getPageCount())\n\n        try {\n          const result = await withTimeout(\n            this.processPage(pageNo, page),\n            this.opts.pageTimeoutMs,\n            `formula page ${pageNo} timed out after ${this.opts.pageTimeoutMs}ms`,\n          )\n          if (result) pages.push(result)\n        } catch (e) {\n          // 페이지 단위 실패는 조용히 넘어간다 — 전체 PDF 파싱 실패 방지.\n          process.stderr.write(\n            `[kordoc-formula] page ${pageNo} skipped: ${(e as Error).message}\\n`,\n          )\n        }\n      }\n      return pages\n    } finally {\n      doc.destroy()\n    }\n  }\n\n  private async processPage(\n    pageNumber: number,\n    page: import(\"@hyzyla/pdfium\").PDFiumPage,\n  ): Promise<PageFormulaResult | null> {\n    const { originalWidth: pdfWidth, originalHeight: pdfHeight } = page.getOriginalSize()\n\n    const sharpCtor = this.sharp\n    const rendered = await page.render({\n      scale: this.opts.scale,\n      render: async ({ data, width, height }) => {\n        // 임시로 PNG 로 인코딩하지 않고 raw 그대로 반환 — 바로 쓸 거라서.\n        return data\n      },\n    })\n    // rendered.data 는 BGRA — sharp 로 RGBA 로 변환\n    const { data: bgra, width: rw, height: rh } = rendered\n    const rgba = bgraToRgba(bgra)\n\n    const pageFrame: PixelFrame = { width: rw, height: rh, data: rgba }\n\n    // 1) 수식 영역 검출\n    const regions0 = await detectFormulaRegions(this.mfd, pageFrame, this.ort)\n    if (regions0.length === 0) {\n      return { pageNumber, renderedWidth: rw, renderedHeight: rh, pdfWidth, pdfHeight, regions: [] }\n    }\n\n    const capped = regions0.slice(0, this.opts.maxRegionsPerPage)\n    const regions: FormulaRegion[] = []\n\n    // 2) 각 영역 crop → 인식\n    for (const r of capped) {\n      const x1 = Math.floor(Math.max(0, r.bbox.x1))\n      const y1 = Math.floor(Math.max(0, r.bbox.y1))\n      const x2 = Math.ceil(Math.min(rw, r.bbox.x2))\n      const y2 = Math.ceil(Math.min(rh, r.bbox.y2))\n      const cw = x2 - x1\n      const ch = y2 - y1\n      if (cw < 4 || ch < 4) continue\n\n      // sharp 로 raw RGBA 에서 crop → raw RGBA 반환\n      const cropRgba = await sharpCtor(rgba, {\n        raw: { width: rw, height: rh, channels: 4 },\n      })\n        .extract({ left: x1, top: y1, width: cw, height: ch })\n        .raw()\n        .toBuffer()\n\n      const cropFrame: PixelFrame = { width: cw, height: ch, data: new Uint8Array(cropRgba) }\n\n      let latex = \"\"\n      try {\n        latex = await recognizeFormula(\n          {\n            encoder: this.encoder,\n            decoder: this.decoder,\n            tokenizer: this.tokenizer,\n            ort: this.ort,\n          },\n          cropFrame,\n        )\n      } catch (e) {\n        process.stderr.write(\n          `[kordoc-formula] recognize failed at page ${pageNumber} ${JSON.stringify(r.bbox)}: ${(e as Error).message}\\n`,\n        )\n        latex = \"\"\n      }\n\n      regions.push({ ...r, latex })\n    }\n\n    return {\n      pageNumber,\n      renderedWidth: rw,\n      renderedHeight: rh,\n      pdfWidth,\n      pdfHeight,\n      regions,\n    }\n  }\n}\n\nasync function tryImport<T>(name: string, loader: () => Promise<T>): Promise<T> {\n  try {\n    return await loader()\n  } catch (e) {\n    throw new Error(\n      `수식 OCR 을 사용하려면 optional dependency '${name}' 이 필요합니다. ` +\n        `\\`npm install ${name}\\` 후 다시 실행하세요. 원인: ${(e as Error).message}`,\n    )\n  }\n}\n\nasync function withTimeout<T>(promise: Promise<T>, ms: number, msg: string): Promise<T> {\n  // 타임아웃으로 race 가 끝난 뒤에도 원 promise 는 계속 실행된다 — 사후 reject 가\n  // unhandled rejection(Node 기본 정책: 프로세스 종료)이 되지 않게 흡수\n  promise.catch(() => {})\n  let timer: NodeJS.Timeout | undefined\n  try {\n    return await Promise.race([\n      promise,\n      new Promise<never>((_, reject) => {\n        timer = setTimeout(() => reject(new Error(msg)), ms)\n      }),\n    ])\n  } finally {\n    if (timer) clearTimeout(timer)\n  }\n}\n\n/** pdfium 의 BGRA 버퍼를 RGBA 로 변환 (Red ↔ Blue 스왑). */\nfunction bgraToRgba(bgra: Uint8Array): Uint8Array {\n  const out = new Uint8Array(bgra.length)\n  for (let i = 0; i < bgra.length; i += 4) {\n    out[i] = bgra[i + 2] // R ← B\n    out[i + 1] = bgra[i + 1] // G ← G\n    out[i + 2] = bgra[i] // B ← R\n    out[i + 3] = bgra[i + 3] // A ← A\n  }\n  return out\n}\n"]}