{ "version": 3, "sources": ["../../../node_modules/.pnpm/eventemitter3@5.0.1/node_modules/eventemitter3/index.js", "../../../node_modules/.pnpm/path-browserify@1.0.1/node_modules/path-browserify/index.js", "../../../node_modules/.pnpm/eventemitter3@4.0.7/node_modules/eventemitter3/index.js", "../../../node_modules/.pnpm/eventemitter3@5.0.1/node_modules/eventemitter3/index.js", "../../codemirror-lsp/src/index.mts", "../../../node_modules/.pnpm/eventemitter3@5.0.1/node_modules/eventemitter3/index.mjs", "../../codemirror-lsp/src/jsonRpc/index.mts", "../../codemirror-lsp/src/lsp/conversion.mts", "../../../node_modules/.pnpm/@lezer+common@1.0.3/node_modules/@lezer/common/dist/index.js", "../../../node_modules/.pnpm/@lezer+lr@1.3.9/node_modules/@lezer/lr/dist/index.js", "../../../node_modules/.pnpm/@lezer+highlight@1.1.6/node_modules/@lezer/highlight/dist/index.js", "../../../node_modules/.pnpm/@codemirror+autocomplete@6.8.1_@codemirror+language@6.9.0_@codemirror+state@6.2.1_@codemirror_xdyrjbo3jiz3uawtkjryt6trui/node_modules/@codemirror/autocomplete/dist/index.js", "../../codemirror-gdscript/src/index.mts", "../../lezer-gdscript/src/parser.js", "../../lezer-gdscript/src/tokens.js", "../../lezer-gdscript/src/parser.terms.js", "../../lezer-gdscript/src/highlight.js", "../../../node_modules/.pnpm/@lezer+common@1.0.3/node_modules/@lezer/common/dist/index.js", "../../codemirror-gdscript/src/complete.mts", "../../codemirror-freeze/src/facet.mts", "../../codemirror-freeze/src/theme.mts", "../../codemirror-freeze/src/transaction-filter.mts", "../../codemirror-freeze/src/utils.mts", "../../codemirror-freeze/src/view.mts", "../../codemirror-freeze/src/index.mts", "../../../node_modules/.pnpm/format-util@1.0.5/node_modules/format-util/format.js", "../src/index.mts", "../../../node_modules/.pnpm/eventemitter3@5.0.1/node_modules/eventemitter3/index.mjs", "../src/controller/main.mts", "../../../node_modules/.pnpm/p-queue@7.3.4/node_modules/p-queue/dist/index.js", "../../../node_modules/.pnpm/p-timeout@5.1.0/node_modules/p-timeout/index.js", "../../../node_modules/.pnpm/p-queue@7.3.4/node_modules/p-queue/dist/lower-bound.js", "../../../node_modules/.pnpm/p-queue@7.3.4/node_modules/p-queue/dist/priority-queue.js", "../src/controller/code.mts", "../../../node_modules/.pnpm/color-name@1.1.4/node_modules/color-name/index.js", "../../../node_modules/.pnpm/is-arrayish@0.3.2/node_modules/is-arrayish/index.js", "../../../node_modules/.pnpm/simple-swizzle@0.2.2/node_modules/simple-swizzle/index.js", "../../../node_modules/.pnpm/color-string@1.9.1/node_modules/color-string/index.js", "../../../node_modules/.pnpm/color-convert@2.0.1/node_modules/color-convert/conversions.js", "../../../node_modules/.pnpm/color-convert@2.0.1/node_modules/color-convert/route.js", "../../../node_modules/.pnpm/color-convert@2.0.1/node_modules/color-convert/index.js", "../../../node_modules/.pnpm/color@4.2.3/node_modules/color/index.js", "../../../node_modules/.pnpm/@lezer+common@1.0.3/node_modules/@lezer/common/dist/index.js", "../../../node_modules/.pnpm/@lezer+highlight@1.1.6/node_modules/@lezer/highlight/dist/index.js", "../../codemirror-gd-exercise-theme/src/index.mts", "../../codemirror-gd-exercise-theme/src/defaultGodot.mts", "../../codemirror-gd-exercise-theme/src/utils.mts", "../src/utils.mts", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/streams/codecs/deflate.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/streams/codecs/inflate.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/constants.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/streams/stream-adapter.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/configuration.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/util/mime-type.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/streams/codecs/crc32.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/streams/crc32-stream.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/util/encode-text.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/streams/codecs/sjcl.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/streams/common-crypto.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/streams/aes-crypto-stream.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/streams/zip-crypto-stream.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/streams/zip-entry-stream.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/streams/codec-stream.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/codec-worker.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/codec-pool.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/z-worker-inline.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/io.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/util/cp437-decode.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/util/decode-text.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/zip-entry.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/zip-reader.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/core/zip-writer.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/lib/zip-fs.js", "../../../node_modules/.pnpm/@zip.js+zip.js@2.7.24/node_modules/@zip.js/zip.js/index.js", "../src/controller/gdplayer.mts", "../src/controller/console.mts", "../../codemirror-console/src/index.mts", "../../codemirror-console/src/stickToBottom.mts", "../../codemirror-console/src/addConsoleError.mts", "../src/controller/test.mts"], "sourcesContent": ["'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n Events.prototype = Object.create(null);\n\n //\n // This hack is needed because the `__proto__` property is still inherited in\n // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n //\n if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n this.fn = fn;\n this.context = context;\n this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n if (typeof fn !== 'function') {\n throw new TypeError('The listener must be a function');\n }\n\n var listener = new EE(fn, context || emitter, once)\n , evt = prefix ? prefix + event : event;\n\n if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n else emitter._events[evt] = [emitter._events[evt], listener];\n\n return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n if (--emitter._eventsCount === 0) emitter._events = new Events();\n else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n this._events = new Events();\n this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n var names = []\n , events\n , name;\n\n if (this._eventsCount === 0) return names;\n\n for (name in (events = this._events)) {\n if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n }\n\n if (Object.getOwnPropertySymbols) {\n return names.concat(Object.getOwnPropertySymbols(events));\n }\n\n return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n var evt = prefix ? prefix + event : event\n , handlers = this._events[evt];\n\n if (!handlers) return [];\n if (handlers.fn) return [handlers.fn];\n\n for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n ee[i] = handlers[i].fn;\n }\n\n return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n var evt = prefix ? prefix + event : event\n , listeners = this._events[evt];\n\n if (!listeners) return 0;\n if (listeners.fn) return 1;\n return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return false;\n\n var listeners = this._events[evt]\n , len = arguments.length\n , args\n , i;\n\n if (listeners.fn) {\n if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n switch (len) {\n case 1: return listeners.fn.call(listeners.context), true;\n case 2: return listeners.fn.call(listeners.context, a1), true;\n case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n }\n\n for (i = 1, args = new Array(len -1); i < len; i++) {\n args[i - 1] = arguments[i];\n }\n\n listeners.fn.apply(listeners.context, args);\n } else {\n var length = listeners.length\n , j;\n\n for (i = 0; i < length; i++) {\n if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n switch (len) {\n case 1: listeners[i].fn.call(listeners[i].context); break;\n case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n default:\n if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n args[j - 1] = arguments[j];\n }\n\n listeners[i].fn.apply(listeners[i].context, args);\n }\n }\n }\n\n return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return this;\n if (!fn) {\n clearEvent(this, evt);\n return this;\n }\n\n var listeners = this._events[evt];\n\n if (listeners.fn) {\n if (\n listeners.fn === fn &&\n (!once || listeners.once) &&\n (!context || listeners.context === context)\n ) {\n clearEvent(this, evt);\n }\n } else {\n for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n if (\n listeners[i].fn !== fn ||\n (once && !listeners[i].once) ||\n (context && listeners[i].context !== context)\n ) {\n events.push(listeners[i]);\n }\n }\n\n //\n // Reset the array, or remove it completely if we have no more listeners.\n //\n if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n else clearEvent(this, evt);\n }\n\n return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n var evt;\n\n if (event) {\n evt = prefix ? prefix + event : event;\n if (this._events[evt]) clearEvent(this, evt);\n } else {\n this._events = new Events();\n this._eventsCount = 0;\n }\n\n return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n module.exports = EventEmitter;\n}\n", "// 'path' module extracted from Node.js v8.11.1 (only the posix part)\n// transplited with Babel\n\n// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nfunction assertPath(path) {\n if (typeof path !== 'string') {\n throw new TypeError('Path must be a string. Received ' + JSON.stringify(path));\n }\n}\n\n// Resolves . and .. elements in a path with directory names\nfunction normalizeStringPosix(path, allowAboveRoot) {\n var res = '';\n var lastSegmentLength = 0;\n var lastSlash = -1;\n var dots = 0;\n var code;\n for (var i = 0; i <= path.length; ++i) {\n if (i < path.length)\n code = path.charCodeAt(i);\n else if (code === 47 /*/*/)\n break;\n else\n code = 47 /*/*/;\n if (code === 47 /*/*/) {\n if (lastSlash === i - 1 || dots === 1) {\n // NOOP\n } else if (lastSlash !== i - 1 && dots === 2) {\n if (res.length < 2 || lastSegmentLength !== 2 || res.charCodeAt(res.length - 1) !== 46 /*.*/ || res.charCodeAt(res.length - 2) !== 46 /*.*/) {\n if (res.length > 2) {\n var lastSlashIndex = res.lastIndexOf('/');\n if (lastSlashIndex !== res.length - 1) {\n if (lastSlashIndex === -1) {\n res = '';\n lastSegmentLength = 0;\n } else {\n res = res.slice(0, lastSlashIndex);\n lastSegmentLength = res.length - 1 - res.lastIndexOf('/');\n }\n lastSlash = i;\n dots = 0;\n continue;\n }\n } else if (res.length === 2 || res.length === 1) {\n res = '';\n lastSegmentLength = 0;\n lastSlash = i;\n dots = 0;\n continue;\n }\n }\n if (allowAboveRoot) {\n if (res.length > 0)\n res += '/..';\n else\n res = '..';\n lastSegmentLength = 2;\n }\n } else {\n if (res.length > 0)\n res += '/' + path.slice(lastSlash + 1, i);\n else\n res = path.slice(lastSlash + 1, i);\n lastSegmentLength = i - lastSlash - 1;\n }\n lastSlash = i;\n dots = 0;\n } else if (code === 46 /*.*/ && dots !== -1) {\n ++dots;\n } else {\n dots = -1;\n }\n }\n return res;\n}\n\nfunction _format(sep, pathObject) {\n var dir = pathObject.dir || pathObject.root;\n var base = pathObject.base || (pathObject.name || '') + (pathObject.ext || '');\n if (!dir) {\n return base;\n }\n if (dir === pathObject.root) {\n return dir + base;\n }\n return dir + sep + base;\n}\n\nvar posix = {\n // path.resolve([from ...], to)\n resolve: function resolve() {\n var resolvedPath = '';\n var resolvedAbsolute = false;\n var cwd;\n\n for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n var path;\n if (i >= 0)\n path = arguments[i];\n else {\n if (cwd === undefined)\n cwd = process.cwd();\n path = cwd;\n }\n\n assertPath(path);\n\n // Skip empty entries\n if (path.length === 0) {\n continue;\n }\n\n resolvedPath = path + '/' + resolvedPath;\n resolvedAbsolute = path.charCodeAt(0) === 47 /*/*/;\n }\n\n // At this point the path should be resolved to a full absolute path, but\n // handle relative paths to be safe (might happen when process.cwd() fails)\n\n // Normalize the path\n resolvedPath = normalizeStringPosix(resolvedPath, !resolvedAbsolute);\n\n if (resolvedAbsolute) {\n if (resolvedPath.length > 0)\n return '/' + resolvedPath;\n else\n return '/';\n } else if (resolvedPath.length > 0) {\n return resolvedPath;\n } else {\n return '.';\n }\n },\n\n normalize: function normalize(path) {\n assertPath(path);\n\n if (path.length === 0) return '.';\n\n var isAbsolute = path.charCodeAt(0) === 47 /*/*/;\n var trailingSeparator = path.charCodeAt(path.length - 1) === 47 /*/*/;\n\n // Normalize the path\n path = normalizeStringPosix(path, !isAbsolute);\n\n if (path.length === 0 && !isAbsolute) path = '.';\n if (path.length > 0 && trailingSeparator) path += '/';\n\n if (isAbsolute) return '/' + path;\n return path;\n },\n\n isAbsolute: function isAbsolute(path) {\n assertPath(path);\n return path.length > 0 && path.charCodeAt(0) === 47 /*/*/;\n },\n\n join: function join() {\n if (arguments.length === 0)\n return '.';\n var joined;\n for (var i = 0; i < arguments.length; ++i) {\n var arg = arguments[i];\n assertPath(arg);\n if (arg.length > 0) {\n if (joined === undefined)\n joined = arg;\n else\n joined += '/' + arg;\n }\n }\n if (joined === undefined)\n return '.';\n return posix.normalize(joined);\n },\n\n relative: function relative(from, to) {\n assertPath(from);\n assertPath(to);\n\n if (from === to) return '';\n\n from = posix.resolve(from);\n to = posix.resolve(to);\n\n if (from === to) return '';\n\n // Trim any leading backslashes\n var fromStart = 1;\n for (; fromStart < from.length; ++fromStart) {\n if (from.charCodeAt(fromStart) !== 47 /*/*/)\n break;\n }\n var fromEnd = from.length;\n var fromLen = fromEnd - fromStart;\n\n // Trim any leading backslashes\n var toStart = 1;\n for (; toStart < to.length; ++toStart) {\n if (to.charCodeAt(toStart) !== 47 /*/*/)\n break;\n }\n var toEnd = to.length;\n var toLen = toEnd - toStart;\n\n // Compare paths to find the longest common path from root\n var length = fromLen < toLen ? fromLen : toLen;\n var lastCommonSep = -1;\n var i = 0;\n for (; i <= length; ++i) {\n if (i === length) {\n if (toLen > length) {\n if (to.charCodeAt(toStart + i) === 47 /*/*/) {\n // We get here if `from` is the exact base path for `to`.\n // For example: from='/foo/bar'; to='/foo/bar/baz'\n return to.slice(toStart + i + 1);\n } else if (i === 0) {\n // We get here if `from` is the root\n // For example: from='/'; to='/foo'\n return to.slice(toStart + i);\n }\n } else if (fromLen > length) {\n if (from.charCodeAt(fromStart + i) === 47 /*/*/) {\n // We get here if `to` is the exact base path for `from`.\n // For example: from='/foo/bar/baz'; to='/foo/bar'\n lastCommonSep = i;\n } else if (i === 0) {\n // We get here if `to` is the root.\n // For example: from='/foo'; to='/'\n lastCommonSep = 0;\n }\n }\n break;\n }\n var fromCode = from.charCodeAt(fromStart + i);\n var toCode = to.charCodeAt(toStart + i);\n if (fromCode !== toCode)\n break;\n else if (fromCode === 47 /*/*/)\n lastCommonSep = i;\n }\n\n var out = '';\n // Generate the relative path based on the path difference between `to`\n // and `from`\n for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n if (i === fromEnd || from.charCodeAt(i) === 47 /*/*/) {\n if (out.length === 0)\n out += '..';\n else\n out += '/..';\n }\n }\n\n // Lastly, append the rest of the destination (`to`) path that comes after\n // the common path parts\n if (out.length > 0)\n return out + to.slice(toStart + lastCommonSep);\n else {\n toStart += lastCommonSep;\n if (to.charCodeAt(toStart) === 47 /*/*/)\n ++toStart;\n return to.slice(toStart);\n }\n },\n\n _makeLong: function _makeLong(path) {\n return path;\n },\n\n dirname: function dirname(path) {\n assertPath(path);\n if (path.length === 0) return '.';\n var code = path.charCodeAt(0);\n var hasRoot = code === 47 /*/*/;\n var end = -1;\n var matchedSlash = true;\n for (var i = path.length - 1; i >= 1; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n if (!matchedSlash) {\n end = i;\n break;\n }\n } else {\n // We saw the first non-path separator\n matchedSlash = false;\n }\n }\n\n if (end === -1) return hasRoot ? '/' : '.';\n if (hasRoot && end === 1) return '//';\n return path.slice(0, end);\n },\n\n basename: function basename(path, ext) {\n if (ext !== undefined && typeof ext !== 'string') throw new TypeError('\"ext\" argument must be a string');\n assertPath(path);\n\n var start = 0;\n var end = -1;\n var matchedSlash = true;\n var i;\n\n if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\n if (ext.length === path.length && ext === path) return '';\n var extIdx = ext.length - 1;\n var firstNonSlashEnd = -1;\n for (i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else {\n if (firstNonSlashEnd === -1) {\n // We saw the first non-path separator, remember this index in case\n // we need it if the extension ends up not matching\n matchedSlash = false;\n firstNonSlashEnd = i + 1;\n }\n if (extIdx >= 0) {\n // Try to match the explicit extension\n if (code === ext.charCodeAt(extIdx)) {\n if (--extIdx === -1) {\n // We matched the extension, so mark this as the end of our path\n // component\n end = i;\n }\n } else {\n // Extension does not match, so our result is the entire path\n // component\n extIdx = -1;\n end = firstNonSlashEnd;\n }\n }\n }\n }\n\n if (start === end) end = firstNonSlashEnd;else if (end === -1) end = path.length;\n return path.slice(start, end);\n } else {\n for (i = path.length - 1; i >= 0; --i) {\n if (path.charCodeAt(i) === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // path component\n matchedSlash = false;\n end = i + 1;\n }\n }\n\n if (end === -1) return '';\n return path.slice(start, end);\n }\n },\n\n extname: function extname(path) {\n assertPath(path);\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n for (var i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1)\n startDot = i;\n else if (preDotState !== 1)\n preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (startDot === -1 || end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n return '';\n }\n return path.slice(startDot, end);\n },\n\n format: function format(pathObject) {\n if (pathObject === null || typeof pathObject !== 'object') {\n throw new TypeError('The \"pathObject\" argument must be of type Object. Received type ' + typeof pathObject);\n }\n return _format('/', pathObject);\n },\n\n parse: function parse(path) {\n assertPath(path);\n\n var ret = { root: '', dir: '', base: '', ext: '', name: '' };\n if (path.length === 0) return ret;\n var code = path.charCodeAt(0);\n var isAbsolute = code === 47 /*/*/;\n var start;\n if (isAbsolute) {\n ret.root = '/';\n start = 1;\n } else {\n start = 0;\n }\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n var i = path.length - 1;\n\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n\n // Get non-dir info\n for (; i >= start; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1) startDot = i;else if (preDotState !== 1) preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (startDot === -1 || end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n if (end !== -1) {\n if (startPart === 0 && isAbsolute) ret.base = ret.name = path.slice(1, end);else ret.base = ret.name = path.slice(startPart, end);\n }\n } else {\n if (startPart === 0 && isAbsolute) {\n ret.name = path.slice(1, startDot);\n ret.base = path.slice(1, end);\n } else {\n ret.name = path.slice(startPart, startDot);\n ret.base = path.slice(startPart, end);\n }\n ret.ext = path.slice(startDot, end);\n }\n\n if (startPart > 0) ret.dir = path.slice(0, startPart - 1);else if (isAbsolute) ret.dir = '/';\n\n return ret;\n },\n\n sep: '/',\n delimiter: ':',\n win32: null,\n posix: null\n};\n\nposix.posix = posix;\n\nmodule.exports = posix;\n", "'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n Events.prototype = Object.create(null);\n\n //\n // This hack is needed because the `__proto__` property is still inherited in\n // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n //\n if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n this.fn = fn;\n this.context = context;\n this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n if (typeof fn !== 'function') {\n throw new TypeError('The listener must be a function');\n }\n\n var listener = new EE(fn, context || emitter, once)\n , evt = prefix ? prefix + event : event;\n\n if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n else emitter._events[evt] = [emitter._events[evt], listener];\n\n return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n if (--emitter._eventsCount === 0) emitter._events = new Events();\n else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n this._events = new Events();\n this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n var names = []\n , events\n , name;\n\n if (this._eventsCount === 0) return names;\n\n for (name in (events = this._events)) {\n if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n }\n\n if (Object.getOwnPropertySymbols) {\n return names.concat(Object.getOwnPropertySymbols(events));\n }\n\n return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n var evt = prefix ? prefix + event : event\n , handlers = this._events[evt];\n\n if (!handlers) return [];\n if (handlers.fn) return [handlers.fn];\n\n for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n ee[i] = handlers[i].fn;\n }\n\n return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n var evt = prefix ? prefix + event : event\n , listeners = this._events[evt];\n\n if (!listeners) return 0;\n if (listeners.fn) return 1;\n return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return false;\n\n var listeners = this._events[evt]\n , len = arguments.length\n , args\n , i;\n\n if (listeners.fn) {\n if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n switch (len) {\n case 1: return listeners.fn.call(listeners.context), true;\n case 2: return listeners.fn.call(listeners.context, a1), true;\n case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n }\n\n for (i = 1, args = new Array(len -1); i < len; i++) {\n args[i - 1] = arguments[i];\n }\n\n listeners.fn.apply(listeners.context, args);\n } else {\n var length = listeners.length\n , j;\n\n for (i = 0; i < length; i++) {\n if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n switch (len) {\n case 1: listeners[i].fn.call(listeners[i].context); break;\n case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n default:\n if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n args[j - 1] = arguments[j];\n }\n\n listeners[i].fn.apply(listeners[i].context, args);\n }\n }\n }\n\n return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return this;\n if (!fn) {\n clearEvent(this, evt);\n return this;\n }\n\n var listeners = this._events[evt];\n\n if (listeners.fn) {\n if (\n listeners.fn === fn &&\n (!once || listeners.once) &&\n (!context || listeners.context === context)\n ) {\n clearEvent(this, evt);\n }\n } else {\n for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n if (\n listeners[i].fn !== fn ||\n (once && !listeners[i].once) ||\n (context && listeners[i].context !== context)\n ) {\n events.push(listeners[i]);\n }\n }\n\n //\n // Reset the array, or remove it completely if we have no more listeners.\n //\n if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n else clearEvent(this, evt);\n }\n\n return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n var evt;\n\n if (event) {\n evt = prefix ? prefix + event : event;\n if (this._events[evt]) clearEvent(this, evt);\n } else {\n this._events = new Events();\n this._eventsCount = 0;\n }\n\n return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n module.exports = EventEmitter;\n}\n", "'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n Events.prototype = Object.create(null);\n\n //\n // This hack is needed because the `__proto__` property is still inherited in\n // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n //\n if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n this.fn = fn;\n this.context = context;\n this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n if (typeof fn !== 'function') {\n throw new TypeError('The listener must be a function');\n }\n\n var listener = new EE(fn, context || emitter, once)\n , evt = prefix ? prefix + event : event;\n\n if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n else emitter._events[evt] = [emitter._events[evt], listener];\n\n return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n if (--emitter._eventsCount === 0) emitter._events = new Events();\n else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n this._events = new Events();\n this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n var names = []\n , events\n , name;\n\n if (this._eventsCount === 0) return names;\n\n for (name in (events = this._events)) {\n if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n }\n\n if (Object.getOwnPropertySymbols) {\n return names.concat(Object.getOwnPropertySymbols(events));\n }\n\n return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n var evt = prefix ? prefix + event : event\n , handlers = this._events[evt];\n\n if (!handlers) return [];\n if (handlers.fn) return [handlers.fn];\n\n for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n ee[i] = handlers[i].fn;\n }\n\n return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n var evt = prefix ? prefix + event : event\n , listeners = this._events[evt];\n\n if (!listeners) return 0;\n if (listeners.fn) return 1;\n return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return false;\n\n var listeners = this._events[evt]\n , len = arguments.length\n , args\n , i;\n\n if (listeners.fn) {\n if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n switch (len) {\n case 1: return listeners.fn.call(listeners.context), true;\n case 2: return listeners.fn.call(listeners.context, a1), true;\n case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n }\n\n for (i = 1, args = new Array(len -1); i < len; i++) {\n args[i - 1] = arguments[i];\n }\n\n listeners.fn.apply(listeners.context, args);\n } else {\n var length = listeners.length\n , j;\n\n for (i = 0; i < length; i++) {\n if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n switch (len) {\n case 1: listeners[i].fn.call(listeners[i].context); break;\n case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n default:\n if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n args[j - 1] = arguments[j];\n }\n\n listeners[i].fn.apply(listeners[i].context, args);\n }\n }\n }\n\n return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return this;\n if (!fn) {\n clearEvent(this, evt);\n return this;\n }\n\n var listeners = this._events[evt];\n\n if (listeners.fn) {\n if (\n listeners.fn === fn &&\n (!once || listeners.once) &&\n (!context || listeners.context === context)\n ) {\n clearEvent(this, evt);\n }\n } else {\n for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n if (\n listeners[i].fn !== fn ||\n (once && !listeners[i].once) ||\n (context && listeners[i].context !== context)\n ) {\n events.push(listeners[i]);\n }\n }\n\n //\n // Reset the array, or remove it completely if we have no more listeners.\n //\n if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n else clearEvent(this, evt);\n }\n\n return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n var evt;\n\n if (event) {\n evt = prefix ? prefix + event : event;\n if (this._events[evt]) clearEvent(this, evt);\n } else {\n this._events = new Events();\n this._eventsCount = 0;\n }\n\n return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n module.exports = EventEmitter;\n}\n", "import { linter, type Diagnostic, setDiagnostics } from \"@codemirror/lint\";\nimport { type Extension } from \"@codemirror/state\";\nimport { type EditorView, ViewPlugin, type ViewUpdate } from \"@codemirror/view\";\nimport { EventEmitter } from \"eventemitter3\";\n\n// import { generateLspAutocomplete } from \"./autocompletion.mts\";\nimport { JsonRpc } from \"./jsonRpc/index.mts\";\nimport {\n type TextDocumentPublishDiagnosticsRequest,\n getCharacterFromPosition,\n getDiagnosticSeverity,\n} from \"./lsp/conversion.mts\";\n\n// Export\nexport * from \"./lsp/conversion.mts\";\n\nexport type ServerResponseCallback = (jsonRpc: string) => void;\n\nexport interface LspConfigData {\n emitServerCommand: ServerResponseCallback;\n}\nexport interface LspConfig {\n autocompletion?: boolean;\n onClientCommand: (jsonRpc: string) => void;\n getData: (data: LspConfigData) => void;\n}\n\nexport function createLsp(config: LspConfig): Extension {\n const lspBus = new EventEmitter();\n\n let lspView: EditorView | null = null;\n let nextVersionId = 0;\n const { autocompletion = true, onClientCommand, getData } = config;\n const jsonRpcClient = new JsonRpc();\n\n class LspPlugin {\n view: EditorView;\n\n constructor(view: EditorView) {\n this.view = view;\n }\n\n update(update: ViewUpdate): void {}\n }\n ViewPlugin.fromClass(LspPlugin);\n\n const lspLinter = linter(async (view) => {\n lspView = view;\n lspBus.emit(\"view\", view);\n\n const diagnostics: Diagnostic[] = [];\n const localVersion = nextVersionId;\n nextVersionId += 1;\n\n jsonRpcClient.notify({\n method: \"textDocument/didChange\",\n params: {\n textDocument: {\n uri: \"file:///whatever\",\n version: localVersion,\n },\n contentChanges: [\n {\n text: view.state.doc.toString(),\n },\n ],\n },\n });\n\n return diagnostics;\n }, {});\n\n jsonRpcClient.on(\"request\", (request) => {\n onClientCommand(request);\n });\n\n const onNotification = (notification: any): void => {\n switch (notification.method) {\n case \"textDocument/publishDiagnostics\":\n onPublishDiagnostics(notification);\n break;\n }\n };\n\n jsonRpcClient.on(\"notification\", onNotification);\n\n const onPublishDiagnostics = (\n notification: TextDocumentPublishDiagnosticsRequest\n ): void => {\n console.log(\"onPublishDiagnostics\", notification, lspView);\n if (lspView == null) {\n return;\n }\n\n const diagnostics: Diagnostic[] = notification.params.diagnostics.map(\n (diagnostic) => {\n return {\n from: getCharacterFromPosition(\n lspView?.state.doc.toString() ?? \"\",\n diagnostic.range.start\n ),\n to: getCharacterFromPosition(\n lspView?.state.doc.toString() ?? \"\",\n diagnostic.range.end\n ),\n severity: getDiagnosticSeverity(diagnostic.severity),\n source: diagnostic.source,\n message: diagnostic.message,\n };\n }\n );\n\n console.log(\"diagnostics\", diagnostics);\n const transitionSpec = setDiagnostics(lspView.state, diagnostics);\n const transaction = lspView.state.update(transitionSpec);\n lspView.dispatch(transaction);\n };\n\n const emitServerCommand = (jsonRpc: string): void => {\n const json = JSON.parse(jsonRpc);\n if (typeof json === \"string\") {\n throw new Error(\"JSON is string\");\n }\n\n if (Array.isArray(json)) {\n const elements = [];\n for (const el of json) {\n if (\"method\" in el) {\n jsonRpcClient.emit(\"notification\", el);\n } else {\n elements.push(el);\n }\n }\n\n jsonRpcClient.emit(\"batch\", elements);\n return;\n }\n if (\"error\" in json) {\n jsonRpcClient.emit(\"error\", json);\n return;\n }\n if (\"result\" in json) {\n jsonRpcClient.emit(\"response\", json);\n return;\n }\n if (\"method\" in json) {\n jsonRpcClient.emit(\"notification\", json);\n return;\n }\n\n throw new Error(\"unknown error\");\n };\n\n getData({ emitServerCommand });\n\n return [\n lspLinter,\n ...(autocompletion\n ? [\n // generateLspAutocomplete({\n // client: jsonRpcClient,\n // bus: lspBus,\n // }),\n ]\n : []),\n ];\n}\n", "import EventEmitter from './index.js'\n\nexport { EventEmitter }\nexport default EventEmitter\n", "import EventEmitter from \"eventemitter3\";\n\nimport { type ServerErrors } from \"./serverErrors.mts\";\n\nconst ResponseErrors = {\n PARSE_ERROR: -32700,\n INVALID_REQUEST: -32600,\n METHOD_NOT_FOUND: -32601,\n INVALID_PARAMS: -32602,\n INTERNAL_ERROR: -32603,\n} as const;\ntype ResponseErrorKeys = keyof typeof ResponseErrors;\ntype ResponseErrorValues =\n | (typeof ResponseErrors)[ResponseErrorKeys]\n | ServerErrors;\n\nexport interface Request {\n jsonrpc: \"2.0\";\n method: string;\n params: any;\n id?: string | number | null;\n}\n\ninterface Response {\n jsonrpc: \"2.0\";\n id?: string | number | null;\n}\n\nexport interface ResponseSuccess extends Response {\n result: any;\n}\n\nexport interface ResponseError extends Response {\n error: {\n code: ResponseErrorValues;\n message: string;\n data?: any;\n };\n}\n\nexport type Responses = ResponseSuccess | ResponseError;\n\ntype PartialRequest = Omit;\n\nexport class JsonRpcError extends Error {\n code: number | string = 0;\n response: ResponseError | null = null;\n\n constructor(\n message?: string,\n options?: ErrorOptions & { code: number | string; response: ResponseError }\n ) {\n const { cause, code, response } = options ?? {};\n\n super(message, { cause });\n\n if (code != null) {\n this.code = code;\n }\n\n if (response != null) {\n this.response = response;\n }\n }\n}\n\nexport class JsonRpc extends EventEmitter {\n _requests = new Map();\n _lastId = 0;\n\n send(request: PartialRequest): Promise;\n send(request: PartialRequest[]): Promise;\n async send(\n request: PartialRequest | PartialRequest[]\n ): Promise {\n return await new Promise(\n (resolve, reject) => {\n if (Array.isArray(request)) {\n this._processBatch(request, resolve);\n } else {\n this._process(request, resolve, reject);\n }\n }\n );\n }\n\n notify(request: PartialRequest): void;\n notify(request: PartialRequest[]): void;\n notify(request: PartialRequest | PartialRequest[]): void {\n if (Array.isArray(request)) {\n new Promise((resolve) => {\n this._processBatch(request, resolve);\n }).catch((err) => {\n console.error(\"Error while processing batch:\", err);\n });\n return;\n }\n new Promise((resolve, reject) => {\n this._process(request, resolve, reject);\n }).catch((err) => {\n console.error(\"Error while running process:\", err);\n });\n }\n\n _process(\n request: PartialRequest,\n resolve: Parameters<\n ConstructorParameters>[0]\n >[0],\n reject: Parameters<\n ConstructorParameters>[0]\n >[1]\n ): void {\n const id = this._lastId;\n this._lastId += 1;\n\n const formattedRequest = {\n jsonrpc: \"2.0\" as const,\n id,\n ...request,\n };\n\n const removeListeners = (): void => {\n this.off(\"response\", onResponse);\n this.off(\"error\", onError);\n };\n\n const onResponse = (response: ResponseSuccess): void => {\n if (response.id === id) {\n resolve(response);\n removeListeners();\n }\n };\n\n const onError = (response: ResponseError): void => {\n if (response.id === id) {\n const error = new JsonRpcError(response.error.message, {\n code: response.error.code,\n response,\n });\n reject(error);\n removeListeners();\n }\n };\n\n this.on(\"response\", onResponse);\n this.on(\"error\", onError);\n\n this.emit(\"request\", JSON.stringify(formattedRequest));\n }\n\n _processBatch(\n request: PartialRequest[],\n resolve: Parameters<\n ConstructorParameters>[0]\n >[0]\n ): void {\n const requests: Request[] = request.map((request) => {\n const formattedRequest = {\n jsonrpc: \"2.0\" as const,\n id: this._lastId,\n ...request,\n };\n this._lastId += 1;\n return formattedRequest;\n });\n\n const onBatch = (responses: Responses[]): void => {\n const receivedResponses = [];\n\n for (const response of responses) {\n for (const request of requests) {\n if (request.id === response.id) {\n receivedResponses.push(response);\n }\n }\n }\n\n if (receivedResponses.length > 0) {\n resolve(receivedResponses);\n this.off(\"batch\", onBatch);\n }\n };\n\n this.on(\"batch\", onBatch);\n\n this.emit(\"request\", requests);\n }\n}\n", "import { type Request } from \"../jsonRpc/index.mts\";\n\nexport interface Position {\n character: number;\n line: number;\n}\n\nexport interface Range {\n start: Position;\n end: Position;\n}\n\nexport interface TextDocumentPublishDiagnosticsDiagnostic {\n code: number;\n message: string;\n range: Range;\n severity: number;\n source: string;\n}\n\nexport interface TextDocumentPublishDiagnosticsRequest extends Request {\n method: \"textDocument/publishDiagnostics\";\n params: {\n diagnostics: TextDocumentPublishDiagnosticsDiagnostic[];\n };\n}\n\nexport function getCharacterFromPosition(\n text: string,\n position: Position\n): number {\n let currentLine = 0;\n let currentColumn = 0;\n\n for (let ci = 0; ci < text.length; ci++) {\n const char = text[ci];\n if (char === \"\\n\") {\n currentLine += 1;\n currentColumn = 0;\n } else {\n currentColumn += 1;\n }\n\n if (position.line < currentLine) {\n return 0;\n }\n\n if (currentLine === position.line && currentColumn === position.character) {\n return ci + 1;\n }\n }\n\n return text.length;\n}\n\nexport function getPositionFromCharacter(\n text: string,\n character: number\n): Position {\n let currentLine = 0;\n let currentColumn = 0;\n\n for (let i = 1; i < text.length; i++) {\n const char = text[i - 1];\n if (char === \"\\n\") {\n currentLine += 1;\n currentColumn = 0;\n } else {\n currentColumn += 1;\n }\n\n if (i === character) {\n return {\n line: currentLine,\n character: currentColumn,\n };\n }\n }\n\n return {\n line: currentLine,\n character: currentColumn,\n };\n}\n\nexport function getDiagnosticSeverity(\n severity: number\n): \"error\" | \"warning\" | \"info\" {\n switch (severity) {\n case 1:\n return \"error\";\n case 2:\n return \"warning\";\n case 3:\n case 4:\n default:\n return \"info\";\n }\n}\n", "// FIXME profile adding a per-Tree TreeNode cache, validating it by\n// parent pointer\n/// The default maximum length of a `TreeBuffer` node.\nconst DefaultBufferLength = 1024;\nlet nextPropID = 0;\nclass Range {\n constructor(from, to) {\n this.from = from;\n this.to = to;\n }\n}\n/// Each [node type](#common.NodeType) or [individual tree](#common.Tree)\n/// can have metadata associated with it in props. Instances of this\n/// class represent prop names.\nclass NodeProp {\n /// Create a new node prop type.\n constructor(config = {}) {\n this.id = nextPropID++;\n this.perNode = !!config.perNode;\n this.deserialize = config.deserialize || (() => {\n throw new Error(\"This node type doesn't define a deserialize function\");\n });\n }\n /// This is meant to be used with\n /// [`NodeSet.extend`](#common.NodeSet.extend) or\n /// [`LRParser.configure`](#lr.ParserConfig.props) to compute\n /// prop values for each node type in the set. Takes a [match\n /// object](#common.NodeType^match) or function that returns undefined\n /// if the node type doesn't get this prop, and the prop's value if\n /// it does.\n add(match) {\n if (this.perNode)\n throw new RangeError(\"Can't add per-node props to node types\");\n if (typeof match != \"function\")\n match = NodeType.match(match);\n return (type) => {\n let result = match(type);\n return result === undefined ? null : [this, result];\n };\n }\n}\n/// Prop that is used to describe matching delimiters. For opening\n/// delimiters, this holds an array of node names (written as a\n/// space-separated string when declaring this prop in a grammar)\n/// for the node types of closing delimiters that match it.\nNodeProp.closedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/// The inverse of [`closedBy`](#common.NodeProp^closedBy). This is\n/// attached to closing delimiters, holding an array of node names\n/// of types of matching opening delimiters.\nNodeProp.openedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/// Used to assign node types to groups (for example, all node\n/// types that represent an expression could be tagged with an\n/// `\"Expression\"` group).\nNodeProp.group = new NodeProp({ deserialize: str => str.split(\" \") });\n/// The hash of the [context](#lr.ContextTracker.constructor)\n/// that the node was parsed in, if any. Used to limit reuse of\n/// contextual nodes.\nNodeProp.contextHash = new NodeProp({ perNode: true });\n/// The distance beyond the end of the node that the tokenizer\n/// looked ahead for any of the tokens inside the node. (The LR\n/// parser only stores this when it is larger than 25, for\n/// efficiency reasons.)\nNodeProp.lookAhead = new NodeProp({ perNode: true });\n/// This per-node prop is used to replace a given node, or part of a\n/// node, with another tree. This is useful to include trees from\n/// different languages in mixed-language parsers.\nNodeProp.mounted = new NodeProp({ perNode: true });\n/// A mounted tree, which can be [stored](#common.NodeProp^mounted) on\n/// a tree node to indicate that parts of its content are\n/// represented by another tree.\nclass MountedTree {\n constructor(\n /// The inner tree.\n tree, \n /// If this is null, this tree replaces the entire node (it will\n /// be included in the regular iteration instead of its host\n /// node). If not, only the given ranges are considered to be\n /// covered by this tree. This is used for trees that are mixed in\n /// a way that isn't strictly hierarchical. Such mounted trees are\n /// only entered by [`resolveInner`](#common.Tree.resolveInner)\n /// and [`enter`](#common.SyntaxNode.enter).\n overlay, \n /// The parser used to create this subtree.\n parser) {\n this.tree = tree;\n this.overlay = overlay;\n this.parser = parser;\n }\n}\nconst noProps = Object.create(null);\n/// Each node in a syntax tree has a node type associated with it.\nclass NodeType {\n /// @internal\n constructor(\n /// The name of the node type. Not necessarily unique, but if the\n /// grammar was written properly, different node types with the\n /// same name within a node set should play the same semantic\n /// role.\n name, \n /// @internal\n props, \n /// The id of this node in its set. Corresponds to the term ids\n /// used in the parser.\n id, \n /// @internal\n flags = 0) {\n this.name = name;\n this.props = props;\n this.id = id;\n this.flags = flags;\n }\n /// Define a node type.\n static define(spec) {\n let props = spec.props && spec.props.length ? Object.create(null) : noProps;\n let flags = (spec.top ? 1 /* NodeFlag.Top */ : 0) | (spec.skipped ? 2 /* NodeFlag.Skipped */ : 0) |\n (spec.error ? 4 /* NodeFlag.Error */ : 0) | (spec.name == null ? 8 /* NodeFlag.Anonymous */ : 0);\n let type = new NodeType(spec.name || \"\", props, spec.id, flags);\n if (spec.props)\n for (let src of spec.props) {\n if (!Array.isArray(src))\n src = src(type);\n if (src) {\n if (src[0].perNode)\n throw new RangeError(\"Can't store a per-node prop on a node type\");\n props[src[0].id] = src[1];\n }\n }\n return type;\n }\n /// Retrieves a node prop for this type. Will return `undefined` if\n /// the prop isn't present on this node.\n prop(prop) { return this.props[prop.id]; }\n /// True when this is the top node of a grammar.\n get isTop() { return (this.flags & 1 /* NodeFlag.Top */) > 0; }\n /// True when this node is produced by a skip rule.\n get isSkipped() { return (this.flags & 2 /* NodeFlag.Skipped */) > 0; }\n /// Indicates whether this is an error node.\n get isError() { return (this.flags & 4 /* NodeFlag.Error */) > 0; }\n /// When true, this node type doesn't correspond to a user-declared\n /// named node, for example because it is used to cache repetition.\n get isAnonymous() { return (this.flags & 8 /* NodeFlag.Anonymous */) > 0; }\n /// Returns true when this node's name or one of its\n /// [groups](#common.NodeProp^group) matches the given string.\n is(name) {\n if (typeof name == 'string') {\n if (this.name == name)\n return true;\n let group = this.prop(NodeProp.group);\n return group ? group.indexOf(name) > -1 : false;\n }\n return this.id == name;\n }\n /// Create a function from node types to arbitrary values by\n /// specifying an object whose property names are node or\n /// [group](#common.NodeProp^group) names. Often useful with\n /// [`NodeProp.add`](#common.NodeProp.add). You can put multiple\n /// names, separated by spaces, in a single property name to map\n /// multiple node names to a single value.\n static match(map) {\n let direct = Object.create(null);\n for (let prop in map)\n for (let name of prop.split(\" \"))\n direct[name] = map[prop];\n return (node) => {\n for (let groups = node.prop(NodeProp.group), i = -1; i < (groups ? groups.length : 0); i++) {\n let found = direct[i < 0 ? node.name : groups[i]];\n if (found)\n return found;\n }\n };\n }\n}\n/// An empty dummy node type to use when no actual type is available.\nNodeType.none = new NodeType(\"\", Object.create(null), 0, 8 /* NodeFlag.Anonymous */);\n/// A node set holds a collection of node types. It is used to\n/// compactly represent trees by storing their type ids, rather than a\n/// full pointer to the type object, in a numeric array. Each parser\n/// [has](#lr.LRParser.nodeSet) a node set, and [tree\n/// buffers](#common.TreeBuffer) can only store collections of nodes\n/// from the same set. A set can have a maximum of 2**16 (65536) node\n/// types in it, so that the ids fit into 16-bit typed array slots.\nclass NodeSet {\n /// Create a set with the given types. The `id` property of each\n /// type should correspond to its position within the array.\n constructor(\n /// The node types in this set, by id.\n types) {\n this.types = types;\n for (let i = 0; i < types.length; i++)\n if (types[i].id != i)\n throw new RangeError(\"Node type ids should correspond to array positions when creating a node set\");\n }\n /// Create a copy of this set with some node properties added. The\n /// arguments to this method can be created with\n /// [`NodeProp.add`](#common.NodeProp.add).\n extend(...props) {\n let newTypes = [];\n for (let type of this.types) {\n let newProps = null;\n for (let source of props) {\n let add = source(type);\n if (add) {\n if (!newProps)\n newProps = Object.assign({}, type.props);\n newProps[add[0].id] = add[1];\n }\n }\n newTypes.push(newProps ? new NodeType(type.name, newProps, type.id, type.flags) : type);\n }\n return new NodeSet(newTypes);\n }\n}\nconst CachedNode = new WeakMap(), CachedInnerNode = new WeakMap();\n/// Options that control iteration. Can be combined with the `|`\n/// operator to enable multiple ones.\nvar IterMode;\n(function (IterMode) {\n /// When enabled, iteration will only visit [`Tree`](#common.Tree)\n /// objects, not nodes packed into\n /// [`TreeBuffer`](#common.TreeBuffer)s.\n IterMode[IterMode[\"ExcludeBuffers\"] = 1] = \"ExcludeBuffers\";\n /// Enable this to make iteration include anonymous nodes (such as\n /// the nodes that wrap repeated grammar constructs into a balanced\n /// tree).\n IterMode[IterMode[\"IncludeAnonymous\"] = 2] = \"IncludeAnonymous\";\n /// By default, regular [mounted](#common.NodeProp^mounted) nodes\n /// replace their base node in iteration. Enable this to ignore them\n /// instead.\n IterMode[IterMode[\"IgnoreMounts\"] = 4] = \"IgnoreMounts\";\n /// This option only applies in\n /// [`enter`](#common.SyntaxNode.enter)-style methods. It tells the\n /// library to not enter mounted overlays if one covers the given\n /// position.\n IterMode[IterMode[\"IgnoreOverlays\"] = 8] = \"IgnoreOverlays\";\n})(IterMode || (IterMode = {}));\n/// A piece of syntax tree. There are two ways to approach these\n/// trees: the way they are actually stored in memory, and the\n/// convenient way.\n///\n/// Syntax trees are stored as a tree of `Tree` and `TreeBuffer`\n/// objects. By packing detail information into `TreeBuffer` leaf\n/// nodes, the representation is made a lot more memory-efficient.\n///\n/// However, when you want to actually work with tree nodes, this\n/// representation is very awkward, so most client code will want to\n/// use the [`TreeCursor`](#common.TreeCursor) or\n/// [`SyntaxNode`](#common.SyntaxNode) interface instead, which provides\n/// a view on some part of this data structure, and can be used to\n/// move around to adjacent nodes.\nclass Tree {\n /// Construct a new tree. See also [`Tree.build`](#common.Tree^build).\n constructor(\n /// The type of the top node.\n type, \n /// This node's child nodes.\n children, \n /// The positions (offsets relative to the start of this tree) of\n /// the children.\n positions, \n /// The total length of this tree\n length, \n /// Per-node [node props](#common.NodeProp) to associate with this node.\n props) {\n this.type = type;\n this.children = children;\n this.positions = positions;\n this.length = length;\n /// @internal\n this.props = null;\n if (props && props.length) {\n this.props = Object.create(null);\n for (let [prop, value] of props)\n this.props[typeof prop == \"number\" ? prop : prop.id] = value;\n }\n }\n /// @internal\n toString() {\n let mounted = this.prop(NodeProp.mounted);\n if (mounted && !mounted.overlay)\n return mounted.tree.toString();\n let children = \"\";\n for (let ch of this.children) {\n let str = ch.toString();\n if (str) {\n if (children)\n children += \",\";\n children += str;\n }\n }\n return !this.type.name ? children :\n (/\\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) +\n (children.length ? \"(\" + children + \")\" : \"\");\n }\n /// Get a [tree cursor](#common.TreeCursor) positioned at the top of\n /// the tree. Mode can be used to [control](#common.IterMode) which\n /// nodes the cursor visits.\n cursor(mode = 0) {\n return new TreeCursor(this.topNode, mode);\n }\n /// Get a [tree cursor](#common.TreeCursor) pointing into this tree\n /// at the given position and side (see\n /// [`moveTo`](#common.TreeCursor.moveTo).\n cursorAt(pos, side = 0, mode = 0) {\n let scope = CachedNode.get(this) || this.topNode;\n let cursor = new TreeCursor(scope);\n cursor.moveTo(pos, side);\n CachedNode.set(this, cursor._tree);\n return cursor;\n }\n /// Get a [syntax node](#common.SyntaxNode) object for the top of the\n /// tree.\n get topNode() {\n return new TreeNode(this, 0, 0, null);\n }\n /// Get the [syntax node](#common.SyntaxNode) at the given position.\n /// If `side` is -1, this will move into nodes that end at the\n /// position. If 1, it'll move into nodes that start at the\n /// position. With 0, it'll only enter nodes that cover the position\n /// from both sides.\n ///\n /// Note that this will not enter\n /// [overlays](#common.MountedTree.overlay), and you often want\n /// [`resolveInner`](#common.Tree.resolveInner) instead.\n resolve(pos, side = 0) {\n let node = resolveNode(CachedNode.get(this) || this.topNode, pos, side, false);\n CachedNode.set(this, node);\n return node;\n }\n /// Like [`resolve`](#common.Tree.resolve), but will enter\n /// [overlaid](#common.MountedTree.overlay) nodes, producing a syntax node\n /// pointing into the innermost overlaid tree at the given position\n /// (with parent links going through all parent structure, including\n /// the host trees).\n resolveInner(pos, side = 0) {\n let node = resolveNode(CachedInnerNode.get(this) || this.topNode, pos, side, true);\n CachedInnerNode.set(this, node);\n return node;\n }\n /// Iterate over the tree and its children, calling `enter` for any\n /// node that touches the `from`/`to` region (if given) before\n /// running over such a node's children, and `leave` (if given) when\n /// leaving the node. When `enter` returns `false`, that node will\n /// not have its children iterated over (or `leave` called).\n iterate(spec) {\n let { enter, leave, from = 0, to = this.length } = spec;\n let mode = spec.mode || 0, anon = (mode & IterMode.IncludeAnonymous) > 0;\n for (let c = this.cursor(mode | IterMode.IncludeAnonymous);;) {\n let entered = false;\n if (c.from <= to && c.to >= from && (!anon && c.type.isAnonymous || enter(c) !== false)) {\n if (c.firstChild())\n continue;\n entered = true;\n }\n for (;;) {\n if (entered && leave && (anon || !c.type.isAnonymous))\n leave(c);\n if (c.nextSibling())\n break;\n if (!c.parent())\n return;\n entered = true;\n }\n }\n }\n /// Get the value of the given [node prop](#common.NodeProp) for this\n /// node. Works with both per-node and per-type props.\n prop(prop) {\n return !prop.perNode ? this.type.prop(prop) : this.props ? this.props[prop.id] : undefined;\n }\n /// Returns the node's [per-node props](#common.NodeProp.perNode) in a\n /// format that can be passed to the [`Tree`](#common.Tree)\n /// constructor.\n get propValues() {\n let result = [];\n if (this.props)\n for (let id in this.props)\n result.push([+id, this.props[id]]);\n return result;\n }\n /// Balance the direct children of this tree, producing a copy of\n /// which may have children grouped into subtrees with type\n /// [`NodeType.none`](#common.NodeType^none).\n balance(config = {}) {\n return this.children.length <= 8 /* Balance.BranchFactor */ ? this :\n balanceRange(NodeType.none, this.children, this.positions, 0, this.children.length, 0, this.length, (children, positions, length) => new Tree(this.type, children, positions, length, this.propValues), config.makeTree || ((children, positions, length) => new Tree(NodeType.none, children, positions, length)));\n }\n /// Build a tree from a postfix-ordered buffer of node information,\n /// or a cursor over such a buffer.\n static build(data) { return buildTree(data); }\n}\n/// The empty tree\nTree.empty = new Tree(NodeType.none, [], [], 0);\nclass FlatBufferCursor {\n constructor(buffer, index) {\n this.buffer = buffer;\n this.index = index;\n }\n get id() { return this.buffer[this.index - 4]; }\n get start() { return this.buffer[this.index - 3]; }\n get end() { return this.buffer[this.index - 2]; }\n get size() { return this.buffer[this.index - 1]; }\n get pos() { return this.index; }\n next() { this.index -= 4; }\n fork() { return new FlatBufferCursor(this.buffer, this.index); }\n}\n/// Tree buffers contain (type, start, end, endIndex) quads for each\n/// node. In such a buffer, nodes are stored in prefix order (parents\n/// before children, with the endIndex of the parent indicating which\n/// children belong to it).\nclass TreeBuffer {\n /// Create a tree buffer.\n constructor(\n /// The buffer's content.\n buffer, \n /// The total length of the group of nodes in the buffer.\n length, \n /// The node set used in this buffer.\n set) {\n this.buffer = buffer;\n this.length = length;\n this.set = set;\n }\n /// @internal\n get type() { return NodeType.none; }\n /// @internal\n toString() {\n let result = [];\n for (let index = 0; index < this.buffer.length;) {\n result.push(this.childString(index));\n index = this.buffer[index + 3];\n }\n return result.join(\",\");\n }\n /// @internal\n childString(index) {\n let id = this.buffer[index], endIndex = this.buffer[index + 3];\n let type = this.set.types[id], result = type.name;\n if (/\\W/.test(result) && !type.isError)\n result = JSON.stringify(result);\n index += 4;\n if (endIndex == index)\n return result;\n let children = [];\n while (index < endIndex) {\n children.push(this.childString(index));\n index = this.buffer[index + 3];\n }\n return result + \"(\" + children.join(\",\") + \")\";\n }\n /// @internal\n findChild(startIndex, endIndex, dir, pos, side) {\n let { buffer } = this, pick = -1;\n for (let i = startIndex; i != endIndex; i = buffer[i + 3]) {\n if (checkSide(side, pos, buffer[i + 1], buffer[i + 2])) {\n pick = i;\n if (dir > 0)\n break;\n }\n }\n return pick;\n }\n /// @internal\n slice(startI, endI, from) {\n let b = this.buffer;\n let copy = new Uint16Array(endI - startI), len = 0;\n for (let i = startI, j = 0; i < endI;) {\n copy[j++] = b[i++];\n copy[j++] = b[i++] - from;\n let to = copy[j++] = b[i++] - from;\n copy[j++] = b[i++] - startI;\n len = Math.max(len, to);\n }\n return new TreeBuffer(copy, len, this.set);\n }\n}\nfunction checkSide(side, pos, from, to) {\n switch (side) {\n case -2 /* Side.Before */: return from < pos;\n case -1 /* Side.AtOrBefore */: return to >= pos && from < pos;\n case 0 /* Side.Around */: return from < pos && to > pos;\n case 1 /* Side.AtOrAfter */: return from <= pos && to > pos;\n case 2 /* Side.After */: return to > pos;\n case 4 /* Side.DontCare */: return true;\n }\n}\nfunction enterUnfinishedNodesBefore(node, pos) {\n let scan = node.childBefore(pos);\n while (scan) {\n let last = scan.lastChild;\n if (!last || last.to != scan.to)\n break;\n if (last.type.isError && last.from == last.to) {\n node = scan;\n scan = last.prevSibling;\n }\n else {\n scan = last;\n }\n }\n return node;\n}\nfunction resolveNode(node, pos, side, overlays) {\n var _a;\n // Move up to a node that actually holds the position, if possible\n while (node.from == node.to ||\n (side < 1 ? node.from >= pos : node.from > pos) ||\n (side > -1 ? node.to <= pos : node.to < pos)) {\n let parent = !overlays && node instanceof TreeNode && node.index < 0 ? null : node.parent;\n if (!parent)\n return node;\n node = parent;\n }\n let mode = overlays ? 0 : IterMode.IgnoreOverlays;\n // Must go up out of overlays when those do not overlap with pos\n if (overlays)\n for (let scan = node, parent = scan.parent; parent; scan = parent, parent = scan.parent) {\n if (scan instanceof TreeNode && scan.index < 0 && ((_a = parent.enter(pos, side, mode)) === null || _a === void 0 ? void 0 : _a.from) != scan.from)\n node = parent;\n }\n for (;;) {\n let inner = node.enter(pos, side, mode);\n if (!inner)\n return node;\n node = inner;\n }\n}\nclass TreeNode {\n constructor(_tree, from, \n // Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay)\n index, _parent) {\n this._tree = _tree;\n this.from = from;\n this.index = index;\n this._parent = _parent;\n }\n get type() { return this._tree.type; }\n get name() { return this._tree.type.name; }\n get to() { return this.from + this._tree.length; }\n nextChild(i, dir, pos, side, mode = 0) {\n for (let parent = this;;) {\n for (let { children, positions } = parent._tree, e = dir > 0 ? children.length : -1; i != e; i += dir) {\n let next = children[i], start = positions[i] + parent.from;\n if (!checkSide(side, pos, start, start + next.length))\n continue;\n if (next instanceof TreeBuffer) {\n if (mode & IterMode.ExcludeBuffers)\n continue;\n let index = next.findChild(0, next.buffer.length, dir, pos - start, side);\n if (index > -1)\n return new BufferNode(new BufferContext(parent, next, i, start), null, index);\n }\n else if ((mode & IterMode.IncludeAnonymous) || (!next.type.isAnonymous || hasChild(next))) {\n let mounted;\n if (!(mode & IterMode.IgnoreMounts) &&\n next.props && (mounted = next.prop(NodeProp.mounted)) && !mounted.overlay)\n return new TreeNode(mounted.tree, start, i, parent);\n let inner = new TreeNode(next, start, i, parent);\n return (mode & IterMode.IncludeAnonymous) || !inner.type.isAnonymous ? inner\n : inner.nextChild(dir < 0 ? next.children.length - 1 : 0, dir, pos, side);\n }\n }\n if ((mode & IterMode.IncludeAnonymous) || !parent.type.isAnonymous)\n return null;\n if (parent.index >= 0)\n i = parent.index + dir;\n else\n i = dir < 0 ? -1 : parent._parent._tree.children.length;\n parent = parent._parent;\n if (!parent)\n return null;\n }\n }\n get firstChild() { return this.nextChild(0, 1, 0, 4 /* Side.DontCare */); }\n get lastChild() { return this.nextChild(this._tree.children.length - 1, -1, 0, 4 /* Side.DontCare */); }\n childAfter(pos) { return this.nextChild(0, 1, pos, 2 /* Side.After */); }\n childBefore(pos) { return this.nextChild(this._tree.children.length - 1, -1, pos, -2 /* Side.Before */); }\n enter(pos, side, mode = 0) {\n let mounted;\n if (!(mode & IterMode.IgnoreOverlays) && (mounted = this._tree.prop(NodeProp.mounted)) && mounted.overlay) {\n let rPos = pos - this.from;\n for (let { from, to } of mounted.overlay) {\n if ((side > 0 ? from <= rPos : from < rPos) &&\n (side < 0 ? to >= rPos : to > rPos))\n return new TreeNode(mounted.tree, mounted.overlay[0].from + this.from, -1, this);\n }\n }\n return this.nextChild(0, 1, pos, side, mode);\n }\n nextSignificantParent() {\n let val = this;\n while (val.type.isAnonymous && val._parent)\n val = val._parent;\n return val;\n }\n get parent() {\n return this._parent ? this._parent.nextSignificantParent() : null;\n }\n get nextSibling() {\n return this._parent && this.index >= 0 ? this._parent.nextChild(this.index + 1, 1, 0, 4 /* Side.DontCare */) : null;\n }\n get prevSibling() {\n return this._parent && this.index >= 0 ? this._parent.nextChild(this.index - 1, -1, 0, 4 /* Side.DontCare */) : null;\n }\n cursor(mode = 0) { return new TreeCursor(this, mode); }\n get tree() { return this._tree; }\n toTree() { return this._tree; }\n resolve(pos, side = 0) {\n return resolveNode(this, pos, side, false);\n }\n resolveInner(pos, side = 0) {\n return resolveNode(this, pos, side, true);\n }\n enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); }\n getChild(type, before = null, after = null) {\n let r = getChildren(this, type, before, after);\n return r.length ? r[0] : null;\n }\n getChildren(type, before = null, after = null) {\n return getChildren(this, type, before, after);\n }\n /// @internal\n toString() { return this._tree.toString(); }\n get node() { return this; }\n matchContext(context) { return matchNodeContext(this, context); }\n}\nfunction getChildren(node, type, before, after) {\n let cur = node.cursor(), result = [];\n if (!cur.firstChild())\n return result;\n if (before != null)\n while (!cur.type.is(before))\n if (!cur.nextSibling())\n return result;\n for (;;) {\n if (after != null && cur.type.is(after))\n return result;\n if (cur.type.is(type))\n result.push(cur.node);\n if (!cur.nextSibling())\n return after == null ? result : [];\n }\n}\nfunction matchNodeContext(node, context, i = context.length - 1) {\n for (let p = node.parent; i >= 0; p = p.parent) {\n if (!p)\n return false;\n if (!p.type.isAnonymous) {\n if (context[i] && context[i] != p.name)\n return false;\n i--;\n }\n }\n return true;\n}\nclass BufferContext {\n constructor(parent, buffer, index, start) {\n this.parent = parent;\n this.buffer = buffer;\n this.index = index;\n this.start = start;\n }\n}\nclass BufferNode {\n get name() { return this.type.name; }\n get from() { return this.context.start + this.context.buffer.buffer[this.index + 1]; }\n get to() { return this.context.start + this.context.buffer.buffer[this.index + 2]; }\n constructor(context, _parent, index) {\n this.context = context;\n this._parent = _parent;\n this.index = index;\n this.type = context.buffer.set.types[context.buffer.buffer[index]];\n }\n child(dir, pos, side) {\n let { buffer } = this.context;\n let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.context.start, side);\n return index < 0 ? null : new BufferNode(this.context, this, index);\n }\n get firstChild() { return this.child(1, 0, 4 /* Side.DontCare */); }\n get lastChild() { return this.child(-1, 0, 4 /* Side.DontCare */); }\n childAfter(pos) { return this.child(1, pos, 2 /* Side.After */); }\n childBefore(pos) { return this.child(-1, pos, -2 /* Side.Before */); }\n enter(pos, side, mode = 0) {\n if (mode & IterMode.ExcludeBuffers)\n return null;\n let { buffer } = this.context;\n let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], side > 0 ? 1 : -1, pos - this.context.start, side);\n return index < 0 ? null : new BufferNode(this.context, this, index);\n }\n get parent() {\n return this._parent || this.context.parent.nextSignificantParent();\n }\n externalSibling(dir) {\n return this._parent ? null : this.context.parent.nextChild(this.context.index + dir, dir, 0, 4 /* Side.DontCare */);\n }\n get nextSibling() {\n let { buffer } = this.context;\n let after = buffer.buffer[this.index + 3];\n if (after < (this._parent ? buffer.buffer[this._parent.index + 3] : buffer.buffer.length))\n return new BufferNode(this.context, this._parent, after);\n return this.externalSibling(1);\n }\n get prevSibling() {\n let { buffer } = this.context;\n let parentStart = this._parent ? this._parent.index + 4 : 0;\n if (this.index == parentStart)\n return this.externalSibling(-1);\n return new BufferNode(this.context, this._parent, buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n }\n cursor(mode = 0) { return new TreeCursor(this, mode); }\n get tree() { return null; }\n toTree() {\n let children = [], positions = [];\n let { buffer } = this.context;\n let startI = this.index + 4, endI = buffer.buffer[this.index + 3];\n if (endI > startI) {\n let from = buffer.buffer[this.index + 1];\n children.push(buffer.slice(startI, endI, from));\n positions.push(0);\n }\n return new Tree(this.type, children, positions, this.to - this.from);\n }\n resolve(pos, side = 0) {\n return resolveNode(this, pos, side, false);\n }\n resolveInner(pos, side = 0) {\n return resolveNode(this, pos, side, true);\n }\n enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); }\n /// @internal\n toString() { return this.context.buffer.childString(this.index); }\n getChild(type, before = null, after = null) {\n let r = getChildren(this, type, before, after);\n return r.length ? r[0] : null;\n }\n getChildren(type, before = null, after = null) {\n return getChildren(this, type, before, after);\n }\n get node() { return this; }\n matchContext(context) { return matchNodeContext(this, context); }\n}\n/// A tree cursor object focuses on a given node in a syntax tree, and\n/// allows you to move to adjacent nodes.\nclass TreeCursor {\n /// Shorthand for `.type.name`.\n get name() { return this.type.name; }\n /// @internal\n constructor(node, \n /// @internal\n mode = 0) {\n this.mode = mode;\n /// @internal\n this.buffer = null;\n this.stack = [];\n /// @internal\n this.index = 0;\n this.bufferNode = null;\n if (node instanceof TreeNode) {\n this.yieldNode(node);\n }\n else {\n this._tree = node.context.parent;\n this.buffer = node.context;\n for (let n = node._parent; n; n = n._parent)\n this.stack.unshift(n.index);\n this.bufferNode = node;\n this.yieldBuf(node.index);\n }\n }\n yieldNode(node) {\n if (!node)\n return false;\n this._tree = node;\n this.type = node.type;\n this.from = node.from;\n this.to = node.to;\n return true;\n }\n yieldBuf(index, type) {\n this.index = index;\n let { start, buffer } = this.buffer;\n this.type = type || buffer.set.types[buffer.buffer[index]];\n this.from = start + buffer.buffer[index + 1];\n this.to = start + buffer.buffer[index + 2];\n return true;\n }\n yield(node) {\n if (!node)\n return false;\n if (node instanceof TreeNode) {\n this.buffer = null;\n return this.yieldNode(node);\n }\n this.buffer = node.context;\n return this.yieldBuf(node.index, node.type);\n }\n /// @internal\n toString() {\n return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();\n }\n /// @internal\n enterChild(dir, pos, side) {\n if (!this.buffer)\n return this.yield(this._tree.nextChild(dir < 0 ? this._tree._tree.children.length - 1 : 0, dir, pos, side, this.mode));\n let { buffer } = this.buffer;\n let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.buffer.start, side);\n if (index < 0)\n return false;\n this.stack.push(this.index);\n return this.yieldBuf(index);\n }\n /// Move the cursor to this node's first child. When this returns\n /// false, the node has no child, and the cursor has not been moved.\n firstChild() { return this.enterChild(1, 0, 4 /* Side.DontCare */); }\n /// Move the cursor to this node's last child.\n lastChild() { return this.enterChild(-1, 0, 4 /* Side.DontCare */); }\n /// Move the cursor to the first child that ends after `pos`.\n childAfter(pos) { return this.enterChild(1, pos, 2 /* Side.After */); }\n /// Move to the last child that starts before `pos`.\n childBefore(pos) { return this.enterChild(-1, pos, -2 /* Side.Before */); }\n /// Move the cursor to the child around `pos`. If side is -1 the\n /// child may end at that position, when 1 it may start there. This\n /// will also enter [overlaid](#common.MountedTree.overlay)\n /// [mounted](#common.NodeProp^mounted) trees unless `overlays` is\n /// set to false.\n enter(pos, side, mode = this.mode) {\n if (!this.buffer)\n return this.yield(this._tree.enter(pos, side, mode));\n return mode & IterMode.ExcludeBuffers ? false : this.enterChild(1, pos, side);\n }\n /// Move to the node's parent node, if this isn't the top node.\n parent() {\n if (!this.buffer)\n return this.yieldNode((this.mode & IterMode.IncludeAnonymous) ? this._tree._parent : this._tree.parent);\n if (this.stack.length)\n return this.yieldBuf(this.stack.pop());\n let parent = (this.mode & IterMode.IncludeAnonymous) ? this.buffer.parent : this.buffer.parent.nextSignificantParent();\n this.buffer = null;\n return this.yieldNode(parent);\n }\n /// @internal\n sibling(dir) {\n if (!this.buffer)\n return !this._tree._parent ? false\n : this.yield(this._tree.index < 0 ? null\n : this._tree._parent.nextChild(this._tree.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode));\n let { buffer } = this.buffer, d = this.stack.length - 1;\n if (dir < 0) {\n let parentStart = d < 0 ? 0 : this.stack[d] + 4;\n if (this.index != parentStart)\n return this.yieldBuf(buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n }\n else {\n let after = buffer.buffer[this.index + 3];\n if (after < (d < 0 ? buffer.buffer.length : buffer.buffer[this.stack[d] + 3]))\n return this.yieldBuf(after);\n }\n return d < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode)) : false;\n }\n /// Move to this node's next sibling, if any.\n nextSibling() { return this.sibling(1); }\n /// Move to this node's previous sibling, if any.\n prevSibling() { return this.sibling(-1); }\n atLastNode(dir) {\n let index, parent, { buffer } = this;\n if (buffer) {\n if (dir > 0) {\n if (this.index < buffer.buffer.buffer.length)\n return false;\n }\n else {\n for (let i = 0; i < this.index; i++)\n if (buffer.buffer.buffer[i + 3] < this.index)\n return false;\n }\n ({ index, parent } = buffer);\n }\n else {\n ({ index, _parent: parent } = this._tree);\n }\n for (; parent; { index, _parent: parent } = parent) {\n if (index > -1)\n for (let i = index + dir, e = dir < 0 ? -1 : parent._tree.children.length; i != e; i += dir) {\n let child = parent._tree.children[i];\n if ((this.mode & IterMode.IncludeAnonymous) ||\n child instanceof TreeBuffer ||\n !child.type.isAnonymous ||\n hasChild(child))\n return false;\n }\n }\n return true;\n }\n move(dir, enter) {\n if (enter && this.enterChild(dir, 0, 4 /* Side.DontCare */))\n return true;\n for (;;) {\n if (this.sibling(dir))\n return true;\n if (this.atLastNode(dir) || !this.parent())\n return false;\n }\n }\n /// Move to the next node in a\n /// [pre-order](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order,_NLR)\n /// traversal, going from a node to its first child or, if the\n /// current node is empty or `enter` is false, its next sibling or\n /// the next sibling of the first parent node that has one.\n next(enter = true) { return this.move(1, enter); }\n /// Move to the next node in a last-to-first pre-order traveral. A\n /// node is followed by its last child or, if it has none, its\n /// previous sibling or the previous sibling of the first parent\n /// node that has one.\n prev(enter = true) { return this.move(-1, enter); }\n /// Move the cursor to the innermost node that covers `pos`. If\n /// `side` is -1, it will enter nodes that end at `pos`. If it is 1,\n /// it will enter nodes that start at `pos`.\n moveTo(pos, side = 0) {\n // Move up to a node that actually holds the position, if possible\n while (this.from == this.to ||\n (side < 1 ? this.from >= pos : this.from > pos) ||\n (side > -1 ? this.to <= pos : this.to < pos))\n if (!this.parent())\n break;\n // Then scan down into child nodes as far as possible\n while (this.enterChild(1, pos, side)) { }\n return this;\n }\n /// Get a [syntax node](#common.SyntaxNode) at the cursor's current\n /// position.\n get node() {\n if (!this.buffer)\n return this._tree;\n let cache = this.bufferNode, result = null, depth = 0;\n if (cache && cache.context == this.buffer) {\n scan: for (let index = this.index, d = this.stack.length; d >= 0;) {\n for (let c = cache; c; c = c._parent)\n if (c.index == index) {\n if (index == this.index)\n return c;\n result = c;\n depth = d + 1;\n break scan;\n }\n index = this.stack[--d];\n }\n }\n for (let i = depth; i < this.stack.length; i++)\n result = new BufferNode(this.buffer, result, this.stack[i]);\n return this.bufferNode = new BufferNode(this.buffer, result, this.index);\n }\n /// Get the [tree](#common.Tree) that represents the current node, if\n /// any. Will return null when the node is in a [tree\n /// buffer](#common.TreeBuffer).\n get tree() {\n return this.buffer ? null : this._tree._tree;\n }\n /// Iterate over the current node and all its descendants, calling\n /// `enter` when entering a node and `leave`, if given, when leaving\n /// one. When `enter` returns `false`, any children of that node are\n /// skipped, and `leave` isn't called for it.\n iterate(enter, leave) {\n for (let depth = 0;;) {\n let mustLeave = false;\n if (this.type.isAnonymous || enter(this) !== false) {\n if (this.firstChild()) {\n depth++;\n continue;\n }\n if (!this.type.isAnonymous)\n mustLeave = true;\n }\n for (;;) {\n if (mustLeave && leave)\n leave(this);\n mustLeave = this.type.isAnonymous;\n if (this.nextSibling())\n break;\n if (!depth)\n return;\n this.parent();\n depth--;\n mustLeave = true;\n }\n }\n }\n /// Test whether the current node matches a given context\u2014a sequence\n /// of direct parent node names. Empty strings in the context array\n /// are treated as wildcards.\n matchContext(context) {\n if (!this.buffer)\n return matchNodeContext(this.node, context);\n let { buffer } = this.buffer, { types } = buffer.set;\n for (let i = context.length - 1, d = this.stack.length - 1; i >= 0; d--) {\n if (d < 0)\n return matchNodeContext(this.node, context, i);\n let type = types[buffer.buffer[this.stack[d]]];\n if (!type.isAnonymous) {\n if (context[i] && context[i] != type.name)\n return false;\n i--;\n }\n }\n return true;\n }\n}\nfunction hasChild(tree) {\n return tree.children.some(ch => ch instanceof TreeBuffer || !ch.type.isAnonymous || hasChild(ch));\n}\nfunction buildTree(data) {\n var _a;\n let { buffer, nodeSet, maxBufferLength = DefaultBufferLength, reused = [], minRepeatType = nodeSet.types.length } = data;\n let cursor = Array.isArray(buffer) ? new FlatBufferCursor(buffer, buffer.length) : buffer;\n let types = nodeSet.types;\n let contextHash = 0, lookAhead = 0;\n function takeNode(parentStart, minPos, children, positions, inRepeat) {\n let { id, start, end, size } = cursor;\n let lookAheadAtStart = lookAhead;\n while (size < 0) {\n cursor.next();\n if (size == -1 /* SpecialRecord.Reuse */) {\n let node = reused[id];\n children.push(node);\n positions.push(start - parentStart);\n return;\n }\n else if (size == -3 /* SpecialRecord.ContextChange */) { // Context change\n contextHash = id;\n return;\n }\n else if (size == -4 /* SpecialRecord.LookAhead */) {\n lookAhead = id;\n return;\n }\n else {\n throw new RangeError(`Unrecognized record size: ${size}`);\n }\n }\n let type = types[id], node, buffer;\n let startPos = start - parentStart;\n if (end - start <= maxBufferLength && (buffer = findBufferSize(cursor.pos - minPos, inRepeat))) {\n // Small enough for a buffer, and no reused nodes inside\n let data = new Uint16Array(buffer.size - buffer.skip);\n let endPos = cursor.pos - buffer.size, index = data.length;\n while (cursor.pos > endPos)\n index = copyToBuffer(buffer.start, data, index);\n node = new TreeBuffer(data, end - buffer.start, nodeSet);\n startPos = buffer.start - parentStart;\n }\n else { // Make it a node\n let endPos = cursor.pos - size;\n cursor.next();\n let localChildren = [], localPositions = [];\n let localInRepeat = id >= minRepeatType ? id : -1;\n let lastGroup = 0, lastEnd = end;\n while (cursor.pos > endPos) {\n if (localInRepeat >= 0 && cursor.id == localInRepeat && cursor.size >= 0) {\n if (cursor.end <= lastEnd - maxBufferLength) {\n makeRepeatLeaf(localChildren, localPositions, start, lastGroup, cursor.end, lastEnd, localInRepeat, lookAheadAtStart);\n lastGroup = localChildren.length;\n lastEnd = cursor.end;\n }\n cursor.next();\n }\n else {\n takeNode(start, endPos, localChildren, localPositions, localInRepeat);\n }\n }\n if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length)\n makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart);\n localChildren.reverse();\n localPositions.reverse();\n if (localInRepeat > -1 && lastGroup > 0) {\n let make = makeBalanced(type);\n node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make);\n }\n else {\n node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end);\n }\n }\n children.push(node);\n positions.push(startPos);\n }\n function makeBalanced(type) {\n return (children, positions, length) => {\n let lookAhead = 0, lastI = children.length - 1, last, lookAheadProp;\n if (lastI >= 0 && (last = children[lastI]) instanceof Tree) {\n if (!lastI && last.type == type && last.length == length)\n return last;\n if (lookAheadProp = last.prop(NodeProp.lookAhead))\n lookAhead = positions[lastI] + last.length + lookAheadProp;\n }\n return makeTree(type, children, positions, length, lookAhead);\n };\n }\n function makeRepeatLeaf(children, positions, base, i, from, to, type, lookAhead) {\n let localChildren = [], localPositions = [];\n while (children.length > i) {\n localChildren.push(children.pop());\n localPositions.push(positions.pop() + base - from);\n }\n children.push(makeTree(nodeSet.types[type], localChildren, localPositions, to - from, lookAhead - to));\n positions.push(from - base);\n }\n function makeTree(type, children, positions, length, lookAhead = 0, props) {\n if (contextHash) {\n let pair = [NodeProp.contextHash, contextHash];\n props = props ? [pair].concat(props) : [pair];\n }\n if (lookAhead > 25) {\n let pair = [NodeProp.lookAhead, lookAhead];\n props = props ? [pair].concat(props) : [pair];\n }\n return new Tree(type, children, positions, length, props);\n }\n function findBufferSize(maxSize, inRepeat) {\n // Scan through the buffer to find previous siblings that fit\n // together in a TreeBuffer, and don't contain any reused nodes\n // (which can't be stored in a buffer).\n // If `inRepeat` is > -1, ignore node boundaries of that type for\n // nesting, but make sure the end falls either at the start\n // (`maxSize`) or before such a node.\n let fork = cursor.fork();\n let size = 0, start = 0, skip = 0, minStart = fork.end - maxBufferLength;\n let result = { size: 0, start: 0, skip: 0 };\n scan: for (let minPos = fork.pos - maxSize; fork.pos > minPos;) {\n let nodeSize = fork.size;\n // Pretend nested repeat nodes of the same type don't exist\n if (fork.id == inRepeat && nodeSize >= 0) {\n // Except that we store the current state as a valid return\n // value.\n result.size = size;\n result.start = start;\n result.skip = skip;\n skip += 4;\n size += 4;\n fork.next();\n continue;\n }\n let startPos = fork.pos - nodeSize;\n if (nodeSize < 0 || startPos < minPos || fork.start < minStart)\n break;\n let localSkipped = fork.id >= minRepeatType ? 4 : 0;\n let nodeStart = fork.start;\n fork.next();\n while (fork.pos > startPos) {\n if (fork.size < 0) {\n if (fork.size == -3 /* SpecialRecord.ContextChange */)\n localSkipped += 4;\n else\n break scan;\n }\n else if (fork.id >= minRepeatType) {\n localSkipped += 4;\n }\n fork.next();\n }\n start = nodeStart;\n size += nodeSize;\n skip += localSkipped;\n }\n if (inRepeat < 0 || size == maxSize) {\n result.size = size;\n result.start = start;\n result.skip = skip;\n }\n return result.size > 4 ? result : undefined;\n }\n function copyToBuffer(bufferStart, buffer, index) {\n let { id, start, end, size } = cursor;\n cursor.next();\n if (size >= 0 && id < minRepeatType) {\n let startIndex = index;\n if (size > 4) {\n let endPos = cursor.pos - (size - 4);\n while (cursor.pos > endPos)\n index = copyToBuffer(bufferStart, buffer, index);\n }\n buffer[--index] = startIndex;\n buffer[--index] = end - bufferStart;\n buffer[--index] = start - bufferStart;\n buffer[--index] = id;\n }\n else if (size == -3 /* SpecialRecord.ContextChange */) {\n contextHash = id;\n }\n else if (size == -4 /* SpecialRecord.LookAhead */) {\n lookAhead = id;\n }\n return index;\n }\n let children = [], positions = [];\n while (cursor.pos > 0)\n takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1);\n let length = (_a = data.length) !== null && _a !== void 0 ? _a : (children.length ? positions[0] + children[0].length : 0);\n return new Tree(types[data.topID], children.reverse(), positions.reverse(), length);\n}\nconst nodeSizeCache = new WeakMap;\nfunction nodeSize(balanceType, node) {\n if (!balanceType.isAnonymous || node instanceof TreeBuffer || node.type != balanceType)\n return 1;\n let size = nodeSizeCache.get(node);\n if (size == null) {\n size = 1;\n for (let child of node.children) {\n if (child.type != balanceType || !(child instanceof Tree)) {\n size = 1;\n break;\n }\n size += nodeSize(balanceType, child);\n }\n nodeSizeCache.set(node, size);\n }\n return size;\n}\nfunction balanceRange(\n// The type the balanced tree's inner nodes.\nbalanceType, \n// The direct children and their positions\nchildren, positions, \n// The index range in children/positions to use\nfrom, to, \n// The start position of the nodes, relative to their parent.\nstart, \n// Length of the outer node\nlength, \n// Function to build the top node of the balanced tree\nmkTop, \n// Function to build internal nodes for the balanced tree\nmkTree) {\n let total = 0;\n for (let i = from; i < to; i++)\n total += nodeSize(balanceType, children[i]);\n let maxChild = Math.ceil((total * 1.5) / 8 /* Balance.BranchFactor */);\n let localChildren = [], localPositions = [];\n function divide(children, positions, from, to, offset) {\n for (let i = from; i < to;) {\n let groupFrom = i, groupStart = positions[i], groupSize = nodeSize(balanceType, children[i]);\n i++;\n for (; i < to; i++) {\n let nextSize = nodeSize(balanceType, children[i]);\n if (groupSize + nextSize >= maxChild)\n break;\n groupSize += nextSize;\n }\n if (i == groupFrom + 1) {\n if (groupSize > maxChild) {\n let only = children[groupFrom]; // Only trees can have a size > 1\n divide(only.children, only.positions, 0, only.children.length, positions[groupFrom] + offset);\n continue;\n }\n localChildren.push(children[groupFrom]);\n }\n else {\n let length = positions[i - 1] + children[i - 1].length - groupStart;\n localChildren.push(balanceRange(balanceType, children, positions, groupFrom, i, groupStart, length, null, mkTree));\n }\n localPositions.push(groupStart + offset - start);\n }\n }\n divide(children, positions, from, to, 0);\n return (mkTop || mkTree)(localChildren, localPositions, length);\n}\n/// Provides a way to associate values with pieces of trees. As long\n/// as that part of the tree is reused, the associated values can be\n/// retrieved from an updated tree.\nclass NodeWeakMap {\n constructor() {\n this.map = new WeakMap();\n }\n setBuffer(buffer, index, value) {\n let inner = this.map.get(buffer);\n if (!inner)\n this.map.set(buffer, inner = new Map);\n inner.set(index, value);\n }\n getBuffer(buffer, index) {\n let inner = this.map.get(buffer);\n return inner && inner.get(index);\n }\n /// Set the value for this syntax node.\n set(node, value) {\n if (node instanceof BufferNode)\n this.setBuffer(node.context.buffer, node.index, value);\n else if (node instanceof TreeNode)\n this.map.set(node.tree, value);\n }\n /// Retrieve value for this syntax node, if it exists in the map.\n get(node) {\n return node instanceof BufferNode ? this.getBuffer(node.context.buffer, node.index)\n : node instanceof TreeNode ? this.map.get(node.tree) : undefined;\n }\n /// Set the value for the node that a cursor currently points to.\n cursorSet(cursor, value) {\n if (cursor.buffer)\n this.setBuffer(cursor.buffer.buffer, cursor.index, value);\n else\n this.map.set(cursor.tree, value);\n }\n /// Retrieve the value for the node that a cursor currently points\n /// to.\n cursorGet(cursor) {\n return cursor.buffer ? this.getBuffer(cursor.buffer.buffer, cursor.index) : this.map.get(cursor.tree);\n }\n}\n\n/// Tree fragments are used during [incremental\n/// parsing](#common.Parser.startParse) to track parts of old trees\n/// that can be reused in a new parse. An array of fragments is used\n/// to track regions of an old tree whose nodes might be reused in new\n/// parses. Use the static\n/// [`applyChanges`](#common.TreeFragment^applyChanges) method to\n/// update fragments for document changes.\nclass TreeFragment {\n /// Construct a tree fragment. You'll usually want to use\n /// [`addTree`](#common.TreeFragment^addTree) and\n /// [`applyChanges`](#common.TreeFragment^applyChanges) instead of\n /// calling this directly.\n constructor(\n /// The start of the unchanged range pointed to by this fragment.\n /// This refers to an offset in the _updated_ document (as opposed\n /// to the original tree).\n from, \n /// The end of the unchanged range.\n to, \n /// The tree that this fragment is based on.\n tree, \n /// The offset between the fragment's tree and the document that\n /// this fragment can be used against. Add this when going from\n /// document to tree positions, subtract it to go from tree to\n /// document positions.\n offset, openStart = false, openEnd = false) {\n this.from = from;\n this.to = to;\n this.tree = tree;\n this.offset = offset;\n this.open = (openStart ? 1 /* Open.Start */ : 0) | (openEnd ? 2 /* Open.End */ : 0);\n }\n /// Whether the start of the fragment represents the start of a\n /// parse, or the end of a change. (In the second case, it may not\n /// be safe to reuse some nodes at the start, depending on the\n /// parsing algorithm.)\n get openStart() { return (this.open & 1 /* Open.Start */) > 0; }\n /// Whether the end of the fragment represents the end of a\n /// full-document parse, or the start of a change.\n get openEnd() { return (this.open & 2 /* Open.End */) > 0; }\n /// Create a set of fragments from a freshly parsed tree, or update\n /// an existing set of fragments by replacing the ones that overlap\n /// with a tree with content from the new tree. When `partial` is\n /// true, the parse is treated as incomplete, and the resulting\n /// fragment has [`openEnd`](#common.TreeFragment.openEnd) set to\n /// true.\n static addTree(tree, fragments = [], partial = false) {\n let result = [new TreeFragment(0, tree.length, tree, 0, false, partial)];\n for (let f of fragments)\n if (f.to > tree.length)\n result.push(f);\n return result;\n }\n /// Apply a set of edits to an array of fragments, removing or\n /// splitting fragments as necessary to remove edited ranges, and\n /// adjusting offsets for fragments that moved.\n static applyChanges(fragments, changes, minGap = 128) {\n if (!changes.length)\n return fragments;\n let result = [];\n let fI = 1, nextF = fragments.length ? fragments[0] : null;\n for (let cI = 0, pos = 0, off = 0;; cI++) {\n let nextC = cI < changes.length ? changes[cI] : null;\n let nextPos = nextC ? nextC.fromA : 1e9;\n if (nextPos - pos >= minGap)\n while (nextF && nextF.from < nextPos) {\n let cut = nextF;\n if (pos >= cut.from || nextPos <= cut.to || off) {\n let fFrom = Math.max(cut.from, pos) - off, fTo = Math.min(cut.to, nextPos) - off;\n cut = fFrom >= fTo ? null : new TreeFragment(fFrom, fTo, cut.tree, cut.offset + off, cI > 0, !!nextC);\n }\n if (cut)\n result.push(cut);\n if (nextF.to > nextPos)\n break;\n nextF = fI < fragments.length ? fragments[fI++] : null;\n }\n if (!nextC)\n break;\n pos = nextC.toA;\n off = nextC.toA - nextC.toB;\n }\n return result;\n }\n}\n/// A superclass that parsers should extend.\nclass Parser {\n /// Start a parse, returning a [partial parse](#common.PartialParse)\n /// object. [`fragments`](#common.TreeFragment) can be passed in to\n /// make the parse incremental.\n ///\n /// By default, the entire input is parsed. You can pass `ranges`,\n /// which should be a sorted array of non-empty, non-overlapping\n /// ranges, to parse only those ranges. The tree returned in that\n /// case will start at `ranges[0].from`.\n startParse(input, fragments, ranges) {\n if (typeof input == \"string\")\n input = new StringInput(input);\n ranges = !ranges ? [new Range(0, input.length)] : ranges.length ? ranges.map(r => new Range(r.from, r.to)) : [new Range(0, 0)];\n return this.createParse(input, fragments || [], ranges);\n }\n /// Run a full parse, returning the resulting tree.\n parse(input, fragments, ranges) {\n let parse = this.startParse(input, fragments, ranges);\n for (;;) {\n let done = parse.advance();\n if (done)\n return done;\n }\n }\n}\nclass StringInput {\n constructor(string) {\n this.string = string;\n }\n get length() { return this.string.length; }\n chunk(from) { return this.string.slice(from); }\n get lineChunks() { return false; }\n read(from, to) { return this.string.slice(from, to); }\n}\n\n/// Create a parse wrapper that, after the inner parse completes,\n/// scans its tree for mixed language regions with the `nest`\n/// function, runs the resulting [inner parses](#common.NestedParse),\n/// and then [mounts](#common.NodeProp^mounted) their results onto the\n/// tree.\nfunction parseMixed(nest) {\n return (parse, input, fragments, ranges) => new MixedParse(parse, nest, input, fragments, ranges);\n}\nclass InnerParse {\n constructor(parser, parse, overlay, target, ranges) {\n this.parser = parser;\n this.parse = parse;\n this.overlay = overlay;\n this.target = target;\n this.ranges = ranges;\n if (!ranges.length || ranges.some(r => r.from >= r.to))\n throw new RangeError(\"Invalid inner parse ranges given: \" + JSON.stringify(ranges));\n }\n}\nclass ActiveOverlay {\n constructor(parser, predicate, mounts, index, start, target, prev) {\n this.parser = parser;\n this.predicate = predicate;\n this.mounts = mounts;\n this.index = index;\n this.start = start;\n this.target = target;\n this.prev = prev;\n this.depth = 0;\n this.ranges = [];\n }\n}\nconst stoppedInner = new NodeProp({ perNode: true });\nclass MixedParse {\n constructor(base, nest, input, fragments, ranges) {\n this.nest = nest;\n this.input = input;\n this.fragments = fragments;\n this.ranges = ranges;\n this.inner = [];\n this.innerDone = 0;\n this.baseTree = null;\n this.stoppedAt = null;\n this.baseParse = base;\n }\n advance() {\n if (this.baseParse) {\n let done = this.baseParse.advance();\n if (!done)\n return null;\n this.baseParse = null;\n this.baseTree = done;\n this.startInner();\n if (this.stoppedAt != null)\n for (let inner of this.inner)\n inner.parse.stopAt(this.stoppedAt);\n }\n if (this.innerDone == this.inner.length) {\n let result = this.baseTree;\n if (this.stoppedAt != null)\n result = new Tree(result.type, result.children, result.positions, result.length, result.propValues.concat([[stoppedInner, this.stoppedAt]]));\n return result;\n }\n let inner = this.inner[this.innerDone], done = inner.parse.advance();\n if (done) {\n this.innerDone++;\n // This is a somewhat dodgy but super helpful hack where we\n // patch up nodes created by the inner parse (and thus\n // presumably not aliased anywhere else) to hold the information\n // about the inner parse.\n let props = Object.assign(Object.create(null), inner.target.props);\n props[NodeProp.mounted.id] = new MountedTree(done, inner.overlay, inner.parser);\n inner.target.props = props;\n }\n return null;\n }\n get parsedPos() {\n if (this.baseParse)\n return 0;\n let pos = this.input.length;\n for (let i = this.innerDone; i < this.inner.length; i++) {\n if (this.inner[i].ranges[0].from < pos)\n pos = Math.min(pos, this.inner[i].parse.parsedPos);\n }\n return pos;\n }\n stopAt(pos) {\n this.stoppedAt = pos;\n if (this.baseParse)\n this.baseParse.stopAt(pos);\n else\n for (let i = this.innerDone; i < this.inner.length; i++)\n this.inner[i].parse.stopAt(pos);\n }\n startInner() {\n let fragmentCursor = new FragmentCursor(this.fragments);\n let overlay = null;\n let covered = null;\n let cursor = new TreeCursor(new TreeNode(this.baseTree, this.ranges[0].from, 0, null), IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n scan: for (let nest, isCovered; this.stoppedAt == null || cursor.from < this.stoppedAt;) {\n let enter = true, range;\n if (fragmentCursor.hasNode(cursor)) {\n if (overlay) {\n let match = overlay.mounts.find(m => m.frag.from <= cursor.from && m.frag.to >= cursor.to && m.mount.overlay);\n if (match)\n for (let r of match.mount.overlay) {\n let from = r.from + match.pos, to = r.to + match.pos;\n if (from >= cursor.from && to <= cursor.to && !overlay.ranges.some(r => r.from < to && r.to > from))\n overlay.ranges.push({ from, to });\n }\n }\n enter = false;\n }\n else if (covered && (isCovered = checkCover(covered.ranges, cursor.from, cursor.to))) {\n enter = isCovered != 2 /* Cover.Full */;\n }\n else if (!cursor.type.isAnonymous && cursor.from < cursor.to && (nest = this.nest(cursor, this.input))) {\n if (!cursor.tree)\n materialize(cursor);\n let oldMounts = fragmentCursor.findMounts(cursor.from, nest.parser);\n if (typeof nest.overlay == \"function\") {\n overlay = new ActiveOverlay(nest.parser, nest.overlay, oldMounts, this.inner.length, cursor.from, cursor.tree, overlay);\n }\n else {\n let ranges = punchRanges(this.ranges, nest.overlay || [new Range(cursor.from, cursor.to)]);\n if (ranges.length)\n this.inner.push(new InnerParse(nest.parser, nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, cursor.tree, ranges));\n if (!nest.overlay)\n enter = false;\n else if (ranges.length)\n covered = { ranges, depth: 0, prev: covered };\n }\n }\n else if (overlay && (range = overlay.predicate(cursor))) {\n if (range === true)\n range = new Range(cursor.from, cursor.to);\n if (range.from < range.to)\n overlay.ranges.push(range);\n }\n if (enter && cursor.firstChild()) {\n if (overlay)\n overlay.depth++;\n if (covered)\n covered.depth++;\n }\n else {\n for (;;) {\n if (cursor.nextSibling())\n break;\n if (!cursor.parent())\n break scan;\n if (overlay && !--overlay.depth) {\n let ranges = punchRanges(this.ranges, overlay.ranges);\n if (ranges.length)\n this.inner.splice(overlay.index, 0, new InnerParse(overlay.parser, overlay.parser.startParse(this.input, enterFragments(overlay.mounts, ranges), ranges), overlay.ranges.map(r => new Range(r.from - overlay.start, r.to - overlay.start)), overlay.target, ranges));\n overlay = overlay.prev;\n }\n if (covered && !--covered.depth)\n covered = covered.prev;\n }\n }\n }\n }\n}\nfunction checkCover(covered, from, to) {\n for (let range of covered) {\n if (range.from >= to)\n break;\n if (range.to > from)\n return range.from <= from && range.to >= to ? 2 /* Cover.Full */ : 1 /* Cover.Partial */;\n }\n return 0 /* Cover.None */;\n}\n// Take a piece of buffer and convert it into a stand-alone\n// TreeBuffer.\nfunction sliceBuf(buf, startI, endI, nodes, positions, off) {\n if (startI < endI) {\n let from = buf.buffer[startI + 1];\n nodes.push(buf.slice(startI, endI, from));\n positions.push(from - off);\n }\n}\n// This function takes a node that's in a buffer, and converts it, and\n// its parent buffer nodes, into a Tree. This is again acting on the\n// assumption that the trees and buffers have been constructed by the\n// parse that was ran via the mix parser, and thus aren't shared with\n// any other code, making violations of the immutability safe.\nfunction materialize(cursor) {\n let { node } = cursor, depth = 0;\n // Scan up to the nearest tree\n do {\n cursor.parent();\n depth++;\n } while (!cursor.tree);\n // Find the index of the buffer in that tree\n let i = 0, base = cursor.tree, off = 0;\n for (;; i++) {\n off = base.positions[i] + cursor.from;\n if (off <= node.from && off + base.children[i].length >= node.to)\n break;\n }\n let buf = base.children[i], b = buf.buffer;\n // Split a level in the buffer, putting the nodes before and after\n // the child that contains `node` into new buffers.\n function split(startI, endI, type, innerOffset, length) {\n let i = startI;\n while (b[i + 2] + off <= node.from)\n i = b[i + 3];\n let children = [], positions = [];\n sliceBuf(buf, startI, i, children, positions, innerOffset);\n let from = b[i + 1], to = b[i + 2];\n let isTarget = from + off == node.from && to + off == node.to && b[i] == node.type.id;\n children.push(isTarget ? node.toTree() : split(i + 4, b[i + 3], buf.set.types[b[i]], from, to - from));\n positions.push(from - innerOffset);\n sliceBuf(buf, b[i + 3], endI, children, positions, innerOffset);\n return new Tree(type, children, positions, length);\n }\n base.children[i] = split(0, b.length, NodeType.none, 0, buf.length);\n // Move the cursor back to the target node\n for (let d = 0; d <= depth; d++)\n cursor.childAfter(node.from);\n}\nclass StructureCursor {\n constructor(root, offset) {\n this.offset = offset;\n this.done = false;\n this.cursor = root.cursor(IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n }\n // Move to the first node (in pre-order) that starts at or after `pos`.\n moveTo(pos) {\n let { cursor } = this, p = pos - this.offset;\n while (!this.done && cursor.from < p) {\n if (cursor.to >= pos && cursor.enter(p, 1, IterMode.IgnoreOverlays | IterMode.ExcludeBuffers)) ;\n else if (!cursor.next(false))\n this.done = true;\n }\n }\n hasNode(cursor) {\n this.moveTo(cursor.from);\n if (!this.done && this.cursor.from + this.offset == cursor.from && this.cursor.tree) {\n for (let tree = this.cursor.tree;;) {\n if (tree == cursor.tree)\n return true;\n if (tree.children.length && tree.positions[0] == 0 && tree.children[0] instanceof Tree)\n tree = tree.children[0];\n else\n break;\n }\n }\n return false;\n }\n}\nclass FragmentCursor {\n constructor(fragments) {\n var _a;\n this.fragments = fragments;\n this.curTo = 0;\n this.fragI = 0;\n if (fragments.length) {\n let first = this.curFrag = fragments[0];\n this.curTo = (_a = first.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : first.to;\n this.inner = new StructureCursor(first.tree, -first.offset);\n }\n else {\n this.curFrag = this.inner = null;\n }\n }\n hasNode(node) {\n while (this.curFrag && node.from >= this.curTo)\n this.nextFrag();\n return this.curFrag && this.curFrag.from <= node.from && this.curTo >= node.to && this.inner.hasNode(node);\n }\n nextFrag() {\n var _a;\n this.fragI++;\n if (this.fragI == this.fragments.length) {\n this.curFrag = this.inner = null;\n }\n else {\n let frag = this.curFrag = this.fragments[this.fragI];\n this.curTo = (_a = frag.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : frag.to;\n this.inner = new StructureCursor(frag.tree, -frag.offset);\n }\n }\n findMounts(pos, parser) {\n var _a;\n let result = [];\n if (this.inner) {\n this.inner.cursor.moveTo(pos, 1);\n for (let pos = this.inner.cursor.node; pos; pos = pos.parent) {\n let mount = (_a = pos.tree) === null || _a === void 0 ? void 0 : _a.prop(NodeProp.mounted);\n if (mount && mount.parser == parser) {\n for (let i = this.fragI; i < this.fragments.length; i++) {\n let frag = this.fragments[i];\n if (frag.from >= pos.to)\n break;\n if (frag.tree == this.curFrag.tree)\n result.push({\n frag,\n pos: pos.from - frag.offset,\n mount\n });\n }\n }\n }\n }\n return result;\n }\n}\nfunction punchRanges(outer, ranges) {\n let copy = null, current = ranges;\n for (let i = 1, j = 0; i < outer.length; i++) {\n let gapFrom = outer[i - 1].to, gapTo = outer[i].from;\n for (; j < current.length; j++) {\n let r = current[j];\n if (r.from >= gapTo)\n break;\n if (r.to <= gapFrom)\n continue;\n if (!copy)\n current = copy = ranges.slice();\n if (r.from < gapFrom) {\n copy[j] = new Range(r.from, gapFrom);\n if (r.to > gapTo)\n copy.splice(j + 1, 0, new Range(gapTo, r.to));\n }\n else if (r.to > gapTo) {\n copy[j--] = new Range(gapTo, r.to);\n }\n else {\n copy.splice(j--, 1);\n }\n }\n }\n return current;\n}\nfunction findCoverChanges(a, b, from, to) {\n let iA = 0, iB = 0, inA = false, inB = false, pos = -1e9;\n let result = [];\n for (;;) {\n let nextA = iA == a.length ? 1e9 : inA ? a[iA].to : a[iA].from;\n let nextB = iB == b.length ? 1e9 : inB ? b[iB].to : b[iB].from;\n if (inA != inB) {\n let start = Math.max(pos, from), end = Math.min(nextA, nextB, to);\n if (start < end)\n result.push(new Range(start, end));\n }\n pos = Math.min(nextA, nextB);\n if (pos == 1e9)\n break;\n if (nextA == pos) {\n if (!inA)\n inA = true;\n else {\n inA = false;\n iA++;\n }\n }\n if (nextB == pos) {\n if (!inB)\n inB = true;\n else {\n inB = false;\n iB++;\n }\n }\n }\n return result;\n}\n// Given a number of fragments for the outer tree, and a set of ranges\n// to parse, find fragments for inner trees mounted around those\n// ranges, if any.\nfunction enterFragments(mounts, ranges) {\n let result = [];\n for (let { pos, mount, frag } of mounts) {\n let startPos = pos + (mount.overlay ? mount.overlay[0].from : 0), endPos = startPos + mount.tree.length;\n let from = Math.max(frag.from, startPos), to = Math.min(frag.to, endPos);\n if (mount.overlay) {\n let overlay = mount.overlay.map(r => new Range(r.from + pos, r.to + pos));\n let changes = findCoverChanges(ranges, overlay, from, to);\n for (let i = 0, pos = from;; i++) {\n let last = i == changes.length, end = last ? to : changes[i].from;\n if (end > pos)\n result.push(new TreeFragment(pos, end, mount.tree, -startPos, frag.from >= pos || frag.openStart, frag.to <= end || frag.openEnd));\n if (last)\n break;\n pos = changes[i].to;\n }\n }\n else {\n result.push(new TreeFragment(from, to, mount.tree, -startPos, frag.from >= startPos || frag.openStart, frag.to <= endPos || frag.openEnd));\n }\n }\n return result;\n}\n\nexport { DefaultBufferLength, IterMode, MountedTree, NodeProp, NodeSet, NodeType, NodeWeakMap, Parser, Tree, TreeBuffer, TreeCursor, TreeFragment, parseMixed };\n", "import { Parser, NodeProp, NodeSet, NodeType, DefaultBufferLength, Tree, IterMode } from '@lezer/common';\n\n/// A parse stack. These are used internally by the parser to track\n/// parsing progress. They also provide some properties and methods\n/// that external code such as a tokenizer can use to get information\n/// about the parse state.\nclass Stack {\n /// @internal\n constructor(\n /// The parse that this stack is part of @internal\n p, \n /// Holds state, input pos, buffer index triplets for all but the\n /// top state @internal\n stack, \n /// The current parse state @internal\n state, \n // The position at which the next reduce should take place. This\n // can be less than `this.pos` when skipped expressions have been\n // added to the stack (which should be moved outside of the next\n // reduction)\n /// @internal\n reducePos, \n /// The input position up to which this stack has parsed.\n pos, \n /// The dynamic score of the stack, including dynamic precedence\n /// and error-recovery penalties\n /// @internal\n score, \n // The output buffer. Holds (type, start, end, size) quads\n // representing nodes created by the parser, where `size` is\n // amount of buffer array entries covered by this node.\n /// @internal\n buffer, \n // The base offset of the buffer. When stacks are split, the split\n // instance shared the buffer history with its parent up to\n // `bufferBase`, which is the absolute offset (including the\n // offset of previous splits) into the buffer at which this stack\n // starts writing.\n /// @internal\n bufferBase, \n /// @internal\n curContext, \n /// @internal\n lookAhead = 0, \n // A parent stack from which this was split off, if any. This is\n // set up so that it always points to a stack that has some\n // additional buffer content, never to a stack with an equal\n // `bufferBase`.\n /// @internal\n parent) {\n this.p = p;\n this.stack = stack;\n this.state = state;\n this.reducePos = reducePos;\n this.pos = pos;\n this.score = score;\n this.buffer = buffer;\n this.bufferBase = bufferBase;\n this.curContext = curContext;\n this.lookAhead = lookAhead;\n this.parent = parent;\n }\n /// @internal\n toString() {\n return `[${this.stack.filter((_, i) => i % 3 == 0).concat(this.state)}]@${this.pos}${this.score ? \"!\" + this.score : \"\"}`;\n }\n // Start an empty stack\n /// @internal\n static start(p, state, pos = 0) {\n let cx = p.parser.context;\n return new Stack(p, [], state, pos, pos, 0, [], 0, cx ? new StackContext(cx, cx.start) : null, 0, null);\n }\n /// The stack's current [context](#lr.ContextTracker) value, if\n /// any. Its type will depend on the context tracker's type\n /// parameter, or it will be `null` if there is no context\n /// tracker.\n get context() { return this.curContext ? this.curContext.context : null; }\n // Push a state onto the stack, tracking its start position as well\n // as the buffer base at that point.\n /// @internal\n pushState(state, start) {\n this.stack.push(this.state, start, this.bufferBase + this.buffer.length);\n this.state = state;\n }\n // Apply a reduce action\n /// @internal\n reduce(action) {\n var _a;\n let depth = action >> 19 /* Action.ReduceDepthShift */, type = action & 65535 /* Action.ValueMask */;\n let { parser } = this.p;\n let dPrec = parser.dynamicPrecedence(type);\n if (dPrec)\n this.score += dPrec;\n if (depth == 0) {\n this.pushState(parser.getGoto(this.state, type, true), this.reducePos);\n // Zero-depth reductions are a special case\u2014they add stuff to\n // the stack without popping anything off.\n if (type < parser.minRepeatTerm)\n this.storeNode(type, this.reducePos, this.reducePos, 4, true);\n this.reduceContext(type, this.reducePos);\n return;\n }\n // Find the base index into `this.stack`, content after which will\n // be dropped. Note that with `StayFlag` reductions we need to\n // consume two extra frames (the dummy parent node for the skipped\n // expression and the state that we'll be staying in, which should\n // be moved to `this.state`).\n let base = this.stack.length - ((depth - 1) * 3) - (action & 262144 /* Action.StayFlag */ ? 6 : 0);\n let start = base ? this.stack[base - 2] : this.p.ranges[0].from, size = this.reducePos - start;\n // This is a kludge to try and detect overly deep left-associative\n // trees, which will not increase the parse stack depth and thus\n // won't be caught by the regular stack-depth limit check.\n if (size >= 2000 /* Recover.MinBigReduction */ && !((_a = this.p.parser.nodeSet.types[type]) === null || _a === void 0 ? void 0 : _a.isAnonymous)) {\n if (start == this.p.lastBigReductionStart) {\n this.p.bigReductionCount++;\n this.p.lastBigReductionSize = size;\n }\n else if (this.p.lastBigReductionSize < size) {\n this.p.bigReductionCount = 1;\n this.p.lastBigReductionStart = start;\n this.p.lastBigReductionSize = size;\n }\n }\n let bufferBase = base ? this.stack[base - 1] : 0, count = this.bufferBase + this.buffer.length - bufferBase;\n // Store normal terms or `R -> R R` repeat reductions\n if (type < parser.minRepeatTerm || (action & 131072 /* Action.RepeatFlag */)) {\n let pos = parser.stateFlag(this.state, 1 /* StateFlag.Skipped */) ? this.pos : this.reducePos;\n this.storeNode(type, start, pos, count + 4, true);\n }\n if (action & 262144 /* Action.StayFlag */) {\n this.state = this.stack[base];\n }\n else {\n let baseStateID = this.stack[base - 3];\n this.state = parser.getGoto(baseStateID, type, true);\n }\n while (this.stack.length > base)\n this.stack.pop();\n this.reduceContext(type, start);\n }\n // Shift a value into the buffer\n /// @internal\n storeNode(term, start, end, size = 4, isReduce = false) {\n if (term == 0 /* Term.Err */ &&\n (!this.stack.length || this.stack[this.stack.length - 1] < this.buffer.length + this.bufferBase)) {\n // Try to omit/merge adjacent error nodes\n let cur = this, top = this.buffer.length;\n if (top == 0 && cur.parent) {\n top = cur.bufferBase - cur.parent.bufferBase;\n cur = cur.parent;\n }\n if (top > 0 && cur.buffer[top - 4] == 0 /* Term.Err */ && cur.buffer[top - 1] > -1) {\n if (start == end)\n return;\n if (cur.buffer[top - 2] >= start) {\n cur.buffer[top - 2] = end;\n return;\n }\n }\n }\n if (!isReduce || this.pos == end) { // Simple case, just append\n this.buffer.push(term, start, end, size);\n }\n else { // There may be skipped nodes that have to be moved forward\n let index = this.buffer.length;\n if (index > 0 && this.buffer[index - 4] != 0 /* Term.Err */)\n while (index > 0 && this.buffer[index - 2] > end) {\n // Move this record forward\n this.buffer[index] = this.buffer[index - 4];\n this.buffer[index + 1] = this.buffer[index - 3];\n this.buffer[index + 2] = this.buffer[index - 2];\n this.buffer[index + 3] = this.buffer[index - 1];\n index -= 4;\n if (size > 4)\n size -= 4;\n }\n this.buffer[index] = term;\n this.buffer[index + 1] = start;\n this.buffer[index + 2] = end;\n this.buffer[index + 3] = size;\n }\n }\n // Apply a shift action\n /// @internal\n shift(action, next, nextEnd) {\n let start = this.pos;\n if (action & 131072 /* Action.GotoFlag */) {\n this.pushState(action & 65535 /* Action.ValueMask */, this.pos);\n }\n else if ((action & 262144 /* Action.StayFlag */) == 0) { // Regular shift\n let nextState = action, { parser } = this.p;\n if (nextEnd > this.pos || next <= parser.maxNode) {\n this.pos = nextEnd;\n if (!parser.stateFlag(nextState, 1 /* StateFlag.Skipped */))\n this.reducePos = nextEnd;\n }\n this.pushState(nextState, start);\n this.shiftContext(next, start);\n if (next <= parser.maxNode)\n this.buffer.push(next, start, nextEnd, 4);\n }\n else { // Shift-and-stay, which means this is a skipped token\n this.pos = nextEnd;\n this.shiftContext(next, start);\n if (next <= this.p.parser.maxNode)\n this.buffer.push(next, start, nextEnd, 4);\n }\n }\n // Apply an action\n /// @internal\n apply(action, next, nextEnd) {\n if (action & 65536 /* Action.ReduceFlag */)\n this.reduce(action);\n else\n this.shift(action, next, nextEnd);\n }\n // Add a prebuilt (reused) node into the buffer.\n /// @internal\n useNode(value, next) {\n let index = this.p.reused.length - 1;\n if (index < 0 || this.p.reused[index] != value) {\n this.p.reused.push(value);\n index++;\n }\n let start = this.pos;\n this.reducePos = this.pos = start + value.length;\n this.pushState(next, start);\n this.buffer.push(index, start, this.reducePos, -1 /* size == -1 means this is a reused value */);\n if (this.curContext)\n this.updateContext(this.curContext.tracker.reuse(this.curContext.context, value, this, this.p.stream.reset(this.pos - value.length)));\n }\n // Split the stack. Due to the buffer sharing and the fact\n // that `this.stack` tends to stay quite shallow, this isn't very\n // expensive.\n /// @internal\n split() {\n let parent = this;\n let off = parent.buffer.length;\n // Because the top of the buffer (after this.pos) may be mutated\n // to reorder reductions and skipped tokens, and shared buffers\n // should be immutable, this copies any outstanding skipped tokens\n // to the new buffer, and puts the base pointer before them.\n while (off > 0 && parent.buffer[off - 2] > parent.reducePos)\n off -= 4;\n let buffer = parent.buffer.slice(off), base = parent.bufferBase + off;\n // Make sure parent points to an actual parent with content, if there is such a parent.\n while (parent && base == parent.bufferBase)\n parent = parent.parent;\n return new Stack(this.p, this.stack.slice(), this.state, this.reducePos, this.pos, this.score, buffer, base, this.curContext, this.lookAhead, parent);\n }\n // Try to recover from an error by 'deleting' (ignoring) one token.\n /// @internal\n recoverByDelete(next, nextEnd) {\n let isNode = next <= this.p.parser.maxNode;\n if (isNode)\n this.storeNode(next, this.pos, nextEnd, 4);\n this.storeNode(0 /* Term.Err */, this.pos, nextEnd, isNode ? 8 : 4);\n this.pos = this.reducePos = nextEnd;\n this.score -= 190 /* Recover.Delete */;\n }\n /// Check if the given term would be able to be shifted (optionally\n /// after some reductions) on this stack. This can be useful for\n /// external tokenizers that want to make sure they only provide a\n /// given token when it applies.\n canShift(term) {\n for (let sim = new SimulatedStack(this);;) {\n let action = this.p.parser.stateSlot(sim.state, 4 /* ParseState.DefaultReduce */) || this.p.parser.hasAction(sim.state, term);\n if (action == 0)\n return false;\n if ((action & 65536 /* Action.ReduceFlag */) == 0)\n return true;\n sim.reduce(action);\n }\n }\n // Apply up to Recover.MaxNext recovery actions that conceptually\n // inserts some missing token or rule.\n /// @internal\n recoverByInsert(next) {\n if (this.stack.length >= 300 /* Recover.MaxInsertStackDepth */)\n return [];\n let nextStates = this.p.parser.nextStates(this.state);\n if (nextStates.length > 4 /* Recover.MaxNext */ << 1 || this.stack.length >= 120 /* Recover.DampenInsertStackDepth */) {\n let best = [];\n for (let i = 0, s; i < nextStates.length; i += 2) {\n if ((s = nextStates[i + 1]) != this.state && this.p.parser.hasAction(s, next))\n best.push(nextStates[i], s);\n }\n if (this.stack.length < 120 /* Recover.DampenInsertStackDepth */)\n for (let i = 0; best.length < 4 /* Recover.MaxNext */ << 1 && i < nextStates.length; i += 2) {\n let s = nextStates[i + 1];\n if (!best.some((v, i) => (i & 1) && v == s))\n best.push(nextStates[i], s);\n }\n nextStates = best;\n }\n let result = [];\n for (let i = 0; i < nextStates.length && result.length < 4 /* Recover.MaxNext */; i += 2) {\n let s = nextStates[i + 1];\n if (s == this.state)\n continue;\n let stack = this.split();\n stack.pushState(s, this.pos);\n stack.storeNode(0 /* Term.Err */, stack.pos, stack.pos, 4, true);\n stack.shiftContext(nextStates[i], this.pos);\n stack.score -= 200 /* Recover.Insert */;\n result.push(stack);\n }\n return result;\n }\n // Force a reduce, if possible. Return false if that can't\n // be done.\n /// @internal\n forceReduce() {\n let { parser } = this.p;\n let reduce = parser.stateSlot(this.state, 5 /* ParseState.ForcedReduce */);\n if ((reduce & 65536 /* Action.ReduceFlag */) == 0)\n return false;\n if (!parser.validAction(this.state, reduce)) {\n let depth = reduce >> 19 /* Action.ReduceDepthShift */, term = reduce & 65535 /* Action.ValueMask */;\n let target = this.stack.length - depth * 3;\n if (target < 0 || parser.getGoto(this.stack[target], term, false) < 0) {\n let backup = this.findForcedReduction();\n if (backup == null)\n return false;\n reduce = backup;\n }\n this.storeNode(0 /* Term.Err */, this.pos, this.pos, 4, true);\n this.score -= 100 /* Recover.Reduce */;\n }\n this.reducePos = this.pos;\n this.reduce(reduce);\n return true;\n }\n /// Try to scan through the automaton to find some kind of reduction\n /// that can be applied. Used when the regular ForcedReduce field\n /// isn't a valid action. @internal\n findForcedReduction() {\n let { parser } = this.p, seen = [];\n let explore = (state, depth) => {\n if (seen.includes(state))\n return;\n seen.push(state);\n return parser.allActions(state, (action) => {\n if (action & (262144 /* Action.StayFlag */ | 131072 /* Action.GotoFlag */)) ;\n else if (action & 65536 /* Action.ReduceFlag */) {\n let rDepth = (action >> 19 /* Action.ReduceDepthShift */) - depth;\n if (rDepth > 1) {\n let term = action & 65535 /* Action.ValueMask */, target = this.stack.length - rDepth * 3;\n if (target >= 0 && parser.getGoto(this.stack[target], term, false) >= 0)\n return (rDepth << 19 /* Action.ReduceDepthShift */) | 65536 /* Action.ReduceFlag */ | term;\n }\n }\n else {\n let found = explore(action, depth + 1);\n if (found != null)\n return found;\n }\n });\n };\n return explore(this.state, 0);\n }\n /// @internal\n forceAll() {\n while (!this.p.parser.stateFlag(this.state, 2 /* StateFlag.Accepting */)) {\n if (!this.forceReduce()) {\n this.storeNode(0 /* Term.Err */, this.pos, this.pos, 4, true);\n break;\n }\n }\n return this;\n }\n /// Check whether this state has no further actions (assumed to be a direct descendant of the\n /// top state, since any other states must be able to continue\n /// somehow). @internal\n get deadEnd() {\n if (this.stack.length != 3)\n return false;\n let { parser } = this.p;\n return parser.data[parser.stateSlot(this.state, 1 /* ParseState.Actions */)] == 65535 /* Seq.End */ &&\n !parser.stateSlot(this.state, 4 /* ParseState.DefaultReduce */);\n }\n /// Restart the stack (put it back in its start state). Only safe\n /// when this.stack.length == 3 (state is directly below the top\n /// state). @internal\n restart() {\n this.state = this.stack[0];\n this.stack.length = 0;\n }\n /// @internal\n sameState(other) {\n if (this.state != other.state || this.stack.length != other.stack.length)\n return false;\n for (let i = 0; i < this.stack.length; i += 3)\n if (this.stack[i] != other.stack[i])\n return false;\n return true;\n }\n /// Get the parser used by this stack.\n get parser() { return this.p.parser; }\n /// Test whether a given dialect (by numeric ID, as exported from\n /// the terms file) is enabled.\n dialectEnabled(dialectID) { return this.p.parser.dialect.flags[dialectID]; }\n shiftContext(term, start) {\n if (this.curContext)\n this.updateContext(this.curContext.tracker.shift(this.curContext.context, term, this, this.p.stream.reset(start)));\n }\n reduceContext(term, start) {\n if (this.curContext)\n this.updateContext(this.curContext.tracker.reduce(this.curContext.context, term, this, this.p.stream.reset(start)));\n }\n /// @internal\n emitContext() {\n let last = this.buffer.length - 1;\n if (last < 0 || this.buffer[last] != -3)\n this.buffer.push(this.curContext.hash, this.pos, this.pos, -3);\n }\n /// @internal\n emitLookAhead() {\n let last = this.buffer.length - 1;\n if (last < 0 || this.buffer[last] != -4)\n this.buffer.push(this.lookAhead, this.pos, this.pos, -4);\n }\n updateContext(context) {\n if (context != this.curContext.context) {\n let newCx = new StackContext(this.curContext.tracker, context);\n if (newCx.hash != this.curContext.hash)\n this.emitContext();\n this.curContext = newCx;\n }\n }\n /// @internal\n setLookAhead(lookAhead) {\n if (lookAhead > this.lookAhead) {\n this.emitLookAhead();\n this.lookAhead = lookAhead;\n }\n }\n /// @internal\n close() {\n if (this.curContext && this.curContext.tracker.strict)\n this.emitContext();\n if (this.lookAhead > 0)\n this.emitLookAhead();\n }\n}\nclass StackContext {\n constructor(tracker, context) {\n this.tracker = tracker;\n this.context = context;\n this.hash = tracker.strict ? tracker.hash(context) : 0;\n }\n}\nvar Recover;\n(function (Recover) {\n Recover[Recover[\"Insert\"] = 200] = \"Insert\";\n Recover[Recover[\"Delete\"] = 190] = \"Delete\";\n Recover[Recover[\"Reduce\"] = 100] = \"Reduce\";\n Recover[Recover[\"MaxNext\"] = 4] = \"MaxNext\";\n Recover[Recover[\"MaxInsertStackDepth\"] = 300] = \"MaxInsertStackDepth\";\n Recover[Recover[\"DampenInsertStackDepth\"] = 120] = \"DampenInsertStackDepth\";\n Recover[Recover[\"MinBigReduction\"] = 2000] = \"MinBigReduction\";\n})(Recover || (Recover = {}));\n// Used to cheaply run some reductions to scan ahead without mutating\n// an entire stack\nclass SimulatedStack {\n constructor(start) {\n this.start = start;\n this.state = start.state;\n this.stack = start.stack;\n this.base = this.stack.length;\n }\n reduce(action) {\n let term = action & 65535 /* Action.ValueMask */, depth = action >> 19 /* Action.ReduceDepthShift */;\n if (depth == 0) {\n if (this.stack == this.start.stack)\n this.stack = this.stack.slice();\n this.stack.push(this.state, 0, 0);\n this.base += 3;\n }\n else {\n this.base -= (depth - 1) * 3;\n }\n let goto = this.start.p.parser.getGoto(this.stack[this.base - 3], term, true);\n this.state = goto;\n }\n}\n// This is given to `Tree.build` to build a buffer, and encapsulates\n// the parent-stack-walking necessary to read the nodes.\nclass StackBufferCursor {\n constructor(stack, pos, index) {\n this.stack = stack;\n this.pos = pos;\n this.index = index;\n this.buffer = stack.buffer;\n if (this.index == 0)\n this.maybeNext();\n }\n static create(stack, pos = stack.bufferBase + stack.buffer.length) {\n return new StackBufferCursor(stack, pos, pos - stack.bufferBase);\n }\n maybeNext() {\n let next = this.stack.parent;\n if (next != null) {\n this.index = this.stack.bufferBase - next.bufferBase;\n this.stack = next;\n this.buffer = next.buffer;\n }\n }\n get id() { return this.buffer[this.index - 4]; }\n get start() { return this.buffer[this.index - 3]; }\n get end() { return this.buffer[this.index - 2]; }\n get size() { return this.buffer[this.index - 1]; }\n next() {\n this.index -= 4;\n this.pos -= 4;\n if (this.index == 0)\n this.maybeNext();\n }\n fork() {\n return new StackBufferCursor(this.stack, this.pos, this.index);\n }\n}\n\n// See lezer-generator/src/encode.ts for comments about the encoding\n// used here\nfunction decodeArray(input, Type = Uint16Array) {\n if (typeof input != \"string\")\n return input;\n let array = null;\n for (let pos = 0, out = 0; pos < input.length;) {\n let value = 0;\n for (;;) {\n let next = input.charCodeAt(pos++), stop = false;\n if (next == 126 /* Encode.BigValCode */) {\n value = 65535 /* Encode.BigVal */;\n break;\n }\n if (next >= 92 /* Encode.Gap2 */)\n next--;\n if (next >= 34 /* Encode.Gap1 */)\n next--;\n let digit = next - 32 /* Encode.Start */;\n if (digit >= 46 /* Encode.Base */) {\n digit -= 46 /* Encode.Base */;\n stop = true;\n }\n value += digit;\n if (stop)\n break;\n value *= 46 /* Encode.Base */;\n }\n if (array)\n array[out++] = value;\n else\n array = new Type(value);\n }\n return array;\n}\n\nclass CachedToken {\n constructor() {\n this.start = -1;\n this.value = -1;\n this.end = -1;\n this.extended = -1;\n this.lookAhead = 0;\n this.mask = 0;\n this.context = 0;\n }\n}\nconst nullToken = new CachedToken;\n/// [Tokenizers](#lr.ExternalTokenizer) interact with the input\n/// through this interface. It presents the input as a stream of\n/// characters, tracking lookahead and hiding the complexity of\n/// [ranges](#common.Parser.parse^ranges) from tokenizer code.\nclass InputStream {\n /// @internal\n constructor(\n /// @internal\n input, \n /// @internal\n ranges) {\n this.input = input;\n this.ranges = ranges;\n /// @internal\n this.chunk = \"\";\n /// @internal\n this.chunkOff = 0;\n /// Backup chunk\n this.chunk2 = \"\";\n this.chunk2Pos = 0;\n /// The character code of the next code unit in the input, or -1\n /// when the stream is at the end of the input.\n this.next = -1;\n /// @internal\n this.token = nullToken;\n this.rangeIndex = 0;\n this.pos = this.chunkPos = ranges[0].from;\n this.range = ranges[0];\n this.end = ranges[ranges.length - 1].to;\n this.readNext();\n }\n /// @internal\n resolveOffset(offset, assoc) {\n let range = this.range, index = this.rangeIndex;\n let pos = this.pos + offset;\n while (pos < range.from) {\n if (!index)\n return null;\n let next = this.ranges[--index];\n pos -= range.from - next.to;\n range = next;\n }\n while (assoc < 0 ? pos > range.to : pos >= range.to) {\n if (index == this.ranges.length - 1)\n return null;\n let next = this.ranges[++index];\n pos += next.from - range.to;\n range = next;\n }\n return pos;\n }\n /// @internal\n clipPos(pos) {\n if (pos >= this.range.from && pos < this.range.to)\n return pos;\n for (let range of this.ranges)\n if (range.to > pos)\n return Math.max(pos, range.from);\n return this.end;\n }\n /// Look at a code unit near the stream position. `.peek(0)` equals\n /// `.next`, `.peek(-1)` gives you the previous character, and so\n /// on.\n ///\n /// Note that looking around during tokenizing creates dependencies\n /// on potentially far-away content, which may reduce the\n /// effectiveness incremental parsing\u2014when looking forward\u2014or even\n /// cause invalid reparses when looking backward more than 25 code\n /// units, since the library does not track lookbehind.\n peek(offset) {\n let idx = this.chunkOff + offset, pos, result;\n if (idx >= 0 && idx < this.chunk.length) {\n pos = this.pos + offset;\n result = this.chunk.charCodeAt(idx);\n }\n else {\n let resolved = this.resolveOffset(offset, 1);\n if (resolved == null)\n return -1;\n pos = resolved;\n if (pos >= this.chunk2Pos && pos < this.chunk2Pos + this.chunk2.length) {\n result = this.chunk2.charCodeAt(pos - this.chunk2Pos);\n }\n else {\n let i = this.rangeIndex, range = this.range;\n while (range.to <= pos)\n range = this.ranges[++i];\n this.chunk2 = this.input.chunk(this.chunk2Pos = pos);\n if (pos + this.chunk2.length > range.to)\n this.chunk2 = this.chunk2.slice(0, range.to - pos);\n result = this.chunk2.charCodeAt(0);\n }\n }\n if (pos >= this.token.lookAhead)\n this.token.lookAhead = pos + 1;\n return result;\n }\n /// Accept a token. By default, the end of the token is set to the\n /// current stream position, but you can pass an offset (relative to\n /// the stream position) to change that.\n acceptToken(token, endOffset = 0) {\n let end = endOffset ? this.resolveOffset(endOffset, -1) : this.pos;\n if (end == null || end < this.token.start)\n throw new RangeError(\"Token end out of bounds\");\n this.token.value = token;\n this.token.end = end;\n }\n getChunk() {\n if (this.pos >= this.chunk2Pos && this.pos < this.chunk2Pos + this.chunk2.length) {\n let { chunk, chunkPos } = this;\n this.chunk = this.chunk2;\n this.chunkPos = this.chunk2Pos;\n this.chunk2 = chunk;\n this.chunk2Pos = chunkPos;\n this.chunkOff = this.pos - this.chunkPos;\n }\n else {\n this.chunk2 = this.chunk;\n this.chunk2Pos = this.chunkPos;\n let nextChunk = this.input.chunk(this.pos);\n let end = this.pos + nextChunk.length;\n this.chunk = end > this.range.to ? nextChunk.slice(0, this.range.to - this.pos) : nextChunk;\n this.chunkPos = this.pos;\n this.chunkOff = 0;\n }\n }\n readNext() {\n if (this.chunkOff >= this.chunk.length) {\n this.getChunk();\n if (this.chunkOff == this.chunk.length)\n return this.next = -1;\n }\n return this.next = this.chunk.charCodeAt(this.chunkOff);\n }\n /// Move the stream forward N (defaults to 1) code units. Returns\n /// the new value of [`next`](#lr.InputStream.next).\n advance(n = 1) {\n this.chunkOff += n;\n while (this.pos + n >= this.range.to) {\n if (this.rangeIndex == this.ranges.length - 1)\n return this.setDone();\n n -= this.range.to - this.pos;\n this.range = this.ranges[++this.rangeIndex];\n this.pos = this.range.from;\n }\n this.pos += n;\n if (this.pos >= this.token.lookAhead)\n this.token.lookAhead = this.pos + 1;\n return this.readNext();\n }\n setDone() {\n this.pos = this.chunkPos = this.end;\n this.range = this.ranges[this.rangeIndex = this.ranges.length - 1];\n this.chunk = \"\";\n return this.next = -1;\n }\n /// @internal\n reset(pos, token) {\n if (token) {\n this.token = token;\n token.start = pos;\n token.lookAhead = pos + 1;\n token.value = token.extended = -1;\n }\n else {\n this.token = nullToken;\n }\n if (this.pos != pos) {\n this.pos = pos;\n if (pos == this.end) {\n this.setDone();\n return this;\n }\n while (pos < this.range.from)\n this.range = this.ranges[--this.rangeIndex];\n while (pos >= this.range.to)\n this.range = this.ranges[++this.rangeIndex];\n if (pos >= this.chunkPos && pos < this.chunkPos + this.chunk.length) {\n this.chunkOff = pos - this.chunkPos;\n }\n else {\n this.chunk = \"\";\n this.chunkOff = 0;\n }\n this.readNext();\n }\n return this;\n }\n /// @internal\n read(from, to) {\n if (from >= this.chunkPos && to <= this.chunkPos + this.chunk.length)\n return this.chunk.slice(from - this.chunkPos, to - this.chunkPos);\n if (from >= this.chunk2Pos && to <= this.chunk2Pos + this.chunk2.length)\n return this.chunk2.slice(from - this.chunk2Pos, to - this.chunk2Pos);\n if (from >= this.range.from && to <= this.range.to)\n return this.input.read(from, to);\n let result = \"\";\n for (let r of this.ranges) {\n if (r.from >= to)\n break;\n if (r.to > from)\n result += this.input.read(Math.max(r.from, from), Math.min(r.to, to));\n }\n return result;\n }\n}\n/// @internal\nclass TokenGroup {\n constructor(data, id) {\n this.data = data;\n this.id = id;\n }\n token(input, stack) {\n let { parser } = stack.p;\n readToken(this.data, input, stack, this.id, parser.data, parser.tokenPrecTable);\n }\n}\nTokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;\n/// @hide\nclass LocalTokenGroup {\n constructor(data, precTable, elseToken) {\n this.precTable = precTable;\n this.elseToken = elseToken;\n this.data = typeof data == \"string\" ? decodeArray(data) : data;\n }\n token(input, stack) {\n let start = input.pos, skipped = 0;\n for (;;) {\n let atEof = input.next < 0, nextPos = input.resolveOffset(1, 1);\n readToken(this.data, input, stack, 0, this.data, this.precTable);\n if (input.token.value > -1)\n break;\n if (this.elseToken == null)\n return;\n if (!atEof)\n skipped++;\n if (nextPos == null)\n break;\n input.reset(nextPos, input.token);\n }\n if (skipped) {\n input.reset(start, input.token);\n input.acceptToken(this.elseToken, skipped);\n }\n }\n}\nLocalTokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;\n/// `@external tokens` declarations in the grammar should resolve to\n/// an instance of this class.\nclass ExternalTokenizer {\n /// Create a tokenizer. The first argument is the function that,\n /// given an input stream, scans for the types of tokens it\n /// recognizes at the stream's position, and calls\n /// [`acceptToken`](#lr.InputStream.acceptToken) when it finds\n /// one.\n constructor(\n /// @internal\n token, options = {}) {\n this.token = token;\n this.contextual = !!options.contextual;\n this.fallback = !!options.fallback;\n this.extend = !!options.extend;\n }\n}\n// Tokenizer data is stored a big uint16 array containing, for each\n// state:\n//\n// - A group bitmask, indicating what token groups are reachable from\n// this state, so that paths that can only lead to tokens not in\n// any of the current groups can be cut off early.\n//\n// - The position of the end of the state's sequence of accepting\n// tokens\n//\n// - The number of outgoing edges for the state\n//\n// - The accepting tokens, as (token id, group mask) pairs\n//\n// - The outgoing edges, as (start character, end character, state\n// index) triples, with end character being exclusive\n//\n// This function interprets that data, running through a stream as\n// long as new states with the a matching group mask can be reached,\n// and updating `input.token` when it matches a token.\nfunction readToken(data, input, stack, group, precTable, precOffset) {\n let state = 0, groupMask = 1 << group, { dialect } = stack.p.parser;\n scan: for (;;) {\n if ((groupMask & data[state]) == 0)\n break;\n let accEnd = data[state + 1];\n // Check whether this state can lead to a token in the current group\n // Accept tokens in this state, possibly overwriting\n // lower-precedence / shorter tokens\n for (let i = state + 3; i < accEnd; i += 2)\n if ((data[i + 1] & groupMask) > 0) {\n let term = data[i];\n if (dialect.allows(term) &&\n (input.token.value == -1 || input.token.value == term ||\n overrides(term, input.token.value, precTable, precOffset))) {\n input.acceptToken(term);\n break;\n }\n }\n let next = input.next, low = 0, high = data[state + 2];\n // Special case for EOF\n if (input.next < 0 && high > low && data[accEnd + high * 3 - 3] == 65535 /* Seq.End */ && data[accEnd + high * 3 - 3] == 65535 /* Seq.End */) {\n state = data[accEnd + high * 3 - 1];\n continue scan;\n }\n // Do a binary search on the state's edges\n for (; low < high;) {\n let mid = (low + high) >> 1;\n let index = accEnd + mid + (mid << 1);\n let from = data[index], to = data[index + 1] || 0x10000;\n if (next < from)\n high = mid;\n else if (next >= to)\n low = mid + 1;\n else {\n state = data[index + 2];\n input.advance();\n continue scan;\n }\n }\n break;\n }\n}\nfunction findOffset(data, start, term) {\n for (let i = start, next; (next = data[i]) != 65535 /* Seq.End */; i++)\n if (next == term)\n return i - start;\n return -1;\n}\nfunction overrides(token, prev, tableData, tableOffset) {\n let iPrev = findOffset(tableData, tableOffset, prev);\n return iPrev < 0 || findOffset(tableData, tableOffset, token) < iPrev;\n}\n\n// Environment variable used to control console output\nconst verbose = typeof process != \"undefined\" && process.env && /\\bparse\\b/.test(process.env.LOG);\nlet stackIDs = null;\nvar Safety;\n(function (Safety) {\n Safety[Safety[\"Margin\"] = 25] = \"Margin\";\n})(Safety || (Safety = {}));\nfunction cutAt(tree, pos, side) {\n let cursor = tree.cursor(IterMode.IncludeAnonymous);\n cursor.moveTo(pos);\n for (;;) {\n if (!(side < 0 ? cursor.childBefore(pos) : cursor.childAfter(pos)))\n for (;;) {\n if ((side < 0 ? cursor.to < pos : cursor.from > pos) && !cursor.type.isError)\n return side < 0 ? Math.max(0, Math.min(cursor.to - 1, pos - 25 /* Safety.Margin */))\n : Math.min(tree.length, Math.max(cursor.from + 1, pos + 25 /* Safety.Margin */));\n if (side < 0 ? cursor.prevSibling() : cursor.nextSibling())\n break;\n if (!cursor.parent())\n return side < 0 ? 0 : tree.length;\n }\n }\n}\nclass FragmentCursor {\n constructor(fragments, nodeSet) {\n this.fragments = fragments;\n this.nodeSet = nodeSet;\n this.i = 0;\n this.fragment = null;\n this.safeFrom = -1;\n this.safeTo = -1;\n this.trees = [];\n this.start = [];\n this.index = [];\n this.nextFragment();\n }\n nextFragment() {\n let fr = this.fragment = this.i == this.fragments.length ? null : this.fragments[this.i++];\n if (fr) {\n this.safeFrom = fr.openStart ? cutAt(fr.tree, fr.from + fr.offset, 1) - fr.offset : fr.from;\n this.safeTo = fr.openEnd ? cutAt(fr.tree, fr.to + fr.offset, -1) - fr.offset : fr.to;\n while (this.trees.length) {\n this.trees.pop();\n this.start.pop();\n this.index.pop();\n }\n this.trees.push(fr.tree);\n this.start.push(-fr.offset);\n this.index.push(0);\n this.nextStart = this.safeFrom;\n }\n else {\n this.nextStart = 1e9;\n }\n }\n // `pos` must be >= any previously given `pos` for this cursor\n nodeAt(pos) {\n if (pos < this.nextStart)\n return null;\n while (this.fragment && this.safeTo <= pos)\n this.nextFragment();\n if (!this.fragment)\n return null;\n for (;;) {\n let last = this.trees.length - 1;\n if (last < 0) { // End of tree\n this.nextFragment();\n return null;\n }\n let top = this.trees[last], index = this.index[last];\n if (index == top.children.length) {\n this.trees.pop();\n this.start.pop();\n this.index.pop();\n continue;\n }\n let next = top.children[index];\n let start = this.start[last] + top.positions[index];\n if (start > pos) {\n this.nextStart = start;\n return null;\n }\n if (next instanceof Tree) {\n if (start == pos) {\n if (start < this.safeFrom)\n return null;\n let end = start + next.length;\n if (end <= this.safeTo) {\n let lookAhead = next.prop(NodeProp.lookAhead);\n if (!lookAhead || end + lookAhead < this.fragment.to)\n return next;\n }\n }\n this.index[last]++;\n if (start + next.length >= Math.max(this.safeFrom, pos)) { // Enter this node\n this.trees.push(next);\n this.start.push(start);\n this.index.push(0);\n }\n }\n else {\n this.index[last]++;\n this.nextStart = start + next.length;\n }\n }\n }\n}\nclass TokenCache {\n constructor(parser, stream) {\n this.stream = stream;\n this.tokens = [];\n this.mainToken = null;\n this.actions = [];\n this.tokens = parser.tokenizers.map(_ => new CachedToken);\n }\n getActions(stack) {\n let actionIndex = 0;\n let main = null;\n let { parser } = stack.p, { tokenizers } = parser;\n let mask = parser.stateSlot(stack.state, 3 /* ParseState.TokenizerMask */);\n let context = stack.curContext ? stack.curContext.hash : 0;\n let lookAhead = 0;\n for (let i = 0; i < tokenizers.length; i++) {\n if (((1 << i) & mask) == 0)\n continue;\n let tokenizer = tokenizers[i], token = this.tokens[i];\n if (main && !tokenizer.fallback)\n continue;\n if (tokenizer.contextual || token.start != stack.pos || token.mask != mask || token.context != context) {\n this.updateCachedToken(token, tokenizer, stack);\n token.mask = mask;\n token.context = context;\n }\n if (token.lookAhead > token.end + 25 /* Safety.Margin */)\n lookAhead = Math.max(token.lookAhead, lookAhead);\n if (token.value != 0 /* Term.Err */) {\n let startIndex = actionIndex;\n if (token.extended > -1)\n actionIndex = this.addActions(stack, token.extended, token.end, actionIndex);\n actionIndex = this.addActions(stack, token.value, token.end, actionIndex);\n if (!tokenizer.extend) {\n main = token;\n if (actionIndex > startIndex)\n break;\n }\n }\n }\n while (this.actions.length > actionIndex)\n this.actions.pop();\n if (lookAhead)\n stack.setLookAhead(lookAhead);\n if (!main && stack.pos == this.stream.end) {\n main = new CachedToken;\n main.value = stack.p.parser.eofTerm;\n main.start = main.end = stack.pos;\n actionIndex = this.addActions(stack, main.value, main.end, actionIndex);\n }\n this.mainToken = main;\n return this.actions;\n }\n getMainToken(stack) {\n if (this.mainToken)\n return this.mainToken;\n let main = new CachedToken, { pos, p } = stack;\n main.start = pos;\n main.end = Math.min(pos + 1, p.stream.end);\n main.value = pos == p.stream.end ? p.parser.eofTerm : 0 /* Term.Err */;\n return main;\n }\n updateCachedToken(token, tokenizer, stack) {\n let start = this.stream.clipPos(stack.pos);\n tokenizer.token(this.stream.reset(start, token), stack);\n if (token.value > -1) {\n let { parser } = stack.p;\n for (let i = 0; i < parser.specialized.length; i++)\n if (parser.specialized[i] == token.value) {\n let result = parser.specializers[i](this.stream.read(token.start, token.end), stack);\n if (result >= 0 && stack.p.parser.dialect.allows(result >> 1)) {\n if ((result & 1) == 0 /* Specialize.Specialize */)\n token.value = result >> 1;\n else\n token.extended = result >> 1;\n break;\n }\n }\n }\n else {\n token.value = 0 /* Term.Err */;\n token.end = this.stream.clipPos(start + 1);\n }\n }\n putAction(action, token, end, index) {\n // Don't add duplicate actions\n for (let i = 0; i < index; i += 3)\n if (this.actions[i] == action)\n return index;\n this.actions[index++] = action;\n this.actions[index++] = token;\n this.actions[index++] = end;\n return index;\n }\n addActions(stack, token, end, index) {\n let { state } = stack, { parser } = stack.p, { data } = parser;\n for (let set = 0; set < 2; set++) {\n for (let i = parser.stateSlot(state, set ? 2 /* ParseState.Skip */ : 1 /* ParseState.Actions */);; i += 3) {\n if (data[i] == 65535 /* Seq.End */) {\n if (data[i + 1] == 1 /* Seq.Next */) {\n i = pair(data, i + 2);\n }\n else {\n if (index == 0 && data[i + 1] == 2 /* Seq.Other */)\n index = this.putAction(pair(data, i + 2), token, end, index);\n break;\n }\n }\n if (data[i] == token)\n index = this.putAction(pair(data, i + 1), token, end, index);\n }\n }\n return index;\n }\n}\nvar Rec;\n(function (Rec) {\n Rec[Rec[\"Distance\"] = 5] = \"Distance\";\n Rec[Rec[\"MaxRemainingPerStep\"] = 3] = \"MaxRemainingPerStep\";\n // When two stacks have been running independently long enough to\n // add this many elements to their buffers, prune one.\n Rec[Rec[\"MinBufferLengthPrune\"] = 500] = \"MinBufferLengthPrune\";\n Rec[Rec[\"ForceReduceLimit\"] = 10] = \"ForceReduceLimit\";\n // Once a stack reaches this depth (in .stack.length) force-reduce\n // it back to CutTo to avoid creating trees that overflow the stack\n // on recursive traversal.\n Rec[Rec[\"CutDepth\"] = 15000] = \"CutDepth\";\n Rec[Rec[\"CutTo\"] = 9000] = \"CutTo\";\n Rec[Rec[\"MaxLeftAssociativeReductionCount\"] = 300] = \"MaxLeftAssociativeReductionCount\";\n // The maximum number of non-recovering stacks to explore (to avoid\n // getting bogged down with exponentially multiplying stacks in\n // ambiguous content)\n Rec[Rec[\"MaxStackCount\"] = 12] = \"MaxStackCount\";\n})(Rec || (Rec = {}));\nclass Parse {\n constructor(parser, input, fragments, ranges) {\n this.parser = parser;\n this.input = input;\n this.ranges = ranges;\n this.recovering = 0;\n this.nextStackID = 0x2654; // \u2654, \u2655, \u2656, \u2657, \u2658, \u2659, \u2660, \u2661, \u2662, \u2663, \u2664, \u2665, \u2666, \u2667\n this.minStackPos = 0;\n this.reused = [];\n this.stoppedAt = null;\n this.lastBigReductionStart = -1;\n this.lastBigReductionSize = 0;\n this.bigReductionCount = 0;\n this.stream = new InputStream(input, ranges);\n this.tokens = new TokenCache(parser, this.stream);\n this.topTerm = parser.top[1];\n let { from } = ranges[0];\n this.stacks = [Stack.start(this, parser.top[0], from)];\n this.fragments = fragments.length && this.stream.end - from > parser.bufferLength * 4\n ? new FragmentCursor(fragments, parser.nodeSet) : null;\n }\n get parsedPos() {\n return this.minStackPos;\n }\n // Move the parser forward. This will process all parse stacks at\n // `this.pos` and try to advance them to a further position. If no\n // stack for such a position is found, it'll start error-recovery.\n //\n // When the parse is finished, this will return a syntax tree. When\n // not, it returns `null`.\n advance() {\n let stacks = this.stacks, pos = this.minStackPos;\n // This will hold stacks beyond `pos`.\n let newStacks = this.stacks = [];\n let stopped, stoppedTokens;\n // If a large amount of reductions happened with the same start\n // position, force the stack out of that production in order to\n // avoid creating a tree too deep to recurse through.\n // (This is an ugly kludge, because unfortunately there is no\n // straightforward, cheap way to check for this happening, due to\n // the history of reductions only being available in an\n // expensive-to-access format in the stack buffers.)\n if (this.bigReductionCount > 300 /* Rec.MaxLeftAssociativeReductionCount */ && stacks.length == 1) {\n let [s] = stacks;\n while (s.forceReduce() && s.stack.length && s.stack[s.stack.length - 2] >= this.lastBigReductionStart) { }\n this.bigReductionCount = this.lastBigReductionSize = 0;\n }\n // Keep advancing any stacks at `pos` until they either move\n // forward or can't be advanced. Gather stacks that can't be\n // advanced further in `stopped`.\n for (let i = 0; i < stacks.length; i++) {\n let stack = stacks[i];\n for (;;) {\n this.tokens.mainToken = null;\n if (stack.pos > pos) {\n newStacks.push(stack);\n }\n else if (this.advanceStack(stack, newStacks, stacks)) {\n continue;\n }\n else {\n if (!stopped) {\n stopped = [];\n stoppedTokens = [];\n }\n stopped.push(stack);\n let tok = this.tokens.getMainToken(stack);\n stoppedTokens.push(tok.value, tok.end);\n }\n break;\n }\n }\n if (!newStacks.length) {\n let finished = stopped && findFinished(stopped);\n if (finished)\n return this.stackToTree(finished);\n if (this.parser.strict) {\n if (verbose && stopped)\n console.log(\"Stuck with token \" + (this.tokens.mainToken ? this.parser.getName(this.tokens.mainToken.value) : \"none\"));\n throw new SyntaxError(\"No parse at \" + pos);\n }\n if (!this.recovering)\n this.recovering = 5 /* Rec.Distance */;\n }\n if (this.recovering && stopped) {\n let finished = this.stoppedAt != null && stopped[0].pos > this.stoppedAt ? stopped[0]\n : this.runRecovery(stopped, stoppedTokens, newStacks);\n if (finished)\n return this.stackToTree(finished.forceAll());\n }\n if (this.recovering) {\n let maxRemaining = this.recovering == 1 ? 1 : this.recovering * 3 /* Rec.MaxRemainingPerStep */;\n if (newStacks.length > maxRemaining) {\n newStacks.sort((a, b) => b.score - a.score);\n while (newStacks.length > maxRemaining)\n newStacks.pop();\n }\n if (newStacks.some(s => s.reducePos > pos))\n this.recovering--;\n }\n else if (newStacks.length > 1) {\n // Prune stacks that are in the same state, or that have been\n // running without splitting for a while, to avoid getting stuck\n // with multiple successful stacks running endlessly on.\n outer: for (let i = 0; i < newStacks.length - 1; i++) {\n let stack = newStacks[i];\n for (let j = i + 1; j < newStacks.length; j++) {\n let other = newStacks[j];\n if (stack.sameState(other) ||\n stack.buffer.length > 500 /* Rec.MinBufferLengthPrune */ && other.buffer.length > 500 /* Rec.MinBufferLengthPrune */) {\n if (((stack.score - other.score) || (stack.buffer.length - other.buffer.length)) > 0) {\n newStacks.splice(j--, 1);\n }\n else {\n newStacks.splice(i--, 1);\n continue outer;\n }\n }\n }\n }\n if (newStacks.length > 12 /* Rec.MaxStackCount */)\n newStacks.splice(12 /* Rec.MaxStackCount */, newStacks.length - 12 /* Rec.MaxStackCount */);\n }\n this.minStackPos = newStacks[0].pos;\n for (let i = 1; i < newStacks.length; i++)\n if (newStacks[i].pos < this.minStackPos)\n this.minStackPos = newStacks[i].pos;\n return null;\n }\n stopAt(pos) {\n if (this.stoppedAt != null && this.stoppedAt < pos)\n throw new RangeError(\"Can't move stoppedAt forward\");\n this.stoppedAt = pos;\n }\n // Returns an updated version of the given stack, or null if the\n // stack can't advance normally. When `split` and `stacks` are\n // given, stacks split off by ambiguous operations will be pushed to\n // `split`, or added to `stacks` if they move `pos` forward.\n advanceStack(stack, stacks, split) {\n let start = stack.pos, { parser } = this;\n let base = verbose ? this.stackID(stack) + \" -> \" : \"\";\n if (this.stoppedAt != null && start > this.stoppedAt)\n return stack.forceReduce() ? stack : null;\n if (this.fragments) {\n let strictCx = stack.curContext && stack.curContext.tracker.strict, cxHash = strictCx ? stack.curContext.hash : 0;\n for (let cached = this.fragments.nodeAt(start); cached;) {\n let match = this.parser.nodeSet.types[cached.type.id] == cached.type ? parser.getGoto(stack.state, cached.type.id) : -1;\n if (match > -1 && cached.length && (!strictCx || (cached.prop(NodeProp.contextHash) || 0) == cxHash)) {\n stack.useNode(cached, match);\n if (verbose)\n console.log(base + this.stackID(stack) + ` (via reuse of ${parser.getName(cached.type.id)})`);\n return true;\n }\n if (!(cached instanceof Tree) || cached.children.length == 0 || cached.positions[0] > 0)\n break;\n let inner = cached.children[0];\n if (inner instanceof Tree && cached.positions[0] == 0)\n cached = inner;\n else\n break;\n }\n }\n let defaultReduce = parser.stateSlot(stack.state, 4 /* ParseState.DefaultReduce */);\n if (defaultReduce > 0) {\n stack.reduce(defaultReduce);\n if (verbose)\n console.log(base + this.stackID(stack) + ` (via always-reduce ${parser.getName(defaultReduce & 65535 /* Action.ValueMask */)})`);\n return true;\n }\n if (stack.stack.length >= 15000 /* Rec.CutDepth */) {\n while (stack.stack.length > 9000 /* Rec.CutTo */ && stack.forceReduce()) { }\n }\n let actions = this.tokens.getActions(stack);\n for (let i = 0; i < actions.length;) {\n let action = actions[i++], term = actions[i++], end = actions[i++];\n let last = i == actions.length || !split;\n let localStack = last ? stack : stack.split();\n localStack.apply(action, term, end);\n if (verbose)\n console.log(base + this.stackID(localStack) + ` (via ${(action & 65536 /* Action.ReduceFlag */) == 0 ? \"shift\"\n : `reduce of ${parser.getName(action & 65535 /* Action.ValueMask */)}`} for ${parser.getName(term)} @ ${start}${localStack == stack ? \"\" : \", split\"})`);\n if (last)\n return true;\n else if (localStack.pos > start)\n stacks.push(localStack);\n else\n split.push(localStack);\n }\n return false;\n }\n // Advance a given stack forward as far as it will go. Returns the\n // (possibly updated) stack if it got stuck, or null if it moved\n // forward and was given to `pushStackDedup`.\n advanceFully(stack, newStacks) {\n let pos = stack.pos;\n for (;;) {\n if (!this.advanceStack(stack, null, null))\n return false;\n if (stack.pos > pos) {\n pushStackDedup(stack, newStacks);\n return true;\n }\n }\n }\n runRecovery(stacks, tokens, newStacks) {\n let finished = null, restarted = false;\n for (let i = 0; i < stacks.length; i++) {\n let stack = stacks[i], token = tokens[i << 1], tokenEnd = tokens[(i << 1) + 1];\n let base = verbose ? this.stackID(stack) + \" -> \" : \"\";\n if (stack.deadEnd) {\n if (restarted)\n continue;\n restarted = true;\n stack.restart();\n if (verbose)\n console.log(base + this.stackID(stack) + \" (restarted)\");\n let done = this.advanceFully(stack, newStacks);\n if (done)\n continue;\n }\n let force = stack.split(), forceBase = base;\n for (let j = 0; force.forceReduce() && j < 10 /* Rec.ForceReduceLimit */; j++) {\n if (verbose)\n console.log(forceBase + this.stackID(force) + \" (via force-reduce)\");\n let done = this.advanceFully(force, newStacks);\n if (done)\n break;\n if (verbose)\n forceBase = this.stackID(force) + \" -> \";\n }\n for (let insert of stack.recoverByInsert(token)) {\n if (verbose)\n console.log(base + this.stackID(insert) + \" (via recover-insert)\");\n this.advanceFully(insert, newStacks);\n }\n if (this.stream.end > stack.pos) {\n if (tokenEnd == stack.pos) {\n tokenEnd++;\n token = 0 /* Term.Err */;\n }\n stack.recoverByDelete(token, tokenEnd);\n if (verbose)\n console.log(base + this.stackID(stack) + ` (via recover-delete ${this.parser.getName(token)})`);\n pushStackDedup(stack, newStacks);\n }\n else if (!finished || finished.score < stack.score) {\n finished = stack;\n }\n }\n return finished;\n }\n // Convert the stack's buffer to a syntax tree.\n stackToTree(stack) {\n stack.close();\n return Tree.build({ buffer: StackBufferCursor.create(stack),\n nodeSet: this.parser.nodeSet,\n topID: this.topTerm,\n maxBufferLength: this.parser.bufferLength,\n reused: this.reused,\n start: this.ranges[0].from,\n length: stack.pos - this.ranges[0].from,\n minRepeatType: this.parser.minRepeatTerm });\n }\n stackID(stack) {\n let id = (stackIDs || (stackIDs = new WeakMap)).get(stack);\n if (!id)\n stackIDs.set(stack, id = String.fromCodePoint(this.nextStackID++));\n return id + stack;\n }\n}\nfunction pushStackDedup(stack, newStacks) {\n for (let i = 0; i < newStacks.length; i++) {\n let other = newStacks[i];\n if (other.pos == stack.pos && other.sameState(stack)) {\n if (newStacks[i].score < stack.score)\n newStacks[i] = stack;\n return;\n }\n }\n newStacks.push(stack);\n}\nclass Dialect {\n constructor(source, flags, disabled) {\n this.source = source;\n this.flags = flags;\n this.disabled = disabled;\n }\n allows(term) { return !this.disabled || this.disabled[term] == 0; }\n}\nconst id = x => x;\n/// Context trackers are used to track stateful context (such as\n/// indentation in the Python grammar, or parent elements in the XML\n/// grammar) needed by external tokenizers. You declare them in a\n/// grammar file as `@context exportName from \"module\"`.\n///\n/// Context values should be immutable, and can be updated (replaced)\n/// on shift or reduce actions.\n///\n/// The export used in a `@context` declaration should be of this\n/// type.\nclass ContextTracker {\n /// Define a context tracker.\n constructor(spec) {\n this.start = spec.start;\n this.shift = spec.shift || id;\n this.reduce = spec.reduce || id;\n this.reuse = spec.reuse || id;\n this.hash = spec.hash || (() => 0);\n this.strict = spec.strict !== false;\n }\n}\n/// Holds the parse tables for a given grammar, as generated by\n/// `lezer-generator`, and provides [methods](#common.Parser) to parse\n/// content with.\nclass LRParser extends Parser {\n /// @internal\n constructor(spec) {\n super();\n /// @internal\n this.wrappers = [];\n if (spec.version != 14 /* File.Version */)\n throw new RangeError(`Parser version (${spec.version}) doesn't match runtime version (${14 /* File.Version */})`);\n let nodeNames = spec.nodeNames.split(\" \");\n this.minRepeatTerm = nodeNames.length;\n for (let i = 0; i < spec.repeatNodeCount; i++)\n nodeNames.push(\"\");\n let topTerms = Object.keys(spec.topRules).map(r => spec.topRules[r][1]);\n let nodeProps = [];\n for (let i = 0; i < nodeNames.length; i++)\n nodeProps.push([]);\n function setProp(nodeID, prop, value) {\n nodeProps[nodeID].push([prop, prop.deserialize(String(value))]);\n }\n if (spec.nodeProps)\n for (let propSpec of spec.nodeProps) {\n let prop = propSpec[0];\n if (typeof prop == \"string\")\n prop = NodeProp[prop];\n for (let i = 1; i < propSpec.length;) {\n let next = propSpec[i++];\n if (next >= 0) {\n setProp(next, prop, propSpec[i++]);\n }\n else {\n let value = propSpec[i + -next];\n for (let j = -next; j > 0; j--)\n setProp(propSpec[i++], prop, value);\n i++;\n }\n }\n }\n this.nodeSet = new NodeSet(nodeNames.map((name, i) => NodeType.define({\n name: i >= this.minRepeatTerm ? undefined : name,\n id: i,\n props: nodeProps[i],\n top: topTerms.indexOf(i) > -1,\n error: i == 0,\n skipped: spec.skippedNodes && spec.skippedNodes.indexOf(i) > -1\n })));\n if (spec.propSources)\n this.nodeSet = this.nodeSet.extend(...spec.propSources);\n this.strict = false;\n this.bufferLength = DefaultBufferLength;\n let tokenArray = decodeArray(spec.tokenData);\n this.context = spec.context;\n this.specializerSpecs = spec.specialized || [];\n this.specialized = new Uint16Array(this.specializerSpecs.length);\n for (let i = 0; i < this.specializerSpecs.length; i++)\n this.specialized[i] = this.specializerSpecs[i].term;\n this.specializers = this.specializerSpecs.map(getSpecializer);\n this.states = decodeArray(spec.states, Uint32Array);\n this.data = decodeArray(spec.stateData);\n this.goto = decodeArray(spec.goto);\n this.maxTerm = spec.maxTerm;\n this.tokenizers = spec.tokenizers.map(value => typeof value == \"number\" ? new TokenGroup(tokenArray, value) : value);\n this.topRules = spec.topRules;\n this.dialects = spec.dialects || {};\n this.dynamicPrecedences = spec.dynamicPrecedences || null;\n this.tokenPrecTable = spec.tokenPrec;\n this.termNames = spec.termNames || null;\n this.maxNode = this.nodeSet.types.length - 1;\n this.dialect = this.parseDialect();\n this.top = this.topRules[Object.keys(this.topRules)[0]];\n }\n createParse(input, fragments, ranges) {\n let parse = new Parse(this, input, fragments, ranges);\n for (let w of this.wrappers)\n parse = w(parse, input, fragments, ranges);\n return parse;\n }\n /// Get a goto table entry @internal\n getGoto(state, term, loose = false) {\n let table = this.goto;\n if (term >= table[0])\n return -1;\n for (let pos = table[term + 1];;) {\n let groupTag = table[pos++], last = groupTag & 1;\n let target = table[pos++];\n if (last && loose)\n return target;\n for (let end = pos + (groupTag >> 1); pos < end; pos++)\n if (table[pos] == state)\n return target;\n if (last)\n return -1;\n }\n }\n /// Check if this state has an action for a given terminal @internal\n hasAction(state, terminal) {\n let data = this.data;\n for (let set = 0; set < 2; set++) {\n for (let i = this.stateSlot(state, set ? 2 /* ParseState.Skip */ : 1 /* ParseState.Actions */), next;; i += 3) {\n if ((next = data[i]) == 65535 /* Seq.End */) {\n if (data[i + 1] == 1 /* Seq.Next */)\n next = data[i = pair(data, i + 2)];\n else if (data[i + 1] == 2 /* Seq.Other */)\n return pair(data, i + 2);\n else\n break;\n }\n if (next == terminal || next == 0 /* Term.Err */)\n return pair(data, i + 1);\n }\n }\n return 0;\n }\n /// @internal\n stateSlot(state, slot) {\n return this.states[(state * 6 /* ParseState.Size */) + slot];\n }\n /// @internal\n stateFlag(state, flag) {\n return (this.stateSlot(state, 0 /* ParseState.Flags */) & flag) > 0;\n }\n /// @internal\n validAction(state, action) {\n return !!this.allActions(state, a => a == action ? true : null);\n }\n /// @internal\n allActions(state, action) {\n let deflt = this.stateSlot(state, 4 /* ParseState.DefaultReduce */);\n let result = deflt ? action(deflt) : undefined;\n for (let i = this.stateSlot(state, 1 /* ParseState.Actions */); result == null; i += 3) {\n if (this.data[i] == 65535 /* Seq.End */) {\n if (this.data[i + 1] == 1 /* Seq.Next */)\n i = pair(this.data, i + 2);\n else\n break;\n }\n result = action(pair(this.data, i + 1));\n }\n return result;\n }\n /// Get the states that can follow this one through shift actions or\n /// goto jumps. @internal\n nextStates(state) {\n let result = [];\n for (let i = this.stateSlot(state, 1 /* ParseState.Actions */);; i += 3) {\n if (this.data[i] == 65535 /* Seq.End */) {\n if (this.data[i + 1] == 1 /* Seq.Next */)\n i = pair(this.data, i + 2);\n else\n break;\n }\n if ((this.data[i + 2] & (65536 /* Action.ReduceFlag */ >> 16)) == 0) {\n let value = this.data[i + 1];\n if (!result.some((v, i) => (i & 1) && v == value))\n result.push(this.data[i], value);\n }\n }\n return result;\n }\n /// Configure the parser. Returns a new parser instance that has the\n /// given settings modified. Settings not provided in `config` are\n /// kept from the original parser.\n configure(config) {\n // Hideous reflection-based kludge to make it easy to create a\n // slightly modified copy of a parser.\n let copy = Object.assign(Object.create(LRParser.prototype), this);\n if (config.props)\n copy.nodeSet = this.nodeSet.extend(...config.props);\n if (config.top) {\n let info = this.topRules[config.top];\n if (!info)\n throw new RangeError(`Invalid top rule name ${config.top}`);\n copy.top = info;\n }\n if (config.tokenizers)\n copy.tokenizers = this.tokenizers.map(t => {\n let found = config.tokenizers.find(r => r.from == t);\n return found ? found.to : t;\n });\n if (config.specializers) {\n copy.specializers = this.specializers.slice();\n copy.specializerSpecs = this.specializerSpecs.map((s, i) => {\n let found = config.specializers.find(r => r.from == s.external);\n if (!found)\n return s;\n let spec = Object.assign(Object.assign({}, s), { external: found.to });\n copy.specializers[i] = getSpecializer(spec);\n return spec;\n });\n }\n if (config.contextTracker)\n copy.context = config.contextTracker;\n if (config.dialect)\n copy.dialect = this.parseDialect(config.dialect);\n if (config.strict != null)\n copy.strict = config.strict;\n if (config.wrap)\n copy.wrappers = copy.wrappers.concat(config.wrap);\n if (config.bufferLength != null)\n copy.bufferLength = config.bufferLength;\n return copy;\n }\n /// Tells you whether any [parse wrappers](#lr.ParserConfig.wrap)\n /// are registered for this parser.\n hasWrappers() {\n return this.wrappers.length > 0;\n }\n /// Returns the name associated with a given term. This will only\n /// work for all terms when the parser was generated with the\n /// `--names` option. By default, only the names of tagged terms are\n /// stored.\n getName(term) {\n return this.termNames ? this.termNames[term] : String(term <= this.maxNode && this.nodeSet.types[term].name || term);\n }\n /// The eof term id is always allocated directly after the node\n /// types. @internal\n get eofTerm() { return this.maxNode + 1; }\n /// The type of top node produced by the parser.\n get topNode() { return this.nodeSet.types[this.top[1]]; }\n /// @internal\n dynamicPrecedence(term) {\n let prec = this.dynamicPrecedences;\n return prec == null ? 0 : prec[term] || 0;\n }\n /// @internal\n parseDialect(dialect) {\n let values = Object.keys(this.dialects), flags = values.map(() => false);\n if (dialect)\n for (let part of dialect.split(\" \")) {\n let id = values.indexOf(part);\n if (id >= 0)\n flags[id] = true;\n }\n let disabled = null;\n for (let i = 0; i < values.length; i++)\n if (!flags[i]) {\n for (let j = this.dialects[values[i]], id; (id = this.data[j++]) != 65535 /* Seq.End */;)\n (disabled || (disabled = new Uint8Array(this.maxTerm + 1)))[id] = 1;\n }\n return new Dialect(dialect, flags, disabled);\n }\n /// Used by the output of the parser generator. Not available to\n /// user code. @hide\n static deserialize(spec) {\n return new LRParser(spec);\n }\n}\nfunction pair(data, off) { return data[off] | (data[off + 1] << 16); }\nfunction findFinished(stacks) {\n let best = null;\n for (let stack of stacks) {\n let stopped = stack.p.stoppedAt;\n if ((stack.pos == stack.p.stream.end || stopped != null && stack.pos > stopped) &&\n stack.p.parser.stateFlag(stack.state, 2 /* StateFlag.Accepting */) &&\n (!best || best.score < stack.score))\n best = stack;\n }\n return best;\n}\nfunction getSpecializer(spec) {\n if (spec.external) {\n let mask = spec.extend ? 1 /* Specialize.Extend */ : 0 /* Specialize.Specialize */;\n return (value, stack) => (spec.external(value, stack) << 1) | mask;\n }\n return spec.get;\n}\n\nexport { ContextTracker, ExternalTokenizer, InputStream, LRParser, LocalTokenGroup, Stack };\n", "import { NodeProp } from '@lezer/common';\n\nlet nextTagID = 0;\n/**\nHighlighting tags are markers that denote a highlighting category.\nThey are [associated](#highlight.styleTags) with parts of a syntax\ntree by a language mode, and then mapped to an actual CSS style by\na [highlighter](#highlight.Highlighter).\n\nBecause syntax tree node types and highlight styles have to be\nable to talk the same language, CodeMirror uses a mostly _closed_\n[vocabulary](#highlight.tags) of syntax tags (as opposed to\ntraditional open string-based systems, which make it hard for\nhighlighting themes to cover all the tokens produced by the\nvarious languages).\n\nIt _is_ possible to [define](#highlight.Tag^define) your own\nhighlighting tags for system-internal use (where you control both\nthe language package and the highlighter), but such tags will not\nbe picked up by regular highlighters (though you can derive them\nfrom standard tags to allow highlighters to fall back to those).\n*/\nclass Tag {\n /**\n @internal\n */\n constructor(\n /**\n The set of this tag and all its parent tags, starting with\n this one itself and sorted in order of decreasing specificity.\n */\n set, \n /**\n The base unmodified tag that this one is based on, if it's\n modified @internal\n */\n base, \n /**\n The modifiers applied to this.base @internal\n */\n modified) {\n this.set = set;\n this.base = base;\n this.modified = modified;\n /**\n @internal\n */\n this.id = nextTagID++;\n }\n /**\n Define a new tag. If `parent` is given, the tag is treated as a\n sub-tag of that parent, and\n [highlighters](#highlight.tagHighlighter) that don't mention\n this tag will try to fall back to the parent tag (or grandparent\n tag, etc).\n */\n static define(parent) {\n if (parent === null || parent === void 0 ? void 0 : parent.base)\n throw new Error(\"Can not derive from a modified tag\");\n let tag = new Tag([], null, []);\n tag.set.push(tag);\n if (parent)\n for (let t of parent.set)\n tag.set.push(t);\n return tag;\n }\n /**\n Define a tag _modifier_, which is a function that, given a tag,\n will return a tag that is a subtag of the original. Applying the\n same modifier to a twice tag will return the same value (`m1(t1)\n == m1(t1)`) and applying multiple modifiers will, regardless or\n order, produce the same tag (`m1(m2(t1)) == m2(m1(t1))`).\n \n When multiple modifiers are applied to a given base tag, each\n smaller set of modifiers is registered as a parent, so that for\n example `m1(m2(m3(t1)))` is a subtype of `m1(m2(t1))`,\n `m1(m3(t1)`, and so on.\n */\n static defineModifier() {\n let mod = new Modifier;\n return (tag) => {\n if (tag.modified.indexOf(mod) > -1)\n return tag;\n return Modifier.get(tag.base || tag, tag.modified.concat(mod).sort((a, b) => a.id - b.id));\n };\n }\n}\nlet nextModifierID = 0;\nclass Modifier {\n constructor() {\n this.instances = [];\n this.id = nextModifierID++;\n }\n static get(base, mods) {\n if (!mods.length)\n return base;\n let exists = mods[0].instances.find(t => t.base == base && sameArray(mods, t.modified));\n if (exists)\n return exists;\n let set = [], tag = new Tag(set, base, mods);\n for (let m of mods)\n m.instances.push(tag);\n let configs = powerSet(mods);\n for (let parent of base.set)\n if (!parent.modified.length)\n for (let config of configs)\n set.push(Modifier.get(parent, config));\n return tag;\n }\n}\nfunction sameArray(a, b) {\n return a.length == b.length && a.every((x, i) => x == b[i]);\n}\nfunction powerSet(array) {\n let sets = [[]];\n for (let i = 0; i < array.length; i++) {\n for (let j = 0, e = sets.length; j < e; j++) {\n sets.push(sets[j].concat(array[i]));\n }\n }\n return sets.sort((a, b) => b.length - a.length);\n}\n/**\nThis function is used to add a set of tags to a language syntax\nvia [`NodeSet.extend`](#common.NodeSet.extend) or\n[`LRParser.configure`](#lr.LRParser.configure).\n\nThe argument object maps node selectors to [highlighting\ntags](#highlight.Tag) or arrays of tags.\n\nNode selectors may hold one or more (space-separated) node paths.\nSuch a path can be a [node name](#common.NodeType.name), or\nmultiple node names (or `*` wildcards) separated by slash\ncharacters, as in `\"Block/Declaration/VariableName\"`. Such a path\nmatches the final node but only if its direct parent nodes are the\nother nodes mentioned. A `*` in such a path matches any parent,\nbut only a single level\u2014wildcards that match multiple parents\naren't supported, both for efficiency reasons and because Lezer\ntrees make it rather hard to reason about what they would match.)\n\nA path can be ended with `/...` to indicate that the tag assigned\nto the node should also apply to all child nodes, even if they\nmatch their own style (by default, only the innermost style is\nused).\n\nWhen a path ends in `!`, as in `Attribute!`, no further matching\nhappens for the node's child nodes, and the entire node gets the\ngiven style.\n\nIn this notation, node names that contain `/`, `!`, `*`, or `...`\nmust be quoted as JSON strings.\n\nFor example:\n\n```javascript\nparser.withProps(\n styleTags({\n // Style Number and BigNumber nodes\n \"Number BigNumber\": tags.number,\n // Style Escape nodes whose parent is String\n \"String/Escape\": tags.escape,\n // Style anything inside Attributes nodes\n \"Attributes!\": tags.meta,\n // Add a style to all content inside Italic nodes\n \"Italic/...\": tags.emphasis,\n // Style InvalidString nodes as both `string` and `invalid`\n \"InvalidString\": [tags.string, tags.invalid],\n // Style the node named \"/\" as punctuation\n '\"/\"': tags.punctuation\n })\n)\n```\n*/\nfunction styleTags(spec) {\n let byName = Object.create(null);\n for (let prop in spec) {\n let tags = spec[prop];\n if (!Array.isArray(tags))\n tags = [tags];\n for (let part of prop.split(\" \"))\n if (part) {\n let pieces = [], mode = 2 /* Normal */, rest = part;\n for (let pos = 0;;) {\n if (rest == \"...\" && pos > 0 && pos + 3 == part.length) {\n mode = 1 /* Inherit */;\n break;\n }\n let m = /^\"(?:[^\"\\\\]|\\\\.)*?\"|[^\\/!]+/.exec(rest);\n if (!m)\n throw new RangeError(\"Invalid path: \" + part);\n pieces.push(m[0] == \"*\" ? \"\" : m[0][0] == '\"' ? JSON.parse(m[0]) : m[0]);\n pos += m[0].length;\n if (pos == part.length)\n break;\n let next = part[pos++];\n if (pos == part.length && next == \"!\") {\n mode = 0 /* Opaque */;\n break;\n }\n if (next != \"/\")\n throw new RangeError(\"Invalid path: \" + part);\n rest = part.slice(pos);\n }\n let last = pieces.length - 1, inner = pieces[last];\n if (!inner)\n throw new RangeError(\"Invalid path: \" + part);\n let rule = new Rule(tags, mode, last > 0 ? pieces.slice(0, last) : null);\n byName[inner] = rule.sort(byName[inner]);\n }\n }\n return ruleNodeProp.add(byName);\n}\nconst ruleNodeProp = new NodeProp();\nclass Rule {\n constructor(tags, mode, context, next) {\n this.tags = tags;\n this.mode = mode;\n this.context = context;\n this.next = next;\n }\n get opaque() { return this.mode == 0 /* Opaque */; }\n get inherit() { return this.mode == 1 /* Inherit */; }\n sort(other) {\n if (!other || other.depth < this.depth) {\n this.next = other;\n return this;\n }\n other.next = this.sort(other.next);\n return other;\n }\n get depth() { return this.context ? this.context.length : 0; }\n}\nRule.empty = new Rule([], 2 /* Normal */, null);\n/**\nDefine a [highlighter](#highlight.Highlighter) from an array of\ntag/class pairs. Classes associated with more specific tags will\ntake precedence.\n*/\nfunction tagHighlighter(tags, options) {\n let map = Object.create(null);\n for (let style of tags) {\n if (!Array.isArray(style.tag))\n map[style.tag.id] = style.class;\n else\n for (let tag of style.tag)\n map[tag.id] = style.class;\n }\n let { scope, all = null } = options || {};\n return {\n style: (tags) => {\n let cls = all;\n for (let tag of tags) {\n for (let sub of tag.set) {\n let tagClass = map[sub.id];\n if (tagClass) {\n cls = cls ? cls + \" \" + tagClass : tagClass;\n break;\n }\n }\n }\n return cls;\n },\n scope\n };\n}\nfunction highlightTags(highlighters, tags) {\n let result = null;\n for (let highlighter of highlighters) {\n let value = highlighter.style(tags);\n if (value)\n result = result ? result + \" \" + value : value;\n }\n return result;\n}\n/**\nHighlight the given [tree](#common.Tree) with the given\n[highlighter](#highlight.Highlighter).\n*/\nfunction highlightTree(tree, highlighter, \n/**\nAssign styling to a region of the text. Will be called, in order\nof position, for any ranges where more than zero classes apply.\n`classes` is a space separated string of CSS classes.\n*/\nputStyle, \n/**\nThe start of the range to highlight.\n*/\nfrom = 0, \n/**\nThe end of the range.\n*/\nto = tree.length) {\n let builder = new HighlightBuilder(from, Array.isArray(highlighter) ? highlighter : [highlighter], putStyle);\n builder.highlightRange(tree.cursor(), from, to, \"\", builder.highlighters);\n builder.flush(to);\n}\nclass HighlightBuilder {\n constructor(at, highlighters, span) {\n this.at = at;\n this.highlighters = highlighters;\n this.span = span;\n this.class = \"\";\n }\n startSpan(at, cls) {\n if (cls != this.class) {\n this.flush(at);\n if (at > this.at)\n this.at = at;\n this.class = cls;\n }\n }\n flush(to) {\n if (to > this.at && this.class)\n this.span(this.at, to, this.class);\n }\n highlightRange(cursor, from, to, inheritedClass, highlighters) {\n let { type, from: start, to: end } = cursor;\n if (start >= to || end <= from)\n return;\n if (type.isTop)\n highlighters = this.highlighters.filter(h => !h.scope || h.scope(type));\n let cls = inheritedClass;\n let rule = getStyleTags(cursor) || Rule.empty;\n let tagCls = highlightTags(highlighters, rule.tags);\n if (tagCls) {\n if (cls)\n cls += \" \";\n cls += tagCls;\n if (rule.mode == 1 /* Inherit */)\n inheritedClass += (inheritedClass ? \" \" : \"\") + tagCls;\n }\n this.startSpan(Math.max(from, start), cls);\n if (rule.opaque)\n return;\n let mounted = cursor.tree && cursor.tree.prop(NodeProp.mounted);\n if (mounted && mounted.overlay) {\n let inner = cursor.node.enter(mounted.overlay[0].from + start, 1);\n let innerHighlighters = this.highlighters.filter(h => !h.scope || h.scope(mounted.tree.type));\n let hasChild = cursor.firstChild();\n for (let i = 0, pos = start;; i++) {\n let next = i < mounted.overlay.length ? mounted.overlay[i] : null;\n let nextPos = next ? next.from + start : end;\n let rangeFrom = Math.max(from, pos), rangeTo = Math.min(to, nextPos);\n if (rangeFrom < rangeTo && hasChild) {\n while (cursor.from < rangeTo) {\n this.highlightRange(cursor, rangeFrom, rangeTo, inheritedClass, highlighters);\n this.startSpan(Math.min(rangeTo, cursor.to), cls);\n if (cursor.to >= nextPos || !cursor.nextSibling())\n break;\n }\n }\n if (!next || nextPos > to)\n break;\n pos = next.to + start;\n if (pos > from) {\n this.highlightRange(inner.cursor(), Math.max(from, next.from + start), Math.min(to, pos), \"\", innerHighlighters);\n this.startSpan(Math.min(to, pos), cls);\n }\n }\n if (hasChild)\n cursor.parent();\n }\n else if (cursor.firstChild()) {\n if (mounted)\n inheritedClass = \"\";\n do {\n if (cursor.to <= from)\n continue;\n if (cursor.from >= to)\n break;\n this.highlightRange(cursor, from, to, inheritedClass, highlighters);\n this.startSpan(Math.min(to, cursor.to), cls);\n } while (cursor.nextSibling());\n cursor.parent();\n }\n }\n}\n/**\nMatch a syntax node's [highlight rules](#highlight.styleTags). If\nthere's a match, return its set of tags, and whether it is\nopaque (uses a `!`) or applies to all child nodes (`/...`).\n*/\nfunction getStyleTags(node) {\n let rule = node.type.prop(ruleNodeProp);\n while (rule && rule.context && !node.matchContext(rule.context))\n rule = rule.next;\n return rule || null;\n}\nconst t = Tag.define;\nconst comment = t(), name = t(), typeName = t(name), propertyName = t(name), literal = t(), string = t(literal), number = t(literal), content = t(), heading = t(content), keyword = t(), operator = t(), punctuation = t(), bracket = t(punctuation), meta = t();\n/**\nThe default set of highlighting [tags](#highlight.Tag).\n\nThis collection is heavily biased towards programming languages,\nand necessarily incomplete. A full ontology of syntactic\nconstructs would fill a stack of books, and be impractical to\nwrite themes for. So try to make do with this set. If all else\nfails, [open an\nissue](https://github.com/codemirror/codemirror.next) to propose a\nnew tag, or [define](#highlight.Tag^define) a local custom tag for\nyour use case.\n\nNote that it is not obligatory to always attach the most specific\ntag possible to an element\u2014if your grammar can't easily\ndistinguish a certain type of element (such as a local variable),\nit is okay to style it as its more general variant (a variable).\n\nFor tags that extend some parent tag, the documentation links to\nthe parent.\n*/\nconst tags = {\n /**\n A comment.\n */\n comment,\n /**\n A line [comment](#highlight.tags.comment).\n */\n lineComment: t(comment),\n /**\n A block [comment](#highlight.tags.comment).\n */\n blockComment: t(comment),\n /**\n A documentation [comment](#highlight.tags.comment).\n */\n docComment: t(comment),\n /**\n Any kind of identifier.\n */\n name,\n /**\n The [name](#highlight.tags.name) of a variable.\n */\n variableName: t(name),\n /**\n A type [name](#highlight.tags.name).\n */\n typeName: typeName,\n /**\n A tag name (subtag of [`typeName`](#highlight.tags.typeName)).\n */\n tagName: t(typeName),\n /**\n A property or field [name](#highlight.tags.name).\n */\n propertyName: propertyName,\n /**\n An attribute name (subtag of [`propertyName`](#highlight.tags.propertyName)).\n */\n attributeName: t(propertyName),\n /**\n The [name](#highlight.tags.name) of a class.\n */\n className: t(name),\n /**\n A label [name](#highlight.tags.name).\n */\n labelName: t(name),\n /**\n A namespace [name](#highlight.tags.name).\n */\n namespace: t(name),\n /**\n The [name](#highlight.tags.name) of a macro.\n */\n macroName: t(name),\n /**\n A literal value.\n */\n literal,\n /**\n A string [literal](#highlight.tags.literal).\n */\n string,\n /**\n A documentation [string](#highlight.tags.string).\n */\n docString: t(string),\n /**\n A character literal (subtag of [string](#highlight.tags.string)).\n */\n character: t(string),\n /**\n An attribute value (subtag of [string](#highlight.tags.string)).\n */\n attributeValue: t(string),\n /**\n A number [literal](#highlight.tags.literal).\n */\n number,\n /**\n An integer [number](#highlight.tags.number) literal.\n */\n integer: t(number),\n /**\n A floating-point [number](#highlight.tags.number) literal.\n */\n float: t(number),\n /**\n A boolean [literal](#highlight.tags.literal).\n */\n bool: t(literal),\n /**\n Regular expression [literal](#highlight.tags.literal).\n */\n regexp: t(literal),\n /**\n An escape [literal](#highlight.tags.literal), for example a\n backslash escape in a string.\n */\n escape: t(literal),\n /**\n A color [literal](#highlight.tags.literal).\n */\n color: t(literal),\n /**\n A URL [literal](#highlight.tags.literal).\n */\n url: t(literal),\n /**\n A language keyword.\n */\n keyword,\n /**\n The [keyword](#highlight.tags.keyword) for the self or this\n object.\n */\n self: t(keyword),\n /**\n The [keyword](#highlight.tags.keyword) for null.\n */\n null: t(keyword),\n /**\n A [keyword](#highlight.tags.keyword) denoting some atomic value.\n */\n atom: t(keyword),\n /**\n A [keyword](#highlight.tags.keyword) that represents a unit.\n */\n unit: t(keyword),\n /**\n A modifier [keyword](#highlight.tags.keyword).\n */\n modifier: t(keyword),\n /**\n A [keyword](#highlight.tags.keyword) that acts as an operator.\n */\n operatorKeyword: t(keyword),\n /**\n A control-flow related [keyword](#highlight.tags.keyword).\n */\n controlKeyword: t(keyword),\n /**\n A [keyword](#highlight.tags.keyword) that defines something.\n */\n definitionKeyword: t(keyword),\n /**\n A [keyword](#highlight.tags.keyword) related to defining or\n interfacing with modules.\n */\n moduleKeyword: t(keyword),\n /**\n An operator.\n */\n operator,\n /**\n An [operator](#highlight.tags.operator) that dereferences something.\n */\n derefOperator: t(operator),\n /**\n Arithmetic-related [operator](#highlight.tags.operator).\n */\n arithmeticOperator: t(operator),\n /**\n Logical [operator](#highlight.tags.operator).\n */\n logicOperator: t(operator),\n /**\n Bit [operator](#highlight.tags.operator).\n */\n bitwiseOperator: t(operator),\n /**\n Comparison [operator](#highlight.tags.operator).\n */\n compareOperator: t(operator),\n /**\n [Operator](#highlight.tags.operator) that updates its operand.\n */\n updateOperator: t(operator),\n /**\n [Operator](#highlight.tags.operator) that defines something.\n */\n definitionOperator: t(operator),\n /**\n Type-related [operator](#highlight.tags.operator).\n */\n typeOperator: t(operator),\n /**\n Control-flow [operator](#highlight.tags.operator).\n */\n controlOperator: t(operator),\n /**\n Program or markup punctuation.\n */\n punctuation,\n /**\n [Punctuation](#highlight.tags.punctuation) that separates\n things.\n */\n separator: t(punctuation),\n /**\n Bracket-style [punctuation](#highlight.tags.punctuation).\n */\n bracket,\n /**\n Angle [brackets](#highlight.tags.bracket) (usually `<` and `>`\n tokens).\n */\n angleBracket: t(bracket),\n /**\n Square [brackets](#highlight.tags.bracket) (usually `[` and `]`\n tokens).\n */\n squareBracket: t(bracket),\n /**\n Parentheses (usually `(` and `)` tokens). Subtag of\n [bracket](#highlight.tags.bracket).\n */\n paren: t(bracket),\n /**\n Braces (usually `{` and `}` tokens). Subtag of\n [bracket](#highlight.tags.bracket).\n */\n brace: t(bracket),\n /**\n Content, for example plain text in XML or markup documents.\n */\n content,\n /**\n [Content](#highlight.tags.content) that represents a heading.\n */\n heading,\n /**\n A level 1 [heading](#highlight.tags.heading).\n */\n heading1: t(heading),\n /**\n A level 2 [heading](#highlight.tags.heading).\n */\n heading2: t(heading),\n /**\n A level 3 [heading](#highlight.tags.heading).\n */\n heading3: t(heading),\n /**\n A level 4 [heading](#highlight.tags.heading).\n */\n heading4: t(heading),\n /**\n A level 5 [heading](#highlight.tags.heading).\n */\n heading5: t(heading),\n /**\n A level 6 [heading](#highlight.tags.heading).\n */\n heading6: t(heading),\n /**\n A prose separator (such as a horizontal rule).\n */\n contentSeparator: t(content),\n /**\n [Content](#highlight.tags.content) that represents a list.\n */\n list: t(content),\n /**\n [Content](#highlight.tags.content) that represents a quote.\n */\n quote: t(content),\n /**\n [Content](#highlight.tags.content) that is emphasized.\n */\n emphasis: t(content),\n /**\n [Content](#highlight.tags.content) that is styled strong.\n */\n strong: t(content),\n /**\n [Content](#highlight.tags.content) that is part of a link.\n */\n link: t(content),\n /**\n [Content](#highlight.tags.content) that is styled as code or\n monospace.\n */\n monospace: t(content),\n /**\n [Content](#highlight.tags.content) that has a strike-through\n style.\n */\n strikethrough: t(content),\n /**\n Inserted text in a change-tracking format.\n */\n inserted: t(),\n /**\n Deleted text.\n */\n deleted: t(),\n /**\n Changed text.\n */\n changed: t(),\n /**\n An invalid or unsyntactic element.\n */\n invalid: t(),\n /**\n Metadata or meta-instruction.\n */\n meta,\n /**\n [Metadata](#highlight.tags.meta) that applies to the entire\n document.\n */\n documentMeta: t(meta),\n /**\n [Metadata](#highlight.tags.meta) that annotates or adds\n attributes to a given syntactic element.\n */\n annotation: t(meta),\n /**\n Processing instruction or preprocessor directive. Subtag of\n [meta](#highlight.tags.meta).\n */\n processingInstruction: t(meta),\n /**\n [Modifier](#highlight.Tag^defineModifier) that indicates that a\n given element is being defined. Expected to be used with the\n various [name](#highlight.tags.name) tags.\n */\n definition: Tag.defineModifier(),\n /**\n [Modifier](#highlight.Tag^defineModifier) that indicates that\n something is constant. Mostly expected to be used with\n [variable names](#highlight.tags.variableName).\n */\n constant: Tag.defineModifier(),\n /**\n [Modifier](#highlight.Tag^defineModifier) used to indicate that\n a [variable](#highlight.tags.variableName) or [property\n name](#highlight.tags.propertyName) is being called or defined\n as a function.\n */\n function: Tag.defineModifier(),\n /**\n [Modifier](#highlight.Tag^defineModifier) that can be applied to\n [names](#highlight.tags.name) to indicate that they belong to\n the language's standard environment.\n */\n standard: Tag.defineModifier(),\n /**\n [Modifier](#highlight.Tag^defineModifier) that indicates a given\n [names](#highlight.tags.name) is local to some scope.\n */\n local: Tag.defineModifier(),\n /**\n A generic variant [modifier](#highlight.Tag^defineModifier) that\n can be used to tag language-specific alternative variants of\n some common tag. It is recommended for themes to define special\n forms of at least the [string](#highlight.tags.string) and\n [variable name](#highlight.tags.variableName) tags, since those\n come up a lot.\n */\n special: Tag.defineModifier()\n};\n/**\nThis is a highlighter that adds stable, predictable classes to\ntokens, for styling with external CSS.\n\nThe following tags are mapped to their name prefixed with `\"tok-\"`\n(for example `\"tok-comment\"`):\n\n* [`link`](#highlight.tags.link)\n* [`heading`](#highlight.tags.heading)\n* [`emphasis`](#highlight.tags.emphasis)\n* [`strong`](#highlight.tags.strong)\n* [`keyword`](#highlight.tags.keyword)\n* [`atom`](#highlight.tags.atom)\n* [`bool`](#highlight.tags.bool)\n* [`url`](#highlight.tags.url)\n* [`labelName`](#highlight.tags.labelName)\n* [`inserted`](#highlight.tags.inserted)\n* [`deleted`](#highlight.tags.deleted)\n* [`literal`](#highlight.tags.literal)\n* [`string`](#highlight.tags.string)\n* [`number`](#highlight.tags.number)\n* [`variableName`](#highlight.tags.variableName)\n* [`typeName`](#highlight.tags.typeName)\n* [`namespace`](#highlight.tags.namespace)\n* [`className`](#highlight.tags.className)\n* [`macroName`](#highlight.tags.macroName)\n* [`propertyName`](#highlight.tags.propertyName)\n* [`operator`](#highlight.tags.operator)\n* [`comment`](#highlight.tags.comment)\n* [`meta`](#highlight.tags.meta)\n* [`punctuation`](#highlight.tags.punctuation)\n* [`invalid`](#highlight.tags.invalid)\n\nIn addition, these mappings are provided:\n\n* [`regexp`](#highlight.tags.regexp),\n [`escape`](#highlight.tags.escape), and\n [`special`](#highlight.tags.special)[`(string)`](#highlight.tags.string)\n are mapped to `\"tok-string2\"`\n* [`special`](#highlight.tags.special)[`(variableName)`](#highlight.tags.variableName)\n to `\"tok-variableName2\"`\n* [`local`](#highlight.tags.local)[`(variableName)`](#highlight.tags.variableName)\n to `\"tok-variableName tok-local\"`\n* [`definition`](#highlight.tags.definition)[`(variableName)`](#highlight.tags.variableName)\n to `\"tok-variableName tok-definition\"`\n* [`definition`](#highlight.tags.definition)[`(propertyName)`](#highlight.tags.propertyName)\n to `\"tok-propertyName tok-definition\"`\n*/\nconst classHighlighter = tagHighlighter([\n { tag: tags.link, class: \"tok-link\" },\n { tag: tags.heading, class: \"tok-heading\" },\n { tag: tags.emphasis, class: \"tok-emphasis\" },\n { tag: tags.strong, class: \"tok-strong\" },\n { tag: tags.keyword, class: \"tok-keyword\" },\n { tag: tags.atom, class: \"tok-atom\" },\n { tag: tags.bool, class: \"tok-bool\" },\n { tag: tags.url, class: \"tok-url\" },\n { tag: tags.labelName, class: \"tok-labelName\" },\n { tag: tags.inserted, class: \"tok-inserted\" },\n { tag: tags.deleted, class: \"tok-deleted\" },\n { tag: tags.literal, class: \"tok-literal\" },\n { tag: tags.string, class: \"tok-string\" },\n { tag: tags.number, class: \"tok-number\" },\n { tag: [tags.regexp, tags.escape, tags.special(tags.string)], class: \"tok-string2\" },\n { tag: tags.variableName, class: \"tok-variableName\" },\n { tag: tags.local(tags.variableName), class: \"tok-variableName tok-local\" },\n { tag: tags.definition(tags.variableName), class: \"tok-variableName tok-definition\" },\n { tag: tags.special(tags.variableName), class: \"tok-variableName2\" },\n { tag: tags.definition(tags.propertyName), class: \"tok-propertyName tok-definition\" },\n { tag: tags.typeName, class: \"tok-typeName\" },\n { tag: tags.namespace, class: \"tok-namespace\" },\n { tag: tags.className, class: \"tok-className\" },\n { tag: tags.macroName, class: \"tok-macroName\" },\n { tag: tags.propertyName, class: \"tok-propertyName\" },\n { tag: tags.operator, class: \"tok-operator\" },\n { tag: tags.comment, class: \"tok-comment\" },\n { tag: tags.meta, class: \"tok-meta\" },\n { tag: tags.invalid, class: \"tok-invalid\" },\n { tag: tags.punctuation, class: \"tok-punctuation\" }\n]);\n\nexport { Tag, classHighlighter, getStyleTags, highlightTree, styleTags, tagHighlighter, tags };\n", "import { Annotation, StateEffect, EditorSelection, codePointAt, codePointSize, fromCodePoint, Facet, combineConfig, StateField, Prec, Text, MapMode, RangeValue, RangeSet, CharCategory } from '@codemirror/state';\nimport { Direction, logException, showTooltip, EditorView, ViewPlugin, getTooltip, Decoration, WidgetType, keymap } from '@codemirror/view';\nimport { syntaxTree, indentUnit } from '@codemirror/language';\n\n/**\nAn instance of this is passed to completion source functions.\n*/\nclass CompletionContext {\n /**\n Create a new completion context. (Mostly useful for testing\n completion sources\u2014in the editor, the extension will create\n these for you.)\n */\n constructor(\n /**\n The editor state that the completion happens in.\n */\n state, \n /**\n The position at which the completion is happening.\n */\n pos, \n /**\n Indicates whether completion was activated explicitly, or\n implicitly by typing. The usual way to respond to this is to\n only return completions when either there is part of a\n completable entity before the cursor, or `explicit` is true.\n */\n explicit) {\n this.state = state;\n this.pos = pos;\n this.explicit = explicit;\n /**\n @internal\n */\n this.abortListeners = [];\n }\n /**\n Get the extent, content, and (if there is a token) type of the\n token before `this.pos`.\n */\n tokenBefore(types) {\n let token = syntaxTree(this.state).resolveInner(this.pos, -1);\n while (token && types.indexOf(token.name) < 0)\n token = token.parent;\n return token ? { from: token.from, to: this.pos,\n text: this.state.sliceDoc(token.from, this.pos),\n type: token.type } : null;\n }\n /**\n Get the match of the given expression directly before the\n cursor.\n */\n matchBefore(expr) {\n let line = this.state.doc.lineAt(this.pos);\n let start = Math.max(line.from, this.pos - 250);\n let str = line.text.slice(start - line.from, this.pos - line.from);\n let found = str.search(ensureAnchor(expr, false));\n return found < 0 ? null : { from: start + found, to: this.pos, text: str.slice(found) };\n }\n /**\n Yields true when the query has been aborted. Can be useful in\n asynchronous queries to avoid doing work that will be ignored.\n */\n get aborted() { return this.abortListeners == null; }\n /**\n Allows you to register abort handlers, which will be called when\n the query is\n [aborted](https://codemirror.net/6/docs/ref/#autocomplete.CompletionContext.aborted).\n */\n addEventListener(type, listener) {\n if (type == \"abort\" && this.abortListeners)\n this.abortListeners.push(listener);\n }\n}\nfunction toSet(chars) {\n let flat = Object.keys(chars).join(\"\");\n let words = /\\w/.test(flat);\n if (words)\n flat = flat.replace(/\\w/g, \"\");\n return `[${words ? \"\\\\w\" : \"\"}${flat.replace(/[^\\w\\s]/g, \"\\\\$&\")}]`;\n}\nfunction prefixMatch(options) {\n let first = Object.create(null), rest = Object.create(null);\n for (let { label } of options) {\n first[label[0]] = true;\n for (let i = 1; i < label.length; i++)\n rest[label[i]] = true;\n }\n let source = toSet(first) + toSet(rest) + \"*$\";\n return [new RegExp(\"^\" + source), new RegExp(source)];\n}\n/**\nGiven a a fixed array of options, return an autocompleter that\ncompletes them.\n*/\nfunction completeFromList(list) {\n let options = list.map(o => typeof o == \"string\" ? { label: o } : o);\n let [validFor, match] = options.every(o => /^\\w+$/.test(o.label)) ? [/\\w*$/, /\\w+$/] : prefixMatch(options);\n return (context) => {\n let token = context.matchBefore(match);\n return token || context.explicit ? { from: token ? token.from : context.pos, options, validFor } : null;\n };\n}\n/**\nWrap the given completion source so that it will only fire when the\ncursor is in a syntax node with one of the given names.\n*/\nfunction ifIn(nodes, source) {\n return (context) => {\n for (let pos = syntaxTree(context.state).resolveInner(context.pos, -1); pos; pos = pos.parent) {\n if (nodes.indexOf(pos.name) > -1)\n return source(context);\n if (pos.type.isTop)\n break;\n }\n return null;\n };\n}\n/**\nWrap the given completion source so that it will not fire when the\ncursor is in a syntax node with one of the given names.\n*/\nfunction ifNotIn(nodes, source) {\n return (context) => {\n for (let pos = syntaxTree(context.state).resolveInner(context.pos, -1); pos; pos = pos.parent) {\n if (nodes.indexOf(pos.name) > -1)\n return null;\n if (pos.type.isTop)\n break;\n }\n return source(context);\n };\n}\nclass Option {\n constructor(completion, source, match, score) {\n this.completion = completion;\n this.source = source;\n this.match = match;\n this.score = score;\n }\n}\nfunction cur(state) { return state.selection.main.from; }\n// Make sure the given regexp has a $ at its end and, if `start` is\n// true, a ^ at its start.\nfunction ensureAnchor(expr, start) {\n var _a;\n let { source } = expr;\n let addStart = start && source[0] != \"^\", addEnd = source[source.length - 1] != \"$\";\n if (!addStart && !addEnd)\n return expr;\n return new RegExp(`${addStart ? \"^\" : \"\"}(?:${source})${addEnd ? \"$\" : \"\"}`, (_a = expr.flags) !== null && _a !== void 0 ? _a : (expr.ignoreCase ? \"i\" : \"\"));\n}\n/**\nThis annotation is added to transactions that are produced by\npicking a completion.\n*/\nconst pickedCompletion = /*@__PURE__*/Annotation.define();\n/**\nHelper function that returns a transaction spec which inserts a\ncompletion's text in the main selection range, and any other\nselection range that has the same text in front of it.\n*/\nfunction insertCompletionText(state, text, from, to) {\n let { main } = state.selection, fromOff = from - main.from, toOff = to - main.from;\n return Object.assign(Object.assign({}, state.changeByRange(range => {\n if (range != main && from != to &&\n state.sliceDoc(range.from + fromOff, range.from + toOff) != state.sliceDoc(from, to))\n return { range };\n return {\n changes: { from: range.from + fromOff, to: to == main.from ? range.to : range.from + toOff, insert: text },\n range: EditorSelection.cursor(range.from + fromOff + text.length)\n };\n })), { userEvent: \"input.complete\" });\n}\nconst SourceCache = /*@__PURE__*/new WeakMap();\nfunction asSource(source) {\n if (!Array.isArray(source))\n return source;\n let known = SourceCache.get(source);\n if (!known)\n SourceCache.set(source, known = completeFromList(source));\n return known;\n}\nconst startCompletionEffect = /*@__PURE__*/StateEffect.define();\nconst closeCompletionEffect = /*@__PURE__*/StateEffect.define();\n\n// A pattern matcher for fuzzy completion matching. Create an instance\n// once for a pattern, and then use that to match any number of\n// completions.\nclass FuzzyMatcher {\n constructor(pattern) {\n this.pattern = pattern;\n this.chars = [];\n this.folded = [];\n // Buffers reused by calls to `match` to track matched character\n // positions.\n this.any = [];\n this.precise = [];\n this.byWord = [];\n for (let p = 0; p < pattern.length;) {\n let char = codePointAt(pattern, p), size = codePointSize(char);\n this.chars.push(char);\n let part = pattern.slice(p, p + size), upper = part.toUpperCase();\n this.folded.push(codePointAt(upper == part ? part.toLowerCase() : upper, 0));\n p += size;\n }\n this.astral = pattern.length != this.chars.length;\n }\n // Matches a given word (completion) against the pattern (input).\n // Will return null for no match, and otherwise an array that starts\n // with the match score, followed by any number of `from, to` pairs\n // indicating the matched parts of `word`.\n //\n // The score is a number that is more negative the worse the match\n // is. See `Penalty` above.\n match(word) {\n if (this.pattern.length == 0)\n return [-100 /* NotFull */];\n if (word.length < this.pattern.length)\n return null;\n let { chars, folded, any, precise, byWord } = this;\n // For single-character queries, only match when they occur right\n // at the start\n if (chars.length == 1) {\n let first = codePointAt(word, 0), firstSize = codePointSize(first);\n let score = firstSize == word.length ? 0 : -100 /* NotFull */;\n if (first == chars[0]) ;\n else if (first == folded[0])\n score += -200 /* CaseFold */;\n else\n return null;\n return [score, 0, firstSize];\n }\n let direct = word.indexOf(this.pattern);\n if (direct == 0)\n return [word.length == this.pattern.length ? 0 : -100 /* NotFull */, 0, this.pattern.length];\n let len = chars.length, anyTo = 0;\n if (direct < 0) {\n for (let i = 0, e = Math.min(word.length, 200); i < e && anyTo < len;) {\n let next = codePointAt(word, i);\n if (next == chars[anyTo] || next == folded[anyTo])\n any[anyTo++] = i;\n i += codePointSize(next);\n }\n // No match, exit immediately\n if (anyTo < len)\n return null;\n }\n // This tracks the extent of the precise (non-folded, not\n // necessarily adjacent) match\n let preciseTo = 0;\n // Tracks whether there is a match that hits only characters that\n // appear to be starting words. `byWordFolded` is set to true when\n // a case folded character is encountered in such a match\n let byWordTo = 0, byWordFolded = false;\n // If we've found a partial adjacent match, these track its state\n let adjacentTo = 0, adjacentStart = -1, adjacentEnd = -1;\n let hasLower = /[a-z]/.test(word), wordAdjacent = true;\n // Go over the option's text, scanning for the various kinds of matches\n for (let i = 0, e = Math.min(word.length, 200), prevType = 0 /* NonWord */; i < e && byWordTo < len;) {\n let next = codePointAt(word, i);\n if (direct < 0) {\n if (preciseTo < len && next == chars[preciseTo])\n precise[preciseTo++] = i;\n if (adjacentTo < len) {\n if (next == chars[adjacentTo] || next == folded[adjacentTo]) {\n if (adjacentTo == 0)\n adjacentStart = i;\n adjacentEnd = i + 1;\n adjacentTo++;\n }\n else {\n adjacentTo = 0;\n }\n }\n }\n let ch, type = next < 0xff\n ? (next >= 48 && next <= 57 || next >= 97 && next <= 122 ? 2 /* Lower */ : next >= 65 && next <= 90 ? 1 /* Upper */ : 0 /* NonWord */)\n : ((ch = fromCodePoint(next)) != ch.toLowerCase() ? 1 /* Upper */ : ch != ch.toUpperCase() ? 2 /* Lower */ : 0 /* NonWord */);\n if (!i || type == 1 /* Upper */ && hasLower || prevType == 0 /* NonWord */ && type != 0 /* NonWord */) {\n if (chars[byWordTo] == next || (folded[byWordTo] == next && (byWordFolded = true)))\n byWord[byWordTo++] = i;\n else if (byWord.length)\n wordAdjacent = false;\n }\n prevType = type;\n i += codePointSize(next);\n }\n if (byWordTo == len && byWord[0] == 0 && wordAdjacent)\n return this.result(-100 /* ByWord */ + (byWordFolded ? -200 /* CaseFold */ : 0), byWord, word);\n if (adjacentTo == len && adjacentStart == 0)\n return [-200 /* CaseFold */ - word.length + (adjacentEnd == word.length ? 0 : -100 /* NotFull */), 0, adjacentEnd];\n if (direct > -1)\n return [-700 /* NotStart */ - word.length, direct, direct + this.pattern.length];\n if (adjacentTo == len)\n return [-200 /* CaseFold */ + -700 /* NotStart */ - word.length, adjacentStart, adjacentEnd];\n if (byWordTo == len)\n return this.result(-100 /* ByWord */ + (byWordFolded ? -200 /* CaseFold */ : 0) + -700 /* NotStart */ +\n (wordAdjacent ? 0 : -1100 /* Gap */), byWord, word);\n return chars.length == 2 ? null : this.result((any[0] ? -700 /* NotStart */ : 0) + -200 /* CaseFold */ + -1100 /* Gap */, any, word);\n }\n result(score, positions, word) {\n let result = [score - word.length], i = 1;\n for (let pos of positions) {\n let to = pos + (this.astral ? codePointSize(codePointAt(word, pos)) : 1);\n if (i > 1 && result[i - 1] == pos)\n result[i - 1] = to;\n else {\n result[i++] = pos;\n result[i++] = to;\n }\n }\n return result;\n }\n}\n\nconst completionConfig = /*@__PURE__*/Facet.define({\n combine(configs) {\n return combineConfig(configs, {\n activateOnTyping: true,\n selectOnOpen: true,\n override: null,\n closeOnBlur: true,\n maxRenderedOptions: 100,\n defaultKeymap: true,\n tooltipClass: () => \"\",\n optionClass: () => \"\",\n aboveCursor: false,\n icons: true,\n addToOptions: [],\n positionInfo: defaultPositionInfo,\n compareCompletions: (a, b) => a.label.localeCompare(b.label),\n interactionDelay: 75\n }, {\n defaultKeymap: (a, b) => a && b,\n closeOnBlur: (a, b) => a && b,\n icons: (a, b) => a && b,\n tooltipClass: (a, b) => c => joinClass(a(c), b(c)),\n optionClass: (a, b) => c => joinClass(a(c), b(c)),\n addToOptions: (a, b) => a.concat(b)\n });\n }\n});\nfunction joinClass(a, b) {\n return a ? b ? a + \" \" + b : a : b;\n}\nfunction defaultPositionInfo(view, list, option, info, space) {\n let rtl = view.textDirection == Direction.RTL, left = rtl, narrow = false;\n let side = \"top\", offset, maxWidth;\n let spaceLeft = list.left - space.left, spaceRight = space.right - list.right;\n let infoWidth = info.right - info.left, infoHeight = info.bottom - info.top;\n if (left && spaceLeft < Math.min(infoWidth, spaceRight))\n left = false;\n else if (!left && spaceRight < Math.min(infoWidth, spaceLeft))\n left = true;\n if (infoWidth <= (left ? spaceLeft : spaceRight)) {\n offset = Math.max(space.top, Math.min(option.top, space.bottom - infoHeight)) - list.top;\n maxWidth = Math.min(400 /* Width */, left ? spaceLeft : spaceRight);\n }\n else {\n narrow = true;\n maxWidth = Math.min(400 /* Width */, (rtl ? list.right : space.right - list.left) - 30 /* Margin */);\n let spaceBelow = space.bottom - list.bottom;\n if (spaceBelow >= infoHeight || spaceBelow > list.top) { // Below the completion\n offset = option.bottom - list.top;\n }\n else { // Above it\n side = \"bottom\";\n offset = list.bottom - option.top;\n }\n }\n return {\n style: `${side}: ${offset}px; max-width: ${maxWidth}px`,\n class: \"cm-completionInfo-\" + (narrow ? (rtl ? \"left-narrow\" : \"right-narrow\") : left ? \"left\" : \"right\")\n };\n}\n\nfunction optionContent(config) {\n let content = config.addToOptions.slice();\n if (config.icons)\n content.push({\n render(completion) {\n let icon = document.createElement(\"div\");\n icon.classList.add(\"cm-completionIcon\");\n if (completion.type)\n icon.classList.add(...completion.type.split(/\\s+/g).map(cls => \"cm-completionIcon-\" + cls));\n icon.setAttribute(\"aria-hidden\", \"true\");\n return icon;\n },\n position: 20\n });\n content.push({\n render(completion, _s, match) {\n let labelElt = document.createElement(\"span\");\n labelElt.className = \"cm-completionLabel\";\n let { label } = completion, off = 0;\n for (let j = 1; j < match.length;) {\n let from = match[j++], to = match[j++];\n if (from > off)\n labelElt.appendChild(document.createTextNode(label.slice(off, from)));\n let span = labelElt.appendChild(document.createElement(\"span\"));\n span.appendChild(document.createTextNode(label.slice(from, to)));\n span.className = \"cm-completionMatchedText\";\n off = to;\n }\n if (off < label.length)\n labelElt.appendChild(document.createTextNode(label.slice(off)));\n return labelElt;\n },\n position: 50\n }, {\n render(completion) {\n if (!completion.detail)\n return null;\n let detailElt = document.createElement(\"span\");\n detailElt.className = \"cm-completionDetail\";\n detailElt.textContent = completion.detail;\n return detailElt;\n },\n position: 80\n });\n return content.sort((a, b) => a.position - b.position).map(a => a.render);\n}\nfunction rangeAroundSelected(total, selected, max) {\n if (total <= max)\n return { from: 0, to: total };\n if (selected < 0)\n selected = 0;\n if (selected <= (total >> 1)) {\n let off = Math.floor(selected / max);\n return { from: off * max, to: (off + 1) * max };\n }\n let off = Math.floor((total - selected) / max);\n return { from: total - (off + 1) * max, to: total - off * max };\n}\nclass CompletionTooltip {\n constructor(view, stateField, applyCompletion) {\n this.view = view;\n this.stateField = stateField;\n this.applyCompletion = applyCompletion;\n this.info = null;\n this.infoDestroy = null;\n this.placeInfoReq = {\n read: () => this.measureInfo(),\n write: (pos) => this.placeInfo(pos),\n key: this\n };\n this.space = null;\n this.currentClass = \"\";\n let cState = view.state.field(stateField);\n let { options, selected } = cState.open;\n let config = view.state.facet(completionConfig);\n this.optionContent = optionContent(config);\n this.optionClass = config.optionClass;\n this.tooltipClass = config.tooltipClass;\n this.range = rangeAroundSelected(options.length, selected, config.maxRenderedOptions);\n this.dom = document.createElement(\"div\");\n this.dom.className = \"cm-tooltip-autocomplete\";\n this.updateTooltipClass(view.state);\n this.dom.addEventListener(\"mousedown\", (e) => {\n for (let dom = e.target, match; dom && dom != this.dom; dom = dom.parentNode) {\n if (dom.nodeName == \"LI\" && (match = /-(\\d+)$/.exec(dom.id)) && +match[1] < options.length) {\n this.applyCompletion(view, options[+match[1]]);\n e.preventDefault();\n return;\n }\n }\n });\n this.dom.addEventListener(\"focusout\", (e) => {\n let state = view.state.field(this.stateField, false);\n if (state && state.tooltip && view.state.facet(completionConfig).closeOnBlur &&\n e.relatedTarget != view.contentDOM)\n view.dispatch({ effects: closeCompletionEffect.of(null) });\n });\n this.list = this.dom.appendChild(this.createListBox(options, cState.id, this.range));\n this.list.addEventListener(\"scroll\", () => {\n if (this.info)\n this.view.requestMeasure(this.placeInfoReq);\n });\n }\n mount() { this.updateSel(); }\n update(update) {\n var _a, _b, _c;\n let cState = update.state.field(this.stateField);\n let prevState = update.startState.field(this.stateField);\n this.updateTooltipClass(update.state);\n if (cState != prevState) {\n this.updateSel();\n if (((_a = cState.open) === null || _a === void 0 ? void 0 : _a.disabled) != ((_b = prevState.open) === null || _b === void 0 ? void 0 : _b.disabled))\n this.dom.classList.toggle(\"cm-tooltip-autocomplete-disabled\", !!((_c = cState.open) === null || _c === void 0 ? void 0 : _c.disabled));\n }\n }\n updateTooltipClass(state) {\n let cls = this.tooltipClass(state);\n if (cls != this.currentClass) {\n for (let c of this.currentClass.split(\" \"))\n if (c)\n this.dom.classList.remove(c);\n for (let c of cls.split(\" \"))\n if (c)\n this.dom.classList.add(c);\n this.currentClass = cls;\n }\n }\n positioned(space) {\n this.space = space;\n if (this.info)\n this.view.requestMeasure(this.placeInfoReq);\n }\n updateSel() {\n let cState = this.view.state.field(this.stateField), open = cState.open;\n if (open.selected > -1 && open.selected < this.range.from || open.selected >= this.range.to) {\n this.range = rangeAroundSelected(open.options.length, open.selected, this.view.state.facet(completionConfig).maxRenderedOptions);\n this.list.remove();\n this.list = this.dom.appendChild(this.createListBox(open.options, cState.id, this.range));\n this.list.addEventListener(\"scroll\", () => {\n if (this.info)\n this.view.requestMeasure(this.placeInfoReq);\n });\n }\n if (this.updateSelectedOption(open.selected)) {\n this.destroyInfo();\n let { completion } = open.options[open.selected];\n let { info } = completion;\n if (!info)\n return;\n let infoResult = typeof info === \"string\" ? document.createTextNode(info) : info(completion);\n if (!infoResult)\n return;\n if (\"then\" in infoResult) {\n infoResult.then(obj => {\n if (obj && this.view.state.field(this.stateField, false) == cState)\n this.addInfoPane(obj, completion);\n }).catch(e => logException(this.view.state, e, \"completion info\"));\n }\n else {\n this.addInfoPane(infoResult, completion);\n }\n }\n }\n addInfoPane(content, completion) {\n this.destroyInfo();\n let wrap = this.info = document.createElement(\"div\");\n wrap.className = \"cm-tooltip cm-completionInfo\";\n if (content.nodeType != null) {\n wrap.appendChild(content);\n this.infoDestroy = null;\n }\n else {\n let { dom, destroy } = content;\n wrap.appendChild(dom);\n this.infoDestroy = destroy || null;\n }\n this.dom.appendChild(wrap);\n this.view.requestMeasure(this.placeInfoReq);\n }\n updateSelectedOption(selected) {\n let set = null;\n for (let opt = this.list.firstChild, i = this.range.from; opt; opt = opt.nextSibling, i++) {\n if (opt.nodeName != \"LI\" || !opt.id) {\n i--; // A section header\n }\n else if (i == selected) {\n if (!opt.hasAttribute(\"aria-selected\")) {\n opt.setAttribute(\"aria-selected\", \"true\");\n set = opt;\n }\n }\n else {\n if (opt.hasAttribute(\"aria-selected\"))\n opt.removeAttribute(\"aria-selected\");\n }\n }\n if (set)\n scrollIntoView(this.list, set);\n return set;\n }\n measureInfo() {\n let sel = this.dom.querySelector(\"[aria-selected]\");\n if (!sel || !this.info)\n return null;\n let listRect = this.dom.getBoundingClientRect();\n let infoRect = this.info.getBoundingClientRect();\n let selRect = sel.getBoundingClientRect();\n let space = this.space;\n if (!space) {\n let win = this.dom.ownerDocument.defaultView || window;\n space = { left: 0, top: 0, right: win.innerWidth, bottom: win.innerHeight };\n }\n if (selRect.top > Math.min(space.bottom, listRect.bottom) - 10 ||\n selRect.bottom < Math.max(space.top, listRect.top) + 10)\n return null;\n return this.view.state.facet(completionConfig).positionInfo(this.view, listRect, selRect, infoRect, space);\n }\n placeInfo(pos) {\n if (this.info) {\n if (pos) {\n if (pos.style)\n this.info.style.cssText = pos.style;\n this.info.className = \"cm-tooltip cm-completionInfo \" + (pos.class || \"\");\n }\n else {\n this.info.style.cssText = \"top: -1e6px\";\n }\n }\n }\n createListBox(options, id, range) {\n const ul = document.createElement(\"ul\");\n ul.id = id;\n ul.setAttribute(\"role\", \"listbox\");\n ul.setAttribute(\"aria-expanded\", \"true\");\n ul.setAttribute(\"aria-label\", this.view.state.phrase(\"Completions\"));\n let curSection = null;\n for (let i = range.from; i < range.to; i++) {\n let { completion, match } = options[i], { section } = completion;\n if (section) {\n let name = typeof section == \"string\" ? section : section.name;\n if (name != curSection && (i > range.from || range.from == 0)) {\n curSection = name;\n if (typeof section != \"string\" && section.header) {\n ul.appendChild(section.header(section));\n }\n else {\n let header = ul.appendChild(document.createElement(\"completion-section\"));\n header.textContent = name;\n }\n }\n }\n const li = ul.appendChild(document.createElement(\"li\"));\n li.id = id + \"-\" + i;\n li.setAttribute(\"role\", \"option\");\n let cls = this.optionClass(completion);\n if (cls)\n li.className = cls;\n for (let source of this.optionContent) {\n let node = source(completion, this.view.state, match);\n if (node)\n li.appendChild(node);\n }\n }\n if (range.from)\n ul.classList.add(\"cm-completionListIncompleteTop\");\n if (range.to < options.length)\n ul.classList.add(\"cm-completionListIncompleteBottom\");\n return ul;\n }\n destroyInfo() {\n if (this.info) {\n if (this.infoDestroy)\n this.infoDestroy();\n this.info.remove();\n this.info = null;\n }\n }\n destroy() {\n this.destroyInfo();\n }\n}\n// We allocate a new function instance every time the completion\n// changes to force redrawing/repositioning of the tooltip\nfunction completionTooltip(stateField, applyCompletion) {\n return (view) => new CompletionTooltip(view, stateField, applyCompletion);\n}\nfunction scrollIntoView(container, element) {\n let parent = container.getBoundingClientRect();\n let self = element.getBoundingClientRect();\n if (self.top < parent.top)\n container.scrollTop -= parent.top - self.top;\n else if (self.bottom > parent.bottom)\n container.scrollTop += self.bottom - parent.bottom;\n}\n\n// Used to pick a preferred option when two options with the same\n// label occur in the result.\nfunction score(option) {\n return (option.boost || 0) * 100 + (option.apply ? 10 : 0) + (option.info ? 5 : 0) +\n (option.type ? 1 : 0);\n}\nfunction sortOptions(active, state) {\n let options = [];\n let sections = null;\n let addOption = (option) => {\n options.push(option);\n let { section } = option.completion;\n if (section) {\n if (!sections)\n sections = [];\n let name = typeof section == \"string\" ? section : section.name;\n if (!sections.some(s => s.name == name))\n sections.push(typeof section == \"string\" ? { name } : section);\n }\n };\n for (let a of active)\n if (a.hasResult()) {\n if (a.result.filter === false) {\n let getMatch = a.result.getMatch;\n for (let option of a.result.options) {\n let match = [1e9 - options.length];\n if (getMatch)\n for (let n of getMatch(option))\n match.push(n);\n addOption(new Option(option, a.source, match, match[0]));\n }\n }\n else {\n let matcher = new FuzzyMatcher(state.sliceDoc(a.from, a.to)), match;\n for (let option of a.result.options)\n if (match = matcher.match(option.label)) {\n addOption(new Option(option, a.source, match, match[0] + (option.boost || 0)));\n }\n }\n }\n if (sections) {\n let sectionOrder = Object.create(null), pos = 0;\n let cmp = (a, b) => { var _a, _b; return ((_a = a.rank) !== null && _a !== void 0 ? _a : 1e9) - ((_b = b.rank) !== null && _b !== void 0 ? _b : 1e9) || (a.name < b.name ? -1 : 1); };\n for (let s of sections.sort(cmp)) {\n pos -= 1e5;\n sectionOrder[s.name] = pos;\n }\n for (let option of options) {\n let { section } = option.completion;\n if (section)\n option.score += sectionOrder[typeof section == \"string\" ? section : section.name];\n }\n }\n let result = [], prev = null;\n let compare = state.facet(completionConfig).compareCompletions;\n for (let opt of options.sort((a, b) => (b.score - a.score) || compare(a.completion, b.completion))) {\n let cur = opt.completion;\n if (!prev || prev.label != cur.label || prev.detail != cur.detail ||\n (prev.type != null && cur.type != null && prev.type != cur.type) ||\n prev.apply != cur.apply || prev.boost != cur.boost)\n result.push(opt);\n else if (score(opt.completion) > score(prev))\n result[result.length - 1] = opt;\n prev = opt.completion;\n }\n return result;\n}\nclass CompletionDialog {\n constructor(options, attrs, tooltip, timestamp, selected, disabled) {\n this.options = options;\n this.attrs = attrs;\n this.tooltip = tooltip;\n this.timestamp = timestamp;\n this.selected = selected;\n this.disabled = disabled;\n }\n setSelected(selected, id) {\n return selected == this.selected || selected >= this.options.length ? this\n : new CompletionDialog(this.options, makeAttrs(id, selected), this.tooltip, this.timestamp, selected, this.disabled);\n }\n static build(active, state, id, prev, conf) {\n let options = sortOptions(active, state);\n if (!options.length) {\n return prev && active.some(a => a.state == 1 /* Pending */) ?\n new CompletionDialog(prev.options, prev.attrs, prev.tooltip, prev.timestamp, prev.selected, true) : null;\n }\n let selected = state.facet(completionConfig).selectOnOpen ? 0 : -1;\n if (prev && prev.selected != selected && prev.selected != -1) {\n let selectedValue = prev.options[prev.selected].completion;\n for (let i = 0; i < options.length; i++)\n if (options[i].completion == selectedValue) {\n selected = i;\n break;\n }\n }\n return new CompletionDialog(options, makeAttrs(id, selected), {\n pos: active.reduce((a, b) => b.hasResult() ? Math.min(a, b.from) : a, 1e8),\n create: completionTooltip(completionState, applyCompletion),\n above: conf.aboveCursor,\n }, prev ? prev.timestamp : Date.now(), selected, false);\n }\n map(changes) {\n return new CompletionDialog(this.options, this.attrs, Object.assign(Object.assign({}, this.tooltip), { pos: changes.mapPos(this.tooltip.pos) }), this.timestamp, this.selected, this.disabled);\n }\n}\nclass CompletionState {\n constructor(active, id, open) {\n this.active = active;\n this.id = id;\n this.open = open;\n }\n static start() {\n return new CompletionState(none, \"cm-ac-\" + Math.floor(Math.random() * 2e6).toString(36), null);\n }\n update(tr) {\n let { state } = tr, conf = state.facet(completionConfig);\n let sources = conf.override ||\n state.languageDataAt(\"autocomplete\", cur(state)).map(asSource);\n let active = sources.map(source => {\n let value = this.active.find(s => s.source == source) ||\n new ActiveSource(source, this.active.some(a => a.state != 0 /* Inactive */) ? 1 /* Pending */ : 0 /* Inactive */);\n return value.update(tr, conf);\n });\n if (active.length == this.active.length && active.every((a, i) => a == this.active[i]))\n active = this.active;\n let open = this.open;\n if (open && tr.docChanged)\n open = open.map(tr.changes);\n if (tr.selection || active.some(a => a.hasResult() && tr.changes.touchesRange(a.from, a.to)) ||\n !sameResults(active, this.active))\n open = CompletionDialog.build(active, state, this.id, open, conf);\n else if (open && open.disabled && !active.some(a => a.state == 1 /* Pending */))\n open = null;\n if (!open && active.every(a => a.state != 1 /* Pending */) && active.some(a => a.hasResult()))\n active = active.map(a => a.hasResult() ? new ActiveSource(a.source, 0 /* Inactive */) : a);\n for (let effect of tr.effects)\n if (effect.is(setSelectedEffect))\n open = open && open.setSelected(effect.value, this.id);\n return active == this.active && open == this.open ? this : new CompletionState(active, this.id, open);\n }\n get tooltip() { return this.open ? this.open.tooltip : null; }\n get attrs() { return this.open ? this.open.attrs : baseAttrs; }\n}\nfunction sameResults(a, b) {\n if (a == b)\n return true;\n for (let iA = 0, iB = 0;;) {\n while (iA < a.length && !a[iA].hasResult)\n iA++;\n while (iB < b.length && !b[iB].hasResult)\n iB++;\n let endA = iA == a.length, endB = iB == b.length;\n if (endA || endB)\n return endA == endB;\n if (a[iA++].result != b[iB++].result)\n return false;\n }\n}\nconst baseAttrs = {\n \"aria-autocomplete\": \"list\"\n};\nfunction makeAttrs(id, selected) {\n let result = {\n \"aria-autocomplete\": \"list\",\n \"aria-haspopup\": \"listbox\",\n \"aria-controls\": id\n };\n if (selected > -1)\n result[\"aria-activedescendant\"] = id + \"-\" + selected;\n return result;\n}\nconst none = [];\nfunction getUserEvent(tr) {\n return tr.isUserEvent(\"input.type\") ? \"input\" : tr.isUserEvent(\"delete.backward\") ? \"delete\" : null;\n}\nclass ActiveSource {\n constructor(source, state, explicitPos = -1) {\n this.source = source;\n this.state = state;\n this.explicitPos = explicitPos;\n }\n hasResult() { return false; }\n update(tr, conf) {\n let event = getUserEvent(tr), value = this;\n if (event)\n value = value.handleUserEvent(tr, event, conf);\n else if (tr.docChanged)\n value = value.handleChange(tr);\n else if (tr.selection && value.state != 0 /* Inactive */)\n value = new ActiveSource(value.source, 0 /* Inactive */);\n for (let effect of tr.effects) {\n if (effect.is(startCompletionEffect))\n value = new ActiveSource(value.source, 1 /* Pending */, effect.value ? cur(tr.state) : -1);\n else if (effect.is(closeCompletionEffect))\n value = new ActiveSource(value.source, 0 /* Inactive */);\n else if (effect.is(setActiveEffect))\n for (let active of effect.value)\n if (active.source == value.source)\n value = active;\n }\n return value;\n }\n handleUserEvent(tr, type, conf) {\n return type == \"delete\" || !conf.activateOnTyping ? this.map(tr.changes) : new ActiveSource(this.source, 1 /* Pending */);\n }\n handleChange(tr) {\n return tr.changes.touchesRange(cur(tr.startState)) ? new ActiveSource(this.source, 0 /* Inactive */) : this.map(tr.changes);\n }\n map(changes) {\n return changes.empty || this.explicitPos < 0 ? this : new ActiveSource(this.source, this.state, changes.mapPos(this.explicitPos));\n }\n}\nclass ActiveResult extends ActiveSource {\n constructor(source, explicitPos, result, from, to) {\n super(source, 2 /* Result */, explicitPos);\n this.result = result;\n this.from = from;\n this.to = to;\n }\n hasResult() { return true; }\n handleUserEvent(tr, type, conf) {\n var _a;\n let from = tr.changes.mapPos(this.from), to = tr.changes.mapPos(this.to, 1);\n let pos = cur(tr.state);\n if ((this.explicitPos < 0 ? pos <= from : pos < this.from) ||\n pos > to ||\n type == \"delete\" && cur(tr.startState) == this.from)\n return new ActiveSource(this.source, type == \"input\" && conf.activateOnTyping ? 1 /* Pending */ : 0 /* Inactive */);\n let explicitPos = this.explicitPos < 0 ? -1 : tr.changes.mapPos(this.explicitPos), updated;\n if (checkValid(this.result.validFor, tr.state, from, to))\n return new ActiveResult(this.source, explicitPos, this.result, from, to);\n if (this.result.update &&\n (updated = this.result.update(this.result, from, to, new CompletionContext(tr.state, pos, explicitPos >= 0))))\n return new ActiveResult(this.source, explicitPos, updated, updated.from, (_a = updated.to) !== null && _a !== void 0 ? _a : cur(tr.state));\n return new ActiveSource(this.source, 1 /* Pending */, explicitPos);\n }\n handleChange(tr) {\n return tr.changes.touchesRange(this.from, this.to) ? new ActiveSource(this.source, 0 /* Inactive */) : this.map(tr.changes);\n }\n map(mapping) {\n return mapping.empty ? this :\n new ActiveResult(this.source, this.explicitPos < 0 ? -1 : mapping.mapPos(this.explicitPos), this.result, mapping.mapPos(this.from), mapping.mapPos(this.to, 1));\n }\n}\nfunction checkValid(validFor, state, from, to) {\n if (!validFor)\n return false;\n let text = state.sliceDoc(from, to);\n return typeof validFor == \"function\" ? validFor(text, from, to, state) : ensureAnchor(validFor, true).test(text);\n}\nconst setActiveEffect = /*@__PURE__*/StateEffect.define({\n map(sources, mapping) { return sources.map(s => s.map(mapping)); }\n});\nconst setSelectedEffect = /*@__PURE__*/StateEffect.define();\nconst completionState = /*@__PURE__*/StateField.define({\n create() { return CompletionState.start(); },\n update(value, tr) { return value.update(tr); },\n provide: f => [\n showTooltip.from(f, val => val.tooltip),\n EditorView.contentAttributes.from(f, state => state.attrs)\n ]\n});\nfunction applyCompletion(view, option) {\n const apply = option.completion.apply || option.completion.label;\n let result = view.state.field(completionState).active.find(a => a.source == option.source);\n if (!(result instanceof ActiveResult))\n return false;\n if (typeof apply == \"string\")\n view.dispatch(Object.assign(Object.assign({}, insertCompletionText(view.state, apply, result.from, result.to)), { annotations: pickedCompletion.of(option.completion) }));\n else\n apply(view, option.completion, result.from, result.to);\n return true;\n}\n\n/**\nReturns a command that moves the completion selection forward or\nbackward by the given amount.\n*/\nfunction moveCompletionSelection(forward, by = \"option\") {\n return (view) => {\n let cState = view.state.field(completionState, false);\n if (!cState || !cState.open || cState.open.disabled ||\n Date.now() - cState.open.timestamp < view.state.facet(completionConfig).interactionDelay)\n return false;\n let step = 1, tooltip;\n if (by == \"page\" && (tooltip = getTooltip(view, cState.open.tooltip)))\n step = Math.max(2, Math.floor(tooltip.dom.offsetHeight /\n tooltip.dom.querySelector(\"li\").offsetHeight) - 1);\n let { length } = cState.open.options;\n let selected = cState.open.selected > -1 ? cState.open.selected + step * (forward ? 1 : -1) : forward ? 0 : length - 1;\n if (selected < 0)\n selected = by == \"page\" ? 0 : length - 1;\n else if (selected >= length)\n selected = by == \"page\" ? length - 1 : 0;\n view.dispatch({ effects: setSelectedEffect.of(selected) });\n return true;\n };\n}\n/**\nAccept the current completion.\n*/\nconst acceptCompletion = (view) => {\n let cState = view.state.field(completionState, false);\n if (view.state.readOnly || !cState || !cState.open || cState.open.selected < 0 || cState.open.disabled ||\n Date.now() - cState.open.timestamp < view.state.facet(completionConfig).interactionDelay)\n return false;\n return applyCompletion(view, cState.open.options[cState.open.selected]);\n};\n/**\nExplicitly start autocompletion.\n*/\nconst startCompletion = (view) => {\n let cState = view.state.field(completionState, false);\n if (!cState)\n return false;\n view.dispatch({ effects: startCompletionEffect.of(true) });\n return true;\n};\n/**\nClose the currently active completion.\n*/\nconst closeCompletion = (view) => {\n let cState = view.state.field(completionState, false);\n if (!cState || !cState.active.some(a => a.state != 0 /* Inactive */))\n return false;\n view.dispatch({ effects: closeCompletionEffect.of(null) });\n return true;\n};\nclass RunningQuery {\n constructor(active, context) {\n this.active = active;\n this.context = context;\n this.time = Date.now();\n this.updates = [];\n // Note that 'undefined' means 'not done yet', whereas 'null' means\n // 'query returned null'.\n this.done = undefined;\n }\n}\nconst DebounceTime = 50, MaxUpdateCount = 50, MinAbortTime = 1000;\nconst completionPlugin = /*@__PURE__*/ViewPlugin.fromClass(class {\n constructor(view) {\n this.view = view;\n this.debounceUpdate = -1;\n this.running = [];\n this.debounceAccept = -1;\n this.composing = 0 /* None */;\n for (let active of view.state.field(completionState).active)\n if (active.state == 1 /* Pending */)\n this.startQuery(active);\n }\n update(update) {\n let cState = update.state.field(completionState);\n if (!update.selectionSet && !update.docChanged && update.startState.field(completionState) == cState)\n return;\n let doesReset = update.transactions.some(tr => {\n return (tr.selection || tr.docChanged) && !getUserEvent(tr);\n });\n for (let i = 0; i < this.running.length; i++) {\n let query = this.running[i];\n if (doesReset ||\n query.updates.length + update.transactions.length > MaxUpdateCount && Date.now() - query.time > MinAbortTime) {\n for (let handler of query.context.abortListeners) {\n try {\n handler();\n }\n catch (e) {\n logException(this.view.state, e);\n }\n }\n query.context.abortListeners = null;\n this.running.splice(i--, 1);\n }\n else {\n query.updates.push(...update.transactions);\n }\n }\n if (this.debounceUpdate > -1)\n clearTimeout(this.debounceUpdate);\n this.debounceUpdate = cState.active.some(a => a.state == 1 /* Pending */ && !this.running.some(q => q.active.source == a.source))\n ? setTimeout(() => this.startUpdate(), DebounceTime) : -1;\n if (this.composing != 0 /* None */)\n for (let tr of update.transactions) {\n if (getUserEvent(tr) == \"input\")\n this.composing = 2 /* Changed */;\n else if (this.composing == 2 /* Changed */ && tr.selection)\n this.composing = 3 /* ChangedAndMoved */;\n }\n }\n startUpdate() {\n this.debounceUpdate = -1;\n let { state } = this.view, cState = state.field(completionState);\n for (let active of cState.active) {\n if (active.state == 1 /* Pending */ && !this.running.some(r => r.active.source == active.source))\n this.startQuery(active);\n }\n }\n startQuery(active) {\n let { state } = this.view, pos = cur(state);\n let context = new CompletionContext(state, pos, active.explicitPos == pos);\n let pending = new RunningQuery(active, context);\n this.running.push(pending);\n Promise.resolve(active.source(context)).then(result => {\n if (!pending.context.aborted) {\n pending.done = result || null;\n this.scheduleAccept();\n }\n }, err => {\n this.view.dispatch({ effects: closeCompletionEffect.of(null) });\n logException(this.view.state, err);\n });\n }\n scheduleAccept() {\n if (this.running.every(q => q.done !== undefined))\n this.accept();\n else if (this.debounceAccept < 0)\n this.debounceAccept = setTimeout(() => this.accept(), DebounceTime);\n }\n // For each finished query in this.running, try to create a result\n // or, if appropriate, restart the query.\n accept() {\n var _a;\n if (this.debounceAccept > -1)\n clearTimeout(this.debounceAccept);\n this.debounceAccept = -1;\n let updated = [];\n let conf = this.view.state.facet(completionConfig);\n for (let i = 0; i < this.running.length; i++) {\n let query = this.running[i];\n if (query.done === undefined)\n continue;\n this.running.splice(i--, 1);\n if (query.done) {\n let active = new ActiveResult(query.active.source, query.active.explicitPos, query.done, query.done.from, (_a = query.done.to) !== null && _a !== void 0 ? _a : cur(query.updates.length ? query.updates[0].startState : this.view.state));\n // Replay the transactions that happened since the start of\n // the request and see if that preserves the result\n for (let tr of query.updates)\n active = active.update(tr, conf);\n if (active.hasResult()) {\n updated.push(active);\n continue;\n }\n }\n let current = this.view.state.field(completionState).active.find(a => a.source == query.active.source);\n if (current && current.state == 1 /* Pending */) {\n if (query.done == null) {\n // Explicitly failed. Should clear the pending status if it\n // hasn't been re-set in the meantime.\n let active = new ActiveSource(query.active.source, 0 /* Inactive */);\n for (let tr of query.updates)\n active = active.update(tr, conf);\n if (active.state != 1 /* Pending */)\n updated.push(active);\n }\n else {\n // Cleared by subsequent transactions. Restart.\n this.startQuery(current);\n }\n }\n }\n if (updated.length)\n this.view.dispatch({ effects: setActiveEffect.of(updated) });\n }\n}, {\n eventHandlers: {\n blur(event) {\n let state = this.view.state.field(completionState, false);\n if (state && state.tooltip && this.view.state.facet(completionConfig).closeOnBlur) {\n let dialog = state.open && getTooltip(this.view, state.open.tooltip);\n if (!dialog || !dialog.dom.contains(event.relatedTarget))\n this.view.dispatch({ effects: closeCompletionEffect.of(null) });\n }\n },\n compositionstart() {\n this.composing = 1 /* Started */;\n },\n compositionend() {\n if (this.composing == 3 /* ChangedAndMoved */) {\n // Safari fires compositionend events synchronously, possibly\n // from inside an update, so dispatch asynchronously to avoid reentrancy\n setTimeout(() => this.view.dispatch({ effects: startCompletionEffect.of(false) }), 20);\n }\n this.composing = 0 /* None */;\n }\n }\n});\n\nconst baseTheme = /*@__PURE__*/EditorView.baseTheme({\n \".cm-tooltip.cm-tooltip-autocomplete\": {\n \"& > ul\": {\n fontFamily: \"monospace\",\n whiteSpace: \"nowrap\",\n overflow: \"hidden auto\",\n maxWidth_fallback: \"700px\",\n maxWidth: \"min(700px, 95vw)\",\n minWidth: \"250px\",\n maxHeight: \"10em\",\n height: \"100%\",\n listStyle: \"none\",\n margin: 0,\n padding: 0,\n \"& > li, & > completion-section\": {\n padding: \"1px 3px\",\n lineHeight: 1.2\n },\n \"& > li\": {\n overflowX: \"hidden\",\n textOverflow: \"ellipsis\",\n cursor: \"pointer\"\n },\n \"& > completion-section\": {\n display: \"list-item\",\n borderBottom: \"1px solid silver\",\n paddingLeft: \"0.5em\",\n opacity: 0.7\n }\n }\n },\n \"&light .cm-tooltip-autocomplete ul li[aria-selected]\": {\n background: \"#17c\",\n color: \"white\",\n },\n \"&light .cm-tooltip-autocomplete-disabled ul li[aria-selected]\": {\n background: \"#777\",\n },\n \"&dark .cm-tooltip-autocomplete ul li[aria-selected]\": {\n background: \"#347\",\n color: \"white\",\n },\n \"&dark .cm-tooltip-autocomplete-disabled ul li[aria-selected]\": {\n background: \"#444\",\n },\n \".cm-completionListIncompleteTop:before, .cm-completionListIncompleteBottom:after\": {\n content: '\"\u00B7\u00B7\u00B7\"',\n opacity: 0.5,\n display: \"block\",\n textAlign: \"center\"\n },\n \".cm-tooltip.cm-completionInfo\": {\n position: \"absolute\",\n padding: \"3px 9px\",\n width: \"max-content\",\n maxWidth: `${400 /* Width */}px`,\n boxSizing: \"border-box\"\n },\n \".cm-completionInfo.cm-completionInfo-left\": { right: \"100%\" },\n \".cm-completionInfo.cm-completionInfo-right\": { left: \"100%\" },\n \".cm-completionInfo.cm-completionInfo-left-narrow\": { right: `${30 /* Margin */}px` },\n \".cm-completionInfo.cm-completionInfo-right-narrow\": { left: `${30 /* Margin */}px` },\n \"&light .cm-snippetField\": { backgroundColor: \"#00000022\" },\n \"&dark .cm-snippetField\": { backgroundColor: \"#ffffff22\" },\n \".cm-snippetFieldPosition\": {\n verticalAlign: \"text-top\",\n width: 0,\n height: \"1.15em\",\n display: \"inline-block\",\n margin: \"0 -0.7px -.7em\",\n borderLeft: \"1.4px dotted #888\"\n },\n \".cm-completionMatchedText\": {\n textDecoration: \"underline\"\n },\n \".cm-completionDetail\": {\n marginLeft: \"0.5em\",\n fontStyle: \"italic\"\n },\n \".cm-completionIcon\": {\n fontSize: \"90%\",\n width: \".8em\",\n display: \"inline-block\",\n textAlign: \"center\",\n paddingRight: \".6em\",\n opacity: \"0.6\",\n boxSizing: \"content-box\"\n },\n \".cm-completionIcon-function, .cm-completionIcon-method\": {\n \"&:after\": { content: \"'\u0192'\" }\n },\n \".cm-completionIcon-class\": {\n \"&:after\": { content: \"'\u25CB'\" }\n },\n \".cm-completionIcon-interface\": {\n \"&:after\": { content: \"'\u25CC'\" }\n },\n \".cm-completionIcon-variable\": {\n \"&:after\": { content: \"'\uD835\uDC65'\" }\n },\n \".cm-completionIcon-constant\": {\n \"&:after\": { content: \"'\uD835\uDC36'\" }\n },\n \".cm-completionIcon-type\": {\n \"&:after\": { content: \"'\uD835\uDC61'\" }\n },\n \".cm-completionIcon-enum\": {\n \"&:after\": { content: \"'\u222A'\" }\n },\n \".cm-completionIcon-property\": {\n \"&:after\": { content: \"'\u25A1'\" }\n },\n \".cm-completionIcon-keyword\": {\n \"&:after\": { content: \"'\uD83D\uDD11\\uFE0E'\" } // Disable emoji rendering\n },\n \".cm-completionIcon-namespace\": {\n \"&:after\": { content: \"'\u25A2'\" }\n },\n \".cm-completionIcon-text\": {\n \"&:after\": { content: \"'abc'\", fontSize: \"50%\", verticalAlign: \"middle\" }\n }\n});\n\nclass FieldPos {\n constructor(field, line, from, to) {\n this.field = field;\n this.line = line;\n this.from = from;\n this.to = to;\n }\n}\nclass FieldRange {\n constructor(field, from, to) {\n this.field = field;\n this.from = from;\n this.to = to;\n }\n map(changes) {\n let from = changes.mapPos(this.from, -1, MapMode.TrackDel);\n let to = changes.mapPos(this.to, 1, MapMode.TrackDel);\n return from == null || to == null ? null : new FieldRange(this.field, from, to);\n }\n}\nclass Snippet {\n constructor(lines, fieldPositions) {\n this.lines = lines;\n this.fieldPositions = fieldPositions;\n }\n instantiate(state, pos) {\n let text = [], lineStart = [pos];\n let lineObj = state.doc.lineAt(pos), baseIndent = /^\\s*/.exec(lineObj.text)[0];\n for (let line of this.lines) {\n if (text.length) {\n let indent = baseIndent, tabs = /^\\t*/.exec(line)[0].length;\n for (let i = 0; i < tabs; i++)\n indent += state.facet(indentUnit);\n lineStart.push(pos + indent.length - tabs);\n line = indent + line.slice(tabs);\n }\n text.push(line);\n pos += line.length + 1;\n }\n let ranges = this.fieldPositions.map(pos => new FieldRange(pos.field, lineStart[pos.line] + pos.from, lineStart[pos.line] + pos.to));\n return { text, ranges };\n }\n static parse(template) {\n let fields = [];\n let lines = [], positions = [], m;\n for (let line of template.split(/\\r\\n?|\\n/)) {\n while (m = /[#$]\\{(?:(\\d+)(?::([^}]*))?|([^}]*))\\}/.exec(line)) {\n let seq = m[1] ? +m[1] : null, name = m[2] || m[3] || \"\", found = -1;\n for (let i = 0; i < fields.length; i++) {\n if (seq != null ? fields[i].seq == seq : name ? fields[i].name == name : false)\n found = i;\n }\n if (found < 0) {\n let i = 0;\n while (i < fields.length && (seq == null || (fields[i].seq != null && fields[i].seq < seq)))\n i++;\n fields.splice(i, 0, { seq, name });\n found = i;\n for (let pos of positions)\n if (pos.field >= found)\n pos.field++;\n }\n positions.push(new FieldPos(found, lines.length, m.index, m.index + name.length));\n line = line.slice(0, m.index) + name + line.slice(m.index + m[0].length);\n }\n for (let esc; esc = /\\\\([{}])/.exec(line);) {\n line = line.slice(0, esc.index) + esc[1] + line.slice(esc.index + esc[0].length);\n for (let pos of positions)\n if (pos.line == lines.length && pos.from > esc.index) {\n pos.from--;\n pos.to--;\n }\n }\n lines.push(line);\n }\n return new Snippet(lines, positions);\n }\n}\nlet fieldMarker = /*@__PURE__*/Decoration.widget({ widget: /*@__PURE__*/new class extends WidgetType {\n toDOM() {\n let span = document.createElement(\"span\");\n span.className = \"cm-snippetFieldPosition\";\n return span;\n }\n ignoreEvent() { return false; }\n } });\nlet fieldRange = /*@__PURE__*/Decoration.mark({ class: \"cm-snippetField\" });\nclass ActiveSnippet {\n constructor(ranges, active) {\n this.ranges = ranges;\n this.active = active;\n this.deco = Decoration.set(ranges.map(r => (r.from == r.to ? fieldMarker : fieldRange).range(r.from, r.to)));\n }\n map(changes) {\n let ranges = [];\n for (let r of this.ranges) {\n let mapped = r.map(changes);\n if (!mapped)\n return null;\n ranges.push(mapped);\n }\n return new ActiveSnippet(ranges, this.active);\n }\n selectionInsideField(sel) {\n return sel.ranges.every(range => this.ranges.some(r => r.field == this.active && r.from <= range.from && r.to >= range.to));\n }\n}\nconst setActive = /*@__PURE__*/StateEffect.define({\n map(value, changes) { return value && value.map(changes); }\n});\nconst moveToField = /*@__PURE__*/StateEffect.define();\nconst snippetState = /*@__PURE__*/StateField.define({\n create() { return null; },\n update(value, tr) {\n for (let effect of tr.effects) {\n if (effect.is(setActive))\n return effect.value;\n if (effect.is(moveToField) && value)\n return new ActiveSnippet(value.ranges, effect.value);\n }\n if (value && tr.docChanged)\n value = value.map(tr.changes);\n if (value && tr.selection && !value.selectionInsideField(tr.selection))\n value = null;\n return value;\n },\n provide: f => EditorView.decorations.from(f, val => val ? val.deco : Decoration.none)\n});\nfunction fieldSelection(ranges, field) {\n return EditorSelection.create(ranges.filter(r => r.field == field).map(r => EditorSelection.range(r.from, r.to)));\n}\n/**\nConvert a snippet template to a function that can\n[apply](https://codemirror.net/6/docs/ref/#autocomplete.Completion.apply) it. Snippets are written\nusing syntax like this:\n\n \"for (let ${index} = 0; ${index} < ${end}; ${index}++) {\\n\\t${}\\n}\"\n\nEach `${}` placeholder (you may also use `#{}`) indicates a field\nthat the user can fill in. Its name, if any, will be the default\ncontent for the field.\n\nWhen the snippet is activated by calling the returned function,\nthe code is inserted at the given position. Newlines in the\ntemplate are indented by the indentation of the start line, plus\none [indent unit](https://codemirror.net/6/docs/ref/#language.indentUnit) per tab character after\nthe newline.\n\nOn activation, (all instances of) the first field are selected.\nThe user can move between fields with Tab and Shift-Tab as long as\nthe fields are active. Moving to the last field or moving the\ncursor out of the current field deactivates the fields.\n\nThe order of fields defaults to textual order, but you can add\nnumbers to placeholders (`${1}` or `${1:defaultText}`) to provide\na custom order.\n\nTo include a literal `{` or `}` in your template, put a backslash\nin front of it. This will be removed and the brace will not be\ninterpreted as indicating a placeholder.\n*/\nfunction snippet(template) {\n let snippet = Snippet.parse(template);\n return (editor, completion, from, to) => {\n let { text, ranges } = snippet.instantiate(editor.state, from);\n let spec = {\n changes: { from, to, insert: Text.of(text) },\n scrollIntoView: true,\n annotations: completion ? pickedCompletion.of(completion) : undefined\n };\n if (ranges.length)\n spec.selection = fieldSelection(ranges, 0);\n if (ranges.length > 1) {\n let active = new ActiveSnippet(ranges, 0);\n let effects = spec.effects = [setActive.of(active)];\n if (editor.state.field(snippetState, false) === undefined)\n effects.push(StateEffect.appendConfig.of([snippetState, addSnippetKeymap, snippetPointerHandler, baseTheme]));\n }\n editor.dispatch(editor.state.update(spec));\n };\n}\nfunction moveField(dir) {\n return ({ state, dispatch }) => {\n let active = state.field(snippetState, false);\n if (!active || dir < 0 && active.active == 0)\n return false;\n let next = active.active + dir, last = dir > 0 && !active.ranges.some(r => r.field == next + dir);\n dispatch(state.update({\n selection: fieldSelection(active.ranges, next),\n effects: setActive.of(last ? null : new ActiveSnippet(active.ranges, next))\n }));\n return true;\n };\n}\n/**\nA command that clears the active snippet, if any.\n*/\nconst clearSnippet = ({ state, dispatch }) => {\n let active = state.field(snippetState, false);\n if (!active)\n return false;\n dispatch(state.update({ effects: setActive.of(null) }));\n return true;\n};\n/**\nMove to the next snippet field, if available.\n*/\nconst nextSnippetField = /*@__PURE__*/moveField(1);\n/**\nMove to the previous snippet field, if available.\n*/\nconst prevSnippetField = /*@__PURE__*/moveField(-1);\n/**\nCheck if there is an active snippet with a next field for\n`nextSnippetField` to move to.\n*/\nfunction hasNextSnippetField(state) {\n let active = state.field(snippetState, false);\n return !!(active && active.ranges.some(r => r.field == active.active + 1));\n}\n/**\nReturns true if there is an active snippet and a previous field\nfor `prevSnippetField` to move to.\n*/\nfunction hasPrevSnippetField(state) {\n let active = state.field(snippetState, false);\n return !!(active && active.active > 0);\n}\nconst defaultSnippetKeymap = [\n { key: \"Tab\", run: nextSnippetField, shift: prevSnippetField },\n { key: \"Escape\", run: clearSnippet }\n];\n/**\nA facet that can be used to configure the key bindings used by\nsnippets. The default binds Tab to\n[`nextSnippetField`](https://codemirror.net/6/docs/ref/#autocomplete.nextSnippetField), Shift-Tab to\n[`prevSnippetField`](https://codemirror.net/6/docs/ref/#autocomplete.prevSnippetField), and Escape\nto [`clearSnippet`](https://codemirror.net/6/docs/ref/#autocomplete.clearSnippet).\n*/\nconst snippetKeymap = /*@__PURE__*/Facet.define({\n combine(maps) { return maps.length ? maps[0] : defaultSnippetKeymap; }\n});\nconst addSnippetKeymap = /*@__PURE__*/Prec.highest(/*@__PURE__*/keymap.compute([snippetKeymap], state => state.facet(snippetKeymap)));\n/**\nCreate a completion from a snippet. Returns an object with the\nproperties from `completion`, plus an `apply` function that\napplies the snippet.\n*/\nfunction snippetCompletion(template, completion) {\n return Object.assign(Object.assign({}, completion), { apply: snippet(template) });\n}\nconst snippetPointerHandler = /*@__PURE__*/EditorView.domEventHandlers({\n mousedown(event, view) {\n let active = view.state.field(snippetState, false), pos;\n if (!active || (pos = view.posAtCoords({ x: event.clientX, y: event.clientY })) == null)\n return false;\n let match = active.ranges.find(r => r.from <= pos && r.to >= pos);\n if (!match || match.field == active.active)\n return false;\n view.dispatch({\n selection: fieldSelection(active.ranges, match.field),\n effects: setActive.of(active.ranges.some(r => r.field > match.field) ? new ActiveSnippet(active.ranges, match.field) : null)\n });\n return true;\n }\n});\n\nfunction wordRE(wordChars) {\n let escaped = wordChars.replace(/[\\\\[.+*?(){|^$]/g, \"\\\\$&\");\n try {\n return new RegExp(`[\\\\p{Alphabetic}\\\\p{Number}_${escaped}]+`, \"ug\");\n }\n catch (_a) {\n return new RegExp(`[\\w${escaped}]`, \"g\");\n }\n}\nfunction mapRE(re, f) {\n return new RegExp(f(re.source), re.unicode ? \"u\" : \"\");\n}\nconst wordCaches = /*@__PURE__*/Object.create(null);\nfunction wordCache(wordChars) {\n return wordCaches[wordChars] || (wordCaches[wordChars] = new WeakMap);\n}\nfunction storeWords(doc, wordRE, result, seen, ignoreAt) {\n for (let lines = doc.iterLines(), pos = 0; !lines.next().done;) {\n let { value } = lines, m;\n wordRE.lastIndex = 0;\n while (m = wordRE.exec(value)) {\n if (!seen[m[0]] && pos + m.index != ignoreAt) {\n result.push({ type: \"text\", label: m[0] });\n seen[m[0]] = true;\n if (result.length >= 2000 /* MaxList */)\n return;\n }\n }\n pos += value.length + 1;\n }\n}\nfunction collectWords(doc, cache, wordRE, to, ignoreAt) {\n let big = doc.length >= 1000 /* MinCacheLen */;\n let cached = big && cache.get(doc);\n if (cached)\n return cached;\n let result = [], seen = Object.create(null);\n if (doc.children) {\n let pos = 0;\n for (let ch of doc.children) {\n if (ch.length >= 1000 /* MinCacheLen */) {\n for (let c of collectWords(ch, cache, wordRE, to - pos, ignoreAt - pos)) {\n if (!seen[c.label]) {\n seen[c.label] = true;\n result.push(c);\n }\n }\n }\n else {\n storeWords(ch, wordRE, result, seen, ignoreAt - pos);\n }\n pos += ch.length + 1;\n }\n }\n else {\n storeWords(doc, wordRE, result, seen, ignoreAt);\n }\n if (big && result.length < 2000 /* MaxList */)\n cache.set(doc, result);\n return result;\n}\n/**\nA completion source that will scan the document for words (using a\n[character categorizer](https://codemirror.net/6/docs/ref/#state.EditorState.charCategorizer)), and\nreturn those as completions.\n*/\nconst completeAnyWord = context => {\n let wordChars = context.state.languageDataAt(\"wordChars\", context.pos).join(\"\");\n let re = wordRE(wordChars);\n let token = context.matchBefore(mapRE(re, s => s + \"$\"));\n if (!token && !context.explicit)\n return null;\n let from = token ? token.from : context.pos;\n let options = collectWords(context.state.doc, wordCache(wordChars), re, 50000 /* Range */, from);\n return { from, options, validFor: mapRE(re, s => \"^\" + s) };\n};\n\nconst defaults = {\n brackets: [\"(\", \"[\", \"{\", \"'\", '\"'],\n before: \")]}:;>\",\n stringPrefixes: []\n};\nconst closeBracketEffect = /*@__PURE__*/StateEffect.define({\n map(value, mapping) {\n let mapped = mapping.mapPos(value, -1, MapMode.TrackAfter);\n return mapped == null ? undefined : mapped;\n }\n});\nconst closedBracket = /*@__PURE__*/new class extends RangeValue {\n};\nclosedBracket.startSide = 1;\nclosedBracket.endSide = -1;\nconst bracketState = /*@__PURE__*/StateField.define({\n create() { return RangeSet.empty; },\n update(value, tr) {\n if (tr.selection) {\n let lineStart = tr.state.doc.lineAt(tr.selection.main.head).from;\n let prevLineStart = tr.startState.doc.lineAt(tr.startState.selection.main.head).from;\n if (lineStart != tr.changes.mapPos(prevLineStart, -1))\n value = RangeSet.empty;\n }\n value = value.map(tr.changes);\n for (let effect of tr.effects)\n if (effect.is(closeBracketEffect))\n value = value.update({ add: [closedBracket.range(effect.value, effect.value + 1)] });\n return value;\n }\n});\n/**\nExtension to enable bracket-closing behavior. When a closeable\nbracket is typed, its closing bracket is immediately inserted\nafter the cursor. When closing a bracket directly in front of a\nclosing bracket inserted by the extension, the cursor moves over\nthat bracket.\n*/\nfunction closeBrackets() {\n return [inputHandler, bracketState];\n}\nconst definedClosing = \"()[]{}<>\";\nfunction closing(ch) {\n for (let i = 0; i < definedClosing.length; i += 2)\n if (definedClosing.charCodeAt(i) == ch)\n return definedClosing.charAt(i + 1);\n return fromCodePoint(ch < 128 ? ch : ch + 1);\n}\nfunction config(state, pos) {\n return state.languageDataAt(\"closeBrackets\", pos)[0] || defaults;\n}\nconst android = typeof navigator == \"object\" && /*@__PURE__*//Android\\b/.test(navigator.userAgent);\nconst inputHandler = /*@__PURE__*/EditorView.inputHandler.of((view, from, to, insert) => {\n if ((android ? view.composing : view.compositionStarted) || view.state.readOnly)\n return false;\n let sel = view.state.selection.main;\n if (insert.length > 2 || insert.length == 2 && codePointSize(codePointAt(insert, 0)) == 1 ||\n from != sel.from || to != sel.to)\n return false;\n let tr = insertBracket(view.state, insert);\n if (!tr)\n return false;\n view.dispatch(tr);\n return true;\n});\n/**\nCommand that implements deleting a pair of matching brackets when\nthe cursor is between them.\n*/\nconst deleteBracketPair = ({ state, dispatch }) => {\n if (state.readOnly)\n return false;\n let conf = config(state, state.selection.main.head);\n let tokens = conf.brackets || defaults.brackets;\n let dont = null, changes = state.changeByRange(range => {\n if (range.empty) {\n let before = prevChar(state.doc, range.head);\n for (let token of tokens) {\n if (token == before && nextChar(state.doc, range.head) == closing(codePointAt(token, 0)))\n return { changes: { from: range.head - token.length, to: range.head + token.length },\n range: EditorSelection.cursor(range.head - token.length) };\n }\n }\n return { range: dont = range };\n });\n if (!dont)\n dispatch(state.update(changes, { scrollIntoView: true, userEvent: \"delete.backward\" }));\n return !dont;\n};\n/**\nClose-brackets related key bindings. Binds Backspace to\n[`deleteBracketPair`](https://codemirror.net/6/docs/ref/#autocomplete.deleteBracketPair).\n*/\nconst closeBracketsKeymap = [\n { key: \"Backspace\", run: deleteBracketPair }\n];\n/**\nImplements the extension's behavior on text insertion. If the\ngiven string counts as a bracket in the language around the\nselection, and replacing the selection with it requires custom\nbehavior (inserting a closing version or skipping past a\npreviously-closed bracket), this function returns a transaction\nrepresenting that custom behavior. (You only need this if you want\nto programmatically insert brackets\u2014the\n[`closeBrackets`](https://codemirror.net/6/docs/ref/#autocomplete.closeBrackets) extension will\ntake care of running this for user input.)\n*/\nfunction insertBracket(state, bracket) {\n let conf = config(state, state.selection.main.head);\n let tokens = conf.brackets || defaults.brackets;\n for (let tok of tokens) {\n let closed = closing(codePointAt(tok, 0));\n if (bracket == tok)\n return closed == tok ? handleSame(state, tok, tokens.indexOf(tok + tok + tok) > -1, conf)\n : handleOpen(state, tok, closed, conf.before || defaults.before);\n if (bracket == closed && closedBracketAt(state, state.selection.main.from))\n return handleClose(state, tok, closed);\n }\n return null;\n}\nfunction closedBracketAt(state, pos) {\n let found = false;\n state.field(bracketState).between(0, state.doc.length, from => {\n if (from == pos)\n found = true;\n });\n return found;\n}\nfunction nextChar(doc, pos) {\n let next = doc.sliceString(pos, pos + 2);\n return next.slice(0, codePointSize(codePointAt(next, 0)));\n}\nfunction prevChar(doc, pos) {\n let prev = doc.sliceString(pos - 2, pos);\n return codePointSize(codePointAt(prev, 0)) == prev.length ? prev : prev.slice(1);\n}\nfunction handleOpen(state, open, close, closeBefore) {\n let dont = null, changes = state.changeByRange(range => {\n if (!range.empty)\n return { changes: [{ insert: open, from: range.from }, { insert: close, from: range.to }],\n effects: closeBracketEffect.of(range.to + open.length),\n range: EditorSelection.range(range.anchor + open.length, range.head + open.length) };\n let next = nextChar(state.doc, range.head);\n if (!next || /\\s/.test(next) || closeBefore.indexOf(next) > -1)\n return { changes: { insert: open + close, from: range.head },\n effects: closeBracketEffect.of(range.head + open.length),\n range: EditorSelection.cursor(range.head + open.length) };\n return { range: dont = range };\n });\n return dont ? null : state.update(changes, {\n scrollIntoView: true,\n userEvent: \"input.type\"\n });\n}\nfunction handleClose(state, _open, close) {\n let dont = null, changes = state.changeByRange(range => {\n if (range.empty && nextChar(state.doc, range.head) == close)\n return { changes: { from: range.head, to: range.head + close.length, insert: close },\n range: EditorSelection.cursor(range.head + close.length) };\n return dont = { range };\n });\n return dont ? null : state.update(changes, {\n scrollIntoView: true,\n userEvent: \"input.type\"\n });\n}\n// Handles cases where the open and close token are the same, and\n// possibly triple quotes (as in `\"\"\"abc\"\"\"`-style quoting).\nfunction handleSame(state, token, allowTriple, config) {\n let stringPrefixes = config.stringPrefixes || defaults.stringPrefixes;\n let dont = null, changes = state.changeByRange(range => {\n if (!range.empty)\n return { changes: [{ insert: token, from: range.from }, { insert: token, from: range.to }],\n effects: closeBracketEffect.of(range.to + token.length),\n range: EditorSelection.range(range.anchor + token.length, range.head + token.length) };\n let pos = range.head, next = nextChar(state.doc, pos), start;\n if (next == token) {\n if (nodeStart(state, pos)) {\n return { changes: { insert: token + token, from: pos },\n effects: closeBracketEffect.of(pos + token.length),\n range: EditorSelection.cursor(pos + token.length) };\n }\n else if (closedBracketAt(state, pos)) {\n let isTriple = allowTriple && state.sliceDoc(pos, pos + token.length * 3) == token + token + token;\n let content = isTriple ? token + token + token : token;\n return { changes: { from: pos, to: pos + content.length, insert: content },\n range: EditorSelection.cursor(pos + content.length) };\n }\n }\n else if (allowTriple && state.sliceDoc(pos - 2 * token.length, pos) == token + token &&\n (start = canStartStringAt(state, pos - 2 * token.length, stringPrefixes)) > -1 &&\n nodeStart(state, start)) {\n return { changes: { insert: token + token + token + token, from: pos },\n effects: closeBracketEffect.of(pos + token.length),\n range: EditorSelection.cursor(pos + token.length) };\n }\n else if (state.charCategorizer(pos)(next) != CharCategory.Word) {\n if (canStartStringAt(state, pos, stringPrefixes) > -1 && !probablyInString(state, pos, token, stringPrefixes))\n return { changes: { insert: token + token, from: pos },\n effects: closeBracketEffect.of(pos + token.length),\n range: EditorSelection.cursor(pos + token.length) };\n }\n return { range: dont = range };\n });\n return dont ? null : state.update(changes, {\n scrollIntoView: true,\n userEvent: \"input.type\"\n });\n}\nfunction nodeStart(state, pos) {\n let tree = syntaxTree(state).resolveInner(pos + 1);\n return tree.parent && tree.from == pos;\n}\nfunction probablyInString(state, pos, quoteToken, prefixes) {\n let node = syntaxTree(state).resolveInner(pos, -1);\n let maxPrefix = prefixes.reduce((m, p) => Math.max(m, p.length), 0);\n for (let i = 0; i < 5; i++) {\n let start = state.sliceDoc(node.from, Math.min(node.to, node.from + quoteToken.length + maxPrefix));\n let quotePos = start.indexOf(quoteToken);\n if (!quotePos || quotePos > -1 && prefixes.indexOf(start.slice(0, quotePos)) > -1) {\n let first = node.firstChild;\n while (first && first.from == node.from && first.to - first.from > quoteToken.length + quotePos) {\n if (state.sliceDoc(first.to - quoteToken.length, first.to) == quoteToken)\n return false;\n first = first.firstChild;\n }\n return true;\n }\n let parent = node.to == pos && node.parent;\n if (!parent)\n break;\n node = parent;\n }\n return false;\n}\nfunction canStartStringAt(state, pos, prefixes) {\n let charCat = state.charCategorizer(pos);\n if (charCat(state.sliceDoc(pos - 1, pos)) != CharCategory.Word)\n return pos;\n for (let prefix of prefixes) {\n let start = pos - prefix.length;\n if (state.sliceDoc(start, pos) == prefix && charCat(state.sliceDoc(start - 1, start)) != CharCategory.Word)\n return start;\n }\n return -1;\n}\n\n/**\nReturns an extension that enables autocompletion.\n*/\nfunction autocompletion(config = {}) {\n return [\n completionState,\n completionConfig.of(config),\n completionPlugin,\n completionKeymapExt,\n baseTheme\n ];\n}\n/**\nBasic keybindings for autocompletion.\n\n - Ctrl-Space: [`startCompletion`](https://codemirror.net/6/docs/ref/#autocomplete.startCompletion)\n - Escape: [`closeCompletion`](https://codemirror.net/6/docs/ref/#autocomplete.closeCompletion)\n - ArrowDown: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(true)`\n - ArrowUp: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(false)`\n - PageDown: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(true, \"page\")`\n - PageDown: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(true, \"page\")`\n - Enter: [`acceptCompletion`](https://codemirror.net/6/docs/ref/#autocomplete.acceptCompletion)\n*/\nconst completionKeymap = [\n { key: \"Ctrl-Space\", run: startCompletion },\n { key: \"Escape\", run: closeCompletion },\n { key: \"ArrowDown\", run: /*@__PURE__*/moveCompletionSelection(true) },\n { key: \"ArrowUp\", run: /*@__PURE__*/moveCompletionSelection(false) },\n { key: \"PageDown\", run: /*@__PURE__*/moveCompletionSelection(true, \"page\") },\n { key: \"PageUp\", run: /*@__PURE__*/moveCompletionSelection(false, \"page\") },\n { key: \"Enter\", run: acceptCompletion }\n];\nconst completionKeymapExt = /*@__PURE__*/Prec.highest(/*@__PURE__*/keymap.computeN([completionConfig], state => state.facet(completionConfig).defaultKeymap ? [completionKeymap] : []));\n/**\nGet the current completion status. When completions are available,\nthis will return `\"active\"`. When completions are pending (in the\nprocess of being queried), this returns `\"pending\"`. Otherwise, it\nreturns `null`.\n*/\nfunction completionStatus(state) {\n let cState = state.field(completionState, false);\n return cState && cState.active.some(a => a.state == 1 /* Pending */) ? \"pending\"\n : cState && cState.active.some(a => a.state != 0 /* Inactive */) ? \"active\" : null;\n}\nconst completionArrayCache = /*@__PURE__*/new WeakMap;\n/**\nReturns the available completions as an array.\n*/\nfunction currentCompletions(state) {\n var _a;\n let open = (_a = state.field(completionState, false)) === null || _a === void 0 ? void 0 : _a.open;\n if (!open || open.disabled)\n return [];\n let completions = completionArrayCache.get(open.options);\n if (!completions)\n completionArrayCache.set(open.options, completions = open.options.map(o => o.completion));\n return completions;\n}\n/**\nReturn the currently selected completion, if any.\n*/\nfunction selectedCompletion(state) {\n var _a;\n let open = (_a = state.field(completionState, false)) === null || _a === void 0 ? void 0 : _a.open;\n return open && !open.disabled && open.selected >= 0 ? open.options[open.selected].completion : null;\n}\n/**\nReturns the currently selected position in the active completion\nlist, or null if no completions are active.\n*/\nfunction selectedCompletionIndex(state) {\n var _a;\n let open = (_a = state.field(completionState, false)) === null || _a === void 0 ? void 0 : _a.open;\n return open && !open.disabled && open.selected >= 0 ? open.selected : null;\n}\n/**\nCreate an effect that can be attached to a transaction to change\nthe currently selected completion.\n*/\nfunction setSelectedCompletion(index) {\n return setSelectedEffect.of(index);\n}\n\nexport { CompletionContext, acceptCompletion, autocompletion, clearSnippet, closeBrackets, closeBracketsKeymap, closeCompletion, completeAnyWord, completeFromList, completionKeymap, completionStatus, currentCompletions, deleteBracketPair, hasNextSnippetField, hasPrevSnippetField, ifIn, ifNotIn, insertBracket, insertCompletionText, moveCompletionSelection, nextSnippetField, pickedCompletion, prevSnippetField, selectedCompletion, selectedCompletionIndex, setSelectedCompletion, snippet, snippetCompletion, snippetKeymap, startCompletion };\n", "import {\n foldNodeProp,\n foldInside,\n indentNodeProp,\n LRLanguage,\n LanguageSupport,\n type TreeIndentContext,\n} from \"@codemirror/language\";\n\nimport { parser } from \"@gdquest/lezer-gdscript\";\n\nimport { globalCompletion, localCompletionSource } from \"./complete.mts\";\nimport { type SyntaxNode } from \"@lezer/common\";\nexport { globalCompletion, localCompletionSource };\n\nfunction indentBody(\n context: TreeIndentContext,\n node: SyntaxNode\n): number | null {\n const base = context.baseIndentFor(node);\n const line = context.lineAt(context.pos, -1);\n const to = line.from + line.text.length;\n // Don't consider blank, deindented lines at the end of the\n // block part of the block\n if (\n /^\\s*($|#)/.test(line.text) &&\n context.node.to < to + 100 &&\n !/\\S/.test(context.state.sliceDoc(to, context.node.to)) &&\n context.lineIndent(context.pos, -1) <= base\n ) {\n return null;\n }\n // A normally deindenting keyword that appears at a higher\n // indentation than the block should probably be handled by the next\n // level\n if (\n /^\\s*(else:|elif)/.test(context.textAfter) &&\n context.lineIndent(context.pos, -1) > base\n ) {\n return null;\n }\n return base + context.unit;\n}\n\nexport const gdscriptLanguage = LRLanguage.define({\n name: \"gdscript\",\n parser: parser.configure({\n props: [\n indentNodeProp.add({\n Body: (context) => {\n return indentBody(context, context.node) ?? context.continue();\n },\n IfNode: (context) => {\n return /^\\s*(else:|elif )/.test(context.textAfter)\n ? context.baseIndent\n : context.continue();\n },\n SuiteNode: (context) => {\n return indentBody(context, context.node) ?? context.continue();\n },\n String: () => {\n return null;\n },\n Script: (context) => {\n if (\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n context.pos + /\\s*/.exec(context.textAfter)![0].length >=\n context.node.to\n ) {\n let endBody = null;\n for (let cur: SyntaxNode | null = context.node, to = cur.to; ; ) {\n cur = cur.lastChild;\n if (cur == null || cur.to !== to) break;\n if (cur.type.name === \"Body\") endBody = cur;\n }\n if (endBody != null) {\n const bodyIndent = indentBody(context, endBody);\n if (bodyIndent != null) return bodyIndent;\n }\n }\n return context.continue();\n },\n }),\n foldNodeProp.add({\n \"ArrayExpressionNode DictionaryExpressionNode\": foldInside,\n Body: (node, state) => ({\n from: node.from + 1,\n to: node.to - (node.to === state.doc.length ? 0 : 1),\n }),\n }),\n ],\n }),\n languageData: {\n closeBrackets: {\n brackets: [\"(\", \"[\", \"{\", \"'\", '\"', \"'''\", '\"\"\"'],\n },\n commentTokens: { line: \"#\" },\n // eslint-disable-next-line no-useless-escape\n indentOnInput: /^\\s*([\\}\\]\\)]|else:|elif )$/,\n },\n});\n\nexport function gdscript(): LanguageSupport {\n return new LanguageSupport(gdscriptLanguage, [\n gdscriptLanguage.data.of({ autocomplete: localCompletionSource }),\n gdscriptLanguage.data.of({ autocomplete: globalCompletion }),\n ]);\n}\n", "// This file was generated by lezer-generator. You probably shouldn't edit it.\nimport {LRParser} from \"@lezer/lr\"\nimport {indentation, newlines, trackIndent} from \"./tokens.js\"\nimport {gdscriptHighlighting} from \"./highlight\"\nconst spec_Identifier = {__proto__:null,PI:34, TAU:36, INF:38, NaN:40, assert:48, var:70, const:80, await:86, in:116, as:122, func:138, preload:162, is:176, class_name:186, extends:190, signal:194, pass:198, return:202, class:214, if:222, elif:226, else:230, for:234, match:238, while:254}\nexport const parser = LRParser.deserialize({\n version: 14,\n states: \"KtQ`QUOOP#rOQOOOOQQ'#Cq'#CqOOQQ'#Ch'#ChO#wQUO'#CbO#|QUO'#CaO&OQYO'#CyO&lQUO'#CzO&qQUO'#CxO(pQYO'#FmO*hQUO'#CwO*oQYO'#FmO*|QUO'#DOOOQQ'#Fq'#FqO,lQYO'#C`O,dQYO'#C}O,yQUO'#DmO(wQUO'#DpOOQQ'#EQ'#EQO(wQUO'#EYOOQQ'#Fm'#FmOOQQ'#C`'#C`O.jQUO'#C_OOQR'#C_'#C_O.uQVO'#EmOOQR'#Ei'#EiOOQR'#Fg'#FgOOQR'#FQ'#FQQ`QUOOOOQQ'#Cl'#ClO1kQUO'#DOO1pQUO'#DTO(wQUO'#DWO1uQUO'#ElO1zQUO'#EOO1zQUO'#CsO2PQUO'#E[O2UQUO'#E^O2ZQUO'#E`OOQQ'#Eb'#EbO(wQUO'#EdO2`QUO'#EjO,yQUO'#EnO2eQUO'#EtO2jQUO'#EvO,yQUO'#FOP2oOUO'#FfPOOO)CAY)CAYO2zQUO,58|O3iQUO'#DQOOQQ,59q,59qO(wQUO,59iOOQQ,5:T,5:TO3nQUO'#CuO3uQYO,59fO5uQUO'#FTO5zQYO,59dOOQQ,59c,59cO8QQUO,59cOOQQ'#FU'#FUO8VQUO'#DOO8bQYO'#FlO8oQUO'#DrO8tQUO,59cO,yQUO,5:XOOQQ-E9S-E9SO8{QUO,59jO9QQUO,59oO9VQUO,5;UO9[QUO,5;WO(wQUO,59tO(wQUO,59tO(wQUO,59tO(wQUO,59tO(wQUO,59tO(wQUO,59tO(wQUO,59tO(wQUO,59tO(wQUO,59tO(wQUO,59tO(wQUO,5:nO(wQUO,59tO9aQUO,59tO3iQUO,5:UO9fQUO,5:qO:uQYO'#DoO;PQUO'#FtO;XQUO,5:XO;^QYO,5:[OOQQ,5:t,5:tOOQR'#Dy'#DyOOQR'#Ef'#EfO;eQUO'#FYO.jQUO,5;ROOQR,58y,58yOOQR'#FZ'#FZOzQUO'#ErOOQR-E9O-E9OO?PQYO,59jO?[QYO,59oOOQQ,59r,59rO8oQUO,5;WOOQQ,5:j,5:jOOQQ,59_,59_OOQQ,5:v,5:vOOQQ,5:x,5:xO?gQUO,5:zO?uQYO,5;OO@SQUO,5;UO@[QYO,5;YO@fQUO,5;`O@kQUO,5;bO@[QYO,5;jPOOO,5zQUO1G0rOOQQ1G0f1G0fOOQR1G0p1G0pO>zQUO1G0pOOQR1G0t1G0tO,yQUO1G0zO!&XQUO1G0|OOQR1G1U1G1UPOOO1G1l1G1lP!&^OQO1G1lO!&cQUO'#FhOOQQ,59R,59RO!&kQUO,59ROOQQ1G.{1G.{OOQQ,5;n,5;nOOQQ-E9Q-E9QO!&pQYO,5;sO!&}QUO1G1rOOQQ-E9V-E9VO!'XQYO'#DVO!'jQYO'#FvO!'xQUO'#FvOOQQ,5:`,5:`O!(QQUO,5:`O3iQUO'#DvOOQQ,5zQUO7+&[O>zQUO7+&^O(wQUO7+%tO!)QQYO7+$zO!+bQYO1G/TO!+lQYO1G/uOOQQ,5;q,5;qO!+vQUO1G1zOOQQ-E9T-E9TOOQR1G0v1G0vO!+}QVO'#DxOOQR'#D}'#D}OOQR,5:c,5:cOOQR7+&^7+&^O@[QYO7+&fO!+}QVO7+&hPOOO7+'W7+'WO!,SQUO,5zQUO'#ExOOQR'#F['#F[O!4OQVOAN?nO!4cQUO'#EzP@}QUO'#FRP!4hQUO'#FWOOQR'#D|'#D|OOQR1G0Q1G0QOOQR,5;d,5;dOOQR-E9Y-E9YOOQRG25YG25YOOQQ,5;f,5;fO!4mQYO'#CyO,yQUO'#EYO,yQUO'#DWO,yQUO,59iO,yQUO,59tO,yQUO,59tO,yQUO,59tO,yQUO,59tO,yQUO,59tO,yQUO,59tO,yQUO,59tO,yQUO,59tO,yQUO,59tO,yQUO,59tO,yQUO,59tO!4zQYO1G/TO!5UQYO1G/`O!5uQYO1G/`O!6fQYO1G/`O!7VQYO1G/`O!7vQYO1G/`O!8gQYO1G/`O!9WQYO1G/`O!;XQYO1G/`O!;cQYO1G/`O!;mQYO1G/`O,yQUO1G/`O!<^QUO'#DwOFrQUO1G0rOFrQUO1G0pOFrQUO7+&[OFrQUO7+&^O,yQUO7+%tO!>VQYO7+$zO!>vQYO7+&fO!@UQYO<vQYO,5;YO!>vQYO,5;jO!@yQUO1G0pO8oQUO1G0rO!ARQYO1G0YO!>vQYO,5;[O,yQUO1G0zO!AYQUO'#ElO!A_QUO'#EjO,yQUO'#EnO,yQUO'#FOO!AdQUO,5;UO!AiQUO,5;WO(wQUO,5:nO,yQUO'#EpO!AnQUO,5;`O!AsQUO'#DOO!BUQUO'#Et\",\n stateData: \"!Bq~OPOS$XOS$UOS$TPQ~OVSOWUOYaO]RO^RO_ROamObmOcmOdmOhsOpYOsnOxoO{pO!ZcO!b`O!gqO!srO!ubO!}cO#PtO#RuO#TvO#VwO#XxO#_yO#czO#i{O#k|O#s}O$]RO$^RO$_QO$bVO$cVO~O$T!OO~OW!QO~OV#xXs#xXx#xX!g#xX#[TX#_#xX$STX$VTX~OY!VOu!ROomX}!eX!O!eX!P!eX!Q!eX!R!eX!S!eX!T!eX!U!eX!V!eX!W!eX!X!eX!Y!eX!Z!eX![!eX!_!eX!w!eX!z!eXf!eX!`!eX~O$f!TO$g!TO#[!eX$S!eX$V!eXj!eXX!eX!x!eX~P$hOW!WO~Oo!XO~O}$aX!O$aX!P$aX!Q$aX!R$aX!S$aX!T$aX!U$aX!V$aX!W$aX!X$aX!Y$aX!Z$aX![$aX!_$aX!w$aX!z$aX#[$aX$S$aX$V$aX$f$aX$g$aXf$aXj$aXu$aXX$aX!x$aX!`$aX~Oo!XO~P&vOVSOWUOYaO]RO^RO_ROamObmOcmOdmOpYOsnOxoO{pO!ZcO!b`O!g!`O!srO!ubO!}cO$]RO$^RO$_QO$bVO$cVO~Oj!ZO~P(wOY!VOp!aO!b!bO~P&vOVSOs!dOx!eO!g!gO#_!fO~O}!hO!O!iO!P!jO!Q!kO!R!lO!S!mO!T!nO!U!oO!V!pO!W!pO!X!qO!Y!qO!Z!tO![!sO!_!uO!w!rO!z!vO$f!TO$g!TO~O#[SX$SSX$VSX~P+_OVSOW&wOYaO]RO^RO_ROamObmOcmOdmOpYOsnOxoO{&yO!Z&xO!b`O!g!`O!srO!ubO!}&xO$]RO$^RO$_QO$bVO$cVO~O#[#OO$S!|O$V!}O~O#e#UO#g#VOV#aXW#aXY#aX]#aX^#aX_#aXa#aXb#aXc#aXd#aXh#aXp#aXs#aXx#aX{#aX!Z#aX!b#aX!g#aX!s#aX!u#aX!}#aX#P#aX#R#aX#T#aX#V#aX#X#aX#_#aX#c#aX#i#aX#k#aX#s#aX$P#aX$]#aX$^#aX$_#aX$b#aX$c#aX$R#aX$V#aX$l#aX~OW#XO~OW#YO~OW#[O~OY!VO~OW#_O~OW#`O~OW#aO~OW#cO~OW#eO~OW#fO~OP#iO$S#hO$X#jO~OY#kOVUasUaxUa!gUa#[Ua#_Ua$SUa$VUa~OW#mO~OX#pO~P(wO$d#rOona}na!Ona!Pna!Qna!Rna!Sna!Tna!Una!Vna!Wna!Xna!Yna!Zna![na!_na!wna!zna#[na$Sna$Vna$fna$gnafnajnaunaXna!xna!`na~OW#tO~Oo!XOYlapla}la!Ola!Pla!Qla!Rla!Sla!Tla!Ula!Vla!Wla!Xla!Yla!Zla![la!_la!bla!wla!zla#[la$Sla$Vla$fla$glaflajlaulaXla!xla!`la~Oj#wO~OVSOs!dOx!eO~Of#xOj$`XX$`X~P+_OY#zO~Oj#wO~P(wOW$PO~OW$QO~OW$RO~OW$SO~O![$aO~OW$cO~O}&{O!O&|O!P&}O!Q'OO!R'PO!S'QO!T'RO!U'SO!V'TO!W'TO!X'UO!Y'UO!Z'nO!['VO!_!uO!w(PO!z!vO$f&zO~Ou$fO$g$eO~P9kOf$gO!`$hX~O!`$iO~OX$jO~P+_OhsO#PtO#RuO#TvO#VwO#XxO#[#|X$S#|X$V#|X~P(wO#e#UO#g#VOV#aaW#aaY#aa]#aa^#aa_#aaa#aab#aac#aad#aah#aap#aas#aax#aa{#aa!Z#aa!b#aa!g#aa!s#aa!u#aa!}#aa#P#aa#R#aa#T#aa#V#aa#X#aa#_#aa#c#aa#i#aa#k#aa#s#aa$P#aa$]#aa$^#aa$_#aa$b#aa$c#aa$R#aa$V#aa$l#aa~Ou$qO~Ou!RO$fra$gra~Ou!RO$fwa$gwa~OY!VO#[#Sa$S#Sa$V#Sa~O#[#Wa$S#Wa$V#Wa~P+_Ou$qO#RuO~Ou$qO$g&zO~P9kO![$zO~Ou${O~O$S$}O~OP%OO$S$}O~O]RO^RO_ROamObmOcmOdmO$]RO$^RO$_QO~OX%QO~P@}O}!hO!O!iO!P!jO!Q!kO!R!lO!S!mO!T!nO!U!oO!V!pO!W!pO!X!qO!Y!qO!Z!tO![!sO!_!uO!w!rO!z!vO~O#[qi$Sqi$Vqi$fqi$gqifqijqiXqi!xqi!`qi~PAvOX%SO~OW%TO~O$d#rOoni}ni!Oni!Pni!Qni!Rni!Sni!Tni!Uni!Vni!Wni!Xni!Yni!Zni![ni!_ni!wni!zni#[ni$Sni$Vni$fni$gnifnijniuniXni!xni!`ni~Oj$`aX$`a~P(wOf%WOj$`aX$`a~OW%YOX%]O~O$k%_Ou$iX~Ou'dO~Oj%bO~O!`%cO~Ou!RO$fri$gri~Ou!RO$fwi$gwi~O}!hO!P|i!Q|i!R|i!S|i!T|i!U|i!V|i!W|i!X|i!Y|i!Z|i![|i!_|i!w|i!z|i#[|i$S|i$V|i$f|i$g|if|ij|iX|i!x|i!`|i~O!O|i~PGiO!O!iO~PGiO}!hO!O!iO!P!jO!R|i!S|i!T|i!U|i!V|i!W|i!X|i!Y|i!Z|i![|i!_|i!w|i!z|i#[|i$S|i$V|i$f|i$g|if|ij|iX|i!x|i!`|i~O!Q|i~PIkO}!hO!O!iO!P!jO!Q!kO!T!nO!U!oO!R|i!V|i!W|i!X|i!Y|i!Z|i![|i!_|i!w|i!z|i#[|i$S|i$V|i$f|i$g|if|ij|iX|i!x|i!`|i~O!S!mO~PKfO!S|i~PKfO}!hO!O!iO!P!jO!Q!kO!R|i!S|i!T|i!V|i!W|i!X|i!Y|i!Z|i![|i!_|i!w|i!z|i#[|i$S|i$V|i$f|i$g|if|ij|iX|i!x|i!`|i~O!U!oO~PMhO!Q!kO~PIkO}!hO!O!iO!P!jO!Q!kO!R!lO!S!mO!T!nO!U!oO!Z!tO![!sO!z!vO!X|i!Y|i!_|i!w|i#[|i$S|i$V|i$f|i$g|if|ij|iX|i!x|i!`|i~O!V|i!W|i~P! jO!V!pO!W!pO~P! jO!x%iO~P+_O!V|i!W|i!X|i!Y|i!Z|i![|i!_|i!w|i!z|i$f|i$g|if|i!`|i~O}!hO!O!iO!P!jO!Q!kO!R!lO!S!mO!T!nO!U!oO#[|i$S|i$V|ij|iX|i!x|i~P!#vO!`$ha~P,yOf%nO!`$ha~O$S!|O~P`O$S!|O~O$S%wO~Of%xOX$[X~OX%zO~Of#{aj#{aX#{a~P+_Oj$`iX$`i~P(wOu!ROXyXfyX$fyX$gyX~Of%}O$f%|O$g%|OX$jX~Of%}OX$jX~OX&PO~O!V|q!W|q!X|q!Y|q!Z|q![|q!_|q!w|q!z|q$f|q$g|qf|q!`|q~O}!hO!O!iO!P!jO!Q!kO!R!lO!S!mO!T!nO!U!oO#[|q$S|q$V|qj|qX|q!x|q~P!(VO}&{O!O&|O!P&}O!Q'OO!R'PO!S'QO!T'RO!U'SO!V'TO!W'TO!X'UO!Y'UO!Z'nO!['VO!_!uO!w(PO!z!vOuqi$fqi$gqi~Of!ci!`!ci~P!*QOf!ci!`!ci~P+_O!`$hi~P,yO$Q&WO~OX$[a~P@}Of&^OX$[a~OW%YOX$ja~Of&cOX$ja~O#e(QO#g'oOf#aXj#aX}#aX!O#aX!P#aX!Q#aX!R#aX!S#aX!T#aX!U#aX!V#aX!W#aX!X#aX!Y#aX!Z#aX![#aX!_#aX!w#aX!z#aX$f#aX$g#aXu#aXX#aX#[#aX$S#aX$V#aX!x#aX!`#aX~O}!hO!O!iO!P!jO!Q!kO!R!lO!S!mO!T!nO!U!oO!V!pO!W!pO!X!qO!Y!qO!Z!tO![!sO!w!rO!z!vO~O!_!vy#[!vy$S!vy$V!vy$f!vy$g!vyf!vyj!vyX!vy!x!vy!`!vy~P!.sOW&gOs&nO$l&iO~P@}OX$[i~P@}OX!iif!ii~P+_O$f%|O$g%|OX#zaf#za~OW%YOX$ji~O#e(QO#g'oOf#aaj#aa}#aa!O#aa!P#aa!Q#aa!R#aa!S#aa!T#aa!U#aa!V#aa!W#aa!X#aa!Y#aa!Z#aa![#aa!_#aa!w#aa!z#aa$f#aa$g#aau#aaX#aa#[#aa$S#aa$V#aa!x#aa!`#aa~O$R&qO$V&rO~P`OW&gOs&nO$R&qO$V!}O$l&iO~P@}OW&vO~OW%YO~O$f&zO$g&zOu!eX~P$hOfqi!`qi~P!*QO}&{Ou|i!O|i!P|i!Q|i!R|i!S|i!T|i!U|i~P!#vO}&{O!O&|Ou|i!P|i!Q|i!R|i!S|i!T|i!U|i~P!#vO}&{O!O&|O!P&}Ou|i!Q|i!R|i!S|i!T|i!U|i~P!#vO}&{O!O&|O!P&}O!Q'OO!S'QO!T'RO!U'SOu|i!R|i~P!#vO}&{O!O&|O!P&}O!Q'OO!T'RO!U'SOu|i!R|i!S|i~P!#vO}&{O!O&|O!P&}O!Q'OO!U'SOu|i!R|i!S|i!T|i~P!#vO}&{O!O&|O!P&}O!Q'OOu|i!R|i!S|i!T|i!U|i~P!#vO}&{O!O&|O!P&}O!Q'OO!R'PO!S'QO!T'RO!U'SO!Z'nO!['VO!z!vOu|i!X|i!Y|i!_|i!w|i$f|i$g|if|i!`|i~O!V|i!W|i~P!9wO!V'TO!W'TO~P!9wO}&{O!O&|O!P&}O!Q'OO!R'PO!S'QO!T'RO!U'SOu|i~P!#vOVSOWUOYaOhsOpYOsnOxoO{pO!ZcO!b`O!g'yO!srO!ubO!}cO#PtO#RuO#TvO#VwO#XxO#_'zO#c'{O#i(TO#k|O#s'|O$S!|O$bVO$cVO~P@}O}&{O!O&|O!P&}O!Q'OO!R'PO!S'QO!T'RO!U'SOu|q~P!(VOu'dO$g&zO~P9kO}&{O!O&|O!P&}O!Q'OO!R'PO!S'QO!T'RO!U'SO!V'TO!W'TO!X'UO!Y'UO!Z'nO!['VO!w(PO!z!vO~Ou!vy!_!vy$f!vy$g!vyf!vy!`!vy~P!?QO$f&zO$g&zO~O!['cO~Ou'dO#RuO~O!x'iO~P+_OW'pO~OW'qO~OW'tO~OW'uO~O!['xO~OVSOs!dOx!eO!g(OO#_'}O~OW(RO~O$^$]]!V!X!Z^_$_!uW$du!}o$l}!O!P!x!w~\",\n goto: \"Ac$kPPP$l$t%P%YPPPP&t&wPPP(jPPPP(jP%PP*VP*e+z-a.yPP*e0`P1uP2W0`P2a*eP*ePPPPPPPPPPPPPP*e*ePP*eP4O*e*e*eP4X4`4h4k5m5q6O6R6X5m*eP*eP*ePP*eP6_*eP%PP6bP%PP%PP%PP6w7QP$l7YP7Y7Y7bP7lP7rP7YP7YP7z8O8S8S8S8S7YP8W8b8h8n8u:e:k:r:x;O;YPPPPPPPPP;`;c;mPPP;p;yPPP?bPP@yAPA`]jOl$q&X&f'd[fOl$q&X&f'dR$k#O_eOl#O$q&X&f'd^TOl#O$q&X&f'd#o!]Y[`acpxz}!T!V!^!a!b!h!i!j!k!l!m!n!o!p!q!r!s#U#x$a$e$f$g$z%W%i%n%{%|&V&x&y&z&{&|&}'O'P'Q'R'S'T'U'V'c'i'x'{'|(P(Q(SR#l!Q#vdOY`aclpxz}!T!V!a!b!h!i!j!k!l!m!n!o!p!q!r!s#O#U#x$a$e$f$g$q$z%W%i%n%{%|&V&X&f&x&y&z&{&|&}'O'P'Q'R'S'T'U'V'c'd'i'x'{'|(P(QQ%P#kU&]%x&^&oT&h&[&m$TROY`aclpxz}!T!V!a!b!h!i!j!k!l!m!n!o!p!q!r!s#O#U#k#x$a$e$f$g$q$z%W%i%n%x%{%|&V&X&[&^&f&m&o&x&y&z&{&|&}'O'P'Q'R'S'T'U'V'c'd'i'x'{'|(P(QU!UUZ&wQ#]rQ#^sR$v#a#wdOY`aclpxz}!T!V!a!b!h!i!j!k!l!m!n!o!p!q!r!s#O#U#x$a$e$f$g$q$z%W%i%n%{%|&V&X&f&x&y&z&{&|&}'O'P'Q'R'S'T'U'V'c'd'i'x'{'|(P(Q#wZOY`aclpxz}!T!V!a!b!h!i!j!k!l!m!n!o!p!q!r!s#O#U#x$a$e$f$g$q$z%W%i%n%{%|&V&X&f&x&y&z&{&|&}'O'P'Q'R'S'T'U'V'c'd'i'x'{'|(P(Q#vWOY`aclpxz}!T!V!a!b!h!i!j!k!l!m!n!o!p!q!r!s#O#U#x$a$e$f$g$q$z%W%i%n%{%|&V&X&f&x&y&z&{&|&}'O'P'Q'R'S'T'U'V'c'd'i'x'{'|(P(QR#u!X#wXOY`aclpxz}!T!V!a!b!h!i!j!k!l!m!n!o!p!q!r!s#O#U#x$a$e$f$g$q$z%W%i%n%{%|&V&X&f&x&y&z&{&|&}'O'P'Q'R'S'T'U'V'c'd'i'x'{'|(P(Q#w]OY`aclpxz}!T!V!a!b!h!i!j!k!l!m!n!o!p!q!r!s#O#U#x$a$e$f$g$q$z%W%i%n%{%|&V&X&f&x&y&z&{&|&}'O'P'Q'R'S'T'U'V'c'd'i'x'{'|(P(QU!SU%Y&wQ$s#XQ$t#YQ%d$PR%e$QQ#n!RQ$b!uR&Q%_#v]OY`aclpxz}!T!V!a!b!h!i!j!k!l!m!n!o!p!q!r!s#O#U#x$a$e$f$g$q$z%W%i%n%{%|&V&X&f&x&y&z&{&|&}'O'P'Q'R'S'T'U'V'c'd'i'x'{'|(P(QQ%Z#zV&a%}&c&pS!x`!bV%m$g%n&VZ#{!`#[$S'p'uQ%[#zV&b%}&c&pR%`#{S$r#V'oS$w#c'qS$y#d'rS$|#g'sQ%a#|W%f$R$x'f'tS%p$p'wS%t$u'eS&S%g'gS&T%h'hS&Z%u'kR&s&kT%s$q'dQ#QfQ$m#PS%q$q'dR%v${R&Y%qQ&X%qR&[%vQ&r&fR&u&mR$d!v^eOl#O$q&X&f'dQ$x#cQ%g$RQ'f'qR'g'tQ#QfQ$m#PR&u&m]gOl$q&X&f'd]iOl$q&X&f'dYhOl$q&X&fR&R'dX#Rh#S&R&eS#Th&RT$o#S&eT&l&[&mT&k&[&mT&j&[&mQlOS#Wl&fR&f&XQ%y%PR&_%yQ#s!WR%U#sS!YWXR#v!YY[Ol$q&X&f#j!^Y`acpxz}!T!V!a!b!h!i!j!k!l!m!n!o!p!q!r!s#O#U#x$a$e$f$g$z%W%i%n%{%|&V&x&y&z&{&|&}'O'P'Q'R'S'T'U'V'c'i'x'{'|(P(QU!c[!^(SR(S'dQ$h!xR%o$hS&O%Z%[R&d&OQ#y!_R%X#yQ#PfR$l#PQ#ShS$n#S&eR&e&RQ&m&[R&t&mR!PPWkOl&X&fT%r$q'dR%R#kQ![YQ#q!VR#}!a^^Ol#O$q&X&f'dU!_Y!V!aY!w`!b$g%n&VQ!zaS!{c&xS#Zp&yQ#bxQ#dzQ#g}Q#o!TS$T!h&{Q$U!iQ$V!jQ$W!kQ$X!lQ$Y!mQ$Z!nQ$[!oQ$]!pQ$^!qQ$_!rQ$`!sQ$p#UU%V#x%W%{Q%j$aQ%k$eQ%l$fQ%u$zQ&U%iQ&`%|Q'W&zQ'X&|Q'Y&}Q'Z'OQ'['PQ']'QQ'^'RQ'_'SQ'`'TQ'a'UQ'b'VQ'j'cQ'k'xQ'l'iQ'r'{Q's'|Q'v(PR'w(Q!h_OYaclpx!T!V!a!h!i!j!k!l!m!n!o!p!q!r!s#O#x$a$f$q%W%i%{%|&X&f'd(P!_'m`z}!b#U$e$g$z%n&V&x&y&z&{&|&}'O'P'Q'R'S'T'U'V'c'i'x'{'|(QQ!y`R$O!bQ#|!`Q$u#[Q%h$SQ'e'pR'h'uR%^#z\",\n nodeNames: \"\u26A0 Comment Script SimpleStatement SmallStatement StandaloneAnnotationNode AnnotationNode @ Identifier ) ( CallParamsLiteralExpressionNode LiteralExpressionNode True False Null BuiltinConstants PI TAU INF NaN String , AssertNode assert CallParamsExpressionNode ] ArrayExpressionNode SubscriptExpressionNode VariableName GetNodeExpressionNode . [ AssignmentExpressionNode VariableNode var TypeCast : Type ConstantNode const ParameterNode AwaitExpressionNode await BinaryOperatorExpressionNode ArithOp ArithOp ArithOp BitOp CompareOp BitOp BitOp BitOp AndOp LogicOp OrOp LogicOp NotOp in CallExpressionNode CastExpressionNode as } DictionaryExpressionNode { DictionaryEntry GroupedExpressionNode IdentifierExpressionNode LambdaExpressionNode func CallParamsParameterNode AssignmentExpressionNode FunctionReturnType Body SuiteNodeBody Newline SuiteNode Indent Dedent ExpressionNodeBody PreloadExpressionNode preload SelfExpressionNode SelfToken TernaryOperatorExpressionNode TernaryOp TernaryOp TypeTestExpressionNode is ClassName UnaryOperatorNode ArithOp ClassNameStatement class_name ExtendsStatement extends SignalStatement signal PassStatement pass ReturnNode return Eof StatementGroup ; CompoundStatement ClassNode class FunctionNode IfNode IfClause if ElifClause elif ElseClause else ForNode for MatchNode match MatchBranchNode PatternNode VarPatternNode IdentifierPatternNode LiteralPatternNode WildcardPatternNode WhileNode while\",\n maxTerm: 166,\n context: trackIndent,\n nodeProps: [\n [\"group\", -2,3,105,\"Statement\",-18,12,27,28,30,33,42,44,59,60,63,66,67,68,80,82,84,87,90,\"ExpressionNode\",-3,34,39,41,\"AssignableNode\"],\n [\"openedBy\", 9,\"(\"],\n [\"closedBy\", 10,\")\"]\n ],\n propSources: [gdscriptHighlighting],\n skippedNodes: [0,1],\n repeatNodeCount: 11,\n tokenData: \"Ae~R|XY#{pq#{qr$Wrs$est(Vtu(quv(vvw)Vwx)jxy-[yz-az{-f{|-y|}.T}!O.Y!O!P.l!P!Q/w!Q!R0R!R![0s![!]2e!]!^2l!^!_2q!_!`3U!`!a3^!a!b3z!b!c4S!c!}4X!}#O4j#P#Q4o#Q#R4t#R#S4|#T#U5a#U#Y4X#Y#Z6t#Z#b4X#b#c9U#c#dz#i#o4X#o#p@v#p#q@{#q#rA`~$QQ$X~XY#{pq#{R$]P!}P!_!`$`Q$eO!RQ~$hXOY$eZ]$e^r$ers%Ts#O$e#O#P%u#P;'S$e;'S;=`(P<%lO$e~%YX$_~OY$eZ]$e^r$ers%Ts#O$e#O#P%u#P;'S$e;'S;=`(P<%lO$e~%xVO#i$e#i#j&_#j#l$e#l#m&z#m;'S$e;'S;=`(P<%lO$e~&bS!Q![&n!c!i&n#T#Z&n#o#p'd~&qR!Q![&z!c!i&z#T#Z&z~&}R!Q!['W!c!i'W#T#Z'W~'ZR!Q![$e!c!i$e#T#Z$e~'gR!Q!['p!c!i'p#T#Z'p~'sS!Q!['p!c!i'p#T#Z'p#q#r$e~(SP;=`<%l$e~([TP~OY(VZ](V^;'S(V;'S;=`(k<%lO(V~(nP;=`<%l(V~(vO$b~R(}P$cP!OQ!_!`)QQ)VO$fQ~)[Q!U~vw)b!_!`)Q~)gP!W~!_!`)Q~)mXOY)jZ])j^w)jwx*Yx#O)j#O#P*z#P;'S)j;'S;=`-U<%lO)j~*_X$_~OY)jZ])j^w)jwx*Yx#O)j#O#P*z#P;'S)j;'S;=`-U<%lO)j~*}VO#i)j#i#j+d#j#l)j#l#m,P#m;'S)j;'S;=`-U<%lO)j~+gS!Q![+s!c!i+s#T#Z+s#o#p,i~+vR!Q![,P!c!i,P#T#Z,P~,SR!Q![,]!c!i,]#T#Z,]~,`R!Q![)j!c!i)j#T#Z)j~,lR!Q![,u!c!i,u#T#Z,u~,xS!Q![,u!c!i,u#T#Z,u#q#r)j~-XP;=`<%l)j~-aOY~~-fOX~~-kQ!OQz{-q!_!`)Q~-vP}~!_!`)QR.QP!}P!PQ!_!`)Q~.YOf~V.aQ!}P!PQ!_!`)Q!`!a.gS.lO$kS~.qPo~!Q![.t~.yS$^~!Q![.t!g!h/V#R#S/q#X#Y/V~/YQ{|/`}!O/`~/cP!Q![/f~/kQ$^~!Q![/f#R#S/`~/tP!Q![.t~0OP$d~!OQ!_!`)Q~0WX$]~!O!P/q!Q![0s!d!e1_!g!h/V!z!{1v#R#S1X#U#V1_#X#Y/V#l#m1v~0xT$]~!O!P/q!Q![0s!g!h/V#R#S1X#X#Y/V~1[P!Q![0s~1bQ!Q!R1h!R!S1h~1mR$]~!Q!R1h!R!S1h#R#S1_~1yR!Q![2S!c!i2S#T#Z2S~2XS$]~!Q![2S!c!i2S#R#S1v#T#Z2S~2lOu~!x~~2qO#[~~2vQ!RQ!^!_2|!_!`$`~3RP!Q~!_!`)Q~3ZP$g~!_!`$`~3cQ!RQ!_!`$`!`!a3i~3nQ!Q~!_!`)Q!`!a3tQ3wP!_!`)Q~4PP!w~!a!b3t~4XOV~~4^SW~!Q![4X!c!}4X#R#S4X#T#o4X~4oOp~~4tOj~~4yP!T~!_!`)Q~5TSW~$l~!Q![4X!c!}4X#R#S4X#T#o4X~5fUW~!Q![4X!c!}4X#R#S4X#T#b4X#b#c5x#c#o4X~5}UW~!Q![4X!c!}4X#R#S4X#T#W4X#W#X6a#X#o4X~6hS!V~W~!Q![4X!c!}4X#R#S4X#T#o4X~6yTW~!Q![4X!c!}4X#R#S4X#T#U7Y#U#o4X~7_UW~!Q![4X!c!}4X#R#S4X#T#`4X#`#a7q#a#o4X~7vUW~!Q![4X!c!}4X#R#S4X#T#g4X#g#h8Y#h#o4X~8_UW~!Q![4X!c!}4X#R#S4X#T#X4X#X#Y8q#Y#o4X~8xS^~W~!Q![4X!c!}4X#R#S4X#T#o4X~9ZWW~!Q![4X!c!}4X#R#S4X#T#c4X#c#d9s#d#i4X#i#j:o#j#o4X~9xUW~!Q![4X!c!}4X#R#S4X#T#h4X#h#i:[#i#o4X~:cS!Z~W~!Q![4X!c!}4X#R#S4X#T#o4X~:tUW~!Q![4X!c!}4X#R#S4X#T#`4X#`#a;W#a#o4X~;]UW~!Q![4X!c!}4X#R#S4X#T#`4X#`#a;o#a#o4X~;vS_~W~!Q![4X!c!}4X#R#S4X#T#o4X~O#a#o4X~>TUW~!Q![4X!c!}4X#R#S4X#T#Y4X#Y#Z>g#Z#o4X~>nS!u~W~!Q![4X!c!}4X#R#S4X#T#o4X~?PUW~!Q![4X!c!}4X#R#S4X#T#f4X#f#g?c#g#o4X~?hUW~!Q![4X!c!}4X#R#S4X#T#i4X#i#j?z#j#o4X~@PUW~!Q![4X!c!}4X#R#S4X#T#X4X#X#Y@c#Y#o4X~@jS]~W~!Q![4X!c!}4X#R#S4X#T#o4X~@{O!b~~AQQ!S~!_!`)Q#p#qAW~A]P!Y~!_!`)Q~AeO!`~\",\n tokenizers: [indentation, newlines, 0, 1, 2],\n topRules: {\"Script\":[0,2]},\n specialized: [{term: 8, get: value => spec_Identifier[value] || -1}],\n tokenPrec: 3645\n})\n", "import { ContextTracker, ExternalTokenizer } from \"@lezer/lr\";\nimport {\n // created\n // indentation\n indent,\n dedent,\n // newlines\n newline as newlineToken,\n blankLineStart,\n newlineBracketed,\n eof,\n // existing\n GroupedExpressionNode,\n ArrayExpressionNode,\n DictionaryExpressionNode,\n CallExpressionNode,\n CallParamsExpressionNode,\n CallParamsLiteralExpressionNode,\n CallParamsParameterNode,\n // tokens\n ParenL,\n BracketL,\n BraceL,\n} from \"./parser.terms\";\n\nconst bracketed = new Set([\n GroupedExpressionNode,\n ArrayExpressionNode,\n DictionaryExpressionNode,\n CallExpressionNode,\n CallParamsExpressionNode,\n CallParamsLiteralExpressionNode,\n CallParamsParameterNode,\n]);\n\nconst newline = \"\\n\".charCodeAt(0);\nconst carriageReturn = \"\\r\".charCodeAt(0);\nconst space = \" \".charCodeAt(0);\nconst tab = \"\\t\".charCodeAt(0);\nconst hash = \"#\".charCodeAt(0);\n\nclass IndentLevel {\n constructor(parent, depth) {\n this.parent = parent;\n // -1 means this is not an actual indent level but a set of brackets\n this.depth = depth;\n this.hash =\n (parent ? (parent.hash + parent.hash) << 8 : 0) + depth + (depth << 4);\n }\n}\n\nconst topIndent = new IndentLevel(null, 0);\n\nfunction isLineBreak(ch) {\n return ch === newline || ch === carriageReturn;\n}\n\nexport const newlines = new ExternalTokenizer(\n (input, stack) => {\n let prev;\n if (input.next < 0) {\n input.acceptToken(eof);\n } else if (stack.context.depth < 0) {\n if (isLineBreak(input.next)) {\n input.acceptToken(newlineBracketed, 1);\n }\n } else if (\n ((prev = input.peek(-1)) < 0 || isLineBreak(prev)) &&\n stack.canShift(blankLineStart)\n ) {\n let spaces = 0;\n while (input.next === space || input.next === tab) {\n input.advance();\n spaces++;\n }\n if (\n input.next === newline ||\n input.next === carriageReturn ||\n input.next === hash\n ) {\n input.acceptToken(blankLineStart, -spaces);\n }\n } else if (isLineBreak(input.next)) {\n input.acceptToken(newlineToken, 1);\n }\n },\n { contextual: true }\n);\n\nfunction countIndent(space) {\n let depth = 0;\n for (let i = 0; i < space.length; i++)\n depth += space.charCodeAt(i) === tab ? 8 - (depth % 8) : 1;\n return depth;\n}\n\nexport const trackIndent = new ContextTracker({\n start: topIndent,\n reduce(context, term) {\n return context.depth < 0 && bracketed.has(term) ? context.parent : context;\n },\n shift(context, term, stack, input) {\n switch (term) {\n case indent:\n return new IndentLevel(\n context,\n countIndent(input.read(input.pos, stack.pos))\n );\n case dedent:\n return context.parent;\n case ParenL:\n case BracketL:\n case BraceL:\n return new IndentLevel(context, -1);\n default:\n return context;\n }\n },\n hash(context) {\n return context.hash;\n },\n});\n\nexport const indentation = new ExternalTokenizer((input, stack) => {\n const contextDepth = stack.context.depth;\n if (contextDepth < 0) return;\n\n const prev = input.peek(-1);\n\n if (!(prev === newline || prev === carriageReturn)) {\n return;\n }\n\n let chars = 0;\n let depth = 0;\n\n while (true) {\n if (input.next === space) {\n depth++;\n } else if (input.next === tab) {\n depth += 8 - (depth % 8);\n } else {\n break;\n }\n\n input.advance();\n chars += 1;\n }\n\n if (\n depth !== contextDepth &&\n input.next !== newline &&\n input.next !== carriageReturn &&\n input.next !== hash\n ) {\n if (depth < contextDepth) {\n input.acceptToken(dedent, -chars);\n } else {\n input.acceptToken(indent);\n }\n }\n});\n", "// This file was generated by lezer-generator. You probably shouldn't edit it.\nexport const\n indent = 140,\n dedent = 141,\n newline = 142,\n blankLineStart = 143,\n newlineBracketed = 144,\n eof = 145,\n Comment = 1,\n Script = 2,\n SimpleStatement = 3,\n SmallStatement = 4,\n AnnotationNode = 6,\n Identifier = 8,\n ParenL = 10,\n CallParamsLiteralExpressionNode = 11,\n LiteralExpressionNode = 12,\n True = 13,\n False = 14,\n Null = 15,\n BuiltinConstants = 16,\n String = 21,\n AssertNode = 23,\n CallParamsExpressionNode = 25,\n ArrayExpressionNode = 27,\n SubscriptExpressionNode = 28,\n VariableName = 29,\n GetNodeExpressionNode = 30,\n BracketL = 32,\n VariableNode = 34,\n TypeCast = 36,\n Type = 38,\n ConstantNode = 39,\n ParameterNode = 41,\n AwaitExpressionNode = 42,\n BinaryOperatorExpressionNode = 44,\n AndOp = 53,\n OrOp = 55,\n NotOp = 57,\n CallExpressionNode = 59,\n CastExpressionNode = 60,\n DictionaryExpressionNode = 63,\n BraceL = 64,\n DictionaryEntry = 65,\n GroupedExpressionNode = 66,\n IdentifierExpressionNode = 67,\n LambdaExpressionNode = 68,\n CallParamsParameterNode = 70,\n FunctionReturnType = 72,\n Body = 73,\n SuiteNodeBody = 74,\n Newline = 75,\n SuiteNode = 76,\n Indent = 77,\n Dedent = 78,\n ExpressionNodeBody = 79,\n PreloadExpressionNode = 80,\n SelfToken = 83,\n TernaryOperatorExpressionNode = 84,\n TypeTestExpressionNode = 87,\n ClassName = 89,\n UnaryOperatorNode = 90,\n ClassNameStatement = 92,\n ExtendsStatement = 94,\n SignalStatement = 96,\n PassStatement = 98,\n ReturnNode = 100,\n Eof = 102,\n CompoundStatement = 105,\n ClassNode = 106,\n FunctionNode = 108,\n IfNode = 109,\n IfClause = 110,\n ElifClause = 112,\n ElseClause = 114,\n ForNode = 116,\n MatchNode = 118,\n MatchBranchNode = 120,\n PatternNode = 121,\n WhileNode = 126\n", "import { styleTags, tags as t } from \"@lezer/highlight\";\n\nexport const gdscriptHighlighting = styleTags({\n \"for while if elif else return break continue pass assert await match case\":\n t.controlKeyword,\n \"in not and or is del\": t.operatorKeyword,\n \"func class class_name extends const var\": t.definitionKeyword,\n \"preload load\": t.moduleKeyword,\n \"as PI TAU INF NaN\": t.keyword,\n True: t.bool,\n False: t.bool,\n Null: t.bool,\n Comment: t.lineComment,\n Number: t.number,\n String: t.string,\n UpdateOp: t.updateOperator,\n ArithOp: t.arithmeticOperator,\n BitOp: t.bitwiseOperator,\n CompareOp: t.compareOperator,\n AssignOp: t.definitionOperator,\n \"ClassNode/Identifier ClassNode/ExtendsStatement/Identifier VariableNode/TypeCast/Type/Identifier\":\n t.definition(t.className),\n \"( )\": t.paren,\n \"[ ]\": t.squareBracket,\n \"{ }\": t.brace,\n \".\": t.derefOperator,\n \", ;\": t.separator,\n});\n", "// FIXME profile adding a per-Tree TreeNode cache, validating it by\n// parent pointer\n/// The default maximum length of a `TreeBuffer` node.\nconst DefaultBufferLength = 1024;\nlet nextPropID = 0;\nclass Range {\n constructor(from, to) {\n this.from = from;\n this.to = to;\n }\n}\n/// Each [node type](#common.NodeType) or [individual tree](#common.Tree)\n/// can have metadata associated with it in props. Instances of this\n/// class represent prop names.\nclass NodeProp {\n /// Create a new node prop type.\n constructor(config = {}) {\n this.id = nextPropID++;\n this.perNode = !!config.perNode;\n this.deserialize = config.deserialize || (() => {\n throw new Error(\"This node type doesn't define a deserialize function\");\n });\n }\n /// This is meant to be used with\n /// [`NodeSet.extend`](#common.NodeSet.extend) or\n /// [`LRParser.configure`](#lr.ParserConfig.props) to compute\n /// prop values for each node type in the set. Takes a [match\n /// object](#common.NodeType^match) or function that returns undefined\n /// if the node type doesn't get this prop, and the prop's value if\n /// it does.\n add(match) {\n if (this.perNode)\n throw new RangeError(\"Can't add per-node props to node types\");\n if (typeof match != \"function\")\n match = NodeType.match(match);\n return (type) => {\n let result = match(type);\n return result === undefined ? null : [this, result];\n };\n }\n}\n/// Prop that is used to describe matching delimiters. For opening\n/// delimiters, this holds an array of node names (written as a\n/// space-separated string when declaring this prop in a grammar)\n/// for the node types of closing delimiters that match it.\nNodeProp.closedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/// The inverse of [`closedBy`](#common.NodeProp^closedBy). This is\n/// attached to closing delimiters, holding an array of node names\n/// of types of matching opening delimiters.\nNodeProp.openedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/// Used to assign node types to groups (for example, all node\n/// types that represent an expression could be tagged with an\n/// `\"Expression\"` group).\nNodeProp.group = new NodeProp({ deserialize: str => str.split(\" \") });\n/// The hash of the [context](#lr.ContextTracker.constructor)\n/// that the node was parsed in, if any. Used to limit reuse of\n/// contextual nodes.\nNodeProp.contextHash = new NodeProp({ perNode: true });\n/// The distance beyond the end of the node that the tokenizer\n/// looked ahead for any of the tokens inside the node. (The LR\n/// parser only stores this when it is larger than 25, for\n/// efficiency reasons.)\nNodeProp.lookAhead = new NodeProp({ perNode: true });\n/// This per-node prop is used to replace a given node, or part of a\n/// node, with another tree. This is useful to include trees from\n/// different languages in mixed-language parsers.\nNodeProp.mounted = new NodeProp({ perNode: true });\n/// A mounted tree, which can be [stored](#common.NodeProp^mounted) on\n/// a tree node to indicate that parts of its content are\n/// represented by another tree.\nclass MountedTree {\n constructor(\n /// The inner tree.\n tree, \n /// If this is null, this tree replaces the entire node (it will\n /// be included in the regular iteration instead of its host\n /// node). If not, only the given ranges are considered to be\n /// covered by this tree. This is used for trees that are mixed in\n /// a way that isn't strictly hierarchical. Such mounted trees are\n /// only entered by [`resolveInner`](#common.Tree.resolveInner)\n /// and [`enter`](#common.SyntaxNode.enter).\n overlay, \n /// The parser used to create this subtree.\n parser) {\n this.tree = tree;\n this.overlay = overlay;\n this.parser = parser;\n }\n}\nconst noProps = Object.create(null);\n/// Each node in a syntax tree has a node type associated with it.\nclass NodeType {\n /// @internal\n constructor(\n /// The name of the node type. Not necessarily unique, but if the\n /// grammar was written properly, different node types with the\n /// same name within a node set should play the same semantic\n /// role.\n name, \n /// @internal\n props, \n /// The id of this node in its set. Corresponds to the term ids\n /// used in the parser.\n id, \n /// @internal\n flags = 0) {\n this.name = name;\n this.props = props;\n this.id = id;\n this.flags = flags;\n }\n /// Define a node type.\n static define(spec) {\n let props = spec.props && spec.props.length ? Object.create(null) : noProps;\n let flags = (spec.top ? 1 /* NodeFlag.Top */ : 0) | (spec.skipped ? 2 /* NodeFlag.Skipped */ : 0) |\n (spec.error ? 4 /* NodeFlag.Error */ : 0) | (spec.name == null ? 8 /* NodeFlag.Anonymous */ : 0);\n let type = new NodeType(spec.name || \"\", props, spec.id, flags);\n if (spec.props)\n for (let src of spec.props) {\n if (!Array.isArray(src))\n src = src(type);\n if (src) {\n if (src[0].perNode)\n throw new RangeError(\"Can't store a per-node prop on a node type\");\n props[src[0].id] = src[1];\n }\n }\n return type;\n }\n /// Retrieves a node prop for this type. Will return `undefined` if\n /// the prop isn't present on this node.\n prop(prop) { return this.props[prop.id]; }\n /// True when this is the top node of a grammar.\n get isTop() { return (this.flags & 1 /* NodeFlag.Top */) > 0; }\n /// True when this node is produced by a skip rule.\n get isSkipped() { return (this.flags & 2 /* NodeFlag.Skipped */) > 0; }\n /// Indicates whether this is an error node.\n get isError() { return (this.flags & 4 /* NodeFlag.Error */) > 0; }\n /// When true, this node type doesn't correspond to a user-declared\n /// named node, for example because it is used to cache repetition.\n get isAnonymous() { return (this.flags & 8 /* NodeFlag.Anonymous */) > 0; }\n /// Returns true when this node's name or one of its\n /// [groups](#common.NodeProp^group) matches the given string.\n is(name) {\n if (typeof name == 'string') {\n if (this.name == name)\n return true;\n let group = this.prop(NodeProp.group);\n return group ? group.indexOf(name) > -1 : false;\n }\n return this.id == name;\n }\n /// Create a function from node types to arbitrary values by\n /// specifying an object whose property names are node or\n /// [group](#common.NodeProp^group) names. Often useful with\n /// [`NodeProp.add`](#common.NodeProp.add). You can put multiple\n /// names, separated by spaces, in a single property name to map\n /// multiple node names to a single value.\n static match(map) {\n let direct = Object.create(null);\n for (let prop in map)\n for (let name of prop.split(\" \"))\n direct[name] = map[prop];\n return (node) => {\n for (let groups = node.prop(NodeProp.group), i = -1; i < (groups ? groups.length : 0); i++) {\n let found = direct[i < 0 ? node.name : groups[i]];\n if (found)\n return found;\n }\n };\n }\n}\n/// An empty dummy node type to use when no actual type is available.\nNodeType.none = new NodeType(\"\", Object.create(null), 0, 8 /* NodeFlag.Anonymous */);\n/// A node set holds a collection of node types. It is used to\n/// compactly represent trees by storing their type ids, rather than a\n/// full pointer to the type object, in a numeric array. Each parser\n/// [has](#lr.LRParser.nodeSet) a node set, and [tree\n/// buffers](#common.TreeBuffer) can only store collections of nodes\n/// from the same set. A set can have a maximum of 2**16 (65536) node\n/// types in it, so that the ids fit into 16-bit typed array slots.\nclass NodeSet {\n /// Create a set with the given types. The `id` property of each\n /// type should correspond to its position within the array.\n constructor(\n /// The node types in this set, by id.\n types) {\n this.types = types;\n for (let i = 0; i < types.length; i++)\n if (types[i].id != i)\n throw new RangeError(\"Node type ids should correspond to array positions when creating a node set\");\n }\n /// Create a copy of this set with some node properties added. The\n /// arguments to this method can be created with\n /// [`NodeProp.add`](#common.NodeProp.add).\n extend(...props) {\n let newTypes = [];\n for (let type of this.types) {\n let newProps = null;\n for (let source of props) {\n let add = source(type);\n if (add) {\n if (!newProps)\n newProps = Object.assign({}, type.props);\n newProps[add[0].id] = add[1];\n }\n }\n newTypes.push(newProps ? new NodeType(type.name, newProps, type.id, type.flags) : type);\n }\n return new NodeSet(newTypes);\n }\n}\nconst CachedNode = new WeakMap(), CachedInnerNode = new WeakMap();\n/// Options that control iteration. Can be combined with the `|`\n/// operator to enable multiple ones.\nvar IterMode;\n(function (IterMode) {\n /// When enabled, iteration will only visit [`Tree`](#common.Tree)\n /// objects, not nodes packed into\n /// [`TreeBuffer`](#common.TreeBuffer)s.\n IterMode[IterMode[\"ExcludeBuffers\"] = 1] = \"ExcludeBuffers\";\n /// Enable this to make iteration include anonymous nodes (such as\n /// the nodes that wrap repeated grammar constructs into a balanced\n /// tree).\n IterMode[IterMode[\"IncludeAnonymous\"] = 2] = \"IncludeAnonymous\";\n /// By default, regular [mounted](#common.NodeProp^mounted) nodes\n /// replace their base node in iteration. Enable this to ignore them\n /// instead.\n IterMode[IterMode[\"IgnoreMounts\"] = 4] = \"IgnoreMounts\";\n /// This option only applies in\n /// [`enter`](#common.SyntaxNode.enter)-style methods. It tells the\n /// library to not enter mounted overlays if one covers the given\n /// position.\n IterMode[IterMode[\"IgnoreOverlays\"] = 8] = \"IgnoreOverlays\";\n})(IterMode || (IterMode = {}));\n/// A piece of syntax tree. There are two ways to approach these\n/// trees: the way they are actually stored in memory, and the\n/// convenient way.\n///\n/// Syntax trees are stored as a tree of `Tree` and `TreeBuffer`\n/// objects. By packing detail information into `TreeBuffer` leaf\n/// nodes, the representation is made a lot more memory-efficient.\n///\n/// However, when you want to actually work with tree nodes, this\n/// representation is very awkward, so most client code will want to\n/// use the [`TreeCursor`](#common.TreeCursor) or\n/// [`SyntaxNode`](#common.SyntaxNode) interface instead, which provides\n/// a view on some part of this data structure, and can be used to\n/// move around to adjacent nodes.\nclass Tree {\n /// Construct a new tree. See also [`Tree.build`](#common.Tree^build).\n constructor(\n /// The type of the top node.\n type, \n /// This node's child nodes.\n children, \n /// The positions (offsets relative to the start of this tree) of\n /// the children.\n positions, \n /// The total length of this tree\n length, \n /// Per-node [node props](#common.NodeProp) to associate with this node.\n props) {\n this.type = type;\n this.children = children;\n this.positions = positions;\n this.length = length;\n /// @internal\n this.props = null;\n if (props && props.length) {\n this.props = Object.create(null);\n for (let [prop, value] of props)\n this.props[typeof prop == \"number\" ? prop : prop.id] = value;\n }\n }\n /// @internal\n toString() {\n let mounted = this.prop(NodeProp.mounted);\n if (mounted && !mounted.overlay)\n return mounted.tree.toString();\n let children = \"\";\n for (let ch of this.children) {\n let str = ch.toString();\n if (str) {\n if (children)\n children += \",\";\n children += str;\n }\n }\n return !this.type.name ? children :\n (/\\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) +\n (children.length ? \"(\" + children + \")\" : \"\");\n }\n /// Get a [tree cursor](#common.TreeCursor) positioned at the top of\n /// the tree. Mode can be used to [control](#common.IterMode) which\n /// nodes the cursor visits.\n cursor(mode = 0) {\n return new TreeCursor(this.topNode, mode);\n }\n /// Get a [tree cursor](#common.TreeCursor) pointing into this tree\n /// at the given position and side (see\n /// [`moveTo`](#common.TreeCursor.moveTo).\n cursorAt(pos, side = 0, mode = 0) {\n let scope = CachedNode.get(this) || this.topNode;\n let cursor = new TreeCursor(scope);\n cursor.moveTo(pos, side);\n CachedNode.set(this, cursor._tree);\n return cursor;\n }\n /// Get a [syntax node](#common.SyntaxNode) object for the top of the\n /// tree.\n get topNode() {\n return new TreeNode(this, 0, 0, null);\n }\n /// Get the [syntax node](#common.SyntaxNode) at the given position.\n /// If `side` is -1, this will move into nodes that end at the\n /// position. If 1, it'll move into nodes that start at the\n /// position. With 0, it'll only enter nodes that cover the position\n /// from both sides.\n ///\n /// Note that this will not enter\n /// [overlays](#common.MountedTree.overlay), and you often want\n /// [`resolveInner`](#common.Tree.resolveInner) instead.\n resolve(pos, side = 0) {\n let node = resolveNode(CachedNode.get(this) || this.topNode, pos, side, false);\n CachedNode.set(this, node);\n return node;\n }\n /// Like [`resolve`](#common.Tree.resolve), but will enter\n /// [overlaid](#common.MountedTree.overlay) nodes, producing a syntax node\n /// pointing into the innermost overlaid tree at the given position\n /// (with parent links going through all parent structure, including\n /// the host trees).\n resolveInner(pos, side = 0) {\n let node = resolveNode(CachedInnerNode.get(this) || this.topNode, pos, side, true);\n CachedInnerNode.set(this, node);\n return node;\n }\n /// Iterate over the tree and its children, calling `enter` for any\n /// node that touches the `from`/`to` region (if given) before\n /// running over such a node's children, and `leave` (if given) when\n /// leaving the node. When `enter` returns `false`, that node will\n /// not have its children iterated over (or `leave` called).\n iterate(spec) {\n let { enter, leave, from = 0, to = this.length } = spec;\n let mode = spec.mode || 0, anon = (mode & IterMode.IncludeAnonymous) > 0;\n for (let c = this.cursor(mode | IterMode.IncludeAnonymous);;) {\n let entered = false;\n if (c.from <= to && c.to >= from && (!anon && c.type.isAnonymous || enter(c) !== false)) {\n if (c.firstChild())\n continue;\n entered = true;\n }\n for (;;) {\n if (entered && leave && (anon || !c.type.isAnonymous))\n leave(c);\n if (c.nextSibling())\n break;\n if (!c.parent())\n return;\n entered = true;\n }\n }\n }\n /// Get the value of the given [node prop](#common.NodeProp) for this\n /// node. Works with both per-node and per-type props.\n prop(prop) {\n return !prop.perNode ? this.type.prop(prop) : this.props ? this.props[prop.id] : undefined;\n }\n /// Returns the node's [per-node props](#common.NodeProp.perNode) in a\n /// format that can be passed to the [`Tree`](#common.Tree)\n /// constructor.\n get propValues() {\n let result = [];\n if (this.props)\n for (let id in this.props)\n result.push([+id, this.props[id]]);\n return result;\n }\n /// Balance the direct children of this tree, producing a copy of\n /// which may have children grouped into subtrees with type\n /// [`NodeType.none`](#common.NodeType^none).\n balance(config = {}) {\n return this.children.length <= 8 /* Balance.BranchFactor */ ? this :\n balanceRange(NodeType.none, this.children, this.positions, 0, this.children.length, 0, this.length, (children, positions, length) => new Tree(this.type, children, positions, length, this.propValues), config.makeTree || ((children, positions, length) => new Tree(NodeType.none, children, positions, length)));\n }\n /// Build a tree from a postfix-ordered buffer of node information,\n /// or a cursor over such a buffer.\n static build(data) { return buildTree(data); }\n}\n/// The empty tree\nTree.empty = new Tree(NodeType.none, [], [], 0);\nclass FlatBufferCursor {\n constructor(buffer, index) {\n this.buffer = buffer;\n this.index = index;\n }\n get id() { return this.buffer[this.index - 4]; }\n get start() { return this.buffer[this.index - 3]; }\n get end() { return this.buffer[this.index - 2]; }\n get size() { return this.buffer[this.index - 1]; }\n get pos() { return this.index; }\n next() { this.index -= 4; }\n fork() { return new FlatBufferCursor(this.buffer, this.index); }\n}\n/// Tree buffers contain (type, start, end, endIndex) quads for each\n/// node. In such a buffer, nodes are stored in prefix order (parents\n/// before children, with the endIndex of the parent indicating which\n/// children belong to it).\nclass TreeBuffer {\n /// Create a tree buffer.\n constructor(\n /// The buffer's content.\n buffer, \n /// The total length of the group of nodes in the buffer.\n length, \n /// The node set used in this buffer.\n set) {\n this.buffer = buffer;\n this.length = length;\n this.set = set;\n }\n /// @internal\n get type() { return NodeType.none; }\n /// @internal\n toString() {\n let result = [];\n for (let index = 0; index < this.buffer.length;) {\n result.push(this.childString(index));\n index = this.buffer[index + 3];\n }\n return result.join(\",\");\n }\n /// @internal\n childString(index) {\n let id = this.buffer[index], endIndex = this.buffer[index + 3];\n let type = this.set.types[id], result = type.name;\n if (/\\W/.test(result) && !type.isError)\n result = JSON.stringify(result);\n index += 4;\n if (endIndex == index)\n return result;\n let children = [];\n while (index < endIndex) {\n children.push(this.childString(index));\n index = this.buffer[index + 3];\n }\n return result + \"(\" + children.join(\",\") + \")\";\n }\n /// @internal\n findChild(startIndex, endIndex, dir, pos, side) {\n let { buffer } = this, pick = -1;\n for (let i = startIndex; i != endIndex; i = buffer[i + 3]) {\n if (checkSide(side, pos, buffer[i + 1], buffer[i + 2])) {\n pick = i;\n if (dir > 0)\n break;\n }\n }\n return pick;\n }\n /// @internal\n slice(startI, endI, from) {\n let b = this.buffer;\n let copy = new Uint16Array(endI - startI), len = 0;\n for (let i = startI, j = 0; i < endI;) {\n copy[j++] = b[i++];\n copy[j++] = b[i++] - from;\n let to = copy[j++] = b[i++] - from;\n copy[j++] = b[i++] - startI;\n len = Math.max(len, to);\n }\n return new TreeBuffer(copy, len, this.set);\n }\n}\nfunction checkSide(side, pos, from, to) {\n switch (side) {\n case -2 /* Side.Before */: return from < pos;\n case -1 /* Side.AtOrBefore */: return to >= pos && from < pos;\n case 0 /* Side.Around */: return from < pos && to > pos;\n case 1 /* Side.AtOrAfter */: return from <= pos && to > pos;\n case 2 /* Side.After */: return to > pos;\n case 4 /* Side.DontCare */: return true;\n }\n}\nfunction enterUnfinishedNodesBefore(node, pos) {\n let scan = node.childBefore(pos);\n while (scan) {\n let last = scan.lastChild;\n if (!last || last.to != scan.to)\n break;\n if (last.type.isError && last.from == last.to) {\n node = scan;\n scan = last.prevSibling;\n }\n else {\n scan = last;\n }\n }\n return node;\n}\nfunction resolveNode(node, pos, side, overlays) {\n var _a;\n // Move up to a node that actually holds the position, if possible\n while (node.from == node.to ||\n (side < 1 ? node.from >= pos : node.from > pos) ||\n (side > -1 ? node.to <= pos : node.to < pos)) {\n let parent = !overlays && node instanceof TreeNode && node.index < 0 ? null : node.parent;\n if (!parent)\n return node;\n node = parent;\n }\n let mode = overlays ? 0 : IterMode.IgnoreOverlays;\n // Must go up out of overlays when those do not overlap with pos\n if (overlays)\n for (let scan = node, parent = scan.parent; parent; scan = parent, parent = scan.parent) {\n if (scan instanceof TreeNode && scan.index < 0 && ((_a = parent.enter(pos, side, mode)) === null || _a === void 0 ? void 0 : _a.from) != scan.from)\n node = parent;\n }\n for (;;) {\n let inner = node.enter(pos, side, mode);\n if (!inner)\n return node;\n node = inner;\n }\n}\nclass TreeNode {\n constructor(_tree, from, \n // Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay)\n index, _parent) {\n this._tree = _tree;\n this.from = from;\n this.index = index;\n this._parent = _parent;\n }\n get type() { return this._tree.type; }\n get name() { return this._tree.type.name; }\n get to() { return this.from + this._tree.length; }\n nextChild(i, dir, pos, side, mode = 0) {\n for (let parent = this;;) {\n for (let { children, positions } = parent._tree, e = dir > 0 ? children.length : -1; i != e; i += dir) {\n let next = children[i], start = positions[i] + parent.from;\n if (!checkSide(side, pos, start, start + next.length))\n continue;\n if (next instanceof TreeBuffer) {\n if (mode & IterMode.ExcludeBuffers)\n continue;\n let index = next.findChild(0, next.buffer.length, dir, pos - start, side);\n if (index > -1)\n return new BufferNode(new BufferContext(parent, next, i, start), null, index);\n }\n else if ((mode & IterMode.IncludeAnonymous) || (!next.type.isAnonymous || hasChild(next))) {\n let mounted;\n if (!(mode & IterMode.IgnoreMounts) &&\n next.props && (mounted = next.prop(NodeProp.mounted)) && !mounted.overlay)\n return new TreeNode(mounted.tree, start, i, parent);\n let inner = new TreeNode(next, start, i, parent);\n return (mode & IterMode.IncludeAnonymous) || !inner.type.isAnonymous ? inner\n : inner.nextChild(dir < 0 ? next.children.length - 1 : 0, dir, pos, side);\n }\n }\n if ((mode & IterMode.IncludeAnonymous) || !parent.type.isAnonymous)\n return null;\n if (parent.index >= 0)\n i = parent.index + dir;\n else\n i = dir < 0 ? -1 : parent._parent._tree.children.length;\n parent = parent._parent;\n if (!parent)\n return null;\n }\n }\n get firstChild() { return this.nextChild(0, 1, 0, 4 /* Side.DontCare */); }\n get lastChild() { return this.nextChild(this._tree.children.length - 1, -1, 0, 4 /* Side.DontCare */); }\n childAfter(pos) { return this.nextChild(0, 1, pos, 2 /* Side.After */); }\n childBefore(pos) { return this.nextChild(this._tree.children.length - 1, -1, pos, -2 /* Side.Before */); }\n enter(pos, side, mode = 0) {\n let mounted;\n if (!(mode & IterMode.IgnoreOverlays) && (mounted = this._tree.prop(NodeProp.mounted)) && mounted.overlay) {\n let rPos = pos - this.from;\n for (let { from, to } of mounted.overlay) {\n if ((side > 0 ? from <= rPos : from < rPos) &&\n (side < 0 ? to >= rPos : to > rPos))\n return new TreeNode(mounted.tree, mounted.overlay[0].from + this.from, -1, this);\n }\n }\n return this.nextChild(0, 1, pos, side, mode);\n }\n nextSignificantParent() {\n let val = this;\n while (val.type.isAnonymous && val._parent)\n val = val._parent;\n return val;\n }\n get parent() {\n return this._parent ? this._parent.nextSignificantParent() : null;\n }\n get nextSibling() {\n return this._parent && this.index >= 0 ? this._parent.nextChild(this.index + 1, 1, 0, 4 /* Side.DontCare */) : null;\n }\n get prevSibling() {\n return this._parent && this.index >= 0 ? this._parent.nextChild(this.index - 1, -1, 0, 4 /* Side.DontCare */) : null;\n }\n cursor(mode = 0) { return new TreeCursor(this, mode); }\n get tree() { return this._tree; }\n toTree() { return this._tree; }\n resolve(pos, side = 0) {\n return resolveNode(this, pos, side, false);\n }\n resolveInner(pos, side = 0) {\n return resolveNode(this, pos, side, true);\n }\n enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); }\n getChild(type, before = null, after = null) {\n let r = getChildren(this, type, before, after);\n return r.length ? r[0] : null;\n }\n getChildren(type, before = null, after = null) {\n return getChildren(this, type, before, after);\n }\n /// @internal\n toString() { return this._tree.toString(); }\n get node() { return this; }\n matchContext(context) { return matchNodeContext(this, context); }\n}\nfunction getChildren(node, type, before, after) {\n let cur = node.cursor(), result = [];\n if (!cur.firstChild())\n return result;\n if (before != null)\n while (!cur.type.is(before))\n if (!cur.nextSibling())\n return result;\n for (;;) {\n if (after != null && cur.type.is(after))\n return result;\n if (cur.type.is(type))\n result.push(cur.node);\n if (!cur.nextSibling())\n return after == null ? result : [];\n }\n}\nfunction matchNodeContext(node, context, i = context.length - 1) {\n for (let p = node.parent; i >= 0; p = p.parent) {\n if (!p)\n return false;\n if (!p.type.isAnonymous) {\n if (context[i] && context[i] != p.name)\n return false;\n i--;\n }\n }\n return true;\n}\nclass BufferContext {\n constructor(parent, buffer, index, start) {\n this.parent = parent;\n this.buffer = buffer;\n this.index = index;\n this.start = start;\n }\n}\nclass BufferNode {\n get name() { return this.type.name; }\n get from() { return this.context.start + this.context.buffer.buffer[this.index + 1]; }\n get to() { return this.context.start + this.context.buffer.buffer[this.index + 2]; }\n constructor(context, _parent, index) {\n this.context = context;\n this._parent = _parent;\n this.index = index;\n this.type = context.buffer.set.types[context.buffer.buffer[index]];\n }\n child(dir, pos, side) {\n let { buffer } = this.context;\n let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.context.start, side);\n return index < 0 ? null : new BufferNode(this.context, this, index);\n }\n get firstChild() { return this.child(1, 0, 4 /* Side.DontCare */); }\n get lastChild() { return this.child(-1, 0, 4 /* Side.DontCare */); }\n childAfter(pos) { return this.child(1, pos, 2 /* Side.After */); }\n childBefore(pos) { return this.child(-1, pos, -2 /* Side.Before */); }\n enter(pos, side, mode = 0) {\n if (mode & IterMode.ExcludeBuffers)\n return null;\n let { buffer } = this.context;\n let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], side > 0 ? 1 : -1, pos - this.context.start, side);\n return index < 0 ? null : new BufferNode(this.context, this, index);\n }\n get parent() {\n return this._parent || this.context.parent.nextSignificantParent();\n }\n externalSibling(dir) {\n return this._parent ? null : this.context.parent.nextChild(this.context.index + dir, dir, 0, 4 /* Side.DontCare */);\n }\n get nextSibling() {\n let { buffer } = this.context;\n let after = buffer.buffer[this.index + 3];\n if (after < (this._parent ? buffer.buffer[this._parent.index + 3] : buffer.buffer.length))\n return new BufferNode(this.context, this._parent, after);\n return this.externalSibling(1);\n }\n get prevSibling() {\n let { buffer } = this.context;\n let parentStart = this._parent ? this._parent.index + 4 : 0;\n if (this.index == parentStart)\n return this.externalSibling(-1);\n return new BufferNode(this.context, this._parent, buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n }\n cursor(mode = 0) { return new TreeCursor(this, mode); }\n get tree() { return null; }\n toTree() {\n let children = [], positions = [];\n let { buffer } = this.context;\n let startI = this.index + 4, endI = buffer.buffer[this.index + 3];\n if (endI > startI) {\n let from = buffer.buffer[this.index + 1];\n children.push(buffer.slice(startI, endI, from));\n positions.push(0);\n }\n return new Tree(this.type, children, positions, this.to - this.from);\n }\n resolve(pos, side = 0) {\n return resolveNode(this, pos, side, false);\n }\n resolveInner(pos, side = 0) {\n return resolveNode(this, pos, side, true);\n }\n enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); }\n /// @internal\n toString() { return this.context.buffer.childString(this.index); }\n getChild(type, before = null, after = null) {\n let r = getChildren(this, type, before, after);\n return r.length ? r[0] : null;\n }\n getChildren(type, before = null, after = null) {\n return getChildren(this, type, before, after);\n }\n get node() { return this; }\n matchContext(context) { return matchNodeContext(this, context); }\n}\n/// A tree cursor object focuses on a given node in a syntax tree, and\n/// allows you to move to adjacent nodes.\nclass TreeCursor {\n /// Shorthand for `.type.name`.\n get name() { return this.type.name; }\n /// @internal\n constructor(node, \n /// @internal\n mode = 0) {\n this.mode = mode;\n /// @internal\n this.buffer = null;\n this.stack = [];\n /// @internal\n this.index = 0;\n this.bufferNode = null;\n if (node instanceof TreeNode) {\n this.yieldNode(node);\n }\n else {\n this._tree = node.context.parent;\n this.buffer = node.context;\n for (let n = node._parent; n; n = n._parent)\n this.stack.unshift(n.index);\n this.bufferNode = node;\n this.yieldBuf(node.index);\n }\n }\n yieldNode(node) {\n if (!node)\n return false;\n this._tree = node;\n this.type = node.type;\n this.from = node.from;\n this.to = node.to;\n return true;\n }\n yieldBuf(index, type) {\n this.index = index;\n let { start, buffer } = this.buffer;\n this.type = type || buffer.set.types[buffer.buffer[index]];\n this.from = start + buffer.buffer[index + 1];\n this.to = start + buffer.buffer[index + 2];\n return true;\n }\n yield(node) {\n if (!node)\n return false;\n if (node instanceof TreeNode) {\n this.buffer = null;\n return this.yieldNode(node);\n }\n this.buffer = node.context;\n return this.yieldBuf(node.index, node.type);\n }\n /// @internal\n toString() {\n return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();\n }\n /// @internal\n enterChild(dir, pos, side) {\n if (!this.buffer)\n return this.yield(this._tree.nextChild(dir < 0 ? this._tree._tree.children.length - 1 : 0, dir, pos, side, this.mode));\n let { buffer } = this.buffer;\n let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.buffer.start, side);\n if (index < 0)\n return false;\n this.stack.push(this.index);\n return this.yieldBuf(index);\n }\n /// Move the cursor to this node's first child. When this returns\n /// false, the node has no child, and the cursor has not been moved.\n firstChild() { return this.enterChild(1, 0, 4 /* Side.DontCare */); }\n /// Move the cursor to this node's last child.\n lastChild() { return this.enterChild(-1, 0, 4 /* Side.DontCare */); }\n /// Move the cursor to the first child that ends after `pos`.\n childAfter(pos) { return this.enterChild(1, pos, 2 /* Side.After */); }\n /// Move to the last child that starts before `pos`.\n childBefore(pos) { return this.enterChild(-1, pos, -2 /* Side.Before */); }\n /// Move the cursor to the child around `pos`. If side is -1 the\n /// child may end at that position, when 1 it may start there. This\n /// will also enter [overlaid](#common.MountedTree.overlay)\n /// [mounted](#common.NodeProp^mounted) trees unless `overlays` is\n /// set to false.\n enter(pos, side, mode = this.mode) {\n if (!this.buffer)\n return this.yield(this._tree.enter(pos, side, mode));\n return mode & IterMode.ExcludeBuffers ? false : this.enterChild(1, pos, side);\n }\n /// Move to the node's parent node, if this isn't the top node.\n parent() {\n if (!this.buffer)\n return this.yieldNode((this.mode & IterMode.IncludeAnonymous) ? this._tree._parent : this._tree.parent);\n if (this.stack.length)\n return this.yieldBuf(this.stack.pop());\n let parent = (this.mode & IterMode.IncludeAnonymous) ? this.buffer.parent : this.buffer.parent.nextSignificantParent();\n this.buffer = null;\n return this.yieldNode(parent);\n }\n /// @internal\n sibling(dir) {\n if (!this.buffer)\n return !this._tree._parent ? false\n : this.yield(this._tree.index < 0 ? null\n : this._tree._parent.nextChild(this._tree.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode));\n let { buffer } = this.buffer, d = this.stack.length - 1;\n if (dir < 0) {\n let parentStart = d < 0 ? 0 : this.stack[d] + 4;\n if (this.index != parentStart)\n return this.yieldBuf(buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n }\n else {\n let after = buffer.buffer[this.index + 3];\n if (after < (d < 0 ? buffer.buffer.length : buffer.buffer[this.stack[d] + 3]))\n return this.yieldBuf(after);\n }\n return d < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode)) : false;\n }\n /// Move to this node's next sibling, if any.\n nextSibling() { return this.sibling(1); }\n /// Move to this node's previous sibling, if any.\n prevSibling() { return this.sibling(-1); }\n atLastNode(dir) {\n let index, parent, { buffer } = this;\n if (buffer) {\n if (dir > 0) {\n if (this.index < buffer.buffer.buffer.length)\n return false;\n }\n else {\n for (let i = 0; i < this.index; i++)\n if (buffer.buffer.buffer[i + 3] < this.index)\n return false;\n }\n ({ index, parent } = buffer);\n }\n else {\n ({ index, _parent: parent } = this._tree);\n }\n for (; parent; { index, _parent: parent } = parent) {\n if (index > -1)\n for (let i = index + dir, e = dir < 0 ? -1 : parent._tree.children.length; i != e; i += dir) {\n let child = parent._tree.children[i];\n if ((this.mode & IterMode.IncludeAnonymous) ||\n child instanceof TreeBuffer ||\n !child.type.isAnonymous ||\n hasChild(child))\n return false;\n }\n }\n return true;\n }\n move(dir, enter) {\n if (enter && this.enterChild(dir, 0, 4 /* Side.DontCare */))\n return true;\n for (;;) {\n if (this.sibling(dir))\n return true;\n if (this.atLastNode(dir) || !this.parent())\n return false;\n }\n }\n /// Move to the next node in a\n /// [pre-order](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order,_NLR)\n /// traversal, going from a node to its first child or, if the\n /// current node is empty or `enter` is false, its next sibling or\n /// the next sibling of the first parent node that has one.\n next(enter = true) { return this.move(1, enter); }\n /// Move to the next node in a last-to-first pre-order traveral. A\n /// node is followed by its last child or, if it has none, its\n /// previous sibling or the previous sibling of the first parent\n /// node that has one.\n prev(enter = true) { return this.move(-1, enter); }\n /// Move the cursor to the innermost node that covers `pos`. If\n /// `side` is -1, it will enter nodes that end at `pos`. If it is 1,\n /// it will enter nodes that start at `pos`.\n moveTo(pos, side = 0) {\n // Move up to a node that actually holds the position, if possible\n while (this.from == this.to ||\n (side < 1 ? this.from >= pos : this.from > pos) ||\n (side > -1 ? this.to <= pos : this.to < pos))\n if (!this.parent())\n break;\n // Then scan down into child nodes as far as possible\n while (this.enterChild(1, pos, side)) { }\n return this;\n }\n /// Get a [syntax node](#common.SyntaxNode) at the cursor's current\n /// position.\n get node() {\n if (!this.buffer)\n return this._tree;\n let cache = this.bufferNode, result = null, depth = 0;\n if (cache && cache.context == this.buffer) {\n scan: for (let index = this.index, d = this.stack.length; d >= 0;) {\n for (let c = cache; c; c = c._parent)\n if (c.index == index) {\n if (index == this.index)\n return c;\n result = c;\n depth = d + 1;\n break scan;\n }\n index = this.stack[--d];\n }\n }\n for (let i = depth; i < this.stack.length; i++)\n result = new BufferNode(this.buffer, result, this.stack[i]);\n return this.bufferNode = new BufferNode(this.buffer, result, this.index);\n }\n /// Get the [tree](#common.Tree) that represents the current node, if\n /// any. Will return null when the node is in a [tree\n /// buffer](#common.TreeBuffer).\n get tree() {\n return this.buffer ? null : this._tree._tree;\n }\n /// Iterate over the current node and all its descendants, calling\n /// `enter` when entering a node and `leave`, if given, when leaving\n /// one. When `enter` returns `false`, any children of that node are\n /// skipped, and `leave` isn't called for it.\n iterate(enter, leave) {\n for (let depth = 0;;) {\n let mustLeave = false;\n if (this.type.isAnonymous || enter(this) !== false) {\n if (this.firstChild()) {\n depth++;\n continue;\n }\n if (!this.type.isAnonymous)\n mustLeave = true;\n }\n for (;;) {\n if (mustLeave && leave)\n leave(this);\n mustLeave = this.type.isAnonymous;\n if (this.nextSibling())\n break;\n if (!depth)\n return;\n this.parent();\n depth--;\n mustLeave = true;\n }\n }\n }\n /// Test whether the current node matches a given context\u2014a sequence\n /// of direct parent node names. Empty strings in the context array\n /// are treated as wildcards.\n matchContext(context) {\n if (!this.buffer)\n return matchNodeContext(this.node, context);\n let { buffer } = this.buffer, { types } = buffer.set;\n for (let i = context.length - 1, d = this.stack.length - 1; i >= 0; d--) {\n if (d < 0)\n return matchNodeContext(this.node, context, i);\n let type = types[buffer.buffer[this.stack[d]]];\n if (!type.isAnonymous) {\n if (context[i] && context[i] != type.name)\n return false;\n i--;\n }\n }\n return true;\n }\n}\nfunction hasChild(tree) {\n return tree.children.some(ch => ch instanceof TreeBuffer || !ch.type.isAnonymous || hasChild(ch));\n}\nfunction buildTree(data) {\n var _a;\n let { buffer, nodeSet, maxBufferLength = DefaultBufferLength, reused = [], minRepeatType = nodeSet.types.length } = data;\n let cursor = Array.isArray(buffer) ? new FlatBufferCursor(buffer, buffer.length) : buffer;\n let types = nodeSet.types;\n let contextHash = 0, lookAhead = 0;\n function takeNode(parentStart, minPos, children, positions, inRepeat) {\n let { id, start, end, size } = cursor;\n let lookAheadAtStart = lookAhead;\n while (size < 0) {\n cursor.next();\n if (size == -1 /* SpecialRecord.Reuse */) {\n let node = reused[id];\n children.push(node);\n positions.push(start - parentStart);\n return;\n }\n else if (size == -3 /* SpecialRecord.ContextChange */) { // Context change\n contextHash = id;\n return;\n }\n else if (size == -4 /* SpecialRecord.LookAhead */) {\n lookAhead = id;\n return;\n }\n else {\n throw new RangeError(`Unrecognized record size: ${size}`);\n }\n }\n let type = types[id], node, buffer;\n let startPos = start - parentStart;\n if (end - start <= maxBufferLength && (buffer = findBufferSize(cursor.pos - minPos, inRepeat))) {\n // Small enough for a buffer, and no reused nodes inside\n let data = new Uint16Array(buffer.size - buffer.skip);\n let endPos = cursor.pos - buffer.size, index = data.length;\n while (cursor.pos > endPos)\n index = copyToBuffer(buffer.start, data, index);\n node = new TreeBuffer(data, end - buffer.start, nodeSet);\n startPos = buffer.start - parentStart;\n }\n else { // Make it a node\n let endPos = cursor.pos - size;\n cursor.next();\n let localChildren = [], localPositions = [];\n let localInRepeat = id >= minRepeatType ? id : -1;\n let lastGroup = 0, lastEnd = end;\n while (cursor.pos > endPos) {\n if (localInRepeat >= 0 && cursor.id == localInRepeat && cursor.size >= 0) {\n if (cursor.end <= lastEnd - maxBufferLength) {\n makeRepeatLeaf(localChildren, localPositions, start, lastGroup, cursor.end, lastEnd, localInRepeat, lookAheadAtStart);\n lastGroup = localChildren.length;\n lastEnd = cursor.end;\n }\n cursor.next();\n }\n else {\n takeNode(start, endPos, localChildren, localPositions, localInRepeat);\n }\n }\n if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length)\n makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart);\n localChildren.reverse();\n localPositions.reverse();\n if (localInRepeat > -1 && lastGroup > 0) {\n let make = makeBalanced(type);\n node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make);\n }\n else {\n node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end);\n }\n }\n children.push(node);\n positions.push(startPos);\n }\n function makeBalanced(type) {\n return (children, positions, length) => {\n let lookAhead = 0, lastI = children.length - 1, last, lookAheadProp;\n if (lastI >= 0 && (last = children[lastI]) instanceof Tree) {\n if (!lastI && last.type == type && last.length == length)\n return last;\n if (lookAheadProp = last.prop(NodeProp.lookAhead))\n lookAhead = positions[lastI] + last.length + lookAheadProp;\n }\n return makeTree(type, children, positions, length, lookAhead);\n };\n }\n function makeRepeatLeaf(children, positions, base, i, from, to, type, lookAhead) {\n let localChildren = [], localPositions = [];\n while (children.length > i) {\n localChildren.push(children.pop());\n localPositions.push(positions.pop() + base - from);\n }\n children.push(makeTree(nodeSet.types[type], localChildren, localPositions, to - from, lookAhead - to));\n positions.push(from - base);\n }\n function makeTree(type, children, positions, length, lookAhead = 0, props) {\n if (contextHash) {\n let pair = [NodeProp.contextHash, contextHash];\n props = props ? [pair].concat(props) : [pair];\n }\n if (lookAhead > 25) {\n let pair = [NodeProp.lookAhead, lookAhead];\n props = props ? [pair].concat(props) : [pair];\n }\n return new Tree(type, children, positions, length, props);\n }\n function findBufferSize(maxSize, inRepeat) {\n // Scan through the buffer to find previous siblings that fit\n // together in a TreeBuffer, and don't contain any reused nodes\n // (which can't be stored in a buffer).\n // If `inRepeat` is > -1, ignore node boundaries of that type for\n // nesting, but make sure the end falls either at the start\n // (`maxSize`) or before such a node.\n let fork = cursor.fork();\n let size = 0, start = 0, skip = 0, minStart = fork.end - maxBufferLength;\n let result = { size: 0, start: 0, skip: 0 };\n scan: for (let minPos = fork.pos - maxSize; fork.pos > minPos;) {\n let nodeSize = fork.size;\n // Pretend nested repeat nodes of the same type don't exist\n if (fork.id == inRepeat && nodeSize >= 0) {\n // Except that we store the current state as a valid return\n // value.\n result.size = size;\n result.start = start;\n result.skip = skip;\n skip += 4;\n size += 4;\n fork.next();\n continue;\n }\n let startPos = fork.pos - nodeSize;\n if (nodeSize < 0 || startPos < minPos || fork.start < minStart)\n break;\n let localSkipped = fork.id >= minRepeatType ? 4 : 0;\n let nodeStart = fork.start;\n fork.next();\n while (fork.pos > startPos) {\n if (fork.size < 0) {\n if (fork.size == -3 /* SpecialRecord.ContextChange */)\n localSkipped += 4;\n else\n break scan;\n }\n else if (fork.id >= minRepeatType) {\n localSkipped += 4;\n }\n fork.next();\n }\n start = nodeStart;\n size += nodeSize;\n skip += localSkipped;\n }\n if (inRepeat < 0 || size == maxSize) {\n result.size = size;\n result.start = start;\n result.skip = skip;\n }\n return result.size > 4 ? result : undefined;\n }\n function copyToBuffer(bufferStart, buffer, index) {\n let { id, start, end, size } = cursor;\n cursor.next();\n if (size >= 0 && id < minRepeatType) {\n let startIndex = index;\n if (size > 4) {\n let endPos = cursor.pos - (size - 4);\n while (cursor.pos > endPos)\n index = copyToBuffer(bufferStart, buffer, index);\n }\n buffer[--index] = startIndex;\n buffer[--index] = end - bufferStart;\n buffer[--index] = start - bufferStart;\n buffer[--index] = id;\n }\n else if (size == -3 /* SpecialRecord.ContextChange */) {\n contextHash = id;\n }\n else if (size == -4 /* SpecialRecord.LookAhead */) {\n lookAhead = id;\n }\n return index;\n }\n let children = [], positions = [];\n while (cursor.pos > 0)\n takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1);\n let length = (_a = data.length) !== null && _a !== void 0 ? _a : (children.length ? positions[0] + children[0].length : 0);\n return new Tree(types[data.topID], children.reverse(), positions.reverse(), length);\n}\nconst nodeSizeCache = new WeakMap;\nfunction nodeSize(balanceType, node) {\n if (!balanceType.isAnonymous || node instanceof TreeBuffer || node.type != balanceType)\n return 1;\n let size = nodeSizeCache.get(node);\n if (size == null) {\n size = 1;\n for (let child of node.children) {\n if (child.type != balanceType || !(child instanceof Tree)) {\n size = 1;\n break;\n }\n size += nodeSize(balanceType, child);\n }\n nodeSizeCache.set(node, size);\n }\n return size;\n}\nfunction balanceRange(\n// The type the balanced tree's inner nodes.\nbalanceType, \n// The direct children and their positions\nchildren, positions, \n// The index range in children/positions to use\nfrom, to, \n// The start position of the nodes, relative to their parent.\nstart, \n// Length of the outer node\nlength, \n// Function to build the top node of the balanced tree\nmkTop, \n// Function to build internal nodes for the balanced tree\nmkTree) {\n let total = 0;\n for (let i = from; i < to; i++)\n total += nodeSize(balanceType, children[i]);\n let maxChild = Math.ceil((total * 1.5) / 8 /* Balance.BranchFactor */);\n let localChildren = [], localPositions = [];\n function divide(children, positions, from, to, offset) {\n for (let i = from; i < to;) {\n let groupFrom = i, groupStart = positions[i], groupSize = nodeSize(balanceType, children[i]);\n i++;\n for (; i < to; i++) {\n let nextSize = nodeSize(balanceType, children[i]);\n if (groupSize + nextSize >= maxChild)\n break;\n groupSize += nextSize;\n }\n if (i == groupFrom + 1) {\n if (groupSize > maxChild) {\n let only = children[groupFrom]; // Only trees can have a size > 1\n divide(only.children, only.positions, 0, only.children.length, positions[groupFrom] + offset);\n continue;\n }\n localChildren.push(children[groupFrom]);\n }\n else {\n let length = positions[i - 1] + children[i - 1].length - groupStart;\n localChildren.push(balanceRange(balanceType, children, positions, groupFrom, i, groupStart, length, null, mkTree));\n }\n localPositions.push(groupStart + offset - start);\n }\n }\n divide(children, positions, from, to, 0);\n return (mkTop || mkTree)(localChildren, localPositions, length);\n}\n/// Provides a way to associate values with pieces of trees. As long\n/// as that part of the tree is reused, the associated values can be\n/// retrieved from an updated tree.\nclass NodeWeakMap {\n constructor() {\n this.map = new WeakMap();\n }\n setBuffer(buffer, index, value) {\n let inner = this.map.get(buffer);\n if (!inner)\n this.map.set(buffer, inner = new Map);\n inner.set(index, value);\n }\n getBuffer(buffer, index) {\n let inner = this.map.get(buffer);\n return inner && inner.get(index);\n }\n /// Set the value for this syntax node.\n set(node, value) {\n if (node instanceof BufferNode)\n this.setBuffer(node.context.buffer, node.index, value);\n else if (node instanceof TreeNode)\n this.map.set(node.tree, value);\n }\n /// Retrieve value for this syntax node, if it exists in the map.\n get(node) {\n return node instanceof BufferNode ? this.getBuffer(node.context.buffer, node.index)\n : node instanceof TreeNode ? this.map.get(node.tree) : undefined;\n }\n /// Set the value for the node that a cursor currently points to.\n cursorSet(cursor, value) {\n if (cursor.buffer)\n this.setBuffer(cursor.buffer.buffer, cursor.index, value);\n else\n this.map.set(cursor.tree, value);\n }\n /// Retrieve the value for the node that a cursor currently points\n /// to.\n cursorGet(cursor) {\n return cursor.buffer ? this.getBuffer(cursor.buffer.buffer, cursor.index) : this.map.get(cursor.tree);\n }\n}\n\n/// Tree fragments are used during [incremental\n/// parsing](#common.Parser.startParse) to track parts of old trees\n/// that can be reused in a new parse. An array of fragments is used\n/// to track regions of an old tree whose nodes might be reused in new\n/// parses. Use the static\n/// [`applyChanges`](#common.TreeFragment^applyChanges) method to\n/// update fragments for document changes.\nclass TreeFragment {\n /// Construct a tree fragment. You'll usually want to use\n /// [`addTree`](#common.TreeFragment^addTree) and\n /// [`applyChanges`](#common.TreeFragment^applyChanges) instead of\n /// calling this directly.\n constructor(\n /// The start of the unchanged range pointed to by this fragment.\n /// This refers to an offset in the _updated_ document (as opposed\n /// to the original tree).\n from, \n /// The end of the unchanged range.\n to, \n /// The tree that this fragment is based on.\n tree, \n /// The offset between the fragment's tree and the document that\n /// this fragment can be used against. Add this when going from\n /// document to tree positions, subtract it to go from tree to\n /// document positions.\n offset, openStart = false, openEnd = false) {\n this.from = from;\n this.to = to;\n this.tree = tree;\n this.offset = offset;\n this.open = (openStart ? 1 /* Open.Start */ : 0) | (openEnd ? 2 /* Open.End */ : 0);\n }\n /// Whether the start of the fragment represents the start of a\n /// parse, or the end of a change. (In the second case, it may not\n /// be safe to reuse some nodes at the start, depending on the\n /// parsing algorithm.)\n get openStart() { return (this.open & 1 /* Open.Start */) > 0; }\n /// Whether the end of the fragment represents the end of a\n /// full-document parse, or the start of a change.\n get openEnd() { return (this.open & 2 /* Open.End */) > 0; }\n /// Create a set of fragments from a freshly parsed tree, or update\n /// an existing set of fragments by replacing the ones that overlap\n /// with a tree with content from the new tree. When `partial` is\n /// true, the parse is treated as incomplete, and the resulting\n /// fragment has [`openEnd`](#common.TreeFragment.openEnd) set to\n /// true.\n static addTree(tree, fragments = [], partial = false) {\n let result = [new TreeFragment(0, tree.length, tree, 0, false, partial)];\n for (let f of fragments)\n if (f.to > tree.length)\n result.push(f);\n return result;\n }\n /// Apply a set of edits to an array of fragments, removing or\n /// splitting fragments as necessary to remove edited ranges, and\n /// adjusting offsets for fragments that moved.\n static applyChanges(fragments, changes, minGap = 128) {\n if (!changes.length)\n return fragments;\n let result = [];\n let fI = 1, nextF = fragments.length ? fragments[0] : null;\n for (let cI = 0, pos = 0, off = 0;; cI++) {\n let nextC = cI < changes.length ? changes[cI] : null;\n let nextPos = nextC ? nextC.fromA : 1e9;\n if (nextPos - pos >= minGap)\n while (nextF && nextF.from < nextPos) {\n let cut = nextF;\n if (pos >= cut.from || nextPos <= cut.to || off) {\n let fFrom = Math.max(cut.from, pos) - off, fTo = Math.min(cut.to, nextPos) - off;\n cut = fFrom >= fTo ? null : new TreeFragment(fFrom, fTo, cut.tree, cut.offset + off, cI > 0, !!nextC);\n }\n if (cut)\n result.push(cut);\n if (nextF.to > nextPos)\n break;\n nextF = fI < fragments.length ? fragments[fI++] : null;\n }\n if (!nextC)\n break;\n pos = nextC.toA;\n off = nextC.toA - nextC.toB;\n }\n return result;\n }\n}\n/// A superclass that parsers should extend.\nclass Parser {\n /// Start a parse, returning a [partial parse](#common.PartialParse)\n /// object. [`fragments`](#common.TreeFragment) can be passed in to\n /// make the parse incremental.\n ///\n /// By default, the entire input is parsed. You can pass `ranges`,\n /// which should be a sorted array of non-empty, non-overlapping\n /// ranges, to parse only those ranges. The tree returned in that\n /// case will start at `ranges[0].from`.\n startParse(input, fragments, ranges) {\n if (typeof input == \"string\")\n input = new StringInput(input);\n ranges = !ranges ? [new Range(0, input.length)] : ranges.length ? ranges.map(r => new Range(r.from, r.to)) : [new Range(0, 0)];\n return this.createParse(input, fragments || [], ranges);\n }\n /// Run a full parse, returning the resulting tree.\n parse(input, fragments, ranges) {\n let parse = this.startParse(input, fragments, ranges);\n for (;;) {\n let done = parse.advance();\n if (done)\n return done;\n }\n }\n}\nclass StringInput {\n constructor(string) {\n this.string = string;\n }\n get length() { return this.string.length; }\n chunk(from) { return this.string.slice(from); }\n get lineChunks() { return false; }\n read(from, to) { return this.string.slice(from, to); }\n}\n\n/// Create a parse wrapper that, after the inner parse completes,\n/// scans its tree for mixed language regions with the `nest`\n/// function, runs the resulting [inner parses](#common.NestedParse),\n/// and then [mounts](#common.NodeProp^mounted) their results onto the\n/// tree.\nfunction parseMixed(nest) {\n return (parse, input, fragments, ranges) => new MixedParse(parse, nest, input, fragments, ranges);\n}\nclass InnerParse {\n constructor(parser, parse, overlay, target, ranges) {\n this.parser = parser;\n this.parse = parse;\n this.overlay = overlay;\n this.target = target;\n this.ranges = ranges;\n if (!ranges.length || ranges.some(r => r.from >= r.to))\n throw new RangeError(\"Invalid inner parse ranges given: \" + JSON.stringify(ranges));\n }\n}\nclass ActiveOverlay {\n constructor(parser, predicate, mounts, index, start, target, prev) {\n this.parser = parser;\n this.predicate = predicate;\n this.mounts = mounts;\n this.index = index;\n this.start = start;\n this.target = target;\n this.prev = prev;\n this.depth = 0;\n this.ranges = [];\n }\n}\nconst stoppedInner = new NodeProp({ perNode: true });\nclass MixedParse {\n constructor(base, nest, input, fragments, ranges) {\n this.nest = nest;\n this.input = input;\n this.fragments = fragments;\n this.ranges = ranges;\n this.inner = [];\n this.innerDone = 0;\n this.baseTree = null;\n this.stoppedAt = null;\n this.baseParse = base;\n }\n advance() {\n if (this.baseParse) {\n let done = this.baseParse.advance();\n if (!done)\n return null;\n this.baseParse = null;\n this.baseTree = done;\n this.startInner();\n if (this.stoppedAt != null)\n for (let inner of this.inner)\n inner.parse.stopAt(this.stoppedAt);\n }\n if (this.innerDone == this.inner.length) {\n let result = this.baseTree;\n if (this.stoppedAt != null)\n result = new Tree(result.type, result.children, result.positions, result.length, result.propValues.concat([[stoppedInner, this.stoppedAt]]));\n return result;\n }\n let inner = this.inner[this.innerDone], done = inner.parse.advance();\n if (done) {\n this.innerDone++;\n // This is a somewhat dodgy but super helpful hack where we\n // patch up nodes created by the inner parse (and thus\n // presumably not aliased anywhere else) to hold the information\n // about the inner parse.\n let props = Object.assign(Object.create(null), inner.target.props);\n props[NodeProp.mounted.id] = new MountedTree(done, inner.overlay, inner.parser);\n inner.target.props = props;\n }\n return null;\n }\n get parsedPos() {\n if (this.baseParse)\n return 0;\n let pos = this.input.length;\n for (let i = this.innerDone; i < this.inner.length; i++) {\n if (this.inner[i].ranges[0].from < pos)\n pos = Math.min(pos, this.inner[i].parse.parsedPos);\n }\n return pos;\n }\n stopAt(pos) {\n this.stoppedAt = pos;\n if (this.baseParse)\n this.baseParse.stopAt(pos);\n else\n for (let i = this.innerDone; i < this.inner.length; i++)\n this.inner[i].parse.stopAt(pos);\n }\n startInner() {\n let fragmentCursor = new FragmentCursor(this.fragments);\n let overlay = null;\n let covered = null;\n let cursor = new TreeCursor(new TreeNode(this.baseTree, this.ranges[0].from, 0, null), IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n scan: for (let nest, isCovered; this.stoppedAt == null || cursor.from < this.stoppedAt;) {\n let enter = true, range;\n if (fragmentCursor.hasNode(cursor)) {\n if (overlay) {\n let match = overlay.mounts.find(m => m.frag.from <= cursor.from && m.frag.to >= cursor.to && m.mount.overlay);\n if (match)\n for (let r of match.mount.overlay) {\n let from = r.from + match.pos, to = r.to + match.pos;\n if (from >= cursor.from && to <= cursor.to && !overlay.ranges.some(r => r.from < to && r.to > from))\n overlay.ranges.push({ from, to });\n }\n }\n enter = false;\n }\n else if (covered && (isCovered = checkCover(covered.ranges, cursor.from, cursor.to))) {\n enter = isCovered != 2 /* Cover.Full */;\n }\n else if (!cursor.type.isAnonymous && cursor.from < cursor.to && (nest = this.nest(cursor, this.input))) {\n if (!cursor.tree)\n materialize(cursor);\n let oldMounts = fragmentCursor.findMounts(cursor.from, nest.parser);\n if (typeof nest.overlay == \"function\") {\n overlay = new ActiveOverlay(nest.parser, nest.overlay, oldMounts, this.inner.length, cursor.from, cursor.tree, overlay);\n }\n else {\n let ranges = punchRanges(this.ranges, nest.overlay || [new Range(cursor.from, cursor.to)]);\n if (ranges.length)\n this.inner.push(new InnerParse(nest.parser, nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, cursor.tree, ranges));\n if (!nest.overlay)\n enter = false;\n else if (ranges.length)\n covered = { ranges, depth: 0, prev: covered };\n }\n }\n else if (overlay && (range = overlay.predicate(cursor))) {\n if (range === true)\n range = new Range(cursor.from, cursor.to);\n if (range.from < range.to)\n overlay.ranges.push(range);\n }\n if (enter && cursor.firstChild()) {\n if (overlay)\n overlay.depth++;\n if (covered)\n covered.depth++;\n }\n else {\n for (;;) {\n if (cursor.nextSibling())\n break;\n if (!cursor.parent())\n break scan;\n if (overlay && !--overlay.depth) {\n let ranges = punchRanges(this.ranges, overlay.ranges);\n if (ranges.length)\n this.inner.splice(overlay.index, 0, new InnerParse(overlay.parser, overlay.parser.startParse(this.input, enterFragments(overlay.mounts, ranges), ranges), overlay.ranges.map(r => new Range(r.from - overlay.start, r.to - overlay.start)), overlay.target, ranges));\n overlay = overlay.prev;\n }\n if (covered && !--covered.depth)\n covered = covered.prev;\n }\n }\n }\n }\n}\nfunction checkCover(covered, from, to) {\n for (let range of covered) {\n if (range.from >= to)\n break;\n if (range.to > from)\n return range.from <= from && range.to >= to ? 2 /* Cover.Full */ : 1 /* Cover.Partial */;\n }\n return 0 /* Cover.None */;\n}\n// Take a piece of buffer and convert it into a stand-alone\n// TreeBuffer.\nfunction sliceBuf(buf, startI, endI, nodes, positions, off) {\n if (startI < endI) {\n let from = buf.buffer[startI + 1];\n nodes.push(buf.slice(startI, endI, from));\n positions.push(from - off);\n }\n}\n// This function takes a node that's in a buffer, and converts it, and\n// its parent buffer nodes, into a Tree. This is again acting on the\n// assumption that the trees and buffers have been constructed by the\n// parse that was ran via the mix parser, and thus aren't shared with\n// any other code, making violations of the immutability safe.\nfunction materialize(cursor) {\n let { node } = cursor, depth = 0;\n // Scan up to the nearest tree\n do {\n cursor.parent();\n depth++;\n } while (!cursor.tree);\n // Find the index of the buffer in that tree\n let i = 0, base = cursor.tree, off = 0;\n for (;; i++) {\n off = base.positions[i] + cursor.from;\n if (off <= node.from && off + base.children[i].length >= node.to)\n break;\n }\n let buf = base.children[i], b = buf.buffer;\n // Split a level in the buffer, putting the nodes before and after\n // the child that contains `node` into new buffers.\n function split(startI, endI, type, innerOffset, length) {\n let i = startI;\n while (b[i + 2] + off <= node.from)\n i = b[i + 3];\n let children = [], positions = [];\n sliceBuf(buf, startI, i, children, positions, innerOffset);\n let from = b[i + 1], to = b[i + 2];\n let isTarget = from + off == node.from && to + off == node.to && b[i] == node.type.id;\n children.push(isTarget ? node.toTree() : split(i + 4, b[i + 3], buf.set.types[b[i]], from, to - from));\n positions.push(from - innerOffset);\n sliceBuf(buf, b[i + 3], endI, children, positions, innerOffset);\n return new Tree(type, children, positions, length);\n }\n base.children[i] = split(0, b.length, NodeType.none, 0, buf.length);\n // Move the cursor back to the target node\n for (let d = 0; d <= depth; d++)\n cursor.childAfter(node.from);\n}\nclass StructureCursor {\n constructor(root, offset) {\n this.offset = offset;\n this.done = false;\n this.cursor = root.cursor(IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n }\n // Move to the first node (in pre-order) that starts at or after `pos`.\n moveTo(pos) {\n let { cursor } = this, p = pos - this.offset;\n while (!this.done && cursor.from < p) {\n if (cursor.to >= pos && cursor.enter(p, 1, IterMode.IgnoreOverlays | IterMode.ExcludeBuffers)) ;\n else if (!cursor.next(false))\n this.done = true;\n }\n }\n hasNode(cursor) {\n this.moveTo(cursor.from);\n if (!this.done && this.cursor.from + this.offset == cursor.from && this.cursor.tree) {\n for (let tree = this.cursor.tree;;) {\n if (tree == cursor.tree)\n return true;\n if (tree.children.length && tree.positions[0] == 0 && tree.children[0] instanceof Tree)\n tree = tree.children[0];\n else\n break;\n }\n }\n return false;\n }\n}\nclass FragmentCursor {\n constructor(fragments) {\n var _a;\n this.fragments = fragments;\n this.curTo = 0;\n this.fragI = 0;\n if (fragments.length) {\n let first = this.curFrag = fragments[0];\n this.curTo = (_a = first.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : first.to;\n this.inner = new StructureCursor(first.tree, -first.offset);\n }\n else {\n this.curFrag = this.inner = null;\n }\n }\n hasNode(node) {\n while (this.curFrag && node.from >= this.curTo)\n this.nextFrag();\n return this.curFrag && this.curFrag.from <= node.from && this.curTo >= node.to && this.inner.hasNode(node);\n }\n nextFrag() {\n var _a;\n this.fragI++;\n if (this.fragI == this.fragments.length) {\n this.curFrag = this.inner = null;\n }\n else {\n let frag = this.curFrag = this.fragments[this.fragI];\n this.curTo = (_a = frag.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : frag.to;\n this.inner = new StructureCursor(frag.tree, -frag.offset);\n }\n }\n findMounts(pos, parser) {\n var _a;\n let result = [];\n if (this.inner) {\n this.inner.cursor.moveTo(pos, 1);\n for (let pos = this.inner.cursor.node; pos; pos = pos.parent) {\n let mount = (_a = pos.tree) === null || _a === void 0 ? void 0 : _a.prop(NodeProp.mounted);\n if (mount && mount.parser == parser) {\n for (let i = this.fragI; i < this.fragments.length; i++) {\n let frag = this.fragments[i];\n if (frag.from >= pos.to)\n break;\n if (frag.tree == this.curFrag.tree)\n result.push({\n frag,\n pos: pos.from - frag.offset,\n mount\n });\n }\n }\n }\n }\n return result;\n }\n}\nfunction punchRanges(outer, ranges) {\n let copy = null, current = ranges;\n for (let i = 1, j = 0; i < outer.length; i++) {\n let gapFrom = outer[i - 1].to, gapTo = outer[i].from;\n for (; j < current.length; j++) {\n let r = current[j];\n if (r.from >= gapTo)\n break;\n if (r.to <= gapFrom)\n continue;\n if (!copy)\n current = copy = ranges.slice();\n if (r.from < gapFrom) {\n copy[j] = new Range(r.from, gapFrom);\n if (r.to > gapTo)\n copy.splice(j + 1, 0, new Range(gapTo, r.to));\n }\n else if (r.to > gapTo) {\n copy[j--] = new Range(gapTo, r.to);\n }\n else {\n copy.splice(j--, 1);\n }\n }\n }\n return current;\n}\nfunction findCoverChanges(a, b, from, to) {\n let iA = 0, iB = 0, inA = false, inB = false, pos = -1e9;\n let result = [];\n for (;;) {\n let nextA = iA == a.length ? 1e9 : inA ? a[iA].to : a[iA].from;\n let nextB = iB == b.length ? 1e9 : inB ? b[iB].to : b[iB].from;\n if (inA != inB) {\n let start = Math.max(pos, from), end = Math.min(nextA, nextB, to);\n if (start < end)\n result.push(new Range(start, end));\n }\n pos = Math.min(nextA, nextB);\n if (pos == 1e9)\n break;\n if (nextA == pos) {\n if (!inA)\n inA = true;\n else {\n inA = false;\n iA++;\n }\n }\n if (nextB == pos) {\n if (!inB)\n inB = true;\n else {\n inB = false;\n iB++;\n }\n }\n }\n return result;\n}\n// Given a number of fragments for the outer tree, and a set of ranges\n// to parse, find fragments for inner trees mounted around those\n// ranges, if any.\nfunction enterFragments(mounts, ranges) {\n let result = [];\n for (let { pos, mount, frag } of mounts) {\n let startPos = pos + (mount.overlay ? mount.overlay[0].from : 0), endPos = startPos + mount.tree.length;\n let from = Math.max(frag.from, startPos), to = Math.min(frag.to, endPos);\n if (mount.overlay) {\n let overlay = mount.overlay.map(r => new Range(r.from + pos, r.to + pos));\n let changes = findCoverChanges(ranges, overlay, from, to);\n for (let i = 0, pos = from;; i++) {\n let last = i == changes.length, end = last ? to : changes[i].from;\n if (end > pos)\n result.push(new TreeFragment(pos, end, mount.tree, -startPos, frag.from >= pos || frag.openStart, frag.to <= end || frag.openEnd));\n if (last)\n break;\n pos = changes[i].to;\n }\n }\n else {\n result.push(new TreeFragment(from, to, mount.tree, -startPos, frag.from >= startPos || frag.openStart, frag.to <= endPos || frag.openEnd));\n }\n }\n return result;\n}\n\nexport { DefaultBufferLength, IterMode, MountedTree, NodeProp, NodeSet, NodeType, NodeWeakMap, Parser, Tree, TreeBuffer, TreeCursor, TreeFragment, parseMixed };\n", "import {\n NodeWeakMap,\n type SyntaxNodeRef,\n type SyntaxNode,\n IterMode,\n} from \"@lezer/common\";\nimport {\n type Completion,\n type CompletionContext,\n type CompletionResult,\n completeFromList,\n ifNotIn,\n} from \"@codemirror/autocomplete\";\nimport { type Text } from \"@codemirror/state\";\n\nconst cache = new NodeWeakMap();\n\nconst ScopeNodes = new Set([\n \"Script\",\n \"Body\",\n \"FunctionNode\",\n \"ClassNode\",\n \"LambdaExpressionNode\",\n \"ForNode\",\n \"MatchBranchNode\",\n]);\n\nfunction defID(type: string) {\n return (\n node: SyntaxNodeRef,\n def: (node: SyntaxNodeRef, type: string) => void,\n outer: boolean\n ) => {\n if (outer) return false;\n const id = node.node.getChild(\"VariableName\");\n if (id != null) def(id, type);\n return true;\n };\n}\n\nconst gatherCompletions: Record<\n string,\n (\n node: SyntaxNodeRef,\n def: (node: SyntaxNodeRef, type: string) => void,\n outer: boolean\n ) => undefined | boolean\n> = {\n FunctionNode: defID(\"function\"),\n // ClassDefinition: defID(\"class\"),\n // ForStatement(node, def, outer) {\n // if (outer)\n // for (let child = node.node.firstChild; child; child = child.nextSibling) {\n // if (child.name == \"VariableName\") def(child, \"variable\");\n // else if (child.name == \"in\") break;\n // }\n // },\n // ImportStatement(_node, def) {\n // let { node } = _node;\n // let isFrom = node.firstChild?.name == \"from\";\n // for (let ch = node.getChild(\"import\"); ch; ch = ch.nextSibling) {\n // if (ch.name == \"VariableName\" && ch.nextSibling?.name != \"as\")\n // def(ch, isFrom ? \"variable\" : \"namespace\");\n // }\n // },\n // AssignStatement(node, def) {\n // for (let child = node.node.firstChild; child; child = child.nextSibling) {\n // if (child.name == \"VariableName\") def(child, \"variable\");\n // else if (child.name == \":\" || child.name == \"AssignOp\") break;\n // }\n // },\n // ParamList(node, def) {\n // for (\n // let prev = null, child = node.node.firstChild;\n // child;\n // child = child.nextSibling\n // ) {\n // if (\n // child.name == \"VariableName\" &&\n // (!prev || !/\\*|AssignOp/.test(prev.name))\n // )\n // def(child, \"variable\");\n // prev = child;\n // }\n // },\n // CapturePattern: defID(\"variable\"),\n // AsPattern: defID(\"variable\"),\n __proto__: null as any,\n};\n\n// eslint-disable-next-line @typescript-eslint/no-unused-vars\nfunction getScope(doc: Text, node: SyntaxNode): readonly Completion[] {\n const cached = cache.get(node);\n if (cached != null) return cached;\n\n const completions: Completion[] = [];\n let top = true;\n function def(node: SyntaxNodeRef, type: string): void {\n const name = doc.sliceString(node.from, node.to);\n completions.push({ label: name, type });\n }\n node.cursor(IterMode.IncludeAnonymous).iterate((node) => {\n if (node.name !== \"\") {\n const gather = gatherCompletions[node.name];\n if (\n gather?.(node, def, top) === true ||\n (!top && ScopeNodes.has(node.name))\n )\n return false;\n top = false;\n } else if (node.to - node.from > 8192) {\n // Allow caching for bigger internal nodes\n for (const c of getScope(doc, node.node)) completions.push(c);\n return false;\n }\n });\n cache.set(node, completions);\n return completions;\n}\n\nconst dontComplete = [\"String\", \"Comment\"];\n\nexport function localCompletionSource(\n context: CompletionContext\n): CompletionResult | null {\n return null;\n}\n\nconst globals: readonly Completion[] = ([] as Completion[])\n .concat(\n [\"true\", \"false\", \"null\", \"PI\", \"TAU\", \"INF\", \"NaN\"].map((n) => ({\n label: n,\n type: \"constant\",\n }))\n )\n .concat(\n [\n \"AudioServer\",\n \"CameraServer\",\n \"ClassDB\",\n \"DisplayServer\",\n \"Engine\",\n \"EngineDebugger\",\n \"GDExtensionManager\",\n \"Geometry2D\",\n \"Geometry3D\",\n \"GodotSharp\",\n \"IP\",\n \"Input\",\n \"InputMap\",\n \"JavaClassWrapper\",\n \"JavaScriptBridge\",\n \"Marshalls\",\n \"NavigationMeshGenerator\",\n \"NavigationServer2D\",\n \"NavigationServer3D\",\n \"OS\",\n \"Performance\",\n \"PhysicsServer2D\",\n \"PhysicsServer2DManager\",\n \"PhysicsServer3D\",\n \"PhysicsServer3DManager\",\n \"ProjectSettings\",\n \"RenderingServer\",\n \"ResourceLoader\",\n \"ResourceSaver\",\n \"ResourceUID\",\n \"TextServerManager\",\n \"ThemeDB\",\n \"Time\",\n \"TranslationServer\",\n \"WorkerThreadPool\",\n \"XRServer\",\n ].map((n) => ({ label: n, type: \"class\" }))\n )\n .concat(\n [\n // Variant\n \"Variant\",\n // null\n \"void\",\n // atomic types\n \"bool\",\n \"int\",\n \"float\",\n \"String\",\n // math types\n \"Vector2\",\n \"Vector2i\",\n \"Rect2\",\n \"Rect2i\",\n \"Vector3\",\n \"Vector3i\",\n \"Transform2D\",\n \"Vector4\",\n \"Vector4i\",\n \"Plane\",\n \"Quaternion\",\n \"AABB\",\n \"Basis\",\n \"Transform3D\",\n \"Projection\",\n // misc types\n \"Color\",\n \"StringName\",\n \"NodePath\",\n \"RID\",\n \"Object\",\n \"Callable\",\n \"Signal\",\n \"Dictionary\",\n \"Array\",\n // typed arrays\n \"PackedByteArray\",\n \"PackedInt32Array\",\n \"PackedInt64Array\",\n \"PackedFloat32Array\",\n \"PackedFloat64Array\",\n \"PackedStringArray\",\n \"PackedVector2Array\",\n \"PackedVector3Array\",\n \"PackedColorArray\",\n ].map((n) => ({\n label: n,\n type: \"class\",\n }))\n )\n .concat(\n [\n \"abs\",\n \"absf\",\n \"absi\",\n \"acos\",\n \"asin\",\n \"atan\",\n \"atan2\",\n \"bezier_derivative\",\n \"bezier_interpolate\",\n \"bytes_to_var\",\n \"bytes_to_var_with_objects\",\n \"ceil\",\n \"ceilf\",\n \"ceili\",\n \"clamp\",\n \"clampf\",\n \"clampi\",\n \"cos\",\n \"cosh\",\n \"cubic_interpolate\",\n \"cubic_interpolate_angle\",\n \"cubic_interpolate_angle_in_time\",\n \"cubic_interpolate_in_time\",\n \"db_to_linear\",\n \"deg_to_rad\",\n \"ease\",\n \"error_string\",\n \"exp\",\n \"floor\",\n \"floorf\",\n \"floori\",\n \"fmod\",\n \"fposmod\",\n \"hash\",\n \"instance_from_id\",\n \"inverse_lerp\",\n \"is_equal_approx\",\n \"is_finite\",\n \"is_inf\",\n \"is_instance_id_valid\",\n \"is_instance_valid\",\n \"is_nan\",\n \"is_same\",\n \"is_zero_approx\",\n \"lerp\",\n \"lerp_angle\",\n \"lerpf\",\n \"linear_to_db\",\n \"log\",\n \"max\",\n \"maxf\",\n \"maxi\",\n \"min\",\n \"minf\",\n \"mini\",\n \"move_toward\",\n \"nearest_po2\",\n \"pingpong\",\n \"posmod\",\n \"pow\",\n \"print\",\n \"print_rich\",\n \"print_verbose\",\n \"printerr\",\n \"printraw\",\n \"prints\",\n \"printt\",\n \"push_error\",\n \"push_warning\",\n \"rad_to_deg\",\n \"rand_from_seed\",\n \"randf\",\n \"randf_range\",\n \"randfn\",\n \"randi\",\n \"randi_range\",\n \"randomize\",\n \"remap\",\n \"rid_allocate_id\",\n \"rid_from_int64\",\n \"round\",\n \"roundf\",\n \"roundi\",\n \"seed\",\n \"sign\",\n \"signf\",\n \"signi\",\n \"sin\",\n \"sinh\",\n \"smoothstep\",\n \"snapped\",\n \"snappedf\",\n \"snappedi\",\n \"sqrt\",\n \"step_decimals\",\n \"str\",\n \"str_to_var\",\n \"tan\",\n \"tanh\",\n \"typeof\",\n \"var_to_bytes\",\n \"var_to_bytes_with_objects\",\n \"var_to_str\",\n \"weakref\",\n \"wrap\",\n \"wrapf\",\n \"wrapi\",\n ].map((n) => ({ label: n, type: \"function\" }))\n );\nexport const snippets: readonly Completion[] = [];\n\nexport const globalCompletion = ifNotIn(\n dontComplete,\n completeFromList(globals.concat(snippets))\n);\n", "import { Facet } from \"@codemirror/state\";\n\nexport const startFreezeComment = Facet.define({\n combine: (values) => {\n if (values.length > 0) {\n return values[values.length - 1];\n }\n return \"start-freeze\";\n },\n});\n\nexport const endFreezeComment = Facet.define({\n combine: (values) => {\n if (values.length > 0) {\n return values[values.length - 1];\n }\n return \"end-freeze\";\n },\n});\n", "import { EditorView } from \"@codemirror/view\";\n\nexport const freezeTheme = EditorView.theme({\n \".cm-frozen\": {\n opacity: 0.75,\n fontStyle: \"italic\",\n },\n});\n", "import {\n EditorSelection,\n EditorState,\n type SelectionRange,\n} from \"@codemirror/state\";\n\nimport { startFreezeComment, endFreezeComment } from \"./facet.mts\";\nimport {\n createSelectionRangesFromSetRange,\n createSetRangeFromSelectionRange,\n getFreezeRanges,\n removeFromSetRange,\n} from \"./utils.mts\";\n\nexport function getFreezeTransactionFilter(): ReturnType<\n (typeof EditorState)[\"transactionFilter\"][\"of\"]\n> {\n return EditorState.transactionFilter.of((transaction) => {\n // If it's not releated to selection or the doc itself, skip\n if (!(transaction.selection != null || transaction.docChanged)) {\n return transaction;\n }\n\n const freezeRanges = getFreezeRanges(\n transaction.startState,\n transaction.startState.facet(startFreezeComment),\n transaction.startState.facet(endFreezeComment)\n );\n\n let ignoreChanges = false;\n\n if (transaction.docChanged) {\n transaction.changes.iterChanges((fromA, toA, fromB, toB, inserted) => {\n const diff = Math.max(toA - fromA, toB - fromB);\n for (let i = 0; i < freezeRanges.length; i++) {\n let range = freezeRanges[i];\n\n if (diff > 0) {\n if (fromB < range.from) {\n range = EditorSelection.range(range.from + diff, range.to + diff);\n freezeRanges[i] = range;\n }\n }\n }\n });\n\n for (const freezeRange of freezeRanges) {\n const touchesRange = transaction.changes.desc.touchesRange(\n freezeRange.from,\n freezeRange.to\n );\n switch (touchesRange) {\n case \"cover\":\n case true:\n ignoreChanges = true;\n break;\n case false:\n default:\n // do nothing\n }\n\n if (ignoreChanges) {\n break;\n }\n }\n }\n\n let ranges: SelectionRange[] = [];\n\n if (transaction.selection != null) {\n let selection = transaction.newSelection;\n if (ignoreChanges) {\n selection = transaction.startState.selection;\n }\n\n for (const selectionRange of selection.ranges) {\n const selectionRangeSet =\n createSetRangeFromSelectionRange(selectionRange);\n for (const freezeRange of freezeRanges) {\n removeFromSetRange(freezeRange, selectionRangeSet);\n }\n ranges.push(...createSelectionRangesFromSetRange(selectionRangeSet));\n }\n\n // Removes the cursor at index 0 if a freeze range begins at zero\n const findHasFromZero = (selectionRange: SelectionRange): boolean => {\n return selectionRange.from === 0;\n };\n const fromZeroFreezeRange = freezeRanges.find(findHasFromZero);\n if (fromZeroFreezeRange != null) {\n const fromZeroRange = ranges.find(findHasFromZero);\n if (fromZeroRange != null) {\n ranges = ranges.filter((range) => range !== fromZeroRange);\n }\n }\n }\n\n const returnedTransaction = {\n ...transaction,\n ...(ranges.length > 0\n ? { selection: EditorSelection.create(ranges) }\n : {}),\n ...(ignoreChanges\n ? {\n changes: [],\n selection: transaction.startState.selection,\n }\n : {}),\n };\n\n return returnedTransaction;\n });\n}\n", "import { type CommentTokens } from \"@codemirror/commands\";\nimport { syntaxTree } from \"@codemirror/language\";\nimport {\n type EditorState,\n type SelectionRange,\n EditorSelection,\n} from \"@codemirror/state\";\n\nexport function getFreezeRanges(\n state: EditorState,\n startFreezeComment: string,\n endFreezeComment: string\n): SelectionRange[] {\n const tree = syntaxTree(state);\n const cursor = tree.cursor();\n\n const commentTokens = state.languageDataAt(\"commentTokens\", 0);\n\n const freezeRanges: SelectionRange[] = [];\n let currentRangeFrom = 0;\n\n do {\n if (cursor.name !== \"Comment\") {\n continue;\n }\n\n let fromOffset = 0;\n let toOffset = 0;\n\n const text = state.sliceDoc(cursor.from, cursor.to);\n let comment = \"\";\n\n for (const commentToken of commentTokens) {\n if (commentToken.line != null) {\n if (!text.startsWith(commentToken.line)) {\n continue;\n }\n\n fromOffset = commentToken.line.length;\n } else if (commentToken.block != null) {\n if (\n !(\n text.startsWith(commentToken.block.open) &&\n text.endsWith(commentToken.block.close)\n )\n ) {\n continue;\n }\n fromOffset = commentToken.block.open.length;\n toOffset = -commentToken.block.close.length;\n }\n }\n\n comment = text.slice(fromOffset, text.length + toOffset).trim();\n\n if (comment === startFreezeComment) {\n currentRangeFrom = cursor.from;\n } else if (comment === endFreezeComment) {\n freezeRanges.push(EditorSelection.range(currentRangeFrom, cursor.to));\n currentRangeFrom = 0;\n }\n } while (cursor.next());\n\n if (currentRangeFrom > 0) {\n freezeRanges.push(\n EditorSelection.range(currentRangeFrom, state.doc.toString().length)\n );\n }\n\n return freezeRanges;\n}\n\nexport function createSetRangeFromSelectionRange(\n range: SelectionRange\n): Set {\n const setRange = new Set();\n for (let i = range.from; i <= range.to; i++) {\n setRange.add(i);\n }\n return setRange;\n}\n\nexport function removeFromSetRange(\n rangeToRemove: SelectionRange,\n setRange: Set\n): void {\n const numbersToRemove = Array.from(\n createSetRangeFromSelectionRange(rangeToRemove)\n );\n for (const numberToRemove of numbersToRemove) {\n setRange.delete(numberToRemove);\n }\n}\n\nexport function createSelectionRangesFromSetRange(\n range: Set\n): SelectionRange[] {\n const elements = Array.from(range).sort((a, b) => a - b);\n const min = elements.reduce((previousValue, currentValue, currentIndex) => {\n if (currentIndex === 0) {\n return currentValue;\n }\n return Math.min(previousValue, currentValue);\n }, 0);\n const max = elements.reduce((previousValue, currentValue, currentIndex) => {\n if (currentIndex === 0) {\n return currentValue;\n }\n return Math.max(previousValue, currentValue);\n }, 0);\n\n const selectionRanges: SelectionRange[] = [];\n let selectionRange: SelectionRange | null = null;\n for (let i = min; i < max; i++) {\n const element = elements.find((element) => element === i);\n\n if (element == null && selectionRange != null) {\n selectionRanges.push(selectionRange);\n selectionRange = null;\n continue;\n }\n\n if (selectionRange == null) {\n selectionRange = EditorSelection.range(i, i);\n } else {\n selectionRange = EditorSelection.range(selectionRange.from, i);\n }\n }\n if (selectionRange != null) {\n selectionRanges.push(selectionRange);\n selectionRange = null;\n }\n\n return selectionRanges;\n}\n\nexport function handleEventFreezeFromPos(\n pos: number,\n event: Event,\n state: EditorState,\n startFreezeComment: string,\n endFreezeComment: string\n): void {\n const freezeRanges = getFreezeRanges(\n state,\n startFreezeComment,\n endFreezeComment\n );\n for (const freezeRange of freezeRanges) {\n if (freezeRange.from <= pos && pos < freezeRange.to) {\n event.preventDefault();\n event.stopImmediatePropagation();\n return;\n }\n }\n}\n", "import { type RangeSet, RangeSetBuilder } from \"@codemirror/state\";\nimport {\n Decoration,\n type DecorationSet,\n type EditorView,\n type PluginValue,\n type ViewUpdate,\n ViewPlugin,\n} from \"@codemirror/view\";\n\nimport { startFreezeComment, endFreezeComment } from \"./facet.mjs\";\nimport { getFreezeRanges } from \"./utils.mts\";\n\nconst frozenDecoration = Decoration.line({\n attributes: { class: \"cm-frozen\" },\n});\n\nfunction freezeDecoration(view: EditorView): RangeSet {\n const builder = new RangeSetBuilder();\n\n const freezeRanges = getFreezeRanges(\n view.state,\n view.state.facet(startFreezeComment),\n view.state.facet(endFreezeComment)\n );\n\n for (const { from, to } of view.visibleRanges) {\n for (let pos = from; pos <= to; ) {\n const line = view.state.doc.lineAt(pos);\n for (const freezeRange of freezeRanges) {\n if (\n (freezeRange.from < line.from && line.from < freezeRange.to) ||\n (freezeRange.from < line.to && line.to < freezeRange.to)\n ) {\n builder.add(line.from, line.from, frozenDecoration);\n }\n }\n pos = line.to + 1;\n }\n }\n\n return builder.finish();\n}\n\nclass FreezeViewPlugin implements PluginValue {\n decorations: DecorationSet;\n\n constructor(view: EditorView) {\n this.decorations = freezeDecoration(view);\n }\n\n update(update: ViewUpdate): void {\n if (!(update.docChanged || update.viewportChanged)) {\n return;\n }\n this.decorations = freezeDecoration(update.view);\n }\n}\n\nexport function getFreezeViewPlugin(): ViewPlugin {\n const plugin = ViewPlugin.fromClass(FreezeViewPlugin, {\n decorations: (value) => value.decorations,\n });\n\n return plugin;\n}\n", "import { type Extension } from \"@codemirror/state\";\n\nimport { startFreezeComment, endFreezeComment } from \"./facet.mts\";\nimport { freezeTheme } from \"./theme.mts\";\nimport { getFreezeTransactionFilter } from \"./transaction-filter.mts\";\nimport { getFreezeViewPlugin } from \"./view.mts\";\n\nconst _startFreezeComment = startFreezeComment;\nconst _endFreezeComment = endFreezeComment;\n\nexport function freeze(\n startFreezeComment = \"start-freeze\",\n endFreezeComment = \"end-freeze\"\n): Extension {\n const startFreezeCommentOf = _startFreezeComment.of(startFreezeComment);\n const endFreezeCommentOf = _endFreezeComment.of(endFreezeComment);\n\n const freezeTransactionFilter = getFreezeTransactionFilter();\n const freezeViewPlugin = getFreezeViewPlugin();\n\n return [\n freezeTransactionFilter,\n freezeViewPlugin,\n startFreezeCommentOf,\n endFreezeCommentOf,\n freezeTheme,\n ];\n}\n\nexport { startFreezeComment, endFreezeComment };\n", "function format(fmt) {\n var re = /(%?)(%([jds]))/g\n , args = Array.prototype.slice.call(arguments, 1);\n if(args.length) {\n fmt = fmt.replace(re, function(match, escaped, ptn, flag) {\n var arg = args.shift();\n switch(flag) {\n case 's':\n arg = '' + arg;\n break;\n case 'd':\n arg = Number(arg);\n break;\n case 'j':\n arg = JSON.stringify(arg);\n break;\n }\n if(!escaped) {\n return arg; \n }\n args.unshift(arg);\n return match;\n })\n }\n\n // arguments remain after formatting\n if(args.length) {\n fmt += ' ' + args.join(' ');\n }\n\n // update escaped %% values\n fmt = fmt.replace(/%{2,2}/g, '%');\n\n return '' + fmt;\n}\n\nmodule.exports = format;\n", "export * from \"./controller/index.mts\";\nexport {\n type GdExerciseFile,\n type GdExerciseDirectory,\n type GdExerciseLog,\n} from \"./utils.mts\";\n", "import EventEmitter from './index.js'\n\nexport { EventEmitter }\nexport default EventEmitter\n", "import { EventEmitter } from \"eventemitter3\";\nimport { dirname, basename, join } from \"path-browserify\";\n\nimport PQueue from \"p-queue\";\n\nimport { type Godot } from \"@gdquest/gd-types\";\n\nimport { CodeController } from \"./code.mts\";\nimport { GdPlayerController } from \"./gdplayer.mts\";\nimport {\n type GdExerciseFile,\n type GdExerciseLog,\n assert,\n getProjectFiles,\n} from \"@/utils.mts\";\nimport { ConsoleController } from \"./console.mts\";\nimport { TestController } from \"./test.mts\";\n\nexport interface ControllerConstructorParams\n extends CreateMainControllerOptions {\n projectUrl: string;\n mainScene: string;\n projectFiles: Map;\n}\n\nexport interface MainControllerEvents {\n ready: () => void;\n}\n\nexport class MainController extends EventEmitter {\n projectId: string;\n\n _projectUrl: string;\n _project: string;\n _mainScene: string;\n _files: CreateMainControllerFile[];\n\n _Engine: Godot.EngineClass;\n _projectFiles: Map;\n _size: Record;\n\n get canRestart(): boolean {\n return this._gdPlayerController?.playerStatus === \"started\";\n }\n\n _codeController: CodeController;\n get codeController(): CodeController {\n return this._codeController;\n }\n\n set codeController(_) {}\n\n _gdPlayerController: GdPlayerController;\n get gdPlayerController(): GdPlayerController {\n return this._gdPlayerController;\n }\n\n set gdPlayerController(_) {}\n\n _testController: TestController;\n get testController(): TestController {\n return this._testController;\n }\n\n set testController(_) {}\n\n _consoleController: ConsoleController;\n get consoleController(): ConsoleController {\n return this._consoleController;\n }\n\n set consoleController(_) {}\n\n _snippet: string;\n get isSnippet(): boolean {\n return this._snippet.length > 0;\n }\n\n set isSnippet(_) {}\n\n constructor(options: ControllerConstructorParams) {\n super();\n\n const {\n projectUrl: dataUrl,\n project,\n mainScene,\n files,\n Engine,\n projectFiles,\n isDarkMode,\n size,\n snippet = \"\",\n } = options;\n\n this._projectUrl = dataUrl;\n this._project = project;\n this._mainScene = mainScene;\n this._files = files;\n\n this._Engine = Engine;\n\n this._projectFiles = projectFiles;\n this._size = size;\n this._snippet = snippet;\n\n this.projectId = basename(dirname(this._project));\n if (this.projectId === \".\") {\n this.projectId = basename(new URL(dataUrl).pathname, \".zip\");\n }\n\n const codeControllerFiles = Array.from(projectFiles.values())\n .map((projectFile) => {\n const file = files.find(\n (file) => join(this._project, file.path) === projectFile.path\n );\n if (file == null) return null;\n projectFile.focus = file.focus;\n return projectFile;\n })\n .filter(\n (projectFile): projectFile is GdExerciseFile => projectFile != null\n );\n\n this._codeController = new CodeController(\n this.projectId,\n this._project,\n this._projectUrl,\n codeControllerFiles,\n isDarkMode,\n snippet\n );\n\n this._codeController.on(\"save\", (file: GdExerciseFile) => {\n (async () => {\n await this.loadFile(file);\n })().catch((err) => {\n console.error(\"Error while saving file:\", err);\n });\n });\n\n // GdPlayer controller\n this._gdPlayerController = new GdPlayerController(\n this.projectId,\n this._project,\n this._mainScene,\n this._size,\n this.isSnippet\n );\n\n this._gdPlayerController.on(\"ready\", () => {\n (async () => {\n await this._loadProjectFiles();\n await this._launchGdPlayer();\n this.emit(\"ready\");\n })().catch((err) => {\n console.error(\"Error while loading project files:\", err);\n });\n });\n\n this._gdPlayerController.on(\"log\", (message) => {\n this._onGdPlayerLog(message).catch((err) => {\n console.error(\"Error while trying to log GdPlayer:\", err);\n });\n });\n\n this._gdPlayerController.on(\"logError\", (message) => {\n this._onGdPlayerLogError(message).catch((err) => {\n console.error(\"Error while trying to log error message:\", err);\n });\n });\n\n this._gdPlayerController.on(\"playerStatus\", (status) => {\n if (status !== \"init\") return;\n\n this._testController.clear();\n this._consoleController.clear();\n });\n\n // Console controller\n this._consoleController = new ConsoleController();\n\n // Test controller\n this._testController = new TestController();\n\n // @ts-expect-error Window doesn't have gdquest defined\n window.gdquest = {\n log: (entry: GdExerciseLog) => {\n this.logTest(entry);\n },\n };\n\n window.addEventListener(\"message\", (event) => {\n if (event.data?.from !== \"gd-exercise\") return;\n switch (event.data?.type) {\n case \"low-processor-usage-mode\":\n this._gdPlayerController.lowProcessorUsageMode = event.data.value;\n }\n });\n }\n\n async _loadProjectFiles(): Promise {\n assert(this._gdPlayerController != null);\n\n const queue = new PQueue({ concurrency: 10 });\n for (const [, file] of this._projectFiles) {\n queue\n .add(async () => {\n await this._gdPlayerController.addFile(file);\n })\n .catch((err) => {\n console.error(\"Error while adding file:\", err);\n });\n }\n }\n\n async _launchGdPlayer(): Promise {\n assert(this._gdPlayerController != null);\n await this._gdPlayerController.launch();\n }\n\n async _onGdPlayerLog(message: string): Promise {\n assert(this._testController != null);\n this._consoleController.log(message);\n }\n\n async _onGdPlayerLogError(message: string): Promise {\n assert(this._codeController != null);\n assert(this._consoleController != null);\n this._consoleController.error(message);\n await this._codeController.handleError(message);\n }\n\n _onLogTest(entry: GdExerciseLog): void {\n assert(this._testController != null);\n this._testController.log(entry);\n }\n\n async loadFile(file: GdExerciseFile): Promise {\n assert(this._gdPlayerController != null);\n await this._gdPlayerController.addFile(file);\n await this._gdPlayerController.restart();\n\n assert(this._testController != null);\n this._testController.clear();\n }\n\n save(): void {\n assert(this._codeController != null);\n const doc = this._codeController.editorDoc;\n this._codeController.saveDoc(doc);\n localStorage.setItem(\n getFileId(\n this._projectUrl,\n this._project,\n this._codeController.currentFile?.file.path ?? \"\"\n ),\n doc\n );\n }\n\n revert(): void {\n assert(this._codeController != null);\n this._codeController.revertDoc();\n }\n\n dispose(): void {\n this._codeController.dispose();\n this._gdPlayerController.dispose();\n this._testController.dispose();\n }\n\n restart(): void {\n assert(this._gdPlayerController != null);\n this._gdPlayerController.restart().catch((err) => {\n console.error(\"Error while trying to launch gdPlayerController:\", err);\n });\n }\n\n setDarkMode(enabled: boolean): void {\n if (this._codeController != null) {\n this._codeController.darkMode = enabled;\n }\n if (this._consoleController != null) {\n this._consoleController.darkMode = enabled;\n }\n }\n\n logTest(entry: GdExerciseLog): void {\n this._onLogTest(entry);\n }\n}\n\nexport interface CreateMainControllerFile {\n path: string;\n focus: boolean;\n override: string | null;\n}\n\nexport interface CreateMainControllerOptions {\n projectUrl: string;\n project: string;\n mainScene: string;\n files: CreateMainControllerFile[];\n Engine: Godot.EngineClass;\n isDarkMode?: boolean;\n size: Record;\n snippet?: string;\n}\n\nexport async function createMainController(\n options: CreateMainControllerOptions\n): Promise {\n const projectFiles = await getProjectFiles(options.projectUrl);\n const projectFilesOnly = new Map();\n const projectPath = options.project;\n\n for (const [path, file] of projectFiles.entries()) {\n if (basename(projectPath) !== \".\" && !path.startsWith(projectPath)) {\n continue;\n }\n\n const optionFile = options.files.find((file) => file.path === path);\n // Making sure that options.files are all files\n if (optionFile != null) {\n assert(file.type === \"FILE\");\n }\n // Making sure that the current file is a file\n if (file.type !== \"FILE\") {\n continue;\n }\n\n projectFilesOnly.set(path, file);\n\n if (optionFile?.override != null) {\n {\n const textEncoder = new TextEncoder();\n file.data = textEncoder.encode(optionFile.override);\n }\n {\n const textEncoder = new TextEncoder();\n file.original = textEncoder.encode(optionFile.override);\n }\n }\n\n // localStorage check\n const fileId = getFileId(options.projectUrl, options.project, path);\n const item = window.localStorage.getItem(fileId);\n if (item == null) {\n // File not found in localStorage\n continue;\n }\n\n const textEncoder = new TextEncoder();\n file.data = textEncoder.encode(item);\n }\n\n return new MainController({\n ...options,\n projectFiles: projectFilesOnly,\n });\n}\n\nfunction getFileId(\n projectUrl: string,\n project: string,\n filePath: string\n): string {\n const pathname = new URL(projectUrl).pathname;\n return `${pathname}::${project}::${filePath}`;\n}\n", "var __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n};\nvar __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar _PQueue_instances, _PQueue_carryoverConcurrencyCount, _PQueue_isIntervalIgnored, _PQueue_intervalCount, _PQueue_intervalCap, _PQueue_interval, _PQueue_intervalEnd, _PQueue_intervalId, _PQueue_timeoutId, _PQueue_queue, _PQueue_queueClass, _PQueue_pending, _PQueue_concurrency, _PQueue_isPaused, _PQueue_throwOnTimeout, _PQueue_doesIntervalAllowAnother_get, _PQueue_doesConcurrentAllowAnother_get, _PQueue_next, _PQueue_onResumeInterval, _PQueue_isIntervalPaused_get, _PQueue_tryToStartAnother, _PQueue_initializeIntervalIfNeeded, _PQueue_onInterval, _PQueue_processQueue, _PQueue_throwOnAbort, _PQueue_onEvent;\nimport EventEmitter from 'eventemitter3';\nimport pTimeout, { TimeoutError } from 'p-timeout';\nimport PriorityQueue from './priority-queue.js';\n/**\nThe error thrown by `queue.add()` when a job is aborted before it is run. See `signal`.\n*/\nexport class AbortError extends Error {\n}\n/**\nPromise queue with concurrency control.\n*/\nexport default class PQueue extends EventEmitter {\n // TODO: The `throwOnTimeout` option should affect the return types of `add()` and `addAll()`\n constructor(options) {\n var _a, _b, _c, _d;\n super();\n _PQueue_instances.add(this);\n _PQueue_carryoverConcurrencyCount.set(this, void 0);\n _PQueue_isIntervalIgnored.set(this, void 0);\n _PQueue_intervalCount.set(this, 0);\n _PQueue_intervalCap.set(this, void 0);\n _PQueue_interval.set(this, void 0);\n _PQueue_intervalEnd.set(this, 0);\n _PQueue_intervalId.set(this, void 0);\n _PQueue_timeoutId.set(this, void 0);\n _PQueue_queue.set(this, void 0);\n _PQueue_queueClass.set(this, void 0);\n _PQueue_pending.set(this, 0);\n // The `!` is needed because of https://github.com/microsoft/TypeScript/issues/32194\n _PQueue_concurrency.set(this, void 0);\n _PQueue_isPaused.set(this, void 0);\n _PQueue_throwOnTimeout.set(this, void 0);\n /**\n Per-operation timeout in milliseconds. Operations fulfill once `timeout` elapses if they haven't already.\n \n Applies to each future operation.\n */\n Object.defineProperty(this, \"timeout\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n // eslint-disable-next-line @typescript-eslint/consistent-type-assertions\n options = {\n carryoverConcurrencyCount: false,\n intervalCap: Number.POSITIVE_INFINITY,\n interval: 0,\n concurrency: Number.POSITIVE_INFINITY,\n autoStart: true,\n queueClass: PriorityQueue,\n ...options,\n };\n if (!(typeof options.intervalCap === 'number' && options.intervalCap >= 1)) {\n throw new TypeError(`Expected \\`intervalCap\\` to be a number from 1 and up, got \\`${(_b = (_a = options.intervalCap) === null || _a === void 0 ? void 0 : _a.toString()) !== null && _b !== void 0 ? _b : ''}\\` (${typeof options.intervalCap})`);\n }\n if (options.interval === undefined || !(Number.isFinite(options.interval) && options.interval >= 0)) {\n throw new TypeError(`Expected \\`interval\\` to be a finite number >= 0, got \\`${(_d = (_c = options.interval) === null || _c === void 0 ? void 0 : _c.toString()) !== null && _d !== void 0 ? _d : ''}\\` (${typeof options.interval})`);\n }\n __classPrivateFieldSet(this, _PQueue_carryoverConcurrencyCount, options.carryoverConcurrencyCount, \"f\");\n __classPrivateFieldSet(this, _PQueue_isIntervalIgnored, options.intervalCap === Number.POSITIVE_INFINITY || options.interval === 0, \"f\");\n __classPrivateFieldSet(this, _PQueue_intervalCap, options.intervalCap, \"f\");\n __classPrivateFieldSet(this, _PQueue_interval, options.interval, \"f\");\n __classPrivateFieldSet(this, _PQueue_queue, new options.queueClass(), \"f\");\n __classPrivateFieldSet(this, _PQueue_queueClass, options.queueClass, \"f\");\n this.concurrency = options.concurrency;\n this.timeout = options.timeout;\n __classPrivateFieldSet(this, _PQueue_throwOnTimeout, options.throwOnTimeout === true, \"f\");\n __classPrivateFieldSet(this, _PQueue_isPaused, options.autoStart === false, \"f\");\n }\n get concurrency() {\n return __classPrivateFieldGet(this, _PQueue_concurrency, \"f\");\n }\n set concurrency(newConcurrency) {\n if (!(typeof newConcurrency === 'number' && newConcurrency >= 1)) {\n throw new TypeError(`Expected \\`concurrency\\` to be a number from 1 and up, got \\`${newConcurrency}\\` (${typeof newConcurrency})`);\n }\n __classPrivateFieldSet(this, _PQueue_concurrency, newConcurrency, \"f\");\n __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_processQueue).call(this);\n }\n async add(function_, options = {}) {\n options = {\n timeout: this.timeout,\n throwOnTimeout: __classPrivateFieldGet(this, _PQueue_throwOnTimeout, \"f\"),\n ...options,\n };\n return new Promise((resolve, reject) => {\n __classPrivateFieldGet(this, _PQueue_queue, \"f\").enqueue(async () => {\n var _a;\n var _b, _c;\n __classPrivateFieldSet(this, _PQueue_pending, (_b = __classPrivateFieldGet(this, _PQueue_pending, \"f\"), _b++, _b), \"f\");\n __classPrivateFieldSet(this, _PQueue_intervalCount, (_c = __classPrivateFieldGet(this, _PQueue_intervalCount, \"f\"), _c++, _c), \"f\");\n try {\n // TODO: Use options.signal?.throwIfAborted() when targeting Node.js 18\n if ((_a = options.signal) === null || _a === void 0 ? void 0 : _a.aborted) {\n // TODO: Use ABORT_ERR code when targeting Node.js 16 (https://nodejs.org/docs/latest-v16.x/api/errors.html#abort_err)\n throw new AbortError('The task was aborted.');\n }\n let operation = function_({ signal: options.signal });\n if (options.timeout) {\n operation = pTimeout(Promise.resolve(operation), options.timeout);\n }\n if (options.signal) {\n operation = Promise.race([operation, __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_throwOnAbort).call(this, options.signal)]);\n }\n const result = await operation;\n resolve(result);\n this.emit('completed', result);\n }\n catch (error) {\n if (error instanceof TimeoutError && !options.throwOnTimeout) {\n resolve();\n return;\n }\n reject(error);\n this.emit('error', error);\n }\n finally {\n __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_next).call(this);\n }\n }, options);\n this.emit('add');\n __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_tryToStartAnother).call(this);\n });\n }\n async addAll(functions, options) {\n return Promise.all(functions.map(async (function_) => this.add(function_, options)));\n }\n /**\n Start (or resume) executing enqueued tasks within concurrency limit. No need to call this if queue is not paused (via `options.autoStart = false` or by `.pause()` method.)\n */\n start() {\n if (!__classPrivateFieldGet(this, _PQueue_isPaused, \"f\")) {\n return this;\n }\n __classPrivateFieldSet(this, _PQueue_isPaused, false, \"f\");\n __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_processQueue).call(this);\n return this;\n }\n /**\n Put queue execution on hold.\n */\n pause() {\n __classPrivateFieldSet(this, _PQueue_isPaused, true, \"f\");\n }\n /**\n Clear the queue.\n */\n clear() {\n __classPrivateFieldSet(this, _PQueue_queue, new (__classPrivateFieldGet(this, _PQueue_queueClass, \"f\"))(), \"f\");\n }\n /**\n Can be called multiple times. Useful if you for example add additional items at a later time.\n\n @returns A promise that settles when the queue becomes empty.\n */\n async onEmpty() {\n // Instantly resolve if the queue is empty\n if (__classPrivateFieldGet(this, _PQueue_queue, \"f\").size === 0) {\n return;\n }\n await __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_onEvent).call(this, 'empty');\n }\n /**\n @returns A promise that settles when the queue size is less than the given limit: `queue.size < limit`.\n\n If you want to avoid having the queue grow beyond a certain size you can `await queue.onSizeLessThan()` before adding a new item.\n\n Note that this only limits the number of items waiting to start. There could still be up to `concurrency` jobs already running that this call does not include in its calculation.\n */\n async onSizeLessThan(limit) {\n // Instantly resolve if the queue is empty.\n if (__classPrivateFieldGet(this, _PQueue_queue, \"f\").size < limit) {\n return;\n }\n await __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_onEvent).call(this, 'next', () => __classPrivateFieldGet(this, _PQueue_queue, \"f\").size < limit);\n }\n /**\n The difference with `.onEmpty` is that `.onIdle` guarantees that all work from the queue has finished. `.onEmpty` merely signals that the queue is empty, but it could mean that some promises haven't completed yet.\n\n @returns A promise that settles when the queue becomes empty, and all promises have completed; `queue.size === 0 && queue.pending === 0`.\n */\n async onIdle() {\n // Instantly resolve if none pending and if nothing else is queued\n if (__classPrivateFieldGet(this, _PQueue_pending, \"f\") === 0 && __classPrivateFieldGet(this, _PQueue_queue, \"f\").size === 0) {\n return;\n }\n await __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_onEvent).call(this, 'idle');\n }\n /**\n Size of the queue, the number of queued items waiting to run.\n */\n get size() {\n return __classPrivateFieldGet(this, _PQueue_queue, \"f\").size;\n }\n /**\n Size of the queue, filtered by the given options.\n\n For example, this can be used to find the number of items remaining in the queue with a specific priority level.\n */\n sizeBy(options) {\n // eslint-disable-next-line unicorn/no-array-callback-reference\n return __classPrivateFieldGet(this, _PQueue_queue, \"f\").filter(options).length;\n }\n /**\n Number of running items (no longer in the queue).\n */\n get pending() {\n return __classPrivateFieldGet(this, _PQueue_pending, \"f\");\n }\n /**\n Whether the queue is currently paused.\n */\n get isPaused() {\n return __classPrivateFieldGet(this, _PQueue_isPaused, \"f\");\n }\n}\n_PQueue_carryoverConcurrencyCount = new WeakMap(), _PQueue_isIntervalIgnored = new WeakMap(), _PQueue_intervalCount = new WeakMap(), _PQueue_intervalCap = new WeakMap(), _PQueue_interval = new WeakMap(), _PQueue_intervalEnd = new WeakMap(), _PQueue_intervalId = new WeakMap(), _PQueue_timeoutId = new WeakMap(), _PQueue_queue = new WeakMap(), _PQueue_queueClass = new WeakMap(), _PQueue_pending = new WeakMap(), _PQueue_concurrency = new WeakMap(), _PQueue_isPaused = new WeakMap(), _PQueue_throwOnTimeout = new WeakMap(), _PQueue_instances = new WeakSet(), _PQueue_doesIntervalAllowAnother_get = function _PQueue_doesIntervalAllowAnother_get() {\n return __classPrivateFieldGet(this, _PQueue_isIntervalIgnored, \"f\") || __classPrivateFieldGet(this, _PQueue_intervalCount, \"f\") < __classPrivateFieldGet(this, _PQueue_intervalCap, \"f\");\n}, _PQueue_doesConcurrentAllowAnother_get = function _PQueue_doesConcurrentAllowAnother_get() {\n return __classPrivateFieldGet(this, _PQueue_pending, \"f\") < __classPrivateFieldGet(this, _PQueue_concurrency, \"f\");\n}, _PQueue_next = function _PQueue_next() {\n var _a;\n __classPrivateFieldSet(this, _PQueue_pending, (_a = __classPrivateFieldGet(this, _PQueue_pending, \"f\"), _a--, _a), \"f\");\n __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_tryToStartAnother).call(this);\n this.emit('next');\n}, _PQueue_onResumeInterval = function _PQueue_onResumeInterval() {\n __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_onInterval).call(this);\n __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_initializeIntervalIfNeeded).call(this);\n __classPrivateFieldSet(this, _PQueue_timeoutId, undefined, \"f\");\n}, _PQueue_isIntervalPaused_get = function _PQueue_isIntervalPaused_get() {\n const now = Date.now();\n if (__classPrivateFieldGet(this, _PQueue_intervalId, \"f\") === undefined) {\n const delay = __classPrivateFieldGet(this, _PQueue_intervalEnd, \"f\") - now;\n if (delay < 0) {\n // Act as the interval was done\n // We don't need to resume it here because it will be resumed on line 160\n __classPrivateFieldSet(this, _PQueue_intervalCount, (__classPrivateFieldGet(this, _PQueue_carryoverConcurrencyCount, \"f\")) ? __classPrivateFieldGet(this, _PQueue_pending, \"f\") : 0, \"f\");\n }\n else {\n // Act as the interval is pending\n if (__classPrivateFieldGet(this, _PQueue_timeoutId, \"f\") === undefined) {\n __classPrivateFieldSet(this, _PQueue_timeoutId, setTimeout(() => {\n __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_onResumeInterval).call(this);\n }, delay), \"f\");\n }\n return true;\n }\n }\n return false;\n}, _PQueue_tryToStartAnother = function _PQueue_tryToStartAnother() {\n if (__classPrivateFieldGet(this, _PQueue_queue, \"f\").size === 0) {\n // We can clear the interval (\"pause\")\n // Because we can redo it later (\"resume\")\n if (__classPrivateFieldGet(this, _PQueue_intervalId, \"f\")) {\n clearInterval(__classPrivateFieldGet(this, _PQueue_intervalId, \"f\"));\n }\n __classPrivateFieldSet(this, _PQueue_intervalId, undefined, \"f\");\n this.emit('empty');\n if (__classPrivateFieldGet(this, _PQueue_pending, \"f\") === 0) {\n this.emit('idle');\n }\n return false;\n }\n if (!__classPrivateFieldGet(this, _PQueue_isPaused, \"f\")) {\n const canInitializeInterval = !__classPrivateFieldGet(this, _PQueue_instances, \"a\", _PQueue_isIntervalPaused_get);\n if (__classPrivateFieldGet(this, _PQueue_instances, \"a\", _PQueue_doesIntervalAllowAnother_get) && __classPrivateFieldGet(this, _PQueue_instances, \"a\", _PQueue_doesConcurrentAllowAnother_get)) {\n const job = __classPrivateFieldGet(this, _PQueue_queue, \"f\").dequeue();\n if (!job) {\n return false;\n }\n this.emit('active');\n job();\n if (canInitializeInterval) {\n __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_initializeIntervalIfNeeded).call(this);\n }\n return true;\n }\n }\n return false;\n}, _PQueue_initializeIntervalIfNeeded = function _PQueue_initializeIntervalIfNeeded() {\n if (__classPrivateFieldGet(this, _PQueue_isIntervalIgnored, \"f\") || __classPrivateFieldGet(this, _PQueue_intervalId, \"f\") !== undefined) {\n return;\n }\n __classPrivateFieldSet(this, _PQueue_intervalId, setInterval(() => {\n __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_onInterval).call(this);\n }, __classPrivateFieldGet(this, _PQueue_interval, \"f\")), \"f\");\n __classPrivateFieldSet(this, _PQueue_intervalEnd, Date.now() + __classPrivateFieldGet(this, _PQueue_interval, \"f\"), \"f\");\n}, _PQueue_onInterval = function _PQueue_onInterval() {\n if (__classPrivateFieldGet(this, _PQueue_intervalCount, \"f\") === 0 && __classPrivateFieldGet(this, _PQueue_pending, \"f\") === 0 && __classPrivateFieldGet(this, _PQueue_intervalId, \"f\")) {\n clearInterval(__classPrivateFieldGet(this, _PQueue_intervalId, \"f\"));\n __classPrivateFieldSet(this, _PQueue_intervalId, undefined, \"f\");\n }\n __classPrivateFieldSet(this, _PQueue_intervalCount, __classPrivateFieldGet(this, _PQueue_carryoverConcurrencyCount, \"f\") ? __classPrivateFieldGet(this, _PQueue_pending, \"f\") : 0, \"f\");\n __classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_processQueue).call(this);\n}, _PQueue_processQueue = function _PQueue_processQueue() {\n // eslint-disable-next-line no-empty\n while (__classPrivateFieldGet(this, _PQueue_instances, \"m\", _PQueue_tryToStartAnother).call(this)) { }\n}, _PQueue_throwOnAbort = async function _PQueue_throwOnAbort(signal) {\n return new Promise((_resolve, reject) => {\n signal.addEventListener('abort', () => {\n // TODO: Reject with signal.throwIfAborted() when targeting Node.js 18\n // TODO: Use ABORT_ERR code when targeting Node.js 16 (https://nodejs.org/docs/latest-v16.x/api/errors.html#abort_err)\n reject(new AbortError('The task was aborted.'));\n }, { once: true });\n });\n}, _PQueue_onEvent = async function _PQueue_onEvent(event, filter) {\n return new Promise(resolve => {\n const listener = () => {\n if (filter && !filter()) {\n return;\n }\n this.off(event, listener);\n resolve();\n };\n this.on(event, listener);\n });\n};\n", "export class TimeoutError extends Error {\n\tconstructor(message) {\n\t\tsuper(message);\n\t\tthis.name = 'TimeoutError';\n\t}\n}\n\n/**\nAn error to be thrown when the request is aborted by AbortController.\nDOMException is thrown instead of this Error when DOMException is available.\n*/\nexport class AbortError extends Error {\n\tconstructor(message) {\n\t\tsuper();\n\t\tthis.name = 'AbortError';\n\t\tthis.message = message;\n\t}\n}\n\n/**\nTODO: Remove AbortError and just throw DOMException when targeting Node 18.\n*/\nconst getDOMException = errorMessage => globalThis.DOMException === undefined ?\n\tnew AbortError(errorMessage) :\n\tnew DOMException(errorMessage);\n\n/**\nTODO: Remove below function and just 'reject(signal.reason)' when targeting Node 18.\n*/\nconst getAbortedReason = signal => {\n\tconst reason = signal.reason === undefined ?\n\t\tgetDOMException('This operation was aborted.') :\n\t\tsignal.reason;\n\n\treturn reason instanceof Error ? reason : getDOMException(reason);\n};\n\nexport default function pTimeout(promise, milliseconds, fallback, options) {\n\tlet timer;\n\n\tconst cancelablePromise = new Promise((resolve, reject) => {\n\t\tif (typeof milliseconds !== 'number' || Math.sign(milliseconds) !== 1) {\n\t\t\tthrow new TypeError(`Expected \\`milliseconds\\` to be a positive number, got \\`${milliseconds}\\``);\n\t\t}\n\n\t\tif (milliseconds === Number.POSITIVE_INFINITY) {\n\t\t\tresolve(promise);\n\t\t\treturn;\n\t\t}\n\n\t\toptions = {\n\t\t\tcustomTimers: {setTimeout, clearTimeout},\n\t\t\t...options\n\t\t};\n\n\t\tif (options.signal) {\n\t\t\tconst {signal} = options;\n\t\t\tif (signal.aborted) {\n\t\t\t\treject(getAbortedReason(signal));\n\t\t\t}\n\n\t\t\tsignal.addEventListener('abort', () => {\n\t\t\t\treject(getAbortedReason(signal));\n\t\t\t});\n\t\t}\n\n\t\ttimer = options.customTimers.setTimeout.call(undefined, () => {\n\t\t\tif (typeof fallback === 'function') {\n\t\t\t\ttry {\n\t\t\t\t\tresolve(fallback());\n\t\t\t\t} catch (error) {\n\t\t\t\t\treject(error);\n\t\t\t\t}\n\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst message = typeof fallback === 'string' ? fallback : `Promise timed out after ${milliseconds} milliseconds`;\n\t\t\tconst timeoutError = fallback instanceof Error ? fallback : new TimeoutError(message);\n\n\t\t\tif (typeof promise.cancel === 'function') {\n\t\t\t\tpromise.cancel();\n\t\t\t}\n\n\t\t\treject(timeoutError);\n\t\t}, milliseconds);\n\n\t\t(async () => {\n\t\t\ttry {\n\t\t\t\tresolve(await promise);\n\t\t\t} catch (error) {\n\t\t\t\treject(error);\n\t\t\t} finally {\n\t\t\t\toptions.customTimers.clearTimeout.call(undefined, timer);\n\t\t\t}\n\t\t})();\n\t});\n\n\tcancelablePromise.clear = () => {\n\t\tclearTimeout(timer);\n\t\ttimer = undefined;\n\t};\n\n\treturn cancelablePromise;\n}\n", "// Port of lower_bound from https://en.cppreference.com/w/cpp/algorithm/lower_bound\n// Used to compute insertion index to keep queue sorted after insertion\nexport default function lowerBound(array, value, comparator) {\n let first = 0;\n let count = array.length;\n while (count > 0) {\n const step = Math.trunc(count / 2);\n let it = first + step;\n if (comparator(array[it], value) <= 0) {\n first = ++it;\n count -= step + 1;\n }\n else {\n count = step;\n }\n }\n return first;\n}\n", "var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar _PriorityQueue_queue;\nimport lowerBound from './lower-bound.js';\nexport default class PriorityQueue {\n constructor() {\n _PriorityQueue_queue.set(this, []);\n }\n enqueue(run, options) {\n options = {\n priority: 0,\n ...options,\n };\n const element = {\n priority: options.priority,\n run,\n };\n if (this.size && __classPrivateFieldGet(this, _PriorityQueue_queue, \"f\")[this.size - 1].priority >= options.priority) {\n __classPrivateFieldGet(this, _PriorityQueue_queue, \"f\").push(element);\n return;\n }\n const index = lowerBound(__classPrivateFieldGet(this, _PriorityQueue_queue, \"f\"), element, (a, b) => b.priority - a.priority);\n __classPrivateFieldGet(this, _PriorityQueue_queue, \"f\").splice(index, 0, element);\n }\n dequeue() {\n const item = __classPrivateFieldGet(this, _PriorityQueue_queue, \"f\").shift();\n return item === null || item === void 0 ? void 0 : item.run;\n }\n filter(options) {\n return __classPrivateFieldGet(this, _PriorityQueue_queue, \"f\").filter((element) => element.priority === options.priority).map((element) => element.run);\n }\n get size() {\n return __classPrivateFieldGet(this, _PriorityQueue_queue, \"f\").length;\n }\n}\n_PriorityQueue_queue = new WeakMap();\n", "import { EventEmitter } from \"eventemitter3\";\nimport { join } from \"path-browserify\";\n\nimport { basicSetup } from \"codemirror\";\nimport { EditorView, keymap } from \"@codemirror/view\";\nimport { Compartment, EditorState } from \"@codemirror/state\";\nimport { indentWithTab } from \"@codemirror/commands\";\nimport { indentUnit } from \"@codemirror/language\";\nimport { type Diagnostic, lintGutter, setDiagnostics } from \"@codemirror/lint\";\n\nimport {\n type ServerResponseCallback,\n getCharacterFromPosition,\n} from \"@gdquest/codemirror-lsp\";\nimport {\n gdExerciseThemeLight,\n gdExerciseThemeDark,\n gdExerciseHighlightLight,\n gdExerciseHighlightDark,\n} from \"@gdquest/codemirror-gd-exercise-theme\";\n\nimport {\n assert,\n cloneFile,\n convertResToAbsolute,\n type GdExerciseFile,\n} from \"@/utils.mjs\";\n\nexport interface CodeControllerFile {\n file: GdExerciseFile;\n diagnostics: Diagnostic[];\n}\n\nexport interface CodeControllerEvents {\n ready: () => void;\n clientLspCommand: (jsonRpc: string) => void;\n save: (file: GdExerciseFile) => void;\n}\n\nconst ERROR_MESSAGE_FIRST_LINE_REGEX = /^(?.+)\\n/;\nconst ERROR_MESSAGE_MATCH_LINES_REGEX =\n /\\((?res:\\/\\/.+\\.gd):(?\\d+)\\)/g;\n\nexport class CodeController extends EventEmitter {\n projectId: string;\n projectUrl: string;\n project: string;\n\n parent: HTMLElement | null;\n\n language: Compartment;\n lsp: Compartment;\n freeze: Compartment;\n tabSize: Compartment;\n theme: Compartment;\n highlight: Compartment;\n view: EditorView | null;\n emitServerCommand: ServerResponseCallback | null;\n\n loadedFiles: CodeControllerFile[];\n currentFile: CodeControllerFile | null;\n\n snippet: string;\n\n get isSnippet(): boolean {\n return this.snippet.length > 0;\n }\n\n set isSnippet(_) {}\n\n _darkMode: boolean;\n\n get darkMode(): boolean {\n return this._darkMode;\n }\n\n set darkMode(val: boolean) {\n this._darkMode = val;\n this.view?.dispatch({\n effects: [\n this.theme.reconfigure(\n val ? gdExerciseThemeDark : gdExerciseThemeLight\n ),\n this.highlight.reconfigure(\n val ? gdExerciseHighlightDark : gdExerciseHighlightLight\n ),\n ],\n });\n }\n\n get currentDoc(): string {\n if (this.currentFile == null) {\n return \"\";\n }\n\n const textDecoder = new TextDecoder();\n const doc = textDecoder.decode(this.currentFile.file.data);\n\n return doc;\n }\n\n set currentDoc(doc: string) {\n assert(this.view != null);\n\n const changes = [\n {\n from: 0,\n to: this.view.state.doc.toString().length,\n insert: doc,\n },\n ];\n this.view.dispatch({ changes }, { filter: false });\n }\n\n get editorDoc(): string {\n return this.view?.state.doc.toString() ?? \"\";\n }\n\n constructor(\n projectId: string,\n project: string,\n projectUrl: string,\n files: GdExerciseFile[],\n darkMode: boolean = false,\n snippet: string = \"\"\n ) {\n super();\n\n this.projectId = projectId;\n this.projectUrl = projectUrl;\n this.project = project;\n\n this.language = new Compartment();\n this.lsp = new Compartment();\n this.freeze = new Compartment();\n this.tabSize = new Compartment();\n this.theme = new Compartment();\n this.highlight = new Compartment();\n\n this.parent = null;\n this.view = null;\n this.emitServerCommand = null;\n\n this.loadedFiles = [];\n this.currentFile = null;\n\n this._darkMode = darkMode ?? false;\n\n this.snippet = snippet;\n\n if (this.isSnippet) {\n const snippetData = new TextEncoder().encode(snippet);\n const currentFile = {\n data: snippetData,\n original: new Uint8Array(snippetData),\n path: \"\",\n size: snippetData.length,\n type: \"FILE\",\n focus: true,\n } satisfies GdExerciseFile;\n files = [currentFile];\n }\n\n this._loadFiles(files);\n }\n\n _loadFiles(filesToLoad: GdExerciseFile[]): void {\n for (const fileToLoad of filesToLoad) {\n const clonedFile = cloneFile(fileToLoad);\n const file = {\n file: clonedFile,\n diagnostics: [],\n } satisfies CodeControllerFile;\n this.loadedFiles.push(file);\n\n if (fileToLoad.focus === true) {\n this.currentFile = file;\n }\n }\n }\n\n /**\n * Load dynamically GDScript to reduce load size\n */\n async _importGdScript(): Promise {\n const { gdscript } = await import(\"@gdquest/codemirror-gdscript\");\n assert(this.view != null);\n this.view.dispatch({\n effects: this.language.reconfigure(gdscript()),\n });\n }\n\n /**\n * Load dynamically LSP to reduce load size\n */\n async _importLsp(): Promise {\n const { createLsp } = await import(\"@gdquest/codemirror-lsp\");\n assert(this.view != null);\n this.view.dispatch({\n effects: this.lsp.reconfigure(\n createLsp({\n getData: (data) => {\n const { emitServerCommand } = data;\n this.emitServerCommand = emitServerCommand;\n },\n onClientCommand: (jsonRpc) => {\n this._onClientCommand(jsonRpc);\n },\n })\n ),\n });\n }\n\n /**\n * Load dynamically freeze to reduce load size\n */\n async _importFreeze(): Promise {\n const { freeze } = await import(\"@gdquest/codemirror-freeze\");\n assert(this.view != null);\n this.view.dispatch({\n effects: this.freeze.reconfigure(freeze()),\n });\n }\n\n _onClientCommand(jsonRpc: string): void {\n this.emit(\"clientLspCommand\", jsonRpc);\n }\n\n async init(): Promise {\n assert(this.parent != null, \"parent is null, cannot init\");\n this.changeFile(this.currentFile);\n }\n\n changeFile(file?: CodeControllerFile | null): void {\n let doc = \"\";\n\n if (file != null) {\n this.currentFile = file;\n doc = this.currentDoc;\n }\n\n assert(this.parent != null);\n\n while (this.parent.firstChild != null) {\n this.parent.firstChild.remove();\n }\n\n this.view = new EditorView({\n parent: this.parent,\n extensions: [\n basicSetup,\n this.language.of([]),\n this.lsp.of([]),\n this.freeze.of([]),\n this.tabSize.of(EditorState.tabSize.of(4)),\n this.theme.of(\n this.darkMode ? gdExerciseThemeDark : gdExerciseThemeLight\n ),\n this.highlight.of(\n this.darkMode ? gdExerciseHighlightDark : gdExerciseHighlightLight\n ),\n indentUnit.of(\"\\t\"),\n keymap.of([indentWithTab]),\n lintGutter(),\n ],\n doc,\n });\n\n this._importGdScript().catch((err) => {\n console.error(\"Failed to import gdscript language\", err);\n });\n\n this._importLsp().catch((err) => {\n console.error(\"Failed to import lsp\", err);\n });\n\n this._importFreeze().catch((err) => {\n console.error(\"Failed to import freeze\", err);\n });\n }\n\n saveDoc(doc: string): void {\n assert(this.currentFile != null);\n\n if (doc === this.currentDoc) {\n return;\n }\n\n const textEncoder = new TextEncoder();\n const data = textEncoder.encode(doc);\n\n this.currentFile.file.data = data;\n this.emit(\"save\", this.currentFile.file);\n }\n\n getOriginalDoc(): string {\n if (this.currentFile == null) {\n return \"\";\n }\n\n for (const loadedFile of this.loadedFiles) {\n if (loadedFile.file.path !== this.currentFile.file.path) {\n continue;\n }\n\n const textDecoder = new TextDecoder();\n const doc = textDecoder.decode(loadedFile.file.original);\n\n return doc;\n }\n\n return \"\";\n }\n\n revertDoc(): void {\n this.currentDoc = this.getOriginalDoc();\n }\n\n async handleError(message: string): Promise {\n assert(this.view != null);\n assert(this.currentFile != null);\n\n const errorMessage = message.match(ERROR_MESSAGE_FIRST_LINE_REGEX);\n assert(\n errorMessage != null,\n \"Tried to handle error message, but did not find a first line\"\n );\n\n const lines = message.matchAll(ERROR_MESSAGE_MATCH_LINES_REGEX);\n for (const line of lines) {\n if (line.groups?.file == null || line.groups?.line == null) {\n continue;\n }\n\n const absolutePath = convertResToAbsolute(\n line.groups.file,\n this.projectId\n );\n\n for (const file of this.loadedFiles) {\n if (\n absolutePath !==\n join(\"/home/web_user/projects\", this.projectId, file.file.path)\n ) {\n continue;\n }\n\n file.diagnostics.push({\n severity: \"error\",\n from: getCharacterFromPosition(this.view.state.doc.toString(), {\n line: parseInt(line.groups.line) - 1,\n character: 0,\n }),\n to:\n getCharacterFromPosition(this.view.state.doc.toString(), {\n line: parseInt(line.groups.line),\n character: 0,\n }) - 1,\n message,\n } satisfies Diagnostic);\n }\n\n const transitionSpec = setDiagnostics(\n this.view.state,\n this.currentFile.diagnostics\n );\n const transaction = this.view.state.update(transitionSpec);\n this.view.dispatch(transaction);\n }\n }\n\n dispose(): void {\n this.removeAllListeners(\"ready\");\n\n if (this.parent == null) return;\n\n while (this.parent.firstChild != null) {\n this.parent.firstChild.remove();\n }\n }\n}\n", "'use strict'\r\n\r\nmodule.exports = {\r\n\t\"aliceblue\": [240, 248, 255],\r\n\t\"antiquewhite\": [250, 235, 215],\r\n\t\"aqua\": [0, 255, 255],\r\n\t\"aquamarine\": [127, 255, 212],\r\n\t\"azure\": [240, 255, 255],\r\n\t\"beige\": [245, 245, 220],\r\n\t\"bisque\": [255, 228, 196],\r\n\t\"black\": [0, 0, 0],\r\n\t\"blanchedalmond\": [255, 235, 205],\r\n\t\"blue\": [0, 0, 255],\r\n\t\"blueviolet\": [138, 43, 226],\r\n\t\"brown\": [165, 42, 42],\r\n\t\"burlywood\": [222, 184, 135],\r\n\t\"cadetblue\": [95, 158, 160],\r\n\t\"chartreuse\": [127, 255, 0],\r\n\t\"chocolate\": [210, 105, 30],\r\n\t\"coral\": [255, 127, 80],\r\n\t\"cornflowerblue\": [100, 149, 237],\r\n\t\"cornsilk\": [255, 248, 220],\r\n\t\"crimson\": [220, 20, 60],\r\n\t\"cyan\": [0, 255, 255],\r\n\t\"darkblue\": [0, 0, 139],\r\n\t\"darkcyan\": [0, 139, 139],\r\n\t\"darkgoldenrod\": [184, 134, 11],\r\n\t\"darkgray\": [169, 169, 169],\r\n\t\"darkgreen\": [0, 100, 0],\r\n\t\"darkgrey\": [169, 169, 169],\r\n\t\"darkkhaki\": [189, 183, 107],\r\n\t\"darkmagenta\": [139, 0, 139],\r\n\t\"darkolivegreen\": [85, 107, 47],\r\n\t\"darkorange\": [255, 140, 0],\r\n\t\"darkorchid\": [153, 50, 204],\r\n\t\"darkred\": [139, 0, 0],\r\n\t\"darksalmon\": [233, 150, 122],\r\n\t\"darkseagreen\": [143, 188, 143],\r\n\t\"darkslateblue\": [72, 61, 139],\r\n\t\"darkslategray\": [47, 79, 79],\r\n\t\"darkslategrey\": [47, 79, 79],\r\n\t\"darkturquoise\": [0, 206, 209],\r\n\t\"darkviolet\": [148, 0, 211],\r\n\t\"deeppink\": [255, 20, 147],\r\n\t\"deepskyblue\": [0, 191, 255],\r\n\t\"dimgray\": [105, 105, 105],\r\n\t\"dimgrey\": [105, 105, 105],\r\n\t\"dodgerblue\": [30, 144, 255],\r\n\t\"firebrick\": [178, 34, 34],\r\n\t\"floralwhite\": [255, 250, 240],\r\n\t\"forestgreen\": [34, 139, 34],\r\n\t\"fuchsia\": [255, 0, 255],\r\n\t\"gainsboro\": [220, 220, 220],\r\n\t\"ghostwhite\": [248, 248, 255],\r\n\t\"gold\": [255, 215, 0],\r\n\t\"goldenrod\": [218, 165, 32],\r\n\t\"gray\": [128, 128, 128],\r\n\t\"green\": [0, 128, 0],\r\n\t\"greenyellow\": [173, 255, 47],\r\n\t\"grey\": [128, 128, 128],\r\n\t\"honeydew\": [240, 255, 240],\r\n\t\"hotpink\": [255, 105, 180],\r\n\t\"indianred\": [205, 92, 92],\r\n\t\"indigo\": [75, 0, 130],\r\n\t\"ivory\": [255, 255, 240],\r\n\t\"khaki\": [240, 230, 140],\r\n\t\"lavender\": [230, 230, 250],\r\n\t\"lavenderblush\": [255, 240, 245],\r\n\t\"lawngreen\": [124, 252, 0],\r\n\t\"lemonchiffon\": [255, 250, 205],\r\n\t\"lightblue\": [173, 216, 230],\r\n\t\"lightcoral\": [240, 128, 128],\r\n\t\"lightcyan\": [224, 255, 255],\r\n\t\"lightgoldenrodyellow\": [250, 250, 210],\r\n\t\"lightgray\": [211, 211, 211],\r\n\t\"lightgreen\": [144, 238, 144],\r\n\t\"lightgrey\": [211, 211, 211],\r\n\t\"lightpink\": [255, 182, 193],\r\n\t\"lightsalmon\": [255, 160, 122],\r\n\t\"lightseagreen\": [32, 178, 170],\r\n\t\"lightskyblue\": [135, 206, 250],\r\n\t\"lightslategray\": [119, 136, 153],\r\n\t\"lightslategrey\": [119, 136, 153],\r\n\t\"lightsteelblue\": [176, 196, 222],\r\n\t\"lightyellow\": [255, 255, 224],\r\n\t\"lime\": [0, 255, 0],\r\n\t\"limegreen\": [50, 205, 50],\r\n\t\"linen\": [250, 240, 230],\r\n\t\"magenta\": [255, 0, 255],\r\n\t\"maroon\": [128, 0, 0],\r\n\t\"mediumaquamarine\": [102, 205, 170],\r\n\t\"mediumblue\": [0, 0, 205],\r\n\t\"mediumorchid\": [186, 85, 211],\r\n\t\"mediumpurple\": [147, 112, 219],\r\n\t\"mediumseagreen\": [60, 179, 113],\r\n\t\"mediumslateblue\": [123, 104, 238],\r\n\t\"mediumspringgreen\": [0, 250, 154],\r\n\t\"mediumturquoise\": [72, 209, 204],\r\n\t\"mediumvioletred\": [199, 21, 133],\r\n\t\"midnightblue\": [25, 25, 112],\r\n\t\"mintcream\": [245, 255, 250],\r\n\t\"mistyrose\": [255, 228, 225],\r\n\t\"moccasin\": [255, 228, 181],\r\n\t\"navajowhite\": [255, 222, 173],\r\n\t\"navy\": [0, 0, 128],\r\n\t\"oldlace\": [253, 245, 230],\r\n\t\"olive\": [128, 128, 0],\r\n\t\"olivedrab\": [107, 142, 35],\r\n\t\"orange\": [255, 165, 0],\r\n\t\"orangered\": [255, 69, 0],\r\n\t\"orchid\": [218, 112, 214],\r\n\t\"palegoldenrod\": [238, 232, 170],\r\n\t\"palegreen\": [152, 251, 152],\r\n\t\"paleturquoise\": [175, 238, 238],\r\n\t\"palevioletred\": [219, 112, 147],\r\n\t\"papayawhip\": [255, 239, 213],\r\n\t\"peachpuff\": [255, 218, 185],\r\n\t\"peru\": [205, 133, 63],\r\n\t\"pink\": [255, 192, 203],\r\n\t\"plum\": [221, 160, 221],\r\n\t\"powderblue\": [176, 224, 230],\r\n\t\"purple\": [128, 0, 128],\r\n\t\"rebeccapurple\": [102, 51, 153],\r\n\t\"red\": [255, 0, 0],\r\n\t\"rosybrown\": [188, 143, 143],\r\n\t\"royalblue\": [65, 105, 225],\r\n\t\"saddlebrown\": [139, 69, 19],\r\n\t\"salmon\": [250, 128, 114],\r\n\t\"sandybrown\": [244, 164, 96],\r\n\t\"seagreen\": [46, 139, 87],\r\n\t\"seashell\": [255, 245, 238],\r\n\t\"sienna\": [160, 82, 45],\r\n\t\"silver\": [192, 192, 192],\r\n\t\"skyblue\": [135, 206, 235],\r\n\t\"slateblue\": [106, 90, 205],\r\n\t\"slategray\": [112, 128, 144],\r\n\t\"slategrey\": [112, 128, 144],\r\n\t\"snow\": [255, 250, 250],\r\n\t\"springgreen\": [0, 255, 127],\r\n\t\"steelblue\": [70, 130, 180],\r\n\t\"tan\": [210, 180, 140],\r\n\t\"teal\": [0, 128, 128],\r\n\t\"thistle\": [216, 191, 216],\r\n\t\"tomato\": [255, 99, 71],\r\n\t\"turquoise\": [64, 224, 208],\r\n\t\"violet\": [238, 130, 238],\r\n\t\"wheat\": [245, 222, 179],\r\n\t\"white\": [255, 255, 255],\r\n\t\"whitesmoke\": [245, 245, 245],\r\n\t\"yellow\": [255, 255, 0],\r\n\t\"yellowgreen\": [154, 205, 50]\r\n};\r\n", "module.exports = function isArrayish(obj) {\n\tif (!obj || typeof obj === 'string') {\n\t\treturn false;\n\t}\n\n\treturn obj instanceof Array || Array.isArray(obj) ||\n\t\t(obj.length >= 0 && (obj.splice instanceof Function ||\n\t\t\t(Object.getOwnPropertyDescriptor(obj, (obj.length - 1)) && obj.constructor.name !== 'String')));\n};\n", "'use strict';\n\nvar isArrayish = require('is-arrayish');\n\nvar concat = Array.prototype.concat;\nvar slice = Array.prototype.slice;\n\nvar swizzle = module.exports = function swizzle(args) {\n\tvar results = [];\n\n\tfor (var i = 0, len = args.length; i < len; i++) {\n\t\tvar arg = args[i];\n\n\t\tif (isArrayish(arg)) {\n\t\t\t// http://jsperf.com/javascript-array-concat-vs-push/98\n\t\t\tresults = concat.call(results, slice.call(arg));\n\t\t} else {\n\t\t\tresults.push(arg);\n\t\t}\n\t}\n\n\treturn results;\n};\n\nswizzle.wrap = function (fn) {\n\treturn function () {\n\t\treturn fn(swizzle(arguments));\n\t};\n};\n", "/* MIT license */\nvar colorNames = require('color-name');\nvar swizzle = require('simple-swizzle');\nvar hasOwnProperty = Object.hasOwnProperty;\n\nvar reverseNames = Object.create(null);\n\n// create a list of reverse color names\nfor (var name in colorNames) {\n\tif (hasOwnProperty.call(colorNames, name)) {\n\t\treverseNames[colorNames[name]] = name;\n\t}\n}\n\nvar cs = module.exports = {\n\tto: {},\n\tget: {}\n};\n\ncs.get = function (string) {\n\tvar prefix = string.substring(0, 3).toLowerCase();\n\tvar val;\n\tvar model;\n\tswitch (prefix) {\n\t\tcase 'hsl':\n\t\t\tval = cs.get.hsl(string);\n\t\t\tmodel = 'hsl';\n\t\t\tbreak;\n\t\tcase 'hwb':\n\t\t\tval = cs.get.hwb(string);\n\t\t\tmodel = 'hwb';\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tval = cs.get.rgb(string);\n\t\t\tmodel = 'rgb';\n\t\t\tbreak;\n\t}\n\n\tif (!val) {\n\t\treturn null;\n\t}\n\n\treturn {model: model, value: val};\n};\n\ncs.get.rgb = function (string) {\n\tif (!string) {\n\t\treturn null;\n\t}\n\n\tvar abbr = /^#([a-f0-9]{3,4})$/i;\n\tvar hex = /^#([a-f0-9]{6})([a-f0-9]{2})?$/i;\n\tvar rgba = /^rgba?\\(\\s*([+-]?\\d+)(?=[\\s,])\\s*(?:,\\s*)?([+-]?\\d+)(?=[\\s,])\\s*(?:,\\s*)?([+-]?\\d+)\\s*(?:[,|\\/]\\s*([+-]?[\\d\\.]+)(%?)\\s*)?\\)$/;\n\tvar per = /^rgba?\\(\\s*([+-]?[\\d\\.]+)\\%\\s*,?\\s*([+-]?[\\d\\.]+)\\%\\s*,?\\s*([+-]?[\\d\\.]+)\\%\\s*(?:[,|\\/]\\s*([+-]?[\\d\\.]+)(%?)\\s*)?\\)$/;\n\tvar keyword = /^(\\w+)$/;\n\n\tvar rgb = [0, 0, 0, 1];\n\tvar match;\n\tvar i;\n\tvar hexAlpha;\n\n\tif (match = string.match(hex)) {\n\t\thexAlpha = match[2];\n\t\tmatch = match[1];\n\n\t\tfor (i = 0; i < 3; i++) {\n\t\t\t// https://jsperf.com/slice-vs-substr-vs-substring-methods-long-string/19\n\t\t\tvar i2 = i * 2;\n\t\t\trgb[i] = parseInt(match.slice(i2, i2 + 2), 16);\n\t\t}\n\n\t\tif (hexAlpha) {\n\t\t\trgb[3] = parseInt(hexAlpha, 16) / 255;\n\t\t}\n\t} else if (match = string.match(abbr)) {\n\t\tmatch = match[1];\n\t\thexAlpha = match[3];\n\n\t\tfor (i = 0; i < 3; i++) {\n\t\t\trgb[i] = parseInt(match[i] + match[i], 16);\n\t\t}\n\n\t\tif (hexAlpha) {\n\t\t\trgb[3] = parseInt(hexAlpha + hexAlpha, 16) / 255;\n\t\t}\n\t} else if (match = string.match(rgba)) {\n\t\tfor (i = 0; i < 3; i++) {\n\t\t\trgb[i] = parseInt(match[i + 1], 0);\n\t\t}\n\n\t\tif (match[4]) {\n\t\t\tif (match[5]) {\n\t\t\t\trgb[3] = parseFloat(match[4]) * 0.01;\n\t\t\t} else {\n\t\t\t\trgb[3] = parseFloat(match[4]);\n\t\t\t}\n\t\t}\n\t} else if (match = string.match(per)) {\n\t\tfor (i = 0; i < 3; i++) {\n\t\t\trgb[i] = Math.round(parseFloat(match[i + 1]) * 2.55);\n\t\t}\n\n\t\tif (match[4]) {\n\t\t\tif (match[5]) {\n\t\t\t\trgb[3] = parseFloat(match[4]) * 0.01;\n\t\t\t} else {\n\t\t\t\trgb[3] = parseFloat(match[4]);\n\t\t\t}\n\t\t}\n\t} else if (match = string.match(keyword)) {\n\t\tif (match[1] === 'transparent') {\n\t\t\treturn [0, 0, 0, 0];\n\t\t}\n\n\t\tif (!hasOwnProperty.call(colorNames, match[1])) {\n\t\t\treturn null;\n\t\t}\n\n\t\trgb = colorNames[match[1]];\n\t\trgb[3] = 1;\n\n\t\treturn rgb;\n\t} else {\n\t\treturn null;\n\t}\n\n\tfor (i = 0; i < 3; i++) {\n\t\trgb[i] = clamp(rgb[i], 0, 255);\n\t}\n\trgb[3] = clamp(rgb[3], 0, 1);\n\n\treturn rgb;\n};\n\ncs.get.hsl = function (string) {\n\tif (!string) {\n\t\treturn null;\n\t}\n\n\tvar hsl = /^hsla?\\(\\s*([+-]?(?:\\d{0,3}\\.)?\\d+)(?:deg)?\\s*,?\\s*([+-]?[\\d\\.]+)%\\s*,?\\s*([+-]?[\\d\\.]+)%\\s*(?:[,|\\/]\\s*([+-]?(?=\\.\\d|\\d)(?:0|[1-9]\\d*)?(?:\\.\\d*)?(?:[eE][+-]?\\d+)?)\\s*)?\\)$/;\n\tvar match = string.match(hsl);\n\n\tif (match) {\n\t\tvar alpha = parseFloat(match[4]);\n\t\tvar h = ((parseFloat(match[1]) % 360) + 360) % 360;\n\t\tvar s = clamp(parseFloat(match[2]), 0, 100);\n\t\tvar l = clamp(parseFloat(match[3]), 0, 100);\n\t\tvar a = clamp(isNaN(alpha) ? 1 : alpha, 0, 1);\n\n\t\treturn [h, s, l, a];\n\t}\n\n\treturn null;\n};\n\ncs.get.hwb = function (string) {\n\tif (!string) {\n\t\treturn null;\n\t}\n\n\tvar hwb = /^hwb\\(\\s*([+-]?\\d{0,3}(?:\\.\\d+)?)(?:deg)?\\s*,\\s*([+-]?[\\d\\.]+)%\\s*,\\s*([+-]?[\\d\\.]+)%\\s*(?:,\\s*([+-]?(?=\\.\\d|\\d)(?:0|[1-9]\\d*)?(?:\\.\\d*)?(?:[eE][+-]?\\d+)?)\\s*)?\\)$/;\n\tvar match = string.match(hwb);\n\n\tif (match) {\n\t\tvar alpha = parseFloat(match[4]);\n\t\tvar h = ((parseFloat(match[1]) % 360) + 360) % 360;\n\t\tvar w = clamp(parseFloat(match[2]), 0, 100);\n\t\tvar b = clamp(parseFloat(match[3]), 0, 100);\n\t\tvar a = clamp(isNaN(alpha) ? 1 : alpha, 0, 1);\n\t\treturn [h, w, b, a];\n\t}\n\n\treturn null;\n};\n\ncs.to.hex = function () {\n\tvar rgba = swizzle(arguments);\n\n\treturn (\n\t\t'#' +\n\t\thexDouble(rgba[0]) +\n\t\thexDouble(rgba[1]) +\n\t\thexDouble(rgba[2]) +\n\t\t(rgba[3] < 1\n\t\t\t? (hexDouble(Math.round(rgba[3] * 255)))\n\t\t\t: '')\n\t);\n};\n\ncs.to.rgb = function () {\n\tvar rgba = swizzle(arguments);\n\n\treturn rgba.length < 4 || rgba[3] === 1\n\t\t? 'rgb(' + Math.round(rgba[0]) + ', ' + Math.round(rgba[1]) + ', ' + Math.round(rgba[2]) + ')'\n\t\t: 'rgba(' + Math.round(rgba[0]) + ', ' + Math.round(rgba[1]) + ', ' + Math.round(rgba[2]) + ', ' + rgba[3] + ')';\n};\n\ncs.to.rgb.percent = function () {\n\tvar rgba = swizzle(arguments);\n\n\tvar r = Math.round(rgba[0] / 255 * 100);\n\tvar g = Math.round(rgba[1] / 255 * 100);\n\tvar b = Math.round(rgba[2] / 255 * 100);\n\n\treturn rgba.length < 4 || rgba[3] === 1\n\t\t? 'rgb(' + r + '%, ' + g + '%, ' + b + '%)'\n\t\t: 'rgba(' + r + '%, ' + g + '%, ' + b + '%, ' + rgba[3] + ')';\n};\n\ncs.to.hsl = function () {\n\tvar hsla = swizzle(arguments);\n\treturn hsla.length < 4 || hsla[3] === 1\n\t\t? 'hsl(' + hsla[0] + ', ' + hsla[1] + '%, ' + hsla[2] + '%)'\n\t\t: 'hsla(' + hsla[0] + ', ' + hsla[1] + '%, ' + hsla[2] + '%, ' + hsla[3] + ')';\n};\n\n// hwb is a bit different than rgb(a) & hsl(a) since there is no alpha specific syntax\n// (hwb have alpha optional & 1 is default value)\ncs.to.hwb = function () {\n\tvar hwba = swizzle(arguments);\n\n\tvar a = '';\n\tif (hwba.length >= 4 && hwba[3] !== 1) {\n\t\ta = ', ' + hwba[3];\n\t}\n\n\treturn 'hwb(' + hwba[0] + ', ' + hwba[1] + '%, ' + hwba[2] + '%' + a + ')';\n};\n\ncs.to.keyword = function (rgb) {\n\treturn reverseNames[rgb.slice(0, 3)];\n};\n\n// helpers\nfunction clamp(num, min, max) {\n\treturn Math.min(Math.max(min, num), max);\n}\n\nfunction hexDouble(num) {\n\tvar str = Math.round(num).toString(16).toUpperCase();\n\treturn (str.length < 2) ? '0' + str : str;\n}\n", "/* MIT license */\n/* eslint-disable no-mixed-operators */\nconst cssKeywords = require('color-name');\n\n// NOTE: conversions should only return primitive values (i.e. arrays, or\n// values that give correct `typeof` results).\n// do not use box values types (i.e. Number(), String(), etc.)\n\nconst reverseKeywords = {};\nfor (const key of Object.keys(cssKeywords)) {\n\treverseKeywords[cssKeywords[key]] = key;\n}\n\nconst convert = {\n\trgb: {channels: 3, labels: 'rgb'},\n\thsl: {channels: 3, labels: 'hsl'},\n\thsv: {channels: 3, labels: 'hsv'},\n\thwb: {channels: 3, labels: 'hwb'},\n\tcmyk: {channels: 4, labels: 'cmyk'},\n\txyz: {channels: 3, labels: 'xyz'},\n\tlab: {channels: 3, labels: 'lab'},\n\tlch: {channels: 3, labels: 'lch'},\n\thex: {channels: 1, labels: ['hex']},\n\tkeyword: {channels: 1, labels: ['keyword']},\n\tansi16: {channels: 1, labels: ['ansi16']},\n\tansi256: {channels: 1, labels: ['ansi256']},\n\thcg: {channels: 3, labels: ['h', 'c', 'g']},\n\tapple: {channels: 3, labels: ['r16', 'g16', 'b16']},\n\tgray: {channels: 1, labels: ['gray']}\n};\n\nmodule.exports = convert;\n\n// Hide .channels and .labels properties\nfor (const model of Object.keys(convert)) {\n\tif (!('channels' in convert[model])) {\n\t\tthrow new Error('missing channels property: ' + model);\n\t}\n\n\tif (!('labels' in convert[model])) {\n\t\tthrow new Error('missing channel labels property: ' + model);\n\t}\n\n\tif (convert[model].labels.length !== convert[model].channels) {\n\t\tthrow new Error('channel and label counts mismatch: ' + model);\n\t}\n\n\tconst {channels, labels} = convert[model];\n\tdelete convert[model].channels;\n\tdelete convert[model].labels;\n\tObject.defineProperty(convert[model], 'channels', {value: channels});\n\tObject.defineProperty(convert[model], 'labels', {value: labels});\n}\n\nconvert.rgb.hsl = function (rgb) {\n\tconst r = rgb[0] / 255;\n\tconst g = rgb[1] / 255;\n\tconst b = rgb[2] / 255;\n\tconst min = Math.min(r, g, b);\n\tconst max = Math.max(r, g, b);\n\tconst delta = max - min;\n\tlet h;\n\tlet s;\n\n\tif (max === min) {\n\t\th = 0;\n\t} else if (r === max) {\n\t\th = (g - b) / delta;\n\t} else if (g === max) {\n\t\th = 2 + (b - r) / delta;\n\t} else if (b === max) {\n\t\th = 4 + (r - g) / delta;\n\t}\n\n\th = Math.min(h * 60, 360);\n\n\tif (h < 0) {\n\t\th += 360;\n\t}\n\n\tconst l = (min + max) / 2;\n\n\tif (max === min) {\n\t\ts = 0;\n\t} else if (l <= 0.5) {\n\t\ts = delta / (max + min);\n\t} else {\n\t\ts = delta / (2 - max - min);\n\t}\n\n\treturn [h, s * 100, l * 100];\n};\n\nconvert.rgb.hsv = function (rgb) {\n\tlet rdif;\n\tlet gdif;\n\tlet bdif;\n\tlet h;\n\tlet s;\n\n\tconst r = rgb[0] / 255;\n\tconst g = rgb[1] / 255;\n\tconst b = rgb[2] / 255;\n\tconst v = Math.max(r, g, b);\n\tconst diff = v - Math.min(r, g, b);\n\tconst diffc = function (c) {\n\t\treturn (v - c) / 6 / diff + 1 / 2;\n\t};\n\n\tif (diff === 0) {\n\t\th = 0;\n\t\ts = 0;\n\t} else {\n\t\ts = diff / v;\n\t\trdif = diffc(r);\n\t\tgdif = diffc(g);\n\t\tbdif = diffc(b);\n\n\t\tif (r === v) {\n\t\t\th = bdif - gdif;\n\t\t} else if (g === v) {\n\t\t\th = (1 / 3) + rdif - bdif;\n\t\t} else if (b === v) {\n\t\t\th = (2 / 3) + gdif - rdif;\n\t\t}\n\n\t\tif (h < 0) {\n\t\t\th += 1;\n\t\t} else if (h > 1) {\n\t\t\th -= 1;\n\t\t}\n\t}\n\n\treturn [\n\t\th * 360,\n\t\ts * 100,\n\t\tv * 100\n\t];\n};\n\nconvert.rgb.hwb = function (rgb) {\n\tconst r = rgb[0];\n\tconst g = rgb[1];\n\tlet b = rgb[2];\n\tconst h = convert.rgb.hsl(rgb)[0];\n\tconst w = 1 / 255 * Math.min(r, Math.min(g, b));\n\n\tb = 1 - 1 / 255 * Math.max(r, Math.max(g, b));\n\n\treturn [h, w * 100, b * 100];\n};\n\nconvert.rgb.cmyk = function (rgb) {\n\tconst r = rgb[0] / 255;\n\tconst g = rgb[1] / 255;\n\tconst b = rgb[2] / 255;\n\n\tconst k = Math.min(1 - r, 1 - g, 1 - b);\n\tconst c = (1 - r - k) / (1 - k) || 0;\n\tconst m = (1 - g - k) / (1 - k) || 0;\n\tconst y = (1 - b - k) / (1 - k) || 0;\n\n\treturn [c * 100, m * 100, y * 100, k * 100];\n};\n\nfunction comparativeDistance(x, y) {\n\t/*\n\t\tSee https://en.m.wikipedia.org/wiki/Euclidean_distance#Squared_Euclidean_distance\n\t*/\n\treturn (\n\t\t((x[0] - y[0]) ** 2) +\n\t\t((x[1] - y[1]) ** 2) +\n\t\t((x[2] - y[2]) ** 2)\n\t);\n}\n\nconvert.rgb.keyword = function (rgb) {\n\tconst reversed = reverseKeywords[rgb];\n\tif (reversed) {\n\t\treturn reversed;\n\t}\n\n\tlet currentClosestDistance = Infinity;\n\tlet currentClosestKeyword;\n\n\tfor (const keyword of Object.keys(cssKeywords)) {\n\t\tconst value = cssKeywords[keyword];\n\n\t\t// Compute comparative distance\n\t\tconst distance = comparativeDistance(rgb, value);\n\n\t\t// Check if its less, if so set as closest\n\t\tif (distance < currentClosestDistance) {\n\t\t\tcurrentClosestDistance = distance;\n\t\t\tcurrentClosestKeyword = keyword;\n\t\t}\n\t}\n\n\treturn currentClosestKeyword;\n};\n\nconvert.keyword.rgb = function (keyword) {\n\treturn cssKeywords[keyword];\n};\n\nconvert.rgb.xyz = function (rgb) {\n\tlet r = rgb[0] / 255;\n\tlet g = rgb[1] / 255;\n\tlet b = rgb[2] / 255;\n\n\t// Assume sRGB\n\tr = r > 0.04045 ? (((r + 0.055) / 1.055) ** 2.4) : (r / 12.92);\n\tg = g > 0.04045 ? (((g + 0.055) / 1.055) ** 2.4) : (g / 12.92);\n\tb = b > 0.04045 ? (((b + 0.055) / 1.055) ** 2.4) : (b / 12.92);\n\n\tconst x = (r * 0.4124) + (g * 0.3576) + (b * 0.1805);\n\tconst y = (r * 0.2126) + (g * 0.7152) + (b * 0.0722);\n\tconst z = (r * 0.0193) + (g * 0.1192) + (b * 0.9505);\n\n\treturn [x * 100, y * 100, z * 100];\n};\n\nconvert.rgb.lab = function (rgb) {\n\tconst xyz = convert.rgb.xyz(rgb);\n\tlet x = xyz[0];\n\tlet y = xyz[1];\n\tlet z = xyz[2];\n\n\tx /= 95.047;\n\ty /= 100;\n\tz /= 108.883;\n\n\tx = x > 0.008856 ? (x ** (1 / 3)) : (7.787 * x) + (16 / 116);\n\ty = y > 0.008856 ? (y ** (1 / 3)) : (7.787 * y) + (16 / 116);\n\tz = z > 0.008856 ? (z ** (1 / 3)) : (7.787 * z) + (16 / 116);\n\n\tconst l = (116 * y) - 16;\n\tconst a = 500 * (x - y);\n\tconst b = 200 * (y - z);\n\n\treturn [l, a, b];\n};\n\nconvert.hsl.rgb = function (hsl) {\n\tconst h = hsl[0] / 360;\n\tconst s = hsl[1] / 100;\n\tconst l = hsl[2] / 100;\n\tlet t2;\n\tlet t3;\n\tlet val;\n\n\tif (s === 0) {\n\t\tval = l * 255;\n\t\treturn [val, val, val];\n\t}\n\n\tif (l < 0.5) {\n\t\tt2 = l * (1 + s);\n\t} else {\n\t\tt2 = l + s - l * s;\n\t}\n\n\tconst t1 = 2 * l - t2;\n\n\tconst rgb = [0, 0, 0];\n\tfor (let i = 0; i < 3; i++) {\n\t\tt3 = h + 1 / 3 * -(i - 1);\n\t\tif (t3 < 0) {\n\t\t\tt3++;\n\t\t}\n\n\t\tif (t3 > 1) {\n\t\t\tt3--;\n\t\t}\n\n\t\tif (6 * t3 < 1) {\n\t\t\tval = t1 + (t2 - t1) * 6 * t3;\n\t\t} else if (2 * t3 < 1) {\n\t\t\tval = t2;\n\t\t} else if (3 * t3 < 2) {\n\t\t\tval = t1 + (t2 - t1) * (2 / 3 - t3) * 6;\n\t\t} else {\n\t\t\tval = t1;\n\t\t}\n\n\t\trgb[i] = val * 255;\n\t}\n\n\treturn rgb;\n};\n\nconvert.hsl.hsv = function (hsl) {\n\tconst h = hsl[0];\n\tlet s = hsl[1] / 100;\n\tlet l = hsl[2] / 100;\n\tlet smin = s;\n\tconst lmin = Math.max(l, 0.01);\n\n\tl *= 2;\n\ts *= (l <= 1) ? l : 2 - l;\n\tsmin *= lmin <= 1 ? lmin : 2 - lmin;\n\tconst v = (l + s) / 2;\n\tconst sv = l === 0 ? (2 * smin) / (lmin + smin) : (2 * s) / (l + s);\n\n\treturn [h, sv * 100, v * 100];\n};\n\nconvert.hsv.rgb = function (hsv) {\n\tconst h = hsv[0] / 60;\n\tconst s = hsv[1] / 100;\n\tlet v = hsv[2] / 100;\n\tconst hi = Math.floor(h) % 6;\n\n\tconst f = h - Math.floor(h);\n\tconst p = 255 * v * (1 - s);\n\tconst q = 255 * v * (1 - (s * f));\n\tconst t = 255 * v * (1 - (s * (1 - f)));\n\tv *= 255;\n\n\tswitch (hi) {\n\t\tcase 0:\n\t\t\treturn [v, t, p];\n\t\tcase 1:\n\t\t\treturn [q, v, p];\n\t\tcase 2:\n\t\t\treturn [p, v, t];\n\t\tcase 3:\n\t\t\treturn [p, q, v];\n\t\tcase 4:\n\t\t\treturn [t, p, v];\n\t\tcase 5:\n\t\t\treturn [v, p, q];\n\t}\n};\n\nconvert.hsv.hsl = function (hsv) {\n\tconst h = hsv[0];\n\tconst s = hsv[1] / 100;\n\tconst v = hsv[2] / 100;\n\tconst vmin = Math.max(v, 0.01);\n\tlet sl;\n\tlet l;\n\n\tl = (2 - s) * v;\n\tconst lmin = (2 - s) * vmin;\n\tsl = s * vmin;\n\tsl /= (lmin <= 1) ? lmin : 2 - lmin;\n\tsl = sl || 0;\n\tl /= 2;\n\n\treturn [h, sl * 100, l * 100];\n};\n\n// http://dev.w3.org/csswg/css-color/#hwb-to-rgb\nconvert.hwb.rgb = function (hwb) {\n\tconst h = hwb[0] / 360;\n\tlet wh = hwb[1] / 100;\n\tlet bl = hwb[2] / 100;\n\tconst ratio = wh + bl;\n\tlet f;\n\n\t// Wh + bl cant be > 1\n\tif (ratio > 1) {\n\t\twh /= ratio;\n\t\tbl /= ratio;\n\t}\n\n\tconst i = Math.floor(6 * h);\n\tconst v = 1 - bl;\n\tf = 6 * h - i;\n\n\tif ((i & 0x01) !== 0) {\n\t\tf = 1 - f;\n\t}\n\n\tconst n = wh + f * (v - wh); // Linear interpolation\n\n\tlet r;\n\tlet g;\n\tlet b;\n\t/* eslint-disable max-statements-per-line,no-multi-spaces */\n\tswitch (i) {\n\t\tdefault:\n\t\tcase 6:\n\t\tcase 0: r = v; g = n; b = wh; break;\n\t\tcase 1: r = n; g = v; b = wh; break;\n\t\tcase 2: r = wh; g = v; b = n; break;\n\t\tcase 3: r = wh; g = n; b = v; break;\n\t\tcase 4: r = n; g = wh; b = v; break;\n\t\tcase 5: r = v; g = wh; b = n; break;\n\t}\n\t/* eslint-enable max-statements-per-line,no-multi-spaces */\n\n\treturn [r * 255, g * 255, b * 255];\n};\n\nconvert.cmyk.rgb = function (cmyk) {\n\tconst c = cmyk[0] / 100;\n\tconst m = cmyk[1] / 100;\n\tconst y = cmyk[2] / 100;\n\tconst k = cmyk[3] / 100;\n\n\tconst r = 1 - Math.min(1, c * (1 - k) + k);\n\tconst g = 1 - Math.min(1, m * (1 - k) + k);\n\tconst b = 1 - Math.min(1, y * (1 - k) + k);\n\n\treturn [r * 255, g * 255, b * 255];\n};\n\nconvert.xyz.rgb = function (xyz) {\n\tconst x = xyz[0] / 100;\n\tconst y = xyz[1] / 100;\n\tconst z = xyz[2] / 100;\n\tlet r;\n\tlet g;\n\tlet b;\n\n\tr = (x * 3.2406) + (y * -1.5372) + (z * -0.4986);\n\tg = (x * -0.9689) + (y * 1.8758) + (z * 0.0415);\n\tb = (x * 0.0557) + (y * -0.2040) + (z * 1.0570);\n\n\t// Assume sRGB\n\tr = r > 0.0031308\n\t\t? ((1.055 * (r ** (1.0 / 2.4))) - 0.055)\n\t\t: r * 12.92;\n\n\tg = g > 0.0031308\n\t\t? ((1.055 * (g ** (1.0 / 2.4))) - 0.055)\n\t\t: g * 12.92;\n\n\tb = b > 0.0031308\n\t\t? ((1.055 * (b ** (1.0 / 2.4))) - 0.055)\n\t\t: b * 12.92;\n\n\tr = Math.min(Math.max(0, r), 1);\n\tg = Math.min(Math.max(0, g), 1);\n\tb = Math.min(Math.max(0, b), 1);\n\n\treturn [r * 255, g * 255, b * 255];\n};\n\nconvert.xyz.lab = function (xyz) {\n\tlet x = xyz[0];\n\tlet y = xyz[1];\n\tlet z = xyz[2];\n\n\tx /= 95.047;\n\ty /= 100;\n\tz /= 108.883;\n\n\tx = x > 0.008856 ? (x ** (1 / 3)) : (7.787 * x) + (16 / 116);\n\ty = y > 0.008856 ? (y ** (1 / 3)) : (7.787 * y) + (16 / 116);\n\tz = z > 0.008856 ? (z ** (1 / 3)) : (7.787 * z) + (16 / 116);\n\n\tconst l = (116 * y) - 16;\n\tconst a = 500 * (x - y);\n\tconst b = 200 * (y - z);\n\n\treturn [l, a, b];\n};\n\nconvert.lab.xyz = function (lab) {\n\tconst l = lab[0];\n\tconst a = lab[1];\n\tconst b = lab[2];\n\tlet x;\n\tlet y;\n\tlet z;\n\n\ty = (l + 16) / 116;\n\tx = a / 500 + y;\n\tz = y - b / 200;\n\n\tconst y2 = y ** 3;\n\tconst x2 = x ** 3;\n\tconst z2 = z ** 3;\n\ty = y2 > 0.008856 ? y2 : (y - 16 / 116) / 7.787;\n\tx = x2 > 0.008856 ? x2 : (x - 16 / 116) / 7.787;\n\tz = z2 > 0.008856 ? z2 : (z - 16 / 116) / 7.787;\n\n\tx *= 95.047;\n\ty *= 100;\n\tz *= 108.883;\n\n\treturn [x, y, z];\n};\n\nconvert.lab.lch = function (lab) {\n\tconst l = lab[0];\n\tconst a = lab[1];\n\tconst b = lab[2];\n\tlet h;\n\n\tconst hr = Math.atan2(b, a);\n\th = hr * 360 / 2 / Math.PI;\n\n\tif (h < 0) {\n\t\th += 360;\n\t}\n\n\tconst c = Math.sqrt(a * a + b * b);\n\n\treturn [l, c, h];\n};\n\nconvert.lch.lab = function (lch) {\n\tconst l = lch[0];\n\tconst c = lch[1];\n\tconst h = lch[2];\n\n\tconst hr = h / 360 * 2 * Math.PI;\n\tconst a = c * Math.cos(hr);\n\tconst b = c * Math.sin(hr);\n\n\treturn [l, a, b];\n};\n\nconvert.rgb.ansi16 = function (args, saturation = null) {\n\tconst [r, g, b] = args;\n\tlet value = saturation === null ? convert.rgb.hsv(args)[2] : saturation; // Hsv -> ansi16 optimization\n\n\tvalue = Math.round(value / 50);\n\n\tif (value === 0) {\n\t\treturn 30;\n\t}\n\n\tlet ansi = 30\n\t\t+ ((Math.round(b / 255) << 2)\n\t\t| (Math.round(g / 255) << 1)\n\t\t| Math.round(r / 255));\n\n\tif (value === 2) {\n\t\tansi += 60;\n\t}\n\n\treturn ansi;\n};\n\nconvert.hsv.ansi16 = function (args) {\n\t// Optimization here; we already know the value and don't need to get\n\t// it converted for us.\n\treturn convert.rgb.ansi16(convert.hsv.rgb(args), args[2]);\n};\n\nconvert.rgb.ansi256 = function (args) {\n\tconst r = args[0];\n\tconst g = args[1];\n\tconst b = args[2];\n\n\t// We use the extended greyscale palette here, with the exception of\n\t// black and white. normal palette only has 4 greyscale shades.\n\tif (r === g && g === b) {\n\t\tif (r < 8) {\n\t\t\treturn 16;\n\t\t}\n\n\t\tif (r > 248) {\n\t\t\treturn 231;\n\t\t}\n\n\t\treturn Math.round(((r - 8) / 247) * 24) + 232;\n\t}\n\n\tconst ansi = 16\n\t\t+ (36 * Math.round(r / 255 * 5))\n\t\t+ (6 * Math.round(g / 255 * 5))\n\t\t+ Math.round(b / 255 * 5);\n\n\treturn ansi;\n};\n\nconvert.ansi16.rgb = function (args) {\n\tlet color = args % 10;\n\n\t// Handle greyscale\n\tif (color === 0 || color === 7) {\n\t\tif (args > 50) {\n\t\t\tcolor += 3.5;\n\t\t}\n\n\t\tcolor = color / 10.5 * 255;\n\n\t\treturn [color, color, color];\n\t}\n\n\tconst mult = (~~(args > 50) + 1) * 0.5;\n\tconst r = ((color & 1) * mult) * 255;\n\tconst g = (((color >> 1) & 1) * mult) * 255;\n\tconst b = (((color >> 2) & 1) * mult) * 255;\n\n\treturn [r, g, b];\n};\n\nconvert.ansi256.rgb = function (args) {\n\t// Handle greyscale\n\tif (args >= 232) {\n\t\tconst c = (args - 232) * 10 + 8;\n\t\treturn [c, c, c];\n\t}\n\n\targs -= 16;\n\n\tlet rem;\n\tconst r = Math.floor(args / 36) / 5 * 255;\n\tconst g = Math.floor((rem = args % 36) / 6) / 5 * 255;\n\tconst b = (rem % 6) / 5 * 255;\n\n\treturn [r, g, b];\n};\n\nconvert.rgb.hex = function (args) {\n\tconst integer = ((Math.round(args[0]) & 0xFF) << 16)\n\t\t+ ((Math.round(args[1]) & 0xFF) << 8)\n\t\t+ (Math.round(args[2]) & 0xFF);\n\n\tconst string = integer.toString(16).toUpperCase();\n\treturn '000000'.substring(string.length) + string;\n};\n\nconvert.hex.rgb = function (args) {\n\tconst match = args.toString(16).match(/[a-f0-9]{6}|[a-f0-9]{3}/i);\n\tif (!match) {\n\t\treturn [0, 0, 0];\n\t}\n\n\tlet colorString = match[0];\n\n\tif (match[0].length === 3) {\n\t\tcolorString = colorString.split('').map(char => {\n\t\t\treturn char + char;\n\t\t}).join('');\n\t}\n\n\tconst integer = parseInt(colorString, 16);\n\tconst r = (integer >> 16) & 0xFF;\n\tconst g = (integer >> 8) & 0xFF;\n\tconst b = integer & 0xFF;\n\n\treturn [r, g, b];\n};\n\nconvert.rgb.hcg = function (rgb) {\n\tconst r = rgb[0] / 255;\n\tconst g = rgb[1] / 255;\n\tconst b = rgb[2] / 255;\n\tconst max = Math.max(Math.max(r, g), b);\n\tconst min = Math.min(Math.min(r, g), b);\n\tconst chroma = (max - min);\n\tlet grayscale;\n\tlet hue;\n\n\tif (chroma < 1) {\n\t\tgrayscale = min / (1 - chroma);\n\t} else {\n\t\tgrayscale = 0;\n\t}\n\n\tif (chroma <= 0) {\n\t\thue = 0;\n\t} else\n\tif (max === r) {\n\t\thue = ((g - b) / chroma) % 6;\n\t} else\n\tif (max === g) {\n\t\thue = 2 + (b - r) / chroma;\n\t} else {\n\t\thue = 4 + (r - g) / chroma;\n\t}\n\n\thue /= 6;\n\thue %= 1;\n\n\treturn [hue * 360, chroma * 100, grayscale * 100];\n};\n\nconvert.hsl.hcg = function (hsl) {\n\tconst s = hsl[1] / 100;\n\tconst l = hsl[2] / 100;\n\n\tconst c = l < 0.5 ? (2.0 * s * l) : (2.0 * s * (1.0 - l));\n\n\tlet f = 0;\n\tif (c < 1.0) {\n\t\tf = (l - 0.5 * c) / (1.0 - c);\n\t}\n\n\treturn [hsl[0], c * 100, f * 100];\n};\n\nconvert.hsv.hcg = function (hsv) {\n\tconst s = hsv[1] / 100;\n\tconst v = hsv[2] / 100;\n\n\tconst c = s * v;\n\tlet f = 0;\n\n\tif (c < 1.0) {\n\t\tf = (v - c) / (1 - c);\n\t}\n\n\treturn [hsv[0], c * 100, f * 100];\n};\n\nconvert.hcg.rgb = function (hcg) {\n\tconst h = hcg[0] / 360;\n\tconst c = hcg[1] / 100;\n\tconst g = hcg[2] / 100;\n\n\tif (c === 0.0) {\n\t\treturn [g * 255, g * 255, g * 255];\n\t}\n\n\tconst pure = [0, 0, 0];\n\tconst hi = (h % 1) * 6;\n\tconst v = hi % 1;\n\tconst w = 1 - v;\n\tlet mg = 0;\n\n\t/* eslint-disable max-statements-per-line */\n\tswitch (Math.floor(hi)) {\n\t\tcase 0:\n\t\t\tpure[0] = 1; pure[1] = v; pure[2] = 0; break;\n\t\tcase 1:\n\t\t\tpure[0] = w; pure[1] = 1; pure[2] = 0; break;\n\t\tcase 2:\n\t\t\tpure[0] = 0; pure[1] = 1; pure[2] = v; break;\n\t\tcase 3:\n\t\t\tpure[0] = 0; pure[1] = w; pure[2] = 1; break;\n\t\tcase 4:\n\t\t\tpure[0] = v; pure[1] = 0; pure[2] = 1; break;\n\t\tdefault:\n\t\t\tpure[0] = 1; pure[1] = 0; pure[2] = w;\n\t}\n\t/* eslint-enable max-statements-per-line */\n\n\tmg = (1.0 - c) * g;\n\n\treturn [\n\t\t(c * pure[0] + mg) * 255,\n\t\t(c * pure[1] + mg) * 255,\n\t\t(c * pure[2] + mg) * 255\n\t];\n};\n\nconvert.hcg.hsv = function (hcg) {\n\tconst c = hcg[1] / 100;\n\tconst g = hcg[2] / 100;\n\n\tconst v = c + g * (1.0 - c);\n\tlet f = 0;\n\n\tif (v > 0.0) {\n\t\tf = c / v;\n\t}\n\n\treturn [hcg[0], f * 100, v * 100];\n};\n\nconvert.hcg.hsl = function (hcg) {\n\tconst c = hcg[1] / 100;\n\tconst g = hcg[2] / 100;\n\n\tconst l = g * (1.0 - c) + 0.5 * c;\n\tlet s = 0;\n\n\tif (l > 0.0 && l < 0.5) {\n\t\ts = c / (2 * l);\n\t} else\n\tif (l >= 0.5 && l < 1.0) {\n\t\ts = c / (2 * (1 - l));\n\t}\n\n\treturn [hcg[0], s * 100, l * 100];\n};\n\nconvert.hcg.hwb = function (hcg) {\n\tconst c = hcg[1] / 100;\n\tconst g = hcg[2] / 100;\n\tconst v = c + g * (1.0 - c);\n\treturn [hcg[0], (v - c) * 100, (1 - v) * 100];\n};\n\nconvert.hwb.hcg = function (hwb) {\n\tconst w = hwb[1] / 100;\n\tconst b = hwb[2] / 100;\n\tconst v = 1 - b;\n\tconst c = v - w;\n\tlet g = 0;\n\n\tif (c < 1) {\n\t\tg = (v - c) / (1 - c);\n\t}\n\n\treturn [hwb[0], c * 100, g * 100];\n};\n\nconvert.apple.rgb = function (apple) {\n\treturn [(apple[0] / 65535) * 255, (apple[1] / 65535) * 255, (apple[2] / 65535) * 255];\n};\n\nconvert.rgb.apple = function (rgb) {\n\treturn [(rgb[0] / 255) * 65535, (rgb[1] / 255) * 65535, (rgb[2] / 255) * 65535];\n};\n\nconvert.gray.rgb = function (args) {\n\treturn [args[0] / 100 * 255, args[0] / 100 * 255, args[0] / 100 * 255];\n};\n\nconvert.gray.hsl = function (args) {\n\treturn [0, 0, args[0]];\n};\n\nconvert.gray.hsv = convert.gray.hsl;\n\nconvert.gray.hwb = function (gray) {\n\treturn [0, 100, gray[0]];\n};\n\nconvert.gray.cmyk = function (gray) {\n\treturn [0, 0, 0, gray[0]];\n};\n\nconvert.gray.lab = function (gray) {\n\treturn [gray[0], 0, 0];\n};\n\nconvert.gray.hex = function (gray) {\n\tconst val = Math.round(gray[0] / 100 * 255) & 0xFF;\n\tconst integer = (val << 16) + (val << 8) + val;\n\n\tconst string = integer.toString(16).toUpperCase();\n\treturn '000000'.substring(string.length) + string;\n};\n\nconvert.rgb.gray = function (rgb) {\n\tconst val = (rgb[0] + rgb[1] + rgb[2]) / 3;\n\treturn [val / 255 * 100];\n};\n", "const conversions = require('./conversions');\n\n/*\n\tThis function routes a model to all other models.\n\n\tall functions that are routed have a property `.conversion` attached\n\tto the returned synthetic function. This property is an array\n\tof strings, each with the steps in between the 'from' and 'to'\n\tcolor models (inclusive).\n\n\tconversions that are not possible simply are not included.\n*/\n\nfunction buildGraph() {\n\tconst graph = {};\n\t// https://jsperf.com/object-keys-vs-for-in-with-closure/3\n\tconst models = Object.keys(conversions);\n\n\tfor (let len = models.length, i = 0; i < len; i++) {\n\t\tgraph[models[i]] = {\n\t\t\t// http://jsperf.com/1-vs-infinity\n\t\t\t// micro-opt, but this is simple.\n\t\t\tdistance: -1,\n\t\t\tparent: null\n\t\t};\n\t}\n\n\treturn graph;\n}\n\n// https://en.wikipedia.org/wiki/Breadth-first_search\nfunction deriveBFS(fromModel) {\n\tconst graph = buildGraph();\n\tconst queue = [fromModel]; // Unshift -> queue -> pop\n\n\tgraph[fromModel].distance = 0;\n\n\twhile (queue.length) {\n\t\tconst current = queue.pop();\n\t\tconst adjacents = Object.keys(conversions[current]);\n\n\t\tfor (let len = adjacents.length, i = 0; i < len; i++) {\n\t\t\tconst adjacent = adjacents[i];\n\t\t\tconst node = graph[adjacent];\n\n\t\t\tif (node.distance === -1) {\n\t\t\t\tnode.distance = graph[current].distance + 1;\n\t\t\t\tnode.parent = current;\n\t\t\t\tqueue.unshift(adjacent);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn graph;\n}\n\nfunction link(from, to) {\n\treturn function (args) {\n\t\treturn to(from(args));\n\t};\n}\n\nfunction wrapConversion(toModel, graph) {\n\tconst path = [graph[toModel].parent, toModel];\n\tlet fn = conversions[graph[toModel].parent][toModel];\n\n\tlet cur = graph[toModel].parent;\n\twhile (graph[cur].parent) {\n\t\tpath.unshift(graph[cur].parent);\n\t\tfn = link(conversions[graph[cur].parent][cur], fn);\n\t\tcur = graph[cur].parent;\n\t}\n\n\tfn.conversion = path;\n\treturn fn;\n}\n\nmodule.exports = function (fromModel) {\n\tconst graph = deriveBFS(fromModel);\n\tconst conversion = {};\n\n\tconst models = Object.keys(graph);\n\tfor (let len = models.length, i = 0; i < len; i++) {\n\t\tconst toModel = models[i];\n\t\tconst node = graph[toModel];\n\n\t\tif (node.parent === null) {\n\t\t\t// No possible conversion, or this node is the source model.\n\t\t\tcontinue;\n\t\t}\n\n\t\tconversion[toModel] = wrapConversion(toModel, graph);\n\t}\n\n\treturn conversion;\n};\n\n", "const conversions = require('./conversions');\nconst route = require('./route');\n\nconst convert = {};\n\nconst models = Object.keys(conversions);\n\nfunction wrapRaw(fn) {\n\tconst wrappedFn = function (...args) {\n\t\tconst arg0 = args[0];\n\t\tif (arg0 === undefined || arg0 === null) {\n\t\t\treturn arg0;\n\t\t}\n\n\t\tif (arg0.length > 1) {\n\t\t\targs = arg0;\n\t\t}\n\n\t\treturn fn(args);\n\t};\n\n\t// Preserve .conversion property if there is one\n\tif ('conversion' in fn) {\n\t\twrappedFn.conversion = fn.conversion;\n\t}\n\n\treturn wrappedFn;\n}\n\nfunction wrapRounded(fn) {\n\tconst wrappedFn = function (...args) {\n\t\tconst arg0 = args[0];\n\n\t\tif (arg0 === undefined || arg0 === null) {\n\t\t\treturn arg0;\n\t\t}\n\n\t\tif (arg0.length > 1) {\n\t\t\targs = arg0;\n\t\t}\n\n\t\tconst result = fn(args);\n\n\t\t// We're assuming the result is an array here.\n\t\t// see notice in conversions.js; don't use box types\n\t\t// in conversion functions.\n\t\tif (typeof result === 'object') {\n\t\t\tfor (let len = result.length, i = 0; i < len; i++) {\n\t\t\t\tresult[i] = Math.round(result[i]);\n\t\t\t}\n\t\t}\n\n\t\treturn result;\n\t};\n\n\t// Preserve .conversion property if there is one\n\tif ('conversion' in fn) {\n\t\twrappedFn.conversion = fn.conversion;\n\t}\n\n\treturn wrappedFn;\n}\n\nmodels.forEach(fromModel => {\n\tconvert[fromModel] = {};\n\n\tObject.defineProperty(convert[fromModel], 'channels', {value: conversions[fromModel].channels});\n\tObject.defineProperty(convert[fromModel], 'labels', {value: conversions[fromModel].labels});\n\n\tconst routes = route(fromModel);\n\tconst routeModels = Object.keys(routes);\n\n\trouteModels.forEach(toModel => {\n\t\tconst fn = routes[toModel];\n\n\t\tconvert[fromModel][toModel] = wrapRounded(fn);\n\t\tconvert[fromModel][toModel].raw = wrapRaw(fn);\n\t});\n});\n\nmodule.exports = convert;\n", "const colorString = require('color-string');\nconst convert = require('color-convert');\n\nconst skippedModels = [\n\t// To be honest, I don't really feel like keyword belongs in color convert, but eh.\n\t'keyword',\n\n\t// Gray conflicts with some method names, and has its own method defined.\n\t'gray',\n\n\t// Shouldn't really be in color-convert either...\n\t'hex',\n];\n\nconst hashedModelKeys = {};\nfor (const model of Object.keys(convert)) {\n\thashedModelKeys[[...convert[model].labels].sort().join('')] = model;\n}\n\nconst limiters = {};\n\nfunction Color(object, model) {\n\tif (!(this instanceof Color)) {\n\t\treturn new Color(object, model);\n\t}\n\n\tif (model && model in skippedModels) {\n\t\tmodel = null;\n\t}\n\n\tif (model && !(model in convert)) {\n\t\tthrow new Error('Unknown model: ' + model);\n\t}\n\n\tlet i;\n\tlet channels;\n\n\tif (object == null) { // eslint-disable-line no-eq-null,eqeqeq\n\t\tthis.model = 'rgb';\n\t\tthis.color = [0, 0, 0];\n\t\tthis.valpha = 1;\n\t} else if (object instanceof Color) {\n\t\tthis.model = object.model;\n\t\tthis.color = [...object.color];\n\t\tthis.valpha = object.valpha;\n\t} else if (typeof object === 'string') {\n\t\tconst result = colorString.get(object);\n\t\tif (result === null) {\n\t\t\tthrow new Error('Unable to parse color from string: ' + object);\n\t\t}\n\n\t\tthis.model = result.model;\n\t\tchannels = convert[this.model].channels;\n\t\tthis.color = result.value.slice(0, channels);\n\t\tthis.valpha = typeof result.value[channels] === 'number' ? result.value[channels] : 1;\n\t} else if (object.length > 0) {\n\t\tthis.model = model || 'rgb';\n\t\tchannels = convert[this.model].channels;\n\t\tconst newArray = Array.prototype.slice.call(object, 0, channels);\n\t\tthis.color = zeroArray(newArray, channels);\n\t\tthis.valpha = typeof object[channels] === 'number' ? object[channels] : 1;\n\t} else if (typeof object === 'number') {\n\t\t// This is always RGB - can be converted later on.\n\t\tthis.model = 'rgb';\n\t\tthis.color = [\n\t\t\t(object >> 16) & 0xFF,\n\t\t\t(object >> 8) & 0xFF,\n\t\t\tobject & 0xFF,\n\t\t];\n\t\tthis.valpha = 1;\n\t} else {\n\t\tthis.valpha = 1;\n\n\t\tconst keys = Object.keys(object);\n\t\tif ('alpha' in object) {\n\t\t\tkeys.splice(keys.indexOf('alpha'), 1);\n\t\t\tthis.valpha = typeof object.alpha === 'number' ? object.alpha : 0;\n\t\t}\n\n\t\tconst hashedKeys = keys.sort().join('');\n\t\tif (!(hashedKeys in hashedModelKeys)) {\n\t\t\tthrow new Error('Unable to parse color from object: ' + JSON.stringify(object));\n\t\t}\n\n\t\tthis.model = hashedModelKeys[hashedKeys];\n\n\t\tconst {labels} = convert[this.model];\n\t\tconst color = [];\n\t\tfor (i = 0; i < labels.length; i++) {\n\t\t\tcolor.push(object[labels[i]]);\n\t\t}\n\n\t\tthis.color = zeroArray(color);\n\t}\n\n\t// Perform limitations (clamping, etc.)\n\tif (limiters[this.model]) {\n\t\tchannels = convert[this.model].channels;\n\t\tfor (i = 0; i < channels; i++) {\n\t\t\tconst limit = limiters[this.model][i];\n\t\t\tif (limit) {\n\t\t\t\tthis.color[i] = limit(this.color[i]);\n\t\t\t}\n\t\t}\n\t}\n\n\tthis.valpha = Math.max(0, Math.min(1, this.valpha));\n\n\tif (Object.freeze) {\n\t\tObject.freeze(this);\n\t}\n}\n\nColor.prototype = {\n\ttoString() {\n\t\treturn this.string();\n\t},\n\n\ttoJSON() {\n\t\treturn this[this.model]();\n\t},\n\n\tstring(places) {\n\t\tlet self = this.model in colorString.to ? this : this.rgb();\n\t\tself = self.round(typeof places === 'number' ? places : 1);\n\t\tconst args = self.valpha === 1 ? self.color : [...self.color, this.valpha];\n\t\treturn colorString.to[self.model](args);\n\t},\n\n\tpercentString(places) {\n\t\tconst self = this.rgb().round(typeof places === 'number' ? places : 1);\n\t\tconst args = self.valpha === 1 ? self.color : [...self.color, this.valpha];\n\t\treturn colorString.to.rgb.percent(args);\n\t},\n\n\tarray() {\n\t\treturn this.valpha === 1 ? [...this.color] : [...this.color, this.valpha];\n\t},\n\n\tobject() {\n\t\tconst result = {};\n\t\tconst {channels} = convert[this.model];\n\t\tconst {labels} = convert[this.model];\n\n\t\tfor (let i = 0; i < channels; i++) {\n\t\t\tresult[labels[i]] = this.color[i];\n\t\t}\n\n\t\tif (this.valpha !== 1) {\n\t\t\tresult.alpha = this.valpha;\n\t\t}\n\n\t\treturn result;\n\t},\n\n\tunitArray() {\n\t\tconst rgb = this.rgb().color;\n\t\trgb[0] /= 255;\n\t\trgb[1] /= 255;\n\t\trgb[2] /= 255;\n\n\t\tif (this.valpha !== 1) {\n\t\t\trgb.push(this.valpha);\n\t\t}\n\n\t\treturn rgb;\n\t},\n\n\tunitObject() {\n\t\tconst rgb = this.rgb().object();\n\t\trgb.r /= 255;\n\t\trgb.g /= 255;\n\t\trgb.b /= 255;\n\n\t\tif (this.valpha !== 1) {\n\t\t\trgb.alpha = this.valpha;\n\t\t}\n\n\t\treturn rgb;\n\t},\n\n\tround(places) {\n\t\tplaces = Math.max(places || 0, 0);\n\t\treturn new Color([...this.color.map(roundToPlace(places)), this.valpha], this.model);\n\t},\n\n\talpha(value) {\n\t\tif (value !== undefined) {\n\t\t\treturn new Color([...this.color, Math.max(0, Math.min(1, value))], this.model);\n\t\t}\n\n\t\treturn this.valpha;\n\t},\n\n\t// Rgb\n\tred: getset('rgb', 0, maxfn(255)),\n\tgreen: getset('rgb', 1, maxfn(255)),\n\tblue: getset('rgb', 2, maxfn(255)),\n\n\thue: getset(['hsl', 'hsv', 'hsl', 'hwb', 'hcg'], 0, value => ((value % 360) + 360) % 360),\n\n\tsaturationl: getset('hsl', 1, maxfn(100)),\n\tlightness: getset('hsl', 2, maxfn(100)),\n\n\tsaturationv: getset('hsv', 1, maxfn(100)),\n\tvalue: getset('hsv', 2, maxfn(100)),\n\n\tchroma: getset('hcg', 1, maxfn(100)),\n\tgray: getset('hcg', 2, maxfn(100)),\n\n\twhite: getset('hwb', 1, maxfn(100)),\n\twblack: getset('hwb', 2, maxfn(100)),\n\n\tcyan: getset('cmyk', 0, maxfn(100)),\n\tmagenta: getset('cmyk', 1, maxfn(100)),\n\tyellow: getset('cmyk', 2, maxfn(100)),\n\tblack: getset('cmyk', 3, maxfn(100)),\n\n\tx: getset('xyz', 0, maxfn(95.047)),\n\ty: getset('xyz', 1, maxfn(100)),\n\tz: getset('xyz', 2, maxfn(108.833)),\n\n\tl: getset('lab', 0, maxfn(100)),\n\ta: getset('lab', 1),\n\tb: getset('lab', 2),\n\n\tkeyword(value) {\n\t\tif (value !== undefined) {\n\t\t\treturn new Color(value);\n\t\t}\n\n\t\treturn convert[this.model].keyword(this.color);\n\t},\n\n\thex(value) {\n\t\tif (value !== undefined) {\n\t\t\treturn new Color(value);\n\t\t}\n\n\t\treturn colorString.to.hex(this.rgb().round().color);\n\t},\n\n\thexa(value) {\n\t\tif (value !== undefined) {\n\t\t\treturn new Color(value);\n\t\t}\n\n\t\tconst rgbArray = this.rgb().round().color;\n\n\t\tlet alphaHex = Math.round(this.valpha * 255).toString(16).toUpperCase();\n\t\tif (alphaHex.length === 1) {\n\t\t\talphaHex = '0' + alphaHex;\n\t\t}\n\n\t\treturn colorString.to.hex(rgbArray) + alphaHex;\n\t},\n\n\trgbNumber() {\n\t\tconst rgb = this.rgb().color;\n\t\treturn ((rgb[0] & 0xFF) << 16) | ((rgb[1] & 0xFF) << 8) | (rgb[2] & 0xFF);\n\t},\n\n\tluminosity() {\n\t\t// http://www.w3.org/TR/WCAG20/#relativeluminancedef\n\t\tconst rgb = this.rgb().color;\n\n\t\tconst lum = [];\n\t\tfor (const [i, element] of rgb.entries()) {\n\t\t\tconst chan = element / 255;\n\t\t\tlum[i] = (chan <= 0.04045) ? chan / 12.92 : ((chan + 0.055) / 1.055) ** 2.4;\n\t\t}\n\n\t\treturn 0.2126 * lum[0] + 0.7152 * lum[1] + 0.0722 * lum[2];\n\t},\n\n\tcontrast(color2) {\n\t\t// http://www.w3.org/TR/WCAG20/#contrast-ratiodef\n\t\tconst lum1 = this.luminosity();\n\t\tconst lum2 = color2.luminosity();\n\n\t\tif (lum1 > lum2) {\n\t\t\treturn (lum1 + 0.05) / (lum2 + 0.05);\n\t\t}\n\n\t\treturn (lum2 + 0.05) / (lum1 + 0.05);\n\t},\n\n\tlevel(color2) {\n\t\t// https://www.w3.org/TR/WCAG/#contrast-enhanced\n\t\tconst contrastRatio = this.contrast(color2);\n\t\tif (contrastRatio >= 7) {\n\t\t\treturn 'AAA';\n\t\t}\n\n\t\treturn (contrastRatio >= 4.5) ? 'AA' : '';\n\t},\n\n\tisDark() {\n\t\t// YIQ equation from http://24ways.org/2010/calculating-color-contrast\n\t\tconst rgb = this.rgb().color;\n\t\tconst yiq = (rgb[0] * 2126 + rgb[1] * 7152 + rgb[2] * 722) / 10000;\n\t\treturn yiq < 128;\n\t},\n\n\tisLight() {\n\t\treturn !this.isDark();\n\t},\n\n\tnegate() {\n\t\tconst rgb = this.rgb();\n\t\tfor (let i = 0; i < 3; i++) {\n\t\t\trgb.color[i] = 255 - rgb.color[i];\n\t\t}\n\n\t\treturn rgb;\n\t},\n\n\tlighten(ratio) {\n\t\tconst hsl = this.hsl();\n\t\thsl.color[2] += hsl.color[2] * ratio;\n\t\treturn hsl;\n\t},\n\n\tdarken(ratio) {\n\t\tconst hsl = this.hsl();\n\t\thsl.color[2] -= hsl.color[2] * ratio;\n\t\treturn hsl;\n\t},\n\n\tsaturate(ratio) {\n\t\tconst hsl = this.hsl();\n\t\thsl.color[1] += hsl.color[1] * ratio;\n\t\treturn hsl;\n\t},\n\n\tdesaturate(ratio) {\n\t\tconst hsl = this.hsl();\n\t\thsl.color[1] -= hsl.color[1] * ratio;\n\t\treturn hsl;\n\t},\n\n\twhiten(ratio) {\n\t\tconst hwb = this.hwb();\n\t\thwb.color[1] += hwb.color[1] * ratio;\n\t\treturn hwb;\n\t},\n\n\tblacken(ratio) {\n\t\tconst hwb = this.hwb();\n\t\thwb.color[2] += hwb.color[2] * ratio;\n\t\treturn hwb;\n\t},\n\n\tgrayscale() {\n\t\t// http://en.wikipedia.org/wiki/Grayscale#Converting_color_to_grayscale\n\t\tconst rgb = this.rgb().color;\n\t\tconst value = rgb[0] * 0.3 + rgb[1] * 0.59 + rgb[2] * 0.11;\n\t\treturn Color.rgb(value, value, value);\n\t},\n\n\tfade(ratio) {\n\t\treturn this.alpha(this.valpha - (this.valpha * ratio));\n\t},\n\n\topaquer(ratio) {\n\t\treturn this.alpha(this.valpha + (this.valpha * ratio));\n\t},\n\n\trotate(degrees) {\n\t\tconst hsl = this.hsl();\n\t\tlet hue = hsl.color[0];\n\t\thue = (hue + degrees) % 360;\n\t\thue = hue < 0 ? 360 + hue : hue;\n\t\thsl.color[0] = hue;\n\t\treturn hsl;\n\t},\n\n\tmix(mixinColor, weight) {\n\t\t// Ported from sass implementation in C\n\t\t// https://github.com/sass/libsass/blob/0e6b4a2850092356aa3ece07c6b249f0221caced/functions.cpp#L209\n\t\tif (!mixinColor || !mixinColor.rgb) {\n\t\t\tthrow new Error('Argument to \"mix\" was not a Color instance, but rather an instance of ' + typeof mixinColor);\n\t\t}\n\n\t\tconst color1 = mixinColor.rgb();\n\t\tconst color2 = this.rgb();\n\t\tconst p = weight === undefined ? 0.5 : weight;\n\n\t\tconst w = 2 * p - 1;\n\t\tconst a = color1.alpha() - color2.alpha();\n\n\t\tconst w1 = (((w * a === -1) ? w : (w + a) / (1 + w * a)) + 1) / 2;\n\t\tconst w2 = 1 - w1;\n\n\t\treturn Color.rgb(\n\t\t\tw1 * color1.red() + w2 * color2.red(),\n\t\t\tw1 * color1.green() + w2 * color2.green(),\n\t\t\tw1 * color1.blue() + w2 * color2.blue(),\n\t\t\tcolor1.alpha() * p + color2.alpha() * (1 - p));\n\t},\n};\n\n// Model conversion methods and static constructors\nfor (const model of Object.keys(convert)) {\n\tif (skippedModels.includes(model)) {\n\t\tcontinue;\n\t}\n\n\tconst {channels} = convert[model];\n\n\t// Conversion methods\n\tColor.prototype[model] = function (...args) {\n\t\tif (this.model === model) {\n\t\t\treturn new Color(this);\n\t\t}\n\n\t\tif (args.length > 0) {\n\t\t\treturn new Color(args, model);\n\t\t}\n\n\t\treturn new Color([...assertArray(convert[this.model][model].raw(this.color)), this.valpha], model);\n\t};\n\n\t// 'static' construction methods\n\tColor[model] = function (...args) {\n\t\tlet color = args[0];\n\t\tif (typeof color === 'number') {\n\t\t\tcolor = zeroArray(args, channels);\n\t\t}\n\n\t\treturn new Color(color, model);\n\t};\n}\n\nfunction roundTo(number, places) {\n\treturn Number(number.toFixed(places));\n}\n\nfunction roundToPlace(places) {\n\treturn function (number) {\n\t\treturn roundTo(number, places);\n\t};\n}\n\nfunction getset(model, channel, modifier) {\n\tmodel = Array.isArray(model) ? model : [model];\n\n\tfor (const m of model) {\n\t\t(limiters[m] || (limiters[m] = []))[channel] = modifier;\n\t}\n\n\tmodel = model[0];\n\n\treturn function (value) {\n\t\tlet result;\n\n\t\tif (value !== undefined) {\n\t\t\tif (modifier) {\n\t\t\t\tvalue = modifier(value);\n\t\t\t}\n\n\t\t\tresult = this[model]();\n\t\t\tresult.color[channel] = value;\n\t\t\treturn result;\n\t\t}\n\n\t\tresult = this[model]().color[channel];\n\t\tif (modifier) {\n\t\t\tresult = modifier(result);\n\t\t}\n\n\t\treturn result;\n\t};\n}\n\nfunction maxfn(max) {\n\treturn function (v) {\n\t\treturn Math.max(0, Math.min(max, v));\n\t};\n}\n\nfunction assertArray(value) {\n\treturn Array.isArray(value) ? value : [value];\n}\n\nfunction zeroArray(array, length) {\n\tfor (let i = 0; i < length; i++) {\n\t\tif (typeof array[i] !== 'number') {\n\t\t\tarray[i] = 0;\n\t\t}\n\t}\n\n\treturn array;\n}\n\nmodule.exports = Color;\n", "// FIXME profile adding a per-Tree TreeNode cache, validating it by\n// parent pointer\n/// The default maximum length of a `TreeBuffer` node.\nconst DefaultBufferLength = 1024;\nlet nextPropID = 0;\nclass Range {\n constructor(from, to) {\n this.from = from;\n this.to = to;\n }\n}\n/// Each [node type](#common.NodeType) or [individual tree](#common.Tree)\n/// can have metadata associated with it in props. Instances of this\n/// class represent prop names.\nclass NodeProp {\n /// Create a new node prop type.\n constructor(config = {}) {\n this.id = nextPropID++;\n this.perNode = !!config.perNode;\n this.deserialize = config.deserialize || (() => {\n throw new Error(\"This node type doesn't define a deserialize function\");\n });\n }\n /// This is meant to be used with\n /// [`NodeSet.extend`](#common.NodeSet.extend) or\n /// [`LRParser.configure`](#lr.ParserConfig.props) to compute\n /// prop values for each node type in the set. Takes a [match\n /// object](#common.NodeType^match) or function that returns undefined\n /// if the node type doesn't get this prop, and the prop's value if\n /// it does.\n add(match) {\n if (this.perNode)\n throw new RangeError(\"Can't add per-node props to node types\");\n if (typeof match != \"function\")\n match = NodeType.match(match);\n return (type) => {\n let result = match(type);\n return result === undefined ? null : [this, result];\n };\n }\n}\n/// Prop that is used to describe matching delimiters. For opening\n/// delimiters, this holds an array of node names (written as a\n/// space-separated string when declaring this prop in a grammar)\n/// for the node types of closing delimiters that match it.\nNodeProp.closedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/// The inverse of [`closedBy`](#common.NodeProp^closedBy). This is\n/// attached to closing delimiters, holding an array of node names\n/// of types of matching opening delimiters.\nNodeProp.openedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/// Used to assign node types to groups (for example, all node\n/// types that represent an expression could be tagged with an\n/// `\"Expression\"` group).\nNodeProp.group = new NodeProp({ deserialize: str => str.split(\" \") });\n/// The hash of the [context](#lr.ContextTracker.constructor)\n/// that the node was parsed in, if any. Used to limit reuse of\n/// contextual nodes.\nNodeProp.contextHash = new NodeProp({ perNode: true });\n/// The distance beyond the end of the node that the tokenizer\n/// looked ahead for any of the tokens inside the node. (The LR\n/// parser only stores this when it is larger than 25, for\n/// efficiency reasons.)\nNodeProp.lookAhead = new NodeProp({ perNode: true });\n/// This per-node prop is used to replace a given node, or part of a\n/// node, with another tree. This is useful to include trees from\n/// different languages in mixed-language parsers.\nNodeProp.mounted = new NodeProp({ perNode: true });\n/// A mounted tree, which can be [stored](#common.NodeProp^mounted) on\n/// a tree node to indicate that parts of its content are\n/// represented by another tree.\nclass MountedTree {\n constructor(\n /// The inner tree.\n tree, \n /// If this is null, this tree replaces the entire node (it will\n /// be included in the regular iteration instead of its host\n /// node). If not, only the given ranges are considered to be\n /// covered by this tree. This is used for trees that are mixed in\n /// a way that isn't strictly hierarchical. Such mounted trees are\n /// only entered by [`resolveInner`](#common.Tree.resolveInner)\n /// and [`enter`](#common.SyntaxNode.enter).\n overlay, \n /// The parser used to create this subtree.\n parser) {\n this.tree = tree;\n this.overlay = overlay;\n this.parser = parser;\n }\n}\nconst noProps = Object.create(null);\n/// Each node in a syntax tree has a node type associated with it.\nclass NodeType {\n /// @internal\n constructor(\n /// The name of the node type. Not necessarily unique, but if the\n /// grammar was written properly, different node types with the\n /// same name within a node set should play the same semantic\n /// role.\n name, \n /// @internal\n props, \n /// The id of this node in its set. Corresponds to the term ids\n /// used in the parser.\n id, \n /// @internal\n flags = 0) {\n this.name = name;\n this.props = props;\n this.id = id;\n this.flags = flags;\n }\n /// Define a node type.\n static define(spec) {\n let props = spec.props && spec.props.length ? Object.create(null) : noProps;\n let flags = (spec.top ? 1 /* NodeFlag.Top */ : 0) | (spec.skipped ? 2 /* NodeFlag.Skipped */ : 0) |\n (spec.error ? 4 /* NodeFlag.Error */ : 0) | (spec.name == null ? 8 /* NodeFlag.Anonymous */ : 0);\n let type = new NodeType(spec.name || \"\", props, spec.id, flags);\n if (spec.props)\n for (let src of spec.props) {\n if (!Array.isArray(src))\n src = src(type);\n if (src) {\n if (src[0].perNode)\n throw new RangeError(\"Can't store a per-node prop on a node type\");\n props[src[0].id] = src[1];\n }\n }\n return type;\n }\n /// Retrieves a node prop for this type. Will return `undefined` if\n /// the prop isn't present on this node.\n prop(prop) { return this.props[prop.id]; }\n /// True when this is the top node of a grammar.\n get isTop() { return (this.flags & 1 /* NodeFlag.Top */) > 0; }\n /// True when this node is produced by a skip rule.\n get isSkipped() { return (this.flags & 2 /* NodeFlag.Skipped */) > 0; }\n /// Indicates whether this is an error node.\n get isError() { return (this.flags & 4 /* NodeFlag.Error */) > 0; }\n /// When true, this node type doesn't correspond to a user-declared\n /// named node, for example because it is used to cache repetition.\n get isAnonymous() { return (this.flags & 8 /* NodeFlag.Anonymous */) > 0; }\n /// Returns true when this node's name or one of its\n /// [groups](#common.NodeProp^group) matches the given string.\n is(name) {\n if (typeof name == 'string') {\n if (this.name == name)\n return true;\n let group = this.prop(NodeProp.group);\n return group ? group.indexOf(name) > -1 : false;\n }\n return this.id == name;\n }\n /// Create a function from node types to arbitrary values by\n /// specifying an object whose property names are node or\n /// [group](#common.NodeProp^group) names. Often useful with\n /// [`NodeProp.add`](#common.NodeProp.add). You can put multiple\n /// names, separated by spaces, in a single property name to map\n /// multiple node names to a single value.\n static match(map) {\n let direct = Object.create(null);\n for (let prop in map)\n for (let name of prop.split(\" \"))\n direct[name] = map[prop];\n return (node) => {\n for (let groups = node.prop(NodeProp.group), i = -1; i < (groups ? groups.length : 0); i++) {\n let found = direct[i < 0 ? node.name : groups[i]];\n if (found)\n return found;\n }\n };\n }\n}\n/// An empty dummy node type to use when no actual type is available.\nNodeType.none = new NodeType(\"\", Object.create(null), 0, 8 /* NodeFlag.Anonymous */);\n/// A node set holds a collection of node types. It is used to\n/// compactly represent trees by storing their type ids, rather than a\n/// full pointer to the type object, in a numeric array. Each parser\n/// [has](#lr.LRParser.nodeSet) a node set, and [tree\n/// buffers](#common.TreeBuffer) can only store collections of nodes\n/// from the same set. A set can have a maximum of 2**16 (65536) node\n/// types in it, so that the ids fit into 16-bit typed array slots.\nclass NodeSet {\n /// Create a set with the given types. The `id` property of each\n /// type should correspond to its position within the array.\n constructor(\n /// The node types in this set, by id.\n types) {\n this.types = types;\n for (let i = 0; i < types.length; i++)\n if (types[i].id != i)\n throw new RangeError(\"Node type ids should correspond to array positions when creating a node set\");\n }\n /// Create a copy of this set with some node properties added. The\n /// arguments to this method can be created with\n /// [`NodeProp.add`](#common.NodeProp.add).\n extend(...props) {\n let newTypes = [];\n for (let type of this.types) {\n let newProps = null;\n for (let source of props) {\n let add = source(type);\n if (add) {\n if (!newProps)\n newProps = Object.assign({}, type.props);\n newProps[add[0].id] = add[1];\n }\n }\n newTypes.push(newProps ? new NodeType(type.name, newProps, type.id, type.flags) : type);\n }\n return new NodeSet(newTypes);\n }\n}\nconst CachedNode = new WeakMap(), CachedInnerNode = new WeakMap();\n/// Options that control iteration. Can be combined with the `|`\n/// operator to enable multiple ones.\nvar IterMode;\n(function (IterMode) {\n /// When enabled, iteration will only visit [`Tree`](#common.Tree)\n /// objects, not nodes packed into\n /// [`TreeBuffer`](#common.TreeBuffer)s.\n IterMode[IterMode[\"ExcludeBuffers\"] = 1] = \"ExcludeBuffers\";\n /// Enable this to make iteration include anonymous nodes (such as\n /// the nodes that wrap repeated grammar constructs into a balanced\n /// tree).\n IterMode[IterMode[\"IncludeAnonymous\"] = 2] = \"IncludeAnonymous\";\n /// By default, regular [mounted](#common.NodeProp^mounted) nodes\n /// replace their base node in iteration. Enable this to ignore them\n /// instead.\n IterMode[IterMode[\"IgnoreMounts\"] = 4] = \"IgnoreMounts\";\n /// This option only applies in\n /// [`enter`](#common.SyntaxNode.enter)-style methods. It tells the\n /// library to not enter mounted overlays if one covers the given\n /// position.\n IterMode[IterMode[\"IgnoreOverlays\"] = 8] = \"IgnoreOverlays\";\n})(IterMode || (IterMode = {}));\n/// A piece of syntax tree. There are two ways to approach these\n/// trees: the way they are actually stored in memory, and the\n/// convenient way.\n///\n/// Syntax trees are stored as a tree of `Tree` and `TreeBuffer`\n/// objects. By packing detail information into `TreeBuffer` leaf\n/// nodes, the representation is made a lot more memory-efficient.\n///\n/// However, when you want to actually work with tree nodes, this\n/// representation is very awkward, so most client code will want to\n/// use the [`TreeCursor`](#common.TreeCursor) or\n/// [`SyntaxNode`](#common.SyntaxNode) interface instead, which provides\n/// a view on some part of this data structure, and can be used to\n/// move around to adjacent nodes.\nclass Tree {\n /// Construct a new tree. See also [`Tree.build`](#common.Tree^build).\n constructor(\n /// The type of the top node.\n type, \n /// This node's child nodes.\n children, \n /// The positions (offsets relative to the start of this tree) of\n /// the children.\n positions, \n /// The total length of this tree\n length, \n /// Per-node [node props](#common.NodeProp) to associate with this node.\n props) {\n this.type = type;\n this.children = children;\n this.positions = positions;\n this.length = length;\n /// @internal\n this.props = null;\n if (props && props.length) {\n this.props = Object.create(null);\n for (let [prop, value] of props)\n this.props[typeof prop == \"number\" ? prop : prop.id] = value;\n }\n }\n /// @internal\n toString() {\n let mounted = this.prop(NodeProp.mounted);\n if (mounted && !mounted.overlay)\n return mounted.tree.toString();\n let children = \"\";\n for (let ch of this.children) {\n let str = ch.toString();\n if (str) {\n if (children)\n children += \",\";\n children += str;\n }\n }\n return !this.type.name ? children :\n (/\\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) +\n (children.length ? \"(\" + children + \")\" : \"\");\n }\n /// Get a [tree cursor](#common.TreeCursor) positioned at the top of\n /// the tree. Mode can be used to [control](#common.IterMode) which\n /// nodes the cursor visits.\n cursor(mode = 0) {\n return new TreeCursor(this.topNode, mode);\n }\n /// Get a [tree cursor](#common.TreeCursor) pointing into this tree\n /// at the given position and side (see\n /// [`moveTo`](#common.TreeCursor.moveTo).\n cursorAt(pos, side = 0, mode = 0) {\n let scope = CachedNode.get(this) || this.topNode;\n let cursor = new TreeCursor(scope);\n cursor.moveTo(pos, side);\n CachedNode.set(this, cursor._tree);\n return cursor;\n }\n /// Get a [syntax node](#common.SyntaxNode) object for the top of the\n /// tree.\n get topNode() {\n return new TreeNode(this, 0, 0, null);\n }\n /// Get the [syntax node](#common.SyntaxNode) at the given position.\n /// If `side` is -1, this will move into nodes that end at the\n /// position. If 1, it'll move into nodes that start at the\n /// position. With 0, it'll only enter nodes that cover the position\n /// from both sides.\n ///\n /// Note that this will not enter\n /// [overlays](#common.MountedTree.overlay), and you often want\n /// [`resolveInner`](#common.Tree.resolveInner) instead.\n resolve(pos, side = 0) {\n let node = resolveNode(CachedNode.get(this) || this.topNode, pos, side, false);\n CachedNode.set(this, node);\n return node;\n }\n /// Like [`resolve`](#common.Tree.resolve), but will enter\n /// [overlaid](#common.MountedTree.overlay) nodes, producing a syntax node\n /// pointing into the innermost overlaid tree at the given position\n /// (with parent links going through all parent structure, including\n /// the host trees).\n resolveInner(pos, side = 0) {\n let node = resolveNode(CachedInnerNode.get(this) || this.topNode, pos, side, true);\n CachedInnerNode.set(this, node);\n return node;\n }\n /// Iterate over the tree and its children, calling `enter` for any\n /// node that touches the `from`/`to` region (if given) before\n /// running over such a node's children, and `leave` (if given) when\n /// leaving the node. When `enter` returns `false`, that node will\n /// not have its children iterated over (or `leave` called).\n iterate(spec) {\n let { enter, leave, from = 0, to = this.length } = spec;\n let mode = spec.mode || 0, anon = (mode & IterMode.IncludeAnonymous) > 0;\n for (let c = this.cursor(mode | IterMode.IncludeAnonymous);;) {\n let entered = false;\n if (c.from <= to && c.to >= from && (!anon && c.type.isAnonymous || enter(c) !== false)) {\n if (c.firstChild())\n continue;\n entered = true;\n }\n for (;;) {\n if (entered && leave && (anon || !c.type.isAnonymous))\n leave(c);\n if (c.nextSibling())\n break;\n if (!c.parent())\n return;\n entered = true;\n }\n }\n }\n /// Get the value of the given [node prop](#common.NodeProp) for this\n /// node. Works with both per-node and per-type props.\n prop(prop) {\n return !prop.perNode ? this.type.prop(prop) : this.props ? this.props[prop.id] : undefined;\n }\n /// Returns the node's [per-node props](#common.NodeProp.perNode) in a\n /// format that can be passed to the [`Tree`](#common.Tree)\n /// constructor.\n get propValues() {\n let result = [];\n if (this.props)\n for (let id in this.props)\n result.push([+id, this.props[id]]);\n return result;\n }\n /// Balance the direct children of this tree, producing a copy of\n /// which may have children grouped into subtrees with type\n /// [`NodeType.none`](#common.NodeType^none).\n balance(config = {}) {\n return this.children.length <= 8 /* Balance.BranchFactor */ ? this :\n balanceRange(NodeType.none, this.children, this.positions, 0, this.children.length, 0, this.length, (children, positions, length) => new Tree(this.type, children, positions, length, this.propValues), config.makeTree || ((children, positions, length) => new Tree(NodeType.none, children, positions, length)));\n }\n /// Build a tree from a postfix-ordered buffer of node information,\n /// or a cursor over such a buffer.\n static build(data) { return buildTree(data); }\n}\n/// The empty tree\nTree.empty = new Tree(NodeType.none, [], [], 0);\nclass FlatBufferCursor {\n constructor(buffer, index) {\n this.buffer = buffer;\n this.index = index;\n }\n get id() { return this.buffer[this.index - 4]; }\n get start() { return this.buffer[this.index - 3]; }\n get end() { return this.buffer[this.index - 2]; }\n get size() { return this.buffer[this.index - 1]; }\n get pos() { return this.index; }\n next() { this.index -= 4; }\n fork() { return new FlatBufferCursor(this.buffer, this.index); }\n}\n/// Tree buffers contain (type, start, end, endIndex) quads for each\n/// node. In such a buffer, nodes are stored in prefix order (parents\n/// before children, with the endIndex of the parent indicating which\n/// children belong to it).\nclass TreeBuffer {\n /// Create a tree buffer.\n constructor(\n /// The buffer's content.\n buffer, \n /// The total length of the group of nodes in the buffer.\n length, \n /// The node set used in this buffer.\n set) {\n this.buffer = buffer;\n this.length = length;\n this.set = set;\n }\n /// @internal\n get type() { return NodeType.none; }\n /// @internal\n toString() {\n let result = [];\n for (let index = 0; index < this.buffer.length;) {\n result.push(this.childString(index));\n index = this.buffer[index + 3];\n }\n return result.join(\",\");\n }\n /// @internal\n childString(index) {\n let id = this.buffer[index], endIndex = this.buffer[index + 3];\n let type = this.set.types[id], result = type.name;\n if (/\\W/.test(result) && !type.isError)\n result = JSON.stringify(result);\n index += 4;\n if (endIndex == index)\n return result;\n let children = [];\n while (index < endIndex) {\n children.push(this.childString(index));\n index = this.buffer[index + 3];\n }\n return result + \"(\" + children.join(\",\") + \")\";\n }\n /// @internal\n findChild(startIndex, endIndex, dir, pos, side) {\n let { buffer } = this, pick = -1;\n for (let i = startIndex; i != endIndex; i = buffer[i + 3]) {\n if (checkSide(side, pos, buffer[i + 1], buffer[i + 2])) {\n pick = i;\n if (dir > 0)\n break;\n }\n }\n return pick;\n }\n /// @internal\n slice(startI, endI, from) {\n let b = this.buffer;\n let copy = new Uint16Array(endI - startI), len = 0;\n for (let i = startI, j = 0; i < endI;) {\n copy[j++] = b[i++];\n copy[j++] = b[i++] - from;\n let to = copy[j++] = b[i++] - from;\n copy[j++] = b[i++] - startI;\n len = Math.max(len, to);\n }\n return new TreeBuffer(copy, len, this.set);\n }\n}\nfunction checkSide(side, pos, from, to) {\n switch (side) {\n case -2 /* Side.Before */: return from < pos;\n case -1 /* Side.AtOrBefore */: return to >= pos && from < pos;\n case 0 /* Side.Around */: return from < pos && to > pos;\n case 1 /* Side.AtOrAfter */: return from <= pos && to > pos;\n case 2 /* Side.After */: return to > pos;\n case 4 /* Side.DontCare */: return true;\n }\n}\nfunction enterUnfinishedNodesBefore(node, pos) {\n let scan = node.childBefore(pos);\n while (scan) {\n let last = scan.lastChild;\n if (!last || last.to != scan.to)\n break;\n if (last.type.isError && last.from == last.to) {\n node = scan;\n scan = last.prevSibling;\n }\n else {\n scan = last;\n }\n }\n return node;\n}\nfunction resolveNode(node, pos, side, overlays) {\n var _a;\n // Move up to a node that actually holds the position, if possible\n while (node.from == node.to ||\n (side < 1 ? node.from >= pos : node.from > pos) ||\n (side > -1 ? node.to <= pos : node.to < pos)) {\n let parent = !overlays && node instanceof TreeNode && node.index < 0 ? null : node.parent;\n if (!parent)\n return node;\n node = parent;\n }\n let mode = overlays ? 0 : IterMode.IgnoreOverlays;\n // Must go up out of overlays when those do not overlap with pos\n if (overlays)\n for (let scan = node, parent = scan.parent; parent; scan = parent, parent = scan.parent) {\n if (scan instanceof TreeNode && scan.index < 0 && ((_a = parent.enter(pos, side, mode)) === null || _a === void 0 ? void 0 : _a.from) != scan.from)\n node = parent;\n }\n for (;;) {\n let inner = node.enter(pos, side, mode);\n if (!inner)\n return node;\n node = inner;\n }\n}\nclass TreeNode {\n constructor(_tree, from, \n // Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay)\n index, _parent) {\n this._tree = _tree;\n this.from = from;\n this.index = index;\n this._parent = _parent;\n }\n get type() { return this._tree.type; }\n get name() { return this._tree.type.name; }\n get to() { return this.from + this._tree.length; }\n nextChild(i, dir, pos, side, mode = 0) {\n for (let parent = this;;) {\n for (let { children, positions } = parent._tree, e = dir > 0 ? children.length : -1; i != e; i += dir) {\n let next = children[i], start = positions[i] + parent.from;\n if (!checkSide(side, pos, start, start + next.length))\n continue;\n if (next instanceof TreeBuffer) {\n if (mode & IterMode.ExcludeBuffers)\n continue;\n let index = next.findChild(0, next.buffer.length, dir, pos - start, side);\n if (index > -1)\n return new BufferNode(new BufferContext(parent, next, i, start), null, index);\n }\n else if ((mode & IterMode.IncludeAnonymous) || (!next.type.isAnonymous || hasChild(next))) {\n let mounted;\n if (!(mode & IterMode.IgnoreMounts) &&\n next.props && (mounted = next.prop(NodeProp.mounted)) && !mounted.overlay)\n return new TreeNode(mounted.tree, start, i, parent);\n let inner = new TreeNode(next, start, i, parent);\n return (mode & IterMode.IncludeAnonymous) || !inner.type.isAnonymous ? inner\n : inner.nextChild(dir < 0 ? next.children.length - 1 : 0, dir, pos, side);\n }\n }\n if ((mode & IterMode.IncludeAnonymous) || !parent.type.isAnonymous)\n return null;\n if (parent.index >= 0)\n i = parent.index + dir;\n else\n i = dir < 0 ? -1 : parent._parent._tree.children.length;\n parent = parent._parent;\n if (!parent)\n return null;\n }\n }\n get firstChild() { return this.nextChild(0, 1, 0, 4 /* Side.DontCare */); }\n get lastChild() { return this.nextChild(this._tree.children.length - 1, -1, 0, 4 /* Side.DontCare */); }\n childAfter(pos) { return this.nextChild(0, 1, pos, 2 /* Side.After */); }\n childBefore(pos) { return this.nextChild(this._tree.children.length - 1, -1, pos, -2 /* Side.Before */); }\n enter(pos, side, mode = 0) {\n let mounted;\n if (!(mode & IterMode.IgnoreOverlays) && (mounted = this._tree.prop(NodeProp.mounted)) && mounted.overlay) {\n let rPos = pos - this.from;\n for (let { from, to } of mounted.overlay) {\n if ((side > 0 ? from <= rPos : from < rPos) &&\n (side < 0 ? to >= rPos : to > rPos))\n return new TreeNode(mounted.tree, mounted.overlay[0].from + this.from, -1, this);\n }\n }\n return this.nextChild(0, 1, pos, side, mode);\n }\n nextSignificantParent() {\n let val = this;\n while (val.type.isAnonymous && val._parent)\n val = val._parent;\n return val;\n }\n get parent() {\n return this._parent ? this._parent.nextSignificantParent() : null;\n }\n get nextSibling() {\n return this._parent && this.index >= 0 ? this._parent.nextChild(this.index + 1, 1, 0, 4 /* Side.DontCare */) : null;\n }\n get prevSibling() {\n return this._parent && this.index >= 0 ? this._parent.nextChild(this.index - 1, -1, 0, 4 /* Side.DontCare */) : null;\n }\n cursor(mode = 0) { return new TreeCursor(this, mode); }\n get tree() { return this._tree; }\n toTree() { return this._tree; }\n resolve(pos, side = 0) {\n return resolveNode(this, pos, side, false);\n }\n resolveInner(pos, side = 0) {\n return resolveNode(this, pos, side, true);\n }\n enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); }\n getChild(type, before = null, after = null) {\n let r = getChildren(this, type, before, after);\n return r.length ? r[0] : null;\n }\n getChildren(type, before = null, after = null) {\n return getChildren(this, type, before, after);\n }\n /// @internal\n toString() { return this._tree.toString(); }\n get node() { return this; }\n matchContext(context) { return matchNodeContext(this, context); }\n}\nfunction getChildren(node, type, before, after) {\n let cur = node.cursor(), result = [];\n if (!cur.firstChild())\n return result;\n if (before != null)\n while (!cur.type.is(before))\n if (!cur.nextSibling())\n return result;\n for (;;) {\n if (after != null && cur.type.is(after))\n return result;\n if (cur.type.is(type))\n result.push(cur.node);\n if (!cur.nextSibling())\n return after == null ? result : [];\n }\n}\nfunction matchNodeContext(node, context, i = context.length - 1) {\n for (let p = node.parent; i >= 0; p = p.parent) {\n if (!p)\n return false;\n if (!p.type.isAnonymous) {\n if (context[i] && context[i] != p.name)\n return false;\n i--;\n }\n }\n return true;\n}\nclass BufferContext {\n constructor(parent, buffer, index, start) {\n this.parent = parent;\n this.buffer = buffer;\n this.index = index;\n this.start = start;\n }\n}\nclass BufferNode {\n get name() { return this.type.name; }\n get from() { return this.context.start + this.context.buffer.buffer[this.index + 1]; }\n get to() { return this.context.start + this.context.buffer.buffer[this.index + 2]; }\n constructor(context, _parent, index) {\n this.context = context;\n this._parent = _parent;\n this.index = index;\n this.type = context.buffer.set.types[context.buffer.buffer[index]];\n }\n child(dir, pos, side) {\n let { buffer } = this.context;\n let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.context.start, side);\n return index < 0 ? null : new BufferNode(this.context, this, index);\n }\n get firstChild() { return this.child(1, 0, 4 /* Side.DontCare */); }\n get lastChild() { return this.child(-1, 0, 4 /* Side.DontCare */); }\n childAfter(pos) { return this.child(1, pos, 2 /* Side.After */); }\n childBefore(pos) { return this.child(-1, pos, -2 /* Side.Before */); }\n enter(pos, side, mode = 0) {\n if (mode & IterMode.ExcludeBuffers)\n return null;\n let { buffer } = this.context;\n let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], side > 0 ? 1 : -1, pos - this.context.start, side);\n return index < 0 ? null : new BufferNode(this.context, this, index);\n }\n get parent() {\n return this._parent || this.context.parent.nextSignificantParent();\n }\n externalSibling(dir) {\n return this._parent ? null : this.context.parent.nextChild(this.context.index + dir, dir, 0, 4 /* Side.DontCare */);\n }\n get nextSibling() {\n let { buffer } = this.context;\n let after = buffer.buffer[this.index + 3];\n if (after < (this._parent ? buffer.buffer[this._parent.index + 3] : buffer.buffer.length))\n return new BufferNode(this.context, this._parent, after);\n return this.externalSibling(1);\n }\n get prevSibling() {\n let { buffer } = this.context;\n let parentStart = this._parent ? this._parent.index + 4 : 0;\n if (this.index == parentStart)\n return this.externalSibling(-1);\n return new BufferNode(this.context, this._parent, buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n }\n cursor(mode = 0) { return new TreeCursor(this, mode); }\n get tree() { return null; }\n toTree() {\n let children = [], positions = [];\n let { buffer } = this.context;\n let startI = this.index + 4, endI = buffer.buffer[this.index + 3];\n if (endI > startI) {\n let from = buffer.buffer[this.index + 1];\n children.push(buffer.slice(startI, endI, from));\n positions.push(0);\n }\n return new Tree(this.type, children, positions, this.to - this.from);\n }\n resolve(pos, side = 0) {\n return resolveNode(this, pos, side, false);\n }\n resolveInner(pos, side = 0) {\n return resolveNode(this, pos, side, true);\n }\n enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); }\n /// @internal\n toString() { return this.context.buffer.childString(this.index); }\n getChild(type, before = null, after = null) {\n let r = getChildren(this, type, before, after);\n return r.length ? r[0] : null;\n }\n getChildren(type, before = null, after = null) {\n return getChildren(this, type, before, after);\n }\n get node() { return this; }\n matchContext(context) { return matchNodeContext(this, context); }\n}\n/// A tree cursor object focuses on a given node in a syntax tree, and\n/// allows you to move to adjacent nodes.\nclass TreeCursor {\n /// Shorthand for `.type.name`.\n get name() { return this.type.name; }\n /// @internal\n constructor(node, \n /// @internal\n mode = 0) {\n this.mode = mode;\n /// @internal\n this.buffer = null;\n this.stack = [];\n /// @internal\n this.index = 0;\n this.bufferNode = null;\n if (node instanceof TreeNode) {\n this.yieldNode(node);\n }\n else {\n this._tree = node.context.parent;\n this.buffer = node.context;\n for (let n = node._parent; n; n = n._parent)\n this.stack.unshift(n.index);\n this.bufferNode = node;\n this.yieldBuf(node.index);\n }\n }\n yieldNode(node) {\n if (!node)\n return false;\n this._tree = node;\n this.type = node.type;\n this.from = node.from;\n this.to = node.to;\n return true;\n }\n yieldBuf(index, type) {\n this.index = index;\n let { start, buffer } = this.buffer;\n this.type = type || buffer.set.types[buffer.buffer[index]];\n this.from = start + buffer.buffer[index + 1];\n this.to = start + buffer.buffer[index + 2];\n return true;\n }\n yield(node) {\n if (!node)\n return false;\n if (node instanceof TreeNode) {\n this.buffer = null;\n return this.yieldNode(node);\n }\n this.buffer = node.context;\n return this.yieldBuf(node.index, node.type);\n }\n /// @internal\n toString() {\n return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();\n }\n /// @internal\n enterChild(dir, pos, side) {\n if (!this.buffer)\n return this.yield(this._tree.nextChild(dir < 0 ? this._tree._tree.children.length - 1 : 0, dir, pos, side, this.mode));\n let { buffer } = this.buffer;\n let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.buffer.start, side);\n if (index < 0)\n return false;\n this.stack.push(this.index);\n return this.yieldBuf(index);\n }\n /// Move the cursor to this node's first child. When this returns\n /// false, the node has no child, and the cursor has not been moved.\n firstChild() { return this.enterChild(1, 0, 4 /* Side.DontCare */); }\n /// Move the cursor to this node's last child.\n lastChild() { return this.enterChild(-1, 0, 4 /* Side.DontCare */); }\n /// Move the cursor to the first child that ends after `pos`.\n childAfter(pos) { return this.enterChild(1, pos, 2 /* Side.After */); }\n /// Move to the last child that starts before `pos`.\n childBefore(pos) { return this.enterChild(-1, pos, -2 /* Side.Before */); }\n /// Move the cursor to the child around `pos`. If side is -1 the\n /// child may end at that position, when 1 it may start there. This\n /// will also enter [overlaid](#common.MountedTree.overlay)\n /// [mounted](#common.NodeProp^mounted) trees unless `overlays` is\n /// set to false.\n enter(pos, side, mode = this.mode) {\n if (!this.buffer)\n return this.yield(this._tree.enter(pos, side, mode));\n return mode & IterMode.ExcludeBuffers ? false : this.enterChild(1, pos, side);\n }\n /// Move to the node's parent node, if this isn't the top node.\n parent() {\n if (!this.buffer)\n return this.yieldNode((this.mode & IterMode.IncludeAnonymous) ? this._tree._parent : this._tree.parent);\n if (this.stack.length)\n return this.yieldBuf(this.stack.pop());\n let parent = (this.mode & IterMode.IncludeAnonymous) ? this.buffer.parent : this.buffer.parent.nextSignificantParent();\n this.buffer = null;\n return this.yieldNode(parent);\n }\n /// @internal\n sibling(dir) {\n if (!this.buffer)\n return !this._tree._parent ? false\n : this.yield(this._tree.index < 0 ? null\n : this._tree._parent.nextChild(this._tree.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode));\n let { buffer } = this.buffer, d = this.stack.length - 1;\n if (dir < 0) {\n let parentStart = d < 0 ? 0 : this.stack[d] + 4;\n if (this.index != parentStart)\n return this.yieldBuf(buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n }\n else {\n let after = buffer.buffer[this.index + 3];\n if (after < (d < 0 ? buffer.buffer.length : buffer.buffer[this.stack[d] + 3]))\n return this.yieldBuf(after);\n }\n return d < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode)) : false;\n }\n /// Move to this node's next sibling, if any.\n nextSibling() { return this.sibling(1); }\n /// Move to this node's previous sibling, if any.\n prevSibling() { return this.sibling(-1); }\n atLastNode(dir) {\n let index, parent, { buffer } = this;\n if (buffer) {\n if (dir > 0) {\n if (this.index < buffer.buffer.buffer.length)\n return false;\n }\n else {\n for (let i = 0; i < this.index; i++)\n if (buffer.buffer.buffer[i + 3] < this.index)\n return false;\n }\n ({ index, parent } = buffer);\n }\n else {\n ({ index, _parent: parent } = this._tree);\n }\n for (; parent; { index, _parent: parent } = parent) {\n if (index > -1)\n for (let i = index + dir, e = dir < 0 ? -1 : parent._tree.children.length; i != e; i += dir) {\n let child = parent._tree.children[i];\n if ((this.mode & IterMode.IncludeAnonymous) ||\n child instanceof TreeBuffer ||\n !child.type.isAnonymous ||\n hasChild(child))\n return false;\n }\n }\n return true;\n }\n move(dir, enter) {\n if (enter && this.enterChild(dir, 0, 4 /* Side.DontCare */))\n return true;\n for (;;) {\n if (this.sibling(dir))\n return true;\n if (this.atLastNode(dir) || !this.parent())\n return false;\n }\n }\n /// Move to the next node in a\n /// [pre-order](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order,_NLR)\n /// traversal, going from a node to its first child or, if the\n /// current node is empty or `enter` is false, its next sibling or\n /// the next sibling of the first parent node that has one.\n next(enter = true) { return this.move(1, enter); }\n /// Move to the next node in a last-to-first pre-order traveral. A\n /// node is followed by its last child or, if it has none, its\n /// previous sibling or the previous sibling of the first parent\n /// node that has one.\n prev(enter = true) { return this.move(-1, enter); }\n /// Move the cursor to the innermost node that covers `pos`. If\n /// `side` is -1, it will enter nodes that end at `pos`. If it is 1,\n /// it will enter nodes that start at `pos`.\n moveTo(pos, side = 0) {\n // Move up to a node that actually holds the position, if possible\n while (this.from == this.to ||\n (side < 1 ? this.from >= pos : this.from > pos) ||\n (side > -1 ? this.to <= pos : this.to < pos))\n if (!this.parent())\n break;\n // Then scan down into child nodes as far as possible\n while (this.enterChild(1, pos, side)) { }\n return this;\n }\n /// Get a [syntax node](#common.SyntaxNode) at the cursor's current\n /// position.\n get node() {\n if (!this.buffer)\n return this._tree;\n let cache = this.bufferNode, result = null, depth = 0;\n if (cache && cache.context == this.buffer) {\n scan: for (let index = this.index, d = this.stack.length; d >= 0;) {\n for (let c = cache; c; c = c._parent)\n if (c.index == index) {\n if (index == this.index)\n return c;\n result = c;\n depth = d + 1;\n break scan;\n }\n index = this.stack[--d];\n }\n }\n for (let i = depth; i < this.stack.length; i++)\n result = new BufferNode(this.buffer, result, this.stack[i]);\n return this.bufferNode = new BufferNode(this.buffer, result, this.index);\n }\n /// Get the [tree](#common.Tree) that represents the current node, if\n /// any. Will return null when the node is in a [tree\n /// buffer](#common.TreeBuffer).\n get tree() {\n return this.buffer ? null : this._tree._tree;\n }\n /// Iterate over the current node and all its descendants, calling\n /// `enter` when entering a node and `leave`, if given, when leaving\n /// one. When `enter` returns `false`, any children of that node are\n /// skipped, and `leave` isn't called for it.\n iterate(enter, leave) {\n for (let depth = 0;;) {\n let mustLeave = false;\n if (this.type.isAnonymous || enter(this) !== false) {\n if (this.firstChild()) {\n depth++;\n continue;\n }\n if (!this.type.isAnonymous)\n mustLeave = true;\n }\n for (;;) {\n if (mustLeave && leave)\n leave(this);\n mustLeave = this.type.isAnonymous;\n if (this.nextSibling())\n break;\n if (!depth)\n return;\n this.parent();\n depth--;\n mustLeave = true;\n }\n }\n }\n /// Test whether the current node matches a given context\u2014a sequence\n /// of direct parent node names. Empty strings in the context array\n /// are treated as wildcards.\n matchContext(context) {\n if (!this.buffer)\n return matchNodeContext(this.node, context);\n let { buffer } = this.buffer, { types } = buffer.set;\n for (let i = context.length - 1, d = this.stack.length - 1; i >= 0; d--) {\n if (d < 0)\n return matchNodeContext(this.node, context, i);\n let type = types[buffer.buffer[this.stack[d]]];\n if (!type.isAnonymous) {\n if (context[i] && context[i] != type.name)\n return false;\n i--;\n }\n }\n return true;\n }\n}\nfunction hasChild(tree) {\n return tree.children.some(ch => ch instanceof TreeBuffer || !ch.type.isAnonymous || hasChild(ch));\n}\nfunction buildTree(data) {\n var _a;\n let { buffer, nodeSet, maxBufferLength = DefaultBufferLength, reused = [], minRepeatType = nodeSet.types.length } = data;\n let cursor = Array.isArray(buffer) ? new FlatBufferCursor(buffer, buffer.length) : buffer;\n let types = nodeSet.types;\n let contextHash = 0, lookAhead = 0;\n function takeNode(parentStart, minPos, children, positions, inRepeat) {\n let { id, start, end, size } = cursor;\n let lookAheadAtStart = lookAhead;\n while (size < 0) {\n cursor.next();\n if (size == -1 /* SpecialRecord.Reuse */) {\n let node = reused[id];\n children.push(node);\n positions.push(start - parentStart);\n return;\n }\n else if (size == -3 /* SpecialRecord.ContextChange */) { // Context change\n contextHash = id;\n return;\n }\n else if (size == -4 /* SpecialRecord.LookAhead */) {\n lookAhead = id;\n return;\n }\n else {\n throw new RangeError(`Unrecognized record size: ${size}`);\n }\n }\n let type = types[id], node, buffer;\n let startPos = start - parentStart;\n if (end - start <= maxBufferLength && (buffer = findBufferSize(cursor.pos - minPos, inRepeat))) {\n // Small enough for a buffer, and no reused nodes inside\n let data = new Uint16Array(buffer.size - buffer.skip);\n let endPos = cursor.pos - buffer.size, index = data.length;\n while (cursor.pos > endPos)\n index = copyToBuffer(buffer.start, data, index);\n node = new TreeBuffer(data, end - buffer.start, nodeSet);\n startPos = buffer.start - parentStart;\n }\n else { // Make it a node\n let endPos = cursor.pos - size;\n cursor.next();\n let localChildren = [], localPositions = [];\n let localInRepeat = id >= minRepeatType ? id : -1;\n let lastGroup = 0, lastEnd = end;\n while (cursor.pos > endPos) {\n if (localInRepeat >= 0 && cursor.id == localInRepeat && cursor.size >= 0) {\n if (cursor.end <= lastEnd - maxBufferLength) {\n makeRepeatLeaf(localChildren, localPositions, start, lastGroup, cursor.end, lastEnd, localInRepeat, lookAheadAtStart);\n lastGroup = localChildren.length;\n lastEnd = cursor.end;\n }\n cursor.next();\n }\n else {\n takeNode(start, endPos, localChildren, localPositions, localInRepeat);\n }\n }\n if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length)\n makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart);\n localChildren.reverse();\n localPositions.reverse();\n if (localInRepeat > -1 && lastGroup > 0) {\n let make = makeBalanced(type);\n node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make);\n }\n else {\n node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end);\n }\n }\n children.push(node);\n positions.push(startPos);\n }\n function makeBalanced(type) {\n return (children, positions, length) => {\n let lookAhead = 0, lastI = children.length - 1, last, lookAheadProp;\n if (lastI >= 0 && (last = children[lastI]) instanceof Tree) {\n if (!lastI && last.type == type && last.length == length)\n return last;\n if (lookAheadProp = last.prop(NodeProp.lookAhead))\n lookAhead = positions[lastI] + last.length + lookAheadProp;\n }\n return makeTree(type, children, positions, length, lookAhead);\n };\n }\n function makeRepeatLeaf(children, positions, base, i, from, to, type, lookAhead) {\n let localChildren = [], localPositions = [];\n while (children.length > i) {\n localChildren.push(children.pop());\n localPositions.push(positions.pop() + base - from);\n }\n children.push(makeTree(nodeSet.types[type], localChildren, localPositions, to - from, lookAhead - to));\n positions.push(from - base);\n }\n function makeTree(type, children, positions, length, lookAhead = 0, props) {\n if (contextHash) {\n let pair = [NodeProp.contextHash, contextHash];\n props = props ? [pair].concat(props) : [pair];\n }\n if (lookAhead > 25) {\n let pair = [NodeProp.lookAhead, lookAhead];\n props = props ? [pair].concat(props) : [pair];\n }\n return new Tree(type, children, positions, length, props);\n }\n function findBufferSize(maxSize, inRepeat) {\n // Scan through the buffer to find previous siblings that fit\n // together in a TreeBuffer, and don't contain any reused nodes\n // (which can't be stored in a buffer).\n // If `inRepeat` is > -1, ignore node boundaries of that type for\n // nesting, but make sure the end falls either at the start\n // (`maxSize`) or before such a node.\n let fork = cursor.fork();\n let size = 0, start = 0, skip = 0, minStart = fork.end - maxBufferLength;\n let result = { size: 0, start: 0, skip: 0 };\n scan: for (let minPos = fork.pos - maxSize; fork.pos > minPos;) {\n let nodeSize = fork.size;\n // Pretend nested repeat nodes of the same type don't exist\n if (fork.id == inRepeat && nodeSize >= 0) {\n // Except that we store the current state as a valid return\n // value.\n result.size = size;\n result.start = start;\n result.skip = skip;\n skip += 4;\n size += 4;\n fork.next();\n continue;\n }\n let startPos = fork.pos - nodeSize;\n if (nodeSize < 0 || startPos < minPos || fork.start < minStart)\n break;\n let localSkipped = fork.id >= minRepeatType ? 4 : 0;\n let nodeStart = fork.start;\n fork.next();\n while (fork.pos > startPos) {\n if (fork.size < 0) {\n if (fork.size == -3 /* SpecialRecord.ContextChange */)\n localSkipped += 4;\n else\n break scan;\n }\n else if (fork.id >= minRepeatType) {\n localSkipped += 4;\n }\n fork.next();\n }\n start = nodeStart;\n size += nodeSize;\n skip += localSkipped;\n }\n if (inRepeat < 0 || size == maxSize) {\n result.size = size;\n result.start = start;\n result.skip = skip;\n }\n return result.size > 4 ? result : undefined;\n }\n function copyToBuffer(bufferStart, buffer, index) {\n let { id, start, end, size } = cursor;\n cursor.next();\n if (size >= 0 && id < minRepeatType) {\n let startIndex = index;\n if (size > 4) {\n let endPos = cursor.pos - (size - 4);\n while (cursor.pos > endPos)\n index = copyToBuffer(bufferStart, buffer, index);\n }\n buffer[--index] = startIndex;\n buffer[--index] = end - bufferStart;\n buffer[--index] = start - bufferStart;\n buffer[--index] = id;\n }\n else if (size == -3 /* SpecialRecord.ContextChange */) {\n contextHash = id;\n }\n else if (size == -4 /* SpecialRecord.LookAhead */) {\n lookAhead = id;\n }\n return index;\n }\n let children = [], positions = [];\n while (cursor.pos > 0)\n takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1);\n let length = (_a = data.length) !== null && _a !== void 0 ? _a : (children.length ? positions[0] + children[0].length : 0);\n return new Tree(types[data.topID], children.reverse(), positions.reverse(), length);\n}\nconst nodeSizeCache = new WeakMap;\nfunction nodeSize(balanceType, node) {\n if (!balanceType.isAnonymous || node instanceof TreeBuffer || node.type != balanceType)\n return 1;\n let size = nodeSizeCache.get(node);\n if (size == null) {\n size = 1;\n for (let child of node.children) {\n if (child.type != balanceType || !(child instanceof Tree)) {\n size = 1;\n break;\n }\n size += nodeSize(balanceType, child);\n }\n nodeSizeCache.set(node, size);\n }\n return size;\n}\nfunction balanceRange(\n// The type the balanced tree's inner nodes.\nbalanceType, \n// The direct children and their positions\nchildren, positions, \n// The index range in children/positions to use\nfrom, to, \n// The start position of the nodes, relative to their parent.\nstart, \n// Length of the outer node\nlength, \n// Function to build the top node of the balanced tree\nmkTop, \n// Function to build internal nodes for the balanced tree\nmkTree) {\n let total = 0;\n for (let i = from; i < to; i++)\n total += nodeSize(balanceType, children[i]);\n let maxChild = Math.ceil((total * 1.5) / 8 /* Balance.BranchFactor */);\n let localChildren = [], localPositions = [];\n function divide(children, positions, from, to, offset) {\n for (let i = from; i < to;) {\n let groupFrom = i, groupStart = positions[i], groupSize = nodeSize(balanceType, children[i]);\n i++;\n for (; i < to; i++) {\n let nextSize = nodeSize(balanceType, children[i]);\n if (groupSize + nextSize >= maxChild)\n break;\n groupSize += nextSize;\n }\n if (i == groupFrom + 1) {\n if (groupSize > maxChild) {\n let only = children[groupFrom]; // Only trees can have a size > 1\n divide(only.children, only.positions, 0, only.children.length, positions[groupFrom] + offset);\n continue;\n }\n localChildren.push(children[groupFrom]);\n }\n else {\n let length = positions[i - 1] + children[i - 1].length - groupStart;\n localChildren.push(balanceRange(balanceType, children, positions, groupFrom, i, groupStart, length, null, mkTree));\n }\n localPositions.push(groupStart + offset - start);\n }\n }\n divide(children, positions, from, to, 0);\n return (mkTop || mkTree)(localChildren, localPositions, length);\n}\n/// Provides a way to associate values with pieces of trees. As long\n/// as that part of the tree is reused, the associated values can be\n/// retrieved from an updated tree.\nclass NodeWeakMap {\n constructor() {\n this.map = new WeakMap();\n }\n setBuffer(buffer, index, value) {\n let inner = this.map.get(buffer);\n if (!inner)\n this.map.set(buffer, inner = new Map);\n inner.set(index, value);\n }\n getBuffer(buffer, index) {\n let inner = this.map.get(buffer);\n return inner && inner.get(index);\n }\n /// Set the value for this syntax node.\n set(node, value) {\n if (node instanceof BufferNode)\n this.setBuffer(node.context.buffer, node.index, value);\n else if (node instanceof TreeNode)\n this.map.set(node.tree, value);\n }\n /// Retrieve value for this syntax node, if it exists in the map.\n get(node) {\n return node instanceof BufferNode ? this.getBuffer(node.context.buffer, node.index)\n : node instanceof TreeNode ? this.map.get(node.tree) : undefined;\n }\n /// Set the value for the node that a cursor currently points to.\n cursorSet(cursor, value) {\n if (cursor.buffer)\n this.setBuffer(cursor.buffer.buffer, cursor.index, value);\n else\n this.map.set(cursor.tree, value);\n }\n /// Retrieve the value for the node that a cursor currently points\n /// to.\n cursorGet(cursor) {\n return cursor.buffer ? this.getBuffer(cursor.buffer.buffer, cursor.index) : this.map.get(cursor.tree);\n }\n}\n\n/// Tree fragments are used during [incremental\n/// parsing](#common.Parser.startParse) to track parts of old trees\n/// that can be reused in a new parse. An array of fragments is used\n/// to track regions of an old tree whose nodes might be reused in new\n/// parses. Use the static\n/// [`applyChanges`](#common.TreeFragment^applyChanges) method to\n/// update fragments for document changes.\nclass TreeFragment {\n /// Construct a tree fragment. You'll usually want to use\n /// [`addTree`](#common.TreeFragment^addTree) and\n /// [`applyChanges`](#common.TreeFragment^applyChanges) instead of\n /// calling this directly.\n constructor(\n /// The start of the unchanged range pointed to by this fragment.\n /// This refers to an offset in the _updated_ document (as opposed\n /// to the original tree).\n from, \n /// The end of the unchanged range.\n to, \n /// The tree that this fragment is based on.\n tree, \n /// The offset between the fragment's tree and the document that\n /// this fragment can be used against. Add this when going from\n /// document to tree positions, subtract it to go from tree to\n /// document positions.\n offset, openStart = false, openEnd = false) {\n this.from = from;\n this.to = to;\n this.tree = tree;\n this.offset = offset;\n this.open = (openStart ? 1 /* Open.Start */ : 0) | (openEnd ? 2 /* Open.End */ : 0);\n }\n /// Whether the start of the fragment represents the start of a\n /// parse, or the end of a change. (In the second case, it may not\n /// be safe to reuse some nodes at the start, depending on the\n /// parsing algorithm.)\n get openStart() { return (this.open & 1 /* Open.Start */) > 0; }\n /// Whether the end of the fragment represents the end of a\n /// full-document parse, or the start of a change.\n get openEnd() { return (this.open & 2 /* Open.End */) > 0; }\n /// Create a set of fragments from a freshly parsed tree, or update\n /// an existing set of fragments by replacing the ones that overlap\n /// with a tree with content from the new tree. When `partial` is\n /// true, the parse is treated as incomplete, and the resulting\n /// fragment has [`openEnd`](#common.TreeFragment.openEnd) set to\n /// true.\n static addTree(tree, fragments = [], partial = false) {\n let result = [new TreeFragment(0, tree.length, tree, 0, false, partial)];\n for (let f of fragments)\n if (f.to > tree.length)\n result.push(f);\n return result;\n }\n /// Apply a set of edits to an array of fragments, removing or\n /// splitting fragments as necessary to remove edited ranges, and\n /// adjusting offsets for fragments that moved.\n static applyChanges(fragments, changes, minGap = 128) {\n if (!changes.length)\n return fragments;\n let result = [];\n let fI = 1, nextF = fragments.length ? fragments[0] : null;\n for (let cI = 0, pos = 0, off = 0;; cI++) {\n let nextC = cI < changes.length ? changes[cI] : null;\n let nextPos = nextC ? nextC.fromA : 1e9;\n if (nextPos - pos >= minGap)\n while (nextF && nextF.from < nextPos) {\n let cut = nextF;\n if (pos >= cut.from || nextPos <= cut.to || off) {\n let fFrom = Math.max(cut.from, pos) - off, fTo = Math.min(cut.to, nextPos) - off;\n cut = fFrom >= fTo ? null : new TreeFragment(fFrom, fTo, cut.tree, cut.offset + off, cI > 0, !!nextC);\n }\n if (cut)\n result.push(cut);\n if (nextF.to > nextPos)\n break;\n nextF = fI < fragments.length ? fragments[fI++] : null;\n }\n if (!nextC)\n break;\n pos = nextC.toA;\n off = nextC.toA - nextC.toB;\n }\n return result;\n }\n}\n/// A superclass that parsers should extend.\nclass Parser {\n /// Start a parse, returning a [partial parse](#common.PartialParse)\n /// object. [`fragments`](#common.TreeFragment) can be passed in to\n /// make the parse incremental.\n ///\n /// By default, the entire input is parsed. You can pass `ranges`,\n /// which should be a sorted array of non-empty, non-overlapping\n /// ranges, to parse only those ranges. The tree returned in that\n /// case will start at `ranges[0].from`.\n startParse(input, fragments, ranges) {\n if (typeof input == \"string\")\n input = new StringInput(input);\n ranges = !ranges ? [new Range(0, input.length)] : ranges.length ? ranges.map(r => new Range(r.from, r.to)) : [new Range(0, 0)];\n return this.createParse(input, fragments || [], ranges);\n }\n /// Run a full parse, returning the resulting tree.\n parse(input, fragments, ranges) {\n let parse = this.startParse(input, fragments, ranges);\n for (;;) {\n let done = parse.advance();\n if (done)\n return done;\n }\n }\n}\nclass StringInput {\n constructor(string) {\n this.string = string;\n }\n get length() { return this.string.length; }\n chunk(from) { return this.string.slice(from); }\n get lineChunks() { return false; }\n read(from, to) { return this.string.slice(from, to); }\n}\n\n/// Create a parse wrapper that, after the inner parse completes,\n/// scans its tree for mixed language regions with the `nest`\n/// function, runs the resulting [inner parses](#common.NestedParse),\n/// and then [mounts](#common.NodeProp^mounted) their results onto the\n/// tree.\nfunction parseMixed(nest) {\n return (parse, input, fragments, ranges) => new MixedParse(parse, nest, input, fragments, ranges);\n}\nclass InnerParse {\n constructor(parser, parse, overlay, target, ranges) {\n this.parser = parser;\n this.parse = parse;\n this.overlay = overlay;\n this.target = target;\n this.ranges = ranges;\n if (!ranges.length || ranges.some(r => r.from >= r.to))\n throw new RangeError(\"Invalid inner parse ranges given: \" + JSON.stringify(ranges));\n }\n}\nclass ActiveOverlay {\n constructor(parser, predicate, mounts, index, start, target, prev) {\n this.parser = parser;\n this.predicate = predicate;\n this.mounts = mounts;\n this.index = index;\n this.start = start;\n this.target = target;\n this.prev = prev;\n this.depth = 0;\n this.ranges = [];\n }\n}\nconst stoppedInner = new NodeProp({ perNode: true });\nclass MixedParse {\n constructor(base, nest, input, fragments, ranges) {\n this.nest = nest;\n this.input = input;\n this.fragments = fragments;\n this.ranges = ranges;\n this.inner = [];\n this.innerDone = 0;\n this.baseTree = null;\n this.stoppedAt = null;\n this.baseParse = base;\n }\n advance() {\n if (this.baseParse) {\n let done = this.baseParse.advance();\n if (!done)\n return null;\n this.baseParse = null;\n this.baseTree = done;\n this.startInner();\n if (this.stoppedAt != null)\n for (let inner of this.inner)\n inner.parse.stopAt(this.stoppedAt);\n }\n if (this.innerDone == this.inner.length) {\n let result = this.baseTree;\n if (this.stoppedAt != null)\n result = new Tree(result.type, result.children, result.positions, result.length, result.propValues.concat([[stoppedInner, this.stoppedAt]]));\n return result;\n }\n let inner = this.inner[this.innerDone], done = inner.parse.advance();\n if (done) {\n this.innerDone++;\n // This is a somewhat dodgy but super helpful hack where we\n // patch up nodes created by the inner parse (and thus\n // presumably not aliased anywhere else) to hold the information\n // about the inner parse.\n let props = Object.assign(Object.create(null), inner.target.props);\n props[NodeProp.mounted.id] = new MountedTree(done, inner.overlay, inner.parser);\n inner.target.props = props;\n }\n return null;\n }\n get parsedPos() {\n if (this.baseParse)\n return 0;\n let pos = this.input.length;\n for (let i = this.innerDone; i < this.inner.length; i++) {\n if (this.inner[i].ranges[0].from < pos)\n pos = Math.min(pos, this.inner[i].parse.parsedPos);\n }\n return pos;\n }\n stopAt(pos) {\n this.stoppedAt = pos;\n if (this.baseParse)\n this.baseParse.stopAt(pos);\n else\n for (let i = this.innerDone; i < this.inner.length; i++)\n this.inner[i].parse.stopAt(pos);\n }\n startInner() {\n let fragmentCursor = new FragmentCursor(this.fragments);\n let overlay = null;\n let covered = null;\n let cursor = new TreeCursor(new TreeNode(this.baseTree, this.ranges[0].from, 0, null), IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n scan: for (let nest, isCovered; this.stoppedAt == null || cursor.from < this.stoppedAt;) {\n let enter = true, range;\n if (fragmentCursor.hasNode(cursor)) {\n if (overlay) {\n let match = overlay.mounts.find(m => m.frag.from <= cursor.from && m.frag.to >= cursor.to && m.mount.overlay);\n if (match)\n for (let r of match.mount.overlay) {\n let from = r.from + match.pos, to = r.to + match.pos;\n if (from >= cursor.from && to <= cursor.to && !overlay.ranges.some(r => r.from < to && r.to > from))\n overlay.ranges.push({ from, to });\n }\n }\n enter = false;\n }\n else if (covered && (isCovered = checkCover(covered.ranges, cursor.from, cursor.to))) {\n enter = isCovered != 2 /* Cover.Full */;\n }\n else if (!cursor.type.isAnonymous && cursor.from < cursor.to && (nest = this.nest(cursor, this.input))) {\n if (!cursor.tree)\n materialize(cursor);\n let oldMounts = fragmentCursor.findMounts(cursor.from, nest.parser);\n if (typeof nest.overlay == \"function\") {\n overlay = new ActiveOverlay(nest.parser, nest.overlay, oldMounts, this.inner.length, cursor.from, cursor.tree, overlay);\n }\n else {\n let ranges = punchRanges(this.ranges, nest.overlay || [new Range(cursor.from, cursor.to)]);\n if (ranges.length)\n this.inner.push(new InnerParse(nest.parser, nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, cursor.tree, ranges));\n if (!nest.overlay)\n enter = false;\n else if (ranges.length)\n covered = { ranges, depth: 0, prev: covered };\n }\n }\n else if (overlay && (range = overlay.predicate(cursor))) {\n if (range === true)\n range = new Range(cursor.from, cursor.to);\n if (range.from < range.to)\n overlay.ranges.push(range);\n }\n if (enter && cursor.firstChild()) {\n if (overlay)\n overlay.depth++;\n if (covered)\n covered.depth++;\n }\n else {\n for (;;) {\n if (cursor.nextSibling())\n break;\n if (!cursor.parent())\n break scan;\n if (overlay && !--overlay.depth) {\n let ranges = punchRanges(this.ranges, overlay.ranges);\n if (ranges.length)\n this.inner.splice(overlay.index, 0, new InnerParse(overlay.parser, overlay.parser.startParse(this.input, enterFragments(overlay.mounts, ranges), ranges), overlay.ranges.map(r => new Range(r.from - overlay.start, r.to - overlay.start)), overlay.target, ranges));\n overlay = overlay.prev;\n }\n if (covered && !--covered.depth)\n covered = covered.prev;\n }\n }\n }\n }\n}\nfunction checkCover(covered, from, to) {\n for (let range of covered) {\n if (range.from >= to)\n break;\n if (range.to > from)\n return range.from <= from && range.to >= to ? 2 /* Cover.Full */ : 1 /* Cover.Partial */;\n }\n return 0 /* Cover.None */;\n}\n// Take a piece of buffer and convert it into a stand-alone\n// TreeBuffer.\nfunction sliceBuf(buf, startI, endI, nodes, positions, off) {\n if (startI < endI) {\n let from = buf.buffer[startI + 1];\n nodes.push(buf.slice(startI, endI, from));\n positions.push(from - off);\n }\n}\n// This function takes a node that's in a buffer, and converts it, and\n// its parent buffer nodes, into a Tree. This is again acting on the\n// assumption that the trees and buffers have been constructed by the\n// parse that was ran via the mix parser, and thus aren't shared with\n// any other code, making violations of the immutability safe.\nfunction materialize(cursor) {\n let { node } = cursor, depth = 0;\n // Scan up to the nearest tree\n do {\n cursor.parent();\n depth++;\n } while (!cursor.tree);\n // Find the index of the buffer in that tree\n let i = 0, base = cursor.tree, off = 0;\n for (;; i++) {\n off = base.positions[i] + cursor.from;\n if (off <= node.from && off + base.children[i].length >= node.to)\n break;\n }\n let buf = base.children[i], b = buf.buffer;\n // Split a level in the buffer, putting the nodes before and after\n // the child that contains `node` into new buffers.\n function split(startI, endI, type, innerOffset, length) {\n let i = startI;\n while (b[i + 2] + off <= node.from)\n i = b[i + 3];\n let children = [], positions = [];\n sliceBuf(buf, startI, i, children, positions, innerOffset);\n let from = b[i + 1], to = b[i + 2];\n let isTarget = from + off == node.from && to + off == node.to && b[i] == node.type.id;\n children.push(isTarget ? node.toTree() : split(i + 4, b[i + 3], buf.set.types[b[i]], from, to - from));\n positions.push(from - innerOffset);\n sliceBuf(buf, b[i + 3], endI, children, positions, innerOffset);\n return new Tree(type, children, positions, length);\n }\n base.children[i] = split(0, b.length, NodeType.none, 0, buf.length);\n // Move the cursor back to the target node\n for (let d = 0; d <= depth; d++)\n cursor.childAfter(node.from);\n}\nclass StructureCursor {\n constructor(root, offset) {\n this.offset = offset;\n this.done = false;\n this.cursor = root.cursor(IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n }\n // Move to the first node (in pre-order) that starts at or after `pos`.\n moveTo(pos) {\n let { cursor } = this, p = pos - this.offset;\n while (!this.done && cursor.from < p) {\n if (cursor.to >= pos && cursor.enter(p, 1, IterMode.IgnoreOverlays | IterMode.ExcludeBuffers)) ;\n else if (!cursor.next(false))\n this.done = true;\n }\n }\n hasNode(cursor) {\n this.moveTo(cursor.from);\n if (!this.done && this.cursor.from + this.offset == cursor.from && this.cursor.tree) {\n for (let tree = this.cursor.tree;;) {\n if (tree == cursor.tree)\n return true;\n if (tree.children.length && tree.positions[0] == 0 && tree.children[0] instanceof Tree)\n tree = tree.children[0];\n else\n break;\n }\n }\n return false;\n }\n}\nclass FragmentCursor {\n constructor(fragments) {\n var _a;\n this.fragments = fragments;\n this.curTo = 0;\n this.fragI = 0;\n if (fragments.length) {\n let first = this.curFrag = fragments[0];\n this.curTo = (_a = first.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : first.to;\n this.inner = new StructureCursor(first.tree, -first.offset);\n }\n else {\n this.curFrag = this.inner = null;\n }\n }\n hasNode(node) {\n while (this.curFrag && node.from >= this.curTo)\n this.nextFrag();\n return this.curFrag && this.curFrag.from <= node.from && this.curTo >= node.to && this.inner.hasNode(node);\n }\n nextFrag() {\n var _a;\n this.fragI++;\n if (this.fragI == this.fragments.length) {\n this.curFrag = this.inner = null;\n }\n else {\n let frag = this.curFrag = this.fragments[this.fragI];\n this.curTo = (_a = frag.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : frag.to;\n this.inner = new StructureCursor(frag.tree, -frag.offset);\n }\n }\n findMounts(pos, parser) {\n var _a;\n let result = [];\n if (this.inner) {\n this.inner.cursor.moveTo(pos, 1);\n for (let pos = this.inner.cursor.node; pos; pos = pos.parent) {\n let mount = (_a = pos.tree) === null || _a === void 0 ? void 0 : _a.prop(NodeProp.mounted);\n if (mount && mount.parser == parser) {\n for (let i = this.fragI; i < this.fragments.length; i++) {\n let frag = this.fragments[i];\n if (frag.from >= pos.to)\n break;\n if (frag.tree == this.curFrag.tree)\n result.push({\n frag,\n pos: pos.from - frag.offset,\n mount\n });\n }\n }\n }\n }\n return result;\n }\n}\nfunction punchRanges(outer, ranges) {\n let copy = null, current = ranges;\n for (let i = 1, j = 0; i < outer.length; i++) {\n let gapFrom = outer[i - 1].to, gapTo = outer[i].from;\n for (; j < current.length; j++) {\n let r = current[j];\n if (r.from >= gapTo)\n break;\n if (r.to <= gapFrom)\n continue;\n if (!copy)\n current = copy = ranges.slice();\n if (r.from < gapFrom) {\n copy[j] = new Range(r.from, gapFrom);\n if (r.to > gapTo)\n copy.splice(j + 1, 0, new Range(gapTo, r.to));\n }\n else if (r.to > gapTo) {\n copy[j--] = new Range(gapTo, r.to);\n }\n else {\n copy.splice(j--, 1);\n }\n }\n }\n return current;\n}\nfunction findCoverChanges(a, b, from, to) {\n let iA = 0, iB = 0, inA = false, inB = false, pos = -1e9;\n let result = [];\n for (;;) {\n let nextA = iA == a.length ? 1e9 : inA ? a[iA].to : a[iA].from;\n let nextB = iB == b.length ? 1e9 : inB ? b[iB].to : b[iB].from;\n if (inA != inB) {\n let start = Math.max(pos, from), end = Math.min(nextA, nextB, to);\n if (start < end)\n result.push(new Range(start, end));\n }\n pos = Math.min(nextA, nextB);\n if (pos == 1e9)\n break;\n if (nextA == pos) {\n if (!inA)\n inA = true;\n else {\n inA = false;\n iA++;\n }\n }\n if (nextB == pos) {\n if (!inB)\n inB = true;\n else {\n inB = false;\n iB++;\n }\n }\n }\n return result;\n}\n// Given a number of fragments for the outer tree, and a set of ranges\n// to parse, find fragments for inner trees mounted around those\n// ranges, if any.\nfunction enterFragments(mounts, ranges) {\n let result = [];\n for (let { pos, mount, frag } of mounts) {\n let startPos = pos + (mount.overlay ? mount.overlay[0].from : 0), endPos = startPos + mount.tree.length;\n let from = Math.max(frag.from, startPos), to = Math.min(frag.to, endPos);\n if (mount.overlay) {\n let overlay = mount.overlay.map(r => new Range(r.from + pos, r.to + pos));\n let changes = findCoverChanges(ranges, overlay, from, to);\n for (let i = 0, pos = from;; i++) {\n let last = i == changes.length, end = last ? to : changes[i].from;\n if (end > pos)\n result.push(new TreeFragment(pos, end, mount.tree, -startPos, frag.from >= pos || frag.openStart, frag.to <= end || frag.openEnd));\n if (last)\n break;\n pos = changes[i].to;\n }\n }\n else {\n result.push(new TreeFragment(from, to, mount.tree, -startPos, frag.from >= startPos || frag.openStart, frag.to <= endPos || frag.openEnd));\n }\n }\n return result;\n}\n\nexport { DefaultBufferLength, IterMode, MountedTree, NodeProp, NodeSet, NodeType, NodeWeakMap, Parser, Tree, TreeBuffer, TreeCursor, TreeFragment, parseMixed };\n", "import { NodeProp } from '@lezer/common';\n\nlet nextTagID = 0;\n/**\nHighlighting tags are markers that denote a highlighting category.\nThey are [associated](#highlight.styleTags) with parts of a syntax\ntree by a language mode, and then mapped to an actual CSS style by\na [highlighter](#highlight.Highlighter).\n\nBecause syntax tree node types and highlight styles have to be\nable to talk the same language, CodeMirror uses a mostly _closed_\n[vocabulary](#highlight.tags) of syntax tags (as opposed to\ntraditional open string-based systems, which make it hard for\nhighlighting themes to cover all the tokens produced by the\nvarious languages).\n\nIt _is_ possible to [define](#highlight.Tag^define) your own\nhighlighting tags for system-internal use (where you control both\nthe language package and the highlighter), but such tags will not\nbe picked up by regular highlighters (though you can derive them\nfrom standard tags to allow highlighters to fall back to those).\n*/\nclass Tag {\n /**\n @internal\n */\n constructor(\n /**\n The set of this tag and all its parent tags, starting with\n this one itself and sorted in order of decreasing specificity.\n */\n set, \n /**\n The base unmodified tag that this one is based on, if it's\n modified @internal\n */\n base, \n /**\n The modifiers applied to this.base @internal\n */\n modified) {\n this.set = set;\n this.base = base;\n this.modified = modified;\n /**\n @internal\n */\n this.id = nextTagID++;\n }\n /**\n Define a new tag. If `parent` is given, the tag is treated as a\n sub-tag of that parent, and\n [highlighters](#highlight.tagHighlighter) that don't mention\n this tag will try to fall back to the parent tag (or grandparent\n tag, etc).\n */\n static define(parent) {\n if (parent === null || parent === void 0 ? void 0 : parent.base)\n throw new Error(\"Can not derive from a modified tag\");\n let tag = new Tag([], null, []);\n tag.set.push(tag);\n if (parent)\n for (let t of parent.set)\n tag.set.push(t);\n return tag;\n }\n /**\n Define a tag _modifier_, which is a function that, given a tag,\n will return a tag that is a subtag of the original. Applying the\n same modifier to a twice tag will return the same value (`m1(t1)\n == m1(t1)`) and applying multiple modifiers will, regardless or\n order, produce the same tag (`m1(m2(t1)) == m2(m1(t1))`).\n \n When multiple modifiers are applied to a given base tag, each\n smaller set of modifiers is registered as a parent, so that for\n example `m1(m2(m3(t1)))` is a subtype of `m1(m2(t1))`,\n `m1(m3(t1)`, and so on.\n */\n static defineModifier() {\n let mod = new Modifier;\n return (tag) => {\n if (tag.modified.indexOf(mod) > -1)\n return tag;\n return Modifier.get(tag.base || tag, tag.modified.concat(mod).sort((a, b) => a.id - b.id));\n };\n }\n}\nlet nextModifierID = 0;\nclass Modifier {\n constructor() {\n this.instances = [];\n this.id = nextModifierID++;\n }\n static get(base, mods) {\n if (!mods.length)\n return base;\n let exists = mods[0].instances.find(t => t.base == base && sameArray(mods, t.modified));\n if (exists)\n return exists;\n let set = [], tag = new Tag(set, base, mods);\n for (let m of mods)\n m.instances.push(tag);\n let configs = powerSet(mods);\n for (let parent of base.set)\n if (!parent.modified.length)\n for (let config of configs)\n set.push(Modifier.get(parent, config));\n return tag;\n }\n}\nfunction sameArray(a, b) {\n return a.length == b.length && a.every((x, i) => x == b[i]);\n}\nfunction powerSet(array) {\n let sets = [[]];\n for (let i = 0; i < array.length; i++) {\n for (let j = 0, e = sets.length; j < e; j++) {\n sets.push(sets[j].concat(array[i]));\n }\n }\n return sets.sort((a, b) => b.length - a.length);\n}\n/**\nThis function is used to add a set of tags to a language syntax\nvia [`NodeSet.extend`](#common.NodeSet.extend) or\n[`LRParser.configure`](#lr.LRParser.configure).\n\nThe argument object maps node selectors to [highlighting\ntags](#highlight.Tag) or arrays of tags.\n\nNode selectors may hold one or more (space-separated) node paths.\nSuch a path can be a [node name](#common.NodeType.name), or\nmultiple node names (or `*` wildcards) separated by slash\ncharacters, as in `\"Block/Declaration/VariableName\"`. Such a path\nmatches the final node but only if its direct parent nodes are the\nother nodes mentioned. A `*` in such a path matches any parent,\nbut only a single level\u2014wildcards that match multiple parents\naren't supported, both for efficiency reasons and because Lezer\ntrees make it rather hard to reason about what they would match.)\n\nA path can be ended with `/...` to indicate that the tag assigned\nto the node should also apply to all child nodes, even if they\nmatch their own style (by default, only the innermost style is\nused).\n\nWhen a path ends in `!`, as in `Attribute!`, no further matching\nhappens for the node's child nodes, and the entire node gets the\ngiven style.\n\nIn this notation, node names that contain `/`, `!`, `*`, or `...`\nmust be quoted as JSON strings.\n\nFor example:\n\n```javascript\nparser.withProps(\n styleTags({\n // Style Number and BigNumber nodes\n \"Number BigNumber\": tags.number,\n // Style Escape nodes whose parent is String\n \"String/Escape\": tags.escape,\n // Style anything inside Attributes nodes\n \"Attributes!\": tags.meta,\n // Add a style to all content inside Italic nodes\n \"Italic/...\": tags.emphasis,\n // Style InvalidString nodes as both `string` and `invalid`\n \"InvalidString\": [tags.string, tags.invalid],\n // Style the node named \"/\" as punctuation\n '\"/\"': tags.punctuation\n })\n)\n```\n*/\nfunction styleTags(spec) {\n let byName = Object.create(null);\n for (let prop in spec) {\n let tags = spec[prop];\n if (!Array.isArray(tags))\n tags = [tags];\n for (let part of prop.split(\" \"))\n if (part) {\n let pieces = [], mode = 2 /* Normal */, rest = part;\n for (let pos = 0;;) {\n if (rest == \"...\" && pos > 0 && pos + 3 == part.length) {\n mode = 1 /* Inherit */;\n break;\n }\n let m = /^\"(?:[^\"\\\\]|\\\\.)*?\"|[^\\/!]+/.exec(rest);\n if (!m)\n throw new RangeError(\"Invalid path: \" + part);\n pieces.push(m[0] == \"*\" ? \"\" : m[0][0] == '\"' ? JSON.parse(m[0]) : m[0]);\n pos += m[0].length;\n if (pos == part.length)\n break;\n let next = part[pos++];\n if (pos == part.length && next == \"!\") {\n mode = 0 /* Opaque */;\n break;\n }\n if (next != \"/\")\n throw new RangeError(\"Invalid path: \" + part);\n rest = part.slice(pos);\n }\n let last = pieces.length - 1, inner = pieces[last];\n if (!inner)\n throw new RangeError(\"Invalid path: \" + part);\n let rule = new Rule(tags, mode, last > 0 ? pieces.slice(0, last) : null);\n byName[inner] = rule.sort(byName[inner]);\n }\n }\n return ruleNodeProp.add(byName);\n}\nconst ruleNodeProp = new NodeProp();\nclass Rule {\n constructor(tags, mode, context, next) {\n this.tags = tags;\n this.mode = mode;\n this.context = context;\n this.next = next;\n }\n get opaque() { return this.mode == 0 /* Opaque */; }\n get inherit() { return this.mode == 1 /* Inherit */; }\n sort(other) {\n if (!other || other.depth < this.depth) {\n this.next = other;\n return this;\n }\n other.next = this.sort(other.next);\n return other;\n }\n get depth() { return this.context ? this.context.length : 0; }\n}\nRule.empty = new Rule([], 2 /* Normal */, null);\n/**\nDefine a [highlighter](#highlight.Highlighter) from an array of\ntag/class pairs. Classes associated with more specific tags will\ntake precedence.\n*/\nfunction tagHighlighter(tags, options) {\n let map = Object.create(null);\n for (let style of tags) {\n if (!Array.isArray(style.tag))\n map[style.tag.id] = style.class;\n else\n for (let tag of style.tag)\n map[tag.id] = style.class;\n }\n let { scope, all = null } = options || {};\n return {\n style: (tags) => {\n let cls = all;\n for (let tag of tags) {\n for (let sub of tag.set) {\n let tagClass = map[sub.id];\n if (tagClass) {\n cls = cls ? cls + \" \" + tagClass : tagClass;\n break;\n }\n }\n }\n return cls;\n },\n scope\n };\n}\nfunction highlightTags(highlighters, tags) {\n let result = null;\n for (let highlighter of highlighters) {\n let value = highlighter.style(tags);\n if (value)\n result = result ? result + \" \" + value : value;\n }\n return result;\n}\n/**\nHighlight the given [tree](#common.Tree) with the given\n[highlighter](#highlight.Highlighter).\n*/\nfunction highlightTree(tree, highlighter, \n/**\nAssign styling to a region of the text. Will be called, in order\nof position, for any ranges where more than zero classes apply.\n`classes` is a space separated string of CSS classes.\n*/\nputStyle, \n/**\nThe start of the range to highlight.\n*/\nfrom = 0, \n/**\nThe end of the range.\n*/\nto = tree.length) {\n let builder = new HighlightBuilder(from, Array.isArray(highlighter) ? highlighter : [highlighter], putStyle);\n builder.highlightRange(tree.cursor(), from, to, \"\", builder.highlighters);\n builder.flush(to);\n}\nclass HighlightBuilder {\n constructor(at, highlighters, span) {\n this.at = at;\n this.highlighters = highlighters;\n this.span = span;\n this.class = \"\";\n }\n startSpan(at, cls) {\n if (cls != this.class) {\n this.flush(at);\n if (at > this.at)\n this.at = at;\n this.class = cls;\n }\n }\n flush(to) {\n if (to > this.at && this.class)\n this.span(this.at, to, this.class);\n }\n highlightRange(cursor, from, to, inheritedClass, highlighters) {\n let { type, from: start, to: end } = cursor;\n if (start >= to || end <= from)\n return;\n if (type.isTop)\n highlighters = this.highlighters.filter(h => !h.scope || h.scope(type));\n let cls = inheritedClass;\n let rule = getStyleTags(cursor) || Rule.empty;\n let tagCls = highlightTags(highlighters, rule.tags);\n if (tagCls) {\n if (cls)\n cls += \" \";\n cls += tagCls;\n if (rule.mode == 1 /* Inherit */)\n inheritedClass += (inheritedClass ? \" \" : \"\") + tagCls;\n }\n this.startSpan(Math.max(from, start), cls);\n if (rule.opaque)\n return;\n let mounted = cursor.tree && cursor.tree.prop(NodeProp.mounted);\n if (mounted && mounted.overlay) {\n let inner = cursor.node.enter(mounted.overlay[0].from + start, 1);\n let innerHighlighters = this.highlighters.filter(h => !h.scope || h.scope(mounted.tree.type));\n let hasChild = cursor.firstChild();\n for (let i = 0, pos = start;; i++) {\n let next = i < mounted.overlay.length ? mounted.overlay[i] : null;\n let nextPos = next ? next.from + start : end;\n let rangeFrom = Math.max(from, pos), rangeTo = Math.min(to, nextPos);\n if (rangeFrom < rangeTo && hasChild) {\n while (cursor.from < rangeTo) {\n this.highlightRange(cursor, rangeFrom, rangeTo, inheritedClass, highlighters);\n this.startSpan(Math.min(rangeTo, cursor.to), cls);\n if (cursor.to >= nextPos || !cursor.nextSibling())\n break;\n }\n }\n if (!next || nextPos > to)\n break;\n pos = next.to + start;\n if (pos > from) {\n this.highlightRange(inner.cursor(), Math.max(from, next.from + start), Math.min(to, pos), \"\", innerHighlighters);\n this.startSpan(Math.min(to, pos), cls);\n }\n }\n if (hasChild)\n cursor.parent();\n }\n else if (cursor.firstChild()) {\n if (mounted)\n inheritedClass = \"\";\n do {\n if (cursor.to <= from)\n continue;\n if (cursor.from >= to)\n break;\n this.highlightRange(cursor, from, to, inheritedClass, highlighters);\n this.startSpan(Math.min(to, cursor.to), cls);\n } while (cursor.nextSibling());\n cursor.parent();\n }\n }\n}\n/**\nMatch a syntax node's [highlight rules](#highlight.styleTags). If\nthere's a match, return its set of tags, and whether it is\nopaque (uses a `!`) or applies to all child nodes (`/...`).\n*/\nfunction getStyleTags(node) {\n let rule = node.type.prop(ruleNodeProp);\n while (rule && rule.context && !node.matchContext(rule.context))\n rule = rule.next;\n return rule || null;\n}\nconst t = Tag.define;\nconst comment = t(), name = t(), typeName = t(name), propertyName = t(name), literal = t(), string = t(literal), number = t(literal), content = t(), heading = t(content), keyword = t(), operator = t(), punctuation = t(), bracket = t(punctuation), meta = t();\n/**\nThe default set of highlighting [tags](#highlight.Tag).\n\nThis collection is heavily biased towards programming languages,\nand necessarily incomplete. A full ontology of syntactic\nconstructs would fill a stack of books, and be impractical to\nwrite themes for. So try to make do with this set. If all else\nfails, [open an\nissue](https://github.com/codemirror/codemirror.next) to propose a\nnew tag, or [define](#highlight.Tag^define) a local custom tag for\nyour use case.\n\nNote that it is not obligatory to always attach the most specific\ntag possible to an element\u2014if your grammar can't easily\ndistinguish a certain type of element (such as a local variable),\nit is okay to style it as its more general variant (a variable).\n\nFor tags that extend some parent tag, the documentation links to\nthe parent.\n*/\nconst tags = {\n /**\n A comment.\n */\n comment,\n /**\n A line [comment](#highlight.tags.comment).\n */\n lineComment: t(comment),\n /**\n A block [comment](#highlight.tags.comment).\n */\n blockComment: t(comment),\n /**\n A documentation [comment](#highlight.tags.comment).\n */\n docComment: t(comment),\n /**\n Any kind of identifier.\n */\n name,\n /**\n The [name](#highlight.tags.name) of a variable.\n */\n variableName: t(name),\n /**\n A type [name](#highlight.tags.name).\n */\n typeName: typeName,\n /**\n A tag name (subtag of [`typeName`](#highlight.tags.typeName)).\n */\n tagName: t(typeName),\n /**\n A property or field [name](#highlight.tags.name).\n */\n propertyName: propertyName,\n /**\n An attribute name (subtag of [`propertyName`](#highlight.tags.propertyName)).\n */\n attributeName: t(propertyName),\n /**\n The [name](#highlight.tags.name) of a class.\n */\n className: t(name),\n /**\n A label [name](#highlight.tags.name).\n */\n labelName: t(name),\n /**\n A namespace [name](#highlight.tags.name).\n */\n namespace: t(name),\n /**\n The [name](#highlight.tags.name) of a macro.\n */\n macroName: t(name),\n /**\n A literal value.\n */\n literal,\n /**\n A string [literal](#highlight.tags.literal).\n */\n string,\n /**\n A documentation [string](#highlight.tags.string).\n */\n docString: t(string),\n /**\n A character literal (subtag of [string](#highlight.tags.string)).\n */\n character: t(string),\n /**\n An attribute value (subtag of [string](#highlight.tags.string)).\n */\n attributeValue: t(string),\n /**\n A number [literal](#highlight.tags.literal).\n */\n number,\n /**\n An integer [number](#highlight.tags.number) literal.\n */\n integer: t(number),\n /**\n A floating-point [number](#highlight.tags.number) literal.\n */\n float: t(number),\n /**\n A boolean [literal](#highlight.tags.literal).\n */\n bool: t(literal),\n /**\n Regular expression [literal](#highlight.tags.literal).\n */\n regexp: t(literal),\n /**\n An escape [literal](#highlight.tags.literal), for example a\n backslash escape in a string.\n */\n escape: t(literal),\n /**\n A color [literal](#highlight.tags.literal).\n */\n color: t(literal),\n /**\n A URL [literal](#highlight.tags.literal).\n */\n url: t(literal),\n /**\n A language keyword.\n */\n keyword,\n /**\n The [keyword](#highlight.tags.keyword) for the self or this\n object.\n */\n self: t(keyword),\n /**\n The [keyword](#highlight.tags.keyword) for null.\n */\n null: t(keyword),\n /**\n A [keyword](#highlight.tags.keyword) denoting some atomic value.\n */\n atom: t(keyword),\n /**\n A [keyword](#highlight.tags.keyword) that represents a unit.\n */\n unit: t(keyword),\n /**\n A modifier [keyword](#highlight.tags.keyword).\n */\n modifier: t(keyword),\n /**\n A [keyword](#highlight.tags.keyword) that acts as an operator.\n */\n operatorKeyword: t(keyword),\n /**\n A control-flow related [keyword](#highlight.tags.keyword).\n */\n controlKeyword: t(keyword),\n /**\n A [keyword](#highlight.tags.keyword) that defines something.\n */\n definitionKeyword: t(keyword),\n /**\n A [keyword](#highlight.tags.keyword) related to defining or\n interfacing with modules.\n */\n moduleKeyword: t(keyword),\n /**\n An operator.\n */\n operator,\n /**\n An [operator](#highlight.tags.operator) that dereferences something.\n */\n derefOperator: t(operator),\n /**\n Arithmetic-related [operator](#highlight.tags.operator).\n */\n arithmeticOperator: t(operator),\n /**\n Logical [operator](#highlight.tags.operator).\n */\n logicOperator: t(operator),\n /**\n Bit [operator](#highlight.tags.operator).\n */\n bitwiseOperator: t(operator),\n /**\n Comparison [operator](#highlight.tags.operator).\n */\n compareOperator: t(operator),\n /**\n [Operator](#highlight.tags.operator) that updates its operand.\n */\n updateOperator: t(operator),\n /**\n [Operator](#highlight.tags.operator) that defines something.\n */\n definitionOperator: t(operator),\n /**\n Type-related [operator](#highlight.tags.operator).\n */\n typeOperator: t(operator),\n /**\n Control-flow [operator](#highlight.tags.operator).\n */\n controlOperator: t(operator),\n /**\n Program or markup punctuation.\n */\n punctuation,\n /**\n [Punctuation](#highlight.tags.punctuation) that separates\n things.\n */\n separator: t(punctuation),\n /**\n Bracket-style [punctuation](#highlight.tags.punctuation).\n */\n bracket,\n /**\n Angle [brackets](#highlight.tags.bracket) (usually `<` and `>`\n tokens).\n */\n angleBracket: t(bracket),\n /**\n Square [brackets](#highlight.tags.bracket) (usually `[` and `]`\n tokens).\n */\n squareBracket: t(bracket),\n /**\n Parentheses (usually `(` and `)` tokens). Subtag of\n [bracket](#highlight.tags.bracket).\n */\n paren: t(bracket),\n /**\n Braces (usually `{` and `}` tokens). Subtag of\n [bracket](#highlight.tags.bracket).\n */\n brace: t(bracket),\n /**\n Content, for example plain text in XML or markup documents.\n */\n content,\n /**\n [Content](#highlight.tags.content) that represents a heading.\n */\n heading,\n /**\n A level 1 [heading](#highlight.tags.heading).\n */\n heading1: t(heading),\n /**\n A level 2 [heading](#highlight.tags.heading).\n */\n heading2: t(heading),\n /**\n A level 3 [heading](#highlight.tags.heading).\n */\n heading3: t(heading),\n /**\n A level 4 [heading](#highlight.tags.heading).\n */\n heading4: t(heading),\n /**\n A level 5 [heading](#highlight.tags.heading).\n */\n heading5: t(heading),\n /**\n A level 6 [heading](#highlight.tags.heading).\n */\n heading6: t(heading),\n /**\n A prose separator (such as a horizontal rule).\n */\n contentSeparator: t(content),\n /**\n [Content](#highlight.tags.content) that represents a list.\n */\n list: t(content),\n /**\n [Content](#highlight.tags.content) that represents a quote.\n */\n quote: t(content),\n /**\n [Content](#highlight.tags.content) that is emphasized.\n */\n emphasis: t(content),\n /**\n [Content](#highlight.tags.content) that is styled strong.\n */\n strong: t(content),\n /**\n [Content](#highlight.tags.content) that is part of a link.\n */\n link: t(content),\n /**\n [Content](#highlight.tags.content) that is styled as code or\n monospace.\n */\n monospace: t(content),\n /**\n [Content](#highlight.tags.content) that has a strike-through\n style.\n */\n strikethrough: t(content),\n /**\n Inserted text in a change-tracking format.\n */\n inserted: t(),\n /**\n Deleted text.\n */\n deleted: t(),\n /**\n Changed text.\n */\n changed: t(),\n /**\n An invalid or unsyntactic element.\n */\n invalid: t(),\n /**\n Metadata or meta-instruction.\n */\n meta,\n /**\n [Metadata](#highlight.tags.meta) that applies to the entire\n document.\n */\n documentMeta: t(meta),\n /**\n [Metadata](#highlight.tags.meta) that annotates or adds\n attributes to a given syntactic element.\n */\n annotation: t(meta),\n /**\n Processing instruction or preprocessor directive. Subtag of\n [meta](#highlight.tags.meta).\n */\n processingInstruction: t(meta),\n /**\n [Modifier](#highlight.Tag^defineModifier) that indicates that a\n given element is being defined. Expected to be used with the\n various [name](#highlight.tags.name) tags.\n */\n definition: Tag.defineModifier(),\n /**\n [Modifier](#highlight.Tag^defineModifier) that indicates that\n something is constant. Mostly expected to be used with\n [variable names](#highlight.tags.variableName).\n */\n constant: Tag.defineModifier(),\n /**\n [Modifier](#highlight.Tag^defineModifier) used to indicate that\n a [variable](#highlight.tags.variableName) or [property\n name](#highlight.tags.propertyName) is being called or defined\n as a function.\n */\n function: Tag.defineModifier(),\n /**\n [Modifier](#highlight.Tag^defineModifier) that can be applied to\n [names](#highlight.tags.name) to indicate that they belong to\n the language's standard environment.\n */\n standard: Tag.defineModifier(),\n /**\n [Modifier](#highlight.Tag^defineModifier) that indicates a given\n [names](#highlight.tags.name) is local to some scope.\n */\n local: Tag.defineModifier(),\n /**\n A generic variant [modifier](#highlight.Tag^defineModifier) that\n can be used to tag language-specific alternative variants of\n some common tag. It is recommended for themes to define special\n forms of at least the [string](#highlight.tags.string) and\n [variable name](#highlight.tags.variableName) tags, since those\n come up a lot.\n */\n special: Tag.defineModifier()\n};\n/**\nThis is a highlighter that adds stable, predictable classes to\ntokens, for styling with external CSS.\n\nThe following tags are mapped to their name prefixed with `\"tok-\"`\n(for example `\"tok-comment\"`):\n\n* [`link`](#highlight.tags.link)\n* [`heading`](#highlight.tags.heading)\n* [`emphasis`](#highlight.tags.emphasis)\n* [`strong`](#highlight.tags.strong)\n* [`keyword`](#highlight.tags.keyword)\n* [`atom`](#highlight.tags.atom)\n* [`bool`](#highlight.tags.bool)\n* [`url`](#highlight.tags.url)\n* [`labelName`](#highlight.tags.labelName)\n* [`inserted`](#highlight.tags.inserted)\n* [`deleted`](#highlight.tags.deleted)\n* [`literal`](#highlight.tags.literal)\n* [`string`](#highlight.tags.string)\n* [`number`](#highlight.tags.number)\n* [`variableName`](#highlight.tags.variableName)\n* [`typeName`](#highlight.tags.typeName)\n* [`namespace`](#highlight.tags.namespace)\n* [`className`](#highlight.tags.className)\n* [`macroName`](#highlight.tags.macroName)\n* [`propertyName`](#highlight.tags.propertyName)\n* [`operator`](#highlight.tags.operator)\n* [`comment`](#highlight.tags.comment)\n* [`meta`](#highlight.tags.meta)\n* [`punctuation`](#highlight.tags.punctuation)\n* [`invalid`](#highlight.tags.invalid)\n\nIn addition, these mappings are provided:\n\n* [`regexp`](#highlight.tags.regexp),\n [`escape`](#highlight.tags.escape), and\n [`special`](#highlight.tags.special)[`(string)`](#highlight.tags.string)\n are mapped to `\"tok-string2\"`\n* [`special`](#highlight.tags.special)[`(variableName)`](#highlight.tags.variableName)\n to `\"tok-variableName2\"`\n* [`local`](#highlight.tags.local)[`(variableName)`](#highlight.tags.variableName)\n to `\"tok-variableName tok-local\"`\n* [`definition`](#highlight.tags.definition)[`(variableName)`](#highlight.tags.variableName)\n to `\"tok-variableName tok-definition\"`\n* [`definition`](#highlight.tags.definition)[`(propertyName)`](#highlight.tags.propertyName)\n to `\"tok-propertyName tok-definition\"`\n*/\nconst classHighlighter = tagHighlighter([\n { tag: tags.link, class: \"tok-link\" },\n { tag: tags.heading, class: \"tok-heading\" },\n { tag: tags.emphasis, class: \"tok-emphasis\" },\n { tag: tags.strong, class: \"tok-strong\" },\n { tag: tags.keyword, class: \"tok-keyword\" },\n { tag: tags.atom, class: \"tok-atom\" },\n { tag: tags.bool, class: \"tok-bool\" },\n { tag: tags.url, class: \"tok-url\" },\n { tag: tags.labelName, class: \"tok-labelName\" },\n { tag: tags.inserted, class: \"tok-inserted\" },\n { tag: tags.deleted, class: \"tok-deleted\" },\n { tag: tags.literal, class: \"tok-literal\" },\n { tag: tags.string, class: \"tok-string\" },\n { tag: tags.number, class: \"tok-number\" },\n { tag: [tags.regexp, tags.escape, tags.special(tags.string)], class: \"tok-string2\" },\n { tag: tags.variableName, class: \"tok-variableName\" },\n { tag: tags.local(tags.variableName), class: \"tok-variableName tok-local\" },\n { tag: tags.definition(tags.variableName), class: \"tok-variableName tok-definition\" },\n { tag: tags.special(tags.variableName), class: \"tok-variableName2\" },\n { tag: tags.definition(tags.propertyName), class: \"tok-propertyName tok-definition\" },\n { tag: tags.typeName, class: \"tok-typeName\" },\n { tag: tags.namespace, class: \"tok-namespace\" },\n { tag: tags.className, class: \"tok-className\" },\n { tag: tags.macroName, class: \"tok-macroName\" },\n { tag: tags.propertyName, class: \"tok-propertyName\" },\n { tag: tags.operator, class: \"tok-operator\" },\n { tag: tags.comment, class: \"tok-comment\" },\n { tag: tags.meta, class: \"tok-meta\" },\n { tag: tags.invalid, class: \"tok-invalid\" },\n { tag: tags.punctuation, class: \"tok-punctuation\" }\n]);\n\nexport { Tag, classHighlighter, getStyleTags, highlightTree, styleTags, tagHighlighter, tags };\n", "import { tags, type Tag } from \"@lezer/highlight\";\nimport { EditorView } from \"@codemirror/view\";\nimport { HighlightStyle, syntaxHighlighting } from \"@codemirror/language\";\nimport \"@codemirror/state\";\n\nimport { Highlighting, GdScript, CommentMarkers } from \"./defaultGodot.mts\";\nimport { invertLightness } from \"./utils.mts\";\n\nconst BORDER_RADIUS = \"8px\";\nconst SCROLLBAR_DIMENSIONS = \"8px\";\nconst SCROLLBAR_THUMB_BORDER_RADIUS = \"16px\";\n\nconst BACKGROUND_COLOR_ACTIVE = \"#202531\";\n\nexport const gdExerciseThemeLight = EditorView.theme(\n {\n \"&\": {\n color: invertLightness(Highlighting.TEXT_COLOR),\n backgroundColor: invertLightness(BACKGROUND_COLOR_ACTIVE),\n borderRadius: BORDER_RADIUS,\n },\n\n \".cm-gutters\": {\n backgroundColor: invertLightness(BACKGROUND_COLOR_ACTIVE),\n color: invertLightness(Highlighting.LINE_NUMBER_COLOR),\n },\n\n \".cm-scroller::-webkit-scrollbar\": {\n width: SCROLLBAR_DIMENSIONS,\n height: SCROLLBAR_DIMENSIONS,\n },\n\n \".cm-scroller::-webkit-scrollbar-thumb\": {\n borderRadius: SCROLLBAR_THUMB_BORDER_RADIUS,\n backgroundColor: \"hwb(240deg 54.51% 34.12%)\",\n },\n },\n { dark: false }\n);\n\nexport const gdExerciseThemeDark = EditorView.theme(\n {\n \"&\": {\n color: Highlighting.TEXT_COLOR,\n backgroundColor: BACKGROUND_COLOR_ACTIVE,\n borderRadius: BORDER_RADIUS,\n },\n\n \".cm-gutters\": {\n backgroundColor: BACKGROUND_COLOR_ACTIVE,\n color: Highlighting.LINE_NUMBER_COLOR,\n },\n\n \".cm-scroller::-webkit-scrollbar\": {\n width: SCROLLBAR_DIMENSIONS,\n height: SCROLLBAR_DIMENSIONS,\n },\n\n \".cm-scroller::-webkit-scrollbar-thumb\": {\n borderRadius: SCROLLBAR_THUMB_BORDER_RADIUS,\n backgroundColor: \"hwb(240deg 34.12% 54.51%)\",\n },\n },\n { dark: true }\n);\n\nfunction def(tag: Tag, color: string): { tag: Tag; color: string } {\n return {\n tag,\n color,\n };\n}\n\nfunction defInvert(tag: Tag, color: string): { tag: Tag; color: string } {\n const colorDef = def(tag, color);\n colorDef.color = invertLightness(colorDef.color);\n return colorDef;\n}\n\nconst gdExerciseHighlightStyleDark = HighlightStyle.define([\n def(tags.keyword, Highlighting.KEYWORD_COLOR),\n def(tags.moduleKeyword, Highlighting.KEYWORD_COLOR),\n def(tags.operatorKeyword, Highlighting.CONTROL_FLOW_KEYWORD_COLOR),\n def(tags.comment, Highlighting.COMMENT_COLOR),\n def(tags.string, Highlighting.STRING_COLOR),\n def(tags.number, Highlighting.NUMBER_COLOR),\n def(tags.variableName, Highlighting.MEMBER_VARIABLE_COLOR),\n]);\nexport const gdExerciseHighlightDark = syntaxHighlighting(\n gdExerciseHighlightStyleDark\n);\n\nconst gdExerciseHighlightStyleLight = HighlightStyle.define([\n defInvert(tags.keyword, Highlighting.KEYWORD_COLOR),\n defInvert(tags.moduleKeyword, Highlighting.KEYWORD_COLOR),\n defInvert(tags.operatorKeyword, Highlighting.CONTROL_FLOW_KEYWORD_COLOR),\n defInvert(tags.comment, Highlighting.COMMENT_COLOR),\n defInvert(tags.string, Highlighting.STRING_COLOR),\n defInvert(tags.number, Highlighting.NUMBER_COLOR),\n defInvert(tags.variableName, Highlighting.MEMBER_VARIABLE_COLOR),\n]);\nexport const gdExerciseHighlightLight = syntaxHighlighting(\n gdExerciseHighlightStyleLight\n);\n", "export const Highlighting = {\n SYMBOL_COLOR: \"#abc9ff\",\n KEYWORD_COLOR: \"#ff7085\",\n CONTROL_FLOW_KEYWORD_COLOR: \"#ff7085\",\n BASE_TYPE_COLOR: \"#42ffc2\",\n ENGINE_TYPE_COLOR: \"#8fffdb\",\n USER_TYPE_COLOR: \"#c7ffed\",\n COMMENT_COLOR: \"#cdcfd280\",\n STRING_COLOR: \"#ffeda1\",\n BACKGROUND_COLOR: \"#1d2229\",\n COMPLETION_BACKGROUND_COLOR: \"#363d4a\",\n COMPLETION_SELECTED_COLOR: \"#ffffff12\",\n COMPLETION_EXISTING_COLOR: \"#ffffff24\",\n COMPLETION_SCROLL_COLOR: \"#ffffff4a\",\n COMPLETION_SCROLL_HOVERED_COLOR: \"#ffffff66\",\n COMPLETION_FONT_COLOR: \"#cdcfd2\",\n TEXT_COLOR: \"#cdcfd2\",\n LINE_NUMBER_COLOR: \"#cdcfd280\",\n SAFE_LINE_NUMBER_COLOR: \"#cdf8d2bf\",\n CARET_COLOR: \"#ffffff\",\n CARET_BACKGROUND_COLOR: \"#000000\",\n TEXT_SELECTED_COLOR: \"#00000000\",\n SELECTION_COLOR: \"#70bafa66\",\n BRACE_MISMATCH_COLOR: \"#ff786b\",\n CURRENT_LINE_COLOR: \"#ffffff12\",\n LINE_LENGTH_GUIDELINE_COLOR: \"#363d4a\",\n WORD_HIGHLIGHTED_COLOR: \"#ffffff12\",\n NUMBER_COLOR: \"#a1ffe0\",\n FUNCTION_COLOR: \"#57b3ff\",\n MEMBER_VARIABLE_COLOR: \"#bce0ff\",\n MARK_COLOR: \"#ff786b4d\",\n BOOKMARK_COLOR: \"#147dfa\",\n BREAKPOINT_COLOR: \"#ff786b\",\n EXECUTING_LINE_COLOR: \"#fae345\",\n CODE_FOLDING_COLOR: \"#ffffff45\",\n SEARCH_RESULT_COLOR: \"#ffffff12\",\n SEARCH_RESULT_BORDER_COLOR: \"#699ce861\",\n} as const;\n\nexport const GdScript = {\n FUNCTION_DEFINITION_COLOR: \"#66e6ff\",\n GLOBAL_FUNCTION_COLOR: \"#a3a3f5\",\n NODE_PATH_COLOR: \"#b8c47d\",\n NODE_REFERENCE_COLOR: \"#63c259\",\n ANNOTATION_COLOR: \"#ffb373\",\n STRING_NAME_COLOR: \"#ffc2a6\",\n} as const;\n\nexport const CommentMarkers = {\n CRITICAL_COLOR: \"#c45959\",\n WARNING_COLOR: \"#b89c7a\",\n NOTICE_COLOR: \"#8fab82\",\n CRITICAL_LIST: [\n \"ALERT\",\n \"ATTENTION\",\n \"CAUTION\",\n \"CRITICAL\",\n \"DANGER\",\n \"SECURITY\",\n ],\n WARNING_LIST: [\n \"BUG\",\n \"DEPRECATED\",\n \"FIXME\",\n \"HACK\",\n \"TASK\",\n \"TBD\",\n \"TODO\",\n \"WARNING\",\n ],\n NOTICE_LIST: [\"INFO\", \"NOTE\", \"NOTICE\", \"TEST\", \"TESTING\"],\n} as const;\n", "import Color from \"color\";\n\nexport function invertLightness(color: string): string {\n const baseColor = Color(color);\n const newColor = baseColor.black(baseColor.white()).white(baseColor.black());\n return newColor.hex();\n}\n", "import { relative, join } from \"path-browserify\";\nimport { BlobReader, BlobWriter, ZipReader } from \"@zip.js/zip.js\";\n\nexport interface GdProjectSettings {\n width: number;\n height: number;\n}\n\nexport interface GdExerciseFile {\n type: \"FILE\";\n path: string;\n data: ArrayBuffer;\n original: ArrayBuffer;\n size: number;\n focus?: boolean;\n}\n\nexport interface GdExerciseDirectory {\n type: \"DIRECTORY\";\n path: string;\n}\n\nexport interface GdExerciseLog {\n type:\n | \"test\"\n | \"tester\"\n | \"requirement\"\n | \"requirement_methods\"\n | \"requirement_properties\"\n | \"requirement_signals\"\n | \"requirement_constants\"\n | \"requirement_nodes\";\n status: \"done\" | \"pass\" | \"fail\" | \"skip\" | \"title\";\n path: string;\n message: string;\n}\n\nexport function assert(\n value: unknown,\n message?: string | Error\n): asserts value {\n // eslint-disable-next-line no-extra-boolean-cast\n if (Boolean(value)) {\n return;\n }\n if (message instanceof Error) {\n throw message;\n }\n throw new Error(message);\n}\n\nexport async function wait(ms: number): Promise {\n await new Promise((resolve, _reject) => {\n setTimeout(() => {\n resolve(undefined);\n }, ms);\n });\n}\n\nexport function convertAbsoluteToRes(path: string, projectId: string): string {\n const relativePath = relative(path, `/home/web_user/projects/${projectId}/`);\n return `res://${relativePath}`;\n}\n\nexport function convertResToAbsolute(path: string, projectId: string): string {\n const RES_PREFIX = \"res://\";\n if (!path.startsWith(RES_PREFIX)) {\n throw new Error(`Path \"${path}\" does not start with \"res://\"`);\n }\n const pathWithoutRes = path.slice(RES_PREFIX.length);\n return `/home/web_user/projects/${projectId}/${pathWithoutRes}`;\n}\n\nexport function getChannelId(projectId: string): string {\n return `gd-exercise-${projectId}`;\n}\n\nexport async function getProjectFiles(\n projectUrl: string\n): Promise> {\n const files = new Map();\n\n const response = await fetch(projectUrl);\n if (response.body == null) {\n throw new Error(`Could not get file \"${projectUrl}\"`);\n }\n\n const data = await response.blob();\n const zipFileReader = new BlobReader(data);\n const zipReader = new ZipReader(zipFileReader);\n\n assert(\n data.type === \"application/zip\",\n `Downloaded data type (for \"${projectUrl}\") is not \"application/zip\", is \"${data.type}\"`\n );\n\n for await (const entry of zipReader.getEntriesGenerator()) {\n let file: GdExerciseFile | GdExerciseDirectory;\n if (entry.directory) {\n const entryFile: GdExerciseDirectory = {\n type: \"DIRECTORY\",\n path: entry.filename,\n };\n file = entryFile;\n } else {\n const writer = new BlobWriter();\n assert(entry.getData != null, \"entry.getData is null\");\n const blob = await entry.getData(writer);\n const entryFile: GdExerciseFile = {\n type: \"FILE\",\n path: entry.filename,\n data: await blob.arrayBuffer(),\n original: await blob.arrayBuffer(),\n size: entry.uncompressedSize,\n };\n file = entryFile;\n }\n files.set(file.path, file);\n }\n await zipReader.close();\n return files;\n}\n\nexport function getProjectSettings(\n projectSettingsFile: GdExerciseFile\n): GdProjectSettings {\n let width = 1152;\n let height = 648;\n\n const textDecoder = new TextDecoder();\n const lines = textDecoder.decode(projectSettingsFile.data);\n for (const line of lines.split(\"\\n\")) {\n if (line.startsWith(\"window/size/viewport_width\")) {\n width = parseInt(line.slice(line.lastIndexOf(\"=\") + 1));\n } else if (line.startsWith(\"window/size/viewport_height\")) {\n height = parseInt(line.slice(line.lastIndexOf(\"=\") + 1));\n }\n }\n\n return {\n width,\n height,\n };\n}\n\nexport function getCompletePath(projectId: string, path: string): string {\n return join(\"/home/web_user/projects\", projectId, path);\n}\n\nexport function cloneFile(file: GdExerciseFile): GdExerciseFile {\n const data = new ArrayBuffer(file.data.byteLength);\n new Uint8Array(data).set(new Uint8Array(file.data));\n const original = new ArrayBuffer(file.original.byteLength);\n new Uint8Array(original).set(new Uint8Array(file.original));\n return {\n type: \"FILE\",\n path: file.path,\n data,\n original,\n size: file.size,\n };\n}\n", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/*\n * This program is based on JZlib 1.0.2 ymnk, JCraft,Inc.\n * JZlib is based on zlib-1.1.3, so all credit should go authors\n * Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)\n * and contributors of zlib.\n */\n\n// deno-lint-ignore-file no-this-alias prefer-const\n\n// Global\n\nconst MAX_BITS = 15;\nconst D_CODES = 30;\nconst BL_CODES = 19;\n\nconst LENGTH_CODES = 29;\nconst LITERALS = 256;\nconst L_CODES = (LITERALS + 1 + LENGTH_CODES);\nconst HEAP_SIZE = (2 * L_CODES + 1);\n\nconst END_BLOCK = 256;\n\n// Bit length codes must not exceed MAX_BL_BITS bits\nconst MAX_BL_BITS = 7;\n\n// repeat previous bit length 3-6 times (2 bits of repeat count)\nconst REP_3_6 = 16;\n\n// repeat a zero length 3-10 times (3 bits of repeat count)\nconst REPZ_3_10 = 17;\n\n// repeat a zero length 11-138 times (7 bits of repeat count)\nconst REPZ_11_138 = 18;\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\n// length codes.\n\nconst Buf_size = 8 * 2;\n\n// JZlib version : \"1.0.2\"\nconst Z_DEFAULT_COMPRESSION = -1;\n\n// compression strategy\nconst Z_FILTERED = 1;\nconst Z_HUFFMAN_ONLY = 2;\nconst Z_DEFAULT_STRATEGY = 0;\n\nconst Z_NO_FLUSH = 0;\nconst Z_PARTIAL_FLUSH = 1;\nconst Z_FULL_FLUSH = 3;\nconst Z_FINISH = 4;\n\nconst Z_OK = 0;\nconst Z_STREAM_END = 1;\nconst Z_NEED_DICT = 2;\nconst Z_STREAM_ERROR = -2;\nconst Z_DATA_ERROR = -3;\nconst Z_BUF_ERROR = -5;\n\n// Tree\n\nfunction extractArray(array) {\n\treturn flatArray(array.map(([length, value]) => (new Array(length)).fill(value, 0, length)));\n}\n\nfunction flatArray(array) {\n\treturn array.reduce((a, b) => a.concat(Array.isArray(b) ? flatArray(b) : b), []);\n}\n\n// see definition of array dist_code below\nconst _dist_code = [0, 1, 2, 3].concat(...extractArray([\n\t[2, 4], [2, 5], [4, 6], [4, 7], [8, 8], [8, 9], [16, 10], [16, 11], [32, 12], [32, 13], [64, 14], [64, 15], [2, 0], [1, 16],\n\t[1, 17], [2, 18], [2, 19], [4, 20], [4, 21], [8, 22], [8, 23], [16, 24], [16, 25], [32, 26], [32, 27], [64, 28], [64, 29]\n]));\n\nfunction Tree() {\n\tconst that = this;\n\n\t// dyn_tree; // the dynamic tree\n\t// max_code; // largest code with non zero frequency\n\t// stat_desc; // the corresponding static tree\n\n\t// Compute the optimal bit lengths for a tree and update the total bit\n\t// length\n\t// for the current block.\n\t// IN assertion: the fields freq and dad are set, heap[heap_max] and\n\t// above are the tree nodes sorted by increasing frequency.\n\t// OUT assertions: the field len is set to the optimal bit length, the\n\t// array bl_count contains the frequencies for each bit length.\n\t// The length opt_len is updated; static_len is also updated if stree is\n\t// not null.\n\tfunction gen_bitlen(s) {\n\t\tconst tree = that.dyn_tree;\n\t\tconst stree = that.stat_desc.static_tree;\n\t\tconst extra = that.stat_desc.extra_bits;\n\t\tconst base = that.stat_desc.extra_base;\n\t\tconst max_length = that.stat_desc.max_length;\n\t\tlet h; // heap index\n\t\tlet n, m; // iterate over the tree elements\n\t\tlet bits; // bit length\n\t\tlet xbits; // extra bits\n\t\tlet f; // frequency\n\t\tlet overflow = 0; // number of elements with bit length too large\n\n\t\tfor (bits = 0; bits <= MAX_BITS; bits++)\n\t\t\ts.bl_count[bits] = 0;\n\n\t\t// In a first pass, compute the optimal bit lengths (which may\n\t\t// overflow in the case of the bit length tree).\n\t\ttree[s.heap[s.heap_max] * 2 + 1] = 0; // root of the heap\n\n\t\tfor (h = s.heap_max + 1; h < HEAP_SIZE; h++) {\n\t\t\tn = s.heap[h];\n\t\t\tbits = tree[tree[n * 2 + 1] * 2 + 1] + 1;\n\t\t\tif (bits > max_length) {\n\t\t\t\tbits = max_length;\n\t\t\t\toverflow++;\n\t\t\t}\n\t\t\ttree[n * 2 + 1] = bits;\n\t\t\t// We overwrite tree[n*2+1] which is no longer needed\n\n\t\t\tif (n > that.max_code)\n\t\t\t\tcontinue; // not a leaf node\n\n\t\t\ts.bl_count[bits]++;\n\t\t\txbits = 0;\n\t\t\tif (n >= base)\n\t\t\t\txbits = extra[n - base];\n\t\t\tf = tree[n * 2];\n\t\t\ts.opt_len += f * (bits + xbits);\n\t\t\tif (stree)\n\t\t\t\ts.static_len += f * (stree[n * 2 + 1] + xbits);\n\t\t}\n\t\tif (overflow === 0)\n\t\t\treturn;\n\n\t\t// This happens for example on obj2 and pic of the Calgary corpus\n\t\t// Find the first bit length which could increase:\n\t\tdo {\n\t\t\tbits = max_length - 1;\n\t\t\twhile (s.bl_count[bits] === 0)\n\t\t\t\tbits--;\n\t\t\ts.bl_count[bits]--; // move one leaf down the tree\n\t\t\ts.bl_count[bits + 1] += 2; // move one overflow item as its brother\n\t\t\ts.bl_count[max_length]--;\n\t\t\t// The brother of the overflow item also moves one step up,\n\t\t\t// but this does not affect bl_count[max_length]\n\t\t\toverflow -= 2;\n\t\t} while (overflow > 0);\n\n\t\tfor (bits = max_length; bits !== 0; bits--) {\n\t\t\tn = s.bl_count[bits];\n\t\t\twhile (n !== 0) {\n\t\t\t\tm = s.heap[--h];\n\t\t\t\tif (m > that.max_code)\n\t\t\t\t\tcontinue;\n\t\t\t\tif (tree[m * 2 + 1] != bits) {\n\t\t\t\t\ts.opt_len += (bits - tree[m * 2 + 1]) * tree[m * 2];\n\t\t\t\t\ttree[m * 2 + 1] = bits;\n\t\t\t\t}\n\t\t\t\tn--;\n\t\t\t}\n\t\t}\n\t}\n\n\t// Reverse the first len bits of a code, using straightforward code (a\n\t// faster\n\t// method would use a table)\n\t// IN assertion: 1 <= len <= 15\n\tfunction bi_reverse(code, // the value to invert\n\t\tlen // its bit length\n\t) {\n\t\tlet res = 0;\n\t\tdo {\n\t\t\tres |= code & 1;\n\t\t\tcode >>>= 1;\n\t\t\tres <<= 1;\n\t\t} while (--len > 0);\n\t\treturn res >>> 1;\n\t}\n\n\t// Generate the codes for a given tree and bit counts (which need not be\n\t// optimal).\n\t// IN assertion: the array bl_count contains the bit length statistics for\n\t// the given tree and the field len is set for all tree elements.\n\t// OUT assertion: the field code is set for all tree elements of non\n\t// zero code length.\n\tfunction gen_codes(tree, // the tree to decorate\n\t\tmax_code, // largest code with non zero frequency\n\t\tbl_count // number of codes at each bit length\n\t) {\n\t\tconst next_code = []; // next code value for each\n\t\t// bit length\n\t\tlet code = 0; // running code value\n\t\tlet bits; // bit index\n\t\tlet n; // code index\n\t\tlet len;\n\n\t\t// The distribution counts are first used to generate the code values\n\t\t// without bit reversal.\n\t\tfor (bits = 1; bits <= MAX_BITS; bits++) {\n\t\t\tnext_code[bits] = code = ((code + bl_count[bits - 1]) << 1);\n\t\t}\n\n\t\t// Check that the bit counts in bl_count are consistent. The last code\n\t\t// must be all ones.\n\t\t// Assert (code + bl_count[MAX_BITS]-1 == (1<= 1; n--)\n\t\t\ts.pqdownheap(tree, n);\n\n\t\t// Construct the Huffman tree by repeatedly combining the least two\n\t\t// frequent nodes.\n\n\t\tnode = elems; // next internal node of the tree\n\t\tdo {\n\t\t\t// n = node of least frequency\n\t\t\tn = s.heap[1];\n\t\t\ts.heap[1] = s.heap[s.heap_len--];\n\t\t\ts.pqdownheap(tree, 1);\n\t\t\tm = s.heap[1]; // m = node of next least frequency\n\n\t\t\ts.heap[--s.heap_max] = n; // keep the nodes sorted by frequency\n\t\t\ts.heap[--s.heap_max] = m;\n\n\t\t\t// Create a new node father of n and m\n\t\t\ttree[node * 2] = (tree[n * 2] + tree[m * 2]);\n\t\t\ts.depth[node] = Math.max(s.depth[n], s.depth[m]) + 1;\n\t\t\ttree[n * 2 + 1] = tree[m * 2 + 1] = node;\n\n\t\t\t// and insert the new node in the heap\n\t\t\ts.heap[1] = node++;\n\t\t\ts.pqdownheap(tree, 1);\n\t\t} while (s.heap_len >= 2);\n\n\t\ts.heap[--s.heap_max] = s.heap[1];\n\n\t\t// At this point, the fields freq and dad are set. We can now\n\t\t// generate the bit lengths.\n\n\t\tgen_bitlen(s);\n\n\t\t// The field len is now set, we can generate the bit codes\n\t\tgen_codes(tree, that.max_code, s.bl_count);\n\t};\n\n}\n\nTree._length_code = [0, 1, 2, 3, 4, 5, 6, 7].concat(...extractArray([\n\t[2, 8], [2, 9], [2, 10], [2, 11], [4, 12], [4, 13], [4, 14], [4, 15], [8, 16], [8, 17], [8, 18], [8, 19],\n\t[16, 20], [16, 21], [16, 22], [16, 23], [32, 24], [32, 25], [32, 26], [31, 27], [1, 28]]));\n\nTree.base_length = [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 20, 24, 28, 32, 40, 48, 56, 64, 80, 96, 112, 128, 160, 192, 224, 0];\n\nTree.base_dist = [0, 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 192, 256, 384, 512, 768, 1024, 1536, 2048, 3072, 4096, 6144, 8192, 12288, 16384,\n\t24576];\n\n// Mapping from a distance to a distance code. dist is the distance - 1 and\n// must not have side effects. _dist_code[256] and _dist_code[257] are never\n// used.\nTree.d_code = function (dist) {\n\treturn ((dist) < 256 ? _dist_code[dist] : _dist_code[256 + ((dist) >>> 7)]);\n};\n\n// extra bits for each length code\nTree.extra_lbits = [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\n// extra bits for each distance code\nTree.extra_dbits = [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\n// extra bits for each bit length code\nTree.extra_blbits = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7];\n\nTree.bl_order = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];\n\n// StaticTree\n\nfunction StaticTree(static_tree, extra_bits, extra_base, elems, max_length) {\n\tconst that = this;\n\tthat.static_tree = static_tree;\n\tthat.extra_bits = extra_bits;\n\tthat.extra_base = extra_base;\n\tthat.elems = elems;\n\tthat.max_length = max_length;\n}\n\nconst static_ltree2_first_part = [12, 140, 76, 204, 44, 172, 108, 236, 28, 156, 92, 220, 60, 188, 124, 252, 2, 130, 66, 194, 34, 162, 98, 226, 18, 146, 82,\n\t210, 50, 178, 114, 242, 10, 138, 74, 202, 42, 170, 106, 234, 26, 154, 90, 218, 58, 186, 122, 250, 6, 134, 70, 198, 38, 166, 102, 230, 22, 150, 86,\n\t214, 54, 182, 118, 246, 14, 142, 78, 206, 46, 174, 110, 238, 30, 158, 94, 222, 62, 190, 126, 254, 1, 129, 65, 193, 33, 161, 97, 225, 17, 145, 81,\n\t209, 49, 177, 113, 241, 9, 137, 73, 201, 41, 169, 105, 233, 25, 153, 89, 217, 57, 185, 121, 249, 5, 133, 69, 197, 37, 165, 101, 229, 21, 149, 85,\n\t213, 53, 181, 117, 245, 13, 141, 77, 205, 45, 173, 109, 237, 29, 157, 93, 221, 61, 189, 125, 253, 19, 275, 147, 403, 83, 339, 211, 467, 51, 307,\n\t179, 435, 115, 371, 243, 499, 11, 267, 139, 395, 75, 331, 203, 459, 43, 299, 171, 427, 107, 363, 235, 491, 27, 283, 155, 411, 91, 347, 219, 475,\n\t59, 315, 187, 443, 123, 379, 251, 507, 7, 263, 135, 391, 71, 327, 199, 455, 39, 295, 167, 423, 103, 359, 231, 487, 23, 279, 151, 407, 87, 343, 215,\n\t471, 55, 311, 183, 439, 119, 375, 247, 503, 15, 271, 143, 399, 79, 335, 207, 463, 47, 303, 175, 431, 111, 367, 239, 495, 31, 287, 159, 415, 95,\n\t351, 223, 479, 63, 319, 191, 447, 127, 383, 255, 511, 0, 64, 32, 96, 16, 80, 48, 112, 8, 72, 40, 104, 24, 88, 56, 120, 4, 68, 36, 100, 20, 84, 52,\n\t116, 3, 131, 67, 195, 35, 163, 99, 227];\nconst static_ltree2_second_part = extractArray([[144, 8], [112, 9], [24, 7], [8, 8]]);\nStaticTree.static_ltree = flatArray(static_ltree2_first_part.map((value, index) => [value, static_ltree2_second_part[index]]));\n\nconst static_dtree_first_part = [0, 16, 8, 24, 4, 20, 12, 28, 2, 18, 10, 26, 6, 22, 14, 30, 1, 17, 9, 25, 5, 21, 13, 29, 3, 19, 11, 27, 7, 23];\nconst static_dtree_second_part = extractArray([[30, 5]]);\nStaticTree.static_dtree = flatArray(static_dtree_first_part.map((value, index) => [value, static_dtree_second_part[index]]));\n\nStaticTree.static_l_desc = new StaticTree(StaticTree.static_ltree, Tree.extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);\n\nStaticTree.static_d_desc = new StaticTree(StaticTree.static_dtree, Tree.extra_dbits, 0, D_CODES, MAX_BITS);\n\nStaticTree.static_bl_desc = new StaticTree(null, Tree.extra_blbits, 0, BL_CODES, MAX_BL_BITS);\n\n// Deflate\n\nconst MAX_MEM_LEVEL = 9;\nconst DEF_MEM_LEVEL = 8;\n\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\tconst that = this;\n\tthat.good_length = good_length;\n\tthat.max_lazy = max_lazy;\n\tthat.nice_length = nice_length;\n\tthat.max_chain = max_chain;\n\tthat.func = func;\n}\n\nconst STORED = 0;\nconst FAST = 1;\nconst SLOW = 2;\nconst config_table = [\n\tnew Config(0, 0, 0, 0, STORED),\n\tnew Config(4, 4, 8, 4, FAST),\n\tnew Config(4, 5, 16, 8, FAST),\n\tnew Config(4, 6, 32, 32, FAST),\n\tnew Config(4, 4, 16, 16, SLOW),\n\tnew Config(8, 16, 32, 32, SLOW),\n\tnew Config(8, 16, 128, 128, SLOW),\n\tnew Config(8, 32, 128, 256, SLOW),\n\tnew Config(32, 128, 258, 1024, SLOW),\n\tnew Config(32, 258, 258, 4096, SLOW)\n];\n\nconst z_errmsg = [\"need dictionary\", // Z_NEED_DICT\n\t// 2\n\t\"stream end\", // Z_STREAM_END 1\n\t\"\", // Z_OK 0\n\t\"\", // Z_ERRNO (-1)\n\t\"stream error\", // Z_STREAM_ERROR (-2)\n\t\"data error\", // Z_DATA_ERROR (-3)\n\t\"\", // Z_MEM_ERROR (-4)\n\t\"buffer error\", // Z_BUF_ERROR (-5)\n\t\"\",// Z_VERSION_ERROR (-6)\n\t\"\"];\n\n// block not completed, need more input or more output\nconst NeedMore = 0;\n\n// block flush performed\nconst BlockDone = 1;\n\n// finish started, need only more output at next deflate\nconst FinishStarted = 2;\n\n// finish done, accept no more input or output\nconst FinishDone = 3;\n\n// preset dictionary flag in zlib header\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE = 42;\nconst BUSY_STATE = 113;\nconst FINISH_STATE = 666;\n\n// The deflate compression method\nconst Z_DEFLATED = 8;\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES = 2;\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nfunction smaller(tree, n, m, depth) {\n\tconst tn2 = tree[n * 2];\n\tconst tm2 = tree[m * 2];\n\treturn (tn2 < tm2 || (tn2 == tm2 && depth[n] <= depth[m]));\n}\n\nfunction Deflate() {\n\n\tconst that = this;\n\tlet strm; // pointer back to this zlib stream\n\tlet status; // as the name implies\n\t// pending_buf; // output still pending\n\tlet pending_buf_size; // size of pending_buf\n\t// pending_out; // next pending byte to output to the stream\n\t// pending; // nb of bytes in the pending buffer\n\n\t// dist_buf; // buffer for distances\n\t// lc_buf; // buffer for literals or lengths\n\t// To simplify the code, dist_buf and lc_buf have the same number of elements.\n\t// To use different lengths, an extra flag array would be necessary.\n\n\tlet last_flush; // value of flush param for previous deflate call\n\n\tlet w_size; // LZ77 win size (32K by default)\n\tlet w_bits; // log2(w_size) (8..16)\n\tlet w_mask; // w_size - 1\n\n\tlet win;\n\t// Sliding win. Input bytes are read into the second half of the win,\n\t// and move to the first half later to keep a dictionary of at least wSize\n\t// bytes. With this organization, matches are limited to a distance of\n\t// wSize-MAX_MATCH bytes, but this ensures that IO is always\n\t// performed with a length multiple of the block size. Also, it limits\n\t// the win size to 64K, which is quite useful on MSDOS.\n\t// To do: use the user input buffer as sliding win.\n\n\tlet window_size;\n\t// Actual size of win: 2*wSize, except when the user input buffer\n\t// is directly used as sliding win.\n\n\tlet prev;\n\t// Link to older string with same hash index. To limit the size of this\n\t// array to 64K, this link is maintained only for the last 32K strings.\n\t// An index in this array is thus a win index modulo 32K.\n\n\tlet head; // Heads of the hash chains or NIL.\n\n\tlet ins_h; // hash index of string to be inserted\n\tlet hash_size; // number of elements in hash table\n\tlet hash_bits; // log2(hash_size)\n\tlet hash_mask; // hash_size-1\n\n\t// Number of bits by which ins_h must be shifted at each input\n\t// step. It must be such that after MIN_MATCH steps, the oldest\n\t// byte no longer takes part in the hash key, that is:\n\t// hash_shift * MIN_MATCH >= hash_bits\n\tlet hash_shift;\n\n\t// Window position at the beginning of the current output block. Gets\n\t// negative when the win is moved backwards.\n\n\tlet block_start;\n\n\tlet match_length; // length of best match\n\tlet prev_match; // previous match\n\tlet match_available; // set if previous match exists\n\tlet strstart; // start of string to insert\n\tlet match_start; // start of matching string\n\tlet lookahead; // number of valid bytes ahead in win\n\n\t// Length of the best match at previous step. Matches not greater than this\n\t// are discarded. This is used in the lazy match evaluation.\n\tlet prev_length;\n\n\t// To speed up deflation, hash chains are never searched beyond this\n\t// length. A higher limit improves compression ratio but degrades the speed.\n\tlet max_chain_length;\n\n\t// Attempt to find a better match only when the current match is strictly\n\t// smaller than this value. This mechanism is used only for compression\n\t// levels >= 4.\n\tlet max_lazy_match;\n\n\t// Insert new strings in the hash table only if the match length is not\n\t// greater than this length. This saves time but degrades compression.\n\t// max_insert_length is used only for compression levels <= 3.\n\n\tlet level; // compression level (1..9)\n\tlet strategy; // favor or force Huffman coding\n\n\t// Use a faster search when the previous match is longer than this\n\tlet good_match;\n\n\t// Stop searching when current match exceeds this\n\tlet nice_match;\n\n\tlet dyn_ltree; // literal and length tree\n\tlet dyn_dtree; // distance tree\n\tlet bl_tree; // Huffman tree for bit lengths\n\n\tconst l_desc = new Tree(); // desc for literal tree\n\tconst d_desc = new Tree(); // desc for distance tree\n\tconst bl_desc = new Tree(); // desc for bit length tree\n\n\t// that.heap_len; // number of elements in the heap\n\t// that.heap_max; // element of largest frequency\n\t// The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n\t// The same heap array is used to build all trees.\n\n\t// Depth of each subtree used as tie breaker for trees of equal frequency\n\tthat.depth = [];\n\n\t// Size of match buffer for literals/lengths. There are 4 reasons for\n\t// limiting lit_bufsize to 64K:\n\t// - frequencies can be kept in 16 bit counters\n\t// - if compression is not successful for the first block, all input\n\t// data is still in the win so we can still emit a stored block even\n\t// when input comes from standard input. (This can also be done for\n\t// all blocks if lit_bufsize is not greater than 32K.)\n\t// - if compression is not successful for a file smaller than 64K, we can\n\t// even emit a stored file instead of a stored block (saving 5 bytes).\n\t// This is applicable only for zip (not gzip or zlib).\n\t// - creating new Huffman trees less frequently may not provide fast\n\t// adaptation to changes in the input data statistics. (Take for\n\t// example a binary file with poorly compressible code followed by\n\t// a highly compressible string table.) Smaller buffer sizes give\n\t// fast adaptation but have of course the overhead of transmitting\n\t// trees more frequently.\n\t// - I can't count above 4\n\tlet lit_bufsize;\n\n\tlet last_lit; // running index in dist_buf and lc_buf\n\n\t// that.opt_len; // bit length of current block with optimal trees\n\t// that.static_len; // bit length of current block with static trees\n\tlet matches; // number of string matches in current block\n\tlet last_eob_len; // bit length of EOB code for last block\n\n\t// Output buffer. bits are inserted starting at the bottom (least\n\t// significant bits).\n\tlet bi_buf;\n\n\t// Number of valid bits in bi_buf. All bits above the last valid bit\n\t// are always zero.\n\tlet bi_valid;\n\n\t// number of codes at each bit length for an optimal tree\n\tthat.bl_count = [];\n\n\t// heap used to build the Huffman trees\n\tthat.heap = [];\n\n\tdyn_ltree = [];\n\tdyn_dtree = [];\n\tbl_tree = [];\n\n\tfunction lm_init() {\n\t\twindow_size = 2 * w_size;\n\n\t\thead[hash_size - 1] = 0;\n\t\tfor (let i = 0; i < hash_size - 1; i++) {\n\t\t\thead[i] = 0;\n\t\t}\n\n\t\t// Set the default configuration parameters:\n\t\tmax_lazy_match = config_table[level].max_lazy;\n\t\tgood_match = config_table[level].good_length;\n\t\tnice_match = config_table[level].nice_length;\n\t\tmax_chain_length = config_table[level].max_chain;\n\n\t\tstrstart = 0;\n\t\tblock_start = 0;\n\t\tlookahead = 0;\n\t\tmatch_length = prev_length = MIN_MATCH - 1;\n\t\tmatch_available = 0;\n\t\tins_h = 0;\n\t}\n\n\tfunction init_block() {\n\t\tlet i;\n\t\t// Initialize the trees.\n\t\tfor (i = 0; i < L_CODES; i++)\n\t\t\tdyn_ltree[i * 2] = 0;\n\t\tfor (i = 0; i < D_CODES; i++)\n\t\t\tdyn_dtree[i * 2] = 0;\n\t\tfor (i = 0; i < BL_CODES; i++)\n\t\t\tbl_tree[i * 2] = 0;\n\n\t\tdyn_ltree[END_BLOCK * 2] = 1;\n\t\tthat.opt_len = that.static_len = 0;\n\t\tlast_lit = matches = 0;\n\t}\n\n\t// Initialize the tree data structures for a new zlib stream.\n\tfunction tr_init() {\n\n\t\tl_desc.dyn_tree = dyn_ltree;\n\t\tl_desc.stat_desc = StaticTree.static_l_desc;\n\n\t\td_desc.dyn_tree = dyn_dtree;\n\t\td_desc.stat_desc = StaticTree.static_d_desc;\n\n\t\tbl_desc.dyn_tree = bl_tree;\n\t\tbl_desc.stat_desc = StaticTree.static_bl_desc;\n\n\t\tbi_buf = 0;\n\t\tbi_valid = 0;\n\t\tlast_eob_len = 8; // enough lookahead for inflate\n\n\t\t// Initialize the first block of the first file:\n\t\tinit_block();\n\t}\n\n\t// Restore the heap property by moving down the tree starting at node k,\n\t// exchanging a node with the smallest of its two sons if necessary,\n\t// stopping\n\t// when the heap property is re-established (each father smaller than its\n\t// two sons).\n\tthat.pqdownheap = function (tree, // the tree to restore\n\t\tk // node to move down\n\t) {\n\t\tconst heap = that.heap;\n\t\tconst v = heap[k];\n\t\tlet j = k << 1; // left son of k\n\t\twhile (j <= that.heap_len) {\n\t\t\t// Set j to the smallest of the two sons:\n\t\t\tif (j < that.heap_len && smaller(tree, heap[j + 1], heap[j], that.depth)) {\n\t\t\t\tj++;\n\t\t\t}\n\t\t\t// Exit if v is smaller than both sons\n\t\t\tif (smaller(tree, v, heap[j], that.depth))\n\t\t\t\tbreak;\n\n\t\t\t// Exchange v with the smallest son\n\t\t\theap[k] = heap[j];\n\t\t\tk = j;\n\t\t\t// And continue down the tree, setting j to the left son of k\n\t\t\tj <<= 1;\n\t\t}\n\t\theap[k] = v;\n\t};\n\n\t// Scan a literal or distance tree to determine the frequencies of the codes\n\t// in the bit length tree.\n\tfunction scan_tree(tree,// the tree to be scanned\n\t\tmax_code // and its largest code of non zero frequency\n\t) {\n\t\tlet prevlen = -1; // last emitted length\n\t\tlet curlen; // length of current code\n\t\tlet nextlen = tree[0 * 2 + 1]; // length of next code\n\t\tlet count = 0; // repeat count of the current code\n\t\tlet max_count = 7; // max repeat count\n\t\tlet min_count = 4; // min repeat count\n\n\t\tif (nextlen === 0) {\n\t\t\tmax_count = 138;\n\t\t\tmin_count = 3;\n\t\t}\n\t\ttree[(max_code + 1) * 2 + 1] = 0xffff; // guard\n\n\t\tfor (let n = 0; n <= max_code; n++) {\n\t\t\tcurlen = nextlen;\n\t\t\tnextlen = tree[(n + 1) * 2 + 1];\n\t\t\tif (++count < max_count && curlen == nextlen) {\n\t\t\t\tcontinue;\n\t\t\t} else if (count < min_count) {\n\t\t\t\tbl_tree[curlen * 2] += count;\n\t\t\t} else if (curlen !== 0) {\n\t\t\t\tif (curlen != prevlen)\n\t\t\t\t\tbl_tree[curlen * 2]++;\n\t\t\t\tbl_tree[REP_3_6 * 2]++;\n\t\t\t} else if (count <= 10) {\n\t\t\t\tbl_tree[REPZ_3_10 * 2]++;\n\t\t\t} else {\n\t\t\t\tbl_tree[REPZ_11_138 * 2]++;\n\t\t\t}\n\t\t\tcount = 0;\n\t\t\tprevlen = curlen;\n\t\t\tif (nextlen === 0) {\n\t\t\t\tmax_count = 138;\n\t\t\t\tmin_count = 3;\n\t\t\t} else if (curlen == nextlen) {\n\t\t\t\tmax_count = 6;\n\t\t\t\tmin_count = 3;\n\t\t\t} else {\n\t\t\t\tmax_count = 7;\n\t\t\t\tmin_count = 4;\n\t\t\t}\n\t\t}\n\t}\n\n\t// Construct the Huffman tree for the bit lengths and return the index in\n\t// bl_order of the last bit length code to send.\n\tfunction build_bl_tree() {\n\t\tlet max_blindex; // index of last bit length code of non zero freq\n\n\t\t// Determine the bit length frequencies for literal and distance trees\n\t\tscan_tree(dyn_ltree, l_desc.max_code);\n\t\tscan_tree(dyn_dtree, d_desc.max_code);\n\n\t\t// Build the bit length tree:\n\t\tbl_desc.build_tree(that);\n\t\t// opt_len now includes the length of the tree representations, except\n\t\t// the lengths of the bit lengths codes and the 5+5+4 bits for the\n\t\t// counts.\n\n\t\t// Determine the number of bit length codes to send. The pkzip format\n\t\t// requires that at least 4 bit length codes be sent. (appnote.txt says\n\t\t// 3 but the actual value used is 4.)\n\t\tfor (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n\t\t\tif (bl_tree[Tree.bl_order[max_blindex] * 2 + 1] !== 0)\n\t\t\t\tbreak;\n\t\t}\n\t\t// Update opt_len to include the bit length tree and counts\n\t\tthat.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\n\t\treturn max_blindex;\n\t}\n\n\t// Output a byte on the stream.\n\t// IN assertion: there is enough room in pending_buf.\n\tfunction put_byte(p) {\n\t\tthat.pending_buf[that.pending++] = p;\n\t}\n\n\tfunction put_short(w) {\n\t\tput_byte(w & 0xff);\n\t\tput_byte((w >>> 8) & 0xff);\n\t}\n\n\tfunction putShortMSB(b) {\n\t\tput_byte((b >> 8) & 0xff);\n\t\tput_byte((b & 0xff) & 0xff);\n\t}\n\n\tfunction send_bits(value, length) {\n\t\tlet val;\n\t\tconst len = length;\n\t\tif (bi_valid > Buf_size - len) {\n\t\t\tval = value;\n\t\t\t// bi_buf |= (val << bi_valid);\n\t\t\tbi_buf |= ((val << bi_valid) & 0xffff);\n\t\t\tput_short(bi_buf);\n\t\t\tbi_buf = val >>> (Buf_size - bi_valid);\n\t\t\tbi_valid += len - Buf_size;\n\t\t} else {\n\t\t\t// bi_buf |= (value) << bi_valid;\n\t\t\tbi_buf |= (((value) << bi_valid) & 0xffff);\n\t\t\tbi_valid += len;\n\t\t}\n\t}\n\n\tfunction send_code(c, tree) {\n\t\tconst c2 = c * 2;\n\t\tsend_bits(tree[c2] & 0xffff, tree[c2 + 1] & 0xffff);\n\t}\n\n\t// Send a literal or distance tree in compressed form, using the codes in\n\t// bl_tree.\n\tfunction send_tree(tree,// the tree to be sent\n\t\tmax_code // and its largest code of non zero frequency\n\t) {\n\t\tlet n; // iterates over all tree elements\n\t\tlet prevlen = -1; // last emitted length\n\t\tlet curlen; // length of current code\n\t\tlet nextlen = tree[0 * 2 + 1]; // length of next code\n\t\tlet count = 0; // repeat count of the current code\n\t\tlet max_count = 7; // max repeat count\n\t\tlet min_count = 4; // min repeat count\n\n\t\tif (nextlen === 0) {\n\t\t\tmax_count = 138;\n\t\t\tmin_count = 3;\n\t\t}\n\n\t\tfor (n = 0; n <= max_code; n++) {\n\t\t\tcurlen = nextlen;\n\t\t\tnextlen = tree[(n + 1) * 2 + 1];\n\t\t\tif (++count < max_count && curlen == nextlen) {\n\t\t\t\tcontinue;\n\t\t\t} else if (count < min_count) {\n\t\t\t\tdo {\n\t\t\t\t\tsend_code(curlen, bl_tree);\n\t\t\t\t} while (--count !== 0);\n\t\t\t} else if (curlen !== 0) {\n\t\t\t\tif (curlen != prevlen) {\n\t\t\t\t\tsend_code(curlen, bl_tree);\n\t\t\t\t\tcount--;\n\t\t\t\t}\n\t\t\t\tsend_code(REP_3_6, bl_tree);\n\t\t\t\tsend_bits(count - 3, 2);\n\t\t\t} else if (count <= 10) {\n\t\t\t\tsend_code(REPZ_3_10, bl_tree);\n\t\t\t\tsend_bits(count - 3, 3);\n\t\t\t} else {\n\t\t\t\tsend_code(REPZ_11_138, bl_tree);\n\t\t\t\tsend_bits(count - 11, 7);\n\t\t\t}\n\t\t\tcount = 0;\n\t\t\tprevlen = curlen;\n\t\t\tif (nextlen === 0) {\n\t\t\t\tmax_count = 138;\n\t\t\t\tmin_count = 3;\n\t\t\t} else if (curlen == nextlen) {\n\t\t\t\tmax_count = 6;\n\t\t\t\tmin_count = 3;\n\t\t\t} else {\n\t\t\t\tmax_count = 7;\n\t\t\t\tmin_count = 4;\n\t\t\t}\n\t\t}\n\t}\n\n\t// Send the header for a block using dynamic Huffman trees: the counts, the\n\t// lengths of the bit length codes, the literal tree and the distance tree.\n\t// IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n\tfunction send_all_trees(lcodes, dcodes, blcodes) {\n\t\tlet rank; // index in bl_order\n\n\t\tsend_bits(lcodes - 257, 5); // not +255 as stated in appnote.txt\n\t\tsend_bits(dcodes - 1, 5);\n\t\tsend_bits(blcodes - 4, 4); // not -3 as stated in appnote.txt\n\t\tfor (rank = 0; rank < blcodes; rank++) {\n\t\t\tsend_bits(bl_tree[Tree.bl_order[rank] * 2 + 1], 3);\n\t\t}\n\t\tsend_tree(dyn_ltree, lcodes - 1); // literal tree\n\t\tsend_tree(dyn_dtree, dcodes - 1); // distance tree\n\t}\n\n\t// Flush the bit buffer, keeping at most 7 bits in it.\n\tfunction bi_flush() {\n\t\tif (bi_valid == 16) {\n\t\t\tput_short(bi_buf);\n\t\t\tbi_buf = 0;\n\t\t\tbi_valid = 0;\n\t\t} else if (bi_valid >= 8) {\n\t\t\tput_byte(bi_buf & 0xff);\n\t\t\tbi_buf >>>= 8;\n\t\t\tbi_valid -= 8;\n\t\t}\n\t}\n\n\t// Send one empty static block to give enough lookahead for inflate.\n\t// This takes 10 bits, of which 7 may remain in the bit buffer.\n\t// The current inflate code requires 9 bits of lookahead. If the\n\t// last two codes for the previous block (real code plus EOB) were coded\n\t// on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode\n\t// the last real code. In this case we send two empty static blocks instead\n\t// of one. (There are no problems if the previous block is stored or fixed.)\n\t// To simplify the code, we assume the worst case of last real code encoded\n\t// on one bit only.\n\tfunction _tr_align() {\n\t\tsend_bits(STATIC_TREES << 1, 3);\n\t\tsend_code(END_BLOCK, StaticTree.static_ltree);\n\n\t\tbi_flush();\n\n\t\t// Of the 10 bits for the empty block, we have already sent\n\t\t// (10 - bi_valid) bits. The lookahead for the last real code (before\n\t\t// the EOB of the previous block) was thus at least one plus the length\n\t\t// of the EOB plus what we have just sent of the empty static block.\n\t\tif (1 + last_eob_len + 10 - bi_valid < 9) {\n\t\t\tsend_bits(STATIC_TREES << 1, 3);\n\t\t\tsend_code(END_BLOCK, StaticTree.static_ltree);\n\t\t\tbi_flush();\n\t\t}\n\t\tlast_eob_len = 7;\n\t}\n\n\t// Save the match info and tally the frequency counts. Return true if\n\t// the current block must be flushed.\n\tfunction _tr_tally(dist, // distance of matched string\n\t\tlc // match length-MIN_MATCH or unmatched char (if dist==0)\n\t) {\n\t\tlet out_length, in_length, dcode;\n\t\tthat.dist_buf[last_lit] = dist;\n\t\tthat.lc_buf[last_lit] = lc & 0xff;\n\t\tlast_lit++;\n\n\t\tif (dist === 0) {\n\t\t\t// lc is the unmatched char\n\t\t\tdyn_ltree[lc * 2]++;\n\t\t} else {\n\t\t\tmatches++;\n\t\t\t// Here, lc is the match length - MIN_MATCH\n\t\t\tdist--; // dist = match distance - 1\n\t\t\tdyn_ltree[(Tree._length_code[lc] + LITERALS + 1) * 2]++;\n\t\t\tdyn_dtree[Tree.d_code(dist) * 2]++;\n\t\t}\n\n\t\tif ((last_lit & 0x1fff) === 0 && level > 2) {\n\t\t\t// Compute an upper bound for the compressed length\n\t\t\tout_length = last_lit * 8;\n\t\t\tin_length = strstart - block_start;\n\t\t\tfor (dcode = 0; dcode < D_CODES; dcode++) {\n\t\t\t\tout_length += dyn_dtree[dcode * 2] * (5 + Tree.extra_dbits[dcode]);\n\t\t\t}\n\t\t\tout_length >>>= 3;\n\t\t\tif ((matches < Math.floor(last_lit / 2)) && out_length < Math.floor(in_length / 2))\n\t\t\t\treturn true;\n\t\t}\n\n\t\treturn (last_lit == lit_bufsize - 1);\n\t\t// We avoid equality with lit_bufsize because of wraparound at 64K\n\t\t// on 16 bit machines and because stored blocks are restricted to\n\t\t// 64K-1 bytes.\n\t}\n\n\t// Send the block data compressed using the given Huffman trees\n\tfunction compress_block(ltree, dtree) {\n\t\tlet dist; // distance of matched string\n\t\tlet lc; // match length or unmatched char (if dist === 0)\n\t\tlet lx = 0; // running index in dist_buf and lc_buf\n\t\tlet code; // the code to send\n\t\tlet extra; // number of extra bits to send\n\n\t\tif (last_lit !== 0) {\n\t\t\tdo {\n\t\t\t\tdist = that.dist_buf[lx];\n\t\t\t\tlc = that.lc_buf[lx];\n\t\t\t\tlx++;\n\n\t\t\t\tif (dist === 0) {\n\t\t\t\t\tsend_code(lc, ltree); // send a literal byte\n\t\t\t\t} else {\n\t\t\t\t\t// Here, lc is the match length - MIN_MATCH\n\t\t\t\t\tcode = Tree._length_code[lc];\n\n\t\t\t\t\tsend_code(code + LITERALS + 1, ltree); // send the length\n\t\t\t\t\t// code\n\t\t\t\t\textra = Tree.extra_lbits[code];\n\t\t\t\t\tif (extra !== 0) {\n\t\t\t\t\t\tlc -= Tree.base_length[code];\n\t\t\t\t\t\tsend_bits(lc, extra); // send the extra length bits\n\t\t\t\t\t}\n\t\t\t\t\tdist--; // dist is now the match distance - 1\n\t\t\t\t\tcode = Tree.d_code(dist);\n\n\t\t\t\t\tsend_code(code, dtree); // send the distance code\n\t\t\t\t\textra = Tree.extra_dbits[code];\n\t\t\t\t\tif (extra !== 0) {\n\t\t\t\t\t\tdist -= Tree.base_dist[code];\n\t\t\t\t\t\tsend_bits(dist, extra); // send the extra distance bits\n\t\t\t\t\t}\n\t\t\t\t} // literal or match pair ?\n\t\t\t} while (lx < last_lit);\n\t\t}\n\n\t\tsend_code(END_BLOCK, ltree);\n\t\tlast_eob_len = ltree[END_BLOCK * 2 + 1];\n\t}\n\n\t// Flush the bit buffer and align the output on a byte boundary\n\tfunction bi_windup() {\n\t\tif (bi_valid > 8) {\n\t\t\tput_short(bi_buf);\n\t\t} else if (bi_valid > 0) {\n\t\t\tput_byte(bi_buf & 0xff);\n\t\t}\n\t\tbi_buf = 0;\n\t\tbi_valid = 0;\n\t}\n\n\t// Copy a stored block, storing first the length and its\n\t// one's complement if requested.\n\tfunction copy_block(buf, // the input data\n\t\tlen, // its length\n\t\theader // true if block header must be written\n\t) {\n\t\tbi_windup(); // align on byte boundary\n\t\tlast_eob_len = 8; // enough lookahead for inflate\n\n\t\tif (header) {\n\t\t\tput_short(len);\n\t\t\tput_short(~len);\n\t\t}\n\n\t\tthat.pending_buf.set(win.subarray(buf, buf + len), that.pending);\n\t\tthat.pending += len;\n\t}\n\n\t// Send a stored block\n\tfunction _tr_stored_block(buf, // input block\n\t\tstored_len, // length of input block\n\t\teof // true if this is the last block for a file\n\t) {\n\t\tsend_bits((STORED_BLOCK << 1) + (eof ? 1 : 0), 3); // send block type\n\t\tcopy_block(buf, stored_len, true); // with header\n\t}\n\n\t// Determine the best encoding for the current block: dynamic trees, static\n\t// trees or store, and output the encoded block to the zip file.\n\tfunction _tr_flush_block(buf, // input block, or NULL if too old\n\t\tstored_len, // length of input block\n\t\teof // true if this is the last block for a file\n\t) {\n\t\tlet opt_lenb, static_lenb;// opt_len and static_len in bytes\n\t\tlet max_blindex = 0; // index of last bit length code of non zero freq\n\n\t\t// Build the Huffman trees unless a stored block is forced\n\t\tif (level > 0) {\n\t\t\t// Construct the literal and distance trees\n\t\t\tl_desc.build_tree(that);\n\n\t\t\td_desc.build_tree(that);\n\n\t\t\t// At this point, opt_len and static_len are the total bit lengths\n\t\t\t// of\n\t\t\t// the compressed block data, excluding the tree representations.\n\n\t\t\t// Build the bit length tree for the above two trees, and get the\n\t\t\t// index\n\t\t\t// in bl_order of the last bit length code to send.\n\t\t\tmax_blindex = build_bl_tree();\n\n\t\t\t// Determine the best encoding. Compute first the block length in\n\t\t\t// bytes\n\t\t\topt_lenb = (that.opt_len + 3 + 7) >>> 3;\n\t\t\tstatic_lenb = (that.static_len + 3 + 7) >>> 3;\n\n\t\t\tif (static_lenb <= opt_lenb)\n\t\t\t\topt_lenb = static_lenb;\n\t\t} else {\n\t\t\topt_lenb = static_lenb = stored_len + 5; // force a stored block\n\t\t}\n\n\t\tif ((stored_len + 4 <= opt_lenb) && buf != -1) {\n\t\t\t// 4: two words for the lengths\n\t\t\t// The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n\t\t\t// Otherwise we can't have processed more than WSIZE input bytes\n\t\t\t// since\n\t\t\t// the last block flush, because compression would have been\n\t\t\t// successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n\t\t\t// transform a block into a stored block.\n\t\t\t_tr_stored_block(buf, stored_len, eof);\n\t\t} else if (static_lenb == opt_lenb) {\n\t\t\tsend_bits((STATIC_TREES << 1) + (eof ? 1 : 0), 3);\n\t\t\tcompress_block(StaticTree.static_ltree, StaticTree.static_dtree);\n\t\t} else {\n\t\t\tsend_bits((DYN_TREES << 1) + (eof ? 1 : 0), 3);\n\t\t\tsend_all_trees(l_desc.max_code + 1, d_desc.max_code + 1, max_blindex + 1);\n\t\t\tcompress_block(dyn_ltree, dyn_dtree);\n\t\t}\n\n\t\t// The above check is made mod 2^32, for files larger than 512 MB\n\t\t// and uLong implemented on 32 bits.\n\n\t\tinit_block();\n\n\t\tif (eof) {\n\t\t\tbi_windup();\n\t\t}\n\t}\n\n\tfunction flush_block_only(eof) {\n\t\t_tr_flush_block(block_start >= 0 ? block_start : -1, strstart - block_start, eof);\n\t\tblock_start = strstart;\n\t\tstrm.flush_pending();\n\t}\n\n\t// Fill the win when the lookahead becomes insufficient.\n\t// Updates strstart and lookahead.\n\t//\n\t// IN assertion: lookahead < MIN_LOOKAHEAD\n\t// OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n\t// At least one byte has been read, or avail_in === 0; reads are\n\t// performed for at least two bytes (required for the zip translate_eol\n\t// option -- not supported here).\n\tfunction fill_window() {\n\t\tlet n, m;\n\t\tlet p;\n\t\tlet more; // Amount of free space at the end of the win.\n\n\t\tdo {\n\t\t\tmore = (window_size - lookahead - strstart);\n\n\t\t\t// Deal with !@#$% 64K limit:\n\t\t\tif (more === 0 && strstart === 0 && lookahead === 0) {\n\t\t\t\tmore = w_size;\n\t\t\t} else if (more == -1) {\n\t\t\t\t// Very unlikely, but possible on 16 bit machine if strstart ==\n\t\t\t\t// 0\n\t\t\t\t// and lookahead == 1 (input done one byte at time)\n\t\t\t\tmore--;\n\n\t\t\t\t// If the win is almost full and there is insufficient\n\t\t\t\t// lookahead,\n\t\t\t\t// move the upper half to the lower one to make room in the\n\t\t\t\t// upper half.\n\t\t\t} else if (strstart >= w_size + w_size - MIN_LOOKAHEAD) {\n\t\t\t\twin.set(win.subarray(w_size, w_size + w_size), 0);\n\n\t\t\t\tmatch_start -= w_size;\n\t\t\t\tstrstart -= w_size; // we now have strstart >= MAX_DIST\n\t\t\t\tblock_start -= w_size;\n\n\t\t\t\t// Slide the hash table (could be avoided with 32 bit values\n\t\t\t\t// at the expense of memory usage). We slide even when level ==\n\t\t\t\t// 0\n\t\t\t\t// to keep the hash table consistent if we switch back to level\n\t\t\t\t// > 0\n\t\t\t\t// later. (Using level 0 permanently is not an optimal usage of\n\t\t\t\t// zlib, so we don't care about this pathological case.)\n\n\t\t\t\tn = hash_size;\n\t\t\t\tp = n;\n\t\t\t\tdo {\n\t\t\t\t\tm = (head[--p] & 0xffff);\n\t\t\t\t\thead[p] = (m >= w_size ? m - w_size : 0);\n\t\t\t\t} while (--n !== 0);\n\n\t\t\t\tn = w_size;\n\t\t\t\tp = n;\n\t\t\t\tdo {\n\t\t\t\t\tm = (prev[--p] & 0xffff);\n\t\t\t\t\tprev[p] = (m >= w_size ? m - w_size : 0);\n\t\t\t\t\t// If n is not on any hash chain, prev[n] is garbage but\n\t\t\t\t\t// its value will never be used.\n\t\t\t\t} while (--n !== 0);\n\t\t\t\tmore += w_size;\n\t\t\t}\n\n\t\t\tif (strm.avail_in === 0)\n\t\t\t\treturn;\n\n\t\t\t// If there was no sliding:\n\t\t\t// strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n\t\t\t// more == window_size - lookahead - strstart\n\t\t\t// => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n\t\t\t// => more >= window_size - 2*WSIZE + 2\n\t\t\t// In the BIG_MEM or MMAP case (not yet supported),\n\t\t\t// window_size == input_size + MIN_LOOKAHEAD &&\n\t\t\t// strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n\t\t\t// Otherwise, window_size == 2*WSIZE so more >= 2.\n\t\t\t// If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n\n\t\t\tn = strm.read_buf(win, strstart + lookahead, more);\n\t\t\tlookahead += n;\n\n\t\t\t// Initialize the hash value now that we have some input:\n\t\t\tif (lookahead >= MIN_MATCH) {\n\t\t\t\tins_h = win[strstart] & 0xff;\n\t\t\t\tins_h = (((ins_h) << hash_shift) ^ (win[strstart + 1] & 0xff)) & hash_mask;\n\t\t\t}\n\t\t\t// If the whole input has less than MIN_MATCH bytes, ins_h is\n\t\t\t// garbage,\n\t\t\t// but this is not important since only literal bytes will be\n\t\t\t// emitted.\n\t\t} while (lookahead < MIN_LOOKAHEAD && strm.avail_in !== 0);\n\t}\n\n\t// Copy without compression as much as possible from the input stream,\n\t// return\n\t// the current block state.\n\t// This function does not insert new strings in the dictionary since\n\t// uncompressible data is probably not useful. This function is used\n\t// only for the level=0 compression option.\n\t// NOTE: this function should be optimized to avoid extra copying from\n\t// win to pending_buf.\n\tfunction deflate_stored(flush) {\n\t\t// Stored blocks are limited to 0xffff bytes, pending_buf is limited\n\t\t// to pending_buf_size, and each stored block has a 5 byte header:\n\n\t\tlet max_block_size = 0xffff;\n\t\tlet max_start;\n\n\t\tif (max_block_size > pending_buf_size - 5) {\n\t\t\tmax_block_size = pending_buf_size - 5;\n\t\t}\n\n\t\t// Copy as much as possible from input to output:\n\t\t// eslint-disable-next-line no-constant-condition\n\t\twhile (true) {\n\t\t\t// Fill the win as much as possible:\n\t\t\tif (lookahead <= 1) {\n\t\t\t\tfill_window();\n\t\t\t\tif (lookahead === 0 && flush == Z_NO_FLUSH)\n\t\t\t\t\treturn NeedMore;\n\t\t\t\tif (lookahead === 0)\n\t\t\t\t\tbreak; // flush the current block\n\t\t\t}\n\n\t\t\tstrstart += lookahead;\n\t\t\tlookahead = 0;\n\n\t\t\t// Emit a stored block if pending_buf will be full:\n\t\t\tmax_start = block_start + max_block_size;\n\t\t\tif (strstart === 0 || strstart >= max_start) {\n\t\t\t\t// strstart === 0 is possible when wraparound on 16-bit machine\n\t\t\t\tlookahead = (strstart - max_start);\n\t\t\t\tstrstart = max_start;\n\n\t\t\t\tflush_block_only(false);\n\t\t\t\tif (strm.avail_out === 0)\n\t\t\t\t\treturn NeedMore;\n\n\t\t\t}\n\n\t\t\t// Flush if we may have to slide, otherwise block_start may become\n\t\t\t// negative and the data will be gone:\n\t\t\tif (strstart - block_start >= w_size - MIN_LOOKAHEAD) {\n\t\t\t\tflush_block_only(false);\n\t\t\t\tif (strm.avail_out === 0)\n\t\t\t\t\treturn NeedMore;\n\t\t\t}\n\t\t}\n\n\t\tflush_block_only(flush == Z_FINISH);\n\t\tif (strm.avail_out === 0)\n\t\t\treturn (flush == Z_FINISH) ? FinishStarted : NeedMore;\n\n\t\treturn flush == Z_FINISH ? FinishDone : BlockDone;\n\t}\n\n\tfunction longest_match(cur_match) {\n\t\tlet chain_length = max_chain_length; // max hash chain length\n\t\tlet scan = strstart; // current string\n\t\tlet match; // matched string\n\t\tlet len; // length of current match\n\t\tlet best_len = prev_length; // best match length so far\n\t\tconst limit = strstart > (w_size - MIN_LOOKAHEAD) ? strstart - (w_size - MIN_LOOKAHEAD) : 0;\n\t\tlet _nice_match = nice_match;\n\n\t\t// Stop when cur_match becomes <= limit. To simplify the code,\n\t\t// we prevent matches with the string of win index 0.\n\n\t\tconst wmask = w_mask;\n\n\t\tconst strend = strstart + MAX_MATCH;\n\t\tlet scan_end1 = win[scan + best_len - 1];\n\t\tlet scan_end = win[scan + best_len];\n\n\t\t// The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of\n\t\t// 16.\n\t\t// It is easy to get rid of this optimization if necessary.\n\n\t\t// Do not waste too much time if we already have a good match:\n\t\tif (prev_length >= good_match) {\n\t\t\tchain_length >>= 2;\n\t\t}\n\n\t\t// Do not look for matches beyond the end of the input. This is\n\t\t// necessary\n\t\t// to make deflate deterministic.\n\t\tif (_nice_match > lookahead)\n\t\t\t_nice_match = lookahead;\n\n\t\tdo {\n\t\t\tmatch = cur_match;\n\n\t\t\t// Skip to next match if the match length cannot increase\n\t\t\t// or if the match length is less than 2:\n\t\t\tif (win[match + best_len] != scan_end || win[match + best_len - 1] != scan_end1 || win[match] != win[scan]\n\t\t\t\t|| win[++match] != win[scan + 1])\n\t\t\t\tcontinue;\n\n\t\t\t// The check at best_len-1 can be removed because it will be made\n\t\t\t// again later. (This heuristic is not always a win.)\n\t\t\t// It is not necessary to compare scan[2] and match[2] since they\n\t\t\t// are always equal when the other bytes match, given that\n\t\t\t// the hash keys are equal and that HASH_BITS >= 8.\n\t\t\tscan += 2;\n\t\t\tmatch++;\n\n\t\t\t// We check for insufficient lookahead only every 8th comparison;\n\t\t\t// the 256th check will be made at strstart+258.\n\t\t\t// eslint-disable-next-line no-empty\n\t\t\tdo {\n\t\t\t\t// empty block\n\t\t\t} while (win[++scan] == win[++match] && win[++scan] == win[++match] && win[++scan] == win[++match]\n\t\t\t&& win[++scan] == win[++match] && win[++scan] == win[++match] && win[++scan] == win[++match]\n\t\t\t&& win[++scan] == win[++match] && win[++scan] == win[++match] && scan < strend);\n\n\t\t\tlen = MAX_MATCH - (strend - scan);\n\t\t\tscan = strend - MAX_MATCH;\n\n\t\t\tif (len > best_len) {\n\t\t\t\tmatch_start = cur_match;\n\t\t\t\tbest_len = len;\n\t\t\t\tif (len >= _nice_match)\n\t\t\t\t\tbreak;\n\t\t\t\tscan_end1 = win[scan + best_len - 1];\n\t\t\t\tscan_end = win[scan + best_len];\n\t\t\t}\n\n\t\t} while ((cur_match = (prev[cur_match & wmask] & 0xffff)) > limit && --chain_length !== 0);\n\n\t\tif (best_len <= lookahead)\n\t\t\treturn best_len;\n\t\treturn lookahead;\n\t}\n\n\t// Compress as much as possible from the input stream, return the current\n\t// block state.\n\t// This function does not perform lazy evaluation of matches and inserts\n\t// new strings in the dictionary only for unmatched strings or for short\n\t// matches. It is used only for the fast compression options.\n\tfunction deflate_fast(flush) {\n\t\t// short hash_head = 0; // head of the hash chain\n\t\tlet hash_head = 0; // head of the hash chain\n\t\tlet bflush; // set if current block must be flushed\n\n\t\t// eslint-disable-next-line no-constant-condition\n\t\twhile (true) {\n\t\t\t// Make sure that we always have enough lookahead, except\n\t\t\t// at the end of the input file. We need MAX_MATCH bytes\n\t\t\t// for the next match, plus MIN_MATCH bytes to insert the\n\t\t\t// string following the next match.\n\t\t\tif (lookahead < MIN_LOOKAHEAD) {\n\t\t\t\tfill_window();\n\t\t\t\tif (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\n\t\t\t\t\treturn NeedMore;\n\t\t\t\t}\n\t\t\t\tif (lookahead === 0)\n\t\t\t\t\tbreak; // flush the current block\n\t\t\t}\n\n\t\t\t// Insert the string win[strstart .. strstart+2] in the\n\t\t\t// dictionary, and set hash_head to the head of the hash chain:\n\t\t\tif (lookahead >= MIN_MATCH) {\n\t\t\t\tins_h = (((ins_h) << hash_shift) ^ (win[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\n\n\t\t\t\t// prev[strstart&w_mask]=hash_head=head[ins_h];\n\t\t\t\thash_head = (head[ins_h] & 0xffff);\n\t\t\t\tprev[strstart & w_mask] = head[ins_h];\n\t\t\t\thead[ins_h] = strstart;\n\t\t\t}\n\n\t\t\t// Find the longest match, discarding those <= prev_length.\n\t\t\t// At this point we have always match_length < MIN_MATCH\n\n\t\t\tif (hash_head !== 0 && ((strstart - hash_head) & 0xffff) <= w_size - MIN_LOOKAHEAD) {\n\t\t\t\t// To simplify the code, we prevent matches with the string\n\t\t\t\t// of win index 0 (in particular we have to avoid a match\n\t\t\t\t// of the string with itself at the start of the input file).\n\t\t\t\tif (strategy != Z_HUFFMAN_ONLY) {\n\t\t\t\t\tmatch_length = longest_match(hash_head);\n\t\t\t\t}\n\t\t\t\t// longest_match() sets match_start\n\t\t\t}\n\t\t\tif (match_length >= MIN_MATCH) {\n\t\t\t\t// check_match(strstart, match_start, match_length);\n\n\t\t\t\tbflush = _tr_tally(strstart - match_start, match_length - MIN_MATCH);\n\n\t\t\t\tlookahead -= match_length;\n\n\t\t\t\t// Insert new strings in the hash table only if the match length\n\t\t\t\t// is not too large. This saves time but degrades compression.\n\t\t\t\tif (match_length <= max_lazy_match && lookahead >= MIN_MATCH) {\n\t\t\t\t\tmatch_length--; // string at strstart already in hash table\n\t\t\t\t\tdo {\n\t\t\t\t\t\tstrstart++;\n\n\t\t\t\t\t\tins_h = ((ins_h << hash_shift) ^ (win[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\n\t\t\t\t\t\t// prev[strstart&w_mask]=hash_head=head[ins_h];\n\t\t\t\t\t\thash_head = (head[ins_h] & 0xffff);\n\t\t\t\t\t\tprev[strstart & w_mask] = head[ins_h];\n\t\t\t\t\t\thead[ins_h] = strstart;\n\n\t\t\t\t\t\t// strstart never exceeds WSIZE-MAX_MATCH, so there are\n\t\t\t\t\t\t// always MIN_MATCH bytes ahead.\n\t\t\t\t\t} while (--match_length !== 0);\n\t\t\t\t\tstrstart++;\n\t\t\t\t} else {\n\t\t\t\t\tstrstart += match_length;\n\t\t\t\t\tmatch_length = 0;\n\t\t\t\t\tins_h = win[strstart] & 0xff;\n\n\t\t\t\t\tins_h = (((ins_h) << hash_shift) ^ (win[strstart + 1] & 0xff)) & hash_mask;\n\t\t\t\t\t// If lookahead < MIN_MATCH, ins_h is garbage, but it does\n\t\t\t\t\t// not\n\t\t\t\t\t// matter since it will be recomputed at next deflate call.\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// No match, output a literal byte\n\n\t\t\t\tbflush = _tr_tally(0, win[strstart] & 0xff);\n\t\t\t\tlookahead--;\n\t\t\t\tstrstart++;\n\t\t\t}\n\t\t\tif (bflush) {\n\n\t\t\t\tflush_block_only(false);\n\t\t\t\tif (strm.avail_out === 0)\n\t\t\t\t\treturn NeedMore;\n\t\t\t}\n\t\t}\n\n\t\tflush_block_only(flush == Z_FINISH);\n\t\tif (strm.avail_out === 0) {\n\t\t\tif (flush == Z_FINISH)\n\t\t\t\treturn FinishStarted;\n\t\t\telse\n\t\t\t\treturn NeedMore;\n\t\t}\n\t\treturn flush == Z_FINISH ? FinishDone : BlockDone;\n\t}\n\n\t// Same as above, but achieves better compression. We use a lazy\n\t// evaluation for matches: a match is finally adopted only if there is\n\t// no better match at the next win position.\n\tfunction deflate_slow(flush) {\n\t\t// short hash_head = 0; // head of hash chain\n\t\tlet hash_head = 0; // head of hash chain\n\t\tlet bflush; // set if current block must be flushed\n\t\tlet max_insert;\n\n\t\t// Process the input block.\n\t\t// eslint-disable-next-line no-constant-condition\n\t\twhile (true) {\n\t\t\t// Make sure that we always have enough lookahead, except\n\t\t\t// at the end of the input file. We need MAX_MATCH bytes\n\t\t\t// for the next match, plus MIN_MATCH bytes to insert the\n\t\t\t// string following the next match.\n\n\t\t\tif (lookahead < MIN_LOOKAHEAD) {\n\t\t\t\tfill_window();\n\t\t\t\tif (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\n\t\t\t\t\treturn NeedMore;\n\t\t\t\t}\n\t\t\t\tif (lookahead === 0)\n\t\t\t\t\tbreak; // flush the current block\n\t\t\t}\n\n\t\t\t// Insert the string win[strstart .. strstart+2] in the\n\t\t\t// dictionary, and set hash_head to the head of the hash chain:\n\n\t\t\tif (lookahead >= MIN_MATCH) {\n\t\t\t\tins_h = (((ins_h) << hash_shift) ^ (win[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\n\t\t\t\t// prev[strstart&w_mask]=hash_head=head[ins_h];\n\t\t\t\thash_head = (head[ins_h] & 0xffff);\n\t\t\t\tprev[strstart & w_mask] = head[ins_h];\n\t\t\t\thead[ins_h] = strstart;\n\t\t\t}\n\n\t\t\t// Find the longest match, discarding those <= prev_length.\n\t\t\tprev_length = match_length;\n\t\t\tprev_match = match_start;\n\t\t\tmatch_length = MIN_MATCH - 1;\n\n\t\t\tif (hash_head !== 0 && prev_length < max_lazy_match && ((strstart - hash_head) & 0xffff) <= w_size - MIN_LOOKAHEAD) {\n\t\t\t\t// To simplify the code, we prevent matches with the string\n\t\t\t\t// of win index 0 (in particular we have to avoid a match\n\t\t\t\t// of the string with itself at the start of the input file).\n\n\t\t\t\tif (strategy != Z_HUFFMAN_ONLY) {\n\t\t\t\t\tmatch_length = longest_match(hash_head);\n\t\t\t\t}\n\t\t\t\t// longest_match() sets match_start\n\n\t\t\t\tif (match_length <= 5 && (strategy == Z_FILTERED || (match_length == MIN_MATCH && strstart - match_start > 4096))) {\n\n\t\t\t\t\t// If prev_match is also MIN_MATCH, match_start is garbage\n\t\t\t\t\t// but we will ignore the current match anyway.\n\t\t\t\t\tmatch_length = MIN_MATCH - 1;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// If there was a match at the previous step and the current\n\t\t\t// match is not better, output the previous match:\n\t\t\tif (prev_length >= MIN_MATCH && match_length <= prev_length) {\n\t\t\t\tmax_insert = strstart + lookahead - MIN_MATCH;\n\t\t\t\t// Do not insert strings in hash table beyond this.\n\n\t\t\t\t// check_match(strstart-1, prev_match, prev_length);\n\n\t\t\t\tbflush = _tr_tally(strstart - 1 - prev_match, prev_length - MIN_MATCH);\n\n\t\t\t\t// Insert in hash table all strings up to the end of the match.\n\t\t\t\t// strstart-1 and strstart are already inserted. If there is not\n\t\t\t\t// enough lookahead, the last two strings are not inserted in\n\t\t\t\t// the hash table.\n\t\t\t\tlookahead -= prev_length - 1;\n\t\t\t\tprev_length -= 2;\n\t\t\t\tdo {\n\t\t\t\t\tif (++strstart <= max_insert) {\n\t\t\t\t\t\tins_h = (((ins_h) << hash_shift) ^ (win[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\n\t\t\t\t\t\t// prev[strstart&w_mask]=hash_head=head[ins_h];\n\t\t\t\t\t\thash_head = (head[ins_h] & 0xffff);\n\t\t\t\t\t\tprev[strstart & w_mask] = head[ins_h];\n\t\t\t\t\t\thead[ins_h] = strstart;\n\t\t\t\t\t}\n\t\t\t\t} while (--prev_length !== 0);\n\t\t\t\tmatch_available = 0;\n\t\t\t\tmatch_length = MIN_MATCH - 1;\n\t\t\t\tstrstart++;\n\n\t\t\t\tif (bflush) {\n\t\t\t\t\tflush_block_only(false);\n\t\t\t\t\tif (strm.avail_out === 0)\n\t\t\t\t\t\treturn NeedMore;\n\t\t\t\t}\n\t\t\t} else if (match_available !== 0) {\n\n\t\t\t\t// If there was no match at the previous position, output a\n\t\t\t\t// single literal. If there was a match but the current match\n\t\t\t\t// is longer, truncate the previous match to a single literal.\n\n\t\t\t\tbflush = _tr_tally(0, win[strstart - 1] & 0xff);\n\n\t\t\t\tif (bflush) {\n\t\t\t\t\tflush_block_only(false);\n\t\t\t\t}\n\t\t\t\tstrstart++;\n\t\t\t\tlookahead--;\n\t\t\t\tif (strm.avail_out === 0)\n\t\t\t\t\treturn NeedMore;\n\t\t\t} else {\n\t\t\t\t// There is no previous match to compare with, wait for\n\t\t\t\t// the next step to decide.\n\n\t\t\t\tmatch_available = 1;\n\t\t\t\tstrstart++;\n\t\t\t\tlookahead--;\n\t\t\t}\n\t\t}\n\n\t\tif (match_available !== 0) {\n\t\t\tbflush = _tr_tally(0, win[strstart - 1] & 0xff);\n\t\t\tmatch_available = 0;\n\t\t}\n\t\tflush_block_only(flush == Z_FINISH);\n\n\t\tif (strm.avail_out === 0) {\n\t\t\tif (flush == Z_FINISH)\n\t\t\t\treturn FinishStarted;\n\t\t\telse\n\t\t\t\treturn NeedMore;\n\t\t}\n\n\t\treturn flush == Z_FINISH ? FinishDone : BlockDone;\n\t}\n\n\tfunction deflateReset(strm) {\n\t\tstrm.total_in = strm.total_out = 0;\n\t\tstrm.msg = null; //\n\n\t\tthat.pending = 0;\n\t\tthat.pending_out = 0;\n\n\t\tstatus = BUSY_STATE;\n\n\t\tlast_flush = Z_NO_FLUSH;\n\n\t\ttr_init();\n\t\tlm_init();\n\t\treturn Z_OK;\n\t}\n\n\tthat.deflateInit = function (strm, _level, bits, _method, memLevel, _strategy) {\n\t\tif (!_method)\n\t\t\t_method = Z_DEFLATED;\n\t\tif (!memLevel)\n\t\t\tmemLevel = DEF_MEM_LEVEL;\n\t\tif (!_strategy)\n\t\t\t_strategy = Z_DEFAULT_STRATEGY;\n\n\t\t// byte[] my_version=ZLIB_VERSION;\n\n\t\t//\n\t\t// if (!version || version[0] != my_version[0]\n\t\t// || stream_size != sizeof(z_stream)) {\n\t\t// return Z_VERSION_ERROR;\n\t\t// }\n\n\t\tstrm.msg = null;\n\n\t\tif (_level == Z_DEFAULT_COMPRESSION)\n\t\t\t_level = 6;\n\n\t\tif (memLevel < 1 || memLevel > MAX_MEM_LEVEL || _method != Z_DEFLATED || bits < 9 || bits > 15 || _level < 0 || _level > 9 || _strategy < 0\n\t\t\t|| _strategy > Z_HUFFMAN_ONLY) {\n\t\t\treturn Z_STREAM_ERROR;\n\t\t}\n\n\t\tstrm.dstate = that;\n\n\t\tw_bits = bits;\n\t\tw_size = 1 << w_bits;\n\t\tw_mask = w_size - 1;\n\n\t\thash_bits = memLevel + 7;\n\t\thash_size = 1 << hash_bits;\n\t\thash_mask = hash_size - 1;\n\t\thash_shift = Math.floor((hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n\t\twin = new Uint8Array(w_size * 2);\n\t\tprev = [];\n\t\thead = [];\n\n\t\tlit_bufsize = 1 << (memLevel + 6); // 16K elements by default\n\n\t\tthat.pending_buf = new Uint8Array(lit_bufsize * 4);\n\t\tpending_buf_size = lit_bufsize * 4;\n\n\t\tthat.dist_buf = new Uint16Array(lit_bufsize);\n\t\tthat.lc_buf = new Uint8Array(lit_bufsize);\n\n\t\tlevel = _level;\n\n\t\tstrategy = _strategy;\n\n\t\treturn deflateReset(strm);\n\t};\n\n\tthat.deflateEnd = function () {\n\t\tif (status != INIT_STATE && status != BUSY_STATE && status != FINISH_STATE) {\n\t\t\treturn Z_STREAM_ERROR;\n\t\t}\n\t\t// Deallocate in reverse order of allocations:\n\t\tthat.lc_buf = null;\n\t\tthat.dist_buf = null;\n\t\tthat.pending_buf = null;\n\t\thead = null;\n\t\tprev = null;\n\t\twin = null;\n\t\t// free\n\t\tthat.dstate = null;\n\t\treturn status == BUSY_STATE ? Z_DATA_ERROR : Z_OK;\n\t};\n\n\tthat.deflateParams = function (strm, _level, _strategy) {\n\t\tlet err = Z_OK;\n\n\t\tif (_level == Z_DEFAULT_COMPRESSION) {\n\t\t\t_level = 6;\n\t\t}\n\t\tif (_level < 0 || _level > 9 || _strategy < 0 || _strategy > Z_HUFFMAN_ONLY) {\n\t\t\treturn Z_STREAM_ERROR;\n\t\t}\n\n\t\tif (config_table[level].func != config_table[_level].func && strm.total_in !== 0) {\n\t\t\t// Flush the last buffer:\n\t\t\terr = strm.deflate(Z_PARTIAL_FLUSH);\n\t\t}\n\n\t\tif (level != _level) {\n\t\t\tlevel = _level;\n\t\t\tmax_lazy_match = config_table[level].max_lazy;\n\t\t\tgood_match = config_table[level].good_length;\n\t\t\tnice_match = config_table[level].nice_length;\n\t\t\tmax_chain_length = config_table[level].max_chain;\n\t\t}\n\t\tstrategy = _strategy;\n\t\treturn err;\n\t};\n\n\tthat.deflateSetDictionary = function (_strm, dictionary, dictLength) {\n\t\tlet length = dictLength;\n\t\tlet n, index = 0;\n\n\t\tif (!dictionary || status != INIT_STATE)\n\t\t\treturn Z_STREAM_ERROR;\n\n\t\tif (length < MIN_MATCH)\n\t\t\treturn Z_OK;\n\t\tif (length > w_size - MIN_LOOKAHEAD) {\n\t\t\tlength = w_size - MIN_LOOKAHEAD;\n\t\t\tindex = dictLength - length; // use the tail of the dictionary\n\t\t}\n\t\twin.set(dictionary.subarray(index, index + length), 0);\n\n\t\tstrstart = length;\n\t\tblock_start = length;\n\n\t\t// Insert all strings in the hash table (except for the last two bytes).\n\t\t// s->lookahead stays null, so s->ins_h will be recomputed at the next\n\t\t// call of fill_window.\n\n\t\tins_h = win[0] & 0xff;\n\t\tins_h = (((ins_h) << hash_shift) ^ (win[1] & 0xff)) & hash_mask;\n\n\t\tfor (n = 0; n <= length - MIN_MATCH; n++) {\n\t\t\tins_h = (((ins_h) << hash_shift) ^ (win[(n) + (MIN_MATCH - 1)] & 0xff)) & hash_mask;\n\t\t\tprev[n & w_mask] = head[ins_h];\n\t\t\thead[ins_h] = n;\n\t\t}\n\t\treturn Z_OK;\n\t};\n\n\tthat.deflate = function (_strm, flush) {\n\t\tlet i, header, level_flags, old_flush, bstate;\n\n\t\tif (flush > Z_FINISH || flush < 0) {\n\t\t\treturn Z_STREAM_ERROR;\n\t\t}\n\n\t\tif (!_strm.next_out || (!_strm.next_in && _strm.avail_in !== 0) || (status == FINISH_STATE && flush != Z_FINISH)) {\n\t\t\t_strm.msg = z_errmsg[Z_NEED_DICT - (Z_STREAM_ERROR)];\n\t\t\treturn Z_STREAM_ERROR;\n\t\t}\n\t\tif (_strm.avail_out === 0) {\n\t\t\t_strm.msg = z_errmsg[Z_NEED_DICT - (Z_BUF_ERROR)];\n\t\t\treturn Z_BUF_ERROR;\n\t\t}\n\n\t\tstrm = _strm; // just in case\n\t\told_flush = last_flush;\n\t\tlast_flush = flush;\n\n\t\t// Write the zlib header\n\t\tif (status == INIT_STATE) {\n\t\t\theader = (Z_DEFLATED + ((w_bits - 8) << 4)) << 8;\n\t\t\tlevel_flags = ((level - 1) & 0xff) >> 1;\n\n\t\t\tif (level_flags > 3)\n\t\t\t\tlevel_flags = 3;\n\t\t\theader |= (level_flags << 6);\n\t\t\tif (strstart !== 0)\n\t\t\t\theader |= PRESET_DICT;\n\t\t\theader += 31 - (header % 31);\n\n\t\t\tstatus = BUSY_STATE;\n\t\t\tputShortMSB(header);\n\t\t}\n\n\t\t// Flush as much pending output as possible\n\t\tif (that.pending !== 0) {\n\t\t\tstrm.flush_pending();\n\t\t\tif (strm.avail_out === 0) {\n\t\t\t\t// console.log(\" avail_out==0\");\n\t\t\t\t// Since avail_out is 0, deflate will be called again with\n\t\t\t\t// more output space, but possibly with both pending and\n\t\t\t\t// avail_in equal to zero. There won't be anything to do,\n\t\t\t\t// but this is not an error situation so make sure we\n\t\t\t\t// return OK instead of BUF_ERROR at next call of deflate:\n\t\t\t\tlast_flush = -1;\n\t\t\t\treturn Z_OK;\n\t\t\t}\n\n\t\t\t// Make sure there is something to do and avoid duplicate\n\t\t\t// consecutive\n\t\t\t// flushes. For repeated and useless calls with Z_FINISH, we keep\n\t\t\t// returning Z_STREAM_END instead of Z_BUFF_ERROR.\n\t\t} else if (strm.avail_in === 0 && flush <= old_flush && flush != Z_FINISH) {\n\t\t\tstrm.msg = z_errmsg[Z_NEED_DICT - (Z_BUF_ERROR)];\n\t\t\treturn Z_BUF_ERROR;\n\t\t}\n\n\t\t// User must not provide more input after the first FINISH:\n\t\tif (status == FINISH_STATE && strm.avail_in !== 0) {\n\t\t\t_strm.msg = z_errmsg[Z_NEED_DICT - (Z_BUF_ERROR)];\n\t\t\treturn Z_BUF_ERROR;\n\t\t}\n\n\t\t// Start a new block or continue the current one.\n\t\tif (strm.avail_in !== 0 || lookahead !== 0 || (flush != Z_NO_FLUSH && status != FINISH_STATE)) {\n\t\t\tbstate = -1;\n\t\t\tswitch (config_table[level].func) {\n\t\t\t\tcase STORED:\n\t\t\t\t\tbstate = deflate_stored(flush);\n\t\t\t\t\tbreak;\n\t\t\t\tcase FAST:\n\t\t\t\t\tbstate = deflate_fast(flush);\n\t\t\t\t\tbreak;\n\t\t\t\tcase SLOW:\n\t\t\t\t\tbstate = deflate_slow(flush);\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t}\n\n\t\t\tif (bstate == FinishStarted || bstate == FinishDone) {\n\t\t\t\tstatus = FINISH_STATE;\n\t\t\t}\n\t\t\tif (bstate == NeedMore || bstate == FinishStarted) {\n\t\t\t\tif (strm.avail_out === 0) {\n\t\t\t\t\tlast_flush = -1; // avoid BUF_ERROR next call, see above\n\t\t\t\t}\n\t\t\t\treturn Z_OK;\n\t\t\t\t// If flush != Z_NO_FLUSH && avail_out === 0, the next call\n\t\t\t\t// of deflate should use the same flush parameter to make sure\n\t\t\t\t// that the flush is complete. So we don't have to output an\n\t\t\t\t// empty block here, this will be done at next call. This also\n\t\t\t\t// ensures that for a very small output buffer, we emit at most\n\t\t\t\t// one empty block.\n\t\t\t}\n\n\t\t\tif (bstate == BlockDone) {\n\t\t\t\tif (flush == Z_PARTIAL_FLUSH) {\n\t\t\t\t\t_tr_align();\n\t\t\t\t} else { // FULL_FLUSH or SYNC_FLUSH\n\t\t\t\t\t_tr_stored_block(0, 0, false);\n\t\t\t\t\t// For a full flush, this empty block will be recognized\n\t\t\t\t\t// as a special marker by inflate_sync().\n\t\t\t\t\tif (flush == Z_FULL_FLUSH) {\n\t\t\t\t\t\t// state.head[s.hash_size-1]=0;\n\t\t\t\t\t\tfor (i = 0; i < hash_size/*-1*/; i++)\n\t\t\t\t\t\t\t// forget history\n\t\t\t\t\t\t\thead[i] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tstrm.flush_pending();\n\t\t\t\tif (strm.avail_out === 0) {\n\t\t\t\t\tlast_flush = -1; // avoid BUF_ERROR at next call, see above\n\t\t\t\t\treturn Z_OK;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (flush != Z_FINISH)\n\t\t\treturn Z_OK;\n\t\treturn Z_STREAM_END;\n\t};\n}\n\n// ZStream\n\nfunction ZStream() {\n\tconst that = this;\n\tthat.next_in_index = 0;\n\tthat.next_out_index = 0;\n\t// that.next_in; // next input byte\n\tthat.avail_in = 0; // number of bytes available at next_in\n\tthat.total_in = 0; // total nb of input bytes read so far\n\t// that.next_out; // next output byte should be put there\n\tthat.avail_out = 0; // remaining free space at next_out\n\tthat.total_out = 0; // total nb of bytes output so far\n\t// that.msg;\n\t// that.dstate;\n}\n\nZStream.prototype = {\n\tdeflateInit(level, bits) {\n\t\tconst that = this;\n\t\tthat.dstate = new Deflate();\n\t\tif (!bits)\n\t\t\tbits = MAX_BITS;\n\t\treturn that.dstate.deflateInit(that, level, bits);\n\t},\n\n\tdeflate(flush) {\n\t\tconst that = this;\n\t\tif (!that.dstate) {\n\t\t\treturn Z_STREAM_ERROR;\n\t\t}\n\t\treturn that.dstate.deflate(that, flush);\n\t},\n\n\tdeflateEnd() {\n\t\tconst that = this;\n\t\tif (!that.dstate)\n\t\t\treturn Z_STREAM_ERROR;\n\t\tconst ret = that.dstate.deflateEnd();\n\t\tthat.dstate = null;\n\t\treturn ret;\n\t},\n\n\tdeflateParams(level, strategy) {\n\t\tconst that = this;\n\t\tif (!that.dstate)\n\t\t\treturn Z_STREAM_ERROR;\n\t\treturn that.dstate.deflateParams(that, level, strategy);\n\t},\n\n\tdeflateSetDictionary(dictionary, dictLength) {\n\t\tconst that = this;\n\t\tif (!that.dstate)\n\t\t\treturn Z_STREAM_ERROR;\n\t\treturn that.dstate.deflateSetDictionary(that, dictionary, dictLength);\n\t},\n\n\t// Read a new buffer from the current input stream, update the\n\t// total number of bytes read. All deflate() input goes through\n\t// this function so some applications may wish to modify it to avoid\n\t// allocating a large strm->next_in buffer and copying from it.\n\t// (See also flush_pending()).\n\tread_buf(buf, start, size) {\n\t\tconst that = this;\n\t\tlet len = that.avail_in;\n\t\tif (len > size)\n\t\t\tlen = size;\n\t\tif (len === 0)\n\t\t\treturn 0;\n\t\tthat.avail_in -= len;\n\t\tbuf.set(that.next_in.subarray(that.next_in_index, that.next_in_index + len), start);\n\t\tthat.next_in_index += len;\n\t\tthat.total_in += len;\n\t\treturn len;\n\t},\n\n\t// Flush as much pending output as possible. All deflate() output goes\n\t// through this function so some applications may wish to modify it\n\t// to avoid allocating a large strm->next_out buffer and copying into it.\n\t// (See also read_buf()).\n\tflush_pending() {\n\t\tconst that = this;\n\t\tlet len = that.dstate.pending;\n\n\t\tif (len > that.avail_out)\n\t\t\tlen = that.avail_out;\n\t\tif (len === 0)\n\t\t\treturn;\n\n\t\t// if (that.dstate.pending_buf.length <= that.dstate.pending_out || that.next_out.length <= that.next_out_index\n\t\t// || that.dstate.pending_buf.length < (that.dstate.pending_out + len) || that.next_out.length < (that.next_out_index +\n\t\t// len)) {\n\t\t// console.log(that.dstate.pending_buf.length + \", \" + that.dstate.pending_out + \", \" + that.next_out.length + \", \" +\n\t\t// that.next_out_index + \", \" + len);\n\t\t// console.log(\"avail_out=\" + that.avail_out);\n\t\t// }\n\n\t\tthat.next_out.set(that.dstate.pending_buf.subarray(that.dstate.pending_out, that.dstate.pending_out + len), that.next_out_index);\n\n\t\tthat.next_out_index += len;\n\t\tthat.dstate.pending_out += len;\n\t\tthat.total_out += len;\n\t\tthat.avail_out -= len;\n\t\tthat.dstate.pending -= len;\n\t\tif (that.dstate.pending === 0) {\n\t\t\tthat.dstate.pending_out = 0;\n\t\t}\n\t}\n};\n\n// Deflate\n\nfunction ZipDeflate(options) {\n\tconst that = this;\n\tconst z = new ZStream();\n\tconst bufsize = getMaximumCompressedSize(options && options.chunkSize ? options.chunkSize : 64 * 1024);\n\tconst flush = Z_NO_FLUSH;\n\tconst buf = new Uint8Array(bufsize);\n\tlet level = options ? options.level : Z_DEFAULT_COMPRESSION;\n\tif (typeof level == \"undefined\")\n\t\tlevel = Z_DEFAULT_COMPRESSION;\n\tz.deflateInit(level);\n\tz.next_out = buf;\n\n\tthat.append = function (data, onprogress) {\n\t\tlet err, array, lastIndex = 0, bufferIndex = 0, bufferSize = 0;\n\t\tconst buffers = [];\n\t\tif (!data.length)\n\t\t\treturn;\n\t\tz.next_in_index = 0;\n\t\tz.next_in = data;\n\t\tz.avail_in = data.length;\n\t\tdo {\n\t\t\tz.next_out_index = 0;\n\t\t\tz.avail_out = bufsize;\n\t\t\terr = z.deflate(flush);\n\t\t\tif (err != Z_OK)\n\t\t\t\tthrow new Error(\"deflating: \" + z.msg);\n\t\t\tif (z.next_out_index)\n\t\t\t\tif (z.next_out_index == bufsize)\n\t\t\t\t\tbuffers.push(new Uint8Array(buf));\n\t\t\t\telse\n\t\t\t\t\tbuffers.push(buf.subarray(0, z.next_out_index));\n\t\t\tbufferSize += z.next_out_index;\n\t\t\tif (onprogress && z.next_in_index > 0 && z.next_in_index != lastIndex) {\n\t\t\t\tonprogress(z.next_in_index);\n\t\t\t\tlastIndex = z.next_in_index;\n\t\t\t}\n\t\t} while (z.avail_in > 0 || z.avail_out === 0);\n\t\tif (buffers.length > 1) {\n\t\t\tarray = new Uint8Array(bufferSize);\n\t\t\tbuffers.forEach(function (chunk) {\n\t\t\t\tarray.set(chunk, bufferIndex);\n\t\t\t\tbufferIndex += chunk.length;\n\t\t\t});\n\t\t} else {\n\t\t\tarray = buffers[0] ? new Uint8Array(buffers[0]) : new Uint8Array();\n\t\t}\n\t\treturn array;\n\t};\n\tthat.flush = function () {\n\t\tlet err, array, bufferIndex = 0, bufferSize = 0;\n\t\tconst buffers = [];\n\t\tdo {\n\t\t\tz.next_out_index = 0;\n\t\t\tz.avail_out = bufsize;\n\t\t\terr = z.deflate(Z_FINISH);\n\t\t\tif (err != Z_STREAM_END && err != Z_OK)\n\t\t\t\tthrow new Error(\"deflating: \" + z.msg);\n\t\t\tif (bufsize - z.avail_out > 0)\n\t\t\t\tbuffers.push(buf.slice(0, z.next_out_index));\n\t\t\tbufferSize += z.next_out_index;\n\t\t} while (z.avail_in > 0 || z.avail_out === 0);\n\t\tz.deflateEnd();\n\t\tarray = new Uint8Array(bufferSize);\n\t\tbuffers.forEach(function (chunk) {\n\t\t\tarray.set(chunk, bufferIndex);\n\t\t\tbufferIndex += chunk.length;\n\t\t});\n\t\treturn array;\n\t};\n}\n\nfunction getMaximumCompressedSize(uncompressedSize) {\n\treturn uncompressedSize + (5 * (Math.floor(uncompressedSize / 16383) + 1));\n}\n\nexport {\n\tZipDeflate as Deflate\n};", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/*\n * This program is based on JZlib 1.0.2 ymnk, JCraft,Inc.\n * JZlib is based on zlib-1.1.3, so all credit should go authors\n * Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)\n * and contributors of zlib.\n */\n\n// deno-lint-ignore-file no-this-alias prefer-const\n\n// Global\n\nconst MAX_BITS = 15;\n\nconst Z_OK = 0;\nconst Z_STREAM_END = 1;\nconst Z_NEED_DICT = 2;\nconst Z_STREAM_ERROR = -2;\nconst Z_DATA_ERROR = -3;\nconst Z_MEM_ERROR = -4;\nconst Z_BUF_ERROR = -5;\n\nconst inflate_mask = [0x00000000, 0x00000001, 0x00000003, 0x00000007, 0x0000000f, 0x0000001f, 0x0000003f, 0x0000007f, 0x000000ff, 0x000001ff, 0x000003ff,\n\t0x000007ff, 0x00000fff, 0x00001fff, 0x00003fff, 0x00007fff, 0x0000ffff];\n\nconst MANY = 1440;\n\n// JZlib version : \"1.0.2\"\nconst Z_NO_FLUSH = 0;\nconst Z_FINISH = 4;\n\n// InfTree\nconst fixed_bl = 9;\nconst fixed_bd = 5;\n\nconst fixed_tl = [96, 7, 256, 0, 8, 80, 0, 8, 16, 84, 8, 115, 82, 7, 31, 0, 8, 112, 0, 8, 48, 0, 9, 192, 80, 7, 10, 0, 8, 96, 0, 8, 32, 0, 9, 160, 0, 8, 0,\n\t0, 8, 128, 0, 8, 64, 0, 9, 224, 80, 7, 6, 0, 8, 88, 0, 8, 24, 0, 9, 144, 83, 7, 59, 0, 8, 120, 0, 8, 56, 0, 9, 208, 81, 7, 17, 0, 8, 104, 0, 8, 40,\n\t0, 9, 176, 0, 8, 8, 0, 8, 136, 0, 8, 72, 0, 9, 240, 80, 7, 4, 0, 8, 84, 0, 8, 20, 85, 8, 227, 83, 7, 43, 0, 8, 116, 0, 8, 52, 0, 9, 200, 81, 7, 13,\n\t0, 8, 100, 0, 8, 36, 0, 9, 168, 0, 8, 4, 0, 8, 132, 0, 8, 68, 0, 9, 232, 80, 7, 8, 0, 8, 92, 0, 8, 28, 0, 9, 152, 84, 7, 83, 0, 8, 124, 0, 8, 60,\n\t0, 9, 216, 82, 7, 23, 0, 8, 108, 0, 8, 44, 0, 9, 184, 0, 8, 12, 0, 8, 140, 0, 8, 76, 0, 9, 248, 80, 7, 3, 0, 8, 82, 0, 8, 18, 85, 8, 163, 83, 7,\n\t35, 0, 8, 114, 0, 8, 50, 0, 9, 196, 81, 7, 11, 0, 8, 98, 0, 8, 34, 0, 9, 164, 0, 8, 2, 0, 8, 130, 0, 8, 66, 0, 9, 228, 80, 7, 7, 0, 8, 90, 0, 8,\n\t26, 0, 9, 148, 84, 7, 67, 0, 8, 122, 0, 8, 58, 0, 9, 212, 82, 7, 19, 0, 8, 106, 0, 8, 42, 0, 9, 180, 0, 8, 10, 0, 8, 138, 0, 8, 74, 0, 9, 244, 80,\n\t7, 5, 0, 8, 86, 0, 8, 22, 192, 8, 0, 83, 7, 51, 0, 8, 118, 0, 8, 54, 0, 9, 204, 81, 7, 15, 0, 8, 102, 0, 8, 38, 0, 9, 172, 0, 8, 6, 0, 8, 134, 0,\n\t8, 70, 0, 9, 236, 80, 7, 9, 0, 8, 94, 0, 8, 30, 0, 9, 156, 84, 7, 99, 0, 8, 126, 0, 8, 62, 0, 9, 220, 82, 7, 27, 0, 8, 110, 0, 8, 46, 0, 9, 188, 0,\n\t8, 14, 0, 8, 142, 0, 8, 78, 0, 9, 252, 96, 7, 256, 0, 8, 81, 0, 8, 17, 85, 8, 131, 82, 7, 31, 0, 8, 113, 0, 8, 49, 0, 9, 194, 80, 7, 10, 0, 8, 97,\n\t0, 8, 33, 0, 9, 162, 0, 8, 1, 0, 8, 129, 0, 8, 65, 0, 9, 226, 80, 7, 6, 0, 8, 89, 0, 8, 25, 0, 9, 146, 83, 7, 59, 0, 8, 121, 0, 8, 57, 0, 9, 210,\n\t81, 7, 17, 0, 8, 105, 0, 8, 41, 0, 9, 178, 0, 8, 9, 0, 8, 137, 0, 8, 73, 0, 9, 242, 80, 7, 4, 0, 8, 85, 0, 8, 21, 80, 8, 258, 83, 7, 43, 0, 8, 117,\n\t0, 8, 53, 0, 9, 202, 81, 7, 13, 0, 8, 101, 0, 8, 37, 0, 9, 170, 0, 8, 5, 0, 8, 133, 0, 8, 69, 0, 9, 234, 80, 7, 8, 0, 8, 93, 0, 8, 29, 0, 9, 154,\n\t84, 7, 83, 0, 8, 125, 0, 8, 61, 0, 9, 218, 82, 7, 23, 0, 8, 109, 0, 8, 45, 0, 9, 186, 0, 8, 13, 0, 8, 141, 0, 8, 77, 0, 9, 250, 80, 7, 3, 0, 8, 83,\n\t0, 8, 19, 85, 8, 195, 83, 7, 35, 0, 8, 115, 0, 8, 51, 0, 9, 198, 81, 7, 11, 0, 8, 99, 0, 8, 35, 0, 9, 166, 0, 8, 3, 0, 8, 131, 0, 8, 67, 0, 9, 230,\n\t80, 7, 7, 0, 8, 91, 0, 8, 27, 0, 9, 150, 84, 7, 67, 0, 8, 123, 0, 8, 59, 0, 9, 214, 82, 7, 19, 0, 8, 107, 0, 8, 43, 0, 9, 182, 0, 8, 11, 0, 8, 139,\n\t0, 8, 75, 0, 9, 246, 80, 7, 5, 0, 8, 87, 0, 8, 23, 192, 8, 0, 83, 7, 51, 0, 8, 119, 0, 8, 55, 0, 9, 206, 81, 7, 15, 0, 8, 103, 0, 8, 39, 0, 9, 174,\n\t0, 8, 7, 0, 8, 135, 0, 8, 71, 0, 9, 238, 80, 7, 9, 0, 8, 95, 0, 8, 31, 0, 9, 158, 84, 7, 99, 0, 8, 127, 0, 8, 63, 0, 9, 222, 82, 7, 27, 0, 8, 111,\n\t0, 8, 47, 0, 9, 190, 0, 8, 15, 0, 8, 143, 0, 8, 79, 0, 9, 254, 96, 7, 256, 0, 8, 80, 0, 8, 16, 84, 8, 115, 82, 7, 31, 0, 8, 112, 0, 8, 48, 0, 9,\n\t193, 80, 7, 10, 0, 8, 96, 0, 8, 32, 0, 9, 161, 0, 8, 0, 0, 8, 128, 0, 8, 64, 0, 9, 225, 80, 7, 6, 0, 8, 88, 0, 8, 24, 0, 9, 145, 83, 7, 59, 0, 8,\n\t120, 0, 8, 56, 0, 9, 209, 81, 7, 17, 0, 8, 104, 0, 8, 40, 0, 9, 177, 0, 8, 8, 0, 8, 136, 0, 8, 72, 0, 9, 241, 80, 7, 4, 0, 8, 84, 0, 8, 20, 85, 8,\n\t227, 83, 7, 43, 0, 8, 116, 0, 8, 52, 0, 9, 201, 81, 7, 13, 0, 8, 100, 0, 8, 36, 0, 9, 169, 0, 8, 4, 0, 8, 132, 0, 8, 68, 0, 9, 233, 80, 7, 8, 0, 8,\n\t92, 0, 8, 28, 0, 9, 153, 84, 7, 83, 0, 8, 124, 0, 8, 60, 0, 9, 217, 82, 7, 23, 0, 8, 108, 0, 8, 44, 0, 9, 185, 0, 8, 12, 0, 8, 140, 0, 8, 76, 0, 9,\n\t249, 80, 7, 3, 0, 8, 82, 0, 8, 18, 85, 8, 163, 83, 7, 35, 0, 8, 114, 0, 8, 50, 0, 9, 197, 81, 7, 11, 0, 8, 98, 0, 8, 34, 0, 9, 165, 0, 8, 2, 0, 8,\n\t130, 0, 8, 66, 0, 9, 229, 80, 7, 7, 0, 8, 90, 0, 8, 26, 0, 9, 149, 84, 7, 67, 0, 8, 122, 0, 8, 58, 0, 9, 213, 82, 7, 19, 0, 8, 106, 0, 8, 42, 0, 9,\n\t181, 0, 8, 10, 0, 8, 138, 0, 8, 74, 0, 9, 245, 80, 7, 5, 0, 8, 86, 0, 8, 22, 192, 8, 0, 83, 7, 51, 0, 8, 118, 0, 8, 54, 0, 9, 205, 81, 7, 15, 0, 8,\n\t102, 0, 8, 38, 0, 9, 173, 0, 8, 6, 0, 8, 134, 0, 8, 70, 0, 9, 237, 80, 7, 9, 0, 8, 94, 0, 8, 30, 0, 9, 157, 84, 7, 99, 0, 8, 126, 0, 8, 62, 0, 9,\n\t221, 82, 7, 27, 0, 8, 110, 0, 8, 46, 0, 9, 189, 0, 8, 14, 0, 8, 142, 0, 8, 78, 0, 9, 253, 96, 7, 256, 0, 8, 81, 0, 8, 17, 85, 8, 131, 82, 7, 31, 0,\n\t8, 113, 0, 8, 49, 0, 9, 195, 80, 7, 10, 0, 8, 97, 0, 8, 33, 0, 9, 163, 0, 8, 1, 0, 8, 129, 0, 8, 65, 0, 9, 227, 80, 7, 6, 0, 8, 89, 0, 8, 25, 0, 9,\n\t147, 83, 7, 59, 0, 8, 121, 0, 8, 57, 0, 9, 211, 81, 7, 17, 0, 8, 105, 0, 8, 41, 0, 9, 179, 0, 8, 9, 0, 8, 137, 0, 8, 73, 0, 9, 243, 80, 7, 4, 0, 8,\n\t85, 0, 8, 21, 80, 8, 258, 83, 7, 43, 0, 8, 117, 0, 8, 53, 0, 9, 203, 81, 7, 13, 0, 8, 101, 0, 8, 37, 0, 9, 171, 0, 8, 5, 0, 8, 133, 0, 8, 69, 0, 9,\n\t235, 80, 7, 8, 0, 8, 93, 0, 8, 29, 0, 9, 155, 84, 7, 83, 0, 8, 125, 0, 8, 61, 0, 9, 219, 82, 7, 23, 0, 8, 109, 0, 8, 45, 0, 9, 187, 0, 8, 13, 0, 8,\n\t141, 0, 8, 77, 0, 9, 251, 80, 7, 3, 0, 8, 83, 0, 8, 19, 85, 8, 195, 83, 7, 35, 0, 8, 115, 0, 8, 51, 0, 9, 199, 81, 7, 11, 0, 8, 99, 0, 8, 35, 0, 9,\n\t167, 0, 8, 3, 0, 8, 131, 0, 8, 67, 0, 9, 231, 80, 7, 7, 0, 8, 91, 0, 8, 27, 0, 9, 151, 84, 7, 67, 0, 8, 123, 0, 8, 59, 0, 9, 215, 82, 7, 19, 0, 8,\n\t107, 0, 8, 43, 0, 9, 183, 0, 8, 11, 0, 8, 139, 0, 8, 75, 0, 9, 247, 80, 7, 5, 0, 8, 87, 0, 8, 23, 192, 8, 0, 83, 7, 51, 0, 8, 119, 0, 8, 55, 0, 9,\n\t207, 81, 7, 15, 0, 8, 103, 0, 8, 39, 0, 9, 175, 0, 8, 7, 0, 8, 135, 0, 8, 71, 0, 9, 239, 80, 7, 9, 0, 8, 95, 0, 8, 31, 0, 9, 159, 84, 7, 99, 0, 8,\n\t127, 0, 8, 63, 0, 9, 223, 82, 7, 27, 0, 8, 111, 0, 8, 47, 0, 9, 191, 0, 8, 15, 0, 8, 143, 0, 8, 79, 0, 9, 255];\nconst fixed_td = [80, 5, 1, 87, 5, 257, 83, 5, 17, 91, 5, 4097, 81, 5, 5, 89, 5, 1025, 85, 5, 65, 93, 5, 16385, 80, 5, 3, 88, 5, 513, 84, 5, 33, 92, 5,\n\t8193, 82, 5, 9, 90, 5, 2049, 86, 5, 129, 192, 5, 24577, 80, 5, 2, 87, 5, 385, 83, 5, 25, 91, 5, 6145, 81, 5, 7, 89, 5, 1537, 85, 5, 97, 93, 5,\n\t24577, 80, 5, 4, 88, 5, 769, 84, 5, 49, 92, 5, 12289, 82, 5, 13, 90, 5, 3073, 86, 5, 193, 192, 5, 24577];\n\n// Tables for deflate from PKZIP's appnote.txt.\nconst cplens = [ // Copy lengths for literal codes 257..285\n\t3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0];\n\n// see note #13 above about 258\nconst cplext = [ // Extra bits for literal codes 257..285\n\t0, 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, 112, 112 // 112==invalid\n];\n\nconst cpdist = [ // Copy offsets for distance codes 0..29\n\t1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577];\n\nconst cpdext = [ // Extra bits for distance codes\n\t0, 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\n// If BMAX needs to be larger than 16, then h and x[] should be uLong.\nconst BMAX = 15; // maximum bit length of any code\n\nfunction InfTree() {\n\tconst that = this;\n\n\tlet hn; // hufts used in space\n\tlet v; // work area for huft_build\n\tlet c; // bit length count table\n\tlet r; // table entry for structure assignment\n\tlet u; // table stack\n\tlet x; // bit offsets, then code stack\n\n\tfunction huft_build(b, // code lengths in bits (all assumed <=\n\t\t// BMAX)\n\t\tbindex, n, // number of codes (assumed <= 288)\n\t\ts, // number of simple-valued codes (0..s-1)\n\t\td, // list of base values for non-simple codes\n\t\te, // list of extra bits for non-simple codes\n\t\tt, // result: starting table\n\t\tm, // maximum lookup bits, returns actual\n\t\thp,// space for trees\n\t\thn,// hufts used in space\n\t\tv // working area: values in order of bit length\n\t) {\n\t\t// Given a list of code lengths and a maximum table size, make a set of\n\t\t// tables to decode that set of codes. Return Z_OK on success,\n\t\t// Z_BUF_ERROR\n\t\t// if the given code set is incomplete (the tables are still built in\n\t\t// this\n\t\t// case), Z_DATA_ERROR if the input is invalid (an over-subscribed set\n\t\t// of\n\t\t// lengths), or Z_MEM_ERROR if not enough memory.\n\n\t\tlet a; // counter for codes of length k\n\t\tlet f; // i repeats in table every f entries\n\t\tlet g; // maximum code length\n\t\tlet h; // table level\n\t\tlet i; // counter, current code\n\t\tlet j; // counter\n\t\tlet k; // number of bits in current code\n\t\tlet l; // bits per table (returned in m)\n\t\tlet mask; // (1 << w) - 1, to avoid cc -O bug on HP\n\t\tlet p; // pointer into c[], b[], or v[]\n\t\tlet q; // points to current table\n\t\tlet w; // bits before this table == (l * h)\n\t\tlet xp; // pointer into x\n\t\tlet y; // number of dummy codes added\n\t\tlet z; // number of entries in current table\n\n\t\t// Generate counts for each bit length\n\n\t\tp = 0;\n\t\ti = n;\n\t\tdo {\n\t\t\tc[b[bindex + p]]++;\n\t\t\tp++;\n\t\t\ti--; // assume all entries <= BMAX\n\t\t} while (i !== 0);\n\n\t\tif (c[0] == n) { // null input--all zero length codes\n\t\t\tt[0] = -1;\n\t\t\tm[0] = 0;\n\t\t\treturn Z_OK;\n\t\t}\n\n\t\t// Find minimum and maximum length, bound *m by those\n\t\tl = m[0];\n\t\tfor (j = 1; j <= BMAX; j++)\n\t\t\tif (c[j] !== 0)\n\t\t\t\tbreak;\n\t\tk = j; // minimum code length\n\t\tif (l < j) {\n\t\t\tl = j;\n\t\t}\n\t\tfor (i = BMAX; i !== 0; i--) {\n\t\t\tif (c[i] !== 0)\n\t\t\t\tbreak;\n\t\t}\n\t\tg = i; // maximum code length\n\t\tif (l > i) {\n\t\t\tl = i;\n\t\t}\n\t\tm[0] = l;\n\n\t\t// Adjust last length count to fill out codes, if needed\n\t\tfor (y = 1 << j; j < i; j++, y <<= 1) {\n\t\t\tif ((y -= c[j]) < 0) {\n\t\t\t\treturn Z_DATA_ERROR;\n\t\t\t}\n\t\t}\n\t\tif ((y -= c[i]) < 0) {\n\t\t\treturn Z_DATA_ERROR;\n\t\t}\n\t\tc[i] += y;\n\n\t\t// Generate starting offsets into the value table for each length\n\t\tx[1] = j = 0;\n\t\tp = 1;\n\t\txp = 2;\n\t\twhile (--i !== 0) { // note that i == g from above\n\t\t\tx[xp] = (j += c[p]);\n\t\t\txp++;\n\t\t\tp++;\n\t\t}\n\n\t\t// Make a table of values in order of bit lengths\n\t\ti = 0;\n\t\tp = 0;\n\t\tdo {\n\t\t\tif ((j = b[bindex + p]) !== 0) {\n\t\t\t\tv[x[j]++] = i;\n\t\t\t}\n\t\t\tp++;\n\t\t} while (++i < n);\n\t\tn = x[g]; // set n to length of v\n\n\t\t// Generate the Huffman codes and for each, make the table entries\n\t\tx[0] = i = 0; // first Huffman code is zero\n\t\tp = 0; // grab values in bit order\n\t\th = -1; // no tables yet--level -1\n\t\tw = -l; // bits decoded == (l * h)\n\t\tu[0] = 0; // just to keep compilers happy\n\t\tq = 0; // ditto\n\t\tz = 0; // ditto\n\n\t\t// go through the bit lengths (k already is bits in shortest code)\n\t\tfor (; k <= g; k++) {\n\t\t\ta = c[k];\n\t\t\twhile (a-- !== 0) {\n\t\t\t\t// here i is the Huffman code of length k bits for value *p\n\t\t\t\t// make tables up to required level\n\t\t\t\twhile (k > w + l) {\n\t\t\t\t\th++;\n\t\t\t\t\tw += l; // previous table always l bits\n\t\t\t\t\t// compute minimum size table less than or equal to l bits\n\t\t\t\t\tz = g - w;\n\t\t\t\t\tz = (z > l) ? l : z; // table size upper limit\n\t\t\t\t\tif ((f = 1 << (j = k - w)) > a + 1) { // try a k-w bit table\n\t\t\t\t\t\t// too few codes for\n\t\t\t\t\t\t// k-w bit table\n\t\t\t\t\t\tf -= a + 1; // deduct codes from patterns left\n\t\t\t\t\t\txp = k;\n\t\t\t\t\t\tif (j < z) {\n\t\t\t\t\t\t\twhile (++j < z) { // try smaller tables up to z bits\n\t\t\t\t\t\t\t\tif ((f <<= 1) <= c[++xp])\n\t\t\t\t\t\t\t\t\tbreak; // enough codes to use up j bits\n\t\t\t\t\t\t\t\tf -= c[xp]; // else deduct codes from patterns\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tz = 1 << j; // table entries for j-bit table\n\n\t\t\t\t\t// allocate new table\n\t\t\t\t\tif (hn[0] + z > MANY) { // (note: doesn't matter for fixed)\n\t\t\t\t\t\treturn Z_DATA_ERROR; // overflow of MANY\n\t\t\t\t\t}\n\t\t\t\t\tu[h] = q = /* hp+ */hn[0]; // DEBUG\n\t\t\t\t\thn[0] += z;\n\n\t\t\t\t\t// connect to last table, if there is one\n\t\t\t\t\tif (h !== 0) {\n\t\t\t\t\t\tx[h] = i; // save pattern for backing up\n\t\t\t\t\t\tr[0] = /* (byte) */j; // bits in this table\n\t\t\t\t\t\tr[1] = /* (byte) */l; // bits to dump before this table\n\t\t\t\t\t\tj = i >>> (w - l);\n\t\t\t\t\t\tr[2] = /* (int) */(q - u[h - 1] - j); // offset to this table\n\t\t\t\t\t\thp.set(r, (u[h - 1] + j) * 3);\n\t\t\t\t\t\t// to\n\t\t\t\t\t\t// last\n\t\t\t\t\t\t// table\n\t\t\t\t\t} else {\n\t\t\t\t\t\tt[0] = q; // first table is returned result\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// set up table entry in r\n\t\t\t\tr[1] = /* (byte) */(k - w);\n\t\t\t\tif (p >= n) {\n\t\t\t\t\tr[0] = 128 + 64; // out of values--invalid code\n\t\t\t\t} else if (v[p] < s) {\n\t\t\t\t\tr[0] = /* (byte) */(v[p] < 256 ? 0 : 32 + 64); // 256 is\n\t\t\t\t\t// end-of-block\n\t\t\t\t\tr[2] = v[p++]; // simple code is just the value\n\t\t\t\t} else {\n\t\t\t\t\tr[0] = /* (byte) */(e[v[p] - s] + 16 + 64); // non-simple--look\n\t\t\t\t\t// up in lists\n\t\t\t\t\tr[2] = d[v[p++] - s];\n\t\t\t\t}\n\n\t\t\t\t// fill code-like entries with r\n\t\t\t\tf = 1 << (k - w);\n\t\t\t\tfor (j = i >>> w; j < z; j += f) {\n\t\t\t\t\thp.set(r, (q + j) * 3);\n\t\t\t\t}\n\n\t\t\t\t// backwards increment the k-bit code i\n\t\t\t\tfor (j = 1 << (k - 1); (i & j) !== 0; j >>>= 1) {\n\t\t\t\t\ti ^= j;\n\t\t\t\t}\n\t\t\t\ti ^= j;\n\n\t\t\t\t// backup over finished tables\n\t\t\t\tmask = (1 << w) - 1; // needed on HP, cc -O bug\n\t\t\t\twhile ((i & mask) != x[h]) {\n\t\t\t\t\th--; // don't need to update q\n\t\t\t\t\tw -= l;\n\t\t\t\t\tmask = (1 << w) - 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// Return Z_BUF_ERROR if we were given an incomplete table\n\t\treturn y !== 0 && g != 1 ? Z_BUF_ERROR : Z_OK;\n\t}\n\n\tfunction initWorkArea(vsize) {\n\t\tlet i;\n\t\tif (!hn) {\n\t\t\thn = []; // []; //new Array(1);\n\t\t\tv = []; // new Array(vsize);\n\t\t\tc = new Int32Array(BMAX + 1); // new Array(BMAX + 1);\n\t\t\tr = []; // new Array(3);\n\t\t\tu = new Int32Array(BMAX); // new Array(BMAX);\n\t\t\tx = new Int32Array(BMAX + 1); // new Array(BMAX + 1);\n\t\t}\n\t\tif (v.length < vsize) {\n\t\t\tv = []; // new Array(vsize);\n\t\t}\n\t\tfor (i = 0; i < vsize; i++) {\n\t\t\tv[i] = 0;\n\t\t}\n\t\tfor (i = 0; i < BMAX + 1; i++) {\n\t\t\tc[i] = 0;\n\t\t}\n\t\tfor (i = 0; i < 3; i++) {\n\t\t\tr[i] = 0;\n\t\t}\n\t\t// for(int i=0; i 257)) {\n\t\t\tif (result == Z_DATA_ERROR) {\n\t\t\t\tz.msg = \"oversubscribed distance tree\";\n\t\t\t} else if (result == Z_BUF_ERROR) {\n\t\t\t\tz.msg = \"incomplete distance tree\";\n\t\t\t\tresult = Z_DATA_ERROR;\n\t\t\t} else if (result != Z_MEM_ERROR) {\n\t\t\t\tz.msg = \"empty distance tree with lengths\";\n\t\t\t\tresult = Z_DATA_ERROR;\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\treturn Z_OK;\n\t};\n\n}\n\nInfTree.inflate_trees_fixed = function (bl, // literal desired/actual bit depth\n\tbd, // distance desired/actual bit depth\n\ttl,// literal/length tree result\n\ttd// distance tree result\n) {\n\tbl[0] = fixed_bl;\n\tbd[0] = fixed_bd;\n\ttl[0] = fixed_tl;\n\ttd[0] = fixed_td;\n\treturn Z_OK;\n};\n\n// InfCodes\n\n// waiting for \"i:\"=input,\n// \"o:\"=output,\n// \"x:\"=nothing\nconst START = 0; // x: set up for LEN\nconst LEN = 1; // i: get length/literal/eob next\nconst LENEXT = 2; // i: getting length extra (have base)\nconst DIST = 3; // i: get distance next\nconst DISTEXT = 4;// i: getting distance extra\nconst COPY = 5; // o: copying bytes in win, waiting\n// for space\nconst LIT = 6; // o: got literal, waiting for output\n// space\nconst WASH = 7; // o: got eob, possibly still output\n// waiting\nconst END = 8; // x: got eob and all data flushed\nconst BADCODE = 9;// x: got error\n\nfunction InfCodes() {\n\tconst that = this;\n\n\tlet mode; // current inflate_codes mode\n\n\t// mode dependent information\n\tlet len = 0;\n\n\tlet tree; // pointer into tree\n\tlet tree_index = 0;\n\tlet need = 0; // bits needed\n\n\tlet lit = 0;\n\n\t// if EXT or COPY, where and how much\n\tlet get = 0; // bits to get for extra\n\tlet dist = 0; // distance back to copy from\n\n\tlet lbits = 0; // ltree bits decoded per branch\n\tlet dbits = 0; // dtree bits decoder per branch\n\tlet ltree; // literal/length/eob tree\n\tlet ltree_index = 0; // literal/length/eob tree\n\tlet dtree; // distance tree\n\tlet dtree_index = 0; // distance tree\n\n\t// Called with number of bytes left to write in win at least 258\n\t// (the maximum string length) and number of input bytes available\n\t// at least ten. The ten bytes are six bytes for the longest length/\n\t// distance pair plus four bytes for overloading the bit buffer.\n\n\tfunction inflate_fast(bl, bd, tl, tl_index, td, td_index, s, z) {\n\t\tlet t; // temporary pointer\n\t\tlet tp; // temporary pointer\n\t\tlet tp_index; // temporary pointer\n\t\tlet e; // extra bits or operation\n\t\tlet b; // bit buffer\n\t\tlet k; // bits in bit buffer\n\t\tlet p; // input data pointer\n\t\tlet n; // bytes available there\n\t\tlet q; // output win write pointer\n\t\tlet m; // bytes to end of win or read pointer\n\t\tlet ml; // mask for literal/length tree\n\t\tlet md; // mask for distance tree\n\t\tlet c; // bytes to copy\n\t\tlet d; // distance back to copy from\n\t\tlet r; // copy source pointer\n\n\t\tlet tp_index_t_3; // (tp_index+t)*3\n\n\t\t// load input, output, bit values\n\t\tp = z.next_in_index;\n\t\tn = z.avail_in;\n\t\tb = s.bitb;\n\t\tk = s.bitk;\n\t\tq = s.write;\n\t\tm = q < s.read ? s.read - q - 1 : s.end - q;\n\n\t\t// initialize masks\n\t\tml = inflate_mask[bl];\n\t\tmd = inflate_mask[bd];\n\n\t\t// do until not enough input or output space for fast loop\n\t\tdo { // assume called with m >= 258 && n >= 10\n\t\t\t// get literal/length code\n\t\t\twhile (k < (20)) { // max bits for literal/length code\n\t\t\t\tn--;\n\t\t\t\tb |= (z.read_byte(p++) & 0xff) << k;\n\t\t\t\tk += 8;\n\t\t\t}\n\n\t\t\tt = b & ml;\n\t\t\ttp = tl;\n\t\t\ttp_index = tl_index;\n\t\t\ttp_index_t_3 = (tp_index + t) * 3;\n\t\t\tif ((e = tp[tp_index_t_3]) === 0) {\n\t\t\t\tb >>= (tp[tp_index_t_3 + 1]);\n\t\t\t\tk -= (tp[tp_index_t_3 + 1]);\n\n\t\t\t\ts.win[q++] = /* (byte) */tp[tp_index_t_3 + 2];\n\t\t\t\tm--;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tdo {\n\n\t\t\t\tb >>= (tp[tp_index_t_3 + 1]);\n\t\t\t\tk -= (tp[tp_index_t_3 + 1]);\n\n\t\t\t\tif ((e & 16) !== 0) {\n\t\t\t\t\te &= 15;\n\t\t\t\t\tc = tp[tp_index_t_3 + 2] + (/* (int) */b & inflate_mask[e]);\n\n\t\t\t\t\tb >>= e;\n\t\t\t\t\tk -= e;\n\n\t\t\t\t\t// decode distance base of block to copy\n\t\t\t\t\twhile (k < (15)) { // max bits for distance code\n\t\t\t\t\t\tn--;\n\t\t\t\t\t\tb |= (z.read_byte(p++) & 0xff) << k;\n\t\t\t\t\t\tk += 8;\n\t\t\t\t\t}\n\n\t\t\t\t\tt = b & md;\n\t\t\t\t\ttp = td;\n\t\t\t\t\ttp_index = td_index;\n\t\t\t\t\ttp_index_t_3 = (tp_index + t) * 3;\n\t\t\t\t\te = tp[tp_index_t_3];\n\n\t\t\t\t\tdo {\n\n\t\t\t\t\t\tb >>= (tp[tp_index_t_3 + 1]);\n\t\t\t\t\t\tk -= (tp[tp_index_t_3 + 1]);\n\n\t\t\t\t\t\tif ((e & 16) !== 0) {\n\t\t\t\t\t\t\t// get extra bits to add to distance base\n\t\t\t\t\t\t\te &= 15;\n\t\t\t\t\t\t\twhile (k < (e)) { // get extra bits (up to 13)\n\t\t\t\t\t\t\t\tn--;\n\t\t\t\t\t\t\t\tb |= (z.read_byte(p++) & 0xff) << k;\n\t\t\t\t\t\t\t\tk += 8;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\td = tp[tp_index_t_3 + 2] + (b & inflate_mask[e]);\n\n\t\t\t\t\t\t\tb >>= (e);\n\t\t\t\t\t\t\tk -= (e);\n\n\t\t\t\t\t\t\t// do the copy\n\t\t\t\t\t\t\tm -= c;\n\t\t\t\t\t\t\tif (q >= d) { // offset before dest\n\t\t\t\t\t\t\t\t// just copy\n\t\t\t\t\t\t\t\tr = q - d;\n\t\t\t\t\t\t\t\tif (q - r > 0 && 2 > (q - r)) {\n\t\t\t\t\t\t\t\t\ts.win[q++] = s.win[r++]; // minimum\n\t\t\t\t\t\t\t\t\t// count is\n\t\t\t\t\t\t\t\t\t// three,\n\t\t\t\t\t\t\t\t\ts.win[q++] = s.win[r++]; // so unroll\n\t\t\t\t\t\t\t\t\t// loop a\n\t\t\t\t\t\t\t\t\t// little\n\t\t\t\t\t\t\t\t\tc -= 2;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts.win.set(s.win.subarray(r, r + 2), q);\n\t\t\t\t\t\t\t\t\tq += 2;\n\t\t\t\t\t\t\t\t\tr += 2;\n\t\t\t\t\t\t\t\t\tc -= 2;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else { // else offset after destination\n\t\t\t\t\t\t\t\tr = q - d;\n\t\t\t\t\t\t\t\tdo {\n\t\t\t\t\t\t\t\t\tr += s.end; // force pointer in win\n\t\t\t\t\t\t\t\t} while (r < 0); // covers invalid distances\n\t\t\t\t\t\t\t\te = s.end - r;\n\t\t\t\t\t\t\t\tif (c > e) { // if source crosses,\n\t\t\t\t\t\t\t\t\tc -= e; // wrapped copy\n\t\t\t\t\t\t\t\t\tif (q - r > 0 && e > (q - r)) {\n\t\t\t\t\t\t\t\t\t\tdo {\n\t\t\t\t\t\t\t\t\t\t\ts.win[q++] = s.win[r++];\n\t\t\t\t\t\t\t\t\t\t} while (--e !== 0);\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts.win.set(s.win.subarray(r, r + e), q);\n\t\t\t\t\t\t\t\t\t\tq += e;\n\t\t\t\t\t\t\t\t\t\tr += e;\n\t\t\t\t\t\t\t\t\t\te = 0;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tr = 0; // copy rest from start of win\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// copy all or what's left\n\t\t\t\t\t\t\tif (q - r > 0 && c > (q - r)) {\n\t\t\t\t\t\t\t\tdo {\n\t\t\t\t\t\t\t\t\ts.win[q++] = s.win[r++];\n\t\t\t\t\t\t\t\t} while (--c !== 0);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts.win.set(s.win.subarray(r, r + c), q);\n\t\t\t\t\t\t\t\tq += c;\n\t\t\t\t\t\t\t\tr += c;\n\t\t\t\t\t\t\t\tc = 0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t} else if ((e & 64) === 0) {\n\t\t\t\t\t\t\tt += tp[tp_index_t_3 + 2];\n\t\t\t\t\t\t\tt += (b & inflate_mask[e]);\n\t\t\t\t\t\t\ttp_index_t_3 = (tp_index + t) * 3;\n\t\t\t\t\t\t\te = tp[tp_index_t_3];\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tz.msg = \"invalid distance code\";\n\n\t\t\t\t\t\t\tc = z.avail_in - n;\n\t\t\t\t\t\t\tc = (k >> 3) < c ? k >> 3 : c;\n\t\t\t\t\t\t\tn += c;\n\t\t\t\t\t\t\tp -= c;\n\t\t\t\t\t\t\tk -= c << 3;\n\n\t\t\t\t\t\t\ts.bitb = b;\n\t\t\t\t\t\t\ts.bitk = k;\n\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\ts.write = q;\n\n\t\t\t\t\t\t\treturn Z_DATA_ERROR;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// eslint-disable-next-line no-constant-condition\n\t\t\t\t\t} while (true);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif ((e & 64) === 0) {\n\t\t\t\t\tt += tp[tp_index_t_3 + 2];\n\t\t\t\t\tt += (b & inflate_mask[e]);\n\t\t\t\t\ttp_index_t_3 = (tp_index + t) * 3;\n\t\t\t\t\tif ((e = tp[tp_index_t_3]) === 0) {\n\n\t\t\t\t\t\tb >>= (tp[tp_index_t_3 + 1]);\n\t\t\t\t\t\tk -= (tp[tp_index_t_3 + 1]);\n\n\t\t\t\t\t\ts.win[q++] = /* (byte) */tp[tp_index_t_3 + 2];\n\t\t\t\t\t\tm--;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t} else if ((e & 32) !== 0) {\n\n\t\t\t\t\tc = z.avail_in - n;\n\t\t\t\t\tc = (k >> 3) < c ? k >> 3 : c;\n\t\t\t\t\tn += c;\n\t\t\t\t\tp -= c;\n\t\t\t\t\tk -= c << 3;\n\n\t\t\t\t\ts.bitb = b;\n\t\t\t\t\ts.bitk = k;\n\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\ts.write = q;\n\n\t\t\t\t\treturn Z_STREAM_END;\n\t\t\t\t} else {\n\t\t\t\t\tz.msg = \"invalid literal/length code\";\n\n\t\t\t\t\tc = z.avail_in - n;\n\t\t\t\t\tc = (k >> 3) < c ? k >> 3 : c;\n\t\t\t\t\tn += c;\n\t\t\t\t\tp -= c;\n\t\t\t\t\tk -= c << 3;\n\n\t\t\t\t\ts.bitb = b;\n\t\t\t\t\ts.bitk = k;\n\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\ts.write = q;\n\n\t\t\t\t\treturn Z_DATA_ERROR;\n\t\t\t\t}\n\t\t\t\t// eslint-disable-next-line no-constant-condition\n\t\t\t} while (true);\n\t\t} while (m >= 258 && n >= 10);\n\n\t\t// not enough input or output--restore pointers and return\n\t\tc = z.avail_in - n;\n\t\tc = (k >> 3) < c ? k >> 3 : c;\n\t\tn += c;\n\t\tp -= c;\n\t\tk -= c << 3;\n\n\t\ts.bitb = b;\n\t\ts.bitk = k;\n\t\tz.avail_in = n;\n\t\tz.total_in += p - z.next_in_index;\n\t\tz.next_in_index = p;\n\t\ts.write = q;\n\n\t\treturn Z_OK;\n\t}\n\n\tthat.init = function (bl, bd, tl, tl_index, td, td_index) {\n\t\tmode = START;\n\t\tlbits = /* (byte) */bl;\n\t\tdbits = /* (byte) */bd;\n\t\tltree = tl;\n\t\tltree_index = tl_index;\n\t\tdtree = td;\n\t\tdtree_index = td_index;\n\t\ttree = null;\n\t};\n\n\tthat.proc = function (s, z, r) {\n\t\tlet j; // temporary storage\n\t\tlet tindex; // temporary pointer\n\t\tlet e; // extra bits or operation\n\t\tlet b = 0; // bit buffer\n\t\tlet k = 0; // bits in bit buffer\n\t\tlet p = 0; // input data pointer\n\t\tlet n; // bytes available there\n\t\tlet q; // output win write pointer\n\t\tlet m; // bytes to end of win or read pointer\n\t\tlet f; // pointer to copy strings from\n\n\t\t// copy input/output information to locals (UPDATE macro restores)\n\t\tp = z.next_in_index;\n\t\tn = z.avail_in;\n\t\tb = s.bitb;\n\t\tk = s.bitk;\n\t\tq = s.write;\n\t\tm = q < s.read ? s.read - q - 1 : s.end - q;\n\n\t\t// process input and output based on current state\n\t\t// eslint-disable-next-line no-constant-condition\n\t\twhile (true) {\n\t\t\tswitch (mode) {\n\t\t\t\t// waiting for \"i:\"=input, \"o:\"=output, \"x:\"=nothing\n\t\t\t\tcase START: // x: set up for LEN\n\t\t\t\t\tif (m >= 258 && n >= 10) {\n\n\t\t\t\t\t\ts.bitb = b;\n\t\t\t\t\t\ts.bitk = k;\n\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\ts.write = q;\n\t\t\t\t\t\tr = inflate_fast(lbits, dbits, ltree, ltree_index, dtree, dtree_index, s, z);\n\n\t\t\t\t\t\tp = z.next_in_index;\n\t\t\t\t\t\tn = z.avail_in;\n\t\t\t\t\t\tb = s.bitb;\n\t\t\t\t\t\tk = s.bitk;\n\t\t\t\t\t\tq = s.write;\n\t\t\t\t\t\tm = q < s.read ? s.read - q - 1 : s.end - q;\n\n\t\t\t\t\t\tif (r != Z_OK) {\n\t\t\t\t\t\t\tmode = r == Z_STREAM_END ? WASH : BADCODE;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tneed = lbits;\n\t\t\t\t\ttree = ltree;\n\t\t\t\t\ttree_index = ltree_index;\n\n\t\t\t\t\tmode = LEN;\n\t\t\t\t/* falls through */\n\t\t\t\tcase LEN: // i: get length/literal/eob next\n\t\t\t\t\tj = need;\n\n\t\t\t\t\twhile (k < (j)) {\n\t\t\t\t\t\tif (n !== 0)\n\t\t\t\t\t\t\tr = Z_OK;\n\t\t\t\t\t\telse {\n\n\t\t\t\t\t\t\ts.bitb = b;\n\t\t\t\t\t\t\ts.bitk = k;\n\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\ts.write = q;\n\t\t\t\t\t\t\treturn s.inflate_flush(z, r);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tn--;\n\t\t\t\t\t\tb |= (z.read_byte(p++) & 0xff) << k;\n\t\t\t\t\t\tk += 8;\n\t\t\t\t\t}\n\n\t\t\t\t\ttindex = (tree_index + (b & inflate_mask[j])) * 3;\n\n\t\t\t\t\tb >>>= (tree[tindex + 1]);\n\t\t\t\t\tk -= (tree[tindex + 1]);\n\n\t\t\t\t\te = tree[tindex];\n\n\t\t\t\t\tif (e === 0) { // literal\n\t\t\t\t\t\tlit = tree[tindex + 2];\n\t\t\t\t\t\tmode = LIT;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif ((e & 16) !== 0) { // length\n\t\t\t\t\t\tget = e & 15;\n\t\t\t\t\t\tlen = tree[tindex + 2];\n\t\t\t\t\t\tmode = LENEXT;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif ((e & 64) === 0) { // next table\n\t\t\t\t\t\tneed = e;\n\t\t\t\t\t\ttree_index = tindex / 3 + tree[tindex + 2];\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif ((e & 32) !== 0) { // end of block\n\t\t\t\t\t\tmode = WASH;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tmode = BADCODE; // invalid code\n\t\t\t\t\tz.msg = \"invalid literal/length code\";\n\t\t\t\t\tr = Z_DATA_ERROR;\n\n\t\t\t\t\ts.bitb = b;\n\t\t\t\t\ts.bitk = k;\n\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\ts.write = q;\n\t\t\t\t\treturn s.inflate_flush(z, r);\n\n\t\t\t\tcase LENEXT: // i: getting length extra (have base)\n\t\t\t\t\tj = get;\n\n\t\t\t\t\twhile (k < (j)) {\n\t\t\t\t\t\tif (n !== 0)\n\t\t\t\t\t\t\tr = Z_OK;\n\t\t\t\t\t\telse {\n\n\t\t\t\t\t\t\ts.bitb = b;\n\t\t\t\t\t\t\ts.bitk = k;\n\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\ts.write = q;\n\t\t\t\t\t\t\treturn s.inflate_flush(z, r);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tn--;\n\t\t\t\t\t\tb |= (z.read_byte(p++) & 0xff) << k;\n\t\t\t\t\t\tk += 8;\n\t\t\t\t\t}\n\n\t\t\t\t\tlen += (b & inflate_mask[j]);\n\n\t\t\t\t\tb >>= j;\n\t\t\t\t\tk -= j;\n\n\t\t\t\t\tneed = dbits;\n\t\t\t\t\ttree = dtree;\n\t\t\t\t\ttree_index = dtree_index;\n\t\t\t\t\tmode = DIST;\n\t\t\t\t/* falls through */\n\t\t\t\tcase DIST: // i: get distance next\n\t\t\t\t\tj = need;\n\n\t\t\t\t\twhile (k < (j)) {\n\t\t\t\t\t\tif (n !== 0)\n\t\t\t\t\t\t\tr = Z_OK;\n\t\t\t\t\t\telse {\n\n\t\t\t\t\t\t\ts.bitb = b;\n\t\t\t\t\t\t\ts.bitk = k;\n\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\ts.write = q;\n\t\t\t\t\t\t\treturn s.inflate_flush(z, r);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tn--;\n\t\t\t\t\t\tb |= (z.read_byte(p++) & 0xff) << k;\n\t\t\t\t\t\tk += 8;\n\t\t\t\t\t}\n\n\t\t\t\t\ttindex = (tree_index + (b & inflate_mask[j])) * 3;\n\n\t\t\t\t\tb >>= tree[tindex + 1];\n\t\t\t\t\tk -= tree[tindex + 1];\n\n\t\t\t\t\te = (tree[tindex]);\n\t\t\t\t\tif ((e & 16) !== 0) { // distance\n\t\t\t\t\t\tget = e & 15;\n\t\t\t\t\t\tdist = tree[tindex + 2];\n\t\t\t\t\t\tmode = DISTEXT;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif ((e & 64) === 0) { // next table\n\t\t\t\t\t\tneed = e;\n\t\t\t\t\t\ttree_index = tindex / 3 + tree[tindex + 2];\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tmode = BADCODE; // invalid code\n\t\t\t\t\tz.msg = \"invalid distance code\";\n\t\t\t\t\tr = Z_DATA_ERROR;\n\n\t\t\t\t\ts.bitb = b;\n\t\t\t\t\ts.bitk = k;\n\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\ts.write = q;\n\t\t\t\t\treturn s.inflate_flush(z, r);\n\n\t\t\t\tcase DISTEXT: // i: getting distance extra\n\t\t\t\t\tj = get;\n\n\t\t\t\t\twhile (k < (j)) {\n\t\t\t\t\t\tif (n !== 0)\n\t\t\t\t\t\t\tr = Z_OK;\n\t\t\t\t\t\telse {\n\n\t\t\t\t\t\t\ts.bitb = b;\n\t\t\t\t\t\t\ts.bitk = k;\n\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\ts.write = q;\n\t\t\t\t\t\t\treturn s.inflate_flush(z, r);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tn--;\n\t\t\t\t\t\tb |= (z.read_byte(p++) & 0xff) << k;\n\t\t\t\t\t\tk += 8;\n\t\t\t\t\t}\n\n\t\t\t\t\tdist += (b & inflate_mask[j]);\n\n\t\t\t\t\tb >>= j;\n\t\t\t\t\tk -= j;\n\n\t\t\t\t\tmode = COPY;\n\t\t\t\t/* falls through */\n\t\t\t\tcase COPY: // o: copying bytes in win, waiting for space\n\t\t\t\t\tf = q - dist;\n\t\t\t\t\twhile (f < 0) { // modulo win size-\"while\" instead\n\t\t\t\t\t\tf += s.end; // of \"if\" handles invalid distances\n\t\t\t\t\t}\n\t\t\t\t\twhile (len !== 0) {\n\n\t\t\t\t\t\tif (m === 0) {\n\t\t\t\t\t\t\tif (q == s.end && s.read !== 0) {\n\t\t\t\t\t\t\t\tq = 0;\n\t\t\t\t\t\t\t\tm = q < s.read ? s.read - q - 1 : s.end - q;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (m === 0) {\n\t\t\t\t\t\t\t\ts.write = q;\n\t\t\t\t\t\t\t\tr = s.inflate_flush(z, r);\n\t\t\t\t\t\t\t\tq = s.write;\n\t\t\t\t\t\t\t\tm = q < s.read ? s.read - q - 1 : s.end - q;\n\n\t\t\t\t\t\t\t\tif (q == s.end && s.read !== 0) {\n\t\t\t\t\t\t\t\t\tq = 0;\n\t\t\t\t\t\t\t\t\tm = q < s.read ? s.read - q - 1 : s.end - q;\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tif (m === 0) {\n\t\t\t\t\t\t\t\t\ts.bitb = b;\n\t\t\t\t\t\t\t\t\ts.bitk = k;\n\t\t\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\t\t\ts.write = q;\n\t\t\t\t\t\t\t\t\treturn s.inflate_flush(z, r);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\ts.win[q++] = s.win[f++];\n\t\t\t\t\t\tm--;\n\n\t\t\t\t\t\tif (f == s.end)\n\t\t\t\t\t\t\tf = 0;\n\t\t\t\t\t\tlen--;\n\t\t\t\t\t}\n\t\t\t\t\tmode = START;\n\t\t\t\t\tbreak;\n\t\t\t\tcase LIT: // o: got literal, waiting for output space\n\t\t\t\t\tif (m === 0) {\n\t\t\t\t\t\tif (q == s.end && s.read !== 0) {\n\t\t\t\t\t\t\tq = 0;\n\t\t\t\t\t\t\tm = q < s.read ? s.read - q - 1 : s.end - q;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (m === 0) {\n\t\t\t\t\t\t\ts.write = q;\n\t\t\t\t\t\t\tr = s.inflate_flush(z, r);\n\t\t\t\t\t\t\tq = s.write;\n\t\t\t\t\t\t\tm = q < s.read ? s.read - q - 1 : s.end - q;\n\n\t\t\t\t\t\t\tif (q == s.end && s.read !== 0) {\n\t\t\t\t\t\t\t\tq = 0;\n\t\t\t\t\t\t\t\tm = q < s.read ? s.read - q - 1 : s.end - q;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (m === 0) {\n\t\t\t\t\t\t\t\ts.bitb = b;\n\t\t\t\t\t\t\t\ts.bitk = k;\n\t\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\t\ts.write = q;\n\t\t\t\t\t\t\t\treturn s.inflate_flush(z, r);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tr = Z_OK;\n\n\t\t\t\t\ts.win[q++] = /* (byte) */lit;\n\t\t\t\t\tm--;\n\n\t\t\t\t\tmode = START;\n\t\t\t\t\tbreak;\n\t\t\t\tcase WASH: // o: got eob, possibly more output\n\t\t\t\t\tif (k > 7) { // return unused byte, if any\n\t\t\t\t\t\tk -= 8;\n\t\t\t\t\t\tn++;\n\t\t\t\t\t\tp--; // can always return one\n\t\t\t\t\t}\n\n\t\t\t\t\ts.write = q;\n\t\t\t\t\tr = s.inflate_flush(z, r);\n\t\t\t\t\tq = s.write;\n\t\t\t\t\tm = q < s.read ? s.read - q - 1 : s.end - q;\n\n\t\t\t\t\tif (s.read != s.write) {\n\t\t\t\t\t\ts.bitb = b;\n\t\t\t\t\t\ts.bitk = k;\n\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\ts.write = q;\n\t\t\t\t\t\treturn s.inflate_flush(z, r);\n\t\t\t\t\t}\n\t\t\t\t\tmode = END;\n\t\t\t\t/* falls through */\n\t\t\t\tcase END:\n\t\t\t\t\tr = Z_STREAM_END;\n\t\t\t\t\ts.bitb = b;\n\t\t\t\t\ts.bitk = k;\n\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\ts.write = q;\n\t\t\t\t\treturn s.inflate_flush(z, r);\n\n\t\t\t\tcase BADCODE: // x: got error\n\n\t\t\t\t\tr = Z_DATA_ERROR;\n\n\t\t\t\t\ts.bitb = b;\n\t\t\t\t\ts.bitk = k;\n\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\ts.write = q;\n\t\t\t\t\treturn s.inflate_flush(z, r);\n\n\t\t\t\tdefault:\n\t\t\t\t\tr = Z_STREAM_ERROR;\n\n\t\t\t\t\ts.bitb = b;\n\t\t\t\t\ts.bitk = k;\n\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\ts.write = q;\n\t\t\t\t\treturn s.inflate_flush(z, r);\n\t\t\t}\n\t\t}\n\t};\n\n\tthat.free = function () {\n\t\t// ZFREE(z, c);\n\t};\n\n}\n\n// InfBlocks\n\n// Table for deflate from PKZIP's appnote.txt.\nconst border = [ // Order of the bit length code lengths\n\t16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];\n\nconst TYPE = 0; // get type bits (3, including end bit)\nconst LENS = 1; // get lengths for stored\nconst STORED = 2;// processing stored block\nconst TABLE = 3; // get table lengths\nconst BTREE = 4; // get bit lengths tree for a dynamic\n// block\nconst DTREE = 5; // get length, distance trees for a\n// dynamic block\nconst CODES = 6; // processing fixed or dynamic block\nconst DRY = 7; // output remaining win bytes\nconst DONELOCKS = 8; // finished last block, done\nconst BADBLOCKS = 9; // ot a data error--stuck here\n\nfunction InfBlocks(z, w) {\n\tconst that = this;\n\n\tlet mode = TYPE; // current inflate_block mode\n\n\tlet left = 0; // if STORED, bytes left to copy\n\n\tlet table = 0; // table lengths (14 bits)\n\tlet index = 0; // index into blens (or border)\n\tlet blens; // bit lengths of codes\n\tconst bb = [0]; // bit length tree depth\n\tconst tb = [0]; // bit length decoding tree\n\n\tconst codes = new InfCodes(); // if CODES, current state\n\n\tlet last = 0; // true if this block is the last block\n\n\tlet hufts = new Int32Array(MANY * 3); // single malloc for tree space\n\tconst check = 0; // check on output\n\tconst inftree = new InfTree();\n\n\tthat.bitk = 0; // bits in bit buffer\n\tthat.bitb = 0; // bit buffer\n\tthat.win = new Uint8Array(w); // sliding win\n\tthat.end = w; // one byte after sliding win\n\tthat.read = 0; // win read pointer\n\tthat.write = 0; // win write pointer\n\n\tthat.reset = function (z, c) {\n\t\tif (c)\n\t\t\tc[0] = check;\n\t\t// if (mode == BTREE || mode == DTREE) {\n\t\t// }\n\t\tif (mode == CODES) {\n\t\t\tcodes.free(z);\n\t\t}\n\t\tmode = TYPE;\n\t\tthat.bitk = 0;\n\t\tthat.bitb = 0;\n\t\tthat.read = that.write = 0;\n\t};\n\n\tthat.reset(z, null);\n\n\t// copy as much as possible from the sliding win to the output area\n\tthat.inflate_flush = function (z, r) {\n\t\tlet n;\n\t\tlet p;\n\t\tlet q;\n\n\t\t// local copies of source and destination pointers\n\t\tp = z.next_out_index;\n\t\tq = that.read;\n\n\t\t// compute number of bytes to copy as far as end of win\n\t\tn = /* (int) */((q <= that.write ? that.write : that.end) - q);\n\t\tif (n > z.avail_out)\n\t\t\tn = z.avail_out;\n\t\tif (n !== 0 && r == Z_BUF_ERROR)\n\t\t\tr = Z_OK;\n\n\t\t// update counters\n\t\tz.avail_out -= n;\n\t\tz.total_out += n;\n\n\t\t// copy as far as end of win\n\t\tz.next_out.set(that.win.subarray(q, q + n), p);\n\t\tp += n;\n\t\tq += n;\n\n\t\t// see if more to copy at beginning of win\n\t\tif (q == that.end) {\n\t\t\t// wrap pointers\n\t\t\tq = 0;\n\t\t\tif (that.write == that.end)\n\t\t\t\tthat.write = 0;\n\n\t\t\t// compute bytes to copy\n\t\t\tn = that.write - q;\n\t\t\tif (n > z.avail_out)\n\t\t\t\tn = z.avail_out;\n\t\t\tif (n !== 0 && r == Z_BUF_ERROR)\n\t\t\t\tr = Z_OK;\n\n\t\t\t// update counters\n\t\t\tz.avail_out -= n;\n\t\t\tz.total_out += n;\n\n\t\t\t// copy\n\t\t\tz.next_out.set(that.win.subarray(q, q + n), p);\n\t\t\tp += n;\n\t\t\tq += n;\n\t\t}\n\n\t\t// update pointers\n\t\tz.next_out_index = p;\n\t\tthat.read = q;\n\n\t\t// done\n\t\treturn r;\n\t};\n\n\tthat.proc = function (z, r) {\n\t\tlet t; // temporary storage\n\t\tlet b; // bit buffer\n\t\tlet k; // bits in bit buffer\n\t\tlet p; // input data pointer\n\t\tlet n; // bytes available there\n\t\tlet q; // output win write pointer\n\t\tlet m; // bytes to end of win or read pointer\n\n\t\tlet i;\n\n\t\t// copy input/output information to locals (UPDATE macro restores)\n\t\t// {\n\t\tp = z.next_in_index;\n\t\tn = z.avail_in;\n\t\tb = that.bitb;\n\t\tk = that.bitk;\n\t\t// }\n\t\t// {\n\t\tq = that.write;\n\t\tm = /* (int) */(q < that.read ? that.read - q - 1 : that.end - q);\n\t\t// }\n\n\t\t// process input based on current state\n\t\t// DEBUG dtree\n\t\t// eslint-disable-next-line no-constant-condition\n\t\twhile (true) {\n\t\t\tlet bl, bd, tl, td, bl_, bd_, tl_, td_;\n\t\t\tswitch (mode) {\n\t\t\t\tcase TYPE:\n\n\t\t\t\t\twhile (k < (3)) {\n\t\t\t\t\t\tif (n !== 0) {\n\t\t\t\t\t\t\tr = Z_OK;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tn--;\n\t\t\t\t\t\tb |= (z.read_byte(p++) & 0xff) << k;\n\t\t\t\t\t\tk += 8;\n\t\t\t\t\t}\n\t\t\t\t\tt = /* (int) */(b & 7);\n\t\t\t\t\tlast = t & 1;\n\n\t\t\t\t\tswitch (t >>> 1) {\n\t\t\t\t\t\tcase 0: // stored\n\t\t\t\t\t\t\t// {\n\t\t\t\t\t\t\tb >>>= (3);\n\t\t\t\t\t\t\tk -= (3);\n\t\t\t\t\t\t\t// }\n\t\t\t\t\t\t\tt = k & 7; // go to byte boundary\n\n\t\t\t\t\t\t\t// {\n\t\t\t\t\t\t\tb >>>= (t);\n\t\t\t\t\t\t\tk -= (t);\n\t\t\t\t\t\t\t// }\n\t\t\t\t\t\t\tmode = LENS; // get length of stored block\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 1: // fixed\n\t\t\t\t\t\t\t// {\n\t\t\t\t\t\t\tbl = []; // new Array(1);\n\t\t\t\t\t\t\tbd = []; // new Array(1);\n\t\t\t\t\t\t\ttl = [[]]; // new Array(1);\n\t\t\t\t\t\t\ttd = [[]]; // new Array(1);\n\n\t\t\t\t\t\t\tInfTree.inflate_trees_fixed(bl, bd, tl, td);\n\t\t\t\t\t\t\tcodes.init(bl[0], bd[0], tl[0], 0, td[0], 0);\n\t\t\t\t\t\t\t// }\n\n\t\t\t\t\t\t\t// {\n\t\t\t\t\t\t\tb >>>= (3);\n\t\t\t\t\t\t\tk -= (3);\n\t\t\t\t\t\t\t// }\n\n\t\t\t\t\t\t\tmode = CODES;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 2: // dynamic\n\n\t\t\t\t\t\t\t// {\n\t\t\t\t\t\t\tb >>>= (3);\n\t\t\t\t\t\t\tk -= (3);\n\t\t\t\t\t\t\t// }\n\n\t\t\t\t\t\t\tmode = TABLE;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase 3: // illegal\n\n\t\t\t\t\t\t\t// {\n\t\t\t\t\t\t\tb >>>= (3);\n\t\t\t\t\t\t\tk -= (3);\n\t\t\t\t\t\t\t// }\n\t\t\t\t\t\t\tmode = BADBLOCKS;\n\t\t\t\t\t\t\tz.msg = \"invalid block type\";\n\t\t\t\t\t\t\tr = Z_DATA_ERROR;\n\n\t\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase LENS:\n\n\t\t\t\t\twhile (k < (32)) {\n\t\t\t\t\t\tif (n !== 0) {\n\t\t\t\t\t\t\tr = Z_OK;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tn--;\n\t\t\t\t\t\tb |= (z.read_byte(p++) & 0xff) << k;\n\t\t\t\t\t\tk += 8;\n\t\t\t\t\t}\n\n\t\t\t\t\tif ((((~b) >>> 16) & 0xffff) != (b & 0xffff)) {\n\t\t\t\t\t\tmode = BADBLOCKS;\n\t\t\t\t\t\tz.msg = \"invalid stored block lengths\";\n\t\t\t\t\t\tr = Z_DATA_ERROR;\n\n\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t}\n\t\t\t\t\tleft = (b & 0xffff);\n\t\t\t\t\tb = k = 0; // dump bits\n\t\t\t\t\tmode = left !== 0 ? STORED : (last !== 0 ? DRY : TYPE);\n\t\t\t\t\tbreak;\n\t\t\t\tcase STORED:\n\t\t\t\t\tif (n === 0) {\n\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t}\n\n\t\t\t\t\tif (m === 0) {\n\t\t\t\t\t\tif (q == that.end && that.read !== 0) {\n\t\t\t\t\t\t\tq = 0;\n\t\t\t\t\t\t\tm = /* (int) */(q < that.read ? that.read - q - 1 : that.end - q);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (m === 0) {\n\t\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\t\tr = that.inflate_flush(z, r);\n\t\t\t\t\t\t\tq = that.write;\n\t\t\t\t\t\t\tm = /* (int) */(q < that.read ? that.read - q - 1 : that.end - q);\n\t\t\t\t\t\t\tif (q == that.end && that.read !== 0) {\n\t\t\t\t\t\t\t\tq = 0;\n\t\t\t\t\t\t\t\tm = /* (int) */(q < that.read ? that.read - q - 1 : that.end - q);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (m === 0) {\n\t\t\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tr = Z_OK;\n\n\t\t\t\t\tt = left;\n\t\t\t\t\tif (t > n)\n\t\t\t\t\t\tt = n;\n\t\t\t\t\tif (t > m)\n\t\t\t\t\t\tt = m;\n\t\t\t\t\tthat.win.set(z.read_buf(p, t), q);\n\t\t\t\t\tp += t;\n\t\t\t\t\tn -= t;\n\t\t\t\t\tq += t;\n\t\t\t\t\tm -= t;\n\t\t\t\t\tif ((left -= t) !== 0)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tmode = last !== 0 ? DRY : TYPE;\n\t\t\t\t\tbreak;\n\t\t\t\tcase TABLE:\n\n\t\t\t\t\twhile (k < (14)) {\n\t\t\t\t\t\tif (n !== 0) {\n\t\t\t\t\t\t\tr = Z_OK;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tn--;\n\t\t\t\t\t\tb |= (z.read_byte(p++) & 0xff) << k;\n\t\t\t\t\t\tk += 8;\n\t\t\t\t\t}\n\n\t\t\t\t\ttable = t = (b & 0x3fff);\n\t\t\t\t\tif ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29) {\n\t\t\t\t\t\tmode = BADBLOCKS;\n\t\t\t\t\t\tz.msg = \"too many length or distance symbols\";\n\t\t\t\t\t\tr = Z_DATA_ERROR;\n\n\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t}\n\t\t\t\t\tt = 258 + (t & 0x1f) + ((t >> 5) & 0x1f);\n\t\t\t\t\tif (!blens || blens.length < t) {\n\t\t\t\t\t\tblens = []; // new Array(t);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfor (i = 0; i < t; i++) {\n\t\t\t\t\t\t\tblens[i] = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\t// {\n\t\t\t\t\tb >>>= (14);\n\t\t\t\t\tk -= (14);\n\t\t\t\t\t// }\n\n\t\t\t\t\tindex = 0;\n\t\t\t\t\tmode = BTREE;\n\t\t\t\t/* falls through */\n\t\t\t\tcase BTREE:\n\t\t\t\t\twhile (index < 4 + (table >>> 10)) {\n\t\t\t\t\t\twhile (k < (3)) {\n\t\t\t\t\t\t\tif (n !== 0) {\n\t\t\t\t\t\t\t\tr = Z_OK;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tn--;\n\t\t\t\t\t\t\tb |= (z.read_byte(p++) & 0xff) << k;\n\t\t\t\t\t\t\tk += 8;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tblens[border[index++]] = b & 7;\n\n\t\t\t\t\t\t// {\n\t\t\t\t\t\tb >>>= (3);\n\t\t\t\t\t\tk -= (3);\n\t\t\t\t\t\t// }\n\t\t\t\t\t}\n\n\t\t\t\t\twhile (index < 19) {\n\t\t\t\t\t\tblens[border[index++]] = 0;\n\t\t\t\t\t}\n\n\t\t\t\t\tbb[0] = 7;\n\t\t\t\t\tt = inftree.inflate_trees_bits(blens, bb, tb, hufts, z);\n\t\t\t\t\tif (t != Z_OK) {\n\t\t\t\t\t\tr = t;\n\t\t\t\t\t\tif (r == Z_DATA_ERROR) {\n\t\t\t\t\t\t\tblens = null;\n\t\t\t\t\t\t\tmode = BADBLOCKS;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t}\n\n\t\t\t\t\tindex = 0;\n\t\t\t\t\tmode = DTREE;\n\t\t\t\t/* falls through */\n\t\t\t\tcase DTREE:\n\t\t\t\t\t// eslint-disable-next-line no-constant-condition\n\t\t\t\t\twhile (true) {\n\t\t\t\t\t\tt = table;\n\t\t\t\t\t\tif (index >= 258 + (t & 0x1f) + ((t >> 5) & 0x1f)) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tlet j, c;\n\n\t\t\t\t\t\tt = bb[0];\n\n\t\t\t\t\t\twhile (k < (t)) {\n\t\t\t\t\t\t\tif (n !== 0) {\n\t\t\t\t\t\t\t\tr = Z_OK;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tn--;\n\t\t\t\t\t\t\tb |= (z.read_byte(p++) & 0xff) << k;\n\t\t\t\t\t\t\tk += 8;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// if (tb[0] == -1) {\n\t\t\t\t\t\t// System.err.println(\"null...\");\n\t\t\t\t\t\t// }\n\n\t\t\t\t\t\tt = hufts[(tb[0] + (b & inflate_mask[t])) * 3 + 1];\n\t\t\t\t\t\tc = hufts[(tb[0] + (b & inflate_mask[t])) * 3 + 2];\n\n\t\t\t\t\t\tif (c < 16) {\n\t\t\t\t\t\t\tb >>>= (t);\n\t\t\t\t\t\t\tk -= (t);\n\t\t\t\t\t\t\tblens[index++] = c;\n\t\t\t\t\t\t} else { // c == 16..18\n\t\t\t\t\t\t\ti = c == 18 ? 7 : c - 14;\n\t\t\t\t\t\t\tj = c == 18 ? 11 : 3;\n\n\t\t\t\t\t\t\twhile (k < (t + i)) {\n\t\t\t\t\t\t\t\tif (n !== 0) {\n\t\t\t\t\t\t\t\t\tr = Z_OK;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tn--;\n\t\t\t\t\t\t\t\tb |= (z.read_byte(p++) & 0xff) << k;\n\t\t\t\t\t\t\t\tk += 8;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tb >>>= (t);\n\t\t\t\t\t\t\tk -= (t);\n\n\t\t\t\t\t\t\tj += (b & inflate_mask[i]);\n\n\t\t\t\t\t\t\tb >>>= (i);\n\t\t\t\t\t\t\tk -= (i);\n\n\t\t\t\t\t\t\ti = index;\n\t\t\t\t\t\t\tt = table;\n\t\t\t\t\t\t\tif (i + j > 258 + (t & 0x1f) + ((t >> 5) & 0x1f) || (c == 16 && i < 1)) {\n\t\t\t\t\t\t\t\tblens = null;\n\t\t\t\t\t\t\t\tmode = BADBLOCKS;\n\t\t\t\t\t\t\t\tz.msg = \"invalid bit length repeat\";\n\t\t\t\t\t\t\t\tr = Z_DATA_ERROR;\n\n\t\t\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tc = c == 16 ? blens[i - 1] : 0;\n\t\t\t\t\t\t\tdo {\n\t\t\t\t\t\t\t\tblens[i++] = c;\n\t\t\t\t\t\t\t} while (--j !== 0);\n\t\t\t\t\t\t\tindex = i;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\ttb[0] = -1;\n\t\t\t\t\t// {\n\t\t\t\t\tbl_ = []; // new Array(1);\n\t\t\t\t\tbd_ = []; // new Array(1);\n\t\t\t\t\ttl_ = []; // new Array(1);\n\t\t\t\t\ttd_ = []; // new Array(1);\n\t\t\t\t\tbl_[0] = 9; // must be <= 9 for lookahead assumptions\n\t\t\t\t\tbd_[0] = 6; // must be <= 9 for lookahead assumptions\n\n\t\t\t\t\tt = table;\n\t\t\t\t\tt = inftree.inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f), blens, bl_, bd_, tl_, td_, hufts, z);\n\n\t\t\t\t\tif (t != Z_OK) {\n\t\t\t\t\t\tif (t == Z_DATA_ERROR) {\n\t\t\t\t\t\t\tblens = null;\n\t\t\t\t\t\t\tmode = BADBLOCKS;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tr = t;\n\n\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t}\n\t\t\t\t\tcodes.init(bl_[0], bd_[0], hufts, tl_[0], hufts, td_[0]);\n\t\t\t\t\t// }\n\t\t\t\t\tmode = CODES;\n\t\t\t\t/* falls through */\n\t\t\t\tcase CODES:\n\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\tthat.write = q;\n\n\t\t\t\t\tif ((r = codes.proc(that, z, r)) != Z_STREAM_END) {\n\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t}\n\t\t\t\t\tr = Z_OK;\n\t\t\t\t\tcodes.free(z);\n\n\t\t\t\t\tp = z.next_in_index;\n\t\t\t\t\tn = z.avail_in;\n\t\t\t\t\tb = that.bitb;\n\t\t\t\t\tk = that.bitk;\n\t\t\t\t\tq = that.write;\n\t\t\t\t\tm = /* (int) */(q < that.read ? that.read - q - 1 : that.end - q);\n\n\t\t\t\t\tif (last === 0) {\n\t\t\t\t\t\tmode = TYPE;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tmode = DRY;\n\t\t\t\t/* falls through */\n\t\t\t\tcase DRY:\n\t\t\t\t\tthat.write = q;\n\t\t\t\t\tr = that.inflate_flush(z, r);\n\t\t\t\t\tq = that.write;\n\t\t\t\t\tm = /* (int) */(q < that.read ? that.read - q - 1 : that.end - q);\n\t\t\t\t\tif (that.read != that.write) {\n\t\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\t\tthat.write = q;\n\t\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\t\t}\n\t\t\t\t\tmode = DONELOCKS;\n\t\t\t\t/* falls through */\n\t\t\t\tcase DONELOCKS:\n\t\t\t\t\tr = Z_STREAM_END;\n\n\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\tthat.write = q;\n\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t\tcase BADBLOCKS:\n\t\t\t\t\tr = Z_DATA_ERROR;\n\n\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\tthat.write = q;\n\t\t\t\t\treturn that.inflate_flush(z, r);\n\n\t\t\t\tdefault:\n\t\t\t\t\tr = Z_STREAM_ERROR;\n\n\t\t\t\t\tthat.bitb = b;\n\t\t\t\t\tthat.bitk = k;\n\t\t\t\t\tz.avail_in = n;\n\t\t\t\t\tz.total_in += p - z.next_in_index;\n\t\t\t\t\tz.next_in_index = p;\n\t\t\t\t\tthat.write = q;\n\t\t\t\t\treturn that.inflate_flush(z, r);\n\t\t\t}\n\t\t}\n\t};\n\n\tthat.free = function (z) {\n\t\tthat.reset(z, null);\n\t\tthat.win = null;\n\t\thufts = null;\n\t\t// ZFREE(z, s);\n\t};\n\n\tthat.set_dictionary = function (d, start, n) {\n\t\tthat.win.set(d.subarray(start, start + n), 0);\n\t\tthat.read = that.write = n;\n\t};\n\n\t// Returns true if inflate is currently at the end of a block generated\n\t// by Z_SYNC_FLUSH or Z_FULL_FLUSH.\n\tthat.sync_point = function () {\n\t\treturn mode == LENS ? 1 : 0;\n\t};\n\n}\n\n// Inflate\n\n// preset dictionary flag in zlib header\nconst PRESET_DICT = 0x20;\n\nconst Z_DEFLATED = 8;\n\nconst METHOD = 0; // waiting for method byte\nconst FLAG = 1; // waiting for flag byte\nconst DICT4 = 2; // four dictionary check bytes to go\nconst DICT3 = 3; // three dictionary check bytes to go\nconst DICT2 = 4; // two dictionary check bytes to go\nconst DICT1 = 5; // one dictionary check byte to go\nconst DICT0 = 6; // waiting for inflateSetDictionary\nconst BLOCKS = 7; // decompressing blocks\nconst DONE = 12; // finished check, done\nconst BAD = 13; // got an error--stay here\n\nconst mark = [0, 0, 0xff, 0xff];\n\nfunction Inflate() {\n\tconst that = this;\n\n\tthat.mode = 0; // current inflate mode\n\n\t// mode dependent information\n\tthat.method = 0; // if FLAGS, method byte\n\n\t// if CHECK, check values to compare\n\tthat.was = [0]; // new Array(1); // computed check value\n\tthat.need = 0; // stream check value\n\n\t// if BAD, inflateSync's marker bytes count\n\tthat.marker = 0;\n\n\t// mode independent information\n\tthat.wbits = 0; // log2(win size) (8..15, defaults to 15)\n\n\t// this.blocks; // current inflate_blocks state\n\n\tfunction inflateReset(z) {\n\t\tif (!z || !z.istate)\n\t\t\treturn Z_STREAM_ERROR;\n\n\t\tz.total_in = z.total_out = 0;\n\t\tz.msg = null;\n\t\tz.istate.mode = BLOCKS;\n\t\tz.istate.blocks.reset(z, null);\n\t\treturn Z_OK;\n\t}\n\n\tthat.inflateEnd = function (z) {\n\t\tif (that.blocks)\n\t\t\tthat.blocks.free(z);\n\t\tthat.blocks = null;\n\t\t// ZFREE(z, z->state);\n\t\treturn Z_OK;\n\t};\n\n\tthat.inflateInit = function (z, w) {\n\t\tz.msg = null;\n\t\tthat.blocks = null;\n\n\t\t// set win size\n\t\tif (w < 8 || w > 15) {\n\t\t\tthat.inflateEnd(z);\n\t\t\treturn Z_STREAM_ERROR;\n\t\t}\n\t\tthat.wbits = w;\n\n\t\tz.istate.blocks = new InfBlocks(z, 1 << w);\n\n\t\t// reset state\n\t\tinflateReset(z);\n\t\treturn Z_OK;\n\t};\n\n\tthat.inflate = function (z, f) {\n\t\tlet r;\n\t\tlet b;\n\n\t\tif (!z || !z.istate || !z.next_in)\n\t\t\treturn Z_STREAM_ERROR;\n\t\tconst istate = z.istate;\n\t\tf = f == Z_FINISH ? Z_BUF_ERROR : Z_OK;\n\t\tr = Z_BUF_ERROR;\n\t\t// eslint-disable-next-line no-constant-condition\n\t\twhile (true) {\n\t\t\tswitch (istate.mode) {\n\t\t\t\tcase METHOD:\n\n\t\t\t\t\tif (z.avail_in === 0)\n\t\t\t\t\t\treturn r;\n\t\t\t\t\tr = f;\n\n\t\t\t\t\tz.avail_in--;\n\t\t\t\t\tz.total_in++;\n\t\t\t\t\tif (((istate.method = z.read_byte(z.next_in_index++)) & 0xf) != Z_DEFLATED) {\n\t\t\t\t\t\tistate.mode = BAD;\n\t\t\t\t\t\tz.msg = \"unknown compression method\";\n\t\t\t\t\t\tistate.marker = 5; // can't try inflateSync\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif ((istate.method >> 4) + 8 > istate.wbits) {\n\t\t\t\t\t\tistate.mode = BAD;\n\t\t\t\t\t\tz.msg = \"invalid win size\";\n\t\t\t\t\t\tistate.marker = 5; // can't try inflateSync\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tistate.mode = FLAG;\n\t\t\t\t/* falls through */\n\t\t\t\tcase FLAG:\n\n\t\t\t\t\tif (z.avail_in === 0)\n\t\t\t\t\t\treturn r;\n\t\t\t\t\tr = f;\n\n\t\t\t\t\tz.avail_in--;\n\t\t\t\t\tz.total_in++;\n\t\t\t\t\tb = (z.read_byte(z.next_in_index++)) & 0xff;\n\n\t\t\t\t\tif ((((istate.method << 8) + b) % 31) !== 0) {\n\t\t\t\t\t\tistate.mode = BAD;\n\t\t\t\t\t\tz.msg = \"incorrect header check\";\n\t\t\t\t\t\tistate.marker = 5; // can't try inflateSync\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tif ((b & PRESET_DICT) === 0) {\n\t\t\t\t\t\tistate.mode = BLOCKS;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tistate.mode = DICT4;\n\t\t\t\t/* falls through */\n\t\t\t\tcase DICT4:\n\n\t\t\t\t\tif (z.avail_in === 0)\n\t\t\t\t\t\treturn r;\n\t\t\t\t\tr = f;\n\n\t\t\t\t\tz.avail_in--;\n\t\t\t\t\tz.total_in++;\n\t\t\t\t\tistate.need = ((z.read_byte(z.next_in_index++) & 0xff) << 24) & 0xff000000;\n\t\t\t\t\tistate.mode = DICT3;\n\t\t\t\t/* falls through */\n\t\t\t\tcase DICT3:\n\n\t\t\t\t\tif (z.avail_in === 0)\n\t\t\t\t\t\treturn r;\n\t\t\t\t\tr = f;\n\n\t\t\t\t\tz.avail_in--;\n\t\t\t\t\tz.total_in++;\n\t\t\t\t\tistate.need += ((z.read_byte(z.next_in_index++) & 0xff) << 16) & 0xff0000;\n\t\t\t\t\tistate.mode = DICT2;\n\t\t\t\t/* falls through */\n\t\t\t\tcase DICT2:\n\n\t\t\t\t\tif (z.avail_in === 0)\n\t\t\t\t\t\treturn r;\n\t\t\t\t\tr = f;\n\n\t\t\t\t\tz.avail_in--;\n\t\t\t\t\tz.total_in++;\n\t\t\t\t\tistate.need += ((z.read_byte(z.next_in_index++) & 0xff) << 8) & 0xff00;\n\t\t\t\t\tistate.mode = DICT1;\n\t\t\t\t/* falls through */\n\t\t\t\tcase DICT1:\n\n\t\t\t\t\tif (z.avail_in === 0)\n\t\t\t\t\t\treturn r;\n\t\t\t\t\tr = f;\n\n\t\t\t\t\tz.avail_in--;\n\t\t\t\t\tz.total_in++;\n\t\t\t\t\tistate.need += (z.read_byte(z.next_in_index++) & 0xff);\n\t\t\t\t\tistate.mode = DICT0;\n\t\t\t\t\treturn Z_NEED_DICT;\n\t\t\t\tcase DICT0:\n\t\t\t\t\tistate.mode = BAD;\n\t\t\t\t\tz.msg = \"need dictionary\";\n\t\t\t\t\tistate.marker = 0; // can try inflateSync\n\t\t\t\t\treturn Z_STREAM_ERROR;\n\t\t\t\tcase BLOCKS:\n\n\t\t\t\t\tr = istate.blocks.proc(z, r);\n\t\t\t\t\tif (r == Z_DATA_ERROR) {\n\t\t\t\t\t\tistate.mode = BAD;\n\t\t\t\t\t\tistate.marker = 0; // can try inflateSync\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif (r == Z_OK) {\n\t\t\t\t\t\tr = f;\n\t\t\t\t\t}\n\t\t\t\t\tif (r != Z_STREAM_END) {\n\t\t\t\t\t\treturn r;\n\t\t\t\t\t}\n\t\t\t\t\tr = f;\n\t\t\t\t\tistate.blocks.reset(z, istate.was);\n\t\t\t\t\tistate.mode = DONE;\n\t\t\t\t/* falls through */\n\t\t\t\tcase DONE:\n\t\t\t\t\tz.avail_in = 0;\n\t\t\t\t\treturn Z_STREAM_END;\n\t\t\t\tcase BAD:\n\t\t\t\t\treturn Z_DATA_ERROR;\n\t\t\t\tdefault:\n\t\t\t\t\treturn Z_STREAM_ERROR;\n\t\t\t}\n\t\t}\n\t};\n\n\tthat.inflateSetDictionary = function (z, dictionary, dictLength) {\n\t\tlet index = 0, length = dictLength;\n\t\tif (!z || !z.istate || z.istate.mode != DICT0)\n\t\t\treturn Z_STREAM_ERROR;\n\t\tconst istate = z.istate;\n\t\tif (length >= (1 << istate.wbits)) {\n\t\t\tlength = (1 << istate.wbits) - 1;\n\t\t\tindex = dictLength - length;\n\t\t}\n\t\tistate.blocks.set_dictionary(dictionary, index, length);\n\t\tistate.mode = BLOCKS;\n\t\treturn Z_OK;\n\t};\n\n\tthat.inflateSync = function (z) {\n\t\tlet n; // number of bytes to look at\n\t\tlet p; // pointer to bytes\n\t\tlet m; // number of marker bytes found in a row\n\t\tlet r, w; // temporaries to save total_in and total_out\n\n\t\t// set up\n\t\tif (!z || !z.istate)\n\t\t\treturn Z_STREAM_ERROR;\n\t\tconst istate = z.istate;\n\t\tif (istate.mode != BAD) {\n\t\t\tistate.mode = BAD;\n\t\t\tistate.marker = 0;\n\t\t}\n\t\tif ((n = z.avail_in) === 0)\n\t\t\treturn Z_BUF_ERROR;\n\t\tp = z.next_in_index;\n\t\tm = istate.marker;\n\n\t\t// search\n\t\twhile (n !== 0 && m < 4) {\n\t\t\tif (z.read_byte(p) == mark[m]) {\n\t\t\t\tm++;\n\t\t\t} else if (z.read_byte(p) !== 0) {\n\t\t\t\tm = 0;\n\t\t\t} else {\n\t\t\t\tm = 4 - m;\n\t\t\t}\n\t\t\tp++;\n\t\t\tn--;\n\t\t}\n\n\t\t// restore\n\t\tz.total_in += p - z.next_in_index;\n\t\tz.next_in_index = p;\n\t\tz.avail_in = n;\n\t\tistate.marker = m;\n\n\t\t// return no joy or set up to restart on a new block\n\t\tif (m != 4) {\n\t\t\treturn Z_DATA_ERROR;\n\t\t}\n\t\tr = z.total_in;\n\t\tw = z.total_out;\n\t\tinflateReset(z);\n\t\tz.total_in = r;\n\t\tz.total_out = w;\n\t\tistate.mode = BLOCKS;\n\t\treturn Z_OK;\n\t};\n\n\t// Returns true if inflate is currently at the end of a block generated\n\t// by Z_SYNC_FLUSH or Z_FULL_FLUSH. This function is used by one PPP\n\t// implementation to provide an additional safety check. PPP uses\n\t// Z_SYNC_FLUSH\n\t// but removes the length bytes of the resulting empty stored block. When\n\t// decompressing, PPP checks that at the end of input packet, inflate is\n\t// waiting for these length bytes.\n\tthat.inflateSyncPoint = function (z) {\n\t\tif (!z || !z.istate || !z.istate.blocks)\n\t\t\treturn Z_STREAM_ERROR;\n\t\treturn z.istate.blocks.sync_point();\n\t};\n}\n\n// ZStream\n\nfunction ZStream() {\n}\n\nZStream.prototype = {\n\tinflateInit(bits) {\n\t\tconst that = this;\n\t\tthat.istate = new Inflate();\n\t\tif (!bits)\n\t\t\tbits = MAX_BITS;\n\t\treturn that.istate.inflateInit(that, bits);\n\t},\n\n\tinflate(f) {\n\t\tconst that = this;\n\t\tif (!that.istate)\n\t\t\treturn Z_STREAM_ERROR;\n\t\treturn that.istate.inflate(that, f);\n\t},\n\n\tinflateEnd() {\n\t\tconst that = this;\n\t\tif (!that.istate)\n\t\t\treturn Z_STREAM_ERROR;\n\t\tconst ret = that.istate.inflateEnd(that);\n\t\tthat.istate = null;\n\t\treturn ret;\n\t},\n\n\tinflateSync() {\n\t\tconst that = this;\n\t\tif (!that.istate)\n\t\t\treturn Z_STREAM_ERROR;\n\t\treturn that.istate.inflateSync(that);\n\t},\n\tinflateSetDictionary(dictionary, dictLength) {\n\t\tconst that = this;\n\t\tif (!that.istate)\n\t\t\treturn Z_STREAM_ERROR;\n\t\treturn that.istate.inflateSetDictionary(that, dictionary, dictLength);\n\t},\n\tread_byte(start) {\n\t\tconst that = this;\n\t\treturn that.next_in[start];\n\t},\n\tread_buf(start, size) {\n\t\tconst that = this;\n\t\treturn that.next_in.subarray(start, start + size);\n\t}\n};\n\n// Inflater\n\nfunction ZipInflate(options) {\n\tconst that = this;\n\tconst z = new ZStream();\n\tconst bufsize = options && options.chunkSize ? Math.floor(options.chunkSize * 2) : 128 * 1024;\n\tconst flush = Z_NO_FLUSH;\n\tconst buf = new Uint8Array(bufsize);\n\tlet nomoreinput = false;\n\n\tz.inflateInit();\n\tz.next_out = buf;\n\n\tthat.append = function (data, onprogress) {\n\t\tconst buffers = [];\n\t\tlet err, array, lastIndex = 0, bufferIndex = 0, bufferSize = 0;\n\t\tif (data.length === 0)\n\t\t\treturn;\n\t\tz.next_in_index = 0;\n\t\tz.next_in = data;\n\t\tz.avail_in = data.length;\n\t\tdo {\n\t\t\tz.next_out_index = 0;\n\t\t\tz.avail_out = bufsize;\n\t\t\tif ((z.avail_in === 0) && (!nomoreinput)) { // if buffer is empty and more input is available, refill it\n\t\t\t\tz.next_in_index = 0;\n\t\t\t\tnomoreinput = true;\n\t\t\t}\n\t\t\terr = z.inflate(flush);\n\t\t\tif (nomoreinput && (err === Z_BUF_ERROR)) {\n\t\t\t\tif (z.avail_in !== 0)\n\t\t\t\t\tthrow new Error(\"inflating: bad input\");\n\t\t\t} else if (err !== Z_OK && err !== Z_STREAM_END)\n\t\t\t\tthrow new Error(\"inflating: \" + z.msg);\n\t\t\tif ((nomoreinput || err === Z_STREAM_END) && (z.avail_in === data.length))\n\t\t\t\tthrow new Error(\"inflating: bad input\");\n\t\t\tif (z.next_out_index)\n\t\t\t\tif (z.next_out_index === bufsize)\n\t\t\t\t\tbuffers.push(new Uint8Array(buf));\n\t\t\t\telse\n\t\t\t\t\tbuffers.push(buf.subarray(0, z.next_out_index));\n\t\t\tbufferSize += z.next_out_index;\n\t\t\tif (onprogress && z.next_in_index > 0 && z.next_in_index != lastIndex) {\n\t\t\t\tonprogress(z.next_in_index);\n\t\t\t\tlastIndex = z.next_in_index;\n\t\t\t}\n\t\t} while (z.avail_in > 0 || z.avail_out === 0);\n\t\tif (buffers.length > 1) {\n\t\t\tarray = new Uint8Array(bufferSize);\n\t\t\tbuffers.forEach(function (chunk) {\n\t\t\t\tarray.set(chunk, bufferIndex);\n\t\t\t\tbufferIndex += chunk.length;\n\t\t\t});\n\t\t} else {\n\t\t\tarray = buffers[0] ? new Uint8Array(buffers[0]) : new Uint8Array();\n\t\t}\n\t\treturn array;\n\t};\n\tthat.flush = function () {\n\t\tz.inflateEnd();\n\t};\n}\n\nexport {\n\tZipInflate as Inflate\n};", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nconst MAX_32_BITS = 0xffffffff;\nconst MAX_16_BITS = 0xffff;\nconst COMPRESSION_METHOD_DEFLATE = 0x08;\nconst COMPRESSION_METHOD_STORE = 0x00;\nconst COMPRESSION_METHOD_AES = 0x63;\n\nconst LOCAL_FILE_HEADER_SIGNATURE = 0x04034b50;\nconst SPLIT_ZIP_FILE_SIGNATURE = 0x08074b50;\nconst DATA_DESCRIPTOR_RECORD_SIGNATURE = SPLIT_ZIP_FILE_SIGNATURE;\nconst CENTRAL_FILE_HEADER_SIGNATURE = 0x02014b50;\nconst END_OF_CENTRAL_DIR_SIGNATURE = 0x06054b50;\nconst ZIP64_END_OF_CENTRAL_DIR_SIGNATURE = 0x06064b50;\nconst ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIGNATURE = 0x07064b50;\nconst END_OF_CENTRAL_DIR_LENGTH = 22;\nconst ZIP64_END_OF_CENTRAL_DIR_LOCATOR_LENGTH = 20;\nconst ZIP64_END_OF_CENTRAL_DIR_LENGTH = 56;\nconst ZIP64_END_OF_CENTRAL_DIR_TOTAL_LENGTH = END_OF_CENTRAL_DIR_LENGTH + ZIP64_END_OF_CENTRAL_DIR_LOCATOR_LENGTH + ZIP64_END_OF_CENTRAL_DIR_LENGTH;\n\nconst EXTRAFIELD_TYPE_ZIP64 = 0x0001;\nconst EXTRAFIELD_TYPE_AES = 0x9901;\nconst EXTRAFIELD_TYPE_NTFS = 0x000a;\nconst EXTRAFIELD_TYPE_NTFS_TAG1 = 0x0001;\nconst EXTRAFIELD_TYPE_EXTENDED_TIMESTAMP = 0x5455;\nconst EXTRAFIELD_TYPE_UNICODE_PATH = 0x7075;\nconst EXTRAFIELD_TYPE_UNICODE_COMMENT = 0x6375;\n\nconst BITFLAG_ENCRYPTED = 0x01;\nconst BITFLAG_LEVEL = 0x06;\nconst BITFLAG_DATA_DESCRIPTOR = 0x0008;\nconst BITFLAG_LANG_ENCODING_FLAG = 0x0800;\nconst FILE_ATTR_MSDOS_DIR_MASK = 0x10;\n\nconst VERSION_DEFLATE = 0x14;\nconst VERSION_ZIP64 = 0x2D;\nconst VERSION_AES = 0x33;\n\nconst DIRECTORY_SIGNATURE = \"/\";\n\nconst MAX_DATE = new Date(2107, 11, 31);\nconst MIN_DATE = new Date(1980, 0, 1);\n\nconst UNDEFINED_VALUE = undefined;\nconst UNDEFINED_TYPE = \"undefined\";\nconst FUNCTION_TYPE = \"function\";\n\nexport {\n\tMAX_32_BITS,\n\tMAX_16_BITS,\n\tCOMPRESSION_METHOD_DEFLATE,\n\tCOMPRESSION_METHOD_STORE,\n\tCOMPRESSION_METHOD_AES,\n\tSPLIT_ZIP_FILE_SIGNATURE,\n\tLOCAL_FILE_HEADER_SIGNATURE,\n\tDATA_DESCRIPTOR_RECORD_SIGNATURE,\n\tCENTRAL_FILE_HEADER_SIGNATURE,\n\tEND_OF_CENTRAL_DIR_SIGNATURE,\n\tZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIGNATURE,\n\tZIP64_END_OF_CENTRAL_DIR_SIGNATURE,\n\tEXTRAFIELD_TYPE_ZIP64,\n\tEXTRAFIELD_TYPE_AES,\n\tEXTRAFIELD_TYPE_NTFS,\n\tEXTRAFIELD_TYPE_NTFS_TAG1,\n\tEXTRAFIELD_TYPE_EXTENDED_TIMESTAMP,\n\tEXTRAFIELD_TYPE_UNICODE_PATH,\n\tEXTRAFIELD_TYPE_UNICODE_COMMENT,\n\tEND_OF_CENTRAL_DIR_LENGTH,\n\tZIP64_END_OF_CENTRAL_DIR_LOCATOR_LENGTH,\n\tZIP64_END_OF_CENTRAL_DIR_LENGTH,\n\tZIP64_END_OF_CENTRAL_DIR_TOTAL_LENGTH,\n\tBITFLAG_ENCRYPTED,\n\tBITFLAG_LEVEL,\n\tBITFLAG_DATA_DESCRIPTOR,\n\tBITFLAG_LANG_ENCODING_FLAG,\n\tFILE_ATTR_MSDOS_DIR_MASK,\n\tVERSION_DEFLATE,\n\tVERSION_ZIP64,\n\tVERSION_AES,\n\tDIRECTORY_SIGNATURE,\n\tMIN_DATE,\n\tMAX_DATE,\n\tUNDEFINED_VALUE,\n\tUNDEFINED_TYPE,\n\tFUNCTION_TYPE\n};", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global TransformStream */\n\nexport {\n\tStreamAdapter\n};\n\nclass StreamAdapter {\n\n\tconstructor(Codec) {\n\t\treturn class extends TransformStream {\n\t\t\tconstructor(_format, options) {\n\t\t\t\tconst codec = new Codec(options);\n\t\t\t\tsuper({\n\t\t\t\t\ttransform(chunk, controller) {\n\t\t\t\t\t\tcontroller.enqueue(codec.append(chunk));\n\t\t\t\t\t},\n\t\t\t\t\tflush(controller) {\n\t\t\t\t\t\tconst chunk = codec.flush();\n\t\t\t\t\t\tif (chunk) {\n\t\t\t\t\t\t\tcontroller.enqueue(chunk);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t};\n\t}\n}", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global navigator, CompressionStream, DecompressionStream */\n\nimport {\n\tUNDEFINED_VALUE,\n\tUNDEFINED_TYPE\n} from \"./constants.js\";\nimport { StreamAdapter } from \"./streams/stream-adapter.js\";\n\nconst MINIMUM_CHUNK_SIZE = 64;\nlet maxWorkers = 2;\ntry {\n\tif (typeof navigator != UNDEFINED_TYPE && navigator.hardwareConcurrency) {\n\t\tmaxWorkers = navigator.hardwareConcurrency;\n\t}\n} catch (_error) {\n\t// ignored\n}\nconst DEFAULT_CONFIGURATION = {\n\tchunkSize: 512 * 1024,\n\tmaxWorkers,\n\tterminateWorkerTimeout: 5000,\n\tuseWebWorkers: true,\n\tuseCompressionStream: true,\n\tworkerScripts: UNDEFINED_VALUE,\n\tCompressionStreamNative: typeof CompressionStream != UNDEFINED_TYPE && CompressionStream,\n\tDecompressionStreamNative: typeof DecompressionStream != UNDEFINED_TYPE && DecompressionStream\n};\n\nconst config = Object.assign({}, DEFAULT_CONFIGURATION);\n\nexport {\n\tconfigure,\n\tgetConfiguration,\n\tgetChunkSize\n};\n\nfunction getConfiguration() {\n\treturn config;\n}\n\nfunction getChunkSize(config) {\n\treturn Math.max(config.chunkSize, MINIMUM_CHUNK_SIZE);\n}\n\nfunction configure(configuration) {\n\tconst {\n\t\tbaseURL,\n\t\tchunkSize,\n\t\tmaxWorkers,\n\t\tterminateWorkerTimeout,\n\t\tuseCompressionStream,\n\t\tuseWebWorkers,\n\t\tDeflate,\n\t\tInflate,\n\t\tCompressionStream,\n\t\tDecompressionStream,\n\t\tworkerScripts\n\t} = configuration;\n\tsetIfDefined(\"baseURL\", baseURL);\n\tsetIfDefined(\"chunkSize\", chunkSize);\n\tsetIfDefined(\"maxWorkers\", maxWorkers);\n\tsetIfDefined(\"terminateWorkerTimeout\", terminateWorkerTimeout);\n\tsetIfDefined(\"useCompressionStream\", useCompressionStream);\n\tsetIfDefined(\"useWebWorkers\", useWebWorkers);\n\tif (Deflate) {\n\t\tconfig.CompressionStream = new StreamAdapter(Deflate);\n\t}\n\tif (Inflate) {\n\t\tconfig.DecompressionStream = new StreamAdapter(Inflate);\n\t}\n\tsetIfDefined(\"CompressionStream\", CompressionStream);\n\tsetIfDefined(\"DecompressionStream\", DecompressionStream);\n\tif (workerScripts !== UNDEFINED_VALUE) {\n\t\tconst { deflate, inflate } = workerScripts;\n\t\tif (deflate || inflate) {\n\t\t\tif (!config.workerScripts) {\n\t\t\t\tconfig.workerScripts = {};\n\t\t\t}\n\t\t}\n\t\tif (deflate) {\n\t\t\tif (!Array.isArray(deflate)) {\n\t\t\t\tthrow new Error(\"workerScripts.deflate must be an array\");\n\t\t\t}\n\t\t\tconfig.workerScripts.deflate = deflate;\n\t\t}\n\t\tif (inflate) {\n\t\t\tif (!Array.isArray(inflate)) {\n\t\t\t\tthrow new Error(\"workerScripts.inflate must be an array\");\n\t\t\t}\n\t\t\tconfig.workerScripts.inflate = inflate;\n\t\t}\n\t}\n}\n\nfunction setIfDefined(propertyName, propertyValue) {\n\tif (propertyValue !== UNDEFINED_VALUE) {\n\t\tconfig[propertyName] = propertyValue;\n\t}\n}\n", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n// deno-lint-ignore-file no-prototype-builtins\n\nimport { getMimeType as getDefaultMimeType } from \"./default-mime-type.js\";\n\nconst table = {\n\t\"application\": {\n\t\t\"andrew-inset\": \"ez\",\n\t\t\"annodex\": \"anx\",\n\t\t\"atom+xml\": \"atom\",\n\t\t\"atomcat+xml\": \"atomcat\",\n\t\t\"atomserv+xml\": \"atomsrv\",\n\t\t\"bbolin\": \"lin\",\n\t\t\"cu-seeme\": \"cu\",\n\t\t\"davmount+xml\": \"davmount\",\n\t\t\"dsptype\": \"tsp\",\n\t\t\"ecmascript\": [\n\t\t\t\"es\",\n\t\t\t\"ecma\"\n\t\t],\n\t\t\"futuresplash\": \"spl\",\n\t\t\"hta\": \"hta\",\n\t\t\"java-archive\": \"jar\",\n\t\t\"java-serialized-object\": \"ser\",\n\t\t\"java-vm\": \"class\",\n\t\t\"m3g\": \"m3g\",\n\t\t\"mac-binhex40\": \"hqx\",\n\t\t\"mathematica\": [\n\t\t\t\"nb\",\n\t\t\t\"ma\",\n\t\t\t\"mb\"\n\t\t],\n\t\t\"msaccess\": \"mdb\",\n\t\t\"msword\": [\n\t\t\t\"doc\",\n\t\t\t\"dot\",\n\t\t\t\"wiz\"\n\t\t],\n\t\t\"mxf\": \"mxf\",\n\t\t\"oda\": \"oda\",\n\t\t\"ogg\": \"ogx\",\n\t\t\"pdf\": \"pdf\",\n\t\t\"pgp-keys\": \"key\",\n\t\t\"pgp-signature\": [\n\t\t\t\"asc\",\n\t\t\t\"sig\"\n\t\t],\n\t\t\"pics-rules\": \"prf\",\n\t\t\"postscript\": [\n\t\t\t\"ps\",\n\t\t\t\"ai\",\n\t\t\t\"eps\",\n\t\t\t\"epsi\",\n\t\t\t\"epsf\",\n\t\t\t\"eps2\",\n\t\t\t\"eps3\"\n\t\t],\n\t\t\"rar\": \"rar\",\n\t\t\"rdf+xml\": \"rdf\",\n\t\t\"rss+xml\": \"rss\",\n\t\t\"rtf\": \"rtf\",\n\t\t\"xhtml+xml\": [\n\t\t\t\"xhtml\",\n\t\t\t\"xht\"\n\t\t],\n\t\t\"xml\": [\n\t\t\t\"xml\",\n\t\t\t\"xsl\",\n\t\t\t\"xsd\",\n\t\t\t\"xpdl\"\n\t\t],\n\t\t\"xspf+xml\": \"xspf\",\n\t\t\"zip\": \"zip\",\n\t\t\"vnd.android.package-archive\": \"apk\",\n\t\t\"vnd.cinderella\": \"cdy\",\n\t\t\"vnd.google-earth.kml+xml\": \"kml\",\n\t\t\"vnd.google-earth.kmz\": \"kmz\",\n\t\t\"vnd.mozilla.xul+xml\": \"xul\",\n\t\t\"vnd.ms-excel\": [\n\t\t\t\"xls\",\n\t\t\t\"xlb\",\n\t\t\t\"xlt\",\n\t\t\t\"xlm\",\n\t\t\t\"xla\",\n\t\t\t\"xlc\",\n\t\t\t\"xlw\"\n\t\t],\n\t\t\"vnd.ms-pki.seccat\": \"cat\",\n\t\t\"vnd.ms-pki.stl\": \"stl\",\n\t\t\"vnd.ms-powerpoint\": [\n\t\t\t\"ppt\",\n\t\t\t\"pps\",\n\t\t\t\"pot\",\n\t\t\t\"ppa\",\n\t\t\t\"pwz\"\n\t\t],\n\t\t\"vnd.oasis.opendocument.chart\": \"odc\",\n\t\t\"vnd.oasis.opendocument.database\": \"odb\",\n\t\t\"vnd.oasis.opendocument.formula\": \"odf\",\n\t\t\"vnd.oasis.opendocument.graphics\": \"odg\",\n\t\t\"vnd.oasis.opendocument.graphics-template\": \"otg\",\n\t\t\"vnd.oasis.opendocument.image\": \"odi\",\n\t\t\"vnd.oasis.opendocument.presentation\": \"odp\",\n\t\t\"vnd.oasis.opendocument.presentation-template\": \"otp\",\n\t\t\"vnd.oasis.opendocument.spreadsheet\": \"ods\",\n\t\t\"vnd.oasis.opendocument.spreadsheet-template\": \"ots\",\n\t\t\"vnd.oasis.opendocument.text\": \"odt\",\n\t\t\"vnd.oasis.opendocument.text-master\": [\n\t\t\t\"odm\",\n\t\t\t\"otm\"\n\t\t],\n\t\t\"vnd.oasis.opendocument.text-template\": \"ott\",\n\t\t\"vnd.oasis.opendocument.text-web\": \"oth\",\n\t\t\"vnd.openxmlformats-officedocument.spreadsheetml.sheet\": \"xlsx\",\n\t\t\"vnd.openxmlformats-officedocument.spreadsheetml.template\": \"xltx\",\n\t\t\"vnd.openxmlformats-officedocument.presentationml.presentation\": \"pptx\",\n\t\t\"vnd.openxmlformats-officedocument.presentationml.slideshow\": \"ppsx\",\n\t\t\"vnd.openxmlformats-officedocument.presentationml.template\": \"potx\",\n\t\t\"vnd.openxmlformats-officedocument.wordprocessingml.document\": \"docx\",\n\t\t\"vnd.openxmlformats-officedocument.wordprocessingml.template\": \"dotx\",\n\t\t\"vnd.smaf\": \"mmf\",\n\t\t\"vnd.stardivision.calc\": \"sdc\",\n\t\t\"vnd.stardivision.chart\": \"sds\",\n\t\t\"vnd.stardivision.draw\": \"sda\",\n\t\t\"vnd.stardivision.impress\": \"sdd\",\n\t\t\"vnd.stardivision.math\": [\n\t\t\t\"sdf\",\n\t\t\t\"smf\"\n\t\t],\n\t\t\"vnd.stardivision.writer\": [\n\t\t\t\"sdw\",\n\t\t\t\"vor\"\n\t\t],\n\t\t\"vnd.stardivision.writer-global\": \"sgl\",\n\t\t\"vnd.sun.xml.calc\": \"sxc\",\n\t\t\"vnd.sun.xml.calc.template\": \"stc\",\n\t\t\"vnd.sun.xml.draw\": \"sxd\",\n\t\t\"vnd.sun.xml.draw.template\": \"std\",\n\t\t\"vnd.sun.xml.impress\": \"sxi\",\n\t\t\"vnd.sun.xml.impress.template\": \"sti\",\n\t\t\"vnd.sun.xml.math\": \"sxm\",\n\t\t\"vnd.sun.xml.writer\": \"sxw\",\n\t\t\"vnd.sun.xml.writer.global\": \"sxg\",\n\t\t\"vnd.sun.xml.writer.template\": \"stw\",\n\t\t\"vnd.symbian.install\": [\n\t\t\t\"sis\",\n\t\t\t\"sisx\"\n\t\t],\n\t\t\"vnd.visio\": [\n\t\t\t\"vsd\",\n\t\t\t\"vst\",\n\t\t\t\"vss\",\n\t\t\t\"vsw\",\n\t\t\t\"vsdx\",\n\t\t\t\"vssx\",\n\t\t\t\"vstx\",\n\t\t\t\"vssm\",\n\t\t\t\"vstm\"\n\t\t],\n\t\t\"vnd.wap.wbxml\": \"wbxml\",\n\t\t\"vnd.wap.wmlc\": \"wmlc\",\n\t\t\"vnd.wap.wmlscriptc\": \"wmlsc\",\n\t\t\"vnd.wordperfect\": \"wpd\",\n\t\t\"vnd.wordperfect5.1\": \"wp5\",\n\t\t\"x-123\": \"wk\",\n\t\t\"x-7z-compressed\": \"7z\",\n\t\t\"x-abiword\": \"abw\",\n\t\t\"x-apple-diskimage\": \"dmg\",\n\t\t\"x-bcpio\": \"bcpio\",\n\t\t\"x-bittorrent\": \"torrent\",\n\t\t\"x-cbr\": [\n\t\t\t\"cbr\",\n\t\t\t\"cba\",\n\t\t\t\"cbt\",\n\t\t\t\"cb7\"\n\t\t],\n\t\t\"x-cbz\": \"cbz\",\n\t\t\"x-cdf\": [\n\t\t\t\"cdf\",\n\t\t\t\"cda\"\n\t\t],\n\t\t\"x-cdlink\": \"vcd\",\n\t\t\"x-chess-pgn\": \"pgn\",\n\t\t\"x-cpio\": \"cpio\",\n\t\t\"x-csh\": \"csh\",\n\t\t\"x-director\": [\n\t\t\t\"dir\",\n\t\t\t\"dxr\",\n\t\t\t\"cst\",\n\t\t\t\"cct\",\n\t\t\t\"cxt\",\n\t\t\t\"w3d\",\n\t\t\t\"fgd\",\n\t\t\t\"swa\"\n\t\t],\n\t\t\"x-dms\": \"dms\",\n\t\t\"x-doom\": \"wad\",\n\t\t\"x-dvi\": \"dvi\",\n\t\t\"x-httpd-eruby\": \"rhtml\",\n\t\t\"x-font\": \"pcf.Z\",\n\t\t\"x-freemind\": \"mm\",\n\t\t\"x-gnumeric\": \"gnumeric\",\n\t\t\"x-go-sgf\": \"sgf\",\n\t\t\"x-graphing-calculator\": \"gcf\",\n\t\t\"x-gtar\": [\n\t\t\t\"gtar\",\n\t\t\t\"taz\"\n\t\t],\n\t\t\"x-hdf\": \"hdf\",\n\t\t\"x-httpd-php\": [\n\t\t\t\"phtml\",\n\t\t\t\"pht\",\n\t\t\t\"php\"\n\t\t],\n\t\t\"x-httpd-php-source\": \"phps\",\n\t\t\"x-httpd-php3\": \"php3\",\n\t\t\"x-httpd-php3-preprocessed\": \"php3p\",\n\t\t\"x-httpd-php4\": \"php4\",\n\t\t\"x-httpd-php5\": \"php5\",\n\t\t\"x-ica\": \"ica\",\n\t\t\"x-info\": \"info\",\n\t\t\"x-internet-signup\": [\n\t\t\t\"ins\",\n\t\t\t\"isp\"\n\t\t],\n\t\t\"x-iphone\": \"iii\",\n\t\t\"x-iso9660-image\": \"iso\",\n\t\t\"x-java-jnlp-file\": \"jnlp\",\n\t\t\"x-jmol\": \"jmz\",\n\t\t\"x-killustrator\": \"kil\",\n\t\t\"x-latex\": \"latex\",\n\t\t\"x-lyx\": \"lyx\",\n\t\t\"x-lzx\": \"lzx\",\n\t\t\"x-maker\": [\n\t\t\t\"frm\",\n\t\t\t\"fb\",\n\t\t\t\"fbdoc\"\n\t\t],\n\t\t\"x-ms-wmd\": \"wmd\",\n\t\t\"x-msdos-program\": [\n\t\t\t\"com\",\n\t\t\t\"exe\",\n\t\t\t\"bat\",\n\t\t\t\"dll\"\n\t\t],\n\t\t\"x-netcdf\": [\n\t\t\t\"nc\"\n\t\t],\n\t\t\"x-ns-proxy-autoconfig\": [\n\t\t\t\"pac\",\n\t\t\t\"dat\"\n\t\t],\n\t\t\"x-nwc\": \"nwc\",\n\t\t\"x-object\": \"o\",\n\t\t\"x-oz-application\": \"oza\",\n\t\t\"x-pkcs7-certreqresp\": \"p7r\",\n\t\t\"x-python-code\": [\n\t\t\t\"pyc\",\n\t\t\t\"pyo\"\n\t\t],\n\t\t\"x-qgis\": [\n\t\t\t\"qgs\",\n\t\t\t\"shp\",\n\t\t\t\"shx\"\n\t\t],\n\t\t\"x-quicktimeplayer\": \"qtl\",\n\t\t\"x-redhat-package-manager\": [\n\t\t\t\"rpm\",\n\t\t\t\"rpa\"\n\t\t],\n\t\t\"x-ruby\": \"rb\",\n\t\t\"x-sh\": \"sh\",\n\t\t\"x-shar\": \"shar\",\n\t\t\"x-shockwave-flash\": [\n\t\t\t\"swf\",\n\t\t\t\"swfl\"\n\t\t],\n\t\t\"x-silverlight\": \"scr\",\n\t\t\"x-stuffit\": \"sit\",\n\t\t\"x-sv4cpio\": \"sv4cpio\",\n\t\t\"x-sv4crc\": \"sv4crc\",\n\t\t\"x-tar\": \"tar\",\n\t\t\"x-tex-gf\": \"gf\",\n\t\t\"x-tex-pk\": \"pk\",\n\t\t\"x-texinfo\": [\n\t\t\t\"texinfo\",\n\t\t\t\"texi\"\n\t\t],\n\t\t\"x-trash\": [\n\t\t\t\"~\",\n\t\t\t\"%\",\n\t\t\t\"bak\",\n\t\t\t\"old\",\n\t\t\t\"sik\"\n\t\t],\n\t\t\"x-ustar\": \"ustar\",\n\t\t\"x-wais-source\": \"src\",\n\t\t\"x-wingz\": \"wz\",\n\t\t\"x-x509-ca-cert\": [\n\t\t\t\"crt\",\n\t\t\t\"der\",\n\t\t\t\"cer\"\n\t\t],\n\t\t\"x-xcf\": \"xcf\",\n\t\t\"x-xfig\": \"fig\",\n\t\t\"x-xpinstall\": \"xpi\",\n\t\t\"applixware\": \"aw\",\n\t\t\"atomsvc+xml\": \"atomsvc\",\n\t\t\"ccxml+xml\": \"ccxml\",\n\t\t\"cdmi-capability\": \"cdmia\",\n\t\t\"cdmi-container\": \"cdmic\",\n\t\t\"cdmi-domain\": \"cdmid\",\n\t\t\"cdmi-object\": \"cdmio\",\n\t\t\"cdmi-queue\": \"cdmiq\",\n\t\t\"docbook+xml\": \"dbk\",\n\t\t\"dssc+der\": \"dssc\",\n\t\t\"dssc+xml\": \"xdssc\",\n\t\t\"emma+xml\": \"emma\",\n\t\t\"epub+zip\": \"epub\",\n\t\t\"exi\": \"exi\",\n\t\t\"font-tdpfr\": \"pfr\",\n\t\t\"gml+xml\": \"gml\",\n\t\t\"gpx+xml\": \"gpx\",\n\t\t\"gxf\": \"gxf\",\n\t\t\"hyperstudio\": \"stk\",\n\t\t\"inkml+xml\": [\n\t\t\t\"ink\",\n\t\t\t\"inkml\"\n\t\t],\n\t\t\"ipfix\": \"ipfix\",\n\t\t\"jsonml+json\": \"jsonml\",\n\t\t\"lost+xml\": \"lostxml\",\n\t\t\"mads+xml\": \"mads\",\n\t\t\"marc\": \"mrc\",\n\t\t\"marcxml+xml\": \"mrcx\",\n\t\t\"mathml+xml\": [\n\t\t\t\"mathml\",\n\t\t\t\"mml\"\n\t\t],\n\t\t\"mbox\": \"mbox\",\n\t\t\"mediaservercontrol+xml\": \"mscml\",\n\t\t\"metalink+xml\": \"metalink\",\n\t\t\"metalink4+xml\": \"meta4\",\n\t\t\"mets+xml\": \"mets\",\n\t\t\"mods+xml\": \"mods\",\n\t\t\"mp21\": [\n\t\t\t\"m21\",\n\t\t\t\"mp21\"\n\t\t],\n\t\t\"mp4\": \"mp4s\",\n\t\t\"oebps-package+xml\": \"opf\",\n\t\t\"omdoc+xml\": \"omdoc\",\n\t\t\"onenote\": [\n\t\t\t\"onetoc\",\n\t\t\t\"onetoc2\",\n\t\t\t\"onetmp\",\n\t\t\t\"onepkg\"\n\t\t],\n\t\t\"oxps\": \"oxps\",\n\t\t\"patch-ops-error+xml\": \"xer\",\n\t\t\"pgp-encrypted\": \"pgp\",\n\t\t\"pkcs10\": \"p10\",\n\t\t\"pkcs7-mime\": [\n\t\t\t\"p7m\",\n\t\t\t\"p7c\"\n\t\t],\n\t\t\"pkcs7-signature\": \"p7s\",\n\t\t\"pkcs8\": \"p8\",\n\t\t\"pkix-attr-cert\": \"ac\",\n\t\t\"pkix-crl\": \"crl\",\n\t\t\"pkix-pkipath\": \"pkipath\",\n\t\t\"pkixcmp\": \"pki\",\n\t\t\"pls+xml\": \"pls\",\n\t\t\"prs.cww\": \"cww\",\n\t\t\"pskc+xml\": \"pskcxml\",\n\t\t\"reginfo+xml\": \"rif\",\n\t\t\"relax-ng-compact-syntax\": \"rnc\",\n\t\t\"resource-lists+xml\": \"rl\",\n\t\t\"resource-lists-diff+xml\": \"rld\",\n\t\t\"rls-services+xml\": \"rs\",\n\t\t\"rpki-ghostbusters\": \"gbr\",\n\t\t\"rpki-manifest\": \"mft\",\n\t\t\"rpki-roa\": \"roa\",\n\t\t\"rsd+xml\": \"rsd\",\n\t\t\"sbml+xml\": \"sbml\",\n\t\t\"scvp-cv-request\": \"scq\",\n\t\t\"scvp-cv-response\": \"scs\",\n\t\t\"scvp-vp-request\": \"spq\",\n\t\t\"scvp-vp-response\": \"spp\",\n\t\t\"sdp\": \"sdp\",\n\t\t\"set-payment-initiation\": \"setpay\",\n\t\t\"set-registration-initiation\": \"setreg\",\n\t\t\"shf+xml\": \"shf\",\n\t\t\"sparql-query\": \"rq\",\n\t\t\"sparql-results+xml\": \"srx\",\n\t\t\"srgs\": \"gram\",\n\t\t\"srgs+xml\": \"grxml\",\n\t\t\"sru+xml\": \"sru\",\n\t\t\"ssdl+xml\": \"ssdl\",\n\t\t\"ssml+xml\": \"ssml\",\n\t\t\"tei+xml\": [\n\t\t\t\"tei\",\n\t\t\t\"teicorpus\"\n\t\t],\n\t\t\"thraud+xml\": \"tfi\",\n\t\t\"timestamped-data\": \"tsd\",\n\t\t\"vnd.3gpp.pic-bw-large\": \"plb\",\n\t\t\"vnd.3gpp.pic-bw-small\": \"psb\",\n\t\t\"vnd.3gpp.pic-bw-var\": \"pvb\",\n\t\t\"vnd.3gpp2.tcap\": \"tcap\",\n\t\t\"vnd.3m.post-it-notes\": \"pwn\",\n\t\t\"vnd.accpac.simply.aso\": \"aso\",\n\t\t\"vnd.accpac.simply.imp\": \"imp\",\n\t\t\"vnd.acucobol\": \"acu\",\n\t\t\"vnd.acucorp\": [\n\t\t\t\"atc\",\n\t\t\t\"acutc\"\n\t\t],\n\t\t\"vnd.adobe.air-application-installer-package+zip\": \"air\",\n\t\t\"vnd.adobe.formscentral.fcdt\": \"fcdt\",\n\t\t\"vnd.adobe.fxp\": [\n\t\t\t\"fxp\",\n\t\t\t\"fxpl\"\n\t\t],\n\t\t\"vnd.adobe.xdp+xml\": \"xdp\",\n\t\t\"vnd.adobe.xfdf\": \"xfdf\",\n\t\t\"vnd.ahead.space\": \"ahead\",\n\t\t\"vnd.airzip.filesecure.azf\": \"azf\",\n\t\t\"vnd.airzip.filesecure.azs\": \"azs\",\n\t\t\"vnd.amazon.ebook\": \"azw\",\n\t\t\"vnd.americandynamics.acc\": \"acc\",\n\t\t\"vnd.amiga.ami\": \"ami\",\n\t\t\"vnd.anser-web-certificate-issue-initiation\": \"cii\",\n\t\t\"vnd.anser-web-funds-transfer-initiation\": \"fti\",\n\t\t\"vnd.antix.game-component\": \"atx\",\n\t\t\"vnd.apple.installer+xml\": \"mpkg\",\n\t\t\"vnd.apple.mpegurl\": \"m3u8\",\n\t\t\"vnd.aristanetworks.swi\": \"swi\",\n\t\t\"vnd.astraea-software.iota\": \"iota\",\n\t\t\"vnd.audiograph\": \"aep\",\n\t\t\"vnd.blueice.multipass\": \"mpm\",\n\t\t\"vnd.bmi\": \"bmi\",\n\t\t\"vnd.businessobjects\": \"rep\",\n\t\t\"vnd.chemdraw+xml\": \"cdxml\",\n\t\t\"vnd.chipnuts.karaoke-mmd\": \"mmd\",\n\t\t\"vnd.claymore\": \"cla\",\n\t\t\"vnd.cloanto.rp9\": \"rp9\",\n\t\t\"vnd.clonk.c4group\": [\n\t\t\t\"c4g\",\n\t\t\t\"c4d\",\n\t\t\t\"c4f\",\n\t\t\t\"c4p\",\n\t\t\t\"c4u\"\n\t\t],\n\t\t\"vnd.cluetrust.cartomobile-config\": \"c11amc\",\n\t\t\"vnd.cluetrust.cartomobile-config-pkg\": \"c11amz\",\n\t\t\"vnd.commonspace\": \"csp\",\n\t\t\"vnd.contact.cmsg\": \"cdbcmsg\",\n\t\t\"vnd.cosmocaller\": \"cmc\",\n\t\t\"vnd.crick.clicker\": \"clkx\",\n\t\t\"vnd.crick.clicker.keyboard\": \"clkk\",\n\t\t\"vnd.crick.clicker.palette\": \"clkp\",\n\t\t\"vnd.crick.clicker.template\": \"clkt\",\n\t\t\"vnd.crick.clicker.wordbank\": \"clkw\",\n\t\t\"vnd.criticaltools.wbs+xml\": \"wbs\",\n\t\t\"vnd.ctc-posml\": \"pml\",\n\t\t\"vnd.cups-ppd\": \"ppd\",\n\t\t\"vnd.curl.car\": \"car\",\n\t\t\"vnd.curl.pcurl\": \"pcurl\",\n\t\t\"vnd.dart\": \"dart\",\n\t\t\"vnd.data-vision.rdz\": \"rdz\",\n\t\t\"vnd.dece.data\": [\n\t\t\t\"uvf\",\n\t\t\t\"uvvf\",\n\t\t\t\"uvd\",\n\t\t\t\"uvvd\"\n\t\t],\n\t\t\"vnd.dece.ttml+xml\": [\n\t\t\t\"uvt\",\n\t\t\t\"uvvt\"\n\t\t],\n\t\t\"vnd.dece.unspecified\": [\n\t\t\t\"uvx\",\n\t\t\t\"uvvx\"\n\t\t],\n\t\t\"vnd.dece.zip\": [\n\t\t\t\"uvz\",\n\t\t\t\"uvvz\"\n\t\t],\n\t\t\"vnd.denovo.fcselayout-link\": \"fe_launch\",\n\t\t\"vnd.dna\": \"dna\",\n\t\t\"vnd.dolby.mlp\": \"mlp\",\n\t\t\"vnd.dpgraph\": \"dpg\",\n\t\t\"vnd.dreamfactory\": \"dfac\",\n\t\t\"vnd.ds-keypoint\": \"kpxx\",\n\t\t\"vnd.dvb.ait\": \"ait\",\n\t\t\"vnd.dvb.service\": \"svc\",\n\t\t\"vnd.dynageo\": \"geo\",\n\t\t\"vnd.ecowin.chart\": \"mag\",\n\t\t\"vnd.enliven\": \"nml\",\n\t\t\"vnd.epson.esf\": \"esf\",\n\t\t\"vnd.epson.msf\": \"msf\",\n\t\t\"vnd.epson.quickanime\": \"qam\",\n\t\t\"vnd.epson.salt\": \"slt\",\n\t\t\"vnd.epson.ssf\": \"ssf\",\n\t\t\"vnd.eszigno3+xml\": [\n\t\t\t\"es3\",\n\t\t\t\"et3\"\n\t\t],\n\t\t\"vnd.ezpix-album\": \"ez2\",\n\t\t\"vnd.ezpix-package\": \"ez3\",\n\t\t\"vnd.fdf\": \"fdf\",\n\t\t\"vnd.fdsn.mseed\": \"mseed\",\n\t\t\"vnd.fdsn.seed\": [\n\t\t\t\"seed\",\n\t\t\t\"dataless\"\n\t\t],\n\t\t\"vnd.flographit\": \"gph\",\n\t\t\"vnd.fluxtime.clip\": \"ftc\",\n\t\t\"vnd.framemaker\": [\n\t\t\t\"fm\",\n\t\t\t\"frame\",\n\t\t\t\"maker\",\n\t\t\t\"book\"\n\t\t],\n\t\t\"vnd.frogans.fnc\": \"fnc\",\n\t\t\"vnd.frogans.ltf\": \"ltf\",\n\t\t\"vnd.fsc.weblaunch\": \"fsc\",\n\t\t\"vnd.fujitsu.oasys\": \"oas\",\n\t\t\"vnd.fujitsu.oasys2\": \"oa2\",\n\t\t\"vnd.fujitsu.oasys3\": \"oa3\",\n\t\t\"vnd.fujitsu.oasysgp\": \"fg5\",\n\t\t\"vnd.fujitsu.oasysprs\": \"bh2\",\n\t\t\"vnd.fujixerox.ddd\": \"ddd\",\n\t\t\"vnd.fujixerox.docuworks\": \"xdw\",\n\t\t\"vnd.fujixerox.docuworks.binder\": \"xbd\",\n\t\t\"vnd.fuzzysheet\": \"fzs\",\n\t\t\"vnd.genomatix.tuxedo\": \"txd\",\n\t\t\"vnd.geogebra.file\": \"ggb\",\n\t\t\"vnd.geogebra.tool\": \"ggt\",\n\t\t\"vnd.geometry-explorer\": [\n\t\t\t\"gex\",\n\t\t\t\"gre\"\n\t\t],\n\t\t\"vnd.geonext\": \"gxt\",\n\t\t\"vnd.geoplan\": \"g2w\",\n\t\t\"vnd.geospace\": \"g3w\",\n\t\t\"vnd.gmx\": \"gmx\",\n\t\t\"vnd.grafeq\": [\n\t\t\t\"gqf\",\n\t\t\t\"gqs\"\n\t\t],\n\t\t\"vnd.groove-account\": \"gac\",\n\t\t\"vnd.groove-help\": \"ghf\",\n\t\t\"vnd.groove-identity-message\": \"gim\",\n\t\t\"vnd.groove-injector\": \"grv\",\n\t\t\"vnd.groove-tool-message\": \"gtm\",\n\t\t\"vnd.groove-tool-template\": \"tpl\",\n\t\t\"vnd.groove-vcard\": \"vcg\",\n\t\t\"vnd.hal+xml\": \"hal\",\n\t\t\"vnd.handheld-entertainment+xml\": \"zmm\",\n\t\t\"vnd.hbci\": \"hbci\",\n\t\t\"vnd.hhe.lesson-player\": \"les\",\n\t\t\"vnd.hp-hpgl\": \"hpgl\",\n\t\t\"vnd.hp-hpid\": \"hpid\",\n\t\t\"vnd.hp-hps\": \"hps\",\n\t\t\"vnd.hp-jlyt\": \"jlt\",\n\t\t\"vnd.hp-pcl\": \"pcl\",\n\t\t\"vnd.hp-pclxl\": \"pclxl\",\n\t\t\"vnd.hydrostatix.sof-data\": \"sfd-hdstx\",\n\t\t\"vnd.ibm.minipay\": \"mpy\",\n\t\t\"vnd.ibm.modcap\": [\n\t\t\t\"afp\",\n\t\t\t\"listafp\",\n\t\t\t\"list3820\"\n\t\t],\n\t\t\"vnd.ibm.rights-management\": \"irm\",\n\t\t\"vnd.ibm.secure-container\": \"sc\",\n\t\t\"vnd.iccprofile\": [\n\t\t\t\"icc\",\n\t\t\t\"icm\"\n\t\t],\n\t\t\"vnd.igloader\": \"igl\",\n\t\t\"vnd.immervision-ivp\": \"ivp\",\n\t\t\"vnd.immervision-ivu\": \"ivu\",\n\t\t\"vnd.insors.igm\": \"igm\",\n\t\t\"vnd.intercon.formnet\": [\n\t\t\t\"xpw\",\n\t\t\t\"xpx\"\n\t\t],\n\t\t\"vnd.intergeo\": \"i2g\",\n\t\t\"vnd.intu.qbo\": \"qbo\",\n\t\t\"vnd.intu.qfx\": \"qfx\",\n\t\t\"vnd.ipunplugged.rcprofile\": \"rcprofile\",\n\t\t\"vnd.irepository.package+xml\": \"irp\",\n\t\t\"vnd.is-xpr\": \"xpr\",\n\t\t\"vnd.isac.fcs\": \"fcs\",\n\t\t\"vnd.jam\": \"jam\",\n\t\t\"vnd.jcp.javame.midlet-rms\": \"rms\",\n\t\t\"vnd.jisp\": \"jisp\",\n\t\t\"vnd.joost.joda-archive\": \"joda\",\n\t\t\"vnd.kahootz\": [\n\t\t\t\"ktz\",\n\t\t\t\"ktr\"\n\t\t],\n\t\t\"vnd.kde.karbon\": \"karbon\",\n\t\t\"vnd.kde.kchart\": \"chrt\",\n\t\t\"vnd.kde.kformula\": \"kfo\",\n\t\t\"vnd.kde.kivio\": \"flw\",\n\t\t\"vnd.kde.kontour\": \"kon\",\n\t\t\"vnd.kde.kpresenter\": [\n\t\t\t\"kpr\",\n\t\t\t\"kpt\"\n\t\t],\n\t\t\"vnd.kde.kspread\": \"ksp\",\n\t\t\"vnd.kde.kword\": [\n\t\t\t\"kwd\",\n\t\t\t\"kwt\"\n\t\t],\n\t\t\"vnd.kenameaapp\": \"htke\",\n\t\t\"vnd.kidspiration\": \"kia\",\n\t\t\"vnd.kinar\": [\n\t\t\t\"kne\",\n\t\t\t\"knp\"\n\t\t],\n\t\t\"vnd.koan\": [\n\t\t\t\"skp\",\n\t\t\t\"skd\",\n\t\t\t\"skt\",\n\t\t\t\"skm\"\n\t\t],\n\t\t\"vnd.kodak-descriptor\": \"sse\",\n\t\t\"vnd.las.las+xml\": \"lasxml\",\n\t\t\"vnd.llamagraphics.life-balance.desktop\": \"lbd\",\n\t\t\"vnd.llamagraphics.life-balance.exchange+xml\": \"lbe\",\n\t\t\"vnd.lotus-1-2-3\": \"123\",\n\t\t\"vnd.lotus-approach\": \"apr\",\n\t\t\"vnd.lotus-freelance\": \"pre\",\n\t\t\"vnd.lotus-notes\": \"nsf\",\n\t\t\"vnd.lotus-organizer\": \"org\",\n\t\t\"vnd.lotus-screencam\": \"scm\",\n\t\t\"vnd.lotus-wordpro\": \"lwp\",\n\t\t\"vnd.macports.portpkg\": \"portpkg\",\n\t\t\"vnd.mcd\": \"mcd\",\n\t\t\"vnd.medcalcdata\": \"mc1\",\n\t\t\"vnd.mediastation.cdkey\": \"cdkey\",\n\t\t\"vnd.mfer\": \"mwf\",\n\t\t\"vnd.mfmp\": \"mfm\",\n\t\t\"vnd.micrografx.flo\": \"flo\",\n\t\t\"vnd.micrografx.igx\": \"igx\",\n\t\t\"vnd.mif\": \"mif\",\n\t\t\"vnd.mobius.daf\": \"daf\",\n\t\t\"vnd.mobius.dis\": \"dis\",\n\t\t\"vnd.mobius.mbk\": \"mbk\",\n\t\t\"vnd.mobius.mqy\": \"mqy\",\n\t\t\"vnd.mobius.msl\": \"msl\",\n\t\t\"vnd.mobius.plc\": \"plc\",\n\t\t\"vnd.mobius.txf\": \"txf\",\n\t\t\"vnd.mophun.application\": \"mpn\",\n\t\t\"vnd.mophun.certificate\": \"mpc\",\n\t\t\"vnd.ms-artgalry\": \"cil\",\n\t\t\"vnd.ms-cab-compressed\": \"cab\",\n\t\t\"vnd.ms-excel.addin.macroenabled.12\": \"xlam\",\n\t\t\"vnd.ms-excel.sheet.binary.macroenabled.12\": \"xlsb\",\n\t\t\"vnd.ms-excel.sheet.macroenabled.12\": \"xlsm\",\n\t\t\"vnd.ms-excel.template.macroenabled.12\": \"xltm\",\n\t\t\"vnd.ms-fontobject\": \"eot\",\n\t\t\"vnd.ms-htmlhelp\": \"chm\",\n\t\t\"vnd.ms-ims\": \"ims\",\n\t\t\"vnd.ms-lrm\": \"lrm\",\n\t\t\"vnd.ms-officetheme\": \"thmx\",\n\t\t\"vnd.ms-powerpoint.addin.macroenabled.12\": \"ppam\",\n\t\t\"vnd.ms-powerpoint.presentation.macroenabled.12\": \"pptm\",\n\t\t\"vnd.ms-powerpoint.slide.macroenabled.12\": \"sldm\",\n\t\t\"vnd.ms-powerpoint.slideshow.macroenabled.12\": \"ppsm\",\n\t\t\"vnd.ms-powerpoint.template.macroenabled.12\": \"potm\",\n\t\t\"vnd.ms-project\": [\n\t\t\t\"mpp\",\n\t\t\t\"mpt\"\n\t\t],\n\t\t\"vnd.ms-word.document.macroenabled.12\": \"docm\",\n\t\t\"vnd.ms-word.template.macroenabled.12\": \"dotm\",\n\t\t\"vnd.ms-works\": [\n\t\t\t\"wps\",\n\t\t\t\"wks\",\n\t\t\t\"wcm\",\n\t\t\t\"wdb\"\n\t\t],\n\t\t\"vnd.ms-wpl\": \"wpl\",\n\t\t\"vnd.ms-xpsdocument\": \"xps\",\n\t\t\"vnd.mseq\": \"mseq\",\n\t\t\"vnd.musician\": \"mus\",\n\t\t\"vnd.muvee.style\": \"msty\",\n\t\t\"vnd.mynfc\": \"taglet\",\n\t\t\"vnd.neurolanguage.nlu\": \"nlu\",\n\t\t\"vnd.nitf\": [\n\t\t\t\"ntf\",\n\t\t\t\"nitf\"\n\t\t],\n\t\t\"vnd.noblenet-directory\": \"nnd\",\n\t\t\"vnd.noblenet-sealer\": \"nns\",\n\t\t\"vnd.noblenet-web\": \"nnw\",\n\t\t\"vnd.nokia.n-gage.data\": \"ngdat\",\n\t\t\"vnd.nokia.n-gage.symbian.install\": \"n-gage\",\n\t\t\"vnd.nokia.radio-preset\": \"rpst\",\n\t\t\"vnd.nokia.radio-presets\": \"rpss\",\n\t\t\"vnd.novadigm.edm\": \"edm\",\n\t\t\"vnd.novadigm.edx\": \"edx\",\n\t\t\"vnd.novadigm.ext\": \"ext\",\n\t\t\"vnd.oasis.opendocument.chart-template\": \"otc\",\n\t\t\"vnd.oasis.opendocument.formula-template\": \"odft\",\n\t\t\"vnd.oasis.opendocument.image-template\": \"oti\",\n\t\t\"vnd.olpc-sugar\": \"xo\",\n\t\t\"vnd.oma.dd2+xml\": \"dd2\",\n\t\t\"vnd.openofficeorg.extension\": \"oxt\",\n\t\t\"vnd.openxmlformats-officedocument.presentationml.slide\": \"sldx\",\n\t\t\"vnd.osgeo.mapguide.package\": \"mgp\",\n\t\t\"vnd.osgi.dp\": \"dp\",\n\t\t\"vnd.osgi.subsystem\": \"esa\",\n\t\t\"vnd.palm\": [\n\t\t\t\"pdb\",\n\t\t\t\"pqa\",\n\t\t\t\"oprc\"\n\t\t],\n\t\t\"vnd.pawaafile\": \"paw\",\n\t\t\"vnd.pg.format\": \"str\",\n\t\t\"vnd.pg.osasli\": \"ei6\",\n\t\t\"vnd.picsel\": \"efif\",\n\t\t\"vnd.pmi.widget\": \"wg\",\n\t\t\"vnd.pocketlearn\": \"plf\",\n\t\t\"vnd.powerbuilder6\": \"pbd\",\n\t\t\"vnd.previewsystems.box\": \"box\",\n\t\t\"vnd.proteus.magazine\": \"mgz\",\n\t\t\"vnd.publishare-delta-tree\": \"qps\",\n\t\t\"vnd.pvi.ptid1\": \"ptid\",\n\t\t\"vnd.quark.quarkxpress\": [\n\t\t\t\"qxd\",\n\t\t\t\"qxt\",\n\t\t\t\"qwd\",\n\t\t\t\"qwt\",\n\t\t\t\"qxl\",\n\t\t\t\"qxb\"\n\t\t],\n\t\t\"vnd.realvnc.bed\": \"bed\",\n\t\t\"vnd.recordare.musicxml\": \"mxl\",\n\t\t\"vnd.recordare.musicxml+xml\": \"musicxml\",\n\t\t\"vnd.rig.cryptonote\": \"cryptonote\",\n\t\t\"vnd.rn-realmedia\": \"rm\",\n\t\t\"vnd.rn-realmedia-vbr\": \"rmvb\",\n\t\t\"vnd.route66.link66+xml\": \"link66\",\n\t\t\"vnd.sailingtracker.track\": \"st\",\n\t\t\"vnd.seemail\": \"see\",\n\t\t\"vnd.sema\": \"sema\",\n\t\t\"vnd.semd\": \"semd\",\n\t\t\"vnd.semf\": \"semf\",\n\t\t\"vnd.shana.informed.formdata\": \"ifm\",\n\t\t\"vnd.shana.informed.formtemplate\": \"itp\",\n\t\t\"vnd.shana.informed.interchange\": \"iif\",\n\t\t\"vnd.shana.informed.package\": \"ipk\",\n\t\t\"vnd.simtech-mindmapper\": [\n\t\t\t\"twd\",\n\t\t\t\"twds\"\n\t\t],\n\t\t\"vnd.smart.teacher\": \"teacher\",\n\t\t\"vnd.solent.sdkm+xml\": [\n\t\t\t\"sdkm\",\n\t\t\t\"sdkd\"\n\t\t],\n\t\t\"vnd.spotfire.dxp\": \"dxp\",\n\t\t\"vnd.spotfire.sfs\": \"sfs\",\n\t\t\"vnd.stepmania.package\": \"smzip\",\n\t\t\"vnd.stepmania.stepchart\": \"sm\",\n\t\t\"vnd.sus-calendar\": [\n\t\t\t\"sus\",\n\t\t\t\"susp\"\n\t\t],\n\t\t\"vnd.svd\": \"svd\",\n\t\t\"vnd.syncml+xml\": \"xsm\",\n\t\t\"vnd.syncml.dm+wbxml\": \"bdm\",\n\t\t\"vnd.syncml.dm+xml\": \"xdm\",\n\t\t\"vnd.tao.intent-module-archive\": \"tao\",\n\t\t\"vnd.tcpdump.pcap\": [\n\t\t\t\"pcap\",\n\t\t\t\"cap\",\n\t\t\t\"dmp\"\n\t\t],\n\t\t\"vnd.tmobile-livetv\": \"tmo\",\n\t\t\"vnd.trid.tpt\": \"tpt\",\n\t\t\"vnd.triscape.mxs\": \"mxs\",\n\t\t\"vnd.trueapp\": \"tra\",\n\t\t\"vnd.ufdl\": [\n\t\t\t\"ufd\",\n\t\t\t\"ufdl\"\n\t\t],\n\t\t\"vnd.uiq.theme\": \"utz\",\n\t\t\"vnd.umajin\": \"umj\",\n\t\t\"vnd.unity\": \"unityweb\",\n\t\t\"vnd.uoml+xml\": \"uoml\",\n\t\t\"vnd.vcx\": \"vcx\",\n\t\t\"vnd.visionary\": \"vis\",\n\t\t\"vnd.vsf\": \"vsf\",\n\t\t\"vnd.webturbo\": \"wtb\",\n\t\t\"vnd.wolfram.player\": \"nbp\",\n\t\t\"vnd.wqd\": \"wqd\",\n\t\t\"vnd.wt.stf\": \"stf\",\n\t\t\"vnd.xara\": \"xar\",\n\t\t\"vnd.xfdl\": \"xfdl\",\n\t\t\"vnd.yamaha.hv-dic\": \"hvd\",\n\t\t\"vnd.yamaha.hv-script\": \"hvs\",\n\t\t\"vnd.yamaha.hv-voice\": \"hvp\",\n\t\t\"vnd.yamaha.openscoreformat\": \"osf\",\n\t\t\"vnd.yamaha.openscoreformat.osfpvg+xml\": \"osfpvg\",\n\t\t\"vnd.yamaha.smaf-audio\": \"saf\",\n\t\t\"vnd.yamaha.smaf-phrase\": \"spf\",\n\t\t\"vnd.yellowriver-custom-menu\": \"cmp\",\n\t\t\"vnd.zul\": [\n\t\t\t\"zir\",\n\t\t\t\"zirz\"\n\t\t],\n\t\t\"vnd.zzazz.deck+xml\": \"zaz\",\n\t\t\"voicexml+xml\": \"vxml\",\n\t\t\"widget\": \"wgt\",\n\t\t\"winhlp\": \"hlp\",\n\t\t\"wsdl+xml\": \"wsdl\",\n\t\t\"wspolicy+xml\": \"wspolicy\",\n\t\t\"x-ace-compressed\": \"ace\",\n\t\t\"x-authorware-bin\": [\n\t\t\t\"aab\",\n\t\t\t\"x32\",\n\t\t\t\"u32\",\n\t\t\t\"vox\"\n\t\t],\n\t\t\"x-authorware-map\": \"aam\",\n\t\t\"x-authorware-seg\": \"aas\",\n\t\t\"x-blorb\": [\n\t\t\t\"blb\",\n\t\t\t\"blorb\"\n\t\t],\n\t\t\"x-bzip\": \"bz\",\n\t\t\"x-bzip2\": [\n\t\t\t\"bz2\",\n\t\t\t\"boz\"\n\t\t],\n\t\t\"x-cfs-compressed\": \"cfs\",\n\t\t\"x-chat\": \"chat\",\n\t\t\"x-conference\": \"nsc\",\n\t\t\"x-dgc-compressed\": \"dgc\",\n\t\t\"x-dtbncx+xml\": \"ncx\",\n\t\t\"x-dtbook+xml\": \"dtb\",\n\t\t\"x-dtbresource+xml\": \"res\",\n\t\t\"x-eva\": \"eva\",\n\t\t\"x-font-bdf\": \"bdf\",\n\t\t\"x-font-ghostscript\": \"gsf\",\n\t\t\"x-font-linux-psf\": \"psf\",\n\t\t\"x-font-pcf\": \"pcf\",\n\t\t\"x-font-snf\": \"snf\",\n\t\t\"x-font-ttf\": [\n\t\t\t\"ttf\",\n\t\t\t\"ttc\"\n\t\t],\n\t\t\"x-font-type1\": [\n\t\t\t\"pfa\",\n\t\t\t\"pfb\",\n\t\t\t\"pfm\",\n\t\t\t\"afm\"\n\t\t],\n\t\t\"x-freearc\": \"arc\",\n\t\t\"x-gca-compressed\": \"gca\",\n\t\t\"x-glulx\": \"ulx\",\n\t\t\"x-gramps-xml\": \"gramps\",\n\t\t\"x-install-instructions\": \"install\",\n\t\t\"x-lzh-compressed\": [\n\t\t\t\"lzh\",\n\t\t\t\"lha\"\n\t\t],\n\t\t\"x-mie\": \"mie\",\n\t\t\"x-mobipocket-ebook\": [\n\t\t\t\"prc\",\n\t\t\t\"mobi\"\n\t\t],\n\t\t\"x-ms-application\": \"application\",\n\t\t\"x-ms-shortcut\": \"lnk\",\n\t\t\"x-ms-xbap\": \"xbap\",\n\t\t\"x-msbinder\": \"obd\",\n\t\t\"x-mscardfile\": \"crd\",\n\t\t\"x-msclip\": \"clp\",\n\t\t\"application/x-ms-installer\": \"msi\",\n\t\t\"x-msmediaview\": [\n\t\t\t\"mvb\",\n\t\t\t\"m13\",\n\t\t\t\"m14\"\n\t\t],\n\t\t\"x-msmetafile\": [\n\t\t\t\"wmf\",\n\t\t\t\"wmz\",\n\t\t\t\"emf\",\n\t\t\t\"emz\"\n\t\t],\n\t\t\"x-msmoney\": \"mny\",\n\t\t\"x-mspublisher\": \"pub\",\n\t\t\"x-msschedule\": \"scd\",\n\t\t\"x-msterminal\": \"trm\",\n\t\t\"x-mswrite\": \"wri\",\n\t\t\"x-nzb\": \"nzb\",\n\t\t\"x-pkcs12\": [\n\t\t\t\"p12\",\n\t\t\t\"pfx\"\n\t\t],\n\t\t\"x-pkcs7-certificates\": [\n\t\t\t\"p7b\",\n\t\t\t\"spc\"\n\t\t],\n\t\t\"x-research-info-systems\": \"ris\",\n\t\t\"x-silverlight-app\": \"xap\",\n\t\t\"x-sql\": \"sql\",\n\t\t\"x-stuffitx\": \"sitx\",\n\t\t\"x-subrip\": \"srt\",\n\t\t\"x-t3vm-image\": \"t3\",\n\t\t\"x-tex-tfm\": \"tfm\",\n\t\t\"x-tgif\": \"obj\",\n\t\t\"x-xliff+xml\": \"xlf\",\n\t\t\"x-xz\": \"xz\",\n\t\t\"x-zmachine\": [\n\t\t\t\"z1\",\n\t\t\t\"z2\",\n\t\t\t\"z3\",\n\t\t\t\"z4\",\n\t\t\t\"z5\",\n\t\t\t\"z6\",\n\t\t\t\"z7\",\n\t\t\t\"z8\"\n\t\t],\n\t\t\"xaml+xml\": \"xaml\",\n\t\t\"xcap-diff+xml\": \"xdf\",\n\t\t\"xenc+xml\": \"xenc\",\n\t\t\"xml-dtd\": \"dtd\",\n\t\t\"xop+xml\": \"xop\",\n\t\t\"xproc+xml\": \"xpl\",\n\t\t\"xslt+xml\": \"xslt\",\n\t\t\"xv+xml\": [\n\t\t\t\"mxml\",\n\t\t\t\"xhvml\",\n\t\t\t\"xvml\",\n\t\t\t\"xvm\"\n\t\t],\n\t\t\"yang\": \"yang\",\n\t\t\"yin+xml\": \"yin\",\n\t\t\"envoy\": \"evy\",\n\t\t\"fractals\": \"fif\",\n\t\t\"internet-property-stream\": \"acx\",\n\t\t\"olescript\": \"axs\",\n\t\t\"vnd.ms-outlook\": \"msg\",\n\t\t\"vnd.ms-pkicertstore\": \"sst\",\n\t\t\"x-compress\": \"z\",\n\t\t\"x-perfmon\": [\n\t\t\t\"pma\",\n\t\t\t\"pmc\",\n\t\t\t\"pmr\",\n\t\t\t\"pmw\"\n\t\t],\n\t\t\"ynd.ms-pkipko\": \"pko\",\n\t\t\"gzip\": [\n\t\t\t\"gz\",\n\t\t\t\"tgz\"\n\t\t],\n\t\t\"smil+xml\": [\n\t\t\t\"smi\",\n\t\t\t\"smil\"\n\t\t],\n\t\t\"vnd.debian.binary-package\": [\n\t\t\t\"deb\",\n\t\t\t\"udeb\"\n\t\t],\n\t\t\"vnd.hzn-3d-crossword\": \"x3d\",\n\t\t\"vnd.sqlite3\": [\n\t\t\t\"db\",\n\t\t\t\"sqlite\",\n\t\t\t\"sqlite3\",\n\t\t\t\"db-wal\",\n\t\t\t\"sqlite-wal\",\n\t\t\t\"db-shm\",\n\t\t\t\"sqlite-shm\"\n\t\t],\n\t\t\"vnd.wap.sic\": \"sic\",\n\t\t\"vnd.wap.slc\": \"slc\",\n\t\t\"x-krita\": [\n\t\t\t\"kra\",\n\t\t\t\"krz\"\n\t\t],\n\t\t\"x-perl\": [\n\t\t\t\"pm\",\n\t\t\t\"pl\"\n\t\t],\n\t\t\"yaml\": [\n\t\t\t\"yaml\",\n\t\t\t\"yml\"\n\t\t]\n\t},\n\t\"audio\": {\n\t\t\"amr\": \"amr\",\n\t\t\"amr-wb\": \"awb\",\n\t\t\"annodex\": \"axa\",\n\t\t\"basic\": [\n\t\t\t\"au\",\n\t\t\t\"snd\"\n\t\t],\n\t\t\"flac\": \"flac\",\n\t\t\"midi\": [\n\t\t\t\"mid\",\n\t\t\t\"midi\",\n\t\t\t\"kar\",\n\t\t\t\"rmi\"\n\t\t],\n\t\t\"mpeg\": [\n\t\t\t\"mpga\",\n\t\t\t\"mpega\",\n\t\t\t\"mp3\",\n\t\t\t\"m4a\",\n\t\t\t\"mp2a\",\n\t\t\t\"m2a\",\n\t\t\t\"m3a\"\n\t\t],\n\t\t\"mpegurl\": \"m3u\",\n\t\t\"ogg\": [\n\t\t\t\"oga\",\n\t\t\t\"ogg\",\n\t\t\t\"spx\"\n\t\t],\n\t\t\"prs.sid\": \"sid\",\n\t\t\"x-aiff\": \"aifc\",\n\t\t\"x-gsm\": \"gsm\",\n\t\t\"x-ms-wma\": \"wma\",\n\t\t\"x-ms-wax\": \"wax\",\n\t\t\"x-pn-realaudio\": \"ram\",\n\t\t\"x-realaudio\": \"ra\",\n\t\t\"x-sd2\": \"sd2\",\n\t\t\"adpcm\": \"adp\",\n\t\t\"mp4\": \"mp4a\",\n\t\t\"s3m\": \"s3m\",\n\t\t\"silk\": \"sil\",\n\t\t\"vnd.dece.audio\": [\n\t\t\t\"uva\",\n\t\t\t\"uvva\"\n\t\t],\n\t\t\"vnd.digital-winds\": \"eol\",\n\t\t\"vnd.dra\": \"dra\",\n\t\t\"vnd.dts\": \"dts\",\n\t\t\"vnd.dts.hd\": \"dtshd\",\n\t\t\"vnd.lucent.voice\": \"lvp\",\n\t\t\"vnd.ms-playready.media.pya\": \"pya\",\n\t\t\"vnd.nuera.ecelp4800\": \"ecelp4800\",\n\t\t\"vnd.nuera.ecelp7470\": \"ecelp7470\",\n\t\t\"vnd.nuera.ecelp9600\": \"ecelp9600\",\n\t\t\"vnd.rip\": \"rip\",\n\t\t\"webm\": \"weba\",\n\t\t\"x-caf\": \"caf\",\n\t\t\"x-matroska\": \"mka\",\n\t\t\"x-pn-realaudio-plugin\": \"rmp\",\n\t\t\"xm\": \"xm\",\n\t\t\"aac\": \"aac\",\n\t\t\"aiff\": [\n\t\t\t\"aiff\",\n\t\t\t\"aif\",\n\t\t\t\"aff\"\n\t\t],\n\t\t\"opus\": \"opus\",\n\t\t\"wav\": \"wav\"\n\t},\n\t\"chemical\": {\n\t\t\"x-alchemy\": \"alc\",\n\t\t\"x-cache\": [\n\t\t\t\"cac\",\n\t\t\t\"cache\"\n\t\t],\n\t\t\"x-cache-csf\": \"csf\",\n\t\t\"x-cactvs-binary\": [\n\t\t\t\"cbin\",\n\t\t\t\"cascii\",\n\t\t\t\"ctab\"\n\t\t],\n\t\t\"x-cdx\": \"cdx\",\n\t\t\"x-chem3d\": \"c3d\",\n\t\t\"x-cif\": \"cif\",\n\t\t\"x-cmdf\": \"cmdf\",\n\t\t\"x-cml\": \"cml\",\n\t\t\"x-compass\": \"cpa\",\n\t\t\"x-crossfire\": \"bsd\",\n\t\t\"x-csml\": [\n\t\t\t\"csml\",\n\t\t\t\"csm\"\n\t\t],\n\t\t\"x-ctx\": \"ctx\",\n\t\t\"x-cxf\": [\n\t\t\t\"cxf\",\n\t\t\t\"cef\"\n\t\t],\n\t\t\"x-embl-dl-nucleotide\": [\n\t\t\t\"emb\",\n\t\t\t\"embl\"\n\t\t],\n\t\t\"x-gamess-input\": [\n\t\t\t\"inp\",\n\t\t\t\"gam\",\n\t\t\t\"gamin\"\n\t\t],\n\t\t\"x-gaussian-checkpoint\": [\n\t\t\t\"fch\",\n\t\t\t\"fchk\"\n\t\t],\n\t\t\"x-gaussian-cube\": \"cub\",\n\t\t\"x-gaussian-input\": [\n\t\t\t\"gau\",\n\t\t\t\"gjc\",\n\t\t\t\"gjf\"\n\t\t],\n\t\t\"x-gaussian-log\": \"gal\",\n\t\t\"x-gcg8-sequence\": \"gcg\",\n\t\t\"x-genbank\": \"gen\",\n\t\t\"x-hin\": \"hin\",\n\t\t\"x-isostar\": [\n\t\t\t\"istr\",\n\t\t\t\"ist\"\n\t\t],\n\t\t\"x-jcamp-dx\": [\n\t\t\t\"jdx\",\n\t\t\t\"dx\"\n\t\t],\n\t\t\"x-kinemage\": \"kin\",\n\t\t\"x-macmolecule\": \"mcm\",\n\t\t\"x-macromodel-input\": \"mmod\",\n\t\t\"x-mdl-molfile\": \"mol\",\n\t\t\"x-mdl-rdfile\": \"rd\",\n\t\t\"x-mdl-rxnfile\": \"rxn\",\n\t\t\"x-mdl-sdfile\": \"sd\",\n\t\t\"x-mdl-tgf\": \"tgf\",\n\t\t\"x-mmcif\": \"mcif\",\n\t\t\"x-mol2\": \"mol2\",\n\t\t\"x-molconn-Z\": \"b\",\n\t\t\"x-mopac-graph\": \"gpt\",\n\t\t\"x-mopac-input\": [\n\t\t\t\"mop\",\n\t\t\t\"mopcrt\",\n\t\t\t\"zmt\"\n\t\t],\n\t\t\"x-mopac-out\": \"moo\",\n\t\t\"x-ncbi-asn1\": \"asn\",\n\t\t\"x-ncbi-asn1-ascii\": [\n\t\t\t\"prt\",\n\t\t\t\"ent\"\n\t\t],\n\t\t\"x-ncbi-asn1-binary\": \"val\",\n\t\t\"x-rosdal\": \"ros\",\n\t\t\"x-swissprot\": \"sw\",\n\t\t\"x-vamas-iso14976\": \"vms\",\n\t\t\"x-vmd\": \"vmd\",\n\t\t\"x-xtel\": \"xtel\",\n\t\t\"x-xyz\": \"xyz\"\n\t},\n\t\"font\": {\n\t\t\"otf\": \"otf\",\n\t\t\"woff\": \"woff\",\n\t\t\"woff2\": \"woff2\"\n\t},\n\t\"image\": {\n\t\t\"gif\": \"gif\",\n\t\t\"ief\": \"ief\",\n\t\t\"jpeg\": [\n\t\t\t\"jpeg\",\n\t\t\t\"jpg\",\n\t\t\t\"jpe\",\n\t\t\t\"jfif\",\n\t\t\t\"jfif-tbnl\",\n\t\t\t\"jif\"\n\t\t],\n\t\t\"pcx\": \"pcx\",\n\t\t\"png\": \"png\",\n\t\t\"svg+xml\": [\n\t\t\t\"svg\",\n\t\t\t\"svgz\"\n\t\t],\n\t\t\"tiff\": [\n\t\t\t\"tiff\",\n\t\t\t\"tif\"\n\t\t],\n\t\t\"vnd.djvu\": [\n\t\t\t\"djvu\",\n\t\t\t\"djv\"\n\t\t],\n\t\t\"vnd.wap.wbmp\": \"wbmp\",\n\t\t\"x-canon-cr2\": \"cr2\",\n\t\t\"x-canon-crw\": \"crw\",\n\t\t\"x-cmu-raster\": \"ras\",\n\t\t\"x-coreldraw\": \"cdr\",\n\t\t\"x-coreldrawpattern\": \"pat\",\n\t\t\"x-coreldrawtemplate\": \"cdt\",\n\t\t\"x-corelphotopaint\": \"cpt\",\n\t\t\"x-epson-erf\": \"erf\",\n\t\t\"x-icon\": \"ico\",\n\t\t\"x-jg\": \"art\",\n\t\t\"x-jng\": \"jng\",\n\t\t\"x-nikon-nef\": \"nef\",\n\t\t\"x-olympus-orf\": \"orf\",\n\t\t\"x-portable-anymap\": \"pnm\",\n\t\t\"x-portable-bitmap\": \"pbm\",\n\t\t\"x-portable-graymap\": \"pgm\",\n\t\t\"x-portable-pixmap\": \"ppm\",\n\t\t\"x-rgb\": \"rgb\",\n\t\t\"x-xbitmap\": \"xbm\",\n\t\t\"x-xpixmap\": \"xpm\",\n\t\t\"x-xwindowdump\": \"xwd\",\n\t\t\"bmp\": \"bmp\",\n\t\t\"cgm\": \"cgm\",\n\t\t\"g3fax\": \"g3\",\n\t\t\"ktx\": \"ktx\",\n\t\t\"prs.btif\": \"btif\",\n\t\t\"sgi\": \"sgi\",\n\t\t\"vnd.dece.graphic\": [\n\t\t\t\"uvi\",\n\t\t\t\"uvvi\",\n\t\t\t\"uvg\",\n\t\t\t\"uvvg\"\n\t\t],\n\t\t\"vnd.dwg\": \"dwg\",\n\t\t\"vnd.dxf\": \"dxf\",\n\t\t\"vnd.fastbidsheet\": \"fbs\",\n\t\t\"vnd.fpx\": \"fpx\",\n\t\t\"vnd.fst\": \"fst\",\n\t\t\"vnd.fujixerox.edmics-mmr\": \"mmr\",\n\t\t\"vnd.fujixerox.edmics-rlc\": \"rlc\",\n\t\t\"vnd.ms-modi\": \"mdi\",\n\t\t\"vnd.ms-photo\": \"wdp\",\n\t\t\"vnd.net-fpx\": \"npx\",\n\t\t\"vnd.xiff\": \"xif\",\n\t\t\"webp\": \"webp\",\n\t\t\"x-3ds\": \"3ds\",\n\t\t\"x-cmx\": \"cmx\",\n\t\t\"x-freehand\": [\n\t\t\t\"fh\",\n\t\t\t\"fhc\",\n\t\t\t\"fh4\",\n\t\t\t\"fh5\",\n\t\t\t\"fh7\"\n\t\t],\n\t\t\"x-pict\": [\n\t\t\t\"pic\",\n\t\t\t\"pct\"\n\t\t],\n\t\t\"x-tga\": \"tga\",\n\t\t\"cis-cod\": \"cod\",\n\t\t\"avif\": \"avifs\",\n\t\t\"heic\": [\n\t\t\t\"heif\",\n\t\t\t\"heic\"\n\t\t],\n\t\t\"pjpeg\": [\n\t\t\t\"pjpg\"\n\t\t],\n\t\t\"vnd.adobe.photoshop\": \"psd\",\n\t\t\"x-adobe-dng\": \"dng\",\n\t\t\"x-fuji-raf\": \"raf\",\n\t\t\"x-icns\": \"icns\",\n\t\t\"x-kodak-dcr\": \"dcr\",\n\t\t\"x-kodak-k25\": \"k25\",\n\t\t\"x-kodak-kdc\": \"kdc\",\n\t\t\"x-minolta-mrw\": \"mrw\",\n\t\t\"x-panasonic-raw\": [\n\t\t\t\"raw\",\n\t\t\t\"rw2\",\n\t\t\t\"rwl\"\n\t\t],\n\t\t\"x-pentax-pef\": [\n\t\t\t\"pef\",\n\t\t\t\"ptx\"\n\t\t],\n\t\t\"x-sigma-x3f\": \"x3f\",\n\t\t\"x-sony-arw\": \"arw\",\n\t\t\"x-sony-sr2\": \"sr2\",\n\t\t\"x-sony-srf\": \"srf\"\n\t},\n\t\"message\": {\n\t\t\"rfc822\": [\n\t\t\t\"eml\",\n\t\t\t\"mime\",\n\t\t\t\"mht\",\n\t\t\t\"mhtml\",\n\t\t\t\"nws\"\n\t\t]\n\t},\n\t\"model\": {\n\t\t\"iges\": [\n\t\t\t\"igs\",\n\t\t\t\"iges\"\n\t\t],\n\t\t\"mesh\": [\n\t\t\t\"msh\",\n\t\t\t\"mesh\",\n\t\t\t\"silo\"\n\t\t],\n\t\t\"vrml\": [\n\t\t\t\"wrl\",\n\t\t\t\"vrml\"\n\t\t],\n\t\t\"x3d+vrml\": [\n\t\t\t\"x3dv\",\n\t\t\t\"x3dvz\"\n\t\t],\n\t\t\"x3d+xml\": \"x3dz\",\n\t\t\"x3d+binary\": [\n\t\t\t\"x3db\",\n\t\t\t\"x3dbz\"\n\t\t],\n\t\t\"vnd.collada+xml\": \"dae\",\n\t\t\"vnd.dwf\": \"dwf\",\n\t\t\"vnd.gdl\": \"gdl\",\n\t\t\"vnd.gtw\": \"gtw\",\n\t\t\"vnd.mts\": \"mts\",\n\t\t\"vnd.vtu\": \"vtu\"\n\t},\n\t\"text\": {\n\t\t\"cache-manifest\": [\n\t\t\t\"manifest\",\n\t\t\t\"appcache\"\n\t\t],\n\t\t\"calendar\": [\n\t\t\t\"ics\",\n\t\t\t\"icz\",\n\t\t\t\"ifb\"\n\t\t],\n\t\t\"css\": \"css\",\n\t\t\"csv\": \"csv\",\n\t\t\"h323\": \"323\",\n\t\t\"html\": [\n\t\t\t\"html\",\n\t\t\t\"htm\",\n\t\t\t\"shtml\",\n\t\t\t\"stm\"\n\t\t],\n\t\t\"iuls\": \"uls\",\n\t\t\"plain\": [\n\t\t\t\"txt\",\n\t\t\t\"text\",\n\t\t\t\"brf\",\n\t\t\t\"conf\",\n\t\t\t\"def\",\n\t\t\t\"list\",\n\t\t\t\"log\",\n\t\t\t\"in\",\n\t\t\t\"bas\",\n\t\t\t\"diff\",\n\t\t\t\"ksh\"\n\t\t],\n\t\t\"richtext\": \"rtx\",\n\t\t\"scriptlet\": [\n\t\t\t\"sct\",\n\t\t\t\"wsc\"\n\t\t],\n\t\t\"texmacs\": \"tm\",\n\t\t\"tab-separated-values\": \"tsv\",\n\t\t\"vnd.sun.j2me.app-descriptor\": \"jad\",\n\t\t\"vnd.wap.wml\": \"wml\",\n\t\t\"vnd.wap.wmlscript\": \"wmls\",\n\t\t\"x-bibtex\": \"bib\",\n\t\t\"x-boo\": \"boo\",\n\t\t\"x-c++hdr\": [\n\t\t\t\"h++\",\n\t\t\t\"hpp\",\n\t\t\t\"hxx\",\n\t\t\t\"hh\"\n\t\t],\n\t\t\"x-c++src\": [\n\t\t\t\"c++\",\n\t\t\t\"cpp\",\n\t\t\t\"cxx\",\n\t\t\t\"cc\"\n\t\t],\n\t\t\"x-component\": \"htc\",\n\t\t\"x-dsrc\": \"d\",\n\t\t\"x-diff\": \"patch\",\n\t\t\"x-haskell\": \"hs\",\n\t\t\"x-java\": \"java\",\n\t\t\"x-literate-haskell\": \"lhs\",\n\t\t\"x-moc\": \"moc\",\n\t\t\"x-pascal\": [\n\t\t\t\"p\",\n\t\t\t\"pas\",\n\t\t\t\"pp\",\n\t\t\t\"inc\"\n\t\t],\n\t\t\"x-pcs-gcd\": \"gcd\",\n\t\t\"x-python\": \"py\",\n\t\t\"x-scala\": \"scala\",\n\t\t\"x-setext\": \"etx\",\n\t\t\"x-tcl\": [\n\t\t\t\"tcl\",\n\t\t\t\"tk\"\n\t\t],\n\t\t\"x-tex\": [\n\t\t\t\"tex\",\n\t\t\t\"ltx\",\n\t\t\t\"sty\",\n\t\t\t\"cls\"\n\t\t],\n\t\t\"x-vcalendar\": \"vcs\",\n\t\t\"x-vcard\": \"vcf\",\n\t\t\"n3\": \"n3\",\n\t\t\"prs.lines.tag\": \"dsc\",\n\t\t\"sgml\": [\n\t\t\t\"sgml\",\n\t\t\t\"sgm\"\n\t\t],\n\t\t\"troff\": [\n\t\t\t\"t\",\n\t\t\t\"tr\",\n\t\t\t\"roff\",\n\t\t\t\"man\",\n\t\t\t\"me\",\n\t\t\t\"ms\"\n\t\t],\n\t\t\"turtle\": \"ttl\",\n\t\t\"uri-list\": [\n\t\t\t\"uri\",\n\t\t\t\"uris\",\n\t\t\t\"urls\"\n\t\t],\n\t\t\"vcard\": \"vcard\",\n\t\t\"vnd.curl\": \"curl\",\n\t\t\"vnd.curl.dcurl\": \"dcurl\",\n\t\t\"vnd.curl.scurl\": \"scurl\",\n\t\t\"vnd.curl.mcurl\": \"mcurl\",\n\t\t\"vnd.dvb.subtitle\": \"sub\",\n\t\t\"vnd.fly\": \"fly\",\n\t\t\"vnd.fmi.flexstor\": \"flx\",\n\t\t\"vnd.graphviz\": \"gv\",\n\t\t\"vnd.in3d.3dml\": \"3dml\",\n\t\t\"vnd.in3d.spot\": \"spot\",\n\t\t\"x-asm\": [\n\t\t\t\"s\",\n\t\t\t\"asm\"\n\t\t],\n\t\t\"x-c\": [\n\t\t\t\"c\",\n\t\t\t\"h\",\n\t\t\t\"dic\"\n\t\t],\n\t\t\"x-fortran\": [\n\t\t\t\"f\",\n\t\t\t\"for\",\n\t\t\t\"f77\",\n\t\t\t\"f90\"\n\t\t],\n\t\t\"x-opml\": \"opml\",\n\t\t\"x-nfo\": \"nfo\",\n\t\t\"x-sfv\": \"sfv\",\n\t\t\"x-uuencode\": \"uu\",\n\t\t\"webviewhtml\": \"htt\",\n\t\t\"javascript\": \"js\",\n\t\t\"json\": \"json\",\n\t\t\"markdown\": [\n\t\t\t\"md\",\n\t\t\t\"markdown\",\n\t\t\t\"mdown\",\n\t\t\t\"markdn\"\n\t\t],\n\t\t\"vnd.wap.si\": \"si\",\n\t\t\"vnd.wap.sl\": \"sl\"\n\t},\n\t\"video\": {\n\t\t\"avif\": \"avif\",\n\t\t\"3gpp\": \"3gp\",\n\t\t\"annodex\": \"axv\",\n\t\t\"dl\": \"dl\",\n\t\t\"dv\": [\n\t\t\t\"dif\",\n\t\t\t\"dv\"\n\t\t],\n\t\t\"fli\": \"fli\",\n\t\t\"gl\": \"gl\",\n\t\t\"mpeg\": [\n\t\t\t\"mpeg\",\n\t\t\t\"mpg\",\n\t\t\t\"mpe\",\n\t\t\t\"m1v\",\n\t\t\t\"m2v\",\n\t\t\t\"mp2\",\n\t\t\t\"mpa\",\n\t\t\t\"mpv2\"\n\t\t],\n\t\t\"mp4\": [\n\t\t\t\"mp4\",\n\t\t\t\"mp4v\",\n\t\t\t\"mpg4\"\n\t\t],\n\t\t\"quicktime\": [\n\t\t\t\"qt\",\n\t\t\t\"mov\"\n\t\t],\n\t\t\"ogg\": \"ogv\",\n\t\t\"vnd.mpegurl\": [\n\t\t\t\"mxu\",\n\t\t\t\"m4u\"\n\t\t],\n\t\t\"x-flv\": \"flv\",\n\t\t\"x-la-asf\": [\n\t\t\t\"lsf\",\n\t\t\t\"lsx\"\n\t\t],\n\t\t\"x-mng\": \"mng\",\n\t\t\"x-ms-asf\": [\n\t\t\t\"asf\",\n\t\t\t\"asx\",\n\t\t\t\"asr\"\n\t\t],\n\t\t\"x-ms-wm\": \"wm\",\n\t\t\"x-ms-wmv\": \"wmv\",\n\t\t\"x-ms-wmx\": \"wmx\",\n\t\t\"x-ms-wvx\": \"wvx\",\n\t\t\"x-msvideo\": \"avi\",\n\t\t\"x-sgi-movie\": \"movie\",\n\t\t\"x-matroska\": [\n\t\t\t\"mpv\",\n\t\t\t\"mkv\",\n\t\t\t\"mk3d\",\n\t\t\t\"mks\"\n\t\t],\n\t\t\"3gpp2\": \"3g2\",\n\t\t\"h261\": \"h261\",\n\t\t\"h263\": \"h263\",\n\t\t\"h264\": \"h264\",\n\t\t\"jpeg\": \"jpgv\",\n\t\t\"jpm\": [\n\t\t\t\"jpm\",\n\t\t\t\"jpgm\"\n\t\t],\n\t\t\"mj2\": [\n\t\t\t\"mj2\",\n\t\t\t\"mjp2\"\n\t\t],\n\t\t\"vnd.dece.hd\": [\n\t\t\t\"uvh\",\n\t\t\t\"uvvh\"\n\t\t],\n\t\t\"vnd.dece.mobile\": [\n\t\t\t\"uvm\",\n\t\t\t\"uvvm\"\n\t\t],\n\t\t\"vnd.dece.pd\": [\n\t\t\t\"uvp\",\n\t\t\t\"uvvp\"\n\t\t],\n\t\t\"vnd.dece.sd\": [\n\t\t\t\"uvs\",\n\t\t\t\"uvvs\"\n\t\t],\n\t\t\"vnd.dece.video\": [\n\t\t\t\"uvv\",\n\t\t\t\"uvvv\"\n\t\t],\n\t\t\"vnd.dvb.file\": \"dvb\",\n\t\t\"vnd.fvt\": \"fvt\",\n\t\t\"vnd.ms-playready.media.pyv\": \"pyv\",\n\t\t\"vnd.uvvu.mp4\": [\n\t\t\t\"uvu\",\n\t\t\t\"uvvu\"\n\t\t],\n\t\t\"vnd.vivo\": \"viv\",\n\t\t\"webm\": \"webm\",\n\t\t\"x-f4v\": \"f4v\",\n\t\t\"x-m4v\": \"m4v\",\n\t\t\"x-ms-vob\": \"vob\",\n\t\t\"x-smv\": \"smv\",\n\t\t\"mp2t\": \"ts\"\n\t},\n\t\"x-conference\": {\n\t\t\"x-cooltalk\": \"ice\"\n\t},\n\t\"x-world\": {\n\t\t\"x-vrml\": [\n\t\t\t\"vrm\",\n\t\t\t\"flr\",\n\t\t\t\"wrz\",\n\t\t\t\"xaf\",\n\t\t\t\"xof\"\n\t\t]\n\t}\n};\n\nconst mimeTypes = (() => {\n\tconst mimeTypes = {};\n\tfor (const type of Object.keys(table)) {\n\t\tfor (const subtype of Object.keys(table[type])) {\n\t\t\tconst value = table[type][subtype];\n\t\t\tif (typeof value == \"string\") {\n\t\t\t\tmimeTypes[value] = type + \"/\" + subtype;\n\t\t\t} else {\n\t\t\t\tfor (let indexMimeType = 0; indexMimeType < value.length; indexMimeType++) {\n\t\t\t\t\tmimeTypes[value[indexMimeType]] = type + \"/\" + subtype;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn mimeTypes;\n})();\n\nexport {\n\tmimeTypes,\n\tgetMimeType\n};\n\nfunction getMimeType(filename) {\n\treturn filename && mimeTypes[filename.split(\".\").pop().toLowerCase()] || getDefaultMimeType();\n}", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nconst table = [];\nfor (let i = 0; i < 256; i++) {\n\tlet t = i;\n\tfor (let j = 0; j < 8; j++) {\n\t\tif (t & 1) {\n\t\t\tt = (t >>> 1) ^ 0xEDB88320;\n\t\t} else {\n\t\t\tt = t >>> 1;\n\t\t}\n\t}\n\ttable[i] = t;\n}\n\nclass Crc32 {\n\n\tconstructor(crc) {\n\t\tthis.crc = crc || -1;\n\t}\n\n\tappend(data) {\n\t\tlet crc = this.crc | 0;\n\t\tfor (let offset = 0, length = data.length | 0; offset < length; offset++) {\n\t\t\tcrc = (crc >>> 8) ^ table[(crc ^ data[offset]) & 0xFF];\n\t\t}\n\t\tthis.crc = crc;\n\t}\n\n\tget() {\n\t\treturn ~this.crc;\n\t}\n}\n\nexport {\n\tCrc32\n};", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global TransformStream */\n\nimport { Crc32 } from \"./codecs/crc32.js\";\n\nclass Crc32Stream extends TransformStream {\n\n\tconstructor() {\n\t\tlet stream;\n\t\tconst crc32 = new Crc32();\n\t\tsuper({\n\t\t\ttransform(chunk, controller) {\n\t\t\t\tcrc32.append(chunk);\n\t\t\t\tcontroller.enqueue(chunk);\n\t\t\t},\n\t\t\tflush() {\n\t\t\t\tconst value = new Uint8Array(4);\n\t\t\t\tconst dataView = new DataView(value.buffer);\n\t\t\t\tdataView.setUint32(0, crc32.get());\n\t\t\t\tstream.value = value;\n\t\t\t}\n\t\t});\n\t\tstream = this;\n\t}\n}\n\nexport {\n\tCrc32Stream\n};", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global TextEncoder */\n\nexport {\n\tencodeText\n};\n\nfunction encodeText(value) {\n\tif (typeof TextEncoder == \"undefined\") {\n\t\tvalue = unescape(encodeURIComponent(value));\n\t\tconst result = new Uint8Array(value.length);\n\t\tfor (let i = 0; i < result.length; i++) {\n\t\t\tresult[i] = value.charCodeAt(i);\n\t\t}\n\t\treturn result;\n\t} else {\n\t\treturn new TextEncoder().encode(value);\n\t}\n}", "// Derived from https://github.com/xqdoo00o/jszip/blob/master/lib/sjcl.js and https://github.com/bitwiseshiftleft/sjcl\n\n// deno-lint-ignore-file no-this-alias\n\n/*\n * SJCL is open. You can use, modify and redistribute it under a BSD\n * license or under the GNU GPL, version 2.0.\n */\n\n/** @fileOverview Javascript cryptography implementation.\n *\n * Crush to remove comments, shorten variable names and\n * generally reduce transmission size.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n/*jslint indent: 2, bitwise: false, nomen: false, plusplus: false, white: false, regexp: false */\n\n/** @fileOverview Arrays of bits, encoded as arrays of Numbers.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n/**\n * Arrays of bits, encoded as arrays of Numbers.\n * @namespace\n * @description\n *

\n * These objects are the currency accepted by SJCL's crypto functions.\n *

\n *\n *

\n * Most of our crypto primitives operate on arrays of 4-byte words internally,\n * but many of them can take arguments that are not a multiple of 4 bytes.\n * This library encodes arrays of bits (whose size need not be a multiple of 8\n * bits) as arrays of 32-bit words. The bits are packed, big-endian, into an\n * array of words, 32 bits at a time. Since the words are double-precision\n * floating point numbers, they fit some extra data. We use this (in a private,\n * possibly-changing manner) to encode the number of bits actually present\n * in the last word of the array.\n *

\n *\n *

\n * Because bitwise ops clear this out-of-band data, these arrays can be passed\n * to ciphers like AES which want arrays of words.\n *

\n */\nconst bitArray = {\n\t/**\n\t * Concatenate two bit arrays.\n\t * @param {bitArray} a1 The first array.\n\t * @param {bitArray} a2 The second array.\n\t * @return {bitArray} The concatenation of a1 and a2.\n\t */\n\tconcat(a1, a2) {\n\t\tif (a1.length === 0 || a2.length === 0) {\n\t\t\treturn a1.concat(a2);\n\t\t}\n\n\t\tconst last = a1[a1.length - 1], shift = bitArray.getPartial(last);\n\t\tif (shift === 32) {\n\t\t\treturn a1.concat(a2);\n\t\t} else {\n\t\t\treturn bitArray._shiftRight(a2, shift, last | 0, a1.slice(0, a1.length - 1));\n\t\t}\n\t},\n\n\t/**\n\t * Find the length of an array of bits.\n\t * @param {bitArray} a The array.\n\t * @return {Number} The length of a, in bits.\n\t */\n\tbitLength(a) {\n\t\tconst l = a.length;\n\t\tif (l === 0) {\n\t\t\treturn 0;\n\t\t}\n\t\tconst x = a[l - 1];\n\t\treturn (l - 1) * 32 + bitArray.getPartial(x);\n\t},\n\n\t/**\n\t * Truncate an array.\n\t * @param {bitArray} a The array.\n\t * @param {Number} len The length to truncate to, in bits.\n\t * @return {bitArray} A new array, truncated to len bits.\n\t */\n\tclamp(a, len) {\n\t\tif (a.length * 32 < len) {\n\t\t\treturn a;\n\t\t}\n\t\ta = a.slice(0, Math.ceil(len / 32));\n\t\tconst l = a.length;\n\t\tlen = len & 31;\n\t\tif (l > 0 && len) {\n\t\t\ta[l - 1] = bitArray.partial(len, a[l - 1] & 0x80000000 >> (len - 1), 1);\n\t\t}\n\t\treturn a;\n\t},\n\n\t/**\n\t * Make a partial word for a bit array.\n\t * @param {Number} len The number of bits in the word.\n\t * @param {Number} x The bits.\n\t * @param {Number} [_end=0] Pass 1 if x has already been shifted to the high side.\n\t * @return {Number} The partial word.\n\t */\n\tpartial(len, x, _end) {\n\t\tif (len === 32) {\n\t\t\treturn x;\n\t\t}\n\t\treturn (_end ? x | 0 : x << (32 - len)) + len * 0x10000000000;\n\t},\n\n\t/**\n\t * Get the number of bits used by a partial word.\n\t * @param {Number} x The partial word.\n\t * @return {Number} The number of bits used by the partial word.\n\t */\n\tgetPartial(x) {\n\t\treturn Math.round(x / 0x10000000000) || 32;\n\t},\n\n\t/** Shift an array right.\n\t * @param {bitArray} a The array to shift.\n\t * @param {Number} shift The number of bits to shift.\n\t * @param {Number} [carry=0] A byte to carry in\n\t * @param {bitArray} [out=[]] An array to prepend to the output.\n\t * @private\n\t */\n\t_shiftRight(a, shift, carry, out) {\n\t\tif (out === undefined) {\n\t\t\tout = [];\n\t\t}\n\n\t\tfor (; shift >= 32; shift -= 32) {\n\t\t\tout.push(carry);\n\t\t\tcarry = 0;\n\t\t}\n\t\tif (shift === 0) {\n\t\t\treturn out.concat(a);\n\t\t}\n\n\t\tfor (let i = 0; i < a.length; i++) {\n\t\t\tout.push(carry | a[i] >>> shift);\n\t\t\tcarry = a[i] << (32 - shift);\n\t\t}\n\t\tconst last2 = a.length ? a[a.length - 1] : 0;\n\t\tconst shift2 = bitArray.getPartial(last2);\n\t\tout.push(bitArray.partial(shift + shift2 & 31, (shift + shift2 > 32) ? carry : out.pop(), 1));\n\t\treturn out;\n\t}\n};\n\n/** @fileOverview Bit array codec implementations.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n/**\n * Arrays of bytes\n * @namespace\n */\nconst codec = {\n\tbytes: {\n\t\t/** Convert from a bitArray to an array of bytes. */\n\t\tfromBits(arr) {\n\t\t\tconst bl = bitArray.bitLength(arr);\n\t\t\tconst byteLength = bl / 8;\n\t\t\tconst out = new Uint8Array(byteLength);\n\t\t\tlet tmp;\n\t\t\tfor (let i = 0; i < byteLength; i++) {\n\t\t\t\tif ((i & 3) === 0) {\n\t\t\t\t\ttmp = arr[i / 4];\n\t\t\t\t}\n\t\t\t\tout[i] = tmp >>> 24;\n\t\t\t\ttmp <<= 8;\n\t\t\t}\n\t\t\treturn out;\n\t\t},\n\t\t/** Convert from an array of bytes to a bitArray. */\n\t\ttoBits(bytes) {\n\t\t\tconst out = [];\n\t\t\tlet i;\n\t\t\tlet tmp = 0;\n\t\t\tfor (i = 0; i < bytes.length; i++) {\n\t\t\t\ttmp = tmp << 8 | bytes[i];\n\t\t\t\tif ((i & 3) === 3) {\n\t\t\t\t\tout.push(tmp);\n\t\t\t\t\ttmp = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (i & 3) {\n\t\t\t\tout.push(bitArray.partial(8 * (i & 3), tmp));\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t}\n};\n\nconst hash = {};\n\n/**\n * Context for a SHA-1 operation in progress.\n * @constructor\n */\nhash.sha1 = class {\n\tconstructor(hash) {\n\t\tconst sha1 = this;\n\t\t/**\n\t\t * The hash's block size, in bits.\n\t\t * @constant\n\t\t */\n\t\tsha1.blockSize = 512;\n\t\t/**\n\t\t * The SHA-1 initialization vector.\n\t\t * @private\n\t\t */\n\t\tsha1._init = [0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0];\n\t\t/**\n\t\t * The SHA-1 hash key.\n\t\t * @private\n\t\t */\n\t\tsha1._key = [0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xCA62C1D6];\n\t\tif (hash) {\n\t\t\tsha1._h = hash._h.slice(0);\n\t\t\tsha1._buffer = hash._buffer.slice(0);\n\t\t\tsha1._length = hash._length;\n\t\t} else {\n\t\t\tsha1.reset();\n\t\t}\n\t}\n\n\t/**\n\t * Reset the hash state.\n\t * @return this\n\t */\n\treset() {\n\t\tconst sha1 = this;\n\t\tsha1._h = sha1._init.slice(0);\n\t\tsha1._buffer = [];\n\t\tsha1._length = 0;\n\t\treturn sha1;\n\t}\n\n\t/**\n\t * Input several words to the hash.\n\t * @param {bitArray|String} data the data to hash.\n\t * @return this\n\t */\n\tupdate(data) {\n\t\tconst sha1 = this;\n\t\tif (typeof data === \"string\") {\n\t\t\tdata = codec.utf8String.toBits(data);\n\t\t}\n\t\tconst b = sha1._buffer = bitArray.concat(sha1._buffer, data);\n\t\tconst ol = sha1._length;\n\t\tconst nl = sha1._length = ol + bitArray.bitLength(data);\n\t\tif (nl > 9007199254740991) {\n\t\t\tthrow new Error(\"Cannot hash more than 2^53 - 1 bits\");\n\t\t}\n\t\tconst c = new Uint32Array(b);\n\t\tlet j = 0;\n\t\tfor (let i = sha1.blockSize + ol - ((sha1.blockSize + ol) & (sha1.blockSize - 1)); i <= nl;\n\t\t\ti += sha1.blockSize) {\n\t\t\tsha1._block(c.subarray(16 * j, 16 * (j + 1)));\n\t\t\tj += 1;\n\t\t}\n\t\tb.splice(0, 16 * j);\n\t\treturn sha1;\n\t}\n\n\t/**\n\t * Complete hashing and output the hash value.\n\t * @return {bitArray} The hash value, an array of 5 big-endian words. TODO\n\t */\n\tfinalize() {\n\t\tconst sha1 = this;\n\t\tlet b = sha1._buffer;\n\t\tconst h = sha1._h;\n\n\t\t// Round out and push the buffer\n\t\tb = bitArray.concat(b, [bitArray.partial(1, 1)]);\n\t\t// Round out the buffer to a multiple of 16 words, less the 2 length words.\n\t\tfor (let i = b.length + 2; i & 15; i++) {\n\t\t\tb.push(0);\n\t\t}\n\n\t\t// append the length\n\t\tb.push(Math.floor(sha1._length / 0x100000000));\n\t\tb.push(sha1._length | 0);\n\n\t\twhile (b.length) {\n\t\t\tsha1._block(b.splice(0, 16));\n\t\t}\n\n\t\tsha1.reset();\n\t\treturn h;\n\t}\n\n\t/**\n\t * The SHA-1 logical functions f(0), f(1), ..., f(79).\n\t * @private\n\t */\n\t_f(t, b, c, d) {\n\t\tif (t <= 19) {\n\t\t\treturn (b & c) | (~b & d);\n\t\t} else if (t <= 39) {\n\t\t\treturn b ^ c ^ d;\n\t\t} else if (t <= 59) {\n\t\t\treturn (b & c) | (b & d) | (c & d);\n\t\t} else if (t <= 79) {\n\t\t\treturn b ^ c ^ d;\n\t\t}\n\t}\n\n\t/**\n\t * Circular left-shift operator.\n\t * @private\n\t */\n\t_S(n, x) {\n\t\treturn (x << n) | (x >>> 32 - n);\n\t}\n\n\t/**\n\t * Perform one cycle of SHA-1.\n\t * @param {Uint32Array|bitArray} words one block of words.\n\t * @private\n\t */\n\t_block(words) {\n\t\tconst sha1 = this;\n\t\tconst h = sha1._h;\n\t\t// When words is passed to _block, it has 16 elements. SHA1 _block\n\t\t// function extends words with new elements (at the end there are 80 elements). \n\t\t// The problem is that if we use Uint32Array instead of Array, \n\t\t// the length of Uint32Array cannot be changed. Thus, we replace words with a \n\t\t// normal Array here.\n\t\tconst w = Array(80); // do not use Uint32Array here as the instantiation is slower\n\t\tfor (let j = 0; j < 16; j++) {\n\t\t\tw[j] = words[j];\n\t\t}\n\n\t\tlet a = h[0];\n\t\tlet b = h[1];\n\t\tlet c = h[2];\n\t\tlet d = h[3];\n\t\tlet e = h[4];\n\n\t\tfor (let t = 0; t <= 79; t++) {\n\t\t\tif (t >= 16) {\n\t\t\t\tw[t] = sha1._S(1, w[t - 3] ^ w[t - 8] ^ w[t - 14] ^ w[t - 16]);\n\t\t\t}\n\t\t\tconst tmp = (sha1._S(5, a) + sha1._f(t, b, c, d) + e + w[t] +\n\t\t\t\tsha1._key[Math.floor(t / 20)]) | 0;\n\t\t\te = d;\n\t\t\td = c;\n\t\t\tc = sha1._S(30, b);\n\t\t\tb = a;\n\t\t\ta = tmp;\n\t\t}\n\n\t\th[0] = (h[0] + a) | 0;\n\t\th[1] = (h[1] + b) | 0;\n\t\th[2] = (h[2] + c) | 0;\n\t\th[3] = (h[3] + d) | 0;\n\t\th[4] = (h[4] + e) | 0;\n\t}\n};\n\n/** @fileOverview Low-level AES implementation.\n *\n * This file contains a low-level implementation of AES, optimized for\n * size and for efficiency on several browsers. It is based on\n * OpenSSL's aes_core.c, a public-domain implementation by Vincent\n * Rijmen, Antoon Bosselaers and Paulo Barreto.\n *\n * An older version of this implementation is available in the public\n * domain, but this one is (c) Emily Stark, Mike Hamburg, Dan Boneh,\n * Stanford University 2008-2010 and BSD-licensed for liability\n * reasons.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\nconst cipher = {};\n\n/**\n * Schedule out an AES key for both encryption and decryption. This\n * is a low-level class. Use a cipher mode to do bulk encryption.\n *\n * @constructor\n * @param {Array} key The key as an array of 4, 6 or 8 words.\n */\ncipher.aes = class {\n\tconstructor(key) {\n\t\t/**\n\t\t * The expanded S-box and inverse S-box tables. These will be computed\n\t\t * on the client so that we don't have to send them down the wire.\n\t\t *\n\t\t * There are two tables, _tables[0] is for encryption and\n\t\t * _tables[1] is for decryption.\n\t\t *\n\t\t * The first 4 sub-tables are the expanded S-box with MixColumns. The\n\t\t * last (_tables[01][4]) is the S-box itself.\n\t\t *\n\t\t * @private\n\t\t */\n\t\tconst aes = this;\n\t\taes._tables = [[[], [], [], [], []], [[], [], [], [], []]];\n\n\t\tif (!aes._tables[0][0][0]) {\n\t\t\taes._precompute();\n\t\t}\n\n\t\tconst sbox = aes._tables[0][4];\n\t\tconst decTable = aes._tables[1];\n\t\tconst keyLen = key.length;\n\n\t\tlet i, encKey, decKey, rcon = 1;\n\n\t\tif (keyLen !== 4 && keyLen !== 6 && keyLen !== 8) {\n\t\t\tthrow new Error(\"invalid aes key size\");\n\t\t}\n\n\t\taes._key = [encKey = key.slice(0), decKey = []];\n\n\t\t// schedule encryption keys\n\t\tfor (i = keyLen; i < 4 * keyLen + 28; i++) {\n\t\t\tlet tmp = encKey[i - 1];\n\n\t\t\t// apply sbox\n\t\t\tif (i % keyLen === 0 || (keyLen === 8 && i % keyLen === 4)) {\n\t\t\t\ttmp = sbox[tmp >>> 24] << 24 ^ sbox[tmp >> 16 & 255] << 16 ^ sbox[tmp >> 8 & 255] << 8 ^ sbox[tmp & 255];\n\n\t\t\t\t// shift rows and add rcon\n\t\t\t\tif (i % keyLen === 0) {\n\t\t\t\t\ttmp = tmp << 8 ^ tmp >>> 24 ^ rcon << 24;\n\t\t\t\t\trcon = rcon << 1 ^ (rcon >> 7) * 283;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tencKey[i] = encKey[i - keyLen] ^ tmp;\n\t\t}\n\n\t\t// schedule decryption keys\n\t\tfor (let j = 0; i; j++, i--) {\n\t\t\tconst tmp = encKey[j & 3 ? i : i - 4];\n\t\t\tif (i <= 4 || j < 4) {\n\t\t\t\tdecKey[j] = tmp;\n\t\t\t} else {\n\t\t\t\tdecKey[j] = decTable[0][sbox[tmp >>> 24]] ^\n\t\t\t\t\tdecTable[1][sbox[tmp >> 16 & 255]] ^\n\t\t\t\t\tdecTable[2][sbox[tmp >> 8 & 255]] ^\n\t\t\t\t\tdecTable[3][sbox[tmp & 255]];\n\t\t\t}\n\t\t}\n\t}\n\t// public\n\t/* Something like this might appear here eventually\n\tname: \"AES\",\n\tblockSize: 4,\n\tkeySizes: [4,6,8],\n\t*/\n\n\t/**\n\t * Encrypt an array of 4 big-endian words.\n\t * @param {Array} data The plaintext.\n\t * @return {Array} The ciphertext.\n\t */\n\tencrypt(data) {\n\t\treturn this._crypt(data, 0);\n\t}\n\n\t/**\n\t * Decrypt an array of 4 big-endian words.\n\t * @param {Array} data The ciphertext.\n\t * @return {Array} The plaintext.\n\t */\n\tdecrypt(data) {\n\t\treturn this._crypt(data, 1);\n\t}\n\n\t/**\n\t * Expand the S-box tables.\n\t *\n\t * @private\n\t */\n\t_precompute() {\n\t\tconst encTable = this._tables[0];\n\t\tconst decTable = this._tables[1];\n\t\tconst sbox = encTable[4];\n\t\tconst sboxInv = decTable[4];\n\t\tconst d = [];\n\t\tconst th = [];\n\t\tlet xInv, x2, x4, x8;\n\n\t\t// Compute double and third tables\n\t\tfor (let i = 0; i < 256; i++) {\n\t\t\tth[(d[i] = i << 1 ^ (i >> 7) * 283) ^ i] = i;\n\t\t}\n\n\t\tfor (let x = xInv = 0; !sbox[x]; x ^= x2 || 1, xInv = th[xInv] || 1) {\n\t\t\t// Compute sbox\n\t\t\tlet s = xInv ^ xInv << 1 ^ xInv << 2 ^ xInv << 3 ^ xInv << 4;\n\t\t\ts = s >> 8 ^ s & 255 ^ 99;\n\t\t\tsbox[x] = s;\n\t\t\tsboxInv[s] = x;\n\n\t\t\t// Compute MixColumns\n\t\t\tx8 = d[x4 = d[x2 = d[x]]];\n\t\t\tlet tDec = x8 * 0x1010101 ^ x4 * 0x10001 ^ x2 * 0x101 ^ x * 0x1010100;\n\t\t\tlet tEnc = d[s] * 0x101 ^ s * 0x1010100;\n\n\t\t\tfor (let i = 0; i < 4; i++) {\n\t\t\t\tencTable[i][x] = tEnc = tEnc << 24 ^ tEnc >>> 8;\n\t\t\t\tdecTable[i][s] = tDec = tDec << 24 ^ tDec >>> 8;\n\t\t\t}\n\t\t}\n\n\t\t// Compactify. Considerable speedup on Firefox.\n\t\tfor (let i = 0; i < 5; i++) {\n\t\t\tencTable[i] = encTable[i].slice(0);\n\t\t\tdecTable[i] = decTable[i].slice(0);\n\t\t}\n\t}\n\n\t/**\n\t * Encryption and decryption core.\n\t * @param {Array} input Four words to be encrypted or decrypted.\n\t * @param dir The direction, 0 for encrypt and 1 for decrypt.\n\t * @return {Array} The four encrypted or decrypted words.\n\t * @private\n\t */\n\t_crypt(input, dir) {\n\t\tif (input.length !== 4) {\n\t\t\tthrow new Error(\"invalid aes block size\");\n\t\t}\n\n\t\tconst key = this._key[dir];\n\n\t\tconst nInnerRounds = key.length / 4 - 2;\n\t\tconst out = [0, 0, 0, 0];\n\t\tconst table = this._tables[dir];\n\n\t\t// load up the tables\n\t\tconst t0 = table[0];\n\t\tconst t1 = table[1];\n\t\tconst t2 = table[2];\n\t\tconst t3 = table[3];\n\t\tconst sbox = table[4];\n\n\t\t// state variables a,b,c,d are loaded with pre-whitened data\n\t\tlet a = input[0] ^ key[0];\n\t\tlet b = input[dir ? 3 : 1] ^ key[1];\n\t\tlet c = input[2] ^ key[2];\n\t\tlet d = input[dir ? 1 : 3] ^ key[3];\n\t\tlet kIndex = 4;\n\t\tlet a2, b2, c2;\n\n\t\t// Inner rounds. Cribbed from OpenSSL.\n\t\tfor (let i = 0; i < nInnerRounds; i++) {\n\t\t\ta2 = t0[a >>> 24] ^ t1[b >> 16 & 255] ^ t2[c >> 8 & 255] ^ t3[d & 255] ^ key[kIndex];\n\t\t\tb2 = t0[b >>> 24] ^ t1[c >> 16 & 255] ^ t2[d >> 8 & 255] ^ t3[a & 255] ^ key[kIndex + 1];\n\t\t\tc2 = t0[c >>> 24] ^ t1[d >> 16 & 255] ^ t2[a >> 8 & 255] ^ t3[b & 255] ^ key[kIndex + 2];\n\t\t\td = t0[d >>> 24] ^ t1[a >> 16 & 255] ^ t2[b >> 8 & 255] ^ t3[c & 255] ^ key[kIndex + 3];\n\t\t\tkIndex += 4;\n\t\t\ta = a2; b = b2; c = c2;\n\t\t}\n\n\t\t// Last round.\n\t\tfor (let i = 0; i < 4; i++) {\n\t\t\tout[dir ? 3 & -i : i] =\n\t\t\t\tsbox[a >>> 24] << 24 ^\n\t\t\t\tsbox[b >> 16 & 255] << 16 ^\n\t\t\t\tsbox[c >> 8 & 255] << 8 ^\n\t\t\t\tsbox[d & 255] ^\n\t\t\t\tkey[kIndex++];\n\t\t\ta2 = a; a = b; b = c; c = d; d = a2;\n\t\t}\n\n\t\treturn out;\n\t}\n};\n\n/**\n * Random values\n * @namespace\n */\nconst random = {\n\t/** \n\t * Generate random words with pure js, cryptographically not as strong & safe as native implementation.\n\t * @param {TypedArray} typedArray The array to fill.\n\t * @return {TypedArray} The random values.\n\t */\n\tgetRandomValues(typedArray) {\n\t\tconst words = new Uint32Array(typedArray.buffer);\n\t\tconst r = (m_w) => {\n\t\t\tlet m_z = 0x3ade68b1;\n\t\t\tconst mask = 0xffffffff;\n\t\t\treturn function () {\n\t\t\t\tm_z = (0x9069 * (m_z & 0xFFFF) + (m_z >> 0x10)) & mask;\n\t\t\t\tm_w = (0x4650 * (m_w & 0xFFFF) + (m_w >> 0x10)) & mask;\n\t\t\t\tconst result = ((((m_z << 0x10) + m_w) & mask) / 0x100000000) + .5;\n\t\t\t\treturn result * (Math.random() > .5 ? 1 : -1);\n\t\t\t};\n\t\t};\n\t\tfor (let i = 0, rcache; i < typedArray.length; i += 4) {\n\t\t\tconst _r = r((rcache || Math.random()) * 0x100000000);\n\t\t\trcache = _r() * 0x3ade67b7;\n\t\t\twords[i / 4] = (_r() * 0x100000000) | 0;\n\t\t}\n\t\treturn typedArray;\n\t}\n};\n\n/** @fileOverview CTR mode implementation.\n *\n * Special thanks to Roy Nicholson for pointing out a bug in our\n * implementation.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n/** Brian Gladman's CTR Mode.\n* @constructor\n* @param {Object} _prf The aes instance to generate key.\n* @param {bitArray} _iv The iv for ctr mode, it must be 128 bits.\n*/\n\nconst mode = {};\n\n/**\n * Brian Gladman's CTR Mode.\n * @namespace\n */\nmode.ctrGladman = class {\n\tconstructor(prf, iv) {\n\t\tthis._prf = prf;\n\t\tthis._initIv = iv;\n\t\tthis._iv = iv;\n\t}\n\n\treset() {\n\t\tthis._iv = this._initIv;\n\t}\n\n\t/** Input some data to calculate.\n\t * @param {bitArray} data the data to process, it must be intergral multiple of 128 bits unless it's the last.\n\t */\n\tupdate(data) {\n\t\treturn this.calculate(this._prf, data, this._iv);\n\t}\n\n\tincWord(word) {\n\t\tif (((word >> 24) & 0xff) === 0xff) { //overflow\n\t\t\tlet b1 = (word >> 16) & 0xff;\n\t\t\tlet b2 = (word >> 8) & 0xff;\n\t\t\tlet b3 = word & 0xff;\n\n\t\t\tif (b1 === 0xff) { // overflow b1 \n\t\t\t\tb1 = 0;\n\t\t\t\tif (b2 === 0xff) {\n\t\t\t\t\tb2 = 0;\n\t\t\t\t\tif (b3 === 0xff) {\n\t\t\t\t\t\tb3 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\t++b3;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t++b2;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t++b1;\n\t\t\t}\n\n\t\t\tword = 0;\n\t\t\tword += (b1 << 16);\n\t\t\tword += (b2 << 8);\n\t\t\tword += b3;\n\t\t} else {\n\t\t\tword += (0x01 << 24);\n\t\t}\n\t\treturn word;\n\t}\n\n\tincCounter(counter) {\n\t\tif ((counter[0] = this.incWord(counter[0])) === 0) {\n\t\t\t// encr_data in fileenc.c from Dr Brian Gladman's counts only with DWORD j < 8\n\t\t\tcounter[1] = this.incWord(counter[1]);\n\t\t}\n\t}\n\n\tcalculate(prf, data, iv) {\n\t\tlet l;\n\t\tif (!(l = data.length)) {\n\t\t\treturn [];\n\t\t}\n\t\tconst bl = bitArray.bitLength(data);\n\t\tfor (let i = 0; i < l; i += 4) {\n\t\t\tthis.incCounter(iv);\n\t\t\tconst e = prf.encrypt(iv);\n\t\t\tdata[i] ^= e[0];\n\t\t\tdata[i + 1] ^= e[1];\n\t\t\tdata[i + 2] ^= e[2];\n\t\t\tdata[i + 3] ^= e[3];\n\t\t}\n\t\treturn bitArray.clamp(data, bl);\n\t}\n};\n\nconst misc = {\n\timportKey(password) {\n\t\treturn new misc.hmacSha1(codec.bytes.toBits(password));\n\t},\n\tpbkdf2(prf, salt, count, length) {\n\t\tcount = count || 10000;\n\t\tif (length < 0 || count < 0) {\n\t\t\tthrow new Error(\"invalid params to pbkdf2\");\n\t\t}\n\t\tconst byteLength = ((length >> 5) + 1) << 2;\n\t\tlet u, ui, i, j, k;\n\t\tconst arrayBuffer = new ArrayBuffer(byteLength);\n\t\tconst out = new DataView(arrayBuffer);\n\t\tlet outLength = 0;\n\t\tconst b = bitArray;\n\t\tsalt = codec.bytes.toBits(salt);\n\t\tfor (k = 1; outLength < (byteLength || 1); k++) {\n\t\t\tu = ui = prf.encrypt(b.concat(salt, [k]));\n\t\t\tfor (i = 1; i < count; i++) {\n\t\t\t\tui = prf.encrypt(ui);\n\t\t\t\tfor (j = 0; j < ui.length; j++) {\n\t\t\t\t\tu[j] ^= ui[j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (i = 0; outLength < (byteLength || 1) && i < u.length; i++) {\n\t\t\t\tout.setInt32(outLength, u[i]);\n\t\t\t\toutLength += 4;\n\t\t\t}\n\t\t}\n\t\treturn arrayBuffer.slice(0, length / 8);\n\t}\n};\n\n/** @fileOverview HMAC implementation.\n *\n * @author Emily Stark\n * @author Mike Hamburg\n * @author Dan Boneh\n */\n\n/** HMAC with the specified hash function.\n * @constructor\n * @param {bitArray} key the key for HMAC.\n * @param {Object} [Hash=hash.sha1] The hash function to use.\n */\nmisc.hmacSha1 = class {\n\n\tconstructor(key) {\n\t\tconst hmac = this;\n\t\tconst Hash = hmac._hash = hash.sha1;\n\t\tconst exKey = [[], []];\n\t\thmac._baseHash = [new Hash(), new Hash()];\n\t\tconst bs = hmac._baseHash[0].blockSize / 32;\n\n\t\tif (key.length > bs) {\n\t\t\tkey = new Hash().update(key).finalize();\n\t\t}\n\n\t\tfor (let i = 0; i < bs; i++) {\n\t\t\texKey[0][i] = key[i] ^ 0x36363636;\n\t\t\texKey[1][i] = key[i] ^ 0x5C5C5C5C;\n\t\t}\n\n\t\thmac._baseHash[0].update(exKey[0]);\n\t\thmac._baseHash[1].update(exKey[1]);\n\t\thmac._resultHash = new Hash(hmac._baseHash[0]);\n\t}\n\treset() {\n\t\tconst hmac = this;\n\t\thmac._resultHash = new hmac._hash(hmac._baseHash[0]);\n\t\thmac._updated = false;\n\t}\n\n\tupdate(data) {\n\t\tconst hmac = this;\n\t\thmac._updated = true;\n\t\thmac._resultHash.update(data);\n\t}\n\n\tdigest() {\n\t\tconst hmac = this;\n\t\tconst w = hmac._resultHash.finalize();\n\t\tconst result = new (hmac._hash)(hmac._baseHash[1]).update(w).finalize();\n\n\t\thmac.reset();\n\n\t\treturn result;\n\t}\n\n\tencrypt(data) {\n\t\tif (!this._updated) {\n\t\t\tthis.update(data);\n\t\t\treturn this.digest(data);\n\t\t} else {\n\t\t\tthrow new Error(\"encrypt on already updated hmac called!\");\n\t\t}\n\t}\n};\n\nexport {\n\tcipher,\n\tcodec,\n\tmisc,\n\tmode,\n\trandom\n};", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global crypto */\n\nimport {\n\trandom\n} from \"./codecs/sjcl.js\";\n\nconst GET_RANDOM_VALUES_SUPPORTED = typeof crypto != \"undefined\" && typeof crypto.getRandomValues == \"function\";\n\nconst ERR_INVALID_PASSWORD = \"Invalid password\";\nconst ERR_INVALID_SIGNATURE = \"Invalid signature\";\nconst ERR_ABORT_CHECK_PASSWORD = \"zipjs-abort-check-password\";\n\nexport {\n\tgetRandomValues,\n\tERR_INVALID_PASSWORD,\n\tERR_INVALID_SIGNATURE,\n\tERR_ABORT_CHECK_PASSWORD\n};\n\nfunction getRandomValues(array) {\n\tif (GET_RANDOM_VALUES_SUPPORTED) {\n\t\treturn crypto.getRandomValues(array);\n\t} else {\n\t\treturn random.getRandomValues(array);\n\t}\n}", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global crypto, TransformStream */\n// deno-lint-ignore-file no-this-alias\n\nimport { encodeText } from \"./../util/encode-text.js\";\nimport {\n\tcipher,\n\tcodec,\n\tmisc,\n\tmode\n} from \"./codecs/sjcl.js\";\nimport {\n\tERR_INVALID_PASSWORD,\n\tERR_INVALID_SIGNATURE,\n\tERR_ABORT_CHECK_PASSWORD,\n\tgetRandomValues\n} from \"./common-crypto.js\";\n\nconst BLOCK_LENGTH = 16;\nconst RAW_FORMAT = \"raw\";\nconst PBKDF2_ALGORITHM = { name: \"PBKDF2\" };\nconst HASH_ALGORITHM = { name: \"HMAC\" };\nconst HASH_FUNCTION = \"SHA-1\";\nconst BASE_KEY_ALGORITHM = Object.assign({ hash: HASH_ALGORITHM }, PBKDF2_ALGORITHM);\nconst DERIVED_BITS_ALGORITHM = Object.assign({ iterations: 1000, hash: { name: HASH_FUNCTION } }, PBKDF2_ALGORITHM);\nconst DERIVED_BITS_USAGE = [\"deriveBits\"];\nconst SALT_LENGTH = [8, 12, 16];\nconst KEY_LENGTH = [16, 24, 32];\nconst SIGNATURE_LENGTH = 10;\nconst COUNTER_DEFAULT_VALUE = [0, 0, 0, 0];\nconst UNDEFINED_TYPE = \"undefined\";\nconst FUNCTION_TYPE = \"function\";\n// deno-lint-ignore valid-typeof\nconst CRYPTO_API_SUPPORTED = typeof crypto != UNDEFINED_TYPE;\nconst subtle = CRYPTO_API_SUPPORTED && crypto.subtle;\nconst SUBTLE_API_SUPPORTED = CRYPTO_API_SUPPORTED && typeof subtle != UNDEFINED_TYPE;\nconst codecBytes = codec.bytes;\nconst Aes = cipher.aes;\nconst CtrGladman = mode.ctrGladman;\nconst HmacSha1 = misc.hmacSha1;\n\nlet IMPORT_KEY_SUPPORTED = CRYPTO_API_SUPPORTED && SUBTLE_API_SUPPORTED && typeof subtle.importKey == FUNCTION_TYPE;\nlet DERIVE_BITS_SUPPORTED = CRYPTO_API_SUPPORTED && SUBTLE_API_SUPPORTED && typeof subtle.deriveBits == FUNCTION_TYPE;\n\nclass AESDecryptionStream extends TransformStream {\n\n\tconstructor({ password, signed, encryptionStrength, checkPasswordOnly }) {\n\t\tsuper({\n\t\t\tstart() {\n\t\t\t\tObject.assign(this, {\n\t\t\t\t\tready: new Promise(resolve => this.resolveReady = resolve),\n\t\t\t\t\tpassword,\n\t\t\t\t\tsigned,\n\t\t\t\t\tstrength: encryptionStrength - 1,\n\t\t\t\t\tpending: new Uint8Array()\n\t\t\t\t});\n\t\t\t},\n\t\t\tasync transform(chunk, controller) {\n\t\t\t\tconst aesCrypto = this;\n\t\t\t\tconst {\n\t\t\t\t\tpassword,\n\t\t\t\t\tstrength,\n\t\t\t\t\tresolveReady,\n\t\t\t\t\tready\n\t\t\t\t} = aesCrypto;\n\t\t\t\tif (password) {\n\t\t\t\t\tawait createDecryptionKeys(aesCrypto, strength, password, subarray(chunk, 0, SALT_LENGTH[strength] + 2));\n\t\t\t\t\tchunk = subarray(chunk, SALT_LENGTH[strength] + 2);\n\t\t\t\t\tif (checkPasswordOnly) {\n\t\t\t\t\t\tcontroller.error(new Error(ERR_ABORT_CHECK_PASSWORD));\n\t\t\t\t\t} else {\n\t\t\t\t\t\tresolveReady();\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tawait ready;\n\t\t\t\t}\n\t\t\t\tconst output = new Uint8Array(chunk.length - SIGNATURE_LENGTH - ((chunk.length - SIGNATURE_LENGTH) % BLOCK_LENGTH));\n\t\t\t\tcontroller.enqueue(append(aesCrypto, chunk, output, 0, SIGNATURE_LENGTH, true));\n\t\t\t},\n\t\t\tasync flush(controller) {\n\t\t\t\tconst {\n\t\t\t\t\tsigned,\n\t\t\t\t\tctr,\n\t\t\t\t\thmac,\n\t\t\t\t\tpending,\n\t\t\t\t\tready\n\t\t\t\t} = this;\n\t\t\t\tawait ready;\n\t\t\t\tconst chunkToDecrypt = subarray(pending, 0, pending.length - SIGNATURE_LENGTH);\n\t\t\t\tconst originalSignature = subarray(pending, pending.length - SIGNATURE_LENGTH);\n\t\t\t\tlet decryptedChunkArray = new Uint8Array();\n\t\t\t\tif (chunkToDecrypt.length) {\n\t\t\t\t\tconst encryptedChunk = toBits(codecBytes, chunkToDecrypt);\n\t\t\t\t\thmac.update(encryptedChunk);\n\t\t\t\t\tconst decryptedChunk = ctr.update(encryptedChunk);\n\t\t\t\t\tdecryptedChunkArray = fromBits(codecBytes, decryptedChunk);\n\t\t\t\t}\n\t\t\t\tif (signed) {\n\t\t\t\t\tconst signature = subarray(fromBits(codecBytes, hmac.digest()), 0, SIGNATURE_LENGTH);\n\t\t\t\t\tfor (let indexSignature = 0; indexSignature < SIGNATURE_LENGTH; indexSignature++) {\n\t\t\t\t\t\tif (signature[indexSignature] != originalSignature[indexSignature]) {\n\t\t\t\t\t\t\tthrow new Error(ERR_INVALID_SIGNATURE);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcontroller.enqueue(decryptedChunkArray);\n\t\t\t}\n\t\t});\n\t}\n}\n\nclass AESEncryptionStream extends TransformStream {\n\n\tconstructor({ password, encryptionStrength }) {\n\t\t// deno-lint-ignore prefer-const\n\t\tlet stream;\n\t\tsuper({\n\t\t\tstart() {\n\t\t\t\tObject.assign(this, {\n\t\t\t\t\tready: new Promise(resolve => this.resolveReady = resolve),\n\t\t\t\t\tpassword,\n\t\t\t\t\tstrength: encryptionStrength - 1,\n\t\t\t\t\tpending: new Uint8Array()\n\t\t\t\t});\n\t\t\t},\n\t\t\tasync transform(chunk, controller) {\n\t\t\t\tconst aesCrypto = this;\n\t\t\t\tconst {\n\t\t\t\t\tpassword,\n\t\t\t\t\tstrength,\n\t\t\t\t\tresolveReady,\n\t\t\t\t\tready\n\t\t\t\t} = aesCrypto;\n\t\t\t\tlet preamble = new Uint8Array();\n\t\t\t\tif (password) {\n\t\t\t\t\tpreamble = await createEncryptionKeys(aesCrypto, strength, password);\n\t\t\t\t\tresolveReady();\n\t\t\t\t} else {\n\t\t\t\t\tawait ready;\n\t\t\t\t}\n\t\t\t\tconst output = new Uint8Array(preamble.length + chunk.length - (chunk.length % BLOCK_LENGTH));\n\t\t\t\toutput.set(preamble, 0);\n\t\t\t\tcontroller.enqueue(append(aesCrypto, chunk, output, preamble.length, 0));\n\t\t\t},\n\t\t\tasync flush(controller) {\n\t\t\t\tconst {\n\t\t\t\t\tctr,\n\t\t\t\t\thmac,\n\t\t\t\t\tpending,\n\t\t\t\t\tready\n\t\t\t\t} = this;\n\t\t\t\tawait ready;\n\t\t\t\tlet encryptedChunkArray = new Uint8Array();\n\t\t\t\tif (pending.length) {\n\t\t\t\t\tconst encryptedChunk = ctr.update(toBits(codecBytes, pending));\n\t\t\t\t\thmac.update(encryptedChunk);\n\t\t\t\t\tencryptedChunkArray = fromBits(codecBytes, encryptedChunk);\n\t\t\t\t}\n\t\t\t\tstream.signature = fromBits(codecBytes, hmac.digest()).slice(0, SIGNATURE_LENGTH);\n\t\t\t\tcontroller.enqueue(concat(encryptedChunkArray, stream.signature));\n\t\t\t}\n\t\t});\n\t\tstream = this;\n\t}\n}\n\nexport {\n\tAESDecryptionStream,\n\tAESEncryptionStream,\n\tERR_INVALID_PASSWORD\n};\n\nfunction append(aesCrypto, input, output, paddingStart, paddingEnd, verifySignature) {\n\tconst {\n\t\tctr,\n\t\thmac,\n\t\tpending\n\t} = aesCrypto;\n\tconst inputLength = input.length - paddingEnd;\n\tif (pending.length) {\n\t\tinput = concat(pending, input);\n\t\toutput = expand(output, inputLength - (inputLength % BLOCK_LENGTH));\n\t}\n\tlet offset;\n\tfor (offset = 0; offset <= inputLength - BLOCK_LENGTH; offset += BLOCK_LENGTH) {\n\t\tconst inputChunk = toBits(codecBytes, subarray(input, offset, offset + BLOCK_LENGTH));\n\t\tif (verifySignature) {\n\t\t\thmac.update(inputChunk);\n\t\t}\n\t\tconst outputChunk = ctr.update(inputChunk);\n\t\tif (!verifySignature) {\n\t\t\thmac.update(outputChunk);\n\t\t}\n\t\toutput.set(fromBits(codecBytes, outputChunk), offset + paddingStart);\n\t}\n\taesCrypto.pending = subarray(input, offset);\n\treturn output;\n}\n\nasync function createDecryptionKeys(decrypt, strength, password, preamble) {\n\tconst passwordVerificationKey = await createKeys(decrypt, strength, password, subarray(preamble, 0, SALT_LENGTH[strength]));\n\tconst passwordVerification = subarray(preamble, SALT_LENGTH[strength]);\n\tif (passwordVerificationKey[0] != passwordVerification[0] || passwordVerificationKey[1] != passwordVerification[1]) {\n\t\tthrow new Error(ERR_INVALID_PASSWORD);\n\t}\n}\n\nasync function createEncryptionKeys(encrypt, strength, password) {\n\tconst salt = getRandomValues(new Uint8Array(SALT_LENGTH[strength]));\n\tconst passwordVerification = await createKeys(encrypt, strength, password, salt);\n\treturn concat(salt, passwordVerification);\n}\n\nasync function createKeys(aesCrypto, strength, password, salt) {\n\taesCrypto.password = null;\n\tconst encodedPassword = encodeText(password);\n\tconst baseKey = await importKey(RAW_FORMAT, encodedPassword, BASE_KEY_ALGORITHM, false, DERIVED_BITS_USAGE);\n\tconst derivedBits = await deriveBits(Object.assign({ salt }, DERIVED_BITS_ALGORITHM), baseKey, 8 * ((KEY_LENGTH[strength] * 2) + 2));\n\tconst compositeKey = new Uint8Array(derivedBits);\n\tconst key = toBits(codecBytes, subarray(compositeKey, 0, KEY_LENGTH[strength]));\n\tconst authentication = toBits(codecBytes, subarray(compositeKey, KEY_LENGTH[strength], KEY_LENGTH[strength] * 2));\n\tconst passwordVerification = subarray(compositeKey, KEY_LENGTH[strength] * 2);\n\tObject.assign(aesCrypto, {\n\t\tkeys: {\n\t\t\tkey,\n\t\t\tauthentication,\n\t\t\tpasswordVerification\n\t\t},\n\t\tctr: new CtrGladman(new Aes(key), Array.from(COUNTER_DEFAULT_VALUE)),\n\t\thmac: new HmacSha1(authentication)\n\t});\n\treturn passwordVerification;\n}\n\nasync function importKey(format, password, algorithm, extractable, keyUsages) {\n\tif (IMPORT_KEY_SUPPORTED) {\n\t\ttry {\n\t\t\treturn await subtle.importKey(format, password, algorithm, extractable, keyUsages);\n\t\t} catch (_error) {\n\t\t\tIMPORT_KEY_SUPPORTED = false;\n\t\t\treturn misc.importKey(password);\n\t\t}\n\t} else {\n\t\treturn misc.importKey(password);\n\t}\n}\n\nasync function deriveBits(algorithm, baseKey, length) {\n\tif (DERIVE_BITS_SUPPORTED) {\n\t\ttry {\n\t\t\treturn await subtle.deriveBits(algorithm, baseKey, length);\n\t\t} catch (_error) {\n\t\t\tDERIVE_BITS_SUPPORTED = false;\n\t\t\treturn misc.pbkdf2(baseKey, algorithm.salt, DERIVED_BITS_ALGORITHM.iterations, length);\n\t\t}\n\t} else {\n\t\treturn misc.pbkdf2(baseKey, algorithm.salt, DERIVED_BITS_ALGORITHM.iterations, length);\n\t}\n}\n\nfunction concat(leftArray, rightArray) {\n\tlet array = leftArray;\n\tif (leftArray.length + rightArray.length) {\n\t\tarray = new Uint8Array(leftArray.length + rightArray.length);\n\t\tarray.set(leftArray, 0);\n\t\tarray.set(rightArray, leftArray.length);\n\t}\n\treturn array;\n}\n\nfunction expand(inputArray, length) {\n\tif (length && length > inputArray.length) {\n\t\tconst array = inputArray;\n\t\tinputArray = new Uint8Array(length);\n\t\tinputArray.set(array, 0);\n\t}\n\treturn inputArray;\n}\n\nfunction subarray(array, begin, end) {\n\treturn array.subarray(begin, end);\n}\n\nfunction fromBits(codecBytes, chunk) {\n\treturn codecBytes.fromBits(chunk);\n}\nfunction toBits(codecBytes, chunk) {\n\treturn codecBytes.toBits(chunk);\n}", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global TransformStream */\n// deno-lint-ignore-file no-this-alias\n\nimport { Crc32 } from \"./codecs/crc32.js\";\nimport {\n\tERR_INVALID_PASSWORD,\n\tERR_ABORT_CHECK_PASSWORD,\n\tgetRandomValues\n} from \"./common-crypto.js\";\n\nconst HEADER_LENGTH = 12;\n\nclass ZipCryptoDecryptionStream extends TransformStream {\n\n\tconstructor({ password, passwordVerification, checkPasswordOnly }) {\n\t\tsuper({\n\t\t\tstart() {\n\t\t\t\tObject.assign(this, {\n\t\t\t\t\tpassword,\n\t\t\t\t\tpasswordVerification\n\t\t\t\t});\n\t\t\t\tcreateKeys(this, password);\n\t\t\t},\n\t\t\ttransform(chunk, controller) {\n\t\t\t\tconst zipCrypto = this;\n\t\t\t\tif (zipCrypto.password) {\n\t\t\t\t\tconst decryptedHeader = decrypt(zipCrypto, chunk.subarray(0, HEADER_LENGTH));\n\t\t\t\t\tzipCrypto.password = null;\n\t\t\t\t\tif (decryptedHeader[HEADER_LENGTH - 1] != zipCrypto.passwordVerification) {\n\t\t\t\t\t\tthrow new Error(ERR_INVALID_PASSWORD);\n\t\t\t\t\t}\n\t\t\t\t\tchunk = chunk.subarray(HEADER_LENGTH);\n\t\t\t\t}\n\t\t\t\tif (checkPasswordOnly) {\n\t\t\t\t\tcontroller.error(new Error(ERR_ABORT_CHECK_PASSWORD));\n\t\t\t\t} else {\n\t\t\t\t\tcontroller.enqueue(decrypt(zipCrypto, chunk));\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t}\n}\n\nclass ZipCryptoEncryptionStream extends TransformStream {\n\n\tconstructor({ password, passwordVerification }) {\n\t\tsuper({\n\t\t\tstart() {\n\t\t\t\tObject.assign(this, {\n\t\t\t\t\tpassword,\n\t\t\t\t\tpasswordVerification\n\t\t\t\t});\n\t\t\t\tcreateKeys(this, password);\n\t\t\t},\n\t\t\ttransform(chunk, controller) {\n\t\t\t\tconst zipCrypto = this;\n\t\t\t\tlet output;\n\t\t\t\tlet offset;\n\t\t\t\tif (zipCrypto.password) {\n\t\t\t\t\tzipCrypto.password = null;\n\t\t\t\t\tconst header = getRandomValues(new Uint8Array(HEADER_LENGTH));\n\t\t\t\t\theader[HEADER_LENGTH - 1] = zipCrypto.passwordVerification;\n\t\t\t\t\toutput = new Uint8Array(chunk.length + header.length);\n\t\t\t\t\toutput.set(encrypt(zipCrypto, header), 0);\n\t\t\t\t\toffset = HEADER_LENGTH;\n\t\t\t\t} else {\n\t\t\t\t\toutput = new Uint8Array(chunk.length);\n\t\t\t\t\toffset = 0;\n\t\t\t\t}\n\t\t\t\toutput.set(encrypt(zipCrypto, chunk), offset);\n\t\t\t\tcontroller.enqueue(output);\n\t\t\t}\n\t\t});\n\t}\n}\n\nexport {\n\tZipCryptoDecryptionStream,\n\tZipCryptoEncryptionStream,\n\tERR_INVALID_PASSWORD\n};\n\nfunction decrypt(target, input) {\n\tconst output = new Uint8Array(input.length);\n\tfor (let index = 0; index < input.length; index++) {\n\t\toutput[index] = getByte(target) ^ input[index];\n\t\tupdateKeys(target, output[index]);\n\t}\n\treturn output;\n}\n\nfunction encrypt(target, input) {\n\tconst output = new Uint8Array(input.length);\n\tfor (let index = 0; index < input.length; index++) {\n\t\toutput[index] = getByte(target) ^ input[index];\n\t\tupdateKeys(target, input[index]);\n\t}\n\treturn output;\n}\n\nfunction createKeys(target, password) {\n\tconst keys = [0x12345678, 0x23456789, 0x34567890];\n\tObject.assign(target, {\n\t\tkeys,\n\t\tcrcKey0: new Crc32(keys[0]),\n\t\tcrcKey2: new Crc32(keys[2]),\n\t});\n\tfor (let index = 0; index < password.length; index++) {\n\t\tupdateKeys(target, password.charCodeAt(index));\n\t}\n}\n\nfunction updateKeys(target, byte) {\n\tlet [key0, key1, key2] = target.keys;\n\ttarget.crcKey0.append([byte]);\n\tkey0 = ~target.crcKey0.get();\n\tkey1 = getInt32(Math.imul(getInt32(key1 + getInt8(key0)), 134775813) + 1);\n\ttarget.crcKey2.append([key1 >>> 24]);\n\tkey2 = ~target.crcKey2.get();\n\ttarget.keys = [key0, key1, key2];\n}\n\nfunction getByte(target) {\n\tconst temp = target.keys[2] | 2;\n\treturn getInt8(Math.imul(temp, (temp ^ 1)) >>> 8);\n}\n\nfunction getInt8(number) {\n\treturn number & 0xFF;\n}\n\nfunction getInt32(number) {\n\treturn number & 0xFFFFFFFF;\n}", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global TransformStream */\n// deno-lint-ignore-file no-this-alias\n\nimport { Crc32Stream } from \"./crc32-stream.js\";\nimport {\n\tAESEncryptionStream,\n\tAESDecryptionStream\n} from \"./aes-crypto-stream.js\";\nimport {\n\tZipCryptoEncryptionStream,\n\tZipCryptoDecryptionStream\n} from \"./zip-crypto-stream.js\";\nimport {\n\tERR_INVALID_PASSWORD,\n\tERR_INVALID_SIGNATURE,\n\tERR_ABORT_CHECK_PASSWORD\n} from \"./common-crypto.js\";\n\nconst COMPRESSION_FORMAT = \"deflate-raw\";\n\nclass DeflateStream extends TransformStream {\n\n\tconstructor(options, { chunkSize, CompressionStream, CompressionStreamNative }) {\n\t\tsuper({});\n\t\tconst { compressed, encrypted, useCompressionStream, zipCrypto, signed, level } = options;\n\t\tconst stream = this;\n\t\tlet crc32Stream, encryptionStream;\n\t\tlet readable = filterEmptyChunks(super.readable);\n\t\tif ((!encrypted || zipCrypto) && signed) {\n\t\t\tcrc32Stream = new Crc32Stream();\n\t\t\treadable = pipeThrough(readable, crc32Stream);\n\t\t}\n\t\tif (compressed) {\n\t\t\treadable = pipeThroughCommpressionStream(readable, useCompressionStream, { level, chunkSize }, CompressionStreamNative, CompressionStream);\n\t\t}\n\t\tif (encrypted) {\n\t\t\tif (zipCrypto) {\n\t\t\t\treadable = pipeThrough(readable, new ZipCryptoEncryptionStream(options));\n\t\t\t} else {\n\t\t\t\tencryptionStream = new AESEncryptionStream(options);\n\t\t\t\treadable = pipeThrough(readable, encryptionStream);\n\t\t\t}\n\t\t}\n\t\tsetReadable(stream, readable, async () => {\n\t\t\tlet signature;\n\t\t\tif (encrypted && !zipCrypto) {\n\t\t\t\tsignature = encryptionStream.signature;\n\t\t\t}\n\t\t\tif ((!encrypted || zipCrypto) && signed) {\n\t\t\t\tsignature = new DataView(crc32Stream.value.buffer).getUint32(0);\n\t\t\t}\n\t\t\tstream.signature = signature;\n\t\t});\n\t}\n}\n\nclass InflateStream extends TransformStream {\n\n\tconstructor(options, { chunkSize, DecompressionStream, DecompressionStreamNative }) {\n\t\tsuper({});\n\t\tconst { zipCrypto, encrypted, signed, signature, compressed, useCompressionStream } = options;\n\t\tlet crc32Stream, decryptionStream;\n\t\tlet readable = filterEmptyChunks(super.readable);\n\t\tif (encrypted) {\n\t\t\tif (zipCrypto) {\n\t\t\t\treadable = pipeThrough(readable, new ZipCryptoDecryptionStream(options));\n\t\t\t} else {\n\t\t\t\tdecryptionStream = new AESDecryptionStream(options);\n\t\t\t\treadable = pipeThrough(readable, decryptionStream);\n\t\t\t}\n\t\t}\n\t\tif (compressed) {\n\t\t\treadable = pipeThroughCommpressionStream(readable, useCompressionStream, { chunkSize }, DecompressionStreamNative, DecompressionStream);\n\t\t}\n\t\tif ((!encrypted || zipCrypto) && signed) {\n\t\t\tcrc32Stream = new Crc32Stream();\n\t\t\treadable = pipeThrough(readable, crc32Stream);\n\t\t}\n\t\tsetReadable(this, readable, async () => {\n\t\t\tif ((!encrypted || zipCrypto) && signed) {\n\t\t\t\tconst dataViewSignature = new DataView(crc32Stream.value.buffer);\n\t\t\t\tif (signature != dataViewSignature.getUint32(0, false)) {\n\t\t\t\t\tthrow new Error(ERR_INVALID_SIGNATURE);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t}\n}\n\nexport {\n\tDeflateStream,\n\tInflateStream,\n\tERR_INVALID_PASSWORD,\n\tERR_INVALID_SIGNATURE,\n\tERR_ABORT_CHECK_PASSWORD\n};\n\nfunction filterEmptyChunks(readable) {\n\treturn pipeThrough(readable, new TransformStream({\n\t\ttransform(chunk, controller) {\n\t\t\tif (chunk && chunk.length) {\n\t\t\t\tcontroller.enqueue(chunk);\n\t\t\t}\n\t\t}\n\t}));\n}\n\nfunction setReadable(stream, readable, flush) {\n\treadable = pipeThrough(readable, new TransformStream({ flush }));\n\tObject.defineProperty(stream, \"readable\", {\n\t\tget() {\n\t\t\treturn readable;\n\t\t}\n\t});\n}\n\nfunction pipeThroughCommpressionStream(readable, useCompressionStream, options, CodecStreamNative, CodecStream) {\n\ttry {\n\t\tconst CompressionStream = useCompressionStream && CodecStreamNative ? CodecStreamNative : CodecStream;\n\t\treadable = pipeThrough(readable, new CompressionStream(COMPRESSION_FORMAT, options));\n\t} catch (error) {\n\t\tif (useCompressionStream) {\n\t\t\treadable = pipeThrough(readable, new CodecStream(COMPRESSION_FORMAT, options));\n\t\t} else {\n\t\t\tthrow error;\n\t\t}\n\t}\n\treturn readable;\n}\n\nfunction pipeThrough(readable, transformStream) {\n\treturn readable.pipeThrough(transformStream);\n}", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/*\n * This program is based on JZlib 1.0.2 ymnk, JCraft,Inc.\n * JZlib is based on zlib-1.1.3, so all credit should go authors\n * Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)\n * and contributors of zlib.\n */\n\n/* global TransformStream */\n// deno-lint-ignore-file no-this-alias\n\nimport {\n\tERR_INVALID_PASSWORD,\n\tERR_INVALID_SIGNATURE,\n\tERR_ABORT_CHECK_PASSWORD,\n\tInflateStream,\n\tDeflateStream\n} from \"./zip-entry-stream.js\";\n\nconst MESSAGE_EVENT_TYPE = \"message\";\nconst MESSAGE_START = \"start\";\nconst MESSAGE_PULL = \"pull\";\nconst MESSAGE_DATA = \"data\";\nconst MESSAGE_ACK_DATA = \"ack\";\nconst MESSAGE_CLOSE = \"close\";\nconst CODEC_DEFLATE = \"deflate\";\nconst CODEC_INFLATE = \"inflate\";\n\nexport {\n\tCODEC_DEFLATE,\n\tCODEC_INFLATE,\n\tMESSAGE_EVENT_TYPE,\n\tMESSAGE_START,\n\tMESSAGE_PULL,\n\tMESSAGE_DATA,\n\tMESSAGE_ACK_DATA,\n\tMESSAGE_CLOSE,\n\tERR_INVALID_PASSWORD,\n\tERR_INVALID_SIGNATURE,\n\tERR_ABORT_CHECK_PASSWORD,\n\tCodecStream\n};\n\nclass CodecStream extends TransformStream {\n\n\tconstructor(options, config) {\n\t\tsuper({});\n\t\tconst codec = this;\n\t\tconst { codecType } = options;\n\t\tlet Stream;\n\t\tif (codecType.startsWith(CODEC_DEFLATE)) {\n\t\t\tStream = DeflateStream;\n\t\t} else if (codecType.startsWith(CODEC_INFLATE)) {\n\t\t\tStream = InflateStream;\n\t\t}\n\t\tlet size = 0;\n\t\tconst stream = new Stream(options, config);\n\t\tconst readable = super.readable;\n\t\tconst transformStream = new TransformStream({\n\t\t\ttransform(chunk, controller) {\n\t\t\t\tif (chunk && chunk.length) {\n\t\t\t\t\tsize += chunk.length;\n\t\t\t\t\tcontroller.enqueue(chunk);\n\t\t\t\t}\n\t\t\t},\n\t\t\tflush() {\n\t\t\t\tconst { signature } = stream;\n\t\t\t\tObject.assign(codec, {\n\t\t\t\t\tsignature,\n\t\t\t\t\tsize\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\t\tObject.defineProperty(codec, \"readable\", {\n\t\t\tget() {\n\t\t\t\treturn readable.pipeThrough(stream).pipeThrough(transformStream);\n\t\t\t}\n\t\t});\n\t}\n}", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global Worker, URL, TransformStream, WritableStream */\n\nimport {\n\tUNDEFINED_TYPE,\n\tFUNCTION_TYPE\n} from \"./constants.js\";\nimport {\n\tCodecStream,\n\tMESSAGE_EVENT_TYPE,\n\tMESSAGE_START,\n\tMESSAGE_PULL,\n\tMESSAGE_DATA,\n\tMESSAGE_ACK_DATA,\n\tMESSAGE_CLOSE\n} from \"./streams/codec-stream.js\";\n\n// deno-lint-ignore valid-typeof\nconst WEB_WORKERS_SUPPORTED = typeof Worker != UNDEFINED_TYPE;\n\nexport {\n\tCodecWorker\n};\n\nclass CodecWorker {\n\n\tconstructor(workerData, { readable, writable }, { options, config, streamOptions, useWebWorkers, transferStreams, scripts }, onTaskFinished) {\n\t\tconst { signal } = streamOptions;\n\t\tObject.assign(workerData, {\n\t\t\tbusy: true,\n\t\t\treadable: readable.pipeThrough(new ProgressWatcherStream(readable, streamOptions, config), { signal }),\n\t\t\twritable,\n\t\t\toptions: Object.assign({}, options),\n\t\t\tscripts,\n\t\t\ttransferStreams,\n\t\t\tterminate() {\n\t\t\t\tconst { worker, busy } = workerData;\n\t\t\t\tif (worker && !busy) {\n\t\t\t\t\tworker.terminate();\n\t\t\t\t\tworkerData.interface = null;\n\t\t\t\t}\n\t\t\t},\n\t\t\tonTaskFinished() {\n\t\t\t\tworkerData.busy = false;\n\t\t\t\tonTaskFinished(workerData);\n\t\t\t}\n\t\t});\n\t\treturn (useWebWorkers && WEB_WORKERS_SUPPORTED ? createWebWorkerInterface : createWorkerInterface)(workerData, config);\n\t}\n}\n\nclass ProgressWatcherStream extends TransformStream {\n\n\tconstructor(readableSource, { onstart, onprogress, size, onend }, { chunkSize }) {\n\t\tlet chunkOffset = 0;\n\t\tsuper({\n\t\t\tstart() {\n\t\t\t\tif (onstart) {\n\t\t\t\t\tcallHandler(onstart, size);\n\t\t\t\t}\n\t\t\t},\n\t\t\tasync transform(chunk, controller) {\n\t\t\t\tchunkOffset += chunk.length;\n\t\t\t\tif (onprogress) {\n\t\t\t\t\tawait callHandler(onprogress, chunkOffset, size);\n\t\t\t\t}\n\t\t\t\tcontroller.enqueue(chunk);\n\t\t\t},\n\t\t\tflush() {\n\t\t\t\treadableSource.size = chunkOffset;\n\t\t\t\tif (onend) {\n\t\t\t\t\tcallHandler(onend, chunkOffset);\n\t\t\t\t}\n\t\t\t}\n\t\t}, { highWaterMark: 1, size: () => chunkSize });\n\t}\n}\n\nasync function callHandler(handler, ...parameters) {\n\ttry {\n\t\tawait handler(...parameters);\n\t} catch (_error) {\n\t\t// ignored\n\t}\n}\n\nfunction createWorkerInterface(workerData, config) {\n\treturn {\n\t\trun: () => runWorker(workerData, config)\n\t};\n}\n\nfunction createWebWorkerInterface(workerData, { baseURL, chunkSize }) {\n\tif (!workerData.interface) {\n\t\tObject.assign(workerData, {\n\t\t\tworker: getWebWorker(workerData.scripts[0], baseURL, workerData),\n\t\t\tinterface: {\n\t\t\t\trun: () => runWebWorker(workerData, { chunkSize })\n\t\t\t}\n\t\t});\n\t}\n\treturn workerData.interface;\n}\n\nasync function runWorker({ options, readable, writable, onTaskFinished }, config) {\n\tconst codecStream = new CodecStream(options, config);\n\ttry {\n\t\tawait readable.pipeThrough(codecStream).pipeTo(writable, { preventClose: true, preventAbort: true });\n\t\tconst {\n\t\t\tsignature,\n\t\t\tsize\n\t\t} = codecStream;\n\t\treturn {\n\t\t\tsignature,\n\t\t\tsize\n\t\t};\n\t} finally {\n\t\tonTaskFinished();\n\t}\n}\n\nasync function runWebWorker(workerData, config) {\n\tlet resolveResult, rejectResult;\n\tconst result = new Promise((resolve, reject) => {\n\t\tresolveResult = resolve;\n\t\trejectResult = reject;\n\t});\n\tObject.assign(workerData, {\n\t\treader: null,\n\t\twriter: null,\n\t\tresolveResult,\n\t\trejectResult,\n\t\tresult\n\t});\n\tconst { readable, options, scripts } = workerData;\n\tconst { writable, closed } = watchClosedStream(workerData.writable);\n\tconst streamsTransferred = sendMessage({\n\t\ttype: MESSAGE_START,\n\t\tscripts: scripts.slice(1),\n\t\toptions,\n\t\tconfig,\n\t\treadable,\n\t\twritable\n\t}, workerData);\n\tif (!streamsTransferred) {\n\t\tObject.assign(workerData, {\n\t\t\treader: readable.getReader(),\n\t\t\twriter: writable.getWriter()\n\t\t});\n\t}\n\tconst resultValue = await result;\n\ttry {\n\t\tawait writable.getWriter().close();\n\t} catch (_error) {\n\t\t// ignored\n\t}\n\tawait closed;\n\treturn resultValue;\n}\n\nfunction watchClosedStream(writableSource) {\n\tconst writer = writableSource.getWriter();\n\tlet resolveStreamClosed;\n\tconst closed = new Promise(resolve => resolveStreamClosed = resolve);\n\tconst writable = new WritableStream({\n\t\tasync write(chunk) {\n\t\t\tawait writer.ready;\n\t\t\tawait writer.write(chunk);\n\t\t},\n\t\tclose() {\n\t\t\twriter.releaseLock();\n\t\t\tresolveStreamClosed();\n\t\t},\n\t\tabort(reason) {\n\t\t\treturn writer.abort(reason);\n\t\t}\n\t});\n\treturn { writable, closed };\n}\n\nlet classicWorkersSupported = true;\nlet transferStreamsSupported = true;\n\nfunction getWebWorker(url, baseURL, workerData) {\n\tconst workerOptions = { type: \"module\" };\n\tlet scriptUrl, worker;\n\t// deno-lint-ignore valid-typeof\n\tif (typeof url == FUNCTION_TYPE) {\n\t\turl = url();\n\t}\n\ttry {\n\t\tscriptUrl = new URL(url, baseURL);\n\t} catch (_error) {\n\t\tscriptUrl = url;\n\t}\n\tif (classicWorkersSupported) {\n\t\ttry {\n\t\t\tworker = new Worker(scriptUrl);\n\t\t} catch (_error) {\n\t\t\tclassicWorkersSupported = false;\n\t\t\tworker = new Worker(scriptUrl, workerOptions);\n\t\t}\n\t} else {\n\t\tworker = new Worker(scriptUrl, workerOptions);\n\t}\n\tworker.addEventListener(MESSAGE_EVENT_TYPE, event => onMessage(event, workerData));\n\treturn worker;\n}\n\nfunction sendMessage(message, { worker, writer, onTaskFinished, transferStreams }) {\n\ttry {\n\t\tlet { value, readable, writable } = message;\n\t\tconst transferables = [];\n\t\tif (value) {\n\t\t\tmessage.value = value.buffer;\n\t\t\ttransferables.push(message.value);\n\t\t}\n\t\tif (transferStreams && transferStreamsSupported) {\n\t\t\tif (readable) {\n\t\t\t\ttransferables.push(readable);\n\t\t\t}\n\t\t\tif (writable) {\n\t\t\t\ttransferables.push(writable);\n\t\t\t}\n\t\t} else {\n\t\t\tmessage.readable = message.writable = null;\n\t\t}\n\t\tif (transferables.length) {\n\t\t\ttry {\n\t\t\t\tworker.postMessage(message, transferables);\n\t\t\t\treturn true;\n\t\t\t} catch (_error) {\n\t\t\t\ttransferStreamsSupported = false;\n\t\t\t\tmessage.readable = message.writable = null;\n\t\t\t\tworker.postMessage(message);\n\t\t\t}\n\t\t} else {\n\t\t\tworker.postMessage(message);\n\t\t}\n\t} catch (error) {\n\t\tif (writer) {\n\t\t\twriter.releaseLock();\n\t\t}\n\t\tonTaskFinished();\n\t\tthrow error;\n\t}\n}\n\nasync function onMessage({ data }, workerData) {\n\tconst { type, value, messageId, result, error } = data;\n\tconst { reader, writer, resolveResult, rejectResult, onTaskFinished } = workerData;\n\ttry {\n\t\tif (error) {\n\t\t\tconst { message, stack, code, name } = error;\n\t\t\tconst responseError = new Error(message);\n\t\t\tObject.assign(responseError, { stack, code, name });\n\t\t\tclose(responseError);\n\t\t} else {\n\t\t\tif (type == MESSAGE_PULL) {\n\t\t\t\tconst { value, done } = await reader.read();\n\t\t\t\tsendMessage({ type: MESSAGE_DATA, value, done, messageId }, workerData);\n\t\t\t}\n\t\t\tif (type == MESSAGE_DATA) {\n\t\t\t\tawait writer.ready;\n\t\t\t\tawait writer.write(new Uint8Array(value));\n\t\t\t\tsendMessage({ type: MESSAGE_ACK_DATA, messageId }, workerData);\n\t\t\t}\n\t\t\tif (type == MESSAGE_CLOSE) {\n\t\t\t\tclose(null, result);\n\t\t\t}\n\t\t}\n\t} catch (error) {\n\t\tclose(error);\n\t}\n\n\tfunction close(error, result) {\n\t\tif (error) {\n\t\t\trejectResult(error);\n\t\t} else {\n\t\t\tresolveResult(result);\n\t\t}\n\t\tif (writer) {\n\t\t\twriter.releaseLock();\n\t\t}\n\t\tonTaskFinished();\n\t}\n}", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global setTimeout, clearTimeout */\n\nimport { UNDEFINED_VALUE } from \"./constants.js\";\nimport {\n\tCODEC_INFLATE,\n\tCODEC_DEFLATE,\n\tERR_INVALID_SIGNATURE,\n\tERR_INVALID_PASSWORD,\n\tERR_ABORT_CHECK_PASSWORD\n} from \"./streams/codec-stream.js\";\nimport { CodecWorker } from \"./codec-worker.js\";\n\nlet pool = [];\nconst pendingRequests = [];\n\nexport {\n\trunWorker,\n\tterminateWorkers,\n\tCODEC_DEFLATE,\n\tCODEC_INFLATE,\n\tERR_INVALID_SIGNATURE,\n\tERR_INVALID_PASSWORD,\n\tERR_ABORT_CHECK_PASSWORD\n};\n\nlet indexWorker = 0;\n\nasync function runWorker(stream, workerOptions) {\n\tconst { options, config } = workerOptions;\n\tconst { transferStreams, useWebWorkers, useCompressionStream, codecType, compressed, signed, encrypted } = options;\n\tconst { workerScripts, maxWorkers, terminateWorkerTimeout } = config;\n\tworkerOptions.transferStreams = transferStreams || transferStreams === UNDEFINED_VALUE;\n\tconst streamCopy = !compressed && !signed && !encrypted && !workerOptions.transferStreams;\n\tworkerOptions.useWebWorkers = !streamCopy && (useWebWorkers || (useWebWorkers === UNDEFINED_VALUE && config.useWebWorkers));\n\tworkerOptions.scripts = workerOptions.useWebWorkers && workerScripts ? workerScripts[codecType] : [];\n\toptions.useCompressionStream = useCompressionStream || (useCompressionStream === UNDEFINED_VALUE && config.useCompressionStream);\n\tlet worker;\n\tconst workerData = pool.find(workerData => !workerData.busy);\n\tif (workerData) {\n\t\tclearTerminateTimeout(workerData);\n\t\tworker = new CodecWorker(workerData, stream, workerOptions, onTaskFinished);\n\t} else if (pool.length < maxWorkers) {\n\t\tconst workerData = { indexWorker };\n\t\tindexWorker++;\n\t\tpool.push(workerData);\n\t\tworker = new CodecWorker(workerData, stream, workerOptions, onTaskFinished);\n\t} else {\n\t\tworker = await new Promise(resolve => pendingRequests.push({ resolve, stream, workerOptions }));\n\t}\n\treturn worker.run();\n\n\tfunction onTaskFinished(workerData) {\n\t\tif (pendingRequests.length) {\n\t\t\tconst [{ resolve, stream, workerOptions }] = pendingRequests.splice(0, 1);\n\t\t\tresolve(new CodecWorker(workerData, stream, workerOptions, onTaskFinished));\n\t\t} else if (workerData.worker) {\n\t\t\tclearTerminateTimeout(workerData);\n\t\t\tif (Number.isFinite(terminateWorkerTimeout) && terminateWorkerTimeout >= 0) {\n\t\t\t\tworkerData.terminateTimeout = setTimeout(() => {\n\t\t\t\t\tpool = pool.filter(data => data != workerData);\n\t\t\t\t\tworkerData.terminate();\n\t\t\t\t}, terminateWorkerTimeout);\n\t\t\t}\n\t\t} else {\n\t\t\tpool = pool.filter(data => data != workerData);\n\t\t}\n\t}\n}\n\nfunction clearTerminateTimeout(workerData) {\n\tconst { terminateTimeout } = workerData;\n\tif (terminateTimeout) {\n\t\tclearTimeout(terminateTimeout);\n\t\tworkerData.terminateTimeout = null;\n\t}\n}\n\nfunction terminateWorkers() {\n\tpool.forEach(workerData => {\n\t\tclearTerminateTimeout(workerData);\n\t\tworkerData.terminate();\n\t});\n}", "function e(e){const t=()=>URL.createObjectURL(new Blob(['const{Array:e,Object:t,Number:n,Math:r,Error:s,Uint8Array:i,Uint16Array:o,Uint32Array:c,Int32Array:f,Map:a,DataView:l,Promise:u,TextEncoder:w,crypto:h,postMessage:d,TransformStream:p,ReadableStream:y,WritableStream:m,CompressionStream:b,DecompressionStream:g}=self;class k{constructor(e){return class extends p{constructor(t,n){const r=new e(n);super({transform(e,t){t.enqueue(r.append(e))},flush(e){const t=r.flush();t&&e.enqueue(t)}})}}}}const v=[];for(let e=0;256>e;e++){let t=e;for(let e=0;8>e;e++)1&t?t=t>>>1^3988292384:t>>>=1;v[e]=t}class S{constructor(e){this.t=e||-1}append(e){let t=0|this.t;for(let n=0,r=0|e.length;r>n;n++)t=t>>>8^v[255&(t^e[n])];this.t=t}get(){return~this.t}}class z extends p{constructor(){let e;const t=new S;super({transform(e,n){t.append(e),n.enqueue(e)},flush(){const n=new i(4);new l(n.buffer).setUint32(0,t.get()),e.value=n}}),e=this}}const C={concat(e,t){if(0===e.length||0===t.length)return e.concat(t);const n=e[e.length-1],r=C.i(n);return 32===r?e.concat(t):C.o(t,r,0|n,e.slice(0,e.length-1))},l(e){const t=e.length;if(0===t)return 0;const n=e[t-1];return 32*(t-1)+C.i(n)},u(e,t){if(32*e.length0&&t&&(e[n-1]=C.h(t,e[n-1]&2147483648>>t-1,1)),e},h:(e,t,n)=>32===e?t:(n?0|t:t<<32-e)+1099511627776*e,i:e=>r.round(e/1099511627776)||32,o(e,t,n,r){for(void 0===r&&(r=[]);t>=32;t-=32)r.push(n),n=0;if(0===t)return r.concat(e);for(let s=0;s>>t),n=e[s]<<32-t;const s=e.length?e[e.length-1]:0,i=C.i(s);return r.push(C.h(t+i&31,t+i>32?n:r.pop(),1)),r}},x={p:{m(e){const t=C.l(e)/8,n=new i(t);let r;for(let s=0;t>s;s++)0==(3&s)&&(r=e[s/4]),n[s]=r>>>24,r<<=8;return n},g(e){const t=[];let n,r=0;for(n=0;n9007199254740991)throw new s(\"Cannot hash more than 2^53 - 1 bits\");const o=new c(n);let f=0;for(let e=t.blockSize+r-(t.blockSize+r&t.blockSize-1);i>=e;e+=t.blockSize)t.I(o.subarray(16*f,16*(f+1))),f+=1;return n.splice(0,16*f),t}D(){const e=this;let t=e.C;const n=e.S;t=C.concat(t,[C.h(1,1)]);for(let e=t.length+2;15&e;e++)t.push(0);for(t.push(r.floor(e._/4294967296)),t.push(0|e._);t.length;)e.I(t.splice(0,16));return e.reset(),n}V(e,t,n,r){return e>19?e>39?e>59?e>79?void 0:t^n^r:t&n|t&r|n&r:t^n^r:t&n|~t&r}P(e,t){return t<>>32-e}I(t){const n=this,s=n.S,i=e(80);for(let e=0;16>e;e++)i[e]=t[e];let o=s[0],c=s[1],f=s[2],a=s[3],l=s[4];for(let e=0;79>=e;e++){16>e||(i[e]=n.P(1,i[e-3]^i[e-8]^i[e-14]^i[e-16]));const t=n.P(5,o)+n.V(e,c,f,a)+l+i[e]+n.v[r.floor(e/20)]|0;l=a,a=f,f=n.P(30,c),c=o,o=t}s[0]=s[0]+o|0,s[1]=s[1]+c|0,s[2]=s[2]+f|0,s[3]=s[3]+a|0,s[4]=s[4]+l|0}},A={getRandomValues(e){const t=new c(e.buffer),n=e=>{let t=987654321;const n=4294967295;return()=>(t=36969*(65535&t)+(t>>16)&n,(((t<<16)+(e=18e3*(65535&e)+(e>>16)&n)&n)/4294967296+.5)*(r.random()>.5?1:-1))};for(let s,i=0;inew I.R(x.p.g(e)),B(e,t,n,r){if(n=n||1e4,0>r||0>n)throw new s(\"invalid params to pbkdf2\");const i=1+(r>>5)<<2;let o,c,f,a,u;const w=new ArrayBuffer(i),h=new l(w);let d=0;const p=C;for(t=x.p.g(t),u=1;(i||1)>d;u++){for(o=c=e.encrypt(p.concat(t,[u])),f=1;n>f;f++)for(c=e.encrypt(c),a=0;ad&&fs&&(e=(new n).update(e).D());for(let t=0;s>t;t++)r[0][t]=909522486^e[t],r[1][t]=1549556828^e[t];t.U[0].update(r[0]),t.U[1].update(r[1]),t.K=new n(t.U[0])}reset(){const e=this;e.K=new e.M(e.U[0]),e.N=!1}update(e){this.N=!0,this.K.update(e)}digest(){const e=this,t=e.K.D(),n=new e.M(e.U[1]).update(t).D();return e.reset(),n}encrypt(e){if(this.N)throw new s(\"encrypt on already updated hmac called!\");return this.update(e),this.digest(e)}}},D=void 0!==h&&\"function\"==typeof h.getRandomValues,V=\"Invalid password\",P=\"Invalid signature\",R=\"zipjs-abort-check-password\";function B(e){return D?h.getRandomValues(e):A.getRandomValues(e)}const E=16,M={name:\"PBKDF2\"},U=t.assign({hash:{name:\"HMAC\"}},M),K=t.assign({iterations:1e3,hash:{name:\"SHA-1\"}},M),N=[\"deriveBits\"],O=[8,12,16],T=[16,24,32],W=10,j=[0,0,0,0],H=\"undefined\",L=\"function\",F=typeof h!=H,q=F&&h.subtle,G=F&&typeof q!=H,J=x.p,Q=class{constructor(e){const t=this;t.O=[[[],[],[],[],[]],[[],[],[],[],[]]],t.O[0][0][0]||t.T();const n=t.O[0][4],r=t.O[1],i=e.length;let o,c,f,a=1;if(4!==i&&6!==i&&8!==i)throw new s(\"invalid aes key size\");for(t.v=[c=e.slice(0),f=[]],o=i;4*i+28>o;o++){let e=c[o-1];(o%i==0||8===i&&o%i==4)&&(e=n[e>>>24]<<24^n[e>>16&255]<<16^n[e>>8&255]<<8^n[255&e],o%i==0&&(e=e<<8^e>>>24^a<<24,a=a<<1^283*(a>>7))),c[o]=c[o-i]^e}for(let e=0;o;e++,o--){const t=c[3&e?o:o-4];f[e]=4>=o||4>e?t:r[0][n[t>>>24]]^r[1][n[t>>16&255]]^r[2][n[t>>8&255]]^r[3][n[255&t]]}}encrypt(e){return this.W(e,0)}decrypt(e){return this.W(e,1)}T(){const e=this.O[0],t=this.O[1],n=e[4],r=t[4],s=[],i=[];let o,c,f,a;for(let e=0;256>e;e++)i[(s[e]=e<<1^283*(e>>7))^e]=e;for(let l=o=0;!n[l];l^=c||1,o=i[o]||1){let i=o^o<<1^o<<2^o<<3^o<<4;i=i>>8^255&i^99,n[l]=i,r[i]=l,a=s[f=s[c=s[l]]];let u=16843009*a^65537*f^257*c^16843008*l,w=257*s[i]^16843008*i;for(let n=0;4>n;n++)e[n][l]=w=w<<24^w>>>8,t[n][i]=u=u<<24^u>>>8}for(let n=0;5>n;n++)e[n]=e[n].slice(0),t[n]=t[n].slice(0)}W(e,t){if(4!==e.length)throw new s(\"invalid aes block size\");const n=this.v[t],r=n.length/4-2,i=[0,0,0,0],o=this.O[t],c=o[0],f=o[1],a=o[2],l=o[3],u=o[4];let w,h,d,p=e[0]^n[0],y=e[t?3:1]^n[1],m=e[2]^n[2],b=e[t?1:3]^n[3],g=4;for(let e=0;r>e;e++)w=c[p>>>24]^f[y>>16&255]^a[m>>8&255]^l[255&b]^n[g],h=c[y>>>24]^f[m>>16&255]^a[b>>8&255]^l[255&p]^n[g+1],d=c[m>>>24]^f[b>>16&255]^a[p>>8&255]^l[255&y]^n[g+2],b=c[b>>>24]^f[p>>16&255]^a[y>>8&255]^l[255&m]^n[g+3],g+=4,p=w,y=h,m=d;for(let e=0;4>e;e++)i[t?3&-e:e]=u[p>>>24]<<24^u[y>>16&255]<<16^u[m>>8&255]<<8^u[255&b]^n[g++],w=p,p=y,y=m,m=b,b=w;return i}},X=class{constructor(e,t){this.j=e,this.H=t,this.L=t}reset(){this.L=this.H}update(e){return this.F(this.j,e,this.L)}q(e){if(255==(e>>24&255)){let t=e>>16&255,n=e>>8&255,r=255&e;255===t?(t=0,255===n?(n=0,255===r?r=0:++r):++n):++t,e=0,e+=t<<16,e+=n<<8,e+=r}else e+=1<<24;return e}G(e){0===(e[0]=this.q(e[0]))&&(e[1]=this.q(e[1]))}F(e,t,n){let r;if(!(r=t.length))return[];const s=C.l(t);for(let s=0;r>s;s+=4){this.G(n);const r=e.encrypt(n);t[s]^=r[0],t[s+1]^=r[1],t[s+2]^=r[2],t[s+3]^=r[3]}return C.u(t,s)}},Y=I.R;let Z=F&&G&&typeof q.importKey==L,$=F&&G&&typeof q.deriveBits==L;class ee extends p{constructor({password:e,signed:n,encryptionStrength:r,checkPasswordOnly:o}){super({start(){t.assign(this,{ready:new u((e=>this.J=e)),password:e,signed:n,X:r-1,pending:new i})},async transform(e,t){const n=this,{password:r,X:c,J:f,ready:a}=n;r?(await(async(e,t,n,r)=>{const i=await re(e,t,n,ie(r,0,O[t])),o=ie(r,O[t]);if(i[0]!=o[0]||i[1]!=o[1])throw new s(V)})(n,c,r,ie(e,0,O[c]+2)),e=ie(e,O[c]+2),o?t.error(new s(R)):f()):await a;const l=new i(e.length-W-(e.length-W)%E);t.enqueue(ne(n,e,l,0,W,!0))},async flush(e){const{signed:t,Y:n,Z:r,pending:o,ready:c}=this;await c;const f=ie(o,0,o.length-W),a=ie(o,o.length-W);let l=new i;if(f.length){const e=ce(J,f);r.update(e);const t=n.update(e);l=oe(J,t)}if(t){const e=ie(oe(J,r.digest()),0,W);for(let t=0;W>t;t++)if(e[t]!=a[t])throw new s(P)}e.enqueue(l)}})}}class te extends p{constructor({password:e,encryptionStrength:n}){let r;super({start(){t.assign(this,{ready:new u((e=>this.J=e)),password:e,X:n-1,pending:new i})},async transform(e,t){const n=this,{password:r,X:s,J:o,ready:c}=n;let f=new i;r?(f=await(async(e,t,n)=>{const r=B(new i(O[t]));return se(r,await re(e,t,n,r))})(n,s,r),o()):await c;const a=new i(f.length+e.length-e.length%E);a.set(f,0),t.enqueue(ne(n,e,a,f.length,0))},async flush(e){const{Y:t,Z:n,pending:s,ready:o}=this;await o;let c=new i;if(s.length){const e=t.update(ce(J,s));n.update(e),c=oe(J,e)}r.signature=oe(J,n.digest()).slice(0,W),e.enqueue(se(c,r.signature))}}),r=this}}function ne(e,t,n,r,s,o){const{Y:c,Z:f,pending:a}=e,l=t.length-s;let u;for(a.length&&(t=se(a,t),n=((e,t)=>{if(t&&t>e.length){const n=e;(e=new i(t)).set(n,0)}return e})(n,l-l%E)),u=0;l-E>=u;u+=E){const e=ce(J,ie(t,u,u+E));o&&f.update(e);const s=c.update(e);o||f.update(s),n.set(oe(J,s),u+r)}return e.pending=ie(t,u),n}async function re(n,r,s,o){n.password=null;const c=(e=>{if(void 0===w){const t=new i((e=unescape(encodeURIComponent(e))).length);for(let n=0;n{if(!Z)return I.importKey(t);try{return await q.importKey(\"raw\",t,n,!1,s)}catch(e){return Z=!1,I.importKey(t)}})(0,c,U,0,N),a=await(async(e,t,n)=>{if(!$)return I.B(t,e.salt,K.iterations,n);try{return await q.deriveBits(e,t,n)}catch(r){return $=!1,I.B(t,e.salt,K.iterations,n)}})(t.assign({salt:o},K),f,8*(2*T[r]+2)),l=new i(a),u=ce(J,ie(l,0,T[r])),h=ce(J,ie(l,T[r],2*T[r])),d=ie(l,2*T[r]);return t.assign(n,{keys:{key:u,$:h,passwordVerification:d},Y:new X(new Q(u),e.from(j)),Z:new Y(h)}),d}function se(e,t){let n=e;return e.length+t.length&&(n=new i(e.length+t.length),n.set(e,0),n.set(t,e.length)),n}function ie(e,t,n){return e.subarray(t,n)}function oe(e,t){return e.m(t)}function ce(e,t){return e.g(t)}class fe extends p{constructor({password:e,passwordVerification:n,checkPasswordOnly:r}){super({start(){t.assign(this,{password:e,passwordVerification:n}),we(this,e)},transform(e,t){const n=this;if(n.password){const t=le(n,e.subarray(0,12));if(n.password=null,t[11]!=n.passwordVerification)throw new s(V);e=e.subarray(12)}r?t.error(new s(R)):t.enqueue(le(n,e))}})}}class ae extends p{constructor({password:e,passwordVerification:n}){super({start(){t.assign(this,{password:e,passwordVerification:n}),we(this,e)},transform(e,t){const n=this;let r,s;if(n.password){n.password=null;const t=B(new i(12));t[11]=n.passwordVerification,r=new i(e.length+t.length),r.set(ue(n,t),0),s=12}else r=new i(e.length),s=0;r.set(ue(n,e),s),t.enqueue(r)}})}}function le(e,t){const n=new i(t.length);for(let r=0;r>>24]),i=~e.te.get(),e.keys=[n,s,i]}function de(e){const t=2|e.keys[2];return pe(r.imul(t,1^t)>>>8)}function pe(e){return 255&e}function ye(e){return 4294967295&e}const me=\"deflate-raw\";class be extends p{constructor(e,{chunkSize:t,CompressionStream:n,CompressionStreamNative:r}){super({});const{compressed:s,encrypted:i,useCompressionStream:o,zipCrypto:c,signed:f,level:a}=e,u=this;let w,h,d=ke(super.readable);i&&!c||!f||(w=new z,d=ze(d,w)),s&&(d=Se(d,o,{level:a,chunkSize:t},r,n)),i&&(c?d=ze(d,new ae(e)):(h=new te(e),d=ze(d,h))),ve(u,d,(async()=>{let e;i&&!c&&(e=h.signature),i&&!c||!f||(e=new l(w.value.buffer).getUint32(0)),u.signature=e}))}}class ge extends p{constructor(e,{chunkSize:t,DecompressionStream:n,DecompressionStreamNative:r}){super({});const{zipCrypto:i,encrypted:o,signed:c,signature:f,compressed:a,useCompressionStream:u}=e;let w,h,d=ke(super.readable);o&&(i?d=ze(d,new fe(e)):(h=new ee(e),d=ze(d,h))),a&&(d=Se(d,u,{chunkSize:t},r,n)),o&&!i||!c||(w=new z,d=ze(d,w)),ve(this,d,(async()=>{if((!o||i)&&c){const e=new l(w.value.buffer);if(f!=e.getUint32(0,!1))throw new s(P)}}))}}function ke(e){return ze(e,new p({transform(e,t){e&&e.length&&t.enqueue(e)}}))}function ve(e,n,r){n=ze(n,new p({flush:r})),t.defineProperty(e,\"readable\",{get:()=>n})}function Se(e,t,n,r,s){try{e=ze(e,new(t&&r?r:s)(me,n))}catch(r){if(!t)throw r;e=ze(e,new s(me,n))}return e}function ze(e,t){return e.pipeThrough(t)}const Ce=\"data\";class xe extends p{constructor(e,n){super({});const r=this,{codecType:s}=e;let i;s.startsWith(\"deflate\")?i=be:s.startsWith(\"inflate\")&&(i=ge);let o=0;const c=new i(e,n),f=super.readable,a=new p({transform(e,t){e&&e.length&&(o+=e.length,t.enqueue(e))},flush(){const{signature:e}=c;t.assign(r,{signature:e,size:o})}});t.defineProperty(r,\"readable\",{get:()=>f.pipeThrough(c).pipeThrough(a)})}}const _e=new a,Ae=new a;let Ie=0;async function De(e){try{const{options:t,scripts:r,config:s}=e;r&&r.length&&importScripts.apply(void 0,r),self.initCodec&&self.initCodec(),s.CompressionStreamNative=self.CompressionStream,s.DecompressionStreamNative=self.DecompressionStream,self.Deflate&&(s.CompressionStream=new k(self.Deflate)),self.Inflate&&(s.DecompressionStream=new k(self.Inflate));const i={highWaterMark:1,size:()=>s.chunkSize},o=e.readable||new y({async pull(e){const t=new u((e=>_e.set(Ie,e)));Ve({type:\"pull\",messageId:Ie}),Ie=(Ie+1)%n.MAX_SAFE_INTEGER;const{value:r,done:s}=await t;e.enqueue(r),s&&e.close()}},i),c=e.writable||new m({async write(e){let t;const r=new u((e=>t=e));Ae.set(Ie,t),Ve({type:Ce,value:e,messageId:Ie}),Ie=(Ie+1)%n.MAX_SAFE_INTEGER,await r}},i),f=new xe(t,s);await o.pipeThrough(f).pipeTo(c,{preventClose:!0,preventAbort:!0});try{await c.getWriter().close()}catch(e){}const{signature:a,size:l}=f;Ve({type:\"close\",result:{signature:a,size:l}})}catch(e){Pe(e)}}function Ve(e){let{value:t}=e;if(t)if(t.length)try{t=new i(t),e.value=t.buffer,d(e,[e.value])}catch(t){d(e)}else d(e);else d(e)}function Pe(e=new s(\"Unknown error\")){const{message:t,stack:n,code:r,name:i}=e;d({error:{message:t,stack:n,code:r,name:i}})}addEventListener(\"message\",(({data:e})=>{const{type:t,messageId:n,value:r,done:s}=e;try{if(\"start\"==t&&De(e),t==Ce){const e=_e.get(n);_e.delete(n),e({value:new i(r),done:s})}if(\"ack\"==t){const e=Ae.get(n);Ae.delete(n),e()}}catch(e){Pe(e)}}));const Re=-2;function Be(t){return Ee(t.map((([t,n])=>new e(t).fill(n,0,t))))}function Ee(t){return t.reduce(((t,n)=>t.concat(e.isArray(n)?Ee(n):n)),[])}const Me=[0,1,2,3].concat(...Be([[2,4],[2,5],[4,6],[4,7],[8,8],[8,9],[16,10],[16,11],[32,12],[32,13],[64,14],[64,15],[2,0],[1,16],[1,17],[2,18],[2,19],[4,20],[4,21],[8,22],[8,23],[16,24],[16,25],[32,26],[32,27],[64,28],[64,29]]));function Ue(){const e=this;function t(e,t){let n=0;do{n|=1&e,e>>>=1,n<<=1}while(--t>0);return n>>>1}e.ne=n=>{const s=e.re,i=e.ie.se,o=e.ie.oe;let c,f,a,l=-1;for(n.ce=0,n.fe=573,c=0;o>c;c++)0!==s[2*c]?(n.ae[++n.ce]=l=c,n.le[c]=0):s[2*c+1]=0;for(;2>n.ce;)a=n.ae[++n.ce]=2>l?++l:0,s[2*a]=1,n.le[a]=0,n.ue--,i&&(n.we-=i[2*a+1]);for(e.he=l,c=r.floor(n.ce/2);c>=1;c--)n.de(s,c);a=o;do{c=n.ae[1],n.ae[1]=n.ae[n.ce--],n.de(s,1),f=n.ae[1],n.ae[--n.fe]=c,n.ae[--n.fe]=f,s[2*a]=s[2*c]+s[2*f],n.le[a]=r.max(n.le[c],n.le[f])+1,s[2*c+1]=s[2*f+1]=a,n.ae[1]=a++,n.de(s,1)}while(n.ce>=2);n.ae[--n.fe]=n.ae[1],(t=>{const n=e.re,r=e.ie.se,s=e.ie.pe,i=e.ie.ye,o=e.ie.me;let c,f,a,l,u,w,h=0;for(l=0;15>=l;l++)t.be[l]=0;for(n[2*t.ae[t.fe]+1]=0,c=t.fe+1;573>c;c++)f=t.ae[c],l=n[2*n[2*f+1]+1]+1,l>o&&(l=o,h++),n[2*f+1]=l,f>e.he||(t.be[l]++,u=0,i>f||(u=s[f-i]),w=n[2*f],t.ue+=w*(l+u),r&&(t.we+=w*(r[2*f+1]+u)));if(0!==h){do{for(l=o-1;0===t.be[l];)l--;t.be[l]--,t.be[l+1]+=2,t.be[o]--,h-=2}while(h>0);for(l=o;0!==l;l--)for(f=t.be[l];0!==f;)a=t.ae[--c],a>e.he||(n[2*a+1]!=l&&(t.ue+=(l-n[2*a+1])*n[2*a],n[2*a+1]=l),f--)}})(n),((e,n,r)=>{const s=[];let i,o,c,f=0;for(i=1;15>=i;i++)s[i]=f=f+r[i-1]<<1;for(o=0;n>=o;o++)c=e[2*o+1],0!==c&&(e[2*o]=t(s[c]++,c))})(s,e.he,n.be)}}function Ke(e,t,n,r,s){const i=this;i.se=e,i.pe=t,i.ye=n,i.oe=r,i.me=s}Ue.ge=[0,1,2,3,4,5,6,7].concat(...Be([[2,8],[2,9],[2,10],[2,11],[4,12],[4,13],[4,14],[4,15],[8,16],[8,17],[8,18],[8,19],[16,20],[16,21],[16,22],[16,23],[32,24],[32,25],[32,26],[31,27],[1,28]])),Ue.ke=[0,1,2,3,4,5,6,7,8,10,12,14,16,20,24,28,32,40,48,56,64,80,96,112,128,160,192,224,0],Ue.ve=[0,1,2,3,4,6,8,12,16,24,32,48,64,96,128,192,256,384,512,768,1024,1536,2048,3072,4096,6144,8192,12288,16384,24576],Ue.Se=e=>256>e?Me[e]:Me[256+(e>>>7)],Ue.ze=[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],Ue.Ce=[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],Ue.xe=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7],Ue._e=[16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];const Ne=Be([[144,8],[112,9],[24,7],[8,8]]);Ke.Ae=Ee([12,140,76,204,44,172,108,236,28,156,92,220,60,188,124,252,2,130,66,194,34,162,98,226,18,146,82,210,50,178,114,242,10,138,74,202,42,170,106,234,26,154,90,218,58,186,122,250,6,134,70,198,38,166,102,230,22,150,86,214,54,182,118,246,14,142,78,206,46,174,110,238,30,158,94,222,62,190,126,254,1,129,65,193,33,161,97,225,17,145,81,209,49,177,113,241,9,137,73,201,41,169,105,233,25,153,89,217,57,185,121,249,5,133,69,197,37,165,101,229,21,149,85,213,53,181,117,245,13,141,77,205,45,173,109,237,29,157,93,221,61,189,125,253,19,275,147,403,83,339,211,467,51,307,179,435,115,371,243,499,11,267,139,395,75,331,203,459,43,299,171,427,107,363,235,491,27,283,155,411,91,347,219,475,59,315,187,443,123,379,251,507,7,263,135,391,71,327,199,455,39,295,167,423,103,359,231,487,23,279,151,407,87,343,215,471,55,311,183,439,119,375,247,503,15,271,143,399,79,335,207,463,47,303,175,431,111,367,239,495,31,287,159,415,95,351,223,479,63,319,191,447,127,383,255,511,0,64,32,96,16,80,48,112,8,72,40,104,24,88,56,120,4,68,36,100,20,84,52,116,3,131,67,195,35,163,99,227].map(((e,t)=>[e,Ne[t]])));const Oe=Be([[30,5]]);function Te(e,t,n,r,s){const i=this;i.Ie=e,i.De=t,i.Ve=n,i.Pe=r,i.Re=s}Ke.Be=Ee([0,16,8,24,4,20,12,28,2,18,10,26,6,22,14,30,1,17,9,25,5,21,13,29,3,19,11,27,7,23].map(((e,t)=>[e,Oe[t]]))),Ke.Ee=new Ke(Ke.Ae,Ue.ze,257,286,15),Ke.Me=new Ke(Ke.Be,Ue.Ce,0,30,15),Ke.Ue=new Ke(null,Ue.xe,0,19,7);const We=[new Te(0,0,0,0,0),new Te(4,4,8,4,1),new Te(4,5,16,8,1),new Te(4,6,32,32,1),new Te(4,4,16,16,2),new Te(8,16,32,32,2),new Te(8,16,128,128,2),new Te(8,32,128,256,2),new Te(32,128,258,1024,2),new Te(32,258,258,4096,2)],je=[\"need dictionary\",\"stream end\",\"\",\"\",\"stream error\",\"data error\",\"\",\"buffer error\",\"\",\"\"],He=113,Le=666,Fe=262;function qe(e,t,n,r){const s=e[2*t],i=e[2*n];return i>s||s==i&&r[t]<=r[n]}function Ge(){const e=this;let t,n,s,c,f,a,l,u,w,h,d,p,y,m,b,g,k,v,S,z,C,x,_,A,I,D,V,P,R,B,E,M,U;const K=new Ue,N=new Ue,O=new Ue;let T,W,j,H,L,F;function q(){let t;for(t=0;286>t;t++)E[2*t]=0;for(t=0;30>t;t++)M[2*t]=0;for(t=0;19>t;t++)U[2*t]=0;E[512]=1,e.ue=e.we=0,W=j=0}function G(e,t){let n,r=-1,s=e[1],i=0,o=7,c=4;0===s&&(o=138,c=3),e[2*(t+1)+1]=65535;for(let f=0;t>=f;f++)n=s,s=e[2*(f+1)+1],++ii?U[2*n]+=i:0!==n?(n!=r&&U[2*n]++,U[32]++):i>10?U[36]++:U[34]++,i=0,r=n,0===s?(o=138,c=3):n==s?(o=6,c=3):(o=7,c=4))}function J(t){e.Ke[e.pending++]=t}function Q(e){J(255&e),J(e>>>8&255)}function X(e,t){let n;const r=t;F>16-r?(n=e,L|=n<>>16-F,F+=r-16):(L|=e<=n;n++)if(r=i,i=e[2*(n+1)+1],++o>=c||r!=i){if(f>o)do{Y(r,U)}while(0!=--o);else 0!==r?(r!=s&&(Y(r,U),o--),Y(16,U),X(o-3,2)):o>10?(Y(18,U),X(o-11,7)):(Y(17,U),X(o-3,3));o=0,s=r,0===i?(c=138,f=3):r==i?(c=6,f=3):(c=7,f=4)}}function $(){16==F?(Q(L),L=0,F=0):8>F||(J(255&L),L>>>=8,F-=8)}function ee(t,n){let s,i,o;if(e.Ne[W]=t,e.Oe[W]=255&n,W++,0===t?E[2*n]++:(j++,t--,E[2*(Ue.ge[n]+256+1)]++,M[2*Ue.Se(t)]++),0==(8191&W)&&V>2){for(s=8*W,i=C-k,o=0;30>o;o++)s+=M[2*o]*(5+Ue.Ce[o]);if(s>>>=3,jc);Y(256,t),H=t[513]}function ne(){F>8?Q(L):F>0&&J(255&L),L=0,F=0}function re(t,n,r){X(0+(r?1:0),3),((t,n)=>{ne(),H=8,Q(n),Q(~n),e.Ke.set(u.subarray(t,t+n),e.pending),e.pending+=n})(t,n)}function se(n){((t,n,r)=>{let s,i,o=0;V>0?(K.ne(e),N.ne(e),o=(()=>{let t;for(G(E,K.he),G(M,N.he),O.ne(e),t=18;t>=3&&0===U[2*Ue._e[t]+1];t--);return e.ue+=14+3*(t+1),t})(),s=e.ue+3+7>>>3,i=e.we+3+7>>>3,i>s||(s=i)):s=i=n+5,n+4>s||-1==t?i==s?(X(2+(r?1:0),3),te(Ke.Ae,Ke.Be)):(X(4+(r?1:0),3),((e,t,n)=>{let r;for(X(e-257,5),X(t-1,5),X(n-4,4),r=0;n>r;r++)X(U[2*Ue._e[r]+1],3);Z(E,e-1),Z(M,t-1)})(K.he+1,N.he+1,o+1),te(E,M)):re(t,n,r),q(),r&&ne()})(0>k?-1:k,C-k,n),k=C,t.Te()}function ie(){let e,n,r,s;do{if(s=w-_-C,0===s&&0===C&&0===_)s=f;else if(-1==s)s--;else if(C>=f+f-Fe){u.set(u.subarray(f,f+f),0),x-=f,C-=f,k-=f,e=y,r=e;do{n=65535&d[--r],d[r]=f>n?0:n-f}while(0!=--e);e=f,r=e;do{n=65535&h[--r],h[r]=f>n?0:n-f}while(0!=--e);s+=f}if(0===t.We)return;e=t.je(u,C+_,s),_+=e,3>_||(p=255&u[C],p=(p<_&&0!==t.We)}function oe(e){let t,n,r=I,s=C,i=A;const o=C>f-Fe?C-(f-Fe):0;let c=B;const a=l,w=C+258;let d=u[s+i-1],p=u[s+i];R>A||(r>>=2),c>_&&(c=_);do{if(t=e,u[t+i]==p&&u[t+i-1]==d&&u[t]==u[s]&&u[++t]==u[s+1]){s+=2,t++;do{}while(u[++s]==u[++t]&&u[++s]==u[++t]&&u[++s]==u[++t]&&u[++s]==u[++t]&&u[++s]==u[++t]&&u[++s]==u[++t]&&u[++s]==u[++t]&&u[++s]==u[++t]&&w>s);if(n=258-(w-s),s=w-258,n>i){if(x=e,i=n,n>=c)break;d=u[s+i-1],p=u[s+i]}}}while((e=65535&h[e&a])>o&&0!=--r);return i>_?_:i}e.le=[],e.be=[],e.ae=[],E=[],M=[],U=[],e.de=(t,n)=>{const r=e.ae,s=r[n];let i=n<<1;for(;i<=e.ce&&(i(W||(W=8),j||(j=8),G||(G=0),t.Le=null,-1==S&&(S=6),1>j||j>9||8!=W||9>x||x>15||0>S||S>9||0>G||G>2?Re:(t.Fe=e,a=x,f=1<(t.qe=t.Ge=0,t.Le=null,e.pending=0,e.Je=0,n=He,c=0,K.re=E,K.ie=Ke.Ee,N.re=M,N.ie=Ke.Me,O.re=U,O.ie=Ke.Ue,L=0,F=0,H=8,q(),(()=>{w=2*f,d[y-1]=0;for(let e=0;y-1>e;e++)d[e]=0;D=We[V].De,R=We[V].Ie,B=We[V].Ve,I=We[V].Pe,C=0,k=0,_=0,v=A=2,z=0,p=0})(),0))(t))),e.Qe=()=>42!=n&&n!=He&&n!=Le?Re:(e.Oe=null,e.Ne=null,e.Ke=null,d=null,h=null,u=null,e.Fe=null,n==He?-3:0),e.Xe=(e,t,n)=>{let r=0;return-1==t&&(t=6),0>t||t>9||0>n||n>2?Re:(We[V].Re!=We[t].Re&&0!==e.qe&&(r=e.Ye(1)),V!=t&&(V=t,D=We[V].De,R=We[V].Ie,B=We[V].Ve,I=We[V].Pe),P=n,r)},e.Ze=(e,t,r)=>{let s,i=r,o=0;if(!t||42!=n)return Re;if(3>i)return 0;for(i>f-Fe&&(i=f-Fe,o=r-i),u.set(t.subarray(o,o+i),0),C=i,k=i,p=255&u[0],p=(p<=s;s++)p=(p<{let o,w,m,I,R;if(i>4||0>i)return Re;if(!r.$e||!r.et&&0!==r.We||n==Le&&4!=i)return r.Le=je[4],Re;if(0===r.tt)return r.Le=je[7],-5;var B;if(t=r,I=c,c=i,42==n&&(w=8+(a-8<<4)<<8,m=(V-1&255)>>1,m>3&&(m=3),w|=m<<6,0!==C&&(w|=32),w+=31-w%31,n=He,J((B=w)>>8&255),J(255&B)),0!==e.pending){if(t.Te(),0===t.tt)return c=-1,0}else if(0===t.We&&I>=i&&4!=i)return t.Le=je[7],-5;if(n==Le&&0!==t.We)return r.Le=je[7],-5;if(0!==t.We||0!==_||0!=i&&n!=Le){switch(R=-1,We[V].Re){case 0:R=(e=>{let n,r=65535;for(r>s-5&&(r=s-5);;){if(1>=_){if(ie(),0===_&&0==e)return 0;if(0===_)break}if(C+=_,_=0,n=k+r,(0===C||C>=n)&&(_=C-n,C=n,se(!1),0===t.tt))return 0;if(C-k>=f-Fe&&(se(!1),0===t.tt))return 0}return se(4==e),0===t.tt?4==e?2:0:4==e?3:1})(i);break;case 1:R=(e=>{let n,r=0;for(;;){if(Fe>_){if(ie(),Fe>_&&0==e)return 0;if(0===_)break}if(3>_||(p=(p<f-Fe||2!=P&&(v=oe(r)),3>v)n=ee(0,255&u[C]),_--,C++;else if(n=ee(C-x,v-3),_-=v,v>D||3>_)C+=v,v=0,p=255&u[C],p=(p<{let n,r,s=0;for(;;){if(Fe>_){if(ie(),Fe>_&&0==e)return 0;if(0===_)break}if(3>_||(p=(p<A&&f-Fe>=(C-s&65535)&&(2!=P&&(v=oe(s)),5>=v&&(1==P||3==v&&C-x>4096)&&(v=2)),3>A||v>A)if(0!==z){if(n=ee(0,255&u[C-1]),n&&se(!1),C++,_--,0===t.tt)return 0}else z=1,C++,_--;else{r=C+_-3,n=ee(C-1-S,A-3),_-=A-1,A-=2;do{++C>r||(p=(p<1+H+10-F&&(X(2,3),Y(256,Ke.Ae),$()),H=7;else if(re(0,0,!1),3==i)for(o=0;y>o;o++)d[o]=0;if(t.Te(),0===t.tt)return c=-1,0}}return 4!=i?0:1}}function Je(){const e=this;e.nt=0,e.rt=0,e.We=0,e.qe=0,e.tt=0,e.Ge=0}function Qe(e){const t=new Je,n=(o=e&&e.chunkSize?e.chunkSize:65536)+5*(r.floor(o/16383)+1);var o;const c=new i(n);let f=e?e.level:-1;void 0===f&&(f=-1),t.He(f),t.$e=c,this.append=(e,r)=>{let o,f,a=0,l=0,u=0;const w=[];if(e.length){t.nt=0,t.et=e,t.We=e.length;do{if(t.rt=0,t.tt=n,o=t.Ye(0),0!=o)throw new s(\"deflating: \"+t.Le);t.rt&&(t.rt==n?w.push(new i(c)):w.push(c.subarray(0,t.rt))),u+=t.rt,r&&t.nt>0&&t.nt!=a&&(r(t.nt),a=t.nt)}while(t.We>0||0===t.tt);return w.length>1?(f=new i(u),w.forEach((e=>{f.set(e,l),l+=e.length}))):f=w[0]?new i(w[0]):new i,f}},this.flush=()=>{let e,r,o=0,f=0;const a=[];do{if(t.rt=0,t.tt=n,e=t.Ye(4),1!=e&&0!=e)throw new s(\"deflating: \"+t.Le);n-t.tt>0&&a.push(c.slice(0,t.rt)),f+=t.rt}while(t.We>0||0===t.tt);return t.Qe(),r=new i(f),a.forEach((e=>{r.set(e,o),o+=e.length})),r}}Je.prototype={He(e,t){const n=this;return n.Fe=new Ge,t||(t=15),n.Fe.He(n,e,t)},Ye(e){const t=this;return t.Fe?t.Fe.Ye(t,e):Re},Qe(){const e=this;if(!e.Fe)return Re;const t=e.Fe.Qe();return e.Fe=null,t},Xe(e,t){const n=this;return n.Fe?n.Fe.Xe(n,e,t):Re},Ze(e,t){const n=this;return n.Fe?n.Fe.Ze(n,e,t):Re},je(e,t,n){const r=this;let s=r.We;return s>n&&(s=n),0===s?0:(r.We-=s,e.set(r.et.subarray(r.nt,r.nt+s),t),r.nt+=s,r.qe+=s,s)},Te(){const e=this;let t=e.Fe.pending;t>e.tt&&(t=e.tt),0!==t&&(e.$e.set(e.Fe.Ke.subarray(e.Fe.Je,e.Fe.Je+t),e.rt),e.rt+=t,e.Fe.Je+=t,e.Ge+=t,e.tt-=t,e.Fe.pending-=t,0===e.Fe.pending&&(e.Fe.Je=0))}};const Xe=-2,Ye=-3,Ze=-5,$e=[0,1,3,7,15,31,63,127,255,511,1023,2047,4095,8191,16383,32767,65535],et=[96,7,256,0,8,80,0,8,16,84,8,115,82,7,31,0,8,112,0,8,48,0,9,192,80,7,10,0,8,96,0,8,32,0,9,160,0,8,0,0,8,128,0,8,64,0,9,224,80,7,6,0,8,88,0,8,24,0,9,144,83,7,59,0,8,120,0,8,56,0,9,208,81,7,17,0,8,104,0,8,40,0,9,176,0,8,8,0,8,136,0,8,72,0,9,240,80,7,4,0,8,84,0,8,20,85,8,227,83,7,43,0,8,116,0,8,52,0,9,200,81,7,13,0,8,100,0,8,36,0,9,168,0,8,4,0,8,132,0,8,68,0,9,232,80,7,8,0,8,92,0,8,28,0,9,152,84,7,83,0,8,124,0,8,60,0,9,216,82,7,23,0,8,108,0,8,44,0,9,184,0,8,12,0,8,140,0,8,76,0,9,248,80,7,3,0,8,82,0,8,18,85,8,163,83,7,35,0,8,114,0,8,50,0,9,196,81,7,11,0,8,98,0,8,34,0,9,164,0,8,2,0,8,130,0,8,66,0,9,228,80,7,7,0,8,90,0,8,26,0,9,148,84,7,67,0,8,122,0,8,58,0,9,212,82,7,19,0,8,106,0,8,42,0,9,180,0,8,10,0,8,138,0,8,74,0,9,244,80,7,5,0,8,86,0,8,22,192,8,0,83,7,51,0,8,118,0,8,54,0,9,204,81,7,15,0,8,102,0,8,38,0,9,172,0,8,6,0,8,134,0,8,70,0,9,236,80,7,9,0,8,94,0,8,30,0,9,156,84,7,99,0,8,126,0,8,62,0,9,220,82,7,27,0,8,110,0,8,46,0,9,188,0,8,14,0,8,142,0,8,78,0,9,252,96,7,256,0,8,81,0,8,17,85,8,131,82,7,31,0,8,113,0,8,49,0,9,194,80,7,10,0,8,97,0,8,33,0,9,162,0,8,1,0,8,129,0,8,65,0,9,226,80,7,6,0,8,89,0,8,25,0,9,146,83,7,59,0,8,121,0,8,57,0,9,210,81,7,17,0,8,105,0,8,41,0,9,178,0,8,9,0,8,137,0,8,73,0,9,242,80,7,4,0,8,85,0,8,21,80,8,258,83,7,43,0,8,117,0,8,53,0,9,202,81,7,13,0,8,101,0,8,37,0,9,170,0,8,5,0,8,133,0,8,69,0,9,234,80,7,8,0,8,93,0,8,29,0,9,154,84,7,83,0,8,125,0,8,61,0,9,218,82,7,23,0,8,109,0,8,45,0,9,186,0,8,13,0,8,141,0,8,77,0,9,250,80,7,3,0,8,83,0,8,19,85,8,195,83,7,35,0,8,115,0,8,51,0,9,198,81,7,11,0,8,99,0,8,35,0,9,166,0,8,3,0,8,131,0,8,67,0,9,230,80,7,7,0,8,91,0,8,27,0,9,150,84,7,67,0,8,123,0,8,59,0,9,214,82,7,19,0,8,107,0,8,43,0,9,182,0,8,11,0,8,139,0,8,75,0,9,246,80,7,5,0,8,87,0,8,23,192,8,0,83,7,51,0,8,119,0,8,55,0,9,206,81,7,15,0,8,103,0,8,39,0,9,174,0,8,7,0,8,135,0,8,71,0,9,238,80,7,9,0,8,95,0,8,31,0,9,158,84,7,99,0,8,127,0,8,63,0,9,222,82,7,27,0,8,111,0,8,47,0,9,190,0,8,15,0,8,143,0,8,79,0,9,254,96,7,256,0,8,80,0,8,16,84,8,115,82,7,31,0,8,112,0,8,48,0,9,193,80,7,10,0,8,96,0,8,32,0,9,161,0,8,0,0,8,128,0,8,64,0,9,225,80,7,6,0,8,88,0,8,24,0,9,145,83,7,59,0,8,120,0,8,56,0,9,209,81,7,17,0,8,104,0,8,40,0,9,177,0,8,8,0,8,136,0,8,72,0,9,241,80,7,4,0,8,84,0,8,20,85,8,227,83,7,43,0,8,116,0,8,52,0,9,201,81,7,13,0,8,100,0,8,36,0,9,169,0,8,4,0,8,132,0,8,68,0,9,233,80,7,8,0,8,92,0,8,28,0,9,153,84,7,83,0,8,124,0,8,60,0,9,217,82,7,23,0,8,108,0,8,44,0,9,185,0,8,12,0,8,140,0,8,76,0,9,249,80,7,3,0,8,82,0,8,18,85,8,163,83,7,35,0,8,114,0,8,50,0,9,197,81,7,11,0,8,98,0,8,34,0,9,165,0,8,2,0,8,130,0,8,66,0,9,229,80,7,7,0,8,90,0,8,26,0,9,149,84,7,67,0,8,122,0,8,58,0,9,213,82,7,19,0,8,106,0,8,42,0,9,181,0,8,10,0,8,138,0,8,74,0,9,245,80,7,5,0,8,86,0,8,22,192,8,0,83,7,51,0,8,118,0,8,54,0,9,205,81,7,15,0,8,102,0,8,38,0,9,173,0,8,6,0,8,134,0,8,70,0,9,237,80,7,9,0,8,94,0,8,30,0,9,157,84,7,99,0,8,126,0,8,62,0,9,221,82,7,27,0,8,110,0,8,46,0,9,189,0,8,14,0,8,142,0,8,78,0,9,253,96,7,256,0,8,81,0,8,17,85,8,131,82,7,31,0,8,113,0,8,49,0,9,195,80,7,10,0,8,97,0,8,33,0,9,163,0,8,1,0,8,129,0,8,65,0,9,227,80,7,6,0,8,89,0,8,25,0,9,147,83,7,59,0,8,121,0,8,57,0,9,211,81,7,17,0,8,105,0,8,41,0,9,179,0,8,9,0,8,137,0,8,73,0,9,243,80,7,4,0,8,85,0,8,21,80,8,258,83,7,43,0,8,117,0,8,53,0,9,203,81,7,13,0,8,101,0,8,37,0,9,171,0,8,5,0,8,133,0,8,69,0,9,235,80,7,8,0,8,93,0,8,29,0,9,155,84,7,83,0,8,125,0,8,61,0,9,219,82,7,23,0,8,109,0,8,45,0,9,187,0,8,13,0,8,141,0,8,77,0,9,251,80,7,3,0,8,83,0,8,19,85,8,195,83,7,35,0,8,115,0,8,51,0,9,199,81,7,11,0,8,99,0,8,35,0,9,167,0,8,3,0,8,131,0,8,67,0,9,231,80,7,7,0,8,91,0,8,27,0,9,151,84,7,67,0,8,123,0,8,59,0,9,215,82,7,19,0,8,107,0,8,43,0,9,183,0,8,11,0,8,139,0,8,75,0,9,247,80,7,5,0,8,87,0,8,23,192,8,0,83,7,51,0,8,119,0,8,55,0,9,207,81,7,15,0,8,103,0,8,39,0,9,175,0,8,7,0,8,135,0,8,71,0,9,239,80,7,9,0,8,95,0,8,31,0,9,159,84,7,99,0,8,127,0,8,63,0,9,223,82,7,27,0,8,111,0,8,47,0,9,191,0,8,15,0,8,143,0,8,79,0,9,255],tt=[80,5,1,87,5,257,83,5,17,91,5,4097,81,5,5,89,5,1025,85,5,65,93,5,16385,80,5,3,88,5,513,84,5,33,92,5,8193,82,5,9,90,5,2049,86,5,129,192,5,24577,80,5,2,87,5,385,83,5,25,91,5,6145,81,5,7,89,5,1537,85,5,97,93,5,24577,80,5,4,88,5,769,84,5,49,92,5,12289,82,5,13,90,5,3073,86,5,193,192,5,24577],nt=[3,4,5,6,7,8,9,10,11,13,15,17,19,23,27,31,35,43,51,59,67,83,99,115,131,163,195,227,258,0,0],rt=[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,112,112],st=[1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577],it=[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];function ot(){let e,t,n,r,s,i;function o(e,t,o,c,f,a,l,u,w,h,d){let p,y,m,b,g,k,v,S,z,C,x,_,A,I,D;C=0,g=o;do{n[e[t+C]]++,C++,g--}while(0!==g);if(n[0]==o)return l[0]=-1,u[0]=0,0;for(S=u[0],k=1;15>=k&&0===n[k];k++);for(v=k,k>S&&(S=k),g=15;0!==g&&0===n[g];g--);for(m=g,S>g&&(S=g),u[0]=S,I=1<k;k++,I<<=1)if(0>(I-=n[k]))return Ye;if(0>(I-=n[g]))return Ye;for(n[g]+=I,i[1]=k=0,C=1,A=2;0!=--g;)i[A]=k+=n[C],A++,C++;g=0,C=0;do{0!==(k=e[t+C])&&(d[i[k]++]=g),C++}while(++g=v;v++)for(p=n[v];0!=p--;){for(;v>_+S;){if(b++,_+=S,D=m-_,D=D>S?S:D,(y=1<<(k=v-_))>p+1&&(y-=p+1,A=v,D>k))for(;++kn[++A];)y-=n[A];if(D=1<1440)return Ye;s[b]=x=h[0],h[0]+=D,0!==b?(i[b]=g,r[0]=k,r[1]=S,k=g>>>_-S,r[2]=x-s[b-1]-k,w.set(r,3*(s[b-1]+k))):l[0]=x}for(r[1]=v-_,o>C?d[C]d[C]?0:96,r[2]=d[C++]):(r[0]=a[d[C]-c]+16+64,r[2]=f[d[C++]-c]):r[0]=192,y=1<>>_;D>k;k+=y)w.set(r,3*(x+k));for(k=1<>>=1)g^=k;for(g^=k,z=(1<<_)-1;(g&z)!=i[b];)b--,_-=S,z=(1<<_)-1}return 0!==I&&1!=m?Ze:0}function c(o){let c;for(e||(e=[],t=[],n=new f(16),r=[],s=new f(15),i=new f(16)),t.lengthc;c++)t[c]=0;for(c=0;16>c;c++)n[c]=0;for(c=0;3>c;c++)r[c]=0;s.set(n.subarray(0,15),0),i.set(n.subarray(0,16),0)}this.st=(n,r,s,i,f)=>{let a;return c(19),e[0]=0,a=o(n,0,19,19,null,null,s,r,i,e,t),a==Ye?f.Le=\"oversubscribed dynamic bit lengths tree\":a!=Ze&&0!==r[0]||(f.Le=\"incomplete dynamic bit lengths tree\",a=Ye),a},this.it=(n,r,s,i,f,a,l,u,w)=>{let h;return c(288),e[0]=0,h=o(s,0,n,257,nt,rt,a,i,u,e,t),0!=h||0===i[0]?(h==Ye?w.Le=\"oversubscribed literal/length tree\":-4!=h&&(w.Le=\"incomplete literal/length tree\",h=Ye),h):(c(288),h=o(s,n,r,0,st,it,l,f,u,e,t),0!=h||0===f[0]&&n>257?(h==Ye?w.Le=\"oversubscribed distance tree\":h==Ze?(w.Le=\"incomplete distance tree\",h=Ye):-4!=h&&(w.Le=\"empty distance tree with lengths\",h=Ye),h):0)}}function ct(){const e=this;let t,n,r,s,i=0,o=0,c=0,f=0,a=0,l=0,u=0,w=0,h=0,d=0;function p(e,t,n,r,s,i,o,c){let f,a,l,u,w,h,d,p,y,m,b,g,k,v,S,z;d=c.nt,p=c.We,w=o.ot,h=o.ct,y=o.write,m=yh;)p--,w|=(255&c.ft(d++))<>=a[z+1],h-=a[z+1],0!=(16&u)){for(u&=15,k=a[z+2]+(w&$e[u]),w>>=u,h-=u;15>h;)p--,w|=(255&c.ft(d++))<>=a[z+1],h-=a[z+1],0!=(16&u)){for(u&=15;u>h;)p--,w|=(255&c.ft(d++))<>=u,h-=u,m-=k,v>y){S=y-v;do{S+=o.end}while(0>S);if(u=o.end-S,k>u){if(k-=u,y-S>0&&u>y-S)do{o.lt[y++]=o.lt[S++]}while(0!=--u);else o.lt.set(o.lt.subarray(S,S+u),y),y+=u,S+=u,u=0;S=0}}else S=y-v,y-S>0&&2>y-S?(o.lt[y++]=o.lt[S++],o.lt[y++]=o.lt[S++],k-=2):(o.lt.set(o.lt.subarray(S,S+2),y),y+=2,S+=2,k-=2);if(y-S>0&&k>y-S)do{o.lt[y++]=o.lt[S++]}while(0!=--k);else o.lt.set(o.lt.subarray(S,S+k),y),y+=k,S+=k,k=0;break}if(0!=(64&u))return c.Le=\"invalid distance code\",k=c.We-p,k=k>h>>3?h>>3:k,p+=k,d-=k,h-=k<<3,o.ot=w,o.ct=h,c.We=p,c.qe+=d-c.nt,c.nt=d,o.write=y,Ye;f+=a[z+2],f+=w&$e[u],z=3*(l+f),u=a[z]}break}if(0!=(64&u))return 0!=(32&u)?(k=c.We-p,k=k>h>>3?h>>3:k,p+=k,d-=k,h-=k<<3,o.ot=w,o.ct=h,c.We=p,c.qe+=d-c.nt,c.nt=d,o.write=y,1):(c.Le=\"invalid literal/length code\",k=c.We-p,k=k>h>>3?h>>3:k,p+=k,d-=k,h-=k<<3,o.ot=w,o.ct=h,c.We=p,c.qe+=d-c.nt,c.nt=d,o.write=y,Ye);if(f+=a[z+2],f+=w&$e[u],z=3*(l+f),0===(u=a[z])){w>>=a[z+1],h-=a[z+1],o.lt[y++]=a[z+2],m--;break}}else w>>=a[z+1],h-=a[z+1],o.lt[y++]=a[z+2],m--}while(m>=258&&p>=10);return k=c.We-p,k=k>h>>3?h>>3:k,p+=k,d-=k,h-=k<<3,o.ot=w,o.ct=h,c.We=p,c.qe+=d-c.nt,c.nt=d,o.write=y,0}e.init=(e,i,o,c,f,a)=>{t=0,u=e,w=i,r=o,h=c,s=f,d=a,n=null},e.ut=(e,y,m)=>{let b,g,k,v,S,z,C,x=0,_=0,A=0;for(A=y.nt,v=y.We,x=e.ot,_=e.ct,S=e.write,z=S=258&&v>=10&&(e.ot=x,e.ct=_,y.We=v,y.qe+=A-y.nt,y.nt=A,e.write=S,m=p(u,w,r,h,s,d,e,y),A=y.nt,v=y.We,x=e.ot,_=e.ct,S=e.write,z=S_;){if(0===v)return e.ot=x,e.ct=_,y.We=v,y.qe+=A-y.nt,y.nt=A,e.write=S,e.wt(y,m);m=0,v--,x|=(255&y.ft(A++))<<_,_+=8}if(g=3*(o+(x&$e[b])),x>>>=n[g+1],_-=n[g+1],k=n[g],0===k){f=n[g+2],t=6;break}if(0!=(16&k)){a=15&k,i=n[g+2],t=2;break}if(0==(64&k)){c=k,o=g/3+n[g+2];break}if(0!=(32&k)){t=7;break}return t=9,y.Le=\"invalid literal/length code\",m=Ye,e.ot=x,e.ct=_,y.We=v,y.qe+=A-y.nt,y.nt=A,e.write=S,e.wt(y,m);case 2:for(b=a;b>_;){if(0===v)return e.ot=x,e.ct=_,y.We=v,y.qe+=A-y.nt,y.nt=A,e.write=S,e.wt(y,m);m=0,v--,x|=(255&y.ft(A++))<<_,_+=8}i+=x&$e[b],x>>=b,_-=b,c=w,n=s,o=d,t=3;case 3:for(b=c;b>_;){if(0===v)return e.ot=x,e.ct=_,y.We=v,y.qe+=A-y.nt,y.nt=A,e.write=S,e.wt(y,m);m=0,v--,x|=(255&y.ft(A++))<<_,_+=8}if(g=3*(o+(x&$e[b])),x>>=n[g+1],_-=n[g+1],k=n[g],0!=(16&k)){a=15&k,l=n[g+2],t=4;break}if(0==(64&k)){c=k,o=g/3+n[g+2];break}return t=9,y.Le=\"invalid distance code\",m=Ye,e.ot=x,e.ct=_,y.We=v,y.qe+=A-y.nt,y.nt=A,e.write=S,e.wt(y,m);case 4:for(b=a;b>_;){if(0===v)return e.ot=x,e.ct=_,y.We=v,y.qe+=A-y.nt,y.nt=A,e.write=S,e.wt(y,m);m=0,v--,x|=(255&y.ft(A++))<<_,_+=8}l+=x&$e[b],x>>=b,_-=b,t=5;case 5:for(C=S-l;0>C;)C+=e.end;for(;0!==i;){if(0===z&&(S==e.end&&0!==e.read&&(S=0,z=S7&&(_-=8,v++,A--),e.write=S,m=e.wt(y,m),S=e.write,z=S{}}ot.dt=(e,t,n,r)=>(e[0]=9,t[0]=5,n[0]=et,r[0]=tt,0);const ft=[16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];function at(e,t){const n=this;let r,s=0,o=0,c=0,a=0;const l=[0],u=[0],w=new ct;let h=0,d=new f(4320);const p=new ot;n.ct=0,n.ot=0,n.lt=new i(t),n.end=t,n.read=0,n.write=0,n.reset=(e,t)=>{t&&(t[0]=0),6==s&&w.ht(e),s=0,n.ct=0,n.ot=0,n.read=n.write=0},n.reset(e,null),n.wt=(e,t)=>{let r,s,i;return s=e.rt,i=n.read,r=(i>n.write?n.end:n.write)-i,r>e.tt&&(r=e.tt),0!==r&&t==Ze&&(t=0),e.tt-=r,e.Ge+=r,e.$e.set(n.lt.subarray(i,i+r),s),s+=r,i+=r,i==n.end&&(i=0,n.write==n.end&&(n.write=0),r=n.write-i,r>e.tt&&(r=e.tt),0!==r&&t==Ze&&(t=0),e.tt-=r,e.Ge+=r,e.$e.set(n.lt.subarray(i,i+r),s),s+=r,i+=r),e.rt=s,n.read=i,t},n.ut=(e,t)=>{let i,f,y,m,b,g,k,v;for(m=e.nt,b=e.We,f=n.ot,y=n.ct,g=n.write,k=gy;){if(0===b)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);t=0,b--,f|=(255&e.ft(m++))<>>1){case 0:f>>>=3,y-=3,i=7&y,f>>>=i,y-=i,s=1;break;case 1:S=[],z=[],C=[[]],x=[[]],ot.dt(S,z,C,x),w.init(S[0],z[0],C[0],0,x[0],0),f>>>=3,y-=3,s=6;break;case 2:f>>>=3,y-=3,s=3;break;case 3:return f>>>=3,y-=3,s=9,e.Le=\"invalid block type\",t=Ye,n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t)}break;case 1:for(;32>y;){if(0===b)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);t=0,b--,f|=(255&e.ft(m++))<>>16&65535)!=(65535&f))return s=9,e.Le=\"invalid stored block lengths\",t=Ye,n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);o=65535&f,f=y=0,s=0!==o?2:0!==h?7:0;break;case 2:if(0===b)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);if(0===k&&(g==n.end&&0!==n.read&&(g=0,k=gb&&(i=b),i>k&&(i=k),n.lt.set(e.je(m,i),g),m+=i,b-=i,g+=i,k-=i,0!=(o-=i))break;s=0!==h?7:0;break;case 3:for(;14>y;){if(0===b)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);t=0,b--,f|=(255&e.ft(m++))<29||(i>>5&31)>29)return s=9,e.Le=\"too many length or distance symbols\",t=Ye,n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);if(i=258+(31&i)+(i>>5&31),!r||r.lengthv;v++)r[v]=0;f>>>=14,y-=14,a=0,s=4;case 4:for(;4+(c>>>10)>a;){for(;3>y;){if(0===b)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);t=0,b--,f|=(255&e.ft(m++))<>>=3,y-=3}for(;19>a;)r[ft[a++]]=0;if(l[0]=7,i=p.st(r,l,u,d,e),0!=i)return(t=i)==Ye&&(r=null,s=9),n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);a=0,s=5;case 5:for(;i=c,258+(31&i)+(i>>5&31)>a;){let o,w;for(i=l[0];i>y;){if(0===b)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);t=0,b--,f|=(255&e.ft(m++))<w)f>>>=i,y-=i,r[a++]=w;else{for(v=18==w?7:w-14,o=18==w?11:3;i+v>y;){if(0===b)return n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);t=0,b--,f|=(255&e.ft(m++))<>>=i,y-=i,o+=f&$e[v],f>>>=v,y-=v,v=a,i=c,v+o>258+(31&i)+(i>>5&31)||16==w&&1>v)return r=null,s=9,e.Le=\"invalid bit length repeat\",t=Ye,n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);w=16==w?r[v-1]:0;do{r[v++]=w}while(0!=--o);a=v}}if(u[0]=-1,_=[],A=[],I=[],D=[],_[0]=9,A[0]=6,i=c,i=p.it(257+(31&i),1+(i>>5&31),r,_,A,I,D,d,e),0!=i)return i==Ye&&(r=null,s=9),t=i,n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,n.wt(e,t);w.init(_[0],A[0],d,I[0],d,D[0]),s=6;case 6:if(n.ot=f,n.ct=y,e.We=b,e.qe+=m-e.nt,e.nt=m,n.write=g,1!=(t=w.ut(n,e,t)))return n.wt(e,t);if(t=0,w.ht(e),m=e.nt,b=e.We,f=n.ot,y=n.ct,g=n.write,k=g{n.reset(e,null),n.lt=null,d=null},n.yt=(e,t,r)=>{n.lt.set(e.subarray(t,t+r),0),n.read=n.write=r},n.bt=()=>1==s?1:0}const lt=13,ut=[0,0,255,255];function wt(){const e=this;function t(e){return e&&e.gt?(e.qe=e.Ge=0,e.Le=null,e.gt.mode=7,e.gt.kt.reset(e,null),0):Xe}e.mode=0,e.method=0,e.vt=[0],e.St=0,e.marker=0,e.zt=0,e.Ct=t=>(e.kt&&e.kt.ht(t),e.kt=null,0),e.xt=(n,r)=>(n.Le=null,e.kt=null,8>r||r>15?(e.Ct(n),Xe):(e.zt=r,n.gt.kt=new at(n,1<{let n,r;if(!e||!e.gt||!e.et)return Xe;const s=e.gt;for(t=4==t?Ze:0,n=Ze;;)switch(s.mode){case 0:if(0===e.We)return n;if(n=t,e.We--,e.qe++,8!=(15&(s.method=e.ft(e.nt++)))){s.mode=lt,e.Le=\"unknown compression method\",s.marker=5;break}if(8+(s.method>>4)>s.zt){s.mode=lt,e.Le=\"invalid win size\",s.marker=5;break}s.mode=1;case 1:if(0===e.We)return n;if(n=t,e.We--,e.qe++,r=255&e.ft(e.nt++),((s.method<<8)+r)%31!=0){s.mode=lt,e.Le=\"incorrect header check\",s.marker=5;break}if(0==(32&r)){s.mode=7;break}s.mode=2;case 2:if(0===e.We)return n;n=t,e.We--,e.qe++,s.St=(255&e.ft(e.nt++))<<24&4278190080,s.mode=3;case 3:if(0===e.We)return n;n=t,e.We--,e.qe++,s.St+=(255&e.ft(e.nt++))<<16&16711680,s.mode=4;case 4:if(0===e.We)return n;n=t,e.We--,e.qe++,s.St+=(255&e.ft(e.nt++))<<8&65280,s.mode=5;case 5:return 0===e.We?n:(n=t,e.We--,e.qe++,s.St+=255&e.ft(e.nt++),s.mode=6,2);case 6:return s.mode=lt,e.Le=\"need dictionary\",s.marker=0,Xe;case 7:if(n=s.kt.ut(e,n),n==Ye){s.mode=lt,s.marker=0;break}if(0==n&&(n=t),1!=n)return n;n=t,s.kt.reset(e,s.vt),s.mode=12;case 12:return e.We=0,1;case lt:return Ye;default:return Xe}},e.At=(e,t,n)=>{let r=0,s=n;if(!e||!e.gt||6!=e.gt.mode)return Xe;const i=e.gt;return s<1<{let n,r,s,i,o;if(!e||!e.gt)return Xe;const c=e.gt;if(c.mode!=lt&&(c.mode=lt,c.marker=0),0===(n=e.We))return Ze;for(r=e.nt,s=c.marker;0!==n&&4>s;)e.ft(r)==ut[s]?s++:s=0!==e.ft(r)?0:4-s,r++,n--;return e.qe+=r-e.nt,e.nt=r,e.We=n,c.marker=s,4!=s?Ye:(i=e.qe,o=e.Ge,t(e),e.qe=i,e.Ge=o,c.mode=7,0)},e.Dt=e=>e&&e.gt&&e.gt.kt?e.gt.kt.bt():Xe}function ht(){}function dt(e){const t=new ht,n=e&&e.chunkSize?r.floor(2*e.chunkSize):131072,o=new i(n);let c=!1;t.xt(),t.$e=o,this.append=(e,r)=>{const f=[];let a,l,u=0,w=0,h=0;if(0!==e.length){t.nt=0,t.et=e,t.We=e.length;do{if(t.rt=0,t.tt=n,0!==t.We||c||(t.nt=0,c=!0),a=t._t(0),c&&a===Ze){if(0!==t.We)throw new s(\"inflating: bad input\")}else if(0!==a&&1!==a)throw new s(\"inflating: \"+t.Le);if((c||1===a)&&t.We===e.length)throw new s(\"inflating: bad input\");t.rt&&(t.rt===n?f.push(new i(o)):f.push(o.subarray(0,t.rt))),h+=t.rt,r&&t.nt>0&&t.nt!=u&&(r(t.nt),u=t.nt)}while(t.We>0||0===t.tt);return f.length>1?(l=new i(h),f.forEach((e=>{l.set(e,w),w+=e.length}))):l=f[0]?new i(f[0]):new i,l}},this.flush=()=>{t.Ct()}}ht.prototype={xt(e){const t=this;return t.gt=new wt,e||(e=15),t.gt.xt(t,e)},_t(e){const t=this;return t.gt?t.gt._t(t,e):Xe},Ct(){const e=this;if(!e.gt)return Xe;const t=e.gt.Ct(e);return e.gt=null,t},It(){const e=this;return e.gt?e.gt.It(e):Xe},At(e,t){const n=this;return n.gt?n.gt.At(n,e,t):Xe},ft(e){return this.et[e]},je(e,t){return this.et.subarray(e,e+t)}},self.initCodec=()=>{self.Deflate=Qe,self.Inflate=dt};\\n'],{type:\"text/javascript\"}));e({workerScripts:{inflate:[t],deflate:[t]}})}export{e as configureWebWorker};\n", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global Blob, atob, btoa, XMLHttpRequest, URL, fetch, ReadableStream, WritableStream, FileReader, TransformStream, Response */\n// deno-lint-ignore-file no-this-alias\n\nimport {\n\tUNDEFINED_VALUE,\n\tFUNCTION_TYPE\n} from \"./constants.js\";\nimport { getConfiguration } from \"./configuration.js\";\n\nconst ERR_HTTP_STATUS = \"HTTP error \";\nconst ERR_HTTP_RANGE = \"HTTP Range not supported\";\nconst ERR_ITERATOR_COMPLETED_TOO_SOON = \"Writer iterator completed too soon\";\n\nconst CONTENT_TYPE_TEXT_PLAIN = \"text/plain\";\nconst HTTP_HEADER_CONTENT_LENGTH = \"Content-Length\";\nconst HTTP_HEADER_CONTENT_RANGE = \"Content-Range\";\nconst HTTP_HEADER_ACCEPT_RANGES = \"Accept-Ranges\";\nconst HTTP_HEADER_RANGE = \"Range\";\nconst HTTP_HEADER_CONTENT_TYPE = \"Content-Type\";\nconst HTTP_METHOD_HEAD = \"HEAD\";\nconst HTTP_METHOD_GET = \"GET\";\nconst HTTP_RANGE_UNIT = \"bytes\";\nconst DEFAULT_CHUNK_SIZE = 64 * 1024;\n\nconst PROPERTY_NAME_WRITABLE = \"writable\";\n\nclass Stream {\n\n\tconstructor() {\n\t\tthis.size = 0;\n\t}\n\n\tinit() {\n\t\tthis.initialized = true;\n\t}\n}\n\nclass Reader extends Stream {\n\n\tget readable() {\n\t\tconst reader = this;\n\t\tconst { chunkSize = DEFAULT_CHUNK_SIZE } = reader;\n\t\tconst readable = new ReadableStream({\n\t\t\tstart() {\n\t\t\t\tthis.chunkOffset = 0;\n\t\t\t},\n\t\t\tasync pull(controller) {\n\t\t\t\tconst { offset = 0, size, diskNumberStart } = readable;\n\t\t\t\tconst { chunkOffset } = this;\n\t\t\t\tcontroller.enqueue(await readUint8Array(reader, offset + chunkOffset, Math.min(chunkSize, size - chunkOffset), diskNumberStart));\n\t\t\t\tif (chunkOffset + chunkSize > size) {\n\t\t\t\t\tcontroller.close();\n\t\t\t\t} else {\n\t\t\t\t\tthis.chunkOffset += chunkSize;\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\treturn readable;\n\t}\n}\n\nclass Writer extends Stream {\n\n\tconstructor() {\n\t\tsuper();\n\t\tconst writer = this;\n\t\tconst writable = new WritableStream({\n\t\t\twrite(chunk) {\n\t\t\t\treturn writer.writeUint8Array(chunk);\n\t\t\t}\n\t\t});\n\t\tObject.defineProperty(writer, PROPERTY_NAME_WRITABLE, {\n\t\t\tget() {\n\t\t\t\treturn writable;\n\t\t\t}\n\t\t});\n\t}\n\n\twriteUint8Array() {\n\t\t// abstract\n\t}\n}\n\nclass Data64URIReader extends Reader {\n\n\tconstructor(dataURI) {\n\t\tsuper();\n\t\tlet dataEnd = dataURI.length;\n\t\twhile (dataURI.charAt(dataEnd - 1) == \"=\") {\n\t\t\tdataEnd--;\n\t\t}\n\t\tconst dataStart = dataURI.indexOf(\",\") + 1;\n\t\tObject.assign(this, {\n\t\t\tdataURI,\n\t\t\tdataStart,\n\t\t\tsize: Math.floor((dataEnd - dataStart) * 0.75)\n\t\t});\n\t}\n\n\treadUint8Array(offset, length) {\n\t\tconst {\n\t\t\tdataStart,\n\t\t\tdataURI\n\t\t} = this;\n\t\tconst dataArray = new Uint8Array(length);\n\t\tconst start = Math.floor(offset / 3) * 4;\n\t\tconst bytes = atob(dataURI.substring(start + dataStart, Math.ceil((offset + length) / 3) * 4 + dataStart));\n\t\tconst delta = offset - Math.floor(start / 4) * 3;\n\t\tfor (let indexByte = delta; indexByte < delta + length; indexByte++) {\n\t\t\tdataArray[indexByte - delta] = bytes.charCodeAt(indexByte);\n\t\t}\n\t\treturn dataArray;\n\t}\n}\n\nclass Data64URIWriter extends Writer {\n\n\tconstructor(contentType) {\n\t\tsuper();\n\t\tObject.assign(this, {\n\t\t\tdata: \"data:\" + (contentType || \"\") + \";base64,\",\n\t\t\tpending: []\n\t\t});\n\t}\n\n\twriteUint8Array(array) {\n\t\tconst writer = this;\n\t\tlet indexArray = 0;\n\t\tlet dataString = writer.pending;\n\t\tconst delta = writer.pending.length;\n\t\twriter.pending = \"\";\n\t\tfor (indexArray = 0; indexArray < (Math.floor((delta + array.length) / 3) * 3) - delta; indexArray++) {\n\t\t\tdataString += String.fromCharCode(array[indexArray]);\n\t\t}\n\t\tfor (; indexArray < array.length; indexArray++) {\n\t\t\twriter.pending += String.fromCharCode(array[indexArray]);\n\t\t}\n\t\tif (dataString.length > 2) {\n\t\t\twriter.data += btoa(dataString);\n\t\t} else {\n\t\t\twriter.pending = dataString;\n\t\t}\n\t}\n\n\tgetData() {\n\t\treturn this.data + btoa(this.pending);\n\t}\n}\n\nclass BlobReader extends Reader {\n\n\tconstructor(blob) {\n\t\tsuper();\n\t\tObject.assign(this, {\n\t\t\tblob,\n\t\t\tsize: blob.size\n\t\t});\n\t}\n\n\tasync readUint8Array(offset, length) {\n\t\tconst reader = this;\n\t\tconst offsetEnd = offset + length;\n\t\tconst blob = offset || offsetEnd < reader.size ? reader.blob.slice(offset, offsetEnd) : reader.blob;\n\t\tlet arrayBuffer = await blob.arrayBuffer();\n\t\tif (arrayBuffer.byteLength > length) {\n\t\t\tarrayBuffer = arrayBuffer.slice(offset, offsetEnd);\n\t\t}\n\t\treturn new Uint8Array(arrayBuffer);\n\t}\n}\n\nclass BlobWriter extends Stream {\n\n\tconstructor(contentType) {\n\t\tsuper();\n\t\tconst writer = this;\n\t\tconst transformStream = new TransformStream();\n\t\tconst headers = [];\n\t\tif (contentType) {\n\t\t\theaders.push([HTTP_HEADER_CONTENT_TYPE, contentType]);\n\t\t}\n\t\tObject.defineProperty(writer, PROPERTY_NAME_WRITABLE, {\n\t\t\tget() {\n\t\t\t\treturn transformStream.writable;\n\t\t\t}\n\t\t});\n\t\twriter.blob = new Response(transformStream.readable, { headers }).blob();\n\t}\n\n\tgetData() {\n\t\treturn this.blob;\n\t}\n}\n\nclass TextReader extends BlobReader {\n\n\tconstructor(text) {\n\t\tsuper(new Blob([text], { type: CONTENT_TYPE_TEXT_PLAIN }));\n\t}\n}\n\nclass TextWriter extends BlobWriter {\n\n\tconstructor(encoding) {\n\t\tsuper(encoding);\n\t\tObject.assign(this, {\n\t\t\tencoding,\n\t\t\tutf8: !encoding || encoding.toLowerCase() == \"utf-8\"\n\t\t});\n\t}\n\n\tasync getData() {\n\t\tconst {\n\t\t\tencoding,\n\t\t\tutf8\n\t\t} = this;\n\t\tconst blob = await super.getData();\n\t\tif (blob.text && utf8) {\n\t\t\treturn blob.text();\n\t\t} else {\n\t\t\tconst reader = new FileReader();\n\t\t\treturn new Promise((resolve, reject) => {\n\t\t\t\tObject.assign(reader, {\n\t\t\t\t\tonload: ({ target }) => resolve(target.result),\n\t\t\t\t\tonerror: () => reject(reader.error)\n\t\t\t\t});\n\t\t\t\treader.readAsText(blob, encoding);\n\t\t\t});\n\t\t}\n\t}\n}\n\nclass FetchReader extends Reader {\n\n\tconstructor(url, options) {\n\t\tsuper();\n\t\tcreateHtpReader(this, url, options);\n\t}\n\n\tasync init() {\n\t\tawait initHttpReader(this, sendFetchRequest, getFetchRequestData);\n\t\tsuper.init();\n\t}\n\n\treadUint8Array(index, length) {\n\t\treturn readUint8ArrayHttpReader(this, index, length, sendFetchRequest, getFetchRequestData);\n\t}\n}\n\nclass XHRReader extends Reader {\n\n\tconstructor(url, options) {\n\t\tsuper();\n\t\tcreateHtpReader(this, url, options);\n\t}\n\n\tasync init() {\n\t\tawait initHttpReader(this, sendXMLHttpRequest, getXMLHttpRequestData);\n\t\tsuper.init();\n\t}\n\n\treadUint8Array(index, length) {\n\t\treturn readUint8ArrayHttpReader(this, index, length, sendXMLHttpRequest, getXMLHttpRequestData);\n\t}\n}\n\nfunction createHtpReader(httpReader, url, options) {\n\tconst {\n\t\tpreventHeadRequest,\n\t\tuseRangeHeader,\n\t\tforceRangeRequests\n\t} = options;\n\toptions = Object.assign({}, options);\n\tdelete options.preventHeadRequest;\n\tdelete options.useRangeHeader;\n\tdelete options.forceRangeRequests;\n\tdelete options.useXHR;\n\tObject.assign(httpReader, {\n\t\turl,\n\t\toptions,\n\t\tpreventHeadRequest,\n\t\tuseRangeHeader,\n\t\tforceRangeRequests\n\t});\n}\n\nasync function initHttpReader(httpReader, sendRequest, getRequestData) {\n\tconst {\n\t\turl,\n\t\tuseRangeHeader,\n\t\tforceRangeRequests\n\t} = httpReader;\n\tif (isHttpFamily(url) && (useRangeHeader || forceRangeRequests)) {\n\t\tconst { headers } = await sendRequest(HTTP_METHOD_GET, httpReader, getRangeHeaders(httpReader));\n\t\tif (!forceRangeRequests && headers.get(HTTP_HEADER_ACCEPT_RANGES) != HTTP_RANGE_UNIT) {\n\t\t\tthrow new Error(ERR_HTTP_RANGE);\n\t\t} else {\n\t\t\tlet contentSize;\n\t\t\tconst contentRangeHeader = headers.get(HTTP_HEADER_CONTENT_RANGE);\n\t\t\tif (contentRangeHeader) {\n\t\t\t\tconst splitHeader = contentRangeHeader.trim().split(/\\s*\\/\\s*/);\n\t\t\t\tif (splitHeader.length) {\n\t\t\t\t\tconst headerValue = splitHeader[1];\n\t\t\t\t\tif (headerValue && headerValue != \"*\") {\n\t\t\t\t\t\tcontentSize = Number(headerValue);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (contentSize === UNDEFINED_VALUE) {\n\t\t\t\tawait getContentLength(httpReader, sendRequest, getRequestData);\n\t\t\t} else {\n\t\t\t\thttpReader.size = contentSize;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tawait getContentLength(httpReader, sendRequest, getRequestData);\n\t}\n}\n\nasync function readUint8ArrayHttpReader(httpReader, index, length, sendRequest, getRequestData) {\n\tconst {\n\t\tuseRangeHeader,\n\t\tforceRangeRequests,\n\t\toptions\n\t} = httpReader;\n\tif (useRangeHeader || forceRangeRequests) {\n\t\tconst response = await sendRequest(HTTP_METHOD_GET, httpReader, getRangeHeaders(httpReader, index, length));\n\t\tif (response.status != 206) {\n\t\t\tthrow new Error(ERR_HTTP_RANGE);\n\t\t}\n\t\treturn new Uint8Array(await response.arrayBuffer());\n\t} else {\n\t\tconst { data } = httpReader;\n\t\tif (!data) {\n\t\t\tawait getRequestData(httpReader, options);\n\t\t}\n\t\treturn new Uint8Array(httpReader.data.subarray(index, index + length));\n\t}\n}\n\nfunction getRangeHeaders(httpReader, index = 0, length = 1) {\n\treturn Object.assign({}, getHeaders(httpReader), { [HTTP_HEADER_RANGE]: HTTP_RANGE_UNIT + \"=\" + index + \"-\" + (index + length - 1) });\n}\n\nfunction getHeaders({ options }) {\n\tconst { headers } = options;\n\tif (headers) {\n\t\tif (Symbol.iterator in headers) {\n\t\t\treturn Object.fromEntries(headers);\n\t\t} else {\n\t\t\treturn headers;\n\t\t}\n\t}\n}\n\nasync function getFetchRequestData(httpReader) {\n\tawait getRequestData(httpReader, sendFetchRequest);\n}\n\nasync function getXMLHttpRequestData(httpReader) {\n\tawait getRequestData(httpReader, sendXMLHttpRequest);\n}\n\nasync function getRequestData(httpReader, sendRequest) {\n\tconst response = await sendRequest(HTTP_METHOD_GET, httpReader, getHeaders(httpReader));\n\thttpReader.data = new Uint8Array(await response.arrayBuffer());\n\tif (!httpReader.size) {\n\t\thttpReader.size = httpReader.data.length;\n\t}\n}\n\nasync function getContentLength(httpReader, sendRequest, getRequestData) {\n\tif (httpReader.preventHeadRequest) {\n\t\tawait getRequestData(httpReader, httpReader.options);\n\t} else {\n\t\tconst response = await sendRequest(HTTP_METHOD_HEAD, httpReader, getHeaders(httpReader));\n\t\tconst contentLength = response.headers.get(HTTP_HEADER_CONTENT_LENGTH);\n\t\tif (contentLength) {\n\t\t\thttpReader.size = Number(contentLength);\n\t\t} else {\n\t\t\tawait getRequestData(httpReader, httpReader.options);\n\t\t}\n\t}\n}\n\nasync function sendFetchRequest(method, { options, url }, headers) {\n\tconst response = await fetch(url, Object.assign({}, options, { method, headers }));\n\tif (response.status < 400) {\n\t\treturn response;\n\t} else {\n\t\tthrow response.status == 416 ? new Error(ERR_HTTP_RANGE) : new Error(ERR_HTTP_STATUS + (response.statusText || response.status));\n\t}\n}\n\nfunction sendXMLHttpRequest(method, { url }, headers) {\n\treturn new Promise((resolve, reject) => {\n\t\tconst request = new XMLHttpRequest();\n\t\trequest.addEventListener(\"load\", () => {\n\t\t\tif (request.status < 400) {\n\t\t\t\tconst headers = [];\n\t\t\t\trequest.getAllResponseHeaders().trim().split(/[\\r\\n]+/).forEach(header => {\n\t\t\t\t\tconst splitHeader = header.trim().split(/\\s*:\\s*/);\n\t\t\t\t\tsplitHeader[0] = splitHeader[0].trim().replace(/^[a-z]|-[a-z]/g, value => value.toUpperCase());\n\t\t\t\t\theaders.push(splitHeader);\n\t\t\t\t});\n\t\t\t\tresolve({\n\t\t\t\t\tstatus: request.status,\n\t\t\t\t\tarrayBuffer: () => request.response,\n\t\t\t\t\theaders: new Map(headers)\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\treject(request.status == 416 ? new Error(ERR_HTTP_RANGE) : new Error(ERR_HTTP_STATUS + (request.statusText || request.status)));\n\t\t\t}\n\t\t}, false);\n\t\trequest.addEventListener(\"error\", event => reject(event.detail ? event.detail.error : new Error(\"Network error\")), false);\n\t\trequest.open(method, url);\n\t\tif (headers) {\n\t\t\tfor (const entry of Object.entries(headers)) {\n\t\t\t\trequest.setRequestHeader(entry[0], entry[1]);\n\t\t\t}\n\t\t}\n\t\trequest.responseType = \"arraybuffer\";\n\t\trequest.send();\n\t});\n}\n\nclass HttpReader extends Reader {\n\n\tconstructor(url, options = {}) {\n\t\tsuper();\n\t\tObject.assign(this, {\n\t\t\turl,\n\t\t\treader: options.useXHR ? new XHRReader(url, options) : new FetchReader(url, options)\n\t\t});\n\t}\n\n\tset size(value) {\n\t\t// ignored\n\t}\n\n\tget size() {\n\t\treturn this.reader.size;\n\t}\n\n\tasync init() {\n\t\tawait this.reader.init();\n\t\tsuper.init();\n\t}\n\n\treadUint8Array(index, length) {\n\t\treturn this.reader.readUint8Array(index, length);\n\t}\n}\n\nclass HttpRangeReader extends HttpReader {\n\n\tconstructor(url, options = {}) {\n\t\toptions.useRangeHeader = true;\n\t\tsuper(url, options);\n\t}\n}\n\n\nclass Uint8ArrayReader extends Reader {\n\n\tconstructor(array) {\n\t\tsuper();\n\t\tObject.assign(this, {\n\t\t\tarray,\n\t\t\tsize: array.length\n\t\t});\n\t}\n\n\treadUint8Array(index, length) {\n\t\treturn this.array.slice(index, index + length);\n\t}\n}\n\nclass Uint8ArrayWriter extends Writer {\n\n\tinit(initSize = 0) {\n\t\tObject.assign(this, {\n\t\t\toffset: 0,\n\t\t\tarray: new Uint8Array(initSize)\n\t\t});\n\t\tsuper.init();\n\t}\n\n\twriteUint8Array(array) {\n\t\tconst writer = this;\n\t\tif (writer.offset + array.length > writer.array.length) {\n\t\t\tconst previousArray = writer.array;\n\t\t\twriter.array = new Uint8Array(previousArray.length + array.length);\n\t\t\twriter.array.set(previousArray);\n\t\t}\n\t\twriter.array.set(array, writer.offset);\n\t\twriter.offset += array.length;\n\t}\n\n\tgetData() {\n\t\treturn this.array;\n\t}\n}\n\nclass SplitDataReader extends Reader {\n\n\tconstructor(readers) {\n\t\tsuper();\n\t\tthis.readers = readers;\n\t}\n\n\tasync init() {\n\t\tconst reader = this;\n\t\tconst { readers } = reader;\n\t\treader.lastDiskNumber = 0;\n\t\treader.lastDiskOffset = 0;\n\t\tawait Promise.all(readers.map(async (diskReader, indexDiskReader) => {\n\t\t\tawait diskReader.init();\n\t\t\tif (indexDiskReader != readers.length - 1) {\n\t\t\t\treader.lastDiskOffset += diskReader.size;\n\t\t\t}\n\t\t\treader.size += diskReader.size;\n\t\t}));\n\t\tsuper.init();\n\t}\n\n\tasync readUint8Array(offset, length, diskNumber = 0) {\n\t\tconst reader = this;\n\t\tconst { readers } = this;\n\t\tlet result;\n\t\tlet currentDiskNumber = diskNumber;\n\t\tif (currentDiskNumber == -1) {\n\t\t\tcurrentDiskNumber = readers.length - 1;\n\t\t}\n\t\tlet currentReaderOffset = offset;\n\t\twhile (currentReaderOffset >= readers[currentDiskNumber].size) {\n\t\t\tcurrentReaderOffset -= readers[currentDiskNumber].size;\n\t\t\tcurrentDiskNumber++;\n\t\t}\n\t\tconst currentReader = readers[currentDiskNumber];\n\t\tconst currentReaderSize = currentReader.size;\n\t\tif (currentReaderOffset + length <= currentReaderSize) {\n\t\t\tresult = await readUint8Array(currentReader, currentReaderOffset, length);\n\t\t} else {\n\t\t\tconst chunkLength = currentReaderSize - currentReaderOffset;\n\t\t\tresult = new Uint8Array(length);\n\t\t\tresult.set(await readUint8Array(currentReader, currentReaderOffset, chunkLength));\n\t\t\tresult.set(await reader.readUint8Array(offset + chunkLength, length - chunkLength, diskNumber), chunkLength);\n\t\t}\n\t\treader.lastDiskNumber = Math.max(currentDiskNumber, reader.lastDiskNumber);\n\t\treturn result;\n\t}\n}\n\nclass SplitDataWriter extends Stream {\n\n\tconstructor(writerGenerator, maxSize = 4294967295) {\n\t\tsuper();\n\t\tconst zipWriter = this;\n\t\tObject.assign(zipWriter, {\n\t\t\tdiskNumber: 0,\n\t\t\tdiskOffset: 0,\n\t\t\tsize: 0,\n\t\t\tmaxSize,\n\t\t\tavailableSize: maxSize\n\t\t});\n\t\tlet diskSourceWriter, diskWritable, diskWriter;\n\t\tconst writable = new WritableStream({\n\t\t\tasync write(chunk) {\n\t\t\t\tconst { availableSize } = zipWriter;\n\t\t\t\tif (!diskWriter) {\n\t\t\t\t\tconst { value, done } = await writerGenerator.next();\n\t\t\t\t\tif (done && !value) {\n\t\t\t\t\t\tthrow new Error(ERR_ITERATOR_COMPLETED_TOO_SOON);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tdiskSourceWriter = value;\n\t\t\t\t\t\tdiskSourceWriter.size = 0;\n\t\t\t\t\t\tif (diskSourceWriter.maxSize) {\n\t\t\t\t\t\t\tzipWriter.maxSize = diskSourceWriter.maxSize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tzipWriter.availableSize = zipWriter.maxSize;\n\t\t\t\t\t\tawait initStream(diskSourceWriter);\n\t\t\t\t\t\tdiskWritable = value.writable;\n\t\t\t\t\t\tdiskWriter = diskWritable.getWriter();\n\t\t\t\t\t}\n\t\t\t\t\tawait this.write(chunk);\n\t\t\t\t} else if (chunk.length >= availableSize) {\n\t\t\t\t\tawait writeChunk(chunk.slice(0, availableSize));\n\t\t\t\t\tawait closeDisk();\n\t\t\t\t\tzipWriter.diskOffset += diskSourceWriter.size;\n\t\t\t\t\tzipWriter.diskNumber++;\n\t\t\t\t\tdiskWriter = null;\n\t\t\t\t\tawait this.write(chunk.slice(availableSize));\n\t\t\t\t} else {\n\t\t\t\t\tawait writeChunk(chunk);\n\t\t\t\t}\n\t\t\t},\n\t\t\tasync close() {\n\t\t\t\tawait diskWriter.ready;\n\t\t\t\tawait closeDisk();\n\t\t\t}\n\t\t});\n\t\tObject.defineProperty(zipWriter, PROPERTY_NAME_WRITABLE, {\n\t\t\tget() {\n\t\t\t\treturn writable;\n\t\t\t}\n\t\t});\n\n\t\tasync function writeChunk(chunk) {\n\t\t\tconst chunkLength = chunk.length;\n\t\t\tif (chunkLength) {\n\t\t\t\tawait diskWriter.ready;\n\t\t\t\tawait diskWriter.write(chunk);\n\t\t\t\tdiskSourceWriter.size += chunkLength;\n\t\t\t\tzipWriter.size += chunkLength;\n\t\t\t\tzipWriter.availableSize -= chunkLength;\n\t\t\t}\n\t\t}\n\n\t\tasync function closeDisk() {\n\t\t\tdiskWritable.size = diskSourceWriter.size;\n\t\t\tawait diskWriter.close();\n\t\t}\n\t}\n}\n\nfunction isHttpFamily(url) {\n\tconst { baseURL } = getConfiguration();\n\tconst { protocol } = new URL(url, baseURL);\n\treturn protocol == \"http:\" || protocol == \"https:\";\n}\n\nasync function initStream(stream, initSize) {\n\tif (stream.init && !stream.initialized) {\n\t\tawait stream.init(initSize);\n\t}\n}\n\nfunction initReader(reader) {\n\tif (Array.isArray(reader)) {\n\t\treader = new SplitDataReader(reader);\n\t}\n\tif (reader instanceof ReadableStream) {\n\t\treader = {\n\t\t\treadable: reader\n\t\t};\n\t}\n\treturn reader;\n}\n\nfunction initWriter(writer) {\n\tif (writer.writable === UNDEFINED_VALUE && typeof writer.next == FUNCTION_TYPE) {\n\t\twriter = new SplitDataWriter(writer);\n\t}\n\tif (writer instanceof WritableStream) {\n\t\twriter = {\n\t\t\twritable: writer\n\t\t};\n\t}\n\tconst { writable } = writer;\n\tif (writable.size === UNDEFINED_VALUE) {\n\t\twritable.size = 0;\n\t}\n\tconst splitZipFile = writer instanceof SplitDataWriter;\n\tif (!splitZipFile) {\n\t\tObject.assign(writer, {\n\t\t\tdiskNumber: 0,\n\t\t\tdiskOffset: 0,\n\t\t\tavailableSize: Infinity,\n\t\t\tmaxSize: Infinity\n\t\t});\n\t}\n\treturn writer;\n}\n\nfunction readUint8Array(reader, offset, size, diskNumber) {\n\treturn reader.readUint8Array(offset, size, diskNumber);\n}\n\nconst SplitZipReader = SplitDataReader;\nconst SplitZipWriter = SplitDataWriter;\n\nexport {\n\tinitStream,\n\tinitReader,\n\tinitWriter,\n\treadUint8Array,\n\tReader,\n\tWriter,\n\tTextReader,\n\tTextWriter,\n\tData64URIReader,\n\tData64URIWriter,\n\tBlobReader,\n\tBlobWriter,\n\tUint8ArrayReader,\n\tUint8ArrayWriter,\n\tHttpReader,\n\tHttpRangeReader,\n\tSplitZipReader,\n\tSplitZipWriter,\n\tSplitDataReader,\n\tSplitDataWriter,\n\tERR_HTTP_RANGE,\n\tERR_ITERATOR_COMPLETED_TOO_SOON\n};", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global TextDecoder */\n\nconst CP437 = \"\\0\u263A\u263B\u2665\u2666\u2663\u2660\u2022\u25D8\u25CB\u25D9\u2642\u2640\u266A\u266B\u263C\u25BA\u25C4\u2195\u203C\u00B6\u00A7\u25AC\u21A8\u2191\u2193\u2192\u2190\u221F\u2194\u25B2\u25BC !\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~\u2302\u00C7\u00FC\u00E9\u00E2\u00E4\u00E0\u00E5\u00E7\u00EA\u00EB\u00E8\u00EF\u00EE\u00EC\u00C4\u00C5\u00C9\u00E6\u00C6\u00F4\u00F6\u00F2\u00FB\u00F9\u00FF\u00D6\u00DC\u00A2\u00A3\u00A5\u20A7\u0192\u00E1\u00ED\u00F3\u00FA\u00F1\u00D1\u00AA\u00BA\u00BF\u2310\u00AC\u00BD\u00BC\u00A1\u00AB\u00BB\u2591\u2592\u2593\u2502\u2524\u2561\u2562\u2556\u2555\u2563\u2551\u2557\u255D\u255C\u255B\u2510\u2514\u2534\u252C\u251C\u2500\u253C\u255E\u255F\u255A\u2554\u2569\u2566\u2560\u2550\u256C\u2567\u2568\u2564\u2565\u2559\u2558\u2552\u2553\u256B\u256A\u2518\u250C\u2588\u2584\u258C\u2590\u2580\u03B1\u00DF\u0393\u03C0\u03A3\u03C3\u00B5\u03C4\u03A6\u0398\u03A9\u03B4\u221E\u03C6\u03B5\u2229\u2261\u00B1\u2265\u2264\u2320\u2321\u00F7\u2248\u00B0\u2219\u00B7\u221A\u207F\u00B2\u25A0 \".split(\"\");\nconst VALID_CP437 = CP437.length == 256;\n\nexport {\n\tdecodeCP437\n};\n\nfunction decodeCP437(stringValue) {\n\tif (VALID_CP437) {\n\t\tlet result = \"\";\n\t\tfor (let indexCharacter = 0; indexCharacter < stringValue.length; indexCharacter++) {\n\t\t\tresult += CP437[stringValue[indexCharacter]];\n\t\t}\n\t\treturn result;\n\t} else {\n\t\treturn new TextDecoder().decode(stringValue);\n\t}\n}", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global TextDecoder */\n\nimport { decodeCP437 } from \"./cp437-decode.js\";\n\nexport {\n\tdecodeText\n};\n\nfunction decodeText(value, encoding) {\n\tif (encoding && encoding.trim().toLowerCase() == \"cp437\") {\n\t\treturn decodeCP437(value);\n\t} else {\n\t\treturn new TextDecoder(encoding).decode(value);\n\t}\n}", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nconst PROPERTY_NAME_FILENAME = \"filename\";\nconst PROPERTY_NAME_RAW_FILENAME = \"rawFilename\";\nconst PROPERTY_NAME_COMMENT = \"comment\";\nconst PROPERTY_NAME_RAW_COMMENT = \"rawComment\";\nconst PROPERTY_NAME_UNCOMPPRESSED_SIZE = \"uncompressedSize\";\nconst PROPERTY_NAME_COMPPRESSED_SIZE = \"compressedSize\";\nconst PROPERTY_NAME_OFFSET = \"offset\";\nconst PROPERTY_NAME_DISK_NUMBER_START = \"diskNumberStart\";\nconst PROPERTY_NAME_LAST_MODIFICATION_DATE = \"lastModDate\";\nconst PROPERTY_NAME_RAW_LAST_MODIFICATION_DATE = \"rawLastModDate\";\nconst PROPERTY_NAME_LAST_ACCESS_DATE = \"lastAccessDate\";\nconst PROPERTY_NAME_RAW_LAST_ACCESS_DATE = \"rawLastAccessDate\";\nconst PROPERTY_NAME_CREATION_DATE = \"creationDate\";\nconst PROPERTY_NAME_RAW_CREATION_DATE = \"rawCreationDate\";\nconst PROPERTY_NAME_INTERNAL_FILE_ATTRIBUTE = \"internalFileAttribute\";\nconst PROPERTY_NAME_EXTERNAL_FILE_ATTRIBUTE = \"externalFileAttribute\";\nconst PROPERTY_NAME_MS_DOS_COMPATIBLE = \"msDosCompatible\";\nconst PROPERTY_NAME_ZIP64 = \"zip64\";\n\nconst PROPERTY_NAMES = [\n\tPROPERTY_NAME_FILENAME, PROPERTY_NAME_RAW_FILENAME, PROPERTY_NAME_COMPPRESSED_SIZE, PROPERTY_NAME_UNCOMPPRESSED_SIZE,\n\tPROPERTY_NAME_LAST_MODIFICATION_DATE, PROPERTY_NAME_RAW_LAST_MODIFICATION_DATE, PROPERTY_NAME_COMMENT, PROPERTY_NAME_RAW_COMMENT,\n\tPROPERTY_NAME_LAST_ACCESS_DATE, PROPERTY_NAME_CREATION_DATE, PROPERTY_NAME_OFFSET, PROPERTY_NAME_DISK_NUMBER_START,\n\tPROPERTY_NAME_DISK_NUMBER_START, PROPERTY_NAME_INTERNAL_FILE_ATTRIBUTE, PROPERTY_NAME_EXTERNAL_FILE_ATTRIBUTE,\n\tPROPERTY_NAME_MS_DOS_COMPATIBLE, PROPERTY_NAME_ZIP64,\n\t\"directory\", \"bitFlag\", \"encrypted\", \"signature\", \"filenameUTF8\", \"commentUTF8\", \"compressionMethod\", \"version\", \"versionMadeBy\",\n\t\"extraField\", \"rawExtraField\", \"extraFieldZip64\", \"extraFieldUnicodePath\", \"extraFieldUnicodeComment\", \"extraFieldAES\", \"extraFieldNTFS\",\n\t\"extraFieldExtendedTimestamp\"];\n\nclass Entry {\n\n\tconstructor(data) {\n\t\tPROPERTY_NAMES.forEach(name => this[name] = data[name]);\n\t}\n\n}\n\nexport {\n\tPROPERTY_NAME_FILENAME,\n\tPROPERTY_NAME_RAW_FILENAME,\n\tPROPERTY_NAME_COMMENT,\n\tPROPERTY_NAME_RAW_COMMENT,\n\tPROPERTY_NAME_UNCOMPPRESSED_SIZE,\n\tPROPERTY_NAME_COMPPRESSED_SIZE,\n\tPROPERTY_NAME_OFFSET,\n\tPROPERTY_NAME_DISK_NUMBER_START,\n\tPROPERTY_NAME_LAST_MODIFICATION_DATE,\n\tPROPERTY_NAME_RAW_LAST_MODIFICATION_DATE,\n\tPROPERTY_NAME_LAST_ACCESS_DATE,\n\tPROPERTY_NAME_RAW_LAST_ACCESS_DATE,\n\tPROPERTY_NAME_CREATION_DATE,\n\tPROPERTY_NAME_RAW_CREATION_DATE,\n\tPROPERTY_NAME_INTERNAL_FILE_ATTRIBUTE,\n\tPROPERTY_NAME_EXTERNAL_FILE_ATTRIBUTE,\n\tPROPERTY_NAME_MS_DOS_COMPATIBLE,\n\tPROPERTY_NAME_ZIP64,\n\tEntry\n};", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global BigInt, Response, WritableStream */\n// deno-lint-ignore-file no-this-alias\n\nimport {\n\tMAX_32_BITS,\n\tMAX_16_BITS,\n\tCOMPRESSION_METHOD_DEFLATE,\n\tCOMPRESSION_METHOD_STORE,\n\tCOMPRESSION_METHOD_AES,\n\tSPLIT_ZIP_FILE_SIGNATURE,\n\tLOCAL_FILE_HEADER_SIGNATURE,\n\tCENTRAL_FILE_HEADER_SIGNATURE,\n\tEND_OF_CENTRAL_DIR_SIGNATURE,\n\tZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIGNATURE,\n\tZIP64_END_OF_CENTRAL_DIR_SIGNATURE,\n\tEXTRAFIELD_TYPE_ZIP64,\n\tEXTRAFIELD_TYPE_UNICODE_PATH,\n\tEXTRAFIELD_TYPE_UNICODE_COMMENT,\n\tEXTRAFIELD_TYPE_AES,\n\tEXTRAFIELD_TYPE_NTFS,\n\tEXTRAFIELD_TYPE_NTFS_TAG1,\n\tEXTRAFIELD_TYPE_EXTENDED_TIMESTAMP,\n\tEND_OF_CENTRAL_DIR_LENGTH,\n\tZIP64_END_OF_CENTRAL_DIR_LOCATOR_LENGTH,\n\tZIP64_END_OF_CENTRAL_DIR_LENGTH,\n\tBITFLAG_ENCRYPTED,\n\tBITFLAG_LEVEL,\n\tBITFLAG_DATA_DESCRIPTOR,\n\tBITFLAG_LANG_ENCODING_FLAG,\n\tFILE_ATTR_MSDOS_DIR_MASK,\n\tDIRECTORY_SIGNATURE,\n\tUNDEFINED_VALUE\n} from \"./constants.js\";\nimport {\n\tgetConfiguration,\n\tgetChunkSize\n} from \"./configuration.js\";\nimport {\n\trunWorker,\n\tCODEC_INFLATE,\n\tERR_INVALID_SIGNATURE,\n\tERR_INVALID_PASSWORD,\n\tERR_ABORT_CHECK_PASSWORD\n} from \"./codec-pool.js\";\nimport {\n\tinitStream,\n\tinitReader,\n\tinitWriter,\n\treadUint8Array,\n\tBlobReader\n} from \"./io.js\";\nimport { decodeText } from \"./util/decode-text.js\";\nimport { Crc32 } from \"./streams/codecs/crc32.js\";\nimport {\n\tPROPERTY_NAME_RAW_FILENAME,\n\tPROPERTY_NAME_FILENAME,\n\tPROPERTY_NAME_RAW_COMMENT,\n\tPROPERTY_NAME_COMMENT,\n\tPROPERTY_NAME_UNCOMPPRESSED_SIZE,\n\tPROPERTY_NAME_COMPPRESSED_SIZE,\n\tPROPERTY_NAME_OFFSET,\n\tPROPERTY_NAME_DISK_NUMBER_START,\n\tPROPERTY_NAME_LAST_MODIFICATION_DATE,\n\tPROPERTY_NAME_RAW_LAST_MODIFICATION_DATE,\n\tPROPERTY_NAME_LAST_ACCESS_DATE,\n\tPROPERTY_NAME_RAW_LAST_ACCESS_DATE,\n\tPROPERTY_NAME_CREATION_DATE,\n\tPROPERTY_NAME_RAW_CREATION_DATE,\n\tEntry\n} from \"./zip-entry.js\";\n\nconst ERR_BAD_FORMAT = \"File format is not recognized\";\nconst ERR_EOCDR_NOT_FOUND = \"End of central directory not found\";\nconst ERR_EOCDR_ZIP64_NOT_FOUND = \"End of Zip64 central directory not found\";\nconst ERR_EOCDR_LOCATOR_ZIP64_NOT_FOUND = \"End of Zip64 central directory locator not found\";\nconst ERR_CENTRAL_DIRECTORY_NOT_FOUND = \"Central directory header not found\";\nconst ERR_LOCAL_FILE_HEADER_NOT_FOUND = \"Local file header not found\";\nconst ERR_EXTRAFIELD_ZIP64_NOT_FOUND = \"Zip64 extra field not found\";\nconst ERR_ENCRYPTED = \"File contains encrypted entry\";\nconst ERR_UNSUPPORTED_ENCRYPTION = \"Encryption method not supported\";\nconst ERR_UNSUPPORTED_COMPRESSION = \"Compression method not supported\";\nconst ERR_SPLIT_ZIP_FILE = \"Split zip file\";\nconst CHARSET_UTF8 = \"utf-8\";\nconst CHARSET_CP437 = \"cp437\";\nconst ZIP64_PROPERTIES = [\n\t[PROPERTY_NAME_UNCOMPPRESSED_SIZE, MAX_32_BITS],\n\t[PROPERTY_NAME_COMPPRESSED_SIZE, MAX_32_BITS],\n\t[PROPERTY_NAME_OFFSET, MAX_32_BITS],\n\t[PROPERTY_NAME_DISK_NUMBER_START, MAX_16_BITS]\n];\nconst ZIP64_EXTRACTION = {\n\t[MAX_16_BITS]: {\n\t\tgetValue: getUint32,\n\t\tbytes: 4\n\t},\n\t[MAX_32_BITS]: {\n\t\tgetValue: getBigUint64,\n\t\tbytes: 8\n\t}\n};\n\nclass ZipReader {\n\n\tconstructor(reader, options = {}) {\n\t\tObject.assign(this, {\n\t\t\treader: initReader(reader),\n\t\t\toptions,\n\t\t\tconfig: getConfiguration()\n\t\t});\n\t}\n\n\tasync* getEntriesGenerator(options = {}) {\n\t\tconst zipReader = this;\n\t\tlet { reader } = zipReader;\n\t\tconst { config } = zipReader;\n\t\tawait initStream(reader);\n\t\tif (reader.size === UNDEFINED_VALUE || !reader.readUint8Array) {\n\t\t\treader = new BlobReader(await new Response(reader.readable).blob());\n\t\t\tawait initStream(reader);\n\t\t}\n\t\tif (reader.size < END_OF_CENTRAL_DIR_LENGTH) {\n\t\t\tthrow new Error(ERR_BAD_FORMAT);\n\t\t}\n\t\treader.chunkSize = getChunkSize(config);\n\t\tconst endOfDirectoryInfo = await seekSignature(reader, END_OF_CENTRAL_DIR_SIGNATURE, reader.size, END_OF_CENTRAL_DIR_LENGTH, MAX_16_BITS * 16);\n\t\tif (!endOfDirectoryInfo) {\n\t\t\tconst signatureArray = await readUint8Array(reader, 0, 4);\n\t\t\tconst signatureView = getDataView(signatureArray);\n\t\t\tif (getUint32(signatureView) == SPLIT_ZIP_FILE_SIGNATURE) {\n\t\t\t\tthrow new Error(ERR_SPLIT_ZIP_FILE);\n\t\t\t} else {\n\t\t\t\tthrow new Error(ERR_EOCDR_NOT_FOUND);\n\t\t\t}\n\t\t}\n\t\tconst endOfDirectoryView = getDataView(endOfDirectoryInfo);\n\t\tlet directoryDataLength = getUint32(endOfDirectoryView, 12);\n\t\tlet directoryDataOffset = getUint32(endOfDirectoryView, 16);\n\t\tconst commentOffset = endOfDirectoryInfo.offset;\n\t\tconst commentLength = getUint16(endOfDirectoryView, 20);\n\t\tconst appendedDataOffset = commentOffset + END_OF_CENTRAL_DIR_LENGTH + commentLength;\n\t\tlet lastDiskNumber = getUint16(endOfDirectoryView, 4);\n\t\tconst expectedLastDiskNumber = reader.lastDiskNumber || 0;\n\t\tlet diskNumber = getUint16(endOfDirectoryView, 6);\n\t\tlet filesLength = getUint16(endOfDirectoryView, 8);\n\t\tlet prependedDataLength = 0;\n\t\tlet startOffset = 0;\n\t\tif (directoryDataOffset == MAX_32_BITS || directoryDataLength == MAX_32_BITS || filesLength == MAX_16_BITS || diskNumber == MAX_16_BITS) {\n\t\t\tconst endOfDirectoryLocatorArray = await readUint8Array(reader, endOfDirectoryInfo.offset - ZIP64_END_OF_CENTRAL_DIR_LOCATOR_LENGTH, ZIP64_END_OF_CENTRAL_DIR_LOCATOR_LENGTH);\n\t\t\tconst endOfDirectoryLocatorView = getDataView(endOfDirectoryLocatorArray);\n\t\t\tif (getUint32(endOfDirectoryLocatorView, 0) != ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIGNATURE) {\n\t\t\t\tthrow new Error(ERR_EOCDR_ZIP64_NOT_FOUND);\n\t\t\t}\n\t\t\tdirectoryDataOffset = getBigUint64(endOfDirectoryLocatorView, 8);\n\t\t\tlet endOfDirectoryArray = await readUint8Array(reader, directoryDataOffset, ZIP64_END_OF_CENTRAL_DIR_LENGTH, -1);\n\t\t\tlet endOfDirectoryView = getDataView(endOfDirectoryArray);\n\t\t\tconst expectedDirectoryDataOffset = endOfDirectoryInfo.offset - ZIP64_END_OF_CENTRAL_DIR_LOCATOR_LENGTH - ZIP64_END_OF_CENTRAL_DIR_LENGTH;\n\t\t\tif (getUint32(endOfDirectoryView, 0) != ZIP64_END_OF_CENTRAL_DIR_SIGNATURE && directoryDataOffset != expectedDirectoryDataOffset) {\n\t\t\t\tconst originalDirectoryDataOffset = directoryDataOffset;\n\t\t\t\tdirectoryDataOffset = expectedDirectoryDataOffset;\n\t\t\t\tprependedDataLength = directoryDataOffset - originalDirectoryDataOffset;\n\t\t\t\tendOfDirectoryArray = await readUint8Array(reader, directoryDataOffset, ZIP64_END_OF_CENTRAL_DIR_LENGTH, -1);\n\t\t\t\tendOfDirectoryView = getDataView(endOfDirectoryArray);\n\t\t\t}\n\t\t\tif (getUint32(endOfDirectoryView, 0) != ZIP64_END_OF_CENTRAL_DIR_SIGNATURE) {\n\t\t\t\tthrow new Error(ERR_EOCDR_LOCATOR_ZIP64_NOT_FOUND);\n\t\t\t}\n\t\t\tif (lastDiskNumber == MAX_16_BITS) {\n\t\t\t\tlastDiskNumber = getUint32(endOfDirectoryView, 16);\n\t\t\t}\n\t\t\tif (diskNumber == MAX_16_BITS) {\n\t\t\t\tdiskNumber = getUint32(endOfDirectoryView, 20);\n\t\t\t}\n\t\t\tif (filesLength == MAX_16_BITS) {\n\t\t\t\tfilesLength = getBigUint64(endOfDirectoryView, 32);\n\t\t\t}\n\t\t\tif (directoryDataLength == MAX_32_BITS) {\n\t\t\t\tdirectoryDataLength = getBigUint64(endOfDirectoryView, 40);\n\t\t\t}\n\t\t\tdirectoryDataOffset -= directoryDataLength;\n\t\t}\n\t\tif (expectedLastDiskNumber != lastDiskNumber) {\n\t\t\tthrow new Error(ERR_SPLIT_ZIP_FILE);\n\t\t}\n\t\tif (directoryDataOffset < 0 || directoryDataOffset >= reader.size) {\n\t\t\tthrow new Error(ERR_BAD_FORMAT);\n\t\t}\n\t\tlet offset = 0;\n\t\tlet directoryArray = await readUint8Array(reader, directoryDataOffset, directoryDataLength, diskNumber);\n\t\tlet directoryView = getDataView(directoryArray);\n\t\tif (directoryDataLength) {\n\t\t\tconst expectedDirectoryDataOffset = endOfDirectoryInfo.offset - directoryDataLength;\n\t\t\tif (getUint32(directoryView, offset) != CENTRAL_FILE_HEADER_SIGNATURE && directoryDataOffset != expectedDirectoryDataOffset) {\n\t\t\t\tconst originalDirectoryDataOffset = directoryDataOffset;\n\t\t\t\tdirectoryDataOffset = expectedDirectoryDataOffset;\n\t\t\t\tprependedDataLength = directoryDataOffset - originalDirectoryDataOffset;\n\t\t\t\tdirectoryArray = await readUint8Array(reader, directoryDataOffset, directoryDataLength, diskNumber);\n\t\t\t\tdirectoryView = getDataView(directoryArray);\n\t\t\t}\n\t\t}\n\t\tconst expectedDirectoryDataLength = endOfDirectoryInfo.offset - directoryDataOffset - (reader.lastDiskOffset || 0);\n\t\tif (directoryDataLength != expectedDirectoryDataLength && expectedDirectoryDataLength >= 0) {\n\t\t\tdirectoryDataLength = expectedDirectoryDataLength;\n\t\t\tdirectoryArray = await readUint8Array(reader, directoryDataOffset, directoryDataLength, diskNumber);\n\t\t\tdirectoryView = getDataView(directoryArray);\n\t\t}\n\t\tif (directoryDataOffset < 0 || directoryDataOffset >= reader.size) {\n\t\t\tthrow new Error(ERR_BAD_FORMAT);\n\t\t}\n\t\tconst filenameEncoding = getOptionValue(zipReader, options, \"filenameEncoding\");\n\t\tconst commentEncoding = getOptionValue(zipReader, options, \"commentEncoding\");\n\t\tfor (let indexFile = 0; indexFile < filesLength; indexFile++) {\n\t\t\tconst fileEntry = new ZipEntry(reader, config, zipReader.options);\n\t\t\tif (getUint32(directoryView, offset) != CENTRAL_FILE_HEADER_SIGNATURE) {\n\t\t\t\tthrow new Error(ERR_CENTRAL_DIRECTORY_NOT_FOUND);\n\t\t\t}\n\t\t\treadCommonHeader(fileEntry, directoryView, offset + 6);\n\t\t\tconst languageEncodingFlag = Boolean(fileEntry.bitFlag.languageEncodingFlag);\n\t\t\tconst filenameOffset = offset + 46;\n\t\t\tconst extraFieldOffset = filenameOffset + fileEntry.filenameLength;\n\t\t\tconst commentOffset = extraFieldOffset + fileEntry.extraFieldLength;\n\t\t\tconst versionMadeBy = getUint16(directoryView, offset + 4);\n\t\t\tconst msDosCompatible = (versionMadeBy & 0) == 0;\n\t\t\tconst rawFilename = directoryArray.subarray(filenameOffset, extraFieldOffset);\n\t\t\tconst commentLength = getUint16(directoryView, offset + 32);\n\t\t\tconst endOffset = commentOffset + commentLength;\n\t\t\tconst rawComment = directoryArray.subarray(commentOffset, endOffset);\n\t\t\tconst filenameUTF8 = languageEncodingFlag;\n\t\t\tconst commentUTF8 = languageEncodingFlag;\n\t\t\tconst directory = msDosCompatible && ((getUint8(directoryView, offset + 38) & FILE_ATTR_MSDOS_DIR_MASK) == FILE_ATTR_MSDOS_DIR_MASK);\n\t\t\tconst offsetFileEntry = getUint32(directoryView, offset + 42) + prependedDataLength;\n\t\t\tObject.assign(fileEntry, {\n\t\t\t\tversionMadeBy,\n\t\t\t\tmsDosCompatible,\n\t\t\t\tcompressedSize: 0,\n\t\t\t\tuncompressedSize: 0,\n\t\t\t\tcommentLength,\n\t\t\t\tdirectory,\n\t\t\t\toffset: offsetFileEntry,\n\t\t\t\tdiskNumberStart: getUint16(directoryView, offset + 34),\n\t\t\t\tinternalFileAttribute: getUint16(directoryView, offset + 36),\n\t\t\t\texternalFileAttribute: getUint32(directoryView, offset + 38),\n\t\t\t\trawFilename,\n\t\t\t\tfilenameUTF8,\n\t\t\t\tcommentUTF8,\n\t\t\t\trawExtraField: directoryArray.subarray(extraFieldOffset, commentOffset)\n\t\t\t});\n\t\t\tconst [filename, comment] = await Promise.all([\n\t\t\t\tdecodeText(rawFilename, filenameUTF8 ? CHARSET_UTF8 : filenameEncoding || CHARSET_CP437),\n\t\t\t\tdecodeText(rawComment, commentUTF8 ? CHARSET_UTF8 : commentEncoding || CHARSET_CP437)\n\t\t\t]);\n\t\t\tObject.assign(fileEntry, {\n\t\t\t\trawComment,\n\t\t\t\tfilename,\n\t\t\t\tcomment,\n\t\t\t\tdirectory: directory || filename.endsWith(DIRECTORY_SIGNATURE)\n\t\t\t});\n\t\t\tstartOffset = Math.max(offsetFileEntry, startOffset);\n\t\t\tawait readCommonFooter(fileEntry, fileEntry, directoryView, offset + 6);\n\t\t\tconst entry = new Entry(fileEntry);\n\t\t\tentry.getData = (writer, options) => fileEntry.getData(writer, entry, options);\n\t\t\toffset = endOffset;\n\t\t\tconst { onprogress } = options;\n\t\t\tif (onprogress) {\n\t\t\t\ttry {\n\t\t\t\t\tawait onprogress(indexFile + 1, filesLength, new Entry(fileEntry));\n\t\t\t\t} catch (_error) {\n\t\t\t\t\t// ignored\n\t\t\t\t}\n\t\t\t}\n\t\t\tyield entry;\n\t\t}\n\t\tconst extractPrependedData = getOptionValue(zipReader, options, \"extractPrependedData\");\n\t\tconst extractAppendedData = getOptionValue(zipReader, options, \"extractAppendedData\");\n\t\tif (extractPrependedData) {\n\t\t\tzipReader.prependedData = startOffset > 0 ? await readUint8Array(reader, 0, startOffset) : new Uint8Array();\n\t\t}\n\t\tzipReader.comment = commentLength ? await readUint8Array(reader, commentOffset + END_OF_CENTRAL_DIR_LENGTH, commentLength) : new Uint8Array();\n\t\tif (extractAppendedData) {\n\t\t\tzipReader.appendedData = appendedDataOffset < reader.size ? await readUint8Array(reader, appendedDataOffset, reader.size - appendedDataOffset) : new Uint8Array();\n\t\t}\n\t\treturn true;\n\t}\n\n\tasync getEntries(options = {}) {\n\t\tconst entries = [];\n\t\tfor await (const entry of this.getEntriesGenerator(options)) {\n\t\t\tentries.push(entry);\n\t\t}\n\t\treturn entries;\n\t}\n\n\tasync close() {\n\t}\n}\n\nexport {\n\tZipReader,\n\tERR_BAD_FORMAT,\n\tERR_EOCDR_NOT_FOUND,\n\tERR_EOCDR_ZIP64_NOT_FOUND,\n\tERR_EOCDR_LOCATOR_ZIP64_NOT_FOUND,\n\tERR_CENTRAL_DIRECTORY_NOT_FOUND,\n\tERR_LOCAL_FILE_HEADER_NOT_FOUND,\n\tERR_EXTRAFIELD_ZIP64_NOT_FOUND,\n\tERR_ENCRYPTED,\n\tERR_UNSUPPORTED_ENCRYPTION,\n\tERR_UNSUPPORTED_COMPRESSION,\n\tERR_INVALID_SIGNATURE,\n\tERR_INVALID_PASSWORD,\n\tERR_SPLIT_ZIP_FILE\n};\n\nclass ZipEntry {\n\n\tconstructor(reader, config, options) {\n\t\tObject.assign(this, {\n\t\t\treader,\n\t\t\tconfig,\n\t\t\toptions\n\t\t});\n\t}\n\n\tasync getData(writer, fileEntry, options = {}) {\n\t\tconst zipEntry = this;\n\t\tconst {\n\t\t\treader,\n\t\t\toffset,\n\t\t\tdiskNumberStart,\n\t\t\textraFieldAES,\n\t\t\tcompressionMethod,\n\t\t\tconfig,\n\t\t\tbitFlag,\n\t\t\tsignature,\n\t\t\trawLastModDate,\n\t\t\tuncompressedSize,\n\t\t\tcompressedSize\n\t\t} = zipEntry;\n\t\tconst localDirectory = zipEntry.localDirectory = {};\n\t\tconst dataArray = await readUint8Array(reader, offset, 30, diskNumberStart);\n\t\tconst dataView = getDataView(dataArray);\n\t\tlet password = getOptionValue(zipEntry, options, \"password\");\n\t\tpassword = password && password.length && password;\n\t\tif (extraFieldAES) {\n\t\t\tif (extraFieldAES.originalCompressionMethod != COMPRESSION_METHOD_AES) {\n\t\t\t\tthrow new Error(ERR_UNSUPPORTED_COMPRESSION);\n\t\t\t}\n\t\t}\n\t\tif (compressionMethod != COMPRESSION_METHOD_STORE && compressionMethod != COMPRESSION_METHOD_DEFLATE) {\n\t\t\tthrow new Error(ERR_UNSUPPORTED_COMPRESSION);\n\t\t}\n\t\tif (getUint32(dataView, 0) != LOCAL_FILE_HEADER_SIGNATURE) {\n\t\t\tthrow new Error(ERR_LOCAL_FILE_HEADER_NOT_FOUND);\n\t\t}\n\t\treadCommonHeader(localDirectory, dataView, 4);\n\t\tlocalDirectory.rawExtraField = localDirectory.extraFieldLength ?\n\t\t\tawait readUint8Array(reader, offset + 30 + localDirectory.filenameLength, localDirectory.extraFieldLength, diskNumberStart) :\n\t\t\tnew Uint8Array();\n\t\tawait readCommonFooter(zipEntry, localDirectory, dataView, 4, true);\n\t\tObject.assign(fileEntry, {\n\t\t\tlastAccessDate: localDirectory.lastAccessDate,\n\t\t\tcreationDate: localDirectory.creationDate\n\t\t});\n\t\tconst encrypted = zipEntry.encrypted && localDirectory.encrypted;\n\t\tconst zipCrypto = encrypted && !extraFieldAES;\n\t\tif (encrypted) {\n\t\t\tif (!zipCrypto && extraFieldAES.strength === UNDEFINED_VALUE) {\n\t\t\t\tthrow new Error(ERR_UNSUPPORTED_ENCRYPTION);\n\t\t\t} else if (!password) {\n\t\t\t\tthrow new Error(ERR_ENCRYPTED);\n\t\t\t}\n\t\t}\n\t\tconst dataOffset = offset + 30 + localDirectory.filenameLength + localDirectory.extraFieldLength;\n\t\tconst size = compressedSize;\n\t\tconst readable = reader.readable;\n\t\tObject.assign(readable, {\n\t\t\tdiskNumberStart,\n\t\t\toffset: dataOffset,\n\t\t\tsize\n\t\t});\n\t\tconst signal = getOptionValue(zipEntry, options, \"signal\");\n\t\tconst checkPasswordOnly = getOptionValue(zipEntry, options, \"checkPasswordOnly\");\n\t\tif (checkPasswordOnly) {\n\t\t\twriter = new WritableStream();\n\t\t}\n\t\twriter = initWriter(writer);\n\t\tawait initStream(writer, uncompressedSize);\n\t\tconst { writable } = writer;\n\t\tconst { onstart, onprogress, onend } = options;\n\t\tconst workerOptions = {\n\t\t\toptions: {\n\t\t\t\tcodecType: CODEC_INFLATE,\n\t\t\t\tpassword,\n\t\t\t\tzipCrypto,\n\t\t\t\tencryptionStrength: extraFieldAES && extraFieldAES.strength,\n\t\t\t\tsigned: getOptionValue(zipEntry, options, \"checkSignature\"),\n\t\t\t\tpasswordVerification: zipCrypto && (bitFlag.dataDescriptor ? ((rawLastModDate >>> 8) & 0xFF) : ((signature >>> 24) & 0xFF)),\n\t\t\t\tsignature,\n\t\t\t\tcompressed: compressionMethod != 0,\n\t\t\t\tencrypted,\n\t\t\t\tuseWebWorkers: getOptionValue(zipEntry, options, \"useWebWorkers\"),\n\t\t\t\tuseCompressionStream: getOptionValue(zipEntry, options, \"useCompressionStream\"),\n\t\t\t\ttransferStreams: getOptionValue(zipEntry, options, \"transferStreams\"),\n\t\t\t\tcheckPasswordOnly\n\t\t\t},\n\t\t\tconfig,\n\t\t\tstreamOptions: { signal, size, onstart, onprogress, onend }\n\t\t};\n\t\tlet outputSize = 0;\n\t\ttry {\n\t\t\t({ outputSize } = (await runWorker({ readable, writable }, workerOptions)));\n\t\t} catch (error) {\n\t\t\tif (!checkPasswordOnly || error.message != ERR_ABORT_CHECK_PASSWORD) {\n\t\t\t\tthrow error;\n\t\t\t}\n\t\t} finally {\n\t\t\tconst preventClose = getOptionValue(zipEntry, options, \"preventClose\");\n\t\t\twritable.size += outputSize;\n\t\t\tif (!preventClose && !writable.locked) {\n\t\t\t\tawait writable.getWriter().close();\n\t\t\t}\n\t\t}\n\t\treturn checkPasswordOnly ? undefined : writer.getData ? writer.getData() : writable;\n\t}\n}\n\nfunction readCommonHeader(directory, dataView, offset) {\n\tconst rawBitFlag = directory.rawBitFlag = getUint16(dataView, offset + 2);\n\tconst encrypted = (rawBitFlag & BITFLAG_ENCRYPTED) == BITFLAG_ENCRYPTED;\n\tconst rawLastModDate = getUint32(dataView, offset + 6);\n\tObject.assign(directory, {\n\t\tencrypted,\n\t\tversion: getUint16(dataView, offset),\n\t\tbitFlag: {\n\t\t\tlevel: (rawBitFlag & BITFLAG_LEVEL) >> 1,\n\t\t\tdataDescriptor: (rawBitFlag & BITFLAG_DATA_DESCRIPTOR) == BITFLAG_DATA_DESCRIPTOR,\n\t\t\tlanguageEncodingFlag: (rawBitFlag & BITFLAG_LANG_ENCODING_FLAG) == BITFLAG_LANG_ENCODING_FLAG\n\t\t},\n\t\trawLastModDate,\n\t\tlastModDate: getDate(rawLastModDate),\n\t\tfilenameLength: getUint16(dataView, offset + 22),\n\t\textraFieldLength: getUint16(dataView, offset + 24)\n\t});\n}\n\nasync function readCommonFooter(fileEntry, directory, dataView, offset, localDirectory) {\n\tconst { rawExtraField } = directory;\n\tconst extraField = directory.extraField = new Map();\n\tconst rawExtraFieldView = getDataView(new Uint8Array(rawExtraField));\n\tlet offsetExtraField = 0;\n\ttry {\n\t\twhile (offsetExtraField < rawExtraField.length) {\n\t\t\tconst type = getUint16(rawExtraFieldView, offsetExtraField);\n\t\t\tconst size = getUint16(rawExtraFieldView, offsetExtraField + 2);\n\t\t\textraField.set(type, {\n\t\t\t\ttype,\n\t\t\t\tdata: rawExtraField.slice(offsetExtraField + 4, offsetExtraField + 4 + size)\n\t\t\t});\n\t\t\toffsetExtraField += 4 + size;\n\t\t}\n\t} catch (_error) {\n\t\t// ignored\n\t}\n\tconst compressionMethod = getUint16(dataView, offset + 4);\n\tObject.assign(directory, {\n\t\tsignature: getUint32(dataView, offset + 10),\n\t\tuncompressedSize: getUint32(dataView, offset + 18),\n\t\tcompressedSize: getUint32(dataView, offset + 14)\n\t});\n\tconst extraFieldZip64 = extraField.get(EXTRAFIELD_TYPE_ZIP64);\n\tif (extraFieldZip64) {\n\t\treadExtraFieldZip64(extraFieldZip64, directory);\n\t\tdirectory.extraFieldZip64 = extraFieldZip64;\n\t}\n\tconst extraFieldUnicodePath = extraField.get(EXTRAFIELD_TYPE_UNICODE_PATH);\n\tif (extraFieldUnicodePath) {\n\t\tawait readExtraFieldUnicode(extraFieldUnicodePath, PROPERTY_NAME_FILENAME, PROPERTY_NAME_RAW_FILENAME, directory, fileEntry);\n\t\tdirectory.extraFieldUnicodePath = extraFieldUnicodePath;\n\t}\n\tconst extraFieldUnicodeComment = extraField.get(EXTRAFIELD_TYPE_UNICODE_COMMENT);\n\tif (extraFieldUnicodeComment) {\n\t\tawait readExtraFieldUnicode(extraFieldUnicodeComment, PROPERTY_NAME_COMMENT, PROPERTY_NAME_RAW_COMMENT, directory, fileEntry);\n\t\tdirectory.extraFieldUnicodeComment = extraFieldUnicodeComment;\n\t}\n\tconst extraFieldAES = extraField.get(EXTRAFIELD_TYPE_AES);\n\tif (extraFieldAES) {\n\t\treadExtraFieldAES(extraFieldAES, directory, compressionMethod);\n\t\tdirectory.extraFieldAES = extraFieldAES;\n\t} else {\n\t\tdirectory.compressionMethod = compressionMethod;\n\t}\n\tconst extraFieldNTFS = extraField.get(EXTRAFIELD_TYPE_NTFS);\n\tif (extraFieldNTFS) {\n\t\treadExtraFieldNTFS(extraFieldNTFS, directory);\n\t\tdirectory.extraFieldNTFS = extraFieldNTFS;\n\t}\n\tconst extraFieldExtendedTimestamp = extraField.get(EXTRAFIELD_TYPE_EXTENDED_TIMESTAMP);\n\tif (extraFieldExtendedTimestamp) {\n\t\treadExtraFieldExtendedTimestamp(extraFieldExtendedTimestamp, directory, localDirectory);\n\t\tdirectory.extraFieldExtendedTimestamp = extraFieldExtendedTimestamp;\n\t}\n}\n\nfunction readExtraFieldZip64(extraFieldZip64, directory) {\n\tdirectory.zip64 = true;\n\tconst extraFieldView = getDataView(extraFieldZip64.data);\n\tconst missingProperties = ZIP64_PROPERTIES.filter(([propertyName, max]) => directory[propertyName] == max);\n\tfor (let indexMissingProperty = 0, offset = 0; indexMissingProperty < missingProperties.length; indexMissingProperty++) {\n\t\tconst [propertyName, max] = missingProperties[indexMissingProperty];\n\t\tif (directory[propertyName] == max) {\n\t\t\tconst extraction = ZIP64_EXTRACTION[max];\n\t\t\tdirectory[propertyName] = extraFieldZip64[propertyName] = extraction.getValue(extraFieldView, offset);\n\t\t\toffset += extraction.bytes;\n\t\t} else if (extraFieldZip64[propertyName]) {\n\t\t\tthrow new Error(ERR_EXTRAFIELD_ZIP64_NOT_FOUND);\n\t\t}\n\t}\n}\n\nasync function readExtraFieldUnicode(extraFieldUnicode, propertyName, rawPropertyName, directory, fileEntry) {\n\tconst extraFieldView = getDataView(extraFieldUnicode.data);\n\tconst crc32 = new Crc32();\n\tcrc32.append(fileEntry[rawPropertyName]);\n\tconst dataViewSignature = getDataView(new Uint8Array(4));\n\tdataViewSignature.setUint32(0, crc32.get(), true);\n\tconst signature = getUint32(extraFieldView, 1);\n\tObject.assign(extraFieldUnicode, {\n\t\tversion: getUint8(extraFieldView, 0),\n\t\t[propertyName]: decodeText(extraFieldUnicode.data.subarray(5)),\n\t\tvalid: !fileEntry.bitFlag.languageEncodingFlag && signature == getUint32(dataViewSignature, 0)\n\t});\n\tif (extraFieldUnicode.valid) {\n\t\tdirectory[propertyName] = extraFieldUnicode[propertyName];\n\t\tdirectory[propertyName + \"UTF8\"] = true;\n\t}\n}\n\nfunction readExtraFieldAES(extraFieldAES, directory, compressionMethod) {\n\tconst extraFieldView = getDataView(extraFieldAES.data);\n\tconst strength = getUint8(extraFieldView, 4);\n\tObject.assign(extraFieldAES, {\n\t\tvendorVersion: getUint8(extraFieldView, 0),\n\t\tvendorId: getUint8(extraFieldView, 2),\n\t\tstrength,\n\t\toriginalCompressionMethod: compressionMethod,\n\t\tcompressionMethod: getUint16(extraFieldView, 5)\n\t});\n\tdirectory.compressionMethod = extraFieldAES.compressionMethod;\n}\n\nfunction readExtraFieldNTFS(extraFieldNTFS, directory) {\n\tconst extraFieldView = getDataView(extraFieldNTFS.data);\n\tlet offsetExtraField = 4;\n\tlet tag1Data;\n\ttry {\n\t\twhile (offsetExtraField < extraFieldNTFS.data.length && !tag1Data) {\n\t\t\tconst tagValue = getUint16(extraFieldView, offsetExtraField);\n\t\t\tconst attributeSize = getUint16(extraFieldView, offsetExtraField + 2);\n\t\t\tif (tagValue == EXTRAFIELD_TYPE_NTFS_TAG1) {\n\t\t\t\ttag1Data = extraFieldNTFS.data.slice(offsetExtraField + 4, offsetExtraField + 4 + attributeSize);\n\t\t\t}\n\t\t\toffsetExtraField += 4 + attributeSize;\n\t\t}\n\t} catch (_error) {\n\t\t// ignored\n\t}\n\ttry {\n\t\tif (tag1Data && tag1Data.length == 24) {\n\t\t\tconst tag1View = getDataView(tag1Data);\n\t\t\tconst rawLastModDate = tag1View.getBigUint64(0, true);\n\t\t\tconst rawLastAccessDate = tag1View.getBigUint64(8, true);\n\t\t\tconst rawCreationDate = tag1View.getBigUint64(16, true);\n\t\t\tObject.assign(extraFieldNTFS, {\n\t\t\t\trawLastModDate,\n\t\t\t\trawLastAccessDate,\n\t\t\t\trawCreationDate\n\t\t\t});\n\t\t\tconst lastModDate = getDateNTFS(rawLastModDate);\n\t\t\tconst lastAccessDate = getDateNTFS(rawLastAccessDate);\n\t\t\tconst creationDate = getDateNTFS(rawCreationDate);\n\t\t\tconst extraFieldData = { lastModDate, lastAccessDate, creationDate };\n\t\t\tObject.assign(extraFieldNTFS, extraFieldData);\n\t\t\tObject.assign(directory, extraFieldData);\n\t\t}\n\t} catch (_error) {\n\t\t// ignored\n\t}\n}\n\nfunction readExtraFieldExtendedTimestamp(extraFieldExtendedTimestamp, directory, localDirectory) {\n\tconst extraFieldView = getDataView(extraFieldExtendedTimestamp.data);\n\tconst flags = getUint8(extraFieldView, 0);\n\tconst timeProperties = [];\n\tconst timeRawProperties = [];\n\tif (localDirectory)\t{\n\t\tif ((flags & 0x1) == 0x1) {\n\t\t\ttimeProperties.push(PROPERTY_NAME_LAST_MODIFICATION_DATE);\n\t\t\ttimeRawProperties.push(PROPERTY_NAME_RAW_LAST_MODIFICATION_DATE);\n\t\t}\n\t\tif ((flags & 0x2) == 0x2) {\n\t\t\ttimeProperties.push(PROPERTY_NAME_LAST_ACCESS_DATE);\n\t\t\ttimeRawProperties.push(PROPERTY_NAME_RAW_LAST_ACCESS_DATE);\n\t\t}\n\t\tif ((flags & 0x4) == 0x4) {\n\t\t\ttimeProperties.push(PROPERTY_NAME_CREATION_DATE);\n\t\t\ttimeRawProperties.push(PROPERTY_NAME_RAW_CREATION_DATE);\n\t\t}\n\t} else if (extraFieldExtendedTimestamp.data.length >= 5) {\n\t\ttimeProperties.push(PROPERTY_NAME_LAST_MODIFICATION_DATE);\n\t\ttimeRawProperties.push(PROPERTY_NAME_RAW_LAST_MODIFICATION_DATE);\n\t}\n\tlet offset = 1;\n\ttimeProperties.forEach((propertyName, indexProperty) => {\n\t\tif (extraFieldExtendedTimestamp.data.length >= offset + 4) {\n\t\t\tconst time = getUint32(extraFieldView, offset);\n\t\t\tdirectory[propertyName] = extraFieldExtendedTimestamp[propertyName] = new Date(time * 1000);\n\t\t\tconst rawPropertyName = timeRawProperties[indexProperty];\n\t\t\textraFieldExtendedTimestamp[rawPropertyName] = time;\n\t\t}\n\t\toffset += 4;\n\t});\n}\n\nasync function seekSignature(reader, signature, startOffset, minimumBytes, maximumLength) {\n\tconst signatureArray = new Uint8Array(4);\n\tconst signatureView = getDataView(signatureArray);\n\tsetUint32(signatureView, 0, signature);\n\tconst maximumBytes = minimumBytes + maximumLength;\n\treturn (await seek(minimumBytes)) || await seek(Math.min(maximumBytes, startOffset));\n\n\tasync function seek(length) {\n\t\tconst offset = startOffset - length;\n\t\tconst bytes = await readUint8Array(reader, offset, length);\n\t\tfor (let indexByte = bytes.length - minimumBytes; indexByte >= 0; indexByte--) {\n\t\t\tif (bytes[indexByte] == signatureArray[0] && bytes[indexByte + 1] == signatureArray[1] &&\n\t\t\t\tbytes[indexByte + 2] == signatureArray[2] && bytes[indexByte + 3] == signatureArray[3]) {\n\t\t\t\treturn {\n\t\t\t\t\toffset: offset + indexByte,\n\t\t\t\t\tbuffer: bytes.slice(indexByte, indexByte + minimumBytes).buffer\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunction getOptionValue(zipReader, options, name) {\n\treturn options[name] === UNDEFINED_VALUE ? zipReader.options[name] : options[name];\n}\n\nfunction getDate(timeRaw) {\n\tconst date = (timeRaw & 0xffff0000) >> 16, time = timeRaw & 0x0000ffff;\n\ttry {\n\t\treturn new Date(1980 + ((date & 0xFE00) >> 9), ((date & 0x01E0) >> 5) - 1, date & 0x001F, (time & 0xF800) >> 11, (time & 0x07E0) >> 5, (time & 0x001F) * 2, 0);\n\t} catch (_error) {\n\t\t// ignored\n\t}\n}\n\nfunction getDateNTFS(timeRaw) {\n\treturn new Date((Number((timeRaw / BigInt(10000)) - BigInt(11644473600000))));\n}\n\nfunction getUint8(view, offset) {\n\treturn view.getUint8(offset);\n}\n\nfunction getUint16(view, offset) {\n\treturn view.getUint16(offset, true);\n}\n\nfunction getUint32(view, offset) {\n\treturn view.getUint32(offset, true);\n}\n\nfunction getBigUint64(view, offset) {\n\treturn Number(view.getBigUint64(offset, true));\n}\n\nfunction setUint32(view, offset, value) {\n\tview.setUint32(offset, value, true);\n}\n\nfunction getDataView(array) {\n\treturn new DataView(array.buffer);\n}", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* global BigInt */\n// deno-lint-ignore-file no-this-alias\n\nimport {\n\tMAX_32_BITS,\n\tMAX_16_BITS,\n\tCOMPRESSION_METHOD_DEFLATE,\n\tCOMPRESSION_METHOD_STORE,\n\tCOMPRESSION_METHOD_AES,\n\tSPLIT_ZIP_FILE_SIGNATURE,\n\tLOCAL_FILE_HEADER_SIGNATURE,\n\tDATA_DESCRIPTOR_RECORD_SIGNATURE,\n\tCENTRAL_FILE_HEADER_SIGNATURE,\n\tEND_OF_CENTRAL_DIR_SIGNATURE,\n\tZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIGNATURE,\n\tZIP64_END_OF_CENTRAL_DIR_SIGNATURE,\n\tEXTRAFIELD_TYPE_AES,\n\tEXTRAFIELD_TYPE_ZIP64,\n\tEXTRAFIELD_TYPE_EXTENDED_TIMESTAMP,\n\tEXTRAFIELD_TYPE_NTFS,\n\tEXTRAFIELD_TYPE_NTFS_TAG1,\n\tEND_OF_CENTRAL_DIR_LENGTH,\n\tZIP64_END_OF_CENTRAL_DIR_LENGTH,\n\tZIP64_END_OF_CENTRAL_DIR_LOCATOR_LENGTH,\n\tZIP64_END_OF_CENTRAL_DIR_TOTAL_LENGTH,\n\tBITFLAG_ENCRYPTED,\n\tBITFLAG_DATA_DESCRIPTOR,\n\tBITFLAG_LANG_ENCODING_FLAG,\n\tFILE_ATTR_MSDOS_DIR_MASK,\n\tVERSION_DEFLATE,\n\tVERSION_ZIP64,\n\tVERSION_AES,\n\tDIRECTORY_SIGNATURE,\n\tMIN_DATE,\n\tMAX_DATE,\n\tUNDEFINED_VALUE\n} from \"./constants.js\";\nimport {\n\tgetConfiguration,\n\tgetChunkSize\n} from \"./configuration.js\";\nimport {\n\tCODEC_DEFLATE,\n\trunWorker\n} from \"./codec-pool.js\";\nimport {\n\tinitStream,\n\tinitReader,\n\tinitWriter,\n\tBlobWriter,\n\tSplitDataWriter\n} from \"./io.js\";\nimport { encodeText } from \"./util/encode-text.js\";\nimport {\n\tPROPERTY_NAME_LAST_MODIFICATION_DATE,\n\tPROPERTY_NAME_LAST_ACCESS_DATE,\n\tPROPERTY_NAME_CREATION_DATE,\n\tPROPERTY_NAME_INTERNAL_FILE_ATTRIBUTE,\n\tPROPERTY_NAME_EXTERNAL_FILE_ATTRIBUTE,\n\tPROPERTY_NAME_MS_DOS_COMPATIBLE,\n\tPROPERTY_NAME_ZIP64,\n\tEntry\n} from \"./zip-entry.js\";\n\nconst ERR_DUPLICATED_NAME = \"File already exists\";\nconst ERR_INVALID_COMMENT = \"Zip file comment exceeds 64KB\";\nconst ERR_INVALID_ENTRY_COMMENT = \"File entry comment exceeds 64KB\";\nconst ERR_INVALID_ENTRY_NAME = \"File entry name exceeds 64KB\";\nconst ERR_INVALID_VERSION = \"Version exceeds 65535\";\nconst ERR_INVALID_ENCRYPTION_STRENGTH = \"The strength must equal 1, 2, or 3\";\nconst ERR_INVALID_EXTRAFIELD_TYPE = \"Extra field type exceeds 65535\";\nconst ERR_INVALID_EXTRAFIELD_DATA = \"Extra field data exceeds 64KB\";\nconst ERR_UNSUPPORTED_FORMAT = \"Zip64 is not supported (make sure 'keepOrder' is set to 'true')\";\n\nconst EXTRAFIELD_DATA_AES = new Uint8Array([0x07, 0x00, 0x02, 0x00, 0x41, 0x45, 0x03, 0x00, 0x00]);\n\nlet workers = 0;\nconst pendingEntries = [];\n\nclass ZipWriter {\n\n\tconstructor(writer, options = {}) {\n\t\twriter = initWriter(writer);\n\t\tObject.assign(this, {\n\t\t\twriter,\n\t\t\taddSplitZipSignature: writer instanceof SplitDataWriter,\n\t\t\toptions,\n\t\t\tconfig: getConfiguration(),\n\t\t\tfiles: new Map(),\n\t\t\tfilenames: new Set(),\n\t\t\toffset: writer.writable.size,\n\t\t\tpendingEntriesSize: 0,\n\t\t\tpendingAddFileCalls: new Set(),\n\t\t\tbufferedWrites: 0\n\t\t});\n\t}\n\n\tasync add(name = \"\", reader, options = {}) {\n\t\tconst zipWriter = this;\n\t\tconst {\n\t\t\tpendingAddFileCalls,\n\t\t\tconfig\n\t\t} = zipWriter;\n\t\tif (workers < config.maxWorkers) {\n\t\t\tworkers++;\n\t\t} else {\n\t\t\tawait new Promise(resolve => pendingEntries.push(resolve));\n\t\t}\n\t\tlet promiseAddFile;\n\t\ttry {\n\t\t\tname = name.trim();\n\t\t\tif (zipWriter.filenames.has(name)) {\n\t\t\t\tthrow new Error(ERR_DUPLICATED_NAME);\n\t\t\t}\n\t\t\tzipWriter.filenames.add(name);\n\t\t\tpromiseAddFile = addFile(zipWriter, name, reader, options);\n\t\t\tpendingAddFileCalls.add(promiseAddFile);\n\t\t\treturn await promiseAddFile;\n\t\t} catch (error) {\n\t\t\tzipWriter.filenames.delete(name);\n\t\t\tthrow error;\n\t\t} finally {\n\t\t\tpendingAddFileCalls.delete(promiseAddFile);\n\t\t\tconst pendingEntry = pendingEntries.shift();\n\t\t\tif (pendingEntry) {\n\t\t\t\tpendingEntry();\n\t\t\t} else {\n\t\t\t\tworkers--;\n\t\t\t}\n\t\t}\n\t}\n\n\tasync close(comment = new Uint8Array(), options = {}) {\n\t\tconst zipWriter = this;\n\t\tconst { pendingAddFileCalls, writer } = this;\n\t\tconst { writable } = writer;\n\t\twhile (pendingAddFileCalls.size) {\n\t\t\tawait Promise.all(Array.from(pendingAddFileCalls));\n\t\t}\n\t\tawait closeFile(this, comment, options);\n\t\tconst preventClose = getOptionValue(zipWriter, options, \"preventClose\");\n\t\tif (!preventClose) {\n\t\t\tawait writable.getWriter().close();\n\t\t}\n\t\treturn writer.getData ? writer.getData() : writable;\n\t}\n}\n\nexport {\n\tZipWriter,\n\tERR_DUPLICATED_NAME,\n\tERR_INVALID_COMMENT,\n\tERR_INVALID_ENTRY_NAME,\n\tERR_INVALID_ENTRY_COMMENT,\n\tERR_INVALID_VERSION,\n\tERR_INVALID_EXTRAFIELD_TYPE,\n\tERR_INVALID_EXTRAFIELD_DATA,\n\tERR_INVALID_ENCRYPTION_STRENGTH,\n\tERR_UNSUPPORTED_FORMAT\n};\n\nasync function addFile(zipWriter, name, reader, options) {\n\tname = name.trim();\n\tif (options.directory && (!name.endsWith(DIRECTORY_SIGNATURE))) {\n\t\tname += DIRECTORY_SIGNATURE;\n\t} else {\n\t\toptions.directory = name.endsWith(DIRECTORY_SIGNATURE);\n\t}\n\tconst rawFilename = encodeText(name);\n\tif (getLength(rawFilename) > MAX_16_BITS) {\n\t\tthrow new Error(ERR_INVALID_ENTRY_NAME);\n\t}\n\tconst comment = options.comment || \"\";\n\tconst rawComment = encodeText(comment);\n\tif (getLength(rawComment) > MAX_16_BITS) {\n\t\tthrow new Error(ERR_INVALID_ENTRY_COMMENT);\n\t}\n\tconst version = getOptionValue(zipWriter, options, \"version\", VERSION_DEFLATE);\n\tif (version > MAX_16_BITS) {\n\t\tthrow new Error(ERR_INVALID_VERSION);\n\t}\n\tconst versionMadeBy = getOptionValue(zipWriter, options, \"versionMadeBy\", 20);\n\tif (versionMadeBy > MAX_16_BITS) {\n\t\tthrow new Error(ERR_INVALID_VERSION);\n\t}\n\tconst lastModDate = getOptionValue(zipWriter, options, PROPERTY_NAME_LAST_MODIFICATION_DATE, new Date());\n\tconst lastAccessDate = getOptionValue(zipWriter, options, PROPERTY_NAME_LAST_ACCESS_DATE);\n\tconst creationDate = getOptionValue(zipWriter, options, PROPERTY_NAME_CREATION_DATE);\n\tconst msDosCompatible = getOptionValue(zipWriter, options, PROPERTY_NAME_MS_DOS_COMPATIBLE, true);\n\tconst internalFileAttribute = getOptionValue(zipWriter, options, PROPERTY_NAME_INTERNAL_FILE_ATTRIBUTE, 0);\n\tconst externalFileAttribute = getOptionValue(zipWriter, options, PROPERTY_NAME_EXTERNAL_FILE_ATTRIBUTE, 0);\n\tconst password = getOptionValue(zipWriter, options, \"password\");\n\tconst encryptionStrength = getOptionValue(zipWriter, options, \"encryptionStrength\", 3);\n\tconst zipCrypto = getOptionValue(zipWriter, options, \"zipCrypto\");\n\tconst extendedTimestamp = getOptionValue(zipWriter, options, \"extendedTimestamp\", true);\n\tconst keepOrder = getOptionValue(zipWriter, options, \"keepOrder\", true);\n\tconst level = getOptionValue(zipWriter, options, \"level\");\n\tconst useWebWorkers = getOptionValue(zipWriter, options, \"useWebWorkers\");\n\tconst bufferedWrite = getOptionValue(zipWriter, options, \"bufferedWrite\");\n\tconst dataDescriptorSignature = getOptionValue(zipWriter, options, \"dataDescriptorSignature\", false);\n\tconst signal = getOptionValue(zipWriter, options, \"signal\");\n\tconst useCompressionStream = getOptionValue(zipWriter, options, \"useCompressionStream\");\n\tlet dataDescriptor = getOptionValue(zipWriter, options, \"dataDescriptor\", true);\n\tlet zip64 = getOptionValue(zipWriter, options, PROPERTY_NAME_ZIP64);\n\tif (password !== UNDEFINED_VALUE && encryptionStrength !== UNDEFINED_VALUE && (encryptionStrength < 1 || encryptionStrength > 3)) {\n\t\tthrow new Error(ERR_INVALID_ENCRYPTION_STRENGTH);\n\t}\n\tlet rawExtraField = new Uint8Array();\n\tconst { extraField } = options;\n\tif (extraField) {\n\t\tlet extraFieldSize = 0;\n\t\tlet offset = 0;\n\t\textraField.forEach(data => extraFieldSize += 4 + getLength(data));\n\t\trawExtraField = new Uint8Array(extraFieldSize);\n\t\textraField.forEach((data, type) => {\n\t\t\tif (type > MAX_16_BITS) {\n\t\t\t\tthrow new Error(ERR_INVALID_EXTRAFIELD_TYPE);\n\t\t\t}\n\t\t\tif (getLength(data) > MAX_16_BITS) {\n\t\t\t\tthrow new Error(ERR_INVALID_EXTRAFIELD_DATA);\n\t\t\t}\n\t\t\tarraySet(rawExtraField, new Uint16Array([type]), offset);\n\t\t\tarraySet(rawExtraField, new Uint16Array([getLength(data)]), offset + 2);\n\t\t\tarraySet(rawExtraField, data, offset + 4);\n\t\t\toffset += 4 + getLength(data);\n\t\t});\n\t}\n\tlet maximumCompressedSize = 0;\n\tlet maximumEntrySize = 0;\n\tlet uncompressedSize = 0;\n\tconst zip64Enabled = zip64 === true;\n\tif (reader) {\n\t\treader = initReader(reader);\n\t\tawait initStream(reader);\n\t\tif (reader.size === UNDEFINED_VALUE) {\n\t\t\tdataDescriptor = true;\n\t\t\tif (zip64 || zip64 === UNDEFINED_VALUE) {\n\t\t\t\tzip64 = true;\n\t\t\t\tuncompressedSize = maximumCompressedSize = MAX_32_BITS;\n\t\t\t}\n\t\t} else {\n\t\t\tuncompressedSize = reader.size;\n\t\t\tmaximumCompressedSize = getMaximumCompressedSize(uncompressedSize);\n\t\t}\n\t}\n\tconst { diskOffset, diskNumber, maxSize } = zipWriter.writer;\n\tconst zip64UncompressedSize = zip64Enabled || uncompressedSize >= MAX_32_BITS;\n\tconst zip64CompressedSize = zip64Enabled || maximumCompressedSize >= MAX_32_BITS;\n\tconst zip64Offset = zip64Enabled || zipWriter.offset + zipWriter.pendingEntriesSize - diskOffset >= MAX_32_BITS;\n\tconst supportZip64SplitFile = getOptionValue(zipWriter, options, \"supportZip64SplitFile\", true);\n\tconst zip64DiskNumberStart = (supportZip64SplitFile && zip64Enabled) || diskNumber + Math.ceil(zipWriter.pendingEntriesSize / maxSize) >= MAX_16_BITS;\n\tif (zip64Offset || zip64UncompressedSize || zip64CompressedSize || zip64DiskNumberStart) {\n\t\tif (zip64 === false || !keepOrder) {\n\t\t\tthrow new Error(ERR_UNSUPPORTED_FORMAT);\n\t\t} else {\n\t\t\tzip64 = true;\n\t\t}\n\t}\n\tzip64 = zip64 || false;\n\toptions = Object.assign({}, options, {\n\t\trawFilename,\n\t\trawComment,\n\t\tversion,\n\t\tversionMadeBy,\n\t\tlastModDate,\n\t\tlastAccessDate,\n\t\tcreationDate,\n\t\trawExtraField,\n\t\tzip64,\n\t\tzip64UncompressedSize,\n\t\tzip64CompressedSize,\n\t\tzip64Offset,\n\t\tzip64DiskNumberStart,\n\t\tpassword,\n\t\tlevel,\n\t\tuseWebWorkers,\n\t\tencryptionStrength,\n\t\textendedTimestamp,\n\t\tzipCrypto,\n\t\tbufferedWrite,\n\t\tkeepOrder,\n\t\tdataDescriptor,\n\t\tdataDescriptorSignature,\n\t\tsignal,\n\t\tmsDosCompatible,\n\t\tinternalFileAttribute,\n\t\texternalFileAttribute,\n\t\tuseCompressionStream\n\t});\n\tconst headerInfo = getHeaderInfo(options);\n\tconst dataDescriptorInfo = getDataDescriptorInfo(options);\n\tconst metadataSize = getLength(headerInfo.localHeaderArray, dataDescriptorInfo.dataDescriptorArray);\n\tmaximumEntrySize = metadataSize + maximumCompressedSize;\n\tzipWriter.pendingEntriesSize += maximumEntrySize;\n\tlet fileEntry;\n\ttry {\n\t\tfileEntry = await getFileEntry(zipWriter, name, reader, { headerInfo, dataDescriptorInfo, metadataSize }, options);\n\t} finally {\n\t\tzipWriter.pendingEntriesSize -= maximumEntrySize;\n\t}\n\tObject.assign(fileEntry, { name, comment, extraField });\n\treturn new Entry(fileEntry);\n}\n\nasync function getFileEntry(zipWriter, name, reader, entryInfo, options) {\n\tconst {\n\t\tfiles,\n\t\twriter\n\t} = zipWriter;\n\tconst {\n\t\tkeepOrder,\n\t\tdataDescriptor,\n\t\tsignal\n\t} = options;\n\tconst {\n\t\theaderInfo\n\t} = entryInfo;\n\tconst previousFileEntry = Array.from(files.values()).pop();\n\tlet fileEntry = {};\n\tlet bufferedWrite;\n\tlet releaseLockWriter;\n\tlet releaseLockCurrentFileEntry;\n\tlet writingBufferedEntryData;\n\tlet writingEntryData;\n\tlet fileWriter;\n\tfiles.set(name, fileEntry);\n\ttry {\n\t\tlet lockPreviousFileEntry;\n\t\tif (keepOrder) {\n\t\t\tlockPreviousFileEntry = previousFileEntry && previousFileEntry.lock;\n\t\t\trequestLockCurrentFileEntry();\n\t\t}\n\t\tif (options.bufferedWrite || zipWriter.writerLocked || (zipWriter.bufferedWrites && keepOrder) || !dataDescriptor) {\n\t\t\tfileWriter = new BlobWriter();\n\t\t\tfileWriter.writable.size = 0;\n\t\t\tbufferedWrite = true;\n\t\t\tzipWriter.bufferedWrites++;\n\t\t\tawait initStream(writer);\n\t\t} else {\n\t\t\tfileWriter = writer;\n\t\t\tawait requestLockWriter();\n\t\t}\n\t\tawait initStream(fileWriter);\n\t\tconst { writable } = writer;\n\t\tlet { diskOffset } = writer;\n\t\tif (zipWriter.addSplitZipSignature) {\n\t\t\tdelete zipWriter.addSplitZipSignature;\n\t\t\tconst signatureArray = new Uint8Array(4);\n\t\t\tconst signatureArrayView = getDataView(signatureArray);\n\t\t\tsetUint32(signatureArrayView, 0, SPLIT_ZIP_FILE_SIGNATURE);\n\t\t\tawait writeData(writable, signatureArray);\n\t\t\tzipWriter.offset += 4;\n\t\t}\n\t\tif (!bufferedWrite) {\n\t\t\tawait lockPreviousFileEntry;\n\t\t\tawait skipDiskIfNeeded(writable);\n\t\t}\n\t\tconst { diskNumber } = writer;\n\t\twritingEntryData = true;\n\t\tfileEntry.diskNumberStart = diskNumber;\n\t\tfileEntry = await createFileEntry(reader, fileWriter, fileEntry, entryInfo, zipWriter.config, options);\n\t\twritingEntryData = false;\n\t\tfiles.set(name, fileEntry);\n\t\tfileEntry.filename = name;\n\t\tif (bufferedWrite) {\n\t\t\tawait fileWriter.writable.getWriter().close();\n\t\t\tlet blob = await fileWriter.getData();\n\t\t\tawait lockPreviousFileEntry;\n\t\t\tawait requestLockWriter();\n\t\t\twritingBufferedEntryData = true;\n\t\t\tif (!dataDescriptor) {\n\t\t\t\tblob = await writeExtraHeaderInfo(fileEntry, blob, writable, options);\n\t\t\t}\n\t\t\tawait skipDiskIfNeeded(writable);\n\t\t\tfileEntry.diskNumberStart = writer.diskNumber;\n\t\t\tdiskOffset = writer.diskOffset;\n\t\t\tawait blob.stream().pipeTo(writable, { preventClose: true, preventAbort: true, signal });\n\t\t\twritable.size += blob.size;\n\t\t\twritingBufferedEntryData = false;\n\t\t}\n\t\tfileEntry.offset = zipWriter.offset - diskOffset;\n\t\tif (fileEntry.zip64) {\n\t\t\tsetZip64ExtraInfo(fileEntry, options);\n\t\t} else if (fileEntry.offset >= MAX_32_BITS) {\n\t\t\tthrow new Error(ERR_UNSUPPORTED_FORMAT);\n\t\t}\n\t\tzipWriter.offset += fileEntry.length;\n\t\treturn fileEntry;\n\t} catch (error) {\n\t\tif ((bufferedWrite && writingBufferedEntryData) || (!bufferedWrite && writingEntryData)) {\n\t\t\tzipWriter.hasCorruptedEntries = true;\n\t\t\tif (error) {\n\t\t\t\ttry {\n\t\t\t\t\terror.corruptedEntry = true;\n\t\t\t\t} catch (_error) {\n\t\t\t\t\t// ignored\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (bufferedWrite) {\n\t\t\t\tzipWriter.offset += fileWriter.writable.size;\n\t\t\t} else {\n\t\t\t\tzipWriter.offset = fileWriter.writable.size;\n\t\t\t}\n\t\t}\n\t\tfiles.delete(name);\n\t\tthrow error;\n\t} finally {\n\t\tif (bufferedWrite) {\n\t\t\tzipWriter.bufferedWrites--;\n\t\t}\n\t\tif (releaseLockCurrentFileEntry) {\n\t\t\treleaseLockCurrentFileEntry();\n\t\t}\n\t\tif (releaseLockWriter) {\n\t\t\treleaseLockWriter();\n\t\t}\n\t}\n\n\tfunction requestLockCurrentFileEntry() {\n\t\tfileEntry.lock = new Promise(resolve => releaseLockCurrentFileEntry = resolve);\n\t}\n\n\tasync function requestLockWriter() {\n\t\tzipWriter.writerLocked = true;\n\t\tconst { lockWriter } = zipWriter;\n\t\tzipWriter.lockWriter = new Promise(resolve => releaseLockWriter = () => {\n\t\t\tzipWriter.writerLocked = false;\n\t\t\tresolve();\n\t\t});\n\t\tawait lockWriter;\n\t}\n\n\tasync function skipDiskIfNeeded(writable) {\n\t\tif (headerInfo.localHeaderArray.length > writer.availableSize) {\n\t\t\twriter.availableSize = 0;\n\t\t\tawait writeData(writable, new Uint8Array());\n\t\t}\n\t}\n}\n\nasync function createFileEntry(reader, writer, { diskNumberStart, lock }, entryInfo, config, options) {\n\tconst {\n\t\theaderInfo,\n\t\tdataDescriptorInfo,\n\t\tmetadataSize\n\t} = entryInfo;\n\tconst {\n\t\tlocalHeaderArray,\n\t\theaderArray,\n\t\tlastModDate,\n\t\trawLastModDate,\n\t\tencrypted,\n\t\tcompressed,\n\t\tversion,\n\t\tcompressionMethod,\n\t\trawExtraFieldExtendedTimestamp,\n\t\textraFieldExtendedTimestampFlag,\n\t\trawExtraFieldNTFS,\n\t\trawExtraFieldAES\n\t} = headerInfo;\n\tconst { dataDescriptorArray } = dataDescriptorInfo;\n\tconst {\n\t\trawFilename,\n\t\tlastAccessDate,\n\t\tcreationDate,\n\t\tpassword,\n\t\tlevel,\n\t\tzip64,\n\t\tzip64UncompressedSize,\n\t\tzip64CompressedSize,\n\t\tzip64Offset,\n\t\tzip64DiskNumberStart,\n\t\tzipCrypto,\n\t\tdataDescriptor,\n\t\tdirectory,\n\t\tversionMadeBy,\n\t\trawComment,\n\t\trawExtraField,\n\t\tuseWebWorkers,\n\t\tonstart,\n\t\tonprogress,\n\t\tonend,\n\t\tsignal,\n\t\tencryptionStrength,\n\t\textendedTimestamp,\n\t\tmsDosCompatible,\n\t\tinternalFileAttribute,\n\t\texternalFileAttribute,\n\t\tuseCompressionStream\n\t} = options;\n\tconst fileEntry = {\n\t\tlock,\n\t\tversionMadeBy,\n\t\tzip64,\n\t\tdirectory: Boolean(directory),\n\t\tfilenameUTF8: true,\n\t\trawFilename,\n\t\tcommentUTF8: true,\n\t\trawComment,\n\t\trawExtraFieldExtendedTimestamp,\n\t\trawExtraFieldNTFS,\n\t\trawExtraFieldAES,\n\t\trawExtraField,\n\t\textendedTimestamp,\n\t\tmsDosCompatible,\n\t\tinternalFileAttribute,\n\t\texternalFileAttribute,\n\t\tdiskNumberStart\n\t};\n\tlet compressedSize = 0;\n\tlet uncompressedSize = 0;\n\tlet signature;\n\tconst { writable } = writer;\n\tif (reader) {\n\t\treader.chunkSize = getChunkSize(config);\n\t\tawait writeData(writable, localHeaderArray);\n\t\tconst readable = reader.readable;\n\t\tconst size = readable.size = reader.size;\n\t\tconst workerOptions = {\n\t\t\toptions: {\n\t\t\t\tcodecType: CODEC_DEFLATE,\n\t\t\t\tlevel,\n\t\t\t\tpassword,\n\t\t\t\tencryptionStrength,\n\t\t\t\tzipCrypto: encrypted && zipCrypto,\n\t\t\t\tpasswordVerification: encrypted && zipCrypto && (rawLastModDate >> 8) & 0xFF,\n\t\t\t\tsigned: true,\n\t\t\t\tcompressed,\n\t\t\t\tencrypted,\n\t\t\t\tuseWebWorkers,\n\t\t\t\tuseCompressionStream,\n\t\t\t\ttransferStreams: false\n\t\t\t},\n\t\t\tconfig,\n\t\t\tstreamOptions: { signal, size, onstart, onprogress, onend }\n\t\t};\n\t\tconst result = await runWorker({ readable, writable }, workerOptions);\n\t\twritable.size += result.size;\n\t\tsignature = result.signature;\n\t\tuncompressedSize = reader.size = readable.size;\n\t\tcompressedSize = result.size;\n\t} else {\n\t\tawait writeData(writable, localHeaderArray);\n\t}\n\tlet rawExtraFieldZip64;\n\tif (zip64) {\n\t\tlet rawExtraFieldZip64Length = 4;\n\t\tif (zip64UncompressedSize) {\n\t\t\trawExtraFieldZip64Length += 8;\n\t\t}\n\t\tif (zip64CompressedSize) {\n\t\t\trawExtraFieldZip64Length += 8;\n\t\t}\n\t\tif (zip64Offset) {\n\t\t\trawExtraFieldZip64Length += 8;\n\t\t}\n\t\tif (zip64DiskNumberStart) {\n\t\t\trawExtraFieldZip64Length += 4;\n\t\t}\n\t\trawExtraFieldZip64 = new Uint8Array(rawExtraFieldZip64Length);\n\t} else {\n\t\trawExtraFieldZip64 = new Uint8Array();\n\t}\n\tsetEntryInfo({\n\t\tsignature,\n\t\trawExtraFieldZip64,\n\t\tcompressedSize,\n\t\tuncompressedSize,\n\t\theaderInfo,\n\t\tdataDescriptorInfo\n\t}, options);\n\tif (dataDescriptor) {\n\t\tawait writeData(writable, dataDescriptorArray);\n\t}\n\tObject.assign(fileEntry, {\n\t\tuncompressedSize,\n\t\tcompressedSize,\n\t\tlastModDate,\n\t\trawLastModDate,\n\t\tcreationDate,\n\t\tlastAccessDate,\n\t\tencrypted,\n\t\tlength: metadataSize + compressedSize,\n\t\tcompressionMethod,\n\t\tversion,\n\t\theaderArray,\n\t\tsignature,\n\t\trawExtraFieldZip64,\n\t\textraFieldExtendedTimestampFlag,\n\t\tzip64UncompressedSize,\n\t\tzip64CompressedSize,\n\t\tzip64Offset,\n\t\tzip64DiskNumberStart\n\t});\n\treturn fileEntry;\n}\n\nfunction getHeaderInfo(options) {\n\tconst {\n\t\trawFilename,\n\t\tlastModDate,\n\t\tlastAccessDate,\n\t\tcreationDate,\n\t\tpassword,\n\t\tlevel,\n\t\tzip64,\n\t\tzipCrypto,\n\t\tdataDescriptor,\n\t\tdirectory,\n\t\trawExtraField,\n\t\tencryptionStrength,\n\t\textendedTimestamp\n\t} = options;\n\tconst compressed = level !== 0 && !directory;\n\tconst encrypted = Boolean(password && getLength(password));\n\tlet version = options.version;\n\tlet rawExtraFieldAES;\n\tif (encrypted && !zipCrypto) {\n\t\trawExtraFieldAES = new Uint8Array(getLength(EXTRAFIELD_DATA_AES) + 2);\n\t\tconst extraFieldAESView = getDataView(rawExtraFieldAES);\n\t\tsetUint16(extraFieldAESView, 0, EXTRAFIELD_TYPE_AES);\n\t\tarraySet(rawExtraFieldAES, EXTRAFIELD_DATA_AES, 2);\n\t\tsetUint8(extraFieldAESView, 8, encryptionStrength);\n\t} else {\n\t\trawExtraFieldAES = new Uint8Array();\n\t}\n\tlet rawExtraFieldNTFS;\n\tlet rawExtraFieldExtendedTimestamp;\n\tlet extraFieldExtendedTimestampFlag;\n\tif (extendedTimestamp) {\n\t\trawExtraFieldExtendedTimestamp = new Uint8Array(9 + (lastAccessDate ? 4 : 0) + (creationDate ? 4 : 0));\n\t\tconst extraFieldExtendedTimestampView = getDataView(rawExtraFieldExtendedTimestamp);\n\t\tsetUint16(extraFieldExtendedTimestampView, 0, EXTRAFIELD_TYPE_EXTENDED_TIMESTAMP);\n\t\tsetUint16(extraFieldExtendedTimestampView, 2, getLength(rawExtraFieldExtendedTimestamp) - 4);\n\t\textraFieldExtendedTimestampFlag = 0x1 + (lastAccessDate ? 0x2 : 0) + (creationDate ? 0x4 : 0);\n\t\tsetUint8(extraFieldExtendedTimestampView, 4, extraFieldExtendedTimestampFlag);\n\t\tlet offset = 5;\n\t\tsetUint32(extraFieldExtendedTimestampView, offset, Math.floor(lastModDate.getTime() / 1000));\n\t\toffset += 4;\n\t\tif (lastAccessDate) {\n\t\t\tsetUint32(extraFieldExtendedTimestampView, offset, Math.floor(lastAccessDate.getTime() / 1000));\n\t\t\toffset += 4;\n\t\t}\n\t\tif (creationDate) {\n\t\t\tsetUint32(extraFieldExtendedTimestampView, offset, Math.floor(creationDate.getTime() / 1000));\n\t\t}\n\t\ttry {\n\t\t\trawExtraFieldNTFS = new Uint8Array(36);\n\t\t\tconst extraFieldNTFSView = getDataView(rawExtraFieldNTFS);\n\t\t\tconst lastModTimeNTFS = getTimeNTFS(lastModDate);\n\t\t\tsetUint16(extraFieldNTFSView, 0, EXTRAFIELD_TYPE_NTFS);\n\t\t\tsetUint16(extraFieldNTFSView, 2, 32);\n\t\t\tsetUint16(extraFieldNTFSView, 8, EXTRAFIELD_TYPE_NTFS_TAG1);\n\t\t\tsetUint16(extraFieldNTFSView, 10, 24);\n\t\t\tsetBigUint64(extraFieldNTFSView, 12, lastModTimeNTFS);\n\t\t\tsetBigUint64(extraFieldNTFSView, 20, getTimeNTFS(lastAccessDate) || lastModTimeNTFS);\n\t\t\tsetBigUint64(extraFieldNTFSView, 28, getTimeNTFS(creationDate) || lastModTimeNTFS);\n\t\t} catch (_error) {\n\t\t\trawExtraFieldNTFS = new Uint8Array();\n\t\t}\n\t} else {\n\t\trawExtraFieldNTFS = rawExtraFieldExtendedTimestamp = new Uint8Array();\n\t}\n\tlet bitFlag = BITFLAG_LANG_ENCODING_FLAG;\n\tif (dataDescriptor) {\n\t\tbitFlag = bitFlag | BITFLAG_DATA_DESCRIPTOR;\n\t}\n\tlet compressionMethod = COMPRESSION_METHOD_STORE;\n\tif (compressed) {\n\t\tcompressionMethod = COMPRESSION_METHOD_DEFLATE;\n\t}\n\tif (zip64) {\n\t\tversion = version > VERSION_ZIP64 ? version : VERSION_ZIP64;\n\t}\n\tif (encrypted) {\n\t\tbitFlag = bitFlag | BITFLAG_ENCRYPTED;\n\t\tif (!zipCrypto) {\n\t\t\tversion = version > VERSION_AES ? version : VERSION_AES;\n\t\t\tcompressionMethod = COMPRESSION_METHOD_AES;\n\t\t\tif (compressed) {\n\t\t\t\trawExtraFieldAES[9] = COMPRESSION_METHOD_DEFLATE;\n\t\t\t}\n\t\t}\n\t}\n\tconst headerArray = new Uint8Array(26);\n\tconst headerView = getDataView(headerArray);\n\tsetUint16(headerView, 0, version);\n\tsetUint16(headerView, 2, bitFlag);\n\tsetUint16(headerView, 4, compressionMethod);\n\tconst dateArray = new Uint32Array(1);\n\tconst dateView = getDataView(dateArray);\n\tlet lastModDateMsDos;\n\tif (lastModDate < MIN_DATE) {\n\t\tlastModDateMsDos = MIN_DATE;\n\t} else if (lastModDate > MAX_DATE) {\n\t\tlastModDateMsDos = MAX_DATE;\n\t} else {\n\t\tlastModDateMsDos = lastModDate;\n\t}\n\tsetUint16(dateView, 0, (((lastModDateMsDos.getHours() << 6) | lastModDateMsDos.getMinutes()) << 5) | lastModDateMsDos.getSeconds() / 2);\n\tsetUint16(dateView, 2, ((((lastModDateMsDos.getFullYear() - 1980) << 4) | (lastModDateMsDos.getMonth() + 1)) << 5) | lastModDateMsDos.getDate());\n\tconst rawLastModDate = dateArray[0];\n\tsetUint32(headerView, 6, rawLastModDate);\n\tsetUint16(headerView, 22, getLength(rawFilename));\n\tconst extraFieldLength = getLength(rawExtraFieldAES, rawExtraFieldExtendedTimestamp, rawExtraFieldNTFS, rawExtraField);\n\tsetUint16(headerView, 24, extraFieldLength);\n\tconst localHeaderArray = new Uint8Array(30 + getLength(rawFilename) + extraFieldLength);\n\tconst localHeaderView = getDataView(localHeaderArray);\n\tsetUint32(localHeaderView, 0, LOCAL_FILE_HEADER_SIGNATURE);\n\tarraySet(localHeaderArray, headerArray, 4);\n\tarraySet(localHeaderArray, rawFilename, 30);\n\tarraySet(localHeaderArray, rawExtraFieldAES, 30 + getLength(rawFilename));\n\tarraySet(localHeaderArray, rawExtraFieldExtendedTimestamp, 30 + getLength(rawFilename, rawExtraFieldAES));\n\tarraySet(localHeaderArray, rawExtraFieldNTFS, 30 + getLength(rawFilename, rawExtraFieldAES, rawExtraFieldExtendedTimestamp));\n\tarraySet(localHeaderArray, rawExtraField, 30 + getLength(rawFilename, rawExtraFieldAES, rawExtraFieldExtendedTimestamp, rawExtraFieldNTFS));\n\treturn {\n\t\tlocalHeaderArray,\n\t\theaderArray,\n\t\theaderView,\n\t\tlastModDate,\n\t\trawLastModDate,\n\t\tencrypted,\n\t\tcompressed,\n\t\tversion,\n\t\tcompressionMethod,\n\t\textraFieldExtendedTimestampFlag,\n\t\trawExtraFieldExtendedTimestamp,\n\t\trawExtraFieldNTFS,\n\t\trawExtraFieldAES\n\t};\n}\n\nfunction getDataDescriptorInfo(options) {\n\tconst {\n\t\tzip64,\n\t\tdataDescriptor,\n\t\tdataDescriptorSignature\n\t} = options;\n\tlet dataDescriptorArray = new Uint8Array();\n\tlet dataDescriptorView, dataDescriptorOffset = 0;\n\tif (dataDescriptor) {\n\t\tdataDescriptorArray = new Uint8Array(zip64 ? (dataDescriptorSignature ? 24 : 20) : (dataDescriptorSignature ? 16 : 12));\n\t\tdataDescriptorView = getDataView(dataDescriptorArray);\n\t\tif (dataDescriptorSignature) {\n\t\t\tdataDescriptorOffset = 4;\n\t\t\tsetUint32(dataDescriptorView, 0, DATA_DESCRIPTOR_RECORD_SIGNATURE);\n\t\t}\n\t}\n\treturn {\n\t\tdataDescriptorArray,\n\t\tdataDescriptorView,\n\t\tdataDescriptorOffset\n\t};\n}\n\nfunction setEntryInfo(entryInfo, options) {\n\tconst {\n\t\tsignature,\n\t\trawExtraFieldZip64,\n\t\tcompressedSize,\n\t\tuncompressedSize,\n\t\theaderInfo,\n\t\tdataDescriptorInfo\n\t} = entryInfo;\n\tconst {\n\t\theaderView,\n\t\tencrypted\n\t} = headerInfo;\n\tconst {\n\t\tdataDescriptorView,\n\t\tdataDescriptorOffset\n\t} = dataDescriptorInfo;\n\tconst {\n\t\tzip64,\n\t\tzip64UncompressedSize,\n\t\tzip64CompressedSize,\n\t\tzipCrypto,\n\t\tdataDescriptor\n\t} = options;\n\tif ((!encrypted || zipCrypto) && signature !== UNDEFINED_VALUE) {\n\t\tsetUint32(headerView, 10, signature);\n\t\tif (dataDescriptor) {\n\t\t\tsetUint32(dataDescriptorView, dataDescriptorOffset, signature);\n\t\t}\n\t}\n\tif (zip64) {\n\t\tconst rawExtraFieldZip64View = getDataView(rawExtraFieldZip64);\n\t\tsetUint16(rawExtraFieldZip64View, 0, EXTRAFIELD_TYPE_ZIP64);\n\t\tsetUint16(rawExtraFieldZip64View, 2, rawExtraFieldZip64.length - 4);\n\t\tlet rawExtraFieldZip64Offset = 4;\n\t\tif (zip64UncompressedSize) {\n\t\t\tsetUint32(headerView, 18, MAX_32_BITS);\n\t\t\tsetBigUint64(rawExtraFieldZip64View, rawExtraFieldZip64Offset, BigInt(uncompressedSize));\n\t\t\trawExtraFieldZip64Offset += 8;\n\t\t}\n\t\tif (zip64CompressedSize) {\n\t\t\tsetUint32(headerView, 14, MAX_32_BITS);\n\t\t\tsetBigUint64(rawExtraFieldZip64View, rawExtraFieldZip64Offset, BigInt(compressedSize));\n\t\t}\n\t\tif (dataDescriptor) {\n\t\t\tsetBigUint64(dataDescriptorView, dataDescriptorOffset + 4, BigInt(compressedSize));\n\t\t\tsetBigUint64(dataDescriptorView, dataDescriptorOffset + 12, BigInt(uncompressedSize));\n\t\t}\n\t} else {\n\t\tsetUint32(headerView, 14, compressedSize);\n\t\tsetUint32(headerView, 18, uncompressedSize);\n\t\tif (dataDescriptor) {\n\t\t\tsetUint32(dataDescriptorView, dataDescriptorOffset + 4, compressedSize);\n\t\t\tsetUint32(dataDescriptorView, dataDescriptorOffset + 8, uncompressedSize);\n\t\t}\n\t}\n}\n\nasync function writeExtraHeaderInfo(fileEntry, entryData, writable, { zipCrypto }) {\n\tlet arrayBuffer;\n\tarrayBuffer = await entryData.slice(0, 26).arrayBuffer();\n\tif (arrayBuffer.byteLength != 26) {\n\t\tarrayBuffer = arrayBuffer.slice(0, 26);\n\t}\n\tconst arrayBufferView = new DataView(arrayBuffer);\n\tif (!fileEntry.encrypted || zipCrypto) {\n\t\tsetUint32(arrayBufferView, 14, fileEntry.signature);\n\t}\n\tif (fileEntry.zip64) {\n\t\tsetUint32(arrayBufferView, 18, MAX_32_BITS);\n\t\tsetUint32(arrayBufferView, 22, MAX_32_BITS);\n\t} else {\n\t\tsetUint32(arrayBufferView, 18, fileEntry.compressedSize);\n\t\tsetUint32(arrayBufferView, 22, fileEntry.uncompressedSize);\n\t}\n\tawait writeData(writable, new Uint8Array(arrayBuffer));\n\treturn entryData.slice(arrayBuffer.byteLength);\n}\n\nfunction setZip64ExtraInfo(fileEntry, options) {\n\tconst { rawExtraFieldZip64, offset, diskNumberStart } = fileEntry;\n\tconst { zip64UncompressedSize, zip64CompressedSize, zip64Offset, zip64DiskNumberStart } = options;\n\tconst rawExtraFieldZip64View = getDataView(rawExtraFieldZip64);\n\tlet rawExtraFieldZip64Offset = 4;\n\tif (zip64UncompressedSize) {\n\t\trawExtraFieldZip64Offset += 8;\n\t}\n\tif (zip64CompressedSize) {\n\t\trawExtraFieldZip64Offset += 8;\n\t}\n\tif (zip64Offset) {\n\t\tsetBigUint64(rawExtraFieldZip64View, rawExtraFieldZip64Offset, BigInt(offset));\n\t\trawExtraFieldZip64Offset += 8;\n\t}\n\tif (zip64DiskNumberStart) {\n\t\tsetUint32(rawExtraFieldZip64View, rawExtraFieldZip64Offset, diskNumberStart);\n\t}\n}\n\nasync function closeFile(zipWriter, comment, options) {\n\tconst { files, writer } = zipWriter;\n\tconst { diskOffset, writable } = writer;\n\tlet { diskNumber } = writer;\n\tlet offset = 0;\n\tlet directoryDataLength = 0;\n\tlet directoryOffset = zipWriter.offset - diskOffset;\n\tlet filesLength = files.size;\n\tfor (const [, fileEntry] of files) {\n\t\tconst {\n\t\t\trawFilename,\n\t\t\trawExtraFieldZip64,\n\t\t\trawExtraFieldAES,\n\t\t\trawComment,\n\t\t\trawExtraFieldNTFS,\n\t\t\trawExtraField,\n\t\t\textendedTimestamp,\n\t\t\textraFieldExtendedTimestampFlag,\n\t\t\tlastModDate\n\t\t} = fileEntry;\n\t\tlet rawExtraFieldTimestamp;\n\t\tif (extendedTimestamp) {\n\t\t\trawExtraFieldTimestamp = new Uint8Array(9);\n\t\t\tconst extraFieldExtendedTimestampView = getDataView(rawExtraFieldTimestamp);\n\t\t\tsetUint16(extraFieldExtendedTimestampView, 0, EXTRAFIELD_TYPE_EXTENDED_TIMESTAMP);\n\t\t\tsetUint16(extraFieldExtendedTimestampView, 2, 5);\n\t\t\tsetUint8(extraFieldExtendedTimestampView, 4, extraFieldExtendedTimestampFlag);\n\t\t\tsetUint32(extraFieldExtendedTimestampView, 5, Math.floor(lastModDate.getTime() / 1000));\n\t\t} else {\n\t\t\trawExtraFieldTimestamp = new Uint8Array();\n\t\t}\n\t\tfileEntry.rawExtraFieldCDExtendedTimestamp = rawExtraFieldTimestamp;\n\t\tdirectoryDataLength += 46 +\n\t\t\tgetLength(\n\t\t\t\trawFilename,\n\t\t\t\trawComment,\n\t\t\t\trawExtraFieldZip64,\n\t\t\t\trawExtraFieldAES,\n\t\t\t\trawExtraFieldNTFS,\n\t\t\t\trawExtraFieldTimestamp,\n\t\t\t\trawExtraField);\n\t}\n\tconst directoryArray = new Uint8Array(directoryDataLength);\n\tconst directoryView = getDataView(directoryArray);\n\tawait initStream(writer);\n\tlet directoryDiskOffset = 0;\n\tfor (const [indexFileEntry, fileEntry] of Array.from(files.values()).entries()) {\n\t\tconst {\n\t\t\toffset: fileEntryOffset,\n\t\t\trawFilename,\n\t\t\trawExtraFieldZip64,\n\t\t\trawExtraFieldAES,\n\t\t\trawExtraFieldCDExtendedTimestamp,\n\t\t\trawExtraFieldNTFS,\n\t\t\trawExtraField,\n\t\t\trawComment,\n\t\t\tversionMadeBy,\n\t\t\theaderArray,\n\t\t\tdirectory,\n\t\t\tzip64,\n\t\t\tzip64UncompressedSize,\n\t\t\tzip64CompressedSize,\n\t\t\tzip64DiskNumberStart,\n\t\t\tzip64Offset,\n\t\t\tmsDosCompatible,\n\t\t\tinternalFileAttribute,\n\t\t\texternalFileAttribute,\n\t\t\tdiskNumberStart,\n\t\t\tuncompressedSize,\n\t\t\tcompressedSize\n\t\t} = fileEntry;\n\t\tconst extraFieldLength = getLength(rawExtraFieldZip64, rawExtraFieldAES, rawExtraFieldCDExtendedTimestamp, rawExtraFieldNTFS, rawExtraField);\n\t\tsetUint32(directoryView, offset, CENTRAL_FILE_HEADER_SIGNATURE);\n\t\tsetUint16(directoryView, offset + 4, versionMadeBy);\n\t\tconst headerView = getDataView(headerArray);\n\t\tif (!zip64UncompressedSize) {\n\t\t\tsetUint32(headerView, 18, uncompressedSize);\n\t\t}\n\t\tif (!zip64CompressedSize) {\n\t\t\tsetUint32(headerView, 14, compressedSize);\n\t\t}\n\t\tarraySet(directoryArray, headerArray, offset + 6);\n\t\tsetUint16(directoryView, offset + 30, extraFieldLength);\n\t\tsetUint16(directoryView, offset + 32, getLength(rawComment));\n\t\tsetUint16(directoryView, offset + 34, zip64 && zip64DiskNumberStart ? MAX_16_BITS : diskNumberStart);\n\t\tsetUint16(directoryView, offset + 36, internalFileAttribute);\n\t\tif (externalFileAttribute) {\n\t\t\tsetUint32(directoryView, offset + 38, externalFileAttribute);\n\t\t} else if (directory && msDosCompatible) {\n\t\t\tsetUint8(directoryView, offset + 38, FILE_ATTR_MSDOS_DIR_MASK);\n\t\t}\n\t\tsetUint32(directoryView, offset + 42, zip64 && zip64Offset ? MAX_32_BITS : fileEntryOffset);\n\t\tarraySet(directoryArray, rawFilename, offset + 46);\n\t\tarraySet(directoryArray, rawExtraFieldZip64, offset + 46 + getLength(rawFilename));\n\t\tarraySet(directoryArray, rawExtraFieldAES, offset + 46 + getLength(rawFilename, rawExtraFieldZip64));\n\t\tarraySet(directoryArray, rawExtraFieldCDExtendedTimestamp, offset + 46 + getLength(rawFilename, rawExtraFieldZip64, rawExtraFieldAES));\n\t\tarraySet(directoryArray, rawExtraFieldNTFS, offset + 46 + getLength(rawFilename, rawExtraFieldZip64, rawExtraFieldAES, rawExtraFieldCDExtendedTimestamp));\n\t\tarraySet(directoryArray, rawExtraField, offset + 46 + getLength(rawFilename, rawExtraFieldZip64, rawExtraFieldAES, rawExtraFieldCDExtendedTimestamp, rawExtraFieldNTFS));\n\t\tarraySet(directoryArray, rawComment, offset + 46 + getLength(rawFilename) + extraFieldLength);\n\t\tconst directoryEntryLength = 46 + getLength(rawFilename, rawComment) + extraFieldLength;\n\t\tif (offset - directoryDiskOffset > writer.availableSize) {\n\t\t\twriter.availableSize = 0;\n\t\t\tawait writeData(writable, directoryArray.slice(directoryDiskOffset, offset));\n\t\t\tdirectoryDiskOffset = offset;\n\t\t}\n\t\toffset += directoryEntryLength;\n\t\tif (options.onprogress) {\n\t\t\ttry {\n\t\t\t\tawait options.onprogress(indexFileEntry + 1, files.size, new Entry(fileEntry));\n\t\t\t} catch (_error) {\n\t\t\t\t// ignored\n\t\t\t}\n\t\t}\n\t}\n\tawait writeData(writable, directoryDiskOffset ? directoryArray.slice(directoryDiskOffset) : directoryArray);\n\tlet lastDiskNumber = writer.diskNumber;\n\tconst { availableSize } = writer;\n\tif (availableSize < END_OF_CENTRAL_DIR_LENGTH) {\n\t\tlastDiskNumber++;\n\t}\n\tlet zip64 = getOptionValue(zipWriter, options, \"zip64\");\n\tif (directoryOffset >= MAX_32_BITS || directoryDataLength >= MAX_32_BITS || filesLength >= MAX_16_BITS || lastDiskNumber >= MAX_16_BITS) {\n\t\tif (zip64 === false) {\n\t\t\tthrow new Error(ERR_UNSUPPORTED_FORMAT);\n\t\t} else {\n\t\t\tzip64 = true;\n\t\t}\n\t}\n\tconst endOfdirectoryArray = new Uint8Array(zip64 ? ZIP64_END_OF_CENTRAL_DIR_TOTAL_LENGTH : END_OF_CENTRAL_DIR_LENGTH);\n\tconst endOfdirectoryView = getDataView(endOfdirectoryArray);\n\toffset = 0;\n\tif (zip64) {\n\t\tsetUint32(endOfdirectoryView, 0, ZIP64_END_OF_CENTRAL_DIR_SIGNATURE);\n\t\tsetBigUint64(endOfdirectoryView, 4, BigInt(44));\n\t\tsetUint16(endOfdirectoryView, 12, 45);\n\t\tsetUint16(endOfdirectoryView, 14, 45);\n\t\tsetUint32(endOfdirectoryView, 16, lastDiskNumber);\n\t\tsetUint32(endOfdirectoryView, 20, diskNumber);\n\t\tsetBigUint64(endOfdirectoryView, 24, BigInt(filesLength));\n\t\tsetBigUint64(endOfdirectoryView, 32, BigInt(filesLength));\n\t\tsetBigUint64(endOfdirectoryView, 40, BigInt(directoryDataLength));\n\t\tsetBigUint64(endOfdirectoryView, 48, BigInt(directoryOffset));\n\t\tsetUint32(endOfdirectoryView, 56, ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIGNATURE);\n\t\tsetBigUint64(endOfdirectoryView, 64, BigInt(directoryOffset) + BigInt(directoryDataLength));\n\t\tsetUint32(endOfdirectoryView, 72, lastDiskNumber + 1);\n\t\tconst supportZip64SplitFile = getOptionValue(zipWriter, options, \"supportZip64SplitFile\", true);\n\t\tif (supportZip64SplitFile) {\n\t\t\tlastDiskNumber = MAX_16_BITS;\n\t\t\tdiskNumber = MAX_16_BITS;\n\t\t}\n\t\tfilesLength = MAX_16_BITS;\n\t\tdirectoryOffset = MAX_32_BITS;\n\t\tdirectoryDataLength = MAX_32_BITS;\n\t\toffset += ZIP64_END_OF_CENTRAL_DIR_LENGTH + ZIP64_END_OF_CENTRAL_DIR_LOCATOR_LENGTH;\n\t}\n\tsetUint32(endOfdirectoryView, offset, END_OF_CENTRAL_DIR_SIGNATURE);\n\tsetUint16(endOfdirectoryView, offset + 4, lastDiskNumber);\n\tsetUint16(endOfdirectoryView, offset + 6, diskNumber);\n\tsetUint16(endOfdirectoryView, offset + 8, filesLength);\n\tsetUint16(endOfdirectoryView, offset + 10, filesLength);\n\tsetUint32(endOfdirectoryView, offset + 12, directoryDataLength);\n\tsetUint32(endOfdirectoryView, offset + 16, directoryOffset);\n\tconst commentLength = getLength(comment);\n\tif (commentLength) {\n\t\tif (commentLength <= MAX_16_BITS) {\n\t\t\tsetUint16(endOfdirectoryView, offset + 20, commentLength);\n\t\t} else {\n\t\t\tthrow new Error(ERR_INVALID_COMMENT);\n\t\t}\n\t}\n\tawait writeData(writable, endOfdirectoryArray);\n\tif (commentLength) {\n\t\tawait writeData(writable, comment);\n\t}\n}\n\nasync function writeData(writable, array) {\n\tconst streamWriter = writable.getWriter();\n\tawait streamWriter.ready;\n\twritable.size += getLength(array);\n\tawait streamWriter.write(array);\n\tstreamWriter.releaseLock();\n}\n\nfunction getTimeNTFS(date) {\n\tif (date) {\n\t\treturn ((BigInt(date.getTime()) + BigInt(11644473600000)) * BigInt(10000));\n\t}\n}\n\nfunction getOptionValue(zipWriter, options, name, defaultValue) {\n\tconst result = options[name] === UNDEFINED_VALUE ? zipWriter.options[name] : options[name];\n\treturn result === UNDEFINED_VALUE ? defaultValue : result;\n}\n\nfunction getMaximumCompressedSize(uncompressedSize) {\n\treturn uncompressedSize + (5 * (Math.floor(uncompressedSize / 16383) + 1));\n}\n\nfunction setUint8(view, offset, value) {\n\tview.setUint8(offset, value);\n}\n\nfunction setUint16(view, offset, value) {\n\tview.setUint16(offset, value, true);\n}\n\nfunction setUint32(view, offset, value) {\n\tview.setUint32(offset, value, true);\n}\n\nfunction setBigUint64(view, offset, value) {\n\tview.setBigUint64(offset, value, true);\n}\n\nfunction arraySet(array, typedArray, offset) {\n\tarray.set(typedArray, offset);\n}\n\nfunction getDataView(array) {\n\treturn new DataView(array.buffer);\n}\n\nfunction getLength(...arrayLikes) {\n\tlet result = 0;\n\tarrayLikes.forEach(arrayLike => arrayLike && (result += arrayLike.length));\n\treturn result;\n}", "/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nimport { configure } from \"./core/configuration.js\";\nimport { configureWebWorker } from \"./z-worker-inline.js\";\nimport { getMimeType } from \"./core/util/default-mime-type.js\";\nimport { initShimAsyncCodec } from \"./core/util/stream-codec-shim.js\";\nimport { terminateWorkers } from \"./core/codec-pool.js\";\n\nlet baseURL;\ntry {\n\tbaseURL = import.meta.url;\n} catch (_error) {\n\t// ignored\n}\nconfigure({ baseURL });\nconfigureWebWorker(configure);\n\nexport * from \"./core/io.js\";\nexport * from \"./core/zip-reader.js\";\nexport * from \"./core/zip-writer.js\";\nexport * from \"./core/zip-fs-core.js\";\nexport {\n\tconfigure,\n\tgetMimeType,\n\tinitShimAsyncCodec,\n\tterminateWorkers\n};", "/// \n\n/*\n Copyright (c) 2022 Gildas Lormeau. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright \n notice, this list of conditions and the following disclaimer in \n the documentation and/or other materials provided with the distribution.\n\n 3. The names of the authors may not be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED ''AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,\n INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,\n INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,\n INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,\n OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nimport { Deflate } from \"./lib/core/streams/codecs/deflate.js\";\nimport { Inflate } from \"./lib/core/streams/codecs/inflate.js\";\nimport { configure } from \"./lib/core/configuration.js\";\nimport { getMimeType } from \"./lib/core/util/mime-type.js\";\nimport { terminateWorkers } from \"./lib/core/codec-pool.js\";\n\nconfigure({ Deflate, Inflate });\n\nexport {\n\tfs,\n\tconfigure,\n\tinitShimAsyncCodec,\n\tZipReader,\n\tZipWriter,\n\tReader,\n\tWriter,\n\tTextReader,\n\tTextWriter,\n\tData64URIReader,\n\tData64URIWriter,\n\tBlobReader,\n\tBlobWriter,\n\tHttpReader,\n\tHttpRangeReader,\n\tUint8ArrayWriter,\n\tUint8ArrayReader,\n\tSplitZipReader,\n\tSplitZipWriter,\n\tSplitDataReader,\n\tSplitDataWriter,\n\tERR_HTTP_RANGE,\n\tERR_BAD_FORMAT,\n\tERR_EOCDR_NOT_FOUND,\n\tERR_EOCDR_ZIP64_NOT_FOUND,\n\tERR_EOCDR_LOCATOR_ZIP64_NOT_FOUND,\n\tERR_CENTRAL_DIRECTORY_NOT_FOUND,\n\tERR_LOCAL_FILE_HEADER_NOT_FOUND,\n\tERR_EXTRAFIELD_ZIP64_NOT_FOUND,\n\tERR_ENCRYPTED,\n\tERR_UNSUPPORTED_ENCRYPTION,\n\tERR_UNSUPPORTED_COMPRESSION,\n\tERR_INVALID_SIGNATURE,\n\tERR_INVALID_PASSWORD,\n\tERR_DUPLICATED_NAME,\n\tERR_INVALID_COMMENT,\n\tERR_INVALID_ENTRY_NAME,\n\tERR_INVALID_ENTRY_COMMENT,\n\tERR_INVALID_VERSION,\n\tERR_INVALID_EXTRAFIELD_TYPE,\n\tERR_INVALID_EXTRAFIELD_DATA,\n\tERR_INVALID_ENCRYPTION_STRENGTH,\n\tERR_UNSUPPORTED_FORMAT,\n\tERR_SPLIT_ZIP_FILE,\n\tERR_ITERATOR_COMPLETED_TOO_SOON\n} from \"./lib/zip-fs.js\";\nexport { getMimeType, terminateWorkers };", "import format from \"format-util\";\nimport { EventEmitter } from \"eventemitter3\";\nimport { join } from \"path-browserify\";\n\nimport { type Godot } from \"@gdquest/gd-types\";\n\nimport {\n assert,\n getCompletePath,\n type GdExerciseFile,\n type GdExerciseLog,\n} from \"@/utils.mts\";\n\nexport type GdPlayerStatus =\n | \"uninitialized\"\n | \"requestQuit\"\n | \"init\"\n | \"started\";\n\nexport interface GdPlayerControllerEvents {\n ready: () => void;\n log: (message: string) => void;\n logTest: (entry: GdExerciseLog) => void;\n logError: (message: string) => void;\n playerStatus: (status: GdPlayerStatus) => void;\n progress: (current: number, total: number) => void;\n}\n\nconst AT_ERROR_MESSAGE_REGEX = /^\\W+at:/;\nconst SEND_ERROR_MESSAGE_TIMEOUT_MS = 200;\nconst USER_SCRIPT_ERROR_TAG = \"USER SCRIPT ERROR:\";\n\nexport class GdPlayerController extends EventEmitter {\n parent: HTMLElement | null;\n canvas: HTMLCanvasElement | null;\n\n projectId: string;\n project: string;\n mainScene: string;\n\n _engineInit: Promise | null;\n engine: Godot.Engine | null;\n size: Record;\n\n _errorMessage: string[] | null;\n _sendErrorMessageTimeoutId: number;\n\n isSnippet: boolean;\n\n _playerStatus: GdPlayerStatus;\n get playerStatus(): GdPlayerStatus {\n return this._playerStatus;\n }\n\n set playerStatus(status: GdPlayerStatus) {\n this._playerStatus = status;\n this.emit(\"playerStatus\", status);\n }\n\n _lowProcessorUsageMode: boolean;\n get lowProcessorUsageMode(): boolean {\n return this._lowProcessorUsageMode;\n }\n\n set lowProcessorUsageMode(mode: boolean) {\n this._lowProcessorUsageMode = mode;\n\n if (this.engine == null) return;\n // @ts-expect-error lowProcessorUsageMode doesn't exist on engine\n this.engine.lowProcessorUsageMode = mode;\n // @ts-expect-error lowProcessorUsageModeSleepUsec doesn't exist on engine\n this.engine.lowProcessorUsageModeSleepUsec = 1000 * 1000;\n }\n\n constructor(\n projectId: string,\n project: string,\n mainScene: string,\n size: Record,\n isSnippet = false\n ) {\n super();\n\n assert(window.Engine != null, \"window.Engine is not defined\");\n\n this.projectId = projectId;\n this.project = project;\n this.mainScene = mainScene;\n this.size = size;\n this._lowProcessorUsageMode = false;\n\n this.canvas = null;\n this.parent = null;\n this._engineInit = null;\n this.engine = null;\n\n this._errorMessage = null;\n this._sendErrorMessageTimeoutId = -1;\n\n this.isSnippet = isSnippet;\n\n this._playerStatus = \"uninitialized\";\n }\n\n _sendErrorMessage(): void {\n if (this._errorMessage == null) {\n return;\n }\n\n this.emit(\"logError\", this._errorMessage.join(\"\\n\").trim());\n this._errorMessage = null;\n }\n\n _getEngineParameters(): Partial {\n assert(this.projectId != null);\n assert(this.canvas != null);\n\n const path = getCompletePath(this.projectId, this.project);\n const mainScene = join(path, this.mainScene);\n\n const engineParameters: Partial = {\n args: [\"--path\", path, \"--single-window\", mainScene],\n canvas: this.canvas,\n canvasResizePolicy: 0,\n focusCanvas: false,\n onPrint: (...args: any[]) => {\n this._onPrint(...args);\n },\n onPrintError: (...args: any[]) => {\n this._onPrintError(...args);\n },\n onProgress: (current, total) => {\n this.emit(\"progress\", current, total);\n },\n persistentPaths: [\"/userfs\", \"/home/web_user\"],\n unloadAfterInit: false,\n fileSizes: this.size,\n };\n return engineParameters;\n }\n\n _onPrint(...args: unknown[]): void {\n this.emit(\"log\", args.join(\" \"));\n }\n\n _onPrintError(...args: unknown[]): void {\n if (args.length <= 0) {\n return;\n }\n\n // Accumulate the error (comes in multiple lines)\n let arg = format(args[0] as any, ...args.slice(1));\n if (\n this._errorMessage != null &&\n arg.match(AT_ERROR_MESSAGE_REGEX) != null\n ) {\n this._errorMessage.push(arg);\n clearTimeout(this._sendErrorMessageTimeoutId);\n this._sendErrorMessageTimeoutId = setTimeout(() => {\n this._sendErrorMessage();\n }, SEND_ERROR_MESSAGE_TIMEOUT_MS);\n } else if (arg.startsWith(USER_SCRIPT_ERROR_TAG)) {\n arg = arg.slice(USER_SCRIPT_ERROR_TAG.length);\n if (this._sendErrorMessageTimeoutId >= 0) {\n clearTimeout(this._sendErrorMessageTimeoutId);\n this._sendErrorMessageTimeoutId = -1;\n this._sendErrorMessage();\n }\n this._errorMessage = [arg];\n this._sendErrorMessageTimeoutId = setTimeout(() => {\n this._sendErrorMessage();\n }, SEND_ERROR_MESSAGE_TIMEOUT_MS);\n }\n }\n\n async init(): Promise {\n assert(this.parent != null, format(\"%s is null, cannot init\", \"parent\"));\n\n this.clearCanvas();\n\n await this.loadEngine();\n this.emit(\"ready\");\n }\n\n async loadEngine(): Promise {\n this.engine = new window.Engine(this._getEngineParameters());\n const basePath = new URL(\"godot.editor\", window.location.href);\n this.clearCanvas();\n this._engineInit = this.engine.init(basePath.href);\n await this._engineInit.then(() => (this.playerStatus = \"init\"));\n }\n\n async addFile(file: GdExerciseFile): Promise {\n await this._engineInit;\n assert(this.engine != null, \"Engine is null while trying to add a file\");\n\n const filePath = getCompletePath(this.projectId, file.path);\n this.engine.copyToFS(filePath, file.data);\n }\n\n async launch(): Promise {\n assert(this.engine != null, \"Engine is null while trying to launch it\");\n this.clearCanvas();\n await this.engine.start(this._getEngineParameters());\n this.playerStatus = \"started\";\n }\n\n log(entry: GdExerciseLog): void {\n this.emit(\"logTest\", entry);\n }\n\n async restart(): Promise {\n assert(this.engine != null, \"Engine is null while trying to restart it\");\n this.engine.requestQuit();\n this.playerStatus = \"requestQuit\";\n await this.loadEngine();\n await this.launch();\n }\n\n clearCanvas(addNewCanvas: boolean = true): void {\n assert(this.parent != null);\n\n if (this.playerStatus === \"started\") {\n return;\n }\n\n document.getElementById(\"gd-player-canvas\")?.remove();\n\n if (this.canvas != null) {\n this.canvas.remove();\n this.canvas = null;\n }\n\n if (!addNewCanvas) {\n return;\n }\n\n this.canvas = this.parent.appendChild(document.createElement(\"canvas\"));\n this.canvas.classList.add(\"canvas\");\n this.canvas.id = \"gd-player-canvas\";\n this.canvas.width = this.parent.clientWidth;\n this.canvas.height = this.parent.clientHeight;\n this.canvas.style.width = `${this.canvas.width}px`;\n this.canvas.style.height = `${this.canvas.height}px`;\n }\n\n dispose(): void {\n this.removeAllListeners(\"ready\");\n if (this.parent != null) {\n this.clearCanvas(false);\n }\n // @ts-expect-error unload is not defined in engine\n this.engine?.unload();\n }\n}\n", "import { EventEmitter } from \"eventemitter3\";\n\nimport { Compartment } from \"@codemirror/state\";\nimport { EditorView } from \"@codemirror/view\";\n\nimport {\n gdExerciseThemeLight,\n gdExerciseThemeDark,\n} from \"@gdquest/codemirror-gd-exercise-theme\";\n\nimport {\n console as codemirrorConsole,\n consoleErrorLine,\n} from \"@gdquest/codemirror-console\";\n\nimport { type GdExerciseLog } from \"@/index.mts\";\nimport { assert } from \"@/utils.mjs\";\n\nexport interface ConsoleControllerEvents {\n ready: () => void;\n log: (entry: GdExerciseLog) => void;\n clear: () => void;\n}\n\nexport class ConsoleController extends EventEmitter {\n _parent: HTMLElement | null;\n\n get parent(): HTMLElement | null {\n return this._parent;\n }\n\n set parent(value: HTMLElement | null) {\n if (value === this._parent) {\n return;\n }\n\n this._clearParent();\n this._parent = value;\n\n if (this._parent != null) {\n this._initView();\n }\n }\n\n theme: Compartment;\n view: EditorView | null;\n\n _darkMode: boolean;\n\n get darkMode(): boolean {\n return this._darkMode;\n }\n\n set darkMode(val: boolean) {\n this._darkMode = val;\n this.view?.dispatch({\n effects: this.theme.reconfigure(\n val ? gdExerciseThemeDark : gdExerciseThemeLight\n ),\n });\n }\n\n constructor(darkMode?: boolean) {\n super();\n\n this.theme = new Compartment();\n\n this._parent = null;\n this.view = null;\n\n this._darkMode = darkMode ?? false;\n }\n\n _initView(): void {\n assert(this._parent != null, \"parent is null, cannot init view\");\n\n this.view?.destroy();\n this.view = new EditorView({\n parent: this._parent,\n extensions: [\n codemirrorConsole(),\n this.theme.of(\n this.darkMode ? gdExerciseThemeDark : gdExerciseThemeLight\n ),\n ],\n doc: \"\",\n });\n }\n\n _clearParent(): void {\n if (this._parent == null) return;\n\n while (this._parent.firstChild != null) {\n this._parent.firstChild.remove();\n }\n }\n\n _addNewLine(): void {\n assert(this.view != null);\n\n if (this.view.state.doc.length === 0) {\n return;\n }\n\n this.view.dispatch({\n changes: {\n from: this.view.state.doc.length,\n insert: \"\\n\",\n },\n });\n }\n\n async init(): Promise {\n assert(this.parent != null, \"parent is null, cannot init\");\n\n this._initView();\n\n this.emit(\"ready\");\n }\n\n clear(): void {\n if (this._parent == null) return;\n this._initView();\n }\n\n log(message: string): void {\n assert(this.view != null);\n\n this._addNewLine();\n\n this.view.dispatch({\n changes: {\n from: this.view.state.doc.length,\n insert: `${message}`,\n },\n });\n }\n\n error(message: string): void {\n if (message === \"\") {\n return;\n }\n\n assert(this.view != null);\n\n this._addNewLine();\n\n const insert = `${message}`;\n this.view.dispatch({\n changes: {\n from: this.view.state.doc.length,\n insert,\n },\n });\n\n const newlines = Array.from(insert.matchAll(/\\n/g));\n\n const lastLine = this.view.state.doc.lineAt(this.view.state.doc.length);\n for (let i = lastLine.number; i >= lastLine.number - newlines.length; i--) {\n consoleErrorLine(this.view, i);\n }\n }\n\n dispose(): void {\n this.removeAllListeners(\"ready\");\n }\n}\n", "import { type Extension, EditorState } from \"@codemirror/state\";\nimport { EditorView } from \"@codemirror/view\";\nimport { minimalSetup } from \"codemirror\";\n\nimport { getStickToBottomViewPlugin } from \"./stickToBottom.mts\";\nexport { consoleErrorLine } from \"./addConsoleError.mts\";\n\nexport function console(): Extension {\n const stickToBottom = getStickToBottomViewPlugin();\n\n return [\n minimalSetup,\n EditorState.readOnly.of(true),\n stickToBottom,\n EditorView.lineWrapping,\n ];\n}\n", "import {\n ViewPlugin,\n type PluginValue,\n type ViewUpdate,\n type EditorView,\n} from \"@codemirror/view\";\n\nconst PIXEL_BUFFER = 100;\n\nclass StickToBottomViewPlugin implements PluginValue {\n _animationFrameRequest: number | null;\n _stickToBottom: boolean;\n\n constructor(view: EditorView) {\n this._animationFrameRequest = null;\n this._stickToBottom = false;\n }\n\n update(update: ViewUpdate): void {\n if (this._animationFrameRequest != null || !update.viewportChanged) {\n return;\n }\n\n if (!this._stickToBottom) {\n this._stickToBottom =\n Math.abs(\n update.view.scrollDOM.scrollHeight -\n Math.round(update.view.scrollDOM.scrollTop) -\n update.view.scrollDOM.clientHeight\n ) < PIXEL_BUFFER;\n\n if (!this._stickToBottom) {\n return;\n }\n }\n\n const onScroll = (): void => {\n if (this._animationFrameRequest == null) {\n return;\n }\n cancelAnimationFrame(this._animationFrameRequest);\n this._animationFrameRequest = null;\n this._stickToBottom = false;\n };\n\n this._animationFrameRequest = requestAnimationFrame(() => {\n update.view.scrollDOM.removeEventListener(\"scroll\", onScroll);\n update.view.scrollDOM.scroll({\n top: update.view.scrollDOM.scrollHeight,\n behavior: \"instant\",\n });\n this._animationFrameRequest = null;\n this._stickToBottom = true;\n });\n\n update.view.scrollDOM.addEventListener(\"scroll\", onScroll);\n }\n}\n\nexport function getStickToBottomViewPlugin(): ViewPlugin {\n const plugin = ViewPlugin.fromClass(StickToBottomViewPlugin);\n return plugin;\n}\n", "import { StateField, StateEffect } from \"@codemirror/state\";\nimport { Decoration, type DecorationSet, EditorView } from \"@codemirror/view\";\n\nconst addConsoleError = StateEffect.define<{ from: number; to: number }>({\n map: ({ from, to }, change) => {\n return {\n from: change.mapPos(from),\n to: change.mapPos(to),\n };\n },\n});\n\nconst consoleErrorField = StateField.define({\n create() {\n return Decoration.none;\n },\n\n update(errors, tr) {\n errors = errors.map(tr.changes);\n for (const effect of tr.effects)\n if (effect.is(addConsoleError)) {\n errors = errors.update({\n add: [consoleErrorMark.range(effect.value.from, effect.value.to)],\n });\n }\n return errors;\n },\n\n provide: (field) => EditorView.decorations.from(field),\n});\n\nconst consoleErrorMark = Decoration.mark({ class: \"cm-console-error\" });\n\nconst consoleErrorTheme = EditorView.baseTheme({\n \".cm-console-error\": { color: \"red\" },\n});\n\nexport function consoleErrorLine(\n view: EditorView,\n lineNumber: number\n): boolean {\n const line = view.state.doc.line(lineNumber);\n const effects: Array> = [\n addConsoleError.of({ from: line.from, to: line.to }),\n ];\n\n if (view.state.field(consoleErrorField, false) == null) {\n effects.push(\n StateEffect.appendConfig.of([consoleErrorField, consoleErrorTheme])\n );\n }\n\n view.dispatch({ effects });\n\n return true;\n}\n", "import { EventEmitter } from \"eventemitter3\";\n\nimport { type GdExerciseLog } from \"@/index.mts\";\n\nexport type RequirementStatus = Exclude;\n\nexport interface TestControllerEvents {\n ready: () => void;\n update: () => void;\n}\n\nexport class TestController extends EventEmitter {\n _testName: string | null;\n _requirementContants: RequirementStatus | null;\n _requirementMethods: RequirementStatus | null;\n _requirementNodes: RequirementStatus | null;\n _requirementProperties: RequirementStatus | null;\n _requirementSignals: RequirementStatus | null;\n\n get testName(): string | null {\n return this._testName;\n }\n\n get requirementConstants(): RequirementStatus | null {\n return this._requirementContants;\n }\n\n get requirementMethods(): RequirementStatus | null {\n return this._requirementMethods;\n }\n\n get requirementNodes(): RequirementStatus | null {\n return this._requirementNodes;\n }\n\n get requirementProperties(): RequirementStatus | null {\n return this._requirementProperties;\n }\n\n get requirementSignals(): RequirementStatus | null {\n return this._requirementSignals;\n }\n\n constructor() {\n super();\n this._testName = null;\n this._requirementContants = null;\n this._requirementMethods = null;\n this._requirementNodes = null;\n this._requirementProperties = null;\n this._requirementSignals = null;\n }\n\n _addRequirement(entry: GdExerciseLog): void {}\n\n _addRequirementConstants(entry: GdExerciseLog): void {\n this._requirementContants = entry.status as RequirementStatus;\n this._emitUpdate();\n }\n\n _addRequirementMethods(entry: GdExerciseLog): void {\n this._requirementMethods = entry.status as RequirementStatus;\n this._emitUpdate();\n }\n\n _addRequirementNodes(entry: GdExerciseLog): void {\n this._requirementNodes = entry.status as RequirementStatus;\n this._emitUpdate();\n }\n\n _addRequirementProperties(entry: GdExerciseLog): void {\n this._requirementProperties = entry.status as RequirementStatus;\n this._emitUpdate();\n }\n\n _addRequirementSignals(entry: GdExerciseLog): void {\n this._requirementSignals = entry.status as RequirementStatus;\n this._emitUpdate();\n }\n\n _addTest(entry: GdExerciseLog): void {}\n\n _addTester(entry: GdExerciseLog): void {\n this.clear();\n this._testName = entry.message;\n this._emitUpdate();\n }\n\n _emitUpdate(): void {\n this.emit(\"update\");\n }\n\n async init(): Promise {\n this.emit(\"ready\");\n }\n\n clear(): void {\n this._testName = null;\n this._requirementContants = null;\n this._requirementMethods = null;\n this._requirementNodes = null;\n this._requirementProperties = null;\n this._requirementSignals = null;\n this.emit(\"update\");\n }\n\n log(entry: GdExerciseLog): void {\n switch (entry.type) {\n case \"requirement\":\n this._addRequirement(entry);\n break;\n case \"requirement_constants\":\n this._addRequirementConstants(entry);\n break;\n case \"requirement_methods\":\n this._addRequirementMethods(entry);\n break;\n case \"requirement_nodes\":\n this._addRequirementNodes(entry);\n break;\n case \"requirement_properties\":\n this._addRequirementProperties(entry);\n break;\n case \"requirement_signals\":\n this._addRequirementSignals(entry);\n break;\n case \"test\":\n this._addTest(entry);\n break;\n case \"tester\":\n this._addTester(entry);\n break;\n }\n }\n\n dispose(): void {\n this.removeAllListeners(\"ready\");\n }\n}\n"], "mappings": "8qBAAA,IAAAA,GAAAC,GAAA,CAAAC,GAAAC,KAAA,cAEA,IAAIC,GAAM,OAAO,UAAU,eACvBC,GAAS,IASb,SAASC,IAAS,CAAC,CASf,OAAO,SACTA,GAAO,UAAY,OAAO,OAAO,IAAI,EAMhC,IAAIA,GAAO,EAAE,YAAWD,GAAS,KAYxC,SAASE,GAAGC,EAAIC,EAASC,EAAM,CAC7B,KAAK,GAAKF,EACV,KAAK,QAAUC,EACf,KAAK,KAAOC,GAAQ,EACtB,CAaA,SAASC,GAAYC,EAASC,EAAOL,EAAIC,EAASC,EAAM,CACtD,GAAI,OAAOF,GAAO,WAChB,MAAM,IAAI,UAAU,iCAAiC,EAGvD,IAAIM,EAAW,IAAIP,GAAGC,EAAIC,GAAWG,EAASF,CAAI,EAC9CK,EAAMV,GAASA,GAASQ,EAAQA,EAEpC,OAAKD,EAAQ,QAAQG,CAAG,EACdH,EAAQ,QAAQG,CAAG,EAAE,GAC1BH,EAAQ,QAAQG,CAAG,EAAI,CAACH,EAAQ,QAAQG,CAAG,EAAGD,CAAQ,EADxBF,EAAQ,QAAQG,CAAG,EAAE,KAAKD,CAAQ,GAD1CF,EAAQ,QAAQG,CAAG,EAAID,EAAUF,EAAQ,gBAI7DA,CACT,CASA,SAASI,GAAWJ,EAASG,EAAK,CAC5B,EAAEH,EAAQ,eAAiB,EAAGA,EAAQ,QAAU,IAAIN,GACnD,OAAOM,EAAQ,QAAQG,CAAG,CACjC,CASA,SAASE,IAAe,CACtB,KAAK,QAAU,IAAIX,GACnB,KAAK,aAAe,CACtB,CASAW,GAAa,UAAU,WAAa,UAAsB,CACxD,IAAIC,EAAQ,CAAC,EACTC,EACAC,EAEJ,GAAI,KAAK,eAAiB,EAAG,OAAOF,EAEpC,IAAKE,KAASD,EAAS,KAAK,QACtBf,GAAI,KAAKe,EAAQC,CAAI,GAAGF,EAAM,KAAKb,GAASe,EAAK,MAAM,CAAC,EAAIA,CAAI,EAGtE,OAAI,OAAO,sBACFF,EAAM,OAAO,OAAO,sBAAsBC,CAAM,CAAC,EAGnDD,CACT,EASAD,GAAa,UAAU,UAAY,SAAmBJ,EAAO,CAC3D,IAAIE,EAAMV,GAASA,GAASQ,EAAQA,EAChCQ,EAAW,KAAK,QAAQN,CAAG,EAE/B,GAAI,CAACM,EAAU,MAAO,CAAC,EACvB,GAAIA,EAAS,GAAI,MAAO,CAACA,EAAS,EAAE,EAEpC,QAAS,EAAI,EAAGC,EAAID,EAAS,OAAQE,EAAK,IAAI,MAAMD,CAAC,EAAG,EAAIA,EAAG,IAC7DC,EAAG,CAAC,EAAIF,EAAS,CAAC,EAAE,GAGtB,OAAOE,CACT,EASAN,GAAa,UAAU,cAAgB,SAAuBJ,EAAO,CACnE,IAAIE,EAAMV,GAASA,GAASQ,EAAQA,EAChCW,EAAY,KAAK,QAAQT,CAAG,EAEhC,OAAKS,EACDA,EAAU,GAAW,EAClBA,EAAU,OAFM,CAGzB,EASAP,GAAa,UAAU,KAAO,SAAcJ,EAAOY,EAAIC,EAAIC,EAAIC,EAAIC,EAAI,CACrE,IAAId,EAAMV,GAASA,GAASQ,EAAQA,EAEpC,GAAI,CAAC,KAAK,QAAQE,CAAG,EAAG,MAAO,GAE/B,IAAIS,EAAY,KAAK,QAAQT,CAAG,EAC5Be,EAAM,UAAU,OAChBC,EACAC,EAEJ,GAAIR,EAAU,GAAI,CAGhB,OAFIA,EAAU,MAAM,KAAK,eAAeX,EAAOW,EAAU,GAAI,OAAW,EAAI,EAEpEM,EAAK,CACX,IAAK,GAAG,OAAON,EAAU,GAAG,KAAKA,EAAU,OAAO,EAAG,GACrD,IAAK,GAAG,OAAOA,EAAU,GAAG,KAAKA,EAAU,QAASC,CAAE,EAAG,GACzD,IAAK,GAAG,OAAOD,EAAU,GAAG,KAAKA,EAAU,QAASC,EAAIC,CAAE,EAAG,GAC7D,IAAK,GAAG,OAAOF,EAAU,GAAG,KAAKA,EAAU,QAASC,EAAIC,EAAIC,CAAE,EAAG,GACjE,IAAK,GAAG,OAAOH,EAAU,GAAG,KAAKA,EAAU,QAASC,EAAIC,EAAIC,EAAIC,CAAE,EAAG,GACrE,IAAK,GAAG,OAAOJ,EAAU,GAAG,KAAKA,EAAU,QAASC,EAAIC,EAAIC,EAAIC,EAAIC,CAAE,EAAG,EAC3E,CAEA,IAAKG,EAAI,EAAGD,EAAO,IAAI,MAAMD,EAAK,CAAC,EAAGE,EAAIF,EAAKE,IAC7CD,EAAKC,EAAI,CAAC,EAAI,UAAUA,CAAC,EAG3BR,EAAU,GAAG,MAAMA,EAAU,QAASO,CAAI,CAC5C,KAAO,CACL,IAAIE,EAAST,EAAU,OACnBU,EAEJ,IAAKF,EAAI,EAAGA,EAAIC,EAAQD,IAGtB,OAFIR,EAAUQ,CAAC,EAAE,MAAM,KAAK,eAAenB,EAAOW,EAAUQ,CAAC,EAAE,GAAI,OAAW,EAAI,EAE1EF,EAAK,CACX,IAAK,GAAGN,EAAUQ,CAAC,EAAE,GAAG,KAAKR,EAAUQ,CAAC,EAAE,OAAO,EAAG,MACpD,IAAK,GAAGR,EAAUQ,CAAC,EAAE,GAAG,KAAKR,EAAUQ,CAAC,EAAE,QAASP,CAAE,EAAG,MACxD,IAAK,GAAGD,EAAUQ,CAAC,EAAE,GAAG,KAAKR,EAAUQ,CAAC,EAAE,QAASP,EAAIC,CAAE,EAAG,MAC5D,IAAK,GAAGF,EAAUQ,CAAC,EAAE,GAAG,KAAKR,EAAUQ,CAAC,EAAE,QAASP,EAAIC,EAAIC,CAAE,EAAG,MAChE,QACE,GAAI,CAACI,EAAM,IAAKG,EAAI,EAAGH,EAAO,IAAI,MAAMD,EAAK,CAAC,EAAGI,EAAIJ,EAAKI,IACxDH,EAAKG,EAAI,CAAC,EAAI,UAAUA,CAAC,EAG3BV,EAAUQ,CAAC,EAAE,GAAG,MAAMR,EAAUQ,CAAC,EAAE,QAASD,CAAI,CACpD,CAEJ,CAEA,MAAO,EACT,EAWAd,GAAa,UAAU,GAAK,SAAYJ,EAAOL,EAAIC,EAAS,CAC1D,OAAOE,GAAY,KAAME,EAAOL,EAAIC,EAAS,EAAK,CACpD,EAWAQ,GAAa,UAAU,KAAO,SAAcJ,EAAOL,EAAIC,EAAS,CAC9D,OAAOE,GAAY,KAAME,EAAOL,EAAIC,EAAS,EAAI,CACnD,EAYAQ,GAAa,UAAU,eAAiB,SAAwBJ,EAAOL,EAAIC,EAASC,EAAM,CACxF,IAAIK,EAAMV,GAASA,GAASQ,EAAQA,EAEpC,GAAI,CAAC,KAAK,QAAQE,CAAG,EAAG,OAAO,KAC/B,GAAI,CAACP,EACH,OAAAQ,GAAW,KAAMD,CAAG,EACb,KAGT,IAAIS,EAAY,KAAK,QAAQT,CAAG,EAEhC,GAAIS,EAAU,GAEVA,EAAU,KAAOhB,IAChB,CAACE,GAAQc,EAAU,QACnB,CAACf,GAAWe,EAAU,UAAYf,IAEnCO,GAAW,KAAMD,CAAG,MAEjB,CACL,QAASiB,EAAI,EAAGb,EAAS,CAAC,EAAGc,EAAST,EAAU,OAAQQ,EAAIC,EAAQD,KAEhER,EAAUQ,CAAC,EAAE,KAAOxB,GACnBE,GAAQ,CAACc,EAAUQ,CAAC,EAAE,MACtBvB,GAAWe,EAAUQ,CAAC,EAAE,UAAYvB,IAErCU,EAAO,KAAKK,EAAUQ,CAAC,CAAC,EAOxBb,EAAO,OAAQ,KAAK,QAAQJ,CAAG,EAAII,EAAO,SAAW,EAAIA,EAAO,CAAC,EAAIA,EACpEH,GAAW,KAAMD,CAAG,CAC3B,CAEA,OAAO,IACT,EASAE,GAAa,UAAU,mBAAqB,SAA4BJ,EAAO,CAC7E,IAAIE,EAEJ,OAAIF,GACFE,EAAMV,GAASA,GAASQ,EAAQA,EAC5B,KAAK,QAAQE,CAAG,GAAGC,GAAW,KAAMD,CAAG,IAE3C,KAAK,QAAU,IAAIT,GACnB,KAAK,aAAe,GAGf,IACT,EAKAW,GAAa,UAAU,IAAMA,GAAa,UAAU,eACpDA,GAAa,UAAU,YAAcA,GAAa,UAAU,GAK5DA,GAAa,SAAWZ,GAKxBY,GAAa,aAAeA,GAKR,OAAOd,GAAvB,MACFA,GAAO,QAAUc,MC9UnB,IAAAkB,GAAAC,GAAA,CAAAC,GAAAC,KAAA,cA0BA,SAASC,GAAWC,EAAM,CACxB,GAAI,OAAOA,GAAS,SAClB,MAAM,IAAI,UAAU,mCAAqC,KAAK,UAAUA,CAAI,CAAC,CAEjF,CAGA,SAASC,GAAqBD,EAAME,EAAgB,CAMlD,QALIC,EAAM,GACNC,EAAoB,EACpBC,EAAY,GACZC,EAAO,EACPC,EACKC,EAAI,EAAGA,GAAKR,EAAK,OAAQ,EAAEQ,EAAG,CACrC,GAAIA,EAAIR,EAAK,OACXO,EAAOP,EAAK,WAAWQ,CAAC,MACrB,IAAID,IAAS,GAChB,MAEAA,EAAO,GACT,GAAIA,IAAS,GAAU,CACrB,GAAI,EAAAF,IAAcG,EAAI,GAAKF,IAAS,GAE7B,GAAID,IAAcG,EAAI,GAAKF,IAAS,EAAG,CAC5C,GAAIH,EAAI,OAAS,GAAKC,IAAsB,GAAKD,EAAI,WAAWA,EAAI,OAAS,CAAC,IAAM,IAAYA,EAAI,WAAWA,EAAI,OAAS,CAAC,IAAM,IACjI,GAAIA,EAAI,OAAS,EAAG,CAClB,IAAIM,EAAiBN,EAAI,YAAY,GAAG,EACxC,GAAIM,IAAmBN,EAAI,OAAS,EAAG,CACjCM,IAAmB,IACrBN,EAAM,GACNC,EAAoB,IAEpBD,EAAMA,EAAI,MAAM,EAAGM,CAAc,EACjCL,EAAoBD,EAAI,OAAS,EAAIA,EAAI,YAAY,GAAG,GAE1DE,EAAYG,EACZF,EAAO,EACP,QACF,CACF,SAAWH,EAAI,SAAW,GAAKA,EAAI,SAAW,EAAG,CAC/CA,EAAM,GACNC,EAAoB,EACpBC,EAAYG,EACZF,EAAO,EACP,QACF,EAEEJ,IACEC,EAAI,OAAS,EACfA,GAAO,MAEPA,EAAM,KACRC,EAAoB,EAExB,MACMD,EAAI,OAAS,EACfA,GAAO,IAAMH,EAAK,MAAMK,EAAY,EAAGG,CAAC,EAExCL,EAAMH,EAAK,MAAMK,EAAY,EAAGG,CAAC,EACnCJ,EAAoBI,EAAIH,EAAY,EAEtCA,EAAYG,EACZF,EAAO,CACT,MAAWC,IAAS,IAAYD,IAAS,GACvC,EAAEA,EAEFA,EAAO,EAEX,CACA,OAAOH,CACT,CAEA,SAASO,GAAQC,EAAKC,EAAY,CAChC,IAAIC,EAAMD,EAAW,KAAOA,EAAW,KACnCE,EAAOF,EAAW,OAASA,EAAW,MAAQ,KAAOA,EAAW,KAAO,IAC3E,OAAKC,EAGDA,IAAQD,EAAW,KACdC,EAAMC,EAERD,EAAMF,EAAMG,EALVA,CAMX,CAEA,IAAIC,GAAQ,CAEV,QAAS,UAAmB,CAK1B,QAJIC,EAAe,GACfC,EAAmB,GACnBC,EAEK,EAAI,UAAU,OAAS,EAAG,GAAK,IAAM,CAACD,EAAkB,IAAK,CACpE,IAAIjB,EACA,GAAK,EACPA,EAAO,UAAU,CAAC,GAEdkB,IAAQ,SACVA,EAAM,QAAQ,IAAI,GACpBlB,EAAOkB,GAGTnB,GAAWC,CAAI,EAGXA,EAAK,SAAW,IAIpBgB,EAAehB,EAAO,IAAMgB,EAC5BC,EAAmBjB,EAAK,WAAW,CAAC,IAAM,GAC5C,CAQA,OAFAgB,EAAef,GAAqBe,EAAc,CAACC,CAAgB,EAE/DA,EACED,EAAa,OAAS,EACjB,IAAMA,EAEN,IACAA,EAAa,OAAS,EACxBA,EAEA,GAEX,EAEA,UAAW,SAAmBhB,EAAM,CAGlC,GAFAD,GAAWC,CAAI,EAEXA,EAAK,SAAW,EAAG,MAAO,IAE9B,IAAImB,EAAanB,EAAK,WAAW,CAAC,IAAM,GACpCoB,EAAoBpB,EAAK,WAAWA,EAAK,OAAS,CAAC,IAAM,GAQ7D,OALAA,EAAOC,GAAqBD,EAAM,CAACmB,CAAU,EAEzCnB,EAAK,SAAW,GAAK,CAACmB,IAAYnB,EAAO,KACzCA,EAAK,OAAS,GAAKoB,IAAmBpB,GAAQ,KAE9CmB,EAAmB,IAAMnB,EACtBA,CACT,EAEA,WAAY,SAAoBA,EAAM,CACpC,OAAAD,GAAWC,CAAI,EACRA,EAAK,OAAS,GAAKA,EAAK,WAAW,CAAC,IAAM,EACnD,EAEA,KAAM,UAAgB,CACpB,GAAI,UAAU,SAAW,EACvB,MAAO,IAET,QADIqB,EACKb,EAAI,EAAGA,EAAI,UAAU,OAAQ,EAAEA,EAAG,CACzC,IAAIc,EAAM,UAAUd,CAAC,EACrBT,GAAWuB,CAAG,EACVA,EAAI,OAAS,IACXD,IAAW,OACbA,EAASC,EAETD,GAAU,IAAMC,EAEtB,CACA,OAAID,IAAW,OACN,IACFN,GAAM,UAAUM,CAAM,CAC/B,EAEA,SAAU,SAAkBE,EAAMC,EAAI,CASpC,GARAzB,GAAWwB,CAAI,EACfxB,GAAWyB,CAAE,EAETD,IAASC,IAEbD,EAAOR,GAAM,QAAQQ,CAAI,EACzBC,EAAKT,GAAM,QAAQS,CAAE,EAEjBD,IAASC,GAAI,MAAO,GAIxB,QADIC,EAAY,EACTA,EAAYF,EAAK,QAClBA,EAAK,WAAWE,CAAS,IAAM,GADL,EAAEA,EAChC,CAQF,QALIC,EAAUH,EAAK,OACfI,EAAUD,EAAUD,EAGpBG,EAAU,EACPA,EAAUJ,EAAG,QACdA,EAAG,WAAWI,CAAO,IAAM,GADL,EAAEA,EAC5B,CAUF,QAPIC,EAAQL,EAAG,OACXM,EAAQD,EAAQD,EAGhBG,EAASJ,EAAUG,EAAQH,EAAUG,EACrCE,EAAgB,GAChBxB,EAAI,EACDA,GAAKuB,EAAQ,EAAEvB,EAAG,CACvB,GAAIA,IAAMuB,EAAQ,CAChB,GAAID,EAAQC,EAAQ,CAClB,GAAIP,EAAG,WAAWI,EAAUpB,CAAC,IAAM,GAGjC,OAAOgB,EAAG,MAAMI,EAAUpB,EAAI,CAAC,EAC1B,GAAIA,IAAM,EAGf,OAAOgB,EAAG,MAAMI,EAAUpB,CAAC,CAE/B,MAAWmB,EAAUI,IACfR,EAAK,WAAWE,EAAYjB,CAAC,IAAM,GAGrCwB,EAAgBxB,EACPA,IAAM,IAGfwB,EAAgB,IAGpB,KACF,CACA,IAAIC,EAAWV,EAAK,WAAWE,EAAYjB,CAAC,EACxC0B,EAASV,EAAG,WAAWI,EAAUpB,CAAC,EACtC,GAAIyB,IAAaC,EACf,MACOD,IAAa,KACpBD,EAAgBxB,EACpB,CAEA,IAAI2B,EAAM,GAGV,IAAK3B,EAAIiB,EAAYO,EAAgB,EAAGxB,GAAKkB,EAAS,EAAElB,GAClDA,IAAMkB,GAAWH,EAAK,WAAWf,CAAC,IAAM,MACtC2B,EAAI,SAAW,EACjBA,GAAO,KAEPA,GAAO,OAMb,OAAIA,EAAI,OAAS,EACRA,EAAMX,EAAG,MAAMI,EAAUI,CAAa,GAE7CJ,GAAWI,EACPR,EAAG,WAAWI,CAAO,IAAM,IAC7B,EAAEA,EACGJ,EAAG,MAAMI,CAAO,EAE3B,EAEA,UAAW,SAAmB5B,EAAM,CAClC,OAAOA,CACT,EAEA,QAAS,SAAiBA,EAAM,CAE9B,GADAD,GAAWC,CAAI,EACXA,EAAK,SAAW,EAAG,MAAO,IAK9B,QAJIO,EAAOP,EAAK,WAAW,CAAC,EACxBoC,EAAU7B,IAAS,GACnB8B,EAAM,GACNC,EAAe,GACV9B,EAAIR,EAAK,OAAS,EAAGQ,GAAK,EAAG,EAAEA,EAEtC,GADAD,EAAOP,EAAK,WAAWQ,CAAC,EACpBD,IAAS,IACT,GAAI,CAAC+B,EAAc,CACjBD,EAAM7B,EACN,KACF,OAGF8B,EAAe,GAInB,OAAID,IAAQ,GAAWD,EAAU,IAAM,IACnCA,GAAWC,IAAQ,EAAU,KAC1BrC,EAAK,MAAM,EAAGqC,CAAG,CAC1B,EAEA,SAAU,SAAkBrC,EAAMuC,EAAK,CACrC,GAAIA,IAAQ,QAAa,OAAOA,GAAQ,SAAU,MAAM,IAAI,UAAU,iCAAiC,EACvGxC,GAAWC,CAAI,EAEf,IAAIwC,EAAQ,EACRH,EAAM,GACNC,EAAe,GACf9B,EAEJ,GAAI+B,IAAQ,QAAaA,EAAI,OAAS,GAAKA,EAAI,QAAUvC,EAAK,OAAQ,CACpE,GAAIuC,EAAI,SAAWvC,EAAK,QAAUuC,IAAQvC,EAAM,MAAO,GACvD,IAAIyC,EAASF,EAAI,OAAS,EACtBG,EAAmB,GACvB,IAAKlC,EAAIR,EAAK,OAAS,EAAGQ,GAAK,EAAG,EAAEA,EAAG,CACrC,IAAID,EAAOP,EAAK,WAAWQ,CAAC,EAC5B,GAAID,IAAS,IAGT,GAAI,CAAC+B,EAAc,CACjBE,EAAQhC,EAAI,EACZ,KACF,OAEEkC,IAAqB,KAGvBJ,EAAe,GACfI,EAAmBlC,EAAI,GAErBiC,GAAU,IAERlC,IAASgC,EAAI,WAAWE,CAAM,EAC5B,EAAEA,IAAW,KAGfJ,EAAM7B,IAKRiC,EAAS,GACTJ,EAAMK,GAId,CAEA,OAAIF,IAAUH,EAAKA,EAAMK,EAA0BL,IAAQ,KAAIA,EAAMrC,EAAK,QACnEA,EAAK,MAAMwC,EAAOH,CAAG,CAC9B,KAAO,CACL,IAAK7B,EAAIR,EAAK,OAAS,EAAGQ,GAAK,EAAG,EAAEA,EAClC,GAAIR,EAAK,WAAWQ,CAAC,IAAM,IAGvB,GAAI,CAAC8B,EAAc,CACjBE,EAAQhC,EAAI,EACZ,KACF,OACS6B,IAAQ,KAGnBC,EAAe,GACfD,EAAM7B,EAAI,GAId,OAAI6B,IAAQ,GAAW,GAChBrC,EAAK,MAAMwC,EAAOH,CAAG,CAC9B,CACF,EAEA,QAAS,SAAiBrC,EAAM,CAC9BD,GAAWC,CAAI,EAQf,QAPI2C,EAAW,GACXC,EAAY,EACZP,EAAM,GACNC,EAAe,GAGfO,EAAc,EACTrC,EAAIR,EAAK,OAAS,EAAGQ,GAAK,EAAG,EAAEA,EAAG,CACzC,IAAID,EAAOP,EAAK,WAAWQ,CAAC,EAC5B,GAAID,IAAS,GAAU,CAGnB,GAAI,CAAC+B,EAAc,CACjBM,EAAYpC,EAAI,EAChB,KACF,CACA,QACF,CACE6B,IAAQ,KAGVC,EAAe,GACfD,EAAM7B,EAAI,GAERD,IAAS,GAELoC,IAAa,GACfA,EAAWnC,EACJqC,IAAgB,IACvBA,EAAc,GACTF,IAAa,KAGtBE,EAAc,GAElB,CAEA,OAAIF,IAAa,IAAMN,IAAQ,IAE3BQ,IAAgB,GAEhBA,IAAgB,GAAKF,IAAaN,EAAM,GAAKM,IAAaC,EAAY,EACjE,GAEF5C,EAAK,MAAM2C,EAAUN,CAAG,CACjC,EAEA,OAAQ,SAAgBzB,EAAY,CAClC,GAAIA,IAAe,MAAQ,OAAOA,GAAe,SAC/C,MAAM,IAAI,UAAU,mEAAqE,OAAOA,CAAU,EAE5G,OAAOF,GAAQ,IAAKE,CAAU,CAChC,EAEA,MAAO,SAAeZ,EAAM,CAC1BD,GAAWC,CAAI,EAEf,IAAI8C,EAAM,CAAE,KAAM,GAAI,IAAK,GAAI,KAAM,GAAI,IAAK,GAAI,KAAM,EAAG,EAC3D,GAAI9C,EAAK,SAAW,EAAG,OAAO8C,EAC9B,IAAIvC,EAAOP,EAAK,WAAW,CAAC,EACxBmB,EAAaZ,IAAS,GACtBiC,EACArB,GACF2B,EAAI,KAAO,IACXN,EAAQ,GAERA,EAAQ,EAaV,QAXIG,EAAW,GACXC,EAAY,EACZP,EAAM,GACNC,EAAe,GACf9B,EAAIR,EAAK,OAAS,EAIlB6C,EAAc,EAGXrC,GAAKgC,EAAO,EAAEhC,EAAG,CAEtB,GADAD,EAAOP,EAAK,WAAWQ,CAAC,EACpBD,IAAS,GAAU,CAGnB,GAAI,CAAC+B,EAAc,CACjBM,EAAYpC,EAAI,EAChB,KACF,CACA,QACF,CACE6B,IAAQ,KAGVC,EAAe,GACfD,EAAM7B,EAAI,GAERD,IAAS,GAELoC,IAAa,GAAIA,EAAWnC,EAAWqC,IAAgB,IAAGA,EAAc,GACnEF,IAAa,KAGxBE,EAAc,GAElB,CAEA,OAAIF,IAAa,IAAMN,IAAQ,IAE/BQ,IAAgB,GAEhBA,IAAgB,GAAKF,IAAaN,EAAM,GAAKM,IAAaC,EAAY,EAChEP,IAAQ,KACNO,IAAc,GAAKzB,EAAY2B,EAAI,KAAOA,EAAI,KAAO9C,EAAK,MAAM,EAAGqC,CAAG,EAAOS,EAAI,KAAOA,EAAI,KAAO9C,EAAK,MAAM4C,EAAWP,CAAG,IAG9HO,IAAc,GAAKzB,GACrB2B,EAAI,KAAO9C,EAAK,MAAM,EAAG2C,CAAQ,EACjCG,EAAI,KAAO9C,EAAK,MAAM,EAAGqC,CAAG,IAE5BS,EAAI,KAAO9C,EAAK,MAAM4C,EAAWD,CAAQ,EACzCG,EAAI,KAAO9C,EAAK,MAAM4C,EAAWP,CAAG,GAEtCS,EAAI,IAAM9C,EAAK,MAAM2C,EAAUN,CAAG,GAGhCO,EAAY,EAAGE,EAAI,IAAM9C,EAAK,MAAM,EAAG4C,EAAY,CAAC,EAAWzB,IAAY2B,EAAI,IAAM,KAElFA,CACT,EAEA,IAAK,IACL,UAAW,IACX,MAAO,KACP,MAAO,IACT,EAEA/B,GAAM,MAAQA,GAEdjB,GAAO,QAAUiB,KChhBjB,IAAAgC,GAAAC,GAAA,CAAAC,GAAAC,KAAA,cAEA,IAAIC,GAAM,OAAO,UAAU,eACvBC,GAAS,IASb,SAASC,IAAS,CAAC,CASf,OAAO,SACTA,GAAO,UAAY,OAAO,OAAO,IAAI,EAMhC,IAAIA,GAAO,EAAE,YAAWD,GAAS,KAYxC,SAASE,GAAGC,EAAIC,EAASC,EAAM,CAC7B,KAAK,GAAKF,EACV,KAAK,QAAUC,EACf,KAAK,KAAOC,GAAQ,EACtB,CAaA,SAASC,GAAYC,EAASC,EAAOL,EAAIC,EAASC,EAAM,CACtD,GAAI,OAAOF,GAAO,WAChB,MAAM,IAAI,UAAU,iCAAiC,EAGvD,IAAIM,EAAW,IAAIP,GAAGC,EAAIC,GAAWG,EAASF,CAAI,EAC9CK,EAAMV,GAASA,GAASQ,EAAQA,EAEpC,OAAKD,EAAQ,QAAQG,CAAG,EACdH,EAAQ,QAAQG,CAAG,EAAE,GAC1BH,EAAQ,QAAQG,CAAG,EAAI,CAACH,EAAQ,QAAQG,CAAG,EAAGD,CAAQ,EADxBF,EAAQ,QAAQG,CAAG,EAAE,KAAKD,CAAQ,GAD1CF,EAAQ,QAAQG,CAAG,EAAID,EAAUF,EAAQ,gBAI7DA,CACT,CASA,SAASI,GAAWJ,EAASG,EAAK,CAC5B,EAAEH,EAAQ,eAAiB,EAAGA,EAAQ,QAAU,IAAIN,GACnD,OAAOM,EAAQ,QAAQG,CAAG,CACjC,CASA,SAASE,IAAe,CACtB,KAAK,QAAU,IAAIX,GACnB,KAAK,aAAe,CACtB,CASAW,GAAa,UAAU,WAAa,UAAsB,CACxD,IAAIC,EAAQ,CAAC,EACTC,EACAC,EAEJ,GAAI,KAAK,eAAiB,EAAG,OAAOF,EAEpC,IAAKE,KAASD,EAAS,KAAK,QACtBf,GAAI,KAAKe,EAAQC,CAAI,GAAGF,EAAM,KAAKb,GAASe,EAAK,MAAM,CAAC,EAAIA,CAAI,EAGtE,OAAI,OAAO,sBACFF,EAAM,OAAO,OAAO,sBAAsBC,CAAM,CAAC,EAGnDD,CACT,EASAD,GAAa,UAAU,UAAY,SAAmBJ,EAAO,CAC3D,IAAIE,EAAMV,GAASA,GAASQ,EAAQA,EAChCQ,EAAW,KAAK,QAAQN,CAAG,EAE/B,GAAI,CAACM,EAAU,MAAO,CAAC,EACvB,GAAIA,EAAS,GAAI,MAAO,CAACA,EAAS,EAAE,EAEpC,QAAS,EAAI,EAAGC,EAAID,EAAS,OAAQE,EAAK,IAAI,MAAMD,CAAC,EAAG,EAAIA,EAAG,IAC7DC,EAAG,CAAC,EAAIF,EAAS,CAAC,EAAE,GAGtB,OAAOE,CACT,EASAN,GAAa,UAAU,cAAgB,SAAuBJ,EAAO,CACnE,IAAIE,EAAMV,GAASA,GAASQ,EAAQA,EAChCW,EAAY,KAAK,QAAQT,CAAG,EAEhC,OAAKS,EACDA,EAAU,GAAW,EAClBA,EAAU,OAFM,CAGzB,EASAP,GAAa,UAAU,KAAO,SAAcJ,EAAOY,EAAIC,EAAIC,EAAIC,EAAIC,EAAI,CACrE,IAAId,EAAMV,GAASA,GAASQ,EAAQA,EAEpC,GAAI,CAAC,KAAK,QAAQE,CAAG,EAAG,MAAO,GAE/B,IAAIS,EAAY,KAAK,QAAQT,CAAG,EAC5Be,EAAM,UAAU,OAChBC,EACAC,EAEJ,GAAIR,EAAU,GAAI,CAGhB,OAFIA,EAAU,MAAM,KAAK,eAAeX,EAAOW,EAAU,GAAI,OAAW,EAAI,EAEpEM,EAAK,CACX,IAAK,GAAG,OAAON,EAAU,GAAG,KAAKA,EAAU,OAAO,EAAG,GACrD,IAAK,GAAG,OAAOA,EAAU,GAAG,KAAKA,EAAU,QAASC,CAAE,EAAG,GACzD,IAAK,GAAG,OAAOD,EAAU,GAAG,KAAKA,EAAU,QAASC,EAAIC,CAAE,EAAG,GAC7D,IAAK,GAAG,OAAOF,EAAU,GAAG,KAAKA,EAAU,QAASC,EAAIC,EAAIC,CAAE,EAAG,GACjE,IAAK,GAAG,OAAOH,EAAU,GAAG,KAAKA,EAAU,QAASC,EAAIC,EAAIC,EAAIC,CAAE,EAAG,GACrE,IAAK,GAAG,OAAOJ,EAAU,GAAG,KAAKA,EAAU,QAASC,EAAIC,EAAIC,EAAIC,EAAIC,CAAE,EAAG,EAC3E,CAEA,IAAKG,EAAI,EAAGD,EAAO,IAAI,MAAMD,EAAK,CAAC,EAAGE,EAAIF,EAAKE,IAC7CD,EAAKC,EAAI,CAAC,EAAI,UAAUA,CAAC,EAG3BR,EAAU,GAAG,MAAMA,EAAU,QAASO,CAAI,CAC5C,KAAO,CACL,IAAIE,EAAST,EAAU,OACnBU,EAEJ,IAAKF,EAAI,EAAGA,EAAIC,EAAQD,IAGtB,OAFIR,EAAUQ,CAAC,EAAE,MAAM,KAAK,eAAenB,EAAOW,EAAUQ,CAAC,EAAE,GAAI,OAAW,EAAI,EAE1EF,EAAK,CACX,IAAK,GAAGN,EAAUQ,CAAC,EAAE,GAAG,KAAKR,EAAUQ,CAAC,EAAE,OAAO,EAAG,MACpD,IAAK,GAAGR,EAAUQ,CAAC,EAAE,GAAG,KAAKR,EAAUQ,CAAC,EAAE,QAASP,CAAE,EAAG,MACxD,IAAK,GAAGD,EAAUQ,CAAC,EAAE,GAAG,KAAKR,EAAUQ,CAAC,EAAE,QAASP,EAAIC,CAAE,EAAG,MAC5D,IAAK,GAAGF,EAAUQ,CAAC,EAAE,GAAG,KAAKR,EAAUQ,CAAC,EAAE,QAASP,EAAIC,EAAIC,CAAE,EAAG,MAChE,QACE,GAAI,CAACI,EAAM,IAAKG,EAAI,EAAGH,EAAO,IAAI,MAAMD,EAAK,CAAC,EAAGI,EAAIJ,EAAKI,IACxDH,EAAKG,EAAI,CAAC,EAAI,UAAUA,CAAC,EAG3BV,EAAUQ,CAAC,EAAE,GAAG,MAAMR,EAAUQ,CAAC,EAAE,QAASD,CAAI,CACpD,CAEJ,CAEA,MAAO,EACT,EAWAd,GAAa,UAAU,GAAK,SAAYJ,EAAOL,EAAIC,EAAS,CAC1D,OAAOE,GAAY,KAAME,EAAOL,EAAIC,EAAS,EAAK,CACpD,EAWAQ,GAAa,UAAU,KAAO,SAAcJ,EAAOL,EAAIC,EAAS,CAC9D,OAAOE,GAAY,KAAME,EAAOL,EAAIC,EAAS,EAAI,CACnD,EAYAQ,GAAa,UAAU,eAAiB,SAAwBJ,EAAOL,EAAIC,EAASC,EAAM,CACxF,IAAIK,EAAMV,GAASA,GAASQ,EAAQA,EAEpC,GAAI,CAAC,KAAK,QAAQE,CAAG,EAAG,OAAO,KAC/B,GAAI,CAACP,EACH,OAAAQ,GAAW,KAAMD,CAAG,EACb,KAGT,IAAIS,EAAY,KAAK,QAAQT,CAAG,EAEhC,GAAIS,EAAU,GAEVA,EAAU,KAAOhB,IAChB,CAACE,GAAQc,EAAU,QACnB,CAACf,GAAWe,EAAU,UAAYf,IAEnCO,GAAW,KAAMD,CAAG,MAEjB,CACL,QAASiB,EAAI,EAAGb,EAAS,CAAC,EAAGc,EAAST,EAAU,OAAQQ,EAAIC,EAAQD,KAEhER,EAAUQ,CAAC,EAAE,KAAOxB,GACnBE,GAAQ,CAACc,EAAUQ,CAAC,EAAE,MACtBvB,GAAWe,EAAUQ,CAAC,EAAE,UAAYvB,IAErCU,EAAO,KAAKK,EAAUQ,CAAC,CAAC,EAOxBb,EAAO,OAAQ,KAAK,QAAQJ,CAAG,EAAII,EAAO,SAAW,EAAIA,EAAO,CAAC,EAAIA,EACpEH,GAAW,KAAMD,CAAG,CAC3B,CAEA,OAAO,IACT,EASAE,GAAa,UAAU,mBAAqB,SAA4BJ,EAAO,CAC7E,IAAIE,EAEJ,OAAIF,GACFE,EAAMV,GAASA,GAASQ,EAAQA,EAC5B,KAAK,QAAQE,CAAG,GAAGC,GAAW,KAAMD,CAAG,IAE3C,KAAK,QAAU,IAAIT,GACnB,KAAK,aAAe,GAGf,IACT,EAKAW,GAAa,UAAU,IAAMA,GAAa,UAAU,eACpDA,GAAa,UAAU,YAAcA,GAAa,UAAU,GAK5DA,GAAa,SAAWZ,GAKxBY,GAAa,aAAeA,GAKR,OAAOd,GAAvB,MACFA,GAAO,QAAUc,uIKnTZ,SAASkB,GACdC,EACAC,EACQ,CACR,IAAIC,EAAc,EACdC,EAAgB,EAEpB,QAASC,EAAK,EAAGA,EAAKJ,EAAK,OAAQI,IAAM,CASvC,GARaJ,EAAKI,CAAE,IACP;GACXF,GAAe,EACfC,EAAgB,GAEhBA,GAAiB,EAGfF,EAAS,KAAOC,EAClB,MAAO,GAGT,GAAIA,IAAgBD,EAAS,MAAQE,IAAkBF,EAAS,UAC9D,OAAOG,EAAK,CAEhB,CAEA,OAAOJ,EAAK,MACd,CAEO,SAASK,GACdL,EACAM,EACU,CACV,IAAIJ,EAAc,EACdC,EAAgB,EAEpB,QAAS,EAAI,EAAG,EAAIH,EAAK,OAAQ,IAS/B,GARaA,EAAK,EAAI,CAAC,IACV;GACXE,GAAe,EACfC,EAAgB,GAEhBA,GAAiB,EAGf,IAAMG,EACR,MAAO,CACL,KAAMJ,EACN,UAAWC,CACb,EAIJ,MAAO,CACL,KAAMD,EACN,UAAWC,CACb,CACF,CAEO,SAASI,GACdC,EAC8B,CAC9B,OAAQA,EAAU,CAChB,IAAK,GACH,MAAO,QACT,IAAK,GACH,MAAO,UACT,IAAK,GACL,IAAK,GACL,QACE,MAAO,MACX,CACF,CHvEO,SAASC,GAAUC,EAA8B,CACtD,IAAMC,EAAS,IAAIC,GAAAC,QAEfC,EAA6B,KAC7BC,EAAgB,EACd,CAAE,eAAAC,EAAiB,GAAM,gBAAAC,EAAiB,QAAAC,CAAQ,EAAIR,EACtDS,EAAgB,IAAIC,GAE1B,MAAMC,CAAU,CAGd,YAAYC,EAAkB,CAC5B,KAAK,KAAOA,CACd,CAEA,OAAOC,EAA0B,CAAC,CACpC,CACA,cAAW,UAAUF,CAAS,EAE9B,IAAMG,KAAY,WAAO,MAAOF,GAAS,CACvCR,EAAUQ,EACVX,EAAO,KAAK,OAAQW,CAAI,EAExB,IAAMG,EAA4B,CAAC,EAC7BC,EAAeX,EACrB,OAAAA,GAAiB,EAEjBI,EAAc,OAAO,CACnB,OAAQ,yBACR,OAAQ,CACN,aAAc,CACZ,IAAK,mBACL,QAASO,CACX,EACA,eAAgB,CACd,CACE,KAAMJ,EAAK,MAAM,IAAI,SAAS,CAChC,CACF,CACF,CACF,CAAC,EAEMG,CACT,EAAG,CAAC,CAAC,EAELN,EAAc,GAAG,UAAYQ,GAAY,CACvCV,EAAgBU,CAAO,CACzB,CAAC,EAED,IAAMC,EAAkBC,GAA4B,CAClD,OAAQA,EAAa,OAAQ,CAC3B,IAAK,kCACHC,EAAqBD,CAAY,EACjC,KACJ,CACF,EAEAV,EAAc,GAAG,eAAgBS,CAAc,EAE/C,IAAME,EACJD,GACS,CAET,GADA,QAAQ,IAAI,uBAAwBA,EAAcf,CAAO,EACrDA,GAAW,KACb,OAGF,IAAMW,EAA4BI,EAAa,OAAO,YAAY,IAC/DE,IACQ,CACL,KAAMhC,GACJe,GAAS,MAAM,IAAI,SAAS,GAAK,GACjCiB,EAAW,MAAM,KACnB,EACA,GAAIhC,GACFe,GAAS,MAAM,IAAI,SAAS,GAAK,GACjCiB,EAAW,MAAM,GACnB,EACA,SAAUxB,GAAsBwB,EAAW,QAAQ,EACnD,OAAQA,EAAW,OACnB,QAASA,EAAW,OACtB,EAEJ,EAEA,QAAQ,IAAI,cAAeN,CAAW,EACtC,IAAMO,KAAiB,mBAAelB,EAAQ,MAAOW,CAAW,EAC1DQ,EAAcnB,EAAQ,MAAM,OAAOkB,CAAc,EACvDlB,EAAQ,SAASmB,CAAW,CAC9B,EAqCA,OAAAf,EAAQ,CAAE,kBAnCiBgB,GAA0B,CACnD,IAAMC,EAAO,KAAK,MAAMD,CAAO,EAC/B,GAAI,OAAOC,GAAS,SAClB,MAAM,IAAI,MAAM,gBAAgB,EAGlC,GAAI,MAAM,QAAQA,CAAI,EAAG,CACvB,IAAMC,EAAW,CAAC,EAClB,QAAWC,KAAMF,EACX,WAAYE,EACdlB,EAAc,KAAK,eAAgBkB,CAAE,EAErCD,EAAS,KAAKC,CAAE,EAIpBlB,EAAc,KAAK,QAASiB,CAAQ,EACpC,MACF,CACA,GAAI,UAAWD,EAAM,CACnBhB,EAAc,KAAK,QAASgB,CAAI,EAChC,MACF,CACA,GAAI,WAAYA,EAAM,CACpBhB,EAAc,KAAK,WAAYgB,CAAI,EACnC,MACF,CACA,GAAI,WAAYA,EAAM,CACpBhB,EAAc,KAAK,eAAgBgB,CAAI,EACvC,MACF,CAEA,MAAM,IAAI,MAAM,eAAe,CACjC,CAE4B,CAAC,EAEtB,CACLX,EACA,GAAIR,EACA,CAKA,EACA,CAAC,CACP,CACF,KAtKAsB,GAEAC,8BDFAC,GEAA5B,GAGO6B,GCyCMC,GAsBAtB,2BFlEbkB,GAAwD,4BAExDC,GAA6D,ijBDF7DC,GAAAG,GAAA,CAAA,mFAAAC,EAAAC,EAAA,CAAA,aAEA,IAAIC,EAAM,OAAO,UAAU,eACvBC,EAAS,IASb,SAASC,GAAS,CAAC,CASf,OAAO,SACTA,EAAO,UAAY,OAAO,OAAO,IAAI,EAMhC,IAAIA,EAAO,EAAE,YAAWD,EAAS,KAYxC,SAASE,EAAGC,EAAIC,EAASC,EAAM,CAC7B,KAAK,GAAKF,EACV,KAAK,QAAUC,EACf,KAAK,KAAOC,GAAQ,EACtB,CAaA,SAASC,EAAYC,EAASC,EAAOL,EAAIC,EAASC,EAAM,CACtD,GAAI,OAAOF,GAAO,WAChB,MAAM,IAAI,UAAU,iCAAiC,EAGvD,IAAIM,EAAW,IAAIP,EAAGC,EAAIC,GAAWG,EAASF,CAAI,EAC9CK,EAAMV,EAASA,EAASQ,EAAQA,EAEpC,OAAKD,EAAQ,QAAQG,CAAG,EACdH,EAAQ,QAAQG,CAAG,EAAE,GAC1BH,EAAQ,QAAQG,CAAG,EAAI,CAACH,EAAQ,QAAQG,CAAG,EAAGD,CAAQ,EADxBF,EAAQ,QAAQG,CAAG,EAAE,KAAKD,CAAQ,GAD1CF,EAAQ,QAAQG,CAAG,EAAID,EAAUF,EAAQ,gBAI7DA,CACT,CASA,SAASI,EAAWJ,EAASG,EAAK,CAC5B,EAAEH,EAAQ,eAAiB,EAAGA,EAAQ,QAAU,IAAIN,EACnD,OAAOM,EAAQ,QAAQG,CAAG,CACjC,CASA,SAAS5C,GAAe,CACtB,KAAK,QAAU,IAAImC,EACnB,KAAK,aAAe,CACtB,CASAnC,EAAa,UAAU,WAAa,UAAsB,CACxD,IAAI8C,EAAQ,CAAC,EACTC,EACAC,EAEJ,GAAI,KAAK,eAAiB,EAAG,OAAOF,EAEpC,IAAKE,KAASD,EAAS,KAAK,QACtBd,EAAI,KAAKc,EAAQC,CAAI,GAAGF,EAAM,KAAKZ,EAASc,EAAK,MAAM,CAAC,EAAIA,CAAI,EAGtE,OAAI,OAAO,sBACFF,EAAM,OAAO,OAAO,sBAAsBC,CAAM,CAAC,EAGnDD,CACT,EASA9C,EAAa,UAAU,UAAY,SAAmB0C,EAAO,CAC3D,IAAIE,EAAMV,EAASA,EAASQ,EAAQA,EAChCO,EAAW,KAAK,QAAQL,CAAG,EAE/B,GAAI,CAACK,EAAU,MAAO,CAAC,EACvB,GAAIA,EAAS,GAAI,MAAO,CAACA,EAAS,EAAE,EAEpC,QAASC,EAAI,EAAGC,EAAIF,EAAS,OAAQG,EAAK,IAAI,MAAMD,CAAC,EAAGD,EAAIC,EAAGD,IAC7DE,EAAGF,CAAC,EAAID,EAASC,CAAC,EAAE,GAGtB,OAAOE,CACT,EASApD,EAAa,UAAU,cAAgB,SAAuB0C,EAAO,CACnE,IAAIE,EAAMV,EAASA,EAASQ,EAAQA,EAChCW,EAAY,KAAK,QAAQT,CAAG,EAEhC,OAAKS,EACDA,EAAU,GAAW,EAClBA,EAAU,OAFM,CAGzB,EASArD,EAAa,UAAU,KAAO,SAAc0C,EAAOY,EAAIC,EAAIC,EAAIC,EAAIC,EAAI,CACrE,IAAId,EAAMV,EAASA,EAASQ,EAAQA,EAEpC,GAAI,CAAC,KAAK,QAAQE,CAAG,EAAG,MAAO,GAE/B,IAAIS,EAAY,KAAK,QAAQT,CAAG,EAC5Be,EAAM,UAAU,OAChBC,EACAV,EAEJ,GAAIG,EAAU,GAAI,CAGhB,OAFIA,EAAU,MAAM,KAAK,eAAeX,EAAOW,EAAU,GAAI,OAAW,EAAI,EAEpEM,EAAK,CACX,IAAK,GAAG,OAAON,EAAU,GAAG,KAAKA,EAAU,OAAO,EAAG,GACrD,IAAK,GAAG,OAAOA,EAAU,GAAG,KAAKA,EAAU,QAASC,CAAE,EAAG,GACzD,IAAK,GAAG,OAAOD,EAAU,GAAG,KAAKA,EAAU,QAASC,EAAIC,CAAE,EAAG,GAC7D,IAAK,GAAG,OAAOF,EAAU,GAAG,KAAKA,EAAU,QAASC,EAAIC,EAAIC,CAAE,EAAG,GACjE,IAAK,GAAG,OAAOH,EAAU,GAAG,KAAKA,EAAU,QAASC,EAAIC,EAAIC,EAAIC,CAAE,EAAG,GACrE,IAAK,GAAG,OAAOJ,EAAU,GAAG,KAAKA,EAAU,QAASC,EAAIC,EAAIC,EAAIC,EAAIC,CAAE,EAAG,EAC3E,CAEA,IAAKR,EAAI,EAAGU,EAAO,IAAI,MAAMD,EAAK,CAAC,EAAGT,EAAIS,EAAKT,IAC7CU,EAAKV,EAAI,CAAC,EAAI,UAAUA,CAAC,EAG3BG,EAAU,GAAG,MAAMA,EAAU,QAASO,CAAI,CAC5C,KAAO,CACL,IAAIC,EAASR,EAAU,OACnBS,EAEJ,IAAKZ,EAAI,EAAGA,EAAIW,EAAQX,IAGtB,OAFIG,EAAUH,CAAC,EAAE,MAAM,KAAK,eAAeR,EAAOW,EAAUH,CAAC,EAAE,GAAI,OAAW,EAAI,EAE1ES,EAAK,CACX,IAAK,GAAGN,EAAUH,CAAC,EAAE,GAAG,KAAKG,EAAUH,CAAC,EAAE,OAAO,EAAG,MACpD,IAAK,GAAGG,EAAUH,CAAC,EAAE,GAAG,KAAKG,EAAUH,CAAC,EAAE,QAASI,CAAE,EAAG,MACxD,IAAK,GAAGD,EAAUH,CAAC,EAAE,GAAG,KAAKG,EAAUH,CAAC,EAAE,QAASI,EAAIC,CAAE,EAAG,MAC5D,IAAK,GAAGF,EAAUH,CAAC,EAAE,GAAG,KAAKG,EAAUH,CAAC,EAAE,QAASI,EAAIC,EAAIC,CAAE,EAAG,MAChE,QACE,GAAI,CAACI,EAAM,IAAKE,EAAI,EAAGF,EAAO,IAAI,MAAMD,EAAK,CAAC,EAAGG,EAAIH,EAAKG,IACxDF,EAAKE,EAAI,CAAC,EAAI,UAAUA,CAAC,EAG3BT,EAAUH,CAAC,EAAE,GAAG,MAAMG,EAAUH,CAAC,EAAE,QAASU,CAAI,CACpD,CAEJ,CAEA,MAAO,EACT,EAWA5D,EAAa,UAAU,GAAK,SAAY0C,EAAOL,EAAIC,EAAS,CAC1D,OAAOE,EAAY,KAAME,EAAOL,EAAIC,EAAS,EAAK,CACpD,EAWAtC,EAAa,UAAU,KAAO,SAAc0C,EAAOL,EAAIC,EAAS,CAC9D,OAAOE,EAAY,KAAME,EAAOL,EAAIC,EAAS,EAAI,CACnD,EAYAtC,EAAa,UAAU,eAAiB,SAAwB0C,EAAOL,EAAIC,EAASC,EAAM,CACxF,IAAIK,EAAMV,EAASA,EAASQ,EAAQA,EAEpC,GAAI,CAAC,KAAK,QAAQE,CAAG,EAAG,OAAO,KAC/B,GAAI,CAACP,EACH,OAAAQ,EAAW,KAAMD,CAAG,EACb,KAGT,IAAIS,EAAY,KAAK,QAAQT,CAAG,EAEhC,GAAIS,EAAU,GAEVA,EAAU,KAAOhB,IAChB,CAACE,GAAQc,EAAU,QACnB,CAACf,GAAWe,EAAU,UAAYf,IAEnCO,EAAW,KAAMD,CAAG,MAEjB,CACL,QAASM,EAAI,EAAGH,EAAS,CAAC,EAAGc,EAASR,EAAU,OAAQH,EAAIW,EAAQX,KAEhEG,EAAUH,CAAC,EAAE,KAAOb,GACnBE,GAAQ,CAACc,EAAUH,CAAC,EAAE,MACtBZ,GAAWe,EAAUH,CAAC,EAAE,UAAYZ,IAErCS,EAAO,KAAKM,EAAUH,CAAC,CAAC,EAOxBH,EAAO,OAAQ,KAAK,QAAQH,CAAG,EAAIG,EAAO,SAAW,EAAIA,EAAO,CAAC,EAAIA,EACpEF,EAAW,KAAMD,CAAG,CAC3B,CAEA,OAAO,IACT,EASA5C,EAAa,UAAU,mBAAqB,SAA4B0C,EAAO,CAC7E,IAAIE,EAEJ,OAAIF,GACFE,EAAMV,EAASA,EAASQ,EAAQA,EAC5B,KAAK,QAAQE,CAAG,GAAGC,EAAW,KAAMD,CAAG,IAE3C,KAAK,QAAU,IAAIT,EACnB,KAAK,aAAe,GAGf,IACT,EAKAnC,EAAa,UAAU,IAAMA,EAAa,UAAU,eACpDA,EAAa,UAAU,YAAcA,EAAa,UAAU,GAK5DA,EAAa,SAAWkC,EAKxBlC,EAAa,aAAeA,EAKR,OAAOgC,EAAvB,MACFA,EAAO,QAAUhC,EACnB,CAAA,CAAA,EE/UAD,GAAyBgE,GAAApC,GAAA,EAAA,CAAA,EAGlBC,GAAQ7B,GAAAC,QCyCF6B,GAAN,cAA2B,KAAM,CAItC,YACEmC,EACAC,EACA,CACA,GAAM,CAAE,MAAAC,EAAO,KAAAC,EAAM,SAAAC,CAAS,EAAIH,GAAW,CAAC,EAE9C,MAAMD,EAAS,CAAE,MAAAE,CAAM,CAAC,EAT1B,KAAA,KAAwB,EACxB,KAAA,SAAiC,KAU3BC,GAAQ,OACV,KAAK,KAAOA,GAGVC,GAAY,OACd,KAAK,SAAWA,EAEpB,CACF,EAEa7D,GAAN,cAAsBqB,EAAa,CAAnC,aAAA,CAAA,MAAA,GAAA,SAAA,EACL,KAAA,UAAY,IAAI,IAChB,KAAA,QAAU,CAAA,CAIV,MAAM,KACJd,EACwC,CACxC,OAAO,MAAM,IAAI,QACf,CAACuD,EAASC,IAAW,CACf,MAAM,QAAQxD,CAAO,EACvB,KAAK,cAAcA,EAASuD,CAAO,EAEnC,KAAK,SAASvD,EAASuD,EAASC,CAAM,CAE1C,CACF,CACF,CAIA,OAAOxD,EAAkD,CACvD,GAAI,MAAM,QAAQA,CAAO,EAAG,CAC1B,IAAI,QAASuD,GAAY,CACvB,KAAK,cAAcvD,EAASuD,CAAO,CACrC,CAAC,EAAE,MAAOE,GAAQ,CAChB,QAAQ,MAAM,gCAAiCA,CAAG,CACpD,CAAC,EACD,MACF,CACA,IAAI,QAAQ,CAACF,EAASC,IAAW,CAC/B,KAAK,SAASxD,EAASuD,EAASC,CAAM,CACxC,CAAC,EAAE,MAAOC,GAAQ,CAChB,QAAQ,MAAM,+BAAgCA,CAAG,CACnD,CAAC,CACH,CAEA,SACEzD,EACAuD,EAGAC,EAGM,CACN,IAAME,EAAK,KAAK,QAChB,KAAK,SAAW,EAEhB,IAAMC,EAAmB,CACvB,QAAS,MACT,GAAAD,EACA,GAAG1D,CACL,EAEM4D,EAAkB,IAAY,CAClC,KAAK,IAAI,WAAYC,CAAU,EAC/B,KAAK,IAAI,QAASC,CAAO,CAC3B,EAEMD,EAAcP,GAAoC,CAClDA,EAAS,KAAOI,IAClBH,EAAQD,CAAQ,EAChBM,EAAgB,EAEpB,EAEME,EAAWR,GAAkC,CACjD,GAAIA,EAAS,KAAOI,EAAI,CACtB,IAAMK,EAAQ,IAAIhD,GAAauC,EAAS,MAAM,QAAS,CACrD,KAAMA,EAAS,MAAM,KACrB,SAAAA,CACF,CAAC,EACDE,EAAOO,CAAK,EACZH,EAAgB,CAClB,CACF,EAEA,KAAK,GAAG,WAAYC,CAAU,EAC9B,KAAK,GAAG,QAASC,CAAO,EAExB,KAAK,KAAK,UAAW,KAAK,UAAUH,CAAgB,CAAC,CACvD,CAEA,cACE3D,EACAuD,EAGM,CACN,IAAMS,EAAsBhE,EAAQ,IAAKA,GAAY,CACnD,IAAM2D,EAAmB,CACvB,QAAS,MACT,GAAI,KAAK,QACT,GAAG3D,CACL,EACA,YAAK,SAAW,EACT2D,CACT,CAAC,EAEKM,EAAWC,GAAiC,CAChD,IAAMC,EAAoB,CAAC,EAE3B,QAAWb,KAAYY,EACrB,QAAWlE,KAAWgE,EAChBhE,EAAQ,KAAOsD,EAAS,IAC1Ba,EAAkB,KAAKb,CAAQ,EAKjCa,EAAkB,OAAS,IAC7BZ,EAAQY,CAAiB,EACzB,KAAK,IAAI,QAASF,CAAO,EAE7B,EAEA,KAAK,GAAG,QAASA,CAAO,EAExB,KAAK,KAAK,UAAWD,CAAQ,CAC/B,CACF,IE+RA,SAASI,GAAUC,EAAMC,EAAKC,EAAMC,EAAI,CACpC,OAAQH,EAAM,CACV,IAAK,GAAsB,OAAOE,EAAOD,EACzC,IAAK,GAA0B,OAAOE,GAAMF,GAAOC,EAAOD,EAC1D,IAAK,GAAqB,OAAOC,EAAOD,GAAOE,EAAKF,EACpD,IAAK,GAAwB,OAAOC,GAAQD,GAAOE,EAAKF,EACxD,IAAK,GAAoB,OAAOE,EAAKF,EACrC,IAAK,GAAuB,MAAO,EACvC,CACJ,CACA,SAASG,GAA2BC,EAAMJ,EAAK,CAC3C,IAAIK,EAAOD,EAAK,YAAYJ,CAAG,EAC/B,KAAOK,GAAM,CACT,IAAIC,EAAOD,EAAK,UAChB,GAAI,CAACC,GAAQA,EAAK,IAAMD,EAAK,GACzB,MACAC,EAAK,KAAK,SAAWA,EAAK,MAAQA,EAAK,IACvCF,EAAOC,EACPA,EAAOC,EAAK,aAGZD,EAAOC,CAEf,CACA,OAAOF,CACX,CACA,SAASG,GAAYH,EAAMJ,EAAKD,EAAMS,EAAU,CAG5C,QAFIC,EAEGL,EAAK,MAAQA,EAAK,KACpBL,EAAO,EAAIK,EAAK,MAAQJ,EAAMI,EAAK,KAAOJ,KAC1CD,EAAO,GAAKK,EAAK,IAAMJ,EAAMI,EAAK,GAAKJ,IAAM,CAC9C,IAAIU,EAAS,CAACF,GAAYJ,aAAgBO,IAAYP,EAAK,MAAQ,EAAI,KAAOA,EAAK,OACnF,GAAI,CAACM,EACD,OAAON,EACXA,EAAOM,CACX,CACA,IAAIE,EAAOJ,EAAW,EAAIK,GAAS,eAEnC,GAAIL,EACA,QAASH,EAAOD,EAAMM,EAASL,EAAK,OAAQK,EAAQL,EAAOK,EAAQA,EAASL,EAAK,OACzEA,aAAgBM,IAAYN,EAAK,MAAQ,KAAOI,EAAKC,EAAO,MAAMV,EAAKD,EAAMa,CAAI,KAAO,MAAQH,IAAO,OAAS,OAASA,EAAG,OAASJ,EAAK,OAC1ID,EAAOM,GAEnB,OAAS,CACL,IAAII,EAAQV,EAAK,MAAMJ,EAAKD,EAAMa,CAAI,EACtC,GAAI,CAACE,EACD,OAAOV,EACXA,EAAOU,CACX,CACJ,CAoGA,SAASC,GAAYX,EAAMY,EAAMC,EAAQC,EAAO,CAC5C,IAAIC,EAAMf,EAAK,OAAO,EAAGgB,EAAS,CAAC,EACnC,GAAI,CAACD,EAAI,WAAW,EAChB,OAAOC,EACX,GAAIH,GAAU,MACV,KAAO,CAACE,EAAI,KAAK,GAAGF,CAAM,GACtB,GAAI,CAACE,EAAI,YAAY,EACjB,OAAOC,EACnB,OAAS,CACL,GAAIF,GAAS,MAAQC,EAAI,KAAK,GAAGD,CAAK,EAClC,OAAOE,EAGX,GAFID,EAAI,KAAK,GAAGH,CAAI,GAChBI,EAAO,KAAKD,EAAI,IAAI,EACpB,CAACA,EAAI,YAAY,EACjB,OAAOD,GAAS,KAAOE,EAAS,CAAC,CACzC,CACJ,CACA,SAASC,GAAiBjB,EAAMkB,EAASC,EAAID,EAAQ,OAAS,EAAG,CAC7D,QAASE,EAAIpB,EAAK,OAAQmB,GAAK,EAAGC,EAAIA,EAAE,OAAQ,CAC5C,GAAI,CAACA,EACD,MAAO,GACX,GAAI,CAACA,EAAE,KAAK,YAAa,CACrB,GAAIF,EAAQC,CAAC,GAAKD,EAAQC,CAAC,GAAKC,EAAE,KAC9B,MAAO,GACXD,GACJ,CACJ,CACA,MAAO,EACX,CAgWA,SAASE,GAASC,EAAM,CACpB,OAAOA,EAAK,SAAS,KAAKC,GAAMA,aAAcC,IAAc,CAACD,EAAG,KAAK,aAAeF,GAASE,CAAE,CAAC,CACpG,CACA,SAASE,GAAUC,EAAM,CACrB,IAAIrB,EACJ,GAAI,CAAE,OAAAsB,EAAQ,QAAAC,EAAS,gBAAAC,EAAkB,KAAqB,OAAAC,EAAS,CAAC,EAAG,cAAAC,EAAgBH,EAAQ,MAAM,MAAO,EAAIF,EAChHM,EAAS,MAAM,QAAQL,CAAM,EAAI,IAAIM,GAAiBN,EAAQA,EAAO,MAAM,EAAIA,EAC/EO,EAAQN,EAAQ,MAChBO,EAAc,EAAGC,EAAY,EACjC,SAASC,EAASC,EAAaC,EAAQC,EAAUC,EAAWC,EAAU,CAClE,GAAI,CAAE,GAAAC,EAAI,MAAAC,EAAO,IAAAC,EAAK,KAAAC,CAAK,EAAId,EAC3Be,EAAmBX,EACvB,KAAOU,EAAO,GAEV,GADAd,EAAO,KAAK,EACRc,GAAQ,GAA8B,CACtC,IAAI9C,EAAO8B,EAAOa,CAAE,EACpBH,EAAS,KAAKxC,CAAI,EAClByC,EAAU,KAAKG,EAAQN,CAAW,EAClC,MACJ,SACSQ,GAAQ,GAAsC,CACnDX,EAAcQ,EACd,MACJ,SACSG,GAAQ,GAAkC,CAC/CV,EAAYO,EACZ,MACJ,KAEI,OAAM,IAAI,WAAW,6BAA6BG,CAAI,EAAE,EAGhE,IAAIlC,EAAOsB,EAAMS,CAAE,EAAG3C,EAAM2B,EACxBqB,EAAWJ,EAAQN,EACvB,GAAIO,EAAMD,GAASf,IAAoBF,EAASsB,EAAejB,EAAO,IAAMO,EAAQG,CAAQ,GAAI,CAE5F,IAAIhB,EAAO,IAAI,YAAYC,EAAO,KAAOA,EAAO,IAAI,EAChDuB,EAASlB,EAAO,IAAML,EAAO,KAAMwB,EAAQzB,EAAK,OACpD,KAAOM,EAAO,IAAMkB,GAChBC,EAAQC,EAAazB,EAAO,MAAOD,EAAMyB,CAAK,EAClDnD,EAAO,IAAIwB,GAAWE,EAAMmB,EAAMlB,EAAO,MAAOC,CAAO,EACvDoB,EAAWrB,EAAO,MAAQW,CAC9B,KACK,CACD,IAAIY,EAASlB,EAAO,IAAMc,EAC1Bd,EAAO,KAAK,EACZ,IAAIqB,EAAgB,CAAC,EAAGC,EAAiB,CAAC,EACtCC,EAAgBZ,GAAMZ,EAAgBY,EAAK,GAC3Ca,EAAY,EAAGC,EAAUZ,EAC7B,KAAOb,EAAO,IAAMkB,GACZK,GAAiB,GAAKvB,EAAO,IAAMuB,GAAiBvB,EAAO,MAAQ,GAC/DA,EAAO,KAAOyB,EAAU5B,IACxB6B,EAAeL,EAAeC,EAAgBV,EAAOY,EAAWxB,EAAO,IAAKyB,EAASF,EAAeR,CAAgB,EACpHS,EAAYH,EAAc,OAC1BI,EAAUzB,EAAO,KAErBA,EAAO,KAAK,GAGZK,EAASO,EAAOM,EAAQG,EAAeC,EAAgBC,CAAa,EAO5E,GAJIA,GAAiB,GAAKC,EAAY,GAAKA,EAAYH,EAAc,QACjEK,EAAeL,EAAeC,EAAgBV,EAAOY,EAAWZ,EAAOa,EAASF,EAAeR,CAAgB,EACnHM,EAAc,QAAQ,EACtBC,EAAe,QAAQ,EACnBC,EAAgB,IAAMC,EAAY,EAAG,CACrC,IAAIG,GAAOC,EAAahD,CAAI,EAC5BZ,EAAO6D,GAAajD,EAAMyC,EAAeC,EAAgB,EAAGD,EAAc,OAAQ,EAAGR,EAAMD,EAAOe,GAAMA,EAAI,CAChH,MAEI3D,EAAO8D,EAASlD,EAAMyC,EAAeC,EAAgBT,EAAMD,EAAOG,EAAmBF,CAAG,CAEhG,CACAL,EAAS,KAAKxC,CAAI,EAClByC,EAAU,KAAKO,CAAQ,CAC3B,CACA,SAASY,EAAahD,EAAM,CACxB,MAAO,CAAC4B,EAAUC,EAAWsB,IAAW,CACpC,IAAI3B,EAAY,EAAG4B,EAAQxB,EAAS,OAAS,EAAGtC,EAAM+D,EACtD,GAAID,GAAS,IAAM9D,EAAOsC,EAASwB,CAAK,aAAcE,GAAM,CACxD,GAAI,CAACF,GAAS9D,EAAK,MAAQU,GAAQV,EAAK,QAAU6D,EAC9C,OAAO7D,GACP+D,EAAgB/D,EAAK,KAAKiE,EAAS,SAAS,KAC5C/B,EAAYK,EAAUuB,CAAK,EAAI9D,EAAK,OAAS+D,EACrD,CACA,OAAOH,EAASlD,EAAM4B,EAAUC,EAAWsB,EAAQ3B,CAAS,CAChE,CACJ,CACA,SAASsB,EAAelB,EAAUC,EAAW2B,EAAMjD,EAAGtB,EAAMC,EAAIc,EAAMwB,EAAW,CAC7E,IAAIiB,EAAgB,CAAC,EAAGC,EAAiB,CAAC,EAC1C,KAAOd,EAAS,OAASrB,GACrBkC,EAAc,KAAKb,EAAS,IAAI,CAAC,EACjCc,EAAe,KAAKb,EAAU,IAAI,EAAI2B,EAAOvE,CAAI,EAErD2C,EAAS,KAAKsB,EAASlC,EAAQ,MAAMhB,CAAI,EAAGyC,EAAeC,EAAgBxD,EAAKD,EAAMuC,EAAYtC,CAAE,CAAC,EACrG2C,EAAU,KAAK5C,EAAOuE,CAAI,CAC9B,CACA,SAASN,EAASlD,EAAM4B,EAAUC,EAAWsB,EAAQ3B,EAAY,EAAGiC,EAAO,CACvE,GAAIlC,EAAa,CACb,IAAImC,EAAO,CAACH,EAAS,YAAahC,CAAW,EAC7CkC,EAAQA,EAAQ,CAACC,CAAI,EAAE,OAAOD,CAAK,EAAI,CAACC,CAAI,CAChD,CACA,GAAIlC,EAAY,GAAI,CAChB,IAAIkC,EAAO,CAACH,EAAS,UAAW/B,CAAS,EACzCiC,EAAQA,EAAQ,CAACC,CAAI,EAAE,OAAOD,CAAK,EAAI,CAACC,CAAI,CAChD,CACA,OAAO,IAAIJ,GAAKtD,EAAM4B,EAAUC,EAAWsB,EAAQM,CAAK,CAC5D,CACA,SAASpB,EAAesB,EAAS7B,EAAU,CAOvC,IAAI8B,EAAOxC,EAAO,KAAK,EACnBc,EAAO,EAAGF,EAAQ,EAAG6B,EAAO,EAAGC,EAAWF,EAAK,IAAM3C,EACrDb,EAAS,CAAE,KAAM,EAAG,MAAO,EAAG,KAAM,CAAE,EAC1Cf,EAAM,QAASsC,EAASiC,EAAK,IAAMD,EAASC,EAAK,IAAMjC,GAAS,CAC5D,IAAIoC,EAAWH,EAAK,KAEpB,GAAIA,EAAK,IAAM9B,GAAYiC,GAAY,EAAG,CAGtC3D,EAAO,KAAO8B,EACd9B,EAAO,MAAQ4B,EACf5B,EAAO,KAAOyD,EACdA,GAAQ,EACR3B,GAAQ,EACR0B,EAAK,KAAK,EACV,QACJ,CACA,IAAIxB,EAAWwB,EAAK,IAAMG,EAC1B,GAAIA,EAAW,GAAK3B,EAAWT,GAAUiC,EAAK,MAAQE,EAClD,MACJ,IAAIE,EAAeJ,EAAK,IAAMzC,EAAgB,EAAI,EAC9C8C,EAAYL,EAAK,MAErB,IADAA,EAAK,KAAK,EACHA,EAAK,IAAMxB,GAAU,CACxB,GAAIwB,EAAK,KAAO,EACZ,GAAIA,EAAK,MAAQ,GACbI,GAAgB,MAEhB,OAAM3E,OAELuE,EAAK,IAAMzC,IAChB6C,GAAgB,GAEpBJ,EAAK,KAAK,CACd,CACA5B,EAAQiC,EACR/B,GAAQ6B,EACRF,GAAQG,CACZ,CACA,OAAIlC,EAAW,GAAKI,GAAQyB,KACxBvD,EAAO,KAAO8B,EACd9B,EAAO,MAAQ4B,EACf5B,EAAO,KAAOyD,GAEXzD,EAAO,KAAO,EAAIA,EAAS,MACtC,CACA,SAASoC,EAAa0B,EAAanD,EAAQwB,EAAO,CAC9C,GAAI,CAAE,GAAAR,EAAI,MAAAC,EAAO,IAAAC,EAAK,KAAAC,CAAK,EAAId,EAE/B,GADAA,EAAO,KAAK,EACRc,GAAQ,GAAKH,EAAKZ,EAAe,CACjC,IAAIgD,EAAa5B,EACjB,GAAIL,EAAO,EAAG,CACV,IAAII,EAASlB,EAAO,KAAOc,EAAO,GAClC,KAAOd,EAAO,IAAMkB,GAChBC,EAAQC,EAAa0B,EAAanD,EAAQwB,CAAK,CACvD,CACAxB,EAAO,EAAEwB,CAAK,EAAI4B,EAClBpD,EAAO,EAAEwB,CAAK,EAAIN,EAAMiC,EACxBnD,EAAO,EAAEwB,CAAK,EAAIP,EAAQkC,EAC1BnD,EAAO,EAAEwB,CAAK,EAAIR,CACtB,MACSG,GAAQ,GACbX,EAAcQ,EAETG,GAAQ,KACbV,EAAYO,GAEhB,OAAOQ,CACX,CACA,IAAIX,EAAW,CAAC,EAAGC,EAAY,CAAC,EAChC,KAAOT,EAAO,IAAM,GAChBK,EAASX,EAAK,OAAS,EAAGA,EAAK,aAAe,EAAGc,EAAUC,EAAW,EAAE,EAC5E,IAAIsB,GAAU1D,EAAKqB,EAAK,UAAY,MAAQrB,IAAO,OAASA,EAAMmC,EAAS,OAASC,EAAU,CAAC,EAAID,EAAS,CAAC,EAAE,OAAS,EACxH,OAAO,IAAI0B,GAAKhC,EAAMR,EAAK,KAAK,EAAGc,EAAS,QAAQ,EAAGC,EAAU,QAAQ,EAAGsB,CAAM,CACtF,CAEA,SAASY,GAASK,EAAahF,EAAM,CACjC,GAAI,CAACgF,EAAY,aAAehF,aAAgBwB,IAAcxB,EAAK,MAAQgF,EACvE,MAAO,GACX,IAAIlC,EAAOmC,GAAc,IAAIjF,CAAI,EACjC,GAAI8C,GAAQ,KAAM,CACdA,EAAO,EACP,QAASoC,KAASlF,EAAK,SAAU,CAC7B,GAAIkF,EAAM,MAAQF,GAAe,EAAEE,aAAiBhB,IAAO,CACvDpB,EAAO,EACP,KACJ,CACAA,GAAQ6B,GAASK,EAAaE,CAAK,CACvC,CACAD,GAAc,IAAIjF,EAAM8C,CAAI,CAChC,CACA,OAAOA,CACX,CACA,SAASe,GAETmB,EAEAxC,EAAUC,EAEV5C,EAAMC,EAEN8C,EAEAmB,EAEAoB,EAEAC,EAAQ,CACJ,IAAIC,EAAQ,EACZ,QAASlE,EAAItB,EAAMsB,EAAIrB,EAAIqB,IACvBkE,GAASV,GAASK,EAAaxC,EAASrB,CAAC,CAAC,EAC9C,IAAImE,EAAW,KAAK,KAAMD,EAAQ,IAAO,CAA4B,EACjEhC,EAAgB,CAAC,EAAGC,EAAiB,CAAC,EAC1C,SAASiC,EAAO/C,EAAUC,EAAW5C,EAAMC,EAAI0F,EAAQ,CACnD,QAASrE,EAAItB,EAAMsB,EAAIrB,GAAK,CACxB,IAAI2F,EAAYtE,EAAGuE,EAAajD,EAAUtB,CAAC,EAAGwE,EAAYhB,GAASK,EAAaxC,EAASrB,CAAC,CAAC,EAE3F,IADAA,IACOA,EAAIrB,EAAIqB,IAAK,CAChB,IAAIyE,EAAWjB,GAASK,EAAaxC,EAASrB,CAAC,CAAC,EAChD,GAAIwE,EAAYC,GAAYN,EACxB,MACJK,GAAaC,CACjB,CACA,GAAIzE,GAAKsE,EAAY,EAAG,CACpB,GAAIE,EAAYL,EAAU,CACtB,IAAIO,EAAOrD,EAASiD,CAAS,EAC7BF,EAAOM,EAAK,SAAUA,EAAK,UAAW,EAAGA,EAAK,SAAS,OAAQpD,EAAUgD,CAAS,EAAID,CAAM,EAC5F,QACJ,CACAnC,EAAc,KAAKb,EAASiD,CAAS,CAAC,CAC1C,KACK,CACD,IAAI1B,EAAStB,EAAUtB,EAAI,CAAC,EAAIqB,EAASrB,EAAI,CAAC,EAAE,OAASuE,EACzDrC,EAAc,KAAKQ,GAAamB,EAAaxC,EAAUC,EAAWgD,EAAWtE,EAAGuE,EAAY3B,EAAQ,KAAMqB,CAAM,CAAC,CACrH,CACA9B,EAAe,KAAKoC,EAAaF,EAAS5C,CAAK,CACnD,CACJ,CACA,OAAA2C,EAAO/C,EAAUC,EAAW5C,EAAMC,EAAI,CAAC,GAC/BqF,GAASC,GAAQ/B,EAAeC,EAAgBS,CAAM,CAClE,CA7uCA,IAII+B,GACEC,GASA5B,EA2EA6B,GAEAC,GA0FAC,GA+BAC,GAA4BC,GAG9B3F,GAkCEyD,GA+IAjC,GAiBAT,GAqHAjB,GAgIA8F,GAQAC,GAgFAC,GAscAtB,GAmMAuB,GAyBAC,GA0CAC,GAl7CNC,GAAAC,GAAA,kBAIId,GAAa,EACXC,GAAN,KAAY,CACR,YAAYlG,EAAMC,EAAI,CAClB,KAAK,KAAOD,EACZ,KAAK,GAAKC,CACd,CACJ,EAIMqE,EAAN,KAAe,CAEX,YAAY0C,EAAS,CAAC,EAAG,CACrB,KAAK,GAAKf,KACV,KAAK,QAAU,CAAC,CAACe,EAAO,QACxB,KAAK,YAAcA,EAAO,cAAgB,IAAM,CAC5C,MAAM,IAAI,MAAM,sDAAsD,CAC1E,EACJ,CAQA,IAAIC,EAAO,CACP,GAAI,KAAK,QACL,MAAM,IAAI,WAAW,wCAAwC,EACjE,OAAI,OAAOA,GAAS,aAChBA,EAAQb,GAAS,MAAMa,CAAK,GACxBlG,GAAS,CACb,IAAII,EAAS8F,EAAMlG,CAAI,EACvB,OAAOI,IAAW,OAAY,KAAO,CAAC,KAAMA,CAAM,CACtD,CACJ,CACJ,EAKAmD,EAAS,SAAW,IAAIA,EAAS,CAAE,YAAa4C,GAAOA,EAAI,MAAM,GAAG,CAAE,CAAC,EAIvE5C,EAAS,SAAW,IAAIA,EAAS,CAAE,YAAa4C,GAAOA,EAAI,MAAM,GAAG,CAAE,CAAC,EAIvE5C,EAAS,MAAQ,IAAIA,EAAS,CAAE,YAAa4C,GAAOA,EAAI,MAAM,GAAG,CAAE,CAAC,EAIpE5C,EAAS,YAAc,IAAIA,EAAS,CAAE,QAAS,EAAK,CAAC,EAKrDA,EAAS,UAAY,IAAIA,EAAS,CAAE,QAAS,EAAK,CAAC,EAInDA,EAAS,QAAU,IAAIA,EAAS,CAAE,QAAS,EAAK,CAAC,EAuB3C6B,GAAU,OAAO,OAAO,IAAI,EAE5BC,GAAN,MAAMe,CAAS,CAEX,YAKAC,EAEA5C,EAGA1B,EAEAuE,EAAQ,EAAG,CACP,KAAK,KAAOD,EACZ,KAAK,MAAQ5C,EACb,KAAK,GAAK1B,EACV,KAAK,MAAQuE,CACjB,CAEA,OAAO,OAAOC,EAAM,CAChB,IAAI9C,EAAQ8C,EAAK,OAASA,EAAK,MAAM,OAAS,OAAO,OAAO,IAAI,EAAInB,GAChEkB,GAASC,EAAK,IAAM,EAAuB,IAAMA,EAAK,QAAU,EAA2B,IAC1FA,EAAK,MAAQ,EAAyB,IAAMA,EAAK,MAAQ,KAAO,EAA6B,GAC9FvG,EAAO,IAAIoG,EAASG,EAAK,MAAQ,GAAI9C,EAAO8C,EAAK,GAAID,CAAK,EAC9D,GAAIC,EAAK,OACL,QAASC,KAAOD,EAAK,MAGjB,GAFK,MAAM,QAAQC,CAAG,IAClBA,EAAMA,EAAIxG,CAAI,GACdwG,EAAK,CACL,GAAIA,EAAI,CAAC,EAAE,QACP,MAAM,IAAI,WAAW,4CAA4C,EACrE/C,EAAM+C,EAAI,CAAC,EAAE,EAAE,EAAIA,EAAI,CAAC,CAC5B,EAER,OAAOxG,CACX,CAGA,KAAKyG,EAAM,CAAE,OAAO,KAAK,MAAMA,EAAK,EAAE,CAAG,CAEzC,IAAI,OAAQ,CAAE,OAAQ,KAAK,MAAQ,GAAwB,CAAG,CAE9D,IAAI,WAAY,CAAE,OAAQ,KAAK,MAAQ,GAA4B,CAAG,CAEtE,IAAI,SAAU,CAAE,OAAQ,KAAK,MAAQ,GAA0B,CAAG,CAGlE,IAAI,aAAc,CAAE,OAAQ,KAAK,MAAQ,GAA8B,CAAG,CAG1E,GAAGJ,EAAM,CACL,GAAI,OAAOA,GAAQ,SAAU,CACzB,GAAI,KAAK,MAAQA,EACb,MAAO,GACX,IAAIK,EAAQ,KAAK,KAAKnD,EAAS,KAAK,EACpC,OAAOmD,EAAQA,EAAM,QAAQL,CAAI,EAAI,GAAK,EAC9C,CACA,OAAO,KAAK,IAAMA,CACtB,CAOA,OAAO,MAAMM,EAAK,CACd,IAAIC,EAAS,OAAO,OAAO,IAAI,EAC/B,QAASH,KAAQE,EACb,QAASN,KAAQI,EAAK,MAAM,GAAG,EAC3BG,EAAOP,CAAI,EAAIM,EAAIF,CAAI,EAC/B,OAAQrH,GAAS,CACb,QAASyH,EAASzH,EAAK,KAAKmE,EAAS,KAAK,EAAGhD,EAAI,GAAIA,GAAKsG,EAASA,EAAO,OAAS,GAAItG,IAAK,CACxF,IAAIuG,EAAQF,EAAOrG,EAAI,EAAInB,EAAK,KAAOyH,EAAOtG,CAAC,CAAC,EAChD,GAAIuG,EACA,OAAOA,CACf,CACJ,CACJ,CACJ,EAEAzB,GAAS,KAAO,IAAIA,GAAS,GAAI,OAAO,OAAO,IAAI,EAAG,EAAG,CAA0B,EAQ7EC,GAAN,MAAMyB,CAAQ,CAGV,YAEAzF,EAAO,CACH,KAAK,MAAQA,EACb,QAASf,EAAI,EAAGA,EAAIe,EAAM,OAAQf,IAC9B,GAAIe,EAAMf,CAAC,EAAE,IAAMA,EACf,MAAM,IAAI,WAAW,6EAA6E,CAC9G,CAIA,UAAUkD,EAAO,CACb,IAAIuD,EAAW,CAAC,EAChB,QAAShH,KAAQ,KAAK,MAAO,CACzB,IAAIiH,EAAW,KACf,QAASC,KAAUzD,EAAO,CACtB,IAAI0D,EAAMD,EAAOlH,CAAI,EACjBmH,IACKF,IACDA,EAAW,OAAO,OAAO,CAAC,EAAGjH,EAAK,KAAK,GAC3CiH,EAASE,EAAI,CAAC,EAAE,EAAE,EAAIA,EAAI,CAAC,EAEnC,CACAH,EAAS,KAAKC,EAAW,IAAI5B,GAASrF,EAAK,KAAMiH,EAAUjH,EAAK,GAAIA,EAAK,KAAK,EAAIA,CAAI,CAC1F,CACA,OAAO,IAAI+G,EAAQC,CAAQ,CAC/B,CACJ,EACMzB,GAAa,IAAI,QAAWC,GAAkB,IAAI,SAIvD,SAAU3F,EAAU,CAIjBA,EAASA,EAAS,eAAoB,CAAC,EAAI,iBAI3CA,EAASA,EAAS,iBAAsB,CAAC,EAAI,mBAI7CA,EAASA,EAAS,aAAkB,CAAC,EAAI,eAKzCA,EAASA,EAAS,eAAoB,CAAC,EAAI,gBAC/C,GAAGA,KAAaA,GAAW,CAAC,EAAE,EAexByD,GAAN,MAAM8D,CAAK,CAEP,YAEApH,EAEA4B,EAGAC,EAEAsB,EAEAM,EAAO,CAOH,GANA,KAAK,KAAOzD,EACZ,KAAK,SAAW4B,EAChB,KAAK,UAAYC,EACjB,KAAK,OAASsB,EAEd,KAAK,MAAQ,KACTM,GAASA,EAAM,OAAQ,CACvB,KAAK,MAAQ,OAAO,OAAO,IAAI,EAC/B,OAAS,CAACgD,EAAMY,CAAK,IAAK5D,EACtB,KAAK,MAAM,OAAOgD,GAAQ,SAAWA,EAAOA,EAAK,EAAE,EAAIY,CAC/D,CACJ,CAEA,UAAW,CACP,IAAIC,EAAU,KAAK,KAAK/D,EAAS,OAAO,EACxC,GAAI+D,GAAW,CAACA,EAAQ,QACpB,OAAOA,EAAQ,KAAK,SAAS,EACjC,IAAI1F,EAAW,GACf,QAASjB,KAAM,KAAK,SAAU,CAC1B,IAAIwF,EAAMxF,EAAG,SAAS,EAClBwF,IACIvE,IACAA,GAAY,KAChBA,GAAYuE,EAEpB,CACA,OAAQ,KAAK,KAAK,MACb,KAAK,KAAK,KAAK,KAAK,IAAI,GAAK,CAAC,KAAK,KAAK,QAAU,KAAK,UAAU,KAAK,KAAK,IAAI,EAAI,KAAK,KAAK,OACzFvE,EAAS,OAAS,IAAMA,EAAW,IAAM,IAFzBA,CAG7B,CAIA,OAAOhC,EAAO,EAAG,CACb,OAAO,IAAI+F,GAAW,KAAK,QAAS/F,CAAI,CAC5C,CAIA,SAASZ,EAAKD,EAAO,EAAGa,EAAO,EAAG,CAC9B,IAAI2H,EAAQhC,GAAW,IAAI,IAAI,GAAK,KAAK,QACrCnE,EAAS,IAAIuE,GAAW4B,CAAK,EACjC,OAAAnG,EAAO,OAAOpC,EAAKD,CAAI,EACvBwG,GAAW,IAAI,KAAMnE,EAAO,KAAK,EAC1BA,CACX,CAGA,IAAI,SAAU,CACV,OAAO,IAAIzB,GAAS,KAAM,EAAG,EAAG,IAAI,CACxC,CAUA,QAAQX,EAAKD,EAAO,EAAG,CACnB,IAAIK,EAAOG,GAAYgG,GAAW,IAAI,IAAI,GAAK,KAAK,QAASvG,EAAKD,EAAM,EAAK,EAC7E,OAAAwG,GAAW,IAAI,KAAMnG,CAAI,EAClBA,CACX,CAMA,aAAaJ,EAAKD,EAAO,EAAG,CACxB,IAAIK,EAAOG,GAAYiG,GAAgB,IAAI,IAAI,GAAK,KAAK,QAASxG,EAAKD,EAAM,EAAI,EACjF,OAAAyG,GAAgB,IAAI,KAAMpG,CAAI,EACvBA,CACX,CAMA,QAAQmH,EAAM,CACV,GAAI,CAAE,MAAAiB,EAAO,MAAAC,EAAO,KAAAxI,EAAO,EAAG,GAAAC,EAAK,KAAK,MAAO,EAAIqH,EAC/C3G,EAAO2G,EAAK,MAAQ,EAAGmB,GAAQ9H,EAAOC,GAAS,kBAAoB,EACvE,QAAS8H,EAAI,KAAK,OAAO/H,EAAOC,GAAS,gBAAgB,IAAK,CAC1D,IAAI+H,EAAU,GACd,GAAID,EAAE,MAAQzI,GAAMyI,EAAE,IAAM1I,IAAS,CAACyI,GAAQC,EAAE,KAAK,aAAeH,EAAMG,CAAC,IAAM,IAAQ,CACrF,GAAIA,EAAE,WAAW,EACb,SACJC,EAAU,EACd,CACA,KACQA,GAAWH,IAAUC,GAAQ,CAACC,EAAE,KAAK,cACrCF,EAAME,CAAC,EACP,CAAAA,EAAE,YAAY,GAHb,CAKL,GAAI,CAACA,EAAE,OAAO,EACV,OACJC,EAAU,EACd,CACJ,CACJ,CAGA,KAAKnB,EAAM,CACP,OAAQA,EAAK,QAAiC,KAAK,MAAQ,KAAK,MAAMA,EAAK,EAAE,EAAI,OAA1D,KAAK,KAAK,KAAKA,CAAI,CAC9C,CAIA,IAAI,YAAa,CACb,IAAIrG,EAAS,CAAC,EACd,GAAI,KAAK,MACL,QAAS2B,KAAM,KAAK,MAChB3B,EAAO,KAAK,CAAC,CAAC2B,EAAI,KAAK,MAAMA,CAAE,CAAC,CAAC,EACzC,OAAO3B,CACX,CAIA,QAAQ6F,EAAS,CAAC,EAAG,CACjB,OAAO,KAAK,SAAS,QAAU,EAA+B,KAC1DhD,GAAaoC,GAAS,KAAM,KAAK,SAAU,KAAK,UAAW,EAAG,KAAK,SAAS,OAAQ,EAAG,KAAK,OAAQ,CAACzD,EAAUC,EAAWsB,IAAW,IAAIiE,EAAK,KAAK,KAAMxF,EAAUC,EAAWsB,EAAQ,KAAK,UAAU,EAAG8C,EAAO,WAAa,CAACrE,EAAUC,EAAWsB,IAAW,IAAIiE,EAAK/B,GAAS,KAAMzD,EAAUC,EAAWsB,CAAM,EAAE,CAC1T,CAGA,OAAO,MAAMrC,EAAM,CAAE,OAAOD,GAAUC,CAAI,CAAG,CACjD,EAEAwC,GAAK,MAAQ,IAAIA,GAAK+B,GAAS,KAAM,CAAC,EAAG,CAAC,EAAG,CAAC,EACxChE,GAAN,MAAMwG,CAAiB,CACnB,YAAY9G,EAAQwB,EAAO,CACvB,KAAK,OAASxB,EACd,KAAK,MAAQwB,CACjB,CACA,IAAI,IAAK,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CAC/C,IAAI,OAAQ,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CAClD,IAAI,KAAM,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CAChD,IAAI,MAAO,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CACjD,IAAI,KAAM,CAAE,OAAO,KAAK,KAAO,CAC/B,MAAO,CAAE,KAAK,OAAS,CAAG,CAC1B,MAAO,CAAE,OAAO,IAAIsF,EAAiB,KAAK,OAAQ,KAAK,KAAK,CAAG,CACnE,EAKMjH,GAAN,MAAMkH,CAAW,CAEb,YAEA/G,EAEAoC,EAEA4E,EAAK,CACD,KAAK,OAAShH,EACd,KAAK,OAASoC,EACd,KAAK,IAAM4E,CACf,CAEA,IAAI,MAAO,CAAE,OAAO1C,GAAS,IAAM,CAEnC,UAAW,CACP,IAAIjF,EAAS,CAAC,EACd,QAASmC,EAAQ,EAAGA,EAAQ,KAAK,OAAO,QACpCnC,EAAO,KAAK,KAAK,YAAYmC,CAAK,CAAC,EACnCA,EAAQ,KAAK,OAAOA,EAAQ,CAAC,EAEjC,OAAOnC,EAAO,KAAK,GAAG,CAC1B,CAEA,YAAYmC,EAAO,CACf,IAAIR,EAAK,KAAK,OAAOQ,CAAK,EAAGyF,EAAW,KAAK,OAAOzF,EAAQ,CAAC,EACzDvC,EAAO,KAAK,IAAI,MAAM+B,CAAE,EAAG3B,EAASJ,EAAK,KAI7C,GAHI,KAAK,KAAKI,CAAM,GAAK,CAACJ,EAAK,UAC3BI,EAAS,KAAK,UAAUA,CAAM,GAClCmC,GAAS,EACLyF,GAAYzF,EACZ,OAAOnC,EACX,IAAIwB,EAAW,CAAC,EAChB,KAAOW,EAAQyF,GACXpG,EAAS,KAAK,KAAK,YAAYW,CAAK,CAAC,EACrCA,EAAQ,KAAK,OAAOA,EAAQ,CAAC,EAEjC,OAAOnC,EAAS,IAAMwB,EAAS,KAAK,GAAG,EAAI,GAC/C,CAEA,UAAUuC,EAAY6D,EAAUC,EAAKjJ,EAAKD,EAAM,CAC5C,GAAI,CAAE,OAAAgC,CAAO,EAAI,KAAMmH,EAAO,GAC9B,QAAS3H,EAAI4D,EAAY5D,GAAKyH,GACtB,EAAAlJ,GAAUC,EAAMC,EAAK+B,EAAOR,EAAI,CAAC,EAAGQ,EAAOR,EAAI,CAAC,CAAC,IACjD2H,EAAO3H,EACH0H,EAAM,IAHsB1H,EAAIQ,EAAOR,EAAI,CAAC,EACpD,CAMJ,OAAO2H,CACX,CAEA,MAAMC,EAAQC,EAAMnJ,EAAM,CACtB,IAAIoJ,EAAI,KAAK,OACTC,EAAO,IAAI,YAAYF,EAAOD,CAAM,EAAGI,EAAM,EACjD,QAAShI,EAAI4H,EAAQK,EAAI,EAAGjI,EAAI6H,GAAO,CACnCE,EAAKE,GAAG,EAAIH,EAAE9H,GAAG,EACjB+H,EAAKE,GAAG,EAAIH,EAAE9H,GAAG,EAAItB,EACrB,IAAIC,EAAKoJ,EAAKE,GAAG,EAAIH,EAAE9H,GAAG,EAAItB,EAC9BqJ,EAAKE,GAAG,EAAIH,EAAE9H,GAAG,EAAI4H,EACrBI,EAAM,KAAK,IAAIA,EAAKrJ,CAAE,CAC1B,CACA,OAAO,IAAI4I,EAAWQ,EAAMC,EAAK,KAAK,GAAG,CAC7C,CACJ,EAoDM5I,GAAN,MAAM8I,CAAS,CACX,YAAYC,EAAOzJ,EAEnBsD,EAAOoG,EAAS,CACZ,KAAK,MAAQD,EACb,KAAK,KAAOzJ,EACZ,KAAK,MAAQsD,EACb,KAAK,QAAUoG,CACnB,CACA,IAAI,MAAO,CAAE,OAAO,KAAK,MAAM,IAAM,CACrC,IAAI,MAAO,CAAE,OAAO,KAAK,MAAM,KAAK,IAAM,CAC1C,IAAI,IAAK,CAAE,OAAO,KAAK,KAAO,KAAK,MAAM,MAAQ,CACjD,UAAUpI,EAAG0H,EAAKjJ,EAAKD,EAAMa,EAAO,EAAG,CACnC,QAASF,EAAS,OAAQ,CACtB,OAAS,CAAE,SAAAkC,EAAU,UAAAC,CAAU,EAAInC,EAAO,MAAOkJ,EAAIX,EAAM,EAAIrG,EAAS,OAAS,GAAIrB,GAAKqI,EAAGrI,GAAK0H,EAAK,CACnG,IAAIY,EAAOjH,EAASrB,CAAC,EAAGyB,EAAQH,EAAUtB,CAAC,EAAIb,EAAO,KACtD,GAAKZ,GAAUC,EAAMC,EAAKgD,EAAOA,EAAQ6G,EAAK,MAAM,GAEpD,GAAIA,aAAgBjI,GAAY,CAC5B,GAAIhB,EAAOC,GAAS,eAChB,SACJ,IAAI0C,EAAQsG,EAAK,UAAU,EAAGA,EAAK,OAAO,OAAQZ,EAAKjJ,EAAMgD,EAAOjD,CAAI,EACxE,GAAIwD,EAAQ,GACR,OAAO,IAAImD,GAAW,IAAID,GAAc/F,EAAQmJ,EAAMtI,EAAGyB,CAAK,EAAG,KAAMO,CAAK,CACpF,SACU3C,EAAOC,GAAS,kBAAsB,CAACgJ,EAAK,KAAK,aAAepI,GAASoI,CAAI,EAAI,CACvF,IAAIvB,EACJ,GAAI,EAAE1H,EAAOC,GAAS,eAClBgJ,EAAK,QAAUvB,EAAUuB,EAAK,KAAKtF,EAAS,OAAO,IAAM,CAAC+D,EAAQ,QAClE,OAAO,IAAImB,EAASnB,EAAQ,KAAMtF,EAAOzB,EAAGb,CAAM,EACtD,IAAII,EAAQ,IAAI2I,EAASI,EAAM7G,EAAOzB,EAAGb,CAAM,EAC/C,OAAQE,EAAOC,GAAS,kBAAqB,CAACC,EAAM,KAAK,YAAcA,EACjEA,EAAM,UAAUmI,EAAM,EAAIY,EAAK,SAAS,OAAS,EAAI,EAAGZ,EAAKjJ,EAAKD,CAAI,CAChF,EACJ,CAQA,GAPKa,EAAOC,GAAS,kBAAqB,CAACH,EAAO,KAAK,cAEnDA,EAAO,OAAS,EAChBa,EAAIb,EAAO,MAAQuI,EAEnB1H,EAAI0H,EAAM,EAAI,GAAKvI,EAAO,QAAQ,MAAM,SAAS,OACrDA,EAASA,EAAO,QACZ,CAACA,GACD,OAAO,IACf,CACJ,CACA,IAAI,YAAa,CAAE,OAAO,KAAK,UAAU,EAAG,EAAG,EAAG,CAAqB,CAAG,CAC1E,IAAI,WAAY,CAAE,OAAO,KAAK,UAAU,KAAK,MAAM,SAAS,OAAS,EAAG,GAAI,EAAG,CAAqB,CAAG,CACvG,WAAWV,EAAK,CAAE,OAAO,KAAK,UAAU,EAAG,EAAGA,EAAK,CAAkB,CAAG,CACxE,YAAYA,EAAK,CAAE,OAAO,KAAK,UAAU,KAAK,MAAM,SAAS,OAAS,EAAG,GAAIA,EAAK,EAAoB,CAAG,CACzG,MAAMA,EAAKD,EAAMa,EAAO,EAAG,CACvB,IAAI0H,EACJ,GAAI,EAAE1H,EAAOC,GAAS,kBAAoByH,EAAU,KAAK,MAAM,KAAK/D,EAAS,OAAO,IAAM+D,EAAQ,QAAS,CACvG,IAAIwB,EAAO9J,EAAM,KAAK,KACtB,OAAS,CAAE,KAAAC,EAAM,GAAAC,CAAG,IAAKoI,EAAQ,QAC7B,IAAKvI,EAAO,EAAIE,GAAQ6J,EAAO7J,EAAO6J,KACjC/J,EAAO,EAAIG,GAAM4J,EAAO5J,EAAK4J,GAC9B,OAAO,IAAIL,EAASnB,EAAQ,KAAMA,EAAQ,QAAQ,CAAC,EAAE,KAAO,KAAK,KAAM,GAAI,IAAI,CAE3F,CACA,OAAO,KAAK,UAAU,EAAG,EAAGtI,EAAKD,EAAMa,CAAI,CAC/C,CACA,uBAAwB,CACpB,IAAImJ,EAAM,KACV,KAAOA,EAAI,KAAK,aAAeA,EAAI,SAC/BA,EAAMA,EAAI,QACd,OAAOA,CACX,CACA,IAAI,QAAS,CACT,OAAO,KAAK,QAAU,KAAK,QAAQ,sBAAsB,EAAI,IACjE,CACA,IAAI,aAAc,CACd,OAAO,KAAK,SAAW,KAAK,OAAS,EAAI,KAAK,QAAQ,UAAU,KAAK,MAAQ,EAAG,EAAG,EAAG,CAAqB,EAAI,IACnH,CACA,IAAI,aAAc,CACd,OAAO,KAAK,SAAW,KAAK,OAAS,EAAI,KAAK,QAAQ,UAAU,KAAK,MAAQ,EAAG,GAAI,EAAG,CAAqB,EAAI,IACpH,CACA,OAAOnJ,EAAO,EAAG,CAAE,OAAO,IAAI+F,GAAW,KAAM/F,CAAI,CAAG,CACtD,IAAI,MAAO,CAAE,OAAO,KAAK,KAAO,CAChC,QAAS,CAAE,OAAO,KAAK,KAAO,CAC9B,QAAQZ,EAAKD,EAAO,EAAG,CACnB,OAAOQ,GAAY,KAAMP,EAAKD,EAAM,EAAK,CAC7C,CACA,aAAaC,EAAKD,EAAO,EAAG,CACxB,OAAOQ,GAAY,KAAMP,EAAKD,EAAM,EAAI,CAC5C,CACA,2BAA2BC,EAAK,CAAE,OAAOG,GAA2B,KAAMH,CAAG,CAAG,CAChF,SAASgB,EAAMC,EAAS,KAAMC,EAAQ,KAAM,CACxC,IAAI8I,EAAIjJ,GAAY,KAAMC,EAAMC,EAAQC,CAAK,EAC7C,OAAO8I,EAAE,OAASA,EAAE,CAAC,EAAI,IAC7B,CACA,YAAYhJ,EAAMC,EAAS,KAAMC,EAAQ,KAAM,CAC3C,OAAOH,GAAY,KAAMC,EAAMC,EAAQC,CAAK,CAChD,CAEA,UAAW,CAAE,OAAO,KAAK,MAAM,SAAS,CAAG,CAC3C,IAAI,MAAO,CAAE,OAAO,IAAM,CAC1B,aAAaI,EAAS,CAAE,OAAOD,GAAiB,KAAMC,CAAO,CAAG,CACpE,EA8BMmF,GAAN,KAAoB,CAChB,YAAY/F,EAAQqB,EAAQwB,EAAOP,EAAO,CACtC,KAAK,OAAStC,EACd,KAAK,OAASqB,EACd,KAAK,MAAQwB,EACb,KAAK,MAAQP,CACjB,CACJ,EACM0D,GAAN,MAAMuD,CAAW,CACb,IAAI,MAAO,CAAE,OAAO,KAAK,KAAK,IAAM,CACpC,IAAI,MAAO,CAAE,OAAO,KAAK,QAAQ,MAAQ,KAAK,QAAQ,OAAO,OAAO,KAAK,MAAQ,CAAC,CAAG,CACrF,IAAI,IAAK,CAAE,OAAO,KAAK,QAAQ,MAAQ,KAAK,QAAQ,OAAO,OAAO,KAAK,MAAQ,CAAC,CAAG,CACnF,YAAY3I,EAASqI,EAASpG,EAAO,CACjC,KAAK,QAAUjC,EACf,KAAK,QAAUqI,EACf,KAAK,MAAQpG,EACb,KAAK,KAAOjC,EAAQ,OAAO,IAAI,MAAMA,EAAQ,OAAO,OAAOiC,CAAK,CAAC,CACrE,CACA,MAAM0F,EAAKjJ,EAAKD,EAAM,CAClB,GAAI,CAAE,OAAAgC,CAAO,EAAI,KAAK,QAClBwB,EAAQxB,EAAO,UAAU,KAAK,MAAQ,EAAGA,EAAO,OAAO,KAAK,MAAQ,CAAC,EAAGkH,EAAKjJ,EAAM,KAAK,QAAQ,MAAOD,CAAI,EAC/G,OAAOwD,EAAQ,EAAI,KAAO,IAAI0G,EAAW,KAAK,QAAS,KAAM1G,CAAK,CACtE,CACA,IAAI,YAAa,CAAE,OAAO,KAAK,MAAM,EAAG,EAAG,CAAqB,CAAG,CACnE,IAAI,WAAY,CAAE,OAAO,KAAK,MAAM,GAAI,EAAG,CAAqB,CAAG,CACnE,WAAWvD,EAAK,CAAE,OAAO,KAAK,MAAM,EAAGA,EAAK,CAAkB,CAAG,CACjE,YAAYA,EAAK,CAAE,OAAO,KAAK,MAAM,GAAIA,EAAK,EAAoB,CAAG,CACrE,MAAMA,EAAKD,EAAMa,EAAO,EAAG,CACvB,GAAIA,EAAOC,GAAS,eAChB,OAAO,KACX,GAAI,CAAE,OAAAkB,CAAO,EAAI,KAAK,QAClBwB,EAAQxB,EAAO,UAAU,KAAK,MAAQ,EAAGA,EAAO,OAAO,KAAK,MAAQ,CAAC,EAAGhC,EAAO,EAAI,EAAI,GAAIC,EAAM,KAAK,QAAQ,MAAOD,CAAI,EAC7H,OAAOwD,EAAQ,EAAI,KAAO,IAAI0G,EAAW,KAAK,QAAS,KAAM1G,CAAK,CACtE,CACA,IAAI,QAAS,CACT,OAAO,KAAK,SAAW,KAAK,QAAQ,OAAO,sBAAsB,CACrE,CACA,gBAAgB0F,EAAK,CACjB,OAAO,KAAK,QAAU,KAAO,KAAK,QAAQ,OAAO,UAAU,KAAK,QAAQ,MAAQA,EAAKA,EAAK,EAAG,CAAqB,CACtH,CACA,IAAI,aAAc,CACd,GAAI,CAAE,OAAAlH,CAAO,EAAI,KAAK,QAClBb,EAAQa,EAAO,OAAO,KAAK,MAAQ,CAAC,EACxC,OAAIb,GAAS,KAAK,QAAUa,EAAO,OAAO,KAAK,QAAQ,MAAQ,CAAC,EAAIA,EAAO,OAAO,QACvE,IAAIkI,EAAW,KAAK,QAAS,KAAK,QAAS/I,CAAK,EACpD,KAAK,gBAAgB,CAAC,CACjC,CACA,IAAI,aAAc,CACd,GAAI,CAAE,OAAAa,CAAO,EAAI,KAAK,QAClBW,EAAc,KAAK,QAAU,KAAK,QAAQ,MAAQ,EAAI,EAC1D,OAAI,KAAK,OAASA,EACP,KAAK,gBAAgB,EAAE,EAC3B,IAAIuH,EAAW,KAAK,QAAS,KAAK,QAASlI,EAAO,UAAUW,EAAa,KAAK,MAAO,GAAI,EAAG,CAAqB,CAAC,CAC7H,CACA,OAAO9B,EAAO,EAAG,CAAE,OAAO,IAAI+F,GAAW,KAAM/F,CAAI,CAAG,CACtD,IAAI,MAAO,CAAE,OAAO,IAAM,CAC1B,QAAS,CACL,IAAIgC,EAAW,CAAC,EAAGC,EAAY,CAAC,EAC5B,CAAE,OAAAd,CAAO,EAAI,KAAK,QAClBoH,EAAS,KAAK,MAAQ,EAAGC,EAAOrH,EAAO,OAAO,KAAK,MAAQ,CAAC,EAChE,GAAIqH,EAAOD,EAAQ,CACf,IAAIlJ,EAAO8B,EAAO,OAAO,KAAK,MAAQ,CAAC,EACvCa,EAAS,KAAKb,EAAO,MAAMoH,EAAQC,EAAMnJ,CAAI,CAAC,EAC9C4C,EAAU,KAAK,CAAC,CACpB,CACA,OAAO,IAAIyB,GAAK,KAAK,KAAM1B,EAAUC,EAAW,KAAK,GAAK,KAAK,IAAI,CACvE,CACA,QAAQ7C,EAAKD,EAAO,EAAG,CACnB,OAAOQ,GAAY,KAAMP,EAAKD,EAAM,EAAK,CAC7C,CACA,aAAaC,EAAKD,EAAO,EAAG,CACxB,OAAOQ,GAAY,KAAMP,EAAKD,EAAM,EAAI,CAC5C,CACA,2BAA2BC,EAAK,CAAE,OAAOG,GAA2B,KAAMH,CAAG,CAAG,CAEhF,UAAW,CAAE,OAAO,KAAK,QAAQ,OAAO,YAAY,KAAK,KAAK,CAAG,CACjE,SAASgB,EAAMC,EAAS,KAAMC,EAAQ,KAAM,CACxC,IAAI8I,EAAIjJ,GAAY,KAAMC,EAAMC,EAAQC,CAAK,EAC7C,OAAO8I,EAAE,OAASA,EAAE,CAAC,EAAI,IAC7B,CACA,YAAYhJ,EAAMC,EAAS,KAAMC,EAAQ,KAAM,CAC3C,OAAOH,GAAY,KAAMC,EAAMC,EAAQC,CAAK,CAChD,CACA,IAAI,MAAO,CAAE,OAAO,IAAM,CAC1B,aAAaI,EAAS,CAAE,OAAOD,GAAiB,KAAMC,CAAO,CAAG,CACpE,EAGMqF,GAAN,KAAiB,CAEb,IAAI,MAAO,CAAE,OAAO,KAAK,KAAK,IAAM,CAEpC,YAAYvG,EAEZQ,EAAO,EAAG,CAQN,GAPA,KAAK,KAAOA,EAEZ,KAAK,OAAS,KACd,KAAK,MAAQ,CAAC,EAEd,KAAK,MAAQ,EACb,KAAK,WAAa,KACdR,aAAgBO,GAChB,KAAK,UAAUP,CAAI,MAElB,CACD,KAAK,MAAQA,EAAK,QAAQ,OAC1B,KAAK,OAASA,EAAK,QACnB,QAAS8J,EAAI9J,EAAK,QAAS8J,EAAGA,EAAIA,EAAE,QAChC,KAAK,MAAM,QAAQA,EAAE,KAAK,EAC9B,KAAK,WAAa9J,EAClB,KAAK,SAASA,EAAK,KAAK,CAC5B,CACJ,CACA,UAAUA,EAAM,CACZ,OAAKA,GAEL,KAAK,MAAQA,EACb,KAAK,KAAOA,EAAK,KACjB,KAAK,KAAOA,EAAK,KACjB,KAAK,GAAKA,EAAK,GACR,IALI,EAMf,CACA,SAASmD,EAAOvC,EAAM,CAClB,KAAK,MAAQuC,EACb,GAAI,CAAE,MAAAP,EAAO,OAAAjB,CAAO,EAAI,KAAK,OAC7B,YAAK,KAAOf,GAAQe,EAAO,IAAI,MAAMA,EAAO,OAAOwB,CAAK,CAAC,EACzD,KAAK,KAAOP,EAAQjB,EAAO,OAAOwB,EAAQ,CAAC,EAC3C,KAAK,GAAKP,EAAQjB,EAAO,OAAOwB,EAAQ,CAAC,EAClC,EACX,CACA,MAAMnD,EAAM,CACR,OAAKA,EAEDA,aAAgBO,IAChB,KAAK,OAAS,KACP,KAAK,UAAUP,CAAI,IAE9B,KAAK,OAASA,EAAK,QACZ,KAAK,SAASA,EAAK,MAAOA,EAAK,IAAI,GAN/B,EAOf,CAEA,UAAW,CACP,OAAO,KAAK,OAAS,KAAK,OAAO,OAAO,YAAY,KAAK,KAAK,EAAI,KAAK,MAAM,SAAS,CAC1F,CAEA,WAAW6I,EAAKjJ,EAAKD,EAAM,CACvB,GAAI,CAAC,KAAK,OACN,OAAO,KAAK,MAAM,KAAK,MAAM,UAAUkJ,EAAM,EAAI,KAAK,MAAM,MAAM,SAAS,OAAS,EAAI,EAAGA,EAAKjJ,EAAKD,EAAM,KAAK,IAAI,CAAC,EACzH,GAAI,CAAE,OAAAgC,CAAO,EAAI,KAAK,OAClBwB,EAAQxB,EAAO,UAAU,KAAK,MAAQ,EAAGA,EAAO,OAAO,KAAK,MAAQ,CAAC,EAAGkH,EAAKjJ,EAAM,KAAK,OAAO,MAAOD,CAAI,EAC9G,OAAIwD,EAAQ,EACD,IACX,KAAK,MAAM,KAAK,KAAK,KAAK,EACnB,KAAK,SAASA,CAAK,EAC9B,CAGA,YAAa,CAAE,OAAO,KAAK,WAAW,EAAG,EAAG,CAAqB,CAAG,CAEpE,WAAY,CAAE,OAAO,KAAK,WAAW,GAAI,EAAG,CAAqB,CAAG,CAEpE,WAAWvD,EAAK,CAAE,OAAO,KAAK,WAAW,EAAGA,EAAK,CAAkB,CAAG,CAEtE,YAAYA,EAAK,CAAE,OAAO,KAAK,WAAW,GAAIA,EAAK,EAAoB,CAAG,CAM1E,MAAMA,EAAKD,EAAMa,EAAO,KAAK,KAAM,CAC/B,OAAK,KAAK,OAEHA,EAAOC,GAAS,eAAiB,GAAQ,KAAK,WAAW,EAAGb,EAAKD,CAAI,EADjE,KAAK,MAAM,KAAK,MAAM,MAAMC,EAAKD,EAAMa,CAAI,CAAC,CAE3D,CAEA,QAAS,CACL,GAAI,CAAC,KAAK,OACN,OAAO,KAAK,UAAW,KAAK,KAAOC,GAAS,iBAAoB,KAAK,MAAM,QAAU,KAAK,MAAM,MAAM,EAC1G,GAAI,KAAK,MAAM,OACX,OAAO,KAAK,SAAS,KAAK,MAAM,IAAI,CAAC,EACzC,IAAIH,EAAU,KAAK,KAAOG,GAAS,iBAAoB,KAAK,OAAO,OAAS,KAAK,OAAO,OAAO,sBAAsB,EACrH,YAAK,OAAS,KACP,KAAK,UAAUH,CAAM,CAChC,CAEA,QAAQuI,EAAK,CACT,GAAI,CAAC,KAAK,OACN,OAAQ,KAAK,MAAM,QACb,KAAK,MAAM,KAAK,MAAM,MAAQ,EAAI,KAC9B,KAAK,MAAM,QAAQ,UAAU,KAAK,MAAM,MAAQA,EAAKA,EAAK,EAAG,EAAuB,KAAK,IAAI,CAAC,EAF3E,GAGjC,GAAI,CAAE,OAAAlH,CAAO,EAAI,KAAK,OAAQoI,EAAI,KAAK,MAAM,OAAS,EACtD,GAAIlB,EAAM,EAAG,CACT,IAAIvG,EAAcyH,EAAI,EAAI,EAAI,KAAK,MAAMA,CAAC,EAAI,EAC9C,GAAI,KAAK,OAASzH,EACd,OAAO,KAAK,SAASX,EAAO,UAAUW,EAAa,KAAK,MAAO,GAAI,EAAG,CAAqB,CAAC,CACpG,KACK,CACD,IAAIxB,EAAQa,EAAO,OAAO,KAAK,MAAQ,CAAC,EACxC,GAAIb,GAASiJ,EAAI,EAAIpI,EAAO,OAAO,OAASA,EAAO,OAAO,KAAK,MAAMoI,CAAC,EAAI,CAAC,GACvE,OAAO,KAAK,SAASjJ,CAAK,CAClC,CACA,OAAOiJ,EAAI,EAAI,KAAK,MAAM,KAAK,OAAO,OAAO,UAAU,KAAK,OAAO,MAAQlB,EAAKA,EAAK,EAAG,EAAuB,KAAK,IAAI,CAAC,EAAI,EACjI,CAEA,aAAc,CAAE,OAAO,KAAK,QAAQ,CAAC,CAAG,CAExC,aAAc,CAAE,OAAO,KAAK,QAAQ,EAAE,CAAG,CACzC,WAAWA,EAAK,CACZ,IAAI1F,EAAO7C,EAAQ,CAAE,OAAAqB,CAAO,EAAI,KAChC,GAAIA,EAAQ,CACR,GAAIkH,EAAM,GACN,GAAI,KAAK,MAAQlH,EAAO,OAAO,OAAO,OAClC,MAAO,OAGX,SAASR,EAAI,EAAGA,EAAI,KAAK,MAAOA,IAC5B,GAAIQ,EAAO,OAAO,OAAOR,EAAI,CAAC,EAAI,KAAK,MACnC,MAAO,IAElB,CAAE,MAAAgC,EAAO,OAAA7C,CAAO,EAAIqB,EACzB,MAEK,CAAE,MAAAwB,EAAO,QAAS7C,CAAO,EAAI,KAAK,OAEvC,KAAOA,EAAQ,CAAE,MAAA6C,EAAO,QAAS7C,CAAO,EAAIA,EACxC,GAAI6C,EAAQ,GACR,QAAShC,EAAIgC,EAAQ0F,EAAKW,EAAIX,EAAM,EAAI,GAAKvI,EAAO,MAAM,SAAS,OAAQa,GAAKqI,EAAGrI,GAAK0H,EAAK,CACzF,IAAI3D,EAAQ5E,EAAO,MAAM,SAASa,CAAC,EACnC,GAAK,KAAK,KAAOV,GAAS,kBACtByE,aAAiB1D,IACjB,CAAC0D,EAAM,KAAK,aACZ7D,GAAS6D,CAAK,EACd,MAAO,EACf,CAER,MAAO,EACX,CACA,KAAK2D,EAAKT,EAAO,CACb,GAAIA,GAAS,KAAK,WAAWS,EAAK,EAAG,CAAqB,EACtD,MAAO,GACX,OAAS,CACL,GAAI,KAAK,QAAQA,CAAG,EAChB,MAAO,GACX,GAAI,KAAK,WAAWA,CAAG,GAAK,CAAC,KAAK,OAAO,EACrC,MAAO,EACf,CACJ,CAMA,KAAKT,EAAQ,GAAM,CAAE,OAAO,KAAK,KAAK,EAAGA,CAAK,CAAG,CAKjD,KAAKA,EAAQ,GAAM,CAAE,OAAO,KAAK,KAAK,GAAIA,CAAK,CAAG,CAIlD,OAAOxI,EAAKD,EAAO,EAAG,CAElB,MAAO,KAAK,MAAQ,KAAK,KACpBA,EAAO,EAAI,KAAK,MAAQC,EAAM,KAAK,KAAOA,KAC1CD,EAAO,GAAK,KAAK,IAAMC,EAAM,KAAK,GAAKA,KACnC,KAAK,OAAO,GAAjB,CAGJ,KAAO,KAAK,WAAW,EAAGA,EAAKD,CAAI,GAAG,CACtC,OAAO,IACX,CAGA,IAAI,MAAO,CACP,GAAI,CAAC,KAAK,OACN,OAAO,KAAK,MAChB,IAAIqK,EAAQ,KAAK,WAAYhJ,EAAS,KAAMiJ,EAAQ,EACpD,GAAID,GAASA,EAAM,SAAW,KAAK,OAC/B/J,EAAM,QAASkD,EAAQ,KAAK,MAAO4G,EAAI,KAAK,MAAM,OAAQA,GAAK,GAAI,CAC/D,QAASxB,EAAIyB,EAAOzB,EAAGA,EAAIA,EAAE,QACzB,GAAIA,EAAE,OAASpF,EAAO,CAClB,GAAIA,GAAS,KAAK,MACd,OAAOoF,EACXvH,EAASuH,EACT0B,EAAQF,EAAI,EACZ,MAAM9J,CACV,CACJkD,EAAQ,KAAK,MAAM,EAAE4G,CAAC,CAC1B,CAEJ,QAAS,EAAIE,EAAO,EAAI,KAAK,MAAM,OAAQ,IACvCjJ,EAAS,IAAIsF,GAAW,KAAK,OAAQtF,EAAQ,KAAK,MAAM,CAAC,CAAC,EAC9D,OAAO,KAAK,WAAa,IAAIsF,GAAW,KAAK,OAAQtF,EAAQ,KAAK,KAAK,CAC3E,CAIA,IAAI,MAAO,CACP,OAAO,KAAK,OAAS,KAAO,KAAK,MAAM,KAC3C,CAKA,QAAQoH,EAAOC,EAAO,CAClB,QAAS4B,EAAQ,IAAK,CAClB,IAAIC,EAAY,GAChB,GAAI,KAAK,KAAK,aAAe9B,EAAM,IAAI,IAAM,GAAO,CAChD,GAAI,KAAK,WAAW,EAAG,CACnB6B,IACA,QACJ,CACK,KAAK,KAAK,cACXC,EAAY,GACpB,CACA,KACQA,GAAa7B,GACbA,EAAM,IAAI,EACd6B,EAAY,KAAK,KAAK,YAClB,MAAK,YAAY,GAJhB,CAML,GAAI,CAACD,EACD,OACJ,KAAK,OAAO,EACZA,IACAC,EAAY,EAChB,CACJ,CACJ,CAIA,aAAahJ,EAAS,CAClB,GAAI,CAAC,KAAK,OACN,OAAOD,GAAiB,KAAK,KAAMC,CAAO,EAC9C,GAAI,CAAE,OAAAS,CAAO,EAAI,KAAK,OAAQ,CAAE,MAAAO,CAAM,EAAIP,EAAO,IACjD,QAAS,EAAIT,EAAQ,OAAS,EAAG6I,EAAI,KAAK,MAAM,OAAS,EAAG,GAAK,EAAGA,IAAK,CACrE,GAAIA,EAAI,EACJ,OAAO9I,GAAiB,KAAK,KAAMC,EAAS,CAAC,EACjD,IAAIN,EAAOsB,EAAMP,EAAO,OAAO,KAAK,MAAMoI,CAAC,CAAC,CAAC,EAC7C,GAAI,CAACnJ,EAAK,YAAa,CACnB,GAAIM,EAAQ,CAAC,GAAKA,EAAQ,CAAC,GAAKN,EAAK,KACjC,MAAO,GACX,GACJ,CACJ,CACA,MAAO,EACX,CACJ,EAgMMqE,GAAgB,IAAI,QAmMpBuB,GAAN,KAAa,CAST,WAAW2D,EAAOC,EAAWC,EAAQ,CACjC,OAAI,OAAOF,GAAS,WAChBA,EAAQ,IAAI1D,GAAY0D,CAAK,GACjCE,EAAUA,EAAwCA,EAAO,OAASA,EAAO,IAAIT,GAAK,IAAI7D,GAAM6D,EAAE,KAAMA,EAAE,EAAE,CAAC,EAAI,CAAC,IAAI7D,GAAM,EAAG,CAAC,CAAC,EAA1G,CAAC,IAAIA,GAAM,EAAGoE,EAAM,MAAM,CAAC,EACvC,KAAK,YAAYA,EAAOC,GAAa,CAAC,EAAGC,CAAM,CAC1D,CAEA,MAAMF,EAAOC,EAAWC,EAAQ,CAC5B,IAAIC,EAAQ,KAAK,WAAWH,EAAOC,EAAWC,CAAM,EACpD,OAAS,CACL,IAAIE,EAAOD,EAAM,QAAQ,EACzB,GAAIC,EACA,OAAOA,CACf,CACJ,CACJ,EACM9D,GAAN,KAAkB,CACd,YAAY+D,EAAQ,CAChB,KAAK,OAASA,CAClB,CACA,IAAI,QAAS,CAAE,OAAO,KAAK,OAAO,MAAQ,CAC1C,MAAM3K,EAAM,CAAE,OAAO,KAAK,OAAO,MAAMA,CAAI,CAAG,CAC9C,IAAI,YAAa,CAAE,MAAO,EAAO,CACjC,KAAKA,EAAMC,EAAI,CAAE,OAAO,KAAK,OAAO,MAAMD,EAAMC,CAAE,CAAG,CACzD,EAkCM4G,GAAe,IAAIvC,EAAS,CAAE,QAAS,EAAK,CAAC,ICr6BnD,SAASsG,GAAYC,EAAOC,EAAO,YAAa,CAC5C,GAAI,OAAOD,GAAS,SAChB,OAAOA,EACX,IAAIE,EAAQ,KACZ,QAASC,EAAM,EAAGC,EAAM,EAAGD,EAAMH,EAAM,QAAS,CAC5C,IAAIK,EAAQ,EACZ,OAAS,CACL,IAAIC,EAAON,EAAM,WAAWG,GAAK,EAAGI,EAAO,GAC3C,GAAID,GAAQ,IAA6B,CACrCD,EAAQ,MACR,KACJ,CACIC,GAAQ,IACRA,IACAA,GAAQ,IACRA,IACJ,IAAIE,EAAQF,EAAO,GAMnB,GALIE,GAAS,KACTA,GAAS,GACTD,EAAO,IAEXF,GAASG,EACLD,EACA,MACJF,GAAS,EACb,CACIH,EACAA,EAAME,GAAK,EAAIC,EAEfH,EAAQ,IAAID,EAAKI,CAAK,CAC9B,CACA,OAAOH,CACX,CA0SA,SAASO,GAAUC,EAAMV,EAAOW,EAAOC,EAAOC,EAAWC,EAAY,CACjE,IAAIC,EAAQ,EAAGC,EAAY,GAAKJ,EAAO,CAAE,QAAAK,CAAQ,EAAIN,EAAM,EAAE,OAC7DO,EAAM,KACGF,EAAYN,EAAKK,CAAK,GADhB,CAGX,IAAII,EAAST,EAAKK,EAAQ,CAAC,EAI3B,QAASK,EAAIL,EAAQ,EAAGK,EAAID,EAAQC,GAAK,EACrC,IAAKV,EAAKU,EAAI,CAAC,EAAIJ,GAAa,EAAG,CAC/B,IAAIK,EAAOX,EAAKU,CAAC,EACjB,GAAIH,EAAQ,OAAOI,CAAI,IAClBrB,EAAM,MAAM,OAAS,IAAMA,EAAM,MAAM,OAASqB,GAC7CC,GAAUD,EAAMrB,EAAM,MAAM,MAAOa,EAAWC,CAAU,GAAI,CAChEd,EAAM,YAAYqB,CAAI,EACtB,KACJ,CACJ,CACJ,IAAIf,EAAON,EAAM,KAAMuB,EAAM,EAAGC,EAAOd,EAAKK,EAAQ,CAAC,EAErD,GAAIf,EAAM,KAAO,GAAKwB,EAAOD,GAAOb,EAAKS,EAASK,EAAO,EAAI,CAAC,GAAK,OAAuBd,EAAKS,EAASK,EAAO,EAAI,CAAC,GAAK,MAAqB,CAC1IT,EAAQL,EAAKS,EAASK,EAAO,EAAI,CAAC,EAClC,SAASN,CACb,CAEA,KAAOK,EAAMC,GAAO,CAChB,IAAIC,EAAOF,EAAMC,GAAS,EACtBE,EAAQP,EAASM,GAAOA,GAAO,GAC/BE,EAAOjB,EAAKgB,CAAK,EAAGE,EAAKlB,EAAKgB,EAAQ,CAAC,GAAK,MAChD,GAAIpB,EAAOqB,EACPH,EAAOC,UACFnB,GAAQsB,EACbL,EAAME,EAAM,MACX,CACDV,EAAQL,EAAKgB,EAAQ,CAAC,EACtB1B,EAAM,QAAQ,EACd,SAASkB,CACb,CACJ,CACA,KACJ,CACJ,CACA,SAASW,GAAWnB,EAAMoB,EAAOT,EAAM,CACnC,QAASD,EAAIU,EAAOxB,GAAOA,EAAOI,EAAKU,CAAC,IAAM,MAAqBA,IAC/D,GAAId,GAAQe,EACR,OAAOD,EAAIU,EACnB,MAAO,EACX,CACA,SAASR,GAAUS,EAAOC,EAAMC,EAAWC,EAAa,CACpD,IAAIC,EAAQN,GAAWI,EAAWC,EAAaF,CAAI,EACnD,OAAOG,EAAQ,GAAKN,GAAWI,EAAWC,EAAaH,CAAK,EAAII,CACpE,CASA,SAASC,GAAMC,EAAMlC,EAAKmC,EAAM,CAC5B,IAAIC,EAASF,EAAK,OAAOG,GAAS,gBAAgB,EAElD,IADAD,EAAO,OAAOpC,CAAG,IAEb,GAAI,EAAEmC,EAAO,EAAIC,EAAO,YAAYpC,CAAG,EAAIoC,EAAO,WAAWpC,CAAG,GAC5D,OAAS,CACL,IAAKmC,EAAO,EAAIC,EAAO,GAAKpC,EAAMoC,EAAO,KAAOpC,IAAQ,CAACoC,EAAO,KAAK,QACjE,OAAOD,EAAO,EAAI,KAAK,IAAI,EAAG,KAAK,IAAIC,EAAO,GAAK,EAAGpC,EAAM,EAAsB,CAAC,EAC7E,KAAK,IAAIkC,EAAK,OAAQ,KAAK,IAAIE,EAAO,KAAO,EAAGpC,EAAM,EAAsB,CAAC,EACvF,GAAImC,EAAO,EAAIC,EAAO,YAAY,EAAIA,EAAO,YAAY,EACrD,MACJ,GAAI,CAACA,EAAO,OAAO,EACf,OAAOD,EAAO,EAAI,EAAID,EAAK,MACnC,CAEZ,CAyeA,SAASI,GAAe9B,EAAO+B,EAAW,CACtC,QAAStB,EAAI,EAAGA,EAAIsB,EAAU,OAAQtB,IAAK,CACvC,IAAIuB,EAAQD,EAAUtB,CAAC,EACvB,GAAIuB,EAAM,KAAOhC,EAAM,KAAOgC,EAAM,UAAUhC,CAAK,EAAG,CAC9C+B,EAAUtB,CAAC,EAAE,MAAQT,EAAM,QAC3B+B,EAAUtB,CAAC,EAAIT,GACnB,MACJ,CACJ,CACA+B,EAAU,KAAK/B,CAAK,CACxB,CAwRA,SAASiC,GAAKlC,EAAMmC,EAAK,CAAE,OAAOnC,EAAKmC,CAAG,EAAKnC,EAAKmC,EAAM,CAAC,GAAK,EAAK,CACrE,SAASC,GAAaC,EAAQ,CAC1B,IAAIC,EAAO,KACX,QAASrC,KAASoC,EAAQ,CACtB,IAAIE,EAAUtC,EAAM,EAAE,WACjBA,EAAM,KAAOA,EAAM,EAAE,OAAO,KAAOsC,GAAW,MAAQtC,EAAM,IAAMsC,IACnEtC,EAAM,EAAE,OAAO,UAAUA,EAAM,MAAO,CAA2B,IAChE,CAACqC,GAAQA,EAAK,MAAQrC,EAAM,SAC7BqC,EAAOrC,EACf,CACA,OAAOqC,CACX,CACA,SAASE,GAAeC,EAAM,CAC1B,GAAIA,EAAK,SAAU,CACf,IAAIC,EAAOD,EAAK,OAAS,EAA4B,EACrD,MAAO,CAAC9C,EAAOM,IAAWwC,EAAK,SAAS9C,EAAOM,CAAK,GAAK,EAAKyC,CAClE,CACA,OAAOD,EAAK,GAChB,CAhsDA,IAMME,GAubAC,GAOFC,GAYEC,GAwBAC,GAuEAC,GAWAC,GAKAC,GA2MAC,GAYAC,GA8BAC,GA0FAC,GACFC,GACAC,GAoBEC,GAoFAC,GAmHFC,GAmBEC,GAyRAC,GAQAC,GAWAC,GAcAC,GAx7CNC,GAAAC,GAAA,kBAAAD,KAMMtB,GAAN,MAAMwB,CAAM,CAER,YAEAC,EAGAnE,EAEAI,EAMAgE,EAEA5E,EAIA6E,EAKAC,EAOAC,EAEAC,EAEAC,EAAY,EAMZC,EAAQ,CACJ,KAAK,EAAIP,EACT,KAAK,MAAQnE,EACb,KAAK,MAAQI,EACb,KAAK,UAAYgE,EACjB,KAAK,IAAM5E,EACX,KAAK,MAAQ6E,EACb,KAAK,OAASC,EACd,KAAK,WAAaC,EAClB,KAAK,WAAaC,EAClB,KAAK,UAAYC,EACjB,KAAK,OAASC,CAClB,CAEA,UAAW,CACP,MAAO,IAAI,KAAK,MAAM,OAAO,CAACC,EAAGlE,IAAMA,EAAI,GAAK,CAAC,EAAE,OAAO,KAAK,KAAK,CAAC,KAAK,KAAK,GAAG,GAAG,KAAK,MAAQ,IAAM,KAAK,MAAQ,EAAE,EAC3H,CAGA,OAAO,MAAM0D,EAAG/D,EAAOZ,EAAM,EAAG,CAC5B,IAAIoF,EAAKT,EAAE,OAAO,QAClB,OAAO,IAAID,EAAMC,EAAG,CAAC,EAAG/D,EAAOZ,EAAKA,EAAK,EAAG,CAAC,EAAG,EAAGoF,EAAK,IAAIjC,GAAaiC,EAAIA,EAAG,KAAK,EAAI,KAAM,EAAG,IAAI,CAC1G,CAKA,IAAI,SAAU,CAAE,OAAO,KAAK,WAAa,KAAK,WAAW,QAAU,IAAM,CAIzE,UAAUxE,EAAOe,EAAO,CACpB,KAAK,MAAM,KAAK,KAAK,MAAOA,EAAO,KAAK,WAAa,KAAK,OAAO,MAAM,EACvE,KAAK,MAAQf,CACjB,CAGA,OAAOyE,EAAQ,CACX,IAAIC,EACJ,IAAIC,EAAQF,GAAU,GAAkCG,EAAOH,EAAS,MACpE,CAAE,OAAAI,CAAO,EAAI,KAAK,EAClBC,EAAQD,EAAO,kBAAkBD,CAAI,EAGzC,GAFIE,IACA,KAAK,OAASA,GACdH,GAAS,EAAG,CACZ,KAAK,UAAUE,EAAO,QAAQ,KAAK,MAAOD,EAAM,EAAI,EAAG,KAAK,SAAS,EAGjEA,EAAOC,EAAO,eACd,KAAK,UAAUD,EAAM,KAAK,UAAW,KAAK,UAAW,EAAG,EAAI,EAChE,KAAK,cAAcA,EAAM,KAAK,SAAS,EACvC,MACJ,CAMA,IAAIG,EAAO,KAAK,MAAM,QAAWJ,EAAQ,GAAK,GAAMF,EAAS,OAA+B,EAAI,GAC5F1D,EAAQgE,EAAO,KAAK,MAAMA,EAAO,CAAC,EAAI,KAAK,EAAE,OAAO,CAAC,EAAE,KAAMC,EAAO,KAAK,UAAYjE,EAIrFiE,GAAQ,KAAsC,EAAG,GAAAN,EAAK,KAAK,EAAE,OAAO,QAAQ,MAAME,CAAI,KAAO,MAAQF,IAAO,SAAkBA,EAAG,eAC7H3D,GAAS,KAAK,EAAE,uBAChB,KAAK,EAAE,oBACP,KAAK,EAAE,qBAAuBiE,GAEzB,KAAK,EAAE,qBAAuBA,IACnC,KAAK,EAAE,kBAAoB,EAC3B,KAAK,EAAE,sBAAwBjE,EAC/B,KAAK,EAAE,qBAAuBiE,IAGtC,IAAIb,EAAaY,EAAO,KAAK,MAAMA,EAAO,CAAC,EAAI,EAAGE,EAAQ,KAAK,WAAa,KAAK,OAAO,OAASd,EAEjG,GAAIS,EAAOC,EAAO,eAAkBJ,EAAS,OAAiC,CAC1E,IAAIrF,EAAMyF,EAAO,UAAU,KAAK,MAAO,CAAyB,EAAI,KAAK,IAAM,KAAK,UACpF,KAAK,UAAUD,EAAM7D,EAAO3B,EAAK6F,EAAQ,EAAG,EAAI,CACpD,CACA,GAAIR,EAAS,OACT,KAAK,MAAQ,KAAK,MAAMM,CAAI,MAE3B,CACD,IAAIG,EAAc,KAAK,MAAMH,EAAO,CAAC,EACrC,KAAK,MAAQF,EAAO,QAAQK,EAAaN,EAAM,EAAI,CACvD,CACA,KAAO,KAAK,MAAM,OAASG,GACvB,KAAK,MAAM,IAAI,EACnB,KAAK,cAAcH,EAAM7D,CAAK,CAClC,CAGA,UAAUT,EAAMS,EAAOoE,EAAKH,EAAO,EAAGI,EAAW,GAAO,CACpD,GAAI9E,GAAQ,IACP,CAAC,KAAK,MAAM,QAAU,KAAK,MAAM,KAAK,MAAM,OAAS,CAAC,EAAI,KAAK,OAAO,OAAS,KAAK,YAAa,CAElG,IAAI+E,EAAM,KAAMC,EAAM,KAAK,OAAO,OAKlC,GAJIA,GAAO,GAAKD,EAAI,SAChBC,EAAMD,EAAI,WAAaA,EAAI,OAAO,WAClCA,EAAMA,EAAI,QAEVC,EAAM,GAAKD,EAAI,OAAOC,EAAM,CAAC,GAAK,GAAoBD,EAAI,OAAOC,EAAM,CAAC,EAAI,GAAI,CAChF,GAAIvE,GAASoE,EACT,OACJ,GAAIE,EAAI,OAAOC,EAAM,CAAC,GAAKvE,EAAO,CAC9BsE,EAAI,OAAOC,EAAM,CAAC,EAAIH,EACtB,MACJ,CACJ,CACJ,CACA,GAAI,CAACC,GAAY,KAAK,KAAOD,EACzB,KAAK,OAAO,KAAK7E,EAAMS,EAAOoE,EAAKH,CAAI,MAEtC,CACD,IAAIrE,EAAQ,KAAK,OAAO,OACxB,GAAIA,EAAQ,GAAK,KAAK,OAAOA,EAAQ,CAAC,GAAK,EACvC,KAAOA,EAAQ,GAAK,KAAK,OAAOA,EAAQ,CAAC,EAAIwE,GAEzC,KAAK,OAAOxE,CAAK,EAAI,KAAK,OAAOA,EAAQ,CAAC,EAC1C,KAAK,OAAOA,EAAQ,CAAC,EAAI,KAAK,OAAOA,EAAQ,CAAC,EAC9C,KAAK,OAAOA,EAAQ,CAAC,EAAI,KAAK,OAAOA,EAAQ,CAAC,EAC9C,KAAK,OAAOA,EAAQ,CAAC,EAAI,KAAK,OAAOA,EAAQ,CAAC,EAC9CA,GAAS,EACLqE,EAAO,IACPA,GAAQ,GAEpB,KAAK,OAAOrE,CAAK,EAAIL,EACrB,KAAK,OAAOK,EAAQ,CAAC,EAAII,EACzB,KAAK,OAAOJ,EAAQ,CAAC,EAAIwE,EACzB,KAAK,OAAOxE,EAAQ,CAAC,EAAIqE,CAC7B,CACJ,CAGA,MAAMP,EAAQlF,EAAMgG,EAAS,CACzB,IAAIxE,EAAQ,KAAK,IACjB,GAAI0D,EAAS,OACT,KAAK,UAAUA,EAAS,MAA8B,KAAK,GAAG,UAExDA,EAAS,OAaf,KAAK,IAAMc,EACX,KAAK,aAAahG,EAAMwB,CAAK,EACzBxB,GAAQ,KAAK,EAAE,OAAO,SACtB,KAAK,OAAO,KAAKA,EAAMwB,EAAOwE,EAAS,CAAC,MAhBO,CACnD,IAAIC,EAAYf,EAAQ,CAAE,OAAAI,CAAO,EAAI,KAAK,GACtCU,EAAU,KAAK,KAAOhG,GAAQsF,EAAO,WACrC,KAAK,IAAMU,EACNV,EAAO,UAAUW,EAAW,CAAyB,IACtD,KAAK,UAAYD,IAEzB,KAAK,UAAUC,EAAWzE,CAAK,EAC/B,KAAK,aAAaxB,EAAMwB,CAAK,EACzBxB,GAAQsF,EAAO,SACf,KAAK,OAAO,KAAKtF,EAAMwB,EAAOwE,EAAS,CAAC,CAChD,CAOJ,CAGA,MAAMd,EAAQlF,EAAMgG,EAAS,CACrBd,EAAS,MACT,KAAK,OAAOA,CAAM,EAElB,KAAK,MAAMA,EAAQlF,EAAMgG,CAAO,CACxC,CAGA,QAAQjG,EAAOC,EAAM,CACjB,IAAIoB,EAAQ,KAAK,EAAE,OAAO,OAAS,GAC/BA,EAAQ,GAAK,KAAK,EAAE,OAAOA,CAAK,GAAKrB,KACrC,KAAK,EAAE,OAAO,KAAKA,CAAK,EACxBqB,KAEJ,IAAII,EAAQ,KAAK,IACjB,KAAK,UAAY,KAAK,IAAMA,EAAQzB,EAAM,OAC1C,KAAK,UAAUC,EAAMwB,CAAK,EAC1B,KAAK,OAAO,KAAKJ,EAAOI,EAAO,KAAK,UAAW,EAAgD,EAC3F,KAAK,YACL,KAAK,cAAc,KAAK,WAAW,QAAQ,MAAM,KAAK,WAAW,QAASzB,EAAO,KAAM,KAAK,EAAE,OAAO,MAAM,KAAK,IAAMA,EAAM,MAAM,CAAC,CAAC,CAC5I,CAKA,OAAQ,CACJ,IAAIgF,EAAS,KACTxC,EAAMwC,EAAO,OAAO,OAKxB,KAAOxC,EAAM,GAAKwC,EAAO,OAAOxC,EAAM,CAAC,EAAIwC,EAAO,WAC9CxC,GAAO,EACX,IAAIoC,EAASI,EAAO,OAAO,MAAMxC,CAAG,EAAGiD,EAAOT,EAAO,WAAaxC,EAElE,KAAOwC,GAAUS,GAAQT,EAAO,YAC5BA,EAASA,EAAO,OACpB,OAAO,IAAIR,EAAM,KAAK,EAAG,KAAK,MAAM,MAAM,EAAG,KAAK,MAAO,KAAK,UAAW,KAAK,IAAK,KAAK,MAAOI,EAAQa,EAAM,KAAK,WAAY,KAAK,UAAWT,CAAM,CACxJ,CAGA,gBAAgB/E,EAAMgG,EAAS,CAC3B,IAAIE,EAASlG,GAAQ,KAAK,EAAE,OAAO,QAC/BkG,GACA,KAAK,UAAUlG,EAAM,KAAK,IAAKgG,EAAS,CAAC,EAC7C,KAAK,UAAU,EAAkB,KAAK,IAAKA,EAASE,EAAS,EAAI,CAAC,EAClE,KAAK,IAAM,KAAK,UAAYF,EAC5B,KAAK,OAAS,GAClB,CAKA,SAASjF,EAAM,CACX,QAASoF,EAAM,IAAIjD,GAAe,IAAI,IAAK,CACvC,IAAIgC,EAAS,KAAK,EAAE,OAAO,UAAUiB,EAAI,MAAO,CAAgC,GAAK,KAAK,EAAE,OAAO,UAAUA,EAAI,MAAOpF,CAAI,EAC5H,GAAImE,GAAU,EACV,MAAO,GACX,GAAK,EAAAA,EAAS,OACV,MAAO,GACXiB,EAAI,OAAOjB,CAAM,CACrB,CACJ,CAIA,gBAAgBlF,EAAM,CAClB,GAAI,KAAK,MAAM,QAAU,IACrB,MAAO,CAAC,EACZ,IAAIoG,EAAa,KAAK,EAAE,OAAO,WAAW,KAAK,KAAK,EACpD,GAAIA,EAAW,OAAS,GAAgC,KAAK,MAAM,QAAU,IAA0C,CACnH,IAAI1D,EAAO,CAAC,EACZ,QAAS5B,EAAI,EAAG,EAAGA,EAAIsF,EAAW,OAAQtF,GAAK,GACtC,EAAIsF,EAAWtF,EAAI,CAAC,IAAM,KAAK,OAAS,KAAK,EAAE,OAAO,UAAU,EAAGd,CAAI,GACxE0C,EAAK,KAAK0D,EAAWtF,CAAC,EAAG,CAAC,EAElC,GAAI,KAAK,MAAM,OAAS,IACpB,QAASA,EAAI,EAAG4B,EAAK,OAAS,GAAgC5B,EAAIsF,EAAW,OAAQtF,GAAK,EAAG,CACzF,IAAI,EAAIsF,EAAWtF,EAAI,CAAC,EACnB4B,EAAK,KAAK,CAAC2D,EAAGvF,IAAOA,EAAI,GAAMuF,GAAK,CAAC,GACtC3D,EAAK,KAAK0D,EAAWtF,CAAC,EAAG,CAAC,CAClC,CACJsF,EAAa1D,CACjB,CACA,IAAI4D,EAAS,CAAC,EACd,QAAS,EAAI,EAAG,EAAIF,EAAW,QAAUE,EAAO,OAAS,EAAyB,GAAK,EAAG,CACtF,IAAIC,EAAIH,EAAW,EAAI,CAAC,EACxB,GAAIG,GAAK,KAAK,MACV,SACJ,IAAIlG,EAAQ,KAAK,MAAM,EACvBA,EAAM,UAAUkG,EAAG,KAAK,GAAG,EAC3BlG,EAAM,UAAU,EAAkBA,EAAM,IAAKA,EAAM,IAAK,EAAG,EAAI,EAC/DA,EAAM,aAAa+F,EAAW,CAAC,EAAG,KAAK,GAAG,EAC1C/F,EAAM,OAAS,IACfiG,EAAO,KAAKjG,CAAK,CACrB,CACA,OAAOiG,CACX,CAIA,aAAc,CACV,GAAI,CAAE,OAAAhB,CAAO,EAAI,KAAK,EAClBkB,EAASlB,EAAO,UAAU,KAAK,MAAO,CAA+B,EACzE,GAAK,EAAAkB,EAAS,OACV,MAAO,GACX,GAAI,CAAClB,EAAO,YAAY,KAAK,MAAOkB,CAAM,EAAG,CACzC,IAAIpB,EAAQoB,GAAU,GAAkCzF,EAAOyF,EAAS,MACpEC,EAAS,KAAK,MAAM,OAASrB,EAAQ,EACzC,GAAIqB,EAAS,GAAKnB,EAAO,QAAQ,KAAK,MAAMmB,CAAM,EAAG1F,EAAM,EAAK,EAAI,EAAG,CACnE,IAAI2F,EAAS,KAAK,oBAAoB,EACtC,GAAIA,GAAU,KACV,MAAO,GACXF,EAASE,CACb,CACA,KAAK,UAAU,EAAkB,KAAK,IAAK,KAAK,IAAK,EAAG,EAAI,EAC5D,KAAK,OAAS,GAClB,CACA,YAAK,UAAY,KAAK,IACtB,KAAK,OAAOF,CAAM,EACX,EACX,CAIA,qBAAsB,CAClB,GAAI,CAAE,OAAAlB,CAAO,EAAI,KAAK,EAAGqB,EAAO,CAAC,EAC7BC,EAAU,CAACnG,EAAO2E,IAAU,CAC5B,GAAI,CAAAuB,EAAK,SAASlG,CAAK,EAEvB,OAAAkG,EAAK,KAAKlG,CAAK,EACR6E,EAAO,WAAW7E,EAAQyE,GAAW,CACxC,GAAI,EAAAA,EAAU,QACT,GAAIA,EAAS,MAA+B,CAC7C,IAAI2B,GAAU3B,GAAU,IAAoCE,EAC5D,GAAIyB,EAAS,EAAG,CACZ,IAAI9F,EAAOmE,EAAS,MAA8BuB,EAAS,KAAK,MAAM,OAASI,EAAS,EACxF,GAAIJ,GAAU,GAAKnB,EAAO,QAAQ,KAAK,MAAMmB,CAAM,EAAG1F,EAAM,EAAK,GAAK,EAClE,OAAQ8F,GAAU,GAAoC,MAAgC9F,CAC9F,CACJ,KACK,CACD,IAAI+F,EAAQF,EAAQ1B,EAAQE,EAAQ,CAAC,EACrC,GAAI0B,GAAS,KACT,OAAOA,CACf,CACJ,CAAC,CACL,EACA,OAAOF,EAAQ,KAAK,MAAO,CAAC,CAChC,CAEA,UAAW,CACP,KAAO,CAAC,KAAK,EAAE,OAAO,UAAU,KAAK,MAAO,CAA2B,GACnE,GAAI,CAAC,KAAK,YAAY,EAAG,CACrB,KAAK,UAAU,EAAkB,KAAK,IAAK,KAAK,IAAK,EAAG,EAAI,EAC5D,KACJ,CAEJ,OAAO,IACX,CAIA,IAAI,SAAU,CACV,GAAI,KAAK,MAAM,QAAU,EACrB,MAAO,GACX,GAAI,CAAE,OAAAtB,CAAO,EAAI,KAAK,EACtB,OAAOA,EAAO,KAAKA,EAAO,UAAU,KAAK,MAAO,CAA0B,CAAC,GAAK,OAC5E,CAACA,EAAO,UAAU,KAAK,MAAO,CAAgC,CACtE,CAIA,SAAU,CACN,KAAK,MAAQ,KAAK,MAAM,CAAC,EACzB,KAAK,MAAM,OAAS,CACxB,CAEA,UAAUjD,EAAO,CACb,GAAI,KAAK,OAASA,EAAM,OAAS,KAAK,MAAM,QAAUA,EAAM,MAAM,OAC9D,MAAO,GACX,QAASvB,EAAI,EAAGA,EAAI,KAAK,MAAM,OAAQA,GAAK,EACxC,GAAI,KAAK,MAAMA,CAAC,GAAKuB,EAAM,MAAMvB,CAAC,EAC9B,MAAO,GACf,MAAO,EACX,CAEA,IAAI,QAAS,CAAE,OAAO,KAAK,EAAE,MAAQ,CAGrC,eAAeiG,EAAW,CAAE,OAAO,KAAK,EAAE,OAAO,QAAQ,MAAMA,CAAS,CAAG,CAC3E,aAAahG,EAAMS,EAAO,CAClB,KAAK,YACL,KAAK,cAAc,KAAK,WAAW,QAAQ,MAAM,KAAK,WAAW,QAAST,EAAM,KAAM,KAAK,EAAE,OAAO,MAAMS,CAAK,CAAC,CAAC,CACzH,CACA,cAAcT,EAAMS,EAAO,CACnB,KAAK,YACL,KAAK,cAAc,KAAK,WAAW,QAAQ,OAAO,KAAK,WAAW,QAAST,EAAM,KAAM,KAAK,EAAE,OAAO,MAAMS,CAAK,CAAC,CAAC,CAC1H,CAEA,aAAc,CACV,IAAIwF,EAAO,KAAK,OAAO,OAAS,GAC5BA,EAAO,GAAK,KAAK,OAAOA,CAAI,GAAK,KACjC,KAAK,OAAO,KAAK,KAAK,WAAW,KAAM,KAAK,IAAK,KAAK,IAAK,EAAE,CACrE,CAEA,eAAgB,CACZ,IAAIA,EAAO,KAAK,OAAO,OAAS,GAC5BA,EAAO,GAAK,KAAK,OAAOA,CAAI,GAAK,KACjC,KAAK,OAAO,KAAK,KAAK,UAAW,KAAK,IAAK,KAAK,IAAK,EAAE,CAC/D,CACA,cAAcC,EAAS,CACnB,GAAIA,GAAW,KAAK,WAAW,QAAS,CACpC,IAAIC,EAAQ,IAAIlE,GAAa,KAAK,WAAW,QAASiE,CAAO,EACzDC,EAAM,MAAQ,KAAK,WAAW,MAC9B,KAAK,YAAY,EACrB,KAAK,WAAaA,CACtB,CACJ,CAEA,aAAapC,EAAW,CAChBA,EAAY,KAAK,YACjB,KAAK,cAAc,EACnB,KAAK,UAAYA,EAEzB,CAEA,OAAQ,CACA,KAAK,YAAc,KAAK,WAAW,QAAQ,QAC3C,KAAK,YAAY,EACjB,KAAK,UAAY,GACjB,KAAK,cAAc,CAC3B,CACJ,EACM9B,GAAN,KAAmB,CACf,YAAYmE,EAASF,EAAS,CAC1B,KAAK,QAAUE,EACf,KAAK,QAAUF,EACf,KAAK,KAAOE,EAAQ,OAASA,EAAQ,KAAKF,CAAO,EAAI,CACzD,CACJ,GAEC,SAAUhE,EAAS,CAChBA,EAAQA,EAAQ,OAAY,GAAG,EAAI,SACnCA,EAAQA,EAAQ,OAAY,GAAG,EAAI,SACnCA,EAAQA,EAAQ,OAAY,GAAG,EAAI,SACnCA,EAAQA,EAAQ,QAAa,CAAC,EAAI,UAClCA,EAAQA,EAAQ,oBAAyB,GAAG,EAAI,sBAChDA,EAAQA,EAAQ,uBAA4B,GAAG,EAAI,yBACnDA,EAAQA,EAAQ,gBAAqB,GAAI,EAAI,iBACjD,GAAGA,KAAYA,GAAU,CAAC,EAAE,EAGtBC,GAAN,KAAqB,CACjB,YAAY1B,EAAO,CACf,KAAK,MAAQA,EACb,KAAK,MAAQA,EAAM,MACnB,KAAK,MAAQA,EAAM,MACnB,KAAK,KAAO,KAAK,MAAM,MAC3B,CACA,OAAO0D,EAAQ,CACX,IAAInE,EAAOmE,EAAS,MAA8BE,EAAQF,GAAU,GAChEE,GAAS,GACL,KAAK,OAAS,KAAK,MAAM,QACzB,KAAK,MAAQ,KAAK,MAAM,MAAM,GAClC,KAAK,MAAM,KAAK,KAAK,MAAO,EAAG,CAAC,EAChC,KAAK,MAAQ,GAGb,KAAK,OAASA,EAAQ,GAAK,EAE/B,IAAIgC,EAAO,KAAK,MAAM,EAAE,OAAO,QAAQ,KAAK,MAAM,KAAK,KAAO,CAAC,EAAGrG,EAAM,EAAI,EAC5E,KAAK,MAAQqG,CACjB,CACJ,EAGMjE,GAAN,MAAMkE,CAAkB,CACpB,YAAYhH,EAAOR,EAAKuB,EAAO,CAC3B,KAAK,MAAQf,EACb,KAAK,IAAMR,EACX,KAAK,MAAQuB,EACb,KAAK,OAASf,EAAM,OAChB,KAAK,OAAS,GACd,KAAK,UAAU,CACvB,CACA,OAAO,OAAOA,EAAOR,EAAMQ,EAAM,WAAaA,EAAM,OAAO,OAAQ,CAC/D,OAAO,IAAIgH,EAAkBhH,EAAOR,EAAKA,EAAMQ,EAAM,UAAU,CACnE,CACA,WAAY,CACR,IAAIL,EAAO,KAAK,MAAM,OAClBA,GAAQ,OACR,KAAK,MAAQ,KAAK,MAAM,WAAaA,EAAK,WAC1C,KAAK,MAAQA,EACb,KAAK,OAASA,EAAK,OAE3B,CACA,IAAI,IAAK,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CAC/C,IAAI,OAAQ,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CAClD,IAAI,KAAM,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CAChD,IAAI,MAAO,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CACjD,MAAO,CACH,KAAK,OAAS,EACd,KAAK,KAAO,EACR,KAAK,OAAS,GACd,KAAK,UAAU,CACvB,CACA,MAAO,CACH,OAAO,IAAIqH,EAAkB,KAAK,MAAO,KAAK,IAAK,KAAK,KAAK,CACjE,CACJ,EAsCMjE,GAAN,KAAkB,CACd,aAAc,CACV,KAAK,MAAQ,GACb,KAAK,MAAQ,GACb,KAAK,IAAM,GACX,KAAK,SAAW,GAChB,KAAK,UAAY,EACjB,KAAK,KAAO,EACZ,KAAK,QAAU,CACnB,CACJ,EACMC,GAAY,IAAID,GAKhBE,GAAN,KAAkB,CAEd,YAEA5D,EAEA4H,EAAQ,CACJ,KAAK,MAAQ5H,EACb,KAAK,OAAS4H,EAEd,KAAK,MAAQ,GAEb,KAAK,SAAW,EAEhB,KAAK,OAAS,GACd,KAAK,UAAY,EAGjB,KAAK,KAAO,GAEZ,KAAK,MAAQjE,GACb,KAAK,WAAa,EAClB,KAAK,IAAM,KAAK,SAAWiE,EAAO,CAAC,EAAE,KACrC,KAAK,MAAQA,EAAO,CAAC,EACrB,KAAK,IAAMA,EAAOA,EAAO,OAAS,CAAC,EAAE,GACrC,KAAK,SAAS,CAClB,CAEA,cAAcC,EAAQC,EAAO,CACzB,IAAIC,EAAQ,KAAK,MAAOrG,EAAQ,KAAK,WACjCvB,EAAM,KAAK,IAAM0H,EACrB,KAAO1H,EAAM4H,EAAM,MAAM,CACrB,GAAI,CAACrG,EACD,OAAO,KACX,IAAIpB,EAAO,KAAK,OAAO,EAAEoB,CAAK,EAC9BvB,GAAO4H,EAAM,KAAOzH,EAAK,GACzByH,EAAQzH,CACZ,CACA,KAAOwH,EAAQ,EAAI3H,EAAM4H,EAAM,GAAK5H,GAAO4H,EAAM,IAAI,CACjD,GAAIrG,GAAS,KAAK,OAAO,OAAS,EAC9B,OAAO,KACX,IAAIpB,EAAO,KAAK,OAAO,EAAEoB,CAAK,EAC9BvB,GAAOG,EAAK,KAAOyH,EAAM,GACzBA,EAAQzH,CACZ,CACA,OAAOH,CACX,CAEA,QAAQA,EAAK,CACT,GAAIA,GAAO,KAAK,MAAM,MAAQA,EAAM,KAAK,MAAM,GAC3C,OAAOA,EACX,QAAS4H,KAAS,KAAK,OACnB,GAAIA,EAAM,GAAK5H,EACX,OAAO,KAAK,IAAIA,EAAK4H,EAAM,IAAI,EACvC,OAAO,KAAK,GAChB,CAUA,KAAKF,EAAQ,CACT,IAAIG,EAAM,KAAK,SAAWH,EAAQ1H,EAAKyG,EACvC,GAAIoB,GAAO,GAAKA,EAAM,KAAK,MAAM,OAC7B7H,EAAM,KAAK,IAAM0H,EACjBjB,EAAS,KAAK,MAAM,WAAWoB,CAAG,MAEjC,CACD,IAAIC,EAAW,KAAK,cAAcJ,EAAQ,CAAC,EAC3C,GAAII,GAAY,KACZ,MAAO,GAEX,GADA9H,EAAM8H,EACF9H,GAAO,KAAK,WAAaA,EAAM,KAAK,UAAY,KAAK,OAAO,OAC5DyG,EAAS,KAAK,OAAO,WAAWzG,EAAM,KAAK,SAAS,MAEnD,CACD,IAAIiB,EAAI,KAAK,WAAY2G,EAAQ,KAAK,MACtC,KAAOA,EAAM,IAAM5H,GACf4H,EAAQ,KAAK,OAAO,EAAE3G,CAAC,EAC3B,KAAK,OAAS,KAAK,MAAM,MAAM,KAAK,UAAYjB,CAAG,EAC/CA,EAAM,KAAK,OAAO,OAAS4H,EAAM,KACjC,KAAK,OAAS,KAAK,OAAO,MAAM,EAAGA,EAAM,GAAK5H,CAAG,GACrDyG,EAAS,KAAK,OAAO,WAAW,CAAC,CACrC,CACJ,CACA,OAAIzG,GAAO,KAAK,MAAM,YAClB,KAAK,MAAM,UAAYA,EAAM,GAC1ByG,CACX,CAIA,YAAY7E,EAAOmG,EAAY,EAAG,CAC9B,IAAIhC,EAAMgC,EAAY,KAAK,cAAcA,EAAW,EAAE,EAAI,KAAK,IAC/D,GAAIhC,GAAO,MAAQA,EAAM,KAAK,MAAM,MAChC,MAAM,IAAI,WAAW,yBAAyB,EAClD,KAAK,MAAM,MAAQnE,EACnB,KAAK,MAAM,IAAMmE,CACrB,CACA,UAAW,CACP,GAAI,KAAK,KAAO,KAAK,WAAa,KAAK,IAAM,KAAK,UAAY,KAAK,OAAO,OAAQ,CAC9E,GAAI,CAAE,MAAAiC,EAAO,SAAAC,CAAS,EAAI,KAC1B,KAAK,MAAQ,KAAK,OAClB,KAAK,SAAW,KAAK,UACrB,KAAK,OAASD,EACd,KAAK,UAAYC,EACjB,KAAK,SAAW,KAAK,IAAM,KAAK,QACpC,KACK,CACD,KAAK,OAAS,KAAK,MACnB,KAAK,UAAY,KAAK,SACtB,IAAIC,EAAY,KAAK,MAAM,MAAM,KAAK,GAAG,EACrCnC,EAAM,KAAK,IAAMmC,EAAU,OAC/B,KAAK,MAAQnC,EAAM,KAAK,MAAM,GAAKmC,EAAU,MAAM,EAAG,KAAK,MAAM,GAAK,KAAK,GAAG,EAAIA,EAClF,KAAK,SAAW,KAAK,IACrB,KAAK,SAAW,CACpB,CACJ,CACA,UAAW,CACP,OAAI,KAAK,UAAY,KAAK,MAAM,SAC5B,KAAK,SAAS,EACV,KAAK,UAAY,KAAK,MAAM,QACrB,KAAK,KAAO,GAEpB,KAAK,KAAO,KAAK,MAAM,WAAW,KAAK,QAAQ,CAC1D,CAGA,QAAQC,EAAI,EAAG,CAEX,IADA,KAAK,UAAYA,EACV,KAAK,IAAMA,GAAK,KAAK,MAAM,IAAI,CAClC,GAAI,KAAK,YAAc,KAAK,OAAO,OAAS,EACxC,OAAO,KAAK,QAAQ,EACxBA,GAAK,KAAK,MAAM,GAAK,KAAK,IAC1B,KAAK,MAAQ,KAAK,OAAO,EAAE,KAAK,UAAU,EAC1C,KAAK,IAAM,KAAK,MAAM,IAC1B,CACA,YAAK,KAAOA,EACR,KAAK,KAAO,KAAK,MAAM,YACvB,KAAK,MAAM,UAAY,KAAK,IAAM,GAC/B,KAAK,SAAS,CACzB,CACA,SAAU,CACN,YAAK,IAAM,KAAK,SAAW,KAAK,IAChC,KAAK,MAAQ,KAAK,OAAO,KAAK,WAAa,KAAK,OAAO,OAAS,CAAC,EACjE,KAAK,MAAQ,GACN,KAAK,KAAO,EACvB,CAEA,MAAMnI,EAAK4B,EAAO,CAUd,GATIA,GACA,KAAK,MAAQA,EACbA,EAAM,MAAQ5B,EACd4B,EAAM,UAAY5B,EAAM,EACxB4B,EAAM,MAAQA,EAAM,SAAW,IAG/B,KAAK,MAAQ4B,GAEb,KAAK,KAAOxD,EAAK,CAEjB,GADA,KAAK,IAAMA,EACPA,GAAO,KAAK,IACZ,YAAK,QAAQ,EACN,KAEX,KAAOA,EAAM,KAAK,MAAM,MACpB,KAAK,MAAQ,KAAK,OAAO,EAAE,KAAK,UAAU,EAC9C,KAAOA,GAAO,KAAK,MAAM,IACrB,KAAK,MAAQ,KAAK,OAAO,EAAE,KAAK,UAAU,EAC1CA,GAAO,KAAK,UAAYA,EAAM,KAAK,SAAW,KAAK,MAAM,OACzD,KAAK,SAAWA,EAAM,KAAK,UAG3B,KAAK,MAAQ,GACb,KAAK,SAAW,GAEpB,KAAK,SAAS,CAClB,CACA,OAAO,IACX,CAEA,KAAKwB,EAAMC,EAAI,CACX,GAAID,GAAQ,KAAK,UAAYC,GAAM,KAAK,SAAW,KAAK,MAAM,OAC1D,OAAO,KAAK,MAAM,MAAMD,EAAO,KAAK,SAAUC,EAAK,KAAK,QAAQ,EACpE,GAAID,GAAQ,KAAK,WAAaC,GAAM,KAAK,UAAY,KAAK,OAAO,OAC7D,OAAO,KAAK,OAAO,MAAMD,EAAO,KAAK,UAAWC,EAAK,KAAK,SAAS,EACvE,GAAID,GAAQ,KAAK,MAAM,MAAQC,GAAM,KAAK,MAAM,GAC5C,OAAO,KAAK,MAAM,KAAKD,EAAMC,CAAE,EACnC,IAAIgF,EAAS,GACb,QAAS2B,KAAK,KAAK,OAAQ,CACvB,GAAIA,EAAE,MAAQ3G,EACV,MACA2G,EAAE,GAAK5G,IACPiF,GAAU,KAAK,MAAM,KAAK,KAAK,IAAI2B,EAAE,KAAM5G,CAAI,EAAG,KAAK,IAAI4G,EAAE,GAAI3G,CAAE,CAAC,EAC5E,CACA,OAAOgF,CACX,CACJ,EAEM/C,GAAN,KAAiB,CACb,YAAYnD,EAAM8D,EAAI,CAClB,KAAK,KAAO9D,EACZ,KAAK,GAAK8D,CACd,CACA,MAAMxE,EAAOW,EAAO,CAChB,GAAI,CAAE,OAAAiF,CAAO,EAAIjF,EAAM,EACvBF,GAAU,KAAK,KAAMT,EAAOW,EAAO,KAAK,GAAIiF,EAAO,KAAMA,EAAO,cAAc,CAClF,CACJ,EACA/B,GAAW,UAAU,WAAaA,GAAW,UAAU,SAAWA,GAAW,UAAU,OAAS,GAE1FC,GAAN,KAAsB,CAClB,YAAYpD,EAAMG,EAAW2H,EAAW,CACpC,KAAK,UAAY3H,EACjB,KAAK,UAAY2H,EACjB,KAAK,KAAO,OAAO9H,GAAQ,SAAWX,GAAYW,CAAI,EAAIA,CAC9D,CACA,MAAMV,EAAOW,EAAO,CAChB,IAAImB,EAAQ9B,EAAM,IAAKyI,EAAU,EACjC,OAAS,CACL,IAAIC,EAAQ1I,EAAM,KAAO,EAAG2I,EAAU3I,EAAM,cAAc,EAAG,CAAC,EAE9D,GADAS,GAAU,KAAK,KAAMT,EAAOW,EAAO,EAAG,KAAK,KAAM,KAAK,SAAS,EAC3DX,EAAM,MAAM,MAAQ,GACpB,MACJ,GAAI,KAAK,WAAa,KAClB,OAGJ,GAFK0I,GACDD,IACAE,GAAW,KACX,MACJ3I,EAAM,MAAM2I,EAAS3I,EAAM,KAAK,CACpC,CACIyI,IACAzI,EAAM,MAAM8B,EAAO9B,EAAM,KAAK,EAC9BA,EAAM,YAAY,KAAK,UAAWyI,CAAO,EAEjD,CACJ,EACA3E,GAAgB,UAAU,WAAaD,GAAW,UAAU,SAAWA,GAAW,UAAU,OAAS,GAG/FE,GAAN,KAAwB,CAMpB,YAEAhC,EAAO6G,EAAU,CAAC,EAAG,CACjB,KAAK,MAAQ7G,EACb,KAAK,WAAa,CAAC,CAAC6G,EAAQ,WAC5B,KAAK,SAAW,CAAC,CAACA,EAAQ,SAC1B,KAAK,OAAS,CAAC,CAACA,EAAQ,MAC5B,CACJ,EA4EM5E,GAAU,OAAO,QAAW,KAAe,QAAQ,KAAO,YAAY,KAAK,QAAQ,IAAI,GAAG,EAC5FC,GAAW,MAEd,SAAUC,EAAQ,CACfA,EAAOA,EAAO,OAAY,EAAE,EAAI,QACpC,GAAGA,KAAWA,GAAS,CAAC,EAAE,EAiBpBC,GAAN,KAAqB,CACjB,YAAY0E,EAAWC,EAAS,CAC5B,KAAK,UAAYD,EACjB,KAAK,QAAUC,EACf,KAAK,EAAI,EACT,KAAK,SAAW,KAChB,KAAK,SAAW,GAChB,KAAK,OAAS,GACd,KAAK,MAAQ,CAAC,EACd,KAAK,MAAQ,CAAC,EACd,KAAK,MAAQ,CAAC,EACd,KAAK,aAAa,CACtB,CACA,cAAe,CACX,IAAIC,EAAK,KAAK,SAAW,KAAK,GAAK,KAAK,UAAU,OAAS,KAAO,KAAK,UAAU,KAAK,GAAG,EACzF,GAAIA,EAAI,CAGJ,IAFA,KAAK,SAAWA,EAAG,UAAY3G,GAAM2G,EAAG,KAAMA,EAAG,KAAOA,EAAG,OAAQ,CAAC,EAAIA,EAAG,OAASA,EAAG,KACvF,KAAK,OAASA,EAAG,QAAU3G,GAAM2G,EAAG,KAAMA,EAAG,GAAKA,EAAG,OAAQ,EAAE,EAAIA,EAAG,OAASA,EAAG,GAC3E,KAAK,MAAM,QACd,KAAK,MAAM,IAAI,EACf,KAAK,MAAM,IAAI,EACf,KAAK,MAAM,IAAI,EAEnB,KAAK,MAAM,KAAKA,EAAG,IAAI,EACvB,KAAK,MAAM,KAAK,CAACA,EAAG,MAAM,EAC1B,KAAK,MAAM,KAAK,CAAC,EACjB,KAAK,UAAY,KAAK,QAC1B,MAEI,KAAK,UAAY,GAEzB,CAEA,OAAO5I,EAAK,CACR,GAAIA,EAAM,KAAK,UACX,OAAO,KACX,KAAO,KAAK,UAAY,KAAK,QAAUA,GACnC,KAAK,aAAa,EACtB,GAAI,CAAC,KAAK,SACN,OAAO,KACX,OAAS,CACL,IAAImH,EAAO,KAAK,MAAM,OAAS,EAC/B,GAAIA,EAAO,EACP,YAAK,aAAa,EACX,KAEX,IAAIjB,EAAM,KAAK,MAAMiB,CAAI,EAAG5F,EAAQ,KAAK,MAAM4F,CAAI,EACnD,GAAI5F,GAAS2E,EAAI,SAAS,OAAQ,CAC9B,KAAK,MAAM,IAAI,EACf,KAAK,MAAM,IAAI,EACf,KAAK,MAAM,IAAI,EACf,QACJ,CACA,IAAI/F,EAAO+F,EAAI,SAAS3E,CAAK,EACzBI,EAAQ,KAAK,MAAMwF,CAAI,EAAIjB,EAAI,UAAU3E,CAAK,EAClD,GAAII,EAAQ3B,EACR,YAAK,UAAY2B,EACV,KAEX,GAAIxB,aAAgB0I,GAAM,CACtB,GAAIlH,GAAS3B,EAAK,CACd,GAAI2B,EAAQ,KAAK,SACb,OAAO,KACX,IAAIoE,EAAMpE,EAAQxB,EAAK,OACvB,GAAI4F,GAAO,KAAK,OAAQ,CACpB,IAAId,EAAY9E,EAAK,KAAK2I,EAAS,SAAS,EAC5C,GAAI,CAAC7D,GAAac,EAAMd,EAAY,KAAK,SAAS,GAC9C,OAAO9E,CACf,CACJ,CACA,KAAK,MAAMgH,CAAI,IACXxF,EAAQxB,EAAK,QAAU,KAAK,IAAI,KAAK,SAAUH,CAAG,IAClD,KAAK,MAAM,KAAKG,CAAI,EACpB,KAAK,MAAM,KAAKwB,CAAK,EACrB,KAAK,MAAM,KAAK,CAAC,EAEzB,MAEI,KAAK,MAAMwF,CAAI,IACf,KAAK,UAAYxF,EAAQxB,EAAK,MAEtC,CACJ,CACJ,EACM8D,GAAN,KAAiB,CACb,YAAYwB,EAAQsD,EAAQ,CACxB,KAAK,OAASA,EACd,KAAK,OAAS,CAAC,EACf,KAAK,UAAY,KACjB,KAAK,QAAU,CAAC,EAChB,KAAK,OAAStD,EAAO,WAAW,IAAIN,GAAK,IAAI5B,EAAW,CAC5D,CACA,WAAW/C,EAAO,CACd,IAAIwI,EAAc,EACdC,EAAO,KACP,CAAE,OAAAxD,CAAO,EAAIjF,EAAM,EAAG,CAAE,WAAA0I,CAAW,EAAIzD,EACvCxC,EAAOwC,EAAO,UAAUjF,EAAM,MAAO,CAAgC,EACrE4G,EAAU5G,EAAM,WAAaA,EAAM,WAAW,KAAO,EACrDyE,EAAY,EAChB,QAAShE,EAAI,EAAGA,EAAIiI,EAAW,OAAQjI,IAAK,CACxC,GAAM,KAAKA,EAAKgC,GACZ,SACJ,IAAIkG,EAAYD,EAAWjI,CAAC,EAAGW,EAAQ,KAAK,OAAOX,CAAC,EACpD,GAAI,EAAAgI,GAAQ,CAACE,EAAU,aAEnBA,EAAU,YAAcvH,EAAM,OAASpB,EAAM,KAAOoB,EAAM,MAAQqB,GAAQrB,EAAM,SAAWwF,KAC3F,KAAK,kBAAkBxF,EAAOuH,EAAW3I,CAAK,EAC9CoB,EAAM,KAAOqB,EACbrB,EAAM,QAAUwF,GAEhBxF,EAAM,UAAYA,EAAM,IAAM,KAC9BqD,EAAY,KAAK,IAAIrD,EAAM,UAAWqD,CAAS,GAC/CrD,EAAM,OAAS,GAAkB,CACjC,IAAIwH,EAAaJ,EAIjB,GAHIpH,EAAM,SAAW,KACjBoH,EAAc,KAAK,WAAWxI,EAAOoB,EAAM,SAAUA,EAAM,IAAKoH,CAAW,GAC/EA,EAAc,KAAK,WAAWxI,EAAOoB,EAAM,MAAOA,EAAM,IAAKoH,CAAW,EACpE,CAACG,EAAU,SACXF,EAAOrH,EACHoH,EAAcI,GACd,KAEZ,CACJ,CACA,KAAO,KAAK,QAAQ,OAASJ,GACzB,KAAK,QAAQ,IAAI,EACrB,OAAI/D,GACAzE,EAAM,aAAayE,CAAS,EAC5B,CAACgE,GAAQzI,EAAM,KAAO,KAAK,OAAO,MAClCyI,EAAO,IAAI1F,GACX0F,EAAK,MAAQzI,EAAM,EAAE,OAAO,QAC5ByI,EAAK,MAAQA,EAAK,IAAMzI,EAAM,IAC9BwI,EAAc,KAAK,WAAWxI,EAAOyI,EAAK,MAAOA,EAAK,IAAKD,CAAW,GAE1E,KAAK,UAAYC,EACV,KAAK,OAChB,CACA,aAAazI,EAAO,CAChB,GAAI,KAAK,UACL,OAAO,KAAK,UAChB,IAAIyI,EAAO,IAAI1F,GAAa,CAAE,IAAAvD,EAAK,EAAA2E,CAAE,EAAInE,EACzC,OAAAyI,EAAK,MAAQjJ,EACbiJ,EAAK,IAAM,KAAK,IAAIjJ,EAAM,EAAG2E,EAAE,OAAO,GAAG,EACzCsE,EAAK,MAAQjJ,GAAO2E,EAAE,OAAO,IAAMA,EAAE,OAAO,QAAU,EAC/CsE,CACX,CACA,kBAAkBrH,EAAOuH,EAAW3I,EAAO,CACvC,IAAImB,EAAQ,KAAK,OAAO,QAAQnB,EAAM,GAAG,EAEzC,GADA2I,EAAU,MAAM,KAAK,OAAO,MAAMxH,EAAOC,CAAK,EAAGpB,CAAK,EAClDoB,EAAM,MAAQ,GAAI,CAClB,GAAI,CAAE,OAAA6D,CAAO,EAAIjF,EAAM,EACvB,QAASS,EAAI,EAAGA,EAAIwE,EAAO,YAAY,OAAQxE,IAC3C,GAAIwE,EAAO,YAAYxE,CAAC,GAAKW,EAAM,MAAO,CACtC,IAAI6E,EAAShB,EAAO,aAAaxE,CAAC,EAAE,KAAK,OAAO,KAAKW,EAAM,MAAOA,EAAM,GAAG,EAAGpB,CAAK,EACnF,GAAIiG,GAAU,GAAKjG,EAAM,EAAE,OAAO,QAAQ,OAAOiG,GAAU,CAAC,EAAG,CACtDA,EAAS,EAGV7E,EAAM,SAAW6E,GAAU,EAF3B7E,EAAM,MAAQ6E,GAAU,EAG5B,KACJ,CACJ,CACR,MAEI7E,EAAM,MAAQ,EACdA,EAAM,IAAM,KAAK,OAAO,QAAQD,EAAQ,CAAC,CAEjD,CACA,UAAU0D,EAAQzD,EAAOmE,EAAKxE,EAAO,CAEjC,QAASN,EAAI,EAAGA,EAAIM,EAAON,GAAK,EAC5B,GAAI,KAAK,QAAQA,CAAC,GAAKoE,EACnB,OAAO9D,EACf,YAAK,QAAQA,GAAO,EAAI8D,EACxB,KAAK,QAAQ9D,GAAO,EAAIK,EACxB,KAAK,QAAQL,GAAO,EAAIwE,EACjBxE,CACX,CACA,WAAWf,EAAOoB,EAAOmE,EAAKxE,EAAO,CACjC,GAAI,CAAE,MAAAX,CAAM,EAAIJ,EAAO,CAAE,OAAAiF,CAAO,EAAIjF,EAAM,EAAG,CAAE,KAAAD,CAAK,EAAIkF,EACxD,QAAS4D,EAAM,EAAGA,EAAM,EAAGA,IACvB,QAASpI,EAAIwE,EAAO,UAAU7E,EAAOyI,EAAM,EAA0B,CAA0B,GAAIpI,GAAK,EAAG,CACvG,GAAIV,EAAKU,CAAC,GAAK,MACX,GAAIV,EAAKU,EAAI,CAAC,GAAK,EACfA,EAAIwB,GAAKlC,EAAMU,EAAI,CAAC,MAEnB,CACGM,GAAS,GAAKhB,EAAKU,EAAI,CAAC,GAAK,IAC7BM,EAAQ,KAAK,UAAUkB,GAAKlC,EAAMU,EAAI,CAAC,EAAGW,EAAOmE,EAAKxE,CAAK,GAC/D,KACJ,CAEAhB,EAAKU,CAAC,GAAKW,IACXL,EAAQ,KAAK,UAAUkB,GAAKlC,EAAMU,EAAI,CAAC,EAAGW,EAAOmE,EAAKxE,CAAK,EACnE,CAEJ,OAAOA,CACX,CACJ,GAEC,SAAU2C,EAAK,CACZA,EAAIA,EAAI,SAAc,CAAC,EAAI,WAC3BA,EAAIA,EAAI,oBAAyB,CAAC,EAAI,sBAGtCA,EAAIA,EAAI,qBAA0B,GAAG,EAAI,uBACzCA,EAAIA,EAAI,iBAAsB,EAAE,EAAI,mBAIpCA,EAAIA,EAAI,SAAc,IAAK,EAAI,WAC/BA,EAAIA,EAAI,MAAW,GAAI,EAAI,QAC3BA,EAAIA,EAAI,iCAAsC,GAAG,EAAI,mCAIrDA,EAAIA,EAAI,cAAmB,EAAE,EAAI,eACrC,GAAGA,KAAQA,GAAM,CAAC,EAAE,EACdC,GAAN,KAAY,CACR,YAAYsB,EAAQ5F,EAAO6I,EAAWjB,EAAQ,CAC1C,KAAK,OAAShC,EACd,KAAK,MAAQ5F,EACb,KAAK,OAAS4H,EACd,KAAK,WAAa,EAClB,KAAK,YAAc,KACnB,KAAK,YAAc,EACnB,KAAK,OAAS,CAAC,EACf,KAAK,UAAY,KACjB,KAAK,sBAAwB,GAC7B,KAAK,qBAAuB,EAC5B,KAAK,kBAAoB,EACzB,KAAK,OAAS,IAAIhE,GAAY5D,EAAO4H,CAAM,EAC3C,KAAK,OAAS,IAAIxD,GAAWwB,EAAQ,KAAK,MAAM,EAChD,KAAK,QAAUA,EAAO,IAAI,CAAC,EAC3B,GAAI,CAAE,KAAAjE,CAAK,EAAIiG,EAAO,CAAC,EACvB,KAAK,OAAS,CAACvE,GAAM,MAAM,KAAMuC,EAAO,IAAI,CAAC,EAAGjE,CAAI,CAAC,EACrD,KAAK,UAAYkH,EAAU,QAAU,KAAK,OAAO,IAAMlH,EAAOiE,EAAO,aAAe,EAC9E,IAAIzB,GAAe0E,EAAWjD,EAAO,OAAO,EAAI,IAC1D,CACA,IAAI,WAAY,CACZ,OAAO,KAAK,WAChB,CAOA,SAAU,CACN,IAAI7C,EAAS,KAAK,OAAQ5C,EAAM,KAAK,YAEjCuC,EAAY,KAAK,OAAS,CAAC,EAC3BO,EAASwG,EAQb,GAAI,KAAK,kBAAoB,KAAkD1G,EAAO,QAAU,EAAG,CAC/F,GAAI,CAAC,CAAC,EAAIA,EACV,KAAO,EAAE,YAAY,GAAK,EAAE,MAAM,QAAU,EAAE,MAAM,EAAE,MAAM,OAAS,CAAC,GAAK,KAAK,uBAAuB,CACvG,KAAK,kBAAoB,KAAK,qBAAuB,CACzD,CAIA,QAAS3B,EAAI,EAAGA,EAAI2B,EAAO,OAAQ3B,IAAK,CACpC,IAAIT,EAAQoC,EAAO3B,CAAC,EACpB,OAAS,CAEL,GADA,KAAK,OAAO,UAAY,KACpBT,EAAM,IAAMR,EACZuC,EAAU,KAAK/B,CAAK,MAEnB,IAAI,KAAK,aAAaA,EAAO+B,EAAWK,CAAM,EAC/C,SAEC,CACIE,IACDA,EAAU,CAAC,EACXwG,EAAgB,CAAC,GAErBxG,EAAQ,KAAKtC,CAAK,EAClB,IAAI+I,EAAM,KAAK,OAAO,aAAa/I,CAAK,EACxC8I,EAAc,KAAKC,EAAI,MAAOA,EAAI,GAAG,CACzC,EACA,KACJ,CACJ,CACA,GAAI,CAAChH,EAAU,OAAQ,CACnB,IAAIiH,EAAW1G,GAAWH,GAAaG,CAAO,EAC9C,GAAI0G,EACA,OAAO,KAAK,YAAYA,CAAQ,EACpC,GAAI,KAAK,OAAO,OACZ,MAAI3F,IAAWf,GACX,QAAQ,IAAI,qBAAuB,KAAK,OAAO,UAAY,KAAK,OAAO,QAAQ,KAAK,OAAO,UAAU,KAAK,EAAI,OAAO,EACnH,IAAI,YAAY,eAAiB9C,CAAG,EAEzC,KAAK,aACN,KAAK,WAAa,EAC1B,CACA,GAAI,KAAK,YAAc8C,EAAS,CAC5B,IAAI0G,EAAW,KAAK,WAAa,MAAQ1G,EAAQ,CAAC,EAAE,IAAM,KAAK,UAAYA,EAAQ,CAAC,EAC9E,KAAK,YAAYA,EAASwG,EAAe/G,CAAS,EACxD,GAAIiH,EACA,OAAO,KAAK,YAAYA,EAAS,SAAS,CAAC,CACnD,CACA,GAAI,KAAK,WAAY,CACjB,IAAIC,EAAe,KAAK,YAAc,EAAI,EAAI,KAAK,WAAa,EAChE,GAAIlH,EAAU,OAASkH,EAEnB,IADAlH,EAAU,KAAK,CAAC,EAAGmH,IAAMA,EAAE,MAAQ,EAAE,KAAK,EACnCnH,EAAU,OAASkH,GACtBlH,EAAU,IAAI,EAElBA,EAAU,KAAKmE,GAAKA,EAAE,UAAY1G,CAAG,GACrC,KAAK,YACb,SACSuC,EAAU,OAAS,EAAG,CAI3BoH,EAAO,QAAS1I,EAAI,EAAGA,EAAIsB,EAAU,OAAS,EAAGtB,IAAK,CAClD,IAAIT,EAAQ+B,EAAUtB,CAAC,EACvB,QAAS2I,EAAI3I,EAAI,EAAG2I,EAAIrH,EAAU,OAAQqH,IAAK,CAC3C,IAAIpH,EAAQD,EAAUqH,CAAC,EACvB,GAAIpJ,EAAM,UAAUgC,CAAK,GACrBhC,EAAM,OAAO,OAAS,KAAsCgC,EAAM,OAAO,OAAS,IAClF,IAAMhC,EAAM,MAAQgC,EAAM,OAAWhC,EAAM,OAAO,OAASgC,EAAM,OAAO,QAAW,EAC/ED,EAAU,OAAOqH,IAAK,CAAC,MAEtB,CACDrH,EAAU,OAAOtB,IAAK,CAAC,EACvB,SAAS0I,CACb,CAER,CACJ,CACIpH,EAAU,OAAS,IACnBA,EAAU,OAAO,GAA4BA,EAAU,OAAS,EAA0B,CAClG,CACA,KAAK,YAAcA,EAAU,CAAC,EAAE,IAChC,QAAStB,EAAI,EAAGA,EAAIsB,EAAU,OAAQtB,IAC9BsB,EAAUtB,CAAC,EAAE,IAAM,KAAK,cACxB,KAAK,YAAcsB,EAAUtB,CAAC,EAAE,KACxC,OAAO,IACX,CACA,OAAOjB,EAAK,CACR,GAAI,KAAK,WAAa,MAAQ,KAAK,UAAYA,EAC3C,MAAM,IAAI,WAAW,8BAA8B,EACvD,KAAK,UAAYA,CACrB,CAKA,aAAaQ,EAAOoC,EAAQiH,EAAO,CAC/B,IAAIlI,EAAQnB,EAAM,IAAK,CAAE,OAAAiF,CAAO,EAAI,KAChCE,EAAO9B,GAAU,KAAK,QAAQrD,CAAK,EAAI,OAAS,GACpD,GAAI,KAAK,WAAa,MAAQmB,EAAQ,KAAK,UACvC,OAAOnB,EAAM,YAAY,EAAIA,EAAQ,KACzC,GAAI,KAAK,UAAW,CAChB,IAAIsJ,EAAWtJ,EAAM,YAAcA,EAAM,WAAW,QAAQ,OAAQuJ,EAASD,EAAWtJ,EAAM,WAAW,KAAO,EAChH,QAASwJ,EAAS,KAAK,UAAU,OAAOrI,CAAK,EAAGqI,GAAS,CACrD,IAAIC,EAAQ,KAAK,OAAO,QAAQ,MAAMD,EAAO,KAAK,EAAE,GAAKA,EAAO,KAAOvE,EAAO,QAAQjF,EAAM,MAAOwJ,EAAO,KAAK,EAAE,EAAI,GACrH,GAAIC,EAAQ,IAAMD,EAAO,SAAW,CAACF,IAAaE,EAAO,KAAKlB,EAAS,WAAW,GAAK,IAAMiB,GACzF,OAAAvJ,EAAM,QAAQwJ,EAAQC,CAAK,EACvBpG,IACA,QAAQ,IAAI8B,EAAO,KAAK,QAAQnF,CAAK,EAAI,kBAAkBiF,EAAO,QAAQuE,EAAO,KAAK,EAAE,CAAC,GAAG,EACzF,GAEX,GAAI,EAAEA,aAAkBnB,KAASmB,EAAO,SAAS,QAAU,GAAKA,EAAO,UAAU,CAAC,EAAI,EAClF,MACJ,IAAIE,EAAQF,EAAO,SAAS,CAAC,EAC7B,GAAIE,aAAiBrB,IAAQmB,EAAO,UAAU,CAAC,GAAK,EAChDA,EAASE,MAET,MACR,CACJ,CACA,IAAIC,EAAgB1E,EAAO,UAAUjF,EAAM,MAAO,CAAgC,EAClF,GAAI2J,EAAgB,EAChB,OAAA3J,EAAM,OAAO2J,CAAa,EACtBtG,IACA,QAAQ,IAAI8B,EAAO,KAAK,QAAQnF,CAAK,EAAI,uBAAuBiF,EAAO,QAAQ0E,EAAgB,KAA4B,CAAC,GAAG,EAC5H,GAEX,GAAI3J,EAAM,MAAM,QAAU,KACtB,KAAOA,EAAM,MAAM,OAAS,KAAwBA,EAAM,YAAY,GAAG,CAE7E,IAAI4J,EAAU,KAAK,OAAO,WAAW5J,CAAK,EAC1C,QAASS,EAAI,EAAGA,EAAImJ,EAAQ,QAAS,CACjC,IAAI/E,EAAS+E,EAAQnJ,GAAG,EAAGC,EAAOkJ,EAAQnJ,GAAG,EAAG8E,EAAMqE,EAAQnJ,GAAG,EAC7DkG,EAAOlG,GAAKmJ,EAAQ,QAAU,CAACP,EAC/BQ,EAAalD,EAAO3G,EAAQA,EAAM,MAAM,EAK5C,GAJA6J,EAAW,MAAMhF,EAAQnE,EAAM6E,CAAG,EAC9BlC,IACA,QAAQ,IAAI8B,EAAO,KAAK,QAAQ0E,CAAU,EAAI,SAAUhF,EAAS,MAC3D,aAAaI,EAAO,QAAQJ,EAAS,KAA4B,CAAC,GAD+B,OAC7B,QAAQI,EAAO,QAAQvE,CAAI,CAAC,MAAMS,CAAK,GAAG0I,GAAc7J,EAAQ,GAAK,SAAS,GAAG,EAC3J2G,EACA,MAAO,GACFkD,EAAW,IAAM1I,EACtBiB,EAAO,KAAKyH,CAAU,EAEtBR,EAAM,KAAKQ,CAAU,CAC7B,CACA,MAAO,EACX,CAIA,aAAa7J,EAAO+B,EAAW,CAC3B,IAAIvC,EAAMQ,EAAM,IAChB,OAAS,CACL,GAAI,CAAC,KAAK,aAAaA,EAAO,KAAM,IAAI,EACpC,MAAO,GACX,GAAIA,EAAM,IAAMR,EACZ,OAAAsC,GAAe9B,EAAO+B,CAAS,EACxB,EAEf,CACJ,CACA,YAAYK,EAAQ0H,EAAQ/H,EAAW,CACnC,IAAIiH,EAAW,KAAMe,EAAY,GACjC,QAAStJ,EAAI,EAAGA,EAAI2B,EAAO,OAAQ3B,IAAK,CACpC,IAAIT,EAAQoC,EAAO3B,CAAC,EAAGW,EAAQ0I,EAAOrJ,GAAK,CAAC,EAAGuJ,EAAWF,GAAQrJ,GAAK,GAAK,CAAC,EACzE0E,EAAO9B,GAAU,KAAK,QAAQrD,CAAK,EAAI,OAAS,GACpD,GAAIA,EAAM,UACF+J,IAEJA,EAAY,GACZ/J,EAAM,QAAQ,EACVqD,IACA,QAAQ,IAAI8B,EAAO,KAAK,QAAQnF,CAAK,EAAI,cAAc,EAChD,KAAK,aAAaA,EAAO+B,CAAS,IAEzC,SAER,IAAIkI,EAAQjK,EAAM,MAAM,EAAGkK,EAAY/E,EACvC,QAASiE,EAAI,EAAGa,EAAM,YAAY,GAAKb,EAAI,KACnC/F,IACA,QAAQ,IAAI6G,EAAY,KAAK,QAAQD,CAAK,EAAI,qBAAqB,EAC5D,MAAK,aAAaA,EAAOlI,CAAS,GAHyBqH,IAMlE/F,KACA6G,EAAY,KAAK,QAAQD,CAAK,EAAI,QAE1C,QAASE,KAAUnK,EAAM,gBAAgBoB,CAAK,EACtCiC,IACA,QAAQ,IAAI8B,EAAO,KAAK,QAAQgF,CAAM,EAAI,uBAAuB,EACrE,KAAK,aAAaA,EAAQpI,CAAS,EAEnC,KAAK,OAAO,IAAM/B,EAAM,KACpBgK,GAAYhK,EAAM,MAClBgK,IACA5I,EAAQ,GAEZpB,EAAM,gBAAgBoB,EAAO4I,CAAQ,EACjC3G,IACA,QAAQ,IAAI8B,EAAO,KAAK,QAAQnF,CAAK,EAAI,wBAAwB,KAAK,OAAO,QAAQoB,CAAK,CAAC,GAAG,EAClGU,GAAe9B,EAAO+B,CAAS,IAE1B,CAACiH,GAAYA,EAAS,MAAQhJ,EAAM,SACzCgJ,EAAWhJ,EAEnB,CACA,OAAOgJ,CACX,CAEA,YAAYhJ,EAAO,CACf,OAAAA,EAAM,MAAM,EACLqI,GAAK,MAAM,CAAE,OAAQvF,GAAkB,OAAO9C,CAAK,EACtD,QAAS,KAAK,OAAO,QACrB,MAAO,KAAK,QACZ,gBAAiB,KAAK,OAAO,aAC7B,OAAQ,KAAK,OACb,MAAO,KAAK,OAAO,CAAC,EAAE,KACtB,OAAQA,EAAM,IAAM,KAAK,OAAO,CAAC,EAAE,KACnC,cAAe,KAAK,OAAO,aAAc,CAAC,CAClD,CACA,QAAQA,EAAO,CACX,IAAI6D,GAAMP,KAAaA,GAAW,IAAI,UAAU,IAAItD,CAAK,EACzD,OAAK6D,GACDP,GAAS,IAAItD,EAAO6D,EAAK,OAAO,cAAc,KAAK,aAAa,CAAC,EAC9DA,EAAK7D,CAChB,CACJ,EAYM4D,GAAN,KAAc,CACV,YAAYwG,EAAQC,EAAOC,EAAU,CACjC,KAAK,OAASF,EACd,KAAK,MAAQC,EACb,KAAK,SAAWC,CACpB,CACA,OAAO5J,EAAM,CAAE,MAAO,CAAC,KAAK,UAAY,KAAK,SAASA,CAAI,GAAK,CAAG,CACtE,EACMmD,GAAK0G,GAAKA,EAWVzG,GAAN,KAAqB,CAEjB,YAAYtB,EAAM,CACd,KAAK,MAAQA,EAAK,MAClB,KAAK,MAAQA,EAAK,OAASqB,GAC3B,KAAK,OAASrB,EAAK,QAAUqB,GAC7B,KAAK,MAAQrB,EAAK,OAASqB,GAC3B,KAAK,KAAOrB,EAAK,OAAS,IAAM,GAChC,KAAK,OAASA,EAAK,SAAW,EAClC,CACJ,EAIMuB,GAAN,MAAMyG,UAAiBC,EAAO,CAE1B,YAAYjI,EAAM,CAId,GAHA,MAAM,EAEN,KAAK,SAAW,CAAC,EACbA,EAAK,SAAW,GAChB,MAAM,IAAI,WAAW,mBAAmBA,EAAK,OAAO,sCAA4D,EACpH,IAAIkI,EAAYlI,EAAK,UAAU,MAAM,GAAG,EACxC,KAAK,cAAgBkI,EAAU,OAC/B,QAASjK,EAAI,EAAGA,EAAI+B,EAAK,gBAAiB/B,IACtCiK,EAAU,KAAK,EAAE,EACrB,IAAIC,EAAW,OAAO,KAAKnI,EAAK,QAAQ,EAAE,IAAIoF,GAAKpF,EAAK,SAASoF,CAAC,EAAE,CAAC,CAAC,EAClEgD,EAAY,CAAC,EACjB,QAASnK,EAAI,EAAGA,EAAIiK,EAAU,OAAQjK,IAClCmK,EAAU,KAAK,CAAC,CAAC,EACrB,SAASC,EAAQC,EAAQC,EAAMrL,EAAO,CAClCkL,EAAUE,CAAM,EAAE,KAAK,CAACC,EAAMA,EAAK,YAAY,OAAOrL,CAAK,CAAC,CAAC,CAAC,CAClE,CACA,GAAI8C,EAAK,UACL,QAASwI,KAAYxI,EAAK,UAAW,CACjC,IAAIuI,EAAOC,EAAS,CAAC,EACjB,OAAOD,GAAQ,WACfA,EAAOzC,EAASyC,CAAI,GACxB,QAAStK,EAAI,EAAGA,EAAIuK,EAAS,QAAS,CAClC,IAAIrL,EAAOqL,EAASvK,GAAG,EACvB,GAAId,GAAQ,EACRkL,EAAQlL,EAAMoL,EAAMC,EAASvK,GAAG,CAAC,MAEhC,CACD,IAAIf,EAAQsL,EAASvK,EAAI,CAACd,CAAI,EAC9B,QAASyJ,EAAI,CAACzJ,EAAMyJ,EAAI,EAAGA,IACvByB,EAAQG,EAASvK,GAAG,EAAGsK,EAAMrL,CAAK,EACtCe,GACJ,CACJ,CACJ,CACJ,KAAK,QAAU,IAAIwK,GAAQP,EAAU,IAAI,CAACQ,EAAMzK,IAAM0K,GAAS,OAAO,CAClE,KAAM1K,GAAK,KAAK,cAAgB,OAAYyK,EAC5C,GAAIzK,EACJ,MAAOmK,EAAUnK,CAAC,EAClB,IAAKkK,EAAS,QAAQlK,CAAC,EAAI,GAC3B,MAAOA,GAAK,EACZ,QAAS+B,EAAK,cAAgBA,EAAK,aAAa,QAAQ/B,CAAC,EAAI,EACjE,CAAC,CAAC,CAAC,EACC+B,EAAK,cACL,KAAK,QAAU,KAAK,QAAQ,OAAO,GAAGA,EAAK,WAAW,GAC1D,KAAK,OAAS,GACd,KAAK,aAAe,KACpB,IAAI4I,EAAahM,GAAYoD,EAAK,SAAS,EAC3C,KAAK,QAAUA,EAAK,QACpB,KAAK,iBAAmBA,EAAK,aAAe,CAAC,EAC7C,KAAK,YAAc,IAAI,YAAY,KAAK,iBAAiB,MAAM,EAC/D,QAAS/B,EAAI,EAAGA,EAAI,KAAK,iBAAiB,OAAQA,IAC9C,KAAK,YAAYA,CAAC,EAAI,KAAK,iBAAiBA,CAAC,EAAE,KACnD,KAAK,aAAe,KAAK,iBAAiB,IAAI8B,EAAc,EAC5D,KAAK,OAASnD,GAAYoD,EAAK,OAAQ,WAAW,EAClD,KAAK,KAAOpD,GAAYoD,EAAK,SAAS,EACtC,KAAK,KAAOpD,GAAYoD,EAAK,IAAI,EACjC,KAAK,QAAUA,EAAK,QACpB,KAAK,WAAaA,EAAK,WAAW,IAAI9C,GAAS,OAAOA,GAAS,SAAW,IAAIwD,GAAWkI,EAAY1L,CAAK,EAAIA,CAAK,EACnH,KAAK,SAAW8C,EAAK,SACrB,KAAK,SAAWA,EAAK,UAAY,CAAC,EAClC,KAAK,mBAAqBA,EAAK,oBAAsB,KACrD,KAAK,eAAiBA,EAAK,UAC3B,KAAK,UAAYA,EAAK,WAAa,KACnC,KAAK,QAAU,KAAK,QAAQ,MAAM,OAAS,EAC3C,KAAK,QAAU,KAAK,aAAa,EACjC,KAAK,IAAM,KAAK,SAAS,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC,CAAC,CAC1D,CACA,YAAYnD,EAAO6I,EAAWjB,EAAQ,CAClC,IAAIoE,EAAQ,IAAI1H,GAAM,KAAMtE,EAAO6I,EAAWjB,CAAM,EACpD,QAASqE,KAAK,KAAK,SACfD,EAAQC,EAAED,EAAOhM,EAAO6I,EAAWjB,CAAM,EAC7C,OAAOoE,CACX,CAEA,QAAQjL,EAAOM,EAAM6K,EAAQ,GAAO,CAChC,IAAIC,EAAQ,KAAK,KACjB,GAAI9K,GAAQ8K,EAAM,CAAC,EACf,MAAO,GACX,QAAShM,EAAMgM,EAAM9K,EAAO,CAAC,IAAK,CAC9B,IAAI+K,EAAWD,EAAMhM,GAAK,EAAGmH,EAAO8E,EAAW,EAC3CrF,EAASoF,EAAMhM,GAAK,EACxB,GAAImH,GAAQ4E,EACR,OAAOnF,EACX,QAASb,EAAM/F,GAAOiM,GAAY,GAAIjM,EAAM+F,EAAK/F,IAC7C,GAAIgM,EAAMhM,CAAG,GAAKY,EACd,OAAOgG,EACf,GAAIO,EACA,MAAO,EACf,CACJ,CAEA,UAAUvG,EAAOsL,EAAU,CACvB,IAAI3L,EAAO,KAAK,KAChB,QAAS8I,EAAM,EAAGA,EAAM,EAAGA,IACvB,QAASpI,EAAI,KAAK,UAAUL,EAAOyI,EAAM,EAA0B,CAA0B,EAAGlJ,GAAOc,GAAK,EAAG,CAC3G,IAAKd,EAAOI,EAAKU,CAAC,IAAM,MACpB,GAAIV,EAAKU,EAAI,CAAC,GAAK,EACfd,EAAOI,EAAKU,EAAIwB,GAAKlC,EAAMU,EAAI,CAAC,CAAC,MAChC,IAAIV,EAAKU,EAAI,CAAC,GAAK,EACpB,OAAOwB,GAAKlC,EAAMU,EAAI,CAAC,EAEvB,MAER,GAAId,GAAQ+L,GAAY/L,GAAQ,EAC5B,OAAOsC,GAAKlC,EAAMU,EAAI,CAAC,CAC/B,CAEJ,MAAO,EACX,CAEA,UAAUL,EAAOuL,EAAM,CACnB,OAAO,KAAK,OAAQvL,EAAQ,EAA2BuL,CAAI,CAC/D,CAEA,UAAUvL,EAAOwL,EAAM,CACnB,OAAQ,KAAK,UAAUxL,EAAO,CAAwB,EAAIwL,GAAQ,CACtE,CAEA,YAAYxL,EAAOyE,EAAQ,CACvB,MAAO,CAAC,CAAC,KAAK,WAAWzE,EAAOyL,GAAKA,GAAKhH,EAAS,GAAO,IAAI,CAClE,CAEA,WAAWzE,EAAOyE,EAAQ,CACtB,IAAIiH,EAAQ,KAAK,UAAU1L,EAAO,CAAgC,EAC9D6F,EAAS6F,EAAQjH,EAAOiH,CAAK,EAAI,OACrC,QAASrL,EAAI,KAAK,UAAUL,EAAO,CAA0B,EAAG6F,GAAU,KAAMxF,GAAK,EAAG,CACpF,GAAI,KAAK,KAAKA,CAAC,GAAK,MAChB,GAAI,KAAK,KAAKA,EAAI,CAAC,GAAK,EACpBA,EAAIwB,GAAK,KAAK,KAAMxB,EAAI,CAAC,MAEzB,OAERwF,EAASpB,EAAO5C,GAAK,KAAK,KAAMxB,EAAI,CAAC,CAAC,CAC1C,CACA,OAAOwF,CACX,CAGA,WAAW7F,EAAO,CACd,IAAI6F,EAAS,CAAC,EACd,QAASxF,EAAI,KAAK,UAAUL,EAAO,CAA0B,GAAIK,GAAK,EAAG,CACrE,GAAI,KAAK,KAAKA,CAAC,GAAK,MAChB,GAAI,KAAK,KAAKA,EAAI,CAAC,GAAK,EACpBA,EAAIwB,GAAK,KAAK,KAAMxB,EAAI,CAAC,MAEzB,OAER,GAAK,OAAK,KAAKA,EAAI,CAAC,EAAK,GAA4C,CACjE,IAAIf,EAAQ,KAAK,KAAKe,EAAI,CAAC,EACtBwF,EAAO,KAAK,CAACD,EAAGvF,IAAOA,EAAI,GAAMuF,GAAKtG,CAAK,GAC5CuG,EAAO,KAAK,KAAK,KAAKxF,CAAC,EAAGf,CAAK,CACvC,CACJ,CACA,OAAOuG,CACX,CAIA,UAAU8F,EAAQ,CAGd,IAAIC,EAAO,OAAO,OAAO,OAAO,OAAOxB,EAAS,SAAS,EAAG,IAAI,EAGhE,GAFIuB,EAAO,QACPC,EAAK,QAAU,KAAK,QAAQ,OAAO,GAAGD,EAAO,KAAK,GAClDA,EAAO,IAAK,CACZ,IAAIE,EAAO,KAAK,SAASF,EAAO,GAAG,EACnC,GAAI,CAACE,EACD,MAAM,IAAI,WAAW,yBAAyBF,EAAO,GAAG,EAAE,EAC9DC,EAAK,IAAMC,CACf,CACA,OAAIF,EAAO,aACPC,EAAK,WAAa,KAAK,WAAW,IAAIE,GAAK,CACvC,IAAIzF,EAAQsF,EAAO,WAAW,KAAKnE,GAAKA,EAAE,MAAQsE,CAAC,EACnD,OAAOzF,EAAQA,EAAM,GAAKyF,CAC9B,CAAC,GACDH,EAAO,eACPC,EAAK,aAAe,KAAK,aAAa,MAAM,EAC5CA,EAAK,iBAAmB,KAAK,iBAAiB,IAAI,CAAC9F,EAAG,IAAM,CACxD,IAAIO,EAAQsF,EAAO,aAAa,KAAKnE,GAAKA,EAAE,MAAQ1B,EAAE,QAAQ,EAC9D,GAAI,CAACO,EACD,OAAOP,EACX,IAAI1D,EAAO,OAAO,OAAO,OAAO,OAAO,CAAC,EAAG0D,CAAC,EAAG,CAAE,SAAUO,EAAM,EAAG,CAAC,EACrE,OAAAuF,EAAK,aAAa,CAAC,EAAIzJ,GAAeC,CAAI,EACnCA,CACX,CAAC,GAEDuJ,EAAO,iBACPC,EAAK,QAAUD,EAAO,gBACtBA,EAAO,UACPC,EAAK,QAAU,KAAK,aAAaD,EAAO,OAAO,GAC/CA,EAAO,QAAU,OACjBC,EAAK,OAASD,EAAO,QACrBA,EAAO,OACPC,EAAK,SAAWA,EAAK,SAAS,OAAOD,EAAO,IAAI,GAChDA,EAAO,cAAgB,OACvBC,EAAK,aAAeD,EAAO,cACxBC,CACX,CAGA,aAAc,CACV,OAAO,KAAK,SAAS,OAAS,CAClC,CAKA,QAAQtL,EAAM,CACV,OAAO,KAAK,UAAY,KAAK,UAAUA,CAAI,EAAI,OAAOA,GAAQ,KAAK,SAAW,KAAK,QAAQ,MAAMA,CAAI,EAAE,MAAQA,CAAI,CACvH,CAGA,IAAI,SAAU,CAAE,OAAO,KAAK,QAAU,CAAG,CAEzC,IAAI,SAAU,CAAE,OAAO,KAAK,QAAQ,MAAM,KAAK,IAAI,CAAC,CAAC,CAAG,CAExD,kBAAkBA,EAAM,CACpB,IAAIyL,EAAO,KAAK,mBAChB,OAAOA,GAAQ,KAAO,EAAIA,EAAKzL,CAAI,GAAK,CAC5C,CAEA,aAAaJ,EAAS,CAClB,IAAI8L,EAAS,OAAO,KAAK,KAAK,QAAQ,EAAG/B,EAAQ+B,EAAO,IAAI,IAAM,EAAK,EACvE,GAAI9L,EACA,QAAS+L,KAAQ/L,EAAQ,MAAM,GAAG,EAAG,CACjC,IAAIuD,EAAKuI,EAAO,QAAQC,CAAI,EACxBxI,GAAM,IACNwG,EAAMxG,CAAE,EAAI,GACpB,CACJ,IAAIyG,EAAW,KACf,QAAS7J,EAAI,EAAGA,EAAI2L,EAAO,OAAQ3L,IAC/B,GAAI,CAAC4J,EAAM5J,CAAC,EACR,QAAS2I,EAAI,KAAK,SAASgD,EAAO3L,CAAC,CAAC,EAAGoD,GAAKA,EAAK,KAAK,KAAKuF,GAAG,IAAM,QAC/DkB,IAAaA,EAAW,IAAI,WAAW,KAAK,QAAU,CAAC,IAAIzG,CAAE,EAAI,EAE9E,OAAO,IAAID,GAAQtD,EAAS+J,EAAOC,CAAQ,CAC/C,CAGA,OAAO,YAAY9H,EAAM,CACrB,OAAO,IAAIgI,EAAShI,CAAI,CAC5B,CACJ,IC/jDA,SAAS8J,GAAUC,EAAGC,EAAG,CACrB,OAAOD,EAAE,QAAUC,EAAE,QAAUD,EAAE,MAAM,CAACE,EAAGC,IAAMD,GAAKD,EAAEE,CAAC,CAAC,CAC9D,CACA,SAASC,GAASC,EAAO,CACrB,IAAIC,EAAO,CAAC,CAAC,CAAC,EACd,QAASH,EAAI,EAAGA,EAAIE,EAAM,OAAQF,IAC9B,QAASI,EAAI,EAAGC,EAAIF,EAAK,OAAQC,EAAIC,EAAGD,IACpCD,EAAK,KAAKA,EAAKC,CAAC,EAAE,OAAOF,EAAMF,CAAC,CAAC,CAAC,EAG1C,OAAOG,EAAK,KAAK,CAACN,EAAGC,IAAMA,EAAE,OAASD,EAAE,MAAM,CAClD,CAoDA,SAASS,GAAUC,EAAM,CACrB,IAAIC,EAAS,OAAO,OAAO,IAAI,EAC/B,QAASC,KAAQF,EAAM,CACnB,IAAIG,EAAOH,EAAKE,CAAI,EACf,MAAM,QAAQC,CAAI,IACnBA,EAAO,CAACA,CAAI,GAChB,QAASC,KAAQF,EAAK,MAAM,GAAG,EAC3B,GAAIE,EAAM,CACN,IAAIC,EAAS,CAAC,EAAGC,EAAO,EAAgBC,EAAOH,EAC/C,QAASI,EAAM,IAAK,CAChB,GAAID,GAAQ,OAASC,EAAM,GAAKA,EAAM,GAAKJ,EAAK,OAAQ,CACpDE,EAAO,EACP,KACJ,CACA,IAAIG,EAAI,8BAA8B,KAAKF,CAAI,EAC/C,GAAI,CAACE,EACD,MAAM,IAAI,WAAW,iBAAmBL,CAAI,EAGhD,GAFAC,EAAO,KAAKI,EAAE,CAAC,GAAK,IAAM,GAAKA,EAAE,CAAC,EAAE,CAAC,GAAK,IAAM,KAAK,MAAMA,EAAE,CAAC,CAAC,EAAIA,EAAE,CAAC,CAAC,EACvED,GAAOC,EAAE,CAAC,EAAE,OACRD,GAAOJ,EAAK,OACZ,MACJ,IAAIM,EAAON,EAAKI,GAAK,EACrB,GAAIA,GAAOJ,EAAK,QAAUM,GAAQ,IAAK,CACnCJ,EAAO,EACP,KACJ,CACA,GAAII,GAAQ,IACR,MAAM,IAAI,WAAW,iBAAmBN,CAAI,EAChDG,EAAOH,EAAK,MAAMI,CAAG,CACzB,CACA,IAAIG,EAAON,EAAO,OAAS,EAAGO,EAAQP,EAAOM,CAAI,EACjD,GAAI,CAACC,EACD,MAAM,IAAI,WAAW,iBAAmBR,CAAI,EAChD,IAAIS,EAAO,IAAIC,GAAKX,EAAMG,EAAMK,EAAO,EAAIN,EAAO,MAAM,EAAGM,CAAI,EAAI,IAAI,EACvEV,EAAOW,CAAK,EAAIC,EAAK,KAAKZ,EAAOW,CAAK,CAAC,CAC3C,CACR,CACA,OAAOG,GAAa,IAAId,CAAM,CAClC,CA2BA,SAASe,GAAeb,EAAMc,EAAS,CACnC,IAAIC,EAAM,OAAO,OAAO,IAAI,EAC5B,QAASC,KAAShB,EACd,GAAI,CAAC,MAAM,QAAQgB,EAAM,GAAG,EACxBD,EAAIC,EAAM,IAAI,EAAE,EAAIA,EAAM,UAE1B,SAASC,KAAOD,EAAM,IAClBD,EAAIE,EAAI,EAAE,EAAID,EAAM,MAEhC,GAAI,CAAE,MAAAE,EAAO,IAAAC,EAAM,IAAK,EAAIL,GAAW,CAAC,EACxC,MAAO,CACH,MAAQd,GAAS,CACb,IAAIoB,EAAMD,EACV,QAASF,KAAOjB,EACZ,QAASqB,KAAOJ,EAAI,IAAK,CACrB,IAAIK,EAAWP,EAAIM,EAAI,EAAE,EACzB,GAAIC,EAAU,CACVF,EAAMA,EAAMA,EAAM,IAAME,EAAWA,EACnC,KACJ,CACJ,CAEJ,OAAOF,CACX,EACA,MAAAF,CACJ,CACJ,CAxQA,IAEIK,GAoBEC,GAiEFC,GACEC,GA4HAd,GACAD,GAgLAgB,EACAC,GAAeC,GAAYC,GAAoBC,GAAwBC,GAAeC,GAAqBC,GAAqBC,GAAeC,GAAsBC,GAAeC,GAAgBC,GAAmBC,GAA0BC,GAqBjPzC,EA8ZA0C,GAzzBNC,GAAAC,GAAA,kBAAAD,KAEIpB,GAAY,EAoBVC,GAAN,MAAMqB,CAAI,CAIN,YAKAC,EAKAC,EAIAC,EAAU,CACN,KAAK,IAAMF,EACX,KAAK,KAAOC,EACZ,KAAK,SAAWC,EAIhB,KAAK,GAAKzB,IACd,CAQA,OAAO,OAAO0B,EAAQ,CAClB,GAAoDA,GAAO,KACvD,MAAM,IAAI,MAAM,oCAAoC,EACxD,IAAIhC,EAAM,IAAI4B,EAAI,CAAC,EAAG,KAAM,CAAC,CAAC,EAE9B,GADA5B,EAAI,IAAI,KAAKA,CAAG,EACZgC,EACA,QAAStB,KAAKsB,EAAO,IACjBhC,EAAI,IAAI,KAAKU,CAAC,EACtB,OAAOV,CACX,CAaA,OAAO,gBAAiB,CACpB,IAAIiC,EAAM,IAAIxB,GACd,OAAQT,GACAA,EAAI,SAAS,QAAQiC,CAAG,EAAI,GACrBjC,EACJS,GAAS,IAAIT,EAAI,MAAQA,EAAKA,EAAI,SAAS,OAAOiC,CAAG,EAAE,KAAK,CAAC/D,EAAGC,IAAMD,EAAE,GAAKC,EAAE,EAAE,CAAC,CAEjG,CACJ,EACIqC,GAAiB,EACfC,GAAN,MAAMyB,CAAS,CACX,aAAc,CACV,KAAK,UAAY,CAAC,EAClB,KAAK,GAAK1B,IACd,CACA,OAAO,IAAIsB,EAAMK,EAAM,CACnB,GAAI,CAACA,EAAK,OACN,OAAOL,EACX,IAAIM,EAASD,EAAK,CAAC,EAAE,UAAU,KAAKzB,GAAKA,EAAE,MAAQoB,GAAQ7D,GAAUkE,EAAMzB,EAAE,QAAQ,CAAC,EACtF,GAAI0B,EACA,OAAOA,EACX,IAAIP,EAAM,CAAC,EAAG7B,EAAM,IAAIO,GAAIsB,EAAKC,EAAMK,CAAI,EAC3C,QAAS9C,KAAK8C,EACV9C,EAAE,UAAU,KAAKW,CAAG,EACxB,IAAIqC,EAAU/D,GAAS6D,CAAI,EAC3B,QAASH,KAAUF,EAAK,IACpB,GAAI,CAACE,EAAO,SAAS,OACjB,QAASM,KAAUD,EACfR,EAAI,KAAKK,EAAS,IAAIF,EAAQM,CAAM,CAAC,EACjD,OAAOtC,CACX,CACJ,EAuGML,GAAe,IAAI4C,EACnB7C,GAAN,KAAW,CACP,YAAYX,EAAMG,EAAMsD,EAASlD,EAAM,CACnC,KAAK,KAAOP,EACZ,KAAK,KAAOG,EACZ,KAAK,QAAUsD,EACf,KAAK,KAAOlD,CAChB,CACA,IAAI,QAAS,CAAE,OAAO,KAAK,MAAQ,CAAgB,CACnD,IAAI,SAAU,CAAE,OAAO,KAAK,MAAQ,CAAiB,CACrD,KAAKmD,EAAO,CACR,MAAI,CAACA,GAASA,EAAM,MAAQ,KAAK,OAC7B,KAAK,KAAOA,EACL,OAEXA,EAAM,KAAO,KAAK,KAAKA,EAAM,IAAI,EAC1BA,EACX,CACA,IAAI,OAAQ,CAAE,OAAO,KAAK,QAAU,KAAK,QAAQ,OAAS,CAAG,CACjE,EACA/C,GAAK,MAAQ,IAAIA,GAAK,CAAC,EAAG,EAAgB,IAAI,EA6JxCgB,EAAIH,GAAI,OACRI,GAAUD,EAAE,EAAGE,GAAOF,EAAE,EAAGG,GAAWH,EAAEE,EAAI,EAAGE,GAAeJ,EAAEE,EAAI,EAAGG,GAAUL,EAAE,EAAGM,GAASN,EAAEK,EAAO,EAAGE,GAASP,EAAEK,EAAO,EAAGG,GAAUR,EAAE,EAAGS,GAAUT,EAAEQ,EAAO,EAAGE,GAAUV,EAAE,EAAGW,GAAWX,EAAE,EAAGY,GAAcZ,EAAE,EAAGa,GAAUb,EAAEY,EAAW,EAAGE,GAAOd,EAAE,EAqB1P3B,EAAO,CAIT,QAAA4B,GAIA,YAAaD,EAAEC,EAAO,EAItB,aAAcD,EAAEC,EAAO,EAIvB,WAAYD,EAAEC,EAAO,EAIrB,KAAAC,GAIA,aAAcF,EAAEE,EAAI,EAIpB,SAAUC,GAIV,QAASH,EAAEG,EAAQ,EAInB,aAAcC,GAId,cAAeJ,EAAEI,EAAY,EAI7B,UAAWJ,EAAEE,EAAI,EAIjB,UAAWF,EAAEE,EAAI,EAIjB,UAAWF,EAAEE,EAAI,EAIjB,UAAWF,EAAEE,EAAI,EAIjB,QAAAG,GAIA,OAAAC,GAIA,UAAWN,EAAEM,EAAM,EAInB,UAAWN,EAAEM,EAAM,EAInB,eAAgBN,EAAEM,EAAM,EAIxB,OAAAC,GAIA,QAASP,EAAEO,EAAM,EAIjB,MAAOP,EAAEO,EAAM,EAIf,KAAMP,EAAEK,EAAO,EAIf,OAAQL,EAAEK,EAAO,EAKjB,OAAQL,EAAEK,EAAO,EAIjB,MAAOL,EAAEK,EAAO,EAIhB,IAAKL,EAAEK,EAAO,EAId,QAAAK,GAKA,KAAMV,EAAEU,EAAO,EAIf,KAAMV,EAAEU,EAAO,EAIf,KAAMV,EAAEU,EAAO,EAIf,KAAMV,EAAEU,EAAO,EAIf,SAAUV,EAAEU,EAAO,EAInB,gBAAiBV,EAAEU,EAAO,EAI1B,eAAgBV,EAAEU,EAAO,EAIzB,kBAAmBV,EAAEU,EAAO,EAK5B,cAAeV,EAAEU,EAAO,EAIxB,SAAAC,GAIA,cAAeX,EAAEW,EAAQ,EAIzB,mBAAoBX,EAAEW,EAAQ,EAI9B,cAAeX,EAAEW,EAAQ,EAIzB,gBAAiBX,EAAEW,EAAQ,EAI3B,gBAAiBX,EAAEW,EAAQ,EAI3B,eAAgBX,EAAEW,EAAQ,EAI1B,mBAAoBX,EAAEW,EAAQ,EAI9B,aAAcX,EAAEW,EAAQ,EAIxB,gBAAiBX,EAAEW,EAAQ,EAI3B,YAAAC,GAKA,UAAWZ,EAAEY,EAAW,EAIxB,QAAAC,GAKA,aAAcb,EAAEa,EAAO,EAKvB,cAAeb,EAAEa,EAAO,EAKxB,MAAOb,EAAEa,EAAO,EAKhB,MAAOb,EAAEa,EAAO,EAIhB,QAAAL,GAIA,QAAAC,GAIA,SAAUT,EAAES,EAAO,EAInB,SAAUT,EAAES,EAAO,EAInB,SAAUT,EAAES,EAAO,EAInB,SAAUT,EAAES,EAAO,EAInB,SAAUT,EAAES,EAAO,EAInB,SAAUT,EAAES,EAAO,EAInB,iBAAkBT,EAAEQ,EAAO,EAI3B,KAAMR,EAAEQ,EAAO,EAIf,MAAOR,EAAEQ,EAAO,EAIhB,SAAUR,EAAEQ,EAAO,EAInB,OAAQR,EAAEQ,EAAO,EAIjB,KAAMR,EAAEQ,EAAO,EAKf,UAAWR,EAAEQ,EAAO,EAKpB,cAAeR,EAAEQ,EAAO,EAIxB,SAAUR,EAAE,EAIZ,QAASA,EAAE,EAIX,QAASA,EAAE,EAIX,QAASA,EAAE,EAIX,KAAAc,GAKA,aAAcd,EAAEc,EAAI,EAKpB,WAAYd,EAAEc,EAAI,EAKlB,sBAAuBd,EAAEc,EAAI,EAM7B,WAAYjB,GAAI,eAAe,EAM/B,SAAUA,GAAI,eAAe,EAO7B,SAAUA,GAAI,eAAe,EAM7B,SAAUA,GAAI,eAAe,EAK7B,MAAOA,GAAI,eAAe,EAS1B,QAASA,GAAI,eAAe,CAChC,EAiDMkB,GAAmB7B,GAAe,CACpC,CAAE,IAAKb,EAAK,KAAM,MAAO,UAAW,EACpC,CAAE,IAAKA,EAAK,QAAS,MAAO,aAAc,EAC1C,CAAE,IAAKA,EAAK,SAAU,MAAO,cAAe,EAC5C,CAAE,IAAKA,EAAK,OAAQ,MAAO,YAAa,EACxC,CAAE,IAAKA,EAAK,QAAS,MAAO,aAAc,EAC1C,CAAE,IAAKA,EAAK,KAAM,MAAO,UAAW,EACpC,CAAE,IAAKA,EAAK,KAAM,MAAO,UAAW,EACpC,CAAE,IAAKA,EAAK,IAAK,MAAO,SAAU,EAClC,CAAE,IAAKA,EAAK,UAAW,MAAO,eAAgB,EAC9C,CAAE,IAAKA,EAAK,SAAU,MAAO,cAAe,EAC5C,CAAE,IAAKA,EAAK,QAAS,MAAO,aAAc,EAC1C,CAAE,IAAKA,EAAK,QAAS,MAAO,aAAc,EAC1C,CAAE,IAAKA,EAAK,OAAQ,MAAO,YAAa,EACxC,CAAE,IAAKA,EAAK,OAAQ,MAAO,YAAa,EACxC,CAAE,IAAK,CAACA,EAAK,OAAQA,EAAK,OAAQA,EAAK,QAAQA,EAAK,MAAM,CAAC,EAAG,MAAO,aAAc,EACnF,CAAE,IAAKA,EAAK,aAAc,MAAO,kBAAmB,EACpD,CAAE,IAAKA,EAAK,MAAMA,EAAK,YAAY,EAAG,MAAO,4BAA6B,EAC1E,CAAE,IAAKA,EAAK,WAAWA,EAAK,YAAY,EAAG,MAAO,iCAAkC,EACpF,CAAE,IAAKA,EAAK,QAAQA,EAAK,YAAY,EAAG,MAAO,mBAAoB,EACnE,CAAE,IAAKA,EAAK,WAAWA,EAAK,YAAY,EAAG,MAAO,iCAAkC,EACpF,CAAE,IAAKA,EAAK,SAAU,MAAO,cAAe,EAC5C,CAAE,IAAKA,EAAK,UAAW,MAAO,eAAgB,EAC9C,CAAE,IAAKA,EAAK,UAAW,MAAO,eAAgB,EAC9C,CAAE,IAAKA,EAAK,UAAW,MAAO,eAAgB,EAC9C,CAAE,IAAKA,EAAK,aAAc,MAAO,kBAAmB,EACpD,CAAE,IAAKA,EAAK,SAAU,MAAO,cAAe,EAC5C,CAAE,IAAKA,EAAK,QAAS,MAAO,aAAc,EAC1C,CAAE,IAAKA,EAAK,KAAM,MAAO,UAAW,EACpC,CAAE,IAAKA,EAAK,QAAS,MAAO,aAAc,EAC1C,CAAE,IAAKA,EAAK,YAAa,MAAO,iBAAkB,CACtD,CAAC,IC7wBD,SAAS2D,GAAMC,EAAO,CAClB,IAAIC,EAAO,OAAO,KAAKD,CAAK,EAAE,KAAK,EAAE,EACjCE,EAAQ,KAAK,KAAKD,CAAI,EAC1B,OAAIC,IACAD,EAAOA,EAAK,QAAQ,MAAO,EAAE,GAC1B,IAAIC,EAAQ,MAAQ,EAAE,GAAGD,EAAK,QAAQ,WAAY,MAAM,CAAC,GACpE,CACA,SAASE,GAAYC,EAAS,CAC1B,IAAIC,EAAQ,OAAO,OAAO,IAAI,EAAGC,EAAO,OAAO,OAAO,IAAI,EAC1D,OAAS,CAAE,MAAAC,CAAM,IAAKH,EAAS,CAC3BC,EAAME,EAAM,CAAC,CAAC,EAAI,GAClB,QAASC,EAAI,EAAGA,EAAID,EAAM,OAAQC,IAC9BF,EAAKC,EAAMC,CAAC,CAAC,EAAI,EACzB,CACA,IAAIC,EAASV,GAAMM,CAAK,EAAIN,GAAMO,CAAI,EAAI,KAC1C,MAAO,CAAC,IAAI,OAAO,IAAMG,CAAM,EAAG,IAAI,OAAOA,CAAM,CAAC,CACxD,CAKA,SAASC,GAAiBC,EAAM,CAC5B,IAAIP,EAAUO,EAAK,IAAIC,GAAK,OAAOA,GAAK,SAAW,CAAE,MAAOA,CAAE,EAAIA,CAAC,EAC/D,CAACC,EAAUC,CAAK,EAAIV,EAAQ,MAAMQ,GAAK,QAAQ,KAAKA,EAAE,KAAK,CAAC,EAAI,CAAC,OAAQ,MAAM,EAAIT,GAAYC,CAAO,EAC1G,OAAQW,GAAY,CAChB,IAAIC,EAAQD,EAAQ,YAAYD,CAAK,EACrC,OAAOE,GAASD,EAAQ,SAAW,CAAE,KAAMC,EAAQA,EAAM,KAAOD,EAAQ,IAAK,QAAAX,EAAS,SAAAS,CAAS,EAAI,IACvG,CACJ,CAoBA,SAASI,GAAQC,EAAOT,EAAQ,CAC5B,OAAQM,GAAY,CAChB,QAASI,KAAM,eAAWJ,EAAQ,KAAK,EAAE,aAAaA,EAAQ,IAAK,EAAE,EAAGI,EAAKA,EAAMA,EAAI,OAAQ,CAC3F,GAAID,EAAM,QAAQC,EAAI,IAAI,EAAI,GAC1B,OAAO,KACX,GAAIA,EAAI,KAAK,MACT,KACR,CACA,OAAOV,EAAOM,CAAO,CACzB,CACJ,CArIA,IAAAK,GACAC,GACAC,GAomDMC,GAwCAC,GA9oDNC,GAAAC,GAAA,kBAAAN,GAA+L,6BAC/LC,GAAyH,4BACzHC,GAAuC,gCAomDjCC,GAA6B,IAAI,cAAc,aAAW,CAChE,EACAA,GAAc,UAAY,EAC1BA,GAAc,QAAU,GAqClBC,GAAU,OAAO,WAAa,UAAyB,YAAY,KAAK,UAAU,SAAS,oHGzlDjG,SAASG,GAAYC,EAAI,CACvB,OAAOA,IAAOC,IAAWD,IAAOE,EAClC,CAkCA,SAASC,GAAYC,EAAO,CAC1B,IAAIC,EAAQ,EACZ,QAASC,EAAI,EAAGA,EAAIF,EAAM,OAAQE,IAChCD,GAASD,EAAM,WAAWE,CAAC,IAAMC,GAAM,EAAKF,EAAQ,EAAK,EAC3D,OAAOA,CACT,CG6XA,SAASG,GAAUC,EAAMC,EAAKC,EAAMC,EAAI,CACpC,OAAQH,EAAM,CACV,IAAK,GAAsB,OAAOE,EAAOD,EACzC,IAAK,GAA0B,OAAOE,GAAMF,GAAOC,EAAOD,EAC1D,IAAK,GAAqB,OAAOC,EAAOD,GAAOE,EAAKF,EACpD,IAAK,GAAwB,OAAOC,GAAQD,GAAOE,EAAKF,EACxD,IAAK,GAAoB,OAAOE,EAAKF,EACrC,IAAK,GAAuB,MAAO,EACvC,CACJ,CACA,SAASG,GAA2BC,EAAMJ,EAAK,CAC3C,IAAIK,EAAOD,EAAK,YAAYJ,CAAG,EAC/B,KAAOK,GAAM,CACT,IAAIC,EAAOD,EAAK,UAChB,GAAI,CAACC,GAAQA,EAAK,IAAMD,EAAK,GACzB,MACAC,EAAK,KAAK,SAAWA,EAAK,MAAQA,EAAK,IACvCF,EAAOC,EACPA,EAAOC,EAAK,aAGZD,EAAOC,CAEf,CACA,OAAOF,CACX,CACA,SAASG,GAAYH,EAAMJ,EAAKD,EAAMS,EAAU,CAG5C,QAFIC,EAEGL,EAAK,MAAQA,EAAK,KACpBL,EAAO,EAAIK,EAAK,MAAQJ,EAAMI,EAAK,KAAOJ,KAC1CD,EAAO,GAAKK,EAAK,IAAMJ,EAAMI,EAAK,GAAKJ,IAAM,CAC9C,IAAIU,EAAS,CAACF,GAAYJ,aAAgBO,IAAYP,EAAK,MAAQ,EAAI,KAAOA,EAAK,OACnF,GAAI,CAACM,EACD,OAAON,EACXA,EAAOM,CACX,CACA,IAAIE,EAAOJ,EAAW,EAAIK,GAAS,eAEnC,GAAIL,EACA,QAASH,EAAOD,EAAMM,EAASL,EAAK,OAAQK,EAAQL,EAAOK,EAAQA,EAASL,EAAK,OACzEA,aAAgBM,IAAYN,EAAK,MAAQ,KAAOI,EAAKC,EAAO,MAAMV,EAAKD,EAAMa,CAAI,KAAO,MAAQH,IAAO,OAAS,OAASA,EAAG,OAASJ,EAAK,OAC1ID,EAAOM,GAEnB,OAAS,CACL,IAAII,EAAQV,EAAK,MAAMJ,EAAKD,EAAMa,CAAI,EACtC,GAAI,CAACE,EACD,OAAOV,EACXA,EAAOU,CACX,CACJ,CAoGA,SAASC,GAAYX,EAAMY,EAAMC,EAAQC,EAAO,CAC5C,IAAIC,EAAMf,EAAK,OAAO,EAAGgB,EAAS,CAAC,EACnC,GAAI,CAACD,EAAI,WAAW,EAChB,OAAOC,EACX,GAAIH,GAAU,MACV,KAAO,CAACE,EAAI,KAAK,GAAGF,CAAM,GACtB,GAAI,CAACE,EAAI,YAAY,EACjB,OAAOC,EACnB,OAAS,CACL,GAAIF,GAAS,MAAQC,EAAI,KAAK,GAAGD,CAAK,EAClC,OAAOE,EAGX,GAFID,EAAI,KAAK,GAAGH,CAAI,GAChBI,EAAO,KAAKD,EAAI,IAAI,EACpB,CAACA,EAAI,YAAY,EACjB,OAAOD,GAAS,KAAOE,EAAS,CAAC,CACzC,CACJ,CACA,SAASC,GAAiBjB,EAAMkB,EAAS1B,EAAI0B,EAAQ,OAAS,EAAG,CAC7D,QAASC,EAAInB,EAAK,OAAQR,GAAK,EAAG2B,EAAIA,EAAE,OAAQ,CAC5C,GAAI,CAACA,EACD,MAAO,GACX,GAAI,CAACA,EAAE,KAAK,YAAa,CACrB,GAAID,EAAQ1B,CAAC,GAAK0B,EAAQ1B,CAAC,GAAK2B,EAAE,KAC9B,MAAO,GACX3B,GACJ,CACJ,CACA,MAAO,EACX,CAgWA,SAAS4B,GAASC,EAAM,CACpB,OAAOA,EAAK,SAAS,KAAKnC,GAAMA,aAAcoC,IAAc,CAACpC,EAAG,KAAK,aAAekC,GAASlC,CAAE,CAAC,CACpG,CACA,SAASqC,GAAUC,EAAM,CACrB,IAAInB,EACJ,GAAI,CAAE,OAAAoB,EAAQ,QAAAC,EAAS,gBAAAC,EAAkBC,GAAqB,OAAAC,EAAS,CAAC,EAAG,cAAAC,EAAgBJ,EAAQ,MAAM,MAAO,EAAIF,EAChHO,EAAS,MAAM,QAAQN,CAAM,EAAI,IAAIO,GAAiBP,EAAQA,EAAO,MAAM,EAAIA,EAC/EQ,EAAQP,EAAQ,MAChBQ,EAAc,EAAGC,EAAY,EACjC,SAASC,EAASC,EAAaC,EAAQC,EAAUC,EAAWC,EAAU,CAClE,GAAI,CAAE,GAAAC,EAAI,MAAAC,EAAO,IAAAC,EAAK,KAAAC,CAAK,EAAId,EAC3Be,EAAmBX,EACvB,KAAOU,EAAO,GAEV,GADAd,EAAO,KAAK,EACRc,GAAQ,GAA8B,CACtC,IAAI7C,EAAO6B,EAAOa,CAAE,EACpBH,EAAS,KAAKvC,CAAI,EAClBwC,EAAU,KAAKG,EAAQN,CAAW,EAClC,MACJ,SACSQ,GAAQ,GAAsC,CACnDX,EAAcQ,EACd,MACJ,SACSG,GAAQ,GAAkC,CAC/CV,EAAYO,EACZ,MACJ,KAEI,OAAM,IAAI,WAAW,6BAA6BG,CAAI,EAAE,EAGhE,IAAIjC,EAAOqB,EAAMS,CAAE,EAAG1C,EAAMyB,EACxBsB,EAAWJ,EAAQN,EACvB,GAAIO,EAAMD,GAAShB,IAAoBF,EAASuB,EAAejB,EAAO,IAAMO,EAAQG,CAAQ,GAAI,CAE5F,IAAIjB,EAAO,IAAI,YAAYC,EAAO,KAAOA,EAAO,IAAI,EAChDwB,EAASlB,EAAO,IAAMN,EAAO,KAAMyB,EAAQ1B,EAAK,OACpD,KAAOO,EAAO,IAAMkB,GAChBC,EAAQC,EAAa1B,EAAO,MAAOD,EAAM0B,CAAK,EAClDlD,EAAO,IAAIsB,GAAWE,EAAMoB,EAAMnB,EAAO,MAAOC,CAAO,EACvDqB,EAAWtB,EAAO,MAAQY,CAC9B,KACK,CACD,IAAIY,EAASlB,EAAO,IAAMc,EAC1Bd,EAAO,KAAK,EACZ,IAAIqB,EAAgB,CAAC,EAAGC,EAAiB,CAAC,EACtCC,EAAgBZ,GAAMZ,EAAgBY,EAAK,GAC3Ca,EAAY,EAAGC,EAAUZ,EAC7B,KAAOb,EAAO,IAAMkB,GACZK,GAAiB,GAAKvB,EAAO,IAAMuB,GAAiBvB,EAAO,MAAQ,GAC/DA,EAAO,KAAOyB,EAAU7B,IACxB8B,EAAeL,EAAeC,EAAgBV,EAAOY,EAAWxB,EAAO,IAAKyB,EAASF,EAAeR,CAAgB,EACpHS,EAAYH,EAAc,OAC1BI,EAAUzB,EAAO,KAErBA,EAAO,KAAK,GAGZK,EAASO,EAAOM,EAAQG,EAAeC,EAAgBC,CAAa,EAO5E,GAJIA,GAAiB,GAAKC,EAAY,GAAKA,EAAYH,EAAc,QACjEK,EAAeL,EAAeC,EAAgBV,EAAOY,EAAWZ,EAAOa,EAASF,EAAeR,CAAgB,EACnHM,EAAc,QAAQ,EACtBC,EAAe,QAAQ,EACnBC,EAAgB,IAAMC,EAAY,EAAG,CACrC,IAAIG,GAAOC,EAAa/C,CAAI,EAC5BZ,EAAO4D,GAAahD,EAAMwC,EAAeC,EAAgB,EAAGD,EAAc,OAAQ,EAAGR,EAAMD,EAAOe,GAAMA,EAAI,CAChH,MAEI1D,EAAO6D,EAASjD,EAAMwC,EAAeC,EAAgBT,EAAMD,EAAOG,EAAmBF,CAAG,CAEhG,CACAL,EAAS,KAAKvC,CAAI,EAClBwC,EAAU,KAAKO,CAAQ,CAC3B,CACA,SAASY,EAAa/C,EAAM,CACxB,MAAO,CAAC2B,EAAUC,EAAWsB,IAAW,CACpC,IAAI3B,EAAY,EAAG4B,EAAQxB,EAAS,OAAS,EAAGrC,EAAM8D,EACtD,GAAID,GAAS,IAAM7D,EAAOqC,EAASwB,CAAK,aAAcE,GAAM,CACxD,GAAI,CAACF,GAAS7D,EAAK,MAAQU,GAAQV,EAAK,QAAU4D,EAC9C,OAAO5D,GACP8D,EAAgB9D,EAAK,KAAKgE,GAAS,SAAS,KAC5C/B,EAAYK,EAAUuB,CAAK,EAAI7D,EAAK,OAAS8D,EACrD,CACA,OAAOH,EAASjD,EAAM2B,EAAUC,EAAWsB,EAAQ3B,CAAS,CAChE,CACJ,CACA,SAASsB,EAAelB,EAAUC,EAAW2B,EAAM3E,EAAGK,EAAMC,EAAIc,EAAMuB,EAAW,CAC7E,IAAIiB,EAAgB,CAAC,EAAGC,EAAiB,CAAC,EAC1C,KAAOd,EAAS,OAAS/C,GACrB4D,EAAc,KAAKb,EAAS,IAAI,CAAC,EACjCc,EAAe,KAAKb,EAAU,IAAI,EAAI2B,EAAOtE,CAAI,EAErD0C,EAAS,KAAKsB,EAASnC,EAAQ,MAAMd,CAAI,EAAGwC,EAAeC,EAAgBvD,EAAKD,EAAMsC,EAAYrC,CAAE,CAAC,EACrG0C,EAAU,KAAK3C,EAAOsE,CAAI,CAC9B,CACA,SAASN,EAASjD,EAAM2B,EAAUC,EAAWsB,EAAQ3B,EAAY,EAAGiC,EAAO,CACvE,GAAIlC,EAAa,CACb,IAAImC,EAAO,CAACH,GAAS,YAAahC,CAAW,EAC7CkC,EAAQA,EAAQ,CAACC,CAAI,EAAE,OAAOD,CAAK,EAAI,CAACC,CAAI,CAChD,CACA,GAAIlC,EAAY,GAAI,CAChB,IAAIkC,EAAO,CAACH,GAAS,UAAW/B,CAAS,EACzCiC,EAAQA,EAAQ,CAACC,CAAI,EAAE,OAAOD,CAAK,EAAI,CAACC,CAAI,CAChD,CACA,OAAO,IAAIJ,GAAKrD,EAAM2B,EAAUC,EAAWsB,EAAQM,CAAK,CAC5D,CACA,SAASpB,EAAesB,EAAS7B,EAAU,CAOvC,IAAI8B,EAAOxC,EAAO,KAAK,EACnBc,EAAO,EAAGF,EAAQ,EAAG6B,EAAO,EAAGC,EAAWF,EAAK,IAAM5C,EACrDX,EAAS,CAAE,KAAM,EAAG,MAAO,EAAG,KAAM,CAAE,EAC1Cf,EAAM,QAASqC,EAASiC,EAAK,IAAMD,EAASC,EAAK,IAAMjC,GAAS,CAC5D,IAAIoC,EAAWH,EAAK,KAEpB,GAAIA,EAAK,IAAM9B,GAAYiC,GAAY,EAAG,CAGtC1D,EAAO,KAAO6B,EACd7B,EAAO,MAAQ2B,EACf3B,EAAO,KAAOwD,EACdA,GAAQ,EACR3B,GAAQ,EACR0B,EAAK,KAAK,EACV,QACJ,CACA,IAAIxB,EAAWwB,EAAK,IAAMG,EAC1B,GAAIA,EAAW,GAAK3B,EAAWT,GAAUiC,EAAK,MAAQE,EAClD,MACJ,IAAIE,EAAeJ,EAAK,IAAMzC,EAAgB,EAAI,EAC9C8C,EAAYL,EAAK,MAErB,IADAA,EAAK,KAAK,EACHA,EAAK,IAAMxB,GAAU,CACxB,GAAIwB,EAAK,KAAO,EACZ,GAAIA,EAAK,MAAQ,GACbI,GAAgB,MAEhB,OAAM1E,OAELsE,EAAK,IAAMzC,IAChB6C,GAAgB,GAEpBJ,EAAK,KAAK,CACd,CACA5B,EAAQiC,EACR/B,GAAQ6B,EACRF,GAAQG,CACZ,CACA,OAAIlC,EAAW,GAAKI,GAAQyB,KACxBtD,EAAO,KAAO6B,EACd7B,EAAO,MAAQ2B,EACf3B,EAAO,KAAOwD,GAEXxD,EAAO,KAAO,EAAIA,EAAS,MACtC,CACA,SAASmC,EAAa0B,EAAapD,EAAQyB,EAAO,CAC9C,GAAI,CAAE,GAAAR,EAAI,MAAAC,EAAO,IAAAC,EAAK,KAAAC,CAAK,EAAId,EAE/B,GADAA,EAAO,KAAK,EACRc,GAAQ,GAAKH,EAAKZ,EAAe,CACjC,IAAIgD,EAAa5B,EACjB,GAAIL,EAAO,EAAG,CACV,IAAII,EAASlB,EAAO,KAAOc,EAAO,GAClC,KAAOd,EAAO,IAAMkB,GAChBC,EAAQC,EAAa0B,EAAapD,EAAQyB,CAAK,CACvD,CACAzB,EAAO,EAAEyB,CAAK,EAAI4B,EAClBrD,EAAO,EAAEyB,CAAK,EAAIN,EAAMiC,EACxBpD,EAAO,EAAEyB,CAAK,EAAIP,EAAQkC,EAC1BpD,EAAO,EAAEyB,CAAK,EAAIR,CACtB,MACSG,GAAQ,GACbX,EAAcQ,EAETG,GAAQ,KACbV,EAAYO,GAEhB,OAAOQ,CACX,CACA,IAAIX,EAAW,CAAC,EAAGC,EAAY,CAAC,EAChC,KAAOT,EAAO,IAAM,GAChBK,EAASZ,EAAK,OAAS,EAAGA,EAAK,aAAe,EAAGe,EAAUC,EAAW,EAAE,EAC5E,IAAIsB,GAAUzD,EAAKmB,EAAK,UAAY,MAAQnB,IAAO,OAASA,EAAMkC,EAAS,OAASC,EAAU,CAAC,EAAID,EAAS,CAAC,EAAE,OAAS,EACxH,OAAO,IAAI0B,GAAKhC,EAAMT,EAAK,KAAK,EAAGe,EAAS,QAAQ,EAAGC,EAAU,QAAQ,EAAGsB,CAAM,CACtF,CAEA,SAASY,GAASK,EAAa/E,EAAM,CACjC,GAAI,CAAC+E,EAAY,aAAe/E,aAAgBsB,IAActB,EAAK,MAAQ+E,EACvE,MAAO,GACX,IAAIlC,EAAOmC,GAAc,IAAIhF,CAAI,EACjC,GAAI6C,GAAQ,KAAM,CACdA,EAAO,EACP,QAASoC,KAASjF,EAAK,SAAU,CAC7B,GAAIiF,EAAM,MAAQF,GAAe,EAAEE,aAAiBhB,IAAO,CACvDpB,EAAO,EACP,KACJ,CACAA,GAAQ6B,GAASK,EAAaE,CAAK,CACvC,CACAD,GAAc,IAAIhF,EAAM6C,CAAI,CAChC,CACA,OAAOA,CACX,CACA,SAASe,GAETmB,EAEAxC,EAAUC,EAEV3C,EAAMC,EAEN6C,EAEAmB,EAEAoB,EAEAC,EAAQ,CACJ,IAAIC,EAAQ,EACZ,QAAS5F,EAAIK,EAAML,EAAIM,EAAIN,IACvB4F,GAASV,GAASK,EAAaxC,EAAS/C,CAAC,CAAC,EAC9C,IAAI6F,EAAW,KAAK,KAAMD,EAAQ,IAAO,CAA4B,EACjEhC,EAAgB,CAAC,EAAGC,EAAiB,CAAC,EAC1C,SAASiC,EAAO/C,EAAUC,EAAW3C,EAAMC,EAAIyF,EAAQ,CACnD,QAAS/F,EAAIK,EAAML,EAAIM,GAAK,CACxB,IAAI0F,EAAYhG,EAAGiG,EAAajD,EAAUhD,CAAC,EAAGkG,EAAYhB,GAASK,EAAaxC,EAAS/C,CAAC,CAAC,EAE3F,IADAA,IACOA,EAAIM,EAAIN,IAAK,CAChB,IAAImG,EAAWjB,GAASK,EAAaxC,EAAS/C,CAAC,CAAC,EAChD,GAAIkG,EAAYC,GAAYN,EACxB,MACJK,GAAaC,CACjB,CACA,GAAInG,GAAKgG,EAAY,EAAG,CACpB,GAAIE,EAAYL,EAAU,CACtB,IAAIO,EAAOrD,EAASiD,CAAS,EAC7BF,EAAOM,EAAK,SAAUA,EAAK,UAAW,EAAGA,EAAK,SAAS,OAAQpD,EAAUgD,CAAS,EAAID,CAAM,EAC5F,QACJ,CACAnC,EAAc,KAAKb,EAASiD,CAAS,CAAC,CAC1C,KACK,CACD,IAAI1B,EAAStB,EAAUhD,EAAI,CAAC,EAAI+C,EAAS/C,EAAI,CAAC,EAAE,OAASiG,EACzDrC,EAAc,KAAKQ,GAAamB,EAAaxC,EAAUC,EAAWgD,EAAWhG,EAAGiG,EAAY3B,EAAQ,KAAMqB,CAAM,CAAC,CACrH,CACA9B,EAAe,KAAKoC,EAAaF,EAAS5C,CAAK,CACnD,CACJ,CACA,OAAA2C,EAAO/C,EAAUC,EAAW3C,EAAMC,EAAI,CAAC,GAC/BoF,GAASC,GAAQ/B,EAAeC,EAAgBS,CAAM,CAClE,CCltCA,SAAS+B,GAAMjF,EAAc,CAC3B,MAAO,CACLZ,EACA8F,EACAC,IACG,CACH,GAAIA,EAAO,MAAO,GAClB,IAAMrD,EAAK1C,EAAK,KAAK,SAAS,cAAc,EAC5C,OAAI0C,GAAM,MAAMoD,EAAIpD,EAAI9B,CAAI,EACrB,EACT,CACF,CAoFO,SAASoF,GACd9E,EACyB,CACzB,OAAO,IACT,CN/GA,SAAS+E,GACP/E,EACAlB,EACe,CACf,IAAMmE,EAAOjD,EAAQ,cAAclB,CAAI,EACjCkG,EAAOhF,EAAQ,OAAOA,EAAQ,IAAK,EAAE,EACrCpB,EAAKoG,EAAK,KAAOA,EAAK,KAAK,OAcjC,MAVE,YAAY,KAAKA,EAAK,IAAI,GAC1BhF,EAAQ,KAAK,GAAKpB,EAAK,KACvB,CAAC,KAAK,KAAKoB,EAAQ,MAAM,SAASpB,EAAIoB,EAAQ,KAAK,EAAE,CAAC,GACtDA,EAAQ,WAAWA,EAAQ,IAAK,EAAE,GAAKiD,GAQvC,mBAAmB,KAAKjD,EAAQ,SAAS,GACzCA,EAAQ,WAAWA,EAAQ,IAAK,EAAE,EAAIiD,EAE/B,KAEFA,EAAOjD,EAAQ,IACxB,CA4DO,SAASiF,IAA4B,CAC1C,OAAO,IAAI,mBAAgBC,GAAkB,CAC3CA,GAAiB,KAAK,GAAG,CAAE,aAAcJ,EAAsB,CAAC,EAChEI,GAAiB,KAAK,GAAG,CAAE,aAAcC,EAAiB,CAAC,CAC7D,CAAC,CACH,KA3GAC,GGEEC,GACAC,GACArH,GACAsH,GACAC,GACAC,GAOAC,GACAC,GAQAC,GACAC,GAIAC,GAWAC,GAEAC,GACAC,GAEAC,GAGAC,GDtBIC,GAUAnI,GACAC,GACAE,GACAG,GACA8H,GAEAC,GAUAC,GAMOC,GAuCAC,GA2BAC,GEzHAC,GHEPC,GACOC,GIFPnG,GACFoG,GAUE9D,GA2EA+D,GAEAC,GAyHAC,GAA4BC,GAG9B3H,GAkCEwD,GA+IAjC,GAiBAV,GAqHAf,GAgIA8H,GAQAC,GAgFAC,GAscAvD,GAqEAwD,GAiMAC,GCn6CAC,GAyBAC,GAgFAC,GAQAC,GAkNOC,GAEAzC,GNxSAD,2BA5CbE,GAOO,gCCNPyC,KCDAA,KEAAA,KEMAA,KHJExC,GAAS,IACTC,GAAS,IACTrH,GAAU,IACVsH,GAAiB,IACjBC,GAAmB,IACnBC,GAAM,IAONC,GAAS,GACTC,GAAkC,GAQlCC,GAA2B,GAC3BC,GAAsB,GAItBC,GAAW,GAWXC,GAAqB,GAErBC,GAA2B,GAC3BC,GAAS,GAETC,GAAwB,GAGxBC,GAA0B,GDtBtBC,GAAY,IAAI,IAAI,CACxBF,GACAL,GACAG,GACAD,GACAH,GACAD,GACAQ,EACF,CAAC,EAEKlI,GAAU;EAAK,WAAW,CAAC,EAC3BC,GAAiB,KAAK,WAAW,CAAC,EAClCE,GAAQ,IAAI,WAAW,CAAC,EACxBG,GAAM,IAAK,WAAW,CAAC,EACvB8H,GAAO,IAAI,WAAW,CAAC,EAEvBC,GAAN,KAAkB,CAChB,YAAYlH,EAAQf,EAAO,CACzB,KAAK,OAASe,EAEd,KAAK,MAAQf,EACb,KAAK,MACFe,EAAUA,EAAO,KAAOA,EAAO,MAAS,EAAI,GAAKf,GAASA,GAAS,EACxE,CACF,EAEMkI,GAAY,IAAID,GAAY,KAAM,CAAC,EAM5BE,GAAW,IAAIsB,GAC1B,CAACC,EAAOC,IAAU,CAChB,IAAIC,EACJ,GAAIF,EAAM,KAAO,EACfA,EAAM,YAAYtC,EAAG,UACZuC,EAAM,QAAQ,MAAQ,EAC3BjK,GAAYgK,EAAM,IAAI,GACxBA,EAAM,YAAYvC,GAAkB,CAAC,YAGrCyC,EAAOF,EAAM,KAAK,EAAE,GAAK,GAAKhK,GAAYkK,CAAI,IAChDD,EAAM,SAASzC,EAAc,EAC7B,CACA,IAAI2C,EAAS,EACb,KAAOH,EAAM,OAAS3J,IAAS2J,EAAM,OAASxJ,IAC5CwJ,EAAM,QAAQ,EACdG,KAGAH,EAAM,OAAS9J,IACf8J,EAAM,OAAS7J,IACf6J,EAAM,OAAS1B,KAEf0B,EAAM,YAAYxC,GAAgB,CAAC2C,CAAM,CAE7C,MAAWnK,GAAYgK,EAAM,IAAI,GAC/BA,EAAM,YAAY9J,GAAc,CAAC,CAErC,EACA,CAAE,WAAY,EAAK,CACrB,EASawI,GAAc,IAAI0B,GAAe,CAC5C,MAAO5B,GACP,OAAOvG,EAASoI,EAAM,CACpB,OAAOpI,EAAQ,MAAQ,GAAKoG,GAAU,IAAIgC,CAAI,EAAIpI,EAAQ,OAASA,CACrE,EACA,MAAMA,EAASoI,EAAMJ,EAAOD,EAAO,CACjC,OAAQK,EAAM,CACZ,KAAK/C,GACH,OAAO,IAAIiB,GACTtG,EACA7B,GAAY4J,EAAM,KAAKA,EAAM,IAAKC,EAAM,GAAG,CAAC,CAC9C,EACF,KAAK1C,GACH,OAAOtF,EAAQ,OACjB,KAAK0F,GACL,KAAKI,GACL,KAAKG,GACH,OAAO,IAAIK,GAAYtG,EAAS,EAAE,EACpC,QACE,OAAOA,CACX,CACF,EACA,KAAKA,EAAS,CACZ,OAAOA,EAAQ,IACjB,CACF,CAAC,EAEY0G,GAAc,IAAIoB,GAAkB,CAACC,EAAOC,IAAU,CACjE,IAAMK,EAAeL,EAAM,QAAQ,MACnC,GAAIK,EAAe,EAAG,OAEtB,IAAMJ,EAAOF,EAAM,KAAK,EAAE,EAE1B,GAAI,EAAEE,IAAShK,IAAWgK,IAAS/J,IACjC,OAGF,IAAIoK,EAAQ,EACRjK,EAAQ,EAEZ,OAAa,CACX,GAAI0J,EAAM,OAAS3J,GACjBC,YACS0J,EAAM,OAASxJ,GACxBF,GAAS,EAAKA,EAAQ,MAEtB,OAGF0J,EAAM,QAAQ,EACdO,GAAS,CACX,CAGEjK,IAAUgK,GACVN,EAAM,OAAS9J,IACf8J,EAAM,OAAS7J,IACf6J,EAAM,OAAS1B,KAEXhI,EAAQgK,EACVN,EAAM,YAAYzC,GAAQ,CAACgD,CAAK,EAEhCP,EAAM,YAAY1C,EAAM,EAG9B,CAAC,EE/JYsB,GAAuB4B,GAAU,CAC5C,4EACEC,EAAE,eACJ,uBAAwBA,EAAE,gBAC1B,0CAA2CA,EAAE,kBAC7C,eAAgBA,EAAE,cAClB,oBAAqBA,EAAE,QACvB,KAAMA,EAAE,KACR,MAAOA,EAAE,KACT,KAAMA,EAAE,KACR,QAASA,EAAE,YACX,OAAQA,EAAE,OACV,OAAQA,EAAE,OACV,SAAUA,EAAE,eACZ,QAASA,EAAE,mBACX,MAAOA,EAAE,gBACT,UAAWA,EAAE,gBACb,SAAUA,EAAE,mBACZ,mGACEA,EAAE,WAAWA,EAAE,SAAS,EAC1B,MAAOA,EAAE,MACT,MAAOA,EAAE,cACT,MAAOA,EAAE,MACT,IAAKA,EAAE,cACP,MAAOA,EAAE,SACX,CAAC,EHvBK5B,GAAkB,CAAC,UAAU,KAAK,GAAG,GAAI,IAAI,GAAI,IAAI,GAAI,IAAI,GAAI,OAAO,GAAI,IAAI,GAAI,MAAM,GAAI,MAAM,GAAI,GAAG,IAAK,GAAG,IAAK,KAAK,IAAK,QAAQ,IAAK,GAAG,IAAK,WAAW,IAAK,QAAQ,IAAK,OAAO,IAAK,KAAK,IAAK,OAAO,IAAK,MAAM,IAAK,GAAG,IAAK,KAAK,IAAK,KAAK,IAAK,IAAI,IAAK,MAAM,IAAK,MAAM,GAAG,EACnRC,GAAS4B,GAAS,YAAY,CACzC,QAAS,GACT,OAAQ,29GACR,UAAW,mgKACX,KAAM,6gFACN,UAAW,i6CACX,QAAS,IACT,QAAShC,GACT,UAAW,CACT,CAAC,QAAS,GAAG,EAAE,IAAI,YAAY,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,iBAAiB,GAAG,GAAG,GAAG,GAAG,gBAAgB,EACtI,CAAC,WAAY,EAAE,GAAG,EAClB,CAAC,WAAY,GAAG,GAAG,CACrB,EACA,YAAa,CAACE,EAAoB,EAClC,aAAc,CAAC,EAAE,CAAC,EAClB,gBAAiB,GACjB,UAAW,6jFACX,WAAY,CAACD,GAAaF,GAAU,EAAG,EAAG,CAAC,EAC3C,SAAU,CAAC,OAAS,CAAC,EAAE,CAAC,CAAC,EACzB,YAAa,CAAC,CAAC,KAAM,EAAG,IAAKkC,GAAS9B,GAAgB8B,CAAK,GAAK,EAAE,CAAC,EACnE,UAAW,IACb,CAAC,EIvBKhI,GAAsB,KACxBoG,GAAa,EAUX9D,GAAN,KAAe,CAEX,YAAY2F,EAAS,CAAC,EAAG,CACrB,KAAK,GAAK7B,KACV,KAAK,QAAU,CAAC,CAAC6B,EAAO,QACxB,KAAK,YAAcA,EAAO,cAAgB,IAAM,CAC5C,MAAM,IAAI,MAAM,sDAAsD,CAC1E,EACJ,CAQA,IAAIC,EAAO,CACP,GAAI,KAAK,QACL,MAAM,IAAI,WAAW,wCAAwC,EACjE,OAAI,OAAOA,GAAS,aAChBA,EAAQ5B,GAAS,MAAM4B,CAAK,GACxBlJ,GAAS,CACb,IAAII,EAAS8I,EAAMlJ,CAAI,EACvB,OAAOI,IAAW,OAAY,KAAO,CAAC,KAAMA,CAAM,CACtD,CACJ,CACJ,EAKAkD,GAAS,SAAW,IAAIA,GAAS,CAAE,YAAa6F,GAAOA,EAAI,MAAM,GAAG,CAAE,CAAC,EAIvE7F,GAAS,SAAW,IAAIA,GAAS,CAAE,YAAa6F,GAAOA,EAAI,MAAM,GAAG,CAAE,CAAC,EAIvE7F,GAAS,MAAQ,IAAIA,GAAS,CAAE,YAAa6F,GAAOA,EAAI,MAAM,GAAG,CAAE,CAAC,EAIpE7F,GAAS,YAAc,IAAIA,GAAS,CAAE,QAAS,EAAK,CAAC,EAKrDA,GAAS,UAAY,IAAIA,GAAS,CAAE,QAAS,EAAK,CAAC,EAInDA,GAAS,QAAU,IAAIA,GAAS,CAAE,QAAS,EAAK,CAAC,EAuB3C+D,GAAU,OAAO,OAAO,IAAI,EAE5BC,GAAN,MAAM8B,EAAS,CAEX,YAKAC,EAEA7F,EAGA1B,EAEAwH,EAAQ,EAAG,CACP,KAAK,KAAOD,EACZ,KAAK,MAAQ7F,EACb,KAAK,GAAK1B,EACV,KAAK,MAAQwH,CACjB,CAEA,OAAO,OAAOC,EAAM,CAChB,IAAI/F,EAAQ+F,EAAK,OAASA,EAAK,MAAM,OAAS,OAAO,OAAO,IAAI,EAAIlC,GAChEiC,GAASC,EAAK,IAAM,EAAuB,IAAMA,EAAK,QAAU,EAA2B,IAC1FA,EAAK,MAAQ,EAAyB,IAAMA,EAAK,MAAQ,KAAO,EAA6B,GAC9FvJ,EAAO,IAAIoJ,GAASG,EAAK,MAAQ,GAAI/F,EAAO+F,EAAK,GAAID,CAAK,EAC9D,GAAIC,EAAK,OACL,QAASC,KAAOD,EAAK,MAGjB,GAFK,MAAM,QAAQC,CAAG,IAClBA,EAAMA,EAAIxJ,CAAI,GACdwJ,EAAK,CACL,GAAIA,EAAI,CAAC,EAAE,QACP,MAAM,IAAI,WAAW,4CAA4C,EACrEhG,EAAMgG,EAAI,CAAC,EAAE,EAAE,EAAIA,EAAI,CAAC,CAC5B,EAER,OAAOxJ,CACX,CAGA,KAAKyJ,EAAM,CAAE,OAAO,KAAK,MAAMA,EAAK,EAAE,CAAG,CAEzC,IAAI,OAAQ,CAAE,OAAQ,KAAK,MAAQ,GAAwB,CAAG,CAE9D,IAAI,WAAY,CAAE,OAAQ,KAAK,MAAQ,GAA4B,CAAG,CAEtE,IAAI,SAAU,CAAE,OAAQ,KAAK,MAAQ,GAA0B,CAAG,CAGlE,IAAI,aAAc,CAAE,OAAQ,KAAK,MAAQ,GAA8B,CAAG,CAG1E,GAAGJ,EAAM,CACL,GAAI,OAAOA,GAAQ,SAAU,CACzB,GAAI,KAAK,MAAQA,EACb,MAAO,GACX,IAAIK,EAAQ,KAAK,KAAKpG,GAAS,KAAK,EACpC,OAAOoG,EAAQA,EAAM,QAAQL,CAAI,EAAI,GAAK,EAC9C,CACA,OAAO,KAAK,IAAMA,CACtB,CAOA,OAAO,MAAMM,EAAK,CACd,IAAIC,EAAS,OAAO,OAAO,IAAI,EAC/B,QAASH,KAAQE,EACb,QAASN,KAAQI,EAAK,MAAM,GAAG,EAC3BG,EAAOP,CAAI,EAAIM,EAAIF,CAAI,EAC/B,OAAQrK,GAAS,CACb,QAASyK,EAASzK,EAAK,KAAKkE,GAAS,KAAK,EAAG1E,EAAI,GAAIA,GAAKiL,EAASA,EAAO,OAAS,GAAIjL,IAAK,CACxF,IAAIkL,EAAQF,EAAOhL,EAAI,EAAIQ,EAAK,KAAOyK,EAAOjL,CAAC,CAAC,EAChD,GAAIkL,EACA,OAAOA,CACf,CACJ,CACJ,CACJ,EAEAxC,GAAS,KAAO,IAAIA,GAAS,GAAI,OAAO,OAAO,IAAI,EAAG,EAAG,CAA0B,EAuC7EC,GAAa,IAAI,QAAWC,GAAkB,IAAI,SAIvD,SAAU3H,EAAU,CAIjBA,EAASA,EAAS,eAAoB,CAAC,EAAI,iBAI3CA,EAASA,EAAS,iBAAsB,CAAC,EAAI,mBAI7CA,EAASA,EAAS,aAAkB,CAAC,EAAI,eAKzCA,EAASA,EAAS,eAAoB,CAAC,EAAI,gBAC/C,GAAGA,KAAaA,GAAW,CAAC,EAAE,EAexBwD,GAAN,MAAM0G,EAAK,CAEP,YAEA/J,EAEA2B,EAGAC,EAEAsB,EAEAM,EAAO,CAOH,GANA,KAAK,KAAOxD,EACZ,KAAK,SAAW2B,EAChB,KAAK,UAAYC,EACjB,KAAK,OAASsB,EAEd,KAAK,MAAQ,KACTM,GAASA,EAAM,OAAQ,CACvB,KAAK,MAAQ,OAAO,OAAO,IAAI,EAC/B,OAAS,CAACiG,EAAMT,CAAK,IAAKxF,EACtB,KAAK,MAAM,OAAOiG,GAAQ,SAAWA,EAAOA,EAAK,EAAE,EAAIT,CAC/D,CACJ,CAEA,UAAW,CACP,IAAIgB,EAAU,KAAK,KAAK1G,GAAS,OAAO,EACxC,GAAI0G,GAAW,CAACA,EAAQ,QACpB,OAAOA,EAAQ,KAAK,SAAS,EACjC,IAAIrI,EAAW,GACf,QAASrD,KAAM,KAAK,SAAU,CAC1B,IAAI6K,EAAM7K,EAAG,SAAS,EAClB6K,IACIxH,IACAA,GAAY,KAChBA,GAAYwH,EAEpB,CACA,OAAQ,KAAK,KAAK,MACb,KAAK,KAAK,KAAK,KAAK,IAAI,GAAK,CAAC,KAAK,KAAK,QAAU,KAAK,UAAU,KAAK,KAAK,IAAI,EAAI,KAAK,KAAK,OACzFxH,EAAS,OAAS,IAAMA,EAAW,IAAM,IAFzBA,CAG7B,CAIA,OAAO/B,EAAO,EAAG,CACb,OAAO,IAAI+H,GAAW,KAAK,QAAS/H,CAAI,CAC5C,CAIA,SAASZ,EAAKD,EAAO,EAAGa,EAAO,EAAG,CAC9B,IAAIqK,EAAQ1C,GAAW,IAAI,IAAI,GAAK,KAAK,QACrCpG,EAAS,IAAIwG,GAAWsC,CAAK,EACjC,OAAA9I,EAAO,OAAOnC,EAAKD,CAAI,EACvBwI,GAAW,IAAI,KAAMpG,EAAO,KAAK,EAC1BA,CACX,CAGA,IAAI,SAAU,CACV,OAAO,IAAIxB,GAAS,KAAM,EAAG,EAAG,IAAI,CACxC,CAUA,QAAQX,EAAKD,EAAO,EAAG,CACnB,IAAIK,EAAOG,GAAYgI,GAAW,IAAI,IAAI,GAAK,KAAK,QAASvI,EAAKD,EAAM,EAAK,EAC7E,OAAAwI,GAAW,IAAI,KAAMnI,CAAI,EAClBA,CACX,CAMA,aAAaJ,EAAKD,EAAO,EAAG,CACxB,IAAIK,EAAOG,GAAYiI,GAAgB,IAAI,IAAI,GAAK,KAAK,QAASxI,EAAKD,EAAM,EAAI,EACjF,OAAAyI,GAAgB,IAAI,KAAMpI,CAAI,EACvBA,CACX,CAMA,QAAQmK,EAAM,CACV,GAAI,CAAE,MAAAW,EAAO,MAAAC,EAAO,KAAAlL,EAAO,EAAG,GAAAC,EAAK,KAAK,MAAO,EAAIqK,EAC/C3J,EAAO2J,EAAK,MAAQ,EAAGa,GAAQxK,EAAOC,GAAS,kBAAoB,EACvE,QAASwK,EAAI,KAAK,OAAOzK,EAAOC,GAAS,gBAAgB,IAAK,CAC1D,IAAIyK,EAAU,GACd,GAAID,EAAE,MAAQnL,GAAMmL,EAAE,IAAMpL,IAAS,CAACmL,GAAQC,EAAE,KAAK,aAAeH,EAAMG,CAAC,IAAM,IAAQ,CACrF,GAAIA,EAAE,WAAW,EACb,SACJC,EAAU,EACd,CACA,KACQA,GAAWH,IAAUC,GAAQ,CAACC,EAAE,KAAK,cACrCF,EAAME,CAAC,EACP,CAAAA,EAAE,YAAY,GAHb,CAKL,GAAI,CAACA,EAAE,OAAO,EACV,OACJC,EAAU,EACd,CACJ,CACJ,CAGA,KAAKb,EAAM,CACP,OAAQA,EAAK,QAAiC,KAAK,MAAQ,KAAK,MAAMA,EAAK,EAAE,EAAI,OAA1D,KAAK,KAAK,KAAKA,CAAI,CAC9C,CAIA,IAAI,YAAa,CACb,IAAIrJ,EAAS,CAAC,EACd,GAAI,KAAK,MACL,QAAS0B,KAAM,KAAK,MAChB1B,EAAO,KAAK,CAAC,CAAC0B,EAAI,KAAK,MAAMA,CAAE,CAAC,CAAC,EACzC,OAAO1B,CACX,CAIA,QAAQ6I,EAAS,CAAC,EAAG,CACjB,OAAO,KAAK,SAAS,QAAU,EAA+B,KAC1DjG,GAAasE,GAAS,KAAM,KAAK,SAAU,KAAK,UAAW,EAAG,KAAK,SAAS,OAAQ,EAAG,KAAK,OAAQ,CAAC3F,EAAUC,EAAWsB,IAAW,IAAI6G,GAAK,KAAK,KAAMpI,EAAUC,EAAWsB,EAAQ,KAAK,UAAU,EAAG+F,EAAO,WAAa,CAACtH,EAAUC,EAAWsB,IAAW,IAAI6G,GAAKzC,GAAS,KAAM3F,EAAUC,EAAWsB,CAAM,EAAE,CAC1T,CAGA,OAAO,MAAMtC,EAAM,CAAE,OAAOD,GAAUC,CAAI,CAAG,CACjD,EAEAyC,GAAK,MAAQ,IAAIA,GAAKiE,GAAS,KAAM,CAAC,EAAG,CAAC,EAAG,CAAC,EACxClG,GAAN,MAAMmJ,EAAiB,CACnB,YAAY1J,EAAQyB,EAAO,CACvB,KAAK,OAASzB,EACd,KAAK,MAAQyB,CACjB,CACA,IAAI,IAAK,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CAC/C,IAAI,OAAQ,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CAClD,IAAI,KAAM,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CAChD,IAAI,MAAO,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CACjD,IAAI,KAAM,CAAE,OAAO,KAAK,KAAO,CAC/B,MAAO,CAAE,KAAK,OAAS,CAAG,CAC1B,MAAO,CAAE,OAAO,IAAIiI,GAAiB,KAAK,OAAQ,KAAK,KAAK,CAAG,CACnE,EAKM7J,GAAN,MAAM8J,EAAW,CAEb,YAEA3J,EAEAqC,EAEAuH,EAAK,CACD,KAAK,OAAS5J,EACd,KAAK,OAASqC,EACd,KAAK,IAAMuH,CACf,CAEA,IAAI,MAAO,CAAE,OAAOnD,GAAS,IAAM,CAEnC,UAAW,CACP,IAAIlH,EAAS,CAAC,EACd,QAASkC,EAAQ,EAAGA,EAAQ,KAAK,OAAO,QACpClC,EAAO,KAAK,KAAK,YAAYkC,CAAK,CAAC,EACnCA,EAAQ,KAAK,OAAOA,EAAQ,CAAC,EAEjC,OAAOlC,EAAO,KAAK,GAAG,CAC1B,CAEA,YAAYkC,EAAO,CACf,IAAIR,EAAK,KAAK,OAAOQ,CAAK,EAAGoI,EAAW,KAAK,OAAOpI,EAAQ,CAAC,EACzDtC,EAAO,KAAK,IAAI,MAAM8B,CAAE,EAAG1B,EAASJ,EAAK,KAI7C,GAHI,KAAK,KAAKI,CAAM,GAAK,CAACJ,EAAK,UAC3BI,EAAS,KAAK,UAAUA,CAAM,GAClCkC,GAAS,EACLoI,GAAYpI,EACZ,OAAOlC,EACX,IAAIuB,EAAW,CAAC,EAChB,KAAOW,EAAQoI,GACX/I,EAAS,KAAK,KAAK,YAAYW,CAAK,CAAC,EACrCA,EAAQ,KAAK,OAAOA,EAAQ,CAAC,EAEjC,OAAOlC,EAAS,IAAMuB,EAAS,KAAK,GAAG,EAAI,GAC/C,CAEA,UAAUuC,EAAYwG,EAAUC,EAAK3L,EAAKD,EAAM,CAC5C,GAAI,CAAE,OAAA8B,CAAO,EAAI,KAAM+J,EAAO,GAC9B,QAAShM,EAAIsF,EAAYtF,GAAK8L,GACtB,EAAA5L,GAAUC,EAAMC,EAAK6B,EAAOjC,EAAI,CAAC,EAAGiC,EAAOjC,EAAI,CAAC,CAAC,IACjDgM,EAAOhM,EACH+L,EAAM,IAHsB/L,EAAIiC,EAAOjC,EAAI,CAAC,EACpD,CAMJ,OAAOgM,CACX,CAEA,MAAMC,EAAQC,EAAM7L,EAAM,CACtB,IAAI8L,EAAI,KAAK,OACTC,EAAO,IAAI,YAAYF,EAAOD,CAAM,EAAGI,EAAM,EACjD,QAASrM,EAAIiM,EAAQK,EAAI,EAAGtM,EAAIkM,GAAO,CACnCE,EAAKE,GAAG,EAAIH,EAAEnM,GAAG,EACjBoM,EAAKE,GAAG,EAAIH,EAAEnM,GAAG,EAAIK,EACrB,IAAIC,EAAK8L,EAAKE,GAAG,EAAIH,EAAEnM,GAAG,EAAIK,EAC9B+L,EAAKE,GAAG,EAAIH,EAAEnM,GAAG,EAAIiM,EACrBI,EAAM,KAAK,IAAIA,EAAK/L,CAAE,CAC1B,CACA,OAAO,IAAIsL,GAAWQ,EAAMC,EAAK,KAAK,GAAG,CAC7C,CACJ,EAoDMtL,GAAN,MAAMwL,EAAS,CACX,YAAYC,EAAOnM,EAEnBqD,EAAO+I,EAAS,CACZ,KAAK,MAAQD,EACb,KAAK,KAAOnM,EACZ,KAAK,MAAQqD,EACb,KAAK,QAAU+I,CACnB,CACA,IAAI,MAAO,CAAE,OAAO,KAAK,MAAM,IAAM,CACrC,IAAI,MAAO,CAAE,OAAO,KAAK,MAAM,KAAK,IAAM,CAC1C,IAAI,IAAK,CAAE,OAAO,KAAK,KAAO,KAAK,MAAM,MAAQ,CACjD,UAAUzM,EAAG+L,EAAK3L,EAAKD,EAAMa,EAAO,EAAG,CACnC,QAASF,EAAS,OAAQ,CACtB,OAAS,CAAE,SAAAiC,EAAU,UAAAC,CAAU,EAAIlC,EAAO,MAAO4L,EAAIX,EAAM,EAAIhJ,EAAS,OAAS,GAAI/C,GAAK0M,EAAG1M,GAAK+L,EAAK,CACnG,IAAIY,EAAO5J,EAAS/C,CAAC,EAAGmD,EAAQH,EAAUhD,CAAC,EAAIc,EAAO,KACtD,GAAKZ,GAAUC,EAAMC,EAAK+C,EAAOA,EAAQwJ,EAAK,MAAM,GAEpD,GAAIA,aAAgB7K,GAAY,CAC5B,GAAId,EAAOC,GAAS,eAChB,SACJ,IAAIyC,EAAQiJ,EAAK,UAAU,EAAGA,EAAK,OAAO,OAAQZ,EAAK3L,EAAM+C,EAAOhD,CAAI,EACxE,GAAIuD,EAAQ,GACR,OAAO,IAAIoF,GAAW,IAAID,GAAc/H,EAAQ6L,EAAM3M,EAAGmD,CAAK,EAAG,KAAMO,CAAK,CACpF,SACU1C,EAAOC,GAAS,kBAAsB,CAAC0L,EAAK,KAAK,aAAe/K,GAAS+K,CAAI,EAAI,CACvF,IAAIvB,EACJ,GAAI,EAAEpK,EAAOC,GAAS,eAClB0L,EAAK,QAAUvB,EAAUuB,EAAK,KAAKjI,GAAS,OAAO,IAAM,CAAC0G,EAAQ,QAClE,OAAO,IAAImB,GAASnB,EAAQ,KAAMjI,EAAOnD,EAAGc,CAAM,EACtD,IAAII,EAAQ,IAAIqL,GAASI,EAAMxJ,EAAOnD,EAAGc,CAAM,EAC/C,OAAQE,EAAOC,GAAS,kBAAqB,CAACC,EAAM,KAAK,YAAcA,EACjEA,EAAM,UAAU6K,EAAM,EAAIY,EAAK,SAAS,OAAS,EAAI,EAAGZ,EAAK3L,EAAKD,CAAI,CAChF,EACJ,CAQA,GAPKa,EAAOC,GAAS,kBAAqB,CAACH,EAAO,KAAK,cAEnDA,EAAO,OAAS,EAChBd,EAAIc,EAAO,MAAQiL,EAEnB/L,EAAI+L,EAAM,EAAI,GAAKjL,EAAO,QAAQ,MAAM,SAAS,OACrDA,EAASA,EAAO,QACZ,CAACA,GACD,OAAO,IACf,CACJ,CACA,IAAI,YAAa,CAAE,OAAO,KAAK,UAAU,EAAG,EAAG,EAAG,CAAqB,CAAG,CAC1E,IAAI,WAAY,CAAE,OAAO,KAAK,UAAU,KAAK,MAAM,SAAS,OAAS,EAAG,GAAI,EAAG,CAAqB,CAAG,CACvG,WAAWV,EAAK,CAAE,OAAO,KAAK,UAAU,EAAG,EAAGA,EAAK,CAAkB,CAAG,CACxE,YAAYA,EAAK,CAAE,OAAO,KAAK,UAAU,KAAK,MAAM,SAAS,OAAS,EAAG,GAAIA,EAAK,EAAoB,CAAG,CACzG,MAAMA,EAAKD,EAAMa,EAAO,EAAG,CACvB,IAAIoK,EACJ,GAAI,EAAEpK,EAAOC,GAAS,kBAAoBmK,EAAU,KAAK,MAAM,KAAK1G,GAAS,OAAO,IAAM0G,EAAQ,QAAS,CACvG,IAAIwB,EAAOxM,EAAM,KAAK,KACtB,OAAS,CAAE,KAAAC,EAAM,GAAAC,CAAG,IAAK8K,EAAQ,QAC7B,IAAKjL,EAAO,EAAIE,GAAQuM,EAAOvM,EAAOuM,KACjCzM,EAAO,EAAIG,GAAMsM,EAAOtM,EAAKsM,GAC9B,OAAO,IAAIL,GAASnB,EAAQ,KAAMA,EAAQ,QAAQ,CAAC,EAAE,KAAO,KAAK,KAAM,GAAI,IAAI,CAE3F,CACA,OAAO,KAAK,UAAU,EAAG,EAAGhL,EAAKD,EAAMa,CAAI,CAC/C,CACA,uBAAwB,CACpB,IAAI6L,EAAM,KACV,KAAOA,EAAI,KAAK,aAAeA,EAAI,SAC/BA,EAAMA,EAAI,QACd,OAAOA,CACX,CACA,IAAI,QAAS,CACT,OAAO,KAAK,QAAU,KAAK,QAAQ,sBAAsB,EAAI,IACjE,CACA,IAAI,aAAc,CACd,OAAO,KAAK,SAAW,KAAK,OAAS,EAAI,KAAK,QAAQ,UAAU,KAAK,MAAQ,EAAG,EAAG,EAAG,CAAqB,EAAI,IACnH,CACA,IAAI,aAAc,CACd,OAAO,KAAK,SAAW,KAAK,OAAS,EAAI,KAAK,QAAQ,UAAU,KAAK,MAAQ,EAAG,GAAI,EAAG,CAAqB,EAAI,IACpH,CACA,OAAO7L,EAAO,EAAG,CAAE,OAAO,IAAI+H,GAAW,KAAM/H,CAAI,CAAG,CACtD,IAAI,MAAO,CAAE,OAAO,KAAK,KAAO,CAChC,QAAS,CAAE,OAAO,KAAK,KAAO,CAC9B,QAAQZ,EAAKD,EAAO,EAAG,CACnB,OAAOQ,GAAY,KAAMP,EAAKD,EAAM,EAAK,CAC7C,CACA,aAAaC,EAAKD,EAAO,EAAG,CACxB,OAAOQ,GAAY,KAAMP,EAAKD,EAAM,EAAI,CAC5C,CACA,2BAA2BC,EAAK,CAAE,OAAOG,GAA2B,KAAMH,CAAG,CAAG,CAChF,SAASgB,EAAMC,EAAS,KAAMC,EAAQ,KAAM,CACxC,IAAIwL,EAAI3L,GAAY,KAAMC,EAAMC,EAAQC,CAAK,EAC7C,OAAOwL,EAAE,OAASA,EAAE,CAAC,EAAI,IAC7B,CACA,YAAY1L,EAAMC,EAAS,KAAMC,EAAQ,KAAM,CAC3C,OAAOH,GAAY,KAAMC,EAAMC,EAAQC,CAAK,CAChD,CAEA,UAAW,CAAE,OAAO,KAAK,MAAM,SAAS,CAAG,CAC3C,IAAI,MAAO,CAAE,OAAO,IAAM,CAC1B,aAAaI,EAAS,CAAE,OAAOD,GAAiB,KAAMC,CAAO,CAAG,CACpE,EA8BMmH,GAAN,KAAoB,CAChB,YAAY/H,EAAQmB,EAAQyB,EAAOP,EAAO,CACtC,KAAK,OAASrC,EACd,KAAK,OAASmB,EACd,KAAK,MAAQyB,EACb,KAAK,MAAQP,CACjB,CACJ,EACM2F,GAAN,MAAMiE,EAAW,CACb,IAAI,MAAO,CAAE,OAAO,KAAK,KAAK,IAAM,CACpC,IAAI,MAAO,CAAE,OAAO,KAAK,QAAQ,MAAQ,KAAK,QAAQ,OAAO,OAAO,KAAK,MAAQ,CAAC,CAAG,CACrF,IAAI,IAAK,CAAE,OAAO,KAAK,QAAQ,MAAQ,KAAK,QAAQ,OAAO,OAAO,KAAK,MAAQ,CAAC,CAAG,CACnF,YAAYrL,EAAS+K,EAAS/I,EAAO,CACjC,KAAK,QAAUhC,EACf,KAAK,QAAU+K,EACf,KAAK,MAAQ/I,EACb,KAAK,KAAOhC,EAAQ,OAAO,IAAI,MAAMA,EAAQ,OAAO,OAAOgC,CAAK,CAAC,CACrE,CACA,MAAMqI,EAAK3L,EAAKD,EAAM,CAClB,GAAI,CAAE,OAAA8B,CAAO,EAAI,KAAK,QAClByB,EAAQzB,EAAO,UAAU,KAAK,MAAQ,EAAGA,EAAO,OAAO,KAAK,MAAQ,CAAC,EAAG8J,EAAK3L,EAAM,KAAK,QAAQ,MAAOD,CAAI,EAC/G,OAAOuD,EAAQ,EAAI,KAAO,IAAIqJ,GAAW,KAAK,QAAS,KAAMrJ,CAAK,CACtE,CACA,IAAI,YAAa,CAAE,OAAO,KAAK,MAAM,EAAG,EAAG,CAAqB,CAAG,CACnE,IAAI,WAAY,CAAE,OAAO,KAAK,MAAM,GAAI,EAAG,CAAqB,CAAG,CACnE,WAAWtD,EAAK,CAAE,OAAO,KAAK,MAAM,EAAGA,EAAK,CAAkB,CAAG,CACjE,YAAYA,EAAK,CAAE,OAAO,KAAK,MAAM,GAAIA,EAAK,EAAoB,CAAG,CACrE,MAAMA,EAAKD,EAAMa,EAAO,EAAG,CACvB,GAAIA,EAAOC,GAAS,eAChB,OAAO,KACX,GAAI,CAAE,OAAAgB,CAAO,EAAI,KAAK,QAClByB,EAAQzB,EAAO,UAAU,KAAK,MAAQ,EAAGA,EAAO,OAAO,KAAK,MAAQ,CAAC,EAAG9B,EAAO,EAAI,EAAI,GAAIC,EAAM,KAAK,QAAQ,MAAOD,CAAI,EAC7H,OAAOuD,EAAQ,EAAI,KAAO,IAAIqJ,GAAW,KAAK,QAAS,KAAMrJ,CAAK,CACtE,CACA,IAAI,QAAS,CACT,OAAO,KAAK,SAAW,KAAK,QAAQ,OAAO,sBAAsB,CACrE,CACA,gBAAgBqI,EAAK,CACjB,OAAO,KAAK,QAAU,KAAO,KAAK,QAAQ,OAAO,UAAU,KAAK,QAAQ,MAAQA,EAAKA,EAAK,EAAG,CAAqB,CACtH,CACA,IAAI,aAAc,CACd,GAAI,CAAE,OAAA9J,CAAO,EAAI,KAAK,QAClBX,EAAQW,EAAO,OAAO,KAAK,MAAQ,CAAC,EACxC,OAAIX,GAAS,KAAK,QAAUW,EAAO,OAAO,KAAK,QAAQ,MAAQ,CAAC,EAAIA,EAAO,OAAO,QACvE,IAAI8K,GAAW,KAAK,QAAS,KAAK,QAASzL,CAAK,EACpD,KAAK,gBAAgB,CAAC,CACjC,CACA,IAAI,aAAc,CACd,GAAI,CAAE,OAAAW,CAAO,EAAI,KAAK,QAClBY,EAAc,KAAK,QAAU,KAAK,QAAQ,MAAQ,EAAI,EAC1D,OAAI,KAAK,OAASA,EACP,KAAK,gBAAgB,EAAE,EAC3B,IAAIkK,GAAW,KAAK,QAAS,KAAK,QAAS9K,EAAO,UAAUY,EAAa,KAAK,MAAO,GAAI,EAAG,CAAqB,CAAC,CAC7H,CACA,OAAO7B,EAAO,EAAG,CAAE,OAAO,IAAI+H,GAAW,KAAM/H,CAAI,CAAG,CACtD,IAAI,MAAO,CAAE,OAAO,IAAM,CAC1B,QAAS,CACL,IAAI+B,EAAW,CAAC,EAAGC,EAAY,CAAC,EAC5B,CAAE,OAAAf,CAAO,EAAI,KAAK,QAClBgK,EAAS,KAAK,MAAQ,EAAGC,EAAOjK,EAAO,OAAO,KAAK,MAAQ,CAAC,EAChE,GAAIiK,EAAOD,EAAQ,CACf,IAAI5L,EAAO4B,EAAO,OAAO,KAAK,MAAQ,CAAC,EACvCc,EAAS,KAAKd,EAAO,MAAMgK,EAAQC,EAAM7L,CAAI,CAAC,EAC9C2C,EAAU,KAAK,CAAC,CACpB,CACA,OAAO,IAAIyB,GAAK,KAAK,KAAM1B,EAAUC,EAAW,KAAK,GAAK,KAAK,IAAI,CACvE,CACA,QAAQ5C,EAAKD,EAAO,EAAG,CACnB,OAAOQ,GAAY,KAAMP,EAAKD,EAAM,EAAK,CAC7C,CACA,aAAaC,EAAKD,EAAO,EAAG,CACxB,OAAOQ,GAAY,KAAMP,EAAKD,EAAM,EAAI,CAC5C,CACA,2BAA2BC,EAAK,CAAE,OAAOG,GAA2B,KAAMH,CAAG,CAAG,CAEhF,UAAW,CAAE,OAAO,KAAK,QAAQ,OAAO,YAAY,KAAK,KAAK,CAAG,CACjE,SAASgB,EAAMC,EAAS,KAAMC,EAAQ,KAAM,CACxC,IAAIwL,EAAI3L,GAAY,KAAMC,EAAMC,EAAQC,CAAK,EAC7C,OAAOwL,EAAE,OAASA,EAAE,CAAC,EAAI,IAC7B,CACA,YAAY1L,EAAMC,EAAS,KAAMC,EAAQ,KAAM,CAC3C,OAAOH,GAAY,KAAMC,EAAMC,EAAQC,CAAK,CAChD,CACA,IAAI,MAAO,CAAE,OAAO,IAAM,CAC1B,aAAaI,EAAS,CAAE,OAAOD,GAAiB,KAAMC,CAAO,CAAG,CACpE,EAGMqH,GAAN,KAAiB,CAEb,IAAI,MAAO,CAAE,OAAO,KAAK,KAAK,IAAM,CAEpC,YAAYvI,EAEZQ,EAAO,EAAG,CAQN,GAPA,KAAK,KAAOA,EAEZ,KAAK,OAAS,KACd,KAAK,MAAQ,CAAC,EAEd,KAAK,MAAQ,EACb,KAAK,WAAa,KACdR,aAAgBO,GAChB,KAAK,UAAUP,CAAI,MAElB,CACD,KAAK,MAAQA,EAAK,QAAQ,OAC1B,KAAK,OAASA,EAAK,QACnB,QAASwM,EAAIxM,EAAK,QAASwM,EAAGA,EAAIA,EAAE,QAChC,KAAK,MAAM,QAAQA,EAAE,KAAK,EAC9B,KAAK,WAAaxM,EAClB,KAAK,SAASA,EAAK,KAAK,CAC5B,CACJ,CACA,UAAUA,EAAM,CACZ,OAAKA,GAEL,KAAK,MAAQA,EACb,KAAK,KAAOA,EAAK,KACjB,KAAK,KAAOA,EAAK,KACjB,KAAK,GAAKA,EAAK,GACR,IALI,EAMf,CACA,SAASkD,EAAOtC,EAAM,CAClB,KAAK,MAAQsC,EACb,GAAI,CAAE,MAAAP,EAAO,OAAAlB,CAAO,EAAI,KAAK,OAC7B,YAAK,KAAOb,GAAQa,EAAO,IAAI,MAAMA,EAAO,OAAOyB,CAAK,CAAC,EACzD,KAAK,KAAOP,EAAQlB,EAAO,OAAOyB,EAAQ,CAAC,EAC3C,KAAK,GAAKP,EAAQlB,EAAO,OAAOyB,EAAQ,CAAC,EAClC,EACX,CACA,MAAMlD,EAAM,CACR,OAAKA,EAEDA,aAAgBO,IAChB,KAAK,OAAS,KACP,KAAK,UAAUP,CAAI,IAE9B,KAAK,OAASA,EAAK,QACZ,KAAK,SAASA,EAAK,MAAOA,EAAK,IAAI,GAN/B,EAOf,CAEA,UAAW,CACP,OAAO,KAAK,OAAS,KAAK,OAAO,OAAO,YAAY,KAAK,KAAK,EAAI,KAAK,MAAM,SAAS,CAC1F,CAEA,WAAWuL,EAAK3L,EAAKD,EAAM,CACvB,GAAI,CAAC,KAAK,OACN,OAAO,KAAK,MAAM,KAAK,MAAM,UAAU4L,EAAM,EAAI,KAAK,MAAM,MAAM,SAAS,OAAS,EAAI,EAAGA,EAAK3L,EAAKD,EAAM,KAAK,IAAI,CAAC,EACzH,GAAI,CAAE,OAAA8B,CAAO,EAAI,KAAK,OAClByB,EAAQzB,EAAO,UAAU,KAAK,MAAQ,EAAGA,EAAO,OAAO,KAAK,MAAQ,CAAC,EAAG8J,EAAK3L,EAAM,KAAK,OAAO,MAAOD,CAAI,EAC9G,OAAIuD,EAAQ,EACD,IACX,KAAK,MAAM,KAAK,KAAK,KAAK,EACnB,KAAK,SAASA,CAAK,EAC9B,CAGA,YAAa,CAAE,OAAO,KAAK,WAAW,EAAG,EAAG,CAAqB,CAAG,CAEpE,WAAY,CAAE,OAAO,KAAK,WAAW,GAAI,EAAG,CAAqB,CAAG,CAEpE,WAAWtD,EAAK,CAAE,OAAO,KAAK,WAAW,EAAGA,EAAK,CAAkB,CAAG,CAEtE,YAAYA,EAAK,CAAE,OAAO,KAAK,WAAW,GAAIA,EAAK,EAAoB,CAAG,CAM1E,MAAMA,EAAKD,EAAMa,EAAO,KAAK,KAAM,CAC/B,OAAK,KAAK,OAEHA,EAAOC,GAAS,eAAiB,GAAQ,KAAK,WAAW,EAAGb,EAAKD,CAAI,EADjE,KAAK,MAAM,KAAK,MAAM,MAAMC,EAAKD,EAAMa,CAAI,CAAC,CAE3D,CAEA,QAAS,CACL,GAAI,CAAC,KAAK,OACN,OAAO,KAAK,UAAW,KAAK,KAAOC,GAAS,iBAAoB,KAAK,MAAM,QAAU,KAAK,MAAM,MAAM,EAC1G,GAAI,KAAK,MAAM,OACX,OAAO,KAAK,SAAS,KAAK,MAAM,IAAI,CAAC,EACzC,IAAIH,EAAU,KAAK,KAAOG,GAAS,iBAAoB,KAAK,OAAO,OAAS,KAAK,OAAO,OAAO,sBAAsB,EACrH,YAAK,OAAS,KACP,KAAK,UAAUH,CAAM,CAChC,CAEA,QAAQiL,EAAK,CACT,GAAI,CAAC,KAAK,OACN,OAAQ,KAAK,MAAM,QACb,KAAK,MAAM,KAAK,MAAM,MAAQ,EAAI,KAC9B,KAAK,MAAM,QAAQ,UAAU,KAAK,MAAM,MAAQA,EAAKA,EAAK,EAAG,EAAuB,KAAK,IAAI,CAAC,EAF3E,GAGjC,GAAI,CAAE,OAAA9J,CAAO,EAAI,KAAK,OAAQgL,EAAI,KAAK,MAAM,OAAS,EACtD,GAAIlB,EAAM,EAAG,CACT,IAAIlJ,EAAcoK,EAAI,EAAI,EAAI,KAAK,MAAMA,CAAC,EAAI,EAC9C,GAAI,KAAK,OAASpK,EACd,OAAO,KAAK,SAASZ,EAAO,UAAUY,EAAa,KAAK,MAAO,GAAI,EAAG,CAAqB,CAAC,CACpG,KACK,CACD,IAAIvB,EAAQW,EAAO,OAAO,KAAK,MAAQ,CAAC,EACxC,GAAIX,GAAS2L,EAAI,EAAIhL,EAAO,OAAO,OAASA,EAAO,OAAO,KAAK,MAAMgL,CAAC,EAAI,CAAC,GACvE,OAAO,KAAK,SAAS3L,CAAK,CAClC,CACA,OAAO2L,EAAI,EAAI,KAAK,MAAM,KAAK,OAAO,OAAO,UAAU,KAAK,OAAO,MAAQlB,EAAKA,EAAK,EAAG,EAAuB,KAAK,IAAI,CAAC,EAAI,EACjI,CAEA,aAAc,CAAE,OAAO,KAAK,QAAQ,CAAC,CAAG,CAExC,aAAc,CAAE,OAAO,KAAK,QAAQ,EAAE,CAAG,CACzC,WAAWA,EAAK,CACZ,IAAIrI,EAAO5C,EAAQ,CAAE,OAAAmB,CAAO,EAAI,KAChC,GAAIA,EAAQ,CACR,GAAI8J,EAAM,GACN,GAAI,KAAK,MAAQ9J,EAAO,OAAO,OAAO,OAClC,MAAO,OAGX,SAAS,EAAI,EAAG,EAAI,KAAK,MAAO,IAC5B,GAAIA,EAAO,OAAO,OAAO,EAAI,CAAC,EAAI,KAAK,MACnC,MAAO,IAElB,CAAE,MAAAyB,EAAO,OAAA5C,CAAO,EAAImB,EACzB,MAEK,CAAE,MAAAyB,EAAO,QAAS5C,CAAO,EAAI,KAAK,OAEvC,KAAOA,EAAQ,CAAE,MAAA4C,EAAO,QAAS5C,CAAO,EAAIA,EACxC,GAAI4C,EAAQ,GACR,QAAS,EAAIA,EAAQqI,EAAKW,EAAIX,EAAM,EAAI,GAAKjL,EAAO,MAAM,SAAS,OAAQ,GAAK4L,EAAG,GAAKX,EAAK,CACzF,IAAItG,EAAQ3E,EAAO,MAAM,SAAS,CAAC,EACnC,GAAK,KAAK,KAAOG,GAAS,kBACtBwE,aAAiB3D,IACjB,CAAC2D,EAAM,KAAK,aACZ7D,GAAS6D,CAAK,EACd,MAAO,EACf,CAER,MAAO,EACX,CACA,KAAKsG,EAAKT,EAAO,CACb,GAAIA,GAAS,KAAK,WAAWS,EAAK,EAAG,CAAqB,EACtD,MAAO,GACX,OAAS,CACL,GAAI,KAAK,QAAQA,CAAG,EAChB,MAAO,GACX,GAAI,KAAK,WAAWA,CAAG,GAAK,CAAC,KAAK,OAAO,EACrC,MAAO,EACf,CACJ,CAMA,KAAKT,EAAQ,GAAM,CAAE,OAAO,KAAK,KAAK,EAAGA,CAAK,CAAG,CAKjD,KAAKA,EAAQ,GAAM,CAAE,OAAO,KAAK,KAAK,GAAIA,CAAK,CAAG,CAIlD,OAAOlL,EAAKD,EAAO,EAAG,CAElB,MAAO,KAAK,MAAQ,KAAK,KACpBA,EAAO,EAAI,KAAK,MAAQC,EAAM,KAAK,KAAOA,KAC1CD,EAAO,GAAK,KAAK,IAAMC,EAAM,KAAK,GAAKA,KACnC,KAAK,OAAO,GAAjB,CAGJ,KAAO,KAAK,WAAW,EAAGA,EAAKD,CAAI,GAAG,CACtC,OAAO,IACX,CAGA,IAAI,MAAO,CACP,GAAI,CAAC,KAAK,OACN,OAAO,KAAK,MAChB,IAAI+I,EAAQ,KAAK,WAAY1H,EAAS,KAAMzB,EAAQ,EACpD,GAAImJ,GAASA,EAAM,SAAW,KAAK,OAC/BzI,EAAM,QAASiD,EAAQ,KAAK,MAAOuJ,EAAI,KAAK,MAAM,OAAQA,GAAK,GAAI,CAC/D,QAASxB,EAAIvC,EAAOuC,EAAGA,EAAIA,EAAE,QACzB,GAAIA,EAAE,OAAS/H,EAAO,CAClB,GAAIA,GAAS,KAAK,MACd,OAAO+H,EACXjK,EAASiK,EACT1L,EAAQkN,EAAI,EACZ,MAAMxM,CACV,CACJiD,EAAQ,KAAK,MAAM,EAAEuJ,CAAC,CAC1B,CAEJ,QAASjN,EAAID,EAAOC,EAAI,KAAK,MAAM,OAAQA,IACvCwB,EAAS,IAAIsH,GAAW,KAAK,OAAQtH,EAAQ,KAAK,MAAMxB,CAAC,CAAC,EAC9D,OAAO,KAAK,WAAa,IAAI8I,GAAW,KAAK,OAAQtH,EAAQ,KAAK,KAAK,CAC3E,CAIA,IAAI,MAAO,CACP,OAAO,KAAK,OAAS,KAAO,KAAK,MAAM,KAC3C,CAKA,QAAQ8J,EAAOC,EAAO,CAClB,QAASxL,EAAQ,IAAK,CAClB,IAAImN,EAAY,GAChB,GAAI,KAAK,KAAK,aAAe5B,EAAM,IAAI,IAAM,GAAO,CAChD,GAAI,KAAK,WAAW,EAAG,CACnBvL,IACA,QACJ,CACK,KAAK,KAAK,cACXmN,EAAY,GACpB,CACA,KACQA,GAAa3B,GACbA,EAAM,IAAI,EACd2B,EAAY,KAAK,KAAK,YAClB,MAAK,YAAY,GAJhB,CAML,GAAI,CAACnN,EACD,OACJ,KAAK,OAAO,EACZA,IACAmN,EAAY,EAChB,CACJ,CACJ,CAIA,aAAaxL,EAAS,CAClB,GAAI,CAAC,KAAK,OACN,OAAOD,GAAiB,KAAK,KAAMC,CAAO,EAC9C,GAAI,CAAE,OAAAO,CAAO,EAAI,KAAK,OAAQ,CAAE,MAAAQ,CAAM,EAAIR,EAAO,IACjD,QAASjC,EAAI0B,EAAQ,OAAS,EAAGuL,EAAI,KAAK,MAAM,OAAS,EAAGjN,GAAK,EAAGiN,IAAK,CACrE,GAAIA,EAAI,EACJ,OAAOxL,GAAiB,KAAK,KAAMC,EAAS1B,CAAC,EACjD,IAAIoB,EAAOqB,EAAMR,EAAO,OAAO,KAAK,MAAMgL,CAAC,CAAC,CAAC,EAC7C,GAAI,CAAC7L,EAAK,YAAa,CACnB,GAAIM,EAAQ1B,CAAC,GAAK0B,EAAQ1B,CAAC,GAAKoB,EAAK,KACjC,MAAO,GACXpB,GACJ,CACJ,CACA,MAAO,EACX,CACJ,EAgMMwF,GAAgB,IAAI,QAqEpBwD,GAAN,KAAkB,CACd,aAAc,CACV,KAAK,IAAM,IAAI,OACnB,CACA,UAAU/G,EAAQyB,EAAO0G,EAAO,CAC5B,IAAIlJ,EAAQ,KAAK,IAAI,IAAIe,CAAM,EAC1Bf,GACD,KAAK,IAAI,IAAIe,EAAQf,EAAQ,IAAI,GAAG,EACxCA,EAAM,IAAIwC,EAAO0G,CAAK,CAC1B,CACA,UAAUnI,EAAQyB,EAAO,CACrB,IAAIxC,EAAQ,KAAK,IAAI,IAAIe,CAAM,EAC/B,OAAOf,GAASA,EAAM,IAAIwC,CAAK,CACnC,CAEA,IAAIlD,EAAM4J,EAAO,CACT5J,aAAgBsI,GAChB,KAAK,UAAUtI,EAAK,QAAQ,OAAQA,EAAK,MAAO4J,CAAK,EAChD5J,aAAgBO,IACrB,KAAK,IAAI,IAAIP,EAAK,KAAM4J,CAAK,CACrC,CAEA,IAAI5J,EAAM,CACN,OAAOA,aAAgBsI,GAAa,KAAK,UAAUtI,EAAK,QAAQ,OAAQA,EAAK,KAAK,EAC5EA,aAAgBO,GAAW,KAAK,IAAI,IAAIP,EAAK,IAAI,EAAI,MAC/D,CAEA,UAAU+B,EAAQ6H,EAAO,CACjB7H,EAAO,OACP,KAAK,UAAUA,EAAO,OAAO,OAAQA,EAAO,MAAO6H,CAAK,EAExD,KAAK,IAAI,IAAI7H,EAAO,KAAM6H,CAAK,CACvC,CAGA,UAAU7H,EAAQ,CACd,OAAOA,EAAO,OAAS,KAAK,UAAUA,EAAO,OAAO,OAAQA,EAAO,KAAK,EAAI,KAAK,IAAI,IAAIA,EAAO,IAAI,CACxG,CACJ,EA2JM0G,GAAe,IAAIvE,GAAS,CAAE,QAAS,EAAK,CAAC,ECn6C7CwE,GAAQ,IAAIF,GAyBZG,GAOF,CACF,aAAc9C,GAAM,UAAU,EAuC9B,UAAW,IACb,EAgCM+C,GAAe,CAAC,SAAU,SAAS,EAQnCC,GAAkC,CAAC,EACtC,OACC,CAAC,OAAQ,QAAS,OAAQ,KAAM,MAAO,MAAO,KAAK,EAAE,IAAK,IAAO,CAC/D,MAAO,EACP,KAAM,UACR,EAAE,CACJ,EACC,OACC,CACE,cACA,eACA,UACA,gBACA,SACA,iBACA,qBACA,aACA,aACA,aACA,KACA,QACA,WACA,mBACA,mBACA,YACA,0BACA,qBACA,qBACA,KACA,cACA,kBACA,yBACA,kBACA,yBACA,kBACA,kBACA,iBACA,gBACA,cACA,oBACA,UACA,OACA,oBACA,mBACA,UACF,EAAE,IAAK,IAAO,CAAE,MAAO,EAAG,KAAM,OAAQ,EAAE,CAC5C,EACC,OACC,CAEE,UAEA,OAEA,OACA,MACA,QACA,SAEA,UACA,WACA,QACA,SACA,UACA,WACA,cACA,UACA,WACA,QACA,aACA,OACA,QACA,cACA,aAEA,QACA,aACA,WACA,MACA,SACA,WACA,SACA,aACA,QAEA,kBACA,mBACA,mBACA,qBACA,qBACA,oBACA,qBACA,qBACA,kBACF,EAAE,IAAK,IAAO,CACZ,MAAO,EACP,KAAM,OACR,EAAE,CACJ,EACC,OACC,CACE,MACA,OACA,OACA,OACA,OACA,OACA,QACA,oBACA,qBACA,eACA,4BACA,OACA,QACA,QACA,QACA,SACA,SACA,MACA,OACA,oBACA,0BACA,kCACA,4BACA,eACA,aACA,OACA,eACA,MACA,QACA,SACA,SACA,OACA,UACA,OACA,mBACA,eACA,kBACA,YACA,SACA,uBACA,oBACA,SACA,UACA,iBACA,OACA,aACA,QACA,eACA,MACA,MACA,OACA,OACA,MACA,OACA,OACA,cACA,cACA,WACA,SACA,MACA,QACA,aACA,gBACA,WACA,WACA,SACA,SACA,aACA,eACA,aACA,iBACA,QACA,cACA,SACA,QACA,cACA,YACA,QACA,kBACA,iBACA,QACA,SACA,SACA,OACA,OACA,QACA,QACA,MACA,OACA,aACA,UACA,WACA,WACA,OACA,gBACA,MACA,aACA,MACA,OACA,SACA,eACA,4BACA,aACA,UACA,OACA,QACA,OACF,EAAE,IAAK,IAAO,CAAE,MAAO,EAAG,KAAM,UAAW,EAAE,CAC/C,EACWC,GAAkC,CAAC,EAEnCzC,GAAmBsG,GAC9B/D,GACAgE,GAAiB/D,GAAQ,OAAOC,EAAQ,CAAC,CAC3C,EN3Sa1C,GAAmB,cAAW,OAAO,CAChD,KAAM,WACN,OAAQ2B,GAAO,UAAU,CACvB,MAAO,CACL,kBAAe,IAAI,CACjB,KAAO7G,GACE+E,GAAW/E,EAASA,EAAQ,IAAI,GAAKA,EAAQ,SAAS,EAE/D,OAASA,GACA,oBAAoB,KAAKA,EAAQ,SAAS,EAC7CA,EAAQ,WACRA,EAAQ,SAAS,EAEvB,UAAYA,GACH+E,GAAW/E,EAASA,EAAQ,IAAI,GAAKA,EAAQ,SAAS,EAE/D,OAAQ,IACC,KAET,OAASA,GAAY,CACnB,GAEEA,EAAQ,IAAM,MAAM,KAAKA,EAAQ,SAAS,EAAG,CAAC,EAAE,QAChDA,EAAQ,KAAK,GACb,CACA,IAAI2L,EAAU,KACd,QAAS9L,EAAyBG,EAAQ,KAAMpB,EAAKiB,EAAI,GACvDA,EAAMA,EAAI,UACN,EAAAA,GAAO,MAAQA,EAAI,KAAOjB,IAC1BiB,EAAI,KAAK,OAAS,SAAQ8L,EAAU9L,GAE1C,GAAI8L,GAAW,KAAM,CACnB,IAAMC,EAAa7G,GAAW/E,EAAS2L,CAAO,EAC9C,GAAIC,GAAc,KAAM,OAAOA,CACjC,CACF,CACA,OAAO5L,EAAQ,SAAS,CAC1B,CACF,CAAC,EACD,gBAAa,IAAI,CACf,+CAAgD,cAChD,KAAM,CAAClB,EAAM+M,KAAW,CACtB,KAAM/M,EAAK,KAAO,EAClB,GAAIA,EAAK,IAAMA,EAAK,KAAO+M,EAAM,IAAI,OAAS,EAAI,EACpD,EACF,CAAC,CACH,CACF,CAAC,EACD,aAAc,CACZ,cAAe,CACb,SAAU,CAAC,IAAK,IAAK,IAAK,IAAK,IAAK,MAAO,KAAK,CAClD,EACA,cAAe,CAAE,KAAM,GAAI,EAE3B,cAAe,6BACjB,CACF,CAAC,uFU5FM,SAASC,GACdC,EACAC,EACAC,EACkB,CAElB,IAAMC,KADO,eAAWH,CAAK,EACT,OAAO,EAErBI,EAAgBJ,EAAM,eAA8B,gBAAiB,CAAC,EAEtEK,EAAiC,CAAC,EACpCC,EAAmB,EAEvB,EAAG,CACD,GAAIH,EAAO,OAAS,UAClB,SAGF,IAAII,EAAa,EACbC,EAAW,EAETC,EAAOT,EAAM,SAASG,EAAO,KAAMA,EAAO,EAAE,EAC9CO,EAAU,GAEd,QAAWC,KAAgBP,EACzB,GAAIO,EAAa,MAAQ,KAAM,CAC7B,GAAI,CAACF,EAAK,WAAWE,EAAa,IAAI,EACpC,SAGFJ,EAAaI,EAAa,KAAK,MACjC,SAAWA,EAAa,OAAS,KAAM,CACrC,GACE,EACEF,EAAK,WAAWE,EAAa,MAAM,IAAI,GACvCF,EAAK,SAASE,EAAa,MAAM,KAAK,GAGxC,SAEFJ,EAAaI,EAAa,MAAM,KAAK,OACrCH,EAAW,CAACG,EAAa,MAAM,MAAM,MACvC,CAGFD,EAAUD,EAAK,MAAMF,EAAYE,EAAK,OAASD,CAAQ,EAAE,KAAK,EAE1DE,IAAYT,EACdK,EAAmBH,EAAO,KACjBO,IAAYR,IACrBG,EAAa,KAAK,mBAAgB,MAAMC,EAAkBH,EAAO,EAAE,CAAC,EACpEG,EAAmB,EAEvB,OAASH,EAAO,KAAK,GAErB,OAAIG,EAAmB,GACrBD,EAAa,KACX,mBAAgB,MAAMC,EAAkBN,EAAM,IAAI,SAAS,EAAE,MAAM,CACrE,EAGKK,CACT,CAEO,SAASO,GACdC,EACa,CACb,IAAMC,EAAW,IAAI,IACrB,QAASC,EAAIF,EAAM,KAAME,GAAKF,EAAM,GAAIE,IACtCD,EAAS,IAAIC,CAAC,EAEhB,OAAOD,CACT,CAEO,SAASE,GACdC,EACAH,EACM,CACN,IAAMI,EAAkB,MAAM,KAC5BN,GAAiCK,CAAa,CAChD,EACA,QAAWE,KAAkBD,EAC3BJ,EAAS,OAAOK,CAAc,CAElC,CAEO,SAASC,GACdP,EACkB,CAClB,IAAMQ,EAAW,MAAM,KAAKR,CAAK,EAAE,KAAK,CAACS,EAAGC,IAAMD,EAAIC,CAAC,EACjDC,EAAMH,EAAS,OAAO,CAACI,EAAeC,EAAcC,IACpDA,IAAiB,EACZD,EAEF,KAAK,IAAID,EAAeC,CAAY,EAC1C,CAAC,EACEE,EAAMP,EAAS,OAAO,CAACI,EAAeC,EAAcC,IACpDA,IAAiB,EACZD,EAEF,KAAK,IAAID,EAAeC,CAAY,EAC1C,CAAC,EAEEG,EAAoC,CAAC,EACvCC,EAAwC,KAC5C,QAASf,EAAIS,EAAKT,EAAIa,EAAKb,IAAK,CAG9B,GAFgBM,EAAS,KAAMU,GAAYA,IAAYhB,CAAC,GAEzC,MAAQe,GAAkB,KAAM,CAC7CD,EAAgB,KAAKC,CAAc,EACnCA,EAAiB,KACjB,QACF,CAEIA,GAAkB,KACpBA,EAAiB,mBAAgB,MAAMf,EAAGA,CAAC,EAE3Ce,EAAiB,mBAAgB,MAAMA,EAAe,KAAMf,CAAC,CAEjE,CACA,OAAIe,GAAkB,OACpBD,EAAgB,KAAKC,CAAc,EACnCA,EAAiB,MAGZD,CACT,CDxHO,SAASG,IAEd,CACA,OAAO,eAAY,kBAAkB,GAAIC,GAAgB,CAEvD,GAAI,EAAEA,EAAY,WAAa,MAAQA,EAAY,YACjD,OAAOA,EAGT,IAAM5B,EAAeN,GACnBkC,EAAY,WACZA,EAAY,WAAW,MAAMhC,EAAkB,EAC/CgC,EAAY,WAAW,MAAM/B,EAAgB,CAC/C,EAEIgC,EAAgB,GAEpB,GAAID,EAAY,WAAY,CAC1BA,EAAY,QAAQ,YAAY,CAACE,EAAOC,EAAKC,EAAOC,EAAKC,IAAa,CACpE,IAAMC,EAAO,KAAK,IAAIJ,EAAMD,EAAOG,EAAMD,CAAK,EAC9C,QAAStB,EAAI,EAAGA,EAAIV,EAAa,OAAQU,IAAK,CAC5C,IAAIF,EAAQR,EAAaU,CAAC,EAEtByB,EAAO,GACLH,EAAQxB,EAAM,OAChBA,EAAQ4B,GAAAA,gBAAgB,MAAM5B,EAAM,KAAO2B,EAAM3B,EAAM,GAAK2B,CAAI,EAChEnC,EAAaU,CAAC,EAAIF,EAGxB,CACF,CAAC,EAED,QAAW6B,KAAerC,EAAc,CAKtC,OAJqB4B,EAAY,QAAQ,KAAK,aAC5CS,EAAY,KACZA,EAAY,EACd,EACsB,CACpB,IAAK,QACL,IAAK,GACHR,EAAgB,GAChB,MACF,IAAK,GACL,QAEF,CAEA,GAAIA,EACF,KAEJ,CACF,CAEA,IAAIS,EAA2B,CAAC,EAEhC,GAAIV,EAAY,WAAa,KAAM,CACjC,IAAIW,EAAYX,EAAY,aACxBC,IACFU,EAAYX,EAAY,WAAW,WAGrC,QAAWH,KAAkBc,EAAU,OAAQ,CAC7C,IAAMC,EACJjC,GAAiCkB,CAAc,EACjD,QAAWY,KAAerC,EACxBW,GAAmB0B,EAAaG,CAAiB,EAEnDF,EAAO,KAAK,GAAGvB,GAAkCyB,CAAiB,CAAC,CACrE,CAGA,IAAMC,EAAmBhB,GAChBA,EAAe,OAAS,EAGjC,GAD4BzB,EAAa,KAAKyC,CAAe,GAClC,KAAM,CAC/B,IAAMC,EAAgBJ,EAAO,KAAKG,CAAe,EAC7CC,GAAiB,OACnBJ,EAASA,EAAO,OAAQ9B,GAAUA,IAAUkC,CAAa,EAE7D,CACF,CAeA,MAb4B,CAC1B,GAAGd,EACH,GAAIU,EAAO,OAAS,EAChB,CAAE,UAAWF,GAAAA,gBAAgB,OAAOE,CAAM,CAAE,EAC5C,CAAC,EACL,GAAIT,EACA,CACE,QAAS,CAAC,EACV,UAAWD,EAAY,WAAW,SACpC,EACA,CAAC,CACP,CAGF,CAAC,CACH,CE/FA,SAASe,GAAiBC,EAAwC,CAChE,IAAMC,EAAU,IAAI,mBAEd7C,EAAeN,GACnBkD,EAAK,MACLA,EAAK,MAAM,MAAMhD,EAAkB,EACnCgD,EAAK,MAAM,MAAM/C,EAAgB,CACnC,EAEA,OAAW,CAAE,KAAAiD,EAAM,GAAAC,CAAG,IAAKH,EAAK,cAC9B,QAASI,EAAMF,EAAME,GAAOD,GAAM,CAChC,IAAME,EAAOL,EAAK,MAAM,IAAI,OAAOI,CAAG,EACtC,QAAWX,KAAerC,GAErBqC,EAAY,KAAOY,EAAK,MAAQA,EAAK,KAAOZ,EAAY,IACxDA,EAAY,KAAOY,EAAK,IAAMA,EAAK,GAAKZ,EAAY,KAErDQ,EAAQ,IAAII,EAAK,KAAMA,EAAK,KAAMC,EAAgB,EAGtDF,EAAMC,EAAK,GAAK,CAClB,CAGF,OAAOJ,EAAQ,OAAO,CACxB,CAiBO,SAASM,IAAoD,CAKlE,OAJe,cAAW,UAAUC,GAAkB,CACpD,YAAcC,GAAUA,EAAM,WAChC,CAAC,CAGH,CCvDO,SAASC,GACd1D,EAAqB,eACrBC,EAAmB,aACR,CACX,IAAM0D,EAAuBC,GAAoB,GAAG5D,CAAkB,EAChE6D,EAAqBC,GAAkB,GAAG7D,CAAgB,EAE1D8D,EAA0BhC,GAA2B,EACrDiC,EAAmBT,GAAoB,EAE7C,MAAO,CACLQ,EACAC,EACAL,EACAE,EACAI,EACF,CACF,KL3BAC,GCAAC,GCAAD,GCCAE,GACAF,GCFAA,GACAC,GJCanE,GASAC,GCTAgE,GGWPX,GA+BAE,GCrCAI,GACAE,2BLRNI,GAAsB,6BCAtBC,GAA2B,4BCA3BD,GAIO,6BCHPE,GAA2B,gCAC3BF,GAIO,6BCNPA,GAA+C,6BAC/CC,GAOO,4BJNMnE,GAAqB,SAAM,OAAuB,CAC7D,QAAUqE,GACJA,EAAO,OAAS,EACXA,EAAOA,EAAO,OAAS,CAAC,EAE1B,cAEX,CAAC,EAEYpE,GAAmB,SAAM,OAAuB,CAC3D,QAAUoE,GACJA,EAAO,OAAS,EACXA,EAAOA,EAAO,OAAS,CAAC,EAE1B,YAEX,CAAC,EChBYJ,GAAc,cAAW,MAAM,CAC1C,aAAc,CACZ,QAAS,IACT,UAAW,QACb,CACF,CAAC,EGMKX,GAAmB,cAAW,KAAK,CACvC,WAAY,CAAE,MAAO,WAAY,CACnC,CAAC,EA6BKE,GAAN,KAA8C,CAG5C,YAAYR,EAAkB,CAC5B,KAAK,YAAcD,GAAiBC,CAAI,CAC1C,CAEA,OAAOsB,EAA0B,EACzBA,EAAO,YAAcA,EAAO,mBAGlC,KAAK,YAAcvB,GAAiBuB,EAAO,IAAI,EACjD,CACF,EClDMV,GAAsB5D,GACtB8D,GAAoB7D,KCR1B,IAAAsE,GAAAC,GAAA,CAAAC,GAAAC,KAAA,uBAASC,GAAOC,EAAK,CACnB,IAAIC,EAAK,kBACLC,EAAO,MAAM,UAAU,MAAM,KAAK,UAAW,CAAC,EAClD,OAAGA,EAAK,SACNF,EAAMA,EAAI,QAAQC,EAAI,SAASE,EAAOC,EAASC,EAAKC,EAAM,CACxD,IAAIC,EAAML,EAAK,MAAM,EACrB,OAAOI,EAAM,CACX,IAAK,IACHC,EAAM,GAAKA,EACX,MACF,IAAK,IACHA,EAAM,OAAOA,CAAG,EAChB,MACF,IAAK,IACHA,EAAM,KAAK,UAAUA,CAAG,EACxB,KACJ,CACA,OAAIH,GAGJF,EAAK,QAAQK,CAAG,EACTJ,GAHEI,CAIX,CAAC,GAIAL,EAAK,SACNF,GAAO,IAAME,EAAK,KAAK,GAAG,GAI5BF,EAAMA,EAAI,QAAQ,UAAW,GAAG,EAEzB,GAAKA,CACd,CAEAF,GAAO,QAAUC,KCpCjB,IAAAS,GAAA,GAAAC,GAAAD,GAAA,0BAAAE,KAAA,eAAAC,GAAAH,ICAA,IAAAI,GAAyB,WCCzB,IAAAC,GAAwC,WCWxC,IAAAC,GAAyB,WCZlB,IAAMC,GAAN,cAA2B,KAAM,CACvC,YAAYC,EAAS,CACpB,MAAMA,CAAO,EACb,KAAK,KAAO,cACb,CACD,EAMaC,GAAN,cAAyB,KAAM,CACrC,YAAYD,EAAS,CACpB,MAAM,EACN,KAAK,KAAO,aACZ,KAAK,QAAUA,CAChB,CACD,EAKME,GAAkBC,GAAgB,WAAW,eAAiB,OACnE,IAAIF,GAAWE,CAAY,EAC3B,IAAI,aAAaA,CAAY,EAKxBC,GAAmBC,GAAU,CAClC,IAAMC,EAASD,EAAO,SAAW,OAChCH,GAAgB,6BAA6B,EAC7CG,EAAO,OAER,OAAOC,aAAkB,MAAQA,EAASJ,GAAgBI,CAAM,CACjE,EAEe,SAARC,GAA0BC,EAASC,EAAcC,EAAUC,EAAS,CAC1E,IAAIC,EAEEC,EAAoB,IAAI,QAAQ,CAACC,EAASC,IAAW,CAC1D,GAAI,OAAON,GAAiB,UAAY,KAAK,KAAKA,CAAY,IAAM,EACnE,MAAM,IAAI,UAAU,4DAA4DA,CAAY,IAAI,EAGjG,GAAIA,IAAiB,OAAO,kBAAmB,CAC9CK,EAAQN,CAAO,EACf,MACD,CAOA,GALAG,EAAU,CACT,aAAc,CAAC,WAAY,YAAY,EACvC,GAAGA,CACJ,EAEIA,EAAQ,OAAQ,CACnB,GAAM,CAAC,OAAAN,CAAM,EAAIM,EACbN,EAAO,SACVU,EAAOX,GAAiBC,CAAM,CAAC,EAGhCA,EAAO,iBAAiB,QAAS,IAAM,CACtCU,EAAOX,GAAiBC,CAAM,CAAC,CAChC,CAAC,CACF,CAEAO,EAAQD,EAAQ,aAAa,WAAW,KAAK,OAAW,IAAM,CAC7D,GAAI,OAAOD,GAAa,WAAY,CACnC,GAAI,CACHI,EAAQJ,EAAS,CAAC,CACnB,OAASM,EAAO,CACfD,EAAOC,CAAK,CACb,CAEA,MACD,CAEA,IAAMhB,EAAU,OAAOU,GAAa,SAAWA,EAAW,2BAA2BD,CAAY,gBAC3FQ,EAAeP,aAAoB,MAAQA,EAAW,IAAIX,GAAaC,CAAO,EAEhF,OAAOQ,EAAQ,QAAW,YAC7BA,EAAQ,OAAO,EAGhBO,EAAOE,CAAY,CACpB,EAAGR,CAAY,GAEd,SAAY,CACZ,GAAI,CACHK,EAAQ,MAAMN,CAAO,CACtB,OAASQ,EAAO,CACfD,EAAOC,CAAK,CACb,QAAE,CACDL,EAAQ,aAAa,aAAa,KAAK,OAAWC,CAAK,CACxD,CACD,GAAG,CACJ,CAAC,EAED,OAAAC,EAAkB,MAAQ,IAAM,CAC/B,aAAaD,CAAK,EAClBA,EAAQ,MACT,EAEOC,CACR,CCtGe,SAARK,GAA4BC,EAAOC,EAAOC,EAAY,CACzD,IAAIC,EAAQ,EACRC,EAAQJ,EAAM,OAClB,KAAOI,EAAQ,GAAG,CACd,IAAMC,EAAO,KAAK,MAAMD,EAAQ,CAAC,EAC7BE,EAAKH,EAAQE,EACbH,EAAWF,EAAMM,CAAE,EAAGL,CAAK,GAAK,GAChCE,EAAQ,EAAEG,EACVF,GAASC,EAAO,GAGhBD,EAAQC,CAEhB,CACA,OAAOF,CACX,CCjBA,IAAII,GAAkE,SAAUC,EAAUC,EAAOC,EAAMC,EAAG,CACtG,GAAID,IAAS,KAAO,CAACC,EAAG,MAAM,IAAI,UAAU,+CAA+C,EAC3F,GAAI,OAAOF,GAAU,WAAaD,IAAaC,GAAS,CAACE,EAAI,CAACF,EAAM,IAAID,CAAQ,EAAG,MAAM,IAAI,UAAU,0EAA0E,EACjL,OAAOE,IAAS,IAAMC,EAAID,IAAS,IAAMC,EAAE,KAAKH,CAAQ,EAAIG,EAAIA,EAAE,MAAQF,EAAM,IAAID,CAAQ,CAChG,EACII,GAEiBC,GAArB,KAAmC,CAC/B,aAAc,CACVD,GAAqB,IAAI,KAAM,CAAC,CAAC,CACrC,CACA,QAAQE,EAAKC,EAAS,CAClBA,EAAU,CACN,SAAU,EACV,GAAGA,CACP,EACA,IAAMC,EAAU,CACZ,SAAUD,EAAQ,SAClB,IAAAD,CACJ,EACA,GAAI,KAAK,MAAQP,GAAuB,KAAMK,GAAsB,GAAG,EAAE,KAAK,KAAO,CAAC,EAAE,UAAYG,EAAQ,SAAU,CAClHR,GAAuB,KAAMK,GAAsB,GAAG,EAAE,KAAKI,CAAO,EACpE,MACJ,CACA,IAAMC,EAAQC,GAAWX,GAAuB,KAAMK,GAAsB,GAAG,EAAGI,EAAS,CAACG,EAAGC,IAAMA,EAAE,SAAWD,EAAE,QAAQ,EAC5HZ,GAAuB,KAAMK,GAAsB,GAAG,EAAE,OAAOK,EAAO,EAAGD,CAAO,CACpF,CACA,SAAU,CACN,IAAMK,EAAOd,GAAuB,KAAMK,GAAsB,GAAG,EAAE,MAAM,EAC3E,OAAmDS,GAAK,GAC5D,CACA,OAAON,EAAS,CACZ,OAAOR,GAAuB,KAAMK,GAAsB,GAAG,EAAE,OAAQI,GAAYA,EAAQ,WAAaD,EAAQ,QAAQ,EAAE,IAAKC,GAAYA,EAAQ,GAAG,CAC1J,CACA,IAAI,MAAO,CACP,OAAOT,GAAuB,KAAMK,GAAsB,GAAG,EAAE,MACnE,CACJ,EACAA,GAAuB,IAAI,QHtC3B,IAAIU,GAAkE,SAAUC,EAAUC,EAAOC,EAAOC,EAAMC,EAAG,CAC7G,GAAID,IAAS,IAAK,MAAM,IAAI,UAAU,gCAAgC,EACtE,GAAIA,IAAS,KAAO,CAACC,EAAG,MAAM,IAAI,UAAU,+CAA+C,EAC3F,GAAI,OAAOH,GAAU,WAAaD,IAAaC,GAAS,CAACG,EAAI,CAACH,EAAM,IAAID,CAAQ,EAAG,MAAM,IAAI,UAAU,yEAAyE,EAChL,OAAQG,IAAS,IAAMC,EAAE,KAAKJ,EAAUE,CAAK,EAAIE,EAAIA,EAAE,MAAQF,EAAQD,EAAM,IAAID,EAAUE,CAAK,EAAIA,CACxG,EACIG,EAAkE,SAAUL,EAAUC,EAAOE,EAAMC,EAAG,CACtG,GAAID,IAAS,KAAO,CAACC,EAAG,MAAM,IAAI,UAAU,+CAA+C,EAC3F,GAAI,OAAOH,GAAU,WAAaD,IAAaC,GAAS,CAACG,EAAI,CAACH,EAAM,IAAID,CAAQ,EAAG,MAAM,IAAI,UAAU,0EAA0E,EACjL,OAAOG,IAAS,IAAMC,EAAID,IAAS,IAAMC,EAAE,KAAKJ,CAAQ,EAAII,EAAIA,EAAE,MAAQH,EAAM,IAAID,CAAQ,CAChG,EACIM,GAAmBC,GAAmCC,GAA2BC,GAAuBC,GAAqBC,GAAkBC,GAAqBC,GAAoBC,GAAmBC,GAAeC,GAAoBC,GAAiBC,GAAqBC,GAAkBC,GAAwBC,GAAsCC,GAAwCC,GAAcC,GAA0BC,GAA8BC,GAA2BC,GAAoCC,GAAoBC,GAAsBC,GAAsBC,GAOxkBC,GAAN,cAAyB,KAAM,CACtC,EAIqBC,GAArB,cAAoC,GAAAC,OAAa,CAE7C,YAAYC,EAAS,CACjB,IAAIC,EAAIC,EAAIC,EAAIC,EAuChB,GAtCA,MAAM,EACNjC,GAAkB,IAAI,IAAI,EAC1BC,GAAkC,IAAI,KAAM,MAAM,EAClDC,GAA0B,IAAI,KAAM,MAAM,EAC1CC,GAAsB,IAAI,KAAM,CAAC,EACjCC,GAAoB,IAAI,KAAM,MAAM,EACpCC,GAAiB,IAAI,KAAM,MAAM,EACjCC,GAAoB,IAAI,KAAM,CAAC,EAC/BC,GAAmB,IAAI,KAAM,MAAM,EACnCC,GAAkB,IAAI,KAAM,MAAM,EAClCC,GAAc,IAAI,KAAM,MAAM,EAC9BC,GAAmB,IAAI,KAAM,MAAM,EACnCC,GAAgB,IAAI,KAAM,CAAC,EAE3BC,GAAoB,IAAI,KAAM,MAAM,EACpCC,GAAiB,IAAI,KAAM,MAAM,EACjCC,GAAuB,IAAI,KAAM,MAAM,EAMvC,OAAO,eAAe,KAAM,UAAW,CACnC,WAAY,GACZ,aAAc,GACd,SAAU,GACV,MAAO,MACX,CAAC,EAEDe,EAAU,CACN,0BAA2B,GAC3B,YAAa,OAAO,kBACpB,SAAU,EACV,YAAa,OAAO,kBACpB,UAAW,GACX,WAAYK,GACZ,GAAGL,CACP,EACI,EAAE,OAAOA,EAAQ,aAAgB,UAAYA,EAAQ,aAAe,GACpE,MAAM,IAAI,UAAU,iEAAiEE,GAAMD,EAAKD,EAAQ,eAAiB,MAAQC,IAAO,OAAS,OAASA,EAAG,SAAS,KAAO,MAAQC,IAAO,OAASA,EAAK,EAAE,OAAO,OAAOF,EAAQ,WAAW,GAAG,EAEpP,GAAIA,EAAQ,WAAa,QAAa,EAAE,OAAO,SAASA,EAAQ,QAAQ,GAAKA,EAAQ,UAAY,GAC7F,MAAM,IAAI,UAAU,4DAA4DI,GAAMD,EAAKH,EAAQ,YAAc,MAAQG,IAAO,OAAS,OAASA,EAAG,SAAS,KAAO,MAAQC,IAAO,OAASA,EAAK,EAAE,OAAO,OAAOJ,EAAQ,QAAQ,GAAG,EAEzOpC,GAAuB,KAAMQ,GAAmC4B,EAAQ,0BAA2B,GAAG,EACtGpC,GAAuB,KAAMS,GAA2B2B,EAAQ,cAAgB,OAAO,mBAAqBA,EAAQ,WAAa,EAAG,GAAG,EACvIpC,GAAuB,KAAMW,GAAqByB,EAAQ,YAAa,GAAG,EAC1EpC,GAAuB,KAAMY,GAAkBwB,EAAQ,SAAU,GAAG,EACpEpC,GAAuB,KAAMgB,GAAe,IAAIoB,EAAQ,WAAc,GAAG,EACzEpC,GAAuB,KAAMiB,GAAoBmB,EAAQ,WAAY,GAAG,EACxE,KAAK,YAAcA,EAAQ,YAC3B,KAAK,QAAUA,EAAQ,QACvBpC,GAAuB,KAAMqB,GAAwBe,EAAQ,iBAAmB,GAAM,GAAG,EACzFpC,GAAuB,KAAMoB,GAAkBgB,EAAQ,YAAc,GAAO,GAAG,CACnF,CACA,IAAI,aAAc,CACd,OAAO9B,EAAuB,KAAMa,GAAqB,GAAG,CAChE,CACA,IAAI,YAAYuB,EAAgB,CAC5B,GAAI,EAAE,OAAOA,GAAmB,UAAYA,GAAkB,GAC1D,MAAM,IAAI,UAAU,gEAAgEA,CAAc,OAAO,OAAOA,CAAc,GAAG,EAErI1C,GAAuB,KAAMmB,GAAqBuB,EAAgB,GAAG,EACrEpC,EAAuB,KAAMC,GAAmB,IAAKuB,EAAoB,EAAE,KAAK,IAAI,CACxF,CACA,MAAM,IAAIa,EAAWP,EAAU,CAAC,EAAG,CAC/B,OAAAA,EAAU,CACN,QAAS,KAAK,QACd,eAAgB9B,EAAuB,KAAMe,GAAwB,GAAG,EACxE,GAAGe,CACP,EACO,IAAI,QAAQ,CAACQ,EAASC,IAAW,CACpCvC,EAAuB,KAAMU,GAAe,GAAG,EAAE,QAAQ,SAAY,CACjE,IAAIqB,EACAC,EAAIC,EACRvC,GAAuB,KAAMkB,IAAkBoB,EAAKhC,EAAuB,KAAMY,GAAiB,GAAG,EAAGoB,IAAMA,GAAK,GAAG,EACtHtC,GAAuB,KAAMU,IAAwB6B,EAAKjC,EAAuB,KAAMI,GAAuB,GAAG,EAAG6B,IAAMA,GAAK,GAAG,EAClI,GAAI,CAEA,GAAK,GAAAF,EAAKD,EAAQ,UAAY,MAAQC,IAAO,SAAkBA,EAAG,QAE9D,MAAM,IAAIJ,GAAW,uBAAuB,EAEhD,IAAIa,EAAYH,EAAU,CAAE,OAAQP,EAAQ,MAAO,CAAC,EAChDA,EAAQ,UACRU,EAAYC,GAAS,QAAQ,QAAQD,CAAS,EAAGV,EAAQ,OAAO,GAEhEA,EAAQ,SACRU,EAAY,QAAQ,KAAK,CAACA,EAAWxC,EAAuB,KAAMC,GAAmB,IAAKwB,EAAoB,EAAE,KAAK,KAAMK,EAAQ,MAAM,CAAC,CAAC,GAE/I,IAAMY,EAAS,MAAMF,EACrBF,EAAQI,CAAM,EACd,KAAK,KAAK,YAAaA,CAAM,CACjC,OACOC,EAAO,CACV,GAAIA,aAAiBC,IAAgB,CAACd,EAAQ,eAAgB,CAC1DQ,EAAQ,EACR,MACJ,CACAC,EAAOI,CAAK,EACZ,KAAK,KAAK,QAASA,CAAK,CAC5B,QACA,CACI3C,EAAuB,KAAMC,GAAmB,IAAKiB,EAAY,EAAE,KAAK,IAAI,CAChF,CACJ,EAAGY,CAAO,EACV,KAAK,KAAK,KAAK,EACf9B,EAAuB,KAAMC,GAAmB,IAAKoB,EAAyB,EAAE,KAAK,IAAI,CAC7F,CAAC,CACL,CACA,MAAM,OAAOwB,EAAWf,EAAS,CAC7B,OAAO,QAAQ,IAAIe,EAAU,IAAI,MAAOR,GAAc,KAAK,IAAIA,EAAWP,CAAO,CAAC,CAAC,CACvF,CAIA,OAAQ,CACJ,OAAK9B,EAAuB,KAAMc,GAAkB,GAAG,GAGvDpB,GAAuB,KAAMoB,GAAkB,GAAO,GAAG,EACzDd,EAAuB,KAAMC,GAAmB,IAAKuB,EAAoB,EAAE,KAAK,IAAI,EAC7E,MAJI,IAKf,CAIA,OAAQ,CACJ9B,GAAuB,KAAMoB,GAAkB,GAAM,GAAG,CAC5D,CAIA,OAAQ,CACJpB,GAAuB,KAAMgB,GAAe,IAAKV,EAAuB,KAAMW,GAAoB,GAAG,GAAM,GAAG,CAClH,CAMA,MAAM,SAAU,CAERX,EAAuB,KAAMU,GAAe,GAAG,EAAE,OAAS,GAG9D,MAAMV,EAAuB,KAAMC,GAAmB,IAAKyB,EAAe,EAAE,KAAK,KAAM,OAAO,CAClG,CAQA,MAAM,eAAeoB,EAAO,CAEpB9C,EAAuB,KAAMU,GAAe,GAAG,EAAE,KAAOoC,GAG5D,MAAM9C,EAAuB,KAAMC,GAAmB,IAAKyB,EAAe,EAAE,KAAK,KAAM,OAAQ,IAAM1B,EAAuB,KAAMU,GAAe,GAAG,EAAE,KAAOoC,CAAK,CACtK,CAMA,MAAM,QAAS,CAEP9C,EAAuB,KAAMY,GAAiB,GAAG,IAAM,GAAKZ,EAAuB,KAAMU,GAAe,GAAG,EAAE,OAAS,GAG1H,MAAMV,EAAuB,KAAMC,GAAmB,IAAKyB,EAAe,EAAE,KAAK,KAAM,MAAM,CACjG,CAIA,IAAI,MAAO,CACP,OAAO1B,EAAuB,KAAMU,GAAe,GAAG,EAAE,IAC5D,CAMA,OAAOoB,EAAS,CAEZ,OAAO9B,EAAuB,KAAMU,GAAe,GAAG,EAAE,OAAOoB,CAAO,EAAE,MAC5E,CAIA,IAAI,SAAU,CACV,OAAO9B,EAAuB,KAAMY,GAAiB,GAAG,CAC5D,CAIA,IAAI,UAAW,CACX,OAAOZ,EAAuB,KAAMc,GAAkB,GAAG,CAC7D,CACJ,EACAZ,GAAoC,IAAI,QAAWC,GAA4B,IAAI,QAAWC,GAAwB,IAAI,QAAWC,GAAsB,IAAI,QAAWC,GAAmB,IAAI,QAAWC,GAAsB,IAAI,QAAWC,GAAqB,IAAI,QAAWC,GAAoB,IAAI,QAAWC,GAAgB,IAAI,QAAWC,GAAqB,IAAI,QAAWC,GAAkB,IAAI,QAAWC,GAAsB,IAAI,QAAWC,GAAmB,IAAI,QAAWC,GAAyB,IAAI,QAAWd,GAAoB,IAAI,QAAWe,GAAuC,UAAgD,CACjoB,OAAOhB,EAAuB,KAAMG,GAA2B,GAAG,GAAKH,EAAuB,KAAMI,GAAuB,GAAG,EAAIJ,EAAuB,KAAMK,GAAqB,GAAG,CAC3L,EAAGY,GAAyC,UAAkD,CAC1F,OAAOjB,EAAuB,KAAMY,GAAiB,GAAG,EAAIZ,EAAuB,KAAMa,GAAqB,GAAG,CACrH,EAAGK,GAAe,UAAwB,CACtC,IAAIa,EACJrC,GAAuB,KAAMkB,IAAkBmB,EAAK/B,EAAuB,KAAMY,GAAiB,GAAG,EAAGmB,IAAMA,GAAK,GAAG,EACtH/B,EAAuB,KAAMC,GAAmB,IAAKoB,EAAyB,EAAE,KAAK,IAAI,EACzF,KAAK,KAAK,MAAM,CACpB,EAAGF,GAA2B,UAAoC,CAC9DnB,EAAuB,KAAMC,GAAmB,IAAKsB,EAAkB,EAAE,KAAK,IAAI,EAClFvB,EAAuB,KAAMC,GAAmB,IAAKqB,EAAkC,EAAE,KAAK,IAAI,EAClG5B,GAAuB,KAAMe,GAAmB,OAAW,GAAG,CAClE,EAAGW,GAA+B,UAAwC,CACtE,IAAM2B,EAAM,KAAK,IAAI,EACrB,GAAI/C,EAAuB,KAAMQ,GAAoB,GAAG,IAAM,OAAW,CACrE,IAAMwC,EAAQhD,EAAuB,KAAMO,GAAqB,GAAG,EAAIwC,EACvE,GAAIC,EAAQ,EAGRtD,GAAuB,KAAMU,GAAwBJ,EAAuB,KAAME,GAAmC,GAAG,EAAKF,EAAuB,KAAMY,GAAiB,GAAG,EAAI,EAAG,GAAG,MAIxL,QAAIZ,EAAuB,KAAMS,GAAmB,GAAG,IAAM,QACzDf,GAAuB,KAAMe,GAAmB,WAAW,IAAM,CAC7DT,EAAuB,KAAMC,GAAmB,IAAKkB,EAAwB,EAAE,KAAK,IAAI,CAC5F,EAAG6B,CAAK,EAAG,GAAG,EAEX,EAEf,CACA,MAAO,EACX,EAAG3B,GAA4B,UAAqC,CAChE,GAAIrB,EAAuB,KAAMU,GAAe,GAAG,EAAE,OAAS,EAG1D,OAAIV,EAAuB,KAAMQ,GAAoB,GAAG,GACpD,cAAcR,EAAuB,KAAMQ,GAAoB,GAAG,CAAC,EAEvEd,GAAuB,KAAMc,GAAoB,OAAW,GAAG,EAC/D,KAAK,KAAK,OAAO,EACbR,EAAuB,KAAMY,GAAiB,GAAG,IAAM,GACvD,KAAK,KAAK,MAAM,EAEb,GAEX,GAAI,CAACZ,EAAuB,KAAMc,GAAkB,GAAG,EAAG,CACtD,IAAMmC,EAAwB,CAACjD,EAAuB,KAAMC,GAAmB,IAAKmB,EAA4B,EAChH,GAAIpB,EAAuB,KAAMC,GAAmB,IAAKe,EAAoC,GAAKhB,EAAuB,KAAMC,GAAmB,IAAKgB,EAAsC,EAAG,CAC5L,IAAMiC,EAAMlD,EAAuB,KAAMU,GAAe,GAAG,EAAE,QAAQ,EACrE,OAAKwC,GAGL,KAAK,KAAK,QAAQ,EAClBA,EAAI,EACAD,GACAjD,EAAuB,KAAMC,GAAmB,IAAKqB,EAAkC,EAAE,KAAK,IAAI,EAE/F,IAPI,EAQf,CACJ,CACA,MAAO,EACX,EAAGA,GAAqC,UAA8C,CAC9EtB,EAAuB,KAAMG,GAA2B,GAAG,GAAKH,EAAuB,KAAMQ,GAAoB,GAAG,IAAM,SAG9Hd,GAAuB,KAAMc,GAAoB,YAAY,IAAM,CAC/DR,EAAuB,KAAMC,GAAmB,IAAKsB,EAAkB,EAAE,KAAK,IAAI,CACtF,EAAGvB,EAAuB,KAAMM,GAAkB,GAAG,CAAC,EAAG,GAAG,EAC5DZ,GAAuB,KAAMa,GAAqB,KAAK,IAAI,EAAIP,EAAuB,KAAMM,GAAkB,GAAG,EAAG,GAAG,EAC3H,EAAGiB,GAAqB,UAA8B,CAC9CvB,EAAuB,KAAMI,GAAuB,GAAG,IAAM,GAAKJ,EAAuB,KAAMY,GAAiB,GAAG,IAAM,GAAKZ,EAAuB,KAAMQ,GAAoB,GAAG,IAClL,cAAcR,EAAuB,KAAMQ,GAAoB,GAAG,CAAC,EACnEd,GAAuB,KAAMc,GAAoB,OAAW,GAAG,GAEnEd,GAAuB,KAAMU,GAAuBJ,EAAuB,KAAME,GAAmC,GAAG,EAAIF,EAAuB,KAAMY,GAAiB,GAAG,EAAI,EAAG,GAAG,EACtLZ,EAAuB,KAAMC,GAAmB,IAAKuB,EAAoB,EAAE,KAAK,IAAI,CACxF,EAAGA,GAAuB,UAAgC,CAEtD,KAAOxB,EAAuB,KAAMC,GAAmB,IAAKoB,EAAyB,EAAE,KAAK,IAAI,GAAG,CACvG,EAAGI,GAAuB,eAAoC0B,EAAQ,CAClE,OAAO,IAAI,QAAQ,CAACC,EAAUb,IAAW,CACrCY,EAAO,iBAAiB,QAAS,IAAM,CAGnCZ,EAAO,IAAIZ,GAAW,uBAAuB,CAAC,CAClD,EAAG,CAAE,KAAM,EAAK,CAAC,CACrB,CAAC,CACL,EAAGD,GAAkB,eAA+B2B,EAAOC,EAAQ,CAC/D,OAAO,IAAI,QAAQhB,GAAW,CAC1B,IAAMiB,EAAW,IAAM,CACfD,GAAU,CAACA,EAAO,IAGtB,KAAK,IAAID,EAAOE,CAAQ,EACxBjB,EAAQ,EACZ,EACA,KAAK,GAAGe,EAAOE,CAAQ,CAC3B,CAAC,CACL,EIxUA,IAAAC,GAAqB,WAErBC,GAA2B,sBAC3BC,GAAmC,4BACnCC,GAAyC,6BACzCC,GAA8B,gCAC9BC,GAA2B,gCAC3BC,GAA4D,4BAE5DC,KWTA,IAAAC,GAA2B,4BAC3BC,GAAmD,gCACnDC,GAAO,kjBVHPC,GAAAC,GAAA,CAAA,6EAAAC,EAAAC,EAAA,CAAA,aAEAA,EAAO,QAAU,CAChB,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,aAAgB,CAAC,IAAK,IAAK,GAAG,EAC9B,KAAQ,CAAC,EAAG,IAAK,GAAG,EACpB,WAAc,CAAC,IAAK,IAAK,GAAG,EAC5B,MAAS,CAAC,IAAK,IAAK,GAAG,EACvB,MAAS,CAAC,IAAK,IAAK,GAAG,EACvB,OAAU,CAAC,IAAK,IAAK,GAAG,EACxB,MAAS,CAAC,EAAG,EAAG,CAAC,EACjB,eAAkB,CAAC,IAAK,IAAK,GAAG,EAChC,KAAQ,CAAC,EAAG,EAAG,GAAG,EAClB,WAAc,CAAC,IAAK,GAAI,GAAG,EAC3B,MAAS,CAAC,IAAK,GAAI,EAAE,EACrB,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,UAAa,CAAC,GAAI,IAAK,GAAG,EAC1B,WAAc,CAAC,IAAK,IAAK,CAAC,EAC1B,UAAa,CAAC,IAAK,IAAK,EAAE,EAC1B,MAAS,CAAC,IAAK,IAAK,EAAE,EACtB,eAAkB,CAAC,IAAK,IAAK,GAAG,EAChC,SAAY,CAAC,IAAK,IAAK,GAAG,EAC1B,QAAW,CAAC,IAAK,GAAI,EAAE,EACvB,KAAQ,CAAC,EAAG,IAAK,GAAG,EACpB,SAAY,CAAC,EAAG,EAAG,GAAG,EACtB,SAAY,CAAC,EAAG,IAAK,GAAG,EACxB,cAAiB,CAAC,IAAK,IAAK,EAAE,EAC9B,SAAY,CAAC,IAAK,IAAK,GAAG,EAC1B,UAAa,CAAC,EAAG,IAAK,CAAC,EACvB,SAAY,CAAC,IAAK,IAAK,GAAG,EAC1B,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,YAAe,CAAC,IAAK,EAAG,GAAG,EAC3B,eAAkB,CAAC,GAAI,IAAK,EAAE,EAC9B,WAAc,CAAC,IAAK,IAAK,CAAC,EAC1B,WAAc,CAAC,IAAK,GAAI,GAAG,EAC3B,QAAW,CAAC,IAAK,EAAG,CAAC,EACrB,WAAc,CAAC,IAAK,IAAK,GAAG,EAC5B,aAAgB,CAAC,IAAK,IAAK,GAAG,EAC9B,cAAiB,CAAC,GAAI,GAAI,GAAG,EAC7B,cAAiB,CAAC,GAAI,GAAI,EAAE,EAC5B,cAAiB,CAAC,GAAI,GAAI,EAAE,EAC5B,cAAiB,CAAC,EAAG,IAAK,GAAG,EAC7B,WAAc,CAAC,IAAK,EAAG,GAAG,EAC1B,SAAY,CAAC,IAAK,GAAI,GAAG,EACzB,YAAe,CAAC,EAAG,IAAK,GAAG,EAC3B,QAAW,CAAC,IAAK,IAAK,GAAG,EACzB,QAAW,CAAC,IAAK,IAAK,GAAG,EACzB,WAAc,CAAC,GAAI,IAAK,GAAG,EAC3B,UAAa,CAAC,IAAK,GAAI,EAAE,EACzB,YAAe,CAAC,IAAK,IAAK,GAAG,EAC7B,YAAe,CAAC,GAAI,IAAK,EAAE,EAC3B,QAAW,CAAC,IAAK,EAAG,GAAG,EACvB,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,WAAc,CAAC,IAAK,IAAK,GAAG,EAC5B,KAAQ,CAAC,IAAK,IAAK,CAAC,EACpB,UAAa,CAAC,IAAK,IAAK,EAAE,EAC1B,KAAQ,CAAC,IAAK,IAAK,GAAG,EACtB,MAAS,CAAC,EAAG,IAAK,CAAC,EACnB,YAAe,CAAC,IAAK,IAAK,EAAE,EAC5B,KAAQ,CAAC,IAAK,IAAK,GAAG,EACtB,SAAY,CAAC,IAAK,IAAK,GAAG,EAC1B,QAAW,CAAC,IAAK,IAAK,GAAG,EACzB,UAAa,CAAC,IAAK,GAAI,EAAE,EACzB,OAAU,CAAC,GAAI,EAAG,GAAG,EACrB,MAAS,CAAC,IAAK,IAAK,GAAG,EACvB,MAAS,CAAC,IAAK,IAAK,GAAG,EACvB,SAAY,CAAC,IAAK,IAAK,GAAG,EAC1B,cAAiB,CAAC,IAAK,IAAK,GAAG,EAC/B,UAAa,CAAC,IAAK,IAAK,CAAC,EACzB,aAAgB,CAAC,IAAK,IAAK,GAAG,EAC9B,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,WAAc,CAAC,IAAK,IAAK,GAAG,EAC5B,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,qBAAwB,CAAC,IAAK,IAAK,GAAG,EACtC,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,WAAc,CAAC,IAAK,IAAK,GAAG,EAC5B,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,YAAe,CAAC,IAAK,IAAK,GAAG,EAC7B,cAAiB,CAAC,GAAI,IAAK,GAAG,EAC9B,aAAgB,CAAC,IAAK,IAAK,GAAG,EAC9B,eAAkB,CAAC,IAAK,IAAK,GAAG,EAChC,eAAkB,CAAC,IAAK,IAAK,GAAG,EAChC,eAAkB,CAAC,IAAK,IAAK,GAAG,EAChC,YAAe,CAAC,IAAK,IAAK,GAAG,EAC7B,KAAQ,CAAC,EAAG,IAAK,CAAC,EAClB,UAAa,CAAC,GAAI,IAAK,EAAE,EACzB,MAAS,CAAC,IAAK,IAAK,GAAG,EACvB,QAAW,CAAC,IAAK,EAAG,GAAG,EACvB,OAAU,CAAC,IAAK,EAAG,CAAC,EACpB,iBAAoB,CAAC,IAAK,IAAK,GAAG,EAClC,WAAc,CAAC,EAAG,EAAG,GAAG,EACxB,aAAgB,CAAC,IAAK,GAAI,GAAG,EAC7B,aAAgB,CAAC,IAAK,IAAK,GAAG,EAC9B,eAAkB,CAAC,GAAI,IAAK,GAAG,EAC/B,gBAAmB,CAAC,IAAK,IAAK,GAAG,EACjC,kBAAqB,CAAC,EAAG,IAAK,GAAG,EACjC,gBAAmB,CAAC,GAAI,IAAK,GAAG,EAChC,gBAAmB,CAAC,IAAK,GAAI,GAAG,EAChC,aAAgB,CAAC,GAAI,GAAI,GAAG,EAC5B,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,SAAY,CAAC,IAAK,IAAK,GAAG,EAC1B,YAAe,CAAC,IAAK,IAAK,GAAG,EAC7B,KAAQ,CAAC,EAAG,EAAG,GAAG,EAClB,QAAW,CAAC,IAAK,IAAK,GAAG,EACzB,MAAS,CAAC,IAAK,IAAK,CAAC,EACrB,UAAa,CAAC,IAAK,IAAK,EAAE,EAC1B,OAAU,CAAC,IAAK,IAAK,CAAC,EACtB,UAAa,CAAC,IAAK,GAAI,CAAC,EACxB,OAAU,CAAC,IAAK,IAAK,GAAG,EACxB,cAAiB,CAAC,IAAK,IAAK,GAAG,EAC/B,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,cAAiB,CAAC,IAAK,IAAK,GAAG,EAC/B,cAAiB,CAAC,IAAK,IAAK,GAAG,EAC/B,WAAc,CAAC,IAAK,IAAK,GAAG,EAC5B,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,KAAQ,CAAC,IAAK,IAAK,EAAE,EACrB,KAAQ,CAAC,IAAK,IAAK,GAAG,EACtB,KAAQ,CAAC,IAAK,IAAK,GAAG,EACtB,WAAc,CAAC,IAAK,IAAK,GAAG,EAC5B,OAAU,CAAC,IAAK,EAAG,GAAG,EACtB,cAAiB,CAAC,IAAK,GAAI,GAAG,EAC9B,IAAO,CAAC,IAAK,EAAG,CAAC,EACjB,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,UAAa,CAAC,GAAI,IAAK,GAAG,EAC1B,YAAe,CAAC,IAAK,GAAI,EAAE,EAC3B,OAAU,CAAC,IAAK,IAAK,GAAG,EACxB,WAAc,CAAC,IAAK,IAAK,EAAE,EAC3B,SAAY,CAAC,GAAI,IAAK,EAAE,EACxB,SAAY,CAAC,IAAK,IAAK,GAAG,EAC1B,OAAU,CAAC,IAAK,GAAI,EAAE,EACtB,OAAU,CAAC,IAAK,IAAK,GAAG,EACxB,QAAW,CAAC,IAAK,IAAK,GAAG,EACzB,UAAa,CAAC,IAAK,GAAI,GAAG,EAC1B,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,UAAa,CAAC,IAAK,IAAK,GAAG,EAC3B,KAAQ,CAAC,IAAK,IAAK,GAAG,EACtB,YAAe,CAAC,EAAG,IAAK,GAAG,EAC3B,UAAa,CAAC,GAAI,IAAK,GAAG,EAC1B,IAAO,CAAC,IAAK,IAAK,GAAG,EACrB,KAAQ,CAAC,EAAG,IAAK,GAAG,EACpB,QAAW,CAAC,IAAK,IAAK,GAAG,EACzB,OAAU,CAAC,IAAK,GAAI,EAAE,EACtB,UAAa,CAAC,GAAI,IAAK,GAAG,EAC1B,OAAU,CAAC,IAAK,IAAK,GAAG,EACxB,MAAS,CAAC,IAAK,IAAK,GAAG,EACvB,MAAS,CAAC,IAAK,IAAK,GAAG,EACvB,WAAc,CAAC,IAAK,IAAK,GAAG,EAC5B,OAAU,CAAC,IAAK,IAAK,CAAC,EACtB,YAAe,CAAC,IAAK,IAAK,EAAE,CAC7B,CAAA,CAAA,CAAA,ECvJAC,GAAAH,GAAA,CAAA,+EAAAC,EAAAC,EAAA,CAAA,aAAAA,EAAO,QAAU,SAAoBE,EAAK,CACzC,MAAI,CAACA,GAAO,OAAOA,GAAQ,SACnB,GAGDA,aAAe,OAAS,MAAM,QAAQA,CAAG,GAC9CA,EAAI,QAAU,IAAMA,EAAI,kBAAkB,UACzC,OAAO,yBAAyBA,EAAMA,EAAI,OAAS,CAAE,GAAKA,EAAI,YAAY,OAAS,SACvF,CAAA,CAAA,CAAA,ECRAC,GAAAL,GAAA,CAAA,qFAAAC,EAAAC,EAAA,CAAA,aAEA,IAAII,EAAaH,GAAA,EAEbI,EAAS,MAAM,UAAU,OACzBC,EAAQ,MAAM,UAAU,MAExBC,EAAUP,EAAO,QAAU,SAAiBQ,EAAM,CAGrD,QAFIC,EAAU,CAAC,EAENC,EAAI,EAAGC,EAAMH,EAAK,OAAQE,EAAIC,EAAKD,IAAK,CAChD,IAAIE,EAAMJ,EAAKE,CAAC,EAEZN,EAAWQ,CAAG,EAEjBH,EAAUJ,EAAO,KAAKI,EAASH,EAAM,KAAKM,CAAG,CAAC,EAE9CH,EAAQ,KAAKG,CAAG,CAElB,CAEA,OAAOH,CACR,EAEAF,EAAQ,KAAO,SAAUM,EAAI,CAC5B,OAAO,UAAY,CAClB,OAAOA,EAAGN,EAAQ,SAAS,CAAC,CAC7B,CACD,CAAA,CAAA,CAAA,EC5BAO,GAAAhB,GAAA,CAAA,iFAAAC,EAAAC,EAAA,CAAA,aACA,IAAIe,EAAalB,GAAA,EACbU,EAAUJ,GAAA,EACVa,EAAiB,OAAO,eAExBC,EAAe,OAAO,OAAO,IAAI,EAGrC,IAASC,KAAQH,EACZC,EAAe,KAAKD,EAAYG,CAAI,IACvCD,EAAaF,EAAWG,CAAI,CAAC,EAAIA,GAF1B,IAAAA,EAMLC,EAAKnB,EAAO,QAAU,CACzB,GAAI,CAAC,EACL,IAAK,CAAC,CACP,EAEAmB,EAAG,IAAM,SAAUC,EAAQ,CAC1B,IAAIC,EAASD,EAAO,UAAU,EAAG,CAAC,EAAE,YAAY,EAC5CE,EACAC,EACJ,OAAQF,EAAQ,CACf,IAAK,MACJC,EAAMH,EAAG,IAAI,IAAIC,CAAM,EACvBG,EAAQ,MACR,MACD,IAAK,MACJD,EAAMH,EAAG,IAAI,IAAIC,CAAM,EACvBG,EAAQ,MACR,MACD,QACCD,EAAMH,EAAG,IAAI,IAAIC,CAAM,EACvBG,EAAQ,MACR,KACF,CAEA,OAAKD,EAIE,CAAC,MAAAC,EAAc,MAAOD,CAAG,EAHxB,IAIT,EAEAH,EAAG,IAAI,IAAM,SAAUC,EAAQ,CAC9B,GAAI,CAACA,EACJ,OAAO,KAGR,IAAII,EAAO,sBACPC,EAAM,kCACNC,EAAO,+HACPC,EAAM,uHACNC,EAAU,UAEVC,EAAM,CAAC,EAAG,EAAG,EAAG,CAAC,EACjBC,EACApB,EACAqB,EAEJ,GAAID,EAAQV,EAAO,MAAMK,CAAG,EAAG,CAI9B,IAHAM,EAAWD,EAAM,CAAC,EAClBA,EAAQA,EAAM,CAAC,EAEVpB,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAEvB,IAAIsB,EAAKtB,EAAI,EACbmB,EAAInB,CAAC,EAAI,SAASoB,EAAM,MAAME,EAAIA,EAAK,CAAC,EAAG,EAAE,CAC9C,CAEID,IACHF,EAAI,CAAC,EAAI,SAASE,EAAU,EAAE,EAAI,IAEpC,SAAWD,EAAQV,EAAO,MAAMI,CAAI,EAAG,CAItC,IAHAM,EAAQA,EAAM,CAAC,EACfC,EAAWD,EAAM,CAAC,EAEbpB,EAAI,EAAGA,EAAI,EAAGA,IAClBmB,EAAInB,CAAC,EAAI,SAASoB,EAAMpB,CAAC,EAAIoB,EAAMpB,CAAC,EAAG,EAAE,EAGtCqB,IACHF,EAAI,CAAC,EAAI,SAASE,EAAWA,EAAU,EAAE,EAAI,IAE/C,SAAWD,EAAQV,EAAO,MAAMM,CAAI,EAAG,CACtC,IAAKhB,EAAI,EAAGA,EAAI,EAAGA,IAClBmB,EAAInB,CAAC,EAAI,SAASoB,EAAMpB,EAAI,CAAC,EAAG,CAAC,EAG9BoB,EAAM,CAAC,IACNA,EAAM,CAAC,EACVD,EAAI,CAAC,EAAI,WAAWC,EAAM,CAAC,CAAC,EAAI,IAEhCD,EAAI,CAAC,EAAI,WAAWC,EAAM,CAAC,CAAC,EAG/B,SAAWA,EAAQV,EAAO,MAAMO,CAAG,EAAG,CACrC,IAAKjB,EAAI,EAAGA,EAAI,EAAGA,IAClBmB,EAAInB,CAAC,EAAI,KAAK,MAAM,WAAWoB,EAAMpB,EAAI,CAAC,CAAC,EAAI,IAAI,EAGhDoB,EAAM,CAAC,IACNA,EAAM,CAAC,EACVD,EAAI,CAAC,EAAI,WAAWC,EAAM,CAAC,CAAC,EAAI,IAEhCD,EAAI,CAAC,EAAI,WAAWC,EAAM,CAAC,CAAC,EAG/B,KAAA,QAAWA,EAAQV,EAAO,MAAMQ,CAAO,GAClCE,EAAM,CAAC,IAAM,cACT,CAAC,EAAG,EAAG,EAAG,CAAC,EAGdd,EAAe,KAAKD,EAAYe,EAAM,CAAC,CAAC,GAI7CD,EAAMd,EAAWe,EAAM,CAAC,CAAC,EACzBD,EAAI,CAAC,EAAI,EAEFA,GANC,KAQD,KAGR,IAAKnB,EAAI,EAAGA,EAAI,EAAGA,IAClBmB,EAAInB,CAAC,EAAIuB,EAAMJ,EAAInB,CAAC,EAAG,EAAG,GAAG,EAE9B,OAAAmB,EAAI,CAAC,EAAII,EAAMJ,EAAI,CAAC,EAAG,EAAG,CAAC,EAEpBA,CACR,EAEAV,EAAG,IAAI,IAAM,SAAUC,EAAQ,CAC9B,GAAI,CAACA,EACJ,OAAO,KAGR,IAAIc,EAAM,+KACNJ,EAAQV,EAAO,MAAMc,CAAG,EAE5B,GAAIJ,EAAO,CACV,IAAIK,EAAQ,WAAWL,EAAM,CAAC,CAAC,EAC3BM,GAAM,WAAWN,EAAM,CAAC,CAAC,EAAI,IAAO,KAAO,IAC3CO,EAAIJ,EAAM,WAAWH,EAAM,CAAC,CAAC,EAAG,EAAG,GAAG,EACtCQ,EAAIL,EAAM,WAAWH,EAAM,CAAC,CAAC,EAAG,EAAG,GAAG,EACtCS,EAAIN,EAAM,MAAME,CAAK,EAAI,EAAIA,EAAO,EAAG,CAAC,EAE5C,MAAO,CAACC,EAAGC,EAAGC,EAAGC,CAAC,CACnB,CAEA,OAAO,IACR,EAEApB,EAAG,IAAI,IAAM,SAAUC,EAAQ,CAC9B,GAAI,CAACA,EACJ,OAAO,KAGR,IAAIoB,EAAM,sKACNV,EAAQV,EAAO,MAAMoB,CAAG,EAE5B,GAAIV,EAAO,CACV,IAAIK,EAAQ,WAAWL,EAAM,CAAC,CAAC,EAC3BM,GAAM,WAAWN,EAAM,CAAC,CAAC,EAAI,IAAO,KAAO,IAC3CW,EAAIR,EAAM,WAAWH,EAAM,CAAC,CAAC,EAAG,EAAG,GAAG,EACtCY,EAAIT,EAAM,WAAWH,EAAM,CAAC,CAAC,EAAG,EAAG,GAAG,EACtCS,EAAIN,EAAM,MAAME,CAAK,EAAI,EAAIA,EAAO,EAAG,CAAC,EAC5C,MAAO,CAACC,EAAGK,EAAGC,EAAGH,CAAC,CACnB,CAEA,OAAO,IACR,EAEApB,EAAG,GAAG,IAAM,UAAY,CACvB,IAAIO,EAAOnB,EAAQ,SAAS,EAE5B,MACC,IACAoC,EAAUjB,EAAK,CAAC,CAAC,EACjBiB,EAAUjB,EAAK,CAAC,CAAC,EACjBiB,EAAUjB,EAAK,CAAC,CAAC,GAChBA,EAAK,CAAC,EAAI,EACPiB,EAAU,KAAK,MAAMjB,EAAK,CAAC,EAAI,GAAG,CAAC,EACpC,GAEL,EAEAP,EAAG,GAAG,IAAM,UAAY,CACvB,IAAIO,EAAOnB,EAAQ,SAAS,EAE5B,OAAOmB,EAAK,OAAS,GAAKA,EAAK,CAAC,IAAM,EACnC,OAAS,KAAK,MAAMA,EAAK,CAAC,CAAC,EAAI,KAAO,KAAK,MAAMA,EAAK,CAAC,CAAC,EAAI,KAAO,KAAK,MAAMA,EAAK,CAAC,CAAC,EAAI,IACzF,QAAU,KAAK,MAAMA,EAAK,CAAC,CAAC,EAAI,KAAO,KAAK,MAAMA,EAAK,CAAC,CAAC,EAAI,KAAO,KAAK,MAAMA,EAAK,CAAC,CAAC,EAAI,KAAOA,EAAK,CAAC,EAAI,GAC/G,EAEAP,EAAG,GAAG,IAAI,QAAU,UAAY,CAC/B,IAAIO,EAAOnB,EAAQ,SAAS,EAExBqC,EAAI,KAAK,MAAMlB,EAAK,CAAC,EAAI,IAAM,GAAG,EAClCmB,EAAI,KAAK,MAAMnB,EAAK,CAAC,EAAI,IAAM,GAAG,EAClCgB,EAAI,KAAK,MAAMhB,EAAK,CAAC,EAAI,IAAM,GAAG,EAEtC,OAAOA,EAAK,OAAS,GAAKA,EAAK,CAAC,IAAM,EACnC,OAASkB,EAAI,MAAQC,EAAI,MAAQH,EAAI,KACrC,QAAUE,EAAI,MAAQC,EAAI,MAAQH,EAAI,MAAQhB,EAAK,CAAC,EAAI,GAC5D,EAEAP,EAAG,GAAG,IAAM,UAAY,CACvB,IAAI2B,EAAOvC,EAAQ,SAAS,EAC5B,OAAOuC,EAAK,OAAS,GAAKA,EAAK,CAAC,IAAM,EACnC,OAASA,EAAK,CAAC,EAAI,KAAOA,EAAK,CAAC,EAAI,MAAQA,EAAK,CAAC,EAAI,KACtD,QAAUA,EAAK,CAAC,EAAI,KAAOA,EAAK,CAAC,EAAI,MAAQA,EAAK,CAAC,EAAI,MAAQA,EAAK,CAAC,EAAI,GAC7E,EAIA3B,EAAG,GAAG,IAAM,UAAY,CACvB,IAAI4B,EAAOxC,EAAQ,SAAS,EAExBgC,EAAI,GACR,OAAIQ,EAAK,QAAU,GAAKA,EAAK,CAAC,IAAM,IACnCR,EAAI,KAAOQ,EAAK,CAAC,GAGX,OAASA,EAAK,CAAC,EAAI,KAAOA,EAAK,CAAC,EAAI,MAAQA,EAAK,CAAC,EAAI,IAAMR,EAAI,GACxE,EAEApB,EAAG,GAAG,QAAU,SAAUU,EAAK,CAC9B,OAAOZ,EAAaY,EAAI,MAAM,EAAG,CAAC,CAAC,CACpC,EAGA,SAASI,EAAMe,EAAKC,EAAKC,EAAK,CAC7B,OAAO,KAAK,IAAI,KAAK,IAAID,EAAKD,CAAG,EAAGE,CAAG,CACxC,CAEA,SAASP,EAAUK,EAAK,CACvB,IAAIG,EAAM,KAAK,MAAMH,CAAG,EAAE,SAAS,EAAE,EAAE,YAAY,EACnD,OAAQG,EAAI,OAAS,EAAK,IAAMA,EAAMA,CACvC,CAAA,CAAA,CAAA,ECjPAC,GAAAtD,GAAA,CAAA,yFAAAC,EAAAC,EAAA,CAAA,aAEA,IAAMqD,EAAcxD,GAAA,EAMdyD,EAAkB,CAAC,EACzB,QAAWC,KAAO,OAAO,KAAKF,CAAW,EACxCC,EAAgBD,EAAYE,CAAG,CAAC,EAAIA,EAGrC,IAAMC,EAAU,CACf,IAAK,CAAC,SAAU,EAAG,OAAQ,KAAK,EAChC,IAAK,CAAC,SAAU,EAAG,OAAQ,KAAK,EAChC,IAAK,CAAC,SAAU,EAAG,OAAQ,KAAK,EAChC,IAAK,CAAC,SAAU,EAAG,OAAQ,KAAK,EAChC,KAAM,CAAC,SAAU,EAAG,OAAQ,MAAM,EAClC,IAAK,CAAC,SAAU,EAAG,OAAQ,KAAK,EAChC,IAAK,CAAC,SAAU,EAAG,OAAQ,KAAK,EAChC,IAAK,CAAC,SAAU,EAAG,OAAQ,KAAK,EAChC,IAAK,CAAC,SAAU,EAAG,OAAQ,CAAC,KAAK,CAAC,EAClC,QAAS,CAAC,SAAU,EAAG,OAAQ,CAAC,SAAS,CAAC,EAC1C,OAAQ,CAAC,SAAU,EAAG,OAAQ,CAAC,QAAQ,CAAC,EACxC,QAAS,CAAC,SAAU,EAAG,OAAQ,CAAC,SAAS,CAAC,EAC1C,IAAK,CAAC,SAAU,EAAG,OAAQ,CAAC,IAAK,IAAK,GAAG,CAAC,EAC1C,MAAO,CAAC,SAAU,EAAG,OAAQ,CAAC,MAAO,MAAO,KAAK,CAAC,EAClD,KAAM,CAAC,SAAU,EAAG,OAAQ,CAAC,MAAM,CAAC,CACrC,EAEAxD,EAAO,QAAUwD,EAGjB,QAAWjC,KAAS,OAAO,KAAKiC,CAAO,EAAG,CACzC,GAAI,EAAE,aAAcA,EAAQjC,CAAK,GAChC,MAAM,IAAI,MAAM,8BAAgCA,CAAK,EAGtD,GAAI,EAAE,WAAYiC,EAAQjC,CAAK,GAC9B,MAAM,IAAI,MAAM,oCAAsCA,CAAK,EAG5D,GAAIiC,EAAQjC,CAAK,EAAE,OAAO,SAAWiC,EAAQjC,CAAK,EAAE,SACnD,MAAM,IAAI,MAAM,sCAAwCA,CAAK,EAG9D,GAAM,CAAC,SAAAkC,EAAU,OAAAC,CAAM,EAAIF,EAAQjC,CAAK,EACxC,OAAOiC,EAAQjC,CAAK,EAAE,SACtB,OAAOiC,EAAQjC,CAAK,EAAE,OACtB,OAAO,eAAeiC,EAAQjC,CAAK,EAAG,WAAY,CAAC,MAAOkC,CAAQ,CAAC,EACnE,OAAO,eAAeD,EAAQjC,CAAK,EAAG,SAAU,CAAC,MAAOmC,CAAM,CAAC,CAChE,CAEAF,EAAQ,IAAI,IAAM,SAAU3B,EAAK,CAChC,IAAMe,EAAIf,EAAI,CAAC,EAAI,IACbgB,EAAIhB,EAAI,CAAC,EAAI,IACba,EAAIb,EAAI,CAAC,EAAI,IACboB,EAAM,KAAK,IAAIL,EAAGC,EAAGH,CAAC,EACtBQ,EAAM,KAAK,IAAIN,EAAGC,EAAGH,CAAC,EACtBiB,EAAQT,EAAMD,EAChBb,EACAC,EAEAa,IAAQD,EACXb,EAAI,EACMQ,IAAMM,EAChBd,GAAKS,EAAIH,GAAKiB,EACJd,IAAMK,EAChBd,EAAI,GAAKM,EAAIE,GAAKe,EACRjB,IAAMQ,IAChBd,EAAI,GAAKQ,EAAIC,GAAKc,GAGnBvB,EAAI,KAAK,IAAIA,EAAI,GAAI,GAAG,EAEpBA,EAAI,IACPA,GAAK,KAGN,IAAME,GAAKW,EAAMC,GAAO,EAExB,OAAIA,IAAQD,EACXZ,EAAI,EACMC,GAAK,GACfD,EAAIsB,GAAST,EAAMD,GAEnBZ,EAAIsB,GAAS,EAAIT,EAAMD,GAGjB,CAACb,EAAGC,EAAI,IAAKC,EAAI,GAAG,CAC5B,EAEAkB,EAAQ,IAAI,IAAM,SAAU3B,EAAK,CAChC,IAAI+B,EACAC,EACAC,EACA1B,EACAC,EAEEO,EAAIf,EAAI,CAAC,EAAI,IACbgB,EAAIhB,EAAI,CAAC,EAAI,IACba,EAAIb,EAAI,CAAC,EAAI,IACbkC,EAAI,KAAK,IAAInB,EAAGC,EAAGH,CAAC,EACpBsB,EAAOD,EAAI,KAAK,IAAInB,EAAGC,EAAGH,CAAC,EAC3BuB,EAAQ,SAAUC,EAAG,CAC1B,OAAQH,EAAIG,GAAK,EAAIF,EAAO,EAAI,CACjC,EAEA,OAAIA,IAAS,GACZ5B,EAAI,EACJC,EAAI,IAEJA,EAAI2B,EAAOD,EACXH,EAAOK,EAAMrB,CAAC,EACdiB,EAAOI,EAAMpB,CAAC,EACdiB,EAAOG,EAAMvB,CAAC,EAEVE,IAAMmB,EACT3B,EAAI0B,EAAOD,EACDhB,IAAMkB,EAChB3B,EAAK,EAAI,EAAKwB,EAAOE,EACXpB,IAAMqB,IAChB3B,EAAK,EAAI,EAAKyB,EAAOD,GAGlBxB,EAAI,EACPA,GAAK,EACKA,EAAI,IACdA,GAAK,IAIA,CACNA,EAAI,IACJC,EAAI,IACJ0B,EAAI,GACL,CACD,EAEAP,EAAQ,IAAI,IAAM,SAAU3B,EAAK,CAChC,IAAMe,EAAIf,EAAI,CAAC,EACTgB,EAAIhB,EAAI,CAAC,EACXa,EAAIb,EAAI,CAAC,EACPO,EAAIoB,EAAQ,IAAI,IAAI3B,CAAG,EAAE,CAAC,EAC1BY,EAAI,EAAI,IAAM,KAAK,IAAIG,EAAG,KAAK,IAAIC,EAAGH,CAAC,CAAC,EAE9C,OAAAA,EAAI,EAAI,EAAI,IAAM,KAAK,IAAIE,EAAG,KAAK,IAAIC,EAAGH,CAAC,CAAC,EAErC,CAACN,EAAGK,EAAI,IAAKC,EAAI,GAAG,CAC5B,EAEAc,EAAQ,IAAI,KAAO,SAAU3B,EAAK,CACjC,IAAMe,EAAIf,EAAI,CAAC,EAAI,IACbgB,EAAIhB,EAAI,CAAC,EAAI,IACba,EAAIb,EAAI,CAAC,EAAI,IAEbsC,EAAI,KAAK,IAAI,EAAIvB,EAAG,EAAIC,EAAG,EAAIH,CAAC,EAChCwB,GAAK,EAAItB,EAAIuB,IAAM,EAAIA,IAAM,EAC7BC,GAAK,EAAIvB,EAAIsB,IAAM,EAAIA,IAAM,EAC7BE,GAAK,EAAI3B,EAAIyB,IAAM,EAAIA,IAAM,EAEnC,MAAO,CAACD,EAAI,IAAKE,EAAI,IAAKC,EAAI,IAAKF,EAAI,GAAG,CAC3C,EAEA,SAASG,EAAoBC,EAAGF,EAAG,CAIlC,OACGE,EAAE,CAAC,EAAIF,EAAE,CAAC,IAAM,GAChBE,EAAE,CAAC,EAAIF,EAAE,CAAC,IAAM,GAChBE,EAAE,CAAC,EAAIF,EAAE,CAAC,IAAM,CAEpB,CAEAb,EAAQ,IAAI,QAAU,SAAU3B,EAAK,CACpC,IAAM2C,EAAWlB,EAAgBzB,CAAG,EACpC,GAAI2C,EACH,OAAOA,EAGR,IAAIC,EAAyB,IACzBC,EAEJ,QAAW9C,KAAW,OAAO,KAAKyB,CAAW,EAAG,CAC/C,IAAMsB,EAAQtB,EAAYzB,CAAO,EAG3BgD,EAAWN,EAAoBzC,EAAK8C,CAAK,EAG3CC,EAAWH,IACdA,EAAyBG,EACzBF,EAAwB9C,EAE1B,CAEA,OAAO8C,CACR,EAEAlB,EAAQ,QAAQ,IAAM,SAAU5B,EAAS,CACxC,OAAOyB,EAAYzB,CAAO,CAC3B,EAEA4B,EAAQ,IAAI,IAAM,SAAU3B,EAAK,CAChC,IAAIe,EAAIf,EAAI,CAAC,EAAI,IACbgB,EAAIhB,EAAI,CAAC,EAAI,IACba,EAAIb,EAAI,CAAC,EAAI,IAGjBe,EAAIA,EAAI,SAAaA,EAAI,MAAS,QAAU,IAAQA,EAAI,MACxDC,EAAIA,EAAI,SAAaA,EAAI,MAAS,QAAU,IAAQA,EAAI,MACxDH,EAAIA,EAAI,SAAaA,EAAI,MAAS,QAAU,IAAQA,EAAI,MAExD,IAAM6B,EAAK3B,EAAI,MAAWC,EAAI,MAAWH,EAAI,MACvC2B,EAAKzB,EAAI,MAAWC,EAAI,MAAWH,EAAI,MACvCmC,EAAKjC,EAAI,MAAWC,EAAI,MAAWH,EAAI,MAE7C,MAAO,CAAC6B,EAAI,IAAKF,EAAI,IAAKQ,EAAI,GAAG,CAClC,EAEArB,EAAQ,IAAI,IAAM,SAAU3B,EAAK,CAChC,IAAMiD,EAAMtB,EAAQ,IAAI,IAAI3B,CAAG,EAC3B0C,EAAIO,EAAI,CAAC,EACTT,EAAIS,EAAI,CAAC,EACTD,EAAIC,EAAI,CAAC,EAEbP,GAAK,OACLF,GAAK,IACLQ,GAAK,QAELN,EAAIA,EAAI,QAAYA,IAAM,EAAI,GAAO,MAAQA,EAAM,GAAK,IACxDF,EAAIA,EAAI,QAAYA,IAAM,EAAI,GAAO,MAAQA,EAAM,GAAK,IACxDQ,EAAIA,EAAI,QAAYA,IAAM,EAAI,GAAO,MAAQA,EAAM,GAAK,IAExD,IAAMvC,EAAK,IAAM+B,EAAK,GAChB9B,EAAI,KAAOgC,EAAIF,GACf3B,EAAI,KAAO2B,EAAIQ,GAErB,MAAO,CAACvC,EAAGC,EAAGG,CAAC,CAChB,EAEAc,EAAQ,IAAI,IAAM,SAAUtB,EAAK,CAChC,IAAME,EAAIF,EAAI,CAAC,EAAI,IACbG,EAAIH,EAAI,CAAC,EAAI,IACbI,EAAIJ,EAAI,CAAC,EAAI,IACf6C,EACAC,EACA1D,EAEJ,GAAIe,IAAM,EACT,OAAAf,EAAMgB,EAAI,IACH,CAAChB,EAAKA,EAAKA,CAAG,EAGlBgB,EAAI,GACPyC,EAAKzC,GAAK,EAAID,GAEd0C,EAAKzC,EAAID,EAAIC,EAAID,EAGlB,IAAM4C,EAAK,EAAI3C,EAAIyC,EAEblD,EAAM,CAAC,EAAG,EAAG,CAAC,EACpB,QAASnB,EAAI,EAAGA,EAAI,EAAGA,IACtBsE,EAAK5C,EAAI,EAAI,EAAI,EAAE1B,EAAI,GACnBsE,EAAK,GACRA,IAGGA,EAAK,GACRA,IAGG,EAAIA,EAAK,EACZ1D,EAAM2D,GAAMF,EAAKE,GAAM,EAAID,EACjB,EAAIA,EAAK,EACnB1D,EAAMyD,EACI,EAAIC,EAAK,EACnB1D,EAAM2D,GAAMF,EAAKE,IAAO,EAAI,EAAID,GAAM,EAEtC1D,EAAM2D,EAGPpD,EAAInB,CAAC,EAAIY,EAAM,IAGhB,OAAOO,CACR,EAEA2B,EAAQ,IAAI,IAAM,SAAUtB,EAAK,CAChC,IAAME,EAAIF,EAAI,CAAC,EACXG,EAAIH,EAAI,CAAC,EAAI,IACbI,EAAIJ,EAAI,CAAC,EAAI,IACbgD,EAAO7C,EACL8C,EAAO,KAAK,IAAI7C,EAAG,GAAI,EAE7BA,GAAK,EACLD,GAAMC,GAAK,EAAKA,EAAI,EAAIA,EACxB4C,GAAQC,GAAQ,EAAIA,EAAO,EAAIA,EAC/B,IAAMpB,GAAKzB,EAAID,GAAK,EACd+C,EAAK9C,IAAM,EAAK,EAAI4C,GAASC,EAAOD,GAAS,EAAI7C,GAAMC,EAAID,GAEjE,MAAO,CAACD,EAAGgD,EAAK,IAAKrB,EAAI,GAAG,CAC7B,EAEAP,EAAQ,IAAI,IAAM,SAAU6B,EAAK,CAChC,IAAMjD,EAAIiD,EAAI,CAAC,EAAI,GACbhD,EAAIgD,EAAI,CAAC,EAAI,IACftB,EAAIsB,EAAI,CAAC,EAAI,IACXC,EAAK,KAAK,MAAMlD,CAAC,EAAI,EAErB,EAAIA,EAAI,KAAK,MAAMA,CAAC,EACpBmD,EAAI,IAAMxB,GAAK,EAAI1B,GACnBmD,EAAI,IAAMzB,GAAK,EAAK1B,EAAI,GACxBoD,EAAI,IAAM1B,GAAK,EAAK1B,GAAK,EAAI,IAGnC,OAFA0B,GAAK,IAEGuB,EAAI,CACX,IAAK,GACJ,MAAO,CAACvB,EAAG0B,EAAGF,CAAC,EAChB,IAAK,GACJ,MAAO,CAACC,EAAGzB,EAAGwB,CAAC,EAChB,IAAK,GACJ,MAAO,CAACA,EAAGxB,EAAG0B,CAAC,EAChB,IAAK,GACJ,MAAO,CAACF,EAAGC,EAAGzB,CAAC,EAChB,IAAK,GACJ,MAAO,CAAC0B,EAAGF,EAAGxB,CAAC,EAChB,IAAK,GACJ,MAAO,CAACA,EAAGwB,EAAGC,CAAC,CACjB,CACD,EAEAhC,EAAQ,IAAI,IAAM,SAAU6B,EAAK,CAChC,IAAMjD,EAAIiD,EAAI,CAAC,EACThD,EAAIgD,EAAI,CAAC,EAAI,IACbtB,EAAIsB,EAAI,CAAC,EAAI,IACbK,EAAO,KAAK,IAAI3B,EAAG,GAAI,EACzB4B,EACArD,EAEJA,GAAK,EAAID,GAAK0B,EACd,IAAMoB,GAAQ,EAAI9C,GAAKqD,EACvB,OAAAC,EAAKtD,EAAIqD,EACTC,GAAOR,GAAQ,EAAKA,EAAO,EAAIA,EAC/BQ,EAAKA,GAAM,EACXrD,GAAK,EAEE,CAACF,EAAGuD,EAAK,IAAKrD,EAAI,GAAG,CAC7B,EAGAkB,EAAQ,IAAI,IAAM,SAAUhB,EAAK,CAChC,IAAMJ,EAAII,EAAI,CAAC,EAAI,IACfoD,EAAKpD,EAAI,CAAC,EAAI,IACdqD,EAAKrD,EAAI,CAAC,EAAI,IACZsD,EAAQF,EAAKC,EACf,EAGAC,EAAQ,IACXF,GAAME,EACND,GAAMC,GAGP,IAAMpF,EAAI,KAAK,MAAM,EAAI0B,CAAC,EACpB2B,EAAI,EAAI8B,EACd,EAAI,EAAIzD,EAAI1B,EAEPA,EAAI,IACR,EAAI,EAAI,GAGT,IAAMqF,EAAIH,EAAK,GAAK7B,EAAI6B,GAEpBhD,EACAC,EACAH,EAEJ,OAAQhC,EAAG,CACV,QACA,IAAK,GACL,IAAK,GAAGkC,EAAImB,EAAIlB,EAAIkD,EAAIrD,EAAIkD,EAAI,MAChC,IAAK,GAAGhD,EAAImD,EAAIlD,EAAIkB,EAAIrB,EAAIkD,EAAI,MAChC,IAAK,GAAGhD,EAAIgD,EAAI/C,EAAIkB,EAAIrB,EAAIqD,EAAG,MAC/B,IAAK,GAAGnD,EAAIgD,EAAI/C,EAAIkD,EAAIrD,EAAIqB,EAAG,MAC/B,IAAK,GAAGnB,EAAImD,EAAIlD,EAAI+C,EAAIlD,EAAIqB,EAAG,MAC/B,IAAK,GAAGnB,EAAImB,EAAIlB,EAAI+C,EAAIlD,EAAIqD,EAAG,KAChC,CAGA,MAAO,CAACnD,EAAI,IAAKC,EAAI,IAAKH,EAAI,GAAG,CAClC,EAEAc,EAAQ,KAAK,IAAM,SAAUwC,EAAM,CAClC,IAAM9B,EAAI8B,EAAK,CAAC,EAAI,IACd5B,EAAI4B,EAAK,CAAC,EAAI,IACd3B,EAAI2B,EAAK,CAAC,EAAI,IACd7B,EAAI6B,EAAK,CAAC,EAAI,IAEdpD,EAAI,EAAI,KAAK,IAAI,EAAGsB,GAAK,EAAIC,GAAKA,CAAC,EACnCtB,EAAI,EAAI,KAAK,IAAI,EAAGuB,GAAK,EAAID,GAAKA,CAAC,EACnCzB,EAAI,EAAI,KAAK,IAAI,EAAG2B,GAAK,EAAIF,GAAKA,CAAC,EAEzC,MAAO,CAACvB,EAAI,IAAKC,EAAI,IAAKH,EAAI,GAAG,CAClC,EAEAc,EAAQ,IAAI,IAAM,SAAUsB,EAAK,CAChC,IAAMP,EAAIO,EAAI,CAAC,EAAI,IACbT,EAAIS,EAAI,CAAC,EAAI,IACbD,EAAIC,EAAI,CAAC,EAAI,IACflC,EACAC,EACAH,EAEJ,OAAAE,EAAK2B,EAAI,OAAWF,EAAI,QAAYQ,EAAI,OACxChC,EAAK0B,EAAI,OAAYF,EAAI,OAAWQ,EAAI,MACxCnC,EAAK6B,EAAI,MAAWF,EAAI,MAAYQ,EAAI,MAGxCjC,EAAIA,EAAI,SACH,MAASA,IAAM,EAAM,KAAS,KAChCA,EAAI,MAEPC,EAAIA,EAAI,SACH,MAASA,IAAM,EAAM,KAAS,KAChCA,EAAI,MAEPH,EAAIA,EAAI,SACH,MAASA,IAAM,EAAM,KAAS,KAChCA,EAAI,MAEPE,EAAI,KAAK,IAAI,KAAK,IAAI,EAAGA,CAAC,EAAG,CAAC,EAC9BC,EAAI,KAAK,IAAI,KAAK,IAAI,EAAGA,CAAC,EAAG,CAAC,EAC9BH,EAAI,KAAK,IAAI,KAAK,IAAI,EAAGA,CAAC,EAAG,CAAC,EAEvB,CAACE,EAAI,IAAKC,EAAI,IAAKH,EAAI,GAAG,CAClC,EAEAc,EAAQ,IAAI,IAAM,SAAUsB,EAAK,CAChC,IAAIP,EAAIO,EAAI,CAAC,EACTT,EAAIS,EAAI,CAAC,EACTD,EAAIC,EAAI,CAAC,EAEbP,GAAK,OACLF,GAAK,IACLQ,GAAK,QAELN,EAAIA,EAAI,QAAYA,IAAM,EAAI,GAAO,MAAQA,EAAM,GAAK,IACxDF,EAAIA,EAAI,QAAYA,IAAM,EAAI,GAAO,MAAQA,EAAM,GAAK,IACxDQ,EAAIA,EAAI,QAAYA,IAAM,EAAI,GAAO,MAAQA,EAAM,GAAK,IAExD,IAAMvC,EAAK,IAAM+B,EAAK,GAChB9B,EAAI,KAAOgC,EAAIF,GACf3B,EAAI,KAAO2B,EAAIQ,GAErB,MAAO,CAACvC,EAAGC,EAAGG,CAAC,CAChB,EAEAc,EAAQ,IAAI,IAAM,SAAUyC,EAAK,CAChC,IAAM3D,EAAI2D,EAAI,CAAC,EACT1D,EAAI0D,EAAI,CAAC,EACTvD,EAAIuD,EAAI,CAAC,EACX1B,EACAF,EACAQ,EAEJR,GAAK/B,EAAI,IAAM,IACfiC,EAAIhC,EAAI,IAAM8B,EACdQ,EAAIR,EAAI3B,EAAI,IAEZ,IAAMwD,EAAK7B,GAAK,EACV8B,EAAK5B,GAAK,EACV6B,EAAKvB,GAAK,EAChB,OAAAR,EAAI6B,EAAK,QAAWA,GAAM7B,EAAI,GAAK,KAAO,MAC1CE,EAAI4B,EAAK,QAAWA,GAAM5B,EAAI,GAAK,KAAO,MAC1CM,EAAIuB,EAAK,QAAWA,GAAMvB,EAAI,GAAK,KAAO,MAE1CN,GAAK,OACLF,GAAK,IACLQ,GAAK,QAEE,CAACN,EAAGF,EAAGQ,CAAC,CAChB,EAEArB,EAAQ,IAAI,IAAM,SAAUyC,EAAK,CAChC,IAAM3D,EAAI2D,EAAI,CAAC,EACT1D,EAAI0D,EAAI,CAAC,EACTvD,EAAIuD,EAAI,CAAC,EACX7D,EAGJA,EADW,KAAK,MAAMM,EAAGH,CAAC,EACjB,IAAM,EAAI,KAAK,GAEpBH,EAAI,IACPA,GAAK,KAGN,IAAM8B,EAAI,KAAK,KAAK3B,EAAIA,EAAIG,EAAIA,CAAC,EAEjC,MAAO,CAACJ,EAAG4B,EAAG9B,CAAC,CAChB,EAEAoB,EAAQ,IAAI,IAAM,SAAU6C,EAAK,CAChC,IAAM/D,EAAI+D,EAAI,CAAC,EACTnC,EAAImC,EAAI,CAAC,EAGTC,EAFID,EAAI,CAAC,EAEA,IAAM,EAAI,KAAK,GACxB9D,EAAI2B,EAAI,KAAK,IAAIoC,CAAE,EACnB5D,EAAIwB,EAAI,KAAK,IAAIoC,CAAE,EAEzB,MAAO,CAAChE,EAAGC,EAAGG,CAAC,CAChB,EAEAc,EAAQ,IAAI,OAAS,SAAUhD,EAAM+F,EAAa,KAAM,CACvD,GAAM,CAAC3D,EAAGC,EAAGH,CAAC,EAAIlC,EACdmE,EAAQ4B,IAAe,KAAO/C,EAAQ,IAAI,IAAIhD,CAAI,EAAE,CAAC,EAAI+F,EAI7D,GAFA5B,EAAQ,KAAK,MAAMA,EAAQ,EAAE,EAEzBA,IAAU,EACb,MAAO,IAGR,IAAI6B,EAAO,IACN,KAAK,MAAM9D,EAAI,GAAG,GAAK,EACxB,KAAK,MAAMG,EAAI,GAAG,GAAK,EACxB,KAAK,MAAMD,EAAI,GAAG,GAErB,OAAI+B,IAAU,IACb6B,GAAQ,IAGFA,CACR,EAEAhD,EAAQ,IAAI,OAAS,SAAUhD,EAAM,CAGpC,OAAOgD,EAAQ,IAAI,OAAOA,EAAQ,IAAI,IAAIhD,CAAI,EAAGA,EAAK,CAAC,CAAC,CACzD,EAEAgD,EAAQ,IAAI,QAAU,SAAUhD,EAAM,CACrC,IAAMoC,EAAIpC,EAAK,CAAC,EACVqC,EAAIrC,EAAK,CAAC,EACVkC,EAAIlC,EAAK,CAAC,EAIhB,OAAIoC,IAAMC,GAAKA,IAAMH,EAChBE,EAAI,EACA,GAGJA,EAAI,IACA,IAGD,KAAK,OAAQA,EAAI,GAAK,IAAO,EAAE,EAAI,IAG9B,GACT,GAAK,KAAK,MAAMA,EAAI,IAAM,CAAC,EAC3B,EAAI,KAAK,MAAMC,EAAI,IAAM,CAAC,EAC3B,KAAK,MAAMH,EAAI,IAAM,CAAC,CAG1B,EAEAc,EAAQ,OAAO,IAAM,SAAUhD,EAAM,CACpC,IAAIiG,EAAQjG,EAAO,GAGnB,GAAIiG,IAAU,GAAKA,IAAU,EAC5B,OAAIjG,EAAO,KACViG,GAAS,KAGVA,EAAQA,EAAQ,KAAO,IAEhB,CAACA,EAAOA,EAAOA,CAAK,EAG5B,IAAMC,GAAQ,CAAC,EAAElG,EAAO,IAAM,GAAK,GAC7BoC,GAAM6D,EAAQ,GAAKC,EAAQ,IAC3B7D,GAAO4D,GAAS,EAAK,GAAKC,EAAQ,IAClChE,GAAO+D,GAAS,EAAK,GAAKC,EAAQ,IAExC,MAAO,CAAC9D,EAAGC,EAAGH,CAAC,CAChB,EAEAc,EAAQ,QAAQ,IAAM,SAAUhD,EAAM,CAErC,GAAIA,GAAQ,IAAK,CAChB,IAAM0D,GAAK1D,EAAO,KAAO,GAAK,EAC9B,MAAO,CAAC0D,EAAGA,EAAGA,CAAC,CAChB,CAEA1D,GAAQ,GAER,IAAImG,EACE/D,EAAI,KAAK,MAAMpC,EAAO,EAAE,EAAI,EAAI,IAChCqC,EAAI,KAAK,OAAO8D,EAAMnG,EAAO,IAAM,CAAC,EAAI,EAAI,IAC5CkC,EAAKiE,EAAM,EAAK,EAAI,IAE1B,MAAO,CAAC/D,EAAGC,EAAGH,CAAC,CAChB,EAEAc,EAAQ,IAAI,IAAM,SAAUhD,EAAM,CAKjC,IAAMY,KAJY,KAAK,MAAMZ,EAAK,CAAC,CAAC,EAAI,MAAS,MAC5C,KAAK,MAAMA,EAAK,CAAC,CAAC,EAAI,MAAS,IAChC,KAAK,MAAMA,EAAK,CAAC,CAAC,EAAI,MAEH,SAAS,EAAE,EAAE,YAAY,EAChD,MAAO,SAAS,UAAUY,EAAO,MAAM,EAAIA,CAC5C,EAEAoC,EAAQ,IAAI,IAAM,SAAUhD,EAAM,CACjC,IAAMsB,EAAQtB,EAAK,SAAS,EAAE,EAAE,MAAM,0BAA0B,EAChE,GAAI,CAACsB,EACJ,MAAO,CAAC,EAAG,EAAG,CAAC,EAGhB,IAAI8E,EAAc9E,EAAM,CAAC,EAErBA,EAAM,CAAC,EAAE,SAAW,IACvB8E,EAAcA,EAAY,MAAM,EAAE,EAAE,IAAIC,GAChCA,EAAOA,CACd,EAAE,KAAK,EAAE,GAGX,IAAMC,EAAU,SAASF,EAAa,EAAE,EAClChE,EAAKkE,GAAW,GAAM,IACtBjE,EAAKiE,GAAW,EAAK,IACrBpE,EAAIoE,EAAU,IAEpB,MAAO,CAAClE,EAAGC,EAAGH,CAAC,CAChB,EAEAc,EAAQ,IAAI,IAAM,SAAU3B,EAAK,CAChC,IAAMe,EAAIf,EAAI,CAAC,EAAI,IACbgB,EAAIhB,EAAI,CAAC,EAAI,IACba,EAAIb,EAAI,CAAC,EAAI,IACbqB,EAAM,KAAK,IAAI,KAAK,IAAIN,EAAGC,CAAC,EAAGH,CAAC,EAChCO,EAAM,KAAK,IAAI,KAAK,IAAIL,EAAGC,CAAC,EAAGH,CAAC,EAChCqE,EAAU7D,EAAMD,EAClB+D,EACAC,EAEJ,OAAIF,EAAS,EACZC,EAAY/D,GAAO,EAAI8D,GAEvBC,EAAY,EAGTD,GAAU,EACbE,EAAM,EAEH/D,IAAQN,EACXqE,GAAQpE,EAAIH,GAAKqE,EAAU,EAExB7D,IAAQL,EACXoE,EAAM,GAAKvE,EAAIE,GAAKmE,EAEpBE,EAAM,GAAKrE,EAAIC,GAAKkE,EAGrBE,GAAO,EACPA,GAAO,EAEA,CAACA,EAAM,IAAKF,EAAS,IAAKC,EAAY,GAAG,CACjD,EAEAxD,EAAQ,IAAI,IAAM,SAAUtB,EAAK,CAChC,IAAMG,EAAIH,EAAI,CAAC,EAAI,IACb,EAAIA,EAAI,CAAC,EAAI,IAEbgC,EAAI,EAAI,GAAO,EAAM7B,EAAI,EAAM,EAAMA,GAAK,EAAM,GAElD6E,EAAI,EACR,OAAIhD,EAAI,IACPgD,GAAK,EAAI,GAAMhD,IAAM,EAAMA,IAGrB,CAAChC,EAAI,CAAC,EAAGgC,EAAI,IAAKgD,EAAI,GAAG,CACjC,EAEA1D,EAAQ,IAAI,IAAM,SAAU6B,EAAK,CAChC,IAAMhD,EAAIgD,EAAI,CAAC,EAAI,IACbtB,EAAIsB,EAAI,CAAC,EAAI,IAEbnB,EAAI7B,EAAI0B,EACVmD,EAAI,EAER,OAAIhD,EAAI,IACPgD,GAAKnD,EAAIG,IAAM,EAAIA,IAGb,CAACmB,EAAI,CAAC,EAAGnB,EAAI,IAAKgD,EAAI,GAAG,CACjC,EAEA1D,EAAQ,IAAI,IAAM,SAAU2D,EAAK,CAChC,IAAM/E,EAAI+E,EAAI,CAAC,EAAI,IACbjD,EAAIiD,EAAI,CAAC,EAAI,IACbtE,EAAIsE,EAAI,CAAC,EAAI,IAEnB,GAAIjD,IAAM,EACT,MAAO,CAACrB,EAAI,IAAKA,EAAI,IAAKA,EAAI,GAAG,EAGlC,IAAMuE,EAAO,CAAC,EAAG,EAAG,CAAC,EACf9B,EAAMlD,EAAI,EAAK,EACf2B,EAAIuB,EAAK,EACT7C,EAAI,EAAIsB,EACVsD,EAAK,EAGT,OAAQ,KAAK,MAAM/B,CAAE,EAAG,CACvB,IAAK,GACJ8B,EAAK,CAAC,EAAI,EAAGA,EAAK,CAAC,EAAIrD,EAAGqD,EAAK,CAAC,EAAI,EAAG,MACxC,IAAK,GACJA,EAAK,CAAC,EAAI3E,EAAG2E,EAAK,CAAC,EAAI,EAAGA,EAAK,CAAC,EAAI,EAAG,MACxC,IAAK,GACJA,EAAK,CAAC,EAAI,EAAGA,EAAK,CAAC,EAAI,EAAGA,EAAK,CAAC,EAAIrD,EAAG,MACxC,IAAK,GACJqD,EAAK,CAAC,EAAI,EAAGA,EAAK,CAAC,EAAI3E,EAAG2E,EAAK,CAAC,EAAI,EAAG,MACxC,IAAK,GACJA,EAAK,CAAC,EAAIrD,EAAGqD,EAAK,CAAC,EAAI,EAAGA,EAAK,CAAC,EAAI,EAAG,MACxC,QACCA,EAAK,CAAC,EAAI,EAAGA,EAAK,CAAC,EAAI,EAAGA,EAAK,CAAC,EAAI3E,CACtC,CAGA,OAAA4E,GAAM,EAAMnD,GAAKrB,EAEV,EACLqB,EAAIkD,EAAK,CAAC,EAAIC,GAAM,KACpBnD,EAAIkD,EAAK,CAAC,EAAIC,GAAM,KACpBnD,EAAIkD,EAAK,CAAC,EAAIC,GAAM,GACtB,CACD,EAEA7D,EAAQ,IAAI,IAAM,SAAU2D,EAAK,CAChC,IAAMjD,EAAIiD,EAAI,CAAC,EAAI,IACbtE,EAAIsE,EAAI,CAAC,EAAI,IAEbpD,EAAIG,EAAIrB,GAAK,EAAMqB,GACrBgD,EAAI,EAER,OAAInD,EAAI,IACPmD,EAAIhD,EAAIH,GAGF,CAACoD,EAAI,CAAC,EAAGD,EAAI,IAAKnD,EAAI,GAAG,CACjC,EAEAP,EAAQ,IAAI,IAAM,SAAU2D,EAAK,CAChC,IAAMjD,EAAIiD,EAAI,CAAC,EAAI,IAGb7E,EAFI6E,EAAI,CAAC,EAAI,KAEJ,EAAMjD,GAAK,GAAMA,EAC5B7B,EAAI,EAER,OAAIC,EAAI,GAAOA,EAAI,GAClBD,EAAI6B,GAAK,EAAI5B,GAEVA,GAAK,IAAOA,EAAI,IACnBD,EAAI6B,GAAK,GAAK,EAAI5B,KAGZ,CAAC6E,EAAI,CAAC,EAAG9E,EAAI,IAAKC,EAAI,GAAG,CACjC,EAEAkB,EAAQ,IAAI,IAAM,SAAU2D,EAAK,CAChC,IAAMjD,EAAIiD,EAAI,CAAC,EAAI,IACbtE,EAAIsE,EAAI,CAAC,EAAI,IACbpD,EAAIG,EAAIrB,GAAK,EAAMqB,GACzB,MAAO,CAACiD,EAAI,CAAC,GAAIpD,EAAIG,GAAK,KAAM,EAAIH,GAAK,GAAG,CAC7C,EAEAP,EAAQ,IAAI,IAAM,SAAUhB,EAAK,CAChC,IAAMC,EAAID,EAAI,CAAC,EAAI,IAEbuB,EAAI,EADAvB,EAAI,CAAC,EAAI,IAEb,EAAIuB,EAAItB,EACVI,EAAI,EAER,OAAI,EAAI,IACPA,GAAKkB,EAAI,IAAM,EAAI,IAGb,CAACvB,EAAI,CAAC,EAAG,EAAI,IAAKK,EAAI,GAAG,CACjC,EAEAW,EAAQ,MAAM,IAAM,SAAU8D,EAAO,CACpC,MAAO,CAAEA,EAAM,CAAC,EAAI,MAAS,IAAMA,EAAM,CAAC,EAAI,MAAS,IAAMA,EAAM,CAAC,EAAI,MAAS,GAAG,CACrF,EAEA9D,EAAQ,IAAI,MAAQ,SAAU3B,EAAK,CAClC,MAAO,CAAEA,EAAI,CAAC,EAAI,IAAO,MAAQA,EAAI,CAAC,EAAI,IAAO,MAAQA,EAAI,CAAC,EAAI,IAAO,KAAK,CAC/E,EAEA2B,EAAQ,KAAK,IAAM,SAAUhD,EAAM,CAClC,MAAO,CAACA,EAAK,CAAC,EAAI,IAAM,IAAKA,EAAK,CAAC,EAAI,IAAM,IAAKA,EAAK,CAAC,EAAI,IAAM,GAAG,CACtE,EAEAgD,EAAQ,KAAK,IAAM,SAAUhD,EAAM,CAClC,MAAO,CAAC,EAAG,EAAGA,EAAK,CAAC,CAAC,CACtB,EAEAgD,EAAQ,KAAK,IAAMA,EAAQ,KAAK,IAEhCA,EAAQ,KAAK,IAAM,SAAU+D,EAAM,CAClC,MAAO,CAAC,EAAG,IAAKA,EAAK,CAAC,CAAC,CACxB,EAEA/D,EAAQ,KAAK,KAAO,SAAU+D,EAAM,CACnC,MAAO,CAAC,EAAG,EAAG,EAAGA,EAAK,CAAC,CAAC,CACzB,EAEA/D,EAAQ,KAAK,IAAM,SAAU+D,EAAM,CAClC,MAAO,CAACA,EAAK,CAAC,EAAG,EAAG,CAAC,CACtB,EAEA/D,EAAQ,KAAK,IAAM,SAAU+D,EAAM,CAClC,IAAMjG,EAAM,KAAK,MAAMiG,EAAK,CAAC,EAAI,IAAM,GAAG,EAAI,IAGxCnG,IAFWE,GAAO,KAAOA,GAAO,GAAKA,GAEpB,SAAS,EAAE,EAAE,YAAY,EAChD,MAAO,SAAS,UAAUF,EAAO,MAAM,EAAIA,CAC5C,EAEAoC,EAAQ,IAAI,KAAO,SAAU3B,EAAK,CAEjC,MAAO,EADMA,EAAI,CAAC,EAAIA,EAAI,CAAC,EAAIA,EAAI,CAAC,GAAK,EAC3B,IAAM,GAAG,CACxB,CAAA,CAAA,CAAA,ECt0BA2F,GAAA1H,GAAA,CAAA,mFAAAC,EAAAC,EAAA,CAAA,aAAA,IAAMyH,EAAcrE,GAAA,EAapB,SAASsE,GAAa,CACrB,IAAMC,EAAQ,CAAC,EAETC,EAAS,OAAO,KAAKH,CAAW,EAEtC,QAAS9G,EAAMiH,EAAO,OAAQlH,EAAI,EAAGA,EAAIC,EAAKD,IAC7CiH,EAAMC,EAAOlH,CAAC,CAAC,EAAI,CAGlB,SAAU,GACV,OAAQ,IACT,EAGD,OAAOiH,CACR,CAGA,SAASE,EAAUC,EAAW,CAC7B,IAAMH,EAAQD,EAAW,EACnBK,EAAQ,CAACD,CAAS,EAIxB,IAFAH,EAAMG,CAAS,EAAE,SAAW,EAErBC,EAAM,QAAQ,CACpB,IAAMC,EAAUD,EAAM,IAAI,EACpBE,EAAY,OAAO,KAAKR,EAAYO,CAAO,CAAC,EAElD,QAASrH,EAAMsH,EAAU,OAAQvH,EAAI,EAAGA,EAAIC,EAAKD,IAAK,CACrD,IAAMwH,EAAWD,EAAUvH,CAAC,EACtByH,EAAOR,EAAMO,CAAQ,EAEvBC,EAAK,WAAa,KACrBA,EAAK,SAAWR,EAAMK,CAAO,EAAE,SAAW,EAC1CG,EAAK,OAASH,EACdD,EAAM,QAAQG,CAAQ,EAExB,CACD,CAEA,OAAOP,CACR,CAEA,SAASS,EAAKC,EAAMC,EAAI,CACvB,OAAO,SAAU9H,EAAM,CACtB,OAAO8H,EAAGD,EAAK7H,CAAI,CAAC,CACrB,CACD,CAEA,SAAS+H,EAAeC,EAASb,EAAO,CACvC,IAAMc,EAAO,CAACd,EAAMa,CAAO,EAAE,OAAQA,CAAO,EACxC3H,EAAK4G,EAAYE,EAAMa,CAAO,EAAE,MAAM,EAAEA,CAAO,EAE/CE,EAAMf,EAAMa,CAAO,EAAE,OACzB,KAAOb,EAAMe,CAAG,EAAE,QACjBD,EAAK,QAAQd,EAAMe,CAAG,EAAE,MAAM,EAC9B7H,EAAKuH,EAAKX,EAAYE,EAAMe,CAAG,EAAE,MAAM,EAAEA,CAAG,EAAG7H,CAAE,EACjD6H,EAAMf,EAAMe,CAAG,EAAE,OAGlB,OAAA7H,EAAG,WAAa4H,EACT5H,CACR,CAEAb,EAAO,QAAU,SAAU8H,EAAW,CACrC,IAAMH,EAAQE,EAAUC,CAAS,EAC3Ba,EAAa,CAAC,EAEdf,EAAS,OAAO,KAAKD,CAAK,EAChC,QAAShH,EAAMiH,EAAO,OAAQlH,EAAI,EAAGA,EAAIC,EAAKD,IAAK,CAClD,IAAM8H,EAAUZ,EAAOlH,CAAC,EACXiH,EAAMa,CAAO,EAEjB,SAAW,OAKpBG,EAAWH,CAAO,EAAID,EAAeC,EAASb,CAAK,EACpD,CAEA,OAAOgB,CACR,CAAA,CAAA,CAAA,EC/FAC,GAAA9I,GAAA,CAAA,mFAAAC,EAAAC,EAAA,CAAA,aAAA,IAAMyH,EAAcrE,GAAA,EACdyF,EAAQrB,GAAA,EAERhE,EAAU,CAAC,EAEXoE,EAAS,OAAO,KAAKH,CAAW,EAEtC,SAASqB,EAAQjI,EAAI,CACpB,IAAMkI,EAAY,YAAavI,EAAM,CACpC,IAAMwI,EAAOxI,EAAK,CAAC,EACnB,OAA0BwI,GAAS,KAC3BA,GAGJA,EAAK,OAAS,IACjBxI,EAAOwI,GAGDnI,EAAGL,CAAI,EACf,EAGA,MAAI,eAAgBK,IACnBkI,EAAU,WAAalI,EAAG,YAGpBkI,CACR,CAEA,SAASE,EAAYpI,EAAI,CACxB,IAAMkI,EAAY,YAAavI,EAAM,CACpC,IAAMwI,EAAOxI,EAAK,CAAC,EAEnB,GAA0BwI,GAAS,KAClC,OAAOA,EAGJA,EAAK,OAAS,IACjBxI,EAAOwI,GAGR,IAAME,EAASrI,EAAGL,CAAI,EAKtB,GAAI,OAAO0I,GAAW,SACrB,QAASvI,EAAMuI,EAAO,OAAQxI,EAAI,EAAGA,EAAIC,EAAKD,IAC7CwI,EAAOxI,CAAC,EAAI,KAAK,MAAMwI,EAAOxI,CAAC,CAAC,EAIlC,OAAOwI,CACR,EAGA,MAAI,eAAgBrI,IACnBkI,EAAU,WAAalI,EAAG,YAGpBkI,CACR,CAEAnB,EAAO,QAAQE,GAAa,CAC3BtE,EAAQsE,CAAS,EAAI,CAAC,EAEtB,OAAO,eAAetE,EAAQsE,CAAS,EAAG,WAAY,CAAC,MAAOL,EAAYK,CAAS,EAAE,QAAQ,CAAC,EAC9F,OAAO,eAAetE,EAAQsE,CAAS,EAAG,SAAU,CAAC,MAAOL,EAAYK,CAAS,EAAE,MAAM,CAAC,EAE1F,IAAMqB,EAASN,EAAMf,CAAS,EACV,OAAO,KAAKqB,CAAM,EAE1B,QAAQX,GAAW,CAC9B,IAAM3H,EAAKsI,EAAOX,CAAO,EAEzBhF,EAAQsE,CAAS,EAAEU,CAAO,EAAIS,EAAYpI,CAAE,EAC5C2C,EAAQsE,CAAS,EAAEU,CAAO,EAAE,IAAMM,EAAQjI,CAAE,CAC7C,CAAC,CACF,CAAC,EAEDb,EAAO,QAAUwD,CAAA,CAAA,CAAA,EChFjB4F,GAAAtJ,GAAA,CAAA,mEAAAC,EAAAC,EAAA,CAAA,aAAA,IAAM4G,EAAc9F,GAAA,EACd0C,EAAUoF,GAAA,EAEVS,EAAgB,CAErB,UAGA,OAGA,KACD,EAEMC,EAAkB,CAAC,EACzB,QAAW/H,KAAS,OAAO,KAAKiC,CAAO,EACtC8F,EAAgB,CAAC,GAAG9F,EAAQjC,CAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAIA,EAG/D,IAAMgI,EAAW,CAAC,EAElB,SAASC,EAAMC,EAAQlI,EAAO,CAC7B,GAAI,EAAE,gBAAgBiI,GACrB,OAAO,IAAIA,EAAMC,EAAQlI,CAAK,EAO/B,GAJIA,GAASA,KAAS8H,IACrB9H,EAAQ,MAGLA,GAAS,EAAEA,KAASiC,GACvB,MAAM,IAAI,MAAM,kBAAoBjC,CAAK,EAG1C,IAAIb,EACA+C,EAEJ,GAAIgG,GAAU,KACb,KAAK,MAAQ,MACb,KAAK,MAAQ,CAAC,EAAG,EAAG,CAAC,EACrB,KAAK,OAAS,UACJA,aAAkBD,EAC5B,KAAK,MAAQC,EAAO,MACpB,KAAK,MAAQ,CAAC,GAAGA,EAAO,KAAK,EAC7B,KAAK,OAASA,EAAO,eACX,OAAOA,GAAW,SAAU,CACtC,IAAMP,EAAStC,EAAY,IAAI6C,CAAM,EACrC,GAAIP,IAAW,KACd,MAAM,IAAI,MAAM,sCAAwCO,CAAM,EAG/D,KAAK,MAAQP,EAAO,MACpBzF,EAAWD,EAAQ,KAAK,KAAK,EAAE,SAC/B,KAAK,MAAQ0F,EAAO,MAAM,MAAM,EAAGzF,CAAQ,EAC3C,KAAK,OAAS,OAAOyF,EAAO,MAAMzF,CAAQ,GAAM,SAAWyF,EAAO,MAAMzF,CAAQ,EAAI,CACrF,SAAWgG,EAAO,OAAS,EAAG,CAC7B,KAAK,MAAQlI,GAAS,MACtBkC,EAAWD,EAAQ,KAAK,KAAK,EAAE,SAC/B,IAAMkG,EAAW,MAAM,UAAU,MAAM,KAAKD,EAAQ,EAAGhG,CAAQ,EAC/D,KAAK,MAAQkG,EAAUD,EAAUjG,CAAQ,EACzC,KAAK,OAAS,OAAOgG,EAAOhG,CAAQ,GAAM,SAAWgG,EAAOhG,CAAQ,EAAI,CACzE,SAAW,OAAOgG,GAAW,SAE5B,KAAK,MAAQ,MACb,KAAK,MAAQ,CACXA,GAAU,GAAM,IAChBA,GAAU,EAAK,IAChBA,EAAS,GACV,EACA,KAAK,OAAS,MACR,CACN,KAAK,OAAS,EAEd,IAAMG,EAAO,OAAO,KAAKH,CAAM,EAC3B,UAAWA,IACdG,EAAK,OAAOA,EAAK,QAAQ,OAAO,EAAG,CAAC,EACpC,KAAK,OAAS,OAAOH,EAAO,OAAU,SAAWA,EAAO,MAAQ,GAGjE,IAAMI,EAAaD,EAAK,KAAK,EAAE,KAAK,EAAE,EACtC,GAAI,EAAEC,KAAcP,GACnB,MAAM,IAAI,MAAM,sCAAwC,KAAK,UAAUG,CAAM,CAAC,EAG/E,KAAK,MAAQH,EAAgBO,CAAU,EAEvC,GAAM,CAAC,OAAAnG,CAAM,EAAIF,EAAQ,KAAK,KAAK,EAC7BiD,EAAQ,CAAC,EACf,IAAK/F,EAAI,EAAGA,EAAIgD,EAAO,OAAQhD,IAC9B+F,EAAM,KAAKgD,EAAO/F,EAAOhD,CAAC,CAAC,CAAC,EAG7B,KAAK,MAAQiJ,EAAUlD,CAAK,CAC7B,CAGA,GAAI8C,EAAS,KAAK,KAAK,EAEtB,IADA9F,EAAWD,EAAQ,KAAK,KAAK,EAAE,SAC1B9C,EAAI,EAAGA,EAAI+C,EAAU/C,IAAK,CAC9B,IAAMoJ,EAAQP,EAAS,KAAK,KAAK,EAAE7I,CAAC,EAChCoJ,IACH,KAAK,MAAMpJ,CAAC,EAAIoJ,EAAM,KAAK,MAAMpJ,CAAC,CAAC,EAErC,CAGD,KAAK,OAAS,KAAK,IAAI,EAAG,KAAK,IAAI,EAAG,KAAK,MAAM,CAAC,EAE9C,OAAO,QACV,OAAO,OAAO,IAAI,CAEpB,CAEA8I,EAAM,UAAY,CACjB,UAAW,CACV,OAAO,KAAK,OAAO,CACpB,EAEA,QAAS,CACR,OAAO,KAAK,KAAK,KAAK,EAAE,CACzB,EAEA,OAAOO,EAAQ,CACd,IAAIC,EAAO,KAAK,SAASpD,EAAY,GAAK,KAAO,KAAK,IAAI,EAC1DoD,EAAOA,EAAK,MAAM,OAAOD,GAAW,SAAWA,EAAS,CAAC,EACzD,IAAMvJ,EAAOwJ,EAAK,SAAW,EAAIA,EAAK,MAAQ,CAAC,GAAGA,EAAK,MAAO,KAAK,MAAM,EACzE,OAAOpD,EAAY,GAAGoD,EAAK,KAAK,EAAExJ,CAAI,CACvC,EAEA,cAAcuJ,EAAQ,CACrB,IAAMC,EAAO,KAAK,IAAI,EAAE,MAAM,OAAOD,GAAW,SAAWA,EAAS,CAAC,EAC/DvJ,EAAOwJ,EAAK,SAAW,EAAIA,EAAK,MAAQ,CAAC,GAAGA,EAAK,MAAO,KAAK,MAAM,EACzE,OAAOpD,EAAY,GAAG,IAAI,QAAQpG,CAAI,CACvC,EAEA,OAAQ,CACP,OAAO,KAAK,SAAW,EAAI,CAAC,GAAG,KAAK,KAAK,EAAI,CAAC,GAAG,KAAK,MAAO,KAAK,MAAM,CACzE,EAEA,QAAS,CACR,IAAM0I,EAAS,CAAC,EACV,CAAC,SAAAzF,CAAQ,EAAID,EAAQ,KAAK,KAAK,EAC/B,CAAC,OAAAE,CAAM,EAAIF,EAAQ,KAAK,KAAK,EAEnC,QAAS9C,EAAI,EAAGA,EAAI+C,EAAU/C,IAC7BwI,EAAOxF,EAAOhD,CAAC,CAAC,EAAI,KAAK,MAAMA,CAAC,EAGjC,OAAI,KAAK,SAAW,IACnBwI,EAAO,MAAQ,KAAK,QAGdA,CACR,EAEA,WAAY,CACX,IAAMrH,EAAM,KAAK,IAAI,EAAE,MACvB,OAAAA,EAAI,CAAC,GAAK,IACVA,EAAI,CAAC,GAAK,IACVA,EAAI,CAAC,GAAK,IAEN,KAAK,SAAW,GACnBA,EAAI,KAAK,KAAK,MAAM,EAGdA,CACR,EAEA,YAAa,CACZ,IAAMA,EAAM,KAAK,IAAI,EAAE,OAAO,EAC9B,OAAAA,EAAI,GAAK,IACTA,EAAI,GAAK,IACTA,EAAI,GAAK,IAEL,KAAK,SAAW,IACnBA,EAAI,MAAQ,KAAK,QAGXA,CACR,EAEA,MAAMkI,EAAQ,CACb,OAAAA,EAAS,KAAK,IAAIA,GAAU,EAAG,CAAC,EACzB,IAAIP,EAAM,CAAC,GAAG,KAAK,MAAM,IAAIS,EAAaF,CAAM,CAAC,EAAG,KAAK,MAAM,EAAG,KAAK,KAAK,CACpF,EAEA,MAAMpF,EAAO,CACZ,OAAIA,IAAU,OACN,IAAI6E,EAAM,CAAC,GAAG,KAAK,MAAO,KAAK,IAAI,EAAG,KAAK,IAAI,EAAG7E,CAAK,CAAC,CAAC,EAAG,KAAK,KAAK,EAGvE,KAAK,MACb,EAGA,IAAKuF,EAAO,MAAO,EAAGC,EAAM,GAAG,CAAC,EAChC,MAAOD,EAAO,MAAO,EAAGC,EAAM,GAAG,CAAC,EAClC,KAAMD,EAAO,MAAO,EAAGC,EAAM,GAAG,CAAC,EAEjC,IAAKD,EAAO,CAAC,MAAO,MAAO,MAAO,MAAO,KAAK,EAAG,EAAGvF,IAAWA,EAAQ,IAAO,KAAO,GAAG,EAExF,YAAauF,EAAO,MAAO,EAAGC,EAAM,GAAG,CAAC,EACxC,UAAWD,EAAO,MAAO,EAAGC,EAAM,GAAG,CAAC,EAEtC,YAAaD,EAAO,MAAO,EAAGC,EAAM,GAAG,CAAC,EACxC,MAAOD,EAAO,MAAO,EAAGC,EAAM,GAAG,CAAC,EAElC,OAAQD,EAAO,MAAO,EAAGC,EAAM,GAAG,CAAC,EACnC,KAAMD,EAAO,MAAO,EAAGC,EAAM,GAAG,CAAC,EAEjC,MAAOD,EAAO,MAAO,EAAGC,EAAM,GAAG,CAAC,EAClC,OAAQD,EAAO,MAAO,EAAGC,EAAM,GAAG,CAAC,EAEnC,KAAMD,EAAO,OAAQ,EAAGC,EAAM,GAAG,CAAC,EAClC,QAASD,EAAO,OAAQ,EAAGC,EAAM,GAAG,CAAC,EACrC,OAAQD,EAAO,OAAQ,EAAGC,EAAM,GAAG,CAAC,EACpC,MAAOD,EAAO,OAAQ,EAAGC,EAAM,GAAG,CAAC,EAEnC,EAAGD,EAAO,MAAO,EAAGC,EAAM,MAAM,CAAC,EACjC,EAAGD,EAAO,MAAO,EAAGC,EAAM,GAAG,CAAC,EAC9B,EAAGD,EAAO,MAAO,EAAGC,EAAM,OAAO,CAAC,EAElC,EAAGD,EAAO,MAAO,EAAGC,EAAM,GAAG,CAAC,EAC9B,EAAGD,EAAO,MAAO,CAAC,EAClB,EAAGA,EAAO,MAAO,CAAC,EAElB,QAAQvF,EAAO,CACd,OAAIA,IAAU,OACN,IAAI6E,EAAM7E,CAAK,EAGhBnB,EAAQ,KAAK,KAAK,EAAE,QAAQ,KAAK,KAAK,CAC9C,EAEA,IAAImB,EAAO,CACV,OAAIA,IAAU,OACN,IAAI6E,EAAM7E,CAAK,EAGhBiC,EAAY,GAAG,IAAI,KAAK,IAAI,EAAE,MAAM,EAAE,KAAK,CACnD,EAEA,KAAKjC,EAAO,CACX,GAAIA,IAAU,OACb,OAAO,IAAI6E,EAAM7E,CAAK,EAGvB,IAAMyF,EAAW,KAAK,IAAI,EAAE,MAAM,EAAE,MAEhCC,EAAW,KAAK,MAAM,KAAK,OAAS,GAAG,EAAE,SAAS,EAAE,EAAE,YAAY,EACtE,OAAIA,EAAS,SAAW,IACvBA,EAAW,IAAMA,GAGXzD,EAAY,GAAG,IAAIwD,CAAQ,EAAIC,CACvC,EAEA,WAAY,CACX,IAAMxI,EAAM,KAAK,IAAI,EAAE,MACvB,OAASA,EAAI,CAAC,EAAI,MAAS,IAAQA,EAAI,CAAC,EAAI,MAAS,EAAMA,EAAI,CAAC,EAAI,GACrE,EAEA,YAAa,CAEZ,IAAMA,EAAM,KAAK,IAAI,EAAE,MAEjByI,EAAM,CAAC,EACb,OAAW,CAAC5J,EAAG6J,CAAO,IAAK1I,EAAI,QAAQ,EAAG,CACzC,IAAM2I,EAAOD,EAAU,IACvBD,EAAI5J,CAAC,EAAK8J,GAAQ,OAAWA,EAAO,QAAUA,EAAO,MAAS,QAAU,GACzE,CAEA,MAAO,OAASF,EAAI,CAAC,EAAI,MAASA,EAAI,CAAC,EAAI,MAASA,EAAI,CAAC,CAC1D,EAEA,SAASG,EAAQ,CAEhB,IAAMC,EAAO,KAAK,WAAW,EACvBC,EAAOF,EAAO,WAAW,EAE/B,OAAIC,EAAOC,GACFD,EAAO,MAASC,EAAO,MAGxBA,EAAO,MAASD,EAAO,IAChC,EAEA,MAAMD,EAAQ,CAEb,IAAMG,EAAgB,KAAK,SAASH,CAAM,EAC1C,OAAIG,GAAiB,EACb,MAGAA,GAAiB,IAAO,KAAO,EACxC,EAEA,QAAS,CAER,IAAM/I,EAAM,KAAK,IAAI,EAAE,MAEvB,OADaA,EAAI,CAAC,EAAI,KAAOA,EAAI,CAAC,EAAI,KAAOA,EAAI,CAAC,EAAI,KAAO,IAChD,GACd,EAEA,SAAU,CACT,MAAO,CAAC,KAAK,OAAO,CACrB,EAEA,QAAS,CACR,IAAMA,EAAM,KAAK,IAAI,EACrB,QAASnB,EAAI,EAAGA,EAAI,EAAGA,IACtBmB,EAAI,MAAMnB,CAAC,EAAI,IAAMmB,EAAI,MAAMnB,CAAC,EAGjC,OAAOmB,CACR,EAEA,QAAQiE,EAAO,CACd,IAAM5D,EAAM,KAAK,IAAI,EACrB,OAAAA,EAAI,MAAM,CAAC,GAAKA,EAAI,MAAM,CAAC,EAAI4D,EACxB5D,CACR,EAEA,OAAO4D,EAAO,CACb,IAAM5D,EAAM,KAAK,IAAI,EACrB,OAAAA,EAAI,MAAM,CAAC,GAAKA,EAAI,MAAM,CAAC,EAAI4D,EACxB5D,CACR,EAEA,SAAS4D,EAAO,CACf,IAAM5D,EAAM,KAAK,IAAI,EACrB,OAAAA,EAAI,MAAM,CAAC,GAAKA,EAAI,MAAM,CAAC,EAAI4D,EACxB5D,CACR,EAEA,WAAW4D,EAAO,CACjB,IAAM5D,EAAM,KAAK,IAAI,EACrB,OAAAA,EAAI,MAAM,CAAC,GAAKA,EAAI,MAAM,CAAC,EAAI4D,EACxB5D,CACR,EAEA,OAAO4D,EAAO,CACb,IAAMtD,EAAM,KAAK,IAAI,EACrB,OAAAA,EAAI,MAAM,CAAC,GAAKA,EAAI,MAAM,CAAC,EAAIsD,EACxBtD,CACR,EAEA,QAAQsD,EAAO,CACd,IAAMtD,EAAM,KAAK,IAAI,EACrB,OAAAA,EAAI,MAAM,CAAC,GAAKA,EAAI,MAAM,CAAC,EAAIsD,EACxBtD,CACR,EAEA,WAAY,CAEX,IAAMX,EAAM,KAAK,IAAI,EAAE,MACjB8C,EAAQ9C,EAAI,CAAC,EAAI,GAAMA,EAAI,CAAC,EAAI,IAAOA,EAAI,CAAC,EAAI,IACtD,OAAO2H,EAAM,IAAI7E,EAAOA,EAAOA,CAAK,CACrC,EAEA,KAAKmB,EAAO,CACX,OAAO,KAAK,MAAM,KAAK,OAAU,KAAK,OAASA,CAAM,CACtD,EAEA,QAAQA,EAAO,CACd,OAAO,KAAK,MAAM,KAAK,OAAU,KAAK,OAASA,CAAM,CACtD,EAEA,OAAO+E,EAAS,CACf,IAAM3I,EAAM,KAAK,IAAI,EACjB+E,EAAM/E,EAAI,MAAM,CAAC,EACrB,OAAA+E,GAAOA,EAAM4D,GAAW,IACxB5D,EAAMA,EAAM,EAAI,IAAMA,EAAMA,EAC5B/E,EAAI,MAAM,CAAC,EAAI+E,EACR/E,CACR,EAEA,IAAI4I,EAAYC,EAAQ,CAGvB,GAAI,CAACD,GAAc,CAACA,EAAW,IAC9B,MAAM,IAAI,MAAM,yEAA2E,OAAOA,CAAU,EAG7G,IAAME,EAASF,EAAW,IAAI,EACxBL,EAAS,KAAK,IAAI,EAClBlF,EAAIwF,IAAW,OAAY,GAAMA,EAEjCtI,EAAI,EAAI8C,EAAI,EACZhD,EAAIyI,EAAO,MAAM,EAAIP,EAAO,MAAM,EAElCQ,IAAQxI,EAAIF,IAAM,GAAME,GAAKA,EAAIF,IAAM,EAAIE,EAAIF,IAAM,GAAK,EAC1D2I,EAAK,EAAID,EAEf,OAAOzB,EAAM,IACZyB,EAAKD,EAAO,IAAI,EAAIE,EAAKT,EAAO,IAAI,EACpCQ,EAAKD,EAAO,MAAM,EAAIE,EAAKT,EAAO,MAAM,EACxCQ,EAAKD,EAAO,KAAK,EAAIE,EAAKT,EAAO,KAAK,EACtCO,EAAO,MAAM,EAAIzF,EAAIkF,EAAO,MAAM,GAAK,EAAIlF,EAAE,CAC/C,CACD,EAGA,QAAWhE,KAAS,OAAO,KAAKiC,CAAO,EAAG,CACzC,GAAI6F,EAAc,SAAS9H,CAAK,EAC/B,SAGD,GAAM,CAAC,SAAAkC,CAAQ,EAAID,EAAQjC,CAAK,EAGhCiI,EAAM,UAAUjI,CAAK,EAAI,YAAaf,EAAM,CAC3C,OAAI,KAAK,QAAUe,EACX,IAAIiI,EAAM,IAAI,EAGlBhJ,EAAK,OAAS,EACV,IAAIgJ,EAAMhJ,EAAMe,CAAK,EAGtB,IAAIiI,EAAM,CAAC,GAAG2B,EAAY3H,EAAQ,KAAK,KAAK,EAAEjC,CAAK,EAAE,IAAI,KAAK,KAAK,CAAC,EAAG,KAAK,MAAM,EAAGA,CAAK,CAClG,EAGAiI,EAAMjI,CAAK,EAAI,YAAaf,EAAM,CACjC,IAAIiG,EAAQjG,EAAK,CAAC,EAClB,OAAI,OAAOiG,GAAU,WACpBA,EAAQkD,EAAUnJ,EAAMiD,CAAQ,GAG1B,IAAI+F,EAAM/C,EAAOlF,CAAK,CAC9B,CACD,CAEA,SAAS6J,EAAQC,EAAQtB,EAAQ,CAChC,OAAO,OAAOsB,EAAO,QAAQtB,CAAM,CAAC,CACrC,CAEA,SAASE,EAAaF,EAAQ,CAC7B,OAAO,SAAUsB,EAAQ,CACxB,OAAOD,EAAQC,EAAQtB,CAAM,CAC9B,CACD,CAEA,SAASG,EAAO3I,EAAO+J,EAASC,EAAU,CACzChK,EAAQ,MAAM,QAAQA,CAAK,EAAIA,EAAQ,CAACA,CAAK,EAE7C,QAAW6C,KAAK7C,GACdgI,EAASnF,CAAC,IAAMmF,EAASnF,CAAC,EAAI,CAAC,IAAIkH,CAAO,EAAIC,EAGhD,OAAAhK,EAAQA,EAAM,CAAC,EAER,SAAUoD,EAAO,CACvB,IAAIuE,EAEJ,OAAIvE,IAAU,QACT4G,IACH5G,EAAQ4G,EAAS5G,CAAK,GAGvBuE,EAAS,KAAK3H,CAAK,EAAE,EACrB2H,EAAO,MAAMoC,CAAO,EAAI3G,EACjBuE,IAGRA,EAAS,KAAK3H,CAAK,EAAE,EAAE,MAAM+J,CAAO,EAChCC,IACHrC,EAASqC,EAASrC,CAAM,GAGlBA,EACR,CACD,CAEA,SAASiB,EAAMjH,EAAK,CACnB,OAAO,SAAUa,EAAG,CACnB,OAAO,KAAK,IAAI,EAAG,KAAK,IAAIb,EAAKa,CAAC,CAAC,CACpC,CACD,CAEA,SAASoH,EAAYxG,EAAO,CAC3B,OAAO,MAAM,QAAQA,CAAK,EAAIA,EAAQ,CAACA,CAAK,CAC7C,CAEA,SAASgF,EAAU6B,EAAOC,EAAQ,CACjC,QAAS/K,EAAI,EAAGA,EAAI+K,EAAQ/K,IACvB,OAAO8K,EAAM9K,CAAC,GAAM,WACvB8K,EAAM9K,CAAC,EAAI,GAIb,OAAO8K,CACR,CAEAxL,EAAO,QAAUwJ,CAAA,CAAA,CAAA,EC5eXkC,GAAsB,KACxBC,GAAa,EAUXC,GAAN,KAAe,CAEX,YAAYC,EAAS,CAAC,EAAG,CACrB,KAAK,GAAKF,KACV,KAAK,QAAU,CAAC,CAACE,EAAO,QACxB,KAAK,YAAcA,EAAO,cAAgB,IAAM,CAC5C,MAAM,IAAI,MAAM,sDAAsD,CAC1E,EACJ,CAQA,IAAI/J,EAAO,CACP,GAAI,KAAK,QACL,MAAM,IAAI,WAAW,wCAAwC,EACjE,OAAI,OAAOA,GAAS,aAChBA,EAAQgK,GAAS,MAAMhK,CAAK,GACxBiK,GAAS,CACb,IAAI7C,EAASpH,EAAMiK,CAAI,EACvB,OAAO7C,IAAW,OAAY,KAAO,CAAC,KAAMA,CAAM,CACtD,CACJ,CACJ,EAKA0C,GAAS,SAAW,IAAIA,GAAS,CAAE,YAAazI,GAAOA,EAAI,MAAM,GAAG,CAAE,CAAC,EAIvEyI,GAAS,SAAW,IAAIA,GAAS,CAAE,YAAazI,GAAOA,EAAI,MAAM,GAAG,CAAE,CAAC,EAIvEyI,GAAS,MAAQ,IAAIA,GAAS,CAAE,YAAazI,GAAOA,EAAI,MAAM,GAAG,CAAE,CAAC,EAIpEyI,GAAS,YAAc,IAAIA,GAAS,CAAE,QAAS,EAAK,CAAC,EAKrDA,GAAS,UAAY,IAAIA,GAAS,CAAE,QAAS,EAAK,CAAC,EAInDA,GAAS,QAAU,IAAIA,GAAS,CAAE,QAAS,EAAK,CAAC,EAuBjD,IAAMI,GAAU,OAAO,OAAO,IAAI,EAE5BF,GAAN,MAAMG,EAAS,CAEX,YAKA/K,EAEAgL,EAGAC,EAEAC,EAAQ,EAAG,CACP,KAAK,KAAOlL,EACZ,KAAK,MAAQgL,EACb,KAAK,GAAKC,EACV,KAAK,MAAQC,CACjB,CAEA,OAAO,OAAOC,EAAM,CAChB,IAAIH,EAAQG,EAAK,OAASA,EAAK,MAAM,OAAS,OAAO,OAAO,IAAI,EAAIL,GAChEI,GAASC,EAAK,IAAM,EAAuB,IAAMA,EAAK,QAAU,EAA2B,IAC1FA,EAAK,MAAQ,EAAyB,IAAMA,EAAK,MAAQ,KAAO,EAA6B,GAC9FN,EAAO,IAAIE,GAASI,EAAK,MAAQ,GAAIH,EAAOG,EAAK,GAAID,CAAK,EAC9D,GAAIC,EAAK,OACL,QAASC,KAAOD,EAAK,MAGjB,GAFK,MAAM,QAAQC,CAAG,IAClBA,EAAMA,EAAIP,CAAI,GACdO,EAAK,CACL,GAAIA,EAAI,CAAC,EAAE,QACP,MAAM,IAAI,WAAW,4CAA4C,EACrEJ,EAAMI,EAAI,CAAC,EAAE,EAAE,EAAIA,EAAI,CAAC,CAC5B,EAER,OAAOP,CACX,CAGA,KAAKQ,EAAM,CAAE,OAAO,KAAK,MAAMA,EAAK,EAAE,CAAG,CAEzC,IAAI,OAAQ,CAAE,OAAQ,KAAK,MAAQ,GAAwB,CAAG,CAE9D,IAAI,WAAY,CAAE,OAAQ,KAAK,MAAQ,GAA4B,CAAG,CAEtE,IAAI,SAAU,CAAE,OAAQ,KAAK,MAAQ,GAA0B,CAAG,CAGlE,IAAI,aAAc,CAAE,OAAQ,KAAK,MAAQ,GAA8B,CAAG,CAG1E,GAAGrL,EAAM,CACL,GAAI,OAAOA,GAAQ,SAAU,CACzB,GAAI,KAAK,MAAQA,EACb,MAAO,GACX,IAAIsL,EAAQ,KAAK,KAAKZ,GAAS,KAAK,EACpC,OAAOY,EAAQA,EAAM,QAAQtL,CAAI,EAAI,GAAK,EAC9C,CACA,OAAO,KAAK,IAAMA,CACtB,CAOA,OAAO,MAAMuL,EAAK,CACd,IAAIC,EAAS,OAAO,OAAO,IAAI,EAC/B,QAASH,KAAQE,EACb,QAASvL,KAAQqL,EAAK,MAAM,GAAG,EAC3BG,EAAOxL,CAAI,EAAIuL,EAAIF,CAAI,EAC/B,OAAQpE,GAAS,CACb,QAASwE,EAASxE,EAAK,KAAKyD,GAAS,KAAK,EAAGlL,EAAI,GAAIA,GAAKiM,EAASA,EAAO,OAAS,GAAIjM,IAAK,CACxF,IAAIkM,EAAQF,EAAOhM,EAAI,EAAIyH,EAAK,KAAOwE,EAAOjM,CAAC,CAAC,EAChD,GAAIkM,EACA,OAAOA,CACf,CACJ,CACJ,CACJ,EAEAd,GAAS,KAAO,IAAIA,GAAS,GAAI,OAAO,OAAO,IAAI,EAAG,EAAG,CAA0B,EAuCnF,IAAMe,GAAa,IAAI,QAAWC,GAAkB,IAAI,QAGpDC,IACH,SAAUA,EAAU,CAIjBA,EAASA,EAAS,eAAoB,CAAC,EAAI,iBAI3CA,EAASA,EAAS,iBAAsB,CAAC,EAAI,mBAI7CA,EAASA,EAAS,aAAkB,CAAC,EAAI,eAKzCA,EAASA,EAAS,eAAoB,CAAC,EAAI,gBAC/C,GAAGA,KAAaA,GAAW,CAAC,EAAE,EAe9B,IAAMC,GAAN,MAAMC,EAAK,CAEP,YAEAlB,EAEAmB,EAGAC,EAEA1B,EAEAS,EAAO,CAOH,GANA,KAAK,KAAOH,EACZ,KAAK,SAAWmB,EAChB,KAAK,UAAYC,EACjB,KAAK,OAAS1B,EAEd,KAAK,MAAQ,KACTS,GAASA,EAAM,OAAQ,CACvB,KAAK,MAAQ,OAAO,OAAO,IAAI,EAC/B,OAAS,CAACK,EAAM5H,CAAK,IAAKuH,EACtB,KAAK,MAAM,OAAOK,GAAQ,SAAWA,EAAOA,EAAK,EAAE,EAAI5H,CAC/D,CACJ,CAEA,UAAW,CACP,IAAIyI,EAAU,KAAK,KAAKxB,GAAS,OAAO,EACxC,GAAIwB,GAAW,CAACA,EAAQ,QACpB,OAAOA,EAAQ,KAAK,SAAS,EACjC,IAAIF,EAAW,GACf,QAASG,KAAM,KAAK,SAAU,CAC1B,IAAIlK,EAAMkK,EAAG,SAAS,EAClBlK,IACI+J,IACAA,GAAY,KAChBA,GAAY/J,EAEpB,CACA,OAAQ,KAAK,KAAK,MACb,KAAK,KAAK,KAAK,KAAK,IAAI,GAAK,CAAC,KAAK,KAAK,QAAU,KAAK,UAAU,KAAK,KAAK,IAAI,EAAI,KAAK,KAAK,OACzF+J,EAAS,OAAS,IAAMA,EAAW,IAAM,IAFzBA,CAG7B,CAIA,OAAOI,EAAO,EAAG,CACb,OAAO,IAAIC,GAAW,KAAK,QAASD,CAAI,CAC5C,CAIA,SAASE,EAAKC,EAAO,EAAGH,EAAO,EAAG,CAC9B,IAAII,EAAQb,GAAW,IAAI,IAAI,GAAK,KAAK,QACrCc,EAAS,IAAIJ,GAAWG,CAAK,EACjC,OAAAC,EAAO,OAAOH,EAAKC,CAAI,EACvBZ,GAAW,IAAI,KAAMc,EAAO,KAAK,EAC1BA,CACX,CAGA,IAAI,SAAU,CACV,OAAO,IAAIC,GAAS,KAAM,EAAG,EAAG,IAAI,CACxC,CAUA,QAAQJ,EAAKC,EAAO,EAAG,CACnB,IAAItF,EAAO0F,GAAYhB,GAAW,IAAI,IAAI,GAAK,KAAK,QAASW,EAAKC,EAAM,EAAK,EAC7E,OAAAZ,GAAW,IAAI,KAAM1E,CAAI,EAClBA,CACX,CAMA,aAAaqF,EAAKC,EAAO,EAAG,CACxB,IAAItF,EAAO0F,GAAYf,GAAgB,IAAI,IAAI,GAAK,KAAK,QAASU,EAAKC,EAAM,EAAI,EACjF,OAAAX,GAAgB,IAAI,KAAM3E,CAAI,EACvBA,CACX,CAMA,QAAQkE,EAAM,CACV,GAAI,CAAE,MAAAyB,EAAO,MAAAC,EAAO,KAAA1F,EAAO,EAAG,GAAAC,EAAK,KAAK,MAAO,EAAI+D,EAC/CiB,EAAOjB,EAAK,MAAQ,EAAG2B,GAAQV,EAAOP,GAAS,kBAAoB,EACvE,QAAS7I,EAAI,KAAK,OAAOoJ,EAAOP,GAAS,gBAAgB,IAAK,CAC1D,IAAIkB,EAAU,GACd,GAAI/J,EAAE,MAAQoE,GAAMpE,EAAE,IAAMmE,IAAS,CAAC2F,GAAQ9J,EAAE,KAAK,aAAe4J,EAAM5J,CAAC,IAAM,IAAQ,CACrF,GAAIA,EAAE,WAAW,EACb,SACJ+J,EAAU,EACd,CACA,KACQA,GAAWF,IAAUC,GAAQ,CAAC9J,EAAE,KAAK,cACrC6J,EAAM7J,CAAC,EACP,CAAAA,EAAE,YAAY,GAHb,CAKL,GAAI,CAACA,EAAE,OAAO,EACV,OACJ+J,EAAU,EACd,CACJ,CACJ,CAGA,KAAK1B,EAAM,CACP,OAAQA,EAAK,QAAiC,KAAK,MAAQ,KAAK,MAAMA,EAAK,EAAE,EAAI,OAA1D,KAAK,KAAK,KAAKA,CAAI,CAC9C,CAIA,IAAI,YAAa,CACb,IAAIrD,EAAS,CAAC,EACd,GAAI,KAAK,MACL,QAASiD,KAAM,KAAK,MAChBjD,EAAO,KAAK,CAAC,CAACiD,EAAI,KAAK,MAAMA,CAAE,CAAC,CAAC,EACzC,OAAOjD,CACX,CAIA,QAAQ2C,EAAS,CAAC,EAAG,CACjB,OAAO,KAAK,SAAS,QAAU,EAA+B,KAC1DqC,GAAapC,GAAS,KAAM,KAAK,SAAU,KAAK,UAAW,EAAG,KAAK,SAAS,OAAQ,EAAG,KAAK,OAAQ,CAACoB,EAAUC,EAAW1B,IAAW,IAAIwB,GAAK,KAAK,KAAMC,EAAUC,EAAW1B,EAAQ,KAAK,UAAU,EAAGI,EAAO,WAAa,CAACqB,EAAUC,EAAW1B,IAAW,IAAIwB,GAAKnB,GAAS,KAAMoB,EAAUC,EAAW1B,CAAM,EAAE,CAC1T,CAGA,OAAO,MAAM0C,EAAM,CAAE,OAAOC,GAAUD,CAAI,CAAG,CACjD,EAEAnB,GAAK,MAAQ,IAAIA,GAAKlB,GAAS,KAAM,CAAC,EAAG,CAAC,EAAG,CAAC,EAC9C,IAAMuC,GAAN,MAAMC,EAAiB,CACnB,YAAYC,EAAQC,EAAO,CACvB,KAAK,OAASD,EACd,KAAK,MAAQC,CACjB,CACA,IAAI,IAAK,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CAC/C,IAAI,OAAQ,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CAClD,IAAI,KAAM,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CAChD,IAAI,MAAO,CAAE,OAAO,KAAK,OAAO,KAAK,MAAQ,CAAC,CAAG,CACjD,IAAI,KAAM,CAAE,OAAO,KAAK,KAAO,CAC/B,MAAO,CAAE,KAAK,OAAS,CAAG,CAC1B,MAAO,CAAE,OAAO,IAAIF,GAAiB,KAAK,OAAQ,KAAK,KAAK,CAAG,CACnE,EAKMG,GAAN,MAAMC,EAAW,CAEb,YAEAH,EAEA9C,EAEAkD,EAAK,CACD,KAAK,OAASJ,EACd,KAAK,OAAS9C,EACd,KAAK,IAAMkD,CACf,CAEA,IAAI,MAAO,CAAE,OAAO7C,GAAS,IAAM,CAEnC,UAAW,CACP,IAAI5C,EAAS,CAAC,EACd,QAASsF,EAAQ,EAAGA,EAAQ,KAAK,OAAO,QACpCtF,EAAO,KAAK,KAAK,YAAYsF,CAAK,CAAC,EACnCA,EAAQ,KAAK,OAAOA,EAAQ,CAAC,EAEjC,OAAOtF,EAAO,KAAK,GAAG,CAC1B,CAEA,YAAYsF,EAAO,CACf,IAAIrC,EAAK,KAAK,OAAOqC,CAAK,EAAGI,EAAW,KAAK,OAAOJ,EAAQ,CAAC,EACzDzC,EAAO,KAAK,IAAI,MAAMI,CAAE,EAAGjD,EAAS6C,EAAK,KAI7C,GAHI,KAAK,KAAK7C,CAAM,GAAK,CAAC6C,EAAK,UAC3B7C,EAAS,KAAK,UAAUA,CAAM,GAClCsF,GAAS,EACLI,GAAYJ,EACZ,OAAOtF,EACX,IAAIgE,EAAW,CAAC,EAChB,KAAOsB,EAAQI,GACX1B,EAAS,KAAK,KAAK,YAAYsB,CAAK,CAAC,EACrCA,EAAQ,KAAK,OAAOA,EAAQ,CAAC,EAEjC,OAAOtF,EAAS,IAAMgE,EAAS,KAAK,GAAG,EAAI,GAC/C,CAEA,UAAU2B,EAAYD,EAAUE,EAAKtB,EAAKC,EAAM,CAC5C,GAAI,CAAE,OAAAc,CAAO,EAAI,KAAMQ,EAAO,GAC9B,QAASrO,EAAImO,EAAYnO,GAAKkO,GACtB,EAAAI,GAAUvB,EAAMD,EAAKe,EAAO7N,EAAI,CAAC,EAAG6N,EAAO7N,EAAI,CAAC,CAAC,IACjDqO,EAAOrO,EACHoO,EAAM,IAHsBpO,EAAI6N,EAAO7N,EAAI,CAAC,EACpD,CAMJ,OAAOqO,CACX,CAEA,MAAME,EAAQC,EAAM7G,EAAM,CACtB,IAAI3F,EAAI,KAAK,OACTyM,EAAO,IAAI,YAAYD,EAAOD,CAAM,EAAGtO,EAAM,EACjD,QAASD,EAAIuO,EAAQG,EAAI,EAAG1O,EAAIwO,GAAO,CACnCC,EAAKC,GAAG,EAAI1M,EAAEhC,GAAG,EACjByO,EAAKC,GAAG,EAAI1M,EAAEhC,GAAG,EAAI2H,EACrB,IAAIC,EAAK6G,EAAKC,GAAG,EAAI1M,EAAEhC,GAAG,EAAI2H,EAC9B8G,EAAKC,GAAG,EAAI1M,EAAEhC,GAAG,EAAIuO,EACrBtO,EAAM,KAAK,IAAIA,EAAK2H,CAAE,CAC1B,CACA,OAAO,IAAIoG,GAAWS,EAAMxO,EAAK,KAAK,GAAG,CAC7C,CACJ,EACA,SAASqO,GAAUvB,EAAMD,EAAKnF,EAAMC,EAAI,CACpC,OAAQmF,EAAM,CACV,IAAK,GAAsB,OAAOpF,EAAOmF,EACzC,IAAK,GAA0B,OAAOlF,GAAMkF,GAAOnF,EAAOmF,EAC1D,IAAK,GAAqB,OAAOnF,EAAOmF,GAAOlF,EAAKkF,EACpD,IAAK,GAAwB,OAAOnF,GAAQmF,GAAOlF,EAAKkF,EACxD,IAAK,GAAoB,OAAOlF,EAAKkF,EACrC,IAAK,GAAuB,MAAO,EACvC,CACJ,CACA,SAAS6B,GAA2BlH,EAAMqF,EAAK,CAC3C,IAAI8B,EAAOnH,EAAK,YAAYqF,CAAG,EAC/B,KAAO8B,GAAM,CACT,IAAIC,EAAOD,EAAK,UAChB,GAAI,CAACC,GAAQA,EAAK,IAAMD,EAAK,GACzB,MACAC,EAAK,KAAK,SAAWA,EAAK,MAAQA,EAAK,IACvCpH,EAAOmH,EACPA,EAAOC,EAAK,aAGZD,EAAOC,CAEf,CACA,OAAOpH,CACX,CACA,SAAS0F,GAAY1F,EAAMqF,EAAKC,EAAM+B,EAAU,CAG5C,QAFIC,EAEGtH,EAAK,MAAQA,EAAK,KACpBsF,EAAO,EAAItF,EAAK,MAAQqF,EAAMrF,EAAK,KAAOqF,KAC1CC,EAAO,GAAKtF,EAAK,IAAMqF,EAAMrF,EAAK,GAAKqF,IAAM,CAC9C,IAAIkC,EAAS,CAACF,GAAYrH,aAAgByF,IAAYzF,EAAK,MAAQ,EAAI,KAAOA,EAAK,OACnF,GAAI,CAACuH,EACD,OAAOvH,EACXA,EAAOuH,CACX,CACA,IAAIpC,EAAOkC,EAAW,EAAIzC,GAAS,eAEnC,GAAIyC,EACA,QAASF,EAAOnH,EAAMuH,EAASJ,EAAK,OAAQI,EAAQJ,EAAOI,EAAQA,EAASJ,EAAK,OACzEA,aAAgB1B,IAAY0B,EAAK,MAAQ,KAAOG,EAAKC,EAAO,MAAMlC,EAAKC,EAAMH,CAAI,KAAO,MAAQmC,IAAO,OAAS,OAASA,EAAG,OAASH,EAAK,OAC1InH,EAAOuH,GAEnB,OAAS,CACL,IAAIC,EAAQxH,EAAK,MAAMqF,EAAKC,EAAMH,CAAI,EACtC,GAAI,CAACqC,EACD,OAAOxH,EACXA,EAAOwH,CACX,CACJ,CACA,IAAM/B,GAAN,MAAMgC,EAAS,CACX,YAAYC,EAAOxH,EAEnBmG,EAAOsB,EAAS,CACZ,KAAK,MAAQD,EACb,KAAK,KAAOxH,EACZ,KAAK,MAAQmG,EACb,KAAK,QAAUsB,CACnB,CACA,IAAI,MAAO,CAAE,OAAO,KAAK,MAAM,IAAM,CACrC,IAAI,MAAO,CAAE,OAAO,KAAK,MAAM,KAAK,IAAM,CAC1C,IAAI,IAAK,CAAE,OAAO,KAAK,KAAO,KAAK,MAAM,MAAQ,CACjD,UAAUpP,EAAGoO,EAAKtB,EAAKC,EAAMH,EAAO,EAAG,CACnC,QAASoC,EAAS,OAAQ,CACtB,OAAS,CAAE,SAAAxC,EAAU,UAAAC,CAAU,EAAIuC,EAAO,MAAOK,EAAIjB,EAAM,EAAI5B,EAAS,OAAS,GAAIxM,GAAKqP,EAAGrP,GAAKoO,EAAK,CACnG,IAAIkB,EAAO9C,EAASxM,CAAC,EAAGuP,EAAQ9C,EAAUzM,CAAC,EAAIgP,EAAO,KACtD,GAAKV,GAAUvB,EAAMD,EAAKyC,EAAOA,EAAQD,EAAK,MAAM,GAEpD,GAAIA,aAAgBvB,GAAY,CAC5B,GAAInB,EAAOP,GAAS,eAChB,SACJ,IAAIyB,EAAQwB,EAAK,UAAU,EAAGA,EAAK,OAAO,OAAQlB,EAAKtB,EAAMyC,EAAOxC,CAAI,EACxE,GAAIe,EAAQ,GACR,OAAO,IAAI0B,GAAW,IAAIC,GAAcT,EAAQM,EAAMtP,EAAGuP,CAAK,EAAG,KAAMzB,CAAK,CACpF,SACUlB,EAAOP,GAAS,kBAAsB,CAACiD,EAAK,KAAK,aAAeI,GAASJ,CAAI,EAAI,CACvF,IAAI5C,EACJ,GAAI,EAAEE,EAAOP,GAAS,eAClBiD,EAAK,QAAU5C,EAAU4C,EAAK,KAAKpE,GAAS,OAAO,IAAM,CAACwB,EAAQ,QAClE,OAAO,IAAIwC,GAASxC,EAAQ,KAAM6C,EAAOvP,EAAGgP,CAAM,EACtD,IAAIC,EAAQ,IAAIC,GAASI,EAAMC,EAAOvP,EAAGgP,CAAM,EAC/C,OAAQpC,EAAOP,GAAS,kBAAqB,CAAC4C,EAAM,KAAK,YAAcA,EACjEA,EAAM,UAAUb,EAAM,EAAIkB,EAAK,SAAS,OAAS,EAAI,EAAGlB,EAAKtB,EAAKC,CAAI,CAChF,EACJ,CAQA,GAPKH,EAAOP,GAAS,kBAAqB,CAAC2C,EAAO,KAAK,cAEnDA,EAAO,OAAS,EAChBhP,EAAIgP,EAAO,MAAQZ,EAEnBpO,EAAIoO,EAAM,EAAI,GAAKY,EAAO,QAAQ,MAAM,SAAS,OACrDA,EAASA,EAAO,QACZ,CAACA,GACD,OAAO,IACf,CACJ,CACA,IAAI,YAAa,CAAE,OAAO,KAAK,UAAU,EAAG,EAAG,EAAG,CAAqB,CAAG,CAC1E,IAAI,WAAY,CAAE,OAAO,KAAK,UAAU,KAAK,MAAM,SAAS,OAAS,EAAG,GAAI,EAAG,CAAqB,CAAG,CACvG,WAAWlC,EAAK,CAAE,OAAO,KAAK,UAAU,EAAG,EAAGA,EAAK,CAAkB,CAAG,CACxE,YAAYA,EAAK,CAAE,OAAO,KAAK,UAAU,KAAK,MAAM,SAAS,OAAS,EAAG,GAAIA,EAAK,EAAoB,CAAG,CACzG,MAAMA,EAAKC,EAAMH,EAAO,EAAG,CACvB,IAAIF,EACJ,GAAI,EAAEE,EAAOP,GAAS,kBAAoBK,EAAU,KAAK,MAAM,KAAKxB,GAAS,OAAO,IAAMwB,EAAQ,QAAS,CACvG,IAAIiD,EAAO7C,EAAM,KAAK,KACtB,OAAS,CAAE,KAAAnF,EAAM,GAAAC,CAAG,IAAK8E,EAAQ,QAC7B,IAAKK,EAAO,EAAIpF,GAAQgI,EAAOhI,EAAOgI,KACjC5C,EAAO,EAAInF,GAAM+H,EAAO/H,EAAK+H,GAC9B,OAAO,IAAIT,GAASxC,EAAQ,KAAMA,EAAQ,QAAQ,CAAC,EAAE,KAAO,KAAK,KAAM,GAAI,IAAI,CAE3F,CACA,OAAO,KAAK,UAAU,EAAG,EAAGI,EAAKC,EAAMH,CAAI,CAC/C,CACA,uBAAwB,CACpB,IAAIhM,EAAM,KACV,KAAOA,EAAI,KAAK,aAAeA,EAAI,SAC/BA,EAAMA,EAAI,QACd,OAAOA,CACX,CACA,IAAI,QAAS,CACT,OAAO,KAAK,QAAU,KAAK,QAAQ,sBAAsB,EAAI,IACjE,CACA,IAAI,aAAc,CACd,OAAO,KAAK,SAAW,KAAK,OAAS,EAAI,KAAK,QAAQ,UAAU,KAAK,MAAQ,EAAG,EAAG,EAAG,CAAqB,EAAI,IACnH,CACA,IAAI,aAAc,CACd,OAAO,KAAK,SAAW,KAAK,OAAS,EAAI,KAAK,QAAQ,UAAU,KAAK,MAAQ,EAAG,GAAI,EAAG,CAAqB,EAAI,IACpH,CACA,OAAOgM,EAAO,EAAG,CAAE,OAAO,IAAIC,GAAW,KAAMD,CAAI,CAAG,CACtD,IAAI,MAAO,CAAE,OAAO,KAAK,KAAO,CAChC,QAAS,CAAE,OAAO,KAAK,KAAO,CAC9B,QAAQE,EAAKC,EAAO,EAAG,CACnB,OAAOI,GAAY,KAAML,EAAKC,EAAM,EAAK,CAC7C,CACA,aAAaD,EAAKC,EAAO,EAAG,CACxB,OAAOI,GAAY,KAAML,EAAKC,EAAM,EAAI,CAC5C,CACA,2BAA2BD,EAAK,CAAE,OAAO6B,GAA2B,KAAM7B,CAAG,CAAG,CAChF,SAASzB,EAAMuE,EAAS,KAAMC,EAAQ,KAAM,CACxC,IAAI3N,EAAI4N,GAAY,KAAMzE,EAAMuE,EAAQC,CAAK,EAC7C,OAAO3N,EAAE,OAASA,EAAE,CAAC,EAAI,IAC7B,CACA,YAAYmJ,EAAMuE,EAAS,KAAMC,EAAQ,KAAM,CAC3C,OAAOC,GAAY,KAAMzE,EAAMuE,EAAQC,CAAK,CAChD,CAEA,UAAW,CAAE,OAAO,KAAK,MAAM,SAAS,CAAG,CAC3C,IAAI,MAAO,CAAE,OAAO,IAAM,CAC1B,aAAaE,EAAS,CAAE,OAAOC,GAAiB,KAAMD,CAAO,CAAG,CACpE,EACA,SAASD,GAAYrI,EAAM4D,EAAMuE,EAAQC,EAAO,CAC5C,IAAI7H,EAAMP,EAAK,OAAO,EAAGe,EAAS,CAAC,EACnC,GAAI,CAACR,EAAI,WAAW,EAChB,OAAOQ,EACX,GAAIoH,GAAU,MACV,KAAO,CAAC5H,EAAI,KAAK,GAAG4H,CAAM,GACtB,GAAI,CAAC5H,EAAI,YAAY,EACjB,OAAOQ,EACnB,OAAS,CACL,GAAIqH,GAAS,MAAQ7H,EAAI,KAAK,GAAG6H,CAAK,EAClC,OAAOrH,EAGX,GAFIR,EAAI,KAAK,GAAGqD,CAAI,GAChB7C,EAAO,KAAKR,EAAI,IAAI,EACpB,CAACA,EAAI,YAAY,EACjB,OAAO6H,GAAS,KAAOrH,EAAS,CAAC,CACzC,CACJ,CACA,SAASwH,GAAiBvI,EAAMsI,EAAS/P,EAAI+P,EAAQ,OAAS,EAAG,CAC7D,QAASlL,EAAI4C,EAAK,OAAQzH,GAAK,EAAG6E,EAAIA,EAAE,OAAQ,CAC5C,GAAI,CAACA,EACD,MAAO,GACX,GAAI,CAACA,EAAE,KAAK,YAAa,CACrB,GAAIkL,EAAQ/P,CAAC,GAAK+P,EAAQ/P,CAAC,GAAK6E,EAAE,KAC9B,MAAO,GACX7E,GACJ,CACJ,CACA,MAAO,EACX,CACA,IAAMyP,GAAN,KAAoB,CAChB,YAAYT,EAAQnB,EAAQC,EAAOyB,EAAO,CACtC,KAAK,OAASP,EACd,KAAK,OAASnB,EACd,KAAK,MAAQC,EACb,KAAK,MAAQyB,CACjB,CACJ,EACMC,GAAN,MAAMS,EAAW,CACb,IAAI,MAAO,CAAE,OAAO,KAAK,KAAK,IAAM,CACpC,IAAI,MAAO,CAAE,OAAO,KAAK,QAAQ,MAAQ,KAAK,QAAQ,OAAO,OAAO,KAAK,MAAQ,CAAC,CAAG,CACrF,IAAI,IAAK,CAAE,OAAO,KAAK,QAAQ,MAAQ,KAAK,QAAQ,OAAO,OAAO,KAAK,MAAQ,CAAC,CAAG,CACnF,YAAYF,EAASX,EAAStB,EAAO,CACjC,KAAK,QAAUiC,EACf,KAAK,QAAUX,EACf,KAAK,MAAQtB,EACb,KAAK,KAAOiC,EAAQ,OAAO,IAAI,MAAMA,EAAQ,OAAO,OAAOjC,CAAK,CAAC,CACrE,CACA,MAAMM,EAAKtB,EAAKC,EAAM,CAClB,GAAI,CAAE,OAAAc,CAAO,EAAI,KAAK,QAClBC,EAAQD,EAAO,UAAU,KAAK,MAAQ,EAAGA,EAAO,OAAO,KAAK,MAAQ,CAAC,EAAGO,EAAKtB,EAAM,KAAK,QAAQ,MAAOC,CAAI,EAC/G,OAAOe,EAAQ,EAAI,KAAO,IAAImC,GAAW,KAAK,QAAS,KAAMnC,CAAK,CACtE,CACA,IAAI,YAAa,CAAE,OAAO,KAAK,MAAM,EAAG,EAAG,CAAqB,CAAG,CACnE,IAAI,WAAY,CAAE,OAAO,KAAK,MAAM,GAAI,EAAG,CAAqB,CAAG,CACnE,WAAWhB,EAAK,CAAE,OAAO,KAAK,MAAM,EAAGA,EAAK,CAAkB,CAAG,CACjE,YAAYA,EAAK,CAAE,OAAO,KAAK,MAAM,GAAIA,EAAK,EAAoB,CAAG,CACrE,MAAMA,EAAKC,EAAMH,EAAO,EAAG,CACvB,GAAIA,EAAOP,GAAS,eAChB,OAAO,KACX,GAAI,CAAE,OAAAwB,CAAO,EAAI,KAAK,QAClBC,EAAQD,EAAO,UAAU,KAAK,MAAQ,EAAGA,EAAO,OAAO,KAAK,MAAQ,CAAC,EAAGd,EAAO,EAAI,EAAI,GAAID,EAAM,KAAK,QAAQ,MAAOC,CAAI,EAC7H,OAAOe,EAAQ,EAAI,KAAO,IAAImC,GAAW,KAAK,QAAS,KAAMnC,CAAK,CACtE,CACA,IAAI,QAAS,CACT,OAAO,KAAK,SAAW,KAAK,QAAQ,OAAO,sBAAsB,CACrE,CACA,gBAAgBM,EAAK,CACjB,OAAO,KAAK,QAAU,KAAO,KAAK,QAAQ,OAAO,UAAU,KAAK,QAAQ,MAAQA,EAAKA,EAAK,EAAG,CAAqB,CACtH,CACA,IAAI,aAAc,CACd,GAAI,CAAE,OAAAP,CAAO,EAAI,KAAK,QAClBgC,EAAQhC,EAAO,OAAO,KAAK,MAAQ,CAAC,EACxC,OAAIgC,GAAS,KAAK,QAAUhC,EAAO,OAAO,KAAK,QAAQ,MAAQ,CAAC,EAAIA,EAAO,OAAO,QACvE,IAAIoC,GAAW,KAAK,QAAS,KAAK,QAASJ,CAAK,EACpD,KAAK,gBAAgB,CAAC,CACjC,CACA,IAAI,aAAc,CACd,GAAI,CAAE,OAAAhC,CAAO,EAAI,KAAK,QAClBqC,EAAc,KAAK,QAAU,KAAK,QAAQ,MAAQ,EAAI,EAC1D,OAAI,KAAK,OAASA,EACP,KAAK,gBAAgB,EAAE,EAC3B,IAAID,GAAW,KAAK,QAAS,KAAK,QAASpC,EAAO,UAAUqC,EAAa,KAAK,MAAO,GAAI,EAAG,CAAqB,CAAC,CAC7H,CACA,OAAOtD,EAAO,EAAG,CAAE,OAAO,IAAIC,GAAW,KAAMD,CAAI,CAAG,CACtD,IAAI,MAAO,CAAE,OAAO,IAAM,CAC1B,QAAS,CACL,IAAIJ,EAAW,CAAC,EAAGC,EAAY,CAAC,EAC5B,CAAE,OAAAoB,CAAO,EAAI,KAAK,QAClBU,EAAS,KAAK,MAAQ,EAAGC,EAAOX,EAAO,OAAO,KAAK,MAAQ,CAAC,EAChE,GAAIW,EAAOD,EAAQ,CACf,IAAI5G,EAAOkG,EAAO,OAAO,KAAK,MAAQ,CAAC,EACvCrB,EAAS,KAAKqB,EAAO,MAAMU,EAAQC,EAAM7G,CAAI,CAAC,EAC9C8E,EAAU,KAAK,CAAC,CACpB,CACA,OAAO,IAAIH,GAAK,KAAK,KAAME,EAAUC,EAAW,KAAK,GAAK,KAAK,IAAI,CACvE,CACA,QAAQK,EAAKC,EAAO,EAAG,CACnB,OAAOI,GAAY,KAAML,EAAKC,EAAM,EAAK,CAC7C,CACA,aAAaD,EAAKC,EAAO,EAAG,CACxB,OAAOI,GAAY,KAAML,EAAKC,EAAM,EAAI,CAC5C,CACA,2BAA2BD,EAAK,CAAE,OAAO6B,GAA2B,KAAM7B,CAAG,CAAG,CAEhF,UAAW,CAAE,OAAO,KAAK,QAAQ,OAAO,YAAY,KAAK,KAAK,CAAG,CACjE,SAASzB,EAAMuE,EAAS,KAAMC,EAAQ,KAAM,CACxC,IAAI3N,EAAI4N,GAAY,KAAMzE,EAAMuE,EAAQC,CAAK,EAC7C,OAAO3N,EAAE,OAASA,EAAE,CAAC,EAAI,IAC7B,CACA,YAAYmJ,EAAMuE,EAAS,KAAMC,EAAQ,KAAM,CAC3C,OAAOC,GAAY,KAAMzE,EAAMuE,EAAQC,CAAK,CAChD,CACA,IAAI,MAAO,CAAE,OAAO,IAAM,CAC1B,aAAaE,EAAS,CAAE,OAAOC,GAAiB,KAAMD,CAAO,CAAG,CACpE,EAGMlD,GAAN,KAAiB,CAEb,IAAI,MAAO,CAAE,OAAO,KAAK,KAAK,IAAM,CAEpC,YAAYpF,EAEZmF,EAAO,EAAG,CAQN,GAPA,KAAK,KAAOA,EAEZ,KAAK,OAAS,KACd,KAAK,MAAQ,CAAC,EAEd,KAAK,MAAQ,EACb,KAAK,WAAa,KACdnF,aAAgByF,GAChB,KAAK,UAAUzF,CAAI,MAElB,CACD,KAAK,MAAQA,EAAK,QAAQ,OAC1B,KAAK,OAASA,EAAK,QACnB,QAASpC,EAAIoC,EAAK,QAASpC,EAAGA,EAAIA,EAAE,QAChC,KAAK,MAAM,QAAQA,EAAE,KAAK,EAC9B,KAAK,WAAaoC,EAClB,KAAK,SAASA,EAAK,KAAK,CAC5B,CACJ,CACA,UAAUA,EAAM,CACZ,OAAKA,GAEL,KAAK,MAAQA,EACb,KAAK,KAAOA,EAAK,KACjB,KAAK,KAAOA,EAAK,KACjB,KAAK,GAAKA,EAAK,GACR,IALI,EAMf,CACA,SAASqG,EAAOzC,EAAM,CAClB,KAAK,MAAQyC,EACb,GAAI,CAAE,MAAAyB,EAAO,OAAA1B,CAAO,EAAI,KAAK,OAC7B,YAAK,KAAOxC,GAAQwC,EAAO,IAAI,MAAMA,EAAO,OAAOC,CAAK,CAAC,EACzD,KAAK,KAAOyB,EAAQ1B,EAAO,OAAOC,EAAQ,CAAC,EAC3C,KAAK,GAAKyB,EAAQ1B,EAAO,OAAOC,EAAQ,CAAC,EAClC,EACX,CACA,MAAMrG,EAAM,CACR,OAAKA,EAEDA,aAAgByF,IAChB,KAAK,OAAS,KACP,KAAK,UAAUzF,CAAI,IAE9B,KAAK,OAASA,EAAK,QACZ,KAAK,SAASA,EAAK,MAAOA,EAAK,IAAI,GAN/B,EAOf,CAEA,UAAW,CACP,OAAO,KAAK,OAAS,KAAK,OAAO,OAAO,YAAY,KAAK,KAAK,EAAI,KAAK,MAAM,SAAS,CAC1F,CAEA,WAAW2G,EAAKtB,EAAKC,EAAM,CACvB,GAAI,CAAC,KAAK,OACN,OAAO,KAAK,MAAM,KAAK,MAAM,UAAUqB,EAAM,EAAI,KAAK,MAAM,MAAM,SAAS,OAAS,EAAI,EAAGA,EAAKtB,EAAKC,EAAM,KAAK,IAAI,CAAC,EACzH,GAAI,CAAE,OAAAc,CAAO,EAAI,KAAK,OAClBC,EAAQD,EAAO,UAAU,KAAK,MAAQ,EAAGA,EAAO,OAAO,KAAK,MAAQ,CAAC,EAAGO,EAAKtB,EAAM,KAAK,OAAO,MAAOC,CAAI,EAC9G,OAAIe,EAAQ,EACD,IACX,KAAK,MAAM,KAAK,KAAK,KAAK,EACnB,KAAK,SAASA,CAAK,EAC9B,CAGA,YAAa,CAAE,OAAO,KAAK,WAAW,EAAG,EAAG,CAAqB,CAAG,CAEpE,WAAY,CAAE,OAAO,KAAK,WAAW,GAAI,EAAG,CAAqB,CAAG,CAEpE,WAAWhB,EAAK,CAAE,OAAO,KAAK,WAAW,EAAGA,EAAK,CAAkB,CAAG,CAEtE,YAAYA,EAAK,CAAE,OAAO,KAAK,WAAW,GAAIA,EAAK,EAAoB,CAAG,CAM1E,MAAMA,EAAKC,EAAMH,EAAO,KAAK,KAAM,CAC/B,OAAK,KAAK,OAEHA,EAAOP,GAAS,eAAiB,GAAQ,KAAK,WAAW,EAAGS,EAAKC,CAAI,EADjE,KAAK,MAAM,KAAK,MAAM,MAAMD,EAAKC,EAAMH,CAAI,CAAC,CAE3D,CAEA,QAAS,CACL,GAAI,CAAC,KAAK,OACN,OAAO,KAAK,UAAW,KAAK,KAAOP,GAAS,iBAAoB,KAAK,MAAM,QAAU,KAAK,MAAM,MAAM,EAC1G,GAAI,KAAK,MAAM,OACX,OAAO,KAAK,SAAS,KAAK,MAAM,IAAI,CAAC,EACzC,IAAI2C,EAAU,KAAK,KAAO3C,GAAS,iBAAoB,KAAK,OAAO,OAAS,KAAK,OAAO,OAAO,sBAAsB,EACrH,YAAK,OAAS,KACP,KAAK,UAAU2C,CAAM,CAChC,CAEA,QAAQZ,EAAK,CACT,GAAI,CAAC,KAAK,OACN,OAAQ,KAAK,MAAM,QACb,KAAK,MAAM,KAAK,MAAM,MAAQ,EAAI,KAC9B,KAAK,MAAM,QAAQ,UAAU,KAAK,MAAM,MAAQA,EAAKA,EAAK,EAAG,EAAuB,KAAK,IAAI,CAAC,EAF3E,GAGjC,GAAI,CAAE,OAAAP,CAAO,EAAI,KAAK,OAAQsC,EAAI,KAAK,MAAM,OAAS,EACtD,GAAI/B,EAAM,EAAG,CACT,IAAI8B,EAAcC,EAAI,EAAI,EAAI,KAAK,MAAMA,CAAC,EAAI,EAC9C,GAAI,KAAK,OAASD,EACd,OAAO,KAAK,SAASrC,EAAO,UAAUqC,EAAa,KAAK,MAAO,GAAI,EAAG,CAAqB,CAAC,CACpG,KACK,CACD,IAAIL,EAAQhC,EAAO,OAAO,KAAK,MAAQ,CAAC,EACxC,GAAIgC,GAASM,EAAI,EAAItC,EAAO,OAAO,OAASA,EAAO,OAAO,KAAK,MAAMsC,CAAC,EAAI,CAAC,GACvE,OAAO,KAAK,SAASN,CAAK,CAClC,CACA,OAAOM,EAAI,EAAI,KAAK,MAAM,KAAK,OAAO,OAAO,UAAU,KAAK,OAAO,MAAQ/B,EAAKA,EAAK,EAAG,EAAuB,KAAK,IAAI,CAAC,EAAI,EACjI,CAEA,aAAc,CAAE,OAAO,KAAK,QAAQ,CAAC,CAAG,CAExC,aAAc,CAAE,OAAO,KAAK,QAAQ,EAAE,CAAG,CACzC,WAAWA,EAAK,CACZ,IAAIN,EAAOkB,EAAQ,CAAE,OAAAnB,CAAO,EAAI,KAChC,GAAIA,EAAQ,CACR,GAAIO,EAAM,GACN,GAAI,KAAK,MAAQP,EAAO,OAAO,OAAO,OAClC,MAAO,OAGX,SAAS,EAAI,EAAG,EAAI,KAAK,MAAO,IAC5B,GAAIA,EAAO,OAAO,OAAO,EAAI,CAAC,EAAI,KAAK,MACnC,MAAO,IAElB,CAAE,MAAAC,EAAO,OAAAkB,CAAO,EAAInB,EACzB,MAEK,CAAE,MAAAC,EAAO,QAASkB,CAAO,EAAI,KAAK,OAEvC,KAAOA,EAAQ,CAAE,MAAAlB,EAAO,QAASkB,CAAO,EAAIA,EACxC,GAAIlB,EAAQ,GACR,QAAS,EAAIA,EAAQM,EAAKiB,EAAIjB,EAAM,EAAI,GAAKY,EAAO,MAAM,SAAS,OAAQ,GAAKK,EAAG,GAAKjB,EAAK,CACzF,IAAIgC,EAAQpB,EAAO,MAAM,SAAS,CAAC,EACnC,GAAK,KAAK,KAAO3C,GAAS,kBACtB+D,aAAiBrC,IACjB,CAACqC,EAAM,KAAK,aACZV,GAASU,CAAK,EACd,MAAO,EACf,CAER,MAAO,EACX,CACA,KAAKhC,EAAKhB,EAAO,CACb,GAAIA,GAAS,KAAK,WAAWgB,EAAK,EAAG,CAAqB,EACtD,MAAO,GACX,OAAS,CACL,GAAI,KAAK,QAAQA,CAAG,EAChB,MAAO,GACX,GAAI,KAAK,WAAWA,CAAG,GAAK,CAAC,KAAK,OAAO,EACrC,MAAO,EACf,CACJ,CAMA,KAAKhB,EAAQ,GAAM,CAAE,OAAO,KAAK,KAAK,EAAGA,CAAK,CAAG,CAKjD,KAAKA,EAAQ,GAAM,CAAE,OAAO,KAAK,KAAK,GAAIA,CAAK,CAAG,CAIlD,OAAON,EAAKC,EAAO,EAAG,CAElB,MAAO,KAAK,MAAQ,KAAK,KACpBA,EAAO,EAAI,KAAK,MAAQD,EAAM,KAAK,KAAOA,KAC1CC,EAAO,GAAK,KAAK,IAAMD,EAAM,KAAK,GAAKA,KACnC,KAAK,OAAO,GAAjB,CAGJ,KAAO,KAAK,WAAW,EAAGA,EAAKC,CAAI,GAAG,CACtC,OAAO,IACX,CAGA,IAAI,MAAO,CACP,GAAI,CAAC,KAAK,OACN,OAAO,KAAK,MAChB,IAAIsD,EAAQ,KAAK,WAAY7H,EAAS,KAAM8H,EAAQ,EACpD,GAAID,GAASA,EAAM,SAAW,KAAK,OAC/BzB,EAAM,QAASd,EAAQ,KAAK,MAAOqC,EAAI,KAAK,MAAM,OAAQA,GAAK,GAAI,CAC/D,QAAS3M,EAAI6M,EAAO7M,EAAGA,EAAIA,EAAE,QACzB,GAAIA,EAAE,OAASsK,EAAO,CAClB,GAAIA,GAAS,KAAK,MACd,OAAOtK,EACXgF,EAAShF,EACT8M,EAAQH,EAAI,EACZ,MAAMvB,CACV,CACJd,EAAQ,KAAK,MAAM,EAAEqC,CAAC,CAC1B,CAEJ,QAASnQ,EAAIsQ,EAAOtQ,EAAI,KAAK,MAAM,OAAQA,IACvCwI,EAAS,IAAIgH,GAAW,KAAK,OAAQhH,EAAQ,KAAK,MAAMxI,CAAC,CAAC,EAC9D,OAAO,KAAK,WAAa,IAAIwP,GAAW,KAAK,OAAQhH,EAAQ,KAAK,KAAK,CAC3E,CAIA,IAAI,MAAO,CACP,OAAO,KAAK,OAAS,KAAO,KAAK,MAAM,KAC3C,CAKA,QAAQ4E,EAAOC,EAAO,CAClB,QAASiD,EAAQ,IAAK,CAClB,IAAIC,EAAY,GAChB,GAAI,KAAK,KAAK,aAAenD,EAAM,IAAI,IAAM,GAAO,CAChD,GAAI,KAAK,WAAW,EAAG,CACnBkD,IACA,QACJ,CACK,KAAK,KAAK,cACXC,EAAY,GACpB,CACA,KACQA,GAAalD,GACbA,EAAM,IAAI,EACdkD,EAAY,KAAK,KAAK,YAClB,MAAK,YAAY,GAJhB,CAML,GAAI,CAACD,EACD,OACJ,KAAK,OAAO,EACZA,IACAC,EAAY,EAChB,CACJ,CACJ,CAIA,aAAaR,EAAS,CAClB,GAAI,CAAC,KAAK,OACN,OAAOC,GAAiB,KAAK,KAAMD,CAAO,EAC9C,GAAI,CAAE,OAAAlC,CAAO,EAAI,KAAK,OAAQ,CAAE,MAAA2C,CAAM,EAAI3C,EAAO,IACjD,QAAS7N,EAAI+P,EAAQ,OAAS,EAAGI,EAAI,KAAK,MAAM,OAAS,EAAGnQ,GAAK,EAAGmQ,IAAK,CACrE,GAAIA,EAAI,EACJ,OAAOH,GAAiB,KAAK,KAAMD,EAAS/P,CAAC,EACjD,IAAIqL,EAAOmF,EAAM3C,EAAO,OAAO,KAAK,MAAMsC,CAAC,CAAC,CAAC,EAC7C,GAAI,CAAC9E,EAAK,YAAa,CACnB,GAAI0E,EAAQ/P,CAAC,GAAK+P,EAAQ/P,CAAC,GAAKqL,EAAK,KACjC,MAAO,GACXrL,GACJ,CACJ,CACA,MAAO,EACX,CACJ,EACA,SAAS0P,GAASe,EAAM,CACpB,OAAOA,EAAK,SAAS,KAAK9D,GAAMA,aAAcoB,IAAc,CAACpB,EAAG,KAAK,aAAe+C,GAAS/C,CAAE,CAAC,CACpG,CACA,SAASe,GAAUD,EAAM,CACrB,IAAIsB,EACJ,GAAI,CAAE,OAAAlB,EAAQ,QAAA6C,EAAS,gBAAAC,EAAkB3F,GAAqB,OAAA4F,EAAS,CAAC,EAAG,cAAAC,EAAgBH,EAAQ,MAAM,MAAO,EAAIjD,EAChHR,EAAS,MAAM,QAAQY,CAAM,EAAI,IAAIF,GAAiBE,EAAQA,EAAO,MAAM,EAAIA,EAC/E2C,EAAQE,EAAQ,MAChBI,EAAc,EAAGC,EAAY,EACjC,SAASC,EAASd,EAAae,EAAQzE,EAAUC,EAAWyE,EAAU,CAClE,GAAI,CAAE,GAAAzF,EAAI,MAAA8D,EAAO,IAAA4B,EAAK,KAAAC,CAAK,EAAInE,EAC3BoE,EAAmBN,EACvB,KAAOK,EAAO,GAEV,GADAnE,EAAO,KAAK,EACRmE,GAAQ,GAA8B,CACtC,IAAI3J,EAAOmJ,EAAOnF,CAAE,EACpBe,EAAS,KAAK/E,CAAI,EAClBgF,EAAU,KAAK8C,EAAQW,CAAW,EAClC,MACJ,SACSkB,GAAQ,GAAsC,CACnDN,EAAcrF,EACd,MACJ,SACS2F,GAAQ,GAAkC,CAC/CL,EAAYtF,EACZ,MACJ,KAEI,OAAM,IAAI,WAAW,6BAA6B2F,CAAI,EAAE,EAGhE,IAAI/F,EAAOmF,EAAM/E,CAAE,EAAGhE,EAAMoG,EACxByD,EAAW/B,EAAQW,EACvB,GAAIiB,EAAM5B,GAASoB,IAAoB9C,EAAS0D,EAAetE,EAAO,IAAMgE,EAAQC,CAAQ,GAAI,CAE5F,IAAIzD,EAAO,IAAI,YAAYI,EAAO,KAAOA,EAAO,IAAI,EAChD2D,EAASvE,EAAO,IAAMY,EAAO,KAAMC,EAAQL,EAAK,OACpD,KAAOR,EAAO,IAAMuE,GAChB1D,EAAQ2D,EAAa5D,EAAO,MAAOJ,EAAMK,CAAK,EAClDrG,EAAO,IAAIsG,GAAWN,EAAM0D,EAAMtD,EAAO,MAAO6C,CAAO,EACvDY,EAAWzD,EAAO,MAAQqC,CAC9B,KACK,CACD,IAAIsB,EAASvE,EAAO,IAAMmE,EAC1BnE,EAAO,KAAK,EACZ,IAAIyE,EAAgB,CAAC,EAAGC,EAAiB,CAAC,EACtCC,EAAgBnG,GAAMoF,EAAgBpF,EAAK,GAC3CoG,EAAY,EAAGC,EAAUX,EAC7B,KAAOlE,EAAO,IAAMuE,GACZI,GAAiB,GAAK3E,EAAO,IAAM2E,GAAiB3E,EAAO,MAAQ,GAC/DA,EAAO,KAAO6E,EAAUnB,IACxBoB,EAAeL,EAAeC,EAAgBpC,EAAOsC,EAAW5E,EAAO,IAAK6E,EAASF,EAAeP,CAAgB,EACpHQ,EAAYH,EAAc,OAC1BI,EAAU7E,EAAO,KAErBA,EAAO,KAAK,GAGZ+D,EAASzB,EAAOiC,EAAQE,EAAeC,EAAgBC,CAAa,EAO5E,GAJIA,GAAiB,GAAKC,EAAY,GAAKA,EAAYH,EAAc,QACjEK,EAAeL,EAAeC,EAAgBpC,EAAOsC,EAAWtC,EAAOuC,EAASF,EAAeP,CAAgB,EACnHK,EAAc,QAAQ,EACtBC,EAAe,QAAQ,EACnBC,EAAgB,IAAMC,EAAY,EAAG,CACrC,IAAIG,GAAOC,EAAa5G,CAAI,EAC5B5D,EAAO+F,GAAanC,EAAMqG,EAAeC,EAAgB,EAAGD,EAAc,OAAQ,EAAGP,EAAM5B,EAAOyC,GAAMA,EAAI,CAChH,MAEIvK,EAAOyK,EAAS7G,EAAMqG,EAAeC,EAAgBR,EAAM5B,EAAO8B,EAAmBF,CAAG,CAEhG,CACA3E,EAAS,KAAK/E,CAAI,EAClBgF,EAAU,KAAK6E,CAAQ,CAC3B,CACA,SAASW,EAAa5G,EAAM,CACxB,MAAO,CAACmB,EAAUC,EAAW1B,IAAW,CACpC,IAAIgG,EAAY,EAAGoB,EAAQ3F,EAAS,OAAS,EAAGqC,EAAMuD,EACtD,GAAID,GAAS,IAAMtD,EAAOrC,EAAS2F,CAAK,aAAc7F,GAAM,CACxD,GAAI,CAAC6F,GAAStD,EAAK,MAAQxD,GAAQwD,EAAK,QAAU9D,EAC9C,OAAO8D,GACPuD,EAAgBvD,EAAK,KAAK3D,GAAS,SAAS,KAC5C6F,EAAYtE,EAAU0F,CAAK,EAAItD,EAAK,OAASuD,EACrD,CACA,OAAOF,EAAS7G,EAAMmB,EAAUC,EAAW1B,EAAQgG,CAAS,CAChE,CACJ,CACA,SAASgB,EAAevF,EAAUC,EAAW4F,EAAMrS,EAAG2H,EAAMC,EAAIyD,EAAM0F,EAAW,CAC7E,IAAIW,EAAgB,CAAC,EAAGC,EAAiB,CAAC,EAC1C,KAAOnF,EAAS,OAASxM,GACrB0R,EAAc,KAAKlF,EAAS,IAAI,CAAC,EACjCmF,EAAe,KAAKlF,EAAU,IAAI,EAAI4F,EAAO1K,CAAI,EAErD6E,EAAS,KAAK0F,EAASxB,EAAQ,MAAMrF,CAAI,EAAGqG,EAAeC,EAAgB/J,EAAKD,EAAMoJ,EAAYnJ,CAAE,CAAC,EACrG6E,EAAU,KAAK9E,EAAO0K,CAAI,CAC9B,CACA,SAASH,EAAS7G,EAAMmB,EAAUC,EAAW1B,EAAQgG,EAAY,EAAGvF,EAAO,CACvE,GAAIsF,EAAa,CACb,IAAIwB,EAAO,CAACpH,GAAS,YAAa4F,CAAW,EAC7CtF,EAAQA,EAAQ,CAAC8G,CAAI,EAAE,OAAO9G,CAAK,EAAI,CAAC8G,CAAI,CAChD,CACA,GAAIvB,EAAY,GAAI,CAChB,IAAIuB,EAAO,CAACpH,GAAS,UAAW6F,CAAS,EACzCvF,EAAQA,EAAQ,CAAC8G,CAAI,EAAE,OAAO9G,CAAK,EAAI,CAAC8G,CAAI,CAChD,CACA,OAAO,IAAIhG,GAAKjB,EAAMmB,EAAUC,EAAW1B,EAAQS,CAAK,CAC5D,CACA,SAAS+F,EAAegB,EAASrB,EAAU,CAOvC,IAAIsB,EAAOvF,EAAO,KAAK,EACnBmE,EAAO,EAAG7B,EAAQ,EAAGkD,EAAO,EAAGC,EAAWF,EAAK,IAAM7B,EACrDnI,EAAS,CAAE,KAAM,EAAG,MAAO,EAAG,KAAM,CAAE,EAC1CoG,EAAM,QAASqC,EAASuB,EAAK,IAAMD,EAASC,EAAK,IAAMvB,GAAS,CAC5D,IAAI0B,EAAWH,EAAK,KAEpB,GAAIA,EAAK,IAAMtB,GAAYyB,GAAY,EAAG,CAGtCnK,EAAO,KAAO4I,EACd5I,EAAO,MAAQ+G,EACf/G,EAAO,KAAOiK,EACdA,GAAQ,EACRrB,GAAQ,EACRoB,EAAK,KAAK,EACV,QACJ,CACA,IAAIlB,EAAWkB,EAAK,IAAMG,EAC1B,GAAIA,EAAW,GAAKrB,EAAWL,GAAUuB,EAAK,MAAQE,EAClD,MACJ,IAAIE,EAAeJ,EAAK,IAAM3B,EAAgB,EAAI,EAC9CgC,EAAYL,EAAK,MAErB,IADAA,EAAK,KAAK,EACHA,EAAK,IAAMlB,GAAU,CACxB,GAAIkB,EAAK,KAAO,EACZ,GAAIA,EAAK,MAAQ,GACbI,GAAgB,MAEhB,OAAMhE,OAEL4D,EAAK,IAAM3B,IAChB+B,GAAgB,GAEpBJ,EAAK,KAAK,CACd,CACAjD,EAAQsD,EACRzB,GAAQuB,EACRF,GAAQG,CACZ,CACA,OAAI1B,EAAW,GAAKE,GAAQmB,KACxB/J,EAAO,KAAO4I,EACd5I,EAAO,MAAQ+G,EACf/G,EAAO,KAAOiK,GAEXjK,EAAO,KAAO,EAAIA,EAAS,MACtC,CACA,SAASiJ,EAAaqB,EAAajF,EAAQC,EAAO,CAC9C,GAAI,CAAE,GAAArC,EAAI,MAAA8D,EAAO,IAAA4B,EAAK,KAAAC,CAAK,EAAInE,EAE/B,GADAA,EAAO,KAAK,EACRmE,GAAQ,GAAK3F,EAAKoF,EAAe,CACjC,IAAI1C,EAAaL,EACjB,GAAIsD,EAAO,EAAG,CACV,IAAII,EAASvE,EAAO,KAAOmE,EAAO,GAClC,KAAOnE,EAAO,IAAMuE,GAChB1D,EAAQ2D,EAAaqB,EAAajF,EAAQC,CAAK,CACvD,CACAD,EAAO,EAAEC,CAAK,EAAIK,EAClBN,EAAO,EAAEC,CAAK,EAAIqD,EAAM2B,EACxBjF,EAAO,EAAEC,CAAK,EAAIyB,EAAQuD,EAC1BjF,EAAO,EAAEC,CAAK,EAAIrC,CACtB,MACS2F,GAAQ,GACbN,EAAcrF,EAET2F,GAAQ,KACbL,EAAYtF,GAEhB,OAAOqC,CACX,CACA,IAAItB,EAAW,CAAC,EAAGC,EAAY,CAAC,EAChC,KAAOQ,EAAO,IAAM,GAChB+D,EAASvD,EAAK,OAAS,EAAGA,EAAK,aAAe,EAAGjB,EAAUC,EAAW,EAAE,EAC5E,IAAI1B,GAAUgE,EAAKtB,EAAK,UAAY,MAAQsB,IAAO,OAASA,EAAMvC,EAAS,OAASC,EAAU,CAAC,EAAID,EAAS,CAAC,EAAE,OAAS,EACxH,OAAO,IAAIF,GAAKkE,EAAM/C,EAAK,KAAK,EAAGjB,EAAS,QAAQ,EAAGC,EAAU,QAAQ,EAAG1B,CAAM,CACtF,CACA,IAAMgI,GAAgB,IAAI,QAC1B,SAASJ,GAASK,EAAavL,EAAM,CACjC,GAAI,CAACuL,EAAY,aAAevL,aAAgBsG,IAActG,EAAK,MAAQuL,EACvE,MAAO,GACX,IAAI5B,EAAO2B,GAAc,IAAItL,CAAI,EACjC,GAAI2J,GAAQ,KAAM,CACdA,EAAO,EACP,QAAShB,KAAS3I,EAAK,SAAU,CAC7B,GAAI2I,EAAM,MAAQ4C,GAAe,EAAE5C,aAAiB9D,IAAO,CACvD8E,EAAO,EACP,KACJ,CACAA,GAAQuB,GAASK,EAAa5C,CAAK,CACvC,CACA2C,GAAc,IAAItL,EAAM2J,CAAI,CAChC,CACA,OAAOA,CACX,CACA,SAAS5D,GAETwF,EAEAxG,EAAUC,EAEV9E,EAAMC,EAEN2H,EAEAxE,EAEAkI,EAEAC,EAAQ,CACJ,IAAIC,EAAQ,EACZ,QAASnT,EAAI2H,EAAM3H,EAAI4H,EAAI5H,IACvBmT,GAASR,GAASK,EAAaxG,EAASxM,CAAC,CAAC,EAC9C,IAAIoT,EAAW,KAAK,KAAMD,EAAQ,IAAO,CAA4B,EACjEzB,EAAgB,CAAC,EAAGC,EAAiB,CAAC,EAC1C,SAAS0B,EAAO7G,EAAUC,EAAW9E,EAAMC,EAAI0L,EAAQ,CACnD,QAAStT,EAAI2H,EAAM3H,EAAI4H,GAAK,CACxB,IAAI2L,EAAYvT,EAAGwT,EAAa/G,EAAUzM,CAAC,EAAGyT,EAAYd,GAASK,EAAaxG,EAASxM,CAAC,CAAC,EAE3F,IADAA,IACOA,EAAI4H,EAAI5H,IAAK,CAChB,IAAI0T,EAAWf,GAASK,EAAaxG,EAASxM,CAAC,CAAC,EAChD,GAAIyT,EAAYC,GAAYN,EACxB,MACJK,GAAaC,CACjB,CACA,GAAI1T,GAAKuT,EAAY,EAAG,CACpB,GAAIE,EAAYL,EAAU,CACtB,IAAIO,EAAOnH,EAAS+G,CAAS,EAC7BF,EAAOM,EAAK,SAAUA,EAAK,UAAW,EAAGA,EAAK,SAAS,OAAQlH,EAAU8G,CAAS,EAAID,CAAM,EAC5F,QACJ,CACA5B,EAAc,KAAKlF,EAAS+G,CAAS,CAAC,CAC1C,KACK,CACD,IAAIxI,EAAS0B,EAAUzM,EAAI,CAAC,EAAIwM,EAASxM,EAAI,CAAC,EAAE,OAASwT,EACzD9B,EAAc,KAAKlE,GAAawF,EAAaxG,EAAUC,EAAW8G,EAAWvT,EAAGwT,EAAYzI,EAAQ,KAAMmI,CAAM,CAAC,CACrH,CACAvB,EAAe,KAAK6B,EAAaF,EAAS/D,CAAK,CACnD,CACJ,CACA,OAAA8D,EAAO7G,EAAUC,EAAW9E,EAAMC,EAAI,CAAC,GAC/BqL,GAASC,GAAQxB,EAAeC,EAAgB5G,CAAM,CAClE,CAqMA,IAAM6I,GAAe,IAAI1I,GAAS,CAAE,QAAS,EAAK,CAAC,ECh7C/C2I,GAAY,EAoBVC,GAAN,MAAMC,EAAI,CAIN,YAKA9F,EAKAoE,EAIA2B,EAAU,CACN,KAAK,IAAM/F,EACX,KAAK,KAAOoE,EACZ,KAAK,SAAW2B,EAIhB,KAAK,GAAKH,IACd,CAQA,OAAO,OAAO7E,EAAQ,CAClB,GAAoDA,GAAO,KACvD,MAAM,IAAI,MAAM,oCAAoC,EACxD,IAAIiF,EAAM,IAAIF,GAAI,CAAC,EAAG,KAAM,CAAC,CAAC,EAE9B,GADAE,EAAI,IAAI,KAAKA,CAAG,EACZjF,EACA,QAASjK,KAAKiK,EAAO,IACjBiF,EAAI,IAAI,KAAKlP,CAAC,EACtB,OAAOkP,CACX,CAaA,OAAO,gBAAiB,CACpB,IAAIC,EAAM,IAAIC,GACd,OAAQF,GACAA,EAAI,SAAS,QAAQC,CAAG,EAAI,GACrBD,EACJE,GAAS,IAAIF,EAAI,MAAQA,EAAKA,EAAI,SAAS,OAAOC,CAAG,EAAE,KAAK,CAACrS,EAAGG,IAAMH,EAAE,GAAKG,EAAE,EAAE,CAAC,CAEjG,CACJ,EACIoS,GAAiB,EACfD,GAAN,MAAME,EAAS,CACX,aAAc,CACV,KAAK,UAAY,CAAC,EAClB,KAAK,GAAKD,IACd,CACA,OAAO,IAAI/B,EAAMiC,EAAM,CACnB,GAAI,CAACA,EAAK,OACN,OAAOjC,EACX,IAAIkC,EAASD,EAAK,CAAC,EAAE,UAAU,KAAKvP,GAAKA,EAAE,MAAQsN,GAAQmC,GAAUF,EAAMvP,EAAE,QAAQ,CAAC,EACtF,GAAIwP,EACA,OAAOA,EACX,IAAItG,EAAM,CAAC,EAAGgG,EAAM,IAAIH,GAAI7F,EAAKoE,EAAMiC,CAAI,EAC3C,QAAS5Q,KAAK4Q,EACV5Q,EAAE,UAAU,KAAKuQ,CAAG,EACxB,IAAIQ,EAAUC,GAASJ,CAAI,EAC3B,QAAStF,KAAUqD,EAAK,IACpB,GAAI,CAACrD,EAAO,SAAS,OACjB,QAAS7D,KAAUsJ,EACfxG,EAAI,KAAKoG,GAAS,IAAIrF,EAAQ7D,CAAM,CAAC,EACjD,OAAO8I,CACX,CACJ,EACA,SAASO,GAAU3S,EAAGG,EAAG,CACrB,OAAOH,EAAE,QAAUG,EAAE,QAAUH,EAAE,MAAM,CAACgC,EAAG7D,IAAM6D,GAAK7B,EAAEhC,CAAC,CAAC,CAC9D,CACA,SAAS0U,GAAS5J,EAAO,CACrB,IAAI6J,EAAO,CAAC,CAAC,CAAC,EACd,QAAS3U,EAAI,EAAGA,EAAI8K,EAAM,OAAQ9K,IAC9B,QAAS0O,EAAI,EAAGW,EAAIsF,EAAK,OAAQjG,EAAIW,EAAGX,IACpCiG,EAAK,KAAKA,EAAKjG,CAAC,EAAE,OAAO5D,EAAM9K,CAAC,CAAC,CAAC,EAG1C,OAAO2U,EAAK,KAAK,CAAC9S,EAAGG,IAAMA,EAAE,OAASH,EAAE,MAAM,CAClD,CA2FA,IAAM+S,GAAe,IAAI1J,GACnB2J,GAAN,KAAW,CACP,YAAYC,EAAMlI,EAAMmD,EAAST,EAAM,CACnC,KAAK,KAAOwF,EACZ,KAAK,KAAOlI,EACZ,KAAK,QAAUmD,EACf,KAAK,KAAOT,CAChB,CACA,IAAI,QAAS,CAAE,OAAO,KAAK,MAAQ,CAAgB,CACnD,IAAI,SAAU,CAAE,OAAO,KAAK,MAAQ,CAAiB,CACrD,KAAKyF,EAAO,CACR,MAAI,CAACA,GAASA,EAAM,MAAQ,KAAK,OAC7B,KAAK,KAAOA,EACL,OAEXA,EAAM,KAAO,KAAK,KAAKA,EAAM,IAAI,EAC1BA,EACX,CACA,IAAI,OAAQ,CAAE,OAAO,KAAK,QAAU,KAAK,QAAQ,OAAS,CAAG,CACjE,EACAF,GAAK,MAAQ,IAAIA,GAAK,CAAC,EAAG,EAAgB,IAAI,EAM9C,SAASG,GAAeF,EAAMG,EAAS,CACnC,IAAIlJ,EAAM,OAAO,OAAO,IAAI,EAC5B,QAASmJ,KAASJ,EACd,GAAI,CAAC,MAAM,QAAQI,EAAM,GAAG,EACxBnJ,EAAImJ,EAAM,IAAI,EAAE,EAAIA,EAAM,UAE1B,SAASjB,KAAOiB,EAAM,IAClBnJ,EAAIkI,EAAI,EAAE,EAAIiB,EAAM,MAEhC,GAAI,CAAE,MAAAlI,EAAO,IAAAmI,EAAM,IAAK,EAAIF,GAAW,CAAC,EACxC,MAAO,CACH,MAAQH,GAAS,CACb,IAAIM,EAAMD,EACV,QAASlB,KAAOa,EACZ,QAASO,KAAOpB,EAAI,IAAK,CACrB,IAAIqB,EAAWvJ,EAAIsJ,EAAI,EAAE,EACzB,GAAIC,EAAU,CACVF,EAAMA,EAAMA,EAAM,IAAME,EAAWA,EACnC,KACJ,CACJ,CAEJ,OAAOF,CACX,EACA,MAAApI,CACJ,CACJ,CA6HA,IAAMjI,EAAI+O,GAAI,OACRyB,GAAUxQ,EAAE,EAAGvE,GAAOuE,EAAE,EAAGyQ,GAAWzQ,EAAEvE,EAAI,EAAGiV,GAAe1Q,EAAEvE,EAAI,EAAGkV,GAAU3Q,EAAE,EAAGrE,GAASqE,EAAE2Q,EAAO,EAAG/K,GAAS5F,EAAE2Q,EAAO,EAAGC,GAAU5Q,EAAE,EAAG6Q,GAAU7Q,EAAE4Q,EAAO,EAAGzU,GAAU6D,EAAE,EAAG8Q,GAAW9Q,EAAE,EAAG+Q,GAAc/Q,EAAE,EAAGgR,GAAUhR,EAAE+Q,EAAW,EAAGE,GAAOjR,EAAE,EAqB1P+P,EAAO,CAIT,QAAAS,GAIA,YAAaxQ,EAAEwQ,EAAO,EAItB,aAAcxQ,EAAEwQ,EAAO,EAIvB,WAAYxQ,EAAEwQ,EAAO,EAIrB,KAAA/U,GAIA,aAAcuE,EAAEvE,EAAI,EAIpB,SAAAgV,GAIA,QAASzQ,EAAEyQ,EAAQ,EAInB,aAAAC,GAIA,cAAe1Q,EAAE0Q,EAAY,EAI7B,UAAW1Q,EAAEvE,EAAI,EAIjB,UAAWuE,EAAEvE,EAAI,EAIjB,UAAWuE,EAAEvE,EAAI,EAIjB,UAAWuE,EAAEvE,EAAI,EAIjB,QAAAkV,GAIA,OAAAhV,GAIA,UAAWqE,EAAErE,EAAM,EAInB,UAAWqE,EAAErE,EAAM,EAInB,eAAgBqE,EAAErE,EAAM,EAIxB,OAAAiK,GAIA,QAAS5F,EAAE4F,EAAM,EAIjB,MAAO5F,EAAE4F,EAAM,EAIf,KAAM5F,EAAE2Q,EAAO,EAIf,OAAQ3Q,EAAE2Q,EAAO,EAKjB,OAAQ3Q,EAAE2Q,EAAO,EAIjB,MAAO3Q,EAAE2Q,EAAO,EAIhB,IAAK3Q,EAAE2Q,EAAO,EAId,QAAAxU,GAKA,KAAM6D,EAAE7D,EAAO,EAIf,KAAM6D,EAAE7D,EAAO,EAIf,KAAM6D,EAAE7D,EAAO,EAIf,KAAM6D,EAAE7D,EAAO,EAIf,SAAU6D,EAAE7D,EAAO,EAInB,gBAAiB6D,EAAE7D,EAAO,EAI1B,eAAgB6D,EAAE7D,EAAO,EAIzB,kBAAmB6D,EAAE7D,EAAO,EAK5B,cAAe6D,EAAE7D,EAAO,EAIxB,SAAA2U,GAIA,cAAe9Q,EAAE8Q,EAAQ,EAIzB,mBAAoB9Q,EAAE8Q,EAAQ,EAI9B,cAAe9Q,EAAE8Q,EAAQ,EAIzB,gBAAiB9Q,EAAE8Q,EAAQ,EAI3B,gBAAiB9Q,EAAE8Q,EAAQ,EAI3B,eAAgB9Q,EAAE8Q,EAAQ,EAI1B,mBAAoB9Q,EAAE8Q,EAAQ,EAI9B,aAAc9Q,EAAE8Q,EAAQ,EAIxB,gBAAiB9Q,EAAE8Q,EAAQ,EAI3B,YAAAC,GAKA,UAAW/Q,EAAE+Q,EAAW,EAIxB,QAAAC,GAKA,aAAchR,EAAEgR,EAAO,EAKvB,cAAehR,EAAEgR,EAAO,EAKxB,MAAOhR,EAAEgR,EAAO,EAKhB,MAAOhR,EAAEgR,EAAO,EAIhB,QAAAJ,GAIA,QAAAC,GAIA,SAAU7Q,EAAE6Q,EAAO,EAInB,SAAU7Q,EAAE6Q,EAAO,EAInB,SAAU7Q,EAAE6Q,EAAO,EAInB,SAAU7Q,EAAE6Q,EAAO,EAInB,SAAU7Q,EAAE6Q,EAAO,EAInB,SAAU7Q,EAAE6Q,EAAO,EAInB,iBAAkB7Q,EAAE4Q,EAAO,EAI3B,KAAM5Q,EAAE4Q,EAAO,EAIf,MAAO5Q,EAAE4Q,EAAO,EAIhB,SAAU5Q,EAAE4Q,EAAO,EAInB,OAAQ5Q,EAAE4Q,EAAO,EAIjB,KAAM5Q,EAAE4Q,EAAO,EAKf,UAAW5Q,EAAE4Q,EAAO,EAKpB,cAAe5Q,EAAE4Q,EAAO,EAIxB,SAAU5Q,EAAE,EAIZ,QAASA,EAAE,EAIX,QAASA,EAAE,EAIX,QAASA,EAAE,EAIX,KAAAiR,GAKA,aAAcjR,EAAEiR,EAAI,EAKpB,WAAYjR,EAAEiR,EAAI,EAKlB,sBAAuBjR,EAAEiR,EAAI,EAM7B,WAAYlC,GAAI,eAAe,EAM/B,SAAUA,GAAI,eAAe,EAO7B,SAAUA,GAAI,eAAe,EAM7B,SAAUA,GAAI,eAAe,EAK7B,MAAOA,GAAI,eAAe,EAS1B,QAASA,GAAI,eAAe,CAChC,EAiDMmC,GAAmBjB,GAAe,CACpC,CAAE,IAAKF,EAAK,KAAM,MAAO,UAAW,EACpC,CAAE,IAAKA,EAAK,QAAS,MAAO,aAAc,EAC1C,CAAE,IAAKA,EAAK,SAAU,MAAO,cAAe,EAC5C,CAAE,IAAKA,EAAK,OAAQ,MAAO,YAAa,EACxC,CAAE,IAAKA,EAAK,QAAS,MAAO,aAAc,EAC1C,CAAE,IAAKA,EAAK,KAAM,MAAO,UAAW,EACpC,CAAE,IAAKA,EAAK,KAAM,MAAO,UAAW,EACpC,CAAE,IAAKA,EAAK,IAAK,MAAO,SAAU,EAClC,CAAE,IAAKA,EAAK,UAAW,MAAO,eAAgB,EAC9C,CAAE,IAAKA,EAAK,SAAU,MAAO,cAAe,EAC5C,CAAE,IAAKA,EAAK,QAAS,MAAO,aAAc,EAC1C,CAAE,IAAKA,EAAK,QAAS,MAAO,aAAc,EAC1C,CAAE,IAAKA,EAAK,OAAQ,MAAO,YAAa,EACxC,CAAE,IAAKA,EAAK,OAAQ,MAAO,YAAa,EACxC,CAAE,IAAK,CAACA,EAAK,OAAQA,EAAK,OAAQA,EAAK,QAAQA,EAAK,MAAM,CAAC,EAAG,MAAO,aAAc,EACnF,CAAE,IAAKA,EAAK,aAAc,MAAO,kBAAmB,EACpD,CAAE,IAAKA,EAAK,MAAMA,EAAK,YAAY,EAAG,MAAO,4BAA6B,EAC1E,CAAE,IAAKA,EAAK,WAAWA,EAAK,YAAY,EAAG,MAAO,iCAAkC,EACpF,CAAE,IAAKA,EAAK,QAAQA,EAAK,YAAY,EAAG,MAAO,mBAAoB,EACnE,CAAE,IAAKA,EAAK,WAAWA,EAAK,YAAY,EAAG,MAAO,iCAAkC,EACpF,CAAE,IAAKA,EAAK,SAAU,MAAO,cAAe,EAC5C,CAAE,IAAKA,EAAK,UAAW,MAAO,eAAgB,EAC9C,CAAE,IAAKA,EAAK,UAAW,MAAO,eAAgB,EAC9C,CAAE,IAAKA,EAAK,UAAW,MAAO,eAAgB,EAC9C,CAAE,IAAKA,EAAK,aAAc,MAAO,kBAAmB,EACpD,CAAE,IAAKA,EAAK,SAAU,MAAO,cAAe,EAC5C,CAAE,IAAKA,EAAK,QAAS,MAAO,aAAc,EAC1C,CAAE,IAAKA,EAAK,KAAM,MAAO,UAAW,EACpC,CAAE,IAAKA,EAAK,QAAS,MAAO,aAAc,EAC1C,CAAE,IAAKA,EAAK,YAAa,MAAO,iBAAkB,CACtD,CAAC,EEx1BYoB,GAAe,CAC1B,aAAc,UACd,cAAe,UACf,2BAA4B,UAC5B,gBAAiB,UACjB,kBAAmB,UACnB,gBAAiB,UACjB,cAAe,YACf,aAAc,UACd,iBAAkB,UAClB,4BAA6B,UAC7B,0BAA2B,YAC3B,0BAA2B,YAC3B,wBAAyB,YACzB,gCAAiC,YACjC,sBAAuB,UACvB,WAAY,UACZ,kBAAmB,YACnB,uBAAwB,YACxB,YAAa,UACb,uBAAwB,UACxB,oBAAqB,YACrB,gBAAiB,YACjB,qBAAsB,UACtB,mBAAoB,YACpB,4BAA6B,UAC7B,uBAAwB,YACxB,aAAc,UACd,eAAgB,UAChB,sBAAuB,UACvB,WAAY,YACZ,eAAgB,UAChB,iBAAkB,UAClB,qBAAsB,UACtB,mBAAoB,YACpB,oBAAqB,YACrB,2BAA4B,WAC9B,ECrCAC,GAAkBC,GAAA1N,GAAA,EAAA,CAAA,EAEX,SAAS2N,GAAgBtQ,EAAuB,CACrD,IAAMuQ,KAAYH,GAAArN,SAAM/C,CAAK,EAE7B,OADiBuQ,EAAU,MAAMA,EAAU,MAAM,CAAC,EAAE,MAAMA,EAAU,MAAM,CAAC,EAC3D,IAAI,CACtB,CFEA,IAAMC,GAAgB,MAChBC,GAAuB,MACvBC,GAAgC,OAEhCC,GAA0B,UAEnBC,GAAuB,cAAW,MAC7C,CACE,IAAK,CACH,MAAON,GAAgBH,GAAa,UAAU,EAC9C,gBAAiBG,GAAgBK,EAAuB,EACxD,aAAcH,EAChB,EAEA,cAAe,CACb,gBAAiBF,GAAgBK,EAAuB,EACxD,MAAOL,GAAgBH,GAAa,iBAAiB,CACvD,EAEA,kCAAmC,CACjC,MAAOM,GACP,OAAQA,EACV,EAEA,wCAAyC,CACvC,aAAcC,GACd,gBAAiB,2BACnB,CACF,EACA,CAAE,KAAM,EAAM,CAChB,EAEaG,GAAsB,cAAW,MAC5C,CACE,IAAK,CACH,MAAOV,GAAa,WACpB,gBAAiBQ,GACjB,aAAcH,EAChB,EAEA,cAAe,CACb,gBAAiBG,GACjB,MAAOR,GAAa,iBACtB,EAEA,kCAAmC,CACjC,MAAOM,GACP,OAAQA,EACV,EAEA,wCAAyC,CACvC,aAAcC,GACd,gBAAiB,2BACnB,CACF,EACA,CAAE,KAAM,EAAK,CACf,EAEA,SAASI,GAAI5C,EAAUlO,EAA4C,CACjE,MAAO,CACL,IAAAkO,EACA,MAAAlO,CACF,CACF,CAEA,SAAS+Q,GAAU7C,EAAUlO,EAA4C,CACvE,IAAMgR,EAAWF,GAAI5C,EAAKlO,CAAK,EAC/B,OAAAgR,EAAS,MAAQV,GAAgBU,EAAS,KAAK,EACxCA,CACT,CAEA,IAAMC,GAA+B,kBAAe,OAAO,CACzDH,GAAI/B,EAAK,QAASoB,GAAa,aAAa,EAC5CW,GAAI/B,EAAK,cAAeoB,GAAa,aAAa,EAClDW,GAAI/B,EAAK,gBAAiBoB,GAAa,0BAA0B,EACjEW,GAAI/B,EAAK,QAASoB,GAAa,aAAa,EAC5CW,GAAI/B,EAAK,OAAQoB,GAAa,YAAY,EAC1CW,GAAI/B,EAAK,OAAQoB,GAAa,YAAY,EAC1CW,GAAI/B,EAAK,aAAcoB,GAAa,qBAAqB,CAC3D,CAAC,EACYe,MAA0B,uBACrCD,EACF,EAEME,GAAgC,kBAAe,OAAO,CAC1DJ,GAAUhC,EAAK,QAASoB,GAAa,aAAa,EAClDY,GAAUhC,EAAK,cAAeoB,GAAa,aAAa,EACxDY,GAAUhC,EAAK,gBAAiBoB,GAAa,0BAA0B,EACvEY,GAAUhC,EAAK,QAASoB,GAAa,aAAa,EAClDY,GAAUhC,EAAK,OAAQoB,GAAa,YAAY,EAChDY,GAAUhC,EAAK,OAAQoB,GAAa,YAAY,EAChDY,GAAUhC,EAAK,aAAcoB,GAAa,qBAAqB,CACjE,CAAC,EACYiB,MAA2B,uBACtCD,EACF,EGvGA,IAAAE,GAA+B,WC0F/B,SAASC,GAAaC,EAAO,CAC5B,OAAOC,GAAUD,EAAM,IAAI,CAAC,CAACE,EAAQC,CAAK,IAAO,IAAI,MAAMD,CAAM,EAAG,KAAKC,EAAO,EAAGD,CAAM,CAAC,CAAC,CAC5F,CAEA,SAASD,GAAUD,EAAO,CACzB,OAAOA,EAAM,OAAO,CAACI,EAAGC,IAAMD,EAAE,OAAO,MAAM,QAAQC,CAAC,EAAIJ,GAAUI,CAAC,EAAIA,CAAC,EAAG,CAAC,CAAC,CAChF,CAGA,IAAMC,GAAa,CAAC,EAAG,EAAG,EAAG,CAAC,EAAE,OAAO,GAAGP,GAAa,CACtD,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,EAAE,EAC1H,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,CACzH,CAAC,CAAC,EAEF,SAASQ,IAAO,CACf,IAAMC,EAAO,KAeb,SAASC,EAAWC,EAAG,CACtB,IAAMC,EAAOH,EAAK,SACZI,EAAQJ,EAAK,UAAU,YACvBK,EAAQL,EAAK,UAAU,WACvBM,EAAON,EAAK,UAAU,WACtBO,EAAaP,EAAK,UAAU,WAC9BQ,EACAC,EAAGC,EACHC,EACAC,EACAC,EACAC,EAAW,EAEf,IAAKH,EAAO,EAAGA,GAAQ,GAAUA,IAChCT,EAAE,SAASS,CAAI,EAAI,EAMpB,IAFAR,EAAKD,EAAE,KAAKA,EAAE,QAAQ,EAAI,EAAI,CAAC,EAAI,EAE9BM,EAAIN,EAAE,SAAW,EAAGM,EAAI,IAAWA,IACvCC,EAAIP,EAAE,KAAKM,CAAC,EACZG,EAAOR,EAAKA,EAAKM,EAAI,EAAI,CAAC,EAAI,EAAI,CAAC,EAAI,EACnCE,EAAOJ,IACVI,EAAOJ,EACPO,KAEDX,EAAKM,EAAI,EAAI,CAAC,EAAIE,EAGd,EAAAF,EAAIT,EAAK,YAGbE,EAAE,SAASS,CAAI,IACfC,EAAQ,EACJH,GAAKH,IACRM,EAAQP,EAAMI,EAAIH,CAAI,GACvBO,EAAIV,EAAKM,EAAI,CAAC,EACdP,EAAE,SAAWW,GAAKF,EAAOC,GACrBR,IACHF,EAAE,YAAcW,GAAKT,EAAMK,EAAI,EAAI,CAAC,EAAIG,KAE1C,GAAIE,IAAa,EAKjB,GAAG,CAEF,IADAH,EAAOJ,EAAa,EACbL,EAAE,SAASS,CAAI,IAAM,GAC3BA,IACDT,EAAE,SAASS,CAAI,IACfT,EAAE,SAASS,EAAO,CAAC,GAAK,EACxBT,EAAE,SAASK,CAAU,IAGrBO,GAAY,CACb,OAASA,EAAW,GAEpB,IAAKH,EAAOJ,EAAYI,IAAS,EAAGA,IAEnC,IADAF,EAAIP,EAAE,SAASS,CAAI,EACZF,IAAM,GACZC,EAAIR,EAAE,KAAK,EAAEM,CAAC,EACV,EAAAE,EAAIV,EAAK,YAETG,EAAKO,EAAI,EAAI,CAAC,GAAKC,IACtBT,EAAE,UAAYS,EAAOR,EAAKO,EAAI,EAAI,CAAC,GAAKP,EAAKO,EAAI,CAAC,EAClDP,EAAKO,EAAI,EAAI,CAAC,EAAIC,GAEnBF,KAGH,CAMA,SAASM,EAAWC,EACnBC,EACC,CACD,IAAIC,EAAM,EACV,GACCA,GAAOF,EAAO,EACdA,KAAU,EACVE,IAAQ,QACA,EAAED,EAAM,GACjB,OAAOC,IAAQ,CAChB,CAQA,SAASC,EAAUhB,EAClBiB,EACAC,EACC,CACD,IAAMC,EAAY,CAAC,EAEfN,EAAO,EACPL,EACAF,EACAQ,EAIJ,IAAKN,EAAO,EAAGA,GAAQ,GAAUA,IAChCW,EAAUX,CAAI,EAAIK,EAASA,EAAOK,EAASV,EAAO,CAAC,GAAM,EAS1D,IAAKF,EAAI,EAAGA,GAAKW,EAAUX,IAC1BQ,EAAMd,EAAKM,EAAI,EAAI,CAAC,EAChBQ,IAAQ,IAGZd,EAAKM,EAAI,CAAC,EAAIM,EAAWO,EAAUL,CAAG,IAAKA,CAAG,EAEhD,CAQAjB,EAAK,WAAa,SAAUE,EAAG,CAC9B,IAAMC,EAAOH,EAAK,SACZI,EAAQJ,EAAK,UAAU,YACvBuB,EAAQvB,EAAK,UAAU,MACzBS,EAAGC,EACHU,EAAW,GACXI,EAQJ,IAHAtB,EAAE,SAAW,EACbA,EAAE,SAAW,IAERO,EAAI,EAAGA,EAAIc,EAAOd,IAClBN,EAAKM,EAAI,CAAC,IAAM,GACnBP,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIkB,EAAWX,EAClCP,EAAE,MAAMO,CAAC,EAAI,GAEbN,EAAKM,EAAI,EAAI,CAAC,EAAI,EAQpB,KAAOP,EAAE,SAAW,GACnBsB,EAAOtB,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIkB,EAAW,EAAI,EAAEA,EAAW,EAC1DjB,EAAKqB,EAAO,CAAC,EAAI,EACjBtB,EAAE,MAAMsB,CAAI,EAAI,EAChBtB,EAAE,UACEE,IACHF,EAAE,YAAcE,EAAMoB,EAAO,EAAI,CAAC,GAQpC,IALAxB,EAAK,SAAWoB,EAKXX,EAAI,KAAK,MAAMP,EAAE,SAAW,CAAC,EAAGO,GAAK,EAAGA,IAC5CP,EAAE,WAAWC,EAAMM,CAAC,EAKrBe,EAAOD,EACP,GAECd,EAAIP,EAAE,KAAK,CAAC,EACZA,EAAE,KAAK,CAAC,EAAIA,EAAE,KAAKA,EAAE,UAAU,EAC/BA,EAAE,WAAWC,EAAM,CAAC,EACpBO,EAAIR,EAAE,KAAK,CAAC,EAEZA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIO,EACvBP,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIQ,EAGvBP,EAAKqB,EAAO,CAAC,EAAKrB,EAAKM,EAAI,CAAC,EAAIN,EAAKO,EAAI,CAAC,EAC1CR,EAAE,MAAMsB,CAAI,EAAI,KAAK,IAAItB,EAAE,MAAMO,CAAC,EAAGP,EAAE,MAAMQ,CAAC,CAAC,EAAI,EACnDP,EAAKM,EAAI,EAAI,CAAC,EAAIN,EAAKO,EAAI,EAAI,CAAC,EAAIc,EAGpCtB,EAAE,KAAK,CAAC,EAAIsB,IACZtB,EAAE,WAAWC,EAAM,CAAC,QACZD,EAAE,UAAY,GAEvBA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIA,EAAE,KAAK,CAAC,EAK/BD,EAAWC,CAAC,EAGZiB,EAAUhB,EAAMH,EAAK,SAAUE,EAAE,QAAQ,CAC1C,CAED,CAEAH,GAAK,aAAe,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAAE,OAAO,GAAGR,GAAa,CACnE,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EAAG,CAAC,EAAG,EAAE,EACvG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,GAAI,EAAE,EAAG,CAAC,EAAG,EAAE,CAAC,CAAC,CAAC,EAE1FQ,GAAK,YAAc,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,CAAC,EAEjIA,GAAK,UAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,MAAO,MACjJ,KAAK,EAKNA,GAAK,OAAS,SAAU0B,EAAM,CAC7B,OAASA,EAAQ,IAAM3B,GAAW2B,CAAI,EAAI3B,GAAW,KAAQ2B,IAAU,EAAE,CAC1E,EAGA1B,GAAK,YAAc,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAGzGA,GAAK,YAAc,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,EAGpHA,GAAK,aAAe,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAE5EA,GAAK,SAAW,CAAC,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAE,EAIjF,SAAS2B,GAAWC,EAAaC,EAAYC,EAAYN,EAAOhB,EAAY,CAC3E,IAAMP,EAAO,KACbA,EAAK,YAAc2B,EACnB3B,EAAK,WAAa4B,EAClB5B,EAAK,WAAa6B,EAClB7B,EAAK,MAAQuB,EACbvB,EAAK,WAAaO,CACnB,CAEA,IAAMuB,GAA2B,CAAC,GAAI,IAAK,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,EAAG,IAAK,GAAI,IAAK,GAAI,IAAK,GAAI,IAAK,GAAI,IAAK,GACvJ,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,EAAG,IAAK,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,GAC/I,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,EAAG,IAAK,GAAI,IAAK,GAAI,IAAK,GAAI,IAAK,GAAI,IAAK,GAC9I,IAAK,GAAI,IAAK,IAAK,IAAK,EAAG,IAAK,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,EAAG,IAAK,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,GAC9I,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAC5I,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAC5I,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,IAC/I,IAAK,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,GAC5I,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,EAAG,GAAI,GAAI,IAAK,GAAI,GAAI,GAAI,IAAK,EAAG,GAAI,GAAI,IAAK,GAAI,GAAI,GAC/I,IAAK,EAAG,IAAK,GAAI,IAAK,GAAI,IAAK,GAAI,GAAG,EACjCC,GAA4BxC,GAAa,CAAC,CAAC,IAAK,CAAC,EAAG,CAAC,IAAK,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,EAAG,CAAC,CAAC,CAAC,EACpFmC,GAAW,aAAejC,GAAUqC,GAAyB,IAAI,CAACnC,EAAOqC,IAAU,CAACrC,EAAOoC,GAA0BC,CAAK,CAAC,CAAC,CAAC,EAE7H,IAAMC,GAA0B,CAAC,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,EAAE,EACvIC,GAA2B3C,GAAa,CAAC,CAAC,GAAI,CAAC,CAAC,CAAC,EACvDmC,GAAW,aAAejC,GAAUwC,GAAwB,IAAI,CAACtC,EAAOqC,IAAU,CAACrC,EAAOuC,GAAyBF,CAAK,CAAC,CAAC,CAAC,EAE3HN,GAAW,cAAgB,IAAIA,GAAWA,GAAW,aAAc3B,GAAK,YAAa,IAAW,EAAG,IAAS,EAAQ,EAEpH2B,GAAW,cAAgB,IAAIA,GAAWA,GAAW,aAAc3B,GAAK,YAAa,EAAG,GAAS,EAAQ,EAEzG2B,GAAW,eAAiB,IAAIA,GAAW,KAAM3B,GAAK,aAAc,EAAG,GAAU,CAAW,EAI5F,IAAMoC,GAAgB,EAChBC,GAAgB,EAEtB,SAASC,GAAOC,EAAaC,EAAUC,EAAaC,EAAWC,EAAM,CACpE,IAAM1C,EAAO,KACbA,EAAK,YAAcsC,EACnBtC,EAAK,SAAWuC,EAChBvC,EAAK,YAAcwC,EACnBxC,EAAK,UAAYyC,EACjBzC,EAAK,KAAO0C,CACb,CAEA,IAAMC,GAAS,EACTC,GAAO,EACPC,GAAO,EACPC,GAAe,CACpB,IAAIT,GAAO,EAAG,EAAG,EAAG,EAAGM,EAAM,EAC7B,IAAIN,GAAO,EAAG,EAAG,EAAG,EAAGO,EAAI,EAC3B,IAAIP,GAAO,EAAG,EAAG,GAAI,EAAGO,EAAI,EAC5B,IAAIP,GAAO,EAAG,EAAG,GAAI,GAAIO,EAAI,EAC7B,IAAIP,GAAO,EAAG,EAAG,GAAI,GAAIQ,EAAI,EAC7B,IAAIR,GAAO,EAAG,GAAI,GAAI,GAAIQ,EAAI,EAC9B,IAAIR,GAAO,EAAG,GAAI,IAAK,IAAKQ,EAAI,EAChC,IAAIR,GAAO,EAAG,GAAI,IAAK,IAAKQ,EAAI,EAChC,IAAIR,GAAO,GAAI,IAAK,IAAK,KAAMQ,EAAI,EACnC,IAAIR,GAAO,GAAI,IAAK,IAAK,KAAMQ,EAAI,CACpC,EAEME,GAAW,CAAC,kBAEjB,aACA,GACA,GACA,eACA,aACA,GACA,eACA,GACA,EAAE,EAGGC,GAAW,EAGXC,GAAY,EAGZC,GAAgB,EAGhBC,GAAa,EAGbC,GAAc,GAEdC,GAAa,GACbC,GAAa,IACbC,GAAe,IAGfC,GAAa,EAEbC,GAAe,EACfC,GAAe,EACfC,GAAY,EAEZC,GAAY,EACZC,GAAY,IACZC,GAAiBD,GAAYD,GAAY,EAE/C,SAASG,GAAQ5D,EAAMM,EAAGC,EAAGsD,EAAO,CACnC,IAAMC,EAAM9D,EAAKM,EAAI,CAAC,EAChByD,EAAM/D,EAAKO,EAAI,CAAC,EACtB,OAAQuD,EAAMC,GAAQD,GAAOC,GAAOF,EAAMvD,CAAC,GAAKuD,EAAMtD,CAAC,CACxD,CAEA,SAASyD,IAAU,CAElB,IAAMnE,EAAO,KACToE,EACAC,EAEAC,EASAC,EAEAC,EACAC,EACAC,EAEAC,EASAC,EAIAC,EAKAC,EAEAC,EACAC,EACAC,EACAC,EAMAC,EAKAC,EAEAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIAC,EAIAC,EAKAC,EAMAC,EACAC,EAGAC,EAGAC,EAEAC,EACAC,EACAC,EAEEC,EAAS,IAAItG,GACbuG,EAAS,IAAIvG,GACbwG,EAAU,IAAIxG,GAQpBC,EAAK,MAAQ,CAAC,EAmBd,IAAIwG,EAEAC,EAIAC,EACAC,GAIAC,GAIAC,GAGJ7G,EAAK,SAAW,CAAC,EAGjBA,EAAK,KAAO,CAAC,EAEbkG,EAAY,CAAC,EACbC,EAAY,CAAC,EACbC,EAAU,CAAC,EAEX,SAASU,IAAU,CAClBlC,EAAc,EAAIJ,EAElBM,EAAKE,EAAY,CAAC,EAAI,EACtB,QAAS+B,EAAI,EAAGA,EAAI/B,EAAY,EAAG+B,IAClCjC,EAAKiC,CAAC,EAAI,EAIXlB,EAAiB/C,GAAagD,CAAK,EAAE,SACrCE,EAAalD,GAAagD,CAAK,EAAE,YACjCG,EAAanD,GAAagD,CAAK,EAAE,YACjCF,EAAmB9C,GAAagD,CAAK,EAAE,UAEvCN,EAAW,EACXJ,EAAc,EACdM,EAAY,EACZL,EAAeM,EAAc/B,GAAY,EACzC2B,EAAkB,EAClBR,EAAQ,CACT,CAEA,SAASiC,IAAa,CACrB,IAAID,EAEJ,IAAKA,EAAI,EAAGA,EAAI,IAASA,IACxBb,EAAUa,EAAI,CAAC,EAAI,EACpB,IAAKA,EAAI,EAAGA,EAAI,GAASA,IACxBZ,EAAUY,EAAI,CAAC,EAAI,EACpB,IAAKA,EAAI,EAAGA,EAAI,GAAUA,IACzBX,EAAQW,EAAI,CAAC,EAAI,EAElBb,EAAU,IAAY,CAAC,EAAI,EAC3BlG,EAAK,QAAUA,EAAK,WAAa,EACjCyG,EAAWC,EAAU,CACtB,CAGA,SAASO,IAAU,CAElBZ,EAAO,SAAWH,EAClBG,EAAO,UAAY3E,GAAW,cAE9B4E,EAAO,SAAWH,EAClBG,EAAO,UAAY5E,GAAW,cAE9B6E,EAAQ,SAAWH,EACnBG,EAAQ,UAAY7E,GAAW,eAE/BkF,GAAS,EACTC,GAAW,EACXF,GAAe,EAGfK,GAAW,CACZ,CAOAhH,EAAK,WAAa,SAAUG,EAC3B+G,EACC,CACD,IAAMC,EAAOnH,EAAK,KACZoH,EAAID,EAAKD,CAAC,EACZG,EAAIH,GAAK,EACb,KAAOG,GAAKrH,EAAK,WAEZqH,EAAIrH,EAAK,UAAY+D,GAAQ5D,EAAMgH,EAAKE,EAAI,CAAC,EAAGF,EAAKE,CAAC,EAAGrH,EAAK,KAAK,GACtEqH,IAGG,CAAAtD,GAAQ5D,EAAMiH,EAAGD,EAAKE,CAAC,EAAGrH,EAAK,KAAK,IAIxCmH,EAAKD,CAAC,EAAIC,EAAKE,CAAC,EAChBH,EAAIG,EAEJA,IAAM,EAEPF,EAAKD,CAAC,EAAIE,CACX,EAIA,SAASE,GAAUnH,EAClBiB,EACC,CACD,IAAImG,EAAU,GACVC,EACAC,EAAUtH,EAAK,EAAI,EAAI,CAAC,EACxBuH,EAAQ,EACRC,EAAY,EACZC,GAAY,EAEZH,IAAY,IACfE,EAAY,IACZC,GAAY,GAEbzH,GAAMiB,EAAW,GAAK,EAAI,CAAC,EAAI,MAE/B,QAASX,GAAI,EAAGA,IAAKW,EAAUX,KAC9B+G,EAASC,EACTA,EAAUtH,GAAMM,GAAI,GAAK,EAAI,CAAC,EAC1B,IAAEiH,EAAQC,GAAaH,GAAUC,KAE1BC,EAAQE,GAClBxB,EAAQoB,EAAS,CAAC,GAAKE,EACbF,IAAW,GACjBA,GAAUD,GACbnB,EAAQoB,EAAS,CAAC,IACnBpB,EAAQ,GAAU,CAAC,KACTsB,GAAS,GACnBtB,EAAQ,GAAY,CAAC,IAErBA,EAAQ,GAAc,CAAC,IAExBsB,EAAQ,EACRH,EAAUC,EACNC,IAAY,GACfE,EAAY,IACZC,GAAY,GACFJ,GAAUC,GACpBE,EAAY,EACZC,GAAY,IAEZD,EAAY,EACZC,GAAY,GAGf,CAIA,SAASC,IAAgB,CACxB,IAAIC,EAeJ,IAZAR,GAAUpB,EAAWG,EAAO,QAAQ,EACpCiB,GAAUnB,EAAWG,EAAO,QAAQ,EAGpCC,EAAQ,WAAWvG,CAAI,EAQlB8H,EAAc,GAAW,EAAGA,GAAe,GAC3C1B,EAAQrG,GAAK,SAAS+H,CAAW,EAAI,EAAI,CAAC,IAAM,EADFA,IAClD,CAID,OAAA9H,EAAK,SAAW,GAAK8H,EAAc,GAAK,EAAI,EAAI,EAEzCA,CACR,CAIA,SAASC,GAASC,EAAG,CACpBhI,EAAK,YAAYA,EAAK,SAAS,EAAIgI,CACpC,CAEA,SAASC,GAAUC,EAAG,CACrBH,GAASG,EAAI,GAAI,EACjBH,GAAUG,IAAM,EAAK,GAAI,CAC1B,CAEA,SAASC,GAAYtI,EAAG,CACvBkI,GAAUlI,GAAK,EAAK,GAAI,EACxBkI,GAAUlI,EAAI,IAAQ,GAAI,CAC3B,CAEA,SAASuI,GAAUzI,EAAOD,EAAQ,CACjC,IAAI2I,EACEpH,EAAMvB,EACRmH,GAAW,GAAW5F,GACzBoH,EAAM1I,EAENiH,IAAYyB,GAAOxB,GAAY,MAC/BoB,GAAUrB,EAAM,EAChBA,GAASyB,IAAS,GAAWxB,GAC7BA,IAAY5F,EAAM,KAGlB2F,IAAajH,GAAUkH,GAAY,MACnCA,IAAY5F,EAEd,CAEA,SAASqH,GAAUC,EAAGpI,EAAM,CAC3B,IAAMqI,EAAKD,EAAI,EACfH,GAAUjI,EAAKqI,CAAE,EAAI,MAAQrI,EAAKqI,EAAK,CAAC,EAAI,KAAM,CACnD,CAIA,SAASC,GAAUtI,EAClBiB,EACC,CACD,IAAIX,EACA8G,EAAU,GACVC,EACAC,EAAUtH,EAAK,EAAI,EAAI,CAAC,EACxBuH,EAAQ,EACRC,GAAY,EACZC,GAAY,EAOhB,IALIH,IAAY,IACfE,GAAY,IACZC,GAAY,GAGRnH,EAAI,EAAGA,GAAKW,EAAUX,IAG1B,GAFA+G,EAASC,EACTA,EAAUtH,GAAMM,EAAI,GAAK,EAAI,CAAC,EAC1B,IAAEiH,EAAQC,IAAaH,GAAUC,GAE9B,IAAIC,EAAQE,GAClB,GACCU,GAAUd,EAAQpB,CAAO,QACjB,EAAEsB,IAAU,QACXF,IAAW,GACjBA,GAAUD,IACbe,GAAUd,EAAQpB,CAAO,EACzBsB,KAEDY,GAAU,GAASlC,CAAO,EAC1BgC,GAAUV,EAAQ,EAAG,CAAC,GACZA,GAAS,IACnBY,GAAU,GAAWlC,CAAO,EAC5BgC,GAAUV,EAAQ,EAAG,CAAC,IAEtBY,GAAU,GAAalC,CAAO,EAC9BgC,GAAUV,EAAQ,GAAI,CAAC,GAExBA,EAAQ,EACRH,EAAUC,EACNC,IAAY,GACfE,GAAY,IACZC,GAAY,GACFJ,GAAUC,GACpBE,GAAY,EACZC,GAAY,IAEZD,GAAY,EACZC,GAAY,GAGf,CAKA,SAASc,GAAeC,EAAQC,EAAQC,EAAS,CAChD,IAAIC,EAKJ,IAHAV,GAAUO,EAAS,IAAK,CAAC,EACzBP,GAAUQ,EAAS,EAAG,CAAC,EACvBR,GAAUS,EAAU,EAAG,CAAC,EACnBC,EAAO,EAAGA,EAAOD,EAASC,IAC9BV,GAAUhC,EAAQrG,GAAK,SAAS+I,CAAI,EAAI,EAAI,CAAC,EAAG,CAAC,EAElDL,GAAUvC,EAAWyC,EAAS,CAAC,EAC/BF,GAAUtC,EAAWyC,EAAS,CAAC,CAChC,CAGA,SAASG,IAAW,CACflC,IAAY,IACfoB,GAAUrB,EAAM,EAChBA,GAAS,EACTC,GAAW,GACDA,IAAY,IACtBkB,GAASnB,GAAS,GAAI,EACtBA,MAAY,EACZC,IAAY,EAEd,CAWA,SAASmC,IAAY,CACpBZ,GAAU1E,IAAgB,EAAG,CAAC,EAC9B4E,GAAU,IAAW5G,GAAW,YAAY,EAE5CqH,GAAS,EAML,EAAIpC,GAAe,GAAKE,GAAW,IACtCuB,GAAU1E,IAAgB,EAAG,CAAC,EAC9B4E,GAAU,IAAW5G,GAAW,YAAY,EAC5CqH,GAAS,GAEVpC,GAAe,CAChB,CAIA,SAASsC,GAAUxH,EAClByH,EACC,CACD,IAAIC,EAAYC,EAAWC,EAgB3B,GAfArJ,EAAK,SAASyG,CAAQ,EAAIhF,EAC1BzB,EAAK,OAAOyG,CAAQ,EAAIyC,EAAK,IAC7BzC,IAEIhF,IAAS,EAEZyE,EAAUgD,EAAK,CAAC,KAEhBxC,IAEAjF,IACAyE,GAAWnG,GAAK,aAAamJ,CAAE,EAAI,IAAW,GAAK,CAAC,IACpD/C,EAAUpG,GAAK,OAAO0B,CAAI,EAAI,CAAC,KAG3B,EAAAgF,EAAW,OAAiBX,EAAQ,EAAG,CAI3C,IAFAqD,EAAa1C,EAAW,EACxB2C,EAAY5D,EAAWJ,EAClBiE,EAAQ,EAAGA,EAAQ,GAASA,IAChCF,GAAchD,EAAUkD,EAAQ,CAAC,GAAK,EAAItJ,GAAK,YAAYsJ,CAAK,GAGjE,GADAF,KAAgB,EACXzC,EAAU,KAAK,MAAMD,EAAW,CAAC,GAAM0C,EAAa,KAAK,MAAMC,EAAY,CAAC,EAChF,MAAO,EACT,CAEA,OAAQ3C,GAAYD,EAAc,CAInC,CAGA,SAAS8C,GAAeC,EAAOC,EAAO,CACrC,IAAI/H,EACAyH,EACAO,EAAK,EACLzI,EACAX,EAEJ,GAAIoG,IAAa,EAChB,GACChF,EAAOzB,EAAK,SAASyJ,CAAE,EACvBP,EAAKlJ,EAAK,OAAOyJ,CAAE,EACnBA,IAEIhI,IAAS,EACZ6G,GAAUY,EAAIK,CAAK,GAGnBvI,EAAOjB,GAAK,aAAamJ,CAAE,EAE3BZ,GAAUtH,EAAO,IAAW,EAAGuI,CAAK,EAEpClJ,EAAQN,GAAK,YAAYiB,CAAI,EACzBX,IAAU,IACb6I,GAAMnJ,GAAK,YAAYiB,CAAI,EAC3BoH,GAAUc,EAAI7I,CAAK,GAEpBoB,IACAT,EAAOjB,GAAK,OAAO0B,CAAI,EAEvB6G,GAAUtH,EAAMwI,CAAK,EACrBnJ,EAAQN,GAAK,YAAYiB,CAAI,EACzBX,IAAU,IACboB,GAAQ1B,GAAK,UAAUiB,CAAI,EAC3BoH,GAAU3G,EAAMpB,CAAK,UAGfoJ,EAAKhD,GAGf6B,GAAU,IAAWiB,CAAK,EAC1B5C,GAAe4C,EAAM,IAAY,EAAI,CAAC,CACvC,CAGA,SAASG,IAAY,CAChB7C,GAAW,EACdoB,GAAUrB,EAAM,EACNC,GAAW,GACrBkB,GAASnB,GAAS,GAAI,EAEvBA,GAAS,EACTC,GAAW,CACZ,CAIA,SAAS8C,GAAWC,EACnB3I,EACA4I,EACC,CACDH,GAAU,EACV/C,GAAe,EAEXkD,IACH5B,GAAUhH,CAAG,EACbgH,GAAU,CAAChH,CAAG,GAGfjB,EAAK,YAAY,IAAI2E,EAAI,SAASiF,EAAKA,EAAM3I,CAAG,EAAGjB,EAAK,OAAO,EAC/DA,EAAK,SAAWiB,CACjB,CAGA,SAAS6I,GAAiBF,EACzBG,EACAC,EACC,CACD5B,IAAW3E,IAAgB,IAAMuG,EAAM,EAAI,GAAI,CAAC,EAChDL,GAAWC,EAAKG,EAAY,EAAI,CACjC,CAIA,SAASE,GAAgBL,EACxBG,EACAC,EACC,CACD,IAAIE,EAAUC,EACVrC,EAAc,EAGdhC,EAAQ,GAEXO,EAAO,WAAWrG,CAAI,EAEtBsG,EAAO,WAAWtG,CAAI,EAStB8H,EAAcD,GAAc,EAI5BqC,EAAYlK,EAAK,QAAU,EAAI,IAAO,EACtCmK,EAAenK,EAAK,WAAa,EAAI,IAAO,EAExCmK,GAAeD,IAClBA,EAAWC,IAEZD,EAAWC,EAAcJ,EAAa,EAGlCA,EAAa,GAAKG,GAAaN,GAAO,GAQ1CE,GAAiBF,EAAKG,EAAYC,CAAG,EAC3BG,GAAeD,GACzB9B,IAAW1E,IAAgB,IAAMsG,EAAM,EAAI,GAAI,CAAC,EAChDV,GAAe5H,GAAW,aAAcA,GAAW,YAAY,IAE/D0G,IAAWzE,IAAa,IAAMqG,EAAM,EAAI,GAAI,CAAC,EAC7CtB,GAAerC,EAAO,SAAW,EAAGC,EAAO,SAAW,EAAGwB,EAAc,CAAC,EACxEwB,GAAepD,EAAWC,CAAS,GAMpCa,GAAW,EAEPgD,GACHN,GAAU,CAEZ,CAEA,SAASU,GAAiBJ,EAAK,CAC9BC,GAAgB7E,GAAe,EAAIA,EAAc,GAAII,EAAWJ,EAAa4E,CAAG,EAChF5E,EAAcI,EACdpB,EAAK,cAAc,CACpB,CAUA,SAASiG,IAAc,CACtB,IAAI5J,EAAGC,EACHsH,EACAsC,EAEJ,EAAG,CAIF,GAHAA,EAAQ1F,EAAcc,EAAYF,EAG9B8E,IAAS,GAAK9E,IAAa,GAAKE,IAAc,EACjD4E,EAAO9F,UACG8F,GAAQ,GAIlBA,YAMU9E,GAAYhB,EAASA,EAASV,GAAe,CACvDa,EAAI,IAAIA,EAAI,SAASH,EAAQA,EAASA,CAAM,EAAG,CAAC,EAEhDiB,GAAejB,EACfgB,GAAYhB,EACZY,GAAeZ,EAUf/D,EAAIuE,EACJgD,EAAIvH,EACJ,GACCC,EAAKoE,EAAK,EAAEkD,CAAC,EAAI,MACjBlD,EAAKkD,CAAC,EAAKtH,GAAK8D,EAAS9D,EAAI8D,EAAS,QAC9B,EAAE/D,IAAM,GAEjBA,EAAI+D,EACJwD,EAAIvH,EACJ,GACCC,EAAKmE,EAAK,EAAEmD,CAAC,EAAI,MACjBnD,EAAKmD,CAAC,EAAKtH,GAAK8D,EAAS9D,EAAI8D,EAAS,QAG9B,EAAE/D,IAAM,GACjB6J,GAAQ9F,CACT,CAEA,GAAIJ,EAAK,WAAa,EACrB,OAaD3D,EAAI2D,EAAK,SAASO,EAAKa,EAAWE,EAAW4E,CAAI,EACjD5E,GAAajF,EAGTiF,GAAa9B,KAChBmB,EAAQJ,EAAIa,CAAQ,EAAI,IACxBT,GAAWA,GAAUI,EAAeR,EAAIa,EAAW,CAAC,EAAI,KAASN,EAMnE,OAASQ,EAAY5B,IAAiBM,EAAK,WAAa,EACzD,CAUA,SAASmG,GAAeC,EAAO,CAI9B,IAAIC,EAAiB,MACjBC,EAQJ,IANID,EAAiBnG,EAAmB,IACvCmG,EAAiBnG,EAAmB,KAKxB,CAEZ,GAAIoB,GAAa,EAAG,CAEnB,GADA2E,GAAY,EACR3E,IAAc,GAAK8E,GAAS,EAC/B,OAAOxH,GACR,GAAI0C,IAAc,EACjB,KACF,CAoBA,GAlBAF,GAAYE,EACZA,EAAY,EAGZgF,EAAYtF,EAAcqF,GACtBjF,IAAa,GAAKA,GAAYkF,KAEjChF,EAAaF,EAAWkF,EACxBlF,EAAWkF,EAEXN,GAAiB,EAAK,EAClBhG,EAAK,YAAc,IAOpBoB,EAAWJ,GAAeZ,EAASV,KACtCsG,GAAiB,EAAK,EAClBhG,EAAK,YAAc,GACtB,OAAOpB,EAEV,CAGA,OADAoH,GAAiBI,GAAS,CAAQ,EAC9BpG,EAAK,YAAc,EACdoG,GAAS,EAAYtH,GAAgBF,GAEvCwH,GAAS,EAAWrH,GAAaF,EACzC,CAEA,SAAS0H,GAAcC,EAAW,CACjC,IAAIC,EAAejF,EACfkF,EAAOtF,EACPuF,EACA9J,EACA+J,EAAWrF,EACTsF,EAAQzF,EAAYhB,EAASV,GAAiB0B,GAAYhB,EAASV,IAAiB,EACtFoH,GAAcjF,EAKZkF,GAAQzG,EAER0G,GAAS5F,EAAW3B,GACtBwH,GAAY1G,EAAImG,EAAOE,EAAW,CAAC,EACnCM,GAAW3G,EAAImG,EAAOE,CAAQ,EAO9BrF,GAAeK,IAClB6E,IAAiB,GAMdK,GAAcxF,IACjBwF,GAAcxF,GAEf,EAKC,IAJAqF,EAAQH,EAIJ,EAAAjG,EAAIoG,EAAQC,CAAQ,GAAKM,IAAY3G,EAAIoG,EAAQC,EAAW,CAAC,GAAKK,IAAa1G,EAAIoG,CAAK,GAAKpG,EAAImG,CAAI,GACrGnG,EAAI,EAAEoG,CAAK,GAAKpG,EAAImG,EAAO,CAAC,GAQhC,CAAAA,GAAQ,EACRC,IAKA,EAAG,OAEMpG,EAAI,EAAEmG,CAAI,GAAKnG,EAAI,EAAEoG,CAAK,GAAKpG,EAAI,EAAEmG,CAAI,GAAKnG,EAAI,EAAEoG,CAAK,GAAKpG,EAAI,EAAEmG,CAAI,GAAKnG,EAAI,EAAEoG,CAAK,GAC9FpG,EAAI,EAAEmG,CAAI,GAAKnG,EAAI,EAAEoG,CAAK,GAAKpG,EAAI,EAAEmG,CAAI,GAAKnG,EAAI,EAAEoG,CAAK,GAAKpG,EAAI,EAAEmG,CAAI,GAAKnG,EAAI,EAAEoG,CAAK,GACxFpG,EAAI,EAAEmG,CAAI,GAAKnG,EAAI,EAAEoG,CAAK,GAAKpG,EAAI,EAAEmG,CAAI,GAAKnG,EAAI,EAAEoG,CAAK,GAAKD,EAAOM,IAKxE,GAHAnK,EAAM4C,IAAauH,GAASN,GAC5BA,EAAOM,GAASvH,GAEZ5C,EAAM+J,EAAU,CAGnB,GAFAvF,EAAcmF,EACdI,EAAW/J,EACPA,GAAOiK,GACV,MACDG,GAAY1G,EAAImG,EAAOE,EAAW,CAAC,EACnCM,GAAW3G,EAAImG,EAAOE,CAAQ,CAC/B,SAESJ,EAAa/F,EAAK+F,EAAYO,EAAK,EAAI,OAAWF,GAAS,EAAEJ,IAAiB,GAExF,OAAIG,GAAYtF,EACRsF,EACDtF,CACR,CAOA,SAAS6F,GAAaf,EAAO,CAE5B,IAAIgB,EAAY,EACZC,EAGJ,OAAa,CAKZ,GAAI/F,EAAY5B,GAAe,CAE9B,GADAuG,GAAY,EACR3E,EAAY5B,IAAiB0G,GAAS,EACzC,OAAOxH,GAER,GAAI0C,IAAc,EACjB,KACF,CAyBA,GArBIA,GAAa9B,KAChBmB,GAAWA,GAAUI,EAAeR,EAAKa,GAAa5B,GAAY,EAAE,EAAI,KAASsB,EAGjFsG,EAAa1G,EAAKC,CAAK,EAAI,MAC3BF,EAAKW,EAAWd,CAAM,EAAII,EAAKC,CAAK,EACpCD,EAAKC,CAAK,EAAIS,GAMXgG,IAAc,IAAOhG,EAAWgG,EAAa,QAAWhH,EAASV,IAIhEiC,GAAY,IACfV,EAAesF,GAAca,CAAS,GAIpCnG,GAAgBzB,GASnB,GANA6H,EAASxC,GAAUzD,EAAWC,EAAaJ,EAAezB,EAAS,EAEnE8B,GAAaL,EAITA,GAAgBQ,GAAkBH,GAAa9B,GAAW,CAC7DyB,IACA,GACCG,IAEAT,GAAUA,GAASI,EAAeR,EAAKa,GAAa5B,GAAY,EAAE,EAAI,KAASsB,EAE/EsG,EAAa1G,EAAKC,CAAK,EAAI,MAC3BF,EAAKW,EAAWd,CAAM,EAAII,EAAKC,CAAK,EACpCD,EAAKC,CAAK,EAAIS,QAIN,EAAEH,IAAiB,GAC5BG,GACD,MACCA,GAAYH,EACZA,EAAe,EACfN,EAAQJ,EAAIa,CAAQ,EAAI,IAExBT,GAAWA,GAAUI,EAAeR,EAAIa,EAAW,CAAC,EAAI,KAASN,OAQlEuG,EAASxC,GAAU,EAAGtE,EAAIa,CAAQ,EAAI,GAAI,EAC1CE,IACAF,IAED,GAAIiG,IAEHrB,GAAiB,EAAK,EAClBhG,EAAK,YAAc,GACtB,OAAOpB,EAEV,CAGA,OADAoH,GAAiBI,GAAS,CAAQ,EAC9BpG,EAAK,YAAc,EAClBoG,GAAS,EACLtH,GAEAF,GAEFwH,GAAS,EAAWrH,GAAaF,EACzC,CAKA,SAASyI,GAAalB,EAAO,CAE5B,IAAIgB,EAAY,EACZC,EACAE,EAIJ,OAAa,CAMZ,GAAIjG,EAAY5B,GAAe,CAE9B,GADAuG,GAAY,EACR3E,EAAY5B,IAAiB0G,GAAS,EACzC,OAAOxH,GAER,GAAI0C,IAAc,EACjB,KACF,CAsCA,GAjCIA,GAAa9B,KAChBmB,GAAWA,GAAUI,EAAeR,EAAKa,GAAa5B,GAAY,EAAE,EAAI,KAASsB,EAEjFsG,EAAa1G,EAAKC,CAAK,EAAI,MAC3BF,EAAKW,EAAWd,CAAM,EAAII,EAAKC,CAAK,EACpCD,EAAKC,CAAK,EAAIS,GAIfG,EAAcN,EACdC,EAAaG,EACbJ,EAAezB,GAAY,EAEvB4H,IAAc,GAAK7F,EAAcE,IAAoBL,EAAWgG,EAAa,QAAWhH,EAASV,KAKhGiC,GAAY,IACfV,EAAesF,GAAca,CAAS,GAInCnG,GAAgB,IAAMU,GAAY,GAAeV,GAAgBzB,IAAa4B,EAAWC,EAAc,QAI1GJ,EAAezB,GAAY,IAMzB+B,GAAe/B,IAAayB,GAAgBM,EAAa,CAC5DgG,EAAanG,EAAWE,EAAY9B,GAKpC6H,EAASxC,GAAUzD,EAAW,EAAIF,EAAYK,EAAc/B,EAAS,EAMrE8B,GAAaC,EAAc,EAC3BA,GAAe,EACf,EACK,EAAEH,GAAYmG,IACjB5G,GAAWA,GAAUI,EAAeR,EAAKa,GAAa5B,GAAY,EAAE,EAAI,KAASsB,EAEjFsG,EAAa1G,EAAKC,CAAK,EAAI,MAC3BF,EAAKW,EAAWd,CAAM,EAAII,EAAKC,CAAK,EACpCD,EAAKC,CAAK,EAAIS,SAEP,EAAEG,IAAgB,GAK3B,GAJAJ,EAAkB,EAClBF,EAAezB,GAAY,EAC3B4B,IAEIiG,IACHrB,GAAiB,EAAK,EAClBhG,EAAK,YAAc,GACtB,OAAOpB,EAEV,SAAWuC,IAAoB,GAa9B,GAPAkG,EAASxC,GAAU,EAAGtE,EAAIa,EAAW,CAAC,EAAI,GAAI,EAE1CiG,GACHrB,GAAiB,EAAK,EAEvB5E,IACAE,IACItB,EAAK,YAAc,EACtB,OAAOpB,QAKRuC,EAAkB,EAClBC,IACAE,GAEF,CAQA,OANIH,IAAoB,IACvBkG,EAASxC,GAAU,EAAGtE,EAAIa,EAAW,CAAC,EAAI,GAAI,EAC9CD,EAAkB,GAEnB6E,GAAiBI,GAAS,CAAQ,EAE9BpG,EAAK,YAAc,EAClBoG,GAAS,EACLtH,GAEAF,GAGFwH,GAAS,EAAWrH,GAAaF,EACzC,CAEA,SAAS2I,GAAaxH,EAAM,CAC3B,OAAAA,EAAK,SAAWA,EAAK,UAAY,EACjCA,EAAK,IAAM,KAEXpE,EAAK,QAAU,EACfA,EAAK,YAAc,EAEnBqE,EAASf,GAETiB,EAAa,EAEb0C,GAAQ,EACRH,GAAQ,EACD,CACR,CAEA9G,EAAK,YAAc,SAAUoE,EAAMyH,EAAQlL,EAAMmL,EAASC,EAAUC,EAAW,CAqB9E,OApBKF,IACJA,EAAUtI,IACNuI,IACJA,EAAW3J,IACP4J,IACJA,EAAY,GAUb5H,EAAK,IAAM,KAEPyH,GAAU,KACbA,EAAS,GAENE,EAAW,GAAKA,EAAW5J,IAAiB2J,GAAWtI,IAAc7C,EAAO,GAAKA,EAAO,IAAMkL,EAAS,GAAKA,EAAS,GAAKG,EAAY,GACtIA,EAAY,EACR,IAGR5H,EAAK,OAASpE,EAEdyE,EAAS9D,EACT6D,EAAS,GAAKC,EACdC,EAASF,EAAS,EAElBS,EAAY8G,EAAW,EACvB/G,EAAY,GAAKC,EACjBC,EAAYF,EAAY,EACxBG,EAAa,KAAK,OAAOF,EAAYrB,GAAY,GAAKA,EAAS,EAE/De,EAAM,IAAI,WAAWH,EAAS,CAAC,EAC/BK,EAAO,CAAC,EACRC,EAAO,CAAC,EAER0B,EAAc,GAAMuF,EAAW,EAE/B/L,EAAK,YAAc,IAAI,WAAWwG,EAAc,CAAC,EACjDlC,EAAmBkC,EAAc,EAEjCxG,EAAK,SAAW,IAAI,YAAYwG,CAAW,EAC3CxG,EAAK,OAAS,IAAI,WAAWwG,CAAW,EAExCV,EAAQ+F,EAER9F,EAAWiG,EAEJJ,GAAaxH,CAAI,EACzB,EAEApE,EAAK,WAAa,UAAY,CAC7B,OAAIqE,GAAUhB,IAAcgB,GAAUf,IAAce,GAAUd,GACtD,IAGRvD,EAAK,OAAS,KACdA,EAAK,SAAW,KAChBA,EAAK,YAAc,KACnB8E,EAAO,KACPD,EAAO,KACPF,EAAM,KAEN3E,EAAK,OAAS,KACPqE,GAAUf,GAAa,GAAe,EAC9C,EAEAtD,EAAK,cAAgB,SAAUoE,EAAMyH,EAAQG,EAAW,CACvD,IAAIC,EAAM,EAKV,OAHIJ,GAAU,KACbA,EAAS,GAENA,EAAS,GAAKA,EAAS,GAAKG,EAAY,GAAKA,EAAY,EACrD,IAGJlJ,GAAagD,CAAK,EAAE,MAAQhD,GAAa+I,CAAM,EAAE,MAAQzH,EAAK,WAAa,IAE9E6H,EAAM7H,EAAK,QAAQ,CAAe,GAG/B0B,GAAS+F,IACZ/F,EAAQ+F,EACRhG,EAAiB/C,GAAagD,CAAK,EAAE,SACrCE,EAAalD,GAAagD,CAAK,EAAE,YACjCG,EAAanD,GAAagD,CAAK,EAAE,YACjCF,EAAmB9C,GAAagD,CAAK,EAAE,WAExCC,EAAWiG,EACJC,EACR,EAEAjM,EAAK,qBAAuB,SAAUkM,EAAOC,EAAYC,EAAY,CACpE,IAAI1M,EAAS0M,EACT3L,EAAGuB,EAAQ,EAEf,GAAI,CAACmK,GAAc9H,GAAUhB,GAC5B,MAAO,GAER,GAAI3D,EAASkE,GACZ,MAAO,GAiBR,IAhBIlE,EAAS8E,EAASV,KACrBpE,EAAS8E,EAASV,GAClB9B,EAAQoK,EAAa1M,GAEtBiF,EAAI,IAAIwH,EAAW,SAASnK,EAAOA,EAAQtC,CAAM,EAAG,CAAC,EAErD8F,EAAW9F,EACX0F,EAAc1F,EAMdqF,EAAQJ,EAAI,CAAC,EAAI,IACjBI,GAAWA,GAAUI,EAAeR,EAAI,CAAC,EAAI,KAASO,EAEjDzE,EAAI,EAAGA,GAAKf,EAASkE,GAAWnD,IACpCsE,GAAWA,GAAUI,EAAeR,EAAKlE,GAAMmD,GAAY,EAAE,EAAI,KAASsB,EAC1EL,EAAKpE,EAAIiE,CAAM,EAAII,EAAKC,CAAK,EAC7BD,EAAKC,CAAK,EAAItE,EAEf,MAAO,EACR,EAEAT,EAAK,QAAU,SAAUkM,EAAO1B,EAAO,CACtC,IAAIzD,EAAG8C,EAAQwC,EAAaC,EAAWC,EAEvC,GAAI/B,EAAQ,GAAYA,EAAQ,EAC/B,MAAO,GAGR,GAAI,CAAC0B,EAAM,UAAa,CAACA,EAAM,SAAWA,EAAM,WAAa,GAAO7H,GAAUd,IAAgBiH,GAAS,EACtG,OAAA0B,EAAM,IAAMnJ,GAAS,EAAe,GAAe,EAC5C,GAER,GAAImJ,EAAM,YAAc,EACvB,OAAAA,EAAM,IAAMnJ,GAAS,EAAe,GAAY,EACzC,GAwBR,GArBAqB,EAAO8H,EACPI,EAAY/H,EACZA,EAAaiG,EAGTnG,GAAUhB,KACbwG,EAAUrG,IAAeiB,EAAS,GAAM,IAAO,EAC/C4H,GAAgBvG,EAAQ,EAAK,MAAS,EAElCuG,EAAc,IACjBA,EAAc,GACfxC,GAAWwC,GAAe,EACtB7G,IAAa,IAChBqE,GAAUzG,IACXyG,GAAU,GAAMA,EAAS,GAEzBxF,EAASf,GACT6E,GAAY0B,CAAM,GAIf7J,EAAK,UAAY,GAEpB,GADAoE,EAAK,cAAc,EACfA,EAAK,YAAc,EAOtB,OAAAG,EAAa,GACN,UAOEH,EAAK,WAAa,GAAKoG,GAAS8B,GAAa9B,GAAS,EAChE,OAAApG,EAAK,IAAMrB,GAAS,EAAe,GAAY,EACxC,GAIR,GAAIsB,GAAUd,IAAgBa,EAAK,WAAa,EAC/C,OAAA8H,EAAM,IAAMnJ,GAAS,EAAe,GAAY,EACzC,GAIR,GAAIqB,EAAK,WAAa,GAAKsB,IAAc,GAAM8E,GAAS,GAAcnG,GAAUd,GAAe,CAE9F,OADAgJ,EAAS,GACDzJ,GAAagD,CAAK,EAAE,KAAM,CACjC,KAAKnD,GACJ4J,EAAShC,GAAeC,CAAK,EAC7B,MACD,KAAK5H,GACJ2J,EAAShB,GAAaf,CAAK,EAC3B,MACD,KAAK3H,GACJ0J,EAASb,GAAalB,CAAK,EAC3B,MACD,QACD,CAKA,IAHI+B,GAAUrJ,IAAiBqJ,GAAUpJ,MACxCkB,EAASd,IAENgJ,GAAUvJ,IAAYuJ,GAAUrJ,GACnC,OAAIkB,EAAK,YAAc,IACtBG,EAAa,IAEP,EASR,GAAIgI,GAAUtJ,GAAW,CACxB,GAAIuH,GAAS,EACZxB,GAAU,UAEVc,GAAiB,EAAG,EAAG,EAAK,EAGxBU,GAAS,EAEZ,IAAKzD,EAAI,EAAGA,EAAI/B,EAAiB+B,IAEhCjC,EAAKiC,CAAC,EAAI,EAIb,GADA3C,EAAK,cAAc,EACfA,EAAK,YAAc,EACtB,OAAAG,EAAa,GACN,CAET,CACD,CAEA,OAAIiG,GAAS,EACL,EACD,CACR,CACD,CAIA,SAASgC,IAAU,CAClB,IAAMxM,EAAO,KACbA,EAAK,cAAgB,EACrBA,EAAK,eAAiB,EAEtBA,EAAK,SAAW,EAChBA,EAAK,SAAW,EAEhBA,EAAK,UAAY,EACjBA,EAAK,UAAY,CAGlB,CAEAwM,GAAQ,UAAY,CACnB,YAAY1G,EAAOnF,EAAM,CACxB,IAAMX,EAAO,KACb,OAAAA,EAAK,OAAS,IAAImE,GACbxD,IACJA,EAAO,IACDX,EAAK,OAAO,YAAYA,EAAM8F,EAAOnF,CAAI,CACjD,EAEA,QAAQ6J,EAAO,CACd,IAAMxK,EAAO,KACb,OAAKA,EAAK,OAGHA,EAAK,OAAO,QAAQA,EAAMwK,CAAK,EAF9B,EAGT,EAEA,YAAa,CACZ,IAAMxK,EAAO,KACb,GAAI,CAACA,EAAK,OACT,MAAO,GACR,IAAMyM,EAAMzM,EAAK,OAAO,WAAW,EACnC,OAAAA,EAAK,OAAS,KACPyM,CACR,EAEA,cAAc3G,EAAOC,EAAU,CAC9B,IAAM/F,EAAO,KACb,OAAKA,EAAK,OAEHA,EAAK,OAAO,cAAcA,EAAM8F,EAAOC,CAAQ,EAD9C,EAET,EAEA,qBAAqBoG,EAAYC,EAAY,CAC5C,IAAMpM,EAAO,KACb,OAAKA,EAAK,OAEHA,EAAK,OAAO,qBAAqBA,EAAMmM,EAAYC,CAAU,EAD5D,EAET,EAOA,SAASxC,EAAK8C,EAAOC,EAAM,CAC1B,IAAM3M,EAAO,KACTiB,EAAMjB,EAAK,SAGf,OAFIiB,EAAM0L,IACT1L,EAAM0L,GACH1L,IAAQ,EACJ,GACRjB,EAAK,UAAYiB,EACjB2I,EAAI,IAAI5J,EAAK,QAAQ,SAASA,EAAK,cAAeA,EAAK,cAAgBiB,CAAG,EAAGyL,CAAK,EAClF1M,EAAK,eAAiBiB,EACtBjB,EAAK,UAAYiB,EACVA,EACR,EAMA,eAAgB,CACf,IAAMjB,EAAO,KACTiB,EAAMjB,EAAK,OAAO,QAElBiB,EAAMjB,EAAK,YACdiB,EAAMjB,EAAK,WACRiB,IAAQ,IAWZjB,EAAK,SAAS,IAAIA,EAAK,OAAO,YAAY,SAASA,EAAK,OAAO,YAAaA,EAAK,OAAO,YAAciB,CAAG,EAAGjB,EAAK,cAAc,EAE/HA,EAAK,gBAAkBiB,EACvBjB,EAAK,OAAO,aAAeiB,EAC3BjB,EAAK,WAAaiB,EAClBjB,EAAK,WAAaiB,EAClBjB,EAAK,OAAO,SAAWiB,EACnBjB,EAAK,OAAO,UAAY,IAC3BA,EAAK,OAAO,YAAc,GAE5B,CACD,EAIA,SAAS4M,GAAWC,EAAS,CAC5B,IAAM7M,EAAO,KACP8M,EAAI,IAAIN,GACRO,EAAUC,GAAyBH,GAAWA,EAAQ,UAAYA,EAAQ,UAAY,GAAK,IAAI,EAC/FrC,EAAQ,EACRZ,EAAM,IAAI,WAAWmD,CAAO,EAC9BjH,EAAQ+G,EAAUA,EAAQ,MAAQ,GAClC,OAAO/G,EAAS,MACnBA,EAAQ,IACTgH,EAAE,YAAYhH,CAAK,EACnBgH,EAAE,SAAWlD,EAEb5J,EAAK,OAAS,SAAUiN,EAAMC,EAAY,CACzC,IAAIjB,EAAKzM,EAAO2N,EAAY,EAAGC,EAAc,EAAGC,EAAa,EACvDC,EAAU,CAAC,EACjB,GAAKL,EAAK,OAEV,CAAAH,EAAE,cAAgB,EAClBA,EAAE,QAAUG,EACZH,EAAE,SAAWG,EAAK,OAClB,EAAG,CAIF,GAHAH,EAAE,eAAiB,EACnBA,EAAE,UAAYC,EACdd,EAAMa,EAAE,QAAQtC,CAAK,EACjByB,GAAO,EACV,MAAM,IAAI,MAAM,cAAgBa,EAAE,GAAG,EAClCA,EAAE,iBACDA,EAAE,gBAAkBC,EACvBO,EAAQ,KAAK,IAAI,WAAW1D,CAAG,CAAC,EAEhC0D,EAAQ,KAAK1D,EAAI,SAAS,EAAGkD,EAAE,cAAc,CAAC,GAChDO,GAAcP,EAAE,eACZI,GAAcJ,EAAE,cAAgB,GAAKA,EAAE,eAAiBK,IAC3DD,EAAWJ,EAAE,aAAa,EAC1BK,EAAYL,EAAE,cAEhB,OAASA,EAAE,SAAW,GAAKA,EAAE,YAAc,GAC3C,OAAIQ,EAAQ,OAAS,GACpB9N,EAAQ,IAAI,WAAW6N,CAAU,EACjCC,EAAQ,QAAQ,SAAUC,EAAO,CAChC/N,EAAM,IAAI+N,EAAOH,CAAW,EAC5BA,GAAeG,EAAM,MACtB,CAAC,GAED/N,EAAQ8N,EAAQ,CAAC,EAAI,IAAI,WAAWA,EAAQ,CAAC,CAAC,EAAI,IAAI,WAEhD9N,EACR,EACAQ,EAAK,MAAQ,UAAY,CACxB,IAAIiM,EAAKzM,EAAO4N,EAAc,EAAGC,EAAa,EACxCC,EAAU,CAAC,EACjB,EAAG,CAIF,GAHAR,EAAE,eAAiB,EACnBA,EAAE,UAAYC,EACdd,EAAMa,EAAE,QAAQ,CAAQ,EACpBb,GAAO,GAAgBA,GAAO,EACjC,MAAM,IAAI,MAAM,cAAgBa,EAAE,GAAG,EAClCC,EAAUD,EAAE,UAAY,GAC3BQ,EAAQ,KAAK1D,EAAI,MAAM,EAAGkD,EAAE,cAAc,CAAC,EAC5CO,GAAcP,EAAE,cACjB,OAASA,EAAE,SAAW,GAAKA,EAAE,YAAc,GAC3C,OAAAA,EAAE,WAAW,EACbtN,EAAQ,IAAI,WAAW6N,CAAU,EACjCC,EAAQ,QAAQ,SAAUC,EAAO,CAChC/N,EAAM,IAAI+N,EAAOH,CAAW,EAC5BA,GAAeG,EAAM,MACtB,CAAC,EACM/N,CACR,CACD,CAEA,SAASwN,GAAyBQ,EAAkB,CACnD,OAAOA,EAAoB,GAAK,KAAK,MAAMA,EAAmB,KAAK,EAAI,EACxE,CCz9DA,IAAMC,GAAe,CAAC,EAAY,EAAY,EAAY,EAAY,GAAY,GAAY,GAAY,IAAY,IAAY,IAAY,KAC7I,KAAY,KAAY,KAAY,MAAY,MAAY,KAAU,EAEjEC,GAAO,KAGPC,GAAa,EACbC,GAAW,EAGXC,GAAW,EACXC,GAAW,EAEXC,GAAW,CAAC,GAAI,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EACxJ,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAChJ,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAChJ,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAC9I,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAC9I,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAC9I,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAC/I,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,IAAK,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAC/I,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EACjJ,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,GAC/I,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAC7I,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAC/I,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAC7I,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAChJ,EAAG,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAC/I,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAC/I,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,IAAK,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAC/I,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAC9I,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAC9I,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAC/I,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAChJ,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EACjJ,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EACjJ,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAChJ,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EACjJ,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,IAAK,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EACjJ,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAC/I,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,EACjJ,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EACjJ,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EACjJ,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EACjJ,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EACjJ,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EACjJ,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAChJ,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,IAAK,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAChJ,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAChJ,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,GAAI,EAAG,EAAG,GAAG,EACxGC,GAAW,CAAC,GAAI,EAAG,EAAG,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,GAAI,EAAG,KAAM,GAAI,EAAG,EAAG,GAAI,EAAG,KAAM,GAAI,EAAG,GAAI,GAAI,EAAG,MAAO,GAAI,EAAG,EAAG,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,GAAI,EACpJ,KAAM,GAAI,EAAG,EAAG,GAAI,EAAG,KAAM,GAAI,EAAG,IAAK,IAAK,EAAG,MAAO,GAAI,EAAG,EAAG,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,GAAI,EAAG,KAAM,GAAI,EAAG,EAAG,GAAI,EAAG,KAAM,GAAI,EAAG,GAAI,GAAI,EAC5I,MAAO,GAAI,EAAG,EAAG,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,GAAI,EAAG,MAAO,GAAI,EAAG,GAAI,GAAI,EAAG,KAAM,GAAI,EAAG,IAAK,IAAK,EAAG,KAAK,EAGlGC,GAAS,CACd,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,CAAC,EAGlHC,GAAS,CACd,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,GAC7F,EAEMC,GAAS,CACd,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,MAAO,MAAO,KAAK,EAEvIC,GAAS,CACd,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,EAG3FC,GAAO,GAEb,SAASC,IAAU,CAClB,IAAMC,EAAO,KAETC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,SAASC,EAAWC,EAEnBC,EAAQC,EACRC,EACAC,EACAC,EACAC,EACA,EACAC,EACAd,EACAC,EACC,CAUD,IAAIc,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJL,EAAI,EACJL,EAAIV,EACJ,GACCP,EAAEK,EAAEC,EAASgB,CAAC,CAAC,IACfA,IACAL,UACQA,IAAM,GAEf,GAAIjB,EAAE,CAAC,GAAKO,EACX,OAAAI,EAAE,CAAC,EAAI,GACP,EAAE,CAAC,EAAI,EACA,EAKR,IADAS,EAAI,EAAE,CAAC,EACFF,EAAI,EAAGA,GAAKvB,IACZK,EAAEkB,CAAC,IAAM,EADSA,IACtB,CAMD,IAJAC,EAAID,EACAE,EAAIF,IACPE,EAAIF,GAEAD,EAAItB,GAAMsB,IAAM,GAChBjB,EAAEiB,CAAC,IAAM,EADUA,IACvB,CAUD,IAPAF,EAAIE,EACAG,EAAIH,IACPG,EAAIH,GAEL,EAAE,CAAC,EAAIG,EAGFM,EAAI,GAAKR,EAAGA,EAAID,EAAGC,IAAKQ,IAAM,EAClC,IAAKA,GAAK1B,EAAEkB,CAAC,GAAK,EACjB,MAAO,GAGT,IAAKQ,GAAK1B,EAAEiB,CAAC,GAAK,EACjB,MAAO,GAQR,IANAjB,EAAEiB,CAAC,GAAKS,EAGRvB,EAAE,CAAC,EAAIe,EAAI,EACXI,EAAI,EACJG,EAAK,EACE,EAAER,IAAM,GACdd,EAAEsB,CAAE,EAAKP,GAAKlB,EAAEsB,CAAC,EACjBG,IACAH,IAIDL,EAAI,EACJK,EAAI,EACJ,GACMJ,EAAIb,EAAEC,EAASgB,CAAC,KAAO,IAC3BvB,EAAEI,EAAEe,CAAC,GAAG,EAAID,GAEbK,UACQ,EAAEL,EAAIV,GAaf,IAZAA,EAAIJ,EAAEY,CAAC,EAGPZ,EAAE,CAAC,EAAIc,EAAI,EACXK,EAAI,EACJN,EAAI,GACJQ,EAAI,CAACJ,EACLlB,EAAE,CAAC,EAAI,EACPqB,EAAI,EACJI,EAAI,EAGGR,GAAKJ,EAAGI,IAEd,IADAN,EAAIb,EAAEmB,CAAC,EACAN,MAAQ,GAAG,CAGjB,KAAOM,EAAIK,EAAIJ,GAAG,CAMjB,GALAJ,IACAQ,GAAKJ,EAELO,EAAIZ,EAAIS,EACRG,EAAKA,EAAIP,EAAKA,EAAIO,GACbb,EAAI,IAAMI,EAAIC,EAAIK,IAAMX,EAAI,IAGhCC,GAAKD,EAAI,EACTY,EAAKN,EACDD,EAAIS,GACP,KAAO,EAAET,EAAIS,GACP,GAAAb,IAAM,IAAMd,EAAE,EAAEyB,CAAE,IAEvBX,GAAKd,EAAEyB,CAAE,EAOZ,GAHAE,EAAI,GAAKT,EAGLpB,EAAG,CAAC,EAAI6B,EAAI3C,GACf,MAAO,GAERkB,EAAEc,CAAC,EAAIO,EAAazB,EAAG,CAAC,EACxBA,EAAG,CAAC,GAAK6B,EAGLX,IAAM,GACTb,EAAEa,CAAC,EAAIC,EACPhB,EAAE,CAAC,EAAgBiB,EACnBjB,EAAE,CAAC,EAAgBmB,EACnBF,EAAID,IAAOO,EAAIJ,EACfnB,EAAE,CAAC,EAAgBsB,EAAIrB,EAAEc,EAAI,CAAC,EAAIE,EAClCN,EAAG,IAAIX,GAAIC,EAAEc,EAAI,CAAC,EAAIE,GAAK,CAAC,GAK5BP,EAAE,CAAC,EAAIY,CAET,CAkBA,IAfAtB,EAAE,CAAC,EAAiBkB,EAAIK,EACpBF,GAAKf,EACRN,EAAE,CAAC,EAAI,IAAM,GACHF,EAAEuB,CAAC,EAAId,GACjBP,EAAE,CAAC,EAAiBF,EAAEuB,CAAC,EAAI,IAAM,EAAI,GAAK,GAE1CrB,EAAE,CAAC,EAAIF,EAAEuB,GAAG,IAEZrB,EAAE,CAAC,EAAiBS,EAAEX,EAAEuB,CAAC,EAAId,CAAC,EAAI,GAAK,GAEvCP,EAAE,CAAC,EAAIQ,EAAEV,EAAEuB,GAAG,EAAId,CAAC,GAIpBM,EAAI,GAAMK,EAAIK,EACTN,EAAID,IAAMO,EAAGN,EAAIS,EAAGT,GAAKJ,EAC7BF,EAAG,IAAIX,GAAIsB,EAAIL,GAAK,CAAC,EAItB,IAAKA,EAAI,GAAMC,EAAI,EAAKF,EAAIC,EAAUA,KAAO,EAC5CD,GAAKC,EAMN,IAJAD,GAAKC,EAGLG,GAAQ,GAAKG,GAAK,GACVP,EAAII,IAASlB,EAAEa,CAAC,GACvBA,IACAQ,GAAKJ,EACLC,GAAQ,GAAKG,GAAK,CAEpB,CAGD,OAAOE,IAAM,GAAKX,GAAK,EAAI,GAAc,CAC1C,CAEA,SAASa,EAAaC,EAAO,CAC5B,IAAIZ,EAYJ,IAXKnB,IACJA,EAAK,CAAC,EACNC,EAAI,CAAC,EACLC,EAAI,IAAI,WAAWL,GAAO,CAAC,EAC3BM,EAAI,CAAC,EACLC,EAAI,IAAI,WAAWP,EAAI,EACvBQ,EAAI,IAAI,WAAWR,GAAO,CAAC,GAExBI,EAAE,OAAS8B,IACd9B,EAAI,CAAC,GAEDkB,EAAI,EAAGA,EAAIY,EAAOZ,IACtBlB,EAAEkB,CAAC,EAAI,EAER,IAAKA,EAAI,EAAGA,EAAItB,GAAO,EAAGsB,IACzBjB,EAAEiB,CAAC,EAAI,EAER,IAAKA,EAAI,EAAGA,EAAI,EAAGA,IAClBhB,EAAEgB,CAAC,EAAI,EAGRf,EAAE,IAAIF,EAAE,SAAS,EAAGL,EAAI,EAAG,CAAC,EAE5BQ,EAAE,IAAIH,EAAE,SAAS,EAAGL,GAAO,CAAC,EAAG,CAAC,CACjC,CAEAE,EAAK,mBAAqB,SAAUG,EACnC8B,EACAC,EACAnB,EACAe,EACC,CACD,IAAIK,EACJ,OAAAJ,EAAa,EAAE,EACf9B,EAAG,CAAC,EAAI,EACRkC,EAAS5B,EAAWJ,EAAG,EAAG,GAAI,GAAI,KAAM,KAAM+B,EAAID,EAAIlB,EAAId,EAAIC,CAAC,EAE3DiC,GAAU,GACbL,EAAE,IAAM,2CACEK,GAAU,IAAeF,EAAG,CAAC,IAAM,KAC7CH,EAAE,IAAM,sCACRK,EAAS,IAEHA,CACR,EAEAnC,EAAK,sBAAwB,SAAUoC,EACtCC,EACAlC,EACAmC,EACAC,EACAC,EACAC,EACA1B,EACAe,EACC,CACD,IAAIK,EAMJ,OAHAJ,EAAa,GAAG,EAChB9B,EAAG,CAAC,EAAI,EACRkC,EAAS5B,EAAWJ,EAAG,EAAGiC,EAAI,IAAK1C,GAAQC,GAAQ6C,EAAIF,EAAIvB,EAAId,EAAIC,CAAC,EAChEiC,GAAU,GAAQG,EAAG,CAAC,IAAM,GAC3BH,GAAU,GACbL,EAAE,IAAM,qCACEK,GAAU,KACpBL,EAAE,IAAM,iCACRK,EAAS,IAEHA,IAIRJ,EAAa,GAAG,EAChBI,EAAS5B,EAAWJ,EAAGiC,EAAIC,EAAI,EAAGzC,GAAQC,GAAQ4C,EAAIF,EAAIxB,EAAId,EAAIC,CAAC,EAE/DiC,GAAU,GAASI,EAAG,CAAC,IAAM,GAAKH,EAAK,KACtCD,GAAU,GACbL,EAAE,IAAM,+BACEK,GAAU,IACpBL,EAAE,IAAM,2BACRK,EAAS,IACCA,GAAU,KACpBL,EAAE,IAAM,mCACRK,EAAS,IAEHA,GAGD,EACR,CAED,CAEApC,GAAQ,oBAAsB,SAAUuC,EACvCC,EACAC,EACAC,EACC,CACD,OAAAH,EAAG,CAAC,EAAIhD,GACRiD,EAAG,CAAC,EAAIhD,GACRiD,EAAG,CAAC,EAAIhD,GACRiD,EAAG,CAAC,EAAIhD,GACD,CACR,EAOA,IAAMiD,GAAQ,EACRC,GAAM,EACNC,GAAS,EACTC,GAAO,EACPC,GAAU,EACVC,GAAO,EAEPC,GAAM,EAENC,GAAO,EAEPC,GAAM,EACNC,GAAU,EAEhB,SAASC,IAAW,CACnB,IAAMpD,EAAO,KAETqD,EAGAC,EAAM,EAENC,EACAC,EAAa,EACbC,EAAO,EAEPC,EAAM,EAGNC,EAAM,EACNC,EAAO,EAEPC,EAAQ,EACRC,EAAQ,EACRC,EACAC,EAAc,EACdC,EACAC,EAAc,EAOlB,SAASC,EAAa7B,EAAIC,EAAIC,EAAI4B,EAAU3B,EAAI4B,EAAU1D,EAAGmB,EAAG,CAC/D,IAAIhB,EACAwD,EACAC,EACA1D,EACAL,EACAc,EACAG,EACAf,EACAgB,EACA8C,EACAC,EACAC,EACAvE,EACAS,EACAR,EAEAuE,EAGJlD,EAAIK,EAAE,cACNpB,EAAIoB,EAAE,SACNtB,EAAIG,EAAE,KACNW,EAAIX,EAAE,KACNe,EAAIf,EAAE,MACN6D,EAAI9C,EAAIf,EAAE,KAAOA,EAAE,KAAOe,EAAI,EAAIf,EAAE,IAAMe,EAG1C+C,EAAKvF,GAAaoD,CAAE,EACpBoC,EAAKxF,GAAaqD,CAAE,EAGpB,EAAG,CAEF,KAAOjB,EAAK,IACXZ,IACAF,IAAMsB,EAAE,UAAUL,GAAG,EAAI,MAASH,EAClCA,GAAK,EAON,GAJAR,EAAIN,EAAIiE,EACRH,EAAK9B,EACL+B,EAAWH,EACXO,GAAgBJ,EAAWzD,GAAK,GAC3BD,EAAIyD,EAAGK,CAAY,KAAO,EAAG,CACjCnE,IAAO8D,EAAGK,EAAe,CAAC,EAC1BrD,GAAMgD,EAAGK,EAAe,CAAC,EAEzBhE,EAAE,IAAIe,GAAG,EAAgB4C,EAAGK,EAAe,CAAC,EAC5CH,IACA,QACD,CACA,EAAG,CAKF,GAHAhE,IAAO8D,EAAGK,EAAe,CAAC,EAC1BrD,GAAMgD,EAAGK,EAAe,CAAC,EAEpB9D,EAAI,GAAW,CAQnB,IAPAA,GAAK,GACLV,EAAImE,EAAGK,EAAe,CAAC,GAAgBnE,EAAItB,GAAa2B,CAAC,GAEzDL,IAAMK,EACNS,GAAKT,EAGES,EAAK,IACXZ,IACAF,IAAMsB,EAAE,UAAUL,GAAG,EAAI,MAASH,EAClCA,GAAK,EAGNR,EAAIN,EAAIkE,EACRJ,EAAK7B,EACL8B,EAAWF,EACXM,GAAgBJ,EAAWzD,GAAK,EAChCD,EAAIyD,EAAGK,CAAY,EAEnB,EAKC,IAHAnE,IAAO8D,EAAGK,EAAe,CAAC,EAC1BrD,GAAMgD,EAAGK,EAAe,CAAC,EAEpB9D,EAAI,GAAW,CAGnB,IADAA,GAAK,GACES,EAAKT,GACXH,IACAF,IAAMsB,EAAE,UAAUL,GAAG,EAAI,MAASH,EAClCA,GAAK,EAUN,GAPAV,EAAI0D,EAAGK,EAAe,CAAC,GAAKnE,EAAItB,GAAa2B,CAAC,GAE9CL,IAAOK,EACPS,GAAMT,EAGN2D,GAAKrE,EACDuB,GAAKd,EAERR,EAAIsB,EAAId,EACJc,EAAItB,EAAI,GAAK,EAAKsB,EAAItB,GACzBO,EAAE,IAAIe,GAAG,EAAIf,EAAE,IAAIP,GAAG,EAGtBO,EAAE,IAAIe,GAAG,EAAIf,EAAE,IAAIP,GAAG,EAGtBD,GAAK,IAELQ,EAAE,IAAI,IAAIA,EAAE,IAAI,SAASP,EAAGA,EAAI,CAAC,EAAGsB,CAAC,EACrCA,GAAK,EACLtB,GAAK,EACLD,GAAK,OAEA,CACNC,EAAIsB,EAAId,EACR,GACCR,GAAKO,EAAE,UACCP,EAAI,GAEb,GADAS,EAAIF,EAAE,IAAMP,EACRD,EAAIU,EAAG,CAEV,GADAV,GAAKU,EACDa,EAAItB,EAAI,GAAKS,EAAKa,EAAItB,EACzB,GACCO,EAAE,IAAIe,GAAG,EAAIf,EAAE,IAAIP,GAAG,QACd,EAAES,IAAM,QAEjBF,EAAE,IAAI,IAAIA,EAAE,IAAI,SAASP,EAAGA,EAAIS,CAAC,EAAGa,CAAC,EACrCA,GAAKb,EACLT,GAAKS,EACLA,EAAI,EAELT,EAAI,CACL,CAED,CAGA,GAAIsB,EAAItB,EAAI,GAAKD,EAAKuB,EAAItB,EACzB,GACCO,EAAE,IAAIe,GAAG,EAAIf,EAAE,IAAIP,GAAG,QACd,EAAED,IAAM,QAEjBQ,EAAE,IAAI,IAAIA,EAAE,IAAI,SAASP,EAAGA,EAAID,CAAC,EAAGuB,CAAC,EACrCA,GAAKvB,EACLC,GAAKD,EACLA,EAAI,EAEL,KACD,SAAY,EAAAU,EAAI,IACfC,GAAKwD,EAAGK,EAAe,CAAC,EACxB7D,GAAMN,EAAItB,GAAa2B,CAAC,EACxB8D,GAAgBJ,EAAWzD,GAAK,EAChCD,EAAIyD,EAAGK,CAAY,MAEnB,QAAA7C,EAAE,IAAM,wBAER3B,EAAI2B,EAAE,SAAWpB,EACjBP,EAAKmB,GAAK,EAAKnB,EAAImB,GAAK,EAAInB,EAC5BO,GAAKP,EACLsB,GAAKtB,EACLmB,GAAKnB,GAAK,EAEVQ,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EAEH,SAGA,IACT,KACD,CAEA,GAAKb,EAAI,GAaF,OAAKA,EAAI,IAEfV,EAAI2B,EAAE,SAAWpB,EACjBP,EAAKmB,GAAK,EAAKnB,EAAImB,GAAK,EAAInB,EAC5BO,GAAKP,EACLsB,GAAKtB,EACLmB,GAAKnB,GAAK,EAEVQ,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EAEH,IAEPI,EAAE,IAAM,8BAER3B,EAAI2B,EAAE,SAAWpB,EACjBP,EAAKmB,GAAK,EAAKnB,EAAImB,GAAK,EAAInB,EAC5BO,GAAKP,EACLsB,GAAKtB,EACLmB,GAAKnB,GAAK,EAEVQ,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EAEH,IAzCP,GAHAZ,GAAKwD,EAAGK,EAAe,CAAC,EACxB7D,GAAMN,EAAItB,GAAa2B,CAAC,EACxB8D,GAAgBJ,EAAWzD,GAAK,GAC3BD,EAAIyD,EAAGK,CAAY,KAAO,EAAG,CAEjCnE,IAAO8D,EAAGK,EAAe,CAAC,EAC1BrD,GAAMgD,EAAGK,EAAe,CAAC,EAEzBhE,EAAE,IAAIe,GAAG,EAAgB4C,EAAGK,EAAe,CAAC,EAC5CH,IACA,KACD,CAoCF,OAAS,GACV,OAASA,GAAK,KAAO9D,GAAK,IAG1B,OAAAP,EAAI2B,EAAE,SAAWpB,EACjBP,EAAKmB,GAAK,EAAKnB,EAAImB,GAAK,EAAInB,EAC5BO,GAAKP,EACLsB,GAAKtB,EACLmB,GAAKnB,GAAK,EAEVQ,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EAEH,CACR,CAEA1B,EAAK,KAAO,SAAUsC,EAAIC,EAAIC,EAAI4B,EAAU3B,EAAI4B,EAAU,CACzDhB,EAAOX,GACPmB,EAAoBvB,EACpBwB,EAAoBvB,EACpBwB,EAAQvB,EACRwB,EAAcI,EACdH,EAAQxB,EACRyB,EAAcG,EACdd,EAAO,IACR,EAEAvD,EAAK,KAAO,SAAUW,EAAGmB,EAAG1B,EAAG,CAC9B,IAAIiB,EACAuD,EACA/D,EACAL,EAAI,EACJc,EAAI,EACJG,EAAI,EACJf,EACAgB,EACA8C,EACAvD,EAYJ,IATAQ,EAAIK,EAAE,cACNpB,EAAIoB,EAAE,SACNtB,EAAIG,EAAE,KACNW,EAAIX,EAAE,KACNe,EAAIf,EAAE,MACN6D,EAAI9C,EAAIf,EAAE,KAAOA,EAAE,KAAOe,EAAI,EAAIf,EAAE,IAAMe,IAKzC,OAAQ2B,EAAM,CAEb,KAAKX,GACJ,GAAI8B,GAAK,KAAO9D,GAAK,KAEpBC,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EACVtB,EAAI+D,EAAaN,EAAOC,EAAOC,EAAOC,EAAaC,EAAOC,EAAavD,EAAGmB,CAAC,EAE3EL,EAAIK,EAAE,cACNpB,EAAIoB,EAAE,SACNtB,EAAIG,EAAE,KACNW,EAAIX,EAAE,KACNe,EAAIf,EAAE,MACN6D,EAAI9C,EAAIf,EAAE,KAAOA,EAAE,KAAOe,EAAI,EAAIf,EAAE,IAAMe,EAEtCtB,GAAK,GAAM,CACdiD,EAAOjD,GAAK,EAAe6C,GAAOE,GAClC,KACD,CAEDM,EAAOI,EACPN,EAAOQ,EACPP,EAAaQ,EAEbX,EAAOV,GAER,KAAKA,GAGJ,IAFAtB,EAAIoC,EAEGnC,EAAKD,GAAI,CACf,GAAIX,IAAM,EACTN,EAAI,MAGJ,QAAAO,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EACHf,EAAE,cAAcmB,EAAG1B,CAAC,EAE5BM,IACAF,IAAMsB,EAAE,UAAUL,GAAG,EAAI,MAASH,EAClCA,GAAK,CACN,CASA,GAPAsD,GAAUpB,GAAchD,EAAItB,GAAamC,CAAC,IAAM,EAEhDb,KAAQ+C,EAAKqB,EAAS,CAAC,EACvBtD,GAAMiC,EAAKqB,EAAS,CAAC,EAErB/D,EAAI0C,EAAKqB,CAAM,EAEX/D,IAAM,EAAG,CACZ6C,EAAMH,EAAKqB,EAAS,CAAC,EACrBvB,EAAOL,GACP,KACD,CACA,GAAKnC,EAAI,GAAW,CACnB8C,EAAM9C,EAAI,GACVyC,EAAMC,EAAKqB,EAAS,CAAC,EACrBvB,EAAOT,GACP,KACD,CACA,GAAK,EAAA/B,EAAI,IAAW,CACnB4C,EAAO5C,EACP2C,EAAaoB,EAAS,EAAIrB,EAAKqB,EAAS,CAAC,EACzC,KACD,CACA,GAAK/D,EAAI,GAAW,CACnBwC,EAAOJ,GACP,KACD,CACA,OAAAI,EAAOF,GACPrB,EAAE,IAAM,8BACR1B,EAAI,GAEJO,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EACHf,EAAE,cAAcmB,EAAG1B,CAAC,EAE5B,KAAKwC,GAGJ,IAFAvB,EAAIsC,EAEGrC,EAAKD,GAAI,CACf,GAAIX,IAAM,EACTN,EAAI,MAGJ,QAAAO,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EACHf,EAAE,cAAcmB,EAAG1B,CAAC,EAE5BM,IACAF,IAAMsB,EAAE,UAAUL,GAAG,EAAI,MAASH,EAClCA,GAAK,CACN,CAEAgC,GAAQ9C,EAAItB,GAAamC,CAAC,EAE1Bb,IAAMa,EACNC,GAAKD,EAELoC,EAAOK,EACPP,EAAOU,EACPT,EAAaU,EACbb,EAAOR,GAER,KAAKA,GAGJ,IAFAxB,EAAIoC,EAEGnC,EAAKD,GAAI,CACf,GAAIX,IAAM,EACTN,EAAI,MAGJ,QAAAO,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EACHf,EAAE,cAAcmB,EAAG1B,CAAC,EAE5BM,IACAF,IAAMsB,EAAE,UAAUL,GAAG,EAAI,MAASH,EAClCA,GAAK,CACN,CAQA,GANAsD,GAAUpB,GAAchD,EAAItB,GAAamC,CAAC,IAAM,EAEhDb,IAAM+C,EAAKqB,EAAS,CAAC,EACrBtD,GAAKiC,EAAKqB,EAAS,CAAC,EAEpB/D,EAAK0C,EAAKqB,CAAM,EACX/D,EAAI,GAAW,CACnB8C,EAAM9C,EAAI,GACV+C,EAAOL,EAAKqB,EAAS,CAAC,EACtBvB,EAAOP,GACP,KACD,CACA,GAAK,EAAAjC,EAAI,IAAW,CACnB4C,EAAO5C,EACP2C,EAAaoB,EAAS,EAAIrB,EAAKqB,EAAS,CAAC,EACzC,KACD,CACA,OAAAvB,EAAOF,GACPrB,EAAE,IAAM,wBACR1B,EAAI,GAEJO,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EACHf,EAAE,cAAcmB,EAAG1B,CAAC,EAE5B,KAAK0C,GAGJ,IAFAzB,EAAIsC,EAEGrC,EAAKD,GAAI,CACf,GAAIX,IAAM,EACTN,EAAI,MAGJ,QAAAO,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EACHf,EAAE,cAAcmB,EAAG1B,CAAC,EAE5BM,IACAF,IAAMsB,EAAE,UAAUL,GAAG,EAAI,MAASH,EAClCA,GAAK,CACN,CAEAsC,GAASpD,EAAItB,GAAamC,CAAC,EAE3Bb,IAAMa,EACNC,GAAKD,EAELgC,EAAON,GAER,KAAKA,GAEJ,IADA9B,EAAIS,EAAIkC,EACD3C,EAAI,GACVA,GAAKN,EAAE,IAER,KAAO2C,IAAQ,GAAG,CAEjB,GAAIkB,IAAM,IACL9C,GAAKf,EAAE,KAAOA,EAAE,OAAS,IAC5Be,EAAI,EACJ8C,EAAI9C,EAAIf,EAAE,KAAOA,EAAE,KAAOe,EAAI,EAAIf,EAAE,IAAMe,GAEvC8C,IAAM,IACT7D,EAAE,MAAQe,EACVtB,EAAIO,EAAE,cAAcmB,EAAG1B,CAAC,EACxBsB,EAAIf,EAAE,MACN6D,EAAI9C,EAAIf,EAAE,KAAOA,EAAE,KAAOe,EAAI,EAAIf,EAAE,IAAMe,EAEtCA,GAAKf,EAAE,KAAOA,EAAE,OAAS,IAC5Be,EAAI,EACJ8C,EAAI9C,EAAIf,EAAE,KAAOA,EAAE,KAAOe,EAAI,EAAIf,EAAE,IAAMe,GAGvC8C,IAAM,IACT,OAAA7D,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EACHf,EAAE,cAAcmB,EAAG1B,CAAC,EAK9BO,EAAE,IAAIe,GAAG,EAAIf,EAAE,IAAIM,GAAG,EACtBuD,IAEIvD,GAAKN,EAAE,MACVM,EAAI,GACLqC,GACD,CACAD,EAAOX,GACP,MACD,KAAKM,GACJ,GAAIwB,IAAM,IACL9C,GAAKf,EAAE,KAAOA,EAAE,OAAS,IAC5Be,EAAI,EACJ8C,EAAI9C,EAAIf,EAAE,KAAOA,EAAE,KAAOe,EAAI,EAAIf,EAAE,IAAMe,GAEvC8C,IAAM,IACT7D,EAAE,MAAQe,EACVtB,EAAIO,EAAE,cAAcmB,EAAG1B,CAAC,EACxBsB,EAAIf,EAAE,MACN6D,EAAI9C,EAAIf,EAAE,KAAOA,EAAE,KAAOe,EAAI,EAAIf,EAAE,IAAMe,EAEtCA,GAAKf,EAAE,KAAOA,EAAE,OAAS,IAC5Be,EAAI,EACJ8C,EAAI9C,EAAIf,EAAE,KAAOA,EAAE,KAAOe,EAAI,EAAIf,EAAE,IAAMe,GAEvC8C,IAAM,IACT,OAAA7D,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EACHf,EAAE,cAAcmB,EAAG1B,CAAC,EAI9BA,EAAI,EAEJO,EAAE,IAAIe,GAAG,EAAgBgC,EACzBc,IAEAnB,EAAOX,GACP,MACD,KAAKO,GAYJ,GAXI3B,EAAI,IACPA,GAAK,EACLZ,IACAe,KAGDd,EAAE,MAAQe,EACVtB,EAAIO,EAAE,cAAcmB,EAAG1B,CAAC,EACxBsB,EAAIf,EAAE,MACN6D,EAAI9C,EAAIf,EAAE,KAAOA,EAAE,KAAOe,EAAI,EAAIf,EAAE,IAAMe,EAEtCf,EAAE,MAAQA,EAAE,MACf,OAAAA,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EACHf,EAAE,cAAcmB,EAAG1B,CAAC,EAE5BiD,EAAOH,GAER,KAAKA,GACJ,OAAA9C,EAAI,EACJO,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EACHf,EAAE,cAAcmB,EAAG1B,CAAC,EAE5B,KAAK+C,GAEJ,OAAA/C,EAAI,GAEJO,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EACHf,EAAE,cAAcmB,EAAG1B,CAAC,EAE5B,QACC,OAAAA,EAAI,GAEJO,EAAE,KAAOH,EACTG,EAAE,KAAOW,EACTQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBd,EAAE,MAAQe,EACHf,EAAE,cAAcmB,EAAG1B,CAAC,CAC7B,CAEF,EAEAJ,EAAK,KAAO,UAAY,CAExB,CAED,CAKA,IAAM6E,GAAS,CACd,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAE,EAE3DC,GAAO,EACPC,GAAO,EACPC,GAAS,EACTC,GAAQ,EACRC,GAAQ,EAERC,GAAQ,EAERC,GAAQ,EACRC,GAAM,EACNC,GAAY,EACZC,GAAY,EAElB,SAASC,GAAU1D,EAAGH,EAAG,CACxB,IAAM3B,EAAO,KAETqD,EAAOyB,GAEPW,EAAO,EAEPC,EAAQ,EACRC,EAAQ,EACRC,EACE3D,EAAK,CAAC,CAAC,EACPC,EAAK,CAAC,CAAC,EAEP2D,EAAQ,IAAIzC,GAEd0C,EAAO,EAEPC,EAAQ,IAAI,WAAW5G,GAAO,CAAC,EAC7B6G,EAAQ,EACRC,EAAU,IAAIlG,GAEpBC,EAAK,KAAO,EACZA,EAAK,KAAO,EACZA,EAAK,IAAM,IAAI,WAAW2B,CAAC,EAC3B3B,EAAK,IAAM2B,EACX3B,EAAK,KAAO,EACZA,EAAK,MAAQ,EAEbA,EAAK,MAAQ,SAAU8B,EAAG3B,EAAG,CACxBA,IACHA,EAAE,CAAC,EAAI6F,GAGJ3C,GAAQ+B,IACXS,EAAM,KAAK/D,CAAC,EAEbuB,EAAOyB,GACP9E,EAAK,KAAO,EACZA,EAAK,KAAO,EACZA,EAAK,KAAOA,EAAK,MAAQ,CAC1B,EAEAA,EAAK,MAAM8B,EAAG,IAAI,EAGlB9B,EAAK,cAAgB,SAAU8B,EAAG1B,EAAG,CACpC,IAAIM,EACAe,EACAC,EAGJ,OAAAD,EAAIK,EAAE,eACNJ,EAAI1B,EAAK,KAGTU,GAAiBgB,GAAK1B,EAAK,MAAQA,EAAK,MAAQA,EAAK,KAAO0B,EACxDhB,EAAIoB,EAAE,YACTpB,EAAIoB,EAAE,WACHpB,IAAM,GAAKN,GAAK,KACnBA,EAAI,GAGL0B,EAAE,WAAapB,EACfoB,EAAE,WAAapB,EAGfoB,EAAE,SAAS,IAAI9B,EAAK,IAAI,SAAS0B,EAAGA,EAAIhB,CAAC,EAAGe,CAAC,EAC7CA,GAAKf,EACLgB,GAAKhB,EAGDgB,GAAK1B,EAAK,MAEb0B,EAAI,EACA1B,EAAK,OAASA,EAAK,MACtBA,EAAK,MAAQ,GAGdU,EAAIV,EAAK,MAAQ0B,EACbhB,EAAIoB,EAAE,YACTpB,EAAIoB,EAAE,WACHpB,IAAM,GAAKN,GAAK,KACnBA,EAAI,GAGL0B,EAAE,WAAapB,EACfoB,EAAE,WAAapB,EAGfoB,EAAE,SAAS,IAAI9B,EAAK,IAAI,SAAS0B,EAAGA,EAAIhB,CAAC,EAAGe,CAAC,EAC7CA,GAAKf,EACLgB,GAAKhB,GAINoB,EAAE,eAAiBL,EACnBzB,EAAK,KAAO0B,EAGLtB,CACR,EAEAJ,EAAK,KAAO,SAAU8B,EAAG1B,EAAG,CAC3B,IAAIU,EACAN,EACAc,EACAG,EACAf,EACAgB,EACA8C,EAEApD,EAiBJ,IAbAK,EAAIK,EAAE,cACNpB,EAAIoB,EAAE,SACNtB,EAAIR,EAAK,KACTsB,EAAItB,EAAK,KAGT0B,EAAI1B,EAAK,MACTwE,EAAgB9C,EAAI1B,EAAK,KAAOA,EAAK,KAAO0B,EAAI,EAAI1B,EAAK,IAAM0B,IAMlD,CACZ,IAAIY,EAAIC,EAAIC,EAAIC,EAAIyD,EAAKC,EAAKC,EAAKC,EACnC,OAAQhD,EAAM,CACb,KAAKyB,GAEJ,KAAOxD,EAAK,GAAI,CACf,GAAIZ,IAAM,EACTN,EAAI,MAEJ,QAAAJ,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAE/BM,IACAF,IAAMsB,EAAE,UAAUL,GAAG,EAAI,MAASH,EAClCA,GAAK,CACN,CAIA,OAHAR,EAAgBN,EAAI,EACpBsF,EAAOhF,EAAI,EAEHA,IAAM,EAAG,CAChB,IAAK,GAEJN,KAAQ,EACRc,GAAM,EAENR,EAAIQ,EAAI,EAGRd,KAAQM,EACRQ,GAAMR,EAENuC,EAAO0B,GACP,MACD,IAAK,GAEJzC,EAAK,CAAC,EACNC,EAAK,CAAC,EACNC,EAAK,CAAC,CAAC,CAAC,EACRC,EAAK,CAAC,CAAC,CAAC,EAER1C,GAAQ,oBAAoBuC,EAAIC,EAAIC,EAAIC,CAAE,EAC1CoD,EAAM,KAAKvD,EAAG,CAAC,EAAGC,EAAG,CAAC,EAAGC,EAAG,CAAC,EAAG,EAAGC,EAAG,CAAC,EAAG,CAAC,EAI3CjC,KAAQ,EACRc,GAAM,EAGN+B,EAAO+B,GACP,MACD,IAAK,GAGJ5E,KAAQ,EACRc,GAAM,EAGN+B,EAAO4B,GACP,MACD,IAAK,GAGJ,OAAAzE,KAAQ,EACRc,GAAM,EAEN+B,EAAOkC,GACPzD,EAAE,IAAM,qBACR1B,EAAI,GAEJJ,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,CAChC,CACA,MACD,KAAK2E,GAEJ,KAAOzD,EAAK,IAAK,CAChB,GAAIZ,IAAM,EACTN,EAAI,MAEJ,QAAAJ,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAE/BM,IACAF,IAAMsB,EAAE,UAAUL,GAAG,EAAI,MAASH,EAClCA,GAAK,CACN,CAEA,IAAO,CAACd,IAAO,GAAM,SAAYA,EAAI,OACpC,OAAA6C,EAAOkC,GACPzD,EAAE,IAAM,+BACR1B,EAAI,GAEJJ,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAE/BqF,EAAQjF,EAAI,MACZA,EAAIc,EAAI,EACR+B,EAAOoC,IAAS,EAAIT,GAAUc,IAAS,EAAIT,GAAMP,GACjD,MACD,KAAKE,GAWJ,GAVItE,IAAM,GAUN8D,IAAM,IACL9C,GAAK1B,EAAK,KAAOA,EAAK,OAAS,IAClC0B,EAAI,EACJ8C,EAAgB9C,EAAI1B,EAAK,KAAOA,EAAK,KAAO0B,EAAI,EAAI1B,EAAK,IAAM0B,GAE5D8C,IAAM,IACTxE,EAAK,MAAQ0B,EACbtB,EAAIJ,EAAK,cAAc8B,EAAG1B,CAAC,EAC3BsB,EAAI1B,EAAK,MACTwE,EAAgB9C,EAAI1B,EAAK,KAAOA,EAAK,KAAO0B,EAAI,EAAI1B,EAAK,IAAM0B,EAC3DA,GAAK1B,EAAK,KAAOA,EAAK,OAAS,IAClC0B,EAAI,EACJ8C,EAAgB9C,EAAI1B,EAAK,KAAOA,EAAK,KAAO0B,EAAI,EAAI1B,EAAK,IAAM0B,GAE5D8C,IAAM,IACT,OAAAxE,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAgBjC,GAZAA,EAAI,EAEJU,EAAI2E,EACA3E,EAAIJ,IACPI,EAAIJ,GACDI,EAAI0D,IACP1D,EAAI0D,GACLxE,EAAK,IAAI,IAAI8B,EAAE,SAASL,EAAGX,CAAC,EAAGY,CAAC,EAChCD,GAAKX,EACLJ,GAAKI,EACLY,GAAKZ,EACL0D,GAAK1D,GACA2E,GAAQ3E,KAAO,EACnB,MACDuC,EAAOyC,IAAS,EAAIT,GAAMP,GAC1B,MACD,KAAKG,GAEJ,KAAO3D,EAAK,IAAK,CAChB,GAAIZ,IAAM,EACTN,EAAI,MAEJ,QAAAJ,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAG/BM,IACAF,IAAMsB,EAAE,UAAUL,GAAG,EAAI,MAASH,EAClCA,GAAK,CACN,CAGA,GADAoE,EAAQ5E,EAAKN,EAAI,OACZM,EAAI,IAAQ,KAAQA,GAAK,EAAK,IAAQ,GAC1C,OAAAuC,EAAOkC,GACPzD,EAAE,IAAM,sCACR1B,EAAI,GAEJJ,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAG/B,GADAU,EAAI,KAAOA,EAAI,KAAUA,GAAK,EAAK,IAC/B,CAAC8E,GAASA,EAAM,OAAS9E,EAC5B8E,EAAQ,CAAC,MAET,KAAKxE,EAAI,EAAGA,EAAIN,EAAGM,IAClBwE,EAAMxE,CAAC,EAAI,EAKbZ,KAAQ,GACRc,GAAM,GAGNqE,EAAQ,EACRtC,EAAO6B,GAER,KAAKA,GACJ,KAAOS,EAAQ,GAAKD,IAAU,KAAK,CAClC,KAAOpE,EAAK,GAAI,CACf,GAAIZ,IAAM,EACTN,EAAI,MAEJ,QAAAJ,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAE/BM,IACAF,IAAMsB,EAAE,UAAUL,GAAG,EAAI,MAASH,EAClCA,GAAK,CACN,CAEAsE,EAAMf,GAAOc,GAAO,CAAC,EAAInF,EAAI,EAG7BA,KAAQ,EACRc,GAAM,CAEP,CAEA,KAAOqE,EAAQ,IACdC,EAAMf,GAAOc,GAAO,CAAC,EAAI,EAK1B,GAFA1D,EAAG,CAAC,EAAI,EACRnB,EAAImF,EAAQ,mBAAmBL,EAAO3D,EAAIC,EAAI6D,EAAOjE,CAAC,EAClDhB,GAAK,EACR,OAAAV,EAAIU,EACAV,GAAK,KACRwF,EAAQ,KACRvC,EAAOkC,IAGRvF,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAG/BuF,EAAQ,EACRtC,EAAO8B,GAER,KAAKA,GAEJ,KACCrE,EAAI4E,EACA,EAAAC,GAAS,KAAO7E,EAAI,KAAUA,GAAK,EAAK,MAFhC,CAMZ,IAAIO,EAAGlB,EAIP,IAFAW,EAAImB,EAAG,CAAC,EAEDX,EAAKR,GAAI,CACf,GAAIJ,IAAM,EACTN,EAAI,MAEJ,QAAAJ,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAE/BM,IACAF,IAAMsB,EAAE,UAAUL,GAAG,EAAI,MAASH,EAClCA,GAAK,CACN,CASA,GAHAR,EAAIiF,GAAO7D,EAAG,CAAC,GAAK1B,EAAItB,GAAa4B,CAAC,IAAM,EAAI,CAAC,EACjDX,EAAI4F,GAAO7D,EAAG,CAAC,GAAK1B,EAAItB,GAAa4B,CAAC,IAAM,EAAI,CAAC,EAE7CX,EAAI,GACPK,KAAQM,EACRQ,GAAMR,EACN8E,EAAMD,GAAO,EAAIxF,MACX,CAIN,IAHAiB,EAAIjB,GAAK,GAAK,EAAIA,EAAI,GACtBkB,EAAIlB,GAAK,GAAK,GAAK,EAEZmB,EAAKR,EAAIM,GAAI,CACnB,GAAIV,IAAM,EACTN,EAAI,MAEJ,QAAAJ,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAE/BM,IACAF,IAAMsB,EAAE,UAAUL,GAAG,EAAI,MAASH,EAClCA,GAAK,CACN,CAYA,GAVAd,KAAQM,EACRQ,GAAMR,EAENO,GAAMb,EAAItB,GAAakC,CAAC,EAExBZ,KAAQY,EACRE,GAAMF,EAENA,EAAIuE,EACJ7E,EAAI4E,EACAtE,EAAIC,EAAI,KAAOP,EAAI,KAAUA,GAAK,EAAK,KAAUX,GAAK,IAAMiB,EAAI,EACnE,OAAAwE,EAAQ,KACRvC,EAAOkC,GACPzD,EAAE,IAAM,4BACR1B,EAAI,GAEJJ,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAG/BD,EAAIA,GAAK,GAAKyF,EAAMxE,EAAI,CAAC,EAAI,EAC7B,GACCwE,EAAMxE,GAAG,EAAIjB,QACL,EAAEkB,IAAM,GACjBsE,EAAQvE,CACT,CACD,CAcA,GAZAc,EAAG,CAAC,EAAI,GAERgE,EAAM,CAAC,EACPC,EAAM,CAAC,EACPC,EAAM,CAAC,EACPC,EAAM,CAAC,EACPH,EAAI,CAAC,EAAI,EACTC,EAAI,CAAC,EAAI,EAETrF,EAAI4E,EACJ5E,EAAImF,EAAQ,sBAAsB,KAAOnF,EAAI,IAAO,GAAMA,GAAK,EAAK,IAAO8E,EAAOM,EAAKC,EAAKC,EAAKC,EAAKN,EAAOjE,CAAC,EAE1GhB,GAAK,EACR,OAAIA,GAAK,KACR8E,EAAQ,KACRvC,EAAOkC,IAERnF,EAAIU,EAEJd,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAE/ByF,EAAM,KAAKK,EAAI,CAAC,EAAGC,EAAI,CAAC,EAAGJ,EAAOK,EAAI,CAAC,EAAGL,EAAOM,EAAI,CAAC,CAAC,EAEvDhD,EAAO+B,GAER,KAAKA,GAQJ,GAPApF,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,GAERtB,EAAIyF,EAAM,KAAK7F,EAAM8B,EAAG1B,CAAC,IAAM,EACnC,OAAOJ,EAAK,cAAc8B,EAAG1B,CAAC,EAY/B,GAVAA,EAAI,EACJyF,EAAM,KAAK/D,CAAC,EAEZL,EAAIK,EAAE,cACNpB,EAAIoB,EAAE,SACNtB,EAAIR,EAAK,KACTsB,EAAItB,EAAK,KACT0B,EAAI1B,EAAK,MACTwE,EAAgB9C,EAAI1B,EAAK,KAAOA,EAAK,KAAO0B,EAAI,EAAI1B,EAAK,IAAM0B,EAE3DoE,IAAS,EAAG,CACfzC,EAAOyB,GACP,KACD,CACAzB,EAAOgC,GAER,KAAKA,GAKJ,GAJArF,EAAK,MAAQ0B,EACbtB,EAAIJ,EAAK,cAAc8B,EAAG1B,CAAC,EAC3BsB,EAAI1B,EAAK,MACTwE,EAAgB9C,EAAI1B,EAAK,KAAOA,EAAK,KAAO0B,EAAI,EAAI1B,EAAK,IAAM0B,EAC3D1B,EAAK,MAAQA,EAAK,MACrB,OAAAA,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAE/BiD,EAAOiC,GAER,KAAKA,GACJ,OAAAlF,EAAI,EAEJJ,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAC/B,KAAKmF,GACJ,OAAAnF,EAAI,GAEJJ,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,EAE/B,QACC,OAAAA,EAAI,GAEJJ,EAAK,KAAOQ,EACZR,EAAK,KAAOsB,EACZQ,EAAE,SAAWpB,EACboB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBzB,EAAK,MAAQ0B,EACN1B,EAAK,cAAc8B,EAAG1B,CAAC,CAChC,CACD,CACD,EAEAJ,EAAK,KAAO,SAAU8B,EAAG,CACxB9B,EAAK,MAAM8B,EAAG,IAAI,EAClB9B,EAAK,IAAM,KACX+F,EAAQ,IAET,EAEA/F,EAAK,eAAiB,SAAUY,EAAG0F,EAAO5F,EAAG,CAC5CV,EAAK,IAAI,IAAIY,EAAE,SAAS0F,EAAOA,EAAQ5F,CAAC,EAAG,CAAC,EAC5CV,EAAK,KAAOA,EAAK,MAAQU,CAC1B,EAIAV,EAAK,WAAa,UAAY,CAC7B,OAAOqD,GAAQ0B,GAAO,EAAI,CAC3B,CAED,CAKA,IAAMwB,GAAc,GAEdC,GAAa,EAEbC,GAAS,EACTC,GAAO,EACPC,GAAQ,EACRC,GAAQ,EACRC,GAAQ,EACRC,GAAQ,EACRC,GAAQ,EACRC,GAAS,EACTC,GAAO,GACPC,GAAM,GAENC,GAAO,CAAC,EAAG,EAAG,IAAM,GAAI,EAE9B,SAASC,IAAU,CAClB,IAAMpH,EAAO,KAEbA,EAAK,KAAO,EAGZA,EAAK,OAAS,EAGdA,EAAK,IAAM,CAAC,CAAC,EACbA,EAAK,KAAO,EAGZA,EAAK,OAAS,EAGdA,EAAK,MAAQ,EAIb,SAASqH,EAAavF,EAAG,CACxB,MAAI,CAACA,GAAK,CAACA,EAAE,OACL,IAERA,EAAE,SAAWA,EAAE,UAAY,EAC3BA,EAAE,IAAM,KACRA,EAAE,OAAO,KAAOkF,GAChBlF,EAAE,OAAO,OAAO,MAAMA,EAAG,IAAI,EACtB,EACR,CAEA9B,EAAK,WAAa,SAAU8B,EAAG,CAC9B,OAAI9B,EAAK,QACRA,EAAK,OAAO,KAAK8B,CAAC,EACnB9B,EAAK,OAAS,KAEP,CACR,EAEAA,EAAK,YAAc,SAAU8B,EAAGH,EAAG,CAKlC,OAJAG,EAAE,IAAM,KACR9B,EAAK,OAAS,KAGV2B,EAAI,GAAKA,EAAI,IAChB3B,EAAK,WAAW8B,CAAC,EACV,KAER9B,EAAK,MAAQ2B,EAEbG,EAAE,OAAO,OAAS,IAAI0D,GAAU1D,EAAG,GAAKH,CAAC,EAGzC0F,EAAavF,CAAC,EACP,EACR,EAEA9B,EAAK,QAAU,SAAU8B,EAAGb,EAAG,CAC9B,IAAIb,EACAI,EAEJ,GAAI,CAACsB,GAAK,CAACA,EAAE,QAAU,CAACA,EAAE,QACzB,MAAO,GACR,IAAMwF,EAASxF,EAAE,OAIjB,IAHAb,EAAIA,GAAK5B,GAAW,GAAc,EAClCe,EAAI,KAGH,OAAQkH,EAAO,KAAM,CACpB,KAAKb,GAEJ,GAAI3E,EAAE,WAAa,EAClB,OAAO1B,EAKR,GAJAA,EAAIa,EAEJa,EAAE,WACFA,EAAE,aACIwF,EAAO,OAASxF,EAAE,UAAUA,EAAE,eAAe,GAAK,KAAQ0E,GAAY,CAC3Ec,EAAO,KAAOJ,GACdpF,EAAE,IAAM,6BACRwF,EAAO,OAAS,EAChB,KACD,CACA,IAAKA,EAAO,QAAU,GAAK,EAAIA,EAAO,MAAO,CAC5CA,EAAO,KAAOJ,GACdpF,EAAE,IAAM,mBACRwF,EAAO,OAAS,EAChB,KACD,CACAA,EAAO,KAAOZ,GAEf,KAAKA,GAEJ,GAAI5E,EAAE,WAAa,EAClB,OAAO1B,EAOR,GANAA,EAAIa,EAEJa,EAAE,WACFA,EAAE,WACFtB,EAAKsB,EAAE,UAAUA,EAAE,eAAe,EAAK,MAEhCwF,EAAO,QAAU,GAAK9G,GAAK,KAAQ,EAAG,CAC5C8G,EAAO,KAAOJ,GACdpF,EAAE,IAAM,yBACRwF,EAAO,OAAS,EAChB,KACD,CAEA,GAAK,EAAA9G,EAAI+F,IAAoB,CAC5Be,EAAO,KAAON,GACd,KACD,CACAM,EAAO,KAAOX,GAEf,KAAKA,GAEJ,GAAI7E,EAAE,WAAa,EAClB,OAAO1B,EACRA,EAAIa,EAEJa,EAAE,WACFA,EAAE,WACFwF,EAAO,MAASxF,EAAE,UAAUA,EAAE,eAAe,EAAI,MAAS,GAAM,WAChEwF,EAAO,KAAOV,GAEf,KAAKA,GAEJ,GAAI9E,EAAE,WAAa,EAClB,OAAO1B,EACRA,EAAIa,EAEJa,EAAE,WACFA,EAAE,WACFwF,EAAO,OAAUxF,EAAE,UAAUA,EAAE,eAAe,EAAI,MAAS,GAAM,SACjEwF,EAAO,KAAOT,GAEf,KAAKA,GAEJ,GAAI/E,EAAE,WAAa,EAClB,OAAO1B,EACRA,EAAIa,EAEJa,EAAE,WACFA,EAAE,WACFwF,EAAO,OAAUxF,EAAE,UAAUA,EAAE,eAAe,EAAI,MAAS,EAAK,MAChEwF,EAAO,KAAOR,GAEf,KAAKA,GAEJ,OAAIhF,EAAE,WAAa,EACX1B,GACRA,EAAIa,EAEJa,EAAE,WACFA,EAAE,WACFwF,EAAO,MAASxF,EAAE,UAAUA,EAAE,eAAe,EAAI,IACjDwF,EAAO,KAAOP,GACP,GACR,KAAKA,GACJ,OAAAO,EAAO,KAAOJ,GACdpF,EAAE,IAAM,kBACRwF,EAAO,OAAS,EACT,GACR,KAAKN,GAGJ,GADA5G,EAAIkH,EAAO,OAAO,KAAKxF,EAAG1B,CAAC,EACvBA,GAAK,GAAc,CACtBkH,EAAO,KAAOJ,GACdI,EAAO,OAAS,EAChB,KACD,CAIA,GAHIlH,GAAK,IACRA,EAAIa,GAEDb,GAAK,EACR,OAAOA,EAERA,EAAIa,EACJqG,EAAO,OAAO,MAAMxF,EAAGwF,EAAO,GAAG,EACjCA,EAAO,KAAOL,GAEf,KAAKA,GACJ,OAAAnF,EAAE,SAAW,EACN,EACR,KAAKoF,GACJ,MAAO,GACR,QACC,MAAO,EACT,CAEF,EAEAlH,EAAK,qBAAuB,SAAU8B,EAAGyF,EAAYC,EAAY,CAChE,IAAI7B,EAAQ,EAAG8B,EAASD,EACxB,GAAI,CAAC1F,GAAK,CAACA,EAAE,QAAUA,EAAE,OAAO,MAAQiF,GACvC,MAAO,GACR,IAAMO,EAASxF,EAAE,OACjB,OAAI2F,GAAW,GAAKH,EAAO,QAC1BG,GAAU,GAAKH,EAAO,OAAS,EAC/B3B,EAAQ6B,EAAaC,GAEtBH,EAAO,OAAO,eAAeC,EAAY5B,EAAO8B,CAAM,EACtDH,EAAO,KAAON,GACP,CACR,EAEAhH,EAAK,YAAc,SAAU8B,EAAG,CAC/B,IAAIpB,EACAe,EACA+C,EACApE,EAAGuB,EAGP,GAAI,CAACG,GAAK,CAACA,EAAE,OACZ,MAAO,GACR,IAAMwF,EAASxF,EAAE,OAKjB,GAJIwF,EAAO,MAAQJ,KAClBI,EAAO,KAAOJ,GACdI,EAAO,OAAS,IAEZ5G,EAAIoB,EAAE,YAAc,EACxB,MAAO,GAKR,IAJAL,EAAIK,EAAE,cACN0C,EAAI8C,EAAO,OAGJ5G,IAAM,GAAK8D,EAAI,GACjB1C,EAAE,UAAUL,CAAC,GAAK0F,GAAK3C,CAAC,EAC3BA,IACU1C,EAAE,UAAUL,CAAC,IAAM,EAC7B+C,EAAI,EAEJA,EAAI,EAAIA,EAET/C,IACAf,IAUD,OANAoB,EAAE,UAAYL,EAAIK,EAAE,cACpBA,EAAE,cAAgBL,EAClBK,EAAE,SAAWpB,EACb4G,EAAO,OAAS9C,EAGZA,GAAK,EACD,IAERpE,EAAI0B,EAAE,SACNH,EAAIG,EAAE,UACNuF,EAAavF,CAAC,EACdA,EAAE,SAAW1B,EACb0B,EAAE,UAAYH,EACd2F,EAAO,KAAON,GACP,EACR,EASAhH,EAAK,iBAAmB,SAAU8B,EAAG,CACpC,MAAI,CAACA,GAAK,CAACA,EAAE,QAAU,CAACA,EAAE,OAAO,OACzB,GACDA,EAAE,OAAO,OAAO,WAAW,CACnC,CACD,CAIA,SAAS4F,IAAU,CACnB,CAEAA,GAAQ,UAAY,CACnB,YAAYC,EAAM,CACjB,IAAM3H,EAAO,KACb,OAAAA,EAAK,OAAS,IAAIoH,GACbO,IACJA,EAAO,IACD3H,EAAK,OAAO,YAAYA,EAAM2H,CAAI,CAC1C,EAEA,QAAQ1G,EAAG,CACV,IAAMjB,EAAO,KACb,OAAKA,EAAK,OAEHA,EAAK,OAAO,QAAQA,EAAMiB,CAAC,EAD1B,EAET,EAEA,YAAa,CACZ,IAAMjB,EAAO,KACb,GAAI,CAACA,EAAK,OACT,MAAO,GACR,IAAM4H,EAAM5H,EAAK,OAAO,WAAWA,CAAI,EACvC,OAAAA,EAAK,OAAS,KACP4H,CACR,EAEA,aAAc,CACb,IAAM5H,EAAO,KACb,OAAKA,EAAK,OAEHA,EAAK,OAAO,YAAYA,CAAI,EAD3B,EAET,EACA,qBAAqBuH,EAAYC,EAAY,CAC5C,IAAMxH,EAAO,KACb,OAAKA,EAAK,OAEHA,EAAK,OAAO,qBAAqBA,EAAMuH,EAAYC,CAAU,EAD5D,EAET,EACA,UAAUlB,EAAO,CAEhB,OADa,KACD,QAAQA,CAAK,CAC1B,EACA,SAASA,EAAOuB,EAAM,CAErB,OADa,KACD,QAAQ,SAASvB,EAAOA,EAAQuB,CAAI,CACjD,CACD,EAIA,SAASC,GAAWC,EAAS,CAC5B,IAAM/H,EAAO,KACP8B,EAAI,IAAI4F,GACRM,EAAUD,GAAWA,EAAQ,UAAY,KAAK,MAAMA,EAAQ,UAAY,CAAC,EAAI,IAAM,KACnFE,EAAQ7I,GACR8I,EAAM,IAAI,WAAWF,CAAO,EAC9BG,EAAc,GAElBrG,EAAE,YAAY,EACdA,EAAE,SAAWoG,EAEblI,EAAK,OAAS,SAAUoI,EAAMC,EAAY,CACzC,IAAMC,EAAU,CAAC,EACbC,EAAKC,EAAOC,EAAY,EAAGC,EAAc,EAAGC,EAAa,EAC7D,GAAIP,EAAK,SAAW,EAEpB,CAAAtG,EAAE,cAAgB,EAClBA,EAAE,QAAUsG,EACZtG,EAAE,SAAWsG,EAAK,OAClB,EAAG,CAQF,GAPAtG,EAAE,eAAiB,EACnBA,EAAE,UAAYkG,EACTlG,EAAE,WAAa,GAAO,CAACqG,IAC3BrG,EAAE,cAAgB,EAClBqG,EAAc,IAEfI,EAAMzG,EAAE,QAAQmG,CAAK,EACjBE,GAAgBI,IAAQ,IAC3B,GAAIzG,EAAE,WAAa,EAClB,MAAM,IAAI,MAAM,sBAAsB,UAC7ByG,IAAQ,GAAQA,IAAQ,EAClC,MAAM,IAAI,MAAM,cAAgBzG,EAAE,GAAG,EACtC,IAAKqG,GAAeI,IAAQ,IAAkBzG,EAAE,WAAasG,EAAK,OACjE,MAAM,IAAI,MAAM,sBAAsB,EACnCtG,EAAE,iBACDA,EAAE,iBAAmBkG,EACxBM,EAAQ,KAAK,IAAI,WAAWJ,CAAG,CAAC,EAEhCI,EAAQ,KAAKJ,EAAI,SAAS,EAAGpG,EAAE,cAAc,CAAC,GAChD6G,GAAc7G,EAAE,eACZuG,GAAcvG,EAAE,cAAgB,GAAKA,EAAE,eAAiB2G,IAC3DJ,EAAWvG,EAAE,aAAa,EAC1B2G,EAAY3G,EAAE,cAEhB,OAASA,EAAE,SAAW,GAAKA,EAAE,YAAc,GAC3C,OAAIwG,EAAQ,OAAS,GACpBE,EAAQ,IAAI,WAAWG,CAAU,EACjCL,EAAQ,QAAQ,SAAUM,EAAO,CAChCJ,EAAM,IAAII,EAAOF,CAAW,EAC5BA,GAAeE,EAAM,MACtB,CAAC,GAEDJ,EAAQF,EAAQ,CAAC,EAAI,IAAI,WAAWA,EAAQ,CAAC,CAAC,EAAI,IAAI,WAEhDE,EACR,EACAxI,EAAK,MAAQ,UAAY,CACxB8B,EAAE,WAAW,CACd,CACD,CCljEA,IAAM+G,GAAsB,IAEtBC,GAAW,IAAI,KAAK,KAAM,GAAI,EAAE,EAChCC,GAAW,IAAI,KAAK,KAAM,EAAG,CAAC,EAE9BC,GAAkB,OAClBC,GAAiB,YACjBC,GAAgB,WCrCtB,IAAMC,GAAN,KAAoB,CAEnB,YAAYC,EAAO,CAClB,OAAO,cAAc,eAAgB,CACpC,YAAYC,EAASC,EAAS,CAC7B,IAAMC,EAAQ,IAAIH,EAAME,CAAO,EAC/B,MAAM,CACL,UAAUE,EAAOC,EAAY,CAC5BA,EAAW,QAAQF,EAAM,OAAOC,CAAK,CAAC,CACvC,EACA,MAAMC,EAAY,CACjB,IAAMD,EAAQD,EAAM,MAAM,EACtBC,GACHC,EAAW,QAAQD,CAAK,CAE1B,CACD,CAAC,CACF,CACD,CACD,CACD,EClBA,IAAME,GAAqB,GACvBC,GAAa,EACjB,GAAI,CACC,OAAO,WAAaC,IAAkB,UAAU,sBACnDD,GAAa,UAAU,oBAEzB,MAAiB,CAEjB,CACA,IAAME,GAAwB,CAC7B,UAAW,IAAM,KACjB,WAAAF,GACA,uBAAwB,IACxB,cAAe,GACf,qBAAsB,GACtB,cAAeG,GACf,wBAAyB,OAAO,mBAAqBF,IAAkB,kBACvE,0BAA2B,OAAO,qBAAuBA,IAAkB,mBAC5E,EAEMG,GAAS,OAAO,OAAO,CAAC,EAAGF,EAAqB,EAQtD,SAASG,IAAmB,CAC3B,OAAOC,EACR,CAEA,SAASC,GAAaD,EAAQ,CAC7B,OAAO,KAAK,IAAIA,EAAO,UAAWE,EAAkB,CACrD,CAEA,SAASC,GAAUC,EAAe,CACjC,GAAM,CACL,QAAAC,EACA,UAAAC,EACA,WAAAC,EACA,uBAAAC,EACA,qBAAAC,EACA,cAAAC,EACA,QAAAC,EACA,QAAAC,EACA,kBAAAC,EACA,oBAAAC,EACA,cAAAC,CACD,EAAIX,EAeJ,GAdAY,GAAa,UAAWX,CAAO,EAC/BW,GAAa,YAAaV,CAAS,EACnCU,GAAa,aAAcT,CAAU,EACrCS,GAAa,yBAA0BR,CAAsB,EAC7DQ,GAAa,uBAAwBP,CAAoB,EACzDO,GAAa,gBAAiBN,CAAa,EACvCC,IACHX,GAAO,kBAAoB,IAAIiB,GAAcN,CAAO,GAEjDC,IACHZ,GAAO,oBAAsB,IAAIiB,GAAcL,CAAO,GAEvDI,GAAa,oBAAqBH,CAAiB,EACnDG,GAAa,sBAAuBF,CAAmB,EACnDC,IAAkBG,GAAiB,CACtC,GAAM,CAAE,QAAAC,EAAS,QAAAC,CAAQ,EAAIL,EAM7B,IALII,GAAWC,KACTpB,GAAO,gBACXA,GAAO,cAAgB,CAAC,IAGtBmB,EAAS,CACZ,GAAI,CAAC,MAAM,QAAQA,CAAO,EACzB,MAAM,IAAI,MAAM,wCAAwC,EAEzDnB,GAAO,cAAc,QAAUmB,CAChC,CACA,GAAIC,EAAS,CACZ,GAAI,CAAC,MAAM,QAAQA,CAAO,EACzB,MAAM,IAAI,MAAM,wCAAwC,EAEzDpB,GAAO,cAAc,QAAUoB,CAChC,CACD,CACD,CAEA,SAASJ,GAAaK,EAAcC,EAAe,CAC9CA,IAAkBJ,KACrBlB,GAAOqB,CAAY,EAAIC,EAEzB,CC9FA,IAAMC,GAAQ,CACb,YAAe,CACd,eAAgB,KAChB,QAAW,MACX,WAAY,OACZ,cAAe,UACf,eAAgB,UAChB,OAAU,MACV,WAAY,KACZ,eAAgB,WAChB,QAAW,MACX,WAAc,CACb,KACA,MACD,EACA,aAAgB,MAChB,IAAO,MACP,eAAgB,MAChB,yBAA0B,MAC1B,UAAW,QACX,IAAO,MACP,eAAgB,MAChB,YAAe,CACd,KACA,KACA,IACD,EACA,SAAY,MACZ,OAAU,CACT,MACA,MACA,KACD,EACA,IAAO,MACP,IAAO,MACP,IAAO,MACP,IAAO,MACP,WAAY,MACZ,gBAAiB,CAChB,MACA,KACD,EACA,aAAc,MACd,WAAc,CACb,KACA,KACA,MACA,OACA,OACA,OACA,MACD,EACA,IAAO,MACP,UAAW,MACX,UAAW,MACX,IAAO,MACP,YAAa,CACZ,QACA,KACD,EACA,IAAO,CACN,MACA,MACA,MACA,MACD,EACA,WAAY,OACZ,IAAO,MACP,8BAA+B,MAC/B,iBAAkB,MAClB,2BAA4B,MAC5B,uBAAwB,MACxB,sBAAuB,MACvB,eAAgB,CACf,MACA,MACA,MACA,MACA,MACA,MACA,KACD,EACA,oBAAqB,MACrB,iBAAkB,MAClB,oBAAqB,CACpB,MACA,MACA,MACA,MACA,KACD,EACA,+BAAgC,MAChC,kCAAmC,MACnC,iCAAkC,MAClC,kCAAmC,MACnC,2CAA4C,MAC5C,+BAAgC,MAChC,sCAAuC,MACvC,+CAAgD,MAChD,qCAAsC,MACtC,8CAA+C,MAC/C,8BAA+B,MAC/B,qCAAsC,CACrC,MACA,KACD,EACA,uCAAwC,MACxC,kCAAmC,MACnC,wDAAyD,OACzD,2DAA4D,OAC5D,gEAAiE,OACjE,6DAA8D,OAC9D,4DAA6D,OAC7D,8DAA+D,OAC/D,8DAA+D,OAC/D,WAAY,MACZ,wBAAyB,MACzB,yBAA0B,MAC1B,wBAAyB,MACzB,2BAA4B,MAC5B,wBAAyB,CACxB,MACA,KACD,EACA,0BAA2B,CAC1B,MACA,KACD,EACA,iCAAkC,MAClC,mBAAoB,MACpB,4BAA6B,MAC7B,mBAAoB,MACpB,4BAA6B,MAC7B,sBAAuB,MACvB,+BAAgC,MAChC,mBAAoB,MACpB,qBAAsB,MACtB,4BAA6B,MAC7B,8BAA+B,MAC/B,sBAAuB,CACtB,MACA,MACD,EACA,YAAa,CACZ,MACA,MACA,MACA,MACA,OACA,OACA,OACA,OACA,MACD,EACA,gBAAiB,QACjB,eAAgB,OAChB,qBAAsB,QACtB,kBAAmB,MACnB,qBAAsB,MACtB,QAAS,KACT,kBAAmB,KACnB,YAAa,MACb,oBAAqB,MACrB,UAAW,QACX,eAAgB,UAChB,QAAS,CACR,MACA,MACA,MACA,KACD,EACA,QAAS,MACT,QAAS,CACR,MACA,KACD,EACA,WAAY,MACZ,cAAe,MACf,SAAU,OACV,QAAS,MACT,aAAc,CACb,MACA,MACA,MACA,MACA,MACA,MACA,MACA,KACD,EACA,QAAS,MACT,SAAU,MACV,QAAS,MACT,gBAAiB,QACjB,SAAU,QACV,aAAc,KACd,aAAc,WACd,WAAY,MACZ,wBAAyB,MACzB,SAAU,CACT,OACA,KACD,EACA,QAAS,MACT,cAAe,CACd,QACA,MACA,KACD,EACA,qBAAsB,OACtB,eAAgB,OAChB,4BAA6B,QAC7B,eAAgB,OAChB,eAAgB,OAChB,QAAS,MACT,SAAU,OACV,oBAAqB,CACpB,MACA,KACD,EACA,WAAY,MACZ,kBAAmB,MACnB,mBAAoB,OACpB,SAAU,MACV,iBAAkB,MAClB,UAAW,QACX,QAAS,MACT,QAAS,MACT,UAAW,CACV,MACA,KACA,OACD,EACA,WAAY,MACZ,kBAAmB,CAClB,MACA,MACA,MACA,KACD,EACA,WAAY,CACX,IACD,EACA,wBAAyB,CACxB,MACA,KACD,EACA,QAAS,MACT,WAAY,IACZ,mBAAoB,MACpB,sBAAuB,MACvB,gBAAiB,CAChB,MACA,KACD,EACA,SAAU,CACT,MACA,MACA,KACD,EACA,oBAAqB,MACrB,2BAA4B,CAC3B,MACA,KACD,EACA,SAAU,KACV,OAAQ,KACR,SAAU,OACV,oBAAqB,CACpB,MACA,MACD,EACA,gBAAiB,MACjB,YAAa,MACb,YAAa,UACb,WAAY,SACZ,QAAS,MACT,WAAY,KACZ,WAAY,KACZ,YAAa,CACZ,UACA,MACD,EACA,UAAW,CACV,IACA,IACA,MACA,MACA,KACD,EACA,UAAW,QACX,gBAAiB,MACjB,UAAW,KACX,iBAAkB,CACjB,MACA,MACA,KACD,EACA,QAAS,MACT,SAAU,MACV,cAAe,MACf,WAAc,KACd,cAAe,UACf,YAAa,QACb,kBAAmB,QACnB,iBAAkB,QAClB,cAAe,QACf,cAAe,QACf,aAAc,QACd,cAAe,MACf,WAAY,OACZ,WAAY,QACZ,WAAY,OACZ,WAAY,OACZ,IAAO,MACP,aAAc,MACd,UAAW,MACX,UAAW,MACX,IAAO,MACP,YAAe,MACf,YAAa,CACZ,MACA,OACD,EACA,MAAS,QACT,cAAe,SACf,WAAY,UACZ,WAAY,OACZ,KAAQ,MACR,cAAe,OACf,aAAc,CACb,SACA,KACD,EACA,KAAQ,OACR,yBAA0B,QAC1B,eAAgB,WAChB,gBAAiB,QACjB,WAAY,OACZ,WAAY,OACZ,KAAQ,CACP,MACA,MACD,EACA,IAAO,OACP,oBAAqB,MACrB,YAAa,QACb,QAAW,CACV,SACA,UACA,SACA,QACD,EACA,KAAQ,OACR,sBAAuB,MACvB,gBAAiB,MACjB,OAAU,MACV,aAAc,CACb,MACA,KACD,EACA,kBAAmB,MACnB,MAAS,KACT,iBAAkB,KAClB,WAAY,MACZ,eAAgB,UAChB,QAAW,MACX,UAAW,MACX,UAAW,MACX,WAAY,UACZ,cAAe,MACf,0BAA2B,MAC3B,qBAAsB,KACtB,0BAA2B,MAC3B,mBAAoB,KACpB,oBAAqB,MACrB,gBAAiB,MACjB,WAAY,MACZ,UAAW,MACX,WAAY,OACZ,kBAAmB,MACnB,mBAAoB,MACpB,kBAAmB,MACnB,mBAAoB,MACpB,IAAO,MACP,yBAA0B,SAC1B,8BAA+B,SAC/B,UAAW,MACX,eAAgB,KAChB,qBAAsB,MACtB,KAAQ,OACR,WAAY,QACZ,UAAW,MACX,WAAY,OACZ,WAAY,OACZ,UAAW,CACV,MACA,WACD,EACA,aAAc,MACd,mBAAoB,MACpB,wBAAyB,MACzB,wBAAyB,MACzB,sBAAuB,MACvB,iBAAkB,OAClB,uBAAwB,MACxB,wBAAyB,MACzB,wBAAyB,MACzB,eAAgB,MAChB,cAAe,CACd,MACA,OACD,EACA,kDAAmD,MACnD,8BAA+B,OAC/B,gBAAiB,CAChB,MACA,MACD,EACA,oBAAqB,MACrB,iBAAkB,OAClB,kBAAmB,QACnB,4BAA6B,MAC7B,4BAA6B,MAC7B,mBAAoB,MACpB,2BAA4B,MAC5B,gBAAiB,MACjB,6CAA8C,MAC9C,0CAA2C,MAC3C,2BAA4B,MAC5B,0BAA2B,OAC3B,oBAAqB,OACrB,yBAA0B,MAC1B,4BAA6B,OAC7B,iBAAkB,MAClB,wBAAyB,MACzB,UAAW,MACX,sBAAuB,MACvB,mBAAoB,QACpB,2BAA4B,MAC5B,eAAgB,MAChB,kBAAmB,MACnB,oBAAqB,CACpB,MACA,MACA,MACA,MACA,KACD,EACA,mCAAoC,SACpC,uCAAwC,SACxC,kBAAmB,MACnB,mBAAoB,UACpB,kBAAmB,MACnB,oBAAqB,OACrB,6BAA8B,OAC9B,4BAA6B,OAC7B,6BAA8B,OAC9B,6BAA8B,OAC9B,4BAA6B,MAC7B,gBAAiB,MACjB,eAAgB,MAChB,eAAgB,MAChB,iBAAkB,QAClB,WAAY,OACZ,sBAAuB,MACvB,gBAAiB,CAChB,MACA,OACA,MACA,MACD,EACA,oBAAqB,CACpB,MACA,MACD,EACA,uBAAwB,CACvB,MACA,MACD,EACA,eAAgB,CACf,MACA,MACD,EACA,6BAA8B,YAC9B,UAAW,MACX,gBAAiB,MACjB,cAAe,MACf,mBAAoB,OACpB,kBAAmB,OACnB,cAAe,MACf,kBAAmB,MACnB,cAAe,MACf,mBAAoB,MACpB,cAAe,MACf,gBAAiB,MACjB,gBAAiB,MACjB,uBAAwB,MACxB,iBAAkB,MAClB,gBAAiB,MACjB,mBAAoB,CACnB,MACA,KACD,EACA,kBAAmB,MACnB,oBAAqB,MACrB,UAAW,MACX,iBAAkB,QAClB,gBAAiB,CAChB,OACA,UACD,EACA,iBAAkB,MAClB,oBAAqB,MACrB,iBAAkB,CACjB,KACA,QACA,QACA,MACD,EACA,kBAAmB,MACnB,kBAAmB,MACnB,oBAAqB,MACrB,oBAAqB,MACrB,qBAAsB,MACtB,qBAAsB,MACtB,sBAAuB,MACvB,uBAAwB,MACxB,oBAAqB,MACrB,0BAA2B,MAC3B,iCAAkC,MAClC,iBAAkB,MAClB,uBAAwB,MACxB,oBAAqB,MACrB,oBAAqB,MACrB,wBAAyB,CACxB,MACA,KACD,EACA,cAAe,MACf,cAAe,MACf,eAAgB,MAChB,UAAW,MACX,aAAc,CACb,MACA,KACD,EACA,qBAAsB,MACtB,kBAAmB,MACnB,8BAA+B,MAC/B,sBAAuB,MACvB,0BAA2B,MAC3B,2BAA4B,MAC5B,mBAAoB,MACpB,cAAe,MACf,iCAAkC,MAClC,WAAY,OACZ,wBAAyB,MACzB,cAAe,OACf,cAAe,OACf,aAAc,MACd,cAAe,MACf,aAAc,MACd,eAAgB,QAChB,2BAA4B,YAC5B,kBAAmB,MACnB,iBAAkB,CACjB,MACA,UACA,UACD,EACA,4BAA6B,MAC7B,2BAA4B,KAC5B,iBAAkB,CACjB,MACA,KACD,EACA,eAAgB,MAChB,sBAAuB,MACvB,sBAAuB,MACvB,iBAAkB,MAClB,uBAAwB,CACvB,MACA,KACD,EACA,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,4BAA6B,YAC7B,8BAA+B,MAC/B,aAAc,MACd,eAAgB,MAChB,UAAW,MACX,4BAA6B,MAC7B,WAAY,OACZ,yBAA0B,OAC1B,cAAe,CACd,MACA,KACD,EACA,iBAAkB,SAClB,iBAAkB,OAClB,mBAAoB,MACpB,gBAAiB,MACjB,kBAAmB,MACnB,qBAAsB,CACrB,MACA,KACD,EACA,kBAAmB,MACnB,gBAAiB,CAChB,MACA,KACD,EACA,iBAAkB,OAClB,mBAAoB,MACpB,YAAa,CACZ,MACA,KACD,EACA,WAAY,CACX,MACA,MACA,MACA,KACD,EACA,uBAAwB,MACxB,kBAAmB,SACnB,yCAA0C,MAC1C,8CAA+C,MAC/C,kBAAmB,MACnB,qBAAsB,MACtB,sBAAuB,MACvB,kBAAmB,MACnB,sBAAuB,MACvB,sBAAuB,MACvB,oBAAqB,MACrB,uBAAwB,UACxB,UAAW,MACX,kBAAmB,MACnB,yBAA0B,QAC1B,WAAY,MACZ,WAAY,MACZ,qBAAsB,MACtB,qBAAsB,MACtB,UAAW,MACX,iBAAkB,MAClB,iBAAkB,MAClB,iBAAkB,MAClB,iBAAkB,MAClB,iBAAkB,MAClB,iBAAkB,MAClB,iBAAkB,MAClB,yBAA0B,MAC1B,yBAA0B,MAC1B,kBAAmB,MACnB,wBAAyB,MACzB,qCAAsC,OACtC,4CAA6C,OAC7C,qCAAsC,OACtC,wCAAyC,OACzC,oBAAqB,MACrB,kBAAmB,MACnB,aAAc,MACd,aAAc,MACd,qBAAsB,OACtB,0CAA2C,OAC3C,iDAAkD,OAClD,0CAA2C,OAC3C,8CAA+C,OAC/C,6CAA8C,OAC9C,iBAAkB,CACjB,MACA,KACD,EACA,uCAAwC,OACxC,uCAAwC,OACxC,eAAgB,CACf,MACA,MACA,MACA,KACD,EACA,aAAc,MACd,qBAAsB,MACtB,WAAY,OACZ,eAAgB,MAChB,kBAAmB,OACnB,YAAa,SACb,wBAAyB,MACzB,WAAY,CACX,MACA,MACD,EACA,yBAA0B,MAC1B,sBAAuB,MACvB,mBAAoB,MACpB,wBAAyB,QACzB,mCAAoC,SACpC,yBAA0B,OAC1B,0BAA2B,OAC3B,mBAAoB,MACpB,mBAAoB,MACpB,mBAAoB,MACpB,wCAAyC,MACzC,0CAA2C,OAC3C,wCAAyC,MACzC,iBAAkB,KAClB,kBAAmB,MACnB,8BAA+B,MAC/B,yDAA0D,OAC1D,6BAA8B,MAC9B,cAAe,KACf,qBAAsB,MACtB,WAAY,CACX,MACA,MACA,MACD,EACA,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,aAAc,OACd,iBAAkB,KAClB,kBAAmB,MACnB,oBAAqB,MACrB,yBAA0B,MAC1B,uBAAwB,MACxB,4BAA6B,MAC7B,gBAAiB,OACjB,wBAAyB,CACxB,MACA,MACA,MACA,MACA,MACA,KACD,EACA,kBAAmB,MACnB,yBAA0B,MAC1B,6BAA8B,WAC9B,qBAAsB,aACtB,mBAAoB,KACpB,uBAAwB,OACxB,yBAA0B,SAC1B,2BAA4B,KAC5B,cAAe,MACf,WAAY,OACZ,WAAY,OACZ,WAAY,OACZ,8BAA+B,MAC/B,kCAAmC,MACnC,iCAAkC,MAClC,6BAA8B,MAC9B,yBAA0B,CACzB,MACA,MACD,EACA,oBAAqB,UACrB,sBAAuB,CACtB,OACA,MACD,EACA,mBAAoB,MACpB,mBAAoB,MACpB,wBAAyB,QACzB,0BAA2B,KAC3B,mBAAoB,CACnB,MACA,MACD,EACA,UAAW,MACX,iBAAkB,MAClB,sBAAuB,MACvB,oBAAqB,MACrB,gCAAiC,MACjC,mBAAoB,CACnB,OACA,MACA,KACD,EACA,qBAAsB,MACtB,eAAgB,MAChB,mBAAoB,MACpB,cAAe,MACf,WAAY,CACX,MACA,MACD,EACA,gBAAiB,MACjB,aAAc,MACd,YAAa,WACb,eAAgB,OAChB,UAAW,MACX,gBAAiB,MACjB,UAAW,MACX,eAAgB,MAChB,qBAAsB,MACtB,UAAW,MACX,aAAc,MACd,WAAY,MACZ,WAAY,OACZ,oBAAqB,MACrB,uBAAwB,MACxB,sBAAuB,MACvB,6BAA8B,MAC9B,wCAAyC,SACzC,wBAAyB,MACzB,yBAA0B,MAC1B,8BAA+B,MAC/B,UAAW,CACV,MACA,MACD,EACA,qBAAsB,MACtB,eAAgB,OAChB,OAAU,MACV,OAAU,MACV,WAAY,OACZ,eAAgB,WAChB,mBAAoB,MACpB,mBAAoB,CACnB,MACA,MACA,MACA,KACD,EACA,mBAAoB,MACpB,mBAAoB,MACpB,UAAW,CACV,MACA,OACD,EACA,SAAU,KACV,UAAW,CACV,MACA,KACD,EACA,mBAAoB,MACpB,SAAU,OACV,eAAgB,MAChB,mBAAoB,MACpB,eAAgB,MAChB,eAAgB,MAChB,oBAAqB,MACrB,QAAS,MACT,aAAc,MACd,qBAAsB,MACtB,mBAAoB,MACpB,aAAc,MACd,aAAc,MACd,aAAc,CACb,MACA,KACD,EACA,eAAgB,CACf,MACA,MACA,MACA,KACD,EACA,YAAa,MACb,mBAAoB,MACpB,UAAW,MACX,eAAgB,SAChB,yBAA0B,UAC1B,mBAAoB,CACnB,MACA,KACD,EACA,QAAS,MACT,qBAAsB,CACrB,MACA,MACD,EACA,mBAAoB,cACpB,gBAAiB,MACjB,YAAa,OACb,aAAc,MACd,eAAgB,MAChB,WAAY,MACZ,6BAA8B,MAC9B,gBAAiB,CAChB,MACA,MACA,KACD,EACA,eAAgB,CACf,MACA,MACA,MACA,KACD,EACA,YAAa,MACb,gBAAiB,MACjB,eAAgB,MAChB,eAAgB,MAChB,YAAa,MACb,QAAS,MACT,WAAY,CACX,MACA,KACD,EACA,uBAAwB,CACvB,MACA,KACD,EACA,0BAA2B,MAC3B,oBAAqB,MACrB,QAAS,MACT,aAAc,OACd,WAAY,MACZ,eAAgB,KAChB,YAAa,MACb,SAAU,MACV,cAAe,MACf,OAAQ,KACR,aAAc,CACb,KACA,KACA,KACA,KACA,KACA,KACA,KACA,IACD,EACA,WAAY,OACZ,gBAAiB,MACjB,WAAY,OACZ,UAAW,MACX,UAAW,MACX,YAAa,MACb,WAAY,OACZ,SAAU,CACT,OACA,QACA,OACA,KACD,EACA,KAAQ,OACR,UAAW,MACX,MAAS,MACT,SAAY,MACZ,2BAA4B,MAC5B,UAAa,MACb,iBAAkB,MAClB,sBAAuB,MACvB,aAAc,IACd,YAAa,CACZ,MACA,MACA,MACA,KACD,EACA,gBAAiB,MACjB,KAAQ,CACP,KACA,KACD,EACA,WAAY,CACX,MACA,MACD,EACA,4BAA6B,CAC5B,MACA,MACD,EACA,uBAAwB,MACxB,cAAe,CACd,KACA,SACA,UACA,SACA,aACA,SACA,YACD,EACA,cAAe,MACf,cAAe,MACf,UAAW,CACV,MACA,KACD,EACA,SAAU,CACT,KACA,IACD,EACA,KAAQ,CACP,OACA,KACD,CACD,EACA,MAAS,CACR,IAAO,MACP,SAAU,MACV,QAAW,MACX,MAAS,CACR,KACA,KACD,EACA,KAAQ,OACR,KAAQ,CACP,MACA,OACA,MACA,KACD,EACA,KAAQ,CACP,OACA,QACA,MACA,MACA,OACA,MACA,KACD,EACA,QAAW,MACX,IAAO,CACN,MACA,MACA,KACD,EACA,UAAW,MACX,SAAU,OACV,QAAS,MACT,WAAY,MACZ,WAAY,MACZ,iBAAkB,MAClB,cAAe,KACf,QAAS,MACT,MAAS,MACT,IAAO,OACP,IAAO,MACP,KAAQ,MACR,iBAAkB,CACjB,MACA,MACD,EACA,oBAAqB,MACrB,UAAW,MACX,UAAW,MACX,aAAc,QACd,mBAAoB,MACpB,6BAA8B,MAC9B,sBAAuB,YACvB,sBAAuB,YACvB,sBAAuB,YACvB,UAAW,MACX,KAAQ,OACR,QAAS,MACT,aAAc,MACd,wBAAyB,MACzB,GAAM,KACN,IAAO,MACP,KAAQ,CACP,OACA,MACA,KACD,EACA,KAAQ,OACR,IAAO,KACR,EACA,SAAY,CACX,YAAa,MACb,UAAW,CACV,MACA,OACD,EACA,cAAe,MACf,kBAAmB,CAClB,OACA,SACA,MACD,EACA,QAAS,MACT,WAAY,MACZ,QAAS,MACT,SAAU,OACV,QAAS,MACT,YAAa,MACb,cAAe,MACf,SAAU,CACT,OACA,KACD,EACA,QAAS,MACT,QAAS,CACR,MACA,KACD,EACA,uBAAwB,CACvB,MACA,MACD,EACA,iBAAkB,CACjB,MACA,MACA,OACD,EACA,wBAAyB,CACxB,MACA,MACD,EACA,kBAAmB,MACnB,mBAAoB,CACnB,MACA,MACA,KACD,EACA,iBAAkB,MAClB,kBAAmB,MACnB,YAAa,MACb,QAAS,MACT,YAAa,CACZ,OACA,KACD,EACA,aAAc,CACb,MACA,IACD,EACA,aAAc,MACd,gBAAiB,MACjB,qBAAsB,OACtB,gBAAiB,MACjB,eAAgB,KAChB,gBAAiB,MACjB,eAAgB,KAChB,YAAa,MACb,UAAW,OACX,SAAU,OACV,cAAe,IACf,gBAAiB,MACjB,gBAAiB,CAChB,MACA,SACA,KACD,EACA,cAAe,MACf,cAAe,MACf,oBAAqB,CACpB,MACA,KACD,EACA,qBAAsB,MACtB,WAAY,MACZ,cAAe,KACf,mBAAoB,MACpB,QAAS,MACT,SAAU,OACV,QAAS,KACV,EACA,KAAQ,CACP,IAAO,MACP,KAAQ,OACR,MAAS,OACV,EACA,MAAS,CACR,IAAO,MACP,IAAO,MACP,KAAQ,CACP,OACA,MACA,MACA,OACA,YACA,KACD,EACA,IAAO,MACP,IAAO,MACP,UAAW,CACV,MACA,MACD,EACA,KAAQ,CACP,OACA,KACD,EACA,WAAY,CACX,OACA,KACD,EACA,eAAgB,OAChB,cAAe,MACf,cAAe,MACf,eAAgB,MAChB,cAAe,MACf,qBAAsB,MACtB,sBAAuB,MACvB,oBAAqB,MACrB,cAAe,MACf,SAAU,MACV,OAAQ,MACR,QAAS,MACT,cAAe,MACf,gBAAiB,MACjB,oBAAqB,MACrB,oBAAqB,MACrB,qBAAsB,MACtB,oBAAqB,MACrB,QAAS,MACT,YAAa,MACb,YAAa,MACb,gBAAiB,MACjB,IAAO,MACP,IAAO,MACP,MAAS,KACT,IAAO,MACP,WAAY,OACZ,IAAO,MACP,mBAAoB,CACnB,MACA,OACA,MACA,MACD,EACA,UAAW,MACX,UAAW,MACX,mBAAoB,MACpB,UAAW,MACX,UAAW,MACX,2BAA4B,MAC5B,2BAA4B,MAC5B,cAAe,MACf,eAAgB,MAChB,cAAe,MACf,WAAY,MACZ,KAAQ,OACR,QAAS,MACT,QAAS,MACT,aAAc,CACb,KACA,MACA,MACA,MACA,KACD,EACA,SAAU,CACT,MACA,KACD,EACA,QAAS,MACT,UAAW,MACX,KAAQ,QACR,KAAQ,CACP,OACA,MACD,EACA,MAAS,CACR,MACD,EACA,sBAAuB,MACvB,cAAe,MACf,aAAc,MACd,SAAU,OACV,cAAe,MACf,cAAe,MACf,cAAe,MACf,gBAAiB,MACjB,kBAAmB,CAClB,MACA,MACA,KACD,EACA,eAAgB,CACf,MACA,KACD,EACA,cAAe,MACf,aAAc,MACd,aAAc,MACd,aAAc,KACf,EACA,QAAW,CACV,OAAU,CACT,MACA,OACA,MACA,QACA,KACD,CACD,EACA,MAAS,CACR,KAAQ,CACP,MACA,MACD,EACA,KAAQ,CACP,MACA,OACA,MACD,EACA,KAAQ,CACP,MACA,MACD,EACA,WAAY,CACX,OACA,OACD,EACA,UAAW,OACX,aAAc,CACb,OACA,OACD,EACA,kBAAmB,MACnB,UAAW,MACX,UAAW,MACX,UAAW,MACX,UAAW,MACX,UAAW,KACZ,EACA,KAAQ,CACP,iBAAkB,CACjB,WACA,UACD,EACA,SAAY,CACX,MACA,MACA,KACD,EACA,IAAO,MACP,IAAO,MACP,KAAQ,MACR,KAAQ,CACP,OACA,MACA,QACA,KACD,EACA,KAAQ,MACR,MAAS,CACR,MACA,OACA,MACA,OACA,MACA,OACA,MACA,KACA,MACA,OACA,KACD,EACA,SAAY,MACZ,UAAa,CACZ,MACA,KACD,EACA,QAAW,KACX,uBAAwB,MACxB,8BAA+B,MAC/B,cAAe,MACf,oBAAqB,OACrB,WAAY,MACZ,QAAS,MACT,WAAY,CACX,MACA,MACA,MACA,IACD,EACA,WAAY,CACX,MACA,MACA,MACA,IACD,EACA,cAAe,MACf,SAAU,IACV,SAAU,QACV,YAAa,KACb,SAAU,OACV,qBAAsB,MACtB,QAAS,MACT,WAAY,CACX,IACA,MACA,KACA,KACD,EACA,YAAa,MACb,WAAY,KACZ,UAAW,QACX,WAAY,MACZ,QAAS,CACR,MACA,IACD,EACA,QAAS,CACR,MACA,MACA,MACA,KACD,EACA,cAAe,MACf,UAAW,MACX,GAAM,KACN,gBAAiB,MACjB,KAAQ,CACP,OACA,KACD,EACA,MAAS,CACR,IACA,KACA,OACA,MACA,KACA,IACD,EACA,OAAU,MACV,WAAY,CACX,MACA,OACA,MACD,EACA,MAAS,QACT,WAAY,OACZ,iBAAkB,QAClB,iBAAkB,QAClB,iBAAkB,QAClB,mBAAoB,MACpB,UAAW,MACX,mBAAoB,MACpB,eAAgB,KAChB,gBAAiB,OACjB,gBAAiB,OACjB,QAAS,CACR,IACA,KACD,EACA,MAAO,CACN,IACA,IACA,KACD,EACA,YAAa,CACZ,IACA,MACA,MACA,KACD,EACA,SAAU,OACV,QAAS,MACT,QAAS,MACT,aAAc,KACd,YAAe,MACf,WAAc,KACd,KAAQ,OACR,SAAY,CACX,KACA,WACA,QACA,QACD,EACA,aAAc,KACd,aAAc,IACf,EACA,MAAS,CACR,KAAQ,OACR,OAAQ,MACR,QAAW,MACX,GAAM,KACN,GAAM,CACL,MACA,IACD,EACA,IAAO,MACP,GAAM,KACN,KAAQ,CACP,OACA,MACA,MACA,MACA,MACA,MACA,MACA,MACD,EACA,IAAO,CACN,MACA,OACA,MACD,EACA,UAAa,CACZ,KACA,KACD,EACA,IAAO,MACP,cAAe,CACd,MACA,KACD,EACA,QAAS,MACT,WAAY,CACX,MACA,KACD,EACA,QAAS,MACT,WAAY,CACX,MACA,MACA,KACD,EACA,UAAW,KACX,WAAY,MACZ,WAAY,MACZ,WAAY,MACZ,YAAa,MACb,cAAe,QACf,aAAc,CACb,MACA,MACA,OACA,KACD,EACA,QAAS,MACT,KAAQ,OACR,KAAQ,OACR,KAAQ,OACR,KAAQ,OACR,IAAO,CACN,MACA,MACD,EACA,IAAO,CACN,MACA,MACD,EACA,cAAe,CACd,MACA,MACD,EACA,kBAAmB,CAClB,MACA,MACD,EACA,cAAe,CACd,MACA,MACD,EACA,cAAe,CACd,MACA,MACD,EACA,iBAAkB,CACjB,MACA,MACD,EACA,eAAgB,MAChB,UAAW,MACX,6BAA8B,MAC9B,eAAgB,CACf,MACA,MACD,EACA,WAAY,MACZ,KAAQ,OACR,QAAS,MACT,QAAS,MACT,WAAY,MACZ,QAAS,MACT,KAAQ,IACT,EACA,eAAgB,CACf,aAAc,KACf,EACA,UAAW,CACV,SAAU,CACT,MACA,MACA,MACA,MACA,KACD,CACD,CACD,EAEMC,IAAa,IAAM,CACxB,IAAMA,EAAY,CAAC,EACnB,QAAWC,KAAQ,OAAO,KAAKF,EAAK,EACnC,QAAWG,KAAW,OAAO,KAAKH,GAAME,CAAI,CAAC,EAAG,CAC/C,IAAME,EAAQJ,GAAME,CAAI,EAAEC,CAAO,EACjC,GAAI,OAAOC,GAAS,SACnBH,EAAUG,CAAK,EAAIF,EAAO,IAAMC,MAEhC,SAASE,EAAgB,EAAGA,EAAgBD,EAAM,OAAQC,IACzDJ,EAAUG,EAAMC,CAAa,CAAC,EAAIH,EAAO,IAAMC,CAGlD,CAED,OAAOF,CACR,GAAG,EChkDH,IAAMK,GAAQ,CAAC,EACf,QAASC,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC7B,IAAIC,EAAID,EACR,QAASE,EAAI,EAAGA,EAAI,EAAGA,IAClBD,EAAI,EACPA,EAAKA,IAAM,EAAK,WAEhBA,EAAIA,IAAM,EAGZF,GAAMC,CAAC,EAAIC,CACZ,CAEA,IAAME,GAAN,KAAY,CAEX,YAAYC,EAAK,CAChB,KAAK,IAAMA,GAAO,EACnB,CAEA,OAAOC,EAAM,CACZ,IAAID,EAAM,KAAK,IAAM,EACrB,QAASE,EAAS,EAAGC,EAASF,EAAK,OAAS,EAAGC,EAASC,EAAQD,IAC/DF,EAAOA,IAAQ,EAAKL,IAAOK,EAAMC,EAAKC,CAAM,GAAK,GAAI,EAEtD,KAAK,IAAMF,CACZ,CAEA,KAAM,CACL,MAAO,CAAC,KAAK,GACd,CACD,EC1BA,IAAMI,GAAN,cAA0B,eAAgB,CAEzC,aAAc,CACb,IAAIC,EACEC,EAAQ,IAAIC,GAClB,MAAM,CACL,UAAUC,EAAOC,EAAY,CAC5BH,EAAM,OAAOE,CAAK,EAClBC,EAAW,QAAQD,CAAK,CACzB,EACA,OAAQ,CACP,IAAME,EAAQ,IAAI,WAAW,CAAC,EACb,IAAI,SAASA,EAAM,MAAM,EACjC,UAAU,EAAGJ,EAAM,IAAI,CAAC,EACjCD,EAAO,MAAQK,CAChB,CACD,CAAC,EACDL,EAAS,IACV,CACD,ECjBA,SAASM,GAAWC,EAAO,CAC1B,GAAI,OAAO,YAAe,IAAa,CACtCA,EAAQ,SAAS,mBAAmBA,CAAK,CAAC,EAC1C,IAAMC,EAAS,IAAI,WAAWD,EAAM,MAAM,EAC1C,QAASE,EAAI,EAAGA,EAAID,EAAO,OAAQC,IAClCD,EAAOC,CAAC,EAAIF,EAAM,WAAWE,CAAC,EAE/B,OAAOD,CACR,KACC,QAAO,IAAI,YAAY,EAAE,OAAOD,CAAK,CAEvC,CCOA,IAAMG,GAAW,CAOhB,OAAOC,EAAIC,EAAI,CACd,GAAID,EAAG,SAAW,GAAKC,EAAG,SAAW,EACpC,OAAOD,EAAG,OAAOC,CAAE,EAGpB,IAAMC,EAAOF,EAAGA,EAAG,OAAS,CAAC,EAAGG,EAAQJ,GAAS,WAAWG,CAAI,EAChE,OAAIC,IAAU,GACNH,EAAG,OAAOC,CAAE,EAEZF,GAAS,YAAYE,EAAIE,EAAOD,EAAO,EAAGF,EAAG,MAAM,EAAGA,EAAG,OAAS,CAAC,CAAC,CAE7E,EAOA,UAAUI,EAAG,CACZ,IAAMC,EAAID,EAAE,OACZ,GAAIC,IAAM,EACT,MAAO,GAER,IAAMC,EAAIF,EAAEC,EAAI,CAAC,EACjB,OAAQA,EAAI,GAAK,GAAKN,GAAS,WAAWO,CAAC,CAC5C,EAQA,MAAMF,EAAGG,EAAK,CACb,GAAIH,EAAE,OAAS,GAAKG,EACnB,OAAOH,EAERA,EAAIA,EAAE,MAAM,EAAG,KAAK,KAAKG,EAAM,EAAE,CAAC,EAClC,IAAMF,EAAID,EAAE,OACZ,OAAAG,EAAMA,EAAM,GACRF,EAAI,GAAKE,IACZH,EAAEC,EAAI,CAAC,EAAIN,GAAS,QAAQQ,EAAKH,EAAEC,EAAI,CAAC,EAAI,YAAeE,EAAM,EAAI,CAAC,GAEhEH,CACR,EASA,QAAQG,EAAKD,EAAGE,EAAM,CACrB,OAAID,IAAQ,GACJD,GAEAE,EAAOF,EAAI,EAAIA,GAAM,GAAKC,GAAQA,EAAM,aACjD,EAOA,WAAWD,EAAG,CACb,OAAO,KAAK,MAAMA,EAAI,aAAa,GAAK,EACzC,EASA,YAAYF,EAAGD,EAAOM,EAAOC,EAAK,CAKjC,IAJIA,IAAQ,SACXA,EAAM,CAAC,GAGDP,GAAS,GAAIA,GAAS,GAC5BO,EAAI,KAAKD,CAAK,EACdA,EAAQ,EAET,GAAIN,IAAU,EACb,OAAOO,EAAI,OAAON,CAAC,EAGpB,QAASO,EAAI,EAAGA,EAAIP,EAAE,OAAQO,IAC7BD,EAAI,KAAKD,EAAQL,EAAEO,CAAC,IAAMR,CAAK,EAC/BM,EAAQL,EAAEO,CAAC,GAAM,GAAKR,EAEvB,IAAMS,EAAQR,EAAE,OAASA,EAAEA,EAAE,OAAS,CAAC,EAAI,EACrCS,EAASd,GAAS,WAAWa,CAAK,EACxC,OAAAF,EAAI,KAAKX,GAAS,QAAQI,EAAQU,EAAS,GAAKV,EAAQU,EAAS,GAAMJ,EAAQC,EAAI,IAAI,EAAG,CAAC,CAAC,EACrFA,CACR,CACD,EAaMI,GAAQ,CACb,MAAO,CAEN,SAASC,EAAK,CAEb,IAAMC,EADKjB,GAAS,UAAUgB,CAAG,EACT,EAClBL,EAAM,IAAI,WAAWM,CAAU,EACjCC,EACJ,QAASN,EAAI,EAAGA,EAAIK,EAAYL,IAC1BA,EAAI,IACRM,EAAMF,EAAIJ,EAAI,CAAC,GAEhBD,EAAIC,CAAC,EAAIM,IAAQ,GACjBA,IAAQ,EAET,OAAOP,CACR,EAEA,OAAOQ,EAAO,CACb,IAAMR,EAAM,CAAC,EACTC,EACAM,EAAM,EACV,IAAKN,EAAI,EAAGA,EAAIO,EAAM,OAAQP,IAC7BM,EAAMA,GAAO,EAAIC,EAAMP,CAAC,GACnBA,EAAI,KAAO,IACfD,EAAI,KAAKO,CAAG,EACZA,EAAM,GAGR,OAAIN,EAAI,GACPD,EAAI,KAAKX,GAAS,QAAQ,GAAKY,EAAI,GAAIM,CAAG,CAAC,EAErCP,CACR,CACD,CACD,EAEMS,GAAO,CAAC,EAMdA,GAAK,KAAO,KAAM,CACjB,YAAYA,EAAM,CACjB,IAAMC,EAAO,KAKbA,EAAK,UAAY,IAKjBA,EAAK,MAAQ,CAAC,WAAY,WAAY,WAAY,UAAY,UAAU,EAKxEA,EAAK,KAAO,CAAC,WAAY,WAAY,WAAY,UAAU,EACvDD,GACHC,EAAK,GAAKD,EAAK,GAAG,MAAM,CAAC,EACzBC,EAAK,QAAUD,EAAK,QAAQ,MAAM,CAAC,EACnCC,EAAK,QAAUD,EAAK,SAEpBC,EAAK,MAAM,CAEb,CAMA,OAAQ,CACP,IAAMA,EAAO,KACb,OAAAA,EAAK,GAAKA,EAAK,MAAM,MAAM,CAAC,EAC5BA,EAAK,QAAU,CAAC,EAChBA,EAAK,QAAU,EACRA,CACR,CAOA,OAAOC,EAAM,CACZ,IAAMD,EAAO,KACT,OAAOC,GAAS,WACnBA,EAAOP,GAAM,WAAW,OAAOO,CAAI,GAEpC,IAAMC,EAAIF,EAAK,QAAUrB,GAAS,OAAOqB,EAAK,QAASC,CAAI,EACrDE,EAAKH,EAAK,QACVI,EAAKJ,EAAK,QAAUG,EAAKxB,GAAS,UAAUsB,CAAI,EACtD,GAAIG,EAAK,iBACR,MAAM,IAAI,MAAM,qCAAqC,EAEtD,IAAMC,EAAI,IAAI,YAAYH,CAAC,EACvBI,EAAI,EACR,QAASf,EAAIS,EAAK,UAAYG,GAAOH,EAAK,UAAYG,EAAOH,EAAK,UAAY,GAAKT,GAAKa,EACvFb,GAAKS,EAAK,UACVA,EAAK,OAAOK,EAAE,SAAS,GAAKC,EAAG,IAAMA,EAAI,EAAE,CAAC,EAC5CA,GAAK,EAEN,OAAAJ,EAAE,OAAO,EAAG,GAAKI,CAAC,EACXN,CACR,CAMA,UAAW,CACV,IAAMA,EAAO,KACTE,EAAIF,EAAK,QACPO,EAAIP,EAAK,GAGfE,EAAIvB,GAAS,OAAOuB,EAAG,CAACvB,GAAS,QAAQ,EAAG,CAAC,CAAC,CAAC,EAE/C,QAASY,EAAIW,EAAE,OAAS,EAAGX,EAAI,GAAIA,IAClCW,EAAE,KAAK,CAAC,EAOT,IAHAA,EAAE,KAAK,KAAK,MAAMF,EAAK,QAAU,UAAW,CAAC,EAC7CE,EAAE,KAAKF,EAAK,QAAU,CAAC,EAEhBE,EAAE,QACRF,EAAK,OAAOE,EAAE,OAAO,EAAG,EAAE,CAAC,EAG5B,OAAAF,EAAK,MAAM,EACJO,CACR,CAMA,GAAGC,EAAGN,EAAGG,EAAGI,EAAG,CACd,GAAID,GAAK,GACR,OAAQN,EAAIG,EAAM,CAACH,EAAIO,EACjB,GAAID,GAAK,GACf,OAAON,EAAIG,EAAII,EACT,GAAID,GAAK,GACf,OAAQN,EAAIG,EAAMH,EAAIO,EAAMJ,EAAII,EAC1B,GAAID,GAAK,GACf,OAAON,EAAIG,EAAII,CAEjB,CAMA,GAAG,EAAGvB,EAAG,CACR,OAAQA,GAAK,EAAMA,IAAM,GAAK,CAC/B,CAOA,OAAOwB,EAAO,CACb,IAAMV,EAAO,KACPO,EAAIP,EAAK,GAMTW,EAAI,MAAM,EAAE,EAClB,QAASL,EAAI,EAAGA,EAAI,GAAIA,IACvBK,EAAEL,CAAC,EAAII,EAAMJ,CAAC,EAGf,IAAItB,EAAIuB,EAAE,CAAC,EACPL,EAAIK,EAAE,CAAC,EACPF,EAAIE,EAAE,CAAC,EACPE,EAAIF,EAAE,CAAC,EACPK,EAAIL,EAAE,CAAC,EAEX,QAASC,EAAI,EAAGA,GAAK,GAAIA,IAAK,CACzBA,GAAK,KACRG,EAAEH,CAAC,EAAIR,EAAK,GAAG,EAAGW,EAAEH,EAAI,CAAC,EAAIG,EAAEH,EAAI,CAAC,EAAIG,EAAEH,EAAI,EAAE,EAAIG,EAAEH,EAAI,EAAE,CAAC,GAE9D,IAAMX,EAAOG,EAAK,GAAG,EAAGhB,CAAC,EAAIgB,EAAK,GAAGQ,EAAGN,EAAGG,EAAGI,CAAC,EAAIG,EAAID,EAAEH,CAAC,EACzDR,EAAK,KAAK,KAAK,MAAMQ,EAAI,EAAE,CAAC,EAAK,EAClCI,EAAIH,EACJA,EAAIJ,EACJA,EAAIL,EAAK,GAAG,GAAIE,CAAC,EACjBA,EAAIlB,EACJA,EAAIa,CACL,CAEAU,EAAE,CAAC,EAAKA,EAAE,CAAC,EAAIvB,EAAK,EACpBuB,EAAE,CAAC,EAAKA,EAAE,CAAC,EAAIL,EAAK,EACpBK,EAAE,CAAC,EAAKA,EAAE,CAAC,EAAIF,EAAK,EACpBE,EAAE,CAAC,EAAKA,EAAE,CAAC,EAAIE,EAAK,EACpBF,EAAE,CAAC,EAAKA,EAAE,CAAC,EAAIK,EAAK,CACrB,CACD,EAmBA,IAAMC,GAAS,CAAC,EAShBA,GAAO,IAAM,KAAM,CAClB,YAAYC,EAAK,CAahB,IAAMC,EAAM,KACZA,EAAI,QAAU,CAAC,CAAC,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,CAAC,EAAG,CAAC,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,CAAC,CAAC,EAEpDA,EAAI,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,GACvBA,EAAI,YAAY,EAGjB,IAAMC,EAAOD,EAAI,QAAQ,CAAC,EAAE,CAAC,EACvBE,EAAWF,EAAI,QAAQ,CAAC,EACxBG,EAASJ,EAAI,OAEfvB,EAAG4B,EAAQC,EAAQC,EAAO,EAE9B,GAAIH,IAAW,GAAKA,IAAW,GAAKA,IAAW,EAC9C,MAAM,IAAI,MAAM,sBAAsB,EAMvC,IAHAH,EAAI,KAAO,CAACI,EAASL,EAAI,MAAM,CAAC,EAAGM,EAAS,CAAC,CAAC,EAGzC7B,EAAI2B,EAAQ3B,EAAI,EAAI2B,EAAS,GAAI3B,IAAK,CAC1C,IAAIM,EAAMsB,EAAO5B,EAAI,CAAC,GAGlBA,EAAI2B,IAAW,GAAMA,IAAW,GAAK3B,EAAI2B,IAAW,KACvDrB,EAAMmB,EAAKnB,IAAQ,EAAE,GAAK,GAAKmB,EAAKnB,GAAO,GAAK,GAAG,GAAK,GAAKmB,EAAKnB,GAAO,EAAI,GAAG,GAAK,EAAImB,EAAKnB,EAAM,GAAG,EAGnGN,EAAI2B,IAAW,IAClBrB,EAAMA,GAAO,EAAIA,IAAQ,GAAKwB,GAAQ,GACtCA,EAAOA,GAAQ,GAAKA,GAAQ,GAAK,MAInCF,EAAO5B,CAAC,EAAI4B,EAAO5B,EAAI2B,CAAM,EAAIrB,CAClC,CAGA,QAASS,EAAI,EAAGf,EAAGe,IAAKf,IAAK,CAC5B,IAAMM,EAAMsB,EAAOb,EAAI,EAAIf,EAAIA,EAAI,CAAC,EAChCA,GAAK,GAAKe,EAAI,EACjBc,EAAOd,CAAC,EAAIT,EAEZuB,EAAOd,CAAC,EAAIW,EAAS,CAAC,EAAED,EAAKnB,IAAQ,EAAE,CAAC,EACvCoB,EAAS,CAAC,EAAED,EAAKnB,GAAO,GAAK,GAAG,CAAC,EACjCoB,EAAS,CAAC,EAAED,EAAKnB,GAAO,EAAI,GAAG,CAAC,EAChCoB,EAAS,CAAC,EAAED,EAAKnB,EAAM,GAAG,CAAC,CAE9B,CACD,CAaA,QAAQI,EAAM,CACb,OAAO,KAAK,OAAOA,EAAM,CAAC,CAC3B,CAOA,QAAQA,EAAM,CACb,OAAO,KAAK,OAAOA,EAAM,CAAC,CAC3B,CAOA,aAAc,CACb,IAAMqB,EAAW,KAAK,QAAQ,CAAC,EACzBL,EAAW,KAAK,QAAQ,CAAC,EACzBD,EAAOM,EAAS,CAAC,EACjBC,EAAUN,EAAS,CAAC,EACpBR,EAAI,CAAC,EACLe,EAAK,CAAC,EACRC,EAAMC,EAAIC,EAAIC,EAGlB,QAASrC,EAAI,EAAGA,EAAI,IAAKA,IACxBiC,GAAIf,EAAElB,CAAC,EAAIA,GAAK,GAAKA,GAAK,GAAK,KAAOA,CAAC,EAAIA,EAG5C,QAASL,EAAIuC,EAAO,EAAG,CAACT,EAAK9B,CAAC,EAAGA,GAAKwC,GAAM,EAAGD,EAAOD,EAAGC,CAAI,GAAK,EAAG,CAEpE,IAAII,EAAIJ,EAAOA,GAAQ,EAAIA,GAAQ,EAAIA,GAAQ,EAAIA,GAAQ,EAC3DI,EAAIA,GAAK,EAAIA,EAAI,IAAM,GACvBb,EAAK9B,CAAC,EAAI2C,EACVN,EAAQM,CAAC,EAAI3C,EAGb0C,EAAKnB,EAAEkB,EAAKlB,EAAEiB,EAAKjB,EAAEvB,CAAC,CAAC,CAAC,EACxB,IAAI4C,EAAOF,EAAK,SAAYD,EAAK,MAAUD,EAAK,IAAQxC,EAAI,SACxD6C,EAAOtB,EAAEoB,CAAC,EAAI,IAAQA,EAAI,SAE9B,QAAStC,EAAI,EAAGA,EAAI,EAAGA,IACtB+B,EAAS/B,CAAC,EAAEL,CAAC,EAAI6C,EAAOA,GAAQ,GAAKA,IAAS,EAC9Cd,EAAS1B,CAAC,EAAEsC,CAAC,EAAIC,EAAOA,GAAQ,GAAKA,IAAS,CAEhD,CAGA,QAASvC,EAAI,EAAGA,EAAI,EAAGA,IACtB+B,EAAS/B,CAAC,EAAI+B,EAAS/B,CAAC,EAAE,MAAM,CAAC,EACjC0B,EAAS1B,CAAC,EAAI0B,EAAS1B,CAAC,EAAE,MAAM,CAAC,CAEnC,CASA,OAAOyC,EAAOC,EAAK,CAClB,GAAID,EAAM,SAAW,EACpB,MAAM,IAAI,MAAM,wBAAwB,EAGzC,IAAMlB,EAAM,KAAK,KAAKmB,CAAG,EAEnBC,EAAepB,EAAI,OAAS,EAAI,EAChCxB,EAAM,CAAC,EAAG,EAAG,EAAG,CAAC,EACjB6C,EAAQ,KAAK,QAAQF,CAAG,EAGxBG,EAAKD,EAAM,CAAC,EACZE,EAAKF,EAAM,CAAC,EACZG,EAAKH,EAAM,CAAC,EACZI,EAAKJ,EAAM,CAAC,EACZnB,EAAOmB,EAAM,CAAC,EAGhBnD,EAAIgD,EAAM,CAAC,EAAIlB,EAAI,CAAC,EACpBZ,EAAI8B,EAAMC,EAAM,EAAI,CAAC,EAAInB,EAAI,CAAC,EAC9BT,EAAI2B,EAAM,CAAC,EAAIlB,EAAI,CAAC,EACpB,EAAIkB,EAAMC,EAAM,EAAI,CAAC,EAAInB,EAAI,CAAC,EAC9B0B,EAAS,EACT3D,EAAI4D,EAAIC,EAGZ,QAASnD,EAAI,EAAGA,EAAI2C,EAAc3C,IACjCV,EAAKuD,EAAGpD,IAAM,EAAE,EAAIqD,EAAGnC,GAAK,GAAK,GAAG,EAAIoC,EAAGjC,GAAK,EAAI,GAAG,EAAIkC,EAAG,EAAI,GAAG,EAAIzB,EAAI0B,CAAM,EACnFC,EAAKL,EAAGlC,IAAM,EAAE,EAAImC,EAAGhC,GAAK,GAAK,GAAG,EAAIiC,EAAG,GAAK,EAAI,GAAG,EAAIC,EAAGvD,EAAI,GAAG,EAAI8B,EAAI0B,EAAS,CAAC,EACvFE,EAAKN,EAAG/B,IAAM,EAAE,EAAIgC,EAAG,GAAK,GAAK,GAAG,EAAIC,EAAGtD,GAAK,EAAI,GAAG,EAAIuD,EAAGrC,EAAI,GAAG,EAAIY,EAAI0B,EAAS,CAAC,EACvF,EAAIJ,EAAG,IAAM,EAAE,EAAIC,EAAGrD,GAAK,GAAK,GAAG,EAAIsD,EAAGpC,GAAK,EAAI,GAAG,EAAIqC,EAAGlC,EAAI,GAAG,EAAIS,EAAI0B,EAAS,CAAC,EACtFA,GAAU,EACVxD,EAAIH,EAAIqB,EAAIuC,EAAIpC,EAAIqC,EAIrB,QAASnD,EAAI,EAAGA,EAAI,EAAGA,IACtBD,EAAI2C,EAAM,EAAI,CAAC1C,EAAIA,CAAC,EACnByB,EAAKhC,IAAM,EAAE,GAAK,GAClBgC,EAAKd,GAAK,GAAK,GAAG,GAAK,GACvBc,EAAKX,GAAK,EAAI,GAAG,GAAK,EACtBW,EAAK,EAAI,GAAG,EACZF,EAAI0B,GAAQ,EACb3D,EAAKG,EAAGA,EAAIkB,EAAGA,EAAIG,EAAGA,EAAI,EAAG,EAAIxB,EAGlC,OAAOS,CACR,CACD,EAMA,IAAMqD,GAAS,CAMd,gBAAgBC,EAAY,CAC3B,IAAMlC,EAAQ,IAAI,YAAYkC,EAAW,MAAM,EACzCC,EAAKC,GAAQ,CAClB,IAAIC,EAAM,UACJC,EAAO,WACb,OAAO,UAAY,CAClB,OAAAD,EAAO,OAAUA,EAAM,QAAWA,GAAO,IAASC,EAClDF,EAAO,MAAUA,EAAM,QAAWA,GAAO,IAASE,KAC/BD,GAAO,IAAQD,EAAOE,GAAQ,WAAe,KAC/C,KAAK,OAAO,EAAI,GAAK,EAAI,GAC3C,CACD,EACA,QAASzD,EAAI,EAAG0D,EAAQ1D,EAAIqD,EAAW,OAAQrD,GAAK,EAAG,CACtD,IAAM2D,EAAKL,GAAGI,GAAU,KAAK,OAAO,GAAK,UAAW,EACpDA,EAASC,EAAG,EAAI,UAChBxC,EAAMnB,EAAI,CAAC,EAAK2D,EAAG,EAAI,WAAe,CACvC,CACA,OAAON,CACR,CACD,EAkBMO,GAAO,CAAC,EAMdA,GAAK,WAAa,KAAM,CACvB,YAAYC,EAAKC,EAAI,CACpB,KAAK,KAAOD,EACZ,KAAK,QAAUC,EACf,KAAK,IAAMA,CACZ,CAEA,OAAQ,CACP,KAAK,IAAM,KAAK,OACjB,CAKA,OAAOpD,EAAM,CACZ,OAAO,KAAK,UAAU,KAAK,KAAMA,EAAM,KAAK,GAAG,CAChD,CAEA,QAAQqD,EAAM,CACb,IAAMA,GAAQ,GAAM,OAAU,IAAM,CACnC,IAAIC,EAAMD,GAAQ,GAAM,IACpBb,EAAMa,GAAQ,EAAK,IACnBE,EAAKF,EAAO,IAEZC,IAAO,KACVA,EAAK,EACDd,IAAO,KACVA,EAAK,EACDe,IAAO,IACVA,EAAK,EAEL,EAAEA,GAGH,EAAEf,GAGH,EAAEc,EAGHD,EAAO,EACPA,GAASC,GAAM,GACfD,GAASb,GAAM,EACfa,GAAQE,CACT,MACCF,GAAS,GAAQ,GAElB,OAAOA,CACR,CAEA,WAAWG,EAAS,EACdA,EAAQ,CAAC,EAAI,KAAK,QAAQA,EAAQ,CAAC,CAAC,KAAO,IAE/CA,EAAQ,CAAC,EAAI,KAAK,QAAQA,EAAQ,CAAC,CAAC,EAEtC,CAEA,UAAUL,EAAKnD,EAAMoD,EAAI,CACxB,IAAIpE,EACJ,GAAI,EAAEA,EAAIgB,EAAK,QACd,MAAO,CAAC,EAET,IAAMyD,EAAK/E,GAAS,UAAUsB,CAAI,EAClC,QAASV,EAAI,EAAGA,EAAIN,EAAGM,GAAK,EAAG,CAC9B,KAAK,WAAW8D,CAAE,EAClB,IAAMzC,EAAIwC,EAAI,QAAQC,CAAE,EACxBpD,EAAKV,CAAC,GAAKqB,EAAE,CAAC,EACdX,EAAKV,EAAI,CAAC,GAAKqB,EAAE,CAAC,EAClBX,EAAKV,EAAI,CAAC,GAAKqB,EAAE,CAAC,EAClBX,EAAKV,EAAI,CAAC,GAAKqB,EAAE,CAAC,CACnB,CACA,OAAOjC,GAAS,MAAMsB,EAAMyD,CAAE,CAC/B,CACD,EAEA,IAAMC,GAAO,CACZ,UAAUC,EAAU,CACnB,OAAO,IAAID,GAAK,SAASjE,GAAM,MAAM,OAAOkE,CAAQ,CAAC,CACtD,EACA,OAAOR,EAAKS,EAAMC,EAAOC,EAAQ,CAEhC,GADAD,EAAQA,GAAS,IACbC,EAAS,GAAKD,EAAQ,EACzB,MAAM,IAAI,MAAM,0BAA0B,EAE3C,IAAMlE,GAAemE,GAAU,GAAK,GAAM,EACtCC,EAAGC,EAAI1E,EAAGe,EAAG4D,EACXC,EAAc,IAAI,YAAYvE,CAAU,EACxCN,EAAM,IAAI,SAAS6E,CAAW,EAChCC,EAAY,EACVlE,EAAIvB,GAEV,IADAkF,EAAOnE,GAAM,MAAM,OAAOmE,CAAI,EACzBK,EAAI,EAAGE,GAAaxE,GAAc,GAAIsE,IAAK,CAE/C,IADAF,EAAIC,EAAKb,EAAI,QAAQlD,EAAE,OAAO2D,EAAM,CAACK,CAAC,CAAC,CAAC,EACnC3E,EAAI,EAAGA,EAAIuE,EAAOvE,IAEtB,IADA0E,EAAKb,EAAI,QAAQa,CAAE,EACd3D,EAAI,EAAGA,EAAI2D,EAAG,OAAQ3D,IAC1B0D,EAAE1D,CAAC,GAAK2D,EAAG3D,CAAC,EAGd,IAAKf,EAAI,EAAG6E,GAAaxE,GAAc,IAAML,EAAIyE,EAAE,OAAQzE,IAC1DD,EAAI,SAAS8E,EAAWJ,EAAEzE,CAAC,CAAC,EAC5B6E,GAAa,CAEf,CACA,OAAOD,EAAY,MAAM,EAAGJ,EAAS,CAAC,CACvC,CACD,EAcAJ,GAAK,SAAW,KAAM,CAErB,YAAY7C,EAAK,CAChB,IAAMuD,EAAO,KACPC,EAAOD,EAAK,MAAQtE,GAAK,KACzBwE,EAAQ,CAAC,CAAC,EAAG,CAAC,CAAC,EACrBF,EAAK,UAAY,CAAC,IAAIC,EAAQ,IAAIA,CAAM,EACxC,IAAME,EAAKH,EAAK,UAAU,CAAC,EAAE,UAAY,GAErCvD,EAAI,OAAS0D,IAChB1D,EAAM,IAAIwD,EAAK,EAAE,OAAOxD,CAAG,EAAE,SAAS,GAGvC,QAASvB,EAAI,EAAGA,EAAIiF,EAAIjF,IACvBgF,EAAM,CAAC,EAAEhF,CAAC,EAAIuB,EAAIvB,CAAC,EAAI,UACvBgF,EAAM,CAAC,EAAEhF,CAAC,EAAIuB,EAAIvB,CAAC,EAAI,WAGxB8E,EAAK,UAAU,CAAC,EAAE,OAAOE,EAAM,CAAC,CAAC,EACjCF,EAAK,UAAU,CAAC,EAAE,OAAOE,EAAM,CAAC,CAAC,EACjCF,EAAK,YAAc,IAAIC,EAAKD,EAAK,UAAU,CAAC,CAAC,CAC9C,CACA,OAAQ,CACP,IAAMA,EAAO,KACbA,EAAK,YAAc,IAAIA,EAAK,MAAMA,EAAK,UAAU,CAAC,CAAC,EACnDA,EAAK,SAAW,EACjB,CAEA,OAAOpE,EAAM,CACZ,IAAMoE,EAAO,KACbA,EAAK,SAAW,GAChBA,EAAK,YAAY,OAAOpE,CAAI,CAC7B,CAEA,QAAS,CACR,IAAMoE,EAAO,KACP1D,EAAI0D,EAAK,YAAY,SAAS,EAC9BI,EAAS,IAAKJ,EAAK,MAAOA,EAAK,UAAU,CAAC,CAAC,EAAE,OAAO1D,CAAC,EAAE,SAAS,EAEtE,OAAA0D,EAAK,MAAM,EAEJI,CACR,CAEA,QAAQxE,EAAM,CACb,GAAK,KAAK,SAIT,MAAM,IAAI,MAAM,yCAAyC,EAHzD,YAAK,OAAOA,CAAI,EACT,KAAK,OAAOA,CAAI,CAIzB,CACD,EChxBA,IAAMyE,GAA8B,OAAO,OAAU,KAAe,OAAO,OAAO,iBAAmB,WAE/FC,GAAuB,mBACvBC,GAAwB,oBACxBC,GAA2B,6BASjC,SAASC,GAAgBC,EAAO,CAC/B,OAAIC,GACI,OAAO,gBAAgBD,CAAK,EAE5BE,GAAO,gBAAgBF,CAAK,CAErC,CCRA,IAAMG,GAAe,GACfC,GAAa,MACbC,GAAmB,CAAE,KAAM,QAAS,EACpCC,GAAiB,CAAE,KAAM,MAAO,EAChCC,GAAgB,QAChBC,GAAqB,OAAO,OAAO,CAAE,KAAMF,EAAe,EAAGD,EAAgB,EAC7EI,GAAyB,OAAO,OAAO,CAAE,WAAY,IAAM,KAAM,CAAE,KAAMF,EAAc,CAAE,EAAGF,EAAgB,EAC5GK,GAAqB,CAAC,YAAY,EAClCC,GAAc,CAAC,EAAG,GAAI,EAAE,EACxBC,GAAa,CAAC,GAAI,GAAI,EAAE,EACxBC,GAAmB,GACnBC,GAAwB,CAAC,EAAG,EAAG,EAAG,CAAC,EACnCC,GAAiB,YACjBC,GAAgB,WAEhBC,GAAuB,OAAO,QAAUF,GACxCG,GAASD,IAAwB,OAAO,OACxCE,GAAuBF,IAAwB,OAAOC,IAAUH,GAChEK,GAAaC,GAAM,MACnBC,GAAMC,GAAO,IACbC,GAAaC,GAAK,WAClBC,GAAWC,GAAK,SAElBC,GAAuBX,IAAwBE,IAAwB,OAAOD,GAAO,WAAaF,GAClGa,GAAwBZ,IAAwBE,IAAwB,OAAOD,GAAO,YAAcF,GAElGc,GAAN,cAAkC,eAAgB,CAEjD,YAAY,CAAE,SAAAC,EAAU,OAAAC,EAAQ,mBAAAC,EAAoB,kBAAAC,CAAkB,EAAG,CACxE,MAAM,CACL,OAAQ,CACP,OAAO,OAAO,KAAM,CACnB,MAAO,IAAI,QAAQC,GAAW,KAAK,aAAeA,CAAO,EACzD,SAAAJ,EACA,OAAAC,EACA,SAAUC,EAAqB,EAC/B,QAAS,IAAI,UACd,CAAC,CACF,EACA,MAAM,UAAUG,EAAOC,EAAY,CAClC,IAAMC,EAAY,KACZ,CACL,SAAAP,EACA,SAAAQ,EACA,aAAAC,EACA,MAAAC,CACD,EAAIH,EACAP,GACH,MAAMW,GAAqBJ,EAAWC,EAAUR,EAAUY,GAASP,EAAO,EAAGzB,GAAY4B,CAAQ,EAAI,CAAC,CAAC,EACvGH,EAAQO,GAASP,EAAOzB,GAAY4B,CAAQ,EAAI,CAAC,EAC7CL,EACHG,EAAW,MAAM,IAAI,MAAMO,EAAwB,CAAC,EAEpDJ,EAAa,GAGd,MAAMC,EAEP,IAAMI,EAAS,IAAI,WAAWT,EAAM,OAASvB,IAAqBuB,EAAM,OAASvB,IAAoBV,EAAa,EAClHkC,EAAW,QAAQS,GAAOR,EAAWF,EAAOS,EAAQ,EAAGhC,GAAkB,EAAI,CAAC,CAC/E,EACA,MAAM,MAAMwB,EAAY,CACvB,GAAM,CACL,OAAAL,EACA,IAAAe,EACA,KAAAC,EACA,QAAAC,EACA,MAAAR,CACD,EAAI,KACJ,MAAMA,EACN,IAAMS,EAAiBP,GAASM,EAAS,EAAGA,EAAQ,OAASpC,EAAgB,EACvEsC,EAAoBR,GAASM,EAASA,EAAQ,OAASpC,EAAgB,EACzEuC,EAAsB,IAAI,WAC9B,GAAIF,EAAe,OAAQ,CAC1B,IAAMG,EAAiBC,GAAOlC,GAAY8B,CAAc,EACxDF,EAAK,OAAOK,CAAc,EAC1B,IAAME,EAAiBR,EAAI,OAAOM,CAAc,EAChDD,EAAsBI,GAASpC,GAAYmC,CAAc,CAC1D,CACA,GAAIvB,EAAQ,CACX,IAAMyB,EAAYd,GAASa,GAASpC,GAAY4B,EAAK,OAAO,CAAC,EAAG,EAAGnC,EAAgB,EACnF,QAAS6C,EAAiB,EAAGA,EAAiB7C,GAAkB6C,IAC/D,GAAID,EAAUC,CAAc,GAAKP,EAAkBO,CAAc,EAChE,MAAM,IAAI,MAAMC,EAAqB,CAGxC,CACAtB,EAAW,QAAQe,CAAmB,CACvC,CACD,CAAC,CACF,CACD,EAEMQ,GAAN,cAAkC,eAAgB,CAEjD,YAAY,CAAE,SAAA7B,EAAU,mBAAAE,CAAmB,EAAG,CAE7C,IAAI4B,EACJ,MAAM,CACL,OAAQ,CACP,OAAO,OAAO,KAAM,CACnB,MAAO,IAAI,QAAQ1B,GAAW,KAAK,aAAeA,CAAO,EACzD,SAAAJ,EACA,SAAUE,EAAqB,EAC/B,QAAS,IAAI,UACd,CAAC,CACF,EACA,MAAM,UAAUG,EAAOC,EAAY,CAClC,IAAMC,EAAY,KACZ,CACL,SAAAP,EACA,SAAAQ,EACA,aAAAC,EACA,MAAAC,CACD,EAAIH,EACAwB,EAAW,IAAI,WACf/B,GACH+B,EAAW,MAAMC,GAAqBzB,EAAWC,EAAUR,CAAQ,EACnES,EAAa,GAEb,MAAMC,EAEP,IAAMI,EAAS,IAAI,WAAWiB,EAAS,OAAS1B,EAAM,OAAUA,EAAM,OAASjC,EAAa,EAC5F0C,EAAO,IAAIiB,EAAU,CAAC,EACtBzB,EAAW,QAAQS,GAAOR,EAAWF,EAAOS,EAAQiB,EAAS,OAAQ,CAAC,CAAC,CACxE,EACA,MAAM,MAAMzB,EAAY,CACvB,GAAM,CACL,IAAAU,EACA,KAAAC,EACA,QAAAC,EACA,MAAAR,CACD,EAAI,KACJ,MAAMA,EACN,IAAIuB,EAAsB,IAAI,WAC9B,GAAIf,EAAQ,OAAQ,CACnB,IAAMI,EAAiBN,EAAI,OAAOO,GAAOlC,GAAY6B,CAAO,CAAC,EAC7DD,EAAK,OAAOK,CAAc,EAC1BW,EAAsBR,GAASpC,GAAYiC,CAAc,CAC1D,CACAQ,EAAO,UAAYL,GAASpC,GAAY4B,EAAK,OAAO,CAAC,EAAE,MAAM,EAAGnC,EAAgB,EAChFwB,EAAW,QAAQ4B,GAAOD,EAAqBH,EAAO,SAAS,CAAC,CACjE,CACD,CAAC,EACDA,EAAS,IACV,CACD,EAQA,SAASK,GAAOC,EAAWC,EAAOC,EAAQC,EAAcC,EAAYC,EAAiB,CACpF,GAAM,CACL,IAAAC,EACA,KAAAC,EACA,QAAAC,CACD,EAAIR,EACES,EAAcR,EAAM,OAASG,EAC/BI,EAAQ,SACXP,EAAQS,GAAOF,EAASP,CAAK,EAC7BC,EAASS,GAAOT,EAAQO,EAAeA,EAAcG,EAAa,GAEnE,IAAIC,EACJ,IAAKA,EAAS,EAAGA,GAAUJ,EAAcG,GAAcC,GAAUD,GAAc,CAC9E,IAAME,EAAaC,GAAOC,GAAYC,GAAShB,EAAOY,EAAQA,EAASD,EAAY,CAAC,EAChFP,GACHE,EAAK,OAAOO,CAAU,EAEvB,IAAMI,EAAcZ,EAAI,OAAOQ,CAAU,EACpCT,GACJE,EAAK,OAAOW,CAAW,EAExBhB,EAAO,IAAIiB,GAASH,GAAYE,CAAW,EAAGL,EAASV,CAAY,CACpE,CACA,OAAAH,EAAU,QAAUiB,GAAShB,EAAOY,CAAM,EACnCX,CACR,CAEA,eAAekB,GAAqBC,EAASC,EAAUC,EAAUC,EAAU,CAC1E,IAAMC,EAA0B,MAAMC,GAAWL,EAASC,EAAUC,EAAUN,GAASO,EAAU,EAAGG,GAAYL,CAAQ,CAAC,CAAC,EACpHM,EAAuBX,GAASO,EAAUG,GAAYL,CAAQ,CAAC,EACrE,GAAIG,EAAwB,CAAC,GAAKG,EAAqB,CAAC,GAAKH,EAAwB,CAAC,GAAKG,EAAqB,CAAC,EAChH,MAAM,IAAI,MAAMC,EAAoB,CAEtC,CAEA,eAAeC,GAAqBC,EAAST,EAAUC,EAAU,CAChE,IAAMS,EAAOC,GAAgB,IAAI,WAAWN,GAAYL,CAAQ,CAAC,CAAC,EAC5DM,EAAuB,MAAMF,GAAWK,EAAST,EAAUC,EAAUS,CAAI,EAC/E,OAAOtB,GAAOsB,EAAMJ,CAAoB,CACzC,CAEA,eAAeF,GAAW1B,EAAWsB,EAAUC,EAAUS,EAAM,CAC9DhC,EAAU,SAAW,KACrB,IAAMkC,EAAkBC,GAAWZ,CAAQ,EACrCa,EAAU,MAAMC,GAAUC,GAAYJ,EAAiBK,GAAoB,GAAOC,EAAkB,EACpGC,EAAc,MAAMC,GAAW,OAAO,OAAO,CAAE,KAAAV,CAAK,EAAGW,EAAsB,EAAGP,EAAS,GAAMQ,GAAWtB,CAAQ,EAAI,EAAK,EAAE,EAC7HuB,EAAe,IAAI,WAAWJ,CAAW,EACzCK,EAAM/B,GAAOC,GAAYC,GAAS4B,EAAc,EAAGD,GAAWtB,CAAQ,CAAC,CAAC,EACxEyB,EAAiBhC,GAAOC,GAAYC,GAAS4B,EAAcD,GAAWtB,CAAQ,EAAGsB,GAAWtB,CAAQ,EAAI,CAAC,CAAC,EAC1GM,EAAuBX,GAAS4B,EAAcD,GAAWtB,CAAQ,EAAI,CAAC,EAC5E,cAAO,OAAOtB,EAAW,CACxB,KAAM,CACL,IAAA8C,EACA,eAAAC,EACA,qBAAAnB,CACD,EACA,IAAK,IAAIoB,GAAW,IAAIC,GAAIH,CAAG,EAAG,MAAM,KAAKI,EAAqB,CAAC,EACnE,KAAM,IAAIC,GAASJ,CAAc,CAClC,CAAC,EACMnB,CACR,CAEA,eAAeS,GAAUe,EAAQ7B,EAAU8B,EAAWC,EAAaC,EAAW,CAC7E,GAAIC,GACH,GAAI,CACH,OAAO,MAAMC,GAAO,UAAUL,EAAQ7B,EAAU8B,EAAWC,EAAaC,CAAS,CAClF,MAAiB,CAChB,OAAAC,GAAuB,GAChBE,GAAK,UAAUnC,CAAQ,CAC/B,KAEA,QAAOmC,GAAK,UAAUnC,CAAQ,CAEhC,CAEA,eAAemB,GAAWW,EAAWjB,EAASuB,EAAQ,CACrD,GAAIC,GACH,GAAI,CACH,OAAO,MAAMH,GAAO,WAAWJ,EAAWjB,EAASuB,CAAM,CAC1D,MAAiB,CAChB,OAAAC,GAAwB,GACjBF,GAAK,OAAOtB,EAASiB,EAAU,KAAMV,GAAuB,WAAYgB,CAAM,CACtF,KAEA,QAAOD,GAAK,OAAOtB,EAASiB,EAAU,KAAMV,GAAuB,WAAYgB,CAAM,CAEvF,CAEA,SAASjD,GAAOmD,EAAWC,EAAY,CACtC,IAAIC,EAAQF,EACZ,OAAIA,EAAU,OAASC,EAAW,SACjCC,EAAQ,IAAI,WAAWF,EAAU,OAASC,EAAW,MAAM,EAC3DC,EAAM,IAAIF,EAAW,CAAC,EACtBE,EAAM,IAAID,EAAYD,EAAU,MAAM,GAEhCE,CACR,CAEA,SAASpD,GAAOqD,EAAYL,EAAQ,CACnC,GAAIA,GAAUA,EAASK,EAAW,OAAQ,CACzC,IAAMD,EAAQC,EACdA,EAAa,IAAI,WAAWL,CAAM,EAClCK,EAAW,IAAID,EAAO,CAAC,CACxB,CACA,OAAOC,CACR,CAEA,SAAS/C,GAAS8C,EAAOE,EAAOC,EAAK,CACpC,OAAOH,EAAM,SAASE,EAAOC,CAAG,CACjC,CAEA,SAAS/C,GAASH,EAAYmD,EAAO,CACpC,OAAOnD,EAAW,SAASmD,CAAK,CACjC,CACA,SAASpD,GAAOC,EAAYmD,EAAO,CAClC,OAAOnD,EAAW,OAAOmD,CAAK,CAC/B,CCrRA,IAAMC,GAAgB,GAEhBC,GAAN,cAAwC,eAAgB,CAEvD,YAAY,CAAE,SAAAC,EAAU,qBAAAC,EAAsB,kBAAAC,CAAkB,EAAG,CAClE,MAAM,CACL,OAAQ,CACP,OAAO,OAAO,KAAM,CACnB,SAAAF,EACA,qBAAAC,CACD,CAAC,EACDE,GAAW,KAAMH,CAAQ,CAC1B,EACA,UAAUI,EAAOC,EAAY,CAC5B,IAAMC,EAAY,KAClB,GAAIA,EAAU,SAAU,CACvB,IAAMC,EAAkBC,GAAQF,EAAWF,EAAM,SAAS,EAAGN,EAAa,CAAC,EAE3E,GADAQ,EAAU,SAAW,KACjBC,EAAgBT,GAAgB,CAAC,GAAKQ,EAAU,qBACnD,MAAM,IAAI,MAAMG,EAAoB,EAErCL,EAAQA,EAAM,SAASN,EAAa,CACrC,CACII,EACHG,EAAW,MAAM,IAAI,MAAMK,EAAwB,CAAC,EAEpDL,EAAW,QAAQG,GAAQF,EAAWF,CAAK,CAAC,CAE9C,CACD,CAAC,CACF,CACD,EAEMO,GAAN,cAAwC,eAAgB,CAEvD,YAAY,CAAE,SAAAX,EAAU,qBAAAC,CAAqB,EAAG,CAC/C,MAAM,CACL,OAAQ,CACP,OAAO,OAAO,KAAM,CACnB,SAAAD,EACA,qBAAAC,CACD,CAAC,EACDE,GAAW,KAAMH,CAAQ,CAC1B,EACA,UAAUI,EAAOC,EAAY,CAC5B,IAAMC,EAAY,KACdM,EACAC,EACJ,GAAIP,EAAU,SAAU,CACvBA,EAAU,SAAW,KACrB,IAAMQ,EAASC,GAAgB,IAAI,WAAWjB,EAAa,CAAC,EAC5DgB,EAAOhB,GAAgB,CAAC,EAAIQ,EAAU,qBACtCM,EAAS,IAAI,WAAWR,EAAM,OAASU,EAAO,MAAM,EACpDF,EAAO,IAAII,GAAQV,EAAWQ,CAAM,EAAG,CAAC,EACxCD,EAASf,EACV,MACCc,EAAS,IAAI,WAAWR,EAAM,MAAM,EACpCS,EAAS,EAEVD,EAAO,IAAII,GAAQV,EAAWF,CAAK,EAAGS,CAAM,EAC5CR,EAAW,QAAQO,CAAM,CAC1B,CACD,CAAC,CACF,CACD,EAQA,SAASK,GAAQC,EAAQC,EAAO,CAC/B,IAAMC,EAAS,IAAI,WAAWD,EAAM,MAAM,EAC1C,QAASE,EAAQ,EAAGA,EAAQF,EAAM,OAAQE,IACzCD,EAAOC,CAAK,EAAIC,GAAQJ,CAAM,EAAIC,EAAME,CAAK,EAC7CE,GAAWL,EAAQE,EAAOC,CAAK,CAAC,EAEjC,OAAOD,CACR,CAEA,SAASI,GAAQN,EAAQC,EAAO,CAC/B,IAAMC,EAAS,IAAI,WAAWD,EAAM,MAAM,EAC1C,QAASE,EAAQ,EAAGA,EAAQF,EAAM,OAAQE,IACzCD,EAAOC,CAAK,EAAIC,GAAQJ,CAAM,EAAIC,EAAME,CAAK,EAC7CE,GAAWL,EAAQC,EAAME,CAAK,CAAC,EAEhC,OAAOD,CACR,CAEA,SAASK,GAAWP,EAAQQ,EAAU,CACrC,IAAMC,EAAO,CAAC,UAAY,UAAY,SAAU,EAChD,OAAO,OAAOT,EAAQ,CACrB,KAAAS,EACA,QAAS,IAAIC,GAAMD,EAAK,CAAC,CAAC,EAC1B,QAAS,IAAIC,GAAMD,EAAK,CAAC,CAAC,CAC3B,CAAC,EACD,QAASN,EAAQ,EAAGA,EAAQK,EAAS,OAAQL,IAC5CE,GAAWL,EAAQQ,EAAS,WAAWL,CAAK,CAAC,CAE/C,CAEA,SAASE,GAAWL,EAAQW,EAAM,CACjC,GAAI,CAACC,EAAMC,EAAMC,CAAI,EAAId,EAAO,KAChCA,EAAO,QAAQ,OAAO,CAACW,CAAI,CAAC,EAC5BC,EAAO,CAACZ,EAAO,QAAQ,IAAI,EAC3Ba,EAAOE,GAAS,KAAK,KAAKA,GAASF,EAAOG,GAAQJ,CAAI,CAAC,EAAG,SAAS,EAAI,CAAC,EACxEZ,EAAO,QAAQ,OAAO,CAACa,IAAS,EAAE,CAAC,EACnCC,EAAO,CAACd,EAAO,QAAQ,IAAI,EAC3BA,EAAO,KAAO,CAACY,EAAMC,EAAMC,CAAI,CAChC,CAEA,SAASV,GAAQJ,EAAQ,CACxB,IAAMiB,EAAOjB,EAAO,KAAK,CAAC,EAAI,EAC9B,OAAOgB,GAAQ,KAAK,KAAKC,EAAOA,EAAO,CAAE,IAAM,CAAC,CACjD,CAEA,SAASD,GAAQE,EAAQ,CACxB,OAAOA,EAAS,GACjB,CAEA,SAASH,GAASG,EAAQ,CACzB,OAAOA,EAAS,UACjB,CCnHA,IAAMC,GAAqB,cAErBC,GAAN,cAA4B,eAAgB,CAE3C,YAAYC,EAAS,CAAE,UAAAC,EAAW,kBAAAC,EAAmB,wBAAAC,CAAwB,EAAG,CAC/E,MAAM,CAAC,CAAC,EACR,GAAM,CAAE,WAAAC,EAAY,UAAAC,EAAW,qBAAAC,EAAsB,UAAAC,EAAW,OAAAC,EAAQ,MAAAC,CAAM,EAAIT,EAC5EU,EAAS,KACXC,EAAaC,EACbC,EAAWC,GAAkB,MAAM,QAAQ,GAC1C,CAACT,GAAaE,IAAcC,IAChCG,EAAc,IAAII,GAClBF,EAAWG,GAAYH,EAAUF,CAAW,GAEzCP,IACHS,EAAWI,GAA8BJ,EAAUP,EAAsB,CAAE,MAAAG,EAAO,UAAAR,CAAU,EAAGE,EAAyBD,CAAiB,GAEtIG,IACCE,EACHM,EAAWG,GAAYH,EAAU,IAAIK,GAA0BlB,CAAO,CAAC,GAEvEY,EAAmB,IAAIO,GAAoBnB,CAAO,EAClDa,EAAWG,GAAYH,EAAUD,CAAgB,IAGnDQ,GAAYV,EAAQG,EAAU,SAAY,CACzC,IAAIQ,EACAhB,GAAa,CAACE,IACjBc,EAAYT,EAAiB,YAEzB,CAACP,GAAaE,IAAcC,IAChCa,EAAY,IAAI,SAASV,EAAY,MAAM,MAAM,EAAE,UAAU,CAAC,GAE/DD,EAAO,UAAYW,CACpB,CAAC,CACF,CACD,EAEMC,GAAN,cAA4B,eAAgB,CAE3C,YAAYtB,EAAS,CAAE,UAAAC,EAAW,oBAAAsB,EAAqB,0BAAAC,CAA0B,EAAG,CACnF,MAAM,CAAC,CAAC,EACR,GAAM,CAAE,UAAAjB,EAAW,UAAAF,EAAW,OAAAG,EAAQ,UAAAa,EAAW,WAAAjB,EAAY,qBAAAE,CAAqB,EAAIN,EAClFW,EAAac,EACbZ,EAAWC,GAAkB,MAAM,QAAQ,EAC3CT,IACCE,EACHM,EAAWG,GAAYH,EAAU,IAAIa,GAA0B1B,CAAO,CAAC,GAEvEyB,EAAmB,IAAIE,GAAoB3B,CAAO,EAClDa,EAAWG,GAAYH,EAAUY,CAAgB,IAG/CrB,IACHS,EAAWI,GAA8BJ,EAAUP,EAAsB,CAAE,UAAAL,CAAU,EAAGuB,EAA2BD,CAAmB,IAElI,CAAClB,GAAaE,IAAcC,IAChCG,EAAc,IAAII,GAClBF,EAAWG,GAAYH,EAAUF,CAAW,GAE7CS,GAAY,KAAMP,EAAU,SAAY,CACvC,IAAK,CAACR,GAAaE,IAAcC,EAAQ,CACxC,IAAMoB,EAAoB,IAAI,SAASjB,EAAY,MAAM,MAAM,EAC/D,GAAIU,GAAaO,EAAkB,UAAU,EAAG,EAAK,EACpD,MAAM,IAAI,MAAMC,EAAqB,CAEvC,CACD,CAAC,CACF,CACD,EAUA,SAASC,GAAkBC,EAAU,CACpC,OAAOC,GAAYD,EAAU,IAAI,gBAAgB,CAChD,UAAUE,EAAOC,EAAY,CACxBD,GAASA,EAAM,QAClBC,EAAW,QAAQD,CAAK,CAE1B,CACD,CAAC,CAAC,CACH,CAEA,SAASE,GAAYC,EAAQL,EAAUM,EAAO,CAC7CN,EAAWC,GAAYD,EAAU,IAAI,gBAAgB,CAAE,MAAAM,CAAM,CAAC,CAAC,EAC/D,OAAO,eAAeD,EAAQ,WAAY,CACzC,KAAM,CACL,OAAOL,CACR,CACD,CAAC,CACF,CAEA,SAASO,GAA8BP,EAAUQ,EAAsBC,EAASC,EAAmBC,EAAa,CAC/G,GAAI,CACH,IAAMC,EAAoBJ,GAAwBE,EAAoBA,EAAoBC,EAC1FX,EAAWC,GAAYD,EAAU,IAAIY,EAAkBC,GAAoBJ,CAAO,CAAC,CACpF,OAASK,EAAO,CACf,GAAIN,EACHR,EAAWC,GAAYD,EAAU,IAAIW,EAAYE,GAAoBJ,CAAO,CAAC,MAE7E,OAAMK,CAER,CACA,OAAOd,CACR,CAEA,SAASC,GAAYD,EAAUe,EAAiB,CAC/C,OAAOf,EAAS,YAAYe,CAAe,CAC5C,CClHA,IAAMC,GAAqB,UACrBC,GAAgB,QAChBC,GAAe,OACfC,GAAe,OACfC,GAAmB,MACnBC,GAAgB,QAChBC,GAAgB,UAChBC,GAAgB,UAiBtB,IAAMC,GAAN,cAA0B,eAAgB,CAEzC,YAAYC,EAASC,EAAQ,CAC5B,MAAM,CAAC,CAAC,EACR,IAAMC,EAAQ,KACR,CAAE,UAAAC,CAAU,EAAIH,EAClBI,EACAD,EAAU,WAAWE,EAAa,EACrCD,EAASE,GACCH,EAAU,WAAWI,EAAa,IAC5CH,EAASI,IAEV,IAAIC,EAAO,EACLC,EAAS,IAAIN,EAAOJ,EAASC,CAAM,EACnCU,EAAW,MAAM,SACjBC,EAAkB,IAAI,gBAAgB,CAC3C,UAAUC,EAAOC,EAAY,CACxBD,GAASA,EAAM,SAClBJ,GAAQI,EAAM,OACdC,EAAW,QAAQD,CAAK,EAE1B,EACA,OAAQ,CACP,GAAM,CAAE,UAAAE,CAAU,EAAIL,EACtB,OAAO,OAAOR,EAAO,CACpB,UAAAa,EACA,KAAAN,CACD,CAAC,CACF,CACD,CAAC,EACD,OAAO,eAAeP,EAAO,WAAY,CACxC,KAAM,CACL,OAAOS,EAAS,YAAYD,CAAM,EAAE,YAAYE,CAAe,CAChE,CACD,CAAC,CACF,CACD,EC7DA,IAAMI,GAAwB,OAAO,QAAUC,GAM/C,IAAMC,GAAN,KAAkB,CAEjB,YAAYC,EAAY,CAAE,SAAAC,EAAU,SAAAC,CAAS,EAAG,CAAE,QAAAC,EAAS,OAAAC,EAAQ,cAAAC,EAAe,cAAAC,EAAe,gBAAAC,EAAiB,QAAAC,CAAQ,EAAGC,EAAgB,CAC5I,GAAM,CAAE,OAAAC,CAAO,EAAIL,EACnB,cAAO,OAAOL,EAAY,CACzB,KAAM,GACN,SAAUC,EAAS,YAAY,IAAIU,GAAsBV,EAAUI,EAAeD,CAAM,EAAG,CAAE,OAAAM,CAAO,CAAC,EACrG,SAAAR,EACA,QAAS,OAAO,OAAO,CAAC,EAAGC,CAAO,EAClC,QAAAK,EACA,gBAAAD,EACA,WAAY,CACX,GAAM,CAAE,OAAAK,EAAQ,KAAAC,CAAK,EAAIb,EACrBY,GAAU,CAACC,IACdD,EAAO,UAAU,EACjBZ,EAAW,UAAY,KAEzB,EACA,gBAAiB,CAChBA,EAAW,KAAO,GAClBS,EAAeT,CAAU,CAC1B,CACD,CAAC,GACOM,GAAiBQ,GAAwBC,GAA2BC,IAAuBhB,EAAYI,CAAM,CACtH,CACD,EAEMO,GAAN,cAAoC,eAAgB,CAEnD,YAAYM,EAAgB,CAAE,QAAAC,EAAS,WAAAC,EAAY,KAAAC,EAAM,MAAAC,CAAM,EAAG,CAAE,UAAAC,CAAU,EAAG,CAChF,IAAIC,EAAc,EAClB,MAAM,CACL,OAAQ,CACHL,GACHM,GAAYN,EAASE,CAAI,CAE3B,EACA,MAAM,UAAUK,EAAOC,EAAY,CAClCH,GAAeE,EAAM,OACjBN,GACH,MAAMK,GAAYL,EAAYI,EAAaH,CAAI,EAEhDM,EAAW,QAAQD,CAAK,CACzB,EACA,OAAQ,CACPR,EAAe,KAAOM,EAClBF,GACHG,GAAYH,EAAOE,CAAW,CAEhC,CACD,EAAG,CAAE,cAAe,EAAG,KAAM,IAAMD,CAAU,CAAC,CAC/C,CACD,EAEA,eAAeE,GAAYG,KAAYC,EAAY,CAClD,GAAI,CACH,MAAMD,EAAQ,GAAGC,CAAU,CAC5B,MAAiB,CAEjB,CACD,CAEA,SAASZ,GAAsBhB,EAAYI,EAAQ,CAClD,MAAO,CACN,IAAK,IAAMyB,GAAU7B,EAAYI,CAAM,CACxC,CACD,CAEA,SAASW,GAAyBf,EAAY,CAAE,QAAA8B,EAAS,UAAAR,CAAU,EAAG,CACrE,OAAKtB,EAAW,WACf,OAAO,OAAOA,EAAY,CACzB,OAAQ+B,GAAa/B,EAAW,QAAQ,CAAC,EAAG8B,EAAS9B,CAAU,EAC/D,UAAW,CACV,IAAK,IAAMgC,GAAahC,EAAY,CAAE,UAAAsB,CAAU,CAAC,CAClD,CACD,CAAC,EAEKtB,EAAW,SACnB,CAEA,eAAe6B,GAAU,CAAE,QAAA1B,EAAS,SAAAF,EAAU,SAAAC,EAAU,eAAAO,CAAe,EAAGL,EAAQ,CACjF,IAAM6B,EAAc,IAAIC,GAAY/B,EAASC,CAAM,EACnD,GAAI,CACH,MAAMH,EAAS,YAAYgC,CAAW,EAAE,OAAO/B,EAAU,CAAE,aAAc,GAAM,aAAc,EAAK,CAAC,EACnG,GAAM,CACL,UAAAiC,EACA,KAAAf,CACD,EAAIa,EACJ,MAAO,CACN,UAAAE,EACA,KAAAf,CACD,CACD,QAAE,CACDX,EAAe,CAChB,CACD,CAEA,eAAeuB,GAAahC,EAAYI,EAAQ,CAC/C,IAAIgC,EAAeC,EACbC,EAAS,IAAI,QAAQ,CAACC,EAASC,IAAW,CAC/CJ,EAAgBG,EAChBF,EAAeG,CAChB,CAAC,EACD,OAAO,OAAOxC,EAAY,CACzB,OAAQ,KACR,OAAQ,KACR,cAAAoC,EACA,aAAAC,EACA,OAAAC,CACD,CAAC,EACD,GAAM,CAAE,SAAArC,EAAU,QAAAE,EAAS,QAAAK,CAAQ,EAAIR,EACjC,CAAE,SAAAE,EAAU,OAAAuC,CAAO,EAAIC,GAAkB1C,EAAW,QAAQ,EACvC2C,GAAY,CACtC,KAAMC,GACN,QAASpC,EAAQ,MAAM,CAAC,EACxB,QAAAL,EACA,OAAAC,EACA,SAAAH,EACA,SAAAC,CACD,EAAGF,CAAU,GAEZ,OAAO,OAAOA,EAAY,CACzB,OAAQC,EAAS,UAAU,EAC3B,OAAQC,EAAS,UAAU,CAC5B,CAAC,EAEF,IAAM2C,EAAc,MAAMP,EAC1B,GAAI,CACH,MAAMpC,EAAS,UAAU,EAAE,MAAM,CAClC,MAAiB,CAEjB,CACA,aAAMuC,EACCI,CACR,CAEA,SAASH,GAAkBI,EAAgB,CAC1C,IAAMC,EAASD,EAAe,UAAU,EACpCE,EACEP,EAAS,IAAI,QAAQF,GAAWS,EAAsBT,CAAO,EAcnE,MAAO,CAAE,SAbQ,IAAI,eAAe,CACnC,MAAM,MAAMd,EAAO,CAClB,MAAMsB,EAAO,MACb,MAAMA,EAAO,MAAMtB,CAAK,CACzB,EACA,OAAQ,CACPsB,EAAO,YAAY,EACnBC,EAAoB,CACrB,EACA,MAAMC,EAAQ,CACb,OAAOF,EAAO,MAAME,CAAM,CAC3B,CACD,CAAC,EACkB,OAAAR,CAAO,CAC3B,CAEA,IAAIS,GAA0B,GAC1BC,GAA2B,GAE/B,SAASpB,GAAaqB,EAAKtB,EAAS9B,EAAY,CAC/C,IAAMqD,EAAgB,CAAE,KAAM,QAAS,EACnCC,EAAW1C,EAEX,OAAOwC,GAAOG,KACjBH,EAAMA,EAAI,GAEX,GAAI,CACHE,EAAY,IAAI,IAAIF,EAAKtB,CAAO,CACjC,MAAiB,CAChBwB,EAAYF,CACb,CACA,GAAIF,GACH,GAAI,CACHtC,EAAS,IAAI,OAAO0C,CAAS,CAC9B,MAAiB,CAChBJ,GAA0B,GAC1BtC,EAAS,IAAI,OAAO0C,EAAWD,CAAa,CAC7C,MAEAzC,EAAS,IAAI,OAAO0C,EAAWD,CAAa,EAE7C,OAAAzC,EAAO,iBAAiB4C,GAAoBC,GAASC,GAAUD,EAAOzD,CAAU,CAAC,EAC1EY,CACR,CAEA,SAAS+B,GAAYgB,EAAS,CAAE,OAAA/C,EAAQ,OAAAmC,EAAQ,eAAAtC,EAAgB,gBAAAF,CAAgB,EAAG,CAClF,GAAI,CACH,GAAI,CAAE,MAAAqD,EAAO,SAAA3D,EAAU,SAAAC,CAAS,EAAIyD,EAC9BE,EAAgB,CAAC,EAevB,GAdID,IACHD,EAAQ,MAAQC,EAAM,OACtBC,EAAc,KAAKF,EAAQ,KAAK,GAE7BpD,GAAmB4C,IAClBlD,GACH4D,EAAc,KAAK5D,CAAQ,EAExBC,GACH2D,EAAc,KAAK3D,CAAQ,GAG5ByD,EAAQ,SAAWA,EAAQ,SAAW,KAEnCE,EAAc,OACjB,GAAI,CACH,OAAAjD,EAAO,YAAY+C,EAASE,CAAa,EAClC,EACR,MAAiB,CAChBV,GAA2B,GAC3BQ,EAAQ,SAAWA,EAAQ,SAAW,KACtC/C,EAAO,YAAY+C,CAAO,CAC3B,MAEA/C,EAAO,YAAY+C,CAAO,CAE5B,OAASG,EAAO,CACf,MAAIf,GACHA,EAAO,YAAY,EAEpBtC,EAAe,EACTqD,CACP,CACD,CAEA,eAAeJ,GAAU,CAAE,KAAAK,CAAK,EAAG/D,EAAY,CAC9C,GAAM,CAAE,KAAAgE,EAAM,MAAAJ,EAAO,UAAAK,EAAW,OAAA3B,EAAQ,MAAAwB,CAAM,EAAIC,EAC5C,CAAE,OAAAG,EAAQ,OAAAnB,EAAQ,cAAAX,EAAe,aAAAC,EAAc,eAAA5B,CAAe,EAAIT,EACxE,GAAI,CACH,GAAI8D,EAAO,CACV,GAAM,CAAE,QAAAH,EAAS,MAAAQ,EAAO,KAAAC,EAAM,KAAAC,CAAK,EAAIP,EACjCQ,EAAgB,IAAI,MAAMX,CAAO,EACvC,OAAO,OAAOW,EAAe,CAAE,MAAAH,EAAO,KAAAC,EAAM,KAAAC,CAAK,CAAC,EAClDE,EAAMD,CAAa,CACpB,KAAO,CACN,GAAIN,GAAQQ,GAAc,CACzB,GAAM,CAAE,MAAAZ,EAAO,KAAAa,CAAK,EAAI,MAAMP,EAAO,KAAK,EAC1CvB,GAAY,CAAE,KAAM+B,GAAc,MAAAd,EAAO,KAAAa,EAAM,UAAAR,CAAU,EAAGjE,CAAU,CACvE,CACIgE,GAAQU,KACX,MAAM3B,EAAO,MACb,MAAMA,EAAO,MAAM,IAAI,WAAWa,CAAK,CAAC,EACxCjB,GAAY,CAAE,KAAMgC,GAAkB,UAAAV,CAAU,EAAGjE,CAAU,GAE1DgE,GAAQY,IACXL,EAAM,KAAMjC,CAAM,CAEpB,CACD,OAASwB,EAAO,CACfS,EAAMT,CAAK,CACZ,CAEA,SAASS,EAAMT,EAAOxB,EAAQ,CACzBwB,EACHzB,EAAayB,CAAK,EAElB1B,EAAcE,CAAM,EAEjBS,GACHA,EAAO,YAAY,EAEpBtC,EAAe,CAChB,CACD,CCjRA,IAAIoE,GAAO,CAAC,EACNC,GAAkB,CAAC,EAYzB,IAAIC,GAAc,EAElB,eAAeC,GAAUC,EAAQC,EAAe,CAC/C,GAAM,CAAE,QAAAC,EAAS,OAAAC,CAAO,EAAIF,EACtB,CAAE,gBAAAG,EAAiB,cAAAC,EAAe,qBAAAC,EAAsB,UAAAC,EAAW,WAAAC,EAAY,OAAAC,EAAQ,UAAAC,CAAU,EAAIR,EACrG,CAAE,cAAAS,EAAe,WAAAC,EAAY,uBAAAC,CAAuB,EAAIV,EAC9DF,EAAc,gBAAkBG,GAAmBA,IAAoBU,GACvE,IAAMC,EAAa,CAACP,GAAc,CAACC,GAAU,CAACC,GAAa,CAACT,EAAc,gBAC1EA,EAAc,cAAgB,CAACc,IAAeV,GAAkBA,IAAkBS,IAAmBX,EAAO,eAC5GF,EAAc,QAAUA,EAAc,eAAiBU,EAAgBA,EAAcJ,CAAS,EAAI,CAAC,EACnGL,EAAQ,qBAAuBI,GAAyBA,IAAyBQ,IAAmBX,EAAO,qBAC3G,IAAIa,EACEC,EAAaC,GAAK,KAAKD,GAAc,CAACA,EAAW,IAAI,EAC3D,GAAIA,EACHE,GAAsBF,CAAU,EAChCD,EAAS,IAAII,GAAYH,EAAYjB,EAAQC,EAAeoB,CAAc,UAChEH,GAAK,OAASN,EAAY,CACpC,IAAMK,EAAa,CAAE,YAAAnB,EAAY,EACjCA,KACAoB,GAAK,KAAKD,CAAU,EACpBD,EAAS,IAAII,GAAYH,EAAYjB,EAAQC,EAAeoB,CAAc,CAC3E,MACCL,EAAS,MAAM,IAAI,QAAQM,GAAWC,GAAgB,KAAK,CAAE,QAAAD,EAAS,OAAAtB,EAAQ,cAAAC,CAAc,CAAC,CAAC,EAE/F,OAAOe,EAAO,IAAI,EAElB,SAASK,EAAeJ,EAAY,CACnC,GAAIM,GAAgB,OAAQ,CAC3B,GAAM,CAAC,CAAE,QAAAD,EAAS,OAAAtB,EAAQ,cAAAC,CAAc,CAAC,EAAIsB,GAAgB,OAAO,EAAG,CAAC,EACxED,EAAQ,IAAIF,GAAYH,EAAYjB,EAAQC,EAAeoB,CAAc,CAAC,CAC3E,MAAWJ,EAAW,QACrBE,GAAsBF,CAAU,EAC5B,OAAO,SAASJ,CAAsB,GAAKA,GAA0B,IACxEI,EAAW,iBAAmB,WAAW,IAAM,CAC9CC,GAAOA,GAAK,OAAOM,GAAQA,GAAQP,CAAU,EAC7CA,EAAW,UAAU,CACtB,EAAGJ,CAAsB,IAG1BK,GAAOA,GAAK,OAAOM,GAAQA,GAAQP,CAAU,CAE/C,CACD,CAEA,SAASE,GAAsBF,EAAY,CAC1C,GAAM,CAAE,iBAAAQ,CAAiB,EAAIR,EACzBQ,IACH,aAAaA,CAAgB,EAC7BR,EAAW,iBAAmB,KAEhC,CCvGA,SAASS,GAAEA,EAAE,CAAC,IAAMC,EAAE,IAAI,IAAI,gBAAgB,IAAI,KAAK,CAAC;AAAA,CAAwn3C,EAAE,CAAC,KAAK,iBAAiB,CAAC,CAAC,EAAED,EAAE,CAAC,cAAc,CAAC,QAAQ,CAACC,CAAC,EAAE,QAAQ,CAACA,CAAC,CAAC,CAAC,CAAC,CAAC,CCuCzv3C,IAAMC,GAAkC,qCAOxC,IAAMC,GAA2B,eAIjC,IAAMC,GAAqB,GAAK,KAE1BC,GAAyB,WAEzBC,GAAN,KAAa,CAEZ,aAAc,CACb,KAAK,KAAO,CACb,CAEA,MAAO,CACN,KAAK,YAAc,EACpB,CACD,EAEMC,GAAN,cAAqBD,EAAO,CAE3B,IAAI,UAAW,CACd,IAAME,EAAS,KACT,CAAE,UAAAC,EAAYL,EAAmB,EAAII,EACrCE,EAAW,IAAI,eAAe,CACnC,OAAQ,CACP,KAAK,YAAc,CACpB,EACA,MAAM,KAAKC,EAAY,CACtB,GAAM,CAAE,OAAAC,EAAS,EAAG,KAAAC,EAAM,gBAAAC,CAAgB,EAAIJ,EACxC,CAAE,YAAAK,CAAY,EAAI,KACxBJ,EAAW,QAAQ,MAAMK,GAAeR,EAAQI,EAASG,EAAa,KAAK,IAAIN,EAAWI,EAAOE,CAAW,EAAGD,CAAe,CAAC,EAC3HC,EAAcN,EAAYI,EAC7BF,EAAW,MAAM,EAEjB,KAAK,aAAeF,CAEtB,CACD,CAAC,EACD,OAAOC,CACR,CACD,EA0FA,IAAMO,GAAN,cAAyBC,EAAO,CAE/B,YAAYC,EAAM,CACjB,MAAM,EACN,OAAO,OAAO,KAAM,CACnB,KAAAA,EACA,KAAMA,EAAK,IACZ,CAAC,CACF,CAEA,MAAM,eAAeC,EAAQC,EAAQ,CACpC,IAAMC,EAAS,KACTC,EAAYH,EAASC,EAEvBG,EAAc,MADLJ,GAAUG,EAAYD,EAAO,KAAOA,EAAO,KAAK,MAAMF,EAAQG,CAAS,EAAID,EAAO,MAClE,YAAY,EACzC,OAAIE,EAAY,WAAaH,IAC5BG,EAAcA,EAAY,MAAMJ,EAAQG,CAAS,GAE3C,IAAI,WAAWC,CAAW,CAClC,CACD,EAEMC,GAAN,cAAyBC,EAAO,CAE/B,YAAYC,EAAa,CACxB,MAAM,EACN,IAAMC,EAAS,KACTC,EAAkB,IAAI,gBACtBC,EAAU,CAAC,EACbH,GACHG,EAAQ,KAAK,CAACC,GAA0BJ,CAAW,CAAC,EAErD,OAAO,eAAeC,EAAQI,GAAwB,CACrD,KAAM,CACL,OAAOH,EAAgB,QACxB,CACD,CAAC,EACDD,EAAO,KAAO,IAAI,SAASC,EAAgB,SAAU,CAAE,QAAAC,CAAQ,CAAC,EAAE,KAAK,CACxE,CAEA,SAAU,CACT,OAAO,KAAK,IACb,CACD,EAwTA,IAAMG,GAAN,cAA8BC,EAAO,CAEpC,YAAYC,EAAS,CACpB,MAAM,EACN,KAAK,QAAUA,CAChB,CAEA,MAAM,MAAO,CACZ,IAAMC,EAAS,KACT,CAAE,QAAAD,CAAQ,EAAIC,EACpBA,EAAO,eAAiB,EACxBA,EAAO,eAAiB,EACxB,MAAM,QAAQ,IAAID,EAAQ,IAAI,MAAOE,EAAYC,IAAoB,CACpE,MAAMD,EAAW,KAAK,EAClBC,GAAmBH,EAAQ,OAAS,IACvCC,EAAO,gBAAkBC,EAAW,MAErCD,EAAO,MAAQC,EAAW,IAC3B,CAAC,CAAC,EACF,MAAM,KAAK,CACZ,CAEA,MAAM,eAAeE,EAAQC,EAAQC,EAAa,EAAG,CACpD,IAAML,EAAS,KACT,CAAE,QAAAD,CAAQ,EAAI,KAChBO,EACAC,EAAoBF,EACpBE,GAAqB,KACxBA,EAAoBR,EAAQ,OAAS,GAEtC,IAAIS,EAAsBL,EAC1B,KAAOK,GAAuBT,EAAQQ,CAAiB,EAAE,MACxDC,GAAuBT,EAAQQ,CAAiB,EAAE,KAClDA,IAED,IAAME,EAAgBV,EAAQQ,CAAiB,EACzCG,EAAoBD,EAAc,KACxC,GAAID,EAAsBJ,GAAUM,EACnCJ,EAAS,MAAMK,GAAeF,EAAeD,EAAqBJ,CAAM,MAClE,CACN,IAAMQ,EAAcF,EAAoBF,EACxCF,EAAS,IAAI,WAAWF,CAAM,EAC9BE,EAAO,IAAI,MAAMK,GAAeF,EAAeD,EAAqBI,CAAW,CAAC,EAChFN,EAAO,IAAI,MAAMN,EAAO,eAAeG,EAASS,EAAaR,EAASQ,EAAaP,CAAU,EAAGO,CAAW,CAC5G,CACA,OAAAZ,EAAO,eAAiB,KAAK,IAAIO,EAAmBP,EAAO,cAAc,EAClEM,CACR,CACD,EAEMO,GAAN,cAA8BC,EAAO,CAEpC,YAAYC,EAAiBC,EAAU,WAAY,CAClD,MAAM,EACN,IAAMC,EAAY,KAClB,OAAO,OAAOA,EAAW,CACxB,WAAY,EACZ,WAAY,EACZ,KAAM,EACN,QAAAD,EACA,cAAeA,CAChB,CAAC,EACD,IAAIE,EAAkBC,EAAcC,EAC9BC,EAAW,IAAI,eAAe,CACnC,MAAM,MAAMC,EAAO,CAClB,GAAM,CAAE,cAAAC,CAAc,EAAIN,EAC1B,GAAKG,EAgBME,EAAM,QAAUC,GAC1B,MAAMC,EAAWF,EAAM,MAAM,EAAGC,CAAa,CAAC,EAC9C,MAAME,EAAU,EAChBR,EAAU,YAAcC,EAAiB,KACzCD,EAAU,aACVG,EAAa,KACb,MAAM,KAAK,MAAME,EAAM,MAAMC,CAAa,CAAC,GAE3C,MAAMC,EAAWF,CAAK,MAxBN,CAChB,GAAM,CAAE,MAAAI,EAAO,KAAAC,CAAK,EAAI,MAAMZ,EAAgB,KAAK,EACnD,GAAIY,GAAQ,CAACD,EACZ,MAAM,IAAI,MAAME,EAA+B,EAE/CV,EAAmBQ,EACnBR,EAAiB,KAAO,EACpBA,EAAiB,UACpBD,EAAU,QAAUC,EAAiB,SAEtCD,EAAU,cAAgBA,EAAU,QACpC,MAAMY,GAAWX,CAAgB,EACjCC,EAAeO,EAAM,SACrBN,EAAaD,EAAa,UAAU,EAErC,MAAM,KAAK,MAAMG,CAAK,CACvB,CAUD,EACA,MAAM,OAAQ,CACb,MAAMF,EAAW,MACjB,MAAMK,EAAU,CACjB,CACD,CAAC,EACD,OAAO,eAAeR,EAAWa,GAAwB,CACxD,KAAM,CACL,OAAOT,CACR,CACD,CAAC,EAED,eAAeG,EAAWF,EAAO,CAChC,IAAMV,EAAcU,EAAM,OACtBV,IACH,MAAMQ,EAAW,MACjB,MAAMA,EAAW,MAAME,CAAK,EAC5BJ,EAAiB,MAAQN,EACzBK,EAAU,MAAQL,EAClBK,EAAU,eAAiBL,EAE7B,CAEA,eAAea,GAAY,CAC1BN,EAAa,KAAOD,EAAiB,KACrC,MAAME,EAAW,MAAM,CACxB,CACD,CACD,EAQA,eAAeW,GAAWC,EAAQC,EAAU,CACvCD,EAAO,MAAQ,CAACA,EAAO,aAC1B,MAAMA,EAAO,KAAKC,CAAQ,CAE5B,CAEA,SAASC,GAAWC,EAAQ,CAC3B,OAAI,MAAM,QAAQA,CAAM,IACvBA,EAAS,IAAIC,GAAgBD,CAAM,GAEhCA,aAAkB,iBACrBA,EAAS,CACR,SAAUA,CACX,GAEMA,CACR,CAEA,SAASE,GAAWC,EAAQ,CACvBA,EAAO,WAAaC,IAAmB,OAAOD,EAAO,MAAQE,KAChEF,EAAS,IAAIG,GAAgBH,CAAM,GAEhCA,aAAkB,iBACrBA,EAAS,CACR,SAAUA,CACX,GAED,GAAM,CAAE,SAAAI,CAAS,EAAIJ,EACrB,OAAII,EAAS,OAASH,KACrBG,EAAS,KAAO,GAEIJ,aAAkBG,IAEtC,OAAO,OAAOH,EAAQ,CACrB,WAAY,EACZ,WAAY,EACZ,cAAe,IACf,QAAS,GACV,CAAC,EAEKA,CACR,CAEA,SAASK,GAAeR,EAAQS,EAAQC,EAAMC,EAAY,CACzD,OAAOX,EAAO,eAAeS,EAAQC,EAAMC,CAAU,CACtD,CCnqBA,IAAMC,GAAQ,q7BAAsQ,MAAM,EAAE,EACtRC,GAAcD,GAAM,QAAU,IAMpC,SAASE,GAAYC,EAAa,CACjC,GAAIC,GAAa,CAChB,IAAIC,EAAS,GACb,QAASC,EAAiB,EAAGA,EAAiBH,EAAY,OAAQG,IACjED,GAAUE,GAAMJ,EAAYG,CAAc,CAAC,EAE5C,OAAOD,CACR,KACC,QAAO,IAAI,YAAY,EAAE,OAAOF,CAAW,CAE7C,CCXA,SAASK,GAAWC,EAAOC,EAAU,CACpC,OAAIA,GAAYA,EAAS,KAAK,EAAE,YAAY,GAAK,QACzCC,GAAYF,CAAK,EAEjB,IAAI,YAAYC,CAAQ,EAAE,OAAOD,CAAK,CAE/C,CCdA,IAAMG,GAAyB,WACzBC,GAA6B,cAC7BC,GAAwB,UACxBC,GAA4B,aAC5BC,GAAmC,mBACnCC,GAAiC,iBACjCC,GAAuB,SACvBC,GAAkC,kBAClCC,GAAuC,cACvCC,GAA2C,iBAC3CC,GAAiC,iBACjCC,GAAqC,oBACrCC,GAA8B,eAC9BC,GAAkC,kBAClCC,GAAwC,wBACxCC,GAAwC,wBACxCC,GAAkC,kBAClCC,GAAsB,QAEtBC,GAAiB,CACtBlB,GAAwBC,GAA4BI,GAAgCD,GACpFI,GAAsCC,GAA0CP,GAAuBC,GACvGO,GAAgCE,GAA6BN,GAAsBC,GACnFA,GAAiCO,GAAuCC,GACxEC,GAAiCC,GACjC,YAAa,UAAW,YAAa,YAAa,eAAgB,cAAe,oBAAqB,UAAW,gBACjH,aAAc,gBAAiB,kBAAmB,wBAAyB,2BAA4B,gBAAiB,iBACxH,6BAA6B,EAExBE,GAAN,KAAY,CAEX,YAAYC,EAAM,CACjBF,GAAe,QAAQG,GAAQ,KAAKA,CAAI,EAAID,EAAKC,CAAI,CAAC,CACvD,CAED,ECoCA,IAAMC,GAAiB,gCACjBC,GAAsB,qCACtBC,GAA4B,2CAC5BC,GAAoC,mDACpCC,GAAkC,qCAClCC,GAAkC,8BAClCC,GAAiC,8BACjCC,GAAgB,gCAChBC,GAA6B,kCAC7BC,GAA8B,mCAC9BC,GAAqB,iBACrBC,GAAe,QACfC,GAAgB,QAChBC,GAAmB,CACxB,CAACC,GAAkC,UAAW,EAC9C,CAACC,GAAgC,UAAW,EAC5C,CAACC,GAAsB,UAAW,EAClC,CAACC,GAAiC,KAAW,CAC9C,EACMC,GAAmB,CACxB,CAAC,KAAW,EAAG,CACd,SAAUC,GACV,MAAO,CACR,EACA,CAAC,UAAW,EAAG,CACd,SAAUC,GACV,MAAO,CACR,CACD,EAEMC,GAAN,KAAgB,CAEf,YAAYC,EAAQC,EAAU,CAAC,EAAG,CACjC,OAAO,OAAO,KAAM,CACnB,OAAQC,GAAWF,CAAM,EACzB,QAAAC,EACA,OAAQE,GAAiB,CAC1B,CAAC,CACF,CAEA,MAAO,oBAAoBF,EAAU,CAAC,EAAG,CACxC,IAAMG,EAAY,KACd,CAAE,OAAAJ,CAAO,EAAII,EACX,CAAE,OAAAC,CAAO,EAAID,EAMnB,GALA,MAAME,GAAWN,CAAM,GACnBA,EAAO,OAASO,IAAmB,CAACP,EAAO,kBAC9CA,EAAS,IAAIQ,GAAW,MAAM,IAAI,SAASR,EAAO,QAAQ,EAAE,KAAK,CAAC,EAClE,MAAMM,GAAWN,CAAM,GAEpBA,EAAO,KAAO,GACjB,MAAM,IAAI,MAAMtB,EAAc,EAE/BsB,EAAO,UAAYS,GAAaJ,CAAM,EACtC,IAAMK,EAAqB,MAAMC,GAAcX,EAAQ,UAA8BA,EAAO,KAAM,GAA2B,MAAc,EAAE,EAC7I,GAAI,CAACU,EAAoB,CACxB,IAAME,EAAiB,MAAMC,GAAeb,EAAQ,EAAG,CAAC,EAClDc,EAAgBC,GAAYH,CAAc,EAChD,MAAIf,GAAUiB,CAAa,GAAK,UACzB,IAAI,MAAM1B,EAAkB,EAE5B,IAAI,MAAMT,EAAmB,CAErC,CACA,IAAMqC,EAAqBD,GAAYL,CAAkB,EACrDO,EAAsBpB,GAAUmB,EAAoB,EAAE,EACtDE,EAAsBrB,GAAUmB,EAAoB,EAAE,EACpDG,EAAgBT,EAAmB,OACnCU,EAAgBC,GAAUL,EAAoB,EAAE,EAChDM,EAAqBH,EAAgB,GAA4BC,EACnEG,EAAiBF,GAAUL,EAAoB,CAAC,EAC9CQ,EAAyBxB,EAAO,gBAAkB,EACpDyB,EAAaJ,GAAUL,EAAoB,CAAC,EAC5CU,EAAcL,GAAUL,EAAoB,CAAC,EAC7CW,EAAsB,EACtBC,EAAc,EAClB,GAAIV,GAAuB,YAAeD,GAAuB,YAAeS,GAAe,OAAeD,GAAc,MAAa,CACxI,IAAMI,EAA6B,MAAMhB,GAAeb,EAAQU,EAAmB,OAAS,GAAyC,EAAuC,EACtKoB,EAA4Bf,GAAYc,CAA0B,EACxE,GAAIhC,GAAUiC,EAA2B,CAAC,GAAK,UAC9C,MAAM,IAAI,MAAMlD,EAAyB,EAE1CsC,EAAsBpB,GAAagC,EAA2B,CAAC,EAC/D,IAAIC,EAAsB,MAAMlB,GAAeb,EAAQkB,EAAqB,GAAiC,EAAE,EAC3GF,EAAqBD,GAAYgB,CAAmB,EAClDC,EAA8BtB,EAAmB,OAAS,GAA0C,GAC1G,GAAIb,GAAUmB,EAAoB,CAAC,GAAK,WAAsCE,GAAuBc,EAA6B,CACjI,IAAMC,EAA8Bf,EACpCA,EAAsBc,EACtBL,EAAsBT,EAAsBe,EAC5CF,EAAsB,MAAMlB,GAAeb,EAAQkB,EAAqB,GAAiC,EAAE,EAC3GF,EAAqBD,GAAYgB,CAAmB,CACrD,CACA,GAAIlC,GAAUmB,EAAoB,CAAC,GAAK,UACvC,MAAM,IAAI,MAAMnC,EAAiC,EAE9C0C,GAAkB,QACrBA,EAAiB1B,GAAUmB,EAAoB,EAAE,GAE9CS,GAAc,QACjBA,EAAa5B,GAAUmB,EAAoB,EAAE,GAE1CU,GAAe,QAClBA,EAAc5B,GAAakB,EAAoB,EAAE,GAE9CC,GAAuB,aAC1BA,EAAsBnB,GAAakB,EAAoB,EAAE,GAE1DE,GAAuBD,CACxB,CACA,GAAIO,GAA0BD,EAC7B,MAAM,IAAI,MAAMnC,EAAkB,EAEnC,GAAI8B,EAAsB,GAAKA,GAAuBlB,EAAO,KAC5D,MAAM,IAAI,MAAMtB,EAAc,EAE/B,IAAIwD,EAAS,EACTC,EAAiB,MAAMtB,GAAeb,EAAQkB,EAAqBD,EAAqBQ,CAAU,EAClGW,EAAgBrB,GAAYoB,CAAc,EAC9C,GAAIlB,EAAqB,CACxB,IAAMe,EAA8BtB,EAAmB,OAASO,EAChE,GAAIpB,GAAUuC,EAAeF,CAAM,GAAK,UAAiChB,GAAuBc,EAA6B,CAC5H,IAAMC,EAA8Bf,EACpCA,EAAsBc,EACtBL,EAAsBT,EAAsBe,EAC5CE,EAAiB,MAAMtB,GAAeb,EAAQkB,EAAqBD,EAAqBQ,CAAU,EAClGW,EAAgBrB,GAAYoB,CAAc,CAC3C,CACD,CACA,IAAME,EAA8B3B,EAAmB,OAASQ,GAAuBlB,EAAO,gBAAkB,GAMhH,GALIiB,GAAuBoB,GAA+BA,GAA+B,IACxFpB,EAAsBoB,EACtBF,EAAiB,MAAMtB,GAAeb,EAAQkB,EAAqBD,EAAqBQ,CAAU,EAClGW,EAAgBrB,GAAYoB,CAAc,GAEvCjB,EAAsB,GAAKA,GAAuBlB,EAAO,KAC5D,MAAM,IAAI,MAAMtB,EAAc,EAE/B,IAAM4D,EAAmBC,GAAenC,EAAWH,EAAS,kBAAkB,EACxEuC,EAAkBD,GAAenC,EAAWH,EAAS,iBAAiB,EAC5E,QAASwC,EAAY,EAAGA,EAAYf,EAAae,IAAa,CAC7D,IAAMC,EAAY,IAAIC,GAAS3C,EAAQK,EAAQD,EAAU,OAAO,EAChE,GAAIP,GAAUuC,EAAeF,CAAM,GAAK,SACvC,MAAM,IAAI,MAAMpD,EAA+B,EAEhD8D,GAAiBF,EAAWN,EAAeF,EAAS,CAAC,EACrD,IAAMW,EAAuB,EAAQH,EAAU,QAAQ,qBACjDI,EAAiBZ,EAAS,GAC1Ba,EAAmBD,EAAiBJ,EAAU,eAC9CvB,EAAgB4B,EAAmBL,EAAU,iBAC7CM,EAAgB3B,GAAUe,EAAeF,EAAS,CAAC,EACnDe,GAAmBD,EAAgB,IAAM,EACzCE,EAAcf,EAAe,SAASW,EAAgBC,CAAgB,EACtE3B,EAAgBC,GAAUe,EAAeF,EAAS,EAAE,EACpDiB,EAAYhC,EAAgBC,EAC5BgC,EAAajB,EAAe,SAAShB,EAAegC,CAAS,EAC7DE,EAAeR,EACfS,EAAcT,EACdU,GAAYN,IAAqBO,GAASpB,EAAeF,EAAS,EAAE,EAAI,KAA6B,GACrGuB,GAAkB5D,GAAUuC,EAAeF,EAAS,EAAE,EAAIP,EAChE,OAAO,OAAOe,EAAW,CACxB,cAAAM,EACA,gBAAAC,EACA,eAAgB,EAChB,iBAAkB,EAClB,cAAA7B,EACA,UAAAmC,GACA,OAAQE,GACR,gBAAiBpC,GAAUe,EAAeF,EAAS,EAAE,EACrD,sBAAuBb,GAAUe,EAAeF,EAAS,EAAE,EAC3D,sBAAuBrC,GAAUuC,EAAeF,EAAS,EAAE,EAC3D,YAAAgB,EACA,aAAAG,EACA,YAAAC,EACA,cAAenB,EAAe,SAASY,EAAkB5B,CAAa,CACvE,CAAC,EACD,GAAM,CAACuC,GAAUC,EAAO,EAAI,MAAM,QAAQ,IAAI,CAC7CC,GAAWV,EAAaG,EAAehE,GAAeiD,GAAoBhD,EAAa,EACvFsE,GAAWR,EAAYE,EAAcjE,GAAemD,GAAmBlD,EAAa,CACrF,CAAC,EACD,OAAO,OAAOoD,EAAW,CACxB,WAAAU,EACA,SAAAM,GACA,QAAAC,GACA,UAAWJ,IAAaG,GAAS,SAASG,EAAmB,CAC9D,CAAC,EACDjC,EAAc,KAAK,IAAI6B,GAAiB7B,CAAW,EACnD,MAAMkC,GAAiBpB,EAAWA,EAAWN,EAAeF,EAAS,CAAC,EACtE,IAAM6B,GAAQ,IAAIC,GAAMtB,CAAS,EACjCqB,GAAM,QAAU,CAACE,GAAQhE,KAAYyC,EAAU,QAAQuB,GAAQF,GAAO9D,EAAO,EAC7EiC,EAASiB,EACT,GAAM,CAAE,WAAAe,EAAW,EAAIjE,EACvB,GAAIiE,GACH,GAAI,CACH,MAAMA,GAAWzB,EAAY,EAAGf,EAAa,IAAIsC,GAAMtB,CAAS,CAAC,CAClE,MAAiB,CAEjB,CAED,MAAMqB,EACP,CACA,IAAMI,EAAuB5B,GAAenC,EAAWH,EAAS,sBAAsB,EAChFmE,EAAsB7B,GAAenC,EAAWH,EAAS,qBAAqB,EACpF,OAAIkE,IACH/D,EAAU,cAAgBwB,EAAc,EAAI,MAAMf,GAAeb,EAAQ,EAAG4B,CAAW,EAAI,IAAI,YAEhGxB,EAAU,QAAUgB,EAAgB,MAAMP,GAAeb,EAAQmB,EAAgB,GAA2BC,CAAa,EAAI,IAAI,WAC7HgD,IACHhE,EAAU,aAAekB,EAAqBtB,EAAO,KAAO,MAAMa,GAAeb,EAAQsB,EAAoBtB,EAAO,KAAOsB,CAAkB,EAAI,IAAI,YAE/I,EACR,CAEA,MAAM,WAAWrB,EAAU,CAAC,EAAG,CAC9B,IAAMoE,EAAU,CAAC,EACjB,cAAiBN,KAAS,KAAK,oBAAoB9D,CAAO,EACzDoE,EAAQ,KAAKN,CAAK,EAEnB,OAAOM,CACR,CAEA,MAAM,OAAQ,CACd,CACD,EAmBA,IAAMC,GAAN,KAAe,CAEd,YAAYC,EAAQC,EAAQC,EAAS,CACpC,OAAO,OAAO,KAAM,CACnB,OAAAF,EACA,OAAAC,EACA,QAAAC,CACD,CAAC,CACF,CAEA,MAAM,QAAQC,EAAQC,EAAWF,EAAU,CAAC,EAAG,CAC9C,IAAMG,EAAW,KACX,CACL,OAAAL,EACA,OAAAM,EACA,gBAAAC,EACA,cAAAC,EACA,kBAAAC,EACA,OAAAR,EACA,QAAAS,EACA,UAAAC,EACA,eAAAC,EACA,iBAAAC,EACA,eAAAC,CACD,EAAIT,EACEU,EAAiBV,EAAS,eAAiB,CAAC,EAC5CW,EAAY,MAAMC,GAAejB,EAAQM,EAAQ,GAAIC,CAAe,EACpEW,EAAWC,GAAYH,CAAS,EAClCI,EAAWC,GAAehB,EAAUH,EAAS,UAAU,EAE3D,GADAkB,EAAWA,GAAYA,EAAS,QAAUA,EACtCZ,GACCA,EAAc,2BAA6B,GAC9C,MAAM,IAAI,MAAMc,EAA2B,EAG7C,GAAIb,GAAqB,GAA4BA,GAAqB,EACzE,MAAM,IAAI,MAAMa,EAA2B,EAE5C,GAAIC,GAAUL,EAAU,CAAC,GAAK,SAC7B,MAAM,IAAI,MAAMM,EAA+B,EAEhDC,GAAiBV,EAAgBG,EAAU,CAAC,EAC5CH,EAAe,cAAgBA,EAAe,iBAC7C,MAAME,GAAejB,EAAQM,EAAS,GAAKS,EAAe,eAAgBA,EAAe,iBAAkBR,CAAe,EAC1H,IAAI,WACL,MAAMmB,GAAiBrB,EAAUU,EAAgBG,EAAU,EAAG,EAAI,EAClE,OAAO,OAAOd,EAAW,CACxB,eAAgBW,EAAe,eAC/B,aAAcA,EAAe,YAC9B,CAAC,EACD,IAAMY,EAAYtB,EAAS,WAAaU,EAAe,UACjDa,EAAYD,GAAa,CAACnB,EAChC,GAAImB,EAAW,CACd,GAAI,CAACC,GAAapB,EAAc,WAAaqB,GAC5C,MAAM,IAAI,MAAMC,EAA0B,EACpC,GAAI,CAACV,EACX,MAAM,IAAI,MAAMW,EAAa,CAE/B,CACA,IAAMC,EAAa1B,EAAS,GAAKS,EAAe,eAAiBA,EAAe,iBAC1EkB,EAAOnB,EACPoB,EAAWlC,EAAO,SACxB,OAAO,OAAOkC,EAAU,CACvB,gBAAA3B,EACA,OAAQyB,EACR,KAAAC,CACD,CAAC,EACD,IAAME,EAASd,GAAehB,EAAUH,EAAS,QAAQ,EACnDkC,EAAoBf,GAAehB,EAAUH,EAAS,mBAAmB,EAC3EkC,IACHjC,EAAS,IAAI,gBAEdA,EAASkC,GAAWlC,CAAM,EAC1B,MAAMmC,GAAWnC,EAAQU,CAAgB,EACzC,GAAM,CAAE,SAAA0B,CAAS,EAAIpC,EACf,CAAE,QAAAqC,EAAS,WAAAC,EAAY,MAAAC,CAAM,EAAIxC,EACjCyC,EAAgB,CACrB,QAAS,CACR,UAAWC,GACX,SAAAxB,EACA,UAAAQ,EACA,mBAAoBpB,GAAiBA,EAAc,SACnD,OAAQa,GAAehB,EAAUH,EAAS,gBAAgB,EAC1D,qBAAsB0B,IAAclB,EAAQ,eAAmBE,IAAmB,EAAK,IAAUD,IAAc,GAAM,KACrH,UAAAA,EACA,WAAYF,GAAqB,EACjC,UAAAkB,EACA,cAAeN,GAAehB,EAAUH,EAAS,eAAe,EAChE,qBAAsBmB,GAAehB,EAAUH,EAAS,sBAAsB,EAC9E,gBAAiBmB,GAAehB,EAAUH,EAAS,iBAAiB,EACpE,kBAAAkC,CACD,EACA,OAAAnC,EACA,cAAe,CAAE,OAAAkC,EAAQ,KAAAF,EAAM,QAAAO,EAAS,WAAAC,EAAY,MAAAC,CAAM,CAC3D,EACIG,EAAa,EACjB,GAAI,EACF,CAAE,WAAAA,CAAW,EAAK,MAAMC,GAAU,CAAE,SAAAZ,EAAU,SAAAK,CAAS,EAAGI,CAAa,EACzE,OAASI,EAAO,CACf,GAAI,CAACX,GAAqBW,EAAM,SAAWC,GAC1C,MAAMD,CAER,QAAE,CACD,IAAME,EAAe5B,GAAehB,EAAUH,EAAS,cAAc,EACrEqC,EAAS,MAAQM,EACb,CAACI,GAAgB,CAACV,EAAS,QAC9B,MAAMA,EAAS,UAAU,EAAE,MAAM,CAEnC,CACA,OAAOH,EAAoB,OAAYjC,EAAO,QAAUA,EAAO,QAAQ,EAAIoC,CAC5E,CACD,EAEA,SAASd,GAAiByB,EAAWhC,EAAUZ,EAAQ,CACtD,IAAM6C,EAAaD,EAAU,WAAaE,GAAUlC,EAAUZ,EAAS,CAAC,EAClEqB,GAAawB,EAAa,IAAsB,EAChDvC,EAAiBW,GAAUL,EAAUZ,EAAS,CAAC,EACrD,OAAO,OAAO4C,EAAW,CACxB,UAAAvB,EACA,QAASyB,GAAUlC,EAAUZ,CAAM,EACnC,QAAS,CACR,OAAQ6C,EAAa,IAAkB,EACvC,gBAAiBA,EAAa,IAA4B,EAC1D,sBAAuBA,EAAa,OAA+B,IACpE,EACA,eAAAvC,EACA,YAAayC,GAAQzC,CAAc,EACnC,eAAgBwC,GAAUlC,EAAUZ,EAAS,EAAE,EAC/C,iBAAkB8C,GAAUlC,EAAUZ,EAAS,EAAE,CAClD,CAAC,CACF,CAEA,eAAeoB,GAAiBtB,EAAW8C,EAAWhC,EAAUZ,EAAQS,EAAgB,CACvF,GAAM,CAAE,cAAAuC,CAAc,EAAIJ,EACpBK,EAAaL,EAAU,WAAa,IAAI,IACxCM,EAAoBrC,GAAY,IAAI,WAAWmC,CAAa,CAAC,EAC/DG,EAAmB,EACvB,GAAI,CACH,KAAOA,EAAmBH,EAAc,QAAQ,CAC/C,IAAMI,EAAON,GAAUI,EAAmBC,CAAgB,EACpDxB,EAAOmB,GAAUI,EAAmBC,EAAmB,CAAC,EAC9DF,EAAW,IAAIG,EAAM,CACpB,KAAAA,EACA,KAAMJ,EAAc,MAAMG,EAAmB,EAAGA,EAAmB,EAAIxB,CAAI,CAC5E,CAAC,EACDwB,GAAoB,EAAIxB,CACzB,CACD,MAAiB,CAEjB,CACA,IAAMxB,EAAoB2C,GAAUlC,EAAUZ,EAAS,CAAC,EACxD,OAAO,OAAO4C,EAAW,CACxB,UAAW3B,GAAUL,EAAUZ,EAAS,EAAE,EAC1C,iBAAkBiB,GAAUL,EAAUZ,EAAS,EAAE,EACjD,eAAgBiB,GAAUL,EAAUZ,EAAS,EAAE,CAChD,CAAC,EACD,IAAMqD,EAAkBJ,EAAW,IAAI,CAAqB,EACxDI,IACHC,GAAoBD,EAAiBT,CAAS,EAC9CA,EAAU,gBAAkBS,GAE7B,IAAME,EAAwBN,EAAW,IAAI,KAA4B,EACrEM,IACH,MAAMC,GAAsBD,EAAuBE,GAAwBC,GAA4Bd,EAAW9C,CAAS,EAC3H8C,EAAU,sBAAwBW,GAEnC,IAAMI,EAA2BV,EAAW,IAAI,KAA+B,EAC3EU,IACH,MAAMH,GAAsBG,EAA0BC,GAAuBC,GAA2BjB,EAAW9C,CAAS,EAC5H8C,EAAU,yBAA2Be,GAEtC,IAAMzD,EAAgB+C,EAAW,IAAI,KAAmB,EACpD/C,GACH4D,GAAkB5D,EAAe0C,EAAWzC,CAAiB,EAC7DyC,EAAU,cAAgB1C,GAE1B0C,EAAU,kBAAoBzC,EAE/B,IAAM4D,EAAiBd,EAAW,IAAI,EAAoB,EACtDc,IACHC,GAAmBD,EAAgBnB,CAAS,EAC5CA,EAAU,eAAiBmB,GAE5B,IAAME,EAA8BhB,EAAW,IAAI,KAAkC,EACjFgB,IACHC,GAAgCD,EAA6BrB,EAAWnC,CAAc,EACtFmC,EAAU,4BAA8BqB,EAE1C,CAEA,SAASX,GAAoBD,EAAiBT,EAAW,CACxDA,EAAU,MAAQ,GAClB,IAAMuB,EAAiBtD,GAAYwC,EAAgB,IAAI,EACjDe,EAAoBC,GAAiB,OAAO,CAAC,CAACC,EAAcC,CAAG,IAAM3B,EAAU0B,CAAY,GAAKC,CAAG,EACzG,QAASC,EAAuB,EAAGxE,EAAS,EAAGwE,EAAuBJ,EAAkB,OAAQI,IAAwB,CACvH,GAAM,CAACF,EAAcC,CAAG,EAAIH,EAAkBI,CAAoB,EAClE,GAAI5B,EAAU0B,CAAY,GAAKC,EAAK,CACnC,IAAME,EAAaC,GAAiBH,CAAG,EACvC3B,EAAU0B,CAAY,EAAIjB,EAAgBiB,CAAY,EAAIG,EAAW,SAASN,EAAgBnE,CAAM,EACpGA,GAAUyE,EAAW,KACtB,SAAWpB,EAAgBiB,CAAY,EACtC,MAAM,IAAI,MAAMK,EAA8B,CAEhD,CACD,CAEA,eAAenB,GAAsBoB,EAAmBN,EAAcO,EAAiBjC,EAAW9C,EAAW,CAC5G,IAAMqE,EAAiBtD,GAAY+D,EAAkB,IAAI,EACnDE,EAAQ,IAAIC,GAClBD,EAAM,OAAOhF,EAAU+E,CAAe,CAAC,EACvC,IAAMG,EAAoBnE,GAAY,IAAI,WAAW,CAAC,CAAC,EACvDmE,EAAkB,UAAU,EAAGF,EAAM,IAAI,EAAG,EAAI,EAChD,IAAMzE,EAAYY,GAAUkD,EAAgB,CAAC,EAC7C,OAAO,OAAOS,EAAmB,CAChC,QAASK,GAASd,EAAgB,CAAC,EACnC,CAACG,CAAY,EAAGY,GAAWN,EAAkB,KAAK,SAAS,CAAC,CAAC,EAC7D,MAAO,CAAC9E,EAAU,QAAQ,sBAAwBO,GAAaY,GAAU+D,EAAmB,CAAC,CAC9F,CAAC,EACGJ,EAAkB,QACrBhC,EAAU0B,CAAY,EAAIM,EAAkBN,CAAY,EACxD1B,EAAU0B,EAAe,MAAM,EAAI,GAErC,CAEA,SAASR,GAAkB5D,EAAe0C,EAAWzC,EAAmB,CACvE,IAAMgE,EAAiBtD,GAAYX,EAAc,IAAI,EAC/CiF,EAAWF,GAASd,EAAgB,CAAC,EAC3C,OAAO,OAAOjE,EAAe,CAC5B,cAAe+E,GAASd,EAAgB,CAAC,EACzC,SAAUc,GAASd,EAAgB,CAAC,EACpC,SAAAgB,EACA,0BAA2BhF,EAC3B,kBAAmB2C,GAAUqB,EAAgB,CAAC,CAC/C,CAAC,EACDvB,EAAU,kBAAoB1C,EAAc,iBAC7C,CAEA,SAAS8D,GAAmBD,EAAgBnB,EAAW,CACtD,IAAMuB,EAAiBtD,GAAYkD,EAAe,IAAI,EAClDZ,EAAmB,EACnBiC,EACJ,GAAI,CACH,KAAOjC,EAAmBY,EAAe,KAAK,QAAU,CAACqB,GAAU,CAClE,IAAMC,EAAWvC,GAAUqB,EAAgBhB,CAAgB,EACrDmC,EAAgBxC,GAAUqB,EAAgBhB,EAAmB,CAAC,EAChEkC,GAAY,IACfD,EAAWrB,EAAe,KAAK,MAAMZ,EAAmB,EAAGA,EAAmB,EAAImC,CAAa,GAEhGnC,GAAoB,EAAImC,CACzB,CACD,MAAiB,CAEjB,CACA,GAAI,CACH,GAAIF,GAAYA,EAAS,QAAU,GAAI,CACtC,IAAMG,EAAW1E,GAAYuE,CAAQ,EAC/B9E,EAAiBiF,EAAS,aAAa,EAAG,EAAI,EAC9CC,EAAoBD,EAAS,aAAa,EAAG,EAAI,EACjDE,EAAkBF,EAAS,aAAa,GAAI,EAAI,EACtD,OAAO,OAAOxB,EAAgB,CAC7B,eAAAzD,EACA,kBAAAkF,EACA,gBAAAC,CACD,CAAC,EACD,IAAMC,EAAcC,GAAYrF,CAAc,EACxCsF,EAAiBD,GAAYH,CAAiB,EAC9CK,EAAeF,GAAYF,CAAe,EAC1CK,EAAiB,CAAE,YAAAJ,EAAa,eAAAE,EAAgB,aAAAC,CAAa,EACnE,OAAO,OAAO9B,EAAgB+B,CAAc,EAC5C,OAAO,OAAOlD,EAAWkD,CAAc,CACxC,CACD,MAAiB,CAEjB,CACD,CAEA,SAAS5B,GAAgCD,EAA6BrB,EAAWnC,EAAgB,CAChG,IAAM0D,EAAiBtD,GAAYoD,EAA4B,IAAI,EAC7D8B,EAAQd,GAASd,EAAgB,CAAC,EAClC6B,EAAiB,CAAC,EAClBC,EAAoB,CAAC,EACvBxF,IACEsF,EAAQ,IAAQ,IACpBC,EAAe,KAAKE,EAAoC,EACxDD,EAAkB,KAAKE,EAAwC,IAE3DJ,EAAQ,IAAQ,IACpBC,EAAe,KAAKI,EAA8B,EAClDH,EAAkB,KAAKI,EAAkC,IAErDN,EAAQ,IAAQ,IACpBC,EAAe,KAAKM,EAA2B,EAC/CL,EAAkB,KAAKM,EAA+B,IAE7CtC,EAA4B,KAAK,QAAU,IACrD+B,EAAe,KAAKE,EAAoC,EACxDD,EAAkB,KAAKE,EAAwC,GAEhE,IAAInG,EAAS,EACbgG,EAAe,QAAQ,CAAC1B,EAAckC,IAAkB,CACvD,GAAIvC,EAA4B,KAAK,QAAUjE,EAAS,EAAG,CAC1D,IAAMyG,EAAOxF,GAAUkD,EAAgBnE,CAAM,EAC7C4C,EAAU0B,CAAY,EAAIL,EAA4BK,CAAY,EAAI,IAAI,KAAKmC,EAAO,GAAI,EAC1F,IAAM5B,EAAkBoB,EAAkBO,CAAa,EACvDvC,EAA4BY,CAAe,EAAI4B,CAChD,CACAzG,GAAU,CACX,CAAC,CACF,CAEA,eAAe0G,GAAchH,EAAQW,EAAWsG,EAAaC,EAAcC,EAAe,CACzF,IAAMC,EAAiB,IAAI,WAAW,CAAC,EACjCC,EAAgBlG,GAAYiG,CAAc,EAChDE,GAAUD,EAAe,EAAG1G,CAAS,EACrC,IAAM4G,EAAeL,EAAeC,EACpC,OAAQ,MAAMK,EAAKN,CAAY,GAAM,MAAMM,EAAK,KAAK,IAAID,EAAcN,CAAW,CAAC,EAEnF,eAAeO,EAAKC,EAAQ,CAC3B,IAAMnH,EAAS2G,EAAcQ,EACvBC,EAAQ,MAAMzG,GAAejB,EAAQM,EAAQmH,CAAM,EACzD,QAASE,EAAYD,EAAM,OAASR,EAAcS,GAAa,EAAGA,IACjE,GAAID,EAAMC,CAAS,GAAKP,EAAe,CAAC,GAAKM,EAAMC,EAAY,CAAC,GAAKP,EAAe,CAAC,GACpFM,EAAMC,EAAY,CAAC,GAAKP,EAAe,CAAC,GAAKM,EAAMC,EAAY,CAAC,GAAKP,EAAe,CAAC,EACrF,MAAO,CACN,OAAQ9G,EAASqH,EACjB,OAAQD,EAAM,MAAMC,EAAWA,EAAYT,CAAY,EAAE,MAC1D,CAGH,CACD,CAEA,SAAS7F,GAAeuG,EAAW1H,EAAS2H,EAAM,CACjD,OAAO3H,EAAQ2H,CAAI,IAAMhG,GAAkB+F,EAAU,QAAQC,CAAI,EAAI3H,EAAQ2H,CAAI,CAClF,CAEA,SAASxE,GAAQyE,EAAS,CACzB,IAAMC,GAAQD,EAAU,aAAe,GAAIf,EAAOe,EAAU,MAC5D,GAAI,CACH,OAAO,IAAI,KAAK,OAASC,EAAO,QAAW,KAAMA,EAAO,MAAW,GAAK,EAAGA,EAAO,IAAShB,EAAO,QAAW,IAAKA,EAAO,OAAW,GAAIA,EAAO,IAAU,EAAG,CAAC,CAC9J,MAAiB,CAEjB,CACD,CAEA,SAASd,GAAY6B,EAAS,CAC7B,OAAO,IAAI,KAAM,OAAQA,EAAU,OAAO,GAAK,EAAK,OAAO,WAAc,CAAC,CAAE,CAC7E,CAEA,SAASvC,GAASyC,EAAM1H,EAAQ,CAC/B,OAAO0H,EAAK,SAAS1H,CAAM,CAC5B,CAEA,SAAS8C,GAAU4E,EAAM1H,EAAQ,CAChC,OAAO0H,EAAK,UAAU1H,EAAQ,EAAI,CACnC,CAEA,SAASiB,GAAUyG,EAAM1H,EAAQ,CAChC,OAAO0H,EAAK,UAAU1H,EAAQ,EAAI,CACnC,CAEA,SAAS2H,GAAaD,EAAM1H,EAAQ,CACnC,OAAO,OAAO0H,EAAK,aAAa1H,EAAQ,EAAI,CAAC,CAC9C,CAEA,SAASgH,GAAUU,EAAM1H,EAAQ4H,EAAO,CACvCF,EAAK,UAAU1H,EAAQ4H,EAAO,EAAI,CACnC,CAEA,SAAS/G,GAAYgH,EAAO,CAC3B,OAAO,IAAI,SAASA,EAAM,MAAM,CACjC,CCjmBA,IAAMC,GAAsB,IAAI,WAAW,CAAC,EAAM,EAAM,EAAM,EAAM,GAAM,GAAM,EAAM,EAAM,CAAI,CAAC,ECtGjG,IAAAC,GAAA,GAkCIC,GACJ,GAAI,CACHA,GAAUD,GAAY,GACvB,MAAiB,CAEjB,CACAE,GAAU,CAAE,QAAAD,EAAQ,CAAC,EACrBE,GAAmBD,EAAS,ECL5BE,GAAU,CAAE,QAAAC,GAAS,QAAAC,EAAQ,CAAC,E1BCvB,SAASC,EACdC,EACAC,EACe,CAEf,GAAY,CAAAD,EAGZ,MAAIC,aAAmB,MACfA,EAEF,IAAI,MAAMA,CAAO,CACzB,CAeO,SAASC,GAAqBC,EAAcC,EAA2B,CAC5E,IAAMC,EAAa,SACnB,GAAI,CAACF,EAAK,WAAWE,CAAU,EAC7B,MAAM,IAAI,MAAM,SAASF,CAAI,gCAAgC,EAE/D,IAAMG,EAAiBH,EAAK,MAAME,EAAW,MAAM,EACnD,MAAO,2BAA2BD,CAAS,IAAIE,CAAc,EAC/D,CAMA,eAAsBC,GACpBC,EAC4D,CAC5D,IAAMC,EAAQ,IAAI,IAEZC,EAAW,MAAM,MAAMF,CAAU,EACvC,GAAIE,EAAS,MAAQ,KACnB,MAAM,IAAI,MAAM,uBAAuBF,CAAU,GAAG,EAGtD,IAAMG,EAAO,MAAMD,EAAS,KAAK,EAC3BE,EAAgB,IAAIC,GAAWF,CAAI,EACnCG,EAAY,IAAIC,GAAUH,CAAa,EAE7CI,EACEL,EAAK,OAAS,kBACd,8BAA8BH,CAAU,oCAAoCG,EAAK,IAAI,GACvF,EAEA,cAAiBM,KAASH,EAAU,oBAAoB,EAAG,CACzD,IAAII,EACJ,GAAID,EAAM,UAKRC,EAJuC,CACrC,KAAM,YACN,KAAMD,EAAM,QACd,MAEK,CACL,IAAME,EAAS,IAAIC,GACnBJ,EAAOC,EAAM,SAAW,KAAM,uBAAuB,EACrD,IAAMI,EAAO,MAAMJ,EAAM,QAAQE,CAAM,EAQvCD,EAPkC,CAChC,KAAM,OACN,KAAMD,EAAM,SACZ,KAAM,MAAMI,EAAK,YAAY,EAC7B,SAAU,MAAMA,EAAK,YAAY,EACjC,KAAMJ,EAAM,gBACd,CAEF,CACAR,EAAM,IAAIS,EAAK,KAAMA,CAAI,CAC3B,CACA,aAAMJ,EAAU,MAAM,EACfL,CACT,CAwBO,SAASa,GAAgBC,EAAmBC,EAAsB,CACvE,SAAO,SAAK,0BAA2BD,EAAWC,CAAI,CACxD,CAEO,SAASC,GAAUC,EAAsC,CAC9D,IAAMC,EAAO,IAAI,YAAYD,EAAK,KAAK,UAAU,EACjD,IAAI,WAAWC,CAAI,EAAE,IAAI,IAAI,WAAWD,EAAK,IAAI,CAAC,EAClD,IAAME,EAAW,IAAI,YAAYF,EAAK,SAAS,UAAU,EACzD,WAAI,WAAWE,CAAQ,EAAE,IAAI,IAAI,WAAWF,EAAK,QAAQ,CAAC,EACnD,CACL,KAAM,OACN,KAAMA,EAAK,KACX,KAAAC,EACA,SAAAC,EACA,KAAMF,EAAK,IACb,CACF,Cd1HA,IAAMG,GAAiC,kBACjCC,GACJ,4CAEWC,GAAN,cAA6B,GAAAC,OAAmC,CA2ErE,YACEC,EACAC,EACAC,EACAC,EACAC,EAAoB,GACpBC,EAAkB,GAClB,CACA,MAAM,EAEN,QAAK,UAAYL,EACjB,KAAK,WAAaE,EAClB,KAAK,QAAUD,EAEf,KAAK,SAAW,IAAI,eACpB,KAAK,IAAM,IAAI,eACf,KAAK,OAAS,IAAI,eAClB,KAAK,QAAU,IAAI,eACnB,KAAK,MAAQ,IAAI,eACjB,KAAK,UAAY,IAAI,eAErB,KAAK,OAAS,KACd,KAAK,KAAO,KACZ,KAAK,kBAAoB,KAEzB,KAAK,YAAc,CAAC,EACpB,KAAK,YAAc,KAEnB,KAAK,UAAYG,GAAY,GAE7B,KAAK,QAAUC,EAEX,KAAK,UAAW,CAClB,IAAMC,EAAc,IAAI,YAAY,EAAE,OAAOD,CAAO,EASpDF,EAAQ,CARY,CAClB,KAAMG,EACN,SAAU,IAAI,WAAWA,CAAW,EACpC,KAAM,YACN,KAAMA,EAAY,OAClB,KAAM,OACN,MAAO,EACT,CACoB,CACtB,CAEA,KAAK,WAAWH,CAAK,CACvB,CApGA,IAAI,WAAqB,CACvB,OAAO,KAAK,QAAQ,OAAS,CAC/B,CAEA,IAAI,UAAUI,EAAG,CAAC,CAIlB,IAAI,UAAoB,CACtB,OAAO,KAAK,SACd,CAEA,IAAI,SAASC,EAAc,CACzB,KAAK,UAAYA,EACjB,KAAK,MAAM,SAAS,CAClB,QAAS,CACP,KAAK,MAAM,YACTA,EAAMC,GAAsBC,EAC9B,EACA,KAAK,UAAU,YACbF,EAAMG,GAA0BC,EAClC,CACF,CACF,CAAC,CACH,CAEA,IAAI,YAAqB,CACvB,OAAI,KAAK,aAAe,KACf,GAGW,IAAI,YAAY,EACZ,OAAO,KAAK,YAAY,KAAK,IAAI,CAG3D,CAEA,IAAI,WAAWC,EAAa,CAC1BC,EAAO,KAAK,MAAQ,IAAI,EAExB,IAAMC,EAAU,CACd,CACE,KAAM,EACN,GAAI,KAAK,KAAK,MAAM,IAAI,SAAS,EAAE,OACnC,OAAQF,CACV,CACF,EACA,KAAK,KAAK,SAAS,CAAE,QAAAE,CAAQ,EAAG,CAAE,OAAQ,EAAM,CAAC,CACnD,CAEA,IAAI,WAAoB,CACtB,OAAO,KAAK,MAAM,MAAM,IAAI,SAAS,GAAK,EAC5C,CAkDA,WAAWC,EAAqC,CAC9C,QAAWC,KAAcD,EAAa,CAEpC,IAAME,EAAO,CACX,KAFiBC,GAAUF,CAAU,EAGrC,YAAa,CAAC,CAChB,EACA,KAAK,YAAY,KAAKC,CAAI,EAEtBD,EAAW,QAAU,KACvB,KAAK,YAAcC,EAEvB,CACF,CAKA,MAAM,iBAAiC,CACrC,GAAM,CAAE,SAAAE,CAAS,EAAI,KAAM,uCAC3BN,EAAO,KAAK,MAAQ,IAAI,EACxB,KAAK,KAAK,SAAS,CACjB,QAAS,KAAK,SAAS,YAAYM,EAAS,CAAC,CAC/C,CAAC,CACH,CAKA,MAAM,YAA4B,CAChC,GAAM,CAAE,UAAAC,CAAU,EAAI,KAAM,uCAC5BP,EAAO,KAAK,MAAQ,IAAI,EACxB,KAAK,KAAK,SAAS,CACjB,QAAS,KAAK,IAAI,YAChBO,EAAU,CACR,QAAUC,GAAS,CACjB,GAAM,CAAE,kBAAAC,CAAkB,EAAID,EAC9B,KAAK,kBAAoBC,CAC3B,EACA,gBAAkBC,GAAY,CAC5B,KAAK,iBAAiBA,CAAO,CAC/B,CACF,CAAC,CACH,CACF,CAAC,CACH,CAKA,MAAM,eAA+B,CACnC,GAAM,CAAE,OAAAC,CAAO,EAAI,KAAM,uCACzBX,EAAO,KAAK,MAAQ,IAAI,EACxB,KAAK,KAAK,SAAS,CACjB,QAAS,KAAK,OAAO,YAAYW,EAAO,CAAC,CAC3C,CAAC,CACH,CAEA,iBAAiBD,EAAuB,CACtC,KAAK,KAAK,mBAAoBA,CAAO,CACvC,CAEA,MAAM,MAAsB,CAC1BV,EAAO,KAAK,QAAU,KAAM,6BAA6B,EACzD,KAAK,WAAW,KAAK,WAAW,CAClC,CAEA,WAAWI,EAAwC,CACjD,IAAIL,EAAM,GASV,IAPIK,GAAQ,OACV,KAAK,YAAcA,EACnBL,EAAM,KAAK,YAGbC,EAAO,KAAK,QAAU,IAAI,EAEnB,KAAK,OAAO,YAAc,MAC/B,KAAK,OAAO,WAAW,OAAO,EAGhC,KAAK,KAAO,IAAI,cAAW,CACzB,OAAQ,KAAK,OACb,WAAY,CACV,cACA,KAAK,SAAS,GAAG,CAAC,CAAC,EACnB,KAAK,IAAI,GAAG,CAAC,CAAC,EACd,KAAK,OAAO,GAAG,CAAC,CAAC,EACjB,KAAK,QAAQ,GAAG,eAAY,QAAQ,GAAG,CAAC,CAAC,EACzC,KAAK,MAAM,GACT,KAAK,SAAWL,GAAsBC,EACxC,EACA,KAAK,UAAU,GACb,KAAK,SAAWC,GAA0BC,EAC5C,EACA,cAAW,GAAG,GAAI,EAClB,UAAO,GAAG,CAAC,gBAAa,CAAC,KACzB,eAAW,CACb,EACA,IAAAC,CACF,CAAC,EAED,KAAK,gBAAgB,EAAE,MAAOa,GAAQ,CACpC,QAAQ,MAAM,qCAAsCA,CAAG,CACzD,CAAC,EAED,KAAK,WAAW,EAAE,MAAOA,GAAQ,CAC/B,QAAQ,MAAM,uBAAwBA,CAAG,CAC3C,CAAC,EAED,KAAK,cAAc,EAAE,MAAOA,GAAQ,CAClC,QAAQ,MAAM,0BAA2BA,CAAG,CAC9C,CAAC,CACH,CAEA,QAAQb,EAAmB,CAGzB,GAFAC,EAAO,KAAK,aAAe,IAAI,EAE3BD,IAAQ,KAAK,WACf,OAIF,IAAMS,EADc,IAAI,YAAY,EACX,OAAOT,CAAG,EAEnC,KAAK,YAAY,KAAK,KAAOS,EAC7B,KAAK,KAAK,OAAQ,KAAK,YAAY,IAAI,CACzC,CAEA,gBAAyB,CACvB,GAAI,KAAK,aAAe,KACtB,MAAO,GAGT,QAAWK,KAAc,KAAK,YAAa,CACzC,GAAIA,EAAW,KAAK,OAAS,KAAK,YAAY,KAAK,KACjD,SAMF,OAHoB,IAAI,YAAY,EACZ,OAAOA,EAAW,KAAK,QAAQ,CAGzD,CAEA,MAAO,EACT,CAEA,WAAkB,CAChB,KAAK,WAAa,KAAK,eAAe,CACxC,CAEA,MAAM,YAAYC,EAAgC,CAChDd,EAAO,KAAK,MAAQ,IAAI,EACxBA,EAAO,KAAK,aAAe,IAAI,EAE/B,IAAMe,EAAeD,EAAQ,MAAMhC,EAA8B,EACjEkB,EACEe,GAAgB,KAChB,8DACF,EAEA,IAAMC,EAAQF,EAAQ,SAAS/B,EAA+B,EAC9D,QAAWkC,KAAQD,EAAO,CACxB,GAAIC,EAAK,QAAQ,MAAQ,MAAQA,EAAK,QAAQ,MAAQ,KACpD,SAGF,IAAMC,EAAeC,GACnBF,EAAK,OAAO,KACZ,KAAK,SACP,EAEA,QAAWb,KAAQ,KAAK,YAEpBc,OACA,SAAK,0BAA2B,KAAK,UAAWd,EAAK,KAAK,IAAI,GAKhEA,EAAK,YAAY,KAAK,CACpB,SAAU,QACV,KAAMgB,GAAyB,KAAK,KAAK,MAAM,IAAI,SAAS,EAAG,CAC7D,KAAM,SAASH,EAAK,OAAO,IAAI,EAAI,EACnC,UAAW,CACb,CAAC,EACD,GACEG,GAAyB,KAAK,KAAK,MAAM,IAAI,SAAS,EAAG,CACvD,KAAM,SAASH,EAAK,OAAO,IAAI,EAC/B,UAAW,CACb,CAAC,EAAI,EACP,QAAAH,CACF,CAAsB,EAGxB,IAAMO,KAAiB,mBACrB,KAAK,KAAK,MACV,KAAK,YAAY,WACnB,EACMC,EAAc,KAAK,KAAK,MAAM,OAAOD,CAAc,EACzD,KAAK,KAAK,SAASC,CAAW,CAChC,CACF,CAEA,SAAgB,CAGd,GAFA,KAAK,mBAAmB,OAAO,EAE3B,KAAK,QAAU,KAEnB,KAAO,KAAK,OAAO,YAAc,MAC/B,KAAK,OAAO,WAAW,OAAO,CAElC,CACF,EyC5XA,IAAAC,GAAmB,WAEnB,IAAAC,GAAqB,WA0BrB,IAAMC,GAAyB,UACzBC,GAAgC,IAChCC,GAAwB,qBAEjBC,GAAN,cAAiC,GAAAC,OAAuC,CA0C7E,YACEC,EACAC,EACAC,EACAC,EACAC,EAAY,GACZ,CACA,MAAM,EAENC,EAAO,OAAO,QAAU,KAAM,8BAA8B,EAE5D,KAAK,UAAYL,EACjB,KAAK,QAAUC,EACf,KAAK,UAAYC,EACjB,KAAK,KAAOC,EACZ,KAAK,uBAAyB,GAE9B,KAAK,OAAS,KACd,KAAK,OAAS,KACd,KAAK,YAAc,KACnB,KAAK,OAAS,KAEd,KAAK,cAAgB,KACrB,KAAK,2BAA6B,GAElC,KAAK,UAAYC,EAEjB,KAAK,cAAgB,eACvB,CApDA,IAAI,cAA+B,CACjC,OAAO,KAAK,aACd,CAEA,IAAI,aAAaE,EAAwB,CACvC,KAAK,cAAgBA,EACrB,KAAK,KAAK,eAAgBA,CAAM,CAClC,CAGA,IAAI,uBAAiC,CACnC,OAAO,KAAK,sBACd,CAEA,IAAI,sBAAsBC,EAAe,CACvC,KAAK,uBAAyBA,EAE1B,KAAK,QAAU,OAEnB,KAAK,OAAO,sBAAwBA,EAEpC,KAAK,OAAO,+BAAiC,IAAO,IACtD,CAgCA,mBAA0B,CACpB,KAAK,eAAiB,OAI1B,KAAK,KAAK,WAAY,KAAK,cAAc,KAAK;AAAA,CAAI,EAAE,KAAK,CAAC,EAC1D,KAAK,cAAgB,KACvB,CAEA,sBAAmD,CACjDF,EAAO,KAAK,WAAa,IAAI,EAC7BA,EAAO,KAAK,QAAU,IAAI,EAE1B,IAAMG,EAAOC,GAAgB,KAAK,UAAW,KAAK,OAAO,EACnDP,KAAY,SAAKM,EAAM,KAAK,SAAS,EAoB3C,MAlBqD,CACnD,KAAM,CAAC,SAAUA,EAAM,kBAAmBN,CAAS,EACnD,OAAQ,KAAK,OACb,mBAAoB,EACpB,YAAa,GACb,QAAS,IAAIQ,IAAgB,CAC3B,KAAK,SAAS,GAAGA,CAAI,CACvB,EACA,aAAc,IAAIA,IAAgB,CAChC,KAAK,cAAc,GAAGA,CAAI,CAC5B,EACA,WAAY,CAACC,EAASC,IAAU,CAC9B,KAAK,KAAK,WAAYD,EAASC,CAAK,CACtC,EACA,gBAAiB,CAAC,UAAW,gBAAgB,EAC7C,gBAAiB,GACjB,UAAW,KAAK,IAClB,CAEF,CAEA,YAAYF,EAAuB,CACjC,KAAK,KAAK,MAAOA,EAAK,KAAK,GAAG,CAAC,CACjC,CAEA,iBAAiBA,EAAuB,CACtC,GAAIA,EAAK,QAAU,EACjB,OAIF,IAAIG,KAAM,GAAAC,SAAOJ,EAAK,CAAC,EAAU,GAAGA,EAAK,MAAM,CAAC,CAAC,EAE/C,KAAK,eAAiB,MACtBG,EAAI,MAAMlB,EAAsB,GAAK,MAErC,KAAK,cAAc,KAAKkB,CAAG,EAC3B,aAAa,KAAK,0BAA0B,EAC5C,KAAK,2BAA6B,WAAW,IAAM,CACjD,KAAK,kBAAkB,CACzB,EAAGjB,EAA6B,GACvBiB,EAAI,WAAWhB,EAAqB,IAC7CgB,EAAMA,EAAI,MAAMhB,GAAsB,MAAM,EACxC,KAAK,4BAA8B,IACrC,aAAa,KAAK,0BAA0B,EAC5C,KAAK,2BAA6B,GAClC,KAAK,kBAAkB,GAEzB,KAAK,cAAgB,CAACgB,CAAG,EACzB,KAAK,2BAA6B,WAAW,IAAM,CACjD,KAAK,kBAAkB,CACzB,EAAGjB,EAA6B,EAEpC,CAEA,MAAM,MAAsB,CAC1BS,EAAO,KAAK,QAAU,QAAM,GAAAS,SAAO,0BAA2B,QAAQ,CAAC,EAEvE,KAAK,YAAY,EAEjB,MAAM,KAAK,WAAW,EACtB,KAAK,KAAK,OAAO,CACnB,CAEA,MAAM,YAA4B,CAChC,KAAK,OAAS,IAAI,OAAO,OAAO,KAAK,qBAAqB,CAAC,EAC3D,IAAMC,EAAW,IAAI,IAAI,eAAgB,OAAO,SAAS,IAAI,EAC7D,KAAK,YAAY,EACjB,KAAK,YAAc,KAAK,OAAO,KAAKA,EAAS,IAAI,EACjD,MAAM,KAAK,YAAY,KAAK,IAAO,KAAK,aAAe,MAAO,CAChE,CAEA,MAAM,QAAQC,EAAqC,CACjD,MAAM,KAAK,YACXX,EAAO,KAAK,QAAU,KAAM,2CAA2C,EAEvE,IAAMY,EAAWR,GAAgB,KAAK,UAAWO,EAAK,IAAI,EAC1D,KAAK,OAAO,SAASC,EAAUD,EAAK,IAAI,CAC1C,CAEA,MAAM,QAAwB,CAC5BX,EAAO,KAAK,QAAU,KAAM,0CAA0C,EACtE,KAAK,YAAY,EACjB,MAAM,KAAK,OAAO,MAAM,KAAK,qBAAqB,CAAC,EACnD,KAAK,aAAe,SACtB,CAEA,IAAIa,EAA4B,CAC9B,KAAK,KAAK,UAAWA,CAAK,CAC5B,CAEA,MAAM,SAAyB,CAC7Bb,EAAO,KAAK,QAAU,KAAM,2CAA2C,EACvE,KAAK,OAAO,YAAY,EACxB,KAAK,aAAe,cACpB,MAAM,KAAK,WAAW,EACtB,MAAM,KAAK,OAAO,CACpB,CAEA,YAAYc,EAAwB,GAAY,CAC9Cd,EAAO,KAAK,QAAU,IAAI,EAEtB,KAAK,eAAiB,YAI1B,SAAS,eAAe,kBAAkB,GAAG,OAAO,EAEhD,KAAK,QAAU,OACjB,KAAK,OAAO,OAAO,EACnB,KAAK,OAAS,MAGXc,IAIL,KAAK,OAAS,KAAK,OAAO,YAAY,SAAS,cAAc,QAAQ,CAAC,EACtE,KAAK,OAAO,UAAU,IAAI,QAAQ,EAClC,KAAK,OAAO,GAAK,mBACjB,KAAK,OAAO,MAAQ,KAAK,OAAO,YAChC,KAAK,OAAO,OAAS,KAAK,OAAO,aACjC,KAAK,OAAO,MAAM,MAAQ,GAAG,KAAK,OAAO,KAAK,KAC9C,KAAK,OAAO,MAAM,OAAS,GAAG,KAAK,OAAO,MAAM,MAClD,CAEA,SAAgB,CACd,KAAK,mBAAmB,OAAO,EAC3B,KAAK,QAAU,MACjB,KAAK,YAAY,EAAK,EAGxB,KAAK,QAAQ,OAAO,CACtB,CACF,EC5PA,IAAAC,GAA4B,6BAC5BC,GAA2B,4BCH3B,IAAAC,GAA4C,6BAC5CC,GAA2B,4BAC3BC,GAA6B,sBCF7BD,GAKO,4BCLPD,GAAwC,6BACxCC,GAA2D,4BDMrDE,GAAe,IAEfC,GAAN,KAAqD,CAInD,YAAYC,EAAkB,CAC5B,KAAK,uBAAyB,KAC9B,KAAK,eAAiB,EACxB,CAEA,OAAOC,EAA0B,CAK/B,GAJI,KAAK,wBAA0B,MAAQ,CAACA,EAAO,iBAI/C,CAAC,KAAK,iBACR,KAAK,eACH,KAAK,IACHA,EAAO,KAAK,UAAU,aACpB,KAAK,MAAMA,EAAO,KAAK,UAAU,SAAS,EAC1CA,EAAO,KAAK,UAAU,YAC1B,EAAIH,GAEF,CAAC,KAAK,gBACR,OAIJ,IAAMI,EAAW,IAAY,CACvB,KAAK,wBAA0B,OAGnC,qBAAqB,KAAK,sBAAsB,EAChD,KAAK,uBAAyB,KAC9B,KAAK,eAAiB,GACxB,EAEA,KAAK,uBAAyB,sBAAsB,IAAM,CACxDD,EAAO,KAAK,UAAU,oBAAoB,SAAUC,CAAQ,EAC5DD,EAAO,KAAK,UAAU,OAAO,CAC3B,IAAKA,EAAO,KAAK,UAAU,aAC3B,SAAU,SACZ,CAAC,EACD,KAAK,uBAAyB,KAC9B,KAAK,eAAiB,EACxB,CAAC,EAEDA,EAAO,KAAK,UAAU,iBAAiB,SAAUC,CAAQ,CAC3D,CACF,EAEO,SAASC,IAAkE,CAEhF,OADe,cAAW,UAAUJ,EAAuB,CAE7D,CC3DA,IAAMK,GAAkB,eAAY,OAAqC,CACvE,IAAK,CAAC,CAAE,KAAAC,EAAM,GAAAC,CAAG,EAAGC,KACX,CACL,KAAMA,EAAO,OAAOF,CAAI,EACxB,GAAIE,EAAO,OAAOD,CAAE,CACtB,EAEJ,CAAC,EAEKE,GAAoB,cAAW,OAAsB,CACzD,QAAS,CACP,OAAO,cAAW,IACpB,EAEA,OAAOC,EAAQC,EAAI,CACjBD,EAASA,EAAO,IAAIC,EAAG,OAAO,EAC9B,QAAWC,KAAUD,EAAG,QAClBC,EAAO,GAAGP,EAAe,IAC3BK,EAASA,EAAO,OAAO,CACrB,IAAK,CAACG,GAAiB,MAAMD,EAAO,MAAM,KAAMA,EAAO,MAAM,EAAE,CAAC,CAClE,CAAC,GAEL,OAAOF,CACT,EAEA,QAAUI,GAAU,cAAW,YAAY,KAAKA,CAAK,CACvD,CAAC,EAEKD,GAAmB,cAAW,KAAK,CAAE,MAAO,kBAAmB,CAAC,EAEhEE,GAAoB,cAAW,UAAU,CAC7C,oBAAqB,CAAE,MAAO,KAAM,CACtC,CAAC,EAEM,SAASC,GACdf,EACAgB,EACS,CACT,IAAMC,EAAOjB,EAAK,MAAM,IAAI,KAAKgB,CAAU,EACrCE,EAAuC,CAC3Cd,GAAgB,GAAG,CAAE,KAAMa,EAAK,KAAM,GAAIA,EAAK,EAAG,CAAC,CACrD,EAEA,OAAIjB,EAAK,MAAM,MAAMQ,GAAmB,EAAK,GAAK,MAChDU,EAAQ,KACN,eAAY,aAAa,GAAG,CAACV,GAAmBM,EAAiB,CAAC,CACpE,EAGFd,EAAK,SAAS,CAAE,QAAAkB,CAAQ,CAAC,EAElB,EACT,CFhDO,SAASC,IAAqB,CACnC,IAAMC,EAAgBjB,GAA2B,EAEjD,MAAO,CACL,gBACA,eAAY,SAAS,GAAG,EAAI,EAC5BiB,EACAC,GAAAA,WAAW,YACb,CACF,CDQO,IAAMC,GAAN,cAAgC,GAAAC,OAAsC,CAsC3E,YAAYC,EAAoB,CAC9B,MAAM,EAEN,KAAK,MAAQ,IAAI,eAEjB,KAAK,QAAU,KACf,KAAK,KAAO,KAEZ,KAAK,UAAYA,GAAY,EAC/B,CA5CA,IAAI,QAA6B,CAC/B,OAAO,KAAK,OACd,CAEA,IAAI,OAAOC,EAA2B,CAChCA,IAAU,KAAK,UAInB,KAAK,aAAa,EAClB,KAAK,QAAUA,EAEX,KAAK,SAAW,MAClB,KAAK,UAAU,EAEnB,CAOA,IAAI,UAAoB,CACtB,OAAO,KAAK,SACd,CAEA,IAAI,SAASC,EAAc,CACzB,KAAK,UAAYA,EACjB,KAAK,MAAM,SAAS,CAClB,QAAS,KAAK,MAAM,YAClBA,EAAMC,GAAsBC,EAC9B,CACF,CAAC,CACH,CAaA,WAAkB,CAChBC,EAAO,KAAK,SAAW,KAAM,kCAAkC,EAE/D,KAAK,MAAM,QAAQ,EACnB,KAAK,KAAO,IAAI,cAAW,CACzB,OAAQ,KAAK,QACb,WAAY,CACVC,GAAkB,EAClB,KAAK,MAAM,GACT,KAAK,SAAWH,GAAsBC,EACxC,CACF,EACA,IAAK,EACP,CAAC,CACH,CAEA,cAAqB,CACnB,GAAI,KAAK,SAAW,KAEpB,KAAO,KAAK,QAAQ,YAAc,MAChC,KAAK,QAAQ,WAAW,OAAO,CAEnC,CAEA,aAAoB,CAClBC,EAAO,KAAK,MAAQ,IAAI,EAEpB,KAAK,KAAK,MAAM,IAAI,SAAW,GAInC,KAAK,KAAK,SAAS,CACjB,QAAS,CACP,KAAM,KAAK,KAAK,MAAM,IAAI,OAC1B,OAAQ;AAAA,CACV,CACF,CAAC,CACH,CAEA,MAAM,MAAsB,CAC1BA,EAAO,KAAK,QAAU,KAAM,6BAA6B,EAEzD,KAAK,UAAU,EAEf,KAAK,KAAK,OAAO,CACnB,CAEA,OAAc,CACR,KAAK,SAAW,MACpB,KAAK,UAAU,CACjB,CAEA,IAAIE,EAAuB,CACzBF,EAAO,KAAK,MAAQ,IAAI,EAExB,KAAK,YAAY,EAEjB,KAAK,KAAK,SAAS,CACjB,QAAS,CACP,KAAM,KAAK,KAAK,MAAM,IAAI,OAC1B,OAAQ,GAAGE,CAAO,EACpB,CACF,CAAC,CACH,CAEA,MAAMA,EAAuB,CAC3B,GAAIA,IAAY,GACd,OAGFF,EAAO,KAAK,MAAQ,IAAI,EAExB,KAAK,YAAY,EAEjB,IAAMG,EAAS,GAAGD,CAAO,GACzB,KAAK,KAAK,SAAS,CACjB,QAAS,CACP,KAAM,KAAK,KAAK,MAAM,IAAI,OAC1B,OAAAC,CACF,CACF,CAAC,EAED,IAAMC,EAAW,MAAM,KAAKD,EAAO,SAAS,KAAK,CAAC,EAE5CE,EAAW,KAAK,KAAK,MAAM,IAAI,OAAO,KAAK,KAAK,MAAM,IAAI,MAAM,EACtE,QAASC,EAAID,EAAS,OAAQC,GAAKD,EAAS,OAASD,EAAS,OAAQE,IACpEC,GAAiB,KAAK,KAAMD,CAAC,CAEjC,CAEA,SAAgB,CACd,KAAK,mBAAmB,OAAO,CACjC,CACF,EI3JO,IAAME,GAAN,cAA6B,GAAAC,OAAmC,CAgCrE,aAAc,CACZ,MAAM,EACN,KAAK,UAAY,KACjB,KAAK,qBAAuB,KAC5B,KAAK,oBAAsB,KAC3B,KAAK,kBAAoB,KACzB,KAAK,uBAAyB,KAC9B,KAAK,oBAAsB,IAC7B,CAhCA,IAAI,UAA0B,CAC5B,OAAO,KAAK,SACd,CAEA,IAAI,sBAAiD,CACnD,OAAO,KAAK,oBACd,CAEA,IAAI,oBAA+C,CACjD,OAAO,KAAK,mBACd,CAEA,IAAI,kBAA6C,CAC/C,OAAO,KAAK,iBACd,CAEA,IAAI,uBAAkD,CACpD,OAAO,KAAK,sBACd,CAEA,IAAI,oBAA+C,CACjD,OAAO,KAAK,mBACd,CAYA,gBAAgBC,EAA4B,CAAC,CAE7C,yBAAyBA,EAA4B,CACnD,KAAK,qBAAuBA,EAAM,OAClC,KAAK,YAAY,CACnB,CAEA,uBAAuBA,EAA4B,CACjD,KAAK,oBAAsBA,EAAM,OACjC,KAAK,YAAY,CACnB,CAEA,qBAAqBA,EAA4B,CAC/C,KAAK,kBAAoBA,EAAM,OAC/B,KAAK,YAAY,CACnB,CAEA,0BAA0BA,EAA4B,CACpD,KAAK,uBAAyBA,EAAM,OACpC,KAAK,YAAY,CACnB,CAEA,uBAAuBA,EAA4B,CACjD,KAAK,oBAAsBA,EAAM,OACjC,KAAK,YAAY,CACnB,CAEA,SAASA,EAA4B,CAAC,CAEtC,WAAWA,EAA4B,CACrC,KAAK,MAAM,EACX,KAAK,UAAYA,EAAM,QACvB,KAAK,YAAY,CACnB,CAEA,aAAoB,CAClB,KAAK,KAAK,QAAQ,CACpB,CAEA,MAAM,MAAsB,CAC1B,KAAK,KAAK,OAAO,CACnB,CAEA,OAAc,CACZ,KAAK,UAAY,KACjB,KAAK,qBAAuB,KAC5B,KAAK,oBAAsB,KAC3B,KAAK,kBAAoB,KACzB,KAAK,uBAAyB,KAC9B,KAAK,oBAAsB,KAC3B,KAAK,KAAK,QAAQ,CACpB,CAEA,IAAIA,EAA4B,CAC9B,OAAQA,EAAM,KAAM,CAClB,IAAK,cACH,KAAK,gBAAgBA,CAAK,EAC1B,MACF,IAAK,wBACH,KAAK,yBAAyBA,CAAK,EACnC,MACF,IAAK,sBACH,KAAK,uBAAuBA,CAAK,EACjC,MACF,IAAK,oBACH,KAAK,qBAAqBA,CAAK,EAC/B,MACF,IAAK,yBACH,KAAK,0BAA0BA,CAAK,EACpC,MACF,IAAK,sBACH,KAAK,uBAAuBA,CAAK,EACjC,MACF,IAAK,OACH,KAAK,SAASA,CAAK,EACnB,MACF,IAAK,SACH,KAAK,WAAWA,CAAK,EACrB,KACJ,CACF,CAEA,SAAgB,CACd,KAAK,mBAAmB,OAAO,CACjC,CACF,EnD7GO,IAAMC,GAAN,cAA6B,GAAAC,OAAmC,CAmDrE,YAAYC,EAAsC,CAChD,MAAM,EAEN,GAAM,CACJ,WAAYC,EACZ,QAAAC,EACA,UAAAC,EACA,MAAAC,EACA,OAAAC,EACA,aAAAC,EACA,WAAAC,EACA,KAAAC,EACA,QAAAC,EAAU,EACZ,EAAIT,EAEJ,KAAK,YAAcC,EACnB,KAAK,SAAWC,EAChB,KAAK,WAAaC,EAClB,KAAK,OAASC,EAEd,KAAK,QAAUC,EAEf,KAAK,cAAgBC,EACrB,KAAK,MAAQE,EACb,KAAK,SAAWC,EAEhB,KAAK,aAAY,gBAAS,YAAQ,KAAK,QAAQ,CAAC,EAC5C,KAAK,YAAc,MACrB,KAAK,aAAY,aAAS,IAAI,IAAIR,CAAO,EAAE,SAAU,MAAM,GAG7D,IAAMS,EAAsB,MAAM,KAAKJ,EAAa,OAAO,CAAC,EACzD,IAA4BK,GAAgB,CAC3C,IAAMC,EAAOR,EAAM,KAChBQ,MAAS,SAAK,KAAK,SAAUA,EAAK,IAAI,IAAMD,EAAY,IAC3D,EACA,OAAIC,GAAQ,KAAa,MACzBD,EAAY,MAAQC,EAAK,MAClBD,EACT,CAAC,EACA,OACEA,GAA+CA,GAAe,IACjE,EAEF,KAAK,gBAAkB,IAAIE,GACzB,KAAK,UACL,KAAK,SACL,KAAK,YACLH,EACAH,EACAE,CACF,EAEA,KAAK,gBAAgB,GAAG,OAASG,GAAyB,EACvD,SAAY,CACX,MAAM,KAAK,SAASA,CAAI,CAC1B,GAAG,EAAE,MAAOE,GAAQ,CAClB,QAAQ,MAAM,2BAA4BA,CAAG,CAC/C,CAAC,CACH,CAAC,EAGD,KAAK,oBAAsB,IAAIC,GAC7B,KAAK,UACL,KAAK,SACL,KAAK,WACL,KAAK,MACL,KAAK,SACP,EAEA,KAAK,oBAAoB,GAAG,QAAS,IAAM,EACxC,SAAY,CACX,MAAM,KAAK,kBAAkB,EAC7B,MAAM,KAAK,gBAAgB,EAC3B,KAAK,KAAK,OAAO,CACnB,GAAG,EAAE,MAAOD,GAAQ,CAClB,QAAQ,MAAM,qCAAsCA,CAAG,CACzD,CAAC,CACH,CAAC,EAED,KAAK,oBAAoB,GAAG,MAAQE,GAAY,CAC9C,KAAK,eAAeA,CAAO,EAAE,MAAOF,GAAQ,CAC1C,QAAQ,MAAM,sCAAuCA,CAAG,CAC1D,CAAC,CACH,CAAC,EAED,KAAK,oBAAoB,GAAG,WAAaE,GAAY,CACnD,KAAK,oBAAoBA,CAAO,EAAE,MAAOF,GAAQ,CAC/C,QAAQ,MAAM,2CAA4CA,CAAG,CAC/D,CAAC,CACH,CAAC,EAED,KAAK,oBAAoB,GAAG,eAAiBG,GAAW,CAClDA,IAAW,SAEf,KAAK,gBAAgB,MAAM,EAC3B,KAAK,mBAAmB,MAAM,EAChC,CAAC,EAGD,KAAK,mBAAqB,IAAIC,GAG9B,KAAK,gBAAkB,IAAIC,GAG3B,OAAO,QAAU,CACf,IAAMC,GAAyB,CAC7B,KAAK,QAAQA,CAAK,CACpB,CACF,EAEA,OAAO,iBAAiB,UAAYC,GAAU,CAC5C,GAAIA,EAAM,MAAM,OAAS,cACzB,OAAQA,EAAM,MAAM,KAAM,CACxB,IAAK,2BACH,KAAK,oBAAoB,sBAAwBA,EAAM,KAAK,KAChE,CACF,CAAC,CACH,CA9JA,IAAI,YAAsB,CACxB,OAAO,KAAK,qBAAqB,eAAiB,SACpD,CAGA,IAAI,gBAAiC,CACnC,OAAO,KAAK,eACd,CAEA,IAAI,eAAeC,EAAG,CAAC,CAGvB,IAAI,oBAAyC,CAC3C,OAAO,KAAK,mBACd,CAEA,IAAI,mBAAmBA,EAAG,CAAC,CAG3B,IAAI,gBAAiC,CACnC,OAAO,KAAK,eACd,CAEA,IAAI,eAAeA,EAAG,CAAC,CAGvB,IAAI,mBAAuC,CACzC,OAAO,KAAK,kBACd,CAEA,IAAI,kBAAkBA,EAAG,CAAC,CAG1B,IAAI,WAAqB,CACvB,OAAO,KAAK,SAAS,OAAS,CAChC,CAEA,IAAI,UAAUA,EAAG,CAAC,CA2HlB,MAAM,mBAAmC,CACvCC,EAAO,KAAK,qBAAuB,IAAI,EAEvC,IAAMC,EAAQ,IAAIC,GAAO,CAAE,YAAa,EAAG,CAAC,EAC5C,OAAW,CAAC,CAAEb,CAAI,IAAK,KAAK,cAC1BY,EACG,IAAI,SAAY,CACf,MAAM,KAAK,oBAAoB,QAAQZ,CAAI,CAC7C,CAAC,EACA,MAAOE,GAAQ,CACd,QAAQ,MAAM,2BAA4BA,CAAG,CAC/C,CAAC,CAEP,CAEA,MAAM,iBAAiC,CACrCS,EAAO,KAAK,qBAAuB,IAAI,EACvC,MAAM,KAAK,oBAAoB,OAAO,CACxC,CAEA,MAAM,eAAeP,EAAgC,CACnDO,EAAO,KAAK,iBAAmB,IAAI,EACnC,KAAK,mBAAmB,IAAIP,CAAO,CACrC,CAEA,MAAM,oBAAoBA,EAAgC,CACxDO,EAAO,KAAK,iBAAmB,IAAI,EACnCA,EAAO,KAAK,oBAAsB,IAAI,EACtC,KAAK,mBAAmB,MAAMP,CAAO,EACrC,MAAM,KAAK,gBAAgB,YAAYA,CAAO,CAChD,CAEA,WAAWI,EAA4B,CACrCG,EAAO,KAAK,iBAAmB,IAAI,EACnC,KAAK,gBAAgB,IAAIH,CAAK,CAChC,CAEA,MAAM,SAASR,EAAqC,CAClDW,EAAO,KAAK,qBAAuB,IAAI,EACvC,MAAM,KAAK,oBAAoB,QAAQX,CAAI,EAC3C,MAAM,KAAK,oBAAoB,QAAQ,EAEvCW,EAAO,KAAK,iBAAmB,IAAI,EACnC,KAAK,gBAAgB,MAAM,CAC7B,CAEA,MAAa,CACXA,EAAO,KAAK,iBAAmB,IAAI,EACnC,IAAMG,EAAM,KAAK,gBAAgB,UACjC,KAAK,gBAAgB,QAAQA,CAAG,EAChC,aAAa,QACXC,GACE,KAAK,YACL,KAAK,SACL,KAAK,gBAAgB,aAAa,KAAK,MAAQ,EACjD,EACAD,CACF,CACF,CAEA,QAAe,CACbH,EAAO,KAAK,iBAAmB,IAAI,EACnC,KAAK,gBAAgB,UAAU,CACjC,CAEA,SAAgB,CACd,KAAK,gBAAgB,QAAQ,EAC7B,KAAK,oBAAoB,QAAQ,EACjC,KAAK,gBAAgB,QAAQ,CAC/B,CAEA,SAAgB,CACdA,EAAO,KAAK,qBAAuB,IAAI,EACvC,KAAK,oBAAoB,QAAQ,EAAE,MAAOT,GAAQ,CAChD,QAAQ,MAAM,mDAAoDA,CAAG,CACvE,CAAC,CACH,CAEA,YAAYc,EAAwB,CAC9B,KAAK,iBAAmB,OAC1B,KAAK,gBAAgB,SAAWA,GAE9B,KAAK,oBAAsB,OAC7B,KAAK,mBAAmB,SAAWA,EAEvC,CAEA,QAAQR,EAA4B,CAClC,KAAK,WAAWA,CAAK,CACvB,CACF,EAmBA,eAAsBS,GACpB7B,EACyB,CACzB,IAAMM,EAAe,MAAMwB,GAAgB9B,EAAQ,UAAU,EACvD+B,EAAmB,IAAI,IACvBC,EAAchC,EAAQ,QAE5B,OAAW,CAACiC,EAAMrB,CAAI,IAAKN,EAAa,QAAQ,EAAG,CACjD,MAAI,aAAS0B,CAAW,IAAM,KAAO,CAACC,EAAK,WAAWD,CAAW,EAC/D,SAGF,IAAME,EAAalC,EAAQ,MAAM,KAAMY,GAASA,EAAK,OAASqB,CAAI,EAMlE,GAJIC,GAAc,MAChBX,EAAOX,EAAK,OAAS,MAAM,EAGzBA,EAAK,OAAS,OAChB,SAKF,GAFAmB,EAAiB,IAAIE,EAAMrB,CAAI,EAE3BsB,GAAY,UAAY,KAAM,CAChC,CACE,IAAMC,EAAc,IAAI,YACxBvB,EAAK,KAAOuB,EAAY,OAAOD,EAAW,QAAQ,CACpD,CACA,CACE,IAAMC,EAAc,IAAI,YACxBvB,EAAK,SAAWuB,EAAY,OAAOD,EAAW,QAAQ,CACxD,CACF,CAGA,IAAME,EAAST,GAAU3B,EAAQ,WAAYA,EAAQ,QAASiC,CAAI,EAC5DI,EAAO,OAAO,aAAa,QAAQD,CAAM,EAC/C,GAAIC,GAAQ,KAEV,SAGF,IAAMF,EAAc,IAAI,YACxBvB,EAAK,KAAOuB,EAAY,OAAOE,CAAI,CACrC,CAEA,OAAO,IAAIvC,GAAe,CACxB,GAAGE,EACH,aAAc+B,CAChB,CAAC,CACH,CAEA,SAASJ,GACPW,EACApC,EACAqC,EACQ,CAER,MAAO,GADU,IAAI,IAAID,CAAU,EAAE,QACnB,KAAKpC,CAAO,KAAKqC,CAAQ,EAC7C", "names": ["require_eventemitter3", "__commonJSMin", "exports", "module", "has", "prefix", "Events", "EE", "fn", "context", "once", "addListener", "emitter", "event", "listener", "evt", "clearEvent", "EventEmitter", "names", "events", "name", "handlers", "l", "ee", "listeners", "a1", "a2", "a3", "a4", "a5", "len", "args", "i", "length", "j", "require_path_browserify", "__commonJSMin", "exports", "module", "assertPath", "path", "normalizeStringPosix", "allowAboveRoot", "res", "lastSegmentLength", "lastSlash", "dots", "code", "i", "lastSlashIndex", "_format", "sep", "pathObject", "dir", "base", "posix", "resolvedPath", "resolvedAbsolute", "cwd", "isAbsolute", "trailingSeparator", "joined", "arg", "from", "to", "fromStart", "fromEnd", "fromLen", "toStart", "toEnd", "toLen", "length", "lastCommonSep", "fromCode", "toCode", "out", "hasRoot", "end", "matchedSlash", "ext", "start", "extIdx", "firstNonSlashEnd", "startDot", "startPart", "preDotState", "ret", "require_eventemitter3", "__commonJSMin", "exports", "module", "has", "prefix", "Events", "EE", "fn", "context", "once", "addListener", "emitter", "event", "listener", "evt", "clearEvent", "EventEmitter", "names", "events", "name", "handlers", "l", "ee", "listeners", "a1", "a2", "a3", "a4", "a5", "len", "args", "i", "length", "j", "getCharacterFromPosition", "text", "position", "currentLine", "currentColumn", "ci", "getPositionFromCharacter", "character", "getDiagnosticSeverity", "severity", "createLsp", "config", "lspBus", "import_index", "EventEmitter", "lspView", "nextVersionId", "autocompletion", "onClientCommand", "getData", "jsonRpcClient", "JsonRpc", "LspPlugin", "view", "update", "lspLinter", "diagnostics", "localVersion", "request", "onNotification", "notification", "onPublishDiagnostics", "diagnostic", "transitionSpec", "transaction", "jsonRpc", "json", "elements", "el", "import_lint", "import_view", "require_eventemitter3", "eventemitter3_default", "JsonRpcError", "__commonJS", "exports", "module", "has", "prefix", "Events", "EE", "fn", "context", "once", "addListener", "emitter", "event", "listener", "evt", "clearEvent", "names", "events", "name", "handlers", "i", "l", "ee", "listeners", "a1", "a2", "a3", "a4", "a5", "len", "args", "length", "j", "__toESM", "message", "options", "cause", "code", "response", "resolve", "reject", "err", "id", "formattedRequest", "removeListeners", "onResponse", "onError", "error", "requests", "onBatch", "responses", "receivedResponses", "checkSide", "side", "pos", "from", "to", "enterUnfinishedNodesBefore", "node", "scan", "last", "resolveNode", "overlays", "_a", "parent", "TreeNode", "mode", "IterMode", "inner", "getChildren", "type", "before", "after", "cur", "result", "matchNodeContext", "context", "i", "p", "hasChild", "tree", "ch", "TreeBuffer", "buildTree", "data", "buffer", "nodeSet", "maxBufferLength", "reused", "minRepeatType", "cursor", "FlatBufferCursor", "types", "contextHash", "lookAhead", "takeNode", "parentStart", "minPos", "children", "positions", "inRepeat", "id", "start", "end", "size", "lookAheadAtStart", "startPos", "findBufferSize", "endPos", "index", "copyToBuffer", "localChildren", "localPositions", "localInRepeat", "lastGroup", "lastEnd", "makeRepeatLeaf", "make", "makeBalanced", "balanceRange", "makeTree", "length", "lastI", "lookAheadProp", "Tree", "NodeProp", "base", "props", "pair", "maxSize", "fork", "skip", "minStart", "nodeSize", "localSkipped", "nodeStart", "bufferStart", "startIndex", "balanceType", "nodeSizeCache", "child", "mkTop", "mkTree", "total", "maxChild", "divide", "offset", "groupFrom", "groupStart", "groupSize", "nextSize", "only", "nextPropID", "Range", "noProps", "NodeType", "NodeSet", "CachedNode", "CachedInnerNode", "BufferContext", "BufferNode", "TreeCursor", "Parser", "StringInput", "stoppedInner", "init_dist", "__esmMin", "config", "match", "str", "_NodeType", "name", "flags", "spec", "src", "prop", "group", "map", "direct", "groups", "found", "_NodeSet", "newTypes", "newProps", "source", "add", "_Tree", "value", "mounted", "scope", "enter", "leave", "anon", "c", "entered", "_FlatBufferCursor", "_TreeBuffer", "set", "endIndex", "dir", "pick", "startI", "endI", "b", "copy", "len", "j", "_TreeNode", "_tree", "_parent", "e", "next", "rPos", "val", "r", "_BufferNode", "n", "d", "cache", "depth", "mustLeave", "input", "fragments", "ranges", "parse", "done", "string", "decodeArray", "input", "Type", "array", "pos", "out", "value", "next", "stop", "digit", "readToken", "data", "stack", "group", "precTable", "precOffset", "state", "groupMask", "dialect", "scan", "accEnd", "i", "term", "overrides", "low", "high", "mid", "index", "from", "to", "findOffset", "start", "token", "prev", "tableData", "tableOffset", "iPrev", "cutAt", "tree", "side", "cursor", "IterMode", "pushStackDedup", "newStacks", "other", "pair", "off", "findFinished", "stacks", "best", "stopped", "getSpecializer", "spec", "mask", "Stack", "StackContext", "Recover", "SimulatedStack", "StackBufferCursor", "CachedToken", "nullToken", "InputStream", "TokenGroup", "LocalTokenGroup", "ExternalTokenizer", "verbose", "stackIDs", "Safety", "FragmentCursor", "TokenCache", "Rec", "Parse", "Dialect", "id", "ContextTracker", "LRParser", "init_dist", "__esmMin", "_Stack", "p", "reducePos", "score", "buffer", "bufferBase", "curContext", "lookAhead", "parent", "_", "cx", "action", "_a", "depth", "type", "parser", "dPrec", "base", "size", "count", "baseStateID", "end", "isReduce", "cur", "top", "nextEnd", "nextState", "isNode", "sim", "nextStates", "v", "result", "s", "reduce", "target", "backup", "seen", "explore", "rDepth", "found", "dialectID", "last", "context", "newCx", "tracker", "goto", "_StackBufferCursor", "ranges", "offset", "assoc", "range", "idx", "resolved", "endOffset", "chunk", "chunkPos", "nextChunk", "n", "r", "elseToken", "skipped", "atEof", "nextPos", "options", "fragments", "nodeSet", "fr", "Tree", "NodeProp", "stream", "actionIndex", "main", "tokenizers", "tokenizer", "startIndex", "set", "stoppedTokens", "tok", "finished", "maxRemaining", "b", "outer", "j", "split", "strictCx", "cxHash", "cached", "match", "inner", "defaultReduce", "actions", "localStack", "tokens", "restarted", "tokenEnd", "force", "forceBase", "insert", "source", "flags", "disabled", "x", "_LRParser", "Parser", "nodeNames", "topTerms", "nodeProps", "setProp", "nodeID", "prop", "propSpec", "NodeSet", "name", "NodeType", "tokenArray", "parse", "w", "loose", "table", "groupTag", "terminal", "slot", "flag", "a", "deflt", "config", "copy", "info", "t", "prec", "values", "part", "sameArray", "a", "b", "x", "i", "powerSet", "array", "sets", "j", "e", "styleTags", "spec", "byName", "prop", "tags", "part", "pieces", "mode", "rest", "pos", "m", "next", "last", "inner", "rule", "Rule", "ruleNodeProp", "tagHighlighter", "options", "map", "style", "tag", "scope", "all", "cls", "sub", "tagClass", "nextTagID", "Tag", "nextModifierID", "Modifier", "t", "comment", "name", "typeName", "propertyName", "literal", "string", "number", "content", "heading", "keyword", "operator", "punctuation", "bracket", "meta", "classHighlighter", "init_dist", "__esmMin", "_Tag", "set", "base", "modified", "parent", "mod", "_Modifier", "mods", "exists", "configs", "config", "NodeProp", "context", "other", "toSet", "chars", "flat", "words", "prefixMatch", "options", "first", "rest", "label", "i", "source", "completeFromList", "list", "o", "validFor", "match", "context", "token", "ifNotIn", "nodes", "pos", "import_state", "import_view", "import_language", "closedBracket", "android", "init_dist", "__esmMin", "isLineBreak", "ch", "newline", "carriageReturn", "countIndent", "space", "depth", "i", "tab", "checkSide", "side", "pos", "from", "to", "enterUnfinishedNodesBefore", "node", "scan", "last", "resolveNode", "overlays", "_a", "parent", "TreeNode", "mode", "IterMode", "inner", "getChildren", "type", "before", "after", "cur", "result", "matchNodeContext", "context", "p", "hasChild", "tree", "TreeBuffer", "buildTree", "data", "buffer", "nodeSet", "maxBufferLength", "DefaultBufferLength", "reused", "minRepeatType", "cursor", "FlatBufferCursor", "types", "contextHash", "lookAhead", "takeNode", "parentStart", "minPos", "children", "positions", "inRepeat", "id", "start", "end", "size", "lookAheadAtStart", "startPos", "findBufferSize", "endPos", "index", "copyToBuffer", "localChildren", "localPositions", "localInRepeat", "lastGroup", "lastEnd", "makeRepeatLeaf", "make", "makeBalanced", "balanceRange", "makeTree", "length", "lastI", "lookAheadProp", "Tree", "NodeProp", "base", "props", "pair", "maxSize", "fork", "skip", "minStart", "nodeSize", "localSkipped", "nodeStart", "bufferStart", "startIndex", "balanceType", "nodeSizeCache", "child", "mkTop", "mkTree", "total", "maxChild", "divide", "offset", "groupFrom", "groupStart", "groupSize", "nextSize", "only", "defID", "def", "outer", "localCompletionSource", "indentBody", "line", "gdscript", "gdscriptLanguage", "globalCompletion", "import_language", "indent", "dedent", "blankLineStart", "newlineBracketed", "eof", "ParenL", "CallParamsLiteralExpressionNode", "CallParamsExpressionNode", "ArrayExpressionNode", "BracketL", "CallExpressionNode", "DictionaryExpressionNode", "BraceL", "GroupedExpressionNode", "CallParamsParameterNode", "bracketed", "hash", "IndentLevel", "topIndent", "newlines", "trackIndent", "indentation", "gdscriptHighlighting", "spec_Identifier", "parser", "nextPropID", "noProps", "NodeType", "CachedNode", "CachedInnerNode", "BufferContext", "BufferNode", "TreeCursor", "NodeWeakMap", "stoppedInner", "cache", "gatherCompletions", "dontComplete", "globals", "snippets", "init_dist", "ExternalTokenizer", "input", "stack", "prev", "spaces", "ContextTracker", "term", "contextDepth", "chars", "styleTags", "tags", "LRParser", "value", "config", "match", "str", "_NodeType", "name", "flags", "spec", "src", "prop", "group", "map", "direct", "groups", "found", "_Tree", "mounted", "scope", "enter", "leave", "anon", "c", "entered", "_FlatBufferCursor", "_TreeBuffer", "set", "endIndex", "dir", "pick", "startI", "endI", "b", "copy", "len", "j", "_TreeNode", "_tree", "_parent", "e", "next", "rPos", "val", "r", "_BufferNode", "n", "d", "mustLeave", "ifNotIn", "completeFromList", "endBody", "bodyIndent", "state", "getFreezeRanges", "state", "startFreezeComment", "endFreezeComment", "cursor", "commentTokens", "freezeRanges", "currentRangeFrom", "fromOffset", "toOffset", "text", "comment", "commentToken", "createSetRangeFromSelectionRange", "range", "setRange", "i", "removeFromSetRange", "rangeToRemove", "numbersToRemove", "numberToRemove", "createSelectionRangesFromSetRange", "elements", "a", "b", "min", "previousValue", "currentValue", "currentIndex", "max", "selectionRanges", "selectionRange", "element", "getFreezeTransactionFilter", "transaction", "ignoreChanges", "fromA", "toA", "fromB", "toB", "inserted", "diff", "EditorSelection", "freezeRange", "ranges", "selection", "selectionRangeSet", "findHasFromZero", "fromZeroRange", "freezeDecoration", "view", "builder", "from", "to", "pos", "line", "frozenDecoration", "getFreezeViewPlugin", "FreezeViewPlugin", "value", "freeze", "startFreezeCommentOf", "_startFreezeComment", "endFreezeCommentOf", "_endFreezeComment", "freezeTransactionFilter", "freezeViewPlugin", "freezeTheme", "import_state", "import_view", "import_language", "values", "update", "require_format", "__commonJSMin", "exports", "module", "format", "fmt", "re", "args", "match", "escaped", "ptn", "flag", "arg", "src_exports", "__export", "createMainController", "__toCommonJS", "import_index", "import_path_browserify", "import_eventemitter3", "TimeoutError", "message", "AbortError", "getDOMException", "errorMessage", "getAbortedReason", "signal", "reason", "pTimeout", "promise", "milliseconds", "fallback", "options", "timer", "cancelablePromise", "resolve", "reject", "error", "timeoutError", "lowerBound", "array", "value", "comparator", "first", "count", "step", "it", "__classPrivateFieldGet", "receiver", "state", "kind", "f", "_PriorityQueue_queue", "PriorityQueue", "run", "options", "element", "index", "lowerBound", "a", "b", "item", "__classPrivateFieldSet", "receiver", "state", "value", "kind", "f", "__classPrivateFieldGet", "_PQueue_instances", "_PQueue_carryoverConcurrencyCount", "_PQueue_isIntervalIgnored", "_PQueue_intervalCount", "_PQueue_intervalCap", "_PQueue_interval", "_PQueue_intervalEnd", "_PQueue_intervalId", "_PQueue_timeoutId", "_PQueue_queue", "_PQueue_queueClass", "_PQueue_pending", "_PQueue_concurrency", "_PQueue_isPaused", "_PQueue_throwOnTimeout", "_PQueue_doesIntervalAllowAnother_get", "_PQueue_doesConcurrentAllowAnother_get", "_PQueue_next", "_PQueue_onResumeInterval", "_PQueue_isIntervalPaused_get", "_PQueue_tryToStartAnother", "_PQueue_initializeIntervalIfNeeded", "_PQueue_onInterval", "_PQueue_processQueue", "_PQueue_throwOnAbort", "_PQueue_onEvent", "AbortError", "PQueue", "EventEmitter", "options", "_a", "_b", "_c", "_d", "PriorityQueue", "newConcurrency", "function_", "resolve", "reject", "operation", "pTimeout", "result", "error", "TimeoutError", "functions", "limit", "now", "delay", "canInitializeInterval", "job", "signal", "_resolve", "event", "filter", "listener", "import_path_browserify", "import_codemirror", "import_view", "import_state", "import_commands", "import_language", "import_lint", "init_dist", "import_view", "import_language", "import_state", "require_color_name", "__commonJS", "exports", "module", "require_is_arrayish", "obj", "require_simple_swizzle", "isArrayish", "concat", "slice", "swizzle", "args", "results", "i", "len", "arg", "fn", "require_color_string", "colorNames", "hasOwnProperty", "reverseNames", "name", "cs", "string", "prefix", "val", "model", "abbr", "hex", "rgba", "per", "keyword", "rgb", "match", "hexAlpha", "i2", "clamp", "hsl", "alpha", "h", "s", "l", "a", "hwb", "w", "b", "hexDouble", "r", "g", "hsla", "hwba", "num", "min", "max", "str", "require_conversions", "cssKeywords", "reverseKeywords", "key", "convert", "channels", "labels", "delta", "rdif", "gdif", "bdif", "v", "diff", "diffc", "c", "k", "m", "y", "comparativeDistance", "x", "reversed", "currentClosestDistance", "currentClosestKeyword", "value", "distance", "z", "xyz", "t2", "t3", "t1", "smin", "lmin", "sv", "hsv", "hi", "p", "q", "t", "vmin", "sl", "wh", "bl", "ratio", "n", "cmyk", "lab", "y2", "x2", "z2", "lch", "hr", "saturation", "ansi", "color", "mult", "rem", "colorString", "char", "integer", "chroma", "grayscale", "hue", "f", "hcg", "pure", "mg", "apple", "gray", "require_route", "conversions", "buildGraph", "graph", "models", "deriveBFS", "fromModel", "queue", "current", "adjacents", "adjacent", "node", "link", "from", "to", "wrapConversion", "toModel", "path", "cur", "conversion", "require_color_convert", "route", "wrapRaw", "wrappedFn", "arg0", "wrapRounded", "result", "routes", "require_color", "skippedModels", "hashedModelKeys", "limiters", "Color", "object", "newArray", "zeroArray", "keys", "hashedKeys", "limit", "places", "self", "roundToPlace", "getset", "maxfn", "rgbArray", "alphaHex", "lum", "element", "chan", "color2", "lum1", "lum2", "contrastRatio", "degrees", "mixinColor", "weight", "color1", "w1", "w2", "assertArray", "roundTo", "number", "channel", "modifier", "array", "length", "DefaultBufferLength", "nextPropID", "NodeProp", "config", "NodeType", "type", "noProps", "_NodeType", "props", "id", "flags", "spec", "src", "prop", "group", "map", "direct", "groups", "found", "CachedNode", "CachedInnerNode", "IterMode", "Tree", "_Tree", "children", "positions", "mounted", "ch", "mode", "TreeCursor", "pos", "side", "scope", "cursor", "TreeNode", "resolveNode", "enter", "leave", "anon", "entered", "balanceRange", "data", "buildTree", "FlatBufferCursor", "_FlatBufferCursor", "buffer", "index", "TreeBuffer", "_TreeBuffer", "set", "endIndex", "startIndex", "dir", "pick", "checkSide", "startI", "endI", "copy", "j", "enterUnfinishedNodesBefore", "scan", "last", "overlays", "_a", "parent", "inner", "_TreeNode", "_tree", "_parent", "e", "next", "start", "BufferNode", "BufferContext", "hasChild", "rPos", "before", "after", "getChildren", "context", "matchNodeContext", "_BufferNode", "parentStart", "d", "child", "cache", "depth", "mustLeave", "types", "tree", "nodeSet", "maxBufferLength", "reused", "minRepeatType", "contextHash", "lookAhead", "takeNode", "minPos", "inRepeat", "end", "size", "lookAheadAtStart", "startPos", "findBufferSize", "endPos", "copyToBuffer", "localChildren", "localPositions", "localInRepeat", "lastGroup", "lastEnd", "makeRepeatLeaf", "make", "makeBalanced", "makeTree", "lastI", "lookAheadProp", "base", "pair", "maxSize", "fork", "skip", "minStart", "nodeSize", "localSkipped", "nodeStart", "bufferStart", "nodeSizeCache", "balanceType", "mkTop", "mkTree", "total", "maxChild", "divide", "offset", "groupFrom", "groupStart", "groupSize", "nextSize", "only", "stoppedInner", "nextTagID", "Tag", "_Tag", "modified", "tag", "mod", "Modifier", "nextModifierID", "_Modifier", "mods", "exists", "sameArray", "configs", "powerSet", "sets", "ruleNodeProp", "Rule", "tags", "other", "tagHighlighter", "options", "style", "all", "cls", "sub", "tagClass", "comment", "typeName", "propertyName", "literal", "content", "heading", "operator", "punctuation", "bracket", "meta", "classHighlighter", "Highlighting", "import_color", "__toESM", "invertLightness", "baseColor", "BORDER_RADIUS", "SCROLLBAR_DIMENSIONS", "SCROLLBAR_THUMB_BORDER_RADIUS", "BACKGROUND_COLOR_ACTIVE", "gdExerciseThemeLight", "gdExerciseThemeDark", "def", "defInvert", "colorDef", "gdExerciseHighlightStyleDark", "gdExerciseHighlightDark", "gdExerciseHighlightStyleLight", "gdExerciseHighlightLight", "import_path_browserify", "extractArray", "array", "flatArray", "length", "value", "a", "b", "_dist_code", "Tree", "that", "gen_bitlen", "s", "tree", "stree", "extra", "base", "max_length", "h", "n", "m", "bits", "xbits", "f", "overflow", "bi_reverse", "code", "len", "res", "gen_codes", "max_code", "bl_count", "next_code", "elems", "node", "dist", "StaticTree", "static_tree", "extra_bits", "extra_base", "static_ltree2_first_part", "static_ltree2_second_part", "index", "static_dtree_first_part", "static_dtree_second_part", "MAX_MEM_LEVEL", "DEF_MEM_LEVEL", "Config", "good_length", "max_lazy", "nice_length", "max_chain", "func", "STORED", "FAST", "SLOW", "config_table", "z_errmsg", "NeedMore", "BlockDone", "FinishStarted", "FinishDone", "PRESET_DICT", "INIT_STATE", "BUSY_STATE", "FINISH_STATE", "Z_DEFLATED", "STORED_BLOCK", "STATIC_TREES", "DYN_TREES", "MIN_MATCH", "MAX_MATCH", "MIN_LOOKAHEAD", "smaller", "depth", "tn2", "tm2", "Deflate", "strm", "status", "pending_buf_size", "last_flush", "w_size", "w_bits", "w_mask", "win", "window_size", "prev", "head", "ins_h", "hash_size", "hash_bits", "hash_mask", "hash_shift", "block_start", "match_length", "prev_match", "match_available", "strstart", "match_start", "lookahead", "prev_length", "max_chain_length", "max_lazy_match", "level", "strategy", "good_match", "nice_match", "dyn_ltree", "dyn_dtree", "bl_tree", "l_desc", "d_desc", "bl_desc", "lit_bufsize", "last_lit", "matches", "last_eob_len", "bi_buf", "bi_valid", "lm_init", "i", "init_block", "tr_init", "k", "heap", "v", "j", "scan_tree", "prevlen", "curlen", "nextlen", "count", "max_count", "min_count", "build_bl_tree", "max_blindex", "put_byte", "p", "put_short", "w", "putShortMSB", "send_bits", "val", "send_code", "c", "c2", "send_tree", "send_all_trees", "lcodes", "dcodes", "blcodes", "rank", "bi_flush", "_tr_align", "_tr_tally", "lc", "out_length", "in_length", "dcode", "compress_block", "ltree", "dtree", "lx", "bi_windup", "copy_block", "buf", "header", "_tr_stored_block", "stored_len", "eof", "_tr_flush_block", "opt_lenb", "static_lenb", "flush_block_only", "fill_window", "more", "deflate_stored", "flush", "max_block_size", "max_start", "longest_match", "cur_match", "chain_length", "scan", "match", "best_len", "limit", "_nice_match", "wmask", "strend", "scan_end1", "scan_end", "deflate_fast", "hash_head", "bflush", "deflate_slow", "max_insert", "deflateReset", "_level", "_method", "memLevel", "_strategy", "err", "_strm", "dictionary", "dictLength", "level_flags", "old_flush", "bstate", "ZStream", "ret", "start", "size", "ZipDeflate", "options", "z", "bufsize", "getMaximumCompressedSize", "data", "onprogress", "lastIndex", "bufferIndex", "bufferSize", "buffers", "chunk", "uncompressedSize", "inflate_mask", "MANY", "Z_NO_FLUSH", "Z_FINISH", "fixed_bl", "fixed_bd", "fixed_tl", "fixed_td", "cplens", "cplext", "cpdist", "cpdext", "BMAX", "InfTree", "that", "hn", "v", "c", "r", "u", "x", "huft_build", "b", "bindex", "n", "s", "d", "e", "t", "hp", "a", "f", "g", "h", "i", "j", "k", "l", "mask", "p", "q", "w", "xp", "y", "z", "initWorkArea", "vsize", "bb", "tb", "result", "nl", "nd", "bl", "bd", "tl", "td", "START", "LEN", "LENEXT", "DIST", "DISTEXT", "COPY", "LIT", "WASH", "END", "BADCODE", "InfCodes", "mode", "len", "tree", "tree_index", "need", "lit", "get", "dist", "lbits", "dbits", "ltree", "ltree_index", "dtree", "dtree_index", "inflate_fast", "tl_index", "td_index", "tp", "tp_index", "m", "ml", "md", "tp_index_t_3", "tindex", "border", "TYPE", "LENS", "STORED", "TABLE", "BTREE", "DTREE", "CODES", "DRY", "DONELOCKS", "BADBLOCKS", "InfBlocks", "left", "table", "index", "blens", "codes", "last", "hufts", "check", "inftree", "bl_", "bd_", "tl_", "td_", "start", "PRESET_DICT", "Z_DEFLATED", "METHOD", "FLAG", "DICT4", "DICT3", "DICT2", "DICT1", "DICT0", "BLOCKS", "DONE", "BAD", "mark", "Inflate", "inflateReset", "istate", "dictionary", "dictLength", "length", "ZStream", "bits", "ret", "size", "ZipInflate", "options", "bufsize", "flush", "buf", "nomoreinput", "data", "onprogress", "buffers", "err", "array", "lastIndex", "bufferIndex", "bufferSize", "chunk", "DIRECTORY_SIGNATURE", "MAX_DATE", "MIN_DATE", "UNDEFINED_VALUE", "UNDEFINED_TYPE", "FUNCTION_TYPE", "StreamAdapter", "Codec", "_format", "options", "codec", "chunk", "controller", "MINIMUM_CHUNK_SIZE", "maxWorkers", "UNDEFINED_TYPE", "DEFAULT_CONFIGURATION", "UNDEFINED_VALUE", "config", "getConfiguration", "config", "getChunkSize", "MINIMUM_CHUNK_SIZE", "configure", "configuration", "baseURL", "chunkSize", "maxWorkers", "terminateWorkerTimeout", "useCompressionStream", "useWebWorkers", "Deflate", "Inflate", "CompressionStream", "DecompressionStream", "workerScripts", "setIfDefined", "StreamAdapter", "UNDEFINED_VALUE", "deflate", "inflate", "propertyName", "propertyValue", "table", "mimeTypes", "type", "subtype", "value", "indexMimeType", "table", "i", "t", "j", "Crc32", "crc", "data", "offset", "length", "Crc32Stream", "stream", "crc32", "Crc32", "chunk", "controller", "value", "encodeText", "value", "result", "i", "bitArray", "a1", "a2", "last", "shift", "a", "l", "x", "len", "_end", "carry", "out", "i", "last2", "shift2", "codec", "arr", "byteLength", "tmp", "bytes", "hash", "sha1", "data", "b", "ol", "nl", "c", "j", "h", "t", "d", "words", "w", "e", "cipher", "key", "aes", "sbox", "decTable", "keyLen", "encKey", "decKey", "rcon", "encTable", "sboxInv", "th", "xInv", "x2", "x4", "x8", "s", "tDec", "tEnc", "input", "dir", "nInnerRounds", "table", "t0", "t1", "t2", "t3", "kIndex", "b2", "c2", "random", "typedArray", "r", "m_w", "m_z", "mask", "rcache", "_r", "mode", "prf", "iv", "word", "b1", "b3", "counter", "bl", "misc", "password", "salt", "count", "length", "u", "ui", "k", "arrayBuffer", "outLength", "hmac", "Hash", "exKey", "bs", "result", "GET_RANDOM_VALUES_SUPPORTED", "ERR_INVALID_PASSWORD", "ERR_INVALID_SIGNATURE", "ERR_ABORT_CHECK_PASSWORD", "getRandomValues", "array", "GET_RANDOM_VALUES_SUPPORTED", "random", "BLOCK_LENGTH", "RAW_FORMAT", "PBKDF2_ALGORITHM", "HASH_ALGORITHM", "HASH_FUNCTION", "BASE_KEY_ALGORITHM", "DERIVED_BITS_ALGORITHM", "DERIVED_BITS_USAGE", "SALT_LENGTH", "KEY_LENGTH", "SIGNATURE_LENGTH", "COUNTER_DEFAULT_VALUE", "UNDEFINED_TYPE", "FUNCTION_TYPE", "CRYPTO_API_SUPPORTED", "subtle", "SUBTLE_API_SUPPORTED", "codecBytes", "codec", "Aes", "cipher", "CtrGladman", "mode", "HmacSha1", "misc", "IMPORT_KEY_SUPPORTED", "DERIVE_BITS_SUPPORTED", "AESDecryptionStream", "password", "signed", "encryptionStrength", "checkPasswordOnly", "resolve", "chunk", "controller", "aesCrypto", "strength", "resolveReady", "ready", "createDecryptionKeys", "subarray", "ERR_ABORT_CHECK_PASSWORD", "output", "append", "ctr", "hmac", "pending", "chunkToDecrypt", "originalSignature", "decryptedChunkArray", "encryptedChunk", "toBits", "decryptedChunk", "fromBits", "signature", "indexSignature", "ERR_INVALID_SIGNATURE", "AESEncryptionStream", "stream", "preamble", "createEncryptionKeys", "encryptedChunkArray", "concat", "append", "aesCrypto", "input", "output", "paddingStart", "paddingEnd", "verifySignature", "ctr", "hmac", "pending", "inputLength", "concat", "expand", "BLOCK_LENGTH", "offset", "inputChunk", "toBits", "codecBytes", "subarray", "outputChunk", "fromBits", "createDecryptionKeys", "decrypt", "strength", "password", "preamble", "passwordVerificationKey", "createKeys", "SALT_LENGTH", "passwordVerification", "ERR_INVALID_PASSWORD", "createEncryptionKeys", "encrypt", "salt", "getRandomValues", "encodedPassword", "encodeText", "baseKey", "importKey", "RAW_FORMAT", "BASE_KEY_ALGORITHM", "DERIVED_BITS_USAGE", "derivedBits", "deriveBits", "DERIVED_BITS_ALGORITHM", "KEY_LENGTH", "compositeKey", "key", "authentication", "CtrGladman", "Aes", "COUNTER_DEFAULT_VALUE", "HmacSha1", "format", "algorithm", "extractable", "keyUsages", "IMPORT_KEY_SUPPORTED", "subtle", "misc", "length", "DERIVE_BITS_SUPPORTED", "leftArray", "rightArray", "array", "inputArray", "begin", "end", "chunk", "HEADER_LENGTH", "ZipCryptoDecryptionStream", "password", "passwordVerification", "checkPasswordOnly", "createKeys", "chunk", "controller", "zipCrypto", "decryptedHeader", "decrypt", "ERR_INVALID_PASSWORD", "ERR_ABORT_CHECK_PASSWORD", "ZipCryptoEncryptionStream", "output", "offset", "header", "getRandomValues", "encrypt", "decrypt", "target", "input", "output", "index", "getByte", "updateKeys", "encrypt", "createKeys", "password", "keys", "Crc32", "byte", "key0", "key1", "key2", "getInt32", "getInt8", "temp", "number", "COMPRESSION_FORMAT", "DeflateStream", "options", "chunkSize", "CompressionStream", "CompressionStreamNative", "compressed", "encrypted", "useCompressionStream", "zipCrypto", "signed", "level", "stream", "crc32Stream", "encryptionStream", "readable", "filterEmptyChunks", "Crc32Stream", "pipeThrough", "pipeThroughCommpressionStream", "ZipCryptoEncryptionStream", "AESEncryptionStream", "setReadable", "signature", "InflateStream", "DecompressionStream", "DecompressionStreamNative", "decryptionStream", "ZipCryptoDecryptionStream", "AESDecryptionStream", "dataViewSignature", "ERR_INVALID_SIGNATURE", "filterEmptyChunks", "readable", "pipeThrough", "chunk", "controller", "setReadable", "stream", "flush", "pipeThroughCommpressionStream", "useCompressionStream", "options", "CodecStreamNative", "CodecStream", "CompressionStream", "COMPRESSION_FORMAT", "error", "transformStream", "MESSAGE_EVENT_TYPE", "MESSAGE_START", "MESSAGE_PULL", "MESSAGE_DATA", "MESSAGE_ACK_DATA", "MESSAGE_CLOSE", "CODEC_DEFLATE", "CODEC_INFLATE", "CodecStream", "options", "config", "codec", "codecType", "Stream", "CODEC_DEFLATE", "DeflateStream", "CODEC_INFLATE", "InflateStream", "size", "stream", "readable", "transformStream", "chunk", "controller", "signature", "WEB_WORKERS_SUPPORTED", "UNDEFINED_TYPE", "CodecWorker", "workerData", "readable", "writable", "options", "config", "streamOptions", "useWebWorkers", "transferStreams", "scripts", "onTaskFinished", "signal", "ProgressWatcherStream", "worker", "busy", "WEB_WORKERS_SUPPORTED", "createWebWorkerInterface", "createWorkerInterface", "readableSource", "onstart", "onprogress", "size", "onend", "chunkSize", "chunkOffset", "callHandler", "chunk", "controller", "handler", "parameters", "runWorker", "baseURL", "getWebWorker", "runWebWorker", "codecStream", "CodecStream", "signature", "resolveResult", "rejectResult", "result", "resolve", "reject", "closed", "watchClosedStream", "sendMessage", "MESSAGE_START", "resultValue", "writableSource", "writer", "resolveStreamClosed", "reason", "classicWorkersSupported", "transferStreamsSupported", "url", "workerOptions", "scriptUrl", "FUNCTION_TYPE", "MESSAGE_EVENT_TYPE", "event", "onMessage", "message", "value", "transferables", "error", "data", "type", "messageId", "reader", "stack", "code", "name", "responseError", "close", "MESSAGE_PULL", "done", "MESSAGE_DATA", "MESSAGE_ACK_DATA", "MESSAGE_CLOSE", "pool", "pendingRequests", "indexWorker", "runWorker", "stream", "workerOptions", "options", "config", "transferStreams", "useWebWorkers", "useCompressionStream", "codecType", "compressed", "signed", "encrypted", "workerScripts", "maxWorkers", "terminateWorkerTimeout", "UNDEFINED_VALUE", "streamCopy", "worker", "workerData", "pool", "clearTerminateTimeout", "CodecWorker", "onTaskFinished", "resolve", "pendingRequests", "data", "terminateTimeout", "e", "t", "ERR_ITERATOR_COMPLETED_TOO_SOON", "HTTP_HEADER_CONTENT_TYPE", "DEFAULT_CHUNK_SIZE", "PROPERTY_NAME_WRITABLE", "Stream", "Reader", "reader", "chunkSize", "readable", "controller", "offset", "size", "diskNumberStart", "chunkOffset", "readUint8Array", "BlobReader", "Reader", "blob", "offset", "length", "reader", "offsetEnd", "arrayBuffer", "BlobWriter", "Stream", "contentType", "writer", "transformStream", "headers", "HTTP_HEADER_CONTENT_TYPE", "PROPERTY_NAME_WRITABLE", "SplitDataReader", "Reader", "readers", "reader", "diskReader", "indexDiskReader", "offset", "length", "diskNumber", "result", "currentDiskNumber", "currentReaderOffset", "currentReader", "currentReaderSize", "readUint8Array", "chunkLength", "SplitDataWriter", "Stream", "writerGenerator", "maxSize", "zipWriter", "diskSourceWriter", "diskWritable", "diskWriter", "writable", "chunk", "availableSize", "writeChunk", "closeDisk", "value", "done", "ERR_ITERATOR_COMPLETED_TOO_SOON", "initStream", "PROPERTY_NAME_WRITABLE", "initStream", "stream", "initSize", "initReader", "reader", "SplitDataReader", "initWriter", "writer", "UNDEFINED_VALUE", "FUNCTION_TYPE", "SplitDataWriter", "writable", "readUint8Array", "offset", "size", "diskNumber", "CP437", "VALID_CP437", "decodeCP437", "stringValue", "VALID_CP437", "result", "indexCharacter", "CP437", "decodeText", "value", "encoding", "decodeCP437", "PROPERTY_NAME_FILENAME", "PROPERTY_NAME_RAW_FILENAME", "PROPERTY_NAME_COMMENT", "PROPERTY_NAME_RAW_COMMENT", "PROPERTY_NAME_UNCOMPPRESSED_SIZE", "PROPERTY_NAME_COMPPRESSED_SIZE", "PROPERTY_NAME_OFFSET", "PROPERTY_NAME_DISK_NUMBER_START", "PROPERTY_NAME_LAST_MODIFICATION_DATE", "PROPERTY_NAME_RAW_LAST_MODIFICATION_DATE", "PROPERTY_NAME_LAST_ACCESS_DATE", "PROPERTY_NAME_RAW_LAST_ACCESS_DATE", "PROPERTY_NAME_CREATION_DATE", "PROPERTY_NAME_RAW_CREATION_DATE", "PROPERTY_NAME_INTERNAL_FILE_ATTRIBUTE", "PROPERTY_NAME_EXTERNAL_FILE_ATTRIBUTE", "PROPERTY_NAME_MS_DOS_COMPATIBLE", "PROPERTY_NAME_ZIP64", "PROPERTY_NAMES", "Entry", "data", "name", "ERR_BAD_FORMAT", "ERR_EOCDR_NOT_FOUND", "ERR_EOCDR_ZIP64_NOT_FOUND", "ERR_EOCDR_LOCATOR_ZIP64_NOT_FOUND", "ERR_CENTRAL_DIRECTORY_NOT_FOUND", "ERR_LOCAL_FILE_HEADER_NOT_FOUND", "ERR_EXTRAFIELD_ZIP64_NOT_FOUND", "ERR_ENCRYPTED", "ERR_UNSUPPORTED_ENCRYPTION", "ERR_UNSUPPORTED_COMPRESSION", "ERR_SPLIT_ZIP_FILE", "CHARSET_UTF8", "CHARSET_CP437", "ZIP64_PROPERTIES", "PROPERTY_NAME_UNCOMPPRESSED_SIZE", "PROPERTY_NAME_COMPPRESSED_SIZE", "PROPERTY_NAME_OFFSET", "PROPERTY_NAME_DISK_NUMBER_START", "ZIP64_EXTRACTION", "getUint32", "getBigUint64", "ZipReader", "reader", "options", "initReader", "getConfiguration", "zipReader", "config", "initStream", "UNDEFINED_VALUE", "BlobReader", "getChunkSize", "endOfDirectoryInfo", "seekSignature", "signatureArray", "readUint8Array", "signatureView", "getDataView", "endOfDirectoryView", "directoryDataLength", "directoryDataOffset", "commentOffset", "commentLength", "getUint16", "appendedDataOffset", "lastDiskNumber", "expectedLastDiskNumber", "diskNumber", "filesLength", "prependedDataLength", "startOffset", "endOfDirectoryLocatorArray", "endOfDirectoryLocatorView", "endOfDirectoryArray", "expectedDirectoryDataOffset", "originalDirectoryDataOffset", "offset", "directoryArray", "directoryView", "expectedDirectoryDataLength", "filenameEncoding", "getOptionValue", "commentEncoding", "indexFile", "fileEntry", "ZipEntry", "readCommonHeader", "languageEncodingFlag", "filenameOffset", "extraFieldOffset", "versionMadeBy", "msDosCompatible", "rawFilename", "endOffset", "rawComment", "filenameUTF8", "commentUTF8", "directory", "getUint8", "offsetFileEntry", "filename", "comment", "decodeText", "DIRECTORY_SIGNATURE", "readCommonFooter", "entry", "Entry", "writer", "onprogress", "extractPrependedData", "extractAppendedData", "entries", "ZipEntry", "reader", "config", "options", "writer", "fileEntry", "zipEntry", "offset", "diskNumberStart", "extraFieldAES", "compressionMethod", "bitFlag", "signature", "rawLastModDate", "uncompressedSize", "compressedSize", "localDirectory", "dataArray", "readUint8Array", "dataView", "getDataView", "password", "getOptionValue", "ERR_UNSUPPORTED_COMPRESSION", "getUint32", "ERR_LOCAL_FILE_HEADER_NOT_FOUND", "readCommonHeader", "readCommonFooter", "encrypted", "zipCrypto", "UNDEFINED_VALUE", "ERR_UNSUPPORTED_ENCRYPTION", "ERR_ENCRYPTED", "dataOffset", "size", "readable", "signal", "checkPasswordOnly", "initWriter", "initStream", "writable", "onstart", "onprogress", "onend", "workerOptions", "CODEC_INFLATE", "outputSize", "runWorker", "error", "ERR_ABORT_CHECK_PASSWORD", "preventClose", "directory", "rawBitFlag", "getUint16", "getDate", "rawExtraField", "extraField", "rawExtraFieldView", "offsetExtraField", "type", "extraFieldZip64", "readExtraFieldZip64", "extraFieldUnicodePath", "readExtraFieldUnicode", "PROPERTY_NAME_FILENAME", "PROPERTY_NAME_RAW_FILENAME", "extraFieldUnicodeComment", "PROPERTY_NAME_COMMENT", "PROPERTY_NAME_RAW_COMMENT", "readExtraFieldAES", "extraFieldNTFS", "readExtraFieldNTFS", "extraFieldExtendedTimestamp", "readExtraFieldExtendedTimestamp", "extraFieldView", "missingProperties", "ZIP64_PROPERTIES", "propertyName", "max", "indexMissingProperty", "extraction", "ZIP64_EXTRACTION", "ERR_EXTRAFIELD_ZIP64_NOT_FOUND", "extraFieldUnicode", "rawPropertyName", "crc32", "Crc32", "dataViewSignature", "getUint8", "decodeText", "strength", "tag1Data", "tagValue", "attributeSize", "tag1View", "rawLastAccessDate", "rawCreationDate", "lastModDate", "getDateNTFS", "lastAccessDate", "creationDate", "extraFieldData", "flags", "timeProperties", "timeRawProperties", "PROPERTY_NAME_LAST_MODIFICATION_DATE", "PROPERTY_NAME_RAW_LAST_MODIFICATION_DATE", "PROPERTY_NAME_LAST_ACCESS_DATE", "PROPERTY_NAME_RAW_LAST_ACCESS_DATE", "PROPERTY_NAME_CREATION_DATE", "PROPERTY_NAME_RAW_CREATION_DATE", "indexProperty", "time", "seekSignature", "startOffset", "minimumBytes", "maximumLength", "signatureArray", "signatureView", "setUint32", "maximumBytes", "seek", "length", "bytes", "indexByte", "zipReader", "name", "timeRaw", "date", "view", "getBigUint64", "value", "array", "EXTRAFIELD_DATA_AES", "import_meta", "baseURL", "configure", "e", "configure", "ZipDeflate", "ZipInflate", "assert", "value", "message", "convertResToAbsolute", "path", "projectId", "RES_PREFIX", "pathWithoutRes", "getProjectFiles", "projectUrl", "files", "response", "data", "zipFileReader", "BlobReader", "zipReader", "ZipReader", "assert", "entry", "file", "writer", "BlobWriter", "blob", "getCompletePath", "projectId", "path", "cloneFile", "file", "data", "original", "ERROR_MESSAGE_FIRST_LINE_REGEX", "ERROR_MESSAGE_MATCH_LINES_REGEX", "CodeController", "EventEmitter", "projectId", "project", "projectUrl", "files", "darkMode", "snippet", "snippetData", "_", "val", "gdExerciseThemeDark", "gdExerciseThemeLight", "gdExerciseHighlightDark", "gdExerciseHighlightLight", "doc", "assert", "changes", "filesToLoad", "fileToLoad", "file", "cloneFile", "gdscript", "createLsp", "data", "emitServerCommand", "jsonRpc", "freeze", "err", "loadedFile", "message", "errorMessage", "lines", "line", "absolutePath", "convertResToAbsolute", "getCharacterFromPosition", "transitionSpec", "transaction", "import_format_util", "import_path_browserify", "AT_ERROR_MESSAGE_REGEX", "SEND_ERROR_MESSAGE_TIMEOUT_MS", "USER_SCRIPT_ERROR_TAG", "GdPlayerController", "EventEmitter", "projectId", "project", "mainScene", "size", "isSnippet", "assert", "status", "mode", "path", "getCompletePath", "args", "current", "total", "arg", "format", "basePath", "file", "filePath", "entry", "addNewCanvas", "import_state", "import_view", "import_state", "import_view", "import_codemirror", "PIXEL_BUFFER", "StickToBottomViewPlugin", "view", "update", "onScroll", "getStickToBottomViewPlugin", "addConsoleError", "from", "to", "change", "consoleErrorField", "errors", "tr", "effect", "consoleErrorMark", "field", "consoleErrorTheme", "consoleErrorLine", "lineNumber", "line", "effects", "console", "stickToBottom", "EditorView", "ConsoleController", "EventEmitter", "darkMode", "value", "val", "gdExerciseThemeDark", "gdExerciseThemeLight", "assert", "console", "message", "insert", "newlines", "lastLine", "i", "consoleErrorLine", "TestController", "EventEmitter", "entry", "MainController", "EventEmitter", "options", "dataUrl", "project", "mainScene", "files", "Engine", "projectFiles", "isDarkMode", "size", "snippet", "codeControllerFiles", "projectFile", "file", "CodeController", "err", "GdPlayerController", "message", "status", "ConsoleController", "TestController", "entry", "event", "_", "assert", "queue", "PQueue", "doc", "getFileId", "enabled", "createMainController", "getProjectFiles", "projectFilesOnly", "projectPath", "path", "optionFile", "textEncoder", "fileId", "item", "projectUrl", "filePath"] }