kordoc 3.3.0 → 3.4.1

package/dist/chunk-MEPHGCPQ.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/detect.ts","../src/hwp5/cfb-lenient.ts"],"sourcesContent":["/** 매직 바이트 기반 파일 포맷 감지 */\n\nimport JSZip from \"jszip\"\nimport type { FileType } from \"./types.js\"\nimport { parseLenientCfb } from \"./hwp5/cfb-lenient.js\"\n\n/** 매직 바이트 뷰 생성 (복사 없이 view) */\nfunction magicBytes(buffer: ArrayBuffer): Uint8Array {\n  return new Uint8Array(buffer, 0, Math.min(4, buffer.byteLength))\n}\n\n/** ZIP 파일 여부: PK\\x03\\x04 */\nexport function isZipFile(buffer: ArrayBuffer): boolean {\n  const b = magicBytes(buffer)\n  return b[0] === 0x50 && b[1] === 0x4b && b[2] === 0x03 && b[3] === 0x04\n}\n\n/** HWPX (ZIP 기반 한컴 문서): PK\\x03\\x04 — 하위 호환용 */\nexport function isHwpxFile(buffer: ArrayBuffer): boolean {\n  return isZipFile(buffer)\n}\n\n/** HWP 5.x (OLE2 바이너리 한컴 문서): \\xD0\\xCF\\x11\\xE0 */\nexport function isOldHwpFile(buffer: ArrayBuffer): boolean {\n  const b = magicBytes(buffer)\n  return b[0] === 0xd0 && b[1] === 0xcf && b[2] === 0x11 && b[3] === 0xe0\n}\n\n/**\n * HWP 3.x (한글 워드프로세서 3.0): \"HWP Document File V3.00 \\x1A\\x01\\x02\\x03\\x04\\x05\" 30 byte.\n * CFB(OLE2) 컨테이너 아닌 단일 binary stream — isOldHwpFile 과 magic 이 다르다.\n */\nconst HWP3_PREFIX = new TextEncoder().encode(\"HWP Document File V3.00\")\nexport function isHwp3File(buffer: ArrayBuffer): boolean {\n  if (buffer.byteLength < HWP3_PREFIX.length) return false\n  const head = new Uint8Array(buffer, 0, HWP3_PREFIX.length)\n  for (let i = 0; i < HWP3_PREFIX.length; i++) {\n    if (head[i] !== HWP3_PREFIX[i]) return false\n  }\n  return true\n}\n\n/** PDF 문서: %PDF */\nexport function isPdfFile(buffer: ArrayBuffer): boolean {\n  const b = magicBytes(buffer)\n  return b[0] === 0x25 && b[1] === 0x50 && b[2] === 0x44 && b[3] === 0x46\n}\n\n/** HWPML (XML 기반 한컴 문서): <?xml ... <HWPML */\nexport function isHwpmlFile(buffer: ArrayBuffer): boolean {\n  const bytes = new Uint8Array(buffer, 0, Math.min(512, buffer.byteLength))\n  const head = new TextDecoder(\"utf-8\", { fatal: false }).decode(bytes).replace(/^\\uFEFF/, \"\")\n  return head.trimStart().startsWith(\"<?xml\") && head.includes(\"<HWPML\")\n}\n\n/** 동기 포맷 감지 — ZIP은 모두 \"hwpx\"로 반환 (하위 호환) */\nexport function detectFormat(buffer: ArrayBuffer): FileType {\n  if (buffer.byteLength < 4) return \"unknown\"\n  if (isHwp3File(buffer)) return \"hwp3\"\n  if (isZipFile(buffer)) return \"hwpx\"\n  if (isOldHwpFile(buffer)) return \"hwp\"\n  if (isPdfFile(buffer)) return \"pdf\"\n  if (isHwpmlFile(buffer)) return \"hwpml\"\n  return \"unknown\"\n}\n\n/**\n * OLE2 컨테이너 내부 스트림 기반 포맷 세분화.\n * HWP 5.x, XLS 모두 OLE2이므로 스트림 이름으로 구분.\n *  - \"Workbook\" 또는 \"Book\" → 'xls'\n *  - 그 외 (FileHeader 등) → 'hwp'\n */\nexport function detectOle2Format(buffer: ArrayBuffer): \"hwp\" | \"xls\" | \"unknown\" {\n  try {\n    const cfb = parseLenientCfb(Buffer.from(buffer))\n    const names = cfb.entries().map(e => e.name)\n    if (names.includes(\"Workbook\") || names.includes(\"Book\")) return \"xls\"\n    if (names.includes(\"FileHeader\")) return \"hwp\"\n    // FileHeader 없어도 BodyText/DocInfo 있으면 hwp\n    if (names.some(n => n === \"DocInfo\" || n.startsWith(\"Section\"))) return \"hwp\"\n    return \"unknown\"\n  } catch {\n    return \"unknown\"\n  }\n}\n\n/**\n * ZIP 내부 구조 기반 포맷 세분화.\n * HWPX, XLSX, DOCX 모두 ZIP이므로 내부 파일로 구분.\n */\nexport async function detectZipFormat(buffer: ArrayBuffer): Promise<\"hwpx\" | \"xlsx\" | \"docx\" | \"unknown\"> {\n  try {\n    const zip = await JSZip.loadAsync(buffer)\n    // XLSX: xl/workbook.xml\n    if (zip.file(\"xl/workbook.xml\")) return \"xlsx\"\n    // DOCX: word/document.xml\n    if (zip.file(\"word/document.xml\")) return \"docx\"\n    // HWPX: Contents/ 또는 content.hpf 또는 mimetype\n    if (zip.file(\"Contents/content.hpf\") || zip.file(\"mimetype\")) return \"hwpx\"\n    // 기타 ZIP 내에 section 파일이 있으면 HWPX로 추정\n    const hasSection = Object.keys(zip.files).some(f => f.startsWith(\"Contents/\"))\n    if (hasSection) return \"hwpx\"\n    return \"unknown\"\n  } catch {\n    return \"unknown\"\n  }\n}\n","/**\n * Lenient CFB (Compound File Binary / OLE2) 파서.\n *\n * 표준 cfb 모듈이 FAT 검증 실패로 거부하는 손상된 HWP 파일을 열기 위한 폴백.\n * 직접 헤더/FAT/디렉토리를 파싱하여 스트림 데이터를 추출.\n *\n * 참조: rhwp (MIT) src/parser/cfb_reader.rs (LenientCfbReader)\n * 참조: MS-CFB spec (https://learn.microsoft.com/en-us/openspecs/windows_protocols/ms-cfb)\n */\n\nimport { decompressStream } from \"./record.js\"\n\n// ── 상수 ──\n\nconst CFB_MAGIC = Buffer.from([0xd0, 0xcf, 0x11, 0xe0, 0xa1, 0xb1, 0x1a, 0xe1])\nconst END_OF_CHAIN = 0xfffffffe\nconst FREE_SECT = 0xffffffff\n\n/** 순환 감지용 최대 체인 길이 */\nconst MAX_CHAIN_LENGTH = 1_000_000\n/** 최대 디렉토리 엔트리 수 */\nconst MAX_DIR_ENTRIES = 100_000\n/** 최대 스트림 크기 (100MB) */\nconst MAX_STREAM_SIZE = 100 * 1024 * 1024\n\n// ── 디렉토리 엔트리 ──\n\ninterface DirEntry {\n  name: string\n  type: number  // 0=unknown, 1=storage, 2=stream, 5=root\n  startSector: number\n  size: number\n}\n\n// ── CFB 컨테이너 ──\n\nexport interface LenientCfbContainer {\n  /** 이름 기반 스트림 탐색 */\n  findStream(path: string): Buffer | null\n  /** 디렉토리 엔트리 목록 */\n  entries(): DirEntry[]\n}\n\n// ── 구현 ──\n\nexport function parseLenientCfb(data: Buffer): LenientCfbContainer {\n  if (data.length < 512) throw new Error(\"CFB 파일이 너무 짧습니다 (최소 512바이트)\")\n  if (!data.subarray(0, 8).equals(CFB_MAGIC)) throw new Error(\"CFB 매직 바이트 불일치\")\n\n  // ── 헤더 파싱 ──\n\n  const sectorSizeShift = data.readUInt16LE(30)\n  if (sectorSizeShift < 7 || sectorSizeShift > 16) throw new Error(\"유효하지 않은 섹터 크기 시프트: \" + sectorSizeShift)\n  const sectorSize = 1 << sectorSizeShift  // 보통 512\n  const miniSectorSizeShift = data.readUInt16LE(32)\n  if (miniSectorSizeShift > 16) throw new Error(\"유효하지 않은 미니 섹터 크기 시프트: \" + miniSectorSizeShift)\n  const miniSectorSize = 1 << miniSectorSizeShift  // 보통 64\n\n  const fatSectorCount = data.readUInt32LE(44)\n  if (fatSectorCount > 10000) throw new Error(\"FAT 섹터 수가 너무 많습니다: \" + fatSectorCount)\n  const firstDirSector = data.readUInt32LE(48)\n  const miniStreamCutoff = data.readUInt32LE(56)  // 보통 4096\n  const firstMiniFatSector = data.readUInt32LE(60)\n  const miniFatSectorCount = data.readUInt32LE(64)\n  const firstDifatSector = data.readUInt32LE(68)\n  const difatSectorCount = data.readUInt32LE(72)\n\n  // ── 유틸 ──\n\n  function sectorOffset(id: number): number {\n    return 512 + id * sectorSize\n  }\n\n  function readSectorData(id: number): Buffer {\n    const off = sectorOffset(id)\n    if (off + sectorSize > data.length) return Buffer.alloc(0)\n    return data.subarray(off, off + sectorSize)\n  }\n\n  // ── DIFAT → FAT 섹터 목록 ──\n\n  const fatSectors: number[] = []\n\n  // 헤더 내 DIFAT (최대 109개)\n  for (let i = 0; i < 109 && fatSectors.length < fatSectorCount; i++) {\n    const sid = data.readUInt32LE(76 + i * 4)\n    if (sid === FREE_SECT || sid === END_OF_CHAIN) break\n    fatSectors.push(sid)\n  }\n\n  // 추가 DIFAT 섹터 체인\n  let difatSector = firstDifatSector\n  const visitedDifat = new Set<number>()\n  for (let d = 0; d < difatSectorCount && difatSector !== END_OF_CHAIN && difatSector !== FREE_SECT; d++) {\n    if (visitedDifat.has(difatSector)) break\n    visitedDifat.add(difatSector)\n\n    const buf = readSectorData(difatSector)\n    const entriesPerSector = (sectorSize / 4) - 1  // 마지막 4바이트는 다음 DIFAT 포인터\n    for (let i = 0; i < entriesPerSector && fatSectors.length < fatSectorCount; i++) {\n      const sid = buf.readUInt32LE(i * 4)\n      if (sid === FREE_SECT || sid === END_OF_CHAIN) continue\n      fatSectors.push(sid)\n    }\n    difatSector = buf.readUInt32LE(entriesPerSector * 4)\n  }\n\n  // ── FAT 테이블 구축 ──\n\n  const entriesPerFatSector = sectorSize / 4\n  const fatTable = new Uint32Array(fatSectors.length * entriesPerFatSector)\n\n  for (let fi = 0; fi < fatSectors.length; fi++) {\n    const buf = readSectorData(fatSectors[fi])\n    for (let i = 0; i < entriesPerFatSector; i++) {\n      fatTable[fi * entriesPerFatSector + i] = i * 4 + 3 < buf.length\n        ? buf.readUInt32LE(i * 4)\n        : FREE_SECT\n    }\n  }\n\n  // ── 체인 리더 (순환 방지) ──\n\n  function readChain(startSector: number, maxBytes: number): Buffer {\n    if (startSector === END_OF_CHAIN || startSector === FREE_SECT) return Buffer.alloc(0)\n    if (maxBytes > MAX_STREAM_SIZE) throw new Error(\"스트림이 너무 큽니다\")\n\n    const chunks: Buffer[] = []\n    let current = startSector\n    let totalRead = 0\n    const visited = new Set<number>()\n\n    while (current !== END_OF_CHAIN && current !== FREE_SECT && totalRead < maxBytes) {\n      if (visited.has(current)) break  // 순환 감지\n      if (visited.size > MAX_CHAIN_LENGTH) break\n      visited.add(current)\n\n      const buf = readSectorData(current)\n      const remaining = maxBytes - totalRead\n      chunks.push(remaining < sectorSize ? buf.subarray(0, remaining) : buf)\n      totalRead += Math.min(buf.length, remaining)\n\n      current = current < fatTable.length ? fatTable[current] : END_OF_CHAIN\n    }\n\n    return Buffer.concat(chunks)\n  }\n\n  // ── Mini-FAT 테이블 ──\n\n  let miniFatTable: Uint32Array | null = null\n\n  function getMiniFatTable(): Uint32Array {\n    if (miniFatTable) return miniFatTable\n\n    if (miniFatSectorCount === 0 || firstMiniFatSector === END_OF_CHAIN) {\n      miniFatTable = new Uint32Array(0)\n      return miniFatTable\n    }\n\n    const miniFatData = readChain(firstMiniFatSector, miniFatSectorCount * sectorSize)\n    const entries = miniFatData.length / 4\n    miniFatTable = new Uint32Array(entries)\n    for (let i = 0; i < entries; i++) {\n      miniFatTable[i] = miniFatData.readUInt32LE(i * 4)\n    }\n    return miniFatTable\n  }\n\n  // ── 디렉토리 엔트리 파싱 ──\n\n  const dirData = readChain(firstDirSector, MAX_DIR_ENTRIES * 128)\n  const dirEntries: DirEntry[] = []\n\n  for (let offset = 0; offset + 128 <= dirData.length && dirEntries.length < MAX_DIR_ENTRIES; offset += 128) {\n    const nameLen = dirData.readUInt16LE(offset + 64)  // 바이트 수 (null 포함)\n    if (nameLen <= 0 || nameLen > 64) {\n      dirEntries.push({ name: \"\", type: 0, startSector: 0, size: 0 })\n      continue\n    }\n\n    const nameBytes = nameLen - 2  // null terminator 제외\n    const name = nameBytes > 0\n      ? dirData.subarray(offset, offset + nameBytes).toString(\"utf16le\")\n      : \"\"\n\n    const type = dirData[offset + 66]\n    const startSector = dirData.readUInt32LE(offset + 116)\n    // CFBv3에서는 size가 u32 (offset 120), v4에서는 u64\n    const size = dirData.readUInt32LE(offset + 120)\n\n    dirEntries.push({ name, type, startSector, size })\n  }\n\n  // ── Root 엔트리에서 미니 스트림 추출 ──\n\n  let miniStreamData: Buffer | null = null\n\n  function getMiniStream(): Buffer {\n    if (miniStreamData) return miniStreamData\n    const root = dirEntries[0]\n    if (!root || root.type !== 5) {\n      miniStreamData = Buffer.alloc(0)\n      return miniStreamData\n    }\n    miniStreamData = readChain(root.startSector, root.size || MAX_STREAM_SIZE)\n    return miniStreamData\n  }\n\n  // ── 미니 스트림에서 읽기 ──\n\n  function readMiniStream(startSector: number, size: number): Buffer {\n    const mft = getMiniFatTable()\n    const ms = getMiniStream()\n    if (mft.length === 0 || ms.length === 0) return Buffer.alloc(0)\n\n    const chunks: Buffer[] = []\n    let current = startSector\n    let totalRead = 0\n    const visited = new Set<number>()\n\n    while (current !== END_OF_CHAIN && current !== FREE_SECT && totalRead < size) {\n      if (visited.has(current)) break\n      if (visited.size > MAX_CHAIN_LENGTH) break\n      visited.add(current)\n\n      const off = current * miniSectorSize\n      const remaining = size - totalRead\n      const chunkSize = Math.min(miniSectorSize, remaining)\n      if (off + chunkSize <= ms.length) {\n        chunks.push(ms.subarray(off, off + chunkSize))\n      }\n      totalRead += chunkSize\n\n      current = current < mft.length ? mft[current] : END_OF_CHAIN\n    }\n\n    return Buffer.concat(chunks)\n  }\n\n  // ── 스트림 읽기 (일반/미니 자동 분기) ──\n\n  function readStreamData(entry: DirEntry): Buffer {\n    if (entry.size === 0) return Buffer.alloc(0)\n    if (entry.size < miniStreamCutoff) {\n      const miniResult = readMiniStream(entry.startSector, entry.size)\n      // 미니스트림이 비어있으면 일반 체인으로 폴백 (lenient)\n      if (miniResult.length > 0) return miniResult\n    }\n    return readChain(entry.startSector, entry.size)\n  }\n\n  // ── 경로 기반 탐색 ──\n\n  // 전체 경로 맵 구축 (간이: 이름 기반 flat lookup)\n  // HWP 파일의 디렉토리 구조는 보통 1~2 depth이므로 이름 매칭으로 충분\n  function findEntryByPath(path: string): DirEntry | null {\n    // \"/FileHeader\" → \"FileHeader\"\n    // \"/BodyText/Section0\" → path component matching\n    const parts = path.replace(/^\\//, \"\").split(\"/\")\n\n    if (parts.length === 1) {\n      // 단일 이름 매칭\n      return dirEntries.find(e => e.name === parts[0] && e.type === 2) ?? null\n    }\n\n    // 2-depth: storage/stream\n    // HWP 구조: Root/BodyText/Section0, Root/DocInfo, Root/BinData/BIN0001 등\n    const storageName = parts[0]\n    const streamName = parts.slice(1).join(\"/\")\n\n    // 디렉토리 구조 대신 이름 패턴으로 찾기 (lenient)\n    for (const e of dirEntries) {\n      if (e.type === 2 && e.name === streamName) {\n        // 부모 확인은 생략 (lenient) — 중복 이름 시 첫 번째 반환\n        return e\n      }\n    }\n\n    // 정확한 이름이 아닌 경우 (ViewText/Section0 등)\n    const lastPart = parts[parts.length - 1]\n    return dirEntries.find(e => e.type === 2 && e.name === lastPart) ?? null\n  }\n\n  // ── 공개 API ──\n\n  return {\n    findStream(path: string): Buffer | null {\n      // \\005 prefix 처리 (SummaryInformation)\n      const normalized = path.replace(/^\\//, \"\")\n      const entry = findEntryByPath(normalized)\n      if (!entry || entry.type !== 2) return null\n      const stream = readStreamData(entry)\n      return stream.length > 0 ? stream : null\n    },\n\n    entries(): DirEntry[] {\n      return dirEntries.filter(e => e.type === 2)  // stream만\n    },\n  }\n}\n"],"mappings":";;;AAEA,OAAO,WAAW;;;ACYlB,IAAM,YAAY,OAAO,KAAK,CAAC,KAAM,KAAM,IAAM,KAAM,KAAM,KAAM,IAAM,GAAI,CAAC;AAC9E,IAAM,eAAe;AACrB,IAAM,YAAY;AAGlB,IAAM,mBAAmB;AAEzB,IAAM,kBAAkB;AAExB,IAAM,kBAAkB,MAAM,OAAO;AAsB9B,SAAS,gBAAgB,MAAmC;AACjE,MAAI,KAAK,SAAS,IAAK,OAAM,IAAI,MAAM,mGAA6B;AACpE,MAAI,CAAC,KAAK,SAAS,GAAG,CAAC,EAAE,OAAO,SAAS,EAAG,OAAM,IAAI,MAAM,wDAAgB;AAI5E,QAAM,kBAAkB,KAAK,aAAa,EAAE;AAC5C,MAAI,kBAAkB,KAAK,kBAAkB,GAAI,OAAM,IAAI,MAAM,yFAAwB,eAAe;AACxG,QAAM,aAAa,KAAK;AACxB,QAAM,sBAAsB,KAAK,aAAa,EAAE;AAChD,MAAI,sBAAsB,GAAI,OAAM,IAAI,MAAM,sGAA2B,mBAAmB;AAC5F,QAAM,iBAAiB,KAAK;AAE5B,QAAM,iBAAiB,KAAK,aAAa,EAAE;AAC3C,MAAI,iBAAiB,IAAO,OAAM,IAAI,MAAM,0EAAwB,cAAc;AAClF,QAAM,iBAAiB,KAAK,aAAa,EAAE;AAC3C,QAAM,mBAAmB,KAAK,aAAa,EAAE;AAC7C,QAAM,qBAAqB,KAAK,aAAa,EAAE;AAC/C,QAAM,qBAAqB,KAAK,aAAa,EAAE;AAC/C,QAAM,mBAAmB,KAAK,aAAa,EAAE;AAC7C,QAAM,mBAAmB,KAAK,aAAa,EAAE;AAI7C,WAAS,aAAa,IAAoB;AACxC,WAAO,MAAM,KAAK;AAAA,EACpB;AAEA,WAAS,eAAe,IAAoB;AAC1C,UAAM,MAAM,aAAa,EAAE;AAC3B,QAAI,MAAM,aAAa,KAAK,OAAQ,QAAO,OAAO,MAAM,CAAC;AACzD,WAAO,KAAK,SAAS,KAAK,MAAM,UAAU;AAAA,EAC5C;AAIA,QAAM,aAAuB,CAAC;AAG9B,WAAS,IAAI,GAAG,IAAI,OAAO,WAAW,SAAS,gBAAgB,KAAK;AAClE,UAAM,MAAM,KAAK,aAAa,KAAK,IAAI,CAAC;AACxC,QAAI,QAAQ,aAAa,QAAQ,aAAc;AAC/C,eAAW,KAAK,GAAG;AAAA,EACrB;AAGA,MAAI,cAAc;AAClB,QAAM,eAAe,oBAAI,IAAY;AACrC,WAAS,IAAI,GAAG,IAAI,oBAAoB,gBAAgB,gBAAgB,gBAAgB,WAAW,KAAK;AACtG,QAAI,aAAa,IAAI,WAAW,EAAG;AACnC,iBAAa,IAAI,WAAW;AAE5B,UAAM,MAAM,eAAe,WAAW;AACtC,UAAM,mBAAoB,aAAa,IAAK;AAC5C,aAAS,IAAI,GAAG,IAAI,oBAAoB,WAAW,SAAS,gBAAgB,KAAK;AAC/E,YAAM,MAAM,IAAI,aAAa,IAAI,CAAC;AAClC,UAAI,QAAQ,aAAa,QAAQ,aAAc;AAC/C,iBAAW,KAAK,GAAG;AAAA,IACrB;AACA,kBAAc,IAAI,aAAa,mBAAmB,CAAC;AAAA,EACrD;AAIA,QAAM,sBAAsB,aAAa;AACzC,QAAM,WAAW,IAAI,YAAY,WAAW,SAAS,mBAAmB;AAExE,WAAS,KAAK,GAAG,KAAK,WAAW,QAAQ,MAAM;AAC7C,UAAM,MAAM,eAAe,WAAW,EAAE,CAAC;AACzC,aAAS,IAAI,GAAG,IAAI,qBAAqB,KAAK;AAC5C,eAAS,KAAK,sBAAsB,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,SACrD,IAAI,aAAa,IAAI,CAAC,IACtB;AAAA,IACN;AAAA,EACF;AAIA,WAAS,UAAU,aAAqB,UAA0B;AAChE,QAAI,gBAAgB,gBAAgB,gBAAgB,UAAW,QAAO,OAAO,MAAM,CAAC;AACpF,QAAI,WAAW,gBAAiB,OAAM,IAAI,MAAM,0DAAa;AAE7D,UAAM,SAAmB,CAAC;AAC1B,QAAI,UAAU;AACd,QAAI,YAAY;AAChB,UAAM,UAAU,oBAAI,IAAY;AAEhC,WAAO,YAAY,gBAAgB,YAAY,aAAa,YAAY,UAAU;AAChF,UAAI,QAAQ,IAAI,OAAO,EAAG;AAC1B,UAAI,QAAQ,OAAO,iBAAkB;AACrC,cAAQ,IAAI,OAAO;AAEnB,YAAM,MAAM,eAAe,OAAO;AAClC,YAAM,YAAY,WAAW;AAC7B,aAAO,KAAK,YAAY,aAAa,IAAI,SAAS,GAAG,SAAS,IAAI,GAAG;AACrE,mBAAa,KAAK,IAAI,IAAI,QAAQ,SAAS;AAE3C,gBAAU,UAAU,SAAS,SAAS,SAAS,OAAO,IAAI;AAAA,IAC5D;AAEA,WAAO,OAAO,OAAO,MAAM;AAAA,EAC7B;AAIA,MAAI,eAAmC;AAEvC,WAAS,kBAA+B;AACtC,QAAI,aAAc,QAAO;AAEzB,QAAI,uBAAuB,KAAK,uBAAuB,cAAc;AACnE,qBAAe,IAAI,YAAY,CAAC;AAChC,aAAO;AAAA,IACT;AAEA,UAAM,cAAc,UAAU,oBAAoB,qBAAqB,UAAU;AACjF,UAAM,UAAU,YAAY,SAAS;AACrC,mBAAe,IAAI,YAAY,OAAO;AACtC,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,mBAAa,CAAC,IAAI,YAAY,aAAa,IAAI,CAAC;AAAA,IAClD;AACA,WAAO;AAAA,EACT;AAIA,QAAM,UAAU,UAAU,gBAAgB,kBAAkB,GAAG;AAC/D,QAAM,aAAyB,CAAC;AAEhC,WAAS,SAAS,GAAG,SAAS,OAAO,QAAQ,UAAU,WAAW,SAAS,iBAAiB,UAAU,KAAK;AACzG,UAAM,UAAU,QAAQ,aAAa,SAAS,EAAE;AAChD,QAAI,WAAW,KAAK,UAAU,IAAI;AAChC,iBAAW,KAAK,EAAE,MAAM,IAAI,MAAM,GAAG,aAAa,GAAG,MAAM,EAAE,CAAC;AAC9D;AAAA,IACF;AAEA,UAAM,YAAY,UAAU;AAC5B,UAAM,OAAO,YAAY,IACrB,QAAQ,SAAS,QAAQ,SAAS,SAAS,EAAE,SAAS,SAAS,IAC/D;AAEJ,UAAM,OAAO,QAAQ,SAAS,EAAE;AAChC,UAAM,cAAc,QAAQ,aAAa,SAAS,GAAG;AAErD,UAAM,OAAO,QAAQ,aAAa,SAAS,GAAG;AAE9C,eAAW,KAAK,EAAE,MAAM,MAAM,aAAa,KAAK,CAAC;AAAA,EACnD;AAIA,MAAI,iBAAgC;AAEpC,WAAS,gBAAwB;AAC/B,QAAI,eAAgB,QAAO;AAC3B,UAAM,OAAO,WAAW,CAAC;AACzB,QAAI,CAAC,QAAQ,KAAK,SAAS,GAAG;AAC5B,uBAAiB,OAAO,MAAM,CAAC;AAC/B,aAAO;AAAA,IACT;AACA,qBAAiB,UAAU,KAAK,aAAa,KAAK,QAAQ,eAAe;AACzE,WAAO;AAAA,EACT;AAIA,WAAS,eAAe,aAAqB,MAAsB;AACjE,UAAM,MAAM,gBAAgB;AAC5B,UAAM,KAAK,cAAc;AACzB,QAAI,IAAI,WAAW,KAAK,GAAG,WAAW,EAAG,QAAO,OAAO,MAAM,CAAC;AAE9D,UAAM,SAAmB,CAAC;AAC1B,QAAI,UAAU;AACd,QAAI,YAAY;AAChB,UAAM,UAAU,oBAAI,IAAY;AAEhC,WAAO,YAAY,gBAAgB,YAAY,aAAa,YAAY,MAAM;AAC5E,UAAI,QAAQ,IAAI,OAAO,EAAG;AAC1B,UAAI,QAAQ,OAAO,iBAAkB;AACrC,cAAQ,IAAI,OAAO;AAEnB,YAAM,MAAM,UAAU;AACtB,YAAM,YAAY,OAAO;AACzB,YAAM,YAAY,KAAK,IAAI,gBAAgB,SAAS;AACpD,UAAI,MAAM,aAAa,GAAG,QAAQ;AAChC,eAAO,KAAK,GAAG,SAAS,KAAK,MAAM,SAAS,CAAC;AAAA,MAC/C;AACA,mBAAa;AAEb,gBAAU,UAAU,IAAI,SAAS,IAAI,OAAO,IAAI;AAAA,IAClD;AAEA,WAAO,OAAO,OAAO,MAAM;AAAA,EAC7B;AAIA,WAAS,eAAe,OAAyB;AAC/C,QAAI,MAAM,SAAS,EAAG,QAAO,OAAO,MAAM,CAAC;AAC3C,QAAI,MAAM,OAAO,kBAAkB;AACjC,YAAM,aAAa,eAAe,MAAM,aAAa,MAAM,IAAI;AAE/D,UAAI,WAAW,SAAS,EAAG,QAAO;AAAA,IACpC;AACA,WAAO,UAAU,MAAM,aAAa,MAAM,IAAI;AAAA,EAChD;AAMA,WAAS,gBAAgB,MAA+B;AAGtD,UAAM,QAAQ,KAAK,QAAQ,OAAO,EAAE,EAAE,MAAM,GAAG;AAE/C,QAAI,MAAM,WAAW,GAAG;AAEtB,aAAO,WAAW,KAAK,OAAK,EAAE,SAAS,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK;AAAA,IACtE;AAIA,UAAM,cAAc,MAAM,CAAC;AAC3B,UAAM,aAAa,MAAM,MAAM,CAAC,EAAE,KAAK,GAAG;AAG1C,eAAW,KAAK,YAAY;AAC1B,UAAI,EAAE,SAAS,KAAK,EAAE,SAAS,YAAY;AAEzC,eAAO;AAAA,MACT;AAAA,IACF;AAGA,UAAM,WAAW,MAAM,MAAM,SAAS,CAAC;AACvC,WAAO,WAAW,KAAK,OAAK,EAAE,SAAS,KAAK,EAAE,SAAS,QAAQ,KAAK;AAAA,EACtE;AAIA,SAAO;AAAA,IACL,WAAW,MAA6B;AAEtC,YAAM,aAAa,KAAK,QAAQ,OAAO,EAAE;AACzC,YAAM,QAAQ,gBAAgB,UAAU;AACxC,UAAI,CAAC,SAAS,MAAM,SAAS,EAAG,QAAO;AACvC,YAAM,SAAS,eAAe,KAAK;AACnC,aAAO,OAAO,SAAS,IAAI,SAAS;AAAA,IACtC;AAAA,IAEA,UAAsB;AACpB,aAAO,WAAW,OAAO,OAAK,EAAE,SAAS,CAAC;AAAA,IAC5C;AAAA,EACF;AACF;;;ADrSA,SAAS,WAAW,QAAiC;AACnD,SAAO,IAAI,WAAW,QAAQ,GAAG,KAAK,IAAI,GAAG,OAAO,UAAU,CAAC;AACjE;AAGO,SAAS,UAAU,QAA8B;AACtD,QAAM,IAAI,WAAW,MAAM;AAC3B,SAAO,EAAE,CAAC,MAAM,MAAQ,EAAE,CAAC,MAAM,MAAQ,EAAE,CAAC,MAAM,KAAQ,EAAE,CAAC,MAAM;AACrE;AAGO,SAAS,WAAW,QAA8B;AACvD,SAAO,UAAU,MAAM;AACzB;AAGO,SAAS,aAAa,QAA8B;AACzD,QAAM,IAAI,WAAW,MAAM;AAC3B,SAAO,EAAE,CAAC,MAAM,OAAQ,EAAE,CAAC,MAAM,OAAQ,EAAE,CAAC,MAAM,MAAQ,EAAE,CAAC,MAAM;AACrE;AAMA,IAAM,cAAc,IAAI,YAAY,EAAE,OAAO,yBAAyB;AAC/D,SAAS,WAAW,QAA8B;AACvD,MAAI,OAAO,aAAa,YAAY,OAAQ,QAAO;AACnD,QAAM,OAAO,IAAI,WAAW,QAAQ,GAAG,YAAY,MAAM;AACzD,WAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,QAAI,KAAK,CAAC,MAAM,YAAY,CAAC,EAAG,QAAO;AAAA,EACzC;AACA,SAAO;AACT;AAGO,SAAS,UAAU,QAA8B;AACtD,QAAM,IAAI,WAAW,MAAM;AAC3B,SAAO,EAAE,CAAC,MAAM,MAAQ,EAAE,CAAC,MAAM,MAAQ,EAAE,CAAC,MAAM,MAAQ,EAAE,CAAC,MAAM;AACrE;AAGO,SAAS,YAAY,QAA8B;AACxD,QAAM,QAAQ,IAAI,WAAW,QAAQ,GAAG,KAAK,IAAI,KAAK,OAAO,UAAU,CAAC;AACxE,QAAM,OAAO,IAAI,YAAY,SAAS,EAAE,OAAO,MAAM,CAAC,EAAE,OAAO,KAAK,EAAE,QAAQ,WAAW,EAAE;AAC3F,SAAO,KAAK,UAAU,EAAE,WAAW,OAAO,KAAK,KAAK,SAAS,QAAQ;AACvE;AAGO,SAAS,aAAa,QAA+B;AAC1D,MAAI,OAAO,aAAa,EAAG,QAAO;AAClC,MAAI,WAAW,MAAM,EAAG,QAAO;AAC/B,MAAI,UAAU,MAAM,EAAG,QAAO;AAC9B,MAAI,aAAa,MAAM,EAAG,QAAO;AACjC,MAAI,UAAU,MAAM,EAAG,QAAO;AAC9B,MAAI,YAAY,MAAM,EAAG,QAAO;AAChC,SAAO;AACT;AAQO,SAAS,iBAAiB,QAAgD;AAC/E,MAAI;AACF,UAAM,MAAM,gBAAgB,OAAO,KAAK,MAAM,CAAC;AAC/C,UAAM,QAAQ,IAAI,QAAQ,EAAE,IAAI,OAAK,EAAE,IAAI;AAC3C,QAAI,MAAM,SAAS,UAAU,KAAK,MAAM,SAAS,MAAM,EAAG,QAAO;AACjE,QAAI,MAAM,SAAS,YAAY,EAAG,QAAO;AAEzC,QAAI,MAAM,KAAK,OAAK,MAAM,aAAa,EAAE,WAAW,SAAS,CAAC,EAAG,QAAO;AACxE,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAMA,eAAsB,gBAAgB,QAAoE;AACxG,MAAI;AACF,UAAM,MAAM,MAAM,MAAM,UAAU,MAAM;AAExC,QAAI,IAAI,KAAK,iBAAiB,EAAG,QAAO;AAExC,QAAI,IAAI,KAAK,mBAAmB,EAAG,QAAO;AAE1C,QAAI,IAAI,KAAK,sBAAsB,KAAK,IAAI,KAAK,UAAU,EAAG,QAAO;AAErE,UAAM,aAAa,OAAO,KAAK,IAAI,KAAK,EAAE,KAAK,OAAK,EAAE,WAAW,WAAW,CAAC;AAC7E,QAAI,WAAY,QAAO;AACvB,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;","names":[]}

