gosling.js 1.0.2 → 1.0.3

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (30) hide show
  1. package/README.md +1 -0
  2. package/dist/assets/bam-worker-Dcv_bU7t.js.map +1 -0
  3. package/dist/assets/bed-worker-BJN3rskf.js.map +1 -0
  4. package/dist/assets/gff-worker-BnsF6Ylf.js.map +1 -0
  5. package/dist/assets/vcf-worker-DCjwwMlo.js.map +1 -0
  6. package/dist/client-C0UZV21F.js +61 -0
  7. package/dist/client-C0UZV21F.js.map +1 -0
  8. package/dist/compile-DjkAkVl6.js +13511 -0
  9. package/dist/compile-DjkAkVl6.js.map +1 -0
  10. package/dist/compiler.js +2 -9
  11. package/dist/compiler.js.map +1 -1
  12. package/dist/gosling.js +1053 -3674
  13. package/dist/gosling.js.map +1 -1
  14. package/dist/src/core/gosling-embed.d.ts.map +1 -1
  15. package/dist/src/core/mark/outline-circular.d.ts.map +1 -1
  16. package/dist/src/data-fetchers/bam/bam-worker.d.ts.map +1 -1
  17. package/dist/{exported-utils-26226ee9.js → utils-DAef6RYs.js} +2 -6
  18. package/dist/utils-DAef6RYs.js.map +1 -0
  19. package/dist/utils.js +10 -18
  20. package/dist/utils.js.map +1 -1
  21. package/package.json +5 -5
  22. package/dist/assets/bam-worker-fec5d05b.js.map +0 -1
  23. package/dist/assets/bed-worker-cb58a7c2.js.map +0 -1
  24. package/dist/assets/gff-worker-71adf8b0.js.map +0 -1
  25. package/dist/assets/vcf-worker-0bc0fe81.js.map +0 -1
  26. package/dist/exported-compiler-e419fb4a.js +0 -23705
  27. package/dist/exported-compiler-e419fb4a.js.map +0 -1
  28. package/dist/exported-utils-26226ee9.js.map +0 -1
  29. package/dist/src/alias/buffer-shim.d.ts +0 -2
  30. package/dist/src/alias/buffer-shim.d.ts.map +0 -1
package/dist/assets/bam-worker-Dcv_bU7t.js.map ADDED
@@ -0,0 +1 @@
1
+ {"version":3,"file":"bam-worker-Dcv_bU7t.js","sources":["../node_modules/.pnpm/is-observable@2.1.0/node_modules/is-observable/index.js","../node_modules/.pnpm/threads@1.7.0/node_modules/threads/dist/serializers.js","../node_modules/.pnpm/threads@1.7.0/node_modules/threads/dist/common.js","../node_modules/.pnpm/threads@1.7.0/node_modules/threads/dist/symbols.js","../node_modules/.pnpm/threads@1.7.0/node_modules/threads/dist/transferable.js","../node_modules/.pnpm/threads@1.7.0/node_modules/threads/dist/types/messages.js","../node_modules/.pnpm/threads@1.7.0/node_modules/threads/dist/worker/implementation.browser.js","../node_modules/.pnpm/threads@1.7.0/node_modules/threads/dist/worker/index.js","../node_modules/.pnpm/threads@1.7.0/node_modules/threads/worker.mjs","../node_modules/.pnpm/long@4.0.0/node_modules/long/src/long.js","../node_modules/.pnpm/@gmod+bam@1.1.18_patch_hash=r25ck4g7txg57q4ocnmpflc4vm/node_modules/@gmod/bam/esm/virtualOffset.js","../node_modules/.pnpm/@gmod+bam@1.1.18_patch_hash=r25ck4g7txg57q4ocnmpflc4vm/node_modules/@gmod/bam/esm/chunk.js","../node_modules/.pnpm/@gmod+bam@1.1.18_patch_hash=r25ck4g7txg57q4ocnmpflc4vm/node_modules/@gmod/bam/esm/indexFile.js","../node_modules/.pnpm/@gmod+bam@1.1.18_patch_hash=r25ck4g7txg57q4ocnmpflc4vm/node_modules/@gmod/bam/esm/util.js","../node_modules/.pnpm/@gmod+bam@1.1.18_patch_hash=r25ck4g7txg57q4ocnmpflc4vm/node_modules/@gmod/bam/esm/bai.js","../node_modules/.pnpm/base64-js@1.5.1/node_modules/base64-js/index.js","../node_modules/.pnpm/ieee754@1.2.1/node_modules/ieee754/index.js","../node_modules/.pnpm/buffer@6.0.3/node_modules/buffer/index.js","../__vite-browser-external","../node_modules/.pnpm/generic-filehandle@3.1.1/node_modules/generic-filehandle/esm/remoteFile.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/utils/common.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/trees.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/adler32.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/crc32.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/messages.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/deflate.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/utils/strings.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/zstream.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/deflate.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/inffast.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/inftrees.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/inflate.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/constants.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/gzheader.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/inflate.js","../node_modules/.pnpm/pako@1.0.11/node_modules/pako/index.js","../node_modules/.pnpm/@gmod+bgzf-filehandle@1.4.7/node_modules/@gmod/bgzf-filehandle/esm/unzip-pako.js","../node_modules/.pnpm/@gmod+bam@1.1.18_patch_hash=r25ck4g7txg57q4ocnmpflc4vm/node_modules/@gmod/bam/esm/csi.js","../node_modules/.pnpm/buffer-crc32@0.2.13/node_modules/buffer-crc32/index.js","../node_modules/.pnpm/object.entries-ponyfill@1.0.1/node_modules/object.entries-ponyfill/entries.js","../node_modules/.pnpm/object.entries-ponyfill@1.0.1/node_modules/object.entries-ponyfill/index.js","../node_modules/.pnpm/abortcontroller-polyfill@1.7.5/node_modules/abortcontroller-polyfill/dist/cjs-ponyfill.js","../node_modules/.pnpm/abortable-promise-cache@1.5.0/node_modules/abortable-promise-cache/esm/abortcontroller-ponyfill.js","../node_modules/.pnpm/abortable-promise-cache@1.5.0/node_modules/abortable-promise-cache/esm/AggregateAbortController.js","../node_modules/.pnpm/abortable-promise-cache@1.5.0/node_modules/abortable-promise-cache/esm/AggregateStatusReporter.js","../node_modules/.pnpm/abortable-promise-cache@1.5.0/node_modules/abortable-promise-cache/esm/AbortablePromiseCache.js","../node_modules/.pnpm/abortable-promise-cache@1.5.0/node_modules/abortable-promise-cache/esm/index.js","../node_modules/.pnpm/quick-lru@2.0.0/node_modules/quick-lru/index.js","../node_modules/.pnpm/@gmod+bam@1.1.18_patch_hash=r25ck4g7txg57q4ocnmpflc4vm/node_modules/@gmod/bam/esm/constants.js","../node_modules/.pnpm/@gmod+bam@1.1.18_patch_hash=r25ck4g7txg57q4ocnmpflc4vm/node_modules/@gmod/bam/esm/record.js","../node_modules/.pnpm/@gmod+bam@1.1.18_patch_hash=r25ck4g7txg57q4ocnmpflc4vm/node_modules/@gmod/bam/esm/sam.js","../node_modules/.pnpm/@gmod+bam@1.1.18_patch_hash=r25ck4g7txg57q4ocnmpflc4vm/node_modules/@gmod/bam/esm/bamFile.js","../node_modules/.pnpm/cross-fetch@3.2.0/node_modules/cross-fetch/dist/browser-polyfill.js","../node_modules/.pnpm/quick-lru@6.1.2/node_modules/quick-lru/index.js","../node_modules/.pnpm/d3-array@2.12.1/node_modules/d3-array/src/ascending.js","../node_modules/.pnpm/d3-array@2.12.1/node_modules/d3-array/src/bisector.js","../src/data-fetchers/utils.ts","../src/data-fetchers/bam/bam-worker.ts"],"sourcesContent":["'use strict';\n\nmodule.exports = value => {\n\tif (!value) {\n\t\treturn false;\n\t}\n\n\t// eslint-disable-next-line no-use-extend-native/no-use-extend-native\n\tif (typeof Symbol.observable === 'symbol' && typeof value[Symbol.observable] === 'function') {\n\t\t// eslint-disable-next-line no-use-extend-native/no-use-extend-native\n\t\treturn value === value[Symbol.observable]();\n\t}\n\n\tif (typeof value['@@observable'] === 'function') {\n\t\treturn value === value['@@observable']();\n\t}\n\n\treturn false;\n};\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.DefaultSerializer = exports.extendSerializer = void 0;\nfunction extendSerializer(extend, implementation) {\n const fallbackDeserializer = extend.deserialize.bind(extend);\n const fallbackSerializer = extend.serialize.bind(extend);\n return {\n deserialize(message) {\n return implementation.deserialize(message, fallbackDeserializer);\n },\n serialize(input) {\n return implementation.serialize(input, fallbackSerializer);\n }\n };\n}\nexports.extendSerializer = extendSerializer;\nconst DefaultErrorSerializer = {\n deserialize(message) {\n return Object.assign(Error(message.message), {\n name: message.name,\n stack: message.stack\n });\n },\n serialize(error) {\n return {\n __error_marker: \"$$error\",\n message: error.message,\n name: error.name,\n stack: error.stack\n };\n }\n};\nconst isSerializedError = (thing) => thing && typeof thing === \"object\" && \"__error_marker\" in thing && thing.__error_marker === \"$$error\";\nexports.DefaultSerializer = {\n deserialize(message) {\n if (isSerializedError(message)) {\n return DefaultErrorSerializer.deserialize(message);\n }\n else {\n return message;\n }\n },\n serialize(input) {\n if (input instanceof Error) {\n return DefaultErrorSerializer.serialize(input);\n }\n else {\n return input;\n }\n }\n};\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.serialize = exports.deserialize = exports.registerSerializer = void 0;\nconst serializers_1 = require(\"./serializers\");\nlet registeredSerializer = serializers_1.DefaultSerializer;\nfunction registerSerializer(serializer) {\n registeredSerializer = serializers_1.extendSerializer(registeredSerializer, serializer);\n}\nexports.registerSerializer = registerSerializer;\nfunction deserialize(message) {\n return registeredSerializer.deserialize(message);\n}\nexports.deserialize = deserialize;\nfunction serialize(input) {\n return registeredSerializer.serialize(input);\n}\nexports.serialize = serialize;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.$worker = exports.$transferable = exports.$terminate = exports.$events = exports.$errors = void 0;\nexports.$errors = Symbol(\"thread.errors\");\nexports.$events = Symbol(\"thread.events\");\nexports.$terminate = Symbol(\"thread.terminate\");\nexports.$transferable = Symbol(\"thread.transferable\");\nexports.$worker = Symbol(\"thread.worker\");\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Transfer = exports.isTransferDescriptor = void 0;\nconst symbols_1 = require(\"./symbols\");\nfunction isTransferable(thing) {\n if (!thing || typeof thing !== \"object\")\n return false;\n // Don't check too thoroughly, since the list of transferable things in JS might grow over time\n return true;\n}\nfunction isTransferDescriptor(thing) {\n return thing && typeof thing === \"object\" && thing[symbols_1.$transferable];\n}\nexports.isTransferDescriptor = isTransferDescriptor;\nfunction Transfer(payload, transferables) {\n if (!transferables) {\n if (!isTransferable(payload))\n throw Error();\n transferables = [payload];\n }\n return {\n [symbols_1.$transferable]: true,\n send: payload,\n transferables\n };\n}\nexports.Transfer = Transfer;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.WorkerMessageType = exports.MasterMessageType = void 0;\n/////////////////////////////\n// Messages sent by master:\nvar MasterMessageType;\n(function (MasterMessageType) {\n MasterMessageType[\"cancel\"] = \"cancel\";\n MasterMessageType[\"run\"] = \"run\";\n})(MasterMessageType = exports.MasterMessageType || (exports.MasterMessageType = {}));\n////////////////////////////\n// Messages sent by worker:\nvar WorkerMessageType;\n(function (WorkerMessageType) {\n WorkerMessageType[\"error\"] = \"error\";\n WorkerMessageType[\"init\"] = \"init\";\n WorkerMessageType[\"result\"] = \"result\";\n WorkerMessageType[\"running\"] = \"running\";\n WorkerMessageType[\"uncaughtError\"] = \"uncaughtError\";\n})(WorkerMessageType = exports.WorkerMessageType || (exports.WorkerMessageType = {}));\n","\"use strict\";\n/// <reference lib=\"dom\" />\n// tslint:disable no-shadowed-variable\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst isWorkerRuntime = function isWorkerRuntime() {\n const isWindowContext = typeof self !== \"undefined\" && typeof Window !== \"undefined\" && self instanceof Window;\n return typeof self !== \"undefined\" && self.postMessage && !isWindowContext ? true : false;\n};\nconst postMessageToMaster = function postMessageToMaster(data, transferList) {\n self.postMessage(data, transferList);\n};\nconst subscribeToMasterMessages = function subscribeToMasterMessages(onMessage) {\n const messageHandler = (messageEvent) => {\n onMessage(messageEvent.data);\n };\n const unsubscribe = () => {\n self.removeEventListener(\"message\", messageHandler);\n };\n self.addEventListener(\"message\", messageHandler);\n return unsubscribe;\n};\nexports.default = {\n isWorkerRuntime,\n postMessageToMaster,\n subscribeToMasterMessages\n};\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.expose = exports.isWorkerRuntime = exports.Transfer = exports.registerSerializer = void 0;\nconst is_observable_1 = __importDefault(require(\"is-observable\"));\nconst common_1 = require(\"../common\");\nconst transferable_1 = require(\"../transferable\");\nconst messages_1 = require(\"../types/messages\");\nconst implementation_1 = __importDefault(require(\"./implementation\"));\nvar common_2 = require(\"../common\");\nObject.defineProperty(exports, \"registerSerializer\", { enumerable: true, get: function () { return common_2.registerSerializer; } });\nvar transferable_2 = require(\"../transferable\");\nObject.defineProperty(exports, \"Transfer\", { enumerable: true, get: function () { return transferable_2.Transfer; } });\n/** Returns `true` if this code is currently running in a worker. */\nexports.isWorkerRuntime = implementation_1.default.isWorkerRuntime;\nlet exposeCalled = false;\nconst activeSubscriptions = new Map();\nconst isMasterJobCancelMessage = (thing) => thing && thing.type === messages_1.MasterMessageType.cancel;\nconst isMasterJobRunMessage = (thing) => thing && thing.type === messages_1.MasterMessageType.run;\n/**\n * There are issues with `is-observable` not recognizing zen-observable's instances.\n * We are using `observable-fns`, but it's based on zen-observable, too.\n */\nconst isObservable = (thing) => is_observable_1.default(thing) || isZenObservable(thing);\nfunction isZenObservable(thing) {\n return thing && typeof thing === \"object\" && typeof thing.subscribe === \"function\";\n}\nfunction deconstructTransfer(thing) {\n return transferable_1.isTransferDescriptor(thing)\n ? { payload: thing.send, transferables: thing.transferables }\n : { payload: thing, transferables: undefined };\n}\nfunction postFunctionInitMessage() {\n const initMessage = {\n type: messages_1.WorkerMessageType.init,\n exposed: {\n type: \"function\"\n }\n };\n implementation_1.default.postMessageToMaster(initMessage);\n}\nfunction postModuleInitMessage(methodNames) {\n const initMessage = {\n type: messages_1.WorkerMessageType.init,\n exposed: {\n type: \"module\",\n methods: methodNames\n }\n };\n implementation_1.default.postMessageToMaster(initMessage);\n}\nfunction postJobErrorMessage(uid, rawError) {\n const { payload: error, transferables } = deconstructTransfer(rawError);\n const errorMessage = {\n type: messages_1.WorkerMessageType.error,\n uid,\n error: common_1.serialize(error)\n };\n implementation_1.default.postMessageToMaster(errorMessage, transferables);\n}\nfunction postJobResultMessage(uid, completed, resultValue) {\n const { payload, transferables } = deconstructTransfer(resultValue);\n const resultMessage = {\n type: messages_1.WorkerMessageType.result,\n uid,\n complete: completed ? true : undefined,\n payload\n };\n implementation_1.default.postMessageToMaster(resultMessage, transferables);\n}\nfunction postJobStartMessage(uid, resultType) {\n const startMessage = {\n type: messages_1.WorkerMessageType.running,\n uid,\n resultType\n };\n implementation_1.default.postMessageToMaster(startMessage);\n}\nfunction postUncaughtErrorMessage(error) {\n try {\n const errorMessage = {\n type: messages_1.WorkerMessageType.uncaughtError,\n error: common_1.serialize(error)\n };\n implementation_1.default.postMessageToMaster(errorMessage);\n }\n catch (subError) {\n // tslint:disable-next-line no-console\n console.error(\"Not reporting uncaught error back to master thread as it \" +\n \"occured while reporting an uncaught error already.\" +\n \"\\nLatest error:\", subError, \"\\nOriginal error:\", error);\n }\n}\nfunction runFunction(jobUID, fn, args) {\n return __awaiter(this, void 0, void 0, function* () {\n let syncResult;\n try {\n syncResult = fn(...args);\n }\n catch (error) {\n return postJobErrorMessage(jobUID, error);\n }\n const resultType = isObservable(syncResult) ? \"observable\" : \"promise\";\n postJobStartMessage(jobUID, resultType);\n if (isObservable(syncResult)) {\n const subscription = syncResult.subscribe(value => postJobResultMessage(jobUID, false, common_1.serialize(value)), error => {\n postJobErrorMessage(jobUID, common_1.serialize(error));\n activeSubscriptions.delete(jobUID);\n }, () => {\n postJobResultMessage(jobUID, true);\n activeSubscriptions.delete(jobUID);\n });\n activeSubscriptions.set(jobUID, subscription);\n }\n else {\n try {\n const result = yield syncResult;\n postJobResultMessage(jobUID, true, common_1.serialize(result));\n }\n catch (error) {\n postJobErrorMessage(jobUID, common_1.serialize(error));\n }\n }\n });\n}\n/**\n * Expose a function or a module (an object whose values are functions)\n * to the main thread. Must be called exactly once in every worker thread\n * to signal its API to the main thread.\n *\n * @param exposed Function or object whose values are functions\n */\nfunction expose(exposed) {\n if (!implementation_1.default.isWorkerRuntime()) {\n throw Error(\"expose() called in the master thread.\");\n }\n if (exposeCalled) {\n throw Error(\"expose() called more than once. This is not possible. Pass an object to expose() if you want to expose multiple functions.\");\n }\n exposeCalled = true;\n if (typeof exposed === \"function\") {\n implementation_1.default.subscribeToMasterMessages(messageData => {\n if (isMasterJobRunMessage(messageData) && !messageData.method) {\n runFunction(messageData.uid, exposed, messageData.args.map(common_1.deserialize));\n }\n });\n postFunctionInitMessage();\n }\n else if (typeof exposed === \"object\" && exposed) {\n implementation_1.default.subscribeToMasterMessages(messageData => {\n if (isMasterJobRunMessage(messageData) && messageData.method) {\n runFunction(messageData.uid, exposed[messageData.method], messageData.args.map(common_1.deserialize));\n }\n });\n const methodNames = Object.keys(exposed).filter(key => typeof exposed[key] === \"function\");\n postModuleInitMessage(methodNames);\n }\n else {\n throw Error(`Invalid argument passed to expose(). Expected a function or an object, got: ${exposed}`);\n }\n implementation_1.default.subscribeToMasterMessages(messageData => {\n if (isMasterJobCancelMessage(messageData)) {\n const jobUID = messageData.uid;\n const subscription = activeSubscriptions.get(jobUID);\n if (subscription) {\n subscription.unsubscribe();\n activeSubscriptions.delete(jobUID);\n }\n }\n });\n}\nexports.expose = expose;\nif (typeof self !== \"undefined\" && typeof self.addEventListener === \"function\" && implementation_1.default.isWorkerRuntime()) {\n self.addEventListener(\"error\", event => {\n // Post with some delay, so the master had some time to subscribe to messages\n setTimeout(() => postUncaughtErrorMessage(event.error || event), 250);\n });\n self.addEventListener(\"unhandledrejection\", event => {\n const error = event.reason;\n if (error && typeof error.message === \"string\") {\n // Post with some delay, so the master had some time to subscribe to messages\n setTimeout(() => postUncaughtErrorMessage(error), 250);\n }\n });\n}\nif (typeof process !== \"undefined\" && typeof process.on === \"function\" && implementation_1.default.isWorkerRuntime()) {\n process.on(\"uncaughtException\", (error) => {\n // Post with some delay, so the master had some time to subscribe to messages\n setTimeout(() => postUncaughtErrorMessage(error), 250);\n });\n process.on(\"unhandledRejection\", (error) => {\n if (error && typeof error.message === \"string\") {\n // Post with some delay, so the master had some time to subscribe to messages\n setTimeout(() => postUncaughtErrorMessage(error), 250);\n }\n });\n}\n","import WorkerContext from \"./dist/worker/index.js\"\n\nexport const expose = WorkerContext.expose\nexport const registerSerializer = WorkerContext.registerSerializer\nexport const Transfer = WorkerContext.Transfer\n","module.exports = Long;\r\n\r\n/**\r\n * wasm optimizations, to do native i64 multiplication and divide\r\n */\r\nvar wasm = null;\r\n\r\ntry {\r\n wasm = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([\r\n 0, 97, 115, 109, 1, 0, 0, 0, 1, 13, 2, 96, 0, 1, 127, 96, 4, 127, 127, 127, 127, 1, 127, 3, 7, 6, 0, 1, 1, 1, 1, 1, 6, 6, 1, 127, 1, 65, 0, 11, 7, 50, 6, 3, 109, 117, 108, 0, 1, 5, 100, 105, 118, 95, 115, 0, 2, 5, 100, 105, 118, 95, 117, 0, 3, 5, 114, 101, 109, 95, 115, 0, 4, 5, 114, 101, 109, 95, 117, 0, 5, 8, 103, 101, 116, 95, 104, 105, 103, 104, 0, 0, 10, 191, 1, 6, 4, 0, 35, 0, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 126, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 127, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 128, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 129, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 130, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11\r\n ])), {}).exports;\r\n} catch (e) {\r\n // no wasm support :(\r\n}\r\n\r\n/**\r\n * Constructs a 64 bit two's-complement integer, given its low and high 32 bit values as *signed* integers.\r\n * See the from* functions below for more convenient ways of constructing Longs.\r\n * @exports Long\r\n * @class A Long class for representing a 64 bit two's-complement integer value.\r\n * @param {number} low The low (signed) 32 bits of the long\r\n * @param {number} high The high (signed) 32 bits of the long\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @constructor\r\n */\r\nfunction Long(low, high, unsigned) {\r\n\r\n /**\r\n * The low 32 bits as a signed value.\r\n * @type {number}\r\n */\r\n this.low = low | 0;\r\n\r\n /**\r\n * The high 32 bits as a signed value.\r\n * @type {number}\r\n */\r\n this.high = high | 0;\r\n\r\n /**\r\n * Whether unsigned or not.\r\n * @type {boolean}\r\n */\r\n this.unsigned = !!unsigned;\r\n}\r\n\r\n// The internal representation of a long is the two given signed, 32-bit values.\r\n// We use 32-bit pieces because these are the size of integers on which\r\n// Javascript performs bit-operations. For operations like addition and\r\n// multiplication, we split each number into 16 bit pieces, which can easily be\r\n// multiplied within Javascript's floating-point representation without overflow\r\n// or change in sign.\r\n//\r\n// In the algorithms below, we frequently reduce the negative case to the\r\n// positive case by negating the input(s) and then post-processing the result.\r\n// Note that we must ALWAYS check specially whether those values are MIN_VALUE\r\n// (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as\r\n// a positive number, it overflows back into a negative). Not handling this\r\n// case would often result in infinite recursion.\r\n//\r\n// Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the from*\r\n// methods on which they depend.\r\n\r\n/**\r\n * An indicator used to reliably determine if an object is a Long or not.\r\n * @type {boolean}\r\n * @const\r\n * @private\r\n */\r\nLong.prototype.__isLong__;\r\n\r\nObject.defineProperty(Long.prototype, \"__isLong__\", { value: true });\r\n\r\n/**\r\n * @function\r\n * @param {*} obj Object\r\n * @returns {boolean}\r\n * @inner\r\n */\r\nfunction isLong(obj) {\r\n return (obj && obj[\"__isLong__\"]) === true;\r\n}\r\n\r\n/**\r\n * Tests if the specified object is a Long.\r\n * @function\r\n * @param {*} obj Object\r\n * @returns {boolean}\r\n */\r\nLong.isLong = isLong;\r\n\r\n/**\r\n * A cache of the Long representations of small integer values.\r\n * @type {!Object}\r\n * @inner\r\n */\r\nvar INT_CACHE = {};\r\n\r\n/**\r\n * A cache of the Long representations of small unsigned integer values.\r\n * @type {!Object}\r\n * @inner\r\n */\r\nvar UINT_CACHE = {};\r\n\r\n/**\r\n * @param {number} value\r\n * @param {boolean=} unsigned\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromInt(value, unsigned) {\r\n var obj, cachedObj, cache;\r\n if (unsigned) {\r\n value >>>= 0;\r\n if (cache = (0 <= value && value < 256)) {\r\n cachedObj = UINT_CACHE[value];\r\n if (cachedObj)\r\n return cachedObj;\r\n }\r\n obj = fromBits(value, (value | 0) < 0 ? -1 : 0, true);\r\n if (cache)\r\n UINT_CACHE[value] = obj;\r\n return obj;\r\n } else {\r\n value |= 0;\r\n if (cache = (-128 <= value && value < 128)) {\r\n cachedObj = INT_CACHE[value];\r\n if (cachedObj)\r\n return cachedObj;\r\n }\r\n obj = fromBits(value, value < 0 ? -1 : 0, false);\r\n if (cache)\r\n INT_CACHE[value] = obj;\r\n return obj;\r\n }\r\n}\r\n\r\n/**\r\n * Returns a Long representing the given 32 bit integer value.\r\n * @function\r\n * @param {number} value The 32 bit integer in question\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {!Long} The corresponding Long value\r\n */\r\nLong.fromInt = fromInt;\r\n\r\n/**\r\n * @param {number} value\r\n * @param {boolean=} unsigned\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromNumber(value, unsigned) {\r\n if (isNaN(value))\r\n return unsigned ? UZERO : ZERO;\r\n if (unsigned) {\r\n if (value < 0)\r\n return UZERO;\r\n if (value >= TWO_PWR_64_DBL)\r\n return MAX_UNSIGNED_VALUE;\r\n } else {\r\n if (value <= -TWO_PWR_63_DBL)\r\n return MIN_VALUE;\r\n if (value + 1 >= TWO_PWR_63_DBL)\r\n return MAX_VALUE;\r\n }\r\n if (value < 0)\r\n return fromNumber(-value, unsigned).neg();\r\n return fromBits((value % TWO_PWR_32_DBL) | 0, (value / TWO_PWR_32_DBL) | 0, unsigned);\r\n}\r\n\r\n/**\r\n * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.\r\n * @function\r\n * @param {number} value The number in question\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {!Long} The corresponding Long value\r\n */\r\nLong.fromNumber = fromNumber;\r\n\r\n/**\r\n * @param {number} lowBits\r\n * @param {number} highBits\r\n * @param {boolean=} unsigned\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromBits(lowBits, highBits, unsigned) {\r\n return new Long(lowBits, highBits, unsigned);\r\n}\r\n\r\n/**\r\n * Returns a Long representing the 64 bit integer that comes by concatenating the given low and high bits. Each is\r\n * assumed to use 32 bits.\r\n * @function\r\n * @param {number} lowBits The low 32 bits\r\n * @param {number} highBits The high 32 bits\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {!Long} The corresponding Long value\r\n */\r\nLong.fromBits = fromBits;\r\n\r\n/**\r\n * @function\r\n * @param {number} base\r\n * @param {number} exponent\r\n * @returns {number}\r\n * @inner\r\n */\r\nvar pow_dbl = Math.pow; // Used 4 times (4*8 to 15+4)\r\n\r\n/**\r\n * @param {string} str\r\n * @param {(boolean|number)=} unsigned\r\n * @param {number=} radix\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromString(str, unsigned, radix) {\r\n if (str.length === 0)\r\n throw Error('empty string');\r\n if (str === \"NaN\" || str === \"Infinity\" || str === \"+Infinity\" || str === \"-Infinity\")\r\n return ZERO;\r\n if (typeof unsigned === 'number') {\r\n // For goog.math.long compatibility\r\n radix = unsigned,\r\n unsigned = false;\r\n } else {\r\n unsigned = !! unsigned;\r\n }\r\n radix = radix || 10;\r\n if (radix < 2 || 36 < radix)\r\n throw RangeError('radix');\r\n\r\n var p;\r\n if ((p = str.indexOf('-')) > 0)\r\n throw Error('interior hyphen');\r\n else if (p === 0) {\r\n return fromString(str.substring(1), unsigned, radix).neg();\r\n }\r\n\r\n // Do several (8) digits each time through the loop, so as to\r\n // minimize the calls to the very expensive emulated div.\r\n var radixToPower = fromNumber(pow_dbl(radix, 8));\r\n\r\n var result = ZERO;\r\n for (var i = 0; i < str.length; i += 8) {\r\n var size = Math.min(8, str.length - i),\r\n value = parseInt(str.substring(i, i + size), radix);\r\n if (size < 8) {\r\n var power = fromNumber(pow_dbl(radix, size));\r\n result = result.mul(power).add(fromNumber(value));\r\n } else {\r\n result = result.mul(radixToPower);\r\n result = result.add(fromNumber(value));\r\n }\r\n }\r\n result.unsigned = unsigned;\r\n return result;\r\n}\r\n\r\n/**\r\n * Returns a Long representation of the given string, written using the specified radix.\r\n * @function\r\n * @param {string} str The textual representation of the Long\r\n * @param {(boolean|number)=} unsigned Whether unsigned or not, defaults to signed\r\n * @param {number=} radix The radix in which the text is written (2-36), defaults to 10\r\n * @returns {!Long} The corresponding Long value\r\n */\r\nLong.fromString = fromString;\r\n\r\n/**\r\n * @function\r\n * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val\r\n * @param {boolean=} unsigned\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromValue(val, unsigned) {\r\n if (typeof val === 'number')\r\n return fromNumber(val, unsigned);\r\n if (typeof val === 'string')\r\n return fromString(val, unsigned);\r\n // Throws for non-objects, converts non-instanceof Long:\r\n return fromBits(val.low, val.high, typeof unsigned === 'boolean' ? unsigned : val.unsigned);\r\n}\r\n\r\n/**\r\n * Converts the specified value to a Long using the appropriate from* function for its type.\r\n * @function\r\n * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val Value\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {!Long}\r\n */\r\nLong.fromValue = fromValue;\r\n\r\n// NOTE: the compiler should inline these constant values below and then remove these variables, so there should be\r\n// no runtime penalty for these.\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_16_DBL = 1 << 16;\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_24_DBL = 1 << 24;\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_32_DBL = TWO_PWR_16_DBL * TWO_PWR_16_DBL;\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_64_DBL = TWO_PWR_32_DBL * TWO_PWR_32_DBL;\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_63_DBL = TWO_PWR_64_DBL / 2;\r\n\r\n/**\r\n * @type {!Long}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_24 = fromInt(TWO_PWR_24_DBL);\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar ZERO = fromInt(0);\r\n\r\n/**\r\n * Signed zero.\r\n * @type {!Long}\r\n */\r\nLong.ZERO = ZERO;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar UZERO = fromInt(0, true);\r\n\r\n/**\r\n * Unsigned zero.\r\n * @type {!Long}\r\n */\r\nLong.UZERO = UZERO;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar ONE = fromInt(1);\r\n\r\n/**\r\n * Signed one.\r\n * @type {!Long}\r\n */\r\nLong.ONE = ONE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar UONE = fromInt(1, true);\r\n\r\n/**\r\n * Unsigned one.\r\n * @type {!Long}\r\n */\r\nLong.UONE = UONE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar NEG_ONE = fromInt(-1);\r\n\r\n/**\r\n * Signed negative one.\r\n * @type {!Long}\r\n */\r\nLong.NEG_ONE = NEG_ONE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar MAX_VALUE = fromBits(0xFFFFFFFF|0, 0x7FFFFFFF|0, false);\r\n\r\n/**\r\n * Maximum signed value.\r\n * @type {!Long}\r\n */\r\nLong.MAX_VALUE = MAX_VALUE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar MAX_UNSIGNED_VALUE = fromBits(0xFFFFFFFF|0, 0xFFFFFFFF|0, true);\r\n\r\n/**\r\n * Maximum unsigned value.\r\n * @type {!Long}\r\n */\r\nLong.MAX_UNSIGNED_VALUE = MAX_UNSIGNED_VALUE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar MIN_VALUE = fromBits(0, 0x80000000|0, false);\r\n\r\n/**\r\n * Minimum signed value.\r\n * @type {!Long}\r\n */\r\nLong.MIN_VALUE = MIN_VALUE;\r\n\r\n/**\r\n * @alias Long.prototype\r\n * @inner\r\n */\r\nvar LongPrototype = Long.prototype;\r\n\r\n/**\r\n * Converts the Long to a 32 bit integer, assuming it is a 32 bit integer.\r\n * @returns {number}\r\n */\r\nLongPrototype.toInt = function toInt() {\r\n return this.unsigned ? this.low >>> 0 : this.low;\r\n};\r\n\r\n/**\r\n * Converts the Long to a the nearest floating-point representation of this value (double, 53 bit mantissa).\r\n * @returns {number}\r\n */\r\nLongPrototype.toNumber = function toNumber() {\r\n if (this.unsigned)\r\n return ((this.high >>> 0) * TWO_PWR_32_DBL) + (this.low >>> 0);\r\n return this.high * TWO_PWR_32_DBL + (this.low >>> 0);\r\n};\r\n\r\n/**\r\n * Converts the Long to a string written in the specified radix.\r\n * @param {number=} radix Radix (2-36), defaults to 10\r\n * @returns {string}\r\n * @override\r\n * @throws {RangeError} If `radix` is out of range\r\n */\r\nLongPrototype.toString = function toString(radix) {\r\n radix = radix || 10;\r\n if (radix < 2 || 36 < radix)\r\n throw RangeError('radix');\r\n if (this.isZero())\r\n return '0';\r\n if (this.isNegative()) { // Unsigned Longs are never negative\r\n if (this.eq(MIN_VALUE)) {\r\n // We need to change the Long value before it can be negated, so we remove\r\n // the bottom-most digit in this base and then recurse to do the rest.\r\n var radixLong = fromNumber(radix),\r\n div = this.div(radixLong),\r\n rem1 = div.mul(radixLong).sub(this);\r\n return div.toString(radix) + rem1.toInt().toString(radix);\r\n } else\r\n return '-' + this.neg().toString(radix);\r\n }\r\n\r\n // Do several (6) digits each time through the loop, so as to\r\n // minimize the calls to the very expensive emulated div.\r\n var radixToPower = fromNumber(pow_dbl(radix, 6), this.unsigned),\r\n rem = this;\r\n var result = '';\r\n while (true) {\r\n var remDiv = rem.div(radixToPower),\r\n intval = rem.sub(remDiv.mul(radixToPower)).toInt() >>> 0,\r\n digits = intval.toString(radix);\r\n rem = remDiv;\r\n if (rem.isZero())\r\n return digits + result;\r\n else {\r\n while (digits.length < 6)\r\n digits = '0' + digits;\r\n result = '' + digits + result;\r\n }\r\n }\r\n};\r\n\r\n/**\r\n * Gets the high 32 bits as a signed integer.\r\n * @returns {number} Signed high bits\r\n */\r\nLongPrototype.getHighBits = function getHighBits() {\r\n return this.high;\r\n};\r\n\r\n/**\r\n * Gets the high 32 bits as an unsigned integer.\r\n * @returns {number} Unsigned high bits\r\n */\r\nLongPrototype.getHighBitsUnsigned = function getHighBitsUnsigned() {\r\n return this.high >>> 0;\r\n};\r\n\r\n/**\r\n * Gets the low 32 bits as a signed integer.\r\n * @returns {number} Signed low bits\r\n */\r\nLongPrototype.getLowBits = function getLowBits() {\r\n return this.low;\r\n};\r\n\r\n/**\r\n * Gets the low 32 bits as an unsigned integer.\r\n * @returns {number} Unsigned low bits\r\n */\r\nLongPrototype.getLowBitsUnsigned = function getLowBitsUnsigned() {\r\n return this.low >>> 0;\r\n};\r\n\r\n/**\r\n * Gets the number of bits needed to represent the absolute value of this Long.\r\n * @returns {number}\r\n */\r\nLongPrototype.getNumBitsAbs = function getNumBitsAbs() {\r\n if (this.isNegative()) // Unsigned Longs are never negative\r\n return this.eq(MIN_VALUE) ? 64 : this.neg().getNumBitsAbs();\r\n var val = this.high != 0 ? this.high : this.low;\r\n for (var bit = 31; bit > 0; bit--)\r\n if ((val & (1 << bit)) != 0)\r\n break;\r\n return this.high != 0 ? bit + 33 : bit + 1;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value equals zero.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isZero = function isZero() {\r\n return this.high === 0 && this.low === 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value equals zero. This is an alias of {@link Long#isZero}.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.eqz = LongPrototype.isZero;\r\n\r\n/**\r\n * Tests if this Long's value is negative.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isNegative = function isNegative() {\r\n return !this.unsigned && this.high < 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is positive.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isPositive = function isPositive() {\r\n return this.unsigned || this.high >= 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is odd.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isOdd = function isOdd() {\r\n return (this.low & 1) === 1;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is even.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isEven = function isEven() {\r\n return (this.low & 1) === 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value equals the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.equals = function equals(other) {\r\n if (!isLong(other))\r\n other = fromValue(other);\r\n if (this.unsigned !== other.unsigned && (this.high >>> 31) === 1 && (other.high >>> 31) === 1)\r\n return false;\r\n return this.high === other.high && this.low === other.low;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value equals the specified's. This is an alias of {@link Long#equals}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.eq = LongPrototype.equals;\r\n\r\n/**\r\n * Tests if this Long's value differs from the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.notEquals = function notEquals(other) {\r\n return !this.eq(/* validates */ other);\r\n};\r\n\r\n/**\r\n * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.neq = LongPrototype.notEquals;\r\n\r\n/**\r\n * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.ne = LongPrototype.notEquals;\r\n\r\n/**\r\n * Tests if this Long's value is less than the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.lessThan = function lessThan(other) {\r\n return this.comp(/* validates */ other) < 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is less than the specified's. This is an alias of {@link Long#lessThan}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.lt = LongPrototype.lessThan;\r\n\r\n/**\r\n * Tests if this Long's value is less than or equal the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.lessThanOrEqual = function lessThanOrEqual(other) {\r\n return this.comp(/* validates */ other) <= 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.lte = LongPrototype.lessThanOrEqual;\r\n\r\n/**\r\n * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.le = LongPrototype.lessThanOrEqual;\r\n\r\n/**\r\n * Tests if this Long's value is greater than the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.greaterThan = function greaterThan(other) {\r\n return this.comp(/* validates */ other) > 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is greater than the specified's. This is an alias of {@link Long#greaterThan}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.gt = LongPrototype.greaterThan;\r\n\r\n/**\r\n * Tests if this Long's value is greater than or equal the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.greaterThanOrEqual = function greaterThanOrEqual(other) {\r\n return this.comp(/* validates */ other) >= 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.gte = LongPrototype.greaterThanOrEqual;\r\n\r\n/**\r\n * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.ge = LongPrototype.greaterThanOrEqual;\r\n\r\n/**\r\n * Compares this Long's value with the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {number} 0 if they are the same, 1 if the this is greater and -1\r\n * if the given one is greater\r\n */\r\nLongPrototype.compare = function compare(other) {\r\n if (!isLong(other))\r\n other = fromValue(other);\r\n if (this.eq(other))\r\n return 0;\r\n var thisNeg = this.isNegative(),\r\n otherNeg = other.isNegative();\r\n if (thisNeg && !otherNeg)\r\n return -1;\r\n if (!thisNeg && otherNeg)\r\n return 1;\r\n // At this point the sign bits are the same\r\n if (!this.unsigned)\r\n return this.sub(other).isNegative() ? -1 : 1;\r\n // Both are positive if at least one is unsigned\r\n return (other.high >>> 0) > (this.high >>> 0) || (other.high === this.high && (other.low >>> 0) > (this.low >>> 0)) ? -1 : 1;\r\n};\r\n\r\n/**\r\n * Compares this Long's value with the specified's. This is an alias of {@link Long#compare}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {number} 0 if they are the same, 1 if the this is greater and -1\r\n * if the given one is greater\r\n */\r\nLongPrototype.comp = LongPrototype.compare;\r\n\r\n/**\r\n * Negates this Long's value.\r\n * @returns {!Long} Negated Long\r\n */\r\nLongPrototype.negate = function negate() {\r\n if (!this.unsigned && this.eq(MIN_VALUE))\r\n return MIN_VALUE;\r\n return this.not().add(ONE);\r\n};\r\n\r\n/**\r\n * Negates this Long's value. This is an alias of {@link Long#negate}.\r\n * @function\r\n * @returns {!Long} Negated Long\r\n */\r\nLongPrototype.neg = LongPrototype.negate;\r\n\r\n/**\r\n * Returns the sum of this and the specified Long.\r\n * @param {!Long|number|string} addend Addend\r\n * @returns {!Long} Sum\r\n */\r\nLongPrototype.add = function add(addend) {\r\n if (!isLong(addend))\r\n addend = fromValue(addend);\r\n\r\n // Divide each number into 4 chunks of 16 bits, and then sum the chunks.\r\n\r\n var a48 = this.high >>> 16;\r\n var a32 = this.high & 0xFFFF;\r\n var a16 = this.low >>> 16;\r\n var a00 = this.low & 0xFFFF;\r\n\r\n var b48 = addend.high >>> 16;\r\n var b32 = addend.high & 0xFFFF;\r\n var b16 = addend.low >>> 16;\r\n var b00 = addend.low & 0xFFFF;\r\n\r\n var c48 = 0, c32 = 0, c16 = 0, c00 = 0;\r\n c00 += a00 + b00;\r\n c16 += c00 >>> 16;\r\n c00 &= 0xFFFF;\r\n c16 += a16 + b16;\r\n c32 += c16 >>> 16;\r\n c16 &= 0xFFFF;\r\n c32 += a32 + b32;\r\n c48 += c32 >>> 16;\r\n c32 &= 0xFFFF;\r\n c48 += a48 + b48;\r\n c48 &= 0xFFFF;\r\n return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the difference of this and the specified Long.\r\n * @param {!Long|number|string} subtrahend Subtrahend\r\n * @returns {!Long} Difference\r\n */\r\nLongPrototype.subtract = function subtract(subtrahend) {\r\n if (!isLong(subtrahend))\r\n subtrahend = fromValue(subtrahend);\r\n return this.add(subtrahend.neg());\r\n};\r\n\r\n/**\r\n * Returns the difference of this and the specified Long. This is an alias of {@link Long#subtract}.\r\n * @function\r\n * @param {!Long|number|string} subtrahend Subtrahend\r\n * @returns {!Long} Difference\r\n */\r\nLongPrototype.sub = LongPrototype.subtract;\r\n\r\n/**\r\n * Returns the product of this and the specified Long.\r\n * @param {!Long|number|string} multiplier Multiplier\r\n * @returns {!Long} Product\r\n */\r\nLongPrototype.multiply = function multiply(multiplier) {\r\n if (this.isZero())\r\n return ZERO;\r\n if (!isLong(multiplier))\r\n multiplier = fromValue(multiplier);\r\n\r\n // use wasm support if present\r\n if (wasm) {\r\n var low = wasm.mul(this.low,\r\n this.high,\r\n multiplier.low,\r\n multiplier.high);\r\n return fromBits(low, wasm.get_high(), this.unsigned);\r\n }\r\n\r\n if (multiplier.isZero())\r\n return ZERO;\r\n if (this.eq(MIN_VALUE))\r\n return multiplier.isOdd() ? MIN_VALUE : ZERO;\r\n if (multiplier.eq(MIN_VALUE))\r\n return this.isOdd() ? MIN_VALUE : ZERO;\r\n\r\n if (this.isNegative()) {\r\n if (multiplier.isNegative())\r\n return this.neg().mul(multiplier.neg());\r\n else\r\n return this.neg().mul(multiplier).neg();\r\n } else if (multiplier.isNegative())\r\n return this.mul(multiplier.neg()).neg();\r\n\r\n // If both longs are small, use float multiplication\r\n if (this.lt(TWO_PWR_24) && multiplier.lt(TWO_PWR_24))\r\n return fromNumber(this.toNumber() * multiplier.toNumber(), this.unsigned);\r\n\r\n // Divide each long into 4 chunks of 16 bits, and then add up 4x4 products.\r\n // We can skip products that would overflow.\r\n\r\n var a48 = this.high >>> 16;\r\n var a32 = this.high & 0xFFFF;\r\n var a16 = this.low >>> 16;\r\n var a00 = this.low & 0xFFFF;\r\n\r\n var b48 = multiplier.high >>> 16;\r\n var b32 = multiplier.high & 0xFFFF;\r\n var b16 = multiplier.low >>> 16;\r\n var b00 = multiplier.low & 0xFFFF;\r\n\r\n var c48 = 0, c32 = 0, c16 = 0, c00 = 0;\r\n c00 += a00 * b00;\r\n c16 += c00 >>> 16;\r\n c00 &= 0xFFFF;\r\n c16 += a16 * b00;\r\n c32 += c16 >>> 16;\r\n c16 &= 0xFFFF;\r\n c16 += a00 * b16;\r\n c32 += c16 >>> 16;\r\n c16 &= 0xFFFF;\r\n c32 += a32 * b00;\r\n c48 += c32 >>> 16;\r\n c32 &= 0xFFFF;\r\n c32 += a16 * b16;\r\n c48 += c32 >>> 16;\r\n c32 &= 0xFFFF;\r\n c32 += a00 * b32;\r\n c48 += c32 >>> 16;\r\n c32 &= 0xFFFF;\r\n c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;\r\n c48 &= 0xFFFF;\r\n return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the product of this and the specified Long. This is an alias of {@link Long#multiply}.\r\n * @function\r\n * @param {!Long|number|string} multiplier Multiplier\r\n * @returns {!Long} Product\r\n */\r\nLongPrototype.mul = LongPrototype.multiply;\r\n\r\n/**\r\n * Returns this Long divided by the specified. The result is signed if this Long is signed or\r\n * unsigned if this Long is unsigned.\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Quotient\r\n */\r\nLongPrototype.divide = function divide(divisor) {\r\n if (!isLong(divisor))\r\n divisor = fromValue(divisor);\r\n if (divisor.isZero())\r\n throw Error('division by zero');\r\n\r\n // use wasm support if present\r\n if (wasm) {\r\n // guard against signed division overflow: the largest\r\n // negative number / -1 would be 1 larger than the largest\r\n // positive number, due to two's complement.\r\n if (!this.unsigned &&\r\n this.high === -0x80000000 &&\r\n divisor.low === -1 && divisor.high === -1) {\r\n // be consistent with non-wasm code path\r\n return this;\r\n }\r\n var low = (this.unsigned ? wasm.div_u : wasm.div_s)(\r\n this.low,\r\n this.high,\r\n divisor.low,\r\n divisor.high\r\n );\r\n return fromBits(low, wasm.get_high(), this.unsigned);\r\n }\r\n\r\n if (this.isZero())\r\n return this.unsigned ? UZERO : ZERO;\r\n var approx, rem, res;\r\n if (!this.unsigned) {\r\n // This section is only relevant for signed longs and is derived from the\r\n // closure library as a whole.\r\n if (this.eq(MIN_VALUE)) {\r\n if (divisor.eq(ONE) || divisor.eq(NEG_ONE))\r\n return MIN_VALUE; // recall that -MIN_VALUE == MIN_VALUE\r\n else if (divisor.eq(MIN_VALUE))\r\n return ONE;\r\n else {\r\n // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.\r\n var halfThis = this.shr(1);\r\n approx = halfThis.div(divisor).shl(1);\r\n if (approx.eq(ZERO)) {\r\n return divisor.isNegative() ? ONE : NEG_ONE;\r\n } else {\r\n rem = this.sub(divisor.mul(approx));\r\n res = approx.add(rem.div(divisor));\r\n return res;\r\n }\r\n }\r\n } else if (divisor.eq(MIN_VALUE))\r\n return this.unsigned ? UZERO : ZERO;\r\n if (this.isNegative()) {\r\n if (divisor.isNegative())\r\n return this.neg().div(divisor.neg());\r\n return this.neg().div(divisor).neg();\r\n } else if (divisor.isNegative())\r\n return this.div(divisor.neg()).neg();\r\n res = ZERO;\r\n } else {\r\n // The algorithm below has not been made for unsigned longs. It's therefore\r\n // required to take special care of the MSB prior to running it.\r\n if (!divisor.unsigned)\r\n divisor = divisor.toUnsigned();\r\n if (divisor.gt(this))\r\n return UZERO;\r\n if (divisor.gt(this.shru(1))) // 15 >>> 1 = 7 ; with divisor = 8 ; true\r\n return UONE;\r\n res = UZERO;\r\n }\r\n\r\n // Repeat the following until the remainder is less than other: find a\r\n // floating-point that approximates remainder / other *from below*, add this\r\n // into the result, and subtract it from the remainder. It is critical that\r\n // the approximate value is less than or equal to the real value so that the\r\n // remainder never becomes negative.\r\n rem = this;\r\n while (rem.gte(divisor)) {\r\n // Approximate the result of division. This may be a little greater or\r\n // smaller than the actual value.\r\n approx = Math.max(1, Math.floor(rem.toNumber() / divisor.toNumber()));\r\n\r\n // We will tweak the approximate result by changing it in the 48-th digit or\r\n // the smallest non-fractional digit, whichever is larger.\r\n var log2 = Math.ceil(Math.log(approx) / Math.LN2),\r\n delta = (log2 <= 48) ? 1 : pow_dbl(2, log2 - 48),\r\n\r\n // Decrease the approximation until it is smaller than the remainder. Note\r\n // that if it is too large, the product overflows and is negative.\r\n approxRes = fromNumber(approx),\r\n approxRem = approxRes.mul(divisor);\r\n while (approxRem.isNegative() || approxRem.gt(rem)) {\r\n approx -= delta;\r\n approxRes = fromNumber(approx, this.unsigned);\r\n approxRem = approxRes.mul(divisor);\r\n }\r\n\r\n // We know the answer can't be zero... and actually, zero would cause\r\n // infinite recursion since we would make no progress.\r\n if (approxRes.isZero())\r\n approxRes = ONE;\r\n\r\n res = res.add(approxRes);\r\n rem = rem.sub(approxRem);\r\n }\r\n return res;\r\n};\r\n\r\n/**\r\n * Returns this Long divided by the specified. This is an alias of {@link Long#divide}.\r\n * @function\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Quotient\r\n */\r\nLongPrototype.div = LongPrototype.divide;\r\n\r\n/**\r\n * Returns this Long modulo the specified.\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Remainder\r\n */\r\nLongPrototype.modulo = function modulo(divisor) {\r\n if (!isLong(divisor))\r\n divisor = fromValue(divisor);\r\n\r\n // use wasm support if present\r\n if (wasm) {\r\n var low = (this.unsigned ? wasm.rem_u : wasm.rem_s)(\r\n this.low,\r\n this.high,\r\n divisor.low,\r\n divisor.high\r\n );\r\n return fromBits(low, wasm.get_high(), this.unsigned);\r\n }\r\n\r\n return this.sub(this.div(divisor).mul(divisor));\r\n};\r\n\r\n/**\r\n * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.\r\n * @function\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Remainder\r\n */\r\nLongPrototype.mod = LongPrototype.modulo;\r\n\r\n/**\r\n * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.\r\n * @function\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Remainder\r\n */\r\nLongPrototype.rem = LongPrototype.modulo;\r\n\r\n/**\r\n * Returns the bitwise NOT of this Long.\r\n * @returns {!Long}\r\n */\r\nLongPrototype.not = function not() {\r\n return fromBits(~this.low, ~this.high, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the bitwise AND of this Long and the specified.\r\n * @param {!Long|number|string} other Other Long\r\n * @returns {!Long}\r\n */\r\nLongPrototype.and = function and(other) {\r\n if (!isLong(other))\r\n other = fromValue(other);\r\n return fromBits(this.low & other.low, this.high & other.high, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the bitwise OR of this Long and the specified.\r\n * @param {!Long|number|string} other Other Long\r\n * @returns {!Long}\r\n */\r\nLongPrototype.or = function or(other) {\r\n if (!isLong(other))\r\n other = fromValue(other);\r\n return fromBits(this.low | other.low, this.high | other.high, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the bitwise XOR of this Long and the given one.\r\n * @param {!Long|number|string} other Other Long\r\n * @returns {!Long}\r\n */\r\nLongPrototype.xor = function xor(other) {\r\n if (!isLong(other))\r\n other = fromValue(other);\r\n return fromBits(this.low ^ other.low, this.high ^ other.high, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns this Long with bits shifted to the left by the given amount.\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shiftLeft = function shiftLeft(numBits) {\r\n if (isLong(numBits))\r\n numBits = numBits.toInt();\r\n if ((numBits &= 63) === 0)\r\n return this;\r\n else if (numBits < 32)\r\n return fromBits(this.low << numBits, (this.high << numBits) | (this.low >>> (32 - numBits)), this.unsigned);\r\n else\r\n return fromBits(0, this.low << (numBits - 32), this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns this Long with bits shifted to the left by the given amount. This is an alias of {@link Long#shiftLeft}.\r\n * @function\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shl = LongPrototype.shiftLeft;\r\n\r\n/**\r\n * Returns this Long with bits arithmetically shifted to the right by the given amount.\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shiftRight = function shiftRight(numBits) {\r\n if (isLong(numBits))\r\n numBits = numBits.toInt();\r\n if ((numBits &= 63) === 0)\r\n return this;\r\n else if (numBits < 32)\r\n return fromBits((this.low >>> numBits) | (this.high << (32 - numBits)), this.high >> numBits, this.unsigned);\r\n else\r\n return fromBits(this.high >> (numBits - 32), this.high >= 0 ? 0 : -1, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns this Long with bits arithmetically shifted to the right by the given amount. This is an alias of {@link Long#shiftRight}.\r\n * @function\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shr = LongPrototype.shiftRight;\r\n\r\n/**\r\n * Returns this Long with bits logically shifted to the right by the given amount.\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shiftRightUnsigned = function shiftRightUnsigned(numBits) {\r\n if (isLong(numBits))\r\n numBits = numBits.toInt();\r\n numBits &= 63;\r\n if (numBits === 0)\r\n return this;\r\n else {\r\n var high = this.high;\r\n if (numBits < 32) {\r\n var low = this.low;\r\n return fromBits((low >>> numBits) | (high << (32 - numBits)), high >>> numBits, this.unsigned);\r\n } else if (numBits === 32)\r\n return fromBits(high, 0, this.unsigned);\r\n else\r\n return fromBits(high >>> (numBits - 32), 0, this.unsigned);\r\n }\r\n};\r\n\r\n/**\r\n * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.\r\n * @function\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shru = LongPrototype.shiftRightUnsigned;\r\n\r\n/**\r\n * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.\r\n * @function\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shr_u = LongPrototype.shiftRightUnsigned;\r\n\r\n/**\r\n * Converts this Long to signed.\r\n * @returns {!Long} Signed long\r\n */\r\nLongPrototype.toSigned = function toSigned() {\r\n if (!this.unsigned)\r\n return this;\r\n return fromBits(this.low, this.high, false);\r\n};\r\n\r\n/**\r\n * Converts this Long to unsigned.\r\n * @returns {!Long} Unsigned long\r\n */\r\nLongPrototype.toUnsigned = function toUnsigned() {\r\n if (this.unsigned)\r\n return this;\r\n return fromBits(this.low, this.high, true);\r\n};\r\n\r\n/**\r\n * Converts this Long to its byte representation.\r\n * @param {boolean=} le Whether little or big endian, defaults to big endian\r\n * @returns {!Array.<number>} Byte representation\r\n */\r\nLongPrototype.toBytes = function toBytes(le) {\r\n return le ? this.toBytesLE() : this.toBytesBE();\r\n};\r\n\r\n/**\r\n * Converts this Long to its little endian byte representation.\r\n * @returns {!Array.<number>} Little endian byte representation\r\n */\r\nLongPrototype.toBytesLE = function toBytesLE() {\r\n var hi = this.high,\r\n lo = this.low;\r\n return [\r\n lo & 0xff,\r\n lo >>> 8 & 0xff,\r\n lo >>> 16 & 0xff,\r\n lo >>> 24 ,\r\n hi & 0xff,\r\n hi >>> 8 & 0xff,\r\n hi >>> 16 & 0xff,\r\n hi >>> 24\r\n ];\r\n};\r\n\r\n/**\r\n * Converts this Long to its big endian byte representation.\r\n * @returns {!Array.<number>} Big endian byte representation\r\n */\r\nLongPrototype.toBytesBE = function toBytesBE() {\r\n var hi = this.high,\r\n lo = this.low;\r\n return [\r\n hi >>> 24 ,\r\n hi >>> 16 & 0xff,\r\n hi >>> 8 & 0xff,\r\n hi & 0xff,\r\n lo >>> 24 ,\r\n lo >>> 16 & 0xff,\r\n lo >>> 8 & 0xff,\r\n lo & 0xff\r\n ];\r\n};\r\n\r\n/**\r\n * Creates a Long from its byte representation.\r\n * @param {!Array.<number>} bytes Byte representation\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @param {boolean=} le Whether little or big endian, defaults to big endian\r\n * @returns {Long} The corresponding Long value\r\n */\r\nLong.fromBytes = function fromBytes(bytes, unsigned, le) {\r\n return le ? Long.fromBytesLE(bytes, unsigned) : Long.fromBytesBE(bytes, unsigned);\r\n};\r\n\r\n/**\r\n * Creates a Long from its little endian byte representation.\r\n * @param {!Array.<number>} bytes Little endian byte representation\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {Long} The corresponding Long value\r\n */\r\nLong.fromBytesLE = function fromBytesLE(bytes, unsigned) {\r\n return new Long(\r\n bytes[0] |\r\n bytes[1] << 8 |\r\n bytes[2] << 16 |\r\n bytes[3] << 24,\r\n bytes[4] |\r\n bytes[5] << 8 |\r\n bytes[6] << 16 |\r\n bytes[7] << 24,\r\n unsigned\r\n );\r\n};\r\n\r\n/**\r\n * Creates a Long from its big endian byte representation.\r\n * @param {!Array.<number>} bytes Big endian byte representation\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {Long} The corresponding Long value\r\n */\r\nLong.fromBytesBE = function fromBytesBE(bytes, unsigned) {\r\n return new Long(\r\n bytes[4] << 24 |\r\n bytes[5] << 16 |\r\n bytes[6] << 8 |\r\n bytes[7],\r\n bytes[0] << 24 |\r\n bytes[1] << 16 |\r\n bytes[2] << 8 |\r\n bytes[3],\r\n unsigned\r\n );\r\n};\r\n","export default class VirtualOffset {\n constructor(blockPosition, dataPosition) {\n this.blockPosition = blockPosition; // < offset of the compressed data block\n this.dataPosition = dataPosition; // < offset into the uncompressed data\n }\n toString() {\n return `${this.blockPosition}:${this.dataPosition}`;\n }\n compareTo(b) {\n return (this.blockPosition - b.blockPosition || this.dataPosition - b.dataPosition);\n }\n static min(...args) {\n let min;\n let i = 0;\n for (; !min; i += 1) {\n min = args[i];\n }\n for (; i < args.length; i += 1) {\n if (min.compareTo(args[i]) > 0) {\n min = args[i];\n }\n }\n return min;\n }\n}\nexport function fromBytes(bytes, offset = 0, bigendian = false) {\n if (bigendian) {\n throw new Error('big-endian virtual file offsets not implemented');\n }\n return new VirtualOffset(bytes[offset + 7] * 0x10000000000 +\n bytes[offset + 6] * 0x100000000 +\n bytes[offset + 5] * 0x1000000 +\n bytes[offset + 4] * 0x10000 +\n bytes[offset + 3] * 0x100 +\n bytes[offset + 2], (bytes[offset + 1] << 8) | bytes[offset]);\n}\n//# sourceMappingURL=virtualOffset.js.map","// little class representing a chunk in the index\nexport default class Chunk {\n /**\n * @param {VirtualOffset} minv\n * @param {VirtualOffset} maxv\n * @param {number} bin\n * @param {number} [fetchedSize]\n */\n constructor(minv, maxv, bin, fetchedSize = undefined) {\n this.minv = minv;\n this.maxv = maxv;\n this.bin = bin;\n this._fetchedSize = fetchedSize;\n }\n toUniqueString() {\n return `${this.minv}..${this.maxv} (bin ${this.bin}, fetchedSize ${this.fetchedSize()})`;\n }\n toString() {\n return this.toUniqueString();\n }\n compareTo(b) {\n return (this.minv.compareTo(b.minv) ||\n this.maxv.compareTo(b.maxv) ||\n this.bin - b.bin);\n }\n fetchedSize() {\n if (this._fetchedSize !== undefined) {\n return this._fetchedSize;\n }\n return this.maxv.blockPosition + (1 << 16) - this.minv.blockPosition;\n }\n}\n//# sourceMappingURL=chunk.js.map","export default class IndexFile {\n /**\n * @param {filehandle} filehandle\n * @param {function} [renameRefSeqs]\n */\n constructor({ filehandle, renameRefSeq = (n) => n, }) {\n this.filehandle = filehandle;\n this.renameRefSeq = renameRefSeq;\n }\n _findFirstData(data, virtualOffset) {\n const currentFdl = data.firstDataLine;\n if (currentFdl) {\n data.firstDataLine =\n currentFdl.compareTo(virtualOffset) > 0 ? virtualOffset : currentFdl;\n }\n else {\n data.firstDataLine = virtualOffset;\n }\n }\n async parse(opts = {}) {\n if (!this.setupP) {\n this.setupP = this._parse(opts).catch(e => {\n this.setupP = undefined;\n throw e;\n });\n }\n return this.setupP;\n }\n async hasRefSeq(seqId, opts = {}) {\n return !!((await this.parse(opts)).indices[seqId] || {}).binIndex;\n }\n}\n//# sourceMappingURL=indexFile.js.map","export function timeout(ms) {\n return new Promise(resolve => setTimeout(resolve, ms));\n}\nexport function longToNumber(long) {\n if (long.greaterThan(Number.MAX_SAFE_INTEGER) ||\n long.lessThan(Number.MIN_SAFE_INTEGER)) {\n throw new Error('integer overflow');\n }\n return long.toNumber();\n}\n/**\n * Properly check if the given AbortSignal is aborted.\n * Per the standard, if the signal reads as aborted,\n * this function throws either a DOMException AbortError, or a regular error\n * with a `code` attribute set to `ERR_ABORTED`.\n *\n * For convenience, passing `undefined` is a no-op\n *\n * @param {AbortSignal} [signal] an AbortSignal, or anything with an `aborted` attribute\n * @returns nothing\n */\nexport function checkAbortSignal(signal) {\n if (!signal) {\n return;\n }\n if (signal.aborted) {\n // console.log('bam aborted!')\n if (typeof DOMException !== 'undefined') {\n throw new DOMException('aborted', 'AbortError');\n }\n else {\n const e = new Error('aborted');\n //@ts-ignore\n e.code = 'ERR_ABORTED';\n throw e;\n }\n }\n}\n/**\n * Skips to the next tick, then runs `checkAbortSignal`.\n * Await this to inside an otherwise synchronous loop to\n * provide a place to break when an abort signal is received.\n * @param {AbortSignal} signal\n */\nexport async function abortBreakPoint(signal) {\n await Promise.resolve();\n checkAbortSignal(signal);\n}\nexport function canMergeBlocks(chunk1, chunk2) {\n return (chunk2.minv.blockPosition - chunk1.maxv.blockPosition < 65000 &&\n chunk2.maxv.blockPosition - chunk1.minv.blockPosition < 5000000);\n}\nexport function makeOpts(obj = {}) {\n return 'aborted' in obj ? { signal: obj } : obj;\n}\nexport function optimizeChunks(chunks, lowest) {\n const mergedChunks = [];\n let lastChunk = null;\n if (chunks.length === 0) {\n return chunks;\n }\n chunks.sort((c0, c1) => {\n const dif = c0.minv.blockPosition - c1.minv.blockPosition;\n if (dif !== 0) {\n return dif;\n }\n else {\n return c0.minv.dataPosition - c1.minv.dataPosition;\n }\n });\n chunks.forEach(chunk => {\n if (!lowest || chunk.maxv.compareTo(lowest) > 0) {\n if (lastChunk === null) {\n mergedChunks.push(chunk);\n lastChunk = chunk;\n }\n else {\n if (canMergeBlocks(lastChunk, chunk)) {\n if (chunk.maxv.compareTo(lastChunk.maxv) > 0) {\n lastChunk.maxv = chunk.maxv;\n }\n }\n else {\n mergedChunks.push(chunk);\n lastChunk = chunk;\n }\n }\n }\n });\n return mergedChunks;\n}\n//# sourceMappingURL=util.js.map","import Long from 'long';\nimport { fromBytes } from './virtualOffset';\nimport Chunk from './chunk';\nimport IndexFile from './indexFile';\nimport { longToNumber, optimizeChunks } from './util';\nconst BAI_MAGIC = 21578050; // BAI\\1\nfunction roundDown(n, multiple) {\n return n - (n % multiple);\n}\nfunction roundUp(n, multiple) {\n return n - (n % multiple) + multiple;\n}\nexport default class BAI extends IndexFile {\n parsePseudoBin(bytes, offset) {\n const lineCount = longToNumber(Long.fromBytesLE(Array.prototype.slice.call(bytes, offset + 16, offset + 24), true));\n return { lineCount };\n }\n async lineCount(refId, opts = {}) {\n const prom = await this.parse(opts);\n const index = prom.indices[refId];\n if (!index) {\n return -1;\n }\n const ret = index.stats || {};\n return ret.lineCount === undefined ? -1 : ret.lineCount;\n }\n fetchBai(opts = {}) {\n if (!this.baiP) {\n this.baiP = this.filehandle.readFile(opts).catch(e => {\n this.baiP = undefined;\n throw e;\n });\n }\n return this.baiP;\n }\n // fetch and parse the index\n async _parse() {\n const data = { bai: true, maxBlockSize: 1 << 16 };\n const bytes = await this.fetchBai();\n // check BAI magic numbers\n if (bytes.readUInt32LE(0) !== BAI_MAGIC) {\n throw new Error('Not a BAI file');\n }\n data.refCount = bytes.readInt32LE(4);\n const depth = 5;\n const binLimit = ((1 << ((depth + 1) * 3)) - 1) / 7;\n // read the indexes for each reference sequence\n data.indices = new Array(data.refCount);\n let currOffset = 8;\n for (let i = 0; i < data.refCount; i += 1) {\n // the binning index\n const binCount = bytes.readInt32LE(currOffset);\n let stats;\n currOffset += 4;\n const binIndex = {};\n for (let j = 0; j < binCount; j += 1) {\n const bin = bytes.readUInt32LE(currOffset);\n currOffset += 4;\n if (bin === binLimit + 1) {\n currOffset += 4;\n stats = this.parsePseudoBin(bytes, currOffset);\n currOffset += 32;\n }\n else if (bin > binLimit + 1) {\n throw new Error('bai index contains too many bins, please use CSI');\n }\n else {\n const chunkCount = bytes.readInt32LE(currOffset);\n currOffset += 4;\n const chunks = new Array(chunkCount);\n for (let k = 0; k < chunkCount; k += 1) {\n const u = fromBytes(bytes, currOffset);\n const v = fromBytes(bytes, currOffset + 8);\n currOffset += 16;\n this._findFirstData(data, u);\n chunks[k] = new Chunk(u, v, bin);\n }\n binIndex[bin] = chunks;\n }\n }\n const linearCount = bytes.readInt32LE(currOffset);\n currOffset += 4;\n // as we're going through the linear index, figure out\n // the smallest virtual offset in the indexes, which\n // tells us where the BAM header ends\n const linearIndex = new Array(linearCount);\n for (let k = 0; k < linearCount; k += 1) {\n linearIndex[k] = fromBytes(bytes, currOffset);\n currOffset += 8;\n this._findFirstData(data, linearIndex[k]);\n }\n data.indices[i] = { binIndex, linearIndex, stats };\n }\n return data;\n }\n async indexCov(seqId, start, end, opts = {}) {\n const v = 16384;\n const range = start !== undefined;\n const indexData = await this.parse(opts);\n const seqIdx = indexData.indices[seqId];\n if (!seqIdx) {\n return [];\n }\n const { linearIndex = [], stats } = seqIdx;\n if (!linearIndex.length) {\n return [];\n }\n const e = end !== undefined ? roundUp(end, v) : (linearIndex.length - 1) * v;\n const s = start !== undefined ? roundDown(start, v) : 0;\n let depths;\n if (range) {\n depths = new Array((e - s) / v);\n }\n else {\n depths = new Array(linearIndex.length - 1);\n }\n const totalSize = linearIndex[linearIndex.length - 1].blockPosition;\n if (e > (linearIndex.length - 1) * v) {\n throw new Error('query outside of range of linear index');\n }\n let currentPos = linearIndex[s / v].blockPosition;\n for (let i = s / v, j = 0; i < e / v; i++, j++) {\n depths[j] = {\n score: linearIndex[i + 1].blockPosition - currentPos,\n start: i * v,\n end: i * v + v,\n };\n currentPos = linearIndex[i + 1].blockPosition;\n }\n return depths.map(d => {\n return { ...d, score: (d.score * stats.lineCount) / totalSize };\n });\n }\n /**\n * calculate the list of bins that may overlap with region [beg,end) (zero-based half-open)\n * @returns {Array[number]}\n */\n reg2bins(beg, end) {\n end -= 1;\n return [\n [0, 0],\n [1 + (beg >> 26), 1 + (end >> 26)],\n [9 + (beg >> 23), 9 + (end >> 23)],\n [73 + (beg >> 20), 73 + (end >> 20)],\n [585 + (beg >> 17), 585 + (end >> 17)],\n [4681 + (beg >> 14), 4681 + (end >> 14)],\n ];\n }\n async blocksForRange(refId, min, max, opts = {}) {\n if (min < 0) {\n min = 0;\n }\n const indexData = await this.parse(opts);\n if (!indexData) {\n return [];\n }\n const ba = indexData.indices[refId];\n if (!ba) {\n return [];\n }\n // List of bin #s that overlap min, max\n const overlappingBins = this.reg2bins(min, max);\n const chunks = [];\n // Find chunks in overlapping bins. Leaf bins (< 4681) are not pruned\n for (const [start, end] of overlappingBins) {\n for (let bin = start; bin <= end; bin++) {\n if (ba.binIndex[bin]) {\n const binChunks = ba.binIndex[bin];\n for (let c = 0; c < binChunks.length; ++c) {\n chunks.push(new Chunk(binChunks[c].minv, binChunks[c].maxv, bin));\n }\n }\n }\n }\n // Use the linear index to find minimum file position of chunks that could\n // contain alignments in the region\n const nintv = ba.linearIndex.length;\n let lowest = null;\n const minLin = Math.min(min >> 14, nintv - 1);\n const maxLin = Math.min(max >> 14, nintv - 1);\n for (let i = minLin; i <= maxLin; ++i) {\n const vp = ba.linearIndex[i];\n if (vp) {\n if (!lowest || vp.compareTo(lowest) < 0) {\n lowest = vp;\n }\n }\n }\n return optimizeChunks(chunks, lowest);\n }\n}\n//# sourceMappingURL=bai.js.map","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n lookup[i] = code[i]\n revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n var len = b64.length\n\n if (len % 4 > 0) {\n throw new Error('Invalid string. Length must be a multiple of 4')\n }\n\n // Trim off extra bytes after placeholder bytes are found\n // See: https://github.com/beatgammit/base64-js/issues/42\n var validLen = b64.indexOf('=')\n if (validLen === -1) validLen = len\n\n var placeHoldersLen = validLen === len\n ? 0\n : 4 - (validLen % 4)\n\n return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n var tmp\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n\n var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n var curByte = 0\n\n // if there are placeholders, only get up to the last complete 4 chars\n var len = placeHoldersLen > 0\n ? validLen - 4\n : validLen\n\n var i\n for (i = 0; i < len; i += 4) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 18) |\n (revLookup[b64.charCodeAt(i + 1)] << 12) |\n (revLookup[b64.charCodeAt(i + 2)] << 6) |\n revLookup[b64.charCodeAt(i + 3)]\n arr[curByte++] = (tmp >> 16) & 0xFF\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 2) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 2) |\n (revLookup[b64.charCodeAt(i + 1)] >> 4)\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 1) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 10) |\n (revLookup[b64.charCodeAt(i + 1)] << 4) |\n (revLookup[b64.charCodeAt(i + 2)] >> 2)\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n return arr\n}\n\nfunction tripletToBase64 (num) {\n return lookup[num >> 18 & 0x3F] +\n lookup[num >> 12 & 0x3F] +\n lookup[num >> 6 & 0x3F] +\n lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n var tmp\n var output = []\n for (var i = start; i < end; i += 3) {\n tmp =\n ((uint8[i] << 16) & 0xFF0000) +\n ((uint8[i + 1] << 8) & 0xFF00) +\n (uint8[i + 2] & 0xFF)\n output.push(tripletToBase64(tmp))\n }\n return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n var tmp\n var len = uint8.length\n var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n var parts = []\n var maxChunkLength = 16383 // must be multiple of 3\n\n // go through the array every three bytes, we'll deal with trailing stuff later\n for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n }\n\n // pad the end with zeros, but make sure to not forget the extra bytes\n if (extraBytes === 1) {\n tmp = uint8[len - 1]\n parts.push(\n lookup[tmp >> 2] +\n lookup[(tmp << 4) & 0x3F] +\n '=='\n )\n } else if (extraBytes === 2) {\n tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n parts.push(\n lookup[tmp >> 10] +\n lookup[(tmp >> 4) & 0x3F] +\n lookup[(tmp << 2) & 0x3F] +\n '='\n )\n }\n\n return parts.join('')\n}\n","/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n var e, m\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var nBits = -7\n var i = isLE ? (nBytes - 1) : 0\n var d = isLE ? -1 : 1\n var s = buffer[offset + i]\n\n i += d\n\n e = s & ((1 << (-nBits)) - 1)\n s >>= (-nBits)\n nBits += eLen\n for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n m = e & ((1 << (-nBits)) - 1)\n e >>= (-nBits)\n nBits += mLen\n for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n if (e === 0) {\n e = 1 - eBias\n } else if (e === eMax) {\n return m ? NaN : ((s ? -1 : 1) * Infinity)\n } else {\n m = m + Math.pow(2, mLen)\n e = e - eBias\n }\n return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n var e, m, c\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n var i = isLE ? 0 : (nBytes - 1)\n var d = isLE ? 1 : -1\n var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n value = Math.abs(value)\n\n if (isNaN(value) || value === Infinity) {\n m = isNaN(value) ? 1 : 0\n e = eMax\n } else {\n e = Math.floor(Math.log(value) / Math.LN2)\n if (value * (c = Math.pow(2, -e)) < 1) {\n e--\n c *= 2\n }\n if (e + eBias >= 1) {\n value += rt / c\n } else {\n value += rt * Math.pow(2, 1 - eBias)\n }\n if (value * c >= 2) {\n e++\n c /= 2\n }\n\n if (e + eBias >= eMax) {\n m = 0\n e = eMax\n } else if (e + eBias >= 1) {\n m = ((value * c) - 1) * Math.pow(2, mLen)\n e = e + eBias\n } else {\n m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n e = 0\n }\n }\n\n for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n e = (e << mLen) | m\n eLen += mLen\n for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n buffer[offset + i - d] |= s * 128\n}\n","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh <https://feross.org>\n * @license MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nconst base64 = require('base64-js')\nconst ieee754 = require('ieee754')\nconst customInspectSymbol =\n (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nconst K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n * === true Use Uint8Array implementation (fastest)\n * === false Print warning and recommend using `buffer` v4.x which has an Object\n * implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n typeof console.error === 'function') {\n console.error(\n 'This browser lacks typed array (Uint8Array) support which is required by ' +\n '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n )\n}\n\nfunction typedArraySupport () {\n // Can typed array instances can be augmented?\n try {\n const arr = new Uint8Array(1)\n const proto = { foo: function () { return 42 } }\n Object.setPrototypeOf(proto, Uint8Array.prototype)\n Object.setPrototypeOf(arr, proto)\n return arr.foo() === 42\n } catch (e) {\n return false\n }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.buffer\n }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.byteOffset\n }\n})\n\nfunction createBuffer (length) {\n if (length > K_MAX_LENGTH) {\n throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n }\n // Return an augmented `Uint8Array` instance\n const buf = new Uint8Array(length)\n Object.setPrototypeOf(buf, Buffer.prototype)\n return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new TypeError(\n 'The \"string\" argument must be of type string. Received type number'\n )\n }\n return allocUnsafe(arg)\n }\n return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n if (typeof value === 'string') {\n return fromString(value, encodingOrOffset)\n }\n\n if (ArrayBuffer.isView(value)) {\n return fromArrayView(value)\n }\n\n if (value == null) {\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n }\n\n if (isInstance(value, ArrayBuffer) ||\n (value && isInstance(value.buffer, ArrayBuffer))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof SharedArrayBuffer !== 'undefined' &&\n (isInstance(value, SharedArrayBuffer) ||\n (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof value === 'number') {\n throw new TypeError(\n 'The \"value\" argument must not be of type number. Received type number'\n )\n }\n\n const valueOf = value.valueOf && value.valueOf()\n if (valueOf != null && valueOf !== value) {\n return Buffer.from(valueOf, encodingOrOffset, length)\n }\n\n const b = fromObject(value)\n if (b) return b\n\n if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n typeof value[Symbol.toPrimitive] === 'function') {\n return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n }\n\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be of type number')\n } else if (size < 0) {\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n }\n}\n\nfunction alloc (size, fill, encoding) {\n assertSize(size)\n if (size <= 0) {\n return createBuffer(size)\n }\n if (fill !== undefined) {\n // Only pay attention to encoding if it's a string. This\n // prevents accidentally sending in a number that would\n // be interpreted as a start offset.\n return typeof encoding === 'string'\n ? createBuffer(size).fill(fill, encoding)\n : createBuffer(size).fill(fill)\n }\n return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n assertSize(size)\n return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n if (typeof encoding !== 'string' || encoding === '') {\n encoding = 'utf8'\n }\n\n if (!Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n\n const length = byteLength(string, encoding) | 0\n let buf = createBuffer(length)\n\n const actual = buf.write(string, encoding)\n\n if (actual !== length) {\n // Writing a hex string, for example, that contains invalid characters will\n // cause everything after the first invalid character to be ignored. (e.g.\n // 'abxxcd' will be treated as 'ab')\n buf = buf.slice(0, actual)\n }\n\n return buf\n}\n\nfunction fromArrayLike (array) {\n const length = array.length < 0 ? 0 : checked(array.length) | 0\n const buf = createBuffer(length)\n for (let i = 0; i < length; i += 1) {\n buf[i] = array[i] & 255\n }\n return buf\n}\n\nfunction fromArrayView (arrayView) {\n if (isInstance(arrayView, Uint8Array)) {\n const copy = new Uint8Array(arrayView)\n return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n }\n return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\"offset\" is outside of buffer bounds')\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\"length\" is outside of buffer bounds')\n }\n\n let buf\n if (byteOffset === undefined && length === undefined) {\n buf = new Uint8Array(array)\n } else if (length === undefined) {\n buf = new Uint8Array(array, byteOffset)\n } else {\n buf = new Uint8Array(array, byteOffset, length)\n }\n\n // Return an augmented `Uint8Array` instance\n Object.setPrototypeOf(buf, Buffer.prototype)\n\n return buf\n}\n\nfunction fromObject (obj) {\n if (Buffer.isBuffer(obj)) {\n const len = checked(obj.length) | 0\n const buf = createBuffer(len)\n\n if (buf.length === 0) {\n return buf\n }\n\n obj.copy(buf, 0, 0, len)\n return buf\n }\n\n if (obj.length !== undefined) {\n if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n return createBuffer(0)\n }\n return fromArrayLike(obj)\n }\n\n if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n return fromArrayLike(obj.data)\n }\n}\n\nfunction checked (length) {\n // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= K_MAX_LENGTH) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n }\n return length | 0\n}\n\nfunction SlowBuffer (length) {\n if (+length != length) { // eslint-disable-line eqeqeq\n length = 0\n }\n return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n return b != null && b._isBuffer === true &&\n b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n throw new TypeError(\n 'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n )\n }\n\n if (a === b) return 0\n\n let x = a.length\n let y = b.length\n\n for (let i = 0, len = Math.min(x, y); i < len; ++i) {\n if (a[i] !== b[i]) {\n x = a[i]\n y = b[i]\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n switch (String(encoding).toLowerCase()) {\n case 'hex':\n case 'utf8':\n case 'utf-8':\n case 'ascii':\n case 'latin1':\n case 'binary':\n case 'base64':\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return true\n default:\n return false\n }\n}\n\nBuffer.concat = function concat (list, length) {\n if (!Array.isArray(list)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n }\n\n if (list.length === 0) {\n return Buffer.alloc(0)\n }\n\n let i\n if (length === undefined) {\n length = 0\n for (i = 0; i < list.length; ++i) {\n length += list[i].length\n }\n }\n\n const buffer = Buffer.allocUnsafe(length)\n let pos = 0\n for (i = 0; i < list.length; ++i) {\n let buf = list[i]\n if (isInstance(buf, Uint8Array)) {\n if (pos + buf.length > buffer.length) {\n if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n buf.copy(buffer, pos)\n } else {\n Uint8Array.prototype.set.call(\n buffer,\n buf,\n pos\n )\n }\n } else if (!Buffer.isBuffer(buf)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n } else {\n buf.copy(buffer, pos)\n }\n pos += buf.length\n }\n return buffer\n}\n\nfunction byteLength (string, encoding) {\n if (Buffer.isBuffer(string)) {\n return string.length\n }\n if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n return string.byteLength\n }\n if (typeof string !== 'string') {\n throw new TypeError(\n 'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n 'Received type ' + typeof string\n )\n }\n\n const len = string.length\n const mustMatch = (arguments.length > 2 && arguments[2] === true)\n if (!mustMatch && len === 0) return 0\n\n // Use a for loop to avoid recursion\n let loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'ascii':\n case 'latin1':\n case 'binary':\n return len\n case 'utf8':\n case 'utf-8':\n return utf8ToBytes(string).length\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return len * 2\n case 'hex':\n return len >>> 1\n case 'base64':\n return base64ToBytes(string).length\n default:\n if (loweredCase) {\n return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n }\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n let loweredCase = false\n\n // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n // property of a typed array.\n\n // This behaves neither like String nor Uint8Array in that we set start/end\n // to their upper/lower bounds if the value passed is out of range.\n // undefined is handled specially as per ECMA-262 6th Edition,\n // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n if (start === undefined || start < 0) {\n start = 0\n }\n // Return early if start > this.length. Done here to prevent potential uint32\n // coercion fail below.\n if (start > this.length) {\n return ''\n }\n\n if (end === undefined || end > this.length) {\n end = this.length\n }\n\n if (end <= 0) {\n return ''\n }\n\n // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n end >>>= 0\n start >>>= 0\n\n if (end <= start) {\n return ''\n }\n\n if (!encoding) encoding = 'utf8'\n\n while (true) {\n switch (encoding) {\n case 'hex':\n return hexSlice(this, start, end)\n\n case 'utf8':\n case 'utf-8':\n return utf8Slice(this, start, end)\n\n case 'ascii':\n return asciiSlice(this, start, end)\n\n case 'latin1':\n case 'binary':\n return latin1Slice(this, start, end)\n\n case 'base64':\n return base64Slice(this, start, end)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return utf16leSlice(this, start, end)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = (encoding + '').toLowerCase()\n loweredCase = true\n }\n }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n const i = b[n]\n b[n] = b[m]\n b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n const len = this.length\n if (len % 2 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 16-bits')\n }\n for (let i = 0; i < len; i += 2) {\n swap(this, i, i + 1)\n }\n return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n const len = this.length\n if (len % 4 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 32-bits')\n }\n for (let i = 0; i < len; i += 4) {\n swap(this, i, i + 3)\n swap(this, i + 1, i + 2)\n }\n return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n const len = this.length\n if (len % 8 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 64-bits')\n }\n for (let i = 0; i < len; i += 8) {\n swap(this, i, i + 7)\n swap(this, i + 1, i + 6)\n swap(this, i + 2, i + 5)\n swap(this, i + 3, i + 4)\n }\n return this\n}\n\nBuffer.prototype.toString = function toString () {\n const length = this.length\n if (length === 0) return ''\n if (arguments.length === 0) return utf8Slice(this, 0, length)\n return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString\n\nBuffer.prototype.equals = function equals (b) {\n if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n if (this === b) return true\n return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n let str = ''\n const max = exports.INSPECT_MAX_BYTES\n str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n if (this.length > max) str += ' ... '\n return '<Buffer ' + str + '>'\n}\nif (customInspectSymbol) {\n Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n if (isInstance(target, Uint8Array)) {\n target = Buffer.from(target, target.offset, target.byteLength)\n }\n if (!Buffer.isBuffer(target)) {\n throw new TypeError(\n 'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n 'Received type ' + (typeof target)\n )\n }\n\n if (start === undefined) {\n start = 0\n }\n if (end === undefined) {\n end = target ? target.length : 0\n }\n if (thisStart === undefined) {\n thisStart = 0\n }\n if (thisEnd === undefined) {\n thisEnd = this.length\n }\n\n if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n throw new RangeError('out of range index')\n }\n\n if (thisStart >= thisEnd && start >= end) {\n return 0\n }\n if (thisStart >= thisEnd) {\n return -1\n }\n if (start >= end) {\n return 1\n }\n\n start >>>= 0\n end >>>= 0\n thisStart >>>= 0\n thisEnd >>>= 0\n\n if (this === target) return 0\n\n let x = thisEnd - thisStart\n let y = end - start\n const len = Math.min(x, y)\n\n const thisCopy = this.slice(thisStart, thisEnd)\n const targetCopy = target.slice(start, end)\n\n for (let i = 0; i < len; ++i) {\n if (thisCopy[i] !== targetCopy[i]) {\n x = thisCopy[i]\n y = targetCopy[i]\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n // Empty buffer means no match\n if (buffer.length === 0) return -1\n\n // Normalize byteOffset\n if (typeof byteOffset === 'string') {\n encoding = byteOffset\n byteOffset = 0\n } else if (byteOffset > 0x7fffffff) {\n byteOffset = 0x7fffffff\n } else if (byteOffset < -0x80000000) {\n byteOffset = -0x80000000\n }\n byteOffset = +byteOffset // Coerce to Number.\n if (numberIsNaN(byteOffset)) {\n // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n byteOffset = dir ? 0 : (buffer.length - 1)\n }\n\n // Normalize byteOffset: negative offsets start from the end of the buffer\n if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n if (byteOffset >= buffer.length) {\n if (dir) return -1\n else byteOffset = buffer.length - 1\n } else if (byteOffset < 0) {\n if (dir) byteOffset = 0\n else return -1\n }\n\n // Normalize val\n if (typeof val === 'string') {\n val = Buffer.from(val, encoding)\n }\n\n // Finally, search either indexOf (if dir is true) or lastIndexOf\n if (Buffer.isBuffer(val)) {\n // Special case: looking for empty string/buffer always fails\n if (val.length === 0) {\n return -1\n }\n return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n } else if (typeof val === 'number') {\n val = val & 0xFF // Search for a byte value [0-255]\n if (typeof Uint8Array.prototype.indexOf === 'function') {\n if (dir) {\n return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n } else {\n return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n }\n }\n return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n }\n\n throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n let indexSize = 1\n let arrLength = arr.length\n let valLength = val.length\n\n if (encoding !== undefined) {\n encoding = String(encoding).toLowerCase()\n if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n encoding === 'utf16le' || encoding === 'utf-16le') {\n if (arr.length < 2 || val.length < 2) {\n return -1\n }\n indexSize = 2\n arrLength /= 2\n valLength /= 2\n byteOffset /= 2\n }\n }\n\n function read (buf, i) {\n if (indexSize === 1) {\n return buf[i]\n } else {\n return buf.readUInt16BE(i * indexSize)\n }\n }\n\n let i\n if (dir) {\n let foundIndex = -1\n for (i = byteOffset; i < arrLength; i++) {\n if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n if (foundIndex === -1) foundIndex = i\n if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n } else {\n if (foundIndex !== -1) i -= i - foundIndex\n foundIndex = -1\n }\n }\n } else {\n if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n for (i = byteOffset; i >= 0; i--) {\n let found = true\n for (let j = 0; j < valLength; j++) {\n if (read(arr, i + j) !== read(val, j)) {\n found = false\n break\n }\n }\n if (found) return i\n }\n }\n\n return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n offset = Number(offset) || 0\n const remaining = buf.length - offset\n if (!length) {\n length = remaining\n } else {\n length = Number(length)\n if (length > remaining) {\n length = remaining\n }\n }\n\n const strLen = string.length\n\n if (length > strLen / 2) {\n length = strLen / 2\n }\n let i\n for (i = 0; i < length; ++i) {\n const parsed = parseInt(string.substr(i * 2, 2), 16)\n if (numberIsNaN(parsed)) return i\n buf[offset + i] = parsed\n }\n return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n // Buffer#write(string)\n if (offset === undefined) {\n encoding = 'utf8'\n length = this.length\n offset = 0\n // Buffer#write(string, encoding)\n } else if (length === undefined && typeof offset === 'string') {\n encoding = offset\n length = this.length\n offset = 0\n // Buffer#write(string, offset[, length][, encoding])\n } else if (isFinite(offset)) {\n offset = offset >>> 0\n if (isFinite(length)) {\n length = length >>> 0\n if (encoding === undefined) encoding = 'utf8'\n } else {\n encoding = length\n length = undefined\n }\n } else {\n throw new Error(\n 'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n )\n }\n\n const remaining = this.length - offset\n if (length === undefined || length > remaining) length = remaining\n\n if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n throw new RangeError('Attempt to write outside buffer bounds')\n }\n\n if (!encoding) encoding = 'utf8'\n\n let loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'hex':\n return hexWrite(this, string, offset, length)\n\n case 'utf8':\n case 'utf-8':\n return utf8Write(this, string, offset, length)\n\n case 'ascii':\n case 'latin1':\n case 'binary':\n return asciiWrite(this, string, offset, length)\n\n case 'base64':\n // Warning: maxLength not taken into account in base64Write\n return base64Write(this, string, offset, length)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return ucs2Write(this, string, offset, length)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n return {\n type: 'Buffer',\n data: Array.prototype.slice.call(this._arr || this, 0)\n }\n}\n\nfunction base64Slice (buf, start, end) {\n if (start === 0 && end === buf.length) {\n return base64.fromByteArray(buf)\n } else {\n return base64.fromByteArray(buf.slice(start, end))\n }\n}\n\nfunction utf8Slice (buf, start, end) {\n end = Math.min(buf.length, end)\n const res = []\n\n let i = start\n while (i < end) {\n const firstByte = buf[i]\n let codePoint = null\n let bytesPerSequence = (firstByte > 0xEF)\n ? 4\n : (firstByte > 0xDF)\n ? 3\n : (firstByte > 0xBF)\n ? 2\n : 1\n\n if (i + bytesPerSequence <= end) {\n let secondByte, thirdByte, fourthByte, tempCodePoint\n\n switch (bytesPerSequence) {\n case 1:\n if (firstByte < 0x80) {\n codePoint = firstByte\n }\n break\n case 2:\n secondByte = buf[i + 1]\n if ((secondByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n if (tempCodePoint > 0x7F) {\n codePoint = tempCodePoint\n }\n }\n break\n case 3:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n codePoint = tempCodePoint\n }\n }\n break\n case 4:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n fourthByte = buf[i + 3]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n codePoint = tempCodePoint\n }\n }\n }\n }\n\n if (codePoint === null) {\n // we did not generate a valid codePoint so insert a\n // replacement char (U+FFFD) and advance only 1 byte\n codePoint = 0xFFFD\n bytesPerSequence = 1\n } else if (codePoint > 0xFFFF) {\n // encode to utf16 (surrogate pair dance)\n codePoint -= 0x10000\n res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n codePoint = 0xDC00 | codePoint & 0x3FF\n }\n\n res.push(codePoint)\n i += bytesPerSequence\n }\n\n return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nconst MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n const len = codePoints.length\n if (len <= MAX_ARGUMENTS_LENGTH) {\n return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n }\n\n // Decode in chunks to avoid \"call stack size exceeded\".\n let res = ''\n let i = 0\n while (i < len) {\n res += String.fromCharCode.apply(\n String,\n codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n )\n }\n return res\n}\n\nfunction asciiSlice (buf, start, end) {\n let ret = ''\n end = Math.min(buf.length, end)\n\n for (let i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i] & 0x7F)\n }\n return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n let ret = ''\n end = Math.min(buf.length, end)\n\n for (let i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i])\n }\n return ret\n}\n\nfunction hexSlice (buf, start, end) {\n const len = buf.length\n\n if (!start || start < 0) start = 0\n if (!end || end < 0 || end > len) end = len\n\n let out = ''\n for (let i = start; i < end; ++i) {\n out += hexSliceLookupTable[buf[i]]\n }\n return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n const bytes = buf.slice(start, end)\n let res = ''\n // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n for (let i = 0; i < bytes.length - 1; i += 2) {\n res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n }\n return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n const len = this.length\n start = ~~start\n end = end === undefined ? len : ~~end\n\n if (start < 0) {\n start += len\n if (start < 0) start = 0\n } else if (start > len) {\n start = len\n }\n\n if (end < 0) {\n end += len\n if (end < 0) end = 0\n } else if (end > len) {\n end = len\n }\n\n if (end < start) end = start\n\n const newBuf = this.subarray(start, end)\n // Return an augmented `Uint8Array` instance\n Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUintLE =\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let val = this[offset]\n let mul = 1\n let i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n checkOffset(offset, byteLength, this.length)\n }\n\n let val = this[offset + --byteLength]\n let mul = 1\n while (byteLength > 0 && (mul *= 0x100)) {\n val += this[offset + --byteLength] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 1, this.length)\n return this[offset]\n}\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return ((this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16)) +\n (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] * 0x1000000) +\n ((this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n this[offset + 3])\n}\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const lo = first +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 24\n\n const hi = this[++offset] +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n last * 2 ** 24\n\n return BigInt(lo) + (BigInt(hi) << BigInt(32))\n})\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const hi = first * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n this[++offset]\n\n const lo = this[++offset] * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n last\n\n return (BigInt(hi) << BigInt(32)) + BigInt(lo)\n})\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let val = this[offset]\n let mul = 1\n let i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let i = byteLength\n let mul = 1\n let val = this[offset + --i]\n while (i > 0 && (mul *= 0x100)) {\n val += this[offset + --i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 1, this.length)\n if (!(this[offset] & 0x80)) return (this[offset])\n return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n const val = this[offset] | (this[offset + 1] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n const val = this[offset + 1] | (this[offset] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16) |\n (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] << 24) |\n (this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n (this[offset + 3])\n}\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const val = this[offset + 4] +\n this[offset + 5] * 2 ** 8 +\n this[offset + 6] * 2 ** 16 +\n (last << 24) // Overflow\n\n return (BigInt(val) << BigInt(32)) +\n BigInt(first +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 24)\n})\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const val = (first << 24) + // Overflow\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n this[++offset]\n\n return (BigInt(val) << BigInt(32)) +\n BigInt(this[++offset] * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n last)\n})\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 8, this.length)\n return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 8, this.length)\n return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUintLE =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n const maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n let mul = 1\n let i = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n const maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n let i = byteLength - 1\n let mul = 1\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUint8 =\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n this[offset] = (value & 0xff)\n return offset + 1\n}\n\nBuffer.prototype.writeUint16LE =\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n return offset + 2\n}\n\nBuffer.prototype.writeUint16BE =\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n return offset + 2\n}\n\nBuffer.prototype.writeUint32LE =\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n this[offset + 3] = (value >>> 24)\n this[offset + 2] = (value >>> 16)\n this[offset + 1] = (value >>> 8)\n this[offset] = (value & 0xff)\n return offset + 4\n}\n\nBuffer.prototype.writeUint32BE =\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n return offset + 4\n}\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n checkIntBI(value, min, max, buf, offset, 7)\n\n let lo = Number(value & BigInt(0xffffffff))\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n checkIntBI(value, min, max, buf, offset, 7)\n\n let lo = Number(value & BigInt(0xffffffff))\n buf[offset + 7] = lo\n lo = lo >> 8\n buf[offset + 6] = lo\n lo = lo >> 8\n buf[offset + 5] = lo\n lo = lo >> 8\n buf[offset + 4] = lo\n let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n buf[offset + 3] = hi\n hi = hi >> 8\n buf[offset + 2] = hi\n hi = hi >> 8\n buf[offset + 1] = hi\n hi = hi >> 8\n buf[offset] = hi\n return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n const limit = Math.pow(2, (8 * byteLength) - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n let i = 0\n let mul = 1\n let sub = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n sub = 1\n }\n this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n const limit = Math.pow(2, (8 * byteLength) - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n let i = byteLength - 1\n let mul = 1\n let sub = 0\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n sub = 1\n }\n this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n if (value < 0) value = 0xff + value + 1\n this[offset] = (value & 0xff)\n return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n this[offset + 2] = (value >>> 16)\n this[offset + 3] = (value >>> 24)\n return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n if (value < 0) value = 0xffffffff + value + 1\n this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n return offset + 4\n}\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n }\n ieee754.write(buf, value, offset, littleEndian, 23, 4)\n return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n }\n ieee754.write(buf, value, offset, littleEndian, 52, 8)\n return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n if (!start) start = 0\n if (!end && end !== 0) end = this.length\n if (targetStart >= target.length) targetStart = target.length\n if (!targetStart) targetStart = 0\n if (end > 0 && end < start) end = start\n\n // Copy 0 bytes; we're done\n if (end === start) return 0\n if (target.length === 0 || this.length === 0) return 0\n\n // Fatal error conditions\n if (targetStart < 0) {\n throw new RangeError('targetStart out of bounds')\n }\n if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n // Are we oob?\n if (end > this.length) end = this.length\n if (target.length - targetStart < end - start) {\n end = target.length - targetStart + start\n }\n\n const len = end - start\n\n if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n // Use built-in when available, missing from IE11\n this.copyWithin(targetStart, start, end)\n } else {\n Uint8Array.prototype.set.call(\n target,\n this.subarray(start, end),\n targetStart\n )\n }\n\n return len\n}\n\n// Usage:\n// buffer.fill(number[, offset[, end]])\n// buffer.fill(buffer[, offset[, end]])\n// buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n // Handle string cases:\n if (typeof val === 'string') {\n if (typeof start === 'string') {\n encoding = start\n start = 0\n end = this.length\n } else if (typeof end === 'string') {\n encoding = end\n end = this.length\n }\n if (encoding !== undefined && typeof encoding !== 'string') {\n throw new TypeError('encoding must be a string')\n }\n if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n if (val.length === 1) {\n const code = val.charCodeAt(0)\n if ((encoding === 'utf8' && code < 128) ||\n encoding === 'latin1') {\n // Fast path: If `val` fits into a single byte, use that numeric value.\n val = code\n }\n }\n } else if (typeof val === 'number') {\n val = val & 255\n } else if (typeof val === 'boolean') {\n val = Number(val)\n }\n\n // Invalid ranges are not set to a default, so can range check early.\n if (start < 0 || this.length < start || this.length < end) {\n throw new RangeError('Out of range index')\n }\n\n if (end <= start) {\n return this\n }\n\n start = start >>> 0\n end = end === undefined ? this.length : end >>> 0\n\n if (!val) val = 0\n\n let i\n if (typeof val === 'number') {\n for (i = start; i < end; ++i) {\n this[i] = val\n }\n } else {\n const bytes = Buffer.isBuffer(val)\n ? val\n : Buffer.from(val, encoding)\n const len = bytes.length\n if (len === 0) {\n throw new TypeError('The value \"' + val +\n '\" is invalid for argument \"value\"')\n }\n for (i = 0; i < end - start; ++i) {\n this[i + start] = bytes[i % len]\n }\n }\n\n return this\n}\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {}\nfunction E (sym, getMessage, Base) {\n errors[sym] = class NodeError extends Base {\n constructor () {\n super()\n\n Object.defineProperty(this, 'message', {\n value: getMessage.apply(this, arguments),\n writable: true,\n configurable: true\n })\n\n // Add the error code to the name to include it in the stack trace.\n this.name = `${this.name} [${sym}]`\n // Access the stack to generate the error message including the error code\n // from the name.\n this.stack // eslint-disable-line no-unused-expressions\n // Reset the name to the actual name.\n delete this.name\n }\n\n get code () {\n return sym\n }\n\n set code (value) {\n Object.defineProperty(this, 'code', {\n configurable: true,\n enumerable: true,\n value,\n writable: true\n })\n }\n\n toString () {\n return `${this.name} [${sym}]: ${this.message}`\n }\n }\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n function (name) {\n if (name) {\n return `${name} is outside of buffer bounds`\n }\n\n return 'Attempt to access memory outside buffer bounds'\n }, RangeError)\nE('ERR_INVALID_ARG_TYPE',\n function (name, actual) {\n return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n }, TypeError)\nE('ERR_OUT_OF_RANGE',\n function (str, range, input) {\n let msg = `The value of \"${str}\" is out of range.`\n let received = input\n if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n received = addNumericalSeparator(String(input))\n } else if (typeof input === 'bigint') {\n received = String(input)\n if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n received = addNumericalSeparator(received)\n }\n received += 'n'\n }\n msg += ` It must be ${range}. Received ${received}`\n return msg\n }, RangeError)\n\nfunction addNumericalSeparator (val) {\n let res = ''\n let i = val.length\n const start = val[0] === '-' ? 1 : 0\n for (; i >= start + 4; i -= 3) {\n res = `_${val.slice(i - 3, i)}${res}`\n }\n return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n validateNumber(offset, 'offset')\n if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n boundsError(offset, buf.length - (byteLength + 1))\n }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n if (value > max || value < min) {\n const n = typeof min === 'bigint' ? 'n' : ''\n let range\n if (byteLength > 3) {\n if (min === 0 || min === BigInt(0)) {\n range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`\n } else {\n range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n `${(byteLength + 1) * 8 - 1}${n}`\n }\n } else {\n range = `>= ${min}${n} and <= ${max}${n}`\n }\n throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n }\n checkBounds(buf, offset, byteLength)\n}\n\nfunction validateNumber (value, name) {\n if (typeof value !== 'number') {\n throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n }\n}\n\nfunction boundsError (value, length, type) {\n if (Math.floor(value) !== value) {\n validateNumber(value, type)\n throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n }\n\n if (length < 0) {\n throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n }\n\n throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n `>= ${type ? 1 : 0} and <= ${length}`,\n value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n // Node takes equal signs as end of the Base64 encoding\n str = str.split('=')[0]\n // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n str = str.trim().replace(INVALID_BASE64_RE, '')\n // Node converts strings with length < 2 to ''\n if (str.length < 2) return ''\n // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n while (str.length % 4 !== 0) {\n str = str + '='\n }\n return str\n}\n\nfunction utf8ToBytes (string, units) {\n units = units || Infinity\n let codePoint\n const length = string.length\n let leadSurrogate = null\n const bytes = []\n\n for (let i = 0; i < length; ++i) {\n codePoint = string.charCodeAt(i)\n\n // is surrogate component\n if (codePoint > 0xD7FF && codePoint < 0xE000) {\n // last char was a lead\n if (!leadSurrogate) {\n // no lead yet\n if (codePoint > 0xDBFF) {\n // unexpected trail\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n } else if (i + 1 === length) {\n // unpaired lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n }\n\n // valid lead\n leadSurrogate = codePoint\n\n continue\n }\n\n // 2 leads in a row\n if (codePoint < 0xDC00) {\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n leadSurrogate = codePoint\n continue\n }\n\n // valid surrogate pair\n codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n } else if (leadSurrogate) {\n // valid bmp char, but last char was a lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n }\n\n leadSurrogate = null\n\n // encode utf8\n if (codePoint < 0x80) {\n if ((units -= 1) < 0) break\n bytes.push(codePoint)\n } else if (codePoint < 0x800) {\n if ((units -= 2) < 0) break\n bytes.push(\n codePoint >> 0x6 | 0xC0,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x10000) {\n if ((units -= 3) < 0) break\n bytes.push(\n codePoint >> 0xC | 0xE0,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x110000) {\n if ((units -= 4) < 0) break\n bytes.push(\n codePoint >> 0x12 | 0xF0,\n codePoint >> 0xC & 0x3F | 0x80,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else {\n throw new Error('Invalid code point')\n }\n }\n\n return bytes\n}\n\nfunction asciiToBytes (str) {\n const byteArray = []\n for (let i = 0; i < str.length; ++i) {\n // Node's code seems to be doing this and not & 0x7F..\n byteArray.push(str.charCodeAt(i) & 0xFF)\n }\n return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n let c, hi, lo\n const byteArray = []\n for (let i = 0; i < str.length; ++i) {\n if ((units -= 2) < 0) break\n\n c = str.charCodeAt(i)\n hi = c >> 8\n lo = c % 256\n byteArray.push(lo)\n byteArray.push(hi)\n }\n\n return byteArray\n}\n\nfunction base64ToBytes (str) {\n return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n let i\n for (i = 0; i < length; ++i) {\n if ((i + offset >= dst.length) || (i >= src.length)) break\n dst[i + offset] = src[i]\n }\n return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n return obj instanceof type ||\n (obj != null && obj.constructor != null && obj.constructor.name != null &&\n obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n // For IE11 support\n return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n const alphabet = '0123456789abcdef'\n const table = new Array(256)\n for (let i = 0; i < 16; ++i) {\n const i16 = i * 16\n for (let j = 0; j < 16; ++j) {\n table[i16 + j] = alphabet[i] + alphabet[j]\n }\n }\n return table\n})()\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n throw new Error('BigInt not supported')\n}\n","export default {}","import { Buffer } from 'buffer';\nexport default class RemoteFile {\n async getBufferFromResponse(response) {\n if (typeof response.buffer === 'function') {\n return response.buffer();\n }\n else if (typeof response.arrayBuffer === 'function') {\n const resp = await response.arrayBuffer();\n return Buffer.from(resp);\n }\n else {\n throw new TypeError('invalid HTTP response object, has no buffer method, and no arrayBuffer method');\n }\n }\n constructor(source, opts = {}) {\n this.baseOverrides = {};\n this.url = source;\n const fetch = opts.fetch || globalThis.fetch.bind(globalThis);\n if (!fetch) {\n throw new TypeError(`no fetch function supplied, and none found in global environment`);\n }\n if (opts.overrides) {\n this.baseOverrides = opts.overrides;\n }\n this.fetchImplementation = fetch;\n }\n async fetch(input, init) {\n let response;\n try {\n response = await this.fetchImplementation(input, init);\n }\n catch (e) {\n if (`${e}`.includes('Failed to fetch')) {\n // refetch to to help work around a chrome bug (discussed in\n // generic-filehandle issue #72) in which the chrome cache returns a\n // CORS error for content in its cache. see also\n // https://github.com/GMOD/jbrowse-components/pull/1511\n console.warn(`generic-filehandle: refetching ${input} to attempt to work around chrome CORS header caching bug`);\n response = await this.fetchImplementation(input, {\n ...init,\n cache: 'reload',\n });\n }\n else {\n throw e;\n }\n }\n return response;\n }\n async read(buffer, offset = 0, length, position = 0, opts = {}) {\n const { headers = {}, signal, overrides = {} } = opts;\n if (length < Infinity) {\n headers.range = `bytes=${position}-${position + length}`;\n }\n else if (length === Infinity && position !== 0) {\n headers.range = `bytes=${position}-`;\n }\n const args = {\n ...this.baseOverrides,\n ...overrides,\n headers: {\n ...headers,\n ...overrides.headers,\n ...this.baseOverrides.headers,\n },\n method: 'GET',\n redirect: 'follow',\n mode: 'cors',\n signal,\n };\n const response = await this.fetch(this.url, args);\n if (!response.ok) {\n throw new Error(`HTTP ${response.status} ${response.statusText} ${this.url}`);\n }\n if ((response.status === 200 && position === 0) ||\n response.status === 206) {\n const responseData = await this.getBufferFromResponse(response);\n const bytesCopied = responseData.copy(buffer, offset, 0, Math.min(length, responseData.length));\n // try to parse out the size of the remote file\n const res = response.headers.get('content-range');\n const sizeMatch = /\\/(\\d+)$/.exec(res || '');\n if (sizeMatch && sizeMatch[1]) {\n this._stat = { size: parseInt(sizeMatch[1], 10) };\n }\n return { bytesRead: bytesCopied, buffer };\n }\n if (response.status === 200) {\n throw new Error('${this.url} fetch returned status 200, expected 206');\n }\n // TODO: try harder here to gather more information about what the problem is\n throw new Error(`HTTP ${response.status} fetching ${this.url}`);\n }\n async readFile(options = {}) {\n let encoding;\n let opts;\n if (typeof options === 'string') {\n encoding = options;\n opts = {};\n }\n else {\n encoding = options.encoding;\n opts = options;\n delete opts.encoding;\n }\n const { headers = {}, signal, overrides = {} } = opts;\n const args = {\n headers,\n method: 'GET',\n redirect: 'follow',\n mode: 'cors',\n signal,\n ...this.baseOverrides,\n ...overrides,\n };\n const response = await this.fetch(this.url, args);\n if (!response) {\n throw new Error('generic-filehandle failed to fetch');\n }\n if (response.status !== 200) {\n throw Object.assign(new Error(`HTTP ${response.status} fetching ${this.url}`), {\n status: response.status,\n });\n }\n if (encoding === 'utf8') {\n return response.text();\n }\n if (encoding) {\n throw new Error(`unsupported encoding: ${encoding}`);\n }\n return this.getBufferFromResponse(response);\n }\n async stat() {\n if (!this._stat) {\n const buf = Buffer.allocUnsafe(10);\n await this.read(buf, 0, 10, 0);\n if (!this._stat) {\n throw new Error(`unable to determine size of file at ${this.url}`);\n }\n }\n return this._stat;\n }\n async close() {\n return;\n }\n}\n//# sourceMappingURL=remoteFile.js.map","'use strict';\n\n\nvar TYPED_OK = (typeof Uint8Array !== 'undefined') &&\n (typeof Uint16Array !== 'undefined') &&\n (typeof Int32Array !== 'undefined');\n\nfunction _has(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexports.assign = function (obj /*from1, from2, from3, ...*/) {\n var sources = Array.prototype.slice.call(arguments, 1);\n while (sources.length) {\n var source = sources.shift();\n if (!source) { continue; }\n\n if (typeof source !== 'object') {\n throw new TypeError(source + 'must be non-object');\n }\n\n for (var p in source) {\n if (_has(source, p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n};\n\n\n// reduce buffer size, avoiding mem copy\nexports.shrinkBuf = function (buf, size) {\n if (buf.length === size) { return buf; }\n if (buf.subarray) { return buf.subarray(0, size); }\n buf.length = size;\n return buf;\n};\n\n\nvar fnTyped = {\n arraySet: function (dest, src, src_offs, len, dest_offs) {\n if (src.subarray && dest.subarray) {\n dest.set(src.subarray(src_offs, src_offs + len), dest_offs);\n return;\n }\n // Fallback to ordinary array\n for (var i = 0; i < len; i++) {\n dest[dest_offs + i] = src[src_offs + i];\n }\n },\n // Join array of chunks to single array.\n flattenChunks: function (chunks) {\n var i, l, len, pos, chunk, result;\n\n // calculate data length\n len = 0;\n for (i = 0, l = chunks.length; i < l; i++) {\n len += chunks[i].length;\n }\n\n // join chunks\n result = new Uint8Array(len);\n pos = 0;\n for (i = 0, l = chunks.length; i < l; i++) {\n chunk = chunks[i];\n result.set(chunk, pos);\n pos += chunk.length;\n }\n\n return result;\n }\n};\n\nvar fnUntyped = {\n arraySet: function (dest, src, src_offs, len, dest_offs) {\n for (var i = 0; i < len; i++) {\n dest[dest_offs + i] = src[src_offs + i];\n }\n },\n // Join array of chunks to single array.\n flattenChunks: function (chunks) {\n return [].concat.apply([], chunks);\n }\n};\n\n\n// Enable/Disable typed arrays use, for testing\n//\nexports.setTyped = function (on) {\n if (on) {\n exports.Buf8 = Uint8Array;\n exports.Buf16 = Uint16Array;\n exports.Buf32 = Int32Array;\n exports.assign(exports, fnTyped);\n } else {\n exports.Buf8 = Array;\n exports.Buf16 = Array;\n exports.Buf32 = Array;\n exports.assign(exports, fnUntyped);\n }\n};\n\nexports.setTyped(TYPED_OK);\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\nvar utils = require('../utils/common');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//var Z_FILTERED = 1;\n//var Z_HUFFMAN_ONLY = 2;\n//var Z_RLE = 3;\nvar Z_FIXED = 4;\n//var Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nvar Z_BINARY = 0;\nvar Z_TEXT = 1;\n//var Z_ASCII = 1; // = Z_TEXT\nvar Z_UNKNOWN = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nvar STORED_BLOCK = 0;\nvar STATIC_TREES = 1;\nvar DYN_TREES = 2;\n/* The three kinds of block type */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\n\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nvar D_CODES = 30;\n/* number of distance codes */\n\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\n\nvar HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\n\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar Buf_size = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nvar MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nvar END_BLOCK = 256;\n/* end of block literal code */\n\nvar REP_3_6 = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nvar REPZ_3_10 = 17;\n/* repeat a zero length 3-10 times (3 bits of repeat count) */\n\nvar REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nvar extra_lbits = /* extra bits for each length code */\n [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];\n\nvar extra_dbits = /* extra bits for each distance code */\n [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];\n\nvar extra_blbits = /* extra bits for each bit length code */\n [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7];\n\nvar bl_order =\n [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nvar DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nvar static_ltree = new Array((L_CODES + 2) * 2);\nzero(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nvar static_dtree = new Array(D_CODES * 2);\nzero(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nvar _dist_code = new Array(DIST_CODE_LEN);\nzero(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nvar _length_code = new Array(MAX_MATCH - MIN_MATCH + 1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nvar base_length = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nvar base_dist = new Array(D_CODES);\nzero(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n this.static_tree = static_tree; /* static tree or NULL */\n this.extra_bits = extra_bits; /* extra bits for each code or NULL */\n this.extra_base = extra_base; /* base index for extra_bits */\n this.elems = elems; /* max number of elements in the tree */\n this.max_length = max_length; /* max bit length for the codes */\n\n // show if `static_tree` has data or dummy - needed for monomorphic objects\n this.has_stree = static_tree && static_tree.length;\n}\n\n\nvar static_l_desc;\nvar static_d_desc;\nvar static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n this.dyn_tree = dyn_tree; /* the dynamic tree */\n this.max_code = 0; /* largest code with non zero frequency */\n this.stat_desc = stat_desc; /* the corresponding static tree */\n}\n\n\n\nfunction d_code(dist) {\n return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n}\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nfunction put_short(s, w) {\n// put_byte(s, (uch)((w) & 0xff));\n// put_byte(s, (uch)((ush)(w) >> 8));\n s.pending_buf[s.pending++] = (w) & 0xff;\n s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n}\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nfunction send_bits(s, value, length) {\n if (s.bi_valid > (Buf_size - length)) {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n put_short(s, s.bi_buf);\n s.bi_buf = value >> (Buf_size - s.bi_valid);\n s.bi_valid += length - Buf_size;\n } else {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n s.bi_valid += length;\n }\n}\n\n\nfunction send_code(s, c, tree) {\n send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n}\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nfunction bi_reverse(code, len) {\n var res = 0;\n do {\n res |= code & 1;\n code >>>= 1;\n res <<= 1;\n } while (--len > 0);\n return res >>> 1;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nfunction bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n * above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n * array bl_count contains the frequencies for each bit length.\n * The length opt_len is updated; static_len is also updated if stree is\n * not null.\n */\nfunction gen_bitlen(s, desc)\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n var tree = desc.dyn_tree;\n var max_code = desc.max_code;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var extra = desc.stat_desc.extra_bits;\n var base = desc.stat_desc.extra_base;\n var max_length = desc.stat_desc.max_length;\n var h; /* heap index */\n var n, m; /* iterate over the tree elements */\n var bits; /* bit length */\n var xbits; /* extra bits */\n var f; /* frequency */\n var overflow = 0; /* number of elements with bit length too large */\n\n for (bits = 0; bits <= MAX_BITS; bits++) {\n s.bl_count[bits] = 0;\n }\n\n /* In a first pass, compute the optimal bit lengths (which may\n * overflow in the case of the bit length tree).\n */\n tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {\n n = s.heap[h];\n bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n if (bits > max_length) {\n bits = max_length;\n overflow++;\n }\n tree[n * 2 + 1]/*.Len*/ = bits;\n /* We overwrite tree[n].Dad which is no longer needed */\n\n if (n > max_code) { continue; } /* not a leaf node */\n\n s.bl_count[bits]++;\n xbits = 0;\n if (n >= base) {\n xbits = extra[n - base];\n }\n f = tree[n * 2]/*.Freq*/;\n s.opt_len += f * (bits + xbits);\n if (has_stree) {\n s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n }\n }\n if (overflow === 0) { return; }\n\n // Trace((stderr,\"\\nbit length overflow\\n\"));\n /* This happens for example on obj2 and pic of the Calgary corpus */\n\n /* Find the first bit length which could increase: */\n do {\n bits = max_length - 1;\n while (s.bl_count[bits] === 0) { bits--; }\n s.bl_count[bits]--; /* move one leaf down the tree */\n s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n s.bl_count[max_length]--;\n /* The brother of the overflow item also moves one step up,\n * but this does not affect bl_count[max_length]\n */\n overflow -= 2;\n } while (overflow > 0);\n\n /* Now recompute all bit lengths, scanning in increasing frequency.\n * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n * lengths instead of fixing only the wrong ones. This idea is taken\n * from 'ar' written by Haruhiko Okumura.)\n */\n for (bits = max_length; bits !== 0; bits--) {\n n = s.bl_count[bits];\n while (n !== 0) {\n m = s.heap[--h];\n if (m > max_code) { continue; }\n if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n // Trace((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n tree[m * 2 + 1]/*.Len*/ = bits;\n }\n n--;\n }\n }\n}\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n * zero code length.\n */\nfunction gen_codes(tree, max_code, bl_count)\n// ct_data *tree; /* the tree to decorate */\n// int max_code; /* largest code with non zero frequency */\n// ushf *bl_count; /* number of codes at each bit length */\n{\n var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */\n var code = 0; /* running code value */\n var bits; /* bit index */\n var n; /* code index */\n\n /* The distribution counts are first used to generate the code values\n * without bit reversal.\n */\n for (bits = 1; bits <= MAX_BITS; bits++) {\n next_code[bits] = code = (code + bl_count[bits - 1]) << 1;\n }\n /* Check that the bit counts in bl_count are consistent. The last code\n * must be all ones.\n */\n //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n // \"inconsistent bit counts\");\n //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n for (n = 0; n <= max_code; n++) {\n var len = tree[n * 2 + 1]/*.Len*/;\n if (len === 0) { continue; }\n /* Now reverse the bits */\n tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n // n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n }\n}\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nfunction tr_static_init() {\n var n; /* iterates over tree elements */\n var bits; /* bit counter */\n var length; /* length value */\n var code; /* code value */\n var dist; /* distance index */\n var bl_count = new Array(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n\n // do check in _tr_init()\n //if (static_init_done) return;\n\n /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n static_l_desc.static_tree = static_ltree;\n static_l_desc.extra_bits = extra_lbits;\n static_d_desc.static_tree = static_dtree;\n static_d_desc.extra_bits = extra_dbits;\n static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n /* Initialize the mapping length (0..255) -> length code (0..28) */\n length = 0;\n for (code = 0; code < LENGTH_CODES - 1; code++) {\n base_length[code] = length;\n for (n = 0; n < (1 << extra_lbits[code]); n++) {\n _length_code[length++] = code;\n }\n }\n //Assert (length == 256, \"tr_static_init: length != 256\");\n /* Note that the length 255 (match length 258) can be represented\n * in two different ways: code 284 + 5 bits or code 285, so we\n * overwrite length_code[255] to use the best encoding:\n */\n _length_code[length - 1] = code;\n\n /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n dist = 0;\n for (code = 0; code < 16; code++) {\n base_dist[code] = dist;\n for (n = 0; n < (1 << extra_dbits[code]); n++) {\n _dist_code[dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: dist != 256\");\n dist >>= 7; /* from now on, all distances are divided by 128 */\n for (; code < D_CODES; code++) {\n base_dist[code] = dist << 7;\n for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n _dist_code[256 + dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n /* Construct the codes of the static literal tree */\n for (bits = 0; bits <= MAX_BITS; bits++) {\n bl_count[bits] = 0;\n }\n\n n = 0;\n while (n <= 143) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n while (n <= 255) {\n static_ltree[n * 2 + 1]/*.Len*/ = 9;\n n++;\n bl_count[9]++;\n }\n while (n <= 279) {\n static_ltree[n * 2 + 1]/*.Len*/ = 7;\n n++;\n bl_count[7]++;\n }\n while (n <= 287) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n /* Codes 286 and 287 do not exist, but we must include them in the\n * tree construction to get a canonical Huffman tree (longest code\n * all ones)\n */\n gen_codes(static_ltree, L_CODES + 1, bl_count);\n\n /* The static distance tree is trivial: */\n for (n = 0; n < D_CODES; n++) {\n static_dtree[n * 2 + 1]/*.Len*/ = 5;\n static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n }\n\n // Now data ready and we can init static trees\n static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);\n static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS);\n static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS);\n\n //static_init_done = true;\n}\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nfunction init_block(s) {\n var n; /* iterates over tree elements */\n\n /* Initialize the trees. */\n for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n s.opt_len = s.static_len = 0;\n s.last_lit = s.matches = 0;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nfunction bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}\n\n/* ===========================================================================\n * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\nfunction copy_block(s, buf, len, header)\n//DeflateState *s;\n//charf *buf; /* the input data */\n//unsigned len; /* its length */\n//int header; /* true if block header must be written */\n{\n bi_windup(s); /* align on byte boundary */\n\n if (header) {\n put_short(s, len);\n put_short(s, ~len);\n }\n// while (len--) {\n// put_byte(s, *buf++);\n// }\n utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);\n s.pending += len;\n}\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nfunction smaller(tree, n, m, depth) {\n var _n2 = n * 2;\n var _m2 = m * 2;\n return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n}\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nfunction pqdownheap(s, tree, k)\n// deflate_state *s;\n// ct_data *tree; /* the tree to restore */\n// int k; /* node to move down */\n{\n var v = s.heap[k];\n var j = k << 1; /* left son of k */\n while (j <= s.heap_len) {\n /* Set j to the smallest of the two sons: */\n if (j < s.heap_len &&\n smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n j++;\n }\n /* Exit if v is smaller than both sons */\n if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n /* Exchange v with the smallest son */\n s.heap[k] = s.heap[j];\n k = j;\n\n /* And continue down the tree, setting j to the left son of k */\n j <<= 1;\n }\n s.heap[k] = v;\n}\n\n\n// inlined manually\n// var SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nfunction compress_block(s, ltree, dtree)\n// deflate_state *s;\n// const ct_data *ltree; /* literal tree */\n// const ct_data *dtree; /* distance tree */\n{\n var dist; /* distance of matched string */\n var lc; /* match length or unmatched char (if dist == 0) */\n var lx = 0; /* running index in l_buf */\n var code; /* the code to send */\n var extra; /* number of extra bits to send */\n\n if (s.last_lit !== 0) {\n do {\n dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);\n lc = s.pending_buf[s.l_buf + lx];\n lx++;\n\n if (dist === 0) {\n send_code(s, lc, ltree); /* send a literal byte */\n //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n } else {\n /* Here, lc is the match length - MIN_MATCH */\n code = _length_code[lc];\n send_code(s, code + LITERALS + 1, ltree); /* send the length code */\n extra = extra_lbits[code];\n if (extra !== 0) {\n lc -= base_length[code];\n send_bits(s, lc, extra); /* send the extra length bits */\n }\n dist--; /* dist is now the match distance - 1 */\n code = d_code(dist);\n //Assert (code < D_CODES, \"bad d_code\");\n\n send_code(s, code, dtree); /* send the distance code */\n extra = extra_dbits[code];\n if (extra !== 0) {\n dist -= base_dist[code];\n send_bits(s, dist, extra); /* send the extra distance bits */\n }\n } /* literal or match pair ? */\n\n /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */\n //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n // \"pendingBuf overflow\");\n\n } while (lx < s.last_lit);\n }\n\n send_code(s, END_BLOCK, ltree);\n}\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n * and corresponding code. The length opt_len is updated; static_len is\n * also updated if stree is not null. The field max_code is set.\n */\nfunction build_tree(s, desc)\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n var tree = desc.dyn_tree;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var elems = desc.stat_desc.elems;\n var n, m; /* iterate over heap elements */\n var max_code = -1; /* largest code with non zero frequency */\n var node; /* new node being created */\n\n /* Construct the initial heap, with least frequent element in\n * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n * heap[0] is not used.\n */\n s.heap_len = 0;\n s.heap_max = HEAP_SIZE;\n\n for (n = 0; n < elems; n++) {\n if (tree[n * 2]/*.Freq*/ !== 0) {\n s.heap[++s.heap_len] = max_code = n;\n s.depth[n] = 0;\n\n } else {\n tree[n * 2 + 1]/*.Len*/ = 0;\n }\n }\n\n /* The pkzip format requires that at least one distance code exists,\n * and that at least one bit should be sent even if there is only one\n * possible code. So to avoid special checks later on we force at least\n * two codes of non zero frequency.\n */\n while (s.heap_len < 2) {\n node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n tree[node * 2]/*.Freq*/ = 1;\n s.depth[node] = 0;\n s.opt_len--;\n\n if (has_stree) {\n s.static_len -= stree[node * 2 + 1]/*.Len*/;\n }\n /* node is 0 or 1 so it does not have extra bits */\n }\n desc.max_code = max_code;\n\n /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n * establish sub-heaps of increasing lengths:\n */\n for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n /* Construct the Huffman tree by repeatedly combining the least two\n * frequent nodes.\n */\n node = elems; /* next internal node of the tree */\n do {\n //pqremove(s, tree, n); /* n = node of least frequency */\n /*** pqremove ***/\n n = s.heap[1/*SMALLEST*/];\n s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n pqdownheap(s, tree, 1/*SMALLEST*/);\n /***/\n\n m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n s.heap[--s.heap_max] = m;\n\n /* Create a new node father of n and m */\n tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n /* and insert the new node in the heap */\n s.heap[1/*SMALLEST*/] = node++;\n pqdownheap(s, tree, 1/*SMALLEST*/);\n\n } while (s.heap_len >= 2);\n\n s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n /* At this point, the fields freq and dad are set. We can now\n * generate the bit lengths.\n */\n gen_bitlen(s, desc);\n\n /* The field len is now set, we can generate the bit codes */\n gen_codes(tree, max_code, s.bl_count);\n}\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nfunction scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nfunction send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nfunction build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nfunction send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n * a) There are no non-portable control characters belonging to the\n * \"black list\" (0..6, 14..25, 28..31).\n * b) There is at least one printable character belonging to the\n * \"white list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n * \"gray list\" that is ignored in this detection algorithm:\n * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nfunction detect_data_type(s) {\n /* black_mask is the bit mask of black-listed bytes\n * set bits 0..6, 14..25, and 28..31\n * 0xf3ffc07f = binary 11110011111111111100000001111111\n */\n var black_mask = 0xf3ffc07f;\n var n;\n\n /* Check for non-textual (\"black-listed\") bytes. */\n for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n return Z_BINARY;\n }\n }\n\n /* Check for textual (\"white-listed\") bytes. */\n if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n for (n = 32; n < LITERALS; n++) {\n if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n }\n\n /* There are no \"black-listed\" or \"white-listed\" bytes:\n * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n */\n return Z_BINARY;\n}\n\n\nvar static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nfunction _tr_init(s)\n{\n\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n /* Initialize the first block of the first file: */\n init_block(s);\n}\n\n\n/* ===========================================================================\n * Send a stored block\n */\nfunction _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nfunction _tr_align(s) {\n send_bits(s, STATIC_TREES << 1, 3);\n send_code(s, END_BLOCK, static_ltree);\n bi_flush(s);\n}\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and output the encoded block to the zip file.\n */\nfunction _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nfunction _tr_tally(s, dist, lc)\n// deflate_state *s;\n// unsigned dist; /* distance of matched string */\n// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */\n{\n //var out_length, in_length, dcode;\n\n s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff;\n s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;\n\n s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;\n s.last_lit++;\n\n if (dist === 0) {\n /* lc is the unmatched char */\n s.dyn_ltree[lc * 2]/*.Freq*/++;\n } else {\n s.matches++;\n /* Here, lc is the match length - MIN_MATCH */\n dist--; /* dist = match distance - 1 */\n //Assert((ush)dist < (ush)MAX_DIST(s) &&\n // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n // (ush)d_code(dist) < (ush)D_CODES, \"_tr_tally: bad match\");\n\n s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;\n s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n\n//#ifdef TRUNCATE_BLOCK\n// /* Try to guess if it is profitable to stop the current block here */\n// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {\n// /* Compute an upper bound for the compressed length */\n// out_length = s.last_lit*8;\n// in_length = s.strstart - s.block_start;\n//\n// for (dcode = 0; dcode < D_CODES; dcode++) {\n// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);\n// }\n// out_length >>>= 3;\n// //Tracev((stderr,\"\\nlast_lit %u, in %ld, out ~%ld(%ld%%) \",\n// // s->last_lit, in_length, out_length,\n// // 100L - out_length*100L/in_length));\n// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {\n// return true;\n// }\n// }\n//#endif\n\n return (s.last_lit === s.lit_bufsize - 1);\n /* We avoid equality with lit_bufsize because of wraparound at 64K\n * on 16 bit machines and because stored blocks are restricted to\n * 64K-1 bytes.\n */\n}\n\nexports._tr_init = _tr_init;\nexports._tr_stored_block = _tr_stored_block;\nexports._tr_flush_block = _tr_flush_block;\nexports._tr_tally = _tr_tally;\nexports._tr_align = _tr_align;\n","'use strict';\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction adler32(adler, buf, len, pos) {\n var s1 = (adler & 0xffff) |0,\n s2 = ((adler >>> 16) & 0xffff) |0,\n n = 0;\n\n while (len !== 0) {\n // Set limit ~ twice less than 5552, to keep\n // s2 in 31-bits, because we force signed ints.\n // in other case %= will fail.\n n = len > 2000 ? 2000 : len;\n len -= n;\n\n do {\n s1 = (s1 + buf[pos++]) |0;\n s2 = (s2 + s1) |0;\n } while (--n);\n\n s1 %= 65521;\n s2 %= 65521;\n }\n\n return (s1 | (s2 << 16)) |0;\n}\n\n\nmodule.exports = adler32;\n","'use strict';\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nfunction makeTable() {\n var c, table = [];\n\n for (var n = 0; n < 256; n++) {\n c = n;\n for (var k = 0; k < 8; k++) {\n c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n }\n table[n] = c;\n }\n\n return table;\n}\n\n// Create table on load. Just 255 signed longs. Not a problem.\nvar crcTable = makeTable();\n\n\nfunction crc32(crc, buf, len, pos) {\n var t = crcTable,\n end = pos + len;\n\n crc ^= -1;\n\n for (var i = pos; i < end; i++) {\n crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n }\n\n return (crc ^ (-1)); // >>> 0;\n}\n\n\nmodule.exports = crc32;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n 2: 'need dictionary', /* Z_NEED_DICT 2 */\n 1: 'stream end', /* Z_STREAM_END 1 */\n 0: '', /* Z_OK 0 */\n '-1': 'file error', /* Z_ERRNO (-1) */\n '-2': 'stream error', /* Z_STREAM_ERROR (-2) */\n '-3': 'data error', /* Z_DATA_ERROR (-3) */\n '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */\n '-5': 'buffer error', /* Z_BUF_ERROR (-5) */\n '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\nvar trees = require('./trees');\nvar adler32 = require('./adler32');\nvar crc32 = require('./crc32');\nvar msg = require('./messages');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\nvar Z_NO_FLUSH = 0;\nvar Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH = 2;\nvar Z_FULL_FLUSH = 3;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\n//var Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\n//var Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\n//var Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n\n/* compression levels */\n//var Z_NO_COMPRESSION = 0;\n//var Z_BEST_SPEED = 1;\n//var Z_BEST_COMPRESSION = 9;\nvar Z_DEFAULT_COMPRESSION = -1;\n\n\nvar Z_FILTERED = 1;\nvar Z_HUFFMAN_ONLY = 2;\nvar Z_RLE = 3;\nvar Z_FIXED = 4;\nvar Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\n//var Z_BINARY = 0;\n//var Z_TEXT = 1;\n//var Z_ASCII = 1; // = Z_TEXT\nvar Z_UNKNOWN = 2;\n\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n/*============================================================================*/\n\n\nvar MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_MEM_LEVEL = 8;\n\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nvar D_CODES = 30;\n/* number of distance codes */\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\nvar HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\nvar MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nvar PRESET_DICT = 0x20;\n\nvar INIT_STATE = 42;\nvar EXTRA_STATE = 69;\nvar NAME_STATE = 73;\nvar COMMENT_STATE = 91;\nvar HCRC_STATE = 103;\nvar BUSY_STATE = 113;\nvar FINISH_STATE = 666;\n\nvar BS_NEED_MORE = 1; /* block not completed, need more input or more output */\nvar BS_BLOCK_DONE = 2; /* block flush performed */\nvar BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nvar BS_FINISH_DONE = 4; /* finish done, accept no more input or output */\n\nvar OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nfunction err(strm, errorCode) {\n strm.msg = msg[errorCode];\n return errorCode;\n}\n\nfunction rank(f) {\n return ((f) << 1) - ((f) > 4 ? 9 : 0);\n}\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output goes\n * through this function so some applications may wish to modify it\n * to avoid allocating a large strm->output buffer and copying into it.\n * (See also read_buf()).\n */\nfunction flush_pending(strm) {\n var s = strm.state;\n\n //_tr_flush_bits(s);\n var len = s.pending;\n if (len > strm.avail_out) {\n len = strm.avail_out;\n }\n if (len === 0) { return; }\n\n utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);\n strm.next_out += len;\n s.pending_out += len;\n strm.total_out += len;\n strm.avail_out -= len;\n s.pending -= len;\n if (s.pending === 0) {\n s.pending_out = 0;\n }\n}\n\n\nfunction flush_block_only(s, last) {\n trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n s.block_start = s.strstart;\n flush_pending(s.strm);\n}\n\n\nfunction put_byte(s, b) {\n s.pending_buf[s.pending++] = b;\n}\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nfunction putShortMSB(s, b) {\n// put_byte(s, (Byte)(b >> 8));\n// put_byte(s, (Byte)(b & 0xff));\n s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n s.pending_buf[s.pending++] = b & 0xff;\n}\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read. All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nfunction read_buf(strm, buf, start, size) {\n var len = strm.avail_in;\n\n if (len > size) { len = size; }\n if (len === 0) { return 0; }\n\n strm.avail_in -= len;\n\n // zmemcpy(buf, strm->next_in, len);\n utils.arraySet(buf, strm.input, strm.next_in, len, start);\n if (strm.state.wrap === 1) {\n strm.adler = adler32(strm.adler, buf, len, start);\n }\n\n else if (strm.state.wrap === 2) {\n strm.adler = crc32(strm.adler, buf, len, start);\n }\n\n strm.next_in += len;\n strm.total_in += len;\n\n return len;\n}\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nfunction longest_match(s, cur_match) {\n var chain_length = s.max_chain_length; /* max hash chain length */\n var scan = s.strstart; /* current string */\n var match; /* matched string */\n var len; /* length of current match */\n var best_len = s.prev_length; /* best match length so far */\n var nice_match = s.nice_match; /* stop if match long enough */\n var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n var _win = s.window; // shortcut\n\n var wmask = s.w_mask;\n var prev = s.prev;\n\n /* Stop when cur_match becomes <= limit. To simplify the code,\n * we prevent matches with the string of window index 0.\n */\n\n var strend = s.strstart + MAX_MATCH;\n var scan_end1 = _win[scan + best_len - 1];\n var scan_end = _win[scan + best_len];\n\n /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n * It is easy to get rid of this optimization if necessary.\n */\n // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n /* Do not waste too much time if we already have a good match: */\n if (s.prev_length >= s.good_match) {\n chain_length >>= 2;\n }\n /* Do not look for matches beyond the end of the input. This is necessary\n * to make deflate deterministic.\n */\n if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n do {\n // Assert(cur_match < s->strstart, \"no future\");\n match = cur_match;\n\n /* Skip to next match if the match length cannot increase\n * or if the match length is less than 2. Note that the checks below\n * for insufficient lookahead only occur occasionally for performance\n * reasons. Therefore uninitialized memory will be accessed, and\n * conditional jumps will be made that depend on those values.\n * However the length of the match is limited to the lookahead, so\n * the output of deflate is not affected by the uninitialized values.\n */\n\n if (_win[match + best_len] !== scan_end ||\n _win[match + best_len - 1] !== scan_end1 ||\n _win[match] !== _win[scan] ||\n _win[++match] !== _win[scan + 1]) {\n continue;\n }\n\n /* The check at best_len-1 can be removed because it will be made\n * again later. (This heuristic is not always a win.)\n * It is not necessary to compare scan[2] and match[2] since they\n * are always equal when the other bytes match, given that\n * the hash keys are equal and that HASH_BITS >= 8.\n */\n scan += 2;\n match++;\n // Assert(*scan == *match, \"match[2]?\");\n\n /* We check for insufficient lookahead only every 8th comparison;\n * the 256th check will be made at strstart+258.\n */\n do {\n /*jshint noempty:false*/\n } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n scan < strend);\n\n // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n len = MAX_MATCH - (strend - scan);\n scan = strend - MAX_MATCH;\n\n if (len > best_len) {\n s.match_start = cur_match;\n best_len = len;\n if (len >= nice_match) {\n break;\n }\n scan_end1 = _win[scan + best_len - 1];\n scan_end = _win[scan + best_len];\n }\n } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n if (best_len <= s.lookahead) {\n return best_len;\n }\n return s.lookahead;\n}\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n * At least one byte has been read, or avail_in == 0; reads are\n * performed for at least two bytes (required for the zip translate_eol\n * option -- not supported here).\n */\nfunction fill_window(s) {\n var _w_size = s.w_size;\n var p, n, m, more, str;\n\n //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n do {\n more = s.window_size - s.lookahead - s.strstart;\n\n // JS ints have 32 bit, block below not needed\n /* Deal with !@#$% 64K limit: */\n //if (sizeof(int) <= 2) {\n // if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n // more = wsize;\n //\n // } else if (more == (unsigned)(-1)) {\n // /* Very unlikely, but possible on 16 bit machine if\n // * strstart == 0 && lookahead == 1 (input done a byte at time)\n // */\n // more--;\n // }\n //}\n\n\n /* If the window is almost full and there is insufficient lookahead,\n * move the upper half to the lower one to make room in the upper half.\n */\n if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n utils.arraySet(s.window, s.window, _w_size, _w_size, 0);\n s.match_start -= _w_size;\n s.strstart -= _w_size;\n /* we now have strstart >= MAX_DIST */\n s.block_start -= _w_size;\n\n /* Slide the hash table (could be avoided with 32 bit values\n at the expense of memory usage). We slide even when level == 0\n to keep the hash table consistent if we switch back to level > 0\n later. (Using level 0 permanently is not an optimal usage of\n zlib, so we don't care about this pathological case.)\n */\n\n n = s.hash_size;\n p = n;\n do {\n m = s.head[--p];\n s.head[p] = (m >= _w_size ? m - _w_size : 0);\n } while (--n);\n\n n = _w_size;\n p = n;\n do {\n m = s.prev[--p];\n s.prev[p] = (m >= _w_size ? m - _w_size : 0);\n /* If n is not on any hash chain, prev[n] is garbage but\n * its value will never be used.\n */\n } while (--n);\n\n more += _w_size;\n }\n if (s.strm.avail_in === 0) {\n break;\n }\n\n /* If there was no sliding:\n * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n * more == window_size - lookahead - strstart\n * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n * => more >= window_size - 2*WSIZE + 2\n * In the BIG_MEM or MMAP case (not yet supported),\n * window_size == input_size + MIN_LOOKAHEAD &&\n * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n * Otherwise, window_size == 2*WSIZE so more >= 2.\n * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n */\n //Assert(more >= 2, \"more < 2\");\n n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n s.lookahead += n;\n\n /* Initialize the hash value now that we have some input: */\n if (s.lookahead + s.insert >= MIN_MATCH) {\n str = s.strstart - s.insert;\n s.ins_h = s.window[str];\n\n /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;\n//#if MIN_MATCH != 3\n// Call update_hash() MIN_MATCH-3 more times\n//#endif\n while (s.insert) {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = str;\n str++;\n s.insert--;\n if (s.lookahead + s.insert < MIN_MATCH) {\n break;\n }\n }\n }\n /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n * but this is not important since only literal bytes will be emitted.\n */\n\n } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n /* If the WIN_INIT bytes after the end of the current data have never been\n * written, then zero those bytes in order to avoid memory check reports of\n * the use of uninitialized (or uninitialised as Julian writes) bytes by\n * the longest match routines. Update the high water mark for the next\n * time through here. WIN_INIT is set to MAX_MATCH since the longest match\n * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n */\n// if (s.high_water < s.window_size) {\n// var curr = s.strstart + s.lookahead;\n// var init = 0;\n//\n// if (s.high_water < curr) {\n// /* Previous high water mark below current data -- zero WIN_INIT\n// * bytes or up to end of window, whichever is less.\n// */\n// init = s.window_size - curr;\n// if (init > WIN_INIT)\n// init = WIN_INIT;\n// zmemzero(s->window + curr, (unsigned)init);\n// s->high_water = curr + init;\n// }\n// else if (s->high_water < (ulg)curr + WIN_INIT) {\n// /* High water mark at or above current data, but below current data\n// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n// * to end of window, whichever is less.\n// */\n// init = (ulg)curr + WIN_INIT - s->high_water;\n// if (init > s->window_size - s->high_water)\n// init = s->window_size - s->high_water;\n// zmemzero(s->window + s->high_water, (unsigned)init);\n// s->high_water += init;\n// }\n// }\n//\n// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n// \"not enough room for search\");\n}\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n * This function does not insert new strings in the dictionary since\n * uncompressible data is probably not useful. This function is used\n * only for the level=0 compression option.\n * NOTE: this function should be optimized to avoid extra copying from\n * window to pending_buf.\n */\nfunction deflate_stored(s, flush) {\n /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\n * to pending_buf_size, and each stored block has a 5 byte header:\n */\n var max_block_size = 0xffff;\n\n if (max_block_size > s.pending_buf_size - 5) {\n max_block_size = s.pending_buf_size - 5;\n }\n\n /* Copy as much as possible from input to output: */\n for (;;) {\n /* Fill the window as much as possible: */\n if (s.lookahead <= 1) {\n\n //Assert(s->strstart < s->w_size+MAX_DIST(s) ||\n // s->block_start >= (long)s->w_size, \"slide too late\");\n// if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||\n// s.block_start >= s.w_size)) {\n// throw new Error(\"slide too late\");\n// }\n\n fill_window(s);\n if (s.lookahead === 0 && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n\n if (s.lookahead === 0) {\n break;\n }\n /* flush the current block */\n }\n //Assert(s->block_start >= 0L, \"block gone\");\n// if (s.block_start < 0) throw new Error(\"block gone\");\n\n s.strstart += s.lookahead;\n s.lookahead = 0;\n\n /* Emit a stored block if pending_buf will be full: */\n var max_start = s.block_start + max_block_size;\n\n if (s.strstart === 0 || s.strstart >= max_start) {\n /* strstart == 0 is possible when wraparound on 16-bit machine */\n s.lookahead = s.strstart - max_start;\n s.strstart = max_start;\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n\n }\n /* Flush if we may have to slide, otherwise block_start may become\n * negative and the data will be gone:\n */\n if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n\n s.insert = 0;\n\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n\n if (s.strstart > s.block_start) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_NEED_MORE;\n}\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nfunction deflate_fast(s, flush) {\n var hash_head; /* head of the hash chain */\n var bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; /* flush the current block */\n }\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n }\n if (s.match_length >= MIN_MATCH) {\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n\n /* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */\n if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; /* string at strstart already in table */\n do {\n s.strstart++;\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */\n } while (--s.match_length !== 0);\n s.strstart++;\n } else\n {\n s.strstart += s.match_length;\n s.match_length = 0;\n s.ins_h = s.window[s.strstart];\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n//#if MIN_MATCH != 3\n// Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n */\n }\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nfunction deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one. Do not maintain a hash table. (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nfunction deflate_rle(s, flush) {\n var bflush; /* set if current block must be flushed */\n var prev; /* byte at distance one to match */\n var scan, strend; /* scan goes up to strend for length of run */\n\n var _win = s.window;\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the longest run, plus one for the unrolled loop.\n */\n if (s.lookahead <= MAX_MATCH) {\n fill_window(s);\n if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* See how many times the previous byte repeats */\n s.match_length = 0;\n if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n scan = s.strstart - 1;\n prev = _win[scan];\n if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n strend = s.strstart + MAX_MATCH;\n do {\n /*jshint noempty:false*/\n } while (prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n scan < strend);\n s.match_length = MAX_MATCH - (strend - scan);\n if (s.match_length > s.lookahead) {\n s.match_length = s.lookahead;\n }\n }\n //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n }\n\n /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n if (s.match_length >= MIN_MATCH) {\n //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n s.strstart += s.match_length;\n s.match_length = 0;\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nfunction deflate_huff(s, flush) {\n var bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we have a literal to write. */\n if (s.lookahead === 0) {\n fill_window(s);\n if (s.lookahead === 0) {\n if (flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n break; /* flush the current block */\n }\n }\n\n /* Output a literal byte */\n s.match_length = 0;\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n s.lookahead--;\n s.strstart++;\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n this.good_length = good_length;\n this.max_lazy = max_lazy;\n this.nice_length = nice_length;\n this.max_chain = max_chain;\n this.func = func;\n}\n\nvar configuration_table;\n\nconfiguration_table = [\n /* good lazy nice chain */\n new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */\n new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */\n new Config(4, 5, 16, 8, deflate_fast), /* 2 */\n new Config(4, 6, 32, 32, deflate_fast), /* 3 */\n\n new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */\n new Config(8, 16, 32, 32, deflate_slow), /* 5 */\n new Config(8, 16, 128, 128, deflate_slow), /* 6 */\n new Config(8, 32, 128, 256, deflate_slow), /* 7 */\n new Config(32, 128, 258, 1024, deflate_slow), /* 8 */\n new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nfunction lm_init(s) {\n s.window_size = 2 * s.w_size;\n\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n\n /* Set the default configuration parameters:\n */\n s.max_lazy_match = configuration_table[s.level].max_lazy;\n s.good_match = configuration_table[s.level].good_length;\n s.nice_match = configuration_table[s.level].nice_length;\n s.max_chain_length = configuration_table[s.level].max_chain;\n\n s.strstart = 0;\n s.block_start = 0;\n s.lookahead = 0;\n s.insert = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n s.ins_h = 0;\n}\n\n\nfunction DeflateState() {\n this.strm = null; /* pointer back to this zlib stream */\n this.status = 0; /* as the name implies */\n this.pending_buf = null; /* output still pending */\n this.pending_buf_size = 0; /* size of pending_buf */\n this.pending_out = 0; /* next pending byte to output to the stream */\n this.pending = 0; /* nb of bytes in the pending buffer */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.gzhead = null; /* gzip header information to write */\n this.gzindex = 0; /* where in extra, name, or comment */\n this.method = Z_DEFLATED; /* can only be DEFLATED */\n this.last_flush = -1; /* value of flush param for previous deflate call */\n\n this.w_size = 0; /* LZ77 window size (32K by default) */\n this.w_bits = 0; /* log2(w_size) (8..16) */\n this.w_mask = 0; /* w_size - 1 */\n\n this.window = null;\n /* Sliding window. Input bytes are read into the second half of the window,\n * and move to the first half later to keep a dictionary of at least wSize\n * bytes. With this organization, matches are limited to a distance of\n * wSize-MAX_MATCH bytes, but this ensures that IO is always\n * performed with a length multiple of the block size.\n */\n\n this.window_size = 0;\n /* Actual size of window: 2*wSize, except when the user input buffer\n * is directly used as sliding window.\n */\n\n this.prev = null;\n /* Link to older string with same hash index. To limit the size of this\n * array to 64K, this link is maintained only for the last 32K strings.\n * An index in this array is thus a window index modulo 32K.\n */\n\n this.head = null; /* Heads of the hash chains or NIL. */\n\n this.ins_h = 0; /* hash index of string to be inserted */\n this.hash_size = 0; /* number of elements in hash table */\n this.hash_bits = 0; /* log2(hash_size) */\n this.hash_mask = 0; /* hash_size-1 */\n\n this.hash_shift = 0;\n /* Number of bits by which ins_h must be shifted at each input\n * step. It must be such that after MIN_MATCH steps, the oldest\n * byte no longer takes part in the hash key, that is:\n * hash_shift * MIN_MATCH >= hash_bits\n */\n\n this.block_start = 0;\n /* Window position at the beginning of the current output block. Gets\n * negative when the window is moved backwards.\n */\n\n this.match_length = 0; /* length of best match */\n this.prev_match = 0; /* previous match */\n this.match_available = 0; /* set if previous match exists */\n this.strstart = 0; /* start of string to insert */\n this.match_start = 0; /* start of matching string */\n this.lookahead = 0; /* number of valid bytes ahead in window */\n\n this.prev_length = 0;\n /* Length of the best match at previous step. Matches not greater than this\n * are discarded. This is used in the lazy match evaluation.\n */\n\n this.max_chain_length = 0;\n /* To speed up deflation, hash chains are never searched beyond this\n * length. A higher limit improves compression ratio but degrades the\n * speed.\n */\n\n this.max_lazy_match = 0;\n /* Attempt to find a better match only when the current match is strictly\n * smaller than this value. This mechanism is used only for compression\n * levels >= 4.\n */\n // That's alias to max_lazy_match, don't use directly\n //this.max_insert_length = 0;\n /* Insert new strings in the hash table only if the match length is not\n * greater than this length. This saves time but degrades compression.\n * max_insert_length is used only for compression levels <= 3.\n */\n\n this.level = 0; /* compression level (1..9) */\n this.strategy = 0; /* favor or force Huffman coding*/\n\n this.good_match = 0;\n /* Use a faster search when the previous match is longer than this */\n\n this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n /* used by trees.c: */\n\n /* Didn't use ct_data typedef below to suppress compiler warning */\n\n // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */\n // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */\n\n // Use flat array of DOUBLE size, with interleaved fata,\n // because JS does not support effective\n this.dyn_ltree = new utils.Buf16(HEAP_SIZE * 2);\n this.dyn_dtree = new utils.Buf16((2 * D_CODES + 1) * 2);\n this.bl_tree = new utils.Buf16((2 * BL_CODES + 1) * 2);\n zero(this.dyn_ltree);\n zero(this.dyn_dtree);\n zero(this.bl_tree);\n\n this.l_desc = null; /* desc. for literal tree */\n this.d_desc = null; /* desc. for distance tree */\n this.bl_desc = null; /* desc. for bit length tree */\n\n //ush bl_count[MAX_BITS+1];\n this.bl_count = new utils.Buf16(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n\n //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */\n this.heap = new utils.Buf16(2 * L_CODES + 1); /* heap used to build the Huffman trees */\n zero(this.heap);\n\n this.heap_len = 0; /* number of elements in the heap */\n this.heap_max = 0; /* element of largest frequency */\n /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n * The same heap array is used to build all trees.\n */\n\n this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n zero(this.depth);\n /* Depth of each subtree used as tie breaker for trees of equal frequency\n */\n\n this.l_buf = 0; /* buffer index for literals or lengths */\n\n this.lit_bufsize = 0;\n /* Size of match buffer for literals/lengths. There are 4 reasons for\n * limiting lit_bufsize to 64K:\n * - frequencies can be kept in 16 bit counters\n * - if compression is not successful for the first block, all input\n * data is still in the window so we can still emit a stored block even\n * when input comes from standard input. (This can also be done for\n * all blocks if lit_bufsize is not greater than 32K.)\n * - if compression is not successful for a file smaller than 64K, we can\n * even emit a stored file instead of a stored block (saving 5 bytes).\n * This is applicable only for zip (not gzip or zlib).\n * - creating new Huffman trees less frequently may not provide fast\n * adaptation to changes in the input data statistics. (Take for\n * example a binary file with poorly compressible code followed by\n * a highly compressible string table.) Smaller buffer sizes give\n * fast adaptation but have of course the overhead of transmitting\n * trees more frequently.\n * - I can't count above 4\n */\n\n this.last_lit = 0; /* running index in l_buf */\n\n this.d_buf = 0;\n /* Buffer index for distances. To simplify the code, d_buf and l_buf have\n * the same number of elements. To use different lengths, an extra flag\n * array would be necessary.\n */\n\n this.opt_len = 0; /* bit length of current block with optimal trees */\n this.static_len = 0; /* bit length of current block with static trees */\n this.matches = 0; /* number of string matches in current block */\n this.insert = 0; /* bytes at end of window left to insert */\n\n\n this.bi_buf = 0;\n /* Output buffer. bits are inserted starting at the bottom (least\n * significant bits).\n */\n this.bi_valid = 0;\n /* Number of valid bits in bi_buf. All bits above the last valid bit\n * are always zero.\n */\n\n // Used for window memory init. We safely ignore it for JS. That makes\n // sense only for pointers and memory check tools.\n //this.high_water = 0;\n /* High water mark offset in window for initialized bytes -- bytes above\n * this are set to zero in order to avoid memory check warnings when\n * longest match routines access bytes past the input. This is then\n * updated to the new high water mark.\n */\n}\n\n\nfunction deflateResetKeep(strm) {\n var s;\n\n if (!strm || !strm.state) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.total_in = strm.total_out = 0;\n strm.data_type = Z_UNKNOWN;\n\n s = strm.state;\n s.pending = 0;\n s.pending_out = 0;\n\n if (s.wrap < 0) {\n s.wrap = -s.wrap;\n /* was made negative by deflate(..., Z_FINISH); */\n }\n s.status = (s.wrap ? INIT_STATE : BUSY_STATE);\n strm.adler = (s.wrap === 2) ?\n 0 // crc32(0, Z_NULL, 0)\n :\n 1; // adler32(0, Z_NULL, 0)\n s.last_flush = Z_NO_FLUSH;\n trees._tr_init(s);\n return Z_OK;\n}\n\n\nfunction deflateReset(strm) {\n var ret = deflateResetKeep(strm);\n if (ret === Z_OK) {\n lm_init(strm.state);\n }\n return ret;\n}\n\n\nfunction deflateSetHeader(strm, head) {\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }\n strm.state.gzhead = head;\n return Z_OK;\n}\n\n\nfunction deflateInit2(strm, level, method, windowBits, memLevel, strategy) {\n if (!strm) { // === Z_NULL\n return Z_STREAM_ERROR;\n }\n var wrap = 1;\n\n if (level === Z_DEFAULT_COMPRESSION) {\n level = 6;\n }\n\n if (windowBits < 0) { /* suppress zlib wrapper */\n wrap = 0;\n windowBits = -windowBits;\n }\n\n else if (windowBits > 15) {\n wrap = 2; /* write gzip wrapper instead */\n windowBits -= 16;\n }\n\n\n if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||\n windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n strategy < 0 || strategy > Z_FIXED) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n\n if (windowBits === 8) {\n windowBits = 9;\n }\n /* until 256-byte window bug fixed */\n\n var s = new DeflateState();\n\n strm.state = s;\n s.strm = strm;\n\n s.wrap = wrap;\n s.gzhead = null;\n s.w_bits = windowBits;\n s.w_size = 1 << s.w_bits;\n s.w_mask = s.w_size - 1;\n\n s.hash_bits = memLevel + 7;\n s.hash_size = 1 << s.hash_bits;\n s.hash_mask = s.hash_size - 1;\n s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n s.window = new utils.Buf8(s.w_size * 2);\n s.head = new utils.Buf16(s.hash_size);\n s.prev = new utils.Buf16(s.w_size);\n\n // Don't need mem init magic for JS.\n //s.high_water = 0; /* nothing written to s->window yet */\n\n s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n s.pending_buf_size = s.lit_bufsize * 4;\n\n //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\n //s->pending_buf = (uchf *) overlay;\n s.pending_buf = new utils.Buf8(s.pending_buf_size);\n\n // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\n s.d_buf = 1 * s.lit_bufsize;\n\n //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\n s.l_buf = (1 + 2) * s.lit_bufsize;\n\n s.level = level;\n s.strategy = strategy;\n s.method = method;\n\n return deflateReset(strm);\n}\n\nfunction deflateInit(strm, level) {\n return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n}\n\n\nfunction deflate(strm, flush) {\n var old_flush, s;\n var beg, val; // for gzip header write only\n\n if (!strm || !strm.state ||\n flush > Z_BLOCK || flush < 0) {\n return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;\n }\n\n s = strm.state;\n\n if (!strm.output ||\n (!strm.input && strm.avail_in !== 0) ||\n (s.status === FINISH_STATE && flush !== Z_FINISH)) {\n return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);\n }\n\n s.strm = strm; /* just in case */\n old_flush = s.last_flush;\n s.last_flush = flush;\n\n /* Write the header */\n if (s.status === INIT_STATE) {\n\n if (s.wrap === 2) { // GZIP header\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n put_byte(s, 31);\n put_byte(s, 139);\n put_byte(s, 8);\n if (!s.gzhead) { // s->gzhead == Z_NULL\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, OS_CODE);\n s.status = BUSY_STATE;\n }\n else {\n put_byte(s, (s.gzhead.text ? 1 : 0) +\n (s.gzhead.hcrc ? 2 : 0) +\n (!s.gzhead.extra ? 0 : 4) +\n (!s.gzhead.name ? 0 : 8) +\n (!s.gzhead.comment ? 0 : 16)\n );\n put_byte(s, s.gzhead.time & 0xff);\n put_byte(s, (s.gzhead.time >> 8) & 0xff);\n put_byte(s, (s.gzhead.time >> 16) & 0xff);\n put_byte(s, (s.gzhead.time >> 24) & 0xff);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, s.gzhead.os & 0xff);\n if (s.gzhead.extra && s.gzhead.extra.length) {\n put_byte(s, s.gzhead.extra.length & 0xff);\n put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n }\n if (s.gzhead.hcrc) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);\n }\n s.gzindex = 0;\n s.status = EXTRA_STATE;\n }\n }\n else // DEFLATE header\n {\n var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;\n var level_flags = -1;\n\n if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n level_flags = 0;\n } else if (s.level < 6) {\n level_flags = 1;\n } else if (s.level === 6) {\n level_flags = 2;\n } else {\n level_flags = 3;\n }\n header |= (level_flags << 6);\n if (s.strstart !== 0) { header |= PRESET_DICT; }\n header += 31 - (header % 31);\n\n s.status = BUSY_STATE;\n putShortMSB(s, header);\n\n /* Save the adler32 of the preset dictionary: */\n if (s.strstart !== 0) {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n strm.adler = 1; // adler32(0L, Z_NULL, 0);\n }\n }\n\n//#ifdef GZIP\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n\n while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n break;\n }\n }\n put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n s.gzindex++;\n }\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (s.gzindex === s.gzhead.extra.length) {\n s.gzindex = 0;\n s.status = NAME_STATE;\n }\n }\n else {\n s.status = NAME_STATE;\n }\n }\n if (s.status === NAME_STATE) {\n if (s.gzhead.name/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.name.length) {\n val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (val === 0) {\n s.gzindex = 0;\n s.status = COMMENT_STATE;\n }\n }\n else {\n s.status = COMMENT_STATE;\n }\n }\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.comment.length) {\n val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (val === 0) {\n s.status = HCRC_STATE;\n }\n }\n else {\n s.status = HCRC_STATE;\n }\n }\n if (s.status === HCRC_STATE) {\n if (s.gzhead.hcrc) {\n if (s.pending + 2 > s.pending_buf_size) {\n flush_pending(strm);\n }\n if (s.pending + 2 <= s.pending_buf_size) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n s.status = BUSY_STATE;\n }\n }\n else {\n s.status = BUSY_STATE;\n }\n }\n//#endif\n\n /* Flush as much pending output as possible */\n if (s.pending !== 0) {\n flush_pending(strm);\n if (strm.avail_out === 0) {\n /* Since avail_out is 0, deflate will be called again with\n * more output space, but possibly with both pending and\n * avail_in equal to zero. There won't be anything to do,\n * but this is not an error situation so make sure we\n * return OK instead of BUF_ERROR at next call of deflate:\n */\n s.last_flush = -1;\n return Z_OK;\n }\n\n /* Make sure there is something to do and avoid duplicate consecutive\n * flushes. For repeated and useless calls with Z_FINISH, we keep\n * returning Z_STREAM_END instead of Z_BUF_ERROR.\n */\n } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n flush !== Z_FINISH) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* User must not provide more input after the first FINISH: */\n if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* Start a new block or continue the current one.\n */\n if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {\n var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :\n (s.strategy === Z_RLE ? deflate_rle(s, flush) :\n configuration_table[s.level].func(s, flush));\n\n if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n s.status = FINISH_STATE;\n }\n if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n if (strm.avail_out === 0) {\n s.last_flush = -1;\n /* avoid BUF_ERROR next call, see above */\n }\n return Z_OK;\n /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n * of deflate should use the same flush parameter to make sure\n * that the flush is complete. So we don't have to output an\n * empty block here, this will be done at next call. This also\n * ensures that for a very small output buffer, we emit at most\n * one empty block.\n */\n }\n if (bstate === BS_BLOCK_DONE) {\n if (flush === Z_PARTIAL_FLUSH) {\n trees._tr_align(s);\n }\n else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\n trees._tr_stored_block(s, 0, 0, false);\n /* For a full flush, this empty block will be recognized\n * as a special marker by inflate_sync().\n */\n if (flush === Z_FULL_FLUSH) {\n /*** CLEAR_HASH(s); ***/ /* forget history */\n zero(s.head); // Fill with NIL (= 0);\n\n if (s.lookahead === 0) {\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n }\n }\n flush_pending(strm);\n if (strm.avail_out === 0) {\n s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n return Z_OK;\n }\n }\n }\n //Assert(strm->avail_out > 0, \"bug2\");\n //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n if (flush !== Z_FINISH) { return Z_OK; }\n if (s.wrap <= 0) { return Z_STREAM_END; }\n\n /* Write the trailer */\n if (s.wrap === 2) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n put_byte(s, (strm.adler >> 16) & 0xff);\n put_byte(s, (strm.adler >> 24) & 0xff);\n put_byte(s, strm.total_in & 0xff);\n put_byte(s, (strm.total_in >> 8) & 0xff);\n put_byte(s, (strm.total_in >> 16) & 0xff);\n put_byte(s, (strm.total_in >> 24) & 0xff);\n }\n else\n {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n\n flush_pending(strm);\n /* If avail_out is zero, the application will call deflate again\n * to flush the rest.\n */\n if (s.wrap > 0) { s.wrap = -s.wrap; }\n /* write the trailer only once! */\n return s.pending !== 0 ? Z_OK : Z_STREAM_END;\n}\n\nfunction deflateEnd(strm) {\n var status;\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR;\n }\n\n status = strm.state.status;\n if (status !== INIT_STATE &&\n status !== EXTRA_STATE &&\n status !== NAME_STATE &&\n status !== COMMENT_STATE &&\n status !== HCRC_STATE &&\n status !== BUSY_STATE &&\n status !== FINISH_STATE\n ) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.state = null;\n\n return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;\n}\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nfunction deflateSetDictionary(strm, dictionary) {\n var dictLength = dictionary.length;\n\n var s;\n var str, n;\n var wrap;\n var avail;\n var next;\n var input;\n var tmpDict;\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR;\n }\n\n s = strm.state;\n wrap = s.wrap;\n\n if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n return Z_STREAM_ERROR;\n }\n\n /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n if (wrap === 1) {\n /* adler32(strm->adler, dictionary, dictLength); */\n strm.adler = adler32(strm.adler, dictionary, dictLength, 0);\n }\n\n s.wrap = 0; /* avoid computing Adler-32 in read_buf */\n\n /* if dictionary would fill window, just replace the history */\n if (dictLength >= s.w_size) {\n if (wrap === 0) { /* already empty otherwise */\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n /* use the tail */\n // dictionary = dictionary.slice(dictLength - s.w_size);\n tmpDict = new utils.Buf8(s.w_size);\n utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);\n dictionary = tmpDict;\n dictLength = s.w_size;\n }\n /* insert dictionary into window and hash */\n avail = strm.avail_in;\n next = strm.next_in;\n input = strm.input;\n strm.avail_in = dictLength;\n strm.next_in = 0;\n strm.input = dictionary;\n fill_window(s);\n while (s.lookahead >= MIN_MATCH) {\n str = s.strstart;\n n = s.lookahead - (MIN_MATCH - 1);\n do {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n s.head[s.ins_h] = str;\n str++;\n } while (--n);\n s.strstart = str;\n s.lookahead = MIN_MATCH - 1;\n fill_window(s);\n }\n s.strstart += s.lookahead;\n s.block_start = s.strstart;\n s.insert = s.lookahead;\n s.lookahead = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n strm.next_in = next;\n strm.input = input;\n strm.avail_in = avail;\n s.wrap = wrap;\n return Z_OK;\n}\n\n\nexports.deflateInit = deflateInit;\nexports.deflateInit2 = deflateInit2;\nexports.deflateReset = deflateReset;\nexports.deflateResetKeep = deflateResetKeep;\nexports.deflateSetHeader = deflateSetHeader;\nexports.deflate = deflate;\nexports.deflateEnd = deflateEnd;\nexports.deflateSetDictionary = deflateSetDictionary;\nexports.deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nexports.deflateBound = deflateBound;\nexports.deflateCopy = deflateCopy;\nexports.deflateParams = deflateParams;\nexports.deflatePending = deflatePending;\nexports.deflatePrime = deflatePrime;\nexports.deflateTune = deflateTune;\n*/\n","// String encode/decode helpers\n'use strict';\n\n\nvar utils = require('./common');\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nvar STR_APPLY_OK = true;\nvar STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, [ 0 ]); } catch (__) { STR_APPLY_OK = false; }\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nvar _utf8len = new utils.Buf8(256);\nfor (var q = 0; q < 256; q++) {\n _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nexports.string2buf = function (str) {\n var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n // count binary size\n for (m_pos = 0; m_pos < str_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n }\n\n // allocate buffer\n buf = new utils.Buf8(buf_len);\n\n // convert\n for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n if (c < 0x80) {\n /* one byte */\n buf[i++] = c;\n } else if (c < 0x800) {\n /* two bytes */\n buf[i++] = 0xC0 | (c >>> 6);\n buf[i++] = 0x80 | (c & 0x3f);\n } else if (c < 0x10000) {\n /* three bytes */\n buf[i++] = 0xE0 | (c >>> 12);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n } else {\n /* four bytes */\n buf[i++] = 0xf0 | (c >>> 18);\n buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n }\n }\n\n return buf;\n};\n\n// Helper (used in 2 places)\nfunction buf2binstring(buf, len) {\n // On Chrome, the arguments in a function call that are allowed is `65534`.\n // If the length of the buffer is smaller than that, we can use this optimization,\n // otherwise we will take a slower path.\n if (len < 65534) {\n if ((buf.subarray && STR_APPLY_UIA_OK) || (!buf.subarray && STR_APPLY_OK)) {\n return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));\n }\n }\n\n var result = '';\n for (var i = 0; i < len; i++) {\n result += String.fromCharCode(buf[i]);\n }\n return result;\n}\n\n\n// Convert byte array to binary string\nexports.buf2binstring = function (buf) {\n return buf2binstring(buf, buf.length);\n};\n\n\n// Convert binary string (typed, when possible)\nexports.binstring2buf = function (str) {\n var buf = new utils.Buf8(str.length);\n for (var i = 0, len = buf.length; i < len; i++) {\n buf[i] = str.charCodeAt(i);\n }\n return buf;\n};\n\n\n// convert array to string\nexports.buf2string = function (buf, max) {\n var i, out, c, c_len;\n var len = max || buf.length;\n\n // Reserve max possible length (2 words per char)\n // NB: by unknown reasons, Array is significantly faster for\n // String.fromCharCode.apply than Uint16Array.\n var utf16buf = new Array(len * 2);\n\n for (out = 0, i = 0; i < len;) {\n c = buf[i++];\n // quick process ascii\n if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n c_len = _utf8len[c];\n // skip 5 & 6 byte codes\n if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n // apply mask on first byte\n c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n // join the rest\n while (c_len > 1 && i < len) {\n c = (c << 6) | (buf[i++] & 0x3f);\n c_len--;\n }\n\n // terminated by end of string?\n if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n if (c < 0x10000) {\n utf16buf[out++] = c;\n } else {\n c -= 0x10000;\n utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n }\n }\n\n return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max - length limit (mandatory);\nexports.utf8border = function (buf, max) {\n var pos;\n\n max = max || buf.length;\n if (max > buf.length) { max = buf.length; }\n\n // go back from last position, until start of sequence found\n pos = max - 1;\n while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n // Very small and broken sequence,\n // return max, because we should return something anyway.\n if (pos < 0) { return max; }\n\n // If we came to start of buffer - that means buffer is too small,\n // return max too.\n if (pos === 0) { return max; }\n\n return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n /* next input byte */\n this.input = null; // JS specific, because we have no pointers\n this.next_in = 0;\n /* number of bytes available at input */\n this.avail_in = 0;\n /* total number of input bytes read so far */\n this.total_in = 0;\n /* next output byte should be put there */\n this.output = null; // JS specific, because we have no pointers\n this.next_out = 0;\n /* remaining free space at output */\n this.avail_out = 0;\n /* total number of bytes output so far */\n this.total_out = 0;\n /* last error message, NULL if no error */\n this.msg = ''/*Z_NULL*/;\n /* not visible by applications */\n this.state = null;\n /* best guess about the data type: binary or text */\n this.data_type = 2/*Z_UNKNOWN*/;\n /* adler32 value of the uncompressed data */\n this.adler = 0;\n}\n\nmodule.exports = ZStream;\n","'use strict';\n\n\nvar zlib_deflate = require('./zlib/deflate');\nvar utils = require('./utils/common');\nvar strings = require('./utils/strings');\nvar msg = require('./zlib/messages');\nvar ZStream = require('./zlib/zstream');\n\nvar toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nvar Z_NO_FLUSH = 0;\nvar Z_FINISH = 4;\n\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\nvar Z_SYNC_FLUSH = 2;\n\nvar Z_DEFAULT_COMPRESSION = -1;\n\nvar Z_DEFAULT_STRATEGY = 0;\n\nvar Z_DEFLATED = 8;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array|Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param) or if you\n * push a chunk with explicit flush (call [[Deflate#push]] with\n * `Z_SYNC_FLUSH` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n * (each char code [0..255])\n * - `header` (Object) - custom header for gzip\n * - `text` (Boolean) - true if compressed data believed to be text\n * - `time` (Number) - modification time, unix timestamp\n * - `os` (Number) - operation system code\n * - `extra` (Array) - array of bytes with extra data (max 65536)\n * - `name` (String) - file name (binary string)\n * - `comment` (String) - comment (binary string)\n * - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true); // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate(options) {\n if (!(this instanceof Deflate)) return new Deflate(options);\n\n this.options = utils.assign({\n level: Z_DEFAULT_COMPRESSION,\n method: Z_DEFLATED,\n chunkSize: 16384,\n windowBits: 15,\n memLevel: 8,\n strategy: Z_DEFAULT_STRATEGY,\n to: ''\n }, options || {});\n\n var opt = this.options;\n\n if (opt.raw && (opt.windowBits > 0)) {\n opt.windowBits = -opt.windowBits;\n }\n\n else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n opt.windowBits += 16;\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new ZStream();\n this.strm.avail_out = 0;\n\n var status = zlib_deflate.deflateInit2(\n this.strm,\n opt.level,\n opt.method,\n opt.windowBits,\n opt.memLevel,\n opt.strategy\n );\n\n if (status !== Z_OK) {\n throw new Error(msg[status]);\n }\n\n if (opt.header) {\n zlib_deflate.deflateSetHeader(this.strm, opt.header);\n }\n\n if (opt.dictionary) {\n var dict;\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n // If we need to compress text, change encoding to utf8.\n dict = strings.string2buf(opt.dictionary);\n } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n dict = new Uint8Array(opt.dictionary);\n } else {\n dict = opt.dictionary;\n }\n\n status = zlib_deflate.deflateSetDictionary(this.strm, dict);\n\n if (status !== Z_OK) {\n throw new Error(msg[status]);\n }\n\n this._dict_set = true;\n }\n}\n\n/**\n * Deflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|ArrayBuffer|String): input data. Strings will be\n * converted to utf8 byte sequence.\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\n * [[Deflate#onEnd]]. For interim explicit flushes (without ending the stream) you\n * can use mode Z_SYNC_FLUSH, keeping the compression context.\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * array format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nDeflate.prototype.push = function (data, mode) {\n var strm = this.strm;\n var chunkSize = this.options.chunkSize;\n var status, _mode;\n\n if (this.ended) { return false; }\n\n _mode = (mode === ~~mode) ? mode : ((mode === true) ? Z_FINISH : Z_NO_FLUSH);\n\n // Convert data if needed\n if (typeof data === 'string') {\n // If we need to compress text, change encoding to utf8.\n strm.input = strings.string2buf(data);\n } else if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n do {\n if (strm.avail_out === 0) {\n strm.output = new utils.Buf8(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n status = zlib_deflate.deflate(strm, _mode); /* no bad return value */\n\n if (status !== Z_STREAM_END && status !== Z_OK) {\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n if (strm.avail_out === 0 || (strm.avail_in === 0 && (_mode === Z_FINISH || _mode === Z_SYNC_FLUSH))) {\n if (this.options.to === 'string') {\n this.onData(strings.buf2binstring(utils.shrinkBuf(strm.output, strm.next_out)));\n } else {\n this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n }\n }\n } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== Z_STREAM_END);\n\n // Finalize on the last chunk.\n if (_mode === Z_FINISH) {\n status = zlib_deflate.deflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === Z_OK;\n }\n\n // callback interim results if Z_SYNC_FLUSH.\n if (_mode === Z_SYNC_FLUSH) {\n this.onEnd(Z_OK);\n strm.avail_out = 0;\n return true;\n }\n\n return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): output data. Type of array depends\n * on js engine support. When string output requested, each chunk\n * will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\n * or if an error happened. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK) {\n if (this.options.to === 'string') {\n this.result = this.chunks.join('');\n } else {\n this.result = utils.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n * (each char code [0..255])\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , data = Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate(input, options) {\n var deflator = new Deflate(options);\n\n deflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (deflator.err) { throw deflator.msg || msg[deflator.err]; }\n\n return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw(input, options) {\n options = options || {};\n options.raw = true;\n return deflate(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip(input, options) {\n options = options || {};\n options.gzip = true;\n return deflate(input, options);\n}\n\n\nexports.Deflate = Deflate;\nexports.deflate = deflate;\nexports.deflateRaw = deflateRaw;\nexports.gzip = gzip;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar TYPE = 12; /* i: waiting for type bits, including last-flag bit */\n\n/*\n Decode literal, length, and distance codes and write out the resulting\n literal and match bytes until either not enough input or output is\n available, an end-of-block is encountered, or a data error is encountered.\n When large enough input and output buffers are supplied to inflate(), for\n example, a 16K input buffer and a 64K output buffer, more than 95% of the\n inflate execution time is spent in this routine.\n\n Entry assumptions:\n\n state.mode === LEN\n strm.avail_in >= 6\n strm.avail_out >= 258\n start >= strm.avail_out\n state.bits < 8\n\n On return, state.mode is one of:\n\n LEN -- ran out of enough output space or enough available input\n TYPE -- reached end of block code, inflate() to interpret next block\n BAD -- error in block data\n\n Notes:\n\n - The maximum input bits used by a length/distance pair is 15 bits for the\n length code, 5 bits for the length extra, 15 bits for the distance code,\n and 13 bits for the distance extra. This totals 48 bits, or six bytes.\n Therefore if strm.avail_in >= 6, then there is enough input to avoid\n checking for available input while decoding.\n\n - The maximum bytes that a single length/distance pair can output is 258\n bytes, which is the maximum length that can be coded. inflate_fast()\n requires strm.avail_out >= 258 for each loop to avoid checking for\n output space.\n */\nmodule.exports = function inflate_fast(strm, start) {\n var state;\n var _in; /* local strm.input */\n var last; /* have enough input while in < last */\n var _out; /* local strm.output */\n var beg; /* inflate()'s initial strm.output */\n var end; /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n var dmax; /* maximum distance from zlib header */\n//#endif\n var wsize; /* window size or zero if not using window */\n var whave; /* valid bytes in the window */\n var wnext; /* window write index */\n // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n var s_window; /* allocated sliding window, if wsize != 0 */\n var hold; /* local strm.hold */\n var bits; /* local strm.bits */\n var lcode; /* local strm.lencode */\n var dcode; /* local strm.distcode */\n var lmask; /* mask for first level of length codes */\n var dmask; /* mask for first level of distance codes */\n var here; /* retrieved table entry */\n var op; /* code bits, operation, extra bits, or */\n /* window position, window bytes to copy */\n var len; /* match length, unused bytes */\n var dist; /* match distance */\n var from; /* where to copy match from */\n var from_source;\n\n\n var input, output; // JS specific, because we have no pointers\n\n /* copy state to local variables */\n state = strm.state;\n //here = state.here;\n _in = strm.next_in;\n input = strm.input;\n last = _in + (strm.avail_in - 5);\n _out = strm.next_out;\n output = strm.output;\n beg = _out - (start - strm.avail_out);\n end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n dmax = state.dmax;\n//#endif\n wsize = state.wsize;\n whave = state.whave;\n wnext = state.wnext;\n s_window = state.window;\n hold = state.hold;\n bits = state.bits;\n lcode = state.lencode;\n dcode = state.distcode;\n lmask = (1 << state.lenbits) - 1;\n dmask = (1 << state.distbits) - 1;\n\n\n /* decode literals and length/distances until end-of-block or not enough\n input data or output space */\n\n top:\n do {\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n\n here = lcode[hold & lmask];\n\n dolen:\n for (;;) { // Goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n if (op === 0) { /* literal */\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n output[_out++] = here & 0xffff/*here.val*/;\n }\n else if (op & 16) { /* length base */\n len = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (op) {\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n len += hold & ((1 << op) - 1);\n hold >>>= op;\n bits -= op;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", len));\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n here = dcode[hold & dmask];\n\n dodist:\n for (;;) { // goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n\n if (op & 16) { /* distance base */\n dist = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n }\n dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n if (dist > dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n//#endif\n hold >>>= op;\n bits -= op;\n //Tracevv((stderr, \"inflate: distance %u\\n\", dist));\n op = _out - beg; /* max distance in output */\n if (dist > op) { /* see if copy from window */\n op = dist - op; /* distance back in window */\n if (op > whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// if (len <= op - whave) {\n// do {\n// output[_out++] = 0;\n// } while (--len);\n// continue top;\n// }\n// len -= op - whave;\n// do {\n// output[_out++] = 0;\n// } while (--op > whave);\n// if (op === 0) {\n// from = _out - dist;\n// do {\n// output[_out++] = output[from++];\n// } while (--len);\n// continue top;\n// }\n//#endif\n }\n from = 0; // window index\n from_source = s_window;\n if (wnext === 0) { /* very common case */\n from += wsize - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n else if (wnext < op) { /* wrap around window */\n from += wsize + wnext - op;\n op -= wnext;\n if (op < len) { /* some from end of window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = 0;\n if (wnext < len) { /* some from start of window */\n op = wnext;\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n }\n else { /* contiguous in window */\n from += wnext - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n while (len > 2) {\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n len -= 3;\n }\n if (len) {\n output[_out++] = from_source[from++];\n if (len > 1) {\n output[_out++] = from_source[from++];\n }\n }\n }\n else {\n from = _out - dist; /* copy direct from output */\n do { /* minimum length is three */\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n len -= 3;\n } while (len > 2);\n if (len) {\n output[_out++] = output[from++];\n if (len > 1) {\n output[_out++] = output[from++];\n }\n }\n }\n }\n else if ((op & 64) === 0) { /* 2nd level distance code */\n here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dodist;\n }\n else {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n }\n else if ((op & 64) === 0) { /* 2nd level length code */\n here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dolen;\n }\n else if (op & 32) { /* end-of-block */\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.mode = TYPE;\n break top;\n }\n else {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n } while (_in < last && _out < end);\n\n /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n len = bits >> 3;\n _in -= len;\n bits -= len << 3;\n hold &= (1 << bits) - 1;\n\n /* update state and return */\n strm.next_in = _in;\n strm.next_out = _out;\n strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n state.hold = hold;\n state.bits = bits;\n return;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\n\nvar MAXBITS = 15;\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\nvar lbase = [ /* Length codes 257..285 base */\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n];\n\nvar lext = [ /* Length codes 257..285 extra */\n 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n];\n\nvar dbase = [ /* Distance codes 0..29 base */\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n 8193, 12289, 16385, 24577, 0, 0\n];\n\nvar dext = [ /* Distance codes 0..29 extra */\n 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n 28, 28, 29, 29, 64, 64\n];\n\nmodule.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)\n{\n var bits = opts.bits;\n //here = opts.here; /* table entry for duplication */\n\n var len = 0; /* a code's length in bits */\n var sym = 0; /* index of code symbols */\n var min = 0, max = 0; /* minimum and maximum code lengths */\n var root = 0; /* number of index bits for root table */\n var curr = 0; /* number of index bits for current table */\n var drop = 0; /* code bits to drop for sub-table */\n var left = 0; /* number of prefix codes available */\n var used = 0; /* code entries in table used */\n var huff = 0; /* Huffman code */\n var incr; /* for incrementing code, index */\n var fill; /* index for replicating entries */\n var low; /* low bits for current root entry */\n var mask; /* mask for low root bits */\n var next; /* next available space in table */\n var base = null; /* base value table to use */\n var base_index = 0;\n// var shoextra; /* extra bits table to use */\n var end; /* use base and extra for symbol > end */\n var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */\n var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */\n var extra = null;\n var extra_index = 0;\n\n var here_bits, here_op, here_val;\n\n /*\n Process a set of code lengths to create a canonical Huffman code. The\n code lengths are lens[0..codes-1]. Each length corresponds to the\n symbols 0..codes-1. The Huffman code is generated by first sorting the\n symbols by length from short to long, and retaining the symbol order\n for codes with equal lengths. Then the code starts with all zero bits\n for the first code of the shortest length, and the codes are integer\n increments for the same length, and zeros are appended as the length\n increases. For the deflate format, these bits are stored backwards\n from their more natural integer increment ordering, and so when the\n decoding tables are built in the large loop below, the integer codes\n are incremented backwards.\n\n This routine assumes, but does not check, that all of the entries in\n lens[] are in the range 0..MAXBITS. The caller must assure this.\n 1..MAXBITS is interpreted as that code length. zero means that that\n symbol does not occur in this code.\n\n The codes are sorted by computing a count of codes for each length,\n creating from that a table of starting indices for each length in the\n sorted table, and then entering the symbols in order in the sorted\n table. The sorted table is work[], with that space being provided by\n the caller.\n\n The length counts are used for other purposes as well, i.e. finding\n the minimum and maximum length codes, determining if there are any\n codes at all, checking for a valid set of lengths, and looking ahead\n at length counts to determine sub-table sizes when building the\n decoding tables.\n */\n\n /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n for (len = 0; len <= MAXBITS; len++) {\n count[len] = 0;\n }\n for (sym = 0; sym < codes; sym++) {\n count[lens[lens_index + sym]]++;\n }\n\n /* bound code lengths, force root to be within code lengths */\n root = bits;\n for (max = MAXBITS; max >= 1; max--) {\n if (count[max] !== 0) { break; }\n }\n if (root > max) {\n root = max;\n }\n if (max === 0) { /* no symbols to code at all */\n //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */\n //table.bits[opts.table_index] = 1; //here.bits = (var char)1;\n //table.val[opts.table_index++] = 0; //here.val = (var short)0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n //table.op[opts.table_index] = 64;\n //table.bits[opts.table_index] = 1;\n //table.val[opts.table_index++] = 0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n opts.bits = 1;\n return 0; /* no symbols, but wait for decoding to report error */\n }\n for (min = 1; min < max; min++) {\n if (count[min] !== 0) { break; }\n }\n if (root < min) {\n root = min;\n }\n\n /* check for an over-subscribed or incomplete set of lengths */\n left = 1;\n for (len = 1; len <= MAXBITS; len++) {\n left <<= 1;\n left -= count[len];\n if (left < 0) {\n return -1;\n } /* over-subscribed */\n }\n if (left > 0 && (type === CODES || max !== 1)) {\n return -1; /* incomplete set */\n }\n\n /* generate offsets into symbol table for each length for sorting */\n offs[1] = 0;\n for (len = 1; len < MAXBITS; len++) {\n offs[len + 1] = offs[len] + count[len];\n }\n\n /* sort symbols by length, by symbol order within each length */\n for (sym = 0; sym < codes; sym++) {\n if (lens[lens_index + sym] !== 0) {\n work[offs[lens[lens_index + sym]]++] = sym;\n }\n }\n\n /*\n Create and fill in decoding tables. In this loop, the table being\n filled is at next and has curr index bits. The code being used is huff\n with length len. That code is converted to an index by dropping drop\n bits off of the bottom. For codes where len is less than drop + curr,\n those top drop + curr - len bits are incremented through all values to\n fill the table with replicated entries.\n\n root is the number of index bits for the root table. When len exceeds\n root, sub-tables are created pointed to by the root entry with an index\n of the low root bits of huff. This is saved in low to check for when a\n new sub-table should be started. drop is zero when the root table is\n being filled, and drop is root when sub-tables are being filled.\n\n When a new sub-table is needed, it is necessary to look ahead in the\n code lengths to determine what size sub-table is needed. The length\n counts are used for this, and so count[] is decremented as codes are\n entered in the tables.\n\n used keeps track of how many table entries have been allocated from the\n provided *table space. It is checked for LENS and DIST tables against\n the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n the initial root table size constants. See the comments in inftrees.h\n for more information.\n\n sym increments through all symbols, and the loop terminates when\n all codes of length max, i.e. all codes, have been processed. This\n routine permits incomplete codes, so another loop after this one fills\n in the rest of the decoding tables with invalid code markers.\n */\n\n /* set up for code type */\n // poor man optimization - use if-else instead of switch,\n // to avoid deopts in old v8\n if (type === CODES) {\n base = extra = work; /* dummy value--not used */\n end = 19;\n\n } else if (type === LENS) {\n base = lbase;\n base_index -= 257;\n extra = lext;\n extra_index -= 257;\n end = 256;\n\n } else { /* DISTS */\n base = dbase;\n extra = dext;\n end = -1;\n }\n\n /* initialize opts for loop */\n huff = 0; /* starting code */\n sym = 0; /* starting code symbol */\n len = min; /* starting code length */\n next = table_index; /* current table to fill in */\n curr = root; /* current table index bits */\n drop = 0; /* current bits to drop from code for index */\n low = -1; /* trigger new sub-table when len > root */\n used = 1 << root; /* use root table entries */\n mask = used - 1; /* mask for comparing low */\n\n /* check available table space */\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* process all codes and make table entries */\n for (;;) {\n /* create table entry */\n here_bits = len - drop;\n if (work[sym] < end) {\n here_op = 0;\n here_val = work[sym];\n }\n else if (work[sym] > end) {\n here_op = extra[extra_index + work[sym]];\n here_val = base[base_index + work[sym]];\n }\n else {\n here_op = 32 + 64; /* end of block */\n here_val = 0;\n }\n\n /* replicate for those indices with low len bits equal to huff */\n incr = 1 << (len - drop);\n fill = 1 << curr;\n min = fill; /* save offset to next table */\n do {\n fill -= incr;\n table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n } while (fill !== 0);\n\n /* backwards increment the len-bit code huff */\n incr = 1 << (len - 1);\n while (huff & incr) {\n incr >>= 1;\n }\n if (incr !== 0) {\n huff &= incr - 1;\n huff += incr;\n } else {\n huff = 0;\n }\n\n /* go to next symbol, update count, len */\n sym++;\n if (--count[len] === 0) {\n if (len === max) { break; }\n len = lens[lens_index + work[sym]];\n }\n\n /* create new sub-table if needed */\n if (len > root && (huff & mask) !== low) {\n /* if first time, transition to sub-tables */\n if (drop === 0) {\n drop = root;\n }\n\n /* increment past last table */\n next += min; /* here min is 1 << curr */\n\n /* determine length of next table */\n curr = len - drop;\n left = 1 << curr;\n while (curr + drop < max) {\n left -= count[curr + drop];\n if (left <= 0) { break; }\n curr++;\n left <<= 1;\n }\n\n /* check for enough space */\n used += 1 << curr;\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* point entry in root table to sub-table */\n low = huff & mask;\n /*table.op[low] = curr;\n table.bits[low] = root;\n table.val[low] = next - opts.table_index;*/\n table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n }\n }\n\n /* fill in remaining table entry if code is incomplete (guaranteed to have\n at most one remaining entry, since if the code is incomplete, the\n maximum code length that was allowed to get this far is one bit) */\n if (huff !== 0) {\n //table.op[next + huff] = 64; /* invalid code marker */\n //table.bits[next + huff] = len - drop;\n //table.val[next + huff] = 0;\n table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n }\n\n /* set return parameters */\n //opts.table_index += used;\n opts.bits = root;\n return 0;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\nvar adler32 = require('./adler32');\nvar crc32 = require('./crc32');\nvar inflate_fast = require('./inffast');\nvar inflate_table = require('./inftrees');\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\n//var Z_NO_FLUSH = 0;\n//var Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH = 2;\n//var Z_FULL_FLUSH = 3;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\nvar Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\nvar Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\nvar Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nvar HEAD = 1; /* i: waiting for magic header */\nvar FLAGS = 2; /* i: waiting for method and flags (gzip) */\nvar TIME = 3; /* i: waiting for modification time (gzip) */\nvar OS = 4; /* i: waiting for extra flags and operating system (gzip) */\nvar EXLEN = 5; /* i: waiting for extra length (gzip) */\nvar EXTRA = 6; /* i: waiting for extra bytes (gzip) */\nvar NAME = 7; /* i: waiting for end of file name (gzip) */\nvar COMMENT = 8; /* i: waiting for end of comment (gzip) */\nvar HCRC = 9; /* i: waiting for header crc (gzip) */\nvar DICTID = 10; /* i: waiting for dictionary check value */\nvar DICT = 11; /* waiting for inflateSetDictionary() call */\nvar TYPE = 12; /* i: waiting for type bits, including last-flag bit */\nvar TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */\nvar STORED = 14; /* i: waiting for stored size (length and complement) */\nvar COPY_ = 15; /* i/o: same as COPY below, but only first time in */\nvar COPY = 16; /* i/o: waiting for input or output to copy stored block */\nvar TABLE = 17; /* i: waiting for dynamic block table lengths */\nvar LENLENS = 18; /* i: waiting for code length code lengths */\nvar CODELENS = 19; /* i: waiting for length/lit and distance code lengths */\nvar LEN_ = 20; /* i: same as LEN below, but only first time in */\nvar LEN = 21; /* i: waiting for length/lit/eob code */\nvar LENEXT = 22; /* i: waiting for length extra bits */\nvar DIST = 23; /* i: waiting for distance code */\nvar DISTEXT = 24; /* i: waiting for distance extra bits */\nvar MATCH = 25; /* o: waiting for output space to copy string */\nvar LIT = 26; /* o: waiting for output space to write literal */\nvar CHECK = 27; /* i: waiting for 32-bit check value */\nvar LENGTH = 28; /* i: waiting for 32-bit length (gzip) */\nvar DONE = 29; /* finished check, done -- remain here until reset */\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar MEM = 31; /* got an inflate() memory error -- remain here until reset */\nvar SYNC = 32; /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_WBITS = MAX_WBITS;\n\n\nfunction zswap32(q) {\n return (((q >>> 24) & 0xff) +\n ((q >>> 8) & 0xff00) +\n ((q & 0xff00) << 8) +\n ((q & 0xff) << 24));\n}\n\n\nfunction InflateState() {\n this.mode = 0; /* current inflate mode */\n this.last = false; /* true if processing last block */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.havedict = false; /* true if dictionary provided */\n this.flags = 0; /* gzip header method and flags (0 if zlib) */\n this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */\n this.check = 0; /* protected copy of check value */\n this.total = 0; /* protected copy of output count */\n // TODO: may be {}\n this.head = null; /* where to save gzip header information */\n\n /* sliding window */\n this.wbits = 0; /* log base 2 of requested window size */\n this.wsize = 0; /* window size or zero if not using window */\n this.whave = 0; /* valid bytes in the window */\n this.wnext = 0; /* window write index */\n this.window = null; /* allocated sliding window, if needed */\n\n /* bit accumulator */\n this.hold = 0; /* input bit accumulator */\n this.bits = 0; /* number of bits in \"in\" */\n\n /* for string and stored block copying */\n this.length = 0; /* literal or length of data to copy */\n this.offset = 0; /* distance back to copy string from */\n\n /* for table and code decoding */\n this.extra = 0; /* extra bits needed */\n\n /* fixed and dynamic code tables */\n this.lencode = null; /* starting table for length/literal codes */\n this.distcode = null; /* starting table for distance codes */\n this.lenbits = 0; /* index bits for lencode */\n this.distbits = 0; /* index bits for distcode */\n\n /* dynamic table building */\n this.ncode = 0; /* number of code length code lengths */\n this.nlen = 0; /* number of length code lengths */\n this.ndist = 0; /* number of distance code lengths */\n this.have = 0; /* number of code lengths in lens[] */\n this.next = null; /* next available space in codes[] */\n\n this.lens = new utils.Buf16(320); /* temporary storage for code lengths */\n this.work = new utils.Buf16(288); /* work area for code table building */\n\n /*\n because we don't have pointers in js, we use lencode and distcode directly\n as buffers so we don't need codes\n */\n //this.codes = new utils.Buf32(ENOUGH); /* space for code tables */\n this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */\n this.distdyn = null; /* dynamic table for distance codes (JS specific) */\n this.sane = 0; /* if false, allow invalid distance too far */\n this.back = 0; /* bits back of last unprocessed length/lit */\n this.was = 0; /* initial length of match */\n}\n\nfunction inflateResetKeep(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n strm.total_in = strm.total_out = state.total = 0;\n strm.msg = ''; /*Z_NULL*/\n if (state.wrap) { /* to support ill-conceived Java test suite */\n strm.adler = state.wrap & 1;\n }\n state.mode = HEAD;\n state.last = 0;\n state.havedict = 0;\n state.dmax = 32768;\n state.head = null/*Z_NULL*/;\n state.hold = 0;\n state.bits = 0;\n //state.lencode = state.distcode = state.next = state.codes;\n state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);\n state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);\n\n state.sane = 1;\n state.back = -1;\n //Tracev((stderr, \"inflate: reset\\n\"));\n return Z_OK;\n}\n\nfunction inflateReset(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n\n}\n\nfunction inflateReset2(strm, windowBits) {\n var wrap;\n var state;\n\n /* get the state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n /* extract wrap request from windowBits parameter */\n if (windowBits < 0) {\n wrap = 0;\n windowBits = -windowBits;\n }\n else {\n wrap = (windowBits >> 4) + 1;\n if (windowBits < 48) {\n windowBits &= 15;\n }\n }\n\n /* set number of window bits, free window if different */\n if (windowBits && (windowBits < 8 || windowBits > 15)) {\n return Z_STREAM_ERROR;\n }\n if (state.window !== null && state.wbits !== windowBits) {\n state.window = null;\n }\n\n /* update state and reset the rest of it */\n state.wrap = wrap;\n state.wbits = windowBits;\n return inflateReset(strm);\n}\n\nfunction inflateInit2(strm, windowBits) {\n var ret;\n var state;\n\n if (!strm) { return Z_STREAM_ERROR; }\n //strm.msg = Z_NULL; /* in case we return an error */\n\n state = new InflateState();\n\n //if (state === Z_NULL) return Z_MEM_ERROR;\n //Tracev((stderr, \"inflate: allocated\\n\"));\n strm.state = state;\n state.window = null/*Z_NULL*/;\n ret = inflateReset2(strm, windowBits);\n if (ret !== Z_OK) {\n strm.state = null/*Z_NULL*/;\n }\n return ret;\n}\n\nfunction inflateInit(strm) {\n return inflateInit2(strm, DEF_WBITS);\n}\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding. Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter. This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time. However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nvar virgin = true;\n\nvar lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\nfunction fixedtables(state) {\n /* build fixed huffman tables if first call (may not be thread safe) */\n if (virgin) {\n var sym;\n\n lenfix = new utils.Buf32(512);\n distfix = new utils.Buf32(32);\n\n /* literal/length table */\n sym = 0;\n while (sym < 144) { state.lens[sym++] = 8; }\n while (sym < 256) { state.lens[sym++] = 9; }\n while (sym < 280) { state.lens[sym++] = 7; }\n while (sym < 288) { state.lens[sym++] = 8; }\n\n inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });\n\n /* distance table */\n sym = 0;\n while (sym < 32) { state.lens[sym++] = 5; }\n\n inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });\n\n /* do this just once */\n virgin = false;\n }\n\n state.lencode = lenfix;\n state.lenbits = 9;\n state.distcode = distfix;\n state.distbits = 5;\n}\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning. If window does not exist yet, create it. This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nfunction updatewindow(strm, src, end, copy) {\n var dist;\n var state = strm.state;\n\n /* if it hasn't been done already, allocate space for the window */\n if (state.window === null) {\n state.wsize = 1 << state.wbits;\n state.wnext = 0;\n state.whave = 0;\n\n state.window = new utils.Buf8(state.wsize);\n }\n\n /* copy state->wsize or less output bytes into the circular window */\n if (copy >= state.wsize) {\n utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0);\n state.wnext = 0;\n state.whave = state.wsize;\n }\n else {\n dist = state.wsize - state.wnext;\n if (dist > copy) {\n dist = copy;\n }\n //zmemcpy(state->window + state->wnext, end - copy, dist);\n utils.arraySet(state.window, src, end - copy, dist, state.wnext);\n copy -= dist;\n if (copy) {\n //zmemcpy(state->window, end - copy, copy);\n utils.arraySet(state.window, src, end - copy, copy, 0);\n state.wnext = copy;\n state.whave = state.wsize;\n }\n else {\n state.wnext += dist;\n if (state.wnext === state.wsize) { state.wnext = 0; }\n if (state.whave < state.wsize) { state.whave += dist; }\n }\n }\n return 0;\n}\n\nfunction inflate(strm, flush) {\n var state;\n var input, output; // input/output buffers\n var next; /* next input INDEX */\n var put; /* next output INDEX */\n var have, left; /* available input and output */\n var hold; /* bit buffer */\n var bits; /* bits in bit buffer */\n var _in, _out; /* save starting available input and output */\n var copy; /* number of stored or match bytes to copy */\n var from; /* where to copy match bytes from */\n var from_source;\n var here = 0; /* current decoding table entry */\n var here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //var last; /* parent table entry */\n var last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n var len; /* length to copy for repeats, bits to drop */\n var ret; /* return code */\n var hbuf = new utils.Buf8(4); /* buffer for gzip header crc calculation */\n var opts;\n\n var n; // temporary var for NEED_BITS\n\n var order = /* permutation of code lengths */\n [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];\n\n\n if (!strm || !strm.state || !strm.output ||\n (!strm.input && strm.avail_in !== 0)) {\n return Z_STREAM_ERROR;\n }\n\n state = strm.state;\n if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */\n\n\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n _in = have;\n _out = left;\n ret = Z_OK;\n\n inf_leave: // goto emulation\n for (;;) {\n switch (state.mode) {\n case HEAD:\n if (state.wrap === 0) {\n state.mode = TYPEDO;\n break;\n }\n //=== NEEDBITS(16);\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */\n state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = FLAGS;\n break;\n }\n state.flags = 0; /* expect zlib header */\n if (state.head) {\n state.head.done = false;\n }\n if (!(state.wrap & 1) || /* check if zlib header allowed */\n (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n strm.msg = 'incorrect header check';\n state.mode = BAD;\n break;\n }\n if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n len = (hold & 0x0f)/*BITS(4)*/ + 8;\n if (state.wbits === 0) {\n state.wbits = len;\n }\n else if (len > state.wbits) {\n strm.msg = 'invalid window size';\n state.mode = BAD;\n break;\n }\n state.dmax = 1 << len;\n //Tracev((stderr, \"inflate: zlib header ok\\n\"));\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = hold & 0x200 ? DICTID : TYPE;\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n break;\n case FLAGS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.flags = hold;\n if ((state.flags & 0xff) !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n if (state.flags & 0xe000) {\n strm.msg = 'unknown header flags set';\n state.mode = BAD;\n break;\n }\n if (state.head) {\n state.head.text = ((hold >> 8) & 1);\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = TIME;\n /* falls through */\n case TIME:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.time = hold;\n }\n if (state.flags & 0x0200) {\n //=== CRC4(state.check, hold)\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n hbuf[2] = (hold >>> 16) & 0xff;\n hbuf[3] = (hold >>> 24) & 0xff;\n state.check = crc32(state.check, hbuf, 4, 0);\n //===\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = OS;\n /* falls through */\n case OS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.xflags = (hold & 0xff);\n state.head.os = (hold >> 8);\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = EXLEN;\n /* falls through */\n case EXLEN:\n if (state.flags & 0x0400) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length = hold;\n if (state.head) {\n state.head.extra_len = hold;\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n else if (state.head) {\n state.head.extra = null/*Z_NULL*/;\n }\n state.mode = EXTRA;\n /* falls through */\n case EXTRA:\n if (state.flags & 0x0400) {\n copy = state.length;\n if (copy > have) { copy = have; }\n if (copy) {\n if (state.head) {\n len = state.head.extra_len - state.length;\n if (!state.head.extra) {\n // Use untyped array for more convenient processing later\n state.head.extra = new Array(state.head.extra_len);\n }\n utils.arraySet(\n state.head.extra,\n input,\n next,\n // extra field is limited to 65536 bytes\n // - no need for additional size check\n copy,\n /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n len\n );\n //zmemcpy(state.head.extra + len, next,\n // len + copy > state.head.extra_max ?\n // state.head.extra_max - len : copy);\n }\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n state.length -= copy;\n }\n if (state.length) { break inf_leave; }\n }\n state.length = 0;\n state.mode = NAME;\n /* falls through */\n case NAME:\n if (state.flags & 0x0800) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n // TODO: 2 or 1 bytes?\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.name_max*/)) {\n state.head.name += String.fromCharCode(len);\n }\n } while (len && copy < have);\n\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.name = null;\n }\n state.length = 0;\n state.mode = COMMENT;\n /* falls through */\n case COMMENT:\n if (state.flags & 0x1000) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.comm_max*/)) {\n state.head.comment += String.fromCharCode(len);\n }\n } while (len && copy < have);\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.comment = null;\n }\n state.mode = HCRC;\n /* falls through */\n case HCRC:\n if (state.flags & 0x0200) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.check & 0xffff)) {\n strm.msg = 'header crc mismatch';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n if (state.head) {\n state.head.hcrc = ((state.flags >> 9) & 1);\n state.head.done = true;\n }\n strm.adler = state.check = 0;\n state.mode = TYPE;\n break;\n case DICTID:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n strm.adler = state.check = zswap32(hold);\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = DICT;\n /* falls through */\n case DICT:\n if (state.havedict === 0) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n return Z_NEED_DICT;\n }\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = TYPE;\n /* falls through */\n case TYPE:\n if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case TYPEDO:\n if (state.last) {\n //--- BYTEBITS() ---//\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n state.mode = CHECK;\n break;\n }\n //=== NEEDBITS(3); */\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.last = (hold & 0x01)/*BITS(1)*/;\n //--- DROPBITS(1) ---//\n hold >>>= 1;\n bits -= 1;\n //---//\n\n switch ((hold & 0x03)/*BITS(2)*/) {\n case 0: /* stored block */\n //Tracev((stderr, \"inflate: stored block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = STORED;\n break;\n case 1: /* fixed block */\n fixedtables(state);\n //Tracev((stderr, \"inflate: fixed codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = LEN_; /* decode codes */\n if (flush === Z_TREES) {\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break inf_leave;\n }\n break;\n case 2: /* dynamic block */\n //Tracev((stderr, \"inflate: dynamic codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = TABLE;\n break;\n case 3:\n strm.msg = 'invalid block type';\n state.mode = BAD;\n }\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break;\n case STORED:\n //--- BYTEBITS() ---// /* go to byte boundary */\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n strm.msg = 'invalid stored block lengths';\n state.mode = BAD;\n break;\n }\n state.length = hold & 0xffff;\n //Tracev((stderr, \"inflate: stored length %u\\n\",\n // state.length));\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = COPY_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case COPY_:\n state.mode = COPY;\n /* falls through */\n case COPY:\n copy = state.length;\n if (copy) {\n if (copy > have) { copy = have; }\n if (copy > left) { copy = left; }\n if (copy === 0) { break inf_leave; }\n //--- zmemcpy(put, next, copy); ---\n utils.arraySet(output, input, next, copy, put);\n //---//\n have -= copy;\n next += copy;\n left -= copy;\n put += copy;\n state.length -= copy;\n break;\n }\n //Tracev((stderr, \"inflate: stored end\\n\"));\n state.mode = TYPE;\n break;\n case TABLE:\n //=== NEEDBITS(14); */\n while (bits < 14) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n if (state.nlen > 286 || state.ndist > 30) {\n strm.msg = 'too many length or distance symbols';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracev((stderr, \"inflate: table sizes ok\\n\"));\n state.have = 0;\n state.mode = LENLENS;\n /* falls through */\n case LENLENS:\n while (state.have < state.ncode) {\n //=== NEEDBITS(3);\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n while (state.have < 19) {\n state.lens[order[state.have++]] = 0;\n }\n // We have separate tables & no pointers. 2 commented lines below not needed.\n //state.next = state.codes;\n //state.lencode = state.next;\n // Switch to use dynamic table\n state.lencode = state.lendyn;\n state.lenbits = 7;\n\n opts = { bits: state.lenbits };\n ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n state.lenbits = opts.bits;\n\n if (ret) {\n strm.msg = 'invalid code lengths set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, \"inflate: code lengths ok\\n\"));\n state.have = 0;\n state.mode = CODELENS;\n /* falls through */\n case CODELENS:\n while (state.have < state.nlen + state.ndist) {\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_val < 16) {\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.lens[state.have++] = here_val;\n }\n else {\n if (here_val === 16) {\n //=== NEEDBITS(here.bits + 2);\n n = here_bits + 2;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n if (state.have === 0) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n len = state.lens[state.have - 1];\n copy = 3 + (hold & 0x03);//BITS(2);\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n }\n else if (here_val === 17) {\n //=== NEEDBITS(here.bits + 3);\n n = here_bits + 3;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 3 + (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n else {\n //=== NEEDBITS(here.bits + 7);\n n = here_bits + 7;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 11 + (hold & 0x7f);//BITS(7);\n //--- DROPBITS(7) ---//\n hold >>>= 7;\n bits -= 7;\n //---//\n }\n if (state.have + copy > state.nlen + state.ndist) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n while (copy--) {\n state.lens[state.have++] = len;\n }\n }\n }\n\n /* handle error breaks in while */\n if (state.mode === BAD) { break; }\n\n /* check for end-of-block code (better have one) */\n if (state.lens[256] === 0) {\n strm.msg = 'invalid code -- missing end-of-block';\n state.mode = BAD;\n break;\n }\n\n /* build code tables -- note: do not change the lenbits or distbits\n values here (9 and 6) without reading the comments in inftrees.h\n concerning the ENOUGH constants, which depend on those values */\n state.lenbits = 9;\n\n opts = { bits: state.lenbits };\n ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.lenbits = opts.bits;\n // state.lencode = state.next;\n\n if (ret) {\n strm.msg = 'invalid literal/lengths set';\n state.mode = BAD;\n break;\n }\n\n state.distbits = 6;\n //state.distcode.copy(state.codes);\n // Switch to use dynamic table\n state.distcode = state.distdyn;\n opts = { bits: state.distbits };\n ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.distbits = opts.bits;\n // state.distcode = state.next;\n\n if (ret) {\n strm.msg = 'invalid distances set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, 'inflate: codes ok\\n'));\n state.mode = LEN_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case LEN_:\n state.mode = LEN;\n /* falls through */\n case LEN:\n if (have >= 6 && left >= 258) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n inflate_fast(strm, _out);\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n if (state.mode === TYPE) {\n state.back = -1;\n }\n break;\n }\n state.back = 0;\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_op && (here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.lencode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n state.length = here_val;\n if (here_op === 0) {\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n state.mode = LIT;\n break;\n }\n if (here_op & 32) {\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.back = -1;\n state.mode = TYPE;\n break;\n }\n if (here_op & 64) {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break;\n }\n state.extra = here_op & 15;\n state.mode = LENEXT;\n /* falls through */\n case LENEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", state.length));\n state.was = state.length;\n state.mode = DIST;\n /* falls through */\n case DIST:\n for (;;) {\n here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if ((here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.distcode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n if (here_op & 64) {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break;\n }\n state.offset = here_val;\n state.extra = (here_op) & 15;\n state.mode = DISTEXT;\n /* falls through */\n case DISTEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n//#ifdef INFLATE_STRICT\n if (state.offset > state.dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracevv((stderr, \"inflate: distance %u\\n\", state.offset));\n state.mode = MATCH;\n /* falls through */\n case MATCH:\n if (left === 0) { break inf_leave; }\n copy = _out - left;\n if (state.offset > copy) { /* copy from window */\n copy = state.offset - copy;\n if (copy > state.whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// Trace((stderr, \"inflate.c too far\\n\"));\n// copy -= state.whave;\n// if (copy > state.length) { copy = state.length; }\n// if (copy > left) { copy = left; }\n// left -= copy;\n// state.length -= copy;\n// do {\n// output[put++] = 0;\n// } while (--copy);\n// if (state.length === 0) { state.mode = LEN; }\n// break;\n//#endif\n }\n if (copy > state.wnext) {\n copy -= state.wnext;\n from = state.wsize - copy;\n }\n else {\n from = state.wnext - copy;\n }\n if (copy > state.length) { copy = state.length; }\n from_source = state.window;\n }\n else { /* copy from output */\n from_source = output;\n from = put - state.offset;\n copy = state.length;\n }\n if (copy > left) { copy = left; }\n left -= copy;\n state.length -= copy;\n do {\n output[put++] = from_source[from++];\n } while (--copy);\n if (state.length === 0) { state.mode = LEN; }\n break;\n case LIT:\n if (left === 0) { break inf_leave; }\n output[put++] = state.length;\n left--;\n state.mode = LEN;\n break;\n case CHECK:\n if (state.wrap) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n // Use '|' instead of '+' to make sure that result is signed\n hold |= input[next++] << bits;\n bits += 8;\n }\n //===//\n _out -= left;\n strm.total_out += _out;\n state.total += _out;\n if (_out) {\n strm.adler = state.check =\n /*UPDATE(state.check, put - _out, _out);*/\n (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out));\n\n }\n _out = left;\n // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n if ((state.flags ? hold : zswap32(hold)) !== state.check) {\n strm.msg = 'incorrect data check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: check matches trailer\\n\"));\n }\n state.mode = LENGTH;\n /* falls through */\n case LENGTH:\n if (state.wrap && state.flags) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.total & 0xffffffff)) {\n strm.msg = 'incorrect length check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: length matches trailer\\n\"));\n }\n state.mode = DONE;\n /* falls through */\n case DONE:\n ret = Z_STREAM_END;\n break inf_leave;\n case BAD:\n ret = Z_DATA_ERROR;\n break inf_leave;\n case MEM:\n return Z_MEM_ERROR;\n case SYNC:\n /* falls through */\n default:\n return Z_STREAM_ERROR;\n }\n }\n\n // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n /*\n Return from inflate(), updating the total counts and the check value.\n If there was no progress during the inflate() call, return a buffer\n error. Call updatewindow() to create and/or update the window state.\n Note: a memory error from inflate() is non-recoverable.\n */\n\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n\n if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n (state.mode < CHECK || flush !== Z_FINISH))) {\n if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\n }\n _in -= strm.avail_in;\n _out -= strm.avail_out;\n strm.total_in += _in;\n strm.total_out += _out;\n state.total += _out;\n if (state.wrap && _out) {\n strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/\n (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out));\n }\n strm.data_type = state.bits + (state.last ? 64 : 0) +\n (state.mode === TYPE ? 128 : 0) +\n (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {\n ret = Z_BUF_ERROR;\n }\n return ret;\n}\n\nfunction inflateEnd(strm) {\n\n if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\n return Z_STREAM_ERROR;\n }\n\n var state = strm.state;\n if (state.window) {\n state.window = null;\n }\n strm.state = null;\n return Z_OK;\n}\n\nfunction inflateGetHeader(strm, head) {\n var state;\n\n /* check state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }\n\n /* save header structure */\n state.head = head;\n head.done = false;\n return Z_OK;\n}\n\nfunction inflateSetDictionary(strm, dictionary) {\n var dictLength = dictionary.length;\n\n var state;\n var dictid;\n var ret;\n\n /* check state */\n if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n if (state.wrap !== 0 && state.mode !== DICT) {\n return Z_STREAM_ERROR;\n }\n\n /* check for correct dictionary identifier */\n if (state.mode === DICT) {\n dictid = 1; /* adler32(0, null, 0)*/\n /* dictid = adler32(dictid, dictionary, dictLength); */\n dictid = adler32(dictid, dictionary, dictLength, 0);\n if (dictid !== state.check) {\n return Z_DATA_ERROR;\n }\n }\n /* copy dictionary to window using updatewindow(), which will amend the\n existing dictionary if appropriate */\n ret = updatewindow(strm, dictionary, dictLength, dictLength);\n if (ret) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\n state.havedict = 1;\n // Tracev((stderr, \"inflate: dictionary set\\n\"));\n return Z_OK;\n}\n\nexports.inflateReset = inflateReset;\nexports.inflateReset2 = inflateReset2;\nexports.inflateResetKeep = inflateResetKeep;\nexports.inflateInit = inflateInit;\nexports.inflateInit2 = inflateInit2;\nexports.inflate = inflate;\nexports.inflateEnd = inflateEnd;\nexports.inflateGetHeader = inflateGetHeader;\nexports.inflateSetDictionary = inflateSetDictionary;\nexports.inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nexports.inflateCopy = inflateCopy;\nexports.inflateGetDictionary = inflateGetDictionary;\nexports.inflateMark = inflateMark;\nexports.inflatePrime = inflatePrime;\nexports.inflateSync = inflateSync;\nexports.inflateSyncPoint = inflateSyncPoint;\nexports.inflateUndermine = inflateUndermine;\n*/\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n\n /* Allowed flush values; see deflate() and inflate() below for details */\n Z_NO_FLUSH: 0,\n Z_PARTIAL_FLUSH: 1,\n Z_SYNC_FLUSH: 2,\n Z_FULL_FLUSH: 3,\n Z_FINISH: 4,\n Z_BLOCK: 5,\n Z_TREES: 6,\n\n /* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\n Z_OK: 0,\n Z_STREAM_END: 1,\n Z_NEED_DICT: 2,\n Z_ERRNO: -1,\n Z_STREAM_ERROR: -2,\n Z_DATA_ERROR: -3,\n //Z_MEM_ERROR: -4,\n Z_BUF_ERROR: -5,\n //Z_VERSION_ERROR: -6,\n\n /* compression levels */\n Z_NO_COMPRESSION: 0,\n Z_BEST_SPEED: 1,\n Z_BEST_COMPRESSION: 9,\n Z_DEFAULT_COMPRESSION: -1,\n\n\n Z_FILTERED: 1,\n Z_HUFFMAN_ONLY: 2,\n Z_RLE: 3,\n Z_FIXED: 4,\n Z_DEFAULT_STRATEGY: 0,\n\n /* Possible values of the data_type field (though see inflate()) */\n Z_BINARY: 0,\n Z_TEXT: 1,\n //Z_ASCII: 1, // = Z_TEXT (deprecated)\n Z_UNKNOWN: 2,\n\n /* The deflate compression method */\n Z_DEFLATED: 8\n //Z_NULL: null // Use -1 or null inline, depending on var type\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n /* true if compressed data believed to be text */\n this.text = 0;\n /* modification time */\n this.time = 0;\n /* extra flags (not used when writing a gzip file) */\n this.xflags = 0;\n /* operating system */\n this.os = 0;\n /* pointer to extra field or Z_NULL if none */\n this.extra = null;\n /* extra field length (valid if extra != Z_NULL) */\n this.extra_len = 0; // Actually, we don't need it in JS,\n // but leave for few code modifications\n\n //\n // Setup limits is not necessary because in js we should not preallocate memory\n // for inflate use constant limit in 65536 bytes\n //\n\n /* space at extra (only when reading header) */\n // this.extra_max = 0;\n /* pointer to zero-terminated file name or Z_NULL */\n this.name = '';\n /* space at name (only when reading header) */\n // this.name_max = 0;\n /* pointer to zero-terminated comment or Z_NULL */\n this.comment = '';\n /* space at comment (only when reading header) */\n // this.comm_max = 0;\n /* true if there was or will be a header crc */\n this.hcrc = 0;\n /* true when done reading gzip header (not used when writing a gzip file) */\n this.done = false;\n}\n\nmodule.exports = GZheader;\n","'use strict';\n\n\nvar zlib_inflate = require('./zlib/inflate');\nvar utils = require('./utils/common');\nvar strings = require('./utils/strings');\nvar c = require('./zlib/constants');\nvar msg = require('./zlib/messages');\nvar ZStream = require('./zlib/zstream');\nvar GZheader = require('./zlib/gzheader');\n\nvar toString = Object.prototype.toString;\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param) or if you\n * push a chunk with explicit flush (call [[Inflate#push]] with\n * `Z_SYNC_FLUSH` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true); // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate(options) {\n if (!(this instanceof Inflate)) return new Inflate(options);\n\n this.options = utils.assign({\n chunkSize: 16384,\n windowBits: 0,\n to: ''\n }, options || {});\n\n var opt = this.options;\n\n // Force window size for `raw` data, if not set directly,\n // because we have no header for autodetect.\n if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n opt.windowBits = -opt.windowBits;\n if (opt.windowBits === 0) { opt.windowBits = -15; }\n }\n\n // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n !(options && options.windowBits)) {\n opt.windowBits += 32;\n }\n\n // Gzip header has no info about windows size, we can do autodetect only\n // for deflate. So, if window size not set, force it to max when gzip possible\n if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n // bit 3 (16) -> gzipped data\n // bit 4 (32) -> autodetect gzip/deflate\n if ((opt.windowBits & 15) === 0) {\n opt.windowBits |= 15;\n }\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new ZStream();\n this.strm.avail_out = 0;\n\n var status = zlib_inflate.inflateInit2(\n this.strm,\n opt.windowBits\n );\n\n if (status !== c.Z_OK) {\n throw new Error(msg[status]);\n }\n\n this.header = new GZheader();\n\n zlib_inflate.inflateGetHeader(this.strm, this.header);\n\n // Setup dictionary\n if (opt.dictionary) {\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n opt.dictionary = strings.string2buf(opt.dictionary);\n } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n opt.dictionary = new Uint8Array(opt.dictionary);\n }\n if (opt.raw) { //In raw mode we need to set the dictionary early\n status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);\n if (status !== c.Z_OK) {\n throw new Error(msg[status]);\n }\n }\n }\n}\n\n/**\n * Inflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|ArrayBuffer|String): input data\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\n * [[Inflate#onEnd]]. For interim explicit flushes (without ending the stream) you\n * can use mode Z_SYNC_FLUSH, keeping the decompression context.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nInflate.prototype.push = function (data, mode) {\n var strm = this.strm;\n var chunkSize = this.options.chunkSize;\n var dictionary = this.options.dictionary;\n var status, _mode;\n var next_out_utf8, tail, utf8str;\n\n // Flag to properly process Z_BUF_ERROR on testing inflate call\n // when we check that all output data was flushed.\n var allowBufError = false;\n\n if (this.ended) { return false; }\n _mode = (mode === ~~mode) ? mode : ((mode === true) ? c.Z_FINISH : c.Z_NO_FLUSH);\n\n // Convert data if needed\n if (typeof data === 'string') {\n // Only binary strings can be decompressed on practice\n strm.input = strings.binstring2buf(data);\n } else if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n do {\n if (strm.avail_out === 0) {\n strm.output = new utils.Buf8(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH); /* no bad return value */\n\n if (status === c.Z_NEED_DICT && dictionary) {\n status = zlib_inflate.inflateSetDictionary(this.strm, dictionary);\n }\n\n if (status === c.Z_BUF_ERROR && allowBufError === true) {\n status = c.Z_OK;\n allowBufError = false;\n }\n\n if (status !== c.Z_STREAM_END && status !== c.Z_OK) {\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n\n if (strm.next_out) {\n if (strm.avail_out === 0 || status === c.Z_STREAM_END || (strm.avail_in === 0 && (_mode === c.Z_FINISH || _mode === c.Z_SYNC_FLUSH))) {\n\n if (this.options.to === 'string') {\n\n next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n tail = strm.next_out - next_out_utf8;\n utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n // move tail\n strm.next_out = tail;\n strm.avail_out = chunkSize - tail;\n if (tail) { utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0); }\n\n this.onData(utf8str);\n\n } else {\n this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n }\n }\n }\n\n // When no more input data, we should check that internal inflate buffers\n // are flushed. The only way to do it when avail_out = 0 - run one more\n // inflate pass. But if output data not exists, inflate return Z_BUF_ERROR.\n // Here we set flag to process this error properly.\n //\n // NOTE. Deflate does not return error in this case and does not needs such\n // logic.\n if (strm.avail_in === 0 && strm.avail_out === 0) {\n allowBufError = true;\n }\n\n } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== c.Z_STREAM_END);\n\n if (status === c.Z_STREAM_END) {\n _mode = c.Z_FINISH;\n }\n\n // Finalize on the last chunk.\n if (_mode === c.Z_FINISH) {\n status = zlib_inflate.inflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === c.Z_OK;\n }\n\n // callback interim results if Z_SYNC_FLUSH.\n if (_mode === c.Z_SYNC_FLUSH) {\n this.onEnd(c.Z_OK);\n strm.avail_out = 0;\n return true;\n }\n\n return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): output data. Type of array depends\n * on js engine support. When string output requested, each chunk\n * will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\n * or if an error happened. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate.prototype.onEnd = function (status) {\n // On success - join\n if (status === c.Z_OK) {\n if (this.options.to === 'string') {\n // Glue & convert here, until we teach pako to send\n // utf8 aligned strings to onData\n this.result = this.chunks.join('');\n } else {\n this.result = utils.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n * , input = pako.deflate([1,2,3,4,5,6,7,8,9])\n * , output;\n *\n * try {\n * output = pako.inflate(input);\n * } catch (err)\n * console.log(err);\n * }\n * ```\n **/\nfunction inflate(input, options) {\n var inflator = new Inflate(options);\n\n inflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (inflator.err) { throw inflator.msg || msg[inflator.err]; }\n\n return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw(input, options) {\n options = options || {};\n options.raw = true;\n return inflate(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nexports.Inflate = Inflate;\nexports.inflate = inflate;\nexports.inflateRaw = inflateRaw;\nexports.ungzip = inflate;\n","// Top level file is just a mixin of submodules & constants\n'use strict';\n\nvar assign = require('./lib/utils/common').assign;\n\nvar deflate = require('./lib/deflate');\nvar inflate = require('./lib/inflate');\nvar constants = require('./lib/zlib/constants');\n\nvar pako = {};\n\nassign(pako, deflate, inflate, constants);\n\nmodule.exports = pako;\n","import { Buffer } from 'buffer';\n//@ts-ignore\nimport { Z_SYNC_FLUSH, Inflate } from 'pako';\n// browserify-zlib, which is the zlib shim used by default in webpacked code,\n// does not properly uncompress bgzf chunks that contain more than\n// one bgzf block, so export an unzip function that uses pako directly\n// if we are running in a browser.\nasync function unzip(inputData) {\n try {\n let strm;\n let pos = 0;\n let i = 0;\n const chunks = [];\n let totalSize = 0;\n let inflator;\n do {\n const remainingInput = inputData.subarray(pos);\n inflator = new Inflate();\n ({ strm } = inflator);\n inflator.push(remainingInput, Z_SYNC_FLUSH);\n if (inflator.err) {\n throw new Error(inflator.msg);\n }\n pos += strm.next_in;\n chunks[i] = inflator.result;\n totalSize += chunks[i].length;\n i += 1;\n } while (strm.avail_in);\n const result = new Uint8Array(totalSize);\n for (let i = 0, offset = 0; i < chunks.length; i++) {\n result.set(chunks[i], offset);\n offset += chunks[i].length;\n }\n return Buffer.from(result);\n }\n catch (e) {\n //cleanup error message\n if (`${e}`.match(/incorrect header check/)) {\n throw new Error('problem decompressing block: incorrect gzip header check');\n }\n throw e;\n }\n}\n// similar to pakounzip, except it does extra counting\n// to return the positions of compressed and decompressed\n// data offsets\nasync function unzipChunk(inputData) {\n try {\n let strm;\n let cpos = 0;\n let dpos = 0;\n const blocks = [];\n const cpositions = [];\n const dpositions = [];\n do {\n const remainingInput = inputData.slice(cpos);\n const inflator = new Inflate();\n ({ strm } = inflator);\n inflator.push(remainingInput, Z_SYNC_FLUSH);\n if (inflator.err) {\n throw new Error(inflator.msg);\n }\n const buffer = Buffer.from(inflator.result);\n blocks.push(buffer);\n cpositions.push(cpos);\n dpositions.push(dpos);\n cpos += strm.next_in;\n dpos += buffer.length;\n } while (strm.avail_in);\n const buffer = Buffer.concat(blocks);\n return { buffer, cpositions, dpositions };\n }\n catch (e) {\n //cleanup error message\n if (`${e}`.match(/incorrect header check/)) {\n throw new Error('problem decompressing block: incorrect gzip header check');\n }\n throw e;\n }\n}\n// similar to unzipChunk above but slices (0,minv.dataPosition) and\n// (maxv.dataPosition,end) off\nasync function unzipChunkSlice(inputData, chunk) {\n try {\n let strm;\n const { minv, maxv } = chunk;\n let cpos = minv.blockPosition;\n let dpos = minv.dataPosition;\n const chunks = [];\n const cpositions = [];\n const dpositions = [];\n let totalSize = 0;\n let i = 0;\n do {\n const remainingInput = inputData.subarray(cpos - minv.blockPosition);\n const inflator = new Inflate();\n ({ strm } = inflator);\n inflator.push(remainingInput, Z_SYNC_FLUSH);\n if (inflator.err) {\n throw new Error(inflator.msg);\n }\n const buffer = inflator.result;\n chunks.push(buffer);\n let len = buffer.length;\n cpositions.push(cpos);\n dpositions.push(dpos);\n if (chunks.length === 1 && minv.dataPosition) {\n // this is the first chunk, trim it\n chunks[0] = chunks[0].subarray(minv.dataPosition);\n len = chunks[0].length;\n }\n const origCpos = cpos;\n cpos += strm.next_in;\n dpos += len;\n if (origCpos >= maxv.blockPosition) {\n // this is the last chunk, trim it and stop decompressing\n // note if it is the same block is minv it subtracts that already\n // trimmed part of the slice length\n chunks[i] = chunks[i].subarray(0, maxv.blockPosition === minv.blockPosition\n ? maxv.dataPosition - minv.dataPosition + 1\n : maxv.dataPosition + 1);\n cpositions.push(cpos);\n dpositions.push(dpos);\n totalSize += chunks[i].length;\n break;\n }\n totalSize += chunks[i].length;\n i++;\n } while (strm.avail_in);\n const result = new Uint8Array(totalSize);\n for (let i = 0, offset = 0; i < chunks.length; i++) {\n result.set(chunks[i], offset);\n offset += chunks[i].length;\n }\n const buffer = Buffer.from(result);\n return { buffer, cpositions, dpositions };\n }\n catch (e) {\n //cleanup error message\n if (`${e}`.match(/incorrect header check/)) {\n throw new Error('problem decompressing block: incorrect gzip header check');\n }\n throw e;\n }\n}\nfunction nodeUnzip() {\n throw new Error('nodeUnzip not implemented.');\n}\nexport { unzip, unzipChunk, unzipChunkSlice, unzip as pakoUnzip, nodeUnzip };\n//# sourceMappingURL=unzip-pako.js.map","import Long from 'long';\nimport { unzip } from '@gmod/bgzf-filehandle';\nimport VirtualOffset, { fromBytes } from './virtualOffset';\nimport Chunk from './chunk';\nimport { longToNumber, abortBreakPoint, optimizeChunks } from './util';\nimport IndexFile from './indexFile';\nconst CSI1_MAGIC = 21582659; // CSI\\1\nconst CSI2_MAGIC = 38359875; // CSI\\2\nfunction lshift(num, bits) {\n return num * 2 ** bits;\n}\nfunction rshift(num, bits) {\n return Math.floor(num / 2 ** bits);\n}\nexport default class CSI extends IndexFile {\n constructor(args) {\n super(args);\n this.maxBinNumber = 0;\n this.depth = 0;\n this.minShift = 0;\n }\n async lineCount(refId) {\n const indexData = await this.parse();\n if (!indexData) {\n return -1;\n }\n const idx = indexData.indices[refId];\n if (!idx) {\n return -1;\n }\n const { stats } = indexData.indices[refId];\n if (stats) {\n return stats.lineCount;\n }\n return -1;\n }\n async indexCov() {\n return [];\n }\n parseAuxData(bytes, offset, auxLength) {\n if (auxLength < 30) {\n return {};\n }\n const data = {};\n data.formatFlags = bytes.readInt32LE(offset);\n data.coordinateType =\n data.formatFlags & 0x10000 ? 'zero-based-half-open' : '1-based-closed';\n data.format = { 0: 'generic', 1: 'SAM', 2: 'VCF' }[data.formatFlags & 0xf];\n if (!data.format) {\n throw new Error(`invalid Tabix preset format flags ${data.formatFlags}`);\n }\n data.columnNumbers = {\n ref: bytes.readInt32LE(offset + 4),\n start: bytes.readInt32LE(offset + 8),\n end: bytes.readInt32LE(offset + 12),\n };\n data.metaValue = bytes.readInt32LE(offset + 16);\n data.metaChar = data.metaValue ? String.fromCharCode(data.metaValue) : '';\n data.skipLines = bytes.readInt32LE(offset + 20);\n const nameSectionLength = bytes.readInt32LE(offset + 24);\n Object.assign(data, this._parseNameBytes(bytes.subarray(offset + 28, offset + 28 + nameSectionLength)));\n return data;\n }\n _parseNameBytes(namesBytes) {\n let currRefId = 0;\n let currNameStart = 0;\n const refIdToName = [];\n const refNameToId = {};\n for (let i = 0; i < namesBytes.length; i += 1) {\n if (!namesBytes[i]) {\n if (currNameStart < i) {\n let refName = namesBytes.toString('utf8', currNameStart, i);\n refName = this.renameRefSeq(refName);\n refIdToName[currRefId] = refName;\n refNameToId[refName] = currRefId;\n }\n currNameStart = i + 1;\n currRefId += 1;\n }\n }\n return { refNameToId, refIdToName };\n }\n // fetch and parse the index\n async _parse(opts) {\n const data = { csi: true, maxBlockSize: 1 << 16 };\n const buffer = (await this.filehandle.readFile(opts));\n const bytes = await unzip(buffer);\n // check TBI magic numbers\n if (bytes.readUInt32LE(0) === CSI1_MAGIC) {\n data.csiVersion = 1;\n }\n else if (bytes.readUInt32LE(0) === CSI2_MAGIC) {\n data.csiVersion = 2;\n }\n else {\n throw new Error('Not a CSI file');\n // TODO: do we need to support big-endian CSI files?\n }\n this.minShift = bytes.readInt32LE(4);\n this.depth = bytes.readInt32LE(8);\n this.maxBinNumber = ((1 << ((this.depth + 1) * 3)) - 1) / 7;\n const auxLength = bytes.readInt32LE(12);\n if (auxLength) {\n Object.assign(data, this.parseAuxData(bytes, 16, auxLength));\n }\n data.refCount = bytes.readInt32LE(16 + auxLength);\n // read the indexes for each reference sequence\n data.indices = new Array(data.refCount);\n let currOffset = 16 + auxLength + 4;\n for (let i = 0; i < data.refCount; i += 1) {\n await abortBreakPoint(opts.signal);\n // the binning index\n const binCount = bytes.readInt32LE(currOffset);\n currOffset += 4;\n const binIndex = {};\n let stats; // < provided by parsing a pseudo-bin, if present\n for (let j = 0; j < binCount; j += 1) {\n const bin = bytes.readUInt32LE(currOffset);\n if (bin > this.maxBinNumber) {\n // this is a fake bin that actually has stats information\n // about the reference sequence in it\n stats = this.parsePseudoBin(bytes, currOffset + 4);\n currOffset += 4 + 8 + 4 + 16 + 16;\n }\n else {\n const loffset = fromBytes(bytes, currOffset + 4);\n this._findFirstData(data, loffset);\n const chunkCount = bytes.readInt32LE(currOffset + 12);\n currOffset += 16;\n const chunks = new Array(chunkCount);\n for (let k = 0; k < chunkCount; k += 1) {\n const u = fromBytes(bytes, currOffset);\n const v = fromBytes(bytes, currOffset + 8);\n currOffset += 16;\n // this._findFirstData(data, u)\n chunks[k] = new Chunk(u, v, bin);\n }\n binIndex[bin] = chunks;\n }\n }\n data.indices[i] = { binIndex, stats };\n }\n return data;\n }\n parsePseudoBin(bytes, offset) {\n const lineCount = longToNumber(Long.fromBytesLE(Array.prototype.slice.call(bytes, offset + 28, offset + 36), true));\n return { lineCount };\n }\n async blocksForRange(refId, min, max, opts = {}) {\n if (min < 0) {\n min = 0;\n }\n const indexData = await this.parse(opts);\n const ba = indexData === null || indexData === void 0 ? void 0 : indexData.indices[refId];\n if (!ba) {\n return [];\n }\n const overlappingBins = this.reg2bins(min, max); // List of bin #s that overlap min, max\n const chunks = [];\n // Find chunks in overlapping bins. Leaf bins (< 4681) are not pruned\n for (const [start, end] of overlappingBins) {\n for (let bin = start; bin <= end; bin++) {\n if (ba.binIndex[bin]) {\n const binChunks = ba.binIndex[bin];\n for (let c = 0; c < binChunks.length; ++c) {\n chunks.push(new Chunk(binChunks[c].minv, binChunks[c].maxv, bin));\n }\n }\n }\n }\n return optimizeChunks(chunks, new VirtualOffset(0, 0));\n }\n /**\n * calculate the list of bins that may overlap with region [beg,end)\n * (zero-based half-open)\n */\n reg2bins(beg, end) {\n beg -= 1; // < convert to 1-based closed\n if (beg < 1) {\n beg = 1;\n }\n if (end > 2 ** 50) {\n end = 2 ** 34;\n } // 17 GiB ought to be enough for anybody\n end -= 1;\n let l = 0;\n let t = 0;\n let s = this.minShift + this.depth * 3;\n const bins = [];\n for (; l <= this.depth; s -= 3, t += lshift(1, l * 3), l += 1) {\n const b = t + rshift(beg, s);\n const e = t + rshift(end, s);\n if (e - b + bins.length > this.maxBinNumber) {\n throw new Error(`query ${beg}-${end} is too large for current binning scheme (shift ${this.minShift}, depth ${this.depth}), try a smaller query or a coarser index binning scheme`);\n }\n bins.push([b, e]);\n }\n return bins;\n }\n}\n//# sourceMappingURL=csi.js.map","var Buffer = require('buffer').Buffer;\n\nvar CRC_TABLE = [\n 0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419,\n 0x706af48f, 0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4,\n 0xe0d5e91e, 0x97d2d988, 0x09b64c2b, 0x7eb17cbd, 0xe7b82d07,\n 0x90bf1d91, 0x1db71064, 0x6ab020f2, 0xf3b97148, 0x84be41de,\n 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7, 0x136c9856,\n 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9,\n 0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4,\n 0xa2677172, 0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b,\n 0x35b5a8fa, 0x42b2986c, 0xdbbbc9d6, 0xacbcf940, 0x32d86ce3,\n 0x45df5c75, 0xdcd60dcf, 0xabd13d59, 0x26d930ac, 0x51de003a,\n 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423, 0xcfba9599,\n 0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,\n 0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190,\n 0x01db7106, 0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f,\n 0x9fbfe4a5, 0xe8b8d433, 0x7807c9a2, 0x0f00f934, 0x9609a88e,\n 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d, 0x91646c97, 0xe6635c01,\n 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e, 0x6c0695ed,\n 0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950,\n 0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3,\n 0xfbd44c65, 0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2,\n 0x4adfa541, 0x3dd895d7, 0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a,\n 0x346ed9fc, 0xad678846, 0xda60b8d0, 0x44042d73, 0x33031de5,\n 0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa, 0xbe0b1010,\n 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,\n 0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17,\n 0x2eb40d81, 0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6,\n 0x03b6e20c, 0x74b1d29a, 0xead54739, 0x9dd277af, 0x04db2615,\n 0x73dc1683, 0xe3630b12, 0x94643b84, 0x0d6d6a3e, 0x7a6a5aa8,\n 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1, 0xf00f9344,\n 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb,\n 0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a,\n 0x67dd4acc, 0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5,\n 0xd6d6a3e8, 0xa1d1937e, 0x38d8c2c4, 0x4fdff252, 0xd1bb67f1,\n 0xa6bc5767, 0x3fb506dd, 0x48b2364b, 0xd80d2bda, 0xaf0a1b4c,\n 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55, 0x316e8eef,\n 0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,\n 0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe,\n 0xb2bd0b28, 0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31,\n 0x2cd99e8b, 0x5bdeae1d, 0x9b64c2b0, 0xec63f226, 0x756aa39c,\n 0x026d930a, 0x9c0906a9, 0xeb0e363f, 0x72076785, 0x05005713,\n 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38, 0x92d28e9b,\n 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242,\n 0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1,\n 0x18b74777, 0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c,\n 0x8f659eff, 0xf862ae69, 0x616bffd3, 0x166ccf45, 0xa00ae278,\n 0xd70dd2ee, 0x4e048354, 0x3903b3c2, 0xa7672661, 0xd06016f7,\n 0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc, 0x40df0b66,\n 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,\n 0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605,\n 0xcdd70693, 0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8,\n 0x5d681b02, 0x2a6f2b94, 0xb40bbe37, 0xc30c8ea1, 0x5a05df1b,\n 0x2d02ef8d\n];\n\nif (typeof Int32Array !== 'undefined') {\n CRC_TABLE = new Int32Array(CRC_TABLE);\n}\n\nfunction ensureBuffer(input) {\n if (Buffer.isBuffer(input)) {\n return input;\n }\n\n var hasNewBufferAPI =\n typeof Buffer.alloc === \"function\" &&\n typeof Buffer.from === \"function\";\n\n if (typeof input === \"number\") {\n return hasNewBufferAPI ? Buffer.alloc(input) : new Buffer(input);\n }\n else if (typeof input === \"string\") {\n return hasNewBufferAPI ? Buffer.from(input) : new Buffer(input);\n }\n else {\n throw new Error(\"input must be buffer, number, or string, received \" +\n typeof input);\n }\n}\n\nfunction bufferizeInt(num) {\n var tmp = ensureBuffer(4);\n tmp.writeInt32BE(num, 0);\n return tmp;\n}\n\nfunction _crc32(buf, previous) {\n buf = ensureBuffer(buf);\n if (Buffer.isBuffer(previous)) {\n previous = previous.readUInt32BE(0);\n }\n var crc = ~~previous ^ -1;\n for (var n = 0; n < buf.length; n++) {\n crc = CRC_TABLE[(crc ^ buf[n]) & 0xff] ^ (crc >>> 8);\n }\n return (crc ^ -1);\n}\n\nfunction crc32() {\n return bufferizeInt(_crc32.apply(null, arguments));\n}\ncrc32.signed = function () {\n return _crc32.apply(null, arguments);\n};\ncrc32.unsigned = function () {\n return _crc32.apply(null, arguments) >>> 0;\n};\n\nmodule.exports = crc32;\n","'use strict'\n\nvar has = function (obj, prop) { return Object.prototype.hasOwnProperty.call(obj, prop) }\nvar isEnumerable = function (obj, prop) {\n return Object.prototype.propertyIsEnumerable.call(obj, prop)\n}\n\nfunction entries (obj) {\n if (obj == null) {\n throw new TypeError('Cannot convert undefined or null to object')\n }\n var pairs = []\n for (var key in obj) {\n if (has(obj, key) && isEnumerable(obj, key)) {\n pairs.push([key, obj[key]])\n }\n }\n return pairs\n}\n\nmodule.exports = entries\n","module.exports = typeof Object.entries === 'function' ? Object.entries : require('./entries')\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nfunction _classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n}\n\nfunction _defineProperties(target, props) {\n for (var i = 0; i < props.length; i++) {\n var descriptor = props[i];\n descriptor.enumerable = descriptor.enumerable || false;\n descriptor.configurable = true;\n if (\"value\" in descriptor) descriptor.writable = true;\n Object.defineProperty(target, descriptor.key, descriptor);\n }\n}\n\nfunction _createClass(Constructor, protoProps, staticProps) {\n if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n if (staticProps) _defineProperties(Constructor, staticProps);\n Object.defineProperty(Constructor, \"prototype\", {\n writable: false\n });\n return Constructor;\n}\n\nfunction _inherits(subClass, superClass) {\n if (typeof superClass !== \"function\" && superClass !== null) {\n throw new TypeError(\"Super expression must either be null or a function\");\n }\n\n subClass.prototype = Object.create(superClass && superClass.prototype, {\n constructor: {\n value: subClass,\n writable: true,\n configurable: true\n }\n });\n Object.defineProperty(subClass, \"prototype\", {\n writable: false\n });\n if (superClass) _setPrototypeOf(subClass, superClass);\n}\n\nfunction _getPrototypeOf(o) {\n _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) {\n return o.__proto__ || Object.getPrototypeOf(o);\n };\n return _getPrototypeOf(o);\n}\n\nfunction _setPrototypeOf(o, p) {\n _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) {\n o.__proto__ = p;\n return o;\n };\n return _setPrototypeOf(o, p);\n}\n\nfunction _isNativeReflectConstruct() {\n if (typeof Reflect === \"undefined\" || !Reflect.construct) return false;\n if (Reflect.construct.sham) return false;\n if (typeof Proxy === \"function\") return true;\n\n try {\n Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {}));\n return true;\n } catch (e) {\n return false;\n }\n}\n\nfunction _assertThisInitialized(self) {\n if (self === void 0) {\n throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n }\n\n return self;\n}\n\nfunction _possibleConstructorReturn(self, call) {\n if (call && (typeof call === \"object\" || typeof call === \"function\")) {\n return call;\n } else if (call !== void 0) {\n throw new TypeError(\"Derived constructors may only return object or undefined\");\n }\n\n return _assertThisInitialized(self);\n}\n\nfunction _createSuper(Derived) {\n var hasNativeReflectConstruct = _isNativeReflectConstruct();\n\n return function _createSuperInternal() {\n var Super = _getPrototypeOf(Derived),\n result;\n\n if (hasNativeReflectConstruct) {\n var NewTarget = _getPrototypeOf(this).constructor;\n\n result = Reflect.construct(Super, arguments, NewTarget);\n } else {\n result = Super.apply(this, arguments);\n }\n\n return _possibleConstructorReturn(this, result);\n };\n}\n\nfunction _superPropBase(object, property) {\n while (!Object.prototype.hasOwnProperty.call(object, property)) {\n object = _getPrototypeOf(object);\n if (object === null) break;\n }\n\n return object;\n}\n\nfunction _get() {\n if (typeof Reflect !== \"undefined\" && Reflect.get) {\n _get = Reflect.get.bind();\n } else {\n _get = function _get(target, property, receiver) {\n var base = _superPropBase(target, property);\n\n if (!base) return;\n var desc = Object.getOwnPropertyDescriptor(base, property);\n\n if (desc.get) {\n return desc.get.call(arguments.length < 3 ? target : receiver);\n }\n\n return desc.value;\n };\n }\n\n return _get.apply(this, arguments);\n}\n\nvar Emitter = /*#__PURE__*/function () {\n function Emitter() {\n _classCallCheck(this, Emitter);\n\n Object.defineProperty(this, 'listeners', {\n value: {},\n writable: true,\n configurable: true\n });\n }\n\n _createClass(Emitter, [{\n key: \"addEventListener\",\n value: function addEventListener(type, callback, options) {\n if (!(type in this.listeners)) {\n this.listeners[type] = [];\n }\n\n this.listeners[type].push({\n callback: callback,\n options: options\n });\n }\n }, {\n key: \"removeEventListener\",\n value: function removeEventListener(type, callback) {\n if (!(type in this.listeners)) {\n return;\n }\n\n var stack = this.listeners[type];\n\n for (var i = 0, l = stack.length; i < l; i++) {\n if (stack[i].callback === callback) {\n stack.splice(i, 1);\n return;\n }\n }\n }\n }, {\n key: \"dispatchEvent\",\n value: function dispatchEvent(event) {\n if (!(event.type in this.listeners)) {\n return;\n }\n\n var stack = this.listeners[event.type];\n var stackToCall = stack.slice();\n\n for (var i = 0, l = stackToCall.length; i < l; i++) {\n var listener = stackToCall[i];\n\n try {\n listener.callback.call(this, event);\n } catch (e) {\n Promise.resolve().then(function () {\n throw e;\n });\n }\n\n if (listener.options && listener.options.once) {\n this.removeEventListener(event.type, listener.callback);\n }\n }\n\n return !event.defaultPrevented;\n }\n }]);\n\n return Emitter;\n}();\n\nvar AbortSignal = /*#__PURE__*/function (_Emitter) {\n _inherits(AbortSignal, _Emitter);\n\n var _super = _createSuper(AbortSignal);\n\n function AbortSignal() {\n var _this;\n\n _classCallCheck(this, AbortSignal);\n\n _this = _super.call(this); // Some versions of babel does not transpile super() correctly for IE <= 10, if the parent\n // constructor has failed to run, then \"this.listeners\" will still be undefined and then we call\n // the parent constructor directly instead as a workaround. For general details, see babel bug:\n // https://github.com/babel/babel/issues/3041\n // This hack was added as a fix for the issue described here:\n // https://github.com/Financial-Times/polyfill-library/pull/59#issuecomment-477558042\n\n if (!_this.listeners) {\n Emitter.call(_assertThisInitialized(_this));\n } // Compared to assignment, Object.defineProperty makes properties non-enumerable by default and\n // we want Object.keys(new AbortController().signal) to be [] for compat with the native impl\n\n\n Object.defineProperty(_assertThisInitialized(_this), 'aborted', {\n value: false,\n writable: true,\n configurable: true\n });\n Object.defineProperty(_assertThisInitialized(_this), 'onabort', {\n value: null,\n writable: true,\n configurable: true\n });\n Object.defineProperty(_assertThisInitialized(_this), 'reason', {\n value: undefined,\n writable: true,\n configurable: true\n });\n return _this;\n }\n\n _createClass(AbortSignal, [{\n key: \"toString\",\n value: function toString() {\n return '[object AbortSignal]';\n }\n }, {\n key: \"dispatchEvent\",\n value: function dispatchEvent(event) {\n if (event.type === 'abort') {\n this.aborted = true;\n\n if (typeof this.onabort === 'function') {\n this.onabort.call(this, event);\n }\n }\n\n _get(_getPrototypeOf(AbortSignal.prototype), \"dispatchEvent\", this).call(this, event);\n }\n }]);\n\n return AbortSignal;\n}(Emitter);\nvar AbortController = /*#__PURE__*/function () {\n function AbortController() {\n _classCallCheck(this, AbortController);\n\n // Compared to assignment, Object.defineProperty makes properties non-enumerable by default and\n // we want Object.keys(new AbortController()) to be [] for compat with the native impl\n Object.defineProperty(this, 'signal', {\n value: new AbortSignal(),\n writable: true,\n configurable: true\n });\n }\n\n _createClass(AbortController, [{\n key: \"abort\",\n value: function abort(reason) {\n var event;\n\n try {\n event = new Event('abort');\n } catch (e) {\n if (typeof document !== 'undefined') {\n if (!document.createEvent) {\n // For Internet Explorer 8:\n event = document.createEventObject();\n event.type = 'abort';\n } else {\n // For Internet Explorer 11:\n event = document.createEvent('Event');\n event.initEvent('abort', false, false);\n }\n } else {\n // Fallback where document isn't available:\n event = {\n type: 'abort',\n bubbles: false,\n cancelable: false\n };\n }\n }\n\n var signalReason = reason;\n\n if (signalReason === undefined) {\n if (typeof document === 'undefined') {\n signalReason = new Error('This operation was aborted');\n signalReason.name = 'AbortError';\n } else {\n try {\n signalReason = new DOMException('signal is aborted without reason');\n } catch (err) {\n // IE 11 does not support calling the DOMException constructor, use a\n // regular error object on it instead.\n signalReason = new Error('This operation was aborted');\n signalReason.name = 'AbortError';\n }\n }\n }\n\n this.signal.reason = signalReason;\n this.signal.dispatchEvent(event);\n }\n }, {\n key: \"toString\",\n value: function toString() {\n return '[object AbortController]';\n }\n }]);\n\n return AbortController;\n}();\n\nif (typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n // These are necessary to make sure that we get correct output for:\n // Object.prototype.toString.call(new AbortController())\n AbortController.prototype[Symbol.toStringTag] = 'AbortController';\n AbortSignal.prototype[Symbol.toStringTag] = 'AbortSignal';\n}\n\nfunction polyfillNeeded(self) {\n if (self.__FORCE_INSTALL_ABORTCONTROLLER_POLYFILL) {\n console.log('__FORCE_INSTALL_ABORTCONTROLLER_POLYFILL=true is set, will force install polyfill');\n return true;\n } // Note that the \"unfetch\" minimal fetch polyfill defines fetch() without\n // defining window.Request, and this polyfill need to work on top of unfetch\n // so the below feature detection needs the !self.AbortController part.\n // The Request.prototype check is also needed because Safari versions 11.1.2\n // up to and including 12.1.x has a window.AbortController present but still\n // does NOT correctly implement abortable fetch:\n // https://bugs.webkit.org/show_bug.cgi?id=174980#c2\n\n\n return typeof self.Request === 'function' && !self.Request.prototype.hasOwnProperty('signal') || !self.AbortController;\n}\n\n/**\n * Note: the \"fetch.Request\" default value is available for fetch imported from\n * the \"node-fetch\" package and not in browsers. This is OK since browsers\n * will be importing umd-polyfill.js from that path \"self\" is passed the\n * decorator so the default value will not be used (because browsers that define\n * fetch also has Request). One quirky setup where self.fetch exists but\n * self.Request does not is when the \"unfetch\" minimal fetch polyfill is used\n * on top of IE11; for this case the browser will try to use the fetch.Request\n * default value which in turn will be undefined but then then \"if (Request)\"\n * will ensure that you get a patched fetch but still no Request (as expected).\n * @param {fetch, Request = fetch.Request}\n * @returns {fetch: abortableFetch, Request: AbortableRequest}\n */\n\nfunction abortableFetchDecorator(patchTargets) {\n if ('function' === typeof patchTargets) {\n patchTargets = {\n fetch: patchTargets\n };\n }\n\n var _patchTargets = patchTargets,\n fetch = _patchTargets.fetch,\n _patchTargets$Request = _patchTargets.Request,\n NativeRequest = _patchTargets$Request === void 0 ? fetch.Request : _patchTargets$Request,\n NativeAbortController = _patchTargets.AbortController,\n _patchTargets$__FORCE = _patchTargets.__FORCE_INSTALL_ABORTCONTROLLER_POLYFILL,\n __FORCE_INSTALL_ABORTCONTROLLER_POLYFILL = _patchTargets$__FORCE === void 0 ? false : _patchTargets$__FORCE;\n\n if (!polyfillNeeded({\n fetch: fetch,\n Request: NativeRequest,\n AbortController: NativeAbortController,\n __FORCE_INSTALL_ABORTCONTROLLER_POLYFILL: __FORCE_INSTALL_ABORTCONTROLLER_POLYFILL\n })) {\n return {\n fetch: fetch,\n Request: Request\n };\n }\n\n var Request = NativeRequest; // Note that the \"unfetch\" minimal fetch polyfill defines fetch() without\n // defining window.Request, and this polyfill need to work on top of unfetch\n // hence we only patch it if it's available. Also we don't patch it if signal\n // is already available on the Request prototype because in this case support\n // is present and the patching below can cause a crash since it assigns to\n // request.signal which is technically a read-only property. This latter error\n // happens when you run the main5.js node-fetch example in the repo\n // \"abortcontroller-polyfill-examples\". The exact error is:\n // request.signal = init.signal;\n // ^\n // TypeError: Cannot set property signal of #<Request> which has only a getter\n\n if (Request && !Request.prototype.hasOwnProperty('signal') || __FORCE_INSTALL_ABORTCONTROLLER_POLYFILL) {\n Request = function Request(input, init) {\n var signal;\n\n if (init && init.signal) {\n signal = init.signal; // Never pass init.signal to the native Request implementation when the polyfill has\n // been installed because if we're running on top of a browser with a\n // working native AbortController (i.e. the polyfill was installed due to\n // __FORCE_INSTALL_ABORTCONTROLLER_POLYFILL being set), then passing our\n // fake AbortSignal to the native fetch will trigger:\n // TypeError: Failed to construct 'Request': member signal is not of type AbortSignal.\n\n delete init.signal;\n }\n\n var request = new NativeRequest(input, init);\n\n if (signal) {\n Object.defineProperty(request, 'signal', {\n writable: false,\n enumerable: false,\n configurable: true,\n value: signal\n });\n }\n\n return request;\n };\n\n Request.prototype = NativeRequest.prototype;\n }\n\n var realFetch = fetch;\n\n var abortableFetch = function abortableFetch(input, init) {\n var signal = Request && Request.prototype.isPrototypeOf(input) ? input.signal : init ? init.signal : undefined;\n\n if (signal) {\n var abortError;\n\n try {\n abortError = new DOMException('Aborted', 'AbortError');\n } catch (err) {\n // IE 11 does not support calling the DOMException constructor, use a\n // regular error object on it instead.\n abortError = new Error('Aborted');\n abortError.name = 'AbortError';\n } // Return early if already aborted, thus avoiding making an HTTP request\n\n\n if (signal.aborted) {\n return Promise.reject(abortError);\n } // Turn an event into a promise, reject it once `abort` is dispatched\n\n\n var cancellation = new Promise(function (_, reject) {\n signal.addEventListener('abort', function () {\n return reject(abortError);\n }, {\n once: true\n });\n });\n\n if (init && init.signal) {\n // Never pass .signal to the native implementation when the polyfill has\n // been installed because if we're running on top of a browser with a\n // working native AbortController (i.e. the polyfill was installed due to\n // __FORCE_INSTALL_ABORTCONTROLLER_POLYFILL being set), then passing our\n // fake AbortSignal to the native fetch will trigger:\n // TypeError: Failed to execute 'fetch' on 'Window': member signal is not of type AbortSignal.\n delete init.signal;\n } // Return the fastest promise (don't need to wait for request to finish)\n\n\n return Promise.race([cancellation, realFetch(input, init)]);\n }\n\n return realFetch(input, init);\n };\n\n return {\n fetch: abortableFetch,\n Request: Request\n };\n}\n\nexports.AbortController = AbortController;\nexports.AbortSignal = AbortSignal;\nexports.abortableFetch = abortableFetchDecorator;\n","\"use strict\";\n/* eslint-disable */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AbortSignal = exports.AbortController = void 0;\nconst cjs_ponyfill_1 = require(\"abortcontroller-polyfill/dist/cjs-ponyfill\");\nvar getGlobal = function () {\n // the only reliable means to get the global object is\n // `Function('return this')()`\n // However, this causes CSP violations in Chrome apps.\n if (typeof self !== 'undefined') {\n return self;\n }\n if (typeof window !== 'undefined') {\n return window;\n }\n if (typeof global !== 'undefined') {\n return global;\n }\n throw new Error('unable to locate global object');\n};\n//@ts-ignore\nlet AbortController = typeof getGlobal().AbortController === 'undefined' ? cjs_ponyfill_1.AbortController : getGlobal().AbortController;\nexports.AbortController = AbortController;\n//@ts-ignore\nlet AbortSignal = typeof getGlobal().AbortController === 'undefined' ? cjs_ponyfill_1.AbortSignal : getGlobal().AbortSignal;\nexports.AbortSignal = AbortSignal;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst abortcontroller_ponyfill_1 = require(\"./abortcontroller-ponyfill\");\nclass NullSignal {\n}\n/**\n * aggregates a number of abort signals, will only fire the aggregated\n * abort if all of the input signals have been aborted\n */\nclass AggregateAbortController {\n constructor() {\n this.signals = new Set();\n this.abortController = new abortcontroller_ponyfill_1.AbortController();\n }\n /**\n * @param {AbortSignal} [signal] optional AbortSignal to add. if falsy,\n * will be treated as a null-signal, and this abortcontroller will no\n * longer be abortable.\n */\n //@ts-ignore\n addSignal(signal = new NullSignal()) {\n if (this.signal.aborted) {\n throw new Error('cannot add a signal, already aborted!');\n }\n // note that a NullSignal will never fire, so if we\n // have one this thing will never actually abort\n this.signals.add(signal);\n if (signal.aborted) {\n // handle the abort immediately if it is already aborted\n // for some reason\n this.handleAborted(signal);\n }\n else if (typeof signal.addEventListener === 'function') {\n signal.addEventListener('abort', () => {\n this.handleAborted(signal);\n });\n }\n }\n handleAborted(signal) {\n this.signals.delete(signal);\n if (this.signals.size === 0) {\n this.abortController.abort();\n }\n }\n get signal() {\n return this.abortController.signal;\n }\n abort() {\n this.abortController.abort();\n }\n}\nexports.default = AggregateAbortController;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nclass AggregateStatusReporter {\n constructor() {\n this.callbacks = new Set();\n }\n addCallback(callback = () => { }) {\n this.callbacks.add(callback);\n callback(this.currentMessage);\n }\n callback(message) {\n this.currentMessage = message;\n this.callbacks.forEach(elt => {\n elt(message);\n });\n }\n}\nexports.default = AggregateStatusReporter;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst abortcontroller_ponyfill_1 = require(\"./abortcontroller-ponyfill\");\nconst AggregateAbortController_1 = __importDefault(require(\"./AggregateAbortController\"));\nconst AggregateStatusReporter_1 = __importDefault(require(\"./AggregateStatusReporter\"));\nclass AbortablePromiseCache {\n constructor({ fill, cache, }) {\n if (typeof fill !== 'function') {\n throw new TypeError('must pass a fill function');\n }\n if (typeof cache !== 'object') {\n throw new TypeError('must pass a cache object');\n }\n if (typeof cache.get !== 'function' ||\n typeof cache.set !== 'function' ||\n typeof cache.delete !== 'function') {\n throw new TypeError('cache must implement get(key), set(key, val), and and delete(key)');\n }\n this.cache = cache;\n this.fillCallback = fill;\n }\n static isAbortException(exception) {\n return (\n // DOMException\n exception.name === 'AbortError' ||\n // standard-ish non-DOM abort exception\n //@ts-ignore\n exception.code === 'ERR_ABORTED' ||\n // stringified DOMException\n exception.message === 'AbortError: aborted' ||\n // stringified standard-ish exception\n exception.message === 'Error: aborted');\n }\n evict(key, entry) {\n if (this.cache.get(key) === entry) {\n this.cache.delete(key);\n }\n }\n fill(key, data, signal, statusCallback) {\n const aborter = new AggregateAbortController_1.default();\n const statusReporter = new AggregateStatusReporter_1.default();\n statusReporter.addCallback(statusCallback);\n const newEntry = {\n aborter: aborter,\n promise: this.fillCallback(data, aborter.signal, (message) => {\n statusReporter.callback(message);\n }),\n settled: false,\n statusReporter,\n get aborted() {\n return this.aborter.signal.aborted;\n },\n };\n newEntry.aborter.addSignal(signal);\n // remove the fill from the cache when its abortcontroller fires, if still in there\n newEntry.aborter.signal.addEventListener('abort', () => {\n if (!newEntry.settled) {\n this.evict(key, newEntry);\n }\n });\n // chain off the cached promise to record when it settles\n newEntry.promise\n .then(() => {\n newEntry.settled = true;\n }, () => {\n newEntry.settled = true;\n // if the fill throws an error (including abort) and is still in the cache, remove it\n this.evict(key, newEntry);\n })\n .catch(e => {\n // this will only be reached if there is some kind of\n // bad bug in this library\n console.error(e);\n throw e;\n });\n this.cache.set(key, newEntry);\n }\n static checkSinglePromise(promise, signal) {\n // check just this signal for having been aborted, and abort the\n // promise if it was, regardless of what happened with the cached\n // response\n function checkForSingleAbort() {\n if (signal && signal.aborted) {\n throw Object.assign(new Error('aborted'), { code: 'ERR_ABORTED' });\n }\n }\n return promise.then(result => {\n checkForSingleAbort();\n return result;\n }, error => {\n checkForSingleAbort();\n throw error;\n });\n }\n has(key) {\n return this.cache.has(key);\n }\n /**\n * Callback for getting status of the pending async\n *\n * @callback statusCallback\n * @param {any} status, current status string or message object\n */\n /**\n * @param {any} key cache key to use for this request\n * @param {any} data data passed as the first argument to the fill callback\n * @param {AbortSignal} [signal] optional AbortSignal object that aborts the request\n * @param {statusCallback} a callback to get the current status of a pending async operation\n */\n get(key, data, signal, statusCallback) {\n if (!signal && data instanceof abortcontroller_ponyfill_1.AbortSignal) {\n throw new TypeError('second get argument appears to be an AbortSignal, perhaps you meant to pass `null` for the fill data?');\n }\n const cacheEntry = this.cache.get(key);\n if (cacheEntry) {\n if (cacheEntry.aborted && !cacheEntry.settled) {\n // if it's aborted but has not realized it yet, evict it and redispatch\n this.evict(key, cacheEntry);\n return this.get(key, data, signal, statusCallback);\n }\n if (cacheEntry.settled) {\n // too late to abort, just return it\n return cacheEntry.promise;\n }\n // request is in-flight, add this signal to its list of signals,\n // or if there is no signal, the aborter will become non-abortable\n cacheEntry.aborter.addSignal(signal);\n cacheEntry.statusReporter.addCallback(statusCallback);\n return AbortablePromiseCache.checkSinglePromise(cacheEntry.promise, signal);\n }\n // if we got here, it is not in the cache. fill.\n this.fill(key, data, signal, statusCallback);\n return AbortablePromiseCache.checkSinglePromise(\n //see https://www.typescriptlang.org/docs/handbook/2/everyday-types.html#non-null-assertion-operator-postfix-\n //eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n this.cache.get(key).promise, signal);\n }\n /**\n * delete the given entry from the cache. if it exists and its fill request has\n * not yet settled, the fill will be signaled to abort.\n *\n * @param {any} key\n */\n delete(key) {\n const cachedEntry = this.cache.get(key);\n if (cachedEntry) {\n if (!cachedEntry.settled) {\n cachedEntry.aborter.abort();\n }\n this.cache.delete(key);\n }\n }\n /**\n * Clear all requests from the cache. Aborts any that have not settled.\n * @returns {number} count of entries deleted\n */\n clear() {\n // iterate without needing regenerator-runtime\n const keyIter = this.cache.keys();\n let deleteCount = 0;\n for (let result = keyIter.next(); !result.done; result = keyIter.next()) {\n this.delete(result.value);\n deleteCount += 1;\n }\n return deleteCount;\n }\n}\nexports.default = AbortablePromiseCache;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst AbortablePromiseCache_1 = __importDefault(require(\"./AbortablePromiseCache\"));\nexports.default = AbortablePromiseCache_1.default;\n","'use strict';\n\nclass QuickLRU {\n\tconstructor(options = {}) {\n\t\tif (!(options.maxSize && options.maxSize > 0)) {\n\t\t\tthrow new TypeError('`maxSize` must be a number greater than 0');\n\t\t}\n\n\t\tthis.maxSize = options.maxSize;\n\t\tthis.cache = new Map();\n\t\tthis.oldCache = new Map();\n\t\tthis._size = 0;\n\t}\n\n\t_set(key, value) {\n\t\tthis.cache.set(key, value);\n\t\tthis._size++;\n\n\t\tif (this._size >= this.maxSize) {\n\t\t\tthis._size = 0;\n\t\t\tthis.oldCache = this.cache;\n\t\t\tthis.cache = new Map();\n\t\t}\n\t}\n\n\tget(key) {\n\t\tif (this.cache.has(key)) {\n\t\t\treturn this.cache.get(key);\n\t\t}\n\n\t\tif (this.oldCache.has(key)) {\n\t\t\tconst value = this.oldCache.get(key);\n\t\t\tthis._set(key, value);\n\t\t\treturn value;\n\t\t}\n\t}\n\n\tset(key, value) {\n\t\tif (this.cache.has(key)) {\n\t\t\tthis.cache.set(key, value);\n\t\t} else {\n\t\t\tthis._set(key, value);\n\t\t}\n\n\t\treturn this;\n\t}\n\n\thas(key) {\n\t\treturn this.cache.has(key) || this.oldCache.has(key);\n\t}\n\n\tpeek(key) {\n\t\tif (this.cache.has(key)) {\n\t\t\treturn this.cache.get(key);\n\t\t}\n\n\t\tif (this.oldCache.has(key)) {\n\t\t\treturn this.oldCache.get(key);\n\t\t}\n\t}\n\n\tdelete(key) {\n\t\tconst deleted = this.cache.delete(key);\n\t\tif (deleted) {\n\t\t\tthis._size--;\n\t\t}\n\n\t\treturn this.oldCache.delete(key) || deleted;\n\t}\n\n\tclear() {\n\t\tthis.cache.clear();\n\t\tthis.oldCache.clear();\n\t\tthis._size = 0;\n\t}\n\n\t* keys() {\n\t\tfor (const [key] of this) {\n\t\t\tyield key;\n\t\t}\n\t}\n\n\t* values() {\n\t\tfor (const [, value] of this) {\n\t\t\tyield value;\n\t\t}\n\t}\n\n\t* [Symbol.iterator]() {\n\t\tfor (const item of this.cache) {\n\t\t\tyield item;\n\t\t}\n\n\t\tfor (const item of this.oldCache) {\n\t\t\tconst [key] = item;\n\t\t\tif (!this.cache.has(key)) {\n\t\t\t\tyield item;\n\t\t\t}\n\t\t}\n\t}\n\n\tget size() {\n\t\tlet oldCacheSize = 0;\n\t\tfor (const key of this.oldCache.keys()) {\n\t\t\tif (!this.cache.has(key)) {\n\t\t\t\toldCacheSize++;\n\t\t\t}\n\t\t}\n\n\t\treturn this._size + oldCacheSize;\n\t}\n}\n\nmodule.exports = QuickLRU;\n","export default {\n // the read is paired in sequencing, no matter whether it is mapped in a pair\n BAM_FPAIRED: 1,\n // the read is mapped in a proper pair\n BAM_FPROPER_PAIR: 2,\n // the read itself is unmapped; conflictive with BAM_FPROPER_PAIR\n BAM_FUNMAP: 4,\n // the mate is unmapped\n BAM_FMUNMAP: 8,\n // the read is mapped to the reverse strand\n BAM_FREVERSE: 16,\n // the mate is mapped to the reverse strand\n BAM_FMREVERSE: 32,\n // this is read1\n BAM_FREAD1: 64,\n // this is read2\n BAM_FREAD2: 128,\n // not primary alignment\n BAM_FSECONDARY: 256,\n // QC failure\n BAM_FQCFAIL: 512,\n // optical or PCR duplicate\n BAM_FDUP: 1024,\n // supplementary alignment\n BAM_FSUPPLEMENTARY: 2048,\n};\n//# sourceMappingURL=constants.js.map","/* eslint-disable @typescript-eslint/no-empty-function */\nimport Constants from './constants';\nconst SEQRET_DECODER = '=ACMGRSVTWYHKDBN'.split('');\nconst CIGAR_DECODER = 'MIDNSHP=X???????'.split('');\n/**\n * Class of each BAM record returned by this API.\n */\nexport default class BamRecord {\n constructor(args) {\n this.data = {};\n this._tagList = [];\n this._allTagsParsed = false;\n const { bytes, fileOffset } = args;\n const { byteArray, start } = bytes;\n this.data = {};\n this.bytes = bytes;\n this._id = fileOffset;\n this._refID = byteArray.readInt32LE(start + 4);\n this.data.start = byteArray.readInt32LE(start + 8);\n this.flags = (byteArray.readInt32LE(start + 16) & 0xffff0000) >> 16;\n }\n get(field) {\n //@ts-ignore\n if (this[field]) {\n //@ts-ignore\n if (this.data[field]) {\n return this.data[field];\n }\n //@ts-ignore\n this.data[field] = this[field]();\n return this.data[field];\n }\n return this._get(field.toLowerCase());\n }\n end() {\n return this.get('start') + this.get('length_on_ref');\n }\n seq_id() {\n return this._refID;\n }\n // same as get(), except requires lower-case arguments. used\n // internally to save lots of calls to field.toLowerCase()\n _get(field) {\n if (field in this.data) {\n return this.data[field];\n }\n this.data[field] = this._parseTag(field);\n return this.data[field];\n }\n _tags() {\n this._parseAllTags();\n let tags = ['seq'];\n if (!this.isSegmentUnmapped()) {\n tags.push('start', 'end', 'strand', 'score', 'qual', 'MQ', 'CIGAR', 'length_on_ref', 'template_length');\n }\n if (this.isPaired()) {\n tags.push('next_segment_position', 'pair_orientation');\n }\n tags = tags.concat(this._tagList || []);\n Object.keys(this.data).forEach(k => {\n if (k[0] !== '_' && k !== 'next_seq_id') {\n tags.push(k);\n }\n });\n const seen = {};\n return tags.filter(t => {\n if ((t in this.data && this.data[t] === undefined) ||\n t === 'CG' ||\n t === 'cg') {\n return false;\n }\n const lt = t.toLowerCase();\n const s = seen[lt];\n seen[lt] = true;\n return !s;\n });\n }\n parent() {\n return undefined;\n }\n children() {\n return this.get('subfeatures');\n }\n id() {\n return this._id;\n }\n // special parsers\n /**\n * Mapping quality score.\n */\n mq() {\n const mq = (this.get('_bin_mq_nl') & 0xff00) >> 8;\n return mq === 255 ? undefined : mq;\n }\n score() {\n return this.get('mq');\n }\n qual() {\n var _a;\n return (_a = this.qualRaw()) === null || _a === void 0 ? void 0 : _a.join(' ');\n }\n qualRaw() {\n if (this.isSegmentUnmapped()) {\n return undefined;\n }\n const { start, byteArray } = this.bytes;\n const p = start +\n 36 +\n this.get('_l_read_name') +\n this.get('_n_cigar_op') * 4 +\n this.get('_seq_bytes');\n const lseq = this.get('seq_length');\n return byteArray.subarray(p, p + lseq);\n }\n strand() {\n return this.isReverseComplemented() ? -1 : 1;\n }\n multi_segment_next_segment_strand() {\n if (this.isMateUnmapped()) {\n return undefined;\n }\n return this.isMateReverseComplemented() ? -1 : 1;\n }\n name() {\n return this.get('_read_name');\n }\n _read_name() {\n const nl = this.get('_l_read_name');\n const { byteArray, start } = this.bytes;\n return byteArray.toString('ascii', start + 36, start + 36 + nl - 1);\n }\n /**\n * Get the value of a tag, parsing the tags as far as necessary.\n * Only called if we have not already parsed that field.\n */\n _parseTag(tagName) {\n // if all of the tags have been parsed and we're still being\n // called, we already know that we have no such tag, because\n // it would already have been cached.\n if (this._allTagsParsed) {\n return undefined;\n }\n const { byteArray, start } = this.bytes;\n let p = this._tagOffset ||\n start +\n 36 +\n this.get('_l_read_name') +\n this.get('_n_cigar_op') * 4 +\n this.get('_seq_bytes') +\n this.get('seq_length');\n const blockEnd = this.bytes.end;\n let lcTag;\n while (p < blockEnd && lcTag !== tagName) {\n const tag = String.fromCharCode(byteArray[p], byteArray[p + 1]);\n lcTag = tag.toLowerCase();\n const type = String.fromCharCode(byteArray[p + 2]);\n p += 3;\n let value;\n switch (type) {\n case 'A':\n value = String.fromCharCode(byteArray[p]);\n p += 1;\n break;\n case 'i':\n value = byteArray.readInt32LE(p);\n p += 4;\n break;\n case 'I':\n value = byteArray.readUInt32LE(p);\n p += 4;\n break;\n case 'c':\n value = byteArray.readInt8(p);\n p += 1;\n break;\n case 'C':\n value = byteArray.readUInt8(p);\n p += 1;\n break;\n case 's':\n value = byteArray.readInt16LE(p);\n p += 2;\n break;\n case 'S':\n value = byteArray.readUInt16LE(p);\n p += 2;\n break;\n case 'f':\n value = byteArray.readFloatLE(p);\n p += 4;\n break;\n case 'Z':\n case 'H':\n value = '';\n while (p <= blockEnd) {\n const cc = byteArray[p++];\n if (cc === 0) {\n break;\n }\n else {\n value += String.fromCharCode(cc);\n }\n }\n break;\n case 'B': {\n value = '';\n const cc = byteArray[p++];\n const Btype = String.fromCharCode(cc);\n const limit = byteArray.readInt32LE(p);\n p += 4;\n if (Btype === 'i') {\n if (tag === 'CG') {\n for (let k = 0; k < limit; k++) {\n const cigop = byteArray.readInt32LE(p);\n const lop = cigop >> 4;\n const op = CIGAR_DECODER[cigop & 0xf];\n value += lop + op;\n p += 4;\n }\n }\n else {\n for (let k = 0; k < limit; k++) {\n value += byteArray.readInt32LE(p);\n if (k + 1 < limit) {\n value += ',';\n }\n p += 4;\n }\n }\n }\n if (Btype === 'I') {\n if (tag === 'CG') {\n for (let k = 0; k < limit; k++) {\n const cigop = byteArray.readUInt32LE(p);\n const lop = cigop >> 4;\n const op = CIGAR_DECODER[cigop & 0xf];\n value += lop + op;\n p += 4;\n }\n }\n else {\n for (let k = 0; k < limit; k++) {\n value += byteArray.readUInt32LE(p);\n if (k + 1 < limit) {\n value += ',';\n }\n p += 4;\n }\n }\n }\n if (Btype === 's') {\n for (let k = 0; k < limit; k++) {\n value += byteArray.readInt16LE(p);\n if (k + 1 < limit) {\n value += ',';\n }\n p += 2;\n }\n }\n if (Btype === 'S') {\n for (let k = 0; k < limit; k++) {\n value += byteArray.readUInt16LE(p);\n if (k + 1 < limit) {\n value += ',';\n }\n p += 2;\n }\n }\n if (Btype === 'c') {\n for (let k = 0; k < limit; k++) {\n value += byteArray.readInt8(p);\n if (k + 1 < limit) {\n value += ',';\n }\n p += 1;\n }\n }\n if (Btype === 'C') {\n for (let k = 0; k < limit; k++) {\n value += byteArray.readUInt8(p);\n if (k + 1 < limit) {\n value += ',';\n }\n p += 1;\n }\n }\n if (Btype === 'f') {\n for (let k = 0; k < limit; k++) {\n value += byteArray.readFloatLE(p);\n if (k + 1 < limit) {\n value += ',';\n }\n p += 4;\n }\n }\n break;\n }\n default:\n console.warn(`Unknown BAM tag type '${type}', tags may be incomplete`);\n value = undefined;\n p = blockEnd; // stop parsing tags\n }\n this._tagOffset = p;\n this._tagList.push(tag);\n if (lcTag === tagName) {\n return value;\n }\n this.data[lcTag] = value;\n }\n this._allTagsParsed = true;\n return undefined;\n }\n _parseAllTags() {\n this._parseTag('');\n }\n _parseCigar(cigar) {\n return (\n //@ts-ignore\n cigar\n .match(/\\d+\\D/g)\n //@ts-ignore\n .map(op => [op.match(/\\D/)[0].toUpperCase(), parseInt(op, 10)]));\n }\n /**\n * @returns {boolean} true if the read is paired, regardless of whether both segments are mapped\n */\n isPaired() {\n return !!(this.flags & Constants.BAM_FPAIRED);\n }\n /** @returns {boolean} true if the read is paired, and both segments are mapped */\n isProperlyPaired() {\n return !!(this.flags & Constants.BAM_FPROPER_PAIR);\n }\n /** @returns {boolean} true if the read itself is unmapped; conflictive with isProperlyPaired */\n isSegmentUnmapped() {\n return !!(this.flags & Constants.BAM_FUNMAP);\n }\n /** @returns {boolean} true if the read itself is unmapped; conflictive with isProperlyPaired */\n isMateUnmapped() {\n return !!(this.flags & Constants.BAM_FMUNMAP);\n }\n /** @returns {boolean} true if the read is mapped to the reverse strand */\n isReverseComplemented() {\n return !!(this.flags & Constants.BAM_FREVERSE);\n }\n /** @returns {boolean} true if the mate is mapped to the reverse strand */\n isMateReverseComplemented() {\n return !!(this.flags & Constants.BAM_FMREVERSE);\n }\n /** @returns {boolean} true if this is read number 1 in a pair */\n isRead1() {\n return !!(this.flags & Constants.BAM_FREAD1);\n }\n /** @returns {boolean} true if this is read number 2 in a pair */\n isRead2() {\n return !!(this.flags & Constants.BAM_FREAD2);\n }\n /** @returns {boolean} true if this is a secondary alignment */\n isSecondary() {\n return !!(this.flags & Constants.BAM_FSECONDARY);\n }\n /** @returns {boolean} true if this read has failed QC checks */\n isFailedQc() {\n return !!(this.flags & Constants.BAM_FQCFAIL);\n }\n /** @returns {boolean} true if the read is an optical or PCR duplicate */\n isDuplicate() {\n return !!(this.flags & Constants.BAM_FDUP);\n }\n /** @returns {boolean} true if this is a supplementary alignment */\n isSupplementary() {\n return !!(this.flags & Constants.BAM_FSUPPLEMENTARY);\n }\n cigar() {\n if (this.isSegmentUnmapped()) {\n return undefined;\n }\n const { byteArray, start } = this.bytes;\n const numCigarOps = this.get('_n_cigar_op');\n let p = start + 36 + this.get('_l_read_name');\n const seqLen = this.get('seq_length');\n let cigar = '';\n let lref = 0;\n // check for CG tag by inspecting whether the CIGAR field\n // contains a clip that consumes entire seqLen\n let cigop = byteArray.readInt32LE(p);\n let lop = cigop >> 4;\n let op = CIGAR_DECODER[cigop & 0xf];\n if (op === 'S' && lop === seqLen) {\n // if there is a CG the second CIGAR field will\n // be a N tag the represents the length on ref\n p += 4;\n cigop = byteArray.readInt32LE(p);\n lop = cigop >> 4;\n op = CIGAR_DECODER[cigop & 0xf];\n if (op !== 'N') {\n console.warn('CG tag with no N tag');\n }\n this.data.length_on_ref = lop;\n return this.get('CG');\n }\n else {\n for (let c = 0; c < numCigarOps; ++c) {\n cigop = byteArray.readInt32LE(p);\n lop = cigop >> 4;\n op = CIGAR_DECODER[cigop & 0xf];\n cigar += lop + op;\n // soft clip, hard clip, and insertion don't count toward\n // the length on the reference\n if (op !== 'H' && op !== 'S' && op !== 'I') {\n lref += lop;\n }\n p += 4;\n }\n this.data.length_on_ref = lref;\n return cigar;\n }\n }\n _flags() { }\n length_on_ref() {\n if (this.data.length_on_ref) {\n return this.data.length_on_ref;\n }\n else {\n this.get('cigar'); // the length_on_ref is set as a side effect\n return this.data.length_on_ref;\n }\n }\n _n_cigar_op() {\n return this.get('_flag_nc') & 0xffff;\n }\n _l_read_name() {\n return this.get('_bin_mq_nl') & 0xff;\n }\n /**\n * number of bytes in the sequence field\n */\n _seq_bytes() {\n return (this.get('seq_length') + 1) >> 1;\n }\n getReadBases() {\n return this.seq();\n }\n seq() {\n const { byteArray, start } = this.bytes;\n const p = start + 36 + this.get('_l_read_name') + this.get('_n_cigar_op') * 4;\n const seqBytes = this.get('_seq_bytes');\n const len = this.get('seq_length');\n let buf = '';\n let i = 0;\n for (let j = 0; j < seqBytes; ++j) {\n const sb = byteArray[p + j];\n buf += SEQRET_DECODER[(sb & 0xf0) >> 4];\n i++;\n if (i < len) {\n buf += SEQRET_DECODER[sb & 0x0f];\n i++;\n }\n }\n return buf;\n }\n // adapted from igv.js\n getPairOrientation() {\n if (!this.isSegmentUnmapped() &&\n !this.isMateUnmapped() &&\n this._refID === this._next_refid()) {\n const s1 = this.isReverseComplemented() ? 'R' : 'F';\n const s2 = this.isMateReverseComplemented() ? 'R' : 'F';\n let o1 = ' ';\n let o2 = ' ';\n if (this.isRead1()) {\n o1 = '1';\n o2 = '2';\n }\n else if (this.isRead2()) {\n o1 = '2';\n o2 = '1';\n }\n const tmp = [];\n const isize = this.template_length();\n if (isize > 0) {\n tmp[0] = s1;\n tmp[1] = o1;\n tmp[2] = s2;\n tmp[3] = o2;\n }\n else {\n tmp[2] = s1;\n tmp[3] = o1;\n tmp[0] = s2;\n tmp[1] = o2;\n }\n return tmp.join('');\n }\n return null;\n }\n _bin_mq_nl() {\n return this.bytes.byteArray.readInt32LE(this.bytes.start + 12);\n }\n _flag_nc() {\n return this.bytes.byteArray.readInt32LE(this.bytes.start + 16);\n }\n seq_length() {\n return this.bytes.byteArray.readInt32LE(this.bytes.start + 20);\n }\n _next_refid() {\n return this.bytes.byteArray.readInt32LE(this.bytes.start + 24);\n }\n _next_pos() {\n return this.bytes.byteArray.readInt32LE(this.bytes.start + 28);\n }\n template_length() {\n return this.bytes.byteArray.readInt32LE(this.bytes.start + 32);\n }\n toJSON() {\n const data = {};\n Object.keys(this).forEach(k => {\n if (k.charAt(0) === '_' || k === 'bytes') {\n return;\n }\n //@ts-ignore\n data[k] = this[k];\n });\n return data;\n }\n}\n//# sourceMappingURL=record.js.map","export function parseHeaderText(text) {\n const lines = text.split(/\\r?\\n/);\n const data = [];\n lines.forEach(line => {\n const [tag, ...fields] = line.split(/\\t/);\n const parsedFields = fields.map(f => {\n const [fieldTag, value] = f.split(':', 2);\n return { tag: fieldTag, value };\n });\n if (tag) {\n data.push({ tag: tag.substr(1), data: parsedFields });\n }\n });\n return data;\n}\n//# sourceMappingURL=sam.js.map","import { Buffer } from \"buffer\";\nimport crc32 from 'buffer-crc32';\nimport { unzip, unzipChunkSlice } from '@gmod/bgzf-filehandle';\nimport entries from 'object.entries-ponyfill';\nimport { LocalFile, RemoteFile } from 'generic-filehandle';\nimport AbortablePromiseCache from 'abortable-promise-cache';\nimport QuickLRU from 'quick-lru';\n//locals\nimport BAI from './bai';\nimport CSI from './csi';\nimport BAMFeature from './record';\nimport { parseHeaderText } from './sam';\nimport { abortBreakPoint, checkAbortSignal, timeout, makeOpts, } from './util';\nexport const BAM_MAGIC = 21840194;\nconst blockLen = 1 << 16;\nfunction flat(arr) {\n return [].concat(...arr);\n}\nasync function gen2array(gen) {\n const out = [];\n for await (const x of gen) {\n out.push(x);\n }\n return out;\n}\nexport default class BamFile {\n /**\n * @param {object} args\n * @param {string} [args.bamPath]\n * @param {FileHandle} [args.bamFilehandle]\n * @param {string} [args.baiPath]\n * @param {FileHandle} [args.baiFilehandle]\n */\n constructor({ bamFilehandle, bamPath, bamUrl, baiPath, baiFilehandle, baiUrl, csiPath, csiFilehandle, csiUrl, fetchSizeLimit, chunkSizeLimit, yieldThreadTime = 100, renameRefSeqs = n => n, }) {\n this.featureCache = new AbortablePromiseCache({\n //@ts-ignore\n cache: new QuickLRU({\n maxSize: 50,\n }),\n //@ts-ignore\n fill: async ({ chunk, opts }, signal) => {\n const { data, cpositions, dpositions } = await this._readChunk({\n chunk,\n opts: { ...opts, signal },\n });\n const feats = await this.readBamFeatures(data, cpositions, dpositions, chunk);\n return feats;\n },\n });\n this.renameRefSeq = renameRefSeqs;\n if (bamFilehandle) {\n this.bam = bamFilehandle;\n }\n else if (bamPath) {\n this.bam = new LocalFile(bamPath);\n }\n else if (bamUrl) {\n this.bam = new RemoteFile(bamUrl);\n }\n else {\n throw new Error('unable to initialize bam');\n }\n if (csiFilehandle) {\n this.index = new CSI({ filehandle: csiFilehandle });\n }\n else if (csiPath) {\n this.index = new CSI({ filehandle: new LocalFile(csiPath) });\n }\n else if (csiUrl) {\n this.index = new CSI({ filehandle: new RemoteFile(csiUrl) });\n }\n else if (baiFilehandle) {\n this.index = new BAI({ filehandle: baiFilehandle });\n }\n else if (baiPath) {\n this.index = new BAI({ filehandle: new LocalFile(baiPath) });\n }\n else if (baiUrl) {\n this.index = new BAI({ filehandle: new RemoteFile(baiUrl) });\n }\n else if (bamPath) {\n this.index = new BAI({ filehandle: new LocalFile(`${bamPath}.bai`) });\n }\n else if (bamUrl) {\n this.index = new BAI({ filehandle: new RemoteFile(`${bamUrl}.bai`) });\n }\n else {\n throw new Error('unable to infer index format');\n }\n this.fetchSizeLimit = fetchSizeLimit || 500000000; // 500MB\n this.chunkSizeLimit = chunkSizeLimit || 300000000; // 300MB\n this.yieldThreadTime = yieldThreadTime;\n }\n async getHeader(origOpts = {}) {\n const opts = makeOpts(origOpts);\n const indexData = await this.index.parse(opts);\n const ret = indexData.firstDataLine\n ? indexData.firstDataLine.blockPosition + 65535\n : undefined;\n let buffer;\n if (ret) {\n const res = await this.bam.read(Buffer.alloc(ret + blockLen), 0, ret + blockLen, 0, opts);\n const { bytesRead } = res;\n ({ buffer } = res);\n if (!bytesRead) {\n throw new Error('Error reading header');\n }\n if (bytesRead < ret) {\n buffer = buffer.subarray(0, bytesRead);\n }\n else {\n buffer = buffer.subarray(0, ret);\n }\n }\n else {\n buffer = (await this.bam.readFile(opts));\n }\n const uncba = await unzip(buffer);\n if (uncba.readInt32LE(0) !== BAM_MAGIC) {\n throw new Error('Not a BAM file');\n }\n const headLen = uncba.readInt32LE(4);\n this.header = uncba.toString('utf8', 8, 8 + headLen);\n const { chrToIndex, indexToChr } = await this._readRefSeqs(headLen + 8, 65535, opts);\n this.chrToIndex = chrToIndex;\n this.indexToChr = indexToChr;\n return parseHeaderText(this.header);\n }\n async getHeaderText(opts = {}) {\n await this.getHeader(opts);\n return this.header;\n }\n // the full length of the refseq block is not given in advance so this grabs\n // a chunk and doubles it if all refseqs haven't been processed\n async _readRefSeqs(start, refSeqBytes, opts = {}) {\n if (start > refSeqBytes) {\n return this._readRefSeqs(start, refSeqBytes * 2, opts);\n }\n const size = refSeqBytes + blockLen;\n const { bytesRead, buffer } = await this.bam.read(Buffer.alloc(size), 0, refSeqBytes, 0, opts);\n if (!bytesRead) {\n throw new Error('Error reading refseqs from header');\n }\n const uncba = await unzip(buffer.subarray(0, Math.min(bytesRead, refSeqBytes)));\n const nRef = uncba.readInt32LE(start);\n let p = start + 4;\n const chrToIndex = {};\n const indexToChr = [];\n for (let i = 0; i < nRef; i += 1) {\n const lName = uncba.readInt32LE(p);\n const refName = this.renameRefSeq(uncba.toString('utf8', p + 4, p + 4 + lName - 1));\n const lRef = uncba.readInt32LE(p + lName + 4);\n chrToIndex[refName] = i;\n indexToChr.push({ refName, length: lRef });\n p = p + 8 + lName;\n if (p > uncba.length) {\n console.warn(`BAM header is very big. Re-fetching ${refSeqBytes} bytes.`);\n return this._readRefSeqs(start, refSeqBytes * 2, opts);\n }\n }\n return { chrToIndex, indexToChr };\n }\n async getRecordsForRange(chr, min, max, opts = {\n viewAsPairs: false,\n pairAcrossChr: false,\n maxInsertSize: 200000,\n }) {\n return flat(await gen2array(this.streamRecordsForRange(chr, min, max, opts)));\n }\n async *streamRecordsForRange(chr, min, max, opts = {}) {\n const { signal } = opts;\n const chrId = this.chrToIndex && this.chrToIndex[chr];\n let chunks;\n if (!(chrId >= 0)) {\n chunks = [];\n }\n else {\n chunks = await this.index.blocksForRange(chrId, min - 1, max, opts);\n if (!chunks) {\n throw new Error('Error in index fetch');\n }\n }\n for (let i = 0; i < chunks.length; i += 1) {\n await abortBreakPoint(signal);\n const size = chunks[i].fetchedSize();\n if (size > this.chunkSizeLimit) {\n throw new Error(`Too many BAM features. BAM chunk size ${size} bytes exceeds chunkSizeLimit of ${this.chunkSizeLimit}`);\n }\n }\n const totalSize = chunks\n .map(s => s.fetchedSize())\n .reduce((a, b) => a + b, 0);\n if (totalSize > this.fetchSizeLimit) {\n throw new Error(`data size of ${totalSize.toLocaleString()} bytes exceeded fetch size limit of ${this.fetchSizeLimit.toLocaleString()} bytes`);\n }\n yield* this._fetchChunkFeatures(chunks, chrId, min, max, opts);\n }\n async *_fetchChunkFeatures(chunks, chrId, min, max, opts) {\n const { viewAsPairs = false } = opts;\n const feats = [];\n let done = false;\n for (let i = 0; i < chunks.length; i++) {\n const c = chunks[i];\n const records = (await this.featureCache.get(c.toString(), {\n chunk: c,\n opts,\n }, opts.signal));\n const recs = [];\n for (let i = 0; i < records.length; i += 1) {\n const feature = records[i];\n if (feature.seq_id() === chrId) {\n if (feature.get('start') >= max) {\n // past end of range, can stop iterating\n done = true;\n break;\n }\n else if (feature.get('end') >= min) {\n // must be in range\n recs.push(feature);\n }\n }\n }\n feats.push(recs);\n yield recs;\n if (done) {\n break;\n }\n }\n checkAbortSignal(opts.signal);\n if (viewAsPairs) {\n yield this.fetchPairs(chrId, feats, opts);\n }\n }\n async fetchPairs(chrId, feats, opts) {\n const { pairAcrossChr = false, maxInsertSize = 200000 } = opts;\n const unmatedPairs = {};\n const readIds = {};\n feats.map(ret => {\n const readNames = {};\n for (let i = 0; i < ret.length; i++) {\n const name = ret[i].name();\n const id = ret[i].id();\n if (!readNames[name]) {\n readNames[name] = 0;\n }\n readNames[name]++;\n readIds[id] = 1;\n }\n entries(readNames).forEach(([k, v]) => {\n if (v === 1) {\n unmatedPairs[k] = true;\n }\n });\n });\n const matePromises = [];\n feats.map(ret => {\n for (let i = 0; i < ret.length; i++) {\n const f = ret[i];\n const name = f.name();\n const start = f.get('start');\n const pnext = f._next_pos();\n const rnext = f._next_refid();\n if (unmatedPairs[name] &&\n (pairAcrossChr ||\n (rnext === chrId && Math.abs(start - pnext) < maxInsertSize))) {\n matePromises.push(this.index.blocksForRange(rnext, pnext, pnext + 1, opts));\n }\n }\n });\n // filter out duplicate chunks (the blocks are lists of chunks, blocks are\n // concatenated, then filter dup chunks)\n const mateChunks = flat(await Promise.all(matePromises))\n .sort()\n .filter((item, pos, ary) => !pos || item.toString() !== ary[pos - 1].toString());\n const mateTotalSize = mateChunks\n .map(s => s.fetchedSize())\n .reduce((a, b) => a + b, 0);\n if (mateTotalSize > this.fetchSizeLimit) {\n throw new Error(`data size of ${mateTotalSize.toLocaleString()} bytes exceeded fetch size limit of ${this.fetchSizeLimit.toLocaleString()} bytes`);\n }\n const mateFeatPromises = mateChunks.map(async (c) => {\n const { data, cpositions, dpositions, chunk } = await this._readChunk({\n chunk: c,\n opts,\n });\n const feats = await this.readBamFeatures(data, cpositions, dpositions, chunk);\n const mateRecs = [];\n for (let i = 0; i < feats.length; i += 1) {\n const feature = feats[i];\n if (unmatedPairs[feature.get('name')] && !readIds[feature.id()]) {\n mateRecs.push(feature);\n }\n }\n return mateRecs;\n });\n return flat(await Promise.all(mateFeatPromises));\n }\n async _readChunk({ chunk, opts }) {\n const size = chunk.fetchedSize();\n const { buffer, bytesRead } = await this.bam.read(Buffer.alloc(size), 0, size, chunk.minv.blockPosition, opts);\n const { buffer: data, cpositions, dpositions, } = await unzipChunkSlice(buffer.subarray(0, Math.min(bytesRead, size)), chunk);\n return { data, cpositions, dpositions, chunk };\n }\n async readBamFeatures(ba, cpositions, dpositions, chunk) {\n let blockStart = 0;\n const sink = [];\n let pos = 0;\n let last = +Date.now();\n while (blockStart + 4 < ba.length) {\n const blockSize = ba.readInt32LE(blockStart);\n const blockEnd = blockStart + 4 + blockSize - 1;\n // increment position to the current decompressed status\n if (dpositions) {\n while (blockStart + chunk.minv.dataPosition >= dpositions[pos++]) { }\n pos--;\n }\n // only try to read the feature if we have all the bytes for it\n if (blockEnd < ba.length) {\n const feature = new BAMFeature({\n bytes: {\n byteArray: ba,\n start: blockStart,\n end: blockEnd,\n },\n // the below results in an automatically calculated file-offset based ID\n // if the info for that is available, otherwise crc32 of the features\n //\n // cpositions[pos] refers to actual file offset of a bgzip block boundaries\n //\n // we multiply by (1 <<8) in order to make sure each block has a \"unique\"\n // address space so that data in that block could never overlap\n //\n // then the blockStart-dpositions is an uncompressed file offset from\n // that bgzip block boundary, and since the cpositions are multiplied by\n // (1 << 8) these uncompressed offsets get a unique space\n //\n // this has an extra chunk.minv.dataPosition added on because it blockStart\n // starts at 0 instead of chunk.minv.dataPosition\n //\n // the +1 is just to avoid any possible uniqueId 0 but this does not realistically happen\n fileOffset: cpositions\n ? cpositions[pos] * (1 << 8) +\n (blockStart - dpositions[pos]) +\n chunk.minv.dataPosition +\n 1\n : // must be slice, not subarray for buffer polyfill on web\n crc32.signed(ba.slice(blockStart, blockEnd)),\n });\n sink.push(feature);\n if (this.yieldThreadTime && +Date.now() - last > this.yieldThreadTime) {\n await timeout(1);\n last = +Date.now();\n }\n }\n blockStart = blockEnd + 1;\n }\n return sink;\n }\n async hasRefSeq(seqName) {\n const refId = this.chrToIndex && this.chrToIndex[seqName];\n return this.index.hasRefSeq(refId);\n }\n async lineCount(seqName) {\n const refId = this.chrToIndex && this.chrToIndex[seqName];\n return this.index.lineCount(refId);\n }\n async indexCov(seqName, start, end) {\n await this.index.parse();\n const seqId = this.chrToIndex && this.chrToIndex[seqName];\n return this.index.indexCov(seqId, start, end);\n }\n async blocksForRange(seqName, start, end, opts) {\n await this.index.parse();\n const seqId = this.chrToIndex && this.chrToIndex[seqName];\n return this.index.blocksForRange(seqId, start, end, opts);\n }\n}\n//# sourceMappingURL=bamFile.js.map","(function(self) {\n\nvar irrelevant = (function (exports) {\n\n /* eslint-disable no-prototype-builtins */\n var g =\n (typeof globalThis !== 'undefined' && globalThis) ||\n (typeof self !== 'undefined' && self) ||\n // eslint-disable-next-line no-undef\n (typeof global !== 'undefined' && global) ||\n {};\n\n var support = {\n searchParams: 'URLSearchParams' in g,\n iterable: 'Symbol' in g && 'iterator' in Symbol,\n blob:\n 'FileReader' in g &&\n 'Blob' in g &&\n (function() {\n try {\n new Blob();\n return true\n } catch (e) {\n return false\n }\n })(),\n formData: 'FormData' in g,\n arrayBuffer: 'ArrayBuffer' in g\n };\n\n function isDataView(obj) {\n return obj && DataView.prototype.isPrototypeOf(obj)\n }\n\n if (support.arrayBuffer) {\n var viewClasses = [\n '[object Int8Array]',\n '[object Uint8Array]',\n '[object Uint8ClampedArray]',\n '[object Int16Array]',\n '[object Uint16Array]',\n '[object Int32Array]',\n '[object Uint32Array]',\n '[object Float32Array]',\n '[object Float64Array]'\n ];\n\n var isArrayBufferView =\n ArrayBuffer.isView ||\n function(obj) {\n return obj && viewClasses.indexOf(Object.prototype.toString.call(obj)) > -1\n };\n }\n\n function normalizeName(name) {\n if (typeof name !== 'string') {\n name = String(name);\n }\n if (/[^a-z0-9\\-#$%&'*+.^_`|~!]/i.test(name) || name === '') {\n throw new TypeError('Invalid character in header field name: \"' + name + '\"')\n }\n return name.toLowerCase()\n }\n\n function normalizeValue(value) {\n if (typeof value !== 'string') {\n value = String(value);\n }\n return value\n }\n\n // Build a destructive iterator for the value list\n function iteratorFor(items) {\n var iterator = {\n next: function() {\n var value = items.shift();\n return {done: value === undefined, value: value}\n }\n };\n\n if (support.iterable) {\n iterator[Symbol.iterator] = function() {\n return iterator\n };\n }\n\n return iterator\n }\n\n function Headers(headers) {\n this.map = {};\n\n if (headers instanceof Headers) {\n headers.forEach(function(value, name) {\n this.append(name, value);\n }, this);\n } else if (Array.isArray(headers)) {\n headers.forEach(function(header) {\n if (header.length != 2) {\n throw new TypeError('Headers constructor: expected name/value pair to be length 2, found' + header.length)\n }\n this.append(header[0], header[1]);\n }, this);\n } else if (headers) {\n Object.getOwnPropertyNames(headers).forEach(function(name) {\n this.append(name, headers[name]);\n }, this);\n }\n }\n\n Headers.prototype.append = function(name, value) {\n name = normalizeName(name);\n value = normalizeValue(value);\n var oldValue = this.map[name];\n this.map[name] = oldValue ? oldValue + ', ' + value : value;\n };\n\n Headers.prototype['delete'] = function(name) {\n delete this.map[normalizeName(name)];\n };\n\n Headers.prototype.get = function(name) {\n name = normalizeName(name);\n return this.has(name) ? this.map[name] : null\n };\n\n Headers.prototype.has = function(name) {\n return this.map.hasOwnProperty(normalizeName(name))\n };\n\n Headers.prototype.set = function(name, value) {\n this.map[normalizeName(name)] = normalizeValue(value);\n };\n\n Headers.prototype.forEach = function(callback, thisArg) {\n for (var name in this.map) {\n if (this.map.hasOwnProperty(name)) {\n callback.call(thisArg, this.map[name], name, this);\n }\n }\n };\n\n Headers.prototype.keys = function() {\n var items = [];\n this.forEach(function(value, name) {\n items.push(name);\n });\n return iteratorFor(items)\n };\n\n Headers.prototype.values = function() {\n var items = [];\n this.forEach(function(value) {\n items.push(value);\n });\n return iteratorFor(items)\n };\n\n Headers.prototype.entries = function() {\n var items = [];\n this.forEach(function(value, name) {\n items.push([name, value]);\n });\n return iteratorFor(items)\n };\n\n if (support.iterable) {\n Headers.prototype[Symbol.iterator] = Headers.prototype.entries;\n }\n\n function consumed(body) {\n if (body._noBody) return\n if (body.bodyUsed) {\n return Promise.reject(new TypeError('Already read'))\n }\n body.bodyUsed = true;\n }\n\n function fileReaderReady(reader) {\n return new Promise(function(resolve, reject) {\n reader.onload = function() {\n resolve(reader.result);\n };\n reader.onerror = function() {\n reject(reader.error);\n };\n })\n }\n\n function readBlobAsArrayBuffer(blob) {\n var reader = new FileReader();\n var promise = fileReaderReady(reader);\n reader.readAsArrayBuffer(blob);\n return promise\n }\n\n function readBlobAsText(blob) {\n var reader = new FileReader();\n var promise = fileReaderReady(reader);\n var match = /charset=([A-Za-z0-9_-]+)/.exec(blob.type);\n var encoding = match ? match[1] : 'utf-8';\n reader.readAsText(blob, encoding);\n return promise\n }\n\n function readArrayBufferAsText(buf) {\n var view = new Uint8Array(buf);\n var chars = new Array(view.length);\n\n for (var i = 0; i < view.length; i++) {\n chars[i] = String.fromCharCode(view[i]);\n }\n return chars.join('')\n }\n\n function bufferClone(buf) {\n if (buf.slice) {\n return buf.slice(0)\n } else {\n var view = new Uint8Array(buf.byteLength);\n view.set(new Uint8Array(buf));\n return view.buffer\n }\n }\n\n function Body() {\n this.bodyUsed = false;\n\n this._initBody = function(body) {\n /*\n fetch-mock wraps the Response object in an ES6 Proxy to\n provide useful test harness features such as flush. However, on\n ES5 browsers without fetch or Proxy support pollyfills must be used;\n the proxy-pollyfill is unable to proxy an attribute unless it exists\n on the object before the Proxy is created. This change ensures\n Response.bodyUsed exists on the instance, while maintaining the\n semantic of setting Request.bodyUsed in the constructor before\n _initBody is called.\n */\n // eslint-disable-next-line no-self-assign\n this.bodyUsed = this.bodyUsed;\n this._bodyInit = body;\n if (!body) {\n this._noBody = true;\n this._bodyText = '';\n } else if (typeof body === 'string') {\n this._bodyText = body;\n } else if (support.blob && Blob.prototype.isPrototypeOf(body)) {\n this._bodyBlob = body;\n } else if (support.formData && FormData.prototype.isPrototypeOf(body)) {\n this._bodyFormData = body;\n } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n this._bodyText = body.toString();\n } else if (support.arrayBuffer && support.blob && isDataView(body)) {\n this._bodyArrayBuffer = bufferClone(body.buffer);\n // IE 10-11 can't handle a DataView body.\n this._bodyInit = new Blob([this._bodyArrayBuffer]);\n } else if (support.arrayBuffer && (ArrayBuffer.prototype.isPrototypeOf(body) || isArrayBufferView(body))) {\n this._bodyArrayBuffer = bufferClone(body);\n } else {\n this._bodyText = body = Object.prototype.toString.call(body);\n }\n\n if (!this.headers.get('content-type')) {\n if (typeof body === 'string') {\n this.headers.set('content-type', 'text/plain;charset=UTF-8');\n } else if (this._bodyBlob && this._bodyBlob.type) {\n this.headers.set('content-type', this._bodyBlob.type);\n } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n this.headers.set('content-type', 'application/x-www-form-urlencoded;charset=UTF-8');\n }\n }\n };\n\n if (support.blob) {\n this.blob = function() {\n var rejected = consumed(this);\n if (rejected) {\n return rejected\n }\n\n if (this._bodyBlob) {\n return Promise.resolve(this._bodyBlob)\n } else if (this._bodyArrayBuffer) {\n return Promise.resolve(new Blob([this._bodyArrayBuffer]))\n } else if (this._bodyFormData) {\n throw new Error('could not read FormData body as blob')\n } else {\n return Promise.resolve(new Blob([this._bodyText]))\n }\n };\n }\n\n this.arrayBuffer = function() {\n if (this._bodyArrayBuffer) {\n var isConsumed = consumed(this);\n if (isConsumed) {\n return isConsumed\n } else if (ArrayBuffer.isView(this._bodyArrayBuffer)) {\n return Promise.resolve(\n this._bodyArrayBuffer.buffer.slice(\n this._bodyArrayBuffer.byteOffset,\n this._bodyArrayBuffer.byteOffset + this._bodyArrayBuffer.byteLength\n )\n )\n } else {\n return Promise.resolve(this._bodyArrayBuffer)\n }\n } else if (support.blob) {\n return this.blob().then(readBlobAsArrayBuffer)\n } else {\n throw new Error('could not read as ArrayBuffer')\n }\n };\n\n this.text = function() {\n var rejected = consumed(this);\n if (rejected) {\n return rejected\n }\n\n if (this._bodyBlob) {\n return readBlobAsText(this._bodyBlob)\n } else if (this._bodyArrayBuffer) {\n return Promise.resolve(readArrayBufferAsText(this._bodyArrayBuffer))\n } else if (this._bodyFormData) {\n throw new Error('could not read FormData body as text')\n } else {\n return Promise.resolve(this._bodyText)\n }\n };\n\n if (support.formData) {\n this.formData = function() {\n return this.text().then(decode)\n };\n }\n\n this.json = function() {\n return this.text().then(JSON.parse)\n };\n\n return this\n }\n\n // HTTP methods whose capitalization should be normalized\n var methods = ['CONNECT', 'DELETE', 'GET', 'HEAD', 'OPTIONS', 'PATCH', 'POST', 'PUT', 'TRACE'];\n\n function normalizeMethod(method) {\n var upcased = method.toUpperCase();\n return methods.indexOf(upcased) > -1 ? upcased : method\n }\n\n function Request(input, options) {\n if (!(this instanceof Request)) {\n throw new TypeError('Please use the \"new\" operator, this DOM object constructor cannot be called as a function.')\n }\n\n options = options || {};\n var body = options.body;\n\n if (input instanceof Request) {\n if (input.bodyUsed) {\n throw new TypeError('Already read')\n }\n this.url = input.url;\n this.credentials = input.credentials;\n if (!options.headers) {\n this.headers = new Headers(input.headers);\n }\n this.method = input.method;\n this.mode = input.mode;\n this.signal = input.signal;\n if (!body && input._bodyInit != null) {\n body = input._bodyInit;\n input.bodyUsed = true;\n }\n } else {\n this.url = String(input);\n }\n\n this.credentials = options.credentials || this.credentials || 'same-origin';\n if (options.headers || !this.headers) {\n this.headers = new Headers(options.headers);\n }\n this.method = normalizeMethod(options.method || this.method || 'GET');\n this.mode = options.mode || this.mode || null;\n this.signal = options.signal || this.signal || (function () {\n if ('AbortController' in g) {\n var ctrl = new AbortController();\n return ctrl.signal;\n }\n }());\n this.referrer = null;\n\n if ((this.method === 'GET' || this.method === 'HEAD') && body) {\n throw new TypeError('Body not allowed for GET or HEAD requests')\n }\n this._initBody(body);\n\n if (this.method === 'GET' || this.method === 'HEAD') {\n if (options.cache === 'no-store' || options.cache === 'no-cache') {\n // Search for a '_' parameter in the query string\n var reParamSearch = /([?&])_=[^&]*/;\n if (reParamSearch.test(this.url)) {\n // If it already exists then set the value with the current time\n this.url = this.url.replace(reParamSearch, '$1_=' + new Date().getTime());\n } else {\n // Otherwise add a new '_' parameter to the end with the current time\n var reQueryString = /\\?/;\n this.url += (reQueryString.test(this.url) ? '&' : '?') + '_=' + new Date().getTime();\n }\n }\n }\n }\n\n Request.prototype.clone = function() {\n return new Request(this, {body: this._bodyInit})\n };\n\n function decode(body) {\n var form = new FormData();\n body\n .trim()\n .split('&')\n .forEach(function(bytes) {\n if (bytes) {\n var split = bytes.split('=');\n var name = split.shift().replace(/\\+/g, ' ');\n var value = split.join('=').replace(/\\+/g, ' ');\n form.append(decodeURIComponent(name), decodeURIComponent(value));\n }\n });\n return form\n }\n\n function parseHeaders(rawHeaders) {\n var headers = new Headers();\n // Replace instances of \\r\\n and \\n followed by at least one space or horizontal tab with a space\n // https://tools.ietf.org/html/rfc7230#section-3.2\n var preProcessedHeaders = rawHeaders.replace(/\\r?\\n[\\t ]+/g, ' ');\n // Avoiding split via regex to work around a common IE11 bug with the core-js 3.6.0 regex polyfill\n // https://github.com/github/fetch/issues/748\n // https://github.com/zloirock/core-js/issues/751\n preProcessedHeaders\n .split('\\r')\n .map(function(header) {\n return header.indexOf('\\n') === 0 ? header.substr(1, header.length) : header\n })\n .forEach(function(line) {\n var parts = line.split(':');\n var key = parts.shift().trim();\n if (key) {\n var value = parts.join(':').trim();\n try {\n headers.append(key, value);\n } catch (error) {\n console.warn('Response ' + error.message);\n }\n }\n });\n return headers\n }\n\n Body.call(Request.prototype);\n\n function Response(bodyInit, options) {\n if (!(this instanceof Response)) {\n throw new TypeError('Please use the \"new\" operator, this DOM object constructor cannot be called as a function.')\n }\n if (!options) {\n options = {};\n }\n\n this.type = 'default';\n this.status = options.status === undefined ? 200 : options.status;\n if (this.status < 200 || this.status > 599) {\n throw new RangeError(\"Failed to construct 'Response': The status provided (0) is outside the range [200, 599].\")\n }\n this.ok = this.status >= 200 && this.status < 300;\n this.statusText = options.statusText === undefined ? '' : '' + options.statusText;\n this.headers = new Headers(options.headers);\n this.url = options.url || '';\n this._initBody(bodyInit);\n }\n\n Body.call(Response.prototype);\n\n Response.prototype.clone = function() {\n return new Response(this._bodyInit, {\n status: this.status,\n statusText: this.statusText,\n headers: new Headers(this.headers),\n url: this.url\n })\n };\n\n Response.error = function() {\n var response = new Response(null, {status: 200, statusText: ''});\n response.ok = false;\n response.status = 0;\n response.type = 'error';\n return response\n };\n\n var redirectStatuses = [301, 302, 303, 307, 308];\n\n Response.redirect = function(url, status) {\n if (redirectStatuses.indexOf(status) === -1) {\n throw new RangeError('Invalid status code')\n }\n\n return new Response(null, {status: status, headers: {location: url}})\n };\n\n exports.DOMException = g.DOMException;\n try {\n new exports.DOMException();\n } catch (err) {\n exports.DOMException = function(message, name) {\n this.message = message;\n this.name = name;\n var error = Error(message);\n this.stack = error.stack;\n };\n exports.DOMException.prototype = Object.create(Error.prototype);\n exports.DOMException.prototype.constructor = exports.DOMException;\n }\n\n function fetch(input, init) {\n return new Promise(function(resolve, reject) {\n var request = new Request(input, init);\n\n if (request.signal && request.signal.aborted) {\n return reject(new exports.DOMException('Aborted', 'AbortError'))\n }\n\n var xhr = new XMLHttpRequest();\n\n function abortXhr() {\n xhr.abort();\n }\n\n xhr.onload = function() {\n var options = {\n statusText: xhr.statusText,\n headers: parseHeaders(xhr.getAllResponseHeaders() || '')\n };\n // This check if specifically for when a user fetches a file locally from the file system\n // Only if the status is out of a normal range\n if (request.url.indexOf('file://') === 0 && (xhr.status < 200 || xhr.status > 599)) {\n options.status = 200;\n } else {\n options.status = xhr.status;\n }\n options.url = 'responseURL' in xhr ? xhr.responseURL : options.headers.get('X-Request-URL');\n var body = 'response' in xhr ? xhr.response : xhr.responseText;\n setTimeout(function() {\n resolve(new Response(body, options));\n }, 0);\n };\n\n xhr.onerror = function() {\n setTimeout(function() {\n reject(new TypeError('Network request failed'));\n }, 0);\n };\n\n xhr.ontimeout = function() {\n setTimeout(function() {\n reject(new TypeError('Network request timed out'));\n }, 0);\n };\n\n xhr.onabort = function() {\n setTimeout(function() {\n reject(new exports.DOMException('Aborted', 'AbortError'));\n }, 0);\n };\n\n function fixUrl(url) {\n try {\n return url === '' && g.location.href ? g.location.href : url\n } catch (e) {\n return url\n }\n }\n\n xhr.open(request.method, fixUrl(request.url), true);\n\n if (request.credentials === 'include') {\n xhr.withCredentials = true;\n } else if (request.credentials === 'omit') {\n xhr.withCredentials = false;\n }\n\n if ('responseType' in xhr) {\n if (support.blob) {\n xhr.responseType = 'blob';\n } else if (\n support.arrayBuffer\n ) {\n xhr.responseType = 'arraybuffer';\n }\n }\n\n if (init && typeof init.headers === 'object' && !(init.headers instanceof Headers || (g.Headers && init.headers instanceof g.Headers))) {\n var names = [];\n Object.getOwnPropertyNames(init.headers).forEach(function(name) {\n names.push(normalizeName(name));\n xhr.setRequestHeader(name, normalizeValue(init.headers[name]));\n });\n request.headers.forEach(function(value, name) {\n if (names.indexOf(name) === -1) {\n xhr.setRequestHeader(name, value);\n }\n });\n } else {\n request.headers.forEach(function(value, name) {\n xhr.setRequestHeader(name, value);\n });\n }\n\n if (request.signal) {\n request.signal.addEventListener('abort', abortXhr);\n\n xhr.onreadystatechange = function() {\n // DONE (success or failure)\n if (xhr.readyState === 4) {\n request.signal.removeEventListener('abort', abortXhr);\n }\n };\n }\n\n xhr.send(typeof request._bodyInit === 'undefined' ? null : request._bodyInit);\n })\n }\n\n fetch.polyfill = true;\n\n if (!g.fetch) {\n g.fetch = fetch;\n g.Headers = Headers;\n g.Request = Request;\n g.Response = Response;\n }\n\n exports.Headers = Headers;\n exports.Request = Request;\n exports.Response = Response;\n exports.fetch = fetch;\n\n Object.defineProperty(exports, '__esModule', { value: true });\n\n return exports;\n\n})({});\n})(typeof self !== 'undefined' ? self : this);\n","export default class QuickLRU extends Map {\n\tconstructor(options = {}) {\n\t\tsuper();\n\n\t\tif (!(options.maxSize && options.maxSize > 0)) {\n\t\t\tthrow new TypeError('`maxSize` must be a number greater than 0');\n\t\t}\n\n\t\tif (typeof options.maxAge === 'number' && options.maxAge === 0) {\n\t\t\tthrow new TypeError('`maxAge` must be a number greater than 0');\n\t\t}\n\n\t\t// TODO: Use private class fields when ESLint supports them.\n\t\tthis.maxSize = options.maxSize;\n\t\tthis.maxAge = options.maxAge || Number.POSITIVE_INFINITY;\n\t\tthis.onEviction = options.onEviction;\n\t\tthis.cache = new Map();\n\t\tthis.oldCache = new Map();\n\t\tthis._size = 0;\n\t}\n\n\t// TODO: Use private class methods when targeting Node.js 16.\n\t_emitEvictions(cache) {\n\t\tif (typeof this.onEviction !== 'function') {\n\t\t\treturn;\n\t\t}\n\n\t\tfor (const [key, item] of cache) {\n\t\t\tthis.onEviction(key, item.value);\n\t\t}\n\t}\n\n\t_deleteIfExpired(key, item) {\n\t\tif (typeof item.expiry === 'number' && item.expiry <= Date.now()) {\n\t\t\tif (typeof this.onEviction === 'function') {\n\t\t\t\tthis.onEviction(key, item.value);\n\t\t\t}\n\n\t\t\treturn this.delete(key);\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t_getOrDeleteIfExpired(key, item) {\n\t\tconst deleted = this._deleteIfExpired(key, item);\n\t\tif (deleted === false) {\n\t\t\treturn item.value;\n\t\t}\n\t}\n\n\t_getItemValue(key, item) {\n\t\treturn item.expiry ? this._getOrDeleteIfExpired(key, item) : item.value;\n\t}\n\n\t_peek(key, cache) {\n\t\tconst item = cache.get(key);\n\n\t\treturn this._getItemValue(key, item);\n\t}\n\n\t_set(key, value) {\n\t\tthis.cache.set(key, value);\n\t\tthis._size++;\n\n\t\tif (this._size >= this.maxSize) {\n\t\t\tthis._size = 0;\n\t\t\tthis._emitEvictions(this.oldCache);\n\t\t\tthis.oldCache = this.cache;\n\t\t\tthis.cache = new Map();\n\t\t}\n\t}\n\n\t_moveToRecent(key, item) {\n\t\tthis.oldCache.delete(key);\n\t\tthis._set(key, item);\n\t}\n\n\t* _entriesAscending() {\n\t\tfor (const item of this.oldCache) {\n\t\t\tconst [key, value] = item;\n\t\t\tif (!this.cache.has(key)) {\n\t\t\t\tconst deleted = this._deleteIfExpired(key, value);\n\t\t\t\tif (deleted === false) {\n\t\t\t\t\tyield item;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (const item of this.cache) {\n\t\t\tconst [key, value] = item;\n\t\t\tconst deleted = this._deleteIfExpired(key, value);\n\t\t\tif (deleted === false) {\n\t\t\t\tyield item;\n\t\t\t}\n\t\t}\n\t}\n\n\tget(key) {\n\t\tif (this.cache.has(key)) {\n\t\t\tconst item = this.cache.get(key);\n\n\t\t\treturn this._getItemValue(key, item);\n\t\t}\n\n\t\tif (this.oldCache.has(key)) {\n\t\t\tconst item = this.oldCache.get(key);\n\t\t\tif (this._deleteIfExpired(key, item) === false) {\n\t\t\t\tthis._moveToRecent(key, item);\n\t\t\t\treturn item.value;\n\t\t\t}\n\t\t}\n\t}\n\n\tset(key, value, {maxAge = this.maxAge} = {}) {\n\t\tconst expiry =\n\t\t\ttypeof maxAge === 'number' && maxAge !== Number.POSITIVE_INFINITY ?\n\t\t\t\tDate.now() + maxAge :\n\t\t\t\tundefined;\n\t\tif (this.cache.has(key)) {\n\t\t\tthis.cache.set(key, {\n\t\t\t\tvalue,\n\t\t\t\texpiry\n\t\t\t});\n\t\t} else {\n\t\t\tthis._set(key, {value, expiry});\n\t\t}\n\n\t\treturn this;\n\t}\n\n\thas(key) {\n\t\tif (this.cache.has(key)) {\n\t\t\treturn !this._deleteIfExpired(key, this.cache.get(key));\n\t\t}\n\n\t\tif (this.oldCache.has(key)) {\n\t\t\treturn !this._deleteIfExpired(key, this.oldCache.get(key));\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tpeek(key) {\n\t\tif (this.cache.has(key)) {\n\t\t\treturn this._peek(key, this.cache);\n\t\t}\n\n\t\tif (this.oldCache.has(key)) {\n\t\t\treturn this._peek(key, this.oldCache);\n\t\t}\n\t}\n\n\tdelete(key) {\n\t\tconst deleted = this.cache.delete(key);\n\t\tif (deleted) {\n\t\t\tthis._size--;\n\t\t}\n\n\t\treturn this.oldCache.delete(key) || deleted;\n\t}\n\n\tclear() {\n\t\tthis.cache.clear();\n\t\tthis.oldCache.clear();\n\t\tthis._size = 0;\n\t}\n\n\tresize(newSize) {\n\t\tif (!(newSize && newSize > 0)) {\n\t\t\tthrow new TypeError('`maxSize` must be a number greater than 0');\n\t\t}\n\n\t\tconst items = [...this._entriesAscending()];\n\t\tconst removeCount = items.length - newSize;\n\t\tif (removeCount < 0) {\n\t\t\tthis.cache = new Map(items);\n\t\t\tthis.oldCache = new Map();\n\t\t\tthis._size = items.length;\n\t\t} else {\n\t\t\tif (removeCount > 0) {\n\t\t\t\tthis._emitEvictions(items.slice(0, removeCount));\n\t\t\t}\n\n\t\t\tthis.oldCache = new Map(items.slice(removeCount));\n\t\t\tthis.cache = new Map();\n\t\t\tthis._size = 0;\n\t\t}\n\n\t\tthis.maxSize = newSize;\n\t}\n\n\t* keys() {\n\t\tfor (const [key] of this) {\n\t\t\tyield key;\n\t\t}\n\t}\n\n\t* values() {\n\t\tfor (const [, value] of this) {\n\t\t\tyield value;\n\t\t}\n\t}\n\n\t* [Symbol.iterator]() {\n\t\tfor (const item of this.cache) {\n\t\t\tconst [key, value] = item;\n\t\t\tconst deleted = this._deleteIfExpired(key, value);\n\t\t\tif (deleted === false) {\n\t\t\t\tyield [key, value.value];\n\t\t\t}\n\t\t}\n\n\t\tfor (const item of this.oldCache) {\n\t\t\tconst [key, value] = item;\n\t\t\tif (!this.cache.has(key)) {\n\t\t\t\tconst deleted = this._deleteIfExpired(key, value);\n\t\t\t\tif (deleted === false) {\n\t\t\t\t\tyield [key, value.value];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t* entriesDescending() {\n\t\tlet items = [...this.cache];\n\t\tfor (let i = items.length - 1; i >= 0; --i) {\n\t\t\tconst item = items[i];\n\t\t\tconst [key, value] = item;\n\t\t\tconst deleted = this._deleteIfExpired(key, value);\n\t\t\tif (deleted === false) {\n\t\t\t\tyield [key, value.value];\n\t\t\t}\n\t\t}\n\n\t\titems = [...this.oldCache];\n\t\tfor (let i = items.length - 1; i >= 0; --i) {\n\t\t\tconst item = items[i];\n\t\t\tconst [key, value] = item;\n\t\t\tif (!this.cache.has(key)) {\n\t\t\t\tconst deleted = this._deleteIfExpired(key, value);\n\t\t\t\tif (deleted === false) {\n\t\t\t\t\tyield [key, value.value];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t* entriesAscending() {\n\t\tfor (const [key, value] of this._entriesAscending()) {\n\t\t\tyield [key, value.value];\n\t\t}\n\t}\n\n\tget size() {\n\t\tif (!this._size) {\n\t\t\treturn this.oldCache.size;\n\t\t}\n\n\t\tlet oldCacheSize = 0;\n\t\tfor (const key of this.oldCache.keys()) {\n\t\t\tif (!this.cache.has(key)) {\n\t\t\t\toldCacheSize++;\n\t\t\t}\n\t\t}\n\n\t\treturn Math.min(this._size + oldCacheSize, this.maxSize);\n\t}\n\n\tentries() {\n\t\treturn this.entriesAscending();\n\t}\n\n\tforEach(callbackFunction, thisArgument = this) {\n\t\tfor (const [key, value] of this.entriesAscending()) {\n\t\t\tcallbackFunction.call(thisArgument, value, key, this);\n\t\t}\n\t}\n\n\tget [Symbol.toStringTag]() {\n\t\treturn JSON.stringify([...this.entriesAscending()]);\n\t}\n}\n","export default function(a, b) {\n return a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;\n}\n","import ascending from \"./ascending.js\";\n\nexport default function(f) {\n let delta = f;\n let compare = f;\n\n if (f.length === 1) {\n delta = (d, x) => f(d) - x;\n compare = ascendingComparator(f);\n }\n\n function left(a, x, lo, hi) {\n if (lo == null) lo = 0;\n if (hi == null) hi = a.length;\n while (lo < hi) {\n const mid = (lo + hi) >>> 1;\n if (compare(a[mid], x) < 0) lo = mid + 1;\n else hi = mid;\n }\n return lo;\n }\n\n function right(a, x, lo, hi) {\n if (lo == null) lo = 0;\n if (hi == null) hi = a.length;\n while (lo < hi) {\n const mid = (lo + hi) >>> 1;\n if (compare(a[mid], x) > 0) hi = mid;\n else lo = mid + 1;\n }\n return lo;\n }\n\n function center(a, x, lo, hi) {\n if (lo == null) lo = 0;\n if (hi == null) hi = a.length;\n const i = left(a, x, lo, hi - 1);\n return i > lo && delta(a[i - 1], x) > -delta(a[i], x) ? i - 1 : i;\n }\n\n return {left, center, right};\n}\n\nfunction ascendingComparator(f) {\n return (d, x) => ascending(f(d), x);\n}\n","import { bisector } from 'd3-array';\nimport { RemoteFile as _RemoteFile } from 'generic-filehandle';\n\nimport type * as HiGlass from '@higlass/types';\nimport type { Assembly, ChromSizes, Datum } from '@gosling-lang/gosling-schema';\n\nexport type CommonDataConfig = {\n assembly: Assembly;\n x?: string;\n xe?: string;\n x1?: string;\n x1e?: string;\n urlFetchOptions?: RequestInit;\n};\n\nexport class DataSource<File, Options> {\n chromInfo: ExtendedChromInfo;\n tilesetInfo: ReturnType<typeof tilesetInfoFromChromInfo>;\n\n constructor(public file: File, chromSizes: ChromSizes, public options: Options) {\n this.chromInfo = sizesToChromInfo(chromSizes);\n this.tilesetInfo = tilesetInfoFromChromInfo(this.chromInfo);\n }\n}\n\n/**\n * Filter data before sending to a track considering the visible genomic area in the track.\n * TODO(2022-Jul-13): Consider genomic `y` channels as well.\n */\nexport function filterUsingGenoPos(\n data: Datum[],\n [minX, maxX]: [number, number],\n config: Omit<CommonDataConfig, 'assembly'>\n) {\n const { x, xe, x1, x1e } = config;\n const definedXFields = [x, xe, x1, x1e].filter(f => f) as string[];\n return data.filter((d: Datum) => {\n if (definedXFields.length === 0) {\n // no filter applies\n return true;\n } else if (definedXFields.length === 1) {\n // filter based on one genomic position\n const value = +d[definedXFields[0]];\n return typeof value === 'number' && minX < value && value <= maxX;\n } else {\n // filter based on two genomic positions, i.e., check overlaps\n const values = definedXFields.map(f => +d[f]).filter(v => !isNaN(v));\n const minValue = Math.min(...values);\n const maxValue = Math.max(...values);\n return minX <= maxValue && minValue <= maxX;\n }\n });\n}\n\nconst chromInfoBisector = bisector((d: { pos: number }) => d.pos).left;\n\nconst chrToAbs = (chrom: string, chromPos: number, chromInfo: HiGlass.ChromInfo) =>\n chromInfo.chrPositions[chrom].pos + chromPos;\n\nconst absToChr = (absPosition: number, chromInfo: HiGlass.ChromInfo) => {\n if (!chromInfo || !chromInfo.cumPositions || !chromInfo.cumPositions.length) {\n return null;\n }\n\n let insertPoint = chromInfoBisector(chromInfo.cumPositions, absPosition);\n const lastChr = chromInfo.cumPositions[chromInfo.cumPositions.length - 1].chr;\n const lastLength = chromInfo.chromLengths[lastChr];\n\n // @ts-expect-error\n insertPoint -= insertPoint > 0 && 1;\n\n let chrPosition = Math.floor(absPosition - chromInfo.cumPositions[insertPoint].pos);\n let offset = 0;\n\n if (chrPosition < 0) {\n // before the start of the genome\n offset = chrPosition - 1;\n chrPosition = 1;\n }\n\n if (insertPoint === chromInfo.cumPositions.length - 1 && chrPosition > lastLength) {\n // beyond the last chromosome\n offset = chrPosition - lastLength;\n chrPosition = lastLength;\n }\n\n return [chromInfo.cumPositions[insertPoint].chr, chrPosition, offset, insertPoint] as const;\n};\n\n/**\n * Get a chromosome name for the consistentcy, e.g., `1` --> `chr1`.\n * @param chrName A chromosome name to be sanitized\n * @param assembly A genome assembly of the data\n * @param chromosomePrefix A prefix string that can be replaced to 'chr'\n * @returns\n */\nexport function sanitizeChrName(chrName: string, assembly: Assembly, chromosomePrefix?: string) {\n if (Array.isArray(assembly)) {\n // this is a custom assembly, so use this as is\n return chrName;\n }\n\n // For assemblies in Gosling, we use the `chr` prefix consistently\n if (chromosomePrefix) {\n // `hs1` --> `chr1`\n chrName = chrName.replace(chromosomePrefix, 'chr');\n } else if (!chrName.includes('chr')) {\n // `1` --> `chr1`\n chrName = `chr${chrName}`;\n }\n return chrName;\n}\n\nexport type ExtendedChromInfo = HiGlass.ChromInfo & {\n absToChr(absPos: number): ReturnType<typeof absToChr> | null;\n chrToAbs(chr: [name: string, pos: number]): number | null;\n};\n\nexport function tilesetInfoFromChromInfo(chromInfo: ExtendedChromInfo, tileSize = 1024) {\n return {\n tile_size: tileSize,\n bins_per_dimension: tileSize,\n max_zoom: Math.ceil(Math.log(chromInfo.totalLength / tileSize) / Math.log(2)),\n max_width: chromInfo.totalLength,\n min_pos: [0],\n max_pos: [chromInfo.totalLength]\n };\n}\n\nexport function sizesToChromInfo(sizes: [string, number][]): ExtendedChromInfo {\n const info: HiGlass.ChromInfo = {\n cumPositions: [],\n chromLengths: {},\n chrPositions: {},\n totalLength: 0\n };\n\n sizes.forEach(([chr, length], i) => {\n const chrPosition = { id: i, chr, pos: info.totalLength };\n info.chrPositions[chr] = chrPosition;\n info.chromLengths[chr] = length;\n info.cumPositions.push(chrPosition);\n info.totalLength += length;\n });\n\n return {\n ...info,\n absToChr: absPos => (info.chrPositions ? absToChr(absPos, info) : null),\n chrToAbs: ([chrName, chrPos]) => (info.chrPositions ? chrToAbs(chrName, chrPos, info) : null)\n };\n}\n\nexport class RemoteFile extends _RemoteFile {\n // Overrides `read` to eagerly read 200 or 206 response\n // from https://github.com/GMOD/generic-filehandle/blob/0e8209be25e3097307bd15e964edd8c017e808d7/src/remoteFile.ts#L100-L162\n public read: _RemoteFile['read'] = async (\n buffer,\n offset = 0,\n length,\n position = 0,\n opts = {}\n ): Promise<{ bytesRead: number; buffer: Buffer }> => {\n const { headers = {}, signal, overrides = {} } = opts;\n\n if (length < Infinity) {\n headers.range = `bytes=${position}-${position + length}`;\n } else if (length === Infinity && position !== 0) {\n headers.range = `bytes=${position}-`;\n }\n const args = {\n // @ts-expect-error private property\n ...this.baseOverrides,\n ...overrides,\n headers: {\n ...headers,\n ...overrides.headers,\n // @ts-expect-error private property\n ...this.baseOverrides.headers\n },\n method: 'GET',\n redirect: 'follow',\n mode: 'cors',\n signal\n };\n const response = await this.fetch(this.url, args);\n\n if (!response.ok) {\n throw new Error(`HTTP ${response.status} ${response.statusText} ${this.url}`);\n }\n\n // Just read the response if it was successful.\n if (response.status === 200 || response.status === 206) {\n // @ts-expect-error private method\n const responseData = await this.getBufferFromResponse(response);\n const bytesCopied = responseData.copy(buffer, offset, 0, Math.min(length, responseData.length));\n\n // try to parse out the size of the remote file\n const res = response.headers.get('content-range');\n const sizeMatch = /\\/(\\d+)$/.exec(res || '');\n if (sizeMatch && sizeMatch[1]) {\n // @ts-expect-error private property\n this._stat = { size: parseInt(sizeMatch[1], 10) };\n }\n\n return { bytesRead: bytesCopied, buffer };\n }\n\n // TODO: try harder here to gather more information about what the problem is\n throw new Error(`HTTP ${response.status} fetching ${this.url}`);\n };\n}\n\nexport interface TabularDataFetcher<Tile> {\n getTabularData(tileIds: string[]): Promise<Tile[]>;\n MAX_TILE_WIDTH?: number;\n}\n","// Adopted from https://github.com/higlass/higlass-pileup/blob/master/src/bam-fetcher-worker.js\nimport { expose, Transfer } from 'threads/worker';\nimport { BamFile as _BamFile } from '@gmod/bam';\nimport type { BamRecord } from '@gmod/bam';\nimport QuickLRU from 'quick-lru';\nimport type { TilesetInfo } from '@higlass/types';\n\nimport type { ChromSizes } from '@gosling-lang/gosling-schema';\n\nimport { DataSource, RemoteFile } from '../utils';\n\ninterface BamFileOptions {\n loadMates: boolean;\n maxInsertSize: number;\n extractJunction: boolean;\n junctionMinCoverage: number;\n urlFetchOptions?: RequestInit;\n indexUrlFetchOptions?: RequestInit;\n}\n\nfunction parseMD(mdString: string, useCounts: true): { type: string; length: number }[];\nfunction parseMD(mdString: string, useCounts: false): { pos: number; base: string; length: 1; bamSeqShift: number }[];\nfunction parseMD(mdString: string, useCounts: boolean) {\n let currPos = 0;\n let currNum = 0;\n let deletionEncountered = false;\n let bamSeqShift = 0;\n const substitutions = [];\n\n /* eslint-disable-next-line @typescript-eslint/prefer-for-of */\n for (let i = 0; i < mdString.length; i++) {\n if (mdString[i].match(/[0-9]/g)) {\n // a number, keep on going\n currNum = currNum * 10 + +mdString[i];\n deletionEncountered = false;\n } else if (mdString[i] === '^') {\n deletionEncountered = true;\n } else {\n currPos += currNum;\n\n if (useCounts) {\n substitutions.push({\n length: currNum,\n type: mdString[i]\n });\n } else if (deletionEncountered) {\n // Do nothing if there is a deletion and keep on going.\n // Note that there can be multiple deletions \"^ATC\"\n // Deletions are visualized using the CIGAR string\n // However, keep track of where in the bam seq we need to pull the variant.\n bamSeqShift -= 1;\n } else {\n substitutions.push({\n pos: currPos,\n base: mdString[i],\n length: 1,\n bamSeqShift\n });\n }\n\n currNum = 0;\n currPos += 1;\n }\n }\n\n return substitutions;\n}\n\ntype Substitution = {\n pos: number;\n length: number;\n type: 'X' | 'I' | 'D' | 'N' | '=' | 'M' | 'S' | 'H';\n variant?: string;\n};\n\nexport type Segment = {\n // if two segments have the same name but different id, they are paired reads.\n // https://github.com/GMOD/bam-js/blob/7a57d24b6aef08a1366cca86ba5092254c7a7f56/src/bamFile.ts#L386\n id: string;\n name: string;\n start: number;\n end: number;\n md: string;\n chrName: string;\n chrOffset: number;\n cigar: string;\n mapq: string;\n strand: '+' | '-';\n};\n\n/**\n * Gets an array of all substitutions in the segment\n * @param segment Current segment\n * @param seq Read sequence from bam file.\n */\nfunction getSubstitutions(segment: Segment, seq: string) {\n let substitutions: Substitution[] = [];\n let softClippingAtReadStart: null | { type: string; length: number } = null;\n\n if (segment.cigar) {\n const cigarSubs = parseMD(segment.cigar, true);\n let currPos = 0;\n\n for (const sub of cigarSubs) {\n if (sub.type === 'X') {\n // sequence mismatch, no need to do anything\n substitutions.push({\n pos: currPos,\n length: sub.length,\n type: 'X'\n });\n\n currPos += sub.length;\n } else if (sub.type === 'I') {\n substitutions.push({\n pos: currPos,\n length: sub.length,\n type: 'I'\n });\n } else if (sub.type === 'D') {\n substitutions.push({\n pos: currPos,\n length: sub.length,\n type: 'D'\n });\n currPos += sub.length;\n } else if (sub.type === 'N') {\n substitutions.push({\n pos: currPos,\n length: sub.length,\n type: 'N'\n });\n currPos += sub.length;\n } else if (sub.type === '=' || sub.type === 'M') {\n currPos += sub.length;\n } else {\n // console.log('skipping:', sub.type);\n }\n }\n\n const firstSub = cigarSubs[0];\n const lastSub = cigarSubs[cigarSubs.length - 1];\n\n // Soft clipping can happen at the beginning, at the end or both\n // positions are from the beginning of the read\n if (firstSub.type === 'S') {\n softClippingAtReadStart = firstSub;\n // soft clipping at the beginning\n substitutions.push({\n pos: -firstSub.length,\n type: 'S',\n length: firstSub.length\n });\n }\n // soft clipping at the end\n if (lastSub.type === 'S') {\n substitutions.push({\n pos: segment.end - segment.start,\n length: lastSub.length,\n type: 'S'\n });\n }\n\n // Hard clipping can happen at the beginning, at the end or both\n // positions are from the beginning of the read\n if (firstSub.type === 'H') {\n substitutions.push({\n pos: -firstSub.length,\n type: 'H',\n length: firstSub.length\n });\n }\n if (lastSub.type === 'H') {\n substitutions.push({\n pos: segment.end - segment.start,\n length: lastSub.length,\n type: 'H'\n });\n }\n }\n\n if (segment.md) {\n const mdSubstitutions = parseMD(segment.md, false);\n mdSubstitutions.forEach(function(substitution: (typeof mdSubstitutions)[number] & { variant?: string }) {\n let posStart = substitution['pos'] + substitution['bamSeqShift']!;\n let posEnd = posStart + substitution['length'];\n // When there is soft clipping at the beginning,\n // we need to shift the position where we read the variant from the sequence\n // not necessary when there is hard clipping\n if (softClippingAtReadStart !== null) {\n posStart += softClippingAtReadStart.length;\n posEnd += softClippingAtReadStart.length;\n }\n substitution['variant'] = seq.substring(posStart, posEnd);\n // @ts-expect-error\n delete substitution['bamSeqShift'];\n });\n // @ts-expect-error\n substitutions = mdSubstitutions.concat(substitutions);\n }\n\n return substitutions;\n}\n\n/////////////////////////////////////////////////////\n/// End Chrominfo\n/////////////////////////////////////////////////////\n\nconst bamRecordToJson = (bamRecord: BamRecord, chrName: string, chrOffset: number) => {\n const seq = bamRecord.get('seq');\n const segment: Segment = {\n // if two segments have the same name but different id, they are paired reads.\n id: `${bamRecord.id()}`,\n name: bamRecord.get('name'),\n // @ts-expect-error private field!!\n start: +bamRecord.data.start + 1 + chrOffset,\n // @ts-expect-error private field!!\n end: +bamRecord.data.end + 1 + chrOffset,\n md: bamRecord.get('MD'),\n chrName,\n chrOffset,\n cigar: bamRecord.get('cigar'),\n mapq: bamRecord.get('mq'),\n strand: bamRecord.get('strand') === 1 ? '+' : '-'\n };\n return Object.assign(segment, { substitutions: getSubstitutions(segment, seq) });\n};\n\ntype JsonBamRecord = ReturnType<typeof bamRecordToJson>;\n\nclass BamFile extends _BamFile {\n headerPromise: ReturnType<BamFile['getHeader']>;\n constructor(...args: ConstructorParameters<typeof _BamFile>) {\n super(...args);\n this.headerPromise = this.getHeader();\n }\n static fromUrl(url: string, indexUrl: string, urlFetchOptions?: RequestInit, indexUrlFetchOptions?: RequestInit) {\n return new BamFile({\n bamFilehandle: new RemoteFile(url, { overrides: urlFetchOptions }),\n baiFilehandle: new RemoteFile(indexUrl, { overrides: indexUrlFetchOptions })\n });\n }\n getChromNames() {\n return this.indexToChr.map((v: { refName: string; length: number }) => v.refName);\n }\n}\n\n// indexed by dataset uuid\nconst dataSources: Map<string, DataSource<BamFile, BamFileOptions>> = new Map();\n// indexed by bam url\nconst bamFileCache: Map<string, BamFile> = new Map();\nconst MAX_TILES = 20;\nconst tileValues = new QuickLRU<string, JsonBamRecord[] | { error: string }>({ maxSize: MAX_TILES });\n\nconst init = async (\n uid: string,\n bam: { url: string; indexUrl: string },\n chromSizes: ChromSizes,\n options: Partial<BamFileOptions> = {}\n) => {\n if (!bamFileCache.has(bam.url)) {\n const bamFile = BamFile.fromUrl(bam.url, bam.indexUrl, options.urlFetchOptions, options.indexUrlFetchOptions);\n await bamFile.getHeader(); // reads bam/bai headers\n\n // Infer the correct chromosome names between 'chr1' and '1'\n const firstChromNameInHeader = bamFile.getChromNames()[0];\n if (firstChromNameInHeader) {\n const headerHasPrefix = firstChromNameInHeader.includes('chr');\n const specHasPrefix = chromSizes[0]?.[0].includes('chr');\n if (headerHasPrefix && !specHasPrefix) {\n chromSizes = chromSizes.map(([s, n]) => [`chr${s}`, n]);\n } else if (!headerHasPrefix && specHasPrefix) {\n chromSizes = chromSizes.map(([s, n]) => [s.replace('chr', ''), n]);\n }\n }\n bamFileCache.set(bam.url, bamFile);\n }\n const bamFile = bamFileCache.get(bam.url)!;\n const dataSource = new DataSource(bamFile, chromSizes, {\n loadMates: false,\n maxInsertSize: 5000,\n extractJunction: false,\n junctionMinCoverage: 1,\n ...options\n });\n dataSources.set(uid, dataSource);\n};\n\nconst tilesetInfo = (uid: string) => {\n return dataSources.get(uid)!.tilesetInfo;\n};\n\nconst tile = async (uid: string, z: number, x: number): Promise<JsonBamRecord[]> => {\n const MAX_TILE_WIDTH = 200000;\n const bam = dataSources.get(uid)!;\n\n const info = tilesetInfo(uid);\n\n if (!('max_width' in info)) {\n throw new Error('tilesetInfo does not include `max_width`, which is required for the Gosling BamDataFetcher.');\n }\n\n const tileWidth = +info.max_width / 2 ** +z;\n\n const recordPromises: Promise<JsonBamRecord[]>[] = [];\n\n if (tileWidth > MAX_TILE_WIDTH) {\n // this.errorTextText('Zoomed out too far for this track. Zoomin further to see reads');\n return new Promise(resolve => resolve([]));\n }\n\n // get the bounds of the tile\n let minX = info.min_pos[0] + x * tileWidth;\n const maxX = info.min_pos[0] + (x + 1) * tileWidth;\n\n const { chromLengths, cumPositions } = bam.chromInfo;\n\n const opt = {\n viewAsPairs: bam.options.loadMates\n // TODO: Turning this on results in \"too many requests error\"\n // https://github.com/gosling-lang/gosling.js/pull/556\n // pairAcrossChr: typeof loadMates === 'undefined' ? false : loadMates,\n };\n\n tileValues.set(`${uid}.${z}.${x}`, []);\n\n /* eslint-disable-next-line @typescript-eslint/prefer-for-of */\n for (let i = 0; i < cumPositions.length; i++) {\n const chromName = cumPositions[i].chr;\n const chromStart = cumPositions[i].pos;\n const chromEnd = cumPositions[i].pos + chromLengths[chromName];\n\n if (chromStart <= minX && minX < chromEnd) {\n // start of the visible region is within this chromosome\n\n if (maxX > chromEnd) {\n // the visible region extends beyond the end of this chromosome\n // fetch from the start until the end of the chromosome\n recordPromises.push(\n bam.file\n .getRecordsForRange(chromName, minX - chromStart, chromEnd - chromStart, opt)\n .then(records => {\n const mappedRecords = records.map(rec =>\n bamRecordToJson(rec, chromName, cumPositions[i].pos)\n );\n tileValues.set(\n `${uid}.${z}.${x}`,\n (tileValues.get(`${uid}.${z}.${x}`) as JsonBamRecord[]).concat(mappedRecords)\n );\n return [];\n // return mappedRecords;\n })\n );\n\n // continue onto the next chromosome\n minX = chromEnd;\n } else {\n const startPos = Math.floor(minX - chromStart);\n const endPos = Math.ceil(maxX - chromStart);\n // the end of the region is within this chromosome\n recordPromises.push(\n bam.file.getRecordsForRange(chromName, startPos, endPos, opt).then(records => {\n const mappedRecords = records.map(rec => bamRecordToJson(rec, chromName, cumPositions[i].pos));\n tileValues.set(\n `${uid}.${z}.${x}`,\n (tileValues.get(`${uid}.${z}.${x}`) as JsonBamRecord[]).concat(mappedRecords)\n );\n return [];\n })\n );\n // end the loop because we've retrieved the last chromosome\n break;\n }\n }\n }\n\n // flatten the array of promises so that it looks like we're getting one long list of value\n return Promise.all(recordPromises).then(values => {\n return values.flat();\n });\n};\n\n/**\n * Not like other data fetchers, the Bam Data Fetcher fetches all the tiles at once.\n * @param uid\n * @param tileIds\n * @returns\n */\nconst fetchTilesDebounced = async (uid: string, tileIds: string[]) => {\n const tiles: Record<string, JsonBamRecord[] & { tilePositionId: string }> = {};\n const validTileIds: string[] = [];\n const tilePromises: Promise<JsonBamRecord[]>[] = [];\n\n for (const tileId of tileIds) {\n const parts = tileId.split('.');\n const z = parseInt(parts[0], 10);\n const x = parseInt(parts[1], 10);\n\n if (Number.isNaN(x) || Number.isNaN(z)) {\n console.warn('Invalid tile zoom or position:', z, x);\n continue;\n }\n\n validTileIds.push(tileId);\n tilePromises.push(tile(uid, z, x));\n }\n\n return Promise.all(tilePromises).then(values => {\n values.forEach((d, i) => {\n const validTileId = validTileIds[i];\n tiles[validTileId] = Object.assign(d, { tilePositionId: validTileId });\n });\n return tiles;\n });\n};\n\nconst getTabularData = (uid: string, tileIds: string[]) => {\n const { options } = dataSources.get(uid)!;\n const allSegments: Record<string, Segment & { substitutions: string }> = {};\n\n for (const tileId of tileIds) {\n const tileValue = tileValues.get(`${uid}.${tileId}`);\n\n if (!tileValue) {\n continue;\n }\n\n if ('error' in tileValue) {\n throw new Error(tileValue.error);\n }\n\n for (const segment of tileValue) {\n allSegments[segment.id] = {\n ...segment,\n substitutions: JSON.stringify(segment.substitutions)\n };\n }\n }\n\n const segments = Object.values(allSegments);\n\n // find and set mate info when the `data.loadMates` flag is on.\n if (options.loadMates) {\n // TODO: avoid mutation?\n findMates(segments, options.maxInsertSize);\n }\n\n let output: Junction[] | SegmentWithMate[] | Segment[];\n if (options.extractJunction) {\n // Reference(ggsashimi): https://github.com/guigolab/ggsashimi/blob/d686d59b4e342b8f9dcd484f0af4831cc092e5de/ggsashimi.py#L136\n output = findJunctions(segments, options.junctionMinCoverage);\n } else {\n output = segments;\n }\n\n const buffer = new TextEncoder().encode(JSON.stringify(output)).buffer;\n return Transfer(buffer, [buffer]);\n};\n\nconst groupBy = <T, K extends keyof T>(xs: readonly T[], key: K): Record<string, T[]> =>\n xs.reduce((rv, x) => {\n // @ts-expect-error\n (rv[x[key]] = rv[x[key]] || []).push(x);\n return rv;\n }, {});\n\nexport type SegmentWithMate = Segment & {\n mateIds: string[];\n foundMate: boolean;\n insertSize: number;\n largeInsertSize: boolean;\n svType: string;\n numMates: number;\n};\n\nconst findMates = (segments: Segment[], maxInsertSize = 0) => {\n // @ts-expect-error This methods mutates this above aob\n const segmentsByReadName: Record<string, SegmentWithMate[]> = groupBy(segments, 'name');\n\n // Iterate entries and set information about mates\n Object.values(segmentsByReadName).forEach(segmentGroup => {\n if (segmentGroup.length === 2) {\n const read = segmentGroup[0];\n const mate = segmentGroup[1];\n read.mateIds = [mate.id];\n mate.mateIds = [read.id];\n // Additional info we want\n const [l, r] = [read, mate].sort((a, b) => +a.start - +b.start);\n const insertSize = Math.max(0, +r.start - +l.end);\n const largeInsertSize = insertSize >= maxInsertSize;\n\n let svType: string;\n if (!largeInsertSize) {\n svType = 'normal read';\n } else if (l.strand === '+' && r.strand === '-') {\n svType = 'deletion (+-)';\n } else if (l.strand === '+' && r.strand === '+') {\n svType = 'inversion (++)';\n } else if (l.strand === '-' && r.strand === '-') {\n svType = 'inversion (--)';\n } else if (l.strand === '-' && r.strand === '+') {\n svType = 'duplication (-+)';\n } else {\n svType = `(${l.strand}${r.strand})`;\n }\n\n // if(largeInsertSize) console.log(svType);\n [read, mate].forEach(d => {\n d.foundMate = true;\n d.insertSize = insertSize;\n d.largeInsertSize = largeInsertSize;\n d.svType = svType;\n d.numMates = 2;\n });\n } else {\n // We do not handle such cases for now\n segmentGroup.forEach(d => {\n d.mateIds = segmentGroup.filter(mate => mate.id !== d.id).map(mate => mate.id);\n d.foundMate = false;\n d.insertSize = -1;\n d.largeInsertSize = false;\n d.svType = segmentGroup.length === 1 ? 'mates not found within chromosome' : 'more than two mates';\n d.numMates = segmentGroup.length;\n });\n }\n });\n return segmentsByReadName;\n};\n\nexport type Junction = { start: number; end: number; score: number };\n\nconst findJunctions = (segments: { start: number; end: number; substitutions: string }[], minCoverage = 0) => {\n const junctions: Junction[] = [];\n segments.forEach(segment => {\n const substitutions: { pos: number; length: number }[] = JSON.parse(segment.substitutions);\n substitutions.forEach(sub => {\n const don = segment.start + sub.pos;\n const acc = segment.start + sub.pos + sub.length;\n if (segment.start < don && acc < segment.end) {\n const j = junctions.find(d => d.start === don && d.end === acc);\n if (j) {\n j.score += 1;\n } else {\n junctions.push({ start: don, end: acc, score: 1 });\n }\n }\n });\n });\n return junctions.filter(d => d.score >= minCoverage);\n};\n\nconst tileFunctions = {\n init,\n tilesetInfo,\n fetchTilesDebounced,\n tile,\n getTabularData\n};\n\nexpose(tileFunctions);\n\nexport type WorkerApi = typeof tileFunctions;\nexport type { TilesetInfo };\nexport type Tiles = Awaited<ReturnType<typeof fetchTilesDebounced>>;\n"],"names":["common","require$$0","Transfer","isWorkerRuntime","postMessageToMaster","subscribeToMasterMessages","this","require$$1","require$$2","require$$3","isObservable","expose","Long","fromBytes","long","len","i","len2","buffer","ieee754","Buffer","byteLength","init","crc32","trees","require$$4","deflate","deflate_1","strings","inflate","inflate_1","require$$5","require$$6","constants","Inflate","Z_SYNC_FLUSH","entries","_getPrototypeOf","o","_setPrototypeOf","p","self","_get","Emitter","AbortSignal","AbortController","Request","abortableFetch","global","AggregateAbortController_1","AggregateAbortController","AggregateStatusReporter_1","AggregateStatusReporter","AbortablePromiseCache_1","AbortablePromiseCache","QuickLRU","RemoteFile","feats","BAMFeature","_RemoteFile","_BamFile","bamFile"],"mappings":";;;;;;;;;;;;;;;AAEc,mBAAG,WAAS;AACzB,UAAI,CAAC,OAAO;AACX,eAAO;AAAA,MACT;AAGC,UAAI,OAAO,OAAO,eAAe,YAAY,OAAO,MAAM,OAAO,UAAU,MAAM,YAAY;AAE5F,eAAO,UAAU,MAAM,OAAO,UAAU,EAAG;AAAA,MAC7C;AAEC,UAAI,OAAO,MAAM,cAAc,MAAM,YAAY;AAChD,eAAO,UAAU,MAAM,cAAc,EAAG;AAAA,MAC1C;AAEC,aAAO;AAAA,IACP;;;;;;;;;ACjBD,WAAO,eAAe,aAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,gBAAA,oBAA4B,YAAA,mBAA2B;AACvD,aAAS,iBAAiB,QAAQ,gBAAgB;AAC9C,YAAM,uBAAuB,OAAO,YAAY,KAAK,MAAM;AAC3D,YAAM,qBAAqB,OAAO,UAAU,KAAK,MAAM;AACvD,aAAO;AAAA,QACH,YAAY,SAAS;AACjB,iBAAO,eAAe,YAAY,SAAS,oBAAoB;AAAA,QAClE;AAAA,QACD,UAAU,OAAO;AACb,iBAAO,eAAe,UAAU,OAAO,kBAAkB;AAAA,QACrE;AAAA,MACK;AAAA,IACL;AACA,gBAAA,mBAA2B;AAC3B,UAAM,yBAAyB;AAAA,MAC3B,YAAY,SAAS;AACjB,eAAO,OAAO,OAAO,MAAM,QAAQ,OAAO,GAAG;AAAA,UACzC,MAAM,QAAQ;AAAA,UACd,OAAO,QAAQ;AAAA,QAC3B,CAAS;AAAA,MACJ;AAAA,MACD,UAAU,OAAO;AACb,eAAO;AAAA,UACH,gBAAgB;AAAA,UAChB,SAAS,MAAM;AAAA,UACf,MAAM,MAAM;AAAA,UACZ,OAAO,MAAM;AAAA,QAChB;AAAA,MACT;AAAA,IACC;AACD,UAAM,oBAAoB,CAAC,UAAU,SAAS,OAAO,UAAU,YAAY,oBAAoB,SAAS,MAAM,mBAAmB;AACjI,gBAAA,oBAA4B;AAAA,MACxB,YAAY,SAAS;AACjB,YAAI,kBAAkB,OAAO,GAAG;AAC5B,iBAAO,uBAAuB,YAAY,OAAO;AAAA,QAC7D,OACa;AACD,iBAAO;AAAA,QACnB;AAAA,MACK;AAAA,MACD,UAAU,OAAO;AACb,YAAI,iBAAiB,OAAO;AACxB,iBAAO,uBAAuB,UAAU,KAAK;AAAA,QACzD,OACa;AACD,iBAAO;AAAA,QACnB;AAAA,MACA;AAAA,IACC;;;;;;;ACjDD,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,MAAM;AAC5DA,aAAA,YAAoBA,SAAmB,cAAGA,SAA0B,qBAAG;AACvE,UAAM,gBAAwCC,mCAAA;AAC9C,QAAI,uBAAuB,cAAc;AACzC,aAAS,mBAAmB,YAAY;AACpC,6BAAuB,cAAc,iBAAiB,sBAAsB,UAAU;AAAA,IAC1F;AACAD,aAAA,qBAA6B;AAC7B,aAAS,YAAY,SAAS;AAC1B,aAAO,qBAAqB,YAAY,OAAO;AAAA,IACnD;AACAA,aAAA,cAAsB;AACtB,aAAS,UAAU,OAAO;AACtB,aAAO,qBAAqB,UAAU,KAAK;AAAA,IAC/C;AACAA,aAAA,YAAoB;;;;;;;;;ACfpB,WAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM;AAC7C,YAAA,UAAG,QAAqB,gBAAG,QAAkB,aAAG,kBAAkB,QAAA,UAAkB;AACnG,YAAA,UAAkB,OAAO,eAAe;AACxC,YAAA,UAAkB,OAAO,eAAe;AACxC,YAAA,aAAqB,OAAO,kBAAkB;AAC9C,YAAA,gBAAwB,OAAO,qBAAqB;AACpD,YAAA,UAAkB,OAAO,eAAe;;;;;;;ACNxC,WAAO,eAAe,cAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,iBAAA,WAAmB,aAAA,uBAA+B;AAClD,UAAM,YAAgCC,+BAAA;AACtC,aAAS,eAAe,OAAO;AAC3B,UAAI,CAAC,SAAS,OAAO,UAAU;AAC3B,eAAO;AAEX,aAAO;AAAA,IACX;AACA,aAAS,qBAAqB,OAAO;AACjC,aAAO,SAAS,OAAO,UAAU,YAAY,MAAM,UAAU,aAAa;AAAA,IAC9E;AACA,iBAAA,uBAA+B;AAC/B,aAASC,UAAS,SAAS,eAAe;AACtC,UAAI,CAAC,eAAe;AAChB,YAAI,CAAC,eAAe,OAAO;AACvB,gBAAM,MAAO;AACjB,wBAAgB,CAAC,OAAO;AAAA,MAChC;AACI,aAAO;AAAA,QACH,CAAC,UAAU,aAAa,GAAG;AAAA,QAC3B,MAAM;AAAA,QACN;AAAA,MACH;AAAA,IACL;AACA,iBAAA,WAAmBA;;;;;;;;;ACzBnB,aAAO,eAAc,SAAU,cAAc,EAAE,OAAO,MAAM;AAC5D,cAA4B,oBAAA,QAAA,oBAA4B;AAIxD,OAAC,SAAU,mBAAmB;AAC1B,0BAAkB,QAAQ,IAAI;AAC9B,0BAAkB,KAAK,IAAI;AAAA,MAC9B,GAAsB,QAAQ,sBAAsB,QAAA,oBAA4B,CAAE,EAAC;AAIpF,OAAC,SAAU,mBAAmB;AAC1B,0BAAkB,OAAO,IAAI;AAC7B,0BAAkB,MAAM,IAAI;AAC5B,0BAAkB,QAAQ,IAAI;AAC9B,0BAAkB,SAAS,IAAI;AAC/B,0BAAkB,eAAe,IAAI;AAAA,SAClB,QAAQ,sBAAsB,QAAA,oBAA4B,CAAA,EAAG;AAAA;;;;;;;;AChBpF,WAAO,eAAe,wBAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,UAAM,kBAAkB,SAASC,mBAAkB;AAC/C,YAAM,kBAAkB,OAAO,SAAS,eAAe,OAAO,WAAW,eAAe,gBAAgB;AACxG,aAAO,OAAO,SAAS,eAAe,KAAK,eAAe,CAAC,kBAAkB,OAAO;AAAA,IACvF;AACD,UAAM,sBAAsB,SAASC,qBAAoB,MAAM,cAAc;AACzE,WAAK,YAAY,MAAM,YAAY;AAAA,IACtC;AACD,UAAM,4BAA4B,SAASC,2BAA0B,WAAW;AAC5E,YAAM,iBAAiB,CAAC,iBAAiB;AACrC,kBAAU,aAAa,IAAI;AAAA,MAC9B;AACD,YAAM,cAAc,MAAM;AACtB,aAAK,oBAAoB,WAAW,cAAc;AAAA,MACrD;AACD,WAAK,iBAAiB,WAAW,cAAc;AAC/C,aAAO;AAAA,IACV;AACD,2BAAA,UAAkB;AAAA,MACd;AAAA,MACA;AAAA,MACA;AAAA,IACH;;;;;;;;ACxBD,UAAI,YAAaC,UAAQA,OAAK,aAAc,SAAU,SAAS,YAAY,GAAG,WAAW;AACrF,iBAAS,MAAM,OAAO;AAAE,iBAAO,iBAAiB,IAAI,QAAQ,IAAI,EAAE,SAAU,SAAS;AAAE,oBAAQ,KAAK;AAAA,UAAI,CAAA;AAAA,QAAE;AAC1G,eAAO,KAAK,MAAM,IAAI,UAAU,SAAU,SAAS,QAAQ;AACvD,mBAAS,UAAU,OAAO;AAAE,gBAAI;AAAE,mBAAK,UAAU,KAAK,KAAK,CAAC;AAAA,YAAI,SAAQ,GAAG;AAAE,qBAAO,CAAC;AAAA,YAAI;AAAA,UAAA;AACzF,mBAAS,SAAS,OAAO;AAAE,gBAAI;AAAE,mBAAK,UAAU,OAAO,EAAE,KAAK,CAAC;AAAA,YAAI,SAAQ,GAAG;AAAE,qBAAO,CAAC;AAAA,YAAI;AAAA,UAAA;AAC5F,mBAAS,KAAK,QAAQ;AAAE,mBAAO,OAAO,QAAQ,OAAO,KAAK,IAAI,MAAM,OAAO,KAAK,EAAE,KAAK,WAAW,QAAQ;AAAA,UAAE;AAC5G,gBAAM,YAAY,UAAU,MAAM,SAAS,cAAc,CAAA,CAAE,GAAG,MAAM;AAAA,QAC5E,CAAK;AAAA,MACJ;AACD,UAAI,kBAAmBA,UAAQA,OAAK,mBAAoB,SAAU,KAAK;AACnE,eAAQ,OAAO,IAAI,aAAc,MAAM,EAAE,WAAW,IAAK;AAAA,MAC5D;AACD,aAAO,eAAc,SAAU,cAAc,EAAE,OAAO,MAAM;AAC5D,cAAA,SAAiB,QAA0B,kBAAA,QAAA,WAAmB,QAA6B,qBAAA;AAC3F,YAAM,kBAAkB,gBAAgBL,qBAAwB;AAChE,YAAM,WAA+BM,gCAAA;AACrC,YAAM,iBAA2CC,oCAAA;AACjD,YAAM,aAAyCC,kCAAA;AAC/C,YAAM,mBAAmB,+DAA2C;AACpE,UAAI,WAA+BF,gCAAA;AACnC,aAAO,eAAe,SAAS,sBAAsB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,eAAO,SAAS;AAAA,MAAqB,EAAA,CAAE;AACnI,UAAI,iBAA2CC,oCAAA;AAC/C,aAAO,eAAe,SAAS,YAAY,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,eAAO,eAAe;AAAA,MAAW,EAAA,CAAE;AAErH,cAAA,kBAA0B,iBAAiB,QAAQ;AACnD,UAAI,eAAe;AACnB,YAAM,sBAAsB,oBAAI,IAAK;AACrC,YAAM,2BAA2B,CAAC,UAAU,SAAS,MAAM,SAAS,WAAW,kBAAkB;AACjG,YAAM,wBAAwB,CAAC,UAAU,SAAS,MAAM,SAAS,WAAW,kBAAkB;AAK9F,YAAME,gBAAe,CAAC,UAAU,gBAAgB,QAAQ,KAAK,KAAK,gBAAgB,KAAK;AACvF,eAAS,gBAAgB,OAAO;AAC5B,eAAO,SAAS,OAAO,UAAU,YAAY,OAAO,MAAM,cAAc;AAAA,MAC5E;AACA,eAAS,oBAAoB,OAAO;AAChC,eAAO,eAAe,qBAAqB,KAAK,IAC1C,EAAE,SAAS,MAAM,MAAM,eAAe,MAAM,cAAa,IACzD,EAAE,SAAS,OAAO,eAAe,OAAW;AAAA,MACtD;AACA,eAAS,0BAA0B;AAC/B,cAAM,cAAc;AAAA,UAChB,MAAM,WAAW,kBAAkB;AAAA,UACnC,SAAS;AAAA,YACL,MAAM;AAAA,UAClB;AAAA,QACK;AACD,yBAAiB,QAAQ,oBAAoB,WAAW;AAAA,MAC5D;AACA,eAAS,sBAAsB,aAAa;AACxC,cAAM,cAAc;AAAA,UAChB,MAAM,WAAW,kBAAkB;AAAA,UACnC,SAAS;AAAA,YACL,MAAM;AAAA,YACN,SAAS;AAAA,UACrB;AAAA,QACK;AACD,yBAAiB,QAAQ,oBAAoB,WAAW;AAAA,MAC5D;AACA,eAAS,oBAAoB,KAAK,UAAU;AACxC,cAAM,EAAE,SAAS,OAAO,cAAa,IAAK,oBAAoB,QAAQ;AACtE,cAAM,eAAe;AAAA,UACjB,MAAM,WAAW,kBAAkB;AAAA,UACnC;AAAA,UACA,OAAO,SAAS,UAAU,KAAK;AAAA,QAClC;AACD,yBAAiB,QAAQ,oBAAoB,cAAc,aAAa;AAAA,MAC5E;AACA,eAAS,qBAAqB,KAAK,WAAW,aAAa;AACvD,cAAM,EAAE,SAAS,kBAAkB,oBAAoB,WAAW;AAClE,cAAM,gBAAgB;AAAA,UAClB,MAAM,WAAW,kBAAkB;AAAA,UACnC;AAAA,UACA,UAAU,YAAY,OAAO;AAAA,UAC7B;AAAA,QACH;AACD,yBAAiB,QAAQ,oBAAoB,eAAe,aAAa;AAAA,MAC7E;AACA,eAAS,oBAAoB,KAAK,YAAY;AAC1C,cAAM,eAAe;AAAA,UACjB,MAAM,WAAW,kBAAkB;AAAA,UACnC;AAAA,UACA;AAAA,QACH;AACD,yBAAiB,QAAQ,oBAAoB,YAAY;AAAA,MAC7D;AACA,eAAS,yBAAyB,OAAO;AACrC,YAAI;AACA,gBAAM,eAAe;AAAA,YACjB,MAAM,WAAW,kBAAkB;AAAA,YACnC,OAAO,SAAS,UAAU,KAAK;AAAA,UAClC;AACD,2BAAiB,QAAQ,oBAAoB,YAAY;AAAA,QACjE,SACW,UAAU;AAEb,kBAAQ,MAAM,8HAES,UAAU,qBAAqB,KAAK;AAAA,QACnE;AAAA,MACA;AACA,eAAS,YAAY,QAAQ,IAAI,MAAM;AACnC,eAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,cAAI;AACJ,cAAI;AACA,yBAAa,GAAG,GAAG,IAAI;AAAA,UACnC,SACe,OAAO;AACV,mBAAO,oBAAoB,QAAQ,KAAK;AAAA,UACpD;AACQ,gBAAM,aAAaA,cAAa,UAAU,IAAI,eAAe;AAC7D,8BAAoB,QAAQ,UAAU;AACtC,cAAIA,cAAa,UAAU,GAAG;AAC1B,kBAAM,eAAe,WAAW,UAAU,WAAS,qBAAqB,QAAQ,OAAO,SAAS,UAAU,KAAK,CAAC,GAAG,WAAS;AACxH,kCAAoB,QAAQ,SAAS,UAAU,KAAK,CAAC;AACrD,kCAAoB,OAAO,MAAM;AAAA,YACjD,GAAe,MAAM;AACL,mCAAqB,QAAQ,IAAI;AACjC,kCAAoB,OAAO,MAAM;AAAA,YACjD,CAAa;AACD,gCAAoB,IAAI,QAAQ,YAAY;AAAA,UACxD,OACa;AACD,gBAAI;AACA,oBAAM,SAAS,MAAM;AACrB,mCAAqB,QAAQ,MAAM,SAAS,UAAU,MAAM,CAAC;AAAA,YAC7E,SACmB,OAAO;AACV,kCAAoB,QAAQ,SAAS,UAAU,KAAK,CAAC;AAAA,YACrE;AAAA,UACA;AAAA,QACA,CAAK;AAAA,MACL;AAQA,eAASC,QAAO,SAAS;AACrB,YAAI,CAAC,iBAAiB,QAAQ,mBAAmB;AAC7C,gBAAM,MAAM,uCAAuC;AAAA,QAC3D;AACI,YAAI,cAAc;AACd,gBAAM,MAAM,4HAA4H;AAAA,QAChJ;AACI,uBAAe;AACf,YAAI,OAAO,YAAY,YAAY;AAC/B,2BAAiB,QAAQ,0BAA0B,iBAAe;AAC9D,gBAAI,sBAAsB,WAAW,KAAK,CAAC,YAAY,QAAQ;AAC3D,0BAAY,YAAY,KAAK,SAAS,YAAY,KAAK,IAAI,SAAS,WAAW,CAAC;AAAA,YAChG;AAAA,UACA,CAAS;AACD,kCAAyB;AAAA,QACjC,WACa,OAAO,YAAY,YAAY,SAAS;AAC7C,2BAAiB,QAAQ,0BAA0B,iBAAe;AAC9D,gBAAI,sBAAsB,WAAW,KAAK,YAAY,QAAQ;AAC1D,0BAAY,YAAY,KAAK,QAAQ,YAAY,MAAM,GAAG,YAAY,KAAK,IAAI,SAAS,WAAW,CAAC;AAAA,YACpH;AAAA,UACA,CAAS;AACD,gBAAM,cAAc,OAAO,KAAK,OAAO,EAAE,OAAO,SAAO,OAAO,QAAQ,GAAG,MAAM,UAAU;AACzF,gCAAsB,WAAW;AAAA,QACzC,OACS;AACD,gBAAM,MAAM,+EAA+E,OAAO,EAAE;AAAA,QAC5G;AACI,yBAAiB,QAAQ,0BAA0B,iBAAe;AAC9D,cAAI,yBAAyB,WAAW,GAAG;AACvC,kBAAM,SAAS,YAAY;AAC3B,kBAAM,eAAe,oBAAoB,IAAI,MAAM;AACnD,gBAAI,cAAc;AACd,2BAAa,YAAa;AAC1B,kCAAoB,OAAO,MAAM;AAAA,YACjD;AAAA,UACA;AAAA,QACA,CAAK;AAAA,MACL;AACA,cAAA,SAAiBA;AACjB,UAAI,OAAO,SAAS,eAAe,OAAO,KAAK,qBAAqB,cAAc,iBAAiB,QAAQ,mBAAmB;AAC1H,aAAK,iBAAiB,SAAS,WAAS;AAEpC,qBAAW,MAAM,yBAAyB,MAAM,SAAS,KAAK,GAAG,GAAG;AAAA,QAC5E,CAAK;AACD,aAAK,iBAAiB,sBAAsB,WAAS;AACjD,gBAAM,QAAQ,MAAM;AACpB,cAAI,SAAS,OAAO,MAAM,YAAY,UAAU;AAE5C,uBAAW,MAAM,yBAAyB,KAAK,GAAG,GAAG;AAAA,UACjE;AAAA,QACA,CAAK;AAAA,MACL;AACA,UAAI,OAAO,YAAY,eAAe,OAAO,QAAQ,OAAO,cAAc,iBAAiB,QAAQ,mBAAmB;AAClH,gBAAQ,GAAG,qBAAqB,CAAC,UAAU;AAEvC,qBAAW,MAAM,yBAAyB,KAAK,GAAG,GAAG;AAAA,QAC7D,CAAK;AACD,gBAAQ,GAAG,sBAAsB,CAAC,UAAU;AACxC,cAAI,SAAS,OAAO,MAAM,YAAY,UAAU;AAE5C,uBAAW,MAAM,yBAAyB,KAAK,GAAG,GAAG;AAAA,UACjE;AAAA,QACA,CAAK;AAAA,MACL;AAAA;;;;;AC7MO,QAAM,SAAS,cAAc;AACF,gBAAc;AACzC,QAAM,WAAW,cAAc;;;;;;ACJxB,WAAGC;AAKjB,QAAI,OAAO;AAEX,QAAI;AACF,aAAO,IAAI,YAAY,SAAS,IAAI,YAAY,OAAO,IAAI,WAAW;AAAA,QACpE;AAAA,QAAG;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAG;AAAA,QAAK;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAK;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAK;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAK;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAK;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAK;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAK;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAI;AAAA,QAAG;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAK;AAAA,QAAK;AAAA,QAAI;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA,QAAK;AAAA,MAC9nC,CAAG,CAAC,GAAG,EAAE,EAAE;AAAA,IACV,SAAQ,GAAG;AAAA,IAEX;AAYD,aAASA,MAAK,KAAK,MAAM,UAAU;AAM/B,WAAK,MAAM,MAAM;AAMjB,WAAK,OAAO,OAAO;AAMnB,WAAK,WAAW,CAAC,CAAC;AAAA,IACrB;AAyBD,IAAAA,MAAK,UAAU;AAEf,WAAO,eAAeA,MAAK,WAAW,cAAc,EAAE,OAAO,KAAI,CAAE;AAQnE,aAAS,OAAO,KAAK;AACjB,cAAQ,OAAO,IAAI,YAAY,OAAO;AAAA,IACzC;AAQD,IAAAA,MAAK,SAAS;AAOd,QAAI,YAAY,CAAA;AAOhB,QAAI,aAAa,CAAA;AAQjB,aAAS,QAAQ,OAAO,UAAU;AAC9B,UAAI,KAAK,WAAW;AACpB,UAAI,UAAU;AACV,mBAAW;AACX,YAAI,QAAS,KAAK,SAAS,QAAQ,KAAM;AACrC,sBAAY,WAAW,KAAK;AAC5B,cAAI;AACA,mBAAO;AAAA,QACd;AACD,cAAM,SAAS,QAAQ,QAAQ,KAAK,IAAI,KAAK,GAAG,IAAI;AACpD,YAAI;AACA,qBAAW,KAAK,IAAI;AACxB,eAAO;AAAA,MACf,OAAW;AACH,iBAAS;AACT,YAAI,QAAS,QAAQ,SAAS,QAAQ,KAAM;AACxC,sBAAY,UAAU,KAAK;AAC3B,cAAI;AACA,mBAAO;AAAA,QACd;AACD,cAAM,SAAS,OAAO,QAAQ,IAAI,KAAK,GAAG,KAAK;AAC/C,YAAI;AACA,oBAAU,KAAK,IAAI;AACvB,eAAO;AAAA,MACV;AAAA,IACJ;AASD,IAAAA,MAAK,UAAU;AAQf,aAAS,WAAW,OAAO,UAAU;AACjC,UAAI,MAAM,KAAK;AACX,eAAO,WAAW,QAAQ;AAC9B,UAAI,UAAU;AACV,YAAI,QAAQ;AACR,iBAAO;AACX,YAAI,SAAS;AACT,iBAAO;AAAA,MACnB,OAAW;AACH,YAAI,SAAS;AACT,iBAAO;AACX,YAAI,QAAQ,KAAK;AACb,iBAAO;AAAA,MACd;AACD,UAAI,QAAQ;AACR,eAAO,WAAW,CAAC,OAAO,QAAQ,EAAE,IAAG;AAC3C,aAAO,SAAU,QAAQ,iBAAkB,GAAI,QAAQ,iBAAkB,GAAG,QAAQ;AAAA,IACvF;AASD,IAAAA,MAAK,aAAa;AASlB,aAAS,SAAS,SAAS,UAAU,UAAU;AAC3C,aAAO,IAAIA,MAAK,SAAS,UAAU,QAAQ;AAAA,IAC9C;AAWD,IAAAA,MAAK,WAAW;AAShB,QAAI,UAAU,KAAK;AASnB,aAAS,WAAW,KAAK,UAAU,OAAO;AACtC,UAAI,IAAI,WAAW;AACf,cAAM,MAAM,cAAc;AAC9B,UAAI,QAAQ,SAAS,QAAQ,cAAc,QAAQ,eAAe,QAAQ;AACtE,eAAO;AACX,UAAI,OAAO,aAAa,UAAU;AAE9B,gBAAQ,UACR,WAAW;AAAA,MACnB,OAAW;AACH,mBAAW,CAAC,CAAE;AAAA,MACjB;AACD,cAAQ,SAAS;AACjB,UAAI,QAAQ,KAAK,KAAK;AAClB,cAAM,WAAW,OAAO;AAE5B,UAAI;AACJ,WAAK,IAAI,IAAI,QAAQ,GAAG,KAAK;AACzB,cAAM,MAAM,iBAAiB;AAAA,eACxB,MAAM,GAAG;AACd,eAAO,WAAW,IAAI,UAAU,CAAC,GAAG,UAAU,KAAK,EAAE;MACxD;AAID,UAAI,eAAe,WAAW,QAAQ,OAAO,CAAC,CAAC;AAE/C,UAAI,SAAS;AACb,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,GAAG;AACpC,YAAI,OAAO,KAAK,IAAI,GAAG,IAAI,SAAS,CAAC,GACjC,QAAQ,SAAS,IAAI,UAAU,GAAG,IAAI,IAAI,GAAG,KAAK;AACtD,YAAI,OAAO,GAAG;AACV,cAAI,QAAQ,WAAW,QAAQ,OAAO,IAAI,CAAC;AAC3C,mBAAS,OAAO,IAAI,KAAK,EAAE,IAAI,WAAW,KAAK,CAAC;AAAA,QAC5D,OAAe;AACH,mBAAS,OAAO,IAAI,YAAY;AAChC,mBAAS,OAAO,IAAI,WAAW,KAAK,CAAC;AAAA,QACxC;AAAA,MACJ;AACD,aAAO,WAAW;AAClB,aAAO;AAAA,IACV;AAUD,IAAAA,MAAK,aAAa;AASlB,aAAS,UAAU,KAAK,UAAU;AAC9B,UAAI,OAAO,QAAQ;AACf,eAAO,WAAW,KAAK,QAAQ;AACnC,UAAI,OAAO,QAAQ;AACf,eAAO,WAAW,KAAK,QAAQ;AAEnC,aAAO,SAAS,IAAI,KAAK,IAAI,MAAM,OAAO,aAAa,YAAY,WAAW,IAAI,QAAQ;AAAA,IAC7F;AASD,IAAAA,MAAK,YAAY;AAUjB,QAAI,iBAAiB,KAAK;AAO1B,QAAI,iBAAiB,KAAK;AAO1B,QAAI,iBAAiB,iBAAiB;AAOtC,QAAI,iBAAiB,iBAAiB;AAOtC,QAAI,iBAAiB,iBAAiB;AAOtC,QAAI,aAAa,QAAQ,cAAc;AAMvC,QAAI,OAAO,QAAQ,CAAC;AAMpB,IAAAA,MAAK,OAAO;AAMZ,QAAI,QAAQ,QAAQ,GAAG,IAAI;AAM3B,IAAAA,MAAK,QAAQ;AAMb,QAAI,MAAM,QAAQ,CAAC;AAMnB,IAAAA,MAAK,MAAM;AAMX,QAAI,OAAO,QAAQ,GAAG,IAAI;AAM1B,IAAAA,MAAK,OAAO;AAMZ,QAAI,UAAU,QAAQ,EAAE;AAMxB,IAAAA,MAAK,UAAU;AAMf,QAAI,YAAY,SAAS,aAAW,GAAG,aAAW,GAAG,KAAK;AAM1D,IAAAA,MAAK,YAAY;AAMjB,QAAI,qBAAqB,SAAS,aAAW,GAAG,aAAW,GAAG,IAAI;AAMlE,IAAAA,MAAK,qBAAqB;AAM1B,QAAI,YAAY,SAAS,GAAG,aAAW,GAAG,KAAK;AAM/C,IAAAA,MAAK,YAAY;AAMjB,QAAI,gBAAgBA,MAAK;AAMzB,kBAAc,QAAQ,SAAS,QAAQ;AACnC,aAAO,KAAK,WAAW,KAAK,QAAQ,IAAI,KAAK;AAAA,IACjD;AAMA,kBAAc,WAAW,SAAS,WAAW;AACzC,UAAI,KAAK;AACL,gBAAS,KAAK,SAAS,KAAK,kBAAmB,KAAK,QAAQ;AAChE,aAAO,KAAK,OAAO,kBAAkB,KAAK,QAAQ;AAAA,IACtD;AASA,kBAAc,WAAW,SAAS,SAAS,OAAO;AAC9C,cAAQ,SAAS;AACjB,UAAI,QAAQ,KAAK,KAAK;AAClB,cAAM,WAAW,OAAO;AAC5B,UAAI,KAAK,OAAQ;AACb,eAAO;AACX,UAAI,KAAK,cAAc;AACnB,YAAI,KAAK,GAAG,SAAS,GAAG;AAGpB,cAAI,YAAY,WAAW,KAAK,GAC5B,MAAM,KAAK,IAAI,SAAS,GACxB,OAAO,IAAI,IAAI,SAAS,EAAE,IAAI,IAAI;AACtC,iBAAO,IAAI,SAAS,KAAK,IAAI,KAAK,MAAO,EAAC,SAAS,KAAK;AAAA,QAC3D;AACG,iBAAO,MAAM,KAAK,IAAK,EAAC,SAAS,KAAK;AAAA,MAC7C;AAID,UAAI,eAAe,WAAW,QAAQ,OAAO,CAAC,GAAG,KAAK,QAAQ,GAC1D,MAAM;AACV,UAAI,SAAS;AACb,aAAO,MAAM;AACT,YAAI,SAAS,IAAI,IAAI,YAAY,GAC7B,SAAS,IAAI,IAAI,OAAO,IAAI,YAAY,CAAC,EAAE,MAAK,MAAO,GACvD,SAAS,OAAO,SAAS,KAAK;AAClC,cAAM;AACN,YAAI,IAAI,OAAQ;AACZ,iBAAO,SAAS;AAAA,aACf;AACD,iBAAO,OAAO,SAAS;AACnB,qBAAS,MAAM;AACnB,mBAAS,KAAK,SAAS;AAAA,QAC1B;AAAA,MACJ;AAAA,IACL;AAMA,kBAAc,cAAc,SAAS,cAAc;AAC/C,aAAO,KAAK;AAAA,IAChB;AAMA,kBAAc,sBAAsB,SAAS,sBAAsB;AAC/D,aAAO,KAAK,SAAS;AAAA,IACzB;AAMA,kBAAc,aAAa,SAAS,aAAa;AAC7C,aAAO,KAAK;AAAA,IAChB;AAMA,kBAAc,qBAAqB,SAAS,qBAAqB;AAC7D,aAAO,KAAK,QAAQ;AAAA,IACxB;AAMA,kBAAc,gBAAgB,SAAS,gBAAgB;AACnD,UAAI,KAAK,WAAY;AACjB,eAAO,KAAK,GAAG,SAAS,IAAI,KAAK,KAAK,MAAM;AAChD,UAAI,MAAM,KAAK,QAAQ,IAAI,KAAK,OAAO,KAAK;AAC5C,eAAS,MAAM,IAAI,MAAM,GAAG;AACxB,aAAK,MAAO,KAAK,QAAS;AACtB;AACR,aAAO,KAAK,QAAQ,IAAI,MAAM,KAAK,MAAM;AAAA,IAC7C;AAMA,kBAAc,SAAS,SAAS,SAAS;AACrC,aAAO,KAAK,SAAS,KAAK,KAAK,QAAQ;AAAA,IAC3C;AAMA,kBAAc,MAAM,cAAc;AAMlC,kBAAc,aAAa,SAAS,aAAa;AAC7C,aAAO,CAAC,KAAK,YAAY,KAAK,OAAO;AAAA,IACzC;AAMA,kBAAc,aAAa,SAAS,aAAa;AAC7C,aAAO,KAAK,YAAY,KAAK,QAAQ;AAAA,IACzC;AAMA,kBAAc,QAAQ,SAAS,QAAQ;AACnC,cAAQ,KAAK,MAAM,OAAO;AAAA,IAC9B;AAMA,kBAAc,SAAS,SAAS,SAAS;AACrC,cAAQ,KAAK,MAAM,OAAO;AAAA,IAC9B;AAOA,kBAAc,SAAS,SAAS,OAAO,OAAO;AAC1C,UAAI,CAAC,OAAO,KAAK;AACb,gBAAQ,UAAU,KAAK;AAC3B,UAAI,KAAK,aAAa,MAAM,YAAa,KAAK,SAAS,OAAQ,KAAM,MAAM,SAAS,OAAQ;AACxF,eAAO;AACX,aAAO,KAAK,SAAS,MAAM,QAAQ,KAAK,QAAQ,MAAM;AAAA,IAC1D;AAQA,kBAAc,KAAK,cAAc;AAOjC,kBAAc,YAAY,SAAS,UAAU,OAAO;AAChD,aAAO,CAAC,KAAK;AAAA;AAAA,QAAmB;AAAA,MAAK;AAAA,IACzC;AAQA,kBAAc,MAAM,cAAc;AAQlC,kBAAc,KAAK,cAAc;AAOjC,kBAAc,WAAW,SAAS,SAAS,OAAO;AAC9C,aAAO,KAAK;AAAA;AAAA,QAAqB;AAAA,MAAK,IAAI;AAAA,IAC9C;AAQA,kBAAc,KAAK,cAAc;AAOjC,kBAAc,kBAAkB,SAAS,gBAAgB,OAAO;AAC5D,aAAO,KAAK;AAAA;AAAA,QAAqB;AAAA,MAAK,KAAK;AAAA,IAC/C;AAQA,kBAAc,MAAM,cAAc;AAQlC,kBAAc,KAAK,cAAc;AAOjC,kBAAc,cAAc,SAAS,YAAY,OAAO;AACpD,aAAO,KAAK;AAAA;AAAA,QAAqB;AAAA,MAAK,IAAI;AAAA,IAC9C;AAQA,kBAAc,KAAK,cAAc;AAOjC,kBAAc,qBAAqB,SAAS,mBAAmB,OAAO;AAClE,aAAO,KAAK;AAAA;AAAA,QAAqB;AAAA,MAAK,KAAK;AAAA,IAC/C;AAQA,kBAAc,MAAM,cAAc;AAQlC,kBAAc,KAAK,cAAc;AAQjC,kBAAc,UAAU,SAAS,QAAQ,OAAO;AAC5C,UAAI,CAAC,OAAO,KAAK;AACb,gBAAQ,UAAU,KAAK;AAC3B,UAAI,KAAK,GAAG,KAAK;AACb,eAAO;AACX,UAAI,UAAU,KAAK,WAAY,GAC3B,WAAW,MAAM;AACrB,UAAI,WAAW,CAAC;AACZ,eAAO;AACX,UAAI,CAAC,WAAW;AACZ,eAAO;AAEX,UAAI,CAAC,KAAK;AACN,eAAO,KAAK,IAAI,KAAK,EAAE,WAAY,IAAG,KAAK;AAE/C,aAAQ,MAAM,SAAS,IAAM,KAAK,SAAS,KAAO,MAAM,SAAS,KAAK,QAAS,MAAM,QAAQ,IAAM,KAAK,QAAQ,IAAM,KAAK;AAAA,IAC/H;AASA,kBAAc,OAAO,cAAc;AAMnC,kBAAc,SAAS,SAAS,SAAS;AACrC,UAAI,CAAC,KAAK,YAAY,KAAK,GAAG,SAAS;AACnC,eAAO;AACX,aAAO,KAAK,IAAG,EAAG,IAAI,GAAG;AAAA,IAC7B;AAOA,kBAAc,MAAM,cAAc;AAOlC,kBAAc,MAAM,SAAS,IAAI,QAAQ;AACrC,UAAI,CAAC,OAAO,MAAM;AACd,iBAAS,UAAU,MAAM;AAI7B,UAAI,MAAM,KAAK,SAAS;AACxB,UAAI,MAAM,KAAK,OAAO;AACtB,UAAI,MAAM,KAAK,QAAQ;AACvB,UAAI,MAAM,KAAK,MAAM;AAErB,UAAI,MAAM,OAAO,SAAS;AAC1B,UAAI,MAAM,OAAO,OAAO;AACxB,UAAI,MAAM,OAAO,QAAQ;AACzB,UAAI,MAAM,OAAO,MAAM;AAEvB,UAAI,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM;AACrC,aAAO,MAAM;AACb,aAAO,QAAQ;AACf,aAAO;AACP,aAAO,MAAM;AACb,aAAO,QAAQ;AACf,aAAO;AACP,aAAO,MAAM;AACb,aAAO,QAAQ;AACf,aAAO;AACP,aAAO,MAAM;AACb,aAAO;AACP,aAAO,SAAU,OAAO,KAAM,KAAM,OAAO,KAAM,KAAK,KAAK,QAAQ;AAAA,IACvE;AAOA,kBAAc,WAAW,SAAS,SAAS,YAAY;AACnD,UAAI,CAAC,OAAO,UAAU;AAClB,qBAAa,UAAU,UAAU;AACrC,aAAO,KAAK,IAAI,WAAW,IAAK,CAAA;AAAA,IACpC;AAQA,kBAAc,MAAM,cAAc;AAOlC,kBAAc,WAAW,SAAS,SAAS,YAAY;AACnD,UAAI,KAAK,OAAQ;AACb,eAAO;AACX,UAAI,CAAC,OAAO,UAAU;AAClB,qBAAa,UAAU,UAAU;AAGrC,UAAI,MAAM;AACN,YAAI,MAAM,KAAK;AAAA,UAAI,KAAK;AAAA,UACL,KAAK;AAAA,UACL,WAAW;AAAA,UACX,WAAW;AAAA,QAAI;AAClC,eAAO,SAAS,KAAK,KAAK,SAAQ,GAAI,KAAK,QAAQ;AAAA,MACtD;AAED,UAAI,WAAW,OAAQ;AACnB,eAAO;AACX,UAAI,KAAK,GAAG,SAAS;AACjB,eAAO,WAAW,UAAU,YAAY;AAC5C,UAAI,WAAW,GAAG,SAAS;AACvB,eAAO,KAAK,UAAU,YAAY;AAEtC,UAAI,KAAK,cAAc;AACnB,YAAI,WAAW,WAAY;AACvB,iBAAO,KAAK,IAAK,EAAC,IAAI,WAAW,IAAG,CAAE;AAAA;AAEtC,iBAAO,KAAK,IAAK,EAAC,IAAI,UAAU,EAAE;MAC9C,WAAe,WAAW,WAAY;AAC9B,eAAO,KAAK,IAAI,WAAW,IAAK,CAAA,EAAE;AAGtC,UAAI,KAAK,GAAG,UAAU,KAAK,WAAW,GAAG,UAAU;AAC/C,eAAO,WAAW,KAAK,SAAU,IAAG,WAAW,SAAU,GAAE,KAAK,QAAQ;AAK5E,UAAI,MAAM,KAAK,SAAS;AACxB,UAAI,MAAM,KAAK,OAAO;AACtB,UAAI,MAAM,KAAK,QAAQ;AACvB,UAAI,MAAM,KAAK,MAAM;AAErB,UAAI,MAAM,WAAW,SAAS;AAC9B,UAAI,MAAM,WAAW,OAAO;AAC5B,UAAI,MAAM,WAAW,QAAQ;AAC7B,UAAI,MAAM,WAAW,MAAM;AAE3B,UAAI,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM;AACrC,aAAO,MAAM;AACb,aAAO,QAAQ;AACf,aAAO;AACP,aAAO,MAAM;AACb,aAAO,QAAQ;AACf,aAAO;AACP,aAAO,MAAM;AACb,aAAO,QAAQ;AACf,aAAO;AACP,aAAO,MAAM;AACb,aAAO,QAAQ;AACf,aAAO;AACP,aAAO,MAAM;AACb,aAAO,QAAQ;AACf,aAAO;AACP,aAAO,MAAM;AACb,aAAO,QAAQ;AACf,aAAO;AACP,aAAO,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM;AACjD,aAAO;AACP,aAAO,SAAU,OAAO,KAAM,KAAM,OAAO,KAAM,KAAK,KAAK,QAAQ;AAAA,IACvE;AAQA,kBAAc,MAAM,cAAc;AAQlC,kBAAc,SAAS,SAAS,OAAO,SAAS;AAC5C,UAAI,CAAC,OAAO,OAAO;AACf,kBAAU,UAAU,OAAO;AAC/B,UAAI,QAAQ,OAAQ;AAChB,cAAM,MAAM,kBAAkB;AAGlC,UAAI,MAAM;AAIN,YAAI,CAAC,KAAK,YACN,KAAK,SAAS,eACd,QAAQ,QAAQ,MAAM,QAAQ,SAAS,IAAI;AAE3C,iBAAO;AAAA,QACV;AACD,YAAI,OAAO,KAAK,WAAW,KAAK,QAAQ,KAAK;AAAA,UACzC,KAAK;AAAA,UACL,KAAK;AAAA,UACL,QAAQ;AAAA,UACR,QAAQ;AAAA,QACpB;AACQ,eAAO,SAAS,KAAK,KAAK,SAAQ,GAAI,KAAK,QAAQ;AAAA,MACtD;AAED,UAAI,KAAK,OAAQ;AACb,eAAO,KAAK,WAAW,QAAQ;AACnC,UAAI,QAAQ,KAAK;AACjB,UAAI,CAAC,KAAK,UAAU;AAGhB,YAAI,KAAK,GAAG,SAAS,GAAG;AACpB,cAAI,QAAQ,GAAG,GAAG,KAAK,QAAQ,GAAG,OAAO;AACrC,mBAAO;AAAA,mBACF,QAAQ,GAAG,SAAS;AACzB,mBAAO;AAAA,eACN;AAED,gBAAI,WAAW,KAAK,IAAI,CAAC;AACzB,qBAAS,SAAS,IAAI,OAAO,EAAE,IAAI,CAAC;AACpC,gBAAI,OAAO,GAAG,IAAI,GAAG;AACjB,qBAAO,QAAQ,eAAe,MAAM;AAAA,YACxD,OAAuB;AACH,oBAAM,KAAK,IAAI,QAAQ,IAAI,MAAM,CAAC;AAClC,oBAAM,OAAO,IAAI,IAAI,IAAI,OAAO,CAAC;AACjC,qBAAO;AAAA,YACV;AAAA,UACJ;AAAA,QACb,WAAmB,QAAQ,GAAG,SAAS;AAC3B,iBAAO,KAAK,WAAW,QAAQ;AACnC,YAAI,KAAK,cAAc;AACnB,cAAI,QAAQ,WAAY;AACpB,mBAAO,KAAK,IAAK,EAAC,IAAI,QAAQ,IAAG,CAAE;AACvC,iBAAO,KAAK,IAAK,EAAC,IAAI,OAAO,EAAE;QAC3C,WAAmB,QAAQ,WAAY;AAC3B,iBAAO,KAAK,IAAI,QAAQ,IAAK,CAAA,EAAE;AACnC,cAAM;AAAA,MACd,OAAW;AAGH,YAAI,CAAC,QAAQ;AACT,oBAAU,QAAQ;AACtB,YAAI,QAAQ,GAAG,IAAI;AACf,iBAAO;AACX,YAAI,QAAQ,GAAG,KAAK,KAAK,CAAC,CAAC;AACvB,iBAAO;AACX,cAAM;AAAA,MACT;AAOD,YAAM;AACN,aAAO,IAAI,IAAI,OAAO,GAAG;AAGrB,iBAAS,KAAK,IAAI,GAAG,KAAK,MAAM,IAAI,SAAQ,IAAK,QAAQ,SAAQ,CAAE,CAAC;AAIpE,YAAI,OAAO,KAAK,KAAK,KAAK,IAAI,MAAM,IAAI,KAAK,GAAG,GAC5C,QAAS,QAAQ,KAAM,IAAI,QAAQ,GAAG,OAAO,EAAE,GAI/C,YAAY,WAAW,MAAM,GAC7B,YAAY,UAAU,IAAI,OAAO;AACrC,eAAO,UAAU,WAAY,KAAI,UAAU,GAAG,GAAG,GAAG;AAChD,oBAAU;AACV,sBAAY,WAAW,QAAQ,KAAK,QAAQ;AAC5C,sBAAY,UAAU,IAAI,OAAO;AAAA,QACpC;AAID,YAAI,UAAU,OAAQ;AAClB,sBAAY;AAEhB,cAAM,IAAI,IAAI,SAAS;AACvB,cAAM,IAAI,IAAI,SAAS;AAAA,MAC1B;AACD,aAAO;AAAA,IACX;AAQA,kBAAc,MAAM,cAAc;AAOlC,kBAAc,SAAS,SAAS,OAAO,SAAS;AAC5C,UAAI,CAAC,OAAO,OAAO;AACf,kBAAU,UAAU,OAAO;AAG/B,UAAI,MAAM;AACN,YAAI,OAAO,KAAK,WAAW,KAAK,QAAQ,KAAK;AAAA,UACzC,KAAK;AAAA,UACL,KAAK;AAAA,UACL,QAAQ;AAAA,UACR,QAAQ;AAAA,QACpB;AACQ,eAAO,SAAS,KAAK,KAAK,SAAQ,GAAI,KAAK,QAAQ;AAAA,MACtD;AAED,aAAO,KAAK,IAAI,KAAK,IAAI,OAAO,EAAE,IAAI,OAAO,CAAC;AAAA,IAClD;AAQA,kBAAc,MAAM,cAAc;AAQlC,kBAAc,MAAM,cAAc;AAMlC,kBAAc,MAAM,SAAS,MAAM;AAC/B,aAAO,SAAS,CAAC,KAAK,KAAK,CAAC,KAAK,MAAM,KAAK,QAAQ;AAAA,IACxD;AAOA,kBAAc,MAAM,SAAS,IAAI,OAAO;AACpC,UAAI,CAAC,OAAO,KAAK;AACb,gBAAQ,UAAU,KAAK;AAC3B,aAAO,SAAS,KAAK,MAAM,MAAM,KAAK,KAAK,OAAO,MAAM,MAAM,KAAK,QAAQ;AAAA,IAC/E;AAOA,kBAAc,KAAK,SAAS,GAAG,OAAO;AAClC,UAAI,CAAC,OAAO,KAAK;AACb,gBAAQ,UAAU,KAAK;AAC3B,aAAO,SAAS,KAAK,MAAM,MAAM,KAAK,KAAK,OAAO,MAAM,MAAM,KAAK,QAAQ;AAAA,IAC/E;AAOA,kBAAc,MAAM,SAAS,IAAI,OAAO;AACpC,UAAI,CAAC,OAAO,KAAK;AACb,gBAAQ,UAAU,KAAK;AAC3B,aAAO,SAAS,KAAK,MAAM,MAAM,KAAK,KAAK,OAAO,MAAM,MAAM,KAAK,QAAQ;AAAA,IAC/E;AAOA,kBAAc,YAAY,SAAS,UAAU,SAAS;AAClD,UAAI,OAAO,OAAO;AACd,kBAAU,QAAQ;AACtB,WAAK,WAAW,QAAQ;AACpB,eAAO;AAAA,eACF,UAAU;AACf,eAAO,SAAS,KAAK,OAAO,SAAU,KAAK,QAAQ,UAAY,KAAK,QAAS,KAAK,SAAW,KAAK,QAAQ;AAAA;AAE1G,eAAO,SAAS,GAAG,KAAK,OAAQ,UAAU,IAAK,KAAK,QAAQ;AAAA,IACpE;AAQA,kBAAc,MAAM,cAAc;AAOlC,kBAAc,aAAa,SAAS,WAAW,SAAS;AACpD,UAAI,OAAO,OAAO;AACd,kBAAU,QAAQ;AACtB,WAAK,WAAW,QAAQ;AACpB,eAAO;AAAA,eACF,UAAU;AACf,eAAO,SAAU,KAAK,QAAQ,UAAY,KAAK,QAAS,KAAK,SAAW,KAAK,QAAQ,SAAS,KAAK,QAAQ;AAAA;AAE3G,eAAO,SAAS,KAAK,QAAS,UAAU,IAAK,KAAK,QAAQ,IAAI,IAAI,IAAI,KAAK,QAAQ;AAAA,IAC3F;AAQA,kBAAc,MAAM,cAAc;AAOlC,kBAAc,qBAAqB,SAAS,mBAAmB,SAAS;AACpE,UAAI,OAAO,OAAO;AACd,kBAAU,QAAQ;AACtB,iBAAW;AACX,UAAI,YAAY;AACZ,eAAO;AAAA,WACN;AACD,YAAI,OAAO,KAAK;AAChB,YAAI,UAAU,IAAI;AACd,cAAI,MAAM,KAAK;AACf,iBAAO,SAAU,QAAQ,UAAY,QAAS,KAAK,SAAW,SAAS,SAAS,KAAK,QAAQ;AAAA,QACzG,WAAmB,YAAY;AACnB,iBAAO,SAAS,MAAM,GAAG,KAAK,QAAQ;AAAA;AAEtC,iBAAO,SAAS,SAAU,UAAU,IAAK,GAAG,KAAK,QAAQ;AAAA,MAChE;AAAA,IACL;AAQA,kBAAc,OAAO,cAAc;AAQnC,kBAAc,QAAQ,cAAc;AAMpC,kBAAc,WAAW,SAAS,WAAW;AACzC,UAAI,CAAC,KAAK;AACN,eAAO;AACX,aAAO,SAAS,KAAK,KAAK,KAAK,MAAM,KAAK;AAAA,IAC9C;AAMA,kBAAc,aAAa,SAAS,aAAa;AAC7C,UAAI,KAAK;AACL,eAAO;AACX,aAAO,SAAS,KAAK,KAAK,KAAK,MAAM,IAAI;AAAA,IAC7C;AAOA,kBAAc,UAAU,SAAS,QAAQ,IAAI;AACzC,aAAO,KAAK,KAAK,UAAW,IAAG,KAAK,UAAS;AAAA,IACjD;AAMA,kBAAc,YAAY,SAAS,YAAY;AAC3C,UAAI,KAAK,KAAK,MACV,KAAK,KAAK;AACd,aAAO;AAAA,QACH,KAAY;AAAA,QACZ,OAAQ,IAAI;AAAA,QACZ,OAAO,KAAK;AAAA,QACZ,OAAO;AAAA,QACP,KAAY;AAAA,QACZ,OAAQ,IAAI;AAAA,QACZ,OAAO,KAAK;AAAA,QACZ,OAAO;AAAA,MACf;AAAA,IACA;AAMA,kBAAc,YAAY,SAAS,YAAY;AAC3C,UAAI,KAAK,KAAK,MACV,KAAK,KAAK;AACd,aAAO;AAAA,QACH,OAAO;AAAA,QACP,OAAO,KAAK;AAAA,QACZ,OAAQ,IAAI;AAAA,QACZ,KAAY;AAAA,QACZ,OAAO;AAAA,QACP,OAAO,KAAK;AAAA,QACZ,OAAQ,IAAI;AAAA,QACZ,KAAY;AAAA,MACpB;AAAA,IACA;AASA,IAAAA,MAAK,YAAY,SAASC,WAAU,OAAO,UAAU,IAAI;AACrD,aAAO,KAAKD,MAAK,YAAY,OAAO,QAAQ,IAAIA,MAAK,YAAY,OAAO,QAAQ;AAAA,IACpF;AAQA,IAAAA,MAAK,cAAc,SAAS,YAAY,OAAO,UAAU;AACrD,aAAO,IAAIA;AAAA,QACP,MAAM,CAAC,IACP,MAAM,CAAC,KAAM,IACb,MAAM,CAAC,KAAK,KACZ,MAAM,CAAC,KAAK;AAAA,QACZ,MAAM,CAAC,IACP,MAAM,CAAC,KAAM,IACb,MAAM,CAAC,KAAK,KACZ,MAAM,CAAC,KAAK;AAAA,QACZ;AAAA,MACR;AAAA,IACA;AAQA,IAAAA,MAAK,cAAc,SAAS,YAAY,OAAO,UAAU;AACrD,aAAO,IAAIA;AAAA,QACP,MAAM,CAAC,KAAK,KACZ,MAAM,CAAC,KAAK,KACZ,MAAM,CAAC,KAAM,IACb,MAAM,CAAC;AAAA,QACP,MAAM,CAAC,KAAK,KACZ,MAAM,CAAC,KAAK,KACZ,MAAM,CAAC,KAAM,IACb,MAAM,CAAC;AAAA,QACP;AAAA,MACR;AAAA,IACC;;;;;EC1yCc,MAAM,cAAc;AAAA,IAC/B,YAAY,eAAe,cAAc;AACrC,WAAK,gBAAgB;AACrB,WAAK,eAAe;AAAA,IAC5B;AAAA,IACI,WAAW;AACP,aAAO,GAAG,KAAK,aAAa,IAAI,KAAK,YAAY;AAAA,IACzD;AAAA,IACI,UAAU,GAAG;AACT,aAAQ,KAAK,gBAAgB,EAAE,iBAAiB,KAAK,eAAe,EAAE;AAAA,IAC9E;AAAA,IACI,OAAO,OAAO,MAAM;AAChB,UAAI;AACJ,UAAI,IAAI;AACR,aAAO,CAAC,KAAK,KAAK,GAAG;AACjB,cAAM,KAAK,CAAC;AAAA,MACxB;AACQ,aAAO,IAAI,KAAK,QAAQ,KAAK,GAAG;AAC5B,YAAI,IAAI,UAAU,KAAK,CAAC,CAAC,IAAI,GAAG;AAC5B,gBAAM,KAAK,CAAC;AAAA,QAC5B;AAAA,MACA;AACQ,aAAO;AAAA,IACf;AAAA,EACA;AACO,WAAS,UAAU,OAAO,SAAS,GAAG,YAAY,OAAO;AAC5D,QAAI,WAAW;AACX,YAAM,IAAI,MAAM,iDAAiD;AAAA,IACzE;AACI,WAAO,IAAI,cAAc,MAAM,SAAS,CAAC,IAAI,gBACzC,MAAM,SAAS,CAAC,IAAI,aACpB,MAAM,SAAS,CAAC,IAAI,WACpB,MAAM,SAAS,CAAC,IAAI,QACpB,MAAM,SAAS,CAAC,IAAI,MACpB,MAAM,SAAS,CAAC,GAAI,MAAM,SAAS,CAAC,KAAK,IAAK,MAAM,MAAM,CAAC;AAAA,EACnE;AAAA,EClCe,MAAM,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOvB,YAAY,MAAM,MAAM,KAAK,cAAc,QAAW;AAClD,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,MAAM;AACX,WAAK,eAAe;AAAA,IAC5B;AAAA,IACI,iBAAiB;AACb,aAAO,GAAG,KAAK,IAAI,KAAK,KAAK,IAAI,SAAS,KAAK,GAAG,iBAAiB,KAAK,YAAW,CAAE;AAAA,IAC7F;AAAA,IACI,WAAW;AACP,aAAO,KAAK,eAAgB;AAAA,IACpC;AAAA,IACI,UAAU,GAAG;AACT,aAAQ,KAAK,KAAK,UAAU,EAAE,IAAI,KAC9B,KAAK,KAAK,UAAU,EAAE,IAAI,KAC1B,KAAK,MAAM,EAAE;AAAA,IACzB;AAAA,IACI,cAAc;AACV,UAAI,KAAK,iBAAiB,QAAW;AACjC,eAAO,KAAK;AAAA,MACxB;AACQ,aAAO,KAAK,KAAK,iBAAiB,KAAK,MAAM,KAAK,KAAK;AAAA,IAC/D;AAAA,EACA;AAAA,EC/Be,MAAM,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA,IAK3B,YAAY,EAAE,YAAY,eAAe,CAAC,MAAM,EAAC,GAAK;AAClD,WAAK,aAAa;AAClB,WAAK,eAAe;AAAA,IAC5B;AAAA,IACI,eAAe,MAAM,eAAe;AAChC,YAAM,aAAa,KAAK;AACxB,UAAI,YAAY;AACZ,aAAK,gBACD,WAAW,UAAU,aAAa,IAAI,IAAI,gBAAgB;AAAA,MAC1E,OACa;AACD,aAAK,gBAAgB;AAAA,MACjC;AAAA,IACA;AAAA,IACI,MAAM,MAAM,OAAO,IAAI;AACnB,UAAI,CAAC,KAAK,QAAQ;AACd,aAAK,SAAS,KAAK,OAAO,IAAI,EAAE,MAAM,OAAK;AACvC,eAAK,SAAS;AACd,gBAAM;AAAA,QACtB,CAAa;AAAA,MACb;AACQ,aAAO,KAAK;AAAA,IACpB;AAAA,IACI,MAAM,UAAU,OAAO,OAAO,IAAI;AAC9B,aAAO,CAAC,GAAG,MAAM,KAAK,MAAM,IAAI,GAAG,QAAQ,KAAK,KAAK,CAAA,GAAI;AAAA,IACjE;AAAA,EACA;AC/BO,WAAS,QAAQ,IAAI;AACxB,WAAO,IAAI,QAAQ,aAAW,WAAW,SAAS,EAAE,CAAC;AAAA,EACzD;AACO,WAAS,aAAaE,OAAM;AAC/B,QAAIA,MAAK,YAAY,OAAO,gBAAgB,KACxCA,MAAK,SAAS,OAAO,gBAAgB,GAAG;AACxC,YAAM,IAAI,MAAM,kBAAkB;AAAA,IAC1C;AACI,WAAOA,MAAK,SAAU;AAAA,EAC1B;AAYO,WAAS,iBAAiB,QAAQ;AACrC,QAAI,CAAC,QAAQ;AACT;AAAA,IACR;AACI,QAAI,OAAO,SAAS;AAEhB,UAAI,OAAO,iBAAiB,aAAa;AACrC,cAAM,IAAI,aAAa,WAAW,YAAY;AAAA,MAC1D,OACa;AACD,cAAM,IAAI,IAAI,MAAM,SAAS;AAE7B,UAAE,OAAO;AACT,cAAM;AAAA,MAClB;AAAA,IACA;AAAA,EACA;AAOO,iBAAe,gBAAgB,QAAQ;AAC1C,UAAM,QAAQ,QAAS;AACvB,qBAAiB,MAAM;AAAA,EAC3B;AACO,WAAS,eAAe,QAAQ,QAAQ;AAC3C,WAAQ,OAAO,KAAK,gBAAgB,OAAO,KAAK,gBAAgB,QAC5D,OAAO,KAAK,gBAAgB,OAAO,KAAK,gBAAgB;AAAA,EAChE;AACO,WAAS,SAAS,MAAM,IAAI;AAC/B,WAAO,aAAa,MAAM,EAAE,QAAQ,IAAK,IAAG;AAAA,EAChD;AACO,WAAS,eAAe,QAAQ,QAAQ;AAC3C,UAAM,eAAe,CAAE;AACvB,QAAI,YAAY;AAChB,QAAI,OAAO,WAAW,GAAG;AACrB,aAAO;AAAA,IACf;AACI,WAAO,KAAK,CAAC,IAAI,OAAO;AACpB,YAAM,MAAM,GAAG,KAAK,gBAAgB,GAAG,KAAK;AAC5C,UAAI,QAAQ,GAAG;AACX,eAAO;AAAA,MACnB,OACa;AACD,eAAO,GAAG,KAAK,eAAe,GAAG,KAAK;AAAA,MAClD;AAAA,IACA,CAAK;AACD,WAAO,QAAQ,WAAS;AACpB,UAAI,CAAC,UAAU,MAAM,KAAK,UAAU,MAAM,IAAI,GAAG;AAC7C,YAAI,cAAc,MAAM;AACpB,uBAAa,KAAK,KAAK;AACvB,sBAAY;AAAA,QAC5B,OACiB;AACD,cAAI,eAAe,WAAW,KAAK,GAAG;AAClC,gBAAI,MAAM,KAAK,UAAU,UAAU,IAAI,IAAI,GAAG;AAC1C,wBAAU,OAAO,MAAM;AAAA,YAC/C;AAAA,UACA,OACqB;AACD,yBAAa,KAAK,KAAK;AACvB,wBAAY;AAAA,UAChC;AAAA,QACA;AAAA,MACA;AAAA,IACA,CAAK;AACD,WAAO;AAAA,EACX;ACrFA,QAAM,YAAY;AAClB,WAAS,UAAU,GAAG,UAAU;AAC5B,WAAO,IAAK,IAAI;AAAA,EACpB;AACA,WAAS,QAAQ,GAAG,UAAU;AAC1B,WAAO,IAAK,IAAI,WAAY;AAAA,EAChC;AAAA,EACe,MAAM,YAAY,UAAU;AAAA,IACvC,eAAe,OAAO,QAAQ;AAC1B,YAAM,YAAY,aAAa,KAAK,YAAY,MAAM,UAAU,MAAM,KAAK,OAAO,SAAS,IAAI,SAAS,EAAE,GAAG,IAAI,CAAC;AAClH,aAAO,EAAE,UAAW;AAAA,IAC5B;AAAA,IACI,MAAM,UAAU,OAAO,OAAO,IAAI;AAC9B,YAAM,OAAO,MAAM,KAAK,MAAM,IAAI;AAClC,YAAM,QAAQ,KAAK,QAAQ,KAAK;AAChC,UAAI,CAAC,OAAO;AACR,eAAO;AAAA,MACnB;AACQ,YAAM,MAAM,MAAM,SAAS,CAAE;AAC7B,aAAO,IAAI,cAAc,SAAY,KAAK,IAAI;AAAA,IACtD;AAAA,IACI,SAAS,OAAO,IAAI;AAChB,UAAI,CAAC,KAAK,MAAM;AACZ,aAAK,OAAO,KAAK,WAAW,SAAS,IAAI,EAAE,MAAM,OAAK;AAClD,eAAK,OAAO;AACZ,gBAAM;AAAA,QACtB,CAAa;AAAA,MACb;AACQ,aAAO,KAAK;AAAA,IACpB;AAAA;AAAA,IAEI,MAAM,SAAS;AACX,YAAM,OAAO,EAAE,KAAK,MAAM,cAAc,KAAK,GAAI;AACjD,YAAM,QAAQ,MAAM,KAAK,SAAU;AAEnC,UAAI,MAAM,aAAa,CAAC,MAAM,WAAW;AACrC,cAAM,IAAI,MAAM,gBAAgB;AAAA,MAC5C;AACQ,WAAK,WAAW,MAAM,YAAY,CAAC;AACnC,YAAM,QAAQ;AACd,YAAM,aAAa,MAAO,QAAQ,KAAK,KAAM,KAAK;AAElD,WAAK,UAAU,IAAI,MAAM,KAAK,QAAQ;AACtC,UAAI,aAAa;AACjB,eAAS,IAAI,GAAG,IAAI,KAAK,UAAU,KAAK,GAAG;AAEvC,cAAM,WAAW,MAAM,YAAY,UAAU;AAC7C,YAAI;AACJ,sBAAc;AACd,cAAM,WAAW,CAAE;AACnB,iBAAS,IAAI,GAAG,IAAI,UAAU,KAAK,GAAG;AAClC,gBAAM,MAAM,MAAM,aAAa,UAAU;AACzC,wBAAc;AACd,cAAI,QAAQ,WAAW,GAAG;AACtB,0BAAc;AACd,oBAAQ,KAAK,eAAe,OAAO,UAAU;AAC7C,0BAAc;AAAA,UAClC,WACyB,MAAM,WAAW,GAAG;AACzB,kBAAM,IAAI,MAAM,kDAAkD;AAAA,UACtF,OACqB;AACD,kBAAM,aAAa,MAAM,YAAY,UAAU;AAC/C,0BAAc;AACd,kBAAM,SAAS,IAAI,MAAM,UAAU;AACnC,qBAAS,IAAI,GAAG,IAAI,YAAY,KAAK,GAAG;AACpC,oBAAM,IAAI,UAAU,OAAO,UAAU;AACrC,oBAAM,IAAI,UAAU,OAAO,aAAa,CAAC;AACzC,4BAAc;AACd,mBAAK,eAAe,MAAM,CAAC;AAC3B,qBAAO,CAAC,IAAI,IAAI,MAAM,GAAG,GAAG,GAAG;AAAA,YACvD;AACoB,qBAAS,GAAG,IAAI;AAAA,UACpC;AAAA,QACA;AACY,cAAM,cAAc,MAAM,YAAY,UAAU;AAChD,sBAAc;AAId,cAAM,cAAc,IAAI,MAAM,WAAW;AACzC,iBAAS,IAAI,GAAG,IAAI,aAAa,KAAK,GAAG;AACrC,sBAAY,CAAC,IAAI,UAAU,OAAO,UAAU;AAC5C,wBAAc;AACd,eAAK,eAAe,MAAM,YAAY,CAAC,CAAC;AAAA,QACxD;AACY,aAAK,QAAQ,CAAC,IAAI,EAAE,UAAU,aAAa,MAAO;AAAA,MAC9D;AACQ,aAAO;AAAA,IACf;AAAA,IACI,MAAM,SAAS,OAAO,OAAO,KAAK,OAAO,CAAA,GAAI;AACzC,YAAM,IAAI;AACV,YAAM,QAAQ,UAAU;AACxB,YAAM,YAAY,MAAM,KAAK,MAAM,IAAI;AACvC,YAAM,SAAS,UAAU,QAAQ,KAAK;AACtC,UAAI,CAAC,QAAQ;AACT,eAAO,CAAE;AAAA,MACrB;AACQ,YAAM,EAAE,cAAc,IAAI,MAAO,IAAG;AACpC,UAAI,CAAC,YAAY,QAAQ;AACrB,eAAO,CAAE;AAAA,MACrB;AACQ,YAAM,IAAI,QAAQ,SAAY,QAAQ,KAAK,CAAC,KAAK,YAAY,SAAS,KAAK;AAC3E,YAAM,IAAI,UAAU,SAAY,UAAU,OAAO,CAAC,IAAI;AACtD,UAAI;AACJ,UAAI,OAAO;AACP,iBAAS,IAAI,OAAO,IAAI,KAAK,CAAC;AAAA,MAC1C,OACa;AACD,iBAAS,IAAI,MAAM,YAAY,SAAS,CAAC;AAAA,MACrD;AACQ,YAAM,YAAY,YAAY,YAAY,SAAS,CAAC,EAAE;AACtD,UAAI,KAAK,YAAY,SAAS,KAAK,GAAG;AAClC,cAAM,IAAI,MAAM,wCAAwC;AAAA,MACpE;AACQ,UAAI,aAAa,YAAY,IAAI,CAAC,EAAE;AACpC,eAAS,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK,KAAK;AAC5C,eAAO,CAAC,IAAI;AAAA,UACR,OAAO,YAAY,IAAI,CAAC,EAAE,gBAAgB;AAAA,UAC1C,OAAO,IAAI;AAAA,UACX,KAAK,IAAI,IAAI;AAAA,QAChB;AACD,qBAAa,YAAY,IAAI,CAAC,EAAE;AAAA,MAC5C;AACQ,aAAO,OAAO,IAAI,OAAK;AACnB,eAAO,EAAE,GAAG,GAAG,OAAQ,EAAE,QAAQ,MAAM,YAAa,UAAW;AAAA,MAC3E,CAAS;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA,IAKI,SAAS,KAAK,KAAK;AACf,aAAO;AACP,aAAO;AAAA,QACH,CAAC,GAAG,CAAC;AAAA,QACL,CAAC,KAAK,OAAO,KAAK,KAAK,OAAO,GAAG;AAAA,QACjC,CAAC,KAAK,OAAO,KAAK,KAAK,OAAO,GAAG;AAAA,QACjC,CAAC,MAAM,OAAO,KAAK,MAAM,OAAO,GAAG;AAAA,QACnC,CAAC,OAAO,OAAO,KAAK,OAAO,OAAO,GAAG;AAAA,QACrC,CAAC,QAAQ,OAAO,KAAK,QAAQ,OAAO,GAAG;AAAA,MAC1C;AAAA,IACT;AAAA,IACI,MAAM,eAAe,OAAO,KAAK,KAAK,OAAO,CAAA,GAAI;AAC7C,UAAI,MAAM,GAAG;AACT,cAAM;AAAA,MAClB;AACQ,YAAM,YAAY,MAAM,KAAK,MAAM,IAAI;AACvC,UAAI,CAAC,WAAW;AACZ,eAAO,CAAE;AAAA,MACrB;AACQ,YAAM,KAAK,UAAU,QAAQ,KAAK;AAClC,UAAI,CAAC,IAAI;AACL,eAAO,CAAE;AAAA,MACrB;AAEQ,YAAM,kBAAkB,KAAK,SAAS,KAAK,GAAG;AAC9C,YAAM,SAAS,CAAE;AAEjB,iBAAW,CAAC,OAAO,GAAG,KAAK,iBAAiB;AACxC,iBAAS,MAAM,OAAO,OAAO,KAAK,OAAO;AACrC,cAAI,GAAG,SAAS,GAAG,GAAG;AAClB,kBAAM,YAAY,GAAG,SAAS,GAAG;AACjC,qBAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,EAAE,GAAG;AACvC,qBAAO,KAAK,IAAI,MAAM,UAAU,CAAC,EAAE,MAAM,UAAU,CAAC,EAAE,MAAM,GAAG,CAAC;AAAA,YACxF;AAAA,UACA;AAAA,QACA;AAAA,MACA;AAGQ,YAAM,QAAQ,GAAG,YAAY;AAC7B,UAAI,SAAS;AACb,YAAM,SAAS,KAAK,IAAI,OAAO,IAAI,QAAQ,CAAC;AAC5C,YAAM,SAAS,KAAK,IAAI,OAAO,IAAI,QAAQ,CAAC;AAC5C,eAAS,IAAI,QAAQ,KAAK,QAAQ,EAAE,GAAG;AACnC,cAAM,KAAK,GAAG,YAAY,CAAC;AAC3B,YAAI,IAAI;AACJ,cAAI,CAAC,UAAU,GAAG,UAAU,MAAM,IAAI,GAAG;AACrC,qBAAS;AAAA,UAC7B;AAAA,QACA;AAAA,MACA;AACQ,aAAO,eAAe,QAAQ,MAAM;AAAA,IAC5C;AAAA,EACA;;;;;;;AC5LA,aAAA,aAAqB;AACrB,aAAA,cAAsB;AACtB,aAAA,gBAAwB;AAExB,QAAI,SAAS,CAAA;AACb,QAAI,YAAY,CAAA;AAChB,QAAI,MAAM,OAAO,eAAe,cAAc,aAAa;AAE3D,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,MAAM,KAAK,QAAQ,IAAI,KAAK,EAAE,GAAG;AAC/C,aAAO,CAAC,IAAI,KAAK,CAAC;AAClB,gBAAU,KAAK,WAAW,CAAC,CAAC,IAAI;AAAA,IAClC;AAIA,cAAU,IAAI,WAAW,CAAC,CAAC,IAAI;AAC/B,cAAU,IAAI,WAAW,CAAC,CAAC,IAAI;AAE/B,aAAS,QAAS,KAAK;AACrB,UAAIC,OAAM,IAAI;AAEd,UAAIA,OAAM,IAAI,GAAG;AACf,cAAM,IAAI,MAAM,gDAAgD;AAAA,MACpE;AAIE,UAAI,WAAW,IAAI,QAAQ,GAAG;AAC9B,UAAI,aAAa,GAAI,YAAWA;AAEhC,UAAI,kBAAkB,aAAaA,OAC/B,IACA,IAAK,WAAW;AAEpB,aAAO,CAAC,UAAU,eAAe;AAAA,IACnC;AAGA,aAAS,WAAY,KAAK;AACxB,UAAI,OAAO,QAAQ,GAAG;AACtB,UAAI,WAAW,KAAK,CAAC;AACrB,UAAI,kBAAkB,KAAK,CAAC;AAC5B,cAAS,WAAW,mBAAmB,IAAI,IAAK;AAAA,IAClD;AAEA,aAAS,YAAa,KAAK,UAAU,iBAAiB;AACpD,cAAS,WAAW,mBAAmB,IAAI,IAAK;AAAA,IAClD;AAEA,aAAS,YAAa,KAAK;AACzB,UAAI;AACJ,UAAI,OAAO,QAAQ,GAAG;AACtB,UAAI,WAAW,KAAK,CAAC;AACrB,UAAI,kBAAkB,KAAK,CAAC;AAE5B,UAAI,MAAM,IAAI,IAAI,YAAY,KAAK,UAAU,eAAe,CAAC;AAE7D,UAAI,UAAU;AAGd,UAAIA,OAAM,kBAAkB,IACxB,WAAW,IACX;AAEJ,UAAIC;AACJ,WAAKA,KAAI,GAAGA,KAAID,MAAKC,MAAK,GAAG;AAC3B,cACG,UAAU,IAAI,WAAWA,EAAC,CAAC,KAAK,KAChC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK,KACpC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK,IACrC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC;AACjC,YAAI,SAAS,IAAK,OAAO,KAAM;AAC/B,YAAI,SAAS,IAAK,OAAO,IAAK;AAC9B,YAAI,SAAS,IAAI,MAAM;AAAA,MAC3B;AAEE,UAAI,oBAAoB,GAAG;AACzB,cACG,UAAU,IAAI,WAAWA,EAAC,CAAC,KAAK,IAChC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK;AACvC,YAAI,SAAS,IAAI,MAAM;AAAA,MAC3B;AAEE,UAAI,oBAAoB,GAAG;AACzB,cACG,UAAU,IAAI,WAAWA,EAAC,CAAC,KAAK,KAChC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK,IACpC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK;AACvC,YAAI,SAAS,IAAK,OAAO,IAAK;AAC9B,YAAI,SAAS,IAAI,MAAM;AAAA,MAC3B;AAEE,aAAO;AAAA,IACT;AAEA,aAAS,gBAAiB,KAAK;AAC7B,aAAO,OAAO,OAAO,KAAK,EAAI,IAC5B,OAAO,OAAO,KAAK,EAAI,IACvB,OAAO,OAAO,IAAI,EAAI,IACtB,OAAO,MAAM,EAAI;AAAA,IACrB;AAEA,aAAS,YAAa,OAAO,OAAO,KAAK;AACvC,UAAI;AACJ,UAAI,SAAS,CAAA;AACb,eAASA,KAAI,OAAOA,KAAI,KAAKA,MAAK,GAAG;AACnC,eACI,MAAMA,EAAC,KAAK,KAAM,aAClB,MAAMA,KAAI,CAAC,KAAK,IAAK,UACtB,MAAMA,KAAI,CAAC,IAAI;AAClB,eAAO,KAAK,gBAAgB,GAAG,CAAC;AAAA,MACpC;AACE,aAAO,OAAO,KAAK,EAAE;AAAA,IACvB;AAEA,aAAS,cAAe,OAAO;AAC7B,UAAI;AACJ,UAAID,OAAM,MAAM;AAChB,UAAI,aAAaA,OAAM;AACvB,UAAI,QAAQ,CAAA;AACZ,UAAI,iBAAiB;AAGrB,eAASC,KAAI,GAAGC,QAAOF,OAAM,YAAYC,KAAIC,OAAMD,MAAK,gBAAgB;AACtE,cAAM,KAAK,YAAY,OAAOA,IAAIA,KAAI,iBAAkBC,QAAOA,QAAQD,KAAI,cAAe,CAAC;AAAA,MAC/F;AAGE,UAAI,eAAe,GAAG;AACpB,cAAM,MAAMD,OAAM,CAAC;AACnB,cAAM;AAAA,UACJ,OAAO,OAAO,CAAC,IACf,OAAQ,OAAO,IAAK,EAAI,IACxB;AAAA,QACN;AAAA,MACA,WAAa,eAAe,GAAG;AAC3B,eAAO,MAAMA,OAAM,CAAC,KAAK,KAAK,MAAMA,OAAM,CAAC;AAC3C,cAAM;AAAA,UACJ,OAAO,OAAO,EAAE,IAChB,OAAQ,OAAO,IAAK,EAAI,IACxB,OAAQ,OAAO,IAAK,EAAI,IACxB;AAAA,QACN;AAAA,MACA;AAEE,aAAO,MAAM,KAAK,EAAE;AAAA,IACtB;;;;;;;;;ACpJY,YAAA,OAAG,SAAUG,SAAQ,QAAQ,MAAM,MAAM,QAAQ;AAC3D,UAAI,GAAG;AACP,UAAI,OAAQ,SAAS,IAAK,OAAO;AACjC,UAAI,QAAQ,KAAK,QAAQ;AACzB,UAAI,QAAQ,QAAQ;AACpB,UAAI,QAAQ;AACZ,UAAI,IAAI,OAAQ,SAAS,IAAK;AAC9B,UAAI,IAAI,OAAO,KAAK;AACpB,UAAI,IAAIA,QAAO,SAAS,CAAC;AAEzB,WAAK;AAEL,UAAI,KAAM,KAAM,CAAC,SAAU;AAC3B,YAAO,CAAC;AACR,eAAS;AACT,aAAO,QAAQ,GAAG,IAAK,IAAI,MAAOA,QAAO,SAAS,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG;AAAA,MAAA;AAE1E,UAAI,KAAM,KAAM,CAAC,SAAU;AAC3B,YAAO,CAAC;AACR,eAAS;AACT,aAAO,QAAQ,GAAG,IAAK,IAAI,MAAOA,QAAO,SAAS,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG;AAAA,MAAA;AAE1E,UAAI,MAAM,GAAG;AACX,YAAI,IAAI;AAAA,MACZ,WAAa,MAAM,MAAM;AACrB,eAAO,IAAI,OAAQ,IAAI,KAAK,KAAK;AAAA,MACrC,OAAS;AACL,YAAI,IAAI,KAAK,IAAI,GAAG,IAAI;AACxB,YAAI,IAAI;AAAA,MACZ;AACE,cAAQ,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI,GAAG,IAAI,IAAI;AAAA,IAChD;AAEA,YAAA,QAAgB,SAAUA,SAAQ,OAAO,QAAQ,MAAM,MAAM,QAAQ;AACnE,UAAI,GAAG,GAAG;AACV,UAAI,OAAQ,SAAS,IAAK,OAAO;AACjC,UAAI,QAAQ,KAAK,QAAQ;AACzB,UAAI,QAAQ,QAAQ;AACpB,UAAI,KAAM,SAAS,KAAK,KAAK,IAAI,GAAG,GAAG,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI;AAC9D,UAAI,IAAI,OAAO,IAAK,SAAS;AAC7B,UAAI,IAAI,OAAO,IAAI;AACnB,UAAI,IAAI,QAAQ,KAAM,UAAU,KAAK,IAAI,QAAQ,IAAK,IAAI;AAE1D,cAAQ,KAAK,IAAI,KAAK;AAEtB,UAAI,MAAM,KAAK,KAAK,UAAU,UAAU;AACtC,YAAI,MAAM,KAAK,IAAI,IAAI;AACvB,YAAI;AAAA,MACR,OAAS;AACL,YAAI,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG;AACzC,YAAI,SAAS,IAAI,KAAK,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG;AACrC;AACA,eAAK;AAAA,QACX;AACI,YAAI,IAAI,SAAS,GAAG;AAClB,mBAAS,KAAK;AAAA,QACpB,OAAW;AACL,mBAAS,KAAK,KAAK,IAAI,GAAG,IAAI,KAAK;AAAA,QACzC;AACI,YAAI,QAAQ,KAAK,GAAG;AAClB;AACA,eAAK;AAAA,QACX;AAEI,YAAI,IAAI,SAAS,MAAM;AACrB,cAAI;AACJ,cAAI;AAAA,QACV,WAAe,IAAI,SAAS,GAAG;AACzB,eAAM,QAAQ,IAAK,KAAK,KAAK,IAAI,GAAG,IAAI;AACxC,cAAI,IAAI;AAAA,QACd,OAAW;AACL,cAAI,QAAQ,KAAK,IAAI,GAAG,QAAQ,CAAC,IAAI,KAAK,IAAI,GAAG,IAAI;AACrD,cAAI;AAAA,QACV;AAAA,MACA;AAEE,aAAO,QAAQ,GAAGA,QAAO,SAAS,CAAC,IAAI,IAAI,KAAM,KAAK,GAAG,KAAK,KAAK,QAAQ,GAAG;AAAA,MAAA;AAE9E,UAAK,KAAK,OAAQ;AAClB,cAAQ;AACR,aAAO,OAAO,GAAGA,QAAO,SAAS,CAAC,IAAI,IAAI,KAAM,KAAK,GAAG,KAAK,KAAK,QAAQ,GAAG;AAAA,MAAA;AAE7E,MAAAA,QAAO,SAAS,IAAI,CAAC,KAAK,IAAI;AAAA,IAChC;;;;;;;;;;;;;;AC1EA,YAAM,SAASjB,gBAAA;AACf,YAAMkB,WAAUZ,eAAA;AAChB,YAAM,sBACH,OAAO,WAAW,cAAc,OAAO,OAAO,KAAK,MAAM,aACtD,OAAO,KAAK,EAAE,4BAA4B,IAC1C;AAEN,cAAiB,SAAAa;AACjB,cAAqB,aAAA;AACrB,cAA4B,oBAAA;AAE5B,YAAM,eAAe;AACrB,cAAqB,aAAA;AAgBrB,MAAAA,QAAO,sBAAsB,kBAAiB;AAE9C,UAAI,CAACA,QAAO,uBAAuB,OAAO,YAAY,eAClD,OAAO,QAAQ,UAAU,YAAY;AACvC,gBAAQ;AAAA,UACN;AAAA,QAEJ;AAAA,MACA;AAEA,eAAS,oBAAqB;AAE5B,YAAI;AACF,gBAAM,MAAM,IAAI,WAAW,CAAC;AAC5B,gBAAM,QAAQ,EAAE,KAAK,WAAY;AAAE,mBAAO;AAAA,UAAI,EAAA;AAC9C,iBAAO,eAAe,OAAO,WAAW,SAAS;AACjD,iBAAO,eAAe,KAAK,KAAK;AAChC,iBAAO,IAAI,UAAU;AAAA,QACtB,SAAQ,GAAG;AACV,iBAAO;AAAA,QACX;AAAA,MACA;AAEA,aAAO,eAAeA,QAAO,WAAW,UAAU;AAAA,QAChD,YAAY;AAAA,QACZ,KAAK,WAAY;AACf,cAAI,CAACA,QAAO,SAAS,IAAI,EAAG,QAAO;AACnC,iBAAO,KAAK;AAAA,QAChB;AAAA,MACC,CAAA;AAED,aAAO,eAAeA,QAAO,WAAW,UAAU;AAAA,QAChD,YAAY;AAAA,QACZ,KAAK,WAAY;AACf,cAAI,CAACA,QAAO,SAAS,IAAI,EAAG,QAAO;AACnC,iBAAO,KAAK;AAAA,QAChB;AAAA,MACC,CAAA;AAED,eAAS,aAAc,QAAQ;AAC7B,YAAI,SAAS,cAAc;AACzB,gBAAM,IAAI,WAAW,gBAAgB,SAAS,gCAAgC;AAAA,QAClF;AAEE,cAAM,MAAM,IAAI,WAAW,MAAM;AACjC,eAAO,eAAe,KAAKA,QAAO,SAAS;AAC3C,eAAO;AAAA,MACT;AAYA,eAASA,QAAQ,KAAK,kBAAkB,QAAQ;AAE9C,YAAI,OAAO,QAAQ,UAAU;AAC3B,cAAI,OAAO,qBAAqB,UAAU;AACxC,kBAAM,IAAI;AAAA,cACR;AAAA,YACR;AAAA,UACA;AACI,iBAAO,YAAY,GAAG;AAAA,QAC1B;AACE,eAAO,KAAK,KAAK,kBAAkB,MAAM;AAAA,MAC3C;AAEA,MAAAA,QAAO,WAAW;AAElB,eAAS,KAAM,OAAO,kBAAkB,QAAQ;AAC9C,YAAI,OAAO,UAAU,UAAU;AAC7B,iBAAO,WAAW,OAAO,gBAAgB;AAAA,QAC7C;AAEE,YAAI,YAAY,OAAO,KAAK,GAAG;AAC7B,iBAAO,cAAc,KAAK;AAAA,QAC9B;AAEE,YAAI,SAAS,MAAM;AACjB,gBAAM,IAAI;AAAA,YACR,oHAC0C,OAAO;AAAA,UACvD;AAAA,QACA;AAEE,YAAI,WAAW,OAAO,WAAW,KAC5B,SAAS,WAAW,MAAM,QAAQ,WAAW,GAAI;AACpD,iBAAO,gBAAgB,OAAO,kBAAkB,MAAM;AAAA,QAC1D;AAEE,YAAI,OAAO,sBAAsB,gBAC5B,WAAW,OAAO,iBAAiB,KACnC,SAAS,WAAW,MAAM,QAAQ,iBAAiB,IAAK;AAC3D,iBAAO,gBAAgB,OAAO,kBAAkB,MAAM;AAAA,QAC1D;AAEE,YAAI,OAAO,UAAU,UAAU;AAC7B,gBAAM,IAAI;AAAA,YACR;AAAA,UACN;AAAA,QACA;AAEE,cAAM,UAAU,MAAM,WAAW,MAAM,QAAO;AAC9C,YAAI,WAAW,QAAQ,YAAY,OAAO;AACxC,iBAAOA,QAAO,KAAK,SAAS,kBAAkB,MAAM;AAAA,QACxD;AAEE,cAAM,IAAI,WAAW,KAAK;AAC1B,YAAI,EAAG,QAAO;AAEd,YAAI,OAAO,WAAW,eAAe,OAAO,eAAe,QACvD,OAAO,MAAM,OAAO,WAAW,MAAM,YAAY;AACnD,iBAAOA,QAAO,KAAK,MAAM,OAAO,WAAW,EAAE,QAAQ,GAAG,kBAAkB,MAAM;AAAA,QACpF;AAEE,cAAM,IAAI;AAAA,UACR,oHAC0C,OAAO;AAAA,QACrD;AAAA,MACA;AAUA,MAAAA,QAAO,OAAO,SAAU,OAAO,kBAAkB,QAAQ;AACvD,eAAO,KAAK,OAAO,kBAAkB,MAAM;AAAA,MAC7C;AAIA,aAAO,eAAeA,QAAO,WAAW,WAAW,SAAS;AAC5D,aAAO,eAAeA,SAAQ,UAAU;AAExC,eAAS,WAAY,MAAM;AACzB,YAAI,OAAO,SAAS,UAAU;AAC5B,gBAAM,IAAI,UAAU,wCAAwC;AAAA,QAChE,WAAa,OAAO,GAAG;AACnB,gBAAM,IAAI,WAAW,gBAAgB,OAAO,gCAAgC;AAAA,QAChF;AAAA,MACA;AAEA,eAAS,MAAO,MAAM,MAAM,UAAU;AACpC,mBAAW,IAAI;AACf,YAAI,QAAQ,GAAG;AACb,iBAAO,aAAa,IAAI;AAAA,QAC5B;AACE,YAAI,SAAS,QAAW;AAItB,iBAAO,OAAO,aAAa,WACvB,aAAa,IAAI,EAAE,KAAK,MAAM,QAAQ,IACtC,aAAa,IAAI,EAAE,KAAK,IAAI;AAAA,QACpC;AACE,eAAO,aAAa,IAAI;AAAA,MAC1B;AAMA,MAAAA,QAAO,QAAQ,SAAU,MAAM,MAAM,UAAU;AAC7C,eAAO,MAAM,MAAM,MAAM,QAAQ;AAAA,MACnC;AAEA,eAAS,YAAa,MAAM;AAC1B,mBAAW,IAAI;AACf,eAAO,aAAa,OAAO,IAAI,IAAI,QAAQ,IAAI,IAAI,CAAC;AAAA,MACtD;AAKA,MAAAA,QAAO,cAAc,SAAU,MAAM;AACnC,eAAO,YAAY,IAAI;AAAA,MACzB;AAIA,MAAAA,QAAO,kBAAkB,SAAU,MAAM;AACvC,eAAO,YAAY,IAAI;AAAA,MACzB;AAEA,eAAS,WAAY,QAAQ,UAAU;AACrC,YAAI,OAAO,aAAa,YAAY,aAAa,IAAI;AACnD,qBAAW;AAAA,QACf;AAEE,YAAI,CAACA,QAAO,WAAW,QAAQ,GAAG;AAChC,gBAAM,IAAI,UAAU,uBAAuB,QAAQ;AAAA,QACvD;AAEE,cAAM,SAAS,WAAW,QAAQ,QAAQ,IAAI;AAC9C,YAAI,MAAM,aAAa,MAAM;AAE7B,cAAM,SAAS,IAAI,MAAM,QAAQ,QAAQ;AAEzC,YAAI,WAAW,QAAQ;AAIrB,gBAAM,IAAI,MAAM,GAAG,MAAM;AAAA,QAC7B;AAEE,eAAO;AAAA,MACT;AAEA,eAAS,cAAe,OAAO;AAC7B,cAAM,SAAS,MAAM,SAAS,IAAI,IAAI,QAAQ,MAAM,MAAM,IAAI;AAC9D,cAAM,MAAM,aAAa,MAAM;AAC/B,iBAAS,IAAI,GAAG,IAAI,QAAQ,KAAK,GAAG;AAClC,cAAI,CAAC,IAAI,MAAM,CAAC,IAAI;AAAA,QACxB;AACE,eAAO;AAAA,MACT;AAEA,eAAS,cAAe,WAAW;AACjC,YAAI,WAAW,WAAW,UAAU,GAAG;AACrC,gBAAM,OAAO,IAAI,WAAW,SAAS;AACrC,iBAAO,gBAAgB,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU;AAAA,QACxE;AACE,eAAO,cAAc,SAAS;AAAA,MAChC;AAEA,eAAS,gBAAiB,OAAO,YAAY,QAAQ;AACnD,YAAI,aAAa,KAAK,MAAM,aAAa,YAAY;AACnD,gBAAM,IAAI,WAAW,sCAAsC;AAAA,QAC/D;AAEE,YAAI,MAAM,aAAa,cAAc,UAAU,IAAI;AACjD,gBAAM,IAAI,WAAW,sCAAsC;AAAA,QAC/D;AAEE,YAAI;AACJ,YAAI,eAAe,UAAa,WAAW,QAAW;AACpD,gBAAM,IAAI,WAAW,KAAK;AAAA,QAC9B,WAAa,WAAW,QAAW;AAC/B,gBAAM,IAAI,WAAW,OAAO,UAAU;AAAA,QAC1C,OAAS;AACL,gBAAM,IAAI,WAAW,OAAO,YAAY,MAAM;AAAA,QAClD;AAGE,eAAO,eAAe,KAAKA,QAAO,SAAS;AAE3C,eAAO;AAAA,MACT;AAEA,eAAS,WAAY,KAAK;AACxB,YAAIA,QAAO,SAAS,GAAG,GAAG;AACxB,gBAAM,MAAM,QAAQ,IAAI,MAAM,IAAI;AAClC,gBAAM,MAAM,aAAa,GAAG;AAE5B,cAAI,IAAI,WAAW,GAAG;AACpB,mBAAO;AAAA,UACb;AAEI,cAAI,KAAK,KAAK,GAAG,GAAG,GAAG;AACvB,iBAAO;AAAA,QACX;AAEE,YAAI,IAAI,WAAW,QAAW;AAC5B,cAAI,OAAO,IAAI,WAAW,YAAY,YAAY,IAAI,MAAM,GAAG;AAC7D,mBAAO,aAAa,CAAC;AAAA,UAC3B;AACI,iBAAO,cAAc,GAAG;AAAA,QAC5B;AAEE,YAAI,IAAI,SAAS,YAAY,MAAM,QAAQ,IAAI,IAAI,GAAG;AACpD,iBAAO,cAAc,IAAI,IAAI;AAAA,QACjC;AAAA,MACA;AAEA,eAAS,QAAS,QAAQ;AAGxB,YAAI,UAAU,cAAc;AAC1B,gBAAM,IAAI,WAAW,4DACa,aAAa,SAAS,EAAE,IAAI,QAAQ;AAAA,QAC1E;AACE,eAAO,SAAS;AAAA,MAClB;AAEA,eAAS,WAAY,QAAQ;AAC3B,YAAI,CAAC,UAAU,QAAQ;AACrB,mBAAS;AAAA,QACb;AACE,eAAOA,QAAO,MAAM,CAAC,MAAM;AAAA,MAC7B;AAEA,MAAAA,QAAO,WAAW,SAAS,SAAU,GAAG;AACtC,eAAO,KAAK,QAAQ,EAAE,cAAc,QAClC,MAAMA,QAAO;AAAA,MACjB;AAEA,MAAAA,QAAO,UAAU,SAAS,QAAS,GAAG,GAAG;AACvC,YAAI,WAAW,GAAG,UAAU,EAAG,KAAIA,QAAO,KAAK,GAAG,EAAE,QAAQ,EAAE,UAAU;AACxE,YAAI,WAAW,GAAG,UAAU,EAAG,KAAIA,QAAO,KAAK,GAAG,EAAE,QAAQ,EAAE,UAAU;AACxE,YAAI,CAACA,QAAO,SAAS,CAAC,KAAK,CAACA,QAAO,SAAS,CAAC,GAAG;AAC9C,gBAAM,IAAI;AAAA,YACR;AAAA,UACN;AAAA,QACA;AAEE,YAAI,MAAM,EAAG,QAAO;AAEpB,YAAI,IAAI,EAAE;AACV,YAAI,IAAI,EAAE;AAEV,iBAAS,IAAI,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC,GAAG,IAAI,KAAK,EAAE,GAAG;AAClD,cAAI,EAAE,CAAC,MAAM,EAAE,CAAC,GAAG;AACjB,gBAAI,EAAE,CAAC;AACP,gBAAI,EAAE,CAAC;AACP;AAAA,UACN;AAAA,QACA;AAEE,YAAI,IAAI,EAAG,QAAO;AAClB,YAAI,IAAI,EAAG,QAAO;AAClB,eAAO;AAAA,MACT;AAEA,MAAAA,QAAO,aAAa,SAAS,WAAY,UAAU;AACjD,gBAAQ,OAAO,QAAQ,EAAE,YAAa,GAAA;AAAA,UACpC,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO;AAAA,UACT;AACE,mBAAO;AAAA,QACb;AAAA,MACA;AAEA,MAAAA,QAAO,SAAS,SAAS,OAAQ,MAAM,QAAQ;AAC7C,YAAI,CAAC,MAAM,QAAQ,IAAI,GAAG;AACxB,gBAAM,IAAI,UAAU,6CAA6C;AAAA,QACrE;AAEE,YAAI,KAAK,WAAW,GAAG;AACrB,iBAAOA,QAAO,MAAM,CAAC;AAAA,QACzB;AAEE,YAAI;AACJ,YAAI,WAAW,QAAW;AACxB,mBAAS;AACT,eAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAChC,sBAAU,KAAK,CAAC,EAAE;AAAA,UACxB;AAAA,QACA;AAEE,cAAMF,UAASE,QAAO,YAAY,MAAM;AACxC,YAAI,MAAM;AACV,aAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAChC,cAAI,MAAM,KAAK,CAAC;AAChB,cAAI,WAAW,KAAK,UAAU,GAAG;AAC/B,gBAAI,MAAM,IAAI,SAASF,QAAO,QAAQ;AACpC,kBAAI,CAACE,QAAO,SAAS,GAAG,EAAG,OAAMA,QAAO,KAAK,GAAG;AAChD,kBAAI,KAAKF,SAAQ,GAAG;AAAA,YAC5B,OAAa;AACL,yBAAW,UAAU,IAAI;AAAA,gBACvBA;AAAA,gBACA;AAAA,gBACA;AAAA,cACV;AAAA,YACA;AAAA,UACK,WAAU,CAACE,QAAO,SAAS,GAAG,GAAG;AAChC,kBAAM,IAAI,UAAU,6CAA6C;AAAA,UACvE,OAAW;AACL,gBAAI,KAAKF,SAAQ,GAAG;AAAA,UAC1B;AACI,iBAAO,IAAI;AAAA,QACf;AACE,eAAOA;AAAA,MACT;AAEA,eAAS,WAAY,QAAQ,UAAU;AACrC,YAAIE,QAAO,SAAS,MAAM,GAAG;AAC3B,iBAAO,OAAO;AAAA,QAClB;AACE,YAAI,YAAY,OAAO,MAAM,KAAK,WAAW,QAAQ,WAAW,GAAG;AACjE,iBAAO,OAAO;AAAA,QAClB;AACE,YAAI,OAAO,WAAW,UAAU;AAC9B,gBAAM,IAAI;AAAA,YACR,6FACmB,OAAO;AAAA,UAChC;AAAA,QACA;AAEE,cAAM,MAAM,OAAO;AACnB,cAAM,YAAa,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM;AAC5D,YAAI,CAAC,aAAa,QAAQ,EAAG,QAAO;AAGpC,YAAI,cAAc;AAClB,mBAAS;AACP,kBAAQ,UAAQ;AAAA,YACd,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AACH,qBAAO;AAAA,YACT,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,YAAY,MAAM,EAAE;AAAA,YAC7B,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,MAAM;AAAA,YACf,KAAK;AACH,qBAAO,QAAQ;AAAA,YACjB,KAAK;AACH,qBAAO,cAAc,MAAM,EAAE;AAAA,YAC/B;AACE,kBAAI,aAAa;AACf,uBAAO,YAAY,KAAK,YAAY,MAAM,EAAE;AAAA,cACtD;AACQ,0BAAY,KAAK,UAAU,YAAW;AACtC,4BAAc;AAAA,UACtB;AAAA,QACA;AAAA,MACA;AACA,MAAAA,QAAO,aAAa;AAEpB,eAAS,aAAc,UAAU,OAAO,KAAK;AAC3C,YAAI,cAAc;AASlB,YAAI,UAAU,UAAa,QAAQ,GAAG;AACpC,kBAAQ;AAAA,QACZ;AAGE,YAAI,QAAQ,KAAK,QAAQ;AACvB,iBAAO;AAAA,QACX;AAEE,YAAI,QAAQ,UAAa,MAAM,KAAK,QAAQ;AAC1C,gBAAM,KAAK;AAAA,QACf;AAEE,YAAI,OAAO,GAAG;AACZ,iBAAO;AAAA,QACX;AAGE,iBAAS;AACT,mBAAW;AAEX,YAAI,OAAO,OAAO;AAChB,iBAAO;AAAA,QACX;AAEE,YAAI,CAAC,SAAU,YAAW;AAE1B,eAAO,MAAM;AACX,kBAAQ,UAAQ;AAAA,YACd,KAAK;AACH,qBAAO,SAAS,MAAM,OAAO,GAAG;AAAA,YAElC,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,UAAU,MAAM,OAAO,GAAG;AAAA,YAEnC,KAAK;AACH,qBAAO,WAAW,MAAM,OAAO,GAAG;AAAA,YAEpC,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,YAAY,MAAM,OAAO,GAAG;AAAA,YAErC,KAAK;AACH,qBAAO,YAAY,MAAM,OAAO,GAAG;AAAA,YAErC,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,aAAa,MAAM,OAAO,GAAG;AAAA,YAEtC;AACE,kBAAI,YAAa,OAAM,IAAI,UAAU,uBAAuB,QAAQ;AACpE,0BAAY,WAAW,IAAI,YAAW;AACtC,4BAAc;AAAA,UACtB;AAAA,QACA;AAAA,MACA;AAQA,MAAAA,QAAO,UAAU,YAAY;AAE7B,eAAS,KAAM,GAAG,GAAG,GAAG;AACtB,cAAM,IAAI,EAAE,CAAC;AACb,UAAE,CAAC,IAAI,EAAE,CAAC;AACV,UAAE,CAAC,IAAI;AAAA,MACT;AAEA,MAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,cAAM,MAAM,KAAK;AACjB,YAAI,MAAM,MAAM,GAAG;AACjB,gBAAM,IAAI,WAAW,2CAA2C;AAAA,QACpE;AACE,iBAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,eAAK,MAAM,GAAG,IAAI,CAAC;AAAA,QACvB;AACE,eAAO;AAAA,MACT;AAEA,MAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,cAAM,MAAM,KAAK;AACjB,YAAI,MAAM,MAAM,GAAG;AACjB,gBAAM,IAAI,WAAW,2CAA2C;AAAA,QACpE;AACE,iBAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,eAAK,MAAM,GAAG,IAAI,CAAC;AACnB,eAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AAAA,QAC3B;AACE,eAAO;AAAA,MACT;AAEA,MAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,cAAM,MAAM,KAAK;AACjB,YAAI,MAAM,MAAM,GAAG;AACjB,gBAAM,IAAI,WAAW,2CAA2C;AAAA,QACpE;AACE,iBAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,eAAK,MAAM,GAAG,IAAI,CAAC;AACnB,eAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AACvB,eAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AACvB,eAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AAAA,QAC3B;AACE,eAAO;AAAA,MACT;AAEA,MAAAA,QAAO,UAAU,WAAW,SAAS,WAAY;AAC/C,cAAM,SAAS,KAAK;AACpB,YAAI,WAAW,EAAG,QAAO;AACzB,YAAI,UAAU,WAAW,EAAG,QAAO,UAAU,MAAM,GAAG,MAAM;AAC5D,eAAO,aAAa,MAAM,MAAM,SAAS;AAAA,MAC3C;AAEA,MAAAA,QAAO,UAAU,iBAAiBA,QAAO,UAAU;AAEnD,MAAAA,QAAO,UAAU,SAAS,SAAS,OAAQ,GAAG;AAC5C,YAAI,CAACA,QAAO,SAAS,CAAC,EAAG,OAAM,IAAI,UAAU,2BAA2B;AACxE,YAAI,SAAS,EAAG,QAAO;AACvB,eAAOA,QAAO,QAAQ,MAAM,CAAC,MAAM;AAAA,MACrC;AAEA,MAAAA,QAAO,UAAU,UAAU,SAAS,UAAW;AAC7C,YAAI,MAAM;AACV,cAAM,MAAM,QAAQ;AACpB,cAAM,KAAK,SAAS,OAAO,GAAG,GAAG,EAAE,QAAQ,WAAW,KAAK,EAAE,KAAI;AACjE,YAAI,KAAK,SAAS,IAAK,QAAO;AAC9B,eAAO,aAAa,MAAM;AAAA,MAC5B;AACA,UAAI,qBAAqB;AACvB,QAAAA,QAAO,UAAU,mBAAmB,IAAIA,QAAO,UAAU;AAAA,MAC3D;AAEA,MAAAA,QAAO,UAAU,UAAU,SAAS,QAAS,QAAQ,OAAO,KAAK,WAAW,SAAS;AACnF,YAAI,WAAW,QAAQ,UAAU,GAAG;AAClC,mBAASA,QAAO,KAAK,QAAQ,OAAO,QAAQ,OAAO,UAAU;AAAA,QACjE;AACE,YAAI,CAACA,QAAO,SAAS,MAAM,GAAG;AAC5B,gBAAM,IAAI;AAAA,YACR,mFACoB,OAAO;AAAA,UACjC;AAAA,QACA;AAEE,YAAI,UAAU,QAAW;AACvB,kBAAQ;AAAA,QACZ;AACE,YAAI,QAAQ,QAAW;AACrB,gBAAM,SAAS,OAAO,SAAS;AAAA,QACnC;AACE,YAAI,cAAc,QAAW;AAC3B,sBAAY;AAAA,QAChB;AACE,YAAI,YAAY,QAAW;AACzB,oBAAU,KAAK;AAAA,QACnB;AAEE,YAAI,QAAQ,KAAK,MAAM,OAAO,UAAU,YAAY,KAAK,UAAU,KAAK,QAAQ;AAC9E,gBAAM,IAAI,WAAW,oBAAoB;AAAA,QAC7C;AAEE,YAAI,aAAa,WAAW,SAAS,KAAK;AACxC,iBAAO;AAAA,QACX;AACE,YAAI,aAAa,SAAS;AACxB,iBAAO;AAAA,QACX;AACE,YAAI,SAAS,KAAK;AAChB,iBAAO;AAAA,QACX;AAEE,mBAAW;AACX,iBAAS;AACT,uBAAe;AACf,qBAAa;AAEb,YAAI,SAAS,OAAQ,QAAO;AAE5B,YAAI,IAAI,UAAU;AAClB,YAAI,IAAI,MAAM;AACd,cAAM,MAAM,KAAK,IAAI,GAAG,CAAC;AAEzB,cAAM,WAAW,KAAK,MAAM,WAAW,OAAO;AAC9C,cAAM,aAAa,OAAO,MAAM,OAAO,GAAG;AAE1C,iBAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,cAAI,SAAS,CAAC,MAAM,WAAW,CAAC,GAAG;AACjC,gBAAI,SAAS,CAAC;AACd,gBAAI,WAAW,CAAC;AAChB;AAAA,UACN;AAAA,QACA;AAEE,YAAI,IAAI,EAAG,QAAO;AAClB,YAAI,IAAI,EAAG,QAAO;AAClB,eAAO;AAAA,MACT;AAWA,eAAS,qBAAsBF,SAAQ,KAAK,YAAY,UAAU,KAAK;AAErE,YAAIA,QAAO,WAAW,EAAG,QAAO;AAGhC,YAAI,OAAO,eAAe,UAAU;AAClC,qBAAW;AACX,uBAAa;AAAA,QACjB,WAAa,aAAa,YAAY;AAClC,uBAAa;AAAA,QACjB,WAAa,aAAa,aAAa;AACnC,uBAAa;AAAA,QACjB;AACE,qBAAa,CAAC;AACd,YAAI,YAAY,UAAU,GAAG;AAE3B,uBAAa,MAAM,IAAKA,QAAO,SAAS;AAAA,QAC5C;AAGE,YAAI,aAAa,EAAG,cAAaA,QAAO,SAAS;AACjD,YAAI,cAAcA,QAAO,QAAQ;AAC/B,cAAI,IAAK,QAAO;AAAA,cACX,cAAaA,QAAO,SAAS;AAAA,QACtC,WAAa,aAAa,GAAG;AACzB,cAAI,IAAK,cAAa;AAAA,cACjB,QAAO;AAAA,QAChB;AAGE,YAAI,OAAO,QAAQ,UAAU;AAC3B,gBAAME,QAAO,KAAK,KAAK,QAAQ;AAAA,QACnC;AAGE,YAAIA,QAAO,SAAS,GAAG,GAAG;AAExB,cAAI,IAAI,WAAW,GAAG;AACpB,mBAAO;AAAA,UACb;AACI,iBAAO,aAAaF,SAAQ,KAAK,YAAY,UAAU,GAAG;AAAA,QAC9D,WAAa,OAAO,QAAQ,UAAU;AAClC,gBAAM,MAAM;AACZ,cAAI,OAAO,WAAW,UAAU,YAAY,YAAY;AACtD,gBAAI,KAAK;AACP,qBAAO,WAAW,UAAU,QAAQ,KAAKA,SAAQ,KAAK,UAAU;AAAA,YACxE,OAAa;AACL,qBAAO,WAAW,UAAU,YAAY,KAAKA,SAAQ,KAAK,UAAU;AAAA,YAC5E;AAAA,UACA;AACI,iBAAO,aAAaA,SAAQ,CAAC,GAAG,GAAG,YAAY,UAAU,GAAG;AAAA,QAChE;AAEE,cAAM,IAAI,UAAU,sCAAsC;AAAA,MAC5D;AAEA,eAAS,aAAc,KAAK,KAAK,YAAY,UAAU,KAAK;AAC1D,YAAI,YAAY;AAChB,YAAI,YAAY,IAAI;AACpB,YAAI,YAAY,IAAI;AAEpB,YAAI,aAAa,QAAW;AAC1B,qBAAW,OAAO,QAAQ,EAAE,YAAW;AACvC,cAAI,aAAa,UAAU,aAAa,WACpC,aAAa,aAAa,aAAa,YAAY;AACrD,gBAAI,IAAI,SAAS,KAAK,IAAI,SAAS,GAAG;AACpC,qBAAO;AAAA,YACf;AACM,wBAAY;AACZ,yBAAa;AACb,yBAAa;AACb,0BAAc;AAAA,UACpB;AAAA,QACA;AAEE,iBAAS,KAAM,KAAKF,IAAG;AACrB,cAAI,cAAc,GAAG;AACnB,mBAAO,IAAIA,EAAC;AAAA,UAClB,OAAW;AACL,mBAAO,IAAI,aAAaA,KAAI,SAAS;AAAA,UAC3C;AAAA,QACA;AAEE,YAAI;AACJ,YAAI,KAAK;AACP,cAAI,aAAa;AACjB,eAAK,IAAI,YAAY,IAAI,WAAW,KAAK;AACvC,gBAAI,KAAK,KAAK,CAAC,MAAM,KAAK,KAAK,eAAe,KAAK,IAAI,IAAI,UAAU,GAAG;AACtE,kBAAI,eAAe,GAAI,cAAa;AACpC,kBAAI,IAAI,aAAa,MAAM,UAAW,QAAO,aAAa;AAAA,YAClE,OAAa;AACL,kBAAI,eAAe,GAAI,MAAK,IAAI;AAChC,2BAAa;AAAA,YACrB;AAAA,UACA;AAAA,QACA,OAAS;AACL,cAAI,aAAa,YAAY,UAAW,cAAa,YAAY;AACjE,eAAK,IAAI,YAAY,KAAK,GAAG,KAAK;AAChC,gBAAI,QAAQ;AACZ,qBAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,kBAAI,KAAK,KAAK,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,GAAG;AACrC,wBAAQ;AACR;AAAA,cACV;AAAA,YACA;AACM,gBAAI,MAAO,QAAO;AAAA,UACxB;AAAA,QACA;AAEE,eAAO;AAAA,MACT;AAEA,MAAAI,QAAO,UAAU,WAAW,SAAS,SAAU,KAAK,YAAY,UAAU;AACxE,eAAO,KAAK,QAAQ,KAAK,YAAY,QAAQ,MAAM;AAAA,MACrD;AAEA,MAAAA,QAAO,UAAU,UAAU,SAAS,QAAS,KAAK,YAAY,UAAU;AACtE,eAAO,qBAAqB,MAAM,KAAK,YAAY,UAAU,IAAI;AAAA,MACnE;AAEA,MAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,KAAK,YAAY,UAAU;AAC9E,eAAO,qBAAqB,MAAM,KAAK,YAAY,UAAU,KAAK;AAAA,MACpE;AAEA,eAAS,SAAU,KAAK,QAAQ,QAAQ,QAAQ;AAC9C,iBAAS,OAAO,MAAM,KAAK;AAC3B,cAAM,YAAY,IAAI,SAAS;AAC/B,YAAI,CAAC,QAAQ;AACX,mBAAS;AAAA,QACb,OAAS;AACL,mBAAS,OAAO,MAAM;AACtB,cAAI,SAAS,WAAW;AACtB,qBAAS;AAAA,UACf;AAAA,QACA;AAEE,cAAM,SAAS,OAAO;AAEtB,YAAI,SAAS,SAAS,GAAG;AACvB,mBAAS,SAAS;AAAA,QACtB;AACE,YAAI;AACJ,aAAK,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC3B,gBAAM,SAAS,SAAS,OAAO,OAAO,IAAI,GAAG,CAAC,GAAG,EAAE;AACnD,cAAI,YAAY,MAAM,EAAG,QAAO;AAChC,cAAI,SAAS,CAAC,IAAI;AAAA,QACtB;AACE,eAAO;AAAA,MACT;AAEA,eAAS,UAAW,KAAK,QAAQ,QAAQ,QAAQ;AAC/C,eAAO,WAAW,YAAY,QAAQ,IAAI,SAAS,MAAM,GAAG,KAAK,QAAQ,MAAM;AAAA,MACjF;AAEA,eAAS,WAAY,KAAK,QAAQ,QAAQ,QAAQ;AAChD,eAAO,WAAW,aAAa,MAAM,GAAG,KAAK,QAAQ,MAAM;AAAA,MAC7D;AAEA,eAAS,YAAa,KAAK,QAAQ,QAAQ,QAAQ;AACjD,eAAO,WAAW,cAAc,MAAM,GAAG,KAAK,QAAQ,MAAM;AAAA,MAC9D;AAEA,eAAS,UAAW,KAAK,QAAQ,QAAQ,QAAQ;AAC/C,eAAO,WAAW,eAAe,QAAQ,IAAI,SAAS,MAAM,GAAG,KAAK,QAAQ,MAAM;AAAA,MACpF;AAEA,MAAAA,QAAO,UAAU,QAAQ,SAAS,MAAO,QAAQ,QAAQ,QAAQ,UAAU;AAEzE,YAAI,WAAW,QAAW;AACxB,qBAAW;AACX,mBAAS,KAAK;AACd,mBAAS;AAAA,QAEV,WAAU,WAAW,UAAa,OAAO,WAAW,UAAU;AAC7D,qBAAW;AACX,mBAAS,KAAK;AACd,mBAAS;AAAA,QAEb,WAAa,SAAS,MAAM,GAAG;AAC3B,mBAAS,WAAW;AACpB,cAAI,SAAS,MAAM,GAAG;AACpB,qBAAS,WAAW;AACpB,gBAAI,aAAa,OAAW,YAAW;AAAA,UAC7C,OAAW;AACL,uBAAW;AACX,qBAAS;AAAA,UACf;AAAA,QACA,OAAS;AACL,gBAAM,IAAI;AAAA,YACR;AAAA,UACN;AAAA,QACA;AAEE,cAAM,YAAY,KAAK,SAAS;AAChC,YAAI,WAAW,UAAa,SAAS,UAAW,UAAS;AAEzD,YAAK,OAAO,SAAS,MAAM,SAAS,KAAK,SAAS,MAAO,SAAS,KAAK,QAAQ;AAC7E,gBAAM,IAAI,WAAW,wCAAwC;AAAA,QACjE;AAEE,YAAI,CAAC,SAAU,YAAW;AAE1B,YAAI,cAAc;AAClB,mBAAS;AACP,kBAAQ,UAAQ;AAAA,YACd,KAAK;AACH,qBAAO,SAAS,MAAM,QAAQ,QAAQ,MAAM;AAAA,YAE9C,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,UAAU,MAAM,QAAQ,QAAQ,MAAM;AAAA,YAE/C,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,WAAW,MAAM,QAAQ,QAAQ,MAAM;AAAA,YAEhD,KAAK;AAEH,qBAAO,YAAY,MAAM,QAAQ,QAAQ,MAAM;AAAA,YAEjD,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,UAAU,MAAM,QAAQ,QAAQ,MAAM;AAAA,YAE/C;AACE,kBAAI,YAAa,OAAM,IAAI,UAAU,uBAAuB,QAAQ;AACpE,0BAAY,KAAK,UAAU,YAAW;AACtC,4BAAc;AAAA,UACtB;AAAA,QACA;AAAA,MACA;AAEA,MAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,eAAO;AAAA,UACL,MAAM;AAAA,UACN,MAAM,MAAM,UAAU,MAAM,KAAK,KAAK,QAAQ,MAAM,CAAC;AAAA,QACzD;AAAA,MACA;AAEA,eAAS,YAAa,KAAK,OAAO,KAAK;AACrC,YAAI,UAAU,KAAK,QAAQ,IAAI,QAAQ;AACrC,iBAAO,OAAO,cAAc,GAAG;AAAA,QACnC,OAAS;AACL,iBAAO,OAAO,cAAc,IAAI,MAAM,OAAO,GAAG,CAAC;AAAA,QACrD;AAAA,MACA;AAEA,eAAS,UAAW,KAAK,OAAO,KAAK;AACnC,cAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAC9B,cAAM,MAAM,CAAA;AAEZ,YAAI,IAAI;AACR,eAAO,IAAI,KAAK;AACd,gBAAM,YAAY,IAAI,CAAC;AACvB,cAAI,YAAY;AAChB,cAAI,mBAAoB,YAAY,MAChC,IACC,YAAY,MACT,IACC,YAAY,MACT,IACA;AAEZ,cAAI,IAAI,oBAAoB,KAAK;AAC/B,gBAAI,YAAY,WAAW,YAAY;AAEvC,oBAAQ,kBAAgB;AAAA,cACtB,KAAK;AACH,oBAAI,YAAY,KAAM;AACpB,8BAAY;AAAA,gBACxB;AACU;AAAA,cACF,KAAK;AACH,6BAAa,IAAI,IAAI,CAAC;AACtB,qBAAK,aAAa,SAAU,KAAM;AAChC,mCAAiB,YAAY,OAAS,IAAO,aAAa;AAC1D,sBAAI,gBAAgB,KAAM;AACxB,gCAAY;AAAA,kBAC1B;AAAA,gBACA;AACU;AAAA,cACF,KAAK;AACH,6BAAa,IAAI,IAAI,CAAC;AACtB,4BAAY,IAAI,IAAI,CAAC;AACrB,qBAAK,aAAa,SAAU,QAAS,YAAY,SAAU,KAAM;AAC/D,mCAAiB,YAAY,OAAQ,MAAO,aAAa,OAAS,IAAO,YAAY;AACrF,sBAAI,gBAAgB,SAAU,gBAAgB,SAAU,gBAAgB,QAAS;AAC/E,gCAAY;AAAA,kBAC1B;AAAA,gBACA;AACU;AAAA,cACF,KAAK;AACH,6BAAa,IAAI,IAAI,CAAC;AACtB,4BAAY,IAAI,IAAI,CAAC;AACrB,6BAAa,IAAI,IAAI,CAAC;AACtB,qBAAK,aAAa,SAAU,QAAS,YAAY,SAAU,QAAS,aAAa,SAAU,KAAM;AAC/F,mCAAiB,YAAY,OAAQ,MAAQ,aAAa,OAAS,MAAO,YAAY,OAAS,IAAO,aAAa;AACnH,sBAAI,gBAAgB,SAAU,gBAAgB,SAAU;AACtD,gCAAY;AAAA,kBAC1B;AAAA,gBACA;AAAA,YACA;AAAA,UACA;AAEI,cAAI,cAAc,MAAM;AAGtB,wBAAY;AACZ,+BAAmB;AAAA,UACzB,WAAe,YAAY,OAAQ;AAE7B,yBAAa;AACb,gBAAI,KAAK,cAAc,KAAK,OAAQ,KAAM;AAC1C,wBAAY,QAAS,YAAY;AAAA,UACvC;AAEI,cAAI,KAAK,SAAS;AAClB,eAAK;AAAA,QACT;AAEE,eAAO,sBAAsB,GAAG;AAAA,MAClC;AAKA,YAAM,uBAAuB;AAE7B,eAAS,sBAAuB,YAAY;AAC1C,cAAM,MAAM,WAAW;AACvB,YAAI,OAAO,sBAAsB;AAC/B,iBAAO,OAAO,aAAa,MAAM,QAAQ,UAAU;AAAA,QACvD;AAGE,YAAI,MAAM;AACV,YAAI,IAAI;AACR,eAAO,IAAI,KAAK;AACd,iBAAO,OAAO,aAAa;AAAA,YACzB;AAAA,YACA,WAAW,MAAM,GAAG,KAAK,oBAAoB;AAAA,UACnD;AAAA,QACA;AACE,eAAO;AAAA,MACT;AAEA,eAAS,WAAY,KAAK,OAAO,KAAK;AACpC,YAAI,MAAM;AACV,cAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAE9B,iBAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAChC,iBAAO,OAAO,aAAa,IAAI,CAAC,IAAI,GAAI;AAAA,QAC5C;AACE,eAAO;AAAA,MACT;AAEA,eAAS,YAAa,KAAK,OAAO,KAAK;AACrC,YAAI,MAAM;AACV,cAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAE9B,iBAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAChC,iBAAO,OAAO,aAAa,IAAI,CAAC,CAAC;AAAA,QACrC;AACE,eAAO;AAAA,MACT;AAEA,eAAS,SAAU,KAAK,OAAO,KAAK;AAClC,cAAM,MAAM,IAAI;AAEhB,YAAI,CAAC,SAAS,QAAQ,EAAG,SAAQ;AACjC,YAAI,CAAC,OAAO,MAAM,KAAK,MAAM,IAAK,OAAM;AAExC,YAAI,MAAM;AACV,iBAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAChC,iBAAO,oBAAoB,IAAI,CAAC,CAAC;AAAA,QACrC;AACE,eAAO;AAAA,MACT;AAEA,eAAS,aAAc,KAAK,OAAO,KAAK;AACtC,cAAM,QAAQ,IAAI,MAAM,OAAO,GAAG;AAClC,YAAI,MAAM;AAEV,iBAAS,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG;AAC5C,iBAAO,OAAO,aAAa,MAAM,CAAC,IAAK,MAAM,IAAI,CAAC,IAAI,GAAI;AAAA,QAC9D;AACE,eAAO;AAAA,MACT;AAEA,MAAAA,QAAO,UAAU,QAAQ,SAAS,MAAO,OAAO,KAAK;AACnD,cAAM,MAAM,KAAK;AACjB,gBAAQ,CAAC,CAAC;AACV,cAAM,QAAQ,SAAY,MAAM,CAAC,CAAC;AAElC,YAAI,QAAQ,GAAG;AACb,mBAAS;AACT,cAAI,QAAQ,EAAG,SAAQ;AAAA,QAC3B,WAAa,QAAQ,KAAK;AACtB,kBAAQ;AAAA,QACZ;AAEE,YAAI,MAAM,GAAG;AACX,iBAAO;AACP,cAAI,MAAM,EAAG,OAAM;AAAA,QACvB,WAAa,MAAM,KAAK;AACpB,gBAAM;AAAA,QACV;AAEE,YAAI,MAAM,MAAO,OAAM;AAEvB,cAAM,SAAS,KAAK,SAAS,OAAO,GAAG;AAEvC,eAAO,eAAe,QAAQA,QAAO,SAAS;AAE9C,eAAO;AAAA,MACT;AAKA,eAAS,YAAa,QAAQ,KAAK,QAAQ;AACzC,YAAK,SAAS,MAAO,KAAK,SAAS,EAAG,OAAM,IAAI,WAAW,oBAAoB;AAC/E,YAAI,SAAS,MAAM,OAAQ,OAAM,IAAI,WAAW,uCAAuC;AAAA,MACzF;AAEA,MAAAA,QAAO,UAAU,aACjBA,QAAO,UAAU,aAAa,SAAS,WAAY,QAAQC,aAAY,UAAU;AAC/E,iBAAS,WAAW;AACpB,QAAAA,cAAaA,gBAAe;AAC5B,YAAI,CAAC,SAAU,aAAY,QAAQA,aAAY,KAAK,MAAM;AAE1D,YAAI,MAAM,KAAK,MAAM;AACrB,YAAI,MAAM;AACV,YAAI,IAAI;AACR,eAAO,EAAE,IAAIA,gBAAe,OAAO,MAAQ;AACzC,iBAAO,KAAK,SAAS,CAAC,IAAI;AAAA,QAC9B;AAEE,eAAO;AAAA,MACT;AAEA,MAAAD,QAAO,UAAU,aACjBA,QAAO,UAAU,aAAa,SAAS,WAAY,QAAQC,aAAY,UAAU;AAC/E,iBAAS,WAAW;AACpB,QAAAA,cAAaA,gBAAe;AAC5B,YAAI,CAAC,UAAU;AACb,sBAAY,QAAQA,aAAY,KAAK,MAAM;AAAA,QAC/C;AAEE,YAAI,MAAM,KAAK,SAAS,EAAEA,WAAU;AACpC,YAAI,MAAM;AACV,eAAOA,cAAa,MAAM,OAAO,MAAQ;AACvC,iBAAO,KAAK,SAAS,EAAEA,WAAU,IAAI;AAAA,QACzC;AAEE,eAAO;AAAA,MACT;AAEA,MAAAD,QAAO,UAAU,YACjBA,QAAO,UAAU,YAAY,SAAS,UAAW,QAAQ,UAAU;AACjE,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,eAAO,KAAK,MAAM;AAAA,MACpB;AAEA,MAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,eAAO,KAAK,MAAM,IAAK,KAAK,SAAS,CAAC,KAAK;AAAA,MAC7C;AAEA,MAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,eAAQ,KAAK,MAAM,KAAK,IAAK,KAAK,SAAS,CAAC;AAAA,MAC9C;AAEA,MAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,gBAAS,KAAK,MAAM,IACf,KAAK,SAAS,CAAC,KAAK,IACpB,KAAK,SAAS,CAAC,KAAK,MACpB,KAAK,SAAS,CAAC,IAAI;AAAA,MAC1B;AAEA,MAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,eAAQ,KAAK,MAAM,IAAI,YACnB,KAAK,SAAS,CAAC,KAAK,KACrB,KAAK,SAAS,CAAC,KAAK,IACrB,KAAK,SAAS,CAAC;AAAA,MACnB;AAEA,MAAAA,QAAO,UAAU,kBAAkB,mBAAmB,SAAS,gBAAiB,QAAQ;AACtF,iBAAS,WAAW;AACpB,uBAAe,QAAQ,QAAQ;AAC/B,cAAM,QAAQ,KAAK,MAAM;AACzB,cAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,YAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,sBAAY,QAAQ,KAAK,SAAS,CAAC;AAAA,QACvC;AAEE,cAAM,KAAK,QACT,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK;AAExB,cAAM,KAAK,KAAK,EAAE,MAAM,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,OAAO,KAAK;AAEd,eAAO,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,EAAE;AAAA,MAC7C,CAAA;AAED,MAAAA,QAAO,UAAU,kBAAkB,mBAAmB,SAAS,gBAAiB,QAAQ;AACtF,iBAAS,WAAW;AACpB,uBAAe,QAAQ,QAAQ;AAC/B,cAAM,QAAQ,KAAK,MAAM;AACzB,cAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,YAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,sBAAY,QAAQ,KAAK,SAAS,CAAC;AAAA,QACvC;AAEE,cAAM,KAAK,QAAQ,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM;AAEf,cAAM,KAAK,KAAK,EAAE,MAAM,IAAI,KAAK,KAC/B,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB;AAEF,gBAAQ,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,EAAE;AAAA,MAC9C,CAAA;AAED,MAAAA,QAAO,UAAU,YAAY,SAAS,UAAW,QAAQC,aAAY,UAAU;AAC7E,iBAAS,WAAW;AACpB,QAAAA,cAAaA,gBAAe;AAC5B,YAAI,CAAC,SAAU,aAAY,QAAQA,aAAY,KAAK,MAAM;AAE1D,YAAI,MAAM,KAAK,MAAM;AACrB,YAAI,MAAM;AACV,YAAI,IAAI;AACR,eAAO,EAAE,IAAIA,gBAAe,OAAO,MAAQ;AACzC,iBAAO,KAAK,SAAS,CAAC,IAAI;AAAA,QAC9B;AACE,eAAO;AAEP,YAAI,OAAO,IAAK,QAAO,KAAK,IAAI,GAAG,IAAIA,WAAU;AAEjD,eAAO;AAAA,MACT;AAEA,MAAAD,QAAO,UAAU,YAAY,SAAS,UAAW,QAAQC,aAAY,UAAU;AAC7E,iBAAS,WAAW;AACpB,QAAAA,cAAaA,gBAAe;AAC5B,YAAI,CAAC,SAAU,aAAY,QAAQA,aAAY,KAAK,MAAM;AAE1D,YAAI,IAAIA;AACR,YAAI,MAAM;AACV,YAAI,MAAM,KAAK,SAAS,EAAE,CAAC;AAC3B,eAAO,IAAI,MAAM,OAAO,MAAQ;AAC9B,iBAAO,KAAK,SAAS,EAAE,CAAC,IAAI;AAAA,QAChC;AACE,eAAO;AAEP,YAAI,OAAO,IAAK,QAAO,KAAK,IAAI,GAAG,IAAIA,WAAU;AAEjD,eAAO;AAAA,MACT;AAEA,MAAAD,QAAO,UAAU,WAAW,SAAS,SAAU,QAAQ,UAAU;AAC/D,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,YAAI,EAAE,KAAK,MAAM,IAAI,KAAO,QAAQ,KAAK,MAAM;AAC/C,gBAAS,MAAO,KAAK,MAAM,IAAI,KAAK;AAAA,MACtC;AAEA,MAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,cAAM,MAAM,KAAK,MAAM,IAAK,KAAK,SAAS,CAAC,KAAK;AAChD,eAAQ,MAAM,QAAU,MAAM,aAAa;AAAA,MAC7C;AAEA,MAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,cAAM,MAAM,KAAK,SAAS,CAAC,IAAK,KAAK,MAAM,KAAK;AAChD,eAAQ,MAAM,QAAU,MAAM,aAAa;AAAA,MAC7C;AAEA,MAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,eAAQ,KAAK,MAAM,IAChB,KAAK,SAAS,CAAC,KAAK,IACpB,KAAK,SAAS,CAAC,KAAK,KACpB,KAAK,SAAS,CAAC,KAAK;AAAA,MACzB;AAEA,MAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,eAAQ,KAAK,MAAM,KAAK,KACrB,KAAK,SAAS,CAAC,KAAK,KACpB,KAAK,SAAS,CAAC,KAAK,IACpB,KAAK,SAAS,CAAC;AAAA,MACpB;AAEA,MAAAA,QAAO,UAAU,iBAAiB,mBAAmB,SAAS,eAAgB,QAAQ;AACpF,iBAAS,WAAW;AACpB,uBAAe,QAAQ,QAAQ;AAC/B,cAAM,QAAQ,KAAK,MAAM;AACzB,cAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,YAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,sBAAY,QAAQ,KAAK,SAAS,CAAC;AAAA,QACvC;AAEE,cAAM,MAAM,KAAK,SAAS,CAAC,IACzB,KAAK,SAAS,CAAC,IAAI,KAAK,IACxB,KAAK,SAAS,CAAC,IAAI,KAAK,MACvB,QAAQ;AAEX,gBAAQ,OAAO,GAAG,KAAK,OAAO,EAAE,KAC9B,OAAO,QACP,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,EAAE;AAAA,MAC3B,CAAA;AAED,MAAAA,QAAO,UAAU,iBAAiB,mBAAmB,SAAS,eAAgB,QAAQ;AACpF,iBAAS,WAAW;AACpB,uBAAe,QAAQ,QAAQ;AAC/B,cAAM,QAAQ,KAAK,MAAM;AACzB,cAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,YAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,sBAAY,QAAQ,KAAK,SAAS,CAAC;AAAA,QACvC;AAEE,cAAM,OAAO,SAAS;AAAA,QACpB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM;AAEf,gBAAQ,OAAO,GAAG,KAAK,OAAO,EAAE,KAC9B,OAAO,KAAK,EAAE,MAAM,IAAI,KAAK,KAC7B,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,IAAI;AAAA,MACP,CAAA;AAED,MAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,eAAOD,SAAQ,KAAK,MAAM,QAAQ,MAAM,IAAI,CAAC;AAAA,MAC/C;AAEA,MAAAC,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,eAAOD,SAAQ,KAAK,MAAM,QAAQ,OAAO,IAAI,CAAC;AAAA,MAChD;AAEA,MAAAC,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,eAAOD,SAAQ,KAAK,MAAM,QAAQ,MAAM,IAAI,CAAC;AAAA,MAC/C;AAEA,MAAAC,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,eAAOD,SAAQ,KAAK,MAAM,QAAQ,OAAO,IAAI,CAAC;AAAA,MAChD;AAEA,eAAS,SAAU,KAAK,OAAO,QAAQ,KAAK,KAAK,KAAK;AACpD,YAAI,CAACC,QAAO,SAAS,GAAG,EAAG,OAAM,IAAI,UAAU,6CAA6C;AAC5F,YAAI,QAAQ,OAAO,QAAQ,IAAK,OAAM,IAAI,WAAW,mCAAmC;AACxF,YAAI,SAAS,MAAM,IAAI,OAAQ,OAAM,IAAI,WAAW,oBAAoB;AAAA,MAC1E;AAEA,MAAAA,QAAO,UAAU,cACjBA,QAAO,UAAU,cAAc,SAAS,YAAa,OAAO,QAAQC,aAAY,UAAU;AACxF,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,QAAAA,cAAaA,gBAAe;AAC5B,YAAI,CAAC,UAAU;AACb,gBAAM,WAAW,KAAK,IAAI,GAAG,IAAIA,WAAU,IAAI;AAC/C,mBAAS,MAAM,OAAO,QAAQA,aAAY,UAAU,CAAC;AAAA,QACzD;AAEE,YAAI,MAAM;AACV,YAAI,IAAI;AACR,aAAK,MAAM,IAAI,QAAQ;AACvB,eAAO,EAAE,IAAIA,gBAAe,OAAO,MAAQ;AACzC,eAAK,SAAS,CAAC,IAAK,QAAQ,MAAO;AAAA,QACvC;AAEE,eAAO,SAASA;AAAA,MAClB;AAEA,MAAAD,QAAO,UAAU,cACjBA,QAAO,UAAU,cAAc,SAAS,YAAa,OAAO,QAAQC,aAAY,UAAU;AACxF,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,QAAAA,cAAaA,gBAAe;AAC5B,YAAI,CAAC,UAAU;AACb,gBAAM,WAAW,KAAK,IAAI,GAAG,IAAIA,WAAU,IAAI;AAC/C,mBAAS,MAAM,OAAO,QAAQA,aAAY,UAAU,CAAC;AAAA,QACzD;AAEE,YAAI,IAAIA,cAAa;AACrB,YAAI,MAAM;AACV,aAAK,SAAS,CAAC,IAAI,QAAQ;AAC3B,eAAO,EAAE,KAAK,MAAM,OAAO,MAAQ;AACjC,eAAK,SAAS,CAAC,IAAK,QAAQ,MAAO;AAAA,QACvC;AAEE,eAAO,SAASA;AAAA,MAClB;AAEA,MAAAD,QAAO,UAAU,aACjBA,QAAO,UAAU,aAAa,SAAS,WAAY,OAAO,QAAQ,UAAU;AAC1E,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,KAAM,CAAC;AACvD,aAAK,MAAM,IAAK,QAAQ;AACxB,eAAO,SAAS;AAAA,MAClB;AAEA,MAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,CAAC;AACzD,aAAK,MAAM,IAAK,QAAQ;AACxB,aAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,eAAO,SAAS;AAAA,MAClB;AAEA,MAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,CAAC;AACzD,aAAK,MAAM,IAAK,UAAU;AAC1B,aAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,eAAO,SAAS;AAAA,MAClB;AAEA,MAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,CAAC;AAC7D,aAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAK,MAAM,IAAK,QAAQ;AACxB,eAAO,SAAS;AAAA,MAClB;AAEA,MAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,CAAC;AAC7D,aAAK,MAAM,IAAK,UAAU;AAC1B,aAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,eAAO,SAAS;AAAA,MAClB;AAEA,eAAS,eAAgB,KAAK,OAAO,QAAQ,KAAK,KAAK;AACrD,mBAAW,OAAO,KAAK,KAAK,KAAK,QAAQ,CAAC;AAE1C,YAAI,KAAK,OAAO,QAAQ,OAAO,UAAU,CAAC;AAC1C,YAAI,QAAQ,IAAI;AAChB,aAAK,MAAM;AACX,YAAI,QAAQ,IAAI;AAChB,aAAK,MAAM;AACX,YAAI,QAAQ,IAAI;AAChB,aAAK,MAAM;AACX,YAAI,QAAQ,IAAI;AAChB,YAAI,KAAK,OAAO,SAAS,OAAO,EAAE,IAAI,OAAO,UAAU,CAAC;AACxD,YAAI,QAAQ,IAAI;AAChB,aAAK,MAAM;AACX,YAAI,QAAQ,IAAI;AAChB,aAAK,MAAM;AACX,YAAI,QAAQ,IAAI;AAChB,aAAK,MAAM;AACX,YAAI,QAAQ,IAAI;AAChB,eAAO;AAAA,MACT;AAEA,eAAS,eAAgB,KAAK,OAAO,QAAQ,KAAK,KAAK;AACrD,mBAAW,OAAO,KAAK,KAAK,KAAK,QAAQ,CAAC;AAE1C,YAAI,KAAK,OAAO,QAAQ,OAAO,UAAU,CAAC;AAC1C,YAAI,SAAS,CAAC,IAAI;AAClB,aAAK,MAAM;AACX,YAAI,SAAS,CAAC,IAAI;AAClB,aAAK,MAAM;AACX,YAAI,SAAS,CAAC,IAAI;AAClB,aAAK,MAAM;AACX,YAAI,SAAS,CAAC,IAAI;AAClB,YAAI,KAAK,OAAO,SAAS,OAAO,EAAE,IAAI,OAAO,UAAU,CAAC;AACxD,YAAI,SAAS,CAAC,IAAI;AAClB,aAAK,MAAM;AACX,YAAI,SAAS,CAAC,IAAI;AAClB,aAAK,MAAM;AACX,YAAI,SAAS,CAAC,IAAI;AAClB,aAAK,MAAM;AACX,YAAI,MAAM,IAAI;AACd,eAAO,SAAS;AAAA,MAClB;AAEA,MAAAA,QAAO,UAAU,mBAAmB,mBAAmB,SAAS,iBAAkB,OAAO,SAAS,GAAG;AACnG,eAAO,eAAe,MAAM,OAAO,QAAQ,OAAO,CAAC,GAAG,OAAO,oBAAoB,CAAC;AAAA,MACnF,CAAA;AAED,MAAAA,QAAO,UAAU,mBAAmB,mBAAmB,SAAS,iBAAkB,OAAO,SAAS,GAAG;AACnG,eAAO,eAAe,MAAM,OAAO,QAAQ,OAAO,CAAC,GAAG,OAAO,oBAAoB,CAAC;AAAA,MACnF,CAAA;AAED,MAAAA,QAAO,UAAU,aAAa,SAAS,WAAY,OAAO,QAAQC,aAAY,UAAU;AACtF,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,YAAI,CAAC,UAAU;AACb,gBAAM,QAAQ,KAAK,IAAI,GAAI,IAAIA,cAAc,CAAC;AAE9C,mBAAS,MAAM,OAAO,QAAQA,aAAY,QAAQ,GAAG,CAAC,KAAK;AAAA,QAC/D;AAEE,YAAI,IAAI;AACR,YAAI,MAAM;AACV,YAAI,MAAM;AACV,aAAK,MAAM,IAAI,QAAQ;AACvB,eAAO,EAAE,IAAIA,gBAAe,OAAO,MAAQ;AACzC,cAAI,QAAQ,KAAK,QAAQ,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,GAAG;AACxD,kBAAM;AAAA,UACZ;AACI,eAAK,SAAS,CAAC,KAAM,QAAQ,OAAQ,KAAK,MAAM;AAAA,QACpD;AAEE,eAAO,SAASA;AAAA,MAClB;AAEA,MAAAD,QAAO,UAAU,aAAa,SAAS,WAAY,OAAO,QAAQC,aAAY,UAAU;AACtF,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,YAAI,CAAC,UAAU;AACb,gBAAM,QAAQ,KAAK,IAAI,GAAI,IAAIA,cAAc,CAAC;AAE9C,mBAAS,MAAM,OAAO,QAAQA,aAAY,QAAQ,GAAG,CAAC,KAAK;AAAA,QAC/D;AAEE,YAAI,IAAIA,cAAa;AACrB,YAAI,MAAM;AACV,YAAI,MAAM;AACV,aAAK,SAAS,CAAC,IAAI,QAAQ;AAC3B,eAAO,EAAE,KAAK,MAAM,OAAO,MAAQ;AACjC,cAAI,QAAQ,KAAK,QAAQ,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,GAAG;AACxD,kBAAM;AAAA,UACZ;AACI,eAAK,SAAS,CAAC,KAAM,QAAQ,OAAQ,KAAK,MAAM;AAAA,QACpD;AAEE,eAAO,SAASA;AAAA,MAClB;AAEA,MAAAD,QAAO,UAAU,YAAY,SAAS,UAAW,OAAO,QAAQ,UAAU;AACxE,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,KAAM,IAAK;AAC3D,YAAI,QAAQ,EAAG,SAAQ,MAAO,QAAQ;AACtC,aAAK,MAAM,IAAK,QAAQ;AACxB,eAAO,SAAS;AAAA,MAClB;AAEA,MAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,MAAO;AAC/D,aAAK,MAAM,IAAK,QAAQ;AACxB,aAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,eAAO,SAAS;AAAA,MAClB;AAEA,MAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,MAAO;AAC/D,aAAK,MAAM,IAAK,UAAU;AAC1B,aAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,eAAO,SAAS;AAAA,MAClB;AAEA,MAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,WAAW;AACvE,aAAK,MAAM,IAAK,QAAQ;AACxB,aAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,eAAO,SAAS;AAAA,MAClB;AAEA,MAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,YAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,WAAW;AACvE,YAAI,QAAQ,EAAG,SAAQ,aAAa,QAAQ;AAC5C,aAAK,MAAM,IAAK,UAAU;AAC1B,aAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,eAAO,SAAS;AAAA,MAClB;AAEA,MAAAA,QAAO,UAAU,kBAAkB,mBAAmB,SAAS,gBAAiB,OAAO,SAAS,GAAG;AACjG,eAAO,eAAe,MAAM,OAAO,QAAQ,CAAC,OAAO,oBAAoB,GAAG,OAAO,oBAAoB,CAAC;AAAA,MACvG,CAAA;AAED,MAAAA,QAAO,UAAU,kBAAkB,mBAAmB,SAAS,gBAAiB,OAAO,SAAS,GAAG;AACjG,eAAO,eAAe,MAAM,OAAO,QAAQ,CAAC,OAAO,oBAAoB,GAAG,OAAO,oBAAoB,CAAC;AAAA,MACvG,CAAA;AAED,eAAS,aAAc,KAAK,OAAO,QAAQ,KAAK,KAAK,KAAK;AACxD,YAAI,SAAS,MAAM,IAAI,OAAQ,OAAM,IAAI,WAAW,oBAAoB;AACxE,YAAI,SAAS,EAAG,OAAM,IAAI,WAAW,oBAAoB;AAAA,MAC3D;AAEA,eAAS,WAAY,KAAK,OAAO,QAAQ,cAAc,UAAU;AAC/D,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,YAAI,CAAC,UAAU;AACb,uBAAa,KAAK,OAAO,QAAQ,CAAkD;AAAA,QACvF;AACE,QAAAD,SAAQ,MAAM,KAAK,OAAO,QAAQ,cAAc,IAAI,CAAC;AACrD,eAAO,SAAS;AAAA,MAClB;AAEA,MAAAC,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,eAAO,WAAW,MAAM,OAAO,QAAQ,MAAM,QAAQ;AAAA,MACvD;AAEA,MAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,eAAO,WAAW,MAAM,OAAO,QAAQ,OAAO,QAAQ;AAAA,MACxD;AAEA,eAAS,YAAa,KAAK,OAAO,QAAQ,cAAc,UAAU;AAChE,gBAAQ,CAAC;AACT,iBAAS,WAAW;AACpB,YAAI,CAAC,UAAU;AACb,uBAAa,KAAK,OAAO,QAAQ,CAAoD;AAAA,QACzF;AACE,QAAAD,SAAQ,MAAM,KAAK,OAAO,QAAQ,cAAc,IAAI,CAAC;AACrD,eAAO,SAAS;AAAA,MAClB;AAEA,MAAAC,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,eAAO,YAAY,MAAM,OAAO,QAAQ,MAAM,QAAQ;AAAA,MACxD;AAEA,MAAAA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,eAAO,YAAY,MAAM,OAAO,QAAQ,OAAO,QAAQ;AAAA,MACzD;AAGA,MAAAA,QAAO,UAAU,OAAO,SAAS,KAAM,QAAQ,aAAa,OAAO,KAAK;AACtE,YAAI,CAACA,QAAO,SAAS,MAAM,EAAG,OAAM,IAAI,UAAU,6BAA6B;AAC/E,YAAI,CAAC,MAAO,SAAQ;AACpB,YAAI,CAAC,OAAO,QAAQ,EAAG,OAAM,KAAK;AAClC,YAAI,eAAe,OAAO,OAAQ,eAAc,OAAO;AACvD,YAAI,CAAC,YAAa,eAAc;AAChC,YAAI,MAAM,KAAK,MAAM,MAAO,OAAM;AAGlC,YAAI,QAAQ,MAAO,QAAO;AAC1B,YAAI,OAAO,WAAW,KAAK,KAAK,WAAW,EAAG,QAAO;AAGrD,YAAI,cAAc,GAAG;AACnB,gBAAM,IAAI,WAAW,2BAA2B;AAAA,QACpD;AACE,YAAI,QAAQ,KAAK,SAAS,KAAK,OAAQ,OAAM,IAAI,WAAW,oBAAoB;AAChF,YAAI,MAAM,EAAG,OAAM,IAAI,WAAW,yBAAyB;AAG3D,YAAI,MAAM,KAAK,OAAQ,OAAM,KAAK;AAClC,YAAI,OAAO,SAAS,cAAc,MAAM,OAAO;AAC7C,gBAAM,OAAO,SAAS,cAAc;AAAA,QACxC;AAEE,cAAM,MAAM,MAAM;AAElB,YAAI,SAAS,UAAU,OAAO,WAAW,UAAU,eAAe,YAAY;AAE5E,eAAK,WAAW,aAAa,OAAO,GAAG;AAAA,QAC3C,OAAS;AACL,qBAAW,UAAU,IAAI;AAAA,YACvB;AAAA,YACA,KAAK,SAAS,OAAO,GAAG;AAAA,YACxB;AAAA,UACN;AAAA,QACA;AAEE,eAAO;AAAA,MACT;AAMA,MAAAA,QAAO,UAAU,OAAO,SAAS,KAAM,KAAK,OAAO,KAAK,UAAU;AAEhE,YAAI,OAAO,QAAQ,UAAU;AAC3B,cAAI,OAAO,UAAU,UAAU;AAC7B,uBAAW;AACX,oBAAQ;AACR,kBAAM,KAAK;AAAA,UACjB,WAAe,OAAO,QAAQ,UAAU;AAClC,uBAAW;AACX,kBAAM,KAAK;AAAA,UACjB;AACI,cAAI,aAAa,UAAa,OAAO,aAAa,UAAU;AAC1D,kBAAM,IAAI,UAAU,2BAA2B;AAAA,UACrD;AACI,cAAI,OAAO,aAAa,YAAY,CAACA,QAAO,WAAW,QAAQ,GAAG;AAChE,kBAAM,IAAI,UAAU,uBAAuB,QAAQ;AAAA,UACzD;AACI,cAAI,IAAI,WAAW,GAAG;AACpB,kBAAM,OAAO,IAAI,WAAW,CAAC;AAC7B,gBAAK,aAAa,UAAU,OAAO,OAC/B,aAAa,UAAU;AAEzB,oBAAM;AAAA,YACd;AAAA,UACA;AAAA,QACA,WAAa,OAAO,QAAQ,UAAU;AAClC,gBAAM,MAAM;AAAA,QAChB,WAAa,OAAO,QAAQ,WAAW;AACnC,gBAAM,OAAO,GAAG;AAAA,QACpB;AAGE,YAAI,QAAQ,KAAK,KAAK,SAAS,SAAS,KAAK,SAAS,KAAK;AACzD,gBAAM,IAAI,WAAW,oBAAoB;AAAA,QAC7C;AAEE,YAAI,OAAO,OAAO;AAChB,iBAAO;AAAA,QACX;AAEE,gBAAQ,UAAU;AAClB,cAAM,QAAQ,SAAY,KAAK,SAAS,QAAQ;AAEhD,YAAI,CAAC,IAAK,OAAM;AAEhB,YAAI;AACJ,YAAI,OAAO,QAAQ,UAAU;AAC3B,eAAK,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAC5B,iBAAK,CAAC,IAAI;AAAA,UAChB;AAAA,QACA,OAAS;AACL,gBAAM,QAAQA,QAAO,SAAS,GAAG,IAC7B,MACAA,QAAO,KAAK,KAAK,QAAQ;AAC7B,gBAAM,MAAM,MAAM;AAClB,cAAI,QAAQ,GAAG;AACb,kBAAM,IAAI,UAAU,gBAAgB,MAClC,mCAAmC;AAAA,UAC3C;AACI,eAAK,IAAI,GAAG,IAAI,MAAM,OAAO,EAAE,GAAG;AAChC,iBAAK,IAAI,KAAK,IAAI,MAAM,IAAI,GAAG;AAAA,UACrC;AAAA,QACA;AAEE,eAAO;AAAA,MACT;AAMA,YAAM,SAAS,CAAA;AACf,eAAS,EAAG,KAAK,YAAY,MAAM;AACjC,eAAO,GAAG,IAAI,MAAM,kBAAkB,KAAK;AAAA,UACzC,cAAe;AACb,kBAAK;AAEL,mBAAO,eAAe,MAAM,WAAW;AAAA,cACrC,OAAO,WAAW,MAAM,MAAM,SAAS;AAAA,cACvC,UAAU;AAAA,cACV,cAAc;AAAA,YACf,CAAA;AAGD,iBAAK,OAAO,GAAG,KAAK,IAAI,KAAK,GAAG;AAGhC,iBAAK;AAEL,mBAAO,KAAK;AAAA,UAClB;AAAA,UAEI,IAAI,OAAQ;AACV,mBAAO;AAAA,UACb;AAAA,UAEI,IAAI,KAAM,OAAO;AACf,mBAAO,eAAe,MAAM,QAAQ;AAAA,cAClC,cAAc;AAAA,cACd,YAAY;AAAA,cACZ;AAAA,cACA,UAAU;AAAA,YACX,CAAA;AAAA,UACP;AAAA,UAEI,WAAY;AACV,mBAAO,GAAG,KAAK,IAAI,KAAK,GAAG,MAAM,KAAK,OAAO;AAAA,UACnD;AAAA,QACA;AAAA,MACA;AAEA;AAAA,QAAE;AAAA,QACA,SAAU,MAAM;AACd,cAAI,MAAM;AACR,mBAAO,GAAG,IAAI;AAAA,UACpB;AAEI,iBAAO;AAAA,QACX;AAAA,QAAK;AAAA,MAAU;AACf;AAAA,QAAE;AAAA,QACA,SAAU,MAAM,QAAQ;AACtB,iBAAO,QAAQ,IAAI,oDAAoD,OAAO,MAAM;AAAA,QACxF;AAAA,QAAK;AAAA,MAAS;AACd;AAAA,QAAE;AAAA,QACA,SAAU,KAAK,OAAO,OAAO;AAC3B,cAAI,MAAM,iBAAiB,GAAG;AAC9B,cAAI,WAAW;AACf,cAAI,OAAO,UAAU,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI;AACxD,uBAAW,sBAAsB,OAAO,KAAK,CAAC;AAAA,UACpD,WAAe,OAAO,UAAU,UAAU;AACpC,uBAAW,OAAO,KAAK;AACvB,gBAAI,QAAQ,OAAO,CAAC,KAAK,OAAO,EAAE,KAAK,QAAQ,EAAE,OAAO,CAAC,KAAK,OAAO,EAAE,IAAI;AACzE,yBAAW,sBAAsB,QAAQ;AAAA,YACjD;AACM,wBAAY;AAAA,UAClB;AACI,iBAAO,eAAe,KAAK,cAAc,QAAQ;AACjD,iBAAO;AAAA,QACX;AAAA,QAAK;AAAA,MAAU;AAEf,eAAS,sBAAuB,KAAK;AACnC,YAAI,MAAM;AACV,YAAI,IAAI,IAAI;AACZ,cAAM,QAAQ,IAAI,CAAC,MAAM,MAAM,IAAI;AACnC,eAAO,KAAK,QAAQ,GAAG,KAAK,GAAG;AAC7B,gBAAM,IAAI,IAAI,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG;AAAA,QACvC;AACE,eAAO,GAAG,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG;AAAA,MACjC;AAKA,eAAS,YAAa,KAAK,QAAQC,aAAY;AAC7C,uBAAe,QAAQ,QAAQ;AAC/B,YAAI,IAAI,MAAM,MAAM,UAAa,IAAI,SAASA,WAAU,MAAM,QAAW;AACvE,sBAAY,QAAQ,IAAI,UAAUA,cAAa,EAAE;AAAA,QACrD;AAAA,MACA;AAEA,eAAS,WAAY,OAAO,KAAK,KAAK,KAAK,QAAQA,aAAY;AAC7D,YAAI,QAAQ,OAAO,QAAQ,KAAK;AAC9B,gBAAM,IAAI,OAAO,QAAQ,WAAW,MAAM;AAC1C,cAAI;AACgB;AAClB,gBAAI,QAAQ,KAAK,QAAQ,OAAO,CAAC,GAAG;AAClC,sBAAQ,OAAO,CAAC,WAAW,CAAC,QAAQA,cAAa,KAAK,CAAC,GAAG,CAAC;AAAA,YACnE,OAAa;AACL,sBAAQ,SAAS,CAAC,QAAQA,cAAa,KAAK,IAAI,CAAC,GAAG,CAAC,iBACzCA,cAAa,KAAK,IAAI,CAAC,GAAG,CAAC;AAAA,YAC/C;AAAA,UACA;AAGI,gBAAM,IAAI,OAAO,iBAAiB,SAAS,OAAO,KAAK;AAAA,QAC3D;AACE,oBAAY,KAAK,QAAQA,WAAU;AAAA,MACrC;AAEA,eAAS,eAAgB,OAAO,MAAM;AACpC,YAAI,OAAO,UAAU,UAAU;AAC7B,gBAAM,IAAI,OAAO,qBAAqB,MAAM,UAAU,KAAK;AAAA,QAC/D;AAAA,MACA;AAEA,eAAS,YAAa,OAAO,QAAQ,MAAM;AACzC,YAAI,KAAK,MAAM,KAAK,MAAM,OAAO;AAC/B,yBAAe,OAAO,IAAI;AAC1B,gBAAM,IAAI,OAAO,iBAAyB,UAAU,cAAc,KAAK;AAAA,QAC3E;AAEE,YAAI,SAAS,GAAG;AACd,gBAAM,IAAI,OAAO,yBAAwB;AAAA,QAC7C;AAEE,cAAM,IAAI,OAAO;AAAA,UAAyB;AAAA,UACR,MAAiB,CAAC,WAAW,MAAM;AAAA,UACnC;AAAA,QAAK;AAAA,MACzC;AAKA,YAAM,oBAAoB;AAE1B,eAAS,YAAa,KAAK;AAEzB,cAAM,IAAI,MAAM,GAAG,EAAE,CAAC;AAEtB,cAAM,IAAI,KAAM,EAAC,QAAQ,mBAAmB,EAAE;AAE9C,YAAI,IAAI,SAAS,EAAG,QAAO;AAE3B,eAAO,IAAI,SAAS,MAAM,GAAG;AAC3B,gBAAM,MAAM;AAAA,QAChB;AACE,eAAO;AAAA,MACT;AAEA,eAAS,YAAa,QAAQ,OAAO;AACnC,gBAAQ,SAAS;AACjB,YAAI;AACJ,cAAM,SAAS,OAAO;AACtB,YAAI,gBAAgB;AACpB,cAAM,QAAQ,CAAA;AAEd,iBAAS,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC/B,sBAAY,OAAO,WAAW,CAAC;AAG/B,cAAI,YAAY,SAAU,YAAY,OAAQ;AAE5C,gBAAI,CAAC,eAAe;AAElB,kBAAI,YAAY,OAAQ;AAEtB,qBAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAClD;AAAA,cACV,WAAmB,IAAI,MAAM,QAAQ;AAE3B,qBAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAClD;AAAA,cACV;AAGQ,8BAAgB;AAEhB;AAAA,YACR;AAGM,gBAAI,YAAY,OAAQ;AACtB,mBAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAClD,8BAAgB;AAChB;AAAA,YACR;AAGM,yBAAa,gBAAgB,SAAU,KAAK,YAAY,SAAU;AAAA,UACnE,WAAU,eAAe;AAExB,iBAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAAA,UACxD;AAEI,0BAAgB;AAGhB,cAAI,YAAY,KAAM;AACpB,iBAAK,SAAS,KAAK,EAAG;AACtB,kBAAM,KAAK,SAAS;AAAA,UAC1B,WAAe,YAAY,MAAO;AAC5B,iBAAK,SAAS,KAAK,EAAG;AACtB,kBAAM;AAAA,cACJ,aAAa,IAAM;AAAA,cACnB,YAAY,KAAO;AAAA,YAC3B;AAAA,UACA,WAAe,YAAY,OAAS;AAC9B,iBAAK,SAAS,KAAK,EAAG;AACtB,kBAAM;AAAA,cACJ,aAAa,KAAM;AAAA,cACnB,aAAa,IAAM,KAAO;AAAA,cAC1B,YAAY,KAAO;AAAA,YAC3B;AAAA,UACA,WAAe,YAAY,SAAU;AAC/B,iBAAK,SAAS,KAAK,EAAG;AACtB,kBAAM;AAAA,cACJ,aAAa,KAAO;AAAA,cACpB,aAAa,KAAM,KAAO;AAAA,cAC1B,aAAa,IAAM,KAAO;AAAA,cAC1B,YAAY,KAAO;AAAA,YAC3B;AAAA,UACA,OAAW;AACL,kBAAM,IAAI,MAAM,oBAAoB;AAAA,UAC1C;AAAA,QACA;AAEE,eAAO;AAAA,MACT;AAEA,eAAS,aAAc,KAAK;AAC1B,cAAM,YAAY,CAAA;AAClB,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AAEnC,oBAAU,KAAK,IAAI,WAAW,CAAC,IAAI,GAAI;AAAA,QAC3C;AACE,eAAO;AAAA,MACT;AAEA,eAAS,eAAgB,KAAK,OAAO;AACnC,YAAI,GAAG,IAAI;AACX,cAAM,YAAY,CAAA;AAClB,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AACnC,eAAK,SAAS,KAAK,EAAG;AAEtB,cAAI,IAAI,WAAW,CAAC;AACpB,eAAK,KAAK;AACV,eAAK,IAAI;AACT,oBAAU,KAAK,EAAE;AACjB,oBAAU,KAAK,EAAE;AAAA,QACrB;AAEE,eAAO;AAAA,MACT;AAEA,eAAS,cAAe,KAAK;AAC3B,eAAO,OAAO,YAAY,YAAY,GAAG,CAAC;AAAA,MAC5C;AAEA,eAAS,WAAY,KAAK,KAAK,QAAQ,QAAQ;AAC7C,YAAI;AACJ,aAAK,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC3B,cAAK,IAAI,UAAU,IAAI,UAAY,KAAK,IAAI,OAAS;AACrD,cAAI,IAAI,MAAM,IAAI,IAAI,CAAC;AAAA,QAC3B;AACE,eAAO;AAAA,MACT;AAKA,eAAS,WAAY,KAAK,MAAM;AAC9B,eAAO,eAAe,QACnB,OAAO,QAAQ,IAAI,eAAe,QAAQ,IAAI,YAAY,QAAQ,QACjE,IAAI,YAAY,SAAS,KAAK;AAAA,MACpC;AACA,eAAS,YAAa,KAAK;AAEzB,eAAO,QAAQ;AAAA,MACjB;AAIA,YAAM,sBAAuB,WAAY;AACvC,cAAM,WAAW;AACjB,cAAM,QAAQ,IAAI,MAAM,GAAG;AAC3B,iBAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC3B,gBAAM,MAAM,IAAI;AAChB,mBAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC3B,kBAAM,MAAM,CAAC,IAAI,SAAS,CAAC,IAAI,SAAS,CAAC;AAAA,UAC/C;AAAA,QACA;AACE,eAAO;AAAA,MACR,EAAA;AAGD,eAAS,mBAAoB,IAAI;AAC/B,eAAO,OAAO,WAAW,cAAc,yBAAyB;AAAA,MAClE;AAEA,eAAS,yBAA0B;AACjC,cAAM,IAAI,MAAM,sBAAsB;AAAA,MACxC;AAAA;;;;ACzjEe,MAAA,YAAA,CAAA;ACCA,MAAA,eAAA,MAAM,WAAW;AAAA,IAC5B,MAAM,sBAAsB,UAAU;AAClC,UAAI,OAAO,SAAS,WAAW,YAAY;AACvC,eAAO,SAAS,OAAQ;AAAA,MACpC,WACiB,OAAO,SAAS,gBAAgB,YAAY;AACjD,cAAM,OAAO,MAAM,SAAS,YAAa;AACzC,eAAOD,cAAM,OAAC,KAAK,IAAI;AAAA,MACnC,OACa;AACD,cAAM,IAAI,UAAU,+EAA+E;AAAA,MAC/G;AAAA,IACA;AAAA,IACI,YAAY,QAAQ,OAAO,IAAI;AAC3B,WAAK,gBAAgB,CAAE;AACvB,WAAK,MAAM;AACX,YAAM,QAAQ,KAAK,SAAS,WAAW,MAAM,KAAK,UAAU;AAC5D,UAAI,CAAC,OAAO;AACR,cAAM,IAAI,UAAU,kEAAkE;AAAA,MAClG;AACQ,UAAI,KAAK,WAAW;AAChB,aAAK,gBAAgB,KAAK;AAAA,MACtC;AACQ,WAAK,sBAAsB;AAAA,IACnC;AAAA,IACI,MAAM,MAAM,OAAOE,OAAM;AACrB,UAAI;AACJ,UAAI;AACA,mBAAW,MAAM,KAAK,oBAAoB,OAAOA,KAAI;AAAA,MACjE,SACe,GAAG;AACN,YAAI,GAAG,CAAC,GAAG,SAAS,iBAAiB,GAAG;AAKpC,kBAAQ,KAAK,kCAAkC,KAAK,2DAA2D;AAC/G,qBAAW,MAAM,KAAK,oBAAoB,OAAO;AAAA,YAC7C,GAAGA;AAAA,YACH,OAAO;AAAA,UAC3B,CAAiB;AAAA,QACjB,OACiB;AACD,gBAAM;AAAA,QACtB;AAAA,MACA;AACQ,aAAO;AAAA,IACf;AAAA,IACI,MAAM,KAAKJ,SAAQ,SAAS,GAAG,QAAQ,WAAW,GAAG,OAAO,IAAI;AAC5D,YAAM,EAAE,UAAU,CAAE,GAAE,QAAQ,YAAY,CAAE,EAAA,IAAK;AACjD,UAAI,SAAS,UAAU;AACnB,gBAAQ,QAAQ,SAAS,QAAQ,IAAI,WAAW,MAAM;AAAA,MAClE,WACiB,WAAW,YAAY,aAAa,GAAG;AAC5C,gBAAQ,QAAQ,SAAS,QAAQ;AAAA,MAC7C;AACQ,YAAM,OAAO;AAAA,QACT,GAAG,KAAK;AAAA,QACR,GAAG;AAAA,QACH,SAAS;AAAA,UACL,GAAG;AAAA,UACH,GAAG,UAAU;AAAA,UACb,GAAG,KAAK,cAAc;AAAA,QACzB;AAAA,QACD,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,MAAM;AAAA,QACN;AAAA,MACH;AACD,YAAM,WAAW,MAAM,KAAK,MAAM,KAAK,KAAK,IAAI;AAChD,UAAI,CAAC,SAAS,IAAI;AACd,cAAM,IAAI,MAAM,QAAQ,SAAS,MAAM,IAAI,SAAS,UAAU,IAAI,KAAK,GAAG,EAAE;AAAA,MACxF;AACQ,UAAK,SAAS,WAAW,OAAO,aAAa,KACzC,SAAS,WAAW,KAAK;AACzB,cAAM,eAAe,MAAM,KAAK,sBAAsB,QAAQ;AAC9D,cAAM,cAAc,aAAa,KAAKA,SAAQ,QAAQ,GAAG,KAAK,IAAI,QAAQ,aAAa,MAAM,CAAC;AAE9F,cAAM,MAAM,SAAS,QAAQ,IAAI,eAAe;AAChD,cAAM,YAAY,WAAW,KAAK,OAAO,EAAE;AAC3C,YAAI,aAAa,UAAU,CAAC,GAAG;AAC3B,eAAK,QAAQ,EAAE,MAAM,SAAS,UAAU,CAAC,GAAG,EAAE,EAAG;AAAA,QACjE;AACY,eAAO,EAAE,WAAW,aAAa,QAAAA,QAAQ;AAAA,MACrD;AACQ,UAAI,SAAS,WAAW,KAAK;AACzB,cAAM,IAAI,MAAM,qDAAqD;AAAA,MACjF;AAEQ,YAAM,IAAI,MAAM,QAAQ,SAAS,MAAM,aAAa,KAAK,GAAG,EAAE;AAAA,IACtE;AAAA,IACI,MAAM,SAAS,UAAU,IAAI;AACzB,UAAI;AACJ,UAAI;AACJ,UAAI,OAAO,YAAY,UAAU;AAC7B,mBAAW;AACX,eAAO,CAAE;AAAA,MACrB,OACa;AACD,mBAAW,QAAQ;AACnB,eAAO;AACP,eAAO,KAAK;AAAA,MACxB;AACQ,YAAM,EAAE,UAAU,CAAE,GAAE,QAAQ,YAAY,CAAE,EAAA,IAAK;AACjD,YAAM,OAAO;AAAA,QACT;AAAA,QACA,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,MAAM;AAAA,QACN;AAAA,QACA,GAAG,KAAK;AAAA,QACR,GAAG;AAAA,MACN;AACD,YAAM,WAAW,MAAM,KAAK,MAAM,KAAK,KAAK,IAAI;AAChD,UAAI,CAAC,UAAU;AACX,cAAM,IAAI,MAAM,oCAAoC;AAAA,MAChE;AACQ,UAAI,SAAS,WAAW,KAAK;AACzB,cAAM,OAAO,OAAO,IAAI,MAAM,QAAQ,SAAS,MAAM,aAAa,KAAK,GAAG,EAAE,GAAG;AAAA,UAC3E,QAAQ,SAAS;AAAA,QACjC,CAAa;AAAA,MACb;AACQ,UAAI,aAAa,QAAQ;AACrB,eAAO,SAAS,KAAM;AAAA,MAClC;AACQ,UAAI,UAAU;AACV,cAAM,IAAI,MAAM,yBAAyB,QAAQ,EAAE;AAAA,MAC/D;AACQ,aAAO,KAAK,sBAAsB,QAAQ;AAAA,IAClD;AAAA,IACI,MAAM,OAAO;AACT,UAAI,CAAC,KAAK,OAAO;AACb,cAAM,MAAME,cAAAA,OAAO,YAAY,EAAE;AACjC,cAAM,KAAK,KAAK,KAAK,GAAG,IAAI,CAAC;AAC7B,YAAI,CAAC,KAAK,OAAO;AACb,gBAAM,IAAI,MAAM,uCAAuC,KAAK,GAAG,EAAE;AAAA,QACjF;AAAA,MACA;AACQ,aAAO,KAAK;AAAA,IACpB;AAAA,IACI,MAAM,QAAQ;AACV;AAAA,IACR;AAAA,EACA;;;;;;;AC7IA,UAAI,WAAa,OAAO,eAAe,eACtB,OAAO,gBAAgB,eACvB,OAAO,eAAe;AAEvC,eAAS,KAAK,KAAK,KAAK;AACtB,eAAO,OAAO,UAAU,eAAe,KAAK,KAAK,GAAG;AAAA,MACtD;AAEA,cAAiB,SAAA,SAAU,KAAkC;AAC3D,YAAI,UAAU,MAAM,UAAU,MAAM,KAAK,WAAW,CAAC;AACrD,eAAO,QAAQ,QAAQ;AACrB,cAAI,SAAS,QAAQ,MAAO;AAC5B,cAAI,CAAC,QAAQ;AAAE;AAAA,UAAS;AAExB,cAAI,OAAO,WAAW,UAAU;AAC9B,kBAAM,IAAI,UAAU,SAAS,oBAAoB;AAAA,UACvD;AAEI,mBAAS,KAAK,QAAQ;AACpB,gBAAI,KAAK,QAAQ,CAAC,GAAG;AACnB,kBAAI,CAAC,IAAI,OAAO,CAAC;AAAA,YACzB;AAAA,UACA;AAAA,QACA;AAEE,eAAO;AAAA,MACR;AAID,cAAA,YAAoB,SAAU,KAAK,MAAM;AACvC,YAAI,IAAI,WAAW,MAAM;AAAE,iBAAO;AAAA,QAAI;AACtC,YAAI,IAAI,UAAU;AAAE,iBAAO,IAAI,SAAS,GAAG,IAAI;AAAA,QAAE;AACjD,YAAI,SAAS;AACb,eAAO;AAAA,MACR;AAGD,UAAI,UAAU;AAAA,QACZ,UAAU,SAAU,MAAM,KAAK,UAAU,KAAK,WAAW;AACvD,cAAI,IAAI,YAAY,KAAK,UAAU;AACjC,iBAAK,IAAI,IAAI,SAAS,UAAU,WAAW,GAAG,GAAG,SAAS;AAC1D;AAAA,UACN;AAEI,mBAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,iBAAK,YAAY,CAAC,IAAI,IAAI,WAAW,CAAC;AAAA,UAC5C;AAAA,QACG;AAAA;AAAA,QAED,eAAe,SAAU,QAAQ;AAC/B,cAAI,GAAG,GAAG,KAAK,KAAK,OAAO;AAG3B,gBAAM;AACN,eAAK,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;AACzC,mBAAO,OAAO,CAAC,EAAE;AAAA,UACvB;AAGI,mBAAS,IAAI,WAAW,GAAG;AAC3B,gBAAM;AACN,eAAK,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;AACzC,oBAAQ,OAAO,CAAC;AAChB,mBAAO,IAAI,OAAO,GAAG;AACrB,mBAAO,MAAM;AAAA,UACnB;AAEI,iBAAO;AAAA,QACX;AAAA,MACC;AAED,UAAI,YAAY;AAAA,QACd,UAAU,SAAU,MAAM,KAAK,UAAU,KAAK,WAAW;AACvD,mBAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,iBAAK,YAAY,CAAC,IAAI,IAAI,WAAW,CAAC;AAAA,UAC5C;AAAA,QACG;AAAA;AAAA,QAED,eAAe,SAAU,QAAQ;AAC/B,iBAAO,CAAE,EAAC,OAAO,MAAM,CAAA,GAAI,MAAM;AAAA,QACrC;AAAA,MACC;AAKD,cAAmB,WAAA,SAAU,IAAI;AAC/B,YAAI,IAAI;AACN,yBAAgB;AAChB,0BAAgB;AAChB,0BAAgB;AAChB,kBAAQ,OAAO,SAAS,OAAO;AAAA,QACnC,OAAS;AACL,yBAAgB;AAChB,0BAAgB;AAChB,0BAAgB;AAChB,kBAAQ,OAAO,SAAS,SAAS;AAAA,QACrC;AAAA,MACC;AAED,cAAQ,SAAS,QAAQ;AAAA;;;;;;;;;;ACjFzB,QAAI,QAAQnB,cAA0B;AAStC,QAAI,UAAwB;AAI5B,QAAI,WAAwB;AAC5B,QAAI,SAAwB;AAE5B,QAAI,YAAwB;AAK5B,aAAS,KAAK,KAAK;AAAE,UAAI,MAAM,IAAI;AAAQ,aAAO,EAAE,OAAO,GAAG;AAAE,YAAI,GAAG,IAAI;AAAA,MAAI;AAAA,IAAA;AAI/E,QAAI,eAAe;AACnB,QAAI,eAAe;AACnB,QAAI,YAAe;AAGnB,QAAI,YAAe;AACnB,QAAI,YAAe;AAQnB,QAAI,eAAgB;AAGpB,QAAI,WAAgB;AAGpB,QAAI,UAAgB,WAAW,IAAI;AAGnC,QAAI,UAAgB;AAGpB,QAAI,WAAgB;AAGpB,QAAI,YAAgB,IAAI,UAAU;AAGlC,QAAI,WAAgB;AAGpB,QAAI,WAAgB;AAQpB,QAAI,cAAc;AAGlB,QAAI,YAAc;AAGlB,QAAI,UAAc;AAGlB,QAAI,YAAc;AAGlB,QAAI,cAAc;AAIlB,QAAI;AAAA;AAAA,MACF,CAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,CAAC;AAAA;AAE5D,QAAI;AAAA;AAAA,MACF,CAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,EAAE;AAAA;AAEtE,QAAI;AAAA;AAAA,MACF,CAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,CAAC;AAAA;AAExC,QAAI,WACF,CAAC,IAAG,IAAG,IAAG,GAAE,GAAE,GAAE,GAAE,GAAE,IAAG,GAAE,IAAG,GAAE,IAAG,GAAE,IAAG,GAAE,IAAG,GAAE,EAAE;AAajD,QAAI,gBAAgB;AAGpB,QAAI,eAAgB,IAAI,OAAO,UAAU,KAAK,CAAC;AAC/C,SAAK,YAAY;AAOjB,QAAI,eAAgB,IAAI,MAAM,UAAU,CAAC;AACzC,SAAK,YAAY;AAKjB,QAAI,aAAgB,IAAI,MAAM,aAAa;AAC3C,SAAK,UAAU;AAMf,QAAI,eAAgB,IAAI,MAAM,YAAY,YAAY,CAAC;AACvD,SAAK,YAAY;AAGjB,QAAI,cAAgB,IAAI,MAAM,YAAY;AAC1C,SAAK,WAAW;AAGhB,QAAI,YAAgB,IAAI,MAAM,OAAO;AACrC,SAAK,SAAS;AAId,aAAS,eAAe,aAAa,YAAY,YAAY,OAAO,YAAY;AAE9E,WAAK,cAAe;AACpB,WAAK,aAAe;AACpB,WAAK,aAAe;AACpB,WAAK,QAAe;AACpB,WAAK,aAAe;AAGpB,WAAK,YAAe,eAAe,YAAY;AAAA,IACjD;AAGA,QAAI;AACJ,QAAI;AACJ,QAAI;AAGJ,aAAS,SAAS,UAAU,WAAW;AACrC,WAAK,WAAW;AAChB,WAAK,WAAW;AAChB,WAAK,YAAY;AAAA,IACnB;AAIA,aAAS,OAAO,MAAM;AACpB,aAAO,OAAO,MAAM,WAAW,IAAI,IAAI,WAAW,OAAO,SAAS,EAAE;AAAA,IACtE;AAOA,aAAS,UAAU,GAAG,GAAG;AAGvB,QAAE,YAAY,EAAE,SAAS,IAAK,IAAK;AACnC,QAAE,YAAY,EAAE,SAAS,IAAK,MAAM,IAAK;AAAA,IAC3C;AAOA,aAAS,UAAU,GAAG,OAAO,QAAQ;AACnC,UAAI,EAAE,WAAY,WAAW,QAAS;AACpC,UAAE,UAAW,SAAS,EAAE,WAAY;AACpC,kBAAU,GAAG,EAAE,MAAM;AACrB,UAAE,SAAS,SAAU,WAAW,EAAE;AAClC,UAAE,YAAY,SAAS;AAAA,MAC3B,OAAS;AACL,UAAE,UAAW,SAAS,EAAE,WAAY;AACpC,UAAE,YAAY;AAAA,MAClB;AAAA,IACA;AAGA,aAAS,UAAU,GAAG,GAAG,MAAM;AAC7B;AAAA,QAAU;AAAA,QAAG,KAAK,IAAI,CAAC;AAAA,QAAY,KAAK,IAAI,IAAI,CAAC;AAAA;AAAA,MAAU;AAAA,IAC7D;AAQA,aAAS,WAAW,MAAM,KAAK;AAC7B,UAAI,MAAM;AACV,SAAG;AACD,eAAO,OAAO;AACd,kBAAU;AACV,gBAAQ;AAAA,MACZ,SAAW,EAAE,MAAM;AACjB,aAAO,QAAQ;AAAA,IACjB;AAMA,aAAS,SAAS,GAAG;AACnB,UAAI,EAAE,aAAa,IAAI;AACrB,kBAAU,GAAG,EAAE,MAAM;AACrB,UAAE,SAAS;AACX,UAAE,WAAW;AAAA,MAEjB,WAAa,EAAE,YAAY,GAAG;AAC1B,UAAE,YAAY,EAAE,SAAS,IAAI,EAAE,SAAS;AACxC,UAAE,WAAW;AACb,UAAE,YAAY;AAAA,MAClB;AAAA,IACA;AAaA,aAAS,WAAW,GAAG,MAGvB;AACE,UAAI,OAAkB,KAAK;AAC3B,UAAI,WAAkB,KAAK;AAC3B,UAAI,QAAkB,KAAK,UAAU;AACrC,UAAI,YAAkB,KAAK,UAAU;AACrC,UAAI,QAAkB,KAAK,UAAU;AACrC,UAAI,OAAkB,KAAK,UAAU;AACrC,UAAI,aAAkB,KAAK,UAAU;AACrC,UAAI;AACJ,UAAI,GAAG;AACP,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,WAAW;AAEf,WAAK,OAAO,GAAG,QAAQ,UAAU,QAAQ;AACvC,UAAE,SAAS,IAAI,IAAI;AAAA,MACvB;AAKE,WAAK,EAAE,KAAK,EAAE,QAAQ,IAAI,IAAI,CAAC,IAAY;AAE3C,WAAK,IAAI,EAAE,WAAW,GAAG,IAAI,WAAW,KAAK;AAC3C,YAAI,EAAE,KAAK,CAAC;AACZ,eAAO,KAAK,KAAK,IAAI,IAAI,CAAC,IAAY,IAAI,CAAC,IAAY;AACvD,YAAI,OAAO,YAAY;AACrB,iBAAO;AACP;AAAA,QACN;AACI,aAAK,IAAI,IAAI,CAAC,IAAY;AAG1B,YAAI,IAAI,UAAU;AAAE;AAAA,QAAW;AAE/B,UAAE,SAAS,IAAI;AACf,gBAAQ;AACR,YAAI,KAAK,MAAM;AACb,kBAAQ,MAAM,IAAI,IAAI;AAAA,QAC5B;AACI,YAAI,KAAK,IAAI,CAAC;AACd,UAAE,WAAW,KAAK,OAAO;AACzB,YAAI,WAAW;AACb,YAAE,cAAc,KAAK,MAAM,IAAI,IAAI,CAAC,IAAY;AAAA,QACtD;AAAA,MACA;AACE,UAAI,aAAa,GAAG;AAAE;AAAA,MAAO;AAM7B,SAAG;AACD,eAAO,aAAa;AACpB,eAAO,EAAE,SAAS,IAAI,MAAM,GAAG;AAAE;AAAA,QAAO;AACxC,UAAE,SAAS,IAAI;AACf,UAAE,SAAS,OAAO,CAAC,KAAK;AACxB,UAAE,SAAS,UAAU;AAIrB,oBAAY;AAAA,MACb,SAAQ,WAAW;AAOpB,WAAK,OAAO,YAAY,SAAS,GAAG,QAAQ;AAC1C,YAAI,EAAE,SAAS,IAAI;AACnB,eAAO,MAAM,GAAG;AACd,cAAI,EAAE,KAAK,EAAE,CAAC;AACd,cAAI,IAAI,UAAU;AAAE;AAAA,UAAS;AAC7B,cAAI,KAAK,IAAI,IAAI,CAAC,MAAc,MAAM;AAEpC,cAAE,YAAY,OAAO,KAAK,IAAI,IAAI,CAAC,KAAa,KAAK,IAAI,CAAC;AAC1D,iBAAK,IAAI,IAAI,CAAC,IAAY;AAAA,UAClC;AACM;AAAA,QACN;AAAA,MACA;AAAA,IACA;AAWA,aAAS,UAAU,MAAM,UAAU,UAInC;AACE,UAAI,YAAY,IAAI,MAAM,WAAW,CAAC;AACtC,UAAI,OAAO;AACX,UAAI;AACJ,UAAI;AAKJ,WAAK,OAAO,GAAG,QAAQ,UAAU,QAAQ;AACvC,kBAAU,IAAI,IAAI,OAAQ,OAAO,SAAS,OAAO,CAAC,KAAM;AAAA,MAC5D;AAQE,WAAK,IAAI,GAAI,KAAK,UAAU,KAAK;AAC/B,YAAI,MAAM,KAAK,IAAI,IAAI,CAAC;AACxB,YAAI,QAAQ,GAAG;AAAE;AAAA,QAAS;AAE1B,aAAK,IAAI,CAAC,IAAa,WAAW,UAAU,GAAG,KAAK,GAAG;AAAA,MAI3D;AAAA,IACA;AAMA,aAAS,iBAAiB;AACxB,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,WAAW,IAAI,MAAM,WAAW,CAAC;AAgBrC,eAAS;AACT,WAAK,OAAO,GAAG,OAAO,eAAe,GAAG,QAAQ;AAC9C,oBAAY,IAAI,IAAI;AACpB,aAAK,IAAI,GAAG,IAAK,KAAK,YAAY,IAAI,GAAI,KAAK;AAC7C,uBAAa,QAAQ,IAAI;AAAA,QAC/B;AAAA,MACA;AAME,mBAAa,SAAS,CAAC,IAAI;AAG3B,aAAO;AACP,WAAK,OAAO,GAAG,OAAO,IAAI,QAAQ;AAChC,kBAAU,IAAI,IAAI;AAClB,aAAK,IAAI,GAAG,IAAK,KAAK,YAAY,IAAI,GAAI,KAAK;AAC7C,qBAAW,MAAM,IAAI;AAAA,QAC3B;AAAA,MACA;AAEE,eAAS;AACT,aAAO,OAAO,SAAS,QAAQ;AAC7B,kBAAU,IAAI,IAAI,QAAQ;AAC1B,aAAK,IAAI,GAAG,IAAK,KAAM,YAAY,IAAI,IAAI,GAAK,KAAK;AACnD,qBAAW,MAAM,MAAM,IAAI;AAAA,QACjC;AAAA,MACA;AAIE,WAAK,OAAO,GAAG,QAAQ,UAAU,QAAQ;AACvC,iBAAS,IAAI,IAAI;AAAA,MACrB;AAEE,UAAI;AACJ,aAAO,KAAK,KAAK;AACf,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC;AACA,iBAAS,CAAC;AAAA,MACd;AACE,aAAO,KAAK,KAAK;AACf,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC;AACA,iBAAS,CAAC;AAAA,MACd;AACE,aAAO,KAAK,KAAK;AACf,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC;AACA,iBAAS,CAAC;AAAA,MACd;AACE,aAAO,KAAK,KAAK;AACf,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC;AACA,iBAAS,CAAC;AAAA,MACd;AAKE,gBAAU,cAAc,UAAU,GAAG,QAAQ;AAG7C,WAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAC5B,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC,qBAAa,IAAI,CAAC,IAAa,WAAW,GAAG,CAAC;AAAA,MAClD;AAGE,sBAAgB,IAAI,eAAe,cAAc,aAAa,WAAW,GAAG,SAAS,QAAQ;AAC7F,sBAAgB,IAAI,eAAe,cAAc,aAAa,GAAY,SAAS,QAAQ;AAC3F,uBAAiB,IAAI,eAAe,IAAI,MAAM,CAAC,GAAG,cAAc,GAAW,UAAU,WAAW;AAAA,IAGlG;AAMA,aAAS,WAAW,GAAG;AACrB,UAAI;AAGJ,WAAK,IAAI,GAAG,IAAI,SAAU,KAAK;AAAE,UAAE,UAAU,IAAI,CAAC,IAAa;AAAA,MAAE;AACjE,WAAK,IAAI,GAAG,IAAI,SAAU,KAAK;AAAE,UAAE,UAAU,IAAI,CAAC,IAAa;AAAA,MAAE;AACjE,WAAK,IAAI,GAAG,IAAI,UAAU,KAAK;AAAE,UAAE,QAAQ,IAAI,CAAC,IAAa;AAAA,MAAE;AAE/D,QAAE,UAAU,YAAY,CAAC,IAAa;AACtC,QAAE,UAAU,EAAE,aAAa;AAC3B,QAAE,WAAW,EAAE,UAAU;AAAA,IAC3B;AAMA,aAAS,UAAU,GACnB;AACE,UAAI,EAAE,WAAW,GAAG;AAClB,kBAAU,GAAG,EAAE,MAAM;AAAA,MACzB,WAAa,EAAE,WAAW,GAAG;AAEzB,UAAE,YAAY,EAAE,SAAS,IAAI,EAAE;AAAA,MACnC;AACE,QAAE,SAAS;AACX,QAAE,WAAW;AAAA,IACf;AAMA,aAAS,WAAW,GAAG,KAAK,KAAK,QAKjC;AACE,gBAAU,CAAC;AAEC;AACV,kBAAU,GAAG,GAAG;AAChB,kBAAU,GAAG,CAAC,GAAG;AAAA,MACrB;AAIE,YAAM,SAAS,EAAE,aAAa,EAAE,QAAQ,KAAK,KAAK,EAAE,OAAO;AAC3D,QAAE,WAAW;AAAA,IACf;AAMA,aAAS,QAAQ,MAAM,GAAG,GAAG,OAAO;AAClC,UAAI,MAAM,IAAI;AACd,UAAI,MAAM,IAAI;AACd,aAAQ,KAAK,GAAG,IAAa,KAAK,GAAG,KAC7B,KAAK,GAAG,MAAe,KAAK,GAAG,KAAc,MAAM,CAAC,KAAK,MAAM,CAAC;AAAA,IAC1E;AAQA,aAAS,WAAW,GAAG,MAAM,GAI7B;AACE,UAAI,IAAI,EAAE,KAAK,CAAC;AAChB,UAAI,IAAI,KAAK;AACb,aAAO,KAAK,EAAE,UAAU;AAEtB,YAAI,IAAI,EAAE,YACR,QAAQ,MAAM,EAAE,KAAK,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,GAAG;AAClD;AAAA,QACN;AAEI,YAAI,QAAQ,MAAM,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,GAAG;AAAE;AAAA,QAAM;AAGlD,UAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;AACpB,YAAI;AAGJ,cAAM;AAAA,MACV;AACE,QAAE,KAAK,CAAC,IAAI;AAAA,IACd;AASA,aAAS,eAAe,GAAG,OAAO,OAIlC;AACE,UAAI;AACJ,UAAI;AACJ,UAAI,KAAK;AACT,UAAI;AACJ,UAAI;AAEJ,UAAI,EAAE,aAAa,GAAG;AACpB,WAAG;AACD,iBAAQ,EAAE,YAAY,EAAE,QAAQ,KAAK,CAAC,KAAK,IAAM,EAAE,YAAY,EAAE,QAAQ,KAAK,IAAI,CAAC;AACnF,eAAK,EAAE,YAAY,EAAE,QAAQ,EAAE;AAC/B;AAEA,cAAI,SAAS,GAAG;AACd,sBAAU,GAAG,IAAI,KAAK;AAAA,UAE9B,OAAa;AAEL,mBAAO,aAAa,EAAE;AACtB,sBAAU,GAAG,OAAO,WAAW,GAAG,KAAK;AACvC,oBAAQ,YAAY,IAAI;AACxB,gBAAI,UAAU,GAAG;AACf,oBAAM,YAAY,IAAI;AACtB,wBAAU,GAAG,IAAI,KAAK;AAAA,YAChC;AACQ;AACA,mBAAO,OAAO,IAAI;AAGlB,sBAAU,GAAG,MAAM,KAAK;AACxB,oBAAQ,YAAY,IAAI;AACxB,gBAAI,UAAU,GAAG;AACf,sBAAQ,UAAU,IAAI;AACtB,wBAAU,GAAG,MAAM,KAAK;AAAA,YAClC;AAAA,UACO;AAAA,QAMP,SAAa,KAAK,EAAE;AAAA,MACpB;AAEE,gBAAU,GAAG,WAAW,KAAK;AAAA,IAC/B;AAWA,aAAS,WAAW,GAAG,MAGvB;AACE,UAAI,OAAW,KAAK;AACpB,UAAI,QAAW,KAAK,UAAU;AAC9B,UAAI,YAAY,KAAK,UAAU;AAC/B,UAAI,QAAW,KAAK,UAAU;AAC9B,UAAI,GAAG;AACP,UAAI,WAAW;AACf,UAAI;AAMJ,QAAE,WAAW;AACb,QAAE,WAAW;AAEb,WAAK,IAAI,GAAG,IAAI,OAAO,KAAK;AAC1B,YAAI,KAAK,IAAI,CAAC,MAAe,GAAG;AAC9B,YAAE,KAAK,EAAE,EAAE,QAAQ,IAAI,WAAW;AAClC,YAAE,MAAM,CAAC,IAAI;AAAA,QAEnB,OAAW;AACL,eAAK,IAAI,IAAI,CAAC,IAAY;AAAA,QAChC;AAAA,MACA;AAOE,aAAO,EAAE,WAAW,GAAG;AACrB,eAAO,EAAE,KAAK,EAAE,EAAE,QAAQ,IAAK,WAAW,IAAI,EAAE,WAAW;AAC3D,aAAK,OAAO,CAAC,IAAa;AAC1B,UAAE,MAAM,IAAI,IAAI;AAChB,UAAE;AAEF,YAAI,WAAW;AACb,YAAE,cAAc,MAAM,OAAO,IAAI,CAAC;AAAA,QACxC;AAAA,MAEA;AACE,WAAK,WAAW;AAKhB,WAAK,IAAK,EAAE,YAAY,GAAc,KAAK,GAAG,KAAK;AAAE,mBAAW,GAAG,MAAM,CAAC;AAAA,MAAE;AAK5E,aAAO;AACP,SAAG;AAGD,YAAI,EAAE;AAAA,UAAK;AAAA;AAAA,QAAc;AACzB,UAAE;AAAA,UAAK;AAAA;AAAA,QAAc,IAAG,EAAE,KAAK,EAAE,UAAU;AAC3C;AAAA,UAAW;AAAA,UAAG;AAAA,UAAM;AAAA;AAAA,QAAc;AAGlC,YAAI,EAAE;AAAA,UAAK;AAAA;AAAA;AAEX,UAAE,KAAK,EAAE,EAAE,QAAQ,IAAI;AACvB,UAAE,KAAK,EAAE,EAAE,QAAQ,IAAI;AAGvB,aAAK,OAAO,CAAC,IAAa,KAAK,IAAI,CAAC,IAAa,KAAK,IAAI,CAAC;AAC3D,UAAE,MAAM,IAAI,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK;AACvE,aAAK,IAAI,IAAI,CAAC,IAAY,KAAK,IAAI,IAAI,CAAC,IAAY;AAGpD,UAAE;AAAA,UAAK;AAAA;AAAA,QAAc,IAAG;AACxB;AAAA,UAAW;AAAA,UAAG;AAAA,UAAM;AAAA;AAAA,QAAc;AAAA,MAEtC,SAAW,EAAE,YAAY;AAEvB,QAAE,KAAK,EAAE,EAAE,QAAQ,IAAI,EAAE;AAAA,QAAK;AAAA;AAAA,MAAc;AAK5C,iBAAW,GAAG,IAAI;AAGlB,gBAAU,MAAM,UAAU,EAAE,QAAQ;AAAA,IACtC;AAOA,aAAS,UAAU,GAAG,MAAM,UAI5B;AACE,UAAI;AACJ,UAAI,UAAU;AACd,UAAI;AAEJ,UAAI,UAAU,KAAK,IAAI,IAAI,CAAC;AAE5B,UAAI,QAAQ;AACZ,UAAI,YAAY;AAChB,UAAI,YAAY;AAEhB,UAAI,YAAY,GAAG;AACjB,oBAAY;AACZ,oBAAY;AAAA,MAChB;AACE,YAAM,WAAW,KAAK,IAAI,CAAC,IAAY;AAEvC,WAAK,IAAI,GAAG,KAAK,UAAU,KAAK;AAC9B,iBAAS;AACT,kBAAU,MAAM,IAAI,KAAK,IAAI,CAAC;AAE9B,YAAI,EAAE,QAAQ,aAAa,WAAW,SAAS;AAC7C;AAAA,QAEN,WAAe,QAAQ,WAAW;AAC5B,YAAE,QAAQ,SAAS,CAAC,KAAc;AAAA,QAExC,WAAe,WAAW,GAAG;AAEvB,cAAI,WAAW,SAAS;AAAE,cAAE,QAAQ,SAAS,CAAC;AAAA,UAAa;AAC3D,YAAE,QAAQ,UAAU,CAAC;AAAA,QAE3B,WAAe,SAAS,IAAI;AACtB,YAAE,QAAQ,YAAY,CAAC;AAAA,QAE7B,OAAW;AACL,YAAE,QAAQ,cAAc,CAAC;AAAA,QAC/B;AAEI,gBAAQ;AACR,kBAAU;AAEV,YAAI,YAAY,GAAG;AACjB,sBAAY;AACZ,sBAAY;AAAA,QAElB,WAAe,WAAW,SAAS;AAC7B,sBAAY;AACZ,sBAAY;AAAA,QAElB,OAAW;AACL,sBAAY;AACZ,sBAAY;AAAA,QAClB;AAAA,MACA;AAAA,IACA;AAOA,aAAS,UAAU,GAAG,MAAM,UAI5B;AACE,UAAI;AACJ,UAAI,UAAU;AACd,UAAI;AAEJ,UAAI,UAAU,KAAK,IAAI,IAAI,CAAC;AAE5B,UAAI,QAAQ;AACZ,UAAI,YAAY;AAChB,UAAI,YAAY;AAGhB,UAAI,YAAY,GAAG;AACjB,oBAAY;AACZ,oBAAY;AAAA,MAChB;AAEE,WAAK,IAAI,GAAG,KAAK,UAAU,KAAK;AAC9B,iBAAS;AACT,kBAAU,MAAM,IAAI,KAAK,IAAI,CAAC;AAE9B,YAAI,EAAE,QAAQ,aAAa,WAAW,SAAS;AAC7C;AAAA,QAEN,WAAe,QAAQ,WAAW;AAC5B,aAAG;AAAE,sBAAU,GAAG,QAAQ,EAAE,OAAO;AAAA,UAAE,SAAU,EAAE,UAAU;AAAA,QAEjE,WAAe,WAAW,GAAG;AACvB,cAAI,WAAW,SAAS;AACtB,sBAAU,GAAG,QAAQ,EAAE,OAAO;AAC9B;AAAA,UACR;AAEM,oBAAU,GAAG,SAAS,EAAE,OAAO;AAC/B,oBAAU,GAAG,QAAQ,GAAG,CAAC;AAAA,QAE/B,WAAe,SAAS,IAAI;AACtB,oBAAU,GAAG,WAAW,EAAE,OAAO;AACjC,oBAAU,GAAG,QAAQ,GAAG,CAAC;AAAA,QAE/B,OAAW;AACL,oBAAU,GAAG,aAAa,EAAE,OAAO;AACnC,oBAAU,GAAG,QAAQ,IAAI,CAAC;AAAA,QAChC;AAEI,gBAAQ;AACR,kBAAU;AACV,YAAI,YAAY,GAAG;AACjB,sBAAY;AACZ,sBAAY;AAAA,QAElB,WAAe,WAAW,SAAS;AAC7B,sBAAY;AACZ,sBAAY;AAAA,QAElB,OAAW;AACL,sBAAY;AACZ,sBAAY;AAAA,QAClB;AAAA,MACA;AAAA,IACA;AAOA,aAAS,cAAc,GAAG;AACxB,UAAI;AAGJ,gBAAU,GAAG,EAAE,WAAW,EAAE,OAAO,QAAQ;AAC3C,gBAAU,GAAG,EAAE,WAAW,EAAE,OAAO,QAAQ;AAG3C,iBAAW,GAAG,EAAE,OAAO;AASvB,WAAK,cAAc,WAAW,GAAG,eAAe,GAAG,eAAe;AAChE,YAAI,EAAE,QAAQ,SAAS,WAAW,IAAI,IAAI,CAAC,MAAc,GAAG;AAC1D;AAAA,QACN;AAAA,MACA;AAEE,QAAE,WAAW,KAAK,cAAc,KAAK,IAAI,IAAI;AAI7C,aAAO;AAAA,IACT;AAQA,aAAS,eAAe,GAAG,QAAQ,QAAQ,SAG3C;AACE,UAAI;AAMJ,gBAAU,GAAG,SAAS,KAAK,CAAC;AAC5B,gBAAU,GAAG,SAAS,GAAK,CAAC;AAC5B,gBAAU,GAAG,UAAU,GAAI,CAAC;AAC5B,WAAK,OAAO,GAAG,OAAO,SAAS,QAAQ;AAErC,kBAAU,GAAG,EAAE,QAAQ,SAAS,IAAI,IAAI,IAAI,CAAC,GAAW,CAAC;AAAA,MAC7D;AAGE,gBAAU,GAAG,EAAE,WAAW,SAAS,CAAC;AAGpC,gBAAU,GAAG,EAAE,WAAW,SAAS,CAAC;AAAA,IAEtC;AAgBA,aAAS,iBAAiB,GAAG;AAK3B,UAAI,aAAa;AACjB,UAAI;AAGJ,WAAK,IAAI,GAAG,KAAK,IAAI,KAAK,gBAAgB,GAAG;AAC3C,YAAK,aAAa,KAAO,EAAE,UAAU,IAAI,CAAC,MAAe,GAAI;AAC3D,iBAAO;AAAA,QACb;AAAA,MACA;AAGE,UAAI,EAAE,UAAU,IAAI,CAAC,MAAe,KAAK,EAAE,UAAU,KAAK,CAAC,MAAe,KACtE,EAAE,UAAU,KAAK,CAAC,MAAe,GAAG;AACtC,eAAO;AAAA,MACX;AACE,WAAK,IAAI,IAAI,IAAI,UAAU,KAAK;AAC9B,YAAI,EAAE,UAAU,IAAI,CAAC,MAAe,GAAG;AACrC,iBAAO;AAAA,QACb;AAAA,MACA;AAKE,aAAO;AAAA,IACT;AAGA,QAAI,mBAAmB;AAKvB,aAAS,SAAS,GAClB;AAEE,UAAI,CAAC,kBAAkB;AACrB,uBAAgB;AAChB,2BAAmB;AAAA,MACvB;AAEE,QAAE,SAAU,IAAI,SAAS,EAAE,WAAW,aAAa;AACnD,QAAE,SAAU,IAAI,SAAS,EAAE,WAAW,aAAa;AACnD,QAAE,UAAU,IAAI,SAAS,EAAE,SAAS,cAAc;AAElD,QAAE,SAAS;AACX,QAAE,WAAW;AAGb,iBAAW,CAAC;AAAA,IACd;AAMA,aAAS,iBAAiB,GAAG,KAAK,YAAY,MAK9C;AACE,gBAAU,IAAI,gBAAgB,MAAM,OAAO,IAAI,IAAI,CAAC;AACpD,iBAAW,GAAG,KAAK,UAAgB;AAAA,IACrC;AAOA,aAAS,UAAU,GAAG;AACpB,gBAAU,GAAG,gBAAgB,GAAG,CAAC;AACjC,gBAAU,GAAG,WAAW,YAAY;AACpC,eAAS,CAAC;AAAA,IACZ;AAOA,aAAS,gBAAgB,GAAG,KAAK,YAAY,MAK7C;AACE,UAAI,UAAU;AACd,UAAI,cAAc;AAGlB,UAAI,EAAE,QAAQ,GAAG;AAGf,YAAI,EAAE,KAAK,cAAc,WAAW;AAClC,YAAE,KAAK,YAAY,iBAAiB,CAAC;AAAA,QAC3C;AAGI,mBAAW,GAAG,EAAE,MAAM;AAItB,mBAAW,GAAG,EAAE,MAAM;AAUtB,sBAAc,cAAc,CAAC;AAG7B,mBAAY,EAAE,UAAU,IAAI,MAAO;AACnC,sBAAe,EAAE,aAAa,IAAI,MAAO;AAMzC,YAAI,eAAe,UAAU;AAAE,qBAAW;AAAA,QAAY;AAAA,MAE1D,OAAS;AAEL,mBAAW,cAAc,aAAa;AAAA,MAC1C;AAEE,UAAK,aAAa,KAAK,YAAc,QAAQ,IAAK;AAShD,yBAAiB,GAAG,KAAK,YAAY,IAAI;AAAA,MAE1C,WAAU,EAAE,aAAa,WAAW,gBAAgB,UAAU;AAE7D,kBAAU,IAAI,gBAAgB,MAAM,OAAO,IAAI,IAAI,CAAC;AACpD,uBAAe,GAAG,cAAc,YAAY;AAAA,MAEhD,OAAS;AACL,kBAAU,IAAI,aAAa,MAAM,OAAO,IAAI,IAAI,CAAC;AACjD,uBAAe,GAAG,EAAE,OAAO,WAAW,GAAG,EAAE,OAAO,WAAW,GAAG,cAAc,CAAC;AAC/E,uBAAe,GAAG,EAAE,WAAW,EAAE,SAAS;AAAA,MAC9C;AAKE,iBAAW,CAAC;AAEZ,UAAI,MAAM;AACR,kBAAU,CAAC;AAAA,MACf;AAAA,IAGA;AAMA,aAAS,UAAU,GAAG,MAAM,IAI5B;AAGE,QAAE,YAAY,EAAE,QAAQ,EAAE,WAAW,CAAC,IAAS,SAAS,IAAK;AAC7D,QAAE,YAAY,EAAE,QAAQ,EAAE,WAAW,IAAI,CAAC,IAAI,OAAO;AAErD,QAAE,YAAY,EAAE,QAAQ,EAAE,QAAQ,IAAI,KAAK;AAC3C,QAAE;AAEF,UAAI,SAAS,GAAG;AAEd,UAAE,UAAU,KAAK,CAAC;AAAA,MACtB,OAAS;AACL,UAAE;AAEF;AAKA,UAAE,WAAW,aAAa,EAAE,IAAI,WAAW,KAAK,CAAC;AACjD,UAAE,UAAU,OAAO,IAAI,IAAI,CAAC;AAAA,MAChC;AAyBE,aAAQ,EAAE,aAAa,EAAE,cAAc;AAAA,IAKzC;AAEA,UAAA,WAAoB;AACpB,UAAA,mBAA2B;AAC3B,UAAA,kBAA2B;AAC3B,UAAA,YAAoB;AACpB,UAAA,YAAoB;;;;;;;;AC5qCpB,aAAS,QAAQ,OAAO,KAAK,KAAK,KAAK;AACrC,UAAI,KAAM,QAAQ,QAAS,GACvB,KAAO,UAAU,KAAM,QAAS,GAChC,IAAI;AAER,aAAO,QAAQ,GAAG;AAIhB,YAAI,MAAM,MAAO,MAAO;AACxB,eAAO;AAEP,WAAG;AACD,eAAM,KAAK,IAAI,KAAK,IAAI;AACxB,eAAM,KAAK,KAAK;AAAA,QACjB,SAAQ,EAAE;AAEX,cAAM;AACN,cAAM;AAAA,MACV;AAEE,aAAQ,KAAM,MAAM,KAAM;AAAA,IAC5B;AAGA,gBAAiB;;;;;;;;ACxBjB,aAAS,YAAY;AACnB,UAAI,GAAG,QAAQ,CAAE;AAEjB,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,YAAI;AACJ,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAM,IAAI,IAAM,aAAc,MAAM,IAAO,MAAM;AAAA,QACvD;AACI,cAAM,CAAC,IAAI;AAAA,MACf;AAEE,aAAO;AAAA,IACT;AAGA,QAAI,WAAW,UAAW;AAG1B,aAASsB,OAAM,KAAK,KAAK,KAAK,KAAK;AACjC,UAAI,IAAI,UACJ,MAAM,MAAM;AAEhB,aAAO;AAEP,eAAS,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9B,cAAO,QAAQ,IAAK,GAAG,MAAM,IAAI,CAAC,KAAK,GAAI;AAAA,MAC/C;AAEE,aAAQ,MAAO;AAAA,IACjB;AAGA,cAAiBA;;;;;;;;ACrCjB,eAAiB;AAAA,MACf,GAAQ;AAAA;AAAA,MACR,GAAQ;AAAA;AAAA,MACR,GAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,IACT;;;;;;;ACVD,QAAI,QAAUtB,cAA0B;AACxC,QAAIuB,SAAUjB,aAAkB;AAChC,QAAI,UAAUC,eAAoB;AAClC,QAAIe,SAAUd,aAAkB;AAChC,QAAI,MAAUgB,gBAAqB;AAOnC,QAAI,aAAkB;AACtB,QAAI,kBAAkB;AAEtB,QAAI,eAAkB;AACtB,QAAI,WAAkB;AACtB,QAAI,UAAkB;AAOtB,QAAI,OAAkB;AACtB,QAAI,eAAkB;AAGtB,QAAI,iBAAkB;AACtB,QAAI,eAAkB;AAEtB,QAAI,cAAkB;AAQtB,QAAI,wBAAwB;AAG5B,QAAI,aAAwB;AAC5B,QAAI,iBAAwB;AAC5B,QAAI,QAAwB;AAC5B,QAAI,UAAwB;AAC5B,QAAI,qBAAwB;AAM5B,QAAI,YAAwB;AAI5B,QAAI,aAAc;AAKlB,QAAI,gBAAgB;AAEpB,QAAI,YAAY;AAEhB,QAAI,gBAAgB;AAGpB,QAAI,eAAgB;AAEpB,QAAI,WAAgB;AAEpB,QAAI,UAAgB,WAAW,IAAI;AAEnC,QAAI,UAAgB;AAEpB,QAAI,WAAgB;AAEpB,QAAI,YAAgB,IAAI,UAAU;AAElC,QAAI,WAAY;AAGhB,QAAI,YAAY;AAChB,QAAI,YAAY;AAChB,QAAI,gBAAiB,YAAY,YAAY;AAE7C,QAAI,cAAc;AAElB,QAAI,aAAa;AACjB,QAAI,cAAc;AAClB,QAAI,aAAa;AACjB,QAAI,gBAAgB;AACpB,QAAI,aAAa;AACjB,QAAI,aAAa;AACjB,QAAI,eAAe;AAEnB,QAAI,eAAoB;AACxB,QAAI,gBAAoB;AACxB,QAAI,oBAAoB;AACxB,QAAI,iBAAoB;AAExB,QAAI,UAAU;AAEd,aAAS,IAAI,MAAM,WAAW;AAC5B,WAAK,MAAM,IAAI,SAAS;AACxB,aAAO;AAAA,IACT;AAEA,aAAS,KAAK,GAAG;AACf,cAAS,KAAM,MAAO,IAAK,IAAI,IAAI;AAAA,IACrC;AAEA,aAAS,KAAK,KAAK;AAAE,UAAI,MAAM,IAAI;AAAQ,aAAO,EAAE,OAAO,GAAG;AAAE,YAAI,GAAG,IAAI;AAAA,MAAI;AAAA,IAAA;AAS/E,aAAS,cAAc,MAAM;AAC3B,UAAI,IAAI,KAAK;AAGb,UAAI,MAAM,EAAE;AACZ,UAAI,MAAM,KAAK,WAAW;AACxB,cAAM,KAAK;AAAA,MACf;AACE,UAAI,QAAQ,GAAG;AAAE;AAAA,MAAO;AAExB,YAAM,SAAS,KAAK,QAAQ,EAAE,aAAa,EAAE,aAAa,KAAK,KAAK,QAAQ;AAC5E,WAAK,YAAY;AACjB,QAAE,eAAe;AACjB,WAAK,aAAa;AAClB,WAAK,aAAa;AAClB,QAAE,WAAW;AACb,UAAI,EAAE,YAAY,GAAG;AACnB,UAAE,cAAc;AAAA,MACpB;AAAA,IACA;AAGA,aAAS,iBAAiB,GAAG,MAAM;AACjC,MAAAD,OAAM,gBAAgB,GAAI,EAAE,eAAe,IAAI,EAAE,cAAc,IAAK,EAAE,WAAW,EAAE,aAAa,IAAI;AACpG,QAAE,cAAc,EAAE;AAClB,oBAAc,EAAE,IAAI;AAAA,IACtB;AAGA,aAAS,SAAS,GAAG,GAAG;AACtB,QAAE,YAAY,EAAE,SAAS,IAAI;AAAA,IAC/B;AAQA,aAAS,YAAY,GAAG,GAAG;AAGzB,QAAE,YAAY,EAAE,SAAS,IAAK,MAAM,IAAK;AACzC,QAAE,YAAY,EAAE,SAAS,IAAI,IAAI;AAAA,IACnC;AAUA,aAAS,SAAS,MAAM,KAAK,OAAO,MAAM;AACxC,UAAI,MAAM,KAAK;AAEf,UAAI,MAAM,MAAM;AAAE,cAAM;AAAA,MAAK;AAC7B,UAAI,QAAQ,GAAG;AAAE,eAAO;AAAA,MAAE;AAE1B,WAAK,YAAY;AAGjB,YAAM,SAAS,KAAK,KAAK,OAAO,KAAK,SAAS,KAAK,KAAK;AACxD,UAAI,KAAK,MAAM,SAAS,GAAG;AACzB,aAAK,QAAQ,QAAQ,KAAK,OAAO,KAAK,KAAK,KAAK;AAAA,MACpD,WAEW,KAAK,MAAM,SAAS,GAAG;AAC9B,aAAK,QAAQD,OAAM,KAAK,OAAO,KAAK,KAAK,KAAK;AAAA,MAClD;AAEE,WAAK,WAAW;AAChB,WAAK,YAAY;AAEjB,aAAO;AAAA,IACT;AAYA,aAAS,cAAc,GAAG,WAAW;AACnC,UAAI,eAAe,EAAE;AACrB,UAAI,OAAO,EAAE;AACb,UAAI;AACJ,UAAI;AACJ,UAAI,WAAW,EAAE;AACjB,UAAI,aAAa,EAAE;AACnB,UAAI,QAAS,EAAE,WAAY,EAAE,SAAS,gBAClC,EAAE,YAAY,EAAE,SAAS,iBAAiB;AAE9C,UAAI,OAAO,EAAE;AAEb,UAAI,QAAQ,EAAE;AACd,UAAI,OAAQ,EAAE;AAMd,UAAI,SAAS,EAAE,WAAW;AAC1B,UAAI,YAAa,KAAK,OAAO,WAAW,CAAC;AACzC,UAAI,WAAa,KAAK,OAAO,QAAQ;AAQrC,UAAI,EAAE,eAAe,EAAE,YAAY;AACjC,yBAAiB;AAAA,MACrB;AAIE,UAAI,aAAa,EAAE,WAAW;AAAE,qBAAa,EAAE;AAAA,MAAU;AAIzD,SAAG;AAED,gBAAQ;AAWR,YAAI,KAAK,QAAQ,QAAQ,MAAU,YAC/B,KAAK,QAAQ,WAAW,CAAC,MAAM,aAC/B,KAAK,KAAK,MAAqB,KAAK,IAAI,KACxC,KAAK,EAAE,KAAK,MAAmB,KAAK,OAAO,CAAC,GAAG;AACjD;AAAA,QACN;AAQI,gBAAQ;AACR;AAMA,WAAG;AAAA,QAEF,SAAQ,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAAK,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAC/D,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAAK,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAC/D,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAAK,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAC/D,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAAK,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAC/D,OAAO;AAIhB,cAAM,aAAa,SAAS;AAC5B,eAAO,SAAS;AAEhB,YAAI,MAAM,UAAU;AAClB,YAAE,cAAc;AAChB,qBAAW;AACX,cAAI,OAAO,YAAY;AACrB;AAAA,UACR;AACM,sBAAa,KAAK,OAAO,WAAW,CAAC;AACrC,qBAAa,KAAK,OAAO,QAAQ;AAAA,QACvC;AAAA,MACA,UAAY,YAAY,KAAK,YAAY,KAAK,KAAK,SAAS,EAAE,iBAAiB;AAE7E,UAAI,YAAY,EAAE,WAAW;AAC3B,eAAO;AAAA,MACX;AACE,aAAO,EAAE;AAAA,IACX;AAaA,aAAS,YAAY,GAAG;AACtB,UAAI,UAAU,EAAE;AAChB,UAAI,GAAG,GAAG,GAAG,MAAM;AAInB,SAAG;AACD,eAAO,EAAE,cAAc,EAAE,YAAY,EAAE;AAoBvC,YAAI,EAAE,YAAY,WAAW,UAAU,gBAAgB;AAErD,gBAAM,SAAS,EAAE,QAAQ,EAAE,QAAQ,SAAS,SAAS,CAAC;AACtD,YAAE,eAAe;AACjB,YAAE,YAAY;AAEd,YAAE,eAAe;AASjB,cAAI,EAAE;AACN,cAAI;AACJ,aAAG;AACD,gBAAI,EAAE,KAAK,EAAE,CAAC;AACd,cAAE,KAAK,CAAC,IAAK,KAAK,UAAU,IAAI,UAAU;AAAA,UAC3C,SAAQ,EAAE;AAEX,cAAI;AACJ,cAAI;AACJ,aAAG;AACD,gBAAI,EAAE,KAAK,EAAE,CAAC;AACd,cAAE,KAAK,CAAC,IAAK,KAAK,UAAU,IAAI,UAAU;AAAA,UAI3C,SAAQ,EAAE;AAEX,kBAAQ;AAAA,QACd;AACI,YAAI,EAAE,KAAK,aAAa,GAAG;AACzB;AAAA,QACN;AAcI,YAAI,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,IAAI;AAC7D,UAAE,aAAa;AAGf,YAAI,EAAE,YAAY,EAAE,UAAU,WAAW;AACvC,gBAAM,EAAE,WAAW,EAAE;AACrB,YAAE,QAAQ,EAAE,OAAO,GAAG;AAGtB,YAAE,SAAU,EAAE,SAAS,EAAE,aAAc,EAAE,OAAO,MAAM,CAAC,KAAK,EAAE;AAI9D,iBAAO,EAAE,QAAQ;AAEf,cAAE,SAAU,EAAE,SAAS,EAAE,aAAc,EAAE,OAAO,MAAM,YAAY,CAAC,KAAK,EAAE;AAE1E,cAAE,KAAK,MAAM,EAAE,MAAM,IAAI,EAAE,KAAK,EAAE,KAAK;AACvC,cAAE,KAAK,EAAE,KAAK,IAAI;AAClB;AACA,cAAE;AACF,gBAAI,EAAE,YAAY,EAAE,SAAS,WAAW;AACtC;AAAA,YACV;AAAA,UACA;AAAA,QACA;AAAA,MAKA,SAAW,EAAE,YAAY,iBAAiB,EAAE,KAAK,aAAa;AAAA,IAsC9D;AAWA,aAAS,eAAe,GAAG,OAAO;AAIhC,UAAI,iBAAiB;AAErB,UAAI,iBAAiB,EAAE,mBAAmB,GAAG;AAC3C,yBAAiB,EAAE,mBAAmB;AAAA,MAC1C;AAGE,iBAAS;AAEP,YAAI,EAAE,aAAa,GAAG;AASpB,sBAAY,CAAC;AACb,cAAI,EAAE,cAAc,KAAK,UAAU,YAAY;AAC7C,mBAAO;AAAA,UACf;AAEM,cAAI,EAAE,cAAc,GAAG;AACrB;AAAA,UACR;AAAA,QAEA;AAII,UAAE,YAAY,EAAE;AAChB,UAAE,YAAY;AAGd,YAAI,YAAY,EAAE,cAAc;AAEhC,YAAI,EAAE,aAAa,KAAK,EAAE,YAAY,WAAW;AAE/C,YAAE,YAAY,EAAE,WAAW;AAC3B,YAAE,WAAW;AAEb,2BAAiB,GAAG,KAAK;AACzB,cAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,mBAAO;AAAA,UACf;AAAA,QAIA;AAII,YAAI,EAAE,WAAW,EAAE,eAAgB,EAAE,SAAS,eAAgB;AAE5D,2BAAiB,GAAG,KAAK;AACzB,cAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,mBAAO;AAAA,UACf;AAAA,QAEA;AAAA,MACA;AAEE,QAAE,SAAS;AAEX,UAAI,UAAU,UAAU;AAEtB,yBAAiB,GAAG,IAAI;AACxB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACb;AAEI,eAAO;AAAA,MACX;AAEE,UAAI,EAAE,WAAW,EAAE,aAAa;AAE9B,yBAAiB,GAAG,KAAK;AACzB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACb;AAAA,MAEA;AAEE,aAAO;AAAA,IACT;AASA,aAAS,aAAa,GAAG,OAAO;AAC9B,UAAI;AACJ,UAAI;AAEJ,iBAAS;AAMP,YAAI,EAAE,YAAY,eAAe;AAC/B,sBAAY,CAAC;AACb,cAAI,EAAE,YAAY,iBAAiB,UAAU,YAAY;AACvD,mBAAO;AAAA,UACf;AACM,cAAI,EAAE,cAAc,GAAG;AACrB;AAAA,UACR;AAAA,QACA;AAKI,oBAAY;AACZ,YAAI,EAAE,aAAa,WAAW;AAE5B,YAAE,SAAU,EAAE,SAAS,EAAE,aAAc,EAAE,OAAO,EAAE,WAAW,YAAY,CAAC,KAAK,EAAE;AACjF,sBAAY,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,IAAI,EAAE,KAAK,EAAE,KAAK;AAC1D,YAAE,KAAK,EAAE,KAAK,IAAI,EAAE;AAAA,QAE1B;AAKI,YAAI,cAAc,KAAc,EAAE,WAAW,aAAe,EAAE,SAAS,eAAiB;AAKtF,YAAE,eAAe,cAAc,GAAG,SAAS;AAAA,QAEjD;AACI,YAAI,EAAE,gBAAgB,WAAW;AAK/B,mBAASC,OAAM,UAAU,GAAG,EAAE,WAAW,EAAE,aAAa,EAAE,eAAe,SAAS;AAElF,YAAE,aAAa,EAAE;AAKjB,cAAI,EAAE,gBAAgB,EAAE,kBAAuC,EAAE,aAAa,WAAW;AACvF,cAAE;AACF,eAAG;AACD,gBAAE;AAEF,gBAAE,SAAU,EAAE,SAAS,EAAE,aAAc,EAAE,OAAO,EAAE,WAAW,YAAY,CAAC,KAAK,EAAE;AACjF,0BAAY,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,IAAI,EAAE,KAAK,EAAE,KAAK;AAC1D,gBAAE,KAAK,EAAE,KAAK,IAAI,EAAE;AAAA,YAK9B,SAAiB,EAAE,EAAE,iBAAiB;AAC9B,cAAE;AAAA,UACH,OACD;AACE,cAAE,YAAY,EAAE;AAChB,cAAE,eAAe;AACjB,cAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ;AAE7B,cAAE,SAAU,EAAE,SAAS,EAAE,aAAc,EAAE,OAAO,EAAE,WAAW,CAAC,KAAK,EAAE;AAAA,UAQ7E;AAAA,QACA,OAAW;AAIL,mBAASA,OAAM,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,QAAQ,CAAC;AAEnD,YAAE;AACF,YAAE;AAAA,QACR;AACI,YAAI,QAAQ;AAEV,2BAAiB,GAAG,KAAK;AACzB,cAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,mBAAO;AAAA,UACf;AAAA,QAEA;AAAA,MACA;AACE,QAAE,SAAW,EAAE,WAAY,YAAY,IAAM,EAAE,WAAW,YAAY;AACtE,UAAI,UAAU,UAAU;AAEtB,yBAAiB,GAAG,IAAI;AACxB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACb;AAEI,eAAO;AAAA,MACX;AACE,UAAI,EAAE,UAAU;AAEd,yBAAiB,GAAG,KAAK;AACzB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACb;AAAA,MAEA;AACE,aAAO;AAAA,IACT;AAOA,aAAS,aAAa,GAAG,OAAO;AAC9B,UAAI;AACJ,UAAI;AAEJ,UAAI;AAGJ,iBAAS;AAMP,YAAI,EAAE,YAAY,eAAe;AAC/B,sBAAY,CAAC;AACb,cAAI,EAAE,YAAY,iBAAiB,UAAU,YAAY;AACvD,mBAAO;AAAA,UACf;AACM,cAAI,EAAE,cAAc,GAAG;AAAE;AAAA,UAAQ;AAAA,QACvC;AAKI,oBAAY;AACZ,YAAI,EAAE,aAAa,WAAW;AAE5B,YAAE,SAAU,EAAE,SAAS,EAAE,aAAc,EAAE,OAAO,EAAE,WAAW,YAAY,CAAC,KAAK,EAAE;AACjF,sBAAY,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,IAAI,EAAE,KAAK,EAAE,KAAK;AAC1D,YAAE,KAAK,EAAE,KAAK,IAAI,EAAE;AAAA,QAE1B;AAII,UAAE,cAAc,EAAE;AAClB,UAAE,aAAa,EAAE;AACjB,UAAE,eAAe,YAAY;AAE7B,YAAI,cAAc,KAAY,EAAE,cAAc,EAAE,kBAC5C,EAAE,WAAW,aAAc,EAAE,SAAS,eAA+B;AAKvE,YAAE,eAAe,cAAc,GAAG,SAAS;AAG3C,cAAI,EAAE,gBAAgB,MAClB,EAAE,aAAa,cAAe,EAAE,iBAAiB,aAAa,EAAE,WAAW,EAAE,cAAc,OAAmB;AAKhH,cAAE,eAAe,YAAY;AAAA,UACrC;AAAA,QACA;AAII,YAAI,EAAE,eAAe,aAAa,EAAE,gBAAgB,EAAE,aAAa;AACjE,uBAAa,EAAE,WAAW,EAAE,YAAY;AAOxC,mBAASA,OAAM,UAAU,GAAG,EAAE,WAAW,IAAI,EAAE,YAAY,EAAE,cAAc,SAAS;AAMpF,YAAE,aAAa,EAAE,cAAc;AAC/B,YAAE,eAAe;AACjB,aAAG;AACD,gBAAI,EAAE,EAAE,YAAY,YAAY;AAE9B,gBAAE,SAAU,EAAE,SAAS,EAAE,aAAc,EAAE,OAAO,EAAE,WAAW,YAAY,CAAC,KAAK,EAAE;AACjF,0BAAY,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,IAAI,EAAE,KAAK,EAAE,KAAK;AAC1D,gBAAE,KAAK,EAAE,KAAK,IAAI,EAAE;AAAA,YAE9B;AAAA,UACA,SAAe,EAAE,EAAE,gBAAgB;AAC7B,YAAE,kBAAkB;AACpB,YAAE,eAAe,YAAY;AAC7B,YAAE;AAEF,cAAI,QAAQ;AAEV,6BAAiB,GAAG,KAAK;AACzB,gBAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,qBAAO;AAAA,YACjB;AAAA,UAEA;AAAA,QAEA,WAAe,EAAE,iBAAiB;AAO5B,mBAASA,OAAM,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;AAEvD,cAAI,QAAQ;AAEV,6BAAiB,GAAG,KAAK;AAAA,UAEjC;AACM,YAAE;AACF,YAAE;AACF,cAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,mBAAO;AAAA,UACf;AAAA,QACA,OAAW;AAIL,YAAE,kBAAkB;AACpB,YAAE;AACF,YAAE;AAAA,QACR;AAAA,MACA;AAEE,UAAI,EAAE,iBAAiB;AAGrB,iBAASA,OAAM,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;AAEvD,UAAE,kBAAkB;AAAA,MACxB;AACE,QAAE,SAAS,EAAE,WAAW,YAAY,IAAI,EAAE,WAAW,YAAY;AACjE,UAAI,UAAU,UAAU;AAEtB,yBAAiB,GAAG,IAAI;AACxB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACb;AAEI,eAAO;AAAA,MACX;AACE,UAAI,EAAE,UAAU;AAEd,yBAAiB,GAAG,KAAK;AACzB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACb;AAAA,MAEA;AAEE,aAAO;AAAA,IACT;AAQA,aAAS,YAAY,GAAG,OAAO;AAC7B,UAAI;AACJ,UAAI;AACJ,UAAI,MAAM;AAEV,UAAI,OAAO,EAAE;AAEb,iBAAS;AAKP,YAAI,EAAE,aAAa,WAAW;AAC5B,sBAAY,CAAC;AACb,cAAI,EAAE,aAAa,aAAa,UAAU,YAAY;AACpD,mBAAO;AAAA,UACf;AACM,cAAI,EAAE,cAAc,GAAG;AAAE;AAAA,UAAQ;AAAA,QACvC;AAGI,UAAE,eAAe;AACjB,YAAI,EAAE,aAAa,aAAa,EAAE,WAAW,GAAG;AAC9C,iBAAO,EAAE,WAAW;AACpB,iBAAO,KAAK,IAAI;AAChB,cAAI,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,GAAG;AAC3E,qBAAS,EAAE,WAAW;AACtB,eAAG;AAAA,YAEX,SAAiB,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAC7C,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAC7C,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAC7C,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAC7C,OAAO;AAChB,cAAE,eAAe,aAAa,SAAS;AACvC,gBAAI,EAAE,eAAe,EAAE,WAAW;AAChC,gBAAE,eAAe,EAAE;AAAA,YAC7B;AAAA,UACA;AAAA,QAEA;AAGI,YAAI,EAAE,gBAAgB,WAAW;AAI/B,mBAASA,OAAM,UAAU,GAAG,GAAG,EAAE,eAAe,SAAS;AAEzD,YAAE,aAAa,EAAE;AACjB,YAAE,YAAY,EAAE;AAChB,YAAE,eAAe;AAAA,QACvB,OAAW;AAIL,mBAASA,OAAM,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,QAAQ,CAAC;AAEnD,YAAE;AACF,YAAE;AAAA,QACR;AACI,YAAI,QAAQ;AAEV,2BAAiB,GAAG,KAAK;AACzB,cAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,mBAAO;AAAA,UACf;AAAA,QAEA;AAAA,MACA;AACE,QAAE,SAAS;AACX,UAAI,UAAU,UAAU;AAEtB,yBAAiB,GAAG,IAAI;AACxB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACb;AAEI,eAAO;AAAA,MACX;AACE,UAAI,EAAE,UAAU;AAEd,yBAAiB,GAAG,KAAK;AACzB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACb;AAAA,MAEA;AACE,aAAO;AAAA,IACT;AAMA,aAAS,aAAa,GAAG,OAAO;AAC9B,UAAI;AAEJ,iBAAS;AAEP,YAAI,EAAE,cAAc,GAAG;AACrB,sBAAY,CAAC;AACb,cAAI,EAAE,cAAc,GAAG;AACrB,gBAAI,UAAU,YAAY;AACxB,qBAAO;AAAA,YACjB;AACQ;AAAA,UACR;AAAA,QACA;AAGI,UAAE,eAAe;AAGjB,iBAASA,OAAM,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,QAAQ,CAAC;AACnD,UAAE;AACF,UAAE;AACF,YAAI,QAAQ;AAEV,2BAAiB,GAAG,KAAK;AACzB,cAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,mBAAO;AAAA,UACf;AAAA,QAEA;AAAA,MACA;AACE,QAAE,SAAS;AACX,UAAI,UAAU,UAAU;AAEtB,yBAAiB,GAAG,IAAI;AACxB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACb;AAEI,eAAO;AAAA,MACX;AACE,UAAI,EAAE,UAAU;AAEd,yBAAiB,GAAG,KAAK;AACzB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACb;AAAA,MAEA;AACE,aAAO;AAAA,IACT;AAOA,aAAS,OAAO,aAAa,UAAU,aAAa,WAAW,MAAM;AACnE,WAAK,cAAc;AACnB,WAAK,WAAW;AAChB,WAAK,cAAc;AACnB,WAAK,YAAY;AACjB,WAAK,OAAO;AAAA,IACd;AAEA,QAAI;AAEJ,0BAAsB;AAAA;AAAA,MAEpB,IAAI,OAAO,GAAG,GAAG,GAAG,GAAG,cAAc;AAAA;AAAA,MACrC,IAAI,OAAO,GAAG,GAAG,GAAG,GAAG,YAAY;AAAA;AAAA,MACnC,IAAI,OAAO,GAAG,GAAG,IAAI,GAAG,YAAY;AAAA;AAAA,MACpC,IAAI,OAAO,GAAG,GAAG,IAAI,IAAI,YAAY;AAAA;AAAA,MAErC,IAAI,OAAO,GAAG,GAAG,IAAI,IAAI,YAAY;AAAA;AAAA,MACrC,IAAI,OAAO,GAAG,IAAI,IAAI,IAAI,YAAY;AAAA;AAAA,MACtC,IAAI,OAAO,GAAG,IAAI,KAAK,KAAK,YAAY;AAAA;AAAA,MACxC,IAAI,OAAO,GAAG,IAAI,KAAK,KAAK,YAAY;AAAA;AAAA,MACxC,IAAI,OAAO,IAAI,KAAK,KAAK,MAAM,YAAY;AAAA;AAAA,MAC3C,IAAI,OAAO,IAAI,KAAK,KAAK,MAAM,YAAY;AAAA;AAAA,IAC5C;AAMD,aAAS,QAAQ,GAAG;AAClB,QAAE,cAAc,IAAI,EAAE;AAGtB,WAAK,EAAE,IAAI;AAIX,QAAE,iBAAiB,oBAAoB,EAAE,KAAK,EAAE;AAChD,QAAE,aAAa,oBAAoB,EAAE,KAAK,EAAE;AAC5C,QAAE,aAAa,oBAAoB,EAAE,KAAK,EAAE;AAC5C,QAAE,mBAAmB,oBAAoB,EAAE,KAAK,EAAE;AAElD,QAAE,WAAW;AACb,QAAE,cAAc;AAChB,QAAE,YAAY;AACd,QAAE,SAAS;AACX,QAAE,eAAe,EAAE,cAAc,YAAY;AAC7C,QAAE,kBAAkB;AACpB,QAAE,QAAQ;AAAA,IACZ;AAGA,aAAS,eAAe;AACtB,WAAK,OAAO;AACZ,WAAK,SAAS;AACd,WAAK,cAAc;AACnB,WAAK,mBAAmB;AACxB,WAAK,cAAc;AACnB,WAAK,UAAU;AACf,WAAK,OAAO;AACZ,WAAK,SAAS;AACd,WAAK,UAAU;AACf,WAAK,SAAS;AACd,WAAK,aAAa;AAElB,WAAK,SAAS;AACd,WAAK,SAAS;AACd,WAAK,SAAS;AAEd,WAAK,SAAS;AAQd,WAAK,cAAc;AAKnB,WAAK,OAAO;AAMZ,WAAK,OAAO;AAEZ,WAAK,QAAQ;AACb,WAAK,YAAY;AACjB,WAAK,YAAY;AACjB,WAAK,YAAY;AAEjB,WAAK,aAAa;AAOlB,WAAK,cAAc;AAKnB,WAAK,eAAe;AACpB,WAAK,aAAa;AAClB,WAAK,kBAAkB;AACvB,WAAK,WAAW;AAChB,WAAK,cAAc;AACnB,WAAK,YAAY;AAEjB,WAAK,cAAc;AAKnB,WAAK,mBAAmB;AAMxB,WAAK,iBAAiB;AAYtB,WAAK,QAAQ;AACb,WAAK,WAAW;AAEhB,WAAK,aAAa;AAGlB,WAAK,aAAa;AAYlB,WAAK,YAAa,IAAI,MAAM,MAAM,YAAY,CAAC;AAC/C,WAAK,YAAa,IAAI,MAAM,OAAO,IAAI,UAAU,KAAK,CAAC;AACvD,WAAK,UAAa,IAAI,MAAM,OAAO,IAAI,WAAW,KAAK,CAAC;AACxD,WAAK,KAAK,SAAS;AACnB,WAAK,KAAK,SAAS;AACnB,WAAK,KAAK,OAAO;AAEjB,WAAK,SAAW;AAChB,WAAK,SAAW;AAChB,WAAK,UAAW;AAGhB,WAAK,WAAW,IAAI,MAAM,MAAM,WAAW,CAAC;AAI5C,WAAK,OAAO,IAAI,MAAM,MAAM,IAAI,UAAU,CAAC;AAC3C,WAAK,KAAK,IAAI;AAEd,WAAK,WAAW;AAChB,WAAK,WAAW;AAKhB,WAAK,QAAQ,IAAI,MAAM,MAAM,IAAI,UAAU,CAAC;AAC5C,WAAK,KAAK,KAAK;AAIf,WAAK,QAAQ;AAEb,WAAK,cAAc;AAoBnB,WAAK,WAAW;AAEhB,WAAK,QAAQ;AAMb,WAAK,UAAU;AACf,WAAK,aAAa;AAClB,WAAK,UAAU;AACf,WAAK,SAAS;AAGd,WAAK,SAAS;AAId,WAAK,WAAW;AAAA,IAalB;AAGA,aAAS,iBAAiB,MAAM;AAC9B,UAAI;AAEJ,UAAI,CAAC,QAAQ,CAAC,KAAK,OAAO;AACxB,eAAO,IAAI,MAAM,cAAc;AAAA,MACnC;AAEE,WAAK,WAAW,KAAK,YAAY;AACjC,WAAK,YAAY;AAEjB,UAAI,KAAK;AACT,QAAE,UAAU;AACZ,QAAE,cAAc;AAEhB,UAAI,EAAE,OAAO,GAAG;AACd,UAAE,OAAO,CAAC,EAAE;AAAA,MAEhB;AACE,QAAE,SAAU,EAAE,OAAO,aAAa;AAClC,WAAK,QAAS,EAAE,SAAS,IACvB,IAEA;AACF,QAAE,aAAa;AACf,MAAAA,OAAM,SAAS,CAAC;AAChB,aAAO;AAAA,IACT;AAGA,aAAS,aAAa,MAAM;AAC1B,UAAI,MAAM,iBAAiB,IAAI;AAC/B,UAAI,QAAQ,MAAM;AAChB,gBAAQ,KAAK,KAAK;AAAA,MACtB;AACE,aAAO;AAAA,IACT;AAGA,aAAS,iBAAiB,MAAM,MAAM;AACpC,UAAI,CAAC,QAAQ,CAAC,KAAK,OAAO;AAAE,eAAO;AAAA,MAAe;AAClD,UAAI,KAAK,MAAM,SAAS,GAAG;AAAE,eAAO;AAAA,MAAe;AACnD,WAAK,MAAM,SAAS;AACpB,aAAO;AAAA,IACT;AAGA,aAAS,aAAa,MAAM,OAAO,QAAQ,YAAY,UAAU,UAAU;AACzE,UAAI,CAAC,MAAM;AACT,eAAO;AAAA,MACX;AACE,UAAI,OAAO;AAEX,UAAI,UAAU,uBAAuB;AACnC,gBAAQ;AAAA,MACZ;AAEE,UAAI,aAAa,GAAG;AAClB,eAAO;AACP,qBAAa,CAAC;AAAA,MAClB,WAEW,aAAa,IAAI;AACxB,eAAO;AACP,sBAAc;AAAA,MAClB;AAGE,UAAI,WAAW,KAAK,WAAW,iBAAiB,WAAW,cACzD,aAAa,KAAK,aAAa,MAAM,QAAQ,KAAK,QAAQ,KAC1D,WAAW,KAAK,WAAW,SAAS;AACpC,eAAO,IAAI,MAAM,cAAc;AAAA,MACnC;AAGE,UAAI,eAAe,GAAG;AACpB,qBAAa;AAAA,MACjB;AAGE,UAAI,IAAI,IAAI,aAAc;AAE1B,WAAK,QAAQ;AACb,QAAE,OAAO;AAET,QAAE,OAAO;AACT,QAAE,SAAS;AACX,QAAE,SAAS;AACX,QAAE,SAAS,KAAK,EAAE;AAClB,QAAE,SAAS,EAAE,SAAS;AAEtB,QAAE,YAAY,WAAW;AACzB,QAAE,YAAY,KAAK,EAAE;AACrB,QAAE,YAAY,EAAE,YAAY;AAC5B,QAAE,aAAa,CAAC,GAAG,EAAE,YAAY,YAAY,KAAK;AAElD,QAAE,SAAS,IAAI,MAAM,KAAK,EAAE,SAAS,CAAC;AACtC,QAAE,OAAO,IAAI,MAAM,MAAM,EAAE,SAAS;AACpC,QAAE,OAAO,IAAI,MAAM,MAAM,EAAE,MAAM;AAKjC,QAAE,cAAc,KAAM,WAAW;AAEjC,QAAE,mBAAmB,EAAE,cAAc;AAIrC,QAAE,cAAc,IAAI,MAAM,KAAK,EAAE,gBAAgB;AAIjD,QAAE,QAAQ,IAAI,EAAE;AAGhB,QAAE,SAAS,IAAI,KAAK,EAAE;AAEtB,QAAE,QAAQ;AACV,QAAE,WAAW;AACb,QAAE,SAAS;AAEX,aAAO,aAAa,IAAI;AAAA,IAC1B;AAEA,aAAS,YAAY,MAAM,OAAO;AAChC,aAAO,aAAa,MAAM,OAAO,YAAY,WAAW,eAAe,kBAAkB;AAAA,IAC3F;AAGA,aAASE,WAAQ,MAAM,OAAO;AAC5B,UAAI,WAAW;AACf,UAAI,KAAK;AAET,UAAI,CAAC,QAAQ,CAAC,KAAK,SACjB,QAAQ,WAAW,QAAQ,GAAG;AAC9B,eAAO,OAAO,IAAI,MAAM,cAAc,IAAI;AAAA,MAC9C;AAEE,UAAI,KAAK;AAET,UAAI,CAAC,KAAK,UACL,CAAC,KAAK,SAAS,KAAK,aAAa,KACjC,EAAE,WAAW,gBAAgB,UAAU,UAAW;AACrD,eAAO,IAAI,MAAO,KAAK,cAAc,IAAK,cAAc,cAAc;AAAA,MAC1E;AAEE,QAAE,OAAO;AACT,kBAAY,EAAE;AACd,QAAE,aAAa;AAGf,UAAI,EAAE,WAAW,YAAY;AAE3B,YAAI,EAAE,SAAS,GAAG;AAChB,eAAK,QAAQ;AACb,mBAAS,GAAG,EAAE;AACd,mBAAS,GAAG,GAAG;AACf,mBAAS,GAAG,CAAC;AACb,cAAI,CAAC,EAAE,QAAQ;AACb,qBAAS,GAAG,CAAC;AACb,qBAAS,GAAG,CAAC;AACb,qBAAS,GAAG,CAAC;AACb,qBAAS,GAAG,CAAC;AACb,qBAAS,GAAG,CAAC;AACb,qBAAS,GAAG,EAAE,UAAU,IAAI,IACf,EAAE,YAAY,kBAAkB,EAAE,QAAQ,IAC1C,IAAI,CAAE;AACnB,qBAAS,GAAG,OAAO;AACnB,cAAE,SAAS;AAAA,UACnB,OACW;AACH;AAAA,cAAS;AAAA,eAAI,EAAE,OAAO,OAAO,IAAI,MACpB,EAAE,OAAO,OAAO,IAAI,MACpB,CAAC,EAAE,OAAO,QAAQ,IAAI,MACtB,CAAC,EAAE,OAAO,OAAO,IAAI,MACrB,CAAC,EAAE,OAAO,UAAU,IAAI;AAAA,YACpC;AACD,qBAAS,GAAG,EAAE,OAAO,OAAO,GAAI;AAChC,qBAAS,GAAI,EAAE,OAAO,QAAQ,IAAK,GAAI;AACvC,qBAAS,GAAI,EAAE,OAAO,QAAQ,KAAM,GAAI;AACxC,qBAAS,GAAI,EAAE,OAAO,QAAQ,KAAM,GAAI;AACxC,qBAAS,GAAG,EAAE,UAAU,IAAI,IACf,EAAE,YAAY,kBAAkB,EAAE,QAAQ,IAC1C,IAAI,CAAE;AACnB,qBAAS,GAAG,EAAE,OAAO,KAAK,GAAI;AAC9B,gBAAI,EAAE,OAAO,SAAS,EAAE,OAAO,MAAM,QAAQ;AAC3C,uBAAS,GAAG,EAAE,OAAO,MAAM,SAAS,GAAI;AACxC,uBAAS,GAAI,EAAE,OAAO,MAAM,UAAU,IAAK,GAAI;AAAA,YACzD;AACQ,gBAAI,EAAE,OAAO,MAAM;AACjB,mBAAK,QAAQH,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,SAAS,CAAC;AAAA,YACpE;AACQ,cAAE,UAAU;AACZ,cAAE,SAAS;AAAA,UACnB;AAAA,QACA,OAEI;AACE,cAAI,SAAU,cAAe,EAAE,SAAS,KAAM,MAAO;AACrD,cAAI,cAAc;AAElB,cAAI,EAAE,YAAY,kBAAkB,EAAE,QAAQ,GAAG;AAC/C,0BAAc;AAAA,UACtB,WAAiB,EAAE,QAAQ,GAAG;AACtB,0BAAc;AAAA,UACtB,WAAiB,EAAE,UAAU,GAAG;AACxB,0BAAc;AAAA,UACtB,OAAa;AACL,0BAAc;AAAA,UACtB;AACM,oBAAW,eAAe;AAC1B,cAAI,EAAE,aAAa,GAAG;AAAE,sBAAU;AAAA,UAAY;AAC9C,oBAAU,KAAM,SAAS;AAEzB,YAAE,SAAS;AACX,sBAAY,GAAG,MAAM;AAGrB,cAAI,EAAE,aAAa,GAAG;AACpB,wBAAY,GAAG,KAAK,UAAU,EAAE;AAChC,wBAAY,GAAG,KAAK,QAAQ,KAAM;AAAA,UAC1C;AACM,eAAK,QAAQ;AAAA,QACnB;AAAA,MACA;AAGE,UAAI,EAAE,WAAW,aAAa;AAC5B,YAAI,EAAE,OAAO,OAAqB;AAChC,gBAAM,EAAE;AAER,iBAAO,EAAE,WAAW,EAAE,OAAO,MAAM,SAAS,QAAS;AACnD,gBAAI,EAAE,YAAY,EAAE,kBAAkB;AACpC,kBAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,qBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,cAC9E;AACU,4BAAc,IAAI;AAClB,oBAAM,EAAE;AACR,kBAAI,EAAE,YAAY,EAAE,kBAAkB;AACpC;AAAA,cACZ;AAAA,YACA;AACQ,qBAAS,GAAG,EAAE,OAAO,MAAM,EAAE,OAAO,IAAI,GAAI;AAC5C,cAAE;AAAA,UACV;AACM,cAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,iBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,UAC1E;AACM,cAAI,EAAE,YAAY,EAAE,OAAO,MAAM,QAAQ;AACvC,cAAE,UAAU;AACZ,cAAE,SAAS;AAAA,UACnB;AAAA,QACA,OACS;AACH,YAAE,SAAS;AAAA,QACjB;AAAA,MACA;AACE,UAAI,EAAE,WAAW,YAAY;AAC3B,YAAI,EAAE,OAAO,MAAoB;AAC/B,gBAAM,EAAE;AAGR,aAAG;AACD,gBAAI,EAAE,YAAY,EAAE,kBAAkB;AACpC,kBAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,qBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,cAC9E;AACU,4BAAc,IAAI;AAClB,oBAAM,EAAE;AACR,kBAAI,EAAE,YAAY,EAAE,kBAAkB;AACpC,sBAAM;AACN;AAAA,cACZ;AAAA,YACA;AAEQ,gBAAI,EAAE,UAAU,EAAE,OAAO,KAAK,QAAQ;AACpC,oBAAM,EAAE,OAAO,KAAK,WAAW,EAAE,SAAS,IAAI;AAAA,YACxD,OAAe;AACL,oBAAM;AAAA,YAChB;AACQ,qBAAS,GAAG,GAAG;AAAA,UAChB,SAAQ,QAAQ;AAEjB,cAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,iBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,UAC1E;AACM,cAAI,QAAQ,GAAG;AACb,cAAE,UAAU;AACZ,cAAE,SAAS;AAAA,UACnB;AAAA,QACA,OACS;AACH,YAAE,SAAS;AAAA,QACjB;AAAA,MACA;AACE,UAAI,EAAE,WAAW,eAAe;AAC9B,YAAI,EAAE,OAAO,SAAuB;AAClC,gBAAM,EAAE;AAGR,aAAG;AACD,gBAAI,EAAE,YAAY,EAAE,kBAAkB;AACpC,kBAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,qBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,cAC9E;AACU,4BAAc,IAAI;AAClB,oBAAM,EAAE;AACR,kBAAI,EAAE,YAAY,EAAE,kBAAkB;AACpC,sBAAM;AACN;AAAA,cACZ;AAAA,YACA;AAEQ,gBAAI,EAAE,UAAU,EAAE,OAAO,QAAQ,QAAQ;AACvC,oBAAM,EAAE,OAAO,QAAQ,WAAW,EAAE,SAAS,IAAI;AAAA,YAC3D,OAAe;AACL,oBAAM;AAAA,YAChB;AACQ,qBAAS,GAAG,GAAG;AAAA,UAChB,SAAQ,QAAQ;AAEjB,cAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,iBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,UAC1E;AACM,cAAI,QAAQ,GAAG;AACb,cAAE,SAAS;AAAA,UACnB;AAAA,QACA,OACS;AACH,YAAE,SAAS;AAAA,QACjB;AAAA,MACA;AACE,UAAI,EAAE,WAAW,YAAY;AAC3B,YAAI,EAAE,OAAO,MAAM;AACjB,cAAI,EAAE,UAAU,IAAI,EAAE,kBAAkB;AACtC,0BAAc,IAAI;AAAA,UAC1B;AACM,cAAI,EAAE,UAAU,KAAK,EAAE,kBAAkB;AACvC,qBAAS,GAAG,KAAK,QAAQ,GAAI;AAC7B,qBAAS,GAAI,KAAK,SAAS,IAAK,GAAI;AACpC,iBAAK,QAAQ;AACb,cAAE,SAAS;AAAA,UACnB;AAAA,QACA,OACS;AACH,YAAE,SAAS;AAAA,QACjB;AAAA,MACA;AAIE,UAAI,EAAE,YAAY,GAAG;AACnB,sBAAc,IAAI;AAClB,YAAI,KAAK,cAAc,GAAG;AAOxB,YAAE,aAAa;AACf,iBAAO;AAAA,QACb;AAAA,MAMA,WAAa,KAAK,aAAa,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS,KAC7D,UAAU,UAAU;AACpB,eAAO,IAAI,MAAM,WAAW;AAAA,MAChC;AAGE,UAAI,EAAE,WAAW,gBAAgB,KAAK,aAAa,GAAG;AACpD,eAAO,IAAI,MAAM,WAAW;AAAA,MAChC;AAIE,UAAI,KAAK,aAAa,KAAK,EAAE,cAAc,KACxC,UAAU,cAAc,EAAE,WAAW,cAAe;AACrD,YAAI,SAAU,EAAE,aAAa,iBAAkB,aAAa,GAAG,KAAK,IACjE,EAAE,aAAa,QAAQ,YAAY,GAAG,KAAK,IAC1C,oBAAoB,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK;AAE9C,YAAI,WAAW,qBAAqB,WAAW,gBAAgB;AAC7D,YAAE,SAAS;AAAA,QACjB;AACI,YAAI,WAAW,gBAAgB,WAAW,mBAAmB;AAC3D,cAAI,KAAK,cAAc,GAAG;AACxB,cAAE,aAAa;AAAA,UAEvB;AACM,iBAAO;AAAA,QAQb;AACI,YAAI,WAAW,eAAe;AAC5B,cAAI,UAAU,iBAAiB;AAC7B,YAAAC,OAAM,UAAU,CAAC;AAAA,UACzB,WACe,UAAU,SAAS;AAE1B,YAAAA,OAAM,iBAAiB,GAAG,GAAG,GAAG,KAAK;AAIrC,gBAAI,UAAU,cAAc;AAE1B,mBAAK,EAAE,IAAI;AAEX,kBAAI,EAAE,cAAc,GAAG;AACrB,kBAAE,WAAW;AACb,kBAAE,cAAc;AAChB,kBAAE,SAAS;AAAA,cACvB;AAAA,YACA;AAAA,UACA;AACM,wBAAc,IAAI;AAClB,cAAI,KAAK,cAAc,GAAG;AACxB,cAAE,aAAa;AACf,mBAAO;AAAA,UACf;AAAA,QACA;AAAA,MACA;AAIE,UAAI,UAAU,UAAU;AAAE,eAAO;AAAA,MAAK;AACtC,UAAI,EAAE,QAAQ,GAAG;AAAE,eAAO;AAAA,MAAa;AAGvC,UAAI,EAAE,SAAS,GAAG;AAChB,iBAAS,GAAG,KAAK,QAAQ,GAAI;AAC7B,iBAAS,GAAI,KAAK,SAAS,IAAK,GAAI;AACpC,iBAAS,GAAI,KAAK,SAAS,KAAM,GAAI;AACrC,iBAAS,GAAI,KAAK,SAAS,KAAM,GAAI;AACrC,iBAAS,GAAG,KAAK,WAAW,GAAI;AAChC,iBAAS,GAAI,KAAK,YAAY,IAAK,GAAI;AACvC,iBAAS,GAAI,KAAK,YAAY,KAAM,GAAI;AACxC,iBAAS,GAAI,KAAK,YAAY,KAAM,GAAI;AAAA,MAC5C,OAEE;AACE,oBAAY,GAAG,KAAK,UAAU,EAAE;AAChC,oBAAY,GAAG,KAAK,QAAQ,KAAM;AAAA,MACtC;AAEE,oBAAc,IAAI;AAIlB,UAAI,EAAE,OAAO,GAAG;AAAE,UAAE,OAAO,CAAC,EAAE;AAAA,MAAK;AAEnC,aAAO,EAAE,YAAY,IAAI,OAAO;AAAA,IAClC;AAEA,aAAS,WAAW,MAAM;AACxB,UAAI;AAEJ,UAAI,CAAC,QAAqB,CAAC,KAAK,OAAoB;AAClD,eAAO;AAAA,MACX;AAEE,eAAS,KAAK,MAAM;AACpB,UAAI,WAAW,cACb,WAAW,eACX,WAAW,cACX,WAAW,iBACX,WAAW,cACX,WAAW,cACX,WAAW,cACX;AACA,eAAO,IAAI,MAAM,cAAc;AAAA,MACnC;AAEE,WAAK,QAAQ;AAEb,aAAO,WAAW,aAAa,IAAI,MAAM,YAAY,IAAI;AAAA,IAC3D;AAOA,aAAS,qBAAqB,MAAM,YAAY;AAC9C,UAAI,aAAa,WAAW;AAE5B,UAAI;AACJ,UAAI,KAAK;AACT,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,UAAI,CAAC,QAAqB,CAAC,KAAK,OAAoB;AAClD,eAAO;AAAA,MACX;AAEE,UAAI,KAAK;AACT,aAAO,EAAE;AAET,UAAI,SAAS,KAAM,SAAS,KAAK,EAAE,WAAW,cAAe,EAAE,WAAW;AACxE,eAAO;AAAA,MACX;AAGE,UAAI,SAAS,GAAG;AAEd,aAAK,QAAQ,QAAQ,KAAK,OAAO,YAAY,YAAY,CAAC;AAAA,MAC9D;AAEE,QAAE,OAAO;AAGT,UAAI,cAAc,EAAE,QAAQ;AAC1B,YAAI,SAAS,GAAG;AAEd,eAAK,EAAE,IAAI;AACX,YAAE,WAAW;AACb,YAAE,cAAc;AAChB,YAAE,SAAS;AAAA,QACjB;AAGI,kBAAU,IAAI,MAAM,KAAK,EAAE,MAAM;AACjC,cAAM,SAAS,SAAS,YAAY,aAAa,EAAE,QAAQ,EAAE,QAAQ,CAAC;AACtE,qBAAa;AACb,qBAAa,EAAE;AAAA,MACnB;AAEE,cAAQ,KAAK;AACb,aAAO,KAAK;AACZ,cAAQ,KAAK;AACb,WAAK,WAAW;AAChB,WAAK,UAAU;AACf,WAAK,QAAQ;AACb,kBAAY,CAAC;AACb,aAAO,EAAE,aAAa,WAAW;AAC/B,cAAM,EAAE;AACR,YAAI,EAAE,aAAa,YAAY;AAC/B,WAAG;AAED,YAAE,SAAU,EAAE,SAAS,EAAE,aAAc,EAAE,OAAO,MAAM,YAAY,CAAC,KAAK,EAAE;AAE1E,YAAE,KAAK,MAAM,EAAE,MAAM,IAAI,EAAE,KAAK,EAAE,KAAK;AAEvC,YAAE,KAAK,EAAE,KAAK,IAAI;AAClB;AAAA,QACD,SAAQ,EAAE;AACX,UAAE,WAAW;AACb,UAAE,YAAY,YAAY;AAC1B,oBAAY,CAAC;AAAA,MACjB;AACE,QAAE,YAAY,EAAE;AAChB,QAAE,cAAc,EAAE;AAClB,QAAE,SAAS,EAAE;AACb,QAAE,YAAY;AACd,QAAE,eAAe,EAAE,cAAc,YAAY;AAC7C,QAAE,kBAAkB;AACpB,WAAK,UAAU;AACf,WAAK,QAAQ;AACb,WAAK,WAAW;AAChB,QAAE,OAAO;AACT,aAAO;AAAA,IACT;AAGAG,YAAA,cAAsB;AACtBA,YAAA,eAAuB;AACvBA,YAAA,eAAuB;AACvBA,YAAA,mBAA2B;AAC3BA,YAAA,mBAA2B;AAC3BA,YAAA,UAAkBD;AAClBC,YAAA,aAAqB;AACrBA,YAAA,uBAA+B;AAC/BA,YAAA,cAAsB;;;;;;;;ACp0DtB,QAAI,QAAQ1B,cAAmB;AAQ/B,QAAI,eAAe;AACnB,QAAI,mBAAmB;AAEvB,QAAI;AAAE,aAAO,aAAa,MAAM,MAAM,CAAE,EAAG;AAAA,IAAI,SAAQ,IAAI;AAAE,qBAAe;AAAA,IAAM;AAClF,QAAI;AAAE,aAAO,aAAa,MAAM,MAAM,IAAI,WAAW,CAAC,CAAC;AAAA,IAAE,SAAU,IAAI;AAAE,yBAAmB;AAAA,IAAM;AAMlG,QAAI,WAAW,IAAI,MAAM,KAAK,GAAG;AACjC,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,eAAS,CAAC,IAAK,KAAK,MAAM,IAAI,KAAK,MAAM,IAAI,KAAK,MAAM,IAAI,KAAK,MAAM,IAAI,KAAK,MAAM,IAAI;AAAA,IAC5F;AACA,aAAS,GAAG,IAAI,SAAS,GAAG,IAAI;AAId,YAAA,aAAG,SAAU,KAAK;AAClC,UAAI,KAAK,GAAG,IAAI,OAAO,GAAG,UAAU,IAAI,QAAQ,UAAU;AAG1D,WAAK,QAAQ,GAAG,QAAQ,SAAS,SAAS;AACxC,YAAI,IAAI,WAAW,KAAK;AACxB,aAAK,IAAI,WAAY,SAAW,QAAQ,IAAI,SAAU;AACpD,eAAK,IAAI,WAAW,QAAQ,CAAC;AAC7B,eAAK,KAAK,WAAY,OAAQ;AAC5B,gBAAI,SAAY,IAAI,SAAW,OAAO,KAAK;AAC3C;AAAA,UACR;AAAA,QACA;AACI,mBAAW,IAAI,MAAO,IAAI,IAAI,OAAQ,IAAI,IAAI,QAAU,IAAI;AAAA,MAChE;AAGE,YAAM,IAAI,MAAM,KAAK,OAAO;AAG5B,WAAK,IAAI,GAAG,QAAQ,GAAG,IAAI,SAAS,SAAS;AAC3C,YAAI,IAAI,WAAW,KAAK;AACxB,aAAK,IAAI,WAAY,SAAW,QAAQ,IAAI,SAAU;AACpD,eAAK,IAAI,WAAW,QAAQ,CAAC;AAC7B,eAAK,KAAK,WAAY,OAAQ;AAC5B,gBAAI,SAAY,IAAI,SAAW,OAAO,KAAK;AAC3C;AAAA,UACR;AAAA,QACA;AACI,YAAI,IAAI,KAAM;AAEZ,cAAI,GAAG,IAAI;AAAA,QACjB,WAAe,IAAI,MAAO;AAEpB,cAAI,GAAG,IAAI,MAAQ,MAAM;AACzB,cAAI,GAAG,IAAI,MAAQ,IAAI;AAAA,QAC7B,WAAe,IAAI,OAAS;AAEtB,cAAI,GAAG,IAAI,MAAQ,MAAM;AACzB,cAAI,GAAG,IAAI,MAAQ,MAAM,IAAI;AAC7B,cAAI,GAAG,IAAI,MAAQ,IAAI;AAAA,QAC7B,OAAW;AAEL,cAAI,GAAG,IAAI,MAAQ,MAAM;AACzB,cAAI,GAAG,IAAI,MAAQ,MAAM,KAAK;AAC9B,cAAI,GAAG,IAAI,MAAQ,MAAM,IAAI;AAC7B,cAAI,GAAG,IAAI,MAAQ,IAAI;AAAA,QAC7B;AAAA,MACA;AAEE,aAAO;AAAA,IACR;AAGD,aAAS,cAAc,KAAK,KAAK;AAI/B,UAAI,MAAM,OAAO;AACf,YAAK,IAAI,YAAY,oBAAsB,CAAC,IAAI,YAAY,cAAe;AACzE,iBAAO,OAAO,aAAa,MAAM,MAAM,MAAM,UAAU,KAAK,GAAG,CAAC;AAAA,QACtE;AAAA,MACA;AAEE,UAAI,SAAS;AACb,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,kBAAU,OAAO,aAAa,IAAI,CAAC,CAAC;AAAA,MACxC;AACE,aAAO;AAAA,IACT;AAIqB,YAAA,gBAAG,SAAU,KAAK;AACrC,aAAO,cAAc,KAAK,IAAI,MAAM;AAAA,IACrC;AAIoB,YAAA,gBAAG,SAAU,KAAK;AACrC,UAAI,MAAM,IAAI,MAAM,KAAK,IAAI,MAAM;AACnC,eAAS,IAAI,GAAG,MAAM,IAAI,QAAQ,IAAI,KAAK,KAAK;AAC9C,YAAI,CAAC,IAAI,IAAI,WAAW,CAAC;AAAA,MAC7B;AACE,aAAO;AAAA,IACR;AAID,YAAA,aAAqB,SAAU,KAAK,KAAK;AACvC,UAAI,GAAG,KAAK,GAAG;AACf,UAAI,MAAM,OAAO,IAAI;AAKrB,UAAI,WAAW,IAAI,MAAM,MAAM,CAAC;AAEhC,WAAK,MAAM,GAAG,IAAI,GAAG,IAAI,OAAM;AAC7B,YAAI,IAAI,GAAG;AAEX,YAAI,IAAI,KAAM;AAAE,mBAAS,KAAK,IAAI;AAAG;AAAA,QAAS;AAE9C,gBAAQ,SAAS,CAAC;AAElB,YAAI,QAAQ,GAAG;AAAE,mBAAS,KAAK,IAAI;AAAQ,eAAK,QAAQ;AAAG;AAAA,QAAS;AAGpE,aAAK,UAAU,IAAI,KAAO,UAAU,IAAI,KAAO;AAE/C,eAAO,QAAQ,KAAK,IAAI,KAAK;AAC3B,cAAK,KAAK,IAAM,IAAI,GAAG,IAAI;AAC3B;AAAA,QACN;AAGI,YAAI,QAAQ,GAAG;AAAE,mBAAS,KAAK,IAAI;AAAQ;AAAA,QAAS;AAEpD,YAAI,IAAI,OAAS;AACf,mBAAS,KAAK,IAAI;AAAA,QACxB,OAAW;AACL,eAAK;AACL,mBAAS,KAAK,IAAI,QAAW,KAAK,KAAM;AACxC,mBAAS,KAAK,IAAI,QAAU,IAAI;AAAA,QACtC;AAAA,MACA;AAEE,aAAO,cAAc,UAAU,GAAG;AAAA,IACnC;AASD,YAAA,aAAqB,SAAU,KAAK,KAAK;AACvC,UAAI;AAEJ,YAAM,OAAO,IAAI;AACjB,UAAI,MAAM,IAAI,QAAQ;AAAE,cAAM,IAAI;AAAA,MAAO;AAGzC,YAAM,MAAM;AACZ,aAAO,OAAO,MAAM,IAAI,GAAG,IAAI,SAAU,KAAM;AAAE;AAAA,MAAM;AAIvD,UAAI,MAAM,GAAG;AAAE,eAAO;AAAA,MAAI;AAI1B,UAAI,QAAQ,GAAG;AAAE,eAAO;AAAA,MAAI;AAE5B,aAAQ,MAAM,SAAS,IAAI,GAAG,CAAC,IAAI,MAAO,MAAM;AAAA,IACjD;;;;;;;;ACrKD,aAAS,UAAU;AAEjB,WAAK,QAAQ;AACb,WAAK,UAAU;AAEf,WAAK,WAAW;AAEhB,WAAK,WAAW;AAEhB,WAAK,SAAS;AACd,WAAK,WAAW;AAEhB,WAAK,YAAY;AAEjB,WAAK,YAAY;AAEjB,WAAK,MAAM;AAEX,WAAK,QAAQ;AAEb,WAAK,YAAY;AAEjB,WAAK,QAAQ;AAAA,IACf;AAEA,cAAiB;;;;;;;AC3CjB,QAAI,eAAeA,iBAAyB;AAC5C,QAAI,QAAeM,cAAyB;AAC5C,QAAIqB,WAAepB,eAA0B;AAC7C,QAAI,MAAeC,gBAA0B;AAC7C,QAAI,UAAegB,eAAyB;AAE5C,QAAI,WAAW,OAAO,UAAU;AAKhC,QAAI,aAAkB;AACtB,QAAI,WAAkB;AAEtB,QAAI,OAAkB;AACtB,QAAI,eAAkB;AACtB,QAAI,eAAkB;AAEtB,QAAI,wBAAwB;AAE5B,QAAI,qBAAwB;AAE5B,QAAI,aAAc;AA8FlB,aAAS,QAAQ,SAAS;AACxB,UAAI,EAAE,gBAAgB,SAAU,QAAO,IAAI,QAAQ,OAAO;AAE1D,WAAK,UAAU,MAAM,OAAO;AAAA,QAC1B,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,UAAU;AAAA,QACV,UAAU;AAAA,QACV,IAAI;AAAA,MACR,GAAK,WAAW,CAAA,CAAE;AAEhB,UAAI,MAAM,KAAK;AAEf,UAAI,IAAI,OAAQ,IAAI,aAAa,GAAI;AACnC,YAAI,aAAa,CAAC,IAAI;AAAA,MAC1B,WAEW,IAAI,QAAS,IAAI,aAAa,KAAO,IAAI,aAAa,IAAK;AAClE,YAAI,cAAc;AAAA,MACtB;AAEE,WAAK,MAAS;AACd,WAAK,MAAS;AACd,WAAK,QAAS;AACd,WAAK,SAAS;AAEd,WAAK,OAAO,IAAI,QAAS;AACzB,WAAK,KAAK,YAAY;AAEtB,UAAI,SAAS,aAAa;AAAA,QACxB,KAAK;AAAA,QACL,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,MACL;AAED,UAAI,WAAW,MAAM;AACnB,cAAM,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,MAC/B;AAEE,UAAI,IAAI,QAAQ;AACd,qBAAa,iBAAiB,KAAK,MAAM,IAAI,MAAM;AAAA,MACvD;AAEE,UAAI,IAAI,YAAY;AAClB,YAAI;AAEJ,YAAI,OAAO,IAAI,eAAe,UAAU;AAEtC,iBAAOG,SAAQ,WAAW,IAAI,UAAU;AAAA,QAC9C,WAAe,SAAS,KAAK,IAAI,UAAU,MAAM,wBAAwB;AACnE,iBAAO,IAAI,WAAW,IAAI,UAAU;AAAA,QAC1C,OAAW;AACL,iBAAO,IAAI;AAAA,QACjB;AAEI,iBAAS,aAAa,qBAAqB,KAAK,MAAM,IAAI;AAE1D,YAAI,WAAW,MAAM;AACnB,gBAAM,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,QACjC;AAEI,aAAK,YAAY;AAAA,MACrB;AAAA,IACA;AA+BA,YAAQ,UAAU,OAAO,SAAU,MAAM,MAAM;AAC7C,UAAI,OAAO,KAAK;AAChB,UAAI,YAAY,KAAK,QAAQ;AAC7B,UAAI,QAAQ;AAEZ,UAAI,KAAK,OAAO;AAAE,eAAO;AAAA,MAAM;AAE/B,cAAS,SAAS,CAAC,CAAC,OAAQ,OAAS,SAAS,OAAQ,WAAW;AAGjE,UAAI,OAAO,SAAS,UAAU;AAE5B,aAAK,QAAQA,SAAQ,WAAW,IAAI;AAAA,MACrC,WAAU,SAAS,KAAK,IAAI,MAAM,wBAAwB;AACzD,aAAK,QAAQ,IAAI,WAAW,IAAI;AAAA,MACpC,OAAS;AACL,aAAK,QAAQ;AAAA,MACjB;AAEE,WAAK,UAAU;AACf,WAAK,WAAW,KAAK,MAAM;AAE3B,SAAG;AACD,YAAI,KAAK,cAAc,GAAG;AACxB,eAAK,SAAS,IAAI,MAAM,KAAK,SAAS;AACtC,eAAK,WAAW;AAChB,eAAK,YAAY;AAAA,QACvB;AACI,iBAAS,aAAa,QAAQ,MAAM,KAAK;AAEzC,YAAI,WAAW,gBAAgB,WAAW,MAAM;AAC9C,eAAK,MAAM,MAAM;AACjB,eAAK,QAAQ;AACb,iBAAO;AAAA,QACb;AACI,YAAI,KAAK,cAAc,KAAM,KAAK,aAAa,MAAM,UAAU,YAAY,UAAU,eAAgB;AACnG,cAAI,KAAK,QAAQ,OAAO,UAAU;AAChC,iBAAK,OAAOA,SAAQ,cAAc,MAAM,UAAU,KAAK,QAAQ,KAAK,QAAQ,CAAC,CAAC;AAAA,UACtF,OAAa;AACL,iBAAK,OAAO,MAAM,UAAU,KAAK,QAAQ,KAAK,QAAQ,CAAC;AAAA,UAC/D;AAAA,QACA;AAAA,MACA,UAAY,KAAK,WAAW,KAAK,KAAK,cAAc,MAAM,WAAW;AAGnE,UAAI,UAAU,UAAU;AACtB,iBAAS,aAAa,WAAW,KAAK,IAAI;AAC1C,aAAK,MAAM,MAAM;AACjB,aAAK,QAAQ;AACb,eAAO,WAAW;AAAA,MACtB;AAGE,UAAI,UAAU,cAAc;AAC1B,aAAK,MAAM,IAAI;AACf,aAAK,YAAY;AACjB,eAAO;AAAA,MACX;AAEE,aAAO;AAAA,IACR;AAYD,YAAQ,UAAU,SAAS,SAAU,OAAO;AAC1C,WAAK,OAAO,KAAK,KAAK;AAAA,IACvB;AAaD,YAAQ,UAAU,QAAQ,SAAU,QAAQ;AAE1C,UAAI,WAAW,MAAM;AACnB,YAAI,KAAK,QAAQ,OAAO,UAAU;AAChC,eAAK,SAAS,KAAK,OAAO,KAAK,EAAE;AAAA,QACvC,OAAW;AACL,eAAK,SAAS,MAAM,cAAc,KAAK,MAAM;AAAA,QACnD;AAAA,MACA;AACE,WAAK,SAAS,CAAE;AAChB,WAAK,MAAM;AACX,WAAK,MAAM,KAAK,KAAK;AAAA,IACtB;AAqCD,aAASF,SAAQ,OAAO,SAAS;AAC/B,UAAI,WAAW,IAAI,QAAQ,OAAO;AAElC,eAAS,KAAK,OAAO,IAAI;AAGzB,UAAI,SAAS,KAAK;AAAE,cAAM,SAAS,OAAO,IAAI,SAAS,GAAG;AAAA,MAAE;AAE5D,aAAO,SAAS;AAAA,IAClB;AAWA,aAAS,WAAW,OAAO,SAAS;AAClC,gBAAU,WAAW,CAAE;AACvB,cAAQ,MAAM;AACd,aAAOA,SAAQ,OAAO,OAAO;AAAA,IAC/B;AAWA,aAAS,KAAK,OAAO,SAAS;AAC5B,gBAAU,WAAW,CAAE;AACvB,cAAQ,OAAO;AACf,aAAOA,SAAQ,OAAO,OAAO;AAAA,IAC/B;AAGAC,cAAA,UAAkB;AAClBA,cAAA,UAAkBD;AAClBC,cAAA,aAAqB;AACrBA,cAAA,OAAe;;;;;;;;;;ACzXf,QAAI,MAAM;AACV,QAAI,OAAO;AAqCX,cAAiB,SAAS,aAAa,MAAM,OAAO;AAClD,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,UAAI;AAEJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAGJ,UAAI,OAAO;AAGX,cAAQ,KAAK;AAEb,YAAM,KAAK;AACX,cAAQ,KAAK;AACb,aAAO,OAAO,KAAK,WAAW;AAC9B,aAAO,KAAK;AACZ,eAAS,KAAK;AACd,YAAM,QAAQ,QAAQ,KAAK;AAC3B,YAAM,QAAQ,KAAK,YAAY;AAE/B,aAAO,MAAM;AAEb,cAAQ,MAAM;AACd,cAAQ,MAAM;AACd,cAAQ,MAAM;AACd,iBAAW,MAAM;AACjB,aAAO,MAAM;AACb,aAAO,MAAM;AACb,cAAQ,MAAM;AACd,cAAQ,MAAM;AACd,eAAS,KAAK,MAAM,WAAW;AAC/B,eAAS,KAAK,MAAM,YAAY;AAMhC;AACA,WAAG;AACD,cAAI,OAAO,IAAI;AACb,oBAAQ,MAAM,KAAK,KAAK;AACxB,oBAAQ;AACR,oBAAQ,MAAM,KAAK,KAAK;AACxB,oBAAQ;AAAA,UACd;AAEI,iBAAO,MAAM,OAAO,KAAK;AAEzB;AACA,uBAAS;AACP,mBAAK,SAAS;AACd,wBAAU;AACV,sBAAQ;AACR,mBAAM,SAAS,KAAM;AACrB,kBAAI,OAAO,GAAG;AAIZ,uBAAO,MAAM,IAAI,OAAO;AAAA,cAChC,WACe,KAAK,IAAI;AAChB,sBAAM,OAAO;AACb,sBAAM;AACN,oBAAI,IAAI;AACN,sBAAI,OAAO,IAAI;AACb,4BAAQ,MAAM,KAAK,KAAK;AACxB,4BAAQ;AAAA,kBACpB;AACU,yBAAO,QAAS,KAAK,MAAM;AAC3B,4BAAU;AACV,0BAAQ;AAAA,gBAClB;AAEQ,oBAAI,OAAO,IAAI;AACb,0BAAQ,MAAM,KAAK,KAAK;AACxB,0BAAQ;AACR,0BAAQ,MAAM,KAAK,KAAK;AACxB,0BAAQ;AAAA,gBAClB;AACQ,uBAAO,MAAM,OAAO,KAAK;AAEzB;AACA,6BAAS;AACP,yBAAK,SAAS;AACd,8BAAU;AACV,4BAAQ;AACR,yBAAM,SAAS,KAAM;AAErB,wBAAI,KAAK,IAAI;AACX,6BAAO,OAAO;AACd,4BAAM;AACN,0BAAI,OAAO,IAAI;AACb,gCAAQ,MAAM,KAAK,KAAK;AACxB,gCAAQ;AACR,4BAAI,OAAO,IAAI;AACb,kCAAQ,MAAM,KAAK,KAAK;AACxB,kCAAQ;AAAA,wBACxB;AAAA,sBACA;AACY,8BAAQ,QAAS,KAAK,MAAM;AAE5B,0BAAI,OAAO,MAAM;AACf,6BAAK,MAAM;AACX,8BAAM,OAAO;AACb,8BAAM;AAAA,sBACpB;AAEY,gCAAU;AACV,8BAAQ;AAER,2BAAK,OAAO;AACZ,0BAAI,OAAO,IAAI;AACb,6BAAK,OAAO;AACZ,4BAAI,KAAK,OAAO;AACd,8BAAI,MAAM,MAAM;AACd,iCAAK,MAAM;AACX,kCAAM,OAAO;AACb,kCAAM;AAAA,0BACxB;AAAA,wBAuBA;AACc,+BAAO;AACP,sCAAc;AACd,4BAAI,UAAU,GAAG;AACf,kCAAQ,QAAQ;AAChB,8BAAI,KAAK,KAAK;AACZ,mCAAO;AACP,+BAAG;AACD,qCAAO,MAAM,IAAI,SAAS,MAAM;AAAA,4BACjC,SAAQ,EAAE;AACX,mCAAO,OAAO;AACd,0CAAc;AAAA,0BAChC;AAAA,wBACA,WACuB,QAAQ,IAAI;AACnB,kCAAQ,QAAQ,QAAQ;AACxB,gCAAM;AACN,8BAAI,KAAK,KAAK;AACZ,mCAAO;AACP,+BAAG;AACD,qCAAO,MAAM,IAAI,SAAS,MAAM;AAAA,4BACjC,SAAQ,EAAE;AACX,mCAAO;AACP,gCAAI,QAAQ,KAAK;AACf,mCAAK;AACL,qCAAO;AACP,iCAAG;AACD,uCAAO,MAAM,IAAI,SAAS,MAAM;AAAA,8BACjC,SAAQ,EAAE;AACX,qCAAO,OAAO;AACd,4CAAc;AAAA,4BAClC;AAAA,0BACA;AAAA,wBACA,OACmB;AACH,kCAAQ,QAAQ;AAChB,8BAAI,KAAK,KAAK;AACZ,mCAAO;AACP,+BAAG;AACD,qCAAO,MAAM,IAAI,SAAS,MAAM;AAAA,4BACjC,SAAQ,EAAE;AACX,mCAAO,OAAO;AACd,0CAAc;AAAA,0BAChC;AAAA,wBACA;AACc,+BAAO,MAAM,GAAG;AACd,iCAAO,MAAM,IAAI,YAAY,MAAM;AACnC,iCAAO,MAAM,IAAI,YAAY,MAAM;AACnC,iCAAO,MAAM,IAAI,YAAY,MAAM;AACnC,iCAAO;AAAA,wBACvB;AACc,4BAAI,KAAK;AACP,iCAAO,MAAM,IAAI,YAAY,MAAM;AACnC,8BAAI,MAAM,GAAG;AACX,mCAAO,MAAM,IAAI,YAAY,MAAM;AAAA,0BACrD;AAAA,wBACA;AAAA,sBACA,OACiB;AACH,+BAAO,OAAO;AACd,2BAAG;AACD,iCAAO,MAAM,IAAI,OAAO,MAAM;AAC9B,iCAAO,MAAM,IAAI,OAAO,MAAM;AAC9B,iCAAO,MAAM,IAAI,OAAO,MAAM;AAC9B,iCAAO;AAAA,wBACR,SAAQ,MAAM;AACf,4BAAI,KAAK;AACP,iCAAO,MAAM,IAAI,OAAO,MAAM;AAC9B,8BAAI,MAAM,GAAG;AACX,mCAAO,MAAM,IAAI,OAAO,MAAM;AAAA,0BAChD;AAAA,wBACA;AAAA,sBACA;AAAA,oBACA,YACoB,KAAK,QAAQ,GAAG;AACxB,6BAAO,OAAO,OAAO,UAAuB,QAAS,KAAK,MAAM,EAAG;AACnE,+BAAS;AAAA,oBACrB,OACe;AACH,2BAAK,MAAM;AACX,4BAAM,OAAO;AACb,4BAAM;AAAA,oBAClB;AAEU;AAAA,kBACV;AAAA,cACA,YACgB,KAAK,QAAQ,GAAG;AACxB,uBAAO,OAAO,OAAO,UAAuB,QAAS,KAAK,MAAM,EAAG;AACnE,yBAAS;AAAA,cACjB,WACe,KAAK,IAAI;AAEhB,sBAAM,OAAO;AACb,sBAAM;AAAA,cACd,OACW;AACH,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb,sBAAM;AAAA,cACd;AAEM;AAAA,YACN;AAAA,QACA,SAAW,MAAM,QAAQ,OAAO;AAG9B,YAAM,QAAQ;AACd,aAAO;AACP,cAAQ,OAAO;AACf,eAAS,KAAK,QAAQ;AAGtB,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,WAAY,MAAM,OAAO,KAAK,OAAO,OAAO,KAAK,MAAM;AAC5D,WAAK,YAAa,OAAO,MAAM,OAAO,MAAM,QAAQ,OAAO,OAAO;AAClE,YAAM,OAAO;AACb,YAAM,OAAO;AACb;AAAA,IACD;;;;;;;;ACnUD,QAAI,QAAQ1B,cAA0B;AAEtC,QAAI,UAAU;AACd,QAAI,cAAc;AAClB,QAAI,eAAe;AAGnB,QAAI,QAAQ;AACZ,QAAI,OAAO;AACX,QAAI,QAAQ;AAEZ,QAAI,QAAQ;AAAA;AAAA,MACV;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MACrD;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAG;AAAA,IAC9D;AAED,QAAI,OAAO;AAAA;AAAA,MACT;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAC5D;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,IACzD;AAED,QAAI,QAAQ;AAAA;AAAA,MACV;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAK;AAAA,MACtD;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAM;AAAA,MAAM;AAAA,MAAM;AAAA,MAAM;AAAA,MAAM;AAAA,MAClD;AAAA,MAAM;AAAA,MAAO;AAAA,MAAO;AAAA,MAAO;AAAA,MAAG;AAAA,IAC/B;AAED,QAAI,OAAO;AAAA;AAAA,MACT;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAC5D;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MACpC;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,IACrB;AAED,eAAiB,SAAS,cAAc,MAAM,MAAM,YAAY,OAAO,OAAO,aAAa,MAAM,MACjG;AACE,UAAI,OAAO,KAAK;AAGhB,UAAI,MAAM;AACV,UAAI,MAAM;AACV,UAAI,MAAM,GAAG,MAAM;AACnB,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,OAAO;AACX,UAAI,aAAa;AAEjB,UAAI;AACJ,UAAI,QAAQ,IAAI,MAAM,MAAM,UAAU,CAAC;AACvC,UAAI,OAAO,IAAI,MAAM,MAAM,UAAU,CAAC;AACtC,UAAI,QAAQ;AACZ,UAAI,cAAc;AAElB,UAAI,WAAW,SAAS;AAkCxB,WAAK,MAAM,GAAG,OAAO,SAAS,OAAO;AACnC,cAAM,GAAG,IAAI;AAAA,MACjB;AACE,WAAK,MAAM,GAAG,MAAM,OAAO,OAAO;AAChC,cAAM,KAAK,aAAa,GAAG,CAAC;AAAA,MAChC;AAGE,aAAO;AACP,WAAK,MAAM,SAAS,OAAO,GAAG,OAAO;AACnC,YAAI,MAAM,GAAG,MAAM,GAAG;AAAE;AAAA,QAAM;AAAA,MAClC;AACE,UAAI,OAAO,KAAK;AACd,eAAO;AAAA,MACX;AACE,UAAI,QAAQ,GAAG;AAIb,cAAM,aAAa,IAAK,KAAK,KAAO,MAAM,KAAM;AAMhD,cAAM,aAAa,IAAK,KAAK,KAAO,MAAM,KAAM;AAEhD,aAAK,OAAO;AACZ,eAAO;AAAA,MACX;AACE,WAAK,MAAM,GAAG,MAAM,KAAK,OAAO;AAC9B,YAAI,MAAM,GAAG,MAAM,GAAG;AAAE;AAAA,QAAM;AAAA,MAClC;AACE,UAAI,OAAO,KAAK;AACd,eAAO;AAAA,MACX;AAGE,aAAO;AACP,WAAK,MAAM,GAAG,OAAO,SAAS,OAAO;AACnC,iBAAS;AACT,gBAAQ,MAAM,GAAG;AACjB,YAAI,OAAO,GAAG;AACZ,iBAAO;AAAA,QACR;AAAA,MACL;AACE,UAAI,OAAO,MAAM,SAAS,SAAS,QAAQ,IAAI;AAC7C,eAAO;AAAA,MACX;AAGE,WAAK,CAAC,IAAI;AACV,WAAK,MAAM,GAAG,MAAM,SAAS,OAAO;AAClC,aAAK,MAAM,CAAC,IAAI,KAAK,GAAG,IAAI,MAAM,GAAG;AAAA,MACzC;AAGE,WAAK,MAAM,GAAG,MAAM,OAAO,OAAO;AAChC,YAAI,KAAK,aAAa,GAAG,MAAM,GAAG;AAChC,eAAK,KAAK,KAAK,aAAa,GAAG,CAAC,GAAG,IAAI;AAAA,QAC7C;AAAA,MACA;AAoCE,UAAI,SAAS,OAAO;AAClB,eAAO,QAAQ;AACf,cAAM;AAAA,MAEV,WAAa,SAAS,MAAM;AACxB,eAAO;AACP,sBAAc;AACd,gBAAQ;AACR,uBAAe;AACf,cAAM;AAAA,MAEV,OAAS;AACL,eAAO;AACP,gBAAQ;AACR,cAAM;AAAA,MACV;AAGE,aAAO;AACP,YAAM;AACN,YAAM;AACN,aAAO;AACP,aAAO;AACP,aAAO;AACP,YAAM;AACN,aAAO,KAAK;AACZ,aAAO,OAAO;AAGd,UAAK,SAAS,QAAQ,OAAO,eAC1B,SAAS,SAAS,OAAO,cAAe;AACzC,eAAO;AAAA,MACX;AAGE,iBAAS;AAEP,oBAAY,MAAM;AAClB,YAAI,KAAK,GAAG,IAAI,KAAK;AACnB,oBAAU;AACV,qBAAW,KAAK,GAAG;AAAA,QACzB,WACa,KAAK,GAAG,IAAI,KAAK;AACxB,oBAAU,MAAM,cAAc,KAAK,GAAG,CAAC;AACvC,qBAAW,KAAK,aAAa,KAAK,GAAG,CAAC;AAAA,QAC5C,OACS;AACH,oBAAU,KAAK;AACf,qBAAW;AAAA,QACjB;AAGI,eAAO,KAAM,MAAM;AACnB,eAAO,KAAK;AACZ,cAAM;AACN,WAAG;AACD,kBAAQ;AACR,gBAAM,QAAQ,QAAQ,QAAQ,IAAI,IAAK,aAAa,KAAO,WAAW,KAAM,WAAU;AAAA,QACvF,SAAQ,SAAS;AAGlB,eAAO,KAAM,MAAM;AACnB,eAAO,OAAO,MAAM;AAClB,mBAAS;AAAA,QACf;AACI,YAAI,SAAS,GAAG;AACd,kBAAQ,OAAO;AACf,kBAAQ;AAAA,QACd,OAAW;AACL,iBAAO;AAAA,QACb;AAGI;AACA,YAAI,EAAE,MAAM,GAAG,MAAM,GAAG;AACtB,cAAI,QAAQ,KAAK;AAAE;AAAA,UAAM;AACzB,gBAAM,KAAK,aAAa,KAAK,GAAG,CAAC;AAAA,QACvC;AAGI,YAAI,MAAM,SAAS,OAAO,UAAU,KAAK;AAEvC,cAAI,SAAS,GAAG;AACd,mBAAO;AAAA,UACf;AAGM,kBAAQ;AAGR,iBAAO,MAAM;AACb,iBAAO,KAAK;AACZ,iBAAO,OAAO,OAAO,KAAK;AACxB,oBAAQ,MAAM,OAAO,IAAI;AACzB,gBAAI,QAAQ,GAAG;AAAE;AAAA,YAAM;AACvB;AACA,qBAAS;AAAA,UACjB;AAGM,kBAAQ,KAAK;AACb,cAAK,SAAS,QAAQ,OAAO,eAC1B,SAAS,SAAS,OAAO,cAAe;AACzC,mBAAO;AAAA,UACf;AAGM,gBAAM,OAAO;AAIb,gBAAM,GAAG,IAAK,QAAQ,KAAO,QAAQ,KAAO,OAAO,cAAc;AAAA,QACvE;AAAA,MACA;AAKE,UAAI,SAAS,GAAG;AAId,cAAM,OAAO,IAAI,IAAM,MAAM,QAAS,KAAO,MAAM,KAAK;AAAA,MAC5D;AAIE,WAAK,OAAO;AACZ,aAAO;AAAA,IACR;;;;;;;ACjUD,QAAI,QAAgBA,cAA0B;AAC9C,QAAI,UAAgBM,eAAoB;AACxC,QAAIgB,SAAgBf,aAAkB;AACtC,QAAI,eAAgBC,eAAoB;AACxC,QAAI,gBAAgBgB,gBAAqB;AAEzC,QAAI,QAAQ;AACZ,QAAI,OAAO;AACX,QAAI,QAAQ;AAWZ,QAAI,WAAkB;AACtB,QAAI,UAAkB;AACtB,QAAI,UAAkB;AAMtB,QAAI,OAAkB;AACtB,QAAI,eAAkB;AACtB,QAAI,cAAkB;AAEtB,QAAI,iBAAkB;AACtB,QAAI,eAAkB;AACtB,QAAI,cAAkB;AACtB,QAAI,cAAkB;AAItB,QAAI,aAAc;AAOlB,QAAO,OAAO;AACd,QAAO,QAAQ;AACf,QAAO,OAAO;AACd,QAAO,KAAK;AACZ,QAAO,QAAQ;AACf,QAAO,QAAQ;AACf,QAAO,OAAO;AACd,QAAO,UAAU;AACjB,QAAO,OAAO;AACd,QAAO,SAAS;AAChB,QAAO,OAAO;AACd,QAAW,OAAO;AAClB,QAAW,SAAS;AACpB,QAAW,SAAS;AACpB,QAAW,QAAQ;AACnB,QAAW,OAAO;AAClB,QAAW,QAAQ;AACnB,QAAW,UAAU;AACrB,QAAW,WAAW;AACtB,QAAe,OAAO;AACtB,QAAe,MAAM;AACrB,QAAe,SAAS;AACxB,QAAe,OAAO;AACtB,QAAe,UAAU;AACzB,QAAe,QAAQ;AACvB,QAAe,MAAM;AACrB,QAAO,QAAQ;AACf,QAAO,SAAS;AAChB,QAAO,OAAO;AACd,QAAO,MAAM;AACb,QAAO,MAAM;AACb,QAAO,OAAO;AAMd,QAAI,cAAc;AAClB,QAAI,eAAe;AAGnB,QAAI,YAAY;AAEhB,QAAI,YAAY;AAGhB,aAAS,QAAQ,GAAG;AAClB,cAAW,MAAM,KAAM,QACb,MAAM,IAAK,WACX,IAAI,UAAW,OACf,IAAI,QAAS;AAAA,IACzB;AAGA,aAAS,eAAe;AACtB,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,WAAW;AAChB,WAAK,QAAQ;AACb,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,QAAQ;AAEb,WAAK,OAAO;AAGZ,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,WAAK,SAAS;AAGd,WAAK,OAAO;AACZ,WAAK,OAAO;AAGZ,WAAK,SAAS;AACd,WAAK,SAAS;AAGd,WAAK,QAAQ;AAGb,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,UAAU;AACf,WAAK,WAAW;AAGhB,WAAK,QAAQ;AACb,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,OAAO;AACZ,WAAK,OAAO;AAEZ,WAAK,OAAO,IAAI,MAAM,MAAM,GAAG;AAC/B,WAAK,OAAO,IAAI,MAAM,MAAM,GAAG;AAO/B,WAAK,SAAS;AACd,WAAK,UAAU;AACf,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,MAAM;AAAA,IACb;AAEA,aAAS,iBAAiB,MAAM;AAC9B,UAAI;AAEJ,UAAI,CAAC,QAAQ,CAAC,KAAK,OAAO;AAAE,eAAO;AAAA,MAAe;AAClD,cAAQ,KAAK;AACb,WAAK,WAAW,KAAK,YAAY,MAAM,QAAQ;AAC/C,WAAK,MAAM;AACX,UAAI,MAAM,MAAM;AACd,aAAK,QAAQ,MAAM,OAAO;AAAA,MAC9B;AACE,YAAM,OAAO;AACb,YAAM,OAAO;AACb,YAAM,WAAW;AACjB,YAAM,OAAO;AACb,YAAM,OAAO;AACb,YAAM,OAAO;AACb,YAAM,OAAO;AAEb,YAAM,UAAU,MAAM,SAAS,IAAI,MAAM,MAAM,WAAW;AAC1D,YAAM,WAAW,MAAM,UAAU,IAAI,MAAM,MAAM,YAAY;AAE7D,YAAM,OAAO;AACb,YAAM,OAAO;AAEb,aAAO;AAAA,IACT;AAEA,aAAS,aAAa,MAAM;AAC1B,UAAI;AAEJ,UAAI,CAAC,QAAQ,CAAC,KAAK,OAAO;AAAE,eAAO;AAAA,MAAe;AAClD,cAAQ,KAAK;AACb,YAAM,QAAQ;AACd,YAAM,QAAQ;AACd,YAAM,QAAQ;AACd,aAAO,iBAAiB,IAAI;AAAA,IAE9B;AAEA,aAAS,cAAc,MAAM,YAAY;AACvC,UAAI;AACJ,UAAI;AAGJ,UAAI,CAAC,QAAQ,CAAC,KAAK,OAAO;AAAE,eAAO;AAAA,MAAe;AAClD,cAAQ,KAAK;AAGb,UAAI,aAAa,GAAG;AAClB,eAAO;AACP,qBAAa,CAAC;AAAA,MAClB,OACO;AACH,gBAAQ,cAAc,KAAK;AAC3B,YAAI,aAAa,IAAI;AACnB,wBAAc;AAAA,QACpB;AAAA,MACA;AAGE,UAAI,eAAe,aAAa,KAAK,aAAa,KAAK;AACrD,eAAO;AAAA,MACX;AACE,UAAI,MAAM,WAAW,QAAQ,MAAM,UAAU,YAAY;AACvD,cAAM,SAAS;AAAA,MACnB;AAGE,YAAM,OAAO;AACb,YAAM,QAAQ;AACd,aAAO,aAAa,IAAI;AAAA,IAC1B;AAEA,aAAS,aAAa,MAAM,YAAY;AACtC,UAAI;AACJ,UAAI;AAEJ,UAAI,CAAC,MAAM;AAAE,eAAO;AAAA,MAAe;AAGnC,cAAQ,IAAI,aAAc;AAI1B,WAAK,QAAQ;AACb,YAAM,SAAS;AACf,YAAM,cAAc,MAAM,UAAU;AACpC,UAAI,QAAQ,MAAM;AAChB,aAAK,QAAQ;AAAA,MACjB;AACE,aAAO;AAAA,IACT;AAEA,aAAS,YAAY,MAAM;AACzB,aAAO,aAAa,MAAM,SAAS;AAAA,IACrC;AAaA,QAAI,SAAS;AAEb,QAAI,QAAQ;AAEZ,aAAS,YAAY,OAAO;AAE1B,UAAI,QAAQ;AACV,YAAI;AAEJ,iBAAS,IAAI,MAAM,MAAM,GAAG;AAC5B,kBAAU,IAAI,MAAM,MAAM,EAAE;AAG5B,cAAM;AACN,eAAO,MAAM,KAAK;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAE;AAC1C,eAAO,MAAM,KAAK;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAE;AAC1C,eAAO,MAAM,KAAK;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAE;AAC1C,eAAO,MAAM,KAAK;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAE;AAE1C,sBAAc,MAAO,MAAM,MAAM,GAAG,KAAK,QAAU,GAAG,MAAM,MAAM,EAAE,MAAM,EAAC,CAAE;AAG7E,cAAM;AACN,eAAO,MAAM,IAAI;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAE;AAEzC,sBAAc,OAAO,MAAM,MAAM,GAAG,IAAM,SAAS,GAAG,MAAM,MAAM,EAAE,MAAM,EAAC,CAAE;AAG7E,iBAAS;AAAA,MACb;AAEE,YAAM,UAAU;AAChB,YAAM,UAAU;AAChB,YAAM,WAAW;AACjB,YAAM,WAAW;AAAA,IACnB;AAiBA,aAAS,aAAa,MAAM,KAAK,KAAK,MAAM;AAC1C,UAAI;AACJ,UAAI,QAAQ,KAAK;AAGjB,UAAI,MAAM,WAAW,MAAM;AACzB,cAAM,QAAQ,KAAK,MAAM;AACzB,cAAM,QAAQ;AACd,cAAM,QAAQ;AAEd,cAAM,SAAS,IAAI,MAAM,KAAK,MAAM,KAAK;AAAA,MAC7C;AAGE,UAAI,QAAQ,MAAM,OAAO;AACvB,cAAM,SAAS,MAAM,QAAQ,KAAK,MAAM,MAAM,OAAO,MAAM,OAAO,CAAC;AACnE,cAAM,QAAQ;AACd,cAAM,QAAQ,MAAM;AAAA,MACxB,OACO;AACH,eAAO,MAAM,QAAQ,MAAM;AAC3B,YAAI,OAAO,MAAM;AACf,iBAAO;AAAA,QACb;AAEI,cAAM,SAAS,MAAM,QAAQ,KAAK,MAAM,MAAM,MAAM,MAAM,KAAK;AAC/D,gBAAQ;AACR,YAAI,MAAM;AAER,gBAAM,SAAS,MAAM,QAAQ,KAAK,MAAM,MAAM,MAAM,CAAC;AACrD,gBAAM,QAAQ;AACd,gBAAM,QAAQ,MAAM;AAAA,QAC1B,OACS;AACH,gBAAM,SAAS;AACf,cAAI,MAAM,UAAU,MAAM,OAAO;AAAE,kBAAM,QAAQ;AAAA,UAAE;AACnD,cAAI,MAAM,QAAQ,MAAM,OAAO;AAAE,kBAAM,SAAS;AAAA,UAAK;AAAA,QAC3D;AAAA,MACA;AACE,aAAO;AAAA,IACT;AAEA,aAASI,WAAQ,MAAM,OAAO;AAC5B,UAAI;AACJ,UAAI,OAAO;AACX,UAAI;AACJ,UAAI;AACJ,UAAI,MAAM;AACV,UAAI;AACJ,UAAI;AACJ,UAAI,KAAK;AACT,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,OAAO;AACX,UAAI,WAAW,SAAS;AAExB,UAAI,WAAW,SAAS;AACxB,UAAI;AACJ,UAAI;AACJ,UAAI,OAAO,IAAI,MAAM,KAAK,CAAC;AAC3B,UAAI;AAEJ,UAAI;AAEJ,UAAI;AAAA;AAAA,QACF,CAAE,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,EAAI;AAAA;AAGtE,UAAI,CAAC,QAAQ,CAAC,KAAK,SAAS,CAAC,KAAK,UAC7B,CAAC,KAAK,SAAS,KAAK,aAAa,GAAI;AACxC,eAAO;AAAA,MACX;AAEE,cAAQ,KAAK;AACb,UAAI,MAAM,SAAS,MAAM;AAAE,cAAM,OAAO;AAAA,MAAS;AAIjD,YAAM,KAAK;AACX,eAAS,KAAK;AACd,aAAO,KAAK;AACZ,aAAO,KAAK;AACZ,cAAQ,KAAK;AACb,aAAO,KAAK;AACZ,aAAO,MAAM;AACb,aAAO,MAAM;AAGb,YAAM;AACN,aAAO;AACP,YAAM;AAEN;AACA,mBAAS;AACP,kBAAQ,MAAM,MAAI;AAAA,YAChB,KAAK;AACH,kBAAI,MAAM,SAAS,GAAG;AACpB,sBAAM,OAAO;AACb;AAAA,cACV;AAEQ,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAU;AAClC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cAClB;AAEQ,kBAAK,MAAM,OAAO,KAAM,SAAS,OAAQ;AACvC,sBAAM,QAAQ;AAEd,qBAAK,CAAC,IAAI,OAAO;AACjB,qBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,sBAAM,QAAQN,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAI3C,uBAAO;AACP,uBAAO;AAEP,sBAAM,OAAO;AACb;AAAA,cACV;AACQ,oBAAM,QAAQ;AACd,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,OAAO;AAAA,cAC5B;AACQ,kBAAI,EAAE,MAAM,OAAO;AAAA,iBACd,OAAO,QAAoB,MAAM,QAAQ,MAAM,IAAI;AACtD,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACV;AACQ,mBAAK,OAAO,QAAqB,YAAY;AAC3C,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACV;AAEQ,wBAAU;AACV,sBAAQ;AAER,qBAAO,OAAO,MAAmB;AACjC,kBAAI,MAAM,UAAU,GAAG;AACrB,sBAAM,QAAQ;AAAA,cACxB,WACiB,MAAM,MAAM,OAAO;AAC1B,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACV;AACQ,oBAAM,OAAO,KAAK;AAElB,mBAAK,QAAQ,MAAM,QAAQ;AAC3B,oBAAM,OAAO,OAAO,MAAQ,SAAS;AAErC,qBAAO;AACP,qBAAO;AAEP;AAAA,YACF,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAU;AAClC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cAClB;AAEQ,oBAAM,QAAQ;AACd,mBAAK,MAAM,QAAQ,SAAU,YAAY;AACvC,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACV;AACQ,kBAAI,MAAM,QAAQ,OAAQ;AACxB,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACV;AACQ,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,OAAS,QAAQ,IAAK;AAAA,cAC3C;AACQ,kBAAI,MAAM,QAAQ,KAAQ;AAExB,qBAAK,CAAC,IAAI,OAAO;AACjB,qBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,sBAAM,QAAQA,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAAA,cAErD;AAEQ,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAU;AAClC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cAClB;AAEQ,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,OAAO;AAAA,cAC5B;AACQ,kBAAI,MAAM,QAAQ,KAAQ;AAExB,qBAAK,CAAC,IAAI,OAAO;AACjB,qBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,qBAAK,CAAC,IAAK,SAAS,KAAM;AAC1B,qBAAK,CAAC,IAAK,SAAS,KAAM;AAC1B,sBAAM,QAAQA,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAAA,cAErD;AAEQ,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAU;AAClC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cAClB;AAEQ,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,SAAU,OAAO;AAC5B,sBAAM,KAAK,KAAM,QAAQ;AAAA,cACnC;AACQ,kBAAI,MAAM,QAAQ,KAAQ;AAExB,qBAAK,CAAC,IAAI,OAAO;AACjB,qBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,sBAAM,QAAQA,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAAA,cAErD;AAEQ,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAQ;AAExB,uBAAO,OAAO,IAAI;AAChB,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAU;AAClC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACpB;AAEU,sBAAM,SAAS;AACf,oBAAI,MAAM,MAAM;AACd,wBAAM,KAAK,YAAY;AAAA,gBACnC;AACU,oBAAI,MAAM,QAAQ,KAAQ;AAExB,uBAAK,CAAC,IAAI,OAAO;AACjB,uBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,wBAAM,QAAQA,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAAA,gBAEvD;AAEU,uBAAO;AACP,uBAAO;AAAA,cAEjB,WACiB,MAAM,MAAM;AACnB,sBAAM,KAAK,QAAQ;AAAA,cAC7B;AACQ,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAQ;AACxB,uBAAO,MAAM;AACb,oBAAI,OAAO,MAAM;AAAE,yBAAO;AAAA,gBAAK;AAC/B,oBAAI,MAAM;AACR,sBAAI,MAAM,MAAM;AACd,0BAAM,MAAM,KAAK,YAAY,MAAM;AACnC,wBAAI,CAAC,MAAM,KAAK,OAAO;AAErB,4BAAM,KAAK,QAAQ,IAAI,MAAM,MAAM,KAAK,SAAS;AAAA,oBACjE;AACc,0BAAM;AAAA,sBACJ,MAAM,KAAK;AAAA,sBACX;AAAA,sBACA;AAAA;AAAA;AAAA,sBAGA;AAAA;AAAA,sBAEA;AAAA,oBACD;AAAA,kBAIf;AACY,sBAAI,MAAM,QAAQ,KAAQ;AACxB,0BAAM,QAAQA,OAAM,MAAM,OAAO,OAAO,MAAM,IAAI;AAAA,kBAChE;AACY,0BAAQ;AACR,0BAAQ;AACR,wBAAM,UAAU;AAAA,gBAC5B;AACU,oBAAI,MAAM,QAAQ;AAAE,wBAAM;AAAA,gBAAU;AAAA,cAC9C;AACQ,oBAAM,SAAS;AACf,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAQ;AACxB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAU;AAClC,uBAAO;AACP,mBAAG;AAED,wBAAM,MAAM,OAAO,MAAM;AAEzB,sBAAI,MAAM,QAAQ,OACb,MAAM,SAAS,OAAgC;AAClD,0BAAM,KAAK,QAAQ,OAAO,aAAa,GAAG;AAAA,kBACxD;AAAA,gBACA,SAAmB,OAAO,OAAO;AAEvB,oBAAI,MAAM,QAAQ,KAAQ;AACxB,wBAAM,QAAQA,OAAM,MAAM,OAAO,OAAO,MAAM,IAAI;AAAA,gBAC9D;AACU,wBAAQ;AACR,wBAAQ;AACR,oBAAI,KAAK;AAAE,wBAAM;AAAA,gBAAU;AAAA,cACrC,WACiB,MAAM,MAAM;AACnB,sBAAM,KAAK,OAAO;AAAA,cAC5B;AACQ,oBAAM,SAAS;AACf,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAQ;AACxB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAU;AAClC,uBAAO;AACP,mBAAG;AACD,wBAAM,MAAM,OAAO,MAAM;AAEzB,sBAAI,MAAM,QAAQ,OACb,MAAM,SAAS,OAAgC;AAClD,0BAAM,KAAK,WAAW,OAAO,aAAa,GAAG;AAAA,kBAC3D;AAAA,gBACA,SAAmB,OAAO,OAAO;AACvB,oBAAI,MAAM,QAAQ,KAAQ;AACxB,wBAAM,QAAQA,OAAM,MAAM,OAAO,OAAO,MAAM,IAAI;AAAA,gBAC9D;AACU,wBAAQ;AACR,wBAAQ;AACR,oBAAI,KAAK;AAAE,wBAAM;AAAA,gBAAU;AAAA,cACrC,WACiB,MAAM,MAAM;AACnB,sBAAM,KAAK,UAAU;AAAA,cAC/B;AACQ,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,KAAQ;AAExB,uBAAO,OAAO,IAAI;AAChB,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAU;AAClC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACpB;AAEU,oBAAI,UAAU,MAAM,QAAQ,QAAS;AACnC,uBAAK,MAAM;AACX,wBAAM,OAAO;AACb;AAAA,gBACZ;AAEU,uBAAO;AACP,uBAAO;AAAA,cAEjB;AACQ,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,OAAS,MAAM,SAAS,IAAK;AACxC,sBAAM,KAAK,OAAO;AAAA,cAC5B;AACQ,mBAAK,QAAQ,MAAM,QAAQ;AAC3B,oBAAM,OAAO;AACb;AAAA,YACF,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAU;AAClC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cAClB;AAEQ,mBAAK,QAAQ,MAAM,QAAQ,QAAQ,IAAI;AAEvC,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,aAAa,GAAG;AAExB,qBAAK,WAAW;AAChB,qBAAK,YAAY;AACjB,qBAAK,UAAU;AACf,qBAAK,WAAW;AAChB,sBAAM,OAAO;AACb,sBAAM,OAAO;AAEb,uBAAO;AAAA,cACjB;AACQ,mBAAK,QAAQ,MAAM,QAAQ;AAC3B,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,UAAU,WAAW,UAAU,SAAS;AAAE,sBAAM;AAAA,cAAU;AAAA;AAAA,YAEhE,KAAK;AACH,kBAAI,MAAM,MAAM;AAEd,0BAAU,OAAO;AACjB,wBAAQ,OAAO;AAEf,sBAAM,OAAO;AACb;AAAA,cACV;AAEQ,qBAAO,OAAO,GAAG;AACf,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAU;AAClC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cAClB;AAEQ,oBAAM,OAAQ,OAAO;AAErB,wBAAU;AACV,sBAAQ;AAGR,sBAAS,OAAO,GAAI;AAAA,gBAClB,KAAK;AAGH,wBAAM,OAAO;AACb;AAAA,gBACF,KAAK;AACH,8BAAY,KAAK;AAGjB,wBAAM,OAAO;AACb,sBAAI,UAAU,SAAS;AAErB,8BAAU;AACV,4BAAQ;AAER,0BAAM;AAAA,kBACpB;AACY;AAAA,gBACF,KAAK;AAGH,wBAAM,OAAO;AACb;AAAA,gBACF,KAAK;AACH,uBAAK,MAAM;AACX,wBAAM,OAAO;AAAA,cACzB;AAEQ,wBAAU;AACV,sBAAQ;AAER;AAAA,YACF,KAAK;AAEH,wBAAU,OAAO;AACjB,sBAAQ,OAAO;AAGf,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAU;AAClC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cAClB;AAEQ,mBAAK,OAAO,YAAc,SAAS,KAAM,QAAS;AAChD,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACV;AACQ,oBAAM,SAAS,OAAO;AAItB,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AACb,kBAAI,UAAU,SAAS;AAAE,sBAAM;AAAA,cAAU;AAAA;AAAA,YAE3C,KAAK;AACH,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,qBAAO,MAAM;AACb,kBAAI,MAAM;AACR,oBAAI,OAAO,MAAM;AAAE,yBAAO;AAAA,gBAAK;AAC/B,oBAAI,OAAO,MAAM;AAAE,yBAAO;AAAA,gBAAK;AAC/B,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAU;AAElC,sBAAM,SAAS,QAAQ,OAAO,MAAM,MAAM,GAAG;AAE7C,wBAAQ;AACR,wBAAQ;AACR,wBAAQ;AACR,uBAAO;AACP,sBAAM,UAAU;AAChB;AAAA,cACV;AAEQ,oBAAM,OAAO;AACb;AAAA,YACF,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAU;AAClC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cAClB;AAEQ,oBAAM,QAAQ,OAAO,MAAmB;AAExC,wBAAU;AACV,sBAAQ;AAER,oBAAM,SAAS,OAAO,MAAmB;AAEzC,wBAAU;AACV,sBAAQ;AAER,oBAAM,SAAS,OAAO,MAAmB;AAEzC,wBAAU;AACV,sBAAQ;AAGR,kBAAI,MAAM,OAAO,OAAO,MAAM,QAAQ,IAAI;AACxC,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACV;AAGQ,oBAAM,OAAO;AACb,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,qBAAO,MAAM,OAAO,MAAM,OAAO;AAE/B,uBAAO,OAAO,GAAG;AACf,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAU;AAClC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACpB;AAEU,sBAAM,KAAK,MAAM,MAAM,MAAM,CAAC,IAAK,OAAO;AAE1C,0BAAU;AACV,wBAAQ;AAAA,cAElB;AACQ,qBAAO,MAAM,OAAO,IAAI;AACtB,sBAAM,KAAK,MAAM,MAAM,MAAM,CAAC,IAAI;AAAA,cAC5C;AAKQ,oBAAM,UAAU,MAAM;AACtB,oBAAM,UAAU;AAEhB,qBAAO,EAAE,MAAM,MAAM,QAAS;AAC9B,oBAAM,cAAc,OAAO,MAAM,MAAM,GAAG,IAAI,MAAM,SAAS,GAAG,MAAM,MAAM,IAAI;AAChF,oBAAM,UAAU,KAAK;AAErB,kBAAI,KAAK;AACP,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACV;AAEQ,oBAAM,OAAO;AACb,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,qBAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AAC5C,2BAAS;AACP,yBAAO,MAAM,QAAQ,QAAS,KAAK,MAAM,WAAW,CAAE;AACtD,8BAAY,SAAS;AACrB,4BAAW,SAAS,KAAM;AAC1B,6BAAW,OAAO;AAElB,sBAAK,aAAc,MAAM;AAAE;AAAA,kBAAM;AAEjC,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAU;AAClC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBAEpB;AACU,oBAAI,WAAW,IAAI;AAEjB,4BAAU;AACV,0BAAQ;AAER,wBAAM,KAAK,MAAM,MAAM,IAAI;AAAA,gBACvC,OACe;AACH,sBAAI,aAAa,IAAI;AAEnB,wBAAI,YAAY;AAChB,2BAAO,OAAO,GAAG;AACf,0BAAI,SAAS,GAAG;AAAE,8BAAM;AAAA,sBAAU;AAClC;AACA,8BAAQ,MAAM,MAAM,KAAK;AACzB,8BAAQ;AAAA,oBACxB;AAGc,8BAAU;AACV,4BAAQ;AAER,wBAAI,MAAM,SAAS,GAAG;AACpB,2BAAK,MAAM;AACX,4BAAM,OAAO;AACb;AAAA,oBAChB;AACc,0BAAM,MAAM,KAAK,MAAM,OAAO,CAAC;AAC/B,2BAAO,KAAK,OAAO;AAEnB,8BAAU;AACV,4BAAQ;AAAA,kBAEtB,WACqB,aAAa,IAAI;AAExB,wBAAI,YAAY;AAChB,2BAAO,OAAO,GAAG;AACf,0BAAI,SAAS,GAAG;AAAE,8BAAM;AAAA,sBAAU;AAClC;AACA,8BAAQ,MAAM,MAAM,KAAK;AACzB,8BAAQ;AAAA,oBACxB;AAGc,8BAAU;AACV,4BAAQ;AAER,0BAAM;AACN,2BAAO,KAAK,OAAO;AAEnB,8BAAU;AACV,4BAAQ;AAAA,kBAEtB,OACiB;AAEH,wBAAI,YAAY;AAChB,2BAAO,OAAO,GAAG;AACf,0BAAI,SAAS,GAAG;AAAE,8BAAM;AAAA,sBAAU;AAClC;AACA,8BAAQ,MAAM,MAAM,KAAK;AACzB,8BAAQ;AAAA,oBACxB;AAGc,8BAAU;AACV,4BAAQ;AAER,0BAAM;AACN,2BAAO,MAAM,OAAO;AAEpB,8BAAU;AACV,4BAAQ;AAAA,kBAEtB;AACY,sBAAI,MAAM,OAAO,OAAO,MAAM,OAAO,MAAM,OAAO;AAChD,yBAAK,MAAM;AACX,0BAAM,OAAO;AACb;AAAA,kBACd;AACY,yBAAO,QAAQ;AACb,0BAAM,KAAK,MAAM,MAAM,IAAI;AAAA,kBACzC;AAAA,gBACA;AAAA,cACA;AAGQ,kBAAI,MAAM,SAAS,KAAK;AAAE;AAAA,cAAM;AAGhC,kBAAI,MAAM,KAAK,GAAG,MAAM,GAAG;AACzB,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACV;AAKQ,oBAAM,UAAU;AAEhB,qBAAO,EAAE,MAAM,MAAM,QAAS;AAC9B,oBAAM,cAAc,MAAM,MAAM,MAAM,GAAG,MAAM,MAAM,MAAM,SAAS,GAAG,MAAM,MAAM,IAAI;AAGvF,oBAAM,UAAU,KAAK;AAGrB,kBAAI,KAAK;AACP,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACV;AAEQ,oBAAM,WAAW;AAGjB,oBAAM,WAAW,MAAM;AACvB,qBAAO,EAAE,MAAM,MAAM,SAAU;AAC/B,oBAAM,cAAc,OAAO,MAAM,MAAM,MAAM,MAAM,MAAM,OAAO,MAAM,UAAU,GAAG,MAAM,MAAM,IAAI;AAGnG,oBAAM,WAAW,KAAK;AAGtB,kBAAI,KAAK;AACP,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACV;AAEQ,oBAAM,OAAO;AACb,kBAAI,UAAU,SAAS;AAAE,sBAAM;AAAA,cAAU;AAAA;AAAA,YAE3C,KAAK;AACH,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,QAAQ,KAAK,QAAQ,KAAK;AAE5B,qBAAK,WAAW;AAChB,qBAAK,YAAY;AACjB,qBAAK,UAAU;AACf,qBAAK,WAAW;AAChB,sBAAM,OAAO;AACb,sBAAM,OAAO;AAEb,6BAAa,MAAM,IAAI;AAEvB,sBAAM,KAAK;AACX,yBAAS,KAAK;AACd,uBAAO,KAAK;AACZ,uBAAO,KAAK;AACZ,wBAAQ,KAAK;AACb,uBAAO,KAAK;AACZ,uBAAO,MAAM;AACb,uBAAO,MAAM;AAGb,oBAAI,MAAM,SAAS,MAAM;AACvB,wBAAM,OAAO;AAAA,gBACzB;AACU;AAAA,cACV;AACQ,oBAAM,OAAO;AACb,yBAAS;AACP,uBAAO,MAAM,QAAQ,QAAS,KAAK,MAAM,WAAW,CAAE;AACtD,4BAAY,SAAS;AACrB,0BAAW,SAAS,KAAM;AAC1B,2BAAW,OAAO;AAElB,oBAAI,aAAa,MAAM;AAAE;AAAA,gBAAM;AAE/B,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAU;AAClC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cAElB;AACQ,kBAAI,YAAY,UAAU,SAAU,GAAG;AACrC,4BAAY;AACZ,0BAAU;AACV,2BAAW;AACX,2BAAS;AACP,yBAAO,MAAM,QAAQ,aACX,QAAS,KAAM,YAAY,WAAY,MAAoC,UAAU;AAC/F,8BAAY,SAAS;AACrB,4BAAW,SAAS,KAAM;AAC1B,6BAAW,OAAO;AAElB,sBAAK,YAAY,aAAc,MAAM;AAAE;AAAA,kBAAM;AAE7C,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAU;AAClC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBAEpB;AAEU,0BAAU;AACV,wBAAQ;AAER,sBAAM,QAAQ;AAAA,cACxB;AAEQ,wBAAU;AACV,sBAAQ;AAER,oBAAM,QAAQ;AACd,oBAAM,SAAS;AACf,kBAAI,YAAY,GAAG;AAIjB,sBAAM,OAAO;AACb;AAAA,cACV;AACQ,kBAAI,UAAU,IAAI;AAEhB,sBAAM,OAAO;AACb,sBAAM,OAAO;AACb;AAAA,cACV;AACQ,kBAAI,UAAU,IAAI;AAChB,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACV;AACQ,oBAAM,QAAQ,UAAU;AACxB,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,OAAO;AAEf,oBAAI,MAAM;AACV,uBAAO,OAAO,GAAG;AACf,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAU;AAClC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACpB;AAEU,sBAAM,UAAU,QAAS,KAAK,MAAM,SAAS;AAE7C,0BAAU,MAAM;AAChB,wBAAQ,MAAM;AAEd,sBAAM,QAAQ,MAAM;AAAA,cAC9B;AAEQ,oBAAM,MAAM,MAAM;AAClB,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,yBAAS;AACP,uBAAO,MAAM,SAAS,QAAS,KAAK,MAAM,YAAY,CAAE;AACxD,4BAAY,SAAS;AACrB,0BAAW,SAAS,KAAM;AAC1B,2BAAW,OAAO;AAElB,oBAAK,aAAc,MAAM;AAAE;AAAA,gBAAM;AAEjC,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAU;AAClC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cAElB;AACQ,mBAAK,UAAU,SAAU,GAAG;AAC1B,4BAAY;AACZ,0BAAU;AACV,2BAAW;AACX,2BAAS;AACP,yBAAO,MAAM,SAAS,aACZ,QAAS,KAAM,YAAY,WAAY,MAAoC,UAAU;AAC/F,8BAAY,SAAS;AACrB,4BAAW,SAAS,KAAM;AAC1B,6BAAW,OAAO;AAElB,sBAAK,YAAY,aAAc,MAAM;AAAE;AAAA,kBAAM;AAE7C,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAU;AAClC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBAEpB;AAEU,0BAAU;AACV,wBAAQ;AAER,sBAAM,QAAQ;AAAA,cACxB;AAEQ,wBAAU;AACV,sBAAQ;AAER,oBAAM,QAAQ;AACd,kBAAI,UAAU,IAAI;AAChB,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACV;AACQ,oBAAM,SAAS;AACf,oBAAM,QAAS,UAAW;AAC1B,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,OAAO;AAEf,oBAAI,MAAM;AACV,uBAAO,OAAO,GAAG;AACf,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAU;AAClC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACpB;AAEU,sBAAM,UAAU,QAAS,KAAK,MAAM,SAAS;AAE7C,0BAAU,MAAM;AAChB,wBAAQ,MAAM;AAEd,sBAAM,QAAQ,MAAM;AAAA,cAC9B;AAEQ,kBAAI,MAAM,SAAS,MAAM,MAAM;AAC7B,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACV;AAGQ,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,SAAS,GAAG;AAAE,sBAAM;AAAA,cAAU;AAClC,qBAAO,OAAO;AACd,kBAAI,MAAM,SAAS,MAAM;AACvB,uBAAO,MAAM,SAAS;AACtB,oBAAI,OAAO,MAAM,OAAO;AACtB,sBAAI,MAAM,MAAM;AACd,yBAAK,MAAM;AACX,0BAAM,OAAO;AACb;AAAA,kBACd;AAAA,gBAgBA;AACU,oBAAI,OAAO,MAAM,OAAO;AACtB,0BAAQ,MAAM;AACd,yBAAO,MAAM,QAAQ;AAAA,gBACjC,OACe;AACH,yBAAO,MAAM,QAAQ;AAAA,gBACjC;AACU,oBAAI,OAAO,MAAM,QAAQ;AAAE,yBAAO,MAAM;AAAA,gBAAO;AAC/C,8BAAc,MAAM;AAAA,cAC9B,OACa;AACH,8BAAc;AACd,uBAAO,MAAM,MAAM;AACnB,uBAAO,MAAM;AAAA,cACvB;AACQ,kBAAI,OAAO,MAAM;AAAE,uBAAO;AAAA,cAAK;AAC/B,sBAAQ;AACR,oBAAM,UAAU;AAChB,iBAAG;AACD,uBAAO,KAAK,IAAI,YAAY,MAAM;AAAA,cACnC,SAAQ,EAAE;AACX,kBAAI,MAAM,WAAW,GAAG;AAAE,sBAAM,OAAO;AAAA,cAAI;AAC3C;AAAA,YACF,KAAK;AACH,kBAAI,SAAS,GAAG;AAAE,sBAAM;AAAA,cAAU;AAClC,qBAAO,KAAK,IAAI,MAAM;AACtB;AACA,oBAAM,OAAO;AACb;AAAA,YACF,KAAK;AACH,kBAAI,MAAM,MAAM;AAEd,uBAAO,OAAO,IAAI;AAChB,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAU;AAClC;AAEA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACpB;AAEU,wBAAQ;AACR,qBAAK,aAAa;AAClB,sBAAM,SAAS;AACf,oBAAI,MAAM;AACR,uBAAK,QAAQ,MAAM;AAAA,kBAEd,MAAM,QAAQA,OAAM,MAAM,OAAO,QAAQ,MAAM,MAAM,IAAI,IAAI,QAAQ,MAAM,OAAO,QAAQ,MAAM,MAAM,IAAI;AAAA,gBAE3H;AACU,uBAAO;AAEP,qBAAK,MAAM,QAAQ,OAAO,QAAQ,IAAI,OAAO,MAAM,OAAO;AACxD,uBAAK,MAAM;AACX,wBAAM,OAAO;AACb;AAAA,gBACZ;AAEU,uBAAO;AACP,uBAAO;AAAA,cAGjB;AACQ,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAM,OAAO;AAE7B,uBAAO,OAAO,IAAI;AAChB,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAU;AAClC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACpB;AAEU,oBAAI,UAAU,MAAM,QAAQ,aAAa;AACvC,uBAAK,MAAM;AACX,wBAAM,OAAO;AACb;AAAA,gBACZ;AAEU,uBAAO;AACP,uBAAO;AAAA,cAGjB;AACQ,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,oBAAM;AACN,oBAAM;AAAA,YACR,KAAK;AACH,oBAAM;AACN,oBAAM;AAAA,YACR,KAAK;AACH,qBAAO;AAAA,YACT,KAAK;AAAA;AAAA,YAEL;AACE,qBAAO;AAAA,UACf;AAAA,QACA;AAYE,WAAK,WAAW;AAChB,WAAK,YAAY;AACjB,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,YAAM,OAAO;AACb,YAAM,OAAO;AAGb,UAAI,MAAM,SAAU,SAAS,KAAK,aAAa,MAAM,OAAO,QACvC,MAAM,OAAO,SAAS,UAAU,WAAY;AAC/D,YAAI,aAAa,MAAM,KAAK,QAAQ,KAAK,UAAU,OAAO,KAAK,SAAS,EAAG;AAAA,MAI/E;AACE,aAAO,KAAK;AACZ,cAAQ,KAAK;AACb,WAAK,YAAY;AACjB,WAAK,aAAa;AAClB,YAAM,SAAS;AACf,UAAI,MAAM,QAAQ,MAAM;AACtB,aAAK,QAAQ,MAAM;AAAA,QAChB,MAAM,QAAQA,OAAM,MAAM,OAAO,QAAQ,MAAM,KAAK,WAAW,IAAI,IAAI,QAAQ,MAAM,OAAO,QAAQ,MAAM,KAAK,WAAW,IAAI;AAAA,MACrI;AACE,WAAK,YAAY,MAAM,QAAQ,MAAM,OAAO,KAAK,MAC9B,MAAM,SAAS,OAAO,MAAM,MAC5B,MAAM,SAAS,QAAQ,MAAM,SAAS,QAAQ,MAAM;AACvE,WAAM,QAAQ,KAAK,SAAS,KAAM,UAAU,aAAa,QAAQ,MAAM;AACrE,cAAM;AAAA,MACV;AACE,aAAO;AAAA,IACT;AAEA,aAAS,WAAW,MAAM;AAExB,UAAI,CAAC,QAAQ,CAAC,KAAK,OAA0C;AAC3D,eAAO;AAAA,MACX;AAEE,UAAI,QAAQ,KAAK;AACjB,UAAI,MAAM,QAAQ;AAChB,cAAM,SAAS;AAAA,MACnB;AACE,WAAK,QAAQ;AACb,aAAO;AAAA,IACT;AAEA,aAAS,iBAAiB,MAAM,MAAM;AACpC,UAAI;AAGJ,UAAI,CAAC,QAAQ,CAAC,KAAK,OAAO;AAAE,eAAO;AAAA,MAAe;AAClD,cAAQ,KAAK;AACb,WAAK,MAAM,OAAO,OAAO,GAAG;AAAE,eAAO;AAAA,MAAe;AAGpD,YAAM,OAAO;AACb,WAAK,OAAO;AACZ,aAAO;AAAA,IACT;AAEA,aAAS,qBAAqB,MAAM,YAAY;AAC9C,UAAI,aAAa,WAAW;AAE5B,UAAI;AACJ,UAAI;AACJ,UAAI;AAGJ,UAAI,CAAC,QAAwB,CAAC,KAAK,OAAuB;AAAE,eAAO;AAAA,MAAe;AAClF,cAAQ,KAAK;AAEb,UAAI,MAAM,SAAS,KAAK,MAAM,SAAS,MAAM;AAC3C,eAAO;AAAA,MACX;AAGE,UAAI,MAAM,SAAS,MAAM;AACvB,iBAAS;AAET,iBAAS,QAAQ,QAAQ,YAAY,YAAY,CAAC;AAClD,YAAI,WAAW,MAAM,OAAO;AAC1B,iBAAO;AAAA,QACb;AAAA,MACA;AAGE,YAAM,aAAa,MAAM,YAAY,YAAY,UAAU;AAC3D,UAAI,KAAK;AACP,cAAM,OAAO;AACb,eAAO;AAAA,MACX;AACE,YAAM,WAAW;AAEjB,aAAO;AAAA,IACT;AAEAO,YAAA,eAAuB;AACvBA,YAAA,gBAAwB;AACxBA,YAAA,mBAA2B;AAC3BA,YAAA,cAAsB;AACtBA,YAAA,eAAuB;AACvBA,YAAA,UAAkBD;AAClBC,YAAA,aAAqB;AACrBA,YAAA,mBAA2B;AAC3BA,YAAA,uBAA+B;AAC/BA,YAAA,cAAsB;;;;;;;;ACp/CtB,gBAAiB;AAAA;AAAA,MAGf,YAAoB;AAAA,MACpB,iBAAoB;AAAA,MACpB,cAAoB;AAAA,MACpB,cAAoB;AAAA,MACpB,UAAoB;AAAA,MACpB,SAAoB;AAAA,MACpB,SAAoB;AAAA;AAAA;AAAA;AAAA,MAKpB,MAAoB;AAAA,MACpB,cAAoB;AAAA,MACpB,aAAoB;AAAA,MACpB,SAAmB;AAAA,MACnB,gBAAmB;AAAA,MACnB,cAAmB;AAAA;AAAA,MAEnB,aAAmB;AAAA;AAAA;AAAA,MAInB,kBAA0B;AAAA,MAC1B,cAA0B;AAAA,MAC1B,oBAA0B;AAAA,MAC1B,uBAAyB;AAAA,MAGzB,YAA0B;AAAA,MAC1B,gBAA0B;AAAA,MAC1B,OAA0B;AAAA,MAC1B,SAA0B;AAAA,MAC1B,oBAA0B;AAAA;AAAA,MAG1B,UAA0B;AAAA,MAC1B,QAA0B;AAAA;AAAA,MAE1B,WAA0B;AAAA;AAAA,MAG1B,YAA0B;AAAA;AAAA,IAE3B;;;;;;;;AC9CD,aAAS,WAAW;AAElB,WAAK,OAAa;AAElB,WAAK,OAAa;AAElB,WAAK,SAAa;AAElB,WAAK,KAAa;AAElB,WAAK,QAAa;AAElB,WAAK,YAAa;AAWlB,WAAK,OAAa;AAIlB,WAAK,UAAa;AAIlB,WAAK,OAAa;AAElB,WAAK,OAAa;AAAA,IACpB;AAEA,eAAiB;;;;;;;ACtDjB,QAAI,eAAe7B,iBAAyB;AAC5C,QAAI,QAAeM,cAAyB;AAC5C,QAAIqB,WAAepB,eAA0B;AAC7C,QAAI,IAAeC,iBAA2B;AAC9C,QAAI,MAAegB,gBAA0B;AAC7C,QAAI,UAAeM,eAAyB;AAC5C,QAAI,WAAeC,gBAA0B;AAE7C,QAAI,WAAW,OAAO,UAAU;AAiFhC,aAAS,QAAQ,SAAS;AACxB,UAAI,EAAE,gBAAgB,SAAU,QAAO,IAAI,QAAQ,OAAO;AAE1D,WAAK,UAAU,MAAM,OAAO;AAAA,QAC1B,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,IAAI;AAAA,MACR,GAAK,WAAW,CAAA,CAAE;AAEhB,UAAI,MAAM,KAAK;AAIf,UAAI,IAAI,OAAQ,IAAI,cAAc,KAAO,IAAI,aAAa,IAAK;AAC7D,YAAI,aAAa,CAAC,IAAI;AACtB,YAAI,IAAI,eAAe,GAAG;AAAE,cAAI,aAAa;AAAA,QAAI;AAAA,MACrD;AAGE,UAAK,IAAI,cAAc,KAAO,IAAI,aAAa,MAC3C,EAAE,WAAW,QAAQ,aAAa;AACpC,YAAI,cAAc;AAAA,MACtB;AAIE,UAAK,IAAI,aAAa,MAAQ,IAAI,aAAa,IAAK;AAGlD,aAAK,IAAI,aAAa,QAAQ,GAAG;AAC/B,cAAI,cAAc;AAAA,QACxB;AAAA,MACA;AAEE,WAAK,MAAS;AACd,WAAK,MAAS;AACd,WAAK,QAAS;AACd,WAAK,SAAS;AAEd,WAAK,OAAS,IAAI,QAAS;AAC3B,WAAK,KAAK,YAAY;AAEtB,UAAI,SAAU,aAAa;AAAA,QACzB,KAAK;AAAA,QACL,IAAI;AAAA,MACL;AAED,UAAI,WAAW,EAAE,MAAM;AACrB,cAAM,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,MAC/B;AAEE,WAAK,SAAS,IAAI,SAAU;AAE5B,mBAAa,iBAAiB,KAAK,MAAM,KAAK,MAAM;AAGpD,UAAI,IAAI,YAAY;AAElB,YAAI,OAAO,IAAI,eAAe,UAAU;AACtC,cAAI,aAAaJ,SAAQ,WAAW,IAAI,UAAU;AAAA,QACxD,WAAe,SAAS,KAAK,IAAI,UAAU,MAAM,wBAAwB;AACnE,cAAI,aAAa,IAAI,WAAW,IAAI,UAAU;AAAA,QACpD;AACI,YAAI,IAAI,KAAK;AACX,mBAAS,aAAa,qBAAqB,KAAK,MAAM,IAAI,UAAU;AACpE,cAAI,WAAW,EAAE,MAAM;AACrB,kBAAM,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,UACnC;AAAA,QACA;AAAA,MACA;AAAA,IACA;AA8BA,YAAQ,UAAU,OAAO,SAAU,MAAM,MAAM;AAC7C,UAAI,OAAO,KAAK;AAChB,UAAI,YAAY,KAAK,QAAQ;AAC7B,UAAI,aAAa,KAAK,QAAQ;AAC9B,UAAI,QAAQ;AACZ,UAAI,eAAe,MAAM;AAIzB,UAAI,gBAAgB;AAEpB,UAAI,KAAK,OAAO;AAAE,eAAO;AAAA,MAAM;AAC/B,cAAS,SAAS,CAAC,CAAC,OAAQ,OAAS,SAAS,OAAQ,EAAE,WAAW,EAAE;AAGrE,UAAI,OAAO,SAAS,UAAU;AAE5B,aAAK,QAAQA,SAAQ,cAAc,IAAI;AAAA,MACxC,WAAU,SAAS,KAAK,IAAI,MAAM,wBAAwB;AACzD,aAAK,QAAQ,IAAI,WAAW,IAAI;AAAA,MACpC,OAAS;AACL,aAAK,QAAQ;AAAA,MACjB;AAEE,WAAK,UAAU;AACf,WAAK,WAAW,KAAK,MAAM;AAE3B,SAAG;AACD,YAAI,KAAK,cAAc,GAAG;AACxB,eAAK,SAAS,IAAI,MAAM,KAAK,SAAS;AACtC,eAAK,WAAW;AAChB,eAAK,YAAY;AAAA,QACvB;AAEI,iBAAS,aAAa,QAAQ,MAAM,EAAE,UAAU;AAEhD,YAAI,WAAW,EAAE,eAAe,YAAY;AAC1C,mBAAS,aAAa,qBAAqB,KAAK,MAAM,UAAU;AAAA,QACtE;AAEI,YAAI,WAAW,EAAE,eAAe,kBAAkB,MAAM;AACtD,mBAAS,EAAE;AACX,0BAAgB;AAAA,QACtB;AAEI,YAAI,WAAW,EAAE,gBAAgB,WAAW,EAAE,MAAM;AAClD,eAAK,MAAM,MAAM;AACjB,eAAK,QAAQ;AACb,iBAAO;AAAA,QACb;AAEI,YAAI,KAAK,UAAU;AACjB,cAAI,KAAK,cAAc,KAAK,WAAW,EAAE,gBAAiB,KAAK,aAAa,MAAM,UAAU,EAAE,YAAY,UAAU,EAAE,eAAgB;AAEpI,gBAAI,KAAK,QAAQ,OAAO,UAAU;AAEhC,8BAAgBA,SAAQ,WAAW,KAAK,QAAQ,KAAK,QAAQ;AAE7D,qBAAO,KAAK,WAAW;AACvB,wBAAUA,SAAQ,WAAW,KAAK,QAAQ,aAAa;AAGvD,mBAAK,WAAW;AAChB,mBAAK,YAAY,YAAY;AAC7B,kBAAI,MAAM;AAAE,sBAAM,SAAS,KAAK,QAAQ,KAAK,QAAQ,eAAe,MAAM,CAAC;AAAA,cAAE;AAE7E,mBAAK,OAAO,OAAO;AAAA,YAE7B,OAAe;AACL,mBAAK,OAAO,MAAM,UAAU,KAAK,QAAQ,KAAK,QAAQ,CAAC;AAAA,YACjE;AAAA,UACA;AAAA,QACA;AASI,YAAI,KAAK,aAAa,KAAK,KAAK,cAAc,GAAG;AAC/C,0BAAgB;AAAA,QACtB;AAAA,MAEA,UAAY,KAAK,WAAW,KAAK,KAAK,cAAc,MAAM,WAAW,EAAE;AAErE,UAAI,WAAW,EAAE,cAAc;AAC7B,gBAAQ,EAAE;AAAA,MACd;AAGE,UAAI,UAAU,EAAE,UAAU;AACxB,iBAAS,aAAa,WAAW,KAAK,IAAI;AAC1C,aAAK,MAAM,MAAM;AACjB,aAAK,QAAQ;AACb,eAAO,WAAW,EAAE;AAAA,MACxB;AAGE,UAAI,UAAU,EAAE,cAAc;AAC5B,aAAK,MAAM,EAAE,IAAI;AACjB,aAAK,YAAY;AACjB,eAAO;AAAA,MACX;AAEE,aAAO;AAAA,IACR;AAYD,YAAQ,UAAU,SAAS,SAAU,OAAO;AAC1C,WAAK,OAAO,KAAK,KAAK;AAAA,IACvB;AAaD,YAAQ,UAAU,QAAQ,SAAU,QAAQ;AAE1C,UAAI,WAAW,EAAE,MAAM;AACrB,YAAI,KAAK,QAAQ,OAAO,UAAU;AAGhC,eAAK,SAAS,KAAK,OAAO,KAAK,EAAE;AAAA,QACvC,OAAW;AACL,eAAK,SAAS,MAAM,cAAc,KAAK,MAAM;AAAA,QACnD;AAAA,MACA;AACE,WAAK,SAAS,CAAE;AAChB,WAAK,MAAM;AACX,WAAK,MAAM,KAAK,KAAK;AAAA,IACtB;AA0CD,aAASC,SAAQ,OAAO,SAAS;AAC/B,UAAI,WAAW,IAAI,QAAQ,OAAO;AAElC,eAAS,KAAK,OAAO,IAAI;AAGzB,UAAI,SAAS,KAAK;AAAE,cAAM,SAAS,OAAO,IAAI,SAAS,GAAG;AAAA,MAAE;AAE5D,aAAO,SAAS;AAAA,IAClB;AAWA,aAAS,WAAW,OAAO,SAAS;AAClC,gBAAU,WAAW,CAAE;AACvB,cAAQ,MAAM;AACd,aAAOA,SAAQ,OAAO,OAAO;AAAA,IAC/B;AAaAC,cAAA,UAAkB;AAClBA,cAAA,UAAkBD;AAClBC,cAAA,aAAqB;AACrBA,cAAA,SAAkBD;;;;;;;;ACnalB,QAAI,SAAY5B,cAA6B,EAAC;AAE9C,QAAIyB,WAAYnB,eAAwB;AACxC,QAAIsB,WAAYrB,eAAwB;AACxC,QAAIyB,aAAYxB,iBAA+B;AAE/C,QAAI,OAAO,CAAE;AAEb,WAAO,MAAMiB,UAASG,UAASI,UAAS;AAExC,aAAiB;;;;ACNjB,iBAAe,MAAM,WAAW;AAC5B,QAAI;AACA,UAAI;AACJ,UAAI,MAAM;AACV,UAAI,IAAI;AACR,YAAM,SAAS,CAAE;AACjB,UAAI,YAAY;AAChB,UAAI;AACJ,SAAG;AACC,cAAM,iBAAiB,UAAU,SAAS,GAAG;AAC7C,mBAAW,IAAIC,YAAAA,QAAS;AACxB,SAAC,EAAE,KAAI,IAAK;AACZ,iBAAS,KAAK,gBAAgBC,wBAAY;AAC1C,YAAI,SAAS,KAAK;AACd,gBAAM,IAAI,MAAM,SAAS,GAAG;AAAA,QAC5C;AACY,eAAO,KAAK;AACZ,eAAO,CAAC,IAAI,SAAS;AACrB,qBAAa,OAAO,CAAC,EAAE;AACvB,aAAK;AAAA,MACR,SAAQ,KAAK;AACd,YAAM,SAAS,IAAI,WAAW,SAAS;AACvC,eAASnB,KAAI,GAAG,SAAS,GAAGA,KAAI,OAAO,QAAQA,MAAK;AAChD,eAAO,IAAI,OAAOA,EAAC,GAAG,MAAM;AAC5B,kBAAU,OAAOA,EAAC,EAAE;AAAA,MAChC;AACQ,aAAOI,cAAM,OAAC,KAAK,MAAM;AAAA,IACjC,SACW,GAAG;AAEN,UAAI,GAAG,CAAC,GAAG,MAAM,wBAAwB,GAAG;AACxC,cAAM,IAAI,MAAM,0DAA0D;AAAA,MACtF;AACQ,YAAM;AAAA,IACd;AAAA,EACA;AAwCA,iBAAe,gBAAgB,WAAW,OAAO;AAC7C,QAAI;AACA,UAAI;AACJ,YAAM,EAAE,MAAM,KAAI,IAAK;AACvB,UAAI,OAAO,KAAK;AAChB,UAAI,OAAO,KAAK;AAChB,YAAM,SAAS,CAAE;AACjB,YAAM,aAAa,CAAE;AACrB,YAAM,aAAa,CAAE;AACrB,UAAI,YAAY;AAChB,UAAI,IAAI;AACR,SAAG;AACC,cAAM,iBAAiB,UAAU,SAAS,OAAO,KAAK,aAAa;AACnE,cAAM,WAAW,IAAIc,oBAAS;AAC9B,SAAC,EAAE,KAAI,IAAK;AACZ,iBAAS,KAAK,gBAAgBC,wBAAY;AAC1C,YAAI,SAAS,KAAK;AACd,gBAAM,IAAI,MAAM,SAAS,GAAG;AAAA,QAC5C;AACY,cAAMjB,UAAS,SAAS;AACxB,eAAO,KAAKA,OAAM;AAClB,YAAI,MAAMA,QAAO;AACjB,mBAAW,KAAK,IAAI;AACpB,mBAAW,KAAK,IAAI;AACpB,YAAI,OAAO,WAAW,KAAK,KAAK,cAAc;AAE1C,iBAAO,CAAC,IAAI,OAAO,CAAC,EAAE,SAAS,KAAK,YAAY;AAChD,gBAAM,OAAO,CAAC,EAAE;AAAA,QAChC;AACY,cAAM,WAAW;AACjB,gBAAQ,KAAK;AACb,gBAAQ;AACR,YAAI,YAAY,KAAK,eAAe;AAIhC,iBAAO,CAAC,IAAI,OAAO,CAAC,EAAE,SAAS,GAAG,KAAK,kBAAkB,KAAK,gBACxD,KAAK,eAAe,KAAK,eAAe,IACxC,KAAK,eAAe,CAAC;AAC3B,qBAAW,KAAK,IAAI;AACpB,qBAAW,KAAK,IAAI;AACpB,uBAAa,OAAO,CAAC,EAAE;AACvB;AAAA,QAChB;AACY,qBAAa,OAAO,CAAC,EAAE;AACvB;AAAA,MACH,SAAQ,KAAK;AACd,YAAM,SAAS,IAAI,WAAW,SAAS;AACvC,eAASF,KAAI,GAAG,SAAS,GAAGA,KAAI,OAAO,QAAQA,MAAK;AAChD,eAAO,IAAI,OAAOA,EAAC,GAAG,MAAM;AAC5B,kBAAU,OAAOA,EAAC,EAAE;AAAA,MAChC;AACQ,YAAME,UAASE,cAAAA,OAAO,KAAK,MAAM;AACjC,aAAO,EAAE,QAAAF,SAAQ,YAAY,WAAY;AAAA,IACjD,SACW,GAAG;AAEN,UAAI,GAAG,CAAC,GAAG,MAAM,wBAAwB,GAAG;AACxC,cAAM,IAAI,MAAM,0DAA0D;AAAA,MACtF;AACQ,YAAM;AAAA,IACd;AAAA,EACA;AC1IA,QAAM,aAAa;AACnB,QAAM,aAAa;AACnB,WAAS,OAAO,KAAK,MAAM;AACvB,WAAO,MAAM,KAAK;AAAA,EACtB;AACA,WAAS,OAAO,KAAK,MAAM;AACvB,WAAO,KAAK,MAAM,MAAM,KAAK,IAAI;AAAA,EACrC;AAAA,EACe,MAAM,YAAY,UAAU;AAAA,IACvC,YAAY,MAAM;AACd,YAAM,IAAI;AACV,WAAK,eAAe;AACpB,WAAK,QAAQ;AACb,WAAK,WAAW;AAAA,IACxB;AAAA,IACI,MAAM,UAAU,OAAO;AACnB,YAAM,YAAY,MAAM,KAAK,MAAO;AACpC,UAAI,CAAC,WAAW;AACZ,eAAO;AAAA,MACnB;AACQ,YAAM,MAAM,UAAU,QAAQ,KAAK;AACnC,UAAI,CAAC,KAAK;AACN,eAAO;AAAA,MACnB;AACQ,YAAM,EAAE,MAAO,IAAG,UAAU,QAAQ,KAAK;AACzC,UAAI,OAAO;AACP,eAAO,MAAM;AAAA,MACzB;AACQ,aAAO;AAAA,IACf;AAAA,IACI,MAAM,WAAW;AACb,aAAO,CAAE;AAAA,IACjB;AAAA,IACI,aAAa,OAAO,QAAQ,WAAW;AACnC,UAAI,YAAY,IAAI;AAChB,eAAO,CAAE;AAAA,MACrB;AACQ,YAAM,OAAO,CAAE;AACf,WAAK,cAAc,MAAM,YAAY,MAAM;AAC3C,WAAK,iBACD,KAAK,cAAc,QAAU,yBAAyB;AAC1D,WAAK,SAAS,EAAE,GAAG,WAAW,GAAG,OAAO,GAAG,MAAO,EAAC,KAAK,cAAc,EAAG;AACzE,UAAI,CAAC,KAAK,QAAQ;AACd,cAAM,IAAI,MAAM,qCAAqC,KAAK,WAAW,EAAE;AAAA,MACnF;AACQ,WAAK,gBAAgB;AAAA,QACjB,KAAK,MAAM,YAAY,SAAS,CAAC;AAAA,QACjC,OAAO,MAAM,YAAY,SAAS,CAAC;AAAA,QACnC,KAAK,MAAM,YAAY,SAAS,EAAE;AAAA,MACrC;AACD,WAAK,YAAY,MAAM,YAAY,SAAS,EAAE;AAC9C,WAAK,WAAW,KAAK,YAAY,OAAO,aAAa,KAAK,SAAS,IAAI;AACvE,WAAK,YAAY,MAAM,YAAY,SAAS,EAAE;AAC9C,YAAM,oBAAoB,MAAM,YAAY,SAAS,EAAE;AACvD,aAAO,OAAO,MAAM,KAAK,gBAAgB,MAAM,SAAS,SAAS,IAAI,SAAS,KAAK,iBAAiB,CAAC,CAAC;AACtG,aAAO;AAAA,IACf;AAAA,IACI,gBAAgB,YAAY;AACxB,UAAI,YAAY;AAChB,UAAI,gBAAgB;AACpB,YAAM,cAAc,CAAE;AACtB,YAAM,cAAc,CAAE;AACtB,eAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK,GAAG;AAC3C,YAAI,CAAC,WAAW,CAAC,GAAG;AAChB,cAAI,gBAAgB,GAAG;AACnB,gBAAI,UAAU,WAAW,SAAS,QAAQ,eAAe,CAAC;AAC1D,sBAAU,KAAK,aAAa,OAAO;AACnC,wBAAY,SAAS,IAAI;AACzB,wBAAY,OAAO,IAAI;AAAA,UAC3C;AACgB,0BAAgB,IAAI;AACpB,uBAAa;AAAA,QAC7B;AAAA,MACA;AACQ,aAAO,EAAE,aAAa,YAAa;AAAA,IAC3C;AAAA;AAAA,IAEI,MAAM,OAAO,MAAM;AACf,YAAM,OAAO,EAAE,KAAK,MAAM,cAAc,KAAK,GAAI;AACjD,YAAMA,UAAU,MAAM,KAAK,WAAW,SAAS,IAAI;AACnD,YAAM,QAAQ,MAAM,MAAMA,OAAM;AAEhC,UAAI,MAAM,aAAa,CAAC,MAAM,YAAY;AACtC,aAAK,aAAa;AAAA,MAC9B,WACiB,MAAM,aAAa,CAAC,MAAM,YAAY;AAC3C,aAAK,aAAa;AAAA,MAC9B,OACa;AACD,cAAM,IAAI,MAAM,gBAAgB;AAAA,MAE5C;AACQ,WAAK,WAAW,MAAM,YAAY,CAAC;AACnC,WAAK,QAAQ,MAAM,YAAY,CAAC;AAChC,WAAK,iBAAiB,MAAO,KAAK,QAAQ,KAAK,KAAM,KAAK;AAC1D,YAAM,YAAY,MAAM,YAAY,EAAE;AACtC,UAAI,WAAW;AACX,eAAO,OAAO,MAAM,KAAK,aAAa,OAAO,IAAI,SAAS,CAAC;AAAA,MACvE;AACQ,WAAK,WAAW,MAAM,YAAY,KAAK,SAAS;AAEhD,WAAK,UAAU,IAAI,MAAM,KAAK,QAAQ;AACtC,UAAI,aAAa,KAAK,YAAY;AAClC,eAAS,IAAI,GAAG,IAAI,KAAK,UAAU,KAAK,GAAG;AACvC,cAAM,gBAAgB,KAAK,MAAM;AAEjC,cAAM,WAAW,MAAM,YAAY,UAAU;AAC7C,sBAAc;AACd,cAAM,WAAW,CAAE;AACnB,YAAI;AACJ,iBAAS,IAAI,GAAG,IAAI,UAAU,KAAK,GAAG;AAClC,gBAAM,MAAM,MAAM,aAAa,UAAU;AACzC,cAAI,MAAM,KAAK,cAAc;AAGzB,oBAAQ,KAAK,eAAe,OAAO,aAAa,CAAC;AACjD,0BAAc,IAAI,IAAI,IAAI,KAAK;AAAA,UACnD,OACqB;AACD,kBAAM,UAAU,UAAU,OAAO,aAAa,CAAC;AAC/C,iBAAK,eAAe,MAAM,OAAO;AACjC,kBAAM,aAAa,MAAM,YAAY,aAAa,EAAE;AACpD,0BAAc;AACd,kBAAM,SAAS,IAAI,MAAM,UAAU;AACnC,qBAAS,IAAI,GAAG,IAAI,YAAY,KAAK,GAAG;AACpC,oBAAM,IAAI,UAAU,OAAO,UAAU;AACrC,oBAAM,IAAI,UAAU,OAAO,aAAa,CAAC;AACzC,4BAAc;AAEd,qBAAO,CAAC,IAAI,IAAI,MAAM,GAAG,GAAG,GAAG;AAAA,YACvD;AACoB,qBAAS,GAAG,IAAI;AAAA,UACpC;AAAA,QACA;AACY,aAAK,QAAQ,CAAC,IAAI,EAAE,UAAU,MAAO;AAAA,MACjD;AACQ,aAAO;AAAA,IACf;AAAA,IACI,eAAe,OAAO,QAAQ;AAC1B,YAAM,YAAY,aAAa,KAAK,YAAY,MAAM,UAAU,MAAM,KAAK,OAAO,SAAS,IAAI,SAAS,EAAE,GAAG,IAAI,CAAC;AAClH,aAAO,EAAE,UAAW;AAAA,IAC5B;AAAA,IACI,MAAM,eAAe,OAAO,KAAK,KAAK,OAAO,CAAA,GAAI;AAC7C,UAAI,MAAM,GAAG;AACT,cAAM;AAAA,MAClB;AACQ,YAAM,YAAY,MAAM,KAAK,MAAM,IAAI;AACvC,YAAM,KAAK,cAAc,QAAQ,cAAc,SAAS,SAAS,UAAU,QAAQ,KAAK;AACxF,UAAI,CAAC,IAAI;AACL,eAAO,CAAE;AAAA,MACrB;AACQ,YAAM,kBAAkB,KAAK,SAAS,KAAK,GAAG;AAC9C,YAAM,SAAS,CAAE;AAEjB,iBAAW,CAAC,OAAO,GAAG,KAAK,iBAAiB;AACxC,iBAAS,MAAM,OAAO,OAAO,KAAK,OAAO;AACrC,cAAI,GAAG,SAAS,GAAG,GAAG;AAClB,kBAAM,YAAY,GAAG,SAAS,GAAG;AACjC,qBAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,EAAE,GAAG;AACvC,qBAAO,KAAK,IAAI,MAAM,UAAU,CAAC,EAAE,MAAM,UAAU,CAAC,EAAE,MAAM,GAAG,CAAC;AAAA,YACxF;AAAA,UACA;AAAA,QACA;AAAA,MACA;AACQ,aAAO,eAAe,QAAQ,IAAI,cAAc,GAAG,CAAC,CAAC;AAAA,IAC7D;AAAA;AAAA;AAAA;AAAA;AAAA,IAKI,SAAS,KAAK,KAAK;AACf,aAAO;AACP,UAAI,MAAM,GAAG;AACT,cAAM;AAAA,MAClB;AACQ,UAAI,MAAM,KAAK,IAAI;AACf,cAAM,KAAK;AAAA,MACd;AACD,aAAO;AACP,UAAI,IAAI;AACR,UAAI,IAAI;AACR,UAAI,IAAI,KAAK,WAAW,KAAK,QAAQ;AACrC,YAAM,OAAO,CAAE;AACf,aAAO,KAAK,KAAK,OAAO,KAAK,GAAG,KAAK,OAAO,GAAG,IAAI,CAAC,GAAG,KAAK,GAAG;AAC3D,cAAM,IAAI,IAAI,OAAO,KAAK,CAAC;AAC3B,cAAM,IAAI,IAAI,OAAO,KAAK,CAAC;AAC3B,YAAI,IAAI,IAAI,KAAK,SAAS,KAAK,cAAc;AACzC,gBAAM,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,mDAAmD,KAAK,QAAQ,WAAW,KAAK,KAAK,0DAA0D;AAAA,QAClM;AACY,aAAK,KAAK,CAAC,GAAG,CAAC,CAAC;AAAA,MAC5B;AACQ,aAAO;AAAA,IACf;AAAA,EACA;;;;;;ACvMA,QAAIE,UAASnB,cAAiB,EAAC;AAE/B,QAAI,YAAY;AAAA,MACd;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAAY;AAAA,MAChD;AAAA,IACD;AAED,QAAI,OAAO,eAAe,aAAa;AACrC,kBAAY,IAAI,WAAW,SAAS;AAAA,IACtC;AAEA,aAAS,aAAa,OAAO;AAC3B,UAAImB,QAAO,SAAS,KAAK,GAAG;AAC1B,eAAO;AAAA,MACX;AAEE,UAAI,kBACA,OAAOA,QAAO,UAAU,cACxB,OAAOA,QAAO,SAAS;AAE3B,UAAI,OAAO,UAAU,UAAU;AAC7B,eAAO,kBAAkBA,QAAO,MAAM,KAAK,IAAI,IAAIA,QAAO,KAAK;AAAA,MACnE,WACW,OAAO,UAAU,UAAU;AAClC,eAAO,kBAAkBA,QAAO,KAAK,KAAK,IAAI,IAAIA,QAAO,KAAK;AAAA,MAClE,OACO;AACH,cAAM,IAAI,MAAM,uDACA,OAAO,KAAK;AAAA,MAChC;AAAA,IACA;AAEA,aAAS,aAAa,KAAK;AACzB,UAAI,MAAM,aAAa,CAAC;AACxB,UAAI,aAAa,KAAK,CAAC;AACvB,aAAO;AAAA,IACT;AAEA,aAAS,OAAO,KAAK,UAAU;AAC7B,YAAM,aAAa,GAAG;AACtB,UAAIA,QAAO,SAAS,QAAQ,GAAG;AAC7B,mBAAW,SAAS,aAAa,CAAC;AAAA,MACtC;AACE,UAAI,MAAM,CAAC,CAAC,WAAW;AACvB,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,cAAM,WAAW,MAAM,IAAI,CAAC,KAAK,GAAI,IAAK,QAAQ;AAAA,MACtD;AACE,aAAQ,MAAM;AAAA,IAChB;AAEA,aAASG,SAAQ;AACf,aAAO,aAAa,OAAO,MAAM,MAAM,SAAS,CAAC;AAAA,IACnD;AACA,IAAAA,OAAM,SAAS,WAAY;AACzB,aAAO,OAAO,MAAM,MAAM,SAAS;AAAA,IACpC;AACD,IAAAA,OAAM,WAAW,WAAY;AAC3B,aAAO,OAAO,MAAM,MAAM,SAAS,MAAM;AAAA,IAC1C;AAED,kBAAiBA;;;;;;;;;;AC5GjB,QAAI,MAAM,SAAU,KAAK,MAAM;AAAE,aAAO,OAAO,UAAU,eAAe,KAAK,KAAK,IAAI;AAAA,IAAC;AACvF,QAAI,eAAe,SAAU,KAAK,MAAM;AACtC,aAAO,OAAO,UAAU,qBAAqB,KAAK,KAAK,IAAI;AAAA,IAC7D;AAEA,aAASa,SAAS,KAAK;AACrB,UAAI,OAAO,MAAM;AACf,cAAM,IAAI,UAAU,4CAA4C;AAAA,MACpE;AACE,UAAI,QAAQ,CAAA;AACZ,eAAS,OAAO,KAAK;AACnB,YAAI,IAAI,KAAK,GAAG,KAAK,aAAa,KAAK,GAAG,GAAG;AAC3C,gBAAM,KAAK,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC;AAAA,QAChC;AAAA,MACA;AACE,aAAO;AAAA,IACT;AAEA,gBAAiBA;;;;;;;;ACpBH,6BAAG,OAAO,OAAO,YAAY,aAAa,OAAO,UAAUnC,eAAA;;;;;;;;;;;;;ACEzE,WAAO,eAAe,aAAS,cAAc,EAAE,OAAO,MAAM;AAE5D,aAAS,gBAAgB,UAAU,aAAa;AAC9C,UAAI,EAAE,oBAAoB,cAAc;AACtC,cAAM,IAAI,UAAU,mCAAmC;AAAA,MAC3D;AAAA,IACA;AAEA,aAAS,kBAAkB,QAAQ,OAAO;AACxC,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,YAAI,aAAa,MAAM,CAAC;AACxB,mBAAW,aAAa,WAAW,cAAc;AACjD,mBAAW,eAAe;AAC1B,YAAI,WAAW,WAAY,YAAW,WAAW;AACjD,eAAO,eAAe,QAAQ,WAAW,KAAK,UAAU;AAAA,MAC5D;AAAA,IACA;AAEA,aAAS,aAAa,aAAa,YAAY,aAAa;AAC1D,UAAI,WAAY,mBAAkB,YAAY,WAAW,UAAU;AAEnE,aAAO,eAAe,aAAa,aAAa;AAAA,QAC9C,UAAU;AAAA,MACd,CAAG;AACD,aAAO;AAAA,IACT;AAEA,aAAS,UAAU,UAAU,YAAY;AACvC,UAAI,OAAO,eAAe,cAAc,eAAe,MAAM;AAC3D,cAAM,IAAI,UAAU,oDAAoD;AAAA,MAC5E;AAEE,eAAS,YAAY,OAAO,OAAO,cAAc,WAAW,WAAW;AAAA,QACrE,aAAa;AAAA,UACX,OAAO;AAAA,UACP,UAAU;AAAA,UACV,cAAc;AAAA,QACpB;AAAA,MACA,CAAG;AACD,aAAO,eAAe,UAAU,aAAa;AAAA,QAC3C,UAAU;AAAA,MACd,CAAG;AACD,UAAI,WAAY,iBAAgB,UAAU,UAAU;AAAA,IACtD;AAEA,aAAS,gBAAgB,GAAG;AAC1B,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAM,IAAG,SAASoC,iBAAgBC,IAAG;AACnG,eAAOA,GAAE,aAAa,OAAO,eAAeA,EAAC;AAAA,MAC9C;AACD,aAAO,gBAAgB,CAAC;AAAA,IAC1B;AAEA,aAAS,gBAAgB,GAAG,GAAG;AAC7B,wBAAkB,OAAO,iBAAiB,OAAO,eAAe,KAAI,IAAK,SAASC,iBAAgBD,IAAGE,IAAG;AACtG,QAAAF,GAAE,YAAYE;AACd,eAAOF;AAAA,MACR;AACD,aAAO,gBAAgB,GAAG,CAAC;AAAA,IAC7B;AAEA,aAAS,4BAA4B;AACnC,UAAI,OAAO,YAAY,eAAe,CAAC,QAAQ,UAAW,QAAO;AACjE,UAAI,QAAQ,UAAU,KAAM,QAAO;AACnC,UAAI,OAAO,UAAU,WAAY,QAAO;AAExC,UAAI;AACF,gBAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,SAAS,CAAA,GAAI,WAAY;AAAA,QAAA,CAAE,CAAC;AAC7E,eAAO;AAAA,MACR,SAAQ,GAAG;AACV,eAAO;AAAA,MACX;AAAA,IACA;AAEA,aAAS,uBAAuBG,OAAM;AACpC,UAAIA,UAAS,QAAQ;AACnB,cAAM,IAAI,eAAe,2DAA2D;AAAA,MACxF;AAEE,aAAOA;AAAA,IACT;AAEA,aAAS,2BAA2BA,OAAM,MAAM;AAC9C,UAAI,SAAS,OAAO,SAAS,YAAY,OAAO,SAAS,aAAa;AACpE,eAAO;AAAA,MACX,WAAa,SAAS,QAAQ;AAC1B,cAAM,IAAI,UAAU,0DAA0D;AAAA,MAClF;AAEE,aAAO,uBAAuBA,KAAI;AAAA,IACpC;AAEA,aAAS,aAAa,SAAS;AAC7B,UAAI,4BAA4B,0BAA2B;AAE3D,aAAO,SAAS,uBAAuB;AACrC,YAAI,QAAQ,gBAAgB,OAAO,GAC/B;AAEJ,YAAI,2BAA2B;AAC7B,cAAI,YAAY,gBAAgB,IAAI,EAAE;AAEtC,mBAAS,QAAQ,UAAU,OAAO,WAAW,SAAS;AAAA,QAC5D,OAAW;AACL,mBAAS,MAAM,MAAM,MAAM,SAAS;AAAA,QAC1C;AAEI,eAAO,2BAA2B,MAAM,MAAM;AAAA,MAC/C;AAAA,IACH;AAEA,aAAS,eAAe,QAAQ,UAAU;AACxC,aAAO,CAAC,OAAO,UAAU,eAAe,KAAK,QAAQ,QAAQ,GAAG;AAC9D,iBAAS,gBAAgB,MAAM;AAC/B,YAAI,WAAW,KAAM;AAAA,MACzB;AAEE,aAAO;AAAA,IACT;AAEA,aAAS,OAAO;AACd,UAAI,OAAO,YAAY,eAAe,QAAQ,KAAK;AACjD,eAAO,QAAQ,IAAI,KAAM;AAAA,MAC7B,OAAS;AACL,eAAO,SAASC,MAAK,QAAQ,UAAU,UAAU;AAC/C,cAAI,OAAO,eAAe,QAAQ,QAAQ;AAE1C,cAAI,CAAC,KAAM;AACX,cAAI,OAAO,OAAO,yBAAyB,MAAM,QAAQ;AAEzD,cAAI,KAAK,KAAK;AACZ,mBAAO,KAAK,IAAI,KAAK,UAAU,SAAS,IAAI,SAAS,QAAQ;AAAA,UACrE;AAEM,iBAAO,KAAK;AAAA,QACb;AAAA,MACL;AAEE,aAAO,KAAK,MAAM,MAAM,SAAS;AAAA,IACnC;AAEA,QAAI,UAAuB,2BAAY;AACrC,eAASC,WAAU;AACjB,wBAAgB,MAAMA,QAAO;AAE7B,eAAO,eAAe,MAAM,aAAa;AAAA,UACvC,OAAO,CAAE;AAAA,UACT,UAAU;AAAA,UACV,cAAc;AAAA,QACpB,CAAK;AAAA,MACL;AAEE,mBAAaA,UAAS,CAAC;AAAA,QACrB,KAAK;AAAA,QACL,OAAO,SAAS,iBAAiB,MAAM,UAAU,SAAS;AACxD,cAAI,EAAE,QAAQ,KAAK,YAAY;AAC7B,iBAAK,UAAU,IAAI,IAAI,CAAE;AAAA,UACjC;AAEM,eAAK,UAAU,IAAI,EAAE,KAAK;AAAA,YACxB;AAAA,YACA;AAAA,UACR,CAAO;AAAA,QACP;AAAA,MACA,GAAK;AAAA,QACD,KAAK;AAAA,QACL,OAAO,SAAS,oBAAoB,MAAM,UAAU;AAClD,cAAI,EAAE,QAAQ,KAAK,YAAY;AAC7B;AAAA,UACR;AAEM,cAAI,QAAQ,KAAK,UAAU,IAAI;AAE/B,mBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,IAAI,GAAG,KAAK;AAC5C,gBAAI,MAAM,CAAC,EAAE,aAAa,UAAU;AAClC,oBAAM,OAAO,GAAG,CAAC;AACjB;AAAA,YACV;AAAA,UACA;AAAA,QACA;AAAA,MACA,GAAK;AAAA,QACD,KAAK;AAAA,QACL,OAAO,SAAS,cAAc,OAAO;AACnC,cAAI,EAAE,MAAM,QAAQ,KAAK,YAAY;AACnC;AAAA,UACR;AAEM,cAAI,QAAQ,KAAK,UAAU,MAAM,IAAI;AACrC,cAAI,cAAc,MAAM,MAAO;AAE/B,mBAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,IAAI,GAAG,KAAK;AAClD,gBAAI,WAAW,YAAY,CAAC;AAE5B,gBAAI;AACF,uBAAS,SAAS,KAAK,MAAM,KAAK;AAAA,YACnC,SAAQ,GAAG;AACV,sBAAQ,UAAU,KAAK,WAAY;AACjC,sBAAM;AAAA,cAClB,CAAW;AAAA,YACX;AAEQ,gBAAI,SAAS,WAAW,SAAS,QAAQ,MAAM;AAC7C,mBAAK,oBAAoB,MAAM,MAAM,SAAS,QAAQ;AAAA,YAChE;AAAA,UACA;AAEM,iBAAO,CAAC,MAAM;AAAA,QACpB;AAAA,MACA,CAAG,CAAC;AAEF,aAAOA;AAAA,IACT,EAAG;AAEH,QAAI,cAA2B,yBAAU,UAAU;AACjD,gBAAUC,cAAa,QAAQ;AAE/B,UAAI,SAAS,aAAaA,YAAW;AAErC,eAASA,eAAc;AACrB,YAAI;AAEJ,wBAAgB,MAAMA,YAAW;AAEjC,gBAAQ,OAAO,KAAK,IAAI;AAOxB,YAAI,CAAC,MAAM,WAAW;AACpB,kBAAQ,KAAK,uBAAuB,KAAK,CAAC;AAAA,QAC3C;AAID,eAAO,eAAe,uBAAuB,KAAK,GAAG,WAAW;AAAA,UAC9D,OAAO;AAAA,UACP,UAAU;AAAA,UACV,cAAc;AAAA,QACpB,CAAK;AACD,eAAO,eAAe,uBAAuB,KAAK,GAAG,WAAW;AAAA,UAC9D,OAAO;AAAA,UACP,UAAU;AAAA,UACV,cAAc;AAAA,QACpB,CAAK;AACD,eAAO,eAAe,uBAAuB,KAAK,GAAG,UAAU;AAAA,UAC7D,OAAO;AAAA,UACP,UAAU;AAAA,UACV,cAAc;AAAA,QACpB,CAAK;AACD,eAAO;AAAA,MACX;AAEE,mBAAaA,cAAa,CAAC;AAAA,QACzB,KAAK;AAAA,QACL,OAAO,SAAS,WAAW;AACzB,iBAAO;AAAA,QACb;AAAA,MACA,GAAK;AAAA,QACD,KAAK;AAAA,QACL,OAAO,SAAS,cAAc,OAAO;AACnC,cAAI,MAAM,SAAS,SAAS;AAC1B,iBAAK,UAAU;AAEf,gBAAI,OAAO,KAAK,YAAY,YAAY;AACtC,mBAAK,QAAQ,KAAK,MAAM,KAAK;AAAA,YACvC;AAAA,UACA;AAEM,eAAK,gBAAgBA,aAAY,SAAS,GAAG,iBAAiB,IAAI,EAAE,KAAK,MAAM,KAAK;AAAA,QAC1F;AAAA,MACA,CAAG,CAAC;AAEF,aAAOA;AAAA,IACR,EAAC,OAAO;AACT,QAAIC,mBAA+B,2BAAY;AAC7C,eAASA,mBAAkB;AACzB,wBAAgB,MAAMA,gBAAe;AAIrC,eAAO,eAAe,MAAM,UAAU;AAAA,UACpC,OAAO,IAAI,YAAa;AAAA,UACxB,UAAU;AAAA,UACV,cAAc;AAAA,QACpB,CAAK;AAAA,MACL;AAEE,mBAAaA,kBAAiB,CAAC;AAAA,QAC7B,KAAK;AAAA,QACL,OAAO,SAAS,MAAM,QAAQ;AAC5B,cAAI;AAEJ,cAAI;AACF,oBAAQ,IAAI,MAAM,OAAO;AAAA,UAC1B,SAAQ,GAAG;AACV,gBAAI,OAAO,aAAa,aAAa;AACnC,kBAAI,CAAC,SAAS,aAAa;AAEzB,wBAAQ,SAAS,kBAAmB;AACpC,sBAAM,OAAO;AAAA,cACzB,OAAiB;AAEL,wBAAQ,SAAS,YAAY,OAAO;AACpC,sBAAM,UAAU,SAAS,OAAO,KAAK;AAAA,cACjD;AAAA,YACA,OAAe;AAEL,sBAAQ;AAAA,gBACN,MAAM;AAAA,gBACN,SAAS;AAAA,gBACT,YAAY;AAAA,cACb;AAAA,YACX;AAAA,UACA;AAEM,cAAI,eAAe;AAEnB,cAAI,iBAAiB,QAAW;AAC9B,gBAAI,OAAO,aAAa,aAAa;AACnC,6BAAe,IAAI,MAAM,4BAA4B;AACrD,2BAAa,OAAO;AAAA,YAC9B,OAAe;AACL,kBAAI;AACF,+BAAe,IAAI,aAAa,kCAAkC;AAAA,cACnE,SAAQ,KAAK;AAGZ,+BAAe,IAAI,MAAM,4BAA4B;AACrD,6BAAa,OAAO;AAAA,cAChC;AAAA,YACA;AAAA,UACA;AAEM,eAAK,OAAO,SAAS;AACrB,eAAK,OAAO,cAAc,KAAK;AAAA,QACrC;AAAA,MACA,GAAK;AAAA,QACD,KAAK;AAAA,QACL,OAAO,SAAS,WAAW;AACzB,iBAAO;AAAA,QACb;AAAA,MACA,CAAG,CAAC;AAEF,aAAOA;AAAA,IACT,EAAG;AAEH,QAAI,OAAO,WAAW,eAAe,OAAO,aAAa;AAGvD,MAAAA,iBAAgB,UAAU,OAAO,WAAW,IAAI;AAChD,kBAAY,UAAU,OAAO,WAAW,IAAI;AAAA,IAC9C;AAEA,aAAS,eAAeJ,OAAM;AAC5B,UAAIA,MAAK,0CAA0C;AACjD,gBAAQ,IAAI,mFAAmF;AAC/F,eAAO;AAAA,MACR;AASD,aAAO,OAAOA,MAAK,YAAY,cAAc,CAACA,MAAK,QAAQ,UAAU,eAAe,QAAQ,KAAK,CAACA,MAAK;AAAA,IACzG;AAgBA,aAAS,wBAAwB,cAAc;AAC7C,UAAI,eAAe,OAAO,cAAc;AACtC,uBAAe;AAAA,UACb,OAAO;AAAA,QACR;AAAA,MACL;AAEE,UAAI,gBAAgB,cAChB,QAAQ,cAAc,OACtB,wBAAwB,cAAc,SACtC,gBAAgB,0BAA0B,SAAS,MAAM,UAAU,uBACnE,wBAAwB,cAAc,iBACtC,wBAAwB,cAAc,0CACtC,2CAA2C,0BAA0B,SAAS,QAAQ;AAE1F,UAAI,CAAC,eAAe;AAAA,QAElB,SAAS;AAAA,QACT,iBAAiB;AAAA,QACjB;AAAA,MACJ,CAAG,GAAG;AACF,eAAO;AAAA,UACL;AAAA,UACA;AAAA,QACD;AAAA,MACL;AAEE,UAAI,UAAU;AAYd,UAAI,WAAW,CAAC,QAAQ,UAAU,eAAe,QAAQ,KAAK,0CAA0C;AACtG,kBAAU,SAASK,SAAQ,OAAOxB,OAAM;AACtC,cAAI;AAEJ,cAAIA,SAAQA,MAAK,QAAQ;AACvB,qBAASA,MAAK;AAOd,mBAAOA,MAAK;AAAA,UACpB;AAEM,cAAI,UAAU,IAAI,cAAc,OAAOA,KAAI;AAE3C,cAAI,QAAQ;AACV,mBAAO,eAAe,SAAS,UAAU;AAAA,cACvC,UAAU;AAAA,cACV,YAAY;AAAA,cACZ,cAAc;AAAA,cACd,OAAO;AAAA,YACjB,CAAS;AAAA,UACT;AAEM,iBAAO;AAAA,QACR;AAED,gBAAQ,YAAY,cAAc;AAAA,MACtC;AAEE,UAAI,YAAY;AAEhB,UAAI,iBAAiB,SAASyB,gBAAe,OAAOzB,OAAM;AACxD,YAAI,SAAS,WAAW,QAAQ,UAAU,cAAc,KAAK,IAAI,MAAM,SAASA,QAAOA,MAAK,SAAS;AAErG,YAAI,QAAQ;AACV,cAAI;AAEJ,cAAI;AACF,yBAAa,IAAI,aAAa,WAAW,YAAY;AAAA,UACtD,SAAQ,KAAK;AAGZ,yBAAa,IAAI,MAAM,SAAS;AAChC,uBAAW,OAAO;AAAA,UACnB;AAGD,cAAI,OAAO,SAAS;AAClB,mBAAO,QAAQ,OAAO,UAAU;AAAA,UACjC;AAGD,cAAI,eAAe,IAAI,QAAQ,SAAU,GAAG,QAAQ;AAClD,mBAAO,iBAAiB,SAAS,WAAY;AAC3C,qBAAO,OAAO,UAAU;AAAA,YAClC,GAAW;AAAA,cACD,MAAM;AAAA,YAChB,CAAS;AAAA,UACT,CAAO;AAED,cAAIA,SAAQA,MAAK,QAAQ;AAOvB,mBAAOA,MAAK;AAAA,UACb;AAGD,iBAAO,QAAQ,KAAK,CAAC,cAAc,UAAU,OAAOA,KAAI,CAAC,CAAC;AAAA,QAChE;AAEI,eAAO,UAAU,OAAOA,KAAI;AAAA,MAC7B;AAED,aAAO;AAAA,QACL,OAAO;AAAA,QACP;AAAA,MACD;AAAA,IACH;AAEA,gBAAA,kBAA0BuB;AAC1B,gBAAA,cAAsB;AACtB,gBAAA,iBAAyB;;;;;;;AC/fzB,WAAO,eAAe,yBAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,4BAAA,cAAsB,wBAAA,kBAA0B;AAChD,UAAM,iBAAiB5C,mBAAqD;AAC5E,QAAI,YAAY,WAAY;AAIxB,UAAI,OAAO,SAAS,aAAa;AAC7B,eAAO;AAAA,MACf;AACI,UAAI,OAAO,WAAW,aAAa;AAC/B,eAAO;AAAA,MACf;AACI,UAAI,OAAO+C,mBAAW,aAAa;AAC/B,eAAOA;AAAAA,MACf;AACI,YAAM,IAAI,MAAM,gCAAgC;AAAA,IACnD;AAED,QAAIH,mBAAkB,OAAO,UAAS,EAAG,oBAAoB,cAAc,eAAe,kBAAkB,UAAS,EAAG;AACxH,4BAAA,kBAA0BA;AAE1B,QAAI,cAAc,OAAO,UAAS,EAAG,oBAAoB,cAAc,eAAe,cAAc,UAAS,EAAG;AAChH,4BAAA,cAAsB;;;;;;;;ACxBtB,WAAO,eAAeI,0BAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,UAAM,6BAA6BhD,+BAAqC;AAAA,IACxE,MAAM,WAAW;AAAA,IACjB;AAKA,QAAA,6BAAA,MAAM,yBAAyB;AAAA,MAC3B,cAAc;AACV,aAAK,UAAU,oBAAI,IAAK;AACxB,aAAK,kBAAkB,IAAI,2BAA2B,gBAAiB;AAAA,MAC/E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOI,UAAU,SAAS,IAAI,cAAc;AACjC,YAAI,KAAK,OAAO,SAAS;AACrB,gBAAM,IAAI,MAAM,uCAAuC;AAAA,QACnE;AAGQ,aAAK,QAAQ,IAAI,MAAM;AACvB,YAAI,OAAO,SAAS;AAGhB,eAAK,cAAc,MAAM;AAAA,QACrC,WACiB,OAAO,OAAO,qBAAqB,YAAY;AACpD,iBAAO,iBAAiB,SAAS,MAAM;AACnC,iBAAK,cAAc,MAAM;AAAA,UACzC,CAAa;AAAA,QACb;AAAA,MACA;AAAA,MACI,cAAc,QAAQ;AAClB,aAAK,QAAQ,OAAO,MAAM;AAC1B,YAAI,KAAK,QAAQ,SAAS,GAAG;AACzB,eAAK,gBAAgB,MAAO;AAAA,QACxC;AAAA,MACA;AAAA,MACI,IAAI,SAAS;AACT,eAAO,KAAK,gBAAgB;AAAA,MACpC;AAAA,MACI,QAAQ;AACJ,aAAK,gBAAgB,MAAO;AAAA,MACpC;AAAA,IACA;AACAgD,6BAAA,UAAkBC;;;;;;;;AClDlB,WAAO,eAAeC,yBAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,QAAA,4BAAA,MAAM,wBAAwB;AAAA,MAC1B,cAAc;AACV,aAAK,YAAY,oBAAI,IAAK;AAAA,MAClC;AAAA,MACI,YAAY,WAAW,MAAM;AAAA,SAAK;AAC9B,aAAK,UAAU,IAAI,QAAQ;AAC3B,iBAAS,KAAK,cAAc;AAAA,MACpC;AAAA,MACI,SAAS,SAAS;AACd,aAAK,iBAAiB;AACtB,aAAK,UAAU,QAAQ,SAAO;AAC1B,cAAI,OAAO;AAAA,QACvB,CAAS;AAAA,MACT;AAAA,IACA;AACAA,4BAAA,UAAkBC;;;;;;;AChBlB,QAAI,kBAAmB9C,2BAAQA,wBAAK,mBAAoB,SAAU,KAAK;AACnE,aAAQ,OAAO,IAAI,aAAc,MAAM,EAAE,WAAW,IAAK;AAAA,IAC5D;AACD,WAAO,eAAe+C,yBAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,UAAM,6BAA6BpD,+BAAqC;AACxE,UAAM,6BAA6B,gBAAgBM,iCAAqC;AACxF,UAAM,4BAA4B,gBAAgBC,gCAAoC;AAAA,IACtF,MAAM8C,uBAAsB;AAAA,MACxB,YAAY,EAAE,MAAM,SAAU;AAC1B,YAAI,OAAO,SAAS,YAAY;AAC5B,gBAAM,IAAI,UAAU,2BAA2B;AAAA,QAC3D;AACQ,YAAI,OAAO,UAAU,UAAU;AAC3B,gBAAM,IAAI,UAAU,0BAA0B;AAAA,QAC1D;AACQ,YAAI,OAAO,MAAM,QAAQ,cACrB,OAAO,MAAM,QAAQ,cACrB,OAAO,MAAM,WAAW,YAAY;AACpC,gBAAM,IAAI,UAAU,mEAAmE;AAAA,QACnG;AACQ,aAAK,QAAQ;AACb,aAAK,eAAe;AAAA,MAC5B;AAAA,MACI,OAAO,iBAAiB,WAAW;AAC/B;AAAA;AAAA,UAEA,UAAU,SAAS;AAAA;AAAA,UAGf,UAAU,SAAS;AAAA,UAEnB,UAAU,YAAY;AAAA,UAEtB,UAAU,YAAY;AAAA;AAAA,MAClC;AAAA,MACI,MAAM,KAAK,OAAO;AACd,YAAI,KAAK,MAAM,IAAI,GAAG,MAAM,OAAO;AAC/B,eAAK,MAAM,OAAO,GAAG;AAAA,QACjC;AAAA,MACA;AAAA,MACI,KAAK,KAAK,MAAM,QAAQ,gBAAgB;AACpC,cAAM,UAAU,IAAI,2BAA2B,QAAS;AACxD,cAAM,iBAAiB,IAAI,0BAA0B,QAAS;AAC9D,uBAAe,YAAY,cAAc;AACzC,cAAM,WAAW;AAAA,UACb;AAAA,UACA,SAAS,KAAK,aAAa,MAAM,QAAQ,QAAQ,CAAC,YAAY;AAC1D,2BAAe,SAAS,OAAO;AAAA,UAC/C,CAAa;AAAA,UACD,SAAS;AAAA,UACT;AAAA,UACA,IAAI,UAAU;AACV,mBAAO,KAAK,QAAQ,OAAO;AAAA,UAC9B;AAAA,QACJ;AACD,iBAAS,QAAQ,UAAU,MAAM;AAEjC,iBAAS,QAAQ,OAAO,iBAAiB,SAAS,MAAM;AACpD,cAAI,CAAC,SAAS,SAAS;AACnB,iBAAK,MAAM,KAAK,QAAQ;AAAA,UACxC;AAAA,QACA,CAAS;AAED,iBAAS,QACJ,KAAK,MAAM;AACZ,mBAAS,UAAU;AAAA,QAC/B,GAAW,MAAM;AACL,mBAAS,UAAU;AAEnB,eAAK,MAAM,KAAK,QAAQ;AAAA,QAC3B,CAAA,EACI,MAAM,OAAK;AAGZ,kBAAQ,MAAM,CAAC;AACf,gBAAM;AAAA,QAClB,CAAS;AACD,aAAK,MAAM,IAAI,KAAK,QAAQ;AAAA,MACpC;AAAA,MACI,OAAO,mBAAmB,SAAS,QAAQ;AAIvC,iBAAS,sBAAsB;AAC3B,cAAI,UAAU,OAAO,SAAS;AAC1B,kBAAM,OAAO,OAAO,IAAI,MAAM,SAAS,GAAG,EAAE,MAAM,eAAe;AAAA,UACjF;AAAA,QACA;AACQ,eAAO,QAAQ,KAAK,YAAU;AAC1B,8BAAqB;AACrB,iBAAO;AAAA,QACV,GAAE,WAAS;AACR,8BAAqB;AACrB,gBAAM;AAAA,QAClB,CAAS;AAAA,MACT;AAAA,MACI,IAAI,KAAK;AACL,eAAO,KAAK,MAAM,IAAI,GAAG;AAAA,MACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAaI,IAAI,KAAK,MAAM,QAAQ,gBAAgB;AACnC,YAAI,CAAC,UAAU,gBAAgB,2BAA2B,aAAa;AACnE,gBAAM,IAAI,UAAU,uGAAuG;AAAA,QACvI;AACQ,cAAM,aAAa,KAAK,MAAM,IAAI,GAAG;AACrC,YAAI,YAAY;AACZ,cAAI,WAAW,WAAW,CAAC,WAAW,SAAS;AAE3C,iBAAK,MAAM,KAAK,UAAU;AAC1B,mBAAO,KAAK,IAAI,KAAK,MAAM,QAAQ,cAAc;AAAA,UACjE;AACY,cAAI,WAAW,SAAS;AAEpB,mBAAO,WAAW;AAAA,UAClC;AAGY,qBAAW,QAAQ,UAAU,MAAM;AACnC,qBAAW,eAAe,YAAY,cAAc;AACpD,iBAAOA,uBAAsB,mBAAmB,WAAW,SAAS,MAAM;AAAA,QACtF;AAEQ,aAAK,KAAK,KAAK,MAAM,QAAQ,cAAc;AAC3C,eAAOA,uBAAsB;AAAA;AAAA;AAAA,UAG7B,KAAK,MAAM,IAAI,GAAG,EAAE;AAAA,UAAS;AAAA,QAAM;AAAA,MAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOI,OAAO,KAAK;AACR,cAAM,cAAc,KAAK,MAAM,IAAI,GAAG;AACtC,YAAI,aAAa;AACb,cAAI,CAAC,YAAY,SAAS;AACtB,wBAAY,QAAQ,MAAO;AAAA,UAC3C;AACY,eAAK,MAAM,OAAO,GAAG;AAAA,QACjC;AAAA,MACA;AAAA;AAAA;AAAA;AAAA;AAAA,MAKI,QAAQ;AAEJ,cAAM,UAAU,KAAK,MAAM,KAAM;AACjC,YAAI,cAAc;AAClB,iBAAS,SAAS,QAAQ,QAAQ,CAAC,OAAO,MAAM,SAAS,QAAQ,QAAQ;AACrE,eAAK,OAAO,OAAO,KAAK;AACxB,yBAAe;AAAA,QAC3B;AACQ,eAAO;AAAA,MACf;AAAA,IACA;AACAD,4BAAA,UAAkBC;;;;;;;ACzKlB,QAAI,kBAAmBhD,OAAQA,IAAK,mBAAoB,SAAU,KAAK;AACnE,aAAQ,OAAO,IAAI,aAAc,MAAM,EAAE,WAAW,IAAK;AAAA,IAC5D;AACD,WAAO,eAAe,KAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,UAAM,0BAA0B,gBAAgBL,8BAAkC;AACnE,QAAA,UAAG,wBAAwB;;;;;;;;;;ICJ1C,MAAMsD,UAAS;AAAA,MACd,YAAY,UAAU,IAAI;AACzB,YAAI,EAAE,QAAQ,WAAW,QAAQ,UAAU,IAAI;AAC9C,gBAAM,IAAI,UAAU,2CAA2C;AAAA,QAClE;AAEE,aAAK,UAAU,QAAQ;AACvB,aAAK,QAAQ,oBAAI,IAAK;AACtB,aAAK,WAAW,oBAAI,IAAK;AACzB,aAAK,QAAQ;AAAA,MACf;AAAA,MAEC,KAAK,KAAK,OAAO;AAChB,aAAK,MAAM,IAAI,KAAK,KAAK;AACzB,aAAK;AAEL,YAAI,KAAK,SAAS,KAAK,SAAS;AAC/B,eAAK,QAAQ;AACb,eAAK,WAAW,KAAK;AACrB,eAAK,QAAQ,oBAAI,IAAK;AAAA,QACzB;AAAA,MACA;AAAA,MAEC,IAAI,KAAK;AACR,YAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACxB,iBAAO,KAAK,MAAM,IAAI,GAAG;AAAA,QAC5B;AAEE,YAAI,KAAK,SAAS,IAAI,GAAG,GAAG;AAC3B,gBAAM,QAAQ,KAAK,SAAS,IAAI,GAAG;AACnC,eAAK,KAAK,KAAK,KAAK;AACpB,iBAAO;AAAA,QACV;AAAA,MACA;AAAA,MAEC,IAAI,KAAK,OAAO;AACf,YAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACxB,eAAK,MAAM,IAAI,KAAK,KAAK;AAAA,QAC5B,OAAS;AACN,eAAK,KAAK,KAAK,KAAK;AAAA,QACvB;AAEE,eAAO;AAAA,MACT;AAAA,MAEC,IAAI,KAAK;AACR,eAAO,KAAK,MAAM,IAAI,GAAG,KAAK,KAAK,SAAS,IAAI,GAAG;AAAA,MACrD;AAAA,MAEC,KAAK,KAAK;AACT,YAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACxB,iBAAO,KAAK,MAAM,IAAI,GAAG;AAAA,QAC5B;AAEE,YAAI,KAAK,SAAS,IAAI,GAAG,GAAG;AAC3B,iBAAO,KAAK,SAAS,IAAI,GAAG;AAAA,QAC/B;AAAA,MACA;AAAA,MAEC,OAAO,KAAK;AACX,cAAM,UAAU,KAAK,MAAM,OAAO,GAAG;AACrC,YAAI,SAAS;AACZ,eAAK;AAAA,QACR;AAEE,eAAO,KAAK,SAAS,OAAO,GAAG,KAAK;AAAA,MACtC;AAAA,MAEC,QAAQ;AACP,aAAK,MAAM,MAAO;AAClB,aAAK,SAAS,MAAO;AACrB,aAAK,QAAQ;AAAA,MACf;AAAA,MAEC,CAAE,OAAO;AACR,mBAAW,CAAC,GAAG,KAAK,MAAM;AACzB,gBAAM;AAAA,QACT;AAAA,MACA;AAAA,MAEC,CAAE,SAAS;AACV,mBAAW,CAAA,EAAG,KAAK,KAAK,MAAM;AAC7B,gBAAM;AAAA,QACT;AAAA,MACA;AAAA,MAEC,EAAG,OAAO,QAAQ,IAAI;AACrB,mBAAW,QAAQ,KAAK,OAAO;AAC9B,gBAAM;AAAA,QACT;AAEE,mBAAW,QAAQ,KAAK,UAAU;AACjC,gBAAM,CAAC,GAAG,IAAI;AACd,cAAI,CAAC,KAAK,MAAM,IAAI,GAAG,GAAG;AACzB,kBAAM;AAAA,UACV;AAAA,QACA;AAAA,MACA;AAAA,MAEC,IAAI,OAAO;AACV,YAAI,eAAe;AACnB,mBAAW,OAAO,KAAK,SAAS,KAAI,GAAI;AACvC,cAAI,CAAC,KAAK,MAAM,IAAI,GAAG,GAAG;AACzB;AAAA,UACJ;AAAA,QACA;AAEE,eAAO,KAAK,QAAQ;AAAA,MACtB;AAAA,IACA;AAEA,eAAiBA;;;;;ACjHF,MAAA,YAAA;AAAA;AAAA,IAEX,aAAa;AAAA;AAAA,IAEb,kBAAkB;AAAA;AAAA,IAElB,YAAY;AAAA;AAAA,IAEZ,aAAa;AAAA;AAAA,IAEb,cAAc;AAAA;AAAA,IAEd,eAAe;AAAA;AAAA,IAEf,YAAY;AAAA;AAAA,IAEZ,YAAY;AAAA;AAAA,IAEZ,gBAAgB;AAAA;AAAA,IAEhB,aAAa;AAAA;AAAA,IAEb,UAAU;AAAA;AAAA,IAEV,oBAAoB;AAAA,EACxB;ACvBA,QAAM,iBAAiB,mBAAmB,MAAM,EAAE;AAClD,QAAM,gBAAgB,mBAAmB,MAAM,EAAE;AAAA,EAIlC,MAAM,UAAU;AAAA,IAC3B,YAAY,MAAM;AACd,WAAK,OAAO,CAAE;AACd,WAAK,WAAW,CAAE;AAClB,WAAK,iBAAiB;AACtB,YAAM,EAAE,OAAO,WAAU,IAAK;AAC9B,YAAM,EAAE,WAAW,MAAK,IAAK;AAC7B,WAAK,OAAO,CAAE;AACd,WAAK,QAAQ;AACb,WAAK,MAAM;AACX,WAAK,SAAS,UAAU,YAAY,QAAQ,CAAC;AAC7C,WAAK,KAAK,QAAQ,UAAU,YAAY,QAAQ,CAAC;AACjD,WAAK,SAAS,UAAU,YAAY,QAAQ,EAAE,IAAI,eAAe;AAAA,IACzE;AAAA,IACI,IAAI,OAAO;AAEP,UAAI,KAAK,KAAK,GAAG;AAEb,YAAI,KAAK,KAAK,KAAK,GAAG;AAClB,iBAAO,KAAK,KAAK,KAAK;AAAA,QACtC;AAEY,aAAK,KAAK,KAAK,IAAI,KAAK,KAAK,EAAG;AAChC,eAAO,KAAK,KAAK,KAAK;AAAA,MAClC;AACQ,aAAO,KAAK,KAAK,MAAM,YAAW,CAAE;AAAA,IAC5C;AAAA,IACI,MAAM;AACF,aAAO,KAAK,IAAI,OAAO,IAAI,KAAK,IAAI,eAAe;AAAA,IAC3D;AAAA,IACI,SAAS;AACL,aAAO,KAAK;AAAA,IACpB;AAAA;AAAA;AAAA,IAGI,KAAK,OAAO;AACR,UAAI,SAAS,KAAK,MAAM;AACpB,eAAO,KAAK,KAAK,KAAK;AAAA,MAClC;AACQ,WAAK,KAAK,KAAK,IAAI,KAAK,UAAU,KAAK;AACvC,aAAO,KAAK,KAAK,KAAK;AAAA,IAC9B;AAAA,IACI,QAAQ;AACJ,WAAK,cAAe;AACpB,UAAI,OAAO,CAAC,KAAK;AACjB,UAAI,CAAC,KAAK,qBAAqB;AAC3B,aAAK,KAAK,SAAS,OAAO,UAAU,SAAS,QAAQ,MAAM,SAAS,iBAAiB,iBAAiB;AAAA,MAClH;AACQ,UAAI,KAAK,YAAY;AACjB,aAAK,KAAK,yBAAyB,kBAAkB;AAAA,MACjE;AACQ,aAAO,KAAK,OAAO,KAAK,YAAY,CAAA,CAAE;AACtC,aAAO,KAAK,KAAK,IAAI,EAAE,QAAQ,OAAK;AAChC,YAAI,EAAE,CAAC,MAAM,OAAO,MAAM,eAAe;AACrC,eAAK,KAAK,CAAC;AAAA,QAC3B;AAAA,MACA,CAAS;AACD,YAAM,OAAO,CAAE;AACf,aAAO,KAAK,OAAO,OAAK;AACpB,YAAK,KAAK,KAAK,QAAQ,KAAK,KAAK,CAAC,MAAM,UACpC,MAAM,QACN,MAAM,MAAM;AACZ,iBAAO;AAAA,QACvB;AACY,cAAM,KAAK,EAAE,YAAa;AAC1B,cAAM,IAAI,KAAK,EAAE;AACjB,aAAK,EAAE,IAAI;AACX,eAAO,CAAC;AAAA,MACpB,CAAS;AAAA,IACT;AAAA,IACI,SAAS;AACL,aAAO;AAAA,IACf;AAAA,IACI,WAAW;AACP,aAAO,KAAK,IAAI,aAAa;AAAA,IACrC;AAAA,IACI,KAAK;AACD,aAAO,KAAK;AAAA,IACpB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKI,KAAK;AACD,YAAM,MAAM,KAAK,IAAI,YAAY,IAAI,UAAW;AAChD,aAAO,OAAO,MAAM,SAAY;AAAA,IACxC;AAAA,IACI,QAAQ;AACJ,aAAO,KAAK,IAAI,IAAI;AAAA,IAC5B;AAAA,IACI,OAAO;AACH,UAAI;AACJ,cAAQ,KAAK,KAAK,QAAS,OAAM,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAK,GAAG;AAAA,IACrF;AAAA,IACI,UAAU;AACN,UAAI,KAAK,qBAAqB;AAC1B,eAAO;AAAA,MACnB;AACQ,YAAM,EAAE,OAAO,UAAW,IAAG,KAAK;AAClC,YAAM,IAAI,QACN,KACA,KAAK,IAAI,cAAc,IACvB,KAAK,IAAI,aAAa,IAAI,IAC1B,KAAK,IAAI,YAAY;AACzB,YAAM,OAAO,KAAK,IAAI,YAAY;AAClC,aAAO,UAAU,SAAS,GAAG,IAAI,IAAI;AAAA,IAC7C;AAAA,IACI,SAAS;AACL,aAAO,KAAK,0BAA0B,KAAK;AAAA,IACnD;AAAA,IACI,oCAAoC;AAChC,UAAI,KAAK,kBAAkB;AACvB,eAAO;AAAA,MACnB;AACQ,aAAO,KAAK,8BAA8B,KAAK;AAAA,IACvD;AAAA,IACI,OAAO;AACH,aAAO,KAAK,IAAI,YAAY;AAAA,IACpC;AAAA,IACI,aAAa;AACT,YAAM,KAAK,KAAK,IAAI,cAAc;AAClC,YAAM,EAAE,WAAW,MAAO,IAAG,KAAK;AAClC,aAAO,UAAU,SAAS,SAAS,QAAQ,IAAI,QAAQ,KAAK,KAAK,CAAC;AAAA,IAC1E;AAAA;AAAA;AAAA;AAAA;AAAA,IAKI,UAAU,SAAS;AAIf,UAAI,KAAK,gBAAgB;AACrB,eAAO;AAAA,MACnB;AACQ,YAAM,EAAE,WAAW,MAAO,IAAG,KAAK;AAClC,UAAI,IAAI,KAAK,cACT,QACI,KACA,KAAK,IAAI,cAAc,IACvB,KAAK,IAAI,aAAa,IAAI,IAC1B,KAAK,IAAI,YAAY,IACrB,KAAK,IAAI,YAAY;AAC7B,YAAM,WAAW,KAAK,MAAM;AAC5B,UAAI;AACJ,aAAO,IAAI,YAAY,UAAU,SAAS;AACtC,cAAM,MAAM,OAAO,aAAa,UAAU,CAAC,GAAG,UAAU,IAAI,CAAC,CAAC;AAC9D,gBAAQ,IAAI,YAAa;AACzB,cAAM,OAAO,OAAO,aAAa,UAAU,IAAI,CAAC,CAAC;AACjD,aAAK;AACL,YAAI;AACJ,gBAAQ,MAAI;AAAA,UACR,KAAK;AACD,oBAAQ,OAAO,aAAa,UAAU,CAAC,CAAC;AACxC,iBAAK;AACL;AAAA,UACJ,KAAK;AACD,oBAAQ,UAAU,YAAY,CAAC;AAC/B,iBAAK;AACL;AAAA,UACJ,KAAK;AACD,oBAAQ,UAAU,aAAa,CAAC;AAChC,iBAAK;AACL;AAAA,UACJ,KAAK;AACD,oBAAQ,UAAU,SAAS,CAAC;AAC5B,iBAAK;AACL;AAAA,UACJ,KAAK;AACD,oBAAQ,UAAU,UAAU,CAAC;AAC7B,iBAAK;AACL;AAAA,UACJ,KAAK;AACD,oBAAQ,UAAU,YAAY,CAAC;AAC/B,iBAAK;AACL;AAAA,UACJ,KAAK;AACD,oBAAQ,UAAU,aAAa,CAAC;AAChC,iBAAK;AACL;AAAA,UACJ,KAAK;AACD,oBAAQ,UAAU,YAAY,CAAC;AAC/B,iBAAK;AACL;AAAA,UACJ,KAAK;AAAA,UACL,KAAK;AACD,oBAAQ;AACR,mBAAO,KAAK,UAAU;AAClB,oBAAM,KAAK,UAAU,GAAG;AACxB,kBAAI,OAAO,GAAG;AACV;AAAA,cAC5B,OAC6B;AACD,yBAAS,OAAO,aAAa,EAAE;AAAA,cAC3D;AAAA,YACA;AACoB;AAAA,UACJ,KAAK,KAAK;AACN,oBAAQ;AACR,kBAAM,KAAK,UAAU,GAAG;AACxB,kBAAM,QAAQ,OAAO,aAAa,EAAE;AACpC,kBAAM,QAAQ,UAAU,YAAY,CAAC;AACrC,iBAAK;AACL,gBAAI,UAAU,KAAK;AACf,kBAAI,QAAQ,MAAM;AACd,yBAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC5B,wBAAM,QAAQ,UAAU,YAAY,CAAC;AACrC,wBAAM,MAAM,SAAS;AACrB,wBAAM,KAAK,cAAc,QAAQ,EAAG;AACpC,2BAAS,MAAM;AACf,uBAAK;AAAA,gBACrC;AAAA,cACA,OAC6B;AACD,yBAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC5B,2BAAS,UAAU,YAAY,CAAC;AAChC,sBAAI,IAAI,IAAI,OAAO;AACf,6BAAS;AAAA,kBAC7C;AACgC,uBAAK;AAAA,gBACrC;AAAA,cACA;AAAA,YACA;AACoB,gBAAI,UAAU,KAAK;AACf,kBAAI,QAAQ,MAAM;AACd,yBAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC5B,wBAAM,QAAQ,UAAU,aAAa,CAAC;AACtC,wBAAM,MAAM,SAAS;AACrB,wBAAM,KAAK,cAAc,QAAQ,EAAG;AACpC,2BAAS,MAAM;AACf,uBAAK;AAAA,gBACrC;AAAA,cACA,OAC6B;AACD,yBAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC5B,2BAAS,UAAU,aAAa,CAAC;AACjC,sBAAI,IAAI,IAAI,OAAO;AACf,6BAAS;AAAA,kBAC7C;AACgC,uBAAK;AAAA,gBACrC;AAAA,cACA;AAAA,YACA;AACoB,gBAAI,UAAU,KAAK;AACf,uBAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC5B,yBAAS,UAAU,YAAY,CAAC;AAChC,oBAAI,IAAI,IAAI,OAAO;AACf,2BAAS;AAAA,gBACzC;AAC4B,qBAAK;AAAA,cACjC;AAAA,YACA;AACoB,gBAAI,UAAU,KAAK;AACf,uBAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC5B,yBAAS,UAAU,aAAa,CAAC;AACjC,oBAAI,IAAI,IAAI,OAAO;AACf,2BAAS;AAAA,gBACzC;AAC4B,qBAAK;AAAA,cACjC;AAAA,YACA;AACoB,gBAAI,UAAU,KAAK;AACf,uBAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC5B,yBAAS,UAAU,SAAS,CAAC;AAC7B,oBAAI,IAAI,IAAI,OAAO;AACf,2BAAS;AAAA,gBACzC;AAC4B,qBAAK;AAAA,cACjC;AAAA,YACA;AACoB,gBAAI,UAAU,KAAK;AACf,uBAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC5B,yBAAS,UAAU,UAAU,CAAC;AAC9B,oBAAI,IAAI,IAAI,OAAO;AACf,2BAAS;AAAA,gBACzC;AAC4B,qBAAK;AAAA,cACjC;AAAA,YACA;AACoB,gBAAI,UAAU,KAAK;AACf,uBAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC5B,yBAAS,UAAU,YAAY,CAAC;AAChC,oBAAI,IAAI,IAAI,OAAO;AACf,2BAAS;AAAA,gBACzC;AAC4B,qBAAK;AAAA,cACjC;AAAA,YACA;AACoB;AAAA,UACpB;AAAA,UACgB;AACI,oBAAQ,KAAK,yBAAyB,IAAI,2BAA2B;AACrE,oBAAQ;AACR,gBAAI;AAAA,QACxB;AACY,aAAK,aAAa;AAClB,aAAK,SAAS,KAAK,GAAG;AACtB,YAAI,UAAU,SAAS;AACnB,iBAAO;AAAA,QACvB;AACY,aAAK,KAAK,KAAK,IAAI;AAAA,MAC/B;AACQ,WAAK,iBAAiB;AACtB,aAAO;AAAA,IACf;AAAA,IACI,gBAAgB;AACZ,WAAK,UAAU,EAAE;AAAA,IACzB;AAAA,IACI,YAAY,OAAO;AACf;AAAA;AAAA,QAEA,MACK,MAAM,QAAQ,EAEd,IAAI,QAAM,CAAC,GAAG,MAAM,IAAI,EAAE,CAAC,EAAE,YAAW,GAAI,SAAS,IAAI,EAAE,CAAC,CAAC;AAAA;AAAA,IAC1E;AAAA;AAAA;AAAA;AAAA,IAII,WAAW;AACP,aAAO,CAAC,EAAE,KAAK,QAAQ,UAAU;AAAA,IACzC;AAAA;AAAA,IAEI,mBAAmB;AACf,aAAO,CAAC,EAAE,KAAK,QAAQ,UAAU;AAAA,IACzC;AAAA;AAAA,IAEI,oBAAoB;AAChB,aAAO,CAAC,EAAE,KAAK,QAAQ,UAAU;AAAA,IACzC;AAAA;AAAA,IAEI,iBAAiB;AACb,aAAO,CAAC,EAAE,KAAK,QAAQ,UAAU;AAAA,IACzC;AAAA;AAAA,IAEI,wBAAwB;AACpB,aAAO,CAAC,EAAE,KAAK,QAAQ,UAAU;AAAA,IACzC;AAAA;AAAA,IAEI,4BAA4B;AACxB,aAAO,CAAC,EAAE,KAAK,QAAQ,UAAU;AAAA,IACzC;AAAA;AAAA,IAEI,UAAU;AACN,aAAO,CAAC,EAAE,KAAK,QAAQ,UAAU;AAAA,IACzC;AAAA;AAAA,IAEI,UAAU;AACN,aAAO,CAAC,EAAE,KAAK,QAAQ,UAAU;AAAA,IACzC;AAAA;AAAA,IAEI,cAAc;AACV,aAAO,CAAC,EAAE,KAAK,QAAQ,UAAU;AAAA,IACzC;AAAA;AAAA,IAEI,aAAa;AACT,aAAO,CAAC,EAAE,KAAK,QAAQ,UAAU;AAAA,IACzC;AAAA;AAAA,IAEI,cAAc;AACV,aAAO,CAAC,EAAE,KAAK,QAAQ,UAAU;AAAA,IACzC;AAAA;AAAA,IAEI,kBAAkB;AACd,aAAO,CAAC,EAAE,KAAK,QAAQ,UAAU;AAAA,IACzC;AAAA,IACI,QAAQ;AACJ,UAAI,KAAK,qBAAqB;AAC1B,eAAO;AAAA,MACnB;AACQ,YAAM,EAAE,WAAW,MAAO,IAAG,KAAK;AAClC,YAAM,cAAc,KAAK,IAAI,aAAa;AAC1C,UAAI,IAAI,QAAQ,KAAK,KAAK,IAAI,cAAc;AAC5C,YAAM,SAAS,KAAK,IAAI,YAAY;AACpC,UAAI,QAAQ;AACZ,UAAI,OAAO;AAGX,UAAI,QAAQ,UAAU,YAAY,CAAC;AACnC,UAAI,MAAM,SAAS;AACnB,UAAI,KAAK,cAAc,QAAQ,EAAG;AAClC,UAAI,OAAO,OAAO,QAAQ,QAAQ;AAG9B,aAAK;AACL,gBAAQ,UAAU,YAAY,CAAC;AAC/B,cAAM,SAAS;AACf,aAAK,cAAc,QAAQ,EAAG;AAC9B,YAAI,OAAO,KAAK;AACZ,kBAAQ,KAAK,sBAAsB;AAAA,QACnD;AACY,aAAK,KAAK,gBAAgB;AAC1B,eAAO,KAAK,IAAI,IAAI;AAAA,MAChC,OACa;AACD,iBAAS,IAAI,GAAG,IAAI,aAAa,EAAE,GAAG;AAClC,kBAAQ,UAAU,YAAY,CAAC;AAC/B,gBAAM,SAAS;AACf,eAAK,cAAc,QAAQ,EAAG;AAC9B,mBAAS,MAAM;AAGf,cAAI,OAAO,OAAO,OAAO,OAAO,OAAO,KAAK;AACxC,oBAAQ;AAAA,UAC5B;AACgB,eAAK;AAAA,QACrB;AACY,aAAK,KAAK,gBAAgB;AAC1B,eAAO;AAAA,MACnB;AAAA,IACA;AAAA,IACI,SAAS;AAAA,IAAA;AAAA,IACT,gBAAgB;AACZ,UAAI,KAAK,KAAK,eAAe;AACzB,eAAO,KAAK,KAAK;AAAA,MAC7B,OACa;AACD,aAAK,IAAI,OAAO;AAChB,eAAO,KAAK,KAAK;AAAA,MAC7B;AAAA,IACA;AAAA,IACI,cAAc;AACV,aAAO,KAAK,IAAI,UAAU,IAAI;AAAA,IACtC;AAAA,IACI,eAAe;AACX,aAAO,KAAK,IAAI,YAAY,IAAI;AAAA,IACxC;AAAA;AAAA;AAAA;AAAA,IAII,aAAa;AACT,aAAQ,KAAK,IAAI,YAAY,IAAI,KAAM;AAAA,IAC/C;AAAA,IACI,eAAe;AACX,aAAO,KAAK,IAAK;AAAA,IACzB;AAAA,IACI,MAAM;AACF,YAAM,EAAE,WAAW,MAAO,IAAG,KAAK;AAClC,YAAM,IAAI,QAAQ,KAAK,KAAK,IAAI,cAAc,IAAI,KAAK,IAAI,aAAa,IAAI;AAC5E,YAAM,WAAW,KAAK,IAAI,YAAY;AACtC,YAAM,MAAM,KAAK,IAAI,YAAY;AACjC,UAAI,MAAM;AACV,UAAI,IAAI;AACR,eAAS,IAAI,GAAG,IAAI,UAAU,EAAE,GAAG;AAC/B,cAAM,KAAK,UAAU,IAAI,CAAC;AAC1B,eAAO,gBAAgB,KAAK,QAAS,CAAC;AACtC;AACA,YAAI,IAAI,KAAK;AACT,iBAAO,eAAe,KAAK,EAAI;AAC/B;AAAA,QAChB;AAAA,MACA;AACQ,aAAO;AAAA,IACf;AAAA;AAAA,IAEI,qBAAqB;AACjB,UAAI,CAAC,KAAK,kBAAmB,KACzB,CAAC,KAAK,eAAgB,KACtB,KAAK,WAAW,KAAK,eAAe;AACpC,cAAM,KAAK,KAAK,sBAAuB,IAAG,MAAM;AAChD,cAAM,KAAK,KAAK,0BAA2B,IAAG,MAAM;AACpD,YAAI,KAAK;AACT,YAAI,KAAK;AACT,YAAI,KAAK,WAAW;AAChB,eAAK;AACL,eAAK;AAAA,QACrB,WACqB,KAAK,WAAW;AACrB,eAAK;AACL,eAAK;AAAA,QACrB;AACY,cAAM,MAAM,CAAE;AACd,cAAM,QAAQ,KAAK,gBAAiB;AACpC,YAAI,QAAQ,GAAG;AACX,cAAI,CAAC,IAAI;AACT,cAAI,CAAC,IAAI;AACT,cAAI,CAAC,IAAI;AACT,cAAI,CAAC,IAAI;AAAA,QACzB,OACiB;AACD,cAAI,CAAC,IAAI;AACT,cAAI,CAAC,IAAI;AACT,cAAI,CAAC,IAAI;AACT,cAAI,CAAC,IAAI;AAAA,QACzB;AACY,eAAO,IAAI,KAAK,EAAE;AAAA,MAC9B;AACQ,aAAO;AAAA,IACf;AAAA,IACI,aAAa;AACT,aAAO,KAAK,MAAM,UAAU,YAAY,KAAK,MAAM,QAAQ,EAAE;AAAA,IACrE;AAAA,IACI,WAAW;AACP,aAAO,KAAK,MAAM,UAAU,YAAY,KAAK,MAAM,QAAQ,EAAE;AAAA,IACrE;AAAA,IACI,aAAa;AACT,aAAO,KAAK,MAAM,UAAU,YAAY,KAAK,MAAM,QAAQ,EAAE;AAAA,IACrE;AAAA,IACI,cAAc;AACV,aAAO,KAAK,MAAM,UAAU,YAAY,KAAK,MAAM,QAAQ,EAAE;AAAA,IACrE;AAAA,IACI,YAAY;AACR,aAAO,KAAK,MAAM,UAAU,YAAY,KAAK,MAAM,QAAQ,EAAE;AAAA,IACrE;AAAA,IACI,kBAAkB;AACd,aAAO,KAAK,MAAM,UAAU,YAAY,KAAK,MAAM,QAAQ,EAAE;AAAA,IACrE;AAAA,IACI,SAAS;AACL,YAAM,OAAO,CAAE;AACf,aAAO,KAAK,IAAI,EAAE,QAAQ,OAAK;AAC3B,YAAI,EAAE,OAAO,CAAC,MAAM,OAAO,MAAM,SAAS;AACtC;AAAA,QAChB;AAEY,aAAK,CAAC,IAAI,KAAK,CAAC;AAAA,MAC5B,CAAS;AACD,aAAO;AAAA,IACf;AAAA,EACA;AC7gBO,WAAS,gBAAgB,MAAM;AAClC,UAAM,QAAQ,KAAK,MAAM,OAAO;AAChC,UAAM,OAAO,CAAE;AACf,UAAM,QAAQ,UAAQ;AAClB,YAAM,CAAC,KAAK,GAAG,MAAM,IAAI,KAAK,MAAM,IAAI;AACxC,YAAM,eAAe,OAAO,IAAI,OAAK;AACjC,cAAM,CAAC,UAAU,KAAK,IAAI,EAAE,MAAM,KAAK,CAAC;AACxC,eAAO,EAAE,KAAK,UAAU,MAAO;AAAA,MAC3C,CAAS;AACD,UAAI,KAAK;AACL,aAAK,KAAK,EAAE,KAAK,IAAI,OAAO,CAAC,GAAG,MAAM,cAAc;AAAA,MAChE;AAAA,IACA,CAAK;AACD,WAAO;AAAA,EACX;ACDO,QAAM,YAAY;AACzB,QAAM,WAAW,KAAK;AACtB,WAAS,KAAK,KAAK;AACf,WAAO,CAAE,EAAC,OAAO,GAAG,GAAG;AAAA,EAC3B;AACA,iBAAe,UAAU,KAAK;AAC1B,UAAM,MAAM,CAAE;AACd,qBAAiB,KAAK,KAAK;AACvB,UAAI,KAAK,CAAC;AAAA,IAClB;AACI,WAAO;AAAA,EACX;AACe,MAAA,YAAA,MAAM,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQzB,YAAY,EAAE,eAAe,SAAS,QAAQ,SAAS,eAAe,QAAQ,SAAS,eAAe,QAAQ,gBAAgB,gBAAgB,kBAAkB,KAAK,gBAAgB,OAAK,KAAM;AAC5L,WAAK,eAAe,IAAI,sBAAsB;AAAA;AAAA,QAE1C,OAAO,IAAIA,WAAS;AAAA,UAChB,SAAS;AAAA,QACzB,CAAa;AAAA;AAAA,QAED,MAAM,OAAO,EAAE,OAAO,KAAI,GAAI,WAAW;AACrC,gBAAM,EAAE,MAAM,YAAY,WAAU,IAAK,MAAM,KAAK,WAAW;AAAA,YAC3D;AAAA,YACA,MAAM,EAAE,GAAG,MAAM,OAAQ;AAAA,UAC7C,CAAiB;AACD,gBAAM,QAAQ,MAAM,KAAK,gBAAgB,MAAM,YAAY,YAAY,KAAK;AAC5E,iBAAO;AAAA,QACV;AAAA,MACb,CAAS;AACD,WAAK,eAAe;AACpB,UAAI,eAAe;AACf,aAAK,MAAM;AAAA,MACvB,WACiB,SAAS;AACd,aAAK,MAAM,IAAI,UAAU,OAAO;AAAA,MAC5C,WACiB,QAAQ;AACb,aAAK,MAAM,IAAIC,aAAW,MAAM;AAAA,MAC5C,OACa;AACD,cAAM,IAAI,MAAM,0BAA0B;AAAA,MACtD;AACQ,UAAI,eAAe;AACf,aAAK,QAAQ,IAAI,IAAI,EAAE,YAAY,cAAa,CAAE;AAAA,MAC9D,WACiB,SAAS;AACd,aAAK,QAAQ,IAAI,IAAI,EAAE,YAAY,IAAI,UAAU,OAAO,GAAG;AAAA,MACvE,WACiB,QAAQ;AACb,aAAK,QAAQ,IAAI,IAAI,EAAE,YAAY,IAAIA,aAAW,MAAM,GAAG;AAAA,MACvE,WACiB,eAAe;AACpB,aAAK,QAAQ,IAAI,IAAI,EAAE,YAAY,cAAa,CAAE;AAAA,MAC9D,WACiB,SAAS;AACd,aAAK,QAAQ,IAAI,IAAI,EAAE,YAAY,IAAI,UAAU,OAAO,GAAG;AAAA,MACvE,WACiB,QAAQ;AACb,aAAK,QAAQ,IAAI,IAAI,EAAE,YAAY,IAAIA,aAAW,MAAM,GAAG;AAAA,MACvE,WACiB,SAAS;AACd,aAAK,QAAQ,IAAI,IAAI,EAAE,YAAY,IAAI,UAAU,GAAG,OAAO,MAAM,EAAC,CAAE;AAAA,MAChF,WACiB,QAAQ;AACb,aAAK,QAAQ,IAAI,IAAI,EAAE,YAAY,IAAIA,aAAW,GAAG,MAAM,MAAM,EAAC,CAAE;AAAA,MAChF,OACa;AACD,cAAM,IAAI,MAAM,8BAA8B;AAAA,MAC1D;AACQ,WAAK,iBAAiB,kBAAkB;AACxC,WAAK,iBAAiB,kBAAkB;AACxC,WAAK,kBAAkB;AAAA,IAC/B;AAAA,IACI,MAAM,UAAU,WAAW,IAAI;AAC3B,YAAM,OAAO,SAAS,QAAQ;AAC9B,YAAM,YAAY,MAAM,KAAK,MAAM,MAAM,IAAI;AAC7C,YAAM,MAAM,UAAU,gBAChB,UAAU,cAAc,gBAAgB,QACxC;AACN,UAAItC;AACJ,UAAI,KAAK;AACL,cAAM,MAAM,MAAM,KAAK,IAAI,KAAKE,cAAM,OAAC,MAAM,MAAM,QAAQ,GAAG,GAAG,MAAM,UAAU,GAAG,IAAI;AACxF,cAAM,EAAE,UAAS,IAAK;AACtB,SAAC,EAAE,QAAAF,QAAM,IAAK;AACd,YAAI,CAAC,WAAW;AACZ,gBAAM,IAAI,MAAM,sBAAsB;AAAA,QACtD;AACY,YAAI,YAAY,KAAK;AACjB,UAAAA,UAASA,QAAO,SAAS,GAAG,SAAS;AAAA,QACrD,OACiB;AACD,UAAAA,UAASA,QAAO,SAAS,GAAG,GAAG;AAAA,QAC/C;AAAA,MACA,OACa;AACD,QAAAA,UAAU,MAAM,KAAK,IAAI,SAAS,IAAI;AAAA,MAClD;AACQ,YAAM,QAAQ,MAAM,MAAMA,OAAM;AAChC,UAAI,MAAM,YAAY,CAAC,MAAM,WAAW;AACpC,cAAM,IAAI,MAAM,gBAAgB;AAAA,MAC5C;AACQ,YAAM,UAAU,MAAM,YAAY,CAAC;AACnC,WAAK,SAAS,MAAM,SAAS,QAAQ,GAAG,IAAI,OAAO;AACnD,YAAM,EAAE,YAAY,WAAU,IAAK,MAAM,KAAK,aAAa,UAAU,GAAG,OAAO,IAAI;AACnF,WAAK,aAAa;AAClB,WAAK,aAAa;AAClB,aAAO,gBAAgB,KAAK,MAAM;AAAA,IAC1C;AAAA,IACI,MAAM,cAAc,OAAO,IAAI;AAC3B,YAAM,KAAK,UAAU,IAAI;AACzB,aAAO,KAAK;AAAA,IACpB;AAAA;AAAA;AAAA,IAGI,MAAM,aAAa,OAAO,aAAa,OAAO,CAAA,GAAI;AAC9C,UAAI,QAAQ,aAAa;AACrB,eAAO,KAAK,aAAa,OAAO,cAAc,GAAG,IAAI;AAAA,MACjE;AACQ,YAAM,OAAO,cAAc;AAC3B,YAAM,EAAE,WAAW,QAAAA,QAAM,IAAK,MAAM,KAAK,IAAI,KAAKE,cAAM,OAAC,MAAM,IAAI,GAAG,GAAG,aAAa,GAAG,IAAI;AAC7F,UAAI,CAAC,WAAW;AACZ,cAAM,IAAI,MAAM,mCAAmC;AAAA,MAC/D;AACQ,YAAM,QAAQ,MAAM,MAAMF,QAAO,SAAS,GAAG,KAAK,IAAI,WAAW,WAAW,CAAC,CAAC;AAC9E,YAAM,OAAO,MAAM,YAAY,KAAK;AACpC,UAAI,IAAI,QAAQ;AAChB,YAAM,aAAa,CAAE;AACrB,YAAM,aAAa,CAAE;AACrB,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK,GAAG;AAC9B,cAAM,QAAQ,MAAM,YAAY,CAAC;AACjC,cAAM,UAAU,KAAK,aAAa,MAAM,SAAS,QAAQ,IAAI,GAAG,IAAI,IAAI,QAAQ,CAAC,CAAC;AAClF,cAAM,OAAO,MAAM,YAAY,IAAI,QAAQ,CAAC;AAC5C,mBAAW,OAAO,IAAI;AACtB,mBAAW,KAAK,EAAE,SAAS,QAAQ,KAAI,CAAE;AACzC,YAAI,IAAI,IAAI;AACZ,YAAI,IAAI,MAAM,QAAQ;AAClB,kBAAQ,KAAK,wCAAwC,WAAW,SAAS;AACzE,iBAAO,KAAK,aAAa,OAAO,cAAc,GAAG,IAAI;AAAA,QACrE;AAAA,MACA;AACQ,aAAO,EAAE,YAAY,WAAY;AAAA,IACzC;AAAA,IACI,MAAM,mBAAmB,KAAK,KAAK,KAAK,OAAO;AAAA,MAC3C,aAAa;AAAA,MACb,eAAe;AAAA,MACf,eAAe;AAAA,IACvB,GAAO;AACC,aAAO,KAAK,MAAM,UAAU,KAAK,sBAAsB,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC;AAAA,IACpF;AAAA,IACI,OAAO,sBAAsB,KAAK,KAAK,KAAK,OAAO,CAAA,GAAI;AACnD,YAAM,EAAE,OAAM,IAAK;AACnB,YAAM,QAAQ,KAAK,cAAc,KAAK,WAAW,GAAG;AACpD,UAAI;AACJ,UAAI,EAAE,SAAS,IAAI;AACf,iBAAS,CAAE;AAAA,MACvB,OACa;AACD,iBAAS,MAAM,KAAK,MAAM,eAAe,OAAO,MAAM,GAAG,KAAK,IAAI;AAClE,YAAI,CAAC,QAAQ;AACT,gBAAM,IAAI,MAAM,sBAAsB;AAAA,QACtD;AAAA,MACA;AACQ,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACvC,cAAM,gBAAgB,MAAM;AAC5B,cAAM,OAAO,OAAO,CAAC,EAAE,YAAa;AACpC,YAAI,OAAO,KAAK,gBAAgB;AAC5B,gBAAM,IAAI,MAAM,yCAAyC,IAAI,oCAAoC,KAAK,cAAc,EAAE;AAAA,QACtI;AAAA,MACA;AACQ,YAAM,YAAY,OACb,IAAI,OAAK,EAAE,YAAa,CAAA,EACxB,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAC9B,UAAI,YAAY,KAAK,gBAAgB;AACjC,cAAM,IAAI,MAAM,gBAAgB,UAAU,eAAc,CAAE,uCAAuC,KAAK,eAAe,eAAgB,CAAA,QAAQ;AAAA,MACzJ;AACQ,aAAO,KAAK,oBAAoB,QAAQ,OAAO,KAAK,KAAK,IAAI;AAAA,IACrE;AAAA,IACI,OAAO,oBAAoB,QAAQ,OAAO,KAAK,KAAK,MAAM;AACtD,YAAM,EAAE,cAAc,MAAK,IAAK;AAChC,YAAM,QAAQ,CAAE;AAChB,UAAI,OAAO;AACX,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,cAAM,IAAI,OAAO,CAAC;AAClB,cAAM,UAAW,MAAM,KAAK,aAAa,IAAI,EAAE,YAAY;AAAA,UACvD,OAAO;AAAA,UACP;AAAA,QAChB,GAAe,KAAK,MAAM;AACd,cAAM,OAAO,CAAE;AACf,iBAASF,KAAI,GAAGA,KAAI,QAAQ,QAAQA,MAAK,GAAG;AACxC,gBAAM,UAAU,QAAQA,EAAC;AACzB,cAAI,QAAQ,OAAQ,MAAK,OAAO;AAC5B,gBAAI,QAAQ,IAAI,OAAO,KAAK,KAAK;AAE7B,qBAAO;AACP;AAAA,YACxB,WAC6B,QAAQ,IAAI,KAAK,KAAK,KAAK;AAEhC,mBAAK,KAAK,OAAO;AAAA,YACzC;AAAA,UACA;AAAA,QACA;AACY,cAAM,KAAK,IAAI;AACf,cAAM;AACN,YAAI,MAAM;AACN;AAAA,QAChB;AAAA,MACA;AACQ,uBAAiB,KAAK,MAAM;AAC5B,UAAI,aAAa;AACb,cAAM,KAAK,WAAW,OAAO,OAAO,IAAI;AAAA,MACpD;AAAA,IACA;AAAA,IACI,MAAM,WAAW,OAAO,OAAO,MAAM;AACjC,YAAM,EAAE,gBAAgB,OAAO,gBAAgB,IAAQ,IAAG;AAC1D,YAAM,eAAe,CAAE;AACvB,YAAM,UAAU,CAAE;AAClB,YAAM,IAAI,SAAO;AACb,cAAM,YAAY,CAAE;AACpB,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACjC,gBAAM,OAAO,IAAI,CAAC,EAAE,KAAM;AAC1B,gBAAM,KAAK,IAAI,CAAC,EAAE,GAAI;AACtB,cAAI,CAAC,UAAU,IAAI,GAAG;AAClB,sBAAU,IAAI,IAAI;AAAA,UACtC;AACgB,oBAAU,IAAI;AACd,kBAAQ,EAAE,IAAI;AAAA,QAC9B;AACY,gBAAQ,SAAS,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM;AACnC,cAAI,MAAM,GAAG;AACT,yBAAa,CAAC,IAAI;AAAA,UACtC;AAAA,QACA,CAAa;AAAA,MACb,CAAS;AACD,YAAM,eAAe,CAAE;AACvB,YAAM,IAAI,SAAO;AACb,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACjC,gBAAM,IAAI,IAAI,CAAC;AACf,gBAAM,OAAO,EAAE,KAAM;AACrB,gBAAM,QAAQ,EAAE,IAAI,OAAO;AAC3B,gBAAM,QAAQ,EAAE,UAAW;AAC3B,gBAAM,QAAQ,EAAE,YAAa;AAC7B,cAAI,aAAa,IAAI,MAChB,iBACI,UAAU,SAAS,KAAK,IAAI,QAAQ,KAAK,IAAI,gBAAiB;AACnE,yBAAa,KAAK,KAAK,MAAM,eAAe,OAAO,OAAO,QAAQ,GAAG,IAAI,CAAC;AAAA,UAC9F;AAAA,QACA;AAAA,MACA,CAAS;AAGD,YAAM,aAAa,KAAK,MAAM,QAAQ,IAAI,YAAY,CAAC,EAClD,KAAI,EACJ,OAAO,CAAC,MAAM,KAAK,QAAQ,CAAC,OAAO,KAAK,SAAQ,MAAO,IAAI,MAAM,CAAC,EAAE,SAAQ,CAAE;AACnF,YAAM,gBAAgB,WACjB,IAAI,OAAK,EAAE,YAAa,CAAA,EACxB,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAC9B,UAAI,gBAAgB,KAAK,gBAAgB;AACrC,cAAM,IAAI,MAAM,gBAAgB,cAAc,eAAc,CAAE,uCAAuC,KAAK,eAAe,eAAgB,CAAA,QAAQ;AAAA,MAC7J;AACQ,YAAM,mBAAmB,WAAW,IAAI,OAAO,MAAM;AACjD,cAAM,EAAE,MAAM,YAAY,YAAY,UAAU,MAAM,KAAK,WAAW;AAAA,UAClE,OAAO;AAAA,UACP;AAAA,QAChB,CAAa;AACD,cAAMyC,SAAQ,MAAM,KAAK,gBAAgB,MAAM,YAAY,YAAY,KAAK;AAC5E,cAAM,WAAW,CAAE;AACnB,iBAAS,IAAI,GAAG,IAAIA,OAAM,QAAQ,KAAK,GAAG;AACtC,gBAAM,UAAUA,OAAM,CAAC;AACvB,cAAI,aAAa,QAAQ,IAAI,MAAM,CAAC,KAAK,CAAC,QAAQ,QAAQ,GAAE,CAAE,GAAG;AAC7D,qBAAS,KAAK,OAAO;AAAA,UACzC;AAAA,QACA;AACY,eAAO;AAAA,MACnB,CAAS;AACD,aAAO,KAAK,MAAM,QAAQ,IAAI,gBAAgB,CAAC;AAAA,IACvD;AAAA,IACI,MAAM,WAAW,EAAE,OAAO,QAAQ;AAC9B,YAAM,OAAO,MAAM,YAAa;AAChC,YAAM,EAAE,QAAAvC,SAAQ,UAAW,IAAG,MAAM,KAAK,IAAI,KAAKE,cAAM,OAAC,MAAM,IAAI,GAAG,GAAG,MAAM,MAAM,KAAK,eAAe,IAAI;AAC7G,YAAM,EAAE,QAAQ,MAAM,YAAY,WAAU,IAAM,MAAM,gBAAgBF,QAAO,SAAS,GAAG,KAAK,IAAI,WAAW,IAAI,CAAC,GAAG,KAAK;AAC5H,aAAO,EAAE,MAAM,YAAY,YAAY,MAAO;AAAA,IACtD;AAAA,IACI,MAAM,gBAAgB,IAAI,YAAY,YAAY,OAAO;AACrD,UAAI,aAAa;AACjB,YAAM,OAAO,CAAE;AACf,UAAI,MAAM;AACV,UAAI,OAAO,CAAC,KAAK,IAAK;AACtB,aAAO,aAAa,IAAI,GAAG,QAAQ;AAC/B,cAAM,YAAY,GAAG,YAAY,UAAU;AAC3C,cAAM,WAAW,aAAa,IAAI,YAAY;AAE9C,YAAI,YAAY;AACZ,iBAAO,aAAa,MAAM,KAAK,gBAAgB,WAAW,KAAK,GAAG;AAAA,UAAA;AAClE;AAAA,QAChB;AAEY,YAAI,WAAW,GAAG,QAAQ;AACtB,gBAAM,UAAU,IAAIwC,UAAW;AAAA,YAC3B,OAAO;AAAA,cACH,WAAW;AAAA,cACX,OAAO;AAAA,cACP,KAAK;AAAA,YACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAiBD,YAAY,aACN,WAAW,GAAG,KAAK,KAAK,MACrB,aAAa,WAAW,GAAG,KAC5B,MAAM,KAAK,eACX;AAAA;AAAA,cAEA,MAAM,OAAO,GAAG,MAAM,YAAY,QAAQ,CAAC;AAAA;AAAA,UACvE,CAAiB;AACD,eAAK,KAAK,OAAO;AACjB,cAAI,KAAK,mBAAmB,CAAC,KAAK,IAAG,IAAK,OAAO,KAAK,iBAAiB;AACnE,kBAAM,QAAQ,CAAC;AACf,mBAAO,CAAC,KAAK,IAAK;AAAA,UACtC;AAAA,QACA;AACY,qBAAa,WAAW;AAAA,MACpC;AACQ,aAAO;AAAA,IACf;AAAA,IACI,MAAM,UAAU,SAAS;AACrB,YAAM,QAAQ,KAAK,cAAc,KAAK,WAAW,OAAO;AACxD,aAAO,KAAK,MAAM,UAAU,KAAK;AAAA,IACzC;AAAA,IACI,MAAM,UAAU,SAAS;AACrB,YAAM,QAAQ,KAAK,cAAc,KAAK,WAAW,OAAO;AACxD,aAAO,KAAK,MAAM,UAAU,KAAK;AAAA,IACzC;AAAA,IACI,MAAM,SAAS,SAAS,OAAO,KAAK;AAChC,YAAM,KAAK,MAAM,MAAO;AACxB,YAAM,QAAQ,KAAK,cAAc,KAAK,WAAW,OAAO;AACxD,aAAO,KAAK,MAAM,SAAS,OAAO,OAAO,GAAG;AAAA,IACpD;AAAA,IACI,MAAM,eAAe,SAAS,OAAO,KAAK,MAAM;AAC5C,YAAM,KAAK,MAAM,MAAO;AACxB,YAAM,QAAQ,KAAK,cAAc,KAAK,WAAW,OAAO;AACxD,aAAO,KAAK,MAAM,eAAe,OAAO,OAAO,KAAK,IAAI;AAAA,IAChE;AAAA,EACA;;;;;;;ACxXA,OAAC,SAASjB,OAAM;AAEC,SAAC,SAAU,SAAS;AAGnC,cAAI,IACD,OAAO,eAAe,eAAe,cACrC,OAAOA,UAAS,eAAeA;AAAA,UAE/B,OAAOO,mBAAW,eAAeA,kBAClC,CAAE;AAEJ,cAAI,UAAU;AAAA,YACZ,cAAc,qBAAqB;AAAA,YACnC,UAAU,YAAY,KAAK,cAAc;AAAA,YACzC,MACE,gBAAgB,KAChB,UAAU,KACT,WAAW;AACV,kBAAI;AACF,oBAAI,KAAM;AACV,uBAAO;AAAA,cACR,SAAQ,GAAG;AACV,uBAAO;AAAA,cACjB;AAAA,YACA,EAAU;AAAA,YACN,UAAU,cAAc;AAAA,YACxB,aAAa,iBAAiB;AAAA,UAC/B;AAED,mBAAS,WAAW,KAAK;AACvB,mBAAO,OAAO,SAAS,UAAU,cAAc,GAAG;AAAA,UACtD;AAEE,cAAI,QAAQ,aAAa;AACvB,gBAAI,cAAc;AAAA,cAChB;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACD;AAED,gBAAI,oBACF,YAAY,UACZ,SAAS,KAAK;AACZ,qBAAO,OAAO,YAAY,QAAQ,OAAO,UAAU,SAAS,KAAK,GAAG,CAAC,IAAI;AAAA,YAC1E;AAAA,UACP;AAEE,mBAAS,cAAc,MAAM;AAC3B,gBAAI,OAAO,SAAS,UAAU;AAC5B,qBAAO,OAAO,IAAI;AAAA,YACxB;AACI,gBAAI,6BAA6B,KAAK,IAAI,KAAK,SAAS,IAAI;AAC1D,oBAAM,IAAI,UAAU,8CAA8C,OAAO,GAAG;AAAA,YAClF;AACI,mBAAO,KAAK,YAAW;AAAA,UAC3B;AAEE,mBAAS,eAAe,OAAO;AAC7B,gBAAI,OAAO,UAAU,UAAU;AAC7B,sBAAQ,OAAO,KAAK;AAAA,YAC1B;AACI,mBAAO;AAAA,UACX;AAGE,mBAAS,YAAY,OAAO;AAC1B,gBAAI,WAAW;AAAA,cACb,MAAM,WAAW;AACf,oBAAI,QAAQ,MAAM,MAAO;AACzB,uBAAO,EAAC,MAAM,UAAU,QAAW,MAAY;AAAA,cACvD;AAAA,YACK;AAED,gBAAI,QAAQ,UAAU;AACpB,uBAAS,OAAO,QAAQ,IAAI,WAAW;AACrC,uBAAO;AAAA,cACR;AAAA,YACP;AAEI,mBAAO;AAAA,UACX;AAEE,mBAAS,QAAQ,SAAS;AACxB,iBAAK,MAAM,CAAE;AAEb,gBAAI,mBAAmB,SAAS;AAC9B,sBAAQ,QAAQ,SAAS,OAAO,MAAM;AACpC,qBAAK,OAAO,MAAM,KAAK;AAAA,cACxB,GAAE,IAAI;AAAA,YACR,WAAU,MAAM,QAAQ,OAAO,GAAG;AACjC,sBAAQ,QAAQ,SAAS,QAAQ;AAC/B,oBAAI,OAAO,UAAU,GAAG;AACtB,wBAAM,IAAI,UAAU,wEAAwE,OAAO,MAAM;AAAA,gBACnH;AACQ,qBAAK,OAAO,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,cACjC,GAAE,IAAI;AAAA,YACR,WAAU,SAAS;AAClB,qBAAO,oBAAoB,OAAO,EAAE,QAAQ,SAAS,MAAM;AACzD,qBAAK,OAAO,MAAM,QAAQ,IAAI,CAAC;AAAA,cAChC,GAAE,IAAI;AAAA,YACb;AAAA,UACA;AAEE,kBAAQ,UAAU,SAAS,SAAS,MAAM,OAAO;AAC/C,mBAAO,cAAc,IAAI;AACzB,oBAAQ,eAAe,KAAK;AAC5B,gBAAI,WAAW,KAAK,IAAI,IAAI;AAC5B,iBAAK,IAAI,IAAI,IAAI,WAAW,WAAW,OAAO,QAAQ;AAAA,UACvD;AAED,kBAAQ,UAAU,QAAQ,IAAI,SAAS,MAAM;AAC3C,mBAAO,KAAK,IAAI,cAAc,IAAI,CAAC;AAAA,UACpC;AAED,kBAAQ,UAAU,MAAM,SAAS,MAAM;AACrC,mBAAO,cAAc,IAAI;AACzB,mBAAO,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;AAAA,UAC1C;AAED,kBAAQ,UAAU,MAAM,SAAS,MAAM;AACrC,mBAAO,KAAK,IAAI,eAAe,cAAc,IAAI,CAAC;AAAA,UACnD;AAED,kBAAQ,UAAU,MAAM,SAAS,MAAM,OAAO;AAC5C,iBAAK,IAAI,cAAc,IAAI,CAAC,IAAI,eAAe,KAAK;AAAA,UACrD;AAED,kBAAQ,UAAU,UAAU,SAAS,UAAU,SAAS;AACtD,qBAAS,QAAQ,KAAK,KAAK;AACzB,kBAAI,KAAK,IAAI,eAAe,IAAI,GAAG;AACjC,yBAAS,KAAK,SAAS,KAAK,IAAI,IAAI,GAAG,MAAM,IAAI;AAAA,cACzD;AAAA,YACA;AAAA,UACG;AAED,kBAAQ,UAAU,OAAO,WAAW;AAClC,gBAAI,QAAQ,CAAE;AACd,iBAAK,QAAQ,SAAS,OAAO,MAAM;AACjC,oBAAM,KAAK,IAAI;AAAA,YACrB,CAAK;AACD,mBAAO,YAAY,KAAK;AAAA,UACzB;AAED,kBAAQ,UAAU,SAAS,WAAW;AACpC,gBAAI,QAAQ,CAAE;AACd,iBAAK,QAAQ,SAAS,OAAO;AAC3B,oBAAM,KAAK,KAAK;AAAA,YACtB,CAAK;AACD,mBAAO,YAAY,KAAK;AAAA,UACzB;AAED,kBAAQ,UAAU,UAAU,WAAW;AACrC,gBAAI,QAAQ,CAAE;AACd,iBAAK,QAAQ,SAAS,OAAO,MAAM;AACjC,oBAAM,KAAK,CAAC,MAAM,KAAK,CAAC;AAAA,YAC9B,CAAK;AACD,mBAAO,YAAY,KAAK;AAAA,UACzB;AAED,cAAI,QAAQ,UAAU;AACpB,oBAAQ,UAAU,OAAO,QAAQ,IAAI,QAAQ,UAAU;AAAA,UAC3D;AAEE,mBAAS,SAAS,MAAM;AACtB,gBAAI,KAAK,QAAS;AAClB,gBAAI,KAAK,UAAU;AACjB,qBAAO,QAAQ,OAAO,IAAI,UAAU,cAAc,CAAC;AAAA,YACzD;AACI,iBAAK,WAAW;AAAA,UACpB;AAEE,mBAAS,gBAAgB,QAAQ;AAC/B,mBAAO,IAAI,QAAQ,SAAS,SAAS,QAAQ;AAC3C,qBAAO,SAAS,WAAW;AACzB,wBAAQ,OAAO,MAAM;AAAA,cACtB;AACD,qBAAO,UAAU,WAAW;AAC1B,uBAAO,OAAO,KAAK;AAAA,cACpB;AAAA,YACF,CAAA;AAAA,UACL;AAEE,mBAAS,sBAAsB,MAAM;AACnC,gBAAI,SAAS,IAAI,WAAY;AAC7B,gBAAI,UAAU,gBAAgB,MAAM;AACpC,mBAAO,kBAAkB,IAAI;AAC7B,mBAAO;AAAA,UACX;AAEE,mBAAS,eAAe,MAAM;AAC5B,gBAAI,SAAS,IAAI,WAAY;AAC7B,gBAAI,UAAU,gBAAgB,MAAM;AACpC,gBAAI,QAAQ,2BAA2B,KAAK,KAAK,IAAI;AACrD,gBAAI,WAAW,QAAQ,MAAM,CAAC,IAAI;AAClC,mBAAO,WAAW,MAAM,QAAQ;AAChC,mBAAO;AAAA,UACX;AAEE,mBAAS,sBAAsB,KAAK;AAClC,gBAAI,OAAO,IAAI,WAAW,GAAG;AAC7B,gBAAI,QAAQ,IAAI,MAAM,KAAK,MAAM;AAEjC,qBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,oBAAM,CAAC,IAAI,OAAO,aAAa,KAAK,CAAC,CAAC;AAAA,YAC5C;AACI,mBAAO,MAAM,KAAK,EAAE;AAAA,UACxB;AAEE,mBAAS,YAAY,KAAK;AACxB,gBAAI,IAAI,OAAO;AACb,qBAAO,IAAI,MAAM,CAAC;AAAA,YACxB,OAAW;AACL,kBAAI,OAAO,IAAI,WAAW,IAAI,UAAU;AACxC,mBAAK,IAAI,IAAI,WAAW,GAAG,CAAC;AAC5B,qBAAO,KAAK;AAAA,YAClB;AAAA,UACA;AAEE,mBAAS,OAAO;AACd,iBAAK,WAAW;AAEhB,iBAAK,YAAY,SAAS,MAAM;AAY9B,mBAAK,WAAW,KAAK;AACrB,mBAAK,YAAY;AACjB,kBAAI,CAAC,MAAM;AACT,qBAAK,UAAU;AACf,qBAAK,YAAY;AAAA,cACzB,WAAiB,OAAO,SAAS,UAAU;AACnC,qBAAK,YAAY;AAAA,cACzB,WAAiB,QAAQ,QAAQ,KAAK,UAAU,cAAc,IAAI,GAAG;AAC7D,qBAAK,YAAY;AAAA,cACzB,WAAiB,QAAQ,YAAY,SAAS,UAAU,cAAc,IAAI,GAAG;AACrE,qBAAK,gBAAgB;AAAA,cAC7B,WAAiB,QAAQ,gBAAgB,gBAAgB,UAAU,cAAc,IAAI,GAAG;AAChF,qBAAK,YAAY,KAAK,SAAU;AAAA,cACxC,WAAiB,QAAQ,eAAe,QAAQ,QAAQ,WAAW,IAAI,GAAG;AAClE,qBAAK,mBAAmB,YAAY,KAAK,MAAM;AAE/C,qBAAK,YAAY,IAAI,KAAK,CAAC,KAAK,gBAAgB,CAAC;AAAA,cAClD,WAAU,QAAQ,gBAAgB,YAAY,UAAU,cAAc,IAAI,KAAK,kBAAkB,IAAI,IAAI;AACxG,qBAAK,mBAAmB,YAAY,IAAI;AAAA,cAChD,OAAa;AACL,qBAAK,YAAY,OAAO,OAAO,UAAU,SAAS,KAAK,IAAI;AAAA,cACnE;AAEM,kBAAI,CAAC,KAAK,QAAQ,IAAI,cAAc,GAAG;AACrC,oBAAI,OAAO,SAAS,UAAU;AAC5B,uBAAK,QAAQ,IAAI,gBAAgB,0BAA0B;AAAA,gBAC5D,WAAU,KAAK,aAAa,KAAK,UAAU,MAAM;AAChD,uBAAK,QAAQ,IAAI,gBAAgB,KAAK,UAAU,IAAI;AAAA,gBAC9D,WAAmB,QAAQ,gBAAgB,gBAAgB,UAAU,cAAc,IAAI,GAAG;AAChF,uBAAK,QAAQ,IAAI,gBAAgB,iDAAiD;AAAA,gBAC5F;AAAA,cACA;AAAA,YACK;AAED,gBAAI,QAAQ,MAAM;AAChB,mBAAK,OAAO,WAAW;AACrB,oBAAI,WAAW,SAAS,IAAI;AAC5B,oBAAI,UAAU;AACZ,yBAAO;AAAA,gBACjB;AAEQ,oBAAI,KAAK,WAAW;AAClB,yBAAO,QAAQ,QAAQ,KAAK,SAAS;AAAA,gBAC/C,WAAmB,KAAK,kBAAkB;AAChC,yBAAO,QAAQ,QAAQ,IAAI,KAAK,CAAC,KAAK,gBAAgB,CAAC,CAAC;AAAA,gBAClE,WAAmB,KAAK,eAAe;AAC7B,wBAAM,IAAI,MAAM,sCAAsC;AAAA,gBAChE,OAAe;AACL,yBAAO,QAAQ,QAAQ,IAAI,KAAK,CAAC,KAAK,SAAS,CAAC,CAAC;AAAA,gBAC3D;AAAA,cACO;AAAA,YACP;AAEI,iBAAK,cAAc,WAAW;AAC5B,kBAAI,KAAK,kBAAkB;AACzB,oBAAI,aAAa,SAAS,IAAI;AAC9B,oBAAI,YAAY;AACd,yBAAO;AAAA,gBACR,WAAU,YAAY,OAAO,KAAK,gBAAgB,GAAG;AACpD,yBAAO,QAAQ;AAAA,oBACb,KAAK,iBAAiB,OAAO;AAAA,sBAC3B,KAAK,iBAAiB;AAAA,sBACtB,KAAK,iBAAiB,aAAa,KAAK,iBAAiB;AAAA,oBACvE;AAAA,kBACA;AAAA,gBACA,OAAe;AACL,yBAAO,QAAQ,QAAQ,KAAK,gBAAgB;AAAA,gBACtD;AAAA,cACA,WAAiB,QAAQ,MAAM;AACvB,uBAAO,KAAK,OAAO,KAAK,qBAAqB;AAAA,cACrD,OAAa;AACL,sBAAM,IAAI,MAAM,+BAA+B;AAAA,cACvD;AAAA,YACK;AAED,iBAAK,OAAO,WAAW;AACrB,kBAAI,WAAW,SAAS,IAAI;AAC5B,kBAAI,UAAU;AACZ,uBAAO;AAAA,cACf;AAEM,kBAAI,KAAK,WAAW;AAClB,uBAAO,eAAe,KAAK,SAAS;AAAA,cAC5C,WAAiB,KAAK,kBAAkB;AAChC,uBAAO,QAAQ,QAAQ,sBAAsB,KAAK,gBAAgB,CAAC;AAAA,cAC3E,WAAiB,KAAK,eAAe;AAC7B,sBAAM,IAAI,MAAM,sCAAsC;AAAA,cAC9D,OAAa;AACL,uBAAO,QAAQ,QAAQ,KAAK,SAAS;AAAA,cAC7C;AAAA,YACK;AAED,gBAAI,QAAQ,UAAU;AACpB,mBAAK,WAAW,WAAW;AACzB,uBAAO,KAAK,OAAO,KAAK,MAAM;AAAA,cAC/B;AAAA,YACP;AAEI,iBAAK,OAAO,WAAW;AACrB,qBAAO,KAAK,KAAI,EAAG,KAAK,KAAK,KAAK;AAAA,YACnC;AAED,mBAAO;AAAA,UACX;AAGE,cAAI,UAAU,CAAC,WAAW,UAAU,OAAO,QAAQ,WAAW,SAAS,QAAQ,OAAO,OAAO;AAE7F,mBAAS,gBAAgB,QAAQ;AAC/B,gBAAI,UAAU,OAAO,YAAa;AAClC,mBAAO,QAAQ,QAAQ,OAAO,IAAI,KAAK,UAAU;AAAA,UACrD;AAEE,mBAAS,QAAQ,OAAO,SAAS;AAC/B,gBAAI,EAAE,gBAAgB,UAAU;AAC9B,oBAAM,IAAI,UAAU,4FAA4F;AAAA,YACtH;AAEI,sBAAU,WAAW,CAAE;AACvB,gBAAI,OAAO,QAAQ;AAEnB,gBAAI,iBAAiB,SAAS;AAC5B,kBAAI,MAAM,UAAU;AAClB,sBAAM,IAAI,UAAU,cAAc;AAAA,cAC1C;AACM,mBAAK,MAAM,MAAM;AACjB,mBAAK,cAAc,MAAM;AACzB,kBAAI,CAAC,QAAQ,SAAS;AACpB,qBAAK,UAAU,IAAI,QAAQ,MAAM,OAAO;AAAA,cAChD;AACM,mBAAK,SAAS,MAAM;AACpB,mBAAK,OAAO,MAAM;AAClB,mBAAK,SAAS,MAAM;AACpB,kBAAI,CAAC,QAAQ,MAAM,aAAa,MAAM;AACpC,uBAAO,MAAM;AACb,sBAAM,WAAW;AAAA,cACzB;AAAA,YACA,OAAW;AACL,mBAAK,MAAM,OAAO,KAAK;AAAA,YAC7B;AAEI,iBAAK,cAAc,QAAQ,eAAe,KAAK,eAAe;AAC9D,gBAAI,QAAQ,WAAW,CAAC,KAAK,SAAS;AACpC,mBAAK,UAAU,IAAI,QAAQ,QAAQ,OAAO;AAAA,YAChD;AACI,iBAAK,SAAS,gBAAgB,QAAQ,UAAU,KAAK,UAAU,KAAK;AACpE,iBAAK,OAAO,QAAQ,QAAQ,KAAK,QAAQ;AACzC,iBAAK,SAAS,QAAQ,UAAU,KAAK,UAAW,WAAY;AAC1D,kBAAI,qBAAqB,GAAG;AAC1B,oBAAI,OAAO,IAAI,gBAAiB;AAChC,uBAAO,KAAK;AAAA,cACpB;AAAA,YACA;AACI,iBAAK,WAAW;AAEhB,iBAAK,KAAK,WAAW,SAAS,KAAK,WAAW,WAAW,MAAM;AAC7D,oBAAM,IAAI,UAAU,2CAA2C;AAAA,YACrE;AACI,iBAAK,UAAU,IAAI;AAEnB,gBAAI,KAAK,WAAW,SAAS,KAAK,WAAW,QAAQ;AACnD,kBAAI,QAAQ,UAAU,cAAc,QAAQ,UAAU,YAAY;AAEhE,oBAAI,gBAAgB;AACpB,oBAAI,cAAc,KAAK,KAAK,GAAG,GAAG;AAEhC,uBAAK,MAAM,KAAK,IAAI,QAAQ,eAAe,UAAS,oBAAI,QAAO,SAAS;AAAA,gBAClF,OAAe;AAEL,sBAAI,gBAAgB;AACpB,uBAAK,QAAQ,cAAc,KAAK,KAAK,GAAG,IAAI,MAAM,OAAO,QAAO,oBAAI,KAAI,GAAG,QAAS;AAAA,gBAC9F;AAAA,cACA;AAAA,YACA;AAAA,UACA;AAEE,kBAAQ,UAAU,QAAQ,WAAW;AACnC,mBAAO,IAAI,QAAQ,MAAM,EAAC,MAAM,KAAK,UAAS,CAAC;AAAA,UAChD;AAED,mBAAS,OAAO,MAAM;AACpB,gBAAI,OAAO,IAAI,SAAU;AACzB,iBACG,KAAI,EACJ,MAAM,GAAG,EACT,QAAQ,SAAS,OAAO;AACvB,kBAAI,OAAO;AACT,oBAAI,QAAQ,MAAM,MAAM,GAAG;AAC3B,oBAAI,OAAO,MAAM,MAAO,EAAC,QAAQ,OAAO,GAAG;AAC3C,oBAAI,QAAQ,MAAM,KAAK,GAAG,EAAE,QAAQ,OAAO,GAAG;AAC9C,qBAAK,OAAO,mBAAmB,IAAI,GAAG,mBAAmB,KAAK,CAAC;AAAA,cACzE;AAAA,YACA,CAAO;AACH,mBAAO;AAAA,UACX;AAEE,mBAAS,aAAa,YAAY;AAChC,gBAAI,UAAU,IAAI,QAAS;AAG3B,gBAAI,sBAAsB,WAAW,QAAQ,gBAAgB,GAAG;AAIhE,gCACG,MAAM,IAAI,EACV,IAAI,SAAS,QAAQ;AACpB,qBAAO,OAAO,QAAQ,IAAI,MAAM,IAAI,OAAO,OAAO,GAAG,OAAO,MAAM,IAAI;AAAA,YACvE,CAAA,EACA,QAAQ,SAAS,MAAM;AACtB,kBAAI,QAAQ,KAAK,MAAM,GAAG;AAC1B,kBAAI,MAAM,MAAM,MAAK,EAAG,KAAM;AAC9B,kBAAI,KAAK;AACP,oBAAI,QAAQ,MAAM,KAAK,GAAG,EAAE,KAAM;AAClC,oBAAI;AACF,0BAAQ,OAAO,KAAK,KAAK;AAAA,gBAC1B,SAAQ,OAAO;AACd,0BAAQ,KAAK,cAAc,MAAM,OAAO;AAAA,gBACpD;AAAA,cACA;AAAA,YACA,CAAO;AACH,mBAAO;AAAA,UACX;AAEE,eAAK,KAAK,QAAQ,SAAS;AAE3B,mBAAS,SAAS,UAAU,SAAS;AACnC,gBAAI,EAAE,gBAAgB,WAAW;AAC/B,oBAAM,IAAI,UAAU,4FAA4F;AAAA,YACtH;AACI,gBAAI,CAAC,SAAS;AACZ,wBAAU,CAAE;AAAA,YAClB;AAEI,iBAAK,OAAO;AACZ,iBAAK,SAAS,QAAQ,WAAW,SAAY,MAAM,QAAQ;AAC3D,gBAAI,KAAK,SAAS,OAAO,KAAK,SAAS,KAAK;AAC1C,oBAAM,IAAI,WAAW,0FAA0F;AAAA,YACrH;AACI,iBAAK,KAAK,KAAK,UAAU,OAAO,KAAK,SAAS;AAC9C,iBAAK,aAAa,QAAQ,eAAe,SAAY,KAAK,KAAK,QAAQ;AACvE,iBAAK,UAAU,IAAI,QAAQ,QAAQ,OAAO;AAC1C,iBAAK,MAAM,QAAQ,OAAO;AAC1B,iBAAK,UAAU,QAAQ;AAAA,UAC3B;AAEE,eAAK,KAAK,SAAS,SAAS;AAE5B,mBAAS,UAAU,QAAQ,WAAW;AACpC,mBAAO,IAAI,SAAS,KAAK,WAAW;AAAA,cAClC,QAAQ,KAAK;AAAA,cACb,YAAY,KAAK;AAAA,cACjB,SAAS,IAAI,QAAQ,KAAK,OAAO;AAAA,cACjC,KAAK,KAAK;AAAA,YACX,CAAA;AAAA,UACF;AAED,mBAAS,QAAQ,WAAW;AAC1B,gBAAI,WAAW,IAAI,SAAS,MAAM,EAAC,QAAQ,KAAK,YAAY,GAAE,CAAC;AAC/D,qBAAS,KAAK;AACd,qBAAS,SAAS;AAClB,qBAAS,OAAO;AAChB,mBAAO;AAAA,UACR;AAED,cAAI,mBAAmB,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG;AAE/C,mBAAS,WAAW,SAAS,KAAK,QAAQ;AACxC,gBAAI,iBAAiB,QAAQ,MAAM,MAAM,IAAI;AAC3C,oBAAM,IAAI,WAAW,qBAAqB;AAAA,YAChD;AAEI,mBAAO,IAAI,SAAS,MAAM,EAAC,QAAgB,SAAS,EAAC,UAAU,IAAG,EAAC,CAAC;AAAA,UACrE;AAED,kBAAQ,eAAe,EAAE;AACzB,cAAI;AACF,gBAAI,QAAQ,aAAc;AAAA,UAC3B,SAAQ,KAAK;AACZ,oBAAQ,eAAe,SAAS,SAAS,MAAM;AAC7C,mBAAK,UAAU;AACf,mBAAK,OAAO;AACZ,kBAAI,QAAQ,MAAM,OAAO;AACzB,mBAAK,QAAQ,MAAM;AAAA,YACpB;AACD,oBAAQ,aAAa,YAAY,OAAO,OAAO,MAAM,SAAS;AAC9D,oBAAQ,aAAa,UAAU,cAAc,QAAQ;AAAA,UACzD;AAEE,mBAAS,MAAM,OAAO1B,OAAM;AAC1B,mBAAO,IAAI,QAAQ,SAAS,SAAS,QAAQ;AAC3C,kBAAI,UAAU,IAAI,QAAQ,OAAOA,KAAI;AAErC,kBAAI,QAAQ,UAAU,QAAQ,OAAO,SAAS;AAC5C,uBAAO,OAAO,IAAI,QAAQ,aAAa,WAAW,YAAY,CAAC;AAAA,cACvE;AAEM,kBAAI,MAAM,IAAI,eAAgB;AAE9B,uBAAS,WAAW;AAClB,oBAAI,MAAO;AAAA,cACnB;AAEM,kBAAI,SAAS,WAAW;AACtB,oBAAI,UAAU;AAAA,kBACZ,YAAY,IAAI;AAAA,kBAChB,SAAS,aAAa,IAAI,sBAAuB,KAAI,EAAE;AAAA,gBACxD;AAGD,oBAAI,QAAQ,IAAI,QAAQ,SAAS,MAAM,MAAM,IAAI,SAAS,OAAO,IAAI,SAAS,MAAM;AAClF,0BAAQ,SAAS;AAAA,gBAC3B,OAAe;AACL,0BAAQ,SAAS,IAAI;AAAA,gBAC/B;AACQ,wBAAQ,MAAM,iBAAiB,MAAM,IAAI,cAAc,QAAQ,QAAQ,IAAI,eAAe;AAC1F,oBAAI,OAAO,cAAc,MAAM,IAAI,WAAW,IAAI;AAClD,2BAAW,WAAW;AACpB,0BAAQ,IAAI,SAAS,MAAM,OAAO,CAAC;AAAA,gBACpC,GAAE,CAAC;AAAA,cACL;AAED,kBAAI,UAAU,WAAW;AACvB,2BAAW,WAAW;AACpB,yBAAO,IAAI,UAAU,wBAAwB,CAAC;AAAA,gBAC/C,GAAE,CAAC;AAAA,cACL;AAED,kBAAI,YAAY,WAAW;AACzB,2BAAW,WAAW;AACpB,yBAAO,IAAI,UAAU,2BAA2B,CAAC;AAAA,gBAClD,GAAE,CAAC;AAAA,cACL;AAED,kBAAI,UAAU,WAAW;AACvB,2BAAW,WAAW;AACpB,yBAAO,IAAI,QAAQ,aAAa,WAAW,YAAY,CAAC;AAAA,gBACzD,GAAE,CAAC;AAAA,cACL;AAED,uBAAS,OAAO,KAAK;AACnB,oBAAI;AACF,yBAAO,QAAQ,MAAM,EAAE,SAAS,OAAO,EAAE,SAAS,OAAO;AAAA,gBAC1D,SAAQ,GAAG;AACV,yBAAO;AAAA,gBACjB;AAAA,cACA;AAEM,kBAAI,KAAK,QAAQ,QAAQ,OAAO,QAAQ,GAAG,GAAG,IAAI;AAElD,kBAAI,QAAQ,gBAAgB,WAAW;AACrC,oBAAI,kBAAkB;AAAA,cAC9B,WAAiB,QAAQ,gBAAgB,QAAQ;AACzC,oBAAI,kBAAkB;AAAA,cAC9B;AAEM,kBAAI,kBAAkB,KAAK;AACzB,oBAAI,QAAQ,MAAM;AAChB,sBAAI,eAAe;AAAA,gBAC7B,WACU,QAAQ,aACR;AACA,sBAAI,eAAe;AAAA,gBAC7B;AAAA,cACA;AAEM,kBAAIA,SAAQ,OAAOA,MAAK,YAAY,YAAY,EAAEA,MAAK,mBAAmB,WAAY,EAAE,WAAWA,MAAK,mBAAmB,EAAE,UAAW;AACtI,oBAAI,QAAQ,CAAE;AACd,uBAAO,oBAAoBA,MAAK,OAAO,EAAE,QAAQ,SAAS,MAAM;AAC9D,wBAAM,KAAK,cAAc,IAAI,CAAC;AAC9B,sBAAI,iBAAiB,MAAM,eAAeA,MAAK,QAAQ,IAAI,CAAC,CAAC;AAAA,gBACvE,CAAS;AACD,wBAAQ,QAAQ,QAAQ,SAAS,OAAO,MAAM;AAC5C,sBAAI,MAAM,QAAQ,IAAI,MAAM,IAAI;AAC9B,wBAAI,iBAAiB,MAAM,KAAK;AAAA,kBAC5C;AAAA,gBACA,CAAS;AAAA,cACT,OAAa;AACL,wBAAQ,QAAQ,QAAQ,SAAS,OAAO,MAAM;AAC5C,sBAAI,iBAAiB,MAAM,KAAK;AAAA,gBAC1C,CAAS;AAAA,cACT;AAEM,kBAAI,QAAQ,QAAQ;AAClB,wBAAQ,OAAO,iBAAiB,SAAS,QAAQ;AAEjD,oBAAI,qBAAqB,WAAW;AAElC,sBAAI,IAAI,eAAe,GAAG;AACxB,4BAAQ,OAAO,oBAAoB,SAAS,QAAQ;AAAA,kBAChE;AAAA,gBACS;AAAA,cACT;AAEM,kBAAI,KAAK,OAAO,QAAQ,cAAc,cAAc,OAAO,QAAQ,SAAS;AAAA,YAC7E,CAAA;AAAA,UACL;AAEE,gBAAM,WAAW;AAEjB,cAAI,CAAC,EAAE,OAAO;AACZ,cAAE,QAAQ;AACV,cAAE,UAAU;AACZ,cAAE,UAAU;AACZ,cAAE,WAAW;AAAA,UACjB;AAEE,kBAAQ,UAAU;AAClB,kBAAQ,UAAU;AAClB,kBAAQ,WAAW;AACnB,kBAAQ,QAAQ;AAEhB,iBAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM;AAE5D,iBAAO;AAAA,WAEN,CAAE,CAAA;AAAA,MACJ,GAAE,OAAO,SAAS,cAAc,OAAOhB,eAAI;AAAA;;;;ECjpB7B,MAAM,iBAAiB,IAAI;AAAA,IACzC,YAAY,UAAU,IAAI;AACzB,YAAO;AAEP,UAAI,EAAE,QAAQ,WAAW,QAAQ,UAAU,IAAI;AAC9C,cAAM,IAAI,UAAU,2CAA2C;AAAA,MAClE;AAEE,UAAI,OAAO,QAAQ,WAAW,YAAY,QAAQ,WAAW,GAAG;AAC/D,cAAM,IAAI,UAAU,0CAA0C;AAAA,MACjE;AAGE,WAAK,UAAU,QAAQ;AACvB,WAAK,SAAS,QAAQ,UAAU,OAAO;AACvC,WAAK,aAAa,QAAQ;AAC1B,WAAK,QAAQ,oBAAI,IAAK;AACtB,WAAK,WAAW,oBAAI,IAAK;AACzB,WAAK,QAAQ;AAAA,IACf;AAAA;AAAA,IAGC,eAAe,OAAO;AACrB,UAAI,OAAO,KAAK,eAAe,YAAY;AAC1C;AAAA,MACH;AAEE,iBAAW,CAAC,KAAK,IAAI,KAAK,OAAO;AAChC,aAAK,WAAW,KAAK,KAAK,KAAK;AAAA,MAClC;AAAA,IACA;AAAA,IAEC,iBAAiB,KAAK,MAAM;AAC3B,UAAI,OAAO,KAAK,WAAW,YAAY,KAAK,UAAU,KAAK,OAAO;AACjE,YAAI,OAAO,KAAK,eAAe,YAAY;AAC1C,eAAK,WAAW,KAAK,KAAK,KAAK;AAAA,QACnC;AAEG,eAAO,KAAK,OAAO,GAAG;AAAA,MACzB;AAEE,aAAO;AAAA,IACT;AAAA,IAEC,sBAAsB,KAAK,MAAM;AAChC,YAAM,UAAU,KAAK,iBAAiB,KAAK,IAAI;AAC/C,UAAI,YAAY,OAAO;AACtB,eAAO,KAAK;AAAA,MACf;AAAA,IACA;AAAA,IAEC,cAAc,KAAK,MAAM;AACxB,aAAO,KAAK,SAAS,KAAK,sBAAsB,KAAK,IAAI,IAAI,KAAK;AAAA,IACpE;AAAA,IAEC,MAAM,KAAK,OAAO;AACjB,YAAM,OAAO,MAAM,IAAI,GAAG;AAE1B,aAAO,KAAK,cAAc,KAAK,IAAI;AAAA,IACrC;AAAA,IAEC,KAAK,KAAK,OAAO;AAChB,WAAK,MAAM,IAAI,KAAK,KAAK;AACzB,WAAK;AAEL,UAAI,KAAK,SAAS,KAAK,SAAS;AAC/B,aAAK,QAAQ;AACb,aAAK,eAAe,KAAK,QAAQ;AACjC,aAAK,WAAW,KAAK;AACrB,aAAK,QAAQ,oBAAI,IAAK;AAAA,MACzB;AAAA,IACA;AAAA,IAEC,cAAc,KAAK,MAAM;AACxB,WAAK,SAAS,OAAO,GAAG;AACxB,WAAK,KAAK,KAAK,IAAI;AAAA,IACrB;AAAA,IAEC,CAAE,oBAAoB;AACrB,iBAAW,QAAQ,KAAK,UAAU;AACjC,cAAM,CAAC,KAAK,KAAK,IAAI;AACrB,YAAI,CAAC,KAAK,MAAM,IAAI,GAAG,GAAG;AACzB,gBAAM,UAAU,KAAK,iBAAiB,KAAK,KAAK;AAChD,cAAI,YAAY,OAAO;AACtB,kBAAM;AAAA,UACX;AAAA,QACA;AAAA,MACA;AAEE,iBAAW,QAAQ,KAAK,OAAO;AAC9B,cAAM,CAAC,KAAK,KAAK,IAAI;AACrB,cAAM,UAAU,KAAK,iBAAiB,KAAK,KAAK;AAChD,YAAI,YAAY,OAAO;AACtB,gBAAM;AAAA,QACV;AAAA,MACA;AAAA,IACA;AAAA,IAEC,IAAI,KAAK;AACR,UAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACxB,cAAM,OAAO,KAAK,MAAM,IAAI,GAAG;AAE/B,eAAO,KAAK,cAAc,KAAK,IAAI;AAAA,MACtC;AAEE,UAAI,KAAK,SAAS,IAAI,GAAG,GAAG;AAC3B,cAAM,OAAO,KAAK,SAAS,IAAI,GAAG;AAClC,YAAI,KAAK,iBAAiB,KAAK,IAAI,MAAM,OAAO;AAC/C,eAAK,cAAc,KAAK,IAAI;AAC5B,iBAAO,KAAK;AAAA,QAChB;AAAA,MACA;AAAA,IACA;AAAA,IAEC,IAAI,KAAK,OAAO,EAAC,SAAS,KAAK,OAAM,IAAI,IAAI;AAC5C,YAAM,SACL,OAAO,WAAW,YAAY,WAAW,OAAO,oBAC/C,KAAK,IAAG,IAAK,SACb;AACF,UAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACxB,aAAK,MAAM,IAAI,KAAK;AAAA,UACnB;AAAA,UACA;AAAA,QACJ,CAAI;AAAA,MACJ,OAAS;AACN,aAAK,KAAK,KAAK,EAAC,OAAO,OAAM,CAAC;AAAA,MACjC;AAEE,aAAO;AAAA,IACT;AAAA,IAEC,IAAI,KAAK;AACR,UAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACxB,eAAO,CAAC,KAAK,iBAAiB,KAAK,KAAK,MAAM,IAAI,GAAG,CAAC;AAAA,MACzD;AAEE,UAAI,KAAK,SAAS,IAAI,GAAG,GAAG;AAC3B,eAAO,CAAC,KAAK,iBAAiB,KAAK,KAAK,SAAS,IAAI,GAAG,CAAC;AAAA,MAC5D;AAEE,aAAO;AAAA,IACT;AAAA,IAEC,KAAK,KAAK;AACT,UAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACxB,eAAO,KAAK,MAAM,KAAK,KAAK,KAAK;AAAA,MACpC;AAEE,UAAI,KAAK,SAAS,IAAI,GAAG,GAAG;AAC3B,eAAO,KAAK,MAAM,KAAK,KAAK,QAAQ;AAAA,MACvC;AAAA,IACA;AAAA,IAEC,OAAO,KAAK;AACX,YAAM,UAAU,KAAK,MAAM,OAAO,GAAG;AACrC,UAAI,SAAS;AACZ,aAAK;AAAA,MACR;AAEE,aAAO,KAAK,SAAS,OAAO,GAAG,KAAK;AAAA,IACtC;AAAA,IAEC,QAAQ;AACP,WAAK,MAAM,MAAO;AAClB,WAAK,SAAS,MAAO;AACrB,WAAK,QAAQ;AAAA,IACf;AAAA,IAEC,OAAO,SAAS;AACf,UAAI,EAAE,WAAW,UAAU,IAAI;AAC9B,cAAM,IAAI,UAAU,2CAA2C;AAAA,MAClE;AAEE,YAAM,QAAQ,CAAC,GAAG,KAAK,kBAAiB,CAAE;AAC1C,YAAM,cAAc,MAAM,SAAS;AACnC,UAAI,cAAc,GAAG;AACpB,aAAK,QAAQ,IAAI,IAAI,KAAK;AAC1B,aAAK,WAAW,oBAAI,IAAK;AACzB,aAAK,QAAQ,MAAM;AAAA,MACtB,OAAS;AACN,YAAI,cAAc,GAAG;AACpB,eAAK,eAAe,MAAM,MAAM,GAAG,WAAW,CAAC;AAAA,QACnD;AAEG,aAAK,WAAW,IAAI,IAAI,MAAM,MAAM,WAAW,CAAC;AAChD,aAAK,QAAQ,oBAAI,IAAK;AACtB,aAAK,QAAQ;AAAA,MAChB;AAEE,WAAK,UAAU;AAAA,IACjB;AAAA,IAEC,CAAE,OAAO;AACR,iBAAW,CAAC,GAAG,KAAK,MAAM;AACzB,cAAM;AAAA,MACT;AAAA,IACA;AAAA,IAEC,CAAE,SAAS;AACV,iBAAW,CAAA,EAAG,KAAK,KAAK,MAAM;AAC7B,cAAM;AAAA,MACT;AAAA,IACA;AAAA,IAEC,EAAG,OAAO,QAAQ,IAAI;AACrB,iBAAW,QAAQ,KAAK,OAAO;AAC9B,cAAM,CAAC,KAAK,KAAK,IAAI;AACrB,cAAM,UAAU,KAAK,iBAAiB,KAAK,KAAK;AAChD,YAAI,YAAY,OAAO;AACtB,gBAAM,CAAC,KAAK,MAAM,KAAK;AAAA,QAC3B;AAAA,MACA;AAEE,iBAAW,QAAQ,KAAK,UAAU;AACjC,cAAM,CAAC,KAAK,KAAK,IAAI;AACrB,YAAI,CAAC,KAAK,MAAM,IAAI,GAAG,GAAG;AACzB,gBAAM,UAAU,KAAK,iBAAiB,KAAK,KAAK;AAChD,cAAI,YAAY,OAAO;AACtB,kBAAM,CAAC,KAAK,MAAM,KAAK;AAAA,UAC5B;AAAA,QACA;AAAA,MACA;AAAA,IACA;AAAA,IAEC,CAAE,oBAAoB;AACrB,UAAI,QAAQ,CAAC,GAAG,KAAK,KAAK;AAC1B,eAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,EAAE,GAAG;AAC3C,cAAM,OAAO,MAAM,CAAC;AACpB,cAAM,CAAC,KAAK,KAAK,IAAI;AACrB,cAAM,UAAU,KAAK,iBAAiB,KAAK,KAAK;AAChD,YAAI,YAAY,OAAO;AACtB,gBAAM,CAAC,KAAK,MAAM,KAAK;AAAA,QAC3B;AAAA,MACA;AAEE,cAAQ,CAAC,GAAG,KAAK,QAAQ;AACzB,eAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,EAAE,GAAG;AAC3C,cAAM,OAAO,MAAM,CAAC;AACpB,cAAM,CAAC,KAAK,KAAK,IAAI;AACrB,YAAI,CAAC,KAAK,MAAM,IAAI,GAAG,GAAG;AACzB,gBAAM,UAAU,KAAK,iBAAiB,KAAK,KAAK;AAChD,cAAI,YAAY,OAAO;AACtB,kBAAM,CAAC,KAAK,MAAM,KAAK;AAAA,UAC5B;AAAA,QACA;AAAA,MACA;AAAA,IACA;AAAA,IAEC,CAAE,mBAAmB;AACpB,iBAAW,CAAC,KAAK,KAAK,KAAK,KAAK,kBAAiB,GAAI;AACpD,cAAM,CAAC,KAAK,MAAM,KAAK;AAAA,MAC1B;AAAA,IACA;AAAA,IAEC,IAAI,OAAO;AACV,UAAI,CAAC,KAAK,OAAO;AAChB,eAAO,KAAK,SAAS;AAAA,MACxB;AAEE,UAAI,eAAe;AACnB,iBAAW,OAAO,KAAK,SAAS,KAAI,GAAI;AACvC,YAAI,CAAC,KAAK,MAAM,IAAI,GAAG,GAAG;AACzB;AAAA,QACJ;AAAA,MACA;AAEE,aAAO,KAAK,IAAI,KAAK,QAAQ,cAAc,KAAK,OAAO;AAAA,IACzD;AAAA,IAEC,UAAU;AACT,aAAO,KAAK,iBAAkB;AAAA,IAChC;AAAA,IAEC,QAAQ,kBAAkB,eAAe,MAAM;AAC9C,iBAAW,CAAC,KAAK,KAAK,KAAK,KAAK,iBAAgB,GAAI;AACnD,yBAAiB,KAAK,cAAc,OAAO,KAAK,IAAI;AAAA,MACvD;AAAA,IACA;AAAA,IAEC,KAAK,OAAO,WAAW,IAAI;AAC1B,aAAO,KAAK,UAAU,CAAC,GAAG,KAAK,iBAAkB,CAAA,CAAC;AAAA,IACpD;AAAA,EACA;AC1Re,WAAA,UAAS,GAAG,GAAG;AAC5B,WAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;AAAA,EAC/C;ACAe,WAAQ,SAAC,GAAG;AACzB,QAAI,QAAQ;AACZ,QAAI,UAAU;AAEd,QAAI,EAAE,WAAW,GAAG;AAClB,cAAQ,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI;AACzB,gBAAU,oBAAoB,CAAC;AAAA,IACnC;AAEE,aAAS,KAAK,GAAG,GAAG,IAAI,IAAI;AAC1B,UAAI,MAAM,KAAM,MAAK;AACrB,UAAI,MAAM,KAAM,MAAK,EAAE;AACvB,aAAO,KAAK,IAAI;AACd,cAAM,MAAO,KAAK,OAAQ;AAC1B,YAAI,QAAQ,EAAE,GAAG,GAAG,CAAC,IAAI,EAAG,MAAK,MAAM;AAAA,YAClC,MAAK;AAAA,MAChB;AACI,aAAO;AAAA,IACX;AAEE,aAAS,MAAM,GAAG,GAAG,IAAI,IAAI;AAC3B,UAAI,MAAM,KAAM,MAAK;AACrB,UAAI,MAAM,KAAM,MAAK,EAAE;AACvB,aAAO,KAAK,IAAI;AACd,cAAM,MAAO,KAAK,OAAQ;AAC1B,YAAI,QAAQ,EAAE,GAAG,GAAG,CAAC,IAAI,EAAG,MAAK;AAAA,YAC5B,MAAK,MAAM;AAAA,MACtB;AACI,aAAO;AAAA,IACX;AAEE,aAAS,OAAO,GAAG,GAAG,IAAI,IAAI;AAC5B,UAAI,MAAM,KAAM,MAAK;AACrB,UAAI,MAAM,KAAM,MAAK,EAAE;AACvB,YAAM,IAAI,KAAK,GAAG,GAAG,IAAI,KAAK,CAAC;AAC/B,aAAO,IAAI,MAAM,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI;AAAA,IACpE;AAEE,WAAO,EAAC,MAAM,QAAQ,MAAK;AAAA,EAC7B;AAEA,WAAS,oBAAoB,GAAG;AAC9B,WAAO,CAAC,GAAG,MAAM,UAAU,EAAE,CAAC,GAAG,CAAC;AAAA,EACpC;AAAA,EC9BO,MAAM,WAA0B;AAAA,IAInC,YAAmB,MAAY,YAA+B,SAAkB;AAHhF;AACA;AAEmB,WAAA,OAAA;AAA2C,WAAA,UAAA;AACrD,WAAA,YAAY,iBAAiB,UAAU;AACvC,WAAA,cAAc,yBAAyB,KAAK,SAAS;AAAA,IAAA;AAAA,EAElE;AA+BA,QAAM,oBAAoB,SAAS,CAAC,MAAuB,EAAE,GAAG,EAAE;AAElE,QAAM,WAAW,CAAC,OAAe,UAAkB,cAC/C,UAAU,aAAa,KAAK,EAAE,MAAM;AAExC,QAAM,WAAW,CAAC,aAAqB,cAAiC;AAChE,QAAA,CAAC,aAAa,CAAC,UAAU,gBAAgB,CAAC,UAAU,aAAa,QAAQ;AAClE,aAAA;AAAA,IAAA;AAGX,QAAI,cAAc,kBAAkB,UAAU,cAAc,WAAW;AACvE,UAAM,UAAU,UAAU,aAAa,UAAU,aAAa,SAAS,CAAC,EAAE;AACpE,UAAA,aAAa,UAAU,aAAa,OAAO;AAGjD,mBAAe,cAAc,KAAK;AAE9B,QAAA,cAAc,KAAK,MAAM,cAAc,UAAU,aAAa,WAAW,EAAE,GAAG;AAClF,QAAI,SAAS;AAEb,QAAI,cAAc,GAAG;AAEjB,eAAS,cAAc;AACT,oBAAA;AAAA,IAAA;AAGlB,QAAI,gBAAgB,UAAU,aAAa,SAAS,KAAK,cAAc,YAAY;AAE/E,eAAS,cAAc;AACT,oBAAA;AAAA,IAAA;AAGX,WAAA,CAAC,UAAU,aAAa,WAAW,EAAE,KAAK,aAAa,QAAQ,WAAW;AAAA,EACrF;AA+BgB,WAAA,yBAAyB,WAA8B,WAAW,MAAM;AAC7E,WAAA;AAAA,MACH,WAAW;AAAA,MACX,oBAAoB;AAAA,MACpB,UAAU,KAAK,KAAK,KAAK,IAAI,UAAU,cAAc,QAAQ,IAAI,KAAK,IAAI,CAAC,CAAC;AAAA,MAC5E,WAAW,UAAU;AAAA,MACrB,SAAS,CAAC,CAAC;AAAA,MACX,SAAS,CAAC,UAAU,WAAW;AAAA,IACnC;AAAA,EACJ;AAEO,WAAS,iBAAiB,OAA8C;AAC3E,UAAM,OAA0B;AAAA,MAC5B,cAAc,CAAC;AAAA,MACf,cAAc,CAAC;AAAA,MACf,cAAc,CAAC;AAAA,MACf,aAAa;AAAA,IACjB;AAEA,UAAM,QAAQ,CAAC,CAAC,KAAK,MAAM,GAAG,MAAM;AAChC,YAAM,cAAc,EAAE,IAAI,GAAG,KAAK,KAAK,KAAK,YAAY;AACnD,WAAA,aAAa,GAAG,IAAI;AACpB,WAAA,aAAa,GAAG,IAAI;AACpB,WAAA,aAAa,KAAK,WAAW;AAClC,WAAK,eAAe;AAAA,IAAA,CACvB;AAEM,WAAA;AAAA,MACH,GAAG;AAAA,MACH,UAAU,CAAW,WAAA,KAAK,eAAe,SAAS,QAAQ,IAAI,IAAI;AAAA,MAClE,UAAU,CAAC,CAAC,SAAS,MAAM,MAAO,KAAK,eAAe,SAAS,SAAS,QAAQ,IAAI,IAAI;AAAA,IAC5F;AAAA,EACJ;AAAA,EAEO,MAAM,mBAAmBqD,aAAY;AAAA,IAArC;AAAA;AAGI;AAAA;AAAA,kCAA4B,OAC/BzC,SACA,SAAS,GACT,QACA,WAAW,GACX,OAAO,OAC0C;AAC3C,cAAA,EAAE,UAAU,CAAC,GAAG,QAAQ,YAAY,OAAO;AAEjD,YAAI,SAAS,UAAU;AACnB,kBAAQ,QAAQ,SAAS,QAAQ,IAAI,WAAW,MAAM;AAAA,QAC/C,WAAA,WAAW,YAAY,aAAa,GAAG;AACtC,kBAAA,QAAQ,SAAS,QAAQ;AAAA,QAAA;AAErC,cAAM,OAAO;AAAA;AAAA,UAET,GAAG,KAAK;AAAA,UACR,GAAG;AAAA,UACH,SAAS;AAAA,YACL,GAAG;AAAA,YACH,GAAG,UAAU;AAAA;AAAA,YAEb,GAAG,KAAK,cAAc;AAAA,UAC1B;AAAA,UACA,QAAQ;AAAA,UACR,UAAU;AAAA,UACV,MAAM;AAAA,UACN;AAAA,QACJ;AACA,cAAM,WAAW,MAAM,KAAK,MAAM,KAAK,KAAK,IAAI;AAE5C,YAAA,CAAC,SAAS,IAAI;AACR,gBAAA,IAAI,MAAM,QAAQ,SAAS,MAAM,IAAI,SAAS,UAAU,IAAI,KAAK,GAAG,EAAE;AAAA,QAAA;AAIhF,YAAI,SAAS,WAAW,OAAO,SAAS,WAAW,KAAK;AAEpD,gBAAM,eAAe,MAAM,KAAK,sBAAsB,QAAQ;AACxD,gBAAA,cAAc,aAAa,KAAKA,SAAQ,QAAQ,GAAG,KAAK,IAAI,QAAQ,aAAa,MAAM,CAAC;AAG9F,gBAAM,MAAM,SAAS,QAAQ,IAAI,eAAe;AAChD,gBAAM,YAAY,WAAW,KAAK,OAAO,EAAE;AACvC,cAAA,aAAa,UAAU,CAAC,GAAG;AAEtB,iBAAA,QAAQ,EAAE,MAAM,SAAS,UAAU,CAAC,GAAG,EAAE,EAAE;AAAA,UAAA;AAG7C,iBAAA,EAAE,WAAW,aAAa,QAAAA,QAAO;AAAA,QAAA;AAItC,cAAA,IAAI,MAAM,QAAQ,SAAS,MAAM,aAAa,KAAK,GAAG,EAAE;AAAA,MAClE;AAAA;AAAA,EACJ;AC5LA,WAAS,QAAQ,UAAkB,WAAoB;AACnD,QAAI,UAAU;AACd,QAAI,UAAU;AACd,QAAI,sBAAsB;AAC1B,QAAI,cAAc;AAClB,UAAM,gBAAgB,CAAC;AAGvB,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACtC,UAAI,SAAS,CAAC,EAAE,MAAM,QAAQ,GAAG;AAE7B,kBAAU,UAAU,KAAK,CAAC,SAAS,CAAC;AACd,8BAAA;AAAA,MACf,WAAA,SAAS,CAAC,MAAM,KAAK;AACN,8BAAA;AAAA,MAAA,OACnB;AACQ,mBAAA;AAEX,YAAI,WAAW;AACX,wBAAc,KAAK;AAAA,YACf,QAAQ;AAAA,YACR,MAAM,SAAS,CAAC;AAAA,UAAA,CACnB;AAAA,mBACM,qBAAqB;AAKb,yBAAA;AAAA,QAAA,OACZ;AACH,wBAAc,KAAK;AAAA,YACf,KAAK;AAAA,YACL,MAAM,SAAS,CAAC;AAAA,YAChB,QAAQ;AAAA,YACR;AAAA,UAAA,CACH;AAAA,QAAA;AAGK,kBAAA;AACC,mBAAA;AAAA,MAAA;AAAA,IACf;AAGG,WAAA;AAAA,EACX;AA6BA,WAAS,iBAAiB,SAAkB,KAAa;AACrD,QAAI,gBAAgC,CAAC;AACrC,QAAI,0BAAmE;AAEvE,QAAI,QAAQ,OAAO;AACf,YAAM,YAAY,QAAQ,QAAQ,OAAO,IAAI;AAC7C,UAAI,UAAU;AAEd,iBAAW,OAAO,WAAW;AACrB,YAAA,IAAI,SAAS,KAAK;AAElB,wBAAc,KAAK;AAAA,YACf,KAAK;AAAA,YACL,QAAQ,IAAI;AAAA,YACZ,MAAM;AAAA,UAAA,CACT;AAED,qBAAW,IAAI;AAAA,QAAA,WACR,IAAI,SAAS,KAAK;AACzB,wBAAc,KAAK;AAAA,YACf,KAAK;AAAA,YACL,QAAQ,IAAI;AAAA,YACZ,MAAM;AAAA,UAAA,CACT;AAAA,QAAA,WACM,IAAI,SAAS,KAAK;AACzB,wBAAc,KAAK;AAAA,YACf,KAAK;AAAA,YACL,QAAQ,IAAI;AAAA,YACZ,MAAM;AAAA,UAAA,CACT;AACD,qBAAW,IAAI;AAAA,QAAA,WACR,IAAI,SAAS,KAAK;AACzB,wBAAc,KAAK;AAAA,YACf,KAAK;AAAA,YACL,QAAQ,IAAI;AAAA,YACZ,MAAM;AAAA,UAAA,CACT;AACD,qBAAW,IAAI;AAAA,QAAA,WACR,IAAI,SAAS,OAAO,IAAI,SAAS,KAAK;AAC7C,qBAAW,IAAI;AAAA,QAAA,MACZ;AAAA,MAEP;AAGE,YAAA,WAAW,UAAU,CAAC;AAC5B,YAAM,UAAU,UAAU,UAAU,SAAS,CAAC;AAI1C,UAAA,SAAS,SAAS,KAAK;AACG,kCAAA;AAE1B,sBAAc,KAAK;AAAA,UACf,KAAK,CAAC,SAAS;AAAA,UACf,MAAM;AAAA,UACN,QAAQ,SAAS;AAAA,QAAA,CACpB;AAAA,MAAA;AAGD,UAAA,QAAQ,SAAS,KAAK;AACtB,sBAAc,KAAK;AAAA,UACf,KAAK,QAAQ,MAAM,QAAQ;AAAA,UAC3B,QAAQ,QAAQ;AAAA,UAChB,MAAM;AAAA,QAAA,CACT;AAAA,MAAA;AAKD,UAAA,SAAS,SAAS,KAAK;AACvB,sBAAc,KAAK;AAAA,UACf,KAAK,CAAC,SAAS;AAAA,UACf,MAAM;AAAA,UACN,QAAQ,SAAS;AAAA,QAAA,CACpB;AAAA,MAAA;AAED,UAAA,QAAQ,SAAS,KAAK;AACtB,sBAAc,KAAK;AAAA,UACf,KAAK,QAAQ,MAAM,QAAQ;AAAA,UAC3B,QAAQ,QAAQ;AAAA,UAChB,MAAM;AAAA,QAAA,CACT;AAAA,MAAA;AAAA,IACL;AAGJ,QAAI,QAAQ,IAAI;AACZ,YAAM,kBAAkB,QAAQ,QAAQ,IAAI,KAAK;AACjC,sBAAA,QAAQ,SAAS,cAAuE;AACpG,YAAI,WAAW,aAAa,KAAK,IAAI,aAAa,aAAa;AAC3D,YAAA,SAAS,WAAW,aAAa,QAAQ;AAI7C,YAAI,4BAA4B,MAAM;AAClC,sBAAY,wBAAwB;AACpC,oBAAU,wBAAwB;AAAA,QAAA;AAEtC,qBAAa,SAAS,IAAI,IAAI,UAAU,UAAU,MAAM;AAExD,eAAO,aAAa,aAAa;AAAA,MAAA,CACpC;AAEe,sBAAA,gBAAgB,OAAO,aAAa;AAAA,IAAA;AAGjD,WAAA;AAAA,EACX;AAMA,QAAM,kBAAkB,CAAC,WAAsB,SAAiB,cAAsB;AAC5E,UAAA,MAAM,UAAU,IAAI,KAAK;AAC/B,UAAM,UAAmB;AAAA;AAAA,MAErB,IAAI,GAAG,UAAU,GAAI,CAAA;AAAA,MACrB,MAAM,UAAU,IAAI,MAAM;AAAA;AAAA,MAE1B,OAAO,CAAC,UAAU,KAAK,QAAQ,IAAI;AAAA;AAAA,MAEnC,KAAK,CAAC,UAAU,KAAK,MAAM,IAAI;AAAA,MAC/B,IAAI,UAAU,IAAI,IAAI;AAAA,MACtB;AAAA,MACA;AAAA,MACA,OAAO,UAAU,IAAI,OAAO;AAAA,MAC5B,MAAM,UAAU,IAAI,IAAI;AAAA,MACxB,QAAQ,UAAU,IAAI,QAAQ,MAAM,IAAI,MAAM;AAAA,IAClD;AACO,WAAA,OAAO,OAAO,SAAS,EAAE,eAAe,iBAAiB,SAAS,GAAG,GAAG;AAAA,EACnF;AAAA,EAIA,MAAM,gBAAgB0C,UAAS;AAAA,IAE3B,eAAe,MAA8C;AACzD,YAAM,GAAG,IAAI;AAFjB;AAGS,WAAA,gBAAgB,KAAK,UAAU;AAAA,IAAA;AAAA,IAExC,OAAO,QAAQ,KAAa,UAAkB,iBAA+B,sBAAoC;AAC7G,aAAO,IAAI,QAAQ;AAAA,QACf,eAAe,IAAI,WAAW,KAAK,EAAE,WAAW,iBAAiB;AAAA,QACjE,eAAe,IAAI,WAAW,UAAU,EAAE,WAAW,qBAAsB,CAAA;AAAA,MAAA,CAC9E;AAAA,IAAA;AAAA,IAEL,gBAAgB;AACZ,aAAO,KAAK,WAAW,IAAI,CAAC,MAA2C,EAAE,OAAO;AAAA,IAAA;AAAA,EAExF;AAGA,QAAM,kCAAoE,IAAI;AAE9E,QAAM,mCAAyC,IAAI;AACnD,QAAM,YAAY;AAClB,QAAM,aAAa,IAAI,SAAsD,EAAE,SAAS,WAAW;AAEnG,QAAM,OAAO,OACT,KACA,KACA,YACA,UAAmC,CAAA,MAClC;;AACD,QAAI,CAAC,aAAa,IAAI,IAAI,GAAG,GAAG;AACtBC,YAAAA,WAAU,QAAQ,QAAQ,IAAI,KAAK,IAAI,UAAU,QAAQ,iBAAiB,QAAQ,oBAAoB;AAC5G,YAAMA,SAAQ,UAAU;AAGxB,YAAM,yBAAyBA,SAAQ,cAAc,EAAE,CAAC;AACxD,UAAI,wBAAwB;AAClB,cAAA,kBAAkB,uBAAuB,SAAS,KAAK;AAC7D,cAAM,iBAAgB,gBAAW,CAAC,MAAZ,mBAAgB,GAAG,SAAS;AAC9C,YAAA,mBAAmB,CAAC,eAAe;AACnC,uBAAa,WAAW,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAAA,QAAA,WAC/C,CAAC,mBAAmB,eAAe;AAC1C,uBAAa,WAAW,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,QAAQ,OAAO,EAAE,GAAG,CAAC,CAAC;AAAA,QAAA;AAAA,MACrE;AAES,mBAAA,IAAI,IAAI,KAAKA,QAAO;AAAA,IAAA;AAErC,UAAM,UAAU,aAAa,IAAI,IAAI,GAAG;AACxC,UAAM,aAAa,IAAI,WAAW,SAAS,YAAY;AAAA,MACnD,WAAW;AAAA,MACX,eAAe;AAAA,MACf,iBAAiB;AAAA,MACjB,qBAAqB;AAAA,MACrB,GAAG;AAAA,IAAA,CACN;AACW,gBAAA,IAAI,KAAK,UAAU;AAAA,EACnC;AAEA,QAAM,cAAc,CAAC,QAAgB;AAC1B,WAAA,YAAY,IAAI,GAAG,EAAG;AAAA,EACjC;AAEA,QAAM,OAAO,OAAO,KAAa,GAAW,MAAwC;AAChF,UAAM,iBAAiB;AACjB,UAAA,MAAM,YAAY,IAAI,GAAG;AAEzB,UAAA,OAAO,YAAY,GAAG;AAExB,QAAA,EAAE,eAAe,OAAO;AAClB,YAAA,IAAI,MAAM,6FAA6F;AAAA,IAAA;AAGjH,UAAM,YAAY,CAAC,KAAK,YAAY,KAAK,CAAC;AAE1C,UAAM,iBAA6C,CAAC;AAEpD,QAAI,YAAY,gBAAgB;AAE5B,aAAO,IAAI,QAAQ,CAAA,YAAW,QAAQ,CAAE,CAAA,CAAC;AAAA,IAAA;AAI7C,QAAI,OAAO,KAAK,QAAQ,CAAC,IAAI,IAAI;AACjC,UAAM,OAAO,KAAK,QAAQ,CAAC,KAAK,IAAI,KAAK;AAEzC,UAAM,EAAE,cAAc,aAAa,IAAI,IAAI;AAE3C,UAAM,MAAM;AAAA,MACR,aAAa,IAAI,QAAQ;AAAA;AAAA;AAAA;AAAA,IAI7B;AAEW,eAAA,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;AAGrC,aAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;AACpC,YAAA,YAAY,aAAa,CAAC,EAAE;AAC5B,YAAA,aAAa,aAAa,CAAC,EAAE;AACnC,YAAM,WAAW,aAAa,CAAC,EAAE,MAAM,aAAa,SAAS;AAEzD,UAAA,cAAc,QAAQ,OAAO,UAAU;AAGvC,YAAI,OAAO,UAAU;AAGF,yBAAA;AAAA,YACX,IAAI,KACC,mBAAmB,WAAW,OAAO,YAAY,WAAW,YAAY,GAAG,EAC3E,KAAK,CAAW,YAAA;AACb,oBAAM,gBAAgB,QAAQ;AAAA,gBAAI,SAC9B,gBAAgB,KAAK,WAAW,aAAa,CAAC,EAAE,GAAG;AAAA,cACvD;AACW,yBAAA;AAAA,gBACP,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;AAAA,gBACf,WAAW,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAsB,OAAO,aAAa;AAAA,cAChF;AACA,qBAAO,CAAC;AAAA,YAEX,CAAA;AAAA,UACT;AAGO,iBAAA;AAAA,QAAA,OACJ;AACH,gBAAM,WAAW,KAAK,MAAM,OAAO,UAAU;AAC7C,gBAAM,SAAS,KAAK,KAAK,OAAO,UAAU;AAE3B,yBAAA;AAAA,YACX,IAAI,KAAK,mBAAmB,WAAW,UAAU,QAAQ,GAAG,EAAE,KAAK,CAAW,YAAA;AACpE,oBAAA,gBAAgB,QAAQ,IAAI,CAAO,QAAA,gBAAgB,KAAK,WAAW,aAAa,CAAC,EAAE,GAAG,CAAC;AAClF,yBAAA;AAAA,gBACP,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;AAAA,gBACf,WAAW,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAsB,OAAO,aAAa;AAAA,cAChF;AACA,qBAAO,CAAC;AAAA,YACX,CAAA;AAAA,UACL;AAEA;AAAA,QAAA;AAAA,MACJ;AAAA,IACJ;AAIJ,WAAO,QAAQ,IAAI,cAAc,EAAE,KAAK,CAAU,WAAA;AAC9C,aAAO,OAAO,KAAK;AAAA,IAAA,CACtB;AAAA,EACL;AAQA,QAAM,sBAAsB,OAAO,KAAa,YAAsB;AAClE,UAAM,QAAsE,CAAC;AAC7E,UAAM,eAAyB,CAAC;AAChC,UAAM,eAA2C,CAAC;AAElD,eAAW,UAAU,SAAS;AACpB,YAAA,QAAQ,OAAO,MAAM,GAAG;AAC9B,YAAM,IAAI,SAAS,MAAM,CAAC,GAAG,EAAE;AAC/B,YAAM,IAAI,SAAS,MAAM,CAAC,GAAG,EAAE;AAE/B,UAAI,OAAO,MAAM,CAAC,KAAK,OAAO,MAAM,CAAC,GAAG;AAC5B,gBAAA,KAAK,kCAAkC,GAAG,CAAC;AACnD;AAAA,MAAA;AAGJ,mBAAa,KAAK,MAAM;AACxB,mBAAa,KAAK,KAAK,KAAK,GAAG,CAAC,CAAC;AAAA,IAAA;AAGrC,WAAO,QAAQ,IAAI,YAAY,EAAE,KAAK,CAAU,WAAA;AACrC,aAAA,QAAQ,CAAC,GAAG,MAAM;AACf,cAAA,cAAc,aAAa,CAAC;AAC5B,cAAA,WAAW,IAAI,OAAO,OAAO,GAAG,EAAE,gBAAgB,aAAa;AAAA,MAAA,CACxE;AACM,aAAA;AAAA,IAAA,CACV;AAAA,EACL;AAEA,QAAM,iBAAiB,CAAC,KAAa,YAAsB;AACvD,UAAM,EAAE,QAAY,IAAA,YAAY,IAAI,GAAG;AACvC,UAAM,cAAmE,CAAC;AAE1E,eAAW,UAAU,SAAS;AAC1B,YAAM,YAAY,WAAW,IAAI,GAAG,GAAG,IAAI,MAAM,EAAE;AAEnD,UAAI,CAAC,WAAW;AACZ;AAAA,MAAA;AAGJ,UAAI,WAAW,WAAW;AAChB,cAAA,IAAI,MAAM,UAAU,KAAK;AAAA,MAAA;AAGnC,iBAAW,WAAW,WAAW;AACjB,oBAAA,QAAQ,EAAE,IAAI;AAAA,UACtB,GAAG;AAAA,UACH,eAAe,KAAK,UAAU,QAAQ,aAAa;AAAA,QACvD;AAAA,MAAA;AAAA,IACJ;AAGE,UAAA,WAAW,OAAO,OAAO,WAAW;AAG1C,QAAI,QAAQ,WAAW;AAET,gBAAA,UAAU,QAAQ,aAAa;AAAA,IAAA;AAGzC,QAAA;AACJ,QAAI,QAAQ,iBAAiB;AAEhB,eAAA,cAAc,UAAU,QAAQ,mBAAmB;AAAA,IAAA,OACzD;AACM,eAAA;AAAA,IAAA;AAGP,UAAA3C,UAAS,IAAI,cAAc,OAAO,KAAK,UAAU,MAAM,CAAC,EAAE;AAChE,WAAO,SAASA,SAAQ,CAACA,OAAM,CAAC;AAAA,EACpC;AAEA,QAAM,UAAU,CAAuB,IAAkB,QACrD,GAAG,OAAO,CAAC,IAAI,MAAM;AAEjB,KAAC,GAAG,EAAE,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,CAAC,KAAK,IAAI,KAAK,CAAC;AAC/B,WAAA;AAAA,EACX,GAAG,EAAE;AAWT,QAAM,YAAY,CAAC,UAAqB,gBAAgB,MAAM;AAEpD,UAAA,qBAAwD,QAAQ,UAAU,MAAM;AAGtF,WAAO,OAAO,kBAAkB,EAAE,QAAQ,CAAgB,iBAAA;AAClD,UAAA,aAAa,WAAW,GAAG;AACrB,cAAA,OAAO,aAAa,CAAC;AACrB,cAAA,OAAO,aAAa,CAAC;AACtB,aAAA,UAAU,CAAC,KAAK,EAAE;AAClB,aAAA,UAAU,CAAC,KAAK,EAAE;AAEvB,cAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,CAAC,EAAE,QAAQ,CAAC,EAAE,KAAK;AACxD,cAAA,aAAa,KAAK,IAAI,GAAG,CAAC,EAAE,QAAQ,CAAC,EAAE,GAAG;AAChD,cAAM,kBAAkB,cAAc;AAElC,YAAA;AACJ,YAAI,CAAC,iBAAiB;AACT,mBAAA;AAAA,QAAA,WACF,EAAE,WAAW,OAAO,EAAE,WAAW,KAAK;AACpC,mBAAA;AAAA,QAAA,WACF,EAAE,WAAW,OAAO,EAAE,WAAW,KAAK;AACpC,mBAAA;AAAA,QAAA,WACF,EAAE,WAAW,OAAO,EAAE,WAAW,KAAK;AACpC,mBAAA;AAAA,QAAA,WACF,EAAE,WAAW,OAAO,EAAE,WAAW,KAAK;AACpC,mBAAA;AAAA,QAAA,OACN;AACH,mBAAS,IAAI,EAAE,MAAM,GAAG,EAAE,MAAM;AAAA,QAAA;AAIpC,SAAC,MAAM,IAAI,EAAE,QAAQ,CAAK,MAAA;AACtB,YAAE,YAAY;AACd,YAAE,aAAa;AACf,YAAE,kBAAkB;AACpB,YAAE,SAAS;AACX,YAAE,WAAW;AAAA,QAAA,CAChB;AAAA,MAAA,OACE;AAEH,qBAAa,QAAQ,CAAK,MAAA;AACtB,YAAE,UAAU,aAAa,OAAO,CAAA,SAAQ,KAAK,OAAO,EAAE,EAAE,EAAE,IAAI,CAAQ,SAAA,KAAK,EAAE;AAC7E,YAAE,YAAY;AACd,YAAE,aAAa;AACf,YAAE,kBAAkB;AACpB,YAAE,SAAS,aAAa,WAAW,IAAI,sCAAsC;AAC7E,YAAE,WAAW,aAAa;AAAA,QAAA,CAC7B;AAAA,MAAA;AAAA,IACL,CACH;AACM,WAAA;AAAA,EACX;AAIA,QAAM,gBAAgB,CAAC,UAAmE,cAAc,MAAM;AAC1G,UAAM,YAAwB,CAAC;AAC/B,aAAS,QAAQ,CAAW,YAAA;AACxB,YAAM,gBAAmD,KAAK,MAAM,QAAQ,aAAa;AACzF,oBAAc,QAAQ,CAAO,QAAA;AACnB,cAAA,MAAM,QAAQ,QAAQ,IAAI;AAChC,cAAM,MAAM,QAAQ,QAAQ,IAAI,MAAM,IAAI;AAC1C,YAAI,QAAQ,QAAQ,OAAO,MAAM,QAAQ,KAAK;AACpC,gBAAA,IAAI,UAAU,KAAK,CAAA,MAAK,EAAE,UAAU,OAAO,EAAE,QAAQ,GAAG;AAC9D,cAAI,GAAG;AACH,cAAE,SAAS;AAAA,UAAA,OACR;AACO,sBAAA,KAAK,EAAE,OAAO,KAAK,KAAK,KAAK,OAAO,GAAG;AAAA,UAAA;AAAA,QACrD;AAAA,MACJ,CACH;AAAA,IAAA,CACJ;AACD,WAAO,UAAU,OAAO,CAAK,MAAA,EAAE,SAAS,WAAW;AAAA,EACvD;AAEA,QAAM,gBAAgB;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAEA,SAAO,aAAa;;","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55]}