@protobase/ui 0.63.4 → 0.64.0

package/dist/shell-source-maps/assets/export-worker-3e4Zsv0a.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"export-worker-3e4Zsv0a.js","names":["text","text","text","text","message","enumLabel","labels","value","fallback","activeLocale","setFallbackLocale","locale","formatTags","formatTag","cache","cachedFormat","tag","id","key","make","defineMessages","values","message","catalogue","text$2","count","one","viewerZone","partsFormats","partsFormat","known","zone","format","wallClock","parts","ms","part","zoneOffset","clock","day","name","options","formatDate","zonedFormats","formatDateTime","formats","relative","units","formatRelativeTime","away","seconds","unit","size","text$1","isStoredFile","isFileDraft","fileShown","affixed","hints","text","displayValue","field","now","empty","isEmpty","relationLabel","column","fileText","mode","csvText","excelSerial","dateFormats","literal","affix","char","numberFormat","digits","code","numberCell","number","dateCell","type","xlsxCell","utf8Bom","needsQuotes","formulaStart","csvField","csvTextField","csvLine","fields","u8","u16","i32","fleb","fdeb","clim","freb","b","i","eb","r","j","_a","fl","revfl","_b","revfd","rev","x","hMap","s","cd","l","mb","le","co","rvb","sv","r_1","v","m","flt","fdt","flm","fdm","shft","p","slc","e","ec","err","msg","ind","nt","wbits","o","wbits16","hTree","t","d","t2","et","a","i0","i1","i2","maxSym","tr","mbt","ln","dt","lft","cst","i2_1","i2_2","i2_3","n","lc","c","cl","cli","cln","cls","w","clen","cf","wfblk","dat","pos","out","wblk","final","lf","dlt","mlb","df","ddt","mdb","_c","lclt","nlc","_d","lcdt","ndc","lcfreq","_e","lct","mlcb","nlcc","flen","bl","ftlen","dtlen","bs","lm","ll","dm","dl","llm","lcts","it","clct","len","li","sym","syms","dst","deo","dflt","st","pre","post","lst","lvl","opt","msk_1","plvl","prev","head","bs1_1","bs2_1","hsh","lc_1","wi","hv","imod","pimod","rem","ch_1","dif","maxn","maxd","ml","nl","mmd","md","ti","lin","din","crct","k","crc","cr","dopt","dict","newDat","mrg","wbytes","Deflate","opts","cb","f","endLen","chunk","newBuf","split","sync","ep","te","td","strToU8","latin1","ar_1","str","ar","ai","dbf","exfl","ex","wzh","fn","col","exl","ce","u","y","exf","wzf","ZipPassThrough","filename","ZipDeflate","_this","Zip","file","fl_1","com","hl_1","header","chks_1","pAll_1","_i","chks_2","chk","tr_1","ind_1","uf_1","nxt","cl_1","dd","bt","tl","invalidXml","escapeXml","columnLetters","letter","index","textCell","ref","style","xml","mainNs","relNs","packageRelNs","contentTypes","rootRels","workbookRels","sheetName","workbook","styles","numFmts","xfs","encoder","createXlsxWriter","zip","error","onChunk","add","path","sheet","worksheet","cols","width","letters","styleOf","cellXml","cell","rowNumber","row","cells","typedText","columnWidths","columns","longest","records","record","createCsvBuilder","plan","createXlsxBuilder","writer","start","createExportBuilder","joined","bytes","chunks","offset","handle","builder","scope","event"],"sources":["../../../schema/src/enum-label.ts","../../src/locale/active-locale.ts","../../src/format/intl-cache.ts","../../src/locale/messages.ts","../../src/format/messages.ts","../../src/format/zone.ts","../../src/format/date.ts","../../src/live/messages.ts","../../src/live/file-values.ts","../../src/live/display-value.ts","../../src/app/export/cells.ts","../../src/app/export/csv.ts","../../../../node_modules/.bun/fflate@0.8.3/node_modules/fflate/esm/browser.js","../../src/app/export/xlsx.ts","../../src/app/export/builder.ts","../../src/app/export/builder-port.ts","../../src/app/export/export-worker.ts"],"sourcesContent":["/** How an enum value reads: its label from the view's `valueLabels`, else the stored value unchanged (`co_signer`). */\nexport const enumLabel = (value: string, labels?: Record<string, string>) => labels?.[value] ?? value\n","import { pickLocale, type Locale } from '@protobase/schema/internal'\n\n// The built-in screens read one locale, so plain functions (formats, messages) need no context: the app's when its\n// `/meta` names one, else the fallback the app starts with, the browser's language unless given. Both only ever get\n// set to what the app decides on each render, so a part of the tree that renders later never sees another one.\nlet fallback: Locale = 'en'\nlet app: Locale | undefined\n\n/** The language the screens are in now. */\nexport const activeLocale = (): Locale => app ?? fallback\n\n/** The language the screens are in when the app sets none: the browser's, or the one the app was given. */\nexport const setFallbackLocale = (locale: Locale) => {\n  fallback = locale\n}\n\n/** The language the app sets for everyone, from its `/meta`; undefined when it sets none. */\nexport const setAppLocale = (locale: Locale | undefined) => {\n  app = locale\n}\n\n/** The browser's language when the screens come in it, else English. */\nexport const browserLocale = (languages = globalThis.navigator?.languages ?? []) => pickLocale(languages)\n\n// The language tag numbers and dates are written with: English as in Ireland and Britain (`6 Oct 2026`, `1,234.5`).\nconst formatTags: Record<Locale, string> = { en: 'en-GB', nl: 'nl-NL' }\n\n/** The language tag `Intl` formats numbers and dates with, for the active locale. */\nexport const formatTag = () => formatTags[activeLocale()]\n","import { formatTag } from '../locale/active-locale'\n\nconst cache = new Map<string, unknown>()\n\n/** One `Intl` formatter per language tag and `key`, made with `make` for the active locale's tag the first time. */\nexport const cachedFormat = <T>(key: string, make: (tag: string) => T): T => {\n  const tag = formatTag()\n  const id = `${tag}|${key}`\n  if (!cache.has(id)) cache.set(id, make(tag))\n  return cache.get(id) as T\n}\n","import type { Locale } from '@protobase/schema/internal'\nimport { activeLocale } from './active-locale'\n\n/** A built-in text: fixed, or made from the values it names, such as a count. */\ntype Message = string | ((...values: never[]) => string)\n\n/** A translation of `M`: every message of it, taking the same values. */\nexport type Translation<M extends Record<string, Message>> = { [K in keyof M]: M[K] extends string ? string : M[K] }\n\ntype Values<T> = T extends (...values: infer V) => string ? V : []\n\n/**\n * An area's built-in texts in every language the screens come in, keyed by id: the lookup returns the one for the\n * active locale, `text('search')` or `text('rows', 3)`. Dutch must translate every English text, which the types check.\n */\nexport const defineMessages = <M extends Record<string, Message>>(catalogue: { en: M } & Record<Exclude<Locale, 'en'>, Translation<M>>) =>\n  <K extends keyof M>(id: K, ...values: Values<M[K]>): string => {\n    const message = (catalogue[activeLocale()] as M)[id]\n    return typeof message === 'function' ? (message as (...values: unknown[]) => string)(...values) : (message as string)\n  }\n","import { defineMessages } from '../locale/messages'\n\nexport const text = defineMessages({\n  en: {\n    rows: (count: string, one: boolean) => `${count} ${one ? 'row' : 'rows'}`,\n    aboutRows: (count: string) => `about ${count} rows`,\n    secondsAgo: (count: number) => `${count} s ago`,\n    minutesAgo: (count: number) => `${count} min ago`,\n    hoursAgo: (count: number) => `${count} h ago`,\n    daysAgo: (count: number) => `${count} d ago`,\n    justNow: 'just now',\n  },\n  nl: {\n    rows: (count: string, one: boolean) => `${count} ${one ? 'rij' : 'rijen'}`,\n    aboutRows: (count: string) => `ongeveer ${count} rijen`,\n    secondsAgo: (count: number) => `${count} s geleden`,\n    minutesAgo: (count: number) => `${count} min geleden`,\n    hoursAgo: (count: number) => `${count} u geleden`,\n    daysAgo: (count: number) => `${count} d geleden`,\n    justNow: 'zojuist',\n  },\n})\n","import { cachedFormat } from './intl-cache'\n\n// Times show in the viewer's time zone, the browser's; dates (`YYYY-MM-DD`, no time) have no zone and never shift.\n\n/** The viewer's IANA time zone, such as `Europe/Amsterdam`. */\nexport const viewerZone = () => Intl.DateTimeFormat().resolvedOptions().timeZone\n\nconst partsFormats = new Map<string, Intl.DateTimeFormat>()\n\nconst partsFormat = (zone: string) => {\n  const known = partsFormats.get(zone)\n  if (known) return known\n  const format = new Intl.DateTimeFormat('en-US', { timeZone: zone, hourCycle: 'h23', year: 'numeric', month: '2-digit', day: '2-digit', hour: '2-digit', minute: '2-digit', second: '2-digit' })\n  partsFormats.set(zone, format)\n  return format\n}\n\n// The wall clock of `zone` at `ms`, as numbers\nconst wallClock = (ms: number, zone: string) => {\n  const parts = Object.fromEntries(partsFormat(zone).formatToParts(ms).map((part) => [part.type, part.value]))\n  return { year: Number(parts.year), month: Number(parts.month), day: Number(parts.day), hour: Number(parts.hour), minute: Number(parts.minute), second: Number(parts.second) }\n}\n\n/** How far `zone`'s clock is ahead of UTC at `ms`, in milliseconds: 7 200 000 for Amsterdam in summer. */\nexport const zoneOffset = (ms: number, zone: string) => {\n  const clock = wallClock(ms, zone)\n  const asUtc = Date.UTC(clock.year, clock.month - 1, clock.day, clock.hour, clock.minute, clock.second)\n  return asUtc - Math.floor(ms / 1000) * 1000\n}\n\nconst pad = (value: number) => String(value).padStart(2, '0')\n\n/** The day `ms` falls on in `zone`, as `YYYY-MM-DD`. */\nexport const dayIn = (ms: number, zone: string) => {\n  const clock = wallClock(ms, zone)\n  return `${clock.year}-${pad(clock.month)}-${pad(clock.day)}`\n}\n\n/** The instant `zone`'s clock reads `wall`, a wall-clock time written as if it were UTC milliseconds. */\nexport const instantAt = (wall: number, zone: string) => {\n  // The offset at `wall` read as UTC is right unless the zone changes its clock in the hours between; a second pass fixes that\n  const guess = wall - zoneOffset(wall, zone)\n  return wall - zoneOffset(guess, zone)\n}\n\n/** The instant `day` (`YYYY-MM-DD`) starts in `zone`: its local midnight. */\nexport const startOfDayIn = (day: string, zone: string) => instantAt(Date.parse(`${day}T00:00:00Z`), zone)\n\n/** The zone a time is shown in, as its hover label says: \"Europe/Amsterdam (GMT+2)\", or \"UTC\". */\nexport const zoneLabel = (ms: number, zone: string) => {\n  const named = cachedFormat(`zoneName:${zone}`, (tag) => new Intl.DateTimeFormat(tag, { timeZone: zone, timeZoneName: 'shortOffset' }))\n  const name = named.formatToParts(ms).find((part) => part.type === 'timeZoneName')?.value ?? zone\n  return zone === 'UTC' || zone === 'Etc/UTC' ? 'UTC' : `${zone} (${name})`\n}\n","import { cachedFormat } from './intl-cache'\nimport { text } from './messages'\nimport { viewerZone } from './zone'\n\n// Dates, months and weekdays are zone-free days, kept in UTC; times are the viewer's, in `zone`.\nconst dateFormat = (name: string, options: Intl.DateTimeFormatOptions) => () => cachedFormat(`date:${name}`, (tag) => new Intl.DateTimeFormat(tag, { ...options, timeZone: 'UTC' }))\nconst day = dateFormat('day', { day: 'numeric', month: 'short', year: 'numeric' })\nconst dayShort = dateFormat('dayShort', { day: 'numeric', month: 'short' })\nconst month = dateFormat('month', { month: 'long', year: 'numeric' })\nconst monthName = dateFormat('monthName', { month: 'long' })\nconst weekday = dateFormat('weekday', { weekday: 'short' })\nconst weekdayDate = dateFormat('weekdayDate', { weekday: 'long', day: 'numeric', month: 'short', year: 'numeric' })\n\nexport const formatDate = (ms: number) => day().format(ms)\n\nexport const formatDayShort = (ms: number) => dayShort().format(ms)\n\nconst zonedFormats = (zone: string) =>\n  cachedFormat(`zoned:${zone}`, (tag) => ({\n    day: new Intl.DateTimeFormat(tag, { day: 'numeric', month: 'short', year: 'numeric', timeZone: zone }),\n    time: new Intl.DateTimeFormat(tag, { hour: '2-digit', minute: '2-digit', hour12: false, timeZone: zone }),\n  }))\n\n/** \"6 Oct 2026, 16:32\": an instant on the clock of `zone`, the viewer's unless given. */\nexport const formatDateTime = (ms: number, zone = viewerZone()) => {\n  const formats = zonedFormats(zone)\n  return `${formats.day.format(ms)}, ${formats.time.format(ms)}`\n}\n\n/** \"October 2026\". */\nexport const formatMonth = (ms: number) => month().format(ms)\n\n/** \"October\". */\nexport const formatMonthName = (ms: number) => monthName().format(ms)\n\n/** \"October – December 2026\": the months from `from` to `to`, both included. */\nexport const formatMonthRange = (from: number, to: number) => month().formatRange(from, to)\n\n/** \"Mon\". */\nexport const formatWeekday = (ms: number) => weekday().format(ms)\n\n/** \"Monday, 12 Oct 2026\". */\nexport const formatWeekdayDate = (ms: number) => weekdayDate().format(ms)\n\n/** \"12–18 Oct 2026\", \"28 Dec 2026 – 3 Jan 2027\": the days from `from` to `to`, both included. */\nexport const formatDayRange = (from: number, to: number) => day().formatRange(from, to)\n\n/** \"09:30\": an instant's time on the clock of `zone`, the viewer's unless given. */\nexport const formatTime = (ms: number, zone = viewerZone()) => zonedFormats(zone).time.format(ms)\n\nexport const formatAgo = (seconds: number) => {\n  if (seconds < 60) return text('secondsAgo', seconds)\n  if (seconds < 3600) return text('minutesAgo', Math.floor(seconds / 60))\n  if (seconds < 86_400) return text('hoursAgo', Math.floor(seconds / 3600))\n  return text('daysAgo', Math.floor(seconds / 86_400))\n}\n\nconst relative = () => cachedFormat('relative', (tag) => new Intl.RelativeTimeFormat(tag, { numeric: 'auto' }))\n\nconst units: Array<[Intl.RelativeTimeFormatUnit, number]> = [\n  ['year', 31_536_000],\n  ['month', 2_592_000],\n  ['day', 86_400],\n  ['hour', 3600],\n  ['minute', 60],\n]\n\n/** \"5 minutes ago\", \"yesterday\", \"in 3 hours\"; `seconds` is how long ago it was, negative for a time to come. */\nexport const formatRelativeTime = (seconds: number) => {\n  const away = Math.abs(seconds)\n  const [unit, size] = units.find(([, size]) => away >= size) ?? ['second', 1]\n  if (unit === 'second' && away < 45) return text('justNow')\n  return relative().format(-Math.sign(seconds) * Math.floor(away / size), unit)\n}\n","import { defineMessages } from '../locale/messages'\n\nexport const text = defineMessages({\n  en: {\n    yes: 'Yes',\n    no: 'No',\n    shownIn: (zone: string) => `Shown in ${zone}`,\n    fileMissing: 'File missing',\n  },\n  nl: {\n    yes: 'Ja',\n    no: 'Nee',\n    shownIn: (zone: string) => `Getoond in ${zone}`,\n    fileMissing: 'Bestand ontbreekt',\n  },\n})\n","import type { StoredFile, UploadResult } from '@protobase/client'\nimport type { FieldModel } from '@protobase/schema'\nimport { text } from './messages'\n\n/** A file uploaded in the form and not yet saved: the ticket the save sends, and a local preview while there is one. */\nexport type FileDraft = { uploaded: UploadResult; preview?: string }\n\nexport const isStoredFile = (value: unknown): value is StoredFile =>\n  typeof value === 'object' && value !== null && typeof (value as { uri?: unknown }).uri === 'string'\n\nexport const isFileDraft = (value: unknown): value is FileDraft =>\n  typeof value === 'object' && value !== null && typeof (value as { uploaded?: { value?: unknown } }).uploaded?.value === 'string'\n\n/** What a file field shows: its name, type and size, whether stored or just uploaded; `undefined` when empty. */\nexport const fileShown = (value: unknown) => {\n  if (isFileDraft(value)) return { ...value.uploaded.file, ...(value.preview && { url: value.preview }), corrected: value.uploaded.corrected }\n  if (!isStoredFile(value)) return undefined\n  if ('missing' in value) return { name: text('fileMissing'), type: '', missing: true as const }\n  return value\n}\n\nconst units = ['bytes', 'kB', 'MB', 'GB']\n\n/** `48 kB`, `1.2 MB`: decimal units, like the field's `maxSize`. */\nexport const formatSize = (bytes: number) => {\n  let size = bytes\n  let unit = 0\n  while (size >= 1000 && unit < units.length - 1) {\n    size /= 1000\n    unit += 1\n  }\n  return unit === 0 ? `${bytes} ${bytes === 1 ? 'byte' : 'bytes'}` : `${size < 10 ? size.toFixed(1) : Math.round(size)} ${units[unit]}`\n}\n\n/** Raster images the browser shows; SVG is never shown, since it can carry scripts. */\nexport const isPreviewable = (type: string) => type.startsWith('image/') && type !== 'image/svg+xml'\n\n/** Where a picture is drawn, in CSS pixels. */\nexport type ImageBox = { width: number; height: number }\n\n// An image for a box needs this many pixels per CSS pixel to stay sharp on a high-density screen.\nconst density = 2\n// A side a variant leaves unbounded counts as larger than any image.\nconst unbounded = 100_000\n\ntype Variant = { url: string; width?: number; height?: number }\n\nconst covers = (variant: Variant, box: ImageBox) =>\n  (variant.width !== undefined || variant.height !== undefined) &&\n  (variant.width ?? unbounded) >= box.width * density &&\n  (variant.height ?? unbounded) >= box.height * density\n\nconst area = (variant: Variant) => (variant.width ?? unbounded) * (variant.height ?? unbounded)\n\n/**\n * The picture of a file for `box`: the link of its smallest variant large enough for it, else the file's own, with its\n * placeholder; `undefined` for a file that is no raster image with a link.\n */\nexport const shownImage = (value: unknown, box: ImageBox) => {\n  const file = fileShown(value)\n  if (!file || 'missing' in file || !file.url || !isPreviewable(file.type)) return undefined\n  const variants: Variant[] = 'variants' in file && file.variants ? Object.values(file.variants) : []\n  const best = variants.filter((variant) => covers(variant, box)).sort((a, b) => area(a) - area(b))[0]\n  return { url: best?.url ?? file.url, ...('placeholder' in file && file.placeholder !== undefined && { placeholder: file.placeholder }) }\n}\n\n/** The file input's `accept`: the field's allowed types, or nothing when it takes any. */\nexport const acceptOf = (field: FieldModel) => {\n  const accept = field.file?.accept ?? []\n  return accept.length === 0 || accept.includes('*/*') ? undefined : accept.join(',')\n}\n\n/** What a save sends for a file field: the ticket of a new upload, `null` to clear it, the stored URI to keep it. */\nexport const filePatchValue = (draft: unknown) => {\n  if (isFileDraft(draft)) return draft.uploaded.value\n  if (isStoredFile(draft)) return draft.uri\n  return null\n}\n\n/** Whether a file field's draft changes what is stored. */\nexport const fileDiffers = (draft: unknown, stored: unknown) => {\n  if (isFileDraft(draft)) return true\n  const uri = (value: unknown) => (isStoredFile(value) ? value.uri : null)\n  return uri(draft) !== uri(stored)\n}\n","import { enumLabel, type FieldModel, type FieldViewModel } from '@protobase/schema'\nimport { formatDate, formatDateTime, formatRelativeTime } from '../format/date'\nimport { viewerZone, zoneLabel } from '../format/zone'\nimport { fileShown } from './file-values'\nimport { formatTag } from '../locale/active-locale'\nimport { text as message } from './messages'\n\n// A number with the view's prefix before it and suffix after it, such as `€1,200` or `120 m²`.\nconst affixed = (text: string, hints: FieldViewModel) => `${hints.prefix ?? ''}${text}${hints.suffix ?? ''}`\n\n/**\n * A read-only rendering of a stored value, following the view's prefix, suffix, decimals, format and value label hints; a\n * timestamp on the clock of `zone`, the viewer's unless given.\n */\nexport const displayValue = (field: FieldModel, value: unknown, hints: FieldViewModel = {}, zone = viewerZone(), now = Date.now()) => {\n  if (value === null || value === undefined || value === '') return '—'\n  switch (field.type) {\n    case 'boolean':\n      return value ? message('yes') : message('no')\n    case 'file':\n      return fileShown(value)?.name ?? '—'\n    case 'enum':\n      return enumLabel(String(value), hints.valueLabels)\n    case 'timestamp': {\n      const ms = Date.parse(String(value))\n      return hints.format === 'relative' ? formatRelativeTime(Math.round((now - ms) / 1000)) : formatDateTime(ms, zone)\n    }\n    case 'date':\n      return formatDate(Date.parse(String(value)))\n    case 'decimal': {\n      const text = hints.decimals === undefined ? String(value) : Number(value).toFixed(hints.decimals)\n      if (hints.format === 'percent') return `${Number(value)}%`\n      return affixed(Number(text).toLocaleString(formatTag(), { minimumFractionDigits: hints.decimals ?? 0, maximumFractionDigits: hints.decimals ?? 20 }), hints)\n    }\n    case 'integer':\n    case 'bigint':\n      return affixed(String(value), hints)\n    default:\n      return typeof value === 'object' ? JSON.stringify(value) : String(value)\n  }\n}\n\n/** The hover label of a shown value: the time zone a timestamp is shown in, or its exact time when shown relative; nothing for other values. */\nexport const valueTitle = (field: FieldModel, value: unknown, zone = viewerZone(), hints: FieldViewModel = {}) => {\n  if (field.type !== 'timestamp' || typeof value !== 'string') return undefined\n  const ms = Date.parse(value)\n  if (Number.isNaN(ms)) return undefined\n  if (hints.format === 'relative') return formatDateTime(ms, zone)\n  return message('shownIn', zoneLabel(ms, zone))\n}\n","import type { FieldModel, FieldViewModel } from '@protobase/schema'\nimport type { RelatedLabels } from '@protobase/client'\nimport { displayValue } from '../../live/display-value'\nimport { fileShown, isStoredFile } from '../../live/file-values'\nimport { viewerZone, zoneOffset } from '../../format/zone'\n\n/** `shown` exports values as the list shows them (labels, formatted dates and numbers), `raw` as the API stores them. */\nexport type ExportMode = 'shown' | 'raw'\n\n/** One column of an export: the field it reads, its header (the field's label) and the view's hints for it. */\nexport type ExportColumn = { name: string; header: string; field: FieldModel; hints: FieldViewModel }\n\n/** A typed spreadsheet cell; a date is a number of days since 1900 with a date format, as Excel stores it. */\nexport type Cell = { kind: 'empty' } | { kind: 'text'; value: string } | { kind: 'number'; value: number; format?: string } | { kind: 'boolean'; value: boolean }\n\nconst empty: Cell = { kind: 'empty' }\nconst text = (value: string): Cell => ({ kind: 'text', value })\n\nconst isEmpty = (value: unknown) => value === null || value === undefined || value === ''\n\nconst relationLabel = (column: ExportColumn, value: unknown, labels: RelatedLabels) => labels[column.name]?.[String(value)] ?? String(value)\n\n// A file's name as the list shows it; raw, its stored `uri`, since a private file's URL is signed for an hour or two.\nconst fileText = (value: unknown, mode: ExportMode) => {\n  if (!isStoredFile(value)) return String(value)\n  return mode === 'raw' ? value.uri : (fileShown(value)?.name ?? value.uri)\n}\n\n/** A value as one CSV field: as the list shows it, or as the API sends it, empty for no value. */\nexport const csvText = (column: ExportColumn, value: unknown, labels: RelatedLabels, mode: ExportMode) => {\n  if (isEmpty(value)) return ''\n  const { field, hints } = column\n  if (field.type === 'file') return fileText(value, mode)\n  if (field.type === 'relation') return mode === 'shown' ? relationLabel(column, value, labels) : String(value)\n  if (mode === 'shown') return displayValue(field, value, { ...hints, format: undefined })\n  if (typeof value === 'object') return JSON.stringify(value)\n  return String(value)\n}\n\n// Excel counts days from 30 December 1899 and has no time zones: a shown time is on the viewer's clock, as the list shows\n// it, and a raw one in UTC, as the API sends it.\nconst excelEpochDays = 25_569\nconst msPerDay = 86_400_000\nconst excelSerial = (ms: number) => ms / msPerDay + excelEpochDays\n\nconst dateFormats = { shown: { date: 'd mmm yyyy', timestamp: 'd mmm yyyy, hh:mm' }, raw: { date: 'yyyy-mm-dd', timestamp: 'yyyy-mm-dd hh:mm:ss' } }\n\n// Every character of a prefix or suffix escaped, so Excel shows it as it is around the number.\nconst literal = (affix: string | undefined) => [...(affix ?? '')].map((char) => `\\\\${char}`).join('')\n\n/** The Excel number format that shows a number as the list does: its decimals, prefix and suffix, or a percent sign. */\nexport const numberFormat = (hints: FieldViewModel) => {\n  if (hints.format === 'percent') return 'General\\\\%'\n  const digits = hints.decimals === undefined ? 'General' : hints.decimals > 0 ? `#,##0.${'0'.repeat(hints.decimals)}` : '#,##0'\n  const code = `${literal(hints.prefix)}${digits}${literal(hints.suffix)}`\n  return code === 'General' ? undefined : code\n}\n\n// A number when the text holds one exactly enough to calculate with; a bigint past 2^53 stays text, so no digit is lost.\nconst numberCell = (column: ExportColumn, value: unknown, mode: ExportMode): Cell => {\n  const number = Number(value)\n  if (!Number.isFinite(number)) return text(String(value))\n  if (column.field.type === 'bigint' && !Number.isSafeInteger(number)) return text(String(value))\n  const format = mode === 'shown' ? numberFormat(column.hints) : undefined\n  return format ? { kind: 'number', value: number, format } : { kind: 'number', value: number }\n}\n\nconst dateCell = (type: 'date' | 'timestamp', value: unknown, mode: ExportMode, zone: string): Cell => {\n  const ms = Date.parse(String(value))\n  if (Number.isNaN(ms)) return text(String(value))\n  const clock = type === 'timestamp' && mode === 'shown' ? ms + zoneOffset(ms, zone) : ms\n  return { kind: 'number', value: excelSerial(clock), format: dateFormats[mode][type] }\n}\n\n/** A value as one typed Excel cell: numbers, dates and booleans as such, labels or stored values as text. */\nexport const xlsxCell = (column: ExportColumn, value: unknown, labels: RelatedLabels, mode: ExportMode, zone = viewerZone()): Cell => {\n  if (isEmpty(value)) return empty\n  const { field } = column\n  switch (field.type) {\n    case 'boolean':\n      return { kind: 'boolean', value: Boolean(value) }\n    case 'integer':\n    case 'bigint':\n    case 'decimal':\n      return numberCell(column, value, mode)\n    case 'date':\n    case 'timestamp':\n      return dateCell(field.type, value, mode, zone)\n    case 'relation':\n      if (mode === 'shown') return text(relationLabel(column, value, labels))\n      return typeof value === 'number' ? { kind: 'number', value } : text(String(value))\n    default:\n      return text(csvText(column, value, labels, mode))\n  }\n}\n","/** The UTF-8 byte order mark, which makes Excel read a CSV file as UTF-8 instead of the system's code page. */\nexport const utf8Bom = new Uint8Array([0xef, 0xbb, 0xbf])\n\nconst needsQuotes = /[\",\\r\\n]/\n\n// Text Excel would run as a formula when the file is opened, such as `=HYPERLINK(...)`: a leading apostrophe keeps it\n// text (OWASP's advice on CSV injection).\nconst formulaStart = /^[=+\\-@\\t\\r]/\n\n/** One field as RFC 4180 writes it: in double quotes, its quotes doubled, when it holds a comma, quote or line break. */\nexport const csvField = (value: string) => (needsQuotes.test(value) ? `\"${value.replaceAll('\"', '\"\"')}\"` : value)\n\n/** Text from a text field, kept from running as a formula in a spreadsheet. */\nexport const csvTextField = (value: string) => csvField(formulaStart.test(value) ? `'${value}` : value)\n\n/** One record, CRLF-terminated as RFC 4180 has it. */\nexport const csvLine = (fields: string[]) => `${fields.join(',')}\\r\\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    , // determined by compression function\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[0]) {\n            strm.push(ev.data[0], ev.data[1]);\n            postMessage([ev.data[0].length]);\n        }\n        else\n            strm.flush(ev.data[1]);\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        // can fail for cross-realm Uint8Array, but ok - only a small performance penalty\n        w.postMessage([d, t = f], d.buffer instanceof ArrayBuffer ? [d.buffer] : []);\n    };\n    strm.terminate = function () { w.terminate(); };\n    if (flush) {\n        strm.flush = function (sync) { w.postMessage([0, sync]); };\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; };\n// read 8 bytes\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        if (final) {\n            // cleanup unneeded buffers/state to reduce memory usage\n            this.s = this.o = {};\n            this.b = et;\n        }\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * deflated output for small inputs.\n     * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n     *             extra bytes, but guarantees all pushed data is immediately\n     *             decompressible. A separate DEFLATE stream may be concatenated\n     *             with the current output after a sync flush.\n     */\n    Deflate.prototype.flush = function (sync) {\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        // could technically skip writing the type-0 block for (this.s.r & 7) == 0,\n        // but the deterministic trailer (00 00 FF FF) is useful in some situations\n        if (sync) {\n            var c = new u8(6);\n            c[0] = this.s.r >> 3;\n            // write empty, non-final type-0 block\n            var ep = wfblk(c, this.s.r, et);\n            this.s.r = 0;\n            this.ondata(c.subarray(0, ep >> 3), false);\n        }\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}\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     * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n     *             extra bytes, but guarantees all pushed data is immediately\n     *             decompressible.\n     */\n    Gzip.prototype.flush = function (sync) {\n        Deflate.prototype.flush.call(this, sync);\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, 0);\n        // process concatenated GZIP\n        if (this.s.f && !this.s.l) {\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        else if (final) {\n            Inflate.prototype.c.call(this, 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}\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     * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n     *             extra bytes, but guarantees all pushed data is immediately\n     *             decompressible.\n     */\n    Zlib.prototype.flush = function (sync) {\n        Deflate.prototype.flush.call(this, sync);\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}\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 (ArrayBuffer.isView(val))\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), efl = b2(d, b + 30), fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)), es = b + 46 + fnl;\n    var _a = z64hs(d, es, efl, z, b4(d, b + 20), 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 + efl + b2(d, b + 32), off];\n};\n// read zip64 header sizes\nvar z64hs = function (d, b, l, z, sc, su, off) {\n    var nsc = sc == 4294967295, nsu = su == 4294967295, noff = off == 4294967295, e = b + l;\n    var nf = nsc + nsu + noff;\n    if (z && nf) {\n        for (; b + 4 < e; b += 4 + b2(d, b + 2)) {\n            if (b2(d, b) == 1) {\n                return [\n                    nsc ? b8(d, b + 4 + 8 * nsu) : sc,\n                    nsu ? b8(d, b + 4) : su,\n                    noff ? b8(d, b + 4 + 8 * (nsu + nsc)) : off,\n                    1\n                ];\n            }\n        }\n        // z == 2 for unknown whether or not zip64\n        if (z < 2)\n            err(13);\n    }\n    return [sc, su, off, 0];\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        // we shouldn't really do this cast, but properly handling ArrayBufferLike\n        // makes the API unergonomic with Buffer\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 (chunk, final) {\n        // same as ZipPassThrough: cast to retain Buffer ergonomics\n        this.ondata(null, chunk, 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 (chunk, final) {\n        try {\n            this.i.push(chunk, 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 (chunk, final) {\n        if (this.i.terminate)\n            chunk = slc(chunk, 0);\n        this.i.push(chunk, 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 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 lsc = b4(buf, i + 18), lsu = b4(buf, i + 22);\n                        var fn_1 = strFromU8(buf.subarray(i + 30, i += 30 + fnl), !u);\n                        var _a = z64hs(buf, i, es, 2, lsc, lsu, 0), sc_1 = _a[0], su_1 = _a[1], z64 = _a[3];\n                        if (dd)\n                            sc_1 = -1 - z64;\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 = b4(data, e - 20) == 0x7064B50;\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 = b4(data, e - 20) == 0x7064B50;\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 { Zip, ZipDeflate } from 'fflate'\nimport type { Cell } from './cells'\n\n/** The most data rows a sheet holds: Excel's 1,048,576 rows, less the header. */\nexport const xlsxMaxRows = 1_048_575\n\n// Excel refuses a cell of more text than this.\nconst maxCellText = 32_767\n\n// Characters XML 1.0 cannot hold at all, which would make the file unreadable.\nconst invalidXml = /[\\u0000-\\u0008\\u000b\\u000c\\u000e-\\u001f￾￿]/g\n\nconst escapeXml = (text: string) =>\n  text.replace(invalidXml, '').replaceAll('&', '&amp;').replaceAll('<', '&lt;').replaceAll('>', '&gt;').replaceAll('\"', '&quot;')\n\n/** A column's letters: 0 is A, 25 is Z, 26 is AA. */\nexport const columnLetters = (index: number): string => {\n  const letter = String.fromCharCode(65 + (index % 26))\n  return index < 26 ? letter : columnLetters(Math.floor(index / 26) - 1) + letter\n}\n\nconst textCell = (ref: string, text: string, style = '') =>\n  `<c r=\"${ref}\"${style} t=\"inlineStr\"><is><t xml:space=\"preserve\">${escapeXml(text.slice(0, maxCellText))}</t></is></c>`\n\nconst xml = '<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"yes\"?>\\n'\nconst mainNs = 'http://schemas.openxmlformats.org/spreadsheetml/2006/main'\nconst relNs = 'http://schemas.openxmlformats.org/officeDocument/2006/relationships'\nconst packageRelNs = 'http://schemas.openxmlformats.org/package/2006/relationships'\n\nconst contentTypes = `${xml}<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/worksheets/sheet1.xml\" ContentType=\"application/vnd.openxmlformats-officedocument.spreadsheetml.worksheet+xml\"/><Override PartName=\"/xl/styles.xml\" ContentType=\"application/vnd.openxmlformats-officedocument.spreadsheetml.styles+xml\"/></Types>`\nconst rootRels = `${xml}<Relationships xmlns=\"${packageRelNs}\"><Relationship Id=\"rId1\" Type=\"${relNs}/officeDocument\" Target=\"xl/workbook.xml\"/></Relationships>`\nconst workbookRels = `${xml}<Relationships xmlns=\"${packageRelNs}\"><Relationship Id=\"rId1\" Type=\"${relNs}/worksheet\" Target=\"worksheets/sheet1.xml\"/><Relationship Id=\"rId2\" Type=\"${relNs}/styles\" Target=\"styles.xml\"/></Relationships>`\n\n// A sheet name is at most 31 characters, without : \\ / ? * [ ]\nconst sheetName = (name: string) => name.replace(/[:\\\\/?*[\\]]/g, ' ').slice(0, 31).trim() || 'Sheet1'\n\nconst workbook = (name: string) =>\n  `${xml}<workbook xmlns=\"${mainNs}\" xmlns:r=\"${relNs}\"><sheets><sheet name=\"${escapeXml(sheetName(name))}\" sheetId=\"1\" r:id=\"rId1\"/></sheets></workbook>`\n\n// Style 0 is the default and 1 the bold header; each number format after them gets a style of its own, from 2.\nconst styles = (formats: string[]) => {\n  const numFmts = formats.map((code, index) => `<numFmt numFmtId=\"${164 + index}\" formatCode=\"${escapeXml(code)}\"/>`).join('')\n  const xfs = formats.map((_, index) => `<xf numFmtId=\"${164 + index}\" fontId=\"0\" fillId=\"0\" borderId=\"0\" xfId=\"0\" applyNumberFormat=\"1\"/>`).join('')\n  return `${xml}<styleSheet xmlns=\"${mainNs}\">${formats.length > 0 ? `<numFmts count=\"${formats.length}\">${numFmts}</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><left/><right/><top/><bottom/><diagonal/></border></borders><cellStyleXfs count=\"1\"><xf numFmtId=\"0\" fontId=\"0\" fillId=\"0\" borderId=\"0\"/></cellStyleXfs><cellXfs count=\"${2 + formats.length}\"><xf numFmtId=\"0\" fontId=\"0\" fillId=\"0\" borderId=\"0\" xfId=\"0\"/><xf numFmtId=\"0\" fontId=\"1\" fillId=\"0\" borderId=\"0\" xfId=\"0\" applyFont=\"1\"/>${xfs}</cellXfs><cellStyles count=\"1\"><cellStyle name=\"Normal\" xfId=\"0\" builtinId=\"0\"/></cellStyles></styleSheet>`\n}\n\nconst encoder = new TextEncoder()\n\nexport type XlsxSheet = {\n  /** The sheet's name: the resource's label. */\n  name: string\n  headers: string[]\n  /** Each column's width in characters. */\n  widths: number[]\n}\n\n/**\n * Writes a one-sheet .xlsx file as it goes, handing each compressed piece to `onChunk`: a bold, frozen header row, then\n * `rows` as often as they come, and `finish` once. Text is written inline in its cell rather than in a table of shared\n * strings, so the writer holds no more than the rows it is given.\n */\nexport const createXlsxWriter = (sheet: XlsxSheet, onChunk: (chunk: Uint8Array, final: boolean) => void) => {\n  const zip = new Zip((error, chunk, final) => {\n    if (error) throw error\n    onChunk(chunk, final)\n  })\n  const add = (path: string, text: string) => {\n    const file = new ZipDeflate(path, { level: 6 })\n    zip.add(file)\n    file.push(encoder.encode(text), true)\n  }\n  add('[Content_Types].xml', contentTypes)\n  add('_rels/.rels', rootRels)\n  add('xl/workbook.xml', workbook(sheet.name))\n  add('xl/_rels/workbook.xml.rels', workbookRels)\n\n  const worksheet = new ZipDeflate('xl/worksheets/sheet1.xml', { level: 6 })\n  zip.add(worksheet)\n  const cols = sheet.widths.map((width, index) => `<col min=\"${index + 1}\" max=\"${index + 1}\" width=\"${width}\" customWidth=\"1\"/>`).join('')\n  const frozen = '<sheetViews><sheetView workbookViewId=\"0\"><pane ySplit=\"1\" topLeftCell=\"A2\" activePane=\"bottomLeft\" state=\"frozen\"/></sheetView></sheetViews>'\n  const header = `<row r=\"1\">${sheet.headers.map((text, index) => textCell(`${columnLetters(index)}1`, text, ' s=\"1\"')).join('')}</row>`\n  worksheet.push(encoder.encode(`${xml}<worksheet xmlns=\"${mainNs}\">${frozen}${cols ? `<cols>${cols}</cols>` : ''}<sheetData>${header}`))\n\n  const letters = sheet.headers.map((_, index) => columnLetters(index))\n  const formats: string[] = []\n  const styleOf = (format: string) => {\n    const index = formats.indexOf(format)\n    if (index >= 0) return index + 2\n    formats.push(format)\n    return formats.length + 1\n  }\n  const cellXml = (cell: Cell, ref: string) => {\n    switch (cell.kind) {\n      case 'empty':\n        return ''\n      case 'text':\n        return textCell(ref, cell.value)\n      case 'boolean':\n        return `<c r=\"${ref}\" t=\"b\"><v>${cell.value ? 1 : 0}</v></c>`\n      case 'number':\n        return `<c r=\"${ref}\"${cell.format ? ` s=\"${styleOf(cell.format)}\"` : ''}><v>${cell.value}</v></c>`\n    }\n  }\n\n  let rowNumber = 1\n  const rows = (cells: Cell[][]) => {\n    let text = ''\n    for (const row of cells) {\n      rowNumber += 1\n      if (rowNumber > xlsxMaxRows + 1) throw new Error(`A sheet holds at most ${xlsxMaxRows} rows`)\n      text += `<row r=\"${rowNumber}\">${row.map((cell, index) => cellXml(cell, `${letters[index]}${rowNumber}`)).join('')}</row>`\n    }\n    worksheet.push(encoder.encode(text))\n  }\n\n  const finish = () => {\n    worksheet.push(encoder.encode('</sheetData></worksheet>'), true)\n    add('xl/styles.xml', styles(formats))\n    zip.end()\n  }\n\n  return { rows, finish }\n}\n","import type { RelatedLabels } from '@protobase/client'\nimport { csvText, xlsxCell, type ExportColumn, type ExportMode } from './cells'\nimport { csvField, csvLine, csvTextField, utf8Bom } from './csv'\nimport { createXlsxWriter } from './xlsx'\n\nexport type ExportFormat = 'xlsx' | 'csv'\n\n/** What a file is built from, everything plain data so it can be posted to a worker. */\nexport type ExportPlan = {\n  format: ExportFormat\n  mode: ExportMode\n  /** The resource's label, which names the sheet. */\n  name: string\n  columns: ExportColumn[]\n}\n\nexport type ExportRecord = Record<string, unknown>\n\n// Fields whose CSV text is free text someone typed, which a spreadsheet could take for a formula.\nconst typedText = new Set(['text', 'uuid', 'enum', 'relation', 'file', 'json', 'currency', 'country'])\n\nconst minWidth = 8\nconst maxWidth = 60\n\n/** Each column's width in characters, room for its header and the longest value of the first page as shown. */\nexport const columnWidths = (columns: ExportColumn[], records: ExportRecord[], labels: RelatedLabels) =>\n  columns.map((column) => {\n    const longest = Math.max(column.header.length, ...records.map((record) => csvText(column, record[column.name], labels, 'shown').length))\n    return Math.min(maxWidth, Math.max(minWidth, longest + 2))\n  })\n\nconst createCsvBuilder = (plan: ExportPlan, onChunk: (chunk: Uint8Array) => void) => {\n  const encoder = new TextEncoder()\n  onChunk(utf8Bom)\n  onChunk(encoder.encode(csvLine(plan.columns.map((column) => csvField(column.header)))))\n  const field = (column: ExportColumn, record: ExportRecord, labels: RelatedLabels) => {\n    const text = csvText(column, record[column.name], labels, plan.mode)\n    return typedText.has(column.field.type) ? csvTextField(text) : csvField(text)\n  }\n  return {\n    page: (records: ExportRecord[], labels: RelatedLabels) => {\n      onChunk(encoder.encode(records.map((record) => csvLine(plan.columns.map((column) => field(column, record, labels)))).join('')))\n    },\n    finish: () => undefined,\n  }\n}\n\n// The columns' widths come from the first page, so the sheet starts with it.\nconst createXlsxBuilder = (plan: ExportPlan, onChunk: (chunk: Uint8Array) => void) => {\n  let writer: ReturnType<typeof createXlsxWriter> | undefined\n  const start = (records: ExportRecord[], labels: RelatedLabels) =>\n    createXlsxWriter({ name: plan.name, headers: plan.columns.map((column) => column.header), widths: columnWidths(plan.columns, records, labels) }, onChunk)\n  return {\n    page: (records: ExportRecord[], labels: RelatedLabels) => {\n      writer ??= start(records, labels)\n      writer.rows(records.map((record) => plan.columns.map((column) => xlsxCell(column, record[column.name], labels, plan.mode))))\n    },\n    finish: () => {\n      writer ??= start([], {})\n      writer.finish()\n    },\n  }\n}\n\n/**\n * Builds an export file page by page: `page` with each page of records and the names of the records their relations\n * point at, then `finish` once. Each piece of the file goes to `onChunk` as soon as it is made.\n */\nexport const createExportBuilder = (plan: ExportPlan, onChunk: (chunk: Uint8Array) => void) =>\n  plan.format === 'csv' ? createCsvBuilder(plan, onChunk) : createXlsxBuilder(plan, onChunk)\n","import type { RelatedLabels } from '@protobase/client'\nimport type { Locale } from '@protobase/schema/internal'\nimport { createExportBuilder, type ExportPlan, type ExportRecord } from './builder'\nimport { text } from './messages'\n\n/** What the page sends the worker that builds a file, one message after the other. */\nexport type ToBuilder = { kind: 'start'; plan: ExportPlan; locale: Locale } | { kind: 'page'; records: ExportRecord[]; labels: RelatedLabels } | { kind: 'finish' }\n\n/** The worker's answer to each message: the bytes of the file it made from it, which may be none. */\nexport type FromBuilder = { bytes: Uint8Array }\n\n/** Builds a file from messages, each answered with the bytes it adds to the file. */\nexport type BuilderPort = { send: (message: ToBuilder) => Promise<Uint8Array>; close: () => void }\n\nconst joined = (chunks: Uint8Array[]) => {\n  const bytes = new Uint8Array(chunks.reduce((size, chunk) => size + chunk.length, 0))\n  let offset = 0\n  for (const chunk of chunks) {\n    bytes.set(chunk, offset)\n    offset += chunk.length\n  }\n  return bytes\n}\n\n/** Handles one message at a time, as the worker does, returning the bytes it made; used by the worker and by tests. */\nexport const createBuilderHandler = () => {\n  let builder: ReturnType<typeof createExportBuilder> | undefined\n  let chunks: Uint8Array[] = []\n  return (message: ToBuilder) => {\n    if (message.kind === 'start') builder = createExportBuilder(message.plan, (chunk) => chunks.push(chunk))\n    else if (!builder) throw new Error('The export was not started')\n    else if (message.kind === 'page') builder.page(message.records, message.labels)\n    else builder.finish()\n    const bytes = joined(chunks)\n    chunks = []\n    return bytes\n  }\n}\n\n/** A port that builds on the page itself, for tests and stories. */\nexport const createInlinePort = (): BuilderPort => {\n  const handle = createBuilderHandler()\n  return { send: async (message) => handle(message), close: () => undefined }\n}\n\n/**\n * A port to a Web Worker that builds the file, so compressing it never holds up the page. The worker answers messages\n * in the order they came; an error in it fails every message still waiting.\n */\nexport const createWorkerPort = (): BuilderPort => {\n  const worker = new Worker(new URL('./export-worker.ts', import.meta.url), { type: 'module', name: 'protobase-export' })\n  const waiting: Array<{ resolve: (bytes: Uint8Array) => void; reject: (error: Error) => void }> = []\n  worker.onmessage = (event: MessageEvent<FromBuilder>) => waiting.shift()?.resolve(event.data.bytes)\n  worker.onerror = (event) => {\n    event.preventDefault()\n    const error = new Error(text('couldNotBuild', event.message))\n    for (const entry of waiting.splice(0)) entry.reject(error)\n  }\n  return {\n    send: (message) => new Promise((resolve, reject) => {\n      waiting.push({ resolve, reject })\n      worker.postMessage(message)\n    }),\n    close: () => worker.terminate(),\n  }\n}\n","/// <reference lib=\"webworker\" />\nimport { setFallbackLocale } from '../../locale/active-locale'\nimport { createBuilderHandler, type FromBuilder, type ToBuilder } from './builder-port'\n\n// Builds an export file off the page's thread: each message's bytes go back as they are made, moved rather than copied.\nconst handle = createBuilderHandler()\nconst scope = self as unknown as DedicatedWorkerGlobalScope\n\n// The shown values are written in the page's language, which the start of each file names.\nscope.onmessage = (event: MessageEvent<ToBuilder>) => {\n  if (event.data.kind === 'start') setFallbackLocale(event.data.locale)\n  const bytes = handle(event.data)\n  scope.postMessage({ bytes } satisfies FromBuilder, [bytes.buffer])\n}\n"],"ignoreList":[12],"mappings":"YACA,IAAaK,GAAa,EAAe,IAAoCC,IAASC,IAAUA,ECI5FC,EAAmB,KAIVC,MAAoCD,EAGpCE,EAAqB,GAAmB,CACnD,EAAWC,CACb,EAWMC,EAAqC,CAAE,GAAI,QAAS,GAAI,OAAQ,EAGzDC,MAAkBD,EAAWH,EAAa,GC1BjDK,kBAAQ,IAAI,IAGLC,GAAmB,EAAa,IAAgC,CAC3E,IAAMC,EAAMH,EAAU,EAChBI,EAAK,GAAGD,EAAI,GAAGE,IAErB,OADKJ,EAAM,IAAIG,CAAE,GAAGH,EAAM,IAAIG,EAAIE,EAAKH,CAAG,CAAC,EACpCF,EAAM,IAAIG,CAAE,CACrB,ECKaG,EAAqD,IAC5C,EAAO,GAAGC,IAAiC,CAC7D,IAAMC,EAAWC,EAAUd,EAAa,EAAE,CAAOQ,GACjD,OAAO,OAAOK,GAAY,WAAcA,EAA6C,GAAGD,CAAM,EAAKC,CACrG,ECjBWtB,EAAOoB,EAAe,CACjC,GAAI,CACF,MAAO,EAAe,IAAiB,GAAGK,EAAM,GAAGC,EAAM,MAAQ,SACjE,UAAY,GAAkB,SAASD,EAAM,OAC7C,WAAa,GAAkB,GAAGA,EAAM,QACxC,WAAa,GAAkB,GAAGA,EAAM,UACxC,SAAW,GAAkB,GAAGA,EAAM,QACtC,QAAU,GAAkB,GAAGA,EAAM,QACrC,QAAS,UACX,EACA,GAAI,CACF,MAAO,EAAe,IAAiB,GAAGA,EAAM,GAAGC,EAAM,MAAQ,UACjE,UAAY,GAAkB,YAAYD,EAAM,QAChD,WAAa,GAAkB,GAAGA,EAAM,YACxC,WAAa,GAAkB,GAAGA,EAAM,cACxC,SAAW,GAAkB,GAAGA,EAAM,YACtC,QAAU,GAAkB,GAAGA,EAAM,YACrC,QAAS,SACX,CACF,CAAC,EChBYE,MAAmB,KAAK,eAAe,CAAC,CAAC,gBAAgB,CAAC,CAAC,SAElEC,kBAAe,IAAI,IAEnBC,EAAe,GAAiB,CACpC,IAAMC,EAAQF,EAAa,IAAIG,CAAI,EACnC,GAAID,EAAO,OAAOA,EAClB,IAAME,EAAS,IAAI,KAAK,eAAe,QAAS,CAAE,SAAUD,EAAM,UAAW,MAAO,KAAM,UAAW,MAAO,UAAW,IAAK,UAAW,KAAM,UAAW,OAAQ,UAAW,OAAQ,SAAU,CAAC,EAE9L,OADAH,EAAa,IAAIG,EAAMC,CAAM,EACtBA,CACT,EAGMC,GAAa,EAAY,IAAiB,CAC9C,IAAMC,EAAQ,OAAO,YAAYL,EAAYE,CAAI,CAAC,CAAC,cAAcI,CAAE,CAAC,CAAC,IAAK,GAAS,CAACC,EAAK,KAAMA,EAAK,KAAK,CAAC,CAAC,EAC3G,MAAO,CAAE,KAAM,OAAOF,EAAM,IAAI,EAAG,MAAO,OAAOA,EAAM,KAAK,EAAG,IAAK,OAAOA,EAAM,GAAG,EAAG,KAAM,OAAOA,EAAM,IAAI,EAAG,OAAQ,OAAOA,EAAM,MAAM,EAAG,OAAQ,OAAOA,EAAM,MAAM,CAAE,CAC9K,EAGaG,GAAc,EAAY,IAAiB,CACtD,IAAMC,EAAQL,EAAUE,EAAIJ,CAAI,EAEhC,OADc,KAAK,IAAIO,EAAM,KAAMA,EAAM,MAAQ,EAAGA,EAAM,IAAKA,EAAM,KAAMA,EAAM,OAAQA,EAAM,MACxF,EAAQ,KAAK,MAAMH,EAAK,GAAI,EAAI,GACzC,ECtBMI,IADc,EAAc,QAA8CxB,EAAa,QAAQyB,IAAS,GAAQ,IAAI,KAAK,eAAexB,EAAK,CAAE,GAAGyB,EAAS,SAAU,KAAM,CAAC,CAAC,EACvK,CAAW,MAAO,CAAE,IAAK,UAAW,MAAO,QAAS,KAAM,SAAU,CAAC,EAOpEC,EAAc,GAAeH,EAAI,CAAC,CAAC,OAAOJ,CAAE,EAInDQ,EAAgB,GACpB5B,EAAa,SAASgB,IAAS,IAAS,CACtC,IAAK,IAAI,KAAK,eAAef,EAAK,CAAE,IAAK,UAAW,MAAO,QAAS,KAAM,UAAW,SAAUe,CAAK,CAAC,EACrG,KAAM,IAAI,KAAK,eAAef,EAAK,CAAE,KAAM,UAAW,OAAQ,UAAW,OAAQ,GAAO,SAAUe,CAAK,CAAC,CAC1G,EAAE,EAGSa,GAAkB,EAAY,EAAOjB,EAAW,IAAM,CACjE,IAAMkB,EAAUF,EAAaZ,CAAI,EACjC,MAAO,GAAGc,EAAQ,IAAI,OAAOV,CAAE,EAAE,IAAIU,EAAQ,KAAK,OAAOV,CAAE,GAC7D,EA8BMW,MAAiB/B,EAAa,WAAa,GAAQ,IAAI,KAAK,mBAAmBC,EAAK,CAAE,QAAS,MAAO,CAAC,CAAC,EAExG+B,EAAsD,CAC1D,CAAC,OAAQ,OAAU,EACnB,CAAC,QAAS,MAAS,EACnB,CAAC,MAAO,KAAM,EACd,CAAC,OAAQ,IAAI,EACb,CAAC,SAAU,EAAE,CACf,EAGaC,EAAsB,GAAoB,CACrD,IAAMC,EAAO,KAAK,IAAIC,CAAO,EACvB,CAACC,EAAMC,GAAQL,EAAM,MAAM,EAAGK,KAAUH,GAAQG,CAAI,GAAK,CAAC,SAAU,CAAC,EAE3E,OADID,IAAS,UAAYF,EAAO,GAAWhD,EAAK,SAAS,EAClD6C,EAAS,CAAC,CAAC,OAAO,CAAC,KAAK,KAAKI,CAAO,EAAI,KAAK,MAAMD,EAAOG,CAAI,EAAGD,CAAI,CAC9E,ECvEajD,EAAOkB,EAAe,CACjC,GAAI,CACF,IAAK,MACL,GAAI,KACJ,QAAU,GAAiB,YAAYW,IACvC,YAAa,cACf,EACA,GAAI,CACF,IAAK,KACL,GAAI,MACJ,QAAU,GAAiB,cAAcA,IACzC,YAAa,mBACf,CACF,CAAC,ECRYuB,EAAgB,GAC3B,OAAO/C,GAAU,YAAYA,GAAkB,OAAQA,EAA4B,KAAQ,SAEhFgD,EAAe,GAC1B,OAAOhD,GAAU,YAAYA,GAAkB,OAAQA,EAA6C,UAAU,OAAU,SAG7GiD,EAAa,GAAmB,CAC3C,GAAID,EAAYhD,CAAK,EAAG,MAAO,CAAE,GAAGA,EAAM,SAAS,KAAM,GAAIA,EAAM,SAAW,CAAE,IAAKA,EAAM,OAAQ,EAAI,UAAWA,EAAM,SAAS,SAAU,EAC3I,GAAK+C,EAAa/C,CAAK,EAEvB,MADI,YAAaA,EAAc,CAAE,KAAMJ,EAAK,aAAa,EAAG,KAAM,GAAI,QAAS,EAAc,EACtFI,CACT,ECXMkD,GAAW,EAAc,IAA0B,GAAGC,EAAM,QAAU,KAAKC,IAAOD,EAAM,QAAU,KAM3FE,GAAgB,EAAmB,EAAgB,EAAwB,CAAC,EAAG,EAAOjC,EAAW,EAAG,EAAM,KAAK,IAAI,IAAM,CACpI,GAAIpB,GAAU,MAA+BA,IAAU,GAAI,MAAO,IAClE,OAAQsD,EAAM,KAAd,CACE,IAAK,UACH,OAAezD,EAARG,EAAgB,MAAiB,IAAI,EAC9C,IAAK,OACH,OAAOiD,EAAUjD,CAAK,CAAC,EAAE,MAAQ,IACnC,IAAK,OACH,OAAOF,EAAU,OAAOE,CAAK,EAAGmD,EAAM,WAAW,EACnD,IAAK,YAAa,CAChB,IAAMvB,EAAK,KAAK,MAAM,OAAO5B,CAAK,CAAC,EACnC,OAAOmD,EAAM,SAAW,WAAaV,EAAmB,KAAK,OAAOc,EAAM3B,GAAM,GAAI,CAAC,EAAIS,EAAeT,EAAIJ,CAAI,CAClH,CACA,IAAK,OACH,OAAOW,EAAW,KAAK,MAAM,OAAOnC,CAAK,CAAC,CAAC,EAC7C,IAAK,UAAW,CACd,IAAMoD,EAAOD,EAAM,WAAa,IAAA,GAAY,OAAOnD,CAAK,EAAI,OAAOA,CAAK,CAAC,CAAC,QAAQmD,EAAM,QAAQ,EAEhG,OADIA,EAAM,SAAW,UAAkB,GAAG,OAAOnD,CAAK,EAAE,GACjDkD,EAAQ,OAAOE,CAAI,CAAC,CAAC,eAAe9C,EAAU,EAAG,CAAE,sBAAuB6C,EAAM,UAAY,EAAG,sBAAuBA,EAAM,UAAY,EAAG,CAAC,EAAGA,CAAK,CAC7J,CACA,IAAK,UACL,IAAK,SACH,OAAOD,EAAQ,OAAOlD,CAAK,EAAGmD,CAAK,EACrC,QACE,OAAO,OAAOnD,GAAU,SAAW,KAAK,UAAUA,CAAK,EAAI,OAAOA,CAAK,CAC3E,CACF,ECzBMwD,EAAc,CAAE,KAAM,OAAQ,EAC9BJ,EAAQ,IAAyB,CAAE,KAAM,OAAQ,OAAM,GAEvDK,EAAW,GAAmBzD,GAAU,MAA+BA,IAAU,GAEjF0D,GAAiB,EAAsB,EAAgB,IAA0B3D,EAAO4D,EAAO,KAAK,GAAG,OAAO3D,CAAK,IAAM,OAAOA,CAAK,EAGrI4D,GAAY,EAAgB,IAC3Bb,EAAa/C,CAAK,EAChB6D,IAAS,MAAQ7D,EAAM,IAAOiD,EAAUjD,CAAK,CAAC,EAAE,MAAQA,EAAM,IADpC,OAAOA,CAAK,EAKlC8D,GAAW,EAAsB,EAAgB,EAAuB,IAAqB,CACxG,GAAIL,EAAQzD,CAAK,EAAG,MAAO,GAC3B,GAAM,CAAE,QAAO,SAAU2D,EAKzB,OAJIL,EAAM,OAAS,OAAeM,EAAS5D,EAAO6D,CAAI,EAClDP,EAAM,OAAS,WAAmBO,IAAS,QAAUH,EAAcC,EAAQ3D,EAAOD,CAAM,EAAI,OAAOC,CAAK,EACxG6D,IAAS,QAAgBR,EAAaC,EAAOtD,EAAO,CAAE,GAAGmD,EAAO,OAAQ,IAAA,EAAU,CAAC,EACnF,OAAOnD,GAAU,SAAiB,KAAK,UAAUA,CAAK,EACnD,OAAOA,CAAK,CACrB,EAMM+D,EAAe,GAAenC,EAAK,MAAW,MAE9CoC,EAAc,CAAE,MAAO,CAAE,KAAM,aAAc,UAAW,mBAAoB,EAAG,IAAK,CAAE,KAAM,aAAc,UAAW,qBAAsB,CAAE,EAG7IC,GAAW,GAA8B,CAAC,GAAIC,GAAS,EAAG,CAAC,CAAC,IAAK,GAAS,KAAKC,GAAM,CAAC,CAAC,KAAK,EAAE,EAGvFC,EAAgB,GAA0B,CACrD,GAAIjB,EAAM,SAAW,UAAW,MAAO,aACvC,IAAMkB,EAASlB,EAAM,WAAa,IAAA,GAAY,UAAYA,EAAM,SAAW,EAAI,SAAS,IAAI,OAAOA,EAAM,QAAQ,IAAM,QACjHmB,EAAO,GAAGL,GAAQd,EAAM,MAAM,IAAIkB,IAASJ,GAAQd,EAAM,MAAM,IACrE,OAAOmB,IAAS,UAAY,IAAA,GAAYA,CAC1C,EAGMC,GAAc,EAAsB,EAAgB,IAA2B,CACnF,IAAMC,EAAS,OAAOxE,CAAK,EAE3B,GADI,CAAC,OAAO,SAASwE,CAAM,GACvBb,EAAO,MAAM,OAAS,UAAY,CAAC,OAAO,cAAca,CAAM,EAAG,OAAOpB,EAAK,OAAOpD,CAAK,CAAC,EAC9F,IAAMyB,EAASoC,IAAS,QAAUO,EAAaT,EAAO,KAAK,EAAI,IAAA,GAC/D,OAAOlC,EAAS,CAAE,KAAM,SAAU,MAAO+C,EAAQ,QAAO,EAAI,CAAE,KAAM,SAAU,MAAOA,CAAO,CAC9F,EAEMC,GAAY,EAA4B,EAAgB,EAAkB,IAAuB,CACrG,IAAM7C,EAAK,KAAK,MAAM,OAAO5B,CAAK,CAAC,EACnC,GAAI,OAAO,MAAM4B,CAAE,EAAG,OAAOwB,EAAK,OAAOpD,CAAK,CAAC,EAC/C,IAAM+B,EAAQ2C,IAAS,aAAeb,IAAS,QAAUjC,EAAKE,EAAWF,EAAIJ,CAAI,EAAII,EACrF,MAAO,CAAE,KAAM,SAAU,MAAOmC,EAAYhC,CAAK,EAAG,OAAQiC,EAAYH,EAAK,CAACa,EAAM,CACtF,EAGaC,GAAY,EAAsB,EAAgB,EAAuB,EAAkB,EAAOvD,EAAW,IAAY,CACpI,GAAIqC,EAAQzD,CAAK,EAAG,OAAOwD,EAC3B,GAAM,CAAE,SAAUG,EAClB,OAAQL,EAAM,KAAd,CACE,IAAK,UACH,MAAO,CAAE,KAAM,UAAW,MAAO,EAAQtD,CAAO,EAClD,IAAK,UACL,IAAK,SACL,IAAK,UACH,OAAOuE,EAAWZ,EAAQ3D,EAAO6D,CAAI,EACvC,IAAK,OACL,IAAK,YACH,OAAOY,EAASnB,EAAM,KAAMtD,EAAO6D,EAAMrC,CAAI,EAC/C,IAAK,WAEH,OADIqC,IAAS,QAAgBT,EAAKM,EAAcC,EAAQ3D,EAAOD,CAAM,CAAC,EAC/D,OAAOC,GAAU,SAAW,CAAE,KAAM,SAAU,OAAM,EAAIoD,EAAK,OAAOpD,CAAK,CAAC,EACnF,QACE,OAAOoD,EAAKU,EAAQH,EAAQ3D,EAAOD,EAAQ8D,CAAI,CAAC,CACpD,CACF,EC7Fae,EAAU,IAAI,WAAW,CAAC,IAAM,IAAM,GAAI,CAAC,EAElDC,EAAc,WAIdC,GAAe,eAGRC,EAAY,GAAmBF,EAAY,KAAK7E,CAAK,EAAI,IAAIA,EAAM,WAAW,IAAK,IAAI,EAAE,GAAKA,EAG9FgF,GAAgB,GAAkBD,EAASD,GAAa,KAAK9E,CAAK,EAAI,IAAIA,IAAUA,CAAK,EAGzFiF,GAAW,GAAqB,GAAGC,EAAO,KAAK,GAAG,EAAE,MCcjE,IAAIC,EAAK,WAAYC,EAAM,YAAaC,GAAM,WAE1CC,GAAO,IAAIH,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAgB,EAAG,EAAoB,CAAC,CAAC,EAE5II,GAAO,IAAIJ,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAiB,EAAG,CAAC,CAAC,EAEnIK,GAAO,IAAIL,EAAG,CAAC,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAE,CAAC,EAEhFM,GAAO,SAAU,EAAI,EAAO,CAE5B,IAAK,IADDC,EAAI,IAAIN,EAAI,EAAE,EACTO,EAAI,EAAGA,EAAI,GAAI,EAAEA,EACtB,EAAEA,GAAK,GAAS,GAAKC,EAAGD,EAAI,GAIhC,IAAK,IADDE,EAAI,IAAIR,GAAIK,EAAE,GAAG,EACZC,EAAI,EAAGA,EAAI,GAAI,EAAEA,EACtB,IAAK,IAAIG,EAAIJ,EAAEC,GAAIG,EAAIJ,EAAEC,EAAI,GAAI,EAAEG,EAC/B,EAAEA,GAAOA,EAAIJ,EAAEC,IAAO,EAAKA,EAGnC,MAAO,CAAK,IAAM,GAAE,CACxB,EACII,GAAKN,GAAKH,GAAM,CAAC,EAAGU,GAAKD,GAAG,EAAGE,GAAQF,GAAG,EAE9C,GAAG,IAAM,IAAK,GAAM,KAAO,GAC3B,IAAIG,GAAKT,GAAKF,GAAM,CAAC,EAAQW,GAAG,EAGhC,IAAK,IAH8BC,GAAQD,GAAG,EAE1CE,GAAM,IAAIhB,EAAI,KAAK,EACdO,EAAI,EAAGA,EAAI,MAAO,EAAEA,EAAG,CAE5B,IAAIU,GAAMV,EAAI,QAAW,GAAOA,EAAI,QAAW,EAC/C,GAAMU,EAAI,QAAW,GAAOA,EAAI,QAAW,EAC3C,GAAMA,EAAI,QAAW,GAAOA,EAAI,OAAW,EAC3C,GAAIV,KAAQU,EAAI,QAAW,GAAOA,EAAI,MAAW,IAAO,CAC5D,CAuDA,IAAK,IAnDDC,GAAQ,SAAU,EAAI,EAAI,EAAG,CAO7B,IANA,IAAIC,EAAIC,EAAG,OAEP,EAAI,EAEJC,EAAI,IAAIrB,EAAIsB,CAAE,EAEX,EAAIH,EAAG,EAAE,EACRC,EAAG,IACH,EAAEC,EAAED,EAAG,GAAK,GAGpB,IAAIG,EAAK,IAAIvB,EAAIsB,CAAE,EACnB,IAAK,EAAI,EAAG,EAAIA,EAAI,EAAE,EAClB,EAAG,GAAMC,EAAG,EAAI,GAAKF,EAAE,EAAI,IAAO,EAEtC,IAAIG,EACJ,GAAIf,EAAG,CAEH,EAAK,IAAIT,EAAI,GAAKsB,CAAE,EAEpB,IAAIG,EAAM,GAAKH,EACf,IAAK,EAAI,EAAG,EAAIH,EAAG,EAAE,EAEjB,GAAIC,EAAG,GAQH,IAAK,IANDM,EAAM,GAAK,EAAKN,EAAG,GAEnBO,EAAML,EAAKF,EAAG,GAEdQ,EAAI,EAAGR,EAAG,GAAK,EAAE,IAAMO,EAElBE,EAAID,GAAM,GAAKD,GAAO,EAAIC,GAAKC,EAAG,EAAED,EAEzC,EAAGZ,GAAIY,IAAMH,GAAOC,CAIpC,MAGI,IADA,EAAK,IAAI1B,EAAImB,CAAC,EACT,EAAI,EAAG,EAAIA,EAAG,EAAE,EACbC,EAAG,KACH,EAAG,GAAKJ,GAAI,EAAGI,EAAG,GAAK,EAAE,KAAQ,GAAKA,EAAG,IAIrD,OAAOI,CACX,GAEIM,EAAM,IAAI/B,EAAG,GAAG,EACXQ,EAAI,EAAGA,EAAI,IAAK,EAAEA,EACvB,EAAIA,GAAK,EACb,IAAK,IAAIA,EAAI,IAAKA,EAAI,IAAK,EAAEA,EACzB,EAAIA,GAAK,EACb,IAAK,IAAIA,EAAI,IAAKA,EAAI,IAAK,EAAEA,EACzB,EAAIA,GAAK,EACb,IAAK,IAAIA,EAAI,IAAKA,EAAI,IAAK,EAAEA,EACzB,EAAIA,GAAK,EAGb,IAAK,IADDwB,GAAM,IAAIhC,EAAG,EAAE,EACVQ,EAAI,EAAGA,EAAI,GAAI,EAAEA,EACtB,GAAIA,GAAK,EAEb,IAAIyB,GAAoB,gBAAKF,EAAK,EAAG,CAAC,EAElCG,GAAoB,gBAAKF,GAAK,EAAG,CAAC,EAqBlCG,GAAO,SAAU,EAAG,CAAE,OAASC,EAAI,GAAK,EAAK,CAAG,EAGhDC,GAAM,SAAU,EAAG,EAAG,EAAG,CAMzB,OALIjB,GAAK,MAAQA,EAAI,KACjB,EAAI,IACJkB,GAAK,MAAQA,EAAIT,EAAE,UACnB,EAAIA,EAAE,QAEH,IAAI7B,EAAG6B,EAAE,SAAST,EAAGkB,CAAC,CAAC,CAClC,EAsBIC,GAAK,CACL,iBACA,qBACA,yBACA,mBACA,kBACA,qBAEA,cACA,qBACA,uBACA,8BACA,oBACA,mBACA,kBAEJ,EAEIC,EAAM,SAAU,EAAK,EAAK,EAAI,CAC9B,IAAIF,EAAQ,MAAMG,GAAOF,GAAGG,EAAI,EAIhC,GAHA,EAAE,KAAOA,EACL,MAAM,mBACN,MAAM,kBAAkBJ,EAAGE,CAAG,EAC9B,CAACG,EACD,MAAML,EACV,OAAOA,CACX,EAuLIM,EAAQ,SAAU,EAAG,EAAG,EAAG,CAC3B,IAAMR,EAAI,EACV,IAAIS,EAAKT,EAAI,EAAK,EAClB,EAAES,IAAMhB,EACR,EAAEgB,EAAI,IAAMhB,GAAK,CACrB,EAEIiB,EAAU,SAAU,EAAG,EAAG,EAAG,CAC7B,IAAMV,EAAI,EACV,IAAIS,EAAKT,EAAI,EAAK,EAClB,EAAES,IAAMhB,EACR,EAAEgB,EAAI,IAAMhB,GAAK,EACjB,EAAEgB,EAAI,IAAMhB,GAAK,EACrB,EAEIkB,GAAQ,SAAU,EAAG,EAAI,CAGzB,IAAK,IADDC,EAAI,CAAC,EACAxC,EAAI,EAAGA,EAAIyC,EAAE,OAAQ,EAAEzC,EACxByC,EAAEzC,IACFwC,EAAE,KAAK,CAAE,EAAGxC,EAAG,EAAGyC,EAAEzC,EAAG,CAAC,EAEhC,IAAIY,EAAI4B,EAAE,OACNE,EAAKF,EAAE,MAAM,EACjB,GAAI,CAAC5B,EACD,MAAO,CAAE,EAAG+B,GAAI,EAAG,CAAE,EACzB,GAAI/B,GAAK,EAAG,CACR,IAAIS,EAAI,IAAI7B,EAAGgD,EAAE,EAAE,CAAC,EAAI,CAAC,EAEzB,MADA,GAAEA,EAAE,EAAE,CAAC,GAAK,EACL,CAAE,EAAGnB,EAAG,EAAG,CAAE,CACxB,CACAmB,EAAE,KAAK,SAAU,EAAG,EAAG,CAAE,OAAOI,EAAE,EAAI7C,EAAE,CAAG,CAAC,EAG5CyC,EAAE,KAAK,CAAE,EAAG,GAAI,EAAG,KAAM,CAAC,EAC1B,IAAI1B,EAAI0B,EAAE,GAAItC,EAAIsC,EAAE,GAAIK,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAO7C,IANA,EAAE,GAAK,CAAE,EAAG,GAAI,EAAGjC,EAAE,EAAIZ,EAAE,EAAM,IAAM,GAAE,EAMlC4C,GAAMlC,EAAI,GACb,EAAI4B,EAAEA,EAAEK,EAAG,CAAC,EAAIL,EAAEO,EAAG,CAAC,EAAI,IAAO,KACjC,EAAIP,EAAEK,GAAMC,GAAMN,EAAEK,EAAG,CAAC,EAAIL,EAAEO,EAAG,CAAC,EAAI,IAAO,KAC7C,EAAE,KAAQ,CAAE,EAAG,GAAI,EAAGjC,EAAE,EAAIZ,EAAE,EAAM,IAAM,GAAE,EAGhD,IAAK,IADD8C,EAASN,EAAG,EAAE,CAAC,EACV1C,EAAI,EAAGA,EAAIY,EAAG,EAAEZ,EACjB0C,EAAG1C,EAAE,CAAC,EAAIgD,IACV,EAASN,EAAG1C,EAAE,CAAC,GAGvB,IAAIiD,EAAK,IAAIxD,EAAIuD,EAAS,CAAC,EAEvBE,EAAMC,GAAGX,EAAEM,EAAK,GAAIG,EAAI,CAAC,EAC7B,GAAIC,EAAMnC,EAAI,CAIV,IAAIf,EAAI,EAAGoD,EAAK,EAEZC,EAAMH,EAAMnC,EAAIuC,EAAM,GAAKD,EAE/B,IADAX,EAAG,KAAK,SAAU,EAAG,EAAG,CAAE,OAAOO,EAAGlD,EAAE,GAAKkD,EAAGL,EAAE,IAAMA,EAAE,EAAI7C,EAAE,CAAG,CAAC,EAC3DC,EAAIY,EAAG,EAAEZ,EAAG,CACf,IAAIuD,EAAOb,EAAG1C,EAAE,CAAC,EACjB,GAAIiD,EAAGM,GAAQxC,EACX,GAAMuC,GAAO,GAAMJ,EAAMD,EAAGM,IAC5B,EAAGA,GAAQxC,OAGX,KACR,CAEA,IADA,IAAOsC,EACAD,EAAK,GAAG,CACX,IAAII,EAAOd,EAAG1C,EAAE,CAAC,EACbiD,EAAGO,GAAQzC,EACX,GAAM,GAAMA,EAAK,EAAGyC,EAAK,GAAK,EAE9B,EAAExD,CACV,CACA,KAAOA,GAAK,GAAKoD,EAAI,EAAEpD,EAAG,CACtB,IAAIyD,EAAOf,EAAG1C,EAAE,CAAC,EACbiD,EAAGQ,IAAS1C,IACZ,EAAEkC,EAAGQ,GACL,EAAEL,EAEV,CACA,EAAMrC,CACV,CACA,MAAO,CAAE,EAAG,IAAIvB,EAAGyD,CAAE,EAAG,EAAGC,CAAI,CACnC,EAEIC,GAAK,SAAU,EAAG,EAAG,EAAG,CACxB,OAAOO,EAAE,GAAK,GACR,KAAK,IAAIP,GAAGO,EAAE,EAAG5C,EAAG2B,EAAI,CAAC,EAAGU,GAAGO,EAAE,EAAG5C,EAAG2B,EAAI,CAAC,CAAC,EAC5C,EAAEiB,EAAE,GAAKjB,CACpB,EAEIkB,GAAK,SAAU,EAAG,CAGlB,IAFA,IAAI/C,EAAIgD,EAAE,OAEHhD,GAAK,CAACgD,EAAE,EAAEhD,KAMjB,IAAK,IAJDiD,EAAK,IAAIpE,EAAI,EAAEmB,CAAC,EAEhBkD,EAAM,EAAGC,EAAMH,EAAE,GAAII,EAAM,EAC3BC,EAAI,SAAU,EAAG,CAAE,EAAG,KAAS5C,CAAG,EAC7BrB,EAAI,EAAGA,GAAKY,EAAG,EAAEZ,EACtB,GAAI4D,EAAE5D,IAAM+D,GAAO/D,GAAKY,EACpB,EAAEoD,MACD,CACD,GAAI,CAACD,GAAOC,EAAM,EAAG,CACjB,KAAOA,EAAM,IAAK,GAAO,IACrBC,EAAE,KAAK,EACPD,EAAM,IACNC,EAAED,EAAM,GAAOA,EAAM,IAAO,EAAK,MAAUA,EAAM,GAAM,EAAK,KAAK,EACjE,EAAM,EAEd,MACK,GAAIA,EAAM,EAAG,CAEd,IADAC,EAAEF,CAAG,EAAG,EAAEC,EACHA,EAAM,EAAG,GAAO,EACnBC,EAAE,IAAI,EACND,EAAM,IACNC,EAAID,EAAM,GAAM,EAAK,IAAI,EAAG,EAAM,EAC1C,CACA,KAAO,KACHC,EAAEF,CAAG,EACT,EAAM,EACN,EAAMH,EAAE5D,EACZ,CAEJ,MAAO,CAAE,EAAG6D,EAAG,SAAS,EAAGC,CAAG,EAAG,EAAGlD,CAAE,CAC1C,EAEIsD,GAAO,SAAU,EAAI,EAAI,CAEzB,IAAK,IADDpD,EAAI,EACCd,EAAI,EAAGA,EAAI6D,EAAG,OAAQ,EAAE7D,EAC7B,GAAKmE,EAAGnE,GAAK6D,EAAG7D,GACpB,OAAOc,CACX,EAGIsD,GAAQ,SAAU,EAAK,EAAK,EAAK,CAEjC,IAAIxD,EAAIyD,EAAI,OACRhC,EAAIV,GAAK2C,EAAM,CAAC,EACpB,EAAIjC,GAAKzB,EAAI,IACb,EAAIyB,EAAI,GAAKzB,GAAK,EAClB,EAAIyB,EAAI,GAAKkC,EAAIlC,GAAK,IACtB,EAAIA,EAAI,GAAKkC,EAAIlC,EAAI,GAAK,IAC1B,IAAK,IAAIrC,EAAI,EAAGA,EAAIY,EAAG,EAAEZ,EACrB,EAAIqC,EAAIrC,EAAI,GAAKqE,EAAIrE,GACzB,OAAQqC,EAAI,EAAIzB,GAAK,CACzB,EAEI4D,GAAO,SAAU,EAAK,EAAK,EAAO,EAAM,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAG,CACnEpC,EAAMmC,EAAK,IAAKE,CAAK,EACrB,EAAEC,EAAG,KAML,IAAK,IALDtE,EAAKmC,GAAMmC,EAAI,EAAE,EAAGC,EAAMvE,EAAG,EAAGwE,EAAMxE,EAAG,EACzCG,EAAKgC,GAAMsC,EAAI,EAAE,EAAGC,EAAMvE,EAAG,EAAGwE,EAAMxE,EAAG,EACzCyE,EAAKrB,GAAGgB,CAAG,EAAGM,EAAOD,EAAG,EAAGE,EAAMF,EAAG,EACpCG,EAAKxB,GAAGmB,CAAG,EAAGM,EAAOD,EAAG,EAAGE,EAAMF,EAAG,EACpCG,EAAS,IAAI7F,EAAI,EAAE,EACdO,EAAI,EAAGA,EAAIiF,EAAK,OAAQ,EAAEjF,EAC/B,EAAEsF,EAAOL,EAAKjF,GAAK,IACvB,IAAK,IAAIA,EAAI,EAAGA,EAAIoF,EAAK,OAAQ,EAAEpF,EAC/B,EAAEsF,EAAOF,EAAKpF,GAAK,IAGvB,IAFA,IAAIuF,EAAKhD,GAAM+C,EAAQ,CAAC,EAAGE,EAAMD,EAAG,EAAGE,EAAOF,EAAG,EAC7CG,EAAO,GACJA,EAAO,GAAK,CAACF,EAAI3F,GAAK6F,EAAO,IAAK,EAAEA,GAE3C,IAAIC,EAAQC,EAAK,GAAM,EACnBC,EAAQ3B,GAAKQ,EAAInD,CAAG,EAAI2C,GAAKW,EAAIrD,EAAG,EAAIvB,EACxC6F,EAAQ5B,GAAKQ,EAAIC,CAAG,EAAIT,GAAKW,EAAIC,CAAG,EAAI7E,EAAK,GAAK,EAAIyF,EAAOxB,GAAKoB,EAAQE,CAAG,EAAI,EAAIF,EAAO,IAAM,EAAIA,EAAO,IAAM,EAAIA,EAAO,IAClI,GAAIS,GAAM,GAAKJ,GAAQE,GAASF,GAAQG,EACpC,OAAO1B,GAAMG,EAAK3C,EAAGyC,EAAI,SAAS0B,EAAIA,EAAKH,CAAE,CAAC,EAClD,IAAII,EAAIC,EAAIC,EAAIC,EAEhB,GADA/D,EAAMmC,EAAK3C,EAAG,GAAKkE,EAAQD,EAAM,EAAG,GAAK,EACrCC,EAAQD,EAAO,CACf,EAAKlF,EAAKgE,EAAKC,EAAK,CAAC,EAAG,EAAKD,EAAK,EAAKhE,EAAKmE,EAAKC,EAAK,CAAC,EAAG,EAAKD,EAC/D,IAAIsB,GAAMzF,EAAK6E,EAAKC,EAAM,CAAC,EAC3BrD,EAAMmC,EAAK3C,EAAGsD,EAAM,GAAG,EACvB9C,EAAMmC,EAAK3C,EAAI,EAAGyD,EAAM,CAAC,EACzBjD,EAAMmC,EAAK3C,EAAI,GAAI8D,EAAO,CAAC,EAC3B,GAAK,GACL,IAAK,IAAI1F,EAAI,EAAGA,EAAI0F,EAAM,EAAE1F,EACxBoC,EAAMmC,EAAK3C,EAAI,EAAI5B,EAAGwF,EAAI3F,GAAKG,GAAG,EACtC,GAAK,EAAI0F,EAET,IAAK,IADDW,EAAO,CAACpB,EAAMG,CAAI,EACbkB,EAAK,EAAGA,EAAK,EAAG,EAAEA,EAEvB,IAAK,IADDC,EAAOF,EAAKC,GACPtG,EAAI,EAAGA,EAAIuG,EAAK,OAAQ,EAAEvG,EAAG,CAClC,IAAIwG,EAAMD,EAAKvG,GAAK,GACpBoC,EAAMmC,EAAK3C,EAAGwE,GAAII,EAAI,EAAG,GAAKhB,EAAIgB,GAC9BA,EAAM,KACNpE,EAAMmC,EAAK3C,EAAI2E,EAAKvG,IAAM,EAAK,GAAG,EAAG,GAAKuG,EAAKvG,IAAM,GAC7D,CAER,KAEI,GAAKyB,GAAK,EAAKF,EAAK,EAAKG,GAAK,EAAKF,GAEvC,IAAK,IAAIxB,EAAI,EAAGA,EAAIyG,EAAI,EAAEzG,EAAG,CACzB,IAAI0G,EAAMC,EAAK3G,GACf,GAAI0G,EAAM,IAAK,CACX,IAAIF,EAAOE,GAAO,GAAM,GACxBpE,EAAQiC,EAAK3C,EAAGoE,EAAGQ,EAAM,IAAI,EAAG,GAAKP,EAAGO,EAAM,KAC1CA,EAAM,IACNpE,EAAMmC,EAAK3C,EAAI8E,GAAO,GAAM,EAAE,EAAG,GAAK/G,GAAK6G,IAC/C,IAAII,EAAMF,EAAM,GAChBpE,EAAQiC,EAAK3C,EAAGsE,EAAGU,EAAI,EAAG,GAAKT,EAAGS,GAC9BA,EAAM,IACNtE,EAAQiC,EAAK3C,EAAI8E,GAAO,EAAK,IAAI,EAAG,GAAK9G,GAAKgH,GACtD,MAEItE,EAAQiC,EAAK3C,EAAGoE,EAAGU,EAAI,EAAG,GAAKT,EAAGS,EAE1C,CAEA,OADApE,EAAQiC,EAAK3C,EAAGoE,EAAG,IAAI,EAChBpE,EAAIqE,EAAG,IAClB,EAEIY,iBAAoB,IAAInH,GAAI,CAAC,MAAO,OAAQ,OAAQ,OAAQ,OAAQ,QAAS,QAAS,QAAS,OAAO,CAAC,EAEvGiD,iBAAmB,IAAInD,EAAG,CAAC,EAE3BsH,GAAO,SAAU,EAAK,EAAK,EAAM,EAAK,EAAM,EAAI,CAChD,IAAIlG,EAAImG,EAAG,GAAK1C,EAAI,OAChBhC,EAAI,IAAI7C,EAAGwH,EAAMpG,EAAI,GAAK,EAAI,KAAK,KAAKA,EAAI,GAAI,GAAKqG,CAAI,EAEzDhD,EAAI5B,EAAE,SAAS2E,EAAK3E,EAAE,OAAS4E,CAAI,EACnCC,EAAMH,EAAG,EACTzC,GAAOyC,EAAG,GAAK,GAAK,EACxB,GAAII,EAAK,CACD7C,IACA,EAAE,GAAKyC,EAAG,GAAK,GAenB,IAdA,IAAIK,EAAMP,GAAIM,EAAM,GAChBzD,EAAI0D,GAAO,GAAIxD,EAAIwD,EAAM,KACzBC,GAAS,GAAKC,GAAQ,EAEtBC,EAAOR,EAAG,GAAK,IAAItH,EAAI,KAAK,EAAG+H,EAAOT,EAAG,GAAK,IAAItH,EAAI4H,EAAQ,CAAC,EAC/DI,EAAQ,KAAK,KAAKH,EAAO,CAAC,EAAGI,EAAQ,EAAID,EACzCE,EAAM,SAAU,EAAG,CAAE,OAAQtD,EAAIrE,GAAMqE,EAAIrE,EAAI,IAAMyH,EAAUpD,EAAIrE,EAAI,IAAM0H,GAAUL,CAAO,EAG9FV,EAAO,IAAIjH,GAAI,IAAK,EAEpBgF,EAAK,IAAIjF,EAAI,GAAG,EAAGoF,EAAK,IAAIpF,EAAI,EAAE,EAElCmI,EAAO,EAAG3H,EAAK,EAAGD,EAAI+G,EAAG,GAAK,EAAGN,EAAK,EAAGoB,EAAKd,EAAG,GAAK,EAAGhB,EAAK,EAC3D/F,EAAI,EAAIY,EAAG,EAAEZ,EAAG,CAEnB,IAAI8H,EAAKH,EAAI3H,CAAC,EAEV+H,EAAO/H,EAAI,MAAOgI,EAAQR,EAAKM,GAKnC,GAJA,EAAKC,GAAQC,EACb,EAAKF,GAAMC,EAGPF,GAAM7H,EAAG,CAET,IAAIiI,EAAMrH,EAAIZ,EACd,IAAK4H,EAAO,KAAQnB,EAAK,SAAWwB,EAAM,KAAO,CAACf,GAAM,CACpD,EAAM1C,GAAKH,EAAKJ,EAAG,EAAG0C,EAAMjC,EAAIG,EAAI5E,EAAIwG,EAAIV,EAAI/F,EAAI+F,EAAIzB,CAAG,EAC3D,EAAK,EAAO,EAAK,EAAG,EAAKtE,EACzB,IAAK,IAAIG,EAAI,EAAGA,EAAI,IAAK,EAAEA,EACvB,EAAGA,GAAK,EACZ,IAAK,IAAIA,EAAI,EAAGA,EAAI,GAAI,EAAEA,EACtB,EAAGA,GAAK,CAChB,CAEA,IAAIW,EAAI,EAAG2B,EAAI,EAAGyF,GAAOtE,EAAGuE,EAAMJ,EAAOC,EAAQ,MACjD,GAAIC,EAAM,GAAKH,GAAMH,EAAI3H,EAAImI,CAAG,EAM5B,IALA,IAAIC,EAAO,KAAK,IAAI1E,EAAGuE,CAAG,EAAI,EAC1BI,EAAO,KAAK,IAAI,MAAOrI,CAAC,EAGxBsI,EAAK,KAAK,IAAI,IAAKL,CAAG,EACnBE,GAAOE,GAAQ,EAAEH,IAAQH,GAAQC,GAAO,CAC3C,GAAI3D,EAAIrE,EAAIc,IAAMuD,EAAIrE,EAAIc,EAAIqH,GAAM,CAEhC,IADA,IAAII,EAAK,EACFA,EAAKD,GAAMjE,EAAIrE,EAAIuI,IAAOlE,EAAIrE,EAAIuI,EAAKJ,GAAM,EAAEI,GAEtD,GAAIA,EAAKzH,EAAG,CAGR,GAFA,EAAIyH,EAAI,EAAIJ,EAERI,EAAKH,EACL,MAMJ,IAAK,IAFDI,EAAM,KAAK,IAAIL,EAAKI,EAAK,CAAC,EAC1BE,GAAK,EACAtI,EAAI,EAAGA,EAAIqI,EAAK,EAAErI,EAAG,CAC1B,IAAIuI,EAAK1I,EAAImI,EAAMhI,EAAI,MAEnBU,GAAK6H,EADCnB,EAAKmB,GACK,MAChB7H,GAAK4H,KACL,GAAK5H,GAAI,EAAQ6H,EACzB,CACJ,CACJ,CAEA,EAAOV,EAAO,EAAQT,EAAKQ,GAC3B,GAAOA,EAAOC,EAAQ,KAC1B,CAGJ,GAAIvF,EAAG,CAGH,EAAK,KAAQ,UAAanC,GAAMQ,IAAM,GAAMN,GAAMiC,GAClD,IAAIkG,GAAMrI,GAAMQ,GAAK,GAAI8H,GAAMpI,GAAMiC,GAAK,GAC1C,GAAM9C,GAAKgJ,IAAO/I,GAAKgJ,IACvB,EAAElE,EAAG,IAAMiE,IACX,EAAE9D,EAAG+D,IACL,EAAK5I,EAAIc,EACT,EAAE8G,CACN,KAEI,GAAK,KAAQvD,EAAIrE,GACjB,EAAE0E,EAAGL,EAAIrE,GAEjB,CACJ,CACA,IAAK,EAAI,KAAK,IAAIA,EAAG6H,CAAE,EAAG7H,EAAIY,EAAG,EAAEZ,EAC/B,EAAK,KAAQqE,EAAIrE,GACjB,EAAE0E,EAAGL,EAAIrE,IAEb,EAAMwE,GAAKH,EAAKJ,EAAGiD,EAAKP,EAAMjC,EAAIG,EAAI5E,EAAIwG,EAAIV,EAAI/F,EAAI+F,EAAIzB,CAAG,EACxD4C,IACD,EAAG,EAAK5C,EAAM,EAAKL,EAAGK,EAAM,EAAK,IAAM,EAEvC,GAAO,EACP,EAAG,EAAIkD,EAAM,EAAG,EAAID,EAAM,EAAG,EAAIvH,EAAG,EAAG,EAAI6H,EAEnD,KACK,CACD,IAAK,IAAI7H,EAAI+G,EAAG,GAAK,EAAG/G,EAAIY,EAAIsG,EAAK,GAAK,MAAO,CAE7C,IAAIpF,GAAI9B,EAAI,MACR8B,IAAKlB,IAEL,EAAG0D,EAAM,EAAK,GAAK4C,EACnB,GAAItG,GAER,EAAMwD,GAAMH,EAAGK,EAAM,EAAGD,EAAI,SAASrE,EAAG8B,EAAC,CAAC,CAC9C,CACA,EAAG,EAAIlB,CACX,CACA,OAAOiB,GAAIQ,EAAG,EAAG2E,EAAMrF,GAAK2C,CAAG,EAAI2C,CAAI,CAC3C,EAEI4B,GAAqB,eAAC,UAAY,CAElC,IAAK,IADDrG,kBAAI,IAAI,WAAW,GAAG,EACjBxC,EAAI,EAAGA,EAAI,IAAK,EAAEA,EAAG,CAE1B,IADA,IAAI4D,EAAI5D,EAAG8I,EAAI,EACR,EAAEA,GACL,GAAMlF,EAAI,GAAM,YAAeA,IAAM,EACzC,EAAE5D,GAAK4D,CACX,CACA,OAAOpB,CACX,EAAA,CAAG,EAECuG,GAAM,UAAY,CAClB,IAAInF,EAAI,GACR,MAAO,CACH,EAAG,SAAU,EAAG,CAGZ,IAAK,IADDoF,EAAKpF,EACA5D,EAAI,EAAGA,EAAIyC,EAAE,OAAQ,EAAEzC,EAC5B,EAAK6I,GAAMG,EAAK,IAAOvG,EAAEzC,IAAOgJ,IAAO,EAC3C,EAAIA,CACR,EACA,EAAG,UAAY,CAAE,MAAO,CAACpF,CAAG,CAChC,CACJ,EAyBIqF,GAAO,SAAU,EAAK,EAAK,EAAK,EAAM,EAAI,CAC1C,GAAI,CAAClC,IACD,EAAK,CAAE,EAAG,CAAE,EACRK,EAAI,YAAY,CAChB,IAAI8B,EAAO9B,EAAI,WAAW,SAAS,MAAM,EACrC+B,EAAS,IAAI3J,EAAG0J,EAAK,OAAS7E,EAAI,MAAM,EAC5C8E,EAAO,IAAID,CAAI,EACfC,EAAO,IAAI9E,EAAK6E,EAAK,MAAM,EAC3B,EAAMC,EACN,EAAG,EAAID,EAAK,MAChB,CAEJ,OAAOpC,GAAKzC,EAAK+C,EAAI,OAAS,KAAO,EAAIA,EAAI,MAAOA,EAAI,KAAO,KAAQL,EAAG,EAAI,KAAK,KAAK,KAAK,IAAI,EAAG,KAAK,IAAI,GAAI,KAAK,IAAI1C,EAAI,MAAM,CAAC,CAAC,EAAI,GAAG,EAAI,GAAO,GAAK+C,EAAI,IAAMJ,EAAKC,EAAMF,CAAE,CACxL,EAEIqC,GAAM,SAAU,EAAG,EAAG,CACtB,IAAI/G,EAAI,CAAC,EACT,IAAK,IAAIyG,KAAKlG,EACV,EAAEkG,GAAKlG,EAAEkG,GACb,IAAK,IAAIA,KAAK/I,EACV,EAAE+I,GAAK/I,EAAE+I,GACb,OAAOzG,CACX,EA4IIgH,EAAS,SAAU,EAAG,EAAG,EAAG,CAC5B,KAAOhI,EAAG,EAAEtB,EACR,EAAEA,GAAKsB,EAAG,KAAO,CACzB,EA6DIiI,GAAyB,0BAAY,CACrC,SAASA,EAAQ,EAAM,EAAI,CASvB,GARI,OAAOC,GAAQ,aACf,EAAKA,EAAM,EAAO,CAAC,GACvB,KAAK,OAASC,EACd,KAAK,EAAID,GAAQ,CAAC,EAClB,KAAK,EAAI,CAAE,EAAG,EAAG,EAAG,MAAO,EAAG,MAAO,EAAG,KAAM,EAG9C,KAAK,EAAI,IAAI/J,EAAG,KAAK,EACjB,KAAK,EAAE,WAAY,CACnB,IAAI0J,EAAO,KAAK,EAAE,WAAW,SAAS,MAAM,EAC5C,KAAK,EAAE,IAAIA,EAAM,MAAQA,EAAK,MAAM,EACpC,KAAK,EAAE,EAAI,MAAQA,EAAK,MAC5B,CACJ,CAuEA,MAtEA,GAAQ,UAAU,EAAI,SAAU,EAAG,EAAG,CAClC,KAAK,OAAOD,GAAKrF,EAAG,KAAK,EAAG,EAAG,EAAG,KAAK,CAAC,EAAG6F,CAAC,CAChD,EAMA,EAAQ,UAAU,KAAO,SAAU,EAAO,EAAO,CACxC,KAAK,QACNzH,EAAI,CAAC,EACL,KAAK,EAAE,GACPA,EAAI,CAAC,EACT,IAAI0H,EAASC,EAAM,OAAS,KAAK,EAAE,EACnC,GAAID,EAAS,KAAK,EAAE,OAAQ,CACxB,GAAIA,EAAS,EAAI,KAAK,EAAE,OAAS,MAAO,CACpC,IAAIE,EAAS,IAAIpK,EAAGkK,EAAS,MAAM,EACnCE,EAAO,IAAI,KAAK,EAAE,SAAS,EAAG,KAAK,EAAE,CAAC,CAAC,EACvC,KAAK,EAAIA,CACb,CACA,IAAIC,EAAQ,KAAK,EAAE,OAAS,KAAK,EAAE,EACnC,KAAK,EAAE,IAAIF,EAAM,SAAS,EAAGE,CAAK,EAAG,KAAK,EAAE,CAAC,EAC7C,KAAK,EAAE,EAAI,KAAK,EAAE,OAClB,KAAK,EAAE,KAAK,EAAG,EAAK,EACpB,KAAK,EAAE,IAAI,KAAK,EAAE,SAAS,MAAM,CAAC,EAClC,KAAK,EAAE,IAAIF,EAAM,SAASE,CAAK,EAAG,KAAK,EACvC,KAAK,EAAE,EAAIF,EAAM,OAASE,EAAQ,MAClC,KAAK,EAAE,EAAI,MAAO,KAAK,EAAE,EAAI,KACjC,MAEI,KAAK,EAAE,IAAIF,EAAO,KAAK,EAAE,CAAC,EAC1B,KAAK,EAAE,GAAKA,EAAM,OAEtB,KAAK,EAAE,EAAIlF,EAAQ,GACf,KAAK,EAAE,EAAI,KAAK,EAAE,EAAI,MAAQA,KAC9B,KAAK,EAAE,KAAK,EAAGA,GAAS,EAAK,EAC7B,KAAK,EAAE,EAAI,KAAK,EAAE,EAAG,KAAK,EAAE,GAAK,GAEjCA,IAEA,KAAK,EAAI,KAAK,EAAI,CAAC,EACnB,KAAK,EAAI9B,GAEjB,EASA,EAAQ,UAAU,MAAQ,SAAU,EAAM,CAStC,GARK,KAAK,QACNX,EAAI,CAAC,EACL,KAAK,EAAE,GACPA,EAAI,CAAC,EACT,KAAK,EAAE,KAAK,EAAG,EAAK,EACpB,KAAK,EAAE,EAAI,KAAK,EAAE,EAAG,KAAK,EAAE,GAAK,EAG7B8H,EAAM,CACN,IAAIlG,EAAI,IAAIpE,EAAG,CAAC,EAChB,EAAE,GAAK,KAAK,EAAE,GAAK,EAEnB,IAAIuK,EAAK3F,GAAMR,EAAG,KAAK,EAAE,EAAGjB,EAAE,EAC9B,KAAK,EAAE,EAAI,EACX,KAAK,OAAOiB,EAAE,SAAS,EAAGmG,GAAM,CAAC,EAAG,EAAK,CAC7C,CACJ,EACOT,CACX,EAAE,EAmiBEU,GAAK,OAAO,YAAe,mBAA6B,IAAI,YAE5DC,GAAK,OAAO,YAAe,mBAA6B,IAAI,YAGhE,GAAI,CACAA,GAAG,OAAOtH,GAAI,CAAE,OAAQ,EAAK,CAAC,CAElC,MACU,CAAE,CAwGZ,SAAgBuH,GAAQ,EAAK,EAAQ,CACjC,GAAIC,EAAQ,CAER,IAAK,IADDC,EAAO,IAAI5K,EAAG6K,EAAI,MAAM,EACnBrK,EAAI,EAAGA,EAAIqK,EAAI,OAAQ,EAAErK,EAC9B,EAAKA,GAAKqK,EAAI,WAAWrK,CAAC,EAC9B,OAAOoK,CACX,CACA,GAAIJ,GACA,OAAOA,GAAG,OAAOK,CAAG,EAKxB,IAAK,IAJDvJ,EAAIuJ,EAAI,OACRC,EAAK,IAAI9K,EAAG6K,EAAI,QAAUA,EAAI,QAAU,EAAE,EAC1CE,EAAK,EACLtG,EAAI,SAAU,EAAG,CAAE,EAAG,KAAQ5C,CAAG,EAC5BrB,EAAI,EAAGA,EAAIc,EAAG,EAAEd,EAAG,CACxB,GAAIuK,EAAK,EAAID,EAAG,OAAQ,CACpB,IAAI5G,EAAI,IAAIlE,EAAG+K,EAAK,GAAMzJ,EAAId,GAAM,EAAE,EACtC0D,EAAE,IAAI4G,CAAE,EACR,EAAK5G,CACT,CACA,IAAIE,EAAIyG,EAAI,WAAWrK,CAAC,EACpB4D,EAAI,KAAOuG,EACXlG,EAAEL,CAAC,EACEA,EAAI,MACTK,EAAE,IAAOL,GAAK,CAAE,EAAGK,EAAE,IAAOL,EAAI,EAAG,GAC9BA,EAAI,OAASA,EAAI,OACtB,EAAI,OAASA,EAAI,SAAeyG,EAAI,WAAW,EAAErK,CAAC,EAAI,KAClDiE,EAAE,IAAOL,GAAK,EAAG,EAAGK,EAAE,IAAQL,GAAK,GAAM,EAAG,EAAGK,EAAE,IAAQL,GAAK,EAAK,EAAG,EAAGK,EAAE,IAAOL,EAAI,EAAG,IAE7FK,EAAE,IAAOL,GAAK,EAAG,EAAGK,EAAE,IAAQL,GAAK,EAAK,EAAG,EAAGK,EAAE,IAAOL,EAAI,EAAG,EACtE,CACA,OAAO/B,GAAIyI,EAAI,EAAGC,CAAE,CACxB,CA2BA,IAAIC,GAAM,SAAU,EAAG,CAAE,OAAO1J,GAAK,EAAI,EAAIA,EAAI,EAAI,EAAI,KAAK,EAAW,EA+BrE2J,GAAO,SAAU,EAAI,CACrB,IAAIzJ,EAAK,EACT,GAAI0J,EACA,IAAK,IAAI5B,KAAK4B,EAAI,CACd,IAAI5J,EAAI4J,EAAG5B,EAAE,CAAC,OACVhI,EAAI,OACJkB,EAAI,CAAC,EACT,GAAMlB,EAAI,CACd,CAEJ,OAAOE,CACX,EAEI2J,GAAM,SAAU,EAAG,EAAG,EAAG,EAAI,EAAG,EAAG,EAAI,EAAI,CAC3C,IAAItK,EAAKuK,EAAG,OAAQF,EAAKjB,EAAE,MAAOoB,EAAM5J,GAAMA,EAAG,OAC7C6J,EAAML,GAAKC,CAAE,EACjBrB,EAAO5G,EAAG1C,EAAGgL,GAAM,KAAmB,SAAZ,QAAqB,EAAG,GAAK,EACnDA,GAAM,OACN,EAAE,KAAO,GAAI,EAAE,KAAOtB,EAAE,IAC5B,EAAE1J,GAAK,GAAI,GAAK,EAChB,EAAE,KAAQ0J,EAAE,MAAQ,GAAM7F,EAAI,GAAK,GAAI,EAAE,KAAOoH,GAAK,EACrD,EAAE,KAAOvB,EAAE,YAAc,IAAK,EAAE,KAAOA,EAAE,aAAe,EACxD,IAAIrG,EAAK,IAAI,KAAKqG,EAAE,OAAS,KAAO,KAAK,IAAI,EAAIA,EAAE,KAAK,EAAGwB,EAAI7H,EAAG,YAAY,EAAI,KAkBlF,IAjBI6H,EAAI,GAAKA,EAAI,MACbjJ,EAAI,EAAE,EACVqH,EAAO5G,EAAG1C,EAAIkL,GAAK,GAAQ7H,EAAG,SAAS,EAAI,GAAM,GAAOA,EAAG,QAAQ,GAAK,GAAOA,EAAG,SAAS,GAAK,GAAOA,EAAG,WAAW,GAAK,EAAMA,EAAG,WAAW,GAAK,CAAE,EAAG,GAAK,EACzJQ,GAAK,KACLyF,EAAO5G,EAAG1C,EAAG0J,EAAE,GAAG,EAClBJ,EAAO5G,EAAG1C,EAAI,EAAG6D,EAAI,EAAI,CAACA,EAAI,EAAIA,CAAC,EACnCyF,EAAO5G,EAAG1C,EAAI,EAAG0J,EAAE,IAAI,GAE3BJ,EAAO5G,EAAG1C,EAAI,GAAIM,CAAE,EACpBgJ,EAAO5G,EAAG1C,EAAI,GAAI+K,CAAG,EAAG,GAAK,GACzBC,GAAM,OACN1B,EAAO5G,EAAG1C,EAAG8K,CAAG,EAChBxB,EAAO5G,EAAG1C,EAAI,EAAG0J,EAAE,KAAK,EACxBJ,EAAO5G,EAAG1C,EAAI,GAAIgL,CAAE,EAAG,GAAK,IAEhCtI,EAAE,IAAImI,EAAI7K,CAAC,EACX,GAAKM,EACDyK,EACA,IAAK,IAAIhC,KAAK4B,EAAI,CACd,IAAIQ,EAAMR,EAAG5B,GAAIhI,EAAIoK,EAAI,OACzB7B,EAAO5G,EAAG1C,EAAG,CAAC+I,CAAC,EACfO,EAAO5G,EAAG1C,EAAI,EAAGe,CAAC,EAClB2B,EAAE,IAAIyI,EAAKnL,EAAI,CAAC,EAAG,GAAK,EAAIe,CAChC,CAIJ,OAFI+J,IACApI,EAAE,IAAIxB,EAAIlB,CAAC,EAAG,GAAK8K,GAChB9K,CACX,EAEIoL,GAAM,SAAU,EAAG,EAAG,EAAG,EAAG,EAAG,CAC/B9B,EAAOhH,EAAGtC,EAAG,SAAS,EACtBsJ,EAAOhH,EAAGtC,EAAI,EAAG6D,CAAC,EAClByF,EAAOhH,EAAGtC,EAAI,GAAI6D,CAAC,EACnByF,EAAOhH,EAAGtC,EAAI,GAAI0C,CAAC,EACnB4G,EAAOhH,EAAGtC,EAAI,GAAI+B,CAAC,CACvB,EAIIsJ,GAAgC,0BAAY,CAK5C,SAASA,EAAe,EAAU,CAC9B,KAAK,SAAWC,EAChB,KAAK,EAAItC,GAAI,EACb,KAAK,KAAO,EACZ,KAAK,YAAc,CACvB,CA8BA,MArBA,GAAe,UAAU,QAAU,SAAU,EAAO,EAAO,CACvD,KAAK,OAAO,KAAMY,EAAOlF,CAAK,CAClC,EAQA,EAAe,UAAU,KAAO,SAAU,EAAO,EAAO,CAC/C,KAAK,QACNzC,EAAI,CAAC,EACT,KAAK,EAAE,EAAE2H,CAAK,EACd,KAAK,MAAQA,EAAM,OACflF,IACA,KAAK,IAAM,KAAK,EAAE,EAAE,GAGxB,KAAK,QAAQkF,EAAOlF,GAAS,EAAK,CACtC,EACO2G,CACX,EAAE,EAOEE,GAA4B,0BAAY,CAMxC,SAASA,EAAW,EAAU,EAAM,CAChC,IAAIC,EAAQ,KACZ,AACIhC,IAAO,CAAC,EACZ6B,GAAe,KAAK,KAAMC,CAAQ,EAClC,KAAK,EAAI,IAAI/B,GAAQC,EAAM,SAAU,EAAK,EAAO,CAC7CgC,EAAM,OAAO,KAAMlH,EAAKI,CAAK,CACjC,CAAC,EACD,KAAK,YAAc,EACnB,KAAK,KAAO+F,GAAIjB,EAAK,KAAK,CAC9B,CAiBA,MAhBA,GAAW,UAAU,QAAU,SAAU,EAAO,EAAO,CACnD,GAAI,CACA,KAAK,EAAE,KAAKI,EAAOlF,CAAK,CAC5B,OACO,EAAG,CACN,KAAK,OAAO,EAAG,KAAMA,CAAK,CAC9B,CACJ,EAMA,EAAW,UAAU,KAAO,SAAU,EAAO,EAAO,CAChD2G,GAAe,UAAU,KAAK,KAAK,KAAMzB,EAAOlF,CAAK,CACzD,EACO6G,CACX,EAAE,EAyCEE,GAAqB,0BAAY,CAMjC,SAASA,EAAI,EAAI,CACb,KAAK,OAAShC,EACd,KAAK,EAAI,CAAC,EACV,KAAK,EAAI,CACb,CAoIA,MA/HA,GAAI,UAAU,IAAM,SAAU,EAAM,CAChC,IAAI+B,EAAQ,KAIZ,GAHK,KAAK,QACNvJ,EAAI,CAAC,EAEL,KAAK,EAAI,EACT,KAAK,OAAOA,EAAI,GAAK,KAAK,EAAI,GAAK,EAAG,EAAG,CAAC,EAAG,KAAM,EAAK,MACvD,CACD,IAAIyH,EAAIS,GAAQuB,EAAK,QAAQ,EAAGC,EAAOjC,EAAE,OACrCkC,EAAMF,EAAK,QAASpJ,EAAIsJ,GAAOzB,GAAQyB,CAAG,EAC1CX,EAAIU,GAAQD,EAAK,SAAS,QAAWpJ,GAAMsJ,EAAI,QAAUtJ,EAAE,OAC3DuJ,EAAOF,EAAOjB,GAAKgB,EAAK,KAAK,EAAI,GACjCC,EAAO,OACP,KAAK,OAAO1J,EAAI,GAAI,EAAG,CAAC,EAAG,KAAM,EAAK,EAC1C,IAAI6J,EAAS,IAAIrM,EAAGoM,CAAI,EACxBjB,GAAIkB,EAAQ,EAAGJ,EAAMhC,EAAGuB,EAAG,EAAE,EAC7B,IAAIc,EAAS,CAACD,CAAM,EAChBE,EAAS,UAAY,CACrB,IAAK,IAAIC,EAAK,EAAGC,EAASH,EAAQE,EAAKC,EAAO,OAAQ,IAAM,CACxD,IAAIC,EAAMD,EAAOD,GACjBT,EAAM,OAAO,KAAMW,EAAK,EAAK,CACjC,CACA,EAAS,CAAC,CACd,EACIC,EAAO,KAAK,EAChB,KAAK,EAAI,EACT,IAAIC,EAAQ,KAAK,EAAE,OACfC,EAAOjD,GAAIqC,EAAM,CACd,IACA,IACA,IACH,EAAG,UAAY,CACPA,EAAK,WACLA,EAAK,UAAU,CACvB,EACA,EAAG,UAAY,CAEX,GADAM,EAAO,EACHI,EAAM,CACN,IAAIG,EAAMf,EAAM,EAAEa,EAAQ,GACtBE,EACAA,EAAI,EAAE,EAEN,EAAM,EAAI,CAClB,CACA,EAAO,CACX,CACJ,CAAC,EACGC,EAAO,EACX,EAAK,OAAS,SAAU,EAAK,EAAK,EAAO,CACrC,GAAIvK,EACAuJ,EAAM,OAAOvJ,EAAKqC,EAAKI,CAAK,EAC5B8G,EAAM,UAAU,OAKhB,GAFA,GAAQlH,EAAI,OACZyH,EAAO,KAAKzH,CAAG,EACXI,EAAO,CACP,IAAI+H,EAAK,IAAIhN,EAAG,EAAE,EAClB6J,EAAOmD,EAAI,EAAG,SAAS,EACvBnD,EAAOmD,EAAI,EAAGf,EAAK,GAAG,EACtBpC,EAAOmD,EAAI,EAAGD,CAAI,EAClBlD,EAAOmD,EAAI,GAAIf,EAAK,IAAI,EACxBK,EAAO,KAAKU,CAAE,EACd,EAAK,EAAID,EAAM,EAAK,EAAIX,EAAOW,EAAO,GAAI,EAAK,IAAMd,EAAK,IAAK,EAAK,KAAOA,EAAK,KAC5EU,GACAE,EAAK,EAAE,EACX,EAAO,CACX,MACSF,GACLJ,EAAO,CAEnB,EACA,KAAK,EAAE,KAAKM,CAAI,CACpB,CACJ,EAMA,EAAI,UAAU,IAAM,UAAY,CAC5B,IAAId,EAAQ,KACZ,GAAI,KAAK,EAAI,EAAG,CACZ,KAAK,OAAOvJ,EAAI,GAAK,KAAK,EAAI,GAAK,EAAG,EAAG,CAAC,EAAG,KAAM,EAAI,EACvD,MACJ,CACI,KAAK,EACL,KAAK,EAAE,EAEP,KAAK,EAAE,KAAK,CACR,EAAG,UAAY,CACLuJ,EAAM,EAAI,IAEhBA,EAAM,EAAE,OAAO,GAAI,CAAC,EACpBA,EAAM,EAAE,EACZ,EACA,EAAG,UAAY,CAAE,CACrB,CAAC,EACL,KAAK,EAAI,CACb,EACA,EAAI,UAAU,EAAI,UAAY,CAE1B,IAAK,IADDkB,EAAK,EAAG3L,EAAI,EAAG4L,EAAK,EACfV,EAAK,EAAG5L,EAAK,KAAK,EAAG4L,EAAK5L,EAAG,OAAQ,IAAM,CAChD,IAAIqJ,EAAIrJ,EAAG4L,GACX,GAAM,GAAKvC,EAAE,EAAE,OAASgB,GAAKhB,EAAE,KAAK,GAAKA,EAAE,EAAIA,EAAE,EAAE,OAAS,EAChE,CAEA,IAAK,IADDlF,EAAM,IAAI/E,EAAGkN,EAAK,EAAE,EACfnM,EAAK,EAAGyE,EAAK,KAAK,EAAGzE,EAAKyE,EAAG,OAAQ,IAAM,CAChD,IAAIyE,EAAIzE,EAAGzE,GACXoK,GAAIpG,EAAKkI,EAAIhD,EAAGA,EAAE,EAAGA,EAAE,EAAG,CAACA,EAAE,EAAI,EAAG3I,EAAG2I,EAAE,CAAC,EAC1C,GAAM,GAAKA,EAAE,EAAE,OAASgB,GAAKhB,EAAE,KAAK,GAAKA,EAAE,EAAIA,EAAE,EAAE,OAAS,GAAI,GAAKA,EAAE,CAC3E,CACA0B,GAAI5G,EAAKkI,EAAI,KAAK,EAAE,OAAQC,EAAI5L,CAAC,EACjC,KAAK,OAAO,KAAMyD,EAAK,EAAI,EAC3B,KAAK,EAAI,CACb,EAKA,EAAI,UAAU,UAAY,UAAY,CAClC,IAAK,IAAIyH,EAAK,EAAG5L,EAAK,KAAK,EAAG4L,EAAK5L,EAAG,OAAQ,IAE1CA,EADW4L,EACV,CAAC,EAAE,EAER,KAAK,EAAI,CACb,EACOR,CACX,EAAE,EC1oEF,IAMMmB,GAAa,8CAEbC,GAAa,GACjBnP,EAAK,QAAQkP,GAAY,EAAE,CAAC,CAAC,WAAW,IAAK,OAAO,CAAC,CAAC,WAAW,IAAK,MAAM,CAAC,CAAC,WAAW,IAAK,MAAM,CAAC,CAAC,WAAW,IAAK,QAAQ,EAGnHE,GAAiB,GAA0B,CACtD,IAAMC,EAAS,OAAO,aAAa,GAAMC,EAAQ,EAAG,EACpD,OAAOA,EAAQ,GAAKD,EAASD,GAAc,KAAK,MAAME,EAAQ,EAAE,EAAI,CAAC,EAAID,CAC3E,EAEME,IAAY,EAAa,EAAc,EAAQ,KACnD,SAASC,EAAI,GAAGC,EAAM,6CAA6CN,GAAUnP,EAAK,MAAM,EAAG,KAAW,CAAC,EAAE,eAErG0P,EAAM;EACNC,GAAS,4DACTC,GAAQ,sEACRC,GAAe,+DAEfC,GAAe,GAAGJ,EAAI,knBACtBK,GAAW,GAAGL,EAAI,wBAAwBG,GAAa,kCAAkCD,GAAM,6DAC/FI,GAAe,GAAGN,EAAI,wBAAwBG,GAAa,kCAAkCD,GAAM,4EAA4EA,GAAM,gDAGrLK,GAAa,GAAiBpR,EAAK,QAAQ,eAAgB,GAAG,CAAC,CAAC,MAAM,EAAG,EAAE,CAAC,CAAC,KAAK,GAAK,SAEvFqR,GAAY,GAChB,GAAGR,EAAI,mBAAmBC,GAAO,aAAaC,GAAM,yBAAyBT,GAAUc,GAAUpR,CAAI,CAAC,EAAE,iDAGpGsR,GAAU,GAAsB,CACpC,IAAMC,EAAUlR,EAAQ,KAAK,EAAM,IAAU,qBAAqB,IAAMoQ,EAAM,gBAAgBH,GAAUjO,CAAI,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,EACrHmP,EAAMnR,EAAQ,KAAK,EAAG,IAAU,iBAAiB,IAAMoQ,EAAM,sEAAsE,CAAC,CAAC,KAAK,EAAE,EAClJ,MAAO,GAAGI,EAAI,qBAAqBC,GAAO,IAAIzQ,EAAQ,OAAS,EAAI,mBAAmBA,EAAQ,OAAO,IAAIkR,EAAQ,YAAc,GAAG,0bAA0b,EAAIlR,EAAQ,OAAO,8IAA8ImR,EAAI,4GACnuB,EAEMC,GAAU,IAAI,YAePC,IAAoB,EAAkB,IAAyD,CAC1G,IAAMC,EAAM,IAAIzC,IAAK,EAAO,EAAO,IAAU,CAC3C,GAAI0C,EAAO,MAAMA,EACjBC,EAAQxE,EAAOlF,CAAK,CACtB,CAAC,EACK2J,GAAO,EAAc,IAAiB,CAC1C,IAAM3C,EAAO,IAAIH,GAAW+C,EAAM,CAAE,MAAO,CAAE,CAAC,EAC9CJ,EAAI,IAAIxC,CAAI,EACZA,EAAK,KAAKsC,GAAQ,OAAOtQ,CAAI,EAAG,EAAI,CACtC,EACA2Q,EAAI,sBAAuBb,EAAY,EACvCa,EAAI,cAAeZ,EAAQ,EAC3BY,EAAI,kBAAmBT,GAASW,EAAM,IAAI,CAAC,EAC3CF,EAAI,6BAA8BX,EAAY,EAE9C,IAAMc,EAAY,IAAIjD,GAAW,2BAA4B,CAAE,MAAO,CAAE,CAAC,EACzE2C,EAAI,IAAIM,CAAS,EACjB,IAAMC,EAAOF,EAAM,OAAO,KAAK,EAAO,IAAU,aAAavB,EAAQ,EAAE,SAASA,EAAQ,EAAE,WAAW0B,EAAM,oBAAoB,CAAC,CAAC,KAAK,EAAE,EAElI5C,EAAS,cAAcyC,EAAM,QAAQ,KAAK,EAAM,IAAUtB,GAAS,GAAGH,GAAcE,CAAK,EAAE,GAAItP,EAAM,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,QAC/H8Q,EAAU,KAAKR,GAAQ,OAAO,GAAGZ,EAAI,oBAAoBC,GAAO,iJAAaoB,EAAO,SAASA,EAAK,SAAW,GAAG,aAAa3C,GAAQ,CAAC,EAEtI,IAAM6C,EAAUJ,EAAM,QAAQ,KAAK,EAAG,IAAUzB,GAAcE,CAAK,CAAC,EAC9DpQ,EAAoB,CAAC,EACrBgS,EAAW,GAAmB,CAClC,IAAM5B,EAAQpQ,EAAQ,QAAQb,CAAM,EAGpC,OAFIiR,GAAS,EAAUA,EAAQ,GAC/BpQ,EAAQ,KAAKb,CAAM,EACZa,EAAQ,OAAS,EAC1B,EACMiS,GAAW,EAAY,IAAgB,CAC3C,OAAQC,EAAK,KAAb,CACE,IAAK,QACH,MAAO,GACT,IAAK,OACH,OAAO7B,GAASC,EAAK4B,EAAK,KAAK,EACjC,IAAK,UACH,MAAO,SAAS5B,EAAI,aAAa,KAAK,MAAc,UACtD,IAAK,SACH,MAAO,SAASA,EAAI,GAAG4B,EAAK,OAAS,OAAOF,EAAQE,EAAK,MAAM,EAAE,GAAK,GAAG,MAAMA,EAAK,MAAM,SAC9F,CACF,EAEIC,EAAY,EAiBhB,MAAO,CAAE,KAhBK,GAAoB,CAChC,IAAIrR,EAAO,GACX,IAAK,IAAMsR,KAAOC,EAAO,CAEvB,GADA,GAAa,EACTF,EAAY,QAAiB,MAAU,MAAM,oCAA2C,EAC5F,GAAQ,WAAWA,EAAU,IAAIC,EAAI,KAAK,EAAM,IAAUH,EAAQC,EAAM,GAAGH,EAAQ3B,KAAS+B,GAAW,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,OACrH,CACAP,EAAU,KAAKR,GAAQ,OAAOtQ,CAAI,CAAC,CACrC,EAQe,WANM,CACnB8Q,EAAU,KAAKR,GAAQ,OAAO,0BAA0B,EAAG,EAAI,EAC/DK,EAAI,gBAAiBR,GAAOjR,CAAO,CAAC,EACpCsR,EAAI,IAAI,CACV,CAEsB,CACxB,ECvGMgB,mBAAY,IAAI,IAAI,CAAC,OAAQ,OAAQ,OAAQ,WAAY,OAAQ,OAAQ,WAAY,SAAS,CAAC,EAMxFC,IAAgB,EAAyB,EAAyB,IAC7EC,EAAQ,IAAK,GAAW,CACtB,IAAMC,EAAU,KAAK,IAAIpR,EAAO,OAAO,OAAQ,GAAGqR,EAAQ,IAAK,GAAWlR,EAAQH,EAAQsR,EAAOtR,EAAO,MAAO5D,EAAQ,OAAO,CAAC,CAAC,MAAM,CAAC,EACvI,OAAO,KAAK,IAAI,GAAU,KAAK,IAAI,EAAUgV,EAAU,CAAC,CAAC,CAC3D,CAAC,EAEGG,IAAoB,EAAkB,IAAyC,CACnF,IAAMxB,EAAU,IAAI,YACpBI,EAAQlP,CAAO,EACfkP,EAAQJ,EAAQ,OAAOzO,GAAQkQ,EAAK,QAAQ,IAAK,GAAWpQ,EAASpB,EAAO,MAAM,CAAC,CAAC,CAAC,CAAC,EACtF,IAAML,GAAS,EAAsB,EAAsB,IAA0B,CACnF,IAAMF,EAAOU,EAAQH,EAAQsR,EAAOtR,EAAO,MAAO5D,EAAQoV,EAAK,IAAI,EACnE,OAAOP,GAAU,IAAIjR,EAAO,MAAM,IAAI,EAAIqB,GAAa5B,CAAI,EAAI2B,EAAS3B,CAAI,CAC9E,EACA,MAAO,CACL,MAAO,EAAyB,IAA0B,CACxD0Q,EAAQJ,EAAQ,OAAOsB,EAAQ,IAAK,GAAW/P,GAAQkQ,EAAK,QAAQ,IAAK,GAAW7R,EAAMK,EAAQsR,EAAQlV,CAAM,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAChI,EACA,WAAc,IAAA,EAChB,CACF,EAGMqV,IAAqB,EAAkB,IAAyC,CACpF,IAAIC,EACEC,GAAS,EAAyB,IACtC3B,GAAiB,CAAE,KAAMwB,EAAK,KAAM,QAASA,EAAK,QAAQ,IAAK,GAAWxR,EAAO,MAAM,EAAG,OAAQkR,GAAaM,EAAK,QAASH,EAASjV,CAAM,CAAE,EAAG+T,CAAO,EAC1J,MAAO,CACL,MAAO,EAAyB,IAA0B,CACxD,IAAWwB,EAAMN,EAASjV,CAAM,EAChCsV,EAAO,KAAKL,EAAQ,IAAK,GAAWG,EAAK,QAAQ,IAAK,GAAWxQ,EAAShB,EAAQsR,EAAOtR,EAAO,MAAO5D,EAAQoV,EAAK,IAAI,CAAC,CAAC,CAAC,CAC7H,EACA,WAAc,CACZ,IAAWG,EAAM,CAAC,EAAG,CAAC,CAAC,EACvBD,EAAO,OAAO,CAChB,CACF,CACF,EAMaE,IAAuB,EAAkB,IACpDJ,EAAK,SAAW,MAAQD,GAAiBC,EAAMrB,CAAO,EAAIsB,GAAkBD,EAAMrB,CAAO,ECvDrF0B,GAAU,GAAyB,CACvC,IAAMC,EAAQ,IAAI,WAAWC,EAAO,QAAQ,EAAM,IAAU7S,EAAOyM,EAAM,OAAQ,CAAC,CAAC,EAC/EqG,EAAS,EACb,IAAK,IAAMrG,KAASoG,EAClBD,EAAM,IAAInG,EAAOqG,CAAM,EACvB,GAAUrG,EAAM,OAElB,OAAOmG,CACT,ECjBMG,QDoBoC,CACxC,IAAIC,EACAH,EAAuB,CAAC,EAC5B,MAAQ,IAAuB,CAC7B,GAAI3U,EAAQ,OAAS,QAAS,EAAUwU,GAAoBxU,EAAQ,KAAO,GAAU2U,EAAO,KAAKpG,CAAK,CAAC,OAClG,GAAKuG,EACD9U,EAAQ,OAAS,OAAQ8U,EAAQ,KAAK9U,EAAQ,QAASA,EAAQ,MAAM,EACzE8U,EAAQ,OAAO,OAFD,MAAU,MAAM,4BAA4B,EAG/D,IAAMJ,EAAQD,GAAOE,CAAM,EAE3B,MADA,GAAS,CAAC,EACHD,CACT,CACF,EChCe,CAAqB,EAC9BK,GAAQ,KAGd,GAAM,UAAa,GAAmC,CAChDC,EAAM,KAAK,OAAS,SAAS5V,EAAkB4V,EAAM,KAAK,MAAM,EACpE,IAAMN,EAAQG,GAAOG,EAAM,IAAI,EAC/BD,GAAM,YAAY,CAAE,OAAM,EAAyB,CAACL,EAAM,MAAM,CAAC,CACnE","debugId":"377b866c-bf46-48ef-be82-f3983de3fc69"}

