@jinntec/jinntap 1.33.0 → 1.34.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (8) hide show
  1. package/dist/index.es.js +23 -10
  2. package/dist/jinn-tap.css +170 -12
  3. package/dist/jinn-tap.es.js +3907 -3629
  4. package/dist/jinn-tap.es.js.map +1 -1
  5. package/dist/storage.es.js +980 -152
  6. package/dist/storage.es.js.map +1 -1
  7. package/dist/tei-editor-styles.css +1 -0
  8. package/package.json +2 -1
package/dist/storage.es.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"storage.es.js","sources":["../src/storage/document-store.js","../src/storage/document-name.js","../src/storage/attach-local-store.js"],"sourcesContent":["const DB_NAME = 'jinntap';\nconst DB_VERSION = 1;\nconst DOCUMENTS_STORE = 'documents';\n\n/**\n * @typedef {object} StoredDocument\n * @property {string} id\n * @property {string} name - Human-readable display title\n * @property {string} format - `'tei'` | `'jats'`\n * @property {string} xml - Full document XML\n * @property {number} updatedAt - Epoch ms\n * @property {boolean} [nameLocked] - When true, autosave will not overwrite `name`\n * @property {string} [filename] - Optional download filename (`metadata.name`)\n */\n\n/**\n * Thin IndexedDB wrapper for local JinnTap documents.\n * Schema versioning leaves room for a future `assets` object store.\n */\nexport class DocumentStore {\n /**\n * @param {string} [dbName]\n */\n constructor(dbName = DB_NAME) {\n this.dbName = dbName;\n /** @type {IDBDatabase|null} */\n this._db = null;\n }\n\n /**\n * Open (or create) the database.\n * @returns {Promise<DocumentStore>}\n */\n async open() {\n if (this._db) {\n return this;\n }\n this._db = await new Promise((resolve, reject) => {\n const request = indexedDB.open(this.dbName, DB_VERSION);\n request.onerror = () => reject(request.error ?? new Error('Failed to open IndexedDB'));\n request.onsuccess = () => resolve(request.result);\n request.onupgradeneeded = (event) => {\n const db = /** @type {IDBOpenDBRequest} */ (event.target).result;\n if (!db.objectStoreNames.contains(DOCUMENTS_STORE)) {\n const store = db.createObjectStore(DOCUMENTS_STORE, { keyPath: 'id' });\n store.createIndex('updatedAt', 'updatedAt', { unique: false });\n store.createIndex('format', 'format', { unique: false });\n }\n // Future: assets object store in a later DB_VERSION\n };\n });\n return this;\n }\n\n /**\n * @returns {IDBDatabase}\n */\n _requireDb() {\n if (!this._db) {\n throw new Error('DocumentStore is not open; call open() first');\n }\n return this._db;\n }\n\n /**\n * @param {IDBTransactionMode} mode\n * @returns {IDBObjectStore}\n */\n _store(mode) {\n return this._requireDb().transaction(DOCUMENTS_STORE, mode).objectStore(DOCUMENTS_STORE);\n }\n\n /**\n * @template T\n * @param {IDBRequest<T>} request\n * @returns {Promise<T>}\n */\n _request(request) {\n return new Promise((resolve, reject) => {\n request.onsuccess = () => resolve(request.result);\n request.onerror = () => reject(request.error ?? new Error('IndexedDB request failed'));\n });\n }\n\n /**\n * @param {string} id\n * @returns {Promise<StoredDocument|undefined>}\n */\n async get(id) {\n const result = await this._request(this._store('readonly').get(id));\n return result ?? undefined;\n }\n\n /**\n * @returns {Promise<StoredDocument[]>}\n */\n async list() {\n const docs = await this._request(this._store('readonly').getAll());\n return (docs ?? []).sort((a, b) => (b.updatedAt ?? 0) - (a.updatedAt ?? 0));\n }\n\n /**\n * Insert or replace a document record.\n * @param {StoredDocument} doc\n * @returns {Promise<StoredDocument>}\n */\n async put(doc) {\n if (!doc?.id) {\n throw new Error('DocumentStore.put requires a document with an id');\n }\n /** @type {StoredDocument} */\n const record = {\n ...doc,\n updatedAt: doc.updatedAt ?? Date.now(),\n };\n await this._request(this._store('readwrite').put(record));\n return record;\n }\n\n /**\n * @param {string} id\n * @returns {Promise<void>}\n */\n async delete(id) {\n await this._request(this._store('readwrite').delete(id));\n }\n\n /**\n * Close the database connection.\n */\n close() {\n if (this._db) {\n this._db.close();\n this._db = null;\n }\n }\n}\n","const GENERIC_TITLES = new Set(['untitled document', 'untitled article', 'untitled']);\n\n/**\n * @param {string} title\n * @returns {boolean}\n */\nexport function isGenericTitle(title) {\n return !title || GENERIC_TITLES.has(title.trim().toLowerCase());\n}\n\n/**\n * @param {string} text\n * @param {number} [max=80]\n * @returns {string}\n */\nexport function truncateTitle(text, max = 80) {\n const cleaned = text.replace(/\\s+/g, ' ').trim();\n if (cleaned.length <= max) {\n return cleaned;\n }\n return `${cleaned.slice(0, max - 1).trimEnd()}…`;\n}\n\n/**\n * Pull a document title from TEI `titleStmt/title` or JATS `article-title`.\n * @param {string} xml\n * @returns {string|null}\n */\nexport function extractTitleFromXml(xml) {\n if (!xml || typeof xml !== 'string') {\n return null;\n }\n try {\n const doc = new DOMParser().parseFromString(xml, 'application/xml');\n if (doc.querySelector('parsererror')) {\n return null;\n }\n\n const elements = doc.getElementsByTagName('*');\n /** @type {Element|null} */\n let titleStmtTitle = null;\n /** @type {Element|null} */\n let articleTitle = null;\n /** @type {Element|null} */\n let anyTitle = null;\n\n for (const el of elements) {\n const name = el.localName;\n if (name === 'title' && el.parentElement?.localName === 'titleStmt') {\n titleStmtTitle = el;\n break;\n }\n if (name === 'article-title' && !articleTitle) {\n articleTitle = el;\n }\n if (name === 'title' && !anyTitle) {\n anyTitle = el;\n }\n }\n\n const node = titleStmtTitle || articleTitle || anyTitle;\n const text = node?.textContent?.trim();\n return text && !isGenericTitle(text) ? truncateTitle(text) : null;\n } catch {\n return null;\n }\n}\n\n/**\n * Deduce a display name for a document.\n *\n * Order: meaningful `metadata.title` → XML header title → first plain-text line → fallback.\n *\n * @param {object} options\n * @param {string} [options.xml]\n * @param {{ title?: string }} [options.metadata]\n * @param {string} [options.plainText]\n * @param {string} [options.fallback='Untitled Document']\n * @returns {string}\n */\nexport function deduceDocumentName({ xml, metadata, plainText, fallback = 'Untitled Document' } = {}) {\n const metaTitle = metadata?.title?.trim();\n if (metaTitle && !isGenericTitle(metaTitle)) {\n return truncateTitle(metaTitle);\n }\n\n const fromXml = extractTitleFromXml(xml);\n if (fromXml) {\n return fromXml;\n }\n\n const firstLine = plainText\n ?.trim()\n .split(/\\r?\\n/)\n .find((line) => line.trim());\n if (firstLine) {\n return truncateTitle(firstLine);\n }\n\n return fallback;\n}\n","import { DocumentStore } from './document-store.js';\nimport { deduceDocumentName, isGenericTitle } from './document-name.js';\n\n/**\n * @typedef {import('./document-store.js').StoredDocument} StoredDocument\n */\n\n/**\n * @typedef {object} AttachLocalStoreOptions\n * @property {string} [documentId] - Stable key for the active document (default: `current-<format>`)\n * @property {number} [debounceMs=500]\n * @property {DocumentStore} [store] - Reuse an existing store instance\n * @property {boolean} [force=false] - Attach even when collaboration (`server`) is active\n * @property {boolean} [autoRestore=false] - Restore immediately without asking\n * @property {(record: StoredDocument) => boolean|Promise<boolean>} [onDraftAvailable] - Called when a draft exists; return true to restore\n * @property {(name: string) => void} [onNameChange] - Called when the display name changes\n * @property {(record: StoredDocument) => void} [onRestore] - Called after a draft is restored\n */\n\n/**\n * @typedef {object} LocalStoreHandle\n * @property {DocumentStore} store\n * @property {string} documentId\n * @property {boolean} restored\n * @property {StoredDocument|undefined} pendingDraft\n * @property {() => void} detach\n * @property {(record?: StoredDocument) => Promise<boolean>} restore\n * @property {(name: string) => Promise<StoredDocument>} rename\n * @property {() => Promise<void>} clear\n * @property {() => Promise<StoredDocument|undefined>} getRecord\n * @property {() => Promise<StoredDocument>} saveNow\n */\n\n/**\n * Bind a `<jinn-tap>` editor to IndexedDB: optionally restore a local draft on ready,\n * and debounced-autosave on `content-change`.\n *\n * @param {HTMLElement & { xml: string, metadata: object, format?: string, newDocument?: Function }} editor\n * @param {AttachLocalStoreOptions} [options]\n * @returns {Promise<LocalStoreHandle|null>} `null` when skipped (e.g. collaboration without `force`)\n */\nexport async function attachLocalStore(editor, options = {}) {\n const { debounceMs = 500, force = false, autoRestore = false, onDraftAvailable, onNameChange, onRestore } = options;\n\n if (!force && editor.hasAttribute('server')) {\n return null;\n }\n\n const format = (editor.getAttribute('format') || editor.format || 'tei').toLowerCase();\n const documentId = options.documentId || `current-${format}`;\n const store = options.store || new DocumentStore();\n await store.open();\n\n let nameLocked = false;\n let currentName = 'Untitled Document';\n let timer = null;\n let detached = false;\n let restored = false;\n let suppressingSave = false;\n /** @type {StoredDocument|undefined} */\n let pendingDraft;\n\n const emitName = (name) => {\n currentName = name;\n onNameChange?.(name);\n };\n\n const buildRecord = (xml, overrides = {}) => {\n const metadata = editor.metadata || {};\n let name = currentName;\n if (!nameLocked) {\n name = deduceDocumentName({\n xml,\n metadata,\n plainText: typeof editor.content === 'string' ? editor.content : undefined,\n });\n if (!isGenericTitle(name) && metadata.title !== name) {\n editor.metadata = { ...metadata, title: name };\n }\n }\n emitName(name);\n /** @type {StoredDocument} */\n return {\n id: documentId,\n name,\n format,\n xml,\n updatedAt: Date.now(),\n nameLocked,\n filename: editor.metadata?.name,\n ...overrides,\n };\n };\n\n const persist = async (xml) => {\n if (detached || suppressingSave || !xml) {\n return;\n }\n const record = buildRecord(xml);\n await store.put(record);\n return record;\n };\n\n const scheduleSave = (xml) => {\n if (detached || suppressingSave) {\n return;\n }\n clearTimeout(timer);\n timer = setTimeout(() => {\n persist(xml).catch((err) => console.error('jinntap local store save failed', err));\n }, debounceMs);\n };\n\n const onContentChange = (event) => {\n scheduleSave(event.detail?.xml);\n };\n\n const applyRestore = async (existing) => {\n if (!existing?.xml) {\n return false;\n }\n suppressingSave = true;\n try {\n // Avoid a later url attribute change reloading remote content over the draft\n if (editor.hasAttribute('url')) {\n editor.removeAttribute('url');\n }\n editor.xml = existing.xml;\n nameLocked = Boolean(existing.nameLocked);\n const filename = existing.filename || editor.metadata?.name || 'untitled.xml';\n editor.metadata = {\n ...(editor.metadata || {}),\n title: existing.name,\n name: filename,\n };\n emitName(existing.name);\n restored = true;\n pendingDraft = undefined;\n onRestore?.(existing);\n return true;\n } finally {\n // Allow the restore-triggered content-change to settle before saving again\n setTimeout(() => {\n suppressingSave = false;\n }, debounceMs + 50);\n }\n };\n\n const offerRestore = async () => {\n const existing = await store.get(documentId);\n if (!existing?.xml) {\n return false;\n }\n pendingDraft = existing;\n\n let shouldRestore = autoRestore;\n if (!autoRestore && onDraftAvailable) {\n shouldRestore = Boolean(await onDraftAvailable(existing));\n }\n\n if (shouldRestore) {\n return applyRestore(existing);\n }\n return false;\n };\n\n const waitUntilReady = () =>\n new Promise((resolve) => {\n if (editor._initialized || editor.editor) {\n resolve();\n return;\n }\n const onReady = () => resolve();\n editor.addEventListener('ready', onReady, { once: true });\n // Re-check in case `ready` fired between the guard and the listener\n if (editor._initialized || editor.editor) {\n editor.removeEventListener('ready', onReady);\n resolve();\n }\n });\n\n await waitUntilReady();\n await offerRestore();\n\n editor.addEventListener('content-change', onContentChange);\n\n return {\n store,\n documentId,\n get restored() {\n return restored;\n },\n get pendingDraft() {\n return pendingDraft;\n },\n detach() {\n detached = true;\n clearTimeout(timer);\n editor.removeEventListener('content-change', onContentChange);\n },\n async restore(record) {\n const existing = record || pendingDraft || (await store.get(documentId));\n return applyRestore(existing);\n },\n async rename(name) {\n const trimmed = name?.trim();\n if (!trimmed) {\n throw new Error('Document name must not be empty');\n }\n nameLocked = true;\n emitName(trimmed);\n editor.metadata = {\n ...(editor.metadata || {}),\n title: trimmed,\n };\n const xml = editor.xml;\n return store.put(\n buildRecord(xml, {\n name: trimmed,\n nameLocked: true,\n }),\n );\n },\n async clear() {\n clearTimeout(timer);\n await store.delete(documentId);\n nameLocked = false;\n emitName('Untitled Document');\n },\n async getRecord() {\n return store.get(documentId);\n },\n async saveNow() {\n clearTimeout(timer);\n return persist(editor.xml);\n },\n };\n}\n"],"names":["DB_NAME","DOCUMENTS_STORE","DocumentStore","dbName","resolve","reject","request","event","db","store","mode","id","b","doc","record","GENERIC_TITLES","isGenericTitle","title","truncateTitle","text","max","cleaned","extractTitleFromXml","xml","_a","_b","elements","titleStmtTitle","articleTitle","anyTitle","el","name","node","deduceDocumentName","metadata","plainText","fallback","metaTitle","fromXml","firstLine","line","attachLocalStore","editor","options","debounceMs","force","autoRestore","onDraftAvailable","onNameChange","onRestore","format","documentId","nameLocked","currentName","timer","detached","restored","suppressingSave","pendingDraft","emitName","buildRecord","overrides","persist","scheduleSave","err","onContentChange","applyRestore","existing","filename","offerRestore","shouldRestore","onReady","trimmed"],"mappings":"AAAA,MAAMA,IAAU;AAEhB,MAAMC,IAAkB;AAiBjB,MAAMC,EAAc;AAAA;AAAA;AAAA;AAAA,EAIvB,YAAYC,IAASH,GAAS;AAC1B,SAAK,SAASG,GAEd,KAAK,MAAM;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,OAAO;AACT,WAAI,KAAK,MACE,QAEX,KAAK,MAAM,MAAM,IAAI,QAAQ,CAACC,GAASC,MAAW;AAC9C,YAAMC,IAAU,UAAU,KAAK,KAAK,QAAQ,CAAU;AACtD,MAAAA,EAAQ,UAAU,MAAMD,EAAOC,EAAQ,SAAS,IAAI,MAAM,0BAA0B,CAAC,GACrFA,EAAQ,YAAY,MAAMF,EAAQE,EAAQ,MAAM,GAChDA,EAAQ,kBAAkB,CAACC,MAAU;AACjC,cAAMC;AAAA;AAAA,UAAsCD,EAAM,OAAQ;AAAA;AAC1D,YAAI,CAACC,EAAG,iBAAiB,SAASP,CAAe,GAAG;AAChD,gBAAMQ,IAAQD,EAAG,kBAAkBP,GAAiB,EAAE,SAAS,MAAM;AACrE,UAAAQ,EAAM,YAAY,aAAa,aAAa,EAAE,QAAQ,IAAO,GAC7DA,EAAM,YAAY,UAAU,UAAU,EAAE,QAAQ,IAAO;AAAA,QAC3D;AAAA,MAEJ;AAAA,IACJ,CAAC,GACM;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa;AACT,QAAI,CAAC,KAAK;AACN,YAAM,IAAI,MAAM,8CAA8C;AAElE,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAOC,GAAM;AACT,WAAO,KAAK,WAAU,EAAG,YAAYT,GAAiBS,CAAI,EAAE,YAAYT,CAAe;AAAA,EAC3F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAASK,GAAS;AACd,WAAO,IAAI,QAAQ,CAACF,GAASC,MAAW;AACpC,MAAAC,EAAQ,YAAY,MAAMF,EAAQE,EAAQ,MAAM,GAChDA,EAAQ,UAAU,MAAMD,EAAOC,EAAQ,SAAS,IAAI,MAAM,0BAA0B,CAAC;AAAA,IACzF,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,IAAIK,GAAI;AAEV,WADe,MAAM,KAAK,SAAS,KAAK,OAAO,UAAU,EAAE,IAAIA,CAAE,CAAC,KACjD;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAO;AAET,YADa,MAAM,KAAK,SAAS,KAAK,OAAO,UAAU,EAAE,QAAQ,KACjD,CAAA,GAAI,KAAK,CAAC,GAAGC,OAAOA,EAAE,aAAa,MAAM,EAAE,aAAa,EAAE;AAAA,EAC9E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,IAAIC,GAAK;AACX,QAAI,EAACA,KAAA,QAAAA,EAAK;AACN,YAAM,IAAI,MAAM,kDAAkD;AAGtE,UAAMC,IAAS;AAAA,MACX,GAAGD;AAAA,MACH,WAAWA,EAAI,aAAa,KAAK,IAAG;AAAA,IAChD;AACQ,iBAAM,KAAK,SAAS,KAAK,OAAO,WAAW,EAAE,IAAIC,CAAM,CAAC,GACjDA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,OAAOH,GAAI;AACb,UAAM,KAAK,SAAS,KAAK,OAAO,WAAW,EAAE,OAAOA,CAAE,CAAC;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ;AACJ,IAAI,KAAK,QACL,KAAK,IAAI,MAAK,GACd,KAAK,MAAM;AAAA,EAEnB;AACJ;ACxIA,MAAMI,IAAiB,oBAAI,IAAI,CAAC,qBAAqB,oBAAoB,UAAU,CAAC;AAM7E,SAASC,EAAeC,GAAO;AAClC,SAAO,CAACA,KAASF,EAAe,IAAIE,EAAM,KAAI,EAAG,aAAa;AAClE;AAOO,SAASC,EAAcC,GAAMC,IAAM,IAAI;AAC1C,QAAMC,IAAUF,EAAK,QAAQ,QAAQ,GAAG,EAAE,KAAI;AAC9C,SAAIE,EAAQ,UAAUD,IACXC,IAEJ,GAAGA,EAAQ,MAAM,GAAGD,IAAM,CAAC,EAAE,QAAO,CAAE;AACjD;AAOO,SAASE,EAAoBC,GAAK;AD5BzC,MAAAC,GAAAC;AC6BI,MAAI,CAACF,KAAO,OAAOA,KAAQ;AACvB,WAAO;AAEX,MAAI;AACA,UAAMV,IAAM,IAAI,UAAS,EAAG,gBAAgBU,GAAK,iBAAiB;AAClE,QAAIV,EAAI,cAAc,aAAa;AAC/B,aAAO;AAGX,UAAMa,IAAWb,EAAI,qBAAqB,GAAG;AAE7C,QAAIc,IAAiB,MAEjBC,IAAe,MAEfC,IAAW;AAEf,eAAWC,KAAMJ,GAAU;AACvB,YAAMK,IAAOD,EAAG;AAChB,UAAIC,MAAS,aAAWP,IAAAM,EAAG,kBAAH,gBAAAN,EAAkB,eAAc,aAAa;AACjE,QAAAG,IAAiBG;AACjB;AAAA,MACJ;AACA,MAAIC,MAAS,mBAAmB,CAACH,MAC7BA,IAAeE,IAEfC,MAAS,WAAW,CAACF,MACrBA,IAAWC;AAAA,IAEnB;AAEA,UAAME,IAAOL,KAAkBC,KAAgBC,GACzCV,KAAOM,IAAAO,KAAA,gBAAAA,EAAM,gBAAN,gBAAAP,EAAmB;AAChC,WAAON,KAAQ,CAACH,EAAeG,CAAI,IAAID,EAAcC,CAAI,IAAI;AAAA,EACjE,QAAQ;AACJ,WAAO;AAAA,EACX;AACJ;AAcO,SAASc,EAAmB,EAAE,KAAAV,GAAK,UAAAW,GAAU,WAAAC,GAAW,UAAAC,IAAW,oBAAmB,IAAK,IAAI;ADhFtG,MAAAZ;ACiFI,QAAMa,KAAYb,IAAAU,KAAA,gBAAAA,EAAU,UAAV,gBAAAV,EAAiB;AACnC,MAAIa,KAAa,CAACrB,EAAeqB,CAAS;AACtC,WAAOnB,EAAcmB,CAAS;AAGlC,QAAMC,IAAUhB,EAAoBC,CAAG;AACvC,MAAIe;AACA,WAAOA;AAGX,QAAMC,IAAYJ,KAAA,gBAAAA,EACZ,OACD,MAAM,SACN,KAAK,CAACK,MAASA,EAAK,KAAI;AAC7B,SAAID,IACOrB,EAAcqB,CAAS,IAG3BH;AACX;AC3DO,eAAeK,EAAiBC,GAAQC,IAAU,IAAI;AACzD,QAAM,EAAE,YAAAC,IAAa,KAAK,OAAAC,IAAQ,IAAO,aAAAC,IAAc,IAAO,kBAAAC,GAAkB,cAAAC,GAAc,WAAAC,EAAS,IAAKN;AAE5G,MAAI,CAACE,KAASH,EAAO,aAAa,QAAQ;AACtC,WAAO;AAGX,QAAMQ,KAAUR,EAAO,aAAa,QAAQ,KAAKA,EAAO,UAAU,OAAO,YAAW,GAC9ES,IAAaR,EAAQ,cAAc,WAAWO,CAAM,IACpDzC,IAAQkC,EAAQ,SAAS,IAAIzC,EAAa;AAChD,QAAMO,EAAM,KAAI;AAEhB,MAAI2C,IAAa,IACbC,IAAc,qBACdC,IAAQ,MACRC,IAAW,IACXC,IAAW,IACXC,IAAkB,IAElBC;AAEJ,QAAMC,IAAW,CAAC5B,MAAS;AACvB,IAAAsB,IAActB,GACdiB,KAAA,QAAAA,EAAejB;AAAA,EACnB,GAEM6B,IAAc,CAACrC,GAAKsC,IAAY,CAAA,MAAO;AFnEjD,QAAArC;AEoEQ,UAAMU,IAAWQ,EAAO,YAAY,CAAA;AACpC,QAAIX,IAAOsB;AACX,WAAKD,MACDrB,IAAOE,EAAmB;AAAA,MACtB,KAAAV;AAAA,MACA,UAAAW;AAAA,MACA,WAAW,OAAOQ,EAAO,WAAY,WAAWA,EAAO,UAAU;AAAA,IACjF,CAAa,GACG,CAAC1B,EAAee,CAAI,KAAKG,EAAS,UAAUH,MAC5CW,EAAO,WAAW,EAAE,GAAGR,GAAU,OAAOH,EAAI,KAGpD4B,EAAS5B,CAAI,GAEN;AAAA,MACH,IAAIoB;AAAA,MACJ,MAAApB;AAAA,MACA,QAAAmB;AAAA,MACA,KAAA3B;AAAA,MACA,WAAW,KAAK,IAAG;AAAA,MACnB,YAAA6B;AAAA,MACA,WAAU5B,IAAAkB,EAAO,aAAP,gBAAAlB,EAAiB;AAAA,MAC3B,GAAGqC;AAAA,IACf;AAAA,EACI,GAEMC,IAAU,OAAOvC,MAAQ;AAC3B,QAAIgC,KAAYE,KAAmB,CAAClC;AAChC;AAEJ,UAAMT,IAAS8C,EAAYrC,CAAG;AAC9B,iBAAMd,EAAM,IAAIK,CAAM,GACfA;AAAA,EACX,GAEMiD,IAAe,CAACxC,MAAQ;AAC1B,IAAIgC,KAAYE,MAGhB,aAAaH,CAAK,GAClBA,IAAQ,WAAW,MAAM;AACrB,MAAAQ,EAAQvC,CAAG,EAAE,MAAM,CAACyC,MAAQ,QAAQ,MAAM,mCAAmCA,CAAG,CAAC;AAAA,IACrF,GAAGpB,CAAU;AAAA,EACjB,GAEMqB,IAAkB,CAAC1D,MAAU;AFjHvC,QAAAiB;AEkHQ,IAAAuC,GAAavC,IAAAjB,EAAM,WAAN,gBAAAiB,EAAc,GAAG;AAAA,EAClC,GAEM0C,IAAe,OAAOC,MAAa;AFrH7C,QAAA3C;AEsHQ,QAAI,EAAC2C,KAAA,QAAAA,EAAU;AACX,aAAO;AAEX,IAAAV,IAAkB;AAClB,QAAI;AAEA,MAAIf,EAAO,aAAa,KAAK,KACzBA,EAAO,gBAAgB,KAAK,GAEhCA,EAAO,MAAMyB,EAAS,KACtBf,IAAa,EAAQe,EAAS;AAC9B,YAAMC,IAAWD,EAAS,cAAY3C,IAAAkB,EAAO,aAAP,gBAAAlB,EAAiB,SAAQ;AAC/D,aAAAkB,EAAO,WAAW;AAAA,QACd,GAAIA,EAAO,YAAY;QACvB,OAAOyB,EAAS;AAAA,QAChB,MAAMC;AAAA,MACtB,GACYT,EAASQ,EAAS,IAAI,GACtBX,IAAW,IACXE,IAAe,QACfT,KAAA,QAAAA,EAAYkB,IACL;AAAA,IACX,UAAC;AAEG,iBAAW,MAAM;AACb,QAAAV,IAAkB;AAAA,MACtB,GAAGb,IAAa,EAAE;AAAA,IACtB;AAAA,EACJ,GAEMyB,IAAe,YAAY;AAC7B,UAAMF,IAAW,MAAM1D,EAAM,IAAI0C,CAAU;AAC3C,QAAI,EAACgB,KAAA,QAAAA,EAAU;AACX,aAAO;AAEX,IAAAT,IAAeS;AAEf,QAAIG,IAAgBxB;AAKpB,WAJI,CAACA,KAAeC,MAChBuB,IAAgB,EAAQ,MAAMvB,EAAiBoB,CAAQ,IAGvDG,IACOJ,EAAaC,CAAQ,IAEzB;AAAA,EACX;AAiBA,eAdI,IAAI,QAAQ,CAAC/D,MAAY;AACrB,QAAIsC,EAAO,gBAAgBA,EAAO,QAAQ;AACtC,MAAAtC,EAAO;AACP;AAAA,IACJ;AACA,UAAMmE,IAAU,MAAMnE,EAAO;AAC7B,IAAAsC,EAAO,iBAAiB,SAAS6B,GAAS,EAAE,MAAM,IAAM,IAEpD7B,EAAO,gBAAgBA,EAAO,YAC9BA,EAAO,oBAAoB,SAAS6B,CAAO,GAC3CnE,EAAO;AAAA,EAEf,CAAC,GAGL,MAAMiE,EAAY,GAElB3B,EAAO,iBAAiB,kBAAkBuB,CAAe,GAElD;AAAA,IACH,OAAAxD;AAAA,IACA,YAAA0C;AAAA,IACA,IAAI,WAAW;AACX,aAAOK;AAAA,IACX;AAAA,IACA,IAAI,eAAe;AACf,aAAOE;AAAA,IACX;AAAA,IACA,SAAS;AACL,MAAAH,IAAW,IACX,aAAaD,CAAK,GAClBZ,EAAO,oBAAoB,kBAAkBuB,CAAe;AAAA,IAChE;AAAA,IACA,MAAM,QAAQnD,GAAQ;AAClB,YAAMqD,IAAWrD,KAAU4C,KAAiB,MAAMjD,EAAM,IAAI0C,CAAU;AACtE,aAAOe,EAAaC,CAAQ;AAAA,IAChC;AAAA,IACA,MAAM,OAAOpC,GAAM;AACf,YAAMyC,IAAUzC,KAAA,gBAAAA,EAAM;AACtB,UAAI,CAACyC;AACD,cAAM,IAAI,MAAM,iCAAiC;AAErD,MAAApB,IAAa,IACbO,EAASa,CAAO,GAChB9B,EAAO,WAAW;AAAA,QACd,GAAIA,EAAO,YAAY;QACvB,OAAO8B;AAAA,MACvB;AACY,YAAMjD,IAAMmB,EAAO;AACnB,aAAOjC,EAAM;AAAA,QACTmD,EAAYrC,GAAK;AAAA,UACb,MAAMiD;AAAA,UACN,YAAY;AAAA,QAChC,CAAiB;AAAA,MACjB;AAAA,IACQ;AAAA,IACA,MAAM,QAAQ;AACV,mBAAalB,CAAK,GAClB,MAAM7C,EAAM,OAAO0C,CAAU,GAC7BC,IAAa,IACbO,EAAS,mBAAmB;AAAA,IAChC;AAAA,IACA,MAAM,YAAY;AACd,aAAOlD,EAAM,IAAI0C,CAAU;AAAA,IAC/B;AAAA,IACA,MAAM,UAAU;AACZ,0BAAaG,CAAK,GACXQ,EAAQpB,EAAO,GAAG;AAAA,IAC7B;AAAA,EACR;AACA;"}
1
+ {"version":3,"file":"storage.es.js","sources":["../src/storage/db.js","../src/storage/document-store.js","../src/storage/document-name.js","../src/storage/attach-local-store.js","../src/storage/asset-store.js","../src/storage/indexeddb-asset-store.js","../src/storage/http-asset-store.js","../src/storage/attach-asset-store.js","../node_modules/fflate/esm/browser.js","../src/storage/export-assets.js"],"sourcesContent":["export const DB_NAME = 'jinntap';\nexport const DB_VERSION = 2;\nexport const DOCUMENTS_STORE = 'documents';\nexport const ASSETS_STORE = 'assets';\n\n/**\n * @param {IDBDatabase} db\n * @param {number} oldVersion\n */\nexport function upgradeJinntapDb(db, oldVersion) {\n if (!db.objectStoreNames.contains(DOCUMENTS_STORE)) {\n const store = db.createObjectStore(DOCUMENTS_STORE, { keyPath: 'id' });\n store.createIndex('updatedAt', 'updatedAt', { unique: false });\n store.createIndex('format', 'format', { unique: false });\n }\n if (oldVersion < 2 && !db.objectStoreNames.contains(ASSETS_STORE)) {\n const store = db.createObjectStore(ASSETS_STORE, { keyPath: 'path' });\n store.createIndex('updatedAt', 'updatedAt', { unique: false });\n store.createIndex('mimeType', 'mimeType', { unique: false });\n }\n}\n\n/**\n * Open the shared `jinntap` IndexedDB database (documents + assets).\n *\n * @param {string} [dbName]\n * @returns {Promise<IDBDatabase>}\n */\nexport function openJinntapDb(dbName = DB_NAME) {\n return new Promise((resolve, reject) => {\n const request = indexedDB.open(dbName, DB_VERSION);\n request.onerror = () => reject(request.error ?? new Error('Failed to open IndexedDB'));\n request.onsuccess = () => resolve(request.result);\n request.onupgradeneeded = (event) => {\n const db = /** @type {IDBOpenDBRequest} */ (event.target).result;\n upgradeJinntapDb(db, event.oldVersion);\n };\n });\n}\n\n/**\n * @template T\n * @param {IDBRequest<T>} request\n * @returns {Promise<T>}\n */\nexport function idbRequest(request) {\n return new Promise((resolve, reject) => {\n request.onsuccess = () => resolve(request.result);\n request.onerror = () => reject(request.error ?? new Error('IndexedDB request failed'));\n });\n}\n","import { openJinntapDb, idbRequest, DOCUMENTS_STORE, DB_NAME } from './db.js';\n\n/**\n * @typedef {object} StoredDocument\n * @property {string} id\n * @property {string} name - Human-readable display title\n * @property {string} format - `'tei'` | `'jats'`\n * @property {string} xml - Full document XML\n * @property {number} updatedAt - Epoch ms\n * @property {boolean} [nameLocked] - When true, autosave will not overwrite `name`\n * @property {string} [filename] - Optional download filename (`metadata.name`)\n */\n\n/**\n * Thin IndexedDB wrapper for local JinnTap documents.\n * Shares the `jinntap` database with {@link IndexedDbAssetStore}.\n */\nexport class DocumentStore {\n /**\n * @param {string} [dbName]\n */\n constructor(dbName = DB_NAME) {\n this.dbName = dbName;\n /** @type {IDBDatabase|null} */\n this._db = null;\n }\n\n /**\n * Open (or create) the database.\n * @returns {Promise<DocumentStore>}\n */\n async open() {\n if (this._db) {\n return this;\n }\n this._db = await openJinntapDb(this.dbName);\n return this;\n }\n\n /**\n * @returns {IDBDatabase}\n */\n _requireDb() {\n if (!this._db) {\n throw new Error('DocumentStore is not open; call open() first');\n }\n return this._db;\n }\n\n /**\n * @param {IDBTransactionMode} mode\n * @returns {IDBObjectStore}\n */\n _store(mode) {\n return this._requireDb().transaction(DOCUMENTS_STORE, mode).objectStore(DOCUMENTS_STORE);\n }\n\n /**\n * @param {string} id\n * @returns {Promise<StoredDocument|undefined>}\n */\n async get(id) {\n const result = await idbRequest(this._store('readonly').get(id));\n return result ?? undefined;\n }\n\n /**\n * @returns {Promise<StoredDocument[]>}\n */\n async list() {\n const docs = await idbRequest(this._store('readonly').getAll());\n return (docs ?? []).sort((a, b) => (b.updatedAt ?? 0) - (a.updatedAt ?? 0));\n }\n\n /**\n * Insert or replace a document record.\n * @param {StoredDocument} doc\n * @returns {Promise<StoredDocument>}\n */\n async put(doc) {\n if (!doc?.id) {\n throw new Error('DocumentStore.put requires a document with an id');\n }\n /** @type {StoredDocument} */\n const record = {\n ...doc,\n updatedAt: doc.updatedAt ?? Date.now(),\n };\n await idbRequest(this._store('readwrite').put(record));\n return record;\n }\n\n /**\n * @param {string} id\n * @returns {Promise<void>}\n */\n async delete(id) {\n await idbRequest(this._store('readwrite').delete(id));\n }\n\n /**\n * Close the database connection.\n */\n close() {\n if (this._db) {\n this._db.close();\n this._db = null;\n }\n }\n}\n","const GENERIC_TITLES = new Set(['untitled document', 'untitled article', 'untitled']);\n\n/**\n * @param {string} title\n * @returns {boolean}\n */\nexport function isGenericTitle(title) {\n return !title || GENERIC_TITLES.has(title.trim().toLowerCase());\n}\n\n/**\n * True while a deduced title still looks like an incomplete draft\n * (e.g. a single typed letter, or a second word still being typed).\n * Auto-save should keep updating until this returns false.\n *\n * @param {string} title\n * @returns {boolean}\n */\nexport function isProvisionalTitle(title) {\n if (!title || isGenericTitle(title)) {\n return true;\n }\n const words = title.trim().split(/\\s+/).filter(Boolean);\n if (words.length < 2) {\n return true;\n }\n // Require the last word to look finished — \"Hello w\" stays provisional.\n return words[words.length - 1].length < 3;\n}\n\n/**\n * @param {string} text\n * @param {number} [max=80]\n * @returns {string}\n */\nexport function truncateTitle(text, max = 80) {\n const cleaned = text.replace(/\\s+/g, ' ').trim();\n if (cleaned.length <= max) {\n return cleaned;\n }\n return `${cleaned.slice(0, max - 1).trimEnd()}…`;\n}\n\n/**\n * Pull a document title from TEI `titleStmt/title` or JATS `article-title`.\n * @param {string} xml\n * @returns {string|null}\n */\nexport function extractTitleFromXml(xml) {\n if (!xml || typeof xml !== 'string') {\n return null;\n }\n try {\n const doc = new DOMParser().parseFromString(xml, 'application/xml');\n if (doc.querySelector('parsererror')) {\n return null;\n }\n\n const elements = doc.getElementsByTagName('*');\n /** @type {Element|null} */\n let titleStmtTitle = null;\n /** @type {Element|null} */\n let articleTitle = null;\n /** @type {Element|null} */\n let anyTitle = null;\n\n for (const el of elements) {\n const name = el.localName;\n if (name === 'title' && el.parentElement?.localName === 'titleStmt') {\n titleStmtTitle = el;\n break;\n }\n if (name === 'article-title' && !articleTitle) {\n articleTitle = el;\n }\n if (name === 'title' && !anyTitle) {\n anyTitle = el;\n }\n }\n\n const node = titleStmtTitle || articleTitle || anyTitle;\n const text = node?.textContent?.trim();\n return text && !isGenericTitle(text) ? truncateTitle(text) : null;\n } catch {\n return null;\n }\n}\n\n/**\n * Deduce a display name for a document.\n *\n * Order: meaningful `metadata.title` → XML header title → first plain-text line → fallback.\n * Short / incomplete titles (fewer than two words) are treated as provisional and\n * do not win over a longer plain-text line, so typing is not frozen after one letter.\n *\n * @param {object} options\n * @param {string} [options.xml]\n * @param {{ title?: string }} [options.metadata]\n * @param {string} [options.plainText]\n * @param {string} [options.fallback='Untitled Document']\n * @returns {string}\n */\nexport function deduceDocumentName({ xml, metadata, plainText, fallback = 'Untitled Document' } = {}) {\n const firstLine = plainText\n ?.trim()\n .split(/\\r?\\n/)\n .find((line) => line.trim());\n const fromPlain = firstLine ? truncateTitle(firstLine) : null;\n\n const metaTitle = metadata?.title?.trim();\n if (metaTitle && !isGenericTitle(metaTitle) && !isProvisionalTitle(metaTitle)) {\n return truncateTitle(metaTitle);\n }\n\n const fromXml = extractTitleFromXml(xml);\n if (fromXml && !isProvisionalTitle(fromXml)) {\n return fromXml;\n }\n\n if (fromPlain) {\n return fromPlain;\n }\n\n if (fromXml) {\n return fromXml;\n }\n\n if (metaTitle && !isGenericTitle(metaTitle)) {\n return truncateTitle(metaTitle);\n }\n\n return fallback;\n}\n","import { DocumentStore } from './document-store.js';\nimport { deduceDocumentName, isGenericTitle, isProvisionalTitle } from './document-name.js';\n\n/**\n * @typedef {import('./document-store.js').StoredDocument} StoredDocument\n */\n\n/**\n * @typedef {object} AttachLocalStoreOptions\n * @property {string} [documentId] - Stable key for the active document (default: `current-<format>`)\n * @property {number} [debounceMs=1200]\n * @property {DocumentStore} [store] - Reuse an existing store instance\n * @property {boolean} [force=false] - Attach even when collaboration (`server`) is active\n * @property {boolean} [autoRestore=false] - Restore immediately without asking\n * @property {(record: StoredDocument) => boolean|Promise<boolean>} [onDraftAvailable] - Called when a draft exists; return true to restore, false to discard it\n * @property {(name: string) => void} [onNameChange] - Called when the display name changes\n * @property {(record: StoredDocument) => void} [onRestore] - Called after a draft is restored\n */\n\n/**\n * @typedef {object} LocalStoreHandle\n * @property {DocumentStore} store\n * @property {string} documentId\n * @property {boolean} restored\n * @property {StoredDocument|undefined} pendingDraft\n * @property {() => void} detach\n * @property {(record?: StoredDocument) => Promise<boolean>} restore\n * @property {(name: string) => Promise<StoredDocument>} rename\n * @property {(xml: string, opts?: { filename?: string }) => Promise<StoredDocument>} loadDocument\n * @property {() => Promise<void>} clear\n * @property {() => Promise<StoredDocument|undefined>} getRecord\n * @property {() => Promise<StoredDocument>} saveNow\n */\n\n/**\n * Bind a `<jinn-tap>` editor to IndexedDB: optionally restore a local draft on ready,\n * and debounced-autosave on `content-change`.\n *\n * @param {HTMLElement & { xml: string, metadata: object, format?: string, newDocument?: Function }} editor\n * @param {AttachLocalStoreOptions} [options]\n * @returns {Promise<LocalStoreHandle|null>} `null` when skipped (e.g. collaboration without `force`)\n */\nexport async function attachLocalStore(editor, options = {}) {\n const { debounceMs = 1200, force = false, autoRestore = false, onDraftAvailable, onNameChange, onRestore } = options;\n\n if (!force && editor.hasAttribute('server')) {\n return null;\n }\n\n const format = (editor.getAttribute('format') || editor.format || 'tei').toLowerCase();\n const documentId = options.documentId || `current-${format}`;\n const store = options.store || new DocumentStore();\n await store.open();\n\n let nameLocked = false;\n let currentName = 'Untitled Document';\n let timer = null;\n let detached = false;\n let restored = false;\n let suppressingSave = false;\n /** @type {StoredDocument|undefined} */\n let pendingDraft;\n\n const emitName = (name) => {\n currentName = name;\n onNameChange?.(name);\n };\n\n const buildRecord = (xml, overrides = {}) => {\n const metadata = editor.metadata || {};\n let name = currentName;\n if (!nameLocked) {\n name = deduceDocumentName({\n xml,\n metadata,\n plainText: typeof editor.content === 'string' ? editor.content : undefined,\n });\n if (!isGenericTitle(name) && !isProvisionalTitle(name) && metadata.title !== name) {\n editor.metadata = { ...metadata, title: name };\n }\n }\n emitName(name);\n /** @type {StoredDocument} */\n return {\n id: documentId,\n name,\n format,\n xml,\n updatedAt: Date.now(),\n nameLocked,\n filename: editor.metadata?.name,\n ...overrides,\n };\n };\n\n const persist = async (xml) => {\n if (detached || suppressingSave || !xml) {\n return;\n }\n const record = buildRecord(xml);\n await store.put(record);\n return record;\n };\n\n const scheduleSave = (xml) => {\n if (detached || suppressingSave) {\n return;\n }\n clearTimeout(timer);\n timer = setTimeout(() => {\n persist(xml).catch((err) => console.error('jinntap local store save failed', err));\n }, debounceMs);\n };\n\n const onContentChange = (event) => {\n scheduleSave(event.detail?.xml);\n };\n\n const applyRestore = async (existing) => {\n if (!existing?.xml) {\n return false;\n }\n suppressingSave = true;\n try {\n // Avoid a later url attribute change reloading remote content over the draft\n if (editor.hasAttribute('url')) {\n editor.removeAttribute('url');\n }\n editor.xml = existing.xml;\n nameLocked = Boolean(existing.nameLocked);\n const filename = existing.filename || editor.metadata?.name || 'untitled.xml';\n editor.metadata = {\n ...(editor.metadata || {}),\n title: existing.name,\n name: filename,\n };\n emitName(existing.name);\n restored = true;\n pendingDraft = undefined;\n onRestore?.(existing);\n return true;\n } finally {\n // Allow the restore-triggered content-change to settle before saving again\n setTimeout(() => {\n suppressingSave = false;\n }, debounceMs + 50);\n }\n };\n\n const offerRestore = async () => {\n const existing = await store.get(documentId);\n if (!existing?.xml) {\n return false;\n }\n pendingDraft = existing;\n\n let shouldRestore = autoRestore;\n if (!autoRestore && onDraftAvailable) {\n shouldRestore = Boolean(await onDraftAvailable(existing));\n if (!shouldRestore) {\n // User declined — drop the draft so we do not prompt again on reload\n await store.delete(documentId);\n pendingDraft = undefined;\n return false;\n }\n }\n\n if (shouldRestore) {\n return applyRestore(existing);\n }\n return false;\n };\n\n const waitUntilReady = () =>\n new Promise((resolve) => {\n if (editor._initialized || editor.editor) {\n resolve();\n return;\n }\n const onReady = () => resolve();\n editor.addEventListener('ready', onReady, { once: true });\n // Re-check in case `ready` fired between the guard and the listener\n if (editor._initialized || editor.editor) {\n editor.removeEventListener('ready', onReady);\n resolve();\n }\n });\n\n await waitUntilReady();\n await offerRestore();\n\n editor.addEventListener('content-change', onContentChange);\n\n return {\n store,\n documentId,\n get restored() {\n return restored;\n },\n get pendingDraft() {\n return pendingDraft;\n },\n detach() {\n detached = true;\n clearTimeout(timer);\n editor.removeEventListener('content-change', onContentChange);\n },\n async restore(record) {\n const existing = record || pendingDraft || (await store.get(documentId));\n return applyRestore(existing);\n },\n async rename(name) {\n const trimmed = name?.trim();\n if (!trimmed) {\n throw new Error('Document name must not be empty');\n }\n nameLocked = true;\n emitName(trimmed);\n editor.metadata = {\n ...(editor.metadata || {}),\n title: trimmed,\n };\n const xml = editor.xml;\n return store.put(\n buildRecord(xml, {\n name: trimmed,\n nameLocked: true,\n }),\n );\n },\n /**\n * Replace editor content with newly loaded XML (e.g. file upload).\n * Unlocks the display name and re-deduces it from the new document —\n * does not keep a previous `metadata.title` or `nameLocked` value.\n *\n * @param {string} xml\n * @param {{ filename?: string }} [opts]\n * @returns {Promise<StoredDocument>}\n */\n async loadDocument(xml, { filename } = {}) {\n if (!xml) {\n throw new Error('Document XML must not be empty');\n }\n nameLocked = false;\n suppressingSave = true;\n try {\n if (editor.hasAttribute('url')) {\n editor.removeAttribute('url');\n }\n editor.xml = xml;\n const fallback = filename\n ? filename.replace(/\\.xml$/i, '').trim() || 'Untitled Document'\n : 'Untitled Document';\n const displayName = deduceDocumentName({\n xml,\n // Ignore stale metadata from the previous document\n metadata: {},\n plainText: typeof editor.content === 'string' ? editor.content : undefined,\n fallback,\n });\n editor.metadata = {\n name: filename || editor.metadata?.name || 'untitled.xml',\n title: displayName,\n };\n emitName(displayName);\n clearTimeout(timer);\n // Persist directly: `persist()` no-ops while suppressingSave is set\n // (that flag only exists to ignore the content-change from assigning xml).\n const record = buildRecord(editor.xml);\n await store.put(record);\n return record;\n } finally {\n setTimeout(() => {\n suppressingSave = false;\n }, debounceMs + 50);\n }\n },\n async clear() {\n clearTimeout(timer);\n await store.delete(documentId);\n nameLocked = false;\n emitName('Untitled Document');\n },\n async getRecord() {\n return store.get(documentId);\n },\n async saveNow() {\n clearTimeout(timer);\n return persist(editor.xml);\n },\n };\n}\n","/**\n * @typedef {object} AssetMeta\n * @property {string} path - Relative path used in graphic `url` / `xlink:href` (e.g. `myimage.png`)\n * @property {string} mimeType\n * @property {number} updatedAt - Epoch ms\n * @property {number} [size] - Byte length\n */\n\n/**\n * @typedef {AssetMeta & { blob: Blob }} StoredAsset\n */\n\n/**\n * Pluggable asset backend for images (and later other binaries).\n *\n * Implementations must support relative paths in XML attributes. Absolute\n * `http(s):` / `data:` / `blob:` hrefs should pass through `resolve` unchanged.\n *\n * @typedef {object} AssetStore\n * @property {() => Promise<AssetStore>} [open]\n * @property {() => Promise<AssetMeta[]>} list\n * @property {(path: string) => Promise<StoredAsset|undefined>} get\n * @property {(asset: { path: string, blob: Blob, mimeType?: string }) => Promise<StoredAsset>} put\n * @property {(path: string) => Promise<void>} delete\n * @property {(href: string) => Promise<string>|string} resolve - Displayable URL for an href\n * @property {(url: string) => void} [revoke]\n * @property {() => void} [close]\n */\n\n/**\n * @param {string} href\n * @returns {boolean}\n */\nexport function isAbsoluteAssetHref(href) {\n return /^(https?:|data:|blob:)/i.test(href?.trim() ?? '');\n}\n\n/**\n * Normalize an upload filename to a relative path (basename only).\n * @param {string} name\n * @returns {string}\n */\nexport function sanitizeAssetPath(name) {\n const base = (name || 'image').replace(/\\\\/g, '/').split('/').pop().trim();\n return base || 'image';\n}\n","import { openJinntapDb, idbRequest, ASSETS_STORE, DB_NAME } from './db.js';\nimport { isAbsoluteAssetHref, sanitizeAssetPath } from './asset-store.js';\n\n/**\n * @typedef {import('./asset-store.js').AssetMeta} AssetMeta\n * @typedef {import('./asset-store.js').StoredAsset} StoredAsset\n */\n\n/**\n * IndexedDB {@link AssetStore} implementation.\n * Shares the `jinntap` database with {@link DocumentStore}.\n */\nexport class IndexedDbAssetStore {\n /**\n * @param {string} [dbName]\n */\n constructor(dbName = DB_NAME) {\n this.dbName = dbName;\n /** @type {IDBDatabase|null} */\n this._db = null;\n /** @type {Map<string, string>} */\n this._objectUrls = new Map();\n }\n\n /**\n * @returns {Promise<IndexedDbAssetStore>}\n */\n async open() {\n if (this._db) {\n return this;\n }\n this._db = await openJinntapDb(this.dbName);\n return this;\n }\n\n /**\n * @returns {IDBDatabase}\n */\n _requireDb() {\n if (!this._db) {\n throw new Error('IndexedDbAssetStore is not open; call open() first');\n }\n return this._db;\n }\n\n /**\n * @param {IDBTransactionMode} mode\n * @returns {IDBObjectStore}\n */\n _store(mode) {\n return this._requireDb().transaction(ASSETS_STORE, mode).objectStore(ASSETS_STORE);\n }\n\n /**\n * @returns {Promise<AssetMeta[]>}\n */\n async list() {\n const rows = await idbRequest(this._store('readonly').getAll());\n return (rows ?? [])\n .map(({ path, mimeType, updatedAt, size }) => ({ path, mimeType, updatedAt, size }))\n .sort((a, b) => (b.updatedAt ?? 0) - (a.updatedAt ?? 0));\n }\n\n /**\n * @param {string} path\n * @returns {Promise<StoredAsset|undefined>}\n */\n async get(path) {\n const result = await idbRequest(this._store('readonly').get(path));\n return result ?? undefined;\n }\n\n /**\n * Insert or replace an asset. Same `path` overwrites.\n * @param {{ path: string, blob: Blob, mimeType?: string }} asset\n * @returns {Promise<StoredAsset>}\n */\n async put(asset) {\n const path = sanitizeAssetPath(asset.path);\n if (!path) {\n throw new Error('IndexedDbAssetStore.put requires a path');\n }\n if (!asset.blob) {\n throw new Error('IndexedDbAssetStore.put requires a blob');\n }\n /** @type {StoredAsset} */\n const record = {\n path,\n blob: asset.blob,\n mimeType: asset.mimeType || asset.blob.type || 'application/octet-stream',\n updatedAt: Date.now(),\n size: asset.blob.size,\n };\n await idbRequest(this._store('readwrite').put(record));\n this._revokeCached(path);\n return record;\n }\n\n /**\n * @param {string} path\n * @returns {Promise<void>}\n */\n async delete(path) {\n await idbRequest(this._store('readwrite').delete(path));\n this._revokeCached(path);\n }\n\n /**\n * Resolve a graphic href to a displayable URL.\n * Absolute URLs pass through; relative paths load from IndexedDB.\n * @param {string} href\n * @returns {Promise<string>}\n */\n async resolve(href) {\n const trimmed = href?.trim() ?? '';\n if (!trimmed) {\n return '';\n }\n if (isAbsoluteAssetHref(trimmed)) {\n return trimmed;\n }\n const cached = this._objectUrls.get(trimmed);\n if (cached) {\n return cached;\n }\n const asset = await this.get(trimmed);\n if (!asset?.blob) {\n return trimmed;\n }\n const url = URL.createObjectURL(asset.blob);\n this._objectUrls.set(trimmed, url);\n return url;\n }\n\n /**\n * @param {string} url\n */\n revoke(url) {\n if (!url?.startsWith('blob:')) {\n return;\n }\n for (const [path, cached] of this._objectUrls) {\n if (cached === url) {\n URL.revokeObjectURL(url);\n this._objectUrls.delete(path);\n return;\n }\n }\n URL.revokeObjectURL(url);\n }\n\n _revokeCached(path) {\n const url = this._objectUrls.get(path);\n if (url) {\n URL.revokeObjectURL(url);\n this._objectUrls.delete(path);\n }\n }\n\n close() {\n for (const url of this._objectUrls.values()) {\n URL.revokeObjectURL(url);\n }\n this._objectUrls.clear();\n if (this._db) {\n this._db.close();\n this._db = null;\n }\n }\n}\n","import { isAbsoluteAssetHref, sanitizeAssetPath } from './asset-store.js';\n\n/**\n * @typedef {import('./asset-store.js').AssetMeta} AssetMeta\n * @typedef {import('./asset-store.js').StoredAsset} StoredAsset\n */\n\n/**\n * HTTP {@link AssetStore} for TEI Publisher / Jinks (`/api/jinntap/assets`).\n *\n * Assets live under `$config:data-default`. Relative paths in `url` / `xlink:href`\n * map to `{collection}/{path}` beneath that default collection.\n */\nexport class HttpAssetStore {\n /**\n * @param {object} options\n * @param {string} options.contextPath - App context path (e.g. `/exist/apps/workbench`)\n * @param {string} [options.collection=''] - Subcollection relative to data-default\n * @param {string} [options.dataDefaultRel=''] - data-default path relative to data-root (e.g. `annotate`), used when deriving collection from a document path\n * @param {RequestCredentials} [options.credentials='same-origin']\n */\n constructor({\n contextPath,\n collection = '',\n dataDefaultRel = '',\n credentials = 'same-origin',\n } = {}) {\n if (!contextPath) {\n throw new Error('HttpAssetStore requires contextPath');\n }\n this.contextPath = contextPath.replace(/\\/+$/, '');\n this.collection = (collection || '').replace(/^\\/+|\\/+$/g, '');\n this.dataDefaultRel = (dataDefaultRel || '').replace(/^\\/+|\\/+$/g, '');\n this.credentials = credentials;\n /** @type {Map<string, string>} */\n this._objectUrls = new Map();\n }\n\n /**\n * Change the collection (e.g. after saving a new document to a path).\n * @param {string} collection - Relative to data-default\n */\n setCollection(collection) {\n this.collection = (collection || '').replace(/^\\/+|\\/+$/g, '');\n this._revokeAll();\n }\n\n /**\n * Update collection from a document path (relative to data-root).\n * @param {string} docPath\n */\n setCollectionFromDoc(docPath) {\n this.setCollection(collectionFromDocPath(docPath, this.dataDefaultRel));\n }\n\n /**\n * Id relative to data-default for an asset path.\n * @param {string} path\n * @returns {string}\n */\n assetId(path) {\n const safe = sanitizeAssetPath(path);\n return this.collection ? `${this.collection}/${safe}` : safe;\n }\n\n /**\n * @param {string} path\n * @returns {string}\n */\n assetUrl(path) {\n return `${this.contextPath}/api/jinntap/assets/${encodeURIComponent(this.assetId(path))}`;\n }\n\n /**\n * @returns {Promise<AssetMeta[]>}\n */\n async list() {\n const url = `${this.contextPath}/api/jinntap/assets?collection=${encodeURIComponent(this.collection)}`;\n const response = await fetch(url, { credentials: this.credentials });\n if (!response.ok) {\n throw new Error(`Failed to list assets (${response.status})`);\n }\n const rows = await response.json();\n return Array.isArray(rows) ? rows : [];\n }\n\n /**\n * @param {string} path\n * @returns {Promise<StoredAsset|undefined>}\n */\n async get(path) {\n const response = await fetch(this.assetUrl(path), { credentials: this.credentials });\n if (response.status === 404) {\n return undefined;\n }\n if (!response.ok) {\n throw new Error(`Failed to get asset (${response.status})`);\n }\n const blob = await response.blob();\n const mimeType = blob.type || response.headers.get('content-type') || 'application/octet-stream';\n return {\n path: sanitizeAssetPath(path),\n blob,\n mimeType,\n size: blob.size,\n updatedAt: Date.now(),\n };\n }\n\n /**\n * @param {{ path: string, blob: Blob, mimeType?: string }} asset\n * @returns {Promise<StoredAsset>}\n */\n async put(asset) {\n const path = sanitizeAssetPath(asset.path);\n const mimeType = asset.mimeType || asset.blob.type || 'application/octet-stream';\n const response = await fetch(this.assetUrl(path), {\n method: 'PUT',\n credentials: this.credentials,\n headers: {\n 'Content-Type': mimeType,\n },\n body: asset.blob,\n });\n if (!response.ok) {\n throw new Error(`Failed to store asset (${response.status})`);\n }\n const meta = await response.json().catch(() => ({}));\n this._revokeCached(path);\n return {\n path,\n blob: asset.blob,\n mimeType: meta.mimeType || mimeType,\n size: meta.size ?? asset.blob.size,\n updatedAt: meta.updatedAt ?? Date.now(),\n };\n }\n\n /**\n * @param {string} path\n * @returns {Promise<void>}\n */\n async delete(path) {\n const response = await fetch(this.assetUrl(path), {\n method: 'DELETE',\n credentials: this.credentials,\n });\n if (response.status === 404) {\n return;\n }\n if (!response.ok && response.status !== 204) {\n throw new Error(`Failed to delete asset (${response.status})`);\n }\n this._revokeCached(sanitizeAssetPath(path));\n }\n\n /**\n * Resolve to a displayable URL. Relative paths use the assets API (with cache-busting\n * via object URL when already fetched is not needed — direct API URL works for <img>).\n * @param {string} href\n * @returns {Promise<string>}\n */\n async resolve(href) {\n const trimmed = href?.trim() ?? '';\n if (!trimmed) {\n return '';\n }\n if (isAbsoluteAssetHref(trimmed)) {\n return trimmed;\n }\n return this.assetUrl(trimmed);\n }\n\n /**\n * @param {string} url\n */\n revoke(url) {\n if (!url?.startsWith('blob:')) {\n return;\n }\n for (const [path, cached] of this._objectUrls) {\n if (cached === url) {\n URL.revokeObjectURL(url);\n this._objectUrls.delete(path);\n return;\n }\n }\n URL.revokeObjectURL(url);\n }\n\n _revokeCached(path) {\n const url = this._objectUrls.get(path);\n if (url) {\n URL.revokeObjectURL(url);\n this._objectUrls.delete(path);\n }\n }\n\n _revokeAll() {\n for (const url of this._objectUrls.values()) {\n URL.revokeObjectURL(url);\n }\n this._objectUrls.clear();\n }\n}\n\n/**\n * Derive the asset collection (relative to data-default) from a document path\n * (relative to data-root).\n *\n * @param {string} [docPath] - e.g. `annotate/essay.xml` or `annotate/sub/essay.xml`\n * @param {string} [dataDefaultRel=''] - data-default relative to data-root, e.g. `annotate`\n * @returns {string} e.g. `` or `sub`\n */\nexport function collectionFromDocPath(docPath, dataDefaultRel = '') {\n const doc = (docPath || '').replace(/^\\/+|\\/+$/g, '');\n const root = (dataDefaultRel || '').replace(/^\\/+|\\/+$/g, '');\n if (!doc) {\n return '';\n }\n let underDefault = doc;\n if (root) {\n if (doc === root || doc.startsWith(`${root}/`)) {\n underDefault = doc === root ? '' : doc.slice(root.length + 1);\n } else {\n // Outside data-default: keep assets in the default collection root\n return '';\n }\n }\n if (!underDefault.includes('/')) {\n return '';\n }\n return underDefault.split('/').slice(0, -1).join('/');\n}\n\n/**\n * Attach an {@link HttpAssetStore} to a `<jinn-tap>` editor for TEI Publisher / Jinks.\n *\n * @param {HTMLElement & { assets?: object, metadata?: { name?: string } }} editor\n * @param {{ contextPath: string, docPath?: string, dataDefaultRel?: string }} options\n * @returns {HttpAssetStore}\n */\nexport function attachPublisherAssetStore(\n editor,\n { contextPath, docPath = '', dataDefaultRel = '' } = {},\n) {\n const collection = collectionFromDocPath(docPath, dataDefaultRel);\n const store = new HttpAssetStore({ contextPath, collection, dataDefaultRel });\n editor.assets = store;\n return store;\n}\n","/**\n * Attach an {@link AssetStore} to a `<jinn-tap>` element.\n *\n * @param {HTMLElement & { assets?: object }} editor\n * @param {import('./asset-store.js').AssetStore} store\n * @returns {Promise<import('./asset-store.js').AssetStore>}\n */\nexport async function attachAssetStore(editor, store) {\n if (!editor || !store) {\n throw new Error('attachAssetStore requires an editor and a store');\n }\n if (typeof store.open === 'function') {\n await store.open();\n }\n editor.assets = store;\n return store;\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 { zipSync, strToU8 } from 'fflate';\nimport { isAbsoluteAssetHref } from './asset-store.js';\n\n/**\n * @typedef {import('./asset-store.js').AssetStore} AssetStore\n * @typedef {import('./asset-store.js').StoredAsset} StoredAsset\n */\n\n/**\n * Collect relative graphic hrefs from a TEI/JATS XML string\n * (`url` and `xlink:href` on any element — typically `graphic`).\n *\n * @param {string} xml\n * @returns {string[]} Unique relative paths, document order\n */\nexport function findReferencedAssetPaths(xml) {\n if (!xml || typeof xml !== 'string') {\n return [];\n }\n try {\n const doc = new DOMParser().parseFromString(xml, 'application/xml');\n if (doc.querySelector('parsererror')) {\n return [];\n }\n const seen = new Set();\n /** @type {string[]} */\n const paths = [];\n for (const el of doc.getElementsByTagName('*')) {\n for (const attr of ['url', 'href']) {\n // Prefer getAttributeNS for xlink:href; also plain 'href' / 'url'\n let value = null;\n if (attr === 'href') {\n value =\n el.getAttributeNS?.('http://www.w3.org/1999/xlink', 'href') ||\n el.getAttribute('xlink:href') ||\n el.getAttribute('href');\n } else {\n value = el.getAttribute(attr);\n }\n const trimmed = value?.trim();\n if (!trimmed || isAbsoluteAssetHref(trimmed) || seen.has(trimmed)) {\n continue;\n }\n seen.add(trimmed);\n paths.push(trimmed);\n }\n }\n return paths;\n } catch {\n return [];\n }\n}\n\n/**\n * Resolve which referenced paths exist in the asset store.\n *\n * @param {string} xml\n * @param {AssetStore} store\n * @returns {Promise<StoredAsset[]>}\n */\nexport async function collectReferencedAssets(xml, store) {\n if (!store?.get) {\n return [];\n }\n const paths = findReferencedAssetPaths(xml);\n /** @type {StoredAsset[]} */\n const found = [];\n for (const path of paths) {\n const asset = await store.get(path);\n if (asset?.blob) {\n found.push(asset);\n }\n }\n return found;\n}\n\n/**\n * Trigger a browser download for a Blob.\n *\n * @param {Blob} blob\n * @param {string} filename\n */\nexport function triggerDownload(blob, filename) {\n const url = URL.createObjectURL(blob);\n const link = document.createElement('a');\n link.href = url;\n link.download = filename;\n document.body.appendChild(link);\n link.click();\n document.body.removeChild(link);\n URL.revokeObjectURL(url);\n}\n\n/**\n * @param {string} xmlFilename\n * @returns {string}\n */\nexport function zipFilenameForXml(xmlFilename) {\n const base = (xmlFilename || 'document.xml').replace(/\\.xml$/i, '');\n return `${base || 'document'}.zip`;\n}\n\n/**\n * Download XML alone.\n *\n * @param {string} xml\n * @param {string} [filename='document.xml']\n */\nexport function downloadXml(xml, filename = 'document.xml') {\n const blob = new Blob([xml], { type: 'application/xml' });\n triggerDownload(blob, filename);\n}\n\n/**\n * Build a ZIP with the XML document and referenced assets (paths preserved).\n *\n * @param {string} xml\n * @param {StoredAsset[]} assets\n * @param {string} [xmlFilename='document.xml']\n * @returns {Promise<Blob>}\n */\nexport async function buildDocumentZip(xml, assets, xmlFilename = 'document.xml') {\n /** @type {Record<string, Uint8Array>} */\n const files = {\n [xmlFilename]: strToU8(xml),\n };\n for (const asset of assets) {\n const path = asset.path.replace(/^\\/+/, '');\n if (!path || path === xmlFilename) {\n continue;\n }\n files[path] = new Uint8Array(await asset.blob.arrayBuffer());\n }\n const zipped = zipSync(files, { level: 6 });\n // Copy into a fresh ArrayBuffer-backed Uint8Array for Blob typing\n const copy = new Uint8Array(zipped.byteLength);\n copy.set(zipped);\n return new Blob([copy.buffer], { type: 'application/zip' });\n}\n\n/**\n * Download XML + assets as a ZIP archive.\n *\n * @param {string} xml\n * @param {StoredAsset[]} assets\n * @param {string} [xmlFilename='document.xml']\n */\nexport async function downloadDocumentZip(xml, assets, xmlFilename = 'document.xml') {\n const blob = await buildDocumentZip(xml, assets, xmlFilename);\n triggerDownload(blob, zipFilenameForXml(xmlFilename));\n}\n"],"names":["DB_NAME","DOCUMENTS_STORE","ASSETS_STORE","upgradeJinntapDb","db","oldVersion","store","openJinntapDb","dbName","resolve","reject","request","event","idbRequest","DocumentStore","mode","id","a","b","doc","record","GENERIC_TITLES","isGenericTitle","title","isProvisionalTitle","words","truncateTitle","text","max","cleaned","extractTitleFromXml","xml","_a","_b","elements","titleStmtTitle","articleTitle","anyTitle","el","name","node","deduceDocumentName","metadata","plainText","fallback","firstLine","line","fromPlain","metaTitle","fromXml","attachLocalStore","editor","options","debounceMs","force","autoRestore","onDraftAvailable","onNameChange","onRestore","format","documentId","nameLocked","currentName","timer","detached","restored","suppressingSave","pendingDraft","emitName","buildRecord","overrides","persist","scheduleSave","err","onContentChange","applyRestore","existing","filename","offerRestore","shouldRestore","onReady","trimmed","displayName","isAbsoluteAssetHref","href","sanitizeAssetPath","IndexedDbAssetStore","path","mimeType","updatedAt","size","asset","cached","url","HttpAssetStore","contextPath","collection","dataDefaultRel","credentials","docPath","collectionFromDocPath","safe","response","rows","blob","meta","root","underDefault","attachPublisherAssetStore","attachAssetStore","u8","u16","i32","fleb","fdeb","clim","freb","eb","start","i","r","j","fl","revfl","revfd","rev","x","hMap","cd","mb","s","l","le","co","rvb","sv","r_1","v","m","flt","fdt","flm","fdm","shft","p","slc","e","ec","ind","msg","nt","wbits","d","o","wbits16","hTree","t","t2","et","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","out","pos","dat","wblk","final","syms","lf","df","li","bs","bl","dlt","mlb","ddt","mdb","_c","lclt","nlc","_d","lcdt","ndc","lcfreq","_e","lct","mlcb","nlcc","flen","ftlen","dtlen","lm","ll","dm","dl","llm","lcts","it","clct","len","sym","dst","deo","dflt","lvl","plvl","pre","post","st","lst","opt","msk_1","prev","head","bs1_1","bs2_1","hsh","lc_1","wi","hv","imod","pimod","rem","ch_1","dif","maxn","maxd","ml","nl","mmd","md","ti","pti","lin","din","crct","k","crc","cr","dopt","dict","newDat","mrg","wbytes","deflateSync","data","opts","fltn","val","op","te","td","tds","strToU8","str","latin1","ar","ai","exfl","ex","wzh","f","fn","u","ce","col","exl","y","exf","wzf","zipSync","files","tot","file","compression","com","ms","oe","cdl","badd","findReferencedAssetPaths","seen","paths","attr","value","collectReferencedAssets","found","triggerDownload","link","zipFilenameForXml","xmlFilename","downloadXml","buildDocumentZip","assets","zipped","copy","downloadDocumentZip"],"mappings":"AAAO,MAAMA,KAAU;AAEhB,MAAMC,KAAkB,aAClBC,KAAe;AAMrB,SAASC,GAAiBC,GAAIC,GAAY;AAC7C,MAAI,CAACD,EAAG,iBAAiB,SAASH,EAAe,GAAG;AAChD,UAAMK,IAAQF,EAAG,kBAAkBH,IAAiB,EAAE,SAAS,MAAM;AACrE,IAAAK,EAAM,YAAY,aAAa,aAAa,EAAE,QAAQ,IAAO,GAC7DA,EAAM,YAAY,UAAU,UAAU,EAAE,QAAQ,IAAO;AAAA,EAC3D;AACA,MAAID,IAAa,KAAK,CAACD,EAAG,iBAAiB,SAASF,EAAY,GAAG;AAC/D,UAAMI,IAAQF,EAAG,kBAAkBF,IAAc,EAAE,SAAS,QAAQ;AACpE,IAAAI,EAAM,YAAY,aAAa,aAAa,EAAE,QAAQ,IAAO,GAC7DA,EAAM,YAAY,YAAY,YAAY,EAAE,QAAQ,IAAO;AAAA,EAC/D;AACJ;AAQO,SAASC,GAAcC,IAASR,IAAS;AAC5C,SAAO,IAAI,QAAQ,CAACS,GAASC,MAAW;AACpC,UAAMC,IAAU,UAAU,KAAKH,GAAQ,CAAU;AACjD,IAAAG,EAAQ,UAAU,MAAMD,EAAOC,EAAQ,SAAS,IAAI,MAAM,0BAA0B,CAAC,GACrFA,EAAQ,YAAY,MAAMF,EAAQE,EAAQ,MAAM,GAChDA,EAAQ,kBAAkB,CAACC,MAAU;AACjC,YAAMR;AAAA;AAAA,QAAsCQ,EAAM,OAAQ;AAAA;AAC1D,MAAAT,GAAiBC,GAAIQ,EAAM,UAAU;AAAA,IACzC;AAAA,EACJ,CAAC;AACL;AAOO,SAASC,EAAWF,GAAS;AAChC,SAAO,IAAI,QAAQ,CAACF,GAASC,MAAW;AACpC,IAAAC,EAAQ,YAAY,MAAMF,EAAQE,EAAQ,MAAM,GAChDA,EAAQ,UAAU,MAAMD,EAAOC,EAAQ,SAAS,IAAI,MAAM,0BAA0B,CAAC;AAAA,EACzF,CAAC;AACL;ACjCO,MAAMG,GAAc;AAAA;AAAA;AAAA;AAAA,EAIvB,YAAYN,IAASR,IAAS;AAC1B,SAAK,SAASQ,GAEd,KAAK,MAAM;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,OAAO;AACT,WAAI,KAAK,MACE,QAEX,KAAK,MAAM,MAAMD,GAAc,KAAK,MAAM,GACnC;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa;AACT,QAAI,CAAC,KAAK;AACN,YAAM,IAAI,MAAM,8CAA8C;AAElE,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAOQ,GAAM;AACT,WAAO,KAAK,WAAU,EAAG,YAAYd,IAAiBc,CAAI,EAAE,YAAYd,EAAe;AAAA,EAC3F;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,IAAIe,GAAI;AAEV,WADe,MAAMH,EAAW,KAAK,OAAO,UAAU,EAAE,IAAIG,CAAE,CAAC,KAC9C;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAO;AAET,YADa,MAAMH,EAAW,KAAK,OAAO,UAAU,EAAE,QAAQ,KAC9C,CAAA,GAAI,KAAK,CAACI,GAAGC,OAAOA,EAAE,aAAa,MAAMD,EAAE,aAAa,EAAE;AAAA,EAC9E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,IAAIE,GAAK;AACX,QAAI,EAACA,KAAA,QAAAA,EAAK;AACN,YAAM,IAAI,MAAM,kDAAkD;AAGtE,UAAMC,IAAS;AAAA,MACX,GAAGD;AAAA,MACH,WAAWA,EAAI,aAAa,KAAK,IAAG;AAAA,IAChD;AACQ,iBAAMN,EAAW,KAAK,OAAO,WAAW,EAAE,IAAIO,CAAM,CAAC,GAC9CA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,OAAOJ,GAAI;AACb,UAAMH,EAAW,KAAK,OAAO,WAAW,EAAE,OAAOG,CAAE,CAAC;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ;AACJ,IAAI,KAAK,QACL,KAAK,IAAI,MAAK,GACd,KAAK,MAAM;AAAA,EAEnB;AACJ;AC7GA,MAAMK,KAAiB,oBAAI,IAAI,CAAC,qBAAqB,oBAAoB,UAAU,CAAC;AAM7E,SAASC,GAAeC,GAAO;AAClC,SAAO,CAACA,KAASF,GAAe,IAAIE,EAAM,KAAI,EAAG,aAAa;AAClE;AAUO,SAASC,GAAmBD,GAAO;AACtC,MAAI,CAACA,KAASD,GAAeC,CAAK;AAC9B,WAAO;AAEX,QAAME,IAAQF,EAAM,KAAI,EAAG,MAAM,KAAK,EAAE,OAAO,OAAO;AACtD,SAAIE,EAAM,SAAS,IACR,KAGJA,EAAMA,EAAM,SAAS,CAAC,EAAE,SAAS;AAC5C;AAOO,SAASC,GAAcC,GAAMC,IAAM,IAAI;AAC1C,QAAMC,IAAUF,EAAK,QAAQ,QAAQ,GAAG,EAAE,KAAI;AAC9C,SAAIE,EAAQ,UAAUD,IACXC,IAEJ,GAAGA,EAAQ,MAAM,GAAGD,IAAM,CAAC,EAAE,QAAO,CAAE;AACjD;AAOO,SAASE,GAAoBC,GAAK;AFhDlC,MAAAC,GAAAC;AEiDH,MAAI,CAACF,KAAO,OAAOA,KAAQ;AACvB,WAAO;AAEX,MAAI;AACA,UAAMZ,IAAM,IAAI,UAAS,EAAG,gBAAgBY,GAAK,iBAAiB;AAClE,QAAIZ,EAAI,cAAc,aAAa;AAC/B,aAAO;AAGX,UAAMe,IAAWf,EAAI,qBAAqB,GAAG;AAE7C,QAAIgB,IAAiB,MAEjBC,IAAe,MAEfC,IAAW;AAEf,eAAWC,KAAMJ,GAAU;AACvB,YAAMK,IAAOD,EAAG;AAChB,UAAIC,MAAS,aAAWP,IAAAM,EAAG,kBAAH,gBAAAN,EAAkB,eAAc,aAAa;AACjE,QAAAG,IAAiBG;AACjB;AAAA,MACJ;AACA,MAAIC,MAAS,mBAAmB,CAACH,MAC7BA,IAAeE,IAEfC,MAAS,WAAW,CAACF,MACrBA,IAAWC;AAAA,IAEnB;AAEA,UAAME,IAAOL,KAAkBC,KAAgBC,GACzCV,KAAOM,IAAAO,KAAA,gBAAAA,EAAM,gBAAN,gBAAAP,EAAmB;AAChC,WAAON,KAAQ,CAACL,GAAeK,CAAI,IAAID,GAAcC,CAAI,IAAI;AAAA,EACjE,QAAQ;AACJ,WAAO;AAAA,EACX;AACJ;AAgBO,SAASc,GAAmB,EAAE,KAAAV,GAAK,UAAAW,GAAU,WAAAC,GAAW,UAAAC,IAAW,oBAAmB,IAAK,IAAI;AFtG/F,MAAAZ;AEuGH,QAAMa,IAAYF,KAAA,gBAAAA,EACZ,OACD,MAAM,SACN,KAAK,CAACG,MAASA,EAAK,KAAI,IACvBC,IAAYF,IAAYnB,GAAcmB,CAAS,IAAI,MAEnDG,KAAYhB,IAAAU,KAAA,gBAAAA,EAAU,UAAV,gBAAAV,EAAiB;AACnC,MAAIgB,KAAa,CAAC1B,GAAe0B,CAAS,KAAK,CAACxB,GAAmBwB,CAAS;AACxE,WAAOtB,GAAcsB,CAAS;AAGlC,QAAMC,IAAUnB,GAAoBC,CAAG;AACvC,SAAIkB,KAAW,CAACzB,GAAmByB,CAAO,IAC/BA,IAGPF,KAIAE,MAIAD,KAAa,CAAC1B,GAAe0B,CAAS,IAC/BtB,GAAcsB,CAAS,IAG3BJ;AACX;AC1FO,eAAeM,GAAiBC,GAAQC,IAAU,IAAI;AACzD,QAAM,EAAE,YAAAC,IAAa,MAAM,OAAAC,IAAQ,IAAO,aAAAC,IAAc,IAAO,kBAAAC,GAAkB,cAAAC,GAAc,WAAAC,EAAS,IAAKN;AAE7G,MAAI,CAACE,KAASH,EAAO,aAAa,QAAQ;AACtC,WAAO;AAGX,QAAMQ,KAAUR,EAAO,aAAa,QAAQ,KAAKA,EAAO,UAAU,OAAO,YAAW,GAC9ES,IAAaR,EAAQ,cAAc,WAAWO,CAAM,IACpDrD,IAAQ8C,EAAQ,SAAS,IAAItC,GAAa;AAChD,QAAMR,EAAM,KAAI;AAEhB,MAAIuD,IAAa,IACbC,IAAc,qBACdC,IAAQ,MACRC,IAAW,IACXC,IAAW,IACXC,IAAkB,IAElBC;AAEJ,QAAMC,IAAW,CAAC7B,MAAS;AACvB,IAAAuB,IAAcvB,GACdkB,KAAA,QAAAA,EAAelB;AAAA,EACnB,GAEM8B,IAAc,CAACtC,GAAKuC,IAAY,CAAA,MAAO;AHpE1C,QAAAtC;AGqEC,UAAMU,IAAWS,EAAO,YAAY,CAAA;AACpC,QAAIZ,IAAOuB;AACX,WAAKD,MACDtB,IAAOE,GAAmB;AAAA,MACtB,KAAAV;AAAA,MACA,UAAAW;AAAA,MACA,WAAW,OAAOS,EAAO,WAAY,WAAWA,EAAO,UAAU;AAAA,IACjF,CAAa,GACG,CAAC7B,GAAeiB,CAAI,KAAK,CAACf,GAAmBe,CAAI,KAAKG,EAAS,UAAUH,MACzEY,EAAO,WAAW,EAAE,GAAGT,GAAU,OAAOH,EAAI,KAGpD6B,EAAS7B,CAAI,GAEN;AAAA,MACH,IAAIqB;AAAA,MACJ,MAAArB;AAAA,MACA,QAAAoB;AAAA,MACA,KAAA5B;AAAA,MACA,WAAW,KAAK,IAAG;AAAA,MACnB,YAAA8B;AAAA,MACA,WAAU7B,IAAAmB,EAAO,aAAP,gBAAAnB,EAAiB;AAAA,MAC3B,GAAGsC;AAAA,IACf;AAAA,EACI,GAEMC,IAAU,OAAOxC,MAAQ;AAC3B,QAAIiC,KAAYE,KAAmB,CAACnC;AAChC;AAEJ,UAAMX,IAASiD,EAAYtC,CAAG;AAC9B,iBAAMzB,EAAM,IAAIc,CAAM,GACfA;AAAA,EACX,GAEMoD,IAAe,CAACzC,MAAQ;AAC1B,IAAIiC,KAAYE,MAGhB,aAAaH,CAAK,GAClBA,IAAQ,WAAW,MAAM;AACrB,MAAAQ,EAAQxC,CAAG,EAAE,MAAM,CAAC0C,MAAQ,QAAQ,MAAM,mCAAmCA,CAAG,CAAC;AAAA,IACrF,GAAGpB,CAAU;AAAA,EACjB,GAEMqB,IAAkB,CAAC9D,MAAU;AHlHhC,QAAAoB;AGmHC,IAAAwC,GAAaxC,IAAApB,EAAM,WAAN,gBAAAoB,EAAc,GAAG;AAAA,EAClC,GAEM2C,IAAe,OAAOC,MAAa;AHtHtC,QAAA5C;AGuHC,QAAI,EAAC4C,KAAA,QAAAA,EAAU;AACX,aAAO;AAEX,IAAAV,IAAkB;AAClB,QAAI;AAEA,MAAIf,EAAO,aAAa,KAAK,KACzBA,EAAO,gBAAgB,KAAK,GAEhCA,EAAO,MAAMyB,EAAS,KACtBf,IAAa,EAAQe,EAAS;AAC9B,YAAMC,IAAWD,EAAS,cAAY5C,IAAAmB,EAAO,aAAP,gBAAAnB,EAAiB,SAAQ;AAC/D,aAAAmB,EAAO,WAAW;AAAA,QACd,GAAIA,EAAO,YAAY;QACvB,OAAOyB,EAAS;AAAA,QAChB,MAAMC;AAAA,MACtB,GACYT,EAASQ,EAAS,IAAI,GACtBX,IAAW,IACXE,IAAe,QACfT,KAAA,QAAAA,EAAYkB,IACL;AAAA,IACX,UAAC;AAEG,iBAAW,MAAM;AACb,QAAAV,IAAkB;AAAA,MACtB,GAAGb,IAAa,EAAE;AAAA,IACtB;AAAA,EACJ,GAEMyB,IAAe,YAAY;AAC7B,UAAMF,IAAW,MAAMtE,EAAM,IAAIsD,CAAU;AAC3C,QAAI,EAACgB,KAAA,QAAAA,EAAU;AACX,aAAO;AAEX,IAAAT,IAAeS;AAEf,QAAIG,IAAgBxB;AACpB,WAAI,CAACA,KAAeC,MAChBuB,IAAgB,EAAQ,MAAMvB,EAAiBoB,CAAQ,GACnD,CAACG,MAED,MAAMzE,EAAM,OAAOsD,CAAU,GAC7BO,IAAe,QACR,MAIXY,IACOJ,EAAaC,CAAQ,IAEzB;AAAA,EACX;AAiBA,eAdI,IAAI,QAAQ,CAACnE,MAAY;AACrB,QAAI0C,EAAO,gBAAgBA,EAAO,QAAQ;AACtC,MAAA1C,EAAO;AACP;AAAA,IACJ;AACA,UAAMuE,IAAU,MAAMvE,EAAO;AAC7B,IAAA0C,EAAO,iBAAiB,SAAS6B,GAAS,EAAE,MAAM,IAAM,IAEpD7B,EAAO,gBAAgBA,EAAO,YAC9BA,EAAO,oBAAoB,SAAS6B,CAAO,GAC3CvE,EAAO;AAAA,EAEf,CAAC,GAGL,MAAMqE,EAAY,GAElB3B,EAAO,iBAAiB,kBAAkBuB,CAAe,GAElD;AAAA,IACH,OAAApE;AAAA,IACA,YAAAsD;AAAA,IACA,IAAI,WAAW;AACX,aAAOK;AAAA,IACX;AAAA,IACA,IAAI,eAAe;AACf,aAAOE;AAAA,IACX;AAAA,IACA,SAAS;AACL,MAAAH,IAAW,IACX,aAAaD,CAAK,GAClBZ,EAAO,oBAAoB,kBAAkBuB,CAAe;AAAA,IAChE;AAAA,IACA,MAAM,QAAQtD,GAAQ;AAClB,YAAMwD,IAAWxD,KAAU+C,KAAiB,MAAM7D,EAAM,IAAIsD,CAAU;AACtE,aAAOe,EAAaC,CAAQ;AAAA,IAChC;AAAA,IACA,MAAM,OAAOrC,GAAM;AACf,YAAM0C,IAAU1C,KAAA,gBAAAA,EAAM;AACtB,UAAI,CAAC0C;AACD,cAAM,IAAI,MAAM,iCAAiC;AAErD,MAAApB,IAAa,IACbO,EAASa,CAAO,GAChB9B,EAAO,WAAW;AAAA,QACd,GAAIA,EAAO,YAAY;QACvB,OAAO8B;AAAA,MACvB;AACY,YAAMlD,IAAMoB,EAAO;AACnB,aAAO7C,EAAM;AAAA,QACT+D,EAAYtC,GAAK;AAAA,UACb,MAAMkD;AAAA,UACN,YAAY;AAAA,QAChC,CAAiB;AAAA,MACjB;AAAA,IACQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUA,MAAM,aAAalD,GAAK,EAAE,UAAA8C,EAAQ,IAAK,CAAA,GAAI;AH/O5C,UAAA7C;AGgPK,UAAI,CAACD;AACD,cAAM,IAAI,MAAM,gCAAgC;AAEpD,MAAA8B,IAAa,IACbK,IAAkB;AAClB,UAAI;AACA,QAAIf,EAAO,aAAa,KAAK,KACzBA,EAAO,gBAAgB,KAAK,GAEhCA,EAAO,MAAMpB;AACb,cAAMa,IAAWiC,KACXA,EAAS,QAAQ,WAAW,EAAE,EAAE,KAAI,KAAM,qBAE1CK,IAAczC,GAAmB;AAAA,UACnC,KAAAV;AAAA;AAAA,UAEA,UAAU,CAAA;AAAA,UACV,WAAW,OAAOoB,EAAO,WAAY,WAAWA,EAAO,UAAU;AAAA,UACjE,UAAAP;AAAA,QACpB,CAAiB;AACD,QAAAO,EAAO,WAAW;AAAA,UACd,MAAM0B,OAAY7C,IAAAmB,EAAO,aAAP,gBAAAnB,EAAiB,SAAQ;AAAA,UAC3C,OAAOkD;AAAA,QAC3B,GACgBd,EAASc,CAAW,GACpB,aAAanB,CAAK;AAGlB,cAAM3C,IAASiD,EAAYlB,EAAO,GAAG;AACrC,qBAAM7C,EAAM,IAAIc,CAAM,GACfA;AAAA,MACX,UAAC;AACG,mBAAW,MAAM;AACb,UAAA8C,IAAkB;AAAA,QACtB,GAAGb,IAAa,EAAE;AAAA,MACtB;AAAA,IACJ;AAAA,IACA,MAAM,QAAQ;AACV,mBAAaU,CAAK,GAClB,MAAMzD,EAAM,OAAOsD,CAAU,GAC7BC,IAAa,IACbO,EAAS,mBAAmB;AAAA,IAChC;AAAA,IACA,MAAM,YAAY;AACd,aAAO9D,EAAM,IAAIsD,CAAU;AAAA,IAC/B;AAAA,IACA,MAAM,UAAU;AACZ,0BAAaG,CAAK,GACXQ,EAAQpB,EAAO,GAAG;AAAA,IAC7B;AAAA,EACR;AACA;AClQO,SAASgC,GAAoBC,GAAM;AACtC,SAAO,0BAA0B,MAAKA,KAAA,gBAAAA,EAAM,WAAU,EAAE;AAC5D;AAOO,SAASC,EAAkB9C,GAAM;AAEpC,UADcA,KAAQ,SAAS,QAAQ,OAAO,GAAG,EAAE,MAAM,GAAG,EAAE,IAAG,EAAG,KAAI,KACzD;AACnB;ACjCO,MAAM+C,GAAoB;AAAA;AAAA;AAAA;AAAA,EAI7B,YAAY9E,IAASR,IAAS;AAC1B,SAAK,SAASQ,GAEd,KAAK,MAAM,MAEX,KAAK,cAAc,oBAAI,IAAG;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAO;AACT,WAAI,KAAK,MACE,QAEX,KAAK,MAAM,MAAMD,GAAc,KAAK,MAAM,GACnC;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa;AACT,QAAI,CAAC,KAAK;AACN,YAAM,IAAI,MAAM,oDAAoD;AAExE,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAOQ,GAAM;AACT,WAAO,KAAK,WAAU,EAAG,YAAYb,IAAca,CAAI,EAAE,YAAYb,EAAY;AAAA,EACrF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAO;AAET,YADa,MAAMW,EAAW,KAAK,OAAO,UAAU,EAAE,QAAQ,KAC9C,CAAA,GACX,IAAI,CAAC,EAAE,MAAA0E,GAAM,UAAAC,GAAU,WAAAC,GAAW,MAAAC,SAAY,EAAE,MAAAH,GAAM,UAAAC,GAAU,WAAAC,GAAW,MAAAC,EAAI,EAAG,EAClF,KAAK,CAACzE,GAAGC,OAAOA,EAAE,aAAa,MAAMD,EAAE,aAAa,EAAE;AAAA,EAC/D;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,IAAIsE,GAAM;AAEZ,WADe,MAAM1E,EAAW,KAAK,OAAO,UAAU,EAAE,IAAI0E,CAAI,CAAC,KAChD;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,IAAII,GAAO;AACb,UAAMJ,IAAOF,EAAkBM,EAAM,IAAI;AAIzC,QAAI,CAACA,EAAM;AACP,YAAM,IAAI,MAAM,yCAAyC;AAG7D,UAAMvE,IAAS;AAAA,MACX,MAAAmE;AAAA,MACA,MAAMI,EAAM;AAAA,MACZ,UAAUA,EAAM,YAAYA,EAAM,KAAK,QAAQ;AAAA,MAC/C,WAAW,KAAK,IAAG;AAAA,MACnB,MAAMA,EAAM,KAAK;AAAA,IAC7B;AACQ,iBAAM9E,EAAW,KAAK,OAAO,WAAW,EAAE,IAAIO,CAAM,CAAC,GACrD,KAAK,cAAcmE,CAAI,GAChBnE;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,OAAOmE,GAAM;AACf,UAAM1E,EAAW,KAAK,OAAO,WAAW,EAAE,OAAO0E,CAAI,CAAC,GACtD,KAAK,cAAcA,CAAI;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,QAAQH,GAAM;AAChB,UAAMH,KAAUG,KAAA,gBAAAA,EAAM,WAAU;AAChC,QAAI,CAACH;AACD,aAAO;AAEX,QAAIE,GAAoBF,CAAO;AAC3B,aAAOA;AAEX,UAAMW,IAAS,KAAK,YAAY,IAAIX,CAAO;AAC3C,QAAIW;AACA,aAAOA;AAEX,UAAMD,IAAQ,MAAM,KAAK,IAAIV,CAAO;AACpC,QAAI,EAACU,KAAA,QAAAA,EAAO;AACR,aAAOV;AAEX,UAAMY,IAAM,IAAI,gBAAgBF,EAAM,IAAI;AAC1C,gBAAK,YAAY,IAAIV,GAASY,CAAG,GAC1BA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAKA,OAAOA,GAAK;AACR,QAAKA,KAAA,QAAAA,EAAK,WAAW,UAGrB;AAAA,iBAAW,CAACN,GAAMK,CAAM,KAAK,KAAK;AAC9B,YAAIA,MAAWC,GAAK;AAChB,cAAI,gBAAgBA,CAAG,GACvB,KAAK,YAAY,OAAON,CAAI;AAC5B;AAAA,QACJ;AAEJ,UAAI,gBAAgBM,CAAG;AAAA;AAAA,EAC3B;AAAA,EAEA,cAAcN,GAAM;AAChB,UAAMM,IAAM,KAAK,YAAY,IAAIN,CAAI;AACrC,IAAIM,MACA,IAAI,gBAAgBA,CAAG,GACvB,KAAK,YAAY,OAAON,CAAI;AAAA,EAEpC;AAAA,EAEA,QAAQ;AACJ,eAAWM,KAAO,KAAK,YAAY,OAAM;AACrC,UAAI,gBAAgBA,CAAG;AAE3B,SAAK,YAAY,MAAK,GAClB,KAAK,QACL,KAAK,IAAI,MAAK,GACd,KAAK,MAAM;AAAA,EAEnB;AACJ;AC5JO,MAAMC,GAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQxB,YAAY;AAAA,IACR,aAAAC;AAAA,IACA,YAAAC,IAAa;AAAA,IACb,gBAAAC,IAAiB;AAAA,IACjB,aAAAC,IAAc;AAAA,EACtB,IAAQ,IAAI;AACJ,QAAI,CAACH;AACD,YAAM,IAAI,MAAM,qCAAqC;AAEzD,SAAK,cAAcA,EAAY,QAAQ,QAAQ,EAAE,GACjD,KAAK,cAAcC,KAAc,IAAI,QAAQ,cAAc,EAAE,GAC7D,KAAK,kBAAkBC,KAAkB,IAAI,QAAQ,cAAc,EAAE,GACrE,KAAK,cAAcC,GAEnB,KAAK,cAAc,oBAAI,IAAG;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAcF,GAAY;AACtB,SAAK,cAAcA,KAAc,IAAI,QAAQ,cAAc,EAAE,GAC7D,KAAK,WAAU;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,qBAAqBG,GAAS;AAC1B,SAAK,cAAcC,GAAsBD,GAAS,KAAK,cAAc,CAAC;AAAA,EAC1E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQZ,GAAM;AACV,UAAMc,IAAOhB,EAAkBE,CAAI;AACnC,WAAO,KAAK,aAAa,GAAG,KAAK,UAAU,IAAIc,CAAI,KAAKA;AAAA,EAC5D;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAASd,GAAM;AACX,WAAO,GAAG,KAAK,WAAW,uBAAuB,mBAAmB,KAAK,QAAQA,CAAI,CAAC,CAAC;AAAA,EAC3F;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAO;AACT,UAAMM,IAAM,GAAG,KAAK,WAAW,kCAAkC,mBAAmB,KAAK,UAAU,CAAC,IAC9FS,IAAW,MAAM,MAAMT,GAAK,EAAE,aAAa,KAAK,aAAa;AACnE,QAAI,CAACS,EAAS;AACV,YAAM,IAAI,MAAM,0BAA0BA,EAAS,MAAM,GAAG;AAEhE,UAAMC,IAAO,MAAMD,EAAS,KAAI;AAChC,WAAO,MAAM,QAAQC,CAAI,IAAIA,IAAO,CAAA;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,IAAIhB,GAAM;AACZ,UAAMe,IAAW,MAAM,MAAM,KAAK,SAASf,CAAI,GAAG,EAAE,aAAa,KAAK,aAAa;AACnF,QAAIe,EAAS,WAAW;AACpB;AAEJ,QAAI,CAACA,EAAS;AACV,YAAM,IAAI,MAAM,wBAAwBA,EAAS,MAAM,GAAG;AAE9D,UAAME,IAAO,MAAMF,EAAS,KAAI,GAC1Bd,IAAWgB,EAAK,QAAQF,EAAS,QAAQ,IAAI,cAAc,KAAK;AACtE,WAAO;AAAA,MACH,MAAMjB,EAAkBE,CAAI;AAAA,MAC5B,MAAAiB;AAAA,MACA,UAAAhB;AAAA,MACA,MAAMgB,EAAK;AAAA,MACX,WAAW,KAAK,IAAG;AAAA,IAC/B;AAAA,EACI;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,IAAIb,GAAO;AACb,UAAMJ,IAAOF,EAAkBM,EAAM,IAAI,GACnCH,IAAWG,EAAM,YAAYA,EAAM,KAAK,QAAQ,4BAChDW,IAAW,MAAM,MAAM,KAAK,SAASf,CAAI,GAAG;AAAA,MAC9C,QAAQ;AAAA,MACR,aAAa,KAAK;AAAA,MAClB,SAAS;AAAA,QACL,gBAAgBC;AAAA,MAChC;AAAA,MACY,MAAMG,EAAM;AAAA,IACxB,CAAS;AACD,QAAI,CAACW,EAAS;AACV,YAAM,IAAI,MAAM,0BAA0BA,EAAS,MAAM,GAAG;AAEhE,UAAMG,IAAO,MAAMH,EAAS,KAAI,EAAG,MAAM,OAAO,CAAA,EAAG;AACnD,gBAAK,cAAcf,CAAI,GAChB;AAAA,MACH,MAAAA;AAAA,MACA,MAAMI,EAAM;AAAA,MACZ,UAAUc,EAAK,YAAYjB;AAAA,MAC3B,MAAMiB,EAAK,QAAQd,EAAM,KAAK;AAAA,MAC9B,WAAWc,EAAK,aAAa,KAAK,IAAG;AAAA,IACjD;AAAA,EACI;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,OAAOlB,GAAM;AACf,UAAMe,IAAW,MAAM,MAAM,KAAK,SAASf,CAAI,GAAG;AAAA,MAC9C,QAAQ;AAAA,MACR,aAAa,KAAK;AAAA,IAC9B,CAAS;AACD,QAAIe,EAAS,WAAW,KAGxB;AAAA,UAAI,CAACA,EAAS,MAAMA,EAAS,WAAW;AACpC,cAAM,IAAI,MAAM,2BAA2BA,EAAS,MAAM,GAAG;AAEjE,WAAK,cAAcjB,EAAkBE,CAAI,CAAC;AAAA;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,QAAQH,GAAM;AAChB,UAAMH,KAAUG,KAAA,gBAAAA,EAAM,WAAU;AAChC,WAAKH,IAGDE,GAAoBF,CAAO,IACpBA,IAEJ,KAAK,SAASA,CAAO,IALjB;AAAA,EAMf;AAAA;AAAA;AAAA;AAAA,EAKA,OAAOY,GAAK;AACR,QAAKA,KAAA,QAAAA,EAAK,WAAW,UAGrB;AAAA,iBAAW,CAACN,GAAMK,CAAM,KAAK,KAAK;AAC9B,YAAIA,MAAWC,GAAK;AAChB,cAAI,gBAAgBA,CAAG,GACvB,KAAK,YAAY,OAAON,CAAI;AAC5B;AAAA,QACJ;AAEJ,UAAI,gBAAgBM,CAAG;AAAA;AAAA,EAC3B;AAAA,EAEA,cAAcN,GAAM;AAChB,UAAMM,IAAM,KAAK,YAAY,IAAIN,CAAI;AACrC,IAAIM,MACA,IAAI,gBAAgBA,CAAG,GACvB,KAAK,YAAY,OAAON,CAAI;AAAA,EAEpC;AAAA,EAEA,aAAa;AACT,eAAWM,KAAO,KAAK,YAAY,OAAM;AACrC,UAAI,gBAAgBA,CAAG;AAE3B,SAAK,YAAY,MAAK;AAAA,EAC1B;AACJ;AAUO,SAASO,GAAsBD,GAASF,IAAiB,IAAI;AAChE,QAAM9E,KAAOgF,KAAW,IAAI,QAAQ,cAAc,EAAE,GAC9CO,KAAQT,KAAkB,IAAI,QAAQ,cAAc,EAAE;AAC5D,MAAI,CAAC9E;AACD,WAAO;AAEX,MAAIwF,IAAexF;AACnB,MAAIuF;AACA,QAAIvF,MAAQuF,KAAQvF,EAAI,WAAW,GAAGuF,CAAI,GAAG;AACzC,MAAAC,IAAexF,MAAQuF,IAAO,KAAKvF,EAAI,MAAMuF,EAAK,SAAS,CAAC;AAAA;AAG5D,aAAO;AAGf,SAAKC,EAAa,SAAS,GAAG,IAGvBA,EAAa,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK,GAAG,IAFzC;AAGf;AASO,SAASC,GACZzD,GACA,EAAE,aAAA4C,GAAa,SAAAI,IAAU,IAAI,gBAAAF,IAAiB,GAAE,IAAK,CAAA,GACvD;AACE,QAAMD,IAAaI,GAAsBD,GAASF,CAAc,GAC1D3F,IAAQ,IAAIwF,GAAe,EAAE,aAAAC,GAAa,YAAAC,GAAY,gBAAAC,GAAgB;AAC5E,SAAA9C,EAAO,SAAS7C,GACTA;AACX;ACnPO,eAAeuG,GAAiB1D,GAAQ7C,GAAO;AAClD,MAAI,CAAC6C,KAAU,CAAC7C;AACZ,UAAM,IAAI,MAAM,iDAAiD;AAErE,SAAI,OAAOA,EAAM,QAAS,cACtB,MAAMA,EAAM,KAAI,GAEpB6C,EAAO,SAAS7C,GACTA;AACX;ACcA,IAAIwG,IAAK,YAAYC,IAAM,aAAaC,KAAM,YAE1CC,KAAO,IAAIH,EAAG;AAAA,EAAC;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA;AAAA,EAAgB;AAAA,EAAG;AAAA;AAAA,EAAoB;AAAC,CAAC,GAE5II,KAAO,IAAIJ,EAAG;AAAA,EAAC;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA;AAAA,EAAiB;AAAA,EAAG;AAAC,CAAC,GAEnIK,KAAO,IAAIL,EAAG,CAAC,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC,GAEhFM,KAAO,SAAUC,GAAIC,GAAO;AAE5B,WADIpG,IAAI,IAAI6F,EAAI,EAAE,GACTQ,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,IAAArG,EAAEqG,CAAC,IAAID,KAAS,KAAKD,EAAGE,IAAI,CAAC;AAIjC,WADIC,IAAI,IAAIR,GAAI9F,EAAE,EAAE,CAAC,GACZqG,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,aAASE,IAAIvG,EAAEqG,CAAC,GAAGE,IAAIvG,EAAEqG,IAAI,CAAC,GAAG,EAAEE;AAC/B,MAAAD,EAAEC,CAAC,IAAMA,IAAIvG,EAAEqG,CAAC,KAAM,IAAKA;AAGnC,SAAO,EAAE,GAAGrG,GAAG,GAAGsG,EAAC;AACvB,GACIxF,KAAKoF,GAAKH,IAAM,CAAC,GAAGS,KAAK1F,GAAG,GAAG2F,KAAQ3F,GAAG;AAE9C0F,GAAG,EAAE,IAAI,KAAKC,GAAM,GAAG,IAAI;AACxB,IAAC1F,KAAKmF,GAAKF,IAAM,CAAC,GAAcU,KAAQ3F,GAAG,GAE1C4F,KAAM,IAAId,EAAI,KAAK;AACvB,SAASQ,IAAI,GAAGA,IAAI,OAAO,EAAEA,GAAG;AAE5B,MAAIO,KAAMP,IAAI,UAAW,KAAOA,IAAI,UAAW;AAC/C,EAAAO,KAAMA,IAAI,UAAW,KAAOA,IAAI,UAAW,GAC3CA,KAAMA,IAAI,UAAW,KAAOA,IAAI,SAAW,GAC3CD,GAAIN,CAAC,MAAOO,IAAI,UAAW,KAAOA,IAAI,QAAW,MAAO;AAC5D;AAIA,IAAIC,IAAQ,SAAUC,GAAIC,GAAI,GAAG;AAO7B,WANIC,IAAIF,EAAG,QAEPT,IAAI,GAEJY,IAAI,IAAIpB,EAAIkB,CAAE,GAEXV,IAAIW,GAAG,EAAEX;AACZ,IAAIS,EAAGT,CAAC,KACJ,EAAEY,EAAEH,EAAGT,CAAC,IAAI,CAAC;AAGrB,MAAIa,IAAK,IAAIrB,EAAIkB,CAAE;AACnB,OAAKV,IAAI,GAAGA,IAAIU,GAAI,EAAEV;AAClB,IAAAa,EAAGb,CAAC,IAAKa,EAAGb,IAAI,CAAC,IAAIY,EAAEZ,IAAI,CAAC,KAAM;AAEtC,MAAIc;AACJ,MAAI,GAAG;AAEH,IAAAA,IAAK,IAAItB,EAAI,KAAKkB,CAAE;AAEpB,QAAIK,IAAM,KAAKL;AACf,SAAKV,IAAI,GAAGA,IAAIW,GAAG,EAAEX;AAEjB,UAAIS,EAAGT,CAAC;AAQJ,iBANIgB,IAAMhB,KAAK,IAAKS,EAAGT,CAAC,GAEpBiB,IAAMP,IAAKD,EAAGT,CAAC,GAEfkB,IAAIL,EAAGJ,EAAGT,CAAC,IAAI,CAAC,OAAOiB,GAElBE,IAAID,KAAM,KAAKD,KAAO,GAAIC,KAAKC,GAAG,EAAED;AAEzC,UAAAJ,EAAGR,GAAIY,CAAC,KAAKH,CAAG,IAAIC;AAAA,EAIpC;AAGI,SADAF,IAAK,IAAItB,EAAImB,CAAC,GACTX,IAAI,GAAGA,IAAIW,GAAG,EAAEX;AACjB,MAAIS,EAAGT,CAAC,MACJc,EAAGd,CAAC,IAAIM,GAAIO,EAAGJ,EAAGT,CAAC,IAAI,CAAC,GAAG,KAAM,KAAKS,EAAGT,CAAC;AAItD,SAAOc;AACX,GAEIM,IAAM,IAAI7B,EAAG,GAAG;AACpB,SAASS,IAAI,GAAGA,IAAI,KAAK,EAAEA;AACvB,EAAAoB,EAAIpB,CAAC,IAAI;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA;AACzB,EAAAoB,EAAIpB,CAAC,IAAI;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA;AACzB,EAAAoB,EAAIpB,CAAC,IAAI;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA;AACzB,EAAAoB,EAAIpB,CAAC,IAAI;AAEb,IAAIqB,KAAM,IAAI9B,EAAG,EAAE;AACnB,SAASS,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,EAAAqB,GAAIrB,CAAC,IAAI;AAEV,IAACsB,KAAoB,gBAAAd,EAAKY,GAAK,GAAG,CAAC,GAElCG,KAAoB,gBAAAf,EAAKa,IAAK,GAAG,CAAC,GAqBlCG,KAAO,SAAUC,GAAG;AAAE,UAASA,IAAI,KAAK,IAAK;AAAG,GAGhDC,KAAM,SAAUR,GAAGP,GAAGgB,GAAG;AAGzB,UAAIA,KAAK,QAAQA,IAAIT,EAAE,YACnBS,IAAIT,EAAE,SAEH,IAAI3B,EAAG2B,EAAE,SAASP,GAAGgB,CAAC,CAAC;AAClC,GAsBIC,KAAK;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACJ;AAAA;AAAA,EACI;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAEJ,GAEI1E,KAAM,SAAU2E,GAAKC,GAAKC,GAAI;AAC9B,MAAIJ,IAAI,IAAI,MAAMG,KAAOF,GAAGC,CAAG,CAAC;AAIhC,MAHAF,EAAE,OAAOE,GACL,MAAM,qBACN,MAAM,kBAAkBF,GAAGzE,EAAG,GAC9B,CAAC6E;AACD,UAAMJ;AACV,SAAOA;AACX,GAuLIK,IAAQ,SAAUC,GAAGR,GAAGP,GAAG;AAC3B,EAAAA,MAAMO,IAAI;AACV,MAAIS,IAAKT,IAAI,IAAK;AAClB,EAAAQ,EAAEC,CAAC,KAAKhB,GACRe,EAAEC,IAAI,CAAC,KAAKhB,KAAK;AACrB,GAEIiB,IAAU,SAAUF,GAAGR,GAAGP,GAAG;AAC7B,EAAAA,MAAMO,IAAI;AACV,MAAIS,IAAKT,IAAI,IAAK;AAClB,EAAAQ,EAAEC,CAAC,KAAKhB,GACRe,EAAEC,IAAI,CAAC,KAAKhB,KAAK,GACjBe,EAAEC,IAAI,CAAC,KAAKhB,KAAK;AACrB,GAEIkB,KAAQ,SAAUH,GAAGvB,GAAI;AAGzB,WADI2B,IAAI,CAAA,GACCrC,IAAI,GAAGA,IAAIiC,EAAE,QAAQ,EAAEjC;AAC5B,IAAIiC,EAAEjC,CAAC,KACHqC,EAAE,KAAK,EAAE,GAAGrC,GAAG,GAAGiC,EAAEjC,CAAC,GAAG;AAEhC,MAAIW,IAAI0B,EAAE,QACNC,IAAKD,EAAE,MAAK;AAChB,MAAI,CAAC1B;AACD,WAAO,EAAE,GAAG4B,IAAI,GAAG,EAAC;AACxB,MAAI5B,KAAK,GAAG;AACR,QAAIO,IAAI,IAAI3B,EAAG8C,EAAE,CAAC,EAAE,IAAI,CAAC;AACzB,WAAAnB,EAAEmB,EAAE,CAAC,EAAE,CAAC,IAAI,GACL,EAAE,GAAGnB,GAAG,GAAG,EAAC;AAAA,EACvB;AACA,EAAAmB,EAAE,KAAK,SAAU3I,GAAGC,GAAG;AAAE,WAAOD,EAAE,IAAIC,EAAE;AAAA,EAAG,CAAC,GAG5C0I,EAAE,KAAK,EAAE,GAAG,IAAI,GAAG,OAAO;AAC1B,MAAI,IAAIA,EAAE,CAAC,GAAGpC,IAAIoC,EAAE,CAAC,GAAGG,IAAK,GAAGC,IAAK,GAAGC,IAAK;AAO7C,OANAL,EAAE,CAAC,IAAI,EAAE,GAAG,IAAI,GAAG,EAAE,IAAIpC,EAAE,GAAG,GAAM,GAAGA,EAAC,GAMjCwC,KAAM9B,IAAI;AACb,QAAI0B,EAAEA,EAAEG,CAAE,EAAE,IAAIH,EAAEK,CAAE,EAAE,IAAIF,MAAOE,GAAI,GACrCzC,IAAIoC,EAAEG,KAAMC,KAAMJ,EAAEG,CAAE,EAAE,IAAIH,EAAEK,CAAE,EAAE,IAAIF,MAAOE,GAAI,GACjDL,EAAEI,GAAI,IAAI,EAAE,GAAG,IAAI,GAAG,EAAE,IAAIxC,EAAE,GAAG,GAAM,GAAGA,EAAC;AAG/C,WADI0C,IAASL,EAAG,CAAC,EAAE,GACVtC,IAAI,GAAGA,IAAIW,GAAG,EAAEX;AACrB,IAAIsC,EAAGtC,CAAC,EAAE,IAAI2C,MACVA,IAASL,EAAGtC,CAAC,EAAE;AAGvB,MAAI4C,IAAK,IAAIpD,EAAImD,IAAS,CAAC,GAEvBE,IAAMC,GAAGT,EAAEI,IAAK,CAAC,GAAGG,GAAI,CAAC;AAC7B,MAAIC,IAAMnC,GAAI;AAIV,QAAIV,IAAI,GAAG+C,IAAK,GAEZC,IAAMH,IAAMnC,GAAIuC,IAAM,KAAKD;AAE/B,SADAV,EAAG,KAAK,SAAU5I,GAAGC,GAAG;AAAE,aAAOiJ,EAAGjJ,EAAE,CAAC,IAAIiJ,EAAGlJ,EAAE,CAAC,KAAKA,EAAE,IAAIC,EAAE;AAAA,IAAG,CAAC,GAC3DqG,IAAIW,GAAG,EAAEX,GAAG;AACf,UAAIkD,IAAOZ,EAAGtC,CAAC,EAAE;AACjB,UAAI4C,EAAGM,CAAI,IAAIxC;AACX,QAAAqC,KAAME,KAAO,KAAMJ,IAAMD,EAAGM,CAAI,IAChCN,EAAGM,CAAI,IAAIxC;AAAA;AAGX;AAAA,IACR;AAEA,SADAqC,MAAOC,GACAD,IAAK,KAAG;AACX,UAAII,IAAOb,EAAGtC,CAAC,EAAE;AACjB,MAAI4C,EAAGO,CAAI,IAAIzC,IACXqC,KAAM,KAAMrC,IAAKkC,EAAGO,CAAI,MAAM,IAE9B,EAAEnD;AAAA,IACV;AACA,WAAOA,KAAK,KAAK+C,GAAI,EAAE/C,GAAG;AACtB,UAAIoD,IAAOd,EAAGtC,CAAC,EAAE;AACjB,MAAI4C,EAAGQ,CAAI,KAAK1C,MACZ,EAAEkC,EAAGQ,CAAI,GACT,EAAEL;AAAA,IAEV;AACA,IAAAF,IAAMnC;AAAA,EACV;AACA,SAAO,EAAE,GAAG,IAAInB,EAAGqD,CAAE,GAAG,GAAGC,EAAG;AAClC,GAEIC,KAAK,SAAUO,GAAGzC,GAAGqB,GAAG;AACxB,SAAOoB,EAAE,KAAK,KACR,KAAK,IAAIP,GAAGO,EAAE,GAAGzC,GAAGqB,IAAI,CAAC,GAAGa,GAAGO,EAAE,GAAGzC,GAAGqB,IAAI,CAAC,CAAC,IAC5CrB,EAAEyC,EAAE,CAAC,IAAIpB;AACpB,GAEIqB,KAAK,SAAUC,GAAG;AAGlB,WAFI5C,IAAI4C,EAAE,QAEH5C,KAAK,CAAC4C,EAAE,EAAE5C,CAAC;AACd;AAKJ,WAJI6C,IAAK,IAAIhE,EAAI,EAAEmB,CAAC,GAEhB8C,IAAM,GAAGC,IAAMH,EAAE,CAAC,GAAGI,IAAM,GAC3BC,IAAI,SAAU1C,GAAG;AAAE,IAAAsC,EAAGC,GAAK,IAAIvC;AAAA,EAAG,GAC7BlB,IAAI,GAAGA,KAAKW,GAAG,EAAEX;AACtB,QAAIuD,EAAEvD,CAAC,KAAK0D,KAAO1D,KAAKW;AACpB,QAAEgD;AAAA,SACD;AACD,UAAI,CAACD,KAAOC,IAAM,GAAG;AACjB,eAAOA,IAAM,KAAKA,KAAO;AACrB,UAAAC,EAAE,KAAK;AACX,QAAID,IAAM,MACNC,EAAED,IAAM,KAAOA,IAAM,MAAO,IAAK,QAAUA,IAAM,KAAM,IAAK,KAAK,GACjEA,IAAM;AAAA,MAEd,WACSA,IAAM,GAAG;AAEd,aADAC,EAAEF,CAAG,GAAG,EAAEC,GACHA,IAAM,GAAGA,KAAO;AACnB,UAAAC,EAAE,IAAI;AACV,QAAID,IAAM,MACNC,EAAID,IAAM,KAAM,IAAK,IAAI,GAAGA,IAAM;AAAA,MAC1C;AACA,aAAOA;AACH,QAAAC,EAAEF,CAAG;AACT,MAAAC,IAAM,GACND,IAAMH,EAAEvD,CAAC;AAAA,IACb;AAEJ,SAAO,EAAE,GAAGwD,EAAG,SAAS,GAAGC,CAAG,GAAG,GAAG9C,EAAC;AACzC,GAEIkD,IAAO,SAAUC,GAAIN,GAAI;AAEzB,WADI5C,IAAI,GACCZ,IAAI,GAAGA,IAAIwD,EAAG,QAAQ,EAAExD;AAC7B,IAAAY,KAAKkD,EAAG9D,CAAC,IAAIwD,EAAGxD,CAAC;AACrB,SAAOY;AACX,GAGImD,KAAQ,SAAUC,GAAKC,GAAKC,GAAK;AAEjC,MAAIvD,IAAIuD,EAAI,QACRhC,IAAIV,GAAKyC,IAAM,CAAC;AACpB,EAAAD,EAAI9B,CAAC,IAAIvB,IAAI,KACbqD,EAAI9B,IAAI,CAAC,IAAIvB,KAAK,GAClBqD,EAAI9B,IAAI,CAAC,IAAI8B,EAAI9B,CAAC,IAAI,KACtB8B,EAAI9B,IAAI,CAAC,IAAI8B,EAAI9B,IAAI,CAAC,IAAI;AAC1B,WAASlC,IAAI,GAAGA,IAAIW,GAAG,EAAEX;AACrB,IAAAgE,EAAI9B,IAAIlC,IAAI,CAAC,IAAIkE,EAAIlE,CAAC;AAC1B,UAAQkC,IAAI,IAAIvB,KAAK;AACzB,GAEIwD,KAAO,SAAUD,GAAKF,GAAKI,GAAOC,GAAMC,GAAIC,GAAIzE,GAAI0E,GAAIC,GAAIC,GAAIjD,GAAG;AACnE,EAAAO,EAAMgC,GAAKvC,KAAK2C,CAAK,GACrB,EAAEE,EAAG,GAAG;AAMR,WALI7J,IAAK2H,GAAMkC,GAAI,EAAE,GAAGK,IAAMlK,EAAG,GAAGmK,IAAMnK,EAAG,GACzCC,IAAK0H,GAAMmC,GAAI,EAAE,GAAGM,IAAMnK,EAAG,GAAGoK,IAAMpK,EAAG,GACzCqK,IAAKzB,GAAGqB,CAAG,GAAGK,IAAOD,EAAG,GAAGE,IAAMF,EAAG,GACpCG,IAAK5B,GAAGuB,CAAG,GAAGM,IAAOD,EAAG,GAAGE,IAAMF,EAAG,GACpCG,IAAS,IAAI7F,EAAI,EAAE,GACdQ,IAAI,GAAGA,IAAIgF,EAAK,QAAQ,EAAEhF;AAC/B,MAAEqF,EAAOL,EAAKhF,CAAC,IAAI,EAAE;AACzB,WAASA,IAAI,GAAGA,IAAImF,EAAK,QAAQ,EAAEnF;AAC/B,MAAEqF,EAAOF,EAAKnF,CAAC,IAAI,EAAE;AAGzB,WAFIsF,IAAKlD,GAAMiD,GAAQ,CAAC,GAAGE,IAAMD,EAAG,GAAGE,IAAOF,EAAG,GAC7CG,IAAO,IACJA,IAAO,KAAK,CAACF,EAAI3F,GAAK6F,IAAO,CAAC,CAAC,GAAG,EAAEA;AACvC;AACJ,MAAIC,IAAQhB,IAAK,KAAM,GACnBiB,IAAQ9B,EAAKS,GAAIlD,CAAG,IAAIyC,EAAKU,GAAIlD,EAAG,IAAIvB,GACxC8F,IAAQ/B,EAAKS,GAAIK,CAAG,IAAId,EAAKU,GAAIM,CAAG,IAAI/E,IAAK,KAAK,IAAI2F,IAAO5B,EAAKwB,GAAQE,CAAG,IAAI,IAAIF,EAAO,EAAE,IAAI,IAAIA,EAAO,EAAE,IAAI,IAAIA,EAAO,EAAE;AACpI,MAAIZ,KAAM,KAAKiB,KAAQC,KAASD,KAAQE;AACpC,WAAO7B,GAAMC,GAAKvC,GAAGyC,EAAI,SAASO,GAAIA,IAAKC,CAAE,CAAC;AAClD,MAAImB,GAAIC,GAAIC,GAAIC;AAEhB,MADAhE,EAAMgC,GAAKvC,GAAG,KAAKmE,IAAQD,EAAM,GAAGlE,KAAK,GACrCmE,IAAQD,GAAO;AACf,IAAAE,IAAKrF,EAAKmE,GAAKC,GAAK,CAAC,GAAGkB,IAAKnB,GAAKoB,IAAKvF,EAAKqE,GAAKC,GAAK,CAAC,GAAGkB,IAAKnB;AAC/D,QAAIoB,KAAMzF,EAAK+E,GAAKC,GAAM,CAAC;AAC3B,IAAAxD,EAAMgC,GAAKvC,GAAGwD,IAAM,GAAG,GACvBjD,EAAMgC,GAAKvC,IAAI,GAAG2D,IAAM,CAAC,GACzBpD,EAAMgC,GAAKvC,IAAI,IAAIgE,IAAO,CAAC,GAC3BhE,KAAK;AACL,aAASzB,IAAI,GAAGA,IAAIyF,GAAM,EAAEzF;AACxB,MAAAgC,EAAMgC,GAAKvC,IAAI,IAAIzB,GAAGuF,EAAI3F,GAAKI,CAAC,CAAC,CAAC;AACtC,IAAAyB,KAAK,IAAIgE;AAET,aADIS,IAAO,CAAClB,GAAMG,CAAI,GACbgB,IAAK,GAAGA,IAAK,GAAG,EAAEA;AAEvB,eADIC,IAAOF,EAAKC,CAAE,GACTnG,IAAI,GAAGA,IAAIoG,EAAK,QAAQ,EAAEpG,GAAG;AAClC,YAAIqG,IAAMD,EAAKpG,CAAC,IAAI;AACpB,QAAAgC,EAAMgC,GAAKvC,GAAGwE,GAAII,CAAG,CAAC,GAAG5E,KAAK8D,EAAIc,CAAG,GACjCA,IAAM,OACNrE,EAAMgC,GAAKvC,GAAI2E,EAAKpG,CAAC,KAAK,IAAK,GAAG,GAAGyB,KAAK2E,EAAKpG,CAAC,KAAK;AAAA,MAC7D;AAAA,EAER;AAEI,IAAA6F,IAAKvE,IAAKwE,IAAK1E,GAAK2E,IAAKxE,IAAKyE,IAAK3E;AAEvC,WAASrB,IAAI,GAAGA,IAAIwE,GAAI,EAAExE,GAAG;AACzB,QAAIsG,IAAMjC,EAAKrE,CAAC;AAChB,QAAIsG,IAAM,KAAK;AACX,UAAID,IAAOC,KAAO,KAAM;AACxB,MAAAnE,EAAQ6B,GAAKvC,GAAGoE,EAAGQ,IAAM,GAAG,CAAC,GAAG5E,KAAKqE,EAAGO,IAAM,GAAG,GAC7CA,IAAM,MACNrE,EAAMgC,GAAKvC,GAAI6E,KAAO,KAAM,EAAE,GAAG7E,KAAK/B,GAAK2G,CAAG;AAClD,UAAIE,IAAMD,IAAM;AAChB,MAAAnE,EAAQ6B,GAAKvC,GAAGsE,EAAGQ,CAAG,CAAC,GAAG9E,KAAKuE,EAAGO,CAAG,GACjCA,IAAM,MACNpE,EAAQ6B,GAAKvC,GAAI6E,KAAO,IAAK,IAAI,GAAG7E,KAAK9B,GAAK4G,CAAG;AAAA,IACzD;AAEI,MAAApE,EAAQ6B,GAAKvC,GAAGoE,EAAGS,CAAG,CAAC,GAAG7E,KAAKqE,EAAGQ,CAAG;AAAA,EAE7C;AACA,SAAAnE,EAAQ6B,GAAKvC,GAAGoE,EAAG,GAAG,CAAC,GAChBpE,IAAIqE,EAAG,GAAG;AACrB,GAEIU,KAAoB,oBAAI/G,GAAI,CAAC,OAAO,QAAQ,QAAQ,QAAQ,QAAQ,SAAS,SAAS,SAAS,OAAO,CAAC,GAEvG8C,KAAmB,oBAAIhD,EAAG,CAAC,GAE3BkH,KAAO,SAAUvC,GAAKwC,GAAKC,GAAMC,GAAKC,GAAMC,GAAI;AAChD,MAAI,IAAIA,EAAG,KAAK5C,EAAI,QAChBhC,IAAI,IAAI3C,EAAGqH,IAAM,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,GAAI,KAAKC,CAAI,GAEzDjD,IAAI1B,EAAE,SAAS0E,GAAK1E,EAAE,SAAS2E,CAAI,GACnCE,IAAMD,EAAG,GACT7C,KAAO6C,EAAG,KAAK,KAAK;AACxB,MAAIJ,GAAK;AACL,IAAIzC,MACAL,EAAE,CAAC,IAAIkD,EAAG,KAAK;AAenB,aAdIE,IAAMR,GAAIE,IAAM,CAAC,GACjBrD,IAAI2D,KAAO,IAAIzD,IAAIyD,IAAM,MACzBC,KAAS,KAAKN,KAAQ,GAEtBO,IAAOJ,EAAG,KAAK,IAAItH,EAAI,KAAK,GAAG2H,IAAOL,EAAG,KAAK,IAAItH,EAAIyH,IAAQ,CAAC,GAC/DG,IAAQ,KAAK,KAAKT,IAAO,CAAC,GAAGU,IAAQ,IAAID,GACzCE,IAAM,SAAUtH,IAAG;AAAE,cAAQkE,EAAIlE,EAAC,IAAKkE,EAAIlE,KAAI,CAAC,KAAKoH,IAAUlD,EAAIlE,KAAI,CAAC,KAAKqH,KAAUJ;AAAA,IAAO,GAG9F5C,IAAO,IAAI5E,GAAI,IAAK,GAEpB6E,IAAK,IAAI9E,EAAI,GAAG,GAAG+E,IAAK,IAAI/E,EAAI,EAAE,GAElC+H,IAAO,GAAGzH,IAAK,GAAGE,IAAI8G,EAAG,KAAK,GAAGtC,IAAK,GAAGgD,IAAKV,EAAG,KAAK,GAAGrC,IAAK,GAC3DzE,IAAI,IAAI,GAAG,EAAEA,GAAG;AAEnB,UAAIyH,IAAKH,EAAItH,CAAC,GAEV0H,IAAO1H,IAAI,OAAO2H,IAAQR,EAAKM,CAAE;AAKrC,UAJAP,EAAKQ,CAAI,IAAIC,GACbR,EAAKM,CAAE,IAAIC,GAGPF,KAAMxH,GAAG;AAET,YAAI4H,IAAM,IAAI5H;AACd,aAAKuH,IAAO,OAAQ/C,IAAK,WAAWoD,IAAM,OAAO,CAACb,IAAM;AACpD,UAAA9C,IAAME,GAAKD,GAAKN,GAAG,GAAGS,GAAMC,GAAIC,GAAIzE,GAAI0E,GAAIC,GAAIzE,IAAIyE,GAAIR,CAAG,GAC3DO,IAAK+C,IAAOzH,IAAK,GAAG2E,IAAKzE;AACzB,mBAASE,IAAI,GAAGA,IAAI,KAAK,EAAEA;AACvB,YAAAoE,EAAGpE,CAAC,IAAI;AACZ,mBAASA,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,YAAAqE,EAAGrE,CAAC,IAAI;AAAA,QAChB;AAEA,YAAIU,IAAI,GAAGqB,IAAI,GAAG4F,KAAOtE,GAAGuE,IAAMJ,IAAOC,IAAQ;AACjD,YAAIC,IAAM,KAAKH,KAAMH,EAAItH,IAAI8H,CAAG;AAM5B,mBALIC,IAAO,KAAK,IAAI1E,GAAGuE,CAAG,IAAI,GAC1BI,IAAO,KAAK,IAAI,OAAOhI,CAAC,GAGxBiI,IAAK,KAAK,IAAI,KAAKL,CAAG,GACnBE,KAAOE,KAAQ,EAAEH,MAAQH,KAAQC,KAAO;AAC3C,gBAAIzD,EAAIlE,IAAIY,CAAC,KAAKsD,EAAIlE,IAAIY,IAAIkH,CAAG,GAAG;AAEhC,uBADII,IAAK,GACFA,IAAKD,KAAM/D,EAAIlE,IAAIkI,CAAE,KAAKhE,EAAIlE,IAAIkI,IAAKJ,CAAG,GAAG,EAAEI;AAClD;AACJ,kBAAIA,IAAKtH,GAAG;AAGR,oBAFAA,IAAIsH,GAAIjG,IAAI6F,GAERI,IAAKH;AACL;AAMJ,yBAFII,IAAM,KAAK,IAAIL,GAAKI,IAAK,CAAC,GAC1BE,KAAK,GACAlI,IAAI,GAAGA,IAAIiI,GAAK,EAAEjI,GAAG;AAC1B,sBAAImI,KAAKrI,IAAI8H,IAAM5H,IAAI,OACnBoI,KAAMpB,EAAKmB,EAAE,GACb5H,KAAK4H,KAAKC,KAAM;AACpB,kBAAI7H,KAAK2H,OACLA,KAAK3H,IAAIkH,IAAQU;AAAA,gBACzB;AAAA,cACJ;AAAA,YACJ;AAEA,YAAAX,IAAOC,GAAOA,IAAQT,EAAKQ,CAAI,GAC/BI,KAAOJ,IAAOC,IAAQ;AAAA,UAC1B;AAGJ,YAAI1F,GAAG;AAGH,UAAAoC,EAAKG,GAAI,IAAI,YAAapE,GAAMQ,CAAC,KAAK,KAAMP,GAAM4B,CAAC;AACnD,cAAIsG,KAAMnI,GAAMQ,CAAC,IAAI,IAAI4H,KAAMnI,GAAM4B,CAAC,IAAI;AAC1C,UAAAnC,KAAMJ,GAAK6I,EAAG,IAAI5I,GAAK6I,EAAG,GAC1B,EAAElE,EAAG,MAAMiE,EAAG,GACd,EAAEhE,EAAGiE,EAAG,GACRhB,IAAKxH,IAAIY,GACT,EAAE2G;AAAA,QACN;AAEI,UAAAlD,EAAKG,GAAI,IAAIN,EAAIlE,CAAC,GAClB,EAAEsE,EAAGJ,EAAIlE,CAAC,CAAC;AAAA,MAEnB;AAAA,IACJ;AACA,SAAKA,IAAI,KAAK,IAAIA,GAAGwH,CAAE,GAAGxH,IAAI,GAAG,EAAEA;AAC/B,MAAAqE,EAAKG,GAAI,IAAIN,EAAIlE,CAAC,GAClB,EAAEsE,EAAGJ,EAAIlE,CAAC,CAAC;AAEf,IAAAiE,IAAME,GAAKD,GAAKN,GAAGmD,GAAK1C,GAAMC,GAAIC,GAAIzE,GAAI0E,GAAIC,GAAIzE,IAAIyE,GAAIR,CAAG,GACxD8C,MACDD,EAAG,IAAK7C,IAAM,IAAKL,EAAGK,IAAM,IAAK,CAAC,KAAK,GAEvCA,KAAO,GACP6C,EAAG,IAAIK,GAAML,EAAG,IAAII,GAAMJ,EAAG,IAAI9G,GAAG8G,EAAG,IAAIU;AAAA,EAEnD,OACK;AACD,aAASxH,IAAI8G,EAAG,KAAK,GAAG9G,IAAI,IAAI+G,GAAK/G,KAAK,OAAO;AAE7C,UAAI2B,KAAI3B,IAAI;AACZ,MAAI2B,MAAK,MAELiC,EAAGK,IAAM,IAAK,CAAC,IAAI8C,GACnBpF,KAAI,IAERsC,IAAMF,GAAMH,GAAGK,IAAM,GAAGC,EAAI,SAASlE,GAAG2B,EAAC,CAAC;AAAA,IAC9C;AACA,IAAAmF,EAAG,IAAI;AAAA,EACX;AACA,SAAOpF,GAAIQ,GAAG,GAAG0E,IAAMpF,GAAKyC,CAAG,IAAI4C,CAAI;AAC3C,GAEI4B,KAAsB,2BAAY;AAElC,WADI,IAAI,IAAI,WAAW,GAAG,GACjBzI,IAAI,GAAGA,IAAI,KAAK,EAAEA,GAAG;AAE1B,aADIuD,IAAIvD,GAAG0I,IAAI,GACR,EAAEA;AACL,MAAAnF,KAAMA,IAAI,KAAM,cAAeA,MAAM;AACzC,MAAEvD,CAAC,IAAIuD;AAAA,EACX;AACA,SAAO;AACX,EAAC,GAEGoF,KAAM,WAAY;AAClB,MAAIpF,IAAI;AACR,SAAO;AAAA,IACH,GAAG,SAAUtB,GAAG;AAGZ,eADI2G,IAAKrF,GACAvD,IAAI,GAAGA,IAAIiC,EAAE,QAAQ,EAAEjC;AAC5B,QAAA4I,IAAKH,GAAMG,IAAK,MAAO3G,EAAEjC,CAAC,CAAC,IAAK4I,MAAO;AAC3C,MAAArF,IAAIqF;AAAA,IACR;AAAA,IACA,GAAG,WAAY;AAAE,aAAO,CAACrF;AAAA,IAAG;AAAA,EACpC;AACA,GAyBIsF,KAAO,SAAU3E,GAAK8C,GAAKJ,GAAKC,GAAMC,GAAI;AAC1C,MAAI,CAACA,MACDA,IAAK,EAAE,GAAG,EAAC,GACPE,EAAI,aAAY;AAChB,QAAI8B,IAAO9B,EAAI,WAAW,SAAS,MAAM,GACrC+B,IAAS,IAAIxJ,EAAGuJ,EAAK,SAAS5E,EAAI,MAAM;AAC5C,IAAA6E,EAAO,IAAID,CAAI,GACfC,EAAO,IAAI7E,GAAK4E,EAAK,MAAM,GAC3B5E,IAAM6E,GACNjC,EAAG,IAAIgC,EAAK;AAAA,EAChB;AAEJ,SAAOrC,GAAKvC,GAAK8C,EAAI,SAAS,OAAO,IAAIA,EAAI,OAAOA,EAAI,OAAO,OAAQF,EAAG,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,IAAI5C,EAAI,MAAM,CAAC,CAAC,IAAI,GAAG,IAAI,KAAO,KAAK8C,EAAI,KAAMJ,GAAKC,GAAMC,CAAE;AACxL,GAEIkC,KAAM,SAAUtP,GAAGC,GAAG;AACtB,MAAIuI,IAAI,CAAA;AACR,WAASwG,KAAKhP;AACV,IAAAwI,EAAEwG,CAAC,IAAIhP,EAAEgP,CAAC;AACd,WAASA,KAAK/O;AACV,IAAAuI,EAAEwG,CAAC,IAAI/O,EAAE+O,CAAC;AACd,SAAOxG;AACX,GA4II+G,IAAS,SAAUhH,GAAGtI,GAAGuH,GAAG;AAC5B,SAAOA,GAAG,EAAEvH;AACR,IAAAsI,EAAEtI,CAAC,IAAIuH,GAAGA,OAAO;AACzB;AAqLO,SAASgI,GAAYC,GAAMC,GAAM;AACpC,SAAOP,GAAKM,GAAMC,KAAQ,CAAA,GAAI,GAAG,CAAC;AACtC;AAkfA,IAAIC,KAAO,SAAUpH,GAAGR,GAAGY,GAAGH,GAAG;AAC7B,WAASwG,KAAKzG,GAAG;AACb,QAAIqH,IAAMrH,EAAEyG,CAAC,GAAGrF,IAAI5B,IAAIiH,GAAGa,IAAKrH;AAChC,IAAI,MAAM,QAAQoH,CAAG,MACjBC,IAAKP,GAAI9G,GAAGoH,EAAI,CAAC,CAAC,GAAGA,IAAMA,EAAI,CAAC,IAChC,YAAY,OAAOA,CAAG,IACtBjH,EAAEgB,CAAC,IAAI,CAACiG,GAAKC,CAAE,KAEflH,EAAEgB,KAAK,GAAG,IAAI,CAAC,IAAI9D,EAAG,CAAC,GAAGgK,CAAE,GAC5BF,GAAKC,GAAKjG,GAAGhB,GAAGH,CAAC;AAAA,EAEzB;AACJ,GAEIsH,KAAK,OAAO,cAAe,OAA6B,oBAAI,YAAW,GAEvEC,KAAK,OAAO,cAAe,OAA6B,oBAAI,YAAW,GAEvEC,KAAM;AACV,IAAI;AACA,EAAAD,GAAG,OAAOlH,IAAI,EAAE,QAAQ,GAAI,CAAE,GAC9BmH,KAAM;AACV,QACU;AAAE;AAwGL,SAASC,GAAQC,GAAKC,GAAQ;AACrC,MAAA7J;AAMI,MAAIwJ;AACA,WAAOA,GAAG,OAAOI,CAAG;AAKxB,WAJIhJ,IAAIgJ,EAAI,QACRE,IAAK,IAAIvK,EAAGqK,EAAI,UAAUA,EAAI,UAAU,EAAE,GAC1CG,IAAK,GACLnG,IAAI,SAAU1C,GAAG;AAAE,IAAA4I,EAAGC,GAAI,IAAI7I;AAAA,EAAG,GAC5BlB,IAAI,GAAGA,IAAIY,GAAG,EAAEZ,GAAG;AACxB,QAAI+J,IAAK,IAAID,EAAG,QAAQ;AACpB,UAAIzG,IAAI,IAAI9D,EAAGwK,IAAK,KAAMnJ,IAAIZ,KAAM,EAAE;AACtC,MAAAqD,EAAE,IAAIyG,CAAE,GACRA,IAAKzG;AAAA,IACT;AACA,QAAI,IAAIuG,EAAI,WAAW5J,CAAC;AACxB,IAAI,IAAI,OAAO6J,IACXjG,EAAE,CAAC,IACE,IAAI,QACTA,EAAE,MAAO,KAAK,CAAE,GAAGA,EAAE,MAAO,IAAI,EAAG,KAC9B,IAAI,SAAS,IAAI,SACtB,IAAI,SAAS,IAAI,WAAegG,EAAI,WAAW,EAAE5J,CAAC,IAAI,MAClD4D,EAAE,MAAO,KAAK,EAAG,GAAGA,EAAE,MAAQ,KAAK,KAAM,EAAG,GAAGA,EAAE,MAAQ,KAAK,IAAK,EAAG,GAAGA,EAAE,MAAO,IAAI,EAAG,MAE7FA,EAAE,MAAO,KAAK,EAAG,GAAGA,EAAE,MAAQ,KAAK,IAAK,EAAG,GAAGA,EAAE,MAAO,IAAI,EAAG;AAAA,EACtE;AACA,SAAOlC,GAAIoI,GAAI,GAAGC,CAAE;AACxB;AA0DA,IAAIC,KAAO,SAAUC,GAAI;AACrB,MAAIpJ,IAAK;AACT,MAAIoJ;AACA,aAASvB,KAAKuB,GAAI;AACd,UAAIrJ,IAAIqJ,EAAGvB,CAAC,EAAE;AACd,MAAI9H,IAAI,SACJ1D,GAAI,CAAC,GACT2D,KAAMD,IAAI;AAAA,IACd;AAEJ,SAAOC;AACX,GAEIqJ,KAAM,SAAUjI,GAAGtI,GAAGwQ,GAAGC,GAAIC,GAAG9G,GAAG+G,GAAIxJ,GAAI;AAC3C,MAAIX,IAAKiK,EAAG,QAAQH,IAAKE,EAAE,OAAOI,IAAMzJ,KAAMA,EAAG,QAC7C0J,IAAMR,GAAKC,CAAE;AACjB,EAAAhB,EAAOhH,GAAGtI,GAAG2Q,KAAM,OAAO,WAAY,QAAS,GAAG3Q,KAAK,GACnD2Q,KAAM,SACNrI,EAAEtI,GAAG,IAAI,IAAIsI,EAAEtI,GAAG,IAAIwQ,EAAE,KAC5BlI,EAAEtI,CAAC,IAAI,IAAIA,KAAK,GAChBsI,EAAEtI,GAAG,IAAKwQ,EAAE,QAAQ,KAAM5G,IAAI,KAAK,IAAItB,EAAEtI,GAAG,IAAI0Q,KAAK,GACrDpI,EAAEtI,GAAG,IAAIwQ,EAAE,cAAc,KAAKlI,EAAEtI,GAAG,IAAIwQ,EAAE,eAAe;AACxD,MAAIpH,IAAK,IAAI,KAAKoH,EAAE,SAAS,OAAO,KAAK,IAAG,IAAKA,EAAE,KAAK,GAAGM,IAAI1H,EAAG,YAAW,IAAK;AAkBlF,OAjBI0H,IAAI,KAAKA,IAAI,QACbvN,GAAI,EAAE,GACV+L,EAAOhH,GAAGtI,GAAI8Q,KAAK,KAAQ1H,EAAG,SAAQ,IAAK,KAAM,KAAOA,EAAG,QAAO,KAAM,KAAOA,EAAG,SAAQ,KAAM,KAAOA,EAAG,WAAU,KAAM,IAAMA,EAAG,WAAU,KAAM,CAAE,GAAGpJ,KAAK,GACzJ4J,KAAK,OACL0F,EAAOhH,GAAGtI,GAAGwQ,EAAE,GAAG,GAClBlB,EAAOhH,GAAGtI,IAAI,GAAG4J,IAAI,IAAI,CAACA,IAAI,IAAIA,CAAC,GACnC0F,EAAOhH,GAAGtI,IAAI,GAAGwQ,EAAE,IAAI,IAE3BlB,EAAOhH,GAAGtI,IAAI,IAAIwG,CAAE,GACpB8I,EAAOhH,GAAGtI,IAAI,IAAI6Q,CAAG,GAAG7Q,KAAK,IACzB2Q,KAAM,SACNrB,EAAOhH,GAAGtI,GAAG4Q,CAAG,GAChBtB,EAAOhH,GAAGtI,IAAI,GAAGwQ,EAAE,KAAK,GACxBlB,EAAOhH,GAAGtI,IAAI,IAAI2Q,CAAE,GAAG3Q,KAAK,KAEhCsI,EAAE,IAAImI,GAAIzQ,CAAC,GACXA,KAAKwG,GACDqK;AACA,aAAS9B,KAAKuB,GAAI;AACd,UAAIS,IAAMT,EAAGvB,CAAC,GAAG9H,IAAI8J,EAAI;AACzB,MAAAzB,EAAOhH,GAAGtI,GAAG,CAAC+O,CAAC,GACfO,EAAOhH,GAAGtI,IAAI,GAAGiH,CAAC,GAClBqB,EAAE,IAAIyI,GAAK/Q,IAAI,CAAC,GAAGA,KAAK,IAAIiH;AAAA,IAChC;AAEJ,SAAI2J,MACAtI,EAAE,IAAInB,GAAInH,CAAC,GAAGA,KAAK4Q,IAChB5Q;AACX,GAEIgR,KAAM,SAAUzI,GAAGvI,GAAG4J,GAAGtB,GAAGN,GAAG;AAC/B,EAAAsH,EAAO/G,GAAGvI,GAAG,SAAS,GACtBsP,EAAO/G,GAAGvI,IAAI,GAAG4J,CAAC,GAClB0F,EAAO/G,GAAGvI,IAAI,IAAI4J,CAAC,GACnB0F,EAAO/G,GAAGvI,IAAI,IAAIsI,CAAC,GACnBgH,EAAO/G,GAAGvI,IAAI,IAAIgI,CAAC;AACvB;AAoXO,SAASiJ,GAAQzB,GAAMC,GAAM;AAChC,EAAKA,MACDA,IAAO,CAAA;AACX,MAAI,IAAI,CAAA,GACJyB,IAAQ,CAAA;AACZ,EAAAxB,GAAKF,GAAM,IAAI,GAAGC,CAAI;AACtB,MAAIlH,IAAI,GACJ4I,IAAM;AACV,WAASV,KAAM,GAAG;AACd,QAAI3P,IAAK,EAAE2P,CAAE,GAAGW,IAAOtQ,EAAG,CAAC,GAAGgH,IAAIhH,EAAG,CAAC,GAClCuQ,IAAcvJ,EAAE,SAAS,IAAI,IAAI,GACjC,IAAIkI,GAAQS,CAAE,GAAGzJ,IAAI,EAAE,QACvBsK,IAAMxJ,EAAE,SAASN,IAAI8J,KAAOtB,GAAQsB,CAAG,GAAGC,IAAK/J,KAAKA,EAAE,QACtDqJ,IAAMR,GAAKvI,EAAE,KAAK;AACtB,IAAId,IAAI,SACJzD,GAAI,EAAE;AACV,QAAI+E,IAAI+I,IAAc9B,GAAY6B,GAAMtJ,CAAC,IAAIsJ,GAAMnK,IAAIqB,EAAE,QACrDsB,IAAIoF,GAAG;AACX,IAAApF,EAAE,EAAEwH,CAAI,GACRF,EAAM,KAAK7B,GAAIvH,GAAG;AAAA,MACd,MAAMsJ,EAAK;AAAA,MACX,KAAKxH,EAAE,EAAC;AAAA,MACR,GAAGtB;AAAA,MACH;AAAA,MACA,GAAGd;AAAA,MACH,GAAGR,KAAKyJ,EAAG,UAAWjJ,KAAM8J,EAAI,UAAUC;AAAA,MAC1C,GAAGhJ;AAAA,MACH,aAAa8I;AAAA,IACzB,CAAS,CAAC,GACF9I,KAAK,KAAKvB,IAAI6J,IAAM5J,GACpBkK,KAAO,KAAK,KAAKnK,IAAI6J,MAAQU,KAAM,KAAKtK;AAAA,EAC5C;AAEA,WADIoD,IAAM,IAAIzE,EAAGuL,IAAM,EAAE,GAAGK,IAAKjJ,GAAGkJ,IAAMN,IAAM5I,GACvClC,IAAI,GAAGA,IAAI6K,EAAM,QAAQ,EAAE7K,GAAG;AACnC,QAAI,IAAI6K,EAAM7K,CAAC;AACf,IAAAkK,GAAIlG,GAAK,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,MAAM;AACrC,QAAIqH,IAAO,KAAK,EAAE,EAAE,SAASrB,GAAK,EAAE,KAAK;AACzC,IAAAhG,EAAI,IAAI,EAAE,GAAG,EAAE,IAAIqH,CAAI,GACvBnB,GAAIlG,GAAK9B,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,GAAGA,KAAK,KAAKmJ,KAAQ,EAAE,IAAI,EAAE,EAAE,SAAS;AAAA,EACzF;AACA,SAAAV,GAAI3G,GAAK9B,GAAG2I,EAAM,QAAQO,GAAKD,CAAE,GAC1BnH;AACX;AC/wEO,SAASsH,GAAyB9Q,GAAK;ATfvC,MAAAC;ASgBH,MAAI,CAACD,KAAO,OAAOA,KAAQ;AACvB,WAAO,CAAA;AAEX,MAAI;AACA,UAAMZ,IAAM,IAAI,UAAS,EAAG,gBAAgBY,GAAK,iBAAiB;AAClE,QAAIZ,EAAI,cAAc,aAAa;AAC/B,aAAO,CAAA;AAEX,UAAM2R,IAAO,oBAAI,IAAG,GAEdC,IAAQ,CAAA;AACd,eAAWzQ,KAAMnB,EAAI,qBAAqB,GAAG;AACzC,iBAAW6R,KAAQ,CAAC,OAAO,MAAM,GAAG;AAEhC,YAAIC,IAAQ;AACZ,QAAID,MAAS,SACTC,MACIjR,IAAAM,EAAG,mBAAH,gBAAAN,EAAA,KAAAM,GAAoB,gCAAgC,YACpDA,EAAG,aAAa,YAAY,KAC5BA,EAAG,aAAa,MAAM,IAE1B2Q,IAAQ3Q,EAAG,aAAa0Q,CAAI;AAEhC,cAAM/N,IAAUgO,KAAA,gBAAAA,EAAO;AACvB,QAAI,CAAChO,KAAWE,GAAoBF,CAAO,KAAK6N,EAAK,IAAI7N,CAAO,MAGhE6N,EAAK,IAAI7N,CAAO,GAChB8N,EAAM,KAAK9N,CAAO;AAAA,MACtB;AAEJ,WAAO8N;AAAA,EACX,QAAQ;AACJ,WAAO,CAAA;AAAA,EACX;AACJ;AASO,eAAeG,GAAwBnR,GAAKzB,GAAO;AACtD,MAAI,EAACA,KAAA,QAAAA,EAAO;AACR,WAAO,CAAA;AAEX,QAAMyS,IAAQF,GAAyB9Q,CAAG,GAEpCoR,IAAQ,CAAA;AACd,aAAW5N,KAAQwN,GAAO;AACtB,UAAMpN,IAAQ,MAAMrF,EAAM,IAAIiF,CAAI;AAClC,IAAII,KAAA,QAAAA,EAAO,QACPwN,EAAM,KAAKxN,CAAK;AAAA,EAExB;AACA,SAAOwN;AACX;AAQO,SAASC,GAAgB5M,GAAM3B,GAAU;AAC5C,QAAMgB,IAAM,IAAI,gBAAgBW,CAAI,GAC9B6M,IAAO,SAAS,cAAc,GAAG;AACvC,EAAAA,EAAK,OAAOxN,GACZwN,EAAK,WAAWxO,GAChB,SAAS,KAAK,YAAYwO,CAAI,GAC9BA,EAAK,MAAK,GACV,SAAS,KAAK,YAAYA,CAAI,GAC9B,IAAI,gBAAgBxN,CAAG;AAC3B;AAMO,SAASyN,GAAkBC,GAAa;AAE3C,SAAO,IADOA,KAAe,gBAAgB,QAAQ,WAAW,EAAE,KAChD,UAAU;AAChC;AAQO,SAASC,GAAYzR,GAAK8C,IAAW,gBAAgB;AACxD,QAAM2B,IAAO,IAAI,KAAK,CAACzE,CAAG,GAAG,EAAE,MAAM,mBAAmB;AACxD,EAAAqR,GAAgB5M,GAAM3B,CAAQ;AAClC;AAUO,eAAe4O,GAAiB1R,GAAK2R,GAAQH,IAAc,gBAAgB;AAE9E,QAAMnB,IAAQ;AAAA,IACV,CAACmB,CAAW,GAAGrC,GAAQnP,CAAG;AAAA,EAClC;AACI,aAAW4D,KAAS+N,GAAQ;AACxB,UAAMnO,IAAOI,EAAM,KAAK,QAAQ,QAAQ,EAAE;AAC1C,IAAI,CAACJ,KAAQA,MAASgO,MAGtBnB,EAAM7M,CAAI,IAAI,IAAI,WAAW,MAAMI,EAAM,KAAK,aAAa;AAAA,EAC/D;AACA,QAAMgO,IAASxB,GAAQC,GAAO,EAAE,OAAO,EAAC,CAAE,GAEpCwB,IAAO,IAAI,WAAWD,EAAO,UAAU;AAC7C,SAAAC,EAAK,IAAID,CAAM,GACR,IAAI,KAAK,CAACC,EAAK,MAAM,GAAG,EAAE,MAAM,mBAAmB;AAC9D;AASO,eAAeC,GAAoB9R,GAAK2R,GAAQH,IAAc,gBAAgB;AACjF,QAAM/M,IAAO,MAAMiN,GAAiB1R,GAAK2R,GAAQH,CAAW;AAC5D,EAAAH,GAAgB5M,GAAM8M,GAAkBC,CAAW,CAAC;AACxD;","x_google_ignoreList":[8]}
package/dist/tei-editor-styles.css CHANGED
@@ -125,6 +125,7 @@ tei-figure > img {
125
125
  display: block;
126
126
  margin: 0 auto;
127
127
  cursor: pointer;
128
+ max-width: 100%;
128
129
  }
129
130
 
130
131
  tei-figure > tei-figDesc {
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@jinntec/jinntap",
3
- "version": "1.33.0",
3
+ "version": "1.34.1",
4
4
  "type": "module",
5
5
  "main": "./dist/index.es.js",
6
6
  "module": "./dist/index.es.js",
@@ -66,6 +66,7 @@
66
66
  "@tiptap/extensions": "^3.28.0",
67
67
  "@tiptap/pm": "^3.28.0",
68
68
  "@tiptap/starter-kit": "^3.28.0",
69
+ "fflate": "^0.8.3",
69
70
  "fontoxpath": "^3.33.2",
70
71
  "prettier-plugin-xquery": "^1.2.5",
71
72
  "rollup": "^4.62.2",