kordoc 4.2.8 → 4.3.0

package/dist/chunk-TCJRGFYY.js

@@ -1,280 +0,0 @@
-#!/usr/bin/env node
-
-// src/detect.ts
-import JSZip from "jszip";
-
-// src/hwp5/cfb-lenient.ts
-var CFB_MAGIC = Buffer.from([208, 207, 17, 224, 161, 177, 26, 225]);
-var END_OF_CHAIN = 4294967294;
-var FREE_SECT = 4294967295;
-var MAX_CHAIN_LENGTH = 1e6;
-var MAX_DIR_ENTRIES = 1e5;
-var MAX_STREAM_SIZE = 100 * 1024 * 1024;
-function parseLenientCfb(data) {
-  if (data.length < 512) throw new Error("CFB \uD30C\uC77C\uC774 \uB108\uBB34 \uC9E7\uC2B5\uB2C8\uB2E4 (\uCD5C\uC18C 512\uBC14\uC774\uD2B8)");
-  if (!data.subarray(0, 8).equals(CFB_MAGIC)) throw new Error("CFB \uB9E4\uC9C1 \uBC14\uC774\uD2B8 \uBD88\uC77C\uCE58");
-  const sectorSizeShift = data.readUInt16LE(30);
-  if (sectorSizeShift < 7 || sectorSizeShift > 16) throw new Error("\uC720\uD6A8\uD558\uC9C0 \uC54A\uC740 \uC139\uD130 \uD06C\uAE30 \uC2DC\uD504\uD2B8: " + sectorSizeShift);
-  const sectorSize = 1 << sectorSizeShift;
-  const miniSectorSizeShift = data.readUInt16LE(32);
-  if (miniSectorSizeShift > 16) throw new Error("\uC720\uD6A8\uD558\uC9C0 \uC54A\uC740 \uBBF8\uB2C8 \uC139\uD130 \uD06C\uAE30 \uC2DC\uD504\uD2B8: " + miniSectorSizeShift);
-  const miniSectorSize = 1 << miniSectorSizeShift;
-  const headerFatSectorCount = data.readUInt32LE(44);
-  if (headerFatSectorCount > 1e4) throw new Error("FAT \uC139\uD130 \uC218\uAC00 \uB108\uBB34 \uB9CE\uC2B5\uB2C8\uB2E4: " + headerFatSectorCount);
-  const maxRealSectors = Math.ceil(Math.max(0, data.length - 512) / sectorSize);
-  const maxFatSectors = Math.max(1, Math.ceil(maxRealSectors / (sectorSize / 4)));
-  const fatSectorCount = Math.min(headerFatSectorCount, maxFatSectors);
-  const firstDirSector = data.readUInt32LE(48);
-  const miniStreamCutoff = data.readUInt32LE(56);
-  const firstMiniFatSector = data.readUInt32LE(60);
-  const miniFatSectorCount = data.readUInt32LE(64);
-  const firstDifatSector = data.readUInt32LE(68);
-  const difatSectorCount = data.readUInt32LE(72);
-  function sectorOffset(id) {
-    return 512 + id * sectorSize;
-  }
-  function readSectorData(id) {
-    const off = sectorOffset(id);
-    if (off + sectorSize > data.length) return Buffer.alloc(0);
-    return data.subarray(off, off + sectorSize);
-  }
-  const fatSectors = [];
-  for (let i = 0; i < 109 && fatSectors.length < fatSectorCount; i++) {
-    const sid = data.readUInt32LE(76 + i * 4);
-    if (sid === FREE_SECT || sid === END_OF_CHAIN) break;
-    fatSectors.push(sid);
-  }
-  let difatSector = firstDifatSector;
-  const visitedDifat = /* @__PURE__ */ new Set();
-  for (let d = 0; d < difatSectorCount && difatSector !== END_OF_CHAIN && difatSector !== FREE_SECT; d++) {
-    if (visitedDifat.has(difatSector)) break;
-    visitedDifat.add(difatSector);
-    const buf = readSectorData(difatSector);
-    if (buf.length < sectorSize) break;
-    const entriesPerSector = sectorSize / 4 - 1;
-    for (let i = 0; i < entriesPerSector && fatSectors.length < fatSectorCount; i++) {
-      const sid = buf.readUInt32LE(i * 4);
-      if (sid === FREE_SECT || sid === END_OF_CHAIN) continue;
-      fatSectors.push(sid);
-    }
-    difatSector = buf.readUInt32LE(entriesPerSector * 4);
-  }
-  const entriesPerFatSector = sectorSize / 4;
-  const fatTable = new Uint32Array(fatSectors.length * entriesPerFatSector);
-  for (let fi = 0; fi < fatSectors.length; fi++) {
-    const buf = readSectorData(fatSectors[fi]);
-    for (let i = 0; i < entriesPerFatSector; i++) {
-      fatTable[fi * entriesPerFatSector + i] = i * 4 + 3 < buf.length ? buf.readUInt32LE(i * 4) : FREE_SECT;
-    }
-  }
-  function readChain(startSector, maxBytes) {
-    if (startSector === END_OF_CHAIN || startSector === FREE_SECT) return Buffer.alloc(0);
-    if (maxBytes > MAX_STREAM_SIZE) throw new Error("\uC2A4\uD2B8\uB9BC\uC774 \uB108\uBB34 \uD07D\uB2C8\uB2E4");
-    const chunks = [];
-    let current = startSector;
-    let totalRead = 0;
-    const visited = /* @__PURE__ */ new Set();
-    while (current !== END_OF_CHAIN && current !== FREE_SECT && totalRead < maxBytes) {
-      if (visited.has(current)) break;
-      if (visited.size > MAX_CHAIN_LENGTH) break;
-      visited.add(current);
-      const buf = readSectorData(current);
-      const remaining = maxBytes - totalRead;
-      chunks.push(remaining < sectorSize ? buf.subarray(0, remaining) : buf);
-      totalRead += Math.min(buf.length, remaining);
-      current = current < fatTable.length ? fatTable[current] : END_OF_CHAIN;
-    }
-    return Buffer.concat(chunks);
-  }
-  let miniFatTable = null;
-  function getMiniFatTable() {
-    if (miniFatTable) return miniFatTable;
-    if (miniFatSectorCount === 0 || firstMiniFatSector === END_OF_CHAIN) {
-      miniFatTable = new Uint32Array(0);
-      return miniFatTable;
-    }
-    const miniFatData = readChain(firstMiniFatSector, miniFatSectorCount * sectorSize);
-    const entries = miniFatData.length / 4;
-    miniFatTable = new Uint32Array(entries);
-    for (let i = 0; i < entries; i++) {
-      miniFatTable[i] = miniFatData.readUInt32LE(i * 4);
-    }
-    return miniFatTable;
-  }
-  const dirData = readChain(firstDirSector, MAX_DIR_ENTRIES * 128);
-  const dirEntries = [];
-  for (let offset = 0; offset + 128 <= dirData.length && dirEntries.length < MAX_DIR_ENTRIES; offset += 128) {
-    const nameLen = dirData.readUInt16LE(offset + 64);
-    if (nameLen <= 0 || nameLen > 64) {
-      dirEntries.push({ name: "", type: 0, startSector: 0, size: 0 });
-      continue;
-    }
-    const nameBytes = nameLen - 2;
-    const name = nameBytes > 0 ? dirData.subarray(offset, offset + nameBytes).toString("utf16le") : "";
-    const type = dirData[offset + 66];
-    const startSector = dirData.readUInt32LE(offset + 116);
-    const size = dirData.readUInt32LE(offset + 120);
-    dirEntries.push({ name, type, startSector, size });
-  }
-  let miniStreamData = null;
-  function getMiniStream() {
-    if (miniStreamData) return miniStreamData;
-    const root = dirEntries[0];
-    if (!root || root.type !== 5) {
-      miniStreamData = Buffer.alloc(0);
-      return miniStreamData;
-    }
-    miniStreamData = readChain(root.startSector, root.size || MAX_STREAM_SIZE);
-    return miniStreamData;
-  }
-  function readMiniStream(startSector, size) {
-    const mft = getMiniFatTable();
-    const ms = getMiniStream();
-    if (mft.length === 0 || ms.length === 0) return Buffer.alloc(0);
-    const chunks = [];
-    let current = startSector;
-    let totalRead = 0;
-    const visited = /* @__PURE__ */ new Set();
-    while (current !== END_OF_CHAIN && current !== FREE_SECT && totalRead < size) {
-      if (visited.has(current)) break;
-      if (visited.size > MAX_CHAIN_LENGTH) break;
-      visited.add(current);
-      const off = current * miniSectorSize;
-      const remaining = size - totalRead;
-      const chunkSize = Math.min(miniSectorSize, remaining);
-      if (off + chunkSize <= ms.length) {
-        chunks.push(ms.subarray(off, off + chunkSize));
-      }
-      totalRead += chunkSize;
-      current = current < mft.length ? mft[current] : END_OF_CHAIN;
-    }
-    return Buffer.concat(chunks);
-  }
-  function readStreamData(entry) {
-    if (entry.size === 0) return Buffer.alloc(0);
-    if (entry.size < miniStreamCutoff) {
-      const miniResult = readMiniStream(entry.startSector, entry.size);
-      if (miniResult.length > 0) return miniResult;
-    }
-    return readChain(entry.startSector, entry.size);
-  }
-  function findEntryByPath(path) {
-    const parts = path.replace(/^\//, "").split("/");
-    if (parts.length === 1) {
-      return dirEntries.find((e) => e.name === parts[0] && e.type === 2) ?? null;
-    }
-    const storageName = parts[0];
-    const streamName = parts.slice(1).join("/");
-    for (const e of dirEntries) {
-      if (e.type === 2 && e.name === streamName) {
-        return e;
-      }
-    }
-    const lastPart = parts[parts.length - 1];
-    return dirEntries.find((e) => e.type === 2 && e.name === lastPart) ?? null;
-  }
-  return {
-    findStream(path) {
-      const normalized = path.replace(/^\//, "");
-      const entry = findEntryByPath(normalized);
-      if (!entry || entry.type !== 2) return null;
-      const stream = readStreamData(entry);
-      return stream.length > 0 ? stream : null;
-    },
-    entries() {
-      return dirEntries.filter((e) => e.type === 2);
-    }
-  };
-}
-
-// src/detect.ts
-function magicBytes(buffer) {
-  return new Uint8Array(buffer, 0, Math.min(4, buffer.byteLength));
-}
-function isZipFile(buffer) {
-  const b = magicBytes(buffer);
-  return b[0] === 80 && b[1] === 75 && b[2] === 3 && b[3] === 4;
-}
-function isHwpxFile(buffer) {
-  return isZipFile(buffer);
-}
-function isOldHwpFile(buffer) {
-  const b = magicBytes(buffer);
-  return b[0] === 208 && b[1] === 207 && b[2] === 17 && b[3] === 224;
-}
-var HWP3_PREFIX = new TextEncoder().encode("HWP Document File V3.00");
-function isHwp3File(buffer) {
-  if (buffer.byteLength < HWP3_PREFIX.length) return false;
-  const head = new Uint8Array(buffer, 0, HWP3_PREFIX.length);
-  for (let i = 0; i < HWP3_PREFIX.length; i++) {
-    if (head[i] !== HWP3_PREFIX[i]) return false;
-  }
-  return true;
-}
-function isPdfFile(buffer) {
-  const b = magicBytes(buffer);
-  return b[0] === 37 && b[1] === 80 && b[2] === 68 && b[3] === 70;
-}
-function isImageFile(buffer) {
-  if (buffer.byteLength < 12) return false;
-  const b = new Uint8Array(buffer, 0, 12);
-  if (b[0] === 137 && b[1] === 80 && b[2] === 78 && b[3] === 71) return true;
-  if (b[0] === 255 && b[1] === 216 && b[2] === 255) return true;
-  if (b[0] === 82 && b[1] === 73 && b[2] === 70 && b[3] === 70 && b[8] === 87 && b[9] === 69 && b[10] === 66 && b[11] === 80) return true;
-  return false;
-}
-function isHwpmlFile(buffer) {
-  const bytes = new Uint8Array(buffer, 0, Math.min(512, buffer.byteLength));
-  const head = new TextDecoder("utf-8", { fatal: false }).decode(bytes).replace(/^\uFEFF/, "");
-  return head.trimStart().startsWith("<?xml") && head.includes("<HWPML");
-}
-function detectFormat(buffer) {
-  if (buffer.byteLength < 4) return "unknown";
-  if (isHwp3File(buffer)) return "hwp3";
-  if (isZipFile(buffer)) return "hwpx";
-  if (isOldHwpFile(buffer)) return "hwp";
-  if (isPdfFile(buffer)) return "pdf";
-  if (isHwpmlFile(buffer)) return "hwpml";
-  if (isImageFile(buffer)) return "image";
-  return "unknown";
-}
-function detectOle2Format(buffer) {
-  try {
-    const cfb = parseLenientCfb(Buffer.from(buffer));
-    const names = cfb.entries().map((e) => e.name);
-    if (names.includes("Workbook") || names.includes("Book")) return "xls";
-    if (names.includes("FileHeader")) return "hwp";
-    if (names.some((n) => n === "DocInfo" || n.startsWith("Section"))) return "hwp";
-    return "unknown";
-  } catch {
-    return "unknown";
-  }
-}
-async function detectZipFormat(buffer) {
-  try {
-    const zip = await JSZip.loadAsync(buffer);
-    if (zip.file("xl/workbook.xml")) return "xlsx";
-    if (zip.file("word/document.xml")) return "docx";
-    if (zip.file("Contents/content.hpf") || zip.file("mimetype")) return "hwpx";
-    const hasSection = Object.keys(zip.files).some((f) => f.startsWith("Contents/"));
-    if (hasSection) return "hwpx";
-    return "unknown";
-  } catch {
-    return "unknown";
-  }
-}
-
-export {
-  parseLenientCfb,
-  isZipFile,
-  isHwpxFile,
-  isOldHwpFile,
-  isHwp3File,
-  isPdfFile,
-  isImageFile,
-  isHwpmlFile,
-  detectFormat,
-  detectOle2Format,
-  detectZipFormat
-};
-//# sourceMappingURL=chunk-TCJRGFYY.js.map

package/dist/chunk-TCJRGFYY.js.map

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