package/dist/chunk-MOL7MDBG.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/page-range.ts"],"sourcesContent":["/** 페이지/섹션 범위 파싱 유틸리티 */\n\n/**\n * 페이지 범위 지정을 1-based Set<number>로 변환.\n *\n * @param spec - [1,2,3] 또는 \"1-3\" 또는 \"1,3,5-7\"\n * @param maxPages - 최대 페이지 수 (클램핑 상한)\n * @returns 1-based 페이지 번호 Set\n */\nexport function parsePageRange(spec: number[] | string, maxPages: number): Set<number> {\n  const result = new Set<number>()\n  if (maxPages <= 0) return result\n\n  if (Array.isArray(spec)) {\n    for (const n of spec) {\n      const page = Math.round(n)\n      if (page >= 1 && page <= maxPages) result.add(page)\n    }\n    return result\n  }\n\n  if (typeof spec !== \"string\" || spec.trim() === \"\") return result\n\n  const parts = spec.split(\",\")\n  for (const part of parts) {\n    const trimmed = part.trim()\n    if (!trimmed) continue\n\n    const rangeMatch = trimmed.match(/^(\\d+)\\s*-\\s*(\\d+)$/)\n    if (rangeMatch) {\n      const start = Math.max(1, parseInt(rangeMatch[1], 10))\n      const end = Math.min(maxPages, parseInt(rangeMatch[2], 10))\n      for (let i = start; i <= end; i++) result.add(i)\n    } else {\n      const page = parseInt(trimmed, 10)\n      if (!isNaN(page) && page >= 1 && page <= maxPages) result.add(page)\n    }\n  }\n\n  return result\n}\n"],"mappings":";;;AASO,SAAS,eAAe,MAAyB,UAA+B;AACrF,QAAM,SAAS,oBAAI,IAAY;AAC/B,MAAI,YAAY,EAAG,QAAO;AAE1B,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,eAAW,KAAK,MAAM;AACpB,YAAM,OAAO,KAAK,MAAM,CAAC;AACzB,UAAI,QAAQ,KAAK,QAAQ,SAAU,QAAO,IAAI,IAAI;AAAA,IACpD;AACA,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,SAAS,YAAY,KAAK,KAAK,MAAM,GAAI,QAAO;AAE3D,QAAM,QAAQ,KAAK,MAAM,GAAG;AAC5B,aAAW,QAAQ,OAAO;AACxB,UAAM,UAAU,KAAK,KAAK;AAC1B,QAAI,CAAC,QAAS;AAEd,UAAM,aAAa,QAAQ,MAAM,qBAAqB;AACtD,QAAI,YAAY;AACd,YAAM,QAAQ,KAAK,IAAI,GAAG,SAAS,WAAW,CAAC,GAAG,EAAE,CAAC;AACrD,YAAM,MAAM,KAAK,IAAI,UAAU,SAAS,WAAW,CAAC,GAAG,EAAE,CAAC;AAC1D,eAAS,IAAI,OAAO,KAAK,KAAK,IAAK,QAAO,IAAI,CAAC;AAAA,IACjD,OAAO;AACL,YAAM,OAAO,SAAS,SAAS,EAAE;AACjC,UAAI,CAAC,MAAM,IAAI,KAAK,QAAQ,KAAK,QAAQ,SAAU,QAAO,IAAI,IAAI;AAAA,IACpE;AAAA,EACF;AAEA,SAAO;AACT;","names":[]}

