kordoc 4.18.11 → 4.18.13

package/dist/chunks-JZW2TXIZ.js

@@ -0,0 +1,10 @@
+#!/usr/bin/env node
+import {
+  blocksToChunks
+} from "./chunk-GSW7W7AL.js";
+import "./chunk-JKHU7HID.js";
+import "./chunk-PN5WWW56.js";
+export {
+  blocksToChunks
+};
+//# sourceMappingURL=chunks-JZW2TXIZ.js.map

package/dist/cli.js

@@ -1,7 +1,7 @@
 #!/usr/bin/env node
 import {
   parseFormatProfileJson
-} from "./chunk-DU2DV4LO.js";
+} from "./chunk-EZSWBHHI.js";
 import {
   BODY_FONTS,
   BULLET2_CHARS,
@@ -33,24 +33,24 @@ import {
   toPlainMarkdown,
   unknownFontWarnings,
   usesGaejosikMunche
-} from "./chunk-TYIUJKUT.js";
-import "./chunk-UG4GIJSH.js";
-import "./chunk-GNXDTPP6.js";
+} from "./chunk-GUH6HYSZ.js";
+import "./chunk-V7LKQNC4.js";
+import "./chunk-6AYTYTFY.js";
 import "./chunk-3WSNLH4B.js";
-import "./chunk-PIRSOTKK.js";
+import "./chunk-GSW7W7AL.js";
 import {
   detectFormat,
   detectImageMime,
   detectZipFormat
-} from "./chunk-L7TALZNE.js";
+} from "./chunk-SVIOP7PE.js";
 import "./chunk-7FCNOKOR.js";
-import "./chunk-UETNJSA7.js";
+import "./chunk-XVB3PUPJ.js";
 import "./chunk-VQFA55IC.js";
-import "./chunk-5GVDHHHO.js";
+import "./chunk-DHEUQXXR.js";
 import {
   blocksToMarkdown
-} from "./chunk-WP6KG5Z7.js";
-import "./chunk-DXRKZWC3.js";
+} from "./chunk-JKHU7HID.js";
+import "./chunk-IRN5SDY2.js";
 import {
   KordocError,
   VERSION,
@@ -58,7 +58,7 @@ import {
   routeConsoleToStderr,
   sanitizeError,
   toArrayBuffer
-} from "./chunk-JZ3VPASI.js";
+} from "./chunk-PN5WWW56.js";
 
 // src/cli.ts
 import { Command } from "commander";
@@ -186,7 +186,7 @@ async function convertFiles(files, opts, writeOutput = (text) => {
 `);
         }
       } else if (opts.format === "chunks") {
-        const { blocksToChunks } = await import("./chunks-ZZZGBVGM.js");
+        const { blocksToChunks } = await import("./chunks-JZW2TXIZ.js");
         const chunks = blocksToChunks(result.blocks).map((c) => {
           let text = c.text;
           if (opts.plain) text = toPlainMarkdown(text);
@@ -354,7 +354,7 @@ function registerDocCommands(program2) {
     if (command.getOptionValueSource("format") === "default" && program2.getOptionValueSource("format") === "cli") {
       opts.format = rootOpts.format;
     }
-    const { watchDirectory } = await import("./watch-G46MOBKP.js");
+    const { watchDirectory } = await import("./watch-GB2M7XU6.js");
     await watchDirectory({
       dir,
       outDir: opts.outDir,
@@ -581,7 +581,7 @@ function registerDocCommands(program2) {
   });
   program2.command("seal <file>").description('\uB3C4\uC7A5/\uC11C\uBA85 \uC774\uBBF8\uC9C0\uB97C \uC575\uCEE4 \uBB38\uAD6C \uC704\uC5D0 \uBD80\uC720 \uBC30\uCE58 (\uD45C/\uD398\uC774\uC9C0 \uBD88\uD655\uC7A5) \u2014 kordoc seal \uC2E0\uCCAD\uC11C.hwpx --image \uB3C4\uC7A5.png --anchor "(\uC778)" -o \uACB0\uACFC.hwpx').requiredOption("--image <path>", "\uB3C4\uC7A5/\uC11C\uBA85 \uC774\uBBF8\uC9C0 (\uD22C\uBA85 \uBC30\uACBD PNG \uAD8C\uC7A5)").option("--anchor <text>", "\uC575\uCEE4 \uBB38\uAD6C", "(\uC778)").option("-n, --occurrence <num>", "\uAC19\uC740 \uC575\uCEE4\uAC00 \uC5EC\uB7FF\uC77C \uB54C 0-based \uC120\uD0DD", "0").option("--size-mm <num>", "\uB3C4\uC7A5 \uD55C \uBCC0 \uD06C\uAE30 mm (\uAE30\uBCF8: \uC904\uB192\uC774\xD71.6, 7~18 \uD074\uB7A8\uD504)").option("--mode <mode>", "overlap(\uBB38\uAD6C \uC704 \uACB9\uCE68) | right(\uC624\uB978\uCABD \uC606) | auto", "auto").option("--dx <mm>", "x \uBBF8\uC138\uC870\uC815 mm", "0").option("--dy <mm>", "y \uBBF8\uC138\uC870\uC815 mm", "0").option("-o, --output <path>", "\uCD9C\uB825 \uACBD\uB85C (\uAE30\uBCF8: <\uC785\uB825>.sealed.hwpx)").option("--silent", "\uC9C4\uD589 \uBA54\uC2DC\uC9C0 \uC228\uAE30\uAE30").action(async (file, opts) => {
     try {
-      const { placeSealHwpx, detectFormat: detectFormat2 } = await import("./-TUDCOQX6.js");
+      const { placeSealHwpx, detectFormat: detectFormat2 } = await import("./-DC2OO5KO.js");
       const rootOpts = program2.opts();
       const output = opts.output ?? rootOpts.output;
       const silent = opts.silent ?? rootOpts.silent;
@@ -659,7 +659,7 @@ function registerDocCommands(program2) {
   });
   program2.command("patch <original> <edited>").description("\uC11C\uC2DD \uBCF4\uC874 \uB77C\uC6B4\uB4DC\uD2B8\uB9BD \uD328\uCE58 \u2014 \uD3B8\uC9D1\uB41C \uB9C8\uD06C\uB2E4\uC6B4\uC744 \uC6D0\uBCF8 HWPX/HWP\uC5D0 in-place \uBC18\uC601 (kordoc patch \uC6D0\uBCF8.hwpx \uD3B8\uC9D1.md -o \uCD9C\uB825.hwpx). \uBBF8\uC801\uC6A9(skip) \uD3B8\uC9D1\uC774 \uC788\uC73C\uBA74 exit 2").option("-o, --output <path>", "\uCD9C\uB825 \uACBD\uB85C (\uAE30\uBCF8: <\uC6D0\uBCF8>.patched.hwpx|.hwp)").option("--no-verify", "\uD328\uCE58 \uD6C4 \uC7AC\uD30C\uC2F1 \uC790\uB3D9 \uAC80\uC99D \uC0DD\uB7B5").option("--silent", "\uC9C4\uD589 \uBA54\uC2DC\uC9C0 \uC228\uAE30\uAE30").action(async (original, edited, opts) => {
     try {
-      const { patchHwpx, patchHwp, detectFormat: detectFormat2 } = await import("./-TUDCOQX6.js");
+      const { patchHwpx, patchHwp, detectFormat: detectFormat2 } = await import("./-DC2OO5KO.js");
       const rootOpts = program2.opts();
       const output = opts.output ?? rootOpts.output;
       const silent = opts.silent ?? rootOpts.silent;
@@ -700,7 +700,7 @@ function registerDocCommands(program2) {
   });
   program2.command("validate <file>").description("HWPX \uAD6C\uC870 \uAC80\uC99D \u2014 ZIP\xB7mimetype\xB7\uD544\uC218 \uD30C\uC77C\xB7XML \uC6F0\uD3FC\uB4DC\xB7secCnt\xB7manifest \uCC38\uC870 (\uD55C\uCEF4\uB3C5\uC2A4 \uAC70\uBD80 \uC694\uC778 \uC0AC\uC804 \uCC28\uB2E8)").option("--json", "\uACB0\uACFC\uB97C JSON\uC73C\uB85C stdout\uC5D0 \uCD9C\uB825").action(async (file, opts) => {
     try {
-      const { validateHwpx } = await import("./-TUDCOQX6.js");
+      const { validateHwpx } = await import("./-DC2OO5KO.js");
       const buf = new Uint8Array(readFileSync2(resolve3(file)));
       const result = await validateHwpx(buf);
       if (opts.json) {
@@ -967,7 +967,7 @@ function registerGenerateCommands(program2) {
   });
   program2.command("redact <files...>").description("\uAC1C\uC778\uC815\uBCF4 \uC11C\uC2DD \uBCF4\uC874 \uB9C8\uC2A4\uD0B9 \u2014 \uC8FC\uBBFC\xB7\uC678\uAD6D\uC778\uB4F1\uB85D\uBC88\uD638\xB7\uC804\uD654\xB7\uC774\uBA54\uC77C\xB7\uCE74\uB4DC\xB7\uACC4\uC88C\xB7\uC0AC\uC5C5\uC790\uB4F1\uB85D\uBC88\uD638\xB7\uC5EC\uAD8C\xB7\uC6B4\uC804\uBA74\uD5C8(--rules \uB85C \uC778\uBA85\xB7\uC8FC\uC18C opt-in)\uB97C \uD0D0\uC9C0\uD574 HWPX/HWP\uB294 \uC6D0\uBCF8 \uC11C\uC2DD \uADF8\uB300\uB85C \uAC19\uC740 \uAE38\uC774\uB85C \uAC00\uB9B0 \uD30C\uC77C(\uBCF8\uBB38\xB7\uD45C\xB7\uBA38\uB9AC\uB9D0/\uAF2C\uB9AC\uB9D0\xB7\uAC01\uC8FC\xB7\uAE00\uC0C1\uC790\xB7\uBBF8\uB9AC\uBCF4\uAE30\xB7\uBA54\uD0C0\uB370\uC774\uD130 \uD3EC\uD568), \uADF8 \uC678 \uD3EC\uB9F7(PDF \uB4F1)\uC740 \uC6D0\uBCF8\uC744 \uAC74\uB4DC\uB9AC\uC9C0 \uC54A\uACE0 \uB9C8\uC2A4\uD0B9\uB41C \uB9C8\uD06C\uB2E4\uC6B4\uB9CC \uCD9C\uB825. \uC790\uB3D9 \uAC80\uCD9C \uBCF4\uC870 \uB3C4\uAD6C\uC774\uBBC0\uB85C \uACB0\uACFC\uB294 \uBC18\uB4DC\uC2DC \uC0AC\uB78C\uC774 \uCD5C\uC885 \uD655\uC778\uD558\uC138\uC694 (\uC774\uBBF8\uC9C0 \uC18D \uAE00\uC790\uB294 \uD0D0\uC9C0 \uBD88\uAC00)").option("--rules <csv>", "\uC801\uC6A9 \uB8F0 (\uAE30\uBCF8: rrn,phone,email,card,account,brn,passport,driver \u2014 crn(\uBC95\uC778\uB4F1\uB85D\uBC88\uD638),ip,name(\uC778\uBA85),address(\uC8FC\uC18C)\uB294 opt-in)").option("--mask-char <ch>", "\uB9C8\uC2A4\uD06C \uBB38\uC790 1\uAE00\uC790 (\uAE30\uBCF8: \u25CF)").option("-o, --output <path>", "\uCD9C\uB825 \uACBD\uB85C (\uB2E8\uC77C \uD30C\uC77C \uC2DC)").option("-d, --out-dir <dir>", "\uCD9C\uB825 \uB514\uB809\uD1A0\uB9AC (\uB2E4\uC911 \uD30C\uC77C \uC2DC)").option("--dry-run", "\uD0D0\uC9C0 \uB9AC\uD3EC\uD2B8\uB9CC \uCD9C\uB825, \uD30C\uC77C \uBBF8\uC0DD\uC131").option("--json", "\uB9AC\uD3EC\uD2B8\uB97C JSON\uC73C\uB85C stdout \uCD9C\uB825").option("--silent", "\uC9C4\uD589 \uBA54\uC2DC\uC9C0 \uC228\uAE30\uAE30").action(async (files, opts) => {
     const { ALL_REDACT_RULES, DEFAULT_REDACT_RULES, redactText } = await import("./redact-NV2QCDGE.js");
-    const { redactDocument } = await import("./redact-doc-HHTMXA3E.js");
+    const { redactDocument } = await import("./redact-doc-RNJVMFGQ.js");
     const rootOpts = program2.opts();
     const output = opts.output ?? rootOpts.output;
     const outDir = opts.outDir ?? rootOpts.outDir;
@@ -1129,7 +1129,7 @@ function registerRenderCommands(program2) {
       const absPath = resolve5(file);
       const stem = file.replace(/\.hwpx?$/i, "");
       if (fmt === "svg" && !outDir && !pages && !/\.hwp$/i.test(absPath)) {
-        const { renderHwpxToSvg } = await import("./render-RZF6SNSN.js");
+        const { renderHwpxToSvg } = await import("./render-NZ6RA6SW.js");
         const buffer = readFileSync4(absPath);
         const result = await renderHwpxToSvg(toArrayBuffer(buffer), { highlights, reflow: opts.reflow, reflowMode: opts.reflowMode });
         const outPath = resolve5(output ?? stem + ".svg");
@@ -1143,7 +1143,7 @@ function registerRenderCommands(program2) {
         }
         return;
       }
-      const { renderDocument } = await import("./render-RZF6SNSN.js");
+      const { renderDocument } = await import("./render-NZ6RA6SW.js");
       const { scene, assets } = await renderDocument(absPath, {
         format: fmt,
         pages,
@@ -1193,7 +1193,7 @@ function registerRenderCommands(program2) {
       if (!outDir) throw new KordocError("--out-dir \uC774 \uD544\uC694\uD569\uB2C8\uB2E4 (crop \uC740 \uD30C\uC77C \uC5EC\uB7EC \uAC1C\uB97C \uB0C5\uB2C8\uB2E4)");
       const types = String(opts.target).split(",").map((t) => t.trim()).filter(Boolean);
       for (const t of types) if (!["table", "image", "paragraph", "shape"].includes(t)) throw new KordocError(`--target \uC720\uD615 \uC624\uB958: ${t}`);
-      const { extractRenderedRegions } = await import("./render-RZF6SNSN.js");
+      const { extractRenderedRegions } = await import("./render-NZ6RA6SW.js");
       const regions = await extractRenderedRegions(resolve5(file), {
         types,
         format: fmt,
@@ -1231,7 +1231,7 @@ function registerRenderCommands(program2) {
       if (policy !== "none" && !outDir) throw new KordocError("--visual \uC740 crop \uD30C\uC77C\uC744 \uB0B4\uBBC0\uB85C --out-dir \uC774 \uD544\uC694\uD569\uB2C8\uB2E4");
       const cropFmt = String(opts.cropFormat);
       if (!["png", "jpeg"].includes(cropFmt)) throw new KordocError(`--crop-format \uC740 png|jpeg: ${cropFmt}`);
-      const { extractTables } = await import("./visual-I64Z7W3Q.js");
+      const { extractTables } = await import("./visual-JDAS4R43.js");
       const tables = await extractTables(resolve5(file), { policy, format: cropFmt, paddingPt: Number(opts.padding) || 0 });
       const dir = outDir ? resolve5(outDir) : void 0;
       if (dir) mkdirSync4(dir, { recursive: true });
@@ -1275,7 +1275,7 @@ function registerRenderCommands(program2) {
   });
   program2.command("render-worker").description("persistent \uB80C\uB354 \uC6CC\uCEE4 \u2014 stdin NDJSON \uC694\uCCAD \u2192 \uC870\uD310 SVG \uD30C\uC77C \uCD9C\uB825 (\uD504\uB85C\uC138\uC2A4 \uC720\uC9C0, \uCF5C\uB4DC\uC2A4\uD0C0\uD2B8 \uC81C\uAC70)").action(async () => {
     const { createInterface } = await import("readline");
-    const { renderHwpxToSvg } = await import("./render-RZF6SNSN.js");
+    const { renderHwpxToSvg } = await import("./render-NZ6RA6SW.js");
     const rl = createInterface({ input: process.stdin });
     const write = (o) => void process.stdout.write(JSON.stringify(o) + "\n");
     write({ ready: true, version: VERSION });
@@ -1324,12 +1324,12 @@ function registerSystemCommands(program2) {
     await startMcpServer();
   });
   program2.command("setup").description("\uB300\uD654\uD615 \uC124\uCE58 \uB9C8\uBC95\uC0AC \u2014 AI \uD074\uB77C\uC774\uC5B8\uD2B8 \uC790\uB3D9 \uB4F1\uB85D (Mac/Win/Linux)").action(async () => {
-    const { runSetup } = await import("./setup-IUCBBXYG.js");
+    const { runSetup } = await import("./setup-U3EQNK4Z.js");
     await runSetup();
   });
   program2.command("check-formula-models").description("PDF \uC218\uC2DD OCR \uBAA8\uB378(MFD + MFR + tokenizer, ~155MB) \uC0C1\uD0DC \uD655\uC778 \u2014 \uC5C6\uAC70\uB098 SHA \uBD88\uC77C\uCE58\uBA74 \uB2E4\uC6B4\uB85C\uB4DC").option("--status-only", "\uC0C1\uD0DC\uB9CC JSON \uC73C\uB85C \uCD9C\uB825 (\uB2E4\uC6B4\uB85C\uB4DC \uC548 \uD568)").action(async (opts) => {
     try {
-      const { getFormulaModelStatus, ensureFormulaModels, getFormulaModelsDir } = await import("./formula-RA2JV55J.js");
+      const { getFormulaModelStatus, ensureFormulaModels, getFormulaModelsDir } = await import("./formula-YCAO5IVW.js");
       const dir = getFormulaModelsDir();
       if (opts.statusOnly) {
         const status = await getFormulaModelStatus();
@@ -1383,7 +1383,7 @@ function registerSystemCommands(program2) {
   });
   program2.command("check-ocr-models").description("\uD14D\uC2A4\uD2B8 OCR \uBAA8\uB378(PP-OCRv5 korean det+rec, ~18MB) \uC0C1\uD0DC \uD655\uC778 \u2014 \uC5C6\uAC70\uB098 SHA \uBD88\uC77C\uCE58\uBA74 \uB2E4\uC6B4\uB85C\uB4DC").option("--status-only", "\uC0C1\uD0DC\uB9CC JSON \uC73C\uB85C \uCD9C\uB825 (\uB2E4\uC6B4\uB85C\uB4DC \uC548 \uD568)").action(async (opts) => {
     try {
-      const { getOcrModelStatus, ensureOcrModels, getOcrModelsDir } = await import("./models-ZZCRW54N.js");
+      const { getOcrModelStatus, ensureOcrModels, getOcrModelsDir } = await import("./models-UVLAKK3M.js");
       const dir = getOcrModelsDir();
       if (opts.statusOnly) {
         const status = await getOcrModelStatus();
@@ -1437,7 +1437,7 @@ function registerSystemCommands(program2) {
   });
   program2.command("models").description("OCR/\uC218\uC2DD \uBAA8\uB378 \uC624\uD504\uB77C\uC778 \uC0AC\uC774\uB4DC\uB85C\uB4DC \u2014 \uD3D0\uC1C4\uB9DD \uBC18\uC785\uC6A9 \uB0B4\uBCF4\uB0B4\uAE30/\uAC00\uC838\uC624\uAE30 (SHA-256 \uAC80\uC99D)").option("--status", "\uCE90\uC2DC\uC5D0 \uC124\uCE58\uB41C \uBAA8\uB378 \uC0C1\uD0DC\uB97C JSON \uC73C\uB85C \uCD9C\uB825").option("--export <dir>", "\uB85C\uCEEC \uCE90\uC2DC \u2192 \uBC88\uB4E4 \uB514\uB809\uD1A0\uB9AC\uB85C \uB0B4\uBCF4\uB0B4\uAE30 (\uC628\uB77C\uC778 PC\uC5D0\uC11C \uC2E4\uD589)").option("--import <dir>", "\uBC88\uB4E4 \uB514\uB809\uD1A0\uB9AC \u2192 \uB85C\uCEEC \uCE90\uC2DC\uB85C \uC124\uCE58 (\uB0B4\uBD80\uB9DD PC\uC5D0\uC11C \uC2E4\uD589)").action(async (opts) => {
     try {
-      const { exportModels, importModels, modelCacheStatus } = await import("./model-bundle-PKJUJTPC.js");
+      const { exportModels, importModels, modelCacheStatus } = await import("./model-bundle-53CHDYCG.js");
       if (opts.status) {
         process.stdout.write(JSON.stringify(await modelCacheStatus(), null, 2) + "\n");
         return;

package/dist/{formula-5BPY5GQL.js → formula-DAMFHLQO.js}

@@ -11,8 +11,8 @@ import {
   ensureSingleModel,
   getFormulaModelStatus,
   getFormulaModelsDir
-} from "./chunk-XJCWMVVY.js";
-import "./chunk-KA2NMWIC.js";
+} from "./chunk-PHMWSWHJ.js";
+import "./chunk-EBXJ45VZ.js";
 
 // src/pdf/formula/postprocess.ts
 var TRAILING_WHITESPACE_CMDS = [
@@ -954,4 +954,4 @@ export {
   getFormulaModelsDir,
   postProcessLatex
 };
-//# sourceMappingURL=formula-5BPY5GQL.js.map
+//# sourceMappingURL=formula-DAMFHLQO.js.map

package/dist/{formula-VUI2AJUZ.cjs → formula-HJNQGPRC.cjs}

@@ -11,8 +11,8 @@ var _chunkTK3FDAEEcjs = require('./chunk-TK3FDAEE.cjs');
 
 
 
-var _chunkDT5OWHWOcjs = require('./chunk-DT5OWHWO.cjs');
-require('./chunk-FS6RCEF6.cjs');
+var _chunk6CQZMVXWcjs = require('./chunk-6CQZMVXW.cjs');
+require('./chunk-K6WSMTVU.cjs');
 require('./chunk-GS7T56RP.cjs');
 
 // src/pdf/formula/postprocess.ts
@@ -767,11 +767,11 @@ var FormulaPipeline = class _FormulaPipeline {
     ]);
     const sharpAny = sharpModRaw;
     const sharpMod = typeof sharpAny === "function" ? sharpAny : _nullishCoalesce(sharpAny.default, () => ( sharpAny));
-    const modelsDir = _chunkDT5OWHWOcjs.getFormulaModelsDir.call(void 0, );
-    const mfdPath = _path.join.call(void 0, modelsDir, _chunkDT5OWHWOcjs.MFD_MODEL.filename);
-    const encPath = _path.join.call(void 0, modelsDir, _chunkDT5OWHWOcjs.MFR_ENCODER_MODEL.filename);
-    const decPath = _path.join.call(void 0, modelsDir, _chunkDT5OWHWOcjs.MFR_DECODER_MODEL.filename);
-    const tokPath = _path.join.call(void 0, modelsDir, _chunkDT5OWHWOcjs.MFR_TOKENIZER.filename);
+    const modelsDir = _chunk6CQZMVXWcjs.getFormulaModelsDir.call(void 0, );
+    const mfdPath = _path.join.call(void 0, modelsDir, _chunk6CQZMVXWcjs.MFD_MODEL.filename);
+    const encPath = _path.join.call(void 0, modelsDir, _chunk6CQZMVXWcjs.MFR_ENCODER_MODEL.filename);
+    const decPath = _path.join.call(void 0, modelsDir, _chunk6CQZMVXWcjs.MFR_DECODER_MODEL.filename);
+    const tokPath = _path.join.call(void 0, modelsDir, _chunk6CQZMVXWcjs.MFR_TOKENIZER.filename);
     const sessionOpts = {
       graphOptimizationLevel: "all",
       executionProviders: ["cpu"]
@@ -954,5 +954,5 @@ function bgraToRgba(bgra) {
 
 
 
-exports.ALL_FORMULA_MODELS = _chunkDT5OWHWOcjs.ALL_FORMULA_MODELS; exports.FormulaPipeline = FormulaPipeline; exports.MFD_MODEL = _chunkDT5OWHWOcjs.MFD_MODEL; exports.MFR_DECODER_MODEL = _chunkDT5OWHWOcjs.MFR_DECODER_MODEL; exports.MFR_ENCODER_MODEL = _chunkDT5OWHWOcjs.MFR_ENCODER_MODEL; exports.MFR_TOKENIZER = _chunkDT5OWHWOcjs.MFR_TOKENIZER; exports.ensureFormulaModels = _chunkDT5OWHWOcjs.ensureFormulaModels; exports.ensureSingleModel = _chunkDT5OWHWOcjs.ensureSingleModel; exports.getFormulaModelStatus = _chunkDT5OWHWOcjs.getFormulaModelStatus; exports.getFormulaModelsDir = _chunkDT5OWHWOcjs.getFormulaModelsDir; exports.postProcessLatex = postProcessLatex;
-//# sourceMappingURL=formula-VUI2AJUZ.cjs.map
+exports.ALL_FORMULA_MODELS = _chunk6CQZMVXWcjs.ALL_FORMULA_MODELS; exports.FormulaPipeline = FormulaPipeline; exports.MFD_MODEL = _chunk6CQZMVXWcjs.MFD_MODEL; exports.MFR_DECODER_MODEL = _chunk6CQZMVXWcjs.MFR_DECODER_MODEL; exports.MFR_ENCODER_MODEL = _chunk6CQZMVXWcjs.MFR_ENCODER_MODEL; exports.MFR_TOKENIZER = _chunk6CQZMVXWcjs.MFR_TOKENIZER; exports.ensureFormulaModels = _chunk6CQZMVXWcjs.ensureFormulaModels; exports.ensureSingleModel = _chunk6CQZMVXWcjs.ensureSingleModel; exports.getFormulaModelStatus = _chunk6CQZMVXWcjs.getFormulaModelStatus; exports.getFormulaModelsDir = _chunk6CQZMVXWcjs.getFormulaModelsDir; exports.postProcessLatex = postProcessLatex;
+//# sourceMappingURL=formula-HJNQGPRC.cjs.map

package/dist/{formula-VUI2AJUZ.cjs.map → formula-HJNQGPRC.cjs.map}

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

package/dist/{formula-RA2JV55J.js → formula-YCAO5IVW.js}

@@ -12,9 +12,9 @@ import {
   ensureSingleModel,
   getFormulaModelStatus,
   getFormulaModelsDir
-} from "./chunk-QK6AJJMJ.js";
-import "./chunk-P6GO34IP.js";
-import "./chunk-JZ3VPASI.js";
+} from "./chunk-JWTZ3OVZ.js";
+import "./chunk-ISC2TH24.js";
+import "./chunk-PN5WWW56.js";
 
 // src/pdf/formula/postprocess.ts
 var TRAILING_WHITESPACE_CMDS = [
@@ -956,4 +956,4 @@ export {
   getFormulaModelsDir,
   postProcessLatex
 };
-//# sourceMappingURL=formula-RA2JV55J.js.map
+//# sourceMappingURL=formula-YCAO5IVW.js.map