@happyvertical/spreadsheets 0.0.0-stage → 0.112.3
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/AGENT.md +43 -0
- package/LICENSE +7 -0
- package/README.md +235 -2
- package/dist/csv.d.ts +6 -0
- package/dist/csv.d.ts.map +1 -0
- package/dist/errors.d.ts +49 -0
- package/dist/errors.d.ts.map +1 -0
- package/dist/formats.d.ts +7 -0
- package/dist/formats.d.ts.map +1 -0
- package/dist/formula.d.ts +41 -0
- package/dist/formula.d.ts.map +1 -0
- package/dist/index.d.ts +10 -0
- package/dist/index.d.ts.map +1 -0
- package/dist/index.js +3050 -0
- package/dist/index.js.map +1 -0
- package/dist/io.d.ts +4 -0
- package/dist/io.d.ts.map +1 -0
- package/dist/model.d.ts +104 -0
- package/dist/model.d.ts.map +1 -0
- package/dist/profile.d.ts +77 -0
- package/dist/profile.d.ts.map +1 -0
- package/dist/reference-index.d.ts +17 -0
- package/dist/reference-index.d.ts.map +1 -0
- package/dist/types.d.ts +24 -0
- package/dist/types.d.ts.map +1 -0
- package/dist/xlsx-read.d.ts +4 -0
- package/dist/xlsx-read.d.ts.map +1 -0
- package/dist/xlsx-write.d.ts +5 -0
- package/dist/xlsx-write.d.ts.map +1 -0
- package/dist/xml.d.ts +14 -0
- package/dist/xml.d.ts.map +1 -0
- package/dist/zip.d.ts +3 -0
- package/dist/zip.d.ts.map +1 -0
- package/metadata.json +30 -0
- package/package.json +54 -3
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"index.js","names":[],"sources":["../src/errors.ts","../src/model.ts","../src/io.ts","../src/csv.ts","../src/formats.ts","../src/formula.ts","../src/reference-index.ts","../src/xml.ts","../../../node_modules/.pnpm/fflate@0.8.2/node_modules/fflate/esm/browser.js","../src/zip.ts","../src/xlsx-read.ts","../src/xlsx-write.ts","../src/profile.ts","../src/index.ts"],"sourcesContent":["/** Closed failure contract. Messages never interpolate workbook content. */\nexport type SpreadsheetErrorCode =\n | 'UNSUPPORTED_FORMAT'\n | 'INVALID_INPUT'\n | 'INVALID_ZIP'\n | 'UNSAFE_ZIP'\n | 'UNSUPPORTED_ZIP'\n | 'INVALID_XML'\n | 'LIMIT_EXCEEDED'\n | 'INVALID_WORKBOOK';\n\nexport class SpreadsheetError extends Error {\n constructor(\n public readonly code: SpreadsheetErrorCode,\n message: string,\n public readonly limit?: keyof SpreadsheetLimits,\n ) {\n super(message);\n this.name = 'SpreadsheetError';\n }\n}\n\nexport interface SpreadsheetLimits {\n maxInputBytes: number;\n maxEntries: number;\n maxEntryBytes: number;\n maxTotalBytes: number;\n maxCompressionRatio: number;\n /** Apply the secondary ratio guard only above this actual inflated size. */\n compressionRatioFloorBytes: number;\n maxPathBytes: number;\n maxXmlDepth: number;\n maxXmlText: number;\n maxXmlNodes: number;\n maxSheets: number;\n maxCells: number;\n maxSharedStrings: number;\n maxFormulaLength: number;\n maxDefinedNames: number;\n maxTables: number;\n maxDataValidations: number;\n maxMerges: number;\n maxPartReferences: number;\n maxReadWork: number;\n maxFormulaWork: number;\n maxFormulaDepth: number;\n maxFormulaTokens: number;\n maxFormulaCacheEntries: number;\n maxRows: number;\n maxColumns: number;\n}\n\nexport const DEFAULT_LIMITS: Readonly<SpreadsheetLimits> = Object.freeze({\n maxInputBytes: 32 * 1024 * 1024,\n maxEntries: 10_000,\n maxEntryBytes: 128 * 1024 * 1024,\n maxTotalBytes: 256 * 1024 * 1024,\n maxCompressionRatio: 1000,\n compressionRatioFloorBytes: 8 * 1024 * 1024,\n maxPathBytes: 1024,\n maxXmlDepth: 64,\n maxXmlText: 32 * 1024 * 1024,\n maxXmlNodes: 5 * 1_000_000,\n maxSheets: 128,\n maxCells: 1_000_000,\n maxSharedStrings: 500_000,\n maxFormulaLength: 8192,\n maxDefinedNames: 10_000,\n maxTables: 1_000,\n maxDataValidations: 10_000,\n maxMerges: 10_000,\n maxPartReferences: 1,\n maxReadWork: 256 * 1024 * 1024,\n maxFormulaWork: 128 * 1_000_000,\n maxFormulaDepth: 128,\n maxFormulaTokens: 2_048,\n maxFormulaCacheEntries: 50_000,\n maxRows: 1_048_576,\n maxColumns: 16_384,\n});\n\nexport function resolveLimits(\n options: Partial<SpreadsheetLimits> = {},\n base: Readonly<SpreadsheetLimits> = DEFAULT_LIMITS,\n): SpreadsheetLimits {\n const limits = { ...base };\n for (const key of Object.keys(limits) as (keyof SpreadsheetLimits)[]) {\n const value = options[key] ?? limits[key];\n if (!Number.isSafeInteger(value) || value <= 0) {\n throw new SpreadsheetError(\n 'INVALID_INPUT',\n 'Limits must be positive safe integers.',\n );\n }\n limits[key] = value;\n }\n return limits;\n}\n\nexport function checkLimit(\n actual: number,\n key: keyof SpreadsheetLimits,\n limits: SpreadsheetLimits,\n): void {\n if (actual > limits[key])\n throw new SpreadsheetError(\n 'LIMIT_EXCEEDED',\n `Spreadsheet limit exceeded: ${key}.`,\n key,\n );\n}\n\nexport function invalid(message = 'Invalid workbook structure.'): never {\n throw new SpreadsheetError('INVALID_WORKBOOK', message);\n}\n\n/** Counts inner operations and processed/output text, not just outer calls. */\nexport class WorkBudget {\n private used = 0;\n constructor(\n private readonly maximum: number,\n private readonly limit?: keyof SpreadsheetLimits,\n ) {}\n spend(amount = 1): void {\n this.used += amount;\n if (this.used > this.maximum)\n throw new SpreadsheetError(\n 'LIMIT_EXCEEDED',\n 'Spreadsheet processing work limit exceeded.',\n this.limit,\n );\n }\n}\n","import { invalid } from './errors.js';\n\n/** Coordinates are one-based throughout the public model. */\nexport interface Point {\n row: number;\n col: number;\n}\nexport interface Range {\n start: Point;\n end: Point;\n}\nexport interface Reference {\n sheet?: string;\n range: Range;\n absolute: {\n startRow: boolean;\n startCol: boolean;\n endRow: boolean;\n endCol: boolean;\n };\n name?: string;\n}\nexport interface Formula {\n /** Formula text without a leading equals sign. No evaluation is performed. */\n text: string;\n dialect: 'excel-a1';\n references: Reference[];\n functions: string[];\n arrayRange?: Range;\n}\nexport type CellType =\n | 'text'\n | 'number'\n | 'boolean'\n | 'date'\n | 'error'\n | 'empty';\nexport type FormatKind =\n | 'general'\n | 'number'\n | 'currency'\n | 'percent'\n | 'date'\n | 'time'\n | 'datetime'\n | 'text';\nexport interface Cell {\n value: string | number | boolean | Date | null;\n type: CellType;\n raw?: number;\n /** Original lexical field for CSV. */\n originalText?: string;\n error?: string;\n formula?: Formula;\n numberFormat?: string;\n formatKind?: FormatKind;\n}\nexport interface Table {\n name: string;\n range: Range;\n headerRow: boolean;\n totalsRow: boolean;\n columns: string[];\n}\nexport interface DataValidation {\n ranges: Range[];\n kind: 'list' | 'whole' | 'decimal' | 'date' | 'textLength' | 'custom';\n values?: string[];\n source?: Reference;\n formula?: string;\n}\nexport interface DefinedName {\n name: string;\n scope?: string;\n reference?: Reference;\n text: string;\n}\nexport interface Sheet {\n name: string;\n state: 'visible' | 'hidden' | 'veryHidden';\n dimension?: Range;\n cells: SparseCells;\n merges: Range[];\n tables: Table[];\n validations: DataValidation[];\n frozen?: { rows: number; cols: number };\n columnWidths?: Record<number, number>;\n}\nexport interface Workbook {\n sheets: Sheet[];\n definedNames: DefinedName[];\n dateSystem: 1900 | 1904;\n source: { format: string };\n}\n\nexport function columnName(col: number): string {\n if (!Number.isInteger(col) || col < 1 || col > 16384)\n invalid('Invalid cell coordinate.');\n let result = '';\n for (let n = col; n > 0; n = Math.floor((n - 1) / 26))\n result = String.fromCharCode(65 + ((n - 1) % 26)) + result;\n return result;\n}\nexport function address(point: Point): string {\n return `${columnName(point.col)}${point.row}`;\n}\nexport function point(a1: string): Point {\n const match = /^\\$?([A-Za-z]{1,3})\\$?([1-9]\\d{0,6})$/.exec(a1);\n if (!match) invalid('Invalid cell address.');\n let col = 0;\n for (const char of match[1].toUpperCase())\n col = col * 26 + char.charCodeAt(0) - 64;\n const row = Number(match[2]);\n if (col > 16384 || row > 1048576) invalid('Invalid cell coordinate.');\n return { row, col };\n}\nexport function range(a1: string): Range {\n const parts = a1.split(':');\n if (parts.length > 2) invalid('Invalid cell range.');\n const start = point(parts[0]);\n const end = point(parts[1] ?? parts[0]);\n if (end.row < start.row || end.col < start.col)\n invalid('Invalid cell range.');\n return { start, end };\n}\nexport function rangeAddress(value: Range): string {\n return `${address(value.start)}:${address(value.end)}`;\n}\nexport function contains(value: Range, p: Point): boolean {\n return (\n p.row >= value.start.row &&\n p.row <= value.end.row &&\n p.col >= value.start.col &&\n p.col <= value.end.col\n );\n}\n\n/** Sparse storage; iteration and rows are ordered numerically, never by dimension. */\nexport class SparseCells implements Iterable<[Point, Cell]> {\n private readonly data = new Map<number, Map<number, Cell>>();\n private count = 0;\n get size(): number {\n return this.count;\n }\n get(a1: string): Cell | undefined;\n get(row: number, col: number): Cell | undefined;\n get(row: string | number, col?: number): Cell | undefined {\n const p = typeof row === 'string' ? point(row) : { row, col: col ?? 0 };\n return this.data.get(p.row)?.get(p.col);\n }\n set(a1: string, cell: Cell): this;\n set(row: number, col: number, cell: Cell): this;\n set(row: string | number, col: number | Cell, cell?: Cell): this {\n const p =\n typeof row === 'string' ? point(row) : { row, col: col as number };\n if (!Number.isInteger(p.row) || p.row < 1 || p.row > 1048576)\n invalid('Invalid cell coordinate.');\n columnName(p.col);\n let cells = this.data.get(p.row);\n if (!cells) {\n cells = new Map();\n this.data.set(p.row, cells);\n }\n if (!cells.has(p.col)) this.count++;\n cells.set(p.col, (typeof row === 'string' ? col : cell) as Cell);\n return this;\n }\n *rows(): IterableIterator<[number, ReadonlyMap<number, Cell>]> {\n for (const row of [...this.data.keys()].sort((a, b) => a - b)) {\n yield [\n row,\n new Map([...(this.data.get(row) ?? [])].sort(([a], [b]) => a - b)),\n ];\n }\n }\n *[Symbol.iterator](): IterableIterator<[Point, Cell]> {\n for (const [row, cells] of this.rows())\n for (const [col, cell] of cells) yield [{ row, col }, cell];\n }\n}\nexport function createSheet(name: string): Sheet {\n return {\n name,\n state: 'visible',\n cells: new SparseCells(),\n merges: [],\n tables: [],\n validations: [],\n };\n}\nexport function createWorkbook(sheets: Sheet[] = []): Workbook {\n return {\n sheets,\n definedNames: [],\n dateSystem: 1900,\n source: { format: 'model' },\n };\n}\n","import {\n checkLimit,\n invalid,\n type SpreadsheetLimits,\n WorkBudget,\n} from './errors.js';\nimport { type Range, range, rangeAddress, type Workbook } from './model.js';\n\nexport function validateWorkbook(\n workbook: Workbook,\n limits: SpreadsheetLimits,\n): void {\n if (\n !workbook ||\n !Array.isArray(workbook.sheets) ||\n !workbook.sheets.length ||\n ![1900, 1904].includes(workbook.dateSystem)\n )\n invalid();\n const work = new WorkBudget(limits.maxReadWork, 'maxReadWork');\n checkLimit(workbook.sheets.length, 'maxSheets', limits);\n checkLimit(workbook.definedNames.length, 'maxDefinedNames', limits);\n let tableCount = 0;\n let merges = 0;\n let validations = 0;\n if (!workbook.sheets.some((s) => s.state === 'visible'))\n invalid('At least one worksheet must be visible.');\n const boundRange = (r: Range) => {\n const checked = range(rangeAddress(r));\n checkLimit(checked.end.row, 'maxRows', limits);\n checkLimit(checked.end.col, 'maxColumns', limits);\n };\n for (const name of workbook.definedNames) {\n work.spend(name.text.length + name.name.length + 1);\n checkLimit(name.text.length, 'maxFormulaLength', limits);\n }\n const names = new Set<string>();\n let count = 0;\n for (const sheet of workbook.sheets) {\n if (\n !sheet.name ||\n sheet.name.length > 31 ||\n /[\\\\/[\\]:?*]/.test(sheet.name) ||\n names.has(sheet.name.toLowerCase())\n )\n invalid('Invalid or duplicate worksheet name.');\n names.add(sheet.name.toLowerCase());\n if (!['visible', 'hidden', 'veryHidden'].includes(sheet.state))\n invalid('Invalid worksheet state.');\n if (\n sheet.frozen &&\n (!Number.isInteger(sheet.frozen.rows) ||\n !Number.isInteger(sheet.frozen.cols) ||\n sheet.frozen.rows < 0 ||\n sheet.frozen.cols < 0 ||\n sheet.frozen.rows >= limits.maxRows ||\n sheet.frozen.cols >= limits.maxColumns)\n )\n invalid('Invalid frozen pane.');\n merges += sheet.merges.length;\n checkLimit(merges, 'maxMerges', limits);\n for (const r of sheet.merges) boundRange(r);\n for (const table of sheet.tables) {\n checkLimit(++tableCount, 'maxTables', limits);\n work.spend(table.name.length + table.columns.length + 1);\n for (const name of table.columns) work.spend(name.length + 1);\n boundRange(table.range);\n if (\n !table.name ||\n table.columns.length !== table.range.end.col - table.range.start.col + 1\n )\n invalid('Invalid table columns.');\n }\n for (const validation of sheet.validations) {\n validations += Math.max(1, validation.ranges.length);\n checkLimit(validations, 'maxDataValidations', limits);\n work.spend(\n validation.ranges.length + (validation.formula?.length ?? 0) + 1,\n );\n if (\n !['list', 'whole', 'decimal', 'date', 'textLength', 'custom'].includes(\n validation.kind,\n ) ||\n !validation.ranges.length\n )\n invalid('Invalid validation rule.');\n for (const value of validation.values ?? []) work.spend(value.length + 1);\n validation.ranges.forEach(boundRange);\n if (validation.formula)\n checkLimit(validation.formula.length, 'maxFormulaLength', limits);\n }\n for (const [p, cell] of sheet.cells) {\n work.spend(\n 1 +\n (typeof cell.value === 'string' ? cell.value.length : 0) +\n (cell.numberFormat?.length ?? 0) +\n (cell.formula?.text.length ?? 0),\n );\n checkLimit(++count, 'maxCells', limits);\n checkLimit(p.row, 'maxRows', limits);\n checkLimit(p.col, 'maxColumns', limits);\n if (\n !['text', 'number', 'boolean', 'date', 'error', 'empty'].includes(\n cell.type,\n )\n )\n invalid('Unsupported cell type.');\n if (\n cell.type === 'number' &&\n (typeof cell.value !== 'number' || !Number.isFinite(cell.value))\n )\n invalid('Invalid numeric cell.');\n if (\n cell.type === 'date' &&\n (!(cell.value instanceof Date) ||\n !Number.isFinite(cell.value.getTime()))\n )\n invalid('Invalid date cell.');\n if (cell.type === 'boolean' && typeof cell.value !== 'boolean')\n invalid('Invalid boolean cell.');\n if (cell.type === 'text' && typeof cell.value !== 'string')\n invalid('Invalid text cell.');\n if (typeof cell.value === 'string')\n checkLimit(cell.value.length, 'maxXmlText', limits);\n if (cell.numberFormat)\n checkLimit(cell.numberFormat.length, 'maxXmlText', limits);\n if (cell.formula?.arrayRange) boundRange(cell.formula.arrayRange);\n if (cell.formula)\n checkLimit(cell.formula.text.length, 'maxFormulaLength', limits);\n }\n }\n}\n","import {\n checkLimit,\n invalid,\n SpreadsheetError,\n type SpreadsheetLimits,\n WorkBudget,\n} from './errors.js';\nimport { validateWorkbook } from './io.js';\nimport { type Cell, createSheet, type Workbook } from './model.js';\nimport type { ReadOptions, WriteOptions } from './types.js';\n\nfunction delimiterOption(value: string): string {\n if (value.length !== 1 || /[\"\\r\\n\\0]/.test(value))\n throw new SpreadsheetError(\n 'INVALID_INPUT',\n 'CSV delimiter must be one non-quote, non-newline character.',\n );\n return value;\n}\nfunction detect(text: string): string {\n const counts = new Map([\n [',', 0],\n [';', 0],\n ['\\t', 0],\n ['|', 0],\n ]);\n let quoted = false;\n for (let i = 0; i < text.length; i++) {\n const c = text[i];\n if (c === '\"') {\n if (quoted && text[i + 1] === '\"') i++;\n else quoted = !quoted;\n } else if (!quoted) {\n if (c === '\\r' || c === '\\n') break;\n if (counts.has(c)) counts.set(c, (counts.get(c) ?? 0) + 1);\n }\n }\n return [...counts].sort((a, b) => b[1] - a[1])[0][0];\n}\nexport function readCsv(\n bytes: Uint8Array,\n limits: SpreadsheetLimits,\n options: ReadOptions,\n): Workbook {\n let text: string;\n try {\n text = new TextDecoder('utf-8', { fatal: true })\n .decode(bytes)\n .replace(/^\\uFEFF/, '');\n } catch {\n throw new SpreadsheetError('INVALID_INPUT', 'CSV must be valid UTF-8.');\n }\n const work = new WorkBudget(limits.maxReadWork, 'maxReadWork');\n work.spend(text.length);\n const delimiter = delimiterOption(options.delimiter ?? detect(text));\n const sheet = createSheet(options.sheetName ?? 'Sheet1');\n let row = 1;\n let col = 1;\n let field = '';\n let state: 'start' | 'plain' | 'quoted' | 'closed' = 'start';\n let record = false;\n const flush = () => {\n work.spend(field.length + 1);\n checkLimit(sheet.cells.size + 1, 'maxCells', limits);\n checkLimit(row, 'maxRows', limits);\n checkLimit(col, 'maxColumns', limits);\n sheet.cells.set(row, col++, csvCell(field));\n field = '';\n state = 'start';\n record = true;\n };\n for (let i = 0; i < text.length; i++) {\n const c = text[i];\n if (state === 'quoted') {\n if (c === '\"') {\n if (text[i + 1] === '\"') {\n field += '\"';\n i++;\n } else state = 'closed';\n } else field += c;\n } else if (c === delimiter) flush();\n else if (c === '\\r' || c === '\\n') {\n flush();\n if (c === '\\r' && text[i + 1] === '\\n') i++;\n row++;\n col = 1;\n record = false;\n } else if (c === '\"' && state === 'start') state = 'quoted';\n else {\n if (state === 'closed' || c === '\"')\n throw new SpreadsheetError('INVALID_INPUT', 'Malformed CSV quoting.');\n field += c;\n state = 'plain';\n }\n checkLimit(field.length, 'maxXmlText', limits);\n }\n if (state === 'quoted')\n throw new SpreadsheetError('INVALID_INPUT', 'Unterminated CSV field.');\n if (record || field.length || state !== 'start') flush();\n return {\n sheets: [sheet],\n definedNames: [],\n dateSystem: 1900,\n source: { format: 'csv' },\n };\n}\nfunction csvCell(text: string): Cell {\n const base = {\n originalText: text,\n numberFormat: 'General',\n formatKind: 'general' as const,\n };\n if (!text.length) return { ...base, value: null, type: 'empty' };\n if (/^(true|false)$/i.test(text))\n return { ...base, value: text.toLowerCase() === 'true', type: 'boolean' };\n // Leading zeroes, whitespace, unsafe integers and non-finite values stay text.\n if (/^-?(?:0|[1-9]\\d*)(?:\\.\\d+)?(?:[eE][+-]?\\d+)?$/.test(text)) {\n const value = Number(text);\n if (\n Number.isFinite(value) &&\n Math.abs(value) <= Number.MAX_SAFE_INTEGER &&\n text.replace(/[^\\d]/g, '').length <= 15\n )\n return { ...base, value, type: 'number' };\n }\n if (/^\\d{4}-\\d{2}-\\d{2}(?:T\\d{2}:\\d{2}:\\d{2}(?:\\.\\d{1,3})?Z)?$/.test(text)) {\n const value = new Date(text);\n if (\n Number.isFinite(value.getTime()) &&\n value.toISOString().slice(0, 10) === text.slice(0, 10)\n )\n return {\n ...base,\n value,\n type: 'date',\n numberFormat: text.includes('T')\n ? 'yyyy-mm-dd\"T\"hh:mm:ss'\n : 'yyyy-mm-dd',\n formatKind: text.includes('T') ? 'datetime' : 'date',\n };\n }\n return { ...base, value: text, type: 'text' };\n}\nexport function writeCsv(\n workbook: Workbook,\n limits: SpreadsheetLimits,\n options: WriteOptions,\n): Uint8Array {\n validateWorkbook(workbook, limits);\n if (workbook.sheets.length !== 1)\n invalid('CSV requires exactly one worksheet.');\n const delimiter = delimiterOption(options.delimiter ?? ',');\n const sheet = workbook.sheets[0];\n let lastRow = 0;\n let lastCol = 0;\n for (const [p] of sheet.cells) {\n lastRow = Math.max(lastRow, p.row);\n lastCol = Math.max(lastCol, p.col);\n }\n // Dense CSV expansion of sparse coordinates is explicitly bounded.\n checkLimit(lastRow * lastCol, 'maxCells', limits);\n let output = options.bom ? '\\uFEFF' : '';\n let outputUnits = output.length;\n for (let row = 1; row <= lastRow; row++) {\n const fields: string[] = [];\n for (let col = 1; col <= lastCol; col++) {\n const cell = sheet.cells.get(row, col);\n const value =\n !cell || cell.value === null\n ? ''\n : cell.value instanceof Date\n ? cell.value.toISOString()\n : String(cell.value);\n // Preserve lexical input only when it still describes the current value.\n const original = cell?.originalText;\n if (original !== undefined)\n checkLimit(original.length, 'maxXmlText', limits);\n const parsed = original === undefined ? undefined : csvCell(original);\n const same =\n parsed &&\n cell &&\n parsed.type === cell.type &&\n (parsed.value instanceof Date && cell.value instanceof Date\n ? parsed.value.getTime() === cell.value.getTime()\n : parsed.value === cell.value);\n const field = same ? (original as string) : value;\n // Bound each field before escaping or retaining a dense output row.\n outputUnits += field.length + 1;\n checkLimit(outputUnits, 'maxInputBytes', limits);\n fields.push(\n field.includes(delimiter) || /[\"\\r\\n]/.test(field)\n ? `\"${field.replace(/\"/g, '\"\"')}\"`\n : field,\n );\n }\n outputUnits++;\n checkLimit(outputUnits, 'maxInputBytes', limits);\n output += `${fields.join(delimiter)}\\r\\n`;\n checkLimit(output.length, 'maxInputBytes', limits);\n }\n const bytes = new TextEncoder().encode(output);\n checkLimit(bytes.length, 'maxInputBytes', limits);\n return bytes;\n}\n","import type { FormatKind } from './model.js';\n\nexport const BUILTIN_FORMATS: Record<number, string> = {\n 0: 'General',\n 1: '0',\n 2: '0.00',\n 3: '#,##0',\n 4: '#,##0.00',\n 5: '\"$\"#,##0_);(\"$\"#,##0)',\n 6: '\"$\"#,##0_);[Red](\"$\"#,##0)',\n 7: '\"$\"#,##0.00_);(\"$\"#,##0.00)',\n 8: '\"$\"#,##0.00_);[Red](\"$\"#,##0.00)',\n 9: '0%',\n 10: '0.00%',\n 11: '0.00E+00',\n 12: '# ?/?',\n 13: '# ??/??',\n 14: 'mm-dd-yy',\n 15: 'd-mmm-yy',\n 16: 'd-mmm',\n 17: 'mmm-yy',\n 18: 'h:mm AM/PM',\n 19: 'h:mm:ss AM/PM',\n 20: 'h:mm',\n 21: 'h:mm:ss',\n 22: 'm/d/yy h:mm',\n 27: 'yyyy-mm-dd',\n 28: 'yyyy-mm-dd',\n 29: 'yyyy-mm-dd',\n 30: 'm/d/yy',\n 31: 'yyyy-mm-dd',\n 32: 'h:mm',\n 33: 'h:mm:ss',\n 34: 'yyyy-mm',\n 35: 'm-d',\n 36: 'yyyy-mm-dd',\n 37: '#,##0 ;(#,##0)',\n 38: '#,##0 ;[Red](#,##0)',\n 39: '#,##0.00;(#,##0.00)',\n 40: '#,##0.00;[Red](#,##0.00)',\n 41: '_(* #,##0_);_(* (#,##0);_(* \"-\"_);_(@_)',\n 42: '_($* #,##0_);_($* (#,##0);_($* \"-\"_);_(@_)',\n 43: '_(* #,##0.00_);_(* (#,##0.00);_(* \"-\"??_);_(@_)',\n 44: '_($* #,##0.00_);_($* (#,##0.00);_($* \"-\"??_);_(@_)',\n 45: 'mm:ss',\n 46: '[h]:mm:ss',\n 47: 'mmss.0',\n 48: '##0.0E+0',\n 49: '@',\n 50: 'yyyy-mm-dd',\n 51: 'yyyy-mm-dd',\n 52: 'yyyy-mm',\n 53: 'm-d',\n 54: 'yyyy-mm-dd',\n 55: 'h:mm',\n 56: 'h:mm:ss',\n 57: 'yyyy-mm',\n 58: 'm-d',\n};\nexport function formatKind(format = 'General'): FormatKind {\n if (format.toLowerCase() === 'general') return 'general';\n let currency = false;\n let date = false;\n let time = false;\n let month = false;\n let percent = false;\n let text = false;\n const money = (c: string) => '$€£¥₹₩₽'.includes(c);\n for (let i = 0; i < format.length; i++) {\n const c = format[i];\n if (c === '\\\\' || c === '_' || c === '*') {\n i++;\n continue;\n }\n if (c === '\"') {\n while (++i < format.length && format[i] !== '\"')\n if (money(format[i])) currency = true;\n continue;\n }\n if (c === '[') {\n const from = ++i;\n while (i < format.length && format[i] !== ']') i++;\n const part = format.slice(from, i).toLowerCase();\n if (\n part === 'h' ||\n part === 'hh' ||\n part === 's' ||\n part === 'ss' ||\n part === 'm' ||\n part === 'mm'\n )\n time = true;\n if (part.startsWith('$') && !part.startsWith('$-')) currency = true;\n continue;\n }\n if (money(c)) currency = true;\n const lower = c.toLowerCase();\n if (lower === 'y' || lower === 'd') date = true;\n if (lower === 'h' || lower === 's') time = true;\n if (lower === 'm') month = true;\n if (c === '%') percent = true;\n if (c === '@') text = true;\n }\n if (date && time) return 'datetime';\n if (date || (month && !time)) return 'date';\n if (time) return 'time';\n if (percent) return 'percent';\n if (currency) return 'currency';\n if (text) return 'text';\n return 'number';\n}\nconst day = 86400000;\n/** Serial 60 maps to 1900-02-28; raw preserves Excel's fictitious 1900-02-29. */\nexport function serialDate(serial: number, system: 1900 | 1904): Date {\n const epoch = system === 1904 ? Date.UTC(1904, 0, 1) : Date.UTC(1899, 11, 31);\n return new Date(\n epoch +\n Math.round((serial - (system === 1900 && serial >= 60 ? 1 : 0)) * day),\n );\n}\nexport function dateSerial(date: Date, system: 1900 | 1904): number {\n const epoch = system === 1904 ? Date.UTC(1904, 0, 1) : Date.UTC(1899, 11, 31);\n const value = (date.getTime() - epoch) / day;\n return value + (system === 1900 && value >= 60 ? 1 : 0);\n}\n","import {\n checkLimit,\n DEFAULT_LIMITS,\n invalid,\n type SpreadsheetLimits,\n WorkBudget,\n} from './errors.js';\nimport {\n address,\n columnName,\n type Formula,\n type Point,\n point,\n type Reference,\n} from './model.js';\n\nexport interface ReferenceToken {\n from: number;\n to: number;\n reference: Reference;\n}\nexport interface ArgumentSpan {\n from: number;\n to: number;\n refStart: number;\n refEnd: number;\n}\nexport interface CallToken {\n name: string;\n from: number;\n to: number;\n args: ArgumentSpan[];\n}\nexport interface FormulaScan {\n text: string;\n references: ReferenceToken[];\n calls: CallToken[];\n functions: string[];\n}\ninterface Lexeme {\n kind: 'atom' | 'quoted' | 'bracket' | 'punct' | 'error';\n from: number;\n to: number;\n}\nconst noFlags = {\n startRow: false,\n startCol: false,\n endRow: false,\n endCol: false,\n};\nconst atomChar = (c: string) => c !== '' && /[\\p{L}\\p{N}_.$\\\\]/u.test(c);\nconst atomStart = (c: string) => c !== '' && /[\\p{L}_\\\\$]/u.test(c);\nconst cloneReference = (r: Reference): Reference => ({\n ...r,\n range: { start: { ...r.range.start }, end: { ...r.range.end } },\n absolute: { ...r.absolute },\n});\nconst formulaScans = new WeakMap<Formula, FormulaScan>();\n\n/** Operation-local cache. Lexing and call/argument construction are linear passes. */\nexport class FormulaScanner {\n private readonly cache = new Map<string, FormulaScan>();\n private readonly budget: WorkBudget;\n constructor(\n readonly limits: SpreadsheetLimits = { ...DEFAULT_LIMITS },\n private readonly charge: (n: number) => void = () => {},\n ) {\n this.budget = new WorkBudget(limits.maxFormulaWork, 'maxFormulaWork');\n }\n spend(n = 1): void {\n this.budget.spend(n);\n this.charge(n);\n }\n scan(input: string): FormulaScan {\n const text = input.startsWith('=') ? input.slice(1) : input;\n checkLimit(text.length, 'maxFormulaLength', this.limits);\n this.spend();\n const cached = this.cache.get(text);\n if (cached) return cached;\n this.spend(text.length);\n const lexemes: Lexeme[] = [];\n const push = (kind: Lexeme['kind'], from: number, to: number) => {\n checkLimit(lexemes.length + 1, 'maxFormulaTokens', this.limits);\n lexemes.push({ kind, from, to });\n };\n let i = 0;\n while (i < text.length) {\n const from = i;\n const c = text[i++];\n if (/\\s/.test(c)) continue;\n if (c === '#') {\n const error =\n /^(?:REF!|DIV\\/0!|VALUE!|NAME\\?|N\\/A|NUM!|NULL!|SPILL!|CALC!|GETTING_DATA)/i.exec(\n text.slice(i),\n );\n if (error) {\n i += error[0].length;\n push('error', from, i);\n } else push('punct', from, i);\n } else if (c === '\"' || c === \"'\") {\n while (i < text.length)\n if (text[i++] === c) {\n if (text[i] === c) i++;\n else break;\n }\n if (c === \"'\") push('quoted', from, i);\n } else if (c === '[') {\n let depth = 1;\n while (i < text.length && depth) {\n const next = text[i++];\n if (next === '[') checkLimit(++depth, 'maxFormulaDepth', this.limits);\n else if (next === ']') depth--;\n }\n push('bracket', from, i);\n } else if (atomChar(c)) {\n while (i < text.length && atomChar(text[i])) i++;\n push('atom', from, i);\n } else push('punct', from, i);\n }\n const references: ReferenceToken[] = [];\n const calls: CallToken[] = [];\n const functions = new Set<string>();\n const stack: { call?: CallToken; start: number; refStart: number }[] = [];\n const raw = (token: Lexeme | undefined) =>\n token ? text.slice(token.from, token.to) : '';\n const argument = (frame: (typeof stack)[number], to: number) => {\n frame.call?.args.push({\n from: frame.start,\n to,\n refStart: frame.refStart,\n refEnd: references.length,\n });\n };\n for (let t = 0; t < lexemes.length; t++) {\n this.spend();\n const token = lexemes[t];\n const value = raw(token);\n if (value === '(') {\n checkLimit(stack.length + 1, 'maxFormulaDepth', this.limits);\n const previous = lexemes[t - 1];\n let call: CallToken | undefined;\n if (previous?.kind === 'atom' && atomStart(raw(previous)[0] ?? '')) {\n const name = raw(previous)\n .replace(/^_xlfn\\./i, '')\n .toUpperCase();\n call = { name, from: previous.from, to: text.length, args: [] };\n calls.push(call);\n functions.add(name);\n }\n stack.push({ call, start: token.to, refStart: references.length });\n continue;\n }\n if (value === ')') {\n const frame = stack.pop();\n if (frame) {\n argument(frame, token.from);\n if (frame.call) frame.call.to = token.to;\n }\n continue;\n }\n if (value === ',' || value === ';') {\n const frame = stack[stack.length - 1];\n if (frame) {\n argument(frame, token.from);\n frame.start = token.to;\n frame.refStart = references.length;\n }\n continue;\n }\n if (token.kind === 'punct') continue;\n let sheet: string | undefined;\n let target = token;\n if (raw(lexemes[t + 1]) === '!') {\n sheet =\n token.kind === 'quoted'\n ? value.slice(1, -1).replace(/''/g, \"'\")\n : value;\n t += 2;\n target = lexemes[t];\n if (!target) break;\n } else if (token.kind === 'quoted') continue;\n if (target.kind === 'error') {\n if (raw(target).toUpperCase() === '#REF!')\n references.push({\n from: token.from,\n to: target.to,\n reference: {\n sheet,\n name: '#REF!',\n range: { start: { row: 1, col: 1 }, end: { row: 1, col: 1 } },\n absolute: { ...noFlags },\n },\n });\n continue;\n }\n let name = raw(target);\n let to = target.to;\n const after = lexemes[t + 1];\n if (raw(after) === '(') continue;\n if (after?.kind === 'bracket' && target.kind === 'atom') {\n name += raw(after);\n to = after.to;\n t++;\n }\n let end: string | undefined;\n if (raw(lexemes[t + 1]) === ':' && lexemes[t + 2]?.kind === 'atom') {\n end = raw(lexemes[t + 2]);\n to = lexemes[t + 2].to;\n t += 2;\n }\n let reference = a1Reference(name, end, sheet);\n if (\n !reference &&\n (target.kind === 'bracket' || atomStart(name[0] ?? '')) &&\n !['TRUE', 'FALSE'].includes(name.toUpperCase())\n ) {\n reference = {\n sheet,\n name,\n range: { start: { row: 1, col: 1 }, end: { row: 1, col: 1 } },\n absolute: { ...noFlags },\n };\n }\n if (reference) references.push({ from: token.from, to, reference });\n }\n // Unclosed parentheses retain text and partial evidence; depth is still bounded.\n for (const frame of stack) argument(frame, text.length);\n const scan = { text, references, calls, functions: [...functions] };\n // Saturation affects reuse only; every uncached scan still spends work.\n if (this.cache.size < this.limits.maxFormulaCacheEntries)\n this.cache.set(text, scan);\n return scan;\n }\n}\nfunction a1Reference(\n start: string,\n end: string | undefined,\n sheet: string | undefined,\n): Reference | undefined {\n const cell = (s: string) => /^\\$?[A-Za-z]{1,3}\\$?[1-9]\\d{0,6}$/.test(s);\n const col = (s: string) => /^\\$?[A-Za-z]{1,3}$/.test(s);\n const row = (s: string) => /^\\$?[1-9]\\d{0,6}$/.test(s);\n const flags = {\n startRow: /\\$\\d/.test(start),\n startCol: start.startsWith('$'),\n endRow: /\\$\\d/.test(end ?? start),\n endCol: (end ?? start).startsWith('$'),\n };\n try {\n if (cell(start) && (!end || cell(end)))\n return {\n sheet,\n range: { start: point(start), end: point(end ?? start) },\n absolute: flags,\n };\n if (end && col(start) && col(end))\n return {\n sheet,\n range: { start: point(`${start}1`), end: point(`${end}1048576`) },\n absolute: { ...flags, startRow: true, endRow: true },\n };\n if (end && row(start) && row(end))\n return {\n sheet,\n range: { start: point(`A${start}`), end: point(`XFD${end}`) },\n absolute: { ...flags, startCol: true, endCol: true },\n };\n } catch {\n /* Out-of-grid identifiers remain unresolved names. */\n }\n return undefined;\n}\nexport function referenceTokens(\n text: string,\n scanner = new FormulaScanner(),\n): ReferenceToken[] {\n return scanner.scan(text).references;\n}\nexport function parseFormula(\n input: string,\n limits: SpreadsheetLimits = { ...DEFAULT_LIMITS },\n scanner = new FormulaScanner(limits),\n): Formula {\n const scan = scanner.scan(input);\n scanner.spend(scan.references.length + scan.functions.length);\n const formula: Formula = {\n text: scan.text,\n dialect: 'excel-a1',\n references: scan.references.map((t) => cloneReference(t.reference)),\n functions: [...scan.functions],\n };\n formulaScans.set(formula, scan);\n return formula;\n}\nexport function translateFormula(\n text: string,\n from: Point,\n to: Point,\n limits: SpreadsheetLimits,\n scanner = new FormulaScanner(limits),\n): Formula {\n const scan = scanner.scan(text);\n scanner.spend(scan.text.length + scan.references.length);\n const parts: string[] = [];\n let offset = 0;\n for (const token of scan.references) {\n parts.push(scan.text.slice(offset, token.from));\n const ref = token.reference;\n if (ref.name) parts.push(scan.text.slice(token.from, token.to));\n else {\n const move = (p: Point, rowAbs: boolean, colAbs: boolean) => {\n const row = p.row + (rowAbs ? 0 : to.row - from.row);\n const col = p.col + (colAbs ? 0 : to.col - from.col);\n if (row < 1 || row > 1048576 || col < 1 || col > 16384)\n invalid('Shared formula translation exceeds worksheet bounds.');\n return `${colAbs ? '$' : ''}${columnName(col)}${rowAbs ? '$' : ''}${row}`;\n };\n parts.push(\n (ref.sheet ? `'${ref.sheet.replace(/'/g, \"''\")}'!` : '') +\n move(ref.range.start, ref.absolute.startRow, ref.absolute.startCol),\n );\n if (address(ref.range.start) !== address(ref.range.end))\n parts.push(\n `:${move(ref.range.end, ref.absolute.endRow, ref.absolute.endCol)}`,\n );\n }\n offset = token.to;\n }\n parts.push(scan.text.slice(offset));\n return parseFormula(parts.join(''), limits, scanner);\n}\nexport function normalizeFormula(\n formula: Formula,\n origin: Point,\n scanner?: FormulaScanner,\n): string {\n const engine = scanner ?? new FormulaScanner();\n const saved = formulaScans.get(formula);\n const scan =\n !scanner && saved?.text === formula.text\n ? saved\n : engine.scan(formula.text);\n engine.spend(scan.text.length + scan.references.length);\n const parts: string[] = [];\n let offset = 0;\n for (const { from, to, reference: ref } of scan.references) {\n parts.push(scan.text.slice(offset, from));\n if (ref.name) parts.push(scan.text.slice(from, to));\n else {\n const format = (p: Point, rowAbs: boolean, colAbs: boolean) =>\n `R${rowAbs ? p.row : `[${p.row - origin.row}]`}C${colAbs ? p.col : `[${p.col - origin.col}]`}`;\n parts.push(\n (ref.sheet ? `'${ref.sheet.replace(/'/g, \"''\")}'!` : '') +\n format(ref.range.start, ref.absolute.startRow, ref.absolute.startCol),\n );\n if (address(ref.range.start) !== address(ref.range.end))\n parts.push(\n `:${format(ref.range.end, ref.absolute.endRow, ref.absolute.endCol)}`,\n );\n }\n offset = to;\n }\n parts.push(scan.text.slice(offset));\n return parts.join('');\n}\nexport function directReference(\n input: string,\n scanner = new FormulaScanner(),\n): Reference | undefined {\n const text = input.replace(/^=/, '').trim();\n const scan = scanner.scan(text);\n return scan.references.length === 1 &&\n scan.references[0].from === 0 &&\n scan.references[0].to === text.length\n ? cloneReference(scan.references[0].reference)\n : undefined;\n}\n","import { checkLimit, invalid, type SpreadsheetLimits } from './errors.js';\nimport { directReference, type FormulaScanner } from './formula.js';\nimport type {\n DefinedName,\n Point,\n Reference,\n Table,\n Workbook,\n} from './model.js';\n\ninterface IndexedTable {\n sheet: string;\n table: Table;\n columns: Map<string, number>;\n}\ninterface TableInterval {\n start: number;\n end: number;\n value: IndexedTable;\n}\ninterface Selector {\n table: string;\n columns: string[];\n thisRow: boolean;\n headers: boolean;\n all: boolean;\n}\n\n/** Built once per read/profile. All per-reference lookups use maps or binary search. */\nexport class WorkbookIndex {\n private readonly globals = new Map<string, DefinedName>();\n private readonly locals = new Map<string, Map<string, DefinedName>>();\n private readonly tables = new Map<string, IndexedTable>();\n private readonly contextual = new Map<string, Map<number, TableInterval[]>>();\n private readonly selectors = new Map<string, Selector | undefined>();\n constructor(\n workbook: Workbook,\n limits: SpreadsheetLimits,\n scanner: FormulaScanner,\n private readonly spend: (n?: number) => void,\n ) {\n checkLimit(workbook.sheets.length, 'maxSheets', limits);\n checkLimit(workbook.definedNames.length, 'maxDefinedNames', limits);\n for (let defined of workbook.definedNames) {\n spend(defined.name.length + (defined.scope?.length ?? 0) + 1);\n const name = defined.name.toLowerCase();\n if (!defined.reference)\n defined = {\n ...defined,\n reference: directReference(defined.text, scanner),\n };\n if (defined.scope === undefined) {\n if (this.globals.has(name)) invalid('Duplicate defined name.');\n this.globals.set(name, defined);\n } else {\n const scope = defined.scope.toLowerCase();\n let names = this.locals.get(scope);\n if (!names) {\n names = new Map();\n this.locals.set(scope, names);\n }\n if (names.has(name)) invalid('Duplicate defined name.');\n names.set(name, defined);\n }\n }\n let count = 0;\n let merges = 0;\n let validations = 0;\n for (const sheet of workbook.sheets) {\n merges += sheet.merges.length;\n checkLimit(sheet.validations.length, 'maxDataValidations', limits);\n for (const validation of sheet.validations) {\n spend();\n validations += Math.max(1, validation.ranges.length);\n }\n checkLimit(merges, 'maxMerges', limits);\n checkLimit(validations, 'maxDataValidations', limits);\n let cols = this.contextual.get(sheet.name.toLowerCase());\n if (!cols) {\n cols = new Map();\n this.contextual.set(sheet.name.toLowerCase(), cols);\n }\n for (const table of sheet.tables) {\n checkLimit(++count, 'maxTables', limits);\n spend(table.name.length + 1);\n const indexed: IndexedTable = {\n sheet: sheet.name,\n table,\n columns: new Map(),\n };\n table.columns.forEach((name, i) => {\n spend(name.length + 1);\n indexed.columns.set(name.toLowerCase(), i);\n });\n const key = table.name.toLowerCase();\n if (this.tables.has(key)) invalid('Duplicate table name.');\n this.tables.set(key, indexed);\n checkLimit(table.range.end.col, 'maxColumns', limits);\n for (\n let col = table.range.start.col;\n col <= table.range.end.col;\n col++\n ) {\n spend();\n let intervals = cols.get(col);\n if (!intervals) {\n intervals = [];\n cols.set(col, intervals);\n }\n intervals.push({\n start: table.range.start.row,\n end: table.range.end.row,\n value: indexed,\n });\n }\n }\n }\n for (const cols of this.contextual.values())\n for (const intervals of cols.values()) {\n intervals.sort((a, b) => {\n spend();\n return a.start - b.start;\n });\n for (let i = 1; i < intervals.length; i++) {\n spend();\n if (intervals[i].start <= intervals[i - 1].end)\n invalid('Overlapping tables.');\n }\n }\n }\n resolve(\n reference: Reference,\n sheet: string,\n origin: Point,\n ): Reference | undefined {\n if (reference.name === '#REF!') return undefined;\n if (!reference.name) {\n this.spend();\n return reference;\n }\n const original = reference.name;\n let current = reference;\n let local = reference.sheet ?? sheet;\n // Bounded alias traversal, without recursion or repeated workbook scans.\n for (let depth = 0; depth < 32; depth++) {\n const text = current.name;\n if (!text)\n return { ...current, sheet: current.sheet ?? local, name: original };\n this.spend(text.length + local.length + 1);\n const key = text.toLowerCase();\n const scope = (current.sheet ?? local).toLowerCase();\n const defined = this.locals.get(scope)?.get(key) ?? this.globals.get(key);\n if (defined?.reference) {\n local = defined.scope ?? local;\n current = defined.reference;\n continue;\n }\n const selector = this.selector(text);\n if (!selector) return undefined;\n const found = selector.table\n ? this.tables.get(selector.table)\n : this.at(scope, origin);\n if (!found) return undefined;\n const r = found.table.range;\n let start = r.start.col;\n let end = r.end.col;\n if (selector.columns.length) {\n start = 16384;\n end = 0;\n for (const name of selector.columns) {\n this.spend(name.length + 1);\n const col = found.columns.get(name);\n if (col === undefined) return undefined;\n start = Math.min(start, r.start.col + col);\n end = Math.max(end, r.start.col + col);\n }\n }\n return {\n ...reference,\n sheet: found.sheet,\n range: {\n start: {\n row: selector.thisRow\n ? origin.row\n : selector.headers || selector.all\n ? r.start.row\n : r.start.row + (found.table.headerRow ? 1 : 0),\n col: start,\n },\n end: {\n row: selector.thisRow\n ? origin.row\n : selector.headers\n ? r.start.row\n : selector.all\n ? r.end.row\n : r.end.row - (found.table.totalsRow ? 1 : 0),\n col: end,\n },\n },\n };\n }\n // Cyclic names remain unresolved. The fixed traversal depth bounds each lookup.\n return undefined;\n }\n private at(sheet: string, origin: Point): IndexedTable | undefined {\n const rows = this.contextual.get(sheet)?.get(origin.col);\n if (!rows) return undefined;\n let lo = 0;\n let hi = rows.length - 1;\n while (lo <= hi) {\n this.spend();\n const mid = (lo + hi) >>> 1;\n const interval = rows[mid];\n if (origin.row < interval.start) hi = mid - 1;\n else if (origin.row > interval.end) lo = mid + 1;\n else return interval.value;\n }\n return undefined;\n }\n private selector(text: string): Selector | undefined {\n if (this.selectors.has(text)) return this.selectors.get(text);\n this.spend(text.length);\n const open = text.indexOf('[');\n if (open < 0 || !text.endsWith(']')) {\n this.selectors.set(text, undefined);\n return undefined;\n }\n const selector: Selector = {\n table: text.slice(0, open).toLowerCase(),\n columns: [],\n thisRow: false,\n headers: false,\n all: false,\n };\n let part = '';\n const flush = () => {\n let name = part.trim();\n part = '';\n if (!name) return;\n if (name.startsWith('@')) {\n selector.thisRow = true;\n name = name.slice(1);\n }\n if (name === '#This Row') selector.thisRow = true;\n else if (name === '#Headers') selector.headers = true;\n else if (name === '#All') selector.all = true;\n else if (!name.startsWith('#') && name)\n selector.columns.push(name.toLowerCase());\n };\n for (let i = open + 1; i < text.length; i++) {\n const c = text[i];\n if (c === '[' || c === ']' || c === ',' || c === ':') flush();\n else part += c;\n }\n flush();\n this.selectors.set(text, selector);\n return selector;\n }\n}\n","import {\n checkLimit,\n SpreadsheetError,\n type SpreadsheetLimits,\n} from './errors.js';\n\nexport interface XmlNode {\n name: string;\n attrs: Record<string, string>;\n children: XmlNode[];\n text: string;\n}\nexport function children(node: XmlNode, name: string): XmlNode[] {\n return node.children.filter((n) => n.name === name);\n}\nexport function child(node: XmlNode, name: string): XmlNode | undefined {\n return node.children.find((n) => n.name === name);\n}\nexport function textContent(node: XmlNode): string {\n return node.text + node.children.map(textContent).join('');\n}\nfunction fail(): never {\n throw new SpreadsheetError(\n 'INVALID_XML',\n 'Invalid or unsafe spreadsheet XML.',\n );\n}\nfunction xmlChar(n: number): boolean {\n return (\n n === 9 ||\n n === 10 ||\n n === 13 ||\n (n >= 32 && n <= 0xd7ff) ||\n (n >= 0xe000 && n <= 0xfffd) ||\n (n >= 0x10000 && n <= 0x10ffff)\n );\n}\nfunction decode(value: string): string {\n if (/&(?!amp;|lt;|gt;|quot;|apos;|#\\d+;|#x[\\da-fA-F]+;)/.test(value)) fail();\n return value.replace(\n /&(amp|lt|gt|quot|apos|#\\d+|#x[\\da-fA-F]+);/g,\n (_, entity: string) => {\n const named: Record<string, string> = {\n amp: '&',\n lt: '<',\n gt: '>',\n quot: '\"',\n apos: \"'\",\n };\n if (entity in named) return named[entity];\n const n =\n entity[1] === 'x'\n ? Number.parseInt(entity.slice(2), 16)\n : Number(entity.slice(1));\n if (!xmlChar(n)) fail();\n return String.fromCodePoint(n);\n },\n );\n}\n\n/** Deliberately small OOXML tokenizer. No declarations, DTDs or custom entities. */\nexport function parseXml(\n bytes: Uint8Array,\n limits: SpreadsheetLimits,\n allocate: () => void = () => {},\n): XmlNode {\n let xml: string;\n try {\n xml = new TextDecoder('utf-8', { fatal: true }).decode(bytes);\n } catch {\n fail();\n }\n xml = xml.replace(/\\r\\n?/g, '\\n');\n for (const c of xml) if (!xmlChar(c.codePointAt(0) ?? 0)) fail();\n const root: XmlNode = { name: '', attrs: {}, children: [], text: '' };\n const stack = [root];\n const names = [''];\n let i = 0;\n let nodes = 0;\n let textSize = 0;\n const addText = (value: string, literal = false) => {\n textSize += value.length;\n checkLimit(textSize, 'maxXmlText', limits);\n if (stack.length === 1 && value.trim()) fail();\n stack[stack.length - 1].text += literal ? value : decode(value);\n };\n while (i < xml.length) {\n if (xml[i] !== '<') {\n const end = xml.indexOf('<', i);\n const stop = end < 0 ? xml.length : end;\n addText(xml.slice(i, stop));\n i = stop;\n continue;\n }\n if (xml.startsWith('<!--', i)) {\n const end = xml.indexOf('-->', i + 4);\n if (end < 0 || xml.slice(i + 4, end).includes('--')) fail();\n i = end + 3;\n continue;\n }\n if (xml.startsWith('<![CDATA[', i)) {\n const end = xml.indexOf(']]>', i + 9);\n if (end < 0) fail();\n addText(xml.slice(i + 9, end), true);\n i = end + 3;\n continue;\n }\n if (xml.startsWith('<?', i)) {\n const end = xml.indexOf('?>', i + 2);\n if (end < 0) fail();\n i = end + 2;\n continue;\n }\n if (xml.startsWith('<!', i)) fail();\n const closing = xml[i + 1] === '/';\n i += closing ? 2 : 1;\n const nameMatch = /^[A-Za-z_][\\w.:-]*/.exec(xml.slice(i));\n if (!nameMatch) fail();\n const fullName = nameMatch[0];\n i += fullName.length;\n if (closing) {\n while (/\\s/.test(xml[i] ?? '') && i < xml.length) i++;\n if (xml[i++] !== '>' || stack.length === 1 || names.pop() !== fullName)\n fail();\n stack.pop();\n continue;\n }\n const attrs: Record<string, string> = Object.create(null);\n let selfClosing = false;\n while (true) {\n const before = i;\n while (i < xml.length && /\\s/.test(xml[i])) i++;\n if (xml.startsWith('/>', i)) {\n selfClosing = true;\n i += 2;\n break;\n }\n if (xml[i] === '>') {\n i++;\n break;\n }\n if (i === before) fail();\n const match = /^([A-Za-z_][\\w.:-]*)\\s*=\\s*([\"'])/.exec(xml.slice(i));\n if (!match) fail();\n i += match[0].length;\n const end = xml.indexOf(match[2], i);\n if (end < 0) fail();\n const raw = xml.slice(i, end);\n if (raw.includes('<') || Object.hasOwn(attrs, match[1])) fail();\n textSize += raw.length;\n checkLimit(textSize, 'maxXmlText', limits);\n allocate();\n attrs[match[1]] = decode(raw.replace(/[\\t\\n]/g, ' '));\n i = end + 1;\n }\n checkLimit(++nodes, 'maxXmlNodes', limits);\n checkLimit(stack.length, 'maxXmlDepth', limits);\n allocate();\n const node: XmlNode = {\n name: fullName.split(':').pop() ?? fullName,\n attrs,\n children: [],\n text: '',\n };\n stack[stack.length - 1].children.push(node);\n if (!selfClosing) {\n stack.push(node);\n names.push(fullName);\n }\n }\n if (stack.length !== 1 || root.children.length !== 1) fail();\n return root.children[0];\n}\n\nexport function escapeXml(value: string): string {\n for (const c of value)\n if (!xmlChar(c.codePointAt(0) ?? 0))\n throw new SpreadsheetError(\n 'INVALID_INPUT',\n 'Invalid XML character in workbook.',\n );\n return value\n .replace(/&/g, '&')\n .replace(/</g, '<')\n .replace(/>/g, '>')\n .replace(/\"/g, '"')\n .replace(/'/g, ''')\n .replace(/\\r/g, ' ');\n}\n","// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Some of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar ch2 = {};\nvar wk = (function (c, id, msg, transfer, cb) {\n var w = new Worker(ch2[id] || (ch2[id] = URL.createObjectURL(new Blob([\n c + ';addEventListener(\"error\",function(e){e=e.error;postMessage({$e$:[e.message,e.code,e.stack]})})'\n ], { type: 'text/javascript' }))));\n w.onmessage = function (e) {\n var d = e.data, ed = d.$e$;\n if (ed) {\n var err = new Error(ed[0]);\n err['code'] = ed[1];\n err.stack = ed[2];\n cb(err, null);\n }\n else\n cb(null, d);\n };\n w.postMessage(msg, transfer);\n return w;\n});\n\n// aliases for shorter compressed code (most minifers don't do this)\nvar u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;\n// fixed length extra bits\nvar fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, /* unused */ 0, 0, /* impossible */ 0]);\n// fixed distance extra bits\nvar fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, /* unused */ 0, 0]);\n// code length index map\nvar clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);\n// get base, reverse index map from extra bits\nvar freb = function (eb, start) {\n var b = new u16(31);\n for (var i = 0; i < 31; ++i) {\n b[i] = start += 1 << eb[i - 1];\n }\n // numbers here are at max 18 bits\n var r = new i32(b[30]);\n for (var i = 1; i < 30; ++i) {\n for (var j = b[i]; j < b[i + 1]; ++j) {\n r[j] = ((j - b[i]) << 5) | i;\n }\n }\n return { b: b, r: r };\n};\nvar _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;\n// we can ignore the fact that the other numbers are wrong; they never happen anyway\nfl[28] = 258, revfl[258] = 28;\nvar _b = freb(fdeb, 0), fd = _b.b, revfd = _b.r;\n// map of value to reverse (assuming 16 bits)\nvar rev = new u16(32768);\nfor (var i = 0; i < 32768; ++i) {\n // reverse table algorithm from SO\n var x = ((i & 0xAAAA) >> 1) | ((i & 0x5555) << 1);\n x = ((x & 0xCCCC) >> 2) | ((x & 0x3333) << 2);\n x = ((x & 0xF0F0) >> 4) | ((x & 0x0F0F) << 4);\n rev[i] = (((x & 0xFF00) >> 8) | ((x & 0x00FF) << 8)) >> 1;\n}\n// create huffman tree from u8 \"map\": index -> code length for code index\n// mb (max bits) must be at most 15\n// TODO: optimize/split up?\nvar hMap = (function (cd, mb, r) {\n var s = cd.length;\n // index\n var i = 0;\n // u16 \"map\": index -> # of codes with bit length = index\n var l = new u16(mb);\n // length of cd must be 288 (total # of codes)\n for (; i < s; ++i) {\n if (cd[i])\n ++l[cd[i] - 1];\n }\n // u16 \"map\": index -> minimum code for bit length = index\n var le = new u16(mb);\n for (i = 1; i < mb; ++i) {\n le[i] = (le[i - 1] + l[i - 1]) << 1;\n }\n var co;\n if (r) {\n // u16 \"map\": index -> number of actual bits, symbol for code\n co = new u16(1 << mb);\n // bits to remove for reverser\n var rvb = 15 - mb;\n for (i = 0; i < s; ++i) {\n // ignore 0 lengths\n if (cd[i]) {\n // num encoding both symbol and bits read\n var sv = (i << 4) | cd[i];\n // free bits\n var r_1 = mb - cd[i];\n // start value\n var v = le[cd[i] - 1]++ << r_1;\n // m is end value\n for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {\n // every 16 bit value starting with the code yields the same result\n co[rev[v] >> rvb] = sv;\n }\n }\n }\n }\n else {\n co = new u16(s);\n for (i = 0; i < s; ++i) {\n if (cd[i]) {\n co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);\n }\n }\n }\n return co;\n});\n// fixed length tree\nvar flt = new u8(288);\nfor (var i = 0; i < 144; ++i)\n flt[i] = 8;\nfor (var i = 144; i < 256; ++i)\n flt[i] = 9;\nfor (var i = 256; i < 280; ++i)\n flt[i] = 7;\nfor (var i = 280; i < 288; ++i)\n flt[i] = 8;\n// fixed distance tree\nvar fdt = new u8(32);\nfor (var i = 0; i < 32; ++i)\n fdt[i] = 5;\n// fixed length map\nvar flm = /*#__PURE__*/ hMap(flt, 9, 0), flrm = /*#__PURE__*/ hMap(flt, 9, 1);\n// fixed distance map\nvar fdm = /*#__PURE__*/ hMap(fdt, 5, 0), fdrm = /*#__PURE__*/ hMap(fdt, 5, 1);\n// find max of array\nvar max = function (a) {\n var m = a[0];\n for (var i = 1; i < a.length; ++i) {\n if (a[i] > m)\n m = a[i];\n }\n return m;\n};\n// read d, starting at bit p and mask with m\nvar bits = function (d, p, m) {\n var o = (p / 8) | 0;\n return ((d[o] | (d[o + 1] << 8)) >> (p & 7)) & m;\n};\n// read d, starting at bit p continuing for at least 16 bits\nvar bits16 = function (d, p) {\n var o = (p / 8) | 0;\n return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >> (p & 7));\n};\n// get end of byte\nvar shft = function (p) { return ((p + 7) / 8) | 0; };\n// typed array slice - allows garbage collector to free original reference,\n// while being more compatible than .slice\nvar slc = function (v, s, e) {\n if (s == null || s < 0)\n s = 0;\n if (e == null || e > v.length)\n e = v.length;\n // can't use .constructor in case user-supplied\n return new u8(v.subarray(s, e));\n};\n/**\n * Codes for errors generated within this library\n */\nexport var FlateErrorCode = {\n UnexpectedEOF: 0,\n InvalidBlockType: 1,\n InvalidLengthLiteral: 2,\n InvalidDistance: 3,\n StreamFinished: 4,\n NoStreamHandler: 5,\n InvalidHeader: 6,\n NoCallback: 7,\n InvalidUTF8: 8,\n ExtraFieldTooLong: 9,\n InvalidDate: 10,\n FilenameTooLong: 11,\n StreamFinishing: 12,\n InvalidZipData: 13,\n UnknownCompressionMethod: 14\n};\n// error codes\nvar ec = [\n 'unexpected EOF',\n 'invalid block type',\n 'invalid length/literal',\n 'invalid distance',\n 'stream finished',\n 'no stream handler',\n ,\n 'no callback',\n 'invalid UTF-8 data',\n 'extra field too long',\n 'date not in range 1980-2099',\n 'filename too long',\n 'stream finishing',\n 'invalid zip data'\n // determined by unknown compression method\n];\n;\nvar err = function (ind, msg, nt) {\n var e = new Error(msg || ec[ind]);\n e.code = ind;\n if (Error.captureStackTrace)\n Error.captureStackTrace(e, err);\n if (!nt)\n throw e;\n return e;\n};\n// expands raw DEFLATE data\nvar inflt = function (dat, st, buf, dict) {\n // source length dict length\n var sl = dat.length, dl = dict ? dict.length : 0;\n if (!sl || st.f && !st.l)\n return buf || new u8(0);\n var noBuf = !buf;\n // have to estimate size\n var resize = noBuf || st.i != 2;\n // no state\n var noSt = st.i;\n // Assumes roughly 33% compression ratio average\n if (noBuf)\n buf = new u8(sl * 3);\n // ensure buffer can fit at least l elements\n var cbuf = function (l) {\n var bl = buf.length;\n // need to increase size to fit\n if (l > bl) {\n // Double or set to necessary, whichever is greater\n var nbuf = new u8(Math.max(bl * 2, l));\n nbuf.set(buf);\n buf = nbuf;\n }\n };\n // last chunk bitpos bytes\n var final = st.f || 0, pos = st.p || 0, bt = st.b || 0, lm = st.l, dm = st.d, lbt = st.m, dbt = st.n;\n // total bits\n var tbts = sl * 8;\n do {\n if (!lm) {\n // BFINAL - this is only 1 when last chunk is next\n final = bits(dat, pos, 1);\n // type: 0 = no compression, 1 = fixed huffman, 2 = dynamic huffman\n var type = bits(dat, pos + 1, 3);\n pos += 3;\n if (!type) {\n // go to end of byte boundary\n var s = shft(pos) + 4, l = dat[s - 4] | (dat[s - 3] << 8), t = s + l;\n if (t > sl) {\n if (noSt)\n err(0);\n break;\n }\n // ensure size\n if (resize)\n cbuf(bt + l);\n // Copy over uncompressed data\n buf.set(dat.subarray(s, t), bt);\n // Get new bitpos, update byte count\n st.b = bt += l, st.p = pos = t * 8, st.f = final;\n continue;\n }\n else if (type == 1)\n lm = flrm, dm = fdrm, lbt = 9, dbt = 5;\n else if (type == 2) {\n // literal lengths\n var hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;\n var tl = hLit + bits(dat, pos + 5, 31) + 1;\n pos += 14;\n // length+distance tree\n var ldt = new u8(tl);\n // code length tree\n var clt = new u8(19);\n for (var i = 0; i < hcLen; ++i) {\n // use index map to get real code\n clt[clim[i]] = bits(dat, pos + i * 3, 7);\n }\n pos += hcLen * 3;\n // code lengths bits\n var clb = max(clt), clbmsk = (1 << clb) - 1;\n // code lengths map\n var clm = hMap(clt, clb, 1);\n for (var i = 0; i < tl;) {\n var r = clm[bits(dat, pos, clbmsk)];\n // bits read\n pos += r & 15;\n // symbol\n var s = r >> 4;\n // code length to copy\n if (s < 16) {\n ldt[i++] = s;\n }\n else {\n // copy count\n var c = 0, n = 0;\n if (s == 16)\n n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];\n else if (s == 17)\n n = 3 + bits(dat, pos, 7), pos += 3;\n else if (s == 18)\n n = 11 + bits(dat, pos, 127), pos += 7;\n while (n--)\n ldt[i++] = c;\n }\n }\n // length tree distance tree\n var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);\n // max length bits\n lbt = max(lt);\n // max dist bits\n dbt = max(dt);\n lm = hMap(lt, lbt, 1);\n dm = hMap(dt, dbt, 1);\n }\n else\n err(1);\n if (pos > tbts) {\n if (noSt)\n err(0);\n break;\n }\n }\n // Make sure the buffer can hold this + the largest possible addition\n // Maximum chunk size (practically, theoretically infinite) is 2^17\n if (resize)\n cbuf(bt + 131072);\n var lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;\n var lpos = pos;\n for (;; lpos = pos) {\n // bits read, code\n var c = lm[bits16(dat, pos) & lms], sym = c >> 4;\n pos += c & 15;\n if (pos > tbts) {\n if (noSt)\n err(0);\n break;\n }\n if (!c)\n err(2);\n if (sym < 256)\n buf[bt++] = sym;\n else if (sym == 256) {\n lpos = pos, lm = null;\n break;\n }\n else {\n var add = sym - 254;\n // no extra bits needed if less\n if (sym > 264) {\n // index\n var i = sym - 257, b = fleb[i];\n add = bits(dat, pos, (1 << b) - 1) + fl[i];\n pos += b;\n }\n // dist\n var d = dm[bits16(dat, pos) & dms], dsym = d >> 4;\n if (!d)\n err(3);\n pos += d & 15;\n var dt = fd[dsym];\n if (dsym > 3) {\n var b = fdeb[dsym];\n dt += bits16(dat, pos) & (1 << b) - 1, pos += b;\n }\n if (pos > tbts) {\n if (noSt)\n err(0);\n break;\n }\n if (resize)\n cbuf(bt + 131072);\n var end = bt + add;\n if (bt < dt) {\n var shift = dl - dt, dend = Math.min(dt, end);\n if (shift + bt < 0)\n err(3);\n for (; bt < dend; ++bt)\n buf[bt] = dict[shift + bt];\n }\n for (; bt < end; ++bt)\n buf[bt] = buf[bt - dt];\n }\n }\n st.l = lm, st.p = lpos, st.b = bt, st.f = final;\n if (lm)\n final = 1, st.m = lbt, st.d = dm, st.n = dbt;\n } while (!final);\n // don't reallocate for streams or user buffers\n return bt != buf.length && noBuf ? slc(buf, 0, bt) : buf.subarray(0, bt);\n};\n// starting at p, write the minimum number of bits that can hold v to d\nvar wbits = function (d, p, v) {\n v <<= p & 7;\n var o = (p / 8) | 0;\n d[o] |= v;\n d[o + 1] |= v >> 8;\n};\n// starting at p, write the minimum number of bits (>8) that can hold v to d\nvar wbits16 = function (d, p, v) {\n v <<= p & 7;\n var o = (p / 8) | 0;\n d[o] |= v;\n d[o + 1] |= v >> 8;\n d[o + 2] |= v >> 16;\n};\n// creates code lengths from a frequency table\nvar hTree = function (d, mb) {\n // Need extra info to make a tree\n var t = [];\n for (var i = 0; i < d.length; ++i) {\n if (d[i])\n t.push({ s: i, f: d[i] });\n }\n var s = t.length;\n var t2 = t.slice();\n if (!s)\n return { t: et, l: 0 };\n if (s == 1) {\n var v = new u8(t[0].s + 1);\n v[t[0].s] = 1;\n return { t: v, l: 1 };\n }\n t.sort(function (a, b) { return a.f - b.f; });\n // after i2 reaches last ind, will be stopped\n // freq must be greater than largest possible number of symbols\n t.push({ s: -1, f: 25001 });\n var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;\n t[0] = { s: -1, f: l.f + r.f, l: l, r: r };\n // efficient algorithm from UZIP.js\n // i0 is lookbehind, i2 is lookahead - after processing two low-freq\n // symbols that combined have high freq, will start processing i2 (high-freq,\n // non-composite) symbols instead\n // see https://reddit.com/r/photopea/comments/ikekht/uzipjs_questions/\n while (i1 != s - 1) {\n l = t[t[i0].f < t[i2].f ? i0++ : i2++];\n r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];\n t[i1++] = { s: -1, f: l.f + r.f, l: l, r: r };\n }\n var maxSym = t2[0].s;\n for (var i = 1; i < s; ++i) {\n if (t2[i].s > maxSym)\n maxSym = t2[i].s;\n }\n // code lengths\n var tr = new u16(maxSym + 1);\n // max bits in tree\n var mbt = ln(t[i1 - 1], tr, 0);\n if (mbt > mb) {\n // more algorithms from UZIP.js\n // TODO: find out how this code works (debt)\n // ind debt\n var i = 0, dt = 0;\n // left cost\n var lft = mbt - mb, cst = 1 << lft;\n t2.sort(function (a, b) { return tr[b.s] - tr[a.s] || a.f - b.f; });\n for (; i < s; ++i) {\n var i2_1 = t2[i].s;\n if (tr[i2_1] > mb) {\n dt += cst - (1 << (mbt - tr[i2_1]));\n tr[i2_1] = mb;\n }\n else\n break;\n }\n dt >>= lft;\n while (dt > 0) {\n var i2_2 = t2[i].s;\n if (tr[i2_2] < mb)\n dt -= 1 << (mb - tr[i2_2]++ - 1);\n else\n ++i;\n }\n for (; i >= 0 && dt; --i) {\n var i2_3 = t2[i].s;\n if (tr[i2_3] == mb) {\n --tr[i2_3];\n ++dt;\n }\n }\n mbt = mb;\n }\n return { t: new u8(tr), l: mbt };\n};\n// get the max length and assign length codes\nvar ln = function (n, l, d) {\n return n.s == -1\n ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1))\n : (l[n.s] = d);\n};\n// length codes generation\nvar lc = function (c) {\n var s = c.length;\n // Note that the semicolon was intentional\n while (s && !c[--s])\n ;\n var cl = new u16(++s);\n // ind num streak\n var cli = 0, cln = c[0], cls = 1;\n var w = function (v) { cl[cli++] = v; };\n for (var i = 1; i <= s; ++i) {\n if (c[i] == cln && i != s)\n ++cls;\n else {\n if (!cln && cls > 2) {\n for (; cls > 138; cls -= 138)\n w(32754);\n if (cls > 2) {\n w(cls > 10 ? ((cls - 11) << 5) | 28690 : ((cls - 3) << 5) | 12305);\n cls = 0;\n }\n }\n else if (cls > 3) {\n w(cln), --cls;\n for (; cls > 6; cls -= 6)\n w(8304);\n if (cls > 2)\n w(((cls - 3) << 5) | 8208), cls = 0;\n }\n while (cls--)\n w(cln);\n cls = 1;\n cln = c[i];\n }\n }\n return { c: cl.subarray(0, cli), n: s };\n};\n// calculate the length of output from tree, code lengths\nvar clen = function (cf, cl) {\n var l = 0;\n for (var i = 0; i < cl.length; ++i)\n l += cf[i] * cl[i];\n return l;\n};\n// writes a fixed block\n// returns the new bit pos\nvar wfblk = function (out, pos, dat) {\n // no need to write 00 as type: TypedArray defaults to 0\n var s = dat.length;\n var o = shft(pos + 2);\n out[o] = s & 255;\n out[o + 1] = s >> 8;\n out[o + 2] = out[o] ^ 255;\n out[o + 3] = out[o + 1] ^ 255;\n for (var i = 0; i < s; ++i)\n out[o + i + 4] = dat[i];\n return (o + 4 + s) * 8;\n};\n// writes a block\nvar wblk = function (dat, out, final, syms, lf, df, eb, li, bs, bl, p) {\n wbits(out, p++, final);\n ++lf[256];\n var _a = hTree(lf, 15), dlt = _a.t, mlb = _a.l;\n var _b = hTree(df, 15), ddt = _b.t, mdb = _b.l;\n var _c = lc(dlt), lclt = _c.c, nlc = _c.n;\n var _d = lc(ddt), lcdt = _d.c, ndc = _d.n;\n var lcfreq = new u16(19);\n for (var i = 0; i < lclt.length; ++i)\n ++lcfreq[lclt[i] & 31];\n for (var i = 0; i < lcdt.length; ++i)\n ++lcfreq[lcdt[i] & 31];\n var _e = hTree(lcfreq, 7), lct = _e.t, mlcb = _e.l;\n var nlcc = 19;\n for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)\n ;\n var flen = (bl + 5) << 3;\n var ftlen = clen(lf, flt) + clen(df, fdt) + eb;\n var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];\n if (bs >= 0 && flen <= ftlen && flen <= dtlen)\n return wfblk(out, p, dat.subarray(bs, bs + bl));\n var lm, ll, dm, dl;\n wbits(out, p, 1 + (dtlen < ftlen)), p += 2;\n if (dtlen < ftlen) {\n lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;\n var llm = hMap(lct, mlcb, 0);\n wbits(out, p, nlc - 257);\n wbits(out, p + 5, ndc - 1);\n wbits(out, p + 10, nlcc - 4);\n p += 14;\n for (var i = 0; i < nlcc; ++i)\n wbits(out, p + 3 * i, lct[clim[i]]);\n p += 3 * nlcc;\n var lcts = [lclt, lcdt];\n for (var it = 0; it < 2; ++it) {\n var clct = lcts[it];\n for (var i = 0; i < clct.length; ++i) {\n var len = clct[i] & 31;\n wbits(out, p, llm[len]), p += lct[len];\n if (len > 15)\n wbits(out, p, (clct[i] >> 5) & 127), p += clct[i] >> 12;\n }\n }\n }\n else {\n lm = flm, ll = flt, dm = fdm, dl = fdt;\n }\n for (var i = 0; i < li; ++i) {\n var sym = syms[i];\n if (sym > 255) {\n var len = (sym >> 18) & 31;\n wbits16(out, p, lm[len + 257]), p += ll[len + 257];\n if (len > 7)\n wbits(out, p, (sym >> 23) & 31), p += fleb[len];\n var dst = sym & 31;\n wbits16(out, p, dm[dst]), p += dl[dst];\n if (dst > 3)\n wbits16(out, p, (sym >> 5) & 8191), p += fdeb[dst];\n }\n else {\n wbits16(out, p, lm[sym]), p += ll[sym];\n }\n }\n wbits16(out, p, lm[256]);\n return p + ll[256];\n};\n// deflate options (nice << 13) | chain\nvar deo = /*#__PURE__*/ new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);\n// empty\nvar et = /*#__PURE__*/ new u8(0);\n// compresses data into a raw DEFLATE buffer\nvar dflt = function (dat, lvl, plvl, pre, post, st) {\n var s = st.z || dat.length;\n var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7000)) + post);\n // writing to this writes to the output buffer\n var w = o.subarray(pre, o.length - post);\n var lst = st.l;\n var pos = (st.r || 0) & 7;\n if (lvl) {\n if (pos)\n w[0] = st.r >> 3;\n var opt = deo[lvl - 1];\n var n = opt >> 13, c = opt & 8191;\n var msk_1 = (1 << plvl) - 1;\n // prev 2-byte val map curr 2-byte val map\n var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);\n var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;\n var hsh = function (i) { return (dat[i] ^ (dat[i + 1] << bs1_1) ^ (dat[i + 2] << bs2_1)) & msk_1; };\n // 24576 is an arbitrary number of maximum symbols per block\n // 424 buffer for last block\n var syms = new i32(25000);\n // length/literal freq distance freq\n var lf = new u16(288), df = new u16(32);\n // l/lcnt exbits index l/lind waitdx blkpos\n var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;\n for (; i + 2 < s; ++i) {\n // hash value\n var hv = hsh(i);\n // index mod 32768 previous index mod\n var imod = i & 32767, pimod = head[hv];\n prev[imod] = pimod;\n head[hv] = imod;\n // We always should modify head and prev, but only add symbols if\n // this data is not yet processed (\"wait\" for wait index)\n if (wi <= i) {\n // bytes remaining\n var rem = s - i;\n if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {\n pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);\n li = lc_1 = eb = 0, bs = i;\n for (var j = 0; j < 286; ++j)\n lf[j] = 0;\n for (var j = 0; j < 30; ++j)\n df[j] = 0;\n }\n // len dist chain\n var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;\n if (rem > 2 && hv == hsh(i - dif)) {\n var maxn = Math.min(n, rem) - 1;\n var maxd = Math.min(32767, i);\n // max possible length\n // not capped at dif because decompressors implement \"rolling\" index population\n var ml = Math.min(258, rem);\n while (dif <= maxd && --ch_1 && imod != pimod) {\n if (dat[i + l] == dat[i + l - dif]) {\n var nl = 0;\n for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)\n ;\n if (nl > l) {\n l = nl, d = dif;\n // break out early when we reach \"nice\" (we are satisfied enough)\n if (nl > maxn)\n break;\n // now, find the rarest 2-byte sequence within this\n // length of literals and search for that instead.\n // Much faster than just using the start\n var mmd = Math.min(dif, nl - 2);\n var md = 0;\n for (var j = 0; j < mmd; ++j) {\n var ti = i - dif + j & 32767;\n var pti = prev[ti];\n var cd = ti - pti & 32767;\n if (cd > md)\n md = cd, pimod = ti;\n }\n }\n }\n // check the previous match\n imod = pimod, pimod = prev[imod];\n dif += imod - pimod & 32767;\n }\n }\n // d will be nonzero only when a match was found\n if (d) {\n // store both dist and len data in one int32\n // Make sure this is recognized as a len/dist with 28th bit (2^28)\n syms[li++] = 268435456 | (revfl[l] << 18) | revfd[d];\n var lin = revfl[l] & 31, din = revfd[d] & 31;\n eb += fleb[lin] + fdeb[din];\n ++lf[257 + lin];\n ++df[din];\n wi = i + l;\n ++lc_1;\n }\n else {\n syms[li++] = dat[i];\n ++lf[dat[i]];\n }\n }\n }\n for (i = Math.max(i, wi); i < s; ++i) {\n syms[li++] = dat[i];\n ++lf[dat[i]];\n }\n pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);\n if (!lst) {\n st.r = (pos & 7) | w[(pos / 8) | 0] << 3;\n // shft(pos) now 1 less if pos & 7 != 0\n pos -= 7;\n st.h = head, st.p = prev, st.i = i, st.w = wi;\n }\n }\n else {\n for (var i = st.w || 0; i < s + lst; i += 65535) {\n // end\n var e = i + 65535;\n if (e >= s) {\n // write final block\n w[(pos / 8) | 0] = lst;\n e = s;\n }\n pos = wfblk(w, pos + 1, dat.subarray(i, e));\n }\n st.i = s;\n }\n return slc(o, 0, pre + shft(pos) + post);\n};\n// CRC32 table\nvar crct = /*#__PURE__*/ (function () {\n var t = new Int32Array(256);\n for (var i = 0; i < 256; ++i) {\n var c = i, k = 9;\n while (--k)\n c = ((c & 1) && -306674912) ^ (c >>> 1);\n t[i] = c;\n }\n return t;\n})();\n// CRC32\nvar crc = function () {\n var c = -1;\n return {\n p: function (d) {\n // closures have awful performance\n var cr = c;\n for (var i = 0; i < d.length; ++i)\n cr = crct[(cr & 255) ^ d[i]] ^ (cr >>> 8);\n c = cr;\n },\n d: function () { return ~c; }\n };\n};\n// Adler32\nvar adler = function () {\n var a = 1, b = 0;\n return {\n p: function (d) {\n // closures have awful performance\n var n = a, m = b;\n var l = d.length | 0;\n for (var i = 0; i != l;) {\n var e = Math.min(i + 2655, l);\n for (; i < e; ++i)\n m += n += d[i];\n n = (n & 65535) + 15 * (n >> 16), m = (m & 65535) + 15 * (m >> 16);\n }\n a = n, b = m;\n },\n d: function () {\n a %= 65521, b %= 65521;\n return (a & 255) << 24 | (a & 0xFF00) << 8 | (b & 255) << 8 | (b >> 8);\n }\n };\n};\n;\n// deflate with opts\nvar dopt = function (dat, opt, pre, post, st) {\n if (!st) {\n st = { l: 1 };\n if (opt.dictionary) {\n var dict = opt.dictionary.subarray(-32768);\n var newDat = new u8(dict.length + dat.length);\n newDat.set(dict);\n newDat.set(dat, dict.length);\n dat = newDat;\n st.w = dict.length;\n }\n }\n return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? (st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20) : (12 + opt.mem), pre, post, st);\n};\n// Walmart object spread\nvar mrg = function (a, b) {\n var o = {};\n for (var k in a)\n o[k] = a[k];\n for (var k in b)\n o[k] = b[k];\n return o;\n};\n// worker clone\n// This is possibly the craziest part of the entire codebase, despite how simple it may seem.\n// The only parameter to this function is a closure that returns an array of variables outside of the function scope.\n// We're going to try to figure out the variable names used in the closure as strings because that is crucial for workerization.\n// We will return an object mapping of true variable name to value (basically, the current scope as a JS object).\n// The reason we can't just use the original variable names is minifiers mangling the toplevel scope.\n// This took me three weeks to figure out how to do.\nvar wcln = function (fn, fnStr, td) {\n var dt = fn();\n var st = fn.toString();\n var ks = st.slice(st.indexOf('[') + 1, st.lastIndexOf(']')).replace(/\\s+/g, '').split(',');\n for (var i = 0; i < dt.length; ++i) {\n var v = dt[i], k = ks[i];\n if (typeof v == 'function') {\n fnStr += ';' + k + '=';\n var st_1 = v.toString();\n if (v.prototype) {\n // for global objects\n if (st_1.indexOf('[native code]') != -1) {\n var spInd = st_1.indexOf(' ', 8) + 1;\n fnStr += st_1.slice(spInd, st_1.indexOf('(', spInd));\n }\n else {\n fnStr += st_1;\n for (var t in v.prototype)\n fnStr += ';' + k + '.prototype.' + t + '=' + v.prototype[t].toString();\n }\n }\n else\n fnStr += st_1;\n }\n else\n td[k] = v;\n }\n return fnStr;\n};\nvar ch = [];\n// clone bufs\nvar cbfs = function (v) {\n var tl = [];\n for (var k in v) {\n if (v[k].buffer) {\n tl.push((v[k] = new v[k].constructor(v[k])).buffer);\n }\n }\n return tl;\n};\n// use a worker to execute code\nvar wrkr = function (fns, init, id, cb) {\n if (!ch[id]) {\n var fnStr = '', td_1 = {}, m = fns.length - 1;\n for (var i = 0; i < m; ++i)\n fnStr = wcln(fns[i], fnStr, td_1);\n ch[id] = { c: wcln(fns[m], fnStr, td_1), e: td_1 };\n }\n var td = mrg({}, ch[id].e);\n return wk(ch[id].c + ';onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=' + init.toString() + '}', id, td, cbfs(td), cb);\n};\n// base async inflate fn\nvar bInflt = function () { return [u8, u16, i32, fleb, fdeb, clim, fl, fd, flrm, fdrm, rev, ec, hMap, max, bits, bits16, shft, slc, err, inflt, inflateSync, pbf, gopt]; };\nvar bDflt = function () { return [u8, u16, i32, fleb, fdeb, clim, revfl, revfd, flm, flt, fdm, fdt, rev, deo, et, hMap, wbits, wbits16, hTree, ln, lc, clen, wfblk, wblk, shft, slc, dflt, dopt, deflateSync, pbf]; };\n// gzip extra\nvar gze = function () { return [gzh, gzhl, wbytes, crc, crct]; };\n// gunzip extra\nvar guze = function () { return [gzs, gzl]; };\n// zlib extra\nvar zle = function () { return [zlh, wbytes, adler]; };\n// unzlib extra\nvar zule = function () { return [zls]; };\n// post buf\nvar pbf = function (msg) { return postMessage(msg, [msg.buffer]); };\n// get opts\nvar gopt = function (o) { return o && {\n out: o.size && new u8(o.size),\n dictionary: o.dictionary\n}; };\n// async helper\nvar cbify = function (dat, opts, fns, init, id, cb) {\n var w = wrkr(fns, init, id, function (err, dat) {\n w.terminate();\n cb(err, dat);\n });\n w.postMessage([dat, opts], opts.consume ? [dat.buffer] : []);\n return function () { w.terminate(); };\n};\n// auto stream\nvar astrm = function (strm) {\n strm.ondata = function (dat, final) { return postMessage([dat, final], [dat.buffer]); };\n return function (ev) {\n if (ev.data.length) {\n strm.push(ev.data[0], ev.data[1]);\n postMessage([ev.data[0].length]);\n }\n else\n strm.flush();\n };\n};\n// async stream attach\nvar astrmify = function (fns, strm, opts, init, id, flush, ext) {\n var t;\n var w = wrkr(fns, init, id, function (err, dat) {\n if (err)\n w.terminate(), strm.ondata.call(strm, err);\n else if (!Array.isArray(dat))\n ext(dat);\n else if (dat.length == 1) {\n strm.queuedSize -= dat[0];\n if (strm.ondrain)\n strm.ondrain(dat[0]);\n }\n else {\n if (dat[1])\n w.terminate();\n strm.ondata.call(strm, err, dat[0], dat[1]);\n }\n });\n w.postMessage(opts);\n strm.queuedSize = 0;\n strm.push = function (d, f) {\n if (!strm.ondata)\n err(5);\n if (t)\n strm.ondata(err(4, 0, 1), null, !!f);\n strm.queuedSize += d.length;\n w.postMessage([d, t = f], [d.buffer]);\n };\n strm.terminate = function () { w.terminate(); };\n if (flush) {\n strm.flush = function () { w.postMessage([]); };\n }\n};\n// read 2 bytes\nvar b2 = function (d, b) { return d[b] | (d[b + 1] << 8); };\n// read 4 bytes\nvar b4 = function (d, b) { return (d[b] | (d[b + 1] << 8) | (d[b + 2] << 16) | (d[b + 3] << 24)) >>> 0; };\nvar b8 = function (d, b) { return b4(d, b) + (b4(d, b + 4) * 4294967296); };\n// write bytes\nvar wbytes = function (d, b, v) {\n for (; v; ++b)\n d[b] = v, v >>>= 8;\n};\n// gzip header\nvar gzh = function (c, o) {\n var fn = o.filename;\n c[0] = 31, c[1] = 139, c[2] = 8, c[8] = o.level < 2 ? 4 : o.level == 9 ? 2 : 0, c[9] = 3; // assume Unix\n if (o.mtime != 0)\n wbytes(c, 4, Math.floor(new Date(o.mtime || Date.now()) / 1000));\n if (fn) {\n c[3] = 8;\n for (var i = 0; i <= fn.length; ++i)\n c[i + 10] = fn.charCodeAt(i);\n }\n};\n// gzip footer: -8 to -4 = CRC, -4 to -0 is length\n// gzip start\nvar gzs = function (d) {\n if (d[0] != 31 || d[1] != 139 || d[2] != 8)\n err(6, 'invalid gzip data');\n var flg = d[3];\n var st = 10;\n if (flg & 4)\n st += (d[10] | d[11] << 8) + 2;\n for (var zs = (flg >> 3 & 1) + (flg >> 4 & 1); zs > 0; zs -= !d[st++])\n ;\n return st + (flg & 2);\n};\n// gzip length\nvar gzl = function (d) {\n var l = d.length;\n return (d[l - 4] | d[l - 3] << 8 | d[l - 2] << 16 | d[l - 1] << 24) >>> 0;\n};\n// gzip header length\nvar gzhl = function (o) { return 10 + (o.filename ? o.filename.length + 1 : 0); };\n// zlib header\nvar zlh = function (c, o) {\n var lv = o.level, fl = lv == 0 ? 0 : lv < 6 ? 1 : lv == 9 ? 3 : 2;\n c[0] = 120, c[1] = (fl << 6) | (o.dictionary && 32);\n c[1] |= 31 - ((c[0] << 8) | c[1]) % 31;\n if (o.dictionary) {\n var h = adler();\n h.p(o.dictionary);\n wbytes(c, 2, h.d());\n }\n};\n// zlib start\nvar zls = function (d, dict) {\n if ((d[0] & 15) != 8 || (d[0] >> 4) > 7 || ((d[0] << 8 | d[1]) % 31))\n err(6, 'invalid zlib data');\n if ((d[1] >> 5 & 1) == +!dict)\n err(6, 'invalid zlib data: ' + (d[1] & 32 ? 'need' : 'unexpected') + ' dictionary');\n return (d[1] >> 3 & 4) + 2;\n};\nfunction StrmOpt(opts, cb) {\n if (typeof opts == 'function')\n cb = opts, opts = {};\n this.ondata = cb;\n return opts;\n}\n/**\n * Streaming DEFLATE compression\n */\nvar Deflate = /*#__PURE__*/ (function () {\n function Deflate(opts, cb) {\n if (typeof opts == 'function')\n cb = opts, opts = {};\n this.ondata = cb;\n this.o = opts || {};\n this.s = { l: 0, i: 32768, w: 32768, z: 32768 };\n // Buffer length must always be 0 mod 32768 for index calculations to be correct when modifying head and prev\n // 98304 = 32768 (lookback) + 65536 (common chunk size)\n this.b = new u8(98304);\n if (this.o.dictionary) {\n var dict = this.o.dictionary.subarray(-32768);\n this.b.set(dict, 32768 - dict.length);\n this.s.i = 32768 - dict.length;\n }\n }\n Deflate.prototype.p = function (c, f) {\n this.ondata(dopt(c, this.o, 0, 0, this.s), f);\n };\n /**\n * Pushes a chunk to be deflated\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n Deflate.prototype.push = function (chunk, final) {\n if (!this.ondata)\n err(5);\n if (this.s.l)\n err(4);\n var endLen = chunk.length + this.s.z;\n if (endLen > this.b.length) {\n if (endLen > 2 * this.b.length - 32768) {\n var newBuf = new u8(endLen & -32768);\n newBuf.set(this.b.subarray(0, this.s.z));\n this.b = newBuf;\n }\n var split = this.b.length - this.s.z;\n this.b.set(chunk.subarray(0, split), this.s.z);\n this.s.z = this.b.length;\n this.p(this.b, false);\n this.b.set(this.b.subarray(-32768));\n this.b.set(chunk.subarray(split), 32768);\n this.s.z = chunk.length - split + 32768;\n this.s.i = 32766, this.s.w = 32768;\n }\n else {\n this.b.set(chunk, this.s.z);\n this.s.z += chunk.length;\n }\n this.s.l = final & 1;\n if (this.s.z > this.s.w + 8191 || final) {\n this.p(this.b, final || false);\n this.s.w = this.s.i, this.s.i -= 2;\n }\n };\n /**\n * Flushes buffered uncompressed data. Useful to immediately retrieve the\n * deflated output for small inputs.\n */\n Deflate.prototype.flush = function () {\n if (!this.ondata)\n err(5);\n if (this.s.l)\n err(4);\n this.p(this.b, false);\n this.s.w = this.s.i, this.s.i -= 2;\n };\n return Deflate;\n}());\nexport { Deflate };\n/**\n * Asynchronous streaming DEFLATE compression\n */\nvar AsyncDeflate = /*#__PURE__*/ (function () {\n function AsyncDeflate(opts, cb) {\n astrmify([\n bDflt,\n function () { return [astrm, Deflate]; }\n ], this, StrmOpt.call(this, opts, cb), function (ev) {\n var strm = new Deflate(ev.data);\n onmessage = astrm(strm);\n }, 6, 1);\n }\n return AsyncDeflate;\n}());\nexport { AsyncDeflate };\nexport function deflate(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n return cbify(data, opts, [\n bDflt,\n ], function (ev) { return pbf(deflateSync(ev.data[0], ev.data[1])); }, 0, cb);\n}\n/**\n * Compresses data with DEFLATE without any wrapper\n * @param data The data to compress\n * @param opts The compression options\n * @returns The deflated version of the data\n */\nexport function deflateSync(data, opts) {\n return dopt(data, opts || {}, 0, 0);\n}\n/**\n * Streaming DEFLATE decompression\n */\nvar Inflate = /*#__PURE__*/ (function () {\n function Inflate(opts, cb) {\n // no StrmOpt here to avoid adding to workerizer\n if (typeof opts == 'function')\n cb = opts, opts = {};\n this.ondata = cb;\n var dict = opts && opts.dictionary && opts.dictionary.subarray(-32768);\n this.s = { i: 0, b: dict ? dict.length : 0 };\n this.o = new u8(32768);\n this.p = new u8(0);\n if (dict)\n this.o.set(dict);\n }\n Inflate.prototype.e = function (c) {\n if (!this.ondata)\n err(5);\n if (this.d)\n err(4);\n if (!this.p.length)\n this.p = c;\n else if (c.length) {\n var n = new u8(this.p.length + c.length);\n n.set(this.p), n.set(c, this.p.length), this.p = n;\n }\n };\n Inflate.prototype.c = function (final) {\n this.s.i = +(this.d = final || false);\n var bts = this.s.b;\n var dt = inflt(this.p, this.s, this.o);\n this.ondata(slc(dt, bts, this.s.b), this.d);\n this.o = slc(dt, this.s.b - 32768), this.s.b = this.o.length;\n this.p = slc(this.p, (this.s.p / 8) | 0), this.s.p &= 7;\n };\n /**\n * Pushes a chunk to be inflated\n * @param chunk The chunk to push\n * @param final Whether this is the final chunk\n */\n Inflate.prototype.push = function (chunk, final) {\n this.e(chunk), this.c(final);\n };\n return Inflate;\n}());\nexport { Inflate };\n/**\n * Asynchronous streaming DEFLATE decompression\n */\nvar AsyncInflate = /*#__PURE__*/ (function () {\n function AsyncInflate(opts, cb) {\n astrmify([\n bInflt,\n function () { return [astrm, Inflate]; }\n ], this, StrmOpt.call(this, opts, cb), function (ev) {\n var strm = new Inflate(ev.data);\n onmessage = astrm(strm);\n }, 7, 0);\n }\n return AsyncInflate;\n}());\nexport { AsyncInflate };\nexport function inflate(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n return cbify(data, opts, [\n bInflt\n ], function (ev) { return pbf(inflateSync(ev.data[0], gopt(ev.data[1]))); }, 1, cb);\n}\n/**\n * Expands DEFLATE data with no wrapper\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function inflateSync(data, opts) {\n return inflt(data, { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// before you yell at me for not just using extends, my reason is that TS inheritance is hard to workerize.\n/**\n * Streaming GZIP compression\n */\nvar Gzip = /*#__PURE__*/ (function () {\n function Gzip(opts, cb) {\n this.c = crc();\n this.l = 0;\n this.v = 1;\n Deflate.call(this, opts, cb);\n }\n /**\n * Pushes a chunk to be GZIPped\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n Gzip.prototype.push = function (chunk, final) {\n this.c.p(chunk);\n this.l += chunk.length;\n Deflate.prototype.push.call(this, chunk, final);\n };\n Gzip.prototype.p = function (c, f) {\n var raw = dopt(c, this.o, this.v && gzhl(this.o), f && 8, this.s);\n if (this.v)\n gzh(raw, this.o), this.v = 0;\n if (f)\n wbytes(raw, raw.length - 8, this.c.d()), wbytes(raw, raw.length - 4, this.l);\n this.ondata(raw, f);\n };\n /**\n * Flushes buffered uncompressed data. Useful to immediately retrieve the\n * GZIPped output for small inputs.\n */\n Gzip.prototype.flush = function () {\n Deflate.prototype.flush.call(this);\n };\n return Gzip;\n}());\nexport { Gzip };\n/**\n * Asynchronous streaming GZIP compression\n */\nvar AsyncGzip = /*#__PURE__*/ (function () {\n function AsyncGzip(opts, cb) {\n astrmify([\n bDflt,\n gze,\n function () { return [astrm, Deflate, Gzip]; }\n ], this, StrmOpt.call(this, opts, cb), function (ev) {\n var strm = new Gzip(ev.data);\n onmessage = astrm(strm);\n }, 8, 1);\n }\n return AsyncGzip;\n}());\nexport { AsyncGzip };\nexport function gzip(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n return cbify(data, opts, [\n bDflt,\n gze,\n function () { return [gzipSync]; }\n ], function (ev) { return pbf(gzipSync(ev.data[0], ev.data[1])); }, 2, cb);\n}\n/**\n * Compresses data with GZIP\n * @param data The data to compress\n * @param opts The compression options\n * @returns The gzipped version of the data\n */\nexport function gzipSync(data, opts) {\n if (!opts)\n opts = {};\n var c = crc(), l = data.length;\n c.p(data);\n var d = dopt(data, opts, gzhl(opts), 8), s = d.length;\n return gzh(d, opts), wbytes(d, s - 8, c.d()), wbytes(d, s - 4, l), d;\n}\n/**\n * Streaming single or multi-member GZIP decompression\n */\nvar Gunzip = /*#__PURE__*/ (function () {\n function Gunzip(opts, cb) {\n this.v = 1;\n this.r = 0;\n Inflate.call(this, opts, cb);\n }\n /**\n * Pushes a chunk to be GUNZIPped\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n Gunzip.prototype.push = function (chunk, final) {\n Inflate.prototype.e.call(this, chunk);\n this.r += chunk.length;\n if (this.v) {\n var p = this.p.subarray(this.v - 1);\n var s = p.length > 3 ? gzs(p) : 4;\n if (s > p.length) {\n if (!final)\n return;\n }\n else if (this.v > 1 && this.onmember) {\n this.onmember(this.r - p.length);\n }\n this.p = p.subarray(s), this.v = 0;\n }\n // necessary to prevent TS from using the closure value\n // This allows for workerization to function correctly\n Inflate.prototype.c.call(this, final);\n // process concatenated GZIP\n if (this.s.f && !this.s.l && !final) {\n this.v = shft(this.s.p) + 9;\n this.s = { i: 0 };\n this.o = new u8(0);\n this.push(new u8(0), final);\n }\n };\n return Gunzip;\n}());\nexport { Gunzip };\n/**\n * Asynchronous streaming single or multi-member GZIP decompression\n */\nvar AsyncGunzip = /*#__PURE__*/ (function () {\n function AsyncGunzip(opts, cb) {\n var _this = this;\n astrmify([\n bInflt,\n guze,\n function () { return [astrm, Inflate, Gunzip]; }\n ], this, StrmOpt.call(this, opts, cb), function (ev) {\n var strm = new Gunzip(ev.data);\n strm.onmember = function (offset) { return postMessage(offset); };\n onmessage = astrm(strm);\n }, 9, 0, function (offset) { return _this.onmember && _this.onmember(offset); });\n }\n return AsyncGunzip;\n}());\nexport { AsyncGunzip };\nexport function gunzip(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n return cbify(data, opts, [\n bInflt,\n guze,\n function () { return [gunzipSync]; }\n ], function (ev) { return pbf(gunzipSync(ev.data[0], ev.data[1])); }, 3, cb);\n}\n/**\n * Expands GZIP data\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function gunzipSync(data, opts) {\n var st = gzs(data);\n if (st + 8 > data.length)\n err(6, 'invalid gzip data');\n return inflt(data.subarray(st, -8), { i: 2 }, opts && opts.out || new u8(gzl(data)), opts && opts.dictionary);\n}\n/**\n * Streaming Zlib compression\n */\nvar Zlib = /*#__PURE__*/ (function () {\n function Zlib(opts, cb) {\n this.c = adler();\n this.v = 1;\n Deflate.call(this, opts, cb);\n }\n /**\n * Pushes a chunk to be zlibbed\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n Zlib.prototype.push = function (chunk, final) {\n this.c.p(chunk);\n Deflate.prototype.push.call(this, chunk, final);\n };\n Zlib.prototype.p = function (c, f) {\n var raw = dopt(c, this.o, this.v && (this.o.dictionary ? 6 : 2), f && 4, this.s);\n if (this.v)\n zlh(raw, this.o), this.v = 0;\n if (f)\n wbytes(raw, raw.length - 4, this.c.d());\n this.ondata(raw, f);\n };\n /**\n * Flushes buffered uncompressed data. Useful to immediately retrieve the\n * zlibbed output for small inputs.\n */\n Zlib.prototype.flush = function () {\n Deflate.prototype.flush.call(this);\n };\n return Zlib;\n}());\nexport { Zlib };\n/**\n * Asynchronous streaming Zlib compression\n */\nvar AsyncZlib = /*#__PURE__*/ (function () {\n function AsyncZlib(opts, cb) {\n astrmify([\n bDflt,\n zle,\n function () { return [astrm, Deflate, Zlib]; }\n ], this, StrmOpt.call(this, opts, cb), function (ev) {\n var strm = new Zlib(ev.data);\n onmessage = astrm(strm);\n }, 10, 1);\n }\n return AsyncZlib;\n}());\nexport { AsyncZlib };\nexport function zlib(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n return cbify(data, opts, [\n bDflt,\n zle,\n function () { return [zlibSync]; }\n ], function (ev) { return pbf(zlibSync(ev.data[0], ev.data[1])); }, 4, cb);\n}\n/**\n * Compress data with Zlib\n * @param data The data to compress\n * @param opts The compression options\n * @returns The zlib-compressed version of the data\n */\nexport function zlibSync(data, opts) {\n if (!opts)\n opts = {};\n var a = adler();\n a.p(data);\n var d = dopt(data, opts, opts.dictionary ? 6 : 2, 4);\n return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;\n}\n/**\n * Streaming Zlib decompression\n */\nvar Unzlib = /*#__PURE__*/ (function () {\n function Unzlib(opts, cb) {\n Inflate.call(this, opts, cb);\n this.v = opts && opts.dictionary ? 2 : 1;\n }\n /**\n * Pushes a chunk to be unzlibbed\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n Unzlib.prototype.push = function (chunk, final) {\n Inflate.prototype.e.call(this, chunk);\n if (this.v) {\n if (this.p.length < 6 && !final)\n return;\n this.p = this.p.subarray(zls(this.p, this.v - 1)), this.v = 0;\n }\n if (final) {\n if (this.p.length < 4)\n err(6, 'invalid zlib data');\n this.p = this.p.subarray(0, -4);\n }\n // necessary to prevent TS from using the closure value\n // This allows for workerization to function correctly\n Inflate.prototype.c.call(this, final);\n };\n return Unzlib;\n}());\nexport { Unzlib };\n/**\n * Asynchronous streaming Zlib decompression\n */\nvar AsyncUnzlib = /*#__PURE__*/ (function () {\n function AsyncUnzlib(opts, cb) {\n astrmify([\n bInflt,\n zule,\n function () { return [astrm, Inflate, Unzlib]; }\n ], this, StrmOpt.call(this, opts, cb), function (ev) {\n var strm = new Unzlib(ev.data);\n onmessage = astrm(strm);\n }, 11, 0);\n }\n return AsyncUnzlib;\n}());\nexport { AsyncUnzlib };\nexport function unzlib(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n return cbify(data, opts, [\n bInflt,\n zule,\n function () { return [unzlibSync]; }\n ], function (ev) { return pbf(unzlibSync(ev.data[0], gopt(ev.data[1]))); }, 5, cb);\n}\n/**\n * Expands Zlib data\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function unzlibSync(data, opts) {\n return inflt(data.subarray(zls(data, opts && opts.dictionary), -4), { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// Default algorithm for compression (used because having a known output size allows faster decompression)\nexport { gzip as compress, AsyncGzip as AsyncCompress };\nexport { gzipSync as compressSync, Gzip as Compress };\n/**\n * Streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar Decompress = /*#__PURE__*/ (function () {\n function Decompress(opts, cb) {\n this.o = StrmOpt.call(this, opts, cb) || {};\n this.G = Gunzip;\n this.I = Inflate;\n this.Z = Unzlib;\n }\n // init substream\n // overriden by AsyncDecompress\n Decompress.prototype.i = function () {\n var _this = this;\n this.s.ondata = function (dat, final) {\n _this.ondata(dat, final);\n };\n };\n /**\n * Pushes a chunk to be decompressed\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n Decompress.prototype.push = function (chunk, final) {\n if (!this.ondata)\n err(5);\n if (!this.s) {\n if (this.p && this.p.length) {\n var n = new u8(this.p.length + chunk.length);\n n.set(this.p), n.set(chunk, this.p.length);\n }\n else\n this.p = chunk;\n if (this.p.length > 2) {\n this.s = (this.p[0] == 31 && this.p[1] == 139 && this.p[2] == 8)\n ? new this.G(this.o)\n : ((this.p[0] & 15) != 8 || (this.p[0] >> 4) > 7 || ((this.p[0] << 8 | this.p[1]) % 31))\n ? new this.I(this.o)\n : new this.Z(this.o);\n this.i();\n this.s.push(this.p, final);\n this.p = null;\n }\n }\n else\n this.s.push(chunk, final);\n };\n return Decompress;\n}());\nexport { Decompress };\n/**\n * Asynchronous streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar AsyncDecompress = /*#__PURE__*/ (function () {\n function AsyncDecompress(opts, cb) {\n Decompress.call(this, opts, cb);\n this.queuedSize = 0;\n this.G = AsyncGunzip;\n this.I = AsyncInflate;\n this.Z = AsyncUnzlib;\n }\n AsyncDecompress.prototype.i = function () {\n var _this = this;\n this.s.ondata = function (err, dat, final) {\n _this.ondata(err, dat, final);\n };\n this.s.ondrain = function (size) {\n _this.queuedSize -= size;\n if (_this.ondrain)\n _this.ondrain(size);\n };\n };\n /**\n * Pushes a chunk to be decompressed\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n AsyncDecompress.prototype.push = function (chunk, final) {\n this.queuedSize += chunk.length;\n Decompress.prototype.push.call(this, chunk, final);\n };\n return AsyncDecompress;\n}());\nexport { AsyncDecompress };\nexport function decompress(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n ? gunzip(data, opts, cb)\n : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n ? inflate(data, opts, cb)\n : unzlib(data, opts, cb);\n}\n/**\n * Expands compressed GZIP, Zlib, or raw DEFLATE data, automatically detecting the format\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function decompressSync(data, opts) {\n return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n ? gunzipSync(data, opts)\n : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n ? inflateSync(data, opts)\n : unzlibSync(data, opts);\n}\n// flatten a directory structure\nvar fltn = function (d, p, t, o) {\n for (var k in d) {\n var val = d[k], n = p + k, op = o;\n if (Array.isArray(val))\n op = mrg(o, val[1]), val = val[0];\n if (val instanceof u8)\n t[n] = [val, op];\n else {\n t[n += '/'] = [new u8(0), op];\n fltn(val, n, t, o);\n }\n }\n};\n// text encoder\nvar te = typeof TextEncoder != 'undefined' && /*#__PURE__*/ new TextEncoder();\n// text decoder\nvar td = typeof TextDecoder != 'undefined' && /*#__PURE__*/ new TextDecoder();\n// text decoder stream\nvar tds = 0;\ntry {\n td.decode(et, { stream: true });\n tds = 1;\n}\ncatch (e) { }\n// decode UTF8\nvar dutf8 = function (d) {\n for (var r = '', i = 0;;) {\n var c = d[i++];\n var eb = (c > 127) + (c > 223) + (c > 239);\n if (i + eb > d.length)\n return { s: r, r: slc(d, i - 1) };\n if (!eb)\n r += String.fromCharCode(c);\n else if (eb == 3) {\n c = ((c & 15) << 18 | (d[i++] & 63) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63)) - 65536,\n r += String.fromCharCode(55296 | (c >> 10), 56320 | (c & 1023));\n }\n else if (eb & 1)\n r += String.fromCharCode((c & 31) << 6 | (d[i++] & 63));\n else\n r += String.fromCharCode((c & 15) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63));\n }\n};\n/**\n * Streaming UTF-8 decoding\n */\nvar DecodeUTF8 = /*#__PURE__*/ (function () {\n /**\n * Creates a UTF-8 decoding stream\n * @param cb The callback to call whenever data is decoded\n */\n function DecodeUTF8(cb) {\n this.ondata = cb;\n if (tds)\n this.t = new TextDecoder();\n else\n this.p = et;\n }\n /**\n * Pushes a chunk to be decoded from UTF-8 binary\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n DecodeUTF8.prototype.push = function (chunk, final) {\n if (!this.ondata)\n err(5);\n final = !!final;\n if (this.t) {\n this.ondata(this.t.decode(chunk, { stream: true }), final);\n if (final) {\n if (this.t.decode().length)\n err(8);\n this.t = null;\n }\n return;\n }\n if (!this.p)\n err(4);\n var dat = new u8(this.p.length + chunk.length);\n dat.set(this.p);\n dat.set(chunk, this.p.length);\n var _a = dutf8(dat), s = _a.s, r = _a.r;\n if (final) {\n if (r.length)\n err(8);\n this.p = null;\n }\n else\n this.p = r;\n this.ondata(s, final);\n };\n return DecodeUTF8;\n}());\nexport { DecodeUTF8 };\n/**\n * Streaming UTF-8 encoding\n */\nvar EncodeUTF8 = /*#__PURE__*/ (function () {\n /**\n * Creates a UTF-8 decoding stream\n * @param cb The callback to call whenever data is encoded\n */\n function EncodeUTF8(cb) {\n this.ondata = cb;\n }\n /**\n * Pushes a chunk to be encoded to UTF-8\n * @param chunk The string data to push\n * @param final Whether this is the last chunk\n */\n EncodeUTF8.prototype.push = function (chunk, final) {\n if (!this.ondata)\n err(5);\n if (this.d)\n err(4);\n this.ondata(strToU8(chunk), this.d = final || false);\n };\n return EncodeUTF8;\n}());\nexport { EncodeUTF8 };\n/**\n * Converts a string into a Uint8Array for use with compression/decompression methods\n * @param str The string to encode\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n * not need to be true unless decoding a binary string.\n * @returns The string encoded in UTF-8/Latin-1 binary\n */\nexport function strToU8(str, latin1) {\n if (latin1) {\n var ar_1 = new u8(str.length);\n for (var i = 0; i < str.length; ++i)\n ar_1[i] = str.charCodeAt(i);\n return ar_1;\n }\n if (te)\n return te.encode(str);\n var l = str.length;\n var ar = new u8(str.length + (str.length >> 1));\n var ai = 0;\n var w = function (v) { ar[ai++] = v; };\n for (var i = 0; i < l; ++i) {\n if (ai + 5 > ar.length) {\n var n = new u8(ai + 8 + ((l - i) << 1));\n n.set(ar);\n ar = n;\n }\n var c = str.charCodeAt(i);\n if (c < 128 || latin1)\n w(c);\n else if (c < 2048)\n w(192 | (c >> 6)), w(128 | (c & 63));\n else if (c > 55295 && c < 57344)\n c = 65536 + (c & 1023 << 10) | (str.charCodeAt(++i) & 1023),\n w(240 | (c >> 18)), w(128 | ((c >> 12) & 63)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n else\n w(224 | (c >> 12)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n }\n return slc(ar, 0, ai);\n}\n/**\n * Converts a Uint8Array to a string\n * @param dat The data to decode to string\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n * not need to be true unless encoding to binary string.\n * @returns The original UTF-8/Latin-1 string\n */\nexport function strFromU8(dat, latin1) {\n if (latin1) {\n var r = '';\n for (var i = 0; i < dat.length; i += 16384)\n r += String.fromCharCode.apply(null, dat.subarray(i, i + 16384));\n return r;\n }\n else if (td) {\n return td.decode(dat);\n }\n else {\n var _a = dutf8(dat), s = _a.s, r = _a.r;\n if (r.length)\n err(8);\n return s;\n }\n}\n;\n// deflate bit flag\nvar dbf = function (l) { return l == 1 ? 3 : l < 6 ? 2 : l == 9 ? 1 : 0; };\n// skip local zip header\nvar slzh = function (d, b) { return b + 30 + b2(d, b + 26) + b2(d, b + 28); };\n// read zip header\nvar zh = function (d, b, z) {\n var fnl = b2(d, b + 28), fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)), es = b + 46 + fnl, bs = b4(d, b + 20);\n var _a = z && bs == 4294967295 ? z64e(d, es) : [bs, b4(d, b + 24), b4(d, b + 42)], sc = _a[0], su = _a[1], off = _a[2];\n return [b2(d, b + 10), sc, su, fn, es + b2(d, b + 30) + b2(d, b + 32), off];\n};\n// read zip64 extra field\nvar z64e = function (d, b) {\n for (; b2(d, b) != 1; b += 4 + b2(d, b + 2))\n ;\n return [b8(d, b + 12), b8(d, b + 4), b8(d, b + 20)];\n};\n// extra field length\nvar exfl = function (ex) {\n var le = 0;\n if (ex) {\n for (var k in ex) {\n var l = ex[k].length;\n if (l > 65535)\n err(9);\n le += l + 4;\n }\n }\n return le;\n};\n// write zip header\nvar wzh = function (d, b, f, fn, u, c, ce, co) {\n var fl = fn.length, ex = f.extra, col = co && co.length;\n var exl = exfl(ex);\n wbytes(d, b, ce != null ? 0x2014B50 : 0x4034B50), b += 4;\n if (ce != null)\n d[b++] = 20, d[b++] = f.os;\n d[b] = 20, b += 2; // spec compliance? what's that?\n d[b++] = (f.flag << 1) | (c < 0 && 8), d[b++] = u && 8;\n d[b++] = f.compression & 255, d[b++] = f.compression >> 8;\n var dt = new Date(f.mtime == null ? Date.now() : f.mtime), y = dt.getFullYear() - 1980;\n if (y < 0 || y > 119)\n err(10);\n wbytes(d, b, (y << 25) | ((dt.getMonth() + 1) << 21) | (dt.getDate() << 16) | (dt.getHours() << 11) | (dt.getMinutes() << 5) | (dt.getSeconds() >> 1)), b += 4;\n if (c != -1) {\n wbytes(d, b, f.crc);\n wbytes(d, b + 4, c < 0 ? -c - 2 : c);\n wbytes(d, b + 8, f.size);\n }\n wbytes(d, b + 12, fl);\n wbytes(d, b + 14, exl), b += 16;\n if (ce != null) {\n wbytes(d, b, col);\n wbytes(d, b + 6, f.attrs);\n wbytes(d, b + 10, ce), b += 14;\n }\n d.set(fn, b);\n b += fl;\n if (exl) {\n for (var k in ex) {\n var exf = ex[k], l = exf.length;\n wbytes(d, b, +k);\n wbytes(d, b + 2, l);\n d.set(exf, b + 4), b += 4 + l;\n }\n }\n if (col)\n d.set(co, b), b += col;\n return b;\n};\n// write zip footer (end of central directory)\nvar wzf = function (o, b, c, d, e) {\n wbytes(o, b, 0x6054B50); // skip disk\n wbytes(o, b + 8, c);\n wbytes(o, b + 10, c);\n wbytes(o, b + 12, d);\n wbytes(o, b + 16, e);\n};\n/**\n * A pass-through stream to keep data uncompressed in a ZIP archive.\n */\nvar ZipPassThrough = /*#__PURE__*/ (function () {\n /**\n * Creates a pass-through stream that can be added to ZIP archives\n * @param filename The filename to associate with this data stream\n */\n function ZipPassThrough(filename) {\n this.filename = filename;\n this.c = crc();\n this.size = 0;\n this.compression = 0;\n }\n /**\n * Processes a chunk and pushes to the output stream. You can override this\n * method in a subclass for custom behavior, but by default this passes\n * the data through. You must call this.ondata(err, chunk, final) at some\n * point in this method.\n * @param chunk The chunk to process\n * @param final Whether this is the last chunk\n */\n ZipPassThrough.prototype.process = function (chunk, final) {\n this.ondata(null, chunk, final);\n };\n /**\n * Pushes a chunk to be added. If you are subclassing this with a custom\n * compression algorithm, note that you must push data from the source\n * file only, pre-compression.\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n ZipPassThrough.prototype.push = function (chunk, final) {\n if (!this.ondata)\n err(5);\n this.c.p(chunk);\n this.size += chunk.length;\n if (final)\n this.crc = this.c.d();\n this.process(chunk, final || false);\n };\n return ZipPassThrough;\n}());\nexport { ZipPassThrough };\n// I don't extend because TypeScript extension adds 1kB of runtime bloat\n/**\n * Streaming DEFLATE compression for ZIP archives. Prefer using AsyncZipDeflate\n * for better performance\n */\nvar ZipDeflate = /*#__PURE__*/ (function () {\n /**\n * Creates a DEFLATE stream that can be added to ZIP archives\n * @param filename The filename to associate with this data stream\n * @param opts The compression options\n */\n function ZipDeflate(filename, opts) {\n var _this = this;\n if (!opts)\n opts = {};\n ZipPassThrough.call(this, filename);\n this.d = new Deflate(opts, function (dat, final) {\n _this.ondata(null, dat, final);\n });\n this.compression = 8;\n this.flag = dbf(opts.level);\n }\n ZipDeflate.prototype.process = function (chunk, final) {\n try {\n this.d.push(chunk, final);\n }\n catch (e) {\n this.ondata(e, null, final);\n }\n };\n /**\n * Pushes a chunk to be deflated\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n ZipDeflate.prototype.push = function (chunk, final) {\n ZipPassThrough.prototype.push.call(this, chunk, final);\n };\n return ZipDeflate;\n}());\nexport { ZipDeflate };\n/**\n * Asynchronous streaming DEFLATE compression for ZIP archives\n */\nvar AsyncZipDeflate = /*#__PURE__*/ (function () {\n /**\n * Creates an asynchronous DEFLATE stream that can be added to ZIP archives\n * @param filename The filename to associate with this data stream\n * @param opts The compression options\n */\n function AsyncZipDeflate(filename, opts) {\n var _this = this;\n if (!opts)\n opts = {};\n ZipPassThrough.call(this, filename);\n this.d = new AsyncDeflate(opts, function (err, dat, final) {\n _this.ondata(err, dat, final);\n });\n this.compression = 8;\n this.flag = dbf(opts.level);\n this.terminate = this.d.terminate;\n }\n AsyncZipDeflate.prototype.process = function (chunk, final) {\n this.d.push(chunk, final);\n };\n /**\n * Pushes a chunk to be deflated\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n AsyncZipDeflate.prototype.push = function (chunk, final) {\n ZipPassThrough.prototype.push.call(this, chunk, final);\n };\n return AsyncZipDeflate;\n}());\nexport { AsyncZipDeflate };\n// TODO: Better tree shaking\n/**\n * A zippable archive to which files can incrementally be added\n */\nvar Zip = /*#__PURE__*/ (function () {\n /**\n * Creates an empty ZIP archive to which files can be added\n * @param cb The callback to call whenever data for the generated ZIP archive\n * is available\n */\n function Zip(cb) {\n this.ondata = cb;\n this.u = [];\n this.d = 1;\n }\n /**\n * Adds a file to the ZIP archive\n * @param file The file stream to add\n */\n Zip.prototype.add = function (file) {\n var _this = this;\n if (!this.ondata)\n err(5);\n // finishing or finished\n if (this.d & 2)\n this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, false);\n else {\n var f = strToU8(file.filename), fl_1 = f.length;\n var com = file.comment, o = com && strToU8(com);\n var u = fl_1 != file.filename.length || (o && (com.length != o.length));\n var hl_1 = fl_1 + exfl(file.extra) + 30;\n if (fl_1 > 65535)\n this.ondata(err(11, 0, 1), null, false);\n var header = new u8(hl_1);\n wzh(header, 0, file, f, u, -1);\n var chks_1 = [header];\n var pAll_1 = function () {\n for (var _i = 0, chks_2 = chks_1; _i < chks_2.length; _i++) {\n var chk = chks_2[_i];\n _this.ondata(null, chk, false);\n }\n chks_1 = [];\n };\n var tr_1 = this.d;\n this.d = 0;\n var ind_1 = this.u.length;\n var uf_1 = mrg(file, {\n f: f,\n u: u,\n o: o,\n t: function () {\n if (file.terminate)\n file.terminate();\n },\n r: function () {\n pAll_1();\n if (tr_1) {\n var nxt = _this.u[ind_1 + 1];\n if (nxt)\n nxt.r();\n else\n _this.d = 1;\n }\n tr_1 = 1;\n }\n });\n var cl_1 = 0;\n file.ondata = function (err, dat, final) {\n if (err) {\n _this.ondata(err, dat, final);\n _this.terminate();\n }\n else {\n cl_1 += dat.length;\n chks_1.push(dat);\n if (final) {\n var dd = new u8(16);\n wbytes(dd, 0, 0x8074B50);\n wbytes(dd, 4, file.crc);\n wbytes(dd, 8, cl_1);\n wbytes(dd, 12, file.size);\n chks_1.push(dd);\n uf_1.c = cl_1, uf_1.b = hl_1 + cl_1 + 16, uf_1.crc = file.crc, uf_1.size = file.size;\n if (tr_1)\n uf_1.r();\n tr_1 = 1;\n }\n else if (tr_1)\n pAll_1();\n }\n };\n this.u.push(uf_1);\n }\n };\n /**\n * Ends the process of adding files and prepares to emit the final chunks.\n * This *must* be called after adding all desired files for the resulting\n * ZIP file to work properly.\n */\n Zip.prototype.end = function () {\n var _this = this;\n if (this.d & 2) {\n this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, true);\n return;\n }\n if (this.d)\n this.e();\n else\n this.u.push({\n r: function () {\n if (!(_this.d & 1))\n return;\n _this.u.splice(-1, 1);\n _this.e();\n },\n t: function () { }\n });\n this.d = 3;\n };\n Zip.prototype.e = function () {\n var bt = 0, l = 0, tl = 0;\n for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n var f = _a[_i];\n tl += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0);\n }\n var out = new u8(tl + 22);\n for (var _b = 0, _c = this.u; _b < _c.length; _b++) {\n var f = _c[_b];\n wzh(out, bt, f, f.f, f.u, -f.c - 2, l, f.o);\n bt += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0), l += f.b;\n }\n wzf(out, bt, this.u.length, tl, l);\n this.ondata(null, out, true);\n this.d = 2;\n };\n /**\n * A method to terminate any internal workers used by the stream. Subsequent\n * calls to add() will fail.\n */\n Zip.prototype.terminate = function () {\n for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n var f = _a[_i];\n f.t();\n }\n this.d = 2;\n };\n return Zip;\n}());\nexport { Zip };\nexport function zip(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n var r = {};\n fltn(data, '', r, opts);\n var k = Object.keys(r);\n var lft = k.length, o = 0, tot = 0;\n var slft = lft, files = new Array(lft);\n var term = [];\n var tAll = function () {\n for (var i = 0; i < term.length; ++i)\n term[i]();\n };\n var cbd = function (a, b) {\n mt(function () { cb(a, b); });\n };\n mt(function () { cbd = cb; });\n var cbf = function () {\n var out = new u8(tot + 22), oe = o, cdl = tot - o;\n tot = 0;\n for (var i = 0; i < slft; ++i) {\n var f = files[i];\n try {\n var l = f.c.length;\n wzh(out, tot, f, f.f, f.u, l);\n var badd = 30 + f.f.length + exfl(f.extra);\n var loc = tot + badd;\n out.set(f.c, loc);\n wzh(out, o, f, f.f, f.u, l, tot, f.m), o += 16 + badd + (f.m ? f.m.length : 0), tot = loc + l;\n }\n catch (e) {\n return cbd(e, null);\n }\n }\n wzf(out, o, files.length, cdl, oe);\n cbd(null, out);\n };\n if (!lft)\n cbf();\n var _loop_1 = function (i) {\n var fn = k[i];\n var _a = r[fn], file = _a[0], p = _a[1];\n var c = crc(), size = file.length;\n c.p(file);\n var f = strToU8(fn), s = f.length;\n var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n var exl = exfl(p.extra);\n var compression = p.level == 0 ? 0 : 8;\n var cbl = function (e, d) {\n if (e) {\n tAll();\n cbd(e, null);\n }\n else {\n var l = d.length;\n files[i] = mrg(p, {\n size: size,\n crc: c.d(),\n c: d,\n f: f,\n m: m,\n u: s != fn.length || (m && (com.length != ms)),\n compression: compression\n });\n o += 30 + s + exl + l;\n tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n if (!--lft)\n cbf();\n }\n };\n if (s > 65535)\n cbl(err(11, 0, 1), null);\n if (!compression)\n cbl(null, file);\n else if (size < 160000) {\n try {\n cbl(null, deflateSync(file, p));\n }\n catch (e) {\n cbl(e, null);\n }\n }\n else\n term.push(deflate(file, p, cbl));\n };\n // Cannot use lft because it can decrease\n for (var i = 0; i < slft; ++i) {\n _loop_1(i);\n }\n return tAll;\n}\n/**\n * Synchronously creates a ZIP file. Prefer using `zip` for better performance\n * with more than one file.\n * @param data The directory structure for the ZIP archive\n * @param opts The main options, merged with per-file options\n * @returns The generated ZIP archive\n */\nexport function zipSync(data, opts) {\n if (!opts)\n opts = {};\n var r = {};\n var files = [];\n fltn(data, '', r, opts);\n var o = 0;\n var tot = 0;\n for (var fn in r) {\n var _a = r[fn], file = _a[0], p = _a[1];\n var compression = p.level == 0 ? 0 : 8;\n var f = strToU8(fn), s = f.length;\n var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n var exl = exfl(p.extra);\n if (s > 65535)\n err(11);\n var d = compression ? deflateSync(file, p) : file, l = d.length;\n var c = crc();\n c.p(file);\n files.push(mrg(p, {\n size: file.length,\n crc: c.d(),\n c: d,\n f: f,\n m: m,\n u: s != fn.length || (m && (com.length != ms)),\n o: o,\n compression: compression\n }));\n o += 30 + s + exl + l;\n tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n }\n var out = new u8(tot + 22), oe = o, cdl = tot - o;\n for (var i = 0; i < files.length; ++i) {\n var f = files[i];\n wzh(out, f.o, f, f.f, f.u, f.c.length);\n var badd = 30 + f.f.length + exfl(f.extra);\n out.set(f.c, f.o + badd);\n wzh(out, o, f, f.f, f.u, f.c.length, f.o, f.m), o += 16 + badd + (f.m ? f.m.length : 0);\n }\n wzf(out, o, files.length, cdl, oe);\n return out;\n}\n/**\n * Streaming pass-through decompression for ZIP archives\n */\nvar UnzipPassThrough = /*#__PURE__*/ (function () {\n function UnzipPassThrough() {\n }\n UnzipPassThrough.prototype.push = function (data, final) {\n this.ondata(null, data, final);\n };\n UnzipPassThrough.compression = 0;\n return UnzipPassThrough;\n}());\nexport { UnzipPassThrough };\n/**\n * Streaming DEFLATE decompression for ZIP archives. Prefer AsyncZipInflate for\n * better performance.\n */\nvar UnzipInflate = /*#__PURE__*/ (function () {\n /**\n * Creates a DEFLATE decompression that can be used in ZIP archives\n */\n function UnzipInflate() {\n var _this = this;\n this.i = new Inflate(function (dat, final) {\n _this.ondata(null, dat, final);\n });\n }\n UnzipInflate.prototype.push = function (data, final) {\n try {\n this.i.push(data, final);\n }\n catch (e) {\n this.ondata(e, null, final);\n }\n };\n UnzipInflate.compression = 8;\n return UnzipInflate;\n}());\nexport { UnzipInflate };\n/**\n * Asynchronous streaming DEFLATE decompression for ZIP archives\n */\nvar AsyncUnzipInflate = /*#__PURE__*/ (function () {\n /**\n * Creates a DEFLATE decompression that can be used in ZIP archives\n */\n function AsyncUnzipInflate(_, sz) {\n var _this = this;\n if (sz < 320000) {\n this.i = new Inflate(function (dat, final) {\n _this.ondata(null, dat, final);\n });\n }\n else {\n this.i = new AsyncInflate(function (err, dat, final) {\n _this.ondata(err, dat, final);\n });\n this.terminate = this.i.terminate;\n }\n }\n AsyncUnzipInflate.prototype.push = function (data, final) {\n if (this.i.terminate)\n data = slc(data, 0);\n this.i.push(data, final);\n };\n AsyncUnzipInflate.compression = 8;\n return AsyncUnzipInflate;\n}());\nexport { AsyncUnzipInflate };\n/**\n * A ZIP archive decompression stream that emits files as they are discovered\n */\nvar Unzip = /*#__PURE__*/ (function () {\n /**\n * Creates a ZIP decompression stream\n * @param cb The callback to call whenever a file in the ZIP archive is found\n */\n function Unzip(cb) {\n this.onfile = cb;\n this.k = [];\n this.o = {\n 0: UnzipPassThrough\n };\n this.p = et;\n }\n /**\n * Pushes a chunk to be unzipped\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n Unzip.prototype.push = function (chunk, final) {\n var _this = this;\n if (!this.onfile)\n err(5);\n if (!this.p)\n err(4);\n if (this.c > 0) {\n var len = Math.min(this.c, chunk.length);\n var toAdd = chunk.subarray(0, len);\n this.c -= len;\n if (this.d)\n this.d.push(toAdd, !this.c);\n else\n this.k[0].push(toAdd);\n chunk = chunk.subarray(len);\n if (chunk.length)\n return this.push(chunk, final);\n }\n else {\n var f = 0, i = 0, is = void 0, buf = void 0;\n if (!this.p.length)\n buf = chunk;\n else if (!chunk.length)\n buf = this.p;\n else {\n buf = new u8(this.p.length + chunk.length);\n buf.set(this.p), buf.set(chunk, this.p.length);\n }\n var l = buf.length, oc = this.c, add = oc && this.d;\n var _loop_2 = function () {\n var _a;\n var sig = b4(buf, i);\n if (sig == 0x4034B50) {\n f = 1, is = i;\n this_1.d = null;\n this_1.c = 0;\n var bf = b2(buf, i + 6), cmp_1 = b2(buf, i + 8), u = bf & 2048, dd = bf & 8, fnl = b2(buf, i + 26), es = b2(buf, i + 28);\n if (l > i + 30 + fnl + es) {\n var chks_3 = [];\n this_1.k.unshift(chks_3);\n f = 2;\n var sc_1 = b4(buf, i + 18), su_1 = b4(buf, i + 22);\n var fn_1 = strFromU8(buf.subarray(i + 30, i += 30 + fnl), !u);\n if (sc_1 == 4294967295) {\n _a = dd ? [-2] : z64e(buf, i), sc_1 = _a[0], su_1 = _a[1];\n }\n else if (dd)\n sc_1 = -1;\n i += es;\n this_1.c = sc_1;\n var d_1;\n var file_1 = {\n name: fn_1,\n compression: cmp_1,\n start: function () {\n if (!file_1.ondata)\n err(5);\n if (!sc_1)\n file_1.ondata(null, et, true);\n else {\n var ctr = _this.o[cmp_1];\n if (!ctr)\n file_1.ondata(err(14, 'unknown compression type ' + cmp_1, 1), null, false);\n d_1 = sc_1 < 0 ? new ctr(fn_1) : new ctr(fn_1, sc_1, su_1);\n d_1.ondata = function (err, dat, final) { file_1.ondata(err, dat, final); };\n for (var _i = 0, chks_4 = chks_3; _i < chks_4.length; _i++) {\n var dat = chks_4[_i];\n d_1.push(dat, false);\n }\n if (_this.k[0] == chks_3 && _this.c)\n _this.d = d_1;\n else\n d_1.push(et, true);\n }\n },\n terminate: function () {\n if (d_1 && d_1.terminate)\n d_1.terminate();\n }\n };\n if (sc_1 >= 0)\n file_1.size = sc_1, file_1.originalSize = su_1;\n this_1.onfile(file_1);\n }\n return \"break\";\n }\n else if (oc) {\n if (sig == 0x8074B50) {\n is = i += 12 + (oc == -2 && 8), f = 3, this_1.c = 0;\n return \"break\";\n }\n else if (sig == 0x2014B50) {\n is = i -= 4, f = 3, this_1.c = 0;\n return \"break\";\n }\n }\n };\n var this_1 = this;\n for (; i < l - 4; ++i) {\n var state_1 = _loop_2();\n if (state_1 === \"break\")\n break;\n }\n this.p = et;\n if (oc < 0) {\n var dat = f ? buf.subarray(0, is - 12 - (oc == -2 && 8) - (b4(buf, is - 16) == 0x8074B50 && 4)) : buf.subarray(0, i);\n if (add)\n add.push(dat, !!f);\n else\n this.k[+(f == 2)].push(dat);\n }\n if (f & 2)\n return this.push(buf.subarray(i), final);\n this.p = buf.subarray(i);\n }\n if (final) {\n if (this.c)\n err(13);\n this.p = null;\n }\n };\n /**\n * Registers a decoder with the stream, allowing for files compressed with\n * the compression type provided to be expanded correctly\n * @param decoder The decoder constructor\n */\n Unzip.prototype.register = function (decoder) {\n this.o[decoder.compression] = decoder;\n };\n return Unzip;\n}());\nexport { Unzip };\nvar mt = typeof queueMicrotask == 'function' ? queueMicrotask : typeof setTimeout == 'function' ? setTimeout : function (fn) { fn(); };\nexport function unzip(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n var term = [];\n var tAll = function () {\n for (var i = 0; i < term.length; ++i)\n term[i]();\n };\n var files = {};\n var cbd = function (a, b) {\n mt(function () { cb(a, b); });\n };\n mt(function () { cbd = cb; });\n var e = data.length - 22;\n for (; b4(data, e) != 0x6054B50; --e) {\n if (!e || data.length - e > 65558) {\n cbd(err(13, 0, 1), null);\n return tAll;\n }\n }\n ;\n var lft = b2(data, e + 8);\n if (lft) {\n var c = lft;\n var o = b4(data, e + 16);\n var z = o == 4294967295 || c == 65535;\n if (z) {\n var ze = b4(data, e - 12);\n z = b4(data, ze) == 0x6064B50;\n if (z) {\n c = lft = b4(data, ze + 32);\n o = b4(data, ze + 48);\n }\n }\n var fltr = opts && opts.filter;\n var _loop_3 = function (i) {\n var _a = zh(data, o, z), c_1 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n o = no;\n var cbl = function (e, d) {\n if (e) {\n tAll();\n cbd(e, null);\n }\n else {\n if (d)\n files[fn] = d;\n if (!--lft)\n cbd(null, files);\n }\n };\n if (!fltr || fltr({\n name: fn,\n size: sc,\n originalSize: su,\n compression: c_1\n })) {\n if (!c_1)\n cbl(null, slc(data, b, b + sc));\n else if (c_1 == 8) {\n var infl = data.subarray(b, b + sc);\n // Synchronously decompress under 512KB, or barely-compressed data\n if (su < 524288 || sc > 0.8 * su) {\n try {\n cbl(null, inflateSync(infl, { out: new u8(su) }));\n }\n catch (e) {\n cbl(e, null);\n }\n }\n else\n term.push(inflate(infl, { size: su }, cbl));\n }\n else\n cbl(err(14, 'unknown compression type ' + c_1, 1), null);\n }\n else\n cbl(null, null);\n };\n for (var i = 0; i < c; ++i) {\n _loop_3(i);\n }\n }\n else\n cbd(null, {});\n return tAll;\n}\n/**\n * Synchronously decompresses a ZIP archive. Prefer using `unzip` for better\n * performance with more than one file.\n * @param data The raw compressed ZIP file\n * @param opts The ZIP extraction options\n * @returns The decompressed files\n */\nexport function unzipSync(data, opts) {\n var files = {};\n var e = data.length - 22;\n for (; b4(data, e) != 0x6054B50; --e) {\n if (!e || data.length - e > 65558)\n err(13);\n }\n ;\n var c = b2(data, e + 8);\n if (!c)\n return {};\n var o = b4(data, e + 16);\n var z = o == 4294967295 || c == 65535;\n if (z) {\n var ze = b4(data, e - 12);\n z = b4(data, ze) == 0x6064B50;\n if (z) {\n c = b4(data, ze + 32);\n o = b4(data, ze + 48);\n }\n }\n var fltr = opts && opts.filter;\n for (var i = 0; i < c; ++i) {\n var _a = zh(data, o, z), c_2 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n o = no;\n if (!fltr || fltr({\n name: fn,\n size: sc,\n originalSize: su,\n compression: c_2\n })) {\n if (!c_2)\n files[fn] = slc(data, b, b + sc);\n else if (c_2 == 8)\n files[fn] = inflateSync(data.subarray(b, b + sc), { out: new u8(su) });\n else\n err(14, 'unknown compression type ' + c_2);\n }\n }\n return files;\n}\n","import {\n inspectZipManifest,\n ZipManifestError,\n} from '@happyvertical/files/archive';\nimport { Inflate } from 'fflate/browser';\nimport {\n checkLimit,\n SpreadsheetError,\n type SpreadsheetLimits,\n} from './errors.js';\n\n// The shared archive subpath is browser-safe; redact its path-bearing errors.\nexport function unzipBounded(\n bytes: Uint8Array,\n limits: SpreadsheetLimits,\n): Map<string, Uint8Array> {\n try {\n checkLimit(bytes.length, 'maxInputBytes', limits);\n const manifest = inspectZipManifest(bytes, {\n maxEntries: limits.maxEntries,\n maxEntryUncompressedBytes: limits.maxEntryBytes,\n maxTotalUncompressedBytes: limits.maxTotalBytes,\n maxPathBytes: limits.maxPathBytes,\n });\n for (const entry of manifest.entries) {\n if (entry.compressionMethod !== 0 && entry.compressionMethod !== 8)\n throw new SpreadsheetError(\n 'UNSUPPORTED_ZIP',\n 'Unsupported ZIP compression method.',\n );\n }\n const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n const output = new Map<string, Uint8Array>();\n let end = bytes.length - 22;\n while (\n end >= 0 &&\n (view.getUint32(end, true) !== 0x06054b50 ||\n end + 22 + view.getUint16(end + 20, true) !== bytes.length)\n )\n end--;\n if (end < 0)\n throw new SpreadsheetError('INVALID_ZIP', 'Missing ZIP end record.');\n let central = view.getUint32(end + 16, true);\n let total = 0;\n for (const entry of manifest.entries) {\n const offset = view.getUint32(central + 42, true);\n const nameLength = view.getUint16(offset + 26, true);\n const extraLength = view.getUint16(offset + 28, true);\n const start = offset + 30 + nameLength + extraLength;\n const compressed = bytes.subarray(start, start + entry.compressedSize);\n const chunks: Uint8Array[] = [];\n let size = 0;\n const ondata = (chunk: Uint8Array) => {\n size += chunk.length;\n total += chunk.length;\n checkLimit(size, 'maxEntryBytes', limits);\n checkLimit(total, 'maxTotalBytes', limits);\n // Actual inflated bytes enforce the primary caps, even if ZIP metadata\n // lies. Ratio is only a secondary, per-entry guard above the floor.\n if (\n size > limits.compressionRatioFloorBytes &&\n size > Math.max(1, entry.compressedSize) * limits.maxCompressionRatio\n )\n throw new SpreadsheetError(\n 'LIMIT_EXCEEDED',\n 'ZIP compression ratio exceeds limit.',\n 'maxCompressionRatio',\n );\n if (size > entry.size)\n throw new SpreadsheetError(\n 'INVALID_ZIP',\n 'ZIP inflated size differs from manifest.',\n );\n chunks.push(chunk);\n };\n if (entry.compressionMethod === 0) ondata(compressed);\n else {\n const inflater = new Inflate(ondata);\n // A small input quantum bounds temporary DEFLATE output even for forged sizes.\n for (let p = 0; p < compressed.length; p += 256)\n inflater.push(\n compressed.subarray(p, p + 256),\n p + 256 >= compressed.length,\n );\n if (compressed.length === 0)\n throw new SpreadsheetError('INVALID_ZIP', 'Empty DEFLATE stream.');\n }\n if (size !== entry.size)\n throw new SpreadsheetError(\n 'INVALID_ZIP',\n 'ZIP inflated size differs from manifest.',\n );\n const data = new Uint8Array(size);\n let p = 0;\n for (const chunk of chunks) {\n data.set(chunk, p);\n p += chunk.length;\n }\n // The manifest validates local/central CRC agreement; also verify content.\n if (crc32(data) !== view.getUint32(central + 16, true))\n throw new SpreadsheetError('INVALID_ZIP', 'ZIP checksum mismatch.');\n output.set(entry.path, data);\n central +=\n 46 +\n view.getUint16(central + 28, true) +\n view.getUint16(central + 30, true) +\n view.getUint16(central + 32, true);\n }\n return output;\n } catch (error) {\n if (error instanceof SpreadsheetError) throw error;\n if (error instanceof ZipManifestError) {\n const code =\n error.code === 'ZIP_LIMIT_EXCEEDED'\n ? 'LIMIT_EXCEEDED'\n : error.code === 'ZIP_UNSAFE_ENTRY'\n ? 'UNSAFE_ZIP'\n : error.code === 'ZIP_UNSUPPORTED_FEATURE'\n ? 'UNSUPPORTED_ZIP'\n : 'INVALID_ZIP';\n throw new SpreadsheetError(\n code,\n 'Invalid, unsafe or oversized ZIP archive.',\n );\n }\n throw new SpreadsheetError('INVALID_ZIP', 'Invalid ZIP archive.');\n }\n}\nfunction crc32(data: Uint8Array): number {\n let crc = 0xffffffff;\n for (const byte of data) {\n crc ^= byte;\n for (let bit = 0; bit < 8; bit++)\n crc = (crc >>> 1) ^ (crc & 1 ? 0xedb88320 : 0);\n }\n return (crc ^ 0xffffffff) >>> 0;\n}\n","import {\n checkLimit,\n invalid,\n type SpreadsheetLimits,\n WorkBudget,\n} from './errors.js';\nimport { BUILTIN_FORMATS, formatKind, serialDate } from './formats.js';\nimport {\n directReference,\n FormulaScanner,\n parseFormula,\n translateFormula,\n} from './formula.js';\nimport {\n type Cell,\n createSheet,\n type DataValidation,\n type Point,\n point,\n type Range,\n range,\n type Workbook,\n} from './model.js';\nimport { WorkbookIndex } from './reference-index.js';\nimport { child, children, parseXml, textContent, type XmlNode } from './xml.js';\nimport { unzipBounded } from './zip.js';\n\ninterface Relationship {\n target: string;\n type: string;\n}\nconst attr = (node: XmlNode, name: string) =>\n node.attrs[name] ??\n Object.entries(node.attrs).find(\n ([key]) => key.split(':').pop() === name,\n )?.[1];\nconst number = (value: string | undefined, fallback = 0): number => {\n if (value === undefined) return fallback;\n if (\n !/^[+-]?(?:\\d+\\.?\\d*|\\.\\d+)(?:[eE][+-]?\\d+)?$/.test(value.trim()) ||\n !Number.isFinite(Number(value))\n )\n invalid('Invalid numeric workbook field.');\n return Number(value);\n};\nfunction integer(value: string | undefined, fallback = 0): number {\n const n = number(value, fallback);\n if (!Number.isSafeInteger(n) || n < 0) invalid('Invalid workbook index.');\n return n;\n}\nfunction targetPath(base: string, target: string): string {\n if (/[\\\\\\0?#:]/.test(target)) invalid('Unsafe workbook relationship.');\n const result = target.startsWith('/') ? [] : base.split('/').slice(0, -1);\n for (const part of target.split('/')) {\n if (part === '..') {\n if (!result.length) invalid('Unsafe workbook relationship.');\n result.pop();\n } else if (part && part !== '.') result.push(part);\n }\n return result.join('/');\n}\nfunction boundRange(value: string, limits: SpreadsheetLimits): Range {\n const result = range(value);\n checkLimit(result.end.row, 'maxRows', limits);\n checkLimit(result.end.col, 'maxColumns', limits);\n return result;\n}\n\nexport function readXlsx(\n bytes: Uint8Array,\n limits: SpreadsheetLimits,\n): Workbook {\n const files = unzipBounded(bytes, limits);\n const work = new WorkBudget(limits.maxReadWork, 'maxReadWork');\n const scanner = new FormulaScanner(limits, (n) => work.spend(n));\n const partReferences = new Map<string, number>();\n const tableParts = new Set<string>();\n const worksheetParts = new Set<string>();\n let tableCount = 0;\n let mergeCount = 0;\n let validationCount = 0;\n let validationRangeCount = 0;\n const xmlCache = new Map<string, XmlNode>();\n const xml = (path: string): XmlNode => {\n work.spend();\n const count = (partReferences.get(path) ?? 0) + 1;\n partReferences.set(path, count);\n checkLimit(count, 'maxPartReferences', limits);\n const existing = xmlCache.get(path);\n if (existing) return existing;\n const data = files.get(path);\n if (!data) invalid('Missing workbook part.');\n const result = parseXml(data, limits, () => work.spend(4));\n xmlCache.set(path, result);\n return result;\n };\n const relationships = (base: string): Map<string, Relationship> => {\n const parts = base.split('/');\n const file = parts.pop() ?? '';\n const relPath = [...parts, '_rels', `${file}.rels`].join('/');\n if (!files.has(relPath)) return new Map();\n const doc = xml(relPath);\n if (doc.name !== 'Relationships') invalid();\n const rels = new Map<string, Relationship>();\n for (const node of children(doc, 'Relationship')) {\n work.spend((node.attrs.Target?.length ?? 0) + 1);\n if (node.attrs.TargetMode === 'External') continue;\n const id = node.attrs.Id;\n const target = node.attrs.Target;\n const type = node.attrs.Type;\n if (!id || !target || !type || rels.has(id)) invalid();\n rels.set(id, { target: targetPath(base, target), type });\n }\n return rels;\n };\n const rootRels = relationships('');\n const workbookPath = [...rootRels.values()].find((r) =>\n r.type.endsWith('/officeDocument'),\n )?.target;\n if (!workbookPath) invalid('Missing workbook relationship.');\n const wbXml = xml(workbookPath);\n if (wbXml.name !== 'workbook') invalid();\n const rels = relationships(workbookPath);\n checkLimit(\n child(wbXml, 'definedNames')?.children.length ?? 0,\n 'maxDefinedNames',\n limits,\n );\n const part = (suffix: string): string | undefined =>\n [...rels.values()].find((r) => r.type.endsWith(`/${suffix}`))?.target;\n const dateSystem = ['1', 'true'].includes(\n child(wbXml, 'workbookPr')?.attrs.date1904 ?? '',\n )\n ? 1904\n : 1900;\n const workbook: Workbook = {\n sheets: [],\n definedNames: [],\n dateSystem,\n source: { format: 'xlsx' },\n };\n const strings: string[] = [];\n const stringsPath = part('sharedStrings');\n if (stringsPath) {\n const doc = xml(stringsPath);\n if (doc.name !== 'sst') invalid();\n for (const si of children(doc, 'si')) {\n checkLimit(strings.length + 1, 'maxSharedStrings', limits);\n strings.push(richText(si));\n }\n }\n const formats = { ...BUILTIN_FORMATS };\n const styles: string[] = [];\n const stylesPath = part('styles');\n if (stylesPath) {\n const doc = xml(stylesPath);\n if (doc.name !== 'styleSheet') invalid();\n for (const node of child(doc, 'numFmts')?.children ?? []) {\n if (node.name === 'numFmt')\n formats[integer(node.attrs.numFmtId)] =\n node.attrs.formatCode ?? 'General';\n }\n for (const node of child(doc, 'cellXfs')?.children ?? [])\n if (node.name === 'xf')\n styles.push(formats[integer(node.attrs.numFmtId)] ?? 'General');\n }\n const formatKinds = new Map<string, ReturnType<typeof formatKind>>();\n let cellCount = 0;\n const sheetNodes = child(wbXml, 'sheets')?.children ?? [];\n checkLimit(sheetNodes.length, 'maxSheets', limits);\n const names = new Set<string>();\n for (const sheetNode of sheetNodes) {\n if (sheetNode.name !== 'sheet') continue;\n const name = sheetNode.attrs.name;\n if (!name || names.has(name.toLowerCase()))\n invalid('Invalid or duplicate sheet name.');\n names.add(name.toLowerCase());\n const rel = rels.get(attr(sheetNode, 'id') ?? '');\n if (!rel?.type.endsWith('/worksheet'))\n invalid('Missing worksheet relationship.');\n const doc = xml(rel.target);\n if (worksheetParts.has(rel.target)) invalid('Repeated worksheet part.');\n worksheetParts.add(rel.target);\n if (doc.name !== 'worksheet') invalid();\n const sheet = createSheet(name);\n workbook.sheets.push(sheet);\n const state = sheetNode.attrs.state ?? 'visible';\n if (state !== 'visible' && state !== 'hidden' && state !== 'veryHidden')\n invalid('Invalid worksheet state.');\n sheet.state = state;\n const dimension = child(doc, 'dimension')?.attrs.ref;\n if (dimension) sheet.dimension = boundRange(dimension, limits);\n const pane = child(child(doc, 'sheetViews')?.children[0] ?? doc, 'pane');\n if (pane && ['frozen', 'frozenSplit'].includes(pane.attrs.state)) {\n sheet.frozen = {\n rows: integer(pane.attrs.ySplit),\n cols: integer(pane.attrs.xSplit),\n };\n checkLimit(sheet.frozen.rows, 'maxRows', limits);\n checkLimit(sheet.frozen.cols, 'maxColumns', limits);\n }\n const widths: Record<number, number> = {};\n let widthWork = 0;\n for (const col of child(doc, 'cols')?.children ?? []) {\n const min = integer(col.attrs.min);\n const max = integer(col.attrs.max);\n if (min < 1 || max < min) invalid();\n checkLimit(max, 'maxColumns', limits);\n const width = number(col.attrs.width);\n if (width < 0) invalid();\n work.spend(max - min + 1);\n widthWork += max - min + 1;\n checkLimit(widthWork, 'maxCells', limits);\n for (let i = min; i <= max; i++) widths[i] = width;\n }\n if (Object.keys(widths).length) sheet.columnWidths = widths;\n const shared = new Map<\n number,\n { text: string; origin: Point; range: Range }\n >();\n const followers: { cell: Cell; origin: Point; id: number }[] = [];\n let rowIndex = 0;\n for (const row of child(doc, 'sheetData')?.children ?? []) {\n if (row.name !== 'row') continue;\n rowIndex = integer(row.attrs.r, rowIndex + 1);\n if (rowIndex < 1) invalid();\n checkLimit(rowIndex, 'maxRows', limits);\n let colIndex = 0;\n for (const node of children(row, 'c')) {\n work.spend();\n checkLimit(++cellCount, 'maxCells', limits);\n const origin = node.attrs.r\n ? point(node.attrs.r)\n : { row: rowIndex, col: colIndex + 1 };\n if (origin.row !== rowIndex)\n invalid('Cell and row coordinates disagree.');\n checkLimit(origin.row, 'maxRows', limits);\n checkLimit(origin.col, 'maxColumns', limits);\n colIndex = origin.col;\n if (sheet.cells.get(origin.row, origin.col))\n invalid('Duplicate cell coordinate.');\n const format = styles[integer(node.attrs.s)] ?? 'General';\n let kind = formatKinds.get(format);\n if (!kind) {\n work.spend(format.length);\n kind = formatKind(format);\n formatKinds.set(format, kind);\n }\n const value = child(node, 'v')?.text;\n const type = node.attrs.t;\n if (\n type !== undefined &&\n !['inlineStr', 's', 'str', 'e', 'b', 'd', 'n'].includes(type)\n )\n invalid('Unsupported cell type.');\n let cell: Cell = {\n type: 'empty',\n value: null,\n numberFormat: format,\n formatKind: kind,\n };\n if (type === 'inlineStr')\n cell = {\n ...cell,\n value: child(node, 'is')\n ? richText(child(node, 'is') as XmlNode)\n : '',\n type: 'text',\n };\n else if (type === 's') {\n const index = integer(value);\n if (value === undefined || index >= strings.length)\n invalid('Invalid shared string index.');\n cell.value = strings[index];\n cell.type = 'text';\n } else if (type === 'str') {\n cell.value = decodeOoxmlText(value ?? '');\n cell.type = 'text';\n } else if (type === 'e') {\n cell.error = value ?? '#VALUE!';\n cell.value = null;\n cell.type = 'error';\n } else if (type === 'b' && value !== undefined) {\n if (!['0', '1', 'true', 'false'].includes(value))\n invalid('Invalid boolean cell.');\n cell.value = value === '1' || value === 'true';\n cell.type = 'boolean';\n } else if (type === 'd' && value !== undefined) {\n const date = new Date(value);\n if (!Number.isFinite(date.getTime())) invalid('Invalid date cell.');\n cell.value = date;\n cell.type = 'date';\n } else if (value !== undefined && value !== '') {\n if (type && type !== 'n') invalid('Unsupported cell type.');\n const n = number(value);\n if (['date', 'time', 'datetime'].includes(kind)) {\n cell.value = serialDate(n, dateSystem);\n cell.raw = n;\n cell.type = 'date';\n if (!Number.isFinite(cell.value.getTime()))\n invalid('Date serial exceeds supported range.');\n } else {\n cell.value = n;\n cell.type = 'number';\n }\n }\n const f = child(node, 'f');\n if (f) {\n checkLimit(f.text.length, 'maxFormulaLength', limits);\n if (f.attrs.t === 'shared') {\n if (f.attrs.si === undefined)\n invalid('Missing shared formula index.');\n const id = integer(f.attrs.si);\n if (f.text) {\n if (shared.has(id) || !f.attrs.ref)\n invalid('Invalid shared formula anchor.');\n shared.set(id, {\n text: f.text,\n origin,\n range: boundRange(f.attrs.ref, limits),\n });\n cell.formula = parseFormula(f.text, limits, scanner);\n } else followers.push({ cell, origin, id });\n } else {\n cell.formula = parseFormula(f.text, limits, scanner);\n if (f.attrs.t === 'array' && f.attrs.ref)\n cell.formula.arrayRange = boundRange(f.attrs.ref, limits);\n }\n }\n sheet.cells.set(origin.row, origin.col, cell);\n }\n }\n for (const follower of followers) {\n const master = shared.get(follower.id);\n if (!master) invalid('Missing shared formula anchor.');\n const p = follower.origin;\n const r = master.range;\n if (\n p.row < r.start.row ||\n p.row > r.end.row ||\n p.col < r.start.col ||\n p.col > r.end.col\n )\n invalid('Shared formula is outside its range.');\n follower.cell.formula = translateFormula(\n master.text,\n master.origin,\n p,\n limits,\n scanner,\n );\n }\n for (const merge of child(doc, 'mergeCells')?.children ?? []) {\n checkLimit(++mergeCount, 'maxMerges', limits);\n work.spend();\n sheet.merges.push(boundRange(merge.attrs.ref ?? '', limits));\n }\n for (const node of child(doc, 'dataValidations')?.children ?? []) {\n checkLimit(++validationCount, 'maxDataValidations', limits);\n work.spend((node.attrs.sqref?.length ?? 0) + 1);\n const kind = node.attrs.type;\n if (\n !['list', 'whole', 'decimal', 'date', 'textLength', 'custom'].includes(\n kind,\n )\n )\n continue;\n const rangeTexts = (node.attrs.sqref ?? '').trim().split(/\\s+/);\n validationRangeCount += rangeTexts.length;\n checkLimit(validationRangeCount, 'maxDataValidations', limits);\n const validation: DataValidation = {\n ranges: rangeTexts.map((s) => boundRange(s, limits)),\n kind: kind as DataValidation['kind'],\n };\n const formula = child(node, 'formula1')?.text;\n if (formula !== undefined) {\n checkLimit(formula.length, 'maxFormulaLength', limits);\n validation.formula = formula;\n if (kind === 'list' && /^\".*\"$/s.test(formula))\n validation.values = formula\n .slice(1, -1)\n .replace(/\"\"/g, '\"')\n .split(',');\n else validation.source = directReference(formula, scanner);\n }\n sheet.validations.push(validation);\n }\n const sheetRels = relationships(rel.target);\n for (const node of child(doc, 'tableParts')?.children ?? []) {\n const tableRel = sheetRels.get(attr(node, 'id') ?? '');\n if (!tableRel?.type.endsWith('/table'))\n invalid('Missing table relationship.');\n const table = xml(tableRel.target);\n if (tableParts.has(tableRel.target)) continue;\n tableParts.add(tableRel.target);\n checkLimit(++tableCount, 'maxTables', limits);\n if (table.name !== 'table') invalid();\n const tableName = table.attrs.displayName ?? table.attrs.name;\n if (!tableName) invalid('Missing table name.');\n const tableRange = boundRange(table.attrs.ref ?? '', limits);\n const tableColumns = (child(table, 'tableColumns')?.children ?? [])\n .filter((c) => c.name === 'tableColumn')\n .map((c) => c.attrs.name);\n if (\n tableColumns.some((name) => !name) ||\n tableColumns.length !== tableRange.end.col - tableRange.start.col + 1\n )\n invalid('Invalid table columns.');\n sheet.tables.push({\n name: tableName,\n range: tableRange,\n headerRow: integer(table.attrs.headerRowCount, 1) > 0,\n totalsRow: integer(table.attrs.totalsRowCount) > 0,\n columns: tableColumns,\n });\n }\n }\n if (!workbook.sheets.length) invalid('Workbook has no worksheets.');\n for (const node of child(wbXml, 'definedNames')?.children ?? []) {\n if (!node.attrs.name) invalid('Missing defined name.');\n work.spend(node.attrs.name.length + 1);\n checkLimit(node.text.length, 'maxFormulaLength', limits);\n const scope =\n node.attrs.localSheetId !== undefined\n ? workbook.sheets[integer(node.attrs.localSheetId)]?.name\n : undefined;\n if (node.attrs.localSheetId !== undefined && !scope)\n invalid('Invalid defined-name scope.');\n workbook.definedNames.push({\n name: node.attrs.name,\n scope,\n text: node.text,\n reference: directReference(node.text, scanner),\n });\n }\n const referenceIndex = new WorkbookIndex(workbook, limits, scanner, (n) =>\n work.spend(n),\n );\n for (const sheet of workbook.sheets) {\n work.spend(\n sheet.cells.size *\n Math.max(1, Math.ceil(Math.log2(sheet.cells.size + 1))),\n );\n for (const [origin, cell] of sheet.cells)\n if (cell.formula)\n cell.formula.references = cell.formula.references.map(\n (r) => referenceIndex.resolve(r, sheet.name, origin) ?? r,\n );\n for (const validation of sheet.validations)\n if (validation.source)\n validation.source =\n referenceIndex.resolve(\n validation.source,\n sheet.name,\n validation.ranges[0].start,\n ) ?? validation.source;\n }\n return workbook;\n}\n\nfunction richText(node: XmlNode): string {\n return decodeOoxmlText(\n node.children\n .filter((n) => n.name === 't' || n.name === 'r')\n .map((n) =>\n n.name === 't'\n ? textContent(n)\n : children(n, 't').map(textContent).join(''),\n )\n .join(''),\n );\n}\n\nfunction decodeOoxmlText(value: string): string {\n return value.replace(/_x([0-9a-f]{4})_/gi, (_, hex: string) =>\n String.fromCharCode(Number.parseInt(hex, 16)),\n );\n}\n","import { strToU8, zipSync } from 'fflate/browser';\nimport { checkLimit, invalid, type SpreadsheetLimits } from './errors.js';\nimport { dateSerial, serialDate } from './formats.js';\nimport { validateWorkbook } from './io.js';\nimport { address, type Cell, rangeAddress, type Workbook } from './model.js';\nimport type { WriteOptions } from './types.js';\nimport { escapeXml as e } from './xml.js';\n\nconst ns = 'http://schemas.openxmlformats.org/spreadsheetml/2006/main';\nconst relNs =\n 'http://schemas.openxmlformats.org/officeDocument/2006/relationships';\nconst xmlHeader = '<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"yes\"?>';\n\nexport function writeXlsx(\n workbook: Workbook,\n limits: SpreadsheetLimits,\n options: WriteOptions,\n): Uint8Array {\n validateWorkbook(workbook, limits);\n const files: Record<string, Uint8Array> = Object.create(null);\n let total = 0;\n const put = (path: string, xml: string) => {\n const bytes = strToU8(xmlHeader + xml);\n checkLimit(bytes.length, 'maxEntryBytes', limits);\n total += bytes.length;\n checkLimit(total, 'maxTotalBytes', limits);\n files[path] = bytes;\n checkLimit(Object.keys(files).length, 'maxEntries', limits);\n };\n const customFormats: string[] = [];\n const styles: { format: string; bold: boolean }[] = [\n { format: 'General', bold: false },\n ];\n const styleCache = new Map<string, number>();\n const formatCache = new Map<string, number>();\n const styleIndex = (cell: Cell, bold: boolean): number => {\n const format =\n cell.numberFormat ??\n (cell.type === 'date'\n ? 'yyyy-mm-dd\"T\"hh:mm:ss'\n : cell.formatKind === 'currency'\n ? '$#,##0.00'\n : cell.formatKind === 'percent'\n ? '0.00%'\n : 'General');\n const key = `${bold}:${format}`;\n const cached = styleCache.get(key);\n if (cached !== undefined) return cached;\n const index = format === 'General' && !bold ? 0 : styles.length;\n if (index) styles.push({ format, bold });\n styleCache.set(key, index);\n if (format !== 'General' && !formatCache.has(format)) {\n formatCache.set(format, customFormats.length);\n customFormats.push(format);\n }\n return index;\n };\n let tableId = 0;\n for (const [index, sheet] of workbook.sheets.entries()) {\n const firstRow = sheet.cells.rows().next().value?.[0];\n let data = '';\n for (const [row, cells] of sheet.cells.rows()) {\n let body = '';\n for (const [col, cell] of cells) {\n const s = styleIndex(cell, !!options.boldHeaderRow && row === firstRow);\n let type = '';\n let value = '';\n if (cell.type === 'text') {\n if (cell.formula) {\n type = ' t=\"str\"';\n value = `<v>${e(String(cell.value).replace(/_x[0-9a-f]{4}_/gi, (s) => `_x005F_${s.slice(1)}`))}</v>`;\n } else {\n type = ' t=\"inlineStr\"';\n value = `<is><t xml:space=\"preserve\">${e(String(cell.value).replace(/_x[0-9a-f]{4}_/gi, (s) => `_x005F_${s.slice(1)}`))}</t></is>`;\n }\n } else if (cell.type === 'boolean') {\n type = ' t=\"b\"';\n value = `<v>${cell.value ? 1 : 0}</v>`;\n } else if (cell.type === 'error') {\n type = ' t=\"e\"';\n value = `<v>${e(cell.error ?? '#VALUE!')}</v>`;\n } else if (cell.type === 'number') value = `<v>${cell.value}</v>`;\n else if (cell.type === 'date') {\n const date = cell.value as Date;\n // Retain serial 60 only while it still represents this cell's value.\n const raw =\n cell.raw !== undefined &&\n Number.isFinite(cell.raw) &&\n serialDate(cell.raw, workbook.dateSystem).getTime() ===\n date.getTime()\n ? cell.raw\n : dateSerial(date, workbook.dateSystem);\n if (cell.numberFormat?.toLowerCase() === 'general') {\n type = ' t=\"d\"';\n value = `<v>${date.toISOString()}</v>`;\n } else value = `<v>${raw}</v>`;\n }\n const formula = cell.formula\n ? `<f${cell.formula.arrayRange ? ` t=\"array\" ref=\"${rangeAddress(cell.formula.arrayRange)}\"` : ''}>${e(cell.formula.text.replace(/^=/, ''))}</f>`\n : '';\n body += `<c r=\"${address({ row, col })}\" s=\"${s}\"${type}>${formula}${value}</c>`;\n }\n data += `<row r=\"${row}\">${body}</row>`;\n checkLimit(data.length, 'maxEntryBytes', limits);\n }\n const widths = options.columnWidths\n ? Object.fromEntries(\n options.columnWidths.map((width, i) => [i + 1, width]),\n )\n : (sheet.columnWidths ?? {});\n let cols = '';\n for (const [key, width] of Object.entries(widths)) {\n const col = Number(key);\n if (\n !Number.isInteger(col) ||\n col < 1 ||\n !Number.isFinite(width) ||\n width < 0 ||\n width > 255\n )\n invalid('Invalid column width.');\n checkLimit(col, 'maxColumns', limits);\n cols += `<col min=\"${col}\" max=\"${col}\" width=\"${width}\" customWidth=\"1\"/>`;\n }\n const pane = sheet.frozen\n ? `<sheetViews><sheetView workbookViewId=\"0\"><pane xSplit=\"${sheet.frozen.cols}\" ySplit=\"${sheet.frozen.rows}\" topLeftCell=\"${address({ row: sheet.frozen.rows + 1, col: sheet.frozen.cols + 1 })}\" state=\"frozen\"/></sheetView></sheetViews>`\n : '';\n const merges = sheet.merges.length\n ? `<mergeCells count=\"${sheet.merges.length}\">${sheet.merges.map((r) => `<mergeCell ref=\"${rangeAddress(r)}\"/>`).join('')}</mergeCells>`\n : '';\n const validations = sheet.validations.length\n ? `<dataValidations count=\"${sheet.validations.length}\">${sheet.validations.map((v) => `<dataValidation type=\"${v.kind}\" sqref=\"${v.ranges.map(rangeAddress).join(' ')}\"><formula1>${e(v.formula ?? (v.values ? `\"${v.values.join(',')}\"` : ''))}</formula1></dataValidation>`).join('')}</dataValidations>`\n : '';\n const tableParts = sheet.tables.length\n ? `<tableParts count=\"${sheet.tables.length}\">${sheet.tables.map((_, i) => `<tablePart r:id=\"t${i}\"/>`).join('')}</tableParts>`\n : '';\n put(\n `xl/worksheets/sheet${index + 1}.xml`,\n `<worksheet xmlns=\"${ns}\" xmlns:r=\"${relNs}\">${pane}${cols ? `<cols>${cols}</cols>` : ''}<sheetData>${data}</sheetData>${merges}${validations}${tableParts}</worksheet>`,\n );\n if (sheet.tables.length) {\n put(\n `xl/worksheets/_rels/sheet${index + 1}.xml.rels`,\n relationships(\n sheet.tables.map((_, i) => ({\n id: `t${i}`,\n type: 'table',\n target: `../tables/table${index + 1}_${i + 1}.xml`,\n })),\n ),\n );\n for (const [i, table] of sheet.tables.entries())\n put(\n `xl/tables/table${index + 1}_${i + 1}.xml`,\n `<table xmlns=\"${ns}\" id=\"${++tableId}\" name=\"${e(table.name)}\" displayName=\"${e(table.name)}\" ref=\"${rangeAddress(table.range)}\" headerRowCount=\"${table.headerRow ? 1 : 0}\" totalsRowCount=\"${table.totalsRow ? 1 : 0}\"><tableColumns count=\"${table.columns.length}\">${table.columns.map((name, c) => `<tableColumn id=\"${c + 1}\" name=\"${e(name)}\"/>`).join('')}</tableColumns></table>`,\n );\n }\n }\n put(\n 'xl/styles.xml',\n `<styleSheet xmlns=\"${ns}\"><numFmts count=\"${customFormats.length}\">${customFormats.map((format, i) => `<numFmt numFmtId=\"${164 + i}\" formatCode=\"${e(format)}\"/>`).join('')}</numFmts><fonts count=\"2\"><font><sz val=\"11\"/><name val=\"Calibri\"/></font><font><b/><sz val=\"11\"/><name val=\"Calibri\"/></font></fonts><fills count=\"2\"><fill><patternFill patternType=\"none\"/></fill><fill><patternFill patternType=\"gray125\"/></fill></fills><borders count=\"1\"><border/></borders><cellStyleXfs count=\"1\"><xf numFmtId=\"0\" fontId=\"0\" fillId=\"0\" borderId=\"0\"/></cellStyleXfs><cellXfs count=\"${styles.length}\">${styles.map((s) => `<xf numFmtId=\"${s.format === 'General' ? 0 : 164 + (formatCache.get(s.format) ?? 0)}\" fontId=\"${s.bold ? 1 : 0}\" fillId=\"0\" borderId=\"0\" xfId=\"0\" applyNumberFormat=\"1\"${s.bold ? ' applyFont=\"1\"' : ''}/>`).join('')}</cellXfs><cellStyles count=\"1\"><cellStyle name=\"Normal\" xfId=\"0\" builtinId=\"0\"/></cellStyles></styleSheet>`,\n );\n const defined = workbook.definedNames\n .map((n) => {\n const scope =\n n.scope === undefined\n ? -1\n : workbook.sheets.findIndex((s) => s.name === n.scope);\n if (n.scope !== undefined && scope < 0)\n invalid('Unknown defined-name scope.');\n return `<definedName name=\"${e(n.name)}\"${scope < 0 ? '' : ` localSheetId=\"${scope}\"`}>${e(n.text)}</definedName>`;\n })\n .join('');\n put(\n 'xl/workbook.xml',\n `<workbook xmlns=\"${ns}\" xmlns:r=\"${relNs}\"><workbookPr date1904=\"${workbook.dateSystem === 1904 ? 1 : 0}\"/><sheets>${workbook.sheets.map((s, i) => `<sheet name=\"${e(s.name)}\" sheetId=\"${i + 1}\" state=\"${s.state}\" r:id=\"s${i + 1}\"/>`).join('')}</sheets>${defined ? `<definedNames>${defined}</definedNames>` : ''}<calcPr fullCalcOnLoad=\"1\"/></workbook>`,\n );\n put(\n '_rels/.rels',\n relationships([\n { id: 'office', type: 'officeDocument', target: 'xl/workbook.xml' },\n ]),\n );\n put(\n 'xl/_rels/workbook.xml.rels',\n relationships([\n ...workbook.sheets.map((_, i) => ({\n id: `s${i + 1}`,\n type: 'worksheet',\n target: `worksheets/sheet${i + 1}.xml`,\n })),\n { id: 'styles', type: 'styles', target: 'styles.xml' },\n ]),\n );\n put(\n '[Content_Types].xml',\n `<Types xmlns=\"http://schemas.openxmlformats.org/package/2006/content-types\"><Default Extension=\"rels\" ContentType=\"application/vnd.openxmlformats-package.relationships+xml\"/><Default Extension=\"xml\" ContentType=\"application/xml\"/><Override PartName=\"/xl/workbook.xml\" ContentType=\"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet.main+xml\"/><Override PartName=\"/xl/styles.xml\" ContentType=\"application/vnd.openxmlformats-officedocument.spreadsheetml.styles+xml\"/>${Object.keys(\n files,\n )\n .filter((p) => /^xl\\/(worksheets|tables)\\/[^/]+\\.xml$/.test(p))\n .map(\n (p) =>\n `<Override PartName=\"/${p}\" ContentType=\"application/vnd.openxmlformats-officedocument.spreadsheetml.${p.startsWith('xl/tables/') ? 'table' : 'worksheet'}+xml\"/>`,\n )\n .join('')}</Types>`,\n );\n const output = zipSync(files);\n checkLimit(output.length, 'maxInputBytes', limits);\n return output;\n}\nfunction relationships(\n values: { id: string; type: string; target: string }[],\n): string {\n return `<Relationships xmlns=\"http://schemas.openxmlformats.org/package/2006/relationships\">${values.map((r) => `<Relationship Id=\"${r.id}\" Type=\"${relNs}/${r.type}\" Target=\"${e(r.target)}\"/>`).join('')}</Relationships>`;\n}\n","import {\n resolveLimits,\n SpreadsheetError,\n type SpreadsheetLimits,\n WorkBudget,\n} from './errors.js';\nimport {\n type ArgumentSpan,\n FormulaScanner,\n normalizeFormula,\n} from './formula.js';\nimport {\n address,\n type Cell,\n type CellType,\n contains,\n type FormatKind,\n type Point,\n type Range,\n type Reference,\n type Workbook,\n} from './model.js';\nimport { WorkbookIndex } from './reference-index.js';\n\nexport interface ProfileOptions extends Partial<SpreadsheetLimits> {\n maxProfileWork?: number;\n overlapThreshold?: number;\n sampleSize?: number;\n maxProfileCells?: number;\n maxColumnPairs?: number;\n maxDependencyChecks?: number;\n}\nexport interface ColumnProfile {\n id: string;\n column: number;\n header?: string;\n typeCounts: Record<CellType, number>;\n blankCount: number;\n distinctCount: number;\n /** Distinct nonblank values divided by nonblank cells. */\n uniqueness: number;\n min?: Cell['value'];\n max?: Cell['value'];\n samples: Cell['value'][];\n dominantFormatKind?: FormatKind;\n formulaDriven: boolean;\n formulaPatterns: { pattern: string; count: number }[];\n}\nexport interface RegionProfile {\n id: string;\n sheet: string;\n range: Range;\n headerRowCandidates: number[];\n totalsRows: number[];\n columns: ColumnProfile[];\n}\nexport interface ColumnLink {\n region: string;\n column: number;\n}\nexport interface LookupEvidence {\n cell: string;\n sheet: string;\n function: string;\n keyColumn?: ColumnLink;\n targetRegion?: string;\n returnedColumn?: ColumnLink;\n}\nexport interface AggregateEvidence {\n cell: string;\n sheet: string;\n function: string;\n criteriaColumns: ColumnLink[];\n measureColumn?: ColumnLink;\n}\nexport interface WorkbookProfile {\n sheets: { name: string; regions: RegionProfile[] }[];\n /** Edges run from the formula column to the columns it reads. */\n dependencies: { from: ColumnLink; to: ColumnLink }[];\n lookups: LookupEvidence[];\n aggregates: AggregateEvidence[];\n overlaps: {\n from: ColumnLink;\n to: ColumnLink;\n sharedDistinct: number;\n share: number;\n }[];\n}\n\nconst valueKey = (value: Cell['value']) =>\n value instanceof Date\n ? `date:${value.toISOString()}`\n : `${typeof value}:${String(value)}`;\nconst nonblank = (cell: Cell) =>\n cell.value !== null && cell.value !== '' && cell.type !== 'empty';\nconst emptyCounts = (): Record<CellType, number> => ({\n text: 0,\n number: 0,\n boolean: 0,\n date: 0,\n error: 0,\n empty: 0,\n});\nconst link = (region: RegionProfile, column: number): ColumnLink => ({\n region: region.id,\n column,\n});\nconst linkKey = (value: ColumnLink) => `${value.region}:${value.column}`;\n\n/** Four-neighbor blocks of occupied cells, independent of worksheet dimensions. */\nfunction blocks(cells: Map<string, Point>, work: WorkBudget): Range[] {\n const pending = new Map(cells);\n const result: Range[] = [];\n for (const first of cells.values()) {\n work.spend();\n if (!pending.has(address(first))) continue;\n const queue = [first];\n pending.delete(address(first));\n const start = { ...first };\n const end = { ...first };\n for (let i = 0; i < queue.length; i++) {\n work.spend(5);\n const p = queue[i];\n start.row = Math.min(start.row, p.row);\n start.col = Math.min(start.col, p.col);\n end.row = Math.max(end.row, p.row);\n end.col = Math.max(end.col, p.col);\n for (const n of [\n { row: p.row - 1, col: p.col },\n { row: p.row + 1, col: p.col },\n { row: p.row, col: p.col - 1 },\n { row: p.row, col: p.col + 1 },\n ]) {\n if (n.row < 1 || n.row > 1048576 || n.col < 1 || n.col > 16384)\n continue;\n const key = address(n);\n if (pending.has(key)) {\n pending.delete(key);\n queue.push(n);\n }\n }\n }\n result.push({ start, end });\n }\n return result.sort((a, b) => {\n work.spend();\n return a.start.row - b.start.row || a.start.col - b.start.col;\n });\n}\n\nexport function profileWorkbook(\n workbook: Workbook,\n options: ProfileOptions = {},\n): WorkbookProfile {\n const opts = {\n maxProfileWork: 128 * 2_000_000,\n overlapThreshold: 0.5,\n sampleSize: 5,\n maxProfileCells: 2_000_000,\n maxColumnPairs: 100_000,\n maxDependencyChecks: 8 * 1_000_000,\n ...Object.fromEntries(\n Object.entries(options).filter(([, value]) => value !== undefined),\n ),\n };\n for (const [key, value] of Object.entries(opts)) {\n if (\n key === 'overlapThreshold'\n ? !Number.isFinite(value) || value < 0 || value > 1\n : !Number.isSafeInteger(value) || value <= 0\n )\n throw new SpreadsheetError('INVALID_INPUT', 'Invalid profile options.');\n }\n const work = new WorkBudget(opts.maxProfileWork);\n const limits = resolveLimits(options);\n const scanner = new FormulaScanner(limits, (n) => work.spend(n));\n const referenceIndex = new WorkbookIndex(workbook, limits, scanner, (n) =>\n work.spend(n),\n );\n const entriesBySheet = new Map<Workbook['sheets'][number], [Point, Cell][]>();\n const profile: WorkbookProfile = {\n sheets: [],\n dependencies: [],\n lookups: [],\n aggregates: [],\n overlaps: [],\n };\n const distinct = new Map<string, Set<string>>();\n let visits = 0;\n let checks = 0;\n const bounded = (actual: number, max: number) => {\n if (actual > max)\n throw new SpreadsheetError(\n 'LIMIT_EXCEEDED',\n 'Workbook profile work limit exceeded.',\n );\n };\n for (const sheet of workbook.sheets) {\n bounded(visits + sheet.cells.size, opts.maxProfileCells);\n // Bound comparison sorting before invoking SparseCells' ordered iterator.\n work.spend(\n sheet.cells.size *\n Math.max(1, Math.ceil(Math.log2(sheet.cells.size + 1))),\n );\n const entries = [...sheet.cells];\n entriesBySheet.set(sheet, entries);\n const occupied = new Map<string, Point>();\n for (const [p, cell] of entries) {\n work.spend();\n bounded(++visits, opts.maxProfileCells);\n if (nonblank(cell) || cell.formula || cell.type === 'error')\n occupied.set(address(p), p);\n }\n const regions: RegionProfile[] = [];\n for (const [index, range] of blocks(occupied, work).entries()) {\n visits +=\n (range.end.row - range.start.row + 1) *\n (range.end.col - range.start.col + 1);\n bounded(visits, opts.maxProfileCells);\n const region: RegionProfile = {\n id: `${sheet.name}!${address(range.start)}:${address(range.end)}#${index + 1}`,\n sheet: sheet.name,\n range,\n headerRowCandidates: [],\n totalsRows: [],\n columns: [],\n };\n const width = range.end.col - range.start.col + 1;\n for (\n let row = range.start.row;\n row <= Math.min(range.start.row + 2, range.end.row - 1);\n row++\n ) {\n let headers = 0;\n for (let col = range.start.col; col <= range.end.col; col++) {\n work.spend();\n const cell = sheet.cells.get(row, col);\n if (cell?.type === 'text' && nonblank(cell) && !cell.formula)\n headers++;\n }\n if (headers >= Math.ceil(width * 0.6))\n region.headerRowCandidates.push(row);\n }\n // A totals row must be trailing and aggregate an earlier part of this block.\n for (let row = range.end.row; row > range.start.row; row--) {\n let totals = false;\n for (let col = range.start.col; col <= range.end.col; col++) {\n work.spend();\n const formula = sheet.cells.get(row, col)?.formula;\n if (formula)\n work.spend(formula.functions.length + formula.references.length);\n if (\n formula?.functions.some((f) =>\n ['SUM', 'SUBTOTAL', 'AGGREGATE'].includes(f),\n ) &&\n formula.references.some(\n (r) =>\n !r.name &&\n (!r.sheet || r.sheet === sheet.name) &&\n r.range.start.row >= range.start.row &&\n r.range.end.row < row &&\n r.range.start.col >= range.start.col &&\n r.range.end.col <= range.end.col,\n )\n )\n totals = true;\n }\n if (!totals) break;\n region.totalsRows.push(row);\n }\n region.totalsRows.reverse();\n const totalsRows = new Set(region.totalsRows);\n const header = region.headerRowCandidates[0];\n for (let col = range.start.col; col <= range.end.col; col++) {\n const headerValue =\n header === undefined\n ? undefined\n : sheet.cells.get(header, col)?.value;\n work.spend(\n typeof headerValue === 'string' ? headerValue.length + 1 : 1,\n );\n const column: ColumnProfile = {\n id: `${region.id}:${col}`,\n column: col,\n header:\n header === undefined\n ? undefined\n : String(sheet.cells.get(header, col)?.value ?? ''),\n typeCounts: emptyCounts(),\n blankCount: 0,\n distinctCount: 0,\n uniqueness: 0,\n samples: [],\n formulaDriven: false,\n formulaPatterns: [],\n };\n const values = new Set<string>();\n const formats = new Map<FormatKind, number>();\n const patterns = new Map<string, number>();\n let count = 0;\n let extremaType: string | undefined;\n let mixedExtrema = false;\n for (let row = range.start.row; row <= range.end.row; row++) {\n work.spend();\n if (row === header || totalsRows.has(row)) continue;\n work.spend();\n const cell = sheet.cells.get(row, col);\n column.typeCounts[cell?.type ?? 'empty']++;\n if (!cell || (!nonblank(cell) && cell.type !== 'error'))\n column.blankCount++;\n else {\n count++;\n work.spend(\n typeof cell.value === 'string' ? cell.value.length + 1 : 1,\n );\n const key =\n cell.type === 'error'\n ? `error:${cell.error ?? ''}`\n : valueKey(cell.value);\n if (!values.has(key) && column.samples.length < opts.sampleSize)\n column.samples.push(\n cell.value instanceof Date ? new Date(cell.value) : cell.value,\n );\n values.add(key);\n if (cell.type !== 'error') {\n const type =\n cell.value instanceof Date ? 'date' : typeof cell.value;\n if (extremaType && extremaType !== type) {\n mixedExtrema = true;\n delete column.min;\n delete column.max;\n }\n extremaType = type;\n if (!mixedExtrema) {\n const value = cell.value as string | number | boolean | Date;\n if (\n column.min === undefined ||\n value < (column.min as typeof value)\n )\n column.min = value instanceof Date ? new Date(value) : value;\n if (\n column.max === undefined ||\n value > (column.max as typeof value)\n )\n column.max = value instanceof Date ? new Date(value) : value;\n }\n }\n if (cell.formatKind)\n formats.set(\n cell.formatKind,\n (formats.get(cell.formatKind) ?? 0) + 1,\n );\n }\n if (cell?.formula) {\n column.formulaDriven = true;\n const pattern = normalizeFormula(\n cell.formula,\n { row, col },\n scanner,\n );\n patterns.set(pattern, (patterns.get(pattern) ?? 0) + 1);\n }\n }\n column.distinctCount = values.size;\n column.uniqueness = count ? values.size / count : 0;\n column.dominantFormatKind = [...formats].sort(\n (a, b) => b[1] - a[1] || (a[0] < b[0] ? -1 : a[0] > b[0] ? 1 : 0),\n )[0]?.[0];\n column.formulaPatterns = [...patterns].map(([pattern, count]) => ({\n pattern,\n count,\n }));\n distinct.set(column.id, values);\n region.columns.push(column);\n }\n regions.push(region);\n }\n profile.sheets.push({ name: sheet.name, regions });\n }\n const regions = profile.sheets.flatMap((s) => s.regions);\n const resolve = (\n reference: Reference,\n currentSheet: string,\n origin: Point,\n depth = 0,\n ): ColumnLink[] => {\n work.spend();\n bounded(++checks, opts.maxDependencyChecks);\n if (depth > 16) return [];\n if (reference.name) {\n const resolved = referenceIndex.resolve(reference, currentSheet, origin);\n return resolved\n ? resolve(\n { ...resolved, name: undefined },\n currentSheet,\n origin,\n depth + 1,\n )\n : [];\n }\n const targets: ColumnLink[] = [];\n for (const region of regions) {\n work.spend();\n bounded(++checks, opts.maxDependencyChecks);\n const r = reference.range;\n if (\n region.sheet.toLowerCase() !==\n (reference.sheet ?? currentSheet).toLowerCase() ||\n r.end.row < region.range.start.row ||\n r.start.row > region.range.end.row\n )\n continue;\n for (const column of region.columns) {\n work.spend();\n bounded(++checks, opts.maxDependencyChecks);\n if (column.column >= r.start.col && column.column <= r.end.col)\n targets.push(link(region, column.column));\n }\n }\n return targets;\n };\n const edgeKeys = new Set<string>();\n for (const sheet of workbook.sheets)\n for (const [origin, cell] of entriesBySheet.get(sheet) ?? []) {\n if (!cell.formula) continue;\n const region = regions.find((r) => {\n work.spend();\n bounded(++checks, opts.maxDependencyChecks);\n return r.sheet === sheet.name && contains(r.range, origin);\n });\n if (!region) continue;\n const from = link(region, origin.col);\n for (const reference of cell.formula.references)\n for (const to of resolve(reference, sheet.name, origin)) {\n work.spend();\n const key = `${linkKey(from)}>${linkKey(to)}`;\n if (!edgeKeys.has(key)) {\n edgeKeys.add(key);\n profile.dependencies.push({ from, to });\n }\n }\n const scan = scanner.scan(cell.formula.text);\n const calls = scan.calls;\n const argLinks = (arg: ArgumentSpan | undefined): ColumnLink[] => {\n if (!arg) return [];\n const links: ColumnLink[] = [];\n for (let i = arg.refStart; i < arg.refEnd; i++) {\n work.spend();\n for (const target of resolve(\n scan.references[i].reference,\n sheet.name,\n origin,\n )) {\n work.spend();\n links.push(target);\n }\n }\n return links;\n };\n const argumentText = (arg: ArgumentSpan | undefined) => {\n if (!arg) return undefined;\n work.spend(arg.to - arg.from);\n return scan.text.slice(arg.from, arg.to).trim();\n };\n for (const call of calls) {\n work.spend();\n if (['VLOOKUP', 'XLOOKUP', 'INDEX'].includes(call.name)) {\n const lookup: LookupEvidence = {\n cell: address(origin),\n sheet: sheet.name,\n function: call.name,\n };\n if (call.name === 'VLOOKUP') {\n lookup.keyColumn = argLinks(call.args[0])[0];\n const target = argLinks(call.args[1]);\n lookup.targetRegion = target[0]?.region;\n const offset = Number(argumentText(call.args[2]));\n if (Number.isInteger(offset) && offset > 0)\n lookup.returnedColumn = target[offset - 1];\n } else if (call.name === 'XLOOKUP') {\n lookup.keyColumn = argLinks(call.args[0])[0];\n lookup.targetRegion = argLinks(call.args[1])[0]?.region;\n lookup.returnedColumn = argLinks(call.args[2])[0];\n } else {\n const argument = call.args[1];\n const match = argument\n ? calls.find((c) => {\n work.spend();\n return (\n c.name === 'MATCH' &&\n c.from >= argument.from &&\n c.to <= argument.to\n );\n })\n : undefined;\n if (!match) continue;\n lookup.keyColumn = argLinks(match.args[0])[0];\n const target = argLinks(call.args[0]);\n lookup.targetRegion = target[0]?.region;\n const index =\n call.args[2] === undefined\n ? 1\n : Number(argumentText(call.args[2]));\n if (Number.isInteger(index) && index > 0)\n lookup.returnedColumn = target[index - 1];\n }\n profile.lookups.push(lookup);\n }\n if (/^(SUM|COUNT|AVERAGE)IFS?$/.test(call.name)) {\n const plural = call.name.endsWith('IFS');\n const count = call.name.startsWith('COUNT');\n const criteria: ColumnLink[] = [];\n if (plural)\n for (let i = count ? 0 : 1; i < call.args.length; i += 2) {\n for (const target of argLinks(call.args[i])) {\n work.spend();\n criteria.push(target);\n }\n }\n else {\n for (const target of argLinks(call.args[0])) {\n work.spend();\n criteria.push(target);\n }\n }\n profile.aggregates.push({\n cell: address(origin),\n sheet: sheet.name,\n function: call.name,\n criteriaColumns: criteria,\n measureColumn: count\n ? undefined\n : argLinks(\n plural ? call.args[0] : (call.args[2] ?? call.args[0]),\n )[0],\n });\n }\n }\n }\n let pairs = 0;\n // Group by sheet so same-sheet disconnected regions never create a quadratic\n // cross-product merely to be skipped. Preflight every cross-sheet product.\n for (let sa = 0; sa < profile.sheets.length; sa++)\n for (let sb = sa + 1; sb < profile.sheets.length; sb++) {\n const left = profile.sheets[sa].regions;\n const right = profile.sheets[sb].regions;\n work.spend();\n bounded(pairs + left.length * right.length, opts.maxColumnPairs);\n for (const ar of left)\n for (const br of right) {\n work.spend();\n pairs += ar.columns.length * br.columns.length;\n bounded(pairs, opts.maxColumnPairs);\n for (const ac of ar.columns)\n for (const bc of br.columns) {\n work.spend();\n const av = distinct.get(ac.id) as Set<string>;\n const bv = distinct.get(bc.id) as Set<string>;\n if (!av.size || !bv.size) continue;\n let shared = 0;\n for (const value of av.size < bv.size ? av : bv) {\n work.spend(value.length + 1);\n bounded(++checks, opts.maxDependencyChecks);\n if (av.has(value) && bv.has(value)) shared++;\n }\n for (const [from, to, size] of [\n [link(ar, ac.column), link(br, bc.column), av.size],\n [link(br, bc.column), link(ar, ac.column), bv.size],\n ] as [ColumnLink, ColumnLink, number][]) {\n if (shared && shared / size >= opts.overlapThreshold)\n profile.overlaps.push({\n from,\n to,\n sharedDistinct: shared,\n share: shared / size,\n });\n }\n }\n }\n }\n return profile;\n}\n","import { readCsv, writeCsv } from './csv.js';\nimport { checkLimit, resolveLimits, SpreadsheetError } from './errors.js';\nimport type { SpreadsheetAdapter, SpreadsheetOptions } from './types.js';\nimport { readXlsx } from './xlsx-read.js';\nimport { writeXlsx } from './xlsx-write.js';\n\nexport type { SpreadsheetErrorCode, SpreadsheetLimits } from './errors.js';\nexport { DEFAULT_LIMITS, SpreadsheetError } from './errors.js';\nexport { normalizeFormula, parseFormula } from './formula.js';\nexport * from './model.js';\nexport * from './profile.js';\nexport type * from './types.js';\n\n/** Construct an isolated adapter; service adapters will use separate entries. */\nexport async function getSpreadsheets(\n options: SpreadsheetOptions,\n): Promise<SpreadsheetAdapter> {\n if (!options || !['xlsx', 'csv'].includes(options.type)) {\n throw new SpreadsheetError(\n 'UNSUPPORTED_FORMAT',\n 'Supported spreadsheet types: xlsx, csv.',\n );\n }\n const config = { ...options };\n const defaults = resolveLimits(config);\n return {\n type: config.type,\n async read(input, overrides) {\n const limits = resolveLimits(overrides, defaults);\n const bytes =\n input instanceof Uint8Array\n ? input\n : input instanceof ArrayBuffer\n ? new Uint8Array(input)\n : undefined;\n if (!bytes)\n throw new SpreadsheetError(\n 'INVALID_INPUT',\n 'Expected Uint8Array or ArrayBuffer.',\n );\n checkLimit(bytes.length, 'maxInputBytes', limits);\n if (config.type === 'xlsx') return readXlsx(bytes, limits);\n return readCsv(bytes, limits, { ...config, ...overrides });\n },\n async write(workbook, overrides) {\n const limits = resolveLimits(overrides, defaults);\n return config.type === 'xlsx'\n ? writeXlsx(workbook, limits, overrides ?? {})\n : writeCsv(workbook, limits, { ...config, ...overrides });\n },\n };\n}\n"],"x_google_ignoreList":[8],"mappings":";;AAWA,IAAa,mBAAb,cAAsC,MAAM;CAExB;CAEA;CAHlB,YACE,MACA,SACA,OACA;EACA,MAAM,OAAO;EAJG,KAAA,OAAA;EAEA,KAAA,QAAA;EAGhB,KAAK,OAAO;CACd;AACF;AAgCA,IAAa,iBAA8C,OAAO,OAAO;CACvE,eAAe,KAAK,OAAO;CAC3B,YAAY;CACZ,eAAe,MAAM,OAAO;CAC5B,eAAe,MAAM,OAAO;CAC5B,qBAAqB;CACrB,4BAA4B,IAAI,OAAO;CACvC,cAAc;CACd,aAAa;CACb,YAAY,KAAK,OAAO;CACxB,aAAa,IAAI;CACjB,WAAW;CACX,UAAU;CACV,kBAAkB;CAClB,kBAAkB;CAClB,iBAAiB;CACjB,WAAW;CACX,oBAAoB;CACpB,WAAW;CACX,mBAAmB;CACnB,aAAa,MAAM,OAAO;CAC1B,gBAAgB,MAAM;CACtB,iBAAiB;CACjB,kBAAkB;CAClB,wBAAwB;CACxB,SAAS;CACT,YAAY;AACd,CAAC;AAED,SAAgB,cACd,UAAsC,CAAC,GACvC,OAAoC,gBACjB;CACnB,MAAM,SAAS,EAAE,GAAG,KAAK;CACzB,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAAkC;EACpE,MAAM,QAAQ,QAAQ,QAAQ,OAAO;EACrC,IAAI,CAAC,OAAO,cAAc,KAAK,KAAK,SAAS,GAC3C,MAAM,IAAI,iBACR,iBACA,wCACF;EAEF,OAAO,OAAO;CAChB;CACA,OAAO;AACT;AAEA,SAAgB,WACd,QACA,KACA,QACM;CACN,IAAI,SAAS,OAAO,MAClB,MAAM,IAAI,iBACR,kBACA,+BAA+B,IAAI,IACnC,GACF;AACJ;AAEA,SAAgB,QAAQ,UAAU,+BAAsC;CACtE,MAAM,IAAI,iBAAiB,oBAAoB,OAAO;AACxD;;AAGA,IAAa,aAAb,MAAwB;CAGH;CACA;CAHnB,OAAe;CACf,YACE,SACA,OACA;EAFiB,KAAA,UAAA;EACA,KAAA,QAAA;CAChB;CACH,MAAM,SAAS,GAAS;EACtB,KAAK,QAAQ;EACb,IAAI,KAAK,OAAO,KAAK,SACnB,MAAM,IAAI,iBACR,kBACA,+CACA,KAAK,KACP;CACJ;AACF;;;ACrCA,SAAgB,WAAW,KAAqB;CAC9C,IAAI,CAAC,OAAO,UAAU,GAAG,KAAK,MAAM,KAAK,MAAM,OAC7C,QAAQ,0BAA0B;CACpC,IAAI,SAAS;CACb,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,IAAI,KAAK,OAAO,IAAI,KAAK,EAAE,GAClD,SAAS,OAAO,aAAa,MAAO,IAAI,KAAK,EAAG,IAAI;CACtD,OAAO;AACT;AACA,SAAgB,QAAQ,OAAsB;CAC5C,OAAO,GAAG,WAAW,MAAM,GAAG,IAAI,MAAM;AAC1C;AACA,SAAgB,MAAM,IAAmB;CACvC,MAAM,QAAQ,wCAAwC,KAAK,EAAE;CAC7D,IAAI,CAAC,OAAO,QAAQ,uBAAuB;CAC3C,IAAI,MAAM;CACV,KAAK,MAAM,QAAQ,MAAM,EAAE,CAAC,YAAY,GACtC,MAAM,MAAM,KAAK,KAAK,WAAW,CAAC,IAAI;CACxC,MAAM,MAAM,OAAO,MAAM,EAAE;CAC3B,IAAI,MAAM,SAAS,MAAM,SAAS,QAAQ,0BAA0B;CACpE,OAAO;EAAE;EAAK;CAAI;AACpB;AACA,SAAgB,MAAM,IAAmB;CACvC,MAAM,QAAQ,GAAG,MAAM,GAAG;CAC1B,IAAI,MAAM,SAAS,GAAG,QAAQ,qBAAqB;CACnD,MAAM,QAAQ,MAAM,MAAM,EAAE;CAC5B,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,EAAE;CACtC,IAAI,IAAI,MAAM,MAAM,OAAO,IAAI,MAAM,MAAM,KACzC,QAAQ,qBAAqB;CAC/B,OAAO;EAAE;EAAO;CAAI;AACtB;AACA,SAAgB,aAAa,OAAsB;CACjD,OAAO,GAAG,QAAQ,MAAM,KAAK,EAAE,GAAG,QAAQ,MAAM,GAAG;AACrD;AACA,SAAgB,SAAS,OAAc,GAAmB;CACxD,OACE,EAAE,OAAO,MAAM,MAAM,OACrB,EAAE,OAAO,MAAM,IAAI,OACnB,EAAE,OAAO,MAAM,MAAM,OACrB,EAAE,OAAO,MAAM,IAAI;AAEvB;;AAGA,IAAa,cAAb,MAA4D;CAC1D,uBAAwB,IAAI,IAA+B;CAC3D,QAAgB;CAChB,IAAI,OAAe;EACjB,OAAO,KAAK;CACd;CAGA,IAAI,KAAsB,KAAgC;EACxD,MAAM,IAAI,OAAO,QAAQ,WAAW,MAAM,GAAG,IAAI;GAAE;GAAK,KAAK,OAAO;EAAE;EACtE,OAAO,KAAK,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,GAAG;CACxC;CAGA,IAAI,KAAsB,KAAoB,MAAmB;EAC/D,MAAM,IACJ,OAAO,QAAQ,WAAW,MAAM,GAAG,IAAI;GAAE;GAAU;EAAc;EACnE,IAAI,CAAC,OAAO,UAAU,EAAE,GAAG,KAAK,EAAE,MAAM,KAAK,EAAE,MAAM,SACnD,QAAQ,0BAA0B;EACpC,WAAW,EAAE,GAAG;EAChB,IAAI,QAAQ,KAAK,KAAK,IAAI,EAAE,GAAG;EAC/B,IAAI,CAAC,OAAO;GACV,wBAAQ,IAAI,IAAI;GAChB,KAAK,KAAK,IAAI,EAAE,KAAK,KAAK;EAC5B;EACA,IAAI,CAAC,MAAM,IAAI,EAAE,GAAG,GAAG,KAAK;EAC5B,MAAM,IAAI,EAAE,KAAM,OAAO,QAAQ,WAAW,MAAM,IAAa;EAC/D,OAAO;CACT;CACA,CAAC,OAA8D;EAC7D,KAAK,MAAM,OAAO,CAAC,GAAG,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC,GAC1D,MAAM,CACJ,KACA,IAAI,IAAI,CAAC,GAAI,KAAK,KAAK,IAAI,GAAG,KAAK,CAAC,CAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,CACnE;CAEJ;CACA,EAAE,OAAO,YAA6C;EACpD,KAAK,MAAM,CAAC,KAAK,UAAU,KAAK,KAAK,GACnC,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,MAAM,CAAC;GAAE;GAAK;EAAI,GAAG,IAAI;CAC9D;AACF;AACA,SAAgB,YAAY,MAAqB;CAC/C,OAAO;EACL;EACA,OAAO;EACP,OAAO,IAAI,YAAY;EACvB,QAAQ,CAAC;EACT,QAAQ,CAAC;EACT,aAAa,CAAC;CAChB;AACF;AACA,SAAgB,eAAe,SAAkB,CAAC,GAAa;CAC7D,OAAO;EACL;EACA,cAAc,CAAC;EACf,YAAY;EACZ,QAAQ,EAAE,QAAQ,QAAQ;CAC5B;AACF;;;AC7LA,SAAgB,iBACd,UACA,QACM;CACN,IACE,CAAC,YACD,CAAC,MAAM,QAAQ,SAAS,MAAM,KAC9B,CAAC,SAAS,OAAO,UACjB,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,SAAS,SAAS,UAAU,GAE1C,QAAQ;CACV,MAAM,OAAO,IAAI,WAAW,OAAO,aAAa,aAAa;CAC7D,WAAW,SAAS,OAAO,QAAQ,aAAa,MAAM;CACtD,WAAW,SAAS,aAAa,QAAQ,mBAAmB,MAAM;CAClE,IAAI,aAAa;CACjB,IAAI,SAAS;CACb,IAAI,cAAc;CAClB,IAAI,CAAC,SAAS,OAAO,MAAM,MAAM,EAAE,UAAU,SAAS,GACpD,QAAQ,yCAAyC;CACnD,MAAM,cAAc,MAAa;EAC/B,MAAM,UAAU,MAAM,aAAa,CAAC,CAAC;EACrC,WAAW,QAAQ,IAAI,KAAK,WAAW,MAAM;EAC7C,WAAW,QAAQ,IAAI,KAAK,cAAc,MAAM;CAClD;CACA,KAAK,MAAM,QAAQ,SAAS,cAAc;EACxC,KAAK,MAAM,KAAK,KAAK,SAAS,KAAK,KAAK,SAAS,CAAC;EAClD,WAAW,KAAK,KAAK,QAAQ,oBAAoB,MAAM;CACzD;CACA,MAAM,wBAAQ,IAAI,IAAY;CAC9B,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,SAAS,QAAQ;EACnC,IACE,CAAC,MAAM,QACP,MAAM,KAAK,SAAS,MACpB,cAAc,KAAK,MAAM,IAAI,KAC7B,MAAM,IAAI,MAAM,KAAK,YAAY,CAAC,GAElC,QAAQ,sCAAsC;EAChD,MAAM,IAAI,MAAM,KAAK,YAAY,CAAC;EAClC,IAAI,CAAC;GAAC;GAAW;GAAU;EAAY,CAAC,CAAC,SAAS,MAAM,KAAK,GAC3D,QAAQ,0BAA0B;EACpC,IACE,MAAM,WACL,CAAC,OAAO,UAAU,MAAM,OAAO,IAAI,KAClC,CAAC,OAAO,UAAU,MAAM,OAAO,IAAI,KACnC,MAAM,OAAO,OAAO,KACpB,MAAM,OAAO,OAAO,KACpB,MAAM,OAAO,QAAQ,OAAO,WAC5B,MAAM,OAAO,QAAQ,OAAO,aAE9B,QAAQ,sBAAsB;EAChC,UAAU,MAAM,OAAO;EACvB,WAAW,QAAQ,aAAa,MAAM;EACtC,KAAK,MAAM,KAAK,MAAM,QAAQ,WAAW,CAAC;EAC1C,KAAK,MAAM,SAAS,MAAM,QAAQ;GAChC,WAAW,EAAE,YAAY,aAAa,MAAM;GAC5C,KAAK,MAAM,MAAM,KAAK,SAAS,MAAM,QAAQ,SAAS,CAAC;GACvD,KAAK,MAAM,QAAQ,MAAM,SAAS,KAAK,MAAM,KAAK,SAAS,CAAC;GAC5D,WAAW,MAAM,KAAK;GACtB,IACE,CAAC,MAAM,QACP,MAAM,QAAQ,WAAW,MAAM,MAAM,IAAI,MAAM,MAAM,MAAM,MAAM,MAAM,GAEvE,QAAQ,wBAAwB;EACpC;EACA,KAAK,MAAM,cAAc,MAAM,aAAa;GAC1C,eAAe,KAAK,IAAI,GAAG,WAAW,OAAO,MAAM;GACnD,WAAW,aAAa,sBAAsB,MAAM;GACpD,KAAK,MACH,WAAW,OAAO,UAAU,WAAW,SAAS,UAAU,KAAK,CACjE;GACA,IACE,CAAC;IAAC;IAAQ;IAAS;IAAW;IAAQ;IAAc;GAAQ,CAAC,CAAC,SAC5D,WAAW,IACb,KACA,CAAC,WAAW,OAAO,QAEnB,QAAQ,0BAA0B;GACpC,KAAK,MAAM,SAAS,WAAW,UAAU,CAAC,GAAG,KAAK,MAAM,MAAM,SAAS,CAAC;GACxE,WAAW,OAAO,QAAQ,UAAU;GACpC,IAAI,WAAW,SACb,WAAW,WAAW,QAAQ,QAAQ,oBAAoB,MAAM;EACpE;EACA,KAAK,MAAM,CAAC,GAAG,SAAS,MAAM,OAAO;GACnC,KAAK,MACH,KACG,OAAO,KAAK,UAAU,WAAW,KAAK,MAAM,SAAS,MACrD,KAAK,cAAc,UAAU,MAC7B,KAAK,SAAS,KAAK,UAAU,EAClC;GACA,WAAW,EAAE,OAAO,YAAY,MAAM;GACtC,WAAW,EAAE,KAAK,WAAW,MAAM;GACnC,WAAW,EAAE,KAAK,cAAc,MAAM;GACtC,IACE,CAAC;IAAC;IAAQ;IAAU;IAAW;IAAQ;IAAS;GAAO,CAAC,CAAC,SACvD,KAAK,IACP,GAEA,QAAQ,wBAAwB;GAClC,IACE,KAAK,SAAS,aACb,OAAO,KAAK,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,KAAK,IAE9D,QAAQ,uBAAuB;GACjC,IACE,KAAK,SAAS,WACb,EAAE,KAAK,iBAAiB,SACvB,CAAC,OAAO,SAAS,KAAK,MAAM,QAAQ,CAAC,IAEvC,QAAQ,oBAAoB;GAC9B,IAAI,KAAK,SAAS,aAAa,OAAO,KAAK,UAAU,WACnD,QAAQ,uBAAuB;GACjC,IAAI,KAAK,SAAS,UAAU,OAAO,KAAK,UAAU,UAChD,QAAQ,oBAAoB;GAC9B,IAAI,OAAO,KAAK,UAAU,UACxB,WAAW,KAAK,MAAM,QAAQ,cAAc,MAAM;GACpD,IAAI,KAAK,cACP,WAAW,KAAK,aAAa,QAAQ,cAAc,MAAM;GAC3D,IAAI,KAAK,SAAS,YAAY,WAAW,KAAK,QAAQ,UAAU;GAChE,IAAI,KAAK,SACP,WAAW,KAAK,QAAQ,KAAK,QAAQ,oBAAoB,MAAM;EACnE;CACF;AACF;;;ACxHA,SAAS,gBAAgB,OAAuB;CAC9C,IAAI,MAAM,WAAW,KAAK,YAAY,KAAK,KAAK,GAC9C,MAAM,IAAI,iBACR,iBACA,6DACF;CACF,OAAO;AACT;AACA,SAAS,OAAO,MAAsB;CACpC,MAAM,yBAAS,IAAI,IAAI;EACrB,CAAC,KAAK,CAAC;EACP,CAAC,KAAK,CAAC;EACP,CAAC,KAAM,CAAC;EACR,CAAC,KAAK,CAAC;CACT,CAAC;CACD,IAAI,SAAS;CACb,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,IAAI,KAAK;EACf,IAAI,MAAM,MACR,IAAI,UAAU,KAAK,IAAI,OAAO,MAAK;OAC9B,SAAS,CAAC;OACV,IAAI,CAAC,QAAQ;GAClB,IAAI,MAAM,QAAQ,MAAM,MAAM;GAC9B,IAAI,OAAO,IAAI,CAAC,GAAG,OAAO,IAAI,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC;EAC3D;CACF;CACA,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;AACpD;AACA,SAAgB,QACd,OACA,QACA,SACU;CACV,IAAI;CACJ,IAAI;EACF,OAAO,IAAI,YAAY,SAAS,EAAE,OAAO,KAAK,CAAC,CAAC,CAC7C,OAAO,KAAK,CAAC,CACb,QAAQ,WAAW,EAAE;CAC1B,QAAQ;EACN,MAAM,IAAI,iBAAiB,iBAAiB,0BAA0B;CACxE;CACA,MAAM,OAAO,IAAI,WAAW,OAAO,aAAa,aAAa;CAC7D,KAAK,MAAM,KAAK,MAAM;CACtB,MAAM,YAAY,gBAAgB,QAAQ,aAAa,OAAO,IAAI,CAAC;CACnE,MAAM,QAAQ,YAAY,QAAQ,aAAa,QAAQ;CACvD,IAAI,MAAM;CACV,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,IAAI,QAAiD;CACrD,IAAI,SAAS;CACb,MAAM,cAAc;EAClB,KAAK,MAAM,MAAM,SAAS,CAAC;EAC3B,WAAW,MAAM,MAAM,OAAO,GAAG,YAAY,MAAM;EACnD,WAAW,KAAK,WAAW,MAAM;EACjC,WAAW,KAAK,cAAc,MAAM;EACpC,MAAM,MAAM,IAAI,KAAK,OAAO,QAAQ,KAAK,CAAC;EAC1C,QAAQ;EACR,QAAQ;EACR,SAAS;CACX;CACA,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,IAAI,KAAK;EACf,IAAI,UAAU,UACZ,IAAI,MAAM,MACR,IAAI,KAAK,IAAI,OAAO,MAAK;GACvB,SAAS;GACT;EACF,OAAO,QAAQ;OACV,SAAS;OACX,IAAI,MAAM,WAAW,MAAM;OAC7B,IAAI,MAAM,QAAQ,MAAM,MAAM;GACjC,MAAM;GACN,IAAI,MAAM,QAAQ,KAAK,IAAI,OAAO,MAAM;GACxC;GACA,MAAM;GACN,SAAS;EACX,OAAO,IAAI,MAAM,QAAO,UAAU,SAAS,QAAQ;OAC9C;GACH,IAAI,UAAU,YAAY,MAAM,MAC9B,MAAM,IAAI,iBAAiB,iBAAiB,wBAAwB;GACtE,SAAS;GACT,QAAQ;EACV;EACA,WAAW,MAAM,QAAQ,cAAc,MAAM;CAC/C;CACA,IAAI,UAAU,UACZ,MAAM,IAAI,iBAAiB,iBAAiB,yBAAyB;CACvE,IAAI,UAAU,MAAM,UAAU,UAAU,SAAS,MAAM;CACvD,OAAO;EACL,QAAQ,CAAC,KAAK;EACd,cAAc,CAAC;EACf,YAAY;EACZ,QAAQ,EAAE,QAAQ,MAAM;CAC1B;AACF;AACA,SAAS,QAAQ,MAAoB;CACnC,MAAM,OAAO;EACX,cAAc;EACd,cAAc;EACd,YAAY;CACd;CACA,IAAI,CAAC,KAAK,QAAQ,OAAO;EAAE,GAAG;EAAM,OAAO;EAAM,MAAM;CAAQ;CAC/D,IAAI,kBAAkB,KAAK,IAAI,GAC7B,OAAO;EAAE,GAAG;EAAM,OAAO,KAAK,YAAY,MAAM;EAAQ,MAAM;CAAU;CAE1E,IAAI,gDAAgD,KAAK,IAAI,GAAG;EAC9D,MAAM,QAAQ,OAAO,IAAI;EACzB,IACE,OAAO,SAAS,KAAK,KACrB,KAAK,IAAI,KAAK,KAAK,OAAO,oBAC1B,KAAK,QAAQ,UAAU,EAAE,CAAC,CAAC,UAAU,IAErC,OAAO;GAAE,GAAG;GAAM;GAAO,MAAM;EAAS;CAC5C;CACA,IAAI,4DAA4D,KAAK,IAAI,GAAG;EAC1E,MAAM,QAAQ,IAAI,KAAK,IAAI;EAC3B,IACE,OAAO,SAAS,MAAM,QAAQ,CAAC,KAC/B,MAAM,YAAY,CAAC,CAAC,MAAM,GAAG,EAAE,MAAM,KAAK,MAAM,GAAG,EAAE,GAErD,OAAO;GACL,GAAG;GACH;GACA,MAAM;GACN,cAAc,KAAK,SAAS,GAAG,IAC3B,4BACA;GACJ,YAAY,KAAK,SAAS,GAAG,IAAI,aAAa;EAChD;CACJ;CACA,OAAO;EAAE,GAAG;EAAM,OAAO;EAAM,MAAM;CAAO;AAC9C;AACA,SAAgB,SACd,UACA,QACA,SACY;CACZ,iBAAiB,UAAU,MAAM;CACjC,IAAI,SAAS,OAAO,WAAW,GAC7B,QAAQ,qCAAqC;CAC/C,MAAM,YAAY,gBAAgB,QAAQ,aAAa,GAAG;CAC1D,MAAM,QAAQ,SAAS,OAAO;CAC9B,IAAI,UAAU;CACd,IAAI,UAAU;CACd,KAAK,MAAM,CAAC,MAAM,MAAM,OAAO;EAC7B,UAAU,KAAK,IAAI,SAAS,EAAE,GAAG;EACjC,UAAU,KAAK,IAAI,SAAS,EAAE,GAAG;CACnC;CAEA,WAAW,UAAU,SAAS,YAAY,MAAM;CAChD,IAAI,SAAS,QAAQ,MAAM,MAAW;CACtC,IAAI,cAAc,OAAO;CACzB,KAAK,IAAI,MAAM,GAAG,OAAO,SAAS,OAAO;EACvC,MAAM,SAAmB,CAAC;EAC1B,KAAK,IAAI,MAAM,GAAG,OAAO,SAAS,OAAO;GACvC,MAAM,OAAO,MAAM,MAAM,IAAI,KAAK,GAAG;GACrC,MAAM,QACJ,CAAC,QAAQ,KAAK,UAAU,OACpB,KACA,KAAK,iBAAiB,OACpB,KAAK,MAAM,YAAY,IACvB,OAAO,KAAK,KAAK;GAEzB,MAAM,WAAW,MAAM;GACvB,IAAI,aAAa,KAAA,GACf,WAAW,SAAS,QAAQ,cAAc,MAAM;GAClD,MAAM,SAAS,aAAa,KAAA,IAAY,KAAA,IAAY,QAAQ,QAAQ;GAQpE,MAAM,QANJ,UACA,QACA,OAAO,SAAS,KAAK,SACpB,OAAO,iBAAiB,QAAQ,KAAK,iBAAiB,OACnD,OAAO,MAAM,QAAQ,MAAM,KAAK,MAAM,QAAQ,IAC9C,OAAO,UAAU,KAAK,SACN,WAAsB;GAE5C,eAAe,MAAM,SAAS;GAC9B,WAAW,aAAa,iBAAiB,MAAM;GAC/C,OAAO,KACL,MAAM,SAAS,SAAS,KAAK,UAAU,KAAK,KAAK,IAC7C,IAAI,MAAM,QAAQ,MAAM,MAAI,EAAE,KAC9B,KACN;EACF;EACA;EACA,WAAW,aAAa,iBAAiB,MAAM;EAC/C,UAAU,GAAG,OAAO,KAAK,SAAS,EAAE;EACpC,WAAW,OAAO,QAAQ,iBAAiB,MAAM;CACnD;CACA,MAAM,QAAQ,IAAI,YAAY,CAAC,CAAC,OAAO,MAAM;CAC7C,WAAW,MAAM,QAAQ,iBAAiB,MAAM;CAChD,OAAO;AACT;;;ACzMA,IAAa,kBAA0C;CACrD,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;AACN;AACA,SAAgB,WAAW,SAAS,WAAuB;CACzD,IAAI,OAAO,YAAY,MAAM,WAAW,OAAO;CAC/C,IAAI,WAAW;CACf,IAAI,OAAO;CACX,IAAI,OAAO;CACX,IAAI,QAAQ;CACZ,IAAI,UAAU;CACd,IAAI,OAAO;CACX,MAAM,SAAS,MAAc,UAAU,SAAS,CAAC;CACjD,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,MAAM,IAAI,OAAO;EACjB,IAAI,MAAM,QAAQ,MAAM,OAAO,MAAM,KAAK;GACxC;GACA;EACF;EACA,IAAI,MAAM,MAAK;GACb,OAAO,EAAE,IAAI,OAAO,UAAU,OAAO,OAAO,MAC1C,IAAI,MAAM,OAAO,EAAE,GAAG,WAAW;GACnC;EACF;EACA,IAAI,MAAM,KAAK;GACb,MAAM,OAAO,EAAE;GACf,OAAO,IAAI,OAAO,UAAU,OAAO,OAAO,KAAK;GAC/C,MAAM,OAAO,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC,YAAY;GAC/C,IACE,SAAS,OACT,SAAS,QACT,SAAS,OACT,SAAS,QACT,SAAS,OACT,SAAS,MAET,OAAO;GACT,IAAI,KAAK,WAAW,GAAG,KAAK,CAAC,KAAK,WAAW,IAAI,GAAG,WAAW;GAC/D;EACF;EACA,IAAI,MAAM,CAAC,GAAG,WAAW;EACzB,MAAM,QAAQ,EAAE,YAAY;EAC5B,IAAI,UAAU,OAAO,UAAU,KAAK,OAAO;EAC3C,IAAI,UAAU,OAAO,UAAU,KAAK,OAAO;EAC3C,IAAI,UAAU,KAAK,QAAQ;EAC3B,IAAI,MAAM,KAAK,UAAU;EACzB,IAAI,MAAM,KAAK,OAAO;CACxB;CACA,IAAI,QAAQ,MAAM,OAAO;CACzB,IAAI,QAAS,SAAS,CAAC,MAAO,OAAO;CACrC,IAAI,MAAM,OAAO;CACjB,IAAI,SAAS,OAAO;CACpB,IAAI,UAAU,OAAO;CACrB,IAAI,MAAM,OAAO;CACjB,OAAO;AACT;AACA,IAAM,MAAM;;AAEZ,SAAgB,WAAW,QAAgB,QAA2B;CAEpE,OAAO,IAAI,MADG,WAAW,OAAO,KAAK,IAAI,MAAM,GAAG,CAAC,IAAI,KAAK,IAAI,MAAM,IAAI,EAAE,KAGxE,KAAK,OAAO,UAAU,WAAW,QAAQ,UAAU,KAAK,IAAI,MAAM,GAAG,CACzE;AACF;AACA,SAAgB,WAAW,MAAY,QAA6B;CAClE,MAAM,QAAQ,WAAW,OAAO,KAAK,IAAI,MAAM,GAAG,CAAC,IAAI,KAAK,IAAI,MAAM,IAAI,EAAE;CAC5E,MAAM,SAAS,KAAK,QAAQ,IAAI,SAAS;CACzC,OAAO,SAAS,WAAW,QAAQ,SAAS,KAAK,IAAI;AACvD;;;AChFA,IAAM,UAAU;CACd,UAAU;CACV,UAAU;CACV,QAAQ;CACR,QAAQ;AACV;AACA,IAAM,YAAY,MAAc,MAAM,MAAM,qBAAqB,KAAK,CAAC;AACvE,IAAM,aAAa,MAAc,MAAM,MAAM,eAAe,KAAK,CAAC;AAClE,IAAM,kBAAkB,OAA6B;CACnD,GAAG;CACH,OAAO;EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,MAAM;EAAG,KAAK,EAAE,GAAG,EAAE,MAAM,IAAI;CAAE;CAC9D,UAAU,EAAE,GAAG,EAAE,SAAS;AAC5B;AACA,IAAM,+BAAe,IAAI,QAA8B;;AAGvD,IAAa,iBAAb,MAA4B;CAIf;CACQ;CAJnB,wBAAyB,IAAI,IAAyB;CACtD;CACA,YACE,SAAqC,EAAE,GAAG,eAAe,GACzD,eAAqD,CAAC,GACtD;EAFS,KAAA,SAAA;EACQ,KAAA,SAAA;EAEjB,KAAK,SAAS,IAAI,WAAW,OAAO,gBAAgB,gBAAgB;CACtE;CACA,MAAM,IAAI,GAAS;EACjB,KAAK,OAAO,MAAM,CAAC;EACnB,KAAK,OAAO,CAAC;CACf;CACA,KAAK,OAA4B;EAC/B,MAAM,OAAO,MAAM,WAAW,GAAG,IAAI,MAAM,MAAM,CAAC,IAAI;EACtD,WAAW,KAAK,QAAQ,oBAAoB,KAAK,MAAM;EACvD,KAAK,MAAM;EACX,MAAM,SAAS,KAAK,MAAM,IAAI,IAAI;EAClC,IAAI,QAAQ,OAAO;EACnB,KAAK,MAAM,KAAK,MAAM;EACtB,MAAM,UAAoB,CAAC;EAC3B,MAAM,QAAQ,MAAsB,MAAc,OAAe;GAC/D,WAAW,QAAQ,SAAS,GAAG,oBAAoB,KAAK,MAAM;GAC9D,QAAQ,KAAK;IAAE;IAAM;IAAM;GAAG,CAAC;EACjC;EACA,IAAI,IAAI;EACR,OAAO,IAAI,KAAK,QAAQ;GACtB,MAAM,OAAO;GACb,MAAM,IAAI,KAAK;GACf,IAAI,KAAK,KAAK,CAAC,GAAG;GAClB,IAAI,MAAM,KAAK;IACb,MAAM,QACJ,6EAA6E,KAC3E,KAAK,MAAM,CAAC,CACd;IACF,IAAI,OAAO;KACT,KAAK,MAAM,EAAE,CAAC;KACd,KAAK,SAAS,MAAM,CAAC;IACvB,OAAO,KAAK,SAAS,MAAM,CAAC;GAC9B,OAAO,IAAI,MAAM,QAAO,MAAM,KAAK;IACjC,OAAO,IAAI,KAAK,QACd,IAAI,KAAK,SAAS,GAChB,IAAI,KAAK,OAAO,GAAG;SACd;IAET,IAAI,MAAM,KAAK,KAAK,UAAU,MAAM,CAAC;GACvC,OAAO,IAAI,MAAM,KAAK;IACpB,IAAI,QAAQ;IACZ,OAAO,IAAI,KAAK,UAAU,OAAO;KAC/B,MAAM,OAAO,KAAK;KAClB,IAAI,SAAS,KAAK,WAAW,EAAE,OAAO,mBAAmB,KAAK,MAAM;UAC/D,IAAI,SAAS,KAAK;IACzB;IACA,KAAK,WAAW,MAAM,CAAC;GACzB,OAAO,IAAI,SAAS,CAAC,GAAG;IACtB,OAAO,IAAI,KAAK,UAAU,SAAS,KAAK,EAAE,GAAG;IAC7C,KAAK,QAAQ,MAAM,CAAC;GACtB,OAAO,KAAK,SAAS,MAAM,CAAC;EAC9B;EACA,MAAM,aAA+B,CAAC;EACtC,MAAM,QAAqB,CAAC;EAC5B,MAAM,4BAAY,IAAI,IAAY;EAClC,MAAM,QAAiE,CAAC;EACxE,MAAM,OAAO,UACX,QAAQ,KAAK,MAAM,MAAM,MAAM,MAAM,EAAE,IAAI;EAC7C,MAAM,YAAY,OAA+B,OAAe;GAC9D,MAAM,MAAM,KAAK,KAAK;IACpB,MAAM,MAAM;IACZ;IACA,UAAU,MAAM;IAChB,QAAQ,WAAW;GACrB,CAAC;EACH;EACA,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvC,KAAK,MAAM;GACX,MAAM,QAAQ,QAAQ;GACtB,MAAM,QAAQ,IAAI,KAAK;GACvB,IAAI,UAAU,KAAK;IACjB,WAAW,MAAM,SAAS,GAAG,mBAAmB,KAAK,MAAM;IAC3D,MAAM,WAAW,QAAQ,IAAI;IAC7B,IAAI;IACJ,IAAI,UAAU,SAAS,UAAU,UAAU,IAAI,QAAQ,CAAC,CAAC,MAAM,EAAE,GAAG;KAClE,MAAM,OAAO,IAAI,QAAQ,CAAC,CACvB,QAAQ,aAAa,EAAE,CAAC,CACxB,YAAY;KACf,OAAO;MAAE;MAAM,MAAM,SAAS;MAAM,IAAI,KAAK;MAAQ,MAAM,CAAC;KAAE;KAC9D,MAAM,KAAK,IAAI;KACf,UAAU,IAAI,IAAI;IACpB;IACA,MAAM,KAAK;KAAE;KAAM,OAAO,MAAM;KAAI,UAAU,WAAW;IAAO,CAAC;IACjE;GACF;GACA,IAAI,UAAU,KAAK;IACjB,MAAM,QAAQ,MAAM,IAAI;IACxB,IAAI,OAAO;KACT,SAAS,OAAO,MAAM,IAAI;KAC1B,IAAI,MAAM,MAAM,MAAM,KAAK,KAAK,MAAM;IACxC;IACA;GACF;GACA,IAAI,UAAU,OAAO,UAAU,KAAK;IAClC,MAAM,QAAQ,MAAM,MAAM,SAAS;IACnC,IAAI,OAAO;KACT,SAAS,OAAO,MAAM,IAAI;KAC1B,MAAM,QAAQ,MAAM;KACpB,MAAM,WAAW,WAAW;IAC9B;IACA;GACF;GACA,IAAI,MAAM,SAAS,SAAS;GAC5B,IAAI;GACJ,IAAI,SAAS;GACb,IAAI,IAAI,QAAQ,IAAI,EAAE,MAAM,KAAK;IAC/B,QACE,MAAM,SAAS,WACX,MAAM,MAAM,GAAG,EAAE,CAAC,CAAC,QAAQ,OAAO,GAAG,IACrC;IACN,KAAK;IACL,SAAS,QAAQ;IACjB,IAAI,CAAC,QAAQ;GACf,OAAO,IAAI,MAAM,SAAS,UAAU;GACpC,IAAI,OAAO,SAAS,SAAS;IAC3B,IAAI,IAAI,MAAM,CAAC,CAAC,YAAY,MAAM,SAChC,WAAW,KAAK;KACd,MAAM,MAAM;KACZ,IAAI,OAAO;KACX,WAAW;MACT;MACA,MAAM;MACN,OAAO;OAAE,OAAO;QAAE,KAAK;QAAG,KAAK;OAAE;OAAG,KAAK;QAAE,KAAK;QAAG,KAAK;OAAE;MAAE;MAC5D,UAAU,EAAE,GAAG,QAAQ;KACzB;IACF,CAAC;IACH;GACF;GACA,IAAI,OAAO,IAAI,MAAM;GACrB,IAAI,KAAK,OAAO;GAChB,MAAM,QAAQ,QAAQ,IAAI;GAC1B,IAAI,IAAI,KAAK,MAAM,KAAK;GACxB,IAAI,OAAO,SAAS,aAAa,OAAO,SAAS,QAAQ;IACvD,QAAQ,IAAI,KAAK;IACjB,KAAK,MAAM;IACX;GACF;GACA,IAAI;GACJ,IAAI,IAAI,QAAQ,IAAI,EAAE,MAAM,OAAO,QAAQ,IAAI,EAAE,EAAE,SAAS,QAAQ;IAClE,MAAM,IAAI,QAAQ,IAAI,EAAE;IACxB,KAAK,QAAQ,IAAI,EAAE,CAAC;IACpB,KAAK;GACP;GACA,IAAI,YAAY,YAAY,MAAM,KAAK,KAAK;GAC5C,IACE,CAAC,cACA,OAAO,SAAS,aAAa,UAAU,KAAK,MAAM,EAAE,MACrD,CAAC,CAAC,QAAQ,OAAO,CAAC,CAAC,SAAS,KAAK,YAAY,CAAC,GAE9C,YAAY;IACV;IACA;IACA,OAAO;KAAE,OAAO;MAAE,KAAK;MAAG,KAAK;KAAE;KAAG,KAAK;MAAE,KAAK;MAAG,KAAK;KAAE;IAAE;IAC5D,UAAU,EAAE,GAAG,QAAQ;GACzB;GAEF,IAAI,WAAW,WAAW,KAAK;IAAE,MAAM,MAAM;IAAM;IAAI;GAAU,CAAC;EACpE;EAEA,KAAK,MAAM,SAAS,OAAO,SAAS,OAAO,KAAK,MAAM;EACtD,MAAM,OAAO;GAAE;GAAM;GAAY;GAAO,WAAW,CAAC,GAAG,SAAS;EAAE;EAElE,IAAI,KAAK,MAAM,OAAO,KAAK,OAAO,wBAChC,KAAK,MAAM,IAAI,MAAM,IAAI;EAC3B,OAAO;CACT;AACF;AACA,SAAS,YACP,OACA,KACA,OACuB;CACvB,MAAM,QAAQ,MAAc,oCAAoC,KAAK,CAAC;CACtE,MAAM,OAAO,MAAc,qBAAqB,KAAK,CAAC;CACtD,MAAM,OAAO,MAAc,oBAAoB,KAAK,CAAC;CACrD,MAAM,QAAQ;EACZ,UAAU,OAAO,KAAK,KAAK;EAC3B,UAAU,MAAM,WAAW,GAAG;EAC9B,QAAQ,OAAO,KAAK,OAAO,KAAK;EAChC,SAAS,OAAO,MAAA,CAAO,WAAW,GAAG;CACvC;CACA,IAAI;EACF,IAAI,KAAK,KAAK,MAAM,CAAC,OAAO,KAAK,GAAG,IAClC,OAAO;GACL;GACA,OAAO;IAAE,OAAO,MAAM,KAAK;IAAG,KAAK,MAAM,OAAO,KAAK;GAAE;GACvD,UAAU;EACZ;EACF,IAAI,OAAO,IAAI,KAAK,KAAK,IAAI,GAAG,GAC9B,OAAO;GACL;GACA,OAAO;IAAE,OAAO,MAAM,GAAG,MAAM,EAAE;IAAG,KAAK,MAAM,GAAG,IAAI,QAAQ;GAAE;GAChE,UAAU;IAAE,GAAG;IAAO,UAAU;IAAM,QAAQ;GAAK;EACrD;EACF,IAAI,OAAO,IAAI,KAAK,KAAK,IAAI,GAAG,GAC9B,OAAO;GACL;GACA,OAAO;IAAE,OAAO,MAAM,IAAI,OAAO;IAAG,KAAK,MAAM,MAAM,KAAK;GAAE;GAC5D,UAAU;IAAE,GAAG;IAAO,UAAU;IAAM,QAAQ;GAAK;EACrD;CACJ,QAAQ,CAER;AAEF;AAOA,SAAgB,aACd,OACA,SAA4B,EAAE,GAAG,eAAe,GAChD,UAAU,IAAI,eAAe,MAAM,GAC1B;CACT,MAAM,OAAO,QAAQ,KAAK,KAAK;CAC/B,QAAQ,MAAM,KAAK,WAAW,SAAS,KAAK,UAAU,MAAM;CAC5D,MAAM,UAAmB;EACvB,MAAM,KAAK;EACX,SAAS;EACT,YAAY,KAAK,WAAW,KAAK,MAAM,eAAe,EAAE,SAAS,CAAC;EAClE,WAAW,CAAC,GAAG,KAAK,SAAS;CAC/B;CACA,aAAa,IAAI,SAAS,IAAI;CAC9B,OAAO;AACT;AACA,SAAgB,iBACd,MACA,MACA,IACA,QACA,UAAU,IAAI,eAAe,MAAM,GAC1B;CACT,MAAM,OAAO,QAAQ,KAAK,IAAI;CAC9B,QAAQ,MAAM,KAAK,KAAK,SAAS,KAAK,WAAW,MAAM;CACvD,MAAM,QAAkB,CAAC;CACzB,IAAI,SAAS;CACb,KAAK,MAAM,SAAS,KAAK,YAAY;EACnC,MAAM,KAAK,KAAK,KAAK,MAAM,QAAQ,MAAM,IAAI,CAAC;EAC9C,MAAM,MAAM,MAAM;EAClB,IAAI,IAAI,MAAM,MAAM,KAAK,KAAK,KAAK,MAAM,MAAM,MAAM,MAAM,EAAE,CAAC;OACzD;GACH,MAAM,QAAQ,GAAU,QAAiB,WAAoB;IAC3D,MAAM,MAAM,EAAE,OAAO,SAAS,IAAI,GAAG,MAAM,KAAK;IAChD,MAAM,MAAM,EAAE,OAAO,SAAS,IAAI,GAAG,MAAM,KAAK;IAChD,IAAI,MAAM,KAAK,MAAM,WAAW,MAAM,KAAK,MAAM,OAC/C,QAAQ,sDAAsD;IAChE,OAAO,GAAG,SAAS,MAAM,KAAK,WAAW,GAAG,IAAI,SAAS,MAAM,KAAK;GACtE;GACA,MAAM,MACH,IAAI,QAAQ,IAAI,IAAI,MAAM,QAAQ,MAAM,IAAI,EAAE,MAAM,MACnD,KAAK,IAAI,MAAM,OAAO,IAAI,SAAS,UAAU,IAAI,SAAS,QAAQ,CACtE;GACA,IAAI,QAAQ,IAAI,MAAM,KAAK,MAAM,QAAQ,IAAI,MAAM,GAAG,GACpD,MAAM,KACJ,IAAI,KAAK,IAAI,MAAM,KAAK,IAAI,SAAS,QAAQ,IAAI,SAAS,MAAM,GAClE;EACJ;EACA,SAAS,MAAM;CACjB;CACA,MAAM,KAAK,KAAK,KAAK,MAAM,MAAM,CAAC;CAClC,OAAO,aAAa,MAAM,KAAK,EAAE,GAAG,QAAQ,OAAO;AACrD;AACA,SAAgB,iBACd,SACA,QACA,SACQ;CACR,MAAM,SAAS,WAAW,IAAI,eAAe;CAC7C,MAAM,QAAQ,aAAa,IAAI,OAAO;CACtC,MAAM,OACJ,CAAC,WAAW,OAAO,SAAS,QAAQ,OAChC,QACA,OAAO,KAAK,QAAQ,IAAI;CAC9B,OAAO,MAAM,KAAK,KAAK,SAAS,KAAK,WAAW,MAAM;CACtD,MAAM,QAAkB,CAAC;CACzB,IAAI,SAAS;CACb,KAAK,MAAM,EAAE,MAAM,IAAI,WAAW,SAAS,KAAK,YAAY;EAC1D,MAAM,KAAK,KAAK,KAAK,MAAM,QAAQ,IAAI,CAAC;EACxC,IAAI,IAAI,MAAM,MAAM,KAAK,KAAK,KAAK,MAAM,MAAM,EAAE,CAAC;OAC7C;GACH,MAAM,UAAU,GAAU,QAAiB,WACzC,IAAI,SAAS,EAAE,MAAM,IAAI,EAAE,MAAM,OAAO,IAAI,GAAG,GAAG,SAAS,EAAE,MAAM,IAAI,EAAE,MAAM,OAAO,IAAI;GAC5F,MAAM,MACH,IAAI,QAAQ,IAAI,IAAI,MAAM,QAAQ,MAAM,IAAI,EAAE,MAAM,MACnD,OAAO,IAAI,MAAM,OAAO,IAAI,SAAS,UAAU,IAAI,SAAS,QAAQ,CACxE;GACA,IAAI,QAAQ,IAAI,MAAM,KAAK,MAAM,QAAQ,IAAI,MAAM,GAAG,GACpD,MAAM,KACJ,IAAI,OAAO,IAAI,MAAM,KAAK,IAAI,SAAS,QAAQ,IAAI,SAAS,MAAM,GACpE;EACJ;EACA,SAAS;CACX;CACA,MAAM,KAAK,KAAK,KAAK,MAAM,MAAM,CAAC;CAClC,OAAO,MAAM,KAAK,EAAE;AACtB;AACA,SAAgB,gBACd,OACA,UAAU,IAAI,eAAe,GACN;CACvB,MAAM,OAAO,MAAM,QAAQ,MAAM,EAAE,CAAC,CAAC,KAAK;CAC1C,MAAM,OAAO,QAAQ,KAAK,IAAI;CAC9B,OAAO,KAAK,WAAW,WAAW,KAChC,KAAK,WAAW,EAAE,CAAC,SAAS,KAC5B,KAAK,WAAW,EAAE,CAAC,OAAO,KAAK,SAC7B,eAAe,KAAK,WAAW,EAAE,CAAC,SAAS,IAC3C,KAAA;AACN;;;;AC3VA,IAAa,gBAAb,MAA2B;CAUN;CATnB,0BAA2B,IAAI,IAAyB;CACxD,yBAA0B,IAAI,IAAsC;CACpE,yBAA0B,IAAI,IAA0B;CACxD,6BAA8B,IAAI,IAA0C;CAC5E,4BAA6B,IAAI,IAAkC;CACnE,YACE,UACA,QACA,SACA,OACA;EADiB,KAAA,QAAA;EAEjB,WAAW,SAAS,OAAO,QAAQ,aAAa,MAAM;EACtD,WAAW,SAAS,aAAa,QAAQ,mBAAmB,MAAM;EAClE,KAAK,IAAI,WAAW,SAAS,cAAc;GACzC,MAAM,QAAQ,KAAK,UAAU,QAAQ,OAAO,UAAU,KAAK,CAAC;GAC5D,MAAM,OAAO,QAAQ,KAAK,YAAY;GACtC,IAAI,CAAC,QAAQ,WACX,UAAU;IACR,GAAG;IACH,WAAW,gBAAgB,QAAQ,MAAM,OAAO;GAClD;GACF,IAAI,QAAQ,UAAU,KAAA,GAAW;IAC/B,IAAI,KAAK,QAAQ,IAAI,IAAI,GAAG,QAAQ,yBAAyB;IAC7D,KAAK,QAAQ,IAAI,MAAM,OAAO;GAChC,OAAO;IACL,MAAM,QAAQ,QAAQ,MAAM,YAAY;IACxC,IAAI,QAAQ,KAAK,OAAO,IAAI,KAAK;IACjC,IAAI,CAAC,OAAO;KACV,wBAAQ,IAAI,IAAI;KAChB,KAAK,OAAO,IAAI,OAAO,KAAK;IAC9B;IACA,IAAI,MAAM,IAAI,IAAI,GAAG,QAAQ,yBAAyB;IACtD,MAAM,IAAI,MAAM,OAAO;GACzB;EACF;EACA,IAAI,QAAQ;EACZ,IAAI,SAAS;EACb,IAAI,cAAc;EAClB,KAAK,MAAM,SAAS,SAAS,QAAQ;GACnC,UAAU,MAAM,OAAO;GACvB,WAAW,MAAM,YAAY,QAAQ,sBAAsB,MAAM;GACjE,KAAK,MAAM,cAAc,MAAM,aAAa;IAC1C,MAAM;IACN,eAAe,KAAK,IAAI,GAAG,WAAW,OAAO,MAAM;GACrD;GACA,WAAW,QAAQ,aAAa,MAAM;GACtC,WAAW,aAAa,sBAAsB,MAAM;GACpD,IAAI,OAAO,KAAK,WAAW,IAAI,MAAM,KAAK,YAAY,CAAC;GACvD,IAAI,CAAC,MAAM;IACT,uBAAO,IAAI,IAAI;IACf,KAAK,WAAW,IAAI,MAAM,KAAK,YAAY,GAAG,IAAI;GACpD;GACA,KAAK,MAAM,SAAS,MAAM,QAAQ;IAChC,WAAW,EAAE,OAAO,aAAa,MAAM;IACvC,MAAM,MAAM,KAAK,SAAS,CAAC;IAC3B,MAAM,UAAwB;KAC5B,OAAO,MAAM;KACb;KACA,yBAAS,IAAI,IAAI;IACnB;IACA,MAAM,QAAQ,SAAS,MAAM,MAAM;KACjC,MAAM,KAAK,SAAS,CAAC;KACrB,QAAQ,QAAQ,IAAI,KAAK,YAAY,GAAG,CAAC;IAC3C,CAAC;IACD,MAAM,MAAM,MAAM,KAAK,YAAY;IACnC,IAAI,KAAK,OAAO,IAAI,GAAG,GAAG,QAAQ,uBAAuB;IACzD,KAAK,OAAO,IAAI,KAAK,OAAO;IAC5B,WAAW,MAAM,MAAM,IAAI,KAAK,cAAc,MAAM;IACpD,KACE,IAAI,MAAM,MAAM,MAAM,MAAM,KAC5B,OAAO,MAAM,MAAM,IAAI,KACvB,OACA;KACA,MAAM;KACN,IAAI,YAAY,KAAK,IAAI,GAAG;KAC5B,IAAI,CAAC,WAAW;MACd,YAAY,CAAC;MACb,KAAK,IAAI,KAAK,SAAS;KACzB;KACA,UAAU,KAAK;MACb,OAAO,MAAM,MAAM,MAAM;MACzB,KAAK,MAAM,MAAM,IAAI;MACrB,OAAO;KACT,CAAC;IACH;GACF;EACF;EACA,KAAK,MAAM,QAAQ,KAAK,WAAW,OAAO,GACxC,KAAK,MAAM,aAAa,KAAK,OAAO,GAAG;GACrC,UAAU,MAAM,GAAG,MAAM;IACvB,MAAM;IACN,OAAO,EAAE,QAAQ,EAAE;GACrB,CAAC;GACD,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;IACzC,MAAM;IACN,IAAI,UAAU,EAAE,CAAC,SAAS,UAAU,IAAI,EAAE,CAAC,KACzC,QAAQ,qBAAqB;GACjC;EACF;CACJ;CACA,QACE,WACA,OACA,QACuB;EACvB,IAAI,UAAU,SAAS,SAAS,OAAO,KAAA;EACvC,IAAI,CAAC,UAAU,MAAM;GACnB,KAAK,MAAM;GACX,OAAO;EACT;EACA,MAAM,WAAW,UAAU;EAC3B,IAAI,UAAU;EACd,IAAI,QAAQ,UAAU,SAAS;EAE/B,KAAK,IAAI,QAAQ,GAAG,QAAQ,IAAI,SAAS;GACvC,MAAM,OAAO,QAAQ;GACrB,IAAI,CAAC,MACH,OAAO;IAAE,GAAG;IAAS,OAAO,QAAQ,SAAS;IAAO,MAAM;GAAS;GACrE,KAAK,MAAM,KAAK,SAAS,MAAM,SAAS,CAAC;GACzC,MAAM,MAAM,KAAK,YAAY;GAC7B,MAAM,SAAS,QAAQ,SAAS,MAAA,CAAO,YAAY;GACnD,MAAM,UAAU,KAAK,OAAO,IAAI,KAAK,CAAC,EAAE,IAAI,GAAG,KAAK,KAAK,QAAQ,IAAI,GAAG;GACxE,IAAI,SAAS,WAAW;IACtB,QAAQ,QAAQ,SAAS;IACzB,UAAU,QAAQ;IAClB;GACF;GACA,MAAM,WAAW,KAAK,SAAS,IAAI;GACnC,IAAI,CAAC,UAAU,OAAO,KAAA;GACtB,MAAM,QAAQ,SAAS,QACnB,KAAK,OAAO,IAAI,SAAS,KAAK,IAC9B,KAAK,GAAG,OAAO,MAAM;GACzB,IAAI,CAAC,OAAO,OAAO,KAAA;GACnB,MAAM,IAAI,MAAM,MAAM;GACtB,IAAI,QAAQ,EAAE,MAAM;GACpB,IAAI,MAAM,EAAE,IAAI;GAChB,IAAI,SAAS,QAAQ,QAAQ;IAC3B,QAAQ;IACR,MAAM;IACN,KAAK,MAAM,QAAQ,SAAS,SAAS;KACnC,KAAK,MAAM,KAAK,SAAS,CAAC;KAC1B,MAAM,MAAM,MAAM,QAAQ,IAAI,IAAI;KAClC,IAAI,QAAQ,KAAA,GAAW,OAAO,KAAA;KAC9B,QAAQ,KAAK,IAAI,OAAO,EAAE,MAAM,MAAM,GAAG;KACzC,MAAM,KAAK,IAAI,KAAK,EAAE,MAAM,MAAM,GAAG;IACvC;GACF;GACA,OAAO;IACL,GAAG;IACH,OAAO,MAAM;IACb,OAAO;KACL,OAAO;MACL,KAAK,SAAS,UACV,OAAO,MACP,SAAS,WAAW,SAAS,MAC3B,EAAE,MAAM,MACR,EAAE,MAAM,OAAO,MAAM,MAAM,YAAY,IAAI;MACjD,KAAK;KACP;KACA,KAAK;MACH,KAAK,SAAS,UACV,OAAO,MACP,SAAS,UACP,EAAE,MAAM,MACR,SAAS,MACP,EAAE,IAAI,MACN,EAAE,IAAI,OAAO,MAAM,MAAM,YAAY,IAAI;MACjD,KAAK;KACP;IACF;GACF;EACF;CAGF;CACA,GAAW,OAAe,QAAyC;EACjE,MAAM,OAAO,KAAK,WAAW,IAAI,KAAK,CAAC,EAAE,IAAI,OAAO,GAAG;EACvD,IAAI,CAAC,MAAM,OAAO,KAAA;EAClB,IAAI,KAAK;EACT,IAAI,KAAK,KAAK,SAAS;EACvB,OAAO,MAAM,IAAI;GACf,KAAK,MAAM;GACX,MAAM,MAAO,KAAK,OAAQ;GAC1B,MAAM,WAAW,KAAK;GACtB,IAAI,OAAO,MAAM,SAAS,OAAO,KAAK,MAAM;QACvC,IAAI,OAAO,MAAM,SAAS,KAAK,KAAK,MAAM;QAC1C,OAAO,SAAS;EACvB;CAEF;CACA,SAAiB,MAAoC;EACnD,IAAI,KAAK,UAAU,IAAI,IAAI,GAAG,OAAO,KAAK,UAAU,IAAI,IAAI;EAC5D,KAAK,MAAM,KAAK,MAAM;EACtB,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,OAAO,KAAK,CAAC,KAAK,SAAS,GAAG,GAAG;GACnC,KAAK,UAAU,IAAI,MAAM,KAAA,CAAS;GAClC;EACF;EACA,MAAM,WAAqB;GACzB,OAAO,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,YAAY;GACvC,SAAS,CAAC;GACV,SAAS;GACT,SAAS;GACT,KAAK;EACP;EACA,IAAI,OAAO;EACX,MAAM,cAAc;GAClB,IAAI,OAAO,KAAK,KAAK;GACrB,OAAO;GACP,IAAI,CAAC,MAAM;GACX,IAAI,KAAK,WAAW,GAAG,GAAG;IACxB,SAAS,UAAU;IACnB,OAAO,KAAK,MAAM,CAAC;GACrB;GACA,IAAI,SAAS,aAAa,SAAS,UAAU;QACxC,IAAI,SAAS,YAAY,SAAS,UAAU;QAC5C,IAAI,SAAS,QAAQ,SAAS,MAAM;QACpC,IAAI,CAAC,KAAK,WAAW,GAAG,KAAK,MAChC,SAAS,QAAQ,KAAK,KAAK,YAAY,CAAC;EAC5C;EACA,KAAK,IAAI,IAAI,OAAO,GAAG,IAAI,KAAK,QAAQ,KAAK;GAC3C,MAAM,IAAI,KAAK;GACf,IAAI,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,KAAK,MAAM;QACvD,QAAQ;EACf;EACA,MAAM;EACN,KAAK,UAAU,IAAI,MAAM,QAAQ;EACjC,OAAO;CACT;AACF;;;ACvPA,SAAgB,SAAS,MAAe,MAAyB;CAC/D,OAAO,KAAK,SAAS,QAAQ,MAAM,EAAE,SAAS,IAAI;AACpD;AACA,SAAgB,MAAM,MAAe,MAAmC;CACtE,OAAO,KAAK,SAAS,MAAM,MAAM,EAAE,SAAS,IAAI;AAClD;AACA,SAAgB,YAAY,MAAuB;CACjD,OAAO,KAAK,OAAO,KAAK,SAAS,IAAI,WAAW,CAAC,CAAC,KAAK,EAAE;AAC3D;AACA,SAAS,OAAc;CACrB,MAAM,IAAI,iBACR,eACA,oCACF;AACF;AACA,SAAS,QAAQ,GAAoB;CACnC,OACE,MAAM,KACN,MAAM,MACN,MAAM,MACL,KAAK,MAAM,KAAK,SAChB,KAAK,SAAU,KAAK,SACpB,KAAK,SAAW,KAAK;AAE1B;AACA,SAAS,OAAO,OAAuB;CACrC,IAAI,qDAAqD,KAAK,KAAK,GAAG,KAAK;CAC3E,OAAO,MAAM,QACX,gDACC,GAAG,WAAmB;EACrB,MAAM,QAAgC;GACpC,KAAK;GACL,IAAI;GACJ,IAAI;GACJ,MAAM;GACN,MAAM;EACR;EACA,IAAI,UAAU,OAAO,OAAO,MAAM;EAClC,MAAM,IACJ,OAAO,OAAO,MACV,OAAO,SAAS,OAAO,MAAM,CAAC,GAAG,EAAE,IACnC,OAAO,OAAO,MAAM,CAAC,CAAC;EAC5B,IAAI,CAAC,QAAQ,CAAC,GAAG,KAAK;EACtB,OAAO,OAAO,cAAc,CAAC;CAC/B,CACF;AACF;;AAGA,SAAgB,SACd,OACA,QACA,iBAA6B,CAAC,GACrB;CACT,IAAI;CACJ,IAAI;EACF,MAAM,IAAI,YAAY,SAAS,EAAE,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,KAAK;CAC9D,QAAQ;EACN,KAAK;CACP;CACA,MAAM,IAAI,QAAQ,UAAU,IAAI;CAChC,KAAK,MAAM,KAAK,KAAK,IAAI,CAAC,QAAQ,EAAE,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK;CAC/D,MAAM,OAAgB;EAAE,MAAM;EAAI,OAAO,CAAC;EAAG,UAAU,CAAC;EAAG,MAAM;CAAG;CACpE,MAAM,QAAQ,CAAC,IAAI;CACnB,MAAM,QAAQ,CAAC,EAAE;CACjB,IAAI,IAAI;CACR,IAAI,QAAQ;CACZ,IAAI,WAAW;CACf,MAAM,WAAW,OAAe,UAAU,UAAU;EAClD,YAAY,MAAM;EAClB,WAAW,UAAU,cAAc,MAAM;EACzC,IAAI,MAAM,WAAW,KAAK,MAAM,KAAK,GAAG,KAAK;EAC7C,MAAM,MAAM,SAAS,EAAE,CAAC,QAAQ,UAAU,QAAQ,OAAO,KAAK;CAChE;CACA,OAAO,IAAI,IAAI,QAAQ;EACrB,IAAI,IAAI,OAAO,KAAK;GAClB,MAAM,MAAM,IAAI,QAAQ,KAAK,CAAC;GAC9B,MAAM,OAAO,MAAM,IAAI,IAAI,SAAS;GACpC,QAAQ,IAAI,MAAM,GAAG,IAAI,CAAC;GAC1B,IAAI;GACJ;EACF;EACA,IAAI,IAAI,WAAW,QAAQ,CAAC,GAAG;GAC7B,MAAM,MAAM,IAAI,QAAQ,OAAO,IAAI,CAAC;GACpC,IAAI,MAAM,KAAK,IAAI,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,SAAS,IAAI,GAAG,KAAK;GAC1D,IAAI,MAAM;GACV;EACF;EACA,IAAI,IAAI,WAAW,aAAa,CAAC,GAAG;GAClC,MAAM,MAAM,IAAI,QAAQ,OAAO,IAAI,CAAC;GACpC,IAAI,MAAM,GAAG,KAAK;GAClB,QAAQ,IAAI,MAAM,IAAI,GAAG,GAAG,GAAG,IAAI;GACnC,IAAI,MAAM;GACV;EACF;EACA,IAAI,IAAI,WAAW,MAAM,CAAC,GAAG;GAC3B,MAAM,MAAM,IAAI,QAAQ,MAAM,IAAI,CAAC;GACnC,IAAI,MAAM,GAAG,KAAK;GAClB,IAAI,MAAM;GACV;EACF;EACA,IAAI,IAAI,WAAW,MAAM,CAAC,GAAG,KAAK;EAClC,MAAM,UAAU,IAAI,IAAI,OAAO;EAC/B,KAAK,UAAU,IAAI;EACnB,MAAM,YAAY,qBAAqB,KAAK,IAAI,MAAM,CAAC,CAAC;EACxD,IAAI,CAAC,WAAW,KAAK;EACrB,MAAM,WAAW,UAAU;EAC3B,KAAK,SAAS;EACd,IAAI,SAAS;GACX,OAAO,KAAK,KAAK,IAAI,MAAM,EAAE,KAAK,IAAI,IAAI,QAAQ;GAClD,IAAI,IAAI,SAAS,OAAO,MAAM,WAAW,KAAK,MAAM,IAAI,MAAM,UAC5D,KAAK;GACP,MAAM,IAAI;GACV;EACF;EACA,MAAM,QAAgC,OAAO,OAAO,IAAI;EACxD,IAAI,cAAc;EAClB,OAAO,MAAM;GACX,MAAM,SAAS;GACf,OAAO,IAAI,IAAI,UAAU,KAAK,KAAK,IAAI,EAAE,GAAG;GAC5C,IAAI,IAAI,WAAW,MAAM,CAAC,GAAG;IAC3B,cAAc;IACd,KAAK;IACL;GACF;GACA,IAAI,IAAI,OAAO,KAAK;IAClB;IACA;GACF;GACA,IAAI,MAAM,QAAQ,KAAK;GACvB,MAAM,QAAQ,oCAAoC,KAAK,IAAI,MAAM,CAAC,CAAC;GACnE,IAAI,CAAC,OAAO,KAAK;GACjB,KAAK,MAAM,EAAE,CAAC;GACd,MAAM,MAAM,IAAI,QAAQ,MAAM,IAAI,CAAC;GACnC,IAAI,MAAM,GAAG,KAAK;GAClB,MAAM,MAAM,IAAI,MAAM,GAAG,GAAG;GAC5B,IAAI,IAAI,SAAS,GAAG,KAAK,OAAO,OAAO,OAAO,MAAM,EAAE,GAAG,KAAK;GAC9D,YAAY,IAAI;GAChB,WAAW,UAAU,cAAc,MAAM;GACzC,SAAS;GACT,MAAM,MAAM,MAAM,OAAO,IAAI,QAAQ,WAAW,GAAG,CAAC;GACpD,IAAI,MAAM;EACZ;EACA,WAAW,EAAE,OAAO,eAAe,MAAM;EACzC,WAAW,MAAM,QAAQ,eAAe,MAAM;EAC9C,SAAS;EACT,MAAM,OAAgB;GACpB,MAAM,SAAS,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;GACnC;GACA,UAAU,CAAC;GACX,MAAM;EACR;EACA,MAAM,MAAM,SAAS,EAAE,CAAC,SAAS,KAAK,IAAI;EAC1C,IAAI,CAAC,aAAa;GAChB,MAAM,KAAK,IAAI;GACf,MAAM,KAAK,QAAQ;EACrB;CACF;CACA,IAAI,MAAM,WAAW,KAAK,KAAK,SAAS,WAAW,GAAG,KAAK;CAC3D,OAAO,KAAK,SAAS;AACvB;AAEA,SAAgB,UAAU,OAAuB;CAC/C,KAAK,MAAM,KAAK,OACd,IAAI,CAAC,QAAQ,EAAE,YAAY,CAAC,KAAK,CAAC,GAChC,MAAM,IAAI,iBACR,iBACA,oCACF;CACJ,OAAO,MACJ,QAAQ,MAAM,OAAO,CAAC,CACtB,QAAQ,MAAM,MAAM,CAAC,CACrB,QAAQ,MAAM,MAAM,CAAC,CACrB,QAAQ,MAAM,QAAQ,CAAC,CACvB,QAAQ,MAAM,QAAQ,CAAC,CACvB,QAAQ,OAAO,OAAO;AAC3B;;;AC9JA,IAAI,KAAK;IAAY,MAAM;IAAa,MAAM;AAE9C,IAAI,OAAO,IAAI,GAAG;CAAC;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAgB;CAAG;CAAoB;AAAC,CAAC;AAEhJ,IAAI,OAAO,IAAI,GAAG;CAAC;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAiB;CAAG;AAAC,CAAC;AAEvI,IAAI,OAAO,IAAI,GAAG;CAAC;CAAI;CAAI;CAAI;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;AAAE,CAAC;AAEpF,IAAI,OAAO,SAAU,IAAI,OAAO;CAC5B,IAAI,IAAI,IAAI,IAAI,EAAE;CAClB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GACtB,EAAE,KAAK,SAAS,KAAK,GAAG,IAAI;CAGhC,IAAI,IAAI,IAAI,IAAI,EAAE,GAAG;CACrB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GACtB,KAAK,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,GAC/B,EAAE,KAAO,IAAI,EAAE,MAAO,IAAK;CAGnC,OAAO;EAAK;EAAM;CAAE;AACxB;AACA,IAAI,KAAK,KAAK,MAAM,CAAC;IAAG,KAAK,GAAG;IAAG,QAAQ,GAAG;AAE9C,GAAG,MAAM,KAAK,MAAM,OAAO;AAC3B,IAAI,KAAK,KAAK,MAAM,CAAC;IAAG,KAAK,GAAG;IAAG,QAAQ,GAAG;AAE9C,IAAI,MAAM,IAAI,IAAI,KAAK;AACvB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,EAAE,GAAG;CAE5B,IAAI,KAAM,IAAI,UAAW,KAAO,IAAI,UAAW;CAC/C,KAAM,IAAI,UAAW,KAAO,IAAI,UAAW;CAC3C,KAAM,IAAI,UAAW,KAAO,IAAI,SAAW;CAC3C,IAAI,OAAQ,IAAI,UAAW,KAAO,IAAI,QAAW,MAAO;AAC5D;AAIA,IAAI,QAAQ,SAAU,IAAI,IAAI,GAAG;CAC7B,IAAI,IAAI,GAAG;CAEX,IAAI,IAAI;CAER,IAAI,IAAI,IAAI,IAAI,EAAE;CAElB,OAAO,IAAI,GAAG,EAAE,GACZ,IAAI,GAAG,IACH,EAAE,EAAE,GAAG,KAAK;CAGpB,IAAI,KAAK,IAAI,IAAI,EAAE;CACnB,KAAK,IAAI,GAAG,IAAI,IAAI,EAAE,GAClB,GAAG,KAAM,GAAG,IAAI,KAAK,EAAE,IAAI,MAAO;CAEtC,IAAI;CACJ,IAAI,GAAG;EAEH,KAAK,IAAI,IAAI,KAAK,EAAE;EAEpB,IAAI,MAAM,KAAK;EACf,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GAEjB,IAAI,GAAG,IAAI;GAEP,IAAI,KAAM,KAAK,IAAK,GAAG;GAEvB,IAAI,MAAM,KAAK,GAAG;GAElB,IAAI,IAAI,GAAG,GAAG,KAAK,EAAE,MAAM;GAE3B,KAAK,IAAI,IAAI,KAAM,KAAK,OAAO,GAAI,KAAK,GAAG,EAAE,GAEzC,GAAG,IAAI,MAAM,OAAO;EAE5B;CAER,OACK;EACD,KAAK,IAAI,IAAI,CAAC;EACd,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GACjB,IAAI,GAAG,IACH,GAAG,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,OAAQ,KAAK,GAAG;CAGrD;CACA,OAAO;AACX;AAEA,IAAI,MAAM,IAAI,GAAG,GAAG;AACpB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GACvB,IAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,GACzB,IAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,GACzB,IAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,GACzB,IAAI,KAAK;AAEb,IAAI,MAAM,IAAI,GAAG,EAAE;AACnB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GACtB,IAAI,KAAK;AAEb,IAAI,MAAoB,mBAAK,KAAK,GAAG,CAAC;IAAG,OAAqB,mBAAK,KAAK,GAAG,CAAC;AAE5E,IAAI,MAAoB,mBAAK,KAAK,GAAG,CAAC;IAAG,OAAqB,mBAAK,KAAK,GAAG,CAAC;AAE5E,IAAI,MAAM,SAAU,GAAG;CACnB,IAAI,IAAI,EAAE;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAC5B,IAAI,EAAE,KAAK,GACP,IAAI,EAAE;CAEd,OAAO;AACX;AAEA,IAAI,OAAO,SAAU,GAAG,GAAG,GAAG;CAC1B,IAAI,IAAK,IAAI,IAAK;CAClB,QAAS,EAAE,KAAM,EAAE,IAAI,MAAM,OAAQ,IAAI,KAAM;AACnD;AAEA,IAAI,SAAS,SAAU,GAAG,GAAG;CACzB,IAAI,IAAK,IAAI,IAAK;CAClB,QAAS,EAAE,KAAM,EAAE,IAAI,MAAM,IAAM,EAAE,IAAI,MAAM,QAAS,IAAI;AAChE;AAEA,IAAI,OAAO,SAAU,GAAG;CAAE,QAAS,IAAI,KAAK,IAAK;AAAG;AAGpD,IAAI,MAAM,SAAU,GAAG,GAAG,GAAG;CACzB,IAAI,KAAK,QAAQ,IAAI,GACjB,IAAI;CACR,IAAI,KAAK,QAAQ,IAAI,EAAE,QACnB,IAAI,EAAE;CAEV,OAAO,IAAI,GAAG,EAAE,SAAS,GAAG,CAAC,CAAC;AAClC;AAsBA,IAAI,KAAK;CACL;CACA;CACA;CACA;CACA;CACA;;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;AAEJ;AAEA,IAAI,MAAM,SAAU,KAAK,KAAK,IAAI;CAC9B,IAAI,IAAI,IAAI,MAAM,OAAO,GAAG,IAAI;CAChC,EAAE,OAAO;CACT,IAAI,MAAM,mBACN,MAAM,kBAAkB,GAAG,GAAG;CAClC,IAAI,CAAC,IACD,MAAM;CACV,OAAO;AACX;AAEA,IAAI,QAAQ,SAAU,KAAK,IAAI,KAAK,MAAM;CAEtC,IAAI,KAAK,IAAI,QAAQ,KAAK,OAAO,KAAK,SAAS;CAC/C,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,GACnB,OAAO,OAAO,IAAI,GAAG,CAAC;CAC1B,IAAI,QAAQ,CAAC;CAEb,IAAI,SAAS,SAAS,GAAG,KAAK;CAE9B,IAAI,OAAO,GAAG;CAEd,IAAI,OACA,MAAM,IAAI,GAAG,KAAK,CAAC;CAEvB,IAAI,OAAO,SAAU,GAAG;EACpB,IAAI,KAAK,IAAI;EAEb,IAAI,IAAI,IAAI;GAER,IAAI,OAAO,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG,CAAC,CAAC;GACrC,KAAK,IAAI,GAAG;GACZ,MAAM;EACV;CACJ;CAEA,IAAI,QAAQ,GAAG,KAAK,GAAG,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,MAAM,GAAG,GAAG,MAAM,GAAG;CAEnG,IAAI,OAAO,KAAK;CAChB,GAAG;EACC,IAAI,CAAC,IAAI;GAEL,QAAQ,KAAK,KAAK,KAAK,CAAC;GAExB,IAAI,OAAO,KAAK,KAAK,MAAM,GAAG,CAAC;GAC/B,OAAO;GACP,IAAI,CAAC,MAAM;IAEP,IAAI,IAAI,KAAK,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,KAAM,IAAI,IAAI,MAAM,GAAI,IAAI,IAAI;IACnE,IAAI,IAAI,IAAI;KACR,IAAI,MACA,IAAI,CAAC;KACT;IACJ;IAEA,IAAI,QACA,KAAK,KAAK,CAAC;IAEf,IAAI,IAAI,IAAI,SAAS,GAAG,CAAC,GAAG,EAAE;IAE9B,GAAG,IAAI,MAAM,GAAG,GAAG,IAAI,MAAM,IAAI,GAAG,GAAG,IAAI;IAC3C;GACJ,OACK,IAAI,QAAQ,GACb,KAAK,MAAM,KAAK,MAAM,MAAM,GAAG,MAAM;QACpC,IAAI,QAAQ,GAAG;IAEhB,IAAI,OAAO,KAAK,KAAK,KAAK,EAAE,IAAI,KAAK,QAAQ,KAAK,KAAK,MAAM,IAAI,EAAE,IAAI;IACvE,IAAI,KAAK,OAAO,KAAK,KAAK,MAAM,GAAG,EAAE,IAAI;IACzC,OAAO;IAEP,IAAI,MAAM,IAAI,GAAG,EAAE;IAEnB,IAAI,MAAM,IAAI,GAAG,EAAE;IACnB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,EAAE,GAEzB,IAAI,KAAK,MAAM,KAAK,KAAK,MAAM,IAAI,GAAG,CAAC;IAE3C,OAAO,QAAQ;IAEf,IAAI,MAAM,IAAI,GAAG,GAAG,UAAU,KAAK,OAAO;IAE1C,IAAI,MAAM,KAAK,KAAK,KAAK,CAAC;IAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK;KACrB,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,MAAM;KAEjC,OAAO,IAAI;KAEX,IAAI,IAAI,KAAK;KAEb,IAAI,IAAI,IACJ,IAAI,OAAO;UAEV;MAED,IAAI,IAAI,GAAG,IAAI;MACf,IAAI,KAAK,IACL,IAAI,IAAI,KAAK,KAAK,KAAK,CAAC,GAAG,OAAO,GAAG,IAAI,IAAI,IAAI;WAChD,IAAI,KAAK,IACV,IAAI,IAAI,KAAK,KAAK,KAAK,CAAC,GAAG,OAAO;WACjC,IAAI,KAAK,IACV,IAAI,KAAK,KAAK,KAAK,KAAK,GAAG,GAAG,OAAO;MACzC,OAAO,KACH,IAAI,OAAO;KACnB;IACJ;IAEA,IAAI,KAAK,IAAI,SAAS,GAAG,IAAI,GAAG,KAAK,IAAI,SAAS,IAAI;IAEtD,MAAM,IAAI,EAAE;IAEZ,MAAM,IAAI,EAAE;IACZ,KAAK,KAAK,IAAI,KAAK,CAAC;IACpB,KAAK,KAAK,IAAI,KAAK,CAAC;GACxB,OAEI,IAAI,CAAC;GACT,IAAI,MAAM,MAAM;IACZ,IAAI,MACA,IAAI,CAAC;IACT;GACJ;EACJ;EAGA,IAAI,QACA,KAAK,KAAK,MAAM;EACpB,IAAI,OAAO,KAAK,OAAO,GAAG,OAAO,KAAK,OAAO;EAC7C,IAAI,OAAO;EACX,QAAQ,OAAO,KAAK;GAEhB,IAAI,IAAI,GAAG,OAAO,KAAK,GAAG,IAAI,MAAM,MAAM,KAAK;GAC/C,OAAO,IAAI;GACX,IAAI,MAAM,MAAM;IACZ,IAAI,MACA,IAAI,CAAC;IACT;GACJ;GACA,IAAI,CAAC,GACD,IAAI,CAAC;GACT,IAAI,MAAM,KACN,IAAI,QAAQ;QACX,IAAI,OAAO,KAAK;IACjB,OAAO,KAAK,KAAK;IACjB;GACJ,OACK;IACD,IAAI,MAAM,MAAM;IAEhB,IAAI,MAAM,KAAK;KAEX,IAAI,IAAI,MAAM,KAAK,IAAI,KAAK;KAC5B,MAAM,KAAK,KAAK,MAAM,KAAK,KAAK,CAAC,IAAI,GAAG;KACxC,OAAO;IACX;IAEA,IAAI,IAAI,GAAG,OAAO,KAAK,GAAG,IAAI,MAAM,OAAO,KAAK;IAChD,IAAI,CAAC,GACD,IAAI,CAAC;IACT,OAAO,IAAI;IACX,IAAI,KAAK,GAAG;IACZ,IAAI,OAAO,GAAG;KACV,IAAI,IAAI,KAAK;KACb,MAAM,OAAO,KAAK,GAAG,KAAK,KAAK,KAAK,GAAG,OAAO;IAClD;IACA,IAAI,MAAM,MAAM;KACZ,IAAI,MACA,IAAI,CAAC;KACT;IACJ;IACA,IAAI,QACA,KAAK,KAAK,MAAM;IACpB,IAAI,MAAM,KAAK;IACf,IAAI,KAAK,IAAI;KACT,IAAI,QAAQ,KAAK,IAAI,OAAO,KAAK,IAAI,IAAI,GAAG;KAC5C,IAAI,QAAQ,KAAK,GACb,IAAI,CAAC;KACT,OAAO,KAAK,MAAM,EAAE,IAChB,IAAI,MAAM,KAAK,QAAQ;IAC/B;IACA,OAAO,KAAK,KAAK,EAAE,IACf,IAAI,MAAM,IAAI,KAAK;GAC3B;EACJ;EACA,GAAG,IAAI,IAAI,GAAG,IAAI,MAAM,GAAG,IAAI,IAAI,GAAG,IAAI;EAC1C,IAAI,IACA,QAAQ,GAAG,GAAG,IAAI,KAAK,GAAG,IAAI,IAAI,GAAG,IAAI;CACjD,SAAS,CAAC;CAEV,OAAO,MAAM,IAAI,UAAU,QAAQ,IAAI,KAAK,GAAG,EAAE,IAAI,IAAI,SAAS,GAAG,EAAE;AAC3E;AAEA,IAAI,QAAQ,SAAU,GAAG,GAAG,GAAG;CAC3B,MAAM,IAAI;CACV,IAAI,IAAK,IAAI,IAAK;CAClB,EAAE,MAAM;CACR,EAAE,IAAI,MAAM,KAAK;AACrB;AAEA,IAAI,UAAU,SAAU,GAAG,GAAG,GAAG;CAC7B,MAAM,IAAI;CACV,IAAI,IAAK,IAAI,IAAK;CAClB,EAAE,MAAM;CACR,EAAE,IAAI,MAAM,KAAK;CACjB,EAAE,IAAI,MAAM,KAAK;AACrB;AAEA,IAAI,QAAQ,SAAU,GAAG,IAAI;CAEzB,IAAI,IAAI,CAAC;CACT,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAC5B,IAAI,EAAE,IACF,EAAE,KAAK;EAAE,GAAG;EAAG,GAAG,EAAE;CAAG,CAAC;CAEhC,IAAI,IAAI,EAAE;CACV,IAAI,KAAK,EAAE,MAAM;CACjB,IAAI,CAAC,GACD,OAAO;EAAE,GAAG;EAAI,GAAG;CAAE;CACzB,IAAI,KAAK,GAAG;EACR,IAAI,IAAI,IAAI,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC;EACzB,EAAE,EAAE,EAAE,CAAC,KAAK;EACZ,OAAO;GAAE,GAAG;GAAG,GAAG;EAAE;CACxB;CACA,EAAE,KAAK,SAAU,GAAG,GAAG;EAAE,OAAO,EAAE,IAAI,EAAE;CAAG,CAAC;CAG5C,EAAE,KAAK;EAAE,GAAG;EAAI,GAAG;CAAM,CAAC;CAC1B,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,KAAK,GAAG,KAAK,GAAG,KAAK;CAC7C,EAAE,KAAK;EAAE,GAAG;EAAI,GAAG,EAAE,IAAI,EAAE;EAAM;EAAM;CAAE;CAMzC,OAAO,MAAM,IAAI,GAAG;EAChB,IAAI,EAAE,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,OAAO;EACjC,IAAI,EAAE,MAAM,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,OAAO;EAC7C,EAAE,QAAQ;GAAE,GAAG;GAAI,GAAG,EAAE,IAAI,EAAE;GAAM;GAAM;EAAE;CAChD;CACA,IAAI,SAAS,GAAG,EAAE,CAAC;CACnB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GACrB,IAAI,GAAG,EAAE,CAAC,IAAI,QACV,SAAS,GAAG,EAAE,CAAC;CAGvB,IAAI,KAAK,IAAI,IAAI,SAAS,CAAC;CAE3B,IAAI,MAAM,GAAG,EAAE,KAAK,IAAI,IAAI,CAAC;CAC7B,IAAI,MAAM,IAAI;EAIV,IAAI,IAAI,GAAG,KAAK;EAEhB,IAAI,MAAM,MAAM,IAAI,MAAM,KAAK;EAC/B,GAAG,KAAK,SAAU,GAAG,GAAG;GAAE,OAAO,GAAG,EAAE,KAAK,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE;EAAG,CAAC;EAClE,OAAO,IAAI,GAAG,EAAE,GAAG;GACf,IAAI,OAAO,GAAG,EAAE,CAAC;GACjB,IAAI,GAAG,QAAQ,IAAI;IACf,MAAM,OAAO,KAAM,MAAM,GAAG;IAC5B,GAAG,QAAQ;GACf,OAEI;EACR;EACA,OAAO;EACP,OAAO,KAAK,GAAG;GACX,IAAI,OAAO,GAAG,EAAE,CAAC;GACjB,IAAI,GAAG,QAAQ,IACX,MAAM,KAAM,KAAK,GAAG,KAAK,KAAK;QAE9B,EAAE;EACV;EACA,OAAO,KAAK,KAAK,IAAI,EAAE,GAAG;GACtB,IAAI,OAAO,GAAG,EAAE,CAAC;GACjB,IAAI,GAAG,SAAS,IAAI;IAChB,EAAE,GAAG;IACL,EAAE;GACN;EACJ;EACA,MAAM;CACV;CACA,OAAO;EAAE,GAAG,IAAI,GAAG,EAAE;EAAG,GAAG;CAAI;AACnC;AAEA,IAAI,KAAK,SAAU,GAAG,GAAG,GAAG;CACxB,OAAO,EAAE,KAAK,KACR,KAAK,IAAI,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC,CAAC,IAC5C,EAAE,EAAE,KAAK;AACpB;AAEA,IAAI,KAAK,SAAU,GAAG;CAClB,IAAI,IAAI,EAAE;CAEV,OAAO,KAAK,CAAC,EAAE,EAAE;CAEjB,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;CAEpB,IAAI,MAAM,GAAG,MAAM,EAAE,IAAI,MAAM;CAC/B,IAAI,IAAI,SAAU,GAAG;EAAE,GAAG,SAAS;CAAG;CACtC,KAAK,IAAI,IAAI,GAAG,KAAK,GAAG,EAAE,GACtB,IAAI,EAAE,MAAM,OAAO,KAAK,GACpB,EAAE;MACD;EACD,IAAI,CAAC,OAAO,MAAM,GAAG;GACjB,OAAO,MAAM,KAAK,OAAO,KACrB,EAAE,KAAK;GACX,IAAI,MAAM,GAAG;IACT,EAAE,MAAM,KAAO,MAAM,MAAO,IAAK,QAAU,MAAM,KAAM,IAAK,KAAK;IACjE,MAAM;GACV;EACJ,OACK,IAAI,MAAM,GAAG;GACd,EAAE,GAAG,GAAG,EAAE;GACV,OAAO,MAAM,GAAG,OAAO,GACnB,EAAE,IAAI;GACV,IAAI,MAAM,GACN,EAAI,MAAM,KAAM,IAAK,IAAI,GAAG,MAAM;EAC1C;EACA,OAAO,OACH,EAAE,GAAG;EACT,MAAM;EACN,MAAM,EAAE;CACZ;CAEJ,OAAO;EAAE,GAAG,GAAG,SAAS,GAAG,GAAG;EAAG,GAAG;CAAE;AAC1C;AAEA,IAAI,OAAO,SAAU,IAAI,IAAI;CACzB,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,EAAE,GAC7B,KAAK,GAAG,KAAK,GAAG;CACpB,OAAO;AACX;AAGA,IAAI,QAAQ,SAAU,KAAK,KAAK,KAAK;CAEjC,IAAI,IAAI,IAAI;CACZ,IAAI,IAAI,KAAK,MAAM,CAAC;CACpB,IAAI,KAAK,IAAI;CACb,IAAI,IAAI,KAAK,KAAK;CAClB,IAAI,IAAI,KAAK,IAAI,KAAK;CACtB,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK;CAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GACrB,IAAI,IAAI,IAAI,KAAK,IAAI;CACzB,QAAQ,IAAI,IAAI,KAAK;AACzB;AAEA,IAAI,OAAO,SAAU,KAAK,KAAK,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG;CACnE,MAAM,KAAK,KAAK,KAAK;CACrB,EAAE,GAAG;CACL,IAAI,KAAK,MAAM,IAAI,EAAE,GAAG,MAAM,GAAG,GAAG,MAAM,GAAG;CAC7C,IAAI,KAAK,MAAM,IAAI,EAAE,GAAG,MAAM,GAAG,GAAG,MAAM,GAAG;CAC7C,IAAI,KAAK,GAAG,GAAG,GAAG,OAAO,GAAG,GAAG,MAAM,GAAG;CACxC,IAAI,KAAK,GAAG,GAAG,GAAG,OAAO,GAAG,GAAG,MAAM,GAAG;CACxC,IAAI,SAAS,IAAI,IAAI,EAAE;CACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAC/B,EAAE,OAAO,KAAK,KAAK;CACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAC/B,EAAE,OAAO,KAAK,KAAK;CACvB,IAAI,KAAK,MAAM,QAAQ,CAAC,GAAG,MAAM,GAAG,GAAG,OAAO,GAAG;CACjD,IAAI,OAAO;CACX,OAAO,OAAO,KAAK,CAAC,IAAI,KAAK,OAAO,KAAK,EAAE;CAE3C,IAAI,OAAQ,KAAK,KAAM;CACvB,IAAI,QAAQ,KAAK,IAAI,GAAG,IAAI,KAAK,IAAI,GAAG,IAAI;CAC5C,IAAI,QAAQ,KAAK,IAAI,GAAG,IAAI,KAAK,IAAI,GAAG,IAAI,KAAK,KAAK,IAAI,OAAO,KAAK,QAAQ,GAAG,IAAI,IAAI,OAAO,MAAM,IAAI,OAAO,MAAM,IAAI,OAAO;CAClI,IAAI,MAAM,KAAK,QAAQ,SAAS,QAAQ,OACpC,OAAO,MAAM,KAAK,GAAG,IAAI,SAAS,IAAI,KAAK,EAAE,CAAC;CAClD,IAAI,IAAI,IAAI,IAAI;CAChB,MAAM,KAAK,GAAG,KAAK,QAAQ,MAAM,GAAG,KAAK;CACzC,IAAI,QAAQ,OAAO;EACf,KAAK,KAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,CAAC,GAAG,KAAK;EAC/D,IAAI,MAAM,KAAK,KAAK,MAAM,CAAC;EAC3B,MAAM,KAAK,GAAG,MAAM,GAAG;EACvB,MAAM,KAAK,IAAI,GAAG,MAAM,CAAC;EACzB,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC;EAC3B,KAAK;EACL,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,EAAE,GACxB,MAAM,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,GAAG;EACtC,KAAK,IAAI;EACT,IAAI,OAAO,CAAC,MAAM,IAAI;EACtB,KAAK,IAAI,KAAK,GAAG,KAAK,GAAG,EAAE,IAAI;GAC3B,IAAI,OAAO,KAAK;GAChB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;IAClC,IAAI,MAAM,KAAK,KAAK;IACpB,MAAM,KAAK,GAAG,IAAI,IAAI,GAAG,KAAK,IAAI;IAClC,IAAI,MAAM,IACN,MAAM,KAAK,GAAI,KAAK,MAAM,IAAK,GAAG,GAAG,KAAK,KAAK,MAAM;GAC7D;EACJ;CACJ,OAEI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;CAEvC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;EACzB,IAAI,MAAM,KAAK;EACf,IAAI,MAAM,KAAK;GACX,IAAI,MAAO,OAAO,KAAM;GACxB,QAAQ,KAAK,GAAG,GAAG,MAAM,IAAI,GAAG,KAAK,GAAG,MAAM;GAC9C,IAAI,MAAM,GACN,MAAM,KAAK,GAAI,OAAO,KAAM,EAAE,GAAG,KAAK,KAAK;GAC/C,IAAI,MAAM,MAAM;GAChB,QAAQ,KAAK,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG;GAClC,IAAI,MAAM,GACN,QAAQ,KAAK,GAAI,OAAO,IAAK,IAAI,GAAG,KAAK,KAAK;EACtD,OAEI,QAAQ,KAAK,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG;CAE1C;CACA,QAAQ,KAAK,GAAG,GAAG,IAAI;CACvB,OAAO,IAAI,GAAG;AAClB;AAEA,IAAI,oBAAoB,IAAI,IAAI;CAAC;CAAO;CAAQ;CAAQ;CAAQ;CAAQ;CAAS;CAAS;CAAS;AAAO,CAAC;AAE3G,IAAI,mBAAmB,IAAI,GAAG,CAAC;AAE/B,IAAI,OAAO,SAAU,KAAK,KAAK,MAAM,KAAK,MAAM,IAAI;CAChD,IAAI,IAAI,GAAG,KAAK,IAAI;CACpB,IAAI,IAAI,IAAI,GAAG,MAAM,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,GAAI,KAAK,IAAI;CAE7D,IAAI,IAAI,EAAE,SAAS,KAAK,EAAE,SAAS,IAAI;CACvC,IAAI,MAAM,GAAG;CACb,IAAI,OAAO,GAAG,KAAK,KAAK;CACxB,IAAI,KAAK;EACL,IAAI,KACA,EAAE,KAAK,GAAG,KAAK;EACnB,IAAI,MAAM,IAAI,MAAM;EACpB,IAAI,IAAI,OAAO,IAAI,IAAI,MAAM;EAC7B,IAAI,SAAS,KAAK,QAAQ;EAE1B,IAAI,OAAO,GAAG,KAAK,IAAI,IAAI,KAAK,GAAG,OAAO,GAAG,KAAK,IAAI,IAAI,QAAQ,CAAC;EACnE,IAAI,QAAQ,KAAK,KAAK,OAAO,CAAC,GAAG,QAAQ,IAAI;EAC7C,IAAI,MAAM,SAAU,GAAG;GAAE,QAAQ,IAAI,KAAM,IAAI,IAAI,MAAM,QAAU,IAAI,IAAI,MAAM,SAAU;EAAO;EAGlG,IAAI,OAAO,IAAI,IAAI,IAAK;EAExB,IAAI,KAAK,IAAI,IAAI,GAAG,GAAG,KAAK,IAAI,IAAI,EAAE;EAEtC,IAAI,OAAO,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK;EAClE,OAAO,IAAI,IAAI,GAAG,EAAE,GAAG;GAEnB,IAAI,KAAK,IAAI,CAAC;GAEd,IAAI,OAAO,IAAI,OAAO,QAAQ,KAAK;GACnC,KAAK,QAAQ;GACb,KAAK,MAAM;GAGX,IAAI,MAAM,GAAG;IAET,IAAI,MAAM,IAAI;IACd,KAAK,OAAO,OAAQ,KAAK,WAAW,MAAM,OAAO,CAAC,MAAM;KACpD,MAAM,KAAK,KAAK,GAAG,GAAG,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG;KAC3D,KAAK,OAAO,KAAK,GAAG,KAAK;KACzB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GACvB,GAAG,KAAK;KACZ,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GACtB,GAAG,KAAK;IAChB;IAEA,IAAI,IAAI,GAAG,IAAI,GAAG,OAAO,GAAG,MAAM,OAAO,QAAQ;IACjD,IAAI,MAAM,KAAK,MAAM,IAAI,IAAI,GAAG,GAAG;KAC/B,IAAI,OAAO,KAAK,IAAI,GAAG,GAAG,IAAI;KAC9B,IAAI,OAAO,KAAK,IAAI,OAAO,CAAC;KAG5B,IAAI,KAAK,KAAK,IAAI,KAAK,GAAG;KAC1B,OAAO,OAAO,QAAQ,EAAE,QAAQ,QAAQ,OAAO;MAC3C,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM;OAChC,IAAI,KAAK;OACT,OAAO,KAAK,MAAM,IAAI,IAAI,OAAO,IAAI,IAAI,KAAK,MAAM,EAAE;OAEtD,IAAI,KAAK,GAAG;QACR,IAAI,IAAI,IAAI;QAEZ,IAAI,KAAK,MACL;QAIJ,IAAI,MAAM,KAAK,IAAI,KAAK,KAAK,CAAC;QAC9B,IAAI,KAAK;QACT,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;SAC1B,IAAI,KAAK,IAAI,MAAM,IAAI;SAEvB,IAAI,KAAK,KADC,KAAK,MACK;SACpB,IAAI,KAAK,IACL,KAAK,IAAI,QAAQ;QACzB;OACJ;MACJ;MAEA,OAAO,OAAO,QAAQ,KAAK;MAC3B,OAAO,OAAO,QAAQ;KAC1B;IACJ;IAEA,IAAI,GAAG;KAGH,KAAK,QAAQ,YAAa,MAAM,MAAM,KAAM,MAAM;KAClD,IAAI,MAAM,MAAM,KAAK,IAAI,MAAM,MAAM,KAAK;KAC1C,MAAM,KAAK,OAAO,KAAK;KACvB,EAAE,GAAG,MAAM;KACX,EAAE,GAAG;KACL,KAAK,IAAI;KACT,EAAE;IACN,OACK;KACD,KAAK,QAAQ,IAAI;KACjB,EAAE,GAAG,IAAI;IACb;GACJ;EACJ;EACA,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,GAAG,IAAI,GAAG,EAAE,GAAG;GAClC,KAAK,QAAQ,IAAI;GACjB,EAAE,GAAG,IAAI;EACb;EACA,MAAM,KAAK,KAAK,GAAG,KAAK,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG;EAC7D,IAAI,CAAC,KAAK;GACN,GAAG,IAAK,MAAM,IAAK,EAAG,MAAM,IAAK,MAAM;GAEvC,OAAO;GACP,GAAG,IAAI,MAAM,GAAG,IAAI,MAAM,GAAG,IAAI,GAAG,GAAG,IAAI;EAC/C;CACJ,OACK;EACD,KAAK,IAAI,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,KAAK,KAAK,OAAO;GAE7C,IAAI,IAAI,IAAI;GACZ,IAAI,KAAK,GAAG;IAER,EAAG,MAAM,IAAK,KAAK;IACnB,IAAI;GACR;GACA,MAAM,MAAM,GAAG,MAAM,GAAG,IAAI,SAAS,GAAG,CAAC,CAAC;EAC9C;EACA,GAAG,IAAI;CACX;CACA,OAAO,IAAI,GAAG,GAAG,MAAM,KAAK,GAAG,IAAI,IAAI;AAC3C;AAEA,IAAI,OAAqB,eAAC,WAAY;CAClC,IAAI,oBAAI,IAAI,WAAW,GAAG;CAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;EAC1B,IAAI,IAAI,GAAG,IAAI;EACf,OAAO,EAAE,GACL,KAAM,IAAI,KAAM,cAAe,MAAM;EACzC,EAAE,KAAK;CACX;CACA,OAAO;AACX,EAAA,CAAG;AAEH,IAAI,MAAM,WAAY;CAClB,IAAI,IAAI;CACR,OAAO;EACH,GAAG,SAAU,GAAG;GAEZ,IAAI,KAAK;GACT,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAC5B,KAAK,KAAM,KAAK,MAAO,EAAE,MAAO,OAAO;GAC3C,IAAI;EACR;EACA,GAAG,WAAY;GAAE,OAAO,CAAC;EAAG;CAChC;AACJ;AAyBA,IAAI,OAAO,SAAU,KAAK,KAAK,KAAK,MAAM,IAAI;CAC1C,IAAI,CAAC,IAAI;EACL,KAAK,EAAE,GAAG,EAAE;EACZ,IAAI,IAAI,YAAY;GAChB,IAAI,OAAO,IAAI,WAAW,SAAS,MAAM;GACzC,IAAI,SAAS,IAAI,GAAG,KAAK,SAAS,IAAI,MAAM;GAC5C,OAAO,IAAI,IAAI;GACf,OAAO,IAAI,KAAK,KAAK,MAAM;GAC3B,MAAM;GACN,GAAG,IAAI,KAAK;EAChB;CACJ;CACA,OAAO,KAAK,KAAK,IAAI,SAAS,OAAO,IAAI,IAAI,OAAO,IAAI,OAAO,OAAQ,GAAG,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,MAAM,CAAC,CAAC,IAAI,GAAG,IAAI,KAAO,KAAK,IAAI,KAAM,KAAK,MAAM,EAAE;AACxL;AAEA,IAAI,MAAM,SAAU,GAAG,GAAG;CACtB,IAAI,IAAI,CAAC;CACT,KAAK,IAAI,KAAK,GACV,EAAE,KAAK,EAAE;CACb,KAAK,IAAI,KAAK,GACV,EAAE,KAAK,EAAE;CACb,OAAO;AACX;AA0IA,IAAI,SAAS,SAAU,GAAG,GAAG,GAAG;CAC5B,OAAO,GAAG,EAAE,GACR,EAAE,KAAK,GAAG,OAAO;AACzB;;;;;;;AAkKA,SAAgB,YAAY,MAAM,MAAM;CACpC,OAAO,KAAK,MAAM,QAAQ,CAAC,GAAG,GAAG,CAAC;AACtC;;;;AAIA,IAAI,UAAyB,2BAAY;CACrC,SAAS,QAAQ,MAAM,IAAI;EAEvB,IAAI,OAAO,QAAQ,YACf,KAAK,MAAM,OAAO,CAAC;EACvB,KAAK,SAAS;EACd,IAAI,OAAO,QAAQ,KAAK,cAAc,KAAK,WAAW,SAAS,MAAM;EACrE,KAAK,IAAI;GAAE,GAAG;GAAG,GAAG,OAAO,KAAK,SAAS;EAAE;EAC3C,KAAK,IAAI,IAAI,GAAG,KAAK;EACrB,KAAK,IAAI,IAAI,GAAG,CAAC;EACjB,IAAI,MACA,KAAK,EAAE,IAAI,IAAI;CACvB;CACA,QAAQ,UAAU,IAAI,SAAU,GAAG;EAC/B,IAAI,CAAC,KAAK,QACN,IAAI,CAAC;EACT,IAAI,KAAK,GACL,IAAI,CAAC;EACT,IAAI,CAAC,KAAK,EAAE,QACR,KAAK,IAAI;OACR,IAAI,EAAE,QAAQ;GACf,IAAI,IAAI,IAAI,GAAG,KAAK,EAAE,SAAS,EAAE,MAAM;GACvC,EAAE,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,GAAG,KAAK,EAAE,MAAM,GAAG,KAAK,IAAI;EACrD;CACJ;CACA,QAAQ,UAAU,IAAI,SAAU,OAAO;EACnC,KAAK,EAAE,IAAI,EAAE,KAAK,IAAI,SAAS;EAC/B,IAAI,MAAM,KAAK,EAAE;EACjB,IAAI,KAAK,MAAM,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;EACrC,KAAK,OAAO,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC;EAC1C,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE,IAAI,KAAK,GAAG,KAAK,EAAE,IAAI,KAAK,EAAE;EACtD,KAAK,IAAI,IAAI,KAAK,GAAI,KAAK,EAAE,IAAI,IAAK,CAAC,GAAG,KAAK,EAAE,KAAK;CAC1D;;;;;;CAMA,QAAQ,UAAU,OAAO,SAAU,OAAO,OAAO;EAC7C,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK;CAC/B;CACA,OAAO;AACX,EAAE;AA6cF,IAAI,OAAO,SAAU,GAAG,GAAG,GAAG,GAAG;CAC7B,KAAK,IAAI,KAAK,GAAG;EACb,IAAI,MAAM,EAAE,IAAI,IAAI,IAAI,GAAG,KAAK;EAChC,IAAI,MAAM,QAAQ,GAAG,GACjB,KAAK,IAAI,GAAG,IAAI,EAAE,GAAG,MAAM,IAAI;EACnC,IAAI,eAAe,IACf,EAAE,KAAK,CAAC,KAAK,EAAE;OACd;GACD,EAAE,KAAK,OAAO,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE;GAC5B,KAAK,KAAK,GAAG,GAAG,CAAC;EACrB;CACJ;AACJ;AAEA,IAAI,KAAK,OAAO,eAAe,6BAA6B,IAAI,YAAY;AAE5E,IAAI,KAAK,OAAO,eAAe,6BAA6B,IAAI,YAAY;AAG5E,IAAI;CACA,GAAG,OAAO,IAAI,EAAE,QAAQ,KAAK,CAAC;AAElC,SACO,GAAG,CAAE;;;;;;;;AAwGZ,SAAgB,QAAQ,KAAK,QAAQ;CACjC,IAAI,QAAQ;EACR,IAAI,OAAO,IAAI,GAAG,IAAI,MAAM;EAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAC9B,KAAK,KAAK,IAAI,WAAW,CAAC;EAC9B,OAAO;CACX;CACA,IAAI,IACA,OAAO,GAAG,OAAO,GAAG;CACxB,IAAI,IAAI,IAAI;CACZ,IAAI,KAAK,IAAI,GAAG,IAAI,UAAU,IAAI,UAAU,EAAE;CAC9C,IAAI,KAAK;CACT,IAAI,IAAI,SAAU,GAAG;EAAE,GAAG,QAAQ;CAAG;CACrC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;EACxB,IAAI,KAAK,IAAI,GAAG,QAAQ;GACpB,IAAI,IAAI,IAAI,GAAG,KAAK,KAAM,IAAI,KAAM,EAAE;GACtC,EAAE,IAAI,EAAE;GACR,KAAK;EACT;EACA,IAAI,IAAI,IAAI,WAAW,CAAC;EACxB,IAAI,IAAI,OAAO,QACX,EAAE,CAAC;OACF,IAAI,IAAI,MACT,EAAE,MAAO,KAAK,CAAE,GAAG,EAAE,MAAO,IAAI,EAAG;OAClC,IAAI,IAAI,SAAS,IAAI,OACtB,IAAI,SAAS,IAAI,WAAe,IAAI,WAAW,EAAE,CAAC,IAAI,MAClD,EAAE,MAAO,KAAK,EAAG,GAAG,EAAE,MAAQ,KAAK,KAAM,EAAG,GAAG,EAAE,MAAQ,KAAK,IAAK,EAAG,GAAG,EAAE,MAAO,IAAI,EAAG;OAE7F,EAAE,MAAO,KAAK,EAAG,GAAG,EAAE,MAAQ,KAAK,IAAK,EAAG,GAAG,EAAE,MAAO,IAAI,EAAG;CACtE;CACA,OAAO,IAAI,IAAI,GAAG,EAAE;AACxB;AA2CA,IAAI,OAAO,SAAU,IAAI;CACrB,IAAI,KAAK;CACT,IAAI,IACA,KAAK,IAAI,KAAK,IAAI;EACd,IAAI,IAAI,GAAG,EAAE,CAAC;EACd,IAAI,IAAI,OACJ,IAAI,CAAC;EACT,MAAM,IAAI;CACd;CAEJ,OAAO;AACX;AAEA,IAAI,MAAM,SAAU,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,IAAI;CAC3C,IAAI,KAAK,GAAG,QAAQ,KAAK,EAAE,OAAO,MAAM,MAAM,GAAG;CACjD,IAAI,MAAM,KAAK,EAAE;CACjB,OAAO,GAAG,GAAG,MAAM,OAAO,WAAY,QAAS,GAAG,KAAK;CACvD,IAAI,MAAM,MACN,EAAE,OAAO,IAAI,EAAE,OAAO,EAAE;CAC5B,EAAE,KAAK,IAAI,KAAK;CAChB,EAAE,OAAQ,EAAE,QAAQ,KAAM,IAAI,KAAK,IAAI,EAAE,OAAO,KAAK;CACrD,EAAE,OAAO,EAAE,cAAc,KAAK,EAAE,OAAO,EAAE,eAAe;CACxD,IAAI,KAAK,IAAI,KAAK,EAAE,SAAS,OAAO,KAAK,IAAI,IAAI,EAAE,KAAK,GAAG,IAAI,GAAG,YAAY,IAAI;CAClF,IAAI,IAAI,KAAK,IAAI,KACb,IAAI,EAAE;CACV,OAAO,GAAG,GAAI,KAAK,KAAQ,GAAG,SAAS,IAAI,KAAM,KAAO,GAAG,QAAQ,KAAK,KAAO,GAAG,SAAS,KAAK,KAAO,GAAG,WAAW,KAAK,IAAM,GAAG,WAAW,KAAK,CAAE,GAAG,KAAK;CAC7J,IAAI,KAAK,IAAI;EACT,OAAO,GAAG,GAAG,EAAE,GAAG;EAClB,OAAO,GAAG,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC;EACnC,OAAO,GAAG,IAAI,GAAG,EAAE,IAAI;CAC3B;CACA,OAAO,GAAG,IAAI,IAAI,EAAE;CACpB,OAAO,GAAG,IAAI,IAAI,GAAG,GAAG,KAAK;CAC7B,IAAI,MAAM,MAAM;EACZ,OAAO,GAAG,GAAG,GAAG;EAChB,OAAO,GAAG,IAAI,GAAG,EAAE,KAAK;EACxB,OAAO,GAAG,IAAI,IAAI,EAAE,GAAG,KAAK;CAChC;CACA,EAAE,IAAI,IAAI,CAAC;CACX,KAAK;CACL,IAAI,KACA,KAAK,IAAI,KAAK,IAAI;EACd,IAAI,MAAM,GAAG,IAAI,IAAI,IAAI;EACzB,OAAO,GAAG,GAAG,CAAC,CAAC;EACf,OAAO,GAAG,IAAI,GAAG,CAAC;EAClB,EAAE,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,IAAI;CAChC;CAEJ,IAAI,KACA,EAAE,IAAI,IAAI,CAAC,GAAG,KAAK;CACvB,OAAO;AACX;AAEA,IAAI,MAAM,SAAU,GAAG,GAAG,GAAG,GAAG,GAAG;CAC/B,OAAO,GAAG,GAAG,SAAS;CACtB,OAAO,GAAG,IAAI,GAAG,CAAC;CAClB,OAAO,GAAG,IAAI,IAAI,CAAC;CACnB,OAAO,GAAG,IAAI,IAAI,CAAC;CACnB,OAAO,GAAG,IAAI,IAAI,CAAC;AACvB;;;;;;;;AAkXA,SAAgB,QAAQ,MAAM,MAAM;CAChC,IAAI,CAAC,MACD,OAAO,CAAC;CACZ,IAAI,IAAI,CAAC;CACT,IAAI,QAAQ,CAAC;CACb,KAAK,MAAM,IAAI,GAAG,IAAI;CACtB,IAAI,IAAI;CACR,IAAI,MAAM;CACV,KAAK,IAAI,MAAM,GAAG;EACd,IAAI,KAAK,EAAE,KAAK,OAAO,GAAG,IAAI,IAAI,GAAG;EACrC,IAAI,cAAc,EAAE,SAAS,IAAI,IAAI;EACrC,IAAI,IAAI,QAAQ,EAAE,GAAG,IAAI,EAAE;EAC3B,IAAI,MAAM,EAAE,SAAS,IAAI,OAAO,QAAQ,GAAG,GAAG,KAAK,KAAK,EAAE;EAC1D,IAAI,MAAM,KAAK,EAAE,KAAK;EACtB,IAAI,IAAI,OACJ,IAAI,EAAE;EACV,IAAI,IAAI,cAAc,YAAY,MAAM,CAAC,IAAI,MAAM,IAAI,EAAE;EACzD,IAAI,IAAI,IAAI;EACZ,EAAE,EAAE,IAAI;EACR,MAAM,KAAK,IAAI,GAAG;GACd,MAAM,KAAK;GACX,KAAK,EAAE,EAAE;GACT,GAAG;GACA;GACA;GACH,GAAG,KAAK,GAAG,UAAW,KAAM,IAAI,UAAU;GACvC;GACU;EACjB,CAAC,CAAC;EACF,KAAK,KAAK,IAAI,MAAM;EACpB,OAAO,KAAK,KAAK,IAAI,QAAQ,MAAM,KAAK;CAC5C;CACA,IAAI,MAAM,IAAI,GAAG,MAAM,EAAE,GAAG,KAAK,GAAG,MAAM,MAAM;CAChD,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,GAAG;EACnC,IAAI,IAAI,MAAM;EACd,IAAI,KAAK,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM;EACrC,IAAI,OAAO,KAAK,EAAE,EAAE,SAAS,KAAK,EAAE,KAAK;EACzC,IAAI,IAAI,EAAE,GAAG,EAAE,IAAI,IAAI;EACvB,IAAI,KAAK,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,GAAG,KAAK,KAAK,QAAQ,EAAE,IAAI,EAAE,EAAE,SAAS;CACzF;CACA,IAAI,KAAK,GAAG,MAAM,QAAQ,KAAK,EAAE;CACjC,OAAO;AACX;;;ACrvEA,SAAgB,aACd,OACA,QACyB;CACzB,IAAI;EACF,WAAW,MAAM,QAAQ,iBAAiB,MAAM;EAChD,MAAM,WAAW,mBAAmB,OAAO;GACzC,YAAY,OAAO;GACnB,2BAA2B,OAAO;GAClC,2BAA2B,OAAO;GAClC,cAAc,OAAO;EACvB,CAAC;EACD,KAAK,MAAM,SAAS,SAAS,SAC3B,IAAI,MAAM,sBAAsB,KAAK,MAAM,sBAAsB,GAC/D,MAAM,IAAI,iBACR,mBACA,qCACF;EAEJ,MAAM,OAAO,IAAI,SAAS,MAAM,QAAQ,MAAM,YAAY,MAAM,UAAU;EAC1E,MAAM,yBAAS,IAAI,IAAwB;EAC3C,IAAI,MAAM,MAAM,SAAS;EACzB,OACE,OAAO,MACN,KAAK,UAAU,KAAK,IAAI,MAAM,aAC7B,MAAM,KAAK,KAAK,UAAU,MAAM,IAAI,IAAI,MAAM,MAAM,SAEtD;EACF,IAAI,MAAM,GACR,MAAM,IAAI,iBAAiB,eAAe,yBAAyB;EACrE,IAAI,UAAU,KAAK,UAAU,MAAM,IAAI,IAAI;EAC3C,IAAI,QAAQ;EACZ,KAAK,MAAM,SAAS,SAAS,SAAS;GACpC,MAAM,SAAS,KAAK,UAAU,UAAU,IAAI,IAAI;GAChD,MAAM,aAAa,KAAK,UAAU,SAAS,IAAI,IAAI;GACnD,MAAM,cAAc,KAAK,UAAU,SAAS,IAAI,IAAI;GACpD,MAAM,QAAQ,SAAS,KAAK,aAAa;GACzC,MAAM,aAAa,MAAM,SAAS,OAAO,QAAQ,MAAM,cAAc;GACrE,MAAM,SAAuB,CAAC;GAC9B,IAAI,OAAO;GACX,MAAM,UAAU,UAAsB;IACpC,QAAQ,MAAM;IACd,SAAS,MAAM;IACf,WAAW,MAAM,iBAAiB,MAAM;IACxC,WAAW,OAAO,iBAAiB,MAAM;IAGzC,IACE,OAAO,OAAO,8BACd,OAAO,KAAK,IAAI,GAAG,MAAM,cAAc,IAAI,OAAO,qBAElD,MAAM,IAAI,iBACR,kBACA,wCACA,qBACF;IACF,IAAI,OAAO,MAAM,MACf,MAAM,IAAI,iBACR,eACA,0CACF;IACF,OAAO,KAAK,KAAK;GACnB;GACA,IAAI,MAAM,sBAAsB,GAAG,OAAO,UAAU;QAC/C;IACH,MAAM,WAAW,IAAI,QAAQ,MAAM;IAEnC,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK,KAC1C,SAAS,KACP,WAAW,SAAS,GAAG,IAAI,GAAG,GAC9B,IAAI,OAAO,WAAW,MACxB;IACF,IAAI,WAAW,WAAW,GACxB,MAAM,IAAI,iBAAiB,eAAe,uBAAuB;GACrE;GACA,IAAI,SAAS,MAAM,MACjB,MAAM,IAAI,iBACR,eACA,0CACF;GACF,MAAM,OAAO,IAAI,WAAW,IAAI;GAChC,IAAI,IAAI;GACR,KAAK,MAAM,SAAS,QAAQ;IAC1B,KAAK,IAAI,OAAO,CAAC;IACjB,KAAK,MAAM;GACb;GAEA,IAAI,MAAM,IAAI,MAAM,KAAK,UAAU,UAAU,IAAI,IAAI,GACnD,MAAM,IAAI,iBAAiB,eAAe,wBAAwB;GACpE,OAAO,IAAI,MAAM,MAAM,IAAI;GAC3B,WACE,KACA,KAAK,UAAU,UAAU,IAAI,IAAI,IACjC,KAAK,UAAU,UAAU,IAAI,IAAI,IACjC,KAAK,UAAU,UAAU,IAAI,IAAI;EACrC;EACA,OAAO;CACT,SAAS,OAAO;EACd,IAAI,iBAAiB,kBAAkB,MAAM;EAC7C,IAAI,iBAAiB,kBASnB,MAAM,IAAI,iBAPR,MAAM,SAAS,uBACX,mBACA,MAAM,SAAS,qBACb,eACA,MAAM,SAAS,4BACb,oBACA,eAGR,2CACF;EAEF,MAAM,IAAI,iBAAiB,eAAe,sBAAsB;CAClE;AACF;AACA,SAAS,MAAM,MAA0B;CACvC,IAAI,MAAM;CACV,KAAK,MAAM,QAAQ,MAAM;EACvB,OAAO;EACP,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,OACzB,MAAO,QAAQ,KAAM,MAAM,IAAI,aAAa;CAChD;CACA,QAAQ,MAAM,gBAAgB;AAChC;;;ACzGA,IAAM,QAAQ,MAAe,SAC3B,KAAK,MAAM,SACX,OAAO,QAAQ,KAAK,KAAK,CAAC,CAAC,MACxB,CAAC,SAAS,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,MAAM,IACtC,CAAC,GAAG;AACN,IAAM,UAAU,OAA2B,WAAW,MAAc;CAClE,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,IACE,CAAC,8CAA8C,KAAK,MAAM,KAAK,CAAC,KAChE,CAAC,OAAO,SAAS,OAAO,KAAK,CAAC,GAE9B,QAAQ,iCAAiC;CAC3C,OAAO,OAAO,KAAK;AACrB;AACA,SAAS,QAAQ,OAA2B,WAAW,GAAW;CAChE,MAAM,IAAI,OAAO,OAAO,QAAQ;CAChC,IAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,GAAG,QAAQ,yBAAyB;CACxE,OAAO;AACT;AACA,SAAS,WAAW,MAAc,QAAwB;CACxD,IAAI,YAAY,KAAK,MAAM,GAAG,QAAQ,+BAA+B;CACrE,MAAM,SAAS,OAAO,WAAW,GAAG,IAAI,CAAC,IAAI,KAAK,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,EAAE;CACxE,KAAK,MAAM,QAAQ,OAAO,MAAM,GAAG,GACjC,IAAI,SAAS,MAAM;EACjB,IAAI,CAAC,OAAO,QAAQ,QAAQ,+BAA+B;EAC3D,OAAO,IAAI;CACb,OAAO,IAAI,QAAQ,SAAS,KAAK,OAAO,KAAK,IAAI;CAEnD,OAAO,OAAO,KAAK,GAAG;AACxB;AACA,SAAS,WAAW,OAAe,QAAkC;CACnE,MAAM,SAAS,MAAM,KAAK;CAC1B,WAAW,OAAO,IAAI,KAAK,WAAW,MAAM;CAC5C,WAAW,OAAO,IAAI,KAAK,cAAc,MAAM;CAC/C,OAAO;AACT;AAEA,SAAgB,SACd,OACA,QACU;CACV,MAAM,QAAQ,aAAa,OAAO,MAAM;CACxC,MAAM,OAAO,IAAI,WAAW,OAAO,aAAa,aAAa;CAC7D,MAAM,UAAU,IAAI,eAAe,SAAS,MAAM,KAAK,MAAM,CAAC,CAAC;CAC/D,MAAM,iCAAiB,IAAI,IAAoB;CAC/C,MAAM,6BAAa,IAAI,IAAY;CACnC,MAAM,iCAAiB,IAAI,IAAY;CACvC,IAAI,aAAa;CACjB,IAAI,aAAa;CACjB,IAAI,kBAAkB;CACtB,IAAI,uBAAuB;CAC3B,MAAM,2BAAW,IAAI,IAAqB;CAC1C,MAAM,OAAO,SAA0B;EACrC,KAAK,MAAM;EACX,MAAM,SAAS,eAAe,IAAI,IAAI,KAAK,KAAK;EAChD,eAAe,IAAI,MAAM,KAAK;EAC9B,WAAW,OAAO,qBAAqB,MAAM;EAC7C,MAAM,WAAW,SAAS,IAAI,IAAI;EAClC,IAAI,UAAU,OAAO;EACrB,MAAM,OAAO,MAAM,IAAI,IAAI;EAC3B,IAAI,CAAC,MAAM,QAAQ,wBAAwB;EAC3C,MAAM,SAAS,SAAS,MAAM,cAAc,KAAK,MAAM,CAAC,CAAC;EACzD,SAAS,IAAI,MAAM,MAAM;EACzB,OAAO;CACT;CACA,MAAM,iBAAiB,SAA4C;EACjE,MAAM,QAAQ,KAAK,MAAM,GAAG;EAC5B,MAAM,OAAO,MAAM,IAAI,KAAK;EAC5B,MAAM,UAAU;GAAC,GAAG;GAAO;GAAS,GAAG,KAAK;EAAM,CAAC,CAAC,KAAK,GAAG;EAC5D,IAAI,CAAC,MAAM,IAAI,OAAO,GAAG,uBAAO,IAAI,IAAI;EACxC,MAAM,MAAM,IAAI,OAAO;EACvB,IAAI,IAAI,SAAS,iBAAiB,QAAQ;EAC1C,MAAM,uBAAO,IAAI,IAA0B;EAC3C,KAAK,MAAM,QAAQ,SAAS,KAAK,cAAc,GAAG;GAChD,KAAK,OAAO,KAAK,MAAM,QAAQ,UAAU,KAAK,CAAC;GAC/C,IAAI,KAAK,MAAM,eAAe,YAAY;GAC1C,MAAM,KAAK,KAAK,MAAM;GACtB,MAAM,SAAS,KAAK,MAAM;GAC1B,MAAM,OAAO,KAAK,MAAM;GACxB,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,KAAK,IAAI,EAAE,GAAG,QAAQ;GACrD,KAAK,IAAI,IAAI;IAAE,QAAQ,WAAW,MAAM,MAAM;IAAG;GAAK,CAAC;EACzD;EACA,OAAO;CACT;CAEA,MAAM,eAAe,CAAC,GADL,cAAc,EACN,CAAA,CAAS,OAAO,CAAC,CAAC,CAAC,MAAM,MAChD,EAAE,KAAK,SAAS,iBAAiB,CACnC,CAAC,EAAE;CACH,IAAI,CAAC,cAAc,QAAQ,gCAAgC;CAC3D,MAAM,QAAQ,IAAI,YAAY;CAC9B,IAAI,MAAM,SAAS,YAAY,QAAQ;CACvC,MAAM,OAAO,cAAc,YAAY;CACvC,WACE,MAAM,OAAO,cAAc,CAAC,EAAE,SAAS,UAAU,GACjD,mBACA,MACF;CACA,MAAM,QAAQ,WACZ,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,MAAM,MAAM,EAAE,KAAK,SAAS,IAAI,QAAQ,CAAC,CAAC,EAAE;CACjE,MAAM,aAAa,CAAC,KAAK,MAAM,CAAC,CAAC,SAC/B,MAAM,OAAO,YAAY,CAAC,EAAE,MAAM,YAAY,EAChD,IACI,OACA;CACJ,MAAM,WAAqB;EACzB,QAAQ,CAAC;EACT,cAAc,CAAC;EACf;EACA,QAAQ,EAAE,QAAQ,OAAO;CAC3B;CACA,MAAM,UAAoB,CAAC;CAC3B,MAAM,cAAc,KAAK,eAAe;CACxC,IAAI,aAAa;EACf,MAAM,MAAM,IAAI,WAAW;EAC3B,IAAI,IAAI,SAAS,OAAO,QAAQ;EAChC,KAAK,MAAM,MAAM,SAAS,KAAK,IAAI,GAAG;GACpC,WAAW,QAAQ,SAAS,GAAG,oBAAoB,MAAM;GACzD,QAAQ,KAAK,SAAS,EAAE,CAAC;EAC3B;CACF;CACA,MAAM,UAAU,EAAE,GAAG,gBAAgB;CACrC,MAAM,SAAmB,CAAC;CAC1B,MAAM,aAAa,KAAK,QAAQ;CAChC,IAAI,YAAY;EACd,MAAM,MAAM,IAAI,UAAU;EAC1B,IAAI,IAAI,SAAS,cAAc,QAAQ;EACvC,KAAK,MAAM,QAAQ,MAAM,KAAK,SAAS,CAAC,EAAE,YAAY,CAAC,GACrD,IAAI,KAAK,SAAS,UAChB,QAAQ,QAAQ,KAAK,MAAM,QAAQ,KACjC,KAAK,MAAM,cAAc;EAE/B,KAAK,MAAM,QAAQ,MAAM,KAAK,SAAS,CAAC,EAAE,YAAY,CAAC,GACrD,IAAI,KAAK,SAAS,MAChB,OAAO,KAAK,QAAQ,QAAQ,KAAK,MAAM,QAAQ,MAAM,SAAS;CACpE;CACA,MAAM,8BAAc,IAAI,IAA2C;CACnE,IAAI,YAAY;CAChB,MAAM,aAAa,MAAM,OAAO,QAAQ,CAAC,EAAE,YAAY,CAAC;CACxD,WAAW,WAAW,QAAQ,aAAa,MAAM;CACjD,MAAM,wBAAQ,IAAI,IAAY;CAC9B,KAAK,MAAM,aAAa,YAAY;EAClC,IAAI,UAAU,SAAS,SAAS;EAChC,MAAM,OAAO,UAAU,MAAM;EAC7B,IAAI,CAAC,QAAQ,MAAM,IAAI,KAAK,YAAY,CAAC,GACvC,QAAQ,kCAAkC;EAC5C,MAAM,IAAI,KAAK,YAAY,CAAC;EAC5B,MAAM,MAAM,KAAK,IAAI,KAAK,WAAW,IAAI,KAAK,EAAE;EAChD,IAAI,CAAC,KAAK,KAAK,SAAS,YAAY,GAClC,QAAQ,iCAAiC;EAC3C,MAAM,MAAM,IAAI,IAAI,MAAM;EAC1B,IAAI,eAAe,IAAI,IAAI,MAAM,GAAG,QAAQ,0BAA0B;EACtE,eAAe,IAAI,IAAI,MAAM;EAC7B,IAAI,IAAI,SAAS,aAAa,QAAQ;EACtC,MAAM,QAAQ,YAAY,IAAI;EAC9B,SAAS,OAAO,KAAK,KAAK;EAC1B,MAAM,QAAQ,UAAU,MAAM,SAAS;EACvC,IAAI,UAAU,aAAa,UAAU,YAAY,UAAU,cACzD,QAAQ,0BAA0B;EACpC,MAAM,QAAQ;EACd,MAAM,YAAY,MAAM,KAAK,WAAW,CAAC,EAAE,MAAM;EACjD,IAAI,WAAW,MAAM,YAAY,WAAW,WAAW,MAAM;EAC7D,MAAM,OAAO,MAAM,MAAM,KAAK,YAAY,CAAC,EAAE,SAAS,MAAM,KAAK,MAAM;EACvE,IAAI,QAAQ,CAAC,UAAU,aAAa,CAAC,CAAC,SAAS,KAAK,MAAM,KAAK,GAAG;GAChE,MAAM,SAAS;IACb,MAAM,QAAQ,KAAK,MAAM,MAAM;IAC/B,MAAM,QAAQ,KAAK,MAAM,MAAM;GACjC;GACA,WAAW,MAAM,OAAO,MAAM,WAAW,MAAM;GAC/C,WAAW,MAAM,OAAO,MAAM,cAAc,MAAM;EACpD;EACA,MAAM,SAAiC,CAAC;EACxC,IAAI,YAAY;EAChB,KAAK,MAAM,OAAO,MAAM,KAAK,MAAM,CAAC,EAAE,YAAY,CAAC,GAAG;GACpD,MAAM,MAAM,QAAQ,IAAI,MAAM,GAAG;GACjC,MAAM,MAAM,QAAQ,IAAI,MAAM,GAAG;GACjC,IAAI,MAAM,KAAK,MAAM,KAAK,QAAQ;GAClC,WAAW,KAAK,cAAc,MAAM;GACpC,MAAM,QAAQ,OAAO,IAAI,MAAM,KAAK;GACpC,IAAI,QAAQ,GAAG,QAAQ;GACvB,KAAK,MAAM,MAAM,MAAM,CAAC;GACxB,aAAa,MAAM,MAAM;GACzB,WAAW,WAAW,YAAY,MAAM;GACxC,KAAK,IAAI,IAAI,KAAK,KAAK,KAAK,KAAK,OAAO,KAAK;EAC/C;EACA,IAAI,OAAO,KAAK,MAAM,CAAC,CAAC,QAAQ,MAAM,eAAe;EACrD,MAAM,yBAAS,IAAI,IAGjB;EACF,MAAM,YAAyD,CAAC;EAChE,IAAI,WAAW;EACf,KAAK,MAAM,OAAO,MAAM,KAAK,WAAW,CAAC,EAAE,YAAY,CAAC,GAAG;GACzD,IAAI,IAAI,SAAS,OAAO;GACxB,WAAW,QAAQ,IAAI,MAAM,GAAG,WAAW,CAAC;GAC5C,IAAI,WAAW,GAAG,QAAQ;GAC1B,WAAW,UAAU,WAAW,MAAM;GACtC,IAAI,WAAW;GACf,KAAK,MAAM,QAAQ,SAAS,KAAK,GAAG,GAAG;IACrC,KAAK,MAAM;IACX,WAAW,EAAE,WAAW,YAAY,MAAM;IAC1C,MAAM,SAAS,KAAK,MAAM,IACtB,MAAM,KAAK,MAAM,CAAC,IAClB;KAAE,KAAK;KAAU,KAAK,WAAW;IAAE;IACvC,IAAI,OAAO,QAAQ,UACjB,QAAQ,oCAAoC;IAC9C,WAAW,OAAO,KAAK,WAAW,MAAM;IACxC,WAAW,OAAO,KAAK,cAAc,MAAM;IAC3C,WAAW,OAAO;IAClB,IAAI,MAAM,MAAM,IAAI,OAAO,KAAK,OAAO,GAAG,GACxC,QAAQ,4BAA4B;IACtC,MAAM,SAAS,OAAO,QAAQ,KAAK,MAAM,CAAC,MAAM;IAChD,IAAI,OAAO,YAAY,IAAI,MAAM;IACjC,IAAI,CAAC,MAAM;KACT,KAAK,MAAM,OAAO,MAAM;KACxB,OAAO,WAAW,MAAM;KACxB,YAAY,IAAI,QAAQ,IAAI;IAC9B;IACA,MAAM,QAAQ,MAAM,MAAM,GAAG,CAAC,EAAE;IAChC,MAAM,OAAO,KAAK,MAAM;IACxB,IACE,SAAS,KAAA,KACT,CAAC;KAAC;KAAa;KAAK;KAAO;KAAK;KAAK;KAAK;IAAG,CAAC,CAAC,SAAS,IAAI,GAE5D,QAAQ,wBAAwB;IAClC,IAAI,OAAa;KACf,MAAM;KACN,OAAO;KACP,cAAc;KACd,YAAY;IACd;IACA,IAAI,SAAS,aACX,OAAO;KACL,GAAG;KACH,OAAO,MAAM,MAAM,IAAI,IACnB,SAAS,MAAM,MAAM,IAAI,CAAY,IACrC;KACJ,MAAM;IACR;SACG,IAAI,SAAS,KAAK;KACrB,MAAM,QAAQ,QAAQ,KAAK;KAC3B,IAAI,UAAU,KAAA,KAAa,SAAS,QAAQ,QAC1C,QAAQ,8BAA8B;KACxC,KAAK,QAAQ,QAAQ;KACrB,KAAK,OAAO;IACd,OAAO,IAAI,SAAS,OAAO;KACzB,KAAK,QAAQ,gBAAgB,SAAS,EAAE;KACxC,KAAK,OAAO;IACd,OAAO,IAAI,SAAS,KAAK;KACvB,KAAK,QAAQ,SAAS;KACtB,KAAK,QAAQ;KACb,KAAK,OAAO;IACd,OAAO,IAAI,SAAS,OAAO,UAAU,KAAA,GAAW;KAC9C,IAAI,CAAC;MAAC;MAAK;MAAK;MAAQ;KAAO,CAAC,CAAC,SAAS,KAAK,GAC7C,QAAQ,uBAAuB;KACjC,KAAK,QAAQ,UAAU,OAAO,UAAU;KACxC,KAAK,OAAO;IACd,OAAO,IAAI,SAAS,OAAO,UAAU,KAAA,GAAW;KAC9C,MAAM,OAAO,IAAI,KAAK,KAAK;KAC3B,IAAI,CAAC,OAAO,SAAS,KAAK,QAAQ,CAAC,GAAG,QAAQ,oBAAoB;KAClE,KAAK,QAAQ;KACb,KAAK,OAAO;IACd,OAAO,IAAI,UAAU,KAAA,KAAa,UAAU,IAAI;KAC9C,IAAI,QAAQ,SAAS,KAAK,QAAQ,wBAAwB;KAC1D,MAAM,IAAI,OAAO,KAAK;KACtB,IAAI;MAAC;MAAQ;MAAQ;KAAU,CAAC,CAAC,SAAS,IAAI,GAAG;MAC/C,KAAK,QAAQ,WAAW,GAAG,UAAU;MACrC,KAAK,MAAM;MACX,KAAK,OAAO;MACZ,IAAI,CAAC,OAAO,SAAS,KAAK,MAAM,QAAQ,CAAC,GACvC,QAAQ,sCAAsC;KAClD,OAAO;MACL,KAAK,QAAQ;MACb,KAAK,OAAO;KACd;IACF;IACA,MAAM,IAAI,MAAM,MAAM,GAAG;IACzB,IAAI,GAAG;KACL,WAAW,EAAE,KAAK,QAAQ,oBAAoB,MAAM;KACpD,IAAI,EAAE,MAAM,MAAM,UAAU;MAC1B,IAAI,EAAE,MAAM,OAAO,KAAA,GACjB,QAAQ,+BAA+B;MACzC,MAAM,KAAK,QAAQ,EAAE,MAAM,EAAE;MAC7B,IAAI,EAAE,MAAM;OACV,IAAI,OAAO,IAAI,EAAE,KAAK,CAAC,EAAE,MAAM,KAC7B,QAAQ,gCAAgC;OAC1C,OAAO,IAAI,IAAI;QACb,MAAM,EAAE;QACR;QACA,OAAO,WAAW,EAAE,MAAM,KAAK,MAAM;OACvC,CAAC;OACD,KAAK,UAAU,aAAa,EAAE,MAAM,QAAQ,OAAO;MACrD,OAAO,UAAU,KAAK;OAAE;OAAM;OAAQ;MAAG,CAAC;KAC5C,OAAO;MACL,KAAK,UAAU,aAAa,EAAE,MAAM,QAAQ,OAAO;MACnD,IAAI,EAAE,MAAM,MAAM,WAAW,EAAE,MAAM,KACnC,KAAK,QAAQ,aAAa,WAAW,EAAE,MAAM,KAAK,MAAM;KAC5D;IACF;IACA,MAAM,MAAM,IAAI,OAAO,KAAK,OAAO,KAAK,IAAI;GAC9C;EACF;EACA,KAAK,MAAM,YAAY,WAAW;GAChC,MAAM,SAAS,OAAO,IAAI,SAAS,EAAE;GACrC,IAAI,CAAC,QAAQ,QAAQ,gCAAgC;GACrD,MAAM,IAAI,SAAS;GACnB,MAAM,IAAI,OAAO;GACjB,IACE,EAAE,MAAM,EAAE,MAAM,OAChB,EAAE,MAAM,EAAE,IAAI,OACd,EAAE,MAAM,EAAE,MAAM,OAChB,EAAE,MAAM,EAAE,IAAI,KAEd,QAAQ,sCAAsC;GAChD,SAAS,KAAK,UAAU,iBACtB,OAAO,MACP,OAAO,QACP,GACA,QACA,OACF;EACF;EACA,KAAK,MAAM,SAAS,MAAM,KAAK,YAAY,CAAC,EAAE,YAAY,CAAC,GAAG;GAC5D,WAAW,EAAE,YAAY,aAAa,MAAM;GAC5C,KAAK,MAAM;GACX,MAAM,OAAO,KAAK,WAAW,MAAM,MAAM,OAAO,IAAI,MAAM,CAAC;EAC7D;EACA,KAAK,MAAM,QAAQ,MAAM,KAAK,iBAAiB,CAAC,EAAE,YAAY,CAAC,GAAG;GAChE,WAAW,EAAE,iBAAiB,sBAAsB,MAAM;GAC1D,KAAK,OAAO,KAAK,MAAM,OAAO,UAAU,KAAK,CAAC;GAC9C,MAAM,OAAO,KAAK,MAAM;GACxB,IACE,CAAC;IAAC;IAAQ;IAAS;IAAW;IAAQ;IAAc;GAAQ,CAAC,CAAC,SAC5D,IACF,GAEA;GACF,MAAM,cAAc,KAAK,MAAM,SAAS,GAAA,CAAI,KAAK,CAAC,CAAC,MAAM,KAAK;GAC9D,wBAAwB,WAAW;GACnC,WAAW,sBAAsB,sBAAsB,MAAM;GAC7D,MAAM,aAA6B;IACjC,QAAQ,WAAW,KAAK,MAAM,WAAW,GAAG,MAAM,CAAC;IAC7C;GACR;GACA,MAAM,UAAU,MAAM,MAAM,UAAU,CAAC,EAAE;GACzC,IAAI,YAAY,KAAA,GAAW;IACzB,WAAW,QAAQ,QAAQ,oBAAoB,MAAM;IACrD,WAAW,UAAU;IACrB,IAAI,SAAS,UAAU,UAAU,KAAK,OAAO,GAC3C,WAAW,SAAS,QACjB,MAAM,GAAG,EAAE,CAAC,CACZ,QAAQ,OAAO,IAAG,CAAC,CACnB,MAAM,GAAG;SACT,WAAW,SAAS,gBAAgB,SAAS,OAAO;GAC3D;GACA,MAAM,YAAY,KAAK,UAAU;EACnC;EACA,MAAM,YAAY,cAAc,IAAI,MAAM;EAC1C,KAAK,MAAM,QAAQ,MAAM,KAAK,YAAY,CAAC,EAAE,YAAY,CAAC,GAAG;GAC3D,MAAM,WAAW,UAAU,IAAI,KAAK,MAAM,IAAI,KAAK,EAAE;GACrD,IAAI,CAAC,UAAU,KAAK,SAAS,QAAQ,GACnC,QAAQ,6BAA6B;GACvC,MAAM,QAAQ,IAAI,SAAS,MAAM;GACjC,IAAI,WAAW,IAAI,SAAS,MAAM,GAAG;GACrC,WAAW,IAAI,SAAS,MAAM;GAC9B,WAAW,EAAE,YAAY,aAAa,MAAM;GAC5C,IAAI,MAAM,SAAS,SAAS,QAAQ;GACpC,MAAM,YAAY,MAAM,MAAM,eAAe,MAAM,MAAM;GACzD,IAAI,CAAC,WAAW,QAAQ,qBAAqB;GAC7C,MAAM,aAAa,WAAW,MAAM,MAAM,OAAO,IAAI,MAAM;GAC3D,MAAM,gBAAgB,MAAM,OAAO,cAAc,CAAC,EAAE,YAAY,CAAC,EAAA,CAC9D,QAAQ,MAAM,EAAE,SAAS,aAAa,CAAC,CACvC,KAAK,MAAM,EAAE,MAAM,IAAI;GAC1B,IACE,aAAa,MAAM,SAAS,CAAC,IAAI,KACjC,aAAa,WAAW,WAAW,IAAI,MAAM,WAAW,MAAM,MAAM,GAEpE,QAAQ,wBAAwB;GAClC,MAAM,OAAO,KAAK;IAChB,MAAM;IACN,OAAO;IACP,WAAW,QAAQ,MAAM,MAAM,gBAAgB,CAAC,IAAI;IACpD,WAAW,QAAQ,MAAM,MAAM,cAAc,IAAI;IACjD,SAAS;GACX,CAAC;EACH;CACF;CACA,IAAI,CAAC,SAAS,OAAO,QAAQ,QAAQ,6BAA6B;CAClE,KAAK,MAAM,QAAQ,MAAM,OAAO,cAAc,CAAC,EAAE,YAAY,CAAC,GAAG;EAC/D,IAAI,CAAC,KAAK,MAAM,MAAM,QAAQ,uBAAuB;EACrD,KAAK,MAAM,KAAK,MAAM,KAAK,SAAS,CAAC;EACrC,WAAW,KAAK,KAAK,QAAQ,oBAAoB,MAAM;EACvD,MAAM,QACJ,KAAK,MAAM,iBAAiB,KAAA,IACxB,SAAS,OAAO,QAAQ,KAAK,MAAM,YAAY,EAAE,EAAE,OACnD,KAAA;EACN,IAAI,KAAK,MAAM,iBAAiB,KAAA,KAAa,CAAC,OAC5C,QAAQ,6BAA6B;EACvC,SAAS,aAAa,KAAK;GACzB,MAAM,KAAK,MAAM;GACjB;GACA,MAAM,KAAK;GACX,WAAW,gBAAgB,KAAK,MAAM,OAAO;EAC/C,CAAC;CACH;CACA,MAAM,iBAAiB,IAAI,cAAc,UAAU,QAAQ,UAAU,MACnE,KAAK,MAAM,CAAC,CACd;CACA,KAAK,MAAM,SAAS,SAAS,QAAQ;EACnC,KAAK,MACH,MAAM,MAAM,OACV,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,KAAK,MAAM,MAAM,OAAO,CAAC,CAAC,CAAC,CAC1D;EACA,KAAK,MAAM,CAAC,QAAQ,SAAS,MAAM,OACjC,IAAI,KAAK,SACP,KAAK,QAAQ,aAAa,KAAK,QAAQ,WAAW,KAC/C,MAAM,eAAe,QAAQ,GAAG,MAAM,MAAM,MAAM,KAAK,CAC1D;EACJ,KAAK,MAAM,cAAc,MAAM,aAC7B,IAAI,WAAW,QACb,WAAW,SACT,eAAe,QACb,WAAW,QACX,MAAM,MACN,WAAW,OAAO,EAAE,CAAC,KACvB,KAAK,WAAW;CACxB;CACA,OAAO;AACT;AAEA,SAAS,SAAS,MAAuB;CACvC,OAAO,gBACL,KAAK,SACF,QAAQ,MAAM,EAAE,SAAS,OAAO,EAAE,SAAS,GAAG,CAAC,CAC/C,KAAK,MACJ,EAAE,SAAS,MACP,YAAY,CAAC,IACb,SAAS,GAAG,GAAG,CAAC,CAAC,IAAI,WAAW,CAAC,CAAC,KAAK,EAAE,CAC/C,CAAC,CACA,KAAK,EAAE,CACZ;AACF;AAEA,SAAS,gBAAgB,OAAuB;CAC9C,OAAO,MAAM,QAAQ,uBAAuB,GAAG,QAC7C,OAAO,aAAa,OAAO,SAAS,KAAK,EAAE,CAAC,CAC9C;AACF;;;ACrdA,IAAM,KAAK;AACX,IAAM,QACJ;AACF,IAAM,YAAY;AAElB,SAAgB,UACd,UACA,QACA,SACY;CACZ,iBAAiB,UAAU,MAAM;CACjC,MAAM,QAAoC,OAAO,OAAO,IAAI;CAC5D,IAAI,QAAQ;CACZ,MAAM,OAAO,MAAc,QAAgB;EACzC,MAAM,QAAQ,QAAQ,YAAY,GAAG;EACrC,WAAW,MAAM,QAAQ,iBAAiB,MAAM;EAChD,SAAS,MAAM;EACf,WAAW,OAAO,iBAAiB,MAAM;EACzC,MAAM,QAAQ;EACd,WAAW,OAAO,KAAK,KAAK,CAAC,CAAC,QAAQ,cAAc,MAAM;CAC5D;CACA,MAAM,gBAA0B,CAAC;CACjC,MAAM,SAA8C,CAClD;EAAE,QAAQ;EAAW,MAAM;CAAM,CACnC;CACA,MAAM,6BAAa,IAAI,IAAoB;CAC3C,MAAM,8BAAc,IAAI,IAAoB;CAC5C,MAAM,cAAc,MAAY,SAA0B;EACxD,MAAM,SACJ,KAAK,iBACJ,KAAK,SAAS,SACX,4BACA,KAAK,eAAe,aAClB,cACA,KAAK,eAAe,YAClB,UACA;EACV,MAAM,MAAM,GAAG,KAAK,GAAG;EACvB,MAAM,SAAS,WAAW,IAAI,GAAG;EACjC,IAAI,WAAW,KAAA,GAAW,OAAO;EACjC,MAAM,QAAQ,WAAW,aAAa,CAAC,OAAO,IAAI,OAAO;EACzD,IAAI,OAAO,OAAO,KAAK;GAAE;GAAQ;EAAK,CAAC;EACvC,WAAW,IAAI,KAAK,KAAK;EACzB,IAAI,WAAW,aAAa,CAAC,YAAY,IAAI,MAAM,GAAG;GACpD,YAAY,IAAI,QAAQ,cAAc,MAAM;GAC5C,cAAc,KAAK,MAAM;EAC3B;EACA,OAAO;CACT;CACA,IAAI,UAAU;CACd,KAAK,MAAM,CAAC,OAAO,UAAU,SAAS,OAAO,QAAQ,GAAG;EACtD,MAAM,WAAW,MAAM,MAAM,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ;EACnD,IAAI,OAAO;EACX,KAAK,MAAM,CAAC,KAAK,UAAU,MAAM,MAAM,KAAK,GAAG;GAC7C,IAAI,OAAO;GACX,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO;IAC/B,MAAM,IAAI,WAAW,MAAM,CAAC,CAAC,QAAQ,iBAAiB,QAAQ,QAAQ;IACtE,IAAI,OAAO;IACX,IAAI,QAAQ;IACZ,IAAI,KAAK,SAAS,QAChB,IAAI,KAAK,SAAS;KAChB,OAAO;KACP,QAAQ,MAAM,UAAE,OAAO,KAAK,KAAK,CAAC,CAAC,QAAQ,qBAAqB,MAAM,UAAU,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;IACjG,OAAO;KACL,OAAO;KACP,QAAQ,+BAA+B,UAAE,OAAO,KAAK,KAAK,CAAC,CAAC,QAAQ,qBAAqB,MAAM,UAAU,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;IAC1H;SACK,IAAI,KAAK,SAAS,WAAW;KAClC,OAAO;KACP,QAAQ,MAAM,KAAK,QAAQ,IAAI,EAAE;IACnC,OAAO,IAAI,KAAK,SAAS,SAAS;KAChC,OAAO;KACP,QAAQ,MAAM,UAAE,KAAK,SAAS,SAAS,EAAE;IAC3C,OAAO,IAAI,KAAK,SAAS,UAAU,QAAQ,MAAM,KAAK,MAAM;SACvD,IAAI,KAAK,SAAS,QAAQ;KAC7B,MAAM,OAAO,KAAK;KAElB,MAAM,MACJ,KAAK,QAAQ,KAAA,KACb,OAAO,SAAS,KAAK,GAAG,KACxB,WAAW,KAAK,KAAK,SAAS,UAAU,CAAC,CAAC,QAAQ,MAChD,KAAK,QAAQ,IACX,KAAK,MACL,WAAW,MAAM,SAAS,UAAU;KAC1C,IAAI,KAAK,cAAc,YAAY,MAAM,WAAW;MAClD,OAAO;MACP,QAAQ,MAAM,KAAK,YAAY,EAAE;KACnC,OAAO,QAAQ,MAAM,IAAI;IAC3B;IACA,MAAM,UAAU,KAAK,UACjB,KAAK,KAAK,QAAQ,aAAa,mBAAmB,aAAa,KAAK,QAAQ,UAAU,EAAE,KAAK,GAAG,GAAG,UAAE,KAAK,QAAQ,KAAK,QAAQ,MAAM,EAAE,CAAC,EAAE,QAC1I;IACJ,QAAQ,SAAS,QAAQ;KAAE;KAAK;IAAI,CAAC,EAAE,OAAO,EAAE,GAAG,KAAK,GAAG,UAAU,MAAM;GAC7E;GACA,QAAQ,WAAW,IAAI,IAAI,KAAK;GAChC,WAAW,KAAK,QAAQ,iBAAiB,MAAM;EACjD;EACA,MAAM,SAAS,QAAQ,eACnB,OAAO,YACL,QAAQ,aAAa,KAAK,OAAO,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,CACvD,IACC,MAAM,gBAAgB,CAAC;EAC5B,IAAI,OAAO;EACX,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,GAAG;GACjD,MAAM,MAAM,OAAO,GAAG;GACtB,IACE,CAAC,OAAO,UAAU,GAAG,KACrB,MAAM,KACN,CAAC,OAAO,SAAS,KAAK,KACtB,QAAQ,KACR,QAAQ,KAER,QAAQ,uBAAuB;GACjC,WAAW,KAAK,cAAc,MAAM;GACpC,QAAQ,aAAa,IAAI,SAAS,IAAI,WAAW,MAAM;EACzD;EACA,MAAM,OAAO,MAAM,SACf,2DAA2D,MAAM,OAAO,KAAK,YAAY,MAAM,OAAO,KAAK,iBAAiB,QAAQ;GAAE,KAAK,MAAM,OAAO,OAAO;GAAG,KAAK,MAAM,OAAO,OAAO;EAAE,CAAC,EAAE,+CAChM;EACJ,MAAM,SAAS,MAAM,OAAO,SACxB,sBAAsB,MAAM,OAAO,OAAO,IAAI,MAAM,OAAO,KAAK,MAAM,mBAAmB,aAAa,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,iBACxH;EACJ,MAAM,cAAc,MAAM,YAAY,SAClC,2BAA2B,MAAM,YAAY,OAAO,IAAI,MAAM,YAAY,KAAK,MAAM,yBAAyB,EAAE,KAAK,WAAW,EAAE,OAAO,IAAI,YAAY,CAAC,CAAC,KAAK,GAAG,EAAE,cAAc,UAAE,EAAE,YAAY,EAAE,SAAS,IAAI,EAAE,OAAO,KAAK,GAAG,EAAE,KAAK,GAAG,EAAE,6BAA6B,CAAC,CAAC,KAAK,EAAE,EAAE,sBACvR;EACJ,MAAM,aAAa,MAAM,OAAO,SAC5B,sBAAsB,MAAM,OAAO,OAAO,IAAI,MAAM,OAAO,KAAK,GAAG,MAAM,qBAAqB,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,iBAC/G;EACJ,IACE,sBAAsB,QAAQ,EAAE,OAChC,qBAAqB,GAAG,aAAa,MAAM,IAAI,OAAO,OAAO,SAAS,KAAK,WAAW,GAAG,aAAa,KAAK,cAAc,SAAS,cAAc,WAAW,aAC7J;EACA,IAAI,MAAM,OAAO,QAAQ;GACvB,IACE,4BAA4B,QAAQ,EAAE,YACtC,cACE,MAAM,OAAO,KAAK,GAAG,OAAO;IAC1B,IAAI,IAAI;IACR,MAAM;IACN,QAAQ,kBAAkB,QAAQ,EAAE,GAAG,IAAI,EAAE;GAC/C,EAAE,CACJ,CACF;GACA,KAAK,MAAM,CAAC,GAAG,UAAU,MAAM,OAAO,QAAQ,GAC5C,IACE,kBAAkB,QAAQ,EAAE,GAAG,IAAI,EAAE,OACrC,iBAAiB,GAAG,QAAQ,EAAE,QAAQ,UAAU,UAAE,MAAM,IAAI,EAAE,iBAAiB,UAAE,MAAM,IAAI,EAAE,SAAS,aAAa,MAAM,KAAK,EAAE,oBAAoB,MAAM,YAAY,IAAI,EAAE,oBAAoB,MAAM,YAAY,IAAI,EAAE,yBAAyB,MAAM,QAAQ,OAAO,IAAI,MAAM,QAAQ,KAAK,MAAM,MAAM,oBAAoB,IAAI,EAAE,UAAU,UAAE,IAAI,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,wBACtW;EACJ;CACF;CACA,IACE,iBACA,sBAAsB,GAAG,oBAAoB,cAAc,OAAO,IAAI,cAAc,KAAK,QAAQ,MAAM,qBAAqB,MAAM,EAAE,gBAAgB,UAAE,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,mZAAmZ,OAAO,OAAO,IAAI,OAAO,KAAK,MAAM,iBAAiB,EAAE,WAAW,YAAY,IAAI,OAAO,YAAY,IAAI,EAAE,MAAM,KAAK,GAAG,YAAY,EAAE,OAAO,IAAI,EAAE,0DAA0D,EAAE,OAAO,qBAAmB,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,4GAC7zB;CACA,MAAM,UAAU,SAAS,aACtB,KAAK,MAAM;EACV,MAAM,QACJ,EAAE,UAAU,KAAA,IACR,KACA,SAAS,OAAO,WAAW,MAAM,EAAE,SAAS,EAAE,KAAK;EACzD,IAAI,EAAE,UAAU,KAAA,KAAa,QAAQ,GACnC,QAAQ,6BAA6B;EACvC,OAAO,sBAAsB,UAAE,EAAE,IAAI,EAAE,GAAG,QAAQ,IAAI,KAAK,kBAAkB,MAAM,GAAG,GAAG,UAAE,EAAE,IAAI,EAAE;CACrG,CAAC,CAAC,CACD,KAAK,EAAE;CACV,IACE,mBACA,oBAAoB,GAAG,aAAa,MAAM,0BAA0B,SAAS,eAAe,OAAO,IAAI,EAAE,aAAa,SAAS,OAAO,KAAK,GAAG,MAAM,gBAAgB,UAAE,EAAE,IAAI,EAAE,aAAa,IAAI,EAAE,WAAW,EAAE,MAAM,WAAW,IAAI,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,WAAW,UAAU,iBAAiB,QAAQ,mBAAmB,GAAG,wCAC1T;CACA,IACE,eACA,cAAc,CACZ;EAAE,IAAI;EAAU,MAAM;EAAkB,QAAQ;CAAkB,CACpE,CAAC,CACH;CACA,IACE,8BACA,cAAc,CACZ,GAAG,SAAS,OAAO,KAAK,GAAG,OAAO;EAChC,IAAI,IAAI,IAAI;EACZ,MAAM;EACN,QAAQ,mBAAmB,IAAI,EAAE;CACnC,EAAE,GACF;EAAE,IAAI;EAAU,MAAM;EAAU,QAAQ;CAAa,CACvD,CAAC,CACH;CACA,IACE,uBACA,meAAme,OAAO,KACxe,KACF,CAAC,CACE,QAAQ,MAAM,wCAAwC,KAAK,CAAC,CAAC,CAAC,CAC9D,KACE,MACC,wBAAwB,EAAE,6EAA6E,EAAE,WAAW,YAAY,IAAI,UAAU,YAAY,QAC9J,CAAC,CACA,KAAK,EAAE,EAAE,SACd;CACA,MAAM,SAAS,QAAQ,KAAK;CAC5B,WAAW,OAAO,QAAQ,iBAAiB,MAAM;CACjD,OAAO;AACT;AACA,SAAS,cACP,QACQ;CACR,OAAO,uFAAuF,OAAO,KAAK,MAAM,qBAAqB,EAAE,GAAG,UAAU,MAAM,GAAG,EAAE,KAAK,YAAY,UAAE,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE;AAC7M;;;AC7HA,IAAM,YAAY,UAChB,iBAAiB,OACb,QAAQ,MAAM,YAAY,MAC1B,GAAG,OAAO,MAAM,GAAG,OAAO,KAAK;AACrC,IAAM,YAAY,SAChB,KAAK,UAAU,QAAQ,KAAK,UAAU,MAAM,KAAK,SAAS;AAC5D,IAAM,qBAA+C;CACnD,MAAM;CACN,QAAQ;CACR,SAAS;CACT,MAAM;CACN,OAAO;CACP,OAAO;AACT;AACA,IAAM,QAAQ,QAAuB,YAAgC;CACnE,QAAQ,OAAO;CACf;AACF;AACA,IAAM,WAAW,UAAsB,GAAG,MAAM,OAAO,GAAG,MAAM;;AAGhE,SAAS,OAAO,OAA2B,MAA2B;CACpE,MAAM,UAAU,IAAI,IAAI,KAAK;CAC7B,MAAM,SAAkB,CAAC;CACzB,KAAK,MAAM,SAAS,MAAM,OAAO,GAAG;EAClC,KAAK,MAAM;EACX,IAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,CAAC,GAAG;EAClC,MAAM,QAAQ,CAAC,KAAK;EACpB,QAAQ,OAAO,QAAQ,KAAK,CAAC;EAC7B,MAAM,QAAQ,EAAE,GAAG,MAAM;EACzB,MAAM,MAAM,EAAE,GAAG,MAAM;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,KAAK,MAAM,CAAC;GACZ,MAAM,IAAI,MAAM;GAChB,MAAM,MAAM,KAAK,IAAI,MAAM,KAAK,EAAE,GAAG;GACrC,MAAM,MAAM,KAAK,IAAI,MAAM,KAAK,EAAE,GAAG;GACrC,IAAI,MAAM,KAAK,IAAI,IAAI,KAAK,EAAE,GAAG;GACjC,IAAI,MAAM,KAAK,IAAI,IAAI,KAAK,EAAE,GAAG;GACjC,KAAK,MAAM,KAAK;IACd;KAAE,KAAK,EAAE,MAAM;KAAG,KAAK,EAAE;IAAI;IAC7B;KAAE,KAAK,EAAE,MAAM;KAAG,KAAK,EAAE;IAAI;IAC7B;KAAE,KAAK,EAAE;KAAK,KAAK,EAAE,MAAM;IAAE;IAC7B;KAAE,KAAK,EAAE;KAAK,KAAK,EAAE,MAAM;IAAE;GAC/B,GAAG;IACD,IAAI,EAAE,MAAM,KAAK,EAAE,MAAM,WAAW,EAAE,MAAM,KAAK,EAAE,MAAM,OACvD;IACF,MAAM,MAAM,QAAQ,CAAC;IACrB,IAAI,QAAQ,IAAI,GAAG,GAAG;KACpB,QAAQ,OAAO,GAAG;KAClB,MAAM,KAAK,CAAC;IACd;GACF;EACF;EACA,OAAO,KAAK;GAAE;GAAO;EAAI,CAAC;CAC5B;CACA,OAAO,OAAO,MAAM,GAAG,MAAM;EAC3B,KAAK,MAAM;EACX,OAAO,EAAE,MAAM,MAAM,EAAE,MAAM,OAAO,EAAE,MAAM,MAAM,EAAE,MAAM;CAC5D,CAAC;AACH;AAEA,SAAgB,gBACd,UACA,UAA0B,CAAC,GACV;CACjB,MAAM,OAAO;EACX,gBAAgB,MAAM;EACtB,kBAAkB;EAClB,YAAY;EACZ,iBAAiB;EACjB,gBAAgB;EAChB,qBAAqB,IAAI;EACzB,GAAG,OAAO,YACR,OAAO,QAAQ,OAAO,CAAC,CAAC,QAAQ,GAAG,WAAW,UAAU,KAAA,CAAS,CACnE;CACF;CACA,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,IAAI,GAC5C,IACE,QAAQ,qBACJ,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,KAAK,QAAQ,IAChD,CAAC,OAAO,cAAc,KAAK,KAAK,SAAS,GAE7C,MAAM,IAAI,iBAAiB,iBAAiB,0BAA0B;CAE1E,MAAM,OAAO,IAAI,WAAW,KAAK,cAAc;CAC/C,MAAM,SAAS,cAAc,OAAO;CACpC,MAAM,UAAU,IAAI,eAAe,SAAS,MAAM,KAAK,MAAM,CAAC,CAAC;CAC/D,MAAM,iBAAiB,IAAI,cAAc,UAAU,QAAQ,UAAU,MACnE,KAAK,MAAM,CAAC,CACd;CACA,MAAM,iCAAiB,IAAI,IAAiD;CAC5E,MAAM,UAA2B;EAC/B,QAAQ,CAAC;EACT,cAAc,CAAC;EACf,SAAS,CAAC;EACV,YAAY,CAAC;EACb,UAAU,CAAC;CACb;CACA,MAAM,2BAAW,IAAI,IAAyB;CAC9C,IAAI,SAAS;CACb,IAAI,SAAS;CACb,MAAM,WAAW,QAAgB,QAAgB;EAC/C,IAAI,SAAS,KACX,MAAM,IAAI,iBACR,kBACA,uCACF;CACJ;CACA,KAAK,MAAM,SAAS,SAAS,QAAQ;EACnC,QAAQ,SAAS,MAAM,MAAM,MAAM,KAAK,eAAe;EAEvD,KAAK,MACH,MAAM,MAAM,OACV,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,KAAK,MAAM,MAAM,OAAO,CAAC,CAAC,CAAC,CAC1D;EACA,MAAM,UAAU,CAAC,GAAG,MAAM,KAAK;EAC/B,eAAe,IAAI,OAAO,OAAO;EACjC,MAAM,2BAAW,IAAI,IAAmB;EACxC,KAAK,MAAM,CAAC,GAAG,SAAS,SAAS;GAC/B,KAAK,MAAM;GACX,QAAQ,EAAE,QAAQ,KAAK,eAAe;GACtC,IAAI,SAAS,IAAI,KAAK,KAAK,WAAW,KAAK,SAAS,SAClD,SAAS,IAAI,QAAQ,CAAC,GAAG,CAAC;EAC9B;EACA,MAAM,UAA2B,CAAC;EAClC,KAAK,MAAM,CAAC,OAAO,UAAU,OAAO,UAAU,IAAI,CAAC,CAAC,QAAQ,GAAG;GAC7D,WACG,MAAM,IAAI,MAAM,MAAM,MAAM,MAAM,MAClC,MAAM,IAAI,MAAM,MAAM,MAAM,MAAM;GACrC,QAAQ,QAAQ,KAAK,eAAe;GACpC,MAAM,SAAwB;IAC5B,IAAI,GAAG,MAAM,KAAK,GAAG,QAAQ,MAAM,KAAK,EAAE,GAAG,QAAQ,MAAM,GAAG,EAAE,GAAG,QAAQ;IAC3E,OAAO,MAAM;IACb;IACA,qBAAqB,CAAC;IACtB,YAAY,CAAC;IACb,SAAS,CAAC;GACZ;GACA,MAAM,QAAQ,MAAM,IAAI,MAAM,MAAM,MAAM,MAAM;GAChD,KACE,IAAI,MAAM,MAAM,MAAM,KACtB,OAAO,KAAK,IAAI,MAAM,MAAM,MAAM,GAAG,MAAM,IAAI,MAAM,CAAC,GACtD,OACA;IACA,IAAI,UAAU;IACd,KAAK,IAAI,MAAM,MAAM,MAAM,KAAK,OAAO,MAAM,IAAI,KAAK,OAAO;KAC3D,KAAK,MAAM;KACX,MAAM,OAAO,MAAM,MAAM,IAAI,KAAK,GAAG;KACrC,IAAI,MAAM,SAAS,UAAU,SAAS,IAAI,KAAK,CAAC,KAAK,SACnD;IACJ;IACA,IAAI,WAAW,KAAK,KAAK,QAAQ,EAAG,GAClC,OAAO,oBAAoB,KAAK,GAAG;GACvC;GAEA,KAAK,IAAI,MAAM,MAAM,IAAI,KAAK,MAAM,MAAM,MAAM,KAAK,OAAO;IAC1D,IAAI,SAAS;IACb,KAAK,IAAI,MAAM,MAAM,MAAM,KAAK,OAAO,MAAM,IAAI,KAAK,OAAO;KAC3D,KAAK,MAAM;KACX,MAAM,UAAU,MAAM,MAAM,IAAI,KAAK,GAAG,CAAC,EAAE;KAC3C,IAAI,SACF,KAAK,MAAM,QAAQ,UAAU,SAAS,QAAQ,WAAW,MAAM;KACjE,IACE,SAAS,UAAU,MAAM,MACvB;MAAC;MAAO;MAAY;KAAW,CAAC,CAAC,SAAS,CAAC,CAC7C,KACA,QAAQ,WAAW,MAChB,MACC,CAAC,EAAE,SACF,CAAC,EAAE,SAAS,EAAE,UAAU,MAAM,SAC/B,EAAE,MAAM,MAAM,OAAO,MAAM,MAAM,OACjC,EAAE,MAAM,IAAI,MAAM,OAClB,EAAE,MAAM,MAAM,OAAO,MAAM,MAAM,OACjC,EAAE,MAAM,IAAI,OAAO,MAAM,IAAI,GACjC,GAEA,SAAS;IACb;IACA,IAAI,CAAC,QAAQ;IACb,OAAO,WAAW,KAAK,GAAG;GAC5B;GACA,OAAO,WAAW,QAAQ;GAC1B,MAAM,aAAa,IAAI,IAAI,OAAO,UAAU;GAC5C,MAAM,SAAS,OAAO,oBAAoB;GAC1C,KAAK,IAAI,MAAM,MAAM,MAAM,KAAK,OAAO,MAAM,IAAI,KAAK,OAAO;IAC3D,MAAM,cACJ,WAAW,KAAA,IACP,KAAA,IACA,MAAM,MAAM,IAAI,QAAQ,GAAG,CAAC,EAAE;IACpC,KAAK,MACH,OAAO,gBAAgB,WAAW,YAAY,SAAS,IAAI,CAC7D;IACA,MAAM,SAAwB;KAC5B,IAAI,GAAG,OAAO,GAAG,GAAG;KACpB,QAAQ;KACR,QACE,WAAW,KAAA,IACP,KAAA,IACA,OAAO,MAAM,MAAM,IAAI,QAAQ,GAAG,CAAC,EAAE,SAAS,EAAE;KACtD,YAAY,YAAY;KACxB,YAAY;KACZ,eAAe;KACf,YAAY;KACZ,SAAS,CAAC;KACV,eAAe;KACf,iBAAiB,CAAC;IACpB;IACA,MAAM,yBAAS,IAAI,IAAY;IAC/B,MAAM,0BAAU,IAAI,IAAwB;IAC5C,MAAM,2BAAW,IAAI,IAAoB;IACzC,IAAI,QAAQ;IACZ,IAAI;IACJ,IAAI,eAAe;IACnB,KAAK,IAAI,MAAM,MAAM,MAAM,KAAK,OAAO,MAAM,IAAI,KAAK,OAAO;KAC3D,KAAK,MAAM;KACX,IAAI,QAAQ,UAAU,WAAW,IAAI,GAAG,GAAG;KAC3C,KAAK,MAAM;KACX,MAAM,OAAO,MAAM,MAAM,IAAI,KAAK,GAAG;KACrC,OAAO,WAAW,MAAM,QAAQ,QAAQ;KACxC,IAAI,CAAC,QAAS,CAAC,SAAS,IAAI,KAAK,KAAK,SAAS,SAC7C,OAAO;UACJ;MACH;MACA,KAAK,MACH,OAAO,KAAK,UAAU,WAAW,KAAK,MAAM,SAAS,IAAI,CAC3D;MACA,MAAM,MACJ,KAAK,SAAS,UACV,SAAS,KAAK,SAAS,OACvB,SAAS,KAAK,KAAK;MACzB,IAAI,CAAC,OAAO,IAAI,GAAG,KAAK,OAAO,QAAQ,SAAS,KAAK,YACnD,OAAO,QAAQ,KACb,KAAK,iBAAiB,OAAO,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAC3D;MACF,OAAO,IAAI,GAAG;MACd,IAAI,KAAK,SAAS,SAAS;OACzB,MAAM,OACJ,KAAK,iBAAiB,OAAO,SAAS,OAAO,KAAK;OACpD,IAAI,eAAe,gBAAgB,MAAM;QACvC,eAAe;QACf,OAAO,OAAO;QACd,OAAO,OAAO;OAChB;OACA,cAAc;OACd,IAAI,CAAC,cAAc;QACjB,MAAM,QAAQ,KAAK;QACnB,IACE,OAAO,QAAQ,KAAA,KACf,QAAS,OAAO,KAEhB,OAAO,MAAM,iBAAiB,OAAO,IAAI,KAAK,KAAK,IAAI;QACzD,IACE,OAAO,QAAQ,KAAA,KACf,QAAS,OAAO,KAEhB,OAAO,MAAM,iBAAiB,OAAO,IAAI,KAAK,KAAK,IAAI;OAC3D;MACF;MACA,IAAI,KAAK,YACP,QAAQ,IACN,KAAK,aACJ,QAAQ,IAAI,KAAK,UAAU,KAAK,KAAK,CACxC;KACJ;KACA,IAAI,MAAM,SAAS;MACjB,OAAO,gBAAgB;MACvB,MAAM,UAAU,iBACd,KAAK,SACL;OAAE;OAAK;MAAI,GACX,OACF;MACA,SAAS,IAAI,UAAU,SAAS,IAAI,OAAO,KAAK,KAAK,CAAC;KACxD;IACF;IACA,OAAO,gBAAgB,OAAO;IAC9B,OAAO,aAAa,QAAQ,OAAO,OAAO,QAAQ;IAClD,OAAO,qBAAqB,CAAC,GAAG,OAAO,CAAC,CAAC,MACtC,GAAG,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,KAAK,EAAE,KAAK,EAAE,KAAK,IAAI,EACjE,CAAC,CAAC,EAAE,GAAG;IACP,OAAO,kBAAkB,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK,CAAC,SAAS,YAAY;KAChE;KACA;IACF,EAAE;IACF,SAAS,IAAI,OAAO,IAAI,MAAM;IAC9B,OAAO,QAAQ,KAAK,MAAM;GAC5B;GACA,QAAQ,KAAK,MAAM;EACrB;EACA,QAAQ,OAAO,KAAK;GAAE,MAAM,MAAM;GAAM;EAAQ,CAAC;CACnD;CACA,MAAM,UAAU,QAAQ,OAAO,SAAS,MAAM,EAAE,OAAO;CACvD,MAAM,WACJ,WACA,cACA,QACA,QAAQ,MACS;EACjB,KAAK,MAAM;EACX,QAAQ,EAAE,QAAQ,KAAK,mBAAmB;EAC1C,IAAI,QAAQ,IAAI,OAAO,CAAC;EACxB,IAAI,UAAU,MAAM;GAClB,MAAM,WAAW,eAAe,QAAQ,WAAW,cAAc,MAAM;GACvE,OAAO,WACH,QACE;IAAE,GAAG;IAAU,MAAM,KAAA;GAAU,GAC/B,cACA,QACA,QAAQ,CACV,IACA,CAAC;EACP;EACA,MAAM,UAAwB,CAAC;EAC/B,KAAK,MAAM,UAAU,SAAS;GAC5B,KAAK,MAAM;GACX,QAAQ,EAAE,QAAQ,KAAK,mBAAmB;GAC1C,MAAM,IAAI,UAAU;GACpB,IACE,OAAO,MAAM,YAAY,OACtB,UAAU,SAAS,aAAA,CAAc,YAAY,KAChD,EAAE,IAAI,MAAM,OAAO,MAAM,MAAM,OAC/B,EAAE,MAAM,MAAM,OAAO,MAAM,IAAI,KAE/B;GACF,KAAK,MAAM,UAAU,OAAO,SAAS;IACnC,KAAK,MAAM;IACX,QAAQ,EAAE,QAAQ,KAAK,mBAAmB;IAC1C,IAAI,OAAO,UAAU,EAAE,MAAM,OAAO,OAAO,UAAU,EAAE,IAAI,KACzD,QAAQ,KAAK,KAAK,QAAQ,OAAO,MAAM,CAAC;GAC5C;EACF;EACA,OAAO;CACT;CACA,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,SAAS,SAAS,QAC3B,KAAK,MAAM,CAAC,QAAQ,SAAS,eAAe,IAAI,KAAK,KAAK,CAAC,GAAG;EAC5D,IAAI,CAAC,KAAK,SAAS;EACnB,MAAM,SAAS,QAAQ,MAAM,MAAM;GACjC,KAAK,MAAM;GACX,QAAQ,EAAE,QAAQ,KAAK,mBAAmB;GAC1C,OAAO,EAAE,UAAU,MAAM,QAAQ,SAAS,EAAE,OAAO,MAAM;EAC3D,CAAC;EACD,IAAI,CAAC,QAAQ;EACb,MAAM,OAAO,KAAK,QAAQ,OAAO,GAAG;EACpC,KAAK,MAAM,aAAa,KAAK,QAAQ,YACnC,KAAK,MAAM,MAAM,QAAQ,WAAW,MAAM,MAAM,MAAM,GAAG;GACvD,KAAK,MAAM;GACX,MAAM,MAAM,GAAG,QAAQ,IAAI,EAAE,GAAG,QAAQ,EAAE;GAC1C,IAAI,CAAC,SAAS,IAAI,GAAG,GAAG;IACtB,SAAS,IAAI,GAAG;IAChB,QAAQ,aAAa,KAAK;KAAE;KAAM;IAAG,CAAC;GACxC;EACF;EACF,MAAM,OAAO,QAAQ,KAAK,KAAK,QAAQ,IAAI;EAC3C,MAAM,QAAQ,KAAK;EACnB,MAAM,YAAY,QAAgD;GAChE,IAAI,CAAC,KAAK,OAAO,CAAC;GAClB,MAAM,QAAsB,CAAC;GAC7B,KAAK,IAAI,IAAI,IAAI,UAAU,IAAI,IAAI,QAAQ,KAAK;IAC9C,KAAK,MAAM;IACX,KAAK,MAAM,UAAU,QACnB,KAAK,WAAW,EAAE,CAAC,WACnB,MAAM,MACN,MACF,GAAG;KACD,KAAK,MAAM;KACX,MAAM,KAAK,MAAM;IACnB;GACF;GACA,OAAO;EACT;EACA,MAAM,gBAAgB,QAAkC;GACtD,IAAI,CAAC,KAAK,OAAO,KAAA;GACjB,KAAK,MAAM,IAAI,KAAK,IAAI,IAAI;GAC5B,OAAO,KAAK,KAAK,MAAM,IAAI,MAAM,IAAI,EAAE,CAAC,CAAC,KAAK;EAChD;EACA,KAAK,MAAM,QAAQ,OAAO;GACxB,KAAK,MAAM;GACX,IAAI;IAAC;IAAW;IAAW;GAAO,CAAC,CAAC,SAAS,KAAK,IAAI,GAAG;IACvD,MAAM,SAAyB;KAC7B,MAAM,QAAQ,MAAM;KACpB,OAAO,MAAM;KACb,UAAU,KAAK;IACjB;IACA,IAAI,KAAK,SAAS,WAAW;KAC3B,OAAO,YAAY,SAAS,KAAK,KAAK,EAAE,CAAC,CAAC;KAC1C,MAAM,SAAS,SAAS,KAAK,KAAK,EAAE;KACpC,OAAO,eAAe,OAAO,EAAE,EAAE;KACjC,MAAM,SAAS,OAAO,aAAa,KAAK,KAAK,EAAE,CAAC;KAChD,IAAI,OAAO,UAAU,MAAM,KAAK,SAAS,GACvC,OAAO,iBAAiB,OAAO,SAAS;IAC5C,OAAO,IAAI,KAAK,SAAS,WAAW;KAClC,OAAO,YAAY,SAAS,KAAK,KAAK,EAAE,CAAC,CAAC;KAC1C,OAAO,eAAe,SAAS,KAAK,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE;KACjD,OAAO,iBAAiB,SAAS,KAAK,KAAK,EAAE,CAAC,CAAC;IACjD,OAAO;KACL,MAAM,WAAW,KAAK,KAAK;KAC3B,MAAM,QAAQ,WACV,MAAM,MAAM,MAAM;MAChB,KAAK,MAAM;MACX,OACE,EAAE,SAAS,WACX,EAAE,QAAQ,SAAS,QACnB,EAAE,MAAM,SAAS;KAErB,CAAC,IACD,KAAA;KACJ,IAAI,CAAC,OAAO;KACZ,OAAO,YAAY,SAAS,MAAM,KAAK,EAAE,CAAC,CAAC;KAC3C,MAAM,SAAS,SAAS,KAAK,KAAK,EAAE;KACpC,OAAO,eAAe,OAAO,EAAE,EAAE;KACjC,MAAM,QACJ,KAAK,KAAK,OAAO,KAAA,IACb,IACA,OAAO,aAAa,KAAK,KAAK,EAAE,CAAC;KACvC,IAAI,OAAO,UAAU,KAAK,KAAK,QAAQ,GACrC,OAAO,iBAAiB,OAAO,QAAQ;IAC3C;IACA,QAAQ,QAAQ,KAAK,MAAM;GAC7B;GACA,IAAI,4BAA4B,KAAK,KAAK,IAAI,GAAG;IAC/C,MAAM,SAAS,KAAK,KAAK,SAAS,KAAK;IACvC,MAAM,QAAQ,KAAK,KAAK,WAAW,OAAO;IAC1C,MAAM,WAAyB,CAAC;IAChC,IAAI,QACF,KAAK,IAAI,IAAI,QAAQ,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KAAK,GACrD,KAAK,MAAM,UAAU,SAAS,KAAK,KAAK,EAAE,GAAG;KAC3C,KAAK,MAAM;KACX,SAAS,KAAK,MAAM;IACtB;SAGF,KAAK,MAAM,UAAU,SAAS,KAAK,KAAK,EAAE,GAAG;KAC3C,KAAK,MAAM;KACX,SAAS,KAAK,MAAM;IACtB;IAEF,QAAQ,WAAW,KAAK;KACtB,MAAM,QAAQ,MAAM;KACpB,OAAO,MAAM;KACb,UAAU,KAAK;KACf,iBAAiB;KACjB,eAAe,QACX,KAAA,IACA,SACE,SAAS,KAAK,KAAK,KAAM,KAAK,KAAK,MAAM,KAAK,KAAK,EACrD,CAAC,CAAC;IACR,CAAC;GACH;EACF;CACF;CACF,IAAI,QAAQ;CAGZ,KAAK,IAAI,KAAK,GAAG,KAAK,QAAQ,OAAO,QAAQ,MAC3C,KAAK,IAAI,KAAK,KAAK,GAAG,KAAK,QAAQ,OAAO,QAAQ,MAAM;EACtD,MAAM,OAAO,QAAQ,OAAO,GAAG,CAAC;EAChC,MAAM,QAAQ,QAAQ,OAAO,GAAG,CAAC;EACjC,KAAK,MAAM;EACX,QAAQ,QAAQ,KAAK,SAAS,MAAM,QAAQ,KAAK,cAAc;EAC/D,KAAK,MAAM,MAAM,MACf,KAAK,MAAM,MAAM,OAAO;GACtB,KAAK,MAAM;GACX,SAAS,GAAG,QAAQ,SAAS,GAAG,QAAQ;GACxC,QAAQ,OAAO,KAAK,cAAc;GAClC,KAAK,MAAM,MAAM,GAAG,SAClB,KAAK,MAAM,MAAM,GAAG,SAAS;IAC3B,KAAK,MAAM;IACX,MAAM,KAAK,SAAS,IAAI,GAAG,EAAE;IAC7B,MAAM,KAAK,SAAS,IAAI,GAAG,EAAE;IAC7B,IAAI,CAAC,GAAG,QAAQ,CAAC,GAAG,MAAM;IAC1B,IAAI,SAAS;IACb,KAAK,MAAM,SAAS,GAAG,OAAO,GAAG,OAAO,KAAK,IAAI;KAC/C,KAAK,MAAM,MAAM,SAAS,CAAC;KAC3B,QAAQ,EAAE,QAAQ,KAAK,mBAAmB;KAC1C,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG,IAAI,KAAK,GAAG;IACtC;IACA,KAAK,MAAM,CAAC,MAAM,IAAI,SAAS,CAC7B;KAAC,KAAK,IAAI,GAAG,MAAM;KAAG,KAAK,IAAI,GAAG,MAAM;KAAG,GAAG;IAAI,GAClD;KAAC,KAAK,IAAI,GAAG,MAAM;KAAG,KAAK,IAAI,GAAG,MAAM;KAAG,GAAG;IAAI,CACpD,GACE,IAAI,UAAU,SAAS,QAAQ,KAAK,kBAClC,QAAQ,SAAS,KAAK;KACpB;KACA;KACA,gBAAgB;KAChB,OAAO,SAAS;IAClB,CAAC;GAEP;EACJ;CACJ;CACF,OAAO;AACT;;;;ACvjBA,eAAsB,gBACpB,SAC6B;CAC7B,IAAI,CAAC,WAAW,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,SAAS,QAAQ,IAAI,GACpD,MAAM,IAAI,iBACR,sBACA,yCACF;CAEF,MAAM,SAAS,EAAE,GAAG,QAAQ;CAC5B,MAAM,WAAW,cAAc,MAAM;CACrC,OAAO;EACL,MAAM,OAAO;EACb,MAAM,KAAK,OAAO,WAAW;GAC3B,MAAM,SAAS,cAAc,WAAW,QAAQ;GAChD,MAAM,QACJ,iBAAiB,aACb,QACA,iBAAiB,cACf,IAAI,WAAW,KAAK,IACpB,KAAA;GACR,IAAI,CAAC,OACH,MAAM,IAAI,iBACR,iBACA,qCACF;GACF,WAAW,MAAM,QAAQ,iBAAiB,MAAM;GAChD,IAAI,OAAO,SAAS,QAAQ,OAAO,SAAS,OAAO,MAAM;GACzD,OAAO,QAAQ,OAAO,QAAQ;IAAE,GAAG;IAAQ,GAAG;GAAU,CAAC;EAC3D;EACA,MAAM,MAAM,UAAU,WAAW;GAC/B,MAAM,SAAS,cAAc,WAAW,QAAQ;GAChD,OAAO,OAAO,SAAS,SACnB,UAAU,UAAU,QAAQ,aAAa,CAAC,CAAC,IAC3C,SAAS,UAAU,QAAQ;IAAE,GAAG;IAAQ,GAAG;GAAU,CAAC;EAC5D;CACF;AACF"}
|