package/dist/formula-5NKVS2LR.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/Users/chris_gomdori/workspace/kordoc/dist/formula-5NKVS2LR.cjs","../src/pdf/formula/models.ts","../src/pdf/formula/postprocess.ts","../src/pdf/formula/detector.ts","../src/pdf/formula/recognizer.ts","../src/pdf/formula/pipeline.ts"],"names":[],"mappings":"AAAA,m+BAA6B;AAC7B;AACA;ACQA,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;AAMO,SAAS,mBAAA,CAAA,EAA8B;AAC5C,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,UAAU,CAAA;AAAA,EAClC;AACA,EAAA,OAAO,wBAAA,yBAAK,CAAQ,EAAG,QAAA,EAAU,QAAA,EAAU,QAAA,EAAU,UAAU,CAAA;AACjE;AAaA,MAAA,SAAsB,qBAAA,CAAA,EAAgD;AACpE,EAAA,MAAM,IAAA,EAAM,mBAAA,CAAoB,CAAA;AAChC,EAAA,MAAM,OAAA,EAAwB,CAAC,CAAA;AAC/B,EAAA,IAAA,CAAA,MAAW,KAAA,GAAQ,kBAAA,EAAoB;AACrC,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;AAoBA;AACE,EAAA;AACA,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;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACE,oBAAA;AACA,IAAA;AAAA,EAAA;AAEF,EAAA;AACE,IAAA;AAAsB,EAAA;AAChB,EAAA;AACR,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;AACR,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;AACR,IAAA;AAAiE,EAAA;AAGnE,EAAA;AACE,IAAA;AACE,MAAA;AAAqB,IAAA;AACf,IAAA;AACR,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;AD7EA;AACA;AEtNA;AAAiC,EAAA;AAC/B,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAEF;AAEO;AACL,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AAAI,EAAA;AAEN,EAAA;AACA,EAAA;AACA,EAAA;AAEA,EAAA;AACA,EAAA;AACF;AAEO;AACL,EAAA;AAEA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AACE,MAAA;AACE,QAAA;AACA,QAAA;AACA,QAAA;AAAA,MAAA;AACF,IAAA;AAEF,IAAA;AAAqB,EAAA;AAEzB;AAEO;AACL,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AACE,MAAA;AACE,QAAA;AACA,QAAA;AAAY,MAAA;AACd,IAAA;AAEA,MAAA;AACA,MAAA;AAAY,IAAA;AACd,EAAA;AAEF,EAAA;AACF;AAKO;AACL,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AAEE,MAAA;AACA,MAAA;AACA,MAAA;AAEE,QAAA;AACE,UAAA;AAAqB,QAAA;AAEvB,QAAA;AACE,UAAA;AAAqB,QAAA;AAGrB,UAAA;AACA,UAAA;AACA,UAAA;AACE,YAAA;AAAwB,UAAA;AAC1B,QAAA;AAGF,QAAA;AACA,QAAA;AAAA,MAAA;AACF,IAAA;AAEF,IAAA;AACA,IAAA;AAAA,EAAA;AAEF,EAAA;AACF;AAOA;AAAsD;AAAA,EAAA;AAEpD,EAAA;AAAQ,EAAA;AAAS,EAAA;AAAS,EAAA;AAAQ,EAAA;AAAS,EAAA;AAC3C,EAAA;AAAS,EAAA;AAAO,EAAA;AAAM,EAAA;AAAM,EAAA;AAAO,EAAA;AAAQ,EAAA;AAAQ,EAAA;AACnD,EAAA;AAAS,EAAA;AAAU,EAAA;AAAU;AAAA,EAAA;AAE7B,EAAA;AAAU,EAAA;AAAS,EAAA;AAAO,EAAA;AAAM,EAAA;AAAO,EAAA;AAAS,EAAA;AAChD,EAAA;AAAO,EAAA;AAAO,EAAA;AAAM,EAAA;AAAM,EAAA;AAAM,EAAA;AAAM,EAAA;AAAQ,EAAA;AAAQ,EAAA;AAAU,EAAA;AAChE,EAAA;AAAU,EAAA;AAAY;AAAA,EAAA;AAEtB,EAAA;AAAM,EAAA;AAAS,EAAA;AAAM,EAAA;AAAU,EAAA;AAAU,EAAA;AAAY,EAAA;AACrD,EAAA;AAAO,EAAA;AAAO,EAAA;AAAU,EAAA;AAAU,EAAA;AAAY,EAAA;AAC9C,EAAA;AAAU,EAAA;AAAU,EAAA;AAAW,EAAA;AAAO,EAAA;AAAQ,EAAA;AAAQ,EAAA;AAAO,EAAA;AAAO;AAAA,EAAA;AAEpE,EAAA;AAAS,EAAA;AAAQ,EAAA;AAAS,EAAA;AAAS,EAAA;AAAW,EAAA;AAC9C,EAAA;AAAQ,EAAA;AAAO,EAAA;AAAS,EAAA;AAAY,EAAA;AAAQ,EAAA;AAAS,EAAA;AACrD,EAAA;AAAM,EAAA;AAAM,EAAA;AAAM,EAAA;AAAW,EAAA;AAAM,EAAA;AAAS,EAAA;AAAO,EAAA;AACnD,EAAA;AAAS,EAAA;AAAY,EAAA;AAAO,EAAA;AAAW,EAAA;AAAO,EAAA;AAC9C,EAAA;AAAO,EAAA;AAAO;AAAA,EAAA;AAEd,EAAA;AAAS,EAAA;AAAS,EAAA;AAAS,EAAA;AAAU,EAAA;AAAM,EAAA;AAAM,EAAA;AACjD,EAAA;AAAW,EAAA;AAAO,EAAA;AAAO;AAAA,EAAA;AAEzB,EAAA;AAAM,EAAA;AAAQ,EAAA;AAAU,EAAA;AAAc,EAAA;AAAa,EAAA;AACnD,EAAA;AAAc,EAAA;AAAa,EAAA;AAAkB,EAAA;AAAW,EAAA;AACxD,EAAA;AAAkB,EAAA;AAAiB;AAAA,EAAA;AAEnC,EAAA;AAAO,EAAA;AAAQ,EAAA;AAAU,EAAA;AAAO,EAAA;AAAQ,EAAA;AAAS,EAAA;AAAQ,EAAA;AAAY;AAAA,EAAA;AAErE,EAAA;AAAO,EAAA;AAAO,EAAA;AAAO,EAAA;AAAO,EAAA;AAAO,EAAA;AACnC,EAAA;AAAU,EAAA;AAAU,EAAA;AAAU,EAAA;AAAQ,EAAA;AAAQ,EAAA;AAC9C,EAAA;AAAO,EAAA;AAAM,EAAA;AAAM,EAAA;AAAO,EAAA;AAAO,EAAA;AAAU,EAAA;AAC3C,EAAA;AAAO,EAAA;AAAO,EAAA;AAAO,EAAA;AAAO,EAAA;AAAO,EAAA;AAAO,EAAA;AAAO,EAAA;AAAO,EAAA;AAAO,EAAA;AAAO,EAAA;AAAO;AAAA,EAAA;AAE7E,EAAA;AAAS,EAAA;AAAW,EAAA;AAAS,EAAA;AAAS,EAAA;AAAS,EAAA;AAAO,EAAA;AAAQ,EAAA;AAAM,EAAA;AACpE,EAAA;AAAO,EAAA;AAAO,EAAA;AAAS,EAAA;AAAS;AAAA,EAAA;AAEhC,EAAA;AAAQ,EAAA;AAAS,EAAA;AAAO,EAAA;AAAO,EAAA;AACjC;AAWO;AACL,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AAEE,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AAGA,MAAA;AACE,QAAA;AACA,QAAA;AACA,QAAA;AAAA,MAAA;AAIF,MAAA;AACA,MAAA;AAEE,QAAA;AACE,UAAA;AACE,YAAA;AACA,YAAA;AAAA,UAAA;AACF,QAAA;AACF,MAAA;AAGF,MAAA;AACA,MAAA;AACE,QAAA;AAA+B,MAAA;AAEjC,MAAA;AAAI,IAAA;AAEJ,MAAA;AACA,MAAA;AAAA,IAAA;AACF,EAAA;AAEF,EAAA;AACF;AAcO;AACL,EAAA;AACA,EAAA;AAGA,EAAA;AACA,EAAA;AAGA,EAAA;AAGA,EAAA;AACiG,IAAA;AAC7F,EAAA;AAGF,IAAA;AAEF,EAAA;AAGA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAA6D,EAAA;AAK/D,EAAA;AACE,IAAA;AAA0B,MAAA;AACsB,IAAA;AAEhD,IAAA;AAAwB,EAAA;AAM1B,EAAA;AAIA,EAAA;AAIA,EAAA;AAIA,EAAA;AACA,EAAA;AAIA,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACE,MAAA;AACA,MAAA;AACA,MAAA;AACE,QAAA;AAA6C,MAAA;AAC/C,IAAA;AACF,EAAA;AAMF,EAAA;AAEA,EAAA;AAIA,EAAA;AACE,IAAA;AACA,IAAA;AAA4B,EAAA;AAK9B,EAAA;AACE,IAAA;AACA,IAAA;AAEE,MAAA;AACA,MAAA;AAAyB,IAAA;AAC3B,EAAA;AAIF,EAAA;AAIA,EAAA;AAIA,EAAA;AAIA,EAAA;AAGA,EAAA;AAEA,EAAA;AACF;AAWO;AACL,EAAA;AAEA,EAAA;AAEE,IAAA;AACA,IAAA;AACA,IAAA;AACE,MAAA;AACA,MAAA;AACA,MAAA;AAAsC,IAAA;AAExC,IAAA;AACE,MAAA;AAGA,MAAA;AAA4C,IAAA;AAC9C,EAAA;AAEF,EAAA;AACF;AAMA;AACE,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACE,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AAAI,IAAA;AAEJ,MAAA;AAAA,IAAA;AAEA,MAAA;AACA,MAAA;AAAA,IAAA;AACF,EAAA;AAEF,EAAA;AACF;AAaO;AAEL,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACE,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AAAI,IAAA;AAEJ,MAAA;AACA,MAAA;AAAA,IAAA;AAEA,MAAA;AACA,MAAA;AAAA,IAAA;AACF,EAAA;AAGF,EAAA;AACA,EAAA;AACE,IAAA;AACE,MAAA;AACA,MAAA;AAAA,IAAA;AAIF,IAAA;AACA,IAAA;AACE,MAAA;AACE,QAAA;AACA,QAAA;AAAA,MAAA;AACF,IAAA;AAEF,IAAA;AACA,IAAA;AACE,MAAA;AACE,QAAA;AACA,QAAA;AAAA,MAAA;AACF,IAAA;AAEF,IAAA;AACA,IAAA;AACA,IAAA;AAEE,MAAA;AACE,QAAA;AAAY,MAAA;AACd,IAAA;AACF,EAAA;AAKF,EAAA;AACA,EAAA;AAEA,EAAA;AACF;AF2NA;AACA;AG5pBA;AACA;AACA;AAEA;AAEA;AACA;AAEA;AACA;AAeA;AAKE,EAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AAAwC,EAAA;AAG1C,EAAA;AACA,EAAA;AACE,IAAA;AAA8E,EAAA;AAEhF,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AAA6D,EAAA;AAE/D,EAAA;AAEA,EAAA;AACA,EAAA;AAEA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAEA,IAAA;AACA,IAAA;AACA,IAAA;AACE,MAAA;AACA,MAAA;AACE,QAAA;AACA,QAAA;AAAU,MAAA;AACZ,IAAA;AAGF,IAAA;AACA,IAAA;AAGA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAEA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAEA,IAAA;AAEA,IAAA;AAEA,IAAA;AAAgB,MAAA;AACd,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACkC,MAAA;AAC3B,IAAA;AACR,EAAA;AAIH,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AAA2C,EAAA;AAI7C,EAAA;AAEA,EAAA;AAAwB,IAAA;AACyB,IAAA;AACvC,IAAA;AACC,EAAA;AAEb;AAUO;AAIL,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AAKA,EAAA;AACA,EAAA;AACA,EAAA;AAEA,EAAA;AACE,IAAA;AACA,IAAA;AACE,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AAEA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AAAgC,IAAA;AAClC,EAAA;AAGF,EAAA;AACF;AAEA;AACE,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACE,MAAA;AACE,QAAA;AACA,QAAA;AAAA,MAAA;AACF,IAAA;AAEF,IAAA;AAAwB,EAAA;AAE1B,EAAA;AACF;AAEA;AAIE,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACF;AAEA;AACE,EAAA;AACA,EAAA;AACA,EAAA;AACF;AH6lBA;AACA;AI3yBA;AACA;AACA;AACA;AACA;AAaA;AAIE,EAAA;AACA,EAAA;AAEA,EAAA;AACA,EAAA;AAEA,EAAA;AAEA,EAAA;AACA,EAAA;AACE,IAAA;AAAmC,EAAA;AAErC,EAAA;AACA,EAAA;AACE,IAAA;AAA2D,EAAA;AAE7D,EAAA;AACA,EAAA;AACA,EAAA;AACE,IAAA;AAA0E,EAAA;AAE5E,EAAA;AAGA,EAAA;AAEA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AAGA,IAAA;AACA,IAAA;AAEA,IAAA;AAAiC,MAAA;AACpB,MAAA;AACY,IAAA;AAGzB,IAAA;AAEA,IAAA;AACA,IAAA;AACE,MAAA;AAAuC,IAAA;AAEzC,IAAA;AACA,IAAA;AACE,MAAA;AAAwD,IAAA;AAE1D,IAAA;AACA,IAAA;AACA,IAAA;AAGA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACE,MAAA;AACA,MAAA;AACE,QAAA;AACA,QAAA;AAAS,MAAA;AACX,IAAA;AAEF,IAAA;AACA,IAAA;AAA2B,EAAA;AAI7B,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAAW,EAAA;AAIb,EAAA;AACA,EAAA;AACF;AAQO;AACL,EAAA;AACA,EAAA;AACA,EAAA;AAGA,EAAA;AACE,IAAA;AACA,IAAA;AACE,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AAEA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AAAqC,IAAA;AACvC,EAAA;AAEF,EAAA;AACF;AJmwBA;AACA;AK53BA;AAGA;AA6BO;AAAsB,EAAA;AACnB,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAYN,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAAkB,EAAA;AACpB;AAAA;AAAA;AAAA;AAAA,EAAA;AAOE,IAAA;AAA+C,MAAA;AACpB,MAAA;AACwB,MAAA;AACR,IAAA;AAG3C,IAAA;AAAkE,MAAA;AAChE,QAAA;AACE,QAAA;AAC+B,MAAA;AACjC,MAAA;AACA,QAAA;AACE,QAAA;AACoB,MAAA;AACtB,MAAA;AACA,QAAA;AACE,QAAA;AACwC,MAAA;AAC1C,MAAA;AACA,QAAA;AACE,QAAA;AAC6B,MAAA;AAC/B,IAAA;AAGF,IAAA;AACA,IAAA;AAKA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAEA,IAAA;AAAgF,MAAA;AACtD,MAAA;AACE,IAAA;AAI5B,IAAA;AAAkD,MAAA;AACG,MAAA;AACA,MAAA;AACA,IAAA;AAKrD,IAAA;AACA,IAAA;AACA,IAAA;AAIA,IAAA;AAEA,IAAA;AAEA,IAAA;AAA2B,MAAA;AACzB,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACK,MAAA;AACE,MAAA;AACP,MAAA;AACA,IAAA;AACD,EAAA;AACH;AAAA,EAAA;AAKE,IAAA;AACE,MAAA;AAAoB,IAAA;AACd,IAAA;AAER,EAAA;AACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA;AAaE,IAAA;AACA,IAAA;AACA,IAAA;AACE,MAAA;AACA,MAAA;AACA,MAAA;AACE,QAAA;AACA,QAAA;AAEA,wBAAA;AAEA,QAAA;AACE,UAAA;AAAqB,YAAA;AACe,YAAA;AACxB,YAAA;AAC4D,UAAA;AAExE,UAAA;AAA6B,QAAA;AAG7B,UAAA;AAAe,YAAA;AACwD;AAAA,UAAA;AACvE,QAAA;AACF,MAAA;AAEF,MAAA;AAAO,IAAA;AAEP,MAAA;AAAY,IAAA;AACd,EAAA;AACF,EAAA;AAME,IAAA;AAEA,IAAA;AACA,IAAA;AAAmC,MAAA;AAChB,MAAA;AAGf,QAAA;AAAO,MAAA;AACT,IAAA;AAGF,IAAA;AACA,IAAA;AAEA,IAAA;AAGA,IAAA;AACA,IAAA;AACE,MAAA;AAA6F,IAAA;AAG/F,IAAA;AACA,IAAA;AAGA,IAAA;AACE,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AAGA,MAAA;AAAuC,QAAA;AACK,MAAA;AAM5C,MAAA;AAEA,MAAA;AACA,MAAA;AACE,QAAA;AAAc,UAAA;AACZ,YAAA;AACgB,YAAA;AACA,YAAA;AACE,YAAA;AACN,UAAA;AACZ,UAAA;AACA,QAAA;AACF,MAAA;AAEA,QAAA;AAAe,UAAA;AAC6F;AAAA,QAAA;AAE5G,QAAA;AAAQ,MAAA;AAGV,MAAA;AAA4B,IAAA;AAG9B,IAAA;AAAO,MAAA;AACL,MAAA;AACe,MAAA;AACC,MAAA;AAChB,MAAA;AACA,MAAA;AACA,IAAA;AACF,EAAA;AAEJ;AAEA;AACE,EAAA;AACE,IAAA;AAAoB,EAAA;AAEpB,IAAA;AAAU,MAAA;AAEyD,IAAA;AACnE,EAAA;AAEJ;AAEA;AACE,EAAA;AACA,EAAA;AACE,IAAA;AAA0B,MAAA;AACxB,MAAA;AAEE,QAAA;AAAmD,MAAA;AACpD,IAAA;AACF,EAAA;AAED,IAAA;AAA6B,EAAA;AAEjC;AAGA;AACE,EAAA;AACA,EAAA;AACE,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAAuB,EAAA;AAEzB,EAAA;AACF;ALgyBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"/Users/chris_gomdori/workspace/kordoc/dist/formula-5NKVS2LR.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/pix2text/`.\n */\nexport function getFormulaModelsDir(): string {\n  const override = process.env.KORDOC_MODEL_CACHE\n  if (override && override.trim()) {\n    return join(override, \"pix2text\")\n  }\n  return join(homedir(), \".cache\", \"kordoc\", \"models\", \"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 getFormulaModelStatus(): Promise<ModelStatus[]> {\n  const dir = getFormulaModelsDir()\n  const result: ModelStatus[] = []\n  for (const spec of ALL_FORMULA_MODELS) {\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\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 ensureFormulaModels(onProgress?: ProgressHandler): Promise<void> {\n  const dir = getFormulaModelsDir()\n  await mkdir(dir, { recursive: true })\n\n  for (const spec of ALL_FORMULA_MODELS) {\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/** 단일 모델만 확인/다운로드 (진단 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  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    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    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    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","/**\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      let pageIdx = 0\n      for (const page of doc.pages()) {\n        pageIdx++\n        if (pageFilter && !pageFilter.has(page.number)) continue\n\n        onPageProgress?.(page.number, doc.getPageCount())\n\n        try {\n          const result = await withTimeout(\n            this.processPage(page.number, page),\n            this.opts.pageTimeoutMs,\n            `formula page ${page.number} 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 ${page.number} 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  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"]}