package/dist/shell-source-maps/assets/parse-worker-UhbwEjS0.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parse-worker-UhbwEjS0.js","names":["message","message","fallback","activeLocale","setFallbackLocale","locale","delimiters","detectDelimiter","counts","delimiter","quoted","char","headerLine","entry","best","firstLine","index","text","createCsvParser","given","pending","started","field","row","quoteSeen","crSeen","rowStarted","endField","endRow","rows","consume","push","chunk","header","values","message","catalogue","id","plural","count","name","fields","line","size","cell","dayFirst","singular","named","found","part","method","letters","entities","decodeXml","whole","attributes","match","runsText","xml","run","sharedStrings","workbookSheets","targets","relsXml","Id","Target","sheets","workbookXml","path","pr","builtInDates","isDateFormat","code","dateStyles","custom","numFmtId","formatCode","cellXfs","styles","pad","value","serialDate","days","date1904","serial","at","date","columnIndex","ref","cellValue","type","attrs","body","raw","context","number","parseRow","open","previous","cells","column","createRowScanner","buffer","end","bytesOf","blob","start","notZip","endRecordAt","view","zipEntries","tailStart","tail","directory","decoder","entries","nameLength","extraLength","commentLength","zipEntryStream","local","dataStart","zipTextChunks","reader","done","zipText","parts","openWorkbook","sheetContext","sheet","candidate","shared","scan","startsAsZip","head","file","sheetFormat","extension","sheetNames","notText","csvRows","parser","decode","bytes","error","numbered","sheetRows","workbook","scope","reply","next","read","request","asked","resolve","handle","event"],"sources":["../../src/locale/active-locale.ts","../../src/app/import/csv-parser.ts","../../src/locale/messages.ts","../../src/app/import/messages.ts","../../src/app/import/xlsx-xml.ts","../../src/app/import/zip-reader.ts","../../src/app/import/xlsx-reader.ts","../../src/app/import/sheet-file.ts","../../src/app/import/parse-worker.ts"],"sourcesContent":["import { pickLocale, type Locale } from '@protobase/schema/internal'\n\n// The built-in screens read one locale, so plain functions (formats, messages) need no context: the app's when its\n// `/meta` names one, else the fallback the app starts with, the browser's language unless given. Both only ever get\n// set to what the app decides on each render, so a part of the tree that renders later never sees another one.\nlet fallback: Locale = 'en'\nlet app: Locale | undefined\n\n/** The language the screens are in now. */\nexport const activeLocale = (): Locale => app ?? fallback\n\n/** The language the screens are in when the app sets none: the browser's, or the one the app was given. */\nexport const setFallbackLocale = (locale: Locale) => {\n  fallback = locale\n}\n\n/** The language the app sets for everyone, from its `/meta`; undefined when it sets none. */\nexport const setAppLocale = (locale: Locale | undefined) => {\n  app = locale\n}\n\n/** The browser's language when the screens come in it, else English. */\nexport const browserLocale = (languages = globalThis.navigator?.languages ?? []) => pickLocale(languages)\n\n// The language tag numbers and dates are written with: English as in Ireland and Britain (`6 Oct 2026`, `1,234.5`).\nconst formatTags: Record<Locale, string> = { en: 'en-GB', nl: 'nl-NL' }\n\n/** The language tag `Intl` formats numbers and dates with, for the active locale. */\nexport const formatTag = () => formatTags[activeLocale()]\n","const delimiters = [',', ';', '\\t'] as const\n\n/**\n * The delimiter of a CSV's header line: whichever of comma, semicolon and tab it holds most often outside quotes, a\n * comma when it holds none (a file of one column).\n */\nexport const detectDelimiter = (headerLine: string) => {\n  const counts = new Map<string, number>(delimiters.map((delimiter) => [delimiter, 0]))\n  let quoted = false\n  for (const char of headerLine) {\n    if (char === '\"') quoted = !quoted\n    else if (!quoted && counts.has(char)) counts.set(char, counts.get(char)! + 1)\n  }\n  return [...counts].reduce((best, entry) => (entry[1] > best[1] ? entry : best), [',', 0] as [string, number])[0]\n}\n\n// The header line of the text so far, up to its first line break outside quotes; undefined while it has none.\nconst firstLine = (text: string) => {\n  let quoted = false\n  for (let index = 0; index < text.length; index++) {\n    const char = text[index]\n    if (char === '\"') quoted = !quoted\n    else if (!quoted && (char === '\\n' || char === '\\r')) return text.slice(0, index)\n  }\n  return undefined\n}\n\n/**\n * A CSV parser fed text a chunk at a time (RFC 4180: quoted fields with `\"\"` for a quote and line breaks inside, CRLF,\n * LF or CR between rows), so a large file is read without holding it whole. `push` returns the rows completed by the\n * chunk, `end` the last one. The delimiter is the header line's (`detectDelimiter`) unless given; a byte order mark at\n * the start is dropped.\n */\nexport const createCsvParser = (given?: string) => {\n  let delimiter = given\n  let pending = ''\n  let started = false\n  let field = ''\n  let row: string[] = []\n  let quoted = false\n  // A quote inside a quoted field: the field's end, or the first of a `\"\"` pair\n  let quoteSeen = false\n  // A CR ended the row: an LF straight after it belongs to the same line break\n  let crSeen = false\n  // Whether the current row has anything yet, so the line break ending the file makes no row of its own\n  let rowStarted = false\n\n  const endField = () => {\n    row.push(field)\n    field = ''\n  }\n  const endRow = (rows: string[][]) => {\n    endField()\n    rows.push(row)\n    row = []\n    rowStarted = false\n  }\n\n  const consume = (text: string) => {\n    const rows: string[][] = []\n    for (const char of text) {\n      if (crSeen) {\n        crSeen = false\n        if (char === '\\n') continue\n      }\n      if (quoted) {\n        if (quoteSeen) {\n          quoteSeen = false\n          if (char === '\"') {\n            field += '\"'\n            continue\n          }\n          quoted = false\n        } else if (char === '\"') {\n          quoteSeen = true\n          continue\n        } else {\n          field += char\n          continue\n        }\n      }\n      if (char === '\"' && field === '') {\n        quoted = true\n        rowStarted = true\n      } else if (char === delimiter) {\n        endField()\n        rowStarted = true\n      } else if (char === '\\n' || char === '\\r') {\n        crSeen = char === '\\r'\n        endRow(rows)\n      } else {\n        field += char\n        rowStarted = true\n      }\n    }\n    return rows\n  }\n\n  const push = (chunk: string) => {\n    if (started) return consume(chunk)\n    pending += chunk\n    if (pending.charCodeAt(0) === 0xfeff) pending = pending.slice(1)\n    const header = firstLine(pending)\n    if (header === undefined) return []\n    started = true\n    delimiter ??= detectDelimiter(header)\n    const text = pending\n    pending = ''\n    return consume(text)\n  }\n\n  const end = () => {\n    const rows = started ? [] : push('\\n')\n    if (quoteSeen) {\n      quoteSeen = false\n      quoted = false\n    }\n    if (rowStarted || field !== '') endRow(rows)\n    return rows\n  }\n\n  return { push, end, delimiter: () => delimiter }\n}\n","import type { Locale } from '@protobase/schema/internal'\nimport { activeLocale } from './active-locale'\n\n/** A built-in text: fixed, or made from the values it names, such as a count. */\ntype Message = string | ((...values: never[]) => string)\n\n/** A translation of `M`: every message of it, taking the same values. */\nexport type Translation<M extends Record<string, Message>> = { [K in keyof M]: M[K] extends string ? string : M[K] }\n\ntype Values<T> = T extends (...values: infer V) => string ? V : []\n\n/**\n * An area's built-in texts in every language the screens come in, keyed by id: the lookup returns the one for the\n * active locale, `text('search')` or `text('rows', 3)`. Dutch must translate every English text, which the types check.\n */\nexport const defineMessages = <M extends Record<string, Message>>(catalogue: { en: M } & Record<Exclude<Locale, 'en'>, Translation<M>>) =>\n  <K extends keyof M>(id: K, ...values: Values<M[K]>): string => {\n    const message = (catalogue[activeLocale()] as M)[id]\n    return typeof message === 'function' ? (message as (...values: unknown[]) => string)(...values) : (message as string)\n  }\n","import { defineMessages } from '../../locale/messages'\n\nexport const text = defineMessages({\n  en: {\n    import: 'Import',\n    importPlural: (plural: string) => `Import ${plural.toLowerCase()}`,\n    couldNotReadFile: 'Could not read the file',\n    couldNotCheck: 'Could not check the rows',\n    cancel: 'Cancel',\n    next: 'Next',\n    checkRows: 'Check rows',\n    back: 'Back',\n    checking: 'Checking',\n    importRows: (count: string, rows: number) => `Import ${count} ${rows === 1 ? 'row' : 'rows'}`,\n    cancelImport: 'Cancel import',\n    done: 'Done',\n    file: 'File',\n    fileHint: 'An Excel workbook (.xlsx) or a CSV file saved as UTF-8. Its first row names the columns.',\n    reading: (name: string) => `Reading ${name}…`,\n    theFile: 'the file',\n    sheet: 'Sheet',\n    create: 'Create',\n    update: 'Update',\n    upsert: 'Create or update',\n    createHint: 'Each row creates a record.',\n    updateHint: 'Each row updates the record its value finds; a row that finds none is not imported.',\n    upsertHint: 'Each row updates the record its value finds, or creates one when it finds none.',\n    doNotImport: 'Do not import',\n    rows: 'Rows',\n    whatEachRowDoes: 'What each row does',\n    findBy: 'Find records by',\n    chooseField: 'Choose a field',\n    findByHint: 'A field no two records share, such as the key or an email.',\n    foundInColumn: 'Found in column',\n    chooseColumn: 'Choose a column',\n    numbers: 'Numbers',\n    dates: 'Dates',\n    dayFirst: 'Day first (31/12/2026)',\n    monthFirst: 'Month first (12/31/2026)',\n    datesHint: 'Dates written as 2026-12-31 read the same either way. Times without a zone are your own time.',\n    requiredMarked: 'New records need the fields marked *.',\n    columns: 'Columns',\n    emptyInFirstRows: 'Empty in the first rows',\n    field: 'Field',\n    fieldFor: (name: string) => `Field for ${name}`,\n    foundBy: 'Found by',\n    pluralFoundBy: (plural: string) => `${plural} found by`,\n    noColumnFills: (fields: string) => `No column fills ${fields}, which new records need.`,\n    rowsNotImported: 'Rows not imported',\n    rowProblems: (line: number) => `Row ${line}:`,\n    andMore: (count: string) => `And ${count} more rows, all in the file.`,\n    checkingRows: (count: string) => `Checking rows… ${count} read`,\n    check: 'Check',\n    toCreate: 'To create',\n    toUpdate: 'To update',\n    withProblems: 'With problems',\n    firstRows: 'First rows',\n    row: 'Row',\n    problemRows: 'Rows with problems, which are skipped',\n    download: 'Download',\n    batches: (size: number) => `Rows are saved in batches of ${size}. Cancelling, or an error, keeps the batches already saved; a row the server refuses is listed and the others are saved.`,\n    stopping: 'Stopping after this batch…',\n    saving: 'Saving rows…',\n    rowsSaved: 'Rows saved',\n    stopped: 'The import stopped. The rows counted below were saved.',\n    cancelled: 'Cancelled. The rows counted below were saved.',\n    summary: 'Import summary',\n    created: 'Created',\n    updated: 'Updated',\n    skipped: 'Skipped',\n    failed: 'Failed',\n    notWrittenHint: 'Skipped rows had problems in the file; the server refused the failed ones. The file holds each with the reason, to fix and import again.',\n    notImportedFile: (name: string) => `${name} - not imported.csv`,\n    line: 'Line',\n    problems: 'Problems',\n    notNumber: (cell: string) => `${cell} is not a number`,\n    notWholeNumber: (cell: string) => `${cell} is not a whole number`,\n    tooLarge: (cell: string) => `${cell} is too large`,\n    notBoolean: (cell: string) => `${cell} is not true or false (true, false, yes, no, 1 or 0)`,\n    notDate: (cell: string, dayFirst: boolean) => `${cell} is not a date (2026-04-03 or ${dayFirst ? 'day/month/year' : 'month/day/year'})`,\n    hasTime: (cell: string) => `${cell} has a time of day; the field holds a date`,\n    severalValues: (cell: string, values: string) => `${cell} matches more than one value: ${values}`,\n    notOneOf: (cell: string, values: string) => `${cell} is not one of ${values}`,\n    notText: (cell: string) => `${cell} is true or false, not text`,\n    emptyRequired: 'is empty, and it is required',\n    noneHas: (singular: string, named: string) => `no ${singular.toLowerCase()} has ${named}`,\n    severalHave: (count: number, plural: string, named: string) => `${count} ${plural.toLowerCase()} have ${named}`,\n    notOneRecord: (found: string) => `Not one record: ${found}`,\n    nothingToUpdate: (found: string) => `Nothing to update: ${found}`,\n    fileNotUtf8: 'The file is not UTF-8 text. Save it as \"CSV UTF-8\" and choose it again.',\n    noSheets: 'The workbook has no sheets',\n    missingSheetPart: 'The workbook names a sheet it does not hold',\n    notZip: 'The file is not an Excel workbook (.xlsx): it is no ZIP archive',\n    zip64: 'The workbook is too large to read: it is a ZIP64 archive',\n    compression: (part: string, method: number) => `The workbook's part ${part} is compressed in a way that cannot be read (method ${method})`,\n    notWorkbook: (part: string) => `The file is not an Excel workbook (.xlsx): it has no ${part}`,\n    noSheetCalled: (name: string) => `The workbook has no sheet called ${name}`,\n    unreadable: 'The file could not be read',\n    column: (letters: string) => `Column ${letters}`,\n  },\n  nl: {\n    import: 'Importeren',\n    importPlural: (plural: string) => `${plural} importeren`,\n    couldNotReadFile: 'Kon het bestand niet lezen',\n    couldNotCheck: 'Kon de rijen niet controleren',\n    cancel: 'Annuleren',\n    next: 'Volgende',\n    checkRows: 'Rijen controleren',\n    back: 'Terug',\n    checking: 'Controleren',\n    importRows: (count: string, rows: number) => `${count} ${rows === 1 ? 'rij' : 'rijen'} importeren`,\n    cancelImport: 'Import annuleren',\n    done: 'Klaar',\n    file: 'Bestand',\n    fileHint: 'Een Excel-werkmap (.xlsx) of een CSV-bestand bewaard als UTF-8. De eerste rij noemt de kolommen.',\n    reading: (name: string) => `${name} lezen…`,\n    theFile: 'het bestand',\n    sheet: 'Werkblad',\n    create: 'Maken',\n    update: 'Bijwerken',\n    upsert: 'Maken of bijwerken',\n    createHint: 'Elke rij maakt een record.',\n    updateHint: 'Elke rij werkt het record bij dat haar waarde vindt; een rij die er geen vindt, wordt niet geïmporteerd.',\n    upsertHint: 'Elke rij werkt het record bij dat haar waarde vindt, of maakt er een als ze er geen vindt.',\n    doNotImport: 'Niet importeren',\n    rows: 'Rijen',\n    whatEachRowDoes: 'Wat elke rij doet',\n    findBy: 'Records vinden op',\n    chooseField: 'Kies een veld',\n    findByHint: 'Een veld dat geen twee records delen, zoals de sleutel of een e-mailadres.',\n    foundInColumn: 'Gevonden in kolom',\n    chooseColumn: 'Kies een kolom',\n    numbers: 'Getallen',\n    dates: 'Datums',\n    dayFirst: 'Dag eerst (31/12/2026)',\n    monthFirst: 'Maand eerst (12/31/2026)',\n    datesHint: 'Datums geschreven als 2026-12-31 lezen hoe dan ook hetzelfde. Tijden zonder zone zijn in je eigen tijd.',\n    requiredMarked: 'Nieuwe records hebben de velden met * nodig.',\n    columns: 'Kolommen',\n    emptyInFirstRows: 'Leeg in de eerste rijen',\n    field: 'Veld',\n    fieldFor: (name: string) => `Veld voor ${name}`,\n    foundBy: 'Gevonden op',\n    pluralFoundBy: (plural: string) => `${plural} gevonden op`,\n    noColumnFills: (fields: string) => `Geen kolom vult ${fields}, wat nieuwe records nodig hebben.`,\n    rowsNotImported: 'Niet geïmporteerde rijen',\n    rowProblems: (line: number) => `Rij ${line}:`,\n    andMore: (count: string) => `En nog ${count} rijen, allemaal in het bestand.`,\n    checkingRows: (count: string) => `Rijen controleren… ${count} gelezen`,\n    check: 'Controle',\n    toCreate: 'Te maken',\n    toUpdate: 'Bij te werken',\n    withProblems: 'Met problemen',\n    firstRows: 'Eerste rijen',\n    row: 'Rij',\n    problemRows: 'Rijen met problemen, die worden overgeslagen',\n    download: 'Downloaden',\n    batches: (size: number) => `Rijen worden bewaard in groepen van ${size}. Annuleren, of een fout, houdt de groepen die al bewaard zijn; een rij die de server weigert, wordt vermeld en de andere worden bewaard.`,\n    stopping: 'Stoppen na deze groep…',\n    saving: 'Rijen bewaren…',\n    rowsSaved: 'Bewaarde rijen',\n    stopped: 'De import is gestopt. De rijen die hieronder zijn geteld, zijn bewaard.',\n    cancelled: 'Geannuleerd. De rijen die hieronder zijn geteld, zijn bewaard.',\n    summary: 'Samenvatting van de import',\n    created: 'Gemaakt',\n    updated: 'Bijgewerkt',\n    skipped: 'Overgeslagen',\n    failed: 'Mislukt',\n    notWrittenHint: 'Overgeslagen rijen hadden problemen in het bestand; de mislukte weigerde de server. Het bestand bevat elke rij met de reden, om te verbeteren en opnieuw te importeren.',\n    notImportedFile: (name: string) => `${name} - niet geïmporteerd.csv`,\n    line: 'Regel',\n    problems: 'Problemen',\n    notNumber: (cell: string) => `${cell} is geen getal`,\n    notWholeNumber: (cell: string) => `${cell} is geen geheel getal`,\n    tooLarge: (cell: string) => `${cell} is te groot`,\n    notBoolean: (cell: string) => `${cell} is niet waar of onwaar (true, false, yes, no, 1 of 0)`,\n    notDate: (cell: string, dayFirst: boolean) => `${cell} is geen datum (2026-04-03 of ${dayFirst ? 'dag/maand/jaar' : 'maand/dag/jaar'})`,\n    hasTime: (cell: string) => `${cell} heeft een tijd van de dag; het veld bevat een datum`,\n    severalValues: (cell: string, values: string) => `${cell} past bij meer dan één waarde: ${values}`,\n    notOneOf: (cell: string, values: string) => `${cell} is niet een van ${values}`,\n    notText: (cell: string) => `${cell} is waar of onwaar, geen tekst`,\n    emptyRequired: 'is leeg, en is verplicht',\n    noneHas: (singular: string, named: string) => `geen ${singular.toLowerCase()} heeft ${named}`,\n    severalHave: (count: number, plural: string, named: string) => `${count} ${plural.toLowerCase()} hebben ${named}`,\n    notOneRecord: (found: string) => `Niet één record: ${found}`,\n    nothingToUpdate: (found: string) => `Niets om bij te werken: ${found}`,\n    fileNotUtf8: 'Het bestand is geen UTF-8-tekst. Bewaar het als \"CSV UTF-8\" en kies het opnieuw.',\n    noSheets: 'De werkmap heeft geen werkbladen',\n    missingSheetPart: 'De werkmap noemt een werkblad dat er niet in zit',\n    notZip: 'Het bestand is geen Excel-werkmap (.xlsx): het is geen ZIP-archief',\n    zip64: 'De werkmap is te groot om te lezen: het is een ZIP64-archief',\n    compression: (part: string, method: number) => `Het deel ${part} van de werkmap is gecomprimeerd op een manier die niet kan worden gelezen (methode ${method})`,\n    notWorkbook: (part: string) => `Het bestand is geen Excel-werkmap (.xlsx): het heeft geen ${part}`,\n    noSheetCalled: (name: string) => `De werkmap heeft geen werkblad met de naam ${name}`,\n    unreadable: 'Het bestand kon niet worden gelezen',\n    column: (letters: string) => `Kolom ${letters}`,\n  },\n})\n","import type { SheetCell, SheetRow } from './sheet-cell'\nimport { text as message } from './messages'\n\n// The parts of an .xlsx's XML that an import reads: the sheets' names and files, the shared strings, which cell styles\n// are dates, and the rows of a sheet, read with patterns over the text since a Web Worker has no DOMParser.\n\nconst entities: Record<string, string> = { amp: '&', lt: '<', gt: '>', quot: '\"', apos: \"'\" }\n\n/** The text with XML's entities and character references replaced by what they stand for. */\nexport const decodeXml = (text: string) =>\n  text.replace(/&(#x[0-9a-f]+|#\\d+|amp|lt|gt|quot|apos);/gi, (whole, name: string) => {\n    if (name[0] !== '#') return entities[name.toLowerCase()] ?? whole\n    return String.fromCodePoint(name[1] === 'x' || name[1] === 'X' ? parseInt(name.slice(2), 16) : Number(name.slice(1)))\n  })\n\n/** An element's attributes, by name without their namespace prefix. */\nexport const attributes = (text: string) => {\n  const found: Record<string, string> = {}\n  for (const match of text.matchAll(/([\\w:.-]+)\\s*=\\s*(?:\"([^\"]*)\"|'([^']*)')/g)) {\n    const name = match[1]!.slice(match[1]!.indexOf(':') + 1)\n    found[name] = decodeXml(match[2] ?? match[3] ?? '')\n  }\n  return found\n}\n\n// The text of every <t> in a string item or inline string, without the phonetic runs (<rPh>) shown above the text\nconst runsText = (xml: string) =>\n  xml\n    .replace(/<rPh\\b[\\s\\S]*?<\\/rPh>/g, '')\n    .match(/<t\\b[^>]*>[\\s\\S]*?<\\/t>/g)\n    ?.map((run) => decodeXml(run.replace(/^<t\\b[^>]*>|<\\/t>$/g, '')))\n    .join('') ?? ''\n\n/** The workbook's shared strings (xl/sharedStrings.xml), which text cells point at by index. */\nexport const sharedStrings = (xml: string) => [...xml.matchAll(/<si\\b[^>]*?(?:\\/>|>([\\s\\S]*?)<\\/si>)/g)].map((match) => runsText(match[1] ?? ''))\n\nexport type WorkbookSheet = { name: string; path: string }\n\n/**\n * The workbook's sheets in order, each with the path of its part in the archive, from xl/workbook.xml and its\n * relationships (xl/_rels/workbook.xml.rels); `date1904` when its dates count from 1904, as old Mac workbooks do.\n */\nexport const workbookSheets = (workbookXml: string, relsXml: string) => {\n  const targets = new Map(\n    [...relsXml.matchAll(/<Relationship\\b([^>]*)>/g)].map((match) => {\n      const { Id, Target } = attributes(match[1]!)\n      return [Id, Target!.startsWith('/') ? Target!.slice(1) : `xl/${Target}`] as const\n    }),\n  )\n  const sheets: WorkbookSheet[] = [...workbookXml.matchAll(/<sheet\\b([^>]*)>/g)].map((match) => {\n    const { name, id } = attributes(match[1]!)\n    const path = targets.get(id)\n    if (!name || !path) throw new Error(message('missingSheetPart'))\n    return { name, path }\n  })\n  const pr = /<workbookPr\\b([^>]*)>/.exec(workbookXml)\n  const date1904 = pr ? ['1', 'true'].includes(attributes(pr[1]!).date1904 ?? '') : false\n  return { sheets, date1904 }\n}\n\n// Excel's built-in number formats that show dates and times\nconst builtInDates = new Set([14, 15, 16, 17, 18, 19, 20, 21, 22, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 45, 46, 47, 50, 51, 52, 53, 54, 55, 56, 57, 58])\n\n/** Whether a number format shows a date or time: it has d, m, y, h or s outside quoted text, colours and escapes. */\nexport const isDateFormat = (code: string) => /[dmyhs]/i.test(code.replace(/\"[^\"]*\"|\\[[^\\]]*\\]|\\\\.|_.|\\*./g, ''))\n\n/** The indexes of the cell styles (xl/styles.xml's cellXfs) whose number format is a date or time. */\nexport const dateStyles = (xml: string) => {\n  const custom = new Map([...xml.matchAll(/<numFmt\\b([^>]*)>/g)].map((match) => {\n    const { numFmtId, formatCode } = attributes(match[1]!)\n    return [Number(numFmtId), formatCode ?? ''] as const\n  }))\n  const cellXfs = /<cellXfs\\b[^>]*>([\\s\\S]*?)<\\/cellXfs>/.exec(xml)?.[1] ?? ''\n  const styles = new Set<number>()\n  ;[...cellXfs.matchAll(/<xf\\b([^>]*)>/g)].forEach((match, index) => {\n    const id = Number(attributes(match[1]!).numFmtId ?? 0)\n    if (builtInDates.has(id) || (custom.has(id) && isDateFormat(custom.get(id)!))) styles.add(index)\n  })\n  return styles\n}\n\nconst pad = (value: number) => String(value).padStart(2, '0')\n\n/**\n * A date cell's wall-clock time from its serial number, the days since the workbook's epoch: a date when it has no time\n * of day (`2026-03-01`), else to the second (`2026-03-01T14:30:00`). Excel's 1900 calendar counts a 29 February 1900\n * that never was, so serials before it are a day ahead.\n */\nexport const serialDate = (serial: number, date1904 = false) => {\n  const days = date1904 ? serial + 1462 : serial < 60 ? serial + 1 : serial\n  const at = new Date(Date.UTC(1899, 11, 30) + Math.round(days * 86400) * 1000)\n  const date = `${at.getUTCFullYear()}-${pad(at.getUTCMonth() + 1)}-${pad(at.getUTCDate())}`\n  const seconds = at.getUTCHours() * 3600 + at.getUTCMinutes() * 60 + at.getUTCSeconds()\n  return seconds === 0 ? date : `${date}T${pad(at.getUTCHours())}:${pad(at.getUTCMinutes())}:${pad(at.getUTCSeconds())}`\n}\n\n/** The 0-based column of a cell reference: `A1` is 0, `AB7` is 27. */\nexport const columnIndex = (ref: string) => {\n  let index = 0\n  for (const char of ref.toUpperCase()) {\n    const code = char.charCodeAt(0)\n    if (code < 65 || code > 90) break\n    index = index * 26 + (code - 64)\n  }\n  return index - 1\n}\n\nexport type SheetContext = { strings: string[]; dates: Set<number>; date1904: boolean }\n\nconst cellValue = (attrs: Record<string, string>, body: string, context: SheetContext): SheetCell => {\n  const type = attrs.t ?? 'n'\n  if (type === 'inlineStr') return runsText(body)\n  const raw = /<v\\b[^>]*>([\\s\\S]*?)<\\/v>/.exec(body)?.[1]\n  if (raw === undefined) return null\n  const value = decodeXml(raw)\n  if (type === 's') return context.strings[Number(value)] ?? null\n  if (type === 'b') return value === '1'\n  if (type === 'str' || type === 'e') return value\n  if (type === 'd') return { date: value.replace(/Z$/, '') }\n  const number = Number(value)\n  return context.dates.has(Number(attrs.s ?? 0)) ? { date: serialDate(number, context.date1904) } : number\n}\n\n/** One `<row>` element as a row of cells, each at its column; a row without a number follows `previous`. */\nexport const parseRow = (xml: string, context: SheetContext, previous: number): SheetRow => {\n  const open = /^<row\\b([^>]*)>/.exec(xml)\n  const line = Number(attributes(open?.[1] ?? '').r ?? previous + 1)\n  const cells: SheetCell[] = []\n  for (const match of xml.matchAll(/<c\\b([^>]*?)(?:\\/>|>([\\s\\S]*?)<\\/c>)/g)) {\n    const attrs = attributes(match[1]!)\n    const column = attrs.r ? columnIndex(attrs.r) : cells.length\n    while (cells.length < column) cells.push(null)\n    cells[column] = cellValue(attrs, match[2] ?? '', context)\n  }\n  return { line, cells }\n}\n\n/**\n * A scanner fed a sheet's XML a chunk at a time, which returns the `<row>` elements each chunk completes, so a large\n * sheet is read without holding its text whole.\n */\nexport const createRowScanner = () => {\n  let buffer = ''\n  return (chunk: string) => {\n    buffer += chunk\n    const rows: string[] = []\n    let end = 0\n    for (const match of buffer.matchAll(/<row\\b[^>]*?(?:\\/>|>[\\s\\S]*?<\\/row>)/g)) {\n      rows.push(match[0])\n      end = match.index + match[0].length\n    }\n    buffer = buffer.slice(end)\n    return rows\n  }\n}\n","\nimport { text as message } from './messages'\n\n// A reader of ZIP archives (an .xlsx is one) that reads the parts of the file it needs, so a large workbook is never\n// held whole: the central directory at the end, then each entry's bytes, inflated as they stream with the platform's\n// DecompressionStream.\n\nexport type ZipEntry = { name: string; method: number; offset: number; size: number }\n\nconst endSignature = 0x06054b50\nconst entrySignature = 0x02014b50\nconst localSignature = 0x04034b50\n// The end record is 22 bytes, followed by a comment of at most 65,535\nconst endSearch = 22 + 0xffff\n\nconst bytesOf = async (blob: Blob, start: number, end: number) => new DataView(await blob.slice(start, end).arrayBuffer())\n\nconst notZip = () => new Error(message('notZip'))\n\n// The offset of the end of central directory record in `view`, searching back from the end.\nconst endRecordAt = (view: DataView) => {\n  for (let at = view.byteLength - 22; at >= 0; at--) if (view.getUint32(at, true) === endSignature) return at\n  return -1\n}\n\n/** The archive's entries by name, from its central directory. A ZIP64 archive (over 4 GB) is refused. */\nexport const zipEntries = async (blob: Blob) => {\n  const tailStart = Math.max(0, blob.size - endSearch)\n  const tail = await bytesOf(blob, tailStart, blob.size)\n  const end = endRecordAt(tail)\n  if (end < 0) throw notZip()\n  const count = tail.getUint16(end + 10, true)\n  const size = tail.getUint32(end + 12, true)\n  const start = tail.getUint32(end + 16, true)\n  if (count === 0xffff || size === 0xffffffff || start === 0xffffffff) throw new Error(message('zip64'))\n  const directory = await bytesOf(blob, start, start + size)\n  const decoder = new TextDecoder()\n  const entries = new Map<string, ZipEntry>()\n  let at = 0\n  for (let index = 0; index < count; index++) {\n    if (directory.getUint32(at, true) !== entrySignature) throw notZip()\n    const nameLength = directory.getUint16(at + 28, true)\n    const extraLength = directory.getUint16(at + 30, true)\n    const commentLength = directory.getUint16(at + 32, true)\n    const name = decoder.decode(new Uint8Array(directory.buffer, directory.byteOffset + at + 46, nameLength))\n    entries.set(name, { name, method: directory.getUint16(at + 10, true), size: directory.getUint32(at + 20, true), offset: directory.getUint32(at + 42, true) })\n    at += 46 + nameLength + extraLength + commentLength\n  }\n  return entries\n}\n\n/** The entry's content as a stream of bytes: stored as it is, or inflated (deflate). */\nexport const zipEntryStream = async (blob: Blob, entry: ZipEntry): Promise<ReadableStream<BufferSource>> => {\n  const local = await bytesOf(blob, entry.offset, entry.offset + 30)\n  if (local.getUint32(0, true) !== localSignature) throw notZip()\n  const dataStart = entry.offset + 30 + local.getUint16(26, true) + local.getUint16(28, true)\n  const raw = blob.slice(dataStart, dataStart + entry.size).stream()\n  if (entry.method === 0) return raw\n  if (entry.method === 8) return raw.pipeThrough(new DecompressionStream('deflate-raw'))\n  throw new Error(message('compression', entry.name, entry.method))\n}\n\n/** The entry's content as text, decoded as UTF-8 a chunk at a time. */\nexport async function* zipTextChunks(blob: Blob, entry: ZipEntry) {\n  const reader = (await zipEntryStream(blob, entry)).pipeThrough(new TextDecoderStream()).getReader()\n  try {\n    for (;;) {\n      const { done, value } = await reader.read()\n      if (done) return\n      yield value\n    }\n  } finally {\n    await reader.cancel()\n  }\n}\n\n/** The entry's whole content as text, for the small parts of a workbook. */\nexport const zipText = async (blob: Blob, entry: ZipEntry) => {\n  const parts: string[] = []\n  for await (const text of zipTextChunks(blob, entry)) parts.push(text)\n  return parts.join('')\n}\n","import type { SheetRow } from './sheet-cell'\nimport { createRowScanner, dateStyles, parseRow, sharedStrings, workbookSheets, type SheetContext } from './xlsx-xml'\nimport { zipEntries, zipText, zipTextChunks, type ZipEntry } from './zip-reader'\nimport { text } from './messages'\n\nconst part = (entries: Map<string, ZipEntry>, name: string) => {\n  const entry = entries.get(name)\n  if (!entry) throw new Error(text('notWorkbook', name))\n  return entry\n}\n\n/**\n * An .xlsx workbook: the names of its sheets, and each sheet's rows read as its XML streams in. The shared strings and\n * the styles are read whole, since cells point into them; the sheets are not.\n */\nexport const openWorkbook = async (blob: Blob) => {\n  const entries = await zipEntries(blob)\n  const { sheets, date1904 } = workbookSheets(await zipText(blob, part(entries, 'xl/workbook.xml')), await zipText(blob, part(entries, 'xl/_rels/workbook.xml.rels')))\n  let context: SheetContext | undefined\n  const sheetContext = async () => {\n    const strings = entries.has('xl/sharedStrings.xml') ? sharedStrings(await zipText(blob, entries.get('xl/sharedStrings.xml')!)) : []\n    const dates = entries.has('xl/styles.xml') ? dateStyles(await zipText(blob, entries.get('xl/styles.xml')!)) : new Set<number>()\n    context = { strings, dates, date1904 }\n    return context\n  }\n\n  async function* rows(name: string): AsyncGenerator<SheetRow> {\n    const sheet = sheets.find((candidate) => candidate.name === name)\n    if (!sheet) throw new Error(text('noSheetCalled', name))\n    const shared = context ?? (await sheetContext())\n    const scan = createRowScanner()\n    let line = 0\n    for await (const chunk of zipTextChunks(blob, part(entries, sheet.path))) {\n      for (const xml of scan(chunk)) {\n        const row = parseRow(xml, shared, line)\n        line = row.line\n        yield row\n      }\n    }\n  }\n\n  return { sheets: sheets.map((sheet) => sheet.name), rows }\n}\n","import { createCsvParser } from './csv-parser'\nimport type { SheetRow } from './sheet-cell'\nimport { openWorkbook } from './xlsx-reader'\nimport { text } from './messages'\n\n/** The file kinds an import reads. */\nexport type SheetFormat = 'xlsx' | 'csv'\n\n// An .xlsx is a ZIP archive, which starts with \"PK\"\nconst startsAsZip = async (file: Blob) => {\n  const head = new Uint8Array(await file.slice(0, 2).arrayBuffer())\n  return head[0] === 0x50 && head[1] === 0x4b\n}\n\n/** Whether the file is a workbook or CSV text: by its name's extension, else by whether it is a ZIP archive. */\nexport const sheetFormat = async (file: File): Promise<SheetFormat> => {\n  const extension = /\\.([^.]+)$/.exec(file.name)?.[1]?.toLowerCase()\n  if (extension === 'xlsx') return 'xlsx'\n  if (extension === 'csv' || extension === 'tsv' || extension === 'txt') return 'csv'\n  return (await startsAsZip(file)) ? 'xlsx' : 'csv'\n}\n\n/** The workbook's sheet names, in order; a CSV has none. */\nexport const sheetNames = async (file: File) => ((await sheetFormat(file)) === 'xlsx' ? (await openWorkbook(file)).sheets : [])\n\nconst notText = () => new Error(text('fileNotUtf8'))\n\nasync function* csvRows(file: Blob): AsyncGenerator<SheetRow> {\n  const parser = createCsvParser()\n  // Fatal, so a file in another encoding is refused rather than read with replacement characters\n  const decoder = new TextDecoder('utf-8', { fatal: true })\n  const decode = (bytes?: Uint8Array) => {\n    try {\n      return bytes ? decoder.decode(bytes, { stream: true }) : decoder.decode()\n    } catch (error) {\n      if (error instanceof TypeError) throw notText()\n      throw error\n    }\n  }\n  const reader = file.stream().getReader()\n  let line = 0\n  const numbered = (rows: string[][]) => rows.map((cells) => ({ line: ++line, cells }))\n  try {\n    for (;;) {\n      const { done, value } = await reader.read()\n      if (done) break\n      yield* numbered(parser.push(decode(value)))\n    }\n    yield* numbered([...parser.push(decode()), ...parser.end()])\n  } finally {\n    await reader.cancel()\n  }\n}\n\n/**\n * The rows of the file, the header first, read as the file streams in: a CSV's (UTF-8, with its delimiter found from\n * the header line), or the named sheet of a workbook.\n */\nexport async function* sheetRows(file: File, sheet?: string): AsyncGenerator<SheetRow> {\n  if ((await sheetFormat(file)) === 'csv') return yield* csvRows(file)\n  const workbook = await openWorkbook(file)\n  const name = sheet ?? workbook.sheets[0]\n  if (name === undefined) throw new Error(text('noSheets'))\n  yield* workbook.rows(name)\n}\n","/// <reference lib=\"webworker\" />\nimport type { ParseReply, ParseRequest } from './parse-messages'\nimport { setFallbackLocale } from '../../locale/active-locale'\nimport { sheetNames, sheetRows } from './sheet-file'\n\n// Reads a chosen file off the main thread: its sheet names, or its rows a chunk at a time, the next chunk once the\n// page asks for it, so a large file is never read faster than the page uses it.\n\nconst scope = self as unknown as DedicatedWorkerGlobalScope\nconst reply = (message: ParseReply) => scope.postMessage(message)\nlet next: (() => void) | undefined\n\nconst read = async (request: Extract<ParseRequest, { type: 'read' }>) => {\n  let chunk = []\n  for await (const row of sheetRows(request.file, request.sheet)) {\n    chunk.push(row)\n    if (chunk.length < request.chunk) continue\n    const asked = new Promise<void>((resolve) => (next = resolve))\n    reply({ type: 'rows', rows: chunk })\n    chunk = []\n    await asked\n  }\n  reply({ type: 'rows', rows: chunk })\n  reply({ type: 'end' })\n}\n\nconst handle = async (request: ParseRequest) => {\n  if (request.type === 'next') return next?.()\n  setFallbackLocale(request.locale)\n  if (request.type === 'sheets') return reply({ type: 'sheets', sheets: await sheetNames(request.file) })\n  await read(request)\n}\n\nscope.onmessage = (event: MessageEvent<ParseRequest>) => {\n  handle(event.data).catch((error: unknown) => reply({ type: 'error', message: error instanceof Error ? error.message : String(error) }))\n}\n"],"mappings":"YAKA,IAAIE,EAAmB,KAIVC,MAAoCD,EAGpCE,EAAqB,GAAmB,CACnD,EAAWC,CACb,ECdMC,EAAa,CAAC,IAAK,IAAK,GAAI,EAMrBC,EAAmB,GAAuB,CACrD,IAAMC,EAAS,IAAI,IAAoBF,EAAW,IAAK,GAAc,CAACG,EAAW,CAAC,CAAC,CAAC,EAChFC,EAAS,GACb,IAAK,IAAMC,KAAQC,EACbD,IAAS,IAAK,EAAS,CAACD,EACnB,CAACA,GAAUF,EAAO,IAAIG,CAAI,GAAGH,EAAO,IAAIG,EAAMH,EAAO,IAAIG,CAAI,EAAK,CAAC,EAE9E,MAAO,CAAC,GAAGH,CAAM,CAAC,CAAC,QAAQ,EAAM,IAAWK,EAAM,GAAKC,EAAK,GAAKD,EAAQC,EAAO,CAAC,IAAK,CAAC,CAAqB,CAAC,CAAC,EAChH,EAGMC,EAAa,GAAiB,CAClC,IAAIL,EAAS,GACb,IAAK,IAAIM,EAAQ,EAAGA,EAAQC,EAAK,OAAQ,IAAS,CAChD,IAAMN,EAAOM,EAAKD,GAClB,GAAIL,IAAS,IAAK,EAAS,CAACD,OACvB,GAAI,CAACA,IAAWC,IAAS;GAAQA,IAAS,MAAO,OAAOM,EAAK,MAAM,EAAGD,CAAK,CAClF,CAEF,EAQaE,EAAmB,GAAmB,CACjD,IAAIT,EAAYU,EACZC,EAAU,GACVC,EAAU,GACVC,EAAQ,GACRC,EAAgB,CAAC,EACjBb,EAAS,GAETc,EAAY,GAEZC,EAAS,GAETC,EAAa,GAEXC,MAAiB,CACrBJ,EAAI,KAAKD,CAAK,EACd,EAAQ,EACV,EACMM,EAAU,GAAqB,CACnCD,EAAS,EACTE,EAAK,KAAKN,CAAG,EACb,EAAM,CAAC,EACP,EAAa,EACf,EAEMO,EAAW,GAAiB,CAChC,IAAMD,EAAmB,CAAC,EAC1B,IAAK,IAAMlB,KAAQM,EACjB,GACE,EADEQ,IACF,EAAS,GACLd,IAAS;IAEf,IAAID,EAAQ,CACV,GAAIc,EAAW,CAEb,GADA,EAAY,GACRb,IAAS,IAAK,CAChB,GAAS,IACT,QACF,CACA,EAAS,EACX,MAAO,GAAIA,IAAS,IAAK,CACvB,EAAY,GACZ,QACF,KAAO,CACL,GAASA,EACT,QACF,CACF,CACIA,IAAS,KAAOW,IAAU,IAC5B,EAAS,GACT,EAAa,IACJX,IAASF,GAClBkB,EAAS,EACT,EAAa,IACJhB,IAAS;GAAQA,IAAS,MACnC,EAASA,IAAS,KAClBiB,EAAOC,CAAI,IAEX,GAASlB,EACT,EAAa,GAZf,CAeF,OAAOkB,CACT,EAEME,EAAQ,GAAkB,CAC9B,GAAIV,EAAS,OAAOS,EAAQE,CAAK,EACjC,GAAWA,EACPZ,EAAQ,WAAW,CAAC,IAAM,QAAQ,EAAUA,EAAQ,MAAM,CAAC,GAC/D,IAAMa,EAASlB,EAAUK,CAAO,EAChC,GAAIa,IAAW,IAAA,GAAW,MAAO,CAAC,EAClC,EAAU,GACV,IAAc1B,EAAgB0B,CAAM,EACpC,IAAMhB,EAAOG,EAEb,MADA,GAAU,GACHU,EAAQb,CAAI,CACrB,EAYA,MAAO,CAAE,OAAM,QAVG,CAChB,IAAMY,EAAOR,EAAU,CAAC,EAAIU,EAAK;CAAI,EAMrC,OALIP,IACF,EAAY,GACZ,EAAS,KAEPE,GAAcJ,IAAU,KAAIM,EAAOC,CAAI,EACpCA,CACT,EAEoB,cAAiBpB,CAAU,CACjD,EExHaQ,GDaqD,IAC5C,EAAO,GAAGiB,IAAiC,CAC7D,IAAMC,EAAWC,EAAUjC,EAAa,EAAE,CAAOkC,GACjD,OAAO,OAAOF,GAAY,WAAcA,EAA6C,GAAGD,CAAM,EAAKC,CACrG,ECjBkB,CAAe,CACjC,GAAI,CACF,OAAQ,SACR,aAAe,GAAmB,UAAUG,EAAO,YAAY,IAC/D,iBAAkB,0BAClB,cAAe,2BACf,OAAQ,SACR,KAAM,OACN,UAAW,aACX,KAAM,OACN,SAAU,WACV,YAAa,EAAe,IAAiB,UAAUC,EAAM,GAAGV,IAAS,EAAI,MAAQ,SACrF,aAAc,gBACd,KAAM,OACN,KAAM,OACN,SAAU,2FACV,QAAU,GAAiB,WAAWW,EAAK,GAC3C,QAAS,WACT,MAAO,QACP,OAAQ,SACR,OAAQ,SACR,OAAQ,mBACR,WAAY,6BACZ,WAAY,sFACZ,WAAY,kFACZ,YAAa,gBACb,KAAM,OACN,gBAAiB,qBACjB,OAAQ,kBACR,YAAa,iBACb,WAAY,6DACZ,cAAe,kBACf,aAAc,kBACd,QAAS,UACT,MAAO,QACP,SAAU,yBACV,WAAY,2BACZ,UAAW,gGACX,eAAgB,wCAChB,QAAS,UACT,iBAAkB,0BAClB,MAAO,QACP,SAAW,GAAiB,aAAaA,IACzC,QAAS,WACT,cAAgB,GAAmB,GAAGF,EAAO,WAC7C,cAAgB,GAAmB,mBAAmBG,EAAO,2BAC7D,gBAAiB,oBACjB,YAAc,GAAiB,OAAOC,EAAK,GAC3C,QAAU,GAAkB,OAAOH,EAAM,8BACzC,aAAe,GAAkB,kBAAkBA,EAAM,OACzD,MAAO,QACP,SAAU,YACV,SAAU,YACV,aAAc,gBACd,UAAW,aACX,IAAK,MACL,YAAa,wCACb,SAAU,WACV,QAAU,GAAiB,gCAAgCI,EAAK,0HAChE,SAAU,6BACV,OAAQ,eACR,UAAW,aACX,QAAS,yDACT,UAAW,gDACX,QAAS,iBACT,QAAS,UACT,QAAS,UACT,QAAS,UACT,OAAQ,SACR,eAAgB,2IAChB,gBAAkB,GAAiB,GAAGH,EAAK,qBAC3C,KAAM,OACN,SAAU,WACV,UAAY,GAAiB,GAAGI,EAAK,kBACrC,eAAiB,GAAiB,GAAGA,EAAK,wBAC1C,SAAW,GAAiB,GAAGA,EAAK,eACpC,WAAa,GAAiB,GAAGA,EAAK,sDACtC,SAAU,EAAc,IAAsB,GAAGA,EAAK,gCAAgCC,EAAW,iBAAmB,iBAAiB,GACrI,QAAU,GAAiB,GAAGD,EAAK,4CACnC,eAAgB,EAAc,IAAmB,GAAGA,EAAK,gCAAgCV,IACzF,UAAW,EAAc,IAAmB,GAAGU,EAAK,iBAAiBV,IACrE,QAAU,GAAiB,GAAGU,EAAK,6BACnC,cAAe,+BACf,SAAU,EAAkB,IAAkB,MAAME,EAAS,YAAY,EAAE,OAAOC,IAClF,aAAc,EAAe,EAAgB,IAAkB,GAAGR,EAAM,GAAGD,EAAO,YAAY,EAAE,QAAQS,IACxG,aAAe,GAAkB,mBAAmBC,IACpD,gBAAkB,GAAkB,sBAAsBA,IAC1D,YAAa,0EACb,SAAU,6BACV,iBAAkB,8CAClB,OAAQ,kEACR,MAAO,2DACP,aAAc,EAAc,IAAmB,uBAAuBC,EAAK,sDAAsDC,EAAO,GACxI,YAAc,GAAiB,wDAAwDD,IACvF,cAAgB,GAAiB,oCAAoCT,IACrE,WAAY,6BACZ,OAAS,GAAoB,UAAUW,GACzC,EACA,GAAI,CACF,OAAQ,aACR,aAAe,GAAmB,GAAGb,EAAO,aAC5C,iBAAkB,6BAClB,cAAe,gCACf,OAAQ,YACR,KAAM,WACN,UAAW,oBACX,KAAM,QACN,SAAU,cACV,YAAa,EAAe,IAAiB,GAAGC,EAAM,GAAGV,IAAS,EAAI,MAAQ,QAAQ,aACtF,aAAc,mBACd,KAAM,QACN,KAAM,UACN,SAAU,mGACV,QAAU,GAAiB,GAAGW,EAAK,SACnC,QAAS,cACT,MAAO,WACP,OAAQ,QACR,OAAQ,YACR,OAAQ,qBACR,WAAY,6BACZ,WAAY,2GACZ,WAAY,6FACZ,YAAa,kBACb,KAAM,QACN,gBAAiB,oBACjB,OAAQ,oBACR,YAAa,gBACb,WAAY,6EACZ,cAAe,oBACf,aAAc,iBACd,QAAS,WACT,MAAO,SACP,SAAU,yBACV,WAAY,2BACZ,UAAW,0GACX,eAAgB,+CAChB,QAAS,WACT,iBAAkB,0BAClB,MAAO,OACP,SAAW,GAAiB,aAAaA,IACzC,QAAS,cACT,cAAgB,GAAmB,GAAGF,EAAO,cAC7C,cAAgB,GAAmB,mBAAmBG,EAAO,oCAC7D,gBAAiB,2BACjB,YAAc,GAAiB,OAAOC,EAAK,GAC3C,QAAU,GAAkB,UAAUH,EAAM,kCAC5C,aAAe,GAAkB,sBAAsBA,EAAM,UAC7D,MAAO,WACP,SAAU,WACV,SAAU,gBACV,aAAc,gBACd,UAAW,eACX,IAAK,MACL,YAAa,+CACb,SAAU,aACV,QAAU,GAAiB,uCAAuCI,EAAK,2IACvE,SAAU,yBACV,OAAQ,iBACR,UAAW,iBACX,QAAS,0EACT,UAAW,iEACX,QAAS,6BACT,QAAS,UACT,QAAS,aACT,QAAS,eACT,OAAQ,UACR,eAAgB,0KAChB,gBAAkB,GAAiB,GAAGH,EAAK,0BAC3C,KAAM,QACN,SAAU,YACV,UAAY,GAAiB,GAAGI,EAAK,gBACrC,eAAiB,GAAiB,GAAGA,EAAK,uBAC1C,SAAW,GAAiB,GAAGA,EAAK,cACpC,WAAa,GAAiB,GAAGA,EAAK,wDACtC,SAAU,EAAc,IAAsB,GAAGA,EAAK,gCAAgCC,EAAW,iBAAmB,iBAAiB,GACrI,QAAU,GAAiB,GAAGD,EAAK,sDACnC,eAAgB,EAAc,IAAmB,GAAGA,EAAK,iCAAiCV,IAC1F,UAAW,EAAc,IAAmB,GAAGU,EAAK,mBAAmBV,IACvE,QAAU,GAAiB,GAAGU,EAAK,gCACnC,cAAe,2BACf,SAAU,EAAkB,IAAkB,QAAQE,EAAS,YAAY,EAAE,SAASC,IACtF,aAAc,EAAe,EAAgB,IAAkB,GAAGR,EAAM,GAAGD,EAAO,YAAY,EAAE,UAAUS,IAC1G,aAAe,GAAkB,oBAAoBC,IACrD,gBAAkB,GAAkB,2BAA2BA,IAC/D,YAAa,mFACb,SAAU,mCACV,iBAAkB,mDAClB,OAAQ,qEACR,MAAO,+DACP,aAAc,EAAc,IAAmB,YAAYC,EAAK,sFAAsFC,EAAO,GAC7J,YAAc,GAAiB,6DAA6DD,IAC5F,cAAgB,GAAiB,8CAA8CT,IAC/E,WAAY,sCACZ,OAAS,GAAoB,SAASW,GACxC,CACF,CAAC,EC/LKC,EAAmC,CAAE,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,KAAM,IAAK,KAAM,GAAI,EAG/EC,EAAa,GACxBpC,EAAK,QAAQ,8CAA+C,EAAO,IAC7DuB,EAAK,KAAO,IACT,OAAO,cAAcA,EAAK,KAAO,KAAOA,EAAK,KAAO,IAAM,SAASA,EAAK,MAAM,CAAC,EAAG,EAAE,EAAI,OAAOA,EAAK,MAAM,CAAC,CAAC,CAAC,EADxFY,EAASZ,EAAK,YAAY,IAAMc,CAE7D,EAGUC,EAAc,GAAiB,CAC1C,IAAMP,EAAgC,CAAC,EACvC,IAAK,IAAMQ,KAASvC,EAAK,SAAS,2CAA2C,EAAG,CAC9E,IAAMuB,EAAOgB,EAAM,EAAE,CAAE,MAAMA,EAAM,EAAE,CAAE,QAAQ,GAAG,EAAI,CAAC,EACvD,EAAMhB,GAAQa,EAAUG,EAAM,IAAMA,EAAM,IAAM,EAAE,CACpD,CACA,OAAOR,CACT,EAGMS,EAAY,GAChBC,EACG,QAAQ,yBAA0B,EAAE,CAAC,CACrC,MAAM,0BAA0B,CAAC,EAChC,IAAK,GAAQL,EAAUM,EAAI,QAAQ,sBAAuB,EAAE,CAAC,CAAC,CAAC,CAChE,KAAK,EAAE,GAAK,GAGJC,EAAiB,GAAgB,CAAC,GAAGF,EAAI,SAAS,uCAAuC,CAAC,CAAC,CAAC,IAAK,GAAUD,EAASD,EAAM,IAAM,EAAE,CAAC,EAQnIK,GAAkB,EAAqB,IAAoB,CACtE,IAAMC,EAAU,IAAI,IAClB,CAAC,GAAGC,EAAQ,SAAS,0BAA0B,CAAC,CAAC,CAAC,IAAK,GAAU,CAC/D,GAAM,CAAE,KAAI,UAAWR,EAAWC,EAAM,EAAG,EAC3C,MAAO,CAACQ,EAAIC,EAAQ,WAAW,GAAG,EAAIA,EAAQ,MAAM,CAAC,EAAI,MAAMA,GAAQ,CACzE,CAAC,CACH,EACMC,EAA0B,CAAC,GAAGC,EAAY,SAAS,mBAAmB,CAAC,CAAC,CAAC,IAAK,GAAU,CAC5F,GAAM,CAAE,OAAM,MAAOZ,EAAWC,EAAM,EAAG,EACnCY,EAAON,EAAQ,IAAIzB,CAAE,EAC3B,GAAI,CAACG,GAAQ,CAAC4B,EAAM,MAAU,MAAMpE,EAAQ,kBAAkB,CAAC,EAC/D,MAAO,CAAE,OAAM,MAAK,CACtB,CAAC,EACKqE,EAAK,wBAAwB,KAAKF,CAAW,EAEnD,MAAO,CAAE,SAAQ,SADAE,EAAK,CAAC,IAAK,MAAM,CAAC,CAAC,SAASd,EAAWc,EAAG,EAAG,CAAC,CAAC,UAAY,EAAE,EAAI,EACxD,CAC5B,EAGMC,kBAAe,IAAI,IAAI,CAAC,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,CAAC,EAG5IC,EAAgB,GAAiB,WAAW,KAAKC,EAAK,QAAQ,iCAAkC,EAAE,CAAC,EAGnGC,EAAc,GAAgB,CACzC,IAAMC,EAAS,IAAI,IAAI,CAAC,GAAGhB,EAAI,SAAS,oBAAoB,CAAC,CAAC,CAAC,IAAK,GAAU,CAC5E,GAAM,CAAE,WAAU,cAAeH,EAAWC,EAAM,EAAG,EACrD,MAAO,CAAC,OAAOmB,CAAQ,EAAGC,GAAc,EAAE,CAC5C,CAAC,CAAC,EACIC,EAAU,wCAAwC,KAAKnB,CAAG,CAAC,GAAG,IAAM,GACpEoB,kBAAS,IAAI,IAKnB,MAJC,CAAC,GAAGD,EAAQ,SAAS,gBAAgB,CAAC,CAAC,CAAC,SAAS,EAAO,IAAU,CACjE,IAAMxC,EAAK,OAAOkB,EAAWC,EAAM,EAAG,CAAC,CAAC,UAAY,CAAC,GACjDc,EAAa,IAAIjC,CAAE,GAAMqC,EAAO,IAAIrC,CAAE,GAAKkC,EAAaG,EAAO,IAAIrC,CAAE,CAAE,IAAIyC,EAAO,IAAI9D,CAAK,CACjG,CAAC,EACM8D,CACT,EAEMC,EAAO,GAAkB,OAAOC,CAAK,CAAC,CAAC,SAAS,EAAG,GAAG,EAO/CC,GAAc,EAAgB,EAAW,KAAU,CAC9D,IAAMC,EAAOC,EAAWC,EAAS,KAAOA,EAAS,GAAKA,EAAS,EAAIA,EAC7DC,EAAK,IAAI,KAAK,KAAK,IAAI,KAAM,GAAI,EAAE,EAAI,KAAK,MAAMH,EAAO,KAAK,EAAI,GAAI,EACtEI,EAAO,GAAGD,EAAG,eAAe,EAAE,GAAGN,EAAIM,EAAG,YAAY,EAAI,CAAC,EAAE,GAAGN,EAAIM,EAAG,WAAW,CAAC,IAEvF,OADgBA,EAAG,YAAY,EAAI,KAAOA,EAAG,cAAc,EAAI,GAAKA,EAAG,cAAc,IAClE,EAAIC,EAAO,GAAGA,EAAK,GAAGP,EAAIM,EAAG,YAAY,CAAC,EAAE,GAAGN,EAAIM,EAAG,cAAc,CAAC,EAAE,GAAGN,EAAIM,EAAG,cAAc,CAAC,GACrH,EAGaE,EAAe,GAAgB,CAC1C,IAAIvE,EAAQ,EACZ,IAAK,IAAML,KAAQ6E,EAAI,YAAY,EAAG,CACpC,IAAMhB,EAAO7D,EAAK,WAAW,CAAC,EAC9B,GAAI6D,EAAO,IAAMA,EAAO,GAAI,MAC5B,EAAQxD,EAAQ,IAAMwD,EAAO,GAC/B,CACA,OAAOxD,EAAQ,CACjB,EAIMyE,GAAa,EAA+B,EAAc,IAAqC,CACnG,IAAMC,EAAOC,EAAM,GAAK,IACxB,GAAID,IAAS,YAAa,OAAOjC,EAASmC,CAAI,EAC9C,IAAMC,EAAM,4BAA4B,KAAKD,CAAI,CAAC,GAAG,GACrD,GAAIC,IAAQ,IAAA,GAAW,OAAO,KAC9B,IAAMb,EAAQ3B,EAAUwC,CAAG,EAC3B,GAAIH,IAAS,IAAK,OAAOI,EAAQ,QAAQ,OAAOd,CAAK,IAAM,KAC3D,GAAIU,IAAS,IAAK,OAAOV,IAAU,IACnC,GAAIU,IAAS,OAASA,IAAS,IAAK,OAAOV,EAC3C,GAAIU,IAAS,IAAK,MAAO,CAAE,KAAMV,EAAM,QAAQ,KAAM,EAAE,CAAE,EACzD,IAAMe,EAAS,OAAOf,CAAK,EAC3B,OAAOc,EAAQ,MAAM,IAAI,OAAOH,EAAM,GAAK,CAAC,CAAC,EAAI,CAAE,KAAMV,EAAWc,EAAQD,EAAQ,QAAQ,CAAE,EAAIC,CACpG,EAGaC,GAAY,EAAa,EAAuB,IAA+B,CAC1F,IAAMC,EAAO,kBAAkB,KAAKvC,CAAG,EACjChB,EAAO,OAAOa,EAAW0C,IAAO,IAAM,EAAE,CAAC,CAAC,GAAKC,EAAW,CAAC,EAC3DC,EAAqB,CAAC,EAC5B,IAAK,IAAM3C,KAASE,EAAI,SAAS,uCAAuC,EAAG,CACzE,IAAMiC,EAAQpC,EAAWC,EAAM,EAAG,EAC5B4C,EAAST,EAAM,EAAIJ,EAAYI,EAAM,CAAC,EAAIQ,EAAM,OACtD,KAAOA,EAAM,OAASC,GAAQD,EAAM,KAAK,IAAI,EAC7C,EAAMC,GAAUX,EAAUE,EAAOnC,EAAM,IAAM,GAAIsC,CAAO,CAC1D,CACA,MAAO,CAAE,OAAM,OAAM,CACvB,EAMaO,MAAyB,CACpC,IAAIC,EAAS,GACb,MAAQ,IAAkB,CACxB,GAAUtE,EACV,IAAMH,EAAiB,CAAC,EACpB0E,EAAM,EACV,IAAK,IAAM/C,KAAS8C,EAAO,SAAS,uCAAuC,EACzEzE,EAAK,KAAK2B,EAAM,EAAE,EAClB,EAAMA,EAAM,MAAQA,EAAM,EAAE,CAAC,OAG/B,MADA,GAAS8C,EAAO,MAAMC,CAAG,EAClB1E,CACT,CACF,EC3IM2E,EAAU,MAAO,EAAY,EAAe,IAAgB,IAAI,SAAS,MAAMC,EAAK,MAAMC,EAAOH,CAAG,CAAC,CAAC,YAAY,CAAC,EAEnHI,MAAmB,MAAM1G,EAAQ,QAAQ,CAAC,EAG1C2G,EAAe,GAAmB,CACtC,IAAK,IAAIvB,EAAKwB,EAAK,WAAa,GAAIxB,GAAM,EAAG,IAAM,GAAIwB,EAAK,UAAUxB,EAAI,EAAI,IAAM,UAAc,OAAOA,EACzG,MAAO,EACT,EAGayB,EAAa,KAAO,IAAe,CAC9C,IAAMC,EAAY,KAAK,IAAI,EAAGN,EAAK,KAAO,KAAS,EAC7CO,EAAO,MAAMR,EAAQC,EAAMM,EAAWN,EAAK,IAAI,EAC/CF,EAAMK,EAAYI,CAAI,EAC5B,GAAIT,EAAM,EAAG,MAAMI,EAAO,EAC1B,IAAMpE,EAAQyE,EAAK,UAAUT,EAAM,GAAI,EAAI,EACrC5D,EAAOqE,EAAK,UAAUT,EAAM,GAAI,EAAI,EACpCG,EAAQM,EAAK,UAAUT,EAAM,GAAI,EAAI,EAC3C,GAAIhE,IAAU,OAAUI,IAAS,YAAc+D,IAAU,WAAY,MAAU,MAAMzG,EAAQ,OAAO,CAAC,EACrG,IAAMgH,EAAY,MAAMT,EAAQC,EAAMC,EAAOA,EAAQ/D,CAAI,EACnDuE,EAAU,IAAI,YACdC,kBAAU,IAAI,IAChB9B,EAAK,EACT,IAAK,IAAIrE,EAAQ,EAAGA,EAAQuB,EAAO,IAAS,CAC1C,GAAI0E,EAAU,UAAU5B,EAAI,EAAI,IAAM,SAAgB,MAAMsB,EAAO,EACnE,IAAMS,EAAaH,EAAU,UAAU5B,EAAK,GAAI,EAAI,EAC9CgC,EAAcJ,EAAU,UAAU5B,EAAK,GAAI,EAAI,EAC/CiC,EAAgBL,EAAU,UAAU5B,EAAK,GAAI,EAAI,EACjD7C,EAAO0E,EAAQ,OAAO,IAAI,WAAWD,EAAU,OAAQA,EAAU,WAAa5B,EAAK,GAAI+B,CAAU,CAAC,EACxGD,EAAQ,IAAI3E,EAAM,CAAE,OAAM,OAAQyE,EAAU,UAAU5B,EAAK,GAAI,EAAI,EAAG,KAAM4B,EAAU,UAAU5B,EAAK,GAAI,EAAI,EAAG,OAAQ4B,EAAU,UAAU5B,EAAK,GAAI,EAAI,CAAE,CAAC,EAC5J,GAAM,GAAK+B,EAAaC,EAAcC,CACxC,CACA,OAAOH,CACT,EAGaI,EAAiB,MAAO,EAAY,IAA2D,CAC1G,IAAMC,EAAQ,MAAMhB,EAAQC,EAAM5F,EAAM,OAAQA,EAAM,OAAS,EAAE,EACjE,GAAI2G,EAAM,UAAU,EAAG,EAAI,IAAM,SAAgB,MAAMb,EAAO,EAC9D,IAAMc,EAAY5G,EAAM,OAAS,GAAK2G,EAAM,UAAU,GAAI,EAAI,EAAIA,EAAM,UAAU,GAAI,EAAI,EACpF3B,EAAMY,EAAK,MAAMgB,EAAWA,EAAY5G,EAAM,IAAI,CAAC,CAAC,OAAO,EACjE,GAAIA,EAAM,SAAW,EAAG,OAAOgF,EAC/B,GAAIhF,EAAM,SAAW,EAAG,OAAOgF,EAAI,YAAY,IAAI,oBAAoB,aAAa,CAAC,EACrF,MAAU,MAAM5F,EAAQ,cAAeY,EAAM,KAAMA,EAAM,MAAM,CAAC,CAClE,EAGA,eAAuB6G,EAAc,EAAY,EAAiB,CAChE,IAAMC,GAAU,MAAMJ,EAAed,EAAM5F,CAAK,EAAA,CAAG,YAAY,IAAI,iBAAmB,CAAC,CAAC,UAAU,EAClG,GAAI,CACF,OAAS,CACP,GAAM,CAAE,OAAM,SAAU,MAAM8G,EAAO,KAAK,EAC1C,GAAIC,EAAM,OACV,MAAM5C,CACR,CACF,QAAU,CACR,MAAM2C,EAAO,OAAO,CACtB,CACF,CAGA,IAAaE,EAAU,MAAO,EAAY,IAAoB,CAC5D,IAAMC,EAAkB,CAAC,EACzB,UAAW,IAAM7G,KAAQyG,EAAcjB,EAAM5F,CAAK,EAAGiH,EAAM,KAAK7G,CAAI,EACpE,OAAO6G,EAAM,KAAK,EAAE,CACtB,EC5EM7E,GAAQ,EAAgC,IAAiB,CAC7D,IAAMpC,EAAQsG,EAAQ,IAAI3E,CAAI,EAC9B,GAAI,CAAC3B,EAAO,MAAU,MAAMI,EAAK,cAAeuB,CAAI,CAAC,EACrD,OAAO3B,CACT,EAMakH,EAAe,KAAO,IAAe,CAChD,IAAMZ,EAAU,MAAML,EAAWL,CAAI,EAC/B,CAAE,SAAQ,YAAa5C,EAAe,MAAMgE,EAAQpB,EAAMxD,EAAKkE,EAAS,iBAAiB,CAAC,EAAG,MAAMU,EAAQpB,EAAMxD,EAAKkE,EAAS,4BAA4B,CAAC,CAAC,EAC/JrB,EACEkC,EAAe,UAGnB,EAAU,CAAE,QAFIb,EAAQ,IAAI,sBAAsB,EAAIvD,EAAc,MAAMiE,EAAQpB,EAAMU,EAAQ,IAAI,sBAAsB,CAAE,CAAC,EAAI,CAAC,EAE7G,MADPA,EAAQ,IAAI,eAAe,EAAI1C,EAAW,MAAMoD,EAAQpB,EAAMU,EAAQ,IAAI,eAAe,CAAE,CAAC,kBAAI,IAAI,IACtF,UAAS,EAC9BrB,GAGT,eAAgBjE,EAAK,EAAwC,CAC3D,IAAMoG,EAAQ/D,EAAO,KAAM,GAAcgE,EAAU,OAAS1F,CAAI,EAChE,GAAI,CAACyF,EAAO,MAAU,MAAMhH,EAAK,gBAAiBuB,CAAI,CAAC,EACvD,IAAM2F,EAASrC,GAAY,MAAMkC,EAAa,EACxCI,EAAO/B,EAAiB,EAC1B3D,EAAO,EACX,UAAW,IAAMV,KAAS0F,EAAcjB,EAAMxD,EAAKkE,EAASc,EAAM,IAAI,CAAC,EACrE,IAAK,IAAMvE,KAAO0E,EAAKpG,CAAK,EAAG,CAC7B,IAAMT,EAAMyE,EAAStC,EAAKyE,EAAQzF,CAAI,EACtC,EAAOnB,EAAI,KACX,MAAMA,CACR,CAEJ,CAEA,MAAO,CAAE,OAAQ2C,EAAO,IAAK,GAAU+D,EAAM,IAAI,EAAG,MAAK,CAC3D,ECjCMI,EAAc,KAAO,IAAe,CACxC,IAAMC,EAAO,IAAI,WAAW,MAAMC,EAAK,MAAM,EAAG,CAAC,CAAC,CAAC,YAAY,CAAC,EAChE,OAAOD,EAAK,KAAO,IAAQA,EAAK,KAAO,EACzC,EAGaE,EAAc,KAAO,IAAqC,CACrE,IAAMC,EAAY,aAAa,KAAKF,EAAK,IAAI,CAAC,GAAG,EAAE,EAAE,YAAY,EAGjE,OAFIE,IAAc,OAAe,OAC7BA,IAAc,OAASA,IAAc,OAASA,IAAc,MAAc,MACtE,MAAMJ,EAAYE,CAAI,EAAK,OAAS,KAC9C,EAGaG,EAAa,KAAO,IAAiB,MAAMF,EAAYD,CAAI,IAAO,QAAU,MAAMR,EAAaQ,CAAI,EAAA,CAAG,OAAS,CAAC,EAEvHI,MAAoB,MAAM1H,EAAK,aAAa,CAAC,EAEnD,eAAgB2H,EAAQ,EAAsC,CAC5D,IAAMC,EAAS3H,EAAgB,EAEzBgG,EAAU,IAAI,YAAY,QAAS,CAAE,MAAO,EAAK,CAAC,EAClD4B,EAAU,GAAuB,CACrC,GAAI,CACF,OAAOC,EAAQ7B,EAAQ,OAAO6B,EAAO,CAAE,OAAQ,EAAK,CAAC,EAAI7B,EAAQ,OAAO,CAC1E,OAAS8B,EAAO,CAEd,MADIA,aAAiB,UAAiBL,EAAQ,EACxCK,CACR,CACF,EACMrB,EAASY,EAAK,OAAO,CAAC,CAAC,UAAU,EACnC7F,EAAO,EACLuG,EAAY,GAAqBpH,EAAK,IAAK,IAAW,CAAE,KAAM,EAAEa,EAAM,OAAM,EAAE,EACpF,GAAI,CACF,OAAS,CACP,GAAM,CAAE,OAAM,SAAU,MAAMiF,EAAO,KAAK,EAC1C,GAAIC,EAAM,MACV,MAAOqB,EAASJ,EAAO,KAAKC,EAAO9D,CAAK,CAAC,CAAC,CAC5C,CACA,MAAOiE,EAAS,CAAC,GAAGJ,EAAO,KAAKC,EAAO,CAAC,EAAG,GAAGD,EAAO,IAAI,CAAC,CAAC,CAC7D,QAAU,CACR,MAAMlB,EAAO,OAAO,CACtB,CACF,CAMA,eAAuBuB,EAAU,EAAY,EAA0C,CACrF,GAAK,MAAMV,EAAYD,CAAI,IAAO,MAAO,OAAO,MAAOK,EAAQL,CAAI,EACnE,IAAMY,EAAW,MAAMpB,EAAaQ,CAAI,EAClC/F,EAAOyF,GAASkB,EAAS,OAAO,GACtC,GAAI3G,IAAS,IAAA,GAAW,MAAU,MAAMvB,EAAK,UAAU,CAAC,EACxD,MAAOkI,EAAS,KAAK3G,CAAI,CAC3B,CCxDA,IAAM4G,EAAQ,KACRC,EAAS,GAAwBD,EAAM,YAAYjH,CAAO,EAC5DmH,EAEEC,EAAO,KAAO,IAAqD,CACvE,IAAIvH,EAAQ,CAAC,EACb,UAAW,IAAMT,KAAO2H,EAAUM,EAAQ,KAAMA,EAAQ,KAAK,EAAG,CAE9D,GADAxH,EAAM,KAAKT,CAAG,EACVS,EAAM,OAASwH,EAAQ,MAAO,SAClC,IAAMC,EAAQ,IAAI,QAAe,GAAa,EAAOC,CAAQ,EAC7DL,EAAM,CAAE,KAAM,OAAQ,KAAMrH,CAAM,CAAC,EACnC,EAAQ,CAAC,EACT,MAAMyH,CACR,CACAJ,EAAM,CAAE,KAAM,OAAQ,KAAMrH,CAAM,CAAC,EACnCqH,EAAM,CAAE,KAAM,KAAM,CAAC,CACvB,EAEMM,EAAS,KAAO,IAA0B,CAC9C,GAAIH,EAAQ,OAAS,OAAQ,OAAOF,IAAO,EAE3C,GADAlJ,EAAkBoJ,EAAQ,MAAM,EAC5BA,EAAQ,OAAS,SAAU,OAAOH,EAAM,CAAE,KAAM,SAAU,OAAQ,MAAMX,EAAWc,EAAQ,IAAI,CAAE,CAAC,EACtG,MAAMD,EAAKC,CAAO,CACpB,EAEA,EAAM,UAAa,GAAsC,CACvDG,EAAOC,EAAM,IAAI,CAAC,CAAC,MAAO,GAAmBP,EAAM,CAAE,KAAM,QAAS,QAASL,aAAiB,MAAQA,EAAM,QAAU,OAAOA,CAAK,CAAE,CAAC,CAAC,CACxI","debugId":"1485bc04-8d2d-4d50-ac83-b2ff357905cb"}