kordoc 4.24.13 → 4.24.15
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +7 -7
- package/dist/{-NBCZTPBD.js → -CCZTES5C.js} +11 -11
- package/dist/{chunk-XWWQGSEP.js → chunk-4EVUCAW5.js} +2 -2
- package/dist/{chunk-VPKZB6Y7.cjs → chunk-4ZNM7XRW.cjs} +6 -6
- package/dist/{chunk-VPKZB6Y7.cjs.map → chunk-4ZNM7XRW.cjs.map} +1 -1
- package/dist/{chunk-XGESPSWE.cjs → chunk-6KQWC2KN.cjs} +3 -3
- package/dist/{chunk-XGESPSWE.cjs.map → chunk-6KQWC2KN.cjs.map} +1 -1
- package/dist/{chunk-QW2H2HHS.js → chunk-6WEHXC2D.js} +315 -6
- package/dist/chunk-6WEHXC2D.js.map +1 -0
- package/dist/{chunk-PUHBCAXI.js → chunk-7Y4MVNYA.js} +11 -11
- package/dist/{chunk-CKOCIQU6.js → chunk-7YCKDE5X.js} +2 -2
- package/dist/{chunk-FJ3IKKDV.js → chunk-DULJ7PPP.js} +315 -6
- package/dist/chunk-DULJ7PPP.js.map +1 -0
- package/dist/{chunk-KTXDK5A6.js → chunk-E5H5WHJH.js} +2 -2
- package/dist/{chunk-A232MW5F.js → chunk-EY3PT2X7.js} +2 -2
- package/dist/{chunk-W52B6GOE.cjs → chunk-GDE4YE2P.cjs} +3 -3
- package/dist/{chunk-W52B6GOE.cjs.map → chunk-GDE4YE2P.cjs.map} +1 -1
- package/dist/{chunk-UVQOPGOA.js → chunk-GZ3BY2LV.js} +14 -9
- package/dist/chunk-GZ3BY2LV.js.map +1 -0
- package/dist/{chunk-ZUMOEVMV.js → chunk-HZFYPOBJ.js} +3 -3
- package/dist/{chunk-OVQWOOS3.js → chunk-IGLRJCO6.js} +2 -2
- package/dist/{chunk-A4CYMI55.js → chunk-K37LMDT5.js} +2 -2
- package/dist/{chunk-X2E5QCKO.js → chunk-KMSLXG5F.js} +2 -2
- package/dist/{chunk-DMPX4KLC.js → chunk-KOHEEPQV.js} +2 -2
- package/dist/{chunk-37MTSMUF.js → chunk-MTAQVHCB.js} +2 -2
- package/dist/{chunk-2H2VYPM2.cjs → chunk-OICA67AT.cjs} +2 -2
- package/dist/{chunk-2H2VYPM2.cjs.map → chunk-OICA67AT.cjs.map} +1 -1
- package/dist/{chunk-QAGPSWGH.js → chunk-PCHGHLUP.js} +2 -2
- package/dist/{chunk-BC4LVU4D.js → chunk-SLHWOJNZ.js} +2 -2
- package/dist/{chunk-ZSCDH3NU.js → chunk-T7MDUY5X.js} +2 -2
- package/dist/{chunk-QVEAR6IR.js → chunk-UGO3UFXX.js} +48 -7
- package/dist/chunk-UGO3UFXX.js.map +1 -0
- package/dist/{chunk-WAWREGAC.js → chunk-UV2ZS65C.js} +2 -2
- package/dist/{chunk-4I2CKMKU.js → chunk-VNB2IKVA.js} +3 -3
- package/dist/{chunk-IQGXY63Y.js → chunk-VSYLST4K.js} +49 -8
- package/dist/chunk-VSYLST4K.js.map +1 -0
- package/dist/{chunk-QZ2H4ZTO.cjs → chunk-X2XZXDBZ.cjs} +390 -81
- package/dist/chunk-X2XZXDBZ.cjs.map +1 -0
- package/dist/{chunk-WOVJRXIA.js → chunk-XW7L76FE.js} +2 -2
- package/dist/{chunk-BJBPBU5B.js → chunk-Y3VNNGB2.js} +2 -2
- package/dist/{chunk-U2VAABMK.cjs → chunk-YAK4U7CC.cjs} +194 -153
- package/dist/chunk-YAK4U7CC.cjs.map +1 -0
- package/dist/chunks-74SE5QB2.js +10 -0
- package/dist/cli.js +30 -30
- package/dist/{formula-WFL6JRCR.js → formula-54IFKOYU.js} +3 -3
- package/dist/{formula-M4FM364X.js → formula-EW7XLBSA.js} +4 -4
- package/dist/{formula-ZKZGV6JV.cjs → formula-Q4MFVPEO.cjs} +9 -9
- package/dist/{formula-ZKZGV6JV.cjs.map → formula-Q4MFVPEO.cjs.map} +1 -1
- package/dist/{image-ocr-47CBNIS5.js → image-ocr-GWF2XELH.js} +9 -9
- package/dist/{image-ocr-YJISJPKE.js → image-ocr-I7UGQZF5.js} +6 -6
- package/dist/{image-ocr-2V3M3ZEA.cjs → image-ocr-OGJ6A3ML.cjs} +17 -17
- package/dist/{image-ocr-2V3M3ZEA.cjs.map → image-ocr-OGJ6A3ML.cjs.map} +1 -1
- package/dist/index.cjs +368 -363
- package/dist/index.cjs.map +1 -1
- package/dist/index.js +14 -9
- package/dist/index.js.map +1 -1
- package/dist/mcp.js +23 -23
- package/dist/{model-bundle-7W344HDI.js → model-bundle-43YHGZCC.js} +5 -5
- package/dist/{models-TBHMNI7M.js → models-O3NS6OPX.js} +5 -5
- package/dist/{parse-worker-v2-JUYUEXCY.js → parse-worker-v2-OXW3CQOW.js} +12 -12
- package/dist/{parser-RNJ4KSDF.js → parser-B3RVTCOY.js} +9 -9
- package/dist/{parser-R44KTBZX.cjs → parser-FMVOWRG4.cjs} +159 -159
- package/dist/{parser-R44KTBZX.cjs.map → parser-FMVOWRG4.cjs.map} +1 -1
- package/dist/{parser-EKQCZLML.js → parser-H6OY6UWW.js} +12 -12
- package/dist/pdf-ocr-5Z6GDYBQ.cjs +35 -0
- package/dist/{pdf-ocr-74BOCXAT.cjs.map → pdf-ocr-5Z6GDYBQ.cjs.map} +1 -1
- package/dist/{pdf-ocr-ZAF4P74R.js → pdf-ocr-NE6Y4I6O.js} +6 -6
- package/dist/{pdf-ocr-EE5KGFVX.js → pdf-ocr-QHW74LO6.js} +9 -9
- package/dist/{profile-io-RU3RVIYV.js → profile-io-2IOYOBGP.js} +3 -3
- package/dist/{rasterize-UNCPM26D.js → rasterize-ZLPDGEZY.js} +3 -3
- package/dist/{redact-doc-BFE4UZCY.js → redact-doc-CDFM5S7S.js} +11 -11
- package/dist/{render-3DXTLKIA.js → render-VXAEYSJA.js} +7 -7
- package/dist/seal-YSBFBEXC.js +10 -0
- package/dist/{setup-7POQAKDG.js → setup-CBWVQJID.js} +3 -3
- package/dist/visual-MJVIFZHH.js +21 -0
- package/dist/{watch-37YCXJWW.js → watch-2SA3CTRT.js} +12 -12
- package/package.json +1 -1
- package/dist/chunk-FJ3IKKDV.js.map +0 -1
- package/dist/chunk-IQGXY63Y.js.map +0 -1
- package/dist/chunk-QVEAR6IR.js.map +0 -1
- package/dist/chunk-QW2H2HHS.js.map +0 -1
- package/dist/chunk-QZ2H4ZTO.cjs.map +0 -1
- package/dist/chunk-U2VAABMK.cjs.map +0 -1
- package/dist/chunk-UVQOPGOA.js.map +0 -1
- package/dist/chunks-IXFBIZPW.js +0 -10
- package/dist/pdf-ocr-74BOCXAT.cjs +0 -35
- package/dist/seal-3LBTETDG.js +0 -10
- package/dist/visual-7SVIGIJC.js +0 -21
- /package/dist/{-NBCZTPBD.js.map → -CCZTES5C.js.map} +0 -0
- /package/dist/{chunk-XWWQGSEP.js.map → chunk-4EVUCAW5.js.map} +0 -0
- /package/dist/{chunk-PUHBCAXI.js.map → chunk-7Y4MVNYA.js.map} +0 -0
- /package/dist/{chunk-CKOCIQU6.js.map → chunk-7YCKDE5X.js.map} +0 -0
- /package/dist/{chunk-KTXDK5A6.js.map → chunk-E5H5WHJH.js.map} +0 -0
- /package/dist/{chunk-A232MW5F.js.map → chunk-EY3PT2X7.js.map} +0 -0
- /package/dist/{chunk-ZUMOEVMV.js.map → chunk-HZFYPOBJ.js.map} +0 -0
- /package/dist/{chunk-OVQWOOS3.js.map → chunk-IGLRJCO6.js.map} +0 -0
- /package/dist/{chunk-A4CYMI55.js.map → chunk-K37LMDT5.js.map} +0 -0
- /package/dist/{chunk-X2E5QCKO.js.map → chunk-KMSLXG5F.js.map} +0 -0
- /package/dist/{chunk-DMPX4KLC.js.map → chunk-KOHEEPQV.js.map} +0 -0
- /package/dist/{chunk-37MTSMUF.js.map → chunk-MTAQVHCB.js.map} +0 -0
- /package/dist/{chunk-QAGPSWGH.js.map → chunk-PCHGHLUP.js.map} +0 -0
- /package/dist/{chunk-BC4LVU4D.js.map → chunk-SLHWOJNZ.js.map} +0 -0
- /package/dist/{chunk-ZSCDH3NU.js.map → chunk-T7MDUY5X.js.map} +0 -0
- /package/dist/{chunk-WAWREGAC.js.map → chunk-UV2ZS65C.js.map} +0 -0
- /package/dist/{chunk-4I2CKMKU.js.map → chunk-VNB2IKVA.js.map} +0 -0
- /package/dist/{chunk-WOVJRXIA.js.map → chunk-XW7L76FE.js.map} +0 -0
- /package/dist/{chunk-BJBPBU5B.js.map → chunk-Y3VNNGB2.js.map} +0 -0
- /package/dist/{chunks-IXFBIZPW.js.map → chunks-74SE5QB2.js.map} +0 -0
- /package/dist/{formula-WFL6JRCR.js.map → formula-54IFKOYU.js.map} +0 -0
- /package/dist/{formula-M4FM364X.js.map → formula-EW7XLBSA.js.map} +0 -0
- /package/dist/{image-ocr-47CBNIS5.js.map → image-ocr-GWF2XELH.js.map} +0 -0
- /package/dist/{image-ocr-YJISJPKE.js.map → image-ocr-I7UGQZF5.js.map} +0 -0
- /package/dist/{model-bundle-7W344HDI.js.map → model-bundle-43YHGZCC.js.map} +0 -0
- /package/dist/{models-TBHMNI7M.js.map → models-O3NS6OPX.js.map} +0 -0
- /package/dist/{parse-worker-v2-JUYUEXCY.js.map → parse-worker-v2-OXW3CQOW.js.map} +0 -0
- /package/dist/{parser-RNJ4KSDF.js.map → parser-B3RVTCOY.js.map} +0 -0
- /package/dist/{parser-EKQCZLML.js.map → parser-H6OY6UWW.js.map} +0 -0
- /package/dist/{pdf-ocr-EE5KGFVX.js.map → pdf-ocr-NE6Y4I6O.js.map} +0 -0
- /package/dist/{pdf-ocr-ZAF4P74R.js.map → pdf-ocr-QHW74LO6.js.map} +0 -0
- /package/dist/{profile-io-RU3RVIYV.js.map → profile-io-2IOYOBGP.js.map} +0 -0
- /package/dist/{rasterize-UNCPM26D.js.map → rasterize-ZLPDGEZY.js.map} +0 -0
- /package/dist/{redact-doc-BFE4UZCY.js.map → redact-doc-CDFM5S7S.js.map} +0 -0
- /package/dist/{render-3DXTLKIA.js.map → render-VXAEYSJA.js.map} +0 -0
- /package/dist/{seal-3LBTETDG.js.map → seal-YSBFBEXC.js.map} +0 -0
- /package/dist/{setup-7POQAKDG.js.map → setup-CBWVQJID.js.map} +0 -0
- /package/dist/{visual-7SVIGIJC.js.map → visual-MJVIFZHH.js.map} +0 -0
- /package/dist/{watch-37YCXJWW.js.map → watch-2SA3CTRT.js.map} +0 -0
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
"use strict";Object.defineProperty(exports, "__esModule", {value: true}); function _nullishCoalesce(lhs, rhsFn) { if (lhs != null) { return lhs; } else { return rhsFn(); } } function _optionalChain(ops) { let lastAccessLHS = undefined; let value = ops[0]; let i = 1; while (i < ops.length) { const op = ops[i]; const fn = ops[i + 1]; i += 2; if ((op === 'optionalAccess' || op === 'optionalCall') && value == null) { return undefined; } if (op === 'access' || op === 'optionalAccess') { lastAccessLHS = value; value = fn(value); } else if (op === 'call' || op === 'optionalCall') { value = fn((...args) => value.call(lastAccessLHS, ...args)); lastAccessLHS = undefined; } } return value; }
|
|
2
2
|
|
|
3
|
-
var
|
|
3
|
+
var _chunkOICA67ATcjs = require('./chunk-OICA67AT.cjs');
|
|
4
4
|
|
|
5
5
|
// src/pdf/formula/models.ts
|
|
6
6
|
var _crypto = require('crypto');
|
|
@@ -23,7 +23,7 @@ function isOfflineMode() {
|
|
|
23
23
|
}
|
|
24
24
|
function assertNetworkAllowed(what, hint) {
|
|
25
25
|
if (!isOfflineMode()) return;
|
|
26
|
-
throw new (0,
|
|
26
|
+
throw new (0, _chunkOICA67ATcjs.KordocError)(
|
|
27
27
|
`\uD3D0\uC1C4\uB9DD \uBAA8\uB4DC(KORDOC_OFFLINE)\uC5D0\uC11C \uCC28\uB2E8\uB428: ${what}` + (hint ? ` \u2014 ${hint}` : "")
|
|
28
28
|
);
|
|
29
29
|
}
|
|
@@ -310,4 +310,4 @@ async function sha256OfFile(p) {
|
|
|
310
310
|
|
|
311
311
|
|
|
312
312
|
exports.MFD_MODEL = MFD_MODEL; exports.MFR_ENCODER_MODEL = MFR_ENCODER_MODEL; exports.MFR_DECODER_MODEL = MFR_DECODER_MODEL; exports.MFR_TOKENIZER = MFR_TOKENIZER; exports.ALL_FORMULA_MODELS = ALL_FORMULA_MODELS; exports.getModelsDir = getModelsDir; exports.getFormulaModelsDir = getFormulaModelsDir; exports.getFormulaModelStatus = getFormulaModelStatus; exports.ensureModelsIn = ensureModelsIn; exports.ensureFormulaModels = ensureFormulaModels; exports.ensureSingleModel = ensureSingleModel;
|
|
313
|
-
//# sourceMappingURL=chunk-
|
|
313
|
+
//# sourceMappingURL=chunk-6KQWC2KN.cjs.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["/Users/mong-e/workspace/kordoc/dist/chunk-XGESPSWE.cjs","../src/pdf/formula/models.ts","../src/shared/offline.ts","../src/pdf/formula/model-partials.ts"],"names":[],"mappings":"AAAA;AACE;AACF,wDAA6B;AAC7B;AACA;ACMA,gCAA2B;AAC3B,wBAAiC;AACjC,uCAA4C;AAC5C;AACA,wBAAwB;AACxB,4BAA8B;AAC9B,4CAAyB;AACzB,gCAAyB;ADJzB;AACA;AEKA,IAAM,OAAA,kBAAS,IAAI,GAAA,CAAI,CAAC,GAAA,EAAK,MAAA,EAAQ,KAAA,EAAO,IAAI,CAAC,CAAA;AAEjD,SAAS,OAAA,CAAQ,IAAA,EAAuB;AACtC,EAAA,MAAM,EAAA,EAAI,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA;AAC1B,EAAA,OAAO,CAAC,CAAC,EAAA,GAAK,MAAA,CAAO,GAAA,CAAI,CAAA,CAAE,IAAA,CAAK,CAAA,CAAE,WAAA,CAAY,CAAC,CAAA;AACjD;AAGO,SAAS,aAAA,CAAA,EAAyB;AACvC,EAAA,OAAO,OAAA,CAAQ,gBAAgB,CAAA;AACjC;AAOO,SAAS,oBAAA,CAAqB,IAAA,EAAc,IAAA,EAAqB;AACtE,EAAA,GAAA,CAAI,CAAC,aAAA,CAAc,CAAA,EAAG,MAAA;AACtB,EAAA,MAAM,IAAI,kCAAA;AAAA,IACR,CAAA,gFAAA,EAAiC,IAAI,CAAA,EAAA;AACvC,EAAA;AACF;AFZ4F;AACA;AG7BrD;AACI;AACX;AACP;AACe;AAEpC;AAC0B;AACV,EAAA;AACF,EAAA;AACkB,EAAA;AAC5B,IAAA;AAIwE,MAAA;AACb,MAAA;AACL,MAAA;AAClD,IAAA;AAGiB,MAAA;AACzB,IAAA;AACF,EAAA;AACwF,EAAA;AACjF,EAAA;AACT;AAEoE;AACO,EAAA;AAC3E;AAGqF;AACtD,EAAA;AAC+B,EAAA;AACxD,EAAA;AACA,EAAA;AAAsD,IAAA;AAAU,EAAA;AAAE,IAAA;AAAO,EAAA;AAChD,EAAA;AAG4B,IAAA;AACzC,IAAA;AACF,IAAA;AACe,IAAA;AACyB,IAAA;AAChD,IAAA;AACiB,MAAA;AACnB,MAAA;AACY,IAAA;AACyC,MAAA;AACvD,IAAA;AACI,IAAA;AAAoC,MAAA;AAAU,IAAA;AAAsC,IAAA;AAC1F,EAAA;AACF;AH2B4F;AACA;ACnDxD;AAC5B,EAAA;AACI,EAAA;AACL,EAAA;AACG,EAAA;AACA,EAAA;AACV;AAE4C;AACpC,EAAA;AACI,EAAA;AACL,EAAA;AACG,EAAA;AACA,EAAA;AACV;AAE4C;AACpC,EAAA;AACI,EAAA;AACL,EAAA;AACG,EAAA;AACA,EAAA;AACV;AAEwC;AAChC,EAAA;AACI,EAAA;AACL,EAAA;AACG,EAAA;AACA,EAAA;AACV;AAE4D;AAC1D,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACF;AAOqD;AACtB,EAAA;AACI,EAAA;AACH,IAAA;AAC9B,EAAA;AAC2D,EAAA;AAC7D;AAE8C;AACd,EAAA;AAChC;AAa6G;AAC5E,EAAA;AACL,EAAA;AACiB,IAAA;AAC5B,IAAA;AACT,IAAA;AAC4B,MAAA;AACE,MAAA;AAC1B,IAAA;AACG,MAAA;AACX,IAAA;AACa,IAAA;AACoD,MAAA;AAC/D,MAAA;AACF,IAAA;AACI,IAAA;AACyC,MAAA;AACf,MAAA;AACmC,QAAA;AACxD,MAAA;AACO,QAAA;AACV,UAAA;AACA,UAAA;AACQ,UAAA;AACE,UAAA;AAC4D,UAAA;AACvE,QAAA;AACH,MAAA;AACU,IAAA;AACE,MAAA;AACV,QAAA;AACA,QAAA;AACQ,QAAA;AACE,QAAA;AACgD,QAAA;AAC3D,MAAA;AACH,IAAA;AACF,EAAA;AACO,EAAA;AACT;AAGsE;AACH,EAAA;AACnE;AAoBgI;AAC1F,EAAA;AAEV,EAAA;AACiB,IAAA;AACG,IAAA;AAEO,IAAA;AACpC,sBAAA;AACX,QAAA;AACY,QAAA;AACL,QAAA;AACA,QAAA;AACE,QAAA;AACV,MAAA;AACD,MAAA;AACF,IAAA;AAIgD,IAAA;AAClD,EAAA;AACF;AAGuF;AACV,EAAA;AAC7E;AAGsG;AACpE,EAAA;AACI,EAAA;AACK,EAAA;AACG,EAAA;AACO,EAAA;AACe,oBAAA;AAChE,IAAA;AACF,EAAA;AACgD,EAAA;AAClD;AAE4F;AACtF,EAAA;AAC4B,IAAA;AACU,IAAA;AAClC,EAAA;AACC,IAAA;AACT,EAAA;AACI,EAAA;AACyC,IAAA;AACzB,IAAA;AACZ,EAAA;AACC,IAAA;AACT,EAAA;AACF;AAMiB;AAEf,EAAA;AACc,IAAA;AACQ,qBAAA;AACtB,EAAA;AAKmD,EAAA;AACA,EAAA;AAE/C,EAAA;AACiC,IAAA;AACxB,MAAA;AAAA;AAEO,QAAA;AAChB,MAAA;AACD,IAAA;AAC2B,IAAA;AAChB,MAAA;AAC0C,QAAA;AACpD,MAAA;AACF,IAAA;AAEmD,IAAA;AACQ,IAAA;AAC1C,IAAA;AAGsD,IAAA;AAClC,IAAA;AACjC,IAAA;AACyF,MAAA;AACzC,MAAA;AAC5B,QAAA;AACgC,QAAA;AACvC,wBAAA;AACX,UAAA;AACA,UAAA;AACA,UAAA;AACO,UAAA;AACR,QAAA;AACF,MAAA;AACwB,MAAA;AACf,IAAA;AACqD,MAAA;AACjE,IAAA;AAEa,oBAAA;AACX,MAAA;AACA,MAAA;AACA,MAAA;AACO,MAAA;AACR,IAAA;AAGG,IAAA;AACA,IAAA;AACkC,MAAA;AAC1B,IAAA;AACuD,MAAA;AACnE,IAAA;AAE4B,IAAA;AAChB,MAAA;AAC4D,QAAA;AACtE,MAAA;AACF,IAAA;AAEgC,IAAA;AACnB,oBAAA;AACX,MAAA;AACA,MAAA;AACA,MAAA;AACO,MAAA;AACR,IAAA;AACD,EAAA;AAGI,IAAA;AAAuB,MAAA;AAAU,IAAA;AAAuC,IAAA;AAC9E,EAAA;AACF;AAEwD;AACzB,EAAA;AACI,EAAA;AACY,EAAA;AACZ,IAAA;AACf,MAAA;AAEhB,IAAA;AACD,EAAA;AACoB,EAAA;AACvB;ADrB4F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"/Users/mong-e/workspace/kordoc/dist/chunk-XGESPSWE.cjs","sourcesContent":[null,"/**\n * 수식 OCR 모델 자동 다운로드 + SHA-256 검증\n *\n * 캐시 위치: `~/.cache/kordoc/models/pix2text/`\n * 총 ~155MB (MFD 44MB + MFR encoder 87MB + MFR decoder 30MB + tokenizer 40KB)\n *\n * HF URL + SHA 는 Docufinder archive/rust-formula-ocr-wip 에서 검증 완료됨.\n * 모델 버전 갱신 시 URL + SHA 를 함께 갱신해야 한다.\n */\n\nimport { createHash } from \"crypto\"\nimport { createReadStream } from \"fs\"\nimport { mkdir, stat, unlink, rename } from \"fs/promises\"\nimport { createWriteStream } from \"fs\"\nimport { homedir } from \"os\"\nimport { join, dirname } from \"path\"\nimport { pipeline } from \"stream/promises\"\nimport { Readable } from \"stream\"\nimport { assertNetworkAllowed } from \"../../shared/offline.js\"\nimport { cleanupModelDownloadPartials, modelDownloadPartialPath } from \"./model-partials.js\"\n\nexport interface ModelSpec {\n name: string\n filename: string\n url: string\n sha256: string\n sizeMb: number\n /** 폐쇄망 차단 안내 — 없으면 models --export/--import 안내 */\n offlineHint?: string\n}\n\n/** 모델 스펙 (SHA-256 은 실제 다운로드로 검증됨 — 변경 금지) */\nexport const MFD_MODEL: ModelSpec = {\n name: \"Pix2Text MFD\",\n filename: \"mfd.onnx\",\n url: \"https://huggingface.co/breezedeus/pix2text-mfd/resolve/main/mfd-v20240618.onnx\",\n sha256: \"51a8854743b17ae654729af8db82a630c1ccfa06debf4856c8b28055f87d02c1\",\n sizeMb: 42,\n}\n\nexport const MFR_ENCODER_MODEL: ModelSpec = {\n name: \"Pix2Text MFR encoder\",\n filename: \"encoder_model.onnx\",\n url: \"https://huggingface.co/breezedeus/pix2text-mfr/resolve/main/encoder_model.onnx\",\n sha256: \"bd8d5c322792e9ec45793af5569e9748f82a3d728a9e00213dbfc56c1486f37d\",\n sizeMb: 87,\n}\n\nexport const MFR_DECODER_MODEL: ModelSpec = {\n name: \"Pix2Text MFR decoder\",\n filename: \"decoder_model.onnx\",\n url: \"https://huggingface.co/breezedeus/pix2text-mfr/resolve/main/decoder_model.onnx\",\n sha256: \"fd0f92d7a012f3dae41e1ac79421aea0ea888b5a66cb3f9a004e424f82f3daed\",\n sizeMb: 30,\n}\n\nexport const MFR_TOKENIZER: ModelSpec = {\n name: \"Pix2Text MFR tokenizer\",\n filename: \"tokenizer.json\",\n url: \"https://huggingface.co/breezedeus/pix2text-mfr/resolve/main/tokenizer.json\",\n sha256: \"3e2ab757277d22639bec28c9d7972e352d3d1dba223051fa674002dc5ab64df3\",\n sizeMb: 1,\n}\n\nexport const ALL_FORMULA_MODELS: ReadonlyArray<ModelSpec> = [\n MFD_MODEL,\n MFR_ENCODER_MODEL,\n MFR_DECODER_MODEL,\n MFR_TOKENIZER,\n]\n\n/**\n * 모델 캐시 하위 디렉토리 경로. 환경 변수 `KORDOC_MODEL_CACHE` 가 설정되면\n * 해당 경로를 우선 사용, 없으면 `~/.cache/kordoc/models/<subdir>/`.\n * (수식 OCR 외 텍스트 OCR 등 다른 모델군도 공용 — subdir 로 격리)\n */\nexport function getModelsDir(subdir: string): string {\n const override = process.env.KORDOC_MODEL_CACHE\n if (override && override.trim()) {\n return join(override, subdir)\n }\n return join(homedir(), \".cache\", \"kordoc\", \"models\", subdir)\n}\n\nexport function getFormulaModelsDir(): string {\n return getModelsDir(\"pix2text\")\n}\n\nexport interface ModelStatus {\n spec: ModelSpec\n localPath: string\n exists: boolean\n /** SHA 검증까지 끝났는가 (exists && valid) */\n verified: boolean\n /** 검증 실패 시 이유 */\n invalidReason?: string\n}\n\n/** 지정 모델군의 존재/유효성 상태 반환 (다운로드 없이 확인만) */\nexport async function getModelStatusIn(dir: string, specs: ReadonlyArray<ModelSpec>): Promise<ModelStatus[]> {\n const result: ModelStatus[] = []\n for (const spec of specs) {\n const localPath = join(dir, spec.filename)\n let exists = false\n try {\n const s = await stat(localPath)\n exists = s.isFile() && s.size > 0\n } catch {\n exists = false\n }\n if (!exists) {\n result.push({ spec, localPath, exists: false, verified: false })\n continue\n }\n try {\n const actual = await sha256OfFile(localPath)\n if (actual === spec.sha256) {\n result.push({ spec, localPath, exists: true, verified: true })\n } else {\n result.push({\n spec,\n localPath,\n exists: true,\n verified: false,\n invalidReason: `SHA256 mismatch: expected ${spec.sha256}, got ${actual}`,\n })\n }\n } catch (e) {\n result.push({\n spec,\n localPath,\n exists: true,\n verified: false,\n invalidReason: `SHA compute failed: ${(e as Error).message}`,\n })\n }\n }\n return result\n}\n\n/** 모든 수식 모델의 존재/유효성 상태 반환 (다운로드 없이 확인만) */\nexport async function getFormulaModelStatus(): Promise<ModelStatus[]> {\n return getModelStatusIn(getFormulaModelsDir(), ALL_FORMULA_MODELS)\n}\n\nexport interface DownloadProgress {\n spec: ModelSpec\n /** 현재까지 다운로드한 바이트 */\n downloaded: number\n /** 전체 바이트 (알 수 있으면) */\n total: number | null\n /** \"download\" | \"verify\" | \"done\" | \"skip\" */\n phase: \"download\" | \"verify\" | \"done\" | \"skip\" | \"error\"\n message?: string\n}\n\nexport type ProgressHandler = (p: DownloadProgress) => void\n\n/**\n * 지정 모델군을 다운로드/검증한다.\n * - 이미 있고 SHA 일치 → skip\n * - 없음 → 다운로드 후 SHA 검증. 실패 시 파일 삭제.\n */\nexport async function ensureModelsIn(dir: string, specs: ReadonlyArray<ModelSpec>, onProgress?: ProgressHandler): Promise<void> {\n await mkdir(dir, { recursive: true })\n\n for (const spec of specs) {\n const localPath = join(dir, spec.filename)\n await cleanupModelDownloadPartials(localPath)\n\n if (await isExistingValid(localPath, spec.sha256)) {\n onProgress?.({\n spec,\n downloaded: 0,\n total: null,\n phase: \"skip\",\n message: \"이미 존재 + SHA 일치\",\n })\n continue\n }\n\n // Keep the destination until atomic replacement; another process may have\n // finished a valid download since our initial check.\n await downloadToFile(spec, localPath, onProgress)\n }\n}\n\n/** 필요한 모든 수식 모델을 다운로드/검증한다. */\nexport async function ensureFormulaModels(onProgress?: ProgressHandler): Promise<void> {\n return ensureModelsIn(getFormulaModelsDir(), ALL_FORMULA_MODELS, onProgress)\n}\n\n/** 단일 모델만 확인/다운로드 (진단 UI 에서 개별 상태 새로고침용) */\nexport async function ensureSingleModel(spec: ModelSpec, onProgress?: ProgressHandler): Promise<void> {\n const dir = getFormulaModelsDir()\n await mkdir(dir, { recursive: true })\n const localPath = join(dir, spec.filename)\n await cleanupModelDownloadPartials(localPath)\n if (await isExistingValid(localPath, spec.sha256)) {\n onProgress?.({ spec, downloaded: 0, total: null, phase: \"skip\" })\n return\n }\n await downloadToFile(spec, localPath, onProgress)\n}\n\nasync function isExistingValid(localPath: string, sha256Expected: string): Promise<boolean> {\n try {\n const s = await stat(localPath)\n if (!s.isFile() || s.size === 0) return false\n } catch {\n return false\n }\n try {\n const actual = await sha256OfFile(localPath)\n return actual === sha256Expected\n } catch {\n return false\n }\n}\n\nasync function downloadToFile(\n spec: ModelSpec,\n localPath: string,\n onProgress?: ProgressHandler,\n): Promise<void> {\n // 폐쇄망 모드에서는 요청 자체를 보내지 않는다 (사이드로드 안내로 대체)\n assertNetworkAllowed(\n `${spec.name} 모델 다운로드`,\n spec.offlineHint ?? \"온라인 PC에서 `kordoc models --export <디렉토리>` 로 내보낸 뒤 이 PC에서 `kordoc models --import <디렉토리>` 하거나, KORDOC_MODEL_CACHE 로 모델 캐시 경로를 지정하세요\",\n )\n\n // 먼저 .part 로 받고 검증 후 rename — 중단된 다운로드가 \"정상 파일\"로 오인되는 걸 방지\n // Batch workers may download the same missing model concurrently. Never share\n // a partial file: only a fully verified download is atomically published.\n const partPath = modelDownloadPartialPath(localPath)\n await mkdir(dirname(localPath), { recursive: true })\n\n try {\n const resp = await fetch(spec.url, {\n headers: {\n // HF CDN 은 UA 없으면 가끔 403 을 뱉는다\n \"User-Agent\": \"kordoc-formula-ocr/1.0 (+https://github.com/chrisryugj/kordoc)\",\n },\n })\n if (!resp.ok || !resp.body) {\n throw new Error(\n `${spec.name} 다운로드 실패: HTTP ${resp.status} ${resp.statusText} (${spec.url})`,\n )\n }\n\n const lenHeader = resp.headers.get(\"content-length\")\n const total = lenHeader ? Number.parseInt(lenHeader, 10) : null\n let downloaded = 0\n\n // 크기 상한 — SHA-256 은 다 받은 뒤 검증하므로, 받는 동안 응답이 끝없이 이어지면 디스크가 찬다\n const maxBytes = Math.max(spec.sizeMb * 1.5, spec.sizeMb + 8) * 1024 * 1024\n const ws = createWriteStream(partPath)\n try {\n const reader = Readable.fromWeb(resp.body as unknown as import(\"stream/web\").ReadableStream)\n reader.on(\"data\", (chunk: Buffer | Uint8Array) => {\n downloaded += chunk.length\n if (downloaded > maxBytes) reader.destroy(new Error(`응답이 예상 크기(${spec.sizeMb}MB)를 크게 넘습니다`))\n onProgress?.({\n spec,\n downloaded,\n total,\n phase: \"download\",\n })\n })\n await pipeline(reader, ws)\n } catch (e) {\n throw new Error(`${spec.name} 스트리밍 실패: ${(e as Error).message}`)\n }\n\n onProgress?.({\n spec,\n downloaded,\n total,\n phase: \"verify\",\n })\n\n // SHA 검증\n let actual: string\n try {\n actual = await sha256OfFile(partPath)\n } catch (e) {\n throw new Error(`${spec.name} SHA 계산 실패: ${(e as Error).message}`)\n }\n\n if (actual !== spec.sha256) {\n throw new Error(\n `${spec.name} SHA256 mismatch: expected ${spec.sha256}, got ${actual} — 모델 URL 이 오염되었거나 전송 중 손상되었습니다.`,\n )\n }\n\n await rename(partPath, localPath)\n onProgress?.({\n spec,\n downloaded,\n total,\n phase: \"done\",\n })\n } finally {\n // Successful rename already removed this path. Process termination bypasses\n // finally; the next ensure call reclaims it only after proving the owner dead.\n try { await unlink(partPath) } catch { /* Preserve the original outcome. */ }\n }\n}\n\nasync function sha256OfFile(p: string): Promise<string> {\n const h = createHash(\"sha256\")\n const stream = createReadStream(p)\n await pipeline(stream, async function* (src) {\n for await (const chunk of src) {\n h.update(chunk)\n // yield 안 함 (소비만)\n }\n })\n return h.digest(\"hex\")\n}\n","/**\n * 폐쇄망(내부망) 배포용 아웃바운드 통신 킬스위치 + 파일 접근 루트 제한.\n *\n * kordoc 자체는 문서 파서라 상시 외부 통신이 없지만, 두 경로만 나간다:\n * 1. OCR/수식 모델 최초 1회 다운로드 (huggingface.co)\n * 2. `kordoc watch --webhook` 사용자가 명시한 URL\n *\n * `KORDOC_OFFLINE=1` 이면 위 경로를 **시도 전에** 차단한다. 보안성 검토에서\n * \"외부 통신 없음\"을 런타임으로 증명하기 위한 단일 관문 — 새 아웃바운드 경로를\n * 추가하면 반드시 `assertNetworkAllowed()` 를 먼저 통과시킬 것.\n *\n * `KORDOC_ROOT` 는 파일 접근을 특정 디렉토리 하위로 제한한다(미설정 시 제한 없음 —\n * 기존 동작 보존). 내부망 배포에서는 두 변수를 함께 고정하는 것을 권장.\n */\n\nimport { realpathSync } from \"fs\"\nimport { isAbsolute, relative, resolve, sep } from \"path\"\nimport { KordocError } from \"../utils.js\"\n\nconst TRUTHY = new Set([\"1\", \"true\", \"yes\", \"on\"])\n\nfunction envFlag(name: string): boolean {\n const v = process.env[name]\n return !!v && TRUTHY.has(v.trim().toLowerCase())\n}\n\n/** 폐쇄망 모드 여부 (`KORDOC_OFFLINE=1|true|yes|on`) */\nexport function isOfflineMode(): boolean {\n return envFlag(\"KORDOC_OFFLINE\")\n}\n\n/**\n * 아웃바운드 통신 관문. 폐쇄망 모드면 요청을 보내기 전에 예외로 끊는다.\n * @param what 차단 대상 설명 (사용자에게 노출됨 — 호스트/URL 은 넣지 말 것)\n * @param hint 대안 안내 (오프라인 사이드로드 방법 등)\n */\nexport function assertNetworkAllowed(what: string, hint?: string): void {\n if (!isOfflineMode()) return\n throw new KordocError(\n `폐쇄망 모드(KORDOC_OFFLINE)에서 차단됨: ${what}` + (hint ? ` — ${hint}` : \"\"),\n )\n}\n\n/** 파일 접근 루트 (`KORDOC_ROOT`). 미설정이면 null = 제한 없음 */\nexport function getAccessRoot(): string | null {\n const raw = process.env.KORDOC_ROOT\n if (!raw || !raw.trim()) return null\n const resolved = resolve(raw.trim())\n try {\n return realpathSync(resolved)\n } catch {\n // 루트가 실재하지 않으면 모든 접근이 막히는 게 안전한 기본값\n return resolved\n }\n}\n\n/** 경로가 루트 하위인지 (루트 자신 포함). 경계 문자열 매칭이 아닌 세그먼트 단위 비교 */\nexport function isWithinRoot(realPath: string, root: string): boolean {\n if (realPath === root) return true\n const rel = relative(root, realPath)\n return rel !== \"\" && !rel.startsWith(\"..\") && !isAbsolute(rel) && !rel.startsWith(`..${sep}`)\n}\n\n/**\n * `KORDOC_ROOT` 가 설정된 경우 경로가 루트 하위인지 검증한다.\n * 인자는 이미 realpath 로 해석된 절대경로여야 한다 (심볼릭 링크 탈출 방지).\n */\nexport function assertWithinRoot(realPath: string): void {\n const root = getAccessRoot()\n if (!root) return\n if (!isWithinRoot(realPath, root)) {\n throw new KordocError(`허용된 작업 디렉토리(KORDOC_ROOT) 밖의 경로입니다: ${realPath}`)\n }\n}\n","/** Process-owned temporary model downloads. Never infer abandonment from age alone. */\nimport { createHash, randomUUID } from \"node:crypto\"\nimport { readFileSync, readlinkSync } from \"node:fs\"\nimport { readdir, unlink } from \"node:fs/promises\"\nimport { hostname } from \"node:os\"\nimport { basename, dirname, join } from \"node:path\"\n\nlet scope: string | undefined\nfunction ownerScope(): string {\n if (scope) return scope\n let namespace = \"\"\n if (process.platform === \"linux\") {\n try {\n // A cache may be shared by containers whose PID spaces differ. A missing\n // PID in this namespace says nothing about a download in another one.\n // Boot identity also separates machines with matching hostnames/ns inodes.\n const boot = readFileSync(\"/proc/sys/kernel/random/boot_id\", \"utf8\").trim()\n if (!boot) throw new Error(\"Kernel boot identity unavailable\")\n namespace = `${boot}:${readlinkSync(\"/proc/self/ns/pid\")}`\n } catch {\n // Fail closed if namespace identity is unavailable: only this process can\n // recognize its own paths; it will not scavenge another process's files.\n namespace = randomUUID()\n }\n }\n scope = createHash(\"sha256\").update(`${process.platform}\\0${hostname()}\\0${namespace}`).digest(\"hex\").slice(0, 32)\n return scope\n}\n\nexport function modelDownloadPartialPath(localPath: string): string {\n return `${localPath}.kordoc-${ownerScope()}-${process.pid}-${randomUUID()}.part`\n}\n\n/** Best effort: cache maintenance must not prevent use of a valid model. */\nexport async function cleanupModelDownloadPartials(localPath: string): Promise<void> {\n const dir = dirname(localPath)\n const prefix = `${basename(localPath)}.kordoc-${ownerScope()}-`\n let entries\n try { entries = await readdir(dir, { withFileTypes: true }) } catch { return }\n for (const entry of entries) {\n // Do not follow symlinks, touch other models, or guess ownership for old\n // UUID-only partials/foreign hosts/namespaces. Their owner could still be live.\n if (!entry.isFile() || !entry.name.startsWith(prefix)) continue\n const match = /^([1-9]\\d*)-([0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12})\\.part$/.exec(entry.name.slice(prefix.length))\n if (!match) continue\n const pid = Number(match[1])\n if (!Number.isSafeInteger(pid) || pid > 0x7fffffff) continue\n try {\n process.kill(pid, 0)\n continue // Includes a reused PID: retaining an orphan beats deleting live data.\n } catch (err) {\n if ((err as NodeJS.ErrnoException).code !== \"ESRCH\") continue // EPERM/unknown = potentially live.\n }\n try { await unlink(join(dir, entry.name)) } catch { /* Another cleaner may have won. */ }\n }\n}\n"]}
|
|
1
|
+
{"version":3,"sources":["/Users/mong-e/workspace/kordoc/dist/chunk-6KQWC2KN.cjs","../src/pdf/formula/models.ts","../src/shared/offline.ts","../src/pdf/formula/model-partials.ts"],"names":[],"mappings":"AAAA;AACE;AACF,wDAA6B;AAC7B;AACA;ACMA,gCAA2B;AAC3B,wBAAiC;AACjC,uCAA4C;AAC5C;AACA,wBAAwB;AACxB,4BAA8B;AAC9B,4CAAyB;AACzB,gCAAyB;ADJzB;AACA;AEKA,IAAM,OAAA,kBAAS,IAAI,GAAA,CAAI,CAAC,GAAA,EAAK,MAAA,EAAQ,KAAA,EAAO,IAAI,CAAC,CAAA;AAEjD,SAAS,OAAA,CAAQ,IAAA,EAAuB;AACtC,EAAA,MAAM,EAAA,EAAI,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA;AAC1B,EAAA,OAAO,CAAC,CAAC,EAAA,GAAK,MAAA,CAAO,GAAA,CAAI,CAAA,CAAE,IAAA,CAAK,CAAA,CAAE,WAAA,CAAY,CAAC,CAAA;AACjD;AAGO,SAAS,aAAA,CAAA,EAAyB;AACvC,EAAA,OAAO,OAAA,CAAQ,gBAAgB,CAAA;AACjC;AAOO,SAAS,oBAAA,CAAqB,IAAA,EAAc,IAAA,EAAqB;AACtE,EAAA,GAAA,CAAI,CAAC,aAAA,CAAc,CAAA,EAAG,MAAA;AACtB,EAAA,MAAM,IAAI,kCAAA;AAAA,IACR,CAAA,gFAAA,EAAiC,IAAI,CAAA,EAAA;AACvC,EAAA;AACF;AFZ4F;AACA;AG7BrD;AACI;AACX;AACP;AACe;AAEpC;AAC0B;AACV,EAAA;AACF,EAAA;AACkB,EAAA;AAC5B,IAAA;AAIwE,MAAA;AACb,MAAA;AACL,MAAA;AAClD,IAAA;AAGiB,MAAA;AACzB,IAAA;AACF,EAAA;AACwF,EAAA;AACjF,EAAA;AACT;AAEoE;AACO,EAAA;AAC3E;AAGqF;AACtD,EAAA;AAC+B,EAAA;AACxD,EAAA;AACA,EAAA;AAAsD,IAAA;AAAU,EAAA;AAAE,IAAA;AAAO,EAAA;AAChD,EAAA;AAG4B,IAAA;AACzC,IAAA;AACF,IAAA;AACe,IAAA;AACyB,IAAA;AAChD,IAAA;AACiB,MAAA;AACnB,MAAA;AACY,IAAA;AACyC,MAAA;AACvD,IAAA;AACI,IAAA;AAAoC,MAAA;AAAU,IAAA;AAAsC,IAAA;AAC1F,EAAA;AACF;AH2B4F;AACA;ACnDxD;AAC5B,EAAA;AACI,EAAA;AACL,EAAA;AACG,EAAA;AACA,EAAA;AACV;AAE4C;AACpC,EAAA;AACI,EAAA;AACL,EAAA;AACG,EAAA;AACA,EAAA;AACV;AAE4C;AACpC,EAAA;AACI,EAAA;AACL,EAAA;AACG,EAAA;AACA,EAAA;AACV;AAEwC;AAChC,EAAA;AACI,EAAA;AACL,EAAA;AACG,EAAA;AACA,EAAA;AACV;AAE4D;AAC1D,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACF;AAOqD;AACtB,EAAA;AACI,EAAA;AACH,IAAA;AAC9B,EAAA;AAC2D,EAAA;AAC7D;AAE8C;AACd,EAAA;AAChC;AAa6G;AAC5E,EAAA;AACL,EAAA;AACiB,IAAA;AAC5B,IAAA;AACT,IAAA;AAC4B,MAAA;AACE,MAAA;AAC1B,IAAA;AACG,MAAA;AACX,IAAA;AACa,IAAA;AACoD,MAAA;AAC/D,MAAA;AACF,IAAA;AACI,IAAA;AACyC,MAAA;AACf,MAAA;AACmC,QAAA;AACxD,MAAA;AACO,QAAA;AACV,UAAA;AACA,UAAA;AACQ,UAAA;AACE,UAAA;AAC4D,UAAA;AACvE,QAAA;AACH,MAAA;AACU,IAAA;AACE,MAAA;AACV,QAAA;AACA,QAAA;AACQ,QAAA;AACE,QAAA;AACgD,QAAA;AAC3D,MAAA;AACH,IAAA;AACF,EAAA;AACO,EAAA;AACT;AAGsE;AACH,EAAA;AACnE;AAoBgI;AAC1F,EAAA;AAEV,EAAA;AACiB,IAAA;AACG,IAAA;AAEO,IAAA;AACpC,sBAAA;AACX,QAAA;AACY,QAAA;AACL,QAAA;AACA,QAAA;AACE,QAAA;AACV,MAAA;AACD,MAAA;AACF,IAAA;AAIgD,IAAA;AAClD,EAAA;AACF;AAGuF;AACV,EAAA;AAC7E;AAGsG;AACpE,EAAA;AACI,EAAA;AACK,EAAA;AACG,EAAA;AACO,EAAA;AACe,oBAAA;AAChE,IAAA;AACF,EAAA;AACgD,EAAA;AAClD;AAE4F;AACtF,EAAA;AAC4B,IAAA;AACU,IAAA;AAClC,EAAA;AACC,IAAA;AACT,EAAA;AACI,EAAA;AACyC,IAAA;AACzB,IAAA;AACZ,EAAA;AACC,IAAA;AACT,EAAA;AACF;AAMiB;AAEf,EAAA;AACc,IAAA;AACQ,qBAAA;AACtB,EAAA;AAKmD,EAAA;AACA,EAAA;AAE/C,EAAA;AACiC,IAAA;AACxB,MAAA;AAAA;AAEO,QAAA;AAChB,MAAA;AACD,IAAA;AAC2B,IAAA;AAChB,MAAA;AAC0C,QAAA;AACpD,MAAA;AACF,IAAA;AAEmD,IAAA;AACQ,IAAA;AAC1C,IAAA;AAGsD,IAAA;AAClC,IAAA;AACjC,IAAA;AACyF,MAAA;AACzC,MAAA;AAC5B,QAAA;AACgC,QAAA;AACvC,wBAAA;AACX,UAAA;AACA,UAAA;AACA,UAAA;AACO,UAAA;AACR,QAAA;AACF,MAAA;AACwB,MAAA;AACf,IAAA;AACqD,MAAA;AACjE,IAAA;AAEa,oBAAA;AACX,MAAA;AACA,MAAA;AACA,MAAA;AACO,MAAA;AACR,IAAA;AAGG,IAAA;AACA,IAAA;AACkC,MAAA;AAC1B,IAAA;AACuD,MAAA;AACnE,IAAA;AAE4B,IAAA;AAChB,MAAA;AAC4D,QAAA;AACtE,MAAA;AACF,IAAA;AAEgC,IAAA;AACnB,oBAAA;AACX,MAAA;AACA,MAAA;AACA,MAAA;AACO,MAAA;AACR,IAAA;AACD,EAAA;AAGI,IAAA;AAAuB,MAAA;AAAU,IAAA;AAAuC,IAAA;AAC9E,EAAA;AACF;AAEwD;AACzB,EAAA;AACI,EAAA;AACY,EAAA;AACZ,IAAA;AACf,MAAA;AAEhB,IAAA;AACD,EAAA;AACoB,EAAA;AACvB;ADrB4F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"/Users/mong-e/workspace/kordoc/dist/chunk-6KQWC2KN.cjs","sourcesContent":[null,"/**\n * 수식 OCR 모델 자동 다운로드 + SHA-256 검증\n *\n * 캐시 위치: `~/.cache/kordoc/models/pix2text/`\n * 총 ~155MB (MFD 44MB + MFR encoder 87MB + MFR decoder 30MB + tokenizer 40KB)\n *\n * HF URL + SHA 는 Docufinder archive/rust-formula-ocr-wip 에서 검증 완료됨.\n * 모델 버전 갱신 시 URL + SHA 를 함께 갱신해야 한다.\n */\n\nimport { createHash } from \"crypto\"\nimport { createReadStream } from \"fs\"\nimport { mkdir, stat, unlink, rename } from \"fs/promises\"\nimport { createWriteStream } from \"fs\"\nimport { homedir } from \"os\"\nimport { join, dirname } from \"path\"\nimport { pipeline } from \"stream/promises\"\nimport { Readable } from \"stream\"\nimport { assertNetworkAllowed } from \"../../shared/offline.js\"\nimport { cleanupModelDownloadPartials, modelDownloadPartialPath } from \"./model-partials.js\"\n\nexport interface ModelSpec {\n name: string\n filename: string\n url: string\n sha256: string\n sizeMb: number\n /** 폐쇄망 차단 안내 — 없으면 models --export/--import 안내 */\n offlineHint?: string\n}\n\n/** 모델 스펙 (SHA-256 은 실제 다운로드로 검증됨 — 변경 금지) */\nexport const MFD_MODEL: ModelSpec = {\n name: \"Pix2Text MFD\",\n filename: \"mfd.onnx\",\n url: \"https://huggingface.co/breezedeus/pix2text-mfd/resolve/main/mfd-v20240618.onnx\",\n sha256: \"51a8854743b17ae654729af8db82a630c1ccfa06debf4856c8b28055f87d02c1\",\n sizeMb: 42,\n}\n\nexport const MFR_ENCODER_MODEL: ModelSpec = {\n name: \"Pix2Text MFR encoder\",\n filename: \"encoder_model.onnx\",\n url: \"https://huggingface.co/breezedeus/pix2text-mfr/resolve/main/encoder_model.onnx\",\n sha256: \"bd8d5c322792e9ec45793af5569e9748f82a3d728a9e00213dbfc56c1486f37d\",\n sizeMb: 87,\n}\n\nexport const MFR_DECODER_MODEL: ModelSpec = {\n name: \"Pix2Text MFR decoder\",\n filename: \"decoder_model.onnx\",\n url: \"https://huggingface.co/breezedeus/pix2text-mfr/resolve/main/decoder_model.onnx\",\n sha256: \"fd0f92d7a012f3dae41e1ac79421aea0ea888b5a66cb3f9a004e424f82f3daed\",\n sizeMb: 30,\n}\n\nexport const MFR_TOKENIZER: ModelSpec = {\n name: \"Pix2Text MFR tokenizer\",\n filename: \"tokenizer.json\",\n url: \"https://huggingface.co/breezedeus/pix2text-mfr/resolve/main/tokenizer.json\",\n sha256: \"3e2ab757277d22639bec28c9d7972e352d3d1dba223051fa674002dc5ab64df3\",\n sizeMb: 1,\n}\n\nexport const ALL_FORMULA_MODELS: ReadonlyArray<ModelSpec> = [\n MFD_MODEL,\n MFR_ENCODER_MODEL,\n MFR_DECODER_MODEL,\n MFR_TOKENIZER,\n]\n\n/**\n * 모델 캐시 하위 디렉토리 경로. 환경 변수 `KORDOC_MODEL_CACHE` 가 설정되면\n * 해당 경로를 우선 사용, 없으면 `~/.cache/kordoc/models/<subdir>/`.\n * (수식 OCR 외 텍스트 OCR 등 다른 모델군도 공용 — subdir 로 격리)\n */\nexport function getModelsDir(subdir: string): string {\n const override = process.env.KORDOC_MODEL_CACHE\n if (override && override.trim()) {\n return join(override, subdir)\n }\n return join(homedir(), \".cache\", \"kordoc\", \"models\", subdir)\n}\n\nexport function getFormulaModelsDir(): string {\n return getModelsDir(\"pix2text\")\n}\n\nexport interface ModelStatus {\n spec: ModelSpec\n localPath: string\n exists: boolean\n /** SHA 검증까지 끝났는가 (exists && valid) */\n verified: boolean\n /** 검증 실패 시 이유 */\n invalidReason?: string\n}\n\n/** 지정 모델군의 존재/유효성 상태 반환 (다운로드 없이 확인만) */\nexport async function getModelStatusIn(dir: string, specs: ReadonlyArray<ModelSpec>): Promise<ModelStatus[]> {\n const result: ModelStatus[] = []\n for (const spec of specs) {\n const localPath = join(dir, spec.filename)\n let exists = false\n try {\n const s = await stat(localPath)\n exists = s.isFile() && s.size > 0\n } catch {\n exists = false\n }\n if (!exists) {\n result.push({ spec, localPath, exists: false, verified: false })\n continue\n }\n try {\n const actual = await sha256OfFile(localPath)\n if (actual === spec.sha256) {\n result.push({ spec, localPath, exists: true, verified: true })\n } else {\n result.push({\n spec,\n localPath,\n exists: true,\n verified: false,\n invalidReason: `SHA256 mismatch: expected ${spec.sha256}, got ${actual}`,\n })\n }\n } catch (e) {\n result.push({\n spec,\n localPath,\n exists: true,\n verified: false,\n invalidReason: `SHA compute failed: ${(e as Error).message}`,\n })\n }\n }\n return result\n}\n\n/** 모든 수식 모델의 존재/유효성 상태 반환 (다운로드 없이 확인만) */\nexport async function getFormulaModelStatus(): Promise<ModelStatus[]> {\n return getModelStatusIn(getFormulaModelsDir(), ALL_FORMULA_MODELS)\n}\n\nexport interface DownloadProgress {\n spec: ModelSpec\n /** 현재까지 다운로드한 바이트 */\n downloaded: number\n /** 전체 바이트 (알 수 있으면) */\n total: number | null\n /** \"download\" | \"verify\" | \"done\" | \"skip\" */\n phase: \"download\" | \"verify\" | \"done\" | \"skip\" | \"error\"\n message?: string\n}\n\nexport type ProgressHandler = (p: DownloadProgress) => void\n\n/**\n * 지정 모델군을 다운로드/검증한다.\n * - 이미 있고 SHA 일치 → skip\n * - 없음 → 다운로드 후 SHA 검증. 실패 시 파일 삭제.\n */\nexport async function ensureModelsIn(dir: string, specs: ReadonlyArray<ModelSpec>, onProgress?: ProgressHandler): Promise<void> {\n await mkdir(dir, { recursive: true })\n\n for (const spec of specs) {\n const localPath = join(dir, spec.filename)\n await cleanupModelDownloadPartials(localPath)\n\n if (await isExistingValid(localPath, spec.sha256)) {\n onProgress?.({\n spec,\n downloaded: 0,\n total: null,\n phase: \"skip\",\n message: \"이미 존재 + SHA 일치\",\n })\n continue\n }\n\n // Keep the destination until atomic replacement; another process may have\n // finished a valid download since our initial check.\n await downloadToFile(spec, localPath, onProgress)\n }\n}\n\n/** 필요한 모든 수식 모델을 다운로드/검증한다. */\nexport async function ensureFormulaModels(onProgress?: ProgressHandler): Promise<void> {\n return ensureModelsIn(getFormulaModelsDir(), ALL_FORMULA_MODELS, onProgress)\n}\n\n/** 단일 모델만 확인/다운로드 (진단 UI 에서 개별 상태 새로고침용) */\nexport async function ensureSingleModel(spec: ModelSpec, onProgress?: ProgressHandler): Promise<void> {\n const dir = getFormulaModelsDir()\n await mkdir(dir, { recursive: true })\n const localPath = join(dir, spec.filename)\n await cleanupModelDownloadPartials(localPath)\n if (await isExistingValid(localPath, spec.sha256)) {\n onProgress?.({ spec, downloaded: 0, total: null, phase: \"skip\" })\n return\n }\n await downloadToFile(spec, localPath, onProgress)\n}\n\nasync function isExistingValid(localPath: string, sha256Expected: string): Promise<boolean> {\n try {\n const s = await stat(localPath)\n if (!s.isFile() || s.size === 0) return false\n } catch {\n return false\n }\n try {\n const actual = await sha256OfFile(localPath)\n return actual === sha256Expected\n } catch {\n return false\n }\n}\n\nasync function downloadToFile(\n spec: ModelSpec,\n localPath: string,\n onProgress?: ProgressHandler,\n): Promise<void> {\n // 폐쇄망 모드에서는 요청 자체를 보내지 않는다 (사이드로드 안내로 대체)\n assertNetworkAllowed(\n `${spec.name} 모델 다운로드`,\n spec.offlineHint ?? \"온라인 PC에서 `kordoc models --export <디렉토리>` 로 내보낸 뒤 이 PC에서 `kordoc models --import <디렉토리>` 하거나, KORDOC_MODEL_CACHE 로 모델 캐시 경로를 지정하세요\",\n )\n\n // 먼저 .part 로 받고 검증 후 rename — 중단된 다운로드가 \"정상 파일\"로 오인되는 걸 방지\n // Batch workers may download the same missing model concurrently. Never share\n // a partial file: only a fully verified download is atomically published.\n const partPath = modelDownloadPartialPath(localPath)\n await mkdir(dirname(localPath), { recursive: true })\n\n try {\n const resp = await fetch(spec.url, {\n headers: {\n // HF CDN 은 UA 없으면 가끔 403 을 뱉는다\n \"User-Agent\": \"kordoc-formula-ocr/1.0 (+https://github.com/chrisryugj/kordoc)\",\n },\n })\n if (!resp.ok || !resp.body) {\n throw new Error(\n `${spec.name} 다운로드 실패: HTTP ${resp.status} ${resp.statusText} (${spec.url})`,\n )\n }\n\n const lenHeader = resp.headers.get(\"content-length\")\n const total = lenHeader ? Number.parseInt(lenHeader, 10) : null\n let downloaded = 0\n\n // 크기 상한 — SHA-256 은 다 받은 뒤 검증하므로, 받는 동안 응답이 끝없이 이어지면 디스크가 찬다\n const maxBytes = Math.max(spec.sizeMb * 1.5, spec.sizeMb + 8) * 1024 * 1024\n const ws = createWriteStream(partPath)\n try {\n const reader = Readable.fromWeb(resp.body as unknown as import(\"stream/web\").ReadableStream)\n reader.on(\"data\", (chunk: Buffer | Uint8Array) => {\n downloaded += chunk.length\n if (downloaded > maxBytes) reader.destroy(new Error(`응답이 예상 크기(${spec.sizeMb}MB)를 크게 넘습니다`))\n onProgress?.({\n spec,\n downloaded,\n total,\n phase: \"download\",\n })\n })\n await pipeline(reader, ws)\n } catch (e) {\n throw new Error(`${spec.name} 스트리밍 실패: ${(e as Error).message}`)\n }\n\n onProgress?.({\n spec,\n downloaded,\n total,\n phase: \"verify\",\n })\n\n // SHA 검증\n let actual: string\n try {\n actual = await sha256OfFile(partPath)\n } catch (e) {\n throw new Error(`${spec.name} SHA 계산 실패: ${(e as Error).message}`)\n }\n\n if (actual !== spec.sha256) {\n throw new Error(\n `${spec.name} SHA256 mismatch: expected ${spec.sha256}, got ${actual} — 모델 URL 이 오염되었거나 전송 중 손상되었습니다.`,\n )\n }\n\n await rename(partPath, localPath)\n onProgress?.({\n spec,\n downloaded,\n total,\n phase: \"done\",\n })\n } finally {\n // Successful rename already removed this path. Process termination bypasses\n // finally; the next ensure call reclaims it only after proving the owner dead.\n try { await unlink(partPath) } catch { /* Preserve the original outcome. */ }\n }\n}\n\nasync function sha256OfFile(p: string): Promise<string> {\n const h = createHash(\"sha256\")\n const stream = createReadStream(p)\n await pipeline(stream, async function* (src) {\n for await (const chunk of src) {\n h.update(chunk)\n // yield 안 함 (소비만)\n }\n })\n return h.digest(\"hex\")\n}\n","/**\n * 폐쇄망(내부망) 배포용 아웃바운드 통신 킬스위치 + 파일 접근 루트 제한.\n *\n * kordoc 자체는 문서 파서라 상시 외부 통신이 없지만, 두 경로만 나간다:\n * 1. OCR/수식 모델 최초 1회 다운로드 (huggingface.co)\n * 2. `kordoc watch --webhook` 사용자가 명시한 URL\n *\n * `KORDOC_OFFLINE=1` 이면 위 경로를 **시도 전에** 차단한다. 보안성 검토에서\n * \"외부 통신 없음\"을 런타임으로 증명하기 위한 단일 관문 — 새 아웃바운드 경로를\n * 추가하면 반드시 `assertNetworkAllowed()` 를 먼저 통과시킬 것.\n *\n * `KORDOC_ROOT` 는 파일 접근을 특정 디렉토리 하위로 제한한다(미설정 시 제한 없음 —\n * 기존 동작 보존). 내부망 배포에서는 두 변수를 함께 고정하는 것을 권장.\n */\n\nimport { realpathSync } from \"fs\"\nimport { isAbsolute, relative, resolve, sep } from \"path\"\nimport { KordocError } from \"../utils.js\"\n\nconst TRUTHY = new Set([\"1\", \"true\", \"yes\", \"on\"])\n\nfunction envFlag(name: string): boolean {\n const v = process.env[name]\n return !!v && TRUTHY.has(v.trim().toLowerCase())\n}\n\n/** 폐쇄망 모드 여부 (`KORDOC_OFFLINE=1|true|yes|on`) */\nexport function isOfflineMode(): boolean {\n return envFlag(\"KORDOC_OFFLINE\")\n}\n\n/**\n * 아웃바운드 통신 관문. 폐쇄망 모드면 요청을 보내기 전에 예외로 끊는다.\n * @param what 차단 대상 설명 (사용자에게 노출됨 — 호스트/URL 은 넣지 말 것)\n * @param hint 대안 안내 (오프라인 사이드로드 방법 등)\n */\nexport function assertNetworkAllowed(what: string, hint?: string): void {\n if (!isOfflineMode()) return\n throw new KordocError(\n `폐쇄망 모드(KORDOC_OFFLINE)에서 차단됨: ${what}` + (hint ? ` — ${hint}` : \"\"),\n )\n}\n\n/** 파일 접근 루트 (`KORDOC_ROOT`). 미설정이면 null = 제한 없음 */\nexport function getAccessRoot(): string | null {\n const raw = process.env.KORDOC_ROOT\n if (!raw || !raw.trim()) return null\n const resolved = resolve(raw.trim())\n try {\n return realpathSync(resolved)\n } catch {\n // 루트가 실재하지 않으면 모든 접근이 막히는 게 안전한 기본값\n return resolved\n }\n}\n\n/** 경로가 루트 하위인지 (루트 자신 포함). 경계 문자열 매칭이 아닌 세그먼트 단위 비교 */\nexport function isWithinRoot(realPath: string, root: string): boolean {\n if (realPath === root) return true\n const rel = relative(root, realPath)\n return rel !== \"\" && !rel.startsWith(\"..\") && !isAbsolute(rel) && !rel.startsWith(`..${sep}`)\n}\n\n/**\n * `KORDOC_ROOT` 가 설정된 경우 경로가 루트 하위인지 검증한다.\n * 인자는 이미 realpath 로 해석된 절대경로여야 한다 (심볼릭 링크 탈출 방지).\n */\nexport function assertWithinRoot(realPath: string): void {\n const root = getAccessRoot()\n if (!root) return\n if (!isWithinRoot(realPath, root)) {\n throw new KordocError(`허용된 작업 디렉토리(KORDOC_ROOT) 밖의 경로입니다: ${realPath}`)\n }\n}\n","/** Process-owned temporary model downloads. Never infer abandonment from age alone. */\nimport { createHash, randomUUID } from \"node:crypto\"\nimport { readFileSync, readlinkSync } from \"node:fs\"\nimport { readdir, unlink } from \"node:fs/promises\"\nimport { hostname } from \"node:os\"\nimport { basename, dirname, join } from \"node:path\"\n\nlet scope: string | undefined\nfunction ownerScope(): string {\n if (scope) return scope\n let namespace = \"\"\n if (process.platform === \"linux\") {\n try {\n // A cache may be shared by containers whose PID spaces differ. A missing\n // PID in this namespace says nothing about a download in another one.\n // Boot identity also separates machines with matching hostnames/ns inodes.\n const boot = readFileSync(\"/proc/sys/kernel/random/boot_id\", \"utf8\").trim()\n if (!boot) throw new Error(\"Kernel boot identity unavailable\")\n namespace = `${boot}:${readlinkSync(\"/proc/self/ns/pid\")}`\n } catch {\n // Fail closed if namespace identity is unavailable: only this process can\n // recognize its own paths; it will not scavenge another process's files.\n namespace = randomUUID()\n }\n }\n scope = createHash(\"sha256\").update(`${process.platform}\\0${hostname()}\\0${namespace}`).digest(\"hex\").slice(0, 32)\n return scope\n}\n\nexport function modelDownloadPartialPath(localPath: string): string {\n return `${localPath}.kordoc-${ownerScope()}-${process.pid}-${randomUUID()}.part`\n}\n\n/** Best effort: cache maintenance must not prevent use of a valid model. */\nexport async function cleanupModelDownloadPartials(localPath: string): Promise<void> {\n const dir = dirname(localPath)\n const prefix = `${basename(localPath)}.kordoc-${ownerScope()}-`\n let entries\n try { entries = await readdir(dir, { withFileTypes: true }) } catch { return }\n for (const entry of entries) {\n // Do not follow symlinks, touch other models, or guess ownership for old\n // UUID-only partials/foreign hosts/namespaces. Their owner could still be live.\n if (!entry.isFile() || !entry.name.startsWith(prefix)) continue\n const match = /^([1-9]\\d*)-([0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12})\\.part$/.exec(entry.name.slice(prefix.length))\n if (!match) continue\n const pid = Number(match[1])\n if (!Number.isSafeInteger(pid) || pid > 0x7fffffff) continue\n try {\n process.kill(pid, 0)\n continue // Includes a reused PID: retaining an orphan beats deleting live data.\n } catch (err) {\n if ((err as NodeJS.ErrnoException).code !== \"ESRCH\") continue // EPERM/unknown = potentially live.\n }\n try { await unlink(join(dir, entry.name)) } catch { /* Another cleaner may have won. */ }\n }\n}\n"]}
|
|
@@ -30,7 +30,7 @@ import {
|
|
|
30
30
|
splitRowBands,
|
|
31
31
|
starRun,
|
|
32
32
|
tallInkCount
|
|
33
|
-
} from "./chunk-
|
|
33
|
+
} from "./chunk-UGO3UFXX.js";
|
|
34
34
|
import {
|
|
35
35
|
validateOcrOptions
|
|
36
36
|
} from "./chunk-BYMPPVT3.js";
|
|
@@ -41,11 +41,11 @@ import {
|
|
|
41
41
|
ocrSourcePath,
|
|
42
42
|
parseCharacterDict,
|
|
43
43
|
resolveOcrModels
|
|
44
|
-
} from "./chunk-
|
|
44
|
+
} from "./chunk-K37LMDT5.js";
|
|
45
45
|
import {
|
|
46
46
|
KordocError,
|
|
47
47
|
OPTIONAL_DEP_INSTALL_HINT
|
|
48
|
-
} from "./chunk-
|
|
48
|
+
} from "./chunk-UV2ZS65C.js";
|
|
49
49
|
|
|
50
50
|
// src/ocr/ruling-lines.ts
|
|
51
51
|
var INK_LUMA_MAX = 205;
|
|
@@ -395,6 +395,7 @@ function restoreGlyphs(rgba, pageW, box, text, steps, stepPx, note = {}) {
|
|
|
395
395
|
const gray = grayCrop(rgba, pageW, box);
|
|
396
396
|
const c = { chars, cx: (i) => (steps[i] + 0.5) * stepPx, gray, w: box.w, h: box.h, ink: inkStats(gray) };
|
|
397
397
|
if (/[[\]]/.test(text)) brackets(c);
|
|
398
|
+
if (text.includes("'")) cornerQuotes(c);
|
|
398
399
|
if (/['"]/.test(text)) quotes(c);
|
|
399
400
|
if (/(^|\D)[1-9](\D|$)/.test(text)) circled(c);
|
|
400
401
|
if (text.includes("*")) stars(c);
|
|
@@ -448,6 +449,19 @@ function cornerCommas({ chars, cx, gray, w, h, ink }) {
|
|
|
448
449
|
}
|
|
449
450
|
}
|
|
450
451
|
}
|
|
452
|
+
function cornerQuotes({ chars, cx, gray, w, h, ink }) {
|
|
453
|
+
for (let i = 0; i < chars.length; i++) {
|
|
454
|
+
if (chars[i] !== "'" || !/^[가-힣]/.test(chars[i + 1] ?? "")) continue;
|
|
455
|
+
const f = bracketFeatures(gray, w, h, ink, cx(i));
|
|
456
|
+
if (!f || f.ch < f.charH * 0.45 || bracketShape(f, false) !== "\u300C") continue;
|
|
457
|
+
const rest = chars.slice(i + 1), end = rest.findIndex((c) => c === "'" || c === "\u300D" || c === ",");
|
|
458
|
+
const pair = end >= 0 && rest[end] !== "'" && (rest[end] === "\u300D" || (() => {
|
|
459
|
+
const g = bracketFeatures(gray, w, h, ink, cx(i + 1 + end));
|
|
460
|
+
return !!g && bracketShape(g, true) === "\u300D";
|
|
461
|
+
})());
|
|
462
|
+
if (pair) chars[i] = "\u300C";
|
|
463
|
+
}
|
|
464
|
+
}
|
|
451
465
|
function brackets({ chars, cx, gray, w, h, ink }) {
|
|
452
466
|
for (let i = 0; i < chars.length; i++) {
|
|
453
467
|
if (chars[i] !== "[" && chars[i] !== "]") continue;
|
|
@@ -533,6 +547,7 @@ function gaps({ chars, cx, gray, w, h, ink }) {
|
|
|
533
547
|
}
|
|
534
548
|
if (cover.length) {
|
|
535
549
|
if (g.mark.startsWith("\u25A1") && cover.length === 1 && /^[0Oo\u25cb]$/.test(chars[cover[0]])) chars[cover[0]] = "\u25A1";
|
|
550
|
+
if (g.mark === "\u3002" && cover.length === 1 && /^[\u00b7\u2022\u318d]$/.test(chars[cover[0]])) chars[cover[0]] = "\u3002";
|
|
536
551
|
continue;
|
|
537
552
|
}
|
|
538
553
|
if (g.mark === "\u25A1\0") continue;
|
|
@@ -549,6 +564,14 @@ function gaps({ chars, cx, gray, w, h, ink }) {
|
|
|
549
564
|
if (loose.some((o) => o !== g && Math.abs((o.x0 + o.x1) / 2 - mid) <= pitch * 1.5)) continue;
|
|
550
565
|
if (/[\u2026.\u00b7]$/.test(prev) || /^[\u2026.\u00b7]/.test(next)) continue;
|
|
551
566
|
}
|
|
567
|
+
if (g.mark === "\u300C") {
|
|
568
|
+
let sp = chars.findIndex((c, i) => c === " " && near(i));
|
|
569
|
+
if (sp >= 0) while (chars[sp + 1] === " ") sp++;
|
|
570
|
+
if (sp >= 0) {
|
|
571
|
+
chars[sp] = g.mark;
|
|
572
|
+
continue;
|
|
573
|
+
}
|
|
574
|
+
}
|
|
552
575
|
if (g.mark === "\xB7") {
|
|
553
576
|
if (/^\d/.test(next)) continue;
|
|
554
577
|
const sp = chars.findIndex((c, i) => c === " " && near(i));
|
|
@@ -562,10 +585,23 @@ function gaps({ chars, cx, gray, w, h, ink }) {
|
|
|
562
585
|
}
|
|
563
586
|
function ring({ chars, cx, gray, w, h, ink }) {
|
|
564
587
|
const k = chars.findIndex((c) => c.trim());
|
|
565
|
-
if (k < 0 || !/^[\u3147Oo0\
|
|
588
|
+
if (k < 0 || !/^[\u3147Oo0\u25cbCc]$/.test(chars[k])) return false;
|
|
566
589
|
const rest = chars.slice(k + 1).join("").trimStart();
|
|
590
|
+
const live = chars.map((c, i) => i).filter((i) => chars[i].trim());
|
|
591
|
+
if (live.length <= 3 && live.every((i) => /^[Oo]$/.test(chars[i]))) {
|
|
592
|
+
if (leadingBullet(gray, w, h, ink, cx(live[0]))?.mark === "\u25CE") return false;
|
|
593
|
+
if (!live.every((i) => ringBullet(gray, w, h, ink, cx(i)) === "\u25CB")) return false;
|
|
594
|
+
for (const i of live) chars[i] = "\u25CB";
|
|
595
|
+
return true;
|
|
596
|
+
}
|
|
597
|
+
if (/^[A-Z]{2,}/.test(rest) && /^[Oo0]$/.test(chars[k])) {
|
|
598
|
+
if (ringBullet(gray, w, h, ink, cx(k)) !== "\u25CB") return false;
|
|
599
|
+
chars[k] = chars[k + 1] === " " ? "\u25CB" : "\u25CB ";
|
|
600
|
+
return true;
|
|
601
|
+
}
|
|
567
602
|
if (!/^[(\[「【<]?\d*[가-힣]/.test(rest)) return false;
|
|
568
603
|
const r = ringBullet(gray, w, h, ink, cx(k));
|
|
604
|
+
if (/^[Cc]$/.test(chars[k]) && r !== "\u25CB") return false;
|
|
569
605
|
if (r) chars[k] = r;
|
|
570
606
|
return r !== null;
|
|
571
607
|
}
|
|
@@ -625,6 +661,7 @@ function restoreSymbols(text, ringDecided = false) {
|
|
|
625
661
|
s = s.replace(/[\u2206\u0394]/g, "\u25B3");
|
|
626
662
|
s = s.replace(/\(cid:\d*\)/g, "");
|
|
627
663
|
s = s.replace(/(^|[^\uac00-\ud7a3])(전|현)\(\s?\)(?=\S)/g, (_, a, b) => `${a}${b}(${b === "\uC804" ? "\u524D" : "\u73FE"})`);
|
|
664
|
+
if (/[가-힣]/.test(s)) s = s.replace(/(\d)l(?![A-Za-z])/g, "$1\u2113");
|
|
628
665
|
s = s.replace(/([((])\s?[A-Za-z@&]\s?(?=(?:0\d{1,2}-)?\d{3,4}-\d{4}\b)/g, "$1\u260E");
|
|
629
666
|
return smartQuotes(dateDots(dateCommas(joinDigitGroups(s))));
|
|
630
667
|
}
|
|
@@ -872,6 +909,247 @@ var MIN_INK_RATIO = 0.01;
|
|
|
872
909
|
var MAX_LOCAL_MODEL_BYTES = 1024 * 1024 * 1024;
|
|
873
910
|
var DET_MEAN = [0.485, 0.456, 0.406];
|
|
874
911
|
var DET_STD = [0.229, 0.224, 0.225];
|
|
912
|
+
function rowHeadDashes(rgba, width, items) {
|
|
913
|
+
const out = [];
|
|
914
|
+
const dark = (x, y) => {
|
|
915
|
+
const p = (y * width + x) * 4;
|
|
916
|
+
return rgba[p] * 77 + rgba[p + 1] * 150 + rgba[p + 2] * 29 >> 8 < 160;
|
|
917
|
+
};
|
|
918
|
+
const inBox = (x, y) => items.some((b) => x >= b.x && x < b.x + b.w && y >= b.y && y < b.y + b.h);
|
|
919
|
+
const done = /* @__PURE__ */ new Set();
|
|
920
|
+
for (const it of [...items]) {
|
|
921
|
+
if (done.has(it) || it.h < 12) continue;
|
|
922
|
+
const row = items.filter((o) => Math.min(o.y + o.h, it.y + it.h) - Math.max(o.y, it.y) >= Math.min(o.h, it.h) * 0.6);
|
|
923
|
+
for (const o of row) done.add(o);
|
|
924
|
+
if (row.reduce((k, o) => k + (o.text.match(/[가-힣]/g)?.length ?? 0), 0) < 2) continue;
|
|
925
|
+
const first = row.reduce((m, o) => o.x < m.x ? o : m);
|
|
926
|
+
if (!/^[가-힣]/.test(first.text)) continue;
|
|
927
|
+
if (row.filter((o) => /\d/.test(o.text)).length >= 2) continue;
|
|
928
|
+
const y0 = Math.min(...row.map((o) => o.y)), y1 = Math.max(...row.map((o) => o.y + o.h)), h = y1 - y0;
|
|
929
|
+
const x0 = Math.max(0, Math.round(first.x - 2.5 * h)), x1 = first.x - 2;
|
|
930
|
+
let minX = -1, maxX = -1, minY = Infinity, maxY = -1, groups = 0;
|
|
931
|
+
for (let x = x0; x < x1; x++) {
|
|
932
|
+
let on = false;
|
|
933
|
+
for (let y = y0; y < y1; y++) if (dark(x, y) && !inBox(x, y)) {
|
|
934
|
+
on = true;
|
|
935
|
+
if (y < minY) minY = y;
|
|
936
|
+
if (y > maxY) maxY = y;
|
|
937
|
+
}
|
|
938
|
+
if (!on) continue;
|
|
939
|
+
if (maxX < 0 || x - maxX > 2) {
|
|
940
|
+
groups++;
|
|
941
|
+
if (groups === 1) minX = x;
|
|
942
|
+
}
|
|
943
|
+
maxX = x;
|
|
944
|
+
}
|
|
945
|
+
const bw = maxX - minX + 1, bh = maxY - minY + 1, cy = ((minY + maxY) / 2 - y0) / h;
|
|
946
|
+
if (groups !== 1 || bh > h * 0.2 || bw < h * 0.3 || bw > h * 1.2 || cy < 0.3 || cy > 0.7) continue;
|
|
947
|
+
const faint = (x, y) => {
|
|
948
|
+
const p = (y * width + x) * 4;
|
|
949
|
+
return rgba[p] * 77 + rgba[p + 1] * 150 + rgba[p + 2] * 29 >> 8 < 230;
|
|
950
|
+
};
|
|
951
|
+
let touch = minX <= x0;
|
|
952
|
+
for (let y = minY; y <= maxY && !touch; y++) for (let d = 2; d <= 4 && !touch; d++) touch = minX - d >= 0 && faint(minX - d, y) || faint(maxX + d, y);
|
|
953
|
+
if (touch) continue;
|
|
954
|
+
out.push({ text: "-", x: minX, y: y0, w: bw, h, confidence: first.confidence });
|
|
955
|
+
}
|
|
956
|
+
return out;
|
|
957
|
+
}
|
|
958
|
+
function rowTailBoxes(rgba, width, items) {
|
|
959
|
+
const out = [];
|
|
960
|
+
const dark = (x, y) => {
|
|
961
|
+
const p = (y * width + x) * 4;
|
|
962
|
+
return rgba[p] * 77 + rgba[p + 1] * 150 + rgba[p + 2] * 29 >> 8 < 160;
|
|
963
|
+
};
|
|
964
|
+
const done = /* @__PURE__ */ new Set();
|
|
965
|
+
for (const it of items) {
|
|
966
|
+
if (done.has(it) || it.h < 12) continue;
|
|
967
|
+
const row = items.filter((o) => Math.min(o.y + o.h, it.y + it.h) - Math.max(o.y, it.y) >= Math.min(o.h, it.h) * 0.6);
|
|
968
|
+
for (const o of row) done.add(o);
|
|
969
|
+
if (row.reduce((k, o) => k + (o.text.match(/[가-힣]/g)?.length ?? 0), 0) < 2) continue;
|
|
970
|
+
const last = row.reduce((m, o) => o.x + o.w > m.x + m.w ? o : m);
|
|
971
|
+
if (/\d$/.test(last.text.trim())) continue;
|
|
972
|
+
const y0 = Math.min(...row.map((o) => o.y)), y1 = Math.max(...row.map((o) => o.y + o.h)), h = y1 - y0;
|
|
973
|
+
const x0 = last.x + last.w + 4, x1 = Math.floor(width * 0.95);
|
|
974
|
+
if (x1 - x0 < h) continue;
|
|
975
|
+
let groups = 0, minX = -1, maxX = -1, minY = Infinity, maxY = -1;
|
|
976
|
+
for (let x = x0; x < x1; x++) {
|
|
977
|
+
let on = false;
|
|
978
|
+
for (let y = y0; y < y1; y++) if (dark(x, y)) {
|
|
979
|
+
on = true;
|
|
980
|
+
if (y < minY) minY = y;
|
|
981
|
+
if (y > maxY) maxY = y;
|
|
982
|
+
}
|
|
983
|
+
if (!on) continue;
|
|
984
|
+
if (maxX < 0 || x - maxX > h) {
|
|
985
|
+
groups++;
|
|
986
|
+
if (groups === 1) minX = x;
|
|
987
|
+
}
|
|
988
|
+
maxX = x;
|
|
989
|
+
}
|
|
990
|
+
if (groups !== 1 || maxY - minY + 1 < h * 0.5 || maxX - minX + 1 > h * 4) continue;
|
|
991
|
+
const height = Math.floor(rgba.length / 4 / width);
|
|
992
|
+
let rule = false;
|
|
993
|
+
for (let x = minX; x <= maxX && !rule; x++) rule = minY > 1 && dark(x, minY - 2) || maxY + 2 < height && dark(x, maxY + 2);
|
|
994
|
+
if (rule) continue;
|
|
995
|
+
const pad = 4;
|
|
996
|
+
out.push({ x: Math.max(0, minX - pad), y: Math.max(0, minY - pad), w: maxX - minX + 1 + 2 * pad, h: maxY - minY + 1 + 2 * pad });
|
|
997
|
+
}
|
|
998
|
+
return out;
|
|
999
|
+
}
|
|
1000
|
+
function placeholderSquares(rgba, width, height, items) {
|
|
1001
|
+
const dark = new Uint8Array(width * height);
|
|
1002
|
+
for (let p = 0, i = 0; p < dark.length; p++, i += 4) dark[p] = rgba[i] * 77 + rgba[i + 1] * 150 + rgba[i + 2] * 29 >> 8 < 128 ? 1 : 0;
|
|
1003
|
+
const covered = (x, y) => items.some((b) => x >= b.x - 2 && x < b.x + b.w + 2 && y >= b.y - 2 && y < b.y + b.h + 2);
|
|
1004
|
+
const seen = new Uint8Array(width * height);
|
|
1005
|
+
const squares = [], bars = [];
|
|
1006
|
+
const stack = [];
|
|
1007
|
+
for (let start = 0; start < dark.length; start++) {
|
|
1008
|
+
if (!dark[start] || seen[start]) continue;
|
|
1009
|
+
const c = { x0: width, y0: height, x1: -1, y1: -1, n: 0, px: [] };
|
|
1010
|
+
stack.push(start);
|
|
1011
|
+
seen[start] = 1;
|
|
1012
|
+
while (stack.length) {
|
|
1013
|
+
const p = stack.pop(), x = p % width, y = (p - x) / width;
|
|
1014
|
+
c.n++;
|
|
1015
|
+
if (c.px.length < 4e3) c.px.push(p);
|
|
1016
|
+
if (x < c.x0) c.x0 = x;
|
|
1017
|
+
if (x > c.x1) c.x1 = x;
|
|
1018
|
+
if (y < c.y0) c.y0 = y;
|
|
1019
|
+
if (y > c.y1) c.y1 = y;
|
|
1020
|
+
for (const q of [p - 1, p + 1, p - width, p + width]) if (q >= 0 && q < dark.length && !seen[q] && dark[q] && Math.abs(q % width - x) <= 1) {
|
|
1021
|
+
seen[q] = 1;
|
|
1022
|
+
stack.push(q);
|
|
1023
|
+
}
|
|
1024
|
+
if (c.n > 4e3) break;
|
|
1025
|
+
}
|
|
1026
|
+
while (stack.length) {
|
|
1027
|
+
const p = stack.pop();
|
|
1028
|
+
seen[p] = 1;
|
|
1029
|
+
}
|
|
1030
|
+
const w = c.x1 - c.x0 + 1, h = c.y1 - c.y0 + 1;
|
|
1031
|
+
if (c.n > 4e3 || covered(c.x0 + c.x1 >> 1, c.y0 + c.y1 >> 1)) continue;
|
|
1032
|
+
if (h >= 2 && h <= 6 && w >= 4 && w <= 30 && c.n >= w * h * 0.7) {
|
|
1033
|
+
bars.push(c);
|
|
1034
|
+
continue;
|
|
1035
|
+
}
|
|
1036
|
+
if (w < 12 || h < 12 || w > 60 || h > 60 || w > h * 1.33 || h > w * 1.33) continue;
|
|
1037
|
+
const at = (x, y) => dark[y * width + x] === 1;
|
|
1038
|
+
const row = (y) => {
|
|
1039
|
+
let k = 0;
|
|
1040
|
+
for (let x = c.x0; x <= c.x1; x++) if (at(x, y)) k++;
|
|
1041
|
+
return k / w;
|
|
1042
|
+
};
|
|
1043
|
+
const col = (x) => {
|
|
1044
|
+
let k = 0;
|
|
1045
|
+
for (let y = c.y0; y <= c.y1; y++) if (at(x, y)) k++;
|
|
1046
|
+
return k / h;
|
|
1047
|
+
};
|
|
1048
|
+
const edge = (vals) => Math.max(...vals) >= 0.8;
|
|
1049
|
+
const top = edge([row(c.y0), row(c.y0 + 1)]), bottom = edge([row(c.y1), row(c.y1 - 1)]), left = edge([col(c.x0), col(c.x0 + 1)]), right = edge([col(c.x1), col(c.x1 - 1)]);
|
|
1050
|
+
let inner = 0;
|
|
1051
|
+
for (let y = c.y0 + Math.ceil(h * 0.25); y <= c.y1 - Math.ceil(h * 0.25); y++) for (let x = c.x0 + Math.ceil(w * 0.25); x <= c.x1 - Math.ceil(w * 0.25); x++) if (at(x, y)) inner++;
|
|
1052
|
+
if (top && bottom && left && right && inner === 0) squares.push(c);
|
|
1053
|
+
}
|
|
1054
|
+
squares.sort((a, b) => a.y0 - b.y0 || a.x0 - b.x0);
|
|
1055
|
+
const out = [];
|
|
1056
|
+
const used = /* @__PURE__ */ new Set();
|
|
1057
|
+
for (const s0 of squares) {
|
|
1058
|
+
if (used.has(s0)) continue;
|
|
1059
|
+
const run = [s0];
|
|
1060
|
+
used.add(s0);
|
|
1061
|
+
const side = s0.y1 - s0.y0 + 1, cy = (s0.y0 + s0.y1) / 2;
|
|
1062
|
+
let text = "\u25A1";
|
|
1063
|
+
for (; ; ) {
|
|
1064
|
+
const last = run[run.length - 1];
|
|
1065
|
+
const next = squares.find((q) => !used.has(q) && Math.abs((q.y0 + q.y1) / 2 - cy) <= side * 0.3 && q.x0 > last.x1 && q.x0 - last.x1 <= side * 2);
|
|
1066
|
+
if (!next) break;
|
|
1067
|
+
const gap = next.x0 - last.x1;
|
|
1068
|
+
const bar = bars.find((b) => b.x0 > last.x1 && b.x1 < next.x0 && Math.abs((b.y0 + b.y1) / 2 - cy) <= side * 0.3);
|
|
1069
|
+
let stroke = 0;
|
|
1070
|
+
if (!bar) for (let y = Math.round(cy - side * 0.15); y <= Math.round(cy + side * 0.15); y++) {
|
|
1071
|
+
let k = 0;
|
|
1072
|
+
for (let x = last.x1 + 1; x < next.x0; x++) {
|
|
1073
|
+
k = dark[y * width + x] ? k + 1 : 0;
|
|
1074
|
+
if (k > stroke) stroke = k;
|
|
1075
|
+
}
|
|
1076
|
+
}
|
|
1077
|
+
if (bar || stroke >= Math.max(4, side * 0.25)) text += "-";
|
|
1078
|
+
else if (gap > side) break;
|
|
1079
|
+
text += "\u25A1";
|
|
1080
|
+
used.add(next);
|
|
1081
|
+
run.push(next);
|
|
1082
|
+
}
|
|
1083
|
+
const x0 = run[0].x0, x1 = run[run.length - 1].x1;
|
|
1084
|
+
out.push({ text, x: x0, y: s0.y0, w: x1 - x0 + 1, h: side, confidence: 0.9 });
|
|
1085
|
+
}
|
|
1086
|
+
return out;
|
|
1087
|
+
}
|
|
1088
|
+
function footerInkBox(rgba, width, height, boxes) {
|
|
1089
|
+
const y0 = Math.floor(height * 0.88), x0 = Math.floor(width * 0.3), x1 = Math.ceil(width * 0.7);
|
|
1090
|
+
let minX = Infinity, maxX = -1, minY = Infinity, maxY = -1;
|
|
1091
|
+
for (let y = y0; y < height; y++) for (let x = x0; x < x1; x++) {
|
|
1092
|
+
const p = (y * width + x) * 4;
|
|
1093
|
+
if (rgba[p] * 77 + rgba[p + 1] * 150 + rgba[p + 2] * 29 >> 8 >= 128) continue;
|
|
1094
|
+
if (boxes.some((b) => x >= b.x && x < b.x + b.w && y >= b.y && y < b.y + b.h)) continue;
|
|
1095
|
+
if (x < minX) minX = x;
|
|
1096
|
+
if (x > maxX) maxX = x;
|
|
1097
|
+
if (y < minY) minY = y;
|
|
1098
|
+
if (y > maxY) maxY = y;
|
|
1099
|
+
}
|
|
1100
|
+
if (maxX < 0) return null;
|
|
1101
|
+
const bh = maxY - minY + 1;
|
|
1102
|
+
if (bh < height * 5e-3 || bh > height * 0.025 || maxX - minX + 1 > width * 0.2) return null;
|
|
1103
|
+
const pad = 4, bx = Math.max(0, minX - pad), by = Math.max(0, minY - pad);
|
|
1104
|
+
return { x: bx, y: by, w: Math.min(width, maxX + pad + 1) - bx, h: Math.min(height, maxY + pad + 1) - by };
|
|
1105
|
+
}
|
|
1106
|
+
function closingParens(rgba, width, items) {
|
|
1107
|
+
const out = [];
|
|
1108
|
+
const dark = (x, y) => {
|
|
1109
|
+
const p = (y * width + x) * 4;
|
|
1110
|
+
return rgba[p] * 77 + rgba[p + 1] * 150 + rgba[p + 2] * 29 >> 8 < 128;
|
|
1111
|
+
};
|
|
1112
|
+
for (const it of items) {
|
|
1113
|
+
const t = it.text.replace(/\s+$/, "");
|
|
1114
|
+
if ((t.match(/\(/g)?.length ?? 0) <= (t.match(/\)/g)?.length ?? 0) || !/\([^()]*$/.test(t)) continue;
|
|
1115
|
+
const x0 = it.x + it.w + 2;
|
|
1116
|
+
const next = items.filter((o) => o !== it && o.x >= x0 && o.y < it.y + it.h && o.y + o.h > it.y).reduce((m, o) => Math.min(m, o.x), Infinity);
|
|
1117
|
+
const x1 = Math.min(width, next, x0 + it.h * 8);
|
|
1118
|
+
let minX = Infinity, maxX = -1, minY = Infinity, maxY = -1, cols = 0, prevOn = false, runs = 0;
|
|
1119
|
+
for (let x = x0; x < x1; x++) {
|
|
1120
|
+
let on = false;
|
|
1121
|
+
for (let y = it.y; y < it.y + it.h; y++) if (dark(x, y)) {
|
|
1122
|
+
on = true;
|
|
1123
|
+
if (y < minY) minY = y;
|
|
1124
|
+
if (y > maxY) maxY = y;
|
|
1125
|
+
}
|
|
1126
|
+
if (on) {
|
|
1127
|
+
cols++;
|
|
1128
|
+
if (!prevOn) runs++;
|
|
1129
|
+
if (x < minX) minX = x;
|
|
1130
|
+
maxX = x;
|
|
1131
|
+
}
|
|
1132
|
+
prevOn = on;
|
|
1133
|
+
}
|
|
1134
|
+
if (runs !== 1 || maxX - minX + 1 > it.h * 0.5 || maxY - minY + 1 < it.h * 0.6) continue;
|
|
1135
|
+
let rule = false;
|
|
1136
|
+
for (let x = minX; x <= maxX && !rule; x++) rule = minY > 1 && dark(x, minY - 2) || dark(x, Math.min(maxY + 2, Math.floor(rgba.length / 4 / width) - 1));
|
|
1137
|
+
if (rule) continue;
|
|
1138
|
+
const meanX = (ya, yb) => {
|
|
1139
|
+
let sx = 0, k = 0;
|
|
1140
|
+
for (let y = ya; y < yb; y++) for (let x = minX; x <= maxX; x++) if (dark(x, y)) {
|
|
1141
|
+
sx += x;
|
|
1142
|
+
k++;
|
|
1143
|
+
}
|
|
1144
|
+
return k ? sx / k : NaN;
|
|
1145
|
+
};
|
|
1146
|
+
const ch = maxY - minY + 1, band = Math.max(1, Math.round(ch * 0.2));
|
|
1147
|
+
const ends = (meanX(minY, minY + band) + meanX(maxY + 1 - band, maxY + 1)) / 2, mid = meanX(minY + Math.floor(ch * 0.4), minY + Math.ceil(ch * 0.6));
|
|
1148
|
+
if (!(mid - ends >= 0.8)) continue;
|
|
1149
|
+
out.push({ text: ")", x: minX, y: minY, w: maxX - minX + 1, h: maxY - minY + 1, confidence: it.confidence });
|
|
1150
|
+
}
|
|
1151
|
+
return out;
|
|
1152
|
+
}
|
|
875
1153
|
var OcrEngine = class _OcrEngine {
|
|
876
1154
|
det;
|
|
877
1155
|
rec;
|
|
@@ -961,6 +1239,7 @@ var OcrEngine = class _OcrEngine {
|
|
|
961
1239
|
const detected = await this.detect(rgba, width, height, tuning, stats);
|
|
962
1240
|
const rows = rowRules.length ? detected.flatMap((b) => splitBoxAtRowRules(b, rowRules)) : detected;
|
|
963
1241
|
const boxes = cellRules.length ? rows.flatMap((b) => splitBoxAtCellRules(b, cellRules)) : rows;
|
|
1242
|
+
const footer = tuning.postprocess ? footerInkBox(rgba, width, height, boxes) : null;
|
|
964
1243
|
const jobs = [];
|
|
965
1244
|
const joins = [];
|
|
966
1245
|
let group = 0;
|
|
@@ -1004,6 +1283,7 @@ var OcrEngine = class _OcrEngine {
|
|
|
1004
1283
|
if (keep) jobs.push({ box: b, rot: 0, group, keep });
|
|
1005
1284
|
jobs.push({ box: b, rot: 0, group: group++ });
|
|
1006
1285
|
}
|
|
1286
|
+
if (footer) jobs.push({ box: footer, rot: 0, group: group++, footer: true });
|
|
1007
1287
|
const results = await this.recognizeJobs(rgba, width, jobs, tuning.recBatch);
|
|
1008
1288
|
const best = /* @__PURE__ */ new Map();
|
|
1009
1289
|
const score = (job, confidence) => confidence - (job.keep ? KEEP_MARGIN : 0);
|
|
@@ -1013,6 +1293,12 @@ var OcrEngine = class _OcrEngine {
|
|
|
1013
1293
|
const cur = best.get(job.group);
|
|
1014
1294
|
if (!cur || score(job, r.confidence) > score(cur.job, cur.confidence)) best.set(job.group, { job, ...r });
|
|
1015
1295
|
});
|
|
1296
|
+
jobs.forEach((job, i) => {
|
|
1297
|
+
const r = results[i], cur = best.get(job.group);
|
|
1298
|
+
if (!job.keep || !r || !cur || cur.job === job) return;
|
|
1299
|
+
const b = cur.text.replace(/\s/g, "");
|
|
1300
|
+
if (r.text.replace(/\s/g, "") === "\xB7" + b && /^[가-힣]/.test(b)) best.set(job.group, { ...cur, text: "\xB7" + cur.text, steps: [r.steps[0], ...cur.steps] });
|
|
1301
|
+
});
|
|
1016
1302
|
let items = [];
|
|
1017
1303
|
for (const r of best.values()) {
|
|
1018
1304
|
const { job, confidence, stepPx } = r;
|
|
@@ -1021,7 +1307,11 @@ var OcrEngine = class _OcrEngine {
|
|
|
1021
1307
|
const raw = tuning.postprocess && job.rot === 0 ? restoreGlyphs(rgba, width, job.box, read, steps, stepPx, note) : read;
|
|
1022
1308
|
let text = tuning.postprocess ? restoreSymbols(raw.trim(), note.ringLead) : raw;
|
|
1023
1309
|
if (!text.trim()) continue;
|
|
1024
|
-
if (tuning.postprocess && job.rot === 0 &&
|
|
1310
|
+
if (tuning.postprocess && job.rot === 0 && text !== "/" && /^[(:;/)]+$/.test(text) && text.includes("/")) {
|
|
1311
|
+
const g = grayCrop(rgba, width, job.box);
|
|
1312
|
+
if (tallInkCount(g, job.box.w, job.box.h, inkStats(g)) === 1) text = "/";
|
|
1313
|
+
}
|
|
1314
|
+
if (tuning.postprocess && job.rot === 0 && !/^[◎●▪□■▣❐❏○ㅇ◆◇◈]/.test(text)) {
|
|
1025
1315
|
const chars = [...read], k = chars.findIndex((c) => c.trim());
|
|
1026
1316
|
if (k >= 0 && steps.length === chars.length) {
|
|
1027
1317
|
const g = grayCrop(rgba, width, job.box);
|
|
@@ -1031,6 +1321,8 @@ var OcrEngine = class _OcrEngine {
|
|
|
1031
1321
|
if (b?.mark === "\u25CE" && b.covers && /^[Oo0○]/.test(text)) text = b.mark + " " + text.slice(1).trimStart();
|
|
1032
1322
|
else if (b?.mark === "\u25A1" || b?.mark === "\u25A3") {
|
|
1033
1323
|
if (!b.covers && body) text = b.mark + " " + text;
|
|
1324
|
+
} else if (b?.mark === "\u25C6" || b?.mark === "\u25C7" || b?.mark === "\u25C8") {
|
|
1325
|
+
if (b.covers ? /^[\p{S}\p{P}]/u.test(text) : body) text = b.covers ? b.mark + " " + text.slice(1).trimStart() : b.mark + " " + text;
|
|
1034
1326
|
} else if (b?.mark === "\u2023") {
|
|
1035
1327
|
if (b.covers ? text.startsWith("\u2192") : body) text = b.covers ? b.mark + " " + text.slice(1).trimStart() : b.mark + " " + text;
|
|
1036
1328
|
} else if (b?.mark === "\u2750" || b?.mark === "\u274F") {
|
|
@@ -1048,6 +1340,10 @@ var OcrEngine = class _OcrEngine {
|
|
|
1048
1340
|
const g = grayCrop(rgba, width, job.box);
|
|
1049
1341
|
text = arrowGlyph(g, job.box.w, job.box.h, inkStats(g)) ?? text;
|
|
1050
1342
|
}
|
|
1343
|
+
if (job.footer) {
|
|
1344
|
+
if (!/^[-\u2013\u2014]?\s*(?:\d{1,4}|[ivxIVXⅰ-ⅹⅠ-Ⅹ]{1,4})\s*[-\u2013\u2014]?$/.test(text.trim())) continue;
|
|
1345
|
+
text = text.replace(/[\u2013\u2014]/g, "-");
|
|
1346
|
+
}
|
|
1051
1347
|
if (tuning.postprocess && isDotFragment(text)) continue;
|
|
1052
1348
|
if (confidence < tuning.textScore) {
|
|
1053
1349
|
if (stats) {
|
|
@@ -1086,6 +1382,19 @@ var OcrEngine = class _OcrEngine {
|
|
|
1086
1382
|
if (leaderEnds.size) items = joinLeaderItems(items, leaderEnds);
|
|
1087
1383
|
if (tuning.postprocess) items = dropNestedFragments(items);
|
|
1088
1384
|
if (tuning.postprocess) for (const it of items) this.outerSquare(rgba, width, it, items);
|
|
1385
|
+
if (tuning.postprocess) items.push(...closingParens(rgba, width, items));
|
|
1386
|
+
if (tuning.postprocess) items.push(...placeholderSquares(rgba, width, height, items));
|
|
1387
|
+
if (tuning.postprocess) items.push(...rowHeadDashes(rgba, width, items));
|
|
1388
|
+
if (tuning.postprocess) {
|
|
1389
|
+
const tails = rowTailBoxes(rgba, width, items);
|
|
1390
|
+
if (tails.length) {
|
|
1391
|
+
const res = await this.recognizeJobs(rgba, width, tails.map((box, k) => ({ box, rot: 0, group: k })), tuning.recBatch);
|
|
1392
|
+
tails.forEach((box, k) => {
|
|
1393
|
+
const t = res[k]?.text.trim() ?? "";
|
|
1394
|
+
if (/^\d{1,4}$/.test(t) && (res[k]?.confidence ?? 0) >= tuning.textScore) items.push({ text: t, ...this.itemBox(rgba, width, box, tuning), confidence: res[k].confidence });
|
|
1395
|
+
});
|
|
1396
|
+
}
|
|
1397
|
+
}
|
|
1089
1398
|
if (tuning.postprocess) restoreBulletItems(items);
|
|
1090
1399
|
items.sort((a, b) => a.y - b.y || a.x - b.x);
|
|
1091
1400
|
return items;
|
|
@@ -1755,4 +2064,4 @@ export {
|
|
|
1755
2064
|
groupOcrLines,
|
|
1756
2065
|
ocrItemsToBlocks
|
|
1757
2066
|
};
|
|
1758
|
-
//# sourceMappingURL=chunk-
|
|
2067
|
+
//# sourceMappingURL=chunk-6WEHXC2D.js.map
|