package/dist/formula-JCNF43NE.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/pdf/formula/models.ts","../src/pdf/formula/postprocess.ts","../src/pdf/formula/detector.ts","../src/pdf/formula/recognizer.ts","../src/pdf/formula/pipeline.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/pix2text/`.\n */\nexport function getFormulaModelsDir(): string {\n  const override = process.env.KORDOC_MODEL_CACHE\n  if (override && override.trim()) {\n    return join(override, \"pix2text\")\n  }\n  return join(homedir(), \".cache\", \"kordoc\", \"models\", \"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 getFormulaModelStatus(): Promise<ModelStatus[]> {\n  const dir = getFormulaModelsDir()\n  const result: ModelStatus[] = []\n  for (const spec of ALL_FORMULA_MODELS) {\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\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 ensureFormulaModels(onProgress?: ProgressHandler): Promise<void> {\n  const dir = getFormulaModelsDir()\n  await mkdir(dir, { recursive: true })\n\n  for (const spec of ALL_FORMULA_MODELS) {\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/** 단일 모델만 확인/다운로드 (진단 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  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    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    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    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","/**\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      let pageIdx = 0\n      for (const page of doc.pages()) {\n        pageIdx++\n        if (pageFilter && !pageFilter.has(page.number)) continue\n\n        onPageProgress?.(page.number, doc.getPageCount())\n\n        try {\n          const result = await withTimeout(\n            this.processPage(page.number, page),\n            this.opts.pageTimeoutMs,\n            `formula page ${page.number} 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 ${page.number} 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  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"],"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;AAMO,SAAS,sBAA8B;AAC5C,QAAM,WAAW,QAAQ,IAAI;AAC7B,MAAI,YAAY,SAAS,KAAK,GAAG;AAC/B,WAAO,KAAK,UAAU,UAAU;AAAA,EAClC;AACA,SAAO,KAAK,QAAQ,GAAG,UAAU,UAAU,UAAU,UAAU;AACjE;AAaA,eAAsB,wBAAgD;AACpE,QAAM,MAAM,oBAAoB;AAChC,QAAM,SAAwB,CAAC;AAC/B,aAAW,QAAQ,oBAAoB;AACrC,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;AAoBA,eAAsB,oBAAoB,YAA6C;AACrF,QAAM,MAAM,oBAAoB;AAChC,QAAM,MAAM,KAAK,EAAE,WAAW,KAAK,CAAC;AAEpC,aAAW,QAAQ,oBAAoB;AACrC,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,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,EAAC;AACT,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,IAAC;AACT,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,IAAC;AACT,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,IAAC;AACT,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;;;AClSA,IAAM,2BAA2B;AAAA,EAC/B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEO,SAAS,iBAAiB,OAAuB;AACtD,MAAI,IAAI,wBAAwB,KAAK;AACrC,MAAI,eAAe,CAAC;AACpB,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,UAAM,OAAO,iBAAiB,CAAC;AAC/B,QAAI,SAAS,EAAG;AAChB,QAAI;AAAA,EACN;AACA,MAAI,gBAAgB,CAAC;AACrB,MAAI,wBAAwB,CAAC;AAC7B,MAAI,EAAE,KAAK;AAEX,MAAI,iBAAiB,CAAC,EAAG,QAAO;AAChC,SAAO;AACT;AAEO,SAAS,wBAAwB,GAAmB;AACzD,MAAI,IAAI;AAER,aAAS;AACP,UAAM,UAAU,EAAE,QAAQ,UAAU,EAAE;AACtC,QAAI,UAAU;AACd,eAAW,KAAK,0BAA0B;AACxC,UAAI,QAAQ,SAAS,CAAC,GAAG;AACvB,YAAI,QAAQ,MAAM,GAAG,QAAQ,SAAS,EAAE,MAAM;AAC9C,kBAAU;AACV;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,QAAS,QAAO;AAAA,EACvB;AACF;AAEO,SAAS,eAAe,GAAmB;AAChD,MAAI,MAAM;AACV,MAAI,YAAY;AAChB,aAAW,KAAK,GAAG;AACjB,QAAI,KAAK,KAAK,CAAC,GAAG;AAChB,UAAI,CAAC,WAAW;AACd,eAAO;AACP,oBAAY;AAAA,MACd;AAAA,IACF,OAAO;AACL,aAAO;AACP,kBAAY;AAAA,IACd;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,iBAAiB,GAAmB;AAClD,MAAI,MAAM;AACV,MAAI,IAAI;AACR,QAAM,QAAQ;AACd,SAAO,IAAI,MAAM,QAAQ;AACvB,UAAM,KAAK,MAAM,CAAC;AAClB,QAAI,OAAO,KAAK;AAEd,UAAI,IAAI,IAAI;AACZ,aAAO,IAAI,MAAM,UAAU,KAAK,KAAK,MAAM,CAAC,CAAC,EAAG;AAChD,UAAI,IAAI,MAAM,UAAU,MAAM,CAAC,MAAM,KAAK;AAExC,eAAO,IAAI,SAAS,GAAG,KAAK,IAAI,SAAS,GAAI,GAAG;AAC9C,gBAAM,IAAI,MAAM,GAAG,EAAE;AAAA,QACvB;AACA,YAAI,IAAI,SAAS,GAAG,KAAK,IAAI,SAAS,GAAG,GAAG;AAC1C,gBAAM,IAAI,MAAM,GAAG,EAAE;AAAA,QACvB,OAAO;AAEL,cAAI,IAAI,IAAI;AACZ,iBAAO,IAAI,KAAK,WAAW,KAAK,IAAI,IAAI,CAAC,CAAC,EAAG;AAC7C,cAAI,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,QAAQ,IAAI,IAAI,QAAQ;AAClD,kBAAM,IAAI,MAAM,GAAG,IAAI,CAAC;AAAA,UAC1B;AAAA,QAEF;AACA,YAAI,IAAI;AACR;AAAA,MACF;AAAA,IACF;AACA,WAAO;AACP;AAAA,EACF;AACA,SAAO;AACT;AAOA,IAAM,mBAAwC,oBAAI,IAAI;AAAA;AAAA,EAEpD;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAS;AAAA,EAC3C;AAAA,EAAS;AAAA,EAAO;AAAA,EAAM;AAAA,EAAM;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EACnD;AAAA,EAAS;AAAA,EAAU;AAAA,EAAU;AAAA;AAAA,EAE7B;AAAA,EAAU;AAAA,EAAS;AAAA,EAAO;AAAA,EAAM;AAAA,EAAO;AAAA,EAAS;AAAA,EAChD;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAU;AAAA,EAChE;AAAA,EAAU;AAAA,EAAY;AAAA;AAAA,EAEtB;AAAA,EAAM;AAAA,EAAS;AAAA,EAAM;AAAA,EAAU;AAAA,EAAU;AAAA,EAAY;AAAA,EACrD;AAAA,EAAO;AAAA,EAAO;AAAA,EAAU;AAAA,EAAU;AAAA,EAAY;AAAA,EAC9C;AAAA,EAAU;AAAA,EAAU;AAAA,EAAW;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAO;AAAA;AAAA,EAEpE;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAS;AAAA,EAAW;AAAA,EAC9C;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAS;AAAA,EAAY;AAAA,EAAQ;AAAA,EAAS;AAAA,EACrD;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAW;AAAA,EAAM;AAAA,EAAS;AAAA,EAAO;AAAA,EACnD;AAAA,EAAS;AAAA,EAAY;AAAA,EAAO;AAAA,EAAW;AAAA,EAAO;AAAA,EAC9C;AAAA,EAAO;AAAA,EAAO;AAAA;AAAA,EAEd;AAAA,EAAS;AAAA,EAAS;AAAA,EAAS;AAAA,EAAU;AAAA,EAAM;AAAA,EAAM;AAAA,EACjD;AAAA,EAAW;AAAA,EAAO;AAAA,EAAO;AAAA;AAAA,EAEzB;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAU;AAAA,EAAc;AAAA,EAAa;AAAA,EACnD;AAAA,EAAc;AAAA,EAAa;AAAA,EAAkB;AAAA,EAAW;AAAA,EACxD;AAAA,EAAkB;AAAA,EAAiB;AAAA;AAAA,EAEnC;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAU;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAY;AAAA;AAAA,EAErE;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EACnC;AAAA,EAAU;AAAA,EAAU;AAAA,EAAU;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAC9C;AAAA,EAAO;AAAA,EAAM;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAAA,EAAU;AAAA,EAC3C;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA;AAAA,EAE7E;AAAA,EAAS;AAAA,EAAW;AAAA,EAAS;AAAA,EAAS;AAAA,EAAS;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAM;AAAA,EACpE;AAAA,EAAO;AAAA,EAAO;AAAA,EAAS;AAAA,EAAS;AAAA;AAAA,EAEhC;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AACzC,CAAC;AAWM,SAAS,gBAAgB,GAAmB;AACjD,MAAI,MAAM;AACV,MAAI,IAAI;AACR,SAAO,IAAI,EAAE,QAAQ;AACnB,QAAI,EAAE,CAAC,MAAM,QAAQ,IAAI,IAAI,EAAE,UAAU,WAAW,KAAK,EAAE,IAAI,CAAC,CAAC,GAAG;AAElE,UAAI,IAAI,IAAI;AACZ,aAAO,IAAI,EAAE,UAAU,WAAW,KAAK,EAAE,CAAC,CAAC,EAAG;AAC9C,YAAM,OAAO,EAAE,MAAM,IAAI,GAAG,CAAC;AAC7B,YAAM,WAAW,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI;AAGvC,UAAI,aAAa,KAAK;AACpB,eAAO,OAAO;AACd,YAAI;AACJ;AAAA,MACF;AAGA,UAAI,UAAU,KAAK;AACnB,UAAI,CAAC,iBAAiB,IAAI,IAAI,KAAK,KAAK,UAAU,GAAG;AAEnD,iBAAS,MAAM,KAAK,SAAS,GAAG,OAAO,GAAG,OAAO;AAC/C,cAAI,iBAAiB,IAAI,KAAK,MAAM,GAAG,GAAG,CAAC,GAAG;AAC5C,sBAAU;AACV;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,aAAO,OAAO,KAAK,MAAM,GAAG,OAAO;AACnC,UAAI,UAAU,KAAK,QAAQ;AACzB,eAAO,MAAM,KAAK,MAAM,OAAO;AAAA,MACjC;AACA,UAAI;AAAA,IACN,OAAO;AACL,aAAO,EAAE,CAAC;AACV;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAcO,SAAS,iBAAiB,GAAoB;AACnD,QAAM,IAAI,EAAE,KAAK;AACjB,MAAI,EAAE,WAAW,EAAG,QAAO;AAG3B,QAAM,WAAW,EAAE,QAAQ,WAAW,EAAE;AACxC,MAAI,SAAS,UAAU,EAAG,QAAO;AAGjC,MAAI,gBAAgB,KAAK,CAAC,EAAG,QAAO;AAGpC,MACE,+FAA+F;AAAA,IAC7F;AAAA,EACF;AAEA,WAAO;AAET,QAAM,SAAS,cAAc,CAAC;AAG9B,MAAI,OAAO,UAAU,GAAG;AACtB,UAAM,OAAO,oBAAI,IAAoB;AACrC,eAAW,OAAO,OAAQ,MAAK,IAAI,MAAM,KAAK,IAAI,GAAG,KAAK,KAAK,CAAC;AAChE,QAAI,WAAW;AACf,eAAW,KAAK,KAAK,OAAO,EAAG,KAAI,IAAI,SAAU,YAAW;AAC5D,QAAI,YAAY,KAAK,WAAW,OAAO,UAAU,IAAK,QAAO;AAAA,EAC/D;AAIA,MAAI,OAAO,UAAU,KAAK,OAAO,UAAU,GAAG;AAC5C,UAAM,aAAa,OAAO;AAAA,MAAK,CAAC,QAC9B,eAAe,KAAK,GAAG,KAAK,UAAU,KAAK,GAAG;AAAA,IAChD;AACA,QAAI,CAAC,WAAY,QAAO;AAAA,EAC1B;AAKA,MAAI,kBAAkB,CAAC,EAAG,QAAO;AAIjC,MAAI,EAAE,SAAS,UAAU,EAAG,QAAO;AAInC,MAAI,mBAAmB,KAAK,EAAE,QAAQ,aAAa,EAAE,CAAC,EAAG,QAAO;AAIhE,MAAI,yBAAyB,KAAK,CAAC,EAAG,QAAO;AAC7C,MAAI,mCAAmC,KAAK,CAAC,EAAG,QAAO;AAIvD,QAAM,WAAW,EAAE,MAAM,mCAAmC;AAC5D,MAAI,UAAU;AACZ,UAAM,OAAO,SAAS,CAAC,EAAE,MAAM,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;AACvD,QAAI,KAAK,UAAU,GAAG;AACpB,YAAM,OAAO,oBAAI,IAAoB;AACrC,iBAAW,KAAK,KAAM,KAAI,EAAG,MAAK,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,KAAK,CAAC;AAC/D,iBAAW,CAAC,EAAE,CAAC,KAAK,MAAM;AACxB,YAAI,KAAK,KAAK,IAAI,KAAK,UAAU,IAAK,QAAO;AAAA,MAC/C;AAAA,IACF;AAAA,EACF;AAKA,MAAI,2BAA2B,KAAK,CAAC,EAAG,QAAO;AAE/C,MAAI,uCAAuC,KAAK,CAAC,EAAG,QAAO;AAI3D,MAAI,gDAAgD,KAAK,CAAC,GAAG;AAC3D,UAAM,cAAc,EAAE,MAAM,UAAU,KAAK,CAAC,GAAG;AAC/C,QAAI,cAAc,EAAG,QAAO;AAAA,EAC9B;AAIA,MAAI,OAAO,UAAU,IAAI;AACvB,UAAM,eAAe,EAAE,MAAM,aAAa,KAAK,CAAC,GAAG;AACnD,QAAI,eAAe,GAAG;AAEpB,YAAM,cAAc,cAAc,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC;AACxD,UAAI,CAAC,YAAa,QAAO;AAAA,IAC3B;AAAA,EACF;AAGA,MAAI,+CAA+C,KAAK,CAAC,EAAG,QAAO;AAInE,MAAI,8DAA8D,KAAK,CAAC,EAAG,QAAO;AAIlF,MAAI,+BAA+B,KAAK,CAAC,EAAG,QAAO;AAInD,MAAI,qBAAqB,KAAK,CAAC,KAAK,CAAC,EAAE,SAAS,GAAG,EAAG,QAAO;AAG7D,MAAI,oBAAoB,KAAK,CAAC,MAAM,EAAE,MAAM,cAAc,KAAK,CAAC,GAAG,UAAU,EAAG,QAAO;AAEvF,SAAO;AACT;AAWO,SAAS,kBAAkB,GAAoB;AACpD,MAAI,EAAE,SAAS,GAAI,QAAO;AAE1B,WAAS,MAAM,GAAG,OAAO,IAAI,OAAO;AAElC,QAAI,MAAM,IAAI,EAAE,OAAQ;AACxB,UAAM,OAAO,oBAAI,IAAoB;AACrC,aAAS,IAAI,GAAG,KAAK,EAAE,SAAS,KAAK,KAAK;AACxC,YAAM,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG;AAC9B,UAAI,CAAC,WAAW,KAAK,GAAG,EAAG;AAC3B,WAAK,IAAI,MAAM,KAAK,IAAI,GAAG,KAAK,KAAK,CAAC;AAAA,IACxC;AACA,eAAW,CAAC,EAAE,KAAK,KAAK,MAAM;AAC5B,UAAI,QAAQ,EAAG;AAGf,UAAK,QAAQ,MAAO,EAAE,UAAU,IAAK,QAAO;AAAA,IAC9C;AAAA,EACF;AACA,SAAO;AACT;AAMA,SAAS,cAAc,GAAqB;AAC1C,QAAM,SAAmB,CAAC;AAC1B,MAAI,IAAI;AACR,SAAO,IAAI,EAAE,QAAQ;AACnB,UAAM,IAAI,EAAE,CAAC;AACb,QAAI,MAAM,MAAM;AACd,UAAI,IAAI,IAAI;AACZ,aAAO,IAAI,EAAE,UAAU,WAAW,KAAK,EAAE,CAAC,CAAC,EAAG;AAC9C,UAAI,MAAM,IAAI,KAAK,IAAI,EAAE,OAAQ;AACjC,aAAO,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC;AACzB,UAAI;AAAA,IACN,WAAW,KAAK,KAAK,CAAC,GAAG;AACvB;AAAA,IACF,OAAO;AACL,aAAO,KAAK,CAAC;AACb;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAaO,SAAS,wBAAwB,GAAmB;AAEzD,QAAM,SAAmB,CAAC;AAC1B,MAAI,IAAI;AACR,SAAO,IAAI,EAAE,QAAQ;AACnB,UAAM,IAAI,EAAE,CAAC;AACb,QAAI,MAAM,MAAM;AACd,UAAI,IAAI,IAAI;AACZ,aAAO,IAAI,EAAE,UAAU,WAAW,KAAK,EAAE,CAAC,CAAC,EAAG;AAC9C,UAAI,MAAM,IAAI,KAAK,IAAI,EAAE,OAAQ;AACjC,aAAO,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC;AACzB,UAAI;AAAA,IACN,WAAW,KAAK,KAAK,CAAC,GAAG;AACvB,aAAO,KAAK,GAAG;AACf;AAAA,IACF,OAAO;AACL,aAAO,KAAK,CAAC;AACb;AAAA,IACF;AAAA,EACF;AAEA,QAAM,MAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAI,OAAO,CAAC,MAAM,KAAK;AACrB,UAAI,KAAK,OAAO,CAAC,CAAC;AAClB;AAAA,IACF;AAGA,QAAI,OAAO;AACX,aAAS,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAC/B,UAAI,OAAO,CAAC,MAAM,KAAK;AACrB,eAAO,OAAO,CAAC;AACf;AAAA,MACF;AAAA,IACF;AACA,QAAI,OAAO;AACX,aAAS,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AAC1C,UAAI,OAAO,CAAC,MAAM,KAAK;AACrB,eAAO,OAAO,CAAC;AACf;AAAA,MACF;AAAA,IACF;AACA,UAAM,YAAY,gBAAgB,KAAK,IAAI;AAC3C,UAAM,cAAc,aAAa,KAAK,IAAI;AAC1C,QAAI,aAAa,aAAa;AAE5B,UAAI,IAAI,WAAW,KAAK,IAAI,IAAI,SAAS,CAAC,MAAM,KAAK;AACnD,YAAI,KAAK,GAAG;AAAA,MACd;AAAA,IACF;AAAA,EAEF;AAGA,SAAO,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,IAAK,KAAI,MAAM;AACnD,SAAO,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,CAAC,MAAM,IAAK,KAAI,IAAI;AAE9D,SAAO,IAAI,KAAK,EAAE;AACpB;;;AChcA,IAAM,eAAe;AACrB,IAAM,kBAAkB;AACxB,IAAM,eAAe,IAAI;AAEzB,IAAM,kBAAkB;AAExB,IAAM,mBAAmB;AACzB,IAAM,oBAAoB;AAE1B,IAAM,eAAe;AACrB,IAAM,YAAY,MAAM;AAexB,eAAsB,qBACpB,SACA,OACA,KACyC;AACzC,QAAM,EAAE,OAAO,MAAM,MAAM,OAAO,IAAI,UAAU,OAAO,YAAY;AAEnE,QAAM,QAAQ,IAAI,IAAI,OAAO,WAAW,QAAQ,CAAC,GAAG,GAAG,cAAc,YAAY,CAAC;AAClF,QAAM,QAAgC,EAAE,QAAQ,MAAM;AACtD,QAAM,UAAU,MAAM,QAAQ,IAAI,KAAK;AAEvC,QAAM,WAAW,OAAO,KAAK,OAAO,EAAE,CAAC;AACvC,QAAM,MAAM,QAAQ,QAAQ;AAC5B,MAAI,CAAC,OAAO,IAAI,SAAS,WAAW;AAClC,UAAM,IAAI,MAAM,qEAAwB;AAAA,EAC1C;AAEA,QAAM,UAAU,IAAI;AACpB,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,MAAM,8DAAsB,QAAQ,MAAM,MAAM,QAAQ,KAAK,GAAG,CAAC,GAAG;AAAA,EAChF;AACA,QAAM,WAAW,QAAQ,CAAC;AAC1B,QAAM,UAAU,QAAQ,CAAC;AACzB,MAAI,aAAa,cAAc;AAC7B,UAAM,IAAI,MAAM,wCAAe,YAAY,kBAAQ,QAAQ,EAAE;AAAA,EAC/D;AACA,MAAI,WAAW,EAAG,QAAO,CAAC;AAE1B,QAAM,OAAO,IAAI;AACjB,QAAM,aAA6B,CAAC;AAEpC,WAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,UAAM,KAAK,KAAK,CAAC;AACjB,UAAM,KAAK,KAAK,UAAU,CAAC;AAC3B,UAAM,IAAI,KAAK,IAAI,UAAU,CAAC;AAC9B,UAAM,IAAI,KAAK,IAAI,UAAU,CAAC;AAE9B,QAAI,UAAU;AACd,QAAI,YAAY;AAChB,aAAS,IAAI,GAAG,IAAI,iBAAiB,KAAK;AACxC,YAAM,IAAI,MAAM,IAAI,KAAK,UAAU,CAAC;AACpC,UAAI,IAAI,WAAW;AACjB,oBAAY;AACZ,kBAAU;AAAA,MACZ;AAAA,IACF;AAEA,UAAM,YAAY,YAAY,IAAI,mBAAmB;AACrD,QAAI,YAAY,UAAW;AAG3B,QAAI,MAAM,KAAK,IAAI,IAAI,QAAQ;AAC/B,QAAI,MAAM,KAAK,IAAI,IAAI,QAAQ;AAC/B,QAAI,MAAM,KAAK,IAAI,IAAI,QAAQ;AAC/B,QAAI,MAAM,KAAK,IAAI,IAAI,QAAQ;AAE/B,SAAK,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC;AACjC,SAAK,MAAM,IAAI,GAAG,MAAM,SAAS,CAAC;AAClC,SAAK,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC;AACjC,SAAK,MAAM,IAAI,GAAG,MAAM,SAAS,CAAC;AAElC,QAAI,KAAK,KAAK,KAAK,KAAK,KAAK,EAAG;AAEhC,SAAK,KAAK,OAAO,KAAK,MAAM,aAAc;AAE1C,eAAW,KAAK;AAAA,MACd;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,MAAM,YAAY,IAAI,YAAY;AAAA,MAClC,OAAO;AAAA,IACT,CAAC;AAAA,EACH;AAGA,QAAM,OAAuB,CAAC;AAC9B,aAAW,QAAQ,CAAC,UAAU,SAAS,GAAoB;AACzD,UAAM,SAAS,WAAW,OAAO,CAAC,MAAM,EAAE,SAAS,IAAI;AACvD,SAAK,KAAK,GAAG,IAAI,QAAQ,iBAAiB,CAAC;AAAA,EAC7C;AAGA,OAAK,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE;AAE9C,SAAO,KAAK,IAAI,CAAC,OAAO;AAAA,IACtB,MAAM,EAAE,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,GAAG;AAAA,IAC/C,MAAM,EAAE;AAAA,IACR,OAAO,EAAE;AAAA,EACX,EAAE;AACJ;AAUO,SAAS,UACd,OACA,QACqE;AACrE,QAAM,IAAI,MAAM;AAChB,QAAM,IAAI,MAAM;AAChB,QAAM,QAAQ,KAAK,IAAI,SAAS,GAAG,SAAS,CAAC;AAC7C,QAAM,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,IAAI,KAAK,CAAC;AAC9C,QAAM,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,IAAI,KAAK,CAAC;AAC9C,QAAM,QAAQ,SAAS,QAAQ;AAC/B,QAAM,QAAQ,SAAS,QAAQ;AAC/B,QAAM,OAAO,KAAK,MAAM,IAAI;AAC5B,QAAM,OAAO,KAAK,MAAM,IAAI;AAE5B,QAAM,KAAK;AACX,QAAM,SAAS,IAAI,aAAa,IAAI,KAAK,EAAE;AAC3C,SAAO,KAAK,SAAS;AAKrB,QAAM,MAAM,MAAM;AAClB,QAAM,OAAO,MAAM;AACnB,QAAM,OAAO,MAAM;AAEnB,WAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,UAAM,KAAK,KAAK,IAAI,OAAO,GAAG,KAAK,OAAO,IAAI,OAAO,OAAO,IAAI,CAAC;AACjE,aAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,YAAM,KAAK,KAAK,IAAI,OAAO,GAAG,KAAK,OAAO,IAAI,OAAO,OAAO,IAAI,CAAC;AACjE,YAAM,UAAU,KAAK,OAAO,MAAM;AAClC,YAAM,IAAI,IAAI,MAAM;AACpB,YAAM,IAAI,IAAI,SAAS,CAAC;AACxB,YAAM,IAAI,IAAI,SAAS,CAAC;AAExB,YAAM,KAAK,IAAI;AACf,YAAM,KAAK,IAAI;AACf,YAAM,MAAM,KAAK,KAAK;AACtB,aAAO,GAAG,IAAI,IAAI;AAClB,aAAO,KAAK,KAAK,GAAG,IAAI,IAAI;AAC5B,aAAO,IAAI,KAAK,KAAK,GAAG,IAAI,IAAI;AAAA,IAClC;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,MAAM,MAAM,OAAO;AACrC;AAEA,SAAS,IAAI,OAAuB,cAAsC;AACxE,QAAM,SAAS,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC1D,QAAM,OAAuB,CAAC;AAC9B,aAAW,QAAQ,QAAQ;AACzB,QAAI,OAAO;AACX,eAAW,KAAK,MAAM;AACpB,UAAI,IAAI,MAAM,CAAC,IAAI,cAAc;AAC/B,eAAO;AACP;AAAA,MACF;AAAA,IACF;AACA,QAAI,KAAM,MAAK,KAAK,IAAI;AAAA,EAC1B;AACA,SAAO;AACT;AAEA,SAAS,IACP,GACA,GACQ;AACR,QAAM,KAAK,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE;AAC9B,QAAM,KAAK,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE;AAC9B,QAAM,KAAK,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE;AAC9B,QAAM,KAAK,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE;AAC9B,QAAM,SAAS,KAAK,IAAI,GAAG,KAAK,EAAE;AAClC,QAAM,SAAS,KAAK,IAAI,GAAG,KAAK,EAAE;AAClC,QAAM,QAAQ,SAAS;AACvB,QAAM,QAAQ,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,EAAE;AAChE,QAAM,QAAQ,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,EAAE;AAChE,QAAM,QAAQ,QAAQ,QAAQ;AAC9B,SAAO,SAAS,IAAI,IAAI,QAAQ;AAClC;AAEA,SAAS,MAAM,GAAW,IAAY,IAAoB;AACxD,MAAI,IAAI,GAAI,QAAO;AACnB,MAAI,IAAI,GAAI,QAAO;AACnB,SAAO;AACT;;;AC7MA,IAAM,eAAe;AACrB,IAAM,iBAAiB;AACvB,IAAM,qBAAqB;AAC3B,IAAM,aAAa;AACnB,IAAM,aAAa;AAanB,eAAsB,iBACpB,MACA,MACiB;AACjB,QAAM,SAAS,eAAe,MAAM,YAAY;AAChD,QAAM,EAAE,KAAK,SAAS,SAAS,UAAU,IAAI;AAE7C,QAAM,aAAa,IAAI,IAAI,OAAO,WAAW,QAAQ,CAAC,GAAG,GAAG,cAAc,YAAY,CAAC;AACvF,QAAM,SAAS,MAAM,QAAQ,IAAI,EAAE,cAAc,WAAW,CAAC;AAE7D,QAAM,SACJ,OAAO,KAAK,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,QAAQ,CAAC,KAAK,OAAO,KAAK,MAAM,EAAE,CAAC;AAChF,QAAM,YAAY,OAAO,MAAM;AAC/B,MAAI,CAAC,aAAa,UAAU,SAAS,WAAW;AAC9C,UAAM,IAAI,MAAM,uCAAmB;AAAA,EACrC;AACA,QAAM,UAAU,UAAU;AAC1B,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,MAAM,yDAA2B,QAAQ,MAAM,EAAE;AAAA,EAC7D;AACA,QAAM,SAAS,QAAQ,CAAC;AACxB,QAAM,YAAY,QAAQ,CAAC;AAC3B,MAAI,cAAc,gBAAgB;AAChC,UAAM,IAAI,MAAM,mCAAyB,cAAc,kBAAQ,SAAS,EAAE;AAAA,EAC5E;AACA,QAAM,UAAU,UAAU;AAG1B,QAAM,SAAmB,CAAC,UAAU;AAEpC,WAAS,OAAO,GAAG,OAAO,oBAAoB,QAAQ;AACpD,UAAM,SAAS,OAAO;AACtB,UAAM,SAAS,cAAc,KAAK,OAAO,IAAI,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC;AAC9D,UAAM,YAAY,IAAI,IAAI,OAAO,SAAS,QAAQ,CAAC,GAAG,MAAM,CAAC;AAG7D,UAAM,UAAU,IAAI,aAAa,OAAO;AACxC,UAAM,YAAY,IAAI,IAAI,OAAO,WAAW,SAAS,CAAC,GAAG,QAAQ,SAAS,CAAC;AAE3E,UAAM,SAAS,MAAM,QAAQ,IAAI;AAAA,MAC/B,WAAW;AAAA,MACX,uBAAuB;AAAA,IACzB,CAAC;AAED,UAAM,WACJ,OAAO,KAAK,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,OAAO,CAAC,KAAK,OAAO,KAAK,MAAM,EAAE,CAAC;AAC/E,UAAM,eAAe,OAAO,QAAQ;AACpC,QAAI,CAAC,gBAAgB,aAAa,SAAS,WAAW;AACpD,YAAM,IAAI,MAAM,iCAAuB;AAAA,IACzC;AACA,UAAM,OAAO,aAAa;AAC1B,QAAI,KAAK,WAAW,GAAG;AACrB,YAAM,IAAI,MAAM,yDAA2B,KAAK,MAAM,EAAE;AAAA,IAC1D;AACA,UAAM,SAAS,KAAK,CAAC;AACrB,UAAM,QAAQ,KAAK,CAAC;AACpB,UAAM,aAAa,aAAa;AAGhC,UAAM,cAAc,SAAS,KAAK;AAClC,QAAI,SAAS;AACb,QAAI,UAAU;AACd,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,YAAM,MAAM,WAAW,aAAa,CAAC;AACrC,UAAI,MAAM,SAAS;AACjB,kBAAU;AACV,iBAAS;AAAA,MACX;AAAA,IACF;AACA,WAAO,KAAK,MAAM;AAClB,QAAI,WAAW,WAAY;AAAA,EAC7B;AAGA,QAAM,OAAiB,CAAC;AACxB,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,MAAM,WAAY;AACtB,QAAI,MAAM,WAAY;AACtB,QAAI,IAAI,EAAG;AACX,SAAK,KAAK,CAAC;AAAA,EACb;AAGA,QAAM,MAAM,UAAU,OAAO,MAAM,EAAE,qBAAqB,KAAK,CAAC;AAChE,SAAO,iBAAiB,GAAG;AAC7B;AAQO,SAAS,eAAe,MAAkB,QAA8B;AAC7E,QAAM,KAAK;AACX,QAAM,MAAM,IAAI,aAAa,IAAI,KAAK,EAAE;AACxC,QAAM,EAAE,MAAM,KAAK,OAAO,MAAM,QAAQ,KAAK,IAAI;AAGjD,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,UAAM,KAAK,KAAK,IAAI,OAAO,GAAG,KAAK,IAAI,GAAG,KAAK,OAAQ,IAAI,OAAO,KAAM,IAAI,CAAC,CAAC;AAC9E,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,YAAM,KAAK,KAAK,IAAI,OAAO,GAAG,KAAK,IAAI,GAAG,KAAK,OAAQ,IAAI,OAAO,KAAM,IAAI,CAAC,CAAC;AAC9E,YAAM,UAAU,KAAK,OAAO,MAAM;AAClC,YAAM,IAAI,IAAI,MAAM;AACpB,YAAM,IAAI,IAAI,SAAS,CAAC;AACxB,YAAM,IAAI,IAAI,SAAS,CAAC;AAExB,YAAM,MAAM,IAAI,KAAK;AACrB,UAAI,GAAG,IAAI,IAAI,QAAQ;AACvB,UAAI,KAAK,KAAK,GAAG,IAAI,IAAI,QAAQ;AACjC,UAAI,IAAI,KAAK,KAAK,GAAG,IAAI,IAAI,QAAQ;AAAA,IACvC;AAAA,EACF;AACA,SAAO;AACT;;;ACxHA,SAAS,QAAAA,aAAY;AAGrB,IAAM,eAAe;AA6Bd,IAAM,kBAAN,MAAM,iBAAgB;AAAA,EACnB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEA,YAAY,OASjB;AACD,SAAK,MAAM,MAAM;AACjB,SAAK,UAAU,MAAM;AACrB,SAAK,UAAU,MAAM;AACrB,SAAK,YAAY,MAAM;AACvB,SAAK,MAAM,MAAM;AACjB,SAAK,QAAQ,MAAM;AACnB,SAAK,SAAS,MAAM;AACpB,SAAK,OAAO,MAAM;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAa,OAAO,SAA4D;AAC9E,UAAM,OAAyC;AAAA,MAC7C,OAAO,SAAS,SAAS;AAAA,MACzB,mBAAmB,SAAS,qBAAqB;AAAA,MACjD,eAAe,SAAS,iBAAiB;AAAA,IAC3C;AAEA,UAAM,CAAC,QAAQ,aAAa,OAAO,SAAS,IAAI,MAAM,QAAQ,IAAI;AAAA,MAChE;AAAA,QACE;AAAA,QACA,MAAM,OAAO,kBAAkB;AAAA,MACjC;AAAA,MACA;AAAA,QACE;AAAA,QACA,MAAM,OAAO,OAAO;AAAA,MACtB;AAAA,MACA;AAAA,QACE;AAAA,QACA,MAAM,OAAO,2BAA2B;AAAA,MAC1C;AAAA,MACA;AAAA,QACE;AAAA,QACA,MAAM,OAAO,gBAAgB;AAAA,MAC/B;AAAA,IACF,CAAC;AAED,UAAM,WAAW;AACjB,UAAM,WACJ,OAAO,aAAa,aAChB,WACC,SAAS,WAAY;AAE5B,UAAM,YAAY,oBAAoB;AACtC,UAAM,UAAUA,MAAK,WAAW,UAAU,QAAQ;AAClD,UAAM,UAAUA,MAAK,WAAW,kBAAkB,QAAQ;AAC1D,UAAM,UAAUA,MAAK,WAAW,kBAAkB,QAAQ;AAC1D,UAAM,UAAUA,MAAK,WAAW,cAAc,QAAQ;AAEtD,UAAM,cAA0E;AAAA,MAC9E,wBAAwB;AAAA,MACxB,oBAAoB,CAAC,KAAK;AAAA,IAC5B;AAGA,UAAM,CAAC,KAAK,SAAS,OAAO,IAAI,MAAM,QAAQ,IAAI;AAAA,MAChD,OAAO,iBAAiB,OAAO,SAAS,WAAW;AAAA,MACnD,OAAO,iBAAiB,OAAO,SAAS,WAAW;AAAA,MACnD,OAAO,iBAAiB,OAAO,SAAS,WAAW;AAAA,IACrD,CAAC;AAID,UAAM,EAAE,SAAS,IAAI,MAAM,OAAO,aAAa;AAC/C,UAAM,gBAAgB,KAAK,MAAM,MAAM,SAAS,SAAS,OAAO,CAAC;AACjE,UAAM,iBAAiB,MAAM;AAI7B,UAAM,YAAY,IAAI,eAAe,eAAe,CAAC,CAAC;AAEtD,UAAM,SAAS,MAAM,UAAU,cAAc,KAAK;AAElD,WAAO,IAAI,iBAAgB;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK;AAAA,MACL,OAAO;AAAA,MACP;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,UAAyB;AAE7B,QAAI;AACF,WAAK,OAAO,QAAQ;AAAA,IACtB,QAAQ;AAAA,IAER;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,YACJ,QACA,aAAiC,MACjC,gBAC8B;AAC9B,UAAM,OAAO,kBAAkB,aAAa,SAAS,IAAI,WAAW,MAAM;AAC1E,UAAM,MAAsB,MAAM,KAAK,OAAO,aAAa,IAAI;AAC/D,QAAI;AACF,YAAM,QAA6B,CAAC;AACpC,UAAI,UAAU;AACd,iBAAW,QAAQ,IAAI,MAAM,GAAG;AAC9B;AACA,YAAI,cAAc,CAAC,WAAW,IAAI,KAAK,MAAM,EAAG;AAEhD,yBAAiB,KAAK,QAAQ,IAAI,aAAa,CAAC;AAEhD,YAAI;AACF,gBAAM,SAAS,MAAM;AAAA,YACnB,KAAK,YAAY,KAAK,QAAQ,IAAI;AAAA,YAClC,KAAK,KAAK;AAAA,YACV,gBAAgB,KAAK,MAAM,oBAAoB,KAAK,KAAK,aAAa;AAAA,UACxE;AACA,cAAI,OAAQ,OAAM,KAAK,MAAM;AAAA,QAC/B,SAAS,GAAG;AAEV,kBAAQ,OAAO;AAAA,YACb,yBAAyB,KAAK,MAAM,aAAc,EAAY,OAAO;AAAA;AAAA,UACvE;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT,UAAE;AACA,UAAI,QAAQ;AAAA,IACd;AAAA,EACF;AAAA,EAEA,MAAc,YACZ,YACA,MACmC;AACnC,UAAM,EAAE,eAAe,UAAU,gBAAgB,UAAU,IAAI,KAAK,gBAAgB;AAEpF,UAAM,YAAY,KAAK;AACvB,UAAM,WAAW,MAAM,KAAK,OAAO;AAAA,MACjC,OAAO,KAAK,KAAK;AAAA,MACjB,QAAQ,OAAO,EAAE,MAAM,OAAO,OAAO,MAAM;AAEzC,eAAO;AAAA,MACT;AAAA,IACF,CAAC;AAED,UAAM,EAAE,MAAM,MAAM,OAAO,IAAI,QAAQ,GAAG,IAAI;AAC9C,UAAM,OAAO,WAAW,IAAI;AAE5B,UAAM,YAAwB,EAAE,OAAO,IAAI,QAAQ,IAAI,MAAM,KAAK;AAGlE,UAAM,WAAW,MAAM,qBAAqB,KAAK,KAAK,WAAW,KAAK,GAAG;AACzE,QAAI,SAAS,WAAW,GAAG;AACzB,aAAO,EAAE,YAAY,eAAe,IAAI,gBAAgB,IAAI,UAAU,WAAW,SAAS,CAAC,EAAE;AAAA,IAC/F;AAEA,UAAM,SAAS,SAAS,MAAM,GAAG,KAAK,KAAK,iBAAiB;AAC5D,UAAM,UAA2B,CAAC;AAGlC,eAAW,KAAK,QAAQ;AACtB,YAAM,KAAK,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC;AAC5C,YAAM,KAAK,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC;AAC5C,YAAM,KAAK,KAAK,KAAK,KAAK,IAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAC5C,YAAM,KAAK,KAAK,KAAK,KAAK,IAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAC5C,YAAM,KAAK,KAAK;AAChB,YAAM,KAAK,KAAK;AAChB,UAAI,KAAK,KAAK,KAAK,EAAG;AAGtB,YAAM,WAAW,MAAM,UAAU,MAAM;AAAA,QACrC,KAAK,EAAE,OAAO,IAAI,QAAQ,IAAI,UAAU,EAAE;AAAA,MAC5C,CAAC,EACE,QAAQ,EAAE,MAAM,IAAI,KAAK,IAAI,OAAO,IAAI,QAAQ,GAAG,CAAC,EACpD,IAAI,EACJ,SAAS;AAEZ,YAAM,YAAwB,EAAE,OAAO,IAAI,QAAQ,IAAI,MAAM,IAAI,WAAW,QAAQ,EAAE;AAEtF,UAAI,QAAQ;AACZ,UAAI;AACF,gBAAQ,MAAM;AAAA,UACZ;AAAA,YACE,SAAS,KAAK;AAAA,YACd,SAAS,KAAK;AAAA,YACd,WAAW,KAAK;AAAA,YAChB,KAAK,KAAK;AAAA,UACZ;AAAA,UACA;AAAA,QACF;AAAA,MACF,SAAS,GAAG;AACV,gBAAQ,OAAO;AAAA,UACb,6CAA6C,UAAU,IAAI,KAAK,UAAU,EAAE,IAAI,CAAC,KAAM,EAAY,OAAO;AAAA;AAAA,QAC5G;AACA,gBAAQ;AAAA,MACV;AAEA,cAAQ,KAAK,EAAE,GAAG,GAAG,MAAM,CAAC;AAAA,IAC9B;AAEA,WAAO;AAAA,MACL;AAAA,MACA,eAAe;AAAA,MACf,gBAAgB;AAAA,MAChB;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;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;AAEA,eAAe,YAAe,SAAqB,IAAY,KAAyB;AACtF,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":["join"]}