{
  "version": 3,
  "sources": ["../node_modules/iobuffer/src/text-encoding-polyfill.js", "../node_modules/chroma-js/chroma.js", "../node_modules/stackframe/stackframe.js", "../node_modules/error-stack-parser/error-stack-parser.js", "../node_modules/preact/src/constants.js", "../node_modules/preact/src/util.js", "../node_modules/preact/src/options.js", "../node_modules/preact/src/create-element.js", "../node_modules/preact/src/component.js", "../node_modules/preact/src/create-context.js", "../node_modules/preact/src/diff/children.js", "../node_modules/preact/src/diff/props.js", "../node_modules/preact/src/diff/index.js", "../node_modules/preact/src/render.js", "../node_modules/preact/src/clone-element.js", "../node_modules/preact/src/diff/catch-error.js", "../node_modules/yufka/node_modules/acorn/dist/acorn.mjs", "../node_modules/sourcemap-codec/src/sourcemap-codec.ts", "../node_modules/magic-string/src/BitSet.js", "../node_modules/magic-string/src/Chunk.js", "../node_modules/magic-string/src/SourceMap.js", "../node_modules/magic-string/src/utils/guessIndent.js", "../node_modules/magic-string/src/utils/getRelativePath.js", "../node_modules/magic-string/src/utils/isObject.js", "../node_modules/magic-string/src/utils/getLocator.js", "../node_modules/magic-string/src/utils/Mappings.js", "../node_modules/magic-string/src/MagicString.js", "../node_modules/magic-string/src/Bundle.js", "../node_modules/yufka/dist/esm/lib/metadata.js", "../node_modules/yufka/dist/esm/lib/helpers.js", "../node_modules/yufka/dist/esm/lib/util.js", "../node_modules/yufka/dist/esm/lib/lifecycle.js", "../node_modules/yufka/dist/esm/yufka.esm.js", "../node_modules/iobuffer/src/utf8.browser.ts", "../node_modules/iobuffer/src/IOBuffer.ts", "../node_modules/fast-png/node_modules/pako/dist/pako.esm.mjs", "../node_modules/fast-png/src/common.ts", "../node_modules/fast-png/src/internalTypes.ts", "../node_modules/fast-png/src/PNGDecoder.ts", "../node_modules/fast-png/src/types.ts", "../node_modules/fast-png/src/index.ts", "../src/common/script/lib/color.ts", "../src/common/script/lib/io.ts", "../src/common/script/lib/bitmap.ts", "../src/common/script/lib/output.ts", "../src/common/script/lib/scriptui.ts", "../src/common/script/env.ts", "../src/common/script/ui/notebook.ts", "../src/platform/script.ts"],
  "sourcesContent": [null, "/**\n * chroma.js - JavaScript library for color conversions\n *\n * Copyright (c) 2011-2019, Gregor Aisch\n * 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, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. The name Gregor Aisch 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 BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL GREGOR AISCH OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF 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 * chroma.js includes colors from colorbrewer2.org, which are released under\n * the following license:\n *\n * Copyright (c) 2002 Cynthia Brewer, Mark Harrower,\n * and The Pennsylvania State University.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND,\n * either express or implied. See the License for the specific\n * language governing permissions and limitations under the License.\n *\n * ------------------------------------------------------\n *\n * Named colors are taken from X11 Color Names.\n * http://www.w3.org/TR/css3-color/#svg-color\n *\n * @preserve\n */\n\n(function (global, factory) {\n    typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n    typeof define === 'function' && define.amd ? define(factory) :\n    (global.chroma = factory());\n}(this, (function () { 'use strict';\n\n    var limit = function (x, min, max) {\n        if ( min === void 0 ) min=0;\n        if ( max === void 0 ) max=1;\n\n        return x < min ? min : x > max ? max : x;\n    };\n\n    var clip_rgb = function (rgb) {\n        rgb._clipped = false;\n        rgb._unclipped = rgb.slice(0);\n        for (var i=0; i<=3; i++) {\n            if (i < 3) {\n                if (rgb[i] < 0 || rgb[i] > 255) { rgb._clipped = true; }\n                rgb[i] = limit(rgb[i], 0, 255);\n            } else if (i === 3) {\n                rgb[i] = limit(rgb[i], 0, 1);\n            }\n        }\n        return rgb;\n    };\n\n    // ported from jQuery's $.type\n    var classToType = {};\n    for (var i = 0, list = ['Boolean', 'Number', 'String', 'Function', 'Array', 'Date', 'RegExp', 'Undefined', 'Null']; i < list.length; i += 1) {\n        var name = list[i];\n\n        classToType[(\"[object \" + name + \"]\")] = name.toLowerCase();\n    }\n    var type = function(obj) {\n        return classToType[Object.prototype.toString.call(obj)] || \"object\";\n    };\n\n    var unpack = function (args, keyOrder) {\n        if ( keyOrder === void 0 ) keyOrder=null;\n\n    \t// if called with more than 3 arguments, we return the arguments\n        if (args.length >= 3) { return Array.prototype.slice.call(args); }\n        // with less than 3 args we check if first arg is object\n        // and use the keyOrder string to extract and sort properties\n    \tif (type(args[0]) == 'object' && keyOrder) {\n    \t\treturn keyOrder.split('')\n    \t\t\t.filter(function (k) { return args[0][k] !== undefined; })\n    \t\t\t.map(function (k) { return args[0][k]; });\n    \t}\n    \t// otherwise we just return the first argument\n    \t// (which we suppose is an array of args)\n        return args[0];\n    };\n\n    var last = function (args) {\n        if (args.length < 2) { return null; }\n        var l = args.length-1;\n        if (type(args[l]) == 'string') { return args[l].toLowerCase(); }\n        return null;\n    };\n\n    var PI = Math.PI;\n\n    var utils = {\n    \tclip_rgb: clip_rgb,\n    \tlimit: limit,\n    \ttype: type,\n    \tunpack: unpack,\n    \tlast: last,\n    \tPI: PI,\n    \tTWOPI: PI*2,\n    \tPITHIRD: PI/3,\n    \tDEG2RAD: PI / 180,\n    \tRAD2DEG: 180 / PI\n    };\n\n    var input = {\n    \tformat: {},\n    \tautodetect: []\n    };\n\n    var last$1 = utils.last;\n    var clip_rgb$1 = utils.clip_rgb;\n    var type$1 = utils.type;\n\n\n    var Color = function Color() {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        var me = this;\n        if (type$1(args[0]) === 'object' &&\n            args[0].constructor &&\n            args[0].constructor === this.constructor) {\n            // the argument is already a Color instance\n            return args[0];\n        }\n\n        // last argument could be the mode\n        var mode = last$1(args);\n        var autodetect = false;\n\n        if (!mode) {\n            autodetect = true;\n            if (!input.sorted) {\n                input.autodetect = input.autodetect.sort(function (a,b) { return b.p - a.p; });\n                input.sorted = true;\n            }\n            // auto-detect format\n            for (var i = 0, list = input.autodetect; i < list.length; i += 1) {\n                var chk = list[i];\n\n                mode = chk.test.apply(chk, args);\n                if (mode) { break; }\n            }\n        }\n\n        if (input.format[mode]) {\n            var rgb = input.format[mode].apply(null, autodetect ? args : args.slice(0,-1));\n            me._rgb = clip_rgb$1(rgb);\n        } else {\n            throw new Error('unknown format: '+args);\n        }\n\n        // add alpha channel\n        if (me._rgb.length === 3) { me._rgb.push(1); }\n    };\n\n    Color.prototype.toString = function toString () {\n        if (type$1(this.hex) == 'function') { return this.hex(); }\n        return (\"[\" + (this._rgb.join(',')) + \"]\");\n    };\n\n    var Color_1 = Color;\n\n    var chroma = function () {\n    \tvar args = [], len = arguments.length;\n    \twhile ( len-- ) args[ len ] = arguments[ len ];\n\n    \treturn new (Function.prototype.bind.apply( chroma.Color, [ null ].concat( args) ));\n    };\n\n    chroma.Color = Color_1;\n    chroma.version = '2.1.2';\n\n    var chroma_1 = chroma;\n\n    var unpack$1 = utils.unpack;\n    var max = Math.max;\n\n    var rgb2cmyk = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        var ref = unpack$1(args, 'rgb');\n        var r = ref[0];\n        var g = ref[1];\n        var b = ref[2];\n        r = r / 255;\n        g = g / 255;\n        b = b / 255;\n        var k = 1 - max(r,max(g,b));\n        var f = k < 1 ? 1 / (1-k) : 0;\n        var c = (1-r-k) * f;\n        var m = (1-g-k) * f;\n        var y = (1-b-k) * f;\n        return [c,m,y,k];\n    };\n\n    var rgb2cmyk_1 = rgb2cmyk;\n\n    var unpack$2 = utils.unpack;\n\n    var cmyk2rgb = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        args = unpack$2(args, 'cmyk');\n        var c = args[0];\n        var m = args[1];\n        var y = args[2];\n        var k = args[3];\n        var alpha = args.length > 4 ? args[4] : 1;\n        if (k === 1) { return [0,0,0,alpha]; }\n        return [\n            c >= 1 ? 0 : 255 * (1-c) * (1-k), // r\n            m >= 1 ? 0 : 255 * (1-m) * (1-k), // g\n            y >= 1 ? 0 : 255 * (1-y) * (1-k), // b\n            alpha\n        ];\n    };\n\n    var cmyk2rgb_1 = cmyk2rgb;\n\n    var unpack$3 = utils.unpack;\n    var type$2 = utils.type;\n\n\n\n    Color_1.prototype.cmyk = function() {\n        return rgb2cmyk_1(this._rgb);\n    };\n\n    chroma_1.cmyk = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        return new (Function.prototype.bind.apply( Color_1, [ null ].concat( args, ['cmyk']) ));\n    };\n\n    input.format.cmyk = cmyk2rgb_1;\n\n    input.autodetect.push({\n        p: 2,\n        test: function () {\n            var args = [], len = arguments.length;\n            while ( len-- ) args[ len ] = arguments[ len ];\n\n            args = unpack$3(args, 'cmyk');\n            if (type$2(args) === 'array' && args.length === 4) {\n                return 'cmyk';\n            }\n        }\n    });\n\n    var unpack$4 = utils.unpack;\n    var last$2 = utils.last;\n    var rnd = function (a) { return Math.round(a*100)/100; };\n\n    /*\n     * supported arguments:\n     * - hsl2css(h,s,l)\n     * - hsl2css(h,s,l,a)\n     * - hsl2css([h,s,l], mode)\n     * - hsl2css([h,s,l,a], mode)\n     * - hsl2css({h,s,l,a}, mode)\n     */\n    var hsl2css = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        var hsla = unpack$4(args, 'hsla');\n        var mode = last$2(args) || 'lsa';\n        hsla[0] = rnd(hsla[0] || 0);\n        hsla[1] = rnd(hsla[1]*100) + '%';\n        hsla[2] = rnd(hsla[2]*100) + '%';\n        if (mode === 'hsla' || (hsla.length > 3 && hsla[3]<1)) {\n            hsla[3] = hsla.length > 3 ? hsla[3] : 1;\n            mode = 'hsla';\n        } else {\n            hsla.length = 3;\n        }\n        return (mode + \"(\" + (hsla.join(',')) + \")\");\n    };\n\n    var hsl2css_1 = hsl2css;\n\n    var unpack$5 = utils.unpack;\n\n    /*\n     * supported arguments:\n     * - rgb2hsl(r,g,b)\n     * - rgb2hsl(r,g,b,a)\n     * - rgb2hsl([r,g,b])\n     * - rgb2hsl([r,g,b,a])\n     * - rgb2hsl({r,g,b,a})\n     */\n    var rgb2hsl = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        args = unpack$5(args, 'rgba');\n        var r = args[0];\n        var g = args[1];\n        var b = args[2];\n\n        r /= 255;\n        g /= 255;\n        b /= 255;\n\n        var min = Math.min(r, g, b);\n        var max = Math.max(r, g, b);\n\n        var l = (max + min) / 2;\n        var s, h;\n\n        if (max === min){\n            s = 0;\n            h = Number.NaN;\n        } else {\n            s = l < 0.5 ? (max - min) / (max + min) : (max - min) / (2 - max - min);\n        }\n\n        if (r == max) { h = (g - b) / (max - min); }\n        else if (g == max) { h = 2 + (b - r) / (max - min); }\n        else if (b == max) { h = 4 + (r - g) / (max - min); }\n\n        h *= 60;\n        if (h < 0) { h += 360; }\n        if (args.length>3 && args[3]!==undefined) { return [h,s,l,args[3]]; }\n        return [h,s,l];\n    };\n\n    var rgb2hsl_1 = rgb2hsl;\n\n    var unpack$6 = utils.unpack;\n    var last$3 = utils.last;\n\n\n    var round = Math.round;\n\n    /*\n     * supported arguments:\n     * - rgb2css(r,g,b)\n     * - rgb2css(r,g,b,a)\n     * - rgb2css([r,g,b], mode)\n     * - rgb2css([r,g,b,a], mode)\n     * - rgb2css({r,g,b,a}, mode)\n     */\n    var rgb2css = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        var rgba = unpack$6(args, 'rgba');\n        var mode = last$3(args) || 'rgb';\n        if (mode.substr(0,3) == 'hsl') {\n            return hsl2css_1(rgb2hsl_1(rgba), mode);\n        }\n        rgba[0] = round(rgba[0]);\n        rgba[1] = round(rgba[1]);\n        rgba[2] = round(rgba[2]);\n        if (mode === 'rgba' || (rgba.length > 3 && rgba[3]<1)) {\n            rgba[3] = rgba.length > 3 ? rgba[3] : 1;\n            mode = 'rgba';\n        }\n        return (mode + \"(\" + (rgba.slice(0,mode==='rgb'?3:4).join(',')) + \")\");\n    };\n\n    var rgb2css_1 = rgb2css;\n\n    var unpack$7 = utils.unpack;\n    var round$1 = Math.round;\n\n    var hsl2rgb = function () {\n        var assign;\n\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n        args = unpack$7(args, 'hsl');\n        var h = args[0];\n        var s = args[1];\n        var l = args[2];\n        var r,g,b;\n        if (s === 0) {\n            r = g = b = l*255;\n        } else {\n            var t3 = [0,0,0];\n            var c = [0,0,0];\n            var t2 = l < 0.5 ? l * (1+s) : l+s-l*s;\n            var t1 = 2 * l - t2;\n            var h_ = h / 360;\n            t3[0] = h_ + 1/3;\n            t3[1] = h_;\n            t3[2] = h_ - 1/3;\n            for (var i=0; i<3; i++) {\n                if (t3[i] < 0) { t3[i] += 1; }\n                if (t3[i] > 1) { t3[i] -= 1; }\n                if (6 * t3[i] < 1)\n                    { c[i] = t1 + (t2 - t1) * 6 * t3[i]; }\n                else if (2 * t3[i] < 1)\n                    { c[i] = t2; }\n                else if (3 * t3[i] < 2)\n                    { c[i] = t1 + (t2 - t1) * ((2 / 3) - t3[i]) * 6; }\n                else\n                    { c[i] = t1; }\n            }\n            (assign = [round$1(c[0]*255),round$1(c[1]*255),round$1(c[2]*255)], r = assign[0], g = assign[1], b = assign[2]);\n        }\n        if (args.length > 3) {\n            // keep alpha channel\n            return [r,g,b,args[3]];\n        }\n        return [r,g,b,1];\n    };\n\n    var hsl2rgb_1 = hsl2rgb;\n\n    var RE_RGB = /^rgb\\(\\s*(-?\\d+),\\s*(-?\\d+)\\s*,\\s*(-?\\d+)\\s*\\)$/;\n    var RE_RGBA = /^rgba\\(\\s*(-?\\d+),\\s*(-?\\d+)\\s*,\\s*(-?\\d+)\\s*,\\s*([01]|[01]?\\.\\d+)\\)$/;\n    var RE_RGB_PCT = /^rgb\\(\\s*(-?\\d+(?:\\.\\d+)?)%,\\s*(-?\\d+(?:\\.\\d+)?)%\\s*,\\s*(-?\\d+(?:\\.\\d+)?)%\\s*\\)$/;\n    var RE_RGBA_PCT = /^rgba\\(\\s*(-?\\d+(?:\\.\\d+)?)%,\\s*(-?\\d+(?:\\.\\d+)?)%\\s*,\\s*(-?\\d+(?:\\.\\d+)?)%\\s*,\\s*([01]|[01]?\\.\\d+)\\)$/;\n    var RE_HSL = /^hsl\\(\\s*(-?\\d+(?:\\.\\d+)?),\\s*(-?\\d+(?:\\.\\d+)?)%\\s*,\\s*(-?\\d+(?:\\.\\d+)?)%\\s*\\)$/;\n    var RE_HSLA = /^hsla\\(\\s*(-?\\d+(?:\\.\\d+)?),\\s*(-?\\d+(?:\\.\\d+)?)%\\s*,\\s*(-?\\d+(?:\\.\\d+)?)%\\s*,\\s*([01]|[01]?\\.\\d+)\\)$/;\n\n    var round$2 = Math.round;\n\n    var css2rgb = function (css) {\n        css = css.toLowerCase().trim();\n        var m;\n\n        if (input.format.named) {\n            try {\n                return input.format.named(css);\n            } catch (e) {\n                // eslint-disable-next-line\n            }\n        }\n\n        // rgb(250,20,0)\n        if ((m = css.match(RE_RGB))) {\n            var rgb = m.slice(1,4);\n            for (var i=0; i<3; i++) {\n                rgb[i] = +rgb[i];\n            }\n            rgb[3] = 1;  // default alpha\n            return rgb;\n        }\n\n        // rgba(250,20,0,0.4)\n        if ((m = css.match(RE_RGBA))) {\n            var rgb$1 = m.slice(1,5);\n            for (var i$1=0; i$1<4; i$1++) {\n                rgb$1[i$1] = +rgb$1[i$1];\n            }\n            return rgb$1;\n        }\n\n        // rgb(100%,0%,0%)\n        if ((m = css.match(RE_RGB_PCT))) {\n            var rgb$2 = m.slice(1,4);\n            for (var i$2=0; i$2<3; i$2++) {\n                rgb$2[i$2] = round$2(rgb$2[i$2] * 2.55);\n            }\n            rgb$2[3] = 1;  // default alpha\n            return rgb$2;\n        }\n\n        // rgba(100%,0%,0%,0.4)\n        if ((m = css.match(RE_RGBA_PCT))) {\n            var rgb$3 = m.slice(1,5);\n            for (var i$3=0; i$3<3; i$3++) {\n                rgb$3[i$3] = round$2(rgb$3[i$3] * 2.55);\n            }\n            rgb$3[3] = +rgb$3[3];\n            return rgb$3;\n        }\n\n        // hsl(0,100%,50%)\n        if ((m = css.match(RE_HSL))) {\n            var hsl = m.slice(1,4);\n            hsl[1] *= 0.01;\n            hsl[2] *= 0.01;\n            var rgb$4 = hsl2rgb_1(hsl);\n            rgb$4[3] = 1;\n            return rgb$4;\n        }\n\n        // hsla(0,100%,50%,0.5)\n        if ((m = css.match(RE_HSLA))) {\n            var hsl$1 = m.slice(1,4);\n            hsl$1[1] *= 0.01;\n            hsl$1[2] *= 0.01;\n            var rgb$5 = hsl2rgb_1(hsl$1);\n            rgb$5[3] = +m[4];  // default alpha = 1\n            return rgb$5;\n        }\n    };\n\n    css2rgb.test = function (s) {\n        return RE_RGB.test(s) ||\n            RE_RGBA.test(s) ||\n            RE_RGB_PCT.test(s) ||\n            RE_RGBA_PCT.test(s) ||\n            RE_HSL.test(s) ||\n            RE_HSLA.test(s);\n    };\n\n    var css2rgb_1 = css2rgb;\n\n    var type$3 = utils.type;\n\n\n\n\n    Color_1.prototype.css = function(mode) {\n        return rgb2css_1(this._rgb, mode);\n    };\n\n    chroma_1.css = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        return new (Function.prototype.bind.apply( Color_1, [ null ].concat( args, ['css']) ));\n    };\n\n    input.format.css = css2rgb_1;\n\n    input.autodetect.push({\n        p: 5,\n        test: function (h) {\n            var rest = [], len = arguments.length - 1;\n            while ( len-- > 0 ) rest[ len ] = arguments[ len + 1 ];\n\n            if (!rest.length && type$3(h) === 'string' && css2rgb_1.test(h)) {\n                return 'css';\n            }\n        }\n    });\n\n    var unpack$8 = utils.unpack;\n\n    input.format.gl = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        var rgb = unpack$8(args, 'rgba');\n        rgb[0] *= 255;\n        rgb[1] *= 255;\n        rgb[2] *= 255;\n        return rgb;\n    };\n\n    chroma_1.gl = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        return new (Function.prototype.bind.apply( Color_1, [ null ].concat( args, ['gl']) ));\n    };\n\n    Color_1.prototype.gl = function() {\n        var rgb = this._rgb;\n        return [rgb[0]/255, rgb[1]/255, rgb[2]/255, rgb[3]];\n    };\n\n    var unpack$9 = utils.unpack;\n\n    var rgb2hcg = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        var ref = unpack$9(args, 'rgb');\n        var r = ref[0];\n        var g = ref[1];\n        var b = ref[2];\n        var min = Math.min(r, g, b);\n        var max = Math.max(r, g, b);\n        var delta = max - min;\n        var c = delta * 100 / 255;\n        var _g = min / (255 - delta) * 100;\n        var h;\n        if (delta === 0) {\n            h = Number.NaN;\n        } else {\n            if (r === max) { h = (g - b) / delta; }\n            if (g === max) { h = 2+(b - r) / delta; }\n            if (b === max) { h = 4+(r - g) / delta; }\n            h *= 60;\n            if (h < 0) { h += 360; }\n        }\n        return [h, c, _g];\n    };\n\n    var rgb2hcg_1 = rgb2hcg;\n\n    var unpack$a = utils.unpack;\n    var floor = Math.floor;\n\n    /*\n     * this is basically just HSV with some minor tweaks\n     *\n     * hue.. [0..360]\n     * chroma .. [0..1]\n     * grayness .. [0..1]\n     */\n\n    var hcg2rgb = function () {\n        var assign, assign$1, assign$2, assign$3, assign$4, assign$5;\n\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n        args = unpack$a(args, 'hcg');\n        var h = args[0];\n        var c = args[1];\n        var _g = args[2];\n        var r,g,b;\n        _g = _g * 255;\n        var _c = c * 255;\n        if (c === 0) {\n            r = g = b = _g;\n        } else {\n            if (h === 360) { h = 0; }\n            if (h > 360) { h -= 360; }\n            if (h < 0) { h += 360; }\n            h /= 60;\n            var i = floor(h);\n            var f = h - i;\n            var p = _g * (1 - c);\n            var q = p + _c * (1 - f);\n            var t = p + _c * f;\n            var v = p + _c;\n            switch (i) {\n                case 0: (assign = [v, t, p], r = assign[0], g = assign[1], b = assign[2]); break\n                case 1: (assign$1 = [q, v, p], r = assign$1[0], g = assign$1[1], b = assign$1[2]); break\n                case 2: (assign$2 = [p, v, t], r = assign$2[0], g = assign$2[1], b = assign$2[2]); break\n                case 3: (assign$3 = [p, q, v], r = assign$3[0], g = assign$3[1], b = assign$3[2]); break\n                case 4: (assign$4 = [t, p, v], r = assign$4[0], g = assign$4[1], b = assign$4[2]); break\n                case 5: (assign$5 = [v, p, q], r = assign$5[0], g = assign$5[1], b = assign$5[2]); break\n            }\n        }\n        return [r, g, b, args.length > 3 ? args[3] : 1];\n    };\n\n    var hcg2rgb_1 = hcg2rgb;\n\n    var unpack$b = utils.unpack;\n    var type$4 = utils.type;\n\n\n\n\n\n\n    Color_1.prototype.hcg = function() {\n        return rgb2hcg_1(this._rgb);\n    };\n\n    chroma_1.hcg = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        return new (Function.prototype.bind.apply( Color_1, [ null ].concat( args, ['hcg']) ));\n    };\n\n    input.format.hcg = hcg2rgb_1;\n\n    input.autodetect.push({\n        p: 1,\n        test: function () {\n            var args = [], len = arguments.length;\n            while ( len-- ) args[ len ] = arguments[ len ];\n\n            args = unpack$b(args, 'hcg');\n            if (type$4(args) === 'array' && args.length === 3) {\n                return 'hcg';\n            }\n        }\n    });\n\n    var unpack$c = utils.unpack;\n    var last$4 = utils.last;\n    var round$3 = Math.round;\n\n    var rgb2hex = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        var ref = unpack$c(args, 'rgba');\n        var r = ref[0];\n        var g = ref[1];\n        var b = ref[2];\n        var a = ref[3];\n        var mode = last$4(args) || 'auto';\n        if (a === undefined) { a = 1; }\n        if (mode === 'auto') {\n            mode = a < 1 ? 'rgba' : 'rgb';\n        }\n        r = round$3(r);\n        g = round$3(g);\n        b = round$3(b);\n        var u = r << 16 | g << 8 | b;\n        var str = \"000000\" + u.toString(16); //#.toUpperCase();\n        str = str.substr(str.length - 6);\n        var hxa = '0' + round$3(a * 255).toString(16);\n        hxa = hxa.substr(hxa.length - 2);\n        switch (mode.toLowerCase()) {\n            case 'rgba': return (\"#\" + str + hxa);\n            case 'argb': return (\"#\" + hxa + str);\n            default: return (\"#\" + str);\n        }\n    };\n\n    var rgb2hex_1 = rgb2hex;\n\n    var RE_HEX = /^#?([A-Fa-f0-9]{6}|[A-Fa-f0-9]{3})$/;\n    var RE_HEXA = /^#?([A-Fa-f0-9]{8}|[A-Fa-f0-9]{4})$/;\n\n    var hex2rgb = function (hex) {\n        if (hex.match(RE_HEX)) {\n            // remove optional leading #\n            if (hex.length === 4 || hex.length === 7) {\n                hex = hex.substr(1);\n            }\n            // expand short-notation to full six-digit\n            if (hex.length === 3) {\n                hex = hex.split('');\n                hex = hex[0]+hex[0]+hex[1]+hex[1]+hex[2]+hex[2];\n            }\n            var u = parseInt(hex, 16);\n            var r = u >> 16;\n            var g = u >> 8 & 0xFF;\n            var b = u & 0xFF;\n            return [r,g,b,1];\n        }\n\n        // match rgba hex format, eg #FF000077\n        if (hex.match(RE_HEXA)) {\n            if (hex.length === 5 || hex.length === 9) {\n                // remove optional leading #\n                hex = hex.substr(1);\n            }\n            // expand short-notation to full eight-digit\n            if (hex.length === 4) {\n                hex = hex.split('');\n                hex = hex[0]+hex[0]+hex[1]+hex[1]+hex[2]+hex[2]+hex[3]+hex[3];\n            }\n            var u$1 = parseInt(hex, 16);\n            var r$1 = u$1 >> 24 & 0xFF;\n            var g$1 = u$1 >> 16 & 0xFF;\n            var b$1 = u$1 >> 8 & 0xFF;\n            var a = Math.round((u$1 & 0xFF) / 0xFF * 100) / 100;\n            return [r$1,g$1,b$1,a];\n        }\n\n        // we used to check for css colors here\n        // if _input.css? and rgb = _input.css hex\n        //     return rgb\n\n        throw new Error((\"unknown hex color: \" + hex));\n    };\n\n    var hex2rgb_1 = hex2rgb;\n\n    var type$5 = utils.type;\n\n\n\n\n    Color_1.prototype.hex = function(mode) {\n        return rgb2hex_1(this._rgb, mode);\n    };\n\n    chroma_1.hex = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        return new (Function.prototype.bind.apply( Color_1, [ null ].concat( args, ['hex']) ));\n    };\n\n    input.format.hex = hex2rgb_1;\n    input.autodetect.push({\n        p: 4,\n        test: function (h) {\n            var rest = [], len = arguments.length - 1;\n            while ( len-- > 0 ) rest[ len ] = arguments[ len + 1 ];\n\n            if (!rest.length && type$5(h) === 'string' && [3,4,5,6,7,8,9].indexOf(h.length) >= 0) {\n                return 'hex';\n            }\n        }\n    });\n\n    var unpack$d = utils.unpack;\n    var TWOPI = utils.TWOPI;\n    var min = Math.min;\n    var sqrt = Math.sqrt;\n    var acos = Math.acos;\n\n    var rgb2hsi = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        /*\n        borrowed from here:\n        http://hummer.stanford.edu/museinfo/doc/examples/humdrum/keyscape2/rgb2hsi.cpp\n        */\n        var ref = unpack$d(args, 'rgb');\n        var r = ref[0];\n        var g = ref[1];\n        var b = ref[2];\n        r /= 255;\n        g /= 255;\n        b /= 255;\n        var h;\n        var min_ = min(r,g,b);\n        var i = (r+g+b) / 3;\n        var s = i > 0 ? 1 - min_/i : 0;\n        if (s === 0) {\n            h = NaN;\n        } else {\n            h = ((r-g)+(r-b)) / 2;\n            h /= sqrt((r-g)*(r-g) + (r-b)*(g-b));\n            h = acos(h);\n            if (b > g) {\n                h = TWOPI - h;\n            }\n            h /= TWOPI;\n        }\n        return [h*360,s,i];\n    };\n\n    var rgb2hsi_1 = rgb2hsi;\n\n    var unpack$e = utils.unpack;\n    var limit$1 = utils.limit;\n    var TWOPI$1 = utils.TWOPI;\n    var PITHIRD = utils.PITHIRD;\n    var cos = Math.cos;\n\n    /*\n     * hue [0..360]\n     * saturation [0..1]\n     * intensity [0..1]\n     */\n    var hsi2rgb = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        /*\n        borrowed from here:\n        http://hummer.stanford.edu/museinfo/doc/examples/humdrum/keyscape2/hsi2rgb.cpp\n        */\n        args = unpack$e(args, 'hsi');\n        var h = args[0];\n        var s = args[1];\n        var i = args[2];\n        var r,g,b;\n\n        if (isNaN(h)) { h = 0; }\n        if (isNaN(s)) { s = 0; }\n        // normalize hue\n        if (h > 360) { h -= 360; }\n        if (h < 0) { h += 360; }\n        h /= 360;\n        if (h < 1/3) {\n            b = (1-s)/3;\n            r = (1+s*cos(TWOPI$1*h)/cos(PITHIRD-TWOPI$1*h))/3;\n            g = 1 - (b+r);\n        } else if (h < 2/3) {\n            h -= 1/3;\n            r = (1-s)/3;\n            g = (1+s*cos(TWOPI$1*h)/cos(PITHIRD-TWOPI$1*h))/3;\n            b = 1 - (r+g);\n        } else {\n            h -= 2/3;\n            g = (1-s)/3;\n            b = (1+s*cos(TWOPI$1*h)/cos(PITHIRD-TWOPI$1*h))/3;\n            r = 1 - (g+b);\n        }\n        r = limit$1(i*r*3);\n        g = limit$1(i*g*3);\n        b = limit$1(i*b*3);\n        return [r*255, g*255, b*255, args.length > 3 ? args[3] : 1];\n    };\n\n    var hsi2rgb_1 = hsi2rgb;\n\n    var unpack$f = utils.unpack;\n    var type$6 = utils.type;\n\n\n\n\n\n\n    Color_1.prototype.hsi = function() {\n        return rgb2hsi_1(this._rgb);\n    };\n\n    chroma_1.hsi = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        return new (Function.prototype.bind.apply( Color_1, [ null ].concat( args, ['hsi']) ));\n    };\n\n    input.format.hsi = hsi2rgb_1;\n\n    input.autodetect.push({\n        p: 2,\n        test: function () {\n            var args = [], len = arguments.length;\n            while ( len-- ) args[ len ] = arguments[ len ];\n\n            args = unpack$f(args, 'hsi');\n            if (type$6(args) === 'array' && args.length === 3) {\n                return 'hsi';\n            }\n        }\n    });\n\n    var unpack$g = utils.unpack;\n    var type$7 = utils.type;\n\n\n\n\n\n\n    Color_1.prototype.hsl = function() {\n        return rgb2hsl_1(this._rgb);\n    };\n\n    chroma_1.hsl = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        return new (Function.prototype.bind.apply( Color_1, [ null ].concat( args, ['hsl']) ));\n    };\n\n    input.format.hsl = hsl2rgb_1;\n\n    input.autodetect.push({\n        p: 2,\n        test: function () {\n            var args = [], len = arguments.length;\n            while ( len-- ) args[ len ] = arguments[ len ];\n\n            args = unpack$g(args, 'hsl');\n            if (type$7(args) === 'array' && args.length === 3) {\n                return 'hsl';\n            }\n        }\n    });\n\n    var unpack$h = utils.unpack;\n    var min$1 = Math.min;\n    var max$1 = Math.max;\n\n    /*\n     * supported arguments:\n     * - rgb2hsv(r,g,b)\n     * - rgb2hsv([r,g,b])\n     * - rgb2hsv({r,g,b})\n     */\n    var rgb2hsl$1 = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        args = unpack$h(args, 'rgb');\n        var r = args[0];\n        var g = args[1];\n        var b = args[2];\n        var min_ = min$1(r, g, b);\n        var max_ = max$1(r, g, b);\n        var delta = max_ - min_;\n        var h,s,v;\n        v = max_ / 255.0;\n        if (max_ === 0) {\n            h = Number.NaN;\n            s = 0;\n        } else {\n            s = delta / max_;\n            if (r === max_) { h = (g - b) / delta; }\n            if (g === max_) { h = 2+(b - r) / delta; }\n            if (b === max_) { h = 4+(r - g) / delta; }\n            h *= 60;\n            if (h < 0) { h += 360; }\n        }\n        return [h, s, v]\n    };\n\n    var rgb2hsv = rgb2hsl$1;\n\n    var unpack$i = utils.unpack;\n    var floor$1 = Math.floor;\n\n    var hsv2rgb = function () {\n        var assign, assign$1, assign$2, assign$3, assign$4, assign$5;\n\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n        args = unpack$i(args, 'hsv');\n        var h = args[0];\n        var s = args[1];\n        var v = args[2];\n        var r,g,b;\n        v *= 255;\n        if (s === 0) {\n            r = g = b = v;\n        } else {\n            if (h === 360) { h = 0; }\n            if (h > 360) { h -= 360; }\n            if (h < 0) { h += 360; }\n            h /= 60;\n\n            var i = floor$1(h);\n            var f = h - i;\n            var p = v * (1 - s);\n            var q = v * (1 - s * f);\n            var t = v * (1 - s * (1 - f));\n\n            switch (i) {\n                case 0: (assign = [v, t, p], r = assign[0], g = assign[1], b = assign[2]); break\n                case 1: (assign$1 = [q, v, p], r = assign$1[0], g = assign$1[1], b = assign$1[2]); break\n                case 2: (assign$2 = [p, v, t], r = assign$2[0], g = assign$2[1], b = assign$2[2]); break\n                case 3: (assign$3 = [p, q, v], r = assign$3[0], g = assign$3[1], b = assign$3[2]); break\n                case 4: (assign$4 = [t, p, v], r = assign$4[0], g = assign$4[1], b = assign$4[2]); break\n                case 5: (assign$5 = [v, p, q], r = assign$5[0], g = assign$5[1], b = assign$5[2]); break\n            }\n        }\n        return [r,g,b,args.length > 3?args[3]:1];\n    };\n\n    var hsv2rgb_1 = hsv2rgb;\n\n    var unpack$j = utils.unpack;\n    var type$8 = utils.type;\n\n\n\n\n\n\n    Color_1.prototype.hsv = function() {\n        return rgb2hsv(this._rgb);\n    };\n\n    chroma_1.hsv = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        return new (Function.prototype.bind.apply( Color_1, [ null ].concat( args, ['hsv']) ));\n    };\n\n    input.format.hsv = hsv2rgb_1;\n\n    input.autodetect.push({\n        p: 2,\n        test: function () {\n            var args = [], len = arguments.length;\n            while ( len-- ) args[ len ] = arguments[ len ];\n\n            args = unpack$j(args, 'hsv');\n            if (type$8(args) === 'array' && args.length === 3) {\n                return 'hsv';\n            }\n        }\n    });\n\n    var labConstants = {\n        // Corresponds roughly to RGB brighter/darker\n        Kn: 18,\n\n        // D65 standard referent\n        Xn: 0.950470,\n        Yn: 1,\n        Zn: 1.088830,\n\n        t0: 0.137931034,  // 4 / 29\n        t1: 0.206896552,  // 6 / 29\n        t2: 0.12841855,   // 3 * t1 * t1\n        t3: 0.008856452,  // t1 * t1 * t1\n    };\n\n    var unpack$k = utils.unpack;\n    var pow = Math.pow;\n\n    var rgb2lab = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        var ref = unpack$k(args, 'rgb');\n        var r = ref[0];\n        var g = ref[1];\n        var b = ref[2];\n        var ref$1 = rgb2xyz(r,g,b);\n        var x = ref$1[0];\n        var y = ref$1[1];\n        var z = ref$1[2];\n        var l = 116 * y - 16;\n        return [l < 0 ? 0 : l, 500 * (x - y), 200 * (y - z)];\n    };\n\n    var rgb_xyz = function (r) {\n        if ((r /= 255) <= 0.04045) { return r / 12.92; }\n        return pow((r + 0.055) / 1.055, 2.4);\n    };\n\n    var xyz_lab = function (t) {\n        if (t > labConstants.t3) { return pow(t, 1 / 3); }\n        return t / labConstants.t2 + labConstants.t0;\n    };\n\n    var rgb2xyz = function (r,g,b) {\n        r = rgb_xyz(r);\n        g = rgb_xyz(g);\n        b = rgb_xyz(b);\n        var x = xyz_lab((0.4124564 * r + 0.3575761 * g + 0.1804375 * b) / labConstants.Xn);\n        var y = xyz_lab((0.2126729 * r + 0.7151522 * g + 0.0721750 * b) / labConstants.Yn);\n        var z = xyz_lab((0.0193339 * r + 0.1191920 * g + 0.9503041 * b) / labConstants.Zn);\n        return [x,y,z];\n    };\n\n    var rgb2lab_1 = rgb2lab;\n\n    var unpack$l = utils.unpack;\n    var pow$1 = Math.pow;\n\n    /*\n     * L* [0..100]\n     * a [-100..100]\n     * b [-100..100]\n     */\n    var lab2rgb = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        args = unpack$l(args, 'lab');\n        var l = args[0];\n        var a = args[1];\n        var b = args[2];\n        var x,y,z, r,g,b_;\n\n        y = (l + 16) / 116;\n        x = isNaN(a) ? y : y + a / 500;\n        z = isNaN(b) ? y : y - b / 200;\n\n        y = labConstants.Yn * lab_xyz(y);\n        x = labConstants.Xn * lab_xyz(x);\n        z = labConstants.Zn * lab_xyz(z);\n\n        r = xyz_rgb(3.2404542 * x - 1.5371385 * y - 0.4985314 * z);  // D65 -> sRGB\n        g = xyz_rgb(-0.9692660 * x + 1.8760108 * y + 0.0415560 * z);\n        b_ = xyz_rgb(0.0556434 * x - 0.2040259 * y + 1.0572252 * z);\n\n        return [r,g,b_,args.length > 3 ? args[3] : 1];\n    };\n\n    var xyz_rgb = function (r) {\n        return 255 * (r <= 0.00304 ? 12.92 * r : 1.055 * pow$1(r, 1 / 2.4) - 0.055)\n    };\n\n    var lab_xyz = function (t) {\n        return t > labConstants.t1 ? t * t * t : labConstants.t2 * (t - labConstants.t0)\n    };\n\n    var lab2rgb_1 = lab2rgb;\n\n    var unpack$m = utils.unpack;\n    var type$9 = utils.type;\n\n\n\n\n\n\n    Color_1.prototype.lab = function() {\n        return rgb2lab_1(this._rgb);\n    };\n\n    chroma_1.lab = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        return new (Function.prototype.bind.apply( Color_1, [ null ].concat( args, ['lab']) ));\n    };\n\n    input.format.lab = lab2rgb_1;\n\n    input.autodetect.push({\n        p: 2,\n        test: function () {\n            var args = [], len = arguments.length;\n            while ( len-- ) args[ len ] = arguments[ len ];\n\n            args = unpack$m(args, 'lab');\n            if (type$9(args) === 'array' && args.length === 3) {\n                return 'lab';\n            }\n        }\n    });\n\n    var unpack$n = utils.unpack;\n    var RAD2DEG = utils.RAD2DEG;\n    var sqrt$1 = Math.sqrt;\n    var atan2 = Math.atan2;\n    var round$4 = Math.round;\n\n    var lab2lch = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        var ref = unpack$n(args, 'lab');\n        var l = ref[0];\n        var a = ref[1];\n        var b = ref[2];\n        var c = sqrt$1(a * a + b * b);\n        var h = (atan2(b, a) * RAD2DEG + 360) % 360;\n        if (round$4(c*10000) === 0) { h = Number.NaN; }\n        return [l, c, h];\n    };\n\n    var lab2lch_1 = lab2lch;\n\n    var unpack$o = utils.unpack;\n\n\n\n    var rgb2lch = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        var ref = unpack$o(args, 'rgb');\n        var r = ref[0];\n        var g = ref[1];\n        var b = ref[2];\n        var ref$1 = rgb2lab_1(r,g,b);\n        var l = ref$1[0];\n        var a = ref$1[1];\n        var b_ = ref$1[2];\n        return lab2lch_1(l,a,b_);\n    };\n\n    var rgb2lch_1 = rgb2lch;\n\n    var unpack$p = utils.unpack;\n    var DEG2RAD = utils.DEG2RAD;\n    var sin = Math.sin;\n    var cos$1 = Math.cos;\n\n    var lch2lab = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        /*\n        Convert from a qualitative parameter h and a quantitative parameter l to a 24-bit pixel.\n        These formulas were invented by David Dalrymple to obtain maximum contrast without going\n        out of gamut if the parameters are in the range 0-1.\n\n        A saturation multiplier was added by Gregor Aisch\n        */\n        var ref = unpack$p(args, 'lch');\n        var l = ref[0];\n        var c = ref[1];\n        var h = ref[2];\n        if (isNaN(h)) { h = 0; }\n        h = h * DEG2RAD;\n        return [l, cos$1(h) * c, sin(h) * c]\n    };\n\n    var lch2lab_1 = lch2lab;\n\n    var unpack$q = utils.unpack;\n\n\n\n    var lch2rgb = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        args = unpack$q(args, 'lch');\n        var l = args[0];\n        var c = args[1];\n        var h = args[2];\n        var ref = lch2lab_1 (l,c,h);\n        var L = ref[0];\n        var a = ref[1];\n        var b_ = ref[2];\n        var ref$1 = lab2rgb_1 (L,a,b_);\n        var r = ref$1[0];\n        var g = ref$1[1];\n        var b = ref$1[2];\n        return [r, g, b, args.length > 3 ? args[3] : 1];\n    };\n\n    var lch2rgb_1 = lch2rgb;\n\n    var unpack$r = utils.unpack;\n\n\n    var hcl2rgb = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        var hcl = unpack$r(args, 'hcl').reverse();\n        return lch2rgb_1.apply(void 0, hcl);\n    };\n\n    var hcl2rgb_1 = hcl2rgb;\n\n    var unpack$s = utils.unpack;\n    var type$a = utils.type;\n\n\n\n\n\n\n    Color_1.prototype.lch = function() { return rgb2lch_1(this._rgb); };\n    Color_1.prototype.hcl = function() { return rgb2lch_1(this._rgb).reverse(); };\n\n    chroma_1.lch = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        return new (Function.prototype.bind.apply( Color_1, [ null ].concat( args, ['lch']) ));\n    };\n    chroma_1.hcl = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        return new (Function.prototype.bind.apply( Color_1, [ null ].concat( args, ['hcl']) ));\n    };\n\n    input.format.lch = lch2rgb_1;\n    input.format.hcl = hcl2rgb_1;\n\n    ['lch','hcl'].forEach(function (m) { return input.autodetect.push({\n        p: 2,\n        test: function () {\n            var args = [], len = arguments.length;\n            while ( len-- ) args[ len ] = arguments[ len ];\n\n            args = unpack$s(args, m);\n            if (type$a(args) === 'array' && args.length === 3) {\n                return m;\n            }\n        }\n    }); });\n\n    /**\n    \tX11 color names\n\n    \thttp://www.w3.org/TR/css3-color/#svg-color\n    */\n\n    var w3cx11 = {\n        aliceblue: '#f0f8ff',\n        antiquewhite: '#faebd7',\n        aqua: '#00ffff',\n        aquamarine: '#7fffd4',\n        azure: '#f0ffff',\n        beige: '#f5f5dc',\n        bisque: '#ffe4c4',\n        black: '#000000',\n        blanchedalmond: '#ffebcd',\n        blue: '#0000ff',\n        blueviolet: '#8a2be2',\n        brown: '#a52a2a',\n        burlywood: '#deb887',\n        cadetblue: '#5f9ea0',\n        chartreuse: '#7fff00',\n        chocolate: '#d2691e',\n        coral: '#ff7f50',\n        cornflower: '#6495ed',\n        cornflowerblue: '#6495ed',\n        cornsilk: '#fff8dc',\n        crimson: '#dc143c',\n        cyan: '#00ffff',\n        darkblue: '#00008b',\n        darkcyan: '#008b8b',\n        darkgoldenrod: '#b8860b',\n        darkgray: '#a9a9a9',\n        darkgreen: '#006400',\n        darkgrey: '#a9a9a9',\n        darkkhaki: '#bdb76b',\n        darkmagenta: '#8b008b',\n        darkolivegreen: '#556b2f',\n        darkorange: '#ff8c00',\n        darkorchid: '#9932cc',\n        darkred: '#8b0000',\n        darksalmon: '#e9967a',\n        darkseagreen: '#8fbc8f',\n        darkslateblue: '#483d8b',\n        darkslategray: '#2f4f4f',\n        darkslategrey: '#2f4f4f',\n        darkturquoise: '#00ced1',\n        darkviolet: '#9400d3',\n        deeppink: '#ff1493',\n        deepskyblue: '#00bfff',\n        dimgray: '#696969',\n        dimgrey: '#696969',\n        dodgerblue: '#1e90ff',\n        firebrick: '#b22222',\n        floralwhite: '#fffaf0',\n        forestgreen: '#228b22',\n        fuchsia: '#ff00ff',\n        gainsboro: '#dcdcdc',\n        ghostwhite: '#f8f8ff',\n        gold: '#ffd700',\n        goldenrod: '#daa520',\n        gray: '#808080',\n        green: '#008000',\n        greenyellow: '#adff2f',\n        grey: '#808080',\n        honeydew: '#f0fff0',\n        hotpink: '#ff69b4',\n        indianred: '#cd5c5c',\n        indigo: '#4b0082',\n        ivory: '#fffff0',\n        khaki: '#f0e68c',\n        laserlemon: '#ffff54',\n        lavender: '#e6e6fa',\n        lavenderblush: '#fff0f5',\n        lawngreen: '#7cfc00',\n        lemonchiffon: '#fffacd',\n        lightblue: '#add8e6',\n        lightcoral: '#f08080',\n        lightcyan: '#e0ffff',\n        lightgoldenrod: '#fafad2',\n        lightgoldenrodyellow: '#fafad2',\n        lightgray: '#d3d3d3',\n        lightgreen: '#90ee90',\n        lightgrey: '#d3d3d3',\n        lightpink: '#ffb6c1',\n        lightsalmon: '#ffa07a',\n        lightseagreen: '#20b2aa',\n        lightskyblue: '#87cefa',\n        lightslategray: '#778899',\n        lightslategrey: '#778899',\n        lightsteelblue: '#b0c4de',\n        lightyellow: '#ffffe0',\n        lime: '#00ff00',\n        limegreen: '#32cd32',\n        linen: '#faf0e6',\n        magenta: '#ff00ff',\n        maroon: '#800000',\n        maroon2: '#7f0000',\n        maroon3: '#b03060',\n        mediumaquamarine: '#66cdaa',\n        mediumblue: '#0000cd',\n        mediumorchid: '#ba55d3',\n        mediumpurple: '#9370db',\n        mediumseagreen: '#3cb371',\n        mediumslateblue: '#7b68ee',\n        mediumspringgreen: '#00fa9a',\n        mediumturquoise: '#48d1cc',\n        mediumvioletred: '#c71585',\n        midnightblue: '#191970',\n        mintcream: '#f5fffa',\n        mistyrose: '#ffe4e1',\n        moccasin: '#ffe4b5',\n        navajowhite: '#ffdead',\n        navy: '#000080',\n        oldlace: '#fdf5e6',\n        olive: '#808000',\n        olivedrab: '#6b8e23',\n        orange: '#ffa500',\n        orangered: '#ff4500',\n        orchid: '#da70d6',\n        palegoldenrod: '#eee8aa',\n        palegreen: '#98fb98',\n        paleturquoise: '#afeeee',\n        palevioletred: '#db7093',\n        papayawhip: '#ffefd5',\n        peachpuff: '#ffdab9',\n        peru: '#cd853f',\n        pink: '#ffc0cb',\n        plum: '#dda0dd',\n        powderblue: '#b0e0e6',\n        purple: '#800080',\n        purple2: '#7f007f',\n        purple3: '#a020f0',\n        rebeccapurple: '#663399',\n        red: '#ff0000',\n        rosybrown: '#bc8f8f',\n        royalblue: '#4169e1',\n        saddlebrown: '#8b4513',\n        salmon: '#fa8072',\n        sandybrown: '#f4a460',\n        seagreen: '#2e8b57',\n        seashell: '#fff5ee',\n        sienna: '#a0522d',\n        silver: '#c0c0c0',\n        skyblue: '#87ceeb',\n        slateblue: '#6a5acd',\n        slategray: '#708090',\n        slategrey: '#708090',\n        snow: '#fffafa',\n        springgreen: '#00ff7f',\n        steelblue: '#4682b4',\n        tan: '#d2b48c',\n        teal: '#008080',\n        thistle: '#d8bfd8',\n        tomato: '#ff6347',\n        turquoise: '#40e0d0',\n        violet: '#ee82ee',\n        wheat: '#f5deb3',\n        white: '#ffffff',\n        whitesmoke: '#f5f5f5',\n        yellow: '#ffff00',\n        yellowgreen: '#9acd32'\n    };\n\n    var w3cx11_1 = w3cx11;\n\n    var type$b = utils.type;\n\n\n\n\n\n    Color_1.prototype.name = function() {\n        var hex = rgb2hex_1(this._rgb, 'rgb');\n        for (var i = 0, list = Object.keys(w3cx11_1); i < list.length; i += 1) {\n            var n = list[i];\n\n            if (w3cx11_1[n] === hex) { return n.toLowerCase(); }\n        }\n        return hex;\n    };\n\n    input.format.named = function (name) {\n        name = name.toLowerCase();\n        if (w3cx11_1[name]) { return hex2rgb_1(w3cx11_1[name]); }\n        throw new Error('unknown color name: '+name);\n    };\n\n    input.autodetect.push({\n        p: 5,\n        test: function (h) {\n            var rest = [], len = arguments.length - 1;\n            while ( len-- > 0 ) rest[ len ] = arguments[ len + 1 ];\n\n            if (!rest.length && type$b(h) === 'string' && w3cx11_1[h.toLowerCase()]) {\n                return 'named';\n            }\n        }\n    });\n\n    var unpack$t = utils.unpack;\n\n    var rgb2num = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        var ref = unpack$t(args, 'rgb');\n        var r = ref[0];\n        var g = ref[1];\n        var b = ref[2];\n        return (r << 16) + (g << 8) + b;\n    };\n\n    var rgb2num_1 = rgb2num;\n\n    var type$c = utils.type;\n\n    var num2rgb = function (num) {\n        if (type$c(num) == \"number\" && num >= 0 && num <= 0xFFFFFF) {\n            var r = num >> 16;\n            var g = (num >> 8) & 0xFF;\n            var b = num & 0xFF;\n            return [r,g,b,1];\n        }\n        throw new Error(\"unknown num color: \"+num);\n    };\n\n    var num2rgb_1 = num2rgb;\n\n    var type$d = utils.type;\n\n\n\n    Color_1.prototype.num = function() {\n        return rgb2num_1(this._rgb);\n    };\n\n    chroma_1.num = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        return new (Function.prototype.bind.apply( Color_1, [ null ].concat( args, ['num']) ));\n    };\n\n    input.format.num = num2rgb_1;\n\n    input.autodetect.push({\n        p: 5,\n        test: function () {\n            var args = [], len = arguments.length;\n            while ( len-- ) args[ len ] = arguments[ len ];\n\n            if (args.length === 1 && type$d(args[0]) === 'number' && args[0] >= 0 && args[0] <= 0xFFFFFF) {\n                return 'num';\n            }\n        }\n    });\n\n    var unpack$u = utils.unpack;\n    var type$e = utils.type;\n    var round$5 = Math.round;\n\n    Color_1.prototype.rgb = function(rnd) {\n        if ( rnd === void 0 ) rnd=true;\n\n        if (rnd === false) { return this._rgb.slice(0,3); }\n        return this._rgb.slice(0,3).map(round$5);\n    };\n\n    Color_1.prototype.rgba = function(rnd) {\n        if ( rnd === void 0 ) rnd=true;\n\n        return this._rgb.slice(0,4).map(function (v,i) {\n            return i<3 ? (rnd === false ? v : round$5(v)) : v;\n        });\n    };\n\n    chroma_1.rgb = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        return new (Function.prototype.bind.apply( Color_1, [ null ].concat( args, ['rgb']) ));\n    };\n\n    input.format.rgb = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        var rgba = unpack$u(args, 'rgba');\n        if (rgba[3] === undefined) { rgba[3] = 1; }\n        return rgba;\n    };\n\n    input.autodetect.push({\n        p: 3,\n        test: function () {\n            var args = [], len = arguments.length;\n            while ( len-- ) args[ len ] = arguments[ len ];\n\n            args = unpack$u(args, 'rgba');\n            if (type$e(args) === 'array' && (args.length === 3 ||\n                args.length === 4 && type$e(args[3]) == 'number' && args[3] >= 0 && args[3] <= 1)) {\n                return 'rgb';\n            }\n        }\n    });\n\n    /*\n     * Based on implementation by Neil Bartlett\n     * https://github.com/neilbartlett/color-temperature\n     */\n\n    var log = Math.log;\n\n    var temperature2rgb = function (kelvin) {\n        var temp = kelvin / 100;\n        var r,g,b;\n        if (temp < 66) {\n            r = 255;\n            g = -155.25485562709179 - 0.44596950469579133 * (g = temp-2) + 104.49216199393888 * log(g);\n            b = temp < 20 ? 0 : -254.76935184120902 + 0.8274096064007395 * (b = temp-10) + 115.67994401066147 * log(b);\n        } else {\n            r = 351.97690566805693 + 0.114206453784165 * (r = temp-55) - 40.25366309332127 * log(r);\n            g = 325.4494125711974 + 0.07943456536662342 * (g = temp-50) - 28.0852963507957 * log(g);\n            b = 255;\n        }\n        return [r,g,b,1];\n    };\n\n    var temperature2rgb_1 = temperature2rgb;\n\n    /*\n     * Based on implementation by Neil Bartlett\n     * https://github.com/neilbartlett/color-temperature\n     **/\n\n\n    var unpack$v = utils.unpack;\n    var round$6 = Math.round;\n\n    var rgb2temperature = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        var rgb = unpack$v(args, 'rgb');\n        var r = rgb[0], b = rgb[2];\n        var minTemp = 1000;\n        var maxTemp = 40000;\n        var eps = 0.4;\n        var temp;\n        while (maxTemp - minTemp > eps) {\n            temp = (maxTemp + minTemp) * 0.5;\n            var rgb$1 = temperature2rgb_1(temp);\n            if ((rgb$1[2] / rgb$1[0]) >= (b / r)) {\n                maxTemp = temp;\n            } else {\n                minTemp = temp;\n            }\n        }\n        return round$6(temp);\n    };\n\n    var rgb2temperature_1 = rgb2temperature;\n\n    Color_1.prototype.temp =\n    Color_1.prototype.kelvin =\n    Color_1.prototype.temperature = function() {\n        return rgb2temperature_1(this._rgb);\n    };\n\n    chroma_1.temp =\n    chroma_1.kelvin =\n    chroma_1.temperature = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        return new (Function.prototype.bind.apply( Color_1, [ null ].concat( args, ['temp']) ));\n    };\n\n    input.format.temp =\n    input.format.kelvin =\n    input.format.temperature = temperature2rgb_1;\n\n    var type$f = utils.type;\n\n    Color_1.prototype.alpha = function(a, mutate) {\n        if ( mutate === void 0 ) mutate=false;\n\n        if (a !== undefined && type$f(a) === 'number') {\n            if (mutate) {\n                this._rgb[3] = a;\n                return this;\n            }\n            return new Color_1([this._rgb[0], this._rgb[1], this._rgb[2], a], 'rgb');\n        }\n        return this._rgb[3];\n    };\n\n    Color_1.prototype.clipped = function() {\n        return this._rgb._clipped || false;\n    };\n\n    Color_1.prototype.darken = function(amount) {\n    \tif ( amount === void 0 ) amount=1;\n\n    \tvar me = this;\n    \tvar lab = me.lab();\n    \tlab[0] -= labConstants.Kn * amount;\n    \treturn new Color_1(lab, 'lab').alpha(me.alpha(), true);\n    };\n\n    Color_1.prototype.brighten = function(amount) {\n    \tif ( amount === void 0 ) amount=1;\n\n    \treturn this.darken(-amount);\n    };\n\n    Color_1.prototype.darker = Color_1.prototype.darken;\n    Color_1.prototype.brighter = Color_1.prototype.brighten;\n\n    Color_1.prototype.get = function(mc) {\n        var ref = mc.split('.');\n        var mode = ref[0];\n        var channel = ref[1];\n        var src = this[mode]();\n        if (channel) {\n            var i = mode.indexOf(channel);\n            if (i > -1) { return src[i]; }\n            throw new Error((\"unknown channel \" + channel + \" in mode \" + mode));\n        } else {\n            return src;\n        }\n    };\n\n    var type$g = utils.type;\n    var pow$2 = Math.pow;\n\n    var EPS = 1e-7;\n    var MAX_ITER = 20;\n\n    Color_1.prototype.luminance = function(lum) {\n        if (lum !== undefined && type$g(lum) === 'number') {\n            if (lum === 0) {\n                // return pure black\n                return new Color_1([0,0,0,this._rgb[3]], 'rgb');\n            }\n            if (lum === 1) {\n                // return pure white\n                return new Color_1([255,255,255,this._rgb[3]], 'rgb');\n            }\n            // compute new color using...\n            var cur_lum = this.luminance();\n            var mode = 'rgb';\n            var max_iter = MAX_ITER;\n\n            var test = function (low, high) {\n                var mid = low.interpolate(high, 0.5, mode);\n                var lm = mid.luminance();\n                if (Math.abs(lum - lm) < EPS || !max_iter--) {\n                    // close enough\n                    return mid;\n                }\n                return lm > lum ? test(low, mid) : test(mid, high);\n            };\n\n            var rgb = (cur_lum > lum ? test(new Color_1([0,0,0]), this) : test(this, new Color_1([255,255,255]))).rgb();\n            return new Color_1(rgb.concat( [this._rgb[3]]));\n        }\n        return rgb2luminance.apply(void 0, (this._rgb).slice(0,3));\n    };\n\n\n    var rgb2luminance = function (r,g,b) {\n        // relative luminance\n        // see http://www.w3.org/TR/2008/REC-WCAG20-20081211/#relativeluminancedef\n        r = luminance_x(r);\n        g = luminance_x(g);\n        b = luminance_x(b);\n        return 0.2126 * r + 0.7152 * g + 0.0722 * b;\n    };\n\n    var luminance_x = function (x) {\n        x /= 255;\n        return x <= 0.03928 ? x/12.92 : pow$2((x+0.055)/1.055, 2.4);\n    };\n\n    var interpolator = {};\n\n    var type$h = utils.type;\n\n\n    var mix = function (col1, col2, f) {\n        if ( f === void 0 ) f=0.5;\n        var rest = [], len = arguments.length - 3;\n        while ( len-- > 0 ) rest[ len ] = arguments[ len + 3 ];\n\n        var mode = rest[0] || 'lrgb';\n        if (!interpolator[mode] && !rest.length) {\n            // fall back to the first supported mode\n            mode = Object.keys(interpolator)[0];\n        }\n        if (!interpolator[mode]) {\n            throw new Error((\"interpolation mode \" + mode + \" is not defined\"));\n        }\n        if (type$h(col1) !== 'object') { col1 = new Color_1(col1); }\n        if (type$h(col2) !== 'object') { col2 = new Color_1(col2); }\n        return interpolator[mode](col1, col2, f)\n            .alpha(col1.alpha() + f * (col2.alpha() - col1.alpha()));\n    };\n\n    Color_1.prototype.mix =\n    Color_1.prototype.interpolate = function(col2, f) {\n    \tif ( f === void 0 ) f=0.5;\n    \tvar rest = [], len = arguments.length - 2;\n    \twhile ( len-- > 0 ) rest[ len ] = arguments[ len + 2 ];\n\n    \treturn mix.apply(void 0, [ this, col2, f ].concat( rest ));\n    };\n\n    Color_1.prototype.premultiply = function(mutate) {\n    \tif ( mutate === void 0 ) mutate=false;\n\n    \tvar rgb = this._rgb;\n    \tvar a = rgb[3];\n    \tif (mutate) {\n    \t\tthis._rgb = [rgb[0]*a, rgb[1]*a, rgb[2]*a, a];\n    \t\treturn this;\n    \t} else {\n    \t\treturn new Color_1([rgb[0]*a, rgb[1]*a, rgb[2]*a, a], 'rgb');\n    \t}\n    };\n\n    Color_1.prototype.saturate = function(amount) {\n    \tif ( amount === void 0 ) amount=1;\n\n    \tvar me = this;\n    \tvar lch = me.lch();\n    \tlch[1] += labConstants.Kn * amount;\n    \tif (lch[1] < 0) { lch[1] = 0; }\n    \treturn new Color_1(lch, 'lch').alpha(me.alpha(), true);\n    };\n\n    Color_1.prototype.desaturate = function(amount) {\n    \tif ( amount === void 0 ) amount=1;\n\n    \treturn this.saturate(-amount);\n    };\n\n    var type$i = utils.type;\n\n    Color_1.prototype.set = function(mc, value, mutate) {\n        if ( mutate === void 0 ) mutate=false;\n\n        var ref = mc.split('.');\n        var mode = ref[0];\n        var channel = ref[1];\n        var src = this[mode]();\n        if (channel) {\n            var i = mode.indexOf(channel);\n            if (i > -1) {\n                if (type$i(value) == 'string') {\n                    switch(value.charAt(0)) {\n                        case '+': src[i] += +value; break;\n                        case '-': src[i] += +value; break;\n                        case '*': src[i] *= +(value.substr(1)); break;\n                        case '/': src[i] /= +(value.substr(1)); break;\n                        default: src[i] = +value;\n                    }\n                } else if (type$i(value) === 'number') {\n                    src[i] = value;\n                } else {\n                    throw new Error(\"unsupported value for Color.set\");\n                }\n                var out = new Color_1(src, mode);\n                if (mutate) {\n                    this._rgb = out._rgb;\n                    return this;\n                }\n                return out;\n            }\n            throw new Error((\"unknown channel \" + channel + \" in mode \" + mode));\n        } else {\n            return src;\n        }\n    };\n\n    var rgb$1 = function (col1, col2, f) {\n        var xyz0 = col1._rgb;\n        var xyz1 = col2._rgb;\n        return new Color_1(\n            xyz0[0] + f * (xyz1[0]-xyz0[0]),\n            xyz0[1] + f * (xyz1[1]-xyz0[1]),\n            xyz0[2] + f * (xyz1[2]-xyz0[2]),\n            'rgb'\n        )\n    };\n\n    // register interpolator\n    interpolator.rgb = rgb$1;\n\n    var sqrt$2 = Math.sqrt;\n    var pow$3 = Math.pow;\n\n    var lrgb = function (col1, col2, f) {\n        var ref = col1._rgb;\n        var x1 = ref[0];\n        var y1 = ref[1];\n        var z1 = ref[2];\n        var ref$1 = col2._rgb;\n        var x2 = ref$1[0];\n        var y2 = ref$1[1];\n        var z2 = ref$1[2];\n        return new Color_1(\n            sqrt$2(pow$3(x1,2) * (1-f) + pow$3(x2,2) * f),\n            sqrt$2(pow$3(y1,2) * (1-f) + pow$3(y2,2) * f),\n            sqrt$2(pow$3(z1,2) * (1-f) + pow$3(z2,2) * f),\n            'rgb'\n        )\n    };\n\n    // register interpolator\n    interpolator.lrgb = lrgb;\n\n    var lab$1 = function (col1, col2, f) {\n        var xyz0 = col1.lab();\n        var xyz1 = col2.lab();\n        return new Color_1(\n            xyz0[0] + f * (xyz1[0]-xyz0[0]),\n            xyz0[1] + f * (xyz1[1]-xyz0[1]),\n            xyz0[2] + f * (xyz1[2]-xyz0[2]),\n            'lab'\n        )\n    };\n\n    // register interpolator\n    interpolator.lab = lab$1;\n\n    var _hsx = function (col1, col2, f, m) {\n        var assign, assign$1;\n\n        var xyz0, xyz1;\n        if (m === 'hsl') {\n            xyz0 = col1.hsl();\n            xyz1 = col2.hsl();\n        } else if (m === 'hsv') {\n            xyz0 = col1.hsv();\n            xyz1 = col2.hsv();\n        } else if (m === 'hcg') {\n            xyz0 = col1.hcg();\n            xyz1 = col2.hcg();\n        } else if (m === 'hsi') {\n            xyz0 = col1.hsi();\n            xyz1 = col2.hsi();\n        } else if (m === 'lch' || m === 'hcl') {\n            m = 'hcl';\n            xyz0 = col1.hcl();\n            xyz1 = col2.hcl();\n        }\n\n        var hue0, hue1, sat0, sat1, lbv0, lbv1;\n        if (m.substr(0, 1) === 'h') {\n            (assign = xyz0, hue0 = assign[0], sat0 = assign[1], lbv0 = assign[2]);\n            (assign$1 = xyz1, hue1 = assign$1[0], sat1 = assign$1[1], lbv1 = assign$1[2]);\n        }\n\n        var sat, hue, lbv, dh;\n\n        if (!isNaN(hue0) && !isNaN(hue1)) {\n            // both colors have hue\n            if (hue1 > hue0 && hue1 - hue0 > 180) {\n                dh = hue1-(hue0+360);\n            } else if (hue1 < hue0 && hue0 - hue1 > 180) {\n                dh = hue1+360-hue0;\n            } else{\n                dh = hue1 - hue0;\n            }\n            hue = hue0 + f * dh;\n        } else if (!isNaN(hue0)) {\n            hue = hue0;\n            if ((lbv1 == 1 || lbv1 == 0) && m != 'hsv') { sat = sat0; }\n        } else if (!isNaN(hue1)) {\n            hue = hue1;\n            if ((lbv0 == 1 || lbv0 == 0) && m != 'hsv') { sat = sat1; }\n        } else {\n            hue = Number.NaN;\n        }\n\n        if (sat === undefined) { sat = sat0 + f * (sat1 - sat0); }\n        lbv = lbv0 + f * (lbv1-lbv0);\n        return new Color_1([hue, sat, lbv], m);\n    };\n\n    var lch$1 = function (col1, col2, f) {\n    \treturn _hsx(col1, col2, f, 'lch');\n    };\n\n    // register interpolator\n    interpolator.lch = lch$1;\n    interpolator.hcl = lch$1;\n\n    var num$1 = function (col1, col2, f) {\n        var c1 = col1.num();\n        var c2 = col2.num();\n        return new Color_1(c1 + f * (c2-c1), 'num')\n    };\n\n    // register interpolator\n    interpolator.num = num$1;\n\n    var hcg$1 = function (col1, col2, f) {\n    \treturn _hsx(col1, col2, f, 'hcg');\n    };\n\n    // register interpolator\n    interpolator.hcg = hcg$1;\n\n    var hsi$1 = function (col1, col2, f) {\n    \treturn _hsx(col1, col2, f, 'hsi');\n    };\n\n    // register interpolator\n    interpolator.hsi = hsi$1;\n\n    var hsl$1 = function (col1, col2, f) {\n    \treturn _hsx(col1, col2, f, 'hsl');\n    };\n\n    // register interpolator\n    interpolator.hsl = hsl$1;\n\n    var hsv$1 = function (col1, col2, f) {\n    \treturn _hsx(col1, col2, f, 'hsv');\n    };\n\n    // register interpolator\n    interpolator.hsv = hsv$1;\n\n    var clip_rgb$2 = utils.clip_rgb;\n    var pow$4 = Math.pow;\n    var sqrt$3 = Math.sqrt;\n    var PI$1 = Math.PI;\n    var cos$2 = Math.cos;\n    var sin$1 = Math.sin;\n    var atan2$1 = Math.atan2;\n\n    var average = function (colors, mode, weights) {\n        if ( mode === void 0 ) mode='lrgb';\n        if ( weights === void 0 ) weights=null;\n\n        var l = colors.length;\n        if (!weights) { weights = Array.from(new Array(l)).map(function () { return 1; }); }\n        // normalize weights\n        var k = l / weights.reduce(function(a, b) { return a + b; });\n        weights.forEach(function (w,i) { weights[i] *= k; });\n        // convert colors to Color objects\n        colors = colors.map(function (c) { return new Color_1(c); });\n        if (mode === 'lrgb') {\n            return _average_lrgb(colors, weights)\n        }\n        var first = colors.shift();\n        var xyz = first.get(mode);\n        var cnt = [];\n        var dx = 0;\n        var dy = 0;\n        // initial color\n        for (var i=0; i<xyz.length; i++) {\n            xyz[i] = (xyz[i] || 0) * weights[0];\n            cnt.push(isNaN(xyz[i]) ? 0 : weights[0]);\n            if (mode.charAt(i) === 'h' && !isNaN(xyz[i])) {\n                var A = xyz[i] / 180 * PI$1;\n                dx += cos$2(A) * weights[0];\n                dy += sin$1(A) * weights[0];\n            }\n        }\n\n        var alpha = first.alpha() * weights[0];\n        colors.forEach(function (c,ci) {\n            var xyz2 = c.get(mode);\n            alpha += c.alpha() * weights[ci+1];\n            for (var i=0; i<xyz.length; i++) {\n                if (!isNaN(xyz2[i])) {\n                    cnt[i] += weights[ci+1];\n                    if (mode.charAt(i) === 'h') {\n                        var A = xyz2[i] / 180 * PI$1;\n                        dx += cos$2(A) * weights[ci+1];\n                        dy += sin$1(A) * weights[ci+1];\n                    } else {\n                        xyz[i] += xyz2[i] * weights[ci+1];\n                    }\n                }\n            }\n        });\n\n        for (var i$1=0; i$1<xyz.length; i$1++) {\n            if (mode.charAt(i$1) === 'h') {\n                var A$1 = atan2$1(dy / cnt[i$1], dx / cnt[i$1]) / PI$1 * 180;\n                while (A$1 < 0) { A$1 += 360; }\n                while (A$1 >= 360) { A$1 -= 360; }\n                xyz[i$1] = A$1;\n            } else {\n                xyz[i$1] = xyz[i$1]/cnt[i$1];\n            }\n        }\n        alpha /= l;\n        return (new Color_1(xyz, mode)).alpha(alpha > 0.99999 ? 1 : alpha, true);\n    };\n\n\n    var _average_lrgb = function (colors, weights) {\n        var l = colors.length;\n        var xyz = [0,0,0,0];\n        for (var i=0; i < colors.length; i++) {\n            var col = colors[i];\n            var f = weights[i] / l;\n            var rgb = col._rgb;\n            xyz[0] += pow$4(rgb[0],2) * f;\n            xyz[1] += pow$4(rgb[1],2) * f;\n            xyz[2] += pow$4(rgb[2],2) * f;\n            xyz[3] += rgb[3] * f;\n        }\n        xyz[0] = sqrt$3(xyz[0]);\n        xyz[1] = sqrt$3(xyz[1]);\n        xyz[2] = sqrt$3(xyz[2]);\n        if (xyz[3] > 0.9999999) { xyz[3] = 1; }\n        return new Color_1(clip_rgb$2(xyz));\n    };\n\n    // minimal multi-purpose interface\n\n    // @requires utils color analyze\n\n\n    var type$j = utils.type;\n\n    var pow$5 = Math.pow;\n\n    var scale = function(colors) {\n\n        // constructor\n        var _mode = 'rgb';\n        var _nacol = chroma_1('#ccc');\n        var _spread = 0;\n        // const _fixed = false;\n        var _domain = [0, 1];\n        var _pos = [];\n        var _padding = [0,0];\n        var _classes = false;\n        var _colors = [];\n        var _out = false;\n        var _min = 0;\n        var _max = 1;\n        var _correctLightness = false;\n        var _colorCache = {};\n        var _useCache = true;\n        var _gamma = 1;\n\n        // private methods\n\n        var setColors = function(colors) {\n            colors = colors || ['#fff', '#000'];\n            if (colors && type$j(colors) === 'string' && chroma_1.brewer &&\n                chroma_1.brewer[colors.toLowerCase()]) {\n                colors = chroma_1.brewer[colors.toLowerCase()];\n            }\n            if (type$j(colors) === 'array') {\n                // handle single color\n                if (colors.length === 1) {\n                    colors = [colors[0], colors[0]];\n                }\n                // make a copy of the colors\n                colors = colors.slice(0);\n                // convert to chroma classes\n                for (var c=0; c<colors.length; c++) {\n                    colors[c] = chroma_1(colors[c]);\n                }\n                // auto-fill color position\n                _pos.length = 0;\n                for (var c$1=0; c$1<colors.length; c$1++) {\n                    _pos.push(c$1/(colors.length-1));\n                }\n            }\n            resetCache();\n            return _colors = colors;\n        };\n\n        var getClass = function(value) {\n            if (_classes != null) {\n                var n = _classes.length-1;\n                var i = 0;\n                while (i < n && value >= _classes[i]) {\n                    i++;\n                }\n                return i-1;\n            }\n            return 0;\n        };\n\n        var tMapLightness = function (t) { return t; };\n        var tMapDomain = function (t) { return t; };\n\n        // const classifyValue = function(value) {\n        //     let val = value;\n        //     if (_classes.length > 2) {\n        //         const n = _classes.length-1;\n        //         const i = getClass(value);\n        //         const minc = _classes[0] + ((_classes[1]-_classes[0]) * (0 + (_spread * 0.5)));  // center of 1st class\n        //         const maxc = _classes[n-1] + ((_classes[n]-_classes[n-1]) * (1 - (_spread * 0.5)));  // center of last class\n        //         val = _min + ((((_classes[i] + ((_classes[i+1] - _classes[i]) * 0.5)) - minc) / (maxc-minc)) * (_max - _min));\n        //     }\n        //     return val;\n        // };\n\n        var getColor = function(val, bypassMap) {\n            var col, t;\n            if (bypassMap == null) { bypassMap = false; }\n            if (isNaN(val) || (val === null)) { return _nacol; }\n            if (!bypassMap) {\n                if (_classes && (_classes.length > 2)) {\n                    // find the class\n                    var c = getClass(val);\n                    t = c / (_classes.length-2);\n                } else if (_max !== _min) {\n                    // just interpolate between min/max\n                    t = (val - _min) / (_max - _min);\n                } else {\n                    t = 1;\n                }\n            } else {\n                t = val;\n            }\n\n            // domain map\n            t = tMapDomain(t);\n\n            if (!bypassMap) {\n                t = tMapLightness(t);  // lightness correction\n            }\n\n            if (_gamma !== 1) { t = pow$5(t, _gamma); }\n\n            t = _padding[0] + (t * (1 - _padding[0] - _padding[1]));\n\n            t = Math.min(1, Math.max(0, t));\n\n            var k = Math.floor(t * 10000);\n\n            if (_useCache && _colorCache[k]) {\n                col = _colorCache[k];\n            } else {\n                if (type$j(_colors) === 'array') {\n                    //for i in [0.._pos.length-1]\n                    for (var i=0; i<_pos.length; i++) {\n                        var p = _pos[i];\n                        if (t <= p) {\n                            col = _colors[i];\n                            break;\n                        }\n                        if ((t >= p) && (i === (_pos.length-1))) {\n                            col = _colors[i];\n                            break;\n                        }\n                        if (t > p && t < _pos[i+1]) {\n                            t = (t-p)/(_pos[i+1]-p);\n                            col = chroma_1.interpolate(_colors[i], _colors[i+1], t, _mode);\n                            break;\n                        }\n                    }\n                } else if (type$j(_colors) === 'function') {\n                    col = _colors(t);\n                }\n                if (_useCache) { _colorCache[k] = col; }\n            }\n            return col;\n        };\n\n        var resetCache = function () { return _colorCache = {}; };\n\n        setColors(colors);\n\n        // public interface\n\n        var f = function(v) {\n            var c = chroma_1(getColor(v));\n            if (_out && c[_out]) { return c[_out](); } else { return c; }\n        };\n\n        f.classes = function(classes) {\n            if (classes != null) {\n                if (type$j(classes) === 'array') {\n                    _classes = classes;\n                    _domain = [classes[0], classes[classes.length-1]];\n                } else {\n                    var d = chroma_1.analyze(_domain);\n                    if (classes === 0) {\n                        _classes = [d.min, d.max];\n                    } else {\n                        _classes = chroma_1.limits(d, 'e', classes);\n                    }\n                }\n                return f;\n            }\n            return _classes;\n        };\n\n\n        f.domain = function(domain) {\n            if (!arguments.length) {\n                return _domain;\n            }\n            _min = domain[0];\n            _max = domain[domain.length-1];\n            _pos = [];\n            var k = _colors.length;\n            if ((domain.length === k) && (_min !== _max)) {\n                // update positions\n                for (var i = 0, list = Array.from(domain); i < list.length; i += 1) {\n                    var d = list[i];\n\n                  _pos.push((d-_min) / (_max-_min));\n                }\n            } else {\n                for (var c=0; c<k; c++) {\n                    _pos.push(c/(k-1));\n                }\n                if (domain.length > 2) {\n                    // set domain map\n                    var tOut = domain.map(function (d,i) { return i/(domain.length-1); });\n                    var tBreaks = domain.map(function (d) { return (d - _min) / (_max - _min); });\n                    if (!tBreaks.every(function (val, i) { return tOut[i] === val; })) {\n                        tMapDomain = function (t) {\n                            if (t <= 0 || t >= 1) { return t; }\n                            var i = 0;\n                            while (t >= tBreaks[i+1]) { i++; }\n                            var f = (t - tBreaks[i]) / (tBreaks[i+1] - tBreaks[i]);\n                            var out = tOut[i] + f * (tOut[i+1] - tOut[i]);\n                            return out;\n                        };\n                    }\n\n                }\n            }\n            _domain = [_min, _max];\n            return f;\n        };\n\n        f.mode = function(_m) {\n            if (!arguments.length) {\n                return _mode;\n            }\n            _mode = _m;\n            resetCache();\n            return f;\n        };\n\n        f.range = function(colors, _pos) {\n            setColors(colors, _pos);\n            return f;\n        };\n\n        f.out = function(_o) {\n            _out = _o;\n            return f;\n        };\n\n        f.spread = function(val) {\n            if (!arguments.length) {\n                return _spread;\n            }\n            _spread = val;\n            return f;\n        };\n\n        f.correctLightness = function(v) {\n            if (v == null) { v = true; }\n            _correctLightness = v;\n            resetCache();\n            if (_correctLightness) {\n                tMapLightness = function(t) {\n                    var L0 = getColor(0, true).lab()[0];\n                    var L1 = getColor(1, true).lab()[0];\n                    var pol = L0 > L1;\n                    var L_actual = getColor(t, true).lab()[0];\n                    var L_ideal = L0 + ((L1 - L0) * t);\n                    var L_diff = L_actual - L_ideal;\n                    var t0 = 0;\n                    var t1 = 1;\n                    var max_iter = 20;\n                    while ((Math.abs(L_diff) > 1e-2) && (max_iter-- > 0)) {\n                        (function() {\n                            if (pol) { L_diff *= -1; }\n                            if (L_diff < 0) {\n                                t0 = t;\n                                t += (t1 - t) * 0.5;\n                            } else {\n                                t1 = t;\n                                t += (t0 - t) * 0.5;\n                            }\n                            L_actual = getColor(t, true).lab()[0];\n                            return L_diff = L_actual - L_ideal;\n                        })();\n                    }\n                    return t;\n                };\n            } else {\n                tMapLightness = function (t) { return t; };\n            }\n            return f;\n        };\n\n        f.padding = function(p) {\n            if (p != null) {\n                if (type$j(p) === 'number') {\n                    p = [p,p];\n                }\n                _padding = p;\n                return f;\n            } else {\n                return _padding;\n            }\n        };\n\n        f.colors = function(numColors, out) {\n            // If no arguments are given, return the original colors that were provided\n            if (arguments.length < 2) { out = 'hex'; }\n            var result = [];\n\n            if (arguments.length === 0) {\n                result = _colors.slice(0);\n\n            } else if (numColors === 1) {\n                result = [f(0.5)];\n\n            } else if (numColors > 1) {\n                var dm = _domain[0];\n                var dd = _domain[1] - dm;\n                result = __range__(0, numColors, false).map(function (i) { return f( dm + ((i/(numColors-1)) * dd) ); });\n\n            } else { // returns all colors based on the defined classes\n                colors = [];\n                var samples = [];\n                if (_classes && (_classes.length > 2)) {\n                    for (var i = 1, end = _classes.length, asc = 1 <= end; asc ? i < end : i > end; asc ? i++ : i--) {\n                        samples.push((_classes[i-1]+_classes[i])*0.5);\n                    }\n                } else {\n                    samples = _domain;\n                }\n                result = samples.map(function (v) { return f(v); });\n            }\n\n            if (chroma_1[out]) {\n                result = result.map(function (c) { return c[out](); });\n            }\n            return result;\n        };\n\n        f.cache = function(c) {\n            if (c != null) {\n                _useCache = c;\n                return f;\n            } else {\n                return _useCache;\n            }\n        };\n\n        f.gamma = function(g) {\n            if (g != null) {\n                _gamma = g;\n                return f;\n            } else {\n                return _gamma;\n            }\n        };\n\n        f.nodata = function(d) {\n            if (d != null) {\n                _nacol = chroma_1(d);\n                return f;\n            } else {\n                return _nacol;\n            }\n        };\n\n        return f;\n    };\n\n    function __range__(left, right, inclusive) {\n      var range = [];\n      var ascending = left < right;\n      var end = !inclusive ? right : ascending ? right + 1 : right - 1;\n      for (var i = left; ascending ? i < end : i > end; ascending ? i++ : i--) {\n        range.push(i);\n      }\n      return range;\n    }\n\n    //\n    // interpolates between a set of colors uzing a bezier spline\n    //\n\n    // @requires utils lab\n\n\n\n\n    var bezier = function(colors) {\n        var assign, assign$1, assign$2;\n\n        var I, lab0, lab1, lab2;\n        colors = colors.map(function (c) { return new Color_1(c); });\n        if (colors.length === 2) {\n            // linear interpolation\n            (assign = colors.map(function (c) { return c.lab(); }), lab0 = assign[0], lab1 = assign[1]);\n            I = function(t) {\n                var lab = ([0, 1, 2].map(function (i) { return lab0[i] + (t * (lab1[i] - lab0[i])); }));\n                return new Color_1(lab, 'lab');\n            };\n        } else if (colors.length === 3) {\n            // quadratic bezier interpolation\n            (assign$1 = colors.map(function (c) { return c.lab(); }), lab0 = assign$1[0], lab1 = assign$1[1], lab2 = assign$1[2]);\n            I = function(t) {\n                var lab = ([0, 1, 2].map(function (i) { return ((1-t)*(1-t) * lab0[i]) + (2 * (1-t) * t * lab1[i]) + (t * t * lab2[i]); }));\n                return new Color_1(lab, 'lab');\n            };\n        } else if (colors.length === 4) {\n            // cubic bezier interpolation\n            var lab3;\n            (assign$2 = colors.map(function (c) { return c.lab(); }), lab0 = assign$2[0], lab1 = assign$2[1], lab2 = assign$2[2], lab3 = assign$2[3]);\n            I = function(t) {\n                var lab = ([0, 1, 2].map(function (i) { return ((1-t)*(1-t)*(1-t) * lab0[i]) + (3 * (1-t) * (1-t) * t * lab1[i]) + (3 * (1-t) * t * t * lab2[i]) + (t*t*t * lab3[i]); }));\n                return new Color_1(lab, 'lab');\n            };\n        } else if (colors.length === 5) {\n            var I0 = bezier(colors.slice(0, 3));\n            var I1 = bezier(colors.slice(2, 5));\n            I = function(t) {\n                if (t < 0.5) {\n                    return I0(t*2);\n                } else {\n                    return I1((t-0.5)*2);\n                }\n            };\n        }\n        return I;\n    };\n\n    var bezier_1 = function (colors) {\n        var f = bezier(colors);\n        f.scale = function () { return scale(f); };\n        return f;\n    };\n\n    /*\n     * interpolates between a set of colors uzing a bezier spline\n     * blend mode formulas taken from http://www.venture-ware.com/kevin/coding/lets-learn-math-photoshop-blend-modes/\n     */\n\n\n\n\n    var blend = function (bottom, top, mode) {\n        if (!blend[mode]) {\n            throw new Error('unknown blend mode ' + mode);\n        }\n        return blend[mode](bottom, top);\n    };\n\n    var blend_f = function (f) { return function (bottom,top) {\n            var c0 = chroma_1(top).rgb();\n            var c1 = chroma_1(bottom).rgb();\n            return chroma_1.rgb(f(c0, c1));\n        }; };\n\n    var each = function (f) { return function (c0, c1) {\n            var out = [];\n            out[0] = f(c0[0], c1[0]);\n            out[1] = f(c0[1], c1[1]);\n            out[2] = f(c0[2], c1[2]);\n            return out;\n        }; };\n\n    var normal = function (a) { return a; };\n    var multiply = function (a,b) { return a * b / 255; };\n    var darken$1 = function (a,b) { return a > b ? b : a; };\n    var lighten = function (a,b) { return a > b ? a : b; };\n    var screen = function (a,b) { return 255 * (1 - (1-a/255) * (1-b/255)); };\n    var overlay = function (a,b) { return b < 128 ? 2 * a * b / 255 : 255 * (1 - 2 * (1 - a / 255 ) * ( 1 - b / 255 )); };\n    var burn = function (a,b) { return 255 * (1 - (1 - b / 255) / (a/255)); };\n    var dodge = function (a,b) {\n        if (a === 255) { return 255; }\n        a = 255 * (b / 255) / (1 - a / 255);\n        return a > 255 ? 255 : a\n    };\n\n    // # add = (a,b) ->\n    // #     if (a + b > 255) then 255 else a + b\n\n    blend.normal = blend_f(each(normal));\n    blend.multiply = blend_f(each(multiply));\n    blend.screen = blend_f(each(screen));\n    blend.overlay = blend_f(each(overlay));\n    blend.darken = blend_f(each(darken$1));\n    blend.lighten = blend_f(each(lighten));\n    blend.dodge = blend_f(each(dodge));\n    blend.burn = blend_f(each(burn));\n    // blend.add = blend_f(each(add));\n\n    var blend_1 = blend;\n\n    // cubehelix interpolation\n    // based on D.A. Green \"A colour scheme for the display of astronomical intensity images\"\n    // http://astron-soc.in/bulletin/11June/289392011.pdf\n\n    var type$k = utils.type;\n    var clip_rgb$3 = utils.clip_rgb;\n    var TWOPI$2 = utils.TWOPI;\n    var pow$6 = Math.pow;\n    var sin$2 = Math.sin;\n    var cos$3 = Math.cos;\n\n\n    var cubehelix = function(start, rotations, hue, gamma, lightness) {\n        if ( start === void 0 ) start=300;\n        if ( rotations === void 0 ) rotations=-1.5;\n        if ( hue === void 0 ) hue=1;\n        if ( gamma === void 0 ) gamma=1;\n        if ( lightness === void 0 ) lightness=[0,1];\n\n        var dh = 0, dl;\n        if (type$k(lightness) === 'array') {\n            dl = lightness[1] - lightness[0];\n        } else {\n            dl = 0;\n            lightness = [lightness, lightness];\n        }\n\n        var f = function(fract) {\n            var a = TWOPI$2 * (((start+120)/360) + (rotations * fract));\n            var l = pow$6(lightness[0] + (dl * fract), gamma);\n            var h = dh !== 0 ? hue[0] + (fract * dh) : hue;\n            var amp = (h * l * (1-l)) / 2;\n            var cos_a = cos$3(a);\n            var sin_a = sin$2(a);\n            var r = l + (amp * ((-0.14861 * cos_a) + (1.78277* sin_a)));\n            var g = l + (amp * ((-0.29227 * cos_a) - (0.90649* sin_a)));\n            var b = l + (amp * (+1.97294 * cos_a));\n            return chroma_1(clip_rgb$3([r*255,g*255,b*255,1]));\n        };\n\n        f.start = function(s) {\n            if ((s == null)) { return start; }\n            start = s;\n            return f;\n        };\n\n        f.rotations = function(r) {\n            if ((r == null)) { return rotations; }\n            rotations = r;\n            return f;\n        };\n\n        f.gamma = function(g) {\n            if ((g == null)) { return gamma; }\n            gamma = g;\n            return f;\n        };\n\n        f.hue = function(h) {\n            if ((h == null)) { return hue; }\n            hue = h;\n            if (type$k(hue) === 'array') {\n                dh = hue[1] - hue[0];\n                if (dh === 0) { hue = hue[1]; }\n            } else {\n                dh = 0;\n            }\n            return f;\n        };\n\n        f.lightness = function(h) {\n            if ((h == null)) { return lightness; }\n            if (type$k(h) === 'array') {\n                lightness = h;\n                dl = h[1] - h[0];\n            } else {\n                lightness = [h,h];\n                dl = 0;\n            }\n            return f;\n        };\n\n        f.scale = function () { return chroma_1.scale(f); };\n\n        f.hue(hue);\n\n        return f;\n    };\n\n    var digits = '0123456789abcdef';\n\n    var floor$2 = Math.floor;\n    var random = Math.random;\n\n    var random_1 = function () {\n        var code = '#';\n        for (var i=0; i<6; i++) {\n            code += digits.charAt(floor$2(random() * 16));\n        }\n        return new Color_1(code, 'hex');\n    };\n\n    var log$1 = Math.log;\n    var pow$7 = Math.pow;\n    var floor$3 = Math.floor;\n    var abs = Math.abs;\n\n\n    var analyze = function (data, key) {\n        if ( key === void 0 ) key=null;\n\n        var r = {\n            min: Number.MAX_VALUE,\n            max: Number.MAX_VALUE*-1,\n            sum: 0,\n            values: [],\n            count: 0\n        };\n        if (type(data) === 'object') {\n            data = Object.values(data);\n        }\n        data.forEach(function (val) {\n            if (key && type(val) === 'object') { val = val[key]; }\n            if (val !== undefined && val !== null && !isNaN(val)) {\n                r.values.push(val);\n                r.sum += val;\n                if (val < r.min) { r.min = val; }\n                if (val > r.max) { r.max = val; }\n                r.count += 1;\n            }\n        });\n\n        r.domain = [r.min, r.max];\n\n        r.limits = function (mode, num) { return limits(r, mode, num); };\n\n        return r;\n    };\n\n\n    var limits = function (data, mode, num) {\n        if ( mode === void 0 ) mode='equal';\n        if ( num === void 0 ) num=7;\n\n        if (type(data) == 'array') {\n            data = analyze(data);\n        }\n        var min = data.min;\n        var max = data.max;\n        var values = data.values.sort(function (a,b) { return a-b; });\n\n        if (num === 1) { return [min,max]; }\n\n        var limits = [];\n\n        if (mode.substr(0,1) === 'c') { // continuous\n            limits.push(min);\n            limits.push(max);\n        }\n\n        if (mode.substr(0,1) === 'e') { // equal interval\n            limits.push(min);\n            for (var i=1; i<num; i++) {\n                limits.push(min+((i/num)*(max-min)));\n            }\n            limits.push(max);\n        }\n\n        else if (mode.substr(0,1) === 'l') { // log scale\n            if (min <= 0) {\n                throw new Error('Logarithmic scales are only possible for values > 0');\n            }\n            var min_log = Math.LOG10E * log$1(min);\n            var max_log = Math.LOG10E * log$1(max);\n            limits.push(min);\n            for (var i$1=1; i$1<num; i$1++) {\n                limits.push(pow$7(10, min_log + ((i$1/num) * (max_log - min_log))));\n            }\n            limits.push(max);\n        }\n\n        else if (mode.substr(0,1) === 'q') { // quantile scale\n            limits.push(min);\n            for (var i$2=1; i$2<num; i$2++) {\n                var p = ((values.length-1) * i$2)/num;\n                var pb = floor$3(p);\n                if (pb === p) {\n                    limits.push(values[pb]);\n                } else { // p > pb\n                    var pr = p - pb;\n                    limits.push((values[pb]*(1-pr)) + (values[pb+1]*pr));\n                }\n            }\n            limits.push(max);\n\n        }\n\n        else if (mode.substr(0,1) === 'k') { // k-means clustering\n            /*\n            implementation based on\n            http://code.google.com/p/figue/source/browse/trunk/figue.js#336\n            simplified for 1-d input values\n            */\n            var cluster;\n            var n = values.length;\n            var assignments = new Array(n);\n            var clusterSizes = new Array(num);\n            var repeat = true;\n            var nb_iters = 0;\n            var centroids = null;\n\n            // get seed values\n            centroids = [];\n            centroids.push(min);\n            for (var i$3=1; i$3<num; i$3++) {\n                centroids.push(min + ((i$3/num) * (max-min)));\n            }\n            centroids.push(max);\n\n            while (repeat) {\n                // assignment step\n                for (var j=0; j<num; j++) {\n                    clusterSizes[j] = 0;\n                }\n                for (var i$4=0; i$4<n; i$4++) {\n                    var value = values[i$4];\n                    var mindist = Number.MAX_VALUE;\n                    var best = (void 0);\n                    for (var j$1=0; j$1<num; j$1++) {\n                        var dist = abs(centroids[j$1]-value);\n                        if (dist < mindist) {\n                            mindist = dist;\n                            best = j$1;\n                        }\n                        clusterSizes[best]++;\n                        assignments[i$4] = best;\n                    }\n                }\n\n                // update centroids step\n                var newCentroids = new Array(num);\n                for (var j$2=0; j$2<num; j$2++) {\n                    newCentroids[j$2] = null;\n                }\n                for (var i$5=0; i$5<n; i$5++) {\n                    cluster = assignments[i$5];\n                    if (newCentroids[cluster] === null) {\n                        newCentroids[cluster] = values[i$5];\n                    } else {\n                        newCentroids[cluster] += values[i$5];\n                    }\n                }\n                for (var j$3=0; j$3<num; j$3++) {\n                    newCentroids[j$3] *= 1/clusterSizes[j$3];\n                }\n\n                // check convergence\n                repeat = false;\n                for (var j$4=0; j$4<num; j$4++) {\n                    if (newCentroids[j$4] !== centroids[j$4]) {\n                        repeat = true;\n                        break;\n                    }\n                }\n\n                centroids = newCentroids;\n                nb_iters++;\n\n                if (nb_iters > 200) {\n                    repeat = false;\n                }\n            }\n\n            // finished k-means clustering\n            // the next part is borrowed from gabrielflor.it\n            var kClusters = {};\n            for (var j$5=0; j$5<num; j$5++) {\n                kClusters[j$5] = [];\n            }\n            for (var i$6=0; i$6<n; i$6++) {\n                cluster = assignments[i$6];\n                kClusters[cluster].push(values[i$6]);\n            }\n            var tmpKMeansBreaks = [];\n            for (var j$6=0; j$6<num; j$6++) {\n                tmpKMeansBreaks.push(kClusters[j$6][0]);\n                tmpKMeansBreaks.push(kClusters[j$6][kClusters[j$6].length-1]);\n            }\n            tmpKMeansBreaks = tmpKMeansBreaks.sort(function (a,b){ return a-b; });\n            limits.push(tmpKMeansBreaks[0]);\n            for (var i$7=1; i$7 < tmpKMeansBreaks.length; i$7+= 2) {\n                var v = tmpKMeansBreaks[i$7];\n                if (!isNaN(v) && (limits.indexOf(v) === -1)) {\n                    limits.push(v);\n                }\n            }\n        }\n        return limits;\n    };\n\n    var analyze_1 = {analyze: analyze, limits: limits};\n\n    var contrast = function (a, b) {\n        // WCAG contrast ratio\n        // see http://www.w3.org/TR/2008/REC-WCAG20-20081211/#contrast-ratiodef\n        a = new Color_1(a);\n        b = new Color_1(b);\n        var l1 = a.luminance();\n        var l2 = b.luminance();\n        return l1 > l2 ? (l1 + 0.05) / (l2 + 0.05) : (l2 + 0.05) / (l1 + 0.05);\n    };\n\n    var sqrt$4 = Math.sqrt;\n    var atan2$2 = Math.atan2;\n    var abs$1 = Math.abs;\n    var cos$4 = Math.cos;\n    var PI$2 = Math.PI;\n\n    var deltaE = function(a, b, L, C) {\n        if ( L === void 0 ) L=1;\n        if ( C === void 0 ) C=1;\n\n        // Delta E (CMC)\n        // see http://www.brucelindbloom.com/index.html?Eqn_DeltaE_CMC.html\n        a = new Color_1(a);\n        b = new Color_1(b);\n        var ref = Array.from(a.lab());\n        var L1 = ref[0];\n        var a1 = ref[1];\n        var b1 = ref[2];\n        var ref$1 = Array.from(b.lab());\n        var L2 = ref$1[0];\n        var a2 = ref$1[1];\n        var b2 = ref$1[2];\n        var c1 = sqrt$4((a1 * a1) + (b1 * b1));\n        var c2 = sqrt$4((a2 * a2) + (b2 * b2));\n        var sl = L1 < 16.0 ? 0.511 : (0.040975 * L1) / (1.0 + (0.01765 * L1));\n        var sc = ((0.0638 * c1) / (1.0 + (0.0131 * c1))) + 0.638;\n        var h1 = c1 < 0.000001 ? 0.0 : (atan2$2(b1, a1) * 180.0) / PI$2;\n        while (h1 < 0) { h1 += 360; }\n        while (h1 >= 360) { h1 -= 360; }\n        var t = (h1 >= 164.0) && (h1 <= 345.0) ? (0.56 + abs$1(0.2 * cos$4((PI$2 * (h1 + 168.0)) / 180.0))) : (0.36 + abs$1(0.4 * cos$4((PI$2 * (h1 + 35.0)) / 180.0)));\n        var c4 = c1 * c1 * c1 * c1;\n        var f = sqrt$4(c4 / (c4 + 1900.0));\n        var sh = sc * (((f * t) + 1.0) - f);\n        var delL = L1 - L2;\n        var delC = c1 - c2;\n        var delA = a1 - a2;\n        var delB = b1 - b2;\n        var dH2 = ((delA * delA) + (delB * delB)) - (delC * delC);\n        var v1 = delL / (L * sl);\n        var v2 = delC / (C * sc);\n        var v3 = sh;\n        return sqrt$4((v1 * v1) + (v2 * v2) + (dH2 / (v3 * v3)));\n    };\n\n    // simple Euclidean distance\n    var distance = function(a, b, mode) {\n        if ( mode === void 0 ) mode='lab';\n\n        // Delta E (CIE 1976)\n        // see http://www.brucelindbloom.com/index.html?Equations.html\n        a = new Color_1(a);\n        b = new Color_1(b);\n        var l1 = a.get(mode);\n        var l2 = b.get(mode);\n        var sum_sq = 0;\n        for (var i in l1) {\n            var d = (l1[i] || 0) - (l2[i] || 0);\n            sum_sq += d*d;\n        }\n        return Math.sqrt(sum_sq);\n    };\n\n    var valid = function () {\n        var args = [], len = arguments.length;\n        while ( len-- ) args[ len ] = arguments[ len ];\n\n        try {\n            new (Function.prototype.bind.apply( Color_1, [ null ].concat( args) ));\n            return true;\n        } catch (e) {\n            return false;\n        }\n    };\n\n    // some pre-defined color scales:\n\n\n\n\n    var scales = {\n    \tcool: function cool() { return scale([chroma_1.hsl(180,1,.9), chroma_1.hsl(250,.7,.4)]) },\n    \thot: function hot() { return scale(['#000','#f00','#ff0','#fff'], [0,.25,.75,1]).mode('rgb') }\n    };\n\n    /**\n        ColorBrewer colors for chroma.js\n\n        Copyright (c) 2002 Cynthia Brewer, Mark Harrower, and The\n        Pennsylvania State University.\n\n        Licensed under the Apache License, Version 2.0 (the \"License\");\n        you may not use this file except in compliance with the License.\n        You may obtain a copy of the License at\n        http://www.apache.org/licenses/LICENSE-2.0\n\n        Unless required by applicable law or agreed to in writing, software distributed\n        under the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR\n        CONDITIONS OF ANY KIND, either express or implied. See the License for the\n        specific language governing permissions and limitations under the License.\n    */\n\n    var colorbrewer = {\n        // sequential\n        OrRd: ['#fff7ec', '#fee8c8', '#fdd49e', '#fdbb84', '#fc8d59', '#ef6548', '#d7301f', '#b30000', '#7f0000'],\n        PuBu: ['#fff7fb', '#ece7f2', '#d0d1e6', '#a6bddb', '#74a9cf', '#3690c0', '#0570b0', '#045a8d', '#023858'],\n        BuPu: ['#f7fcfd', '#e0ecf4', '#bfd3e6', '#9ebcda', '#8c96c6', '#8c6bb1', '#88419d', '#810f7c', '#4d004b'],\n        Oranges: ['#fff5eb', '#fee6ce', '#fdd0a2', '#fdae6b', '#fd8d3c', '#f16913', '#d94801', '#a63603', '#7f2704'],\n        BuGn: ['#f7fcfd', '#e5f5f9', '#ccece6', '#99d8c9', '#66c2a4', '#41ae76', '#238b45', '#006d2c', '#00441b'],\n        YlOrBr: ['#ffffe5', '#fff7bc', '#fee391', '#fec44f', '#fe9929', '#ec7014', '#cc4c02', '#993404', '#662506'],\n        YlGn: ['#ffffe5', '#f7fcb9', '#d9f0a3', '#addd8e', '#78c679', '#41ab5d', '#238443', '#006837', '#004529'],\n        Reds: ['#fff5f0', '#fee0d2', '#fcbba1', '#fc9272', '#fb6a4a', '#ef3b2c', '#cb181d', '#a50f15', '#67000d'],\n        RdPu: ['#fff7f3', '#fde0dd', '#fcc5c0', '#fa9fb5', '#f768a1', '#dd3497', '#ae017e', '#7a0177', '#49006a'],\n        Greens: ['#f7fcf5', '#e5f5e0', '#c7e9c0', '#a1d99b', '#74c476', '#41ab5d', '#238b45', '#006d2c', '#00441b'],\n        YlGnBu: ['#ffffd9', '#edf8b1', '#c7e9b4', '#7fcdbb', '#41b6c4', '#1d91c0', '#225ea8', '#253494', '#081d58'],\n        Purples: ['#fcfbfd', '#efedf5', '#dadaeb', '#bcbddc', '#9e9ac8', '#807dba', '#6a51a3', '#54278f', '#3f007d'],\n        GnBu: ['#f7fcf0', '#e0f3db', '#ccebc5', '#a8ddb5', '#7bccc4', '#4eb3d3', '#2b8cbe', '#0868ac', '#084081'],\n        Greys: ['#ffffff', '#f0f0f0', '#d9d9d9', '#bdbdbd', '#969696', '#737373', '#525252', '#252525', '#000000'],\n        YlOrRd: ['#ffffcc', '#ffeda0', '#fed976', '#feb24c', '#fd8d3c', '#fc4e2a', '#e31a1c', '#bd0026', '#800026'],\n        PuRd: ['#f7f4f9', '#e7e1ef', '#d4b9da', '#c994c7', '#df65b0', '#e7298a', '#ce1256', '#980043', '#67001f'],\n        Blues: ['#f7fbff', '#deebf7', '#c6dbef', '#9ecae1', '#6baed6', '#4292c6', '#2171b5', '#08519c', '#08306b'],\n        PuBuGn: ['#fff7fb', '#ece2f0', '#d0d1e6', '#a6bddb', '#67a9cf', '#3690c0', '#02818a', '#016c59', '#014636'],\n        Viridis: ['#440154', '#482777', '#3f4a8a', '#31678e', '#26838f', '#1f9d8a', '#6cce5a', '#b6de2b', '#fee825'],\n\n        // diverging\n\n        Spectral: ['#9e0142', '#d53e4f', '#f46d43', '#fdae61', '#fee08b', '#ffffbf', '#e6f598', '#abdda4', '#66c2a5', '#3288bd', '#5e4fa2'],\n        RdYlGn: ['#a50026', '#d73027', '#f46d43', '#fdae61', '#fee08b', '#ffffbf', '#d9ef8b', '#a6d96a', '#66bd63', '#1a9850', '#006837'],\n        RdBu: ['#67001f', '#b2182b', '#d6604d', '#f4a582', '#fddbc7', '#f7f7f7', '#d1e5f0', '#92c5de', '#4393c3', '#2166ac', '#053061'],\n        PiYG: ['#8e0152', '#c51b7d', '#de77ae', '#f1b6da', '#fde0ef', '#f7f7f7', '#e6f5d0', '#b8e186', '#7fbc41', '#4d9221', '#276419'],\n        PRGn: ['#40004b', '#762a83', '#9970ab', '#c2a5cf', '#e7d4e8', '#f7f7f7', '#d9f0d3', '#a6dba0', '#5aae61', '#1b7837', '#00441b'],\n        RdYlBu: ['#a50026', '#d73027', '#f46d43', '#fdae61', '#fee090', '#ffffbf', '#e0f3f8', '#abd9e9', '#74add1', '#4575b4', '#313695'],\n        BrBG: ['#543005', '#8c510a', '#bf812d', '#dfc27d', '#f6e8c3', '#f5f5f5', '#c7eae5', '#80cdc1', '#35978f', '#01665e', '#003c30'],\n        RdGy: ['#67001f', '#b2182b', '#d6604d', '#f4a582', '#fddbc7', '#ffffff', '#e0e0e0', '#bababa', '#878787', '#4d4d4d', '#1a1a1a'],\n        PuOr: ['#7f3b08', '#b35806', '#e08214', '#fdb863', '#fee0b6', '#f7f7f7', '#d8daeb', '#b2abd2', '#8073ac', '#542788', '#2d004b'],\n\n        // qualitative\n\n        Set2: ['#66c2a5', '#fc8d62', '#8da0cb', '#e78ac3', '#a6d854', '#ffd92f', '#e5c494', '#b3b3b3'],\n        Accent: ['#7fc97f', '#beaed4', '#fdc086', '#ffff99', '#386cb0', '#f0027f', '#bf5b17', '#666666'],\n        Set1: ['#e41a1c', '#377eb8', '#4daf4a', '#984ea3', '#ff7f00', '#ffff33', '#a65628', '#f781bf', '#999999'],\n        Set3: ['#8dd3c7', '#ffffb3', '#bebada', '#fb8072', '#80b1d3', '#fdb462', '#b3de69', '#fccde5', '#d9d9d9', '#bc80bd', '#ccebc5', '#ffed6f'],\n        Dark2: ['#1b9e77', '#d95f02', '#7570b3', '#e7298a', '#66a61e', '#e6ab02', '#a6761d', '#666666'],\n        Paired: ['#a6cee3', '#1f78b4', '#b2df8a', '#33a02c', '#fb9a99', '#e31a1c', '#fdbf6f', '#ff7f00', '#cab2d6', '#6a3d9a', '#ffff99', '#b15928'],\n        Pastel2: ['#b3e2cd', '#fdcdac', '#cbd5e8', '#f4cae4', '#e6f5c9', '#fff2ae', '#f1e2cc', '#cccccc'],\n        Pastel1: ['#fbb4ae', '#b3cde3', '#ccebc5', '#decbe4', '#fed9a6', '#ffffcc', '#e5d8bd', '#fddaec', '#f2f2f2'],\n    };\n\n    // add lowercase aliases for case-insensitive matches\n    for (var i$1 = 0, list$1 = Object.keys(colorbrewer); i$1 < list$1.length; i$1 += 1) {\n        var key = list$1[i$1];\n\n        colorbrewer[key.toLowerCase()] = colorbrewer[key];\n    }\n\n    var colorbrewer_1 = colorbrewer;\n\n    // feel free to comment out anything to rollup\n    // a smaller chroma.js built\n\n    // io --> convert colors\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    // operators --> modify existing Colors\n\n\n\n\n\n\n\n\n\n\n    // interpolators\n\n\n\n\n\n\n\n\n\n\n    // generators -- > create new colors\n    chroma_1.average = average;\n    chroma_1.bezier = bezier_1;\n    chroma_1.blend = blend_1;\n    chroma_1.cubehelix = cubehelix;\n    chroma_1.mix = chroma_1.interpolate = mix;\n    chroma_1.random = random_1;\n    chroma_1.scale = scale;\n\n    // other utility methods\n    chroma_1.analyze = analyze_1.analyze;\n    chroma_1.contrast = contrast;\n    chroma_1.deltaE = deltaE;\n    chroma_1.distance = distance;\n    chroma_1.limits = analyze_1.limits;\n    chroma_1.valid = valid;\n\n    // scale\n    chroma_1.scales = scales;\n\n    // colors\n    chroma_1.colors = w3cx11_1;\n    chroma_1.brewer = colorbrewer_1;\n\n    var chroma_js = chroma_1;\n\n    return chroma_js;\n\n})));\n", "(function(root, factory) {\n    'use strict';\n    // Universal Module Definition (UMD) to support AMD, CommonJS/Node.js, Rhino, and browsers.\n\n    /* istanbul ignore next */\n    if (typeof define === 'function' && define.amd) {\n        define('stackframe', [], factory);\n    } else if (typeof exports === 'object') {\n        module.exports = factory();\n    } else {\n        root.StackFrame = factory();\n    }\n}(this, function() {\n    'use strict';\n    function _isNumber(n) {\n        return !isNaN(parseFloat(n)) && isFinite(n);\n    }\n\n    function _capitalize(str) {\n        return str.charAt(0).toUpperCase() + str.substring(1);\n    }\n\n    function _getter(p) {\n        return function() {\n            return this[p];\n        };\n    }\n\n    var booleanProps = ['isConstructor', 'isEval', 'isNative', 'isToplevel'];\n    var numericProps = ['columnNumber', 'lineNumber'];\n    var stringProps = ['fileName', 'functionName', 'source'];\n    var arrayProps = ['args'];\n    var objectProps = ['evalOrigin'];\n\n    var props = booleanProps.concat(numericProps, stringProps, arrayProps, objectProps);\n\n    function StackFrame(obj) {\n        if (!obj) return;\n        for (var i = 0; i < props.length; i++) {\n            if (obj[props[i]] !== undefined) {\n                this['set' + _capitalize(props[i])](obj[props[i]]);\n            }\n        }\n    }\n\n    StackFrame.prototype = {\n        getArgs: function() {\n            return this.args;\n        },\n        setArgs: function(v) {\n            if (Object.prototype.toString.call(v) !== '[object Array]') {\n                throw new TypeError('Args must be an Array');\n            }\n            this.args = v;\n        },\n\n        getEvalOrigin: function() {\n            return this.evalOrigin;\n        },\n        setEvalOrigin: function(v) {\n            if (v instanceof StackFrame) {\n                this.evalOrigin = v;\n            } else if (v instanceof Object) {\n                this.evalOrigin = new StackFrame(v);\n            } else {\n                throw new TypeError('Eval Origin must be an Object or StackFrame');\n            }\n        },\n\n        toString: function() {\n            var fileName = this.getFileName() || '';\n            var lineNumber = this.getLineNumber() || '';\n            var columnNumber = this.getColumnNumber() || '';\n            var functionName = this.getFunctionName() || '';\n            if (this.getIsEval()) {\n                if (fileName) {\n                    return '[eval] (' + fileName + ':' + lineNumber + ':' + columnNumber + ')';\n                }\n                return '[eval]:' + lineNumber + ':' + columnNumber;\n            }\n            if (functionName) {\n                return functionName + ' (' + fileName + ':' + lineNumber + ':' + columnNumber + ')';\n            }\n            return fileName + ':' + lineNumber + ':' + columnNumber;\n        }\n    };\n\n    StackFrame.fromString = function StackFrame$$fromString(str) {\n        var argsStartIndex = str.indexOf('(');\n        var argsEndIndex = str.lastIndexOf(')');\n\n        var functionName = str.substring(0, argsStartIndex);\n        var args = str.substring(argsStartIndex + 1, argsEndIndex).split(',');\n        var locationString = str.substring(argsEndIndex + 1);\n\n        if (locationString.indexOf('@') === 0) {\n            var parts = /@(.+?)(?::(\\d+))?(?::(\\d+))?$/.exec(locationString, '');\n            var fileName = parts[1];\n            var lineNumber = parts[2];\n            var columnNumber = parts[3];\n        }\n\n        return new StackFrame({\n            functionName: functionName,\n            args: args || undefined,\n            fileName: fileName,\n            lineNumber: lineNumber || undefined,\n            columnNumber: columnNumber || undefined\n        });\n    };\n\n    for (var i = 0; i < booleanProps.length; i++) {\n        StackFrame.prototype['get' + _capitalize(booleanProps[i])] = _getter(booleanProps[i]);\n        StackFrame.prototype['set' + _capitalize(booleanProps[i])] = (function(p) {\n            return function(v) {\n                this[p] = Boolean(v);\n            };\n        })(booleanProps[i]);\n    }\n\n    for (var j = 0; j < numericProps.length; j++) {\n        StackFrame.prototype['get' + _capitalize(numericProps[j])] = _getter(numericProps[j]);\n        StackFrame.prototype['set' + _capitalize(numericProps[j])] = (function(p) {\n            return function(v) {\n                if (!_isNumber(v)) {\n                    throw new TypeError(p + ' must be a Number');\n                }\n                this[p] = Number(v);\n            };\n        })(numericProps[j]);\n    }\n\n    for (var k = 0; k < stringProps.length; k++) {\n        StackFrame.prototype['get' + _capitalize(stringProps[k])] = _getter(stringProps[k]);\n        StackFrame.prototype['set' + _capitalize(stringProps[k])] = (function(p) {\n            return function(v) {\n                this[p] = String(v);\n            };\n        })(stringProps[k]);\n    }\n\n    return StackFrame;\n}));\n", "(function(root, factory) {\n    'use strict';\n    // Universal Module Definition (UMD) to support AMD, CommonJS/Node.js, Rhino, and browsers.\n\n    /* istanbul ignore next */\n    if (typeof define === 'function' && define.amd) {\n        define('error-stack-parser', ['stackframe'], factory);\n    } else if (typeof exports === 'object') {\n        module.exports = factory(require('stackframe'));\n    } else {\n        root.ErrorStackParser = factory(root.StackFrame);\n    }\n}(this, function ErrorStackParser(StackFrame) {\n    'use strict';\n\n    var FIREFOX_SAFARI_STACK_REGEXP = /(^|@)\\S+:\\d+/;\n    var CHROME_IE_STACK_REGEXP = /^\\s*at .*(\\S+:\\d+|\\(native\\))/m;\n    var SAFARI_NATIVE_CODE_REGEXP = /^(eval@)?(\\[native code])?$/;\n\n    return {\n        /**\n         * Given an Error object, extract the most information from it.\n         *\n         * @param {Error} error object\n         * @return {Array} of StackFrames\n         */\n        parse: function ErrorStackParser$$parse(error) {\n            if (typeof error.stacktrace !== 'undefined' || typeof error['opera#sourceloc'] !== 'undefined') {\n                return this.parseOpera(error);\n            } else if (error.stack && error.stack.match(CHROME_IE_STACK_REGEXP)) {\n                return this.parseV8OrIE(error);\n            } else if (error.stack) {\n                return this.parseFFOrSafari(error);\n            } else {\n                throw new Error('Cannot parse given Error object');\n            }\n        },\n\n        // Separate line and column numbers from a string of the form: (URI:Line:Column)\n        extractLocation: function ErrorStackParser$$extractLocation(urlLike) {\n            // Fail-fast but return locations like \"(native)\"\n            if (urlLike.indexOf(':') === -1) {\n                return [urlLike];\n            }\n\n            var regExp = /(.+?)(?::(\\d+))?(?::(\\d+))?$/;\n            var parts = regExp.exec(urlLike.replace(/[()]/g, ''));\n            return [parts[1], parts[2] || undefined, parts[3] || undefined];\n        },\n\n        parseV8OrIE: function ErrorStackParser$$parseV8OrIE(error) {\n            var filtered = error.stack.split('\\n').filter(function(line) {\n                return !!line.match(CHROME_IE_STACK_REGEXP);\n            }, this);\n\n            return filtered.map(function(line) {\n                if (line.indexOf('(eval ') > -1) {\n                    // Throw away eval information until we implement stacktrace.js/stackframe#8\n                    line = line.replace(/eval code/g, 'eval').replace(/(\\(eval at [^()]*)|(\\),.*$)/g, '');\n                }\n                var sanitizedLine = line.replace(/^\\s+/, '').replace(/\\(eval code/g, '(');\n\n                // capture and preseve the parenthesized location \"(/foo/my bar.js:12:87)\" in\n                // case it has spaces in it, as the string is split on \\s+ later on\n                var location = sanitizedLine.match(/ (\\((.+):(\\d+):(\\d+)\\)$)/);\n\n                // remove the parenthesized location from the line, if it was matched\n                sanitizedLine = location ? sanitizedLine.replace(location[0], '') : sanitizedLine;\n\n                var tokens = sanitizedLine.split(/\\s+/).slice(1);\n                // if a location was matched, pass it to extractLocation() otherwise pop the last token\n                var locationParts = this.extractLocation(location ? location[1] : tokens.pop());\n                var functionName = tokens.join(' ') || undefined;\n                var fileName = ['eval', '<anonymous>'].indexOf(locationParts[0]) > -1 ? undefined : locationParts[0];\n\n                return new StackFrame({\n                    functionName: functionName,\n                    fileName: fileName,\n                    lineNumber: locationParts[1],\n                    columnNumber: locationParts[2],\n                    source: line\n                });\n            }, this);\n        },\n\n        parseFFOrSafari: function ErrorStackParser$$parseFFOrSafari(error) {\n            var filtered = error.stack.split('\\n').filter(function(line) {\n                return !line.match(SAFARI_NATIVE_CODE_REGEXP);\n            }, this);\n\n            return filtered.map(function(line) {\n                // Throw away eval information until we implement stacktrace.js/stackframe#8\n                if (line.indexOf(' > eval') > -1) {\n                    line = line.replace(/ line (\\d+)(?: > eval line \\d+)* > eval:\\d+:\\d+/g, ':$1');\n                }\n\n                if (line.indexOf('@') === -1 && line.indexOf(':') === -1) {\n                    // Safari eval frames only have function names and nothing else\n                    return new StackFrame({\n                        functionName: line\n                    });\n                } else {\n                    var functionNameRegex = /((.*\".+\"[^@]*)?[^@]*)(?:@)/;\n                    var matches = line.match(functionNameRegex);\n                    var functionName = matches && matches[1] ? matches[1] : undefined;\n                    var locationParts = this.extractLocation(line.replace(functionNameRegex, ''));\n\n                    return new StackFrame({\n                        functionName: functionName,\n                        fileName: locationParts[0],\n                        lineNumber: locationParts[1],\n                        columnNumber: locationParts[2],\n                        source: line\n                    });\n                }\n            }, this);\n        },\n\n        parseOpera: function ErrorStackParser$$parseOpera(e) {\n            if (!e.stacktrace || (e.message.indexOf('\\n') > -1 &&\n                e.message.split('\\n').length > e.stacktrace.split('\\n').length)) {\n                return this.parseOpera9(e);\n            } else if (!e.stack) {\n                return this.parseOpera10(e);\n            } else {\n                return this.parseOpera11(e);\n            }\n        },\n\n        parseOpera9: function ErrorStackParser$$parseOpera9(e) {\n            var lineRE = /Line (\\d+).*script (?:in )?(\\S+)/i;\n            var lines = e.message.split('\\n');\n            var result = [];\n\n            for (var i = 2, len = lines.length; i < len; i += 2) {\n                var match = lineRE.exec(lines[i]);\n                if (match) {\n                    result.push(new StackFrame({\n                        fileName: match[2],\n                        lineNumber: match[1],\n                        source: lines[i]\n                    }));\n                }\n            }\n\n            return result;\n        },\n\n        parseOpera10: function ErrorStackParser$$parseOpera10(e) {\n            var lineRE = /Line (\\d+).*script (?:in )?(\\S+)(?:: In function (\\S+))?$/i;\n            var lines = e.stacktrace.split('\\n');\n            var result = [];\n\n            for (var i = 0, len = lines.length; i < len; i += 2) {\n                var match = lineRE.exec(lines[i]);\n                if (match) {\n                    result.push(\n                        new StackFrame({\n                            functionName: match[3] || undefined,\n                            fileName: match[2],\n                            lineNumber: match[1],\n                            source: lines[i]\n                        })\n                    );\n                }\n            }\n\n            return result;\n        },\n\n        // Opera 10.65+ Error.stack very similar to FF/Safari\n        parseOpera11: function ErrorStackParser$$parseOpera11(error) {\n            var filtered = error.stack.split('\\n').filter(function(line) {\n                return !!line.match(FIREFOX_SAFARI_STACK_REGEXP) && !line.match(/^Error created at/);\n            }, this);\n\n            return filtered.map(function(line) {\n                var tokens = line.split('@');\n                var locationParts = this.extractLocation(tokens.pop());\n                var functionCall = (tokens.shift() || '');\n                var functionName = functionCall\n                    .replace(/<anonymous function(: (\\w+))?>/, '$2')\n                    .replace(/\\([^)]*\\)/g, '') || undefined;\n                var argsRaw;\n                if (functionCall.match(/\\(([^)]*)\\)/)) {\n                    argsRaw = functionCall.replace(/^[^(]+\\(([^)]*)\\)$/, '$1');\n                }\n                var args = (argsRaw === undefined || argsRaw === '[arguments not available]') ?\n                    undefined : argsRaw.split(',');\n\n                return new StackFrame({\n                    functionName: functionName,\n                    args: args,\n                    fileName: locationParts[0],\n                    lineNumber: locationParts[1],\n                    columnNumber: locationParts[2],\n                    source: line\n                });\n            }, this);\n        }\n    };\n}));\n", "export const EMPTY_OBJ = {};\r\nexport const EMPTY_ARR = [];\r\nexport const IS_NON_DIMENSIONAL = /acit|ex(?:s|g|n|p|$)|rph|grid|ows|mnc|ntw|ine[ch]|zoo|^ord|itera/i;\r\n", "import { EMPTY_ARR } from \"./constants\";\r\n\r\n/**\r\n * Assign properties from `props` to `obj`\r\n * @template O, P The obj and props types\r\n * @param {O} obj The object to copy properties to\r\n * @param {P} props The object to copy properties from\r\n * @returns {O & P}\r\n */\r\nexport function assign(obj, props) {\r\n\t// @ts-ignore We change the type of `obj` to be `O & P`\r\n\tfor (let i in props) obj[i] = props[i];\r\n\treturn /** @type {O & P} */ (obj);\r\n}\r\n\r\n/**\r\n * Remove a child node from its parent if attached. This is a workaround for\r\n * IE11 which doesn't support `Element.prototype.remove()`. Using this function\r\n * is smaller than including a dedicated polyfill.\r\n * @param {Node} node The node to remove\r\n */\r\nexport function removeNode(node) {\r\n\tlet parentNode = node.parentNode;\r\n\tif (parentNode) parentNode.removeChild(node);\r\n}\r\n\r\nexport const slice = EMPTY_ARR.slice;\r\n", "import { _catchError } from './diff/catch-error';\r\n\r\n/**\r\n * The `option` object can potentially contain callback functions\r\n * that are called during various stages of our renderer. This is the\r\n * foundation on which all our addons like `preact/debug`, `preact/compat`,\r\n * and `preact/hooks` are based on. See the `Options` type in `internal.d.ts`\r\n * for a full list of available option hooks (most editors/IDEs allow you to\r\n * ctrl+click or cmd+click on mac the type definition below).\r\n * @type {import('./internal').Options}\r\n */\r\nconst options = {\r\n\t_catchError\r\n};\r\n\r\nexport default options;\r\n", "import { slice } from './util';\r\nimport options from './options';\r\n\r\nlet vnodeId = 0;\r\n\r\n/**\r\n * Create an virtual node (used for JSX)\r\n * @param {import('./internal').VNode[\"type\"]} type The node name or Component\r\n * constructor for this virtual node\r\n * @param {object | null | undefined} [props] The properties of the virtual node\r\n * @param {Array<import('.').ComponentChildren>} [children] The children of the virtual node\r\n * @returns {import('./internal').VNode}\r\n */\r\nexport function createElement(type, props, children) {\r\n\tlet normalizedProps = {},\r\n\t\tkey,\r\n\t\tref,\r\n\t\ti;\r\n\tfor (i in props) {\r\n\t\tif (i == 'key') key = props[i];\r\n\t\telse if (i == 'ref') ref = props[i];\r\n\t\telse normalizedProps[i] = props[i];\r\n\t}\r\n\r\n\tif (arguments.length > 2) {\r\n\t\tnormalizedProps.children =\r\n\t\t\targuments.length > 3 ? slice.call(arguments, 2) : children;\r\n\t}\r\n\r\n\t// If a Component VNode, check for and apply defaultProps\r\n\t// Note: type may be undefined in development, must never error here.\r\n\tif (typeof type == 'function' && type.defaultProps != null) {\r\n\t\tfor (i in type.defaultProps) {\r\n\t\t\tif (normalizedProps[i] === undefined) {\r\n\t\t\t\tnormalizedProps[i] = type.defaultProps[i];\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\treturn createVNode(type, normalizedProps, key, ref, null);\r\n}\r\n\r\n/**\r\n * Create a VNode (used internally by Preact)\r\n * @param {import('./internal').VNode[\"type\"]} type The node name or Component\r\n * Constructor for this virtual node\r\n * @param {object | string | number | null} props The properties of this virtual node.\r\n * If this virtual node represents a text node, this is the text of the node (string or number).\r\n * @param {string | number | null} key The key for this virtual node, used when\r\n * diffing it against its children\r\n * @param {import('./internal').VNode[\"ref\"]} ref The ref property that will\r\n * receive a reference to its created child\r\n * @returns {import('./internal').VNode}\r\n */\r\nexport function createVNode(type, props, key, ref, original) {\r\n\t// V8 seems to be better at detecting type shapes if the object is allocated from the same call site\r\n\t// Do not inline into createElement and coerceToVNode!\r\n\tconst vnode = {\r\n\t\ttype,\r\n\t\tprops,\r\n\t\tkey,\r\n\t\tref,\r\n\t\t_children: null,\r\n\t\t_parent: null,\r\n\t\t_depth: 0,\r\n\t\t_dom: null,\r\n\t\t// _nextDom must be initialized to undefined b/c it will eventually\r\n\t\t// be set to dom.nextSibling which can return `null` and it is important\r\n\t\t// to be able to distinguish between an uninitialized _nextDom and\r\n\t\t// a _nextDom that has been set to `null`\r\n\t\t_nextDom: undefined,\r\n\t\t_component: null,\r\n\t\t_hydrating: null,\r\n\t\tconstructor: undefined,\r\n\t\t_original: original == null ? ++vnodeId : original\r\n\t};\r\n\r\n\t// Only invoke the vnode hook if this was *not* a direct copy:\r\n\tif (original == null && options.vnode != null) options.vnode(vnode);\r\n\r\n\treturn vnode;\r\n}\r\n\r\nexport function createRef() {\r\n\treturn { current: null };\r\n}\r\n\r\nexport function Fragment(props) {\r\n\treturn props.children;\r\n}\r\n\r\n/**\r\n * Check if a the argument is a valid Preact VNode.\r\n * @param {*} vnode\r\n * @returns {vnode is import('./internal').VNode}\r\n */\r\nexport const isValidElement = vnode =>\r\n\tvnode != null && vnode.constructor === undefined;\r\n", "import { assign } from './util';\r\nimport { diff, commitRoot } from './diff/index';\r\nimport options from './options';\r\nimport { Fragment } from './create-element';\r\n\r\n/**\r\n * Base Component class. Provides `setState()` and `forceUpdate()`, which\r\n * trigger rendering\r\n * @param {object} props The initial component props\r\n * @param {object} context The initial context from parent components'\r\n * getChildContext\r\n */\r\nexport function Component(props, context) {\r\n\tthis.props = props;\r\n\tthis.context = context;\r\n}\r\n\r\n/**\r\n * Update component state and schedule a re-render.\r\n * @this {import('./internal').Component}\r\n * @param {object | ((s: object, p: object) => object)} update A hash of state\r\n * properties to update with new values or a function that given the current\r\n * state and props returns a new partial state\r\n * @param {() => void} [callback] A function to be called once component state is\r\n * updated\r\n */\r\nComponent.prototype.setState = function(update, callback) {\r\n\t// only clone state when copying to nextState the first time.\r\n\tlet s;\r\n\tif (this._nextState != null && this._nextState !== this.state) {\r\n\t\ts = this._nextState;\r\n\t} else {\r\n\t\ts = this._nextState = assign({}, this.state);\r\n\t}\r\n\r\n\tif (typeof update == 'function') {\r\n\t\t// Some libraries like `immer` mark the current state as readonly,\r\n\t\t// preventing us from mutating it, so we need to clone it. See #2716\r\n\t\tupdate = update(assign({}, s), this.props);\r\n\t}\r\n\r\n\tif (update) {\r\n\t\tassign(s, update);\r\n\t}\r\n\r\n\t// Skip update if updater function returned null\r\n\tif (update == null) return;\r\n\r\n\tif (this._vnode) {\r\n\t\tif (callback) this._renderCallbacks.push(callback);\r\n\t\tenqueueRender(this);\r\n\t}\r\n};\r\n\r\n/**\r\n * Immediately perform a synchronous re-render of the component\r\n * @this {import('./internal').Component}\r\n * @param {() => void} [callback] A function to be called after component is\r\n * re-rendered\r\n */\r\nComponent.prototype.forceUpdate = function(callback) {\r\n\tif (this._vnode) {\r\n\t\t// Set render mode so that we can differentiate where the render request\r\n\t\t// is coming from. We need this because forceUpdate should never call\r\n\t\t// shouldComponentUpdate\r\n\t\tthis._force = true;\r\n\t\tif (callback) this._renderCallbacks.push(callback);\r\n\t\tenqueueRender(this);\r\n\t}\r\n};\r\n\r\n/**\r\n * Accepts `props` and `state`, and returns a new Virtual DOM tree to build.\r\n * Virtual DOM is generally constructed via [JSX](http://jasonformat.com/wtf-is-jsx).\r\n * @param {object} props Props (eg: JSX attributes) received from parent\r\n * element/component\r\n * @param {object} state The component's current state\r\n * @param {object} context Context object, as returned by the nearest\r\n * ancestor's `getChildContext()`\r\n * @returns {import('./index').ComponentChildren | void}\r\n */\r\nComponent.prototype.render = Fragment;\r\n\r\n/**\r\n * @param {import('./internal').VNode} vnode\r\n * @param {number | null} [childIndex]\r\n */\r\nexport function getDomSibling(vnode, childIndex) {\r\n\tif (childIndex == null) {\r\n\t\t// Use childIndex==null as a signal to resume the search from the vnode's sibling\r\n\t\treturn vnode._parent\r\n\t\t\t? getDomSibling(vnode._parent, vnode._parent._children.indexOf(vnode) + 1)\r\n\t\t\t: null;\r\n\t}\r\n\r\n\tlet sibling;\r\n\tfor (; childIndex < vnode._children.length; childIndex++) {\r\n\t\tsibling = vnode._children[childIndex];\r\n\r\n\t\tif (sibling != null && sibling._dom != null) {\r\n\t\t\t// Since updateParentDomPointers keeps _dom pointer correct,\r\n\t\t\t// we can rely on _dom to tell us if this subtree contains a\r\n\t\t\t// rendered DOM node, and what the first rendered DOM node is\r\n\t\t\treturn sibling._dom;\r\n\t\t}\r\n\t}\r\n\r\n\t// If we get here, we have not found a DOM node in this vnode's children.\r\n\t// We must resume from this vnode's sibling (in it's parent _children array)\r\n\t// Only climb up and search the parent if we aren't searching through a DOM\r\n\t// VNode (meaning we reached the DOM parent of the original vnode that began\r\n\t// the search)\r\n\treturn typeof vnode.type == 'function' ? getDomSibling(vnode) : null;\r\n}\r\n\r\n/**\r\n * Trigger in-place re-rendering of a component.\r\n * @param {import('./internal').Component} component The component to rerender\r\n */\r\nfunction renderComponent(component) {\r\n\tlet vnode = component._vnode,\r\n\t\toldDom = vnode._dom,\r\n\t\tparentDom = component._parentDom;\r\n\r\n\tif (parentDom) {\r\n\t\tlet commitQueue = [];\r\n\t\tconst oldVNode = assign({}, vnode);\r\n\t\toldVNode._original = vnode._original + 1;\r\n\r\n\t\tdiff(\r\n\t\t\tparentDom,\r\n\t\t\tvnode,\r\n\t\t\toldVNode,\r\n\t\t\tcomponent._globalContext,\r\n\t\t\tparentDom.ownerSVGElement !== undefined,\r\n\t\t\tvnode._hydrating != null ? [oldDom] : null,\r\n\t\t\tcommitQueue,\r\n\t\t\toldDom == null ? getDomSibling(vnode) : oldDom,\r\n\t\t\tvnode._hydrating\r\n\t\t);\r\n\t\tcommitRoot(commitQueue, vnode);\r\n\r\n\t\tif (vnode._dom != oldDom) {\r\n\t\t\tupdateParentDomPointers(vnode);\r\n\t\t}\r\n\t}\r\n}\r\n\r\n/**\r\n * @param {import('./internal').VNode} vnode\r\n */\r\nfunction updateParentDomPointers(vnode) {\r\n\tif ((vnode = vnode._parent) != null && vnode._component != null) {\r\n\t\tvnode._dom = vnode._component.base = null;\r\n\t\tfor (let i = 0; i < vnode._children.length; i++) {\r\n\t\t\tlet child = vnode._children[i];\r\n\t\t\tif (child != null && child._dom != null) {\r\n\t\t\t\tvnode._dom = vnode._component.base = child._dom;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn updateParentDomPointers(vnode);\r\n\t}\r\n}\r\n\r\n/**\r\n * The render queue\r\n * @type {Array<import('./internal').Component>}\r\n */\r\nlet rerenderQueue = [];\r\n\r\n/**\r\n * Asynchronously schedule a callback\r\n * @type {(cb: () => void) => void}\r\n */\r\n/* istanbul ignore next */\r\n// Note the following line isn't tree-shaken by rollup cuz of rollup/rollup#2566\r\nconst defer =\r\n\ttypeof Promise == 'function'\r\n\t\t? Promise.prototype.then.bind(Promise.resolve())\r\n\t\t: setTimeout;\r\n\r\n/*\r\n * The value of `Component.debounce` must asynchronously invoke the passed in callback. It is\r\n * important that contributors to Preact can consistently reason about what calls to `setState`, etc.\r\n * do, and when their effects will be applied. See the links below for some further reading on designing\r\n * asynchronous APIs.\r\n * * [Designing APIs for Asynchrony](https://blog.izs.me/2013/08/designing-apis-for-asynchrony)\r\n * * [Callbacks synchronous and asynchronous](https://blog.ometer.com/2011/07/24/callbacks-synchronous-and-asynchronous/)\r\n */\r\n\r\nlet prevDebounce;\r\n\r\n/**\r\n * Enqueue a rerender of a component\r\n * @param {import('./internal').Component} c The component to rerender\r\n */\r\nexport function enqueueRender(c) {\r\n\tif (\r\n\t\t(!c._dirty &&\r\n\t\t\t(c._dirty = true) &&\r\n\t\t\trerenderQueue.push(c) &&\r\n\t\t\t!process._rerenderCount++) ||\r\n\t\tprevDebounce !== options.debounceRendering\r\n\t) {\r\n\t\tprevDebounce = options.debounceRendering;\r\n\t\t(prevDebounce || defer)(process);\r\n\t}\r\n}\r\n\r\n/** Flush the render queue by rerendering all queued components */\r\nfunction process() {\r\n\tlet queue;\r\n\twhile ((process._rerenderCount = rerenderQueue.length)) {\r\n\t\tqueue = rerenderQueue.sort((a, b) => a._vnode._depth - b._vnode._depth);\r\n\t\trerenderQueue = [];\r\n\t\t// Don't update `renderCount` yet. Keep its value non-zero to prevent unnecessary\r\n\t\t// process() calls from getting scheduled while `queue` is still being consumed.\r\n\t\tqueue.some(c => {\r\n\t\t\tif (c._dirty) renderComponent(c);\r\n\t\t});\r\n\t}\r\n}\r\nprocess._rerenderCount = 0;\r\n", "import { enqueueRender } from './component';\r\n\r\nexport let i = 0;\r\n\r\nexport function createContext(defaultValue, contextId) {\r\n\tcontextId = '__cC' + i++;\r\n\r\n\tconst context = {\r\n\t\t_id: contextId,\r\n\t\t_defaultValue: defaultValue,\r\n\t\t/** @type {import('./internal').FunctionComponent} */\r\n\t\tConsumer(props, contextValue) {\r\n\t\t\t// return props.children(\r\n\t\t\t// \tcontext[contextId] ? context[contextId].props.value : defaultValue\r\n\t\t\t// );\r\n\t\t\treturn props.children(contextValue);\r\n\t\t},\r\n\t\t/** @type {import('./internal').FunctionComponent} */\r\n\t\tProvider(props) {\r\n\t\t\tif (!this.getChildContext) {\r\n\t\t\t\tlet subs = [];\r\n\t\t\t\tlet ctx = {};\r\n\t\t\t\tctx[contextId] = this;\r\n\r\n\t\t\t\tthis.getChildContext = () => ctx;\r\n\r\n\t\t\t\tthis.shouldComponentUpdate = function(_props) {\r\n\t\t\t\t\tif (this.props.value !== _props.value) {\r\n\t\t\t\t\t\t// I think the forced value propagation here was only needed when `options.debounceRendering` was being bypassed:\r\n\t\t\t\t\t\t// https://github.com/preactjs/preact/commit/4d339fb803bea09e9f198abf38ca1bf8ea4b7771#diff-54682ce380935a717e41b8bfc54737f6R358\r\n\t\t\t\t\t\t// In those cases though, even with the value corrected, we're double-rendering all nodes.\r\n\t\t\t\t\t\t// It might be better to just tell folks not to use force-sync mode.\r\n\t\t\t\t\t\t// Currently, using `useContext()` in a class component will overwrite its `this.context` value.\r\n\t\t\t\t\t\t// subs.some(c => {\r\n\t\t\t\t\t\t// \tc.context = _props.value;\r\n\t\t\t\t\t\t// \tenqueueRender(c);\r\n\t\t\t\t\t\t// });\r\n\r\n\t\t\t\t\t\t// subs.some(c => {\r\n\t\t\t\t\t\t// \tc.context[contextId] = _props.value;\r\n\t\t\t\t\t\t// \tenqueueRender(c);\r\n\t\t\t\t\t\t// });\r\n\t\t\t\t\t\tsubs.some(enqueueRender);\r\n\t\t\t\t\t}\r\n\t\t\t\t};\r\n\r\n\t\t\t\tthis.sub = c => {\r\n\t\t\t\t\tsubs.push(c);\r\n\t\t\t\t\tlet old = c.componentWillUnmount;\r\n\t\t\t\t\tc.componentWillUnmount = () => {\r\n\t\t\t\t\t\tsubs.splice(subs.indexOf(c), 1);\r\n\t\t\t\t\t\tif (old) old.call(c);\r\n\t\t\t\t\t};\r\n\t\t\t\t};\r\n\t\t\t}\r\n\r\n\t\t\treturn props.children;\r\n\t\t}\r\n\t};\r\n\r\n\t// Devtools needs access to the context object when it\r\n\t// encounters a Provider. This is necessary to support\r\n\t// setting `displayName` on the context object instead\r\n\t// of on the component itself. See:\r\n\t// https://reactjs.org/docs/context.html#contextdisplayname\r\n\r\n\treturn (context.Provider._contextRef = context.Consumer.contextType = context);\r\n}\r\n", "import { diff, unmount, applyRef } from './index';\r\nimport { createVNode, Fragment } from '../create-element';\r\nimport { EMPTY_OBJ, EMPTY_ARR } from '../constants';\r\nimport { getDomSibling } from '../component';\r\n\r\n/**\r\n * Diff the children of a virtual node\r\n * @param {import('../internal').PreactElement} parentDom The DOM element whose\r\n * children are being diffed\r\n * @param {import('../internal').ComponentChildren[]} renderResult\r\n * @param {import('../internal').VNode} newParentVNode The new virtual\r\n * node whose children should be diff'ed against oldParentVNode\r\n * @param {import('../internal').VNode} oldParentVNode The old virtual\r\n * node whose children should be diff'ed against newParentVNode\r\n * @param {object} globalContext The current context object - modified by getChildContext\r\n * @param {boolean} isSvg Whether or not this DOM node is an SVG node\r\n * @param {Array<import('../internal').PreactElement>} excessDomChildren\r\n * @param {Array<import('../internal').Component>} commitQueue List of components\r\n * which have callbacks to invoke in commitRoot\r\n * @param {import('../internal').PreactElement} oldDom The current attached DOM\r\n * element any new dom elements should be placed around. Likely `null` on first\r\n * render (except when hydrating). Can be a sibling DOM element when diffing\r\n * Fragments that have siblings. In most cases, it starts out as `oldChildren[0]._dom`.\r\n * @param {boolean} isHydrating Whether or not we are in hydration\r\n */\r\nexport function diffChildren(\r\n\tparentDom,\r\n\trenderResult,\r\n\tnewParentVNode,\r\n\toldParentVNode,\r\n\tglobalContext,\r\n\tisSvg,\r\n\texcessDomChildren,\r\n\tcommitQueue,\r\n\toldDom,\r\n\tisHydrating\r\n) {\r\n\tlet i, j, oldVNode, childVNode, newDom, firstChildDom, refs;\r\n\r\n\t// This is a compression of oldParentVNode!=null && oldParentVNode != EMPTY_OBJ && oldParentVNode._children || EMPTY_ARR\r\n\t// as EMPTY_OBJ._children should be `undefined`.\r\n\tlet oldChildren = (oldParentVNode && oldParentVNode._children) || EMPTY_ARR;\r\n\r\n\tlet oldChildrenLength = oldChildren.length;\r\n\r\n\tnewParentVNode._children = [];\r\n\tfor (i = 0; i < renderResult.length; i++) {\r\n\t\tchildVNode = renderResult[i];\r\n\r\n\t\tif (childVNode == null || typeof childVNode == 'boolean') {\r\n\t\t\tchildVNode = newParentVNode._children[i] = null;\r\n\t\t}\r\n\t\t// If this newVNode is being reused (e.g. <div>{reuse}{reuse}</div>) in the same diff,\r\n\t\t// or we are rendering a component (e.g. setState) copy the oldVNodes so it can have\r\n\t\t// it's own DOM & etc. pointers\r\n\t\telse if (\r\n\t\t\ttypeof childVNode == 'string' ||\r\n\t\t\ttypeof childVNode == 'number' ||\r\n\t\t\t// eslint-disable-next-line valid-typeof\r\n\t\t\ttypeof childVNode == 'bigint'\r\n\t\t) {\r\n\t\t\tchildVNode = newParentVNode._children[i] = createVNode(\r\n\t\t\t\tnull,\r\n\t\t\t\tchildVNode,\r\n\t\t\t\tnull,\r\n\t\t\t\tnull,\r\n\t\t\t\tchildVNode\r\n\t\t\t);\r\n\t\t} else if (Array.isArray(childVNode)) {\r\n\t\t\tchildVNode = newParentVNode._children[i] = createVNode(\r\n\t\t\t\tFragment,\r\n\t\t\t\t{ children: childVNode },\r\n\t\t\t\tnull,\r\n\t\t\t\tnull,\r\n\t\t\t\tnull\r\n\t\t\t);\r\n\t\t} else if (childVNode._depth > 0) {\r\n\t\t\t// VNode is already in use, clone it. This can happen in the following\r\n\t\t\t// scenario:\r\n\t\t\t//   const reuse = <div />\r\n\t\t\t//   <div>{reuse}<span />{reuse}</div>\r\n\t\t\tchildVNode = newParentVNode._children[i] = createVNode(\r\n\t\t\t\tchildVNode.type,\r\n\t\t\t\tchildVNode.props,\r\n\t\t\t\tchildVNode.key,\r\n\t\t\t\tnull,\r\n\t\t\t\tchildVNode._original\r\n\t\t\t);\r\n\t\t} else {\r\n\t\t\tchildVNode = newParentVNode._children[i] = childVNode;\r\n\t\t}\r\n\r\n\t\t// Terser removes the `continue` here and wraps the loop body\r\n\t\t// in a `if (childVNode) { ... } condition\r\n\t\tif (childVNode == null) {\r\n\t\t\tcontinue;\r\n\t\t}\r\n\r\n\t\tchildVNode._parent = newParentVNode;\r\n\t\tchildVNode._depth = newParentVNode._depth + 1;\r\n\r\n\t\t// Check if we find a corresponding element in oldChildren.\r\n\t\t// If found, delete the array item by setting to `undefined`.\r\n\t\t// We use `undefined`, as `null` is reserved for empty placeholders\r\n\t\t// (holes).\r\n\t\toldVNode = oldChildren[i];\r\n\r\n\t\tif (\r\n\t\t\toldVNode === null ||\r\n\t\t\t(oldVNode &&\r\n\t\t\t\tchildVNode.key == oldVNode.key &&\r\n\t\t\t\tchildVNode.type === oldVNode.type)\r\n\t\t) {\r\n\t\t\toldChildren[i] = undefined;\r\n\t\t} else {\r\n\t\t\t// Either oldVNode === undefined or oldChildrenLength > 0,\r\n\t\t\t// so after this loop oldVNode == null or oldVNode is a valid value.\r\n\t\t\tfor (j = 0; j < oldChildrenLength; j++) {\r\n\t\t\t\toldVNode = oldChildren[j];\r\n\t\t\t\t// If childVNode is unkeyed, we only match similarly unkeyed nodes, otherwise we match by key.\r\n\t\t\t\t// We always match by type (in either case).\r\n\t\t\t\tif (\r\n\t\t\t\t\toldVNode &&\r\n\t\t\t\t\tchildVNode.key == oldVNode.key &&\r\n\t\t\t\t\tchildVNode.type === oldVNode.type\r\n\t\t\t\t) {\r\n\t\t\t\t\toldChildren[j] = undefined;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\toldVNode = null;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\toldVNode = oldVNode || EMPTY_OBJ;\r\n\r\n\t\t// Morph the old element into the new one, but don't append it to the dom yet\r\n\t\tdiff(\r\n\t\t\tparentDom,\r\n\t\t\tchildVNode,\r\n\t\t\toldVNode,\r\n\t\t\tglobalContext,\r\n\t\t\tisSvg,\r\n\t\t\texcessDomChildren,\r\n\t\t\tcommitQueue,\r\n\t\t\toldDom,\r\n\t\t\tisHydrating\r\n\t\t);\r\n\r\n\t\tnewDom = childVNode._dom;\r\n\r\n\t\tif ((j = childVNode.ref) && oldVNode.ref != j) {\r\n\t\t\tif (!refs) refs = [];\r\n\t\t\tif (oldVNode.ref) refs.push(oldVNode.ref, null, childVNode);\r\n\t\t\trefs.push(j, childVNode._component || newDom, childVNode);\r\n\t\t}\r\n\r\n\t\tif (newDom != null) {\r\n\t\t\tif (firstChildDom == null) {\r\n\t\t\t\tfirstChildDom = newDom;\r\n\t\t\t}\r\n\r\n\t\t\tif (\r\n\t\t\t\ttypeof childVNode.type == 'function' &&\r\n\t\t\t\tchildVNode._children === oldVNode._children\r\n\t\t\t) {\r\n\t\t\t\tchildVNode._nextDom = oldDom = reorderChildren(\r\n\t\t\t\t\tchildVNode,\r\n\t\t\t\t\toldDom,\r\n\t\t\t\t\tparentDom\r\n\t\t\t\t);\r\n\t\t\t} else {\r\n\t\t\t\toldDom = placeChild(\r\n\t\t\t\t\tparentDom,\r\n\t\t\t\t\tchildVNode,\r\n\t\t\t\t\toldVNode,\r\n\t\t\t\t\toldChildren,\r\n\t\t\t\t\tnewDom,\r\n\t\t\t\t\toldDom\r\n\t\t\t\t);\r\n\t\t\t}\r\n\r\n\t\t\tif (typeof newParentVNode.type == 'function') {\r\n\t\t\t\t// Because the newParentVNode is Fragment-like, we need to set it's\r\n\t\t\t\t// _nextDom property to the nextSibling of its last child DOM node.\r\n\t\t\t\t//\r\n\t\t\t\t// `oldDom` contains the correct value here because if the last child\r\n\t\t\t\t// is a Fragment-like, then oldDom has already been set to that child's _nextDom.\r\n\t\t\t\t// If the last child is a DOM VNode, then oldDom will be set to that DOM\r\n\t\t\t\t// node's nextSibling.\r\n\t\t\t\tnewParentVNode._nextDom = oldDom;\r\n\t\t\t}\r\n\t\t} else if (\r\n\t\t\toldDom &&\r\n\t\t\toldVNode._dom == oldDom &&\r\n\t\t\toldDom.parentNode != parentDom\r\n\t\t) {\r\n\t\t\t// The above condition is to handle null placeholders. See test in placeholder.test.js:\r\n\t\t\t// `efficiently replace null placeholders in parent rerenders`\r\n\t\t\toldDom = getDomSibling(oldVNode);\r\n\t\t}\r\n\t}\r\n\r\n\tnewParentVNode._dom = firstChildDom;\r\n\r\n\t// Remove remaining oldChildren if there are any.\r\n\tfor (i = oldChildrenLength; i--; ) {\r\n\t\tif (oldChildren[i] != null) {\r\n\t\t\tif (\r\n\t\t\t\ttypeof newParentVNode.type == 'function' &&\r\n\t\t\t\toldChildren[i]._dom != null &&\r\n\t\t\t\toldChildren[i]._dom == newParentVNode._nextDom\r\n\t\t\t) {\r\n\t\t\t\t// If the newParentVNode.__nextDom points to a dom node that is about to\r\n\t\t\t\t// be unmounted, then get the next sibling of that vnode and set\r\n\t\t\t\t// _nextDom to it\r\n\t\t\t\tnewParentVNode._nextDom = getDomSibling(oldParentVNode, i + 1);\r\n\t\t\t}\r\n\r\n\t\t\tunmount(oldChildren[i], oldChildren[i]);\r\n\t\t}\r\n\t}\r\n\r\n\t// Set refs only after unmount\r\n\tif (refs) {\r\n\t\tfor (i = 0; i < refs.length; i++) {\r\n\t\t\tapplyRef(refs[i], refs[++i], refs[++i]);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nfunction reorderChildren(childVNode, oldDom, parentDom) {\r\n\t// Note: VNodes in nested suspended trees may be missing _children.\r\n\tlet c = childVNode._children;\r\n\tlet tmp = 0;\r\n\tfor (; c && tmp < c.length; tmp++) {\r\n\t\tlet vnode = c[tmp];\r\n\t\tif (vnode) {\r\n\t\t\t// We typically enter this code path on sCU bailout, where we copy\r\n\t\t\t// oldVNode._children to newVNode._children. If that is the case, we need\r\n\t\t\t// to update the old children's _parent pointer to point to the newVNode\r\n\t\t\t// (childVNode here).\r\n\t\t\tvnode._parent = childVNode;\r\n\r\n\t\t\tif (typeof vnode.type == 'function') {\r\n\t\t\t\toldDom = reorderChildren(vnode, oldDom, parentDom);\r\n\t\t\t} else {\r\n\t\t\t\toldDom = placeChild(\r\n\t\t\t\t\tparentDom,\r\n\t\t\t\t\tvnode,\r\n\t\t\t\t\tvnode,\r\n\t\t\t\t\tc,\r\n\t\t\t\t\tvnode._dom,\r\n\t\t\t\t\toldDom\r\n\t\t\t\t);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\treturn oldDom;\r\n}\r\n\r\n/**\r\n * Flatten and loop through the children of a virtual node\r\n * @param {import('../index').ComponentChildren} children The unflattened\r\n * children of a virtual node\r\n * @returns {import('../internal').VNode[]}\r\n */\r\nexport function toChildArray(children, out) {\r\n\tout = out || [];\r\n\tif (children == null || typeof children == 'boolean') {\r\n\t} else if (Array.isArray(children)) {\r\n\t\tchildren.some(child => {\r\n\t\t\ttoChildArray(child, out);\r\n\t\t});\r\n\t} else {\r\n\t\tout.push(children);\r\n\t}\r\n\treturn out;\r\n}\r\n\r\nfunction placeChild(\r\n\tparentDom,\r\n\tchildVNode,\r\n\toldVNode,\r\n\toldChildren,\r\n\tnewDom,\r\n\toldDom\r\n) {\r\n\tlet nextDom;\r\n\tif (childVNode._nextDom !== undefined) {\r\n\t\t// Only Fragments or components that return Fragment like VNodes will\r\n\t\t// have a non-undefined _nextDom. Continue the diff from the sibling\r\n\t\t// of last DOM child of this child VNode\r\n\t\tnextDom = childVNode._nextDom;\r\n\r\n\t\t// Eagerly cleanup _nextDom. We don't need to persist the value because\r\n\t\t// it is only used by `diffChildren` to determine where to resume the diff after\r\n\t\t// diffing Components and Fragments. Once we store it the nextDOM local var, we\r\n\t\t// can clean up the property\r\n\t\tchildVNode._nextDom = undefined;\r\n\t} else if (\r\n\t\toldVNode == null ||\r\n\t\tnewDom != oldDom ||\r\n\t\tnewDom.parentNode == null\r\n\t) {\r\n\t\touter: if (oldDom == null || oldDom.parentNode !== parentDom) {\r\n\t\t\tparentDom.appendChild(newDom);\r\n\t\t\tnextDom = null;\r\n\t\t} else {\r\n\t\t\t// `j<oldChildrenLength; j+=2` is an alternative to `j++<oldChildrenLength/2`\r\n\t\t\tfor (\r\n\t\t\t\tlet sibDom = oldDom, j = 0;\r\n\t\t\t\t(sibDom = sibDom.nextSibling) && j < oldChildren.length;\r\n\t\t\t\tj += 2\r\n\t\t\t) {\r\n\t\t\t\tif (sibDom == newDom) {\r\n\t\t\t\t\tbreak outer;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tparentDom.insertBefore(newDom, oldDom);\r\n\t\t\tnextDom = oldDom;\r\n\t\t}\r\n\t}\r\n\r\n\t// If we have pre-calculated the nextDOM node, use it. Else calculate it now\r\n\t// Strictly check for `undefined` here cuz `null` is a valid value of `nextDom`.\r\n\t// See more detail in create-element.js:createVNode\r\n\tif (nextDom !== undefined) {\r\n\t\toldDom = nextDom;\r\n\t} else {\r\n\t\toldDom = newDom.nextSibling;\r\n\t}\r\n\r\n\treturn oldDom;\r\n}\r\n", "import { IS_NON_DIMENSIONAL } from '../constants';\r\nimport options from '../options';\r\n\r\n/**\r\n * Diff the old and new properties of a VNode and apply changes to the DOM node\r\n * @param {import('../internal').PreactElement} dom The DOM node to apply\r\n * changes to\r\n * @param {object} newProps The new props\r\n * @param {object} oldProps The old props\r\n * @param {boolean} isSvg Whether or not this node is an SVG node\r\n * @param {boolean} hydrate Whether or not we are in hydration mode\r\n */\r\nexport function diffProps(dom, newProps, oldProps, isSvg, hydrate) {\r\n\tlet i;\r\n\r\n\tfor (i in oldProps) {\r\n\t\tif (i !== 'children' && i !== 'key' && !(i in newProps)) {\r\n\t\t\tsetProperty(dom, i, null, oldProps[i], isSvg);\r\n\t\t}\r\n\t}\r\n\r\n\tfor (i in newProps) {\r\n\t\tif (\r\n\t\t\t(!hydrate || typeof newProps[i] == 'function') &&\r\n\t\t\ti !== 'children' &&\r\n\t\t\ti !== 'key' &&\r\n\t\t\ti !== 'value' &&\r\n\t\t\ti !== 'checked' &&\r\n\t\t\toldProps[i] !== newProps[i]\r\n\t\t) {\r\n\t\t\tsetProperty(dom, i, newProps[i], oldProps[i], isSvg);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nfunction setStyle(style, key, value) {\r\n\tif (key[0] === '-') {\r\n\t\tstyle.setProperty(key, value);\r\n\t} else if (value == null) {\r\n\t\tstyle[key] = '';\r\n\t} else if (typeof value != 'number' || IS_NON_DIMENSIONAL.test(key)) {\r\n\t\tstyle[key] = value;\r\n\t} else {\r\n\t\tstyle[key] = value + 'px';\r\n\t}\r\n}\r\n\r\n/**\r\n * Set a property value on a DOM node\r\n * @param {import('../internal').PreactElement} dom The DOM node to modify\r\n * @param {string} name The name of the property to set\r\n * @param {*} value The value to set the property to\r\n * @param {*} oldValue The old value the property had\r\n * @param {boolean} isSvg Whether or not this DOM node is an SVG node or not\r\n */\r\nexport function setProperty(dom, name, value, oldValue, isSvg) {\r\n\tlet useCapture;\r\n\r\n\to: if (name === 'style') {\r\n\t\tif (typeof value == 'string') {\r\n\t\t\tdom.style.cssText = value;\r\n\t\t} else {\r\n\t\t\tif (typeof oldValue == 'string') {\r\n\t\t\t\tdom.style.cssText = oldValue = '';\r\n\t\t\t}\r\n\r\n\t\t\tif (oldValue) {\r\n\t\t\t\tfor (name in oldValue) {\r\n\t\t\t\t\tif (!(value && name in value)) {\r\n\t\t\t\t\t\tsetStyle(dom.style, name, '');\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif (value) {\r\n\t\t\t\tfor (name in value) {\r\n\t\t\t\t\tif (!oldValue || value[name] !== oldValue[name]) {\r\n\t\t\t\t\t\tsetStyle(dom.style, name, value[name]);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t// Benchmark for comparison: https://esbench.com/bench/574c954bdb965b9a00965ac6\r\n\telse if (name[0] === 'o' && name[1] === 'n') {\r\n\t\tuseCapture = name !== (name = name.replace(/Capture$/, ''));\r\n\r\n\t\t// Infer correct casing for DOM built-in events:\r\n\t\tif (name.toLowerCase() in dom) name = name.toLowerCase().slice(2);\r\n\t\telse name = name.slice(2);\r\n\r\n\t\tif (!dom._listeners) dom._listeners = {};\r\n\t\tdom._listeners[name + useCapture] = value;\r\n\r\n\t\tif (value) {\r\n\t\t\tif (!oldValue) {\r\n\t\t\t\tconst handler = useCapture ? eventProxyCapture : eventProxy;\r\n\t\t\t\tdom.addEventListener(name, handler, useCapture);\r\n\t\t\t}\r\n\t\t} else {\r\n\t\t\tconst handler = useCapture ? eventProxyCapture : eventProxy;\r\n\t\t\tdom.removeEventListener(name, handler, useCapture);\r\n\t\t}\r\n\t} else if (name !== 'dangerouslySetInnerHTML') {\r\n\t\tif (isSvg) {\r\n\t\t\t// Normalize incorrect prop usage for SVG:\r\n\t\t\t// - xlink:href / xlinkHref --> href (xlink:href was removed from SVG and isn't needed)\r\n\t\t\t// - className --> class\r\n\t\t\tname = name.replace(/xlink[H:h]/, 'h').replace(/sName$/, 's');\r\n\t\t} else if (\r\n\t\t\tname !== 'href' &&\r\n\t\t\tname !== 'list' &&\r\n\t\t\tname !== 'form' &&\r\n\t\t\t// Default value in browsers is `-1` and an empty string is\r\n\t\t\t// cast to `0` instead\r\n\t\t\tname !== 'tabIndex' &&\r\n\t\t\tname !== 'download' &&\r\n\t\t\tname in dom\r\n\t\t) {\r\n\t\t\ttry {\r\n\t\t\t\tdom[name] = value == null ? '' : value;\r\n\t\t\t\t// labelled break is 1b smaller here than a return statement (sorry)\r\n\t\t\t\tbreak o;\r\n\t\t\t} catch (e) {}\r\n\t\t}\r\n\r\n\t\t// ARIA-attributes have a different notion of boolean values.\r\n\t\t// The value `false` is different from the attribute not\r\n\t\t// existing on the DOM, so we can't remove it. For non-boolean\r\n\t\t// ARIA-attributes we could treat false as a removal, but the\r\n\t\t// amount of exceptions would cost us too many bytes. On top of\r\n\t\t// that other VDOM frameworks also always stringify `false`.\r\n\r\n\t\tif (typeof value === 'function') {\r\n\t\t\t// never serialize functions as attribute values\r\n\t\t} else if (\r\n\t\t\tvalue != null &&\r\n\t\t\t(value !== false || (name[0] === 'a' && name[1] === 'r'))\r\n\t\t) {\r\n\t\t\tdom.setAttribute(name, value);\r\n\t\t} else {\r\n\t\t\tdom.removeAttribute(name);\r\n\t\t}\r\n\t}\r\n}\r\n\r\n/**\r\n * Proxy an event to hooked event handlers\r\n * @param {Event} e The event object from the browser\r\n * @private\r\n */\r\nfunction eventProxy(e) {\r\n\tthis._listeners[e.type + false](options.event ? options.event(e) : e);\r\n}\r\n\r\nfunction eventProxyCapture(e) {\r\n\tthis._listeners[e.type + true](options.event ? options.event(e) : e);\r\n}\r\n", "import { EMPTY_OBJ } from '../constants';\r\nimport { Component, getDomSibling } from '../component';\r\nimport { Fragment } from '../create-element';\r\nimport { diffChildren } from './children';\r\nimport { diffProps, setProperty } from './props';\r\nimport { assign, removeNode, slice } from '../util';\r\nimport options from '../options';\r\n\r\n/**\r\n * Diff two virtual nodes and apply proper changes to the DOM\r\n * @param {import('../internal').PreactElement} parentDom The parent of the DOM element\r\n * @param {import('../internal').VNode} newVNode The new virtual node\r\n * @param {import('../internal').VNode} oldVNode The old virtual node\r\n * @param {object} globalContext The current context object. Modified by getChildContext\r\n * @param {boolean} isSvg Whether or not this element is an SVG node\r\n * @param {Array<import('../internal').PreactElement>} excessDomChildren\r\n * @param {Array<import('../internal').Component>} commitQueue List of components\r\n * which have callbacks to invoke in commitRoot\r\n * @param {import('../internal').PreactElement} oldDom The current attached DOM\r\n * element any new dom elements should be placed around. Likely `null` on first\r\n * render (except when hydrating). Can be a sibling DOM element when diffing\r\n * Fragments that have siblings. In most cases, it starts out as `oldChildren[0]._dom`.\r\n * @param {boolean} [isHydrating] Whether or not we are in hydration\r\n */\r\nexport function diff(\r\n\tparentDom,\r\n\tnewVNode,\r\n\toldVNode,\r\n\tglobalContext,\r\n\tisSvg,\r\n\texcessDomChildren,\r\n\tcommitQueue,\r\n\toldDom,\r\n\tisHydrating\r\n) {\r\n\tlet tmp,\r\n\t\tnewType = newVNode.type;\r\n\r\n\t// When passing through createElement it assigns the object\r\n\t// constructor as undefined. This to prevent JSON-injection.\r\n\tif (newVNode.constructor !== undefined) return null;\r\n\r\n\t// If the previous diff bailed out, resume creating/hydrating.\r\n\tif (oldVNode._hydrating != null) {\r\n\t\tisHydrating = oldVNode._hydrating;\r\n\t\toldDom = newVNode._dom = oldVNode._dom;\r\n\t\t// if we resume, we want the tree to be \"unlocked\"\r\n\t\tnewVNode._hydrating = null;\r\n\t\texcessDomChildren = [oldDom];\r\n\t}\r\n\r\n\tif ((tmp = options._diff)) tmp(newVNode);\r\n\r\n\ttry {\r\n\t\touter: if (typeof newType == 'function') {\r\n\t\t\tlet c, isNew, oldProps, oldState, snapshot, clearProcessingException;\r\n\t\t\tlet newProps = newVNode.props;\r\n\r\n\t\t\t// Necessary for createContext api. Setting this property will pass\r\n\t\t\t// the context value as `this.context` just for this component.\r\n\t\t\ttmp = newType.contextType;\r\n\t\t\tlet provider = tmp && globalContext[tmp._id];\r\n\t\t\tlet componentContext = tmp\r\n\t\t\t\t? provider\r\n\t\t\t\t\t? provider.props.value\r\n\t\t\t\t\t: tmp._defaultValue\r\n\t\t\t\t: globalContext;\r\n\r\n\t\t\t// Get component and set it to `c`\r\n\t\t\tif (oldVNode._component) {\r\n\t\t\t\tc = newVNode._component = oldVNode._component;\r\n\t\t\t\tclearProcessingException = c._processingException = c._pendingError;\r\n\t\t\t} else {\r\n\t\t\t\t// Instantiate the new component\r\n\t\t\t\tif ('prototype' in newType && newType.prototype.render) {\r\n\t\t\t\t\t// @ts-ignore The check above verifies that newType is suppose to be constructed\r\n\t\t\t\t\tnewVNode._component = c = new newType(newProps, componentContext); // eslint-disable-line new-cap\r\n\t\t\t\t} else {\r\n\t\t\t\t\t// @ts-ignore Trust me, Component implements the interface we want\r\n\t\t\t\t\tnewVNode._component = c = new Component(newProps, componentContext);\r\n\t\t\t\t\tc.constructor = newType;\r\n\t\t\t\t\tc.render = doRender;\r\n\t\t\t\t}\r\n\t\t\t\tif (provider) provider.sub(c);\r\n\r\n\t\t\t\tc.props = newProps;\r\n\t\t\t\tif (!c.state) c.state = {};\r\n\t\t\t\tc.context = componentContext;\r\n\t\t\t\tc._globalContext = globalContext;\r\n\t\t\t\tisNew = c._dirty = true;\r\n\t\t\t\tc._renderCallbacks = [];\r\n\t\t\t}\r\n\r\n\t\t\t// Invoke getDerivedStateFromProps\r\n\t\t\tif (c._nextState == null) {\r\n\t\t\t\tc._nextState = c.state;\r\n\t\t\t}\r\n\t\t\tif (newType.getDerivedStateFromProps != null) {\r\n\t\t\t\tif (c._nextState == c.state) {\r\n\t\t\t\t\tc._nextState = assign({}, c._nextState);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tassign(\r\n\t\t\t\t\tc._nextState,\r\n\t\t\t\t\tnewType.getDerivedStateFromProps(newProps, c._nextState)\r\n\t\t\t\t);\r\n\t\t\t}\r\n\r\n\t\t\toldProps = c.props;\r\n\t\t\toldState = c.state;\r\n\r\n\t\t\t// Invoke pre-render lifecycle methods\r\n\t\t\tif (isNew) {\r\n\t\t\t\tif (\r\n\t\t\t\t\tnewType.getDerivedStateFromProps == null &&\r\n\t\t\t\t\tc.componentWillMount != null\r\n\t\t\t\t) {\r\n\t\t\t\t\tc.componentWillMount();\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (c.componentDidMount != null) {\r\n\t\t\t\t\tc._renderCallbacks.push(c.componentDidMount);\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\tif (\r\n\t\t\t\t\tnewType.getDerivedStateFromProps == null &&\r\n\t\t\t\t\tnewProps !== oldProps &&\r\n\t\t\t\t\tc.componentWillReceiveProps != null\r\n\t\t\t\t) {\r\n\t\t\t\t\tc.componentWillReceiveProps(newProps, componentContext);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (\r\n\t\t\t\t\t(!c._force &&\r\n\t\t\t\t\t\tc.shouldComponentUpdate != null &&\r\n\t\t\t\t\t\tc.shouldComponentUpdate(\r\n\t\t\t\t\t\t\tnewProps,\r\n\t\t\t\t\t\t\tc._nextState,\r\n\t\t\t\t\t\t\tcomponentContext\r\n\t\t\t\t\t\t) === false) ||\r\n\t\t\t\t\tnewVNode._original === oldVNode._original\r\n\t\t\t\t) {\r\n\t\t\t\t\tc.props = newProps;\r\n\t\t\t\t\tc.state = c._nextState;\r\n\t\t\t\t\t// More info about this here: https://gist.github.com/JoviDeCroock/bec5f2ce93544d2e6070ef8e0036e4e8\r\n\t\t\t\t\tif (newVNode._original !== oldVNode._original) c._dirty = false;\r\n\t\t\t\t\tc._vnode = newVNode;\r\n\t\t\t\t\tnewVNode._dom = oldVNode._dom;\r\n\t\t\t\t\tnewVNode._children = oldVNode._children;\r\n\t\t\t\t\tnewVNode._children.forEach(vnode => {\r\n\t\t\t\t\t\tif (vnode) vnode._parent = newVNode;\r\n\t\t\t\t\t});\r\n\t\t\t\t\tif (c._renderCallbacks.length) {\r\n\t\t\t\t\t\tcommitQueue.push(c);\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tbreak outer;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (c.componentWillUpdate != null) {\r\n\t\t\t\t\tc.componentWillUpdate(newProps, c._nextState, componentContext);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (c.componentDidUpdate != null) {\r\n\t\t\t\t\tc._renderCallbacks.push(() => {\r\n\t\t\t\t\t\tc.componentDidUpdate(oldProps, oldState, snapshot);\r\n\t\t\t\t\t});\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tc.context = componentContext;\r\n\t\t\tc.props = newProps;\r\n\t\t\tc.state = c._nextState;\r\n\r\n\t\t\tif ((tmp = options._render)) tmp(newVNode);\r\n\r\n\t\t\tc._dirty = false;\r\n\t\t\tc._vnode = newVNode;\r\n\t\t\tc._parentDom = parentDom;\r\n\r\n\t\t\ttmp = c.render(c.props, c.state, c.context);\r\n\r\n\t\t\t// Handle setState called in render, see #2553\r\n\t\t\tc.state = c._nextState;\r\n\r\n\t\t\tif (c.getChildContext != null) {\r\n\t\t\t\tglobalContext = assign(assign({}, globalContext), c.getChildContext());\r\n\t\t\t}\r\n\r\n\t\t\tif (!isNew && c.getSnapshotBeforeUpdate != null) {\r\n\t\t\t\tsnapshot = c.getSnapshotBeforeUpdate(oldProps, oldState);\r\n\t\t\t}\r\n\r\n\t\t\tlet isTopLevelFragment =\r\n\t\t\t\ttmp != null && tmp.type === Fragment && tmp.key == null;\r\n\t\t\tlet renderResult = isTopLevelFragment ? tmp.props.children : tmp;\r\n\r\n\t\t\tdiffChildren(\r\n\t\t\t\tparentDom,\r\n\t\t\t\tArray.isArray(renderResult) ? renderResult : [renderResult],\r\n\t\t\t\tnewVNode,\r\n\t\t\t\toldVNode,\r\n\t\t\t\tglobalContext,\r\n\t\t\t\tisSvg,\r\n\t\t\t\texcessDomChildren,\r\n\t\t\t\tcommitQueue,\r\n\t\t\t\toldDom,\r\n\t\t\t\tisHydrating\r\n\t\t\t);\r\n\r\n\t\t\tc.base = newVNode._dom;\r\n\r\n\t\t\t// We successfully rendered this VNode, unset any stored hydration/bailout state:\r\n\t\t\tnewVNode._hydrating = null;\r\n\r\n\t\t\tif (c._renderCallbacks.length) {\r\n\t\t\t\tcommitQueue.push(c);\r\n\t\t\t}\r\n\r\n\t\t\tif (clearProcessingException) {\r\n\t\t\t\tc._pendingError = c._processingException = null;\r\n\t\t\t}\r\n\r\n\t\t\tc._force = false;\r\n\t\t} else if (\r\n\t\t\texcessDomChildren == null &&\r\n\t\t\tnewVNode._original === oldVNode._original\r\n\t\t) {\r\n\t\t\tnewVNode._children = oldVNode._children;\r\n\t\t\tnewVNode._dom = oldVNode._dom;\r\n\t\t} else {\r\n\t\t\tnewVNode._dom = diffElementNodes(\r\n\t\t\t\toldVNode._dom,\r\n\t\t\t\tnewVNode,\r\n\t\t\t\toldVNode,\r\n\t\t\t\tglobalContext,\r\n\t\t\t\tisSvg,\r\n\t\t\t\texcessDomChildren,\r\n\t\t\t\tcommitQueue,\r\n\t\t\t\tisHydrating\r\n\t\t\t);\r\n\t\t}\r\n\r\n\t\tif ((tmp = options.diffed)) tmp(newVNode);\r\n\t} catch (e) {\r\n\t\tnewVNode._original = null;\r\n\t\t// if hydrating or creating initial tree, bailout preserves DOM:\r\n\t\tif (isHydrating || excessDomChildren != null) {\r\n\t\t\tnewVNode._dom = oldDom;\r\n\t\t\tnewVNode._hydrating = !!isHydrating;\r\n\t\t\texcessDomChildren[excessDomChildren.indexOf(oldDom)] = null;\r\n\t\t\t// ^ could possibly be simplified to:\r\n\t\t\t// excessDomChildren.length = 0;\r\n\t\t}\r\n\t\toptions._catchError(e, newVNode, oldVNode);\r\n\t}\r\n}\r\n\r\n/**\r\n * @param {Array<import('../internal').Component>} commitQueue List of components\r\n * which have callbacks to invoke in commitRoot\r\n * @param {import('../internal').VNode} root\r\n */\r\nexport function commitRoot(commitQueue, root) {\r\n\tif (options._commit) options._commit(root, commitQueue);\r\n\r\n\tcommitQueue.some(c => {\r\n\t\ttry {\r\n\t\t\t// @ts-ignore Reuse the commitQueue variable here so the type changes\r\n\t\t\tcommitQueue = c._renderCallbacks;\r\n\t\t\tc._renderCallbacks = [];\r\n\t\t\tcommitQueue.some(cb => {\r\n\t\t\t\t// @ts-ignore See above ts-ignore on commitQueue\r\n\t\t\t\tcb.call(c);\r\n\t\t\t});\r\n\t\t} catch (e) {\r\n\t\t\toptions._catchError(e, c._vnode);\r\n\t\t}\r\n\t});\r\n}\r\n\r\n/**\r\n * Diff two virtual nodes representing DOM element\r\n * @param {import('../internal').PreactElement} dom The DOM element representing\r\n * the virtual nodes being diffed\r\n * @param {import('../internal').VNode} newVNode The new virtual node\r\n * @param {import('../internal').VNode} oldVNode The old virtual node\r\n * @param {object} globalContext The current context object\r\n * @param {boolean} isSvg Whether or not this DOM node is an SVG node\r\n * @param {*} excessDomChildren\r\n * @param {Array<import('../internal').Component>} commitQueue List of components\r\n * which have callbacks to invoke in commitRoot\r\n * @param {boolean} isHydrating Whether or not we are in hydration\r\n * @returns {import('../internal').PreactElement}\r\n */\r\nfunction diffElementNodes(\r\n\tdom,\r\n\tnewVNode,\r\n\toldVNode,\r\n\tglobalContext,\r\n\tisSvg,\r\n\texcessDomChildren,\r\n\tcommitQueue,\r\n\tisHydrating\r\n) {\r\n\tlet oldProps = oldVNode.props;\r\n\tlet newProps = newVNode.props;\r\n\tlet nodeType = newVNode.type;\r\n\tlet i = 0;\r\n\r\n\t// Tracks entering and exiting SVG namespace when descending through the tree.\r\n\tif (nodeType === 'svg') isSvg = true;\r\n\r\n\tif (excessDomChildren != null) {\r\n\t\tfor (; i < excessDomChildren.length; i++) {\r\n\t\t\tconst child = excessDomChildren[i];\r\n\r\n\t\t\t// if newVNode matches an element in excessDomChildren or the `dom`\r\n\t\t\t// argument matches an element in excessDomChildren, remove it from\r\n\t\t\t// excessDomChildren so it isn't later removed in diffChildren\r\n\t\t\tif (\r\n\t\t\t\tchild &&\r\n\t\t\t\t'setAttribute' in child === !!nodeType &&\r\n\t\t\t\t(nodeType ? child.localName === nodeType : child.nodeType === 3)\r\n\t\t\t) {\r\n\t\t\t\tdom = child;\r\n\t\t\t\texcessDomChildren[i] = null;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tif (dom == null) {\r\n\t\tif (nodeType === null) {\r\n\t\t\t// @ts-ignore createTextNode returns Text, we expect PreactElement\r\n\t\t\treturn document.createTextNode(newProps);\r\n\t\t}\r\n\r\n\t\tif (isSvg) {\r\n\t\t\tdom = document.createElementNS(\r\n\t\t\t\t'http://www.w3.org/2000/svg',\r\n\t\t\t\t// @ts-ignore We know `newVNode.type` is a string\r\n\t\t\t\tnodeType\r\n\t\t\t);\r\n\t\t} else {\r\n\t\t\tdom = document.createElement(\r\n\t\t\t\t// @ts-ignore We know `newVNode.type` is a string\r\n\t\t\t\tnodeType,\r\n\t\t\t\tnewProps.is && newProps\r\n\t\t\t);\r\n\t\t}\r\n\r\n\t\t// we created a new parent, so none of the previously attached children can be reused:\r\n\t\texcessDomChildren = null;\r\n\t\t// we are creating a new node, so we can assume this is a new subtree (in case we are hydrating), this deopts the hydrate\r\n\t\tisHydrating = false;\r\n\t}\r\n\r\n\tif (nodeType === null) {\r\n\t\t// During hydration, we still have to split merged text from SSR'd HTML.\r\n\t\tif (oldProps !== newProps && (!isHydrating || dom.data !== newProps)) {\r\n\t\t\tdom.data = newProps;\r\n\t\t}\r\n\t} else {\r\n\t\t// If excessDomChildren was not null, repopulate it with the current element's children:\r\n\t\texcessDomChildren = excessDomChildren && slice.call(dom.childNodes);\r\n\r\n\t\toldProps = oldVNode.props || EMPTY_OBJ;\r\n\r\n\t\tlet oldHtml = oldProps.dangerouslySetInnerHTML;\r\n\t\tlet newHtml = newProps.dangerouslySetInnerHTML;\r\n\r\n\t\t// During hydration, props are not diffed at all (including dangerouslySetInnerHTML)\r\n\t\t// @TODO we should warn in debug mode when props don't match here.\r\n\t\tif (!isHydrating) {\r\n\t\t\t// But, if we are in a situation where we are using existing DOM (e.g. replaceNode)\r\n\t\t\t// we should read the existing DOM attributes to diff them\r\n\t\t\tif (excessDomChildren != null) {\r\n\t\t\t\toldProps = {};\r\n\t\t\t\tfor (i = 0; i < dom.attributes.length; i++) {\r\n\t\t\t\t\toldProps[dom.attributes[i].name] = dom.attributes[i].value;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif (newHtml || oldHtml) {\r\n\t\t\t\t// Avoid re-applying the same '__html' if it did not changed between re-render\r\n\t\t\t\tif (\r\n\t\t\t\t\t!newHtml ||\r\n\t\t\t\t\t((!oldHtml || newHtml.__html != oldHtml.__html) &&\r\n\t\t\t\t\t\tnewHtml.__html !== dom.innerHTML)\r\n\t\t\t\t) {\r\n\t\t\t\t\tdom.innerHTML = (newHtml && newHtml.__html) || '';\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tdiffProps(dom, newProps, oldProps, isSvg, isHydrating);\r\n\r\n\t\t// If the new vnode didn't have dangerouslySetInnerHTML, diff its children\r\n\t\tif (newHtml) {\r\n\t\t\tnewVNode._children = [];\r\n\t\t} else {\r\n\t\t\ti = newVNode.props.children;\r\n\t\t\tdiffChildren(\r\n\t\t\t\tdom,\r\n\t\t\t\tArray.isArray(i) ? i : [i],\r\n\t\t\t\tnewVNode,\r\n\t\t\t\toldVNode,\r\n\t\t\t\tglobalContext,\r\n\t\t\t\tisSvg && nodeType !== 'foreignObject',\r\n\t\t\t\texcessDomChildren,\r\n\t\t\t\tcommitQueue,\r\n\t\t\t\texcessDomChildren\r\n\t\t\t\t\t? excessDomChildren[0]\r\n\t\t\t\t\t: oldVNode._children && getDomSibling(oldVNode, 0),\r\n\t\t\t\tisHydrating\r\n\t\t\t);\r\n\r\n\t\t\t// Remove children that are not part of any vnode.\r\n\t\t\tif (excessDomChildren != null) {\r\n\t\t\t\tfor (i = excessDomChildren.length; i--; ) {\r\n\t\t\t\t\tif (excessDomChildren[i] != null) removeNode(excessDomChildren[i]);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t// (as above, don't diff props during hydration)\r\n\t\tif (!isHydrating) {\r\n\t\t\tif (\r\n\t\t\t\t'value' in newProps &&\r\n\t\t\t\t(i = newProps.value) !== undefined &&\r\n\t\t\t\t// #2756 For the <progress>-element the initial value is 0,\r\n\t\t\t\t// despite the attribute not being present. When the attribute\r\n\t\t\t\t// is missing the progress bar is treated as indeterminate.\r\n\t\t\t\t// To fix that we'll always update it when it is 0 for progress elements\r\n\t\t\t\t(i !== oldProps.value ||\r\n\t\t\t\t\ti !== dom.value ||\r\n\t\t\t\t\t(nodeType === 'progress' && !i))\r\n\t\t\t) {\r\n\t\t\t\tsetProperty(dom, 'value', i, oldProps.value, false);\r\n\t\t\t}\r\n\t\t\tif (\r\n\t\t\t\t'checked' in newProps &&\r\n\t\t\t\t(i = newProps.checked) !== undefined &&\r\n\t\t\t\ti !== dom.checked\r\n\t\t\t) {\r\n\t\t\t\tsetProperty(dom, 'checked', i, oldProps.checked, false);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\treturn dom;\r\n}\r\n\r\n/**\r\n * Invoke or update a ref, depending on whether it is a function or object ref.\r\n * @param {object|function} ref\r\n * @param {any} value\r\n * @param {import('../internal').VNode} vnode\r\n */\r\nexport function applyRef(ref, value, vnode) {\r\n\ttry {\r\n\t\tif (typeof ref == 'function') ref(value);\r\n\t\telse ref.current = value;\r\n\t} catch (e) {\r\n\t\toptions._catchError(e, vnode);\r\n\t}\r\n}\r\n\r\n/**\r\n * Unmount a virtual node from the tree and apply DOM changes\r\n * @param {import('../internal').VNode} vnode The virtual node to unmount\r\n * @param {import('../internal').VNode} parentVNode The parent of the VNode that\r\n * initiated the unmount\r\n * @param {boolean} [skipRemove] Flag that indicates that a parent node of the\r\n * current element is already detached from the DOM.\r\n */\r\nexport function unmount(vnode, parentVNode, skipRemove) {\r\n\tlet r;\r\n\tif (options.unmount) options.unmount(vnode);\r\n\r\n\tif ((r = vnode.ref)) {\r\n\t\tif (!r.current || r.current === vnode._dom) applyRef(r, null, parentVNode);\r\n\t}\r\n\r\n\tif ((r = vnode._component) != null) {\r\n\t\tif (r.componentWillUnmount) {\r\n\t\t\ttry {\r\n\t\t\t\tr.componentWillUnmount();\r\n\t\t\t} catch (e) {\r\n\t\t\t\toptions._catchError(e, parentVNode);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tr.base = r._parentDom = null;\r\n\t}\r\n\r\n\tif ((r = vnode._children)) {\r\n\t\tfor (let i = 0; i < r.length; i++) {\r\n\t\t\tif (r[i]) {\r\n\t\t\t\tunmount(r[i], parentVNode, typeof vnode.type != 'function');\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tif (!skipRemove && vnode._dom != null) removeNode(vnode._dom);\r\n\r\n\t// Must be set to `undefined` to properly clean up `_nextDom`\r\n\t// for which `null` is a valid value. See comment in `create-element.js`\r\n\tvnode._dom = vnode._nextDom = undefined;\r\n}\r\n\r\n/** The `.render()` method for a PFC backing instance. */\r\nfunction doRender(props, state, context) {\r\n\treturn this.constructor(props, context);\r\n}\r\n", "import { EMPTY_OBJ } from './constants';\r\nimport { commitRoot, diff } from './diff/index';\r\nimport { createElement, Fragment } from './create-element';\r\nimport options from './options';\r\nimport { slice } from './util';\r\n\r\n/**\r\n * Render a Preact virtual node into a DOM element\r\n * @param {import('./internal').ComponentChild} vnode The virtual node to render\r\n * @param {import('./internal').PreactElement} parentDom The DOM element to\r\n * render into\r\n * @param {import('./internal').PreactElement | object} [replaceNode] Optional: Attempt to re-use an\r\n * existing DOM tree rooted at `replaceNode`\r\n */\r\nexport function render(vnode, parentDom, replaceNode) {\r\n\tif (options._root) options._root(vnode, parentDom);\r\n\r\n\t// We abuse the `replaceNode` parameter in `hydrate()` to signal if we are in\r\n\t// hydration mode or not by passing the `hydrate` function instead of a DOM\r\n\t// element..\r\n\tlet isHydrating = typeof replaceNode === 'function';\r\n\r\n\t// To be able to support calling `render()` multiple times on the same\r\n\t// DOM node, we need to obtain a reference to the previous tree. We do\r\n\t// this by assigning a new `_children` property to DOM nodes which points\r\n\t// to the last rendered tree. By default this property is not present, which\r\n\t// means that we are mounting a new tree for the first time.\r\n\tlet oldVNode = isHydrating\r\n\t\t? null\r\n\t\t: (replaceNode && replaceNode._children) || parentDom._children;\r\n\r\n\tvnode = (\r\n\t\t(!isHydrating && replaceNode) ||\r\n\t\tparentDom\r\n\t)._children = createElement(Fragment, null, [vnode]);\r\n\r\n\t// List of effects that need to be called after diffing.\r\n\tlet commitQueue = [];\r\n\tdiff(\r\n\t\tparentDom,\r\n\t\t// Determine the new vnode tree and store it on the DOM element on\r\n\t\t// our custom `_children` property.\r\n\t\tvnode,\r\n\t\toldVNode || EMPTY_OBJ,\r\n\t\tEMPTY_OBJ,\r\n\t\tparentDom.ownerSVGElement !== undefined,\r\n\t\t!isHydrating && replaceNode\r\n\t\t\t? [replaceNode]\r\n\t\t\t: oldVNode\r\n\t\t\t? null\r\n\t\t\t: parentDom.firstChild\r\n\t\t\t? slice.call(parentDom.childNodes)\r\n\t\t\t: null,\r\n\t\tcommitQueue,\r\n\t\t!isHydrating && replaceNode\r\n\t\t\t? replaceNode\r\n\t\t\t: oldVNode\r\n\t\t\t? oldVNode._dom\r\n\t\t\t: parentDom.firstChild,\r\n\t\tisHydrating\r\n\t);\r\n\r\n\t// Flush all queued effects\r\n\tcommitRoot(commitQueue, vnode);\r\n}\r\n\r\n/**\r\n * Update an existing DOM element with data from a Preact virtual node\r\n * @param {import('./internal').ComponentChild} vnode The virtual node to render\r\n * @param {import('./internal').PreactElement} parentDom The DOM element to\r\n * update\r\n */\r\nexport function hydrate(vnode, parentDom) {\r\n\trender(vnode, parentDom, hydrate);\r\n}\r\n", "import { assign, slice } from './util';\r\nimport { createVNode } from './create-element';\r\n\r\n/**\r\n * Clones the given VNode, optionally adding attributes/props and replacing its children.\r\n * @param {import('./internal').VNode} vnode The virtual DOM element to clone\r\n * @param {object} props Attributes/props to add when cloning\r\n * @param {Array<import('./internal').ComponentChildren>} rest Any additional arguments will be used as replacement children.\r\n * @returns {import('./internal').VNode}\r\n */\r\nexport function cloneElement(vnode, props, children) {\r\n\tlet normalizedProps = assign({}, vnode.props),\r\n\t\tkey,\r\n\t\tref,\r\n\t\ti;\r\n\tfor (i in props) {\r\n\t\tif (i == 'key') key = props[i];\r\n\t\telse if (i == 'ref') ref = props[i];\r\n\t\telse normalizedProps[i] = props[i];\r\n\t}\r\n\r\n\tif (arguments.length > 2) {\r\n\t\tnormalizedProps.children =\r\n\t\t\targuments.length > 3 ? slice.call(arguments, 2) : children;\r\n\t}\r\n\r\n\treturn createVNode(\r\n\t\tvnode.type,\r\n\t\tnormalizedProps,\r\n\t\tkey || vnode.key,\r\n\t\tref || vnode.ref,\r\n\t\tnull\r\n\t);\r\n}\r\n", "/**\r\n * Find the closest error boundary to a thrown error and call it\r\n * @param {object} error The thrown value\r\n * @param {import('../internal').VNode} vnode The vnode that threw\r\n * the error that was caught (except for unmounting when this parameter\r\n * is the highest parent that was being unmounted)\r\n */\r\nexport function _catchError(error, vnode) {\r\n\t/** @type {import('../internal').Component} */\r\n\tlet component, ctor, handled;\r\n\r\n\tfor (; (vnode = vnode._parent); ) {\r\n\t\tif ((component = vnode._component) && !component._processingException) {\r\n\t\t\ttry {\r\n\t\t\t\tctor = component.constructor;\r\n\r\n\t\t\t\tif (ctor && ctor.getDerivedStateFromError != null) {\r\n\t\t\t\t\tcomponent.setState(ctor.getDerivedStateFromError(error));\r\n\t\t\t\t\thandled = component._dirty;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (component.componentDidCatch != null) {\r\n\t\t\t\t\tcomponent.componentDidCatch(error);\r\n\t\t\t\t\thandled = component._dirty;\r\n\t\t\t\t}\r\n\r\n\t\t\t\t// This is an error boundary. Mark it as having bailed out, and whether it was mid-hydration.\r\n\t\t\t\tif (handled) {\r\n\t\t\t\t\treturn (component._pendingError = component);\r\n\t\t\t\t}\r\n\t\t\t} catch (e) {\r\n\t\t\t\terror = e;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tthrow error;\r\n}\r\n", "// Reserved word lists for various dialects of the language\n\nvar reservedWords = {\n  3: \"abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile\",\n  5: \"class enum extends super const export import\",\n  6: \"enum\",\n  strict: \"implements interface let package private protected public static yield\",\n  strictBind: \"eval arguments\"\n};\n\n// And the keywords\n\nvar ecma5AndLessKeywords = \"break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this\";\n\nvar keywords$1 = {\n  5: ecma5AndLessKeywords,\n  \"5module\": ecma5AndLessKeywords + \" export import\",\n  6: ecma5AndLessKeywords + \" const class extends export import super\"\n};\n\nvar keywordRelationalOperator = /^in(stanceof)?$/;\n\n// ## Character categories\n\n// Big ugly regular expressions that match characters in the\n// whitespace, identifier, and identifier-start categories. These\n// are only applied when a character is found to actually have a\n// code point above 128.\n// Generated by `bin/generate-identifier-regex.js`.\nvar nonASCIIidentifierStartChars = \"\\xaa\\xb5\\xba\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02c1\\u02c6-\\u02d1\\u02e0-\\u02e4\\u02ec\\u02ee\\u0370-\\u0374\\u0376\\u0377\\u037a-\\u037d\\u037f\\u0386\\u0388-\\u038a\\u038c\\u038e-\\u03a1\\u03a3-\\u03f5\\u03f7-\\u0481\\u048a-\\u052f\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05d0-\\u05ea\\u05ef-\\u05f2\\u0620-\\u064a\\u066e\\u066f\\u0671-\\u06d3\\u06d5\\u06e5\\u06e6\\u06ee\\u06ef\\u06fa-\\u06fc\\u06ff\\u0710\\u0712-\\u072f\\u074d-\\u07a5\\u07b1\\u07ca-\\u07ea\\u07f4\\u07f5\\u07fa\\u0800-\\u0815\\u081a\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086a\\u0870-\\u0887\\u0889-\\u088e\\u08a0-\\u08c9\\u0904-\\u0939\\u093d\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098c\\u098f\\u0990\\u0993-\\u09a8\\u09aa-\\u09b0\\u09b2\\u09b6-\\u09b9\\u09bd\\u09ce\\u09dc\\u09dd\\u09df-\\u09e1\\u09f0\\u09f1\\u09fc\\u0a05-\\u0a0a\\u0a0f\\u0a10\\u0a13-\\u0a28\\u0a2a-\\u0a30\\u0a32\\u0a33\\u0a35\\u0a36\\u0a38\\u0a39\\u0a59-\\u0a5c\\u0a5e\\u0a72-\\u0a74\\u0a85-\\u0a8d\\u0a8f-\\u0a91\\u0a93-\\u0aa8\\u0aaa-\\u0ab0\\u0ab2\\u0ab3\\u0ab5-\\u0ab9\\u0abd\\u0ad0\\u0ae0\\u0ae1\\u0af9\\u0b05-\\u0b0c\\u0b0f\\u0b10\\u0b13-\\u0b28\\u0b2a-\\u0b30\\u0b32\\u0b33\\u0b35-\\u0b39\\u0b3d\\u0b5c\\u0b5d\\u0b5f-\\u0b61\\u0b71\\u0b83\\u0b85-\\u0b8a\\u0b8e-\\u0b90\\u0b92-\\u0b95\\u0b99\\u0b9a\\u0b9c\\u0b9e\\u0b9f\\u0ba3\\u0ba4\\u0ba8-\\u0baa\\u0bae-\\u0bb9\\u0bd0\\u0c05-\\u0c0c\\u0c0e-\\u0c10\\u0c12-\\u0c28\\u0c2a-\\u0c39\\u0c3d\\u0c58-\\u0c5a\\u0c5d\\u0c60\\u0c61\\u0c80\\u0c85-\\u0c8c\\u0c8e-\\u0c90\\u0c92-\\u0ca8\\u0caa-\\u0cb3\\u0cb5-\\u0cb9\\u0cbd\\u0cdd\\u0cde\\u0ce0\\u0ce1\\u0cf1\\u0cf2\\u0d04-\\u0d0c\\u0d0e-\\u0d10\\u0d12-\\u0d3a\\u0d3d\\u0d4e\\u0d54-\\u0d56\\u0d5f-\\u0d61\\u0d7a-\\u0d7f\\u0d85-\\u0d96\\u0d9a-\\u0db1\\u0db3-\\u0dbb\\u0dbd\\u0dc0-\\u0dc6\\u0e01-\\u0e30\\u0e32\\u0e33\\u0e40-\\u0e46\\u0e81\\u0e82\\u0e84\\u0e86-\\u0e8a\\u0e8c-\\u0ea3\\u0ea5\\u0ea7-\\u0eb0\\u0eb2\\u0eb3\\u0ebd\\u0ec0-\\u0ec4\\u0ec6\\u0edc-\\u0edf\\u0f00\\u0f40-\\u0f47\\u0f49-\\u0f6c\\u0f88-\\u0f8c\\u1000-\\u102a\\u103f\\u1050-\\u1055\\u105a-\\u105d\\u1061\\u1065\\u1066\\u106e-\\u1070\\u1075-\\u1081\\u108e\\u10a0-\\u10c5\\u10c7\\u10cd\\u10d0-\\u10fa\\u10fc-\\u1248\\u124a-\\u124d\\u1250-\\u1256\\u1258\\u125a-\\u125d\\u1260-\\u1288\\u128a-\\u128d\\u1290-\\u12b0\\u12b2-\\u12b5\\u12b8-\\u12be\\u12c0\\u12c2-\\u12c5\\u12c8-\\u12d6\\u12d8-\\u1310\\u1312-\\u1315\\u1318-\\u135a\\u1380-\\u138f\\u13a0-\\u13f5\\u13f8-\\u13fd\\u1401-\\u166c\\u166f-\\u167f\\u1681-\\u169a\\u16a0-\\u16ea\\u16ee-\\u16f8\\u1700-\\u1711\\u171f-\\u1731\\u1740-\\u1751\\u1760-\\u176c\\u176e-\\u1770\\u1780-\\u17b3\\u17d7\\u17dc\\u1820-\\u1878\\u1880-\\u18a8\\u18aa\\u18b0-\\u18f5\\u1900-\\u191e\\u1950-\\u196d\\u1970-\\u1974\\u1980-\\u19ab\\u19b0-\\u19c9\\u1a00-\\u1a16\\u1a20-\\u1a54\\u1aa7\\u1b05-\\u1b33\\u1b45-\\u1b4c\\u1b83-\\u1ba0\\u1bae\\u1baf\\u1bba-\\u1be5\\u1c00-\\u1c23\\u1c4d-\\u1c4f\\u1c5a-\\u1c7d\\u1c80-\\u1c88\\u1c90-\\u1cba\\u1cbd-\\u1cbf\\u1ce9-\\u1cec\\u1cee-\\u1cf3\\u1cf5\\u1cf6\\u1cfa\\u1d00-\\u1dbf\\u1e00-\\u1f15\\u1f18-\\u1f1d\\u1f20-\\u1f45\\u1f48-\\u1f4d\\u1f50-\\u1f57\\u1f59\\u1f5b\\u1f5d\\u1f5f-\\u1f7d\\u1f80-\\u1fb4\\u1fb6-\\u1fbc\\u1fbe\\u1fc2-\\u1fc4\\u1fc6-\\u1fcc\\u1fd0-\\u1fd3\\u1fd6-\\u1fdb\\u1fe0-\\u1fec\\u1ff2-\\u1ff4\\u1ff6-\\u1ffc\\u2071\\u207f\\u2090-\\u209c\\u2102\\u2107\\u210a-\\u2113\\u2115\\u2118-\\u211d\\u2124\\u2126\\u2128\\u212a-\\u2139\\u213c-\\u213f\\u2145-\\u2149\\u214e\\u2160-\\u2188\\u2c00-\\u2ce4\\u2ceb-\\u2cee\\u2cf2\\u2cf3\\u2d00-\\u2d25\\u2d27\\u2d2d\\u2d30-\\u2d67\\u2d6f\\u2d80-\\u2d96\\u2da0-\\u2da6\\u2da8-\\u2dae\\u2db0-\\u2db6\\u2db8-\\u2dbe\\u2dc0-\\u2dc6\\u2dc8-\\u2dce\\u2dd0-\\u2dd6\\u2dd8-\\u2dde\\u3005-\\u3007\\u3021-\\u3029\\u3031-\\u3035\\u3038-\\u303c\\u3041-\\u3096\\u309b-\\u309f\\u30a1-\\u30fa\\u30fc-\\u30ff\\u3105-\\u312f\\u3131-\\u318e\\u31a0-\\u31bf\\u31f0-\\u31ff\\u3400-\\u4dbf\\u4e00-\\ua48c\\ua4d0-\\ua4fd\\ua500-\\ua60c\\ua610-\\ua61f\\ua62a\\ua62b\\ua640-\\ua66e\\ua67f-\\ua69d\\ua6a0-\\ua6ef\\ua717-\\ua71f\\ua722-\\ua788\\ua78b-\\ua7ca\\ua7d0\\ua7d1\\ua7d3\\ua7d5-\\ua7d9\\ua7f2-\\ua801\\ua803-\\ua805\\ua807-\\ua80a\\ua80c-\\ua822\\ua840-\\ua873\\ua882-\\ua8b3\\ua8f2-\\ua8f7\\ua8fb\\ua8fd\\ua8fe\\ua90a-\\ua925\\ua930-\\ua946\\ua960-\\ua97c\\ua984-\\ua9b2\\ua9cf\\ua9e0-\\ua9e4\\ua9e6-\\ua9ef\\ua9fa-\\ua9fe\\uaa00-\\uaa28\\uaa40-\\uaa42\\uaa44-\\uaa4b\\uaa60-\\uaa76\\uaa7a\\uaa7e-\\uaaaf\\uaab1\\uaab5\\uaab6\\uaab9-\\uaabd\\uaac0\\uaac2\\uaadb-\\uaadd\\uaae0-\\uaaea\\uaaf2-\\uaaf4\\uab01-\\uab06\\uab09-\\uab0e\\uab11-\\uab16\\uab20-\\uab26\\uab28-\\uab2e\\uab30-\\uab5a\\uab5c-\\uab69\\uab70-\\uabe2\\uac00-\\ud7a3\\ud7b0-\\ud7c6\\ud7cb-\\ud7fb\\uf900-\\ufa6d\\ufa70-\\ufad9\\ufb00-\\ufb06\\ufb13-\\ufb17\\ufb1d\\ufb1f-\\ufb28\\ufb2a-\\ufb36\\ufb38-\\ufb3c\\ufb3e\\ufb40\\ufb41\\ufb43\\ufb44\\ufb46-\\ufbb1\\ufbd3-\\ufd3d\\ufd50-\\ufd8f\\ufd92-\\ufdc7\\ufdf0-\\ufdfb\\ufe70-\\ufe74\\ufe76-\\ufefc\\uff21-\\uff3a\\uff41-\\uff5a\\uff66-\\uffbe\\uffc2-\\uffc7\\uffca-\\uffcf\\uffd2-\\uffd7\\uffda-\\uffdc\";\nvar nonASCIIidentifierChars = \"\\u200c\\u200d\\xb7\\u0300-\\u036f\\u0387\\u0483-\\u0487\\u0591-\\u05bd\\u05bf\\u05c1\\u05c2\\u05c4\\u05c5\\u05c7\\u0610-\\u061a\\u064b-\\u0669\\u0670\\u06d6-\\u06dc\\u06df-\\u06e4\\u06e7\\u06e8\\u06ea-\\u06ed\\u06f0-\\u06f9\\u0711\\u0730-\\u074a\\u07a6-\\u07b0\\u07c0-\\u07c9\\u07eb-\\u07f3\\u07fd\\u0816-\\u0819\\u081b-\\u0823\\u0825-\\u0827\\u0829-\\u082d\\u0859-\\u085b\\u0898-\\u089f\\u08ca-\\u08e1\\u08e3-\\u0903\\u093a-\\u093c\\u093e-\\u094f\\u0951-\\u0957\\u0962\\u0963\\u0966-\\u096f\\u0981-\\u0983\\u09bc\\u09be-\\u09c4\\u09c7\\u09c8\\u09cb-\\u09cd\\u09d7\\u09e2\\u09e3\\u09e6-\\u09ef\\u09fe\\u0a01-\\u0a03\\u0a3c\\u0a3e-\\u0a42\\u0a47\\u0a48\\u0a4b-\\u0a4d\\u0a51\\u0a66-\\u0a71\\u0a75\\u0a81-\\u0a83\\u0abc\\u0abe-\\u0ac5\\u0ac7-\\u0ac9\\u0acb-\\u0acd\\u0ae2\\u0ae3\\u0ae6-\\u0aef\\u0afa-\\u0aff\\u0b01-\\u0b03\\u0b3c\\u0b3e-\\u0b44\\u0b47\\u0b48\\u0b4b-\\u0b4d\\u0b55-\\u0b57\\u0b62\\u0b63\\u0b66-\\u0b6f\\u0b82\\u0bbe-\\u0bc2\\u0bc6-\\u0bc8\\u0bca-\\u0bcd\\u0bd7\\u0be6-\\u0bef\\u0c00-\\u0c04\\u0c3c\\u0c3e-\\u0c44\\u0c46-\\u0c48\\u0c4a-\\u0c4d\\u0c55\\u0c56\\u0c62\\u0c63\\u0c66-\\u0c6f\\u0c81-\\u0c83\\u0cbc\\u0cbe-\\u0cc4\\u0cc6-\\u0cc8\\u0cca-\\u0ccd\\u0cd5\\u0cd6\\u0ce2\\u0ce3\\u0ce6-\\u0cef\\u0d00-\\u0d03\\u0d3b\\u0d3c\\u0d3e-\\u0d44\\u0d46-\\u0d48\\u0d4a-\\u0d4d\\u0d57\\u0d62\\u0d63\\u0d66-\\u0d6f\\u0d81-\\u0d83\\u0dca\\u0dcf-\\u0dd4\\u0dd6\\u0dd8-\\u0ddf\\u0de6-\\u0def\\u0df2\\u0df3\\u0e31\\u0e34-\\u0e3a\\u0e47-\\u0e4e\\u0e50-\\u0e59\\u0eb1\\u0eb4-\\u0ebc\\u0ec8-\\u0ecd\\u0ed0-\\u0ed9\\u0f18\\u0f19\\u0f20-\\u0f29\\u0f35\\u0f37\\u0f39\\u0f3e\\u0f3f\\u0f71-\\u0f84\\u0f86\\u0f87\\u0f8d-\\u0f97\\u0f99-\\u0fbc\\u0fc6\\u102b-\\u103e\\u1040-\\u1049\\u1056-\\u1059\\u105e-\\u1060\\u1062-\\u1064\\u1067-\\u106d\\u1071-\\u1074\\u1082-\\u108d\\u108f-\\u109d\\u135d-\\u135f\\u1369-\\u1371\\u1712-\\u1715\\u1732-\\u1734\\u1752\\u1753\\u1772\\u1773\\u17b4-\\u17d3\\u17dd\\u17e0-\\u17e9\\u180b-\\u180d\\u180f-\\u1819\\u18a9\\u1920-\\u192b\\u1930-\\u193b\\u1946-\\u194f\\u19d0-\\u19da\\u1a17-\\u1a1b\\u1a55-\\u1a5e\\u1a60-\\u1a7c\\u1a7f-\\u1a89\\u1a90-\\u1a99\\u1ab0-\\u1abd\\u1abf-\\u1ace\\u1b00-\\u1b04\\u1b34-\\u1b44\\u1b50-\\u1b59\\u1b6b-\\u1b73\\u1b80-\\u1b82\\u1ba1-\\u1bad\\u1bb0-\\u1bb9\\u1be6-\\u1bf3\\u1c24-\\u1c37\\u1c40-\\u1c49\\u1c50-\\u1c59\\u1cd0-\\u1cd2\\u1cd4-\\u1ce8\\u1ced\\u1cf4\\u1cf7-\\u1cf9\\u1dc0-\\u1dff\\u203f\\u2040\\u2054\\u20d0-\\u20dc\\u20e1\\u20e5-\\u20f0\\u2cef-\\u2cf1\\u2d7f\\u2de0-\\u2dff\\u302a-\\u302f\\u3099\\u309a\\ua620-\\ua629\\ua66f\\ua674-\\ua67d\\ua69e\\ua69f\\ua6f0\\ua6f1\\ua802\\ua806\\ua80b\\ua823-\\ua827\\ua82c\\ua880\\ua881\\ua8b4-\\ua8c5\\ua8d0-\\ua8d9\\ua8e0-\\ua8f1\\ua8ff-\\ua909\\ua926-\\ua92d\\ua947-\\ua953\\ua980-\\ua983\\ua9b3-\\ua9c0\\ua9d0-\\ua9d9\\ua9e5\\ua9f0-\\ua9f9\\uaa29-\\uaa36\\uaa43\\uaa4c\\uaa4d\\uaa50-\\uaa59\\uaa7b-\\uaa7d\\uaab0\\uaab2-\\uaab4\\uaab7\\uaab8\\uaabe\\uaabf\\uaac1\\uaaeb-\\uaaef\\uaaf5\\uaaf6\\uabe3-\\uabea\\uabec\\uabed\\uabf0-\\uabf9\\ufb1e\\ufe00-\\ufe0f\\ufe20-\\ufe2f\\ufe33\\ufe34\\ufe4d-\\ufe4f\\uff10-\\uff19\\uff3f\";\n\nvar nonASCIIidentifierStart = new RegExp(\"[\" + nonASCIIidentifierStartChars + \"]\");\nvar nonASCIIidentifier = new RegExp(\"[\" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + \"]\");\n\nnonASCIIidentifierStartChars = nonASCIIidentifierChars = null;\n\n// These are a run-length and offset encoded representation of the\n// >0xffff code points that are a valid part of identifiers. The\n// offset starts at 0x10000, and each pair of numbers represents an\n// offset to the next range, and then a size of the range. They were\n// generated by bin/generate-identifier-regex.js\n\n// eslint-disable-next-line comma-spacing\nvar astralIdentifierStartCodes = [0,11,2,25,2,18,2,1,2,14,3,13,35,122,70,52,268,28,4,48,48,31,14,29,6,37,11,29,3,35,5,7,2,4,43,157,19,35,5,35,5,39,9,51,13,10,2,14,2,6,2,1,2,10,2,14,2,6,2,1,68,310,10,21,11,7,25,5,2,41,2,8,70,5,3,0,2,43,2,1,4,0,3,22,11,22,10,30,66,18,2,1,11,21,11,25,71,55,7,1,65,0,16,3,2,2,2,28,43,28,4,28,36,7,2,27,28,53,11,21,11,18,14,17,111,72,56,50,14,50,14,35,349,41,7,1,79,28,11,0,9,21,43,17,47,20,28,22,13,52,58,1,3,0,14,44,33,24,27,35,30,0,3,0,9,34,4,0,13,47,15,3,22,0,2,0,36,17,2,24,85,6,2,0,2,3,2,14,2,9,8,46,39,7,3,1,3,21,2,6,2,1,2,4,4,0,19,0,13,4,159,52,19,3,21,2,31,47,21,1,2,0,185,46,42,3,37,47,21,0,60,42,14,0,72,26,38,6,186,43,117,63,32,7,3,0,3,7,2,1,2,23,16,0,2,0,95,7,3,38,17,0,2,0,29,0,11,39,8,0,22,0,12,45,20,0,19,72,264,8,2,36,18,0,50,29,113,6,2,1,2,37,22,0,26,5,2,1,2,31,15,0,328,18,190,0,80,921,103,110,18,195,2637,96,16,1070,4050,582,8634,568,8,30,18,78,18,29,19,47,17,3,32,20,6,18,689,63,129,74,6,0,67,12,65,1,2,0,29,6135,9,1237,43,8,8936,3,2,6,2,1,2,290,46,2,18,3,9,395,2309,106,6,12,4,8,8,9,5991,84,2,70,2,1,3,0,3,1,3,3,2,11,2,0,2,6,2,64,2,3,3,7,2,6,2,27,2,3,2,4,2,0,4,6,2,339,3,24,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,7,1845,30,482,44,11,6,17,0,322,29,19,43,1269,6,2,3,2,1,2,14,2,196,60,67,8,0,1205,3,2,26,2,1,2,0,3,0,2,9,2,3,2,0,2,0,7,0,5,0,2,0,2,0,2,2,2,1,2,0,3,0,2,0,2,0,2,0,2,0,2,1,2,0,3,3,2,6,2,3,2,3,2,0,2,9,2,16,6,2,2,4,2,16,4421,42719,33,4152,8,221,3,5761,15,7472,3104,541,1507,4938];\n\n// eslint-disable-next-line comma-spacing\nvar astralIdentifierCodes = [509,0,227,0,150,4,294,9,1368,2,2,1,6,3,41,2,5,0,166,1,574,3,9,9,370,1,154,10,50,3,123,2,54,14,32,10,3,1,11,3,46,10,8,0,46,9,7,2,37,13,2,9,6,1,45,0,13,2,49,13,9,3,2,11,83,11,7,0,161,11,6,9,7,3,56,1,2,6,3,1,3,2,10,0,11,1,3,6,4,4,193,17,10,9,5,0,82,19,13,9,214,6,3,8,28,1,83,16,16,9,82,12,9,9,84,14,5,9,243,14,166,9,71,5,2,1,3,3,2,0,2,1,13,9,120,6,3,6,4,0,29,9,41,6,2,3,9,0,10,10,47,15,406,7,2,7,17,9,57,21,2,13,123,5,4,0,2,1,2,6,2,0,9,9,49,4,2,1,2,4,9,9,330,3,19306,9,87,9,39,4,60,6,26,9,1014,0,2,54,8,3,82,0,12,1,19628,1,4706,45,3,22,543,4,4,5,9,7,3,6,31,3,149,2,1418,49,513,54,5,49,9,0,15,0,23,4,2,14,1361,6,2,16,3,6,2,1,2,4,262,6,10,9,357,0,62,13,1495,6,110,6,6,9,4759,9,787719,239];\n\n// This has a complexity linear to the value of the code. The\n// assumption is that looking up astral identifier characters is\n// rare.\nfunction isInAstralSet(code, set) {\n  var pos = 0x10000;\n  for (var i = 0; i < set.length; i += 2) {\n    pos += set[i];\n    if (pos > code) { return false }\n    pos += set[i + 1];\n    if (pos >= code) { return true }\n  }\n}\n\n// Test whether a given character code starts an identifier.\n\nfunction isIdentifierStart(code, astral) {\n  if (code < 65) { return code === 36 }\n  if (code < 91) { return true }\n  if (code < 97) { return code === 95 }\n  if (code < 123) { return true }\n  if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code)) }\n  if (astral === false) { return false }\n  return isInAstralSet(code, astralIdentifierStartCodes)\n}\n\n// Test whether a given character is part of an identifier.\n\nfunction isIdentifierChar(code, astral) {\n  if (code < 48) { return code === 36 }\n  if (code < 58) { return true }\n  if (code < 65) { return false }\n  if (code < 91) { return true }\n  if (code < 97) { return code === 95 }\n  if (code < 123) { return true }\n  if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code)) }\n  if (astral === false) { return false }\n  return isInAstralSet(code, astralIdentifierStartCodes) || isInAstralSet(code, astralIdentifierCodes)\n}\n\n// ## Token types\n\n// The assignment of fine-grained, information-carrying type objects\n// allows the tokenizer to store the information it has about a\n// token in a way that is very cheap for the parser to look up.\n\n// All token type variables start with an underscore, to make them\n// easy to recognize.\n\n// The `beforeExpr` property is used to disambiguate between regular\n// expressions and divisions. It is set on all token types that can\n// be followed by an expression (thus, a slash after them would be a\n// regular expression).\n//\n// The `startsExpr` property is used to check if the token ends a\n// `yield` expression. It is set on all token types that either can\n// directly start an expression (like a quotation mark) or can\n// continue an expression (like the body of a string).\n//\n// `isLoop` marks a keyword as starting a loop, which is important\n// to know when parsing a label, in order to allow or disallow\n// continue jumps to that label.\n\nvar TokenType = function TokenType(label, conf) {\n  if ( conf === void 0 ) conf = {};\n\n  this.label = label;\n  this.keyword = conf.keyword;\n  this.beforeExpr = !!conf.beforeExpr;\n  this.startsExpr = !!conf.startsExpr;\n  this.isLoop = !!conf.isLoop;\n  this.isAssign = !!conf.isAssign;\n  this.prefix = !!conf.prefix;\n  this.postfix = !!conf.postfix;\n  this.binop = conf.binop || null;\n  this.updateContext = null;\n};\n\nfunction binop(name, prec) {\n  return new TokenType(name, {beforeExpr: true, binop: prec})\n}\nvar beforeExpr = {beforeExpr: true}, startsExpr = {startsExpr: true};\n\n// Map keyword names to token types.\n\nvar keywords = {};\n\n// Succinct definitions of keyword token types\nfunction kw(name, options) {\n  if ( options === void 0 ) options = {};\n\n  options.keyword = name;\n  return keywords[name] = new TokenType(name, options)\n}\n\nvar types$1 = {\n  num: new TokenType(\"num\", startsExpr),\n  regexp: new TokenType(\"regexp\", startsExpr),\n  string: new TokenType(\"string\", startsExpr),\n  name: new TokenType(\"name\", startsExpr),\n  privateId: new TokenType(\"privateId\", startsExpr),\n  eof: new TokenType(\"eof\"),\n\n  // Punctuation token types.\n  bracketL: new TokenType(\"[\", {beforeExpr: true, startsExpr: true}),\n  bracketR: new TokenType(\"]\"),\n  braceL: new TokenType(\"{\", {beforeExpr: true, startsExpr: true}),\n  braceR: new TokenType(\"}\"),\n  parenL: new TokenType(\"(\", {beforeExpr: true, startsExpr: true}),\n  parenR: new TokenType(\")\"),\n  comma: new TokenType(\",\", beforeExpr),\n  semi: new TokenType(\";\", beforeExpr),\n  colon: new TokenType(\":\", beforeExpr),\n  dot: new TokenType(\".\"),\n  question: new TokenType(\"?\", beforeExpr),\n  questionDot: new TokenType(\"?.\"),\n  arrow: new TokenType(\"=>\", beforeExpr),\n  template: new TokenType(\"template\"),\n  invalidTemplate: new TokenType(\"invalidTemplate\"),\n  ellipsis: new TokenType(\"...\", beforeExpr),\n  backQuote: new TokenType(\"`\", startsExpr),\n  dollarBraceL: new TokenType(\"${\", {beforeExpr: true, startsExpr: true}),\n\n  // Operators. These carry several kinds of properties to help the\n  // parser use them properly (the presence of these properties is\n  // what categorizes them as operators).\n  //\n  // `binop`, when present, specifies that this operator is a binary\n  // operator, and will refer to its precedence.\n  //\n  // `prefix` and `postfix` mark the operator as a prefix or postfix\n  // unary operator.\n  //\n  // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as\n  // binary operators with a very low precedence, that should result\n  // in AssignmentExpression nodes.\n\n  eq: new TokenType(\"=\", {beforeExpr: true, isAssign: true}),\n  assign: new TokenType(\"_=\", {beforeExpr: true, isAssign: true}),\n  incDec: new TokenType(\"++/--\", {prefix: true, postfix: true, startsExpr: true}),\n  prefix: new TokenType(\"!/~\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  logicalOR: binop(\"||\", 1),\n  logicalAND: binop(\"&&\", 2),\n  bitwiseOR: binop(\"|\", 3),\n  bitwiseXOR: binop(\"^\", 4),\n  bitwiseAND: binop(\"&\", 5),\n  equality: binop(\"==/!=/===/!==\", 6),\n  relational: binop(\"</>/<=/>=\", 7),\n  bitShift: binop(\"<</>>/>>>\", 8),\n  plusMin: new TokenType(\"+/-\", {beforeExpr: true, binop: 9, prefix: true, startsExpr: true}),\n  modulo: binop(\"%\", 10),\n  star: binop(\"*\", 10),\n  slash: binop(\"/\", 10),\n  starstar: new TokenType(\"**\", {beforeExpr: true}),\n  coalesce: binop(\"??\", 1),\n\n  // Keyword token types.\n  _break: kw(\"break\"),\n  _case: kw(\"case\", beforeExpr),\n  _catch: kw(\"catch\"),\n  _continue: kw(\"continue\"),\n  _debugger: kw(\"debugger\"),\n  _default: kw(\"default\", beforeExpr),\n  _do: kw(\"do\", {isLoop: true, beforeExpr: true}),\n  _else: kw(\"else\", beforeExpr),\n  _finally: kw(\"finally\"),\n  _for: kw(\"for\", {isLoop: true}),\n  _function: kw(\"function\", startsExpr),\n  _if: kw(\"if\"),\n  _return: kw(\"return\", beforeExpr),\n  _switch: kw(\"switch\"),\n  _throw: kw(\"throw\", beforeExpr),\n  _try: kw(\"try\"),\n  _var: kw(\"var\"),\n  _const: kw(\"const\"),\n  _while: kw(\"while\", {isLoop: true}),\n  _with: kw(\"with\"),\n  _new: kw(\"new\", {beforeExpr: true, startsExpr: true}),\n  _this: kw(\"this\", startsExpr),\n  _super: kw(\"super\", startsExpr),\n  _class: kw(\"class\", startsExpr),\n  _extends: kw(\"extends\", beforeExpr),\n  _export: kw(\"export\"),\n  _import: kw(\"import\", startsExpr),\n  _null: kw(\"null\", startsExpr),\n  _true: kw(\"true\", startsExpr),\n  _false: kw(\"false\", startsExpr),\n  _in: kw(\"in\", {beforeExpr: true, binop: 7}),\n  _instanceof: kw(\"instanceof\", {beforeExpr: true, binop: 7}),\n  _typeof: kw(\"typeof\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  _void: kw(\"void\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  _delete: kw(\"delete\", {beforeExpr: true, prefix: true, startsExpr: true})\n};\n\n// Matches a whole line break (where CRLF is considered a single\n// line break). Used to count lines.\n\nvar lineBreak = /\\r\\n?|\\n|\\u2028|\\u2029/;\nvar lineBreakG = new RegExp(lineBreak.source, \"g\");\n\nfunction isNewLine(code) {\n  return code === 10 || code === 13 || code === 0x2028 || code === 0x2029\n}\n\nfunction nextLineBreak(code, from, end) {\n  if ( end === void 0 ) end = code.length;\n\n  for (var i = from; i < end; i++) {\n    var next = code.charCodeAt(i);\n    if (isNewLine(next))\n      { return i < end - 1 && next === 13 && code.charCodeAt(i + 1) === 10 ? i + 2 : i + 1 }\n  }\n  return -1\n}\n\nvar nonASCIIwhitespace = /[\\u1680\\u2000-\\u200a\\u202f\\u205f\\u3000\\ufeff]/;\n\nvar skipWhiteSpace = /(?:\\s|\\/\\/.*|\\/\\*[^]*?\\*\\/)*/g;\n\nvar ref = Object.prototype;\nvar hasOwnProperty = ref.hasOwnProperty;\nvar toString = ref.toString;\n\nvar hasOwn = Object.hasOwn || (function (obj, propName) { return (\n  hasOwnProperty.call(obj, propName)\n); });\n\nvar isArray = Array.isArray || (function (obj) { return (\n  toString.call(obj) === \"[object Array]\"\n); });\n\nfunction wordsRegexp(words) {\n  return new RegExp(\"^(?:\" + words.replace(/ /g, \"|\") + \")$\")\n}\n\nvar loneSurrogate = /(?:[\\uD800-\\uDBFF](?![\\uDC00-\\uDFFF])|(?:[^\\uD800-\\uDBFF]|^)[\\uDC00-\\uDFFF])/;\n\n// These are used when `options.locations` is on, for the\n// `startLoc` and `endLoc` properties.\n\nvar Position = function Position(line, col) {\n  this.line = line;\n  this.column = col;\n};\n\nPosition.prototype.offset = function offset (n) {\n  return new Position(this.line, this.column + n)\n};\n\nvar SourceLocation = function SourceLocation(p, start, end) {\n  this.start = start;\n  this.end = end;\n  if (p.sourceFile !== null) { this.source = p.sourceFile; }\n};\n\n// The `getLineInfo` function is mostly useful when the\n// `locations` option is off (for performance reasons) and you\n// want to find the line/column position for a given character\n// offset. `input` should be the code string that the offset refers\n// into.\n\nfunction getLineInfo(input, offset) {\n  for (var line = 1, cur = 0;;) {\n    var nextBreak = nextLineBreak(input, cur, offset);\n    if (nextBreak < 0) { return new Position(line, offset - cur) }\n    ++line;\n    cur = nextBreak;\n  }\n}\n\n// A second argument must be given to configure the parser process.\n// These options are recognized (only `ecmaVersion` is required):\n\nvar defaultOptions = {\n  // `ecmaVersion` indicates the ECMAScript version to parse. Must be\n  // either 3, 5, 6 (or 2015), 7 (2016), 8 (2017), 9 (2018), 10\n  // (2019), 11 (2020), 12 (2021), 13 (2022), or `\"latest\"` (the\n  // latest version the library supports). This influences support\n  // for strict mode, the set of reserved words, and support for\n  // new syntax features.\n  ecmaVersion: null,\n  // `sourceType` indicates the mode the code should be parsed in.\n  // Can be either `\"script\"` or `\"module\"`. This influences global\n  // strict mode and parsing of `import` and `export` declarations.\n  sourceType: \"script\",\n  // `onInsertedSemicolon` can be a callback that will be called\n  // when a semicolon is automatically inserted. It will be passed\n  // the position of the comma as an offset, and if `locations` is\n  // enabled, it is given the location as a `{line, column}` object\n  // as second argument.\n  onInsertedSemicolon: null,\n  // `onTrailingComma` is similar to `onInsertedSemicolon`, but for\n  // trailing commas.\n  onTrailingComma: null,\n  // By default, reserved words are only enforced if ecmaVersion >= 5.\n  // Set `allowReserved` to a boolean value to explicitly turn this on\n  // an off. When this option has the value \"never\", reserved words\n  // and keywords can also not be used as property names.\n  allowReserved: null,\n  // When enabled, a return at the top level is not considered an\n  // error.\n  allowReturnOutsideFunction: false,\n  // When enabled, import/export statements are not constrained to\n  // appearing at the top of the program, and an import.meta expression\n  // in a script isn't considered an error.\n  allowImportExportEverywhere: false,\n  // By default, await identifiers are allowed to appear at the top-level scope only if ecmaVersion >= 2022.\n  // When enabled, await identifiers are allowed to appear at the top-level scope,\n  // but they are still not allowed in non-async functions.\n  allowAwaitOutsideFunction: null,\n  // When enabled, super identifiers are not constrained to\n  // appearing in methods and do not raise an error when they appear elsewhere.\n  allowSuperOutsideMethod: null,\n  // When enabled, hashbang directive in the beginning of file\n  // is allowed and treated as a line comment.\n  allowHashBang: false,\n  // When `locations` is on, `loc` properties holding objects with\n  // `start` and `end` properties in `{line, column}` form (with\n  // line being 1-based and column 0-based) will be attached to the\n  // nodes.\n  locations: false,\n  // A function can be passed as `onToken` option, which will\n  // cause Acorn to call that function with object in the same\n  // format as tokens returned from `tokenizer().getToken()`. Note\n  // that you are not allowed to call the parser from the\n  // callback\u2014that will corrupt its internal state.\n  onToken: null,\n  // A function can be passed as `onComment` option, which will\n  // cause Acorn to call that function with `(block, text, start,\n  // end)` parameters whenever a comment is skipped. `block` is a\n  // boolean indicating whether this is a block (`/* */`) comment,\n  // `text` is the content of the comment, and `start` and `end` are\n  // character offsets that denote the start and end of the comment.\n  // When the `locations` option is on, two more parameters are\n  // passed, the full `{line, column}` locations of the start and\n  // end of the comments. Note that you are not allowed to call the\n  // parser from the callback\u2014that will corrupt its internal state.\n  onComment: null,\n  // Nodes have their start and end characters offsets recorded in\n  // `start` and `end` properties (directly on the node, rather than\n  // the `loc` object, which holds line/column data. To also add a\n  // [semi-standardized][range] `range` property holding a `[start,\n  // end]` array with the same numbers, set the `ranges` option to\n  // `true`.\n  //\n  // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678\n  ranges: false,\n  // It is possible to parse multiple files into a single AST by\n  // passing the tree produced by parsing the first file as\n  // `program` option in subsequent parses. This will add the\n  // toplevel forms of the parsed file to the `Program` (top) node\n  // of an existing parse tree.\n  program: null,\n  // When `locations` is on, you can pass this to record the source\n  // file in every node's `loc` object.\n  sourceFile: null,\n  // This value, if given, is stored in every node, whether\n  // `locations` is on or off.\n  directSourceFile: null,\n  // When enabled, parenthesized expressions are represented by\n  // (non-standard) ParenthesizedExpression nodes\n  preserveParens: false\n};\n\n// Interpret and default an options object\n\nvar warnedAboutEcmaVersion = false;\n\nfunction getOptions(opts) {\n  var options = {};\n\n  for (var opt in defaultOptions)\n    { options[opt] = opts && hasOwn(opts, opt) ? opts[opt] : defaultOptions[opt]; }\n\n  if (options.ecmaVersion === \"latest\") {\n    options.ecmaVersion = 1e8;\n  } else if (options.ecmaVersion == null) {\n    if (!warnedAboutEcmaVersion && typeof console === \"object\" && console.warn) {\n      warnedAboutEcmaVersion = true;\n      console.warn(\"Since Acorn 8.0.0, options.ecmaVersion is required.\\nDefaulting to 2020, but this will stop working in the future.\");\n    }\n    options.ecmaVersion = 11;\n  } else if (options.ecmaVersion >= 2015) {\n    options.ecmaVersion -= 2009;\n  }\n\n  if (options.allowReserved == null)\n    { options.allowReserved = options.ecmaVersion < 5; }\n\n  if (isArray(options.onToken)) {\n    var tokens = options.onToken;\n    options.onToken = function (token) { return tokens.push(token); };\n  }\n  if (isArray(options.onComment))\n    { options.onComment = pushComment(options, options.onComment); }\n\n  return options\n}\n\nfunction pushComment(options, array) {\n  return function(block, text, start, end, startLoc, endLoc) {\n    var comment = {\n      type: block ? \"Block\" : \"Line\",\n      value: text,\n      start: start,\n      end: end\n    };\n    if (options.locations)\n      { comment.loc = new SourceLocation(this, startLoc, endLoc); }\n    if (options.ranges)\n      { comment.range = [start, end]; }\n    array.push(comment);\n  }\n}\n\n// Each scope gets a bitset that may contain these flags\nvar\n    SCOPE_TOP = 1,\n    SCOPE_FUNCTION = 2,\n    SCOPE_ASYNC = 4,\n    SCOPE_GENERATOR = 8,\n    SCOPE_ARROW = 16,\n    SCOPE_SIMPLE_CATCH = 32,\n    SCOPE_SUPER = 64,\n    SCOPE_DIRECT_SUPER = 128,\n    SCOPE_CLASS_STATIC_BLOCK = 256,\n    SCOPE_VAR = SCOPE_TOP | SCOPE_FUNCTION | SCOPE_CLASS_STATIC_BLOCK;\n\nfunction functionFlags(async, generator) {\n  return SCOPE_FUNCTION | (async ? SCOPE_ASYNC : 0) | (generator ? SCOPE_GENERATOR : 0)\n}\n\n// Used in checkLVal* and declareName to determine the type of a binding\nvar\n    BIND_NONE = 0, // Not a binding\n    BIND_VAR = 1, // Var-style binding\n    BIND_LEXICAL = 2, // Let- or const-style binding\n    BIND_FUNCTION = 3, // Function declaration\n    BIND_SIMPLE_CATCH = 4, // Simple (identifier pattern) catch binding\n    BIND_OUTSIDE = 5; // Special case for function names as bound inside the function\n\nvar Parser = function Parser(options, input, startPos) {\n  this.options = options = getOptions(options);\n  this.sourceFile = options.sourceFile;\n  this.keywords = wordsRegexp(keywords$1[options.ecmaVersion >= 6 ? 6 : options.sourceType === \"module\" ? \"5module\" : 5]);\n  var reserved = \"\";\n  if (options.allowReserved !== true) {\n    reserved = reservedWords[options.ecmaVersion >= 6 ? 6 : options.ecmaVersion === 5 ? 5 : 3];\n    if (options.sourceType === \"module\") { reserved += \" await\"; }\n  }\n  this.reservedWords = wordsRegexp(reserved);\n  var reservedStrict = (reserved ? reserved + \" \" : \"\") + reservedWords.strict;\n  this.reservedWordsStrict = wordsRegexp(reservedStrict);\n  this.reservedWordsStrictBind = wordsRegexp(reservedStrict + \" \" + reservedWords.strictBind);\n  this.input = String(input);\n\n  // Used to signal to callers of `readWord1` whether the word\n  // contained any escape sequences. This is needed because words with\n  // escape sequences must not be interpreted as keywords.\n  this.containsEsc = false;\n\n  // Set up token state\n\n  // The current position of the tokenizer in the input.\n  if (startPos) {\n    this.pos = startPos;\n    this.lineStart = this.input.lastIndexOf(\"\\n\", startPos - 1) + 1;\n    this.curLine = this.input.slice(0, this.lineStart).split(lineBreak).length;\n  } else {\n    this.pos = this.lineStart = 0;\n    this.curLine = 1;\n  }\n\n  // Properties of the current token:\n  // Its type\n  this.type = types$1.eof;\n  // For tokens that include more information than their type, the value\n  this.value = null;\n  // Its start and end offset\n  this.start = this.end = this.pos;\n  // And, if locations are used, the {line, column} object\n  // corresponding to those offsets\n  this.startLoc = this.endLoc = this.curPosition();\n\n  // Position information for the previous token\n  this.lastTokEndLoc = this.lastTokStartLoc = null;\n  this.lastTokStart = this.lastTokEnd = this.pos;\n\n  // The context stack is used to superficially track syntactic\n  // context to predict whether a regular expression is allowed in a\n  // given position.\n  this.context = this.initialContext();\n  this.exprAllowed = true;\n\n  // Figure out if it's a module code.\n  this.inModule = options.sourceType === \"module\";\n  this.strict = this.inModule || this.strictDirective(this.pos);\n\n  // Used to signify the start of a potential arrow function\n  this.potentialArrowAt = -1;\n  this.potentialArrowInForAwait = false;\n\n  // Positions to delayed-check that yield/await does not exist in default parameters.\n  this.yieldPos = this.awaitPos = this.awaitIdentPos = 0;\n  // Labels in scope.\n  this.labels = [];\n  // Thus-far undefined exports.\n  this.undefinedExports = Object.create(null);\n\n  // If enabled, skip leading hashbang line.\n  if (this.pos === 0 && options.allowHashBang && this.input.slice(0, 2) === \"#!\")\n    { this.skipLineComment(2); }\n\n  // Scope tracking for duplicate variable names (see scope.js)\n  this.scopeStack = [];\n  this.enterScope(SCOPE_TOP);\n\n  // For RegExp validation\n  this.regexpState = null;\n\n  // The stack of private names.\n  // Each element has two properties: 'declared' and 'used'.\n  // When it exited from the outermost class definition, all used private names must be declared.\n  this.privateNameStack = [];\n};\n\nvar prototypeAccessors = { inFunction: { configurable: true },inGenerator: { configurable: true },inAsync: { configurable: true },canAwait: { configurable: true },allowSuper: { configurable: true },allowDirectSuper: { configurable: true },treatFunctionsAsVar: { configurable: true },allowNewDotTarget: { configurable: true },inClassStaticBlock: { configurable: true } };\n\nParser.prototype.parse = function parse () {\n  var node = this.options.program || this.startNode();\n  this.nextToken();\n  return this.parseTopLevel(node)\n};\n\nprototypeAccessors.inFunction.get = function () { return (this.currentVarScope().flags & SCOPE_FUNCTION) > 0 };\n\nprototypeAccessors.inGenerator.get = function () { return (this.currentVarScope().flags & SCOPE_GENERATOR) > 0 && !this.currentVarScope().inClassFieldInit };\n\nprototypeAccessors.inAsync.get = function () { return (this.currentVarScope().flags & SCOPE_ASYNC) > 0 && !this.currentVarScope().inClassFieldInit };\n\nprototypeAccessors.canAwait.get = function () {\n  for (var i = this.scopeStack.length - 1; i >= 0; i--) {\n    var scope = this.scopeStack[i];\n    if (scope.inClassFieldInit || scope.flags & SCOPE_CLASS_STATIC_BLOCK) { return false }\n    if (scope.flags & SCOPE_FUNCTION) { return (scope.flags & SCOPE_ASYNC) > 0 }\n  }\n  return (this.inModule && this.options.ecmaVersion >= 13) || this.options.allowAwaitOutsideFunction\n};\n\nprototypeAccessors.allowSuper.get = function () {\n  var ref = this.currentThisScope();\n    var flags = ref.flags;\n    var inClassFieldInit = ref.inClassFieldInit;\n  return (flags & SCOPE_SUPER) > 0 || inClassFieldInit || this.options.allowSuperOutsideMethod\n};\n\nprototypeAccessors.allowDirectSuper.get = function () { return (this.currentThisScope().flags & SCOPE_DIRECT_SUPER) > 0 };\n\nprototypeAccessors.treatFunctionsAsVar.get = function () { return this.treatFunctionsAsVarInScope(this.currentScope()) };\n\nprototypeAccessors.allowNewDotTarget.get = function () {\n  var ref = this.currentThisScope();\n    var flags = ref.flags;\n    var inClassFieldInit = ref.inClassFieldInit;\n  return (flags & (SCOPE_FUNCTION | SCOPE_CLASS_STATIC_BLOCK)) > 0 || inClassFieldInit\n};\n\nprototypeAccessors.inClassStaticBlock.get = function () {\n  return (this.currentVarScope().flags & SCOPE_CLASS_STATIC_BLOCK) > 0\n};\n\nParser.extend = function extend () {\n    var plugins = [], len = arguments.length;\n    while ( len-- ) plugins[ len ] = arguments[ len ];\n\n  var cls = this;\n  for (var i = 0; i < plugins.length; i++) { cls = plugins[i](cls); }\n  return cls\n};\n\nParser.parse = function parse (input, options) {\n  return new this(options, input).parse()\n};\n\nParser.parseExpressionAt = function parseExpressionAt (input, pos, options) {\n  var parser = new this(options, input, pos);\n  parser.nextToken();\n  return parser.parseExpression()\n};\n\nParser.tokenizer = function tokenizer (input, options) {\n  return new this(options, input)\n};\n\nObject.defineProperties( Parser.prototype, prototypeAccessors );\n\nvar pp$9 = Parser.prototype;\n\n// ## Parser utilities\n\nvar literal = /^(?:'((?:\\\\.|[^'\\\\])*?)'|\"((?:\\\\.|[^\"\\\\])*?)\")/;\npp$9.strictDirective = function(start) {\n  for (;;) {\n    // Try to find string literal.\n    skipWhiteSpace.lastIndex = start;\n    start += skipWhiteSpace.exec(this.input)[0].length;\n    var match = literal.exec(this.input.slice(start));\n    if (!match) { return false }\n    if ((match[1] || match[2]) === \"use strict\") {\n      skipWhiteSpace.lastIndex = start + match[0].length;\n      var spaceAfter = skipWhiteSpace.exec(this.input), end = spaceAfter.index + spaceAfter[0].length;\n      var next = this.input.charAt(end);\n      return next === \";\" || next === \"}\" ||\n        (lineBreak.test(spaceAfter[0]) &&\n         !(/[(`.[+\\-/*%<>=,?^&]/.test(next) || next === \"!\" && this.input.charAt(end + 1) === \"=\"))\n    }\n    start += match[0].length;\n\n    // Skip semicolon, if any.\n    skipWhiteSpace.lastIndex = start;\n    start += skipWhiteSpace.exec(this.input)[0].length;\n    if (this.input[start] === \";\")\n      { start++; }\n  }\n};\n\n// Predicate that tests whether the next token is of the given\n// type, and if yes, consumes it as a side effect.\n\npp$9.eat = function(type) {\n  if (this.type === type) {\n    this.next();\n    return true\n  } else {\n    return false\n  }\n};\n\n// Tests whether parsed token is a contextual keyword.\n\npp$9.isContextual = function(name) {\n  return this.type === types$1.name && this.value === name && !this.containsEsc\n};\n\n// Consumes contextual keyword if possible.\n\npp$9.eatContextual = function(name) {\n  if (!this.isContextual(name)) { return false }\n  this.next();\n  return true\n};\n\n// Asserts that following token is given contextual keyword.\n\npp$9.expectContextual = function(name) {\n  if (!this.eatContextual(name)) { this.unexpected(); }\n};\n\n// Test whether a semicolon can be inserted at the current position.\n\npp$9.canInsertSemicolon = function() {\n  return this.type === types$1.eof ||\n    this.type === types$1.braceR ||\n    lineBreak.test(this.input.slice(this.lastTokEnd, this.start))\n};\n\npp$9.insertSemicolon = function() {\n  if (this.canInsertSemicolon()) {\n    if (this.options.onInsertedSemicolon)\n      { this.options.onInsertedSemicolon(this.lastTokEnd, this.lastTokEndLoc); }\n    return true\n  }\n};\n\n// Consume a semicolon, or, failing that, see if we are allowed to\n// pretend that there is a semicolon at this position.\n\npp$9.semicolon = function() {\n  if (!this.eat(types$1.semi) && !this.insertSemicolon()) { this.unexpected(); }\n};\n\npp$9.afterTrailingComma = function(tokType, notNext) {\n  if (this.type === tokType) {\n    if (this.options.onTrailingComma)\n      { this.options.onTrailingComma(this.lastTokStart, this.lastTokStartLoc); }\n    if (!notNext)\n      { this.next(); }\n    return true\n  }\n};\n\n// Expect a token of a given type. If found, consume it, otherwise,\n// raise an unexpected token error.\n\npp$9.expect = function(type) {\n  this.eat(type) || this.unexpected();\n};\n\n// Raise an unexpected token error.\n\npp$9.unexpected = function(pos) {\n  this.raise(pos != null ? pos : this.start, \"Unexpected token\");\n};\n\nfunction DestructuringErrors() {\n  this.shorthandAssign =\n  this.trailingComma =\n  this.parenthesizedAssign =\n  this.parenthesizedBind =\n  this.doubleProto =\n    -1;\n}\n\npp$9.checkPatternErrors = function(refDestructuringErrors, isAssign) {\n  if (!refDestructuringErrors) { return }\n  if (refDestructuringErrors.trailingComma > -1)\n    { this.raiseRecoverable(refDestructuringErrors.trailingComma, \"Comma is not permitted after the rest element\"); }\n  var parens = isAssign ? refDestructuringErrors.parenthesizedAssign : refDestructuringErrors.parenthesizedBind;\n  if (parens > -1) { this.raiseRecoverable(parens, \"Parenthesized pattern\"); }\n};\n\npp$9.checkExpressionErrors = function(refDestructuringErrors, andThrow) {\n  if (!refDestructuringErrors) { return false }\n  var shorthandAssign = refDestructuringErrors.shorthandAssign;\n  var doubleProto = refDestructuringErrors.doubleProto;\n  if (!andThrow) { return shorthandAssign >= 0 || doubleProto >= 0 }\n  if (shorthandAssign >= 0)\n    { this.raise(shorthandAssign, \"Shorthand property assignments are valid only in destructuring patterns\"); }\n  if (doubleProto >= 0)\n    { this.raiseRecoverable(doubleProto, \"Redefinition of __proto__ property\"); }\n};\n\npp$9.checkYieldAwaitInDefaultParams = function() {\n  if (this.yieldPos && (!this.awaitPos || this.yieldPos < this.awaitPos))\n    { this.raise(this.yieldPos, \"Yield expression cannot be a default value\"); }\n  if (this.awaitPos)\n    { this.raise(this.awaitPos, \"Await expression cannot be a default value\"); }\n};\n\npp$9.isSimpleAssignTarget = function(expr) {\n  if (expr.type === \"ParenthesizedExpression\")\n    { return this.isSimpleAssignTarget(expr.expression) }\n  return expr.type === \"Identifier\" || expr.type === \"MemberExpression\"\n};\n\nvar pp$8 = Parser.prototype;\n\n// ### Statement parsing\n\n// Parse a program. Initializes the parser, reads any number of\n// statements, and wraps them in a Program node.  Optionally takes a\n// `program` argument.  If present, the statements will be appended\n// to its body instead of creating a new node.\n\npp$8.parseTopLevel = function(node) {\n  var exports = Object.create(null);\n  if (!node.body) { node.body = []; }\n  while (this.type !== types$1.eof) {\n    var stmt = this.parseStatement(null, true, exports);\n    node.body.push(stmt);\n  }\n  if (this.inModule)\n    { for (var i = 0, list = Object.keys(this.undefinedExports); i < list.length; i += 1)\n      {\n        var name = list[i];\n\n        this.raiseRecoverable(this.undefinedExports[name].start, (\"Export '\" + name + \"' is not defined\"));\n      } }\n  this.adaptDirectivePrologue(node.body);\n  this.next();\n  node.sourceType = this.options.sourceType;\n  return this.finishNode(node, \"Program\")\n};\n\nvar loopLabel = {kind: \"loop\"}, switchLabel = {kind: \"switch\"};\n\npp$8.isLet = function(context) {\n  if (this.options.ecmaVersion < 6 || !this.isContextual(\"let\")) { return false }\n  skipWhiteSpace.lastIndex = this.pos;\n  var skip = skipWhiteSpace.exec(this.input);\n  var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);\n  // For ambiguous cases, determine if a LexicalDeclaration (or only a\n  // Statement) is allowed here. If context is not empty then only a Statement\n  // is allowed. However, `let [` is an explicit negative lookahead for\n  // ExpressionStatement, so special-case it first.\n  if (nextCh === 91 || nextCh === 92 || nextCh > 0xd7ff && nextCh < 0xdc00) { return true } // '[', '/', astral\n  if (context) { return false }\n\n  if (nextCh === 123) { return true } // '{'\n  if (isIdentifierStart(nextCh, true)) {\n    var pos = next + 1;\n    while (isIdentifierChar(nextCh = this.input.charCodeAt(pos), true)) { ++pos; }\n    if (nextCh === 92 || nextCh > 0xd7ff && nextCh < 0xdc00) { return true }\n    var ident = this.input.slice(next, pos);\n    if (!keywordRelationalOperator.test(ident)) { return true }\n  }\n  return false\n};\n\n// check 'async [no LineTerminator here] function'\n// - 'async /*foo*/ function' is OK.\n// - 'async /*\\n*/ function' is invalid.\npp$8.isAsyncFunction = function() {\n  if (this.options.ecmaVersion < 8 || !this.isContextual(\"async\"))\n    { return false }\n\n  skipWhiteSpace.lastIndex = this.pos;\n  var skip = skipWhiteSpace.exec(this.input);\n  var next = this.pos + skip[0].length, after;\n  return !lineBreak.test(this.input.slice(this.pos, next)) &&\n    this.input.slice(next, next + 8) === \"function\" &&\n    (next + 8 === this.input.length ||\n     !(isIdentifierChar(after = this.input.charCodeAt(next + 8)) || after > 0xd7ff && after < 0xdc00))\n};\n\n// Parse a single statement.\n//\n// If expecting a statement and finding a slash operator, parse a\n// regular expression literal. This is to handle cases like\n// `if (foo) /blah/.exec(foo)`, where looking at the previous token\n// does not help.\n\npp$8.parseStatement = function(context, topLevel, exports) {\n  var starttype = this.type, node = this.startNode(), kind;\n\n  if (this.isLet(context)) {\n    starttype = types$1._var;\n    kind = \"let\";\n  }\n\n  // Most types of statements are recognized by the keyword they\n  // start with. Many are trivial to parse, some require a bit of\n  // complexity.\n\n  switch (starttype) {\n  case types$1._break: case types$1._continue: return this.parseBreakContinueStatement(node, starttype.keyword)\n  case types$1._debugger: return this.parseDebuggerStatement(node)\n  case types$1._do: return this.parseDoStatement(node)\n  case types$1._for: return this.parseForStatement(node)\n  case types$1._function:\n    // Function as sole body of either an if statement or a labeled statement\n    // works, but not when it is part of a labeled statement that is the sole\n    // body of an if statement.\n    if ((context && (this.strict || context !== \"if\" && context !== \"label\")) && this.options.ecmaVersion >= 6) { this.unexpected(); }\n    return this.parseFunctionStatement(node, false, !context)\n  case types$1._class:\n    if (context) { this.unexpected(); }\n    return this.parseClass(node, true)\n  case types$1._if: return this.parseIfStatement(node)\n  case types$1._return: return this.parseReturnStatement(node)\n  case types$1._switch: return this.parseSwitchStatement(node)\n  case types$1._throw: return this.parseThrowStatement(node)\n  case types$1._try: return this.parseTryStatement(node)\n  case types$1._const: case types$1._var:\n    kind = kind || this.value;\n    if (context && kind !== \"var\") { this.unexpected(); }\n    return this.parseVarStatement(node, kind)\n  case types$1._while: return this.parseWhileStatement(node)\n  case types$1._with: return this.parseWithStatement(node)\n  case types$1.braceL: return this.parseBlock(true, node)\n  case types$1.semi: return this.parseEmptyStatement(node)\n  case types$1._export:\n  case types$1._import:\n    if (this.options.ecmaVersion > 10 && starttype === types$1._import) {\n      skipWhiteSpace.lastIndex = this.pos;\n      var skip = skipWhiteSpace.exec(this.input);\n      var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);\n      if (nextCh === 40 || nextCh === 46) // '(' or '.'\n        { return this.parseExpressionStatement(node, this.parseExpression()) }\n    }\n\n    if (!this.options.allowImportExportEverywhere) {\n      if (!topLevel)\n        { this.raise(this.start, \"'import' and 'export' may only appear at the top level\"); }\n      if (!this.inModule)\n        { this.raise(this.start, \"'import' and 'export' may appear only with 'sourceType: module'\"); }\n    }\n    return starttype === types$1._import ? this.parseImport(node) : this.parseExport(node, exports)\n\n    // If the statement does not start with a statement keyword or a\n    // brace, it's an ExpressionStatement or LabeledStatement. We\n    // simply start parsing an expression, and afterwards, if the\n    // next token is a colon and the expression was a simple\n    // Identifier node, we switch to interpreting it as a label.\n  default:\n    if (this.isAsyncFunction()) {\n      if (context) { this.unexpected(); }\n      this.next();\n      return this.parseFunctionStatement(node, true, !context)\n    }\n\n    var maybeName = this.value, expr = this.parseExpression();\n    if (starttype === types$1.name && expr.type === \"Identifier\" && this.eat(types$1.colon))\n      { return this.parseLabeledStatement(node, maybeName, expr, context) }\n    else { return this.parseExpressionStatement(node, expr) }\n  }\n};\n\npp$8.parseBreakContinueStatement = function(node, keyword) {\n  var isBreak = keyword === \"break\";\n  this.next();\n  if (this.eat(types$1.semi) || this.insertSemicolon()) { node.label = null; }\n  else if (this.type !== types$1.name) { this.unexpected(); }\n  else {\n    node.label = this.parseIdent();\n    this.semicolon();\n  }\n\n  // Verify that there is an actual destination to break or\n  // continue to.\n  var i = 0;\n  for (; i < this.labels.length; ++i) {\n    var lab = this.labels[i];\n    if (node.label == null || lab.name === node.label.name) {\n      if (lab.kind != null && (isBreak || lab.kind === \"loop\")) { break }\n      if (node.label && isBreak) { break }\n    }\n  }\n  if (i === this.labels.length) { this.raise(node.start, \"Unsyntactic \" + keyword); }\n  return this.finishNode(node, isBreak ? \"BreakStatement\" : \"ContinueStatement\")\n};\n\npp$8.parseDebuggerStatement = function(node) {\n  this.next();\n  this.semicolon();\n  return this.finishNode(node, \"DebuggerStatement\")\n};\n\npp$8.parseDoStatement = function(node) {\n  this.next();\n  this.labels.push(loopLabel);\n  node.body = this.parseStatement(\"do\");\n  this.labels.pop();\n  this.expect(types$1._while);\n  node.test = this.parseParenExpression();\n  if (this.options.ecmaVersion >= 6)\n    { this.eat(types$1.semi); }\n  else\n    { this.semicolon(); }\n  return this.finishNode(node, \"DoWhileStatement\")\n};\n\n// Disambiguating between a `for` and a `for`/`in` or `for`/`of`\n// loop is non-trivial. Basically, we have to parse the init `var`\n// statement or expression, disallowing the `in` operator (see\n// the second parameter to `parseExpression`), and then check\n// whether the next token is `in` or `of`. When there is no init\n// part (semicolon immediately after the opening parenthesis), it\n// is a regular `for` loop.\n\npp$8.parseForStatement = function(node) {\n  this.next();\n  var awaitAt = (this.options.ecmaVersion >= 9 && this.canAwait && this.eatContextual(\"await\")) ? this.lastTokStart : -1;\n  this.labels.push(loopLabel);\n  this.enterScope(0);\n  this.expect(types$1.parenL);\n  if (this.type === types$1.semi) {\n    if (awaitAt > -1) { this.unexpected(awaitAt); }\n    return this.parseFor(node, null)\n  }\n  var isLet = this.isLet();\n  if (this.type === types$1._var || this.type === types$1._const || isLet) {\n    var init$1 = this.startNode(), kind = isLet ? \"let\" : this.value;\n    this.next();\n    this.parseVar(init$1, true, kind);\n    this.finishNode(init$1, \"VariableDeclaration\");\n    if ((this.type === types$1._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\"))) && init$1.declarations.length === 1) {\n      if (this.options.ecmaVersion >= 9) {\n        if (this.type === types$1._in) {\n          if (awaitAt > -1) { this.unexpected(awaitAt); }\n        } else { node.await = awaitAt > -1; }\n      }\n      return this.parseForIn(node, init$1)\n    }\n    if (awaitAt > -1) { this.unexpected(awaitAt); }\n    return this.parseFor(node, init$1)\n  }\n  var startsWithLet = this.isContextual(\"let\"), isForOf = false;\n  var refDestructuringErrors = new DestructuringErrors;\n  var init = this.parseExpression(awaitAt > -1 ? \"await\" : true, refDestructuringErrors);\n  if (this.type === types$1._in || (isForOf = this.options.ecmaVersion >= 6 && this.isContextual(\"of\"))) {\n    if (this.options.ecmaVersion >= 9) {\n      if (this.type === types$1._in) {\n        if (awaitAt > -1) { this.unexpected(awaitAt); }\n      } else { node.await = awaitAt > -1; }\n    }\n    if (startsWithLet && isForOf) { this.raise(init.start, \"The left-hand side of a for-of loop may not start with 'let'.\"); }\n    this.toAssignable(init, false, refDestructuringErrors);\n    this.checkLValPattern(init);\n    return this.parseForIn(node, init)\n  } else {\n    this.checkExpressionErrors(refDestructuringErrors, true);\n  }\n  if (awaitAt > -1) { this.unexpected(awaitAt); }\n  return this.parseFor(node, init)\n};\n\npp$8.parseFunctionStatement = function(node, isAsync, declarationPosition) {\n  this.next();\n  return this.parseFunction(node, FUNC_STATEMENT | (declarationPosition ? 0 : FUNC_HANGING_STATEMENT), false, isAsync)\n};\n\npp$8.parseIfStatement = function(node) {\n  this.next();\n  node.test = this.parseParenExpression();\n  // allow function declarations in branches, but only in non-strict mode\n  node.consequent = this.parseStatement(\"if\");\n  node.alternate = this.eat(types$1._else) ? this.parseStatement(\"if\") : null;\n  return this.finishNode(node, \"IfStatement\")\n};\n\npp$8.parseReturnStatement = function(node) {\n  if (!this.inFunction && !this.options.allowReturnOutsideFunction)\n    { this.raise(this.start, \"'return' outside of function\"); }\n  this.next();\n\n  // In `return` (and `break`/`continue`), the keywords with\n  // optional arguments, we eagerly look for a semicolon or the\n  // possibility to insert one.\n\n  if (this.eat(types$1.semi) || this.insertSemicolon()) { node.argument = null; }\n  else { node.argument = this.parseExpression(); this.semicolon(); }\n  return this.finishNode(node, \"ReturnStatement\")\n};\n\npp$8.parseSwitchStatement = function(node) {\n  this.next();\n  node.discriminant = this.parseParenExpression();\n  node.cases = [];\n  this.expect(types$1.braceL);\n  this.labels.push(switchLabel);\n  this.enterScope(0);\n\n  // Statements under must be grouped (by label) in SwitchCase\n  // nodes. `cur` is used to keep the node that we are currently\n  // adding statements to.\n\n  var cur;\n  for (var sawDefault = false; this.type !== types$1.braceR;) {\n    if (this.type === types$1._case || this.type === types$1._default) {\n      var isCase = this.type === types$1._case;\n      if (cur) { this.finishNode(cur, \"SwitchCase\"); }\n      node.cases.push(cur = this.startNode());\n      cur.consequent = [];\n      this.next();\n      if (isCase) {\n        cur.test = this.parseExpression();\n      } else {\n        if (sawDefault) { this.raiseRecoverable(this.lastTokStart, \"Multiple default clauses\"); }\n        sawDefault = true;\n        cur.test = null;\n      }\n      this.expect(types$1.colon);\n    } else {\n      if (!cur) { this.unexpected(); }\n      cur.consequent.push(this.parseStatement(null));\n    }\n  }\n  this.exitScope();\n  if (cur) { this.finishNode(cur, \"SwitchCase\"); }\n  this.next(); // Closing brace\n  this.labels.pop();\n  return this.finishNode(node, \"SwitchStatement\")\n};\n\npp$8.parseThrowStatement = function(node) {\n  this.next();\n  if (lineBreak.test(this.input.slice(this.lastTokEnd, this.start)))\n    { this.raise(this.lastTokEnd, \"Illegal newline after throw\"); }\n  node.argument = this.parseExpression();\n  this.semicolon();\n  return this.finishNode(node, \"ThrowStatement\")\n};\n\n// Reused empty array added for node fields that are always empty.\n\nvar empty$1 = [];\n\npp$8.parseTryStatement = function(node) {\n  this.next();\n  node.block = this.parseBlock();\n  node.handler = null;\n  if (this.type === types$1._catch) {\n    var clause = this.startNode();\n    this.next();\n    if (this.eat(types$1.parenL)) {\n      clause.param = this.parseBindingAtom();\n      var simple = clause.param.type === \"Identifier\";\n      this.enterScope(simple ? SCOPE_SIMPLE_CATCH : 0);\n      this.checkLValPattern(clause.param, simple ? BIND_SIMPLE_CATCH : BIND_LEXICAL);\n      this.expect(types$1.parenR);\n    } else {\n      if (this.options.ecmaVersion < 10) { this.unexpected(); }\n      clause.param = null;\n      this.enterScope(0);\n    }\n    clause.body = this.parseBlock(false);\n    this.exitScope();\n    node.handler = this.finishNode(clause, \"CatchClause\");\n  }\n  node.finalizer = this.eat(types$1._finally) ? this.parseBlock() : null;\n  if (!node.handler && !node.finalizer)\n    { this.raise(node.start, \"Missing catch or finally clause\"); }\n  return this.finishNode(node, \"TryStatement\")\n};\n\npp$8.parseVarStatement = function(node, kind) {\n  this.next();\n  this.parseVar(node, false, kind);\n  this.semicolon();\n  return this.finishNode(node, \"VariableDeclaration\")\n};\n\npp$8.parseWhileStatement = function(node) {\n  this.next();\n  node.test = this.parseParenExpression();\n  this.labels.push(loopLabel);\n  node.body = this.parseStatement(\"while\");\n  this.labels.pop();\n  return this.finishNode(node, \"WhileStatement\")\n};\n\npp$8.parseWithStatement = function(node) {\n  if (this.strict) { this.raise(this.start, \"'with' in strict mode\"); }\n  this.next();\n  node.object = this.parseParenExpression();\n  node.body = this.parseStatement(\"with\");\n  return this.finishNode(node, \"WithStatement\")\n};\n\npp$8.parseEmptyStatement = function(node) {\n  this.next();\n  return this.finishNode(node, \"EmptyStatement\")\n};\n\npp$8.parseLabeledStatement = function(node, maybeName, expr, context) {\n  for (var i$1 = 0, list = this.labels; i$1 < list.length; i$1 += 1)\n    {\n    var label = list[i$1];\n\n    if (label.name === maybeName)\n      { this.raise(expr.start, \"Label '\" + maybeName + \"' is already declared\");\n  } }\n  var kind = this.type.isLoop ? \"loop\" : this.type === types$1._switch ? \"switch\" : null;\n  for (var i = this.labels.length - 1; i >= 0; i--) {\n    var label$1 = this.labels[i];\n    if (label$1.statementStart === node.start) {\n      // Update information about previous labels on this node\n      label$1.statementStart = this.start;\n      label$1.kind = kind;\n    } else { break }\n  }\n  this.labels.push({name: maybeName, kind: kind, statementStart: this.start});\n  node.body = this.parseStatement(context ? context.indexOf(\"label\") === -1 ? context + \"label\" : context : \"label\");\n  this.labels.pop();\n  node.label = expr;\n  return this.finishNode(node, \"LabeledStatement\")\n};\n\npp$8.parseExpressionStatement = function(node, expr) {\n  node.expression = expr;\n  this.semicolon();\n  return this.finishNode(node, \"ExpressionStatement\")\n};\n\n// Parse a semicolon-enclosed block of statements, handling `\"use\n// strict\"` declarations when `allowStrict` is true (used for\n// function bodies).\n\npp$8.parseBlock = function(createNewLexicalScope, node, exitStrict) {\n  if ( createNewLexicalScope === void 0 ) createNewLexicalScope = true;\n  if ( node === void 0 ) node = this.startNode();\n\n  node.body = [];\n  this.expect(types$1.braceL);\n  if (createNewLexicalScope) { this.enterScope(0); }\n  while (this.type !== types$1.braceR) {\n    var stmt = this.parseStatement(null);\n    node.body.push(stmt);\n  }\n  if (exitStrict) { this.strict = false; }\n  this.next();\n  if (createNewLexicalScope) { this.exitScope(); }\n  return this.finishNode(node, \"BlockStatement\")\n};\n\n// Parse a regular `for` loop. The disambiguation code in\n// `parseStatement` will already have parsed the init statement or\n// expression.\n\npp$8.parseFor = function(node, init) {\n  node.init = init;\n  this.expect(types$1.semi);\n  node.test = this.type === types$1.semi ? null : this.parseExpression();\n  this.expect(types$1.semi);\n  node.update = this.type === types$1.parenR ? null : this.parseExpression();\n  this.expect(types$1.parenR);\n  node.body = this.parseStatement(\"for\");\n  this.exitScope();\n  this.labels.pop();\n  return this.finishNode(node, \"ForStatement\")\n};\n\n// Parse a `for`/`in` and `for`/`of` loop, which are almost\n// same from parser's perspective.\n\npp$8.parseForIn = function(node, init) {\n  var isForIn = this.type === types$1._in;\n  this.next();\n\n  if (\n    init.type === \"VariableDeclaration\" &&\n    init.declarations[0].init != null &&\n    (\n      !isForIn ||\n      this.options.ecmaVersion < 8 ||\n      this.strict ||\n      init.kind !== \"var\" ||\n      init.declarations[0].id.type !== \"Identifier\"\n    )\n  ) {\n    this.raise(\n      init.start,\n      ((isForIn ? \"for-in\" : \"for-of\") + \" loop variable declaration may not have an initializer\")\n    );\n  }\n  node.left = init;\n  node.right = isForIn ? this.parseExpression() : this.parseMaybeAssign();\n  this.expect(types$1.parenR);\n  node.body = this.parseStatement(\"for\");\n  this.exitScope();\n  this.labels.pop();\n  return this.finishNode(node, isForIn ? \"ForInStatement\" : \"ForOfStatement\")\n};\n\n// Parse a list of variable declarations.\n\npp$8.parseVar = function(node, isFor, kind) {\n  node.declarations = [];\n  node.kind = kind;\n  for (;;) {\n    var decl = this.startNode();\n    this.parseVarId(decl, kind);\n    if (this.eat(types$1.eq)) {\n      decl.init = this.parseMaybeAssign(isFor);\n    } else if (kind === \"const\" && !(this.type === types$1._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\")))) {\n      this.unexpected();\n    } else if (decl.id.type !== \"Identifier\" && !(isFor && (this.type === types$1._in || this.isContextual(\"of\")))) {\n      this.raise(this.lastTokEnd, \"Complex binding patterns require an initialization value\");\n    } else {\n      decl.init = null;\n    }\n    node.declarations.push(this.finishNode(decl, \"VariableDeclarator\"));\n    if (!this.eat(types$1.comma)) { break }\n  }\n  return node\n};\n\npp$8.parseVarId = function(decl, kind) {\n  decl.id = this.parseBindingAtom();\n  this.checkLValPattern(decl.id, kind === \"var\" ? BIND_VAR : BIND_LEXICAL, false);\n};\n\nvar FUNC_STATEMENT = 1, FUNC_HANGING_STATEMENT = 2, FUNC_NULLABLE_ID = 4;\n\n// Parse a function declaration or literal (depending on the\n// `statement & FUNC_STATEMENT`).\n\n// Remove `allowExpressionBody` for 7.0.0, as it is only called with false\npp$8.parseFunction = function(node, statement, allowExpressionBody, isAsync, forInit) {\n  this.initFunction(node);\n  if (this.options.ecmaVersion >= 9 || this.options.ecmaVersion >= 6 && !isAsync) {\n    if (this.type === types$1.star && (statement & FUNC_HANGING_STATEMENT))\n      { this.unexpected(); }\n    node.generator = this.eat(types$1.star);\n  }\n  if (this.options.ecmaVersion >= 8)\n    { node.async = !!isAsync; }\n\n  if (statement & FUNC_STATEMENT) {\n    node.id = (statement & FUNC_NULLABLE_ID) && this.type !== types$1.name ? null : this.parseIdent();\n    if (node.id && !(statement & FUNC_HANGING_STATEMENT))\n      // If it is a regular function declaration in sloppy mode, then it is\n      // subject to Annex B semantics (BIND_FUNCTION). Otherwise, the binding\n      // mode depends on properties of the current scope (see\n      // treatFunctionsAsVar).\n      { this.checkLValSimple(node.id, (this.strict || node.generator || node.async) ? this.treatFunctionsAsVar ? BIND_VAR : BIND_LEXICAL : BIND_FUNCTION); }\n  }\n\n  var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n  this.yieldPos = 0;\n  this.awaitPos = 0;\n  this.awaitIdentPos = 0;\n  this.enterScope(functionFlags(node.async, node.generator));\n\n  if (!(statement & FUNC_STATEMENT))\n    { node.id = this.type === types$1.name ? this.parseIdent() : null; }\n\n  this.parseFunctionParams(node);\n  this.parseFunctionBody(node, allowExpressionBody, false, forInit);\n\n  this.yieldPos = oldYieldPos;\n  this.awaitPos = oldAwaitPos;\n  this.awaitIdentPos = oldAwaitIdentPos;\n  return this.finishNode(node, (statement & FUNC_STATEMENT) ? \"FunctionDeclaration\" : \"FunctionExpression\")\n};\n\npp$8.parseFunctionParams = function(node) {\n  this.expect(types$1.parenL);\n  node.params = this.parseBindingList(types$1.parenR, false, this.options.ecmaVersion >= 8);\n  this.checkYieldAwaitInDefaultParams();\n};\n\n// Parse a class declaration or literal (depending on the\n// `isStatement` parameter).\n\npp$8.parseClass = function(node, isStatement) {\n  this.next();\n\n  // ecma-262 14.6 Class Definitions\n  // A class definition is always strict mode code.\n  var oldStrict = this.strict;\n  this.strict = true;\n\n  this.parseClassId(node, isStatement);\n  this.parseClassSuper(node);\n  var privateNameMap = this.enterClassBody();\n  var classBody = this.startNode();\n  var hadConstructor = false;\n  classBody.body = [];\n  this.expect(types$1.braceL);\n  while (this.type !== types$1.braceR) {\n    var element = this.parseClassElement(node.superClass !== null);\n    if (element) {\n      classBody.body.push(element);\n      if (element.type === \"MethodDefinition\" && element.kind === \"constructor\") {\n        if (hadConstructor) { this.raise(element.start, \"Duplicate constructor in the same class\"); }\n        hadConstructor = true;\n      } else if (element.key && element.key.type === \"PrivateIdentifier\" && isPrivateNameConflicted(privateNameMap, element)) {\n        this.raiseRecoverable(element.key.start, (\"Identifier '#\" + (element.key.name) + \"' has already been declared\"));\n      }\n    }\n  }\n  this.strict = oldStrict;\n  this.next();\n  node.body = this.finishNode(classBody, \"ClassBody\");\n  this.exitClassBody();\n  return this.finishNode(node, isStatement ? \"ClassDeclaration\" : \"ClassExpression\")\n};\n\npp$8.parseClassElement = function(constructorAllowsSuper) {\n  if (this.eat(types$1.semi)) { return null }\n\n  var ecmaVersion = this.options.ecmaVersion;\n  var node = this.startNode();\n  var keyName = \"\";\n  var isGenerator = false;\n  var isAsync = false;\n  var kind = \"method\";\n  var isStatic = false;\n\n  if (this.eatContextual(\"static\")) {\n    // Parse static init block\n    if (ecmaVersion >= 13 && this.eat(types$1.braceL)) {\n      this.parseClassStaticBlock(node);\n      return node\n    }\n    if (this.isClassElementNameStart() || this.type === types$1.star) {\n      isStatic = true;\n    } else {\n      keyName = \"static\";\n    }\n  }\n  node.static = isStatic;\n  if (!keyName && ecmaVersion >= 8 && this.eatContextual(\"async\")) {\n    if ((this.isClassElementNameStart() || this.type === types$1.star) && !this.canInsertSemicolon()) {\n      isAsync = true;\n    } else {\n      keyName = \"async\";\n    }\n  }\n  if (!keyName && (ecmaVersion >= 9 || !isAsync) && this.eat(types$1.star)) {\n    isGenerator = true;\n  }\n  if (!keyName && !isAsync && !isGenerator) {\n    var lastValue = this.value;\n    if (this.eatContextual(\"get\") || this.eatContextual(\"set\")) {\n      if (this.isClassElementNameStart()) {\n        kind = lastValue;\n      } else {\n        keyName = lastValue;\n      }\n    }\n  }\n\n  // Parse element name\n  if (keyName) {\n    // 'async', 'get', 'set', or 'static' were not a keyword contextually.\n    // The last token is any of those. Make it the element name.\n    node.computed = false;\n    node.key = this.startNodeAt(this.lastTokStart, this.lastTokStartLoc);\n    node.key.name = keyName;\n    this.finishNode(node.key, \"Identifier\");\n  } else {\n    this.parseClassElementName(node);\n  }\n\n  // Parse element value\n  if (ecmaVersion < 13 || this.type === types$1.parenL || kind !== \"method\" || isGenerator || isAsync) {\n    var isConstructor = !node.static && checkKeyName(node, \"constructor\");\n    var allowsDirectSuper = isConstructor && constructorAllowsSuper;\n    // Couldn't move this check into the 'parseClassMethod' method for backward compatibility.\n    if (isConstructor && kind !== \"method\") { this.raise(node.key.start, \"Constructor can't have get/set modifier\"); }\n    node.kind = isConstructor ? \"constructor\" : kind;\n    this.parseClassMethod(node, isGenerator, isAsync, allowsDirectSuper);\n  } else {\n    this.parseClassField(node);\n  }\n\n  return node\n};\n\npp$8.isClassElementNameStart = function() {\n  return (\n    this.type === types$1.name ||\n    this.type === types$1.privateId ||\n    this.type === types$1.num ||\n    this.type === types$1.string ||\n    this.type === types$1.bracketL ||\n    this.type.keyword\n  )\n};\n\npp$8.parseClassElementName = function(element) {\n  if (this.type === types$1.privateId) {\n    if (this.value === \"constructor\") {\n      this.raise(this.start, \"Classes can't have an element named '#constructor'\");\n    }\n    element.computed = false;\n    element.key = this.parsePrivateIdent();\n  } else {\n    this.parsePropertyName(element);\n  }\n};\n\npp$8.parseClassMethod = function(method, isGenerator, isAsync, allowsDirectSuper) {\n  // Check key and flags\n  var key = method.key;\n  if (method.kind === \"constructor\") {\n    if (isGenerator) { this.raise(key.start, \"Constructor can't be a generator\"); }\n    if (isAsync) { this.raise(key.start, \"Constructor can't be an async method\"); }\n  } else if (method.static && checkKeyName(method, \"prototype\")) {\n    this.raise(key.start, \"Classes may not have a static property named prototype\");\n  }\n\n  // Parse value\n  var value = method.value = this.parseMethod(isGenerator, isAsync, allowsDirectSuper);\n\n  // Check value\n  if (method.kind === \"get\" && value.params.length !== 0)\n    { this.raiseRecoverable(value.start, \"getter should have no params\"); }\n  if (method.kind === \"set\" && value.params.length !== 1)\n    { this.raiseRecoverable(value.start, \"setter should have exactly one param\"); }\n  if (method.kind === \"set\" && value.params[0].type === \"RestElement\")\n    { this.raiseRecoverable(value.params[0].start, \"Setter cannot use rest params\"); }\n\n  return this.finishNode(method, \"MethodDefinition\")\n};\n\npp$8.parseClassField = function(field) {\n  if (checkKeyName(field, \"constructor\")) {\n    this.raise(field.key.start, \"Classes can't have a field named 'constructor'\");\n  } else if (field.static && checkKeyName(field, \"prototype\")) {\n    this.raise(field.key.start, \"Classes can't have a static field named 'prototype'\");\n  }\n\n  if (this.eat(types$1.eq)) {\n    // To raise SyntaxError if 'arguments' exists in the initializer.\n    var scope = this.currentThisScope();\n    var inClassFieldInit = scope.inClassFieldInit;\n    scope.inClassFieldInit = true;\n    field.value = this.parseMaybeAssign();\n    scope.inClassFieldInit = inClassFieldInit;\n  } else {\n    field.value = null;\n  }\n  this.semicolon();\n\n  return this.finishNode(field, \"PropertyDefinition\")\n};\n\npp$8.parseClassStaticBlock = function(node) {\n  node.body = [];\n\n  var oldLabels = this.labels;\n  this.labels = [];\n  this.enterScope(SCOPE_CLASS_STATIC_BLOCK | SCOPE_SUPER);\n  while (this.type !== types$1.braceR) {\n    var stmt = this.parseStatement(null);\n    node.body.push(stmt);\n  }\n  this.next();\n  this.exitScope();\n  this.labels = oldLabels;\n\n  return this.finishNode(node, \"StaticBlock\")\n};\n\npp$8.parseClassId = function(node, isStatement) {\n  if (this.type === types$1.name) {\n    node.id = this.parseIdent();\n    if (isStatement)\n      { this.checkLValSimple(node.id, BIND_LEXICAL, false); }\n  } else {\n    if (isStatement === true)\n      { this.unexpected(); }\n    node.id = null;\n  }\n};\n\npp$8.parseClassSuper = function(node) {\n  node.superClass = this.eat(types$1._extends) ? this.parseExprSubscripts(false) : null;\n};\n\npp$8.enterClassBody = function() {\n  var element = {declared: Object.create(null), used: []};\n  this.privateNameStack.push(element);\n  return element.declared\n};\n\npp$8.exitClassBody = function() {\n  var ref = this.privateNameStack.pop();\n  var declared = ref.declared;\n  var used = ref.used;\n  var len = this.privateNameStack.length;\n  var parent = len === 0 ? null : this.privateNameStack[len - 1];\n  for (var i = 0; i < used.length; ++i) {\n    var id = used[i];\n    if (!hasOwn(declared, id.name)) {\n      if (parent) {\n        parent.used.push(id);\n      } else {\n        this.raiseRecoverable(id.start, (\"Private field '#\" + (id.name) + \"' must be declared in an enclosing class\"));\n      }\n    }\n  }\n};\n\nfunction isPrivateNameConflicted(privateNameMap, element) {\n  var name = element.key.name;\n  var curr = privateNameMap[name];\n\n  var next = \"true\";\n  if (element.type === \"MethodDefinition\" && (element.kind === \"get\" || element.kind === \"set\")) {\n    next = (element.static ? \"s\" : \"i\") + element.kind;\n  }\n\n  // `class { get #a(){}; static set #a(_){} }` is also conflict.\n  if (\n    curr === \"iget\" && next === \"iset\" ||\n    curr === \"iset\" && next === \"iget\" ||\n    curr === \"sget\" && next === \"sset\" ||\n    curr === \"sset\" && next === \"sget\"\n  ) {\n    privateNameMap[name] = \"true\";\n    return false\n  } else if (!curr) {\n    privateNameMap[name] = next;\n    return false\n  } else {\n    return true\n  }\n}\n\nfunction checkKeyName(node, name) {\n  var computed = node.computed;\n  var key = node.key;\n  return !computed && (\n    key.type === \"Identifier\" && key.name === name ||\n    key.type === \"Literal\" && key.value === name\n  )\n}\n\n// Parses module export declaration.\n\npp$8.parseExport = function(node, exports) {\n  this.next();\n  // export * from '...'\n  if (this.eat(types$1.star)) {\n    if (this.options.ecmaVersion >= 11) {\n      if (this.eatContextual(\"as\")) {\n        node.exported = this.parseModuleExportName();\n        this.checkExport(exports, node.exported.name, this.lastTokStart);\n      } else {\n        node.exported = null;\n      }\n    }\n    this.expectContextual(\"from\");\n    if (this.type !== types$1.string) { this.unexpected(); }\n    node.source = this.parseExprAtom();\n    this.semicolon();\n    return this.finishNode(node, \"ExportAllDeclaration\")\n  }\n  if (this.eat(types$1._default)) { // export default ...\n    this.checkExport(exports, \"default\", this.lastTokStart);\n    var isAsync;\n    if (this.type === types$1._function || (isAsync = this.isAsyncFunction())) {\n      var fNode = this.startNode();\n      this.next();\n      if (isAsync) { this.next(); }\n      node.declaration = this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync);\n    } else if (this.type === types$1._class) {\n      var cNode = this.startNode();\n      node.declaration = this.parseClass(cNode, \"nullableID\");\n    } else {\n      node.declaration = this.parseMaybeAssign();\n      this.semicolon();\n    }\n    return this.finishNode(node, \"ExportDefaultDeclaration\")\n  }\n  // export var|const|let|function|class ...\n  if (this.shouldParseExportStatement()) {\n    node.declaration = this.parseStatement(null);\n    if (node.declaration.type === \"VariableDeclaration\")\n      { this.checkVariableExport(exports, node.declaration.declarations); }\n    else\n      { this.checkExport(exports, node.declaration.id.name, node.declaration.id.start); }\n    node.specifiers = [];\n    node.source = null;\n  } else { // export { x, y as z } [from '...']\n    node.declaration = null;\n    node.specifiers = this.parseExportSpecifiers(exports);\n    if (this.eatContextual(\"from\")) {\n      if (this.type !== types$1.string) { this.unexpected(); }\n      node.source = this.parseExprAtom();\n    } else {\n      for (var i = 0, list = node.specifiers; i < list.length; i += 1) {\n        // check for keywords used as local names\n        var spec = list[i];\n\n        this.checkUnreserved(spec.local);\n        // check if export is defined\n        this.checkLocalExport(spec.local);\n\n        if (spec.local.type === \"Literal\") {\n          this.raise(spec.local.start, \"A string literal cannot be used as an exported binding without `from`.\");\n        }\n      }\n\n      node.source = null;\n    }\n    this.semicolon();\n  }\n  return this.finishNode(node, \"ExportNamedDeclaration\")\n};\n\npp$8.checkExport = function(exports, name, pos) {\n  if (!exports) { return }\n  if (hasOwn(exports, name))\n    { this.raiseRecoverable(pos, \"Duplicate export '\" + name + \"'\"); }\n  exports[name] = true;\n};\n\npp$8.checkPatternExport = function(exports, pat) {\n  var type = pat.type;\n  if (type === \"Identifier\")\n    { this.checkExport(exports, pat.name, pat.start); }\n  else if (type === \"ObjectPattern\")\n    { for (var i = 0, list = pat.properties; i < list.length; i += 1)\n      {\n        var prop = list[i];\n\n        this.checkPatternExport(exports, prop);\n      } }\n  else if (type === \"ArrayPattern\")\n    { for (var i$1 = 0, list$1 = pat.elements; i$1 < list$1.length; i$1 += 1) {\n      var elt = list$1[i$1];\n\n        if (elt) { this.checkPatternExport(exports, elt); }\n    } }\n  else if (type === \"Property\")\n    { this.checkPatternExport(exports, pat.value); }\n  else if (type === \"AssignmentPattern\")\n    { this.checkPatternExport(exports, pat.left); }\n  else if (type === \"RestElement\")\n    { this.checkPatternExport(exports, pat.argument); }\n  else if (type === \"ParenthesizedExpression\")\n    { this.checkPatternExport(exports, pat.expression); }\n};\n\npp$8.checkVariableExport = function(exports, decls) {\n  if (!exports) { return }\n  for (var i = 0, list = decls; i < list.length; i += 1)\n    {\n    var decl = list[i];\n\n    this.checkPatternExport(exports, decl.id);\n  }\n};\n\npp$8.shouldParseExportStatement = function() {\n  return this.type.keyword === \"var\" ||\n    this.type.keyword === \"const\" ||\n    this.type.keyword === \"class\" ||\n    this.type.keyword === \"function\" ||\n    this.isLet() ||\n    this.isAsyncFunction()\n};\n\n// Parses a comma-separated list of module exports.\n\npp$8.parseExportSpecifiers = function(exports) {\n  var nodes = [], first = true;\n  // export { x, y as z } [from '...']\n  this.expect(types$1.braceL);\n  while (!this.eat(types$1.braceR)) {\n    if (!first) {\n      this.expect(types$1.comma);\n      if (this.afterTrailingComma(types$1.braceR)) { break }\n    } else { first = false; }\n\n    var node = this.startNode();\n    node.local = this.parseModuleExportName();\n    node.exported = this.eatContextual(\"as\") ? this.parseModuleExportName() : node.local;\n    this.checkExport(\n      exports,\n      node.exported[node.exported.type === \"Identifier\" ? \"name\" : \"value\"],\n      node.exported.start\n    );\n    nodes.push(this.finishNode(node, \"ExportSpecifier\"));\n  }\n  return nodes\n};\n\n// Parses import declaration.\n\npp$8.parseImport = function(node) {\n  this.next();\n  // import '...'\n  if (this.type === types$1.string) {\n    node.specifiers = empty$1;\n    node.source = this.parseExprAtom();\n  } else {\n    node.specifiers = this.parseImportSpecifiers();\n    this.expectContextual(\"from\");\n    node.source = this.type === types$1.string ? this.parseExprAtom() : this.unexpected();\n  }\n  this.semicolon();\n  return this.finishNode(node, \"ImportDeclaration\")\n};\n\n// Parses a comma-separated list of module imports.\n\npp$8.parseImportSpecifiers = function() {\n  var nodes = [], first = true;\n  if (this.type === types$1.name) {\n    // import defaultObj, { x, y as z } from '...'\n    var node = this.startNode();\n    node.local = this.parseIdent();\n    this.checkLValSimple(node.local, BIND_LEXICAL);\n    nodes.push(this.finishNode(node, \"ImportDefaultSpecifier\"));\n    if (!this.eat(types$1.comma)) { return nodes }\n  }\n  if (this.type === types$1.star) {\n    var node$1 = this.startNode();\n    this.next();\n    this.expectContextual(\"as\");\n    node$1.local = this.parseIdent();\n    this.checkLValSimple(node$1.local, BIND_LEXICAL);\n    nodes.push(this.finishNode(node$1, \"ImportNamespaceSpecifier\"));\n    return nodes\n  }\n  this.expect(types$1.braceL);\n  while (!this.eat(types$1.braceR)) {\n    if (!first) {\n      this.expect(types$1.comma);\n      if (this.afterTrailingComma(types$1.braceR)) { break }\n    } else { first = false; }\n\n    var node$2 = this.startNode();\n    node$2.imported = this.parseModuleExportName();\n    if (this.eatContextual(\"as\")) {\n      node$2.local = this.parseIdent();\n    } else {\n      this.checkUnreserved(node$2.imported);\n      node$2.local = node$2.imported;\n    }\n    this.checkLValSimple(node$2.local, BIND_LEXICAL);\n    nodes.push(this.finishNode(node$2, \"ImportSpecifier\"));\n  }\n  return nodes\n};\n\npp$8.parseModuleExportName = function() {\n  if (this.options.ecmaVersion >= 13 && this.type === types$1.string) {\n    var stringLiteral = this.parseLiteral(this.value);\n    if (loneSurrogate.test(stringLiteral.value)) {\n      this.raise(stringLiteral.start, \"An export name cannot include a lone surrogate.\");\n    }\n    return stringLiteral\n  }\n  return this.parseIdent(true)\n};\n\n// Set `ExpressionStatement#directive` property for directive prologues.\npp$8.adaptDirectivePrologue = function(statements) {\n  for (var i = 0; i < statements.length && this.isDirectiveCandidate(statements[i]); ++i) {\n    statements[i].directive = statements[i].expression.raw.slice(1, -1);\n  }\n};\npp$8.isDirectiveCandidate = function(statement) {\n  return (\n    statement.type === \"ExpressionStatement\" &&\n    statement.expression.type === \"Literal\" &&\n    typeof statement.expression.value === \"string\" &&\n    // Reject parenthesized strings.\n    (this.input[statement.start] === \"\\\"\" || this.input[statement.start] === \"'\")\n  )\n};\n\nvar pp$7 = Parser.prototype;\n\n// Convert existing expression atom to assignable pattern\n// if possible.\n\npp$7.toAssignable = function(node, isBinding, refDestructuringErrors) {\n  if (this.options.ecmaVersion >= 6 && node) {\n    switch (node.type) {\n    case \"Identifier\":\n      if (this.inAsync && node.name === \"await\")\n        { this.raise(node.start, \"Cannot use 'await' as identifier inside an async function\"); }\n      break\n\n    case \"ObjectPattern\":\n    case \"ArrayPattern\":\n    case \"AssignmentPattern\":\n    case \"RestElement\":\n      break\n\n    case \"ObjectExpression\":\n      node.type = \"ObjectPattern\";\n      if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }\n      for (var i = 0, list = node.properties; i < list.length; i += 1) {\n        var prop = list[i];\n\n      this.toAssignable(prop, isBinding);\n        // Early error:\n        //   AssignmentRestProperty[Yield, Await] :\n        //     `...` DestructuringAssignmentTarget[Yield, Await]\n        //\n        //   It is a Syntax Error if |DestructuringAssignmentTarget| is an |ArrayLiteral| or an |ObjectLiteral|.\n        if (\n          prop.type === \"RestElement\" &&\n          (prop.argument.type === \"ArrayPattern\" || prop.argument.type === \"ObjectPattern\")\n        ) {\n          this.raise(prop.argument.start, \"Unexpected token\");\n        }\n      }\n      break\n\n    case \"Property\":\n      // AssignmentProperty has type === \"Property\"\n      if (node.kind !== \"init\") { this.raise(node.key.start, \"Object pattern can't contain getter or setter\"); }\n      this.toAssignable(node.value, isBinding);\n      break\n\n    case \"ArrayExpression\":\n      node.type = \"ArrayPattern\";\n      if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }\n      this.toAssignableList(node.elements, isBinding);\n      break\n\n    case \"SpreadElement\":\n      node.type = \"RestElement\";\n      this.toAssignable(node.argument, isBinding);\n      if (node.argument.type === \"AssignmentPattern\")\n        { this.raise(node.argument.start, \"Rest elements cannot have a default value\"); }\n      break\n\n    case \"AssignmentExpression\":\n      if (node.operator !== \"=\") { this.raise(node.left.end, \"Only '=' operator can be used for specifying default value.\"); }\n      node.type = \"AssignmentPattern\";\n      delete node.operator;\n      this.toAssignable(node.left, isBinding);\n      break\n\n    case \"ParenthesizedExpression\":\n      this.toAssignable(node.expression, isBinding, refDestructuringErrors);\n      break\n\n    case \"ChainExpression\":\n      this.raiseRecoverable(node.start, \"Optional chaining cannot appear in left-hand side\");\n      break\n\n    case \"MemberExpression\":\n      if (!isBinding) { break }\n\n    default:\n      this.raise(node.start, \"Assigning to rvalue\");\n    }\n  } else if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }\n  return node\n};\n\n// Convert list of expression atoms to binding list.\n\npp$7.toAssignableList = function(exprList, isBinding) {\n  var end = exprList.length;\n  for (var i = 0; i < end; i++) {\n    var elt = exprList[i];\n    if (elt) { this.toAssignable(elt, isBinding); }\n  }\n  if (end) {\n    var last = exprList[end - 1];\n    if (this.options.ecmaVersion === 6 && isBinding && last && last.type === \"RestElement\" && last.argument.type !== \"Identifier\")\n      { this.unexpected(last.argument.start); }\n  }\n  return exprList\n};\n\n// Parses spread element.\n\npp$7.parseSpread = function(refDestructuringErrors) {\n  var node = this.startNode();\n  this.next();\n  node.argument = this.parseMaybeAssign(false, refDestructuringErrors);\n  return this.finishNode(node, \"SpreadElement\")\n};\n\npp$7.parseRestBinding = function() {\n  var node = this.startNode();\n  this.next();\n\n  // RestElement inside of a function parameter must be an identifier\n  if (this.options.ecmaVersion === 6 && this.type !== types$1.name)\n    { this.unexpected(); }\n\n  node.argument = this.parseBindingAtom();\n\n  return this.finishNode(node, \"RestElement\")\n};\n\n// Parses lvalue (assignable) atom.\n\npp$7.parseBindingAtom = function() {\n  if (this.options.ecmaVersion >= 6) {\n    switch (this.type) {\n    case types$1.bracketL:\n      var node = this.startNode();\n      this.next();\n      node.elements = this.parseBindingList(types$1.bracketR, true, true);\n      return this.finishNode(node, \"ArrayPattern\")\n\n    case types$1.braceL:\n      return this.parseObj(true)\n    }\n  }\n  return this.parseIdent()\n};\n\npp$7.parseBindingList = function(close, allowEmpty, allowTrailingComma) {\n  var elts = [], first = true;\n  while (!this.eat(close)) {\n    if (first) { first = false; }\n    else { this.expect(types$1.comma); }\n    if (allowEmpty && this.type === types$1.comma) {\n      elts.push(null);\n    } else if (allowTrailingComma && this.afterTrailingComma(close)) {\n      break\n    } else if (this.type === types$1.ellipsis) {\n      var rest = this.parseRestBinding();\n      this.parseBindingListItem(rest);\n      elts.push(rest);\n      if (this.type === types$1.comma) { this.raise(this.start, \"Comma is not permitted after the rest element\"); }\n      this.expect(close);\n      break\n    } else {\n      var elem = this.parseMaybeDefault(this.start, this.startLoc);\n      this.parseBindingListItem(elem);\n      elts.push(elem);\n    }\n  }\n  return elts\n};\n\npp$7.parseBindingListItem = function(param) {\n  return param\n};\n\n// Parses assignment pattern around given atom if possible.\n\npp$7.parseMaybeDefault = function(startPos, startLoc, left) {\n  left = left || this.parseBindingAtom();\n  if (this.options.ecmaVersion < 6 || !this.eat(types$1.eq)) { return left }\n  var node = this.startNodeAt(startPos, startLoc);\n  node.left = left;\n  node.right = this.parseMaybeAssign();\n  return this.finishNode(node, \"AssignmentPattern\")\n};\n\n// The following three functions all verify that a node is an lvalue \u2014\n// something that can be bound, or assigned to. In order to do so, they perform\n// a variety of checks:\n//\n// - Check that none of the bound/assigned-to identifiers are reserved words.\n// - Record name declarations for bindings in the appropriate scope.\n// - Check duplicate argument names, if checkClashes is set.\n//\n// If a complex binding pattern is encountered (e.g., object and array\n// destructuring), the entire pattern is recursively checked.\n//\n// There are three versions of checkLVal*() appropriate for different\n// circumstances:\n//\n// - checkLValSimple() shall be used if the syntactic construct supports\n//   nothing other than identifiers and member expressions. Parenthesized\n//   expressions are also correctly handled. This is generally appropriate for\n//   constructs for which the spec says\n//\n//   > It is a Syntax Error if AssignmentTargetType of [the production] is not\n//   > simple.\n//\n//   It is also appropriate for checking if an identifier is valid and not\n//   defined elsewhere, like import declarations or function/class identifiers.\n//\n//   Examples where this is used include:\n//     a += \u2026;\n//     import a from '\u2026';\n//   where a is the node to be checked.\n//\n// - checkLValPattern() shall be used if the syntactic construct supports\n//   anything checkLValSimple() supports, as well as object and array\n//   destructuring patterns. This is generally appropriate for constructs for\n//   which the spec says\n//\n//   > It is a Syntax Error if [the production] is neither an ObjectLiteral nor\n//   > an ArrayLiteral and AssignmentTargetType of [the production] is not\n//   > simple.\n//\n//   Examples where this is used include:\n//     (a = \u2026);\n//     const a = \u2026;\n//     try { \u2026 } catch (a) { \u2026 }\n//   where a is the node to be checked.\n//\n// - checkLValInnerPattern() shall be used if the syntactic construct supports\n//   anything checkLValPattern() supports, as well as default assignment\n//   patterns, rest elements, and other constructs that may appear within an\n//   object or array destructuring pattern.\n//\n//   As a special case, function parameters also use checkLValInnerPattern(),\n//   as they also support defaults and rest constructs.\n//\n// These functions deliberately support both assignment and binding constructs,\n// as the logic for both is exceedingly similar. If the node is the target of\n// an assignment, then bindingType should be set to BIND_NONE. Otherwise, it\n// should be set to the appropriate BIND_* constant, like BIND_VAR or\n// BIND_LEXICAL.\n//\n// If the function is called with a non-BIND_NONE bindingType, then\n// additionally a checkClashes object may be specified to allow checking for\n// duplicate argument names. checkClashes is ignored if the provided construct\n// is an assignment (i.e., bindingType is BIND_NONE).\n\npp$7.checkLValSimple = function(expr, bindingType, checkClashes) {\n  if ( bindingType === void 0 ) bindingType = BIND_NONE;\n\n  var isBind = bindingType !== BIND_NONE;\n\n  switch (expr.type) {\n  case \"Identifier\":\n    if (this.strict && this.reservedWordsStrictBind.test(expr.name))\n      { this.raiseRecoverable(expr.start, (isBind ? \"Binding \" : \"Assigning to \") + expr.name + \" in strict mode\"); }\n    if (isBind) {\n      if (bindingType === BIND_LEXICAL && expr.name === \"let\")\n        { this.raiseRecoverable(expr.start, \"let is disallowed as a lexically bound name\"); }\n      if (checkClashes) {\n        if (hasOwn(checkClashes, expr.name))\n          { this.raiseRecoverable(expr.start, \"Argument name clash\"); }\n        checkClashes[expr.name] = true;\n      }\n      if (bindingType !== BIND_OUTSIDE) { this.declareName(expr.name, bindingType, expr.start); }\n    }\n    break\n\n  case \"ChainExpression\":\n    this.raiseRecoverable(expr.start, \"Optional chaining cannot appear in left-hand side\");\n    break\n\n  case \"MemberExpression\":\n    if (isBind) { this.raiseRecoverable(expr.start, \"Binding member expression\"); }\n    break\n\n  case \"ParenthesizedExpression\":\n    if (isBind) { this.raiseRecoverable(expr.start, \"Binding parenthesized expression\"); }\n    return this.checkLValSimple(expr.expression, bindingType, checkClashes)\n\n  default:\n    this.raise(expr.start, (isBind ? \"Binding\" : \"Assigning to\") + \" rvalue\");\n  }\n};\n\npp$7.checkLValPattern = function(expr, bindingType, checkClashes) {\n  if ( bindingType === void 0 ) bindingType = BIND_NONE;\n\n  switch (expr.type) {\n  case \"ObjectPattern\":\n    for (var i = 0, list = expr.properties; i < list.length; i += 1) {\n      var prop = list[i];\n\n    this.checkLValInnerPattern(prop, bindingType, checkClashes);\n    }\n    break\n\n  case \"ArrayPattern\":\n    for (var i$1 = 0, list$1 = expr.elements; i$1 < list$1.length; i$1 += 1) {\n      var elem = list$1[i$1];\n\n    if (elem) { this.checkLValInnerPattern(elem, bindingType, checkClashes); }\n    }\n    break\n\n  default:\n    this.checkLValSimple(expr, bindingType, checkClashes);\n  }\n};\n\npp$7.checkLValInnerPattern = function(expr, bindingType, checkClashes) {\n  if ( bindingType === void 0 ) bindingType = BIND_NONE;\n\n  switch (expr.type) {\n  case \"Property\":\n    // AssignmentProperty has type === \"Property\"\n    this.checkLValInnerPattern(expr.value, bindingType, checkClashes);\n    break\n\n  case \"AssignmentPattern\":\n    this.checkLValPattern(expr.left, bindingType, checkClashes);\n    break\n\n  case \"RestElement\":\n    this.checkLValPattern(expr.argument, bindingType, checkClashes);\n    break\n\n  default:\n    this.checkLValPattern(expr, bindingType, checkClashes);\n  }\n};\n\n// The algorithm used to determine whether a regexp can appear at a\n\nvar TokContext = function TokContext(token, isExpr, preserveSpace, override, generator) {\n  this.token = token;\n  this.isExpr = !!isExpr;\n  this.preserveSpace = !!preserveSpace;\n  this.override = override;\n  this.generator = !!generator;\n};\n\nvar types = {\n  b_stat: new TokContext(\"{\", false),\n  b_expr: new TokContext(\"{\", true),\n  b_tmpl: new TokContext(\"${\", false),\n  p_stat: new TokContext(\"(\", false),\n  p_expr: new TokContext(\"(\", true),\n  q_tmpl: new TokContext(\"`\", true, true, function (p) { return p.tryReadTemplateToken(); }),\n  f_stat: new TokContext(\"function\", false),\n  f_expr: new TokContext(\"function\", true),\n  f_expr_gen: new TokContext(\"function\", true, false, null, true),\n  f_gen: new TokContext(\"function\", false, false, null, true)\n};\n\nvar pp$6 = Parser.prototype;\n\npp$6.initialContext = function() {\n  return [types.b_stat]\n};\n\npp$6.curContext = function() {\n  return this.context[this.context.length - 1]\n};\n\npp$6.braceIsBlock = function(prevType) {\n  var parent = this.curContext();\n  if (parent === types.f_expr || parent === types.f_stat)\n    { return true }\n  if (prevType === types$1.colon && (parent === types.b_stat || parent === types.b_expr))\n    { return !parent.isExpr }\n\n  // The check for `tt.name && exprAllowed` detects whether we are\n  // after a `yield` or `of` construct. See the `updateContext` for\n  // `tt.name`.\n  if (prevType === types$1._return || prevType === types$1.name && this.exprAllowed)\n    { return lineBreak.test(this.input.slice(this.lastTokEnd, this.start)) }\n  if (prevType === types$1._else || prevType === types$1.semi || prevType === types$1.eof || prevType === types$1.parenR || prevType === types$1.arrow)\n    { return true }\n  if (prevType === types$1.braceL)\n    { return parent === types.b_stat }\n  if (prevType === types$1._var || prevType === types$1._const || prevType === types$1.name)\n    { return false }\n  return !this.exprAllowed\n};\n\npp$6.inGeneratorContext = function() {\n  for (var i = this.context.length - 1; i >= 1; i--) {\n    var context = this.context[i];\n    if (context.token === \"function\")\n      { return context.generator }\n  }\n  return false\n};\n\npp$6.updateContext = function(prevType) {\n  var update, type = this.type;\n  if (type.keyword && prevType === types$1.dot)\n    { this.exprAllowed = false; }\n  else if (update = type.updateContext)\n    { update.call(this, prevType); }\n  else\n    { this.exprAllowed = type.beforeExpr; }\n};\n\n// Used to handle egde case when token context could not be inferred correctly in tokenize phase\npp$6.overrideContext = function(tokenCtx) {\n  if (this.curContext() !== tokenCtx) {\n    this.context[this.context.length - 1] = tokenCtx;\n  }\n};\n\n// Token-specific context update code\n\ntypes$1.parenR.updateContext = types$1.braceR.updateContext = function() {\n  if (this.context.length === 1) {\n    this.exprAllowed = true;\n    return\n  }\n  var out = this.context.pop();\n  if (out === types.b_stat && this.curContext().token === \"function\") {\n    out = this.context.pop();\n  }\n  this.exprAllowed = !out.isExpr;\n};\n\ntypes$1.braceL.updateContext = function(prevType) {\n  this.context.push(this.braceIsBlock(prevType) ? types.b_stat : types.b_expr);\n  this.exprAllowed = true;\n};\n\ntypes$1.dollarBraceL.updateContext = function() {\n  this.context.push(types.b_tmpl);\n  this.exprAllowed = true;\n};\n\ntypes$1.parenL.updateContext = function(prevType) {\n  var statementParens = prevType === types$1._if || prevType === types$1._for || prevType === types$1._with || prevType === types$1._while;\n  this.context.push(statementParens ? types.p_stat : types.p_expr);\n  this.exprAllowed = true;\n};\n\ntypes$1.incDec.updateContext = function() {\n  // tokExprAllowed stays unchanged\n};\n\ntypes$1._function.updateContext = types$1._class.updateContext = function(prevType) {\n  if (prevType.beforeExpr && prevType !== types$1._else &&\n      !(prevType === types$1.semi && this.curContext() !== types.p_stat) &&\n      !(prevType === types$1._return && lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) &&\n      !((prevType === types$1.colon || prevType === types$1.braceL) && this.curContext() === types.b_stat))\n    { this.context.push(types.f_expr); }\n  else\n    { this.context.push(types.f_stat); }\n  this.exprAllowed = false;\n};\n\ntypes$1.backQuote.updateContext = function() {\n  if (this.curContext() === types.q_tmpl)\n    { this.context.pop(); }\n  else\n    { this.context.push(types.q_tmpl); }\n  this.exprAllowed = false;\n};\n\ntypes$1.star.updateContext = function(prevType) {\n  if (prevType === types$1._function) {\n    var index = this.context.length - 1;\n    if (this.context[index] === types.f_expr)\n      { this.context[index] = types.f_expr_gen; }\n    else\n      { this.context[index] = types.f_gen; }\n  }\n  this.exprAllowed = true;\n};\n\ntypes$1.name.updateContext = function(prevType) {\n  var allowed = false;\n  if (this.options.ecmaVersion >= 6 && prevType !== types$1.dot) {\n    if (this.value === \"of\" && !this.exprAllowed ||\n        this.value === \"yield\" && this.inGeneratorContext())\n      { allowed = true; }\n  }\n  this.exprAllowed = allowed;\n};\n\n// A recursive descent parser operates by defining functions for all\n\nvar pp$5 = Parser.prototype;\n\n// Check if property name clashes with already added.\n// Object/class getters and setters are not allowed to clash \u2014\n// either with each other or with an init property \u2014 and in\n// strict mode, init properties are also not allowed to be repeated.\n\npp$5.checkPropClash = function(prop, propHash, refDestructuringErrors) {\n  if (this.options.ecmaVersion >= 9 && prop.type === \"SpreadElement\")\n    { return }\n  if (this.options.ecmaVersion >= 6 && (prop.computed || prop.method || prop.shorthand))\n    { return }\n  var key = prop.key;\n  var name;\n  switch (key.type) {\n  case \"Identifier\": name = key.name; break\n  case \"Literal\": name = String(key.value); break\n  default: return\n  }\n  var kind = prop.kind;\n  if (this.options.ecmaVersion >= 6) {\n    if (name === \"__proto__\" && kind === \"init\") {\n      if (propHash.proto) {\n        if (refDestructuringErrors) {\n          if (refDestructuringErrors.doubleProto < 0) {\n            refDestructuringErrors.doubleProto = key.start;\n          }\n        } else {\n          this.raiseRecoverable(key.start, \"Redefinition of __proto__ property\");\n        }\n      }\n      propHash.proto = true;\n    }\n    return\n  }\n  name = \"$\" + name;\n  var other = propHash[name];\n  if (other) {\n    var redefinition;\n    if (kind === \"init\") {\n      redefinition = this.strict && other.init || other.get || other.set;\n    } else {\n      redefinition = other.init || other[kind];\n    }\n    if (redefinition)\n      { this.raiseRecoverable(key.start, \"Redefinition of property\"); }\n  } else {\n    other = propHash[name] = {\n      init: false,\n      get: false,\n      set: false\n    };\n  }\n  other[kind] = true;\n};\n\n// ### Expression parsing\n\n// These nest, from the most general expression type at the top to\n// 'atomic', nondivisible expression types at the bottom. Most of\n// the functions will simply let the function(s) below them parse,\n// and, *if* the syntactic construct they handle is present, wrap\n// the AST node that the inner parser gave them in another node.\n\n// Parse a full expression. The optional arguments are used to\n// forbid the `in` operator (in for loops initalization expressions)\n// and provide reference for storing '=' operator inside shorthand\n// property assignment in contexts where both object expression\n// and object pattern might appear (so it's possible to raise\n// delayed syntax error at correct position).\n\npp$5.parseExpression = function(forInit, refDestructuringErrors) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseMaybeAssign(forInit, refDestructuringErrors);\n  if (this.type === types$1.comma) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.expressions = [expr];\n    while (this.eat(types$1.comma)) { node.expressions.push(this.parseMaybeAssign(forInit, refDestructuringErrors)); }\n    return this.finishNode(node, \"SequenceExpression\")\n  }\n  return expr\n};\n\n// Parse an assignment expression. This includes applications of\n// operators like `+=`.\n\npp$5.parseMaybeAssign = function(forInit, refDestructuringErrors, afterLeftParse) {\n  if (this.isContextual(\"yield\")) {\n    if (this.inGenerator) { return this.parseYield(forInit) }\n    // The tokenizer will assume an expression is allowed after\n    // `yield`, but this isn't that kind of yield\n    else { this.exprAllowed = false; }\n  }\n\n  var ownDestructuringErrors = false, oldParenAssign = -1, oldTrailingComma = -1, oldDoubleProto = -1;\n  if (refDestructuringErrors) {\n    oldParenAssign = refDestructuringErrors.parenthesizedAssign;\n    oldTrailingComma = refDestructuringErrors.trailingComma;\n    oldDoubleProto = refDestructuringErrors.doubleProto;\n    refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = -1;\n  } else {\n    refDestructuringErrors = new DestructuringErrors;\n    ownDestructuringErrors = true;\n  }\n\n  var startPos = this.start, startLoc = this.startLoc;\n  if (this.type === types$1.parenL || this.type === types$1.name) {\n    this.potentialArrowAt = this.start;\n    this.potentialArrowInForAwait = forInit === \"await\";\n  }\n  var left = this.parseMaybeConditional(forInit, refDestructuringErrors);\n  if (afterLeftParse) { left = afterLeftParse.call(this, left, startPos, startLoc); }\n  if (this.type.isAssign) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.operator = this.value;\n    if (this.type === types$1.eq)\n      { left = this.toAssignable(left, false, refDestructuringErrors); }\n    if (!ownDestructuringErrors) {\n      refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = refDestructuringErrors.doubleProto = -1;\n    }\n    if (refDestructuringErrors.shorthandAssign >= left.start)\n      { refDestructuringErrors.shorthandAssign = -1; } // reset because shorthand default was used correctly\n    if (this.type === types$1.eq)\n      { this.checkLValPattern(left); }\n    else\n      { this.checkLValSimple(left); }\n    node.left = left;\n    this.next();\n    node.right = this.parseMaybeAssign(forInit);\n    if (oldDoubleProto > -1) { refDestructuringErrors.doubleProto = oldDoubleProto; }\n    return this.finishNode(node, \"AssignmentExpression\")\n  } else {\n    if (ownDestructuringErrors) { this.checkExpressionErrors(refDestructuringErrors, true); }\n  }\n  if (oldParenAssign > -1) { refDestructuringErrors.parenthesizedAssign = oldParenAssign; }\n  if (oldTrailingComma > -1) { refDestructuringErrors.trailingComma = oldTrailingComma; }\n  return left\n};\n\n// Parse a ternary conditional (`?:`) operator.\n\npp$5.parseMaybeConditional = function(forInit, refDestructuringErrors) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseExprOps(forInit, refDestructuringErrors);\n  if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }\n  if (this.eat(types$1.question)) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.test = expr;\n    node.consequent = this.parseMaybeAssign();\n    this.expect(types$1.colon);\n    node.alternate = this.parseMaybeAssign(forInit);\n    return this.finishNode(node, \"ConditionalExpression\")\n  }\n  return expr\n};\n\n// Start the precedence parser.\n\npp$5.parseExprOps = function(forInit, refDestructuringErrors) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseMaybeUnary(refDestructuringErrors, false, false, forInit);\n  if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }\n  return expr.start === startPos && expr.type === \"ArrowFunctionExpression\" ? expr : this.parseExprOp(expr, startPos, startLoc, -1, forInit)\n};\n\n// Parse binary operators with the operator precedence parsing\n// algorithm. `left` is the left-hand side of the operator.\n// `minPrec` provides context that allows the function to stop and\n// defer further parser to one of its callers when it encounters an\n// operator that has a lower precedence than the set it is parsing.\n\npp$5.parseExprOp = function(left, leftStartPos, leftStartLoc, minPrec, forInit) {\n  var prec = this.type.binop;\n  if (prec != null && (!forInit || this.type !== types$1._in)) {\n    if (prec > minPrec) {\n      var logical = this.type === types$1.logicalOR || this.type === types$1.logicalAND;\n      var coalesce = this.type === types$1.coalesce;\n      if (coalesce) {\n        // Handle the precedence of `tt.coalesce` as equal to the range of logical expressions.\n        // In other words, `node.right` shouldn't contain logical expressions in order to check the mixed error.\n        prec = types$1.logicalAND.binop;\n      }\n      var op = this.value;\n      this.next();\n      var startPos = this.start, startLoc = this.startLoc;\n      var right = this.parseExprOp(this.parseMaybeUnary(null, false, false, forInit), startPos, startLoc, prec, forInit);\n      var node = this.buildBinary(leftStartPos, leftStartLoc, left, right, op, logical || coalesce);\n      if ((logical && this.type === types$1.coalesce) || (coalesce && (this.type === types$1.logicalOR || this.type === types$1.logicalAND))) {\n        this.raiseRecoverable(this.start, \"Logical expressions and coalesce expressions cannot be mixed. Wrap either by parentheses\");\n      }\n      return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, forInit)\n    }\n  }\n  return left\n};\n\npp$5.buildBinary = function(startPos, startLoc, left, right, op, logical) {\n  if (right.type === \"PrivateIdentifier\") { this.raise(right.start, \"Private identifier can only be left side of binary expression\"); }\n  var node = this.startNodeAt(startPos, startLoc);\n  node.left = left;\n  node.operator = op;\n  node.right = right;\n  return this.finishNode(node, logical ? \"LogicalExpression\" : \"BinaryExpression\")\n};\n\n// Parse unary operators, both prefix and postfix.\n\npp$5.parseMaybeUnary = function(refDestructuringErrors, sawUnary, incDec, forInit) {\n  var startPos = this.start, startLoc = this.startLoc, expr;\n  if (this.isContextual(\"await\") && this.canAwait) {\n    expr = this.parseAwait(forInit);\n    sawUnary = true;\n  } else if (this.type.prefix) {\n    var node = this.startNode(), update = this.type === types$1.incDec;\n    node.operator = this.value;\n    node.prefix = true;\n    this.next();\n    node.argument = this.parseMaybeUnary(null, true, update, forInit);\n    this.checkExpressionErrors(refDestructuringErrors, true);\n    if (update) { this.checkLValSimple(node.argument); }\n    else if (this.strict && node.operator === \"delete\" &&\n             node.argument.type === \"Identifier\")\n      { this.raiseRecoverable(node.start, \"Deleting local variable in strict mode\"); }\n    else if (node.operator === \"delete\" && isPrivateFieldAccess(node.argument))\n      { this.raiseRecoverable(node.start, \"Private fields can not be deleted\"); }\n    else { sawUnary = true; }\n    expr = this.finishNode(node, update ? \"UpdateExpression\" : \"UnaryExpression\");\n  } else if (!sawUnary && this.type === types$1.privateId) {\n    if (forInit || this.privateNameStack.length === 0) { this.unexpected(); }\n    expr = this.parsePrivateIdent();\n    // only could be private fields in 'in', such as #x in obj\n    if (this.type !== types$1._in) { this.unexpected(); }\n  } else {\n    expr = this.parseExprSubscripts(refDestructuringErrors, forInit);\n    if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }\n    while (this.type.postfix && !this.canInsertSemicolon()) {\n      var node$1 = this.startNodeAt(startPos, startLoc);\n      node$1.operator = this.value;\n      node$1.prefix = false;\n      node$1.argument = expr;\n      this.checkLValSimple(expr);\n      this.next();\n      expr = this.finishNode(node$1, \"UpdateExpression\");\n    }\n  }\n\n  if (!incDec && this.eat(types$1.starstar)) {\n    if (sawUnary)\n      { this.unexpected(this.lastTokStart); }\n    else\n      { return this.buildBinary(startPos, startLoc, expr, this.parseMaybeUnary(null, false, false, forInit), \"**\", false) }\n  } else {\n    return expr\n  }\n};\n\nfunction isPrivateFieldAccess(node) {\n  return (\n    node.type === \"MemberExpression\" && node.property.type === \"PrivateIdentifier\" ||\n    node.type === \"ChainExpression\" && isPrivateFieldAccess(node.expression)\n  )\n}\n\n// Parse call, dot, and `[]`-subscript expressions.\n\npp$5.parseExprSubscripts = function(refDestructuringErrors, forInit) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseExprAtom(refDestructuringErrors, forInit);\n  if (expr.type === \"ArrowFunctionExpression\" && this.input.slice(this.lastTokStart, this.lastTokEnd) !== \")\")\n    { return expr }\n  var result = this.parseSubscripts(expr, startPos, startLoc, false, forInit);\n  if (refDestructuringErrors && result.type === \"MemberExpression\") {\n    if (refDestructuringErrors.parenthesizedAssign >= result.start) { refDestructuringErrors.parenthesizedAssign = -1; }\n    if (refDestructuringErrors.parenthesizedBind >= result.start) { refDestructuringErrors.parenthesizedBind = -1; }\n    if (refDestructuringErrors.trailingComma >= result.start) { refDestructuringErrors.trailingComma = -1; }\n  }\n  return result\n};\n\npp$5.parseSubscripts = function(base, startPos, startLoc, noCalls, forInit) {\n  var maybeAsyncArrow = this.options.ecmaVersion >= 8 && base.type === \"Identifier\" && base.name === \"async\" &&\n      this.lastTokEnd === base.end && !this.canInsertSemicolon() && base.end - base.start === 5 &&\n      this.potentialArrowAt === base.start;\n  var optionalChained = false;\n\n  while (true) {\n    var element = this.parseSubscript(base, startPos, startLoc, noCalls, maybeAsyncArrow, optionalChained, forInit);\n\n    if (element.optional) { optionalChained = true; }\n    if (element === base || element.type === \"ArrowFunctionExpression\") {\n      if (optionalChained) {\n        var chainNode = this.startNodeAt(startPos, startLoc);\n        chainNode.expression = element;\n        element = this.finishNode(chainNode, \"ChainExpression\");\n      }\n      return element\n    }\n\n    base = element;\n  }\n};\n\npp$5.parseSubscript = function(base, startPos, startLoc, noCalls, maybeAsyncArrow, optionalChained, forInit) {\n  var optionalSupported = this.options.ecmaVersion >= 11;\n  var optional = optionalSupported && this.eat(types$1.questionDot);\n  if (noCalls && optional) { this.raise(this.lastTokStart, \"Optional chaining cannot appear in the callee of new expressions\"); }\n\n  var computed = this.eat(types$1.bracketL);\n  if (computed || (optional && this.type !== types$1.parenL && this.type !== types$1.backQuote) || this.eat(types$1.dot)) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.object = base;\n    if (computed) {\n      node.property = this.parseExpression();\n      this.expect(types$1.bracketR);\n    } else if (this.type === types$1.privateId && base.type !== \"Super\") {\n      node.property = this.parsePrivateIdent();\n    } else {\n      node.property = this.parseIdent(this.options.allowReserved !== \"never\");\n    }\n    node.computed = !!computed;\n    if (optionalSupported) {\n      node.optional = optional;\n    }\n    base = this.finishNode(node, \"MemberExpression\");\n  } else if (!noCalls && this.eat(types$1.parenL)) {\n    var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n    this.yieldPos = 0;\n    this.awaitPos = 0;\n    this.awaitIdentPos = 0;\n    var exprList = this.parseExprList(types$1.parenR, this.options.ecmaVersion >= 8, false, refDestructuringErrors);\n    if (maybeAsyncArrow && !optional && !this.canInsertSemicolon() && this.eat(types$1.arrow)) {\n      this.checkPatternErrors(refDestructuringErrors, false);\n      this.checkYieldAwaitInDefaultParams();\n      if (this.awaitIdentPos > 0)\n        { this.raise(this.awaitIdentPos, \"Cannot use 'await' as identifier inside an async function\"); }\n      this.yieldPos = oldYieldPos;\n      this.awaitPos = oldAwaitPos;\n      this.awaitIdentPos = oldAwaitIdentPos;\n      return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, true, forInit)\n    }\n    this.checkExpressionErrors(refDestructuringErrors, true);\n    this.yieldPos = oldYieldPos || this.yieldPos;\n    this.awaitPos = oldAwaitPos || this.awaitPos;\n    this.awaitIdentPos = oldAwaitIdentPos || this.awaitIdentPos;\n    var node$1 = this.startNodeAt(startPos, startLoc);\n    node$1.callee = base;\n    node$1.arguments = exprList;\n    if (optionalSupported) {\n      node$1.optional = optional;\n    }\n    base = this.finishNode(node$1, \"CallExpression\");\n  } else if (this.type === types$1.backQuote) {\n    if (optional || optionalChained) {\n      this.raise(this.start, \"Optional chaining cannot appear in the tag of tagged template expressions\");\n    }\n    var node$2 = this.startNodeAt(startPos, startLoc);\n    node$2.tag = base;\n    node$2.quasi = this.parseTemplate({isTagged: true});\n    base = this.finishNode(node$2, \"TaggedTemplateExpression\");\n  }\n  return base\n};\n\n// Parse an atomic expression \u2014 either a single token that is an\n// expression, an expression started by a keyword like `function` or\n// `new`, or an expression wrapped in punctuation like `()`, `[]`,\n// or `{}`.\n\npp$5.parseExprAtom = function(refDestructuringErrors, forInit) {\n  // If a division operator appears in an expression position, the\n  // tokenizer got confused, and we force it to read a regexp instead.\n  if (this.type === types$1.slash) { this.readRegexp(); }\n\n  var node, canBeArrow = this.potentialArrowAt === this.start;\n  switch (this.type) {\n  case types$1._super:\n    if (!this.allowSuper)\n      { this.raise(this.start, \"'super' keyword outside a method\"); }\n    node = this.startNode();\n    this.next();\n    if (this.type === types$1.parenL && !this.allowDirectSuper)\n      { this.raise(node.start, \"super() call outside constructor of a subclass\"); }\n    // The `super` keyword can appear at below:\n    // SuperProperty:\n    //     super [ Expression ]\n    //     super . IdentifierName\n    // SuperCall:\n    //     super ( Arguments )\n    if (this.type !== types$1.dot && this.type !== types$1.bracketL && this.type !== types$1.parenL)\n      { this.unexpected(); }\n    return this.finishNode(node, \"Super\")\n\n  case types$1._this:\n    node = this.startNode();\n    this.next();\n    return this.finishNode(node, \"ThisExpression\")\n\n  case types$1.name:\n    var startPos = this.start, startLoc = this.startLoc, containsEsc = this.containsEsc;\n    var id = this.parseIdent(false);\n    if (this.options.ecmaVersion >= 8 && !containsEsc && id.name === \"async\" && !this.canInsertSemicolon() && this.eat(types$1._function)) {\n      this.overrideContext(types.f_expr);\n      return this.parseFunction(this.startNodeAt(startPos, startLoc), 0, false, true, forInit)\n    }\n    if (canBeArrow && !this.canInsertSemicolon()) {\n      if (this.eat(types$1.arrow))\n        { return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], false, forInit) }\n      if (this.options.ecmaVersion >= 8 && id.name === \"async\" && this.type === types$1.name && !containsEsc &&\n          (!this.potentialArrowInForAwait || this.value !== \"of\" || this.containsEsc)) {\n        id = this.parseIdent(false);\n        if (this.canInsertSemicolon() || !this.eat(types$1.arrow))\n          { this.unexpected(); }\n        return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], true, forInit)\n      }\n    }\n    return id\n\n  case types$1.regexp:\n    var value = this.value;\n    node = this.parseLiteral(value.value);\n    node.regex = {pattern: value.pattern, flags: value.flags};\n    return node\n\n  case types$1.num: case types$1.string:\n    return this.parseLiteral(this.value)\n\n  case types$1._null: case types$1._true: case types$1._false:\n    node = this.startNode();\n    node.value = this.type === types$1._null ? null : this.type === types$1._true;\n    node.raw = this.type.keyword;\n    this.next();\n    return this.finishNode(node, \"Literal\")\n\n  case types$1.parenL:\n    var start = this.start, expr = this.parseParenAndDistinguishExpression(canBeArrow, forInit);\n    if (refDestructuringErrors) {\n      if (refDestructuringErrors.parenthesizedAssign < 0 && !this.isSimpleAssignTarget(expr))\n        { refDestructuringErrors.parenthesizedAssign = start; }\n      if (refDestructuringErrors.parenthesizedBind < 0)\n        { refDestructuringErrors.parenthesizedBind = start; }\n    }\n    return expr\n\n  case types$1.bracketL:\n    node = this.startNode();\n    this.next();\n    node.elements = this.parseExprList(types$1.bracketR, true, true, refDestructuringErrors);\n    return this.finishNode(node, \"ArrayExpression\")\n\n  case types$1.braceL:\n    this.overrideContext(types.b_expr);\n    return this.parseObj(false, refDestructuringErrors)\n\n  case types$1._function:\n    node = this.startNode();\n    this.next();\n    return this.parseFunction(node, 0)\n\n  case types$1._class:\n    return this.parseClass(this.startNode(), false)\n\n  case types$1._new:\n    return this.parseNew()\n\n  case types$1.backQuote:\n    return this.parseTemplate()\n\n  case types$1._import:\n    if (this.options.ecmaVersion >= 11) {\n      return this.parseExprImport()\n    } else {\n      return this.unexpected()\n    }\n\n  default:\n    this.unexpected();\n  }\n};\n\npp$5.parseExprImport = function() {\n  var node = this.startNode();\n\n  // Consume `import` as an identifier for `import.meta`.\n  // Because `this.parseIdent(true)` doesn't check escape sequences, it needs the check of `this.containsEsc`.\n  if (this.containsEsc) { this.raiseRecoverable(this.start, \"Escape sequence in keyword import\"); }\n  var meta = this.parseIdent(true);\n\n  switch (this.type) {\n  case types$1.parenL:\n    return this.parseDynamicImport(node)\n  case types$1.dot:\n    node.meta = meta;\n    return this.parseImportMeta(node)\n  default:\n    this.unexpected();\n  }\n};\n\npp$5.parseDynamicImport = function(node) {\n  this.next(); // skip `(`\n\n  // Parse node.source.\n  node.source = this.parseMaybeAssign();\n\n  // Verify ending.\n  if (!this.eat(types$1.parenR)) {\n    var errorPos = this.start;\n    if (this.eat(types$1.comma) && this.eat(types$1.parenR)) {\n      this.raiseRecoverable(errorPos, \"Trailing comma is not allowed in import()\");\n    } else {\n      this.unexpected(errorPos);\n    }\n  }\n\n  return this.finishNode(node, \"ImportExpression\")\n};\n\npp$5.parseImportMeta = function(node) {\n  this.next(); // skip `.`\n\n  var containsEsc = this.containsEsc;\n  node.property = this.parseIdent(true);\n\n  if (node.property.name !== \"meta\")\n    { this.raiseRecoverable(node.property.start, \"The only valid meta property for import is 'import.meta'\"); }\n  if (containsEsc)\n    { this.raiseRecoverable(node.start, \"'import.meta' must not contain escaped characters\"); }\n  if (this.options.sourceType !== \"module\" && !this.options.allowImportExportEverywhere)\n    { this.raiseRecoverable(node.start, \"Cannot use 'import.meta' outside a module\"); }\n\n  return this.finishNode(node, \"MetaProperty\")\n};\n\npp$5.parseLiteral = function(value) {\n  var node = this.startNode();\n  node.value = value;\n  node.raw = this.input.slice(this.start, this.end);\n  if (node.raw.charCodeAt(node.raw.length - 1) === 110) { node.bigint = node.raw.slice(0, -1).replace(/_/g, \"\"); }\n  this.next();\n  return this.finishNode(node, \"Literal\")\n};\n\npp$5.parseParenExpression = function() {\n  this.expect(types$1.parenL);\n  var val = this.parseExpression();\n  this.expect(types$1.parenR);\n  return val\n};\n\npp$5.parseParenAndDistinguishExpression = function(canBeArrow, forInit) {\n  var startPos = this.start, startLoc = this.startLoc, val, allowTrailingComma = this.options.ecmaVersion >= 8;\n  if (this.options.ecmaVersion >= 6) {\n    this.next();\n\n    var innerStartPos = this.start, innerStartLoc = this.startLoc;\n    var exprList = [], first = true, lastIsComma = false;\n    var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, spreadStart;\n    this.yieldPos = 0;\n    this.awaitPos = 0;\n    // Do not save awaitIdentPos to allow checking awaits nested in parameters\n    while (this.type !== types$1.parenR) {\n      first ? first = false : this.expect(types$1.comma);\n      if (allowTrailingComma && this.afterTrailingComma(types$1.parenR, true)) {\n        lastIsComma = true;\n        break\n      } else if (this.type === types$1.ellipsis) {\n        spreadStart = this.start;\n        exprList.push(this.parseParenItem(this.parseRestBinding()));\n        if (this.type === types$1.comma) { this.raise(this.start, \"Comma is not permitted after the rest element\"); }\n        break\n      } else {\n        exprList.push(this.parseMaybeAssign(false, refDestructuringErrors, this.parseParenItem));\n      }\n    }\n    var innerEndPos = this.lastTokEnd, innerEndLoc = this.lastTokEndLoc;\n    this.expect(types$1.parenR);\n\n    if (canBeArrow && !this.canInsertSemicolon() && this.eat(types$1.arrow)) {\n      this.checkPatternErrors(refDestructuringErrors, false);\n      this.checkYieldAwaitInDefaultParams();\n      this.yieldPos = oldYieldPos;\n      this.awaitPos = oldAwaitPos;\n      return this.parseParenArrowList(startPos, startLoc, exprList, forInit)\n    }\n\n    if (!exprList.length || lastIsComma) { this.unexpected(this.lastTokStart); }\n    if (spreadStart) { this.unexpected(spreadStart); }\n    this.checkExpressionErrors(refDestructuringErrors, true);\n    this.yieldPos = oldYieldPos || this.yieldPos;\n    this.awaitPos = oldAwaitPos || this.awaitPos;\n\n    if (exprList.length > 1) {\n      val = this.startNodeAt(innerStartPos, innerStartLoc);\n      val.expressions = exprList;\n      this.finishNodeAt(val, \"SequenceExpression\", innerEndPos, innerEndLoc);\n    } else {\n      val = exprList[0];\n    }\n  } else {\n    val = this.parseParenExpression();\n  }\n\n  if (this.options.preserveParens) {\n    var par = this.startNodeAt(startPos, startLoc);\n    par.expression = val;\n    return this.finishNode(par, \"ParenthesizedExpression\")\n  } else {\n    return val\n  }\n};\n\npp$5.parseParenItem = function(item) {\n  return item\n};\n\npp$5.parseParenArrowList = function(startPos, startLoc, exprList, forInit) {\n  return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, false, forInit)\n};\n\n// New's precedence is slightly tricky. It must allow its argument to\n// be a `[]` or dot subscript expression, but not a call \u2014 at least,\n// not without wrapping it in parentheses. Thus, it uses the noCalls\n// argument to parseSubscripts to prevent it from consuming the\n// argument list.\n\nvar empty = [];\n\npp$5.parseNew = function() {\n  if (this.containsEsc) { this.raiseRecoverable(this.start, \"Escape sequence in keyword new\"); }\n  var node = this.startNode();\n  var meta = this.parseIdent(true);\n  if (this.options.ecmaVersion >= 6 && this.eat(types$1.dot)) {\n    node.meta = meta;\n    var containsEsc = this.containsEsc;\n    node.property = this.parseIdent(true);\n    if (node.property.name !== \"target\")\n      { this.raiseRecoverable(node.property.start, \"The only valid meta property for new is 'new.target'\"); }\n    if (containsEsc)\n      { this.raiseRecoverable(node.start, \"'new.target' must not contain escaped characters\"); }\n    if (!this.allowNewDotTarget)\n      { this.raiseRecoverable(node.start, \"'new.target' can only be used in functions and class static block\"); }\n    return this.finishNode(node, \"MetaProperty\")\n  }\n  var startPos = this.start, startLoc = this.startLoc, isImport = this.type === types$1._import;\n  node.callee = this.parseSubscripts(this.parseExprAtom(), startPos, startLoc, true, false);\n  if (isImport && node.callee.type === \"ImportExpression\") {\n    this.raise(startPos, \"Cannot use new with import()\");\n  }\n  if (this.eat(types$1.parenL)) { node.arguments = this.parseExprList(types$1.parenR, this.options.ecmaVersion >= 8, false); }\n  else { node.arguments = empty; }\n  return this.finishNode(node, \"NewExpression\")\n};\n\n// Parse template expression.\n\npp$5.parseTemplateElement = function(ref) {\n  var isTagged = ref.isTagged;\n\n  var elem = this.startNode();\n  if (this.type === types$1.invalidTemplate) {\n    if (!isTagged) {\n      this.raiseRecoverable(this.start, \"Bad escape sequence in untagged template literal\");\n    }\n    elem.value = {\n      raw: this.value,\n      cooked: null\n    };\n  } else {\n    elem.value = {\n      raw: this.input.slice(this.start, this.end).replace(/\\r\\n?/g, \"\\n\"),\n      cooked: this.value\n    };\n  }\n  this.next();\n  elem.tail = this.type === types$1.backQuote;\n  return this.finishNode(elem, \"TemplateElement\")\n};\n\npp$5.parseTemplate = function(ref) {\n  if ( ref === void 0 ) ref = {};\n  var isTagged = ref.isTagged; if ( isTagged === void 0 ) isTagged = false;\n\n  var node = this.startNode();\n  this.next();\n  node.expressions = [];\n  var curElt = this.parseTemplateElement({isTagged: isTagged});\n  node.quasis = [curElt];\n  while (!curElt.tail) {\n    if (this.type === types$1.eof) { this.raise(this.pos, \"Unterminated template literal\"); }\n    this.expect(types$1.dollarBraceL);\n    node.expressions.push(this.parseExpression());\n    this.expect(types$1.braceR);\n    node.quasis.push(curElt = this.parseTemplateElement({isTagged: isTagged}));\n  }\n  this.next();\n  return this.finishNode(node, \"TemplateLiteral\")\n};\n\npp$5.isAsyncProp = function(prop) {\n  return !prop.computed && prop.key.type === \"Identifier\" && prop.key.name === \"async\" &&\n    (this.type === types$1.name || this.type === types$1.num || this.type === types$1.string || this.type === types$1.bracketL || this.type.keyword || (this.options.ecmaVersion >= 9 && this.type === types$1.star)) &&\n    !lineBreak.test(this.input.slice(this.lastTokEnd, this.start))\n};\n\n// Parse an object literal or binding pattern.\n\npp$5.parseObj = function(isPattern, refDestructuringErrors) {\n  var node = this.startNode(), first = true, propHash = {};\n  node.properties = [];\n  this.next();\n  while (!this.eat(types$1.braceR)) {\n    if (!first) {\n      this.expect(types$1.comma);\n      if (this.options.ecmaVersion >= 5 && this.afterTrailingComma(types$1.braceR)) { break }\n    } else { first = false; }\n\n    var prop = this.parseProperty(isPattern, refDestructuringErrors);\n    if (!isPattern) { this.checkPropClash(prop, propHash, refDestructuringErrors); }\n    node.properties.push(prop);\n  }\n  return this.finishNode(node, isPattern ? \"ObjectPattern\" : \"ObjectExpression\")\n};\n\npp$5.parseProperty = function(isPattern, refDestructuringErrors) {\n  var prop = this.startNode(), isGenerator, isAsync, startPos, startLoc;\n  if (this.options.ecmaVersion >= 9 && this.eat(types$1.ellipsis)) {\n    if (isPattern) {\n      prop.argument = this.parseIdent(false);\n      if (this.type === types$1.comma) {\n        this.raise(this.start, \"Comma is not permitted after the rest element\");\n      }\n      return this.finishNode(prop, \"RestElement\")\n    }\n    // To disallow parenthesized identifier via `this.toAssignable()`.\n    if (this.type === types$1.parenL && refDestructuringErrors) {\n      if (refDestructuringErrors.parenthesizedAssign < 0) {\n        refDestructuringErrors.parenthesizedAssign = this.start;\n      }\n      if (refDestructuringErrors.parenthesizedBind < 0) {\n        refDestructuringErrors.parenthesizedBind = this.start;\n      }\n    }\n    // Parse argument.\n    prop.argument = this.parseMaybeAssign(false, refDestructuringErrors);\n    // To disallow trailing comma via `this.toAssignable()`.\n    if (this.type === types$1.comma && refDestructuringErrors && refDestructuringErrors.trailingComma < 0) {\n      refDestructuringErrors.trailingComma = this.start;\n    }\n    // Finish\n    return this.finishNode(prop, \"SpreadElement\")\n  }\n  if (this.options.ecmaVersion >= 6) {\n    prop.method = false;\n    prop.shorthand = false;\n    if (isPattern || refDestructuringErrors) {\n      startPos = this.start;\n      startLoc = this.startLoc;\n    }\n    if (!isPattern)\n      { isGenerator = this.eat(types$1.star); }\n  }\n  var containsEsc = this.containsEsc;\n  this.parsePropertyName(prop);\n  if (!isPattern && !containsEsc && this.options.ecmaVersion >= 8 && !isGenerator && this.isAsyncProp(prop)) {\n    isAsync = true;\n    isGenerator = this.options.ecmaVersion >= 9 && this.eat(types$1.star);\n    this.parsePropertyName(prop, refDestructuringErrors);\n  } else {\n    isAsync = false;\n  }\n  this.parsePropertyValue(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc);\n  return this.finishNode(prop, \"Property\")\n};\n\npp$5.parsePropertyValue = function(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc) {\n  if ((isGenerator || isAsync) && this.type === types$1.colon)\n    { this.unexpected(); }\n\n  if (this.eat(types$1.colon)) {\n    prop.value = isPattern ? this.parseMaybeDefault(this.start, this.startLoc) : this.parseMaybeAssign(false, refDestructuringErrors);\n    prop.kind = \"init\";\n  } else if (this.options.ecmaVersion >= 6 && this.type === types$1.parenL) {\n    if (isPattern) { this.unexpected(); }\n    prop.kind = \"init\";\n    prop.method = true;\n    prop.value = this.parseMethod(isGenerator, isAsync);\n  } else if (!isPattern && !containsEsc &&\n             this.options.ecmaVersion >= 5 && !prop.computed && prop.key.type === \"Identifier\" &&\n             (prop.key.name === \"get\" || prop.key.name === \"set\") &&\n             (this.type !== types$1.comma && this.type !== types$1.braceR && this.type !== types$1.eq)) {\n    if (isGenerator || isAsync) { this.unexpected(); }\n    prop.kind = prop.key.name;\n    this.parsePropertyName(prop);\n    prop.value = this.parseMethod(false);\n    var paramCount = prop.kind === \"get\" ? 0 : 1;\n    if (prop.value.params.length !== paramCount) {\n      var start = prop.value.start;\n      if (prop.kind === \"get\")\n        { this.raiseRecoverable(start, \"getter should have no params\"); }\n      else\n        { this.raiseRecoverable(start, \"setter should have exactly one param\"); }\n    } else {\n      if (prop.kind === \"set\" && prop.value.params[0].type === \"RestElement\")\n        { this.raiseRecoverable(prop.value.params[0].start, \"Setter cannot use rest params\"); }\n    }\n  } else if (this.options.ecmaVersion >= 6 && !prop.computed && prop.key.type === \"Identifier\") {\n    if (isGenerator || isAsync) { this.unexpected(); }\n    this.checkUnreserved(prop.key);\n    if (prop.key.name === \"await\" && !this.awaitIdentPos)\n      { this.awaitIdentPos = startPos; }\n    prop.kind = \"init\";\n    if (isPattern) {\n      prop.value = this.parseMaybeDefault(startPos, startLoc, this.copyNode(prop.key));\n    } else if (this.type === types$1.eq && refDestructuringErrors) {\n      if (refDestructuringErrors.shorthandAssign < 0)\n        { refDestructuringErrors.shorthandAssign = this.start; }\n      prop.value = this.parseMaybeDefault(startPos, startLoc, this.copyNode(prop.key));\n    } else {\n      prop.value = this.copyNode(prop.key);\n    }\n    prop.shorthand = true;\n  } else { this.unexpected(); }\n};\n\npp$5.parsePropertyName = function(prop) {\n  if (this.options.ecmaVersion >= 6) {\n    if (this.eat(types$1.bracketL)) {\n      prop.computed = true;\n      prop.key = this.parseMaybeAssign();\n      this.expect(types$1.bracketR);\n      return prop.key\n    } else {\n      prop.computed = false;\n    }\n  }\n  return prop.key = this.type === types$1.num || this.type === types$1.string ? this.parseExprAtom() : this.parseIdent(this.options.allowReserved !== \"never\")\n};\n\n// Initialize empty function node.\n\npp$5.initFunction = function(node) {\n  node.id = null;\n  if (this.options.ecmaVersion >= 6) { node.generator = node.expression = false; }\n  if (this.options.ecmaVersion >= 8) { node.async = false; }\n};\n\n// Parse object or class method.\n\npp$5.parseMethod = function(isGenerator, isAsync, allowDirectSuper) {\n  var node = this.startNode(), oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n\n  this.initFunction(node);\n  if (this.options.ecmaVersion >= 6)\n    { node.generator = isGenerator; }\n  if (this.options.ecmaVersion >= 8)\n    { node.async = !!isAsync; }\n\n  this.yieldPos = 0;\n  this.awaitPos = 0;\n  this.awaitIdentPos = 0;\n  this.enterScope(functionFlags(isAsync, node.generator) | SCOPE_SUPER | (allowDirectSuper ? SCOPE_DIRECT_SUPER : 0));\n\n  this.expect(types$1.parenL);\n  node.params = this.parseBindingList(types$1.parenR, false, this.options.ecmaVersion >= 8);\n  this.checkYieldAwaitInDefaultParams();\n  this.parseFunctionBody(node, false, true, false);\n\n  this.yieldPos = oldYieldPos;\n  this.awaitPos = oldAwaitPos;\n  this.awaitIdentPos = oldAwaitIdentPos;\n  return this.finishNode(node, \"FunctionExpression\")\n};\n\n// Parse arrow function expression with given parameters.\n\npp$5.parseArrowExpression = function(node, params, isAsync, forInit) {\n  var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n\n  this.enterScope(functionFlags(isAsync, false) | SCOPE_ARROW);\n  this.initFunction(node);\n  if (this.options.ecmaVersion >= 8) { node.async = !!isAsync; }\n\n  this.yieldPos = 0;\n  this.awaitPos = 0;\n  this.awaitIdentPos = 0;\n\n  node.params = this.toAssignableList(params, true);\n  this.parseFunctionBody(node, true, false, forInit);\n\n  this.yieldPos = oldYieldPos;\n  this.awaitPos = oldAwaitPos;\n  this.awaitIdentPos = oldAwaitIdentPos;\n  return this.finishNode(node, \"ArrowFunctionExpression\")\n};\n\n// Parse function body and check parameters.\n\npp$5.parseFunctionBody = function(node, isArrowFunction, isMethod, forInit) {\n  var isExpression = isArrowFunction && this.type !== types$1.braceL;\n  var oldStrict = this.strict, useStrict = false;\n\n  if (isExpression) {\n    node.body = this.parseMaybeAssign(forInit);\n    node.expression = true;\n    this.checkParams(node, false);\n  } else {\n    var nonSimple = this.options.ecmaVersion >= 7 && !this.isSimpleParamList(node.params);\n    if (!oldStrict || nonSimple) {\n      useStrict = this.strictDirective(this.end);\n      // If this is a strict mode function, verify that argument names\n      // are not repeated, and it does not try to bind the words `eval`\n      // or `arguments`.\n      if (useStrict && nonSimple)\n        { this.raiseRecoverable(node.start, \"Illegal 'use strict' directive in function with non-simple parameter list\"); }\n    }\n    // Start a new scope with regard to labels and the `inFunction`\n    // flag (restore them to their old value afterwards).\n    var oldLabels = this.labels;\n    this.labels = [];\n    if (useStrict) { this.strict = true; }\n\n    // Add the params to varDeclaredNames to ensure that an error is thrown\n    // if a let/const declaration in the function clashes with one of the params.\n    this.checkParams(node, !oldStrict && !useStrict && !isArrowFunction && !isMethod && this.isSimpleParamList(node.params));\n    // Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval'\n    if (this.strict && node.id) { this.checkLValSimple(node.id, BIND_OUTSIDE); }\n    node.body = this.parseBlock(false, undefined, useStrict && !oldStrict);\n    node.expression = false;\n    this.adaptDirectivePrologue(node.body.body);\n    this.labels = oldLabels;\n  }\n  this.exitScope();\n};\n\npp$5.isSimpleParamList = function(params) {\n  for (var i = 0, list = params; i < list.length; i += 1)\n    {\n    var param = list[i];\n\n    if (param.type !== \"Identifier\") { return false\n  } }\n  return true\n};\n\n// Checks function params for various disallowed patterns such as using \"eval\"\n// or \"arguments\" and duplicate parameters.\n\npp$5.checkParams = function(node, allowDuplicates) {\n  var nameHash = Object.create(null);\n  for (var i = 0, list = node.params; i < list.length; i += 1)\n    {\n    var param = list[i];\n\n    this.checkLValInnerPattern(param, BIND_VAR, allowDuplicates ? null : nameHash);\n  }\n};\n\n// Parses a comma-separated list of expressions, and returns them as\n// an array. `close` is the token type that ends the list, and\n// `allowEmpty` can be turned on to allow subsequent commas with\n// nothing in between them to be parsed as `null` (which is needed\n// for array literals).\n\npp$5.parseExprList = function(close, allowTrailingComma, allowEmpty, refDestructuringErrors) {\n  var elts = [], first = true;\n  while (!this.eat(close)) {\n    if (!first) {\n      this.expect(types$1.comma);\n      if (allowTrailingComma && this.afterTrailingComma(close)) { break }\n    } else { first = false; }\n\n    var elt = (void 0);\n    if (allowEmpty && this.type === types$1.comma)\n      { elt = null; }\n    else if (this.type === types$1.ellipsis) {\n      elt = this.parseSpread(refDestructuringErrors);\n      if (refDestructuringErrors && this.type === types$1.comma && refDestructuringErrors.trailingComma < 0)\n        { refDestructuringErrors.trailingComma = this.start; }\n    } else {\n      elt = this.parseMaybeAssign(false, refDestructuringErrors);\n    }\n    elts.push(elt);\n  }\n  return elts\n};\n\npp$5.checkUnreserved = function(ref) {\n  var start = ref.start;\n  var end = ref.end;\n  var name = ref.name;\n\n  if (this.inGenerator && name === \"yield\")\n    { this.raiseRecoverable(start, \"Cannot use 'yield' as identifier inside a generator\"); }\n  if (this.inAsync && name === \"await\")\n    { this.raiseRecoverable(start, \"Cannot use 'await' as identifier inside an async function\"); }\n  if (this.currentThisScope().inClassFieldInit && name === \"arguments\")\n    { this.raiseRecoverable(start, \"Cannot use 'arguments' in class field initializer\"); }\n  if (this.inClassStaticBlock && (name === \"arguments\" || name === \"await\"))\n    { this.raise(start, (\"Cannot use \" + name + \" in class static initialization block\")); }\n  if (this.keywords.test(name))\n    { this.raise(start, (\"Unexpected keyword '\" + name + \"'\")); }\n  if (this.options.ecmaVersion < 6 &&\n    this.input.slice(start, end).indexOf(\"\\\\\") !== -1) { return }\n  var re = this.strict ? this.reservedWordsStrict : this.reservedWords;\n  if (re.test(name)) {\n    if (!this.inAsync && name === \"await\")\n      { this.raiseRecoverable(start, \"Cannot use keyword 'await' outside an async function\"); }\n    this.raiseRecoverable(start, (\"The keyword '\" + name + \"' is reserved\"));\n  }\n};\n\n// Parse the next token as an identifier. If `liberal` is true (used\n// when parsing properties), it will also convert keywords into\n// identifiers.\n\npp$5.parseIdent = function(liberal, isBinding) {\n  var node = this.startNode();\n  if (this.type === types$1.name) {\n    node.name = this.value;\n  } else if (this.type.keyword) {\n    node.name = this.type.keyword;\n\n    // To fix https://github.com/acornjs/acorn/issues/575\n    // `class` and `function` keywords push new context into this.context.\n    // But there is no chance to pop the context if the keyword is consumed as an identifier such as a property name.\n    // If the previous token is a dot, this does not apply because the context-managing code already ignored the keyword\n    if ((node.name === \"class\" || node.name === \"function\") &&\n        (this.lastTokEnd !== this.lastTokStart + 1 || this.input.charCodeAt(this.lastTokStart) !== 46)) {\n      this.context.pop();\n    }\n  } else {\n    this.unexpected();\n  }\n  this.next(!!liberal);\n  this.finishNode(node, \"Identifier\");\n  if (!liberal) {\n    this.checkUnreserved(node);\n    if (node.name === \"await\" && !this.awaitIdentPos)\n      { this.awaitIdentPos = node.start; }\n  }\n  return node\n};\n\npp$5.parsePrivateIdent = function() {\n  var node = this.startNode();\n  if (this.type === types$1.privateId) {\n    node.name = this.value;\n  } else {\n    this.unexpected();\n  }\n  this.next();\n  this.finishNode(node, \"PrivateIdentifier\");\n\n  // For validating existence\n  if (this.privateNameStack.length === 0) {\n    this.raise(node.start, (\"Private field '#\" + (node.name) + \"' must be declared in an enclosing class\"));\n  } else {\n    this.privateNameStack[this.privateNameStack.length - 1].used.push(node);\n  }\n\n  return node\n};\n\n// Parses yield expression inside generator.\n\npp$5.parseYield = function(forInit) {\n  if (!this.yieldPos) { this.yieldPos = this.start; }\n\n  var node = this.startNode();\n  this.next();\n  if (this.type === types$1.semi || this.canInsertSemicolon() || (this.type !== types$1.star && !this.type.startsExpr)) {\n    node.delegate = false;\n    node.argument = null;\n  } else {\n    node.delegate = this.eat(types$1.star);\n    node.argument = this.parseMaybeAssign(forInit);\n  }\n  return this.finishNode(node, \"YieldExpression\")\n};\n\npp$5.parseAwait = function(forInit) {\n  if (!this.awaitPos) { this.awaitPos = this.start; }\n\n  var node = this.startNode();\n  this.next();\n  node.argument = this.parseMaybeUnary(null, true, false, forInit);\n  return this.finishNode(node, \"AwaitExpression\")\n};\n\nvar pp$4 = Parser.prototype;\n\n// This function is used to raise exceptions on parse errors. It\n// takes an offset integer (into the current `input`) to indicate\n// the location of the error, attaches the position to the end\n// of the error message, and then raises a `SyntaxError` with that\n// message.\n\npp$4.raise = function(pos, message) {\n  var loc = getLineInfo(this.input, pos);\n  message += \" (\" + loc.line + \":\" + loc.column + \")\";\n  var err = new SyntaxError(message);\n  err.pos = pos; err.loc = loc; err.raisedAt = this.pos;\n  throw err\n};\n\npp$4.raiseRecoverable = pp$4.raise;\n\npp$4.curPosition = function() {\n  if (this.options.locations) {\n    return new Position(this.curLine, this.pos - this.lineStart)\n  }\n};\n\nvar pp$3 = Parser.prototype;\n\nvar Scope = function Scope(flags) {\n  this.flags = flags;\n  // A list of var-declared names in the current lexical scope\n  this.var = [];\n  // A list of lexically-declared names in the current lexical scope\n  this.lexical = [];\n  // A list of lexically-declared FunctionDeclaration names in the current lexical scope\n  this.functions = [];\n  // A switch to disallow the identifier reference 'arguments'\n  this.inClassFieldInit = false;\n};\n\n// The functions in this module keep track of declared variables in the current scope in order to detect duplicate variable names.\n\npp$3.enterScope = function(flags) {\n  this.scopeStack.push(new Scope(flags));\n};\n\npp$3.exitScope = function() {\n  this.scopeStack.pop();\n};\n\n// The spec says:\n// > At the top level of a function, or script, function declarations are\n// > treated like var declarations rather than like lexical declarations.\npp$3.treatFunctionsAsVarInScope = function(scope) {\n  return (scope.flags & SCOPE_FUNCTION) || !this.inModule && (scope.flags & SCOPE_TOP)\n};\n\npp$3.declareName = function(name, bindingType, pos) {\n  var redeclared = false;\n  if (bindingType === BIND_LEXICAL) {\n    var scope = this.currentScope();\n    redeclared = scope.lexical.indexOf(name) > -1 || scope.functions.indexOf(name) > -1 || scope.var.indexOf(name) > -1;\n    scope.lexical.push(name);\n    if (this.inModule && (scope.flags & SCOPE_TOP))\n      { delete this.undefinedExports[name]; }\n  } else if (bindingType === BIND_SIMPLE_CATCH) {\n    var scope$1 = this.currentScope();\n    scope$1.lexical.push(name);\n  } else if (bindingType === BIND_FUNCTION) {\n    var scope$2 = this.currentScope();\n    if (this.treatFunctionsAsVar)\n      { redeclared = scope$2.lexical.indexOf(name) > -1; }\n    else\n      { redeclared = scope$2.lexical.indexOf(name) > -1 || scope$2.var.indexOf(name) > -1; }\n    scope$2.functions.push(name);\n  } else {\n    for (var i = this.scopeStack.length - 1; i >= 0; --i) {\n      var scope$3 = this.scopeStack[i];\n      if (scope$3.lexical.indexOf(name) > -1 && !((scope$3.flags & SCOPE_SIMPLE_CATCH) && scope$3.lexical[0] === name) ||\n          !this.treatFunctionsAsVarInScope(scope$3) && scope$3.functions.indexOf(name) > -1) {\n        redeclared = true;\n        break\n      }\n      scope$3.var.push(name);\n      if (this.inModule && (scope$3.flags & SCOPE_TOP))\n        { delete this.undefinedExports[name]; }\n      if (scope$3.flags & SCOPE_VAR) { break }\n    }\n  }\n  if (redeclared) { this.raiseRecoverable(pos, (\"Identifier '\" + name + \"' has already been declared\")); }\n};\n\npp$3.checkLocalExport = function(id) {\n  // scope.functions must be empty as Module code is always strict.\n  if (this.scopeStack[0].lexical.indexOf(id.name) === -1 &&\n      this.scopeStack[0].var.indexOf(id.name) === -1) {\n    this.undefinedExports[id.name] = id;\n  }\n};\n\npp$3.currentScope = function() {\n  return this.scopeStack[this.scopeStack.length - 1]\n};\n\npp$3.currentVarScope = function() {\n  for (var i = this.scopeStack.length - 1;; i--) {\n    var scope = this.scopeStack[i];\n    if (scope.flags & SCOPE_VAR) { return scope }\n  }\n};\n\n// Could be useful for `this`, `new.target`, `super()`, `super.property`, and `super[property]`.\npp$3.currentThisScope = function() {\n  for (var i = this.scopeStack.length - 1;; i--) {\n    var scope = this.scopeStack[i];\n    if (scope.flags & SCOPE_VAR && !(scope.flags & SCOPE_ARROW)) { return scope }\n  }\n};\n\nvar Node = function Node(parser, pos, loc) {\n  this.type = \"\";\n  this.start = pos;\n  this.end = 0;\n  if (parser.options.locations)\n    { this.loc = new SourceLocation(parser, loc); }\n  if (parser.options.directSourceFile)\n    { this.sourceFile = parser.options.directSourceFile; }\n  if (parser.options.ranges)\n    { this.range = [pos, 0]; }\n};\n\n// Start an AST node, attaching a start offset.\n\nvar pp$2 = Parser.prototype;\n\npp$2.startNode = function() {\n  return new Node(this, this.start, this.startLoc)\n};\n\npp$2.startNodeAt = function(pos, loc) {\n  return new Node(this, pos, loc)\n};\n\n// Finish an AST node, adding `type` and `end` properties.\n\nfunction finishNodeAt(node, type, pos, loc) {\n  node.type = type;\n  node.end = pos;\n  if (this.options.locations)\n    { node.loc.end = loc; }\n  if (this.options.ranges)\n    { node.range[1] = pos; }\n  return node\n}\n\npp$2.finishNode = function(node, type) {\n  return finishNodeAt.call(this, node, type, this.lastTokEnd, this.lastTokEndLoc)\n};\n\n// Finish node at given position\n\npp$2.finishNodeAt = function(node, type, pos, loc) {\n  return finishNodeAt.call(this, node, type, pos, loc)\n};\n\npp$2.copyNode = function(node) {\n  var newNode = new Node(this, node.start, this.startLoc);\n  for (var prop in node) { newNode[prop] = node[prop]; }\n  return newNode\n};\n\n// This file contains Unicode properties extracted from the ECMAScript\n// specification. The lists are extracted like so:\n// $$('#table-binary-unicode-properties > figure > table > tbody > tr > td:nth-child(1) code').map(el => el.innerText)\n\n// #table-binary-unicode-properties\nvar ecma9BinaryProperties = \"ASCII ASCII_Hex_Digit AHex Alphabetic Alpha Any Assigned Bidi_Control Bidi_C Bidi_Mirrored Bidi_M Case_Ignorable CI Cased Changes_When_Casefolded CWCF Changes_When_Casemapped CWCM Changes_When_Lowercased CWL Changes_When_NFKC_Casefolded CWKCF Changes_When_Titlecased CWT Changes_When_Uppercased CWU Dash Default_Ignorable_Code_Point DI Deprecated Dep Diacritic Dia Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Extender Ext Grapheme_Base Gr_Base Grapheme_Extend Gr_Ext Hex_Digit Hex IDS_Binary_Operator IDSB IDS_Trinary_Operator IDST ID_Continue IDC ID_Start IDS Ideographic Ideo Join_Control Join_C Logical_Order_Exception LOE Lowercase Lower Math Noncharacter_Code_Point NChar Pattern_Syntax Pat_Syn Pattern_White_Space Pat_WS Quotation_Mark QMark Radical Regional_Indicator RI Sentence_Terminal STerm Soft_Dotted SD Terminal_Punctuation Term Unified_Ideograph UIdeo Uppercase Upper Variation_Selector VS White_Space space XID_Continue XIDC XID_Start XIDS\";\nvar ecma10BinaryProperties = ecma9BinaryProperties + \" Extended_Pictographic\";\nvar ecma11BinaryProperties = ecma10BinaryProperties;\nvar ecma12BinaryProperties = ecma11BinaryProperties + \" EBase EComp EMod EPres ExtPict\";\nvar ecma13BinaryProperties = ecma12BinaryProperties;\nvar unicodeBinaryProperties = {\n  9: ecma9BinaryProperties,\n  10: ecma10BinaryProperties,\n  11: ecma11BinaryProperties,\n  12: ecma12BinaryProperties,\n  13: ecma13BinaryProperties\n};\n\n// #table-unicode-general-category-values\nvar unicodeGeneralCategoryValues = \"Cased_Letter LC Close_Punctuation Pe Connector_Punctuation Pc Control Cc cntrl Currency_Symbol Sc Dash_Punctuation Pd Decimal_Number Nd digit Enclosing_Mark Me Final_Punctuation Pf Format Cf Initial_Punctuation Pi Letter L Letter_Number Nl Line_Separator Zl Lowercase_Letter Ll Mark M Combining_Mark Math_Symbol Sm Modifier_Letter Lm Modifier_Symbol Sk Nonspacing_Mark Mn Number N Open_Punctuation Ps Other C Other_Letter Lo Other_Number No Other_Punctuation Po Other_Symbol So Paragraph_Separator Zp Private_Use Co Punctuation P punct Separator Z Space_Separator Zs Spacing_Mark Mc Surrogate Cs Symbol S Titlecase_Letter Lt Unassigned Cn Uppercase_Letter Lu\";\n\n// #table-unicode-script-values\nvar ecma9ScriptValues = \"Adlam Adlm Ahom Anatolian_Hieroglyphs Hluw Arabic Arab Armenian Armn Avestan Avst Balinese Bali Bamum Bamu Bassa_Vah Bass Batak Batk Bengali Beng Bhaiksuki Bhks Bopomofo Bopo Brahmi Brah Braille Brai Buginese Bugi Buhid Buhd Canadian_Aboriginal Cans Carian Cari Caucasian_Albanian Aghb Chakma Cakm Cham Cham Cherokee Cher Common Zyyy Coptic Copt Qaac Cuneiform Xsux Cypriot Cprt Cyrillic Cyrl Deseret Dsrt Devanagari Deva Duployan Dupl Egyptian_Hieroglyphs Egyp Elbasan Elba Ethiopic Ethi Georgian Geor Glagolitic Glag Gothic Goth Grantha Gran Greek Grek Gujarati Gujr Gurmukhi Guru Han Hani Hangul Hang Hanunoo Hano Hatran Hatr Hebrew Hebr Hiragana Hira Imperial_Aramaic Armi Inherited Zinh Qaai Inscriptional_Pahlavi Phli Inscriptional_Parthian Prti Javanese Java Kaithi Kthi Kannada Knda Katakana Kana Kayah_Li Kali Kharoshthi Khar Khmer Khmr Khojki Khoj Khudawadi Sind Lao Laoo Latin Latn Lepcha Lepc Limbu Limb Linear_A Lina Linear_B Linb Lisu Lisu Lycian Lyci Lydian Lydi Mahajani Mahj Malayalam Mlym Mandaic Mand Manichaean Mani Marchen Marc Masaram_Gondi Gonm Meetei_Mayek Mtei Mende_Kikakui Mend Meroitic_Cursive Merc Meroitic_Hieroglyphs Mero Miao Plrd Modi Mongolian Mong Mro Mroo Multani Mult Myanmar Mymr Nabataean Nbat New_Tai_Lue Talu Newa Newa Nko Nkoo Nushu Nshu Ogham Ogam Ol_Chiki Olck Old_Hungarian Hung Old_Italic Ital Old_North_Arabian Narb Old_Permic Perm Old_Persian Xpeo Old_South_Arabian Sarb Old_Turkic Orkh Oriya Orya Osage Osge Osmanya Osma Pahawh_Hmong Hmng Palmyrene Palm Pau_Cin_Hau Pauc Phags_Pa Phag Phoenician Phnx Psalter_Pahlavi Phlp Rejang Rjng Runic Runr Samaritan Samr Saurashtra Saur Sharada Shrd Shavian Shaw Siddham Sidd SignWriting Sgnw Sinhala Sinh Sora_Sompeng Sora Soyombo Soyo Sundanese Sund Syloti_Nagri Sylo Syriac Syrc Tagalog Tglg Tagbanwa Tagb Tai_Le Tale Tai_Tham Lana Tai_Viet Tavt Takri Takr Tamil Taml Tangut Tang Telugu Telu Thaana Thaa Thai Thai Tibetan Tibt Tifinagh Tfng Tirhuta Tirh Ugaritic Ugar Vai Vaii Warang_Citi Wara Yi Yiii Zanabazar_Square Zanb\";\nvar ecma10ScriptValues = ecma9ScriptValues + \" Dogra Dogr Gunjala_Gondi Gong Hanifi_Rohingya Rohg Makasar Maka Medefaidrin Medf Old_Sogdian Sogo Sogdian Sogd\";\nvar ecma11ScriptValues = ecma10ScriptValues + \" Elymaic Elym Nandinagari Nand Nyiakeng_Puachue_Hmong Hmnp Wancho Wcho\";\nvar ecma12ScriptValues = ecma11ScriptValues + \" Chorasmian Chrs Diak Dives_Akuru Khitan_Small_Script Kits Yezi Yezidi\";\nvar ecma13ScriptValues = ecma12ScriptValues + \" Cypro_Minoan Cpmn Old_Uyghur Ougr Tangsa Tnsa Toto Vithkuqi Vith\";\nvar unicodeScriptValues = {\n  9: ecma9ScriptValues,\n  10: ecma10ScriptValues,\n  11: ecma11ScriptValues,\n  12: ecma12ScriptValues,\n  13: ecma13ScriptValues\n};\n\nvar data = {};\nfunction buildUnicodeData(ecmaVersion) {\n  var d = data[ecmaVersion] = {\n    binary: wordsRegexp(unicodeBinaryProperties[ecmaVersion] + \" \" + unicodeGeneralCategoryValues),\n    nonBinary: {\n      General_Category: wordsRegexp(unicodeGeneralCategoryValues),\n      Script: wordsRegexp(unicodeScriptValues[ecmaVersion])\n    }\n  };\n  d.nonBinary.Script_Extensions = d.nonBinary.Script;\n\n  d.nonBinary.gc = d.nonBinary.General_Category;\n  d.nonBinary.sc = d.nonBinary.Script;\n  d.nonBinary.scx = d.nonBinary.Script_Extensions;\n}\n\nfor (var i = 0, list = [9, 10, 11, 12, 13]; i < list.length; i += 1) {\n  var ecmaVersion = list[i];\n\n  buildUnicodeData(ecmaVersion);\n}\n\nvar pp$1 = Parser.prototype;\n\nvar RegExpValidationState = function RegExpValidationState(parser) {\n  this.parser = parser;\n  this.validFlags = \"gim\" + (parser.options.ecmaVersion >= 6 ? \"uy\" : \"\") + (parser.options.ecmaVersion >= 9 ? \"s\" : \"\") + (parser.options.ecmaVersion >= 13 ? \"d\" : \"\");\n  this.unicodeProperties = data[parser.options.ecmaVersion >= 13 ? 13 : parser.options.ecmaVersion];\n  this.source = \"\";\n  this.flags = \"\";\n  this.start = 0;\n  this.switchU = false;\n  this.switchN = false;\n  this.pos = 0;\n  this.lastIntValue = 0;\n  this.lastStringValue = \"\";\n  this.lastAssertionIsQuantifiable = false;\n  this.numCapturingParens = 0;\n  this.maxBackReference = 0;\n  this.groupNames = [];\n  this.backReferenceNames = [];\n};\n\nRegExpValidationState.prototype.reset = function reset (start, pattern, flags) {\n  var unicode = flags.indexOf(\"u\") !== -1;\n  this.start = start | 0;\n  this.source = pattern + \"\";\n  this.flags = flags;\n  this.switchU = unicode && this.parser.options.ecmaVersion >= 6;\n  this.switchN = unicode && this.parser.options.ecmaVersion >= 9;\n};\n\nRegExpValidationState.prototype.raise = function raise (message) {\n  this.parser.raiseRecoverable(this.start, (\"Invalid regular expression: /\" + (this.source) + \"/: \" + message));\n};\n\n// If u flag is given, this returns the code point at the index (it combines a surrogate pair).\n// Otherwise, this returns the code unit of the index (can be a part of a surrogate pair).\nRegExpValidationState.prototype.at = function at (i, forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  var s = this.source;\n  var l = s.length;\n  if (i >= l) {\n    return -1\n  }\n  var c = s.charCodeAt(i);\n  if (!(forceU || this.switchU) || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {\n    return c\n  }\n  var next = s.charCodeAt(i + 1);\n  return next >= 0xDC00 && next <= 0xDFFF ? (c << 10) + next - 0x35FDC00 : c\n};\n\nRegExpValidationState.prototype.nextIndex = function nextIndex (i, forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  var s = this.source;\n  var l = s.length;\n  if (i >= l) {\n    return l\n  }\n  var c = s.charCodeAt(i), next;\n  if (!(forceU || this.switchU) || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l ||\n      (next = s.charCodeAt(i + 1)) < 0xDC00 || next > 0xDFFF) {\n    return i + 1\n  }\n  return i + 2\n};\n\nRegExpValidationState.prototype.current = function current (forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  return this.at(this.pos, forceU)\n};\n\nRegExpValidationState.prototype.lookahead = function lookahead (forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  return this.at(this.nextIndex(this.pos, forceU), forceU)\n};\n\nRegExpValidationState.prototype.advance = function advance (forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  this.pos = this.nextIndex(this.pos, forceU);\n};\n\nRegExpValidationState.prototype.eat = function eat (ch, forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  if (this.current(forceU) === ch) {\n    this.advance(forceU);\n    return true\n  }\n  return false\n};\n\nfunction codePointToString$1(ch) {\n  if (ch <= 0xFFFF) { return String.fromCharCode(ch) }\n  ch -= 0x10000;\n  return String.fromCharCode((ch >> 10) + 0xD800, (ch & 0x03FF) + 0xDC00)\n}\n\n/**\n * Validate the flags part of a given RegExpLiteral.\n *\n * @param {RegExpValidationState} state The state to validate RegExp.\n * @returns {void}\n */\npp$1.validateRegExpFlags = function(state) {\n  var validFlags = state.validFlags;\n  var flags = state.flags;\n\n  for (var i = 0; i < flags.length; i++) {\n    var flag = flags.charAt(i);\n    if (validFlags.indexOf(flag) === -1) {\n      this.raise(state.start, \"Invalid regular expression flag\");\n    }\n    if (flags.indexOf(flag, i + 1) > -1) {\n      this.raise(state.start, \"Duplicate regular expression flag\");\n    }\n  }\n};\n\n/**\n * Validate the pattern part of a given RegExpLiteral.\n *\n * @param {RegExpValidationState} state The state to validate RegExp.\n * @returns {void}\n */\npp$1.validateRegExpPattern = function(state) {\n  this.regexp_pattern(state);\n\n  // The goal symbol for the parse is |Pattern[~U, ~N]|. If the result of\n  // parsing contains a |GroupName|, reparse with the goal symbol\n  // |Pattern[~U, +N]| and use this result instead. Throw a *SyntaxError*\n  // exception if _P_ did not conform to the grammar, if any elements of _P_\n  // were not matched by the parse, or if any Early Error conditions exist.\n  if (!state.switchN && this.options.ecmaVersion >= 9 && state.groupNames.length > 0) {\n    state.switchN = true;\n    this.regexp_pattern(state);\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Pattern\npp$1.regexp_pattern = function(state) {\n  state.pos = 0;\n  state.lastIntValue = 0;\n  state.lastStringValue = \"\";\n  state.lastAssertionIsQuantifiable = false;\n  state.numCapturingParens = 0;\n  state.maxBackReference = 0;\n  state.groupNames.length = 0;\n  state.backReferenceNames.length = 0;\n\n  this.regexp_disjunction(state);\n\n  if (state.pos !== state.source.length) {\n    // Make the same messages as V8.\n    if (state.eat(0x29 /* ) */)) {\n      state.raise(\"Unmatched ')'\");\n    }\n    if (state.eat(0x5D /* ] */) || state.eat(0x7D /* } */)) {\n      state.raise(\"Lone quantifier brackets\");\n    }\n  }\n  if (state.maxBackReference > state.numCapturingParens) {\n    state.raise(\"Invalid escape\");\n  }\n  for (var i = 0, list = state.backReferenceNames; i < list.length; i += 1) {\n    var name = list[i];\n\n    if (state.groupNames.indexOf(name) === -1) {\n      state.raise(\"Invalid named capture referenced\");\n    }\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Disjunction\npp$1.regexp_disjunction = function(state) {\n  this.regexp_alternative(state);\n  while (state.eat(0x7C /* | */)) {\n    this.regexp_alternative(state);\n  }\n\n  // Make the same message as V8.\n  if (this.regexp_eatQuantifier(state, true)) {\n    state.raise(\"Nothing to repeat\");\n  }\n  if (state.eat(0x7B /* { */)) {\n    state.raise(\"Lone quantifier brackets\");\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Alternative\npp$1.regexp_alternative = function(state) {\n  while (state.pos < state.source.length && this.regexp_eatTerm(state))\n    { }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Term\npp$1.regexp_eatTerm = function(state) {\n  if (this.regexp_eatAssertion(state)) {\n    // Handle `QuantifiableAssertion Quantifier` alternative.\n    // `state.lastAssertionIsQuantifiable` is true if the last eaten Assertion\n    // is a QuantifiableAssertion.\n    if (state.lastAssertionIsQuantifiable && this.regexp_eatQuantifier(state)) {\n      // Make the same message as V8.\n      if (state.switchU) {\n        state.raise(\"Invalid quantifier\");\n      }\n    }\n    return true\n  }\n\n  if (state.switchU ? this.regexp_eatAtom(state) : this.regexp_eatExtendedAtom(state)) {\n    this.regexp_eatQuantifier(state);\n    return true\n  }\n\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Assertion\npp$1.regexp_eatAssertion = function(state) {\n  var start = state.pos;\n  state.lastAssertionIsQuantifiable = false;\n\n  // ^, $\n  if (state.eat(0x5E /* ^ */) || state.eat(0x24 /* $ */)) {\n    return true\n  }\n\n  // \\b \\B\n  if (state.eat(0x5C /* \\ */)) {\n    if (state.eat(0x42 /* B */) || state.eat(0x62 /* b */)) {\n      return true\n    }\n    state.pos = start;\n  }\n\n  // Lookahead / Lookbehind\n  if (state.eat(0x28 /* ( */) && state.eat(0x3F /* ? */)) {\n    var lookbehind = false;\n    if (this.options.ecmaVersion >= 9) {\n      lookbehind = state.eat(0x3C /* < */);\n    }\n    if (state.eat(0x3D /* = */) || state.eat(0x21 /* ! */)) {\n      this.regexp_disjunction(state);\n      if (!state.eat(0x29 /* ) */)) {\n        state.raise(\"Unterminated group\");\n      }\n      state.lastAssertionIsQuantifiable = !lookbehind;\n      return true\n    }\n  }\n\n  state.pos = start;\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Quantifier\npp$1.regexp_eatQuantifier = function(state, noError) {\n  if ( noError === void 0 ) noError = false;\n\n  if (this.regexp_eatQuantifierPrefix(state, noError)) {\n    state.eat(0x3F /* ? */);\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-QuantifierPrefix\npp$1.regexp_eatQuantifierPrefix = function(state, noError) {\n  return (\n    state.eat(0x2A /* * */) ||\n    state.eat(0x2B /* + */) ||\n    state.eat(0x3F /* ? */) ||\n    this.regexp_eatBracedQuantifier(state, noError)\n  )\n};\npp$1.regexp_eatBracedQuantifier = function(state, noError) {\n  var start = state.pos;\n  if (state.eat(0x7B /* { */)) {\n    var min = 0, max = -1;\n    if (this.regexp_eatDecimalDigits(state)) {\n      min = state.lastIntValue;\n      if (state.eat(0x2C /* , */) && this.regexp_eatDecimalDigits(state)) {\n        max = state.lastIntValue;\n      }\n      if (state.eat(0x7D /* } */)) {\n        // SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-term\n        if (max !== -1 && max < min && !noError) {\n          state.raise(\"numbers out of order in {} quantifier\");\n        }\n        return true\n      }\n    }\n    if (state.switchU && !noError) {\n      state.raise(\"Incomplete quantifier\");\n    }\n    state.pos = start;\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Atom\npp$1.regexp_eatAtom = function(state) {\n  return (\n    this.regexp_eatPatternCharacters(state) ||\n    state.eat(0x2E /* . */) ||\n    this.regexp_eatReverseSolidusAtomEscape(state) ||\n    this.regexp_eatCharacterClass(state) ||\n    this.regexp_eatUncapturingGroup(state) ||\n    this.regexp_eatCapturingGroup(state)\n  )\n};\npp$1.regexp_eatReverseSolidusAtomEscape = function(state) {\n  var start = state.pos;\n  if (state.eat(0x5C /* \\ */)) {\n    if (this.regexp_eatAtomEscape(state)) {\n      return true\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$1.regexp_eatUncapturingGroup = function(state) {\n  var start = state.pos;\n  if (state.eat(0x28 /* ( */)) {\n    if (state.eat(0x3F /* ? */) && state.eat(0x3A /* : */)) {\n      this.regexp_disjunction(state);\n      if (state.eat(0x29 /* ) */)) {\n        return true\n      }\n      state.raise(\"Unterminated group\");\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$1.regexp_eatCapturingGroup = function(state) {\n  if (state.eat(0x28 /* ( */)) {\n    if (this.options.ecmaVersion >= 9) {\n      this.regexp_groupSpecifier(state);\n    } else if (state.current() === 0x3F /* ? */) {\n      state.raise(\"Invalid group\");\n    }\n    this.regexp_disjunction(state);\n    if (state.eat(0x29 /* ) */)) {\n      state.numCapturingParens += 1;\n      return true\n    }\n    state.raise(\"Unterminated group\");\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedAtom\npp$1.regexp_eatExtendedAtom = function(state) {\n  return (\n    state.eat(0x2E /* . */) ||\n    this.regexp_eatReverseSolidusAtomEscape(state) ||\n    this.regexp_eatCharacterClass(state) ||\n    this.regexp_eatUncapturingGroup(state) ||\n    this.regexp_eatCapturingGroup(state) ||\n    this.regexp_eatInvalidBracedQuantifier(state) ||\n    this.regexp_eatExtendedPatternCharacter(state)\n  )\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-InvalidBracedQuantifier\npp$1.regexp_eatInvalidBracedQuantifier = function(state) {\n  if (this.regexp_eatBracedQuantifier(state, true)) {\n    state.raise(\"Nothing to repeat\");\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-SyntaxCharacter\npp$1.regexp_eatSyntaxCharacter = function(state) {\n  var ch = state.current();\n  if (isSyntaxCharacter(ch)) {\n    state.lastIntValue = ch;\n    state.advance();\n    return true\n  }\n  return false\n};\nfunction isSyntaxCharacter(ch) {\n  return (\n    ch === 0x24 /* $ */ ||\n    ch >= 0x28 /* ( */ && ch <= 0x2B /* + */ ||\n    ch === 0x2E /* . */ ||\n    ch === 0x3F /* ? */ ||\n    ch >= 0x5B /* [ */ && ch <= 0x5E /* ^ */ ||\n    ch >= 0x7B /* { */ && ch <= 0x7D /* } */\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-PatternCharacter\n// But eat eager.\npp$1.regexp_eatPatternCharacters = function(state) {\n  var start = state.pos;\n  var ch = 0;\n  while ((ch = state.current()) !== -1 && !isSyntaxCharacter(ch)) {\n    state.advance();\n  }\n  return state.pos !== start\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedPatternCharacter\npp$1.regexp_eatExtendedPatternCharacter = function(state) {\n  var ch = state.current();\n  if (\n    ch !== -1 &&\n    ch !== 0x24 /* $ */ &&\n    !(ch >= 0x28 /* ( */ && ch <= 0x2B /* + */) &&\n    ch !== 0x2E /* . */ &&\n    ch !== 0x3F /* ? */ &&\n    ch !== 0x5B /* [ */ &&\n    ch !== 0x5E /* ^ */ &&\n    ch !== 0x7C /* | */\n  ) {\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// GroupSpecifier ::\n//   [empty]\n//   `?` GroupName\npp$1.regexp_groupSpecifier = function(state) {\n  if (state.eat(0x3F /* ? */)) {\n    if (this.regexp_eatGroupName(state)) {\n      if (state.groupNames.indexOf(state.lastStringValue) !== -1) {\n        state.raise(\"Duplicate capture group name\");\n      }\n      state.groupNames.push(state.lastStringValue);\n      return\n    }\n    state.raise(\"Invalid group\");\n  }\n};\n\n// GroupName ::\n//   `<` RegExpIdentifierName `>`\n// Note: this updates `state.lastStringValue` property with the eaten name.\npp$1.regexp_eatGroupName = function(state) {\n  state.lastStringValue = \"\";\n  if (state.eat(0x3C /* < */)) {\n    if (this.regexp_eatRegExpIdentifierName(state) && state.eat(0x3E /* > */)) {\n      return true\n    }\n    state.raise(\"Invalid capture group name\");\n  }\n  return false\n};\n\n// RegExpIdentifierName ::\n//   RegExpIdentifierStart\n//   RegExpIdentifierName RegExpIdentifierPart\n// Note: this updates `state.lastStringValue` property with the eaten name.\npp$1.regexp_eatRegExpIdentifierName = function(state) {\n  state.lastStringValue = \"\";\n  if (this.regexp_eatRegExpIdentifierStart(state)) {\n    state.lastStringValue += codePointToString$1(state.lastIntValue);\n    while (this.regexp_eatRegExpIdentifierPart(state)) {\n      state.lastStringValue += codePointToString$1(state.lastIntValue);\n    }\n    return true\n  }\n  return false\n};\n\n// RegExpIdentifierStart ::\n//   UnicodeIDStart\n//   `$`\n//   `_`\n//   `\\` RegExpUnicodeEscapeSequence[+U]\npp$1.regexp_eatRegExpIdentifierStart = function(state) {\n  var start = state.pos;\n  var forceU = this.options.ecmaVersion >= 11;\n  var ch = state.current(forceU);\n  state.advance(forceU);\n\n  if (ch === 0x5C /* \\ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state, forceU)) {\n    ch = state.lastIntValue;\n  }\n  if (isRegExpIdentifierStart(ch)) {\n    state.lastIntValue = ch;\n    return true\n  }\n\n  state.pos = start;\n  return false\n};\nfunction isRegExpIdentifierStart(ch) {\n  return isIdentifierStart(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */\n}\n\n// RegExpIdentifierPart ::\n//   UnicodeIDContinue\n//   `$`\n//   `_`\n//   `\\` RegExpUnicodeEscapeSequence[+U]\n//   <ZWNJ>\n//   <ZWJ>\npp$1.regexp_eatRegExpIdentifierPart = function(state) {\n  var start = state.pos;\n  var forceU = this.options.ecmaVersion >= 11;\n  var ch = state.current(forceU);\n  state.advance(forceU);\n\n  if (ch === 0x5C /* \\ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state, forceU)) {\n    ch = state.lastIntValue;\n  }\n  if (isRegExpIdentifierPart(ch)) {\n    state.lastIntValue = ch;\n    return true\n  }\n\n  state.pos = start;\n  return false\n};\nfunction isRegExpIdentifierPart(ch) {\n  return isIdentifierChar(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */ || ch === 0x200C /* <ZWNJ> */ || ch === 0x200D /* <ZWJ> */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-AtomEscape\npp$1.regexp_eatAtomEscape = function(state) {\n  if (\n    this.regexp_eatBackReference(state) ||\n    this.regexp_eatCharacterClassEscape(state) ||\n    this.regexp_eatCharacterEscape(state) ||\n    (state.switchN && this.regexp_eatKGroupName(state))\n  ) {\n    return true\n  }\n  if (state.switchU) {\n    // Make the same message as V8.\n    if (state.current() === 0x63 /* c */) {\n      state.raise(\"Invalid unicode escape\");\n    }\n    state.raise(\"Invalid escape\");\n  }\n  return false\n};\npp$1.regexp_eatBackReference = function(state) {\n  var start = state.pos;\n  if (this.regexp_eatDecimalEscape(state)) {\n    var n = state.lastIntValue;\n    if (state.switchU) {\n      // For SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-atomescape\n      if (n > state.maxBackReference) {\n        state.maxBackReference = n;\n      }\n      return true\n    }\n    if (n <= state.numCapturingParens) {\n      return true\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$1.regexp_eatKGroupName = function(state) {\n  if (state.eat(0x6B /* k */)) {\n    if (this.regexp_eatGroupName(state)) {\n      state.backReferenceNames.push(state.lastStringValue);\n      return true\n    }\n    state.raise(\"Invalid named reference\");\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-CharacterEscape\npp$1.regexp_eatCharacterEscape = function(state) {\n  return (\n    this.regexp_eatControlEscape(state) ||\n    this.regexp_eatCControlLetter(state) ||\n    this.regexp_eatZero(state) ||\n    this.regexp_eatHexEscapeSequence(state) ||\n    this.regexp_eatRegExpUnicodeEscapeSequence(state, false) ||\n    (!state.switchU && this.regexp_eatLegacyOctalEscapeSequence(state)) ||\n    this.regexp_eatIdentityEscape(state)\n  )\n};\npp$1.regexp_eatCControlLetter = function(state) {\n  var start = state.pos;\n  if (state.eat(0x63 /* c */)) {\n    if (this.regexp_eatControlLetter(state)) {\n      return true\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$1.regexp_eatZero = function(state) {\n  if (state.current() === 0x30 /* 0 */ && !isDecimalDigit(state.lookahead())) {\n    state.lastIntValue = 0;\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlEscape\npp$1.regexp_eatControlEscape = function(state) {\n  var ch = state.current();\n  if (ch === 0x74 /* t */) {\n    state.lastIntValue = 0x09; /* \\t */\n    state.advance();\n    return true\n  }\n  if (ch === 0x6E /* n */) {\n    state.lastIntValue = 0x0A; /* \\n */\n    state.advance();\n    return true\n  }\n  if (ch === 0x76 /* v */) {\n    state.lastIntValue = 0x0B; /* \\v */\n    state.advance();\n    return true\n  }\n  if (ch === 0x66 /* f */) {\n    state.lastIntValue = 0x0C; /* \\f */\n    state.advance();\n    return true\n  }\n  if (ch === 0x72 /* r */) {\n    state.lastIntValue = 0x0D; /* \\r */\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlLetter\npp$1.regexp_eatControlLetter = function(state) {\n  var ch = state.current();\n  if (isControlLetter(ch)) {\n    state.lastIntValue = ch % 0x20;\n    state.advance();\n    return true\n  }\n  return false\n};\nfunction isControlLetter(ch) {\n  return (\n    (ch >= 0x41 /* A */ && ch <= 0x5A /* Z */) ||\n    (ch >= 0x61 /* a */ && ch <= 0x7A /* z */)\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-RegExpUnicodeEscapeSequence\npp$1.regexp_eatRegExpUnicodeEscapeSequence = function(state, forceU) {\n  if ( forceU === void 0 ) forceU = false;\n\n  var start = state.pos;\n  var switchU = forceU || state.switchU;\n\n  if (state.eat(0x75 /* u */)) {\n    if (this.regexp_eatFixedHexDigits(state, 4)) {\n      var lead = state.lastIntValue;\n      if (switchU && lead >= 0xD800 && lead <= 0xDBFF) {\n        var leadSurrogateEnd = state.pos;\n        if (state.eat(0x5C /* \\ */) && state.eat(0x75 /* u */) && this.regexp_eatFixedHexDigits(state, 4)) {\n          var trail = state.lastIntValue;\n          if (trail >= 0xDC00 && trail <= 0xDFFF) {\n            state.lastIntValue = (lead - 0xD800) * 0x400 + (trail - 0xDC00) + 0x10000;\n            return true\n          }\n        }\n        state.pos = leadSurrogateEnd;\n        state.lastIntValue = lead;\n      }\n      return true\n    }\n    if (\n      switchU &&\n      state.eat(0x7B /* { */) &&\n      this.regexp_eatHexDigits(state) &&\n      state.eat(0x7D /* } */) &&\n      isValidUnicode(state.lastIntValue)\n    ) {\n      return true\n    }\n    if (switchU) {\n      state.raise(\"Invalid unicode escape\");\n    }\n    state.pos = start;\n  }\n\n  return false\n};\nfunction isValidUnicode(ch) {\n  return ch >= 0 && ch <= 0x10FFFF\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-IdentityEscape\npp$1.regexp_eatIdentityEscape = function(state) {\n  if (state.switchU) {\n    if (this.regexp_eatSyntaxCharacter(state)) {\n      return true\n    }\n    if (state.eat(0x2F /* / */)) {\n      state.lastIntValue = 0x2F; /* / */\n      return true\n    }\n    return false\n  }\n\n  var ch = state.current();\n  if (ch !== 0x63 /* c */ && (!state.switchN || ch !== 0x6B /* k */)) {\n    state.lastIntValue = ch;\n    state.advance();\n    return true\n  }\n\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalEscape\npp$1.regexp_eatDecimalEscape = function(state) {\n  state.lastIntValue = 0;\n  var ch = state.current();\n  if (ch >= 0x31 /* 1 */ && ch <= 0x39 /* 9 */) {\n    do {\n      state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);\n      state.advance();\n    } while ((ch = state.current()) >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */)\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClassEscape\npp$1.regexp_eatCharacterClassEscape = function(state) {\n  var ch = state.current();\n\n  if (isCharacterClassEscape(ch)) {\n    state.lastIntValue = -1;\n    state.advance();\n    return true\n  }\n\n  if (\n    state.switchU &&\n    this.options.ecmaVersion >= 9 &&\n    (ch === 0x50 /* P */ || ch === 0x70 /* p */)\n  ) {\n    state.lastIntValue = -1;\n    state.advance();\n    if (\n      state.eat(0x7B /* { */) &&\n      this.regexp_eatUnicodePropertyValueExpression(state) &&\n      state.eat(0x7D /* } */)\n    ) {\n      return true\n    }\n    state.raise(\"Invalid property name\");\n  }\n\n  return false\n};\nfunction isCharacterClassEscape(ch) {\n  return (\n    ch === 0x64 /* d */ ||\n    ch === 0x44 /* D */ ||\n    ch === 0x73 /* s */ ||\n    ch === 0x53 /* S */ ||\n    ch === 0x77 /* w */ ||\n    ch === 0x57 /* W */\n  )\n}\n\n// UnicodePropertyValueExpression ::\n//   UnicodePropertyName `=` UnicodePropertyValue\n//   LoneUnicodePropertyNameOrValue\npp$1.regexp_eatUnicodePropertyValueExpression = function(state) {\n  var start = state.pos;\n\n  // UnicodePropertyName `=` UnicodePropertyValue\n  if (this.regexp_eatUnicodePropertyName(state) && state.eat(0x3D /* = */)) {\n    var name = state.lastStringValue;\n    if (this.regexp_eatUnicodePropertyValue(state)) {\n      var value = state.lastStringValue;\n      this.regexp_validateUnicodePropertyNameAndValue(state, name, value);\n      return true\n    }\n  }\n  state.pos = start;\n\n  // LoneUnicodePropertyNameOrValue\n  if (this.regexp_eatLoneUnicodePropertyNameOrValue(state)) {\n    var nameOrValue = state.lastStringValue;\n    this.regexp_validateUnicodePropertyNameOrValue(state, nameOrValue);\n    return true\n  }\n  return false\n};\npp$1.regexp_validateUnicodePropertyNameAndValue = function(state, name, value) {\n  if (!hasOwn(state.unicodeProperties.nonBinary, name))\n    { state.raise(\"Invalid property name\"); }\n  if (!state.unicodeProperties.nonBinary[name].test(value))\n    { state.raise(\"Invalid property value\"); }\n};\npp$1.regexp_validateUnicodePropertyNameOrValue = function(state, nameOrValue) {\n  if (!state.unicodeProperties.binary.test(nameOrValue))\n    { state.raise(\"Invalid property name\"); }\n};\n\n// UnicodePropertyName ::\n//   UnicodePropertyNameCharacters\npp$1.regexp_eatUnicodePropertyName = function(state) {\n  var ch = 0;\n  state.lastStringValue = \"\";\n  while (isUnicodePropertyNameCharacter(ch = state.current())) {\n    state.lastStringValue += codePointToString$1(ch);\n    state.advance();\n  }\n  return state.lastStringValue !== \"\"\n};\nfunction isUnicodePropertyNameCharacter(ch) {\n  return isControlLetter(ch) || ch === 0x5F /* _ */\n}\n\n// UnicodePropertyValue ::\n//   UnicodePropertyValueCharacters\npp$1.regexp_eatUnicodePropertyValue = function(state) {\n  var ch = 0;\n  state.lastStringValue = \"\";\n  while (isUnicodePropertyValueCharacter(ch = state.current())) {\n    state.lastStringValue += codePointToString$1(ch);\n    state.advance();\n  }\n  return state.lastStringValue !== \"\"\n};\nfunction isUnicodePropertyValueCharacter(ch) {\n  return isUnicodePropertyNameCharacter(ch) || isDecimalDigit(ch)\n}\n\n// LoneUnicodePropertyNameOrValue ::\n//   UnicodePropertyValueCharacters\npp$1.regexp_eatLoneUnicodePropertyNameOrValue = function(state) {\n  return this.regexp_eatUnicodePropertyValue(state)\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClass\npp$1.regexp_eatCharacterClass = function(state) {\n  if (state.eat(0x5B /* [ */)) {\n    state.eat(0x5E /* ^ */);\n    this.regexp_classRanges(state);\n    if (state.eat(0x5D /* ] */)) {\n      return true\n    }\n    // Unreachable since it threw \"unterminated regular expression\" error before.\n    state.raise(\"Unterminated character class\");\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassRanges\n// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRanges\n// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRangesNoDash\npp$1.regexp_classRanges = function(state) {\n  while (this.regexp_eatClassAtom(state)) {\n    var left = state.lastIntValue;\n    if (state.eat(0x2D /* - */) && this.regexp_eatClassAtom(state)) {\n      var right = state.lastIntValue;\n      if (state.switchU && (left === -1 || right === -1)) {\n        state.raise(\"Invalid character class\");\n      }\n      if (left !== -1 && right !== -1 && left > right) {\n        state.raise(\"Range out of order in character class\");\n      }\n    }\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtom\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtomNoDash\npp$1.regexp_eatClassAtom = function(state) {\n  var start = state.pos;\n\n  if (state.eat(0x5C /* \\ */)) {\n    if (this.regexp_eatClassEscape(state)) {\n      return true\n    }\n    if (state.switchU) {\n      // Make the same message as V8.\n      var ch$1 = state.current();\n      if (ch$1 === 0x63 /* c */ || isOctalDigit(ch$1)) {\n        state.raise(\"Invalid class escape\");\n      }\n      state.raise(\"Invalid escape\");\n    }\n    state.pos = start;\n  }\n\n  var ch = state.current();\n  if (ch !== 0x5D /* ] */) {\n    state.lastIntValue = ch;\n    state.advance();\n    return true\n  }\n\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassEscape\npp$1.regexp_eatClassEscape = function(state) {\n  var start = state.pos;\n\n  if (state.eat(0x62 /* b */)) {\n    state.lastIntValue = 0x08; /* <BS> */\n    return true\n  }\n\n  if (state.switchU && state.eat(0x2D /* - */)) {\n    state.lastIntValue = 0x2D; /* - */\n    return true\n  }\n\n  if (!state.switchU && state.eat(0x63 /* c */)) {\n    if (this.regexp_eatClassControlLetter(state)) {\n      return true\n    }\n    state.pos = start;\n  }\n\n  return (\n    this.regexp_eatCharacterClassEscape(state) ||\n    this.regexp_eatCharacterEscape(state)\n  )\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassControlLetter\npp$1.regexp_eatClassControlLetter = function(state) {\n  var ch = state.current();\n  if (isDecimalDigit(ch) || ch === 0x5F /* _ */) {\n    state.lastIntValue = ch % 0x20;\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence\npp$1.regexp_eatHexEscapeSequence = function(state) {\n  var start = state.pos;\n  if (state.eat(0x78 /* x */)) {\n    if (this.regexp_eatFixedHexDigits(state, 2)) {\n      return true\n    }\n    if (state.switchU) {\n      state.raise(\"Invalid escape\");\n    }\n    state.pos = start;\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalDigits\npp$1.regexp_eatDecimalDigits = function(state) {\n  var start = state.pos;\n  var ch = 0;\n  state.lastIntValue = 0;\n  while (isDecimalDigit(ch = state.current())) {\n    state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);\n    state.advance();\n  }\n  return state.pos !== start\n};\nfunction isDecimalDigit(ch) {\n  return ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigits\npp$1.regexp_eatHexDigits = function(state) {\n  var start = state.pos;\n  var ch = 0;\n  state.lastIntValue = 0;\n  while (isHexDigit(ch = state.current())) {\n    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);\n    state.advance();\n  }\n  return state.pos !== start\n};\nfunction isHexDigit(ch) {\n  return (\n    (ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */) ||\n    (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) ||\n    (ch >= 0x61 /* a */ && ch <= 0x66 /* f */)\n  )\n}\nfunction hexToInt(ch) {\n  if (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) {\n    return 10 + (ch - 0x41 /* A */)\n  }\n  if (ch >= 0x61 /* a */ && ch <= 0x66 /* f */) {\n    return 10 + (ch - 0x61 /* a */)\n  }\n  return ch - 0x30 /* 0 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-LegacyOctalEscapeSequence\n// Allows only 0-377(octal) i.e. 0-255(decimal).\npp$1.regexp_eatLegacyOctalEscapeSequence = function(state) {\n  if (this.regexp_eatOctalDigit(state)) {\n    var n1 = state.lastIntValue;\n    if (this.regexp_eatOctalDigit(state)) {\n      var n2 = state.lastIntValue;\n      if (n1 <= 3 && this.regexp_eatOctalDigit(state)) {\n        state.lastIntValue = n1 * 64 + n2 * 8 + state.lastIntValue;\n      } else {\n        state.lastIntValue = n1 * 8 + n2;\n      }\n    } else {\n      state.lastIntValue = n1;\n    }\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-OctalDigit\npp$1.regexp_eatOctalDigit = function(state) {\n  var ch = state.current();\n  if (isOctalDigit(ch)) {\n    state.lastIntValue = ch - 0x30; /* 0 */\n    state.advance();\n    return true\n  }\n  state.lastIntValue = 0;\n  return false\n};\nfunction isOctalDigit(ch) {\n  return ch >= 0x30 /* 0 */ && ch <= 0x37 /* 7 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Hex4Digits\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigit\n// And HexDigit HexDigit in https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence\npp$1.regexp_eatFixedHexDigits = function(state, length) {\n  var start = state.pos;\n  state.lastIntValue = 0;\n  for (var i = 0; i < length; ++i) {\n    var ch = state.current();\n    if (!isHexDigit(ch)) {\n      state.pos = start;\n      return false\n    }\n    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);\n    state.advance();\n  }\n  return true\n};\n\n// Object type used to represent tokens. Note that normally, tokens\n// simply exist as properties on the parser object. This is only\n// used for the onToken callback and the external tokenizer.\n\nvar Token = function Token(p) {\n  this.type = p.type;\n  this.value = p.value;\n  this.start = p.start;\n  this.end = p.end;\n  if (p.options.locations)\n    { this.loc = new SourceLocation(p, p.startLoc, p.endLoc); }\n  if (p.options.ranges)\n    { this.range = [p.start, p.end]; }\n};\n\n// ## Tokenizer\n\nvar pp = Parser.prototype;\n\n// Move to the next token\n\npp.next = function(ignoreEscapeSequenceInKeyword) {\n  if (!ignoreEscapeSequenceInKeyword && this.type.keyword && this.containsEsc)\n    { this.raiseRecoverable(this.start, \"Escape sequence in keyword \" + this.type.keyword); }\n  if (this.options.onToken)\n    { this.options.onToken(new Token(this)); }\n\n  this.lastTokEnd = this.end;\n  this.lastTokStart = this.start;\n  this.lastTokEndLoc = this.endLoc;\n  this.lastTokStartLoc = this.startLoc;\n  this.nextToken();\n};\n\npp.getToken = function() {\n  this.next();\n  return new Token(this)\n};\n\n// If we're in an ES6 environment, make parsers iterable\nif (typeof Symbol !== \"undefined\")\n  { pp[Symbol.iterator] = function() {\n    var this$1$1 = this;\n\n    return {\n      next: function () {\n        var token = this$1$1.getToken();\n        return {\n          done: token.type === types$1.eof,\n          value: token\n        }\n      }\n    }\n  }; }\n\n// Toggle strict mode. Re-reads the next number or string to please\n// pedantic tests (`\"use strict\"; 010;` should fail).\n\n// Read a single token, updating the parser object's token-related\n// properties.\n\npp.nextToken = function() {\n  var curContext = this.curContext();\n  if (!curContext || !curContext.preserveSpace) { this.skipSpace(); }\n\n  this.start = this.pos;\n  if (this.options.locations) { this.startLoc = this.curPosition(); }\n  if (this.pos >= this.input.length) { return this.finishToken(types$1.eof) }\n\n  if (curContext.override) { return curContext.override(this) }\n  else { this.readToken(this.fullCharCodeAtPos()); }\n};\n\npp.readToken = function(code) {\n  // Identifier or keyword. '\\uXXXX' sequences are allowed in\n  // identifiers, so '\\' also dispatches to that.\n  if (isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\\' */)\n    { return this.readWord() }\n\n  return this.getTokenFromCode(code)\n};\n\npp.fullCharCodeAtPos = function() {\n  var code = this.input.charCodeAt(this.pos);\n  if (code <= 0xd7ff || code >= 0xdc00) { return code }\n  var next = this.input.charCodeAt(this.pos + 1);\n  return next <= 0xdbff || next >= 0xe000 ? code : (code << 10) + next - 0x35fdc00\n};\n\npp.skipBlockComment = function() {\n  var startLoc = this.options.onComment && this.curPosition();\n  var start = this.pos, end = this.input.indexOf(\"*/\", this.pos += 2);\n  if (end === -1) { this.raise(this.pos - 2, \"Unterminated comment\"); }\n  this.pos = end + 2;\n  if (this.options.locations) {\n    for (var nextBreak = (void 0), pos = start; (nextBreak = nextLineBreak(this.input, pos, this.pos)) > -1;) {\n      ++this.curLine;\n      pos = this.lineStart = nextBreak;\n    }\n  }\n  if (this.options.onComment)\n    { this.options.onComment(true, this.input.slice(start + 2, end), start, this.pos,\n                           startLoc, this.curPosition()); }\n};\n\npp.skipLineComment = function(startSkip) {\n  var start = this.pos;\n  var startLoc = this.options.onComment && this.curPosition();\n  var ch = this.input.charCodeAt(this.pos += startSkip);\n  while (this.pos < this.input.length && !isNewLine(ch)) {\n    ch = this.input.charCodeAt(++this.pos);\n  }\n  if (this.options.onComment)\n    { this.options.onComment(false, this.input.slice(start + startSkip, this.pos), start, this.pos,\n                           startLoc, this.curPosition()); }\n};\n\n// Called at the start of the parse and after every token. Skips\n// whitespace and comments, and.\n\npp.skipSpace = function() {\n  loop: while (this.pos < this.input.length) {\n    var ch = this.input.charCodeAt(this.pos);\n    switch (ch) {\n    case 32: case 160: // ' '\n      ++this.pos;\n      break\n    case 13:\n      if (this.input.charCodeAt(this.pos + 1) === 10) {\n        ++this.pos;\n      }\n    case 10: case 8232: case 8233:\n      ++this.pos;\n      if (this.options.locations) {\n        ++this.curLine;\n        this.lineStart = this.pos;\n      }\n      break\n    case 47: // '/'\n      switch (this.input.charCodeAt(this.pos + 1)) {\n      case 42: // '*'\n        this.skipBlockComment();\n        break\n      case 47:\n        this.skipLineComment(2);\n        break\n      default:\n        break loop\n      }\n      break\n    default:\n      if (ch > 8 && ch < 14 || ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) {\n        ++this.pos;\n      } else {\n        break loop\n      }\n    }\n  }\n};\n\n// Called at the end of every token. Sets `end`, `val`, and\n// maintains `context` and `exprAllowed`, and skips the space after\n// the token, so that the next one's `start` will point at the\n// right position.\n\npp.finishToken = function(type, val) {\n  this.end = this.pos;\n  if (this.options.locations) { this.endLoc = this.curPosition(); }\n  var prevType = this.type;\n  this.type = type;\n  this.value = val;\n\n  this.updateContext(prevType);\n};\n\n// ### Token reading\n\n// This is the function that is called to fetch the next token. It\n// is somewhat obscure, because it works in character codes rather\n// than characters, and because operator parsing has been inlined\n// into it.\n//\n// All in the name of speed.\n//\npp.readToken_dot = function() {\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next >= 48 && next <= 57) { return this.readNumber(true) }\n  var next2 = this.input.charCodeAt(this.pos + 2);\n  if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) { // 46 = dot '.'\n    this.pos += 3;\n    return this.finishToken(types$1.ellipsis)\n  } else {\n    ++this.pos;\n    return this.finishToken(types$1.dot)\n  }\n};\n\npp.readToken_slash = function() { // '/'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (this.exprAllowed) { ++this.pos; return this.readRegexp() }\n  if (next === 61) { return this.finishOp(types$1.assign, 2) }\n  return this.finishOp(types$1.slash, 1)\n};\n\npp.readToken_mult_modulo_exp = function(code) { // '%*'\n  var next = this.input.charCodeAt(this.pos + 1);\n  var size = 1;\n  var tokentype = code === 42 ? types$1.star : types$1.modulo;\n\n  // exponentiation operator ** and **=\n  if (this.options.ecmaVersion >= 7 && code === 42 && next === 42) {\n    ++size;\n    tokentype = types$1.starstar;\n    next = this.input.charCodeAt(this.pos + 2);\n  }\n\n  if (next === 61) { return this.finishOp(types$1.assign, size + 1) }\n  return this.finishOp(tokentype, size)\n};\n\npp.readToken_pipe_amp = function(code) { // '|&'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === code) {\n    if (this.options.ecmaVersion >= 12) {\n      var next2 = this.input.charCodeAt(this.pos + 2);\n      if (next2 === 61) { return this.finishOp(types$1.assign, 3) }\n    }\n    return this.finishOp(code === 124 ? types$1.logicalOR : types$1.logicalAND, 2)\n  }\n  if (next === 61) { return this.finishOp(types$1.assign, 2) }\n  return this.finishOp(code === 124 ? types$1.bitwiseOR : types$1.bitwiseAND, 1)\n};\n\npp.readToken_caret = function() { // '^'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === 61) { return this.finishOp(types$1.assign, 2) }\n  return this.finishOp(types$1.bitwiseXOR, 1)\n};\n\npp.readToken_plus_min = function(code) { // '+-'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === code) {\n    if (next === 45 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 62 &&\n        (this.lastTokEnd === 0 || lineBreak.test(this.input.slice(this.lastTokEnd, this.pos)))) {\n      // A `-->` line comment\n      this.skipLineComment(3);\n      this.skipSpace();\n      return this.nextToken()\n    }\n    return this.finishOp(types$1.incDec, 2)\n  }\n  if (next === 61) { return this.finishOp(types$1.assign, 2) }\n  return this.finishOp(types$1.plusMin, 1)\n};\n\npp.readToken_lt_gt = function(code) { // '<>'\n  var next = this.input.charCodeAt(this.pos + 1);\n  var size = 1;\n  if (next === code) {\n    size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2;\n    if (this.input.charCodeAt(this.pos + size) === 61) { return this.finishOp(types$1.assign, size + 1) }\n    return this.finishOp(types$1.bitShift, size)\n  }\n  if (next === 33 && code === 60 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 45 &&\n      this.input.charCodeAt(this.pos + 3) === 45) {\n    // `<!--`, an XML-style comment that should be interpreted as a line comment\n    this.skipLineComment(4);\n    this.skipSpace();\n    return this.nextToken()\n  }\n  if (next === 61) { size = 2; }\n  return this.finishOp(types$1.relational, size)\n};\n\npp.readToken_eq_excl = function(code) { // '=!'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === 61) { return this.finishOp(types$1.equality, this.input.charCodeAt(this.pos + 2) === 61 ? 3 : 2) }\n  if (code === 61 && next === 62 && this.options.ecmaVersion >= 6) { // '=>'\n    this.pos += 2;\n    return this.finishToken(types$1.arrow)\n  }\n  return this.finishOp(code === 61 ? types$1.eq : types$1.prefix, 1)\n};\n\npp.readToken_question = function() { // '?'\n  var ecmaVersion = this.options.ecmaVersion;\n  if (ecmaVersion >= 11) {\n    var next = this.input.charCodeAt(this.pos + 1);\n    if (next === 46) {\n      var next2 = this.input.charCodeAt(this.pos + 2);\n      if (next2 < 48 || next2 > 57) { return this.finishOp(types$1.questionDot, 2) }\n    }\n    if (next === 63) {\n      if (ecmaVersion >= 12) {\n        var next2$1 = this.input.charCodeAt(this.pos + 2);\n        if (next2$1 === 61) { return this.finishOp(types$1.assign, 3) }\n      }\n      return this.finishOp(types$1.coalesce, 2)\n    }\n  }\n  return this.finishOp(types$1.question, 1)\n};\n\npp.readToken_numberSign = function() { // '#'\n  var ecmaVersion = this.options.ecmaVersion;\n  var code = 35; // '#'\n  if (ecmaVersion >= 13) {\n    ++this.pos;\n    code = this.fullCharCodeAtPos();\n    if (isIdentifierStart(code, true) || code === 92 /* '\\' */) {\n      return this.finishToken(types$1.privateId, this.readWord1())\n    }\n  }\n\n  this.raise(this.pos, \"Unexpected character '\" + codePointToString(code) + \"'\");\n};\n\npp.getTokenFromCode = function(code) {\n  switch (code) {\n  // The interpretation of a dot depends on whether it is followed\n  // by a digit or another two dots.\n  case 46: // '.'\n    return this.readToken_dot()\n\n  // Punctuation tokens.\n  case 40: ++this.pos; return this.finishToken(types$1.parenL)\n  case 41: ++this.pos; return this.finishToken(types$1.parenR)\n  case 59: ++this.pos; return this.finishToken(types$1.semi)\n  case 44: ++this.pos; return this.finishToken(types$1.comma)\n  case 91: ++this.pos; return this.finishToken(types$1.bracketL)\n  case 93: ++this.pos; return this.finishToken(types$1.bracketR)\n  case 123: ++this.pos; return this.finishToken(types$1.braceL)\n  case 125: ++this.pos; return this.finishToken(types$1.braceR)\n  case 58: ++this.pos; return this.finishToken(types$1.colon)\n\n  case 96: // '`'\n    if (this.options.ecmaVersion < 6) { break }\n    ++this.pos;\n    return this.finishToken(types$1.backQuote)\n\n  case 48: // '0'\n    var next = this.input.charCodeAt(this.pos + 1);\n    if (next === 120 || next === 88) { return this.readRadixNumber(16) } // '0x', '0X' - hex number\n    if (this.options.ecmaVersion >= 6) {\n      if (next === 111 || next === 79) { return this.readRadixNumber(8) } // '0o', '0O' - octal number\n      if (next === 98 || next === 66) { return this.readRadixNumber(2) } // '0b', '0B' - binary number\n    }\n\n  // Anything else beginning with a digit is an integer, octal\n  // number, or float.\n  case 49: case 50: case 51: case 52: case 53: case 54: case 55: case 56: case 57: // 1-9\n    return this.readNumber(false)\n\n  // Quotes produce strings.\n  case 34: case 39: // '\"', \"'\"\n    return this.readString(code)\n\n  // Operators are parsed inline in tiny state machines. '=' (61) is\n  // often referred to. `finishOp` simply skips the amount of\n  // characters it is given as second argument, and returns a token\n  // of the type given by its first argument.\n  case 47: // '/'\n    return this.readToken_slash()\n\n  case 37: case 42: // '%*'\n    return this.readToken_mult_modulo_exp(code)\n\n  case 124: case 38: // '|&'\n    return this.readToken_pipe_amp(code)\n\n  case 94: // '^'\n    return this.readToken_caret()\n\n  case 43: case 45: // '+-'\n    return this.readToken_plus_min(code)\n\n  case 60: case 62: // '<>'\n    return this.readToken_lt_gt(code)\n\n  case 61: case 33: // '=!'\n    return this.readToken_eq_excl(code)\n\n  case 63: // '?'\n    return this.readToken_question()\n\n  case 126: // '~'\n    return this.finishOp(types$1.prefix, 1)\n\n  case 35: // '#'\n    return this.readToken_numberSign()\n  }\n\n  this.raise(this.pos, \"Unexpected character '\" + codePointToString(code) + \"'\");\n};\n\npp.finishOp = function(type, size) {\n  var str = this.input.slice(this.pos, this.pos + size);\n  this.pos += size;\n  return this.finishToken(type, str)\n};\n\npp.readRegexp = function() {\n  var escaped, inClass, start = this.pos;\n  for (;;) {\n    if (this.pos >= this.input.length) { this.raise(start, \"Unterminated regular expression\"); }\n    var ch = this.input.charAt(this.pos);\n    if (lineBreak.test(ch)) { this.raise(start, \"Unterminated regular expression\"); }\n    if (!escaped) {\n      if (ch === \"[\") { inClass = true; }\n      else if (ch === \"]\" && inClass) { inClass = false; }\n      else if (ch === \"/\" && !inClass) { break }\n      escaped = ch === \"\\\\\";\n    } else { escaped = false; }\n    ++this.pos;\n  }\n  var pattern = this.input.slice(start, this.pos);\n  ++this.pos;\n  var flagsStart = this.pos;\n  var flags = this.readWord1();\n  if (this.containsEsc) { this.unexpected(flagsStart); }\n\n  // Validate pattern\n  var state = this.regexpState || (this.regexpState = new RegExpValidationState(this));\n  state.reset(start, pattern, flags);\n  this.validateRegExpFlags(state);\n  this.validateRegExpPattern(state);\n\n  // Create Literal#value property value.\n  var value = null;\n  try {\n    value = new RegExp(pattern, flags);\n  } catch (e) {\n    // ESTree requires null if it failed to instantiate RegExp object.\n    // https://github.com/estree/estree/blob/a27003adf4fd7bfad44de9cef372a2eacd527b1c/es5.md#regexpliteral\n  }\n\n  return this.finishToken(types$1.regexp, {pattern: pattern, flags: flags, value: value})\n};\n\n// Read an integer in the given radix. Return null if zero digits\n// were read, the integer value otherwise. When `len` is given, this\n// will return `null` unless the integer has exactly `len` digits.\n\npp.readInt = function(radix, len, maybeLegacyOctalNumericLiteral) {\n  // `len` is used for character escape sequences. In that case, disallow separators.\n  var allowSeparators = this.options.ecmaVersion >= 12 && len === undefined;\n\n  // `maybeLegacyOctalNumericLiteral` is true if it doesn't have prefix (0x,0o,0b)\n  // and isn't fraction part nor exponent part. In that case, if the first digit\n  // is zero then disallow separators.\n  var isLegacyOctalNumericLiteral = maybeLegacyOctalNumericLiteral && this.input.charCodeAt(this.pos) === 48;\n\n  var start = this.pos, total = 0, lastCode = 0;\n  for (var i = 0, e = len == null ? Infinity : len; i < e; ++i, ++this.pos) {\n    var code = this.input.charCodeAt(this.pos), val = (void 0);\n\n    if (allowSeparators && code === 95) {\n      if (isLegacyOctalNumericLiteral) { this.raiseRecoverable(this.pos, \"Numeric separator is not allowed in legacy octal numeric literals\"); }\n      if (lastCode === 95) { this.raiseRecoverable(this.pos, \"Numeric separator must be exactly one underscore\"); }\n      if (i === 0) { this.raiseRecoverable(this.pos, \"Numeric separator is not allowed at the first of digits\"); }\n      lastCode = code;\n      continue\n    }\n\n    if (code >= 97) { val = code - 97 + 10; } // a\n    else if (code >= 65) { val = code - 65 + 10; } // A\n    else if (code >= 48 && code <= 57) { val = code - 48; } // 0-9\n    else { val = Infinity; }\n    if (val >= radix) { break }\n    lastCode = code;\n    total = total * radix + val;\n  }\n\n  if (allowSeparators && lastCode === 95) { this.raiseRecoverable(this.pos - 1, \"Numeric separator is not allowed at the last of digits\"); }\n  if (this.pos === start || len != null && this.pos - start !== len) { return null }\n\n  return total\n};\n\nfunction stringToNumber(str, isLegacyOctalNumericLiteral) {\n  if (isLegacyOctalNumericLiteral) {\n    return parseInt(str, 8)\n  }\n\n  // `parseFloat(value)` stops parsing at the first numeric separator then returns a wrong value.\n  return parseFloat(str.replace(/_/g, \"\"))\n}\n\nfunction stringToBigInt(str) {\n  if (typeof BigInt !== \"function\") {\n    return null\n  }\n\n  // `BigInt(value)` throws syntax error if the string contains numeric separators.\n  return BigInt(str.replace(/_/g, \"\"))\n}\n\npp.readRadixNumber = function(radix) {\n  var start = this.pos;\n  this.pos += 2; // 0x\n  var val = this.readInt(radix);\n  if (val == null) { this.raise(this.start + 2, \"Expected number in radix \" + radix); }\n  if (this.options.ecmaVersion >= 11 && this.input.charCodeAt(this.pos) === 110) {\n    val = stringToBigInt(this.input.slice(start, this.pos));\n    ++this.pos;\n  } else if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, \"Identifier directly after number\"); }\n  return this.finishToken(types$1.num, val)\n};\n\n// Read an integer, octal integer, or floating-point number.\n\npp.readNumber = function(startsWithDot) {\n  var start = this.pos;\n  if (!startsWithDot && this.readInt(10, undefined, true) === null) { this.raise(start, \"Invalid number\"); }\n  var octal = this.pos - start >= 2 && this.input.charCodeAt(start) === 48;\n  if (octal && this.strict) { this.raise(start, \"Invalid number\"); }\n  var next = this.input.charCodeAt(this.pos);\n  if (!octal && !startsWithDot && this.options.ecmaVersion >= 11 && next === 110) {\n    var val$1 = stringToBigInt(this.input.slice(start, this.pos));\n    ++this.pos;\n    if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, \"Identifier directly after number\"); }\n    return this.finishToken(types$1.num, val$1)\n  }\n  if (octal && /[89]/.test(this.input.slice(start, this.pos))) { octal = false; }\n  if (next === 46 && !octal) { // '.'\n    ++this.pos;\n    this.readInt(10);\n    next = this.input.charCodeAt(this.pos);\n  }\n  if ((next === 69 || next === 101) && !octal) { // 'eE'\n    next = this.input.charCodeAt(++this.pos);\n    if (next === 43 || next === 45) { ++this.pos; } // '+-'\n    if (this.readInt(10) === null) { this.raise(start, \"Invalid number\"); }\n  }\n  if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, \"Identifier directly after number\"); }\n\n  var val = stringToNumber(this.input.slice(start, this.pos), octal);\n  return this.finishToken(types$1.num, val)\n};\n\n// Read a string value, interpreting backslash-escapes.\n\npp.readCodePoint = function() {\n  var ch = this.input.charCodeAt(this.pos), code;\n\n  if (ch === 123) { // '{'\n    if (this.options.ecmaVersion < 6) { this.unexpected(); }\n    var codePos = ++this.pos;\n    code = this.readHexChar(this.input.indexOf(\"}\", this.pos) - this.pos);\n    ++this.pos;\n    if (code > 0x10FFFF) { this.invalidStringToken(codePos, \"Code point out of bounds\"); }\n  } else {\n    code = this.readHexChar(4);\n  }\n  return code\n};\n\nfunction codePointToString(code) {\n  // UTF-16 Decoding\n  if (code <= 0xFFFF) { return String.fromCharCode(code) }\n  code -= 0x10000;\n  return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00)\n}\n\npp.readString = function(quote) {\n  var out = \"\", chunkStart = ++this.pos;\n  for (;;) {\n    if (this.pos >= this.input.length) { this.raise(this.start, \"Unterminated string constant\"); }\n    var ch = this.input.charCodeAt(this.pos);\n    if (ch === quote) { break }\n    if (ch === 92) { // '\\'\n      out += this.input.slice(chunkStart, this.pos);\n      out += this.readEscapedChar(false);\n      chunkStart = this.pos;\n    } else if (ch === 0x2028 || ch === 0x2029) {\n      if (this.options.ecmaVersion < 10) { this.raise(this.start, \"Unterminated string constant\"); }\n      ++this.pos;\n      if (this.options.locations) {\n        this.curLine++;\n        this.lineStart = this.pos;\n      }\n    } else {\n      if (isNewLine(ch)) { this.raise(this.start, \"Unterminated string constant\"); }\n      ++this.pos;\n    }\n  }\n  out += this.input.slice(chunkStart, this.pos++);\n  return this.finishToken(types$1.string, out)\n};\n\n// Reads template string tokens.\n\nvar INVALID_TEMPLATE_ESCAPE_ERROR = {};\n\npp.tryReadTemplateToken = function() {\n  this.inTemplateElement = true;\n  try {\n    this.readTmplToken();\n  } catch (err) {\n    if (err === INVALID_TEMPLATE_ESCAPE_ERROR) {\n      this.readInvalidTemplateToken();\n    } else {\n      throw err\n    }\n  }\n\n  this.inTemplateElement = false;\n};\n\npp.invalidStringToken = function(position, message) {\n  if (this.inTemplateElement && this.options.ecmaVersion >= 9) {\n    throw INVALID_TEMPLATE_ESCAPE_ERROR\n  } else {\n    this.raise(position, message);\n  }\n};\n\npp.readTmplToken = function() {\n  var out = \"\", chunkStart = this.pos;\n  for (;;) {\n    if (this.pos >= this.input.length) { this.raise(this.start, \"Unterminated template\"); }\n    var ch = this.input.charCodeAt(this.pos);\n    if (ch === 96 || ch === 36 && this.input.charCodeAt(this.pos + 1) === 123) { // '`', '${'\n      if (this.pos === this.start && (this.type === types$1.template || this.type === types$1.invalidTemplate)) {\n        if (ch === 36) {\n          this.pos += 2;\n          return this.finishToken(types$1.dollarBraceL)\n        } else {\n          ++this.pos;\n          return this.finishToken(types$1.backQuote)\n        }\n      }\n      out += this.input.slice(chunkStart, this.pos);\n      return this.finishToken(types$1.template, out)\n    }\n    if (ch === 92) { // '\\'\n      out += this.input.slice(chunkStart, this.pos);\n      out += this.readEscapedChar(true);\n      chunkStart = this.pos;\n    } else if (isNewLine(ch)) {\n      out += this.input.slice(chunkStart, this.pos);\n      ++this.pos;\n      switch (ch) {\n      case 13:\n        if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; }\n      case 10:\n        out += \"\\n\";\n        break\n      default:\n        out += String.fromCharCode(ch);\n        break\n      }\n      if (this.options.locations) {\n        ++this.curLine;\n        this.lineStart = this.pos;\n      }\n      chunkStart = this.pos;\n    } else {\n      ++this.pos;\n    }\n  }\n};\n\n// Reads a template token to search for the end, without validating any escape sequences\npp.readInvalidTemplateToken = function() {\n  for (; this.pos < this.input.length; this.pos++) {\n    switch (this.input[this.pos]) {\n    case \"\\\\\":\n      ++this.pos;\n      break\n\n    case \"$\":\n      if (this.input[this.pos + 1] !== \"{\") {\n        break\n      }\n\n    // falls through\n    case \"`\":\n      return this.finishToken(types$1.invalidTemplate, this.input.slice(this.start, this.pos))\n\n    // no default\n    }\n  }\n  this.raise(this.start, \"Unterminated template\");\n};\n\n// Used to read escaped characters\n\npp.readEscapedChar = function(inTemplate) {\n  var ch = this.input.charCodeAt(++this.pos);\n  ++this.pos;\n  switch (ch) {\n  case 110: return \"\\n\" // 'n' -> '\\n'\n  case 114: return \"\\r\" // 'r' -> '\\r'\n  case 120: return String.fromCharCode(this.readHexChar(2)) // 'x'\n  case 117: return codePointToString(this.readCodePoint()) // 'u'\n  case 116: return \"\\t\" // 't' -> '\\t'\n  case 98: return \"\\b\" // 'b' -> '\\b'\n  case 118: return \"\\u000b\" // 'v' -> '\\u000b'\n  case 102: return \"\\f\" // 'f' -> '\\f'\n  case 13: if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; } // '\\r\\n'\n  case 10: // ' \\n'\n    if (this.options.locations) { this.lineStart = this.pos; ++this.curLine; }\n    return \"\"\n  case 56:\n  case 57:\n    if (this.strict) {\n      this.invalidStringToken(\n        this.pos - 1,\n        \"Invalid escape sequence\"\n      );\n    }\n    if (inTemplate) {\n      var codePos = this.pos - 1;\n\n      this.invalidStringToken(\n        codePos,\n        \"Invalid escape sequence in template string\"\n      );\n\n      return null\n    }\n  default:\n    if (ch >= 48 && ch <= 55) {\n      var octalStr = this.input.substr(this.pos - 1, 3).match(/^[0-7]+/)[0];\n      var octal = parseInt(octalStr, 8);\n      if (octal > 255) {\n        octalStr = octalStr.slice(0, -1);\n        octal = parseInt(octalStr, 8);\n      }\n      this.pos += octalStr.length - 1;\n      ch = this.input.charCodeAt(this.pos);\n      if ((octalStr !== \"0\" || ch === 56 || ch === 57) && (this.strict || inTemplate)) {\n        this.invalidStringToken(\n          this.pos - 1 - octalStr.length,\n          inTemplate\n            ? \"Octal literal in template string\"\n            : \"Octal literal in strict mode\"\n        );\n      }\n      return String.fromCharCode(octal)\n    }\n    if (isNewLine(ch)) {\n      // Unicode new line characters after \\ get removed from output in both\n      // template literals and strings\n      return \"\"\n    }\n    return String.fromCharCode(ch)\n  }\n};\n\n// Used to read character escape sequences ('\\x', '\\u', '\\U').\n\npp.readHexChar = function(len) {\n  var codePos = this.pos;\n  var n = this.readInt(16, len);\n  if (n === null) { this.invalidStringToken(codePos, \"Bad character escape sequence\"); }\n  return n\n};\n\n// Read an identifier, and return it as a string. Sets `this.containsEsc`\n// to whether the word contained a '\\u' escape.\n//\n// Incrementally adds only escaped chars, adding other chunks as-is\n// as a micro-optimization.\n\npp.readWord1 = function() {\n  this.containsEsc = false;\n  var word = \"\", first = true, chunkStart = this.pos;\n  var astral = this.options.ecmaVersion >= 6;\n  while (this.pos < this.input.length) {\n    var ch = this.fullCharCodeAtPos();\n    if (isIdentifierChar(ch, astral)) {\n      this.pos += ch <= 0xffff ? 1 : 2;\n    } else if (ch === 92) { // \"\\\"\n      this.containsEsc = true;\n      word += this.input.slice(chunkStart, this.pos);\n      var escStart = this.pos;\n      if (this.input.charCodeAt(++this.pos) !== 117) // \"u\"\n        { this.invalidStringToken(this.pos, \"Expecting Unicode escape sequence \\\\uXXXX\"); }\n      ++this.pos;\n      var esc = this.readCodePoint();\n      if (!(first ? isIdentifierStart : isIdentifierChar)(esc, astral))\n        { this.invalidStringToken(escStart, \"Invalid Unicode escape\"); }\n      word += codePointToString(esc);\n      chunkStart = this.pos;\n    } else {\n      break\n    }\n    first = false;\n  }\n  return word + this.input.slice(chunkStart, this.pos)\n};\n\n// Read an identifier or keyword token. Will check for reserved\n// words when necessary.\n\npp.readWord = function() {\n  var word = this.readWord1();\n  var type = types$1.name;\n  if (this.keywords.test(word)) {\n    type = keywords[word];\n  }\n  return this.finishToken(type, word)\n};\n\n// Acorn is a tiny, fast JavaScript parser written in JavaScript.\n\nvar version = \"8.7.0\";\n\nParser.acorn = {\n  Parser: Parser,\n  version: version,\n  defaultOptions: defaultOptions,\n  Position: Position,\n  SourceLocation: SourceLocation,\n  getLineInfo: getLineInfo,\n  Node: Node,\n  TokenType: TokenType,\n  tokTypes: types$1,\n  keywordTypes: keywords,\n  TokContext: TokContext,\n  tokContexts: types,\n  isIdentifierChar: isIdentifierChar,\n  isIdentifierStart: isIdentifierStart,\n  Token: Token,\n  isNewLine: isNewLine,\n  lineBreak: lineBreak,\n  lineBreakG: lineBreakG,\n  nonASCIIwhitespace: nonASCIIwhitespace\n};\n\n// The main exported interface (under `self.acorn` when in the\n// browser) is a `parse` function that takes a code string and\n// returns an abstract syntax tree as specified by [Mozilla parser\n// API][api].\n//\n// [api]: https://developer.mozilla.org/en-US/docs/SpiderMonkey/Parser_API\n\nfunction parse(input, options) {\n  return Parser.parse(input, options)\n}\n\n// This function tries to parse a single expression at a given\n// offset in a string. Useful for parsing mixed-language formats\n// that embed JavaScript expressions.\n\nfunction parseExpressionAt(input, pos, options) {\n  return Parser.parseExpressionAt(input, pos, options)\n}\n\n// Acorn is organized as a tokenizer and a recursive-descent parser.\n// The `tokenizer` export provides an interface to the tokenizer.\n\nfunction tokenizer(input, options) {\n  return Parser.tokenizer(input, options)\n}\n\nexport { Node, Parser, Position, SourceLocation, TokContext, Token, TokenType, defaultOptions, getLineInfo, isIdentifierChar, isIdentifierStart, isNewLine, keywords as keywordTypes, lineBreak, lineBreakG, nonASCIIwhitespace, parse, parseExpressionAt, types as tokContexts, types$1 as tokTypes, tokenizer, version };\n", "export type SourceMapSegment =\n\t| [number]\n\t| [number, number, number, number]\n\t| [number, number, number, number, number];\nexport type SourceMapLine = SourceMapSegment[];\nexport type SourceMapMappings = SourceMapLine[];\n\nconst charToInteger: { [charCode: number]: number } = {};\nconst chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';\n\nfor (let i = 0; i < chars.length; i++) {\n\tcharToInteger[chars.charCodeAt(i)] = i;\n}\n\nexport function decode(mappings: string): SourceMapMappings {\n\tconst decoded: SourceMapMappings = [];\n\tlet line: SourceMapLine = [];\n\tconst segment: SourceMapSegment = [\n\t\t0, // generated code column\n\t\t0, // source file index\n\t\t0, // source code line\n\t\t0, // source code column\n\t\t0, // name index\n\t];\n\n\tlet j = 0;\n\tfor (let i = 0, shift = 0, value = 0; i < mappings.length; i++) {\n\t\tconst c = mappings.charCodeAt(i);\n\n\t\tif (c === 44) { // \",\"\n\t\t\tsegmentify(line, segment, j);\n\t\t\tj = 0;\n\n\t\t} else if (c === 59) { // \";\"\n\t\t\tsegmentify(line, segment, j);\n\t\t\tj = 0;\n\t\t\tdecoded.push(line);\n\t\t\tline = [];\n\t\t\tsegment[0] = 0;\n\n\t\t} else {\n\t\t\tlet integer = charToInteger[c];\n\t\t\tif (integer === undefined) {\n\t\t\t\tthrow new Error('Invalid character (' + String.fromCharCode(c) + ')');\n\t\t\t}\n\n\t\t\tconst hasContinuationBit = integer & 32;\n\n\t\t\tinteger &= 31;\n\t\t\tvalue += integer << shift;\n\n\t\t\tif (hasContinuationBit) {\n\t\t\t\tshift += 5;\n\t\t\t} else {\n\t\t\t\tconst shouldNegate = value & 1;\n\t\t\t\tvalue >>>= 1;\n\n\t\t\t\tif (shouldNegate) {\n\t\t\t\t\tvalue = value === 0 ? -0x80000000 : -value;\n\t\t\t\t}\n\n\t\t\t\tsegment[j] += value;\n\t\t\t\tj++;\n\t\t\t\tvalue = shift = 0; // reset\n\t\t\t}\n\t\t}\n\t}\n\n\tsegmentify(line, segment, j);\n\tdecoded.push(line);\n\n\treturn decoded;\n}\n\nfunction segmentify(line: SourceMapSegment[], segment: SourceMapSegment, j: number) {\n\t// This looks ugly, but we're creating specialized arrays with a specific\n\t// length. This is much faster than creating a new array (which v8 expands to\n\t// a capacity of 17 after pushing the first item), or slicing out a subarray\n\t// (which is slow). Length 4 is assumed to be the most frequent, followed by\n\t// length 5 (since not everything will have an associated name), followed by\n\t// length 1 (it's probably rare for a source substring to not have an\n\t// associated segment data).\n\tif (j === 4) line.push([segment[0], segment[1], segment[2], segment[3]]);\n\telse if (j === 5) line.push([segment[0], segment[1], segment[2], segment[3], segment[4]]);\n\telse if (j === 1) line.push([segment[0]]);\n}\n\nexport function encode(decoded: SourceMapMappings): string {\n\tlet sourceFileIndex = 0;  // second field\n\tlet sourceCodeLine = 0;   // third field\n\tlet sourceCodeColumn = 0; // fourth field\n\tlet nameIndex = 0;        // fifth field\n\tlet mappings = '';\n\n\tfor (let i = 0; i < decoded.length; i++) {\n\t\tconst line = decoded[i];\n\t\tif (i > 0) mappings += ';';\n\t\tif (line.length === 0) continue;\n\n\t\tlet generatedCodeColumn = 0; // first field\n\n\t\tconst lineMappings: string[] = [];\n\n\t\tfor (const segment of line) {\n\t\t\tlet segmentMappings = encodeInteger(segment[0] - generatedCodeColumn);\n\t\t\tgeneratedCodeColumn = segment[0];\n\n\t\t\tif (segment.length > 1) {\n\t\t\t\tsegmentMappings +=\n\t\t\t\t\tencodeInteger(segment[1] - sourceFileIndex) +\n\t\t\t\t\tencodeInteger(segment[2] - sourceCodeLine) +\n\t\t\t\t\tencodeInteger(segment[3] - sourceCodeColumn);\n\n\t\t\t\tsourceFileIndex = segment[1];\n\t\t\t\tsourceCodeLine = segment[2];\n\t\t\t\tsourceCodeColumn = segment[3];\n\t\t\t}\n\n\t\t\tif (segment.length === 5) {\n\t\t\t\tsegmentMappings += encodeInteger(segment[4] - nameIndex);\n\t\t\t\tnameIndex = segment[4];\n\t\t\t}\n\n\t\t\tlineMappings.push(segmentMappings);\n\t\t}\n\n\t\tmappings += lineMappings.join(',');\n\t}\n\n\treturn mappings;\n}\n\nfunction encodeInteger(num: number): string {\n\tvar result = '';\n\tnum = num < 0 ? (-num << 1) | 1 : num << 1;\n\tdo {\n\t\tvar clamped = num & 31;\n\t\tnum >>>= 5;\n\t\tif (num > 0) {\n\t\t\tclamped |= 32;\n\t\t}\n\t\tresult += chars[clamped];\n\t} while (num > 0);\n\n\treturn result;\n}\n", "export default class BitSet {\n\tconstructor(arg) {\n\t\tthis.bits = arg instanceof BitSet ? arg.bits.slice() : [];\n\t}\n\n\tadd(n) {\n\t\tthis.bits[n >> 5] |= 1 << (n & 31);\n\t}\n\n\thas(n) {\n\t\treturn !!(this.bits[n >> 5] & (1 << (n & 31)));\n\t}\n}", "export default class Chunk {\n\tconstructor(start, end, content) {\n\t\tthis.start = start;\n\t\tthis.end = end;\n\t\tthis.original = content;\n\n\t\tthis.intro = '';\n\t\tthis.outro = '';\n\n\t\tthis.content = content;\n\t\tthis.storeName = false;\n\t\tthis.edited = false;\n\n\t\t// we make these non-enumerable, for sanity while debugging\n\t\tObject.defineProperties(this, {\n\t\t\tprevious: { writable: true, value: null },\n\t\t\tnext:     { writable: true, value: null }\n\t\t});\n\t}\n\n\tappendLeft(content) {\n\t\tthis.outro += content;\n\t}\n\n\tappendRight(content) {\n\t\tthis.intro = this.intro + content;\n\t}\n\n\tclone() {\n\t\tconst chunk = new Chunk(this.start, this.end, this.original);\n\n\t\tchunk.intro = this.intro;\n\t\tchunk.outro = this.outro;\n\t\tchunk.content = this.content;\n\t\tchunk.storeName = this.storeName;\n\t\tchunk.edited = this.edited;\n\n\t\treturn chunk;\n\t}\n\n\tcontains(index) {\n\t\treturn this.start < index && index < this.end;\n\t}\n\n\teachNext(fn) {\n\t\tlet chunk = this;\n\t\twhile (chunk) {\n\t\t\tfn(chunk);\n\t\t\tchunk = chunk.next;\n\t\t}\n\t}\n\n\teachPrevious(fn) {\n\t\tlet chunk = this;\n\t\twhile (chunk) {\n\t\t\tfn(chunk);\n\t\t\tchunk = chunk.previous;\n\t\t}\n\t}\n\n\tedit(content, storeName, contentOnly) {\n\t\tthis.content = content;\n\t\tif (!contentOnly) {\n\t\t\tthis.intro = '';\n\t\t\tthis.outro = '';\n\t\t}\n\t\tthis.storeName = storeName;\n\n\t\tthis.edited = true;\n\n\t\treturn this;\n\t}\n\n\tprependLeft(content) {\n\t\tthis.outro = content + this.outro;\n\t}\n\n\tprependRight(content) {\n\t\tthis.intro = content + this.intro;\n\t}\n\n\tsplit(index) {\n\t\tconst sliceIndex = index - this.start;\n\n\t\tconst originalBefore = this.original.slice(0, sliceIndex);\n\t\tconst originalAfter = this.original.slice(sliceIndex);\n\n\t\tthis.original = originalBefore;\n\n\t\tconst newChunk = new Chunk(index, this.end, originalAfter);\n\t\tnewChunk.outro = this.outro;\n\t\tthis.outro = '';\n\n\t\tthis.end = index;\n\n\t\tif (this.edited) {\n\t\t\t// TODO is this block necessary?...\n\t\t\tnewChunk.edit('', false);\n\t\t\tthis.content = '';\n\t\t} else {\n\t\t\tthis.content = originalBefore;\n\t\t}\n\n\t\tnewChunk.next = this.next;\n\t\tif (newChunk.next) newChunk.next.previous = newChunk;\n\t\tnewChunk.previous = this;\n\t\tthis.next = newChunk;\n\n\t\treturn newChunk;\n\t}\n\n\ttoString() {\n\t\treturn this.intro + this.content + this.outro;\n\t}\n\n\ttrimEnd(rx) {\n\t\tthis.outro = this.outro.replace(rx, '');\n\t\tif (this.outro.length) return true;\n\n\t\tconst trimmed = this.content.replace(rx, '');\n\n\t\tif (trimmed.length) {\n\t\t\tif (trimmed !== this.content) {\n\t\t\t\tthis.split(this.start + trimmed.length).edit('', undefined, true);\n\t\t\t}\n\t\t\treturn true;\n\n\t\t} else {\n\t\t\tthis.edit('', undefined, true);\n\n\t\t\tthis.intro = this.intro.replace(rx, '');\n\t\t\tif (this.intro.length) return true;\n\t\t}\n\t}\n\n\ttrimStart(rx) {\n\t\tthis.intro = this.intro.replace(rx, '');\n\t\tif (this.intro.length) return true;\n\n\t\tconst trimmed = this.content.replace(rx, '');\n\n\t\tif (trimmed.length) {\n\t\t\tif (trimmed !== this.content) {\n\t\t\t\tthis.split(this.end - trimmed.length);\n\t\t\t\tthis.edit('', undefined, true);\n\t\t\t}\n\t\t\treturn true;\n\n\t\t} else {\n\t\t\tthis.edit('', undefined, true);\n\n\t\t\tthis.outro = this.outro.replace(rx, '');\n\t\t\tif (this.outro.length) return true;\n\t\t}\n\t}\n}\n", "import { encode } from 'sourcemap-codec';\n\nlet btoa = () => {\n\tthrow new Error('Unsupported environment: `window.btoa` or `Buffer` should be supported.');\n};\nif (typeof window !== 'undefined' && typeof window.btoa === 'function') {\n\tbtoa = str => window.btoa(unescape(encodeURIComponent(str)));\n} else if (typeof Buffer === 'function') {\n\tbtoa = str => Buffer.from(str, 'utf-8').toString('base64');\n}\n\nexport default class SourceMap {\n\tconstructor(properties) {\n\t\tthis.version = 3;\n\t\tthis.file = properties.file;\n\t\tthis.sources = properties.sources;\n\t\tthis.sourcesContent = properties.sourcesContent;\n\t\tthis.names = properties.names;\n\t\tthis.mappings = encode(properties.mappings);\n\t}\n\n\ttoString() {\n\t\treturn JSON.stringify(this);\n\t}\n\n\ttoUrl() {\n\t\treturn 'data:application/json;charset=utf-8;base64,' + btoa(this.toString());\n\t}\n}\n", "export default function guessIndent(code) {\n\tconst lines = code.split('\\n');\n\n\tconst tabbed = lines.filter(line => /^\\t+/.test(line));\n\tconst spaced = lines.filter(line => /^ {2,}/.test(line));\n\n\tif (tabbed.length === 0 && spaced.length === 0) {\n\t\treturn null;\n\t}\n\n\t// More lines tabbed than spaced? Assume tabs, and\n\t// default to tabs in the case of a tie (or nothing\n\t// to go on)\n\tif (tabbed.length >= spaced.length) {\n\t\treturn '\\t';\n\t}\n\n\t// Otherwise, we need to guess the multiple\n\tconst min = spaced.reduce((previous, current) => {\n\t\tconst numSpaces = /^ +/.exec(current)[0].length;\n\t\treturn Math.min(numSpaces, previous);\n\t}, Infinity);\n\n\treturn new Array(min + 1).join(' ');\n}\n", "export default function getRelativePath(from, to) {\n\tconst fromParts = from.split(/[/\\\\]/);\n\tconst toParts = to.split(/[/\\\\]/);\n\n\tfromParts.pop(); // get dirname\n\n\twhile (fromParts[0] === toParts[0]) {\n\t\tfromParts.shift();\n\t\ttoParts.shift();\n\t}\n\n\tif (fromParts.length) {\n\t\tlet i = fromParts.length;\n\t\twhile (i--) fromParts[i] = '..';\n\t}\n\n\treturn fromParts.concat(toParts).join('/');\n}\n", "const toString = Object.prototype.toString;\n\nexport default function isObject(thing) {\n\treturn toString.call(thing) === '[object Object]';\n}\n", "export default function getLocator(source) {\n\tconst originalLines = source.split('\\n');\n\tconst lineOffsets = [];\n\n\tfor (let i = 0, pos = 0; i < originalLines.length; i++) {\n\t\tlineOffsets.push(pos);\n\t\tpos += originalLines[i].length + 1;\n\t}\n\n\treturn function locate(index) {\n\t\tlet i = 0;\n\t\tlet j = lineOffsets.length;\n\t\twhile (i < j) {\n\t\t\tconst m = (i + j) >> 1;\n\t\t\tif (index < lineOffsets[m]) {\n\t\t\t\tj = m;\n\t\t\t} else {\n\t\t\t\ti = m + 1;\n\t\t\t}\n\t\t}\n\t\tconst line = i - 1;\n\t\tconst column = index - lineOffsets[line];\n\t\treturn { line, column };\n\t};\n}\n", "export default class Mappings {\n\tconstructor(hires) {\n\t\tthis.hires = hires;\n\t\tthis.generatedCodeLine = 0;\n\t\tthis.generatedCodeColumn = 0;\n\t\tthis.raw = [];\n\t\tthis.rawSegments = this.raw[this.generatedCodeLine] = [];\n\t\tthis.pending = null;\n\t}\n\n\taddEdit(sourceIndex, content, loc, nameIndex) {\n\t\tif (content.length) {\n\t\t\tconst segment = [this.generatedCodeColumn, sourceIndex, loc.line, loc.column];\n\t\t\tif (nameIndex >= 0) {\n\t\t\t\tsegment.push(nameIndex);\n\t\t\t}\n\t\t\tthis.rawSegments.push(segment);\n\t\t} else if (this.pending) {\n\t\t\tthis.rawSegments.push(this.pending);\n\t\t}\n\n\t\tthis.advance(content);\n\t\tthis.pending = null;\n\t}\n\n\taddUneditedChunk(sourceIndex, chunk, original, loc, sourcemapLocations) {\n\t\tlet originalCharIndex = chunk.start;\n\t\tlet first = true;\n\n\t\twhile (originalCharIndex < chunk.end) {\n\t\t\tif (this.hires || first || sourcemapLocations.has(originalCharIndex)) {\n\t\t\t\tthis.rawSegments.push([this.generatedCodeColumn, sourceIndex, loc.line, loc.column]);\n\t\t\t}\n\n\t\t\tif (original[originalCharIndex] === '\\n') {\n\t\t\t\tloc.line += 1;\n\t\t\t\tloc.column = 0;\n\t\t\t\tthis.generatedCodeLine += 1;\n\t\t\t\tthis.raw[this.generatedCodeLine] = this.rawSegments = [];\n\t\t\t\tthis.generatedCodeColumn = 0;\n\t\t\t\tfirst = true;\n\t\t\t} else {\n\t\t\t\tloc.column += 1;\n\t\t\t\tthis.generatedCodeColumn += 1;\n\t\t\t\tfirst = false;\n\t\t\t}\n\n\t\t\toriginalCharIndex += 1;\n\t\t}\n\n\t\tthis.pending = null;\n\t}\n\n\tadvance(str) {\n\t\tif (!str) return;\n\n\t\tconst lines = str.split('\\n');\n\n\t\tif (lines.length > 1) {\n\t\t\tfor (let i = 0; i < lines.length - 1; i++) {\n\t\t\t\tthis.generatedCodeLine++;\n\t\t\t\tthis.raw[this.generatedCodeLine] = this.rawSegments = [];\n\t\t\t}\n\t\t\tthis.generatedCodeColumn = 0;\n\t\t}\n\n\t\tthis.generatedCodeColumn += lines[lines.length - 1].length;\n\t}\n}\n", "import BitSet from './BitSet.js';\nimport Chunk from './Chunk.js';\nimport SourceMap from './SourceMap.js';\nimport guessIndent from './utils/guessIndent.js';\nimport getRelativePath from './utils/getRelativePath.js';\nimport isObject from './utils/isObject.js';\nimport getLocator from './utils/getLocator.js';\nimport Mappings from './utils/Mappings.js';\nimport Stats from './utils/Stats.js';\n\nconst n = '\\n';\n\nconst warned = {\n\tinsertLeft: false,\n\tinsertRight: false,\n\tstoreName: false\n};\n\nexport default class MagicString {\n\tconstructor(string, options = {}) {\n\t\tconst chunk = new Chunk(0, string.length, string);\n\n\t\tObject.defineProperties(this, {\n\t\t\toriginal:              { writable: true, value: string },\n\t\t\toutro:                 { writable: true, value: '' },\n\t\t\tintro:                 { writable: true, value: '' },\n\t\t\tfirstChunk:            { writable: true, value: chunk },\n\t\t\tlastChunk:             { writable: true, value: chunk },\n\t\t\tlastSearchedChunk:     { writable: true, value: chunk },\n\t\t\tbyStart:               { writable: true, value: {} },\n\t\t\tbyEnd:                 { writable: true, value: {} },\n\t\t\tfilename:              { writable: true, value: options.filename },\n\t\t\tindentExclusionRanges: { writable: true, value: options.indentExclusionRanges },\n\t\t\tsourcemapLocations:    { writable: true, value: new BitSet() },\n\t\t\tstoredNames:           { writable: true, value: {} },\n\t\t\tindentStr:             { writable: true, value: guessIndent(string) }\n\t\t});\n\n\t\tif (DEBUG) {\n\t\t\tObject.defineProperty(this, 'stats', { value: new Stats() });\n\t\t}\n\n\t\tthis.byStart[0] = chunk;\n\t\tthis.byEnd[string.length] = chunk;\n\t}\n\n\taddSourcemapLocation(char) {\n\t\tthis.sourcemapLocations.add(char);\n\t}\n\n\tappend(content) {\n\t\tif (typeof content !== 'string') throw new TypeError('outro content must be a string');\n\n\t\tthis.outro += content;\n\t\treturn this;\n\t}\n\n\tappendLeft(index, content) {\n\t\tif (typeof content !== 'string') throw new TypeError('inserted content must be a string');\n\n\t\tif (DEBUG) this.stats.time('appendLeft');\n\n\t\tthis._split(index);\n\n\t\tconst chunk = this.byEnd[index];\n\n\t\tif (chunk) {\n\t\t\tchunk.appendLeft(content);\n\t\t} else {\n\t\t\tthis.intro += content;\n\t\t}\n\n\t\tif (DEBUG) this.stats.timeEnd('appendLeft');\n\t\treturn this;\n\t}\n\n\tappendRight(index, content) {\n\t\tif (typeof content !== 'string') throw new TypeError('inserted content must be a string');\n\n\t\tif (DEBUG) this.stats.time('appendRight');\n\n\t\tthis._split(index);\n\n\t\tconst chunk = this.byStart[index];\n\n\t\tif (chunk) {\n\t\t\tchunk.appendRight(content);\n\t\t} else {\n\t\t\tthis.outro += content;\n\t\t}\n\n\t\tif (DEBUG) this.stats.timeEnd('appendRight');\n\t\treturn this;\n\t}\n\n\tclone() {\n\t\tconst cloned = new MagicString(this.original, { filename: this.filename });\n\n\t\tlet originalChunk = this.firstChunk;\n\t\tlet clonedChunk = (cloned.firstChunk = cloned.lastSearchedChunk = originalChunk.clone());\n\n\t\twhile (originalChunk) {\n\t\t\tcloned.byStart[clonedChunk.start] = clonedChunk;\n\t\t\tcloned.byEnd[clonedChunk.end] = clonedChunk;\n\n\t\t\tconst nextOriginalChunk = originalChunk.next;\n\t\t\tconst nextClonedChunk = nextOriginalChunk && nextOriginalChunk.clone();\n\n\t\t\tif (nextClonedChunk) {\n\t\t\t\tclonedChunk.next = nextClonedChunk;\n\t\t\t\tnextClonedChunk.previous = clonedChunk;\n\n\t\t\t\tclonedChunk = nextClonedChunk;\n\t\t\t}\n\n\t\t\toriginalChunk = nextOriginalChunk;\n\t\t}\n\n\t\tcloned.lastChunk = clonedChunk;\n\n\t\tif (this.indentExclusionRanges) {\n\t\t\tcloned.indentExclusionRanges = this.indentExclusionRanges.slice();\n\t\t}\n\n\t\tcloned.sourcemapLocations = new BitSet(this.sourcemapLocations);\n\n\t\tcloned.intro = this.intro;\n\t\tcloned.outro = this.outro;\n\n\t\treturn cloned;\n\t}\n\n\tgenerateDecodedMap(options) {\n\t\toptions = options || {};\n\n\t\tconst sourceIndex = 0;\n\t\tconst names = Object.keys(this.storedNames);\n\t\tconst mappings = new Mappings(options.hires);\n\n\t\tconst locate = getLocator(this.original);\n\n\t\tif (this.intro) {\n\t\t\tmappings.advance(this.intro);\n\t\t}\n\n\t\tthis.firstChunk.eachNext(chunk => {\n\t\t\tconst loc = locate(chunk.start);\n\n\t\t\tif (chunk.intro.length) mappings.advance(chunk.intro);\n\n\t\t\tif (chunk.edited) {\n\t\t\t\tmappings.addEdit(\n\t\t\t\t\tsourceIndex,\n\t\t\t\t\tchunk.content,\n\t\t\t\t\tloc,\n\t\t\t\t\tchunk.storeName ? names.indexOf(chunk.original) : -1\n\t\t\t\t);\n\t\t\t} else {\n\t\t\t\tmappings.addUneditedChunk(sourceIndex, chunk, this.original, loc, this.sourcemapLocations);\n\t\t\t}\n\n\t\t\tif (chunk.outro.length) mappings.advance(chunk.outro);\n\t\t});\n\n\t\treturn {\n\t\t\tfile: options.file ? options.file.split(/[/\\\\]/).pop() : null,\n\t\t\tsources: [options.source ? getRelativePath(options.file || '', options.source) : null],\n\t\t\tsourcesContent: options.includeContent ? [this.original] : [null],\n\t\t\tnames,\n\t\t\tmappings: mappings.raw\n\t\t};\n\t}\n\n\tgenerateMap(options) {\n\t\treturn new SourceMap(this.generateDecodedMap(options));\n\t}\n\n\tgetIndentString() {\n\t\treturn this.indentStr === null ? '\\t' : this.indentStr;\n\t}\n\n\tindent(indentStr, options) {\n\t\tconst pattern = /^[^\\r\\n]/gm;\n\n\t\tif (isObject(indentStr)) {\n\t\t\toptions = indentStr;\n\t\t\tindentStr = undefined;\n\t\t}\n\n\t\tindentStr = indentStr !== undefined ? indentStr : this.indentStr || '\\t';\n\n\t\tif (indentStr === '') return this; // noop\n\n\t\toptions = options || {};\n\n\t\t// Process exclusion ranges\n\t\tconst isExcluded = {};\n\n\t\tif (options.exclude) {\n\t\t\tconst exclusions =\n\t\t\t\ttypeof options.exclude[0] === 'number' ? [options.exclude] : options.exclude;\n\t\t\texclusions.forEach(exclusion => {\n\t\t\t\tfor (let i = exclusion[0]; i < exclusion[1]; i += 1) {\n\t\t\t\t\tisExcluded[i] = true;\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\n\t\tlet shouldIndentNextCharacter = options.indentStart !== false;\n\t\tconst replacer = match => {\n\t\t\tif (shouldIndentNextCharacter) return `${indentStr}${match}`;\n\t\t\tshouldIndentNextCharacter = true;\n\t\t\treturn match;\n\t\t};\n\n\t\tthis.intro = this.intro.replace(pattern, replacer);\n\n\t\tlet charIndex = 0;\n\t\tlet chunk = this.firstChunk;\n\n\t\twhile (chunk) {\n\t\t\tconst end = chunk.end;\n\n\t\t\tif (chunk.edited) {\n\t\t\t\tif (!isExcluded[charIndex]) {\n\t\t\t\t\tchunk.content = chunk.content.replace(pattern, replacer);\n\n\t\t\t\t\tif (chunk.content.length) {\n\t\t\t\t\t\tshouldIndentNextCharacter = chunk.content[chunk.content.length - 1] === '\\n';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tcharIndex = chunk.start;\n\n\t\t\t\twhile (charIndex < end) {\n\t\t\t\t\tif (!isExcluded[charIndex]) {\n\t\t\t\t\t\tconst char = this.original[charIndex];\n\n\t\t\t\t\t\tif (char === '\\n') {\n\t\t\t\t\t\t\tshouldIndentNextCharacter = true;\n\t\t\t\t\t\t} else if (char !== '\\r' && shouldIndentNextCharacter) {\n\t\t\t\t\t\t\tshouldIndentNextCharacter = false;\n\n\t\t\t\t\t\t\tif (charIndex === chunk.start) {\n\t\t\t\t\t\t\t\tchunk.prependRight(indentStr);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tthis._splitChunk(chunk, charIndex);\n\t\t\t\t\t\t\t\tchunk = chunk.next;\n\t\t\t\t\t\t\t\tchunk.prependRight(indentStr);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tcharIndex += 1;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tcharIndex = chunk.end;\n\t\t\tchunk = chunk.next;\n\t\t}\n\n\t\tthis.outro = this.outro.replace(pattern, replacer);\n\n\t\treturn this;\n\t}\n\n\tinsert() {\n\t\tthrow new Error('magicString.insert(...) is deprecated. Use prependRight(...) or appendLeft(...)');\n\t}\n\n\tinsertLeft(index, content) {\n\t\tif (!warned.insertLeft) {\n\t\t\tconsole.warn('magicString.insertLeft(...) is deprecated. Use magicString.appendLeft(...) instead'); // eslint-disable-line no-console\n\t\t\twarned.insertLeft = true;\n\t\t}\n\n\t\treturn this.appendLeft(index, content);\n\t}\n\n\tinsertRight(index, content) {\n\t\tif (!warned.insertRight) {\n\t\t\tconsole.warn('magicString.insertRight(...) is deprecated. Use magicString.prependRight(...) instead'); // eslint-disable-line no-console\n\t\t\twarned.insertRight = true;\n\t\t}\n\n\t\treturn this.prependRight(index, content);\n\t}\n\n\tmove(start, end, index) {\n\t\tif (index >= start && index <= end) throw new Error('Cannot move a selection inside itself');\n\n\t\tif (DEBUG) this.stats.time('move');\n\n\t\tthis._split(start);\n\t\tthis._split(end);\n\t\tthis._split(index);\n\n\t\tconst first = this.byStart[start];\n\t\tconst last = this.byEnd[end];\n\n\t\tconst oldLeft = first.previous;\n\t\tconst oldRight = last.next;\n\n\t\tconst newRight = this.byStart[index];\n\t\tif (!newRight && last === this.lastChunk) return this;\n\t\tconst newLeft = newRight ? newRight.previous : this.lastChunk;\n\n\t\tif (oldLeft) oldLeft.next = oldRight;\n\t\tif (oldRight) oldRight.previous = oldLeft;\n\n\t\tif (newLeft) newLeft.next = first;\n\t\tif (newRight) newRight.previous = last;\n\n\t\tif (!first.previous) this.firstChunk = last.next;\n\t\tif (!last.next) {\n\t\t\tthis.lastChunk = first.previous;\n\t\t\tthis.lastChunk.next = null;\n\t\t}\n\n\t\tfirst.previous = newLeft;\n\t\tlast.next = newRight || null;\n\n\t\tif (!newLeft) this.firstChunk = first;\n\t\tif (!newRight) this.lastChunk = last;\n\n\t\tif (DEBUG) this.stats.timeEnd('move');\n\t\treturn this;\n\t}\n\n\toverwrite(start, end, content, options) {\n\t\tif (typeof content !== 'string') throw new TypeError('replacement content must be a string');\n\n\t\twhile (start < 0) start += this.original.length;\n\t\twhile (end < 0) end += this.original.length;\n\n\t\tif (end > this.original.length) throw new Error('end is out of bounds');\n\t\tif (start === end)\n\t\t\tthrow new Error('Cannot overwrite a zero-length range \u2013 use appendLeft or prependRight instead');\n\n\t\tif (DEBUG) this.stats.time('overwrite');\n\n\t\tthis._split(start);\n\t\tthis._split(end);\n\n\t\tif (options === true) {\n\t\t\tif (!warned.storeName) {\n\t\t\t\tconsole.warn('The final argument to magicString.overwrite(...) should be an options object. See https://github.com/rich-harris/magic-string'); // eslint-disable-line no-console\n\t\t\t\twarned.storeName = true;\n\t\t\t}\n\n\t\t\toptions = { storeName: true };\n\t\t}\n\t\tconst storeName = options !== undefined ? options.storeName : false;\n\t\tconst contentOnly = options !== undefined ? options.contentOnly : false;\n\n\t\tif (storeName) {\n\t\t\tconst original = this.original.slice(start, end);\n\t\t\tthis.storedNames[original] = true;\n\t\t}\n\n\t\tconst first = this.byStart[start];\n\t\tconst last = this.byEnd[end];\n\n\t\tif (first) {\n\t\t\tif (end > first.end && first.next !== this.byStart[first.end]) {\n\t\t\t\tthrow new Error('Cannot overwrite across a split point');\n\t\t\t}\n\n\t\t\tfirst.edit(content, storeName, contentOnly);\n\n\t\t\tif (first !== last) {\n\t\t\t\tlet chunk = first.next;\n\t\t\t\twhile (chunk !== last) {\n\t\t\t\t\tchunk.edit('', false);\n\t\t\t\t\tchunk = chunk.next;\n\t\t\t\t}\n\n\t\t\t\tchunk.edit('', false);\n\t\t\t}\n\t\t} else {\n\t\t\t// must be inserting at the end\n\t\t\tconst newChunk = new Chunk(start, end, '').edit(content, storeName);\n\n\t\t\t// TODO last chunk in the array may not be the last chunk, if it's moved...\n\t\t\tlast.next = newChunk;\n\t\t\tnewChunk.previous = last;\n\t\t}\n\n\t\tif (DEBUG) this.stats.timeEnd('overwrite');\n\t\treturn this;\n\t}\n\n\tprepend(content) {\n\t\tif (typeof content !== 'string') throw new TypeError('outro content must be a string');\n\n\t\tthis.intro = content + this.intro;\n\t\treturn this;\n\t}\n\n\tprependLeft(index, content) {\n\t\tif (typeof content !== 'string') throw new TypeError('inserted content must be a string');\n\n\t\tif (DEBUG) this.stats.time('insertRight');\n\n\t\tthis._split(index);\n\n\t\tconst chunk = this.byEnd[index];\n\n\t\tif (chunk) {\n\t\t\tchunk.prependLeft(content);\n\t\t} else {\n\t\t\tthis.intro = content + this.intro;\n\t\t}\n\n\t\tif (DEBUG) this.stats.timeEnd('insertRight');\n\t\treturn this;\n\t}\n\n\tprependRight(index, content) {\n\t\tif (typeof content !== 'string') throw new TypeError('inserted content must be a string');\n\n\t\tif (DEBUG) this.stats.time('insertRight');\n\n\t\tthis._split(index);\n\n\t\tconst chunk = this.byStart[index];\n\n\t\tif (chunk) {\n\t\t\tchunk.prependRight(content);\n\t\t} else {\n\t\t\tthis.outro = content + this.outro;\n\t\t}\n\n\t\tif (DEBUG) this.stats.timeEnd('insertRight');\n\t\treturn this;\n\t}\n\n\tremove(start, end) {\n\t\twhile (start < 0) start += this.original.length;\n\t\twhile (end < 0) end += this.original.length;\n\n\t\tif (start === end) return this;\n\n\t\tif (start < 0 || end > this.original.length) throw new Error('Character is out of bounds');\n\t\tif (start > end) throw new Error('end must be greater than start');\n\n\t\tif (DEBUG) this.stats.time('remove');\n\n\t\tthis._split(start);\n\t\tthis._split(end);\n\n\t\tlet chunk = this.byStart[start];\n\n\t\twhile (chunk) {\n\t\t\tchunk.intro = '';\n\t\t\tchunk.outro = '';\n\t\t\tchunk.edit('');\n\n\t\t\tchunk = end > chunk.end ? this.byStart[chunk.end] : null;\n\t\t}\n\n\t\tif (DEBUG) this.stats.timeEnd('remove');\n\t\treturn this;\n\t}\n\n\tlastChar() {\n\t\tif (this.outro.length)\n\t\t\treturn this.outro[this.outro.length - 1];\n\t\tlet chunk = this.lastChunk;\n\t\tdo {\n\t\t\tif (chunk.outro.length)\n\t\t\t\treturn chunk.outro[chunk.outro.length - 1];\n\t\t\tif (chunk.content.length)\n\t\t\t\treturn chunk.content[chunk.content.length - 1];\n\t\t\tif (chunk.intro.length)\n\t\t\t\treturn chunk.intro[chunk.intro.length - 1];\n\t\t} while (chunk = chunk.previous);\n\t\tif (this.intro.length)\n\t\t\treturn this.intro[this.intro.length - 1];\n\t\treturn '';\n\t}\n\n\tlastLine() {\n\t\tlet lineIndex = this.outro.lastIndexOf(n);\n\t\tif (lineIndex !== -1)\n\t\t\treturn this.outro.substr(lineIndex + 1);\n\t\tlet lineStr = this.outro;\n\t\tlet chunk = this.lastChunk;\n\t\tdo {\n\t\t\tif (chunk.outro.length > 0) {\n\t\t\t\tlineIndex = chunk.outro.lastIndexOf(n);\n\t\t\t\tif (lineIndex !== -1)\n\t\t\t\t\treturn chunk.outro.substr(lineIndex + 1) + lineStr;\n\t\t\t\tlineStr = chunk.outro + lineStr;\n\t\t\t}\n\n\t\t\tif (chunk.content.length > 0) {\n\t\t\t\tlineIndex = chunk.content.lastIndexOf(n);\n\t\t\t\tif (lineIndex !== -1)\n\t\t\t\t\treturn chunk.content.substr(lineIndex + 1) + lineStr;\n\t\t\t\tlineStr = chunk.content + lineStr;\n\t\t\t}\n\n\t\t\tif (chunk.intro.length > 0) {\n\t\t\t\tlineIndex = chunk.intro.lastIndexOf(n);\n\t\t\t\tif (lineIndex !== -1)\n\t\t\t\t\treturn chunk.intro.substr(lineIndex + 1) + lineStr;\n\t\t\t\tlineStr = chunk.intro + lineStr;\n\t\t\t}\n\t\t} while (chunk = chunk.previous);\n\t\tlineIndex = this.intro.lastIndexOf(n);\n\t\tif (lineIndex !== -1)\n\t\t\treturn this.intro.substr(lineIndex + 1) + lineStr;\n\t\treturn this.intro + lineStr;\n\t}\n\n\tslice(start = 0, end = this.original.length) {\n\t\twhile (start < 0) start += this.original.length;\n\t\twhile (end < 0) end += this.original.length;\n\n\t\tlet result = '';\n\n\t\t// find start chunk\n\t\tlet chunk = this.firstChunk;\n\t\twhile (chunk && (chunk.start > start || chunk.end <= start)) {\n\t\t\t// found end chunk before start\n\t\t\tif (chunk.start < end && chunk.end >= end) {\n\t\t\t\treturn result;\n\t\t\t}\n\n\t\t\tchunk = chunk.next;\n\t\t}\n\n\t\tif (chunk && chunk.edited && chunk.start !== start)\n\t\t\tthrow new Error(`Cannot use replaced character ${start} as slice start anchor.`);\n\n\t\tconst startChunk = chunk;\n\t\twhile (chunk) {\n\t\t\tif (chunk.intro && (startChunk !== chunk || chunk.start === start)) {\n\t\t\t\tresult += chunk.intro;\n\t\t\t}\n\n\t\t\tconst containsEnd = chunk.start < end && chunk.end >= end;\n\t\t\tif (containsEnd && chunk.edited && chunk.end !== end)\n\t\t\t\tthrow new Error(`Cannot use replaced character ${end} as slice end anchor.`);\n\n\t\t\tconst sliceStart = startChunk === chunk ? start - chunk.start : 0;\n\t\t\tconst sliceEnd = containsEnd ? chunk.content.length + end - chunk.end : chunk.content.length;\n\n\t\t\tresult += chunk.content.slice(sliceStart, sliceEnd);\n\n\t\t\tif (chunk.outro && (!containsEnd || chunk.end === end)) {\n\t\t\t\tresult += chunk.outro;\n\t\t\t}\n\n\t\t\tif (containsEnd) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tchunk = chunk.next;\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t// TODO deprecate this? not really very useful\n\tsnip(start, end) {\n\t\tconst clone = this.clone();\n\t\tclone.remove(0, start);\n\t\tclone.remove(end, clone.original.length);\n\n\t\treturn clone;\n\t}\n\n\t_split(index) {\n\t\tif (this.byStart[index] || this.byEnd[index]) return;\n\n\t\tif (DEBUG) this.stats.time('_split');\n\n\t\tlet chunk = this.lastSearchedChunk;\n\t\tconst searchForward = index > chunk.end;\n\n\t\twhile (chunk) {\n\t\t\tif (chunk.contains(index)) return this._splitChunk(chunk, index);\n\n\t\t\tchunk = searchForward ? this.byStart[chunk.end] : this.byEnd[chunk.start];\n\t\t}\n\t}\n\n\t_splitChunk(chunk, index) {\n\t\tif (chunk.edited && chunk.content.length) {\n\t\t\t// zero-length edited chunks are a special case (overlapping replacements)\n\t\t\tconst loc = getLocator(this.original)(index);\n\t\t\tthrow new Error(\n\t\t\t\t`Cannot split a chunk that has already been edited (${loc.line}:${loc.column} \u2013 \"${\n\t\t\t\t\tchunk.original\n\t\t\t\t}\")`\n\t\t\t);\n\t\t}\n\n\t\tconst newChunk = chunk.split(index);\n\n\t\tthis.byEnd[index] = chunk;\n\t\tthis.byStart[index] = newChunk;\n\t\tthis.byEnd[newChunk.end] = newChunk;\n\n\t\tif (chunk === this.lastChunk) this.lastChunk = newChunk;\n\n\t\tthis.lastSearchedChunk = chunk;\n\t\tif (DEBUG) this.stats.timeEnd('_split');\n\t\treturn true;\n\t}\n\n\ttoString() {\n\t\tlet str = this.intro;\n\n\t\tlet chunk = this.firstChunk;\n\t\twhile (chunk) {\n\t\t\tstr += chunk.toString();\n\t\t\tchunk = chunk.next;\n\t\t}\n\n\t\treturn str + this.outro;\n\t}\n\n\tisEmpty() {\n\t\tlet chunk = this.firstChunk;\n\t\tdo {\n\t\t\tif (chunk.intro.length && chunk.intro.trim() ||\n\t\t\t\t\tchunk.content.length && chunk.content.trim() ||\n\t\t\t\t\tchunk.outro.length && chunk.outro.trim())\n\t\t\t\treturn false;\n\t\t} while (chunk = chunk.next);\n\t\treturn true;\n\t}\n\n\tlength() {\n\t\tlet chunk = this.firstChunk;\n\t\tlet length = 0;\n\t\tdo {\n\t\t\tlength += chunk.intro.length + chunk.content.length + chunk.outro.length;\n\t\t} while (chunk = chunk.next);\n\t\treturn length;\n\t}\n\n\ttrimLines() {\n\t\treturn this.trim('[\\\\r\\\\n]');\n\t}\n\n\ttrim(charType) {\n\t\treturn this.trimStart(charType).trimEnd(charType);\n\t}\n\n\ttrimEndAborted(charType) {\n\t\tconst rx = new RegExp((charType || '\\\\s') + '+$');\n\n\t\tthis.outro = this.outro.replace(rx, '');\n\t\tif (this.outro.length) return true;\n\n\t\tlet chunk = this.lastChunk;\n\n\t\tdo {\n\t\t\tconst end = chunk.end;\n\t\t\tconst aborted = chunk.trimEnd(rx);\n\n\t\t\t// if chunk was trimmed, we have a new lastChunk\n\t\t\tif (chunk.end !== end) {\n\t\t\t\tif (this.lastChunk === chunk) {\n\t\t\t\t\tthis.lastChunk = chunk.next;\n\t\t\t\t}\n\n\t\t\t\tthis.byEnd[chunk.end] = chunk;\n\t\t\t\tthis.byStart[chunk.next.start] = chunk.next;\n\t\t\t\tthis.byEnd[chunk.next.end] = chunk.next;\n\t\t\t}\n\n\t\t\tif (aborted) return true;\n\t\t\tchunk = chunk.previous;\n\t\t} while (chunk);\n\n\t\treturn false;\n\t}\n\n\ttrimEnd(charType) {\n\t\tthis.trimEndAborted(charType);\n\t\treturn this;\n\t}\n\ttrimStartAborted(charType) {\n\t\tconst rx = new RegExp('^' + (charType || '\\\\s') + '+');\n\n\t\tthis.intro = this.intro.replace(rx, '');\n\t\tif (this.intro.length) return true;\n\n\t\tlet chunk = this.firstChunk;\n\n\t\tdo {\n\t\t\tconst end = chunk.end;\n\t\t\tconst aborted = chunk.trimStart(rx);\n\n\t\t\tif (chunk.end !== end) {\n\t\t\t\t// special case...\n\t\t\t\tif (chunk === this.lastChunk) this.lastChunk = chunk.next;\n\n\t\t\t\tthis.byEnd[chunk.end] = chunk;\n\t\t\t\tthis.byStart[chunk.next.start] = chunk.next;\n\t\t\t\tthis.byEnd[chunk.next.end] = chunk.next;\n\t\t\t}\n\n\t\t\tif (aborted) return true;\n\t\t\tchunk = chunk.next;\n\t\t} while (chunk);\n\n\t\treturn false;\n\t}\n\n\ttrimStart(charType) {\n\t\tthis.trimStartAborted(charType);\n\t\treturn this;\n\t}\n}\n", "import MagicString from './MagicString.js';\nimport SourceMap from './SourceMap.js';\nimport getRelativePath from './utils/getRelativePath.js';\nimport isObject from './utils/isObject.js';\nimport getLocator from './utils/getLocator.js';\nimport Mappings from './utils/Mappings.js';\n\nconst hasOwnProp = Object.prototype.hasOwnProperty;\n\nexport default class Bundle {\n\tconstructor(options = {}) {\n\t\tthis.intro = options.intro || '';\n\t\tthis.separator = options.separator !== undefined ? options.separator : '\\n';\n\t\tthis.sources = [];\n\t\tthis.uniqueSources = [];\n\t\tthis.uniqueSourceIndexByFilename = {};\n\t}\n\n\taddSource(source) {\n\t\tif (source instanceof MagicString) {\n\t\t\treturn this.addSource({\n\t\t\t\tcontent: source,\n\t\t\t\tfilename: source.filename,\n\t\t\t\tseparator: this.separator\n\t\t\t});\n\t\t}\n\n\t\tif (!isObject(source) || !source.content) {\n\t\t\tthrow new Error('bundle.addSource() takes an object with a `content` property, which should be an instance of MagicString, and an optional `filename`');\n\t\t}\n\n\t\t['filename', 'indentExclusionRanges', 'separator'].forEach(option => {\n\t\t\tif (!hasOwnProp.call(source, option)) source[option] = source.content[option];\n\t\t});\n\n\t\tif (source.separator === undefined) {\n\t\t\t// TODO there's a bunch of this sort of thing, needs cleaning up\n\t\t\tsource.separator = this.separator;\n\t\t}\n\n\t\tif (source.filename) {\n\t\t\tif (!hasOwnProp.call(this.uniqueSourceIndexByFilename, source.filename)) {\n\t\t\t\tthis.uniqueSourceIndexByFilename[source.filename] = this.uniqueSources.length;\n\t\t\t\tthis.uniqueSources.push({ filename: source.filename, content: source.content.original });\n\t\t\t} else {\n\t\t\t\tconst uniqueSource = this.uniqueSources[this.uniqueSourceIndexByFilename[source.filename]];\n\t\t\t\tif (source.content.original !== uniqueSource.content) {\n\t\t\t\t\tthrow new Error(`Illegal source: same filename (${source.filename}), different contents`);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tthis.sources.push(source);\n\t\treturn this;\n\t}\n\n\tappend(str, options) {\n\t\tthis.addSource({\n\t\t\tcontent: new MagicString(str),\n\t\t\tseparator: (options && options.separator) || ''\n\t\t});\n\n\t\treturn this;\n\t}\n\n\tclone() {\n\t\tconst bundle = new Bundle({\n\t\t\tintro: this.intro,\n\t\t\tseparator: this.separator\n\t\t});\n\n\t\tthis.sources.forEach(source => {\n\t\t\tbundle.addSource({\n\t\t\t\tfilename: source.filename,\n\t\t\t\tcontent: source.content.clone(),\n\t\t\t\tseparator: source.separator\n\t\t\t});\n\t\t});\n\n\t\treturn bundle;\n\t}\n\n\tgenerateDecodedMap(options = {}) {\n\t\tconst names = [];\n\t\tthis.sources.forEach(source => {\n\t\t\tObject.keys(source.content.storedNames).forEach(name => {\n\t\t\t\tif (!~names.indexOf(name)) names.push(name);\n\t\t\t});\n\t\t});\n\n\t\tconst mappings = new Mappings(options.hires);\n\n\t\tif (this.intro) {\n\t\t\tmappings.advance(this.intro);\n\t\t}\n\n\t\tthis.sources.forEach((source, i) => {\n\t\t\tif (i > 0) {\n\t\t\t\tmappings.advance(this.separator);\n\t\t\t}\n\n\t\t\tconst sourceIndex = source.filename ? this.uniqueSourceIndexByFilename[source.filename] : -1;\n\t\t\tconst magicString = source.content;\n\t\t\tconst locate = getLocator(magicString.original);\n\n\t\t\tif (magicString.intro) {\n\t\t\t\tmappings.advance(magicString.intro);\n\t\t\t}\n\n\t\t\tmagicString.firstChunk.eachNext(chunk => {\n\t\t\t\tconst loc = locate(chunk.start);\n\n\t\t\t\tif (chunk.intro.length) mappings.advance(chunk.intro);\n\n\t\t\t\tif (source.filename) {\n\t\t\t\t\tif (chunk.edited) {\n\t\t\t\t\t\tmappings.addEdit(\n\t\t\t\t\t\t\tsourceIndex,\n\t\t\t\t\t\t\tchunk.content,\n\t\t\t\t\t\t\tloc,\n\t\t\t\t\t\t\tchunk.storeName ? names.indexOf(chunk.original) : -1\n\t\t\t\t\t\t);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tmappings.addUneditedChunk(\n\t\t\t\t\t\t\tsourceIndex,\n\t\t\t\t\t\t\tchunk,\n\t\t\t\t\t\t\tmagicString.original,\n\t\t\t\t\t\t\tloc,\n\t\t\t\t\t\t\tmagicString.sourcemapLocations\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tmappings.advance(chunk.content);\n\t\t\t\t}\n\n\t\t\t\tif (chunk.outro.length) mappings.advance(chunk.outro);\n\t\t\t});\n\n\t\t\tif (magicString.outro) {\n\t\t\t\tmappings.advance(magicString.outro);\n\t\t\t}\n\t\t});\n\n\t\treturn {\n\t\t\tfile: options.file ? options.file.split(/[/\\\\]/).pop() : null,\n\t\t\tsources: this.uniqueSources.map(source => {\n\t\t\t\treturn options.file ? getRelativePath(options.file, source.filename) : source.filename;\n\t\t\t}),\n\t\t\tsourcesContent: this.uniqueSources.map(source => {\n\t\t\t\treturn options.includeContent ? source.content : null;\n\t\t\t}),\n\t\t\tnames,\n\t\t\tmappings: mappings.raw\n\t\t};\n\t}\n\n\tgenerateMap(options) {\n\t\treturn new SourceMap(this.generateDecodedMap(options));\n\t}\n\n\tgetIndentString() {\n\t\tconst indentStringCounts = {};\n\n\t\tthis.sources.forEach(source => {\n\t\t\tconst indentStr = source.content.indentStr;\n\n\t\t\tif (indentStr === null) return;\n\n\t\t\tif (!indentStringCounts[indentStr]) indentStringCounts[indentStr] = 0;\n\t\t\tindentStringCounts[indentStr] += 1;\n\t\t});\n\n\t\treturn (\n\t\t\tObject.keys(indentStringCounts).sort((a, b) => {\n\t\t\t\treturn indentStringCounts[a] - indentStringCounts[b];\n\t\t\t})[0] || '\\t'\n\t\t);\n\t}\n\n\tindent(indentStr) {\n\t\tif (!arguments.length) {\n\t\t\tindentStr = this.getIndentString();\n\t\t}\n\n\t\tif (indentStr === '') return this; // noop\n\n\t\tlet trailingNewline = !this.intro || this.intro.slice(-1) === '\\n';\n\n\t\tthis.sources.forEach((source, i) => {\n\t\t\tconst separator = source.separator !== undefined ? source.separator : this.separator;\n\t\t\tconst indentStart = trailingNewline || (i > 0 && /\\r?\\n$/.test(separator));\n\n\t\t\tsource.content.indent(indentStr, {\n\t\t\t\texclude: source.indentExclusionRanges,\n\t\t\t\tindentStart //: trailingNewline || /\\r?\\n$/.test( separator )  //true///\\r?\\n/.test( separator )\n\t\t\t});\n\n\t\t\ttrailingNewline = source.content.lastChar() === '\\n';\n\t\t});\n\n\t\tif (this.intro) {\n\t\t\tthis.intro =\n\t\t\t\tindentStr +\n\t\t\t\tthis.intro.replace(/^[^\\n]/gm, (match, index) => {\n\t\t\t\t\treturn index > 0 ? indentStr + match : match;\n\t\t\t\t});\n\t\t}\n\n\t\treturn this;\n\t}\n\n\tprepend(str) {\n\t\tthis.intro = str + this.intro;\n\t\treturn this;\n\t}\n\n\ttoString() {\n\t\tconst body = this.sources\n\t\t\t.map((source, i) => {\n\t\t\t\tconst separator = source.separator !== undefined ? source.separator : this.separator;\n\t\t\t\tconst str = (i > 0 ? separator : '') + source.content.toString();\n\n\t\t\t\treturn str;\n\t\t\t})\n\t\t\t.join('');\n\n\t\treturn this.intro + body;\n\t}\n\n\tisEmpty () {\n\t\tif (this.intro.length && this.intro.trim())\n\t\t\treturn false;\n\t\tif (this.sources.some(source => !source.content.isEmpty()))\n\t\t\treturn false;\n\t\treturn true;\n\t}\n\n\tlength() {\n\t\treturn this.sources.reduce((length, source) => length + source.content.length(), this.intro.length);\n\t}\n\n\ttrimLines() {\n\t\treturn this.trim('[\\\\r\\\\n]');\n\t}\n\n\ttrim(charType) {\n\t\treturn this.trimStart(charType).trimEnd(charType);\n\t}\n\n\ttrimStart(charType) {\n\t\tconst rx = new RegExp('^' + (charType || '\\\\s') + '+');\n\t\tthis.intro = this.intro.replace(rx, '');\n\n\t\tif (!this.intro) {\n\t\t\tlet source;\n\t\t\tlet i = 0;\n\n\t\t\tdo {\n\t\t\t\tsource = this.sources[i++];\n\t\t\t\tif (!source) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t} while (!source.content.trimStartAborted(charType));\n\t\t}\n\n\t\treturn this;\n\t}\n\n\ttrimEnd(charType) {\n\t\tconst rx = new RegExp((charType || '\\\\s') + '+$');\n\n\t\tlet source;\n\t\tlet i = this.sources.length - 1;\n\n\t\tdo {\n\t\t\tsource = this.sources[i--];\n\t\t\tif (!source) {\n\t\t\t\tthis.intro = this.intro.replace(rx, '');\n\t\t\t\tbreak;\n\t\t\t}\n\t\t} while (!source.content.trimEndAborted(charType));\n\n\t\treturn this;\n\t}\n}\n", "/**\n * The AST nodes' metadata store\n */\n// This set ensures that any of the NodeMetadata methods throws an error\n// when called after its manipulator has finished (e.g. through setTimeout())\nexport const finishedNodes = new WeakSet();\n/**\n * Ensure that a node has not been handled yet\n *\n * @param node The AST node to check\n *\n */\nexport function checkNode(node) {\n    if (finishedNodes.has(node)) {\n        throw new Error(`Cannot run helper method after manipulator callback of iterated or target node has finished running`);\n    }\n}\n/**\n * A place to store meta data associated with encountered AST nodes\n */\nexport const nodeMetadataStore = new WeakMap();\n", "/**\n * Helper functions for manipulator callbacks\n */\nimport { nodeMetadataStore, checkNode } from './metadata';\n/**\n * Get the original source code of a node\n *\n * @param node The AST node to get the source code for\n *\n */\nexport function source(node) {\n    const { context } = nodeMetadataStore.get(node);\n    return context.magicString.slice(node.start, node.end).toString();\n}\n/**\n * Get a node's parent node\n *\n * @param node   The AST node whose parent to get\n * @param levels The number of levels to go up the AST\n *\n */\nexport function parent(node, levels = 1) {\n    const { parent: parentNode } = nodeMetadataStore.get(node);\n    // No matter how many levels to climb, no parent means undefined\n    if (!parentNode) {\n        return undefined;\n    }\n    // No levels to go up, return current parent\n    if (levels <= 1) {\n        return parentNode;\n    }\n    // Recursively get parent node when levels are remaining\n    return parent(parentNode, levels - 1);\n}\n/**\n * Replace a node's source code\n *\n * @param node        The AST node to replace\n * @param replacement The replacement code\n *\n */\nexport function update(node, replacement) {\n    checkNode(node);\n    const { context } = nodeMetadataStore.get(node);\n    context.magicString.overwrite(node.start, node.end, replacement);\n}\n", "/**\n * Check whether a variable is a Promise\n *\n * @param value The value to check\n */\nexport function isPromise(value) {\n    return (typeof value === 'object' &&\n        value !== null &&\n        typeof value.then === 'function');\n}\n/**\n * Check whether a value resembles an acorn AST node\n *\n * @param value The value to check\n */\nexport function isNode(value) {\n    return (typeof value === 'object' &&\n        value !== null &&\n        typeof value.type === 'string');\n}\n", "/**\n * A set of functions that represent different tasks\n * in the lifecycle of a yufka() call\n */\nimport { nodeMetadataStore, finishedNodes, checkNode } from './metadata';\nimport * as helpers from './helpers';\nimport { isNode, isPromise } from './util';\n/**\n * Collect the child AST nodes of a node\n *\n * @param node The node to search for child nodes\n */\nexport function collectChildNodes(node) {\n    const childNodes = [];\n    // Walk all AST node properties, performing a recursive `walk`\n    // on everything that looks like another AST node\n    for (const key of Object.keys(node)) {\n        // Explicitely widen the types here since not all\n        // properties are represented in acorn's typings\n        const property = node[key];\n        if (Array.isArray(property)) {\n            // Step into arrays and walk their items\n            for (const propertyElement of property) {\n                if (isNode(propertyElement)) {\n                    childNodes.push(propertyElement);\n                }\n            }\n        }\n        else if (isNode(property)) {\n            childNodes.push(property);\n        }\n    }\n    return childNodes;\n}\n/**\n * Perform node handling on child nodes in succession\n * This function returns a promise if any of the executed manipulators\n * returns a promise, otherwise it executes synchronously\n *\n * @param node       The node whose child nodes to handle\n * @param childNodes The child nodes to handle\n */\nexport function performSuccessiveRecursiveWalks(node, childNodes, context) {\n    // Return synchronously when no subwalks are scheduled\n    if (childNodes.length === 0) {\n        return undefined;\n    }\n    const [firstChild, ...remainingChildNodes] = childNodes;\n    const subwalkResult = handleNode(firstChild, context);\n    // When node handling returns a promise, an asynchronous manipulator was called\n    // -> wait for it to resolve, then handle next step\n    if (isPromise(subwalkResult)) {\n        return subwalkResult.then(() => performSuccessiveRecursiveWalks(node, remainingChildNodes, context));\n    }\n    else {\n        return performSuccessiveRecursiveWalks(node, remainingChildNodes, context);\n    }\n}\n/**\n * Collect metadata of a tree\n *\n * @param node    The starting node of the tree\n * @param context The yufka() context\n */\nexport function collectTreeMetadata(node, context) {\n    const childNodes = collectChildNodes(node);\n    for (const childNode of childNodes) {\n        nodeMetadataStore.set(childNode, { parent: node, context });\n        collectTreeMetadata(childNode, context);\n    }\n}\n/**\n * Create a function that handles any of the NodeMetadata methods,\n * taking into account a node as an optional first parameter.\n *\n * @param node       The node to bind to the helper method\n * @param helperName The the helper function to invoke\n */\nfunction createNodeHelper(node, helperName) {\n    return (...args) => {\n        // We need to annihilate typing because TS is just not clever enough\n        const helper = helpers[helperName];\n        if (isNode(args[0])) {\n            if (helperName === 'update') {\n                checkNode(args[0]);\n            }\n            // If first argument is not a node, grab its metadata from\n            // the store and execute the according method on that\n            return helper(...args);\n        }\n        else {\n            return helper(node, ...args);\n        }\n    };\n}\n/**\n * Walk the AST under the given node and update its descendants\n *\n * @param node    The AST node to start at\n * @param context The yufka() context\n */\nexport function handleNode(node, context) {\n    // Get subwalks to perform\n    const childNodes = collectChildNodes(node);\n    const subwalksResult = performSuccessiveRecursiveWalks(node, childNodes, context);\n    // Create the manipulation helpers object\n    const nodeHelpers = {\n        source: createNodeHelper(node, 'source'),\n        parent: createNodeHelper(node, 'parent'),\n        update: createNodeHelper(node, 'update')\n    };\n    // Call manipulator function on AST node\n    if (isPromise(subwalksResult)) {\n        return subwalksResult\n            .then(() => {\n            return context.manipulator(node, nodeHelpers);\n        })\n            .then(manipulatorResult => {\n            finishedNodes.add(node);\n            return manipulatorResult;\n        });\n    }\n    else {\n        const manipulatorResult = context.manipulator(node, nodeHelpers);\n        if (isPromise(manipulatorResult)) {\n            return manipulatorResult.then(result => {\n                finishedNodes.add(node);\n                return result;\n            });\n        }\n        else {\n            finishedNodes.add(node);\n            return manipulatorResult;\n        }\n    }\n}\n/**\n * Create an immutable yufka() result\n *\n * @param context The yufka() context\n */\nexport function createResult({ magicString, options }) {\n    const code = magicString.toString();\n    return Object.freeze({\n        code,\n        map: magicString.generateMap(options.sourceMap),\n        toString: () => code\n    });\n}\n", "import { parse as acornDefaultParse } from 'acorn';\nimport MagicString from 'magic-string';\nimport { collectTreeMetadata, createResult, handleNode } from './lib/lifecycle';\nimport * as helpers from './lib/helpers';\nimport { nodeMetadataStore } from './lib/metadata';\nimport { isPromise } from './lib/util';\nfunction yufka(...yufkaArgs) {\n    var _a;\n    let options;\n    let manipulator;\n    // Source is always the first argument\n    // Coerce to string in case it's a Buffer object\n    const source = String(yufkaArgs[0]);\n    if (typeof yufkaArgs[1] === 'function') {\n        // If second argument is a function, options have been omitted\n        options = {};\n        manipulator = yufkaArgs[1];\n    }\n    else if (typeof yufkaArgs[1] === 'object' &&\n        typeof yufkaArgs[2] === 'function') {\n        // Type check for clarity in case of error\n        options = yufkaArgs[1];\n        manipulator = yufkaArgs[2];\n    }\n    else {\n        // Invalid arguments, inform the user comprehensibly\n        throw new Error('Invalid arguments. After the source code argument, yufka() expects either an options object and a manipulator function or just a manipulator function');\n    }\n    const acornOptions = {\n        ecmaVersion: 'latest',\n        ...((_a = options.acorn) !== null && _a !== void 0 ? _a : {})\n    };\n    // Use `parser` option as parser if available\n    const rootNode = options.parser\n        ? options.parser.parse(source, acornOptions)\n        : acornDefaultParse(source, acornOptions);\n    // Create the resource all manipulations are performed on\n    const magicString = new MagicString(source);\n    // Create a context object that can be passed to helpers\n    const context = { magicString, options, manipulator };\n    // Preparation: collect metadata of the whole AST\n    // Allows to modify nodes that have not been visited yet\n    nodeMetadataStore.set(rootNode, { parent: undefined, context });\n    collectTreeMetadata(rootNode, context);\n    // Start the recursive walk\n    const walkResult = handleNode(rootNode, context);\n    // Create the result\n    if (isPromise(walkResult)) {\n        return walkResult.then(() => createResult(context));\n    }\n    else {\n        return createResult(context);\n    }\n}\nyufka.source = helpers.source;\nyufka.parent = helpers.parent;\nyufka.update = helpers.update;\nexport default yufka;\n", null, null, "\n/*! pako 2.0.4 https://github.com/nodeca/pako @license (MIT AND Zlib) */\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//const Z_FILTERED          = 1;\n//const Z_HUFFMAN_ONLY      = 2;\n//const Z_RLE               = 3;\nconst Z_FIXED$1               = 4;\n//const Z_DEFAULT_STRATEGY  = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nconst Z_BINARY              = 0;\nconst Z_TEXT                = 1;\n//const Z_ASCII             = 1; // = Z_TEXT\nconst Z_UNKNOWN$1             = 2;\n\n/*============================================================================*/\n\n\nfunction zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES    = 2;\n/* The three kinds of block type */\n\nconst MIN_MATCH$1    = 3;\nconst MAX_MATCH$1    = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nconst LENGTH_CODES$1  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nconst LITERALS$1      = 256;\n/* number of literal bytes 0..255 */\n\nconst L_CODES$1       = LITERALS$1 + 1 + LENGTH_CODES$1;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nconst D_CODES$1       = 30;\n/* number of distance codes */\n\nconst BL_CODES$1      = 19;\n/* number of codes used to transfer the bit lengths */\n\nconst HEAP_SIZE$1     = 2 * L_CODES$1 + 1;\n/* maximum heap size */\n\nconst MAX_BITS$1      = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst Buf_size      = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nconst MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nconst END_BLOCK   = 256;\n/* end of block literal code */\n\nconst REP_3_6     = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nconst REPZ_3_10   = 17;\n/* repeat a zero length 3-10 times  (3 bits of repeat count) */\n\nconst REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times  (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nconst extra_lbits =   /* extra bits for each length code */\n  new Uint8Array([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\nconst extra_dbits =   /* extra bits for each distance code */\n  new Uint8Array([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\nconst extra_blbits =  /* extra bits for each bit length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n  new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nconst static_ltree  = new Array((L_CODES$1 + 2) * 2);\nzero$1(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nconst static_dtree  = new Array(D_CODES$1 * 2);\nzero$1(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nconst _dist_code    = new Array(DIST_CODE_LEN);\nzero$1(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nconst _length_code  = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1);\nzero$1(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nconst base_length   = new Array(LENGTH_CODES$1);\nzero$1(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nconst base_dist     = new Array(D_CODES$1);\nzero$1(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n  this.static_tree  = static_tree;  /* static tree or NULL */\n  this.extra_bits   = extra_bits;   /* extra bits for each code or NULL */\n  this.extra_base   = extra_base;   /* base index for extra_bits */\n  this.elems        = elems;        /* max number of elements in the tree */\n  this.max_length   = max_length;   /* max bit length for the codes */\n\n  // show if `static_tree` has data or dummy - needed for monomorphic objects\n  this.has_stree    = static_tree && static_tree.length;\n}\n\n\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n  this.dyn_tree = dyn_tree;     /* the dynamic tree */\n  this.max_code = 0;            /* largest code with non zero frequency */\n  this.stat_desc = stat_desc;   /* the corresponding static tree */\n}\n\n\n\nconst d_code = (dist) => {\n\n  return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nconst put_short = (s, w) => {\n//    put_byte(s, (uch)((w) & 0xff));\n//    put_byte(s, (uch)((ush)(w) >> 8));\n  s.pending_buf[s.pending++] = (w) & 0xff;\n  s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nconst send_bits = (s, value, length) => {\n\n  if (s.bi_valid > (Buf_size - length)) {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    put_short(s, s.bi_buf);\n    s.bi_buf = value >> (Buf_size - s.bi_valid);\n    s.bi_valid += length - Buf_size;\n  } else {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    s.bi_valid += length;\n  }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n  send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nconst bi_reverse = (code, len) => {\n\n  let res = 0;\n  do {\n    res |= code & 1;\n    code >>>= 1;\n    res <<= 1;\n  } while (--len > 0);\n  return res >>> 1;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nconst bi_flush = (s) => {\n\n  if (s.bi_valid === 16) {\n    put_short(s, s.bi_buf);\n    s.bi_buf = 0;\n    s.bi_valid = 0;\n\n  } else if (s.bi_valid >= 8) {\n    s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n    s.bi_buf >>= 8;\n    s.bi_valid -= 8;\n  }\n};\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n *    above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n *     array bl_count contains the frequencies for each bit length.\n *     The length opt_len is updated; static_len is also updated if stree is\n *     not null.\n */\nconst gen_bitlen = (s, desc) =>\n//    deflate_state *s;\n//    tree_desc *desc;    /* the tree descriptor */\n{\n  const tree            = desc.dyn_tree;\n  const max_code        = desc.max_code;\n  const stree           = desc.stat_desc.static_tree;\n  const has_stree       = desc.stat_desc.has_stree;\n  const extra           = desc.stat_desc.extra_bits;\n  const base            = desc.stat_desc.extra_base;\n  const max_length      = desc.stat_desc.max_length;\n  let h;              /* heap index */\n  let n, m;           /* iterate over the tree elements */\n  let bits;           /* bit length */\n  let xbits;          /* extra bits */\n  let f;              /* frequency */\n  let overflow = 0;   /* number of elements with bit length too large */\n\n  for (bits = 0; bits <= MAX_BITS$1; bits++) {\n    s.bl_count[bits] = 0;\n  }\n\n  /* In a first pass, compute the optimal bit lengths (which may\n   * overflow in the case of the bit length tree).\n   */\n  tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n  for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) {\n    n = s.heap[h];\n    bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n    if (bits > max_length) {\n      bits = max_length;\n      overflow++;\n    }\n    tree[n * 2 + 1]/*.Len*/ = bits;\n    /* We overwrite tree[n].Dad which is no longer needed */\n\n    if (n > max_code) { continue; } /* not a leaf node */\n\n    s.bl_count[bits]++;\n    xbits = 0;\n    if (n >= base) {\n      xbits = extra[n - base];\n    }\n    f = tree[n * 2]/*.Freq*/;\n    s.opt_len += f * (bits + xbits);\n    if (has_stree) {\n      s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n    }\n  }\n  if (overflow === 0) { return; }\n\n  // Trace((stderr,\"\\nbit length overflow\\n\"));\n  /* This happens for example on obj2 and pic of the Calgary corpus */\n\n  /* Find the first bit length which could increase: */\n  do {\n    bits = max_length - 1;\n    while (s.bl_count[bits] === 0) { bits--; }\n    s.bl_count[bits]--;      /* move one leaf down the tree */\n    s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n    s.bl_count[max_length]--;\n    /* The brother of the overflow item also moves one step up,\n     * but this does not affect bl_count[max_length]\n     */\n    overflow -= 2;\n  } while (overflow > 0);\n\n  /* Now recompute all bit lengths, scanning in increasing frequency.\n   * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n   * lengths instead of fixing only the wrong ones. This idea is taken\n   * from 'ar' written by Haruhiko Okumura.)\n   */\n  for (bits = max_length; bits !== 0; bits--) {\n    n = s.bl_count[bits];\n    while (n !== 0) {\n      m = s.heap[--h];\n      if (m > max_code) { continue; }\n      if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n        // Trace((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n        s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n        tree[m * 2 + 1]/*.Len*/ = bits;\n      }\n      n--;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n *     zero code length.\n */\nconst gen_codes = (tree, max_code, bl_count) =>\n//    ct_data *tree;             /* the tree to decorate */\n//    int max_code;              /* largest code with non zero frequency */\n//    ushf *bl_count;            /* number of codes at each bit length */\n{\n  const next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */\n  let code = 0;              /* running code value */\n  let bits;                  /* bit index */\n  let n;                     /* code index */\n\n  /* The distribution counts are first used to generate the code values\n   * without bit reversal.\n   */\n  for (bits = 1; bits <= MAX_BITS$1; bits++) {\n    next_code[bits] = code = (code + bl_count[bits - 1]) << 1;\n  }\n  /* Check that the bit counts in bl_count are consistent. The last code\n   * must be all ones.\n   */\n  //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n  //        \"inconsistent bit counts\");\n  //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n  for (n = 0;  n <= max_code; n++) {\n    let len = tree[n * 2 + 1]/*.Len*/;\n    if (len === 0) { continue; }\n    /* Now reverse the bits */\n    tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n    //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n    //     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n  }\n};\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nconst tr_static_init = () => {\n\n  let n;        /* iterates over tree elements */\n  let bits;     /* bit counter */\n  let length;   /* length value */\n  let code;     /* code value */\n  let dist;     /* distance index */\n  const bl_count = new Array(MAX_BITS$1 + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  // do check in _tr_init()\n  //if (static_init_done) return;\n\n  /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n  static_l_desc.static_tree = static_ltree;\n  static_l_desc.extra_bits = extra_lbits;\n  static_d_desc.static_tree = static_dtree;\n  static_d_desc.extra_bits = extra_dbits;\n  static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n  /* Initialize the mapping length (0..255) -> length code (0..28) */\n  length = 0;\n  for (code = 0; code < LENGTH_CODES$1 - 1; code++) {\n    base_length[code] = length;\n    for (n = 0; n < (1 << extra_lbits[code]); n++) {\n      _length_code[length++] = code;\n    }\n  }\n  //Assert (length == 256, \"tr_static_init: length != 256\");\n  /* Note that the length 255 (match length 258) can be represented\n   * in two different ways: code 284 + 5 bits or code 285, so we\n   * overwrite length_code[255] to use the best encoding:\n   */\n  _length_code[length - 1] = code;\n\n  /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n  dist = 0;\n  for (code = 0; code < 16; code++) {\n    base_dist[code] = dist;\n    for (n = 0; n < (1 << extra_dbits[code]); n++) {\n      _dist_code[dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: dist != 256\");\n  dist >>= 7; /* from now on, all distances are divided by 128 */\n  for (; code < D_CODES$1; code++) {\n    base_dist[code] = dist << 7;\n    for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n      _dist_code[256 + dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n  /* Construct the codes of the static literal tree */\n  for (bits = 0; bits <= MAX_BITS$1; bits++) {\n    bl_count[bits] = 0;\n  }\n\n  n = 0;\n  while (n <= 143) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  while (n <= 255) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 9;\n    n++;\n    bl_count[9]++;\n  }\n  while (n <= 279) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 7;\n    n++;\n    bl_count[7]++;\n  }\n  while (n <= 287) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  /* Codes 286 and 287 do not exist, but we must include them in the\n   * tree construction to get a canonical Huffman tree (longest code\n   * all ones)\n   */\n  gen_codes(static_ltree, L_CODES$1 + 1, bl_count);\n\n  /* The static distance tree is trivial: */\n  for (n = 0; n < D_CODES$1; n++) {\n    static_dtree[n * 2 + 1]/*.Len*/ = 5;\n    static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n  }\n\n  // Now data ready and we can init static trees\n  static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1);\n  static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0,          D_CODES$1, MAX_BITS$1);\n  static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0,         BL_CODES$1, MAX_BL_BITS);\n\n  //static_init_done = true;\n};\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nconst init_block = (s) => {\n\n  let n; /* iterates over tree elements */\n\n  /* Initialize the trees. */\n  for (n = 0; n < L_CODES$1;  n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < D_CODES$1;  n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n  s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n  s.opt_len = s.static_len = 0;\n  s.last_lit = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nconst bi_windup = (s) =>\n{\n  if (s.bi_valid > 8) {\n    put_short(s, s.bi_buf);\n  } else if (s.bi_valid > 0) {\n    //put_byte(s, (Byte)s->bi_buf);\n    s.pending_buf[s.pending++] = s.bi_buf;\n  }\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n};\n\n/* ===========================================================================\n * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\nconst copy_block = (s, buf, len, header) =>\n//DeflateState *s;\n//charf    *buf;    /* the input data */\n//unsigned len;     /* its length */\n//int      header;  /* true if block header must be written */\n{\n  bi_windup(s);        /* align on byte boundary */\n\n  if (header) {\n    put_short(s, len);\n    put_short(s, ~len);\n  }\n//  while (len--) {\n//    put_byte(s, *buf++);\n//  }\n  s.pending_buf.set(s.window.subarray(buf, buf + len), s.pending);\n  s.pending += len;\n};\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nconst smaller = (tree, n, m, depth) => {\n\n  const _n2 = n * 2;\n  const _m2 = m * 2;\n  return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n         (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nconst pqdownheap = (s, tree, k) =>\n//    deflate_state *s;\n//    ct_data *tree;  /* the tree to restore */\n//    int k;               /* node to move down */\n{\n  const v = s.heap[k];\n  let j = k << 1;  /* left son of k */\n  while (j <= s.heap_len) {\n    /* Set j to the smallest of the two sons: */\n    if (j < s.heap_len &&\n      smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n      j++;\n    }\n    /* Exit if v is smaller than both sons */\n    if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n    /* Exchange v with the smallest son */\n    s.heap[k] = s.heap[j];\n    k = j;\n\n    /* And continue down the tree, setting j to the left son of k */\n    j <<= 1;\n  }\n  s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nconst compress_block = (s, ltree, dtree) =>\n//    deflate_state *s;\n//    const ct_data *ltree; /* literal tree */\n//    const ct_data *dtree; /* distance tree */\n{\n  let dist;           /* distance of matched string */\n  let lc;             /* match length or unmatched char (if dist == 0) */\n  let lx = 0;         /* running index in l_buf */\n  let code;           /* the code to send */\n  let extra;          /* number of extra bits to send */\n\n  if (s.last_lit !== 0) {\n    do {\n      dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);\n      lc = s.pending_buf[s.l_buf + lx];\n      lx++;\n\n      if (dist === 0) {\n        send_code(s, lc, ltree); /* send a literal byte */\n        //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n      } else {\n        /* Here, lc is the match length - MIN_MATCH */\n        code = _length_code[lc];\n        send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */\n        extra = extra_lbits[code];\n        if (extra !== 0) {\n          lc -= base_length[code];\n          send_bits(s, lc, extra);       /* send the extra length bits */\n        }\n        dist--; /* dist is now the match distance - 1 */\n        code = d_code(dist);\n        //Assert (code < D_CODES, \"bad d_code\");\n\n        send_code(s, code, dtree);       /* send the distance code */\n        extra = extra_dbits[code];\n        if (extra !== 0) {\n          dist -= base_dist[code];\n          send_bits(s, dist, extra);   /* send the extra distance bits */\n        }\n      } /* literal or match pair ? */\n\n      /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */\n      //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n      //       \"pendingBuf overflow\");\n\n    } while (lx < s.last_lit);\n  }\n\n  send_code(s, END_BLOCK, ltree);\n};\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n *     and corresponding code. The length opt_len is updated; static_len is\n *     also updated if stree is not null. The field max_code is set.\n */\nconst build_tree = (s, desc) =>\n//    deflate_state *s;\n//    tree_desc *desc; /* the tree descriptor */\n{\n  const tree     = desc.dyn_tree;\n  const stree    = desc.stat_desc.static_tree;\n  const has_stree = desc.stat_desc.has_stree;\n  const elems    = desc.stat_desc.elems;\n  let n, m;          /* iterate over heap elements */\n  let max_code = -1; /* largest code with non zero frequency */\n  let node;          /* new node being created */\n\n  /* Construct the initial heap, with least frequent element in\n   * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n   * heap[0] is not used.\n   */\n  s.heap_len = 0;\n  s.heap_max = HEAP_SIZE$1;\n\n  for (n = 0; n < elems; n++) {\n    if (tree[n * 2]/*.Freq*/ !== 0) {\n      s.heap[++s.heap_len] = max_code = n;\n      s.depth[n] = 0;\n\n    } else {\n      tree[n * 2 + 1]/*.Len*/ = 0;\n    }\n  }\n\n  /* The pkzip format requires that at least one distance code exists,\n   * and that at least one bit should be sent even if there is only one\n   * possible code. So to avoid special checks later on we force at least\n   * two codes of non zero frequency.\n   */\n  while (s.heap_len < 2) {\n    node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n    tree[node * 2]/*.Freq*/ = 1;\n    s.depth[node] = 0;\n    s.opt_len--;\n\n    if (has_stree) {\n      s.static_len -= stree[node * 2 + 1]/*.Len*/;\n    }\n    /* node is 0 or 1 so it does not have extra bits */\n  }\n  desc.max_code = max_code;\n\n  /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n   * establish sub-heaps of increasing lengths:\n   */\n  for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n  /* Construct the Huffman tree by repeatedly combining the least two\n   * frequent nodes.\n   */\n  node = elems;              /* next internal node of the tree */\n  do {\n    //pqremove(s, tree, n);  /* n = node of least frequency */\n    /*** pqremove ***/\n    n = s.heap[1/*SMALLEST*/];\n    s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n    /***/\n\n    m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n    s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n    s.heap[--s.heap_max] = m;\n\n    /* Create a new node father of n and m */\n    tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n    s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n    tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n    /* and insert the new node in the heap */\n    s.heap[1/*SMALLEST*/] = node++;\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n\n  } while (s.heap_len >= 2);\n\n  s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n  /* At this point, the fields freq and dad are set. We can now\n   * generate the bit lengths.\n   */\n  gen_bitlen(s, desc);\n\n  /* The field len is now set, we can generate the bit codes */\n  gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nconst scan_tree = (s, tree, max_code) =>\n//    deflate_state *s;\n//    ct_data *tree;   /* the tree to be scanned */\n//    int max_code;    /* and its largest code of non zero frequency */\n{\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n  tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n    } else if (curlen !== 0) {\n\n      if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n      s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n    } else if (count <= 10) {\n      s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n    } else {\n      s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n    }\n\n    count = 0;\n    prevlen = curlen;\n\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nconst send_tree = (s, tree, max_code) =>\n//    deflate_state *s;\n//    ct_data *tree; /* the tree to be scanned */\n//    int max_code;       /* and its largest code of non zero frequency */\n{\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  /* tree[max_code+1].Len = -1; */  /* guard already set */\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n    } else if (curlen !== 0) {\n      if (curlen !== prevlen) {\n        send_code(s, curlen, s.bl_tree);\n        count--;\n      }\n      //Assert(count >= 3 && count <= 6, \" 3_6?\");\n      send_code(s, REP_3_6, s.bl_tree);\n      send_bits(s, count - 3, 2);\n\n    } else if (count <= 10) {\n      send_code(s, REPZ_3_10, s.bl_tree);\n      send_bits(s, count - 3, 3);\n\n    } else {\n      send_code(s, REPZ_11_138, s.bl_tree);\n      send_bits(s, count - 11, 7);\n    }\n\n    count = 0;\n    prevlen = curlen;\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nconst build_bl_tree = (s) => {\n\n  let max_blindex;  /* index of last bit length code of non zero freq */\n\n  /* Determine the bit length frequencies for literal and distance trees */\n  scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n  scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n  /* Build the bit length tree: */\n  build_tree(s, s.bl_desc);\n  /* opt_len now includes the length of the tree representations, except\n   * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n   */\n\n  /* Determine the number of bit length codes to send. The pkzip format\n   * requires that at least 4 bit length codes be sent. (appnote.txt says\n   * 3 but the actual value used is 4.)\n   */\n  for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\n    if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n      break;\n    }\n  }\n  /* Update opt_len to include the bit length tree and counts */\n  s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n  //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n  //        s->opt_len, s->static_len));\n\n  return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nconst send_all_trees = (s, lcodes, dcodes, blcodes) =>\n//    deflate_state *s;\n//    int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n  let rank;                    /* index in bl_order */\n\n  //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n  //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n  //        \"too many codes\");\n  //Tracev((stderr, \"\\nbl counts: \"));\n  send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n  send_bits(s, dcodes - 1,   5);\n  send_bits(s, blcodes - 4,  4); /* not -3 as stated in appnote.txt */\n  for (rank = 0; rank < blcodes; rank++) {\n    //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n    send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n  }\n  //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n  //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n  //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n *    a) There are no non-portable control characters belonging to the\n *       \"black list\" (0..6, 14..25, 28..31).\n *    b) There is at least one printable character belonging to the\n *       \"white list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n *   \"gray list\" that is ignored in this detection algorithm:\n *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nconst detect_data_type = (s) => {\n  /* black_mask is the bit mask of black-listed bytes\n   * set bits 0..6, 14..25, and 28..31\n   * 0xf3ffc07f = binary 11110011111111111100000001111111\n   */\n  let black_mask = 0xf3ffc07f;\n  let n;\n\n  /* Check for non-textual (\"black-listed\") bytes. */\n  for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n    if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n      return Z_BINARY;\n    }\n  }\n\n  /* Check for textual (\"white-listed\") bytes. */\n  if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n      s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n    return Z_TEXT;\n  }\n  for (n = 32; n < LITERALS$1; n++) {\n    if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n      return Z_TEXT;\n    }\n  }\n\n  /* There are no \"black-listed\" or \"white-listed\" bytes:\n   * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n   */\n  return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nconst _tr_init$1 = (s) =>\n{\n\n  if (!static_init_done) {\n    tr_static_init();\n    static_init_done = true;\n  }\n\n  s.l_desc  = new TreeDesc(s.dyn_ltree, static_l_desc);\n  s.d_desc  = new TreeDesc(s.dyn_dtree, static_d_desc);\n  s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n\n  /* Initialize the first block of the first file: */\n  init_block(s);\n};\n\n\n/* ===========================================================================\n * Send a stored block\n */\nconst _tr_stored_block$1 = (s, buf, stored_len, last) =>\n//DeflateState *s;\n//charf *buf;       /* input block */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n{\n  send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */\n  copy_block(s, buf, stored_len, true); /* with header */\n};\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nconst _tr_align$1 = (s) => {\n  send_bits(s, STATIC_TREES << 1, 3);\n  send_code(s, END_BLOCK, static_ltree);\n  bi_flush(s);\n};\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and output the encoded block to the zip file.\n */\nconst _tr_flush_block$1 = (s, buf, stored_len, last) =>\n//DeflateState *s;\n//charf *buf;       /* input block, or NULL if too old */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n{\n  let opt_lenb, static_lenb;  /* opt_len and static_len in bytes */\n  let max_blindex = 0;        /* index of last bit length code of non zero freq */\n\n  /* Build the Huffman trees unless a stored block is forced */\n  if (s.level > 0) {\n\n    /* Check if the file is binary or text */\n    if (s.strm.data_type === Z_UNKNOWN$1) {\n      s.strm.data_type = detect_data_type(s);\n    }\n\n    /* Construct the literal and distance trees */\n    build_tree(s, s.l_desc);\n    // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n\n    build_tree(s, s.d_desc);\n    // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n    /* At this point, opt_len and static_len are the total bit lengths of\n     * the compressed block data, excluding the tree representations.\n     */\n\n    /* Build the bit length tree for the above two trees, and get the index\n     * in bl_order of the last bit length code to send.\n     */\n    max_blindex = build_bl_tree(s);\n\n    /* Determine the best encoding. Compute the block lengths in bytes. */\n    opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n    static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n    // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n    //        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n    //        s->last_lit));\n\n    if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n  } else {\n    // Assert(buf != (char*)0, \"lost buf\");\n    opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n  }\n\n  if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n    /* 4: two words for the lengths */\n\n    /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n     * Otherwise we can't have processed more than WSIZE input bytes since\n     * the last block flush, because compression would have been\n     * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n     * transform a block into a stored block.\n     */\n    _tr_stored_block$1(s, buf, stored_len, last);\n\n  } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) {\n\n    send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n    compress_block(s, static_ltree, static_dtree);\n\n  } else {\n    send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n    send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n    compress_block(s, s.dyn_ltree, s.dyn_dtree);\n  }\n  // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n  /* The above check is made mod 2^32, for files larger than 512 MB\n   * and uLong implemented on 32 bits.\n   */\n  init_block(s);\n\n  if (last) {\n    bi_windup(s);\n  }\n  // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n  //       s->compressed_len-7*last));\n};\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nconst _tr_tally$1 = (s, dist, lc) =>\n//    deflate_state *s;\n//    unsigned dist;  /* distance of matched string */\n//    unsigned lc;    /* match length-MIN_MATCH or unmatched char (if dist==0) */\n{\n  //let out_length, in_length, dcode;\n\n  s.pending_buf[s.d_buf + s.last_lit * 2]     = (dist >>> 8) & 0xff;\n  s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;\n\n  s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;\n  s.last_lit++;\n\n  if (dist === 0) {\n    /* lc is the unmatched char */\n    s.dyn_ltree[lc * 2]/*.Freq*/++;\n  } else {\n    s.matches++;\n    /* Here, lc is the match length - MIN_MATCH */\n    dist--;             /* dist = match distance - 1 */\n    //Assert((ush)dist < (ush)MAX_DIST(s) &&\n    //       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n    //       (ush)d_code(dist) < (ush)D_CODES,  \"_tr_tally: bad match\");\n\n    s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2]/*.Freq*/++;\n    s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n  }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n\n//#ifdef TRUNCATE_BLOCK\n//  /* Try to guess if it is profitable to stop the current block here */\n//  if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {\n//    /* Compute an upper bound for the compressed length */\n//    out_length = s.last_lit*8;\n//    in_length = s.strstart - s.block_start;\n//\n//    for (dcode = 0; dcode < D_CODES; dcode++) {\n//      out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);\n//    }\n//    out_length >>>= 3;\n//    //Tracev((stderr,\"\\nlast_lit %u, in %ld, out ~%ld(%ld%%) \",\n//    //       s->last_lit, in_length, out_length,\n//    //       100L - out_length*100L/in_length));\n//    if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {\n//      return true;\n//    }\n//  }\n//#endif\n\n  return (s.last_lit === s.lit_bufsize - 1);\n  /* We avoid equality with lit_bufsize because of wraparound at 64K\n   * on 16 bit machines and because stored blocks are restricted to\n   * 64K-1 bytes.\n   */\n};\n\nvar _tr_init_1  = _tr_init$1;\nvar _tr_stored_block_1 = _tr_stored_block$1;\nvar _tr_flush_block_1  = _tr_flush_block$1;\nvar _tr_tally_1 = _tr_tally$1;\nvar _tr_align_1 = _tr_align$1;\n\nvar trees = {\n\t_tr_init: _tr_init_1,\n\t_tr_stored_block: _tr_stored_block_1,\n\t_tr_flush_block: _tr_flush_block_1,\n\t_tr_tally: _tr_tally_1,\n\t_tr_align: _tr_align_1\n};\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst adler32 = (adler, buf, len, pos) => {\n  let s1 = (adler & 0xffff) |0,\n      s2 = ((adler >>> 16) & 0xffff) |0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = (s1 + buf[pos++]) |0;\n      s2 = (s2 + s1) |0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return (s1 | (s2 << 16)) |0;\n};\n\n\nvar adler32_1 = adler32;\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nconst makeTable = () => {\n  let c, table = [];\n\n  for (var n = 0; n < 256; n++) {\n    c = n;\n    for (var k = 0; k < 8; k++) {\n      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n    }\n    table[n] = c;\n  }\n\n  return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n  const t = crcTable;\n  const end = pos + len;\n\n  crc ^= -1;\n\n  for (let i = pos; i < end; i++) {\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n  }\n\n  return (crc ^ (-1)); // >>> 0;\n};\n\n\nvar crc32_1 = crc32;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar messages = {\n  2:      'need dictionary',     /* Z_NEED_DICT       2  */\n  1:      'stream end',          /* Z_STREAM_END      1  */\n  0:      '',                    /* Z_OK              0  */\n  '-1':   'file error',          /* Z_ERRNO         (-1) */\n  '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */\n  '-3':   'data error',          /* Z_DATA_ERROR    (-3) */\n  '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */\n  '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */\n  '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar constants$2 = {\n\n  /* Allowed flush values; see deflate() and inflate() below for details */\n  Z_NO_FLUSH:         0,\n  Z_PARTIAL_FLUSH:    1,\n  Z_SYNC_FLUSH:       2,\n  Z_FULL_FLUSH:       3,\n  Z_FINISH:           4,\n  Z_BLOCK:            5,\n  Z_TREES:            6,\n\n  /* Return codes for the compression/decompression functions. Negative values\n  * are errors, positive values are used for special but normal events.\n  */\n  Z_OK:               0,\n  Z_STREAM_END:       1,\n  Z_NEED_DICT:        2,\n  Z_ERRNO:           -1,\n  Z_STREAM_ERROR:    -2,\n  Z_DATA_ERROR:      -3,\n  Z_MEM_ERROR:       -4,\n  Z_BUF_ERROR:       -5,\n  //Z_VERSION_ERROR: -6,\n\n  /* compression levels */\n  Z_NO_COMPRESSION:         0,\n  Z_BEST_SPEED:             1,\n  Z_BEST_COMPRESSION:       9,\n  Z_DEFAULT_COMPRESSION:   -1,\n\n\n  Z_FILTERED:               1,\n  Z_HUFFMAN_ONLY:           2,\n  Z_RLE:                    3,\n  Z_FIXED:                  4,\n  Z_DEFAULT_STRATEGY:       0,\n\n  /* Possible values of the data_type field (though see inflate()) */\n  Z_BINARY:                 0,\n  Z_TEXT:                   1,\n  //Z_ASCII:                1, // = Z_TEXT (deprecated)\n  Z_UNKNOWN:                2,\n\n  /* The deflate compression method */\n  Z_DEFLATED:               8\n  //Z_NULL:                 null // Use -1 or null inline, depending on var type\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees;\n\n\n\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$2, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$3, Z_BLOCK: Z_BLOCK$1,\n  Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_BUF_ERROR: Z_BUF_ERROR$1,\n  Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1,\n  Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1,\n  Z_UNKNOWN,\n  Z_DEFLATED: Z_DEFLATED$2\n} = constants$2;\n\n/*============================================================================*/\n\n\nconst MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nconst MAX_WBITS$1 = 15;\n/* 32K LZ77 window */\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nconst LITERALS      = 256;\n/* number of literal bytes 0..255 */\nconst L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nconst D_CODES       = 30;\n/* number of distance codes */\nconst BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\nconst HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\nconst MAX_BITS  = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE = 42;\nconst EXTRA_STATE = 69;\nconst NAME_STATE = 73;\nconst COMMENT_STATE = 91;\nconst HCRC_STATE = 103;\nconst BUSY_STATE = 113;\nconst FINISH_STATE = 666;\n\nconst BS_NEED_MORE      = 1; /* block not completed, need more input or more output */\nconst BS_BLOCK_DONE     = 2; /* block flush performed */\nconst BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nconst BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n  strm.msg = messages[errorCode];\n  return errorCode;\n};\n\nconst rank = (f) => {\n  return ((f) << 1) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n  let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n\n/* eslint-disable new-cap */\nlet HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n// This hash causes less collisions, https://github.com/nodeca/pako/issues/135\n// But breaks binary compatibility\n//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask;\nlet HASH = HASH_ZLIB;\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output goes\n * through this function so some applications may wish to modify it\n * to avoid allocating a large strm->output buffer and copying into it.\n * (See also read_buf()).\n */\nconst flush_pending = (strm) => {\n  const s = strm.state;\n\n  //_tr_flush_bits(s);\n  let len = s.pending;\n  if (len > strm.avail_out) {\n    len = strm.avail_out;\n  }\n  if (len === 0) { return; }\n\n  strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n  strm.next_out += len;\n  s.pending_out += len;\n  strm.total_out += len;\n  strm.avail_out -= len;\n  s.pending -= len;\n  if (s.pending === 0) {\n    s.pending_out = 0;\n  }\n};\n\n\nconst flush_block_only = (s, last) => {\n  _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n  s.block_start = s.strstart;\n  flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n  s.pending_buf[s.pending++] = b;\n};\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nconst putShortMSB = (s, b) => {\n\n  //  put_byte(s, (Byte)(b >> 8));\n//  put_byte(s, (Byte)(b & 0xff));\n  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n  s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read.  All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nconst read_buf = (strm, buf, start, size) => {\n\n  let len = strm.avail_in;\n\n  if (len > size) { len = size; }\n  if (len === 0) { return 0; }\n\n  strm.avail_in -= len;\n\n  // zmemcpy(buf, strm->next_in, len);\n  buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n  if (strm.state.wrap === 1) {\n    strm.adler = adler32_1(strm.adler, buf, len, start);\n  }\n\n  else if (strm.state.wrap === 2) {\n    strm.adler = crc32_1(strm.adler, buf, len, start);\n  }\n\n  strm.next_in += len;\n  strm.total_in += len;\n\n  return len;\n};\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nconst longest_match = (s, cur_match) => {\n\n  let chain_length = s.max_chain_length;      /* max hash chain length */\n  let scan = s.strstart; /* current string */\n  let match;                       /* matched string */\n  let len;                           /* length of current match */\n  let best_len = s.prev_length;              /* best match length so far */\n  let nice_match = s.nice_match;             /* stop if match long enough */\n  const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n  const _win = s.window; // shortcut\n\n  const wmask = s.w_mask;\n  const prev  = s.prev;\n\n  /* Stop when cur_match becomes <= limit. To simplify the code,\n   * we prevent matches with the string of window index 0.\n   */\n\n  const strend = s.strstart + MAX_MATCH;\n  let scan_end1  = _win[scan + best_len - 1];\n  let scan_end   = _win[scan + best_len];\n\n  /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n   * It is easy to get rid of this optimization if necessary.\n   */\n  // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n  /* Do not waste too much time if we already have a good match: */\n  if (s.prev_length >= s.good_match) {\n    chain_length >>= 2;\n  }\n  /* Do not look for matches beyond the end of the input. This is necessary\n   * to make deflate deterministic.\n   */\n  if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n  // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n  do {\n    // Assert(cur_match < s->strstart, \"no future\");\n    match = cur_match;\n\n    /* Skip to next match if the match length cannot increase\n     * or if the match length is less than 2.  Note that the checks below\n     * for insufficient lookahead only occur occasionally for performance\n     * reasons.  Therefore uninitialized memory will be accessed, and\n     * conditional jumps will be made that depend on those values.\n     * However the length of the match is limited to the lookahead, so\n     * the output of deflate is not affected by the uninitialized values.\n     */\n\n    if (_win[match + best_len]     !== scan_end  ||\n        _win[match + best_len - 1] !== scan_end1 ||\n        _win[match]                !== _win[scan] ||\n        _win[++match]              !== _win[scan + 1]) {\n      continue;\n    }\n\n    /* The check at best_len-1 can be removed because it will be made\n     * again later. (This heuristic is not always a win.)\n     * It is not necessary to compare scan[2] and match[2] since they\n     * are always equal when the other bytes match, given that\n     * the hash keys are equal and that HASH_BITS >= 8.\n     */\n    scan += 2;\n    match++;\n    // Assert(*scan == *match, \"match[2]?\");\n\n    /* We check for insufficient lookahead only every 8th comparison;\n     * the 256th check will be made at strstart+258.\n     */\n    do {\n      /*jshint noempty:false*/\n    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             scan < strend);\n\n    // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n    len = MAX_MATCH - (strend - scan);\n    scan = strend - MAX_MATCH;\n\n    if (len > best_len) {\n      s.match_start = cur_match;\n      best_len = len;\n      if (len >= nice_match) {\n        break;\n      }\n      scan_end1  = _win[scan + best_len - 1];\n      scan_end   = _win[scan + best_len];\n    }\n  } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n  if (best_len <= s.lookahead) {\n    return best_len;\n  }\n  return s.lookahead;\n};\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n *    At least one byte has been read, or avail_in == 0; reads are\n *    performed for at least two bytes (required for the zip translate_eol\n *    option -- not supported here).\n */\nconst fill_window = (s) => {\n\n  const _w_size = s.w_size;\n  let p, n, m, more, str;\n\n  //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n  do {\n    more = s.window_size - s.lookahead - s.strstart;\n\n    // JS ints have 32 bit, block below not needed\n    /* Deal with !@#$% 64K limit: */\n    //if (sizeof(int) <= 2) {\n    //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n    //        more = wsize;\n    //\n    //  } else if (more == (unsigned)(-1)) {\n    //        /* Very unlikely, but possible on 16 bit machine if\n    //         * strstart == 0 && lookahead == 1 (input done a byte at time)\n    //         */\n    //        more--;\n    //    }\n    //}\n\n\n    /* If the window is almost full and there is insufficient lookahead,\n     * move the upper half to the lower one to make room in the upper half.\n     */\n    if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n      s.window.set(s.window.subarray(_w_size, _w_size + _w_size), 0);\n      s.match_start -= _w_size;\n      s.strstart -= _w_size;\n      /* we now have strstart >= MAX_DIST */\n      s.block_start -= _w_size;\n\n      /* Slide the hash table (could be avoided with 32 bit values\n       at the expense of memory usage). We slide even when level == 0\n       to keep the hash table consistent if we switch back to level > 0\n       later. (Using level 0 permanently is not an optimal usage of\n       zlib, so we don't care about this pathological case.)\n       */\n\n      n = s.hash_size;\n      p = n;\n\n      do {\n        m = s.head[--p];\n        s.head[p] = (m >= _w_size ? m - _w_size : 0);\n      } while (--n);\n\n      n = _w_size;\n      p = n;\n\n      do {\n        m = s.prev[--p];\n        s.prev[p] = (m >= _w_size ? m - _w_size : 0);\n        /* If n is not on any hash chain, prev[n] is garbage but\n         * its value will never be used.\n         */\n      } while (--n);\n\n      more += _w_size;\n    }\n    if (s.strm.avail_in === 0) {\n      break;\n    }\n\n    /* If there was no sliding:\n     *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n     *    more == window_size - lookahead - strstart\n     * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n     * => more >= window_size - 2*WSIZE + 2\n     * In the BIG_MEM or MMAP case (not yet supported),\n     *   window_size == input_size + MIN_LOOKAHEAD  &&\n     *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n     * Otherwise, window_size == 2*WSIZE so more >= 2.\n     * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n     */\n    //Assert(more >= 2, \"more < 2\");\n    n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n    s.lookahead += n;\n\n    /* Initialize the hash value now that we have some input: */\n    if (s.lookahead + s.insert >= MIN_MATCH) {\n      str = s.strstart - s.insert;\n      s.ins_h = s.window[str];\n\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n//        Call update_hash() MIN_MATCH-3 more times\n//#endif\n      while (s.insert) {\n        /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n        s.prev[str & s.w_mask] = s.head[s.ins_h];\n        s.head[s.ins_h] = str;\n        str++;\n        s.insert--;\n        if (s.lookahead + s.insert < MIN_MATCH) {\n          break;\n        }\n      }\n    }\n    /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n     * but this is not important since only literal bytes will be emitted.\n     */\n\n  } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n  /* If the WIN_INIT bytes after the end of the current data have never been\n   * written, then zero those bytes in order to avoid memory check reports of\n   * the use of uninitialized (or uninitialised as Julian writes) bytes by\n   * the longest match routines.  Update the high water mark for the next\n   * time through here.  WIN_INIT is set to MAX_MATCH since the longest match\n   * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n   */\n//  if (s.high_water < s.window_size) {\n//    const curr = s.strstart + s.lookahead;\n//    let init = 0;\n//\n//    if (s.high_water < curr) {\n//      /* Previous high water mark below current data -- zero WIN_INIT\n//       * bytes or up to end of window, whichever is less.\n//       */\n//      init = s.window_size - curr;\n//      if (init > WIN_INIT)\n//        init = WIN_INIT;\n//      zmemzero(s->window + curr, (unsigned)init);\n//      s->high_water = curr + init;\n//    }\n//    else if (s->high_water < (ulg)curr + WIN_INIT) {\n//      /* High water mark at or above current data, but below current data\n//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n//       * to end of window, whichever is less.\n//       */\n//      init = (ulg)curr + WIN_INIT - s->high_water;\n//      if (init > s->window_size - s->high_water)\n//        init = s->window_size - s->high_water;\n//      zmemzero(s->window + s->high_water, (unsigned)init);\n//      s->high_water += init;\n//    }\n//  }\n//\n//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n//    \"not enough room for search\");\n};\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n * This function does not insert new strings in the dictionary since\n * uncompressible data is probably not useful. This function is used\n * only for the level=0 compression option.\n * NOTE: this function should be optimized to avoid extra copying from\n * window to pending_buf.\n */\nconst deflate_stored = (s, flush) => {\n\n  /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\n   * to pending_buf_size, and each stored block has a 5 byte header:\n   */\n  let max_block_size = 0xffff;\n\n  if (max_block_size > s.pending_buf_size - 5) {\n    max_block_size = s.pending_buf_size - 5;\n  }\n\n  /* Copy as much as possible from input to output: */\n  for (;;) {\n    /* Fill the window as much as possible: */\n    if (s.lookahead <= 1) {\n\n      //Assert(s->strstart < s->w_size+MAX_DIST(s) ||\n      //  s->block_start >= (long)s->w_size, \"slide too late\");\n//      if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||\n//        s.block_start >= s.w_size)) {\n//        throw  new Error(\"slide too late\");\n//      }\n\n      fill_window(s);\n      if (s.lookahead === 0 && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n\n      if (s.lookahead === 0) {\n        break;\n      }\n      /* flush the current block */\n    }\n    //Assert(s->block_start >= 0L, \"block gone\");\n//    if (s.block_start < 0) throw new Error(\"block gone\");\n\n    s.strstart += s.lookahead;\n    s.lookahead = 0;\n\n    /* Emit a stored block if pending_buf will be full: */\n    const max_start = s.block_start + max_block_size;\n\n    if (s.strstart === 0 || s.strstart >= max_start) {\n      /* strstart == 0 is possible when wraparound on 16-bit machine */\n      s.lookahead = s.strstart - max_start;\n      s.strstart = max_start;\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n\n\n    }\n    /* Flush if we may have to slide, otherwise block_start may become\n     * negative and the data will be gone:\n     */\n    if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n\n  s.insert = 0;\n\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n\n  if (s.strstart > s.block_start) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_NEED_MORE;\n};\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nconst deflate_fast = (s, flush) => {\n\n  let hash_head;        /* head of the hash chain */\n  let bflush;           /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) {\n        break; /* flush the current block */\n      }\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     * At this point we have always match_length < MIN_MATCH\n     */\n    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n    }\n    if (s.match_length >= MIN_MATCH) {\n      // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n      /*** _tr_tally_dist(s, s.strstart - s.match_start,\n                     s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n\n      /* Insert new strings in the hash table only if the match length\n       * is not too large. This saves time but degrades compression.\n       */\n      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n        s.match_length--; /* string at strstart already in table */\n        do {\n          s.strstart++;\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n          /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n           * always MIN_MATCH bytes ahead.\n           */\n        } while (--s.match_length !== 0);\n        s.strstart++;\n      } else\n      {\n        s.strstart += s.match_length;\n        s.match_length = 0;\n        s.ins_h = s.window[s.strstart];\n        /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n//                Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n        /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n         * matter since it will be recomputed at next deflate call.\n         */\n      }\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nconst deflate_slow = (s, flush) => {\n\n  let hash_head;          /* head of hash chain */\n  let bflush;              /* set if current block must be flushed */\n\n  let max_insert;\n\n  /* Process the input block. */\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     */\n    s.prev_length = s.match_length;\n    s.prev_match = s.match_start;\n    s.match_length = MIN_MATCH - 1;\n\n    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n\n      if (s.match_length <= 5 &&\n         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n        /* If prev_match is also MIN_MATCH, match_start is garbage\n         * but we will ignore the current match anyway.\n         */\n        s.match_length = MIN_MATCH - 1;\n      }\n    }\n    /* If there was a match at the previous step and the current\n     * match is not better, output the previous match:\n     */\n    if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n      max_insert = s.strstart + s.lookahead - MIN_MATCH;\n      /* Do not insert strings in hash table beyond this. */\n\n      //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n      /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n                     s.prev_length - MIN_MATCH, bflush);***/\n      bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n      /* Insert in hash table all strings up to the end of the match.\n       * strstart-1 and strstart are already inserted. If there is not\n       * enough lookahead, the last two strings are not inserted in\n       * the hash table.\n       */\n      s.lookahead -= s.prev_length - 1;\n      s.prev_length -= 2;\n      do {\n        if (++s.strstart <= max_insert) {\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n        }\n      } while (--s.prev_length !== 0);\n      s.match_available = 0;\n      s.match_length = MIN_MATCH - 1;\n      s.strstart++;\n\n      if (bflush) {\n        /*** FLUSH_BLOCK(s, 0); ***/\n        flush_block_only(s, false);\n        if (s.strm.avail_out === 0) {\n          return BS_NEED_MORE;\n        }\n        /***/\n      }\n\n    } else if (s.match_available) {\n      /* If there was no match at the previous position, output a\n       * single literal. If there was a match but the current match\n       * is longer, truncate the previous match to a single literal.\n       */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n      /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n      if (bflush) {\n        /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n        flush_block_only(s, false);\n        /***/\n      }\n      s.strstart++;\n      s.lookahead--;\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n    } else {\n      /* There is no previous match to compare with, wait for\n       * the next step to decide.\n       */\n      s.match_available = 1;\n      s.strstart++;\n      s.lookahead--;\n    }\n  }\n  //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n  if (s.match_available) {\n    //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n    /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n    s.match_available = 0;\n  }\n  s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_BLOCK_DONE;\n};\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one.  Do not maintain a hash table.  (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nconst deflate_rle = (s, flush) => {\n\n  let bflush;            /* set if current block must be flushed */\n  let prev;              /* byte at distance one to match */\n  let scan, strend;      /* scan goes up to strend for length of run */\n\n  const _win = s.window;\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the longest run, plus one for the unrolled loop.\n     */\n    if (s.lookahead <= MAX_MATCH) {\n      fill_window(s);\n      if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* See how many times the previous byte repeats */\n    s.match_length = 0;\n    if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n      scan = s.strstart - 1;\n      prev = _win[scan];\n      if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n        strend = s.strstart + MAX_MATCH;\n        do {\n          /*jshint noempty:false*/\n        } while (prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 scan < strend);\n        s.match_length = MAX_MATCH - (strend - scan);\n        if (s.match_length > s.lookahead) {\n          s.match_length = s.lookahead;\n        }\n      }\n      //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n    }\n\n    /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n    if (s.match_length >= MIN_MATCH) {\n      //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n      /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n      s.strstart += s.match_length;\n      s.match_length = 0;\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nconst deflate_huff = (s, flush) => {\n\n  let bflush;             /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we have a literal to write. */\n    if (s.lookahead === 0) {\n      fill_window(s);\n      if (s.lookahead === 0) {\n        if (flush === Z_NO_FLUSH$2) {\n          return BS_NEED_MORE;\n        }\n        break;      /* flush the current block */\n      }\n    }\n\n    /* Output a literal byte */\n    s.match_length = 0;\n    //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n    /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart]);\n    s.lookahead--;\n    s.strstart++;\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n  this.good_length = good_length;\n  this.max_lazy = max_lazy;\n  this.nice_length = nice_length;\n  this.max_chain = max_chain;\n  this.func = func;\n}\n\nconst configuration_table = [\n  /*      good lazy nice chain */\n  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */\n  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */\n  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */\n  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */\n\n  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */\n  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */\n  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */\n  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */\n  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */\n  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nconst lm_init = (s) => {\n\n  s.window_size = 2 * s.w_size;\n\n  /*** CLEAR_HASH(s); ***/\n  zero(s.head); // Fill with NIL (= 0);\n\n  /* Set the default configuration parameters:\n   */\n  s.max_lazy_match = configuration_table[s.level].max_lazy;\n  s.good_match = configuration_table[s.level].good_length;\n  s.nice_match = configuration_table[s.level].nice_length;\n  s.max_chain_length = configuration_table[s.level].max_chain;\n\n  s.strstart = 0;\n  s.block_start = 0;\n  s.lookahead = 0;\n  s.insert = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n  this.strm = null;            /* pointer back to this zlib stream */\n  this.status = 0;            /* as the name implies */\n  this.pending_buf = null;      /* output still pending */\n  this.pending_buf_size = 0;  /* size of pending_buf */\n  this.pending_out = 0;       /* next pending byte to output to the stream */\n  this.pending = 0;           /* nb of bytes in the pending buffer */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.gzhead = null;         /* gzip header information to write */\n  this.gzindex = 0;           /* where in extra, name, or comment */\n  this.method = Z_DEFLATED$2; /* can only be DEFLATED */\n  this.last_flush = -1;   /* value of flush param for previous deflate call */\n\n  this.w_size = 0;  /* LZ77 window size (32K by default) */\n  this.w_bits = 0;  /* log2(w_size)  (8..16) */\n  this.w_mask = 0;  /* w_size - 1 */\n\n  this.window = null;\n  /* Sliding window. Input bytes are read into the second half of the window,\n   * and move to the first half later to keep a dictionary of at least wSize\n   * bytes. With this organization, matches are limited to a distance of\n   * wSize-MAX_MATCH bytes, but this ensures that IO is always\n   * performed with a length multiple of the block size.\n   */\n\n  this.window_size = 0;\n  /* Actual size of window: 2*wSize, except when the user input buffer\n   * is directly used as sliding window.\n   */\n\n  this.prev = null;\n  /* Link to older string with same hash index. To limit the size of this\n   * array to 64K, this link is maintained only for the last 32K strings.\n   * An index in this array is thus a window index modulo 32K.\n   */\n\n  this.head = null;   /* Heads of the hash chains or NIL. */\n\n  this.ins_h = 0;       /* hash index of string to be inserted */\n  this.hash_size = 0;   /* number of elements in hash table */\n  this.hash_bits = 0;   /* log2(hash_size) */\n  this.hash_mask = 0;   /* hash_size-1 */\n\n  this.hash_shift = 0;\n  /* Number of bits by which ins_h must be shifted at each input\n   * step. It must be such that after MIN_MATCH steps, the oldest\n   * byte no longer takes part in the hash key, that is:\n   *   hash_shift * MIN_MATCH >= hash_bits\n   */\n\n  this.block_start = 0;\n  /* Window position at the beginning of the current output block. Gets\n   * negative when the window is moved backwards.\n   */\n\n  this.match_length = 0;      /* length of best match */\n  this.prev_match = 0;        /* previous match */\n  this.match_available = 0;   /* set if previous match exists */\n  this.strstart = 0;          /* start of string to insert */\n  this.match_start = 0;       /* start of matching string */\n  this.lookahead = 0;         /* number of valid bytes ahead in window */\n\n  this.prev_length = 0;\n  /* Length of the best match at previous step. Matches not greater than this\n   * are discarded. This is used in the lazy match evaluation.\n   */\n\n  this.max_chain_length = 0;\n  /* To speed up deflation, hash chains are never searched beyond this\n   * length.  A higher limit improves compression ratio but degrades the\n   * speed.\n   */\n\n  this.max_lazy_match = 0;\n  /* Attempt to find a better match only when the current match is strictly\n   * smaller than this value. This mechanism is used only for compression\n   * levels >= 4.\n   */\n  // That's alias to max_lazy_match, don't use directly\n  //this.max_insert_length = 0;\n  /* Insert new strings in the hash table only if the match length is not\n   * greater than this length. This saves time but degrades compression.\n   * max_insert_length is used only for compression levels <= 3.\n   */\n\n  this.level = 0;     /* compression level (1..9) */\n  this.strategy = 0;  /* favor or force Huffman coding*/\n\n  this.good_match = 0;\n  /* Use a faster search when the previous match is longer than this */\n\n  this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n              /* used by trees.c: */\n\n  /* Didn't use ct_data typedef below to suppress compiler warning */\n\n  // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */\n  // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n  // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */\n\n  // Use flat array of DOUBLE size, with interleaved fata,\n  // because JS does not support effective\n  this.dyn_ltree  = new Uint16Array(HEAP_SIZE * 2);\n  this.dyn_dtree  = new Uint16Array((2 * D_CODES + 1) * 2);\n  this.bl_tree    = new Uint16Array((2 * BL_CODES + 1) * 2);\n  zero(this.dyn_ltree);\n  zero(this.dyn_dtree);\n  zero(this.bl_tree);\n\n  this.l_desc   = null;         /* desc. for literal tree */\n  this.d_desc   = null;         /* desc. for distance tree */\n  this.bl_desc  = null;         /* desc. for bit length tree */\n\n  //ush bl_count[MAX_BITS+1];\n  this.bl_count = new Uint16Array(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */\n  this.heap = new Uint16Array(2 * L_CODES + 1);  /* heap used to build the Huffman trees */\n  zero(this.heap);\n\n  this.heap_len = 0;               /* number of elements in the heap */\n  this.heap_max = 0;               /* element of largest frequency */\n  /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n   * The same heap array is used to build all trees.\n   */\n\n  this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n  zero(this.depth);\n  /* Depth of each subtree used as tie breaker for trees of equal frequency\n   */\n\n  this.l_buf = 0;          /* buffer index for literals or lengths */\n\n  this.lit_bufsize = 0;\n  /* Size of match buffer for literals/lengths.  There are 4 reasons for\n   * limiting lit_bufsize to 64K:\n   *   - frequencies can be kept in 16 bit counters\n   *   - if compression is not successful for the first block, all input\n   *     data is still in the window so we can still emit a stored block even\n   *     when input comes from standard input.  (This can also be done for\n   *     all blocks if lit_bufsize is not greater than 32K.)\n   *   - if compression is not successful for a file smaller than 64K, we can\n   *     even emit a stored file instead of a stored block (saving 5 bytes).\n   *     This is applicable only for zip (not gzip or zlib).\n   *   - creating new Huffman trees less frequently may not provide fast\n   *     adaptation to changes in the input data statistics. (Take for\n   *     example a binary file with poorly compressible code followed by\n   *     a highly compressible string table.) Smaller buffer sizes give\n   *     fast adaptation but have of course the overhead of transmitting\n   *     trees more frequently.\n   *   - I can't count above 4\n   */\n\n  this.last_lit = 0;      /* running index in l_buf */\n\n  this.d_buf = 0;\n  /* Buffer index for distances. To simplify the code, d_buf and l_buf have\n   * the same number of elements. To use different lengths, an extra flag\n   * array would be necessary.\n   */\n\n  this.opt_len = 0;       /* bit length of current block with optimal trees */\n  this.static_len = 0;    /* bit length of current block with static trees */\n  this.matches = 0;       /* number of string matches in current block */\n  this.insert = 0;        /* bytes at end of window left to insert */\n\n\n  this.bi_buf = 0;\n  /* Output buffer. bits are inserted starting at the bottom (least\n   * significant bits).\n   */\n  this.bi_valid = 0;\n  /* Number of valid bits in bi_buf.  All bits above the last valid bit\n   * are always zero.\n   */\n\n  // Used for window memory init. We safely ignore it for JS. That makes\n  // sense only for pointers and memory check tools.\n  //this.high_water = 0;\n  /* High water mark offset in window for initialized bytes -- bytes above\n   * this are set to zero in order to avoid memory check warnings when\n   * longest match routines access bytes past the input.  This is then\n   * updated to the new high water mark.\n   */\n}\n\n\nconst deflateResetKeep = (strm) => {\n\n  if (!strm || !strm.state) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n  strm.total_in = strm.total_out = 0;\n  strm.data_type = Z_UNKNOWN;\n\n  const s = strm.state;\n  s.pending = 0;\n  s.pending_out = 0;\n\n  if (s.wrap < 0) {\n    s.wrap = -s.wrap;\n    /* was made negative by deflate(..., Z_FINISH); */\n  }\n  s.status = (s.wrap ? INIT_STATE : BUSY_STATE);\n  strm.adler = (s.wrap === 2) ?\n    0  // crc32(0, Z_NULL, 0)\n  :\n    1; // adler32(0, Z_NULL, 0)\n  s.last_flush = Z_NO_FLUSH$2;\n  _tr_init(s);\n  return Z_OK$3;\n};\n\n\nconst deflateReset = (strm) => {\n\n  const ret = deflateResetKeep(strm);\n  if (ret === Z_OK$3) {\n    lm_init(strm.state);\n  }\n  return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n  if (!strm || !strm.state) { return Z_STREAM_ERROR$2; }\n  if (strm.state.wrap !== 2) { return Z_STREAM_ERROR$2; }\n  strm.state.gzhead = head;\n  return Z_OK$3;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => {\n\n  if (!strm) { // === Z_NULL\n    return Z_STREAM_ERROR$2;\n  }\n  let wrap = 1;\n\n  if (level === Z_DEFAULT_COMPRESSION$1) {\n    level = 6;\n  }\n\n  if (windowBits < 0) { /* suppress zlib wrapper */\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n\n  else if (windowBits > 15) {\n    wrap = 2;           /* write gzip wrapper instead */\n    windowBits -= 16;\n  }\n\n\n  if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$2 ||\n    windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n    strategy < 0 || strategy > Z_FIXED) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n\n  if (windowBits === 8) {\n    windowBits = 9;\n  }\n  /* until 256-byte window bug fixed */\n\n  const s = new DeflateState();\n\n  strm.state = s;\n  s.strm = strm;\n\n  s.wrap = wrap;\n  s.gzhead = null;\n  s.w_bits = windowBits;\n  s.w_size = 1 << s.w_bits;\n  s.w_mask = s.w_size - 1;\n\n  s.hash_bits = memLevel + 7;\n  s.hash_size = 1 << s.hash_bits;\n  s.hash_mask = s.hash_size - 1;\n  s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n  s.window = new Uint8Array(s.w_size * 2);\n  s.head = new Uint16Array(s.hash_size);\n  s.prev = new Uint16Array(s.w_size);\n\n  // Don't need mem init magic for JS.\n  //s.high_water = 0;  /* nothing written to s->window yet */\n\n  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n  s.pending_buf_size = s.lit_bufsize * 4;\n\n  //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\n  //s->pending_buf = (uchf *) overlay;\n  s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n  // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n  //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\n  s.d_buf = 1 * s.lit_bufsize;\n\n  //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\n  s.l_buf = (1 + 2) * s.lit_bufsize;\n\n  s.level = level;\n  s.strategy = strategy;\n  s.method = method;\n\n  return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n  return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1);\n};\n\n\nconst deflate$2 = (strm, flush) => {\n\n  let beg, val; // for gzip header write only\n\n  if (!strm || !strm.state ||\n    flush > Z_BLOCK$1 || flush < 0) {\n    return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2;\n  }\n\n  const s = strm.state;\n\n  if (!strm.output ||\n      (!strm.input && strm.avail_in !== 0) ||\n      (s.status === FINISH_STATE && flush !== Z_FINISH$3)) {\n    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2);\n  }\n\n  s.strm = strm; /* just in case */\n  const old_flush = s.last_flush;\n  s.last_flush = flush;\n\n  /* Write the header */\n  if (s.status === INIT_STATE) {\n\n    if (s.wrap === 2) { // GZIP header\n      strm.adler = 0;  //crc32(0L, Z_NULL, 0);\n      put_byte(s, 31);\n      put_byte(s, 139);\n      put_byte(s, 8);\n      if (!s.gzhead) { // s->gzhead == Z_NULL\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, s.level === 9 ? 2 :\n                    (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                     4 : 0));\n        put_byte(s, OS_CODE);\n        s.status = BUSY_STATE;\n      }\n      else {\n        put_byte(s, (s.gzhead.text ? 1 : 0) +\n                    (s.gzhead.hcrc ? 2 : 0) +\n                    (!s.gzhead.extra ? 0 : 4) +\n                    (!s.gzhead.name ? 0 : 8) +\n                    (!s.gzhead.comment ? 0 : 16)\n        );\n        put_byte(s, s.gzhead.time & 0xff);\n        put_byte(s, (s.gzhead.time >> 8) & 0xff);\n        put_byte(s, (s.gzhead.time >> 16) & 0xff);\n        put_byte(s, (s.gzhead.time >> 24) & 0xff);\n        put_byte(s, s.level === 9 ? 2 :\n                    (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                     4 : 0));\n        put_byte(s, s.gzhead.os & 0xff);\n        if (s.gzhead.extra && s.gzhead.extra.length) {\n          put_byte(s, s.gzhead.extra.length & 0xff);\n          put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n        }\n        if (s.gzhead.hcrc) {\n          strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0);\n        }\n        s.gzindex = 0;\n        s.status = EXTRA_STATE;\n      }\n    }\n    else // DEFLATE header\n    {\n      let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8;\n      let level_flags = -1;\n\n      if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n        level_flags = 0;\n      } else if (s.level < 6) {\n        level_flags = 1;\n      } else if (s.level === 6) {\n        level_flags = 2;\n      } else {\n        level_flags = 3;\n      }\n      header |= (level_flags << 6);\n      if (s.strstart !== 0) { header |= PRESET_DICT; }\n      header += 31 - (header % 31);\n\n      s.status = BUSY_STATE;\n      putShortMSB(s, header);\n\n      /* Save the adler32 of the preset dictionary: */\n      if (s.strstart !== 0) {\n        putShortMSB(s, strm.adler >>> 16);\n        putShortMSB(s, strm.adler & 0xffff);\n      }\n      strm.adler = 1; // adler32(0L, Z_NULL, 0);\n    }\n  }\n\n//#ifdef GZIP\n  if (s.status === EXTRA_STATE) {\n    if (s.gzhead.extra/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n\n      while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            break;\n          }\n        }\n        put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n        s.gzindex++;\n      }\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (s.gzindex === s.gzhead.extra.length) {\n        s.gzindex = 0;\n        s.status = NAME_STATE;\n      }\n    }\n    else {\n      s.status = NAME_STATE;\n    }\n  }\n  if (s.status === NAME_STATE) {\n    if (s.gzhead.name/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n      //int val;\n\n      do {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            val = 1;\n            break;\n          }\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.name.length) {\n          val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (val === 0) {\n        s.gzindex = 0;\n        s.status = COMMENT_STATE;\n      }\n    }\n    else {\n      s.status = COMMENT_STATE;\n    }\n  }\n  if (s.status === COMMENT_STATE) {\n    if (s.gzhead.comment/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n      //int val;\n\n      do {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            val = 1;\n            break;\n          }\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.comment.length) {\n          val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (val === 0) {\n        s.status = HCRC_STATE;\n      }\n    }\n    else {\n      s.status = HCRC_STATE;\n    }\n  }\n  if (s.status === HCRC_STATE) {\n    if (s.gzhead.hcrc) {\n      if (s.pending + 2 > s.pending_buf_size) {\n        flush_pending(strm);\n      }\n      if (s.pending + 2 <= s.pending_buf_size) {\n        put_byte(s, strm.adler & 0xff);\n        put_byte(s, (strm.adler >> 8) & 0xff);\n        strm.adler = 0; //crc32(0L, Z_NULL, 0);\n        s.status = BUSY_STATE;\n      }\n    }\n    else {\n      s.status = BUSY_STATE;\n    }\n  }\n//#endif\n\n  /* Flush as much pending output as possible */\n  if (s.pending !== 0) {\n    flush_pending(strm);\n    if (strm.avail_out === 0) {\n      /* Since avail_out is 0, deflate will be called again with\n       * more output space, but possibly with both pending and\n       * avail_in equal to zero. There won't be anything to do,\n       * but this is not an error situation so make sure we\n       * return OK instead of BUF_ERROR at next call of deflate:\n       */\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n\n    /* Make sure there is something to do and avoid duplicate consecutive\n     * flushes. For repeated and useless calls with Z_FINISH, we keep\n     * returning Z_STREAM_END instead of Z_BUF_ERROR.\n     */\n  } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n    flush !== Z_FINISH$3) {\n    return err(strm, Z_BUF_ERROR$1);\n  }\n\n  /* User must not provide more input after the first FINISH: */\n  if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n    return err(strm, Z_BUF_ERROR$1);\n  }\n\n  /* Start a new block or continue the current one.\n   */\n  if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n    (flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE)) {\n    let bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :\n      (s.strategy === Z_RLE ? deflate_rle(s, flush) :\n        configuration_table[s.level].func(s, flush));\n\n    if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n      s.status = FINISH_STATE;\n    }\n    if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n      if (strm.avail_out === 0) {\n        s.last_flush = -1;\n        /* avoid BUF_ERROR next call, see above */\n      }\n      return Z_OK$3;\n      /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n       * of deflate should use the same flush parameter to make sure\n       * that the flush is complete. So we don't have to output an\n       * empty block here, this will be done at next call. This also\n       * ensures that for a very small output buffer, we emit at most\n       * one empty block.\n       */\n    }\n    if (bstate === BS_BLOCK_DONE) {\n      if (flush === Z_PARTIAL_FLUSH) {\n        _tr_align(s);\n      }\n      else if (flush !== Z_BLOCK$1) { /* FULL_FLUSH or SYNC_FLUSH */\n\n        _tr_stored_block(s, 0, 0, false);\n        /* For a full flush, this empty block will be recognized\n         * as a special marker by inflate_sync().\n         */\n        if (flush === Z_FULL_FLUSH$1) {\n          /*** CLEAR_HASH(s); ***/             /* forget history */\n          zero(s.head); // Fill with NIL (= 0);\n\n          if (s.lookahead === 0) {\n            s.strstart = 0;\n            s.block_start = 0;\n            s.insert = 0;\n          }\n        }\n      }\n      flush_pending(strm);\n      if (strm.avail_out === 0) {\n        s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n        return Z_OK$3;\n      }\n    }\n  }\n  //Assert(strm->avail_out > 0, \"bug2\");\n  //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n  if (flush !== Z_FINISH$3) { return Z_OK$3; }\n  if (s.wrap <= 0) { return Z_STREAM_END$3; }\n\n  /* Write the trailer */\n  if (s.wrap === 2) {\n    put_byte(s, strm.adler & 0xff);\n    put_byte(s, (strm.adler >> 8) & 0xff);\n    put_byte(s, (strm.adler >> 16) & 0xff);\n    put_byte(s, (strm.adler >> 24) & 0xff);\n    put_byte(s, strm.total_in & 0xff);\n    put_byte(s, (strm.total_in >> 8) & 0xff);\n    put_byte(s, (strm.total_in >> 16) & 0xff);\n    put_byte(s, (strm.total_in >> 24) & 0xff);\n  }\n  else\n  {\n    putShortMSB(s, strm.adler >>> 16);\n    putShortMSB(s, strm.adler & 0xffff);\n  }\n\n  flush_pending(strm);\n  /* If avail_out is zero, the application will call deflate again\n   * to flush the rest.\n   */\n  if (s.wrap > 0) { s.wrap = -s.wrap; }\n  /* write the trailer only once! */\n  return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3;\n};\n\n\nconst deflateEnd = (strm) => {\n\n  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  const status = strm.state.status;\n  if (status !== INIT_STATE &&\n    status !== EXTRA_STATE &&\n    status !== NAME_STATE &&\n    status !== COMMENT_STATE &&\n    status !== HCRC_STATE &&\n    status !== BUSY_STATE &&\n    status !== FINISH_STATE\n  ) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n  strm.state = null;\n\n  return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3;\n};\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nconst deflateSetDictionary = (strm, dictionary) => {\n\n  let dictLength = dictionary.length;\n\n  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  const s = strm.state;\n  const wrap = s.wrap;\n\n  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n  if (wrap === 1) {\n    /* adler32(strm->adler, dictionary, dictLength); */\n    strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0);\n  }\n\n  s.wrap = 0;   /* avoid computing Adler-32 in read_buf */\n\n  /* if dictionary would fill window, just replace the history */\n  if (dictLength >= s.w_size) {\n    if (wrap === 0) {            /* already empty otherwise */\n      /*** CLEAR_HASH(s); ***/\n      zero(s.head); // Fill with NIL (= 0);\n      s.strstart = 0;\n      s.block_start = 0;\n      s.insert = 0;\n    }\n    /* use the tail */\n    // dictionary = dictionary.slice(dictLength - s.w_size);\n    let tmpDict = new Uint8Array(s.w_size);\n    tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n    dictionary = tmpDict;\n    dictLength = s.w_size;\n  }\n  /* insert dictionary into window and hash */\n  const avail = strm.avail_in;\n  const next = strm.next_in;\n  const input = strm.input;\n  strm.avail_in = dictLength;\n  strm.next_in = 0;\n  strm.input = dictionary;\n  fill_window(s);\n  while (s.lookahead >= MIN_MATCH) {\n    let str = s.strstart;\n    let n = s.lookahead - (MIN_MATCH - 1);\n    do {\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n      s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n      s.head[s.ins_h] = str;\n      str++;\n    } while (--n);\n    s.strstart = str;\n    s.lookahead = MIN_MATCH - 1;\n    fill_window(s);\n  }\n  s.strstart += s.lookahead;\n  s.block_start = s.strstart;\n  s.insert = s.lookahead;\n  s.lookahead = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  strm.next_in = next;\n  strm.input = input;\n  strm.avail_in = avail;\n  s.wrap = wrap;\n  return Z_OK$3;\n};\n\n\nvar deflateInit_1 = deflateInit;\nvar deflateInit2_1 = deflateInit2;\nvar deflateReset_1 = deflateReset;\nvar deflateResetKeep_1 = deflateResetKeep;\nvar deflateSetHeader_1 = deflateSetHeader;\nvar deflate_2$1 = deflate$2;\nvar deflateEnd_1 = deflateEnd;\nvar deflateSetDictionary_1 = deflateSetDictionary;\nvar deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n*/\n\nvar deflate_1$2 = {\n\tdeflateInit: deflateInit_1,\n\tdeflateInit2: deflateInit2_1,\n\tdeflateReset: deflateReset_1,\n\tdeflateResetKeep: deflateResetKeep_1,\n\tdeflateSetHeader: deflateSetHeader_1,\n\tdeflate: deflate_2$1,\n\tdeflateEnd: deflateEnd_1,\n\tdeflateSetDictionary: deflateSetDictionary_1,\n\tdeflateInfo: deflateInfo\n};\n\nconst _has = (obj, key) => {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nvar assign = function (obj /*from1, from2, from3, ...*/) {\n  const sources = Array.prototype.slice.call(arguments, 1);\n  while (sources.length) {\n    const source = sources.shift();\n    if (!source) { continue; }\n\n    if (typeof source !== 'object') {\n      throw new TypeError(source + 'must be non-object');\n    }\n\n    for (const p in source) {\n      if (_has(source, p)) {\n        obj[p] = source[p];\n      }\n    }\n  }\n\n  return obj;\n};\n\n\n// Join array of chunks to single array.\nvar flattenChunks = (chunks) => {\n  // calculate data length\n  let len = 0;\n\n  for (let i = 0, l = chunks.length; i < l; i++) {\n    len += chunks[i].length;\n  }\n\n  // join chunks\n  const result = new Uint8Array(len);\n\n  for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n    let chunk = chunks[i];\n    result.set(chunk, pos);\n    pos += chunk.length;\n  }\n\n  return result;\n};\n\nvar common = {\n\tassign: assign,\n\tflattenChunks: flattenChunks\n};\n\n// String encode/decode helpers\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n  _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nvar string2buf = (str) => {\n  if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n    return new TextEncoder().encode(str);\n  }\n\n  let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n  // count binary size\n  for (m_pos = 0; m_pos < str_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n  }\n\n  // allocate buffer\n  buf = new Uint8Array(buf_len);\n\n  // convert\n  for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    if (c < 0x80) {\n      /* one byte */\n      buf[i++] = c;\n    } else if (c < 0x800) {\n      /* two bytes */\n      buf[i++] = 0xC0 | (c >>> 6);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else if (c < 0x10000) {\n      /* three bytes */\n      buf[i++] = 0xE0 | (c >>> 12);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else {\n      /* four bytes */\n      buf[i++] = 0xf0 | (c >>> 18);\n      buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    }\n  }\n\n  return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n  // On Chrome, the arguments in a function call that are allowed is `65534`.\n  // If the length of the buffer is smaller than that, we can use this optimization,\n  // otherwise we will take a slower path.\n  if (len < 65534) {\n    if (buf.subarray && STR_APPLY_UIA_OK) {\n      return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n    }\n  }\n\n  let result = '';\n  for (let i = 0; i < len; i++) {\n    result += String.fromCharCode(buf[i]);\n  }\n  return result;\n};\n\n\n// convert array to string\nvar buf2string = (buf, max) => {\n  const len = max || buf.length;\n\n  if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n    return new TextDecoder().decode(buf.subarray(0, max));\n  }\n\n  let i, out;\n\n  // Reserve max possible length (2 words per char)\n  // NB: by unknown reasons, Array is significantly faster for\n  //     String.fromCharCode.apply than Uint16Array.\n  const utf16buf = new Array(len * 2);\n\n  for (out = 0, i = 0; i < len;) {\n    let c = buf[i++];\n    // quick process ascii\n    if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n    let c_len = _utf8len[c];\n    // skip 5 & 6 byte codes\n    if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n    // apply mask on first byte\n    c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n    // join the rest\n    while (c_len > 1 && i < len) {\n      c = (c << 6) | (buf[i++] & 0x3f);\n      c_len--;\n    }\n\n    // terminated by end of string?\n    if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n    if (c < 0x10000) {\n      utf16buf[out++] = c;\n    } else {\n      c -= 0x10000;\n      utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n      utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n    }\n  }\n\n  return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max   - length limit (mandatory);\nvar utf8border = (buf, max) => {\n\n  max = max || buf.length;\n  if (max > buf.length) { max = buf.length; }\n\n  // go back from last position, until start of sequence found\n  let pos = max - 1;\n  while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n  // Very small and broken sequence,\n  // return max, because we should return something anyway.\n  if (pos < 0) { return max; }\n\n  // If we came to start of buffer - that means buffer is too small,\n  // return max too.\n  if (pos === 0) { return max; }\n\n  return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n\nvar strings = {\n\tstring2buf: string2buf,\n\tbuf2string: buf2string,\n\tutf8border: utf8border\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n  /* next input byte */\n  this.input = null; // JS specific, because we have no pointers\n  this.next_in = 0;\n  /* number of bytes available at input */\n  this.avail_in = 0;\n  /* total number of input bytes read so far */\n  this.total_in = 0;\n  /* next output byte should be put there */\n  this.output = null; // JS specific, because we have no pointers\n  this.next_out = 0;\n  /* remaining free space at output */\n  this.avail_out = 0;\n  /* total number of bytes output so far */\n  this.total_out = 0;\n  /* last error message, NULL if no error */\n  this.msg = ''/*Z_NULL*/;\n  /* not visible by applications */\n  this.state = null;\n  /* best guess about the data type: binary or text */\n  this.data_type = 2/*Z_UNKNOWN*/;\n  /* adler32 value of the uncompressed data */\n  this.adler = 0;\n}\n\nvar zstream = ZStream;\n\nconst toString$1 = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2,\n  Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2,\n  Z_DEFAULT_COMPRESSION,\n  Z_DEFAULT_STRATEGY,\n  Z_DEFLATED: Z_DEFLATED$1\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n *   - `text` (Boolean) - true if compressed data believed to be text\n *   - `time` (Number) - modification time, unix timestamp\n *   - `os` (Number) - operation system code\n *   - `extra` (Array) - array of bytes with extra data (max 65536)\n *   - `name` (String) - file name (binary string)\n *   - `comment` (String) - comment (binary string)\n *   - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n *   , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n *   , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true);  // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate$1(options) {\n  this.options = common.assign({\n    level: Z_DEFAULT_COMPRESSION,\n    method: Z_DEFLATED$1,\n    chunkSize: 16384,\n    windowBits: 15,\n    memLevel: 8,\n    strategy: Z_DEFAULT_STRATEGY\n  }, options || {});\n\n  let opt = this.options;\n\n  if (opt.raw && (opt.windowBits > 0)) {\n    opt.windowBits = -opt.windowBits;\n  }\n\n  else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n    opt.windowBits += 16;\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm = new zstream();\n  this.strm.avail_out = 0;\n\n  let status = deflate_1$2.deflateInit2(\n    this.strm,\n    opt.level,\n    opt.method,\n    opt.windowBits,\n    opt.memLevel,\n    opt.strategy\n  );\n\n  if (status !== Z_OK$2) {\n    throw new Error(messages[status]);\n  }\n\n  if (opt.header) {\n    deflate_1$2.deflateSetHeader(this.strm, opt.header);\n  }\n\n  if (opt.dictionary) {\n    let dict;\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      // If we need to compress text, change encoding to utf8.\n      dict = strings.string2buf(opt.dictionary);\n    } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') {\n      dict = new Uint8Array(opt.dictionary);\n    } else {\n      dict = opt.dictionary;\n    }\n\n    status = deflate_1$2.deflateSetDictionary(this.strm, dict);\n\n    if (status !== Z_OK$2) {\n      throw new Error(messages[status]);\n    }\n\n    this._dict_set = true;\n  }\n}\n\n/**\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be\n *   converted to utf8 byte sequence.\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nDeflate$1.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  let status, _flush_mode;\n\n  if (this.ended) { return false; }\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1;\n\n  // Convert data if needed\n  if (typeof data === 'string') {\n    // If we need to compress text, change encoding to utf8.\n    strm.input = strings.string2buf(data);\n  } else if (toString$1.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    // Make sure avail_out > 6 to avoid repeating markers\n    if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    status = deflate_1$2.deflate(strm, _flush_mode);\n\n    // Ended => flush and finish\n    if (status === Z_STREAM_END$2) {\n      if (strm.next_out > 0) {\n        this.onData(strm.output.subarray(0, strm.next_out));\n      }\n      status = deflate_1$2.deflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return status === Z_OK$2;\n    }\n\n    // Flush if out buffer full\n    if (strm.avail_out === 0) {\n      this.onData(strm.output);\n      continue;\n    }\n\n    // Flush if requested and has data\n    if (_flush_mode > 0 && strm.next_out > 0) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate$1.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate$1.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK$2) {\n    this.result = common.flattenChunks(this.chunks);\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate$1(input, options) {\n  const deflator = new Deflate$1(options);\n\n  deflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (deflator.err) { throw deflator.msg || messages[deflator.err]; }\n\n  return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw$1(input, options) {\n  options = options || {};\n  options.raw = true;\n  return deflate$1(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip$1(input, options) {\n  options = options || {};\n  options.gzip = true;\n  return deflate$1(input, options);\n}\n\n\nvar Deflate_1$1 = Deflate$1;\nvar deflate_2 = deflate$1;\nvar deflateRaw_1$1 = deflateRaw$1;\nvar gzip_1$1 = gzip$1;\nvar constants$1 = constants$2;\n\nvar deflate_1$1 = {\n\tDeflate: Deflate_1$1,\n\tdeflate: deflate_2,\n\tdeflateRaw: deflateRaw_1$1,\n\tgzip: gzip_1$1,\n\tconstants: constants$1\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nconst BAD$1 = 30;       /* got a data error -- remain here until reset */\nconst TYPE$1 = 12;      /* i: waiting for type bits, including last-flag bit */\n\n/*\n   Decode literal, length, and distance codes and write out the resulting\n   literal and match bytes until either not enough input or output is\n   available, an end-of-block is encountered, or a data error is encountered.\n   When large enough input and output buffers are supplied to inflate(), for\n   example, a 16K input buffer and a 64K output buffer, more than 95% of the\n   inflate execution time is spent in this routine.\n\n   Entry assumptions:\n\n        state.mode === LEN\n        strm.avail_in >= 6\n        strm.avail_out >= 258\n        start >= strm.avail_out\n        state.bits < 8\n\n   On return, state.mode is one of:\n\n        LEN -- ran out of enough output space or enough available input\n        TYPE -- reached end of block code, inflate() to interpret next block\n        BAD -- error in block data\n\n   Notes:\n\n    - The maximum input bits used by a length/distance pair is 15 bits for the\n      length code, 5 bits for the length extra, 15 bits for the distance code,\n      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.\n      Therefore if strm.avail_in >= 6, then there is enough input to avoid\n      checking for available input while decoding.\n\n    - The maximum bytes that a single length/distance pair can output is 258\n      bytes, which is the maximum length that can be coded.  inflate_fast()\n      requires strm.avail_out >= 258 for each loop to avoid checking for\n      output space.\n */\nvar inffast = function inflate_fast(strm, start) {\n  let _in;                    /* local strm.input */\n  let last;                   /* have enough input while in < last */\n  let _out;                   /* local strm.output */\n  let beg;                    /* inflate()'s initial strm.output */\n  let end;                    /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n  let dmax;                   /* maximum distance from zlib header */\n//#endif\n  let wsize;                  /* window size or zero if not using window */\n  let whave;                  /* valid bytes in the window */\n  let wnext;                  /* window write index */\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n  let s_window;               /* allocated sliding window, if wsize != 0 */\n  let hold;                   /* local strm.hold */\n  let bits;                   /* local strm.bits */\n  let lcode;                  /* local strm.lencode */\n  let dcode;                  /* local strm.distcode */\n  let lmask;                  /* mask for first level of length codes */\n  let dmask;                  /* mask for first level of distance codes */\n  let here;                   /* retrieved table entry */\n  let op;                     /* code bits, operation, extra bits, or */\n                              /*  window position, window bytes to copy */\n  let len;                    /* match length, unused bytes */\n  let dist;                   /* match distance */\n  let from;                   /* where to copy match from */\n  let from_source;\n\n\n  let input, output; // JS specific, because we have no pointers\n\n  /* copy state to local variables */\n  const state = strm.state;\n  //here = state.here;\n  _in = strm.next_in;\n  input = strm.input;\n  last = _in + (strm.avail_in - 5);\n  _out = strm.next_out;\n  output = strm.output;\n  beg = _out - (start - strm.avail_out);\n  end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n  dmax = state.dmax;\n//#endif\n  wsize = state.wsize;\n  whave = state.whave;\n  wnext = state.wnext;\n  s_window = state.window;\n  hold = state.hold;\n  bits = state.bits;\n  lcode = state.lencode;\n  dcode = state.distcode;\n  lmask = (1 << state.lenbits) - 1;\n  dmask = (1 << state.distbits) - 1;\n\n\n  /* decode literals and length/distances until end-of-block or not enough\n     input data or output space */\n\n  top:\n  do {\n    if (bits < 15) {\n      hold += input[_in++] << bits;\n      bits += 8;\n      hold += input[_in++] << bits;\n      bits += 8;\n    }\n\n    here = lcode[hold & lmask];\n\n    dolen:\n    for (;;) { // Goto emulation\n      op = here >>> 24/*here.bits*/;\n      hold >>>= op;\n      bits -= op;\n      op = (here >>> 16) & 0xff/*here.op*/;\n      if (op === 0) {                          /* literal */\n        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n        //        \"inflate:         literal '%c'\\n\" :\n        //        \"inflate:         literal 0x%02x\\n\", here.val));\n        output[_out++] = here & 0xffff/*here.val*/;\n      }\n      else if (op & 16) {                     /* length base */\n        len = here & 0xffff/*here.val*/;\n        op &= 15;                           /* number of extra bits */\n        if (op) {\n          if (bits < op) {\n            hold += input[_in++] << bits;\n            bits += 8;\n          }\n          len += hold & ((1 << op) - 1);\n          hold >>>= op;\n          bits -= op;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", len));\n        if (bits < 15) {\n          hold += input[_in++] << bits;\n          bits += 8;\n          hold += input[_in++] << bits;\n          bits += 8;\n        }\n        here = dcode[hold & dmask];\n\n        dodist:\n        for (;;) { // goto emulation\n          op = here >>> 24/*here.bits*/;\n          hold >>>= op;\n          bits -= op;\n          op = (here >>> 16) & 0xff/*here.op*/;\n\n          if (op & 16) {                      /* distance base */\n            dist = here & 0xffff/*here.val*/;\n            op &= 15;                       /* number of extra bits */\n            if (bits < op) {\n              hold += input[_in++] << bits;\n              bits += 8;\n              if (bits < op) {\n                hold += input[_in++] << bits;\n                bits += 8;\n              }\n            }\n            dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n            if (dist > dmax) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD$1;\n              break top;\n            }\n//#endif\n            hold >>>= op;\n            bits -= op;\n            //Tracevv((stderr, \"inflate:         distance %u\\n\", dist));\n            op = _out - beg;                /* max distance in output */\n            if (dist > op) {                /* see if copy from window */\n              op = dist - op;               /* distance back in window */\n              if (op > whave) {\n                if (state.sane) {\n                  strm.msg = 'invalid distance too far back';\n                  state.mode = BAD$1;\n                  break top;\n                }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//                if (len <= op - whave) {\n//                  do {\n//                    output[_out++] = 0;\n//                  } while (--len);\n//                  continue top;\n//                }\n//                len -= op - whave;\n//                do {\n//                  output[_out++] = 0;\n//                } while (--op > whave);\n//                if (op === 0) {\n//                  from = _out - dist;\n//                  do {\n//                    output[_out++] = output[from++];\n//                  } while (--len);\n//                  continue top;\n//                }\n//#endif\n              }\n              from = 0; // window index\n              from_source = s_window;\n              if (wnext === 0) {           /* very common case */\n                from += wsize - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              else if (wnext < op) {      /* wrap around window */\n                from += wsize + wnext - op;\n                op -= wnext;\n                if (op < len) {         /* some from end of window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = 0;\n                  if (wnext < len) {  /* some from start of window */\n                    op = wnext;\n                    len -= op;\n                    do {\n                      output[_out++] = s_window[from++];\n                    } while (--op);\n                    from = _out - dist;      /* rest from output */\n                    from_source = output;\n                  }\n                }\n              }\n              else {                      /* contiguous in window */\n                from += wnext - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              while (len > 2) {\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                len -= 3;\n              }\n              if (len) {\n                output[_out++] = from_source[from++];\n                if (len > 1) {\n                  output[_out++] = from_source[from++];\n                }\n              }\n            }\n            else {\n              from = _out - dist;          /* copy direct from output */\n              do {                        /* minimum length is three */\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                len -= 3;\n              } while (len > 2);\n              if (len) {\n                output[_out++] = output[from++];\n                if (len > 1) {\n                  output[_out++] = output[from++];\n                }\n              }\n            }\n          }\n          else if ((op & 64) === 0) {          /* 2nd level distance code */\n            here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n            continue dodist;\n          }\n          else {\n            strm.msg = 'invalid distance code';\n            state.mode = BAD$1;\n            break top;\n          }\n\n          break; // need to emulate goto via \"continue\"\n        }\n      }\n      else if ((op & 64) === 0) {              /* 2nd level length code */\n        here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n        continue dolen;\n      }\n      else if (op & 32) {                     /* end-of-block */\n        //Tracevv((stderr, \"inflate:         end of block\\n\"));\n        state.mode = TYPE$1;\n        break top;\n      }\n      else {\n        strm.msg = 'invalid literal/length code';\n        state.mode = BAD$1;\n        break top;\n      }\n\n      break; // need to emulate goto via \"continue\"\n    }\n  } while (_in < last && _out < end);\n\n  /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n  len = bits >> 3;\n  _in -= len;\n  bits -= len << 3;\n  hold &= (1 << bits) - 1;\n\n  /* update state and return */\n  strm.next_in = _in;\n  strm.next_out = _out;\n  strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n  strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n  state.hold = hold;\n  state.bits = bits;\n  return;\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst MAXBITS = 15;\nconst ENOUGH_LENS$1 = 852;\nconst ENOUGH_DISTS$1 = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES$1 = 0;\nconst LENS$1 = 1;\nconst DISTS$1 = 2;\n\nconst lbase = new Uint16Array([ /* Length codes 257..285 base */\n  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ /* Length codes 257..285 extra */\n  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n]);\n\nconst dbase = new Uint16Array([ /* Distance codes 0..29 base */\n  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n  8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ /* Distance codes 0..29 extra */\n  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n  28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n  const bits = opts.bits;\n      //here = opts.here; /* table entry for duplication */\n\n  let len = 0;               /* a code's length in bits */\n  let sym = 0;               /* index of code symbols */\n  let min = 0, max = 0;          /* minimum and maximum code lengths */\n  let root = 0;              /* number of index bits for root table */\n  let curr = 0;              /* number of index bits for current table */\n  let drop = 0;              /* code bits to drop for sub-table */\n  let left = 0;                   /* number of prefix codes available */\n  let used = 0;              /* code entries in table used */\n  let huff = 0;              /* Huffman code */\n  let incr;              /* for incrementing code, index */\n  let fill;              /* index for replicating entries */\n  let low;               /* low bits for current root entry */\n  let mask;              /* mask for low root bits */\n  let next;             /* next available space in table */\n  let base = null;     /* base value table to use */\n  let base_index = 0;\n//  let shoextra;    /* extra bits table to use */\n  let end;                    /* use base and extra for symbol > end */\n  const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */\n  const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */\n  let extra = null;\n  let extra_index = 0;\n\n  let here_bits, here_op, here_val;\n\n  /*\n   Process a set of code lengths to create a canonical Huffman code.  The\n   code lengths are lens[0..codes-1].  Each length corresponds to the\n   symbols 0..codes-1.  The Huffman code is generated by first sorting the\n   symbols by length from short to long, and retaining the symbol order\n   for codes with equal lengths.  Then the code starts with all zero bits\n   for the first code of the shortest length, and the codes are integer\n   increments for the same length, and zeros are appended as the length\n   increases.  For the deflate format, these bits are stored backwards\n   from their more natural integer increment ordering, and so when the\n   decoding tables are built in the large loop below, the integer codes\n   are incremented backwards.\n\n   This routine assumes, but does not check, that all of the entries in\n   lens[] are in the range 0..MAXBITS.  The caller must assure this.\n   1..MAXBITS is interpreted as that code length.  zero means that that\n   symbol does not occur in this code.\n\n   The codes are sorted by computing a count of codes for each length,\n   creating from that a table of starting indices for each length in the\n   sorted table, and then entering the symbols in order in the sorted\n   table.  The sorted table is work[], with that space being provided by\n   the caller.\n\n   The length counts are used for other purposes as well, i.e. finding\n   the minimum and maximum length codes, determining if there are any\n   codes at all, checking for a valid set of lengths, and looking ahead\n   at length counts to determine sub-table sizes when building the\n   decoding tables.\n   */\n\n  /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n  for (len = 0; len <= MAXBITS; len++) {\n    count[len] = 0;\n  }\n  for (sym = 0; sym < codes; sym++) {\n    count[lens[lens_index + sym]]++;\n  }\n\n  /* bound code lengths, force root to be within code lengths */\n  root = bits;\n  for (max = MAXBITS; max >= 1; max--) {\n    if (count[max] !== 0) { break; }\n  }\n  if (root > max) {\n    root = max;\n  }\n  if (max === 0) {                     /* no symbols to code at all */\n    //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */\n    //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;\n    //table.val[opts.table_index++] = 0;   //here.val = (var short)0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n    //table.op[opts.table_index] = 64;\n    //table.bits[opts.table_index] = 1;\n    //table.val[opts.table_index++] = 0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n    opts.bits = 1;\n    return 0;     /* no symbols, but wait for decoding to report error */\n  }\n  for (min = 1; min < max; min++) {\n    if (count[min] !== 0) { break; }\n  }\n  if (root < min) {\n    root = min;\n  }\n\n  /* check for an over-subscribed or incomplete set of lengths */\n  left = 1;\n  for (len = 1; len <= MAXBITS; len++) {\n    left <<= 1;\n    left -= count[len];\n    if (left < 0) {\n      return -1;\n    }        /* over-subscribed */\n  }\n  if (left > 0 && (type === CODES$1 || max !== 1)) {\n    return -1;                      /* incomplete set */\n  }\n\n  /* generate offsets into symbol table for each length for sorting */\n  offs[1] = 0;\n  for (len = 1; len < MAXBITS; len++) {\n    offs[len + 1] = offs[len] + count[len];\n  }\n\n  /* sort symbols by length, by symbol order within each length */\n  for (sym = 0; sym < codes; sym++) {\n    if (lens[lens_index + sym] !== 0) {\n      work[offs[lens[lens_index + sym]]++] = sym;\n    }\n  }\n\n  /*\n   Create and fill in decoding tables.  In this loop, the table being\n   filled is at next and has curr index bits.  The code being used is huff\n   with length len.  That code is converted to an index by dropping drop\n   bits off of the bottom.  For codes where len is less than drop + curr,\n   those top drop + curr - len bits are incremented through all values to\n   fill the table with replicated entries.\n\n   root is the number of index bits for the root table.  When len exceeds\n   root, sub-tables are created pointed to by the root entry with an index\n   of the low root bits of huff.  This is saved in low to check for when a\n   new sub-table should be started.  drop is zero when the root table is\n   being filled, and drop is root when sub-tables are being filled.\n\n   When a new sub-table is needed, it is necessary to look ahead in the\n   code lengths to determine what size sub-table is needed.  The length\n   counts are used for this, and so count[] is decremented as codes are\n   entered in the tables.\n\n   used keeps track of how many table entries have been allocated from the\n   provided *table space.  It is checked for LENS and DIST tables against\n   the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n   the initial root table size constants.  See the comments in inftrees.h\n   for more information.\n\n   sym increments through all symbols, and the loop terminates when\n   all codes of length max, i.e. all codes, have been processed.  This\n   routine permits incomplete codes, so another loop after this one fills\n   in the rest of the decoding tables with invalid code markers.\n   */\n\n  /* set up for code type */\n  // poor man optimization - use if-else instead of switch,\n  // to avoid deopts in old v8\n  if (type === CODES$1) {\n    base = extra = work;    /* dummy value--not used */\n    end = 19;\n\n  } else if (type === LENS$1) {\n    base = lbase;\n    base_index -= 257;\n    extra = lext;\n    extra_index -= 257;\n    end = 256;\n\n  } else {                    /* DISTS */\n    base = dbase;\n    extra = dext;\n    end = -1;\n  }\n\n  /* initialize opts for loop */\n  huff = 0;                   /* starting code */\n  sym = 0;                    /* starting code symbol */\n  len = min;                  /* starting code length */\n  next = table_index;              /* current table to fill in */\n  curr = root;                /* current table index bits */\n  drop = 0;                   /* current bits to drop from code for index */\n  low = -1;                   /* trigger new sub-table when len > root */\n  used = 1 << root;          /* use root table entries */\n  mask = used - 1;            /* mask for comparing low */\n\n  /* check available table space */\n  if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n    (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n    return 1;\n  }\n\n  /* process all codes and make table entries */\n  for (;;) {\n    /* create table entry */\n    here_bits = len - drop;\n    if (work[sym] < end) {\n      here_op = 0;\n      here_val = work[sym];\n    }\n    else if (work[sym] > end) {\n      here_op = extra[extra_index + work[sym]];\n      here_val = base[base_index + work[sym]];\n    }\n    else {\n      here_op = 32 + 64;         /* end of block */\n      here_val = 0;\n    }\n\n    /* replicate for those indices with low len bits equal to huff */\n    incr = 1 << (len - drop);\n    fill = 1 << curr;\n    min = fill;                 /* save offset to next table */\n    do {\n      fill -= incr;\n      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n    } while (fill !== 0);\n\n    /* backwards increment the len-bit code huff */\n    incr = 1 << (len - 1);\n    while (huff & incr) {\n      incr >>= 1;\n    }\n    if (incr !== 0) {\n      huff &= incr - 1;\n      huff += incr;\n    } else {\n      huff = 0;\n    }\n\n    /* go to next symbol, update count, len */\n    sym++;\n    if (--count[len] === 0) {\n      if (len === max) { break; }\n      len = lens[lens_index + work[sym]];\n    }\n\n    /* create new sub-table if needed */\n    if (len > root && (huff & mask) !== low) {\n      /* if first time, transition to sub-tables */\n      if (drop === 0) {\n        drop = root;\n      }\n\n      /* increment past last table */\n      next += min;            /* here min is 1 << curr */\n\n      /* determine length of next table */\n      curr = len - drop;\n      left = 1 << curr;\n      while (curr + drop < max) {\n        left -= count[curr + drop];\n        if (left <= 0) { break; }\n        curr++;\n        left <<= 1;\n      }\n\n      /* check for enough space */\n      used += 1 << curr;\n      if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n        (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n        return 1;\n      }\n\n      /* point entry in root table to sub-table */\n      low = huff & mask;\n      /*table.op[low] = curr;\n      table.bits[low] = root;\n      table.val[low] = next - opts.table_index;*/\n      table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n    }\n  }\n\n  /* fill in remaining table entry if code is incomplete (guaranteed to have\n   at most one remaining entry, since if the code is incomplete, the\n   maximum code length that was allowed to get this far is one bit) */\n  if (huff !== 0) {\n    //table.op[next + huff] = 64;            /* invalid code marker */\n    //table.bits[next + huff] = len - drop;\n    //table.val[next + huff] = 0;\n    table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n  }\n\n  /* set return parameters */\n  //opts.table_index += used;\n  opts.bits = root;\n  return 0;\n};\n\n\nvar inftrees = inflate_table;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n\n\n\n\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES,\n  Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR,\n  Z_DEFLATED\n} = constants$2;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nconst    HEAD = 1;       /* i: waiting for magic header */\nconst    FLAGS = 2;      /* i: waiting for method and flags (gzip) */\nconst    TIME = 3;       /* i: waiting for modification time (gzip) */\nconst    OS = 4;         /* i: waiting for extra flags and operating system (gzip) */\nconst    EXLEN = 5;      /* i: waiting for extra length (gzip) */\nconst    EXTRA = 6;      /* i: waiting for extra bytes (gzip) */\nconst    NAME = 7;       /* i: waiting for end of file name (gzip) */\nconst    COMMENT = 8;    /* i: waiting for end of comment (gzip) */\nconst    HCRC = 9;       /* i: waiting for header crc (gzip) */\nconst    DICTID = 10;    /* i: waiting for dictionary check value */\nconst    DICT = 11;      /* waiting for inflateSetDictionary() call */\nconst        TYPE = 12;      /* i: waiting for type bits, including last-flag bit */\nconst        TYPEDO = 13;    /* i: same, but skip check to exit inflate on new block */\nconst        STORED = 14;    /* i: waiting for stored size (length and complement) */\nconst        COPY_ = 15;     /* i/o: same as COPY below, but only first time in */\nconst        COPY = 16;      /* i/o: waiting for input or output to copy stored block */\nconst        TABLE = 17;     /* i: waiting for dynamic block table lengths */\nconst        LENLENS = 18;   /* i: waiting for code length code lengths */\nconst        CODELENS = 19;  /* i: waiting for length/lit and distance code lengths */\nconst            LEN_ = 20;      /* i: same as LEN below, but only first time in */\nconst            LEN = 21;       /* i: waiting for length/lit/eob code */\nconst            LENEXT = 22;    /* i: waiting for length extra bits */\nconst            DIST = 23;      /* i: waiting for distance code */\nconst            DISTEXT = 24;   /* i: waiting for distance extra bits */\nconst            MATCH = 25;     /* o: waiting for output space to copy string */\nconst            LIT = 26;       /* o: waiting for output space to write literal */\nconst    CHECK = 27;     /* i: waiting for 32-bit check value */\nconst    LENGTH = 28;    /* i: waiting for 32-bit length (gzip) */\nconst    DONE = 29;      /* finished check, done -- remain here until reset */\nconst    BAD = 30;       /* got a data error -- remain here until reset */\nconst    MEM = 31;       /* got an inflate() memory error -- remain here until reset */\nconst    SYNC = 32;      /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n  return  (((q >>> 24) & 0xff) +\n          ((q >>> 8) & 0xff00) +\n          ((q & 0xff00) << 8) +\n          ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n  this.mode = 0;             /* current inflate mode */\n  this.last = false;          /* true if processing last block */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.havedict = false;      /* true if dictionary provided */\n  this.flags = 0;             /* gzip header method and flags (0 if zlib) */\n  this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */\n  this.check = 0;             /* protected copy of check value */\n  this.total = 0;             /* protected copy of output count */\n  // TODO: may be {}\n  this.head = null;           /* where to save gzip header information */\n\n  /* sliding window */\n  this.wbits = 0;             /* log base 2 of requested window size */\n  this.wsize = 0;             /* window size or zero if not using window */\n  this.whave = 0;             /* valid bytes in the window */\n  this.wnext = 0;             /* window write index */\n  this.window = null;         /* allocated sliding window, if needed */\n\n  /* bit accumulator */\n  this.hold = 0;              /* input bit accumulator */\n  this.bits = 0;              /* number of bits in \"in\" */\n\n  /* for string and stored block copying */\n  this.length = 0;            /* literal or length of data to copy */\n  this.offset = 0;            /* distance back to copy string from */\n\n  /* for table and code decoding */\n  this.extra = 0;             /* extra bits needed */\n\n  /* fixed and dynamic code tables */\n  this.lencode = null;          /* starting table for length/literal codes */\n  this.distcode = null;         /* starting table for distance codes */\n  this.lenbits = 0;           /* index bits for lencode */\n  this.distbits = 0;          /* index bits for distcode */\n\n  /* dynamic table building */\n  this.ncode = 0;             /* number of code length code lengths */\n  this.nlen = 0;              /* number of length code lengths */\n  this.ndist = 0;             /* number of distance code lengths */\n  this.have = 0;              /* number of code lengths in lens[] */\n  this.next = null;              /* next available space in codes[] */\n\n  this.lens = new Uint16Array(320); /* temporary storage for code lengths */\n  this.work = new Uint16Array(288); /* work area for code table building */\n\n  /*\n   because we don't have pointers in js, we use lencode and distcode directly\n   as buffers so we don't need codes\n  */\n  //this.codes = new Int32Array(ENOUGH);       /* space for code tables */\n  this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */\n  this.distdyn = null;             /* dynamic table for distance codes (JS specific) */\n  this.sane = 0;                   /* if false, allow invalid distance too far */\n  this.back = 0;                   /* bits back of last unprocessed length/lit */\n  this.was = 0;                    /* initial length of match */\n}\n\n\nconst inflateResetKeep = (strm) => {\n\n  if (!strm || !strm.state) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  strm.total_in = strm.total_out = state.total = 0;\n  strm.msg = ''; /*Z_NULL*/\n  if (state.wrap) {       /* to support ill-conceived Java test suite */\n    strm.adler = state.wrap & 1;\n  }\n  state.mode = HEAD;\n  state.last = 0;\n  state.havedict = 0;\n  state.dmax = 32768;\n  state.head = null/*Z_NULL*/;\n  state.hold = 0;\n  state.bits = 0;\n  //state.lencode = state.distcode = state.next = state.codes;\n  state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);\n  state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n  state.sane = 1;\n  state.back = -1;\n  //Tracev((stderr, \"inflate: reset\\n\"));\n  return Z_OK$1;\n};\n\n\nconst inflateReset = (strm) => {\n\n  if (!strm || !strm.state) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  state.wsize = 0;\n  state.whave = 0;\n  state.wnext = 0;\n  return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n  let wrap;\n\n  /* get the state */\n  if (!strm || !strm.state) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n\n  /* extract wrap request from windowBits parameter */\n  if (windowBits < 0) {\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n  else {\n    wrap = (windowBits >> 4) + 1;\n    if (windowBits < 48) {\n      windowBits &= 15;\n    }\n  }\n\n  /* set number of window bits, free window if different */\n  if (windowBits && (windowBits < 8 || windowBits > 15)) {\n    return Z_STREAM_ERROR$1;\n  }\n  if (state.window !== null && state.wbits !== windowBits) {\n    state.window = null;\n  }\n\n  /* update state and reset the rest of it */\n  state.wrap = wrap;\n  state.wbits = windowBits;\n  return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n  if (!strm) { return Z_STREAM_ERROR$1; }\n  //strm.msg = Z_NULL;                 /* in case we return an error */\n\n  const state = new InflateState();\n\n  //if (state === Z_NULL) return Z_MEM_ERROR;\n  //Tracev((stderr, \"inflate: allocated\\n\"));\n  strm.state = state;\n  state.window = null/*Z_NULL*/;\n  const ret = inflateReset2(strm, windowBits);\n  if (ret !== Z_OK$1) {\n    strm.state = null/*Z_NULL*/;\n  }\n  return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n  return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding.  Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter.  This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time.  However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n  /* build fixed huffman tables if first call (may not be thread safe) */\n  if (virgin) {\n    lenfix = new Int32Array(512);\n    distfix = new Int32Array(32);\n\n    /* literal/length table */\n    let sym = 0;\n    while (sym < 144) { state.lens[sym++] = 8; }\n    while (sym < 256) { state.lens[sym++] = 9; }\n    while (sym < 280) { state.lens[sym++] = 7; }\n    while (sym < 288) { state.lens[sym++] = 8; }\n\n    inftrees(LENS,  state.lens, 0, 288, lenfix,   0, state.work, { bits: 9 });\n\n    /* distance table */\n    sym = 0;\n    while (sym < 32) { state.lens[sym++] = 5; }\n\n    inftrees(DISTS, state.lens, 0, 32,   distfix, 0, state.work, { bits: 5 });\n\n    /* do this just once */\n    virgin = false;\n  }\n\n  state.lencode = lenfix;\n  state.lenbits = 9;\n  state.distcode = distfix;\n  state.distbits = 5;\n};\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning.  If window does not exist yet, create it.  This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nconst updatewindow = (strm, src, end, copy) => {\n\n  let dist;\n  const state = strm.state;\n\n  /* if it hasn't been done already, allocate space for the window */\n  if (state.window === null) {\n    state.wsize = 1 << state.wbits;\n    state.wnext = 0;\n    state.whave = 0;\n\n    state.window = new Uint8Array(state.wsize);\n  }\n\n  /* copy state->wsize or less output bytes into the circular window */\n  if (copy >= state.wsize) {\n    state.window.set(src.subarray(end - state.wsize, end), 0);\n    state.wnext = 0;\n    state.whave = state.wsize;\n  }\n  else {\n    dist = state.wsize - state.wnext;\n    if (dist > copy) {\n      dist = copy;\n    }\n    //zmemcpy(state->window + state->wnext, end - copy, dist);\n    state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n    copy -= dist;\n    if (copy) {\n      //zmemcpy(state->window, end - copy, copy);\n      state.window.set(src.subarray(end - copy, end), 0);\n      state.wnext = copy;\n      state.whave = state.wsize;\n    }\n    else {\n      state.wnext += dist;\n      if (state.wnext === state.wsize) { state.wnext = 0; }\n      if (state.whave < state.wsize) { state.whave += dist; }\n    }\n  }\n  return 0;\n};\n\n\nconst inflate$2 = (strm, flush) => {\n\n  let state;\n  let input, output;          // input/output buffers\n  let next;                   /* next input INDEX */\n  let put;                    /* next output INDEX */\n  let have, left;             /* available input and output */\n  let hold;                   /* bit buffer */\n  let bits;                   /* bits in bit buffer */\n  let _in, _out;              /* save starting available input and output */\n  let copy;                   /* number of stored or match bytes to copy */\n  let from;                   /* where to copy match bytes from */\n  let from_source;\n  let here = 0;               /* current decoding table entry */\n  let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n  //let last;                   /* parent table entry */\n  let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n  let len;                    /* length to copy for repeats, bits to drop */\n  let ret;                    /* return code */\n  const hbuf = new Uint8Array(4);    /* buffer for gzip header crc calculation */\n  let opts;\n\n  let n; // temporary variable for NEED_BITS\n\n  const order = /* permutation of code lengths */\n    new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n  if (!strm || !strm.state || !strm.output ||\n      (!strm.input && strm.avail_in !== 0)) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  state = strm.state;\n  if (state.mode === TYPE) { state.mode = TYPEDO; }    /* skip check */\n\n\n  //--- LOAD() ---\n  put = strm.next_out;\n  output = strm.output;\n  left = strm.avail_out;\n  next = strm.next_in;\n  input = strm.input;\n  have = strm.avail_in;\n  hold = state.hold;\n  bits = state.bits;\n  //---\n\n  _in = have;\n  _out = left;\n  ret = Z_OK$1;\n\n  inf_leave: // goto emulation\n  for (;;) {\n    switch (state.mode) {\n      case HEAD:\n        if (state.wrap === 0) {\n          state.mode = TYPEDO;\n          break;\n        }\n        //=== NEEDBITS(16);\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((state.wrap & 2) && hold === 0x8b1f) {  /* gzip header */\n          state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          state.mode = FLAGS;\n          break;\n        }\n        state.flags = 0;           /* expect zlib header */\n        if (state.head) {\n          state.head.done = false;\n        }\n        if (!(state.wrap & 1) ||   /* check if zlib header allowed */\n          (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n          strm.msg = 'incorrect header check';\n          state.mode = BAD;\n          break;\n        }\n        if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n        len = (hold & 0x0f)/*BITS(4)*/ + 8;\n        if (state.wbits === 0) {\n          state.wbits = len;\n        }\n        else if (len > state.wbits) {\n          strm.msg = 'invalid window size';\n          state.mode = BAD;\n          break;\n        }\n\n        // !!! pako patch. Force use `options.windowBits` if passed.\n        // Required to always use max window size by default.\n        state.dmax = 1 << state.wbits;\n        //state.dmax = 1 << len;\n\n        //Tracev((stderr, \"inflate:   zlib header ok\\n\"));\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = hold & 0x200 ? DICTID : TYPE;\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        break;\n      case FLAGS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.flags = hold;\n        if ((state.flags & 0xff) !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        if (state.flags & 0xe000) {\n          strm.msg = 'unknown header flags set';\n          state.mode = BAD;\n          break;\n        }\n        if (state.head) {\n          state.head.text = ((hold >> 8) & 1);\n        }\n        if (state.flags & 0x0200) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = TIME;\n        /* falls through */\n      case TIME:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.time = hold;\n        }\n        if (state.flags & 0x0200) {\n          //=== CRC4(state.check, hold)\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          hbuf[2] = (hold >>> 16) & 0xff;\n          hbuf[3] = (hold >>> 24) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 4, 0);\n          //===\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = OS;\n        /* falls through */\n      case OS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.xflags = (hold & 0xff);\n          state.head.os = (hold >> 8);\n        }\n        if (state.flags & 0x0200) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = EXLEN;\n        /* falls through */\n      case EXLEN:\n        if (state.flags & 0x0400) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length = hold;\n          if (state.head) {\n            state.head.extra_len = hold;\n          }\n          if (state.flags & 0x0200) {\n            //=== CRC2(state.check, hold);\n            hbuf[0] = hold & 0xff;\n            hbuf[1] = (hold >>> 8) & 0xff;\n            state.check = crc32_1(state.check, hbuf, 2, 0);\n            //===//\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        else if (state.head) {\n          state.head.extra = null/*Z_NULL*/;\n        }\n        state.mode = EXTRA;\n        /* falls through */\n      case EXTRA:\n        if (state.flags & 0x0400) {\n          copy = state.length;\n          if (copy > have) { copy = have; }\n          if (copy) {\n            if (state.head) {\n              len = state.head.extra_len - state.length;\n              if (!state.head.extra) {\n                // Use untyped array for more convenient processing later\n                state.head.extra = new Uint8Array(state.head.extra_len);\n              }\n              state.head.extra.set(\n                input.subarray(\n                  next,\n                  // extra field is limited to 65536 bytes\n                  // - no need for additional size check\n                  next + copy\n                ),\n                /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n                len\n              );\n              //zmemcpy(state.head.extra + len, next,\n              //        len + copy > state.head.extra_max ?\n              //        state.head.extra_max - len : copy);\n            }\n            if (state.flags & 0x0200) {\n              state.check = crc32_1(state.check, input, copy, next);\n            }\n            have -= copy;\n            next += copy;\n            state.length -= copy;\n          }\n          if (state.length) { break inf_leave; }\n        }\n        state.length = 0;\n        state.mode = NAME;\n        /* falls through */\n      case NAME:\n        if (state.flags & 0x0800) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            // TODO: 2 or 1 bytes?\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.name_max*/)) {\n              state.head.name += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n\n          if (state.flags & 0x0200) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.name = null;\n        }\n        state.length = 0;\n        state.mode = COMMENT;\n        /* falls through */\n      case COMMENT:\n        if (state.flags & 0x1000) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.comm_max*/)) {\n              state.head.comment += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n          if (state.flags & 0x0200) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.comment = null;\n        }\n        state.mode = HCRC;\n        /* falls through */\n      case HCRC:\n        if (state.flags & 0x0200) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if (hold !== (state.check & 0xffff)) {\n            strm.msg = 'header crc mismatch';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        if (state.head) {\n          state.head.hcrc = ((state.flags >> 9) & 1);\n          state.head.done = true;\n        }\n        strm.adler = state.check = 0;\n        state.mode = TYPE;\n        break;\n      case DICTID:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        strm.adler = state.check = zswap32(hold);\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = DICT;\n        /* falls through */\n      case DICT:\n        if (state.havedict === 0) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          return Z_NEED_DICT$1;\n        }\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = TYPE;\n        /* falls through */\n      case TYPE:\n        if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case TYPEDO:\n        if (state.last) {\n          //--- BYTEBITS() ---//\n          hold >>>= bits & 7;\n          bits -= bits & 7;\n          //---//\n          state.mode = CHECK;\n          break;\n        }\n        //=== NEEDBITS(3); */\n        while (bits < 3) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.last = (hold & 0x01)/*BITS(1)*/;\n        //--- DROPBITS(1) ---//\n        hold >>>= 1;\n        bits -= 1;\n        //---//\n\n        switch ((hold & 0x03)/*BITS(2)*/) {\n          case 0:                             /* stored block */\n            //Tracev((stderr, \"inflate:     stored block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = STORED;\n            break;\n          case 1:                             /* fixed block */\n            fixedtables(state);\n            //Tracev((stderr, \"inflate:     fixed codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = LEN_;             /* decode codes */\n            if (flush === Z_TREES) {\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n              break inf_leave;\n            }\n            break;\n          case 2:                             /* dynamic block */\n            //Tracev((stderr, \"inflate:     dynamic codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = TABLE;\n            break;\n          case 3:\n            strm.msg = 'invalid block type';\n            state.mode = BAD;\n        }\n        //--- DROPBITS(2) ---//\n        hold >>>= 2;\n        bits -= 2;\n        //---//\n        break;\n      case STORED:\n        //--- BYTEBITS() ---// /* go to byte boundary */\n        hold >>>= bits & 7;\n        bits -= bits & 7;\n        //---//\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n          strm.msg = 'invalid stored block lengths';\n          state.mode = BAD;\n          break;\n        }\n        state.length = hold & 0xffff;\n        //Tracev((stderr, \"inflate:       stored length %u\\n\",\n        //        state.length));\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = COPY_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case COPY_:\n        state.mode = COPY;\n        /* falls through */\n      case COPY:\n        copy = state.length;\n        if (copy) {\n          if (copy > have) { copy = have; }\n          if (copy > left) { copy = left; }\n          if (copy === 0) { break inf_leave; }\n          //--- zmemcpy(put, next, copy); ---\n          output.set(input.subarray(next, next + copy), put);\n          //---//\n          have -= copy;\n          next += copy;\n          left -= copy;\n          put += copy;\n          state.length -= copy;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       stored end\\n\"));\n        state.mode = TYPE;\n        break;\n      case TABLE:\n        //=== NEEDBITS(14); */\n        while (bits < 14) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n        if (state.nlen > 286 || state.ndist > 30) {\n          strm.msg = 'too many length or distance symbols';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracev((stderr, \"inflate:       table sizes ok\\n\"));\n        state.have = 0;\n        state.mode = LENLENS;\n        /* falls through */\n      case LENLENS:\n        while (state.have < state.ncode) {\n          //=== NEEDBITS(3);\n          while (bits < 3) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n          //--- DROPBITS(3) ---//\n          hold >>>= 3;\n          bits -= 3;\n          //---//\n        }\n        while (state.have < 19) {\n          state.lens[order[state.have++]] = 0;\n        }\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        //state.next = state.codes;\n        //state.lencode = state.next;\n        // Switch to use dynamic table\n        state.lencode = state.lendyn;\n        state.lenbits = 7;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n        state.lenbits = opts.bits;\n\n        if (ret) {\n          strm.msg = 'invalid code lengths set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       code lengths ok\\n\"));\n        state.have = 0;\n        state.mode = CODELENS;\n        /* falls through */\n      case CODELENS:\n        while (state.have < state.nlen + state.ndist) {\n          for (;;) {\n            here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          if (here_val < 16) {\n            //--- DROPBITS(here.bits) ---//\n            hold >>>= here_bits;\n            bits -= here_bits;\n            //---//\n            state.lens[state.have++] = here_val;\n          }\n          else {\n            if (here_val === 16) {\n              //=== NEEDBITS(here.bits + 2);\n              n = here_bits + 2;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              if (state.have === 0) {\n                strm.msg = 'invalid bit length repeat';\n                state.mode = BAD;\n                break;\n              }\n              len = state.lens[state.have - 1];\n              copy = 3 + (hold & 0x03);//BITS(2);\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n            }\n            else if (here_val === 17) {\n              //=== NEEDBITS(here.bits + 3);\n              n = here_bits + 3;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 3 + (hold & 0x07);//BITS(3);\n              //--- DROPBITS(3) ---//\n              hold >>>= 3;\n              bits -= 3;\n              //---//\n            }\n            else {\n              //=== NEEDBITS(here.bits + 7);\n              n = here_bits + 7;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 11 + (hold & 0x7f);//BITS(7);\n              //--- DROPBITS(7) ---//\n              hold >>>= 7;\n              bits -= 7;\n              //---//\n            }\n            if (state.have + copy > state.nlen + state.ndist) {\n              strm.msg = 'invalid bit length repeat';\n              state.mode = BAD;\n              break;\n            }\n            while (copy--) {\n              state.lens[state.have++] = len;\n            }\n          }\n        }\n\n        /* handle error breaks in while */\n        if (state.mode === BAD) { break; }\n\n        /* check for end-of-block code (better have one) */\n        if (state.lens[256] === 0) {\n          strm.msg = 'invalid code -- missing end-of-block';\n          state.mode = BAD;\n          break;\n        }\n\n        /* build code tables -- note: do not change the lenbits or distbits\n           values here (9 and 6) without reading the comments in inftrees.h\n           concerning the ENOUGH constants, which depend on those values */\n        state.lenbits = 9;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.lenbits = opts.bits;\n        // state.lencode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid literal/lengths set';\n          state.mode = BAD;\n          break;\n        }\n\n        state.distbits = 6;\n        //state.distcode.copy(state.codes);\n        // Switch to use dynamic table\n        state.distcode = state.distdyn;\n        opts = { bits: state.distbits };\n        ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.distbits = opts.bits;\n        // state.distcode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid distances set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, 'inflate:       codes ok\\n'));\n        state.mode = LEN_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case LEN_:\n        state.mode = LEN;\n        /* falls through */\n      case LEN:\n        if (have >= 6 && left >= 258) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          inffast(strm, _out);\n          //--- LOAD() ---\n          put = strm.next_out;\n          output = strm.output;\n          left = strm.avail_out;\n          next = strm.next_in;\n          input = strm.input;\n          have = strm.avail_in;\n          hold = state.hold;\n          bits = state.bits;\n          //---\n\n          if (state.mode === TYPE) {\n            state.back = -1;\n          }\n          break;\n        }\n        state.back = 0;\n        for (;;) {\n          here = state.lencode[hold & ((1 << state.lenbits) - 1)];  /*BITS(state.lenbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if (here_bits <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if (here_op && (here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.lencode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        state.length = here_val;\n        if (here_op === 0) {\n          //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n          //        \"inflate:         literal '%c'\\n\" :\n          //        \"inflate:         literal 0x%02x\\n\", here.val));\n          state.mode = LIT;\n          break;\n        }\n        if (here_op & 32) {\n          //Tracevv((stderr, \"inflate:         end of block\\n\"));\n          state.back = -1;\n          state.mode = TYPE;\n          break;\n        }\n        if (here_op & 64) {\n          strm.msg = 'invalid literal/length code';\n          state.mode = BAD;\n          break;\n        }\n        state.extra = here_op & 15;\n        state.mode = LENEXT;\n        /* falls through */\n      case LENEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", state.length));\n        state.was = state.length;\n        state.mode = DIST;\n        /* falls through */\n      case DIST:\n        for (;;) {\n          here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if ((here_bits) <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if ((here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.distcode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        if (here_op & 64) {\n          strm.msg = 'invalid distance code';\n          state.mode = BAD;\n          break;\n        }\n        state.offset = here_val;\n        state.extra = (here_op) & 15;\n        state.mode = DISTEXT;\n        /* falls through */\n      case DISTEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n//#ifdef INFLATE_STRICT\n        if (state.offset > state.dmax) {\n          strm.msg = 'invalid distance too far back';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracevv((stderr, \"inflate:         distance %u\\n\", state.offset));\n        state.mode = MATCH;\n        /* falls through */\n      case MATCH:\n        if (left === 0) { break inf_leave; }\n        copy = _out - left;\n        if (state.offset > copy) {         /* copy from window */\n          copy = state.offset - copy;\n          if (copy > state.whave) {\n            if (state.sane) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\n              break;\n            }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//          Trace((stderr, \"inflate.c too far\\n\"));\n//          copy -= state.whave;\n//          if (copy > state.length) { copy = state.length; }\n//          if (copy > left) { copy = left; }\n//          left -= copy;\n//          state.length -= copy;\n//          do {\n//            output[put++] = 0;\n//          } while (--copy);\n//          if (state.length === 0) { state.mode = LEN; }\n//          break;\n//#endif\n          }\n          if (copy > state.wnext) {\n            copy -= state.wnext;\n            from = state.wsize - copy;\n          }\n          else {\n            from = state.wnext - copy;\n          }\n          if (copy > state.length) { copy = state.length; }\n          from_source = state.window;\n        }\n        else {                              /* copy from output */\n          from_source = output;\n          from = put - state.offset;\n          copy = state.length;\n        }\n        if (copy > left) { copy = left; }\n        left -= copy;\n        state.length -= copy;\n        do {\n          output[put++] = from_source[from++];\n        } while (--copy);\n        if (state.length === 0) { state.mode = LEN; }\n        break;\n      case LIT:\n        if (left === 0) { break inf_leave; }\n        output[put++] = state.length;\n        left--;\n        state.mode = LEN;\n        break;\n      case CHECK:\n        if (state.wrap) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            // Use '|' instead of '+' to make sure that result is signed\n            hold |= input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          _out -= left;\n          strm.total_out += _out;\n          state.total += _out;\n          if (_out) {\n            strm.adler = state.check =\n                /*UPDATE(state.check, put - _out, _out);*/\n                (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out));\n\n          }\n          _out = left;\n          // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n          if ((state.flags ? hold : zswap32(hold)) !== state.check) {\n            strm.msg = 'incorrect data check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   check matches trailer\\n\"));\n        }\n        state.mode = LENGTH;\n        /* falls through */\n      case LENGTH:\n        if (state.wrap && state.flags) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if (hold !== (state.total & 0xffffffff)) {\n            strm.msg = 'incorrect length check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   length matches trailer\\n\"));\n        }\n        state.mode = DONE;\n        /* falls through */\n      case DONE:\n        ret = Z_STREAM_END$1;\n        break inf_leave;\n      case BAD:\n        ret = Z_DATA_ERROR$1;\n        break inf_leave;\n      case MEM:\n        return Z_MEM_ERROR$1;\n      case SYNC:\n        /* falls through */\n      default:\n        return Z_STREAM_ERROR$1;\n    }\n  }\n\n  // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n  /*\n     Return from inflate(), updating the total counts and the check value.\n     If there was no progress during the inflate() call, return a buffer\n     error.  Call updatewindow() to create and/or update the window state.\n     Note: a memory error from inflate() is non-recoverable.\n   */\n\n  //--- RESTORE() ---\n  strm.next_out = put;\n  strm.avail_out = left;\n  strm.next_in = next;\n  strm.avail_in = have;\n  state.hold = hold;\n  state.bits = bits;\n  //---\n\n  if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n                      (state.mode < CHECK || flush !== Z_FINISH$1))) {\n    if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ;\n  }\n  _in -= strm.avail_in;\n  _out -= strm.avail_out;\n  strm.total_in += _in;\n  strm.total_out += _out;\n  state.total += _out;\n  if (state.wrap && _out) {\n    strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/\n      (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out));\n  }\n  strm.data_type = state.bits + (state.last ? 64 : 0) +\n                    (state.mode === TYPE ? 128 : 0) +\n                    (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n  if (((_in === 0 && _out === 0) || flush === Z_FINISH$1) && ret === Z_OK$1) {\n    ret = Z_BUF_ERROR;\n  }\n  return ret;\n};\n\n\nconst inflateEnd = (strm) => {\n\n  if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  let state = strm.state;\n  if (state.window) {\n    state.window = null;\n  }\n  strm.state = null;\n  return Z_OK$1;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n  /* check state */\n  if (!strm || !strm.state) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; }\n\n  /* save header structure */\n  state.head = head;\n  head.done = false;\n  return Z_OK$1;\n};\n\n\nconst inflateSetDictionary = (strm, dictionary) => {\n  const dictLength = dictionary.length;\n\n  let state;\n  let dictid;\n  let ret;\n\n  /* check state */\n  if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR$1; }\n  state = strm.state;\n\n  if (state.wrap !== 0 && state.mode !== DICT) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  /* check for correct dictionary identifier */\n  if (state.mode === DICT) {\n    dictid = 1; /* adler32(0, null, 0)*/\n    /* dictid = adler32(dictid, dictionary, dictLength); */\n    dictid = adler32_1(dictid, dictionary, dictLength, 0);\n    if (dictid !== state.check) {\n      return Z_DATA_ERROR$1;\n    }\n  }\n  /* copy dictionary to window using updatewindow(), which will amend the\n   existing dictionary if appropriate */\n  ret = updatewindow(strm, dictionary, dictLength, dictLength);\n  if (ret) {\n    state.mode = MEM;\n    return Z_MEM_ERROR$1;\n  }\n  state.havedict = 1;\n  // Tracev((stderr, \"inflate:   dictionary set\\n\"));\n  return Z_OK$1;\n};\n\n\nvar inflateReset_1 = inflateReset;\nvar inflateReset2_1 = inflateReset2;\nvar inflateResetKeep_1 = inflateResetKeep;\nvar inflateInit_1 = inflateInit;\nvar inflateInit2_1 = inflateInit2;\nvar inflate_2$1 = inflate$2;\nvar inflateEnd_1 = inflateEnd;\nvar inflateGetHeader_1 = inflateGetHeader;\nvar inflateSetDictionary_1 = inflateSetDictionary;\nvar inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\n*/\n\nvar inflate_1$2 = {\n\tinflateReset: inflateReset_1,\n\tinflateReset2: inflateReset2_1,\n\tinflateResetKeep: inflateResetKeep_1,\n\tinflateInit: inflateInit_1,\n\tinflateInit2: inflateInit2_1,\n\tinflate: inflate_2$1,\n\tinflateEnd: inflateEnd_1,\n\tinflateGetHeader: inflateGetHeader_1,\n\tinflateSetDictionary: inflateSetDictionary_1,\n\tinflateInfo: inflateInfo\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n  /* true if compressed data believed to be text */\n  this.text       = 0;\n  /* modification time */\n  this.time       = 0;\n  /* extra flags (not used when writing a gzip file) */\n  this.xflags     = 0;\n  /* operating system */\n  this.os         = 0;\n  /* pointer to extra field or Z_NULL if none */\n  this.extra      = null;\n  /* extra field length (valid if extra != Z_NULL) */\n  this.extra_len  = 0; // Actually, we don't need it in JS,\n                       // but leave for few code modifications\n\n  //\n  // Setup limits is not necessary because in js we should not preallocate memory\n  // for inflate use constant limit in 65536 bytes\n  //\n\n  /* space at extra (only when reading header) */\n  // this.extra_max  = 0;\n  /* pointer to zero-terminated file name or Z_NULL */\n  this.name       = '';\n  /* space at name (only when reading header) */\n  // this.name_max   = 0;\n  /* pointer to zero-terminated comment or Z_NULL */\n  this.comment    = '';\n  /* space at comment (only when reading header) */\n  // this.comm_max   = 0;\n  /* true if there was or will be a header crc */\n  this.hcrc       = 0;\n  /* true when done reading gzip header (not used when writing a gzip file) */\n  this.done       = false;\n}\n\nvar gzheader = GZheader;\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH, Z_FINISH,\n  Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true);  // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate$1(options) {\n  this.options = common.assign({\n    chunkSize: 1024 * 64,\n    windowBits: 15,\n    to: ''\n  }, options || {});\n\n  const opt = this.options;\n\n  // Force window size for `raw` data, if not set directly,\n  // because we have no header for autodetect.\n  if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n    opt.windowBits = -opt.windowBits;\n    if (opt.windowBits === 0) { opt.windowBits = -15; }\n  }\n\n  // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n  if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n      !(options && options.windowBits)) {\n    opt.windowBits += 32;\n  }\n\n  // Gzip header has no info about windows size, we can do autodetect only\n  // for deflate. So, if window size not set, force it to max when gzip possible\n  if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n    // bit 3 (16) -> gzipped data\n    // bit 4 (32) -> autodetect gzip/deflate\n    if ((opt.windowBits & 15) === 0) {\n      opt.windowBits |= 15;\n    }\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm   = new zstream();\n  this.strm.avail_out = 0;\n\n  let status  = inflate_1$2.inflateInit2(\n    this.strm,\n    opt.windowBits\n  );\n\n  if (status !== Z_OK) {\n    throw new Error(messages[status]);\n  }\n\n  this.header = new gzheader();\n\n  inflate_1$2.inflateGetHeader(this.strm, this.header);\n\n  // Setup dictionary\n  if (opt.dictionary) {\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      opt.dictionary = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      opt.dictionary = new Uint8Array(opt.dictionary);\n    }\n    if (opt.raw) { //In raw mode we need to set the dictionary early\n      status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary);\n      if (status !== Z_OK) {\n        throw new Error(messages[status]);\n      }\n    }\n  }\n}\n\n/**\n * Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer): input data\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n *   flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n *   `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n *\n * `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nInflate$1.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  const dictionary = this.options.dictionary;\n  let status, _flush_mode, last_avail_out;\n\n  if (this.ended) return false;\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n  // Convert data if needed\n  if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    status = inflate_1$2.inflate(strm, _flush_mode);\n\n    if (status === Z_NEED_DICT && dictionary) {\n      status = inflate_1$2.inflateSetDictionary(strm, dictionary);\n\n      if (status === Z_OK) {\n        status = inflate_1$2.inflate(strm, _flush_mode);\n      } else if (status === Z_DATA_ERROR) {\n        // Replace code with more verbose\n        status = Z_NEED_DICT;\n      }\n    }\n\n    // Skip snyc markers if more data follows and not raw mode\n    while (strm.avail_in > 0 &&\n           status === Z_STREAM_END &&\n           strm.state.wrap > 0 &&\n           data[strm.next_in] !== 0)\n    {\n      inflate_1$2.inflateReset(strm);\n      status = inflate_1$2.inflate(strm, _flush_mode);\n    }\n\n    switch (status) {\n      case Z_STREAM_ERROR:\n      case Z_DATA_ERROR:\n      case Z_NEED_DICT:\n      case Z_MEM_ERROR:\n        this.onEnd(status);\n        this.ended = true;\n        return false;\n    }\n\n    // Remember real `avail_out` value, because we may patch out buffer content\n    // to align utf8 strings boundaries.\n    last_avail_out = strm.avail_out;\n\n    if (strm.next_out) {\n      if (strm.avail_out === 0 || status === Z_STREAM_END) {\n\n        if (this.options.to === 'string') {\n\n          let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n          let tail = strm.next_out - next_out_utf8;\n          let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n          // move tail & realign counters\n          strm.next_out = tail;\n          strm.avail_out = chunkSize - tail;\n          if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n          this.onData(utf8str);\n\n        } else {\n          this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n        }\n      }\n    }\n\n    // Must repeat iteration if out buffer is full\n    if (status === Z_OK && last_avail_out === 0) continue;\n\n    // Finalize if end of stream reached.\n    if (status === Z_STREAM_END) {\n      status = inflate_1$2.inflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return true;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|String): output data. When string output requested,\n *   each chunk will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate$1.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate$1.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK) {\n    if (this.options.to === 'string') {\n      this.result = this.chunks.join('');\n    } else {\n      this.result = common.flattenChunks(this.chunks);\n    }\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|String\n * - data (Uint8Array): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n *\n * try {\n *   output = pako.inflate(input);\n * } catch (err) {\n *   console.log(err);\n * }\n * ```\n **/\nfunction inflate$1(input, options) {\n  const inflator = new Inflate$1(options);\n\n  inflator.push(input);\n\n  // That will never happens, if you don't cheat with options :)\n  if (inflator.err) throw inflator.msg || messages[inflator.err];\n\n  return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|String\n * - data (Uint8Array): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw$1(input, options) {\n  options = options || {};\n  options.raw = true;\n  return inflate$1(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|String\n * - data (Uint8Array): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nvar Inflate_1$1 = Inflate$1;\nvar inflate_2 = inflate$1;\nvar inflateRaw_1$1 = inflateRaw$1;\nvar ungzip$1 = inflate$1;\nvar constants = constants$2;\n\nvar inflate_1$1 = {\n\tInflate: Inflate_1$1,\n\tinflate: inflate_2,\n\tinflateRaw: inflateRaw_1$1,\n\tungzip: ungzip$1,\n\tconstants: constants\n};\n\nconst { Deflate, deflate, deflateRaw, gzip } = deflate_1$1;\n\nconst { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1;\n\n\n\nvar Deflate_1 = Deflate;\nvar deflate_1 = deflate;\nvar deflateRaw_1 = deflateRaw;\nvar gzip_1 = gzip;\nvar Inflate_1 = Inflate;\nvar inflate_1 = inflate;\nvar inflateRaw_1 = inflateRaw;\nvar ungzip_1 = ungzip;\nvar constants_1 = constants$2;\n\nvar pako = {\n\tDeflate: Deflate_1,\n\tdeflate: deflate_1,\n\tdeflateRaw: deflateRaw_1,\n\tgzip: gzip_1,\n\tInflate: Inflate_1,\n\tinflate: inflate_1,\n\tinflateRaw: inflateRaw_1,\n\tungzip: ungzip_1,\n\tconstants: constants_1\n};\n\nexport { Deflate_1 as Deflate, Inflate_1 as Inflate, constants_1 as constants, pako as default, deflate_1 as deflate, deflateRaw_1 as deflateRaw, gzip_1 as gzip, inflate_1 as inflate, inflateRaw_1 as inflateRaw, ungzip_1 as ungzip };\n", null, null, null, null, null, "\nimport _chroma from 'chroma-js'\nimport { isArray, rgb2bgr } from '../../util';\n\nexport type Chroma = { _rgb: [number,number,number,number] };\n\nexport type ColorSource = number | [number,number,number] | [number,number,number,number] | string | Chroma;\n\nfunction checkCount(count) {\n    if (count < 0 || count > 65536) {\n        throw new Error(\"Palettes cannot have more than 2^16 (65536) colors.\");\n    }\n}\n\nexport function isPalette(object): object is Palette {\n    return object['colors'] instanceof Uint32Array;\n}\n\nexport function isChroma(object): object is Chroma {\n    return object['_rgb'] instanceof Array;\n}\n\nexport class Palette {\n    readonly colors: Uint32Array;\n\n    constructor(arg: number | any[] | Uint32Array) {\n        // TODO: more array types\n        if (typeof arg === 'number') {\n            checkCount(arg);\n            this.colors = new Uint32Array(arg);\n        } else if (arg instanceof Uint32Array) {\n            this.colors = new Uint32Array(arg);\n        } else if (isArray(arg)) {\n            this.colors = new Uint32Array(arg.map(rgb));\n        } else\n            throw new Error(`Invalid Palette constructor`)\n    }\n    get(index: number) {\n        return this.colors[index];\n    }\n    chromas() {\n        return Array.from(this.colors).map((rgba) => from(rgba & 0xffffff));\n    }\n}\n\nexport const chroma = _chroma;\n\nexport function from(obj: ColorSource) {\n    if (typeof obj === 'number')\n        return _chroma(rgb2bgr(obj & 0xffffff));\n    else\n        return _chroma(obj as any);\n}\n\nexport function rgb(obj: ColorSource) : number;\nexport function rgb(r: number, g: number, b: number) : number;\n\nexport function rgb(obj: any, g?: number, b?: number) : number {\n    return rgba(obj, g, b, 0xff) | 0xff000000;\n}\n\nexport function rgba(obj: ColorSource) : number;\nexport function rgba(r: number, g: number, b: number, a: number) : number;\n\nexport function rgba(obj: ColorSource, g?: number, b?: number, a?: number) : number {\n    if (isChroma(obj)) {\n        return rgba(obj._rgb[0], obj._rgb[1], obj._rgb[2], obj._rgb[3]);\n    }\n    if (typeof obj === 'number') {\n        let r = obj;\n        if (typeof g === 'number' && typeof b === 'number')\n            return ((r & 0xff) << 0) | ((g & 0xff) << 8) | ((b & 0xff) << 16) | ((a & 0xff) << 24);\n        else\n            return obj;\n    }\n    if (typeof obj !== 'string' && isArray(obj) && typeof obj[0] === 'number') {\n        let arr = obj;\n        let v = 0;\n        v |= (arr[0] & 0xff) << 0;\n        v |= (arr[1] & 0xff) << 8;\n        v |= (arr[2] & 0xff) << 16;\n        v |= (arr[3] & 0xff) << 24;\n        return v;\n    }\n    return rgba(from(obj).rgb());\n}\n\nexport function rgba2arr(v: number): number[] {\n    return [\n        (v >> 0) & 0xff,\n        (v >> 8) & 0xff,\n        (v >> 16) & 0xff,\n        (v >> 24) & 0xff,\n    ]\n}\n\nexport function rgb2arr(v: number): number[] {\n    return rgba2arr(v).slice(0,3);\n}\n\ntype ColorGenFunc = (index: number) => number;\n\nexport namespace palette {\n    export function from(obj: number | any[] | Uint32Array | ColorGenFunc, count?: number) {\n        checkCount(count);\n        if (typeof obj === 'function') {\n            if (!count) throw new Error(`You must also pass the number of colors to generate.`)\n            var pal = new Palette(count);\n            for (var i = 0; i < pal.colors.length; i++) {\n                pal.colors[i] = rgba(obj(i));\n            }\n            return pal;\n        } else {\n            return new Palette(obj);\n        }\n    }\n    export function mono() {\n        return greys(2);\n    }\n    function rgb2() {\n        return new Palette([\n            rgb(0, 0, 0),\n            rgb(0, 0, 255),\n            rgb(255, 0, 0),\n            rgb(0, 255, 0),\n        ]);\n    }\n    function rgb3() {\n        return new Palette([\n            rgb(0, 0, 0),\n            rgb(0, 0, 255),\n            rgb(255, 0, 0),\n            rgb(255, 0, 255),\n            rgb(0, 255, 0),\n            rgb(0, 255, 255),\n            rgb(255, 255, 0),\n            rgb(255, 255, 255),\n        ]);\n    }\n    export function greys(count: number) {\n        return from((i) => {\n            let v = 255 * i / (count - 1);\n            return rgb(v,v,v);\n        }, count);\n    }\n    export function colors(count: number) {\n        switch (count) {\n            case 2: return mono();\n            case 4: return rgb2();\n            case 8: return rgb3();\n            default: return factors(count); // TODO\n        }\n    }\n    export function helix(count: number) {\n        checkCount(count);\n        return new Palette(chroma.cubehelix().scale().colors(count));\n    }\n    export function factors(count: number, mult?: number) {\n        mult = mult || 0x031f0f;\n        return from((i) => rgb(i * mult), count);\n    }\n    // TODO: https://www.iquilezles.org/www/articles/palettes/palettes.htm\n}\n", "\nimport { FileDataCache } from \"../../util\";\nimport { FileData, WorkingStore } from \"../../workertypes\";\n\n// remote resource cache\nvar $$cache = new FileDataCache(); // TODO: better cache?\n// file read/write interface\nvar $$store: WorkingStore;\n// backing store for data\nvar $$data: {} = {};\n// module cache\nvar $$modules: Map<string,{}> = new Map();\n\nexport function $$setupFS(store: WorkingStore) {\n    $$store = store;\n}\nexport function $$getData() {\n    return $$data;\n}\nexport function $$loadData(data: {}) {\n    Object.assign($$data, data);\n}\n\n// object that can load state from backing store\nexport interface Loadable {\n    // called during script, from io.data.load()\n    $$setstate?(newstate: {}) : void;\n    // called after script, from io.data.save()\n    $$getstate() : {};\n}\n\nexport namespace data {\n    export function load(object: Loadable, key: string): Loadable {\n        if (object == null) return object;\n        let override = $$data && $$data[key];\n        if (override && object.$$setstate) {\n            object.$$setstate(override);\n        } else if (override) {\n            Object.assign(object, override);\n        }\n        return object;\n    }\n    export function save(object: Loadable, key: string): Loadable {\n        if ($$data && object && object.$$getstate) {\n            $$data[key] = object.$$getstate();\n        }\n        return object;\n    }\n    export function get(key: string) {\n        return $$data && $$data[key];\n    }\n    export function set(key: string, value: object) {\n        if ($$data) {\n            $$data[key] = value;\n        }\n    }\n}\n\nexport class IOWaitError extends Error {\n}\n\nexport function canonicalurl(url: string) : string {\n    // get raw resource URL for github\n    if (url.startsWith('https://github.com/')) {\n        let toks = url.split('/');\n        if (toks[5] === 'blob') {\n            return `https://raw.githubusercontent.com/${toks[3]}/${toks[4]}/${toks.slice(6).join('/')}`\n        }\n    }\n    return url;\n}\n\nexport function fetchurl(url: string, type?: 'binary' | 'text'): FileData {\n    // TODO: only works in web worker\n    var xhr = new XMLHttpRequest();\n    xhr.responseType = type === 'text' ? 'text' : 'arraybuffer';\n    xhr.open(\"GET\", url, false);  // synchronous request\n    xhr.send(null);\n    if (xhr.response != null && xhr.status == 200) {\n        if (type === 'text') {\n            return xhr.response as string;\n        } else {\n            return new Uint8Array(xhr.response);\n        }\n    } else {\n        throw new Error(`The resource at \"${url}\" responded with status code of ${xhr.status}.`)\n    }\n}\n\nexport function readnocache(url: string, type?: 'binary' | 'text'): FileData {\n    if (url.startsWith('http:') || url.startsWith('https:')) {\n        return fetchurl(url, type);\n    }\n    if ($$store) {\n        return $$store.getFileData(url);\n    }\n}\n\n// TODO: read files too\nexport function read(url: string, type?: 'binary' | 'text'): FileData {\n    // canonical-ize url\n    url = canonicalurl(url);\n    // check cache first\n    let cachekey = url;\n    let data = $$cache.get(cachekey);\n    if (data != null) return data;\n    // not in cache, read it\n    data = readnocache(url, type);\n    if (data == null) throw new Error(`Cannot find resource \"${url}\"`);\n    if (type === 'text' && typeof data !== 'string') throw new Error(`Resource \"${url}\" is not a string`);\n    if (type === 'binary' && !(data instanceof Uint8Array)) throw new Error(`Resource \"${url}\" is not a binary file`);\n    // store in cache\n    $$cache.put(cachekey, data);\n    return data;\n}\n\nexport function readbin(url: string): Uint8Array {\n    var data = read(url, 'binary');\n    if (data instanceof Uint8Array)\n        return data;\n    else\n        throw new Error(`The resource at \"${url}\" is not a binary file.`);\n}\n\nexport function readlines(url: string) : string[] {\n    return (read(url, 'text') as string).split('\\n');\n}\n\nexport function splitlines(text: string) : string[] {\n    return text.split(/\\n|\\r\\n/g);\n}\n\nexport function module(url: string) {\n    // find module in cache?\n    let key = `${url}::${url.length}`;\n    let exports = $$modules.get(key);\n    if (exports == null) {\n        let code = readnocache(url, 'text') as string;\n        let func = new Function('exports', 'module', code);\n        let module = {}; // TODO?\n        exports = {};\n        func(exports, module);\n        $$modules.set(key, exports);\n    }\n    return exports;\n}\n\n///\n\n// TODO: what if this isn't top level?\nexport class Mutable<T> implements Loadable {\n    value : T;\n    constructor(initial : T) {\n        this.value = initial;\n    }\n    $$setstate(newstate) {\n        this.value = newstate.value;\n    }\n    $$getstate() {\n        return { value: this.value };\n    }\n}\n\nexport function mutable<T>(obj: object) : object {\n    Object.defineProperty(obj, '$$setstate', {\n        value: function(newstate) {\n            Object.assign(this, newstate);\n        },\n        enumerable: false\n    });\n    Object.defineProperty(obj, '$$getstate', {\n        value: function() {\n            return this;\n        },\n        enumerable: false\n    });\n    return obj;\n}\n", "\n// TODO: dynamic import\nimport * as fastpng from 'fast-png';\nimport { Palette } from './color';\nimport * as io from './io'\nimport * as color from './color'\nimport { coerceToArray, findIntegerFactors, RGBA } from '../../util';\n\nexport type PixelMapFunction = (x: number, y: number) => number;\n\nexport abstract class AbstractBitmap<T> {\n    aspect? : number;   // aspect ratio, null == default == 1:1\n    style? : {} = {};   // CSS styles (TODO: other elements?)\n\n    constructor(\n        public readonly width: number,\n        public readonly height: number,\n    ) {\n    }\n    abstract blank(width: number, height: number) : AbstractBitmap<T>;\n    abstract setarray(arr: ArrayLike<number>) : void;\n    abstract set(x: number, y: number, val: number) : void;\n    abstract get(x: number, y: number): number;\n    abstract getrgba(x: number, y: number): number;\n\n    inbounds(x: number, y: number): boolean {\n        return (x >= 0 && x < this.width && y >= 0 && y < this.height);\n    }\n    assign(fn: ArrayLike<number> | PixelMapFunction) : void {\n        if (typeof fn === 'function') {\n            for (let y=0; y<this.height; y++) {\n                for (let x=0; x<this.width; x++) {\n                    this.set(x, y, fn(x, y));\n                }\n            }\n        } else if (fn && fn['length'] != null) {\n            this.setarray(fn);\n        } else {\n            throw new Error(`Illegal argument to assign(): ${fn}`)\n        }\n    }\n    clone() : AbstractBitmap<T> {\n        let bmp = this.blank(this.width, this.height);\n        bmp.assign((x,y) => this.get(x,y));\n        return bmp;\n    }\n    crop(srcx: number, srcy: number, width: number, height: number) {\n        let dest = this.blank(width, height);\n        dest.assign((x, y) => this.get(x + srcx, y + srcy));\n        return dest;\n    }\n    blit(src: BitmapType, \n        destx: number, desty: number,\n        srcx: number, srcy: number)\n    {\n        destx |= 0;\n        desty |= 0;\n        srcx |= 0;\n        srcy |= 0;\n        for (var y=0; y<src.height; y++) {\n            for (var x=0; x<src.width; x++) {\n                let rgba = src.getrgba(x+srcx, y+srcy);\n                this.set(x+destx, y+desty, rgba);\n            }\n        }\n    }\n    fill(destx: number, desty: number, width:number, height:number, value:number) {\n        for (var y=0; y<height; y++) {\n            for (var x=0; x<width; x++) {\n                this.set(x+destx, y+desty, value);\n            }\n        }\n    }\n}\n\nexport class RGBABitmap extends AbstractBitmap<RGBABitmap> {\n    public readonly rgba: Uint32Array\n\n    constructor(\n        width: number,\n        height: number,\n        initial?: Uint32Array | PixelMapFunction\n    ) {\n        super(width, height);\n        this.rgba = new Uint32Array(this.width * this.height);\n        if (initial) this.assign(initial);\n    }\n    setarray(arr: ArrayLike<number>) {\n        this.rgba.set(arr);\n    }\n    set(x: number, y: number, rgba: number) {\n        if (this.inbounds(x,y)) this.rgba[y * this.width + x] = rgba;\n    }\n    get(x: number, y: number): number {\n        return this.inbounds(x,y) ? this.rgba[y * this.width + x] : 0;\n    }\n    getrgba(x: number, y: number): number {\n        return this.get(x, y);\n    }\n    blank(width?: number, height?: number) : RGBABitmap {\n        return new RGBABitmap(width || this.width, height || this.height);\n    }\n    clone() : RGBABitmap {\n        let bitmap = this.blank(this.width, this.height);\n        bitmap.rgba.set(this.rgba);\n        return bitmap;\n    }\n}\n\nexport abstract class MappedBitmap extends AbstractBitmap<MappedBitmap> {\n    public readonly pixels: Uint8Array\n\n    constructor(\n        width: number,\n        height: number,\n        public readonly bpp: number,\n        initial?: Uint8Array | PixelMapFunction\n    ) {\n        super(width, height);\n        if (bpp != 1 && bpp != 2 && bpp != 4 && bpp != 8)\n            throw new Error(`Invalid bits per pixel: ${bpp}`);\n        this.pixels = new Uint8Array(this.width * this.height);\n        if (initial) this.assign(initial);\n    }\n    setarray(arr: ArrayLike<number>) {\n        this.pixels.set(arr);\n    }\n    set(x: number, y: number, index: number) {\n        if (this.inbounds(x,y)) this.pixels[y * this.width + x] = index;\n    }\n    get(x: number, y: number): number {\n        return this.inbounds(x,y) ? this.pixels[y * this.width + x] : 0;\n    }\n}\n\nfunction getbpp(x : number | Palette) : number {\n    if (typeof x === 'number') return x;\n    if (x instanceof Palette) {\n        if (x.colors.length <= 2) return 1;\n        else if (x.colors.length <= 4) return 2;\n        else if (x.colors.length <= 16) return 4;\n    }\n    return 8;\n}\n\nexport class IndexedBitmap extends MappedBitmap {\n    public palette: Palette;\n\n    constructor(\n        width: number,\n        height: number,\n        bppOrPalette: number | Palette,\n        initial?: Uint8Array | PixelMapFunction\n    ) {\n        super(width, height, getbpp(bppOrPalette), initial);\n        this.palette = bppOrPalette instanceof Palette\n            ? bppOrPalette \n            : color.palette.colors(1 << this.bpp);\n    }\n    getrgba(x: number, y: number): number {\n        return this.palette && this.palette.colors[this.get(x, y)];\n    }\n    blank(width?: number, height?: number, newPalette?: Palette) : IndexedBitmap {\n        let bitmap = new IndexedBitmap(width || this.width, height || this.height, newPalette || this.palette);\n        return bitmap;\n    }\n    clone() : IndexedBitmap {\n        let bitmap = this.blank(this.width, this.height);\n        bitmap.pixels.set(this.pixels);\n        return bitmap;\n    }\n}\n\nexport function rgba(width: number, height: number, initial?: Uint32Array | PixelMapFunction) {\n    return new RGBABitmap(width, height, initial);\n}\n\nexport function indexed(width: number, height: number, bpp: number, initial?: Uint8Array | PixelMapFunction) {\n    return new IndexedBitmap(width, height, bpp, initial);\n}\n\nexport type BitmapType = RGBABitmap | IndexedBitmap;\n\n// TODO: check arguments\nexport function decode(arr: Uint8Array, fmt: PixelEditorImageFormat) {\n    var pixels = convertWordsToImages(arr, fmt);\n    // TODO: guess if missing w/h/count?\n    // TODO: reverse mapping\n    // TODO: maybe better composable functions\n    let bpp = (fmt.bpp||1) * (fmt.np||1);\n    return pixels.map(data => new IndexedBitmap(fmt.w, fmt.h, bpp, data));\n}\n\nexport interface BitmapAnalysis {\n    min: {w: number, h: number};\n    max: {w: number, h: number};\n}\n\nexport function analyze(bitmaps: BitmapType[]) {\n    bitmaps = coerceToArray(bitmaps);\n    let r = {min:{w:0,h:0}, max:{w:0,h:0}};\n    for (let bmp of bitmaps) {\n        if (!(bmp instanceof AbstractBitmap)) return null;\n        r.min.w = Math.min(bmp.width);\n        r.max.w = Math.max(bmp.width);\n        r.min.h = Math.min(bmp.height);\n        r.max.h = Math.max(bmp.height);\n    }\n    return r;\n}\n\nexport interface MontageOptions {\n    analysis?: BitmapAnalysis;\n    gap?: number;\n    aspect?: number;\n}\n\nexport function montage(bitmaps: BitmapType[], options?: MontageOptions) {\n    bitmaps = coerceToArray(bitmaps);\n    let minmax = (options && options.analysis) || analyze(bitmaps);\n    if (minmax == null) throw new Error(`Expected an array of bitmaps`);\n    let hitrects = [];\n    let aspect = (options && options.aspect) || 1;\n    let gap = (options && options.gap) || 0;\n    if (minmax.min.w == minmax.max.w && minmax.min.h == minmax.max.h) {\n        let totalPixels = minmax.min.w * minmax.min.h * bitmaps.length;\n        let factors = findIntegerFactors(totalPixels, minmax.max.w, minmax.max.h, aspect);\n        let columns = Math.ceil(factors.a / minmax.min.w); // TODO: rounding?\n        let rows = Math.ceil(factors.b / minmax.min.h);\n        let result = new RGBABitmap(factors.a + gap * (columns-1), factors.b + gap * (rows-1));\n        let x = 0;\n        let y = 0;\n        bitmaps.forEach((bmp) => {\n            result.blit(bmp, x, y, 0, 0);\n            hitrects.push({x, y, w: bmp.width, h: bmp.height })\n            x += bmp.width + gap;\n            if (x >= result.width) {\n                x = 0;\n                y += bmp.height + gap;\n            }\n        })\n        return result;\n    } else {\n        throw new Error(`combine() only supports uniformly-sized images right now`); // TODO\n    }\n}\n\n/////\n\nexport namespace png {\n    export function read(url: string): BitmapType {\n        return decode(io.readbin(url));\n    }\n    export function decode(data: Uint8Array): BitmapType {\n        let png = fastpng.decode(data);\n        return convertToBitmap(png);\n    }\n    function convertToBitmap(png: fastpng.IDecodedPNG): BitmapType {\n        if (png.palette && png.depth <= 8) {\n            return convertIndexedToBitmap(png);\n        } else {\n            return convertRGBAToBitmap(png);\n        }\n    }\n    function convertIndexedToBitmap(png: fastpng.IDecodedPNG): IndexedBitmap {\n        var palarr = <any>png.palette as [number, number, number, number][];\n        var palette = new Palette(palarr);\n        let bitmap = new IndexedBitmap(png.width, png.height, png.depth);\n        if (png.depth == 8) {\n            bitmap.pixels.set(png.data);\n        } else {\n            let pixperbyte = Math.floor(8 / png.depth);\n            let mask = (1 << png.depth) - 1;\n            for (let i = 0; i < bitmap.pixels.length; i++) {\n                var bofs = (i % pixperbyte) * png.depth;\n                let val = png.data[Math.floor(i / pixperbyte)];\n                bitmap.pixels[i] = (val >> bofs) & mask;\n            }\n        }\n        bitmap.palette = palette;\n        // TODO: aspect etc\n        return bitmap;\n    }\n    function convertRGBAToBitmap(png: fastpng.IDecodedPNG): RGBABitmap {\n        const bitmap = new RGBABitmap(png.width, png.height);\n        const rgba : [number,number,number,number] = [0, 0, 0, 0];\n        for (let i = 0; i < bitmap.rgba.length; i++) {\n            for (let j = 0; j < 4; j++)\n                rgba[j] = png.data[i * 4 + j];\n            bitmap.rgba[i] = color.rgba(rgba);\n        }\n        // TODO: aspect etc\n        return bitmap;\n    }\n}\n\nexport namespace font {\n    interface Font {\n        maxheight: number;\n        glyphs: { [code: number]: Glyph };\n        properties: {};\n    }\n    class Glyph extends IndexedBitmap {\n        constructor(width: number, height: number, bpp: number,\n            public readonly code: number,\n            public readonly yoffset: number) {\n            super(width, height, bpp);\n        }\n    }\n    export function read(url: string) {\n        if (url.endsWith('.yaff')) return decodeyafflines(io.readlines(url));\n        if (url.endsWith('.draw')) return decodedrawlines(io.readlines(url));\n        throw new Error(`Can't figure out font format for \"${url}\"`);\n    }\n    export function decodeglyph(glines: string[], curcode: number, yoffset: number): Glyph {\n        let width = 0;\n        for (var gline of glines) width = Math.max(width, gline.length);\n        let g = new Glyph(width, glines.length, 1, curcode, yoffset);\n        for (var y = 0; y < glines.length; y++) {\n            let gline = glines[y];\n            for (var x = 0; x < gline.length; x++) {\n                let ch = gline[x];\n                g.set(x, y, ch==='@' || ch==='#' ? 1 : 0); // TODO: provide mapping\n            }\n        }\n        return g;\n    }\n    // https://github.com/robhagemans/monobit\n    export function decodeyafflines(lines: string[]): Font {\n        let maxheight = 0;\n        let properties = {};\n        let glyphs = {};\n        let yoffset = 0;\n        let curcode = -1;\n        let curglyph: string[] = [];\n        const re_prop = /^([\\w-]+):\\s+(.+)/i;\n        const re_label = /^0x([0-9a-f]+):|u[+]([0-9a-f]+):|(\\w+):/i;\n        const re_gline = /^\\s+([.@]+)/\n        function addfont() {\n            if (curcode >= 0 && curglyph.length) {\n                glyphs[curcode] = decodeglyph(curglyph, curcode, yoffset);\n                curcode = -1;\n                curglyph = [];\n            }\n        }\n        for (let line of lines) {\n            let m: RegExpExecArray;\n            if (m = re_prop.exec(line)) {\n                properties[m[1]] = m[2];\n                if (m[1] === 'bottom') yoffset = parseInt(m[2]);\n                if (m[1] === 'size') maxheight = parseInt(m[2]);\n            } else if (m = re_label.exec(line)) {\n                addfont();\n                if (m[1] != null) curcode = parseInt(m[1], 16);\n                else if (m[2] != null) curcode = parseInt(m[2], 16);\n                else if (m[3] != null) curcode = null; // text labels not supported\n            } else if (m = re_gline.exec(line)) {\n                curglyph.push(m[1]);\n            }\n            if (isNaN(curcode + yoffset + maxheight))\n                throw new Error(`couldn't decode .yaff: ${JSON.stringify(line)}`)\n        }\n        addfont();\n        return { maxheight, properties, glyphs };\n    }\n    // https://github.com/robhagemans/monobit\n    export function decodedrawlines(lines: string[]): Font {\n        let maxheight = 0;\n        let properties = {};\n        let glyphs = {};\n        let curcode = -1;\n        let curglyph: string[] = [];\n        const re_gline = /^([0-9a-f]+)?[:]?\\s*([-#]+)/i;\n        function addfont() {\n            if (curcode >= 0 && curglyph.length) {\n                glyphs[curcode] = decodeglyph(curglyph, curcode, 0);\n                maxheight = Math.max(maxheight, curglyph.length);\n                curcode = -1;\n                curglyph = [];\n            }\n        }\n        for (let line of lines) {\n            let m: RegExpExecArray;\n            if (m = re_gline.exec(line)) {\n                if (m[1] != null) {\n                    addfont();\n                    curcode = parseInt(m[1], 16);\n                    if (isNaN(curcode))\n                        throw new Error(`couldn't decode .draw: ${JSON.stringify(line)}`)\n                }\n                curglyph.push(m[2]);\n            }\n        }\n        addfont();\n        return { maxheight, properties, glyphs };\n    }\n}\n\n// TODO: merge w/ pixeleditor\n\nexport type PixelEditorImageFormat = {\n    w:number\n    h:number\n    count?:number\n    bpp?:number\n    np?:number\n    bpw?:number\n    sl?:number\n    pofs?:number\n    remap?:number[]\n    reindex?:number[]\n    brev?:boolean\n    flip?:boolean\n    destfmt?:PixelEditorImageFormat\n    xform?:string\n    skip?:number\n    aspect?:number\n  };\n\n  function remapBits(x:number, arr:number[]) : number {\n    if (!arr) return x;\n    var y = 0;\n    for (var i=0; i<arr.length; i++) {\n      var s = arr[i];\n      if (s < 0) {\n        s = -s-1;\n        y ^= 1 << s;\n      }\n      if (x & (1 << i)) {\n        y ^= 1 << s;\n      }\n    }\n    return y;\n  }\n  \n  export function convertWordsToImages(words:ArrayLike<number>, fmt:PixelEditorImageFormat) : Uint8Array[] {\n    var width = fmt.w;\n    var height = fmt.h;\n    var count = fmt.count || 1;\n    var bpp = fmt.bpp || 1;\n    var nplanes = fmt.np || 1;\n    var bitsperword = fmt.bpw || 8;\n    var wordsperline = fmt.sl || Math.ceil(width * bpp / bitsperword);\n    var mask = (1 << bpp)-1;\n    var pofs = fmt.pofs || wordsperline*height*count;\n    var skip = fmt.skip || 0;\n    var images = [];\n    for (var n=0; n<count; n++) {\n      var imgdata = [];\n      for (var y=0; y<height; y++) {\n        var yp = fmt.flip ? height-1-y : y;\n        var ofs0 = n*wordsperline*height + yp*wordsperline;\n        var shift = 0;\n        for (var x=0; x<width; x++) {\n          var color = 0;\n          var ofs = remapBits(ofs0, fmt.remap);\n          // TODO: if (fmt.reindex) { [ofs, shift] = reindexMask(x, fmt.reindex); ofs += ofs0; }\n          for (var p=0; p<nplanes; p++) {\n            var byte = words[ofs + p*pofs + skip];\n            color |= ((fmt.brev ? byte>>(bitsperword-shift-bpp) : byte>>shift) & mask) << (p*bpp);\n          }\n          imgdata.push(color);\n          shift += bpp;\n          if (shift >= bitsperword && !fmt.reindex) {\n            ofs0 += 1;\n            shift = 0;\n          }\n        }\n      }\n      images.push(new Uint8Array(imgdata));\n    }\n    return images;\n  }\n  ", "\nenum DataType {\n    unknown,\n    u8,\n    s8,\n    u16,\n    s16,\n    u32,\n    s32,\n    f32,\n    f64,\n};\n\nfunction getArrayDataType(value: any) : DataType {\n    if (value instanceof Uint8Array) {\n        return DataType.u8;\n    } else if (value instanceof Int8Array) {\n        return DataType.s8;\n    } else if (value instanceof Uint16Array) {\n        return DataType.u16;\n    } else if (value instanceof Int16Array) {\n        return DataType.s16;\n    } else if (value instanceof Uint32Array) {\n        return DataType.u32;\n    } else if (value instanceof Int32Array) {\n        return DataType.s32;\n    } else if (value instanceof Float32Array) {\n        return DataType.f32;\n    } else if (value instanceof Float64Array) {\n        return DataType.f64;\n    }\n}\n\nexport abstract class OutputFile {\n    constructor(\n        public readonly path : string,\n        public readonly decls : {}\n    ) {\n    }\n    abstract declToText(label: string, value: any) : string;\n    toString() : string {\n        return Object.entries(this.decls).map(entry => this.declToText(entry[0],entry[1])).join('\\n\\n');\n    }\n}\n\nexport class COutputFile extends OutputFile {\n    toString() : string {\n        return `#include <stdint.h>\\n\\n${super.toString()}\\n`;\n    }\n    dataTypeToString(dtype: DataType) {\n        switch (dtype) {\n            case DataType.u8: return 'uint8_t';\n            case DataType.s8: return 'int8_t';\n            case DataType.u16: return 'uint16_t';\n            case DataType.s16: return 'int16_t';\n            case DataType.u32: return 'uint32_t';\n            case DataType.s32: return 'int32_t';\n            case DataType.f32: return 'float';\n            case DataType.f64: return 'double';\n            default:\n                throw new Error('Cannot convert data type'); // TODO\n        }\n    }\n    valueToString(value, atype: DataType) : string {\n        // TODO: round, check value\n        return value+\"\";\n    }\n    declToText(label: string, value: any) : string {\n        if (Array.isArray(value) || value['BYTES_PER_ELEMENT']) {\n            let atype = getArrayDataType(value);\n            if (atype != null) {\n                let dtypestr = this.dataTypeToString(atype);\n                let dtext = value.map(elem => this.valueToString(elem, atype)).join(',');\n                let len = value.length;\n                return `${dtypestr} ${label}[${len}] = { ${dtext} };`;\n            }\n        }\n        throw new Error(`Cannot convert array \"${label}\"`); // TODO\n    }\n}\n\n// TODO: header file, auto-detect tool?\nexport function file(path: string, decls: {}) {\n    return new COutputFile(path, decls);\n}\n", "\nimport * as io from \"./io\";\n\n// sequence counter\nvar $$seq : number = 0;\n\n// if an event is specified, it goes here\nexport const EVENT_KEY = \"$$event\";\n\n// an object that can become interactive, identified by ID\nexport interface Interactive {\n    $$interact: InteractionRecord;\n}\n\nexport interface InteractEvent {\n    interactid : number;\n    type: string;\n    x?: number;\n    y?: number;\n    button?: boolean;\n}\n\nexport type InteractCallback = (event: InteractEvent) => void;\n\n// InteractionRecord maps a target object to an interaction ID\n// the $$callback is used once per script eval, then gets nulled\n// whether or not it's invoked\n// event comes from $$data.$$event\nexport class InteractionRecord implements io.Loadable {\n    readonly interacttarget: Interactive;\n    interactid : number;\n    lastevent : {} = null;\n    constructor(\n        interacttarget: Interactive,\n        private $$callback: InteractCallback\n    ) {\n        this.interacttarget = interacttarget || (<any>this as Interactive);\n        this.interactid = ++$$seq;\n    }\n    $$setstate(newstate: {interactid: number}) {\n        this.interactid = newstate.interactid;\n        this.interacttarget.$$interact = this;\n        let event : InteractEvent = io.data.get(EVENT_KEY);\n        if (event && event.interactid == this.interactid) {\n            if (this.$$callback) {\n                this.$$callback(event);\n            }\n            this.lastevent = event;\n            io.data.set(EVENT_KEY, null);\n        }\n        this.$$callback = null;\n    }\n    $$getstate() {\n        //TODO: this isn't always cleared before we serialize (e.g. if exception or move element)\n        //and we do it in checkResult() too\n        this.$$callback = null;\n        return {interactid: this.interactid};\n    }\n}\n\nexport function isInteractive(obj: object): obj is Interactive {\n    return !!((obj as Interactive).$$interact);\n}\n\nexport function interact(object: any, callback) : InteractionRecord {\n    // TODO: limit to Bitmap, etc\n    if (typeof object === 'object') {\n        return new InteractionRecord(object, callback);\n    }\n    throw new Error(`This object is not capable of interaction.`);\n}\n\n///\n\nexport interface ScriptUIType {\n    uitype : string;\n}\n\nexport class ScriptUISliderType implements ScriptUIType {\n    readonly uitype = 'slider';\n    value: number;\n    constructor(\n        readonly min: number,\n        readonly max: number,\n        readonly step: number\n    ) {\n        this.value = min;\n    }\n}\n\nexport class ScriptUISlider extends ScriptUISliderType implements io.Loadable {\n    initial(value: number) {\n        this.value = value;\n        return this;\n    }\n    $$getstate() {\n        return { value: this.value };\n    }\n}\n\nexport function slider(min: number, max: number, step?: number) {\n    return new ScriptUISlider(min, max, step || 1);\n}\n\n///\n\nexport class ScriptUISelectType<T> implements ScriptUIType {\n    readonly uitype = 'select';\n    value: T;\n    index: number;\n    constructor(\n        readonly options: T[]\n    ) {\n        this.index = 0;\n        this.value = this.options[this.index];\n    }\n}\n\nexport class ScriptUISelect<T> extends ScriptUISelectType<T> implements io.Loadable {\n    initial(index: number) {\n        this.index = index;\n        this.value = this.options[index];\n        return this;\n    }\n    $$getstate() {\n        return { value: this.value, index: this.index };\n    }\n}\n\nexport function select(options: any[]) {\n    return new ScriptUISelect(options);\n}\n\n///\n\nexport class ScriptUIButtonType extends InteractionRecord implements ScriptUIType, Interactive {\n    readonly uitype = 'button';\n    $$interact: InteractionRecord;\n    enabled?: boolean;\n\n    constructor(\n        readonly label: string,\n        callback: InteractCallback\n    ) {\n        super(null, callback);\n        this.$$interact = this;\n    }\n}\n\nexport class ScriptUIButton extends ScriptUIButtonType {\n}\n\nexport function button(name: string, callback: InteractCallback) {\n    return new ScriptUIButton(name, callback);\n}\n\nexport class ScriptUIToggle extends ScriptUIButton implements io.Loadable {\n    // share with InteractionRecord\n    $$getstate() {\n        let state = super.$$getstate() as any;\n        state.enabled = this.enabled;\n        return state;\n    }\n    $$setstate(newstate: any) {\n        this.enabled = newstate.enabled;\n        super.$$setstate(newstate);\n    }\n}\n\nexport function toggle(name: string) {\n    return new ScriptUIToggle(name, function(e) {\n        this.enabled = !this.enabled;\n    });\n}\n\n///\n\nexport class ScriptUIShortcut extends InteractionRecord implements ScriptUIType, Interactive {\n    readonly uitype = 'shortcut';\n    $$interact: InteractionRecord;\n\n    constructor(\n        readonly key: string,\n        callback: InteractCallback\n    ) {\n        super(null, callback);\n        this.$$interact = this;\n    }\n}\n\nexport function key(key: string, callback: InteractCallback) {\n    return new ScriptUIShortcut(key, callback);\n}\n", "\nimport { WorkerError } from \"../workertypes\";\nimport ErrorStackParser = require(\"error-stack-parser\");\nimport yufka from 'yufka';\nimport * as bitmap from \"./lib/bitmap\";\nimport * as io from \"./lib/io\";\nimport * as output from \"./lib/output\";\nimport * as color from \"./lib/color\";\nimport * as scriptui from \"./lib/scriptui\";\n\nexport const PROP_CONSTRUCTOR_NAME = \"$$consname\";\n\nexport interface Cell {\n    id: string;\n    object?: any;\n}\n\nexport interface RunResult {\n    cells: Cell[];\n    state: {};\n}\n\nconst IMPORTS = {\n    'bitmap': bitmap,\n    'io': io,\n    'output': output,\n    'color': color,\n    'ui': scriptui,\n}\n\nconst LINE_NUMBER_OFFSET = 3; // TODO: shouldnt need?\n\nconst GLOBAL_BADLIST = [\n    'eval'\n]\n\nconst GLOBAL_GOODLIST = [\n    'eval', // 'eval' can't be defined or assigned to in strict mode code\n    'Math', 'JSON',\n    'parseFloat', 'parseInt', 'isFinite', 'isNaN',\n    'String', 'Symbol', 'Number', 'Object', 'Boolean', 'NaN', 'Infinity', 'Date', 'BigInt',\n    'Set', 'Map', 'RegExp', 'Array', 'ArrayBuffer', 'DataView',\n    'Float32Array', 'Float64Array',\n    'Int8Array', 'Int16Array', 'Int32Array',\n    'Uint8Array', 'Uint16Array', 'Uint32Array', 'Uint8ClampedArray',\n]\n\nclass RuntimeError extends Error {\n    constructor(public loc: acorn.SourceLocation, msg: string) {\n        super(msg);\n    }\n}\n\nfunction setConstructorName(o: object) : void {\n    let name = Object.getPrototypeOf(o)?.constructor?.name;\n    if (name != null && name != 'Object') {\n        o[PROP_CONSTRUCTOR_NAME] = name;\n    }\n}\n\nexport class Environment {\n    preamble: string;\n    postamble: string;\n    obj: {};\n    seq: number;\n    declvars : {[name : string] : acorn.Node};\n    builtins : {}\n\n    constructor(\n        public readonly globalenv: any,\n        public readonly path: string\n    ) {\n        var badlst = Object.getOwnPropertyNames(this.globalenv).filter(name => GLOBAL_GOODLIST.indexOf(name) < 0);\n        this.builtins = {\n            print: (...args) => this.print(args),\n            ...IMPORTS\n        }\n        this.preamble = `'use strict';var ${badlst.join(',')};`;\n        for (var impname in this.builtins) {\n            this.preamble += `var ${impname}=$$.${impname};`\n        }\n        this.preamble += '{\\n';\n        this.postamble = '\\n}';\n    }\n    error(varname: string, msg: string) {\n        let obj = this.declvars && this.declvars[varname];\n        console.log('ERROR', varname, obj, this);\n        throw new RuntimeError(obj && obj.loc, msg);\n    }\n    print(args: any[]) {\n        if (args && args.length > 0 && args[0] != null) {\n            this.obj[`$print__${this.seq++}`] = args.length == 1 ? args[0] : args;\n        }\n    }\n    preprocess(code: string): string {\n        this.declvars = {};\n        this.seq = 0;\n        let options = {\n            // https://www.npmjs.com/package/magic-string#sgeneratemap-options-\n            sourceMap: {\n                file: this.path,\n                source: this.path,\n                hires: false,\n                includeContent: false\n            },\n            // https://github.com/acornjs/acorn/blob/master/acorn/README.md\n            acorn: {\n                ecmaVersion: 6 as any,\n                locations: true,\n                allowAwaitOutsideFunction: true,\n                allowReturnOutsideFunction: true,\n                allowReserved: true,\n            }\n        };\n        const result = yufka(code, options, (node, { update, source, parent }) => {\n            const isTopLevel = () => {\n                return parent() && parent().type === 'ExpressionStatement' && parent(2) && parent(2).type === 'Program';\n            }\n            const convertTopToPrint = () => {\n                if (isTopLevel()) {\n                    let printkey = `$print__${this.seq++}`;\n                    update(`this.${printkey} = io.data.load(${source()}, ${JSON.stringify(printkey)})`);\n                    //update(`print(${source()});`)\n                }\n            }\n            const left = node['left'];\n            switch (node.type) {\n                // add preamble, postamble\n                case 'Program':\n                    update(`${this.preamble}${source()}${this.postamble}`)\n                    break;\n                // error on forbidden keywords\n                case 'Identifier':\n                    if (GLOBAL_BADLIST.indexOf(source()) >= 0) {\n                        update(`__FORBIDDEN__KEYWORD__${source()}__`) // TODO? how to preserve line number?\n                    } else {\n                        convertTopToPrint();\n                    }\n                    break;\n                // x = expr --> var x = expr (first use)\n                case 'AssignmentExpression':\n                    if (isTopLevel()) {\n                        if (left && left.type === 'Identifier') {\n                            if (!this.declvars[left.name]) {\n                                update(`var ${left.name}=io.data.load(this.${source()}, ${JSON.stringify(left.name)})`)\n                                this.declvars[left.name] = left;\n                            } else {\n                                update(`${left.name}=this.${source()}`)\n                            }\n                        }\n                    }\n                    break;\n                // convert lone expressions to print()\n                case 'UnaryExpression':\n                case 'BinaryExpression':\n                case 'CallExpression':\n                case 'MemberExpression':\n                    convertTopToPrint();\n                    break;\n                // literal comments\n                case 'Literal':\n                    if (typeof node['value'] === 'string' && isTopLevel()) {\n                        update(`this.$doc__${this.seq++} = { literaltext: ${source()} };`);\n                    } else {\n                        convertTopToPrint();\n                    }\n                    break;\n            }\n        });\n        return result.toString();\n    }\n    async run(code: string): Promise<void> {\n        // TODO: split into cells based on \"--\" linebreaks?\n        code = this.preprocess(code);\n        this.obj = {};\n        const AsyncFunction = Object.getPrototypeOf(async function () { }).constructor;\n        const fn = new AsyncFunction('$$', code).bind(this.obj, this.builtins);\n        await fn.call(this);\n        this.checkResult(this.obj, new Set(), []);\n    }\n    // https://developer.mozilla.org/en-US/docs/Web/API/Web_Workers_API/Structured_clone_algorithm\n    // TODO: return initial location of thingie\n    checkResult(o, checked: Set<object>, fullkey: string[]) {\n        if (o == null) return;\n        if (checked.has(o)) return;\n        if (typeof o === 'object') {\n            setConstructorName(o);\n            delete o.$$callback; // clear callbacks (TODO? put somewhere else?)\n            if (o.length > 100) return; // big array, don't bother\n            if (o.BYTES_PER_ELEMENT > 0) return; // typed array, don't bother\n            checked.add(o); // so we don't recurse if cycle\n            function prkey() { return fullkey.join('.') }\n            // go through all object properties recursively\n            for (var [key, value] of Object.entries(o)) {\n                if (value == null && fullkey.length == 0 && !key.startsWith(\"$\")) {\n                    this.error(key, `\"${key}\" has no value.`)\n                }\n                fullkey.push(key);\n                if (typeof value === 'function') {\n                    if (fullkey.length == 1)\n                        this.error(fullkey[0], `\"${prkey()}\" is a function. Did you forget to pass parameters?`); // TODO? did you mean (needs to see entire expr)\n                    else\n                        this.error(fullkey[0], `This expression may be incomplete, or it contains a function object: ${prkey()}`); // TODO? did you mean (needs to see entire expr)\n                }\n                if (typeof value === 'symbol') {\n                    this.error(fullkey[0], `\"${prkey()}\" is a Symbol, and can't be used.`) // TODO?\n                }\n                if (value instanceof Promise) {\n                    this.error(fullkey[0], `\"${prkey()}\" is unresolved. Use \"await\" before expression.`) // TODO?\n                }\n                this.checkResult(value, checked, fullkey);\n                fullkey.pop();\n            }\n        }\n    }\n    render(): Cell[] {\n        var cells = [];\n        for (var [key, value] of Object.entries(this.obj)) {\n            if (typeof value === 'function') {\n                // TODO: find other values, functions embedded in objects?\n            } else {\n                var cell: Cell = { id: key, object: value };\n                cells.push(cell);\n            }\n        }\n        return cells;\n    }\n    extractErrors(e: Error): WorkerError[] {\n        let loc = e['loc'];\n        if (loc && loc.start && loc.end) {\n            return [{\n                path: this.path,\n                msg: e.message,\n                line: loc.start.line,\n                start: loc.start.column,\n                end: loc.end.line,\n            }]\n        }\n        if (loc && loc.line != null) {\n            return [{\n                path: this.path,\n                msg: e.message,\n                line: loc.line,\n                start: loc.column,\n            }]\n        }\n        // TODO: Cannot parse given Error object?\n        let frames = ErrorStackParser.parse(e);\n        let frame = frames.findIndex(f => f.functionName === 'anonymous');\n        let errors = [];\n        // if ErrorStackParser fails, resort to regex\n        if (frame < 0 && e.stack != null) {\n            let m = /.anonymous.:(\\d+):(\\d+)/g.exec(e.stack);\n            if (m != null) {\n                errors.push( {\n                    path: this.path,\n                    msg: e.message,\n                    line: parseInt(m[1]) - LINE_NUMBER_OFFSET,\n                });\n            }\n        }\n        // otherwise iterate thru all the frames\n        while (frame >= 0) {\n            console.log(frames[frame]);\n            if (frames[frame].fileName.endsWith('Function')) {\n                // TODO: use source map\n                errors.push( {\n                    path: this.path,\n                    msg: e.message,\n                    line: frames[frame].lineNumber - LINE_NUMBER_OFFSET,\n                    //start: frames[frame].columnNumber,\n                } );\n            }\n            --frame;\n        }\n        // if no stack frames parsed, last resort error msg\n        if (errors.length == 0) {\n            errors.push( {\n                path: this.path,\n                msg: e.message,\n                line: 0\n            } );\n        }\n        return errors;\n    }\n    commitLoadableState() {\n        // TODO: visit children?\n        for (let [key, value] of Object.entries(this.obj)) {\n            let loadable = <any>value as io.Loadable;\n            io.data.save(loadable, key);\n        }\n        return io.$$getData();\n    }\n}\n", "\nimport { Component, render, h, createRef, VNode } from 'preact';\nimport { Cell, PROP_CONSTRUCTOR_NAME } from \"../env\";\nimport { findIntegerFactors, hex, isArray, rgb2bgr } from \"../../util\";\nimport { dumpRAM } from \"../../emu\";\nimport { current_project } from \"../../../ide/ui\";\n// TODO: can't call methods from this end (e.g. Palette, Bitmap)\nimport * as bitmap from \"../lib/bitmap\";\nimport * as color from \"../lib/color\";\nimport * as scriptui from \"../lib/scriptui\";\n\nconst MAX_STRING_LEN = 100;\nconst DEFAULT_ASPECT = 1;\n\nfunction sendInteraction(iobj: scriptui.Interactive, type: string, event: Event, xtraprops: {}) {\n    let irec = iobj.$$interact;\n    let ievent : scriptui.InteractEvent = {interactid: irec.interactid, type, ...xtraprops};\n    if (event instanceof PointerEvent) {\n        const canvas = event.target as HTMLCanvasElement;\n        const rect = canvas.getBoundingClientRect();\n        const scaleX = canvas.width / rect.width;\n        const scaleY = canvas.height / rect.height;\n        const x = (event.clientX - rect.left) * scaleX;\n        const y = (event.clientY - rect.top) * scaleY;\n        ievent.x = Math.floor(x);\n        ievent.y = Math.floor(y);\n        // TODO: pressure, etc.\n    } else {\n        console.log(\"Unknown event type\", event);\n    }\n    // TODO: add events to queue?\n    current_project.updateDataItems([{\n        key: scriptui.EVENT_KEY,\n        value: ievent\n    }]);\n}\n\ninterface ColorComponentProps {\n    rgbavalue: number;\n}\n\nclass ColorComponent extends Component<ColorComponentProps> {\n    render(virtualDom, containerNode, replaceNode) {\n        let rgb = this.props.rgbavalue & 0xffffff;\n        let bgr = rgb2bgr(rgb);\n        var htmlcolor = `#${hex(bgr,6)}`;\n        var textcolor = (rgb & 0x008000) ? '#222' : '#ddd';\n        var printcolor = hex(rgb & 0xffffff, 6); // TODO: show index instead?\n        return h('div', {\n            class: 'scripting-item scripting-color',\n            style: `background-color: ${htmlcolor}; color: ${textcolor}`,\n            alt: htmlcolor, // TODO\n        }, [\n            //h('span', { }, printcolor )\n        ]);\n    }\n}\n\ninterface BitmapComponentProps {\n    bitmap: bitmap.BitmapType;\n    width: number;\n    height: number;\n}\n\nclass BitmapComponent extends Component<BitmapComponentProps> {\n    ref = createRef(); // TODO: can we use the ref?\n    canvas: HTMLCanvasElement;\n    ctx: CanvasRenderingContext2D;\n    imageData: ImageData;\n    datau32: Uint32Array;\n    pressed = false;\n\n    constructor(props: BitmapComponentProps) {\n        super(props);\n    }\n    render(virtualDom, containerNode, replaceNode) {\n        let props = {\n            class: 'scripting-item',\n            ref: this.ref,\n            width: this.props.width,\n            height: this.props.height,\n            style: this.props.bitmap.style\n        }\n        let obj : any = this.props.bitmap;\n        if (scriptui.isInteractive(obj)) {\n            return h('canvas', {\n                onPointerMove: (e: PointerEvent) => {\n                    sendInteraction(obj, 'move', e, { pressed: this.pressed });\n                },\n                onPointerDown: (e: PointerEvent) => {\n                    this.pressed = true;\n                    this.canvas.setPointerCapture(e.pointerId);\n                    sendInteraction(obj, 'down', e, { pressed: true });\n                },\n                onPointerUp: (e: PointerEvent) => {\n                    this.pressed = false;\n                    sendInteraction(obj, 'up', e, { pressed: false });\n                },\n                onPointerOut: (e: PointerEvent) => {\n                    this.pressed = false;\n                    sendInteraction(obj, 'out', e, { pressed: false });\n                },\n                ...props\n            });\n        } else {\n            return h('canvas', props);\n        }\n    }\n    componentDidMount() {\n        this.refresh();\n    }\n    componentWillUnmount() {\n        this.canvas = null;\n        this.imageData = null;\n        this.datau32 = null;\n    }\n    componentDidUpdate(prevProps, prevState, snapshot) {\n        this.refresh();\n    }\n    prepare() {\n        this.canvas = this.base as HTMLCanvasElement;\n        this.ctx = this.canvas.getContext('2d');\n        this.imageData = this.ctx.createImageData(this.canvas.width, this.canvas.height);\n        this.datau32 = new Uint32Array(this.imageData.data.buffer);\n    }\n    refresh() {\n        // preact can reuse this component but it can change shape :^P\n        if (this.canvas !== this.base\n            || this.imageData.width != this.props.width\n            || this.imageData.height != this.props.height) {\n            this.prepare();\n        }\n        this.updateCanvas(this.datau32, this.props.bitmap);\n        this.ctx.putImageData(this.imageData, 0, 0);\n    }\n    updateCanvas(vdata: Uint32Array, bmp: bitmap.BitmapType) {\n        if (bmp['palette']) {\n            this.updateCanvasIndexed(vdata, bmp as bitmap.IndexedBitmap);\n        }\n        if (bmp['rgba']) {\n            this.updateCanvasRGBA(vdata, bmp as bitmap.RGBABitmap);\n        }\n    }\n    updateCanvasRGBA(vdata: Uint32Array, bmp: bitmap.RGBABitmap) {\n        vdata.set(bmp.rgba);\n    }\n    updateCanvasIndexed(vdata: Uint32Array, bmp: bitmap.IndexedBitmap) {\n        let pal = bmp.palette.colors;\n        for (var i = 0; i < bmp.pixels.length; i++) {\n            vdata[i] = pal[bmp.pixels[i]];\n        }\n    }\n}\n\ninterface ObjectTreeComponentProps {\n    name?: string;\n    object: {} | [];\n    objpath: string;\n}\n\ninterface ObjectTreeComponentState {\n    expanded: boolean;\n}\n\nclass ObjectKeyValueComponent extends Component<ObjectTreeComponentProps, ObjectTreeComponentState> {\n    render(virtualDom, containerNode, replaceNode) {\n        let expandable = typeof this.props.object === 'object';\n        let hdrclass = '';\n        if (expandable) hdrclass = this.state.expanded ? 'tree-expanded' : 'tree-collapsed'\n        let propName = this.props.name || null;\n        return h('div', {\n            class: 'tree-content',\n            key: `${this.props.objpath}__tree`\n        }, [\n            h('div', {\n                class: 'tree-header ' + hdrclass,\n                onClick: expandable ? () => this.toggleExpand() : null\n            }, [\n                propName != null ? h('span', { class: 'tree-key' }, [ propName, expandable ]) : null,\n                h('span', { class: 'tree-value scripting-item' }, [\n                    getShortName(this.props.object)\n                ])\n            ]),\n            this.state.expanded ? objectToContentsDiv(this.props.object, this.props.objpath) : null\n        ]);\n    }\n    toggleExpand() {\n        this.setState({ expanded: !this.state.expanded });\n    }\n}\n\nfunction getShortName(object: any) {\n    if (typeof object === 'object') {\n        try {\n            var s = object[PROP_CONSTRUCTOR_NAME] || Object.getPrototypeOf(object).constructor.name;\n            if (object.length > 0) {\n                s += `[${object.length}]`\n            }\n            return s;\n        } catch (e) {\n            console.log(e);\n            return e + \"\";\n        }\n    } else {\n        return primitiveToString(object);\n    }\n}\n\nfunction primitiveToString(obj) {\n    var text = \"\";\n    // is it a function? call it first, if we are expanded\n    // TODO: only call functions w/ signature\n    if (obj && obj.$$ && typeof obj.$$ == 'function' && this._content != null) {\n        obj = obj.$$();\n    }\n    // check null first\n    if (obj == null) {\n        text = obj + \"\";\n        // primitive types\n    } else if (typeof obj == 'number') {\n        if (obj != (obj | 0)) text = obj.toString(); // must be a float\n        else text = obj + \"\\t($\" + hex(obj) + \")\";\n    } else if (typeof obj == 'string') {\n        text = obj;\n    } else {\n        text = JSON.stringify(obj);\n    }\n    if (text.length > MAX_STRING_LEN)\n        text = text.substring(0, MAX_STRING_LEN) + \"...\";\n    return text;\n}\n\nfunction isIndexedBitmap(object): object is bitmap.IndexedBitmap {\n    return object['bpp'] && object['pixels'] && object['palette'];\n}\nfunction isRGBABitmap(object): object is bitmap.RGBABitmap {\n    return object['rgba'] instanceof Uint32Array;\n}\n\nfunction objectToChildren(object: any) : any[] {\n    if (color.isPalette(object)) {\n        return new color.Palette(object.colors).chromas();\n    } else if (isArray(object)) {\n        return Array.from(object);\n    } else if (object != null) {\n        return [ object ]\n    } else {\n        return [ ]\n    }\n}\n\nfunction objectToChild(object: any, index: number) : any {\n    if (color.isPalette(object)) {\n        return color.from(object.colors[index]);\n    } else if (isArray(object)) {\n        return object[index];\n    } else if (object != null) {\n        return object\n    } else {\n        return null\n    }\n}\n\nfunction objectToDiv(object: any, name: string, objpath: string): VNode<any> {\n    // don't view any keys that start with \"$\"\n    if (name && name.startsWith(\"$\")) {\n        // don't view any values that start with \"$$\"\n        if (name.startsWith(\"$$\")) return;\n        // don't print if null or undefined\n        if (object == null) return;\n        // don't print key in any case\n        name = null;\n    }\n    // TODO: limit # of items\n    // TODO: detect table\n    if (object == null) {\n        return h('span', { }, object + \"\");\n    } else if (object['uitype']) {\n        let cons = UI_COMPONENTS[object['uitype']];\n        if (!cons) throw new Error(`Unknown UI component type: ${object['uitype']}`);\n        return h(cons, { iokey: objpath, uiobject: object });\n    } else if (object['literaltext']) {\n        return h(\"pre\", { }, [ object['literaltext'] ]);\n    } else if (isIndexedBitmap(object) || isRGBABitmap(object)) {\n        return h(BitmapComponent, { bitmap: object, width: object.width, height: object.height });\n    } else if (color.isChroma(object)) {\n        return h(ColorComponent, { rgbavalue: color.rgb(object) });\n    } else if (color.isPalette(object)) {\n        // TODO?\n        if (object.colors.length <= 256) {\n            let children = [];\n            let props = { class: '', key: `${objpath}__obj` };\n            props.class += ' scripting-flex ';\n            object.colors.forEach((val) => {\n                children.push(h(ColorComponent, { rgbavalue: val }));\n            })\n            return h('div', props, children);\n        } else {\n            let {a,b} = findIntegerFactors(object.colors.length, 1, 1, DEFAULT_ASPECT);\n            return objectToDiv({ rgba: object.colors, width: a, height: b }, name, objpath);\n        }\n    } else {\n        return h(ObjectKeyValueComponent, { name, object, objpath }, []);\n    }\n}\n\nfunction fixedArrayToDiv(tyarr: Array<number>, bpel: number, objpath: string) {\n    const maxBytes = 0x100;\n    if (tyarr.length <= maxBytes) {\n        // TODO\n        let dumptext = dumpRAM(tyarr, 0, tyarr.length);\n        return h('pre', {}, dumptext);\n    } else {\n        let children = [];\n        for (var ofs = 0; ofs < tyarr.length; ofs += maxBytes) {\n            children.push(objectToDiv(tyarr.slice(ofs, ofs + maxBytes), '$' + hex(ofs), `${objpath}.${ofs}`));\n        }\n        return h('div', {}, children);\n    }\n}\n\nfunction objectToContentsDiv(object: {} | [], objpath: string) {\n    // is typed array?\n    let bpel = object['BYTES_PER_ELEMENT'];\n    if (typeof bpel === 'number') {\n        return fixedArrayToDiv(object as Array<number>, bpel, objpath);\n    }\n    let objectEntries = Object.entries(object);\n    let objectDivs = objectEntries.map(entry => objectToDiv(entry[1], entry[0], `${objpath}.${entry[1]}`));\n    return h('div', { class: 'scripting-flex' }, objectDivs);\n}\n\n///\n\ninterface UIComponentProps {\n    iokey: string;\n    uiobject: scriptui.ScriptUIType;\n    dropdown?: boolean;\n}\n\nclass UISliderComponent extends Component<UIComponentProps> {\n    render(virtualDom, containerNode, replaceNode) {\n        let slider = this.props.uiobject as scriptui.ScriptUISliderType;\n        return h('div', {}, [\n            this.props.iokey,\n            h('input', {\n                type: 'range',\n                min: slider.min / slider.step,\n                max: slider.max / slider.step,\n                value: slider.value / slider.step,\n                onInput: (ev) => {\n                    let newUIValue = { value: parseFloat(ev.target.value) * slider.step };\n                    this.setState(this.state);\n                    current_project.updateDataItems([{key: this.props.iokey, value: newUIValue}]);\n                }\n            }),\n            h('span', { }, getShortName(slider.value)),\n        ]);\n    }\n}\n\nclass UISelectComponent extends Component<UIComponentProps, ObjectTreeComponentState> {\n    ref = createRef();\n    render(virtualDom, containerNode, replaceNode) {\n        let select = this.props.uiobject as scriptui.ScriptUISelectType<any>;\n        let children = objectToChildren(select.options);\n        this.props.dropdown = children.length > 16;\n        let showselections = !this.props.dropdown || this.state.expanded;\n        let seldiv = null;\n        if (showselections) {\n            seldiv = h('div', {\n                class: 'scripting-select scripting-flex',\n                ref: this.ref,\n                onClick: (e) => {\n                    // select object -- iterate parents until we find select div, then find index of child\n                    let target = e.target as HTMLElement;\n                    while (target.parentElement && target.parentElement != this.ref.current) {\n                        target = target.parentElement;\n                    }\n                    if (target.parentElement) {\n                        const selindex = Array.from(target.parentElement.children).indexOf(target);\n                        if (selindex >= 0 && selindex < children.length) {\n                            let newUIValue = { value: children[selindex], index: selindex };\n                            this.setState({ expanded: false });\n                            current_project.updateDataItems([{key: this.props.iokey, value: newUIValue}]);\n                        } else {\n                            throw new Error(`Could not find click target of ${this.props.iokey}`);\n                        }\n                    }\n                }\n            },\n            children.map((child, index) => {\n                let div = objectToDiv(child, null, `${this.props.iokey}__select_${index}`);\n                let selected = (index == select.index);\n                return h('div', { class: selected ? 'scripting-selected' : '' }, [ div ]);\n            }));\n        }\n        if (this.props.dropdown) {\n            let selectedDiv = objectToDiv(objectToChild(select.options, select.index), null, `${this.props.iokey}__selected`);\n            return h('div', {\n                class: 'tree-content',\n                key: `${this.props.iokey}__tree`\n            }, [\n                h('div', {\n                    class: 'tree-header ' + (this.state.expanded ? 'tree-expanded' : 'tree-collapsed'),\n                    onClick: () => this.toggleExpand()\n                }, [\n                    this.props.iokey,\n                    h('span', { class: 'tree-value scripting-item' }, [\n                        selectedDiv,\n                        //getShortName(select.options)\n                    ])\n                ]),\n                seldiv\n            ]);\n        } else {\n            return seldiv;\n        }\n    }\n    toggleExpand() {\n        this.setState({ expanded: !this.state.expanded });\n    }\n}\n\nclass UIButtonComponent extends Component<UIComponentProps> {\n    render(virtualDom, containerNode, replaceNode) {\n        let button = this.props.uiobject as scriptui.ScriptUIButtonType;\n        return h('button', {\n            class: button.enabled ? 'scripting-button scripting-enabled' : 'scripting-button',\n            onClick: (e: MouseEvent) => {\n                sendInteraction(button, 'click', e, { });\n            },\n        }, [ \n            button.label \n        ])\n    }\n}\n\nclass UIShortcutComponent extends Component<UIComponentProps> {\n    render(virtualDom, containerNode, replaceNode) {\n        let shortcut = this.props.uiobject as scriptui.ScriptUIShortcut;\n        // TODO: needs to fire on container node\n        return h('div', {\n            onKeyDown: (e: KeyboardEvent) => {\n                sendInteraction(shortcut, 'key', e, { });\n            },\n        }, [ ])\n    }\n}\n\nconst UI_COMPONENTS = {\n    'slider': UISliderComponent,\n    'select': UISelectComponent,\n    'button': UIButtonComponent,\n    'shortcut': UIShortcutComponent,\n}\n\n///\n\nexport class Notebook {\n    constructor(\n        public readonly maindoc: HTMLDocument,\n        public readonly maindiv: HTMLElement\n    ) {\n        maindiv.classList.add('vertical-scroll');\n    }\n    updateCells(cells: Cell[]) {\n        let hTree = cells.map(cell => {\n            return h('div', {\n                class: 'scripting-cell',\n                key: `${cell.id}__cell`\n            }, [\n                objectToDiv(cell.object, cell.id, cell.id)\n            ])\n        });\n        render(hTree, this.maindiv);\n    }\n}\n", "\nimport { PLATFORMS } from \"../common/emu\";\nimport { Platform } from \"../common/baseplatform\";\nimport { RunResult } from \"../common/script/env\";\nimport { Notebook } from \"../common/script/ui/notebook\";\n\nclass ScriptingPlatform implements Platform {\n    mainElement: HTMLElement;\n    iframe: HTMLIFrameElement;\n    notebook: Notebook;\n\n    constructor(mainElement: HTMLElement) {\n        this.mainElement = mainElement;\n        this.notebook = new Notebook(document, mainElement);\n    }\n    start() {\n    }\n    reset() {\n    }\n    pause() {\n    }\n    resume() {\n    }\n    loadROM(title, run: RunResult) {\n        this.notebook.updateCells(run.cells);\n        // TODO: save state file\n    }\n    isRunning() {\n        return true;\n    }\n    isDebugging(): boolean {\n        return false;\n    }\n    getToolForFilename(fn: string): string {\n        return \"js\";\n    }\n    getDefaultExtension(): string {\n        return \".js\";\n    }\n    getPresets() {\n        return [\n        ];\n    }\n}\n\nPLATFORMS['script'] = ScriptingPlatform;\n"],
  "mappings": "2WAgBA,AAAC,UAAS,EAAK,CACb,aAGA,GAAI,EAAM,aAAkB,EAAM,YAChC,MAAO,GAOT,WAAyB,EAAW,QAAO,CACzC,GAAI,IAAa,QACf,KAAM,IAAI,YACR,oEAAoE,mBAK1E,OAAO,eAAe,EAAgB,UAAW,WAAY,CAC3D,MAAO,UAQT,EAAgB,UAAU,OAAS,SACjC,EACA,EAAU,CAAE,OAAQ,IAAO,CAE3B,GAAI,EAAQ,OACV,KAAM,IAAI,OAAM,yDAGlB,GAAI,GAAM,EACJ,EAAM,EAAO,OACb,EAAM,GAER,EAAK,EACL,EAAO,KAAK,IAAI,GAAI,EAAO,IAAO,GAAK,GACvC,EAAS,GAAI,YAAY,GAAQ,GAAM,GAE3C,KAAO,EAAM,GAAK,CAChB,GAAI,GAAQ,EAAO,WAAW,KAC9B,GAAI,GAAS,OAAU,GAAS,MAAQ,CAEtC,GAAI,EAAM,EAAK,CACb,GAAM,GAAQ,EAAO,WAAW,GAChC,AAAK,GAAQ,QAAY,OACvB,GAAE,EACF,EAAU,IAAQ,OAAU,IAAO,GAAQ,MAAS,OAGxD,GAAI,GAAS,OAAU,GAAS,MAC9B,SAKJ,GAAI,EAAK,EAAI,EAAO,OAAQ,CAC1B,GAAQ,EACR,GAAQ,EAAO,EAAM,EAAO,OAAU,EACtC,EAAQ,GAAQ,GAAM,EAEtB,GAAM,GAAS,GAAI,YAAW,GAC9B,EAAO,IAAI,GACX,EAAS,EAGX,GAAK,GAAQ,aAAgB,EAAG,CAE9B,EAAO,KAAQ,EACf,iBACU,GAAQ,aAAgB,EAElC,EAAO,KAAU,GAAS,EAAK,GAAQ,YAC7B,GAAQ,aAAgB,EAElC,EAAO,KAAU,GAAS,GAAM,GAAQ,IACxC,EAAO,KAAU,GAAS,EAAK,GAAQ,YAC7B,GAAQ,aAAgB,EAElC,EAAO,KAAU,GAAS,GAAM,EAAQ,IACxC,EAAO,KAAU,GAAS,GAAM,GAAQ,IACxC,EAAO,KAAU,GAAS,EAAK,GAAQ,QAGvC,UAGF,EAAO,KAAS,EAAQ,GAAQ,IAGlC,MAAO,GAAO,MAAM,EAAG,IAQzB,WAAyB,EAAW,QAAS,EAAU,CAAE,MAAO,IAAO,CACrE,GAAI,IAAa,QACf,KAAM,IAAI,YACR,oEAAoE,mBAGxE,GAAI,EAAQ,MACV,KAAM,IAAI,OACR,yEAKN,OAAO,eAAe,EAAgB,UAAW,WAAY,CAC3D,MAAO,UAGT,OAAO,eAAe,EAAgB,UAAW,QAAS,CAAE,MAAO,KAEnE,OAAO,eAAe,EAAgB,UAAW,YAAa,CAC5D,MAAO,KAOT,EAAgB,UAAU,OAAS,SACjC,EACA,EAAU,CAAE,OAAQ,IAAO,CAE3B,GAAI,EAAQ,OACV,KAAM,IAAI,OAAM,yDAGlB,GAAM,GAAQ,GAAI,YAAW,GACzB,EAAM,EACJ,EAAM,EAAM,OACZ,EAAM,GAEZ,KAAO,EAAM,GAAK,CAChB,GAAM,GAAQ,EAAM,KACpB,GAAI,IAAU,EACZ,MAGF,GAAK,GAAQ,MAAU,EAErB,EAAI,KAAK,WACC,GAAQ,MAAU,IAAM,CAElC,GAAM,GAAQ,EAAM,KAAS,GAC7B,EAAI,KAAO,GAAQ,KAAS,EAAK,WACvB,GAAQ,MAAU,IAAM,CAClC,GAAM,GAAQ,EAAM,KAAS,GACvB,EAAQ,EAAM,KAAS,GAC7B,EAAI,KAAO,GAAQ,KAAS,GAAO,GAAS,EAAK,WACvC,GAAQ,MAAU,IAAM,CAClC,GAAM,GAAQ,EAAM,KAAS,GACvB,EAAQ,EAAM,KAAS,GACvB,EAAQ,EAAM,KAAS,GAGzB,EACA,GAAQ,IAAS,GAAS,GAAS,GAAS,GAAS,EAAQ,EACjE,AAAI,EAAY,OAEd,IAAa,MACb,EAAI,KAAO,IAAc,GAAM,KAAS,OACxC,EAAY,MAAU,EAAY,MAEpC,EAAI,KAAK,IAMb,MAAO,QAAO,aAAa,MAAM,KAAM,IAGzC,EAAM,YAAiB,EACvB,EAAM,YAAiB,IAEvB,MAAO,SAAW,YACd,OACA,MAAO,OAAS,YAChB,KACA,MC/MN,oBAyDA,AAAC,UAAU,EAAQ,EAAS,CACxB,MAAO,KAAY,UAAY,MAAO,KAAW,YAAc,GAAO,QAAU,IAChF,MAAO,SAAW,YAAc,OAAO,IAAM,OAAO,GACnD,EAAO,OAAS,MACnB,GAAO,UAAY,CAAE,aAyBnB,OAvBI,GAAQ,SAAU,EAAG,EAAK,EAAK,CAC/B,MAAK,KAAQ,QAAS,GAAI,GACrB,IAAQ,QAAS,GAAI,GAEnB,EAAI,EAAM,EAAM,EAAI,EAAM,EAAM,GAGvC,EAAW,SAAU,EAAK,CAC1B,EAAI,SAAW,GACf,EAAI,WAAa,EAAI,MAAM,GAC3B,OAAS,GAAE,EAAG,GAAG,EAAG,IAChB,AAAI,EAAI,EACA,IAAI,GAAK,GAAK,EAAI,GAAK,MAAO,GAAI,SAAW,IACjD,EAAI,GAAK,EAAM,EAAI,GAAI,EAAG,MACnB,IAAM,GACb,GAAI,GAAK,EAAM,EAAI,GAAI,EAAG,IAGlC,MAAO,IAIP,EAAc,GACT,EAAI,EAAG,EAAO,CAAC,UAAW,SAAU,SAAU,WAAY,QAAS,OAAQ,SAAU,YAAa,QAAS,EAAI,EAAK,OAAQ,GAAK,EAAG,CACzI,GAAI,GAAO,EAAK,GAEhB,EAAa,WAAa,EAAO,KAAQ,EAAK,cAElD,GAAI,GAAO,SAAS,EAAK,CACrB,MAAO,GAAY,OAAO,UAAU,SAAS,KAAK,KAAS,UAG3D,EAAS,SAAU,EAAM,EAAU,CAInC,MAHK,KAAa,QAAS,GAAS,MAGhC,EAAK,QAAU,EAAY,MAAM,UAAU,MAAM,KAAK,GAGzD,EAAK,EAAK,KAAO,UAAY,EACzB,EAAS,MAAM,IACpB,OAAO,SAAU,EAAG,CAAE,MAAO,GAAK,GAAG,KAAO,SAC5C,IAAI,SAAU,EAAG,CAAE,MAAO,GAAK,GAAG,KAI3B,EAAK,IAGZ,EAAO,SAAU,EAAM,CACvB,GAAI,EAAK,OAAS,EAAK,MAAO,MAC9B,GAAI,GAAI,EAAK,OAAO,EACpB,MAAI,GAAK,EAAK,KAAO,SAAmB,EAAK,GAAG,cACzC,MAGP,EAAK,KAAK,GAEV,EAAQ,CACX,SAAU,EACV,MAAO,EACP,KAAM,EACN,OAAQ,EACR,KAAM,EACN,GAAI,EACJ,MAAO,EAAG,EACV,QAAS,EAAG,EACZ,QAAS,EAAK,IACd,QAAS,IAAM,GAGZ,EAAQ,CACX,OAAQ,GACR,WAAY,IAGT,EAAS,EAAM,KACf,EAAa,EAAM,SACnB,EAAS,EAAM,KAGf,EAAQ,UAAiB,CAEzB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,GAAK,KACT,GAAI,EAAO,EAAK,MAAQ,UACpB,EAAK,GAAG,aACR,EAAK,GAAG,cAAgB,KAAK,YAE7B,MAAO,GAAK,GAIhB,GAAI,GAAO,EAAO,GACd,EAAa,GAEjB,GAAI,CAAC,EAAM,CACP,EAAa,GACR,EAAM,QACP,GAAM,WAAa,EAAM,WAAW,KAAK,SAAU,EAAE,EAAG,CAAE,MAAO,GAAE,EAAI,EAAE,IACzE,EAAM,OAAS,IAGnB,OAAS,GAAI,EAAG,EAAO,EAAM,WAAY,EAAI,EAAK,OAAQ,GAAK,EAAG,CAC9D,GAAI,GAAM,EAAK,GAGf,GADA,EAAO,EAAI,KAAK,MAAM,EAAK,GACvB,EAAQ,OAIpB,GAAI,EAAM,OAAO,GAAO,CACpB,GAAI,GAAM,EAAM,OAAO,GAAM,MAAM,KAAM,EAAa,EAAO,EAAK,MAAM,EAAE,KAC1E,EAAG,KAAO,EAAW,OAErB,MAAM,IAAI,OAAM,mBAAmB,GAIvC,AAAI,EAAG,KAAK,SAAW,GAAK,EAAG,KAAK,KAAK,IAG7C,EAAM,UAAU,SAAW,UAAqB,CAC5C,MAAI,GAAO,KAAK,MAAQ,WAAqB,KAAK,MAC1C,IAAO,KAAK,KAAK,KAAK,KAAQ,KAG1C,GAAI,GAAU,EAEV,EAAS,UAAY,CAExB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAO,MAAO,CAAE,MAAO,OAAQ,MAG3E,EAAO,MAAQ,EACf,EAAO,QAAU,QAEjB,GAAI,GAAW,EAEX,EAAW,EAAM,OACjB,EAAM,KAAK,IAEX,EAAW,UAAY,CAEvB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,GAAM,EAAS,EAAM,OACrB,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAI,EAAI,GACZ,EAAI,EAAI,IACR,EAAI,EAAI,IACR,EAAI,EAAI,IACR,GAAI,GAAI,EAAI,EAAI,EAAE,EAAI,EAAE,IACpB,EAAI,EAAI,EAAI,EAAK,GAAE,GAAK,EACxB,EAAK,GAAE,EAAE,GAAK,EACd,EAAK,GAAE,EAAE,GAAK,EACd,EAAK,GAAE,EAAE,GAAK,EAClB,MAAO,CAAC,EAAE,EAAE,EAAE,IAGd,GAAa,EAEb,EAAW,EAAM,OAEjB,GAAW,UAAY,CAEvB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,EAAO,EAAS,EAAM,QACtB,GAAI,GAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAQ,EAAK,OAAS,EAAI,EAAK,GAAK,EACxC,MAAI,KAAM,EAAY,CAAC,EAAE,EAAE,EAAE,GACtB,CACH,GAAK,EAAI,EAAI,IAAO,GAAE,GAAM,GAAE,GAC9B,GAAK,EAAI,EAAI,IAAO,GAAE,GAAM,GAAE,GAC9B,GAAK,EAAI,EAAI,IAAO,GAAE,GAAM,GAAE,GAC9B,IAIJ,GAAa,GAEb,EAAW,EAAM,OACjB,EAAS,EAAM,KAInB,EAAQ,UAAU,KAAO,UAAW,CAChC,MAAO,IAAW,KAAK,OAG3B,EAAS,KAAO,UAAY,CAExB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,EAAM,CAAC,YAGhF,EAAM,OAAO,KAAO,GAEpB,EAAM,WAAW,KAAK,CAClB,EAAG,EACH,KAAM,UAAY,CAEd,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAGzC,GADA,EAAO,EAAS,EAAM,QAClB,EAAO,KAAU,SAAW,EAAK,SAAW,EAC5C,MAAO,UAKnB,GAAI,IAAW,EAAM,OACjB,GAAS,EAAM,KACf,GAAM,SAAU,EAAG,CAAE,MAAO,MAAK,MAAM,EAAE,KAAK,KAU9C,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,GAAO,GAAS,EAAM,QACtB,EAAO,GAAO,IAAS,MAC3B,SAAK,GAAK,GAAI,EAAK,IAAM,GACzB,EAAK,GAAK,GAAI,EAAK,GAAG,KAAO,IAC7B,EAAK,GAAK,GAAI,EAAK,GAAG,KAAO,IAC7B,AAAI,IAAS,QAAW,EAAK,OAAS,GAAK,EAAK,GAAG,EAC/C,GAAK,GAAK,EAAK,OAAS,EAAI,EAAK,GAAK,EACtC,EAAO,QAEP,EAAK,OAAS,EAEV,EAAO,IAAO,EAAK,KAAK,KAAQ,KAGxC,GAAY,GAEZ,GAAW,EAAM,OAUjB,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,EAAO,GAAS,EAAM,QACtB,GAAI,GAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAI,EAAK,GAEb,GAAK,IACL,GAAK,IACL,GAAK,IAEL,GAAI,GAAM,KAAK,IAAI,EAAG,EAAG,GACrB,EAAM,KAAK,IAAI,EAAG,EAAG,GAErB,EAAK,GAAM,GAAO,EAClB,EAAG,EAeP,MAbA,AAAI,KAAQ,EACR,GAAI,EACJ,EAAI,OAAO,KAEX,EAAI,EAAI,GAAO,GAAM,GAAQ,GAAM,GAAQ,GAAM,GAAQ,GAAI,EAAM,GAGvE,AAAI,GAAK,EAAO,EAAK,GAAI,GAAM,GAAM,GAChC,AAAI,GAAK,EAAO,EAAI,EAAK,GAAI,GAAM,GAAM,GACrC,GAAK,GAAO,GAAI,EAAK,GAAI,GAAM,GAAM,IAE9C,GAAK,GACD,EAAI,GAAK,IAAK,KACd,EAAK,OAAO,GAAK,EAAK,KAAK,OAAoB,CAAC,EAAE,EAAE,EAAE,EAAK,IACxD,CAAC,EAAE,EAAE,IAGZ,GAAY,GAEZ,GAAW,EAAM,OACjB,GAAS,EAAM,KAGf,GAAQ,KAAK,MAUb,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,GAAO,GAAS,EAAM,QACtB,EAAO,GAAO,IAAS,MAC3B,MAAI,GAAK,OAAO,EAAE,IAAM,MACb,GAAU,GAAU,GAAO,GAEtC,GAAK,GAAK,GAAM,EAAK,IACrB,EAAK,GAAK,GAAM,EAAK,IACrB,EAAK,GAAK,GAAM,EAAK,IACjB,KAAS,QAAW,EAAK,OAAS,GAAK,EAAK,GAAG,IAC/C,GAAK,GAAK,EAAK,OAAS,EAAI,EAAK,GAAK,EACtC,EAAO,QAEH,EAAO,IAAO,EAAK,MAAM,EAAE,IAAO,MAAM,EAAE,GAAG,KAAK,KAAQ,MAGlE,GAAY,GAEZ,GAAW,EAAM,OACjB,GAAU,KAAK,MAEf,GAAU,UAAY,CAItB,OAHI,GAEA,EAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GACzC,EAAO,GAAS,EAAM,OACtB,GAAI,GAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAE,EAAE,EACR,GAAI,IAAM,EACN,EAAI,EAAI,EAAI,EAAE,QACX,CACH,GAAI,GAAK,CAAC,EAAE,EAAE,GACV,EAAI,CAAC,EAAE,EAAE,GACT,EAAK,EAAI,GAAM,EAAK,GAAE,GAAK,EAAE,EAAE,EAAE,EACjC,EAAK,EAAI,EAAI,EACb,EAAK,EAAI,IACb,EAAG,GAAK,EAAK,EAAE,EACf,EAAG,GAAK,EACR,EAAG,GAAK,EAAK,EAAE,EACf,OAAS,GAAE,EAAG,EAAE,EAAG,IACf,AAAI,EAAG,GAAK,GAAK,GAAG,IAAM,GACtB,EAAG,GAAK,GAAK,GAAG,IAAM,GAC1B,AAAI,EAAI,EAAG,GAAK,EACV,EAAE,GAAK,EAAM,GAAK,GAAM,EAAI,EAAG,GAChC,AAAI,EAAI,EAAG,GAAK,EACf,EAAE,GAAK,EACR,AAAI,EAAI,EAAG,GAAK,EACf,EAAE,GAAK,EAAM,GAAK,GAAQ,GAAI,EAAK,EAAG,IAAM,EAE5C,EAAE,GAAK,EAEjB,AAAC,EAAS,CAAC,GAAQ,EAAE,GAAG,KAAK,GAAQ,EAAE,GAAG,KAAK,GAAQ,EAAE,GAAG,MAAO,EAAI,EAAO,GAAI,EAAI,EAAO,GAAI,EAAI,EAAO,GAEhH,MAAI,GAAK,OAAS,EAEP,CAAC,EAAE,EAAE,EAAE,EAAK,IAEhB,CAAC,EAAE,EAAE,EAAE,IAGd,GAAY,GAEZ,GAAS,kDACT,GAAU,wEACV,GAAa,mFACb,GAAc,yGACd,GAAS,kFACT,GAAU,wGAEV,GAAU,KAAK,MAEf,GAAU,SAAU,EAAK,CACzB,EAAM,EAAI,cAAc,OACxB,GAAI,GAEJ,GAAI,EAAM,OAAO,MACb,GAAI,CACA,MAAO,GAAM,OAAO,MAAM,SACrB,EAAP,EAMN,GAAK,EAAI,EAAI,MAAM,IAAU,CAEzB,OADI,GAAM,EAAE,MAAM,EAAE,GACX,EAAE,EAAG,EAAE,EAAG,IACf,EAAI,GAAK,CAAC,EAAI,GAElB,SAAI,GAAK,EACF,EAIX,GAAK,EAAI,EAAI,MAAM,IAAW,CAE1B,OADI,GAAQ,EAAE,MAAM,EAAE,GACb,EAAI,EAAG,EAAI,EAAG,IACnB,EAAM,GAAO,CAAC,EAAM,GAExB,MAAO,GAIX,GAAK,EAAI,EAAI,MAAM,IAAc,CAE7B,OADI,GAAQ,EAAE,MAAM,EAAE,GACb,EAAI,EAAG,EAAI,EAAG,IACnB,EAAM,GAAO,GAAQ,EAAM,GAAO,MAEtC,SAAM,GAAK,EACJ,EAIX,GAAK,EAAI,EAAI,MAAM,IAAe,CAE9B,OADI,GAAQ,EAAE,MAAM,EAAE,GACb,EAAI,EAAG,EAAI,EAAG,IACnB,EAAM,GAAO,GAAQ,EAAM,GAAO,MAEtC,SAAM,GAAK,CAAC,EAAM,GACX,EAIX,GAAK,EAAI,EAAI,MAAM,IAAU,CACzB,GAAI,GAAM,EAAE,MAAM,EAAE,GACpB,EAAI,IAAM,IACV,EAAI,IAAM,IACV,GAAI,GAAQ,GAAU,GACtB,SAAM,GAAK,EACJ,EAIX,GAAK,EAAI,EAAI,MAAM,IAAW,CAC1B,GAAI,GAAQ,EAAE,MAAM,EAAE,GACtB,EAAM,IAAM,IACZ,EAAM,IAAM,IACZ,GAAI,GAAQ,GAAU,GACtB,SAAM,GAAK,CAAC,EAAE,GACP,IAIf,GAAQ,KAAO,SAAU,EAAG,CACxB,MAAO,IAAO,KAAK,IACf,GAAQ,KAAK,IACb,GAAW,KAAK,IAChB,GAAY,KAAK,IACjB,GAAO,KAAK,IACZ,GAAQ,KAAK,IAGrB,GAAI,IAAY,GAEZ,GAAS,EAAM,KAKnB,EAAQ,UAAU,IAAM,SAAS,EAAM,CACnC,MAAO,IAAU,KAAK,KAAM,IAGhC,EAAS,IAAM,UAAY,CAEvB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,EAAM,CAAC,WAGhF,EAAM,OAAO,IAAM,GAEnB,EAAM,WAAW,KAAK,CAClB,EAAG,EACH,KAAM,SAAU,EAAG,CAEf,OADI,GAAO,GAAI,EAAM,UAAU,OAAS,EAChC,KAAQ,GAAI,EAAM,GAAQ,UAAW,EAAM,GAEnD,GAAI,CAAC,EAAK,QAAU,GAAO,KAAO,UAAY,GAAU,KAAK,GACzD,MAAO,SAKnB,GAAI,IAAW,EAAM,OAErB,EAAM,OAAO,GAAK,UAAY,CAE1B,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,GAAM,GAAS,EAAM,QACzB,SAAI,IAAM,IACV,EAAI,IAAM,IACV,EAAI,IAAM,IACH,GAGX,EAAS,GAAK,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,EAAM,CAAC,UAGhF,EAAQ,UAAU,GAAK,UAAW,CAC9B,GAAI,GAAM,KAAK,KACf,MAAO,CAAC,EAAI,GAAG,IAAK,EAAI,GAAG,IAAK,EAAI,GAAG,IAAK,EAAI,KAGpD,GAAI,IAAW,EAAM,OAEjB,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,GAAM,GAAS,EAAM,OACrB,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAM,KAAK,IAAI,EAAG,EAAG,GACrB,EAAM,KAAK,IAAI,EAAG,EAAG,GACrB,EAAQ,EAAM,EACd,EAAI,EAAQ,IAAM,IAClB,EAAK,EAAO,KAAM,GAAS,IAC3B,EACJ,MAAI,KAAU,EACV,EAAI,OAAO,IAEP,KAAM,GAAO,GAAK,GAAI,GAAK,GAC3B,IAAM,GAAO,GAAI,EAAG,GAAI,GAAK,GAC7B,IAAM,GAAO,GAAI,EAAG,GAAI,GAAK,GACjC,GAAK,GACD,EAAI,GAAK,IAAK,MAEf,CAAC,EAAG,EAAG,IAGd,GAAY,GAEZ,GAAW,EAAM,OACjB,GAAQ,KAAK,MAUb,GAAU,UAAY,CAItB,OAHI,GAAQ,EAAU,EAAU,EAAU,EAAU,EAEhD,EAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GACzC,EAAO,GAAS,EAAM,OACtB,GAAI,GAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAK,EAAK,GACV,EAAE,EAAE,EACR,EAAK,EAAK,IACV,GAAI,GAAK,EAAI,IACb,GAAI,IAAM,EACN,EAAI,EAAI,EAAI,MACT,CACH,AAAI,IAAM,KAAO,GAAI,GACjB,EAAI,KAAO,IAAK,KAChB,EAAI,GAAK,IAAK,KAClB,GAAK,GACL,GAAI,GAAI,GAAM,GACV,EAAI,EAAI,EACR,GAAI,EAAM,GAAI,GACd,GAAI,GAAI,EAAM,GAAI,GAClB,GAAI,GAAI,EAAK,EACb,GAAI,GAAI,EACZ,OAAQ,OACC,GAAG,AAAC,EAAS,CAAC,GAAG,GAAG,IAAI,EAAI,EAAO,GAAI,EAAI,EAAO,GAAI,EAAI,EAAO,GAAK,UACtE,GAAG,AAAC,EAAW,CAAC,GAAG,GAAG,IAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAK,UAC9E,GAAG,AAAC,EAAW,CAAC,GAAG,GAAG,IAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAK,UAC9E,GAAG,AAAC,EAAW,CAAC,GAAG,GAAG,IAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAK,UAC9E,GAAG,AAAC,EAAW,CAAC,GAAG,GAAG,IAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAK,UAC9E,GAAG,AAAC,EAAW,CAAC,GAAG,GAAG,IAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAK,OAG3F,MAAO,CAAC,EAAG,EAAG,EAAG,EAAK,OAAS,EAAI,EAAK,GAAK,IAG7C,GAAY,GAEZ,GAAW,EAAM,OACjB,GAAS,EAAM,KAOnB,EAAQ,UAAU,IAAM,UAAW,CAC/B,MAAO,IAAU,KAAK,OAG1B,EAAS,IAAM,UAAY,CAEvB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,EAAM,CAAC,WAGhF,EAAM,OAAO,IAAM,GAEnB,EAAM,WAAW,KAAK,CAClB,EAAG,EACH,KAAM,UAAY,CAEd,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAGzC,GADA,EAAO,GAAS,EAAM,OAClB,GAAO,KAAU,SAAW,EAAK,SAAW,EAC5C,MAAO,SAKnB,GAAI,IAAW,EAAM,OACjB,GAAS,EAAM,KACf,GAAU,KAAK,MAEf,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,GAAM,GAAS,EAAM,QACrB,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAO,GAAO,IAAS,OAC3B,AAAI,IAAM,QAAa,GAAI,GACvB,IAAS,QACT,GAAO,EAAI,EAAI,OAAS,OAE5B,EAAI,GAAQ,GACZ,EAAI,GAAQ,GACZ,EAAI,GAAQ,GACZ,GAAI,GAAI,GAAK,GAAK,GAAK,EAAI,EACvB,EAAM,SAAW,EAAE,SAAS,IAChC,EAAM,EAAI,OAAO,EAAI,OAAS,GAC9B,GAAI,GAAM,IAAM,GAAQ,EAAI,KAAK,SAAS,IAE1C,OADA,EAAM,EAAI,OAAO,EAAI,OAAS,GACtB,EAAK,mBACJ,OAAQ,MAAQ,IAAM,EAAM,MAC5B,OAAQ,MAAQ,IAAM,EAAM,UACxB,MAAQ,IAAM,IAI3B,GAAY,GAEZ,GAAS,sCACT,GAAU,sCAEV,GAAU,SAAU,EAAK,CACzB,GAAI,EAAI,MAAM,IAAS,CAEnB,AAAI,GAAI,SAAW,GAAK,EAAI,SAAW,IACnC,GAAM,EAAI,OAAO,IAGjB,EAAI,SAAW,GACf,GAAM,EAAI,MAAM,IAChB,EAAM,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,EAAI,IAEjD,GAAI,GAAI,SAAS,EAAK,IAClB,EAAI,GAAK,GACT,EAAI,GAAK,EAAI,IACb,EAAI,EAAI,IACZ,MAAO,CAAC,EAAE,EAAE,EAAE,GAIlB,GAAI,EAAI,MAAM,IAAU,CACpB,AAAI,GAAI,SAAW,GAAK,EAAI,SAAW,IAEnC,GAAM,EAAI,OAAO,IAGjB,EAAI,SAAW,GACf,GAAM,EAAI,MAAM,IAChB,EAAM,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,EAAI,IAE/D,GAAI,GAAM,SAAS,EAAK,IACpB,EAAM,GAAO,GAAK,IAClB,EAAM,GAAO,GAAK,IAClB,EAAM,GAAO,EAAI,IACjB,EAAI,KAAK,MAAO,GAAM,KAAQ,IAAO,KAAO,IAChD,MAAO,CAAC,EAAI,EAAI,EAAI,GAOxB,KAAM,IAAI,OAAO,sBAAwB,IAGzC,GAAY,GAEZ,GAAS,EAAM,KAKnB,EAAQ,UAAU,IAAM,SAAS,EAAM,CACnC,MAAO,IAAU,KAAK,KAAM,IAGhC,EAAS,IAAM,UAAY,CAEvB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,EAAM,CAAC,WAGhF,EAAM,OAAO,IAAM,GACnB,EAAM,WAAW,KAAK,CAClB,EAAG,EACH,KAAM,SAAU,EAAG,CAEf,OADI,GAAO,GAAI,EAAM,UAAU,OAAS,EAChC,KAAQ,GAAI,EAAM,GAAQ,UAAW,EAAM,GAEnD,GAAI,CAAC,EAAK,QAAU,GAAO,KAAO,UAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,QAAQ,EAAE,SAAW,EAC/E,MAAO,SAKnB,GAAI,IAAW,EAAM,OACjB,GAAQ,EAAM,MACd,GAAM,KAAK,IACX,GAAO,KAAK,KACZ,GAAO,KAAK,KAEZ,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAMzC,GAAI,GAAM,GAAS,EAAM,OACrB,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAI,EAAI,GACZ,GAAK,IACL,GAAK,IACL,GAAK,IACL,GAAI,GACA,EAAO,GAAI,EAAE,EAAE,GACf,EAAK,GAAE,EAAE,GAAK,EACd,EAAI,EAAI,EAAI,EAAI,EAAK,EAAI,EAC7B,MAAI,KAAM,EACN,EAAI,IAEJ,GAAM,GAAE,EAAI,GAAE,IAAM,EACpB,GAAK,GAAM,GAAE,GAAI,GAAE,GAAM,GAAE,GAAI,GAAE,IACjC,EAAI,GAAK,GACL,EAAI,GACJ,GAAI,GAAQ,GAEhB,GAAK,IAEF,CAAC,EAAE,IAAI,EAAE,IAGhB,GAAY,GAEZ,GAAW,EAAM,OACjB,GAAU,EAAM,MAChB,GAAU,EAAM,MAChB,GAAU,EAAM,QAChB,GAAM,KAAK,IAOX,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAMzC,EAAO,GAAS,EAAM,OACtB,GAAI,GAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAE,EAAE,EAER,MAAI,OAAM,IAAM,GAAI,GAChB,MAAM,IAAM,GAAI,GAEhB,EAAI,KAAO,IAAK,KAChB,EAAI,GAAK,IAAK,KAClB,GAAK,IACL,AAAI,EAAI,EAAE,EACN,GAAK,GAAE,GAAG,EACV,EAAK,GAAE,EAAE,GAAI,GAAQ,GAAG,GAAI,GAAQ,GAAQ,IAAI,EAChD,EAAI,EAAK,GAAE,IACR,AAAI,EAAI,EAAE,EACb,IAAK,EAAE,EACP,EAAK,GAAE,GAAG,EACV,EAAK,GAAE,EAAE,GAAI,GAAQ,GAAG,GAAI,GAAQ,GAAQ,IAAI,EAChD,EAAI,EAAK,GAAE,IAEX,IAAK,EAAE,EACP,EAAK,GAAE,GAAG,EACV,EAAK,GAAE,EAAE,GAAI,GAAQ,GAAG,GAAI,GAAQ,GAAQ,IAAI,EAChD,EAAI,EAAK,GAAE,IAEf,EAAI,GAAQ,EAAE,EAAE,GAChB,EAAI,GAAQ,EAAE,EAAE,GAChB,EAAI,GAAQ,EAAE,EAAE,GACT,CAAC,EAAE,IAAK,EAAE,IAAK,EAAE,IAAK,EAAK,OAAS,EAAI,EAAK,GAAK,IAGzD,GAAY,GAEZ,GAAW,EAAM,OACjB,GAAS,EAAM,KAOnB,EAAQ,UAAU,IAAM,UAAW,CAC/B,MAAO,IAAU,KAAK,OAG1B,EAAS,IAAM,UAAY,CAEvB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,EAAM,CAAC,WAGhF,EAAM,OAAO,IAAM,GAEnB,EAAM,WAAW,KAAK,CAClB,EAAG,EACH,KAAM,UAAY,CAEd,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAGzC,GADA,EAAO,GAAS,EAAM,OAClB,GAAO,KAAU,SAAW,EAAK,SAAW,EAC5C,MAAO,SAKnB,GAAI,IAAW,EAAM,OACjB,GAAS,EAAM,KAOnB,EAAQ,UAAU,IAAM,UAAW,CAC/B,MAAO,IAAU,KAAK,OAG1B,EAAS,IAAM,UAAY,CAEvB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,EAAM,CAAC,WAGhF,EAAM,OAAO,IAAM,GAEnB,EAAM,WAAW,KAAK,CAClB,EAAG,EACH,KAAM,UAAY,CAEd,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAGzC,GADA,EAAO,GAAS,EAAM,OAClB,GAAO,KAAU,SAAW,EAAK,SAAW,EAC5C,MAAO,SAKnB,GAAI,IAAW,EAAM,OACjB,GAAQ,KAAK,IACb,GAAQ,KAAK,IAQb,GAAY,UAAY,CAExB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,EAAO,GAAS,EAAM,OACtB,GAAI,GAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAO,GAAM,EAAG,EAAG,GACnB,EAAO,GAAM,EAAG,EAAG,GACnB,EAAQ,EAAO,EACf,EAAE,EAAE,EACR,SAAI,EAAO,IACX,AAAI,IAAS,EACT,GAAI,OAAO,IACX,EAAI,GAEJ,GAAI,EAAQ,EACR,IAAM,GAAQ,GAAK,GAAI,GAAK,GAC5B,IAAM,GAAQ,GAAI,EAAG,GAAI,GAAK,GAC9B,IAAM,GAAQ,GAAI,EAAG,GAAI,GAAK,GAClC,GAAK,GACD,EAAI,GAAK,IAAK,MAEf,CAAC,EAAG,EAAG,IAGd,GAAU,GAEV,GAAW,EAAM,OACjB,GAAU,KAAK,MAEf,GAAU,UAAY,CAItB,OAHI,GAAQ,EAAU,EAAU,EAAU,EAAU,EAEhD,EAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GACzC,EAAO,GAAS,EAAM,OACtB,GAAI,GAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAE,EAAE,EAER,GADA,GAAK,IACD,IAAM,EACN,EAAI,EAAI,EAAI,MACT,CACH,AAAI,IAAM,KAAO,GAAI,GACjB,EAAI,KAAO,IAAK,KAChB,EAAI,GAAK,IAAK,KAClB,GAAK,GAEL,GAAI,GAAI,GAAQ,GACZ,EAAI,EAAI,EACR,EAAI,EAAK,GAAI,GACb,GAAI,EAAK,GAAI,EAAI,GACjB,GAAI,EAAK,GAAI,EAAK,GAAI,IAE1B,OAAQ,OACC,GAAG,AAAC,EAAS,CAAC,EAAG,GAAG,GAAI,EAAI,EAAO,GAAI,EAAI,EAAO,GAAI,EAAI,EAAO,GAAK,UACtE,GAAG,AAAC,EAAW,CAAC,GAAG,EAAG,GAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAK,UAC9E,GAAG,AAAC,EAAW,CAAC,EAAG,EAAG,IAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAK,UAC9E,GAAG,AAAC,EAAW,CAAC,EAAG,GAAG,GAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAK,UAC9E,GAAG,AAAC,EAAW,CAAC,GAAG,EAAG,GAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAK,UAC9E,GAAG,AAAC,EAAW,CAAC,EAAG,EAAG,IAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAI,EAAI,EAAS,GAAK,OAG3F,MAAO,CAAC,EAAE,EAAE,EAAE,EAAK,OAAS,EAAE,EAAK,GAAG,IAGtC,GAAY,GAEZ,GAAW,EAAM,OACjB,GAAS,EAAM,KAOnB,EAAQ,UAAU,IAAM,UAAW,CAC/B,MAAO,IAAQ,KAAK,OAGxB,EAAS,IAAM,UAAY,CAEvB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,EAAM,CAAC,WAGhF,EAAM,OAAO,IAAM,GAEnB,EAAM,WAAW,KAAK,CAClB,EAAG,EACH,KAAM,UAAY,CAEd,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAGzC,GADA,EAAO,GAAS,EAAM,OAClB,GAAO,KAAU,SAAW,EAAK,SAAW,EAC5C,MAAO,SAKnB,GAAI,IAAe,CAEf,GAAI,GAGJ,GAAI,OACJ,GAAI,EACJ,GAAI,QAEJ,GAAI,WACJ,GAAI,WACJ,GAAI,UACJ,GAAI,YAGJ,GAAW,EAAM,OACjB,GAAM,KAAK,IAEX,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,GAAM,GAAS,EAAM,OACrB,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAQ,GAAQ,EAAE,EAAE,GACpB,EAAI,EAAM,GACV,EAAI,EAAM,GACV,EAAI,EAAM,GACV,EAAI,IAAM,EAAI,GAClB,MAAO,CAAC,EAAI,EAAI,EAAI,EAAG,IAAO,GAAI,GAAI,IAAO,GAAI,KAGjD,GAAU,SAAU,EAAG,CACvB,MAAK,IAAK,MAAQ,OAAkB,EAAI,MACjC,GAAK,GAAI,MAAS,MAAO,MAGhC,GAAU,SAAU,EAAG,CACvB,MAAI,GAAI,GAAa,GAAa,GAAI,EAAG,EAAI,GACtC,EAAI,GAAa,GAAK,GAAa,IAG1C,GAAU,SAAU,EAAE,EAAE,EAAG,CAC3B,EAAI,GAAQ,GACZ,EAAI,GAAQ,GACZ,EAAI,GAAQ,GACZ,GAAI,GAAI,GAAS,UAAY,EAAI,SAAY,EAAI,SAAY,GAAK,GAAa,IAC3E,EAAI,GAAS,UAAY,EAAI,SAAY,EAAI,QAAY,GAAK,GAAa,IAC3E,EAAI,GAAS,UAAY,EAAI,QAAY,EAAI,SAAY,GAAK,GAAa,IAC/E,MAAO,CAAC,EAAE,EAAE,IAGZ,GAAY,GAEZ,GAAW,EAAM,OACjB,GAAQ,KAAK,IAOb,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,EAAO,GAAS,EAAM,OACtB,GAAI,GAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAE,EAAE,EAAG,EAAE,EAAE,EAEf,SAAK,GAAI,IAAM,IACf,EAAI,MAAM,GAAK,EAAI,EAAI,EAAI,IAC3B,EAAI,MAAM,GAAK,EAAI,EAAI,EAAI,IAE3B,EAAI,GAAa,GAAK,GAAQ,GAC9B,EAAI,GAAa,GAAK,GAAQ,GAC9B,EAAI,GAAa,GAAK,GAAQ,GAE9B,EAAI,GAAQ,UAAY,EAAI,UAAY,EAAI,SAAY,GACxD,EAAI,GAAQ,SAAa,EAAI,UAAY,EAAI,QAAY,GACzD,EAAK,GAAQ,SAAY,EAAI,SAAY,EAAI,UAAY,GAElD,CAAC,EAAE,EAAE,EAAG,EAAK,OAAS,EAAI,EAAK,GAAK,IAG3C,GAAU,SAAU,EAAG,CACvB,MAAO,KAAO,IAAK,OAAU,MAAQ,EAAI,MAAQ,GAAM,EAAG,EAAI,KAAO,OAGrE,GAAU,SAAU,EAAG,CACvB,MAAO,GAAI,GAAa,GAAK,EAAI,EAAI,EAAI,GAAa,GAAM,GAAI,GAAa,KAG7E,GAAY,GAEZ,GAAW,EAAM,OACjB,GAAS,EAAM,KAOnB,EAAQ,UAAU,IAAM,UAAW,CAC/B,MAAO,IAAU,KAAK,OAG1B,EAAS,IAAM,UAAY,CAEvB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,EAAM,CAAC,WAGhF,EAAM,OAAO,IAAM,GAEnB,EAAM,WAAW,KAAK,CAClB,EAAG,EACH,KAAM,UAAY,CAEd,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAGzC,GADA,EAAO,GAAS,EAAM,OAClB,GAAO,KAAU,SAAW,EAAK,SAAW,EAC5C,MAAO,SAKnB,GAAI,IAAW,EAAM,OACjB,GAAU,EAAM,QAChB,GAAS,KAAK,KACd,GAAQ,KAAK,MACb,GAAU,KAAK,MAEf,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,GAAM,GAAS,EAAM,OACrB,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAI,GAAO,EAAI,EAAI,EAAI,GACvB,EAAK,IAAM,EAAG,GAAK,GAAU,KAAO,IACxC,MAAI,IAAQ,EAAE,OAAW,GAAK,GAAI,OAAO,KAClC,CAAC,EAAG,EAAG,IAGd,GAAY,GAEZ,GAAW,EAAM,OAIjB,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,GAAM,GAAS,EAAM,OACrB,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAQ,GAAU,EAAE,EAAE,GACtB,EAAI,EAAM,GACV,EAAI,EAAM,GACV,EAAK,EAAM,GACf,MAAO,IAAU,EAAE,EAAE,IAGrB,GAAY,GAEZ,GAAW,EAAM,OACjB,GAAU,EAAM,QAChB,GAAM,KAAK,IACX,GAAQ,KAAK,IAEb,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GASzC,GAAI,GAAM,GAAS,EAAM,OACrB,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAI,EAAI,GACZ,MAAI,OAAM,IAAM,GAAI,GACpB,EAAI,EAAI,GACD,CAAC,EAAG,GAAM,GAAK,EAAG,GAAI,GAAK,IAGlC,GAAY,GAEZ,GAAW,EAAM,OAIjB,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,EAAO,GAAS,EAAM,OACtB,GAAI,GAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAM,GAAW,EAAE,EAAE,GACrB,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAK,EAAI,GACT,EAAQ,GAAW,EAAE,EAAE,GACvB,EAAI,EAAM,GACV,EAAI,EAAM,GACV,EAAI,EAAM,GACd,MAAO,CAAC,EAAG,EAAG,EAAG,EAAK,OAAS,EAAI,EAAK,GAAK,IAG7C,GAAY,GAEZ,GAAW,EAAM,OAGjB,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,GAAM,GAAS,EAAM,OAAO,UAChC,MAAO,IAAU,MAAM,OAAQ,IAG/B,GAAY,GAEZ,GAAW,EAAM,OACjB,GAAS,EAAM,KAOnB,EAAQ,UAAU,IAAM,UAAW,CAAE,MAAO,IAAU,KAAK,OAC3D,EAAQ,UAAU,IAAM,UAAW,CAAE,MAAO,IAAU,KAAK,MAAM,WAEjE,EAAS,IAAM,UAAY,CAEvB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,EAAM,CAAC,WAEhF,EAAS,IAAM,UAAY,CAEvB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,EAAM,CAAC,WAGhF,EAAM,OAAO,IAAM,GACnB,EAAM,OAAO,IAAM,GAEnB,CAAC,MAAM,OAAO,QAAQ,SAAU,EAAG,CAAE,MAAO,GAAM,WAAW,KAAK,CAC9D,EAAG,EACH,KAAM,UAAY,CAEd,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAGzC,GADA,EAAO,GAAS,EAAM,GAClB,GAAO,KAAU,SAAW,EAAK,SAAW,EAC5C,MAAO,QAWnB,GAAI,IAAS,CACT,UAAW,UACX,aAAc,UACd,KAAM,UACN,WAAY,UACZ,MAAO,UACP,MAAO,UACP,OAAQ,UACR,MAAO,UACP,eAAgB,UAChB,KAAM,UACN,WAAY,UACZ,MAAO,UACP,UAAW,UACX,UAAW,UACX,WAAY,UACZ,UAAW,UACX,MAAO,UACP,WAAY,UACZ,eAAgB,UAChB,SAAU,UACV,QAAS,UACT,KAAM,UACN,SAAU,UACV,SAAU,UACV,cAAe,UACf,SAAU,UACV,UAAW,UACX,SAAU,UACV,UAAW,UACX,YAAa,UACb,eAAgB,UAChB,WAAY,UACZ,WAAY,UACZ,QAAS,UACT,WAAY,UACZ,aAAc,UACd,cAAe,UACf,cAAe,UACf,cAAe,UACf,cAAe,UACf,WAAY,UACZ,SAAU,UACV,YAAa,UACb,QAAS,UACT,QAAS,UACT,WAAY,UACZ,UAAW,UACX,YAAa,UACb,YAAa,UACb,QAAS,UACT,UAAW,UACX,WAAY,UACZ,KAAM,UACN,UAAW,UACX,KAAM,UACN,MAAO,UACP,YAAa,UACb,KAAM,UACN,SAAU,UACV,QAAS,UACT,UAAW,UACX,OAAQ,UACR,MAAO,UACP,MAAO,UACP,WAAY,UACZ,SAAU,UACV,cAAe,UACf,UAAW,UACX,aAAc,UACd,UAAW,UACX,WAAY,UACZ,UAAW,UACX,eAAgB,UAChB,qBAAsB,UACtB,UAAW,UACX,WAAY,UACZ,UAAW,UACX,UAAW,UACX,YAAa,UACb,cAAe,UACf,aAAc,UACd,eAAgB,UAChB,eAAgB,UAChB,eAAgB,UAChB,YAAa,UACb,KAAM,UACN,UAAW,UACX,MAAO,UACP,QAAS,UACT,OAAQ,UACR,QAAS,UACT,QAAS,UACT,iBAAkB,UAClB,WAAY,UACZ,aAAc,UACd,aAAc,UACd,eAAgB,UAChB,gBAAiB,UACjB,kBAAmB,UACnB,gBAAiB,UACjB,gBAAiB,UACjB,aAAc,UACd,UAAW,UACX,UAAW,UACX,SAAU,UACV,YAAa,UACb,KAAM,UACN,QAAS,UACT,MAAO,UACP,UAAW,UACX,OAAQ,UACR,UAAW,UACX,OAAQ,UACR,cAAe,UACf,UAAW,UACX,cAAe,UACf,cAAe,UACf,WAAY,UACZ,UAAW,UACX,KAAM,UACN,KAAM,UACN,KAAM,UACN,WAAY,UACZ,OAAQ,UACR,QAAS,UACT,QAAS,UACT,cAAe,UACf,IAAK,UACL,UAAW,UACX,UAAW,UACX,YAAa,UACb,OAAQ,UACR,WAAY,UACZ,SAAU,UACV,SAAU,UACV,OAAQ,UACR,OAAQ,UACR,QAAS,UACT,UAAW,UACX,UAAW,UACX,UAAW,UACX,KAAM,UACN,YAAa,UACb,UAAW,UACX,IAAK,UACL,KAAM,UACN,QAAS,UACT,OAAQ,UACR,UAAW,UACX,OAAQ,UACR,MAAO,UACP,MAAO,UACP,WAAY,UACZ,OAAQ,UACR,YAAa,WAGb,GAAW,GAEX,GAAS,EAAM,KAMnB,EAAQ,UAAU,KAAO,UAAW,CAEhC,OADI,GAAM,GAAU,KAAK,KAAM,OACtB,EAAI,EAAG,EAAO,OAAO,KAAK,IAAW,EAAI,EAAK,OAAQ,GAAK,EAAG,CACnE,GAAI,GAAI,EAAK,GAEb,GAAI,GAAS,KAAO,EAAO,MAAO,GAAE,cAExC,MAAO,IAGX,EAAM,OAAO,MAAQ,SAAU,EAAM,CAEjC,GADA,EAAO,EAAK,cACR,GAAS,GAAS,MAAO,IAAU,GAAS,IAChD,KAAM,IAAI,OAAM,uBAAuB,IAG3C,EAAM,WAAW,KAAK,CAClB,EAAG,EACH,KAAM,SAAU,EAAG,CAEf,OADI,GAAO,GAAI,EAAM,UAAU,OAAS,EAChC,KAAQ,GAAI,EAAM,GAAQ,UAAW,EAAM,GAEnD,GAAI,CAAC,EAAK,QAAU,GAAO,KAAO,UAAY,GAAS,EAAE,eACrD,MAAO,WAKnB,GAAI,IAAW,EAAM,OAEjB,GAAU,UAAY,CAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,GAAM,GAAS,EAAM,OACrB,EAAI,EAAI,GACR,EAAI,EAAI,GACR,EAAI,EAAI,GACZ,MAAQ,IAAK,IAAO,IAAK,GAAK,GAG9B,GAAY,GAEZ,GAAS,EAAM,KAEf,GAAU,SAAU,EAAK,CACzB,GAAI,GAAO,IAAQ,UAAY,GAAO,GAAK,GAAO,SAAU,CACxD,GAAI,GAAI,GAAO,GACX,EAAK,GAAO,EAAK,IACjB,EAAI,EAAM,IACd,MAAO,CAAC,EAAE,EAAE,EAAE,GAElB,KAAM,IAAI,OAAM,sBAAsB,IAGtC,GAAY,GAEZ,GAAS,EAAM,KAInB,EAAQ,UAAU,IAAM,UAAW,CAC/B,MAAO,IAAU,KAAK,OAG1B,EAAS,IAAM,UAAY,CAEvB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,EAAM,CAAC,WAGhF,EAAM,OAAO,IAAM,GAEnB,EAAM,WAAW,KAAK,CAClB,EAAG,EACH,KAAM,UAAY,CAEd,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,EAAK,SAAW,GAAK,GAAO,EAAK,MAAQ,UAAY,EAAK,IAAM,GAAK,EAAK,IAAM,SAChF,MAAO,SAKnB,GAAI,IAAW,EAAM,OACjB,GAAS,EAAM,KACf,GAAU,KAAK,MAEnB,EAAQ,UAAU,IAAM,SAAS,EAAK,CAGlC,MAFK,KAAQ,QAAS,GAAI,IAEtB,IAAQ,GAAgB,KAAK,KAAK,MAAM,EAAE,GACvC,KAAK,KAAK,MAAM,EAAE,GAAG,IAAI,KAGpC,EAAQ,UAAU,KAAO,SAAS,EAAK,CACnC,MAAK,KAAQ,QAAS,GAAI,IAEnB,KAAK,KAAK,MAAM,EAAE,GAAG,IAAI,SAAU,EAAE,EAAG,CAC3C,MAAO,GAAE,EAAK,IAAQ,GAAQ,EAAI,GAAQ,GAAM,KAIxD,EAAS,IAAM,UAAY,CAEvB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,EAAM,CAAC,WAGhF,EAAM,OAAO,IAAM,UAAY,CAE3B,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,GAAO,GAAS,EAAM,QAC1B,MAAI,GAAK,KAAO,QAAa,GAAK,GAAK,GAChC,GAGX,EAAM,WAAW,KAAK,CAClB,EAAG,EACH,KAAM,UAAY,CAEd,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAGzC,GADA,EAAO,GAAS,EAAM,QAClB,GAAO,KAAU,SAAY,GAAK,SAAW,GAC7C,EAAK,SAAW,GAAK,GAAO,EAAK,KAAO,UAAY,EAAK,IAAM,GAAK,EAAK,IAAM,GAC/E,MAAO,SAUnB,GAAI,IAAM,KAAK,IAEX,GAAkB,SAAU,EAAQ,CACpC,GAAI,GAAO,EAAS,IAChB,EAAE,EAAE,EACR,MAAI,GAAO,GACP,GAAI,IACJ,EAAI,oBAAsB,mBAAuB,GAAI,EAAK,GAAK,mBAAqB,GAAI,GACxF,EAAI,EAAO,GAAK,EAAI,oBAAsB,kBAAsB,GAAI,EAAK,IAAM,mBAAqB,GAAI,IAExG,GAAI,mBAAqB,iBAAqB,GAAI,EAAK,IAAM,kBAAoB,GAAI,GACrF,EAAI,kBAAoB,mBAAuB,GAAI,EAAK,IAAM,iBAAmB,GAAI,GACrF,EAAI,KAED,CAAC,EAAE,EAAE,EAAE,IAGd,GAAoB,GAQpB,GAAW,EAAM,OACjB,GAAU,KAAK,MAEf,GAAkB,UAAY,CAE9B,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAQzC,OANI,GAAM,GAAS,EAAM,OACrB,EAAI,EAAI,GAAI,EAAI,EAAI,GACpB,EAAU,IACV,EAAU,IACV,EAAM,GACN,EACG,EAAU,EAAU,GAAK,CAC5B,EAAQ,GAAU,GAAW,GAC7B,GAAI,GAAQ,GAAkB,GAC9B,AAAK,EAAM,GAAK,EAAM,IAAQ,EAAI,EAC9B,EAAU,EAEV,EAAU,EAGlB,MAAO,IAAQ,IAGf,GAAoB,GAExB,EAAQ,UAAU,KAClB,EAAQ,UAAU,OAClB,EAAQ,UAAU,YAAc,UAAW,CACvC,MAAO,IAAkB,KAAK,OAGlC,EAAS,KACT,EAAS,OACT,EAAS,YAAc,UAAY,CAE/B,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,MAAO,IAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,EAAM,CAAC,YAGhF,EAAM,OAAO,KACb,EAAM,OAAO,OACb,EAAM,OAAO,YAAc,GAE3B,GAAI,IAAS,EAAM,KAEnB,EAAQ,UAAU,MAAQ,SAAS,EAAG,EAAQ,CAG1C,MAFK,KAAW,QAAS,GAAO,IAE5B,IAAM,QAAa,GAAO,KAAO,SAC7B,EACA,MAAK,KAAK,GAAK,EACR,MAEJ,GAAI,GAAQ,CAAC,KAAK,KAAK,GAAI,KAAK,KAAK,GAAI,KAAK,KAAK,GAAI,GAAI,OAE/D,KAAK,KAAK,IAGrB,EAAQ,UAAU,QAAU,UAAW,CACnC,MAAO,MAAK,KAAK,UAAY,IAGjC,EAAQ,UAAU,OAAS,SAAS,EAAQ,CAC3C,AAAK,IAAW,QAAS,GAAO,GAEhC,GAAI,GAAK,KACL,EAAM,EAAG,MACb,SAAI,IAAM,GAAa,GAAK,EACrB,GAAI,GAAQ,EAAK,OAAO,MAAM,EAAG,QAAS,KAGlD,EAAQ,UAAU,SAAW,SAAS,EAAQ,CAC7C,MAAK,KAAW,QAAS,GAAO,GAEzB,KAAK,OAAO,CAAC,IAGrB,EAAQ,UAAU,OAAS,EAAQ,UAAU,OAC7C,EAAQ,UAAU,SAAW,EAAQ,UAAU,SAE/C,EAAQ,UAAU,IAAM,SAAS,EAAI,CACjC,GAAI,GAAM,EAAG,MAAM,KACf,EAAO,EAAI,GACX,EAAU,EAAI,GACd,EAAM,KAAK,KACf,GAAI,EAAS,CACT,GAAI,GAAI,EAAK,QAAQ,GACrB,GAAI,EAAI,GAAM,MAAO,GAAI,GACzB,KAAM,IAAI,OAAO,mBAAqB,EAAU,YAAc,OAE9D,OAAO,IAIf,GAAI,IAAS,EAAM,KACf,GAAQ,KAAK,IAEb,GAAM,KACN,GAAW,GAEf,EAAQ,UAAU,UAAY,SAAS,EAAK,CACxC,GAAI,IAAQ,QAAa,GAAO,KAAS,SAAU,CAC/C,GAAI,IAAQ,EAER,MAAO,IAAI,GAAQ,CAAC,EAAE,EAAE,EAAE,KAAK,KAAK,IAAK,OAE7C,GAAI,IAAQ,EAER,MAAO,IAAI,GAAQ,CAAC,IAAI,IAAI,IAAI,KAAK,KAAK,IAAK,OAGnD,GAAI,GAAU,KAAK,YACf,EAAO,MACP,EAAW,GAEX,EAAO,SAAU,EAAK,EAAM,CAC5B,GAAI,GAAM,EAAI,YAAY,EAAM,GAAK,GACjC,EAAK,EAAI,YACb,MAAI,MAAK,IAAI,EAAM,GAAM,IAAO,CAAC,IAEtB,EAEJ,EAAK,EAAM,EAAK,EAAK,GAAO,EAAK,EAAK,IAG7C,EAAO,GAAU,EAAM,EAAK,GAAI,GAAQ,CAAC,EAAE,EAAE,IAAK,MAAQ,EAAK,KAAM,GAAI,GAAQ,CAAC,IAAI,IAAI,QAAQ,MACtG,MAAO,IAAI,GAAQ,EAAI,OAAQ,CAAC,KAAK,KAAK,MAE9C,MAAO,IAAc,MAAM,OAAS,KAAK,KAAM,MAAM,EAAE,KAI3D,GAAI,IAAgB,SAAU,EAAE,EAAE,EAAG,CAGjC,SAAI,GAAY,GAChB,EAAI,GAAY,GAChB,EAAI,GAAY,GACT,MAAS,EAAI,MAAS,EAAI,MAAS,GAG1C,GAAc,SAAU,EAAG,CAC3B,UAAK,IACE,GAAK,OAAU,EAAE,MAAQ,GAAO,GAAE,MAAO,MAAO,MAGvD,GAAe,GAEf,GAAS,EAAM,KAGf,GAAM,SAAU,EAAM,EAAM,EAAG,CAC/B,AAAK,IAAM,QAAS,GAAE,IAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OAAS,EAChC,KAAQ,GAAI,EAAM,GAAQ,UAAW,EAAM,GAEnD,GAAI,GAAO,EAAK,IAAM,OAKtB,GAJI,CAAC,GAAa,IAAS,CAAC,EAAK,QAE7B,GAAO,OAAO,KAAK,IAAc,IAEjC,CAAC,GAAa,GACd,KAAM,IAAI,OAAO,sBAAwB,EAAO,mBAEpD,MAAI,IAAO,KAAU,UAAY,GAAO,GAAI,GAAQ,IAChD,GAAO,KAAU,UAAY,GAAO,GAAI,GAAQ,IAC7C,GAAa,GAAM,EAAM,EAAM,GACjC,MAAM,EAAK,QAAU,EAAK,GAAK,QAAU,EAAK,WAGvD,EAAQ,UAAU,IAClB,EAAQ,UAAU,YAAc,SAAS,EAAM,EAAG,CACjD,AAAK,IAAM,QAAS,GAAE,IAEtB,OADI,GAAO,GAAI,EAAM,UAAU,OAAS,EAChC,KAAQ,GAAI,EAAM,GAAQ,UAAW,EAAM,GAEnD,MAAO,IAAI,MAAM,OAAQ,CAAE,KAAM,EAAM,GAAI,OAAQ,KAGpD,EAAQ,UAAU,YAAc,SAAS,EAAQ,CAChD,AAAK,IAAW,QAAS,GAAO,IAEhC,GAAI,GAAM,KAAK,KACX,EAAI,EAAI,GACZ,MAAI,GACH,MAAK,KAAO,CAAC,EAAI,GAAG,EAAG,EAAI,GAAG,EAAG,EAAI,GAAG,EAAG,GACpC,MAEA,GAAI,GAAQ,CAAC,EAAI,GAAG,EAAG,EAAI,GAAG,EAAG,EAAI,GAAG,EAAG,GAAI,QAIxD,EAAQ,UAAU,SAAW,SAAS,EAAQ,CAC7C,AAAK,IAAW,QAAS,GAAO,GAEhC,GAAI,GAAK,KACL,EAAM,EAAG,MACb,SAAI,IAAM,GAAa,GAAK,EACxB,EAAI,GAAK,GAAK,GAAI,GAAK,GACpB,GAAI,GAAQ,EAAK,OAAO,MAAM,EAAG,QAAS,KAGlD,EAAQ,UAAU,WAAa,SAAS,EAAQ,CAC/C,MAAK,KAAW,QAAS,GAAO,GAEzB,KAAK,SAAS,CAAC,IAGvB,GAAI,IAAS,EAAM,KAEnB,EAAQ,UAAU,IAAM,SAAS,EAAI,EAAO,EAAQ,CAChD,AAAK,IAAW,QAAS,GAAO,IAEhC,GAAI,GAAM,EAAG,MAAM,KACf,EAAO,EAAI,GACX,EAAU,EAAI,GACd,EAAM,KAAK,KACf,GAAI,EAAS,CACT,GAAI,GAAI,EAAK,QAAQ,GACrB,GAAI,EAAI,GAAI,CACR,GAAI,GAAO,IAAU,SACjB,OAAO,EAAM,OAAO,QACX,IAAK,EAAI,IAAM,CAAC,EAAO,UACvB,IAAK,EAAI,IAAM,CAAC,EAAO,UACvB,IAAK,EAAI,IAAM,CAAE,EAAM,OAAO,GAAK,UACnC,IAAK,EAAI,IAAM,CAAE,EAAM,OAAO,GAAK,cAC/B,EAAI,GAAK,CAAC,UAEhB,GAAO,KAAW,SACzB,EAAI,GAAK,MAET,MAAM,IAAI,OAAM,mCAEpB,GAAI,GAAM,GAAI,GAAQ,EAAK,GAC3B,MAAI,GACA,MAAK,KAAO,EAAI,KACT,MAEJ,EAEX,KAAM,IAAI,OAAO,mBAAqB,EAAU,YAAc,OAE9D,OAAO,IAIf,GAAI,IAAQ,SAAU,EAAM,EAAM,EAAG,CACjC,GAAI,GAAO,EAAK,KACZ,EAAO,EAAK,KAChB,MAAO,IAAI,GACP,EAAK,GAAK,EAAK,GAAK,GAAG,EAAK,IAC5B,EAAK,GAAK,EAAK,GAAK,GAAG,EAAK,IAC5B,EAAK,GAAK,EAAK,GAAK,GAAG,EAAK,IAC5B,QAKR,GAAa,IAAM,GAEnB,GAAI,IAAS,KAAK,KACd,GAAQ,KAAK,IAEb,GAAO,SAAU,EAAM,EAAM,EAAG,CAChC,GAAI,GAAM,EAAK,KACX,EAAK,EAAI,GACT,EAAK,EAAI,GACT,EAAK,EAAI,GACT,EAAQ,EAAK,KACb,EAAK,EAAM,GACX,EAAK,EAAM,GACX,EAAK,EAAM,GACf,MAAO,IAAI,GACP,GAAO,GAAM,EAAG,GAAM,GAAE,GAAK,GAAM,EAAG,GAAK,GAC3C,GAAO,GAAM,EAAG,GAAM,GAAE,GAAK,GAAM,EAAG,GAAK,GAC3C,GAAO,GAAM,EAAG,GAAM,GAAE,GAAK,GAAM,EAAG,GAAK,GAC3C,QAKR,GAAa,KAAO,GAEpB,GAAI,IAAQ,SAAU,EAAM,EAAM,EAAG,CACjC,GAAI,GAAO,EAAK,MACZ,EAAO,EAAK,MAChB,MAAO,IAAI,GACP,EAAK,GAAK,EAAK,GAAK,GAAG,EAAK,IAC5B,EAAK,GAAK,EAAK,GAAK,GAAG,EAAK,IAC5B,EAAK,GAAK,EAAK,GAAK,GAAG,EAAK,IAC5B,QAKR,GAAa,IAAM,GAEnB,GAAI,IAAO,SAAU,EAAM,EAAM,EAAG,EAAG,CACnC,GAAI,GAAQ,EAER,EAAM,EACV,AAAI,IAAM,MACN,GAAO,EAAK,MACZ,EAAO,EAAK,OACT,AAAI,IAAM,MACb,GAAO,EAAK,MACZ,EAAO,EAAK,OACT,AAAI,IAAM,MACb,GAAO,EAAK,MACZ,EAAO,EAAK,OACT,AAAI,IAAM,MACb,GAAO,EAAK,MACZ,EAAO,EAAK,OACL,KAAM,OAAS,IAAM,QAC5B,GAAI,MACJ,EAAO,EAAK,MACZ,EAAO,EAAK,OAGhB,GAAI,GAAM,EAAM,EAAM,EAAM,EAAM,EAClC,AAAI,EAAE,OAAO,EAAG,KAAO,KAClB,GAAS,EAAM,EAAO,EAAO,GAAI,EAAO,EAAO,GAAI,EAAO,EAAO,GACjE,EAAW,EAAM,EAAO,EAAS,GAAI,EAAO,EAAS,GAAI,EAAO,EAAS,IAG9E,GAAI,GAAK,EAAK,EAAK,GAEnB,MAAI,CAAC,MAAM,IAAS,CAAC,MAAM,GAEvB,CAAI,EAAO,GAAQ,EAAO,EAAO,IAC7B,GAAK,EAAM,GAAK,KACb,AAAI,EAAO,GAAQ,EAAO,EAAO,IACpC,GAAK,EAAK,IAAI,EAEd,GAAK,EAAO,EAEhB,EAAM,EAAO,EAAI,IACd,AAAK,MAAM,GAGX,AAAK,MAAM,GAId,EAAM,OAAO,IAHb,GAAM,EACD,IAAQ,GAAK,GAAQ,IAAM,GAAK,OAAS,GAAM,IAJpD,GAAM,EACD,IAAQ,GAAK,GAAQ,IAAM,GAAK,OAAS,GAAM,IAQpD,IAAQ,QAAa,GAAM,EAAO,EAAK,GAAO,IAClD,EAAM,EAAO,EAAK,GAAK,GAChB,GAAI,GAAQ,CAAC,EAAK,EAAK,GAAM,IAGpC,GAAQ,SAAU,EAAM,EAAM,EAAG,CACpC,MAAO,IAAK,EAAM,EAAM,EAAG,QAI5B,GAAa,IAAM,GACnB,GAAa,IAAM,GAEnB,GAAI,IAAQ,SAAU,EAAM,EAAM,EAAG,CACjC,GAAI,GAAK,EAAK,MACV,EAAK,EAAK,MACd,MAAO,IAAI,GAAQ,EAAK,EAAK,GAAG,GAAK,QAIzC,GAAa,IAAM,GAEnB,GAAI,IAAQ,SAAU,EAAM,EAAM,EAAG,CACpC,MAAO,IAAK,EAAM,EAAM,EAAG,QAI5B,GAAa,IAAM,GAEnB,GAAI,IAAQ,SAAU,EAAM,EAAM,EAAG,CACpC,MAAO,IAAK,EAAM,EAAM,EAAG,QAI5B,GAAa,IAAM,GAEnB,GAAI,IAAQ,SAAU,EAAM,EAAM,EAAG,CACpC,MAAO,IAAK,EAAM,EAAM,EAAG,QAI5B,GAAa,IAAM,GAEnB,GAAI,IAAQ,SAAU,EAAM,EAAM,EAAG,CACpC,MAAO,IAAK,EAAM,EAAM,EAAG,QAI5B,GAAa,IAAM,GAEnB,GAAI,IAAa,EAAM,SACnB,GAAQ,KAAK,IACb,GAAS,KAAK,KACd,GAAO,KAAK,GACZ,GAAQ,KAAK,IACb,GAAQ,KAAK,IACb,GAAU,KAAK,MAEf,GAAU,SAAU,EAAQ,EAAM,EAAS,CAC3C,AAAK,IAAS,QAAS,GAAK,QACvB,IAAY,QAAS,GAAQ,MAElC,GAAI,GAAI,EAAO,OACf,AAAK,GAAW,GAAU,MAAM,KAAK,GAAI,OAAM,IAAI,IAAI,UAAY,CAAE,MAAO,MAE5E,GAAI,GAAI,EAAI,EAAQ,OAAO,SAAS,EAAG,EAAG,CAAE,MAAO,GAAI,IAIvD,GAHA,EAAQ,QAAQ,SAAU,EAAE,EAAG,CAAE,EAAQ,IAAM,IAE/C,EAAS,EAAO,IAAI,SAAU,EAAG,CAAE,MAAO,IAAI,GAAQ,KAClD,IAAS,OACT,MAAO,IAAc,EAAQ,GAQjC,OANI,GAAQ,EAAO,QACf,EAAM,EAAM,IAAI,GAChB,EAAM,GACN,EAAK,EACL,EAAK,EAEA,EAAE,EAAG,EAAE,EAAI,OAAQ,IAGxB,GAFA,EAAI,GAAM,GAAI,IAAM,GAAK,EAAQ,GACjC,EAAI,KAAK,MAAM,EAAI,IAAM,EAAI,EAAQ,IACjC,EAAK,OAAO,KAAO,KAAO,CAAC,MAAM,EAAI,IAAK,CAC1C,GAAI,GAAI,EAAI,GAAK,IAAM,GACvB,GAAM,GAAM,GAAK,EAAQ,GACzB,GAAM,GAAM,GAAK,EAAQ,GAIjC,GAAI,GAAQ,EAAM,QAAU,EAAQ,GACpC,EAAO,QAAQ,SAAU,EAAE,EAAI,CAC3B,GAAI,IAAO,EAAE,IAAI,GACjB,GAAS,EAAE,QAAU,EAAQ,EAAG,GAChC,OAAS,IAAE,EAAG,GAAE,EAAI,OAAQ,KACxB,GAAI,CAAC,MAAM,GAAK,KAEZ,GADA,EAAI,KAAM,EAAQ,EAAG,GACjB,EAAK,OAAO,MAAO,IAAK,CACxB,GAAI,IAAI,GAAK,IAAK,IAAM,GACxB,GAAM,GAAM,IAAK,EAAQ,EAAG,GAC5B,GAAM,GAAM,IAAK,EAAQ,EAAG,OAE5B,GAAI,KAAM,GAAK,IAAK,EAAQ,EAAG,KAM/C,OAAS,GAAI,EAAG,EAAI,EAAI,OAAQ,IAC5B,GAAI,EAAK,OAAO,KAAS,IAAK,CAE1B,OADI,GAAM,GAAQ,EAAK,EAAI,GAAM,EAAK,EAAI,IAAQ,GAAO,IAClD,EAAM,GAAK,GAAO,IACzB,KAAO,GAAO,KAAO,GAAO,IAC5B,EAAI,GAAO,MAEX,GAAI,GAAO,EAAI,GAAK,EAAI,GAGhC,UAAS,EACD,GAAI,GAAQ,EAAK,GAAO,MAAM,EAAQ,OAAU,EAAI,EAAO,KAInE,GAAgB,SAAU,EAAQ,EAAS,CAG3C,OAFI,GAAI,EAAO,OACX,EAAM,CAAC,EAAE,EAAE,EAAE,GACR,EAAE,EAAG,EAAI,EAAO,OAAQ,IAAK,CAClC,GAAI,GAAM,EAAO,GACb,EAAI,EAAQ,GAAK,EACjB,EAAM,EAAI,KACd,EAAI,IAAM,GAAM,EAAI,GAAG,GAAK,EAC5B,EAAI,IAAM,GAAM,EAAI,GAAG,GAAK,EAC5B,EAAI,IAAM,GAAM,EAAI,GAAG,GAAK,EAC5B,EAAI,IAAM,EAAI,GAAK,EAEvB,SAAI,GAAK,GAAO,EAAI,IACpB,EAAI,GAAK,GAAO,EAAI,IACpB,EAAI,GAAK,GAAO,EAAI,IAChB,EAAI,GAAK,UAAa,GAAI,GAAK,GAC5B,GAAI,GAAQ,GAAW,KAQ9B,GAAS,EAAM,KAEf,GAAQ,KAAK,IAEb,GAAQ,SAAS,EAAQ,CAGzB,GAAI,GAAQ,MACR,EAAS,EAAS,QAClB,EAAU,EAEV,EAAU,CAAC,EAAG,GACd,EAAO,GACP,EAAW,CAAC,EAAE,GACd,EAAW,GACX,EAAU,GACV,EAAO,GACP,EAAO,EACP,EAAO,EACP,EAAoB,GACpB,EAAc,GACd,EAAY,GACZ,EAAS,EAIT,EAAY,SAAS,EAAQ,CAM7B,GALA,EAAS,GAAU,CAAC,OAAQ,QACxB,GAAU,GAAO,KAAY,UAAY,EAAS,QAClD,EAAS,OAAO,EAAO,gBACvB,GAAS,EAAS,OAAO,EAAO,gBAEhC,GAAO,KAAY,QAAS,CAE5B,AAAI,EAAO,SAAW,GAClB,GAAS,CAAC,EAAO,GAAI,EAAO,KAGhC,EAAS,EAAO,MAAM,GAEtB,OAAS,GAAE,EAAG,EAAE,EAAO,OAAQ,IAC3B,EAAO,GAAK,EAAS,EAAO,IAGhC,EAAK,OAAS,EACd,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IAC/B,EAAK,KAAK,EAAK,GAAO,OAAO,IAGrC,YACO,EAAU,GAGjB,GAAW,SAAS,EAAO,CAC3B,GAAI,GAAY,KAAM,CAGlB,OAFI,GAAI,EAAS,OAAO,EACpB,EAAI,EACD,EAAI,GAAK,GAAS,EAAS,IAC9B,IAEJ,MAAO,GAAE,EAEb,MAAO,IAGP,GAAgB,SAAU,EAAG,CAAE,MAAO,IACtC,GAAa,SAAU,EAAG,CAAE,MAAO,IAcnC,GAAW,SAAS,EAAK,EAAW,CACpC,GAAI,GAAK,EAET,GADI,GAAa,MAAQ,GAAY,IACjC,MAAM,IAAS,IAAQ,KAAS,MAAO,GAC3C,GAAK,EAYD,EAAI,UAXA,GAAa,EAAS,OAAS,EAAI,CAEnC,GAAI,IAAI,GAAS,GACjB,EAAI,GAAK,GAAS,OAAO,OACtB,AAAI,KAAS,EAEhB,EAAK,GAAM,GAAS,GAAO,GAE3B,EAAI,EAOZ,EAAI,GAAW,GAEV,GACD,GAAI,GAAc,IAGlB,IAAW,GAAK,GAAI,GAAM,EAAG,IAEjC,EAAI,EAAS,GAAM,EAAK,GAAI,EAAS,GAAK,EAAS,IAEnD,EAAI,KAAK,IAAI,EAAG,KAAK,IAAI,EAAG,IAE5B,GAAI,IAAI,KAAK,MAAM,EAAI,KAEvB,GAAI,GAAa,EAAY,IACzB,EAAM,EAAY,QACf,CACH,GAAI,GAAO,KAAa,QAEpB,OAAS,IAAE,EAAG,GAAE,EAAK,OAAQ,KAAK,CAC9B,GAAI,IAAI,EAAK,IACb,GAAI,GAAK,GAAG,CACR,EAAM,EAAQ,IACd,MAEJ,GAAK,GAAK,IAAO,KAAO,EAAK,OAAO,EAAK,CACrC,EAAM,EAAQ,IACd,MAEJ,GAAI,EAAI,IAAK,EAAI,EAAK,GAAE,GAAI,CACxB,EAAK,GAAE,IAAI,GAAK,GAAE,GAAG,IACrB,EAAM,EAAS,YAAY,EAAQ,IAAI,EAAQ,GAAE,GAAI,EAAG,GACxD,WAGL,AAAI,IAAO,KAAa,YAC3B,GAAM,EAAQ,IAElB,AAAI,GAAa,GAAY,IAAK,GAEtC,MAAO,IAGP,GAAa,UAAY,CAAE,MAAO,GAAc,IAEpD,EAAU,GAIV,GAAI,GAAI,SAAS,EAAG,CAChB,GAAI,GAAI,EAAS,GAAS,IAC1B,MAAI,IAAQ,EAAE,GAAgB,EAAE,KAAyB,GAG7D,SAAE,QAAU,SAAS,EAAS,CAC1B,GAAI,GAAW,KAAM,CACjB,GAAI,GAAO,KAAa,QACpB,EAAW,EACX,EAAU,CAAC,EAAQ,GAAI,EAAQ,EAAQ,OAAO,QAC3C,CACH,GAAI,GAAI,EAAS,QAAQ,GACzB,AAAI,IAAY,EACZ,EAAW,CAAC,EAAE,IAAK,EAAE,KAErB,EAAW,EAAS,OAAO,EAAG,IAAK,GAG3C,MAAO,GAEX,MAAO,IAIX,EAAE,OAAS,SAAS,EAAQ,CACxB,GAAI,CAAC,UAAU,OACX,MAAO,GAEX,EAAO,EAAO,GACd,EAAO,EAAO,EAAO,OAAO,GAC5B,EAAO,GACP,GAAI,GAAI,EAAQ,OAChB,GAAK,EAAO,SAAW,GAAO,IAAS,EAEnC,OAAS,GAAI,EAAG,EAAO,MAAM,KAAK,GAAS,EAAI,EAAK,OAAQ,GAAK,EAAG,CAChE,GAAI,IAAI,EAAK,GAEf,EAAK,KAAM,IAAE,GAAS,GAAK,QAE1B,CACH,OAAS,IAAE,EAAG,GAAE,EAAG,KACf,EAAK,KAAK,GAAG,GAAE,IAEnB,GAAI,EAAO,OAAS,EAAG,CAEnB,GAAI,IAAO,EAAO,IAAI,SAAU,GAAE,GAAG,CAAE,MAAO,IAAG,GAAO,OAAO,KAC3D,GAAU,EAAO,IAAI,SAAU,GAAG,CAAE,MAAQ,IAAI,GAAS,GAAO,KACpE,AAAK,GAAQ,MAAM,SAAU,GAAK,GAAG,CAAE,MAAO,IAAK,MAAO,MACtD,IAAa,SAAU,GAAG,CACtB,GAAI,IAAK,GAAK,IAAK,EAAK,MAAO,IAE/B,OADI,IAAI,EACD,IAAK,GAAQ,GAAE,IAAM,KAC5B,GAAI,IAAK,IAAI,GAAQ,KAAO,IAAQ,GAAE,GAAK,GAAQ,KAC/C,GAAM,GAAK,IAAK,GAAK,IAAK,GAAE,GAAK,GAAK,KAC1C,MAAO,OAMvB,SAAU,CAAC,EAAM,GACV,GAGX,EAAE,KAAO,SAAS,EAAI,CAClB,MAAK,WAAU,OAGf,GAAQ,EACR,KACO,GAJI,GAOf,EAAE,MAAQ,SAAS,EAAQ,EAAM,CAC7B,SAAU,EAAQ,GACX,GAGX,EAAE,IAAM,SAAS,EAAI,CACjB,SAAO,EACA,GAGX,EAAE,OAAS,SAAS,EAAK,CACrB,MAAK,WAAU,OAGf,GAAU,EACH,GAHI,GAMf,EAAE,iBAAmB,SAAS,EAAG,CAC7B,MAAI,IAAK,MAAQ,GAAI,IACrB,EAAoB,EACpB,KACA,AAAI,EACA,GAAgB,SAAS,EAAG,CAUxB,OATI,GAAK,GAAS,EAAG,IAAM,MAAM,GAC7B,EAAK,GAAS,EAAG,IAAM,MAAM,GAC7B,GAAM,EAAK,EACX,GAAW,GAAS,EAAG,IAAM,MAAM,GACnC,GAAU,EAAO,GAAK,GAAM,EAC5B,GAAS,GAAW,GACpB,GAAK,EACL,GAAK,EACL,GAAW,GACP,KAAK,IAAI,IAAU,KAAU,MAAa,GAC9C,AAAC,WAAW,CACR,MAAI,KAAO,KAAU,IACrB,AAAI,GAAS,EACT,IAAK,EACL,GAAM,IAAK,GAAK,IAEhB,IAAK,EACL,GAAM,IAAK,GAAK,IAEpB,GAAW,GAAS,EAAG,IAAM,MAAM,GAC5B,GAAS,GAAW,OAGnC,MAAO,IAGX,GAAgB,SAAU,EAAG,CAAE,MAAO,IAEnC,GAGX,EAAE,QAAU,SAAS,EAAG,CACpB,MAAI,IAAK,KACD,IAAO,KAAO,UACd,GAAI,CAAC,EAAE,IAEX,EAAW,EACJ,GAEA,GAIf,EAAE,OAAS,SAAS,EAAW,EAAK,CAEhC,AAAI,UAAU,OAAS,GAAK,GAAM,OAClC,GAAI,GAAS,GAEb,GAAI,UAAU,SAAW,EACrB,EAAS,EAAQ,MAAM,WAEhB,IAAc,EACrB,EAAS,CAAC,EAAE,aAEL,EAAY,EAAG,CACtB,GAAI,GAAK,EAAQ,GACb,GAAK,EAAQ,GAAK,EACtB,EAAS,GAAU,EAAG,EAAW,IAAO,IAAI,SAAU,GAAG,CAAE,MAAO,GAAG,EAAO,GAAG,GAAU,GAAM,UAE5F,CACH,EAAS,GACT,GAAI,IAAU,GACd,GAAI,GAAa,EAAS,OAAS,EAC/B,OAAS,IAAI,EAAG,GAAM,EAAS,OAAQ,GAAM,GAAK,GAAK,GAAM,GAAI,GAAM,GAAI,GAAK,GAAM,KAAM,KACxF,GAAQ,KAAM,GAAS,GAAE,GAAG,EAAS,KAAI,QAG7C,IAAU,EAEd,EAAS,GAAQ,IAAI,SAAU,GAAG,CAAE,MAAO,GAAE,MAGjD,MAAI,GAAS,IACT,GAAS,EAAO,IAAI,SAAU,GAAG,CAAE,MAAO,IAAE,QAEzC,GAGX,EAAE,MAAQ,SAAS,EAAG,CAClB,MAAI,IAAK,KACL,GAAY,EACL,GAEA,GAIf,EAAE,MAAQ,SAAS,EAAG,CAClB,MAAI,IAAK,KACL,GAAS,EACF,GAEA,GAIf,EAAE,OAAS,SAAS,EAAG,CACnB,MAAI,IAAK,KACL,GAAS,EAAS,GACX,GAEA,GAIR,GAGX,YAAmB,EAAM,EAAO,EAAW,CAIzC,OAHI,GAAQ,GACR,EAAY,EAAO,EACnB,EAAM,AAAC,EAAoB,EAAY,EAAQ,EAAI,EAAQ,EAAxC,EACd,EAAI,EAAM,EAAY,EAAI,EAAM,EAAI,EAAK,EAAY,IAAM,IAClE,EAAM,KAAK,GAEb,MAAO,GAYT,GAAI,IAAS,SAAS,EAAQ,CAC1B,GAAI,GAAQ,EAAU,EAElB,EAAG,EAAM,EAAM,EAEnB,GADA,EAAS,EAAO,IAAI,SAAU,EAAG,CAAE,MAAO,IAAI,GAAQ,KAClD,EAAO,SAAW,EAElB,AAAC,EAAS,EAAO,IAAI,SAAU,EAAG,CAAE,MAAO,GAAE,QAAW,EAAO,EAAO,GAAI,EAAO,EAAO,GACxF,EAAI,SAAS,EAAG,CACZ,GAAI,GAAO,CAAC,EAAG,EAAG,GAAG,IAAI,SAAU,EAAG,CAAE,MAAO,GAAK,GAAM,EAAK,GAAK,GAAK,EAAK,MAC9E,MAAO,IAAI,GAAQ,EAAK,gBAErB,EAAO,SAAW,EAEzB,AAAC,EAAW,EAAO,IAAI,SAAU,EAAG,CAAE,MAAO,GAAE,QAAW,EAAO,EAAS,GAAI,EAAO,EAAS,GAAI,EAAO,EAAS,GAClH,EAAI,SAAS,EAAG,CACZ,GAAI,GAAO,CAAC,EAAG,EAAG,GAAG,IAAI,SAAU,EAAG,CAAE,MAAS,GAAE,GAAI,GAAE,GAAK,EAAK,GAAO,EAAK,GAAE,GAAK,EAAI,EAAK,GAAO,EAAI,EAAI,EAAK,KACnH,MAAO,IAAI,GAAQ,EAAK,gBAErB,EAAO,SAAW,EAAG,CAE5B,GAAI,GACJ,AAAC,EAAW,EAAO,IAAI,SAAU,EAAG,CAAE,MAAO,GAAE,QAAW,EAAO,EAAS,GAAI,EAAO,EAAS,GAAI,EAAO,EAAS,GAAI,EAAO,EAAS,GACtI,EAAI,SAAS,EAAG,CACZ,GAAI,GAAO,CAAC,EAAG,EAAG,GAAG,IAAI,SAAU,EAAG,CAAE,MAAS,GAAE,GAAI,GAAE,GAAI,GAAE,GAAK,EAAK,GAAO,EAAK,GAAE,GAAM,GAAE,GAAK,EAAI,EAAK,GAAO,EAAK,GAAE,GAAK,EAAI,EAAI,EAAK,GAAO,EAAE,EAAE,EAAI,EAAK,KACjK,MAAO,IAAI,GAAQ,EAAK,gBAErB,EAAO,SAAW,EAAG,CAC5B,GAAI,GAAK,GAAO,EAAO,MAAM,EAAG,IAC5B,EAAK,GAAO,EAAO,MAAM,EAAG,IAChC,EAAI,SAAS,EAAG,CACZ,MAAI,GAAI,GACG,EAAG,EAAE,GAEL,EAAI,GAAE,IAAK,IAI9B,MAAO,IAGP,GAAW,SAAU,EAAQ,CAC7B,GAAI,GAAI,GAAO,GACf,SAAE,MAAQ,UAAY,CAAE,MAAO,IAAM,IAC9B,GAWP,GAAQ,SAAU,EAAQ,EAAK,EAAM,CACrC,GAAI,CAAC,GAAM,GACP,KAAM,IAAI,OAAM,sBAAwB,GAE5C,MAAO,IAAM,GAAM,EAAQ,IAG3B,GAAU,SAAU,EAAG,CAAE,MAAO,UAAU,EAAO,EAAK,CAClD,GAAI,GAAK,EAAS,GAAK,MACnB,EAAK,EAAS,GAAQ,MAC1B,MAAO,GAAS,IAAI,EAAE,EAAI,MAG9B,GAAO,SAAU,EAAG,CAAE,MAAO,UAAU,EAAI,EAAI,CAC3C,GAAI,GAAM,GACV,SAAI,GAAK,EAAE,EAAG,GAAI,EAAG,IACrB,EAAI,GAAK,EAAE,EAAG,GAAI,EAAG,IACrB,EAAI,GAAK,EAAE,EAAG,GAAI,EAAG,IACd,IAGX,GAAS,SAAU,EAAG,CAAE,MAAO,IAC/B,GAAW,SAAU,EAAE,EAAG,CAAE,MAAO,GAAI,EAAI,KAC3C,GAAW,SAAU,EAAE,EAAG,CAAE,MAAO,GAAI,EAAI,EAAI,GAC/C,GAAU,SAAU,EAAE,EAAG,CAAE,MAAO,GAAI,EAAI,EAAI,GAC9C,GAAS,SAAU,EAAE,EAAG,CAAE,MAAO,KAAO,GAAK,GAAE,EAAE,KAAQ,GAAE,EAAE,OAC7D,GAAU,SAAU,EAAE,EAAG,CAAE,MAAO,GAAI,IAAM,EAAI,EAAI,EAAI,IAAM,IAAO,GAAI,EAAK,GAAI,EAAI,KAAU,GAAI,EAAI,OACxG,GAAO,SAAU,EAAE,EAAG,CAAE,MAAO,KAAO,GAAK,GAAI,EAAI,KAAQ,GAAE,OAC7D,GAAQ,SAAU,EAAE,EAAG,CACvB,MAAI,KAAM,IAAc,IACxB,GAAI,IAAO,GAAI,KAAQ,GAAI,EAAI,KACxB,EAAI,IAAM,IAAM,IAM3B,GAAM,OAAS,GAAQ,GAAK,KAC5B,GAAM,SAAW,GAAQ,GAAK,KAC9B,GAAM,OAAS,GAAQ,GAAK,KAC5B,GAAM,QAAU,GAAQ,GAAK,KAC7B,GAAM,OAAS,GAAQ,GAAK,KAC5B,GAAM,QAAU,GAAQ,GAAK,KAC7B,GAAM,MAAQ,GAAQ,GAAK,KAC3B,GAAM,KAAO,GAAQ,GAAK,KAid1B,OA9cI,IAAU,GAMV,GAAS,EAAM,KACf,GAAa,EAAM,SACnB,GAAU,EAAM,MAChB,GAAQ,KAAK,IACb,GAAQ,KAAK,IACb,GAAQ,KAAK,IAGb,GAAY,SAAS,EAAO,EAAW,EAAK,EAAO,EAAW,CAC9D,AAAK,IAAU,QAAS,GAAM,KACzB,IAAc,QAAS,GAAU,MACjC,IAAQ,QAAS,GAAI,GACrB,IAAU,QAAS,GAAM,GACzB,IAAc,QAAS,GAAU,CAAC,EAAE,IAEzC,GAAI,GAAK,EAAG,EACZ,AAAI,GAAO,KAAe,QACtB,EAAK,EAAU,GAAK,EAAU,GAE9B,GAAK,EACL,EAAY,CAAC,EAAW,IAG5B,GAAI,GAAI,SAAS,EAAO,CACpB,GAAI,GAAI,GAAa,IAAM,KAAK,IAAQ,EAAY,GAChD,EAAI,GAAM,EAAU,GAAM,EAAK,EAAQ,GACvC,EAAI,IAAO,EAAI,EAAI,GAAM,EAAQ,EAAM,EACvC,EAAO,EAAI,EAAK,GAAE,GAAM,EACxB,EAAQ,GAAM,GACd,EAAQ,GAAM,GACd,EAAI,EAAK,EAAQ,SAAW,EAAU,QAAS,GAC/C,EAAI,EAAK,EAAQ,SAAW,EAAU,OAAS,GAC/C,GAAI,EAAK,EAAO,SAAW,GAC/B,MAAO,GAAS,GAAW,CAAC,EAAE,IAAI,EAAE,IAAI,GAAE,IAAI,MAGlD,SAAE,MAAQ,SAAS,EAAG,CAClB,MAAK,IAAK,KAAgB,EAC1B,GAAQ,EACD,IAGX,EAAE,UAAY,SAAS,EAAG,CACtB,MAAK,IAAK,KAAgB,EAC1B,GAAY,EACL,IAGX,EAAE,MAAQ,SAAS,EAAG,CAClB,MAAK,IAAK,KAAgB,EAC1B,GAAQ,EACD,IAGX,EAAE,IAAM,SAAS,EAAG,CAChB,MAAK,IAAK,KAAgB,EAC1B,GAAM,EACN,AAAI,GAAO,KAAS,QAChB,GAAK,EAAI,GAAK,EAAI,GACd,IAAO,GAAK,GAAM,EAAI,KAE1B,EAAK,EAEF,IAGX,EAAE,UAAY,SAAS,EAAG,CACtB,MAAK,IAAK,KAAgB,EAC1B,CAAI,GAAO,KAAO,QACd,GAAY,EACZ,EAAK,EAAE,GAAK,EAAE,IAEd,GAAY,CAAC,EAAE,GACf,EAAK,GAEF,IAGX,EAAE,MAAQ,UAAY,CAAE,MAAO,GAAS,MAAM,IAE9C,EAAE,IAAI,GAEC,GAGP,GAAS,mBAET,GAAU,KAAK,MACf,GAAS,KAAK,OAEd,GAAW,UAAY,CAEvB,OADI,GAAO,IACF,EAAE,EAAG,EAAE,EAAG,IACf,GAAQ,GAAO,OAAO,GAAQ,KAAW,KAE7C,MAAO,IAAI,GAAQ,EAAM,QAGzB,GAAQ,KAAK,IACb,GAAQ,KAAK,IACb,GAAU,KAAK,MACf,GAAM,KAAK,IAGX,GAAU,SAAU,EAAM,EAAK,CAC/B,AAAK,IAAQ,QAAS,GAAI,MAE1B,GAAI,GAAI,CACJ,IAAK,OAAO,UACZ,IAAK,OAAO,UAAU,GACtB,IAAK,EACL,OAAQ,GACR,MAAO,GAEX,MAAI,GAAK,KAAU,UACf,GAAO,OAAO,OAAO,IAEzB,EAAK,QAAQ,SAAU,EAAK,CACxB,AAAI,GAAO,EAAK,KAAS,UAAY,GAAM,EAAI,IAC3C,AAAqB,GAAQ,MAAQ,CAAC,MAAM,IAC5C,GAAE,OAAO,KAAK,GACd,EAAE,KAAO,EACL,EAAM,EAAE,KAAO,GAAE,IAAM,GACvB,EAAM,EAAE,KAAO,GAAE,IAAM,GAC3B,EAAE,OAAS,KAInB,EAAE,OAAS,CAAC,EAAE,IAAK,EAAE,KAErB,EAAE,OAAS,SAAU,EAAM,EAAK,CAAE,MAAO,IAAO,EAAG,EAAM,IAElD,GAIP,GAAS,SAAU,EAAM,EAAM,EAAK,CACpC,AAAK,IAAS,QAAS,GAAK,SACvB,IAAQ,QAAS,GAAI,GAEtB,EAAK,IAAS,SACd,GAAO,GAAQ,IAEnB,GAAI,GAAM,EAAK,IACX,EAAM,EAAK,IACX,EAAS,EAAK,OAAO,KAAK,SAAU,GAAE,GAAG,CAAE,MAAO,IAAE,KAExD,GAAI,IAAQ,EAAK,MAAO,CAAC,EAAI,GAE7B,GAAI,GAAS,GAOb,GALI,EAAK,OAAO,EAAE,KAAO,KACrB,GAAO,KAAK,GACZ,EAAO,KAAK,IAGZ,EAAK,OAAO,EAAE,KAAO,IAAK,CAC1B,EAAO,KAAK,GACZ,OAAS,GAAE,EAAG,EAAE,EAAK,IACjB,EAAO,KAAK,EAAM,EAAE,EAAM,GAAI,IAElC,EAAO,KAAK,WAGP,EAAK,OAAO,EAAE,KAAO,IAAK,CAC/B,GAAI,GAAO,EACP,KAAM,IAAI,OAAM,uDAEpB,GAAI,GAAU,KAAK,OAAS,GAAM,GAC9B,EAAU,KAAK,OAAS,GAAM,GAClC,EAAO,KAAK,GACZ,OAAS,GAAI,EAAG,EAAI,EAAK,IACrB,EAAO,KAAK,GAAM,GAAI,EAAY,EAAI,EAAQ,GAAU,KAE5D,EAAO,KAAK,WAGP,EAAK,OAAO,EAAE,KAAO,IAAK,CAC/B,EAAO,KAAK,GACZ,OAAS,GAAI,EAAG,EAAI,EAAK,IAAO,CAC5B,GAAI,GAAM,GAAO,OAAO,GAAK,EAAK,EAC9B,EAAK,GAAQ,GACjB,GAAI,IAAO,EACP,EAAO,KAAK,EAAO,QAChB,CACH,GAAI,GAAK,EAAI,EACb,EAAO,KAAM,EAAO,GAAK,GAAE,GAAQ,EAAO,EAAG,GAAG,IAGxD,EAAO,KAAK,WAIP,EAAK,OAAO,EAAE,KAAO,IAAK,CAM/B,GAAI,GACA,EAAI,EAAO,OACX,GAAc,GAAI,OAAM,GACxB,GAAe,GAAI,OAAM,GACzB,GAAS,GACT,GAAW,EACX,GAAY,KAGhB,GAAY,GACZ,GAAU,KAAK,GACf,OAAS,GAAI,EAAG,EAAI,EAAK,IACrB,GAAU,KAAK,EAAQ,EAAI,EAAQ,GAAI,IAI3C,IAFA,GAAU,KAAK,GAER,IAAQ,CAEX,OAAS,GAAE,EAAG,EAAE,EAAK,IACjB,GAAa,GAAK,EAEtB,OAAS,GAAI,EAAG,EAAI,EAAG,IAInB,OAHI,GAAQ,EAAO,GACf,EAAU,OAAO,UACjB,GAAQ,OACH,GAAI,EAAG,GAAI,EAAK,KAAO,CAC5B,GAAI,IAAO,GAAI,GAAU,IAAK,GAC9B,AAAI,GAAO,GACP,GAAU,GACV,GAAO,IAEX,GAAa,MACb,GAAY,GAAO,GAM3B,OADI,IAAe,GAAI,OAAM,GACpB,GAAI,EAAG,GAAI,EAAK,KACrB,GAAa,IAAO,KAExB,OAAS,IAAI,EAAG,GAAI,EAAG,KACnB,EAAU,GAAY,IACtB,AAAI,GAAa,KAAa,KAC1B,GAAa,GAAW,EAAO,IAE/B,GAAa,IAAY,EAAO,IAGxC,OAAS,IAAI,EAAG,GAAI,EAAK,KACrB,GAAa,KAAQ,EAAE,GAAa,IAIxC,GAAS,GACT,OAAS,IAAI,EAAG,GAAI,EAAK,KACrB,GAAI,GAAa,MAAS,GAAU,IAAM,CACtC,GAAS,GACT,MAIR,GAAY,GACZ,KAEI,GAAW,KACX,IAAS,IAOjB,OADI,IAAY,GACP,GAAI,EAAG,GAAI,EAAK,KACrB,GAAU,IAAO,GAErB,OAAS,IAAI,EAAG,GAAI,EAAG,KACnB,EAAU,GAAY,IACtB,GAAU,GAAS,KAAK,EAAO,KAGnC,OADI,IAAkB,GACb,GAAI,EAAG,GAAI,EAAK,KACrB,GAAgB,KAAK,GAAU,IAAK,IACpC,GAAgB,KAAK,GAAU,IAAK,GAAU,IAAK,OAAO,IAE9D,GAAkB,GAAgB,KAAK,SAAU,GAAE,GAAE,CAAE,MAAO,IAAE,KAChE,EAAO,KAAK,GAAgB,IAC5B,OAAS,IAAI,EAAG,GAAM,GAAgB,OAAQ,IAAM,EAAG,CACnD,GAAI,IAAI,GAAgB,IACxB,AAAI,CAAC,MAAM,KAAO,EAAO,QAAQ,MAAO,IACpC,EAAO,KAAK,KAIxB,MAAO,IAGP,GAAY,CAAC,QAAS,GAAS,OAAQ,IAEvC,GAAW,SAAU,EAAG,EAAG,CAG3B,EAAI,GAAI,GAAQ,GAChB,EAAI,GAAI,GAAQ,GAChB,GAAI,GAAK,EAAE,YACP,EAAK,EAAE,YACX,MAAO,GAAK,EAAM,GAAK,KAAS,GAAK,KAAS,GAAK,KAAS,GAAK,MAGjE,GAAS,KAAK,KACd,GAAU,KAAK,MACf,GAAQ,KAAK,IACb,GAAQ,KAAK,IACb,GAAO,KAAK,GAEZ,GAAS,SAAS,EAAG,EAAG,EAAG,EAAG,CAC9B,AAAK,IAAM,QAAS,GAAE,GACjB,IAAM,QAAS,GAAE,GAItB,EAAI,GAAI,GAAQ,GAChB,EAAI,GAAI,GAAQ,GAchB,OAbI,GAAM,MAAM,KAAK,EAAE,OACnB,EAAK,EAAI,GACT,EAAK,EAAI,GACT,EAAK,EAAI,GACT,EAAQ,MAAM,KAAK,EAAE,OACrB,EAAK,EAAM,GACX,EAAK,EAAM,GACX,EAAK,EAAM,GACX,EAAK,GAAQ,EAAK,EAAO,EAAK,GAC9B,EAAK,GAAQ,EAAK,EAAO,EAAK,GAC9B,EAAK,EAAK,GAAO,KAAS,QAAW,EAAO,GAAO,OAAU,GAC7D,EAAO,MAAS,EAAO,GAAO,MAAS,GAAQ,KAC/C,EAAK,EAAK,KAAW,EAAO,GAAQ,EAAI,GAAM,IAAS,GACpD,EAAK,GAAK,GAAM,IACvB,KAAO,GAAM,KAAO,GAAM,IAC1B,GAAI,IAAK,GAAM,KAAW,GAAM,IAAU,IAAO,GAAM,GAAM,GAAO,GAAQ,GAAK,KAAU,MAAY,IAAO,GAAM,GAAM,GAAO,GAAQ,GAAK,IAAS,MACnJ,GAAK,EAAK,EAAK,EAAK,EACpB,GAAI,GAAO,GAAM,IAAK,OACtB,GAAK,EAAQ,IAAI,GAAK,EAAO,IAC7B,GAAO,EAAK,EACZ,EAAO,EAAK,EACZ,EAAO,EAAK,EACZ,EAAO,EAAK,EACZ,EAAQ,EAAO,EAAS,EAAO,EAAU,EAAO,EAChD,EAAK,GAAQ,GAAI,GACjB,GAAK,EAAQ,GAAI,GACjB,GAAK,GACT,MAAO,IAAQ,EAAK,EAAO,GAAK,GAAO,EAAO,IAAK,MAInD,GAAW,SAAS,EAAG,EAAG,EAAM,CAChC,AAAK,IAAS,QAAS,GAAK,OAI5B,EAAI,GAAI,GAAQ,GAChB,EAAI,GAAI,GAAQ,GAChB,GAAI,GAAK,EAAE,IAAI,GACX,EAAK,EAAE,IAAI,GACX,EAAS,EACb,OAAS,KAAK,GAAI,CACd,GAAI,GAAK,GAAG,IAAM,GAAM,GAAG,IAAM,GACjC,GAAU,EAAE,EAEhB,MAAO,MAAK,KAAK,IAGjB,GAAQ,UAAY,CAEpB,OADI,GAAO,GAAI,EAAM,UAAU,OACvB,KAAQ,EAAM,GAAQ,UAAW,GAEzC,GAAI,CACA,UAAK,UAAS,UAAU,KAAK,MAAO,EAAS,CAAE,MAAO,OAAQ,KACvD,SACF,EAAP,CACE,MAAO,KASX,GAAS,CACZ,KAAM,UAAgB,CAAE,MAAO,IAAM,CAAC,EAAS,IAAI,IAAI,EAAE,IAAK,EAAS,IAAI,IAAI,GAAG,OAClF,IAAK,UAAe,CAAE,MAAO,IAAM,CAAC,OAAO,OAAO,OAAO,QAAS,CAAC,EAAE,IAAI,IAAI,IAAI,KAAK,SAoBnF,GAAc,CAEd,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAC/F,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAC/F,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAC/F,QAAS,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAClG,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAC/F,OAAQ,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACjG,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAC/F,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAC/F,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAC/F,OAAQ,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACjG,OAAQ,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACjG,QAAS,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAClG,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAC/F,MAAO,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAChG,OAAQ,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACjG,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAC/F,MAAO,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAChG,OAAQ,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACjG,QAAS,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAIlG,SAAU,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACzH,OAAQ,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACvH,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACrH,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACrH,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACrH,OAAQ,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACvH,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACrH,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACrH,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAIrH,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACpF,OAAQ,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACtF,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAC/F,KAAM,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAChI,MAAO,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACrF,OAAQ,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WAClI,QAAS,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,WACvF,QAAS,CAAC,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,UAAW,YAI7F,GAAM,EAAG,GAAS,OAAO,KAAK,IAAc,GAAM,GAAO,OAAQ,IAAO,EAAG,CAChF,GAAI,IAAM,GAAO,IAEjB,GAAY,GAAI,eAAiB,GAAY,IAGjD,GAAI,IAAgB,GA4CpB,EAAS,QAAU,GACnB,EAAS,OAAS,GAClB,EAAS,MAAQ,GACjB,EAAS,UAAY,GACrB,EAAS,IAAM,EAAS,YAAc,GACtC,EAAS,OAAS,GAClB,EAAS,MAAQ,GAGjB,EAAS,QAAU,GAAU,QAC7B,EAAS,SAAW,GACpB,EAAS,OAAS,GAClB,EAAS,SAAW,GACpB,EAAS,OAAS,GAAU,OAC5B,EAAS,MAAQ,GAGjB,EAAS,OAAS,GAGlB,EAAS,OAAS,GAClB,EAAS,OAAS,GAElB,GAAI,IAAY,EAEhB,MAAO,QCtpGX,oBAAC,UAAS,EAAM,EAAS,CACrB,aAIA,AAAI,MAAO,SAAW,YAAc,OAAO,IACvC,OAAO,aAAc,GAAI,GACtB,AAAI,MAAO,KAAY,SAC1B,GAAO,QAAU,IAEjB,EAAK,WAAa,MAExB,GAAM,UAAW,CACf,aACA,WAAmB,EAAG,CAClB,MAAO,CAAC,MAAM,WAAW,KAAO,SAAS,GAG7C,WAAqB,EAAK,CACtB,MAAO,GAAI,OAAO,GAAG,cAAgB,EAAI,UAAU,GAGvD,WAAiB,EAAG,CAChB,MAAO,WAAW,CACd,MAAO,MAAK,IAIpB,GAAI,GAAe,CAAC,gBAAiB,SAAU,WAAY,cACvD,EAAe,CAAC,eAAgB,cAChC,EAAc,CAAC,WAAY,eAAgB,UAC3C,EAAa,CAAC,QACd,EAAc,CAAC,cAEf,EAAQ,EAAa,OAAO,EAAc,EAAa,EAAY,GAEvE,WAAoB,EAAK,CACrB,GAAI,EAAC,EACL,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAC9B,AAAI,EAAI,EAAM,MAAQ,QAClB,KAAK,MAAQ,EAAY,EAAM,KAAK,EAAI,EAAM,KAK1D,EAAW,UAAY,CACnB,QAAS,UAAW,CAChB,MAAO,MAAK,MAEhB,QAAS,SAAS,EAAG,CACjB,GAAI,OAAO,UAAU,SAAS,KAAK,KAAO,iBACtC,KAAM,IAAI,WAAU,yBAExB,KAAK,KAAO,GAGhB,cAAe,UAAW,CACtB,MAAO,MAAK,YAEhB,cAAe,SAAS,EAAG,CACvB,GAAI,YAAa,GACb,KAAK,WAAa,UACX,YAAa,QACpB,KAAK,WAAa,GAAI,GAAW,OAEjC,MAAM,IAAI,WAAU,gDAI5B,SAAU,UAAW,CACjB,GAAI,GAAW,KAAK,eAAiB,GACjC,EAAa,KAAK,iBAAmB,GACrC,EAAe,KAAK,mBAAqB,GACzC,EAAe,KAAK,mBAAqB,GAC7C,MAAI,MAAK,YACD,EACO,WAAa,EAAW,IAAM,EAAa,IAAM,EAAe,IAEpE,UAAY,EAAa,IAAM,EAEtC,EACO,EAAe,KAAO,EAAW,IAAM,EAAa,IAAM,EAAe,IAE7E,EAAW,IAAM,EAAa,IAAM,IAInD,EAAW,WAAa,SAAgC,EAAK,CACzD,GAAI,GAAiB,EAAI,QAAQ,KAC7B,EAAe,EAAI,YAAY,KAE/B,EAAe,EAAI,UAAU,EAAG,GAChC,EAAO,EAAI,UAAU,EAAiB,EAAG,GAAc,MAAM,KAC7D,EAAiB,EAAI,UAAU,EAAe,GAElD,GAAI,EAAe,QAAQ,OAAS,EAChC,GAAI,GAAQ,gCAAgC,KAAK,EAAgB,IAC7D,EAAW,EAAM,GACjB,GAAa,EAAM,GACnB,EAAe,EAAM,GAG7B,MAAO,IAAI,GAAW,CAClB,aAAc,EACd,KAAM,GAAQ,OACd,SAAU,EACV,WAAY,IAAc,OAC1B,aAAc,GAAgB,UAItC,OAAS,GAAI,EAAG,EAAI,EAAa,OAAQ,IACrC,EAAW,UAAU,MAAQ,EAAY,EAAa,KAAO,EAAQ,EAAa,IAClF,EAAW,UAAU,MAAQ,EAAY,EAAa,KAAQ,SAAS,EAAG,CACtE,MAAO,UAAS,EAAG,CACf,KAAK,GAAK,QAAQ,KAEvB,EAAa,IAGpB,OAAS,GAAI,EAAG,EAAI,EAAa,OAAQ,IACrC,EAAW,UAAU,MAAQ,EAAY,EAAa,KAAO,EAAQ,EAAa,IAClF,EAAW,UAAU,MAAQ,EAAY,EAAa,KAAQ,SAAS,EAAG,CACtE,MAAO,UAAS,EAAG,CACf,GAAI,CAAC,EAAU,GACX,KAAM,IAAI,WAAU,EAAI,qBAE5B,KAAK,GAAK,OAAO,KAEtB,EAAa,IAGpB,OAAS,GAAI,EAAG,EAAI,EAAY,OAAQ,IACpC,EAAW,UAAU,MAAQ,EAAY,EAAY,KAAO,EAAQ,EAAY,IAChF,EAAW,UAAU,MAAQ,EAAY,EAAY,KAAQ,SAAS,EAAG,CACrE,MAAO,UAAS,EAAG,CACf,KAAK,GAAK,OAAO,KAEtB,EAAY,IAGnB,MAAO,OC7IX,oBAAC,UAAS,EAAM,EAAS,CACrB,aAIA,AAAI,MAAO,SAAW,YAAc,OAAO,IACvC,OAAO,qBAAsB,CAAC,cAAe,GAC1C,AAAI,MAAO,KAAY,SAC1B,GAAO,QAAU,EAAQ,MAEzB,EAAK,iBAAmB,EAAQ,EAAK,cAE3C,GAAM,SAA0B,EAAY,CAC1C,aAEA,GAAI,GAA8B,eAC9B,EAAyB,iCACzB,EAA4B,8BAEhC,MAAO,CAOH,MAAO,SAAiC,EAAO,CAC3C,GAAI,MAAO,GAAM,YAAe,aAAe,MAAO,GAAM,oBAAuB,YAC/E,MAAO,MAAK,WAAW,GACpB,GAAI,EAAM,OAAS,EAAM,MAAM,MAAM,GACxC,MAAO,MAAK,YAAY,GACrB,GAAI,EAAM,MACb,MAAO,MAAK,gBAAgB,GAE5B,KAAM,IAAI,OAAM,oCAKxB,gBAAiB,SAA2C,EAAS,CAEjE,GAAI,EAAQ,QAAQ,OAAS,GACzB,MAAO,CAAC,GAGZ,GAAI,GAAS,+BACT,EAAQ,EAAO,KAAK,EAAQ,QAAQ,QAAS,KACjD,MAAO,CAAC,EAAM,GAAI,EAAM,IAAM,OAAW,EAAM,IAAM,SAGzD,YAAa,SAAuC,EAAO,CACvD,GAAI,GAAW,EAAM,MAAM,MAAM;AAAA,GAAM,OAAO,SAAS,EAAM,CACzD,MAAO,CAAC,CAAC,EAAK,MAAM,IACrB,MAEH,MAAO,GAAS,IAAI,SAAS,EAAM,CAC/B,AAAI,EAAK,QAAQ,UAAY,IAEzB,GAAO,EAAK,QAAQ,aAAc,QAAQ,QAAQ,+BAAgC,KAEtF,GAAI,GAAgB,EAAK,QAAQ,OAAQ,IAAI,QAAQ,eAAgB,KAIjE,EAAW,EAAc,MAAM,4BAGnC,EAAgB,EAAW,EAAc,QAAQ,EAAS,GAAI,IAAM,EAEpE,GAAI,GAAS,EAAc,MAAM,OAAO,MAAM,GAE1C,EAAgB,KAAK,gBAAgB,EAAW,EAAS,GAAK,EAAO,OACrE,EAAe,EAAO,KAAK,MAAQ,OACnC,EAAW,CAAC,OAAQ,eAAe,QAAQ,EAAc,IAAM,GAAK,OAAY,EAAc,GAElG,MAAO,IAAI,GAAW,CAClB,aAAc,EACd,SAAU,EACV,WAAY,EAAc,GAC1B,aAAc,EAAc,GAC5B,OAAQ,KAEb,OAGP,gBAAiB,SAA2C,EAAO,CAC/D,GAAI,GAAW,EAAM,MAAM,MAAM;AAAA,GAAM,OAAO,SAAS,EAAM,CACzD,MAAO,CAAC,EAAK,MAAM,IACpB,MAEH,MAAO,GAAS,IAAI,SAAS,EAAM,CAM/B,GAJI,EAAK,QAAQ,WAAa,IAC1B,GAAO,EAAK,QAAQ,mDAAoD,QAGxE,EAAK,QAAQ,OAAS,IAAM,EAAK,QAAQ,OAAS,GAElD,MAAO,IAAI,GAAW,CAClB,aAAc,IAGlB,GAAI,GAAoB,6BACpB,EAAU,EAAK,MAAM,GACrB,EAAe,GAAW,EAAQ,GAAK,EAAQ,GAAK,OACpD,EAAgB,KAAK,gBAAgB,EAAK,QAAQ,EAAmB,KAEzE,MAAO,IAAI,GAAW,CAClB,aAAc,EACd,SAAU,EAAc,GACxB,WAAY,EAAc,GAC1B,aAAc,EAAc,GAC5B,OAAQ,KAGjB,OAGP,WAAY,SAAsC,EAAG,CACjD,MAAI,CAAC,EAAE,YAAe,EAAE,QAAQ,QAAQ;AAAA,GAAQ,IAC5C,EAAE,QAAQ,MAAM;AAAA,GAAM,OAAS,EAAE,WAAW,MAAM;AAAA,GAAM,OACjD,KAAK,YAAY,GAChB,EAAE,MAGH,KAAK,aAAa,GAFlB,KAAK,aAAa,IAMjC,YAAa,SAAuC,EAAG,CAKnD,OAJI,GAAS,oCACT,EAAQ,EAAE,QAAQ,MAAM;AAAA,GACxB,EAAS,GAEJ,EAAI,EAAG,EAAM,EAAM,OAAQ,EAAI,EAAK,GAAK,EAAG,CACjD,GAAI,GAAQ,EAAO,KAAK,EAAM,IAC9B,AAAI,GACA,EAAO,KAAK,GAAI,GAAW,CACvB,SAAU,EAAM,GAChB,WAAY,EAAM,GAClB,OAAQ,EAAM,MAK1B,MAAO,IAGX,aAAc,SAAwC,EAAG,CAKrD,OAJI,GAAS,6DACT,EAAQ,EAAE,WAAW,MAAM;AAAA,GAC3B,EAAS,GAEJ,EAAI,EAAG,EAAM,EAAM,OAAQ,EAAI,EAAK,GAAK,EAAG,CACjD,GAAI,GAAQ,EAAO,KAAK,EAAM,IAC9B,AAAI,GACA,EAAO,KACH,GAAI,GAAW,CACX,aAAc,EAAM,IAAM,OAC1B,SAAU,EAAM,GAChB,WAAY,EAAM,GAClB,OAAQ,EAAM,MAM9B,MAAO,IAIX,aAAc,SAAwC,EAAO,CACzD,GAAI,GAAW,EAAM,MAAM,MAAM;AAAA,GAAM,OAAO,SAAS,EAAM,CACzD,MAAO,CAAC,CAAC,EAAK,MAAM,IAAgC,CAAC,EAAK,MAAM,sBACjE,MAEH,MAAO,GAAS,IAAI,SAAS,EAAM,CAC/B,GAAI,GAAS,EAAK,MAAM,KACpB,EAAgB,KAAK,gBAAgB,EAAO,OAC5C,EAAgB,EAAO,SAAW,GAClC,EAAe,EACd,QAAQ,iCAAkC,MAC1C,QAAQ,aAAc,KAAO,OAC9B,EACJ,AAAI,EAAa,MAAM,gBACnB,GAAU,EAAa,QAAQ,qBAAsB,OAEzD,GAAI,GAAQ,IAAY,QAAa,IAAY,4BAC7C,OAAY,EAAQ,MAAM,KAE9B,MAAO,IAAI,GAAW,CAClB,aAAc,EACd,KAAM,EACN,SAAU,EAAc,GACxB,WAAY,EAAc,GAC1B,aAAc,EAAc,GAC5B,OAAQ,KAEb,YCtMR,GC0BM,ICfP,GCRF,GA6FS,GC0ET,GAQE,GAcF,GC9LO,GLFE,GAAY,GACZ,GAAY,GACZ,GAAqB,oECO3B,YAAgB,EAAK,EAAA,CAAA,OAElB,KAAK,GAAO,EAAI,GAAK,EAAM,GAAA,MACP,GASvB,YAAoB,EAAA,CAAA,GACtB,GAAa,EAAK,WAClB,GAAY,EAAW,YAAY,GEVxC,YAA8B,EAAM,EAAO,EAAA,CAAA,GAEzC,GACA,EACA,EAHG,EAAkB,GAAA,IAIjB,IAAK,GACA,AAAL,GAAK,MAAO,EAAM,EAAM,GACd,AAAL,GAAK,MAAO,EAAM,EAAM,GAC5B,EAAgB,GAAK,EAAM,GAAA,GAG7B,UAAU,OAAS,GACtB,GAAgB,SACf,UAAU,OAAS,EAAI,GAAM,KAAK,UAAW,GAAK,GAKjC,AAAA,MAAR,IAAQ,YAAmC,AAArB,EAAK,cAAgB,KAAhB,IAChC,IAAK,GAAK,aAAA,AACV,EAAgB,KADN,QAEb,GAAgB,GAAK,EAAK,aAAa,IAAA,MAKnC,IAAY,EAAM,EAAiB,EAAK,EAAK,MAe9C,YAAqB,EAAM,EAAO,EAAK,EAAK,EAAA,CAAA,GAG5C,GAAQ,CACb,KAAA,EACA,MAAA,EACA,IAAA,EACA,IAAA,EAAA,IACW,KAAA,GACF,KAAA,IACD,EAAA,IACF,KAAA,IAAA,OAKI,IACE,KAAA,IACA,KACZ,YAAA,OAAa,IACU,AAAZ,GAAY,KAAZ,EAAqB,GAAU,GAAA,MAI3B,AAAZ,IAAY,MAAyB,AAAjB,GAAQ,OAAS,MAAM,GAAQ,MAAM,GAEtD,EAGR,aAAgB,CAAA,MACR,CAAE,QAAS,MAGZ,YAAkB,EAAA,CAAA,MACjB,GAAM,SC5EP,YAAmB,EAAO,EAAA,CAAA,KAC3B,MAAQ,EAAA,KACR,QAAU,EAyET,YAAuB,EAAO,EAAA,CAAA,GAClB,AAAd,GAAc,KAAd,MAEI,GAAA,GACJ,GAAc,EAAA,GAAe,EAAA,GAAA,IAAwB,QAAQ,GAAS,GACtE,KAAA,OAGA,GACG,EAAa,EAAA,IAAgB,OAAQ,IAAA,GAG5B,AAFf,GAAU,EAAA,IAAgB,KAEX,MAAwB,AAAhB,EAAA,KAAgB,KAAhB,MAIf,GAAA,IAAA,MASmB,AAAA,OAAd,GAAM,MAAQ,WAAa,GAAc,GAAS,KAuCjE,YAAiC,EAAA,CAAjC,GAGW,GACJ,EAAA,GAHyB,AAA1B,GAAQ,EAAA,KAAkB,MAA4B,AAApB,EAAA,KAAoB,KAAM,CAAA,IAChE,EAAA,IAAa,EAAA,IAAiB,KAAO,KAC5B,EAAI,EAAG,EAAI,EAAA,IAAgB,OAAQ,IAAA,GAE9B,AADT,GAAQ,EAAA,IAAgB,KACf,MAAsB,AAAd,EAAA,KAAc,KAAM,CACxC,EAAA,IAAa,EAAA,IAAiB,KAAO,EAAA,IAAA,MAAA,MAKhC,IAAwB,IAoC1B,YAAuB,EAAA,CAAA,AAAA,EAE1B,EAAA,KACA,GAAA,IAAA,KACD,GAAc,KAAK,IAAA,CAClB,GAAA,OACF,KAAiB,GAAQ,oBAEzB,KAAe,GAAQ,oBACN,IAAO,IAK1B,aAAS,CAAA,OACJ,GACI,GAAA,IAAyB,GAAc,QAC9C,EAAQ,GAAc,KAAK,SAAC,EAAG,EAAA,CAAA,MAAM,GAAA,IAAA,IAAkB,EAAA,IAAA,MACvD,GAAgB,GAGhB,EAAM,KAAK,SAAA,EAAA,CApGb,GAAyB,GAMnB,EACE,EANH,EACH,EACA,EAkGK,EAAA,KAnGL,GADG,GADoB,GAqGQ,GAAA,KAAA,IAlG/B,GAAY,EAAA,MAGR,GAAc,GACZ,GAAW,GAAO,GAAI,IAAA,IACP,EAAA,IAAkB,EAEvC,GACC,EACA,EACA,EACA,EAAA,IAAA,AACA,EAAU,kBADV,OAEoB,AAApB,EAAA,KAAoB,KAAO,CAAC,GAAU,KACtC,EACU,AAAV,GAAU,KAAO,GAAc,GAAS,EACxC,EAAA,KAED,GAAW,EAAa,GAEpB,EAAA,KAAc,GACjB,GAAwB,OEtH3B,YACC,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EAAA,CAVD,GAYK,GAAG,EAAG,EAAU,EAAY,EAAQ,EAAe,EAInD,EAAe,GAAkB,EAAA,KAA6B,GAE9D,EAAoB,EAAY,OAAA,IAEpC,EAAA,IAA2B,GACtB,EAAI,EAAG,EAAI,EAAa,OAAQ,IAAA,GAgDlB,AA5CjB,GAAa,EAAA,IAAyB,GADrB,AAFlB,GAAa,EAAa,KAER,MAA6B,AAAA,MAAd,IAAc,UACH,KAMtB,AAAA,MAAd,IAAc,UACA,AAAA,MAAd,IAAc,UAEA,AAAA,MAAd,IAAc,SAEsB,GAC1C,KACA,EACA,KACA,KACA,GAES,MAAM,QAAQ,GACmB,GAC1C,GACA,CAAE,SAAU,GACZ,KACA,KACA,MAES,EAAA,IAAoB,EAKa,GAC1C,EAAW,KACX,EAAW,MACX,EAAW,IACX,KACA,EAAA,KAG0C,IAK1B,KAL0B,CAAA,GAS5C,EAAA,GAAqB,EACrB,EAAA,IAAoB,EAAA,IAAwB,EAS9B,AAHd,GAAW,EAAY,MAGT,MACZ,GACA,EAAW,KAAO,EAAS,KAC3B,EAAW,OAAS,EAAS,KAE9B,EAAY,GAAA,WAAK,KAIZ,EAAI,EAAG,EAAI,EAAmB,IAAK,CAAA,GACvC,GAAW,EAAY,KAKtB,EAAW,KAAO,EAAS,KAC3B,EAAW,OAAS,EAAS,KAC5B,CACD,EAAY,GAAA,OAAK,MAGlB,EAAW,KAOb,GACC,EACA,EALD,EAAW,GAAY,GAOtB,EACA,EACA,EACA,EACA,EACA,GAGD,EAAS,EAAA,IAEJ,GAAI,EAAW,MAAQ,EAAS,KAAO,GACtC,IAAM,GAAO,IACd,EAAS,KAAK,EAAK,KAAK,EAAS,IAAK,KAAM,GAChD,EAAK,KAAK,EAAG,EAAA,KAAyB,EAAQ,IAGjC,AAAV,GAAU,KACQ,CAAjB,GAAiB,MACpB,GAAgB,GAIU,AAAA,MAAnB,GAAW,MAAQ,YAC1B,EAAA,MAAyB,EAAA,IAEzB,EAAA,IAAsB,EAAS,GAC9B,EACA,EACA,GAGD,EAAS,GACR,EACA,EACA,EACA,EACA,EACA,GAIgC,AAAA,MAAvB,GAAe,MAAQ,YAQjC,GAAA,IAA0B,IAG3B,GACA,EAAA,KAAiB,GACjB,EAAO,YAAc,GAIrB,GAAS,GAAc,IAAA,IAIzB,EAAA,IAAsB,EAGjB,EAAI,EAAmB,KACL,AAAlB,EAAY,IAAM,MAEU,CAAA,MAAvB,GAAe,MAAQ,YACP,AAAvB,EAAY,GAAA,KAAW,MACvB,EAAY,GAAA,KAAW,EAAA,KAKvB,GAAA,IAA0B,GAAc,EAAgB,EAAI,IAG7D,GAAQ,EAAY,GAAI,EAAY,KAAA,GAKlC,EAAA,IACE,EAAI,EAAG,EAAI,EAAK,OAAQ,IAC5B,GAAS,EAAK,GAAI,EAAA,EAAO,GAAI,EAAA,EAAO,IAKvC,YAAyB,EAAY,EAAQ,EAAA,CAAA,OAKvC,GAHD,EAAI,EAAA,IACJ,EAAM,EACH,GAAK,EAAM,EAAE,OAAQ,IAAA,AACvB,GAAQ,EAAE,KAMb,GAAA,GAAgB,EAGf,EADwB,AAAA,MAAd,GAAM,MAAQ,WACf,GAAgB,EAAO,EAAQ,GAE/B,GACR,EACA,EACA,EACA,EACA,EAAA,IACA,IAAA,MAMG,GAsBR,YACC,EACA,EACA,EACA,EACA,EACA,EAAA,CAND,GAQK,GAuBG,EAAiB,EAAA,GAAA,AAtBpB,EAAA,MAsBoB,OAlBvB,EAAU,EAAA,IAMV,EAAA,IAAA,eAEY,AAAZ,GAAY,MACZ,GAAU,GACW,AAArB,EAAO,YAAc,KAErB,EAAO,GAAc,AAAV,GAAU,MAAQ,EAAO,aAAe,EAClD,EAAU,YAAY,GACtB,EAAU,SACJ,CAAA,IAGD,EAAS,EAAQ,EAAI,EACxB,GAAS,EAAO,cAAgB,EAAI,EAAY,OACjD,GAAK,EAAA,GAED,GAAU,EAAA,QAIf,EAAU,aAAa,EAAQ,GAC/B,EAAU,EAAA,MAAA,AAOR,KAPQ,OAQF,EAEA,EAAO,YC9TX,YAAmB,EAAK,EAAU,EAAU,EAAO,EAAA,CAAA,GACrD,GAAA,IAEC,IAAK,GACC,AAAN,IAAM,YAAoB,AAAN,IAAM,OAAW,IAAK,IAC7C,GAAY,EAAK,EAAG,KAAM,EAAS,GAAI,GAAA,IAIpC,IAAK,GAEN,GAAiC,AAAA,MAAf,GAAS,IAAM,YAC7B,AAAN,IAAM,YACA,AAAN,IAAM,OACA,AAAN,IAAM,SACA,AAAN,IAAM,WACN,EAAS,KAAO,EAAS,IAEzB,GAAY,EAAK,EAAG,EAAS,GAAI,EAAS,GAAI,GAKjD,YAAkB,EAAO,EAAK,EAAA,CACd,AAAX,EAAI,KAAO,IACd,EAAM,YAAY,EAAK,GAEvB,EAAM,GADa,AAAT,GAAS,KACN,GACa,AAAA,MAAT,IAAS,UAAY,GAAmB,KAAK,GACjD,EAEA,EAAQ,KAYhB,YAAqB,EAAK,EAAM,EAAO,EAAU,EAAA,CAAjD,GACF,GAEJ,EAAG,GAAa,AAAT,IAAS,QAAT,GACc,AAAA,MAAT,IAAS,SACnB,EAAI,MAAM,QAAU,MACd,CAAA,GACiB,AAAA,MAAZ,IAAY,UACtB,GAAI,MAAM,QAAU,EAAW,IAG5B,EAAA,IACE,IAAQ,GACN,GAAS,IAAQ,IACtB,GAAS,EAAI,MAAO,EAAM,IAAA,GAKzB,EAAA,IACE,IAAQ,GACP,GAAY,EAAM,KAAU,EAAS,IACzC,GAAS,EAAI,MAAO,EAAM,EAAM,YAOhB,AAAZ,EAAK,KAAO,KAAmB,AAAZ,EAAK,KAAO,IACvC,EAAa,IAAU,GAAO,EAAK,QAAQ,WAAY,KAGxB,EAA3B,EAAK,eAAiB,GAAY,EAAK,cAAc,MAAM,GACnD,EAAK,MAAM,GAElB,EAAI,GAAY,GAAI,EAAa,IACtC,EAAI,EAAW,EAAO,GAAc,EAEhC,EACE,GAEJ,EAAI,iBAAiB,EADL,EAAa,GAAoB,GACb,GAIrC,EAAI,oBAAoB,EADR,EAAa,GAAoB,GACV,WAErB,AAAT,IAAS,0BAA2B,CAAA,GAC1C,EAIH,EAAO,EAAK,QAAQ,aAAc,KAAK,QAAQ,SAAU,aAEhD,AAAT,IAAS,QACA,AAAT,IAAS,QACA,AAAT,IAAS,QAGA,AAAT,IAAS,YACA,AAAT,IAAS,YACT,IAAQ,GAAA,GAAA,CAGP,EAAI,GAAiB,AAAT,GAAS,KAAO,GAAK,EAAA,cAGzB,EAAP,EAUkB,AAAA,MAAV,IAAU,YAGX,CAAT,GAAS,MAAT,CACC,IADD,IACiC,AAAZ,EAAK,KAAO,KAAmB,AAAZ,EAAK,KAAO,KAEpD,EAAI,aAAa,EAAM,GAEvB,EAAI,gBAAgB,KAUvB,YAAoB,EAAA,CAAA,KACd,EAAW,EAAE,KAAA,IAAc,GAAQ,MAAQ,GAAQ,MAAM,GAAK,GAGpE,YAA2B,EAAA,CAAA,KACrB,EAAW,EAAE,KAAA,IAAa,GAAQ,MAAQ,GAAQ,MAAM,GAAK,GCpInE,YACC,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EAAA,CATD,GAWK,GAoBE,EAAG,EAAO,EAAU,EAAU,EAAU,EACxC,EAKA,EACA,EAqIA,EA/JL,EAAU,EAAS,KAAA,GAAA,AAIhB,EAAS,cAJO,OAIoB,MAAO,MAGpB,AAAvB,EAAA,KAAuB,MAC1B,GAAc,EAAA,IACd,EAAS,EAAA,IAAgB,EAAA,IAEzB,EAAA,IAAsB,KACtB,EAAoB,CAAC,IAGjB,GAAM,GAAA,MAAgB,EAAI,GAAA,GAAA,CAG9B,EAAO,GAAsB,AAAA,MAAX,IAAW,WAAY,CAAA,GAEpC,EAAW,EAAS,MAKpB,EADJ,GAAM,EAAQ,cACQ,EAAc,EAAA,KAChC,EAAmB,EACpB,EACC,EAAS,MAAM,MACf,EAAA,GACD,EAGC,EAAA,IAEH,EADA,GAAI,EAAA,IAAsB,EAAA,KAAA,GAC0B,EAAA,IAGhD,cAAe,IAAW,EAAQ,UAAU,OAE/C,EAAA,IAAsB,EAAI,GAAI,GAAQ,EAAU,GAGhD,GAAA,IAAsB,EAAI,GAAI,IAAU,EAAU,GAClD,EAAE,YAAc,EAChB,EAAE,OAAS,IAER,GAAU,EAAS,IAAI,GAE3B,EAAE,MAAQ,EACL,EAAE,OAAO,GAAE,MAAQ,IACxB,EAAE,QAAU,EACZ,EAAA,IAAmB,EACnB,EAAQ,EAAA,IAAA,GACR,EAAA,IAAqB,IAIF,AAAhB,EAAA,KAAgB,MACnB,GAAA,IAAe,EAAE,OAEsB,AAApC,EAAQ,0BAA4B,MACnC,GAAA,KAAgB,EAAE,OACrB,GAAA,IAAe,GAAO,GAAI,EAAA,MAG3B,GACC,EAAA,IACA,EAAQ,yBAAyB,EAAU,EAAA,OAI7C,EAAW,EAAE,MACb,EAAW,EAAE,MAGT,EAEkC,AAApC,EAAQ,0BAA4B,MACZ,AAAxB,EAAE,oBAAsB,MAExB,EAAE,qBAGwB,AAAvB,EAAE,mBAAqB,MAC1B,EAAA,IAAmB,KAAK,EAAE,uBAErB,CAAA,GAE+B,AAApC,EAAQ,0BAA4B,MACpC,IAAa,GACkB,AAA/B,EAAE,2BAA6B,MAE/B,EAAE,0BAA0B,EAAU,GAAA,CAIpC,EAAA,KAC0B,AAA3B,EAAE,uBAAyB,MAAzB,AACF,EAAE,sBACD,EACA,EAAA,IACA,KAJC,IAMH,EAAA,MAAuB,EAAA,IACtB,CACD,EAAE,MAAQ,EACV,EAAE,MAAQ,EAAA,IAEN,EAAA,MAAuB,EAAA,KAAoB,GAAA,IAAA,IAC/C,EAAA,IAAW,EACX,EAAA,IAAgB,EAAA,IAChB,EAAA,IAAqB,EAAA,IACrB,EAAA,IAAmB,QAAQ,SAAA,EAAA,CACtB,GAAO,GAAA,GAAgB,KAExB,EAAA,IAAmB,QACtB,EAAY,KAAK,GAAA,QAMU,AAAzB,EAAE,qBAAuB,MAC5B,EAAE,oBAAoB,EAAU,EAAA,IAAc,GAGnB,AAAxB,EAAE,oBAAsB,MAC3B,EAAA,IAAmB,KAAK,UAAA,CACvB,EAAE,mBAAmB,EAAU,EAAU,KAK5C,EAAE,QAAU,EACZ,EAAE,MAAQ,EACV,EAAE,MAAQ,EAAA,IAEL,GAAM,GAAA,MAAkB,EAAI,GAEjC,EAAA,IAAA,GACA,EAAA,IAAW,EACX,EAAA,IAAe,EAEf,EAAM,EAAE,OAAO,EAAE,MAAO,EAAE,MAAO,EAAE,SAGnC,EAAE,MAAQ,EAAA,IAEe,AAArB,EAAE,iBAAmB,MACxB,GAAgB,GAAO,GAAO,GAAI,GAAgB,EAAE,oBAGhD,GAAsC,AAA7B,EAAE,yBAA2B,MAC1C,GAAW,EAAE,wBAAwB,EAAU,IAK5C,EADI,AAAP,GAAO,MAAQ,EAAI,OAAS,IAAuB,AAAX,EAAI,KAAO,KACZ,EAAI,MAAM,SAAW,EAE7D,GACC,EACA,MAAM,QAAQ,GAAgB,EAAe,CAAC,GAC9C,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAGD,EAAE,KAAO,EAAA,IAGT,EAAA,IAAsB,KAElB,EAAA,IAAmB,QACtB,EAAY,KAAK,GAGd,GACH,GAAA,IAAkB,EAAA,GAAyB,MAG5C,EAAA,IAAA,OAEqB,AAArB,IAAqB,MACrB,EAAA,MAAuB,EAAA,IAEvB,GAAA,IAAqB,EAAA,IACrB,EAAA,IAAgB,EAAA,KAEhB,EAAA,IAAgB,GACf,EAAA,IACA,EACA,EACA,EACA,EACA,EACA,EACA,GAAA,AAIG,GAAM,GAAQ,SAAS,EAAI,SACxB,EAAP,CACD,EAAA,IAAqB,KAEjB,IAAoC,AAArB,GAAqB,OACvC,GAAA,IAAgB,EAChB,EAAA,IAAA,CAAA,CAAwB,EACxB,EAAkB,EAAkB,QAAQ,IAAW,MAIxD,GAAA,IAAoB,EAAG,EAAU,IAS5B,YAAoB,EAAa,EAAA,CACnC,GAAA,KAAiB,GAAA,IAAgB,EAAM,GAE3C,EAAY,KAAK,SAAA,EAAA,CAAA,GAAA,CAGf,EAAc,EAAA,IACd,EAAA,IAAqB,GACrB,EAAY,KAAK,SAAA,EAAA,CAEhB,EAAG,KAAK,WAED,EAAP,CACD,GAAA,IAAoB,EAAG,EAAA,QAmB1B,YACC,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EAAA,CARD,GAoBS,GAsDH,EACA,EAjED,EAAW,EAAS,MACpB,EAAW,EAAS,MACpB,EAAW,EAAS,KACpB,EAAI,EAAA,GAGS,AAAb,IAAa,OAAO,GAAA,IAEC,AAArB,GAAqB,MAArB,KACI,EAAI,EAAkB,OAAQ,IAAA,GAC9B,GAAQ,EAAkB,KAO/B,gBAAkB,IAAA,CAAA,CAAY,GAC7B,GAAW,EAAM,YAAc,EAA8B,AAAnB,EAAM,WAAa,GAC7D,CACD,EAAM,EACN,EAAkB,GAAK,KAAA,OAAA,GAMf,AAAP,GAAO,KAAM,CAAA,GACC,AAAb,IAAa,KAAb,MAEI,UAAS,eAAe,GAI/B,EADG,EACG,SAAS,gBACd,6BAEA,GAGK,SAAS,cAEd,EACA,EAAS,IAAM,GAKjB,EAAoB,KAEpB,EAAA,GAAc,GAGE,AAAb,IAAa,KAEZ,IAAa,GAAc,GAAe,EAAI,OAAS,GAC1D,GAAI,KAAO,OAEN,CAAA,GAEN,EAAoB,GAAqB,GAAM,KAAK,EAAI,YAIpD,EAFJ,GAAW,EAAS,OAAS,IAEN,wBACnB,EAAU,EAAS,wBAAA,CAIlB,EAAa,CAAA,GAGQ,AAArB,GAAqB,KAArB,IACH,EAAW,GACN,EAAI,EAAG,EAAI,EAAI,WAAW,OAAQ,IACtC,EAAS,EAAI,WAAW,GAAG,MAAQ,EAAI,WAAW,GAAG,MAAA,AAInD,IAAW,IAGZ,IACE,IAAW,EAAA,QAAkB,EAAA,QAC/B,EAAA,SAAmB,EAAI,YAExB,GAAI,UAAa,GAAW,EAAA,QAAmB,KAAA,GAKlD,GAAU,EAAK,EAAU,EAAU,EAAO,GAGtC,EACH,EAAA,IAAqB,WAErB,EAAI,EAAS,MAAM,SACnB,GACC,EACA,MAAM,QAAQ,GAAK,EAAI,CAAC,GACxB,EACA,EACA,EACA,GAAsB,AAAb,IAAa,gBACtB,EACA,EACA,EACG,EAAkB,GAClB,EAAA,KAAsB,GAAc,EAAU,GACjD,GAIwB,AAArB,GAAqB,KAArB,IACE,EAAI,EAAkB,OAAQ,KACN,AAAxB,EAAkB,IAAM,MAAM,GAAW,EAAkB,IAM7D,GAEH,UAAW,IAAA,AACV,GAAI,EAAS,SADH,QAMV,KAAM,EAAS,OACf,IAAM,EAAI,OACI,AAAb,IAAa,YAAb,CAA4B,IAE9B,GAAY,EAAK,QAAS,EAAG,EAAS,MAAA,IAGtC,WAAa,IAAA,AACZ,GAAI,EAAS,WADD,QAEb,IAAM,EAAI,SAEV,GAAY,EAAK,UAAW,EAAG,EAAS,QAAA,KAAS,MAK7C,GASR,YAAyB,EAAK,EAAO,EAAA,CAAA,GAAA,CAEjB,AAAA,MAAP,IAAO,WAAY,EAAI,GAC7B,EAAI,QAAU,QACX,EAAP,CACD,GAAA,IAAoB,EAAG,IAYzB,YAAwB,EAAO,EAAa,EAAA,CAA5C,GACK,GAoBM,EAAA,GAnBN,GAAQ,SAAS,GAAQ,QAAQ,GAEhC,GAAI,EAAM,MACT,GAAE,SAAW,EAAE,UAAY,EAAA,KAAY,GAAS,EAAG,KAAM,IAGjC,AAAzB,GAAI,EAAA,MAAqB,KAAM,CAAA,GAC/B,EAAE,qBAAA,GAAA,CAEJ,EAAE,6BACM,EAAP,CACD,GAAA,IAAoB,EAAG,GAIzB,EAAE,KAAO,EAAA,IAAe,KAAA,GAGpB,EAAI,EAAA,IAAA,IACC,EAAI,EAAG,EAAI,EAAE,OAAQ,IACzB,EAAE,IACL,GAAQ,EAAE,GAAI,EAAkC,AAAA,MAAd,GAAM,MAAQ,YAK9C,GAA4B,AAAd,EAAA,KAAc,MAAM,GAAW,EAAA,KAIlD,EAAA,IAAa,EAAA,IAAA,OAId,YAAkB,EAAO,EAAO,EAAA,CAAA,MACxB,MAAK,YAAY,EAAO,GCpfhC,YAAuB,EAAO,EAAW,EAAA,CAAzC,GAMK,GAOA,EAUA,EAtBA,GAAA,IAAe,GAAA,GAAc,EAAO,GAYpC,EAPA,GAAqC,AAAA,MAAhB,IAAgB,YAQtC,KACC,GAAe,EAAA,KAA0B,EAAA,IAQzC,EAAc,GAClB,GACC,EARD,EAAA,EACG,GAAe,GACjB,GAAA,IACa,GAAc,GAAU,KAAM,CAAC,IAS5C,GAAY,GACZ,GAAA,AACA,EAAU,kBADV,OACU,CACT,GAAe,EACb,CAAC,GACD,EACA,KACA,EAAU,WACV,GAAM,KAAK,EAAU,YACrB,KACH,EAAA,CACC,GAAe,EACb,EACA,EACA,EAAA,IACA,EAAU,WACb,GAID,GAAW,EAAa,GRrCZ,GAAQ,GAAU,MCfzB,GAAU,CAAA,ISJT,SAAqB,EAAO,EAAA,CAAA,OAE9B,GAAW,EAAM,EAEb,EAAQ,EAAA,IAAA,GACV,GAAY,EAAA,MAAA,CAAsB,EAAA,GAAA,GAAA,CAAA,GAErC,GAAO,EAAU,cAE4B,AAAjC,EAAK,0BAA4B,MAC5C,GAAU,SAAS,EAAK,yBAAyB,IACjD,EAAU,EAAA,KAGwB,AAA/B,EAAU,mBAAqB,MAClC,GAAU,kBAAkB,GAC5B,EAAU,EAAA,KAIP,EAAA,MACK,GAAA,IAA0B,QAE3B,EAAP,CACD,EAAQ,EAAA,KAKL,KRjCH,GAAU,EA6FD,GAAiB,SAAA,EAAA,CAAA,MACpB,AAAT,IAAS,MAAT,AAAiB,EAAM,cAAvB,QCvED,GAAU,UAAU,SAAW,SAAS,EAAQ,EAAA,CAAA,GAE3C,GAEH,EADsB,AAAnB,KAAA,KAAmB,MAAQ,KAAA,MAAoB,KAAK,MACnD,KAAA,IAEA,KAAA,IAAkB,GAAO,GAAI,KAAK,OAGlB,AAAA,MAAV,IAAU,YAGpB,GAAS,EAAO,GAAO,GAAI,GAAI,KAAK,QAGjC,GACH,GAAO,EAAG,GAIG,AAAV,GAAU,MAEV,KAAA,KACC,IAAU,KAAA,IAAsB,KAAK,GACzC,GAAc,QAUhB,GAAU,UAAU,YAAc,SAAS,EAAA,CACtC,KAAA,KAAA,MAAA,IAAA,GAKC,GAAU,KAAA,IAAsB,KAAK,GACzC,GAAc,QAchB,GAAU,UAAU,OAAS,GAyFzB,GAAgB,GAQd,GACa,AAAA,MAAX,UAAW,WACf,QAAQ,UAAU,KAAK,KAAK,QAAQ,WACpC,WA2CJ,GAAA,IAAyB,EC9Nd,GAAI,EOAf,GAAI,IAAgB,CAClB,EAAG,sNACH,EAAG,+CACH,EAAG,OACH,OAAQ,yEACR,WAAY,kBAKV,GAAuB,8KAEvB,GAAa,CACf,EAAG,GACH,UAAW,GAAuB,iBAClC,EAAG,GAAuB,4CAGxB,GAA4B,kBAS5B,GAA+B,+qIAC/B,GAA0B,8jFAE1B,GAA0B,GAAI,QAAO,IAAM,GAA+B,KAC1E,GAAqB,GAAI,QAAO,IAAM,GAA+B,GAA0B,KAEnG,GAA+B,GAA0B,KASzD,GAAI,IAA6B,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,IAAI,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,IAAI,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,IAAI,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,IAAI,GAAG,IAAI,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,IAAI,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,KAAK,GAAG,GAAG,KAAK,KAAK,IAAI,KAAK,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,KAAK,EAAE,KAAK,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,GAAG,EAAE,GAAG,EAAE,EAAE,IAAI,KAAK,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,KAAK,GAAG,IAAI,GAAG,GAAG,EAAE,GAAG,EAAE,IAAI,GAAG,GAAG,GAAG,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,GAAG,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,MAAM,GAAG,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,KAAK,KAAK,IAAI,KAAK,MAG55C,GAAwB,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,GAAG,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,GAAG,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,KAKpsB,YAAuB,EAAM,EAAK,CAEhC,OADI,GAAM,MACD,EAAI,EAAG,EAAI,EAAI,OAAQ,GAAK,EAAG,CAEtC,GADA,GAAO,EAAI,GACP,EAAM,EAAQ,MAAO,GAEzB,GADA,GAAO,EAAI,EAAI,GACX,GAAO,EAAQ,MAAO,IAM9B,YAA2B,EAAM,EAAQ,CACvC,MAAI,GAAO,GAAa,IAAS,GAC7B,EAAO,GAAa,GACpB,EAAO,GAAa,IAAS,GAC7B,EAAO,IAAc,GACrB,GAAQ,MAAiB,GAAQ,KAAQ,GAAwB,KAAK,OAAO,aAAa,IAC1F,IAAW,GAAgB,GACxB,GAAc,EAAM,IAK7B,YAA0B,EAAM,EAAQ,CACtC,MAAI,GAAO,GAAa,IAAS,GAC7B,EAAO,GAAa,GACpB,EAAO,GAAa,GACpB,EAAO,GAAa,GACpB,EAAO,GAAa,IAAS,GAC7B,EAAO,IAAc,GACrB,GAAQ,MAAiB,GAAQ,KAAQ,GAAmB,KAAK,OAAO,aAAa,IACrF,IAAW,GAAgB,GACxB,GAAc,EAAM,KAA+B,GAAc,EAAM,IA0BhF,GAAI,IAAY,SAAmB,EAAO,EAAM,CAC9C,AAAK,IAAS,QAAS,GAAO,IAE9B,KAAK,MAAQ,EACb,KAAK,QAAU,EAAK,QACpB,KAAK,WAAa,CAAC,CAAC,EAAK,WACzB,KAAK,WAAa,CAAC,CAAC,EAAK,WACzB,KAAK,OAAS,CAAC,CAAC,EAAK,OACrB,KAAK,SAAW,CAAC,CAAC,EAAK,SACvB,KAAK,OAAS,CAAC,CAAC,EAAK,OACrB,KAAK,QAAU,CAAC,CAAC,EAAK,QACtB,KAAK,MAAQ,EAAK,OAAS,KAC3B,KAAK,cAAgB,MAGvB,YAAe,EAAM,EAAM,CACzB,MAAO,IAAI,IAAU,EAAM,CAAC,WAAY,GAAM,MAAO,IAEvD,GAAI,IAAa,CAAC,WAAY,IAAO,GAAa,CAAC,WAAY,IAI3D,GAAW,GAGf,WAAY,EAAM,EAAS,CACzB,MAAK,KAAY,QAAS,GAAU,IAEpC,EAAQ,QAAU,EACX,GAAS,GAAQ,GAAI,IAAU,EAAM,GAG9C,GAAI,GAAU,CACZ,IAAK,GAAI,IAAU,MAAO,IAC1B,OAAQ,GAAI,IAAU,SAAU,IAChC,OAAQ,GAAI,IAAU,SAAU,IAChC,KAAM,GAAI,IAAU,OAAQ,IAC5B,UAAW,GAAI,IAAU,YAAa,IACtC,IAAK,GAAI,IAAU,OAGnB,SAAU,GAAI,IAAU,IAAK,CAAC,WAAY,GAAM,WAAY,KAC5D,SAAU,GAAI,IAAU,KACxB,OAAQ,GAAI,IAAU,IAAK,CAAC,WAAY,GAAM,WAAY,KAC1D,OAAQ,GAAI,IAAU,KACtB,OAAQ,GAAI,IAAU,IAAK,CAAC,WAAY,GAAM,WAAY,KAC1D,OAAQ,GAAI,IAAU,KACtB,MAAO,GAAI,IAAU,IAAK,IAC1B,KAAM,GAAI,IAAU,IAAK,IACzB,MAAO,GAAI,IAAU,IAAK,IAC1B,IAAK,GAAI,IAAU,KACnB,SAAU,GAAI,IAAU,IAAK,IAC7B,YAAa,GAAI,IAAU,MAC3B,MAAO,GAAI,IAAU,KAAM,IAC3B,SAAU,GAAI,IAAU,YACxB,gBAAiB,GAAI,IAAU,mBAC/B,SAAU,GAAI,IAAU,MAAO,IAC/B,UAAW,GAAI,IAAU,IAAK,IAC9B,aAAc,GAAI,IAAU,KAAM,CAAC,WAAY,GAAM,WAAY,KAgBjE,GAAI,GAAI,IAAU,IAAK,CAAC,WAAY,GAAM,SAAU,KACpD,OAAQ,GAAI,IAAU,KAAM,CAAC,WAAY,GAAM,SAAU,KACzD,OAAQ,GAAI,IAAU,QAAS,CAAC,OAAQ,GAAM,QAAS,GAAM,WAAY,KACzE,OAAQ,GAAI,IAAU,MAAO,CAAC,WAAY,GAAM,OAAQ,GAAM,WAAY,KAC1E,UAAW,GAAM,KAAM,GACvB,WAAY,GAAM,KAAM,GACxB,UAAW,GAAM,IAAK,GACtB,WAAY,GAAM,IAAK,GACvB,WAAY,GAAM,IAAK,GACvB,SAAU,GAAM,gBAAiB,GACjC,WAAY,GAAM,YAAa,GAC/B,SAAU,GAAM,YAAa,GAC7B,QAAS,GAAI,IAAU,MAAO,CAAC,WAAY,GAAM,MAAO,EAAG,OAAQ,GAAM,WAAY,KACrF,OAAQ,GAAM,IAAK,IACnB,KAAM,GAAM,IAAK,IACjB,MAAO,GAAM,IAAK,IAClB,SAAU,GAAI,IAAU,KAAM,CAAC,WAAY,KAC3C,SAAU,GAAM,KAAM,GAGtB,OAAQ,EAAG,SACX,MAAO,EAAG,OAAQ,IAClB,OAAQ,EAAG,SACX,UAAW,EAAG,YACd,UAAW,EAAG,YACd,SAAU,EAAG,UAAW,IACxB,IAAK,EAAG,KAAM,CAAC,OAAQ,GAAM,WAAY,KACzC,MAAO,EAAG,OAAQ,IAClB,SAAU,EAAG,WACb,KAAM,EAAG,MAAO,CAAC,OAAQ,KACzB,UAAW,EAAG,WAAY,IAC1B,IAAK,EAAG,MACR,QAAS,EAAG,SAAU,IACtB,QAAS,EAAG,UACZ,OAAQ,EAAG,QAAS,IACpB,KAAM,EAAG,OACT,KAAM,EAAG,OACT,OAAQ,EAAG,SACX,OAAQ,EAAG,QAAS,CAAC,OAAQ,KAC7B,MAAO,EAAG,QACV,KAAM,EAAG,MAAO,CAAC,WAAY,GAAM,WAAY,KAC/C,MAAO,EAAG,OAAQ,IAClB,OAAQ,EAAG,QAAS,IACpB,OAAQ,EAAG,QAAS,IACpB,SAAU,EAAG,UAAW,IACxB,QAAS,EAAG,UACZ,QAAS,EAAG,SAAU,IACtB,MAAO,EAAG,OAAQ,IAClB,MAAO,EAAG,OAAQ,IAClB,OAAQ,EAAG,QAAS,IACpB,IAAK,EAAG,KAAM,CAAC,WAAY,GAAM,MAAO,IACxC,YAAa,EAAG,aAAc,CAAC,WAAY,GAAM,MAAO,IACxD,QAAS,EAAG,SAAU,CAAC,WAAY,GAAM,OAAQ,GAAM,WAAY,KACnE,MAAO,EAAG,OAAQ,CAAC,WAAY,GAAM,OAAQ,GAAM,WAAY,KAC/D,QAAS,EAAG,SAAU,CAAC,WAAY,GAAM,OAAQ,GAAM,WAAY,MAMjE,GAAY,yBACZ,GAAa,GAAI,QAAO,GAAU,OAAQ,KAE9C,YAAmB,EAAM,CACvB,MAAO,KAAS,IAAM,IAAS,IAAM,IAAS,MAAU,IAAS,KAGnE,YAAuB,EAAM,EAAM,EAAK,CACtC,AAAK,IAAQ,QAAS,GAAM,EAAK,QAEjC,OAAS,GAAI,EAAM,EAAI,EAAK,IAAK,CAC/B,GAAI,GAAO,EAAK,WAAW,GAC3B,GAAI,GAAU,GACV,MAAO,GAAI,EAAM,GAAK,IAAS,IAAM,EAAK,WAAW,EAAI,KAAO,GAAK,EAAI,EAAI,EAAI,EAEvF,MAAO,GAGT,GAAI,IAAqB,gDAErB,GAAiB,gCAEjB,GAAM,OAAO,UACb,GAAiB,GAAI,eACrB,GAAW,GAAI,SAEf,GAAS,OAAO,QAAW,SAAU,EAAK,EAAU,CAAE,MACxD,IAAe,KAAK,EAAK,IAGvB,GAAU,MAAM,SAAY,SAAU,EAAK,CAAE,MAC/C,IAAS,KAAK,KAAS,kBAGzB,YAAqB,EAAO,CAC1B,MAAO,IAAI,QAAO,OAAS,EAAM,QAAQ,KAAM,KAAO,MAGxD,GAAI,IAAgB,+EAKhB,GAAW,SAAkB,EAAM,EAAK,CAC1C,KAAK,KAAO,EACZ,KAAK,OAAS,GAGhB,GAAS,UAAU,OAAS,SAAiB,EAAG,CAC9C,MAAO,IAAI,IAAS,KAAK,KAAM,KAAK,OAAS,IAG/C,GAAI,IAAiB,SAAwB,EAAG,EAAO,EAAK,CAC1D,KAAK,MAAQ,EACb,KAAK,IAAM,EACP,EAAE,aAAe,MAAQ,MAAK,OAAS,EAAE,aAS/C,YAAqB,EAAO,EAAQ,CAClC,OAAS,GAAO,EAAG,EAAM,IAAK,CAC5B,GAAI,GAAY,GAAc,EAAO,EAAK,GAC1C,GAAI,EAAY,EAAK,MAAO,IAAI,IAAS,EAAM,EAAS,GACxD,EAAE,EACF,EAAM,GAOV,GAAI,IAAiB,CAOnB,YAAa,KAIb,WAAY,SAMZ,oBAAqB,KAGrB,gBAAiB,KAKjB,cAAe,KAGf,2BAA4B,GAI5B,4BAA6B,GAI7B,0BAA2B,KAG3B,wBAAyB,KAGzB,cAAe,GAKf,UAAW,GAMX,QAAS,KAWT,UAAW,KASX,OAAQ,GAMR,QAAS,KAGT,WAAY,KAGZ,iBAAkB,KAGlB,eAAgB,IAKd,GAAyB,GAE7B,YAAoB,EAAM,CACxB,GAAI,GAAU,GAEd,OAAS,KAAO,IACZ,EAAQ,GAAO,GAAQ,GAAO,EAAM,GAAO,EAAK,GAAO,GAAe,GAiB1E,GAfA,AAAI,EAAQ,cAAgB,SAC1B,EAAQ,YAAc,IACjB,AAAI,EAAQ,aAAe,KAC5B,EAAC,IAA0B,MAAO,UAAY,UAAY,QAAQ,MACpE,IAAyB,GACzB,QAAQ,KAAK;AAAA,iEAEf,EAAQ,YAAc,IACb,EAAQ,aAAe,MAChC,GAAQ,aAAe,MAGrB,EAAQ,eAAiB,MACzB,GAAQ,cAAgB,EAAQ,YAAc,GAE9C,GAAQ,EAAQ,SAAU,CAC5B,GAAI,GAAS,EAAQ,QACrB,EAAQ,QAAU,SAAU,EAAO,CAAE,MAAO,GAAO,KAAK,IAE1D,MAAI,IAAQ,EAAQ,YAChB,GAAQ,UAAY,GAAY,EAAS,EAAQ,YAE9C,EAGT,YAAqB,EAAS,EAAO,CACnC,MAAO,UAAS,EAAO,EAAM,EAAO,EAAK,EAAU,EAAQ,CACzD,GAAI,GAAU,CACZ,KAAM,EAAQ,QAAU,OACxB,MAAO,EACP,MAAO,EACP,IAAK,GAEP,AAAI,EAAQ,WACR,GAAQ,IAAM,GAAI,IAAe,KAAM,EAAU,IACjD,EAAQ,QACR,GAAQ,MAAQ,CAAC,EAAO,IAC5B,EAAM,KAAK,IAKf,GACI,IAAY,EACZ,GAAiB,EACjB,GAAc,EACd,GAAkB,EAClB,GAAc,GACd,GAAqB,GACrB,GAAc,GACd,GAAqB,IACrB,GAA2B,IAC3B,GAAY,GAAY,GAAiB,GAE7C,YAAuB,EAAO,EAAW,CACvC,MAAO,IAAkB,GAAQ,GAAc,GAAM,GAAY,GAAkB,GAIrF,GACI,IAAY,EACZ,GAAW,EACX,GAAe,EACf,GAAgB,EAChB,GAAoB,EACpB,GAAe,EAEf,GAAS,SAAgB,EAAS,EAAO,EAAU,CACrD,KAAK,QAAU,EAAU,GAAW,GACpC,KAAK,WAAa,EAAQ,WAC1B,KAAK,SAAW,GAAY,GAAW,EAAQ,aAAe,EAAI,EAAI,EAAQ,aAAe,SAAW,UAAY,IACpH,GAAI,GAAW,GACf,AAAI,EAAQ,gBAAkB,IAC5B,GAAW,GAAc,EAAQ,aAAe,EAAI,EAAI,EAAQ,cAAgB,EAAI,EAAI,GACpF,EAAQ,aAAe,UAAY,IAAY,WAErD,KAAK,cAAgB,GAAY,GACjC,GAAI,GAAkB,GAAW,EAAW,IAAM,IAAM,GAAc,OACtE,KAAK,oBAAsB,GAAY,GACvC,KAAK,wBAA0B,GAAY,EAAiB,IAAM,GAAc,YAChF,KAAK,MAAQ,OAAO,GAKpB,KAAK,YAAc,GAKnB,AAAI,EACF,MAAK,IAAM,EACX,KAAK,UAAY,KAAK,MAAM,YAAY;AAAA,EAAM,EAAW,GAAK,EAC9D,KAAK,QAAU,KAAK,MAAM,MAAM,EAAG,KAAK,WAAW,MAAM,IAAW,QAEpE,MAAK,IAAM,KAAK,UAAY,EAC5B,KAAK,QAAU,GAKjB,KAAK,KAAO,EAAQ,IAEpB,KAAK,MAAQ,KAEb,KAAK,MAAQ,KAAK,IAAM,KAAK,IAG7B,KAAK,SAAW,KAAK,OAAS,KAAK,cAGnC,KAAK,cAAgB,KAAK,gBAAkB,KAC5C,KAAK,aAAe,KAAK,WAAa,KAAK,IAK3C,KAAK,QAAU,KAAK,iBACpB,KAAK,YAAc,GAGnB,KAAK,SAAW,EAAQ,aAAe,SACvC,KAAK,OAAS,KAAK,UAAY,KAAK,gBAAgB,KAAK,KAGzD,KAAK,iBAAmB,GACxB,KAAK,yBAA2B,GAGhC,KAAK,SAAW,KAAK,SAAW,KAAK,cAAgB,EAErD,KAAK,OAAS,GAEd,KAAK,iBAAmB,OAAO,OAAO,MAGlC,KAAK,MAAQ,GAAK,EAAQ,eAAiB,KAAK,MAAM,MAAM,EAAG,KAAO,MACtE,KAAK,gBAAgB,GAGzB,KAAK,WAAa,GAClB,KAAK,WAAW,IAGhB,KAAK,YAAc,KAKnB,KAAK,iBAAmB,IAGtB,GAAqB,CAAE,WAAY,CAAE,aAAc,IAAO,YAAa,CAAE,aAAc,IAAO,QAAS,CAAE,aAAc,IAAO,SAAU,CAAE,aAAc,IAAO,WAAY,CAAE,aAAc,IAAO,iBAAkB,CAAE,aAAc,IAAO,oBAAqB,CAAE,aAAc,IAAO,kBAAmB,CAAE,aAAc,IAAO,mBAAoB,CAAE,aAAc,KAEzW,GAAO,UAAU,MAAQ,UAAkB,CACzC,GAAI,GAAO,KAAK,QAAQ,SAAW,KAAK,YACxC,YAAK,YACE,KAAK,cAAc,IAG5B,GAAmB,WAAW,IAAM,UAAY,CAAE,MAAQ,MAAK,kBAAkB,MAAQ,IAAkB,GAE3G,GAAmB,YAAY,IAAM,UAAY,CAAE,MAAQ,MAAK,kBAAkB,MAAQ,IAAmB,GAAK,CAAC,KAAK,kBAAkB,kBAE1I,GAAmB,QAAQ,IAAM,UAAY,CAAE,MAAQ,MAAK,kBAAkB,MAAQ,IAAe,GAAK,CAAC,KAAK,kBAAkB,kBAElI,GAAmB,SAAS,IAAM,UAAY,CAC5C,OAAS,GAAI,KAAK,WAAW,OAAS,EAAG,GAAK,EAAG,IAAK,CACpD,GAAI,GAAQ,KAAK,WAAW,GAC5B,GAAI,EAAM,kBAAoB,EAAM,MAAQ,GAA4B,MAAO,GAC/E,GAAI,EAAM,MAAQ,GAAkB,MAAQ,GAAM,MAAQ,IAAe,EAE3E,MAAQ,MAAK,UAAY,KAAK,QAAQ,aAAe,IAAO,KAAK,QAAQ,2BAG3E,GAAmB,WAAW,IAAM,UAAY,CAC9C,GAAI,GAAM,KAAK,mBACT,EAAQ,EAAI,MACZ,EAAmB,EAAI,iBAC7B,MAAQ,GAAQ,IAAe,GAAK,GAAoB,KAAK,QAAQ,yBAGvE,GAAmB,iBAAiB,IAAM,UAAY,CAAE,MAAQ,MAAK,mBAAmB,MAAQ,IAAsB,GAEtH,GAAmB,oBAAoB,IAAM,UAAY,CAAE,MAAO,MAAK,2BAA2B,KAAK,iBAEvG,GAAmB,kBAAkB,IAAM,UAAY,CACrD,GAAI,GAAM,KAAK,mBACT,EAAQ,EAAI,MACZ,EAAmB,EAAI,iBAC7B,MAAQ,GAAS,IAAiB,KAA6B,GAAK,GAGtE,GAAmB,mBAAmB,IAAM,UAAY,CACtD,MAAQ,MAAK,kBAAkB,MAAQ,IAA4B,GAGrE,GAAO,OAAS,UAAmB,CAE/B,OADI,GAAU,GAAI,EAAM,UAAU,OAC1B,KAAQ,EAAS,GAAQ,UAAW,GAG9C,OADI,GAAM,KACD,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAAO,EAAM,EAAQ,GAAG,GAC5D,MAAO,IAGT,GAAO,MAAQ,SAAgB,EAAO,EAAS,CAC7C,MAAO,IAAI,MAAK,EAAS,GAAO,SAGlC,GAAO,kBAAoB,SAA4B,EAAO,EAAK,EAAS,CAC1E,GAAI,GAAS,GAAI,MAAK,EAAS,EAAO,GACtC,SAAO,YACA,EAAO,mBAGhB,GAAO,UAAY,SAAoB,EAAO,EAAS,CACrD,MAAO,IAAI,MAAK,EAAS,IAG3B,OAAO,iBAAkB,GAAO,UAAW,IAE3C,GAAI,IAAO,GAAO,UAId,GAAU,iDACd,GAAK,gBAAkB,SAAS,EAAO,CACrC,OAAS,CAEP,GAAe,UAAY,EAC3B,GAAS,GAAe,KAAK,KAAK,OAAO,GAAG,OAC5C,GAAI,GAAQ,GAAQ,KAAK,KAAK,MAAM,MAAM,IAC1C,GAAI,CAAC,EAAS,MAAO,GACrB,GAAK,GAAM,IAAM,EAAM,MAAQ,aAAc,CAC3C,GAAe,UAAY,EAAQ,EAAM,GAAG,OAC5C,GAAI,GAAa,GAAe,KAAK,KAAK,OAAQ,EAAM,EAAW,MAAQ,EAAW,GAAG,OACrF,EAAO,KAAK,MAAM,OAAO,GAC7B,MAAO,KAAS,KAAO,IAAS,KAC7B,GAAU,KAAK,EAAW,KAC1B,CAAE,uBAAsB,KAAK,IAAS,IAAS,KAAO,KAAK,MAAM,OAAO,EAAM,KAAO,KAE1F,GAAS,EAAM,GAAG,OAGlB,GAAe,UAAY,EAC3B,GAAS,GAAe,KAAK,KAAK,OAAO,GAAG,OACxC,KAAK,MAAM,KAAW,KACtB,MAOR,GAAK,IAAM,SAAS,EAAM,CACxB,MAAI,MAAK,OAAS,EAChB,MAAK,OACE,IAEA,IAMX,GAAK,aAAe,SAAS,EAAM,CACjC,MAAO,MAAK,OAAS,EAAQ,MAAQ,KAAK,QAAU,GAAQ,CAAC,KAAK,aAKpE,GAAK,cAAgB,SAAS,EAAM,CAClC,MAAK,MAAK,aAAa,GACvB,MAAK,OACE,IAFgC,IAOzC,GAAK,iBAAmB,SAAS,EAAM,CACrC,AAAK,KAAK,cAAc,IAAS,KAAK,cAKxC,GAAK,mBAAqB,UAAW,CACnC,MAAO,MAAK,OAAS,EAAQ,KAC3B,KAAK,OAAS,EAAQ,QACtB,GAAU,KAAK,KAAK,MAAM,MAAM,KAAK,WAAY,KAAK,SAG1D,GAAK,gBAAkB,UAAW,CAChC,GAAI,KAAK,qBACP,MAAI,MAAK,QAAQ,qBACb,KAAK,QAAQ,oBAAoB,KAAK,WAAY,KAAK,eACpD,IAOX,GAAK,UAAY,UAAW,CAC1B,AAAI,CAAC,KAAK,IAAI,EAAQ,OAAS,CAAC,KAAK,mBAAqB,KAAK,cAGjE,GAAK,mBAAqB,SAAS,EAAS,EAAS,CACnD,GAAI,KAAK,OAAS,EAChB,MAAI,MAAK,QAAQ,iBACb,KAAK,QAAQ,gBAAgB,KAAK,aAAc,KAAK,iBACpD,GACD,KAAK,OACF,IAOX,GAAK,OAAS,SAAS,EAAM,CAC3B,KAAK,IAAI,IAAS,KAAK,cAKzB,GAAK,WAAa,SAAS,EAAK,CAC9B,KAAK,MAAM,GAAO,KAAO,EAAM,KAAK,MAAO,qBAG7C,aAA+B,CAC7B,KAAK,gBACL,KAAK,cACL,KAAK,oBACL,KAAK,kBACL,KAAK,YACH,GAGJ,GAAK,mBAAqB,SAAS,EAAwB,EAAU,CACnE,GAAI,EAAC,EACL,CAAI,EAAuB,cAAgB,IACvC,KAAK,iBAAiB,EAAuB,cAAe,iDAChE,GAAI,GAAS,EAAW,EAAuB,oBAAsB,EAAuB,kBAC5F,AAAI,EAAS,IAAM,KAAK,iBAAiB,EAAQ,2BAGnD,GAAK,sBAAwB,SAAS,EAAwB,EAAU,CACtE,GAAI,CAAC,EAA0B,MAAO,GACtC,GAAI,GAAkB,EAAuB,gBACzC,EAAc,EAAuB,YACzC,GAAI,CAAC,EAAY,MAAO,IAAmB,GAAK,GAAe,EAC/D,AAAI,GAAmB,GACnB,KAAK,MAAM,EAAiB,2EAC5B,GAAe,GACf,KAAK,iBAAiB,EAAa,uCAGzC,GAAK,+BAAiC,UAAW,CAC/C,AAAI,KAAK,UAAa,EAAC,KAAK,UAAY,KAAK,SAAW,KAAK,WACzD,KAAK,MAAM,KAAK,SAAU,8CAC1B,KAAK,UACL,KAAK,MAAM,KAAK,SAAU,+CAGhC,GAAK,qBAAuB,SAAS,EAAM,CACzC,MAAI,GAAK,OAAS,0BACP,KAAK,qBAAqB,EAAK,YACnC,EAAK,OAAS,cAAgB,EAAK,OAAS,oBAGrD,GAAI,GAAO,GAAO,UASlB,EAAK,cAAgB,SAAS,EAAM,CAClC,GAAI,GAAU,OAAO,OAAO,MAE5B,IADK,EAAK,MAAQ,GAAK,KAAO,IACvB,KAAK,OAAS,EAAQ,KAAK,CAChC,GAAI,GAAO,KAAK,eAAe,KAAM,GAAM,GAC3C,EAAK,KAAK,KAAK,GAEjB,GAAI,KAAK,SACL,OAAS,GAAI,EAAG,EAAO,OAAO,KAAK,KAAK,kBAAmB,EAAI,EAAK,OAAQ,GAAK,EACjF,CACE,GAAI,GAAO,EAAK,GAEhB,KAAK,iBAAiB,KAAK,iBAAiB,GAAM,MAAQ,WAAa,EAAO,oBAEpF,YAAK,uBAAuB,EAAK,MACjC,KAAK,OACL,EAAK,WAAa,KAAK,QAAQ,WACxB,KAAK,WAAW,EAAM,YAG/B,GAAI,IAAY,CAAC,KAAM,QAAS,GAAc,CAAC,KAAM,UAErD,EAAK,MAAQ,SAAS,EAAS,CAC7B,GAAI,KAAK,QAAQ,YAAc,GAAK,CAAC,KAAK,aAAa,OAAU,MAAO,GACxE,GAAe,UAAY,KAAK,IAChC,GAAI,GAAO,GAAe,KAAK,KAAK,OAChC,EAAO,KAAK,IAAM,EAAK,GAAG,OAAQ,EAAS,KAAK,MAAM,WAAW,GAKrE,GAAI,IAAW,IAAM,IAAW,IAAM,EAAS,OAAU,EAAS,MAAU,MAAO,GACnF,GAAI,EAAW,MAAO,GAEtB,GAAI,IAAW,IAAO,MAAO,GAC7B,GAAI,GAAkB,EAAQ,IAAO,CAEnC,OADI,GAAM,EAAO,EACV,GAAiB,EAAS,KAAK,MAAM,WAAW,GAAM,KAAS,EAAE,EACxE,GAAI,IAAW,IAAM,EAAS,OAAU,EAAS,MAAU,MAAO,GAClE,GAAI,GAAQ,KAAK,MAAM,MAAM,EAAM,GACnC,GAAI,CAAC,GAA0B,KAAK,GAAU,MAAO,GAEvD,MAAO,IAMT,EAAK,gBAAkB,UAAW,CAChC,GAAI,KAAK,QAAQ,YAAc,GAAK,CAAC,KAAK,aAAa,SACnD,MAAO,GAEX,GAAe,UAAY,KAAK,IAChC,GAAI,GAAO,GAAe,KAAK,KAAK,OAChC,EAAO,KAAK,IAAM,EAAK,GAAG,OAAQ,EACtC,MAAO,CAAC,GAAU,KAAK,KAAK,MAAM,MAAM,KAAK,IAAK,KAChD,KAAK,MAAM,MAAM,EAAM,EAAO,KAAO,YACpC,GAAO,IAAM,KAAK,MAAM,QACxB,CAAE,IAAiB,EAAQ,KAAK,MAAM,WAAW,EAAO,KAAO,EAAQ,OAAU,EAAQ,SAU9F,EAAK,eAAiB,SAAS,EAAS,EAAU,EAAS,CACzD,GAAI,GAAY,KAAK,KAAM,EAAO,KAAK,YAAa,EAWpD,OATI,KAAK,MAAM,IACb,GAAY,EAAQ,KACpB,EAAO,OAOD,OACH,GAAQ,WAAa,GAAQ,UAAW,MAAO,MAAK,4BAA4B,EAAM,EAAU,aAChG,GAAQ,UAAW,MAAO,MAAK,uBAAuB,OACtD,GAAQ,IAAK,MAAO,MAAK,iBAAiB,OAC1C,GAAQ,KAAM,MAAO,MAAK,kBAAkB,OAC5C,GAAQ,UAIX,MAAK,IAAY,MAAK,QAAU,IAAY,MAAQ,IAAY,UAAa,KAAK,QAAQ,aAAe,GAAK,KAAK,aAC5G,KAAK,uBAAuB,EAAM,GAAO,CAAC,OAC9C,GAAQ,OACX,MAAI,IAAW,KAAK,aACb,KAAK,WAAW,EAAM,QAC1B,GAAQ,IAAK,MAAO,MAAK,iBAAiB,OAC1C,GAAQ,QAAS,MAAO,MAAK,qBAAqB,OAClD,GAAQ,QAAS,MAAO,MAAK,qBAAqB,OAClD,GAAQ,OAAQ,MAAO,MAAK,oBAAoB,OAChD,GAAQ,KAAM,MAAO,MAAK,kBAAkB,OAC5C,GAAQ,WAAa,GAAQ,KAChC,SAAO,GAAQ,KAAK,MAChB,GAAW,IAAS,OAAS,KAAK,aAC/B,KAAK,kBAAkB,EAAM,OACjC,GAAQ,OAAQ,MAAO,MAAK,oBAAoB,OAChD,GAAQ,MAAO,MAAO,MAAK,mBAAmB,OAC9C,GAAQ,OAAQ,MAAO,MAAK,WAAW,GAAM,OAC7C,GAAQ,KAAM,MAAO,MAAK,oBAAoB,OAC9C,GAAQ,YACR,GAAQ,QACX,GAAI,KAAK,QAAQ,YAAc,IAAM,IAAc,EAAQ,QAAS,CAClE,GAAe,UAAY,KAAK,IAChC,GAAI,GAAO,GAAe,KAAK,KAAK,OAChC,EAAO,KAAK,IAAM,EAAK,GAAG,OAAQ,EAAS,KAAK,MAAM,WAAW,GACrE,GAAI,IAAW,IAAM,IAAW,GAC5B,MAAO,MAAK,yBAAyB,EAAM,KAAK,mBAGtD,MAAK,MAAK,QAAQ,6BACX,IACD,KAAK,MAAM,KAAK,MAAO,0DACtB,KAAK,UACN,KAAK,MAAM,KAAK,MAAO,oEAEtB,IAAc,EAAQ,QAAU,KAAK,YAAY,GAAQ,KAAK,YAAY,EAAM,WAQvF,GAAI,KAAK,kBACP,MAAI,IAAW,KAAK,aACpB,KAAK,OACE,KAAK,uBAAuB,EAAM,GAAM,CAAC,GAGlD,GAAI,GAAY,KAAK,MAAO,EAAO,KAAK,kBACxC,MAAI,KAAc,EAAQ,MAAQ,EAAK,OAAS,cAAgB,KAAK,IAAI,EAAQ,OACtE,KAAK,sBAAsB,EAAM,EAAW,EAAM,GAC/C,KAAK,yBAAyB,EAAM,KAItD,EAAK,4BAA8B,SAAS,EAAM,EAAS,CACzD,GAAI,GAAU,IAAY,QAC1B,KAAK,OACL,AAAI,KAAK,IAAI,EAAQ,OAAS,KAAK,kBAAqB,EAAK,MAAQ,KAChE,AAAI,KAAK,OAAS,EAAQ,KAAQ,KAAK,aAE1C,GAAK,MAAQ,KAAK,aAClB,KAAK,aAMP,OADI,GAAI,EACD,EAAI,KAAK,OAAO,OAAQ,EAAE,EAAG,CAClC,GAAI,GAAM,KAAK,OAAO,GACtB,GAAI,GAAK,OAAS,MAAQ,EAAI,OAAS,EAAK,MAAM,OAC5C,GAAI,MAAQ,MAAS,IAAW,EAAI,OAAS,SAC7C,EAAK,OAAS,GAAW,MAGjC,MAAI,KAAM,KAAK,OAAO,QAAU,KAAK,MAAM,EAAK,MAAO,eAAiB,GACjE,KAAK,WAAW,EAAM,EAAU,iBAAmB,sBAG5D,EAAK,uBAAyB,SAAS,EAAM,CAC3C,YAAK,OACL,KAAK,YACE,KAAK,WAAW,EAAM,sBAG/B,EAAK,iBAAmB,SAAS,EAAM,CACrC,YAAK,OACL,KAAK,OAAO,KAAK,IACjB,EAAK,KAAO,KAAK,eAAe,MAChC,KAAK,OAAO,MACZ,KAAK,OAAO,EAAQ,QACpB,EAAK,KAAO,KAAK,uBACjB,AAAI,KAAK,QAAQ,aAAe,EAC5B,KAAK,IAAI,EAAQ,MAEjB,KAAK,YACF,KAAK,WAAW,EAAM,qBAW/B,EAAK,kBAAoB,SAAS,EAAM,CACtC,KAAK,OACL,GAAI,GAAW,KAAK,QAAQ,aAAe,GAAK,KAAK,UAAY,KAAK,cAAc,SAAY,KAAK,aAAe,GAIpH,GAHA,KAAK,OAAO,KAAK,IACjB,KAAK,WAAW,GAChB,KAAK,OAAO,EAAQ,QAChB,KAAK,OAAS,EAAQ,KACxB,MAAI,GAAU,IAAM,KAAK,WAAW,GAC7B,KAAK,SAAS,EAAM,MAE7B,GAAI,GAAQ,KAAK,QACjB,GAAI,KAAK,OAAS,EAAQ,MAAQ,KAAK,OAAS,EAAQ,QAAU,EAAO,CACvE,GAAI,GAAS,KAAK,YAAa,EAAO,EAAQ,MAAQ,KAAK,MAI3D,MAHA,MAAK,OACL,KAAK,SAAS,EAAQ,GAAM,GAC5B,KAAK,WAAW,EAAQ,uBACnB,MAAK,OAAS,EAAQ,KAAQ,KAAK,QAAQ,aAAe,GAAK,KAAK,aAAa,QAAW,EAAO,aAAa,SAAW,EAC1H,MAAK,QAAQ,aAAe,GAC9B,CAAI,KAAK,OAAS,EAAQ,IACpB,EAAU,IAAM,KAAK,WAAW,GAC7B,EAAK,MAAQ,EAAU,IAE3B,KAAK,WAAW,EAAM,IAE3B,GAAU,IAAM,KAAK,WAAW,GAC7B,KAAK,SAAS,EAAM,IAE7B,GAAI,GAAgB,KAAK,aAAa,OAAQ,EAAU,GACpD,EAAyB,GAAI,IAC7B,EAAO,KAAK,gBAAgB,EAAU,GAAK,QAAU,GAAM,GAC/D,MAAI,MAAK,OAAS,EAAQ,KAAQ,GAAU,KAAK,QAAQ,aAAe,GAAK,KAAK,aAAa,OACzF,MAAK,QAAQ,aAAe,GAC9B,CAAI,KAAK,OAAS,EAAQ,IACpB,EAAU,IAAM,KAAK,WAAW,GAC7B,EAAK,MAAQ,EAAU,IAE9B,GAAiB,GAAW,KAAK,MAAM,EAAK,MAAO,iEACvD,KAAK,aAAa,EAAM,GAAO,GAC/B,KAAK,iBAAiB,GACf,KAAK,WAAW,EAAM,IAE7B,MAAK,sBAAsB,EAAwB,IAEjD,EAAU,IAAM,KAAK,WAAW,GAC7B,KAAK,SAAS,EAAM,KAG7B,EAAK,uBAAyB,SAAS,EAAM,EAAS,EAAqB,CACzE,YAAK,OACE,KAAK,cAAc,EAAM,GAAkB,GAAsB,EAAI,IAAyB,GAAO,IAG9G,EAAK,iBAAmB,SAAS,EAAM,CACrC,YAAK,OACL,EAAK,KAAO,KAAK,uBAEjB,EAAK,WAAa,KAAK,eAAe,MACtC,EAAK,UAAY,KAAK,IAAI,EAAQ,OAAS,KAAK,eAAe,MAAQ,KAChE,KAAK,WAAW,EAAM,gBAG/B,EAAK,qBAAuB,SAAS,EAAM,CACzC,MAAI,CAAC,KAAK,YAAc,CAAC,KAAK,QAAQ,4BAClC,KAAK,MAAM,KAAK,MAAO,gCAC3B,KAAK,OAML,AAAI,KAAK,IAAI,EAAQ,OAAS,KAAK,kBAAqB,EAAK,SAAW,KACjE,GAAK,SAAW,KAAK,kBAAmB,KAAK,aAC7C,KAAK,WAAW,EAAM,oBAG/B,EAAK,qBAAuB,SAAS,EAAM,CACzC,KAAK,OACL,EAAK,aAAe,KAAK,uBACzB,EAAK,MAAQ,GACb,KAAK,OAAO,EAAQ,QACpB,KAAK,OAAO,KAAK,IACjB,KAAK,WAAW,GAOhB,OADI,GACK,EAAa,GAAO,KAAK,OAAS,EAAQ,QACjD,GAAI,KAAK,OAAS,EAAQ,OAAS,KAAK,OAAS,EAAQ,SAAU,CACjE,GAAI,GAAS,KAAK,OAAS,EAAQ,MACnC,AAAI,GAAO,KAAK,WAAW,EAAK,cAChC,EAAK,MAAM,KAAK,EAAM,KAAK,aAC3B,EAAI,WAAa,GACjB,KAAK,OACL,AAAI,EACF,EAAI,KAAO,KAAK,kBAEZ,IAAc,KAAK,iBAAiB,KAAK,aAAc,4BAC3D,EAAa,GACb,EAAI,KAAO,MAEb,KAAK,OAAO,EAAQ,WAEpB,AAAK,IAAO,KAAK,aACjB,EAAI,WAAW,KAAK,KAAK,eAAe,OAG5C,YAAK,YACD,GAAO,KAAK,WAAW,EAAK,cAChC,KAAK,OACL,KAAK,OAAO,MACL,KAAK,WAAW,EAAM,oBAG/B,EAAK,oBAAsB,SAAS,EAAM,CACxC,YAAK,OACD,GAAU,KAAK,KAAK,MAAM,MAAM,KAAK,WAAY,KAAK,SACtD,KAAK,MAAM,KAAK,WAAY,+BAChC,EAAK,SAAW,KAAK,kBACrB,KAAK,YACE,KAAK,WAAW,EAAM,mBAK/B,GAAI,IAAU,GAEd,EAAK,kBAAoB,SAAS,EAAM,CAItC,GAHA,KAAK,OACL,EAAK,MAAQ,KAAK,aAClB,EAAK,QAAU,KACX,KAAK,OAAS,EAAQ,OAAQ,CAChC,GAAI,GAAS,KAAK,YAElB,GADA,KAAK,OACD,KAAK,IAAI,EAAQ,QAAS,CAC5B,EAAO,MAAQ,KAAK,mBACpB,GAAI,GAAS,EAAO,MAAM,OAAS,aACnC,KAAK,WAAW,EAAS,GAAqB,GAC9C,KAAK,iBAAiB,EAAO,MAAO,EAAS,GAAoB,IACjE,KAAK,OAAO,EAAQ,YAEpB,AAAI,MAAK,QAAQ,YAAc,IAAM,KAAK,aAC1C,EAAO,MAAQ,KACf,KAAK,WAAW,GAElB,EAAO,KAAO,KAAK,WAAW,IAC9B,KAAK,YACL,EAAK,QAAU,KAAK,WAAW,EAAQ,eAEzC,SAAK,UAAY,KAAK,IAAI,EAAQ,UAAY,KAAK,aAAe,KAC9D,CAAC,EAAK,SAAW,CAAC,EAAK,WACvB,KAAK,MAAM,EAAK,MAAO,mCACpB,KAAK,WAAW,EAAM,iBAG/B,EAAK,kBAAoB,SAAS,EAAM,EAAM,CAC5C,YAAK,OACL,KAAK,SAAS,EAAM,GAAO,GAC3B,KAAK,YACE,KAAK,WAAW,EAAM,wBAG/B,EAAK,oBAAsB,SAAS,EAAM,CACxC,YAAK,OACL,EAAK,KAAO,KAAK,uBACjB,KAAK,OAAO,KAAK,IACjB,EAAK,KAAO,KAAK,eAAe,SAChC,KAAK,OAAO,MACL,KAAK,WAAW,EAAM,mBAG/B,EAAK,mBAAqB,SAAS,EAAM,CACvC,MAAI,MAAK,QAAU,KAAK,MAAM,KAAK,MAAO,yBAC1C,KAAK,OACL,EAAK,OAAS,KAAK,uBACnB,EAAK,KAAO,KAAK,eAAe,QACzB,KAAK,WAAW,EAAM,kBAG/B,EAAK,oBAAsB,SAAS,EAAM,CACxC,YAAK,OACE,KAAK,WAAW,EAAM,mBAG/B,EAAK,sBAAwB,SAAS,EAAM,EAAW,EAAM,EAAS,CACpE,OAAS,GAAM,EAAG,EAAO,KAAK,OAAQ,EAAM,EAAK,OAAQ,GAAO,EAC9D,CACA,GAAI,GAAQ,EAAK,GAEjB,AAAI,EAAM,OAAS,GACf,KAAK,MAAM,EAAK,MAAO,UAAY,EAAY,yBAGrD,OADI,GAAO,KAAK,KAAK,OAAS,OAAS,KAAK,OAAS,EAAQ,QAAU,SAAW,KACzE,EAAI,KAAK,OAAO,OAAS,EAAG,GAAK,EAAG,IAAK,CAChD,GAAI,GAAU,KAAK,OAAO,GAC1B,GAAI,EAAQ,iBAAmB,EAAK,MAElC,EAAQ,eAAiB,KAAK,MAC9B,EAAQ,KAAO,MACR,OAEX,YAAK,OAAO,KAAK,CAAC,KAAM,EAAW,KAAM,EAAM,eAAgB,KAAK,QACpE,EAAK,KAAO,KAAK,eAAe,EAAU,EAAQ,QAAQ,WAAa,GAAK,EAAU,QAAU,EAAU,SAC1G,KAAK,OAAO,MACZ,EAAK,MAAQ,EACN,KAAK,WAAW,EAAM,qBAG/B,EAAK,yBAA2B,SAAS,EAAM,EAAM,CACnD,SAAK,WAAa,EAClB,KAAK,YACE,KAAK,WAAW,EAAM,wBAO/B,EAAK,WAAa,SAAS,EAAuB,EAAM,EAAY,CAOlE,IANK,IAA0B,QAAS,GAAwB,IAC3D,IAAS,QAAS,GAAO,KAAK,aAEnC,EAAK,KAAO,GACZ,KAAK,OAAO,EAAQ,QAChB,GAAyB,KAAK,WAAW,GACtC,KAAK,OAAS,EAAQ,QAAQ,CACnC,GAAI,GAAO,KAAK,eAAe,MAC/B,EAAK,KAAK,KAAK,GAEjB,MAAI,IAAc,MAAK,OAAS,IAChC,KAAK,OACD,GAAyB,KAAK,YAC3B,KAAK,WAAW,EAAM,mBAO/B,EAAK,SAAW,SAAS,EAAM,EAAM,CACnC,SAAK,KAAO,EACZ,KAAK,OAAO,EAAQ,MACpB,EAAK,KAAO,KAAK,OAAS,EAAQ,KAAO,KAAO,KAAK,kBACrD,KAAK,OAAO,EAAQ,MACpB,EAAK,OAAS,KAAK,OAAS,EAAQ,OAAS,KAAO,KAAK,kBACzD,KAAK,OAAO,EAAQ,QACpB,EAAK,KAAO,KAAK,eAAe,OAChC,KAAK,YACL,KAAK,OAAO,MACL,KAAK,WAAW,EAAM,iBAM/B,EAAK,WAAa,SAAS,EAAM,EAAM,CACrC,GAAI,GAAU,KAAK,OAAS,EAAQ,IACpC,YAAK,OAGH,EAAK,OAAS,uBACd,EAAK,aAAa,GAAG,MAAQ,MAE3B,EAAC,GACD,KAAK,QAAQ,YAAc,GAC3B,KAAK,QACL,EAAK,OAAS,OACd,EAAK,aAAa,GAAG,GAAG,OAAS,eAGnC,KAAK,MACH,EAAK,MACH,GAAU,SAAW,UAAY,0DAGvC,EAAK,KAAO,EACZ,EAAK,MAAQ,EAAU,KAAK,kBAAoB,KAAK,mBACrD,KAAK,OAAO,EAAQ,QACpB,EAAK,KAAO,KAAK,eAAe,OAChC,KAAK,YACL,KAAK,OAAO,MACL,KAAK,WAAW,EAAM,EAAU,iBAAmB,mBAK5D,EAAK,SAAW,SAAS,EAAM,EAAO,EAAM,CAG1C,IAFA,EAAK,aAAe,GACpB,EAAK,KAAO,IACH,CACP,GAAI,GAAO,KAAK,YAYhB,GAXA,KAAK,WAAW,EAAM,GACtB,AAAI,KAAK,IAAI,EAAQ,IACnB,EAAK,KAAO,KAAK,iBAAiB,GAC7B,AAAI,IAAS,SAAW,CAAE,MAAK,OAAS,EAAQ,KAAQ,KAAK,QAAQ,aAAe,GAAK,KAAK,aAAa,OAChH,KAAK,aACA,AAAI,EAAK,GAAG,OAAS,cAAgB,CAAE,IAAU,MAAK,OAAS,EAAQ,KAAO,KAAK,aAAa,QACrG,KAAK,MAAM,KAAK,WAAY,4DAE5B,EAAK,KAAO,KAEd,EAAK,aAAa,KAAK,KAAK,WAAW,EAAM,uBACzC,CAAC,KAAK,IAAI,EAAQ,OAAU,MAElC,MAAO,IAGT,EAAK,WAAa,SAAS,EAAM,EAAM,CACrC,EAAK,GAAK,KAAK,mBACf,KAAK,iBAAiB,EAAK,GAAI,IAAS,MAAQ,GAAW,GAAc,KAG3E,GAAI,IAAiB,EAAG,GAAyB,EAAG,GAAmB,EAMvE,EAAK,cAAgB,SAAS,EAAM,EAAW,EAAqB,EAAS,EAAS,CACpF,KAAK,aAAa,GACd,MAAK,QAAQ,aAAe,GAAK,KAAK,QAAQ,aAAe,GAAK,CAAC,IACjE,MAAK,OAAS,EAAQ,MAAS,EAAY,IAC3C,KAAK,aACT,EAAK,UAAY,KAAK,IAAI,EAAQ,OAEhC,KAAK,QAAQ,aAAe,GAC5B,GAAK,MAAQ,CAAC,CAAC,GAEf,EAAY,IACd,GAAK,GAAM,EAAY,IAAqB,KAAK,OAAS,EAAQ,KAAO,KAAO,KAAK,aACjF,EAAK,IAAM,CAAE,GAAY,KAKzB,KAAK,gBAAgB,EAAK,GAAK,KAAK,QAAU,EAAK,WAAa,EAAK,MAAS,KAAK,oBAAsB,GAAW,GAAe,KAGzI,GAAI,GAAc,KAAK,SAAU,EAAc,KAAK,SAAU,EAAmB,KAAK,cACtF,YAAK,SAAW,EAChB,KAAK,SAAW,EAChB,KAAK,cAAgB,EACrB,KAAK,WAAW,GAAc,EAAK,MAAO,EAAK,YAEzC,EAAY,IACd,GAAK,GAAK,KAAK,OAAS,EAAQ,KAAO,KAAK,aAAe,MAE/D,KAAK,oBAAoB,GACzB,KAAK,kBAAkB,EAAM,EAAqB,GAAO,GAEzD,KAAK,SAAW,EAChB,KAAK,SAAW,EAChB,KAAK,cAAgB,EACd,KAAK,WAAW,EAAO,EAAY,GAAkB,sBAAwB,uBAGtF,EAAK,oBAAsB,SAAS,EAAM,CACxC,KAAK,OAAO,EAAQ,QACpB,EAAK,OAAS,KAAK,iBAAiB,EAAQ,OAAQ,GAAO,KAAK,QAAQ,aAAe,GACvF,KAAK,kCAMP,EAAK,WAAa,SAAS,EAAM,EAAa,CAC5C,KAAK,OAIL,GAAI,GAAY,KAAK,OACrB,KAAK,OAAS,GAEd,KAAK,aAAa,EAAM,GACxB,KAAK,gBAAgB,GACrB,GAAI,GAAiB,KAAK,iBACtB,EAAY,KAAK,YACjB,EAAiB,GAGrB,IAFA,EAAU,KAAO,GACjB,KAAK,OAAO,EAAQ,QACb,KAAK,OAAS,EAAQ,QAAQ,CACnC,GAAI,GAAU,KAAK,kBAAkB,EAAK,aAAe,MACzD,AAAI,GACF,GAAU,KAAK,KAAK,GACpB,AAAI,EAAQ,OAAS,oBAAsB,EAAQ,OAAS,cACtD,IAAkB,KAAK,MAAM,EAAQ,MAAO,2CAChD,EAAiB,IACR,EAAQ,KAAO,EAAQ,IAAI,OAAS,qBAAuB,GAAwB,EAAgB,IAC5G,KAAK,iBAAiB,EAAQ,IAAI,MAAQ,gBAAmB,EAAQ,IAAI,KAAQ,gCAIvF,YAAK,OAAS,EACd,KAAK,OACL,EAAK,KAAO,KAAK,WAAW,EAAW,aACvC,KAAK,gBACE,KAAK,WAAW,EAAM,EAAc,mBAAqB,oBAGlE,EAAK,kBAAoB,SAAS,EAAwB,CACxD,GAAI,KAAK,IAAI,EAAQ,MAAS,MAAO,MAErC,GAAI,GAAc,KAAK,QAAQ,YAC3B,EAAO,KAAK,YACZ,EAAU,GACV,EAAc,GACd,EAAU,GACV,EAAO,SACP,EAAW,GAEf,GAAI,KAAK,cAAc,UAAW,CAEhC,GAAI,GAAe,IAAM,KAAK,IAAI,EAAQ,QACxC,YAAK,sBAAsB,GACpB,EAET,AAAI,KAAK,2BAA6B,KAAK,OAAS,EAAQ,KAC1D,EAAW,GAEX,EAAU,SAcd,GAXA,EAAK,OAAS,EACV,CAAC,GAAW,GAAe,GAAK,KAAK,cAAc,UACrD,CAAK,MAAK,2BAA6B,KAAK,OAAS,EAAQ,OAAS,CAAC,KAAK,qBAC1E,EAAU,GAEV,EAAU,SAGV,CAAC,GAAY,IAAe,GAAK,CAAC,IAAY,KAAK,IAAI,EAAQ,OACjE,GAAc,IAEZ,CAAC,GAAW,CAAC,GAAW,CAAC,EAAa,CACxC,GAAI,GAAY,KAAK,MACrB,AAAI,MAAK,cAAc,QAAU,KAAK,cAAc,SAClD,CAAI,KAAK,0BACP,EAAO,EAEP,EAAU,GAkBhB,GAZA,AAAI,EAGF,GAAK,SAAW,GAChB,EAAK,IAAM,KAAK,YAAY,KAAK,aAAc,KAAK,iBACpD,EAAK,IAAI,KAAO,EAChB,KAAK,WAAW,EAAK,IAAK,eAE1B,KAAK,sBAAsB,GAIzB,EAAc,IAAM,KAAK,OAAS,EAAQ,QAAU,IAAS,UAAY,GAAe,EAAS,CACnG,GAAI,GAAgB,CAAC,EAAK,QAAU,GAAa,EAAM,eACnD,EAAoB,GAAiB,EAEzC,AAAI,GAAiB,IAAS,UAAY,KAAK,MAAM,EAAK,IAAI,MAAO,2CACrE,EAAK,KAAO,EAAgB,cAAgB,EAC5C,KAAK,iBAAiB,EAAM,EAAa,EAAS,OAElD,MAAK,gBAAgB,GAGvB,MAAO,IAGT,EAAK,wBAA0B,UAAW,CACxC,MACE,MAAK,OAAS,EAAQ,MACtB,KAAK,OAAS,EAAQ,WACtB,KAAK,OAAS,EAAQ,KACtB,KAAK,OAAS,EAAQ,QACtB,KAAK,OAAS,EAAQ,UACtB,KAAK,KAAK,SAId,EAAK,sBAAwB,SAAS,EAAS,CAC7C,AAAI,KAAK,OAAS,EAAQ,UACpB,MAAK,QAAU,eACjB,KAAK,MAAM,KAAK,MAAO,sDAEzB,EAAQ,SAAW,GACnB,EAAQ,IAAM,KAAK,qBAEnB,KAAK,kBAAkB,IAI3B,EAAK,iBAAmB,SAAS,EAAQ,EAAa,EAAS,EAAmB,CAEhF,GAAI,GAAM,EAAO,IACjB,AAAI,EAAO,OAAS,cACd,IAAe,KAAK,MAAM,EAAI,MAAO,oCACrC,GAAW,KAAK,MAAM,EAAI,MAAO,yCAC5B,EAAO,QAAU,GAAa,EAAQ,cAC/C,KAAK,MAAM,EAAI,MAAO,0DAIxB,GAAI,GAAQ,EAAO,MAAQ,KAAK,YAAY,EAAa,EAAS,GAGlE,MAAI,GAAO,OAAS,OAAS,EAAM,OAAO,SAAW,GACjD,KAAK,iBAAiB,EAAM,MAAO,gCACnC,EAAO,OAAS,OAAS,EAAM,OAAO,SAAW,GACjD,KAAK,iBAAiB,EAAM,MAAO,wCACnC,EAAO,OAAS,OAAS,EAAM,OAAO,GAAG,OAAS,eAClD,KAAK,iBAAiB,EAAM,OAAO,GAAG,MAAO,iCAE1C,KAAK,WAAW,EAAQ,qBAGjC,EAAK,gBAAkB,SAAS,EAAO,CAOrC,GANA,AAAI,GAAa,EAAO,eACtB,KAAK,MAAM,EAAM,IAAI,MAAO,kDACnB,EAAM,QAAU,GAAa,EAAO,cAC7C,KAAK,MAAM,EAAM,IAAI,MAAO,uDAG1B,KAAK,IAAI,EAAQ,IAAK,CAExB,GAAI,GAAQ,KAAK,mBACb,EAAmB,EAAM,iBAC7B,EAAM,iBAAmB,GACzB,EAAM,MAAQ,KAAK,mBACnB,EAAM,iBAAmB,MAEzB,GAAM,MAAQ,KAEhB,YAAK,YAEE,KAAK,WAAW,EAAO,uBAGhC,EAAK,sBAAwB,SAAS,EAAM,CAC1C,EAAK,KAAO,GAEZ,GAAI,GAAY,KAAK,OAGrB,IAFA,KAAK,OAAS,GACd,KAAK,WAAW,GAA2B,IACpC,KAAK,OAAS,EAAQ,QAAQ,CACnC,GAAI,GAAO,KAAK,eAAe,MAC/B,EAAK,KAAK,KAAK,GAEjB,YAAK,OACL,KAAK,YACL,KAAK,OAAS,EAEP,KAAK,WAAW,EAAM,gBAG/B,EAAK,aAAe,SAAS,EAAM,EAAa,CAC9C,AAAI,KAAK,OAAS,EAAQ,KACxB,GAAK,GAAK,KAAK,aACX,GACA,KAAK,gBAAgB,EAAK,GAAI,GAAc,KAE5C,KAAgB,IAChB,KAAK,aACT,EAAK,GAAK,OAId,EAAK,gBAAkB,SAAS,EAAM,CACpC,EAAK,WAAa,KAAK,IAAI,EAAQ,UAAY,KAAK,oBAAoB,IAAS,MAGnF,EAAK,eAAiB,UAAW,CAC/B,GAAI,GAAU,CAAC,SAAU,OAAO,OAAO,MAAO,KAAM,IACpD,YAAK,iBAAiB,KAAK,GACpB,EAAQ,UAGjB,EAAK,cAAgB,UAAW,CAM9B,OALI,GAAM,KAAK,iBAAiB,MAC5B,EAAW,EAAI,SACf,EAAO,EAAI,KACX,EAAM,KAAK,iBAAiB,OAC5B,EAAS,IAAQ,EAAI,KAAO,KAAK,iBAAiB,EAAM,GACnD,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EAAG,CACpC,GAAI,GAAK,EAAK,GACd,AAAK,GAAO,EAAU,EAAG,OACvB,CAAI,EACF,EAAO,KAAK,KAAK,GAEjB,KAAK,iBAAiB,EAAG,MAAQ,mBAAsB,EAAG,KAAQ,+CAM1E,YAAiC,EAAgB,EAAS,CACxD,GAAI,GAAO,EAAQ,IAAI,KACnB,EAAO,EAAe,GAEtB,EAAO,OAMX,MALI,GAAQ,OAAS,oBAAuB,GAAQ,OAAS,OAAS,EAAQ,OAAS,QACrF,GAAQ,GAAQ,OAAS,IAAM,KAAO,EAAQ,MAK9C,IAAS,QAAU,IAAS,QAC5B,IAAS,QAAU,IAAS,QAC5B,IAAS,QAAU,IAAS,QAC5B,IAAS,QAAU,IAAS,OAE5B,GAAe,GAAQ,OAChB,IACG,EAIH,GAHP,GAAe,GAAQ,EAChB,IAMX,YAAsB,EAAM,EAAM,CAChC,GAAI,GAAW,EAAK,SAChB,EAAM,EAAK,IACf,MAAO,CAAC,GACN,GAAI,OAAS,cAAgB,EAAI,OAAS,GAC1C,EAAI,OAAS,WAAa,EAAI,QAAU,GAM5C,EAAK,YAAc,SAAS,EAAM,EAAS,CAGzC,GAFA,KAAK,OAED,KAAK,IAAI,EAAQ,MACnB,MAAI,MAAK,QAAQ,aAAe,IAC9B,CAAI,KAAK,cAAc,MACrB,GAAK,SAAW,KAAK,wBACrB,KAAK,YAAY,EAAS,EAAK,SAAS,KAAM,KAAK,eAEnD,EAAK,SAAW,MAGpB,KAAK,iBAAiB,QAClB,KAAK,OAAS,EAAQ,QAAU,KAAK,aACzC,EAAK,OAAS,KAAK,gBACnB,KAAK,YACE,KAAK,WAAW,EAAM,wBAE/B,GAAI,KAAK,IAAI,EAAQ,UAAW,CAC9B,KAAK,YAAY,EAAS,UAAW,KAAK,cAC1C,GAAI,GACJ,GAAI,KAAK,OAAS,EAAQ,WAAc,GAAU,KAAK,mBAAoB,CACzE,GAAI,GAAQ,KAAK,YACjB,KAAK,OACD,GAAW,KAAK,OACpB,EAAK,YAAc,KAAK,cAAc,EAAO,GAAiB,GAAkB,GAAO,WAC9E,KAAK,OAAS,EAAQ,OAAQ,CACvC,GAAI,GAAQ,KAAK,YACjB,EAAK,YAAc,KAAK,WAAW,EAAO,kBAE1C,GAAK,YAAc,KAAK,mBACxB,KAAK,YAEP,MAAO,MAAK,WAAW,EAAM,4BAG/B,GAAI,KAAK,6BACP,EAAK,YAAc,KAAK,eAAe,MACvC,AAAI,EAAK,YAAY,OAAS,sBAC1B,KAAK,oBAAoB,EAAS,EAAK,YAAY,cAEnD,KAAK,YAAY,EAAS,EAAK,YAAY,GAAG,KAAM,EAAK,YAAY,GAAG,OAC5E,EAAK,WAAa,GAClB,EAAK,OAAS,SACT,CAGL,GAFA,EAAK,YAAc,KACnB,EAAK,WAAa,KAAK,sBAAsB,GACzC,KAAK,cAAc,QACrB,AAAI,KAAK,OAAS,EAAQ,QAAU,KAAK,aACzC,EAAK,OAAS,KAAK,oBACd,CACL,OAAS,GAAI,EAAG,EAAO,EAAK,WAAY,EAAI,EAAK,OAAQ,GAAK,EAAG,CAE/D,GAAI,GAAO,EAAK,GAEhB,KAAK,gBAAgB,EAAK,OAE1B,KAAK,iBAAiB,EAAK,OAEvB,EAAK,MAAM,OAAS,WACtB,KAAK,MAAM,EAAK,MAAM,MAAO,0EAIjC,EAAK,OAAS,KAEhB,KAAK,YAEP,MAAO,MAAK,WAAW,EAAM,2BAG/B,EAAK,YAAc,SAAS,EAAS,EAAM,EAAK,CAC9C,AAAI,CAAC,GACD,IAAO,EAAS,IAChB,KAAK,iBAAiB,EAAK,qBAAuB,EAAO,KAC7D,EAAQ,GAAQ,KAGlB,EAAK,mBAAqB,SAAS,EAAS,EAAK,CAC/C,GAAI,GAAO,EAAI,KACf,GAAI,IAAS,aACT,KAAK,YAAY,EAAS,EAAI,KAAM,EAAI,eACnC,IAAS,gBACd,OAAS,GAAI,EAAG,EAAO,EAAI,WAAY,EAAI,EAAK,OAAQ,GAAK,EAC7D,CACE,GAAI,GAAO,EAAK,GAEhB,KAAK,mBAAmB,EAAS,WAE9B,IAAS,eACd,OAAS,GAAM,EAAG,EAAS,EAAI,SAAU,EAAM,EAAO,OAAQ,GAAO,EAAG,CACxE,GAAI,GAAM,EAAO,GAEf,AAAI,GAAO,KAAK,mBAAmB,EAAS,OAE7C,AAAI,KAAS,WACd,KAAK,mBAAmB,EAAS,EAAI,OACpC,AAAI,IAAS,oBACd,KAAK,mBAAmB,EAAS,EAAI,MACpC,AAAI,IAAS,cACd,KAAK,mBAAmB,EAAS,EAAI,UAChC,IAAS,2BACd,KAAK,mBAAmB,EAAS,EAAI,aAG3C,EAAK,oBAAsB,SAAS,EAAS,EAAO,CAClD,GAAI,EAAC,EACL,OAAS,GAAI,EAAG,EAAO,EAAO,EAAI,EAAK,OAAQ,GAAK,EAClD,CACA,GAAI,GAAO,EAAK,GAEhB,KAAK,mBAAmB,EAAS,EAAK,MAI1C,EAAK,2BAA6B,UAAW,CAC3C,MAAO,MAAK,KAAK,UAAY,OAC3B,KAAK,KAAK,UAAY,SACtB,KAAK,KAAK,UAAY,SACtB,KAAK,KAAK,UAAY,YACtB,KAAK,SACL,KAAK,mBAKT,EAAK,sBAAwB,SAAS,EAAS,CAC7C,GAAI,GAAQ,GAAI,EAAQ,GAGxB,IADA,KAAK,OAAO,EAAQ,QACb,CAAC,KAAK,IAAI,EAAQ,SAAS,CAChC,GAAK,EAGI,EAAQ,WAFf,KAAK,OAAO,EAAQ,OAChB,KAAK,mBAAmB,EAAQ,QAAW,MAGjD,GAAI,GAAO,KAAK,YAChB,EAAK,MAAQ,KAAK,wBAClB,EAAK,SAAW,KAAK,cAAc,MAAQ,KAAK,wBAA0B,EAAK,MAC/E,KAAK,YACH,EACA,EAAK,SAAS,EAAK,SAAS,OAAS,aAAe,OAAS,SAC7D,EAAK,SAAS,OAEhB,EAAM,KAAK,KAAK,WAAW,EAAM,oBAEnC,MAAO,IAKT,EAAK,YAAc,SAAS,EAAM,CAChC,YAAK,OAEL,AAAI,KAAK,OAAS,EAAQ,OACxB,GAAK,WAAa,GAClB,EAAK,OAAS,KAAK,iBAEnB,GAAK,WAAa,KAAK,wBACvB,KAAK,iBAAiB,QACtB,EAAK,OAAS,KAAK,OAAS,EAAQ,OAAS,KAAK,gBAAkB,KAAK,cAE3E,KAAK,YACE,KAAK,WAAW,EAAM,sBAK/B,EAAK,sBAAwB,UAAW,CACtC,GAAI,GAAQ,GAAI,EAAQ,GACxB,GAAI,KAAK,OAAS,EAAQ,KAAM,CAE9B,GAAI,GAAO,KAAK,YAIhB,GAHA,EAAK,MAAQ,KAAK,aAClB,KAAK,gBAAgB,EAAK,MAAO,IACjC,EAAM,KAAK,KAAK,WAAW,EAAM,2BAC7B,CAAC,KAAK,IAAI,EAAQ,OAAU,MAAO,GAEzC,GAAI,KAAK,OAAS,EAAQ,KAAM,CAC9B,GAAI,GAAS,KAAK,YAClB,YAAK,OACL,KAAK,iBAAiB,MACtB,EAAO,MAAQ,KAAK,aACpB,KAAK,gBAAgB,EAAO,MAAO,IACnC,EAAM,KAAK,KAAK,WAAW,EAAQ,6BAC5B,EAGT,IADA,KAAK,OAAO,EAAQ,QACb,CAAC,KAAK,IAAI,EAAQ,SAAS,CAChC,GAAK,EAGI,EAAQ,WAFf,KAAK,OAAO,EAAQ,OAChB,KAAK,mBAAmB,EAAQ,QAAW,MAGjD,GAAI,GAAS,KAAK,YAClB,EAAO,SAAW,KAAK,wBACvB,AAAI,KAAK,cAAc,MACrB,EAAO,MAAQ,KAAK,aAEpB,MAAK,gBAAgB,EAAO,UAC5B,EAAO,MAAQ,EAAO,UAExB,KAAK,gBAAgB,EAAO,MAAO,IACnC,EAAM,KAAK,KAAK,WAAW,EAAQ,oBAErC,MAAO,IAGT,EAAK,sBAAwB,UAAW,CACtC,GAAI,KAAK,QAAQ,aAAe,IAAM,KAAK,OAAS,EAAQ,OAAQ,CAClE,GAAI,GAAgB,KAAK,aAAa,KAAK,OAC3C,MAAI,IAAc,KAAK,EAAc,QACnC,KAAK,MAAM,EAAc,MAAO,mDAE3B,EAET,MAAO,MAAK,WAAW,KAIzB,EAAK,uBAAyB,SAAS,EAAY,CACjD,OAAS,GAAI,EAAG,EAAI,EAAW,QAAU,KAAK,qBAAqB,EAAW,IAAK,EAAE,EACnF,EAAW,GAAG,UAAY,EAAW,GAAG,WAAW,IAAI,MAAM,EAAG,KAGpE,EAAK,qBAAuB,SAAS,EAAW,CAC9C,MACE,GAAU,OAAS,uBACnB,EAAU,WAAW,OAAS,WAC9B,MAAO,GAAU,WAAW,OAAU,UAErC,MAAK,MAAM,EAAU,SAAW,KAAQ,KAAK,MAAM,EAAU,SAAW,MAI7E,GAAI,IAAO,GAAO,UAKlB,GAAK,aAAe,SAAS,EAAM,EAAW,EAAwB,CACpE,GAAI,KAAK,QAAQ,aAAe,GAAK,EACnC,OAAQ,EAAK,UACR,aACH,AAAI,KAAK,SAAW,EAAK,OAAS,SAC9B,KAAK,MAAM,EAAK,MAAO,6DAC3B,UAEG,oBACA,mBACA,wBACA,cACH,UAEG,mBACH,EAAK,KAAO,gBACR,GAA0B,KAAK,mBAAmB,EAAwB,IAC9E,OAAS,GAAI,EAAG,EAAO,EAAK,WAAY,EAAI,EAAK,OAAQ,GAAK,EAAG,CAC/D,GAAI,GAAO,EAAK,GAElB,KAAK,aAAa,EAAM,GAOpB,EAAK,OAAS,eACb,GAAK,SAAS,OAAS,gBAAkB,EAAK,SAAS,OAAS,kBAEjE,KAAK,MAAM,EAAK,SAAS,MAAO,oBAGpC,UAEG,WAEH,AAAI,EAAK,OAAS,QAAU,KAAK,MAAM,EAAK,IAAI,MAAO,iDACvD,KAAK,aAAa,EAAK,MAAO,GAC9B,UAEG,kBACH,EAAK,KAAO,eACR,GAA0B,KAAK,mBAAmB,EAAwB,IAC9E,KAAK,iBAAiB,EAAK,SAAU,GACrC,UAEG,gBACH,EAAK,KAAO,cACZ,KAAK,aAAa,EAAK,SAAU,GAC7B,EAAK,SAAS,OAAS,qBACvB,KAAK,MAAM,EAAK,SAAS,MAAO,6CACpC,UAEG,uBACH,AAAI,EAAK,WAAa,KAAO,KAAK,MAAM,EAAK,KAAK,IAAK,+DACvD,EAAK,KAAO,oBACZ,MAAO,GAAK,SACZ,KAAK,aAAa,EAAK,KAAM,GAC7B,UAEG,0BACH,KAAK,aAAa,EAAK,WAAY,EAAW,GAC9C,UAEG,kBACH,KAAK,iBAAiB,EAAK,MAAO,qDAClC,UAEG,mBACH,GAAI,CAAC,EAAa,cAGlB,KAAK,MAAM,EAAK,MAAO,2BAEpB,AAAI,IAA0B,KAAK,mBAAmB,EAAwB,IACrF,MAAO,IAKT,GAAK,iBAAmB,SAAS,EAAU,EAAW,CAEpD,OADI,GAAM,EAAS,OACV,EAAI,EAAG,EAAI,EAAK,IAAK,CAC5B,GAAI,GAAM,EAAS,GACnB,AAAI,GAAO,KAAK,aAAa,EAAK,GAEpC,GAAI,EAAK,CACP,GAAI,GAAO,EAAS,EAAM,GAC1B,AAAI,KAAK,QAAQ,cAAgB,GAAK,GAAa,GAAQ,EAAK,OAAS,eAAiB,EAAK,SAAS,OAAS,cAC7G,KAAK,WAAW,EAAK,SAAS,OAEpC,MAAO,IAKT,GAAK,YAAc,SAAS,EAAwB,CAClD,GAAI,GAAO,KAAK,YAChB,YAAK,OACL,EAAK,SAAW,KAAK,iBAAiB,GAAO,GACtC,KAAK,WAAW,EAAM,kBAG/B,GAAK,iBAAmB,UAAW,CACjC,GAAI,GAAO,KAAK,YAChB,YAAK,OAGD,KAAK,QAAQ,cAAgB,GAAK,KAAK,OAAS,EAAQ,MACxD,KAAK,aAET,EAAK,SAAW,KAAK,mBAEd,KAAK,WAAW,EAAM,gBAK/B,GAAK,iBAAmB,UAAW,CACjC,GAAI,KAAK,QAAQ,aAAe,EAC9B,OAAQ,KAAK,UACR,GAAQ,SACX,GAAI,GAAO,KAAK,YAChB,YAAK,OACL,EAAK,SAAW,KAAK,iBAAiB,EAAQ,SAAU,GAAM,IACvD,KAAK,WAAW,EAAM,oBAE1B,GAAQ,OACX,MAAO,MAAK,SAAS,IAGzB,MAAO,MAAK,cAGd,GAAK,iBAAmB,SAAS,EAAO,EAAY,EAAoB,CAEtE,OADI,GAAO,GAAI,EAAQ,GAChB,CAAC,KAAK,IAAI,IAGf,GAFA,AAAI,EAAS,EAAQ,GACd,KAAK,OAAO,EAAQ,OACvB,GAAc,KAAK,OAAS,EAAQ,MACtC,EAAK,KAAK,UACL,IAAI,GAAsB,KAAK,mBAAmB,GACvD,MACK,GAAI,KAAK,OAAS,EAAQ,SAAU,CACzC,GAAI,GAAO,KAAK,mBAChB,KAAK,qBAAqB,GAC1B,EAAK,KAAK,GACN,KAAK,OAAS,EAAQ,OAAS,KAAK,MAAM,KAAK,MAAO,iDAC1D,KAAK,OAAO,GACZ,UACK,CACL,GAAI,GAAO,KAAK,kBAAkB,KAAK,MAAO,KAAK,UACnD,KAAK,qBAAqB,GAC1B,EAAK,KAAK,IAGd,MAAO,IAGT,GAAK,qBAAuB,SAAS,EAAO,CAC1C,MAAO,IAKT,GAAK,kBAAoB,SAAS,EAAU,EAAU,EAAM,CAE1D,GADA,EAAO,GAAQ,KAAK,mBAChB,KAAK,QAAQ,YAAc,GAAK,CAAC,KAAK,IAAI,EAAQ,IAAO,MAAO,GACpE,GAAI,GAAO,KAAK,YAAY,EAAU,GACtC,SAAK,KAAO,EACZ,EAAK,MAAQ,KAAK,mBACX,KAAK,WAAW,EAAM,sBAmE/B,GAAK,gBAAkB,SAAS,EAAM,EAAa,EAAc,CAC/D,AAAK,IAAgB,QAAS,GAAc,IAE5C,GAAI,GAAS,IAAgB,GAE7B,OAAQ,EAAK,UACR,aACH,AAAI,KAAK,QAAU,KAAK,wBAAwB,KAAK,EAAK,OACtD,KAAK,iBAAiB,EAAK,MAAQ,GAAS,WAAa,iBAAmB,EAAK,KAAO,mBACxF,GACE,KAAgB,IAAgB,EAAK,OAAS,OAC9C,KAAK,iBAAiB,EAAK,MAAO,+CAClC,GACE,IAAO,EAAc,EAAK,OAC1B,KAAK,iBAAiB,EAAK,MAAO,uBACtC,EAAa,EAAK,MAAQ,IAExB,IAAgB,IAAgB,KAAK,YAAY,EAAK,KAAM,EAAa,EAAK,QAEpF,UAEG,kBACH,KAAK,iBAAiB,EAAK,MAAO,qDAClC,UAEG,mBACH,AAAI,GAAU,KAAK,iBAAiB,EAAK,MAAO,6BAChD,UAEG,0BACH,MAAI,IAAU,KAAK,iBAAiB,EAAK,MAAO,oCACzC,KAAK,gBAAgB,EAAK,WAAY,EAAa,WAG1D,KAAK,MAAM,EAAK,MAAQ,GAAS,UAAY,gBAAkB,aAInE,GAAK,iBAAmB,SAAS,EAAM,EAAa,EAAc,CAGhE,OAFK,IAAgB,QAAS,GAAc,IAEpC,EAAK,UACR,gBACH,OAAS,GAAI,EAAG,EAAO,EAAK,WAAY,EAAI,EAAK,OAAQ,GAAK,EAAG,CAC/D,GAAI,GAAO,EAAK,GAElB,KAAK,sBAAsB,EAAM,EAAa,GAE9C,UAEG,eACH,OAAS,GAAM,EAAG,EAAS,EAAK,SAAU,EAAM,EAAO,OAAQ,GAAO,EAAG,CACvE,GAAI,GAAO,EAAO,GAEpB,AAAI,GAAQ,KAAK,sBAAsB,EAAM,EAAa,GAE1D,cAGA,KAAK,gBAAgB,EAAM,EAAa,KAI5C,GAAK,sBAAwB,SAAS,EAAM,EAAa,EAAc,CAGrE,OAFK,IAAgB,QAAS,GAAc,IAEpC,EAAK,UACR,WAEH,KAAK,sBAAsB,EAAK,MAAO,EAAa,GACpD,UAEG,oBACH,KAAK,iBAAiB,EAAK,KAAM,EAAa,GAC9C,UAEG,cACH,KAAK,iBAAiB,EAAK,SAAU,EAAa,GAClD,cAGA,KAAK,iBAAiB,EAAM,EAAa,KAM7C,GAAI,IAAa,SAAoB,EAAO,EAAQ,EAAe,EAAU,EAAW,CACtF,KAAK,MAAQ,EACb,KAAK,OAAS,CAAC,CAAC,EAChB,KAAK,cAAgB,CAAC,CAAC,EACvB,KAAK,SAAW,EAChB,KAAK,UAAY,CAAC,CAAC,GAGjB,GAAQ,CACV,OAAQ,GAAI,IAAW,IAAK,IAC5B,OAAQ,GAAI,IAAW,IAAK,IAC5B,OAAQ,GAAI,IAAW,KAAM,IAC7B,OAAQ,GAAI,IAAW,IAAK,IAC5B,OAAQ,GAAI,IAAW,IAAK,IAC5B,OAAQ,GAAI,IAAW,IAAK,GAAM,GAAM,SAAU,EAAG,CAAE,MAAO,GAAE,yBAChE,OAAQ,GAAI,IAAW,WAAY,IACnC,OAAQ,GAAI,IAAW,WAAY,IACnC,WAAY,GAAI,IAAW,WAAY,GAAM,GAAO,KAAM,IAC1D,MAAO,GAAI,IAAW,WAAY,GAAO,GAAO,KAAM,KAGpD,GAAO,GAAO,UAElB,GAAK,eAAiB,UAAW,CAC/B,MAAO,CAAC,GAAM,SAGhB,GAAK,WAAa,UAAW,CAC3B,MAAO,MAAK,QAAQ,KAAK,QAAQ,OAAS,IAG5C,GAAK,aAAe,SAAS,EAAU,CACrC,GAAI,GAAS,KAAK,aAClB,MAAI,KAAW,GAAM,QAAU,IAAW,GAAM,OACrC,GACP,IAAa,EAAQ,OAAU,KAAW,GAAM,QAAU,IAAW,GAAM,QACpE,CAAC,EAAO,OAKf,IAAa,EAAQ,SAAW,IAAa,EAAQ,MAAQ,KAAK,YAC3D,GAAU,KAAK,KAAK,MAAM,MAAM,KAAK,WAAY,KAAK,QAC7D,IAAa,EAAQ,OAAS,IAAa,EAAQ,MAAQ,IAAa,EAAQ,KAAO,IAAa,EAAQ,QAAU,IAAa,EAAQ,MACpI,GACP,IAAa,EAAQ,OACd,IAAW,GAAM,OACxB,IAAa,EAAQ,MAAQ,IAAa,EAAQ,QAAU,IAAa,EAAQ,KAC1E,GACJ,CAAC,KAAK,aAGf,GAAK,mBAAqB,UAAW,CACnC,OAAS,GAAI,KAAK,QAAQ,OAAS,EAAG,GAAK,EAAG,IAAK,CACjD,GAAI,GAAU,KAAK,QAAQ,GAC3B,GAAI,EAAQ,QAAU,WAClB,MAAO,GAAQ,UAErB,MAAO,IAGT,GAAK,cAAgB,SAAS,EAAU,CACtC,GAAI,GAAQ,EAAO,KAAK,KACxB,AAAI,EAAK,SAAW,IAAa,EAAQ,IACrC,KAAK,YAAc,GAClB,AAAI,GAAS,EAAK,eACnB,EAAO,KAAK,KAAM,GAElB,KAAK,YAAc,EAAK,YAI9B,GAAK,gBAAkB,SAAS,EAAU,CACxC,AAAI,KAAK,eAAiB,GACxB,MAAK,QAAQ,KAAK,QAAQ,OAAS,GAAK,IAM5C,EAAQ,OAAO,cAAgB,EAAQ,OAAO,cAAgB,UAAW,CACvE,GAAI,KAAK,QAAQ,SAAW,EAAG,CAC7B,KAAK,YAAc,GACnB,OAEF,GAAI,GAAM,KAAK,QAAQ,MACvB,AAAI,IAAQ,GAAM,QAAU,KAAK,aAAa,QAAU,YACtD,GAAM,KAAK,QAAQ,OAErB,KAAK,YAAc,CAAC,EAAI,QAG1B,EAAQ,OAAO,cAAgB,SAAS,EAAU,CAChD,KAAK,QAAQ,KAAK,KAAK,aAAa,GAAY,GAAM,OAAS,GAAM,QACrE,KAAK,YAAc,IAGrB,EAAQ,aAAa,cAAgB,UAAW,CAC9C,KAAK,QAAQ,KAAK,GAAM,QACxB,KAAK,YAAc,IAGrB,EAAQ,OAAO,cAAgB,SAAS,EAAU,CAChD,GAAI,GAAkB,IAAa,EAAQ,KAAO,IAAa,EAAQ,MAAQ,IAAa,EAAQ,OAAS,IAAa,EAAQ,OAClI,KAAK,QAAQ,KAAK,EAAkB,GAAM,OAAS,GAAM,QACzD,KAAK,YAAc,IAGrB,EAAQ,OAAO,cAAgB,UAAW,GAI1C,EAAQ,UAAU,cAAgB,EAAQ,OAAO,cAAgB,SAAS,EAAU,CAClF,AAAI,EAAS,YAAc,IAAa,EAAQ,OAC5C,CAAE,KAAa,EAAQ,MAAQ,KAAK,eAAiB,GAAM,SAC3D,CAAE,KAAa,EAAQ,SAAW,GAAU,KAAK,KAAK,MAAM,MAAM,KAAK,WAAY,KAAK,UACxF,CAAG,MAAa,EAAQ,OAAS,IAAa,EAAQ,SAAW,KAAK,eAAiB,GAAM,QAC7F,KAAK,QAAQ,KAAK,GAAM,QAExB,KAAK,QAAQ,KAAK,GAAM,QAC5B,KAAK,YAAc,IAGrB,EAAQ,UAAU,cAAgB,UAAW,CAC3C,AAAI,KAAK,eAAiB,GAAM,OAC5B,KAAK,QAAQ,MAEb,KAAK,QAAQ,KAAK,GAAM,QAC5B,KAAK,YAAc,IAGrB,EAAQ,KAAK,cAAgB,SAAS,EAAU,CAC9C,GAAI,IAAa,EAAQ,UAAW,CAClC,GAAI,GAAQ,KAAK,QAAQ,OAAS,EAClC,AAAI,KAAK,QAAQ,KAAW,GAAM,OAC9B,KAAK,QAAQ,GAAS,GAAM,WAE5B,KAAK,QAAQ,GAAS,GAAM,MAElC,KAAK,YAAc,IAGrB,EAAQ,KAAK,cAAgB,SAAS,EAAU,CAC9C,GAAI,GAAU,GACd,AAAI,KAAK,QAAQ,aAAe,GAAK,IAAa,EAAQ,KACpD,MAAK,QAAU,MAAQ,CAAC,KAAK,aAC7B,KAAK,QAAU,SAAW,KAAK,uBAC/B,GAAU,IAEhB,KAAK,YAAc,GAKrB,GAAI,GAAO,GAAO,UAOlB,EAAK,eAAiB,SAAS,EAAM,EAAU,EAAwB,CACrE,GAAI,OAAK,QAAQ,aAAe,GAAK,EAAK,OAAS,kBAE/C,OAAK,QAAQ,aAAe,GAAM,GAAK,UAAY,EAAK,QAAU,EAAK,YAE3E,IAAI,GAAM,EAAK,IACX,EACJ,OAAQ,EAAI,UACP,aAAc,EAAO,EAAI,KAAM,UAC/B,UAAW,EAAO,OAAO,EAAI,OAAQ,cACjC,OAET,GAAI,GAAO,EAAK,KAChB,GAAI,KAAK,QAAQ,aAAe,EAAG,CACjC,AAAI,IAAS,aAAe,IAAS,QAC/B,GAAS,OACX,CAAI,EACE,EAAuB,YAAc,GACvC,GAAuB,YAAc,EAAI,OAG3C,KAAK,iBAAiB,EAAI,MAAO,uCAGrC,EAAS,MAAQ,IAEnB,OAEF,EAAO,IAAM,EACb,GAAI,GAAQ,EAAS,GACrB,GAAI,EAAO,CACT,GAAI,GACJ,AAAI,IAAS,OACX,EAAe,KAAK,QAAU,EAAM,MAAQ,EAAM,KAAO,EAAM,IAE/D,EAAe,EAAM,MAAQ,EAAM,GAEjC,GACA,KAAK,iBAAiB,EAAI,MAAO,gCAErC,GAAQ,EAAS,GAAQ,CACvB,KAAM,GACN,IAAK,GACL,IAAK,IAGT,EAAM,GAAQ,KAkBhB,EAAK,gBAAkB,SAAS,EAAS,EAAwB,CAC/D,GAAI,GAAW,KAAK,MAAO,EAAW,KAAK,SACvC,EAAO,KAAK,iBAAiB,EAAS,GAC1C,GAAI,KAAK,OAAS,EAAQ,MAAO,CAC/B,GAAI,GAAO,KAAK,YAAY,EAAU,GAEtC,IADA,EAAK,YAAc,CAAC,GACb,KAAK,IAAI,EAAQ,QAAU,EAAK,YAAY,KAAK,KAAK,iBAAiB,EAAS,IACvF,MAAO,MAAK,WAAW,EAAM,sBAE/B,MAAO,IAMT,EAAK,iBAAmB,SAAS,EAAS,EAAwB,EAAgB,CAChF,GAAI,KAAK,aAAa,SAAU,CAC9B,GAAI,KAAK,YAAe,MAAO,MAAK,WAAW,GAGxC,KAAK,YAAc,GAG5B,GAAI,GAAyB,GAAO,EAAiB,GAAI,EAAmB,GAAI,EAAiB,GACjG,AAAI,EACF,GAAiB,EAAuB,oBACxC,EAAmB,EAAuB,cAC1C,EAAiB,EAAuB,YACxC,EAAuB,oBAAsB,EAAuB,cAAgB,IAEpF,GAAyB,GAAI,IAC7B,EAAyB,IAG3B,GAAI,GAAW,KAAK,MAAO,EAAW,KAAK,SAC3C,AAAI,MAAK,OAAS,EAAQ,QAAU,KAAK,OAAS,EAAQ,OACxD,MAAK,iBAAmB,KAAK,MAC7B,KAAK,yBAA2B,IAAY,SAE9C,GAAI,GAAO,KAAK,sBAAsB,EAAS,GAE/C,GADI,GAAkB,GAAO,EAAe,KAAK,KAAM,EAAM,EAAU,IACnE,KAAK,KAAK,SAAU,CACtB,GAAI,GAAO,KAAK,YAAY,EAAU,GACtC,SAAK,SAAW,KAAK,MACjB,KAAK,OAAS,EAAQ,IACtB,GAAO,KAAK,aAAa,EAAM,GAAO,IACrC,GACH,GAAuB,oBAAsB,EAAuB,cAAgB,EAAuB,YAAc,IAEvH,EAAuB,iBAAmB,EAAK,OAC/C,GAAuB,gBAAkB,IAC7C,AAAI,KAAK,OAAS,EAAQ,GACtB,KAAK,iBAAiB,GAEtB,KAAK,gBAAgB,GACzB,EAAK,KAAO,EACZ,KAAK,OACL,EAAK,MAAQ,KAAK,iBAAiB,GAC/B,EAAiB,IAAM,GAAuB,YAAc,GACzD,KAAK,WAAW,EAAM,4BAE7B,AAAI,IAA0B,KAAK,sBAAsB,EAAwB,IAEnF,MAAI,GAAiB,IAAM,GAAuB,oBAAsB,GACpE,EAAmB,IAAM,GAAuB,cAAgB,GAC7D,GAKT,EAAK,sBAAwB,SAAS,EAAS,EAAwB,CACrE,GAAI,GAAW,KAAK,MAAO,EAAW,KAAK,SACvC,EAAO,KAAK,aAAa,EAAS,GACtC,GAAI,KAAK,sBAAsB,GAA2B,MAAO,GACjE,GAAI,KAAK,IAAI,EAAQ,UAAW,CAC9B,GAAI,GAAO,KAAK,YAAY,EAAU,GACtC,SAAK,KAAO,EACZ,EAAK,WAAa,KAAK,mBACvB,KAAK,OAAO,EAAQ,OACpB,EAAK,UAAY,KAAK,iBAAiB,GAChC,KAAK,WAAW,EAAM,yBAE/B,MAAO,IAKT,EAAK,aAAe,SAAS,EAAS,EAAwB,CAC5D,GAAI,GAAW,KAAK,MAAO,EAAW,KAAK,SACvC,EAAO,KAAK,gBAAgB,EAAwB,GAAO,GAAO,GACtE,MAAI,MAAK,sBAAsB,IACxB,EAAK,QAAU,GAAY,EAAK,OAAS,0BADiB,EACkB,KAAK,YAAY,EAAM,EAAU,EAAU,GAAI,IASpI,EAAK,YAAc,SAAS,EAAM,EAAc,EAAc,EAAS,EAAS,CAC9E,GAAI,GAAO,KAAK,KAAK,MACrB,GAAI,GAAQ,MAAS,EAAC,GAAW,KAAK,OAAS,EAAQ,MACjD,EAAO,EAAS,CAClB,GAAI,GAAU,KAAK,OAAS,EAAQ,WAAa,KAAK,OAAS,EAAQ,WACnE,EAAW,KAAK,OAAS,EAAQ,SACrC,AAAI,GAGF,GAAO,EAAQ,WAAW,OAE5B,GAAI,GAAK,KAAK,MACd,KAAK,OACL,GAAI,GAAW,KAAK,MAAO,EAAW,KAAK,SACvC,EAAQ,KAAK,YAAY,KAAK,gBAAgB,KAAM,GAAO,GAAO,GAAU,EAAU,EAAU,EAAM,GACtG,EAAO,KAAK,YAAY,EAAc,EAAc,EAAM,EAAO,EAAI,GAAW,GACpF,MAAK,IAAW,KAAK,OAAS,EAAQ,UAAc,GAAa,MAAK,OAAS,EAAQ,WAAa,KAAK,OAAS,EAAQ,cACxH,KAAK,iBAAiB,KAAK,MAAO,4FAE7B,KAAK,YAAY,EAAM,EAAc,EAAc,EAAS,GAGvE,MAAO,IAGT,EAAK,YAAc,SAAS,EAAU,EAAU,EAAM,EAAO,EAAI,EAAS,CACxE,AAAI,EAAM,OAAS,qBAAuB,KAAK,MAAM,EAAM,MAAO,iEAClE,GAAI,GAAO,KAAK,YAAY,EAAU,GACtC,SAAK,KAAO,EACZ,EAAK,SAAW,EAChB,EAAK,MAAQ,EACN,KAAK,WAAW,EAAM,EAAU,oBAAsB,qBAK/D,EAAK,gBAAkB,SAAS,EAAwB,EAAU,EAAQ,EAAS,CACjF,GAAI,GAAW,KAAK,MAAO,EAAW,KAAK,SAAU,EACrD,GAAI,KAAK,aAAa,UAAY,KAAK,SACrC,EAAO,KAAK,WAAW,GACvB,EAAW,WACF,KAAK,KAAK,OAAQ,CAC3B,GAAI,GAAO,KAAK,YAAa,EAAS,KAAK,OAAS,EAAQ,OAC5D,EAAK,SAAW,KAAK,MACrB,EAAK,OAAS,GACd,KAAK,OACL,EAAK,SAAW,KAAK,gBAAgB,KAAM,GAAM,EAAQ,GACzD,KAAK,sBAAsB,EAAwB,IACnD,AAAI,EAAU,KAAK,gBAAgB,EAAK,UACnC,AAAI,KAAK,QAAU,EAAK,WAAa,UACjC,EAAK,SAAS,OAAS,aAC5B,KAAK,iBAAiB,EAAK,MAAO,0CACjC,AAAI,EAAK,WAAa,UAAY,GAAqB,EAAK,UAC7D,KAAK,iBAAiB,EAAK,MAAO,qCAC/B,EAAW,GAClB,EAAO,KAAK,WAAW,EAAM,EAAS,mBAAqB,2BAClD,CAAC,GAAY,KAAK,OAAS,EAAQ,UAC5C,AAAI,IAAW,KAAK,iBAAiB,SAAW,IAAK,KAAK,aAC1D,EAAO,KAAK,oBAER,KAAK,OAAS,EAAQ,KAAO,KAAK,iBACjC,CAEL,GADA,EAAO,KAAK,oBAAoB,EAAwB,GACpD,KAAK,sBAAsB,GAA2B,MAAO,GACjE,KAAO,KAAK,KAAK,SAAW,CAAC,KAAK,sBAAsB,CACtD,GAAI,GAAS,KAAK,YAAY,EAAU,GACxC,EAAO,SAAW,KAAK,MACvB,EAAO,OAAS,GAChB,EAAO,SAAW,EAClB,KAAK,gBAAgB,GACrB,KAAK,OACL,EAAO,KAAK,WAAW,EAAQ,qBAInC,GAAI,CAAC,GAAU,KAAK,IAAI,EAAQ,UAC9B,GAAI,EACA,KAAK,WAAW,KAAK,kBAErB,OAAO,MAAK,YAAY,EAAU,EAAU,EAAM,KAAK,gBAAgB,KAAM,GAAO,GAAO,GAAU,KAAM,QAE/G,OAAO,IAIX,YAA8B,EAAM,CAClC,MACE,GAAK,OAAS,oBAAsB,EAAK,SAAS,OAAS,qBAC3D,EAAK,OAAS,mBAAqB,GAAqB,EAAK,YAMjE,EAAK,oBAAsB,SAAS,EAAwB,EAAS,CACnE,GAAI,GAAW,KAAK,MAAO,EAAW,KAAK,SACvC,EAAO,KAAK,cAAc,EAAwB,GACtD,GAAI,EAAK,OAAS,2BAA6B,KAAK,MAAM,MAAM,KAAK,aAAc,KAAK,cAAgB,IACpG,MAAO,GACX,GAAI,GAAS,KAAK,gBAAgB,EAAM,EAAU,EAAU,GAAO,GACnE,MAAI,IAA0B,EAAO,OAAS,oBACxC,GAAuB,qBAAuB,EAAO,OAAS,GAAuB,oBAAsB,IAC3G,EAAuB,mBAAqB,EAAO,OAAS,GAAuB,kBAAoB,IACvG,EAAuB,eAAiB,EAAO,OAAS,GAAuB,cAAgB,KAE9F,GAGT,EAAK,gBAAkB,SAAS,EAAM,EAAU,EAAU,EAAS,EAAS,CAM1E,OALI,GAAkB,KAAK,QAAQ,aAAe,GAAK,EAAK,OAAS,cAAgB,EAAK,OAAS,SAC/F,KAAK,aAAe,EAAK,KAAO,CAAC,KAAK,sBAAwB,EAAK,IAAM,EAAK,OAAU,GACxF,KAAK,mBAAqB,EAAK,MAC/B,EAAkB,KAET,CACX,GAAI,GAAU,KAAK,eAAe,EAAM,EAAU,EAAU,EAAS,EAAiB,EAAiB,GAGvG,GADI,EAAQ,UAAY,GAAkB,IACtC,IAAY,GAAQ,EAAQ,OAAS,0BAA2B,CAClE,GAAI,EAAiB,CACnB,GAAI,GAAY,KAAK,YAAY,EAAU,GAC3C,EAAU,WAAa,EACvB,EAAU,KAAK,WAAW,EAAW,mBAEvC,MAAO,GAGT,EAAO,IAIX,EAAK,eAAiB,SAAS,EAAM,EAAU,EAAU,EAAS,EAAiB,EAAiB,EAAS,CAC3G,GAAI,GAAoB,KAAK,QAAQ,aAAe,GAChD,EAAW,GAAqB,KAAK,IAAI,EAAQ,aACrD,AAAI,GAAW,GAAY,KAAK,MAAM,KAAK,aAAc,oEAEzD,GAAI,GAAW,KAAK,IAAI,EAAQ,UAChC,GAAI,GAAa,GAAY,KAAK,OAAS,EAAQ,QAAU,KAAK,OAAS,EAAQ,WAAc,KAAK,IAAI,EAAQ,KAAM,CACtH,GAAI,GAAO,KAAK,YAAY,EAAU,GACtC,EAAK,OAAS,EACd,AAAI,EACF,GAAK,SAAW,KAAK,kBACrB,KAAK,OAAO,EAAQ,WACf,AAAI,KAAK,OAAS,EAAQ,WAAa,EAAK,OAAS,QAC1D,EAAK,SAAW,KAAK,oBAErB,EAAK,SAAW,KAAK,WAAW,KAAK,QAAQ,gBAAkB,SAEjE,EAAK,SAAW,CAAC,CAAC,EACd,GACF,GAAK,SAAW,GAElB,EAAO,KAAK,WAAW,EAAM,4BACpB,CAAC,GAAW,KAAK,IAAI,EAAQ,QAAS,CAC/C,GAAI,GAAyB,GAAI,IAAqB,EAAc,KAAK,SAAU,EAAc,KAAK,SAAU,EAAmB,KAAK,cACxI,KAAK,SAAW,EAChB,KAAK,SAAW,EAChB,KAAK,cAAgB,EACrB,GAAI,GAAW,KAAK,cAAc,EAAQ,OAAQ,KAAK,QAAQ,aAAe,EAAG,GAAO,GACxF,GAAI,GAAmB,CAAC,GAAY,CAAC,KAAK,sBAAwB,KAAK,IAAI,EAAQ,OACjF,YAAK,mBAAmB,EAAwB,IAChD,KAAK,iCACD,KAAK,cAAgB,GACrB,KAAK,MAAM,KAAK,cAAe,6DACnC,KAAK,SAAW,EAChB,KAAK,SAAW,EAChB,KAAK,cAAgB,EACd,KAAK,qBAAqB,KAAK,YAAY,EAAU,GAAW,EAAU,GAAM,GAEzF,KAAK,sBAAsB,EAAwB,IACnD,KAAK,SAAW,GAAe,KAAK,SACpC,KAAK,SAAW,GAAe,KAAK,SACpC,KAAK,cAAgB,GAAoB,KAAK,cAC9C,GAAI,GAAS,KAAK,YAAY,EAAU,GACxC,EAAO,OAAS,EAChB,EAAO,UAAY,EACf,GACF,GAAO,SAAW,GAEpB,EAAO,KAAK,WAAW,EAAQ,0BACtB,KAAK,OAAS,EAAQ,UAAW,CAC1C,AAAI,IAAY,IACd,KAAK,MAAM,KAAK,MAAO,6EAEzB,GAAI,GAAS,KAAK,YAAY,EAAU,GACxC,EAAO,IAAM,EACb,EAAO,MAAQ,KAAK,cAAc,CAAC,SAAU,KAC7C,EAAO,KAAK,WAAW,EAAQ,4BAEjC,MAAO,IAQT,EAAK,cAAgB,SAAS,EAAwB,EAAS,CAG7D,AAAI,KAAK,OAAS,EAAQ,OAAS,KAAK,aAExC,GAAI,GAAM,EAAa,KAAK,mBAAqB,KAAK,MACtD,OAAQ,KAAK,UACR,GAAQ,OACX,MAAK,MAAK,YACN,KAAK,MAAM,KAAK,MAAO,oCAC3B,EAAO,KAAK,YACZ,KAAK,OACD,KAAK,OAAS,EAAQ,QAAU,CAAC,KAAK,kBACtC,KAAK,MAAM,EAAK,MAAO,kDAOvB,KAAK,OAAS,EAAQ,KAAO,KAAK,OAAS,EAAQ,UAAY,KAAK,OAAS,EAAQ,QACrF,KAAK,aACF,KAAK,WAAW,EAAM,aAE1B,GAAQ,MACX,SAAO,KAAK,YACZ,KAAK,OACE,KAAK,WAAW,EAAM,sBAE1B,GAAQ,KACX,GAAI,GAAW,KAAK,MAAO,EAAW,KAAK,SAAU,EAAc,KAAK,YACpE,EAAK,KAAK,WAAW,IACzB,GAAI,KAAK,QAAQ,aAAe,GAAK,CAAC,GAAe,EAAG,OAAS,SAAW,CAAC,KAAK,sBAAwB,KAAK,IAAI,EAAQ,WACzH,YAAK,gBAAgB,GAAM,QACpB,KAAK,cAAc,KAAK,YAAY,EAAU,GAAW,EAAG,GAAO,GAAM,GAElF,GAAI,GAAc,CAAC,KAAK,qBAAsB,CAC5C,GAAI,KAAK,IAAI,EAAQ,OACjB,MAAO,MAAK,qBAAqB,KAAK,YAAY,EAAU,GAAW,CAAC,GAAK,GAAO,GACxF,GAAI,KAAK,QAAQ,aAAe,GAAK,EAAG,OAAS,SAAW,KAAK,OAAS,EAAQ,MAAQ,CAAC,GACtF,EAAC,KAAK,0BAA4B,KAAK,QAAU,MAAQ,KAAK,aACjE,SAAK,KAAK,WAAW,IACjB,MAAK,sBAAwB,CAAC,KAAK,IAAI,EAAQ,SAC/C,KAAK,aACF,KAAK,qBAAqB,KAAK,YAAY,EAAU,GAAW,CAAC,GAAK,GAAM,GAGvF,MAAO,OAEJ,GAAQ,OACX,GAAI,GAAQ,KAAK,MACjB,SAAO,KAAK,aAAa,EAAM,OAC/B,EAAK,MAAQ,CAAC,QAAS,EAAM,QAAS,MAAO,EAAM,OAC5C,MAEJ,GAAQ,QAAU,GAAQ,OAC7B,MAAO,MAAK,aAAa,KAAK,WAE3B,GAAQ,UAAY,GAAQ,UAAY,GAAQ,OACnD,SAAO,KAAK,YACZ,EAAK,MAAQ,KAAK,OAAS,EAAQ,MAAQ,KAAO,KAAK,OAAS,EAAQ,MACxE,EAAK,IAAM,KAAK,KAAK,QACrB,KAAK,OACE,KAAK,WAAW,EAAM,eAE1B,GAAQ,OACX,GAAI,GAAQ,KAAK,MAAO,EAAO,KAAK,mCAAmC,EAAY,GACnF,MAAI,IACE,GAAuB,oBAAsB,GAAK,CAAC,KAAK,qBAAqB,IAC7E,GAAuB,oBAAsB,GAC7C,EAAuB,kBAAoB,GAC3C,GAAuB,kBAAoB,IAE1C,MAEJ,GAAQ,SACX,SAAO,KAAK,YACZ,KAAK,OACL,EAAK,SAAW,KAAK,cAAc,EAAQ,SAAU,GAAM,GAAM,GAC1D,KAAK,WAAW,EAAM,uBAE1B,GAAQ,OACX,YAAK,gBAAgB,GAAM,QACpB,KAAK,SAAS,GAAO,OAEzB,GAAQ,UACX,SAAO,KAAK,YACZ,KAAK,OACE,KAAK,cAAc,EAAM,OAE7B,GAAQ,OACX,MAAO,MAAK,WAAW,KAAK,YAAa,QAEtC,GAAQ,KACX,MAAO,MAAK,eAET,GAAQ,UACX,MAAO,MAAK,oBAET,GAAQ,QACX,MAAI,MAAK,QAAQ,aAAe,GACvB,KAAK,kBAEL,KAAK,qBAId,KAAK,eAIT,EAAK,gBAAkB,UAAW,CAChC,GAAI,GAAO,KAAK,YAIhB,AAAI,KAAK,aAAe,KAAK,iBAAiB,KAAK,MAAO,qCAC1D,GAAI,GAAO,KAAK,WAAW,IAE3B,OAAQ,KAAK,UACR,GAAQ,OACX,MAAO,MAAK,mBAAmB,OAC5B,GAAQ,IACX,SAAK,KAAO,EACL,KAAK,gBAAgB,WAE5B,KAAK,eAIT,EAAK,mBAAqB,SAAS,EAAM,CAOvC,GANA,KAAK,OAGL,EAAK,OAAS,KAAK,mBAGf,CAAC,KAAK,IAAI,EAAQ,QAAS,CAC7B,GAAI,GAAW,KAAK,MACpB,AAAI,KAAK,IAAI,EAAQ,QAAU,KAAK,IAAI,EAAQ,QAC9C,KAAK,iBAAiB,EAAU,6CAEhC,KAAK,WAAW,GAIpB,MAAO,MAAK,WAAW,EAAM,qBAG/B,EAAK,gBAAkB,SAAS,EAAM,CACpC,KAAK,OAEL,GAAI,GAAc,KAAK,YACvB,SAAK,SAAW,KAAK,WAAW,IAE5B,EAAK,SAAS,OAAS,QACvB,KAAK,iBAAiB,EAAK,SAAS,MAAO,4DAC3C,GACA,KAAK,iBAAiB,EAAK,MAAO,qDAClC,KAAK,QAAQ,aAAe,UAAY,CAAC,KAAK,QAAQ,6BACtD,KAAK,iBAAiB,EAAK,MAAO,6CAE/B,KAAK,WAAW,EAAM,iBAG/B,EAAK,aAAe,SAAS,EAAO,CAClC,GAAI,GAAO,KAAK,YAChB,SAAK,MAAQ,EACb,EAAK,IAAM,KAAK,MAAM,MAAM,KAAK,MAAO,KAAK,KACzC,EAAK,IAAI,WAAW,EAAK,IAAI,OAAS,KAAO,KAAO,GAAK,OAAS,EAAK,IAAI,MAAM,EAAG,IAAI,QAAQ,KAAM,KAC1G,KAAK,OACE,KAAK,WAAW,EAAM,YAG/B,EAAK,qBAAuB,UAAW,CACrC,KAAK,OAAO,EAAQ,QACpB,GAAI,GAAM,KAAK,kBACf,YAAK,OAAO,EAAQ,QACb,GAGT,EAAK,mCAAqC,SAAS,EAAY,EAAS,CACtE,GAAI,GAAW,KAAK,MAAO,EAAW,KAAK,SAAU,EAAK,EAAqB,KAAK,QAAQ,aAAe,EAC3G,GAAI,KAAK,QAAQ,aAAe,EAAG,CACjC,KAAK,OAEL,GAAI,GAAgB,KAAK,MAAO,EAAgB,KAAK,SACjD,EAAW,GAAI,EAAQ,GAAM,EAAc,GAC3C,EAAyB,GAAI,IAAqB,EAAc,KAAK,SAAU,EAAc,KAAK,SAAU,EAIhH,IAHA,KAAK,SAAW,EAChB,KAAK,SAAW,EAET,KAAK,OAAS,EAAQ,QAE3B,GADA,EAAQ,EAAQ,GAAQ,KAAK,OAAO,EAAQ,OACxC,GAAsB,KAAK,mBAAmB,EAAQ,OAAQ,IAAO,CACvE,EAAc,GACd,cACS,KAAK,OAAS,EAAQ,SAAU,CACzC,EAAc,KAAK,MACnB,EAAS,KAAK,KAAK,eAAe,KAAK,qBACnC,KAAK,OAAS,EAAQ,OAAS,KAAK,MAAM,KAAK,MAAO,iDAC1D,UAEA,GAAS,KAAK,KAAK,iBAAiB,GAAO,EAAwB,KAAK,iBAG5E,GAAI,GAAc,KAAK,WAAY,EAAc,KAAK,cAGtD,GAFA,KAAK,OAAO,EAAQ,QAEhB,GAAc,CAAC,KAAK,sBAAwB,KAAK,IAAI,EAAQ,OAC/D,YAAK,mBAAmB,EAAwB,IAChD,KAAK,iCACL,KAAK,SAAW,EAChB,KAAK,SAAW,EACT,KAAK,oBAAoB,EAAU,EAAU,EAAU,GAGhE,AAAI,EAAC,EAAS,QAAU,IAAe,KAAK,WAAW,KAAK,cACxD,GAAe,KAAK,WAAW,GACnC,KAAK,sBAAsB,EAAwB,IACnD,KAAK,SAAW,GAAe,KAAK,SACpC,KAAK,SAAW,GAAe,KAAK,SAEpC,AAAI,EAAS,OAAS,EACpB,GAAM,KAAK,YAAY,EAAe,GACtC,EAAI,YAAc,EAClB,KAAK,aAAa,EAAK,qBAAsB,EAAa,IAE1D,EAAM,EAAS,OAGjB,GAAM,KAAK,uBAGb,GAAI,KAAK,QAAQ,eAAgB,CAC/B,GAAI,GAAM,KAAK,YAAY,EAAU,GACrC,SAAI,WAAa,EACV,KAAK,WAAW,EAAK,+BAE5B,OAAO,IAIX,EAAK,eAAiB,SAAS,EAAM,CACnC,MAAO,IAGT,EAAK,oBAAsB,SAAS,EAAU,EAAU,EAAU,EAAS,CACzE,MAAO,MAAK,qBAAqB,KAAK,YAAY,EAAU,GAAW,EAAU,GAAO,IAS1F,GAAI,IAAQ,GAEZ,EAAK,SAAW,UAAW,CACzB,AAAI,KAAK,aAAe,KAAK,iBAAiB,KAAK,MAAO,kCAC1D,GAAI,GAAO,KAAK,YACZ,EAAO,KAAK,WAAW,IAC3B,GAAI,KAAK,QAAQ,aAAe,GAAK,KAAK,IAAI,EAAQ,KAAM,CAC1D,EAAK,KAAO,EACZ,GAAI,GAAc,KAAK,YACvB,SAAK,SAAW,KAAK,WAAW,IAC5B,EAAK,SAAS,OAAS,UACvB,KAAK,iBAAiB,EAAK,SAAS,MAAO,wDAC3C,GACA,KAAK,iBAAiB,EAAK,MAAO,oDACjC,KAAK,mBACN,KAAK,iBAAiB,EAAK,MAAO,qEAC/B,KAAK,WAAW,EAAM,gBAE/B,GAAI,GAAW,KAAK,MAAO,EAAW,KAAK,SAAU,EAAW,KAAK,OAAS,EAAQ,QACtF,SAAK,OAAS,KAAK,gBAAgB,KAAK,gBAAiB,EAAU,EAAU,GAAM,IAC/E,GAAY,EAAK,OAAO,OAAS,oBACnC,KAAK,MAAM,EAAU,gCAEvB,AAAI,KAAK,IAAI,EAAQ,QAAW,EAAK,UAAY,KAAK,cAAc,EAAQ,OAAQ,KAAK,QAAQ,aAAe,EAAG,IAC5G,EAAK,UAAY,GACjB,KAAK,WAAW,EAAM,kBAK/B,EAAK,qBAAuB,SAAS,EAAK,CACxC,GAAI,GAAW,EAAI,SAEf,EAAO,KAAK,YAChB,MAAI,MAAK,OAAS,EAAQ,gBACnB,IACH,KAAK,iBAAiB,KAAK,MAAO,oDAEpC,EAAK,MAAQ,CACX,IAAK,KAAK,MACV,OAAQ,OAGV,EAAK,MAAQ,CACX,IAAK,KAAK,MAAM,MAAM,KAAK,MAAO,KAAK,KAAK,QAAQ,SAAU;AAAA,GAC9D,OAAQ,KAAK,OAGjB,KAAK,OACL,EAAK,KAAO,KAAK,OAAS,EAAQ,UAC3B,KAAK,WAAW,EAAM,oBAG/B,EAAK,cAAgB,SAAS,EAAK,CACjC,AAAK,IAAQ,QAAS,GAAM,IAC5B,GAAI,GAAW,EAAI,SAAU,AAAK,IAAa,QAAS,GAAW,IAEnE,GAAI,GAAO,KAAK,YAChB,KAAK,OACL,EAAK,YAAc,GACnB,GAAI,GAAS,KAAK,qBAAqB,CAAC,SAAU,IAElD,IADA,EAAK,OAAS,CAAC,GACR,CAAC,EAAO,MACb,AAAI,KAAK,OAAS,EAAQ,KAAO,KAAK,MAAM,KAAK,IAAK,iCACtD,KAAK,OAAO,EAAQ,cACpB,EAAK,YAAY,KAAK,KAAK,mBAC3B,KAAK,OAAO,EAAQ,QACpB,EAAK,OAAO,KAAK,EAAS,KAAK,qBAAqB,CAAC,SAAU,KAEjE,YAAK,OACE,KAAK,WAAW,EAAM,oBAG/B,EAAK,YAAc,SAAS,EAAM,CAChC,MAAO,CAAC,EAAK,UAAY,EAAK,IAAI,OAAS,cAAgB,EAAK,IAAI,OAAS,SAC1E,MAAK,OAAS,EAAQ,MAAQ,KAAK,OAAS,EAAQ,KAAO,KAAK,OAAS,EAAQ,QAAU,KAAK,OAAS,EAAQ,UAAY,KAAK,KAAK,SAAY,KAAK,QAAQ,aAAe,GAAK,KAAK,OAAS,EAAQ,OAC3M,CAAC,GAAU,KAAK,KAAK,MAAM,MAAM,KAAK,WAAY,KAAK,SAK3D,EAAK,SAAW,SAAS,EAAW,EAAwB,CAC1D,GAAI,GAAO,KAAK,YAAa,EAAQ,GAAM,EAAW,GAGtD,IAFA,EAAK,WAAa,GAClB,KAAK,OACE,CAAC,KAAK,IAAI,EAAQ,SAAS,CAChC,GAAK,EAGI,EAAQ,WAFf,KAAK,OAAO,EAAQ,OAChB,KAAK,QAAQ,aAAe,GAAK,KAAK,mBAAmB,EAAQ,QAAW,MAGlF,GAAI,GAAO,KAAK,cAAc,EAAW,GACzC,AAAK,GAAa,KAAK,eAAe,EAAM,EAAU,GACtD,EAAK,WAAW,KAAK,GAEvB,MAAO,MAAK,WAAW,EAAM,EAAY,gBAAkB,qBAG7D,EAAK,cAAgB,SAAS,EAAW,EAAwB,CAC/D,GAAI,GAAO,KAAK,YAAa,EAAa,EAAS,EAAU,EAC7D,GAAI,KAAK,QAAQ,aAAe,GAAK,KAAK,IAAI,EAAQ,UACpD,MAAI,GACF,GAAK,SAAW,KAAK,WAAW,IAC5B,KAAK,OAAS,EAAQ,OACxB,KAAK,MAAM,KAAK,MAAO,iDAElB,KAAK,WAAW,EAAM,gBAG3B,MAAK,OAAS,EAAQ,QAAU,GAC9B,GAAuB,oBAAsB,GAC/C,GAAuB,oBAAsB,KAAK,OAEhD,EAAuB,kBAAoB,GAC7C,GAAuB,kBAAoB,KAAK,QAIpD,EAAK,SAAW,KAAK,iBAAiB,GAAO,GAEzC,KAAK,OAAS,EAAQ,OAAS,GAA0B,EAAuB,cAAgB,GAClG,GAAuB,cAAgB,KAAK,OAGvC,KAAK,WAAW,EAAM,kBAE/B,AAAI,KAAK,QAAQ,aAAe,GAC9B,GAAK,OAAS,GACd,EAAK,UAAY,GACb,IAAa,IACf,GAAW,KAAK,MAChB,EAAW,KAAK,UAEb,GACD,GAAc,KAAK,IAAI,EAAQ,QAErC,GAAI,GAAc,KAAK,YACvB,YAAK,kBAAkB,GACvB,AAAI,CAAC,GAAa,CAAC,GAAe,KAAK,QAAQ,aAAe,GAAK,CAAC,GAAe,KAAK,YAAY,GAClG,GAAU,GACV,EAAc,KAAK,QAAQ,aAAe,GAAK,KAAK,IAAI,EAAQ,MAChE,KAAK,kBAAkB,EAAM,IAE7B,EAAU,GAEZ,KAAK,mBAAmB,EAAM,EAAW,EAAa,EAAS,EAAU,EAAU,EAAwB,GACpG,KAAK,WAAW,EAAM,aAG/B,EAAK,mBAAqB,SAAS,EAAM,EAAW,EAAa,EAAS,EAAU,EAAU,EAAwB,EAAa,CAIjI,GAHK,IAAe,IAAY,KAAK,OAAS,EAAQ,OAClD,KAAK,aAEL,KAAK,IAAI,EAAQ,OACnB,EAAK,MAAQ,EAAY,KAAK,kBAAkB,KAAK,MAAO,KAAK,UAAY,KAAK,iBAAiB,GAAO,GAC1G,EAAK,KAAO,eACH,KAAK,QAAQ,aAAe,GAAK,KAAK,OAAS,EAAQ,OAChE,AAAI,GAAa,KAAK,aACtB,EAAK,KAAO,OACZ,EAAK,OAAS,GACd,EAAK,MAAQ,KAAK,YAAY,EAAa,WAClC,CAAC,GAAa,CAAC,GACf,KAAK,QAAQ,aAAe,GAAK,CAAC,EAAK,UAAY,EAAK,IAAI,OAAS,cACpE,GAAK,IAAI,OAAS,OAAS,EAAK,IAAI,OAAS,QAC7C,KAAK,OAAS,EAAQ,OAAS,KAAK,OAAS,EAAQ,QAAU,KAAK,OAAS,EAAQ,GAAK,CACpG,AAAI,IAAe,IAAW,KAAK,aACnC,EAAK,KAAO,EAAK,IAAI,KACrB,KAAK,kBAAkB,GACvB,EAAK,MAAQ,KAAK,YAAY,IAC9B,GAAI,GAAa,EAAK,OAAS,MAAQ,EAAI,EAC3C,GAAI,EAAK,MAAM,OAAO,SAAW,EAAY,CAC3C,GAAI,GAAQ,EAAK,MAAM,MACvB,AAAI,EAAK,OAAS,MACd,KAAK,iBAAiB,EAAO,gCAE7B,KAAK,iBAAiB,EAAO,4CAEjC,AAAI,GAAK,OAAS,OAAS,EAAK,MAAM,OAAO,GAAG,OAAS,eACrD,KAAK,iBAAiB,EAAK,MAAM,OAAO,GAAG,MAAO,qCAEnD,AAAI,MAAK,QAAQ,aAAe,GAAK,CAAC,EAAK,UAAY,EAAK,IAAI,OAAS,aAC1E,KAAe,IAAW,KAAK,aACnC,KAAK,gBAAgB,EAAK,KACtB,EAAK,IAAI,OAAS,SAAW,CAAC,KAAK,eACnC,MAAK,cAAgB,GACzB,EAAK,KAAO,OACZ,AAAI,EACF,EAAK,MAAQ,KAAK,kBAAkB,EAAU,EAAU,KAAK,SAAS,EAAK,MACtE,AAAI,KAAK,OAAS,EAAQ,IAAM,EACjC,GAAuB,gBAAkB,GACzC,GAAuB,gBAAkB,KAAK,OAClD,EAAK,MAAQ,KAAK,kBAAkB,EAAU,EAAU,KAAK,SAAS,EAAK,OAE3E,EAAK,MAAQ,KAAK,SAAS,EAAK,KAElC,EAAK,UAAY,IACV,KAAK,cAGhB,EAAK,kBAAoB,SAAS,EAAM,CACtC,GAAI,KAAK,QAAQ,aAAe,EAAG,CACjC,GAAI,KAAK,IAAI,EAAQ,UACnB,SAAK,SAAW,GAChB,EAAK,IAAM,KAAK,mBAChB,KAAK,OAAO,EAAQ,UACb,EAAK,IAEZ,EAAK,SAAW,GAGpB,MAAO,GAAK,IAAM,KAAK,OAAS,EAAQ,KAAO,KAAK,OAAS,EAAQ,OAAS,KAAK,gBAAkB,KAAK,WAAW,KAAK,QAAQ,gBAAkB,UAKtJ,EAAK,aAAe,SAAS,EAAM,CACjC,EAAK,GAAK,KACN,KAAK,QAAQ,aAAe,GAAK,GAAK,UAAY,EAAK,WAAa,IACpE,KAAK,QAAQ,aAAe,GAAK,GAAK,MAAQ,KAKpD,EAAK,YAAc,SAAS,EAAa,EAAS,EAAkB,CAClE,GAAI,GAAO,KAAK,YAAa,EAAc,KAAK,SAAU,EAAc,KAAK,SAAU,EAAmB,KAAK,cAE/G,YAAK,aAAa,GACd,KAAK,QAAQ,aAAe,GAC5B,GAAK,UAAY,GACjB,KAAK,QAAQ,aAAe,GAC5B,GAAK,MAAQ,CAAC,CAAC,GAEnB,KAAK,SAAW,EAChB,KAAK,SAAW,EAChB,KAAK,cAAgB,EACrB,KAAK,WAAW,GAAc,EAAS,EAAK,WAAa,GAAe,GAAmB,GAAqB,IAEhH,KAAK,OAAO,EAAQ,QACpB,EAAK,OAAS,KAAK,iBAAiB,EAAQ,OAAQ,GAAO,KAAK,QAAQ,aAAe,GACvF,KAAK,iCACL,KAAK,kBAAkB,EAAM,GAAO,GAAM,IAE1C,KAAK,SAAW,EAChB,KAAK,SAAW,EAChB,KAAK,cAAgB,EACd,KAAK,WAAW,EAAM,uBAK/B,EAAK,qBAAuB,SAAS,EAAM,EAAQ,EAAS,EAAS,CACnE,GAAI,GAAc,KAAK,SAAU,EAAc,KAAK,SAAU,EAAmB,KAAK,cAEtF,YAAK,WAAW,GAAc,EAAS,IAAS,IAChD,KAAK,aAAa,GACd,KAAK,QAAQ,aAAe,GAAK,GAAK,MAAQ,CAAC,CAAC,GAEpD,KAAK,SAAW,EAChB,KAAK,SAAW,EAChB,KAAK,cAAgB,EAErB,EAAK,OAAS,KAAK,iBAAiB,EAAQ,IAC5C,KAAK,kBAAkB,EAAM,GAAM,GAAO,GAE1C,KAAK,SAAW,EAChB,KAAK,SAAW,EAChB,KAAK,cAAgB,EACd,KAAK,WAAW,EAAM,4BAK/B,EAAK,kBAAoB,SAAS,EAAM,EAAiB,EAAU,EAAS,CAC1E,GAAI,GAAe,GAAmB,KAAK,OAAS,EAAQ,OACxD,EAAY,KAAK,OAAQ,EAAY,GAEzC,GAAI,EACF,EAAK,KAAO,KAAK,iBAAiB,GAClC,EAAK,WAAa,GAClB,KAAK,YAAY,EAAM,QAClB,CACL,GAAI,GAAY,KAAK,QAAQ,aAAe,GAAK,CAAC,KAAK,kBAAkB,EAAK,QAC9E,AAAI,EAAC,GAAa,IAChB,GAAY,KAAK,gBAAgB,KAAK,KAIlC,GAAa,GACb,KAAK,iBAAiB,EAAK,MAAO,8EAIxC,GAAI,GAAY,KAAK,OACrB,KAAK,OAAS,GACV,GAAa,MAAK,OAAS,IAI/B,KAAK,YAAY,EAAM,CAAC,GAAa,CAAC,GAAa,CAAC,GAAmB,CAAC,GAAY,KAAK,kBAAkB,EAAK,SAE5G,KAAK,QAAU,EAAK,IAAM,KAAK,gBAAgB,EAAK,GAAI,IAC5D,EAAK,KAAO,KAAK,WAAW,GAAO,OAAW,GAAa,CAAC,GAC5D,EAAK,WAAa,GAClB,KAAK,uBAAuB,EAAK,KAAK,MACtC,KAAK,OAAS,EAEhB,KAAK,aAGP,EAAK,kBAAoB,SAAS,EAAQ,CACxC,OAAS,GAAI,EAAG,EAAO,EAAQ,EAAI,EAAK,OAAQ,GAAK,EACnD,CACA,GAAI,GAAQ,EAAK,GAEjB,GAAI,EAAM,OAAS,aAAgB,MAAO,GAE5C,MAAO,IAMT,EAAK,YAAc,SAAS,EAAM,EAAiB,CAEjD,OADI,GAAW,OAAO,OAAO,MACpB,EAAI,EAAG,EAAO,EAAK,OAAQ,EAAI,EAAK,OAAQ,GAAK,EACxD,CACA,GAAI,GAAQ,EAAK,GAEjB,KAAK,sBAAsB,EAAO,GAAU,EAAkB,KAAO,KAUzE,EAAK,cAAgB,SAAS,EAAO,EAAoB,EAAY,EAAwB,CAE3F,OADI,GAAO,GAAI,EAAQ,GAChB,CAAC,KAAK,IAAI,IAAQ,CACvB,GAAK,EAGI,EAAQ,WAFf,KAAK,OAAO,EAAQ,OAChB,GAAsB,KAAK,mBAAmB,GAAU,MAG9D,GAAI,GAAO,OACX,AAAI,GAAc,KAAK,OAAS,EAAQ,MACpC,EAAM,KACL,AAAI,KAAK,OAAS,EAAQ,SAC7B,GAAM,KAAK,YAAY,GACnB,GAA0B,KAAK,OAAS,EAAQ,OAAS,EAAuB,cAAgB,GAChG,GAAuB,cAAgB,KAAK,QAEhD,EAAM,KAAK,iBAAiB,GAAO,GAErC,EAAK,KAAK,GAEZ,MAAO,IAGT,EAAK,gBAAkB,SAAS,EAAK,CACnC,GAAI,GAAQ,EAAI,MACZ,EAAM,EAAI,IACV,EAAO,EAAI,KAYf,GAVI,KAAK,aAAe,IAAS,SAC7B,KAAK,iBAAiB,EAAO,uDAC7B,KAAK,SAAW,IAAS,SACzB,KAAK,iBAAiB,EAAO,6DAC7B,KAAK,mBAAmB,kBAAoB,IAAS,aACrD,KAAK,iBAAiB,EAAO,qDAC7B,KAAK,oBAAuB,KAAS,aAAe,IAAS,UAC7D,KAAK,MAAM,EAAQ,cAAgB,EAAO,yCAC1C,KAAK,SAAS,KAAK,IACnB,KAAK,MAAM,EAAQ,uBAAyB,EAAO,KACnD,OAAK,QAAQ,YAAc,GAC7B,KAAK,MAAM,MAAM,EAAO,GAAK,QAAQ,QAAU,IACjD,IAAI,GAAK,KAAK,OAAS,KAAK,oBAAsB,KAAK,cACvD,AAAI,EAAG,KAAK,IACN,EAAC,KAAK,SAAW,IAAS,SAC1B,KAAK,iBAAiB,EAAO,wDACjC,KAAK,iBAAiB,EAAQ,gBAAkB,EAAO,oBAQ3D,EAAK,WAAa,SAAS,EAAS,EAAW,CAC7C,GAAI,GAAO,KAAK,YAChB,MAAI,MAAK,OAAS,EAAQ,KACxB,EAAK,KAAO,KAAK,MACZ,AAAI,KAAK,KAAK,QACnB,GAAK,KAAO,KAAK,KAAK,QAMjB,GAAK,OAAS,SAAW,EAAK,OAAS,aACvC,MAAK,aAAe,KAAK,aAAe,GAAK,KAAK,MAAM,WAAW,KAAK,gBAAkB,KAC7F,KAAK,QAAQ,OAGf,KAAK,aAEP,KAAK,KAAK,CAAC,CAAC,GACZ,KAAK,WAAW,EAAM,cACjB,GACH,MAAK,gBAAgB,GACjB,EAAK,OAAS,SAAW,CAAC,KAAK,eAC/B,MAAK,cAAgB,EAAK,QAEzB,GAGT,EAAK,kBAAoB,UAAW,CAClC,GAAI,GAAO,KAAK,YAChB,MAAI,MAAK,OAAS,EAAQ,UACxB,EAAK,KAAO,KAAK,MAEjB,KAAK,aAEP,KAAK,OACL,KAAK,WAAW,EAAM,qBAGtB,AAAI,KAAK,iBAAiB,SAAW,EACnC,KAAK,MAAM,EAAK,MAAQ,mBAAsB,EAAK,KAAQ,4CAE3D,KAAK,iBAAiB,KAAK,iBAAiB,OAAS,GAAG,KAAK,KAAK,GAG7D,GAKT,EAAK,WAAa,SAAS,EAAS,CAClC,AAAK,KAAK,UAAY,MAAK,SAAW,KAAK,OAE3C,GAAI,GAAO,KAAK,YAChB,YAAK,OACL,AAAI,KAAK,OAAS,EAAQ,MAAQ,KAAK,sBAAyB,KAAK,OAAS,EAAQ,MAAQ,CAAC,KAAK,KAAK,WACvG,GAAK,SAAW,GAChB,EAAK,SAAW,MAEhB,GAAK,SAAW,KAAK,IAAI,EAAQ,MACjC,EAAK,SAAW,KAAK,iBAAiB,IAEjC,KAAK,WAAW,EAAM,oBAG/B,EAAK,WAAa,SAAS,EAAS,CAClC,AAAK,KAAK,UAAY,MAAK,SAAW,KAAK,OAE3C,GAAI,GAAO,KAAK,YAChB,YAAK,OACL,EAAK,SAAW,KAAK,gBAAgB,KAAM,GAAM,GAAO,GACjD,KAAK,WAAW,EAAM,oBAG/B,GAAI,IAAO,GAAO,UAQlB,GAAK,MAAQ,SAAS,EAAK,EAAS,CAClC,GAAI,GAAM,GAAY,KAAK,MAAO,GAClC,GAAW,KAAO,EAAI,KAAO,IAAM,EAAI,OAAS,IAChD,GAAI,GAAM,GAAI,aAAY,GAC1B,QAAI,IAAM,EAAK,EAAI,IAAM,EAAK,EAAI,SAAW,KAAK,IAC5C,GAGR,GAAK,iBAAmB,GAAK,MAE7B,GAAK,YAAc,UAAW,CAC5B,GAAI,KAAK,QAAQ,UACf,MAAO,IAAI,IAAS,KAAK,QAAS,KAAK,IAAM,KAAK,YAItD,GAAI,IAAO,GAAO,UAEd,GAAQ,SAAe,EAAO,CAChC,KAAK,MAAQ,EAEb,KAAK,IAAM,GAEX,KAAK,QAAU,GAEf,KAAK,UAAY,GAEjB,KAAK,iBAAmB,IAK1B,GAAK,WAAa,SAAS,EAAO,CAChC,KAAK,WAAW,KAAK,GAAI,IAAM,KAGjC,GAAK,UAAY,UAAW,CAC1B,KAAK,WAAW,OAMlB,GAAK,2BAA6B,SAAS,EAAO,CAChD,MAAQ,GAAM,MAAQ,IAAmB,CAAC,KAAK,UAAa,EAAM,MAAQ,IAG5E,GAAK,YAAc,SAAS,EAAM,EAAa,EAAK,CAClD,GAAI,GAAa,GACjB,GAAI,IAAgB,GAAc,CAChC,GAAI,GAAQ,KAAK,eACjB,EAAa,EAAM,QAAQ,QAAQ,GAAQ,IAAM,EAAM,UAAU,QAAQ,GAAQ,IAAM,EAAM,IAAI,QAAQ,GAAQ,GACjH,EAAM,QAAQ,KAAK,GACf,KAAK,UAAa,EAAM,MAAQ,IAChC,MAAO,MAAK,iBAAiB,WACxB,IAAgB,GAAmB,CAC5C,GAAI,GAAU,KAAK,eACnB,EAAQ,QAAQ,KAAK,WACZ,IAAgB,GAAe,CACxC,GAAI,GAAU,KAAK,eACnB,AAAI,KAAK,oBACL,EAAa,EAAQ,QAAQ,QAAQ,GAAQ,GAE7C,EAAa,EAAQ,QAAQ,QAAQ,GAAQ,IAAM,EAAQ,IAAI,QAAQ,GAAQ,GACnF,EAAQ,UAAU,KAAK,OAEvB,QAAS,GAAI,KAAK,WAAW,OAAS,EAAG,GAAK,EAAG,EAAE,EAAG,CACpD,GAAI,GAAU,KAAK,WAAW,GAC9B,GAAI,EAAQ,QAAQ,QAAQ,GAAQ,IAAM,CAAG,GAAQ,MAAQ,IAAuB,EAAQ,QAAQ,KAAO,IACvG,CAAC,KAAK,2BAA2B,IAAY,EAAQ,UAAU,QAAQ,GAAQ,GAAI,CACrF,EAAa,GACb,MAKF,GAHA,EAAQ,IAAI,KAAK,GACb,KAAK,UAAa,EAAQ,MAAQ,IAClC,MAAO,MAAK,iBAAiB,GAC7B,EAAQ,MAAQ,GAAa,MAGrC,AAAI,GAAc,KAAK,iBAAiB,EAAM,eAAiB,EAAO,gCAGxE,GAAK,iBAAmB,SAAS,EAAI,CAEnC,AAAI,KAAK,WAAW,GAAG,QAAQ,QAAQ,EAAG,QAAU,IAChD,KAAK,WAAW,GAAG,IAAI,QAAQ,EAAG,QAAU,IAC9C,MAAK,iBAAiB,EAAG,MAAQ,IAIrC,GAAK,aAAe,UAAW,CAC7B,MAAO,MAAK,WAAW,KAAK,WAAW,OAAS,IAGlD,GAAK,gBAAkB,UAAW,CAChC,OAAS,GAAI,KAAK,WAAW,OAAS,GAAI,IAAK,CAC7C,GAAI,GAAQ,KAAK,WAAW,GAC5B,GAAI,EAAM,MAAQ,GAAa,MAAO,KAK1C,GAAK,iBAAmB,UAAW,CACjC,OAAS,GAAI,KAAK,WAAW,OAAS,GAAI,IAAK,CAC7C,GAAI,GAAQ,KAAK,WAAW,GAC5B,GAAI,EAAM,MAAQ,IAAa,CAAE,GAAM,MAAQ,IAAgB,MAAO,KAI1E,GAAI,IAAO,SAAc,EAAQ,EAAK,EAAK,CACzC,KAAK,KAAO,GACZ,KAAK,MAAQ,EACb,KAAK,IAAM,EACP,EAAO,QAAQ,WACf,MAAK,IAAM,GAAI,IAAe,EAAQ,IACtC,EAAO,QAAQ,kBACf,MAAK,WAAa,EAAO,QAAQ,kBACjC,EAAO,QAAQ,QACf,MAAK,MAAQ,CAAC,EAAK,KAKrB,GAAO,GAAO,UAElB,GAAK,UAAY,UAAW,CAC1B,MAAO,IAAI,IAAK,KAAM,KAAK,MAAO,KAAK,WAGzC,GAAK,YAAc,SAAS,EAAK,EAAK,CACpC,MAAO,IAAI,IAAK,KAAM,EAAK,IAK7B,YAAsB,EAAM,EAAM,EAAK,EAAK,CAC1C,SAAK,KAAO,EACZ,EAAK,IAAM,EACP,KAAK,QAAQ,WACb,GAAK,IAAI,IAAM,GACf,KAAK,QAAQ,QACb,GAAK,MAAM,GAAK,GACb,EAGT,GAAK,WAAa,SAAS,EAAM,EAAM,CACrC,MAAO,IAAa,KAAK,KAAM,EAAM,EAAM,KAAK,WAAY,KAAK,gBAKnE,GAAK,aAAe,SAAS,EAAM,EAAM,EAAK,EAAK,CACjD,MAAO,IAAa,KAAK,KAAM,EAAM,EAAM,EAAK,IAGlD,GAAK,SAAW,SAAS,EAAM,CAC7B,GAAI,GAAU,GAAI,IAAK,KAAM,EAAK,MAAO,KAAK,UAC9C,OAAS,KAAQ,GAAQ,EAAQ,GAAQ,EAAK,GAC9C,MAAO,IAQT,GAAI,IAAwB,89BACxB,GAAyB,GAAwB,yBACjD,GAAyB,GACzB,GAAyB,GAAyB,kCAClD,GAAyB,GACzB,GAA0B,CAC5B,EAAG,GACH,GAAI,GACJ,GAAI,GACJ,GAAI,GACJ,GAAI,IAIF,GAA+B,qpBAG/B,GAAoB,i+DACpB,GAAqB,GAAoB,kHACzC,GAAqB,GAAqB,yEAC1C,GAAqB,GAAqB,yEAC1C,GAAqB,GAAqB,oEAC1C,GAAsB,CACxB,EAAG,GACH,GAAI,GACJ,GAAI,GACJ,GAAI,GACJ,GAAI,IAGF,GAAO,GACX,YAA0B,EAAa,CACrC,GAAI,GAAI,GAAK,GAAe,CAC1B,OAAQ,GAAY,GAAwB,GAAe,IAAM,IACjE,UAAW,CACT,iBAAkB,GAAY,IAC9B,OAAQ,GAAY,GAAoB,MAG5C,EAAE,UAAU,kBAAoB,EAAE,UAAU,OAE5C,EAAE,UAAU,GAAK,EAAE,UAAU,iBAC7B,EAAE,UAAU,GAAK,EAAE,UAAU,OAC7B,EAAE,UAAU,IAAM,EAAE,UAAU,kBAGhC,IAAS,GAAI,EAAG,GAAO,CAAC,EAAG,GAAI,GAAI,GAAI,IAAK,GAAI,GAAK,OAAQ,IAAK,EAC5D,GAAc,GAAK,IAEvB,GAAiB,IAFb,OADG,GAAO,GAMZ,EAAO,GAAO,UAEd,GAAwB,SAA+B,EAAQ,CACjE,KAAK,OAAS,EACd,KAAK,WAAa,MAAS,GAAO,QAAQ,aAAe,EAAI,KAAO,IAAO,GAAO,QAAQ,aAAe,EAAI,IAAM,IAAO,GAAO,QAAQ,aAAe,GAAK,IAAM,IACnK,KAAK,kBAAoB,GAAK,EAAO,QAAQ,aAAe,GAAK,GAAK,EAAO,QAAQ,aACrF,KAAK,OAAS,GACd,KAAK,MAAQ,GACb,KAAK,MAAQ,EACb,KAAK,QAAU,GACf,KAAK,QAAU,GACf,KAAK,IAAM,EACX,KAAK,aAAe,EACpB,KAAK,gBAAkB,GACvB,KAAK,4BAA8B,GACnC,KAAK,mBAAqB,EAC1B,KAAK,iBAAmB,EACxB,KAAK,WAAa,GAClB,KAAK,mBAAqB,IAG5B,GAAsB,UAAU,MAAQ,SAAgB,EAAO,EAAS,EAAO,CAC7E,GAAI,GAAU,EAAM,QAAQ,OAAS,GACrC,KAAK,MAAQ,EAAQ,EACrB,KAAK,OAAS,EAAU,GACxB,KAAK,MAAQ,EACb,KAAK,QAAU,GAAW,KAAK,OAAO,QAAQ,aAAe,EAC7D,KAAK,QAAU,GAAW,KAAK,OAAO,QAAQ,aAAe,GAG/D,GAAsB,UAAU,MAAQ,SAAgB,EAAS,CAC/D,KAAK,OAAO,iBAAiB,KAAK,MAAQ,gCAAmC,KAAK,OAAU,MAAQ,IAKtG,GAAsB,UAAU,GAAK,SAAa,EAAG,EAAQ,CACzD,AAAK,IAAW,QAAS,GAAS,IAEpC,GAAI,GAAI,KAAK,OACT,EAAI,EAAE,OACV,GAAI,GAAK,EACP,MAAO,GAET,GAAI,GAAI,EAAE,WAAW,GACrB,GAAI,CAAE,IAAU,KAAK,UAAY,GAAK,OAAU,GAAK,OAAU,EAAI,GAAK,EACtE,MAAO,GAET,GAAI,GAAO,EAAE,WAAW,EAAI,GAC5B,MAAO,IAAQ,OAAU,GAAQ,MAAU,IAAK,IAAM,EAAO,SAAY,GAG3E,GAAsB,UAAU,UAAY,SAAoB,EAAG,EAAQ,CACvE,AAAK,IAAW,QAAS,GAAS,IAEpC,GAAI,GAAI,KAAK,OACT,EAAI,EAAE,OACV,GAAI,GAAK,EACP,MAAO,GAET,GAAI,GAAI,EAAE,WAAW,GAAI,EACzB,MAAI,CAAE,IAAU,KAAK,UAAY,GAAK,OAAU,GAAK,OAAU,EAAI,GAAK,GACnE,GAAO,EAAE,WAAW,EAAI,IAAM,OAAU,EAAO,MAC3C,EAAI,EAEN,EAAI,GAGb,GAAsB,UAAU,QAAU,SAAkB,EAAQ,CAChE,MAAK,KAAW,QAAS,GAAS,IAE7B,KAAK,GAAG,KAAK,IAAK,IAG3B,GAAsB,UAAU,UAAY,SAAoB,EAAQ,CACpE,MAAK,KAAW,QAAS,GAAS,IAE7B,KAAK,GAAG,KAAK,UAAU,KAAK,IAAK,GAAS,IAGnD,GAAsB,UAAU,QAAU,SAAkB,EAAQ,CAChE,AAAK,IAAW,QAAS,GAAS,IAEpC,KAAK,IAAM,KAAK,UAAU,KAAK,IAAK,IAGtC,GAAsB,UAAU,IAAM,SAAc,EAAI,EAAQ,CAG9D,MAFO,KAAW,QAAS,GAAS,IAEhC,KAAK,QAAQ,KAAY,EAC3B,MAAK,QAAQ,GACN,IAEF,IAGT,YAA6B,EAAI,CAC/B,MAAI,IAAM,MAAiB,OAAO,aAAa,GAC/C,IAAM,MACC,OAAO,aAAc,IAAM,IAAM,MAAS,GAAK,MAAU,QASlE,EAAK,oBAAsB,SAAS,EAAO,CAIzC,OAHI,GAAa,EAAM,WACnB,EAAQ,EAAM,MAET,EAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACrC,GAAI,GAAO,EAAM,OAAO,GACxB,AAAI,EAAW,QAAQ,KAAU,IAC/B,KAAK,MAAM,EAAM,MAAO,mCAEtB,EAAM,QAAQ,EAAM,EAAI,GAAK,IAC/B,KAAK,MAAM,EAAM,MAAO,uCAW9B,EAAK,sBAAwB,SAAS,EAAO,CAC3C,KAAK,eAAe,GAOhB,CAAC,EAAM,SAAW,KAAK,QAAQ,aAAe,GAAK,EAAM,WAAW,OAAS,GAC/E,GAAM,QAAU,GAChB,KAAK,eAAe,KAKxB,EAAK,eAAiB,SAAS,EAAO,CACpC,EAAM,IAAM,EACZ,EAAM,aAAe,EACrB,EAAM,gBAAkB,GACxB,EAAM,4BAA8B,GACpC,EAAM,mBAAqB,EAC3B,EAAM,iBAAmB,EACzB,EAAM,WAAW,OAAS,EAC1B,EAAM,mBAAmB,OAAS,EAElC,KAAK,mBAAmB,GAEpB,EAAM,MAAQ,EAAM,OAAO,QAEzB,GAAM,IAAI,KACZ,EAAM,MAAM,iBAEV,GAAM,IAAI,KAAiB,EAAM,IAAI,OACvC,EAAM,MAAM,6BAGZ,EAAM,iBAAmB,EAAM,oBACjC,EAAM,MAAM,kBAEd,OAAS,GAAI,EAAG,EAAO,EAAM,mBAAoB,EAAI,EAAK,OAAQ,GAAK,EAAG,CACxE,GAAI,GAAO,EAAK,GAEhB,AAAI,EAAM,WAAW,QAAQ,KAAU,IACrC,EAAM,MAAM,sCAMlB,EAAK,mBAAqB,SAAS,EAAO,CAExC,IADA,KAAK,mBAAmB,GACjB,EAAM,IAAI,MACf,KAAK,mBAAmB,GAI1B,AAAI,KAAK,qBAAqB,EAAO,KACnC,EAAM,MAAM,qBAEV,EAAM,IAAI,MACZ,EAAM,MAAM,6BAKhB,EAAK,mBAAqB,SAAS,EAAO,CACxC,KAAO,EAAM,IAAM,EAAM,OAAO,QAAU,KAAK,eAAe,IAC5D,GAIJ,EAAK,eAAiB,SAAS,EAAO,CACpC,MAAI,MAAK,oBAAoB,GAIvB,GAAM,6BAA+B,KAAK,qBAAqB,IAE7D,EAAM,SACR,EAAM,MAAM,sBAGT,IAGL,GAAM,QAAU,KAAK,eAAe,GAAS,KAAK,uBAAuB,IAC3E,MAAK,qBAAqB,GACnB,IAGF,IAIT,EAAK,oBAAsB,SAAS,EAAO,CACzC,GAAI,GAAQ,EAAM,IAIlB,GAHA,EAAM,4BAA8B,GAGhC,EAAM,IAAI,KAAiB,EAAM,IAAI,IACvC,MAAO,GAIT,GAAI,EAAM,IAAI,IAAe,CAC3B,GAAI,EAAM,IAAI,KAAiB,EAAM,IAAI,IACvC,MAAO,GAET,EAAM,IAAM,EAId,GAAI,EAAM,IAAI,KAAiB,EAAM,IAAI,IAAe,CACtD,GAAI,GAAa,GAIjB,GAHI,KAAK,QAAQ,aAAe,GAC9B,GAAa,EAAM,IAAI,KAErB,EAAM,IAAI,KAAiB,EAAM,IAAI,IACvC,YAAK,mBAAmB,GACnB,EAAM,IAAI,KACb,EAAM,MAAM,sBAEd,EAAM,4BAA8B,CAAC,EAC9B,GAIX,SAAM,IAAM,EACL,IAIT,EAAK,qBAAuB,SAAS,EAAO,EAAS,CAGnD,MAFK,KAAY,QAAS,GAAU,IAEhC,KAAK,2BAA2B,EAAO,GACzC,GAAM,IAAI,IACH,IAEF,IAIT,EAAK,2BAA6B,SAAS,EAAO,EAAS,CACzD,MACE,GAAM,IAAI,KACV,EAAM,IAAI,KACV,EAAM,IAAI,KACV,KAAK,2BAA2B,EAAO,IAG3C,EAAK,2BAA6B,SAAS,EAAO,EAAS,CACzD,GAAI,GAAQ,EAAM,IAClB,GAAI,EAAM,IAAI,KAAe,CAC3B,GAAI,GAAM,EAAG,EAAM,GACnB,GAAI,KAAK,wBAAwB,IAC/B,GAAM,EAAM,aACR,EAAM,IAAI,KAAiB,KAAK,wBAAwB,IAC1D,GAAM,EAAM,cAEV,EAAM,IAAI,MAEZ,MAAI,KAAQ,IAAM,EAAM,GAAO,CAAC,GAC9B,EAAM,MAAM,yCAEP,GAGX,AAAI,EAAM,SAAW,CAAC,GACpB,EAAM,MAAM,yBAEd,EAAM,IAAM,EAEd,MAAO,IAIT,EAAK,eAAiB,SAAS,EAAO,CACpC,MACE,MAAK,4BAA4B,IACjC,EAAM,IAAI,KACV,KAAK,mCAAmC,IACxC,KAAK,yBAAyB,IAC9B,KAAK,2BAA2B,IAChC,KAAK,yBAAyB,IAGlC,EAAK,mCAAqC,SAAS,EAAO,CACxD,GAAI,GAAQ,EAAM,IAClB,GAAI,EAAM,IAAI,IAAe,CAC3B,GAAI,KAAK,qBAAqB,GAC5B,MAAO,GAET,EAAM,IAAM,EAEd,MAAO,IAET,EAAK,2BAA6B,SAAS,EAAO,CAChD,GAAI,GAAQ,EAAM,IAClB,GAAI,EAAM,IAAI,IAAe,CAC3B,GAAI,EAAM,IAAI,KAAiB,EAAM,IAAI,IAAe,CAEtD,GADA,KAAK,mBAAmB,GACpB,EAAM,IAAI,IACZ,MAAO,GAET,EAAM,MAAM,sBAEd,EAAM,IAAM,EAEd,MAAO,IAET,EAAK,yBAA2B,SAAS,EAAO,CAC9C,GAAI,EAAM,IAAI,IAAe,CAO3B,GANA,AAAI,KAAK,QAAQ,aAAe,EAC9B,KAAK,sBAAsB,GAClB,EAAM,YAAc,IAC7B,EAAM,MAAM,iBAEd,KAAK,mBAAmB,GACpB,EAAM,IAAI,IACZ,SAAM,oBAAsB,EACrB,GAET,EAAM,MAAM,sBAEd,MAAO,IAIT,EAAK,uBAAyB,SAAS,EAAO,CAC5C,MACE,GAAM,IAAI,KACV,KAAK,mCAAmC,IACxC,KAAK,yBAAyB,IAC9B,KAAK,2BAA2B,IAChC,KAAK,yBAAyB,IAC9B,KAAK,kCAAkC,IACvC,KAAK,mCAAmC,IAK5C,EAAK,kCAAoC,SAAS,EAAO,CACvD,MAAI,MAAK,2BAA2B,EAAO,KACzC,EAAM,MAAM,qBAEP,IAIT,EAAK,0BAA4B,SAAS,EAAO,CAC/C,GAAI,GAAK,EAAM,UACf,MAAI,IAAkB,GACpB,GAAM,aAAe,EACrB,EAAM,UACC,IAEF,IAET,YAA2B,EAAI,CAC7B,MACE,KAAO,IACP,GAAM,IAAgB,GAAM,IAC5B,IAAO,IACP,IAAO,IACP,GAAM,IAAgB,GAAM,IAC5B,GAAM,KAAgB,GAAM,IAMhC,EAAK,4BAA8B,SAAS,EAAO,CAGjD,OAFI,GAAQ,EAAM,IACd,EAAK,EACD,GAAK,EAAM,aAAe,IAAM,CAAC,GAAkB,IACzD,EAAM,UAER,MAAO,GAAM,MAAQ,GAIvB,EAAK,mCAAqC,SAAS,EAAO,CACxD,GAAI,GAAK,EAAM,UACf,MACE,KAAO,IACP,IAAO,IACP,CAAE,IAAM,IAAgB,GAAM,KAC9B,IAAO,IACP,IAAO,IACP,IAAO,IACP,IAAO,IACP,IAAO,IAEP,GAAM,UACC,IAEF,IAMT,EAAK,sBAAwB,SAAS,EAAO,CAC3C,GAAI,EAAM,IAAI,IAAe,CAC3B,GAAI,KAAK,oBAAoB,GAAQ,CACnC,AAAI,EAAM,WAAW,QAAQ,EAAM,mBAAqB,IACtD,EAAM,MAAM,gCAEd,EAAM,WAAW,KAAK,EAAM,iBAC5B,OAEF,EAAM,MAAM,mBAOhB,EAAK,oBAAsB,SAAS,EAAO,CAEzC,GADA,EAAM,gBAAkB,GACpB,EAAM,IAAI,IAAe,CAC3B,GAAI,KAAK,+BAA+B,IAAU,EAAM,IAAI,IAC1D,MAAO,GAET,EAAM,MAAM,8BAEd,MAAO,IAOT,EAAK,+BAAiC,SAAS,EAAO,CAEpD,GADA,EAAM,gBAAkB,GACpB,KAAK,gCAAgC,GAAQ,CAE/C,IADA,EAAM,iBAAmB,GAAoB,EAAM,cAC5C,KAAK,+BAA+B,IACzC,EAAM,iBAAmB,GAAoB,EAAM,cAErD,MAAO,GAET,MAAO,IAQT,EAAK,gCAAkC,SAAS,EAAO,CACrD,GAAI,GAAQ,EAAM,IACd,EAAS,KAAK,QAAQ,aAAe,GACrC,EAAK,EAAM,QAAQ,GAMvB,MALA,GAAM,QAAQ,GAEV,IAAO,IAAgB,KAAK,sCAAsC,EAAO,IAC3E,GAAK,EAAM,cAET,GAAwB,GAC1B,GAAM,aAAe,EACd,IAGT,GAAM,IAAM,EACL,KAET,YAAiC,EAAI,CACnC,MAAO,IAAkB,EAAI,KAAS,IAAO,IAAgB,IAAO,GAUtE,EAAK,+BAAiC,SAAS,EAAO,CACpD,GAAI,GAAQ,EAAM,IACd,EAAS,KAAK,QAAQ,aAAe,GACrC,EAAK,EAAM,QAAQ,GAMvB,MALA,GAAM,QAAQ,GAEV,IAAO,IAAgB,KAAK,sCAAsC,EAAO,IAC3E,GAAK,EAAM,cAET,GAAuB,GACzB,GAAM,aAAe,EACd,IAGT,GAAM,IAAM,EACL,KAET,YAAgC,EAAI,CAClC,MAAO,IAAiB,EAAI,KAAS,IAAO,IAAgB,IAAO,IAAgB,IAAO,MAAuB,IAAO,KAI1H,EAAK,qBAAuB,SAAS,EAAO,CAC1C,MACE,MAAK,wBAAwB,IAC7B,KAAK,+BAA+B,IACpC,KAAK,0BAA0B,IAC9B,EAAM,SAAW,KAAK,qBAAqB,GAErC,GAEL,GAAM,SAEJ,GAAM,YAAc,IACtB,EAAM,MAAM,0BAEd,EAAM,MAAM,mBAEP,KAET,EAAK,wBAA0B,SAAS,EAAO,CAC7C,GAAI,GAAQ,EAAM,IAClB,GAAI,KAAK,wBAAwB,GAAQ,CACvC,GAAI,GAAI,EAAM,aACd,GAAI,EAAM,QAER,MAAI,GAAI,EAAM,kBACZ,GAAM,iBAAmB,GAEpB,GAET,GAAI,GAAK,EAAM,mBACb,MAAO,GAET,EAAM,IAAM,EAEd,MAAO,IAET,EAAK,qBAAuB,SAAS,EAAO,CAC1C,GAAI,EAAM,IAAI,KAAe,CAC3B,GAAI,KAAK,oBAAoB,GAC3B,SAAM,mBAAmB,KAAK,EAAM,iBAC7B,GAET,EAAM,MAAM,2BAEd,MAAO,IAIT,EAAK,0BAA4B,SAAS,EAAO,CAC/C,MACE,MAAK,wBAAwB,IAC7B,KAAK,yBAAyB,IAC9B,KAAK,eAAe,IACpB,KAAK,4BAA4B,IACjC,KAAK,sCAAsC,EAAO,KACjD,CAAC,EAAM,SAAW,KAAK,oCAAoC,IAC5D,KAAK,yBAAyB,IAGlC,EAAK,yBAA2B,SAAS,EAAO,CAC9C,GAAI,GAAQ,EAAM,IAClB,GAAI,EAAM,IAAI,IAAe,CAC3B,GAAI,KAAK,wBAAwB,GAC/B,MAAO,GAET,EAAM,IAAM,EAEd,MAAO,IAET,EAAK,eAAiB,SAAS,EAAO,CACpC,MAAI,GAAM,YAAc,IAAgB,CAAC,GAAe,EAAM,aAC5D,GAAM,aAAe,EACrB,EAAM,UACC,IAEF,IAIT,EAAK,wBAA0B,SAAS,EAAO,CAC7C,GAAI,GAAK,EAAM,UACf,MAAI,KAAO,IACT,GAAM,aAAe,EACrB,EAAM,UACC,IAEL,IAAO,IACT,GAAM,aAAe,GACrB,EAAM,UACC,IAEL,IAAO,IACT,GAAM,aAAe,GACrB,EAAM,UACC,IAEL,IAAO,IACT,GAAM,aAAe,GACrB,EAAM,UACC,IAEL,IAAO,IACT,GAAM,aAAe,GACrB,EAAM,UACC,IAEF,IAIT,EAAK,wBAA0B,SAAS,EAAO,CAC7C,GAAI,GAAK,EAAM,UACf,MAAI,IAAgB,GAClB,GAAM,aAAe,EAAK,GAC1B,EAAM,UACC,IAEF,IAET,YAAyB,EAAI,CAC3B,MACG,IAAM,IAAgB,GAAM,IAC5B,GAAM,IAAgB,GAAM,IAKjC,EAAK,sCAAwC,SAAS,EAAO,EAAQ,CACnE,AAAK,IAAW,QAAS,GAAS,IAElC,GAAI,GAAQ,EAAM,IACd,EAAU,GAAU,EAAM,QAE9B,GAAI,EAAM,IAAI,KAAe,CAC3B,GAAI,KAAK,yBAAyB,EAAO,GAAI,CAC3C,GAAI,GAAO,EAAM,aACjB,GAAI,GAAW,GAAQ,OAAU,GAAQ,MAAQ,CAC/C,GAAI,GAAmB,EAAM,IAC7B,GAAI,EAAM,IAAI,KAAiB,EAAM,IAAI,MAAiB,KAAK,yBAAyB,EAAO,GAAI,CACjG,GAAI,GAAQ,EAAM,aAClB,GAAI,GAAS,OAAU,GAAS,MAC9B,SAAM,aAAgB,GAAO,OAAU,KAAS,GAAQ,OAAU,MAC3D,GAGX,EAAM,IAAM,EACZ,EAAM,aAAe,EAEvB,MAAO,GAET,GACE,GACA,EAAM,IAAI,MACV,KAAK,oBAAoB,IACzB,EAAM,IAAI,MACV,GAAe,EAAM,cAErB,MAAO,GAET,AAAI,GACF,EAAM,MAAM,0BAEd,EAAM,IAAM,EAGd,MAAO,IAET,YAAwB,EAAI,CAC1B,MAAO,IAAM,GAAK,GAAM,QAI1B,EAAK,yBAA2B,SAAS,EAAO,CAC9C,GAAI,EAAM,QACR,MAAI,MAAK,0BAA0B,GAC1B,GAEL,EAAM,IAAI,IACZ,GAAM,aAAe,GACd,IAEF,GAGT,GAAI,GAAK,EAAM,UACf,MAAI,KAAO,IAAiB,EAAC,EAAM,SAAW,IAAO,KACnD,GAAM,aAAe,EACrB,EAAM,UACC,IAGF,IAIT,EAAK,wBAA0B,SAAS,EAAO,CAC7C,EAAM,aAAe,EACrB,GAAI,GAAK,EAAM,UACf,GAAI,GAAM,IAAgB,GAAM,GAAc,CAC5C,EACE,GAAM,aAAe,GAAK,EAAM,aAAgB,GAAK,IACrD,EAAM,gBACE,GAAK,EAAM,YAAc,IAAgB,GAAM,IACzD,MAAO,GAET,MAAO,IAIT,EAAK,+BAAiC,SAAS,EAAO,CACpD,GAAI,GAAK,EAAM,UAEf,GAAI,GAAuB,GACzB,SAAM,aAAe,GACrB,EAAM,UACC,GAGT,GACE,EAAM,SACN,KAAK,QAAQ,aAAe,GAC3B,KAAO,IAAgB,IAAO,KAC/B,CAGA,GAFA,EAAM,aAAe,GACrB,EAAM,UAEJ,EAAM,IAAI,MACV,KAAK,yCAAyC,IAC9C,EAAM,IAAI,KAEV,MAAO,GAET,EAAM,MAAM,yBAGd,MAAO,IAET,YAAgC,EAAI,CAClC,MACE,KAAO,KACP,IAAO,IACP,IAAO,KACP,IAAO,IACP,IAAO,KACP,IAAO,GAOX,EAAK,yCAA2C,SAAS,EAAO,CAC9D,GAAI,GAAQ,EAAM,IAGlB,GAAI,KAAK,8BAA8B,IAAU,EAAM,IAAI,IAAe,CACxE,GAAI,GAAO,EAAM,gBACjB,GAAI,KAAK,+BAA+B,GAAQ,CAC9C,GAAI,GAAQ,EAAM,gBAClB,YAAK,2CAA2C,EAAO,EAAM,GACtD,IAMX,GAHA,EAAM,IAAM,EAGR,KAAK,yCAAyC,GAAQ,CACxD,GAAI,GAAc,EAAM,gBACxB,YAAK,0CAA0C,EAAO,GAC/C,GAET,MAAO,IAET,EAAK,2CAA6C,SAAS,EAAO,EAAM,EAAO,CAC7E,AAAK,GAAO,EAAM,kBAAkB,UAAW,IAC3C,EAAM,MAAM,yBACX,EAAM,kBAAkB,UAAU,GAAM,KAAK,IAC9C,EAAM,MAAM,2BAElB,EAAK,0CAA4C,SAAS,EAAO,EAAa,CAC5E,AAAK,EAAM,kBAAkB,OAAO,KAAK,IACrC,EAAM,MAAM,0BAKlB,EAAK,8BAAgC,SAAS,EAAO,CACnD,GAAI,GAAK,EAET,IADA,EAAM,gBAAkB,GACjB,GAA+B,EAAK,EAAM,YAC/C,EAAM,iBAAmB,GAAoB,GAC7C,EAAM,UAER,MAAO,GAAM,kBAAoB,IAEnC,YAAwC,EAAI,CAC1C,MAAO,IAAgB,IAAO,IAAO,GAKvC,EAAK,+BAAiC,SAAS,EAAO,CACpD,GAAI,GAAK,EAET,IADA,EAAM,gBAAkB,GACjB,GAAgC,EAAK,EAAM,YAChD,EAAM,iBAAmB,GAAoB,GAC7C,EAAM,UAER,MAAO,GAAM,kBAAoB,IAEnC,YAAyC,EAAI,CAC3C,MAAO,IAA+B,IAAO,GAAe,GAK9D,EAAK,yCAA2C,SAAS,EAAO,CAC9D,MAAO,MAAK,+BAA+B,IAI7C,EAAK,yBAA2B,SAAS,EAAO,CAC9C,GAAI,EAAM,IAAI,IAAe,CAG3B,GAFA,EAAM,IAAI,IACV,KAAK,mBAAmB,GACpB,EAAM,IAAI,IACZ,MAAO,GAGT,EAAM,MAAM,gCAEd,MAAO,IAMT,EAAK,mBAAqB,SAAS,EAAO,CACxC,KAAO,KAAK,oBAAoB,IAAQ,CACtC,GAAI,GAAO,EAAM,aACjB,GAAI,EAAM,IAAI,KAAiB,KAAK,oBAAoB,GAAQ,CAC9D,GAAI,GAAQ,EAAM,aAClB,AAAI,EAAM,SAAY,KAAS,IAAM,IAAU,KAC7C,EAAM,MAAM,2BAEV,IAAS,IAAM,IAAU,IAAM,EAAO,GACxC,EAAM,MAAM,4CAQpB,EAAK,oBAAsB,SAAS,EAAO,CACzC,GAAI,GAAQ,EAAM,IAElB,GAAI,EAAM,IAAI,IAAe,CAC3B,GAAI,KAAK,sBAAsB,GAC7B,MAAO,GAET,GAAI,EAAM,QAAS,CAEjB,GAAI,GAAO,EAAM,UACjB,AAAI,KAAS,IAAgB,GAAa,KACxC,EAAM,MAAM,wBAEd,EAAM,MAAM,kBAEd,EAAM,IAAM,EAGd,GAAI,GAAK,EAAM,UACf,MAAI,KAAO,GACT,GAAM,aAAe,EACrB,EAAM,UACC,IAGF,IAIT,EAAK,sBAAwB,SAAS,EAAO,CAC3C,GAAI,GAAQ,EAAM,IAElB,GAAI,EAAM,IAAI,IACZ,SAAM,aAAe,EACd,GAGT,GAAI,EAAM,SAAW,EAAM,IAAI,IAC7B,SAAM,aAAe,GACd,GAGT,GAAI,CAAC,EAAM,SAAW,EAAM,IAAI,IAAe,CAC7C,GAAI,KAAK,6BAA6B,GACpC,MAAO,GAET,EAAM,IAAM,EAGd,MACE,MAAK,+BAA+B,IACpC,KAAK,0BAA0B,IAKnC,EAAK,6BAA+B,SAAS,EAAO,CAClD,GAAI,GAAK,EAAM,UACf,MAAI,IAAe,IAAO,IAAO,GAC/B,GAAM,aAAe,EAAK,GAC1B,EAAM,UACC,IAEF,IAIT,EAAK,4BAA8B,SAAS,EAAO,CACjD,GAAI,GAAQ,EAAM,IAClB,GAAI,EAAM,IAAI,KAAe,CAC3B,GAAI,KAAK,yBAAyB,EAAO,GACvC,MAAO,GAET,AAAI,EAAM,SACR,EAAM,MAAM,kBAEd,EAAM,IAAM,EAEd,MAAO,IAIT,EAAK,wBAA0B,SAAS,EAAO,CAC7C,GAAI,GAAQ,EAAM,IACd,EAAK,EAET,IADA,EAAM,aAAe,EACd,GAAe,EAAK,EAAM,YAC/B,EAAM,aAAe,GAAK,EAAM,aAAgB,GAAK,IACrD,EAAM,UAER,MAAO,GAAM,MAAQ,GAEvB,YAAwB,EAAI,CAC1B,MAAO,IAAM,IAAgB,GAAM,GAIrC,EAAK,oBAAsB,SAAS,EAAO,CACzC,GAAI,GAAQ,EAAM,IACd,EAAK,EAET,IADA,EAAM,aAAe,EACd,GAAW,EAAK,EAAM,YAC3B,EAAM,aAAe,GAAK,EAAM,aAAe,GAAS,GACxD,EAAM,UAER,MAAO,GAAM,MAAQ,GAEvB,YAAoB,EAAI,CACtB,MACG,IAAM,IAAgB,GAAM,IAC5B,GAAM,IAAgB,GAAM,IAC5B,GAAM,IAAgB,GAAM,IAGjC,YAAkB,EAAI,CACpB,MAAI,IAAM,IAAgB,GAAM,GACvB,GAAM,GAAK,IAEhB,GAAM,IAAgB,GAAM,IACvB,GAAM,GAAK,IAEb,EAAK,GAKd,EAAK,oCAAsC,SAAS,EAAO,CACzD,GAAI,KAAK,qBAAqB,GAAQ,CACpC,GAAI,GAAK,EAAM,aACf,GAAI,KAAK,qBAAqB,GAAQ,CACpC,GAAI,GAAK,EAAM,aACf,AAAI,GAAM,GAAK,KAAK,qBAAqB,GACvC,EAAM,aAAe,EAAK,GAAK,EAAK,EAAI,EAAM,aAE9C,EAAM,aAAe,EAAK,EAAI,MAGhC,GAAM,aAAe,EAEvB,MAAO,GAET,MAAO,IAIT,EAAK,qBAAuB,SAAS,EAAO,CAC1C,GAAI,GAAK,EAAM,UACf,MAAI,IAAa,GACf,GAAM,aAAe,EAAK,GAC1B,EAAM,UACC,IAET,GAAM,aAAe,EACd,KAET,YAAsB,EAAI,CACxB,MAAO,IAAM,IAAgB,GAAM,GAMrC,EAAK,yBAA2B,SAAS,EAAO,EAAQ,CACtD,GAAI,GAAQ,EAAM,IAClB,EAAM,aAAe,EACrB,OAAS,GAAI,EAAG,EAAI,EAAQ,EAAE,EAAG,CAC/B,GAAI,GAAK,EAAM,UACf,GAAI,CAAC,GAAW,GACd,SAAM,IAAM,EACL,GAET,EAAM,aAAe,GAAK,EAAM,aAAe,GAAS,GACxD,EAAM,UAER,MAAO,IAOT,GAAI,IAAQ,SAAe,EAAG,CAC5B,KAAK,KAAO,EAAE,KACd,KAAK,MAAQ,EAAE,MACf,KAAK,MAAQ,EAAE,MACf,KAAK,IAAM,EAAE,IACT,EAAE,QAAQ,WACV,MAAK,IAAM,GAAI,IAAe,EAAG,EAAE,SAAU,EAAE,SAC/C,EAAE,QAAQ,QACV,MAAK,MAAQ,CAAC,EAAE,MAAO,EAAE,OAK3B,EAAK,GAAO,UAIhB,EAAG,KAAO,SAAS,EAA+B,CAChD,AAAI,CAAC,GAAiC,KAAK,KAAK,SAAW,KAAK,aAC5D,KAAK,iBAAiB,KAAK,MAAO,8BAAgC,KAAK,KAAK,SAC5E,KAAK,QAAQ,SACb,KAAK,QAAQ,QAAQ,GAAI,IAAM,OAEnC,KAAK,WAAa,KAAK,IACvB,KAAK,aAAe,KAAK,MACzB,KAAK,cAAgB,KAAK,OAC1B,KAAK,gBAAkB,KAAK,SAC5B,KAAK,aAGP,EAAG,SAAW,UAAW,CACvB,YAAK,OACE,GAAI,IAAM,OAInB,AAAI,MAAO,SAAW,aAClB,GAAG,OAAO,UAAY,UAAW,CACjC,GAAI,GAAW,KAEf,MAAO,CACL,KAAM,UAAY,CAChB,GAAI,GAAQ,EAAS,WACrB,MAAO,CACL,KAAM,EAAM,OAAS,EAAQ,IAC7B,MAAO,OAYjB,EAAG,UAAY,UAAW,CACxB,GAAI,GAAa,KAAK,aAKtB,GAJI,EAAC,GAAc,CAAC,EAAW,gBAAiB,KAAK,YAErD,KAAK,MAAQ,KAAK,IACd,KAAK,QAAQ,WAAa,MAAK,SAAW,KAAK,eAC/C,KAAK,KAAO,KAAK,MAAM,OAAU,MAAO,MAAK,YAAY,EAAQ,KAErE,GAAI,EAAW,SAAY,MAAO,GAAW,SAAS,MAC/C,KAAK,UAAU,KAAK,sBAG7B,EAAG,UAAY,SAAS,EAAM,CAG5B,MAAI,IAAkB,EAAM,KAAK,QAAQ,aAAe,IAAM,IAAS,GAC5D,KAAK,WAET,KAAK,iBAAiB,IAG/B,EAAG,kBAAoB,UAAW,CAChC,GAAI,GAAO,KAAK,MAAM,WAAW,KAAK,KACtC,GAAI,GAAQ,OAAU,GAAQ,MAAU,MAAO,GAC/C,GAAI,GAAO,KAAK,MAAM,WAAW,KAAK,IAAM,GAC5C,MAAO,IAAQ,OAAU,GAAQ,MAAS,EAAQ,IAAQ,IAAM,EAAO,UAGzE,EAAG,iBAAmB,UAAW,CAC/B,GAAI,GAAW,KAAK,QAAQ,WAAa,KAAK,cAC1C,EAAQ,KAAK,IAAK,EAAM,KAAK,MAAM,QAAQ,KAAM,KAAK,KAAO,GAGjE,GAFI,IAAQ,IAAM,KAAK,MAAM,KAAK,IAAM,EAAG,wBAC3C,KAAK,IAAM,EAAM,EACb,KAAK,QAAQ,UACf,OAAS,GAAa,OAAS,EAAM,EAAQ,GAAY,GAAc,KAAK,MAAO,EAAK,KAAK,MAAQ,IACnG,EAAE,KAAK,QACP,EAAM,KAAK,UAAY,EAG3B,AAAI,KAAK,QAAQ,WACb,KAAK,QAAQ,UAAU,GAAM,KAAK,MAAM,MAAM,EAAQ,EAAG,GAAM,EAAO,KAAK,IACtD,EAAU,KAAK,gBAG1C,EAAG,gBAAkB,SAAS,EAAW,CAIvC,OAHI,GAAQ,KAAK,IACb,EAAW,KAAK,QAAQ,WAAa,KAAK,cAC1C,EAAK,KAAK,MAAM,WAAW,KAAK,KAAO,GACpC,KAAK,IAAM,KAAK,MAAM,QAAU,CAAC,GAAU,IAChD,EAAK,KAAK,MAAM,WAAW,EAAE,KAAK,KAEpC,AAAI,KAAK,QAAQ,WACb,KAAK,QAAQ,UAAU,GAAO,KAAK,MAAM,MAAM,EAAQ,EAAW,KAAK,KAAM,EAAO,KAAK,IACpE,EAAU,KAAK,gBAM1C,EAAG,UAAY,UAAW,CACxB,EAAM,KAAO,KAAK,IAAM,KAAK,MAAM,QAAQ,CACzC,GAAI,GAAK,KAAK,MAAM,WAAW,KAAK,KACpC,OAAQ,OACH,QAAS,KACZ,EAAE,KAAK,IACP,UACG,IACH,AAAI,KAAK,MAAM,WAAW,KAAK,IAAM,KAAO,IAC1C,EAAE,KAAK,QAEN,QAAS,UAAW,MACvB,EAAE,KAAK,IACH,KAAK,QAAQ,WACf,GAAE,KAAK,QACP,KAAK,UAAY,KAAK,KAExB,UACG,IACH,OAAQ,KAAK,MAAM,WAAW,KAAK,IAAM,QACpC,IACH,KAAK,mBACL,UACG,IACH,KAAK,gBAAgB,GACrB,cAEA,QAEF,cAEA,GAAI,EAAK,GAAK,EAAK,IAAM,GAAM,MAAQ,GAAmB,KAAK,OAAO,aAAa,IACjF,EAAE,KAAK,QAEP,YAWR,EAAG,YAAc,SAAS,EAAM,EAAK,CACnC,KAAK,IAAM,KAAK,IACZ,KAAK,QAAQ,WAAa,MAAK,OAAS,KAAK,eACjD,GAAI,GAAW,KAAK,KACpB,KAAK,KAAO,EACZ,KAAK,MAAQ,EAEb,KAAK,cAAc,IAYrB,EAAG,cAAgB,UAAW,CAC5B,GAAI,GAAO,KAAK,MAAM,WAAW,KAAK,IAAM,GAC5C,GAAI,GAAQ,IAAM,GAAQ,GAAM,MAAO,MAAK,WAAW,IACvD,GAAI,GAAQ,KAAK,MAAM,WAAW,KAAK,IAAM,GAC7C,MAAI,MAAK,QAAQ,aAAe,GAAK,IAAS,IAAM,IAAU,GAC5D,MAAK,KAAO,EACL,KAAK,YAAY,EAAQ,WAEhC,GAAE,KAAK,IACA,KAAK,YAAY,EAAQ,OAIpC,EAAG,gBAAkB,UAAW,CAC9B,GAAI,GAAO,KAAK,MAAM,WAAW,KAAK,IAAM,GAC5C,MAAI,MAAK,YAAe,GAAE,KAAK,IAAY,KAAK,cAC5C,IAAS,GAAa,KAAK,SAAS,EAAQ,OAAQ,GACjD,KAAK,SAAS,EAAQ,MAAO,IAGtC,EAAG,0BAA4B,SAAS,EAAM,CAC5C,GAAI,GAAO,KAAK,MAAM,WAAW,KAAK,IAAM,GACxC,EAAO,EACP,EAAY,IAAS,GAAK,EAAQ,KAAO,EAAQ,OASrD,MANI,MAAK,QAAQ,aAAe,GAAK,IAAS,IAAM,IAAS,IAC3D,GAAE,EACF,EAAY,EAAQ,SACpB,EAAO,KAAK,MAAM,WAAW,KAAK,IAAM,IAGtC,IAAS,GAAa,KAAK,SAAS,EAAQ,OAAQ,EAAO,GACxD,KAAK,SAAS,EAAW,IAGlC,EAAG,mBAAqB,SAAS,EAAM,CACrC,GAAI,GAAO,KAAK,MAAM,WAAW,KAAK,IAAM,GAC5C,GAAI,IAAS,EAAM,CACjB,GAAI,KAAK,QAAQ,aAAe,GAAI,CAClC,GAAI,GAAQ,KAAK,MAAM,WAAW,KAAK,IAAM,GAC7C,GAAI,IAAU,GAAM,MAAO,MAAK,SAAS,EAAQ,OAAQ,GAE3D,MAAO,MAAK,SAAS,IAAS,IAAM,EAAQ,UAAY,EAAQ,WAAY,GAE9E,MAAI,KAAS,GAAa,KAAK,SAAS,EAAQ,OAAQ,GACjD,KAAK,SAAS,IAAS,IAAM,EAAQ,UAAY,EAAQ,WAAY,IAG9E,EAAG,gBAAkB,UAAW,CAC9B,GAAI,GAAO,KAAK,MAAM,WAAW,KAAK,IAAM,GAC5C,MAAI,KAAS,GAAa,KAAK,SAAS,EAAQ,OAAQ,GACjD,KAAK,SAAS,EAAQ,WAAY,IAG3C,EAAG,mBAAqB,SAAS,EAAM,CACrC,GAAI,GAAO,KAAK,MAAM,WAAW,KAAK,IAAM,GAC5C,MAAI,KAAS,EACP,IAAS,IAAM,CAAC,KAAK,UAAY,KAAK,MAAM,WAAW,KAAK,IAAM,KAAO,IACxE,MAAK,aAAe,GAAK,GAAU,KAAK,KAAK,MAAM,MAAM,KAAK,WAAY,KAAK,OAElF,MAAK,gBAAgB,GACrB,KAAK,YACE,KAAK,aAEP,KAAK,SAAS,EAAQ,OAAQ,GAEnC,IAAS,GAAa,KAAK,SAAS,EAAQ,OAAQ,GACjD,KAAK,SAAS,EAAQ,QAAS,IAGxC,EAAG,gBAAkB,SAAS,EAAM,CAClC,GAAI,GAAO,KAAK,MAAM,WAAW,KAAK,IAAM,GACxC,EAAO,EACX,MAAI,KAAS,EACX,GAAO,IAAS,IAAM,KAAK,MAAM,WAAW,KAAK,IAAM,KAAO,GAAK,EAAI,EACnE,KAAK,MAAM,WAAW,KAAK,IAAM,KAAU,GAAa,KAAK,SAAS,EAAQ,OAAQ,EAAO,GAC1F,KAAK,SAAS,EAAQ,SAAU,IAErC,IAAS,IAAM,IAAS,IAAM,CAAC,KAAK,UAAY,KAAK,MAAM,WAAW,KAAK,IAAM,KAAO,IACxF,KAAK,MAAM,WAAW,KAAK,IAAM,KAAO,GAE1C,MAAK,gBAAgB,GACrB,KAAK,YACE,KAAK,aAEV,KAAS,IAAM,GAAO,GACnB,KAAK,SAAS,EAAQ,WAAY,KAG3C,EAAG,kBAAoB,SAAS,EAAM,CACpC,GAAI,GAAO,KAAK,MAAM,WAAW,KAAK,IAAM,GAC5C,MAAI,KAAS,GAAa,KAAK,SAAS,EAAQ,SAAU,KAAK,MAAM,WAAW,KAAK,IAAM,KAAO,GAAK,EAAI,GACvG,IAAS,IAAM,IAAS,IAAM,KAAK,QAAQ,aAAe,EAC5D,MAAK,KAAO,EACL,KAAK,YAAY,EAAQ,QAE3B,KAAK,SAAS,IAAS,GAAK,EAAQ,GAAK,EAAQ,OAAQ,IAGlE,EAAG,mBAAqB,UAAW,CACjC,GAAI,GAAc,KAAK,QAAQ,YAC/B,GAAI,GAAe,GAAI,CACrB,GAAI,GAAO,KAAK,MAAM,WAAW,KAAK,IAAM,GAC5C,GAAI,IAAS,GAAI,CACf,GAAI,GAAQ,KAAK,MAAM,WAAW,KAAK,IAAM,GAC7C,GAAI,EAAQ,IAAM,EAAQ,GAAM,MAAO,MAAK,SAAS,EAAQ,YAAa,GAE5E,GAAI,IAAS,GAAI,CACf,GAAI,GAAe,GAAI,CACrB,GAAI,GAAU,KAAK,MAAM,WAAW,KAAK,IAAM,GAC/C,GAAI,IAAY,GAAM,MAAO,MAAK,SAAS,EAAQ,OAAQ,GAE7D,MAAO,MAAK,SAAS,EAAQ,SAAU,IAG3C,MAAO,MAAK,SAAS,EAAQ,SAAU,IAGzC,EAAG,qBAAuB,UAAW,CACnC,GAAI,GAAc,KAAK,QAAQ,YAC3B,EAAO,GACX,GAAI,GAAe,IACjB,GAAE,KAAK,IACP,EAAO,KAAK,oBACR,GAAkB,EAAM,KAAS,IAAS,IAC5C,MAAO,MAAK,YAAY,EAAQ,UAAW,KAAK,aAIpD,KAAK,MAAM,KAAK,IAAK,yBAA2B,GAAkB,GAAQ,MAG5E,EAAG,iBAAmB,SAAS,EAAM,CACnC,OAAQ,OAGH,IACH,MAAO,MAAK,oBAGT,IAAI,QAAE,KAAK,IAAY,KAAK,YAAY,EAAQ,YAChD,IAAI,QAAE,KAAK,IAAY,KAAK,YAAY,EAAQ,YAChD,IAAI,QAAE,KAAK,IAAY,KAAK,YAAY,EAAQ,UAChD,IAAI,QAAE,KAAK,IAAY,KAAK,YAAY,EAAQ,WAChD,IAAI,QAAE,KAAK,IAAY,KAAK,YAAY,EAAQ,cAChD,IAAI,QAAE,KAAK,IAAY,KAAK,YAAY,EAAQ,cAChD,KAAK,QAAE,KAAK,IAAY,KAAK,YAAY,EAAQ,YACjD,KAAK,QAAE,KAAK,IAAY,KAAK,YAAY,EAAQ,YACjD,IAAI,QAAE,KAAK,IAAY,KAAK,YAAY,EAAQ,WAEhD,IACH,GAAI,KAAK,QAAQ,YAAc,EAAK,MACpC,QAAE,KAAK,IACA,KAAK,YAAY,EAAQ,eAE7B,IACH,GAAI,GAAO,KAAK,MAAM,WAAW,KAAK,IAAM,GAC5C,GAAI,IAAS,KAAO,IAAS,GAAM,MAAO,MAAK,gBAAgB,IAC/D,GAAI,KAAK,QAAQ,aAAe,EAAG,CACjC,GAAI,IAAS,KAAO,IAAS,GAAM,MAAO,MAAK,gBAAgB,GAC/D,GAAI,IAAS,IAAM,IAAS,GAAM,MAAO,MAAK,gBAAgB,OAK7D,QAAS,QAAS,QAAS,QAAS,QAAS,QAAS,QAAS,QAAS,IAC3E,MAAO,MAAK,WAAW,QAGpB,QAAS,IACZ,MAAO,MAAK,WAAW,OAMpB,IACH,MAAO,MAAK,sBAET,QAAS,IACZ,MAAO,MAAK,0BAA0B,OAEnC,SAAU,IACb,MAAO,MAAK,mBAAmB,OAE5B,IACH,MAAO,MAAK,sBAET,QAAS,IACZ,MAAO,MAAK,mBAAmB,OAE5B,QAAS,IACZ,MAAO,MAAK,gBAAgB,OAEzB,QAAS,IACZ,MAAO,MAAK,kBAAkB,OAE3B,IACH,MAAO,MAAK,yBAET,KACH,MAAO,MAAK,SAAS,EAAQ,OAAQ,OAElC,IACH,MAAO,MAAK,uBAGd,KAAK,MAAM,KAAK,IAAK,yBAA2B,GAAkB,GAAQ,MAG5E,EAAG,SAAW,SAAS,EAAM,EAAM,CACjC,GAAI,GAAM,KAAK,MAAM,MAAM,KAAK,IAAK,KAAK,IAAM,GAChD,YAAK,KAAO,EACL,KAAK,YAAY,EAAM,IAGhC,EAAG,WAAa,UAAW,CAEzB,OADI,GAAS,EAAS,EAAQ,KAAK,MAC1B,CACP,AAAI,KAAK,KAAO,KAAK,MAAM,QAAU,KAAK,MAAM,EAAO,mCACvD,GAAI,GAAK,KAAK,MAAM,OAAO,KAAK,KAEhC,GADI,GAAU,KAAK,IAAO,KAAK,MAAM,EAAO,mCACvC,EAKI,EAAU,OALL,CACZ,GAAI,IAAO,IAAO,EAAU,WACnB,IAAO,KAAO,EAAW,EAAU,WACnC,IAAO,KAAO,CAAC,EAAW,MACnC,EAAU,IAAO,KAEnB,EAAE,KAAK,IAET,GAAI,GAAU,KAAK,MAAM,MAAM,EAAO,KAAK,KAC3C,EAAE,KAAK,IACP,GAAI,GAAa,KAAK,IAClB,EAAQ,KAAK,YACjB,AAAI,KAAK,aAAe,KAAK,WAAW,GAGxC,GAAI,GAAQ,KAAK,aAAgB,MAAK,YAAc,GAAI,IAAsB,OAC9E,EAAM,MAAM,EAAO,EAAS,GAC5B,KAAK,oBAAoB,GACzB,KAAK,sBAAsB,GAG3B,GAAI,GAAQ,KACZ,GAAI,CACF,EAAQ,GAAI,QAAO,EAAS,SACrB,EAAP,EAKF,MAAO,MAAK,YAAY,EAAQ,OAAQ,CAAC,QAAS,EAAS,MAAO,EAAO,MAAO,KAOlF,EAAG,QAAU,SAAS,EAAO,EAAK,EAAgC,CAUhE,OARI,GAAkB,KAAK,QAAQ,aAAe,IAAM,IAAQ,OAK5D,EAA8B,GAAkC,KAAK,MAAM,WAAW,KAAK,OAAS,GAEpG,EAAQ,KAAK,IAAK,EAAQ,EAAG,EAAW,EACnC,EAAI,EAAG,EAAI,GAAO,KAAO,IAAW,EAAK,EAAI,EAAG,EAAE,EAAG,EAAE,KAAK,IAAK,CACxE,GAAI,GAAO,KAAK,MAAM,WAAW,KAAK,KAAM,EAAO,OAEnD,GAAI,GAAmB,IAAS,GAAI,CAClC,AAAI,GAA+B,KAAK,iBAAiB,KAAK,IAAK,qEAC/D,IAAa,IAAM,KAAK,iBAAiB,KAAK,IAAK,oDACnD,IAAM,GAAK,KAAK,iBAAiB,KAAK,IAAK,2DAC/C,EAAW,EACX,SAOF,GAJA,AAAI,GAAQ,GAAM,EAAM,EAAO,GAAK,GAC/B,AAAI,GAAQ,GAAM,EAAM,EAAO,GAAK,GACpC,AAAI,GAAQ,IAAM,GAAQ,GAAM,EAAM,EAAO,GAC3C,EAAM,IACT,GAAO,EAAS,MACpB,EAAW,EACX,EAAQ,EAAQ,EAAQ,EAI1B,MADI,IAAmB,IAAa,IAAM,KAAK,iBAAiB,KAAK,IAAM,EAAG,0DAC1E,KAAK,MAAQ,GAAS,GAAO,MAAQ,KAAK,IAAM,IAAU,EAAc,KAErE,GAGT,YAAwB,EAAK,EAA6B,CACxD,MAAI,GACK,SAAS,EAAK,GAIhB,WAAW,EAAI,QAAQ,KAAM,KAGtC,YAAwB,EAAK,CAC3B,MAAI,OAAO,SAAW,WACb,KAIF,OAAO,EAAI,QAAQ,KAAM,KAGlC,EAAG,gBAAkB,SAAS,EAAO,CACnC,GAAI,GAAQ,KAAK,IACjB,KAAK,KAAO,EACZ,GAAI,GAAM,KAAK,QAAQ,GACvB,MAAI,IAAO,MAAQ,KAAK,MAAM,KAAK,MAAQ,EAAG,4BAA8B,GAC5E,AAAI,KAAK,QAAQ,aAAe,IAAM,KAAK,MAAM,WAAW,KAAK,OAAS,IACxE,GAAM,GAAe,KAAK,MAAM,MAAM,EAAO,KAAK,MAClD,EAAE,KAAK,KACE,GAAkB,KAAK,sBAAwB,KAAK,MAAM,KAAK,IAAK,oCACxE,KAAK,YAAY,EAAQ,IAAK,IAKvC,EAAG,WAAa,SAAS,EAAe,CACtC,GAAI,GAAQ,KAAK,IACjB,AAAI,CAAC,GAAiB,KAAK,QAAQ,GAAI,OAAW,MAAU,MAAQ,KAAK,MAAM,EAAO,kBACtF,GAAI,GAAQ,KAAK,IAAM,GAAS,GAAK,KAAK,MAAM,WAAW,KAAW,GACtE,AAAI,GAAS,KAAK,QAAU,KAAK,MAAM,EAAO,kBAC9C,GAAI,GAAO,KAAK,MAAM,WAAW,KAAK,KACtC,GAAI,CAAC,GAAS,CAAC,GAAiB,KAAK,QAAQ,aAAe,IAAM,IAAS,IAAK,CAC9E,GAAI,GAAQ,GAAe,KAAK,MAAM,MAAM,EAAO,KAAK,MACxD,QAAE,KAAK,IACH,GAAkB,KAAK,sBAAwB,KAAK,MAAM,KAAK,IAAK,oCACjE,KAAK,YAAY,EAAQ,IAAK,GAEvC,AAAI,GAAS,OAAO,KAAK,KAAK,MAAM,MAAM,EAAO,KAAK,OAAS,GAAQ,IACnE,IAAS,IAAM,CAAC,GAClB,GAAE,KAAK,IACP,KAAK,QAAQ,IACb,EAAO,KAAK,MAAM,WAAW,KAAK,MAE/B,KAAS,IAAM,IAAS,MAAQ,CAAC,GACpC,GAAO,KAAK,MAAM,WAAW,EAAE,KAAK,KAChC,KAAS,IAAM,IAAS,KAAM,EAAE,KAAK,IACrC,KAAK,QAAQ,MAAQ,MAAQ,KAAK,MAAM,EAAO,mBAEjD,GAAkB,KAAK,sBAAwB,KAAK,MAAM,KAAK,IAAK,oCAExE,GAAI,GAAM,GAAe,KAAK,MAAM,MAAM,EAAO,KAAK,KAAM,GAC5D,MAAO,MAAK,YAAY,EAAQ,IAAK,IAKvC,EAAG,cAAgB,UAAW,CAC5B,GAAI,GAAK,KAAK,MAAM,WAAW,KAAK,KAAM,EAE1C,GAAI,IAAO,IAAK,CACd,AAAI,KAAK,QAAQ,YAAc,GAAK,KAAK,aACzC,GAAI,GAAU,EAAE,KAAK,IACrB,EAAO,KAAK,YAAY,KAAK,MAAM,QAAQ,IAAK,KAAK,KAAO,KAAK,KACjE,EAAE,KAAK,IACH,EAAO,SAAY,KAAK,mBAAmB,EAAS,gCAExD,GAAO,KAAK,YAAY,GAE1B,MAAO,IAGT,YAA2B,EAAM,CAE/B,MAAI,IAAQ,MAAiB,OAAO,aAAa,GACjD,IAAQ,MACD,OAAO,aAAc,IAAQ,IAAM,MAAS,GAAO,MAAQ,QAGpE,EAAG,WAAa,SAAS,EAAO,CAE9B,OADI,GAAM,GAAI,EAAa,EAAE,KAAK,MACzB,CACP,AAAI,KAAK,KAAO,KAAK,MAAM,QAAU,KAAK,MAAM,KAAK,MAAO,gCAC5D,GAAI,GAAK,KAAK,MAAM,WAAW,KAAK,KACpC,GAAI,IAAO,EAAS,MACpB,AAAI,IAAO,GACT,IAAO,KAAK,MAAM,MAAM,EAAY,KAAK,KACzC,GAAO,KAAK,gBAAgB,IAC5B,EAAa,KAAK,KACb,AAAI,IAAO,MAAU,IAAO,KAC7B,MAAK,QAAQ,YAAc,IAAM,KAAK,MAAM,KAAK,MAAO,gCAC5D,EAAE,KAAK,IACH,KAAK,QAAQ,WACf,MAAK,UACL,KAAK,UAAY,KAAK,MAGpB,IAAU,IAAO,KAAK,MAAM,KAAK,MAAO,gCAC5C,EAAE,KAAK,KAGX,UAAO,KAAK,MAAM,MAAM,EAAY,KAAK,OAClC,KAAK,YAAY,EAAQ,OAAQ,IAK1C,GAAI,IAAgC,GAEpC,EAAG,qBAAuB,UAAW,CACnC,KAAK,kBAAoB,GACzB,GAAI,CACF,KAAK,sBACE,EAAP,CACA,GAAI,IAAQ,GACV,KAAK,+BAEL,MAAM,GAIV,KAAK,kBAAoB,IAG3B,EAAG,mBAAqB,SAAS,EAAU,EAAS,CAClD,GAAI,KAAK,mBAAqB,KAAK,QAAQ,aAAe,EACxD,KAAM,IAEN,KAAK,MAAM,EAAU,IAIzB,EAAG,cAAgB,UAAW,CAE5B,OADI,GAAM,GAAI,EAAa,KAAK,MACvB,CACP,AAAI,KAAK,KAAO,KAAK,MAAM,QAAU,KAAK,MAAM,KAAK,MAAO,yBAC5D,GAAI,GAAK,KAAK,MAAM,WAAW,KAAK,KACpC,GAAI,IAAO,IAAM,IAAO,IAAM,KAAK,MAAM,WAAW,KAAK,IAAM,KAAO,IACpE,MAAI,MAAK,MAAQ,KAAK,OAAU,MAAK,OAAS,EAAQ,UAAY,KAAK,OAAS,EAAQ,iBAClF,IAAO,GACT,MAAK,KAAO,EACL,KAAK,YAAY,EAAQ,eAEhC,GAAE,KAAK,IACA,KAAK,YAAY,EAAQ,YAGpC,IAAO,KAAK,MAAM,MAAM,EAAY,KAAK,KAClC,KAAK,YAAY,EAAQ,SAAU,IAE5C,GAAI,IAAO,GACT,GAAO,KAAK,MAAM,MAAM,EAAY,KAAK,KACzC,GAAO,KAAK,gBAAgB,IAC5B,EAAa,KAAK,YACT,GAAU,GAAK,CAGxB,OAFA,GAAO,KAAK,MAAM,MAAM,EAAY,KAAK,KACzC,EAAE,KAAK,IACC,OACH,IACH,AAAI,KAAK,MAAM,WAAW,KAAK,OAAS,IAAM,EAAE,KAAK,QAClD,IACH,GAAO;AAAA,EACP,cAEA,GAAO,OAAO,aAAa,GAC3B,MAEF,AAAI,KAAK,QAAQ,WACf,GAAE,KAAK,QACP,KAAK,UAAY,KAAK,KAExB,EAAa,KAAK,QAElB,EAAE,KAAK,MAMb,EAAG,yBAA2B,UAAW,CACvC,KAAO,KAAK,IAAM,KAAK,MAAM,OAAQ,KAAK,MACxC,OAAQ,KAAK,MAAM,KAAK,UACnB,KACH,EAAE,KAAK,IACP,UAEG,IACH,GAAI,KAAK,MAAM,KAAK,IAAM,KAAO,IAC/B,UAIC,IACH,MAAO,MAAK,YAAY,EAAQ,gBAAiB,KAAK,MAAM,MAAM,KAAK,MAAO,KAAK,MAKvF,KAAK,MAAM,KAAK,MAAO,0BAKzB,EAAG,gBAAkB,SAAS,EAAY,CACxC,GAAI,GAAK,KAAK,MAAM,WAAW,EAAE,KAAK,KAEtC,OADA,EAAE,KAAK,IACC,OACH,KAAK,MAAO;AAAA,MACZ,KAAK,MAAO,SACZ,KAAK,MAAO,QAAO,aAAa,KAAK,YAAY,QACjD,KAAK,MAAO,IAAkB,KAAK,qBACnC,KAAK,MAAO,QACZ,IAAI,MAAO,SACX,KAAK,MAAO,SACZ,KAAK,MAAO,SACZ,IAAI,AAAI,KAAK,MAAM,WAAW,KAAK,OAAS,IAAM,EAAE,KAAK,QACzD,IACH,MAAI,MAAK,QAAQ,WAAa,MAAK,UAAY,KAAK,IAAK,EAAE,KAAK,SACzD,OACJ,QACA,IAOH,GANI,KAAK,QACP,KAAK,mBACH,KAAK,IAAM,EACX,2BAGA,EAAY,CACd,GAAI,GAAU,KAAK,IAAM,EAEzB,YAAK,mBACH,EACA,8CAGK,aAGT,GAAI,GAAM,IAAM,GAAM,GAAI,CACxB,GAAI,GAAW,KAAK,MAAM,OAAO,KAAK,IAAM,EAAG,GAAG,MAAM,WAAW,GAC/D,EAAQ,SAAS,EAAU,GAC/B,MAAI,GAAQ,KACV,GAAW,EAAS,MAAM,EAAG,IAC7B,EAAQ,SAAS,EAAU,IAE7B,KAAK,KAAO,EAAS,OAAS,EAC9B,EAAK,KAAK,MAAM,WAAW,KAAK,KAC3B,KAAa,KAAO,IAAO,IAAM,IAAO,KAAQ,MAAK,QAAU,IAClE,KAAK,mBACH,KAAK,IAAM,EAAI,EAAS,OACxB,EACI,mCACA,gCAGD,OAAO,aAAa,GAE7B,MAAI,IAAU,GAGL,GAEF,OAAO,aAAa,KAM/B,EAAG,YAAc,SAAS,EAAK,CAC7B,GAAI,GAAU,KAAK,IACf,EAAI,KAAK,QAAQ,GAAI,GACzB,MAAI,KAAM,MAAQ,KAAK,mBAAmB,EAAS,iCAC5C,GAST,EAAG,UAAY,UAAW,CACxB,KAAK,YAAc,GAGnB,OAFI,GAAO,GAAI,EAAQ,GAAM,EAAa,KAAK,IAC3C,EAAS,KAAK,QAAQ,aAAe,EAClC,KAAK,IAAM,KAAK,MAAM,QAAQ,CACnC,GAAI,GAAK,KAAK,oBACd,GAAI,GAAiB,EAAI,GACvB,KAAK,KAAO,GAAM,MAAS,EAAI,UACtB,IAAO,GAAI,CACpB,KAAK,YAAc,GACnB,GAAQ,KAAK,MAAM,MAAM,EAAY,KAAK,KAC1C,GAAI,GAAW,KAAK,IACpB,AAAI,KAAK,MAAM,WAAW,EAAE,KAAK,OAAS,KACtC,KAAK,mBAAmB,KAAK,IAAK,6CACtC,EAAE,KAAK,IACP,GAAI,GAAM,KAAK,gBACf,AAAM,GAAQ,GAAoB,IAAkB,EAAK,IACrD,KAAK,mBAAmB,EAAU,0BACtC,GAAQ,GAAkB,GAC1B,EAAa,KAAK,QAElB,OAEF,EAAQ,GAEV,MAAO,GAAO,KAAK,MAAM,MAAM,EAAY,KAAK,MAMlD,EAAG,SAAW,UAAW,CACvB,GAAI,GAAO,KAAK,YACZ,EAAO,EAAQ,KACnB,MAAI,MAAK,SAAS,KAAK,IACrB,GAAO,GAAS,IAEX,KAAK,YAAY,EAAM,IAKhC,GAAI,IAAU,QAEd,GAAO,MAAQ,CACb,OAAQ,GACR,QAAS,GACT,eAAgB,GAChB,SAAU,GACV,eAAgB,GAChB,YAAa,GACb,KAAM,GACN,UAAW,GACX,SAAU,EACV,aAAc,GACd,WAAY,GACZ,YAAa,GACb,iBAAkB,GAClB,kBAAmB,GACnB,MAAO,GACP,UAAW,GACX,UAAW,GACX,WAAY,GACZ,mBAAoB,IAUtB,YAAe,EAAO,EAAS,CAC7B,MAAO,IAAO,MAAM,EAAO,GC17K7B,GAAM,IAAgD,GAChD,GAAQ,oEAEd,IAAS,GAAI,EAAG,GAAI,GAAM,OAAQ,KACjC,GAAc,GAAM,WAAW,KAAM,GAD7B,OA6ET,YAAuB,EAA0B,CAOhD,OANI,GAAkB,EAClB,EAAiB,EACjB,EAAmB,EACnB,EAAY,EACZ,EAAW,GAEN,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAAK,CACxC,GAAM,GAAO,EAAQ,GAErB,GADI,EAAI,GAAG,IAAY,KACnB,EAAK,SAAW,EAMpB,QAJI,GAAsB,EAEpB,EAAyB,GAET,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,OAAA,IAAM,CAAvB,GAAM,GAAO,EAAA,GACb,EAAkB,GAAc,EAAQ,GAAK,GACjD,EAAsB,EAAQ,GAE1B,EAAQ,OAAS,GACpB,IACC,GAAc,EAAQ,GAAK,GAC3B,GAAc,EAAQ,GAAK,GAC3B,GAAc,EAAQ,GAAK,GAE5B,EAAkB,EAAQ,GAC1B,EAAiB,EAAQ,GACzB,EAAmB,EAAQ,IAGxB,EAAQ,SAAW,GACtB,IAAmB,GAAc,EAAQ,GAAK,GAC9C,EAAY,EAAQ,IAGrB,EAAa,KAAK,GAGnB,GAAY,EAAa,KAAK,MAG/B,MAAO,GAGR,YAAuB,EAAW,CACjC,GAAI,GAAS,GACb,EAAM,EAAM,EAAK,CAAC,GAAO,EAAK,EAAI,GAAO,EACzC,EAAG,CACF,GAAI,GAAU,EAAM,GACpB,KAAS,EACL,EAAM,GACT,IAAW,IAEZ,GAAU,GAAM,SACR,EAAM,GAEf,MAAO,GChJO,GAAM,IACpB,WAAY,EAAK,CAChB,KAAK,KAAO,YAAe,GAAS,EAAI,KAAK,QAAU,IAGzD,GAAA,UAAC,IAAA,SAAI,EAAG,CACN,KAAK,KAAK,GAAK,IAAM,GAAM,GAAI,KAGjC,GAAA,UAAC,IAAA,SAAI,EAAG,CACP,MAAQ,CAAC,CAAE,MAAK,KAAK,GAAK,GAAM,GAAM,GAAI,MCV5B,GAAM,IACpB,SAAY,EAAO,EAAK,EAAS,CAChC,KAAK,MAAQ,EACb,KAAK,IAAM,EACX,KAAK,SAAW,EAEhB,KAAK,MAAQ,GACb,KAAK,MAAQ,GAEb,KAAK,QAAU,EACf,KAAK,UAAY,GACjB,KAAK,OAAS,GAGd,OAAO,iBAAiB,KAAM,CAC9B,SAAW,CAAE,SAAU,GAAM,MAAO,MACpC,KAAW,CAAE,SAAU,GAAM,MAAO,SAItC,GAAA,UAAC,WAAA,SAAW,EAAS,CACnB,KAAK,OAAS,GAGhB,GAAA,UAAC,YAAA,SAAY,EAAS,CACrB,KAAM,MAAQ,KAAK,MAAQ,GAG5B,GAAA,UAAC,MAAA,UAAQ,CACP,GAAM,GAAQ,GAAI,IAAM,KAAK,MAAO,KAAK,IAAK,KAAK,UAEnD,SAAM,MAAQ,KAAK,MACnB,EAAM,MAAQ,KAAK,MACnB,EAAM,QAAU,KAAK,QACrB,EAAM,UAAY,KAAK,UACvB,EAAM,OAAS,KAAK,OAEb,GAGT,GAAA,UAAC,SAAA,SAAS,EAAO,CACf,MAAO,MAAK,MAAQ,GAAS,EAAQ,KAAK,KAG5C,GAAA,UAAC,SAAA,SAAS,EAAI,CAEb,OADK,GAAQ,KACL,GACN,EAAG,GACH,EAAQ,EAAM,MAIjB,GAAA,UAAC,aAAA,SAAa,EAAI,CAEjB,OADK,GAAQ,KACL,GACN,EAAG,GACH,EAAQ,EAAM,UAIjB,GAAA,UAAC,KAAA,SAAK,EAAS,EAAW,EAAa,CACrC,YAAK,QAAU,EACV,GACJ,MAAK,MAAQ,GACb,KAAK,MAAQ,IAEd,KAAK,UAAY,EAEjB,KAAK,OAAS,GAEP,MAGT,GAAA,UAAC,YAAA,SAAY,EAAS,CACrB,KAAM,MAAQ,EAAU,KAAK,OAG9B,GAAA,UAAC,aAAA,SAAa,EAAS,CACtB,KAAM,MAAQ,EAAU,KAAK,OAG9B,GAAA,UAAC,MAAA,SAAM,EAAO,CACb,GAAO,GAAa,EAAQ,KAAK,MAE1B,EAAiB,KAAK,SAAS,MAAM,EAAG,GACxC,EAAgB,KAAK,SAAS,MAAM,GAE1C,KAAK,SAAW,EAEhB,GAAM,GAAW,GAAI,IAAM,EAAO,KAAK,IAAK,GAC5C,SAAS,MAAQ,KAAK,MACtB,KAAK,MAAQ,GAEb,KAAK,IAAM,EAEX,AAAI,KAAK,OAET,GAAU,KAAK,GAAI,IAClB,KAAK,QAAU,IAEf,KAAK,QAAU,EAGhB,EAAS,KAAO,KAAK,KACjB,EAAS,MAAM,GAAS,KAAK,SAAW,GAC5C,EAAS,SAAW,KACpB,KAAK,KAAO,EAEL,GAGT,GAAA,UAAC,SAAA,UAAW,CACV,MAAO,MAAK,MAAQ,KAAK,QAAU,KAAK,OAG1C,GAAA,UAAC,QAAA,SAAQ,EAAI,CAEZ,GADC,KAAK,MAAQ,KAAK,MAAM,QAAQ,EAAI,IAChC,KAAK,MAAM,OAAQ,MAAO,GAE9B,GAAM,GAAU,KAAK,QAAQ,QAAQ,EAAI,IAEzC,GAAI,EAAQ,OACX,MAAI,KAAY,KAAK,SACrB,KAAM,MAAM,KAAK,MAAQ,EAAQ,QAAQ,KAAK,GAAI,OAAW,IAEtD,GAMR,GAHA,KAAM,KAAK,GAAI,OAAW,IAEzB,KAAK,MAAQ,KAAK,MAAM,QAAQ,EAAI,IAChC,KAAK,MAAM,OAAQ,MAAO,IAIjC,GAAA,UAAC,UAAA,SAAU,EAAI,CAEd,GADC,KAAK,MAAQ,KAAK,MAAM,QAAQ,EAAI,IAChC,KAAK,MAAM,OAAQ,MAAO,GAE9B,GAAM,GAAU,KAAK,QAAQ,QAAQ,EAAI,IAEzC,GAAI,EAAQ,OACX,MAAI,KAAY,KAAK,SACpB,MAAK,MAAM,KAAK,IAAM,EAAQ,QAC/B,KAAM,KAAK,GAAI,OAAW,KAEnB,GAMR,GAHA,KAAM,KAAK,GAAI,OAAW,IAEzB,KAAK,MAAQ,KAAK,MAAM,QAAQ,EAAI,IAChC,KAAK,MAAM,OAAQ,MAAO,ICtJjC,GAAI,IAAI,UAAM,CACb,KAAM,IAAI,OAAM,4EAEjB,AAAI,MAAO,SAAW,aAAe,MAAO,QAAO,MAAS,WAC3D,GAAI,SAAG,EAAI,CAAA,MAAG,QAAO,KAAK,SAAS,mBAAmB,MAC5C,MAAO,SAAW,YAC5B,IAAI,SAAG,EAAI,CAAA,MAAG,QAAO,KAAK,EAAK,SAAS,SAAS,YAGnC,GAAM,IACpB,SAAY,EAAY,CACvB,KAAK,QAAU,EACf,KAAK,KAAO,EAAW,KACvB,KAAK,QAAU,EAAW,QAC1B,KAAK,eAAiB,EAAW,eACjC,KAAK,MAAQ,EAAW,MACzB,KAAM,SAAW,GAAO,EAAW,WAGpC,GAAA,UAAC,SAAA,UAAW,CACV,MAAO,MAAK,UAAU,OAGxB,GAAA,UAAC,MAAA,UAAQ,CACR,MAAQ,8CAAgD,GAAK,KAAK,aC1BpD,YAAqB,EAAM,CACzC,GAAM,GAAQ,EAAK,MAAM;GAEnB,EAAS,EAAM,OAAM,SAAC,EAAK,CAAA,MAAG,OAAO,KAAK,KAC1C,EAAS,EAAM,OAAM,SAAC,EAAK,CAAA,MAAG,SAAS,KAAK,KAElD,GAAI,EAAO,SAAW,GAAK,EAAO,SAAW,EAC5C,MAAO,MAMR,GAAI,EAAO,QAAU,EAAO,OAC3B,MAAO,IAIR,GAAM,GAAM,EAAO,OAAM,SAAE,EAAU,EAAS,CAC7C,GAAM,GAAY,MAAM,KAAK,GAAS,GAAG,OACzC,MAAO,MAAK,IAAI,EAAW,IACzB,KAEH,MAAO,IAAI,OAAM,EAAM,GAAG,KAAK,KCvBjB,YAAyB,EAAM,EAAI,CACjD,GAAM,GAAY,EAAK,MAAM,SACvB,EAAU,EAAG,MAAM,SAIzB,IAFA,EAAU,MAEH,EAAU,KAAO,EAAQ,IAC/B,EAAU,QACV,EAAQ,QAGT,GAAI,EAAU,OAEb,OADI,GAAI,EAAU,OACX,KAAK,EAAU,GAAK,KAG5B,MAAO,GAAU,OAAO,GAAS,KAAK,KChBvC,GAAM,IAAW,OAAO,UAAU,SAEnB,YAAkB,EAAO,CACvC,MAAO,IAAS,KAAK,KAAW,kBCHlB,YAAoB,EAAQ,CAI1C,OAHM,GAAgB,EAAO,MAAM;GAC7B,EAAc,GAEX,EAAI,EAAG,EAAM,EAAG,EAAI,EAAc,OAAQ,IAClD,EAAY,KAAK,GACjB,GAAO,EAAc,GAAG,OAAS,EAGlC,MAAO,UAAgB,EAAO,CAG7B,OAFI,GAAI,EACJ,EAAI,EAAY,OACb,EAAI,GAAG,CACb,GAAM,GAAK,EAAI,GAAM,EACrB,AAAI,EAAQ,EAAY,GACvB,EAAI,EAEJ,EAAI,EAAI,EAGV,GAAM,GAAO,EAAI,EACX,EAAS,EAAQ,EAAY,GACnC,MAAO,CAAA,KAAE,EAAI,OAAE,ICtBF,GAAM,IACpB,SAAY,EAAO,CAClB,KAAK,MAAQ,EACb,KAAK,kBAAoB,EACzB,KAAK,oBAAsB,EAC3B,KAAK,IAAM,GACX,KAAK,YAAc,KAAK,IAAI,KAAK,mBAAqB,GACtD,KAAK,QAAU,MAGjB,GAAA,UAAC,QAAA,SAAQ,EAAa,EAAS,EAAK,EAAW,CAC7C,GAAI,EAAQ,OAAQ,CACnB,GAAM,GAAU,CAAC,KAAK,oBAAqB,EAAa,EAAI,KAAM,EAAI,QACtE,AAAI,GAAa,GAChB,EAAQ,KAAK,GAEf,KAAM,YAAY,KAAK,OAChB,AAAI,MAAK,SAChB,KAAM,YAAY,KAAK,KAAK,SAG5B,KAAK,QAAQ,GACb,KAAK,QAAU,MAGjB,GAAA,UAAC,iBAAA,SAAiB,EAAa,EAAO,EAAU,EAAK,EAAoB,CAIvE,OAHI,GAAoB,EAAM,MAC1B,EAAQ,GAEL,EAAoB,EAAM,KAChC,AAAI,MAAK,OAAS,GAAS,EAAmB,IAAI,KAClD,KAAM,YAAY,KAAK,CAAC,KAAK,oBAAqB,EAAa,EAAI,KAAM,EAAI,SAG7E,AAAI,EAAS,KAAuB;EACnC,GAAI,MAAQ,EACZ,EAAI,OAAS,EACb,KAAK,mBAAqB,EAC1B,KAAK,IAAI,KAAK,mBAAqB,KAAK,YAAc,GACtD,KAAK,oBAAsB,EAC5B,EAAS,IAER,GAAI,QAAU,EACd,KAAK,qBAAuB,EAC7B,EAAS,IAGV,GAAsB,EAGtB,KAAK,QAAU,MAGjB,GAAA,UAAC,QAAA,SAAQ,EAAK,CACZ,GAAI,EAAC,EAEN,IAAO,GAAQ,EAAI,MAAM;GAExB,GAAI,EAAM,OAAS,EAAG,CACrB,OAAS,GAAI,EAAG,EAAI,EAAM,OAAS,EAAG,IACrC,KAAK,oBACL,KAAK,IAAI,KAAK,mBAAqB,KAAK,YAAc,GAEvD,KAAK,oBAAsB,EAG5B,KAAK,qBAAuB,EAAM,EAAM,OAAS,GAAG,SCxDtD,GAAM,IAAI;EAEJ,GAAS,CACd,WAAY,GACZ,YAAa,GACb,UAAW,IAGS,EACpB,SAAY,EAAQ,EAAc,gBAAJ,IAC7B,GAAM,GAAQ,GAAI,IAAM,EAAG,EAAO,OAAQ,GAE1C,OAAO,iBAAiB,KAAM,CAC9B,SAAwB,CAAE,SAAU,GAAM,MAAO,GACjD,MAAwB,CAAE,SAAU,GAAM,MAAO,IACjD,MAAwB,CAAE,SAAU,GAAM,MAAO,IACjD,WAAwB,CAAE,SAAU,GAAM,MAAO,GACjD,UAAwB,CAAE,SAAU,GAAM,MAAO,GACjD,kBAAwB,CAAE,SAAU,GAAM,MAAO,GACjD,QAAwB,CAAE,SAAU,GAAM,MAAO,IACjD,MAAwB,CAAE,SAAU,GAAM,MAAO,IAChD,SAAuB,CAAE,SAAU,GAAM,MAAO,EAAQ,UACxD,sBAAuB,CAAE,SAAU,GAAM,MAAO,EAAQ,uBACxD,mBAAuB,CAAE,SAAU,GAAM,MAAO,GAAI,KACrD,YAAwB,CAAE,SAAU,GAAM,MAAO,IAChD,UAAuB,CAAE,SAAU,GAAM,MAAO,GAAY,MAO9D,KAAM,QAAQ,GAAK,EACnB,KAAM,MAAM,EAAO,QAAU,GAG9B,EAAA,UAAC,qBAAA,SAAqB,EAAM,CAC3B,KAAM,mBAAmB,IAAI,IAG9B,EAAA,UAAC,OAAA,SAAO,EAAS,CACf,GAAI,MAAO,IAAY,SAAU,KAAM,IAAI,WAAU,kCAErD,YAAK,OAAS,EACP,MAGT,EAAA,UAAC,WAAA,SAAW,EAAO,EAAS,CAC1B,GAAI,MAAO,IAAY,SAAU,KAAM,IAAI,WAAU,qCAIrD,KAAK,OAAO,GAEb,GAAO,GAAQ,KAAK,MAAM,GAE1B,MAAK,GACH,EAAM,WAAW,GAEjB,KAAK,OAAS,EAIR,MAGT,EAAA,UAAC,YAAA,SAAY,EAAO,EAAS,CAC3B,GAAI,MAAO,IAAY,SAAU,KAAM,IAAI,WAAU,qCAIrD,KAAK,OAAO,GAEb,GAAO,GAAQ,KAAK,QAAQ,GAE5B,MAAK,GACH,EAAM,YAAY,GAElB,KAAK,OAAS,EAIR,MAGT,EAAA,UAAC,MAAA,UAAQ,CAMR,OALO,GAAS,GAAI,GAAY,KAAK,SAAU,CAAE,SAAU,KAAK,WAE3D,EAAgB,KAAK,WACrB,EAAe,EAAO,WAAa,EAAO,kBAAoB,EAAc,QAEzE,GAAe,CACtB,EAAQ,QAAQ,EAAY,OAAS,EACrC,EAAQ,MAAM,EAAY,KAAO,EAEhC,GAAM,GAAoB,EAAc,KAClC,EAAkB,GAAqB,EAAkB,QAEhE,AAAK,GACH,GAAY,KAAO,EACnB,EAAgB,SAAW,EAE5B,EAAe,GAGhB,EAAiB,EAGjB,SAAO,UAAY,EAEf,KAAK,uBACT,GAAQ,sBAAwB,KAAK,sBAAsB,SAG5D,EAAQ,mBAAqB,GAAI,IAAO,KAAK,oBAE5C,EAAO,MAAQ,KAAK,MACpB,EAAO,MAAQ,KAAK,MAEb,GAGT,EAAA,UAAC,mBAAA,SAAmB,EAAS,YAC3B,EAAU,GAAW,GAErB,GAAM,GAAc,EACd,EAAQ,OAAO,KAAK,KAAK,aACzB,EAAW,GAAI,IAAS,EAAQ,OAEhC,EAAS,GAAW,KAAK,UAE/B,MAAI,MAAK,OACT,EAAU,QAAQ,KAAK,OAGxB,KAAM,WAAW,SAAQ,SAAC,EAAM,CAC/B,GAAO,GAAM,EAAO,EAAM,OAEzB,AAAI,EAAM,MAAM,QAAQ,EAAS,QAAQ,EAAM,OAE/C,AAAI,EAAM,OACV,EAAU,QACR,EACD,EAAO,QACN,EACA,EAAM,UAAY,EAAM,QAAQ,EAAM,UAAY,IAGnD,EAAS,iBAAiB,EAAa,EAAO,EAAK,SAAU,EAAK,EAAK,oBAGpE,EAAM,MAAM,QAAQ,EAAS,QAAQ,EAAM,SAGzC,CACN,KAAM,EAAQ,KAAO,EAAQ,KAAK,MAAM,SAAS,MAAQ,KAC1D,QAAU,CAAC,EAAQ,OAAS,GAAgB,EAAQ,MAAQ,GAAI,EAAQ,QAAU,MACjF,eAAgB,EAAQ,eAAiB,CAAC,KAAK,UAAY,CAAC,MAC7D,MAAC,EACA,SAAU,EAAS,MAItB,EAAA,UAAC,YAAA,SAAY,EAAS,CACrB,MAAQ,IAAI,IAAU,KAAK,mBAAmB,KAG/C,EAAA,UAAC,gBAAA,UAAkB,CACjB,MAAO,MAAK,YAAc,KAAO,IAAO,KAAK,WAG/C,EAAA,UAAC,OAAA,SAAO,EAAW,EAAS,CAC1B,GAAM,GAAU,aAShB,GAPI,GAAS,IACb,GAAW,EACX,EAAa,QAGb,EAAY,IAAc,OAAY,EAAY,KAAK,WAAa,IAEhE,IAAc,GAAI,MAAO,MAE7B,EAAU,GAAW,GAGrB,GAAM,GAAa,GAEnB,GAAI,EAAQ,QAAS,CACrB,GAAO,GACL,MAAO,GAAQ,QAAQ,IAAO,SAAW,CAAC,EAAQ,SAAW,EAAQ,QACtE,EAAW,QAAO,SAAC,EAAU,CAC7B,OAAU,GAAI,EAAU,GAAI,EAAI,EAAU,GAAI,GAAK,EACjD,EAAW,GAAK,KAKpB,GAAK,GAA4B,EAAQ,cAAgB,GAClD,EAAQ,SAAG,EAAM,CACvB,MAAK,GAA2B,GAAU,EAAY,EACtD,GAA6B,GACrB,IAGR,KAAK,MAAQ,KAAK,MAAM,QAAQ,EAAS,GAK1C,OAHK,GAAY,EACZ,EAAQ,KAAK,WAEV,GAAO,CACb,GAAM,GAAM,EAAM,IAElB,GAAI,EAAM,OACT,AAAK,EAAW,IACf,GAAM,QAAU,EAAM,QAAQ,QAAQ,EAAS,GAE3C,EAAM,QAAQ,QACjB,GAA4B,EAAM,QAAQ,EAAM,QAAQ,OAAS,KAAO;QAM1E,KAFA,EAAY,EAAM,MAEX,EAAY,GAAK,CACvB,GAAI,CAAC,EAAW,GAAY,CAC5B,GAAO,GAAO,KAAK,SAAS,GAE3B,AAAI,IAAS;EACb,EAA6B,GAClB,IAAS,MAAQ,GAC5B,GAA6B,GAExB,IAAc,EAAM,OAGxB,MAAM,YAAY,EAAO,GACxB,EAAQ,EAAM,MACd,EAAM,aAAa,IAKvB,GAAc,EAIf,EAAY,EAAM,IAClB,EAAQ,EAAM,KAGf,YAAK,MAAQ,KAAK,MAAM,QAAQ,EAAS,GAElC,MAGT,EAAA,UAAC,OAAA,UAAS,CACR,KAAM,IAAI,OAAM,oFAGlB,EAAA,UAAC,WAAA,SAAW,EAAO,EAAS,CAC1B,MAAK,IAAO,YACX,SAAQ,KAAK,sFACb,GAAO,WAAa,IAGd,KAAK,WAAW,EAAO,IAGhC,EAAA,UAAC,YAAA,SAAY,EAAO,EAAS,CAC3B,MAAK,IAAO,aACX,SAAQ,KAAK,yFACb,GAAO,YAAc,IAGf,KAAK,aAAa,EAAO,IAGlC,EAAA,UAAC,KAAA,SAAK,EAAO,EAAK,EAAO,CACvB,GAAI,GAAS,GAAS,GAAS,EAAK,KAAM,IAAI,OAAM,yCAIpD,KAAK,OAAO,GACZ,KAAK,OAAO,GACZ,KAAK,OAAO,GAEb,GAAO,GAAQ,KAAK,QAAQ,GACrB,EAAO,KAAK,MAAM,GAElB,EAAU,EAAM,SAChB,EAAW,EAAK,KAEhB,EAAW,KAAK,QAAQ,GAC9B,GAAI,CAAC,GAAY,IAAS,KAAK,UAAW,MAAO,MACjD,GAAM,GAAU,EAAW,EAAS,SAAW,KAAK,UAErD,MAAK,IAAS,GAAQ,KAAO,GACxB,GAAU,GAAS,SAAW,GAE9B,GAAS,GAAQ,KAAO,GACxB,GAAU,GAAS,SAAW,GAE7B,EAAM,UAAU,MAAK,WAAa,EAAK,MACvC,EAAK,MACT,MAAK,UAAY,EAAM,SACvB,KAAK,UAAU,KAAO,MAGvB,EAAM,SAAW,EACjB,EAAK,KAAO,GAAY,KAEnB,GAAS,MAAK,WAAa,GAC3B,GAAU,MAAK,UAAY,GAGzB,MAGT,EAAA,UAAC,UAAA,SAAU,EAAO,EAAK,EAAS,EAAS,CACvC,GAAI,MAAO,IAAY,SAAU,KAAM,IAAI,WAAU,wCAErD,KAAO,EAAQ,GAAG,GAAS,KAAK,SAAS,OACzC,KAAO,EAAM,GAAG,GAAO,KAAK,SAAS,OAErC,GAAI,EAAM,KAAK,SAAS,OAAQ,KAAM,IAAI,OAAM,wBACjD,GAAK,IAAU,EACb,KAAM,IAAI,OAAM,sFAIjB,KAAK,OAAO,GACZ,KAAK,OAAO,GAER,IAAY,IACV,IAAO,WACX,SAAQ,KAAK,iIACb,GAAO,UAAY,IAGpB,EAAU,CAAE,UAAW,KAExB,GAAM,GAAY,IAAY,OAAY,EAAQ,UAAY,GACxD,EAAc,IAAY,OAAY,EAAQ,YAAc,GAEnE,GAAK,EAAW,CACd,GAAM,GAAW,KAAK,SAAS,MAAM,EAAO,GAC7C,KAAM,YAAY,GAAY,GAG/B,GAAO,GAAQ,KAAK,QAAQ,GACrB,EAAO,KAAK,MAAM,GAEzB,GAAK,EAAO,CACV,GAAI,EAAM,EAAM,KAAO,EAAM,OAAS,KAAK,QAAQ,EAAM,KACxD,KAAM,IAAI,OAAM,yCAKjB,GAFD,EAAO,KAAK,EAAS,EAAW,GAE3B,IAAU,EAAM,CAEnB,OADI,GAAQ,EAAM,KACX,IAAU,GACjB,EAAO,KAAK,GAAI,IACf,EAAQ,EAAM,KAGhB,EAAO,KAAK,GAAI,SAEV,CAEP,GAAO,GAAW,GAAI,IAAM,EAAO,EAAK,IAAI,KAAK,EAAS,GAGzD,EAAK,KAAO,EACZ,EAAS,SAAW,EAItB,MAAQ,OAGT,EAAA,UAAC,QAAA,SAAQ,EAAS,CAChB,GAAI,MAAO,IAAY,SAAU,KAAM,IAAI,WAAU,kCAEtD,YAAM,MAAQ,EAAU,KAAK,MACrB,MAGT,EAAA,UAAC,YAAA,SAAY,EAAO,EAAS,CAC3B,GAAI,MAAO,IAAY,SAAU,KAAM,IAAI,WAAU,qCAIrD,KAAK,OAAO,GAEb,GAAO,GAAQ,KAAK,MAAM,GAE1B,MAAK,GACH,EAAM,YAAY,GAEnB,KAAM,MAAQ,EAAU,KAAK,MAItB,MAGT,EAAA,UAAC,aAAA,SAAa,EAAO,EAAS,CAC5B,GAAI,MAAO,IAAY,SAAU,KAAM,IAAI,WAAU,qCAIrD,KAAK,OAAO,GAEb,GAAO,GAAQ,KAAK,QAAQ,GAE5B,MAAK,GACH,EAAM,aAAa,GAEpB,KAAM,MAAQ,EAAU,KAAK,MAItB,MAGT,EAAA,UAAC,OAAA,SAAO,EAAO,EAAK,CAClB,KAAO,EAAQ,GAAG,GAAS,KAAK,SAAS,OACzC,KAAO,EAAM,GAAG,GAAO,KAAK,SAAS,OAErC,GAAI,IAAU,EAAK,MAAO,MAE1B,GAAI,EAAQ,GAAK,EAAM,KAAK,SAAS,OAAQ,KAAM,IAAI,OAAM,8BAC9D,GAAK,EAAQ,EAAK,KAAM,IAAI,OAAM,kCAIjC,KAAK,OAAO,GACZ,KAAK,OAAO,GAIb,OAFK,GAAQ,KAAK,QAAQ,GAElB,GACN,EAAM,MAAQ,GACd,EAAM,MAAQ,GACd,EAAM,KAAK,IAEX,EAAQ,EAAM,EAAM,IAAM,KAAK,QAAQ,EAAM,KAAO,KAItD,MAAQ,OAGT,EAAA,UAAC,SAAA,UAAW,CACV,GAAI,KAAK,MAAM,OACd,MAAO,MAAK,MAAM,KAAK,MAAM,OAAS,GACvC,GAAI,GAAQ,KAAK,UACjB,EAAG,CACF,GAAI,EAAM,MAAM,OACf,MAAO,GAAM,MAAM,EAAM,MAAM,OAAS,GACzC,GAAI,EAAM,QAAQ,OACjB,MAAO,GAAM,QAAQ,EAAM,QAAQ,OAAS,GAC7C,GAAI,EAAM,MAAM,OACf,MAAO,GAAM,MAAM,EAAM,MAAM,OAAS,SACjC,EAAQ,EAAM,UACvB,MAAI,MAAK,MAAM,OACP,KAAK,MAAM,KAAK,MAAM,OAAS,GAChC,IAGT,EAAA,UAAC,SAAA,UAAW,CACV,GAAI,GAAY,KAAK,MAAM,YAAY,IACvC,GAAI,IAAc,GACjB,MAAO,MAAK,MAAM,OAAO,EAAY,GACtC,GAAI,GAAU,KAAK,MACf,EAAQ,KAAK,UACjB,EAAG,CACH,GAAK,EAAM,MAAM,OAAS,EAAG,CAE3B,GADD,EAAa,EAAM,MAAM,YAAY,IAChC,IAAc,GACjB,MAAO,GAAM,MAAM,OAAO,EAAY,GAAK,EAC5C,EAAU,EAAM,MAAQ,EAG1B,GAAK,EAAM,QAAQ,OAAS,EAAG,CAE7B,GADD,EAAa,EAAM,QAAQ,YAAY,IAClC,IAAc,GACjB,MAAO,GAAM,QAAQ,OAAO,EAAY,GAAK,EAC9C,EAAU,EAAM,QAAU,EAG5B,GAAK,EAAM,MAAM,OAAS,EAAG,CAE3B,GADD,EAAa,EAAM,MAAM,YAAY,IAChC,IAAc,GACjB,MAAO,GAAM,MAAM,OAAO,EAAY,GAAK,EAC5C,EAAU,EAAM,MAAQ,SAEjB,EAAQ,EAAM,UAEvB,MADD,GAAa,KAAK,MAAM,YAAY,IAC/B,IAAc,GACV,KAAK,MAAM,OAAO,EAAY,GAAK,EACpC,KAAK,MAAQ,GAGtB,EAAA,UAAC,MAAA,SAAM,EAAW,EAA4B,CAC5C,mBADa,kBAAS,KAAK,SAAS,QAC7B,EAAQ,GAAG,GAAS,KAAK,SAAS,OACzC,KAAO,EAAM,GAAG,GAAO,KAAK,SAAS,OAMrC,OAJI,GAAS,GAGT,EAAQ,KAAK,WACV,GAAU,GAAM,MAAQ,GAAS,EAAM,KAAO,IAAQ,CAE5D,GAAI,EAAM,MAAQ,GAAO,EAAM,KAAO,EACtC,MAAQ,GAGR,EAAQ,EAAM,KAGhB,GAAK,GAAS,EAAM,QAAU,EAAM,QAAU,EAC5C,KAAM,IAAI,OAAK,iCAAkC,EAAK,2BAGxD,OADO,GAAa,EACZ,GAAO,CACb,AAAI,EAAM,OAAU,KAAe,GAAS,EAAM,QAAU,IAC3D,IAAU,EAAM,OAGjB,GAAM,GAAc,EAAM,MAAQ,GAAO,EAAM,KAAO,EACvD,GAAK,GAAe,EAAM,QAAU,EAAM,MAAQ,EAChD,KAAM,IAAI,OAAK,iCAAkC,EAAG,yBAErD,GAAM,GAAa,IAAe,EAAQ,EAAQ,EAAM,MAAQ,EAC1D,EAAW,EAAc,EAAM,QAAQ,OAAS,EAAM,EAAM,IAAM,EAAM,QAAQ,OAQvF,GANC,GAAU,EAAM,QAAQ,MAAM,EAAY,GAEtC,EAAM,OAAU,EAAC,GAAe,EAAM,MAAQ,IACjD,IAAU,EAAM,OAGb,EACH,MAGD,EAAQ,EAAM,KAGhB,MAAQ,IAIT,EAAA,UAAC,KAAA,SAAK,EAAO,EAAK,CACjB,GAAO,GAAQ,KAAK,QACpB,SAAO,OAAO,EAAG,GAChB,EAAM,OAAO,EAAK,EAAM,SAAS,QAE1B,GAGT,EAAA,UAAC,OAAA,SAAO,EAAO,CACb,GAAI,OAAK,QAAQ,IAAU,KAAK,MAAM,IAOvC,OAHK,GAAQ,KAAK,kBACX,EAAgB,EAAQ,EAAM,IAE7B,GAAO,CACb,GAAI,EAAM,SAAS,GAAQ,MAAO,MAAK,YAAY,EAAO,GAE3D,EAAS,EAAgB,KAAK,QAAQ,EAAM,KAAO,KAAK,MAAM,EAAM,SAItE,EAAA,UAAC,YAAA,SAAY,EAAO,EAAO,CAC1B,GAAK,EAAM,QAAU,EAAM,QAAQ,OAAQ,CAEzC,GAAM,GAAM,GAAW,KAAK,UAAU,GACvC,KAAO,IAAI,6DAC6C,EAAI,KAAI,IAAI,EAAI,OAAM,YAC3E,EAAM,SAAQ,MAKlB,GAAO,GAAW,EAAM,MAAM,GAE9B,YAAM,MAAM,GAAS,EACrB,KAAM,QAAQ,GAAS,EACvB,KAAM,MAAM,EAAS,KAAO,EAEvB,IAAU,KAAK,WAAW,MAAK,UAAY,GAE/C,KAAK,kBAAoB,EAElB,IAGT,EAAA,UAAC,SAAA,UAAW,CAIX,OAHK,GAAM,KAAK,MAEX,EAAQ,KAAK,WACV,GACN,GAAO,EAAM,WACb,EAAQ,EAAM,KAGf,MAAO,GAAM,KAAK,OAGpB,EAAA,UAAC,QAAA,UAAU,CACT,GAAI,GAAQ,KAAK,WACjB,EACC,IAAI,EAAM,MAAM,QAAU,EAAM,MAAM,QACrC,EAAO,QAAQ,QAAU,EAAM,QAAQ,QACvC,EAAO,MAAM,QAAU,EAAM,MAAM,OACnC,MAAO,SACA,EAAQ,EAAM,MACxB,MAAQ,IAGT,EAAA,UAAC,OAAA,UAAS,CACR,GAAI,GAAQ,KAAK,WACb,EAAS,EACb,EACC,IAAU,EAAM,MAAM,OAAS,EAAM,QAAQ,OAAS,EAAM,MAAM,aAC1D,EAAQ,EAAM,MACxB,MAAQ,IAGT,EAAA,UAAC,UAAA,UAAY,CACX,MAAO,MAAK,KAAK,aAGnB,EAAA,UAAC,KAAA,SAAK,EAAU,CACd,MAAO,MAAK,UAAU,GAAU,QAAQ,IAG1C,EAAA,UAAC,eAAA,SAAe,EAAU,CACxB,GAAM,GAAK,GAAI,QAAQ,IAAY,OAAS,MAG7C,GADC,KAAK,MAAQ,KAAK,MAAM,QAAQ,EAAI,IAChC,KAAK,MAAM,OAAQ,MAAO,GAE9B,GAAI,GAAQ,KAAK,UAEjB,EAAG,CACF,GAAM,GAAM,EAAM,IACZ,EAAU,EAAM,QAAQ,GAa9B,GAVI,EAAM,MAAQ,GACb,MAAK,YAAc,GACtB,MAAK,UAAY,EAAM,MAGzB,KAAM,MAAM,EAAM,KAAO,EACxB,KAAK,QAAQ,EAAM,KAAK,OAAS,EAAM,KACvC,KAAK,MAAM,EAAM,KAAK,KAAO,EAAM,MAGhC,EAAS,MAAO,GACpB,EAAQ,EAAM,eACN,GAEV,MAAQ,IAGT,EAAA,UAAC,QAAA,SAAQ,EAAU,CACjB,YAAK,eAAe,GACb,MAET,EAAA,UAAC,iBAAA,SAAiB,EAAU,CAC1B,GAAM,GAAK,GAAI,QAAO,IAAO,IAAY,OAAS,KAGnD,GADC,KAAK,MAAQ,KAAK,MAAM,QAAQ,EAAI,IAChC,KAAK,MAAM,OAAQ,MAAO,GAE9B,GAAI,GAAQ,KAAK,WAEjB,EAAG,CACF,GAAM,GAAM,EAAM,IACZ,EAAU,EAAM,UAAU,GAWhC,GATI,EAAM,MAAQ,GAEb,KAAU,KAAK,WAAW,MAAK,UAAY,EAAM,MAEtD,KAAM,MAAM,EAAM,KAAO,EACxB,KAAK,QAAQ,EAAM,KAAK,OAAS,EAAM,KACvC,KAAK,MAAM,EAAM,KAAK,KAAO,EAAM,MAGhC,EAAS,MAAO,GACpB,EAAQ,EAAM,WACN,GAEV,MAAQ,IAGT,EAAA,UAAC,UAAA,SAAU,EAAU,CACnB,YAAK,iBAAiB,GACf,MCtsBT,GAAM,IAAa,OAAO,UAAU,eAEf,GACpB,SAAY,EAAc,gBAAJ,IACtB,KAAM,MAAQ,EAAQ,OAAS,GAC9B,KAAK,UAAY,EAAQ,YAAc,OAAY,EAAQ,UAAY;EACvE,KAAK,QAAU,GACf,KAAK,cAAgB,GACrB,KAAK,4BAA8B,IAGrC,GAAA,UAAC,UAAA,SAAU,EAAQ,CACjB,GAAI,YAAkB,GACrB,MAAO,MAAK,UAAU,CACtB,QAAU,EACT,SAAU,EAAO,SACjB,UAAW,KAAK,YAInB,GAAK,CAAC,GAAS,IAAW,CAAC,EAAO,QAChC,KAAM,IAAI,OAAM,wIAYjB,GATA,CAAC,WAAY,wBAAyB,aAAa,QAAO,SAAC,EAAO,CAClE,AAAM,GAAW,KAAK,EAAQ,IAAS,GAAO,GAAU,EAAO,QAAQ,MAGnE,EAAO,YAAc,QAExB,GAAO,UAAY,KAAK,WAGrB,EAAO,SACV,GAAI,CAAC,GAAW,KAAK,KAAK,4BAA6B,EAAO,UAC7D,KAAK,4BAA4B,EAAO,UAAY,KAAK,cAAc,OACxE,KAAM,cAAc,KAAK,CAAE,SAAU,EAAO,SAAU,QAAS,EAAO,QAAQ,eACvE,CACN,GAAM,GAAe,KAAK,cAAc,KAAK,4BAA4B,EAAO,WACjF,GAAK,EAAO,QAAQ,WAAa,EAAa,QAC7C,KAAO,IAAI,OAAK,kCAAmC,EAAO,SAAQ,yBAKrE,YAAM,QAAQ,KAAK,GACX,MAGT,GAAA,UAAC,OAAA,SAAO,EAAK,EAAS,CACrB,YAAM,UAAU,CACd,QAAS,GAAI,GAAY,GAC1B,UAAa,GAAW,EAAQ,WAAc,KAGvC,MAGT,GAAA,UAAC,MAAA,UAAQ,CACP,GAAM,GAAS,GAAI,IAAO,CACzB,MAAO,KAAK,MACZ,UAAW,KAAK,YAGlB,YAAM,QAAQ,QAAO,SAAC,EAAO,CAC5B,EAAQ,UAAU,CAChB,SAAU,EAAO,SACjB,QAAS,EAAO,QAAQ,QACxB,UAAW,EAAO,cAIb,GAGT,GAAA,UAAC,mBAAA,SAAmB,EAAc,2BAAJ,IAC5B,GAAM,GAAQ,GACf,KAAM,QAAQ,QAAO,SAAC,EAAO,CAC3B,OAAO,KAAK,EAAO,QAAQ,aAAa,QAAO,SAAC,EAAK,CACpD,AAAK,CAAC,EAAM,QAAQ,IAAO,EAAM,KAAK,OAIzC,GAAO,GAAW,GAAI,IAAS,EAAQ,OAEtC,MAAI,MAAK,OACT,EAAU,QAAQ,KAAK,OAGxB,KAAM,QAAQ,QAAO,SAAE,EAAQ,EAAG,CAChC,AAAI,EAAI,GACR,EAAU,QAAQ,EAAK,WAGvB,GAAM,GAAc,EAAO,SAAW,EAAK,4BAA4B,EAAO,UAAY,GACpF,EAAc,EAAO,QACrB,EAAS,GAAW,EAAY,UAEtC,AAAI,EAAY,OAChB,EAAU,QAAQ,EAAY,OAG/B,EAAa,WAAW,SAAQ,SAAC,EAAM,CACtC,GAAO,GAAM,EAAO,EAAM,OAEzB,AAAI,EAAM,MAAM,QAAQ,EAAS,QAAQ,EAAM,OAE/C,AAAI,EAAO,SACV,AAAI,EAAM,OACV,EAAU,QACR,EACD,EAAO,QACN,EACA,EAAM,UAAY,EAAM,QAAQ,EAAM,UAAY,IAGpD,EAAU,iBACR,EACA,EACD,EAAa,SACZ,EACD,EAAa,oBAIf,EAAU,QAAQ,EAAM,SAGpB,EAAM,MAAM,QAAQ,EAAS,QAAQ,EAAM,SAG5C,EAAY,OAChB,EAAU,QAAQ,EAAY,SAIxB,CACN,KAAM,EAAQ,KAAO,EAAQ,KAAK,MAAM,SAAS,MAAQ,KAC1D,QAAU,KAAK,cAAc,IAAG,SAAC,EAAO,CACtC,MAAO,GAAQ,KAAO,GAAgB,EAAQ,KAAM,EAAO,UAAY,EAAO,WAEhF,eAAiB,KAAK,cAAc,IAAG,SAAC,EAAO,CAC9C,MAAQ,GAAQ,eAAiB,EAAO,QAAU,OAEnD,MAAC,EACA,SAAU,EAAS,MAItB,GAAA,UAAC,YAAA,SAAY,EAAS,CACrB,MAAQ,IAAI,IAAU,KAAK,mBAAmB,KAG/C,GAAA,UAAC,gBAAA,UAAkB,CACjB,GAAM,GAAqB,GAE5B,YAAM,QAAQ,QAAO,SAAC,EAAO,CAC5B,GAAO,GAAY,EAAO,QAAQ,UAEjC,AAAI,IAAc,MAEb,GAAmB,IAAY,GAAmB,GAAa,GACpE,EAAmB,IAAc,KAIjC,OAAO,KAAK,GAAoB,KAAI,SAAE,EAAG,EAAG,CAC5C,MAAQ,GAAmB,GAAK,EAAmB,KAChD,IAAM,KAIZ,GAAA,UAAC,OAAA,SAAO,EAAW,YAKjB,GAJK,UAAU,QACd,GAAY,KAAK,mBAGd,IAAc,GAAI,MAAO,MAE9B,GAAK,GAAkB,CAAC,KAAK,OAAS,KAAK,MAAM,MAAM,MAAQ;EAE/D,YAAM,QAAQ,QAAO,SAAE,EAAQ,EAAG,CAChC,GAAM,GAAY,EAAO,YAAc,OAAY,EAAO,UAAY,EAAK,UACrE,EAAc,GAAoB,EAAI,GAAK,SAAS,KAAK,GAE/D,EAAO,QAAQ,OAAO,EAAW,CAChC,QAAS,EAAO,sBACjB,YAAC,IAGF,EAAmB,EAAO,QAAQ,aAAe;IAG7C,KAAK,OACT,MAAM,MACJ,EACA,KAAK,MAAM,QAAQ,WAAU,SAAG,EAAO,EAAO,CAC9C,MAAQ,GAAQ,EAAI,EAAY,EAAQ,KAInC,MAGT,GAAA,UAAC,QAAA,SAAQ,EAAK,CACb,YAAM,MAAQ,EAAM,KAAK,MACjB,MAGT,GAAA,UAAC,SAAA,UAAW,YACJ,EAAO,KAAK,QAChB,IAAG,SAAE,EAAQ,EAAG,CAChB,GAAM,GAAY,EAAO,YAAc,OAAY,EAAO,UAAY,EAAK,UACrE,EAAO,GAAI,EAAI,EAAY,IAAM,EAAO,QAAQ,WAEvD,MAAQ,KAEP,KAAK,IAEP,MAAO,MAAK,MAAQ,GAGtB,GAAA,UAAC,QAAO,UAAI,CAGV,MAFI,OAAK,MAAM,QAAU,KAAK,MAAM,QAEhC,KAAK,QAAQ,KAAI,SAAC,EAAO,CAAA,MAAG,CAAC,EAAO,QAAQ,cAKlD,GAAA,UAAC,OAAA,UAAS,CACR,MAAO,MAAK,QAAQ,OAAM,SAAE,EAAQ,EAAQ,CAAA,MAAG,GAAS,EAAO,QAAQ,UAAU,KAAK,MAAM,SAG9F,GAAA,UAAC,UAAA,UAAY,CACX,MAAO,MAAK,KAAK,aAGnB,GAAA,UAAC,KAAA,SAAK,EAAU,CACd,MAAO,MAAK,UAAU,GAAU,QAAQ,IAG1C,GAAA,UAAC,UAAA,SAAU,EAAU,CACnB,GAAM,GAAK,GAAI,QAAO,IAAO,IAAY,OAAS,KAGlD,GAFA,KAAK,MAAQ,KAAK,MAAM,QAAQ,EAAI,IAEhC,CAAC,KAAK,MAAO,CACjB,GAAK,GACA,EAAI,EAER,EAEA,IADA,EAAU,KAAK,QAAQ,KAClB,CAAC,EACJ,YAEO,CAAC,EAAO,QAAQ,iBAAiB,IAG5C,MAAQ,OAGT,GAAA,UAAC,QAAA,SAAQ,EAAU,CACjB,GAAM,GAAK,GAAI,QAAQ,IAAY,OAAS,MAExC,EACA,EAAI,KAAK,QAAQ,OAAS,EAE9B,EAEA,IADA,EAAU,KAAK,QAAQ,KAClB,CAAC,EAAQ,CACZ,KAAK,MAAQ,KAAK,MAAM,QAAQ,EAAI,IACpC,YAEO,CAAC,EAAO,QAAQ,eAAe,IAEzC,MAAQ,gBCrRF,GAAM,IAAgB,GAAI,SAO1B,YAAmB,EAAM,CAC5B,GAAI,GAAc,IAAI,GAClB,KAAM,IAAI,OAAM,uGAMjB,GAAM,IAAoB,GAAI,SCpBrC,6DAUO,YAAgB,EAAM,CACzB,GAAM,CAAE,WAAY,GAAkB,IAAI,GAC1C,MAAO,GAAQ,YAAY,MAAM,EAAK,MAAO,EAAK,KAAK,WASpD,YAAgB,EAAM,EAAS,EAAG,CACrC,GAAM,CAAE,OAAQ,GAAe,GAAkB,IAAI,GAErD,GAAI,EAAC,EAIL,MAAI,IAAU,EACH,EAGJ,GAAO,EAAY,EAAS,GAShC,YAAgB,EAAM,EAAa,CACtC,GAAU,GACV,GAAM,CAAE,WAAY,GAAkB,IAAI,GAC1C,EAAQ,YAAY,UAAU,EAAK,MAAO,EAAK,IAAK,GCvCjD,YAAmB,EAAO,CAC7B,MAAQ,OAAO,IAAU,UACrB,IAAU,MACV,MAAO,GAAM,MAAS,WAOvB,YAAgB,EAAO,CAC1B,MAAQ,OAAO,IAAU,UACrB,IAAU,MACV,MAAO,GAAM,MAAS,SCNvB,YAA2B,EAAM,CACpC,GAAM,GAAa,GAGnB,OAAW,KAAO,QAAO,KAAK,GAAO,CAGjC,GAAM,GAAW,EAAK,GACtB,GAAI,MAAM,QAAQ,GAEd,OAAW,KAAmB,GAC1B,AAAI,GAAO,IACP,EAAW,KAAK,OAIvB,AAAI,IAAO,IACZ,EAAW,KAAK,GAGxB,MAAO,GAUJ,YAAyC,EAAM,EAAY,EAAS,CAEvE,GAAI,EAAW,SAAW,EACtB,OAEJ,GAAM,CAAC,KAAe,GAAuB,EACvC,EAAgB,GAAW,EAAY,GAG7C,MAAI,IAAU,GACH,EAAc,KAAK,IAAM,GAAgC,EAAM,EAAqB,IAGpF,GAAgC,EAAM,EAAqB,GASnE,YAA6B,EAAM,EAAS,CAC/C,GAAM,GAAa,GAAkB,GACrC,OAAW,KAAa,GACpB,GAAkB,IAAI,EAAW,CAAE,OAAQ,EAAM,YACjD,GAAoB,EAAW,GAUvC,YAA0B,EAAM,EAAY,CACxC,MAAO,IAAI,IAAS,CAEhB,GAAM,GAAS,GAAQ,GACvB,MAAI,IAAO,EAAK,IACR,KAAe,UACf,GAAU,EAAK,IAIZ,EAAO,GAAG,IAGV,EAAO,EAAM,GAAG,IAU5B,YAAoB,EAAM,EAAS,CAEtC,GAAM,GAAa,GAAkB,GAC/B,EAAiB,GAAgC,EAAM,EAAY,GAEnE,EAAc,CAChB,OAAQ,GAAiB,EAAM,UAC/B,OAAQ,GAAiB,EAAM,UAC/B,OAAQ,GAAiB,EAAM,WAGnC,GAAI,GAAU,GACV,MAAO,GACF,KAAK,IACC,EAAQ,YAAY,EAAM,IAEhC,KAAK,GACN,IAAc,IAAI,GACX,IAGV,CACD,GAAM,GAAoB,EAAQ,YAAY,EAAM,GACpD,MAAI,IAAU,GACH,EAAkB,KAAK,GAC1B,IAAc,IAAI,GACX,IAIX,IAAc,IAAI,GACX,IASZ,YAAsB,CAAE,cAAa,WAAW,CACnD,GAAM,GAAO,EAAY,WACzB,MAAO,QAAO,OAAO,CACjB,OACA,IAAK,EAAY,YAAY,EAAQ,WACrC,SAAU,IAAM,IC5IxB,eAAkB,EAAW,CACzB,GAAI,GACJ,GAAI,GACA,EAGE,EAAS,OAAO,EAAU,IAChC,GAAI,MAAO,GAAU,IAAO,WAExB,EAAU,GACV,EAAc,EAAU,WAEnB,MAAO,GAAU,IAAO,UAC7B,MAAO,GAAU,IAAO,WAExB,EAAU,EAAU,GACpB,EAAc,EAAU,OAIxB,MAAM,IAAI,OAAM,yJAEpB,GAAM,GAAe,IACjB,YAAa,UACR,GAAK,EAAQ,SAAW,MAAQ,IAAO,OAAS,EAAK,IAGxD,EAAW,EAAQ,OACnB,EAAQ,OAAO,MAAM,EAAQ,GAC7B,GAAkB,EAAQ,GAI1B,EAAU,CAAE,YAFE,GAAI,IAAY,GAEL,UAAS,eAGxC,GAAkB,IAAI,EAAU,CAAE,OAAQ,OAAW,YACrD,GAAoB,EAAU,GAE9B,GAAM,GAAa,GAAW,EAAU,GAExC,MAAI,IAAU,GACH,EAAW,KAAK,IAAM,GAAa,IAGnC,GAAa,GAG5B,GAAM,OAAiB,GACvB,GAAM,OAAiB,GACvB,GAAM,OAAiB,GCvDvB,OAAO,SAED,GAAU,GAAI,aAAY,SAE1B,YAAiB,EAAiB,CACtC,MAAO,IAAQ,OAAO,GAGxB,GAAM,IAAU,GAAI,aAEd,YAAiB,EAAW,CAChC,MAAO,IAAQ,OAAO,GCVxB,GAAM,IAAoB,KAAO,EAW3B,QAAe,CAyCnB,YACE,EAAkB,GAClB,EAA2B,GAAE,CAE7B,GAAI,GAAc,GAClB,AAAI,MAAO,IAAS,SAClB,EAAO,GAAI,aAAY,GAEvB,GAAc,GACd,KAAK,gBAAkB,EAAK,YAG9B,GAAM,GAAS,EAAQ,OAAS,EAAQ,SAAW,EAAI,EACjD,EAAa,EAAK,WAAa,EACjC,EAAW,EACf,AAAI,aAAY,OAAO,IAAS,YAAgB,MAC1C,GAAK,aAAe,EAAK,OAAO,YAClC,GAAW,EAAK,WAAa,GAE/B,EAAO,EAAK,QAEd,AAAI,EACF,KAAK,gBAAkB,EAEvB,KAAK,gBAAkB,EAEzB,KAAK,OAAS,EACd,KAAK,OAAS,EACd,KAAK,WAAa,EAClB,KAAK,WAAa,EAClB,KAAK,OAAS,EACd,KAAK,aAAe,GACpB,KAAK,MAAQ,GAAI,UAAS,KAAK,OAAQ,EAAU,GACjD,KAAK,MAAQ,EACb,KAAK,OAAS,GAST,UAAU,EAAa,EAAC,CAC7B,MAAO,MAAK,OAAS,GAAc,KAAK,OAQnC,gBAAc,CACnB,MAAO,MAAK,aAMP,iBAAe,CACpB,YAAK,aAAe,GACb,KAOF,aAAW,CAChB,MAAO,CAAC,KAAK,aAMR,cAAY,CACjB,YAAK,aAAe,GACb,KAOF,KAAK,EAAI,EAAC,CACf,YAAK,QAAU,EACR,KAOF,KAAK,EAAc,CACxB,YAAK,OAAS,EACP,KAOF,MAAI,CACT,YAAK,MAAQ,KAAK,OACX,KAOF,OAAK,CACV,YAAK,OAAS,KAAK,MACZ,KAOF,UAAQ,CACb,YAAK,OAAO,KAAK,KAAK,QACf,KAQF,SAAO,CACZ,GAAM,GAAS,KAAK,OAAO,MAC3B,GAAI,IAAW,OACb,KAAM,IAAI,OAAM,oBAElB,YAAK,KAAK,GACH,KAMF,QAAM,CACX,YAAK,OAAS,EACP,KAUF,gBAAgB,EAAa,EAAC,CACnC,GAAI,CAAC,KAAK,UAAU,GAAa,CAE/B,GAAM,GAAY,AADG,MAAK,OAAS,GACF,EAC3B,EAAW,GAAI,YAAW,GAChC,EAAS,IAAI,GAAI,YAAW,KAAK,SACjC,KAAK,OAAS,EAAS,OACvB,KAAK,OAAS,KAAK,WAAa,EAChC,KAAK,MAAQ,GAAI,UAAS,KAAK,QAEjC,MAAO,MAOF,aAAW,CAChB,MAAO,MAAK,cAAgB,EAMvB,UAAQ,CACb,MAAO,MAAK,MAAM,QAAQ,KAAK,UAM1B,WAAS,CACd,MAAO,MAAK,MAAM,SAAS,KAAK,UAM3B,UAAQ,CACb,MAAO,MAAK,YAMP,UAAU,EAAI,EAAC,CACpB,GAAM,GAAQ,GAAI,YAAW,GAC7B,OAAS,GAAI,EAAG,EAAI,EAAG,IACrB,EAAM,GAAK,KAAK,WAElB,MAAO,GAMF,WAAS,CACd,GAAM,GAAQ,KAAK,MAAM,SAAS,KAAK,OAAQ,KAAK,cACpD,YAAK,QAAU,EACR,EAMF,YAAU,CACf,GAAM,GAAQ,KAAK,MAAM,UAAU,KAAK,OAAQ,KAAK,cACrD,YAAK,QAAU,EACR,EAMF,WAAS,CACd,GAAM,GAAQ,KAAK,MAAM,SAAS,KAAK,OAAQ,KAAK,cACpD,YAAK,QAAU,EACR,EAMF,YAAU,CACf,GAAM,GAAQ,KAAK,MAAM,UAAU,KAAK,OAAQ,KAAK,cACrD,YAAK,QAAU,EACR,EAMF,aAAW,CAChB,GAAM,GAAQ,KAAK,MAAM,WAAW,KAAK,OAAQ,KAAK,cACtD,YAAK,QAAU,EACR,EAMF,aAAW,CAChB,GAAM,GAAQ,KAAK,MAAM,WAAW,KAAK,OAAQ,KAAK,cACtD,YAAK,QAAU,EACR,EAMF,cAAY,CACjB,GAAM,GAAQ,KAAK,MAAM,YAAY,KAAK,OAAQ,KAAK,cACvD,YAAK,QAAU,EACR,EAMF,eAAa,CAClB,GAAM,GAAQ,KAAK,MAAM,aAAa,KAAK,OAAQ,KAAK,cACxD,YAAK,QAAU,EACR,EAMF,UAAQ,CACb,MAAO,QAAO,aAAa,KAAK,YAM3B,UAAU,EAAI,EAAC,CACpB,GAAI,GAAS,GACb,OAAS,GAAI,EAAG,EAAI,EAAG,IACrB,GAAU,KAAK,WAEjB,MAAO,GAOF,SAAS,EAAI,EAAC,CACnB,MAAO,IAAO,KAAK,UAAU,IAOxB,aAAa,EAAc,CAChC,YAAK,WAAW,EAAQ,IAAO,GACxB,KAMF,UAAU,EAAa,CAC5B,YAAK,gBAAgB,GACrB,KAAK,MAAM,QAAQ,KAAK,SAAU,GAClC,KAAK,yBACE,KAOF,WAAW,EAAa,CAC7B,YAAK,gBAAgB,GACrB,KAAK,MAAM,SAAS,KAAK,SAAU,GACnC,KAAK,yBACE,KAMF,UAAU,EAAa,CAC5B,MAAO,MAAK,WAAW,GAOlB,WAAW,EAAwB,CACxC,KAAK,gBAAgB,EAAM,QAC3B,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,KAAK,MAAM,SAAS,KAAK,SAAU,EAAM,IAE3C,YAAK,yBACE,KAOF,WAAW,EAAa,CAC7B,YAAK,gBAAgB,GACrB,KAAK,MAAM,SAAS,KAAK,OAAQ,EAAO,KAAK,cAC7C,KAAK,QAAU,EACf,KAAK,yBACE,KAOF,YAAY,EAAa,CAC9B,YAAK,gBAAgB,GACrB,KAAK,MAAM,UAAU,KAAK,OAAQ,EAAO,KAAK,cAC9C,KAAK,QAAU,EACf,KAAK,yBACE,KAOF,WAAW,EAAa,CAC7B,YAAK,gBAAgB,GACrB,KAAK,MAAM,SAAS,KAAK,OAAQ,EAAO,KAAK,cAC7C,KAAK,QAAU,EACf,KAAK,yBACE,KAOF,YAAY,EAAa,CAC9B,YAAK,gBAAgB,GACrB,KAAK,MAAM,UAAU,KAAK,OAAQ,EAAO,KAAK,cAC9C,KAAK,QAAU,EACf,KAAK,yBACE,KAOF,aAAa,EAAa,CAC/B,YAAK,gBAAgB,GACrB,KAAK,MAAM,WAAW,KAAK,OAAQ,EAAO,KAAK,cAC/C,KAAK,QAAU,EACf,KAAK,yBACE,KAOF,aAAa,EAAa,CAC/B,YAAK,gBAAgB,GACrB,KAAK,MAAM,WAAW,KAAK,OAAQ,EAAO,KAAK,cAC/C,KAAK,QAAU,EACf,KAAK,yBACE,KAOF,cAAc,EAAa,CAChC,YAAK,gBAAgB,GACrB,KAAK,MAAM,YAAY,KAAK,OAAQ,EAAO,KAAK,cAChD,KAAK,QAAU,EACf,KAAK,yBACE,KAOF,eAAe,EAAa,CACjC,YAAK,gBAAgB,GACrB,KAAK,MAAM,aAAa,KAAK,OAAQ,EAAO,KAAK,cACjD,KAAK,QAAU,EACf,KAAK,yBACE,KAOF,UAAU,EAAW,CAC1B,MAAO,MAAK,WAAW,EAAI,WAAW,IAOjC,WAAW,EAAW,CAC3B,OAAS,GAAI,EAAG,EAAI,EAAI,OAAQ,IAC9B,KAAK,WAAW,EAAI,WAAW,IAEjC,MAAO,MAOF,UAAU,EAAW,CAC1B,MAAO,MAAK,WAAW,GAAO,IAQzB,SAAO,CACZ,MAAO,IAAI,YAAW,KAAK,OAAQ,KAAK,WAAY,KAAK,iBAOnD,wBAAsB,CAC5B,AAAI,KAAK,OAAS,KAAK,iBACrB,MAAK,gBAAkB,KAAK,UCliBlC,AA6BA,GAAM,IAA0B,EAI1B,GAAwB,EACxB,GAAwB,EAExB,GAA0B,EAKhC,YAAgB,EAAK,CAAE,GAAI,GAAM,EAAI,OAAQ,KAAO,EAAE,GAAO,GAAK,EAAI,GAAO,EAI7E,GAAM,IAAe,EACf,GAAe,EACf,GAAe,EAGf,GAAiB,EACjB,GAAiB,IAQjB,GAAkB,GAGlB,GAAkB,IAGlB,GAAkB,GAAa,EAAI,GAGnC,GAAkB,GAGlB,GAAkB,GAGlB,GAAkB,EAAI,GAAY,EAGlC,GAAkB,GAGlB,GAAgB,GAQhB,GAAc,EAGd,GAAc,IAGd,GAAc,GAGd,GAAc,GAGd,GAAc,GAId,GACJ,GAAI,YAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAEpE,GACJ,GAAI,YAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,KAE7E,GACJ,GAAI,YAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAEhD,GACJ,GAAI,YAAW,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAaxD,GAAgB,IAGhB,GAAgB,GAAI,OAAO,IAAY,GAAK,GAClD,GAAO,IAOP,GAAM,IAAgB,GAAI,OAAM,GAAY,GAC5C,GAAO,IAKP,GAAM,IAAgB,GAAI,OAAM,IAChC,GAAO,IAMP,GAAM,IAAgB,GAAI,OAAM,GAAc,GAAc,GAC5D,GAAO,IAGP,GAAM,IAAgB,GAAI,OAAM,IAChC,GAAO,IAGP,GAAM,IAAgB,GAAI,OAAM,IAChC,GAAO,IAIP,YAAwB,EAAa,EAAY,EAAY,EAAO,EAAY,CAE9E,KAAK,YAAe,EACpB,KAAK,WAAe,EACpB,KAAK,WAAe,EACpB,KAAK,MAAe,EACpB,KAAK,WAAe,EAGpB,KAAK,UAAe,GAAe,EAAY,OAIjD,GAAI,IACA,GACA,GAGJ,YAAkB,EAAU,EAAW,CACrC,KAAK,SAAW,EAChB,KAAK,SAAW,EAChB,KAAK,UAAY,EAKnB,GAAM,IAAS,AAAC,GAEP,EAAO,IAAM,GAAW,GAAQ,GAAW,IAAO,KAAS,IAQ9D,GAAY,CAAC,EAAG,IAAM,CAG1B,EAAE,YAAY,EAAE,WAAc,EAAK,IACnC,EAAE,YAAY,EAAE,WAAc,IAAM,EAAK,KAQrC,GAAY,CAAC,EAAG,EAAO,IAAW,CAEtC,AAAI,EAAE,SAAY,GAAW,EAC3B,GAAE,QAAW,GAAS,EAAE,SAAY,MACpC,GAAU,EAAG,EAAE,QACf,EAAE,OAAS,GAAU,GAAW,EAAE,SAClC,EAAE,UAAY,EAAS,IAEvB,GAAE,QAAW,GAAS,EAAE,SAAY,MACpC,EAAE,UAAY,IAKZ,GAAY,CAAC,EAAG,EAAG,IAAS,CAEhC,GAAU,EAAG,EAAK,EAAI,GAAa,EAAK,EAAI,EAAI,KAS5C,GAAa,CAAC,EAAM,IAAQ,CAEhC,GAAI,GAAM,EACV,EACE,IAAO,EAAO,EACd,KAAU,EACV,IAAQ,QACD,EAAE,EAAM,GACjB,MAAO,KAAQ,GAOX,GAAW,AAAC,GAAM,CAEtB,AAAI,EAAE,WAAa,GACjB,IAAU,EAAG,EAAE,QACf,EAAE,OAAS,EACX,EAAE,SAAW,GAEJ,EAAE,UAAY,GACvB,GAAE,YAAY,EAAE,WAAa,EAAE,OAAS,IACxC,EAAE,SAAW,EACb,EAAE,UAAY,IAeZ,GAAa,CAAC,EAAG,IAGvB,CACE,GAAM,GAAkB,EAAK,SACvB,EAAkB,EAAK,SACvB,EAAkB,EAAK,UAAU,YACjC,EAAkB,EAAK,UAAU,UACjC,EAAkB,EAAK,UAAU,WACjC,EAAkB,EAAK,UAAU,WACjC,EAAkB,EAAK,UAAU,WACnC,EACA,EAAG,EACH,EACA,EACA,EACA,EAAW,EAEf,IAAK,EAAO,EAAG,GAAQ,GAAY,IACjC,EAAE,SAAS,GAAQ,EAQrB,IAFA,EAAK,EAAE,KAAK,EAAE,UAAY,EAAI,GAAa,EAEtC,EAAI,EAAE,SAAW,EAAG,EAAI,GAAa,IAUxC,AATA,EAAI,EAAE,KAAK,GACX,EAAO,EAAK,EAAK,EAAI,EAAI,GAAa,EAAI,GAAa,EACnD,EAAO,GACT,GAAO,EACP,KAEF,EAAK,EAAI,EAAI,GAAa,EAGtB,IAAI,IAER,GAAE,SAAS,KACX,EAAQ,EACJ,GAAK,GACP,GAAQ,EAAM,EAAI,IAEpB,EAAI,EAAK,EAAI,GACb,EAAE,SAAW,EAAK,GAAO,GACrB,GACF,GAAE,YAAc,EAAK,GAAM,EAAI,EAAI,GAAa,KAGpD,GAAI,IAAa,EAMjB,GAAG,CAED,IADA,EAAO,EAAa,EACb,EAAE,SAAS,KAAU,GAAK,IACjC,EAAE,SAAS,KACX,EAAE,SAAS,EAAO,IAAM,EACxB,EAAE,SAAS,KAIX,GAAY,QACL,EAAW,GAOpB,IAAK,EAAO,EAAY,IAAS,EAAG,IAElC,IADA,EAAI,EAAE,SAAS,GACR,IAAM,GAEX,AADA,EAAI,EAAE,KAAK,EAAE,GACT,IAAI,IACJ,GAAK,EAAI,EAAI,KAAe,GAE9B,GAAE,SAAY,GAAO,EAAK,EAAI,EAAI,IAAc,EAAK,EAAI,GACzD,EAAK,EAAI,EAAI,GAAa,GAE5B,OAcA,GAAY,CAAC,EAAM,EAAU,IAInC,CACE,GAAM,GAAY,GAAI,OAAM,GAAa,GACrC,EAAO,EACP,EACA,EAKJ,IAAK,EAAO,EAAG,GAAQ,GAAY,IACjC,EAAU,GAAQ,EAAQ,EAAO,EAAS,EAAO,IAAO,EAS1D,IAAK,EAAI,EAAI,GAAK,EAAU,IAAK,CAC/B,GAAI,GAAM,EAAK,EAAI,EAAI,GACvB,AAAI,IAAQ,GAEZ,GAAK,EAAI,GAAc,GAAW,EAAU,KAAQ,MAWlD,GAAiB,IAAM,CAE3B,GAAI,GACA,EACA,EACA,EACA,EACE,EAAW,GAAI,OAAM,GAAa,GAiBxC,IADA,EAAS,EACJ,EAAO,EAAG,EAAO,GAAiB,EAAG,IAExC,IADA,GAAY,GAAQ,EACf,EAAI,EAAG,EAAK,GAAK,GAAY,GAAQ,IACxC,GAAa,KAAY,EAY7B,IAJA,GAAa,EAAS,GAAK,EAG3B,EAAO,EACF,EAAO,EAAG,EAAO,GAAI,IAExB,IADA,GAAU,GAAQ,EACb,EAAI,EAAG,EAAK,GAAK,GAAY,GAAQ,IACxC,GAAW,KAAU,EAKzB,IADA,IAAS,EACF,EAAO,GAAW,IAEvB,IADA,GAAU,GAAQ,GAAQ,EACrB,EAAI,EAAG,EAAK,GAAM,GAAY,GAAQ,EAAK,IAC9C,GAAW,IAAM,KAAU,EAM/B,IAAK,EAAO,EAAG,GAAQ,GAAY,IACjC,EAAS,GAAQ,EAInB,IADA,EAAI,EACG,GAAK,KACV,GAAa,EAAI,EAAI,GAAa,EAClC,IACA,EAAS,KAEX,KAAO,GAAK,KACV,GAAa,EAAI,EAAI,GAAa,EAClC,IACA,EAAS,KAEX,KAAO,GAAK,KACV,GAAa,EAAI,EAAI,GAAa,EAClC,IACA,EAAS,KAEX,KAAO,GAAK,KACV,GAAa,EAAI,EAAI,GAAa,EAClC,IACA,EAAS,KASX,IAHA,GAAU,GAAc,GAAY,EAAG,GAGlC,EAAI,EAAG,EAAI,GAAW,IACzB,GAAa,EAAI,EAAI,GAAa,EAClC,GAAa,EAAI,GAAc,GAAW,EAAG,GAI/C,GAAgB,GAAI,IAAe,GAAc,GAAa,GAAa,EAAG,GAAW,IACzF,GAAgB,GAAI,IAAe,GAAc,GAAa,EAAY,GAAW,IACrF,GAAiB,GAAI,IAAe,GAAI,OAAM,GAAI,GAAc,EAAW,GAAY,KASnF,GAAa,AAAC,GAAM,CAExB,GAAI,GAGJ,IAAK,EAAI,EAAG,EAAI,GAAY,IAAO,EAAE,UAAU,EAAI,GAAc,EACjE,IAAK,EAAI,EAAG,EAAI,GAAY,IAAO,EAAE,UAAU,EAAI,GAAc,EACjE,IAAK,EAAI,EAAG,EAAI,GAAY,IAAO,EAAE,QAAQ,EAAI,GAAc,EAE/D,EAAE,UAAU,GAAY,GAAc,EACtC,EAAE,QAAU,EAAE,WAAa,EAC3B,EAAE,SAAW,EAAE,QAAU,GAOrB,GAAY,AAAC,GACnB,CACE,AAAI,EAAE,SAAW,EACf,GAAU,EAAG,EAAE,QACN,EAAE,SAAW,GAEtB,GAAE,YAAY,EAAE,WAAa,EAAE,QAEjC,EAAE,OAAS,EACX,EAAE,SAAW,GAOT,GAAa,CAAC,EAAG,EAAK,EAAK,IAKjC,CACE,GAAU,GAEN,GACF,IAAU,EAAG,GACb,GAAU,EAAG,CAAC,IAKhB,EAAE,YAAY,IAAI,EAAE,OAAO,SAAS,EAAK,EAAM,GAAM,EAAE,SACvD,EAAE,SAAW,GAOT,GAAU,CAAC,EAAM,EAAG,EAAG,IAAU,CAErC,GAAM,GAAM,EAAI,EACV,EAAM,EAAI,EAChB,MAAQ,GAAK,GAAgB,EAAK,IAC1B,EAAK,KAAkB,EAAK,IAAiB,EAAM,IAAM,EAAM,IASnE,GAAa,CAAC,EAAG,EAAM,IAI7B,CACE,GAAM,GAAI,EAAE,KAAK,GACb,EAAI,GAAK,EACb,KAAO,GAAK,EAAE,UAER,GAAI,EAAE,UACR,GAAQ,EAAM,EAAE,KAAK,EAAI,GAAI,EAAE,KAAK,GAAI,EAAE,QAC1C,IAGE,IAAQ,EAAM,EAAG,EAAE,KAAK,GAAI,EAAE,SAGlC,EAAE,KAAK,GAAK,EAAE,KAAK,GACnB,EAAI,EAGJ,IAAM,EAER,EAAE,KAAK,GAAK,GAUR,GAAiB,CAAC,EAAG,EAAO,IAIlC,CACE,GAAI,GACA,EACA,EAAK,EACL,EACA,EAEJ,GAAI,EAAE,WAAa,EACjB,EACE,GAAQ,EAAE,YAAY,EAAE,MAAQ,EAAK,IAAM,EAAM,EAAE,YAAY,EAAE,MAAQ,EAAK,EAAI,GAClF,EAAK,EAAE,YAAY,EAAE,MAAQ,GAC7B,IAEA,AAAI,IAAS,EACX,GAAU,EAAG,EAAI,GAIjB,GAAO,GAAa,GACpB,GAAU,EAAG,EAAO,GAAa,EAAG,GACpC,EAAQ,GAAY,GAChB,IAAU,GACZ,IAAM,GAAY,GAClB,GAAU,EAAG,EAAI,IAEnB,IACA,EAAO,GAAO,GAGd,GAAU,EAAG,EAAM,GACnB,EAAQ,GAAY,GAChB,IAAU,GACZ,IAAQ,GAAU,GAClB,GAAU,EAAG,EAAM,WAQhB,EAAK,EAAE,UAGlB,GAAU,EAAG,GAAW,IAYpB,GAAa,CAAC,EAAG,IAGvB,CACE,GAAM,GAAW,EAAK,SAChB,EAAW,EAAK,UAAU,YAC1B,EAAY,EAAK,UAAU,UAC3B,EAAW,EAAK,UAAU,MAC5B,EAAG,EACH,EAAW,GACX,EASJ,IAHA,EAAE,SAAW,EACb,EAAE,SAAW,GAER,EAAI,EAAG,EAAI,EAAO,IACrB,AAAI,EAAK,EAAI,KAAgB,EAC3B,GAAE,KAAK,EAAE,EAAE,UAAY,EAAW,EAClC,EAAE,MAAM,GAAK,GAGb,EAAK,EAAI,EAAI,GAAa,EAS9B,KAAO,EAAE,SAAW,GAClB,EAAO,EAAE,KAAK,EAAE,EAAE,UAAa,EAAW,EAAI,EAAE,EAAW,EAC3D,EAAK,EAAO,GAAc,EAC1B,EAAE,MAAM,GAAQ,EAChB,EAAE,UAEE,GACF,GAAE,YAAc,EAAM,EAAO,EAAI,IASrC,IALA,EAAK,SAAW,EAKX,EAAK,EAAE,UAAY,EAAc,GAAK,EAAG,IAAO,GAAW,EAAG,EAAM,GAKzE,EAAO,EACP,EAGE,GAAI,EAAE,KAAK,GACX,EAAE,KAAK,GAAiB,EAAE,KAAK,EAAE,YACjC,GAAW,EAAG,EAAM,GAGpB,EAAI,EAAE,KAAK,GAEX,EAAE,KAAK,EAAE,EAAE,UAAY,EACvB,EAAE,KAAK,EAAE,EAAE,UAAY,EAGvB,EAAK,EAAO,GAAc,EAAK,EAAI,GAAc,EAAK,EAAI,GAC1D,EAAE,MAAM,GAAS,GAAE,MAAM,IAAM,EAAE,MAAM,GAAK,EAAE,MAAM,GAAK,EAAE,MAAM,IAAM,EACvE,EAAK,EAAI,EAAI,GAAa,EAAK,EAAI,EAAI,GAAa,EAGpD,EAAE,KAAK,GAAiB,IACxB,GAAW,EAAG,EAAM,SAEb,EAAE,UAAY,GAEvB,EAAE,KAAK,EAAE,EAAE,UAAY,EAAE,KAAK,GAK9B,GAAW,EAAG,GAGd,GAAU,EAAM,EAAU,EAAE,WAQxB,GAAY,CAAC,EAAG,EAAM,IAI5B,CACE,GAAI,GACA,EAAU,GACV,EAEA,EAAU,EAAK,EAAI,EAAI,GAEvB,EAAQ,EACR,EAAY,EACZ,EAAY,EAQhB,IANI,IAAY,GACd,GAAY,IACZ,EAAY,GAEd,EAAM,GAAW,GAAK,EAAI,GAAa,MAElC,EAAI,EAAG,GAAK,EAAU,IAIzB,AAHA,EAAS,EACT,EAAU,EAAM,GAAI,GAAK,EAAI,GAEzB,IAAE,EAAQ,GAAa,IAAW,IAG/B,CAAI,EAAQ,EACjB,EAAE,QAAQ,EAAS,IAAe,EAE7B,AAAI,IAAW,EAEhB,KAAW,GAAW,EAAE,QAAQ,EAAS,KAC7C,EAAE,QAAQ,GAAU,MAEf,AAAI,GAAS,GAClB,EAAE,QAAQ,GAAY,KAGtB,EAAE,QAAQ,GAAc,KAG1B,EAAQ,EACR,EAAU,EAEV,AAAI,IAAY,EACd,GAAY,IACZ,EAAY,GAEP,AAAI,IAAW,EACpB,GAAY,EACZ,EAAY,GAGZ,GAAY,EACZ,EAAY,KAUZ,GAAY,CAAC,EAAG,EAAM,IAI5B,CACE,GAAI,GACA,EAAU,GACV,EAEA,EAAU,EAAK,EAAI,EAAI,GAEvB,EAAQ,EACR,EAAY,EACZ,EAAY,EAQhB,IALI,IAAY,GACd,GAAY,IACZ,EAAY,GAGT,EAAI,EAAG,GAAK,EAAU,IAIzB,GAHA,EAAS,EACT,EAAU,EAAM,GAAI,GAAK,EAAI,GAEzB,IAAE,EAAQ,GAAa,IAAW,GAG/B,IAAI,EAAQ,EACjB,EAAK,IAAU,EAAG,EAAQ,EAAE,eAAmB,EAAE,GAAU,OAEtD,AAAI,KAAW,EAChB,KAAW,GACb,IAAU,EAAG,EAAQ,EAAE,SACvB,KAGF,GAAU,EAAG,GAAS,EAAE,SACxB,GAAU,EAAG,EAAQ,EAAG,IAEnB,AAAI,GAAS,GAClB,IAAU,EAAG,GAAW,EAAE,SAC1B,GAAU,EAAG,EAAQ,EAAG,IAGxB,IAAU,EAAG,GAAa,EAAE,SAC5B,GAAU,EAAG,EAAQ,GAAI,IAG3B,EAAQ,EACR,EAAU,EACV,AAAI,IAAY,EACd,GAAY,IACZ,EAAY,GAEP,AAAI,IAAW,EACpB,GAAY,EACZ,EAAY,GAGZ,GAAY,EACZ,EAAY,KAUZ,GAAgB,AAAC,GAAM,CAE3B,GAAI,GAgBJ,IAbA,GAAU,EAAG,EAAE,UAAW,EAAE,OAAO,UACnC,GAAU,EAAG,EAAE,UAAW,EAAE,OAAO,UAGnC,GAAW,EAAG,EAAE,SASX,EAAc,GAAa,EAAG,GAAe,GAC5C,EAAE,QAAQ,GAAS,GAAe,EAAI,KAAe,EADN,IACnD,CAKF,SAAE,SAAW,EAAK,GAAc,GAAK,EAAI,EAAI,EAItC,GASH,GAAiB,CAAC,EAAG,EAAQ,EAAQ,IAG3C,CACE,GAAI,GASJ,IAHA,GAAU,EAAG,EAAS,IAAK,GAC3B,GAAU,EAAG,EAAS,EAAK,GAC3B,GAAU,EAAG,EAAU,EAAI,GACtB,EAAO,EAAG,EAAO,EAAS,IAE7B,GAAU,EAAG,EAAE,QAAQ,GAAS,GAAQ,EAAI,GAAY,GAI1D,GAAU,EAAG,EAAE,UAAW,EAAS,GAGnC,GAAU,EAAG,EAAE,UAAW,EAAS,IAkB/B,GAAmB,AAAC,GAAM,CAK9B,GAAI,GAAa,WACb,EAGJ,IAAK,EAAI,EAAG,GAAK,GAAI,IAAK,KAAgB,EACxC,GAAK,EAAa,GAAO,EAAE,UAAU,EAAI,KAAgB,EACvD,MAAO,IAKX,GAAI,EAAE,UAAU,EAAI,KAAgB,GAAK,EAAE,UAAU,GAAK,KAAgB,GACtE,EAAE,UAAU,GAAK,KAAgB,EACnC,MAAO,IAET,IAAK,EAAI,GAAI,EAAI,GAAY,IAC3B,GAAI,EAAE,UAAU,EAAI,KAAgB,EAClC,MAAO,IAOX,MAAO,KAIL,GAAmB,GAKjB,GAAa,AAAC,GACpB,CAEE,AAAK,IACH,MACA,GAAmB,IAGrB,EAAE,OAAU,GAAI,IAAS,EAAE,UAAW,IACtC,EAAE,OAAU,GAAI,IAAS,EAAE,UAAW,IACtC,EAAE,QAAU,GAAI,IAAS,EAAE,QAAS,IAEpC,EAAE,OAAS,EACX,EAAE,SAAW,EAGb,GAAW,IAOP,GAAqB,CAAC,EAAG,EAAK,EAAY,IAKhD,CACE,GAAU,EAAI,KAAgB,GAAM,GAAO,EAAI,GAAI,GACnD,GAAW,EAAG,EAAK,EAAY,KAQ3B,GAAc,AAAC,GAAM,CACzB,GAAU,EAAG,IAAgB,EAAG,GAChC,GAAU,EAAG,GAAW,IACxB,GAAS,IAQL,GAAoB,CAAC,EAAG,EAAK,EAAY,IAK/C,CACE,GAAI,GAAU,EACV,EAAc,EAGlB,AAAI,EAAE,MAAQ,EAGR,GAAE,KAAK,YAAc,IACvB,GAAE,KAAK,UAAY,GAAiB,IAItC,GAAW,EAAG,EAAE,QAIhB,GAAW,EAAG,EAAE,QAUhB,EAAc,GAAc,GAG5B,EAAY,EAAE,QAAU,EAAI,IAAO,EACnC,EAAe,EAAE,WAAa,EAAI,IAAO,EAMrC,GAAe,GAAY,GAAW,IAI1C,EAAW,EAAc,EAAa,EAGxC,AAAK,EAAa,GAAK,GAAc,IAAQ,GAS3C,GAAmB,EAAG,EAAK,EAAY,GAElC,AAAI,EAAE,WAAa,IAAa,IAAgB,EAErD,IAAU,EAAI,KAAgB,GAAM,GAAO,EAAI,GAAI,GACnD,GAAe,EAAG,GAAc,KAGhC,IAAU,EAAI,KAAa,GAAM,GAAO,EAAI,GAAI,GAChD,GAAe,EAAG,EAAE,OAAO,SAAW,EAAG,EAAE,OAAO,SAAW,EAAG,EAAc,GAC9E,GAAe,EAAG,EAAE,UAAW,EAAE,YAMnC,GAAW,GAEP,GACF,GAAU,IAUR,GAAc,CAAC,EAAG,EAAM,IAO5B,GAAE,YAAY,EAAE,MAAQ,EAAE,SAAW,GAAU,IAAS,EAAK,IAC7D,EAAE,YAAY,EAAE,MAAQ,EAAE,SAAW,EAAI,GAAK,EAAO,IAErD,EAAE,YAAY,EAAE,MAAQ,EAAE,UAAY,EAAK,IAC3C,EAAE,WAEF,AAAI,IAAS,EAEX,EAAE,UAAU,EAAK,KAEjB,GAAE,UAEF,IAKA,EAAE,UAAW,IAAa,GAAM,GAAa,GAAK,KAClD,EAAE,UAAU,GAAO,GAAQ,MA0BrB,EAAE,WAAa,EAAE,YAAc,GAOrC,GAAc,GACd,GAAqB,GACrB,GAAqB,GACrB,GAAc,GACd,GAAc,GAEd,GAAQ,CACX,SAAU,GACV,iBAAkB,GAClB,gBAAiB,GACjB,UAAW,GACX,UAAW,IA0BN,GAAU,CAAC,EAAO,EAAK,EAAK,IAAQ,CACxC,GAAI,GAAM,EAAQ,MAAS,EACvB,EAAO,IAAU,GAAM,MAAS,EAChC,EAAI,EAER,KAAO,IAAQ,GAAG,CAIhB,EAAI,EAAM,IAAO,IAAO,EACxB,GAAO,EAEP,EACE,GAAM,EAAK,EAAI,KAAS,EACxB,EAAM,EAAK,EAAK,QACT,EAAE,GAEX,GAAM,MACN,GAAM,MAGR,MAAQ,GAAM,GAAM,GAAM,GAIxB,GAAY,GA0BV,GAAY,IAAM,CACtB,GAAI,GAAG,EAAQ,GAEf,OAAS,GAAI,EAAG,EAAI,IAAK,IAAK,CAC5B,EAAI,EACJ,OAAS,GAAI,EAAG,EAAI,EAAG,IACrB,EAAM,EAAI,EAAM,WAAc,IAAM,EAAO,IAAM,EAEnD,EAAM,GAAK,EAGb,MAAO,IAIH,GAAW,GAAI,aAAY,MAG3B,GAAQ,CAAC,EAAK,EAAK,EAAK,IAAQ,CACpC,GAAM,GAAI,GACJ,EAAM,EAAM,EAElB,GAAO,GAEP,OAAS,GAAI,EAAK,EAAI,EAAK,IACzB,EAAO,IAAQ,EAAK,EAAG,GAAM,EAAI,IAAM,KAGzC,MAAQ,GAAO,IAIb,GAAU,GAqBV,GAAW,CACb,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,wBAsBN,GAAc,CAGhB,WAAoB,EACpB,gBAAoB,EACpB,aAAoB,EACpB,aAAoB,EACpB,SAAoB,EACpB,QAAoB,EACpB,QAAoB,EAKpB,KAAoB,EACpB,aAAoB,EACpB,YAAoB,EACpB,QAAmB,GACnB,eAAmB,GACnB,aAAmB,GACnB,YAAmB,GACnB,YAAmB,GAInB,iBAA0B,EAC1B,aAA0B,EAC1B,mBAA0B,EAC1B,sBAAyB,GAGzB,WAA0B,EAC1B,eAA0B,EAC1B,MAA0B,EAC1B,QAA0B,EAC1B,mBAA0B,EAG1B,SAA0B,EAC1B,OAA0B,EAE1B,UAA0B,EAG1B,WAA0B,GAuBtB,CAAE,YAAU,oBAAkB,mBAAiB,aAAW,cAAc,GAQxE,CACJ,WAAY,GAAc,mBAAiB,aAAc,GAAgB,SAAU,GAAY,QAAS,GACxG,KAAM,GAAQ,aAAc,GAAgB,eAAgB,GAAkB,aAAc,GAAgB,YAAa,GACzH,sBAAuB,GACvB,cAAY,kBAAgB,SAAO,WAAS,mBAAoB,GAChE,aACA,WAAY,IACV,GAKE,GAAgB,EAEhB,GAAc,GAEd,GAAgB,EAGhB,GAAgB,GAEhB,GAAgB,IAEhB,GAAgB,GAAW,EAAI,GAE/B,GAAgB,GAEhB,GAAgB,GAEhB,GAAgB,EAAI,GAAU,EAE9B,GAAY,GAGZ,GAAY,EACZ,GAAY,IACZ,GAAiB,GAAY,GAAY,EAEzC,GAAc,GAEd,GAAa,GACb,GAAc,GACd,GAAa,GACb,GAAgB,GAChB,GAAa,IACb,GAAa,IACb,GAAe,IAEf,GAAoB,EACpB,GAAoB,EACpB,GAAoB,EACpB,GAAoB,EAEpB,GAAU,EAEV,GAAM,CAAC,EAAM,IACjB,GAAK,IAAM,GAAS,GACb,GAGH,GAAO,AAAC,GACH,IAAM,GAAO,GAAK,EAAI,EAAI,GAG/B,GAAO,AAAC,GAAQ,CACpB,GAAI,GAAM,EAAI,OAAQ,KAAO,EAAE,GAAO,GAAK,EAAI,GAAO,GAKpD,GAAY,CAAC,EAAG,EAAM,IAAW,IAAQ,EAAE,WAAc,GAAQ,EAAE,UAInE,GAAO,GAQL,GAAgB,AAAC,GAAS,CAC9B,GAAM,GAAI,EAAK,MAGX,EAAM,EAAE,QAIZ,AAHI,EAAM,EAAK,WACb,GAAM,EAAK,WAET,IAAQ,GAEZ,GAAK,OAAO,IAAI,EAAE,YAAY,SAAS,EAAE,YAAa,EAAE,YAAc,GAAM,EAAK,UACjF,EAAK,UAAY,EACjB,EAAE,aAAe,EACjB,EAAK,WAAa,EAClB,EAAK,WAAa,EAClB,EAAE,SAAW,EACT,EAAE,UAAY,GAChB,GAAE,YAAc,KAKd,GAAmB,CAAC,EAAG,IAAS,CACpC,GAAgB,EAAI,EAAE,aAAe,EAAI,EAAE,YAAc,GAAK,EAAE,SAAW,EAAE,YAAa,GAC1F,EAAE,YAAc,EAAE,SAClB,GAAc,EAAE,OAIZ,GAAW,CAAC,EAAG,IAAM,CACzB,EAAE,YAAY,EAAE,WAAa,GASzB,GAAc,CAAC,EAAG,IAAM,CAI5B,EAAE,YAAY,EAAE,WAAc,IAAM,EAAK,IACzC,EAAE,YAAY,EAAE,WAAa,EAAI,KAW7B,GAAW,CAAC,EAAM,EAAK,EAAO,IAAS,CAE3C,GAAI,GAAM,EAAK,SAGf,MADI,GAAM,GAAQ,GAAM,GACpB,IAAQ,EAAY,EAExB,GAAK,UAAY,EAGjB,EAAI,IAAI,EAAK,MAAM,SAAS,EAAK,QAAS,EAAK,QAAU,GAAM,GAC/D,AAAI,EAAK,MAAM,OAAS,EACtB,EAAK,MAAQ,GAAU,EAAK,MAAO,EAAK,EAAK,GAGtC,EAAK,MAAM,OAAS,GAC3B,GAAK,MAAQ,GAAQ,EAAK,MAAO,EAAK,EAAK,IAG7C,EAAK,SAAW,EAChB,EAAK,UAAY,EAEV,IAaH,GAAgB,CAAC,EAAG,IAAc,CAEtC,GAAI,GAAe,EAAE,iBACjB,EAAO,EAAE,SACT,EACA,EACA,EAAW,EAAE,YACb,EAAa,EAAE,WACb,EAAS,EAAE,SAAY,EAAE,OAAS,GACpC,EAAE,SAAY,GAAE,OAAS,IAAiB,EAExC,EAAO,EAAE,OAET,EAAQ,EAAE,OACV,EAAQ,EAAE,KAMV,EAAS,EAAE,SAAW,GACxB,EAAa,EAAK,EAAO,EAAW,GACpC,EAAa,EAAK,EAAO,GAQ7B,AAAI,EAAE,aAAe,EAAE,YACrB,KAAiB,GAKf,EAAa,EAAE,WAAa,GAAa,EAAE,WAI/C,EAaE,IAXA,EAAQ,EAWJ,IAAK,EAAQ,KAAkB,GAC/B,EAAK,EAAQ,EAAW,KAAO,GAC/B,EAAK,KAA0B,EAAK,IACpC,EAAK,EAAE,KAAwB,EAAK,EAAO,IAU/C,IAAQ,EACR,IAMA,EAAG,OAEM,EAAK,EAAE,KAAU,EAAK,EAAE,IAAU,EAAK,EAAE,KAAU,EAAK,EAAE,IAC1D,EAAK,EAAE,KAAU,EAAK,EAAE,IAAU,EAAK,EAAE,KAAU,EAAK,EAAE,IAC1D,EAAK,EAAE,KAAU,EAAK,EAAE,IAAU,EAAK,EAAE,KAAU,EAAK,EAAE,IAC1D,EAAK,EAAE,KAAU,EAAK,EAAE,IAAU,EAAK,EAAE,KAAU,EAAK,EAAE,IAC1D,EAAO,GAOhB,GAHA,EAAM,GAAa,GAAS,GAC5B,EAAO,EAAS,GAEZ,EAAM,EAAU,CAGlB,GAFA,EAAE,YAAc,EAChB,EAAW,EACP,GAAO,EACT,MAEF,EAAa,EAAK,EAAO,EAAW,GACpC,EAAa,EAAK,EAAO,UAEnB,GAAY,EAAK,EAAY,IAAU,GAAS,EAAE,GAAiB,GAE7E,MAAI,IAAY,EAAE,UACT,EAEF,EAAE,WAcL,GAAc,AAAC,GAAM,CAEzB,GAAM,GAAU,EAAE,OACd,EAAG,EAAG,EAAG,EAAM,EAInB,EAAG,CAqBD,GApBA,EAAO,EAAE,YAAc,EAAE,UAAY,EAAE,SAoBnC,EAAE,UAAY,EAAW,GAAU,IAAgB,CAErD,EAAE,OAAO,IAAI,EAAE,OAAO,SAAS,EAAS,EAAU,GAAU,GAC5D,EAAE,aAAe,EACjB,EAAE,UAAY,EAEd,EAAE,aAAe,EASjB,EAAI,EAAE,UACN,EAAI,EAEJ,EACE,GAAI,EAAE,KAAK,EAAE,GACb,EAAE,KAAK,GAAM,GAAK,EAAU,EAAI,EAAU,QACnC,EAAE,GAEX,EAAI,EACJ,EAAI,EAEJ,EACE,GAAI,EAAE,KAAK,EAAE,GACb,EAAE,KAAK,GAAM,GAAK,EAAU,EAAI,EAAU,QAInC,EAAE,GAEX,GAAQ,EAEV,GAAI,EAAE,KAAK,WAAa,EACtB,MAmBF,GAJA,EAAI,GAAS,EAAE,KAAM,EAAE,OAAQ,EAAE,SAAW,EAAE,UAAW,GACzD,EAAE,WAAa,EAGX,EAAE,UAAY,EAAE,QAAU,GAS5B,IARA,EAAM,EAAE,SAAW,EAAE,OACrB,EAAE,MAAQ,EAAE,OAAO,GAGnB,EAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAM,IAInC,EAAE,QAEP,GAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAM,GAAY,IAEtD,EAAE,KAAK,EAAM,EAAE,QAAU,EAAE,KAAK,EAAE,OAClC,EAAE,KAAK,EAAE,OAAS,EAClB,IACA,EAAE,SACE,IAAE,UAAY,EAAE,OAAS,MAA7B,QASG,EAAE,UAAY,IAAiB,EAAE,KAAK,WAAa,IAiDxD,GAAiB,CAAC,EAAG,IAAU,CAKnC,GAAI,GAAiB,MAOrB,IALI,EAAiB,EAAE,iBAAmB,GACxC,GAAiB,EAAE,iBAAmB,KAI/B,CAEP,GAAI,EAAE,WAAa,EAAG,CAUpB,GADA,GAAY,GACR,EAAE,YAAc,GAAK,IAAU,GACjC,MAAO,IAGT,GAAI,EAAE,YAAc,EAClB,MAOJ,EAAE,UAAY,EAAE,UAChB,EAAE,UAAY,EAGd,GAAM,GAAY,EAAE,YAAc,EAkBlC,GAhBI,GAAE,WAAa,GAAK,EAAE,UAAY,IAEpC,GAAE,UAAY,EAAE,SAAW,EAC3B,EAAE,SAAW,EAEb,GAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,IAUvB,EAAE,SAAW,EAAE,aAAgB,EAAE,OAAS,IAE5C,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GACvB,MAAO,IAQb,MAFA,GAAE,OAAS,EAEP,IAAU,GAEZ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,EAChB,GAGF,IAGL,GAAE,SAAW,EAAE,aAEjB,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GAChB,KAeP,GAAe,CAAC,EAAG,IAAU,CAEjC,GAAI,GACA,EAEJ,OAAS,CAMP,GAAI,EAAE,UAAY,GAAe,CAE/B,GADA,GAAY,GACR,EAAE,UAAY,IAAiB,IAAU,GAC3C,MAAO,IAET,GAAI,EAAE,YAAc,EAClB,MA2BJ,GApBA,EAAY,EACR,EAAE,WAAa,IAEjB,GAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAE,SAAW,GAAY,IAC7D,EAAY,EAAE,KAAK,EAAE,SAAW,EAAE,QAAU,EAAE,KAAK,EAAE,OACrD,EAAE,KAAK,EAAE,OAAS,EAAE,UAOlB,IAAc,GAAc,EAAE,SAAW,GAAe,EAAE,OAAS,IAKrE,GAAE,aAAe,GAAc,EAAG,IAGhC,EAAE,cAAgB,GAYpB,GAPA,EAAS,GAAU,EAAG,EAAE,SAAW,EAAE,YAAa,EAAE,aAAe,IAEnE,EAAE,WAAa,EAAE,aAKb,EAAE,cAAgB,EAAE,gBAAuC,EAAE,WAAa,GAAW,CACvF,EAAE,eACF,EACE,GAAE,WAEF,EAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAE,SAAW,GAAY,IAC7D,EAAY,EAAE,KAAK,EAAE,SAAW,EAAE,QAAU,EAAE,KAAK,EAAE,OACrD,EAAE,KAAK,EAAE,OAAS,EAAE,eAKb,EAAE,EAAE,cAAiB,GAC9B,EAAE,eAGF,GAAE,UAAY,EAAE,aAChB,EAAE,aAAe,EACjB,EAAE,MAAQ,EAAE,OAAO,EAAE,UAErB,EAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAE,SAAW,QAanD,GAAS,GAAU,EAAG,EAAG,EAAE,OAAO,EAAE,WAEpC,EAAE,YACF,EAAE,WAEJ,GAAI,GAEF,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GACvB,MAAO,IAMb,MADA,GAAE,OAAW,EAAE,SAAY,GAAY,EAAM,EAAE,SAAW,GAAY,EAClE,IAAU,GAEZ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,EAChB,GAGF,IAEL,EAAE,UAEJ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GAChB,GAIJ,IAQH,GAAe,CAAC,EAAG,IAAU,CAEjC,GAAI,GACA,EAEA,EAGJ,OAAS,CAMP,GAAI,EAAE,UAAY,GAAe,CAE/B,GADA,GAAY,GACR,EAAE,UAAY,IAAiB,IAAU,GAC3C,MAAO,IAET,GAAI,EAAE,YAAc,EAAK,MA0C3B,GApCA,EAAY,EACR,EAAE,WAAa,IAEjB,GAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAE,SAAW,GAAY,IAC7D,EAAY,EAAE,KAAK,EAAE,SAAW,EAAE,QAAU,EAAE,KAAK,EAAE,OACrD,EAAE,KAAK,EAAE,OAAS,EAAE,UAMtB,EAAE,YAAc,EAAE,aAClB,EAAE,WAAa,EAAE,YACjB,EAAE,aAAe,GAAY,EAEzB,IAAc,GAAY,EAAE,YAAc,EAAE,gBAC5C,EAAE,SAAW,GAAc,EAAE,OAAS,IAKxC,GAAE,aAAe,GAAc,EAAG,GAG9B,EAAE,cAAgB,GAClB,GAAE,WAAa,IAAe,EAAE,eAAiB,IAAa,EAAE,SAAW,EAAE,YAAc,OAK7F,GAAE,aAAe,GAAY,IAM7B,EAAE,aAAe,IAAa,EAAE,cAAgB,EAAE,YAAa,CACjE,EAAa,EAAE,SAAW,EAAE,UAAY,GAOxC,EAAS,GAAU,EAAG,EAAE,SAAW,EAAI,EAAE,WAAY,EAAE,YAAc,IAMrE,EAAE,WAAa,EAAE,YAAc,EAC/B,EAAE,aAAe,EACjB,EACE,AAAI,EAAE,EAAE,UAAY,GAElB,GAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAE,SAAW,GAAY,IAC7D,EAAY,EAAE,KAAK,EAAE,SAAW,EAAE,QAAU,EAAE,KAAK,EAAE,OACrD,EAAE,KAAK,EAAE,OAAS,EAAE,gBAGf,EAAE,EAAE,aAAgB,GAK7B,GAJA,EAAE,gBAAkB,EACpB,EAAE,aAAe,GAAY,EAC7B,EAAE,WAEE,GAEF,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GACvB,MAAO,YAKF,EAAE,iBAgBX,GATA,EAAS,GAAU,EAAG,EAAG,EAAE,OAAO,EAAE,SAAW,IAE3C,GAEF,GAAiB,EAAG,IAGtB,EAAE,WACF,EAAE,YACE,EAAE,KAAK,YAAc,EACvB,MAAO,QAMT,GAAE,gBAAkB,EACpB,EAAE,WACF,EAAE,YAYN,MARI,GAAE,iBAGJ,GAAS,GAAU,EAAG,EAAG,EAAE,OAAO,EAAE,SAAW,IAE/C,EAAE,gBAAkB,GAEtB,EAAE,OAAS,EAAE,SAAW,GAAY,EAAI,EAAE,SAAW,GAAY,EAC7D,IAAU,GAEZ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,EAChB,GAGF,IAEL,EAAE,UAEJ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GAChB,GAKJ,IASH,GAAc,CAAC,EAAG,IAAU,CAEhC,GAAI,GACA,EACA,EAAM,EAEJ,EAAO,EAAE,OAEf,OAAS,CAKP,GAAI,EAAE,WAAa,GAAW,CAE5B,GADA,GAAY,GACR,EAAE,WAAa,IAAa,IAAU,GACxC,MAAO,IAET,GAAI,EAAE,YAAc,EAAK,MAK3B,GADA,EAAE,aAAe,EACb,EAAE,WAAa,IAAa,EAAE,SAAW,GAC3C,GAAO,EAAE,SAAW,EACpB,EAAO,EAAK,GACR,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IAAO,CAC3E,EAAS,EAAE,SAAW,GACtB,EAAG,OAEM,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IACzC,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IACzC,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IACzC,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IACzC,EAAO,GAChB,EAAE,aAAe,GAAa,GAAS,GACnC,EAAE,aAAe,EAAE,WACrB,GAAE,aAAe,EAAE,WAyBzB,GAlBA,AAAI,EAAE,cAAgB,GAIpB,GAAS,GAAU,EAAG,EAAG,EAAE,aAAe,IAE1C,EAAE,WAAa,EAAE,aACjB,EAAE,UAAY,EAAE,aAChB,EAAE,aAAe,GAKjB,GAAS,GAAU,EAAG,EAAG,EAAE,OAAO,EAAE,WAEpC,EAAE,YACF,EAAE,YAEA,GAEF,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GACvB,MAAO,IAMb,MADA,GAAE,OAAS,EACP,IAAU,GAEZ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,EAChB,GAGF,IAEL,EAAE,UAEJ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GAChB,GAIJ,IAOH,GAAe,CAAC,EAAG,IAAU,CAEjC,GAAI,GAEJ,OAAS,CAEP,GAAI,EAAE,YAAc,GAClB,IAAY,GACR,EAAE,YAAc,GAAG,CACrB,GAAI,IAAU,GACZ,MAAO,IAET,MAWJ,GANA,EAAE,aAAe,EAGjB,EAAS,GAAU,EAAG,EAAG,EAAE,OAAO,EAAE,WACpC,EAAE,YACF,EAAE,WACE,GAEF,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GACvB,MAAO,IAMb,MADA,GAAE,OAAS,EACP,IAAU,GAEZ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,EAChB,GAGF,IAEL,EAAE,UAEJ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GAChB,GAIJ,IAQT,YAAgB,EAAa,EAAU,EAAa,EAAW,EAAM,CAEnE,KAAK,YAAc,EACnB,KAAK,SAAW,EAChB,KAAK,YAAc,EACnB,KAAK,UAAY,EACjB,KAAK,KAAO,EAGd,GAAM,IAAsB,CAE1B,GAAI,IAAO,EAAG,EAAG,EAAG,EAAG,IACvB,GAAI,IAAO,EAAG,EAAG,EAAG,EAAG,IACvB,GAAI,IAAO,EAAG,EAAG,GAAI,EAAG,IACxB,GAAI,IAAO,EAAG,EAAG,GAAI,GAAI,IAEzB,GAAI,IAAO,EAAG,EAAG,GAAI,GAAI,IACzB,GAAI,IAAO,EAAG,GAAI,GAAI,GAAI,IAC1B,GAAI,IAAO,EAAG,GAAI,IAAK,IAAK,IAC5B,GAAI,IAAO,EAAG,GAAI,IAAK,IAAK,IAC5B,GAAI,IAAO,GAAI,IAAK,IAAK,KAAM,IAC/B,GAAI,IAAO,GAAI,IAAK,IAAK,KAAM,KAO3B,GAAU,AAAC,GAAM,CAErB,EAAE,YAAc,EAAI,EAAE,OAGtB,GAAK,EAAE,MAIP,EAAE,eAAiB,GAAoB,EAAE,OAAO,SAChD,EAAE,WAAa,GAAoB,EAAE,OAAO,YAC5C,EAAE,WAAa,GAAoB,EAAE,OAAO,YAC5C,EAAE,iBAAmB,GAAoB,EAAE,OAAO,UAElD,EAAE,SAAW,EACb,EAAE,YAAc,EAChB,EAAE,UAAY,EACd,EAAE,OAAS,EACX,EAAE,aAAe,EAAE,YAAc,GAAY,EAC7C,EAAE,gBAAkB,EACpB,EAAE,MAAQ,GAIZ,aAAwB,CACtB,KAAK,KAAO,KACZ,KAAK,OAAS,EACd,KAAK,YAAc,KACnB,KAAK,iBAAmB,EACxB,KAAK,YAAc,EACnB,KAAK,QAAU,EACf,KAAK,KAAO,EACZ,KAAK,OAAS,KACd,KAAK,QAAU,EACf,KAAK,OAAS,GACd,KAAK,WAAa,GAElB,KAAK,OAAS,EACd,KAAK,OAAS,EACd,KAAK,OAAS,EAEd,KAAK,OAAS,KAQd,KAAK,YAAc,EAKnB,KAAK,KAAO,KAMZ,KAAK,KAAO,KAEZ,KAAK,MAAQ,EACb,KAAK,UAAY,EACjB,KAAK,UAAY,EACjB,KAAK,UAAY,EAEjB,KAAK,WAAa,EAOlB,KAAK,YAAc,EAKnB,KAAK,aAAe,EACpB,KAAK,WAAa,EAClB,KAAK,gBAAkB,EACvB,KAAK,SAAW,EAChB,KAAK,YAAc,EACnB,KAAK,UAAY,EAEjB,KAAK,YAAc,EAKnB,KAAK,iBAAmB,EAMxB,KAAK,eAAiB,EAYtB,KAAK,MAAQ,EACb,KAAK,SAAW,EAEhB,KAAK,WAAa,EAGlB,KAAK,WAAa,EAYlB,KAAK,UAAa,GAAI,aAAY,GAAY,GAC9C,KAAK,UAAa,GAAI,aAAa,GAAI,GAAU,GAAK,GACtD,KAAK,QAAa,GAAI,aAAa,GAAI,GAAW,GAAK,GACvD,GAAK,KAAK,WACV,GAAK,KAAK,WACV,GAAK,KAAK,SAEV,KAAK,OAAW,KAChB,KAAK,OAAW,KAChB,KAAK,QAAW,KAGhB,KAAK,SAAW,GAAI,aAAY,GAAW,GAI3C,KAAK,KAAO,GAAI,aAAY,EAAI,GAAU,GAC1C,GAAK,KAAK,MAEV,KAAK,SAAW,EAChB,KAAK,SAAW,EAKhB,KAAK,MAAQ,GAAI,aAAY,EAAI,GAAU,GAC3C,GAAK,KAAK,OAIV,KAAK,MAAQ,EAEb,KAAK,YAAc,EAoBnB,KAAK,SAAW,EAEhB,KAAK,MAAQ,EAMb,KAAK,QAAU,EACf,KAAK,WAAa,EAClB,KAAK,QAAU,EACf,KAAK,OAAS,EAGd,KAAK,OAAS,EAId,KAAK,SAAW,EAgBlB,GAAM,IAAmB,AAAC,GAAS,CAEjC,GAAI,CAAC,GAAQ,CAAC,EAAK,MACjB,MAAO,IAAI,EAAM,IAGnB,EAAK,SAAW,EAAK,UAAY,EACjC,EAAK,UAAY,GAEjB,GAAM,GAAI,EAAK,MACf,SAAE,QAAU,EACZ,EAAE,YAAc,EAEZ,EAAE,KAAO,GACX,GAAE,KAAO,CAAC,EAAE,MAGd,EAAE,OAAU,EAAE,KAAO,GAAa,GAClC,EAAK,MAAS,EAAE,OAAS,EACvB,EAEA,EACF,EAAE,WAAa,GACf,GAAS,GACF,IAIH,GAAe,AAAC,GAAS,CAE7B,GAAM,GAAM,GAAiB,GAC7B,MAAI,KAAQ,IACV,GAAQ,EAAK,OAER,GAIH,GAAmB,CAAC,EAAM,IAE1B,CAAC,GAAQ,CAAC,EAAK,OACf,EAAK,MAAM,OAAS,EAAY,GACpC,GAAK,MAAM,OAAS,EACb,IAIH,GAAe,CAAC,EAAM,EAAO,EAAQ,EAAY,EAAU,IAAa,CAE5E,GAAI,CAAC,EACH,MAAO,IAET,GAAI,GAAO,EAiBX,GAfI,IAAU,IACZ,GAAQ,GAGV,AAAI,EAAa,EACf,GAAO,EACP,EAAa,CAAC,GAGP,EAAa,IACpB,GAAO,EACP,GAAc,IAIZ,EAAW,GAAK,EAAW,IAAiB,IAAW,IACzD,EAAa,GAAK,EAAa,IAAM,EAAQ,GAAK,EAAQ,GAC1D,EAAW,GAAK,EAAW,GAC3B,MAAO,IAAI,EAAM,IAInB,AAAI,IAAe,GACjB,GAAa,GAIf,GAAM,GAAI,GAAI,IAEd,SAAK,MAAQ,EACb,EAAE,KAAO,EAET,EAAE,KAAO,EACT,EAAE,OAAS,KACX,EAAE,OAAS,EACX,EAAE,OAAS,GAAK,EAAE,OAClB,EAAE,OAAS,EAAE,OAAS,EAEtB,EAAE,UAAY,EAAW,EACzB,EAAE,UAAY,GAAK,EAAE,UACrB,EAAE,UAAY,EAAE,UAAY,EAC5B,EAAE,WAAa,CAAC,CAAG,IAAE,UAAY,GAAY,GAAK,IAElD,EAAE,OAAS,GAAI,YAAW,EAAE,OAAS,GACrC,EAAE,KAAO,GAAI,aAAY,EAAE,WAC3B,EAAE,KAAO,GAAI,aAAY,EAAE,QAK3B,EAAE,YAAc,GAAM,EAAW,EAEjC,EAAE,iBAAmB,EAAE,YAAc,EAIrC,EAAE,YAAc,GAAI,YAAW,EAAE,kBAIjC,EAAE,MAAQ,EAAI,EAAE,YAGhB,EAAE,MAAS,GAAI,GAAK,EAAE,YAEtB,EAAE,MAAQ,EACV,EAAE,SAAW,EACb,EAAE,OAAS,EAEJ,GAAa,IAGhB,GAAc,CAAC,EAAM,IAElB,GAAa,EAAM,EAAO,GAAc,GAAa,GAAe,IAIvE,GAAY,CAAC,EAAM,IAAU,CAEjC,GAAI,GAAK,EAET,GAAI,CAAC,GAAQ,CAAC,EAAK,OACjB,EAAQ,IAAa,EAAQ,EAC7B,MAAO,GAAO,GAAI,EAAM,IAAoB,GAG9C,GAAM,GAAI,EAAK,MAEf,GAAI,CAAC,EAAK,QACL,CAAC,EAAK,OAAS,EAAK,WAAa,GACjC,EAAE,SAAW,IAAgB,IAAU,GAC1C,MAAO,IAAI,EAAO,EAAK,YAAc,EAAK,GAAgB,IAG5D,EAAE,KAAO,EACT,GAAM,GAAY,EAAE,WAIpB,GAHA,EAAE,WAAa,EAGX,EAAE,SAAW,GAEf,GAAI,EAAE,OAAS,EACb,EAAK,MAAQ,EACb,GAAS,EAAG,IACZ,GAAS,EAAG,KACZ,GAAS,EAAG,GACZ,AAAK,EAAE,OAaL,IAAS,EAAI,GAAE,OAAO,KAAO,EAAI,GACpB,GAAE,OAAO,KAAO,EAAI,GACpB,CAAC,EAAE,OAAO,MAAY,EAAJ,GAClB,CAAC,EAAE,OAAO,KAAW,EAAJ,GACjB,CAAC,EAAE,OAAO,QAAc,GAAJ,IAEjC,GAAS,EAAG,EAAE,OAAO,KAAO,KAC5B,GAAS,EAAI,EAAE,OAAO,MAAQ,EAAK,KACnC,GAAS,EAAI,EAAE,OAAO,MAAQ,GAAM,KACpC,GAAS,EAAI,EAAE,OAAO,MAAQ,GAAM,KACpC,GAAS,EAAG,EAAE,QAAU,EAAI,EACf,EAAE,UAAY,IAAkB,EAAE,MAAQ,EAC1C,EAAI,GACjB,GAAS,EAAG,EAAE,OAAO,GAAK,KACtB,EAAE,OAAO,OAAS,EAAE,OAAO,MAAM,QACnC,IAAS,EAAG,EAAE,OAAO,MAAM,OAAS,KACpC,GAAS,EAAI,EAAE,OAAO,MAAM,QAAU,EAAK,MAEzC,EAAE,OAAO,MACX,GAAK,MAAQ,GAAQ,EAAK,MAAO,EAAE,YAAa,EAAE,QAAS,IAE7D,EAAE,QAAU,EACZ,EAAE,OAAS,IAlCX,IAAS,EAAG,GACZ,GAAS,EAAG,GACZ,GAAS,EAAG,GACZ,GAAS,EAAG,GACZ,GAAS,EAAG,GACZ,GAAS,EAAG,EAAE,QAAU,EAAI,EACf,EAAE,UAAY,IAAkB,EAAE,MAAQ,EAC1C,EAAI,GACjB,GAAS,EAAG,IACZ,EAAE,OAAS,QA6Bf,CACE,GAAI,GAAU,GAAiB,GAAE,OAAS,GAAM,IAAO,EACnD,EAAc,GAElB,AAAI,EAAE,UAAY,IAAkB,EAAE,MAAQ,EAC5C,EAAc,EACT,AAAI,EAAE,MAAQ,EACnB,EAAc,EACT,AAAI,EAAE,QAAU,EACrB,EAAc,EAEd,EAAc,EAEhB,GAAW,GAAe,EACtB,EAAE,WAAa,GAAK,IAAU,IAClC,GAAU,GAAM,EAAS,GAEzB,EAAE,OAAS,GACX,GAAY,EAAG,GAGX,EAAE,WAAa,GACjB,IAAY,EAAG,EAAK,QAAU,IAC9B,GAAY,EAAG,EAAK,MAAQ,QAE9B,EAAK,MAAQ,EAKjB,GAAI,EAAE,SAAW,GACf,GAAI,EAAE,OAAO,MAAqB,CAGhC,IAFA,EAAM,EAAE,QAED,EAAE,QAAW,GAAE,OAAO,MAAM,OAAS,QACtC,IAAE,UAAY,EAAE,kBACd,GAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,GAAQ,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,IAEnE,GAAc,GACd,EAAM,EAAE,QACJ,EAAE,UAAY,EAAE,oBAItB,GAAS,EAAG,EAAE,OAAO,MAAM,EAAE,SAAW,KACxC,EAAE,UAEJ,AAAI,EAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,GAAQ,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,IAE/D,EAAE,UAAY,EAAE,OAAO,MAAM,QAC/B,GAAE,QAAU,EACZ,EAAE,OAAS,QAIb,GAAE,OAAS,GAGf,GAAI,EAAE,SAAW,GACf,GAAI,EAAE,OAAO,KAAoB,CAC/B,EAAM,EAAE,QAGR,EAAG,CACD,GAAI,EAAE,UAAY,EAAE,kBACd,GAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,GAAQ,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,IAEnE,GAAc,GACd,EAAM,EAAE,QACJ,EAAE,UAAY,EAAE,kBAAkB,CACpC,EAAM,EACN,MAIJ,AAAI,EAAE,QAAU,EAAE,OAAO,KAAK,OAC5B,EAAM,EAAE,OAAO,KAAK,WAAW,EAAE,WAAa,IAE9C,EAAM,EAER,GAAS,EAAG,SACL,IAAQ,GAEjB,AAAI,EAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,GAAQ,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,IAE/D,IAAQ,GACV,GAAE,QAAU,EACZ,EAAE,OAAS,QAIb,GAAE,OAAS,GAGf,GAAI,EAAE,SAAW,GACf,GAAI,EAAE,OAAO,QAAuB,CAClC,EAAM,EAAE,QAGR,EAAG,CACD,GAAI,EAAE,UAAY,EAAE,kBACd,GAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,GAAQ,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,IAEnE,GAAc,GACd,EAAM,EAAE,QACJ,EAAE,UAAY,EAAE,kBAAkB,CACpC,EAAM,EACN,MAIJ,AAAI,EAAE,QAAU,EAAE,OAAO,QAAQ,OAC/B,EAAM,EAAE,OAAO,QAAQ,WAAW,EAAE,WAAa,IAEjD,EAAM,EAER,GAAS,EAAG,SACL,IAAQ,GAEjB,AAAI,EAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,GAAQ,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,IAE/D,IAAQ,GACV,GAAE,OAAS,QAIb,GAAE,OAAS,GAsBf,GAnBI,EAAE,SAAW,IACf,CAAI,EAAE,OAAO,KACP,GAAE,QAAU,EAAI,EAAE,kBACpB,GAAc,GAEZ,EAAE,QAAU,GAAK,EAAE,kBACrB,IAAS,EAAG,EAAK,MAAQ,KACzB,GAAS,EAAI,EAAK,OAAS,EAAK,KAChC,EAAK,MAAQ,EACb,EAAE,OAAS,KAIb,EAAE,OAAS,IAMX,EAAE,UAAY,GAEhB,GADA,GAAc,GACV,EAAK,YAAc,EAOrB,SAAE,WAAa,GACR,WAOA,EAAK,WAAa,GAAK,GAAK,IAAU,GAAK,IACpD,IAAU,GACV,MAAO,IAAI,EAAM,IAInB,GAAI,EAAE,SAAW,IAAgB,EAAK,WAAa,EACjD,MAAO,IAAI,EAAM,IAKnB,GAAI,EAAK,WAAa,GAAK,EAAE,YAAc,GACxC,IAAU,IAAgB,EAAE,SAAW,GAAe,CACvD,GAAI,GAAU,EAAE,WAAa,GAAkB,GAAa,EAAG,GAC5D,EAAE,WAAa,GAAQ,GAAY,EAAG,GACrC,GAAoB,EAAE,OAAO,KAAK,EAAG,GAKzC,GAHI,KAAW,IAAqB,IAAW,KAC7C,GAAE,OAAS,IAET,IAAW,IAAgB,IAAW,GACxC,MAAI,GAAK,YAAc,GACrB,GAAE,WAAa,IAGV,GAST,GAAI,IAAW,IACb,CAAI,IAAU,GACZ,GAAU,GAEH,IAAU,IAEjB,IAAiB,EAAG,EAAG,EAAG,IAItB,IAAU,IAEZ,IAAK,EAAE,MAEH,EAAE,YAAc,GAClB,GAAE,SAAW,EACb,EAAE,YAAc,EAChB,EAAE,OAAS,KAIjB,GAAc,GACV,EAAK,YAAc,GACrB,SAAE,WAAa,GACR,GAOb,MAAI,KAAU,GAAqB,GAC/B,EAAE,MAAQ,EAAY,GAG1B,CAAI,EAAE,OAAS,EACb,IAAS,EAAG,EAAK,MAAQ,KACzB,GAAS,EAAI,EAAK,OAAS,EAAK,KAChC,GAAS,EAAI,EAAK,OAAS,GAAM,KACjC,GAAS,EAAI,EAAK,OAAS,GAAM,KACjC,GAAS,EAAG,EAAK,SAAW,KAC5B,GAAS,EAAI,EAAK,UAAY,EAAK,KACnC,GAAS,EAAI,EAAK,UAAY,GAAM,KACpC,GAAS,EAAI,EAAK,UAAY,GAAM,MAIpC,IAAY,EAAG,EAAK,QAAU,IAC9B,GAAY,EAAG,EAAK,MAAQ,QAG9B,GAAc,GAIV,EAAE,KAAO,GAAK,GAAE,KAAO,CAAC,EAAE,MAEvB,EAAE,UAAY,EAAI,GAAS,KAI9B,GAAa,AAAC,GAAS,CAE3B,GAAI,CAAC,GAAqB,CAAC,EAAK,MAC9B,MAAO,IAGT,GAAM,GAAS,EAAK,MAAM,OAC1B,MAAI,KAAW,IACb,IAAW,IACX,IAAW,IACX,IAAW,IACX,IAAW,IACX,IAAW,IACX,IAAW,GAEJ,GAAI,EAAM,IAGnB,GAAK,MAAQ,KAEN,IAAW,GAAa,GAAI,EAAM,IAAkB,KAQvD,GAAuB,CAAC,EAAM,IAAe,CAEjD,GAAI,GAAa,EAAW,OAE5B,GAAI,CAAC,GAAqB,CAAC,EAAK,MAC9B,MAAO,IAGT,GAAM,GAAI,EAAK,MACT,EAAO,EAAE,KAEf,GAAI,IAAS,GAAM,IAAS,GAAK,EAAE,SAAW,IAAe,EAAE,UAC7D,MAAO,IAYT,GARI,IAAS,GAEX,GAAK,MAAQ,GAAU,EAAK,MAAO,EAAY,EAAY,IAG7D,EAAE,KAAO,EAGL,GAAc,EAAE,OAAQ,CAC1B,AAAI,IAAS,GAEX,IAAK,EAAE,MACP,EAAE,SAAW,EACb,EAAE,YAAc,EAChB,EAAE,OAAS,GAIb,GAAI,GAAU,GAAI,YAAW,EAAE,QAC/B,EAAQ,IAAI,EAAW,SAAS,EAAa,EAAE,OAAQ,GAAa,GACpE,EAAa,EACb,EAAa,EAAE,OAGjB,GAAM,GAAQ,EAAK,SACb,EAAO,EAAK,QACZ,EAAQ,EAAK,MAKnB,IAJA,EAAK,SAAW,EAChB,EAAK,QAAU,EACf,EAAK,MAAQ,EACb,GAAY,GACL,EAAE,WAAa,IAAW,CAC/B,GAAI,GAAM,EAAE,SACR,EAAI,EAAE,UAAa,IAAY,GACnC,EAEE,GAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAM,GAAY,IAEtD,EAAE,KAAK,EAAM,EAAE,QAAU,EAAE,KAAK,EAAE,OAElC,EAAE,KAAK,EAAE,OAAS,EAClB,UACO,EAAE,GACX,EAAE,SAAW,EACb,EAAE,UAAY,GAAY,EAC1B,GAAY,GAEd,SAAE,UAAY,EAAE,UAChB,EAAE,YAAc,EAAE,SAClB,EAAE,OAAS,EAAE,UACb,EAAE,UAAY,EACd,EAAE,aAAe,EAAE,YAAc,GAAY,EAC7C,EAAE,gBAAkB,EACpB,EAAK,QAAU,EACf,EAAK,MAAQ,EACb,EAAK,SAAW,EAChB,EAAE,KAAO,EACF,IAIL,GAAgB,GAChB,GAAiB,GACjB,GAAiB,GACjB,GAAqB,GACrB,GAAqB,GACrB,GAAc,GACd,GAAe,GACf,GAAyB,GACzB,GAAc,qCAWd,GAAc,CACjB,YAAa,GACb,aAAc,GACd,aAAc,GACd,iBAAkB,GAClB,iBAAkB,GAClB,QAAS,GACT,WAAY,GACZ,qBAAsB,GACtB,YAAa,IAGR,GAAO,CAAC,EAAK,IACV,OAAO,UAAU,eAAe,KAAK,EAAK,GAG/C,GAAS,SAAU,EAAkC,CACvD,GAAM,GAAU,MAAM,UAAU,MAAM,KAAK,UAAW,GACtD,KAAO,EAAQ,QAAQ,CACrB,GAAM,GAAS,EAAQ,QACvB,GAAI,EAAC,EAEL,IAAI,MAAO,IAAW,SACpB,KAAM,IAAI,WAAU,EAAS,sBAG/B,OAAW,KAAK,GACd,AAAI,GAAK,EAAQ,IACf,GAAI,GAAK,EAAO,KAKtB,MAAO,IAKL,GAAgB,AAAC,GAAW,CAE9B,GAAI,GAAM,EAEV,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,EAAI,EAAG,IACxC,GAAO,EAAO,GAAG,OAInB,GAAM,GAAS,GAAI,YAAW,GAE9B,OAAS,GAAI,EAAG,EAAM,EAAG,EAAI,EAAO,OAAQ,EAAI,EAAG,IAAK,CACtD,GAAI,GAAQ,EAAO,GACnB,EAAO,IAAI,EAAO,GAClB,GAAO,EAAM,OAGf,MAAO,IAGL,GAAS,CACZ,OAAQ,GACR,cAAe,IAWZ,GAAmB,GAEvB,GAAI,CAAE,OAAO,aAAa,MAAM,KAAM,GAAI,YAAW,UAAc,EAAP,CAAa,GAAmB,GAM5F,GAAM,IAAW,GAAI,YAAW,KAChC,OAAS,GAAI,EAAG,EAAI,IAAK,IACvB,GAAS,GAAM,GAAK,IAAM,EAAI,GAAK,IAAM,EAAI,GAAK,IAAM,EAAI,GAAK,IAAM,EAAI,GAAK,IAAM,EAAI,EAE5F,GAAS,KAAO,GAAS,KAAO,EAIhC,GAAI,IAAa,AAAC,GAAQ,CACxB,GAAI,MAAO,cAAgB,YAAc,YAAY,UAAU,OAC7D,MAAO,IAAI,eAAc,OAAO,GAGlC,GAAI,GAAK,EAAG,EAAI,EAAO,EAAG,EAAU,EAAI,OAAQ,EAAU,EAG1D,IAAK,EAAQ,EAAG,EAAQ,EAAS,IAC/B,EAAI,EAAI,WAAW,GACd,GAAI,QAAY,OAAW,EAAQ,EAAI,GAC1C,GAAK,EAAI,WAAW,EAAQ,GACvB,GAAK,QAAY,OACpB,GAAI,MAAY,GAAI,OAAW,IAAO,GAAK,OAC3C,MAGJ,GAAW,EAAI,IAAO,EAAI,EAAI,KAAQ,EAAI,EAAI,MAAU,EAAI,EAO9D,IAHA,EAAM,GAAI,YAAW,GAGhB,EAAI,EAAG,EAAQ,EAAG,EAAI,EAAS,IAClC,EAAI,EAAI,WAAW,GACd,GAAI,QAAY,OAAW,EAAQ,EAAI,GAC1C,GAAK,EAAI,WAAW,EAAQ,GACvB,GAAK,QAAY,OACpB,GAAI,MAAY,GAAI,OAAW,IAAO,GAAK,OAC3C,MAGJ,AAAI,EAAI,IAEN,EAAI,KAAO,EACN,AAAI,EAAI,KAEb,GAAI,KAAO,IAAQ,IAAM,EACzB,EAAI,KAAO,IAAQ,EAAI,IAClB,AAAI,EAAI,MAEb,GAAI,KAAO,IAAQ,IAAM,GACzB,EAAI,KAAO,IAAQ,IAAM,EAAI,GAC7B,EAAI,KAAO,IAAQ,EAAI,IAGvB,GAAI,KAAO,IAAQ,IAAM,GACzB,EAAI,KAAO,IAAQ,IAAM,GAAK,GAC9B,EAAI,KAAO,IAAQ,IAAM,EAAI,GAC7B,EAAI,KAAO,IAAQ,EAAI,IAI3B,MAAO,IAIH,GAAgB,CAAC,EAAK,IAAQ,CAIlC,GAAI,EAAM,OACJ,EAAI,UAAY,GAClB,MAAO,QAAO,aAAa,MAAM,KAAM,EAAI,SAAW,EAAM,EAAM,EAAI,SAAS,EAAG,IAItF,GAAI,GAAS,GACb,OAAS,GAAI,EAAG,EAAI,EAAK,IACvB,GAAU,OAAO,aAAa,EAAI,IAEpC,MAAO,IAKL,GAAa,CAAC,EAAK,IAAQ,CAC7B,GAAM,GAAM,GAAO,EAAI,OAEvB,GAAI,MAAO,cAAgB,YAAc,YAAY,UAAU,OAC7D,MAAO,IAAI,eAAc,OAAO,EAAI,SAAS,EAAG,IAGlD,GAAI,GAAG,EAKD,EAAW,GAAI,OAAM,EAAM,GAEjC,IAAK,EAAM,EAAG,EAAI,EAAG,EAAI,GAAM,CAC7B,GAAI,GAAI,EAAI,KAEZ,GAAI,EAAI,IAAM,CAAE,EAAS,KAAS,EAAG,SAErC,GAAI,GAAQ,GAAS,GAErB,GAAI,EAAQ,EAAG,CAAE,EAAS,KAAS,MAAQ,GAAK,EAAQ,EAAG,SAK3D,IAFA,GAAK,IAAU,EAAI,GAAO,IAAU,EAAI,GAAO,EAExC,EAAQ,GAAK,EAAI,GACtB,EAAK,GAAK,EAAM,EAAI,KAAO,GAC3B,IAIF,GAAI,EAAQ,EAAG,CAAE,EAAS,KAAS,MAAQ,SAE3C,AAAI,EAAI,MACN,EAAS,KAAS,EAElB,IAAK,MACL,EAAS,KAAS,MAAW,GAAK,GAAM,KACxC,EAAS,KAAS,MAAU,EAAI,MAIpC,MAAO,IAAc,EAAU,IAU7B,GAAa,CAAC,EAAK,IAAQ,CAE7B,EAAM,GAAO,EAAI,OACb,EAAM,EAAI,QAAU,GAAM,EAAI,QAGlC,GAAI,GAAM,EAAM,EAChB,KAAO,GAAO,GAAM,GAAI,GAAO,MAAU,KAAQ,IAQjD,MAJI,GAAM,GAIN,IAAQ,EAAY,EAEhB,EAAM,GAAS,EAAI,IAAQ,EAAO,EAAM,GAG9C,GAAU,CACb,WAAY,GACZ,WAAY,GACZ,WAAY,IAsBb,aAAmB,CAEjB,KAAK,MAAQ,KACb,KAAK,QAAU,EAEf,KAAK,SAAW,EAEhB,KAAK,SAAW,EAEhB,KAAK,OAAS,KACd,KAAK,SAAW,EAEhB,KAAK,UAAY,EAEjB,KAAK,UAAY,EAEjB,KAAK,IAAM,GAEX,KAAK,MAAQ,KAEb,KAAK,UAAY,EAEjB,KAAK,MAAQ,EAGf,GAAI,IAAU,GAER,GAAa,OAAO,UAAU,SAK9B,CACJ,WAAY,GAAc,gBAAc,gBAAc,SAAU,GAChE,KAAM,GAAQ,aAAc,GAC5B,yBACA,sBACA,WAAY,IACV,GA0FJ,YAAmB,EAAS,CAC1B,KAAK,QAAU,GAAO,OAAO,CAC3B,MAAO,GACP,OAAQ,GACR,UAAW,MACX,WAAY,GACZ,SAAU,EACV,SAAU,IACT,GAAW,IAEd,GAAI,GAAM,KAAK,QAEf,AAAI,EAAI,KAAQ,EAAI,WAAa,EAC/B,EAAI,WAAa,CAAC,EAAI,WAGf,EAAI,MAAS,EAAI,WAAa,GAAO,EAAI,WAAa,IAC7D,GAAI,YAAc,IAGpB,KAAK,IAAS,EACd,KAAK,IAAS,GACd,KAAK,MAAS,GACd,KAAK,OAAS,GAEd,KAAK,KAAO,GAAI,IAChB,KAAK,KAAK,UAAY,EAEtB,GAAI,GAAS,GAAY,aACvB,KAAK,KACL,EAAI,MACJ,EAAI,OACJ,EAAI,WACJ,EAAI,SACJ,EAAI,UAGN,GAAI,IAAW,GACb,KAAM,IAAI,OAAM,GAAS,IAO3B,GAJI,EAAI,QACN,GAAY,iBAAiB,KAAK,KAAM,EAAI,QAG1C,EAAI,WAAY,CAClB,GAAI,GAaJ,GAXA,AAAI,MAAO,GAAI,YAAe,SAE5B,EAAO,GAAQ,WAAW,EAAI,YACzB,AAAI,GAAW,KAAK,EAAI,cAAgB,uBAC7C,EAAO,GAAI,YAAW,EAAI,YAE1B,EAAO,EAAI,WAGb,EAAS,GAAY,qBAAqB,KAAK,KAAM,GAEjD,IAAW,GACb,KAAM,IAAI,OAAM,GAAS,IAG3B,KAAK,UAAY,IA0BrB,GAAU,UAAU,KAAO,SAAU,EAAM,EAAY,CACrD,GAAM,GAAO,KAAK,KACZ,EAAY,KAAK,QAAQ,UAC3B,EAAQ,EAEZ,GAAI,KAAK,MAAS,MAAO,GAkBzB,IAhBA,AAAI,IAAe,CAAC,CAAC,EAAY,EAAc,EAC1C,EAAc,IAAe,GAAO,GAAa,GAGtD,AAAI,MAAO,IAAS,SAElB,EAAK,MAAQ,GAAQ,WAAW,GAC3B,AAAI,GAAW,KAAK,KAAU,uBACnC,EAAK,MAAQ,GAAI,YAAW,GAE5B,EAAK,MAAQ,EAGf,EAAK,QAAU,EACf,EAAK,SAAW,EAAK,MAAM,SAElB,CAQP,GAPI,EAAK,YAAc,GACrB,GAAK,OAAS,GAAI,YAAW,GAC7B,EAAK,SAAW,EAChB,EAAK,UAAY,GAId,KAAgB,IAAgB,IAAgB,KAAiB,EAAK,WAAa,EAAG,CACzF,KAAK,OAAO,EAAK,OAAO,SAAS,EAAG,EAAK,WACzC,EAAK,UAAY,EACjB,SAMF,GAHA,EAAS,GAAY,QAAQ,EAAM,GAG/B,IAAW,GACb,MAAI,GAAK,SAAW,GAClB,KAAK,OAAO,EAAK,OAAO,SAAS,EAAG,EAAK,WAE3C,EAAS,GAAY,WAAW,KAAK,MACrC,KAAK,MAAM,GACX,KAAK,MAAQ,GACN,IAAW,GAIpB,GAAI,EAAK,YAAc,EAAG,CACxB,KAAK,OAAO,EAAK,QACjB,SAIF,GAAI,EAAc,GAAK,EAAK,SAAW,EAAG,CACxC,KAAK,OAAO,EAAK,OAAO,SAAS,EAAG,EAAK,WACzC,EAAK,UAAY,EACjB,SAGF,GAAI,EAAK,WAAa,EAAG,MAG3B,MAAO,IAWT,GAAU,UAAU,OAAS,SAAU,EAAO,CAC5C,KAAK,OAAO,KAAK,IAanB,GAAU,UAAU,MAAQ,SAAU,EAAQ,CAE5C,AAAI,IAAW,IACb,MAAK,OAAS,GAAO,cAAc,KAAK,SAE1C,KAAK,OAAS,GACd,KAAK,IAAM,EACX,KAAK,IAAM,KAAK,KAAK,KAgHvB,GAAM,IAAQ,GACR,GAAS,GAqCX,GAAU,SAAsB,EAAM,EAAO,CAC/C,GAAI,GACA,EACA,EACA,EACA,EAEA,EAEA,EACA,EACA,EAEA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EAEA,EACA,GACA,EACA,GAGA,GAAO,EAGL,EAAQ,EAAK,MAEnB,EAAM,EAAK,QACX,GAAQ,EAAK,MACb,EAAO,EAAO,GAAK,SAAW,GAC9B,EAAO,EAAK,SACZ,EAAS,EAAK,OACd,EAAM,EAAQ,GAAQ,EAAK,WAC3B,EAAM,EAAQ,GAAK,UAAY,KAE/B,EAAO,EAAM,KAEb,EAAQ,EAAM,MACd,EAAQ,EAAM,MACd,EAAQ,EAAM,MACd,EAAW,EAAM,OACjB,EAAO,EAAM,KACb,EAAO,EAAM,KACb,EAAQ,EAAM,QACd,EAAQ,EAAM,SACd,EAAS,IAAK,EAAM,SAAW,EAC/B,EAAS,IAAK,EAAM,UAAY,EAMhC,EACA,EAAG,CACD,AAAI,EAAO,IACT,IAAQ,GAAM,MAAU,EACxB,GAAQ,EACR,GAAQ,GAAM,MAAU,EACxB,GAAQ,GAGV,EAAO,EAAM,EAAO,GAEpB,EACA,OAAS,CAKP,GAJA,EAAK,IAAS,GACd,KAAU,EACV,GAAQ,EACR,EAAM,IAAS,GAAM,IACjB,IAAO,EAIT,EAAO,KAAU,EAAO,cAEjB,EAAK,GAAI,CAChB,EAAM,EAAO,MACb,GAAM,GACF,GACE,GAAO,GACT,IAAQ,GAAM,MAAU,EACxB,GAAQ,GAEV,GAAO,EAAS,IAAK,GAAM,EAC3B,KAAU,EACV,GAAQ,GAGN,EAAO,IACT,IAAQ,GAAM,MAAU,EACxB,GAAQ,EACR,GAAQ,GAAM,MAAU,EACxB,GAAQ,GAEV,EAAO,EAAM,EAAO,GAEpB,EACA,OAAS,CAMP,GALA,EAAK,IAAS,GACd,KAAU,EACV,GAAQ,EACR,EAAM,IAAS,GAAM,IAEjB,EAAK,GAAI,CAaX,GAZA,GAAO,EAAO,MACd,GAAM,GACF,EAAO,GACT,IAAQ,GAAM,MAAU,EACxB,GAAQ,EACJ,EAAO,GACT,IAAQ,GAAM,MAAU,EACxB,GAAQ,IAGZ,IAAQ,EAAS,IAAK,GAAM,EAExB,GAAO,EAAM,CACf,EAAK,IAAM,gCACX,EAAM,KAAO,GACb,QAOF,GAJA,KAAU,EACV,GAAQ,EAER,EAAK,EAAO,EACR,GAAO,EAAI,CAEb,GADA,EAAK,GAAO,EACR,EAAK,GACH,EAAM,KAAM,CACd,EAAK,IAAM,gCACX,EAAM,KAAO,GACb,QA2BJ,GAFA,EAAO,EACP,GAAc,EACV,IAAU,GAEZ,GADA,GAAQ,EAAQ,EACZ,EAAK,EAAK,CACZ,GAAO,EACP,EACE,GAAO,KAAU,EAAS,WACnB,EAAE,GACX,EAAO,EAAO,GACd,GAAc,WAGT,EAAQ,GAGf,GAFA,GAAQ,EAAQ,EAAQ,EACxB,GAAM,EACF,EAAK,EAAK,CACZ,GAAO,EACP,EACE,GAAO,KAAU,EAAS,WACnB,EAAE,GAEX,GADA,EAAO,EACH,EAAQ,EAAK,CACf,EAAK,EACL,GAAO,EACP,EACE,GAAO,KAAU,EAAS,WACnB,EAAE,GACX,EAAO,EAAO,GACd,GAAc,YAKlB,GAAQ,EAAQ,EACZ,EAAK,EAAK,CACZ,GAAO,EACP,EACE,GAAO,KAAU,EAAS,WACnB,EAAE,GACX,EAAO,EAAO,GACd,GAAc,EAGlB,KAAO,EAAM,GACX,EAAO,KAAU,GAAY,KAC7B,EAAO,KAAU,GAAY,KAC7B,EAAO,KAAU,GAAY,KAC7B,GAAO,EAET,AAAI,GACF,GAAO,KAAU,GAAY,KACzB,EAAM,GACR,GAAO,KAAU,GAAY,WAI9B,CACH,EAAO,EAAO,GACd,EACE,GAAO,KAAU,EAAO,KACxB,EAAO,KAAU,EAAO,KACxB,EAAO,KAAU,EAAO,KACxB,GAAO,QACA,EAAM,GACf,AAAI,GACF,GAAO,KAAU,EAAO,KACpB,EAAM,GACR,GAAO,KAAU,EAAO,gBAKtB,GAAK,KAAQ,EAAG,CACxB,EAAO,EAAO,GAAO,OAAuB,GAAS,IAAK,GAAM,IAChE,eAEG,CACH,EAAK,IAAM,wBACX,EAAM,KAAO,GACb,QAGF,eAGM,GAAK,KAAQ,EAAG,CACxB,EAAO,EAAO,GAAO,OAAuB,GAAS,IAAK,GAAM,IAChE,mBAEO,EAAK,GAAI,CAEhB,EAAM,KAAO,GACb,YAEG,CACH,EAAK,IAAM,8BACX,EAAM,KAAO,GACb,QAGF,aAEK,EAAM,GAAQ,EAAO,GAG9B,EAAM,GAAQ,EACd,GAAO,EACP,GAAQ,GAAO,EACf,GAAS,IAAK,GAAQ,EAGtB,EAAK,QAAU,EACf,EAAK,SAAW,EAChB,EAAK,SAAY,EAAM,EAAO,EAAK,GAAO,GAAO,EAAK,GAAM,GAC5D,EAAK,UAAa,EAAO,EAAM,IAAO,GAAM,GAAQ,IAAO,GAAO,GAClE,EAAM,KAAO,EACb,EAAM,KAAO,GAuBT,GAAU,GACV,GAAgB,IAChB,GAAiB,IAGjB,GAAU,EACV,GAAS,EACT,GAAU,EAEV,GAAQ,GAAI,aAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,IAGzD,GAAO,GAAI,YAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,KAGpD,GAAQ,GAAI,aAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IACtD,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAClD,KAAM,MAAO,MAAO,MAAO,EAAG,IAG1B,GAAO,GAAI,YAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACpC,GAAI,GAAI,GAAI,GAAI,GAAI,KAGhB,GAAgB,CAAC,EAAM,EAAM,EAAY,EAAO,EAAO,EAAa,EAAM,IAChF,CACE,GAAM,GAAO,EAAK,KAGd,EAAM,EACN,EAAM,EACN,EAAM,EAAG,EAAM,EACf,EAAO,EACP,EAAO,EACP,EAAO,EACP,EAAO,EACP,EAAO,EACP,EAAO,EACP,EACA,EACA,EACA,GACA,EACA,GAAO,KACP,GAAa,EAEb,EACE,EAAQ,GAAI,aAAY,GAAU,GAClC,GAAO,GAAI,aAAY,GAAU,GACnC,GAAQ,KACR,GAAc,EAEd,GAAW,GAAS,GAkCxB,IAAK,EAAM,EAAG,GAAO,GAAS,IAC5B,EAAM,GAAO,EAEf,IAAK,EAAM,EAAG,EAAM,EAAO,IACzB,EAAM,EAAK,EAAa,MAK1B,IADA,EAAO,EACF,EAAM,GAAS,GAAO,GACrB,EAAM,KAAS,EADS,IAC5B,CAKF,GAHI,EAAO,GACT,GAAO,GAEL,IAAQ,EAIV,SAAM,KAAkB,GAAK,GAAO,IAAM,GAAM,EAMhD,EAAM,KAAkB,GAAK,GAAO,IAAM,GAAM,EAEhD,EAAK,KAAO,EACL,EAET,IAAK,EAAM,EAAG,EAAM,GACd,EAAM,KAAS,EADI,IACvB,CAQF,IANI,EAAO,GACT,GAAO,GAIT,EAAO,EACF,EAAM,EAAG,GAAO,GAAS,IAG5B,GAFA,IAAS,EACT,GAAQ,EAAM,GACV,EAAO,EACT,MAAO,GAGX,GAAI,EAAO,GAAM,KAAS,IAAW,IAAQ,GAC3C,MAAO,GAKT,IADA,GAAK,GAAK,EACL,EAAM,EAAG,EAAM,GAAS,IAC3B,GAAK,EAAM,GAAK,GAAK,GAAO,EAAM,GAIpC,IAAK,EAAM,EAAG,EAAM,EAAO,IACzB,AAAI,EAAK,EAAa,KAAS,GAC7B,GAAK,GAAK,EAAK,EAAa,OAAW,GAmE3C,GA7BA,AAAI,IAAS,GACX,IAAO,GAAQ,EACf,EAAM,IAED,AAAI,IAAS,GAClB,IAAO,GACP,IAAc,IACd,GAAQ,GACR,IAAe,IACf,EAAM,KAGN,IAAO,GACP,GAAQ,GACR,EAAM,IAIR,EAAO,EACP,EAAM,EACN,EAAM,EACN,EAAO,EACP,EAAO,EACP,EAAO,EACP,EAAM,GACN,EAAO,GAAK,EACZ,GAAO,EAAO,EAGT,IAAS,IAAU,EAAO,IAC5B,IAAS,IAAW,EAAO,GAC5B,MAAO,GAIT,OAAS,CAEP,GAAY,EAAM,EAClB,AAAI,EAAK,GAAO,EACd,IAAU,EACV,GAAW,EAAK,IAEb,AAAI,EAAK,GAAO,EACnB,IAAU,GAAM,GAAc,EAAK,IACnC,GAAW,GAAK,GAAa,EAAK,KAGlC,IAAU,GAAK,GACf,GAAW,GAIb,EAAO,GAAM,EAAM,EACnB,EAAO,GAAK,EACZ,EAAM,EACN,EACE,IAAQ,EACR,EAAM,EAAQ,IAAQ,GAAQ,GAAS,IAAa,GAAO,IAAW,GAAM,GAAU,QAC/E,IAAS,GAIlB,IADA,EAAO,GAAM,EAAM,EACZ,EAAO,GACZ,IAAS,EAWX,GATA,AAAI,IAAS,EACX,IAAQ,EAAO,EACf,GAAQ,GAER,EAAO,EAIT,IACI,EAAE,EAAM,IAAS,EAAG,CACtB,GAAI,IAAQ,EAAO,MACnB,EAAM,EAAK,EAAa,EAAK,IAI/B,GAAI,EAAM,GAAS,GAAO,MAAU,EAAK,CAYvC,IAVI,IAAS,GACX,GAAO,GAIT,GAAQ,EAGR,EAAO,EAAM,EACb,EAAO,GAAK,EACL,EAAO,EAAO,GACnB,IAAQ,EAAM,EAAO,GACjB,KAAQ,KACZ,IACA,IAAS,EAKX,GADA,GAAQ,GAAK,EACR,IAAS,IAAU,EAAO,IAC5B,IAAS,IAAW,EAAO,GAC5B,MAAO,GAIT,EAAM,EAAO,GAIb,EAAM,GAAQ,GAAQ,GAAO,GAAQ,GAAO,EAAO,EAAc,GAOrE,MAAI,KAAS,GAIX,GAAM,EAAO,GAAU,EAAM,GAAS,GAAO,IAAM,GAAK,GAK1D,EAAK,KAAO,EACL,GAIL,GAAW,GA0BT,GAAQ,EACR,GAAO,EACP,GAAQ,EAKR,CACJ,SAAU,GAAY,WAAS,WAC/B,KAAM,GAAQ,aAAc,GAAgB,YAAa,GAAe,eAAgB,GAAkB,aAAc,GAAgB,YAAa,GAAe,eACpK,eACE,GAOK,GAAO,EACP,GAAQ,EACR,GAAO,EACP,GAAK,EACL,GAAQ,EACR,GAAQ,EACR,GAAO,EACP,GAAU,EACV,GAAO,EACP,GAAS,GACT,GAAO,GACH,GAAO,GACP,GAAS,GACT,GAAS,GACT,GAAQ,GACR,GAAO,GACP,GAAQ,GACR,GAAU,GACV,GAAW,GACP,GAAO,GACP,GAAM,GACN,GAAS,GACT,GAAO,GACP,GAAU,GACV,GAAQ,GACR,GAAM,GACd,GAAQ,GACR,GAAS,GACT,GAAO,GACP,GAAM,GACN,GAAM,GACN,GAAO,GAMV,GAAc,IACd,GAAe,IAGf,GAAY,GAEZ,GAAY,GAGZ,GAAU,AAAC,GAEJ,KAAM,GAAM,KACb,KAAM,EAAK,OACX,IAAI,QAAW,GACf,IAAI,MAAS,IAIzB,aAAwB,CACtB,KAAK,KAAO,EACZ,KAAK,KAAO,GACZ,KAAK,KAAO,EACZ,KAAK,SAAW,GAChB,KAAK,MAAQ,EACb,KAAK,KAAO,EACZ,KAAK,MAAQ,EACb,KAAK,MAAQ,EAEb,KAAK,KAAO,KAGZ,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,OAAS,KAGd,KAAK,KAAO,EACZ,KAAK,KAAO,EAGZ,KAAK,OAAS,EACd,KAAK,OAAS,EAGd,KAAK,MAAQ,EAGb,KAAK,QAAU,KACf,KAAK,SAAW,KAChB,KAAK,QAAU,EACf,KAAK,SAAW,EAGhB,KAAK,MAAQ,EACb,KAAK,KAAO,EACZ,KAAK,MAAQ,EACb,KAAK,KAAO,EACZ,KAAK,KAAO,KAEZ,KAAK,KAAO,GAAI,aAAY,KAC5B,KAAK,KAAO,GAAI,aAAY,KAO5B,KAAK,OAAS,KACd,KAAK,QAAU,KACf,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,IAAM,EAIb,GAAM,IAAmB,AAAC,GAAS,CAEjC,GAAI,CAAC,GAAQ,CAAC,EAAK,MAAS,MAAO,IACnC,GAAM,GAAQ,EAAK,MACnB,SAAK,SAAW,EAAK,UAAY,EAAM,MAAQ,EAC/C,EAAK,IAAM,GACP,EAAM,MACR,GAAK,MAAQ,EAAM,KAAO,GAE5B,EAAM,KAAO,GACb,EAAM,KAAO,EACb,EAAM,SAAW,EACjB,EAAM,KAAO,MACb,EAAM,KAAO,KACb,EAAM,KAAO,EACb,EAAM,KAAO,EAEb,EAAM,QAAU,EAAM,OAAS,GAAI,YAAW,IAC9C,EAAM,SAAW,EAAM,QAAU,GAAI,YAAW,IAEhD,EAAM,KAAO,EACb,EAAM,KAAO,GAEN,IAIH,GAAe,AAAC,GAAS,CAE7B,GAAI,CAAC,GAAQ,CAAC,EAAK,MAAS,MAAO,IACnC,GAAM,GAAQ,EAAK,MACnB,SAAM,MAAQ,EACd,EAAM,MAAQ,EACd,EAAM,MAAQ,EACP,GAAiB,IAKpB,GAAgB,CAAC,EAAM,IAAe,CAC1C,GAAI,GAGJ,GAAI,CAAC,GAAQ,CAAC,EAAK,MAAS,MAAO,IACnC,GAAM,GAAQ,EAAK,MAenB,MAZA,AAAI,GAAa,EACf,GAAO,EACP,EAAa,CAAC,GAGd,GAAQ,IAAc,GAAK,EACvB,EAAa,IACf,IAAc,KAKd,GAAe,GAAa,GAAK,EAAa,IACzC,GAEL,GAAM,SAAW,MAAQ,EAAM,QAAU,GAC3C,GAAM,OAAS,MAIjB,EAAM,KAAO,EACb,EAAM,MAAQ,EACP,GAAa,KAIhB,GAAe,CAAC,EAAM,IAAe,CAEzC,GAAI,CAAC,EAAQ,MAAO,IAGpB,GAAM,GAAQ,GAAI,IAIlB,EAAK,MAAQ,EACb,EAAM,OAAS,KACf,GAAM,GAAM,GAAc,EAAM,GAChC,MAAI,KAAQ,IACV,GAAK,MAAQ,MAER,GAIH,GAAc,AAAC,GAEZ,GAAa,EAAM,IAcxB,GAAS,GAET,GAAQ,GAGN,GAAc,AAAC,GAAU,CAG7B,GAAI,GAAQ,CACV,GAAS,GAAI,YAAW,KACxB,GAAU,GAAI,YAAW,IAGzB,GAAI,GAAM,EACV,KAAO,EAAM,KAAO,EAAM,KAAK,KAAS,EACxC,KAAO,EAAM,KAAO,EAAM,KAAK,KAAS,EACxC,KAAO,EAAM,KAAO,EAAM,KAAK,KAAS,EACxC,KAAO,EAAM,KAAO,EAAM,KAAK,KAAS,EAMxC,IAJA,GAAS,GAAO,EAAM,KAAM,EAAG,IAAK,GAAU,EAAG,EAAM,KAAM,CAAE,KAAM,IAGrE,EAAM,EACC,EAAM,IAAM,EAAM,KAAK,KAAS,EAEvC,GAAS,GAAO,EAAM,KAAM,EAAG,GAAM,GAAS,EAAG,EAAM,KAAM,CAAE,KAAM,IAGrE,GAAS,GAGX,EAAM,QAAU,GAChB,EAAM,QAAU,EAChB,EAAM,SAAW,GACjB,EAAM,SAAW,GAkBb,GAAe,CAAC,EAAM,EAAK,EAAK,IAAS,CAE7C,GAAI,GACE,EAAQ,EAAK,MAGnB,MAAI,GAAM,SAAW,MACnB,GAAM,MAAQ,GAAK,EAAM,MACzB,EAAM,MAAQ,EACd,EAAM,MAAQ,EAEd,EAAM,OAAS,GAAI,YAAW,EAAM,QAItC,AAAI,GAAQ,EAAM,MAChB,GAAM,OAAO,IAAI,EAAI,SAAS,EAAM,EAAM,MAAO,GAAM,GACvD,EAAM,MAAQ,EACd,EAAM,MAAQ,EAAM,OAGpB,GAAO,EAAM,MAAQ,EAAM,MACvB,EAAO,GACT,GAAO,GAGT,EAAM,OAAO,IAAI,EAAI,SAAS,EAAM,EAAM,EAAM,EAAO,GAAO,EAAM,OACpE,GAAQ,EACR,AAAI,EAEF,GAAM,OAAO,IAAI,EAAI,SAAS,EAAM,EAAM,GAAM,GAChD,EAAM,MAAQ,EACd,EAAM,MAAQ,EAAM,OAGpB,GAAM,OAAS,EACX,EAAM,QAAU,EAAM,OAAS,GAAM,MAAQ,GAC7C,EAAM,MAAQ,EAAM,OAAS,GAAM,OAAS,KAG7C,GAIH,GAAY,CAAC,EAAM,IAAU,CAEjC,GAAI,GACA,EAAO,EACP,EACA,EACA,EAAM,EACN,EACA,EACA,EAAK,EACL,EACA,EACA,EACA,EAAO,EACP,EAAW,EAAS,EAEpB,EAAW,EAAS,GACpB,EACA,GACE,GAAO,GAAI,YAAW,GACxB,EAEA,EAEE,GACJ,GAAI,YAAW,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,KAGjF,GAAI,CAAC,GAAQ,CAAC,EAAK,OAAS,CAAC,EAAK,QAC7B,CAAC,EAAK,OAAS,EAAK,WAAa,EACpC,MAAO,IAGT,EAAQ,EAAK,MACT,EAAM,OAAS,IAAQ,GAAM,KAAO,IAIxC,EAAM,EAAK,SACX,EAAS,EAAK,OACd,EAAO,EAAK,UACZ,EAAO,EAAK,QACZ,EAAQ,EAAK,MACb,EAAO,EAAK,SACZ,EAAO,EAAM,KACb,EAAO,EAAM,KAGb,EAAM,EACN,EAAO,EACP,GAAM,GAEN,EACA,OACE,OAAQ,EAAM,UACP,IACH,GAAI,EAAM,OAAS,EAAG,CACpB,EAAM,KAAO,GACb,MAGF,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,GAAK,EAAM,KAAO,GAAM,IAAS,MAAQ,CACvC,EAAM,MAAQ,EAEd,GAAK,GAAK,EAAO,IACjB,GAAK,GAAM,IAAS,EAAK,IACzB,EAAM,MAAQ,GAAQ,EAAM,MAAO,GAAM,EAAG,GAI5C,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,GACb,MAMF,GAJA,EAAM,MAAQ,EACV,EAAM,MACR,GAAM,KAAK,KAAO,IAEhB,CAAE,GAAM,KAAO,IACd,KAAO,MAAoB,GAAM,IAAQ,IAAM,GAAI,CACtD,EAAK,IAAM,yBACX,EAAM,KAAO,GACb,MAEF,GAAK,GAAO,MAAqB,GAAY,CAC3C,EAAK,IAAM,6BACX,EAAM,KAAO,GACb,MAOF,GAJA,KAAU,EACV,GAAQ,EAER,EAAO,GAAO,IAAmB,EAC7B,EAAM,QAAU,EAClB,EAAM,MAAQ,UAEP,EAAM,EAAM,MAAO,CAC1B,EAAK,IAAM,sBACX,EAAM,KAAO,GACb,MAKF,EAAM,KAAO,GAAK,EAAM,MAIxB,EAAK,MAAQ,EAAM,MAAQ,EAC3B,EAAM,KAAO,EAAO,IAAQ,GAAS,GAErC,EAAO,EACP,EAAO,EAEP,UACG,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAIV,GADA,EAAM,MAAQ,EACT,GAAM,MAAQ,OAAU,GAAY,CACvC,EAAK,IAAM,6BACX,EAAM,KAAO,GACb,MAEF,GAAI,EAAM,MAAQ,MAAQ,CACxB,EAAK,IAAM,2BACX,EAAM,KAAO,GACb,MAEF,AAAI,EAAM,MACR,GAAM,KAAK,KAAS,GAAQ,EAAK,GAE/B,EAAM,MAAQ,KAEhB,IAAK,GAAK,EAAO,IACjB,GAAK,GAAM,IAAS,EAAK,IACzB,EAAM,MAAQ,GAAQ,EAAM,MAAO,GAAM,EAAG,IAI9C,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,OAEV,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,AAAI,EAAM,MACR,GAAM,KAAK,KAAO,GAEhB,EAAM,MAAQ,KAEhB,IAAK,GAAK,EAAO,IACjB,GAAK,GAAM,IAAS,EAAK,IACzB,GAAK,GAAM,IAAS,GAAM,IAC1B,GAAK,GAAM,IAAS,GAAM,IAC1B,EAAM,MAAQ,GAAQ,EAAM,MAAO,GAAM,EAAG,IAI9C,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,OAEV,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,AAAI,EAAM,MACR,GAAM,KAAK,OAAU,EAAO,IAC5B,EAAM,KAAK,GAAM,GAAQ,GAEvB,EAAM,MAAQ,KAEhB,IAAK,GAAK,EAAO,IACjB,GAAK,GAAM,IAAS,EAAK,IACzB,EAAM,MAAQ,GAAQ,EAAM,MAAO,GAAM,EAAG,IAI9C,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,KAAQ,CAExB,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,EAAM,OAAS,EACX,EAAM,MACR,GAAM,KAAK,UAAY,GAErB,EAAM,MAAQ,KAEhB,IAAK,GAAK,EAAO,IACjB,GAAK,GAAM,IAAS,EAAK,IACzB,EAAM,MAAQ,GAAQ,EAAM,MAAO,GAAM,EAAG,IAI9C,EAAO,EACP,EAAO,MAGJ,AAAI,GAAM,MACb,GAAM,KAAK,MAAQ,MAErB,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,MAChB,GAAO,EAAM,OACT,EAAO,GAAQ,GAAO,GACtB,GACE,GAAM,MACR,GAAM,EAAM,KAAK,UAAY,EAAM,OAC9B,EAAM,KAAK,OAEd,GAAM,KAAK,MAAQ,GAAI,YAAW,EAAM,KAAK,YAE/C,EAAM,KAAK,MAAM,IACf,EAAM,SACJ,EAGA,EAAO,GAGT,IAMA,EAAM,MAAQ,KAChB,GAAM,MAAQ,GAAQ,EAAM,MAAO,EAAO,EAAM,IAElD,GAAQ,EACR,GAAQ,EACR,EAAM,QAAU,GAEd,EAAM,QAAU,QAEtB,EAAM,OAAS,EACf,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,KAAQ,CACxB,GAAI,IAAS,EAAK,QAClB,EAAO,EACP,EAEE,GAAM,EAAM,EAAO,KAEf,EAAM,MAAQ,GACb,EAAM,OAAS,OAClB,GAAM,KAAK,MAAQ,OAAO,aAAa,UAElC,GAAO,EAAO,GAOvB,GALI,EAAM,MAAQ,KAChB,GAAM,MAAQ,GAAQ,EAAM,MAAO,EAAO,EAAM,IAElD,GAAQ,EACR,GAAQ,EACJ,EAAO,YAER,AAAI,GAAM,MACb,GAAM,KAAK,KAAO,MAEpB,EAAM,OAAS,EACf,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,KAAQ,CACxB,GAAI,IAAS,EAAK,QAClB,EAAO,EACP,EACE,GAAM,EAAM,EAAO,KAEf,EAAM,MAAQ,GACb,EAAM,OAAS,OAClB,GAAM,KAAK,SAAW,OAAO,aAAa,UAErC,GAAO,EAAO,GAMvB,GALI,EAAM,MAAQ,KAChB,GAAM,MAAQ,GAAQ,EAAM,MAAO,EAAO,EAAM,IAElD,GAAQ,EACR,GAAQ,EACJ,EAAO,YAER,AAAI,GAAM,MACb,GAAM,KAAK,QAAU,MAEvB,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,IAAQ,CAExB,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,GAAI,IAAU,GAAM,MAAQ,OAAS,CACnC,EAAK,IAAM,sBACX,EAAM,KAAO,GACb,MAGF,EAAO,EACP,EAAO,EAGT,AAAI,EAAM,MACR,GAAM,KAAK,KAAS,EAAM,OAAS,EAAK,EACxC,EAAM,KAAK,KAAO,IAEpB,EAAK,MAAQ,EAAM,MAAQ,EAC3B,EAAM,KAAO,GACb,UACG,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,EAAK,MAAQ,EAAM,MAAQ,GAAQ,GAEnC,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,WAAa,EAErB,SAAK,SAAW,EAChB,EAAK,UAAY,EACjB,EAAK,QAAU,EACf,EAAK,SAAW,EAChB,EAAM,KAAO,EACb,EAAM,KAAO,EAEN,GAET,EAAK,MAAQ,EAAM,MAAQ,EAC3B,EAAM,KAAO,OAEV,IACH,GAAI,IAAU,IAAW,IAAU,GAAW,YAE3C,IACH,GAAI,EAAM,KAAM,CAEd,KAAU,EAAO,EACjB,GAAQ,EAAO,EAEf,EAAM,KAAO,GACb,MAGF,KAAO,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EASV,OANA,EAAM,KAAQ,EAAO,EAErB,KAAU,EACV,GAAQ,EAGC,EAAO,OACT,GAGH,EAAM,KAAO,GACb,UACG,GAKH,GAJA,GAAY,GAGZ,EAAM,KAAO,GACT,IAAU,GAAS,CAErB,KAAU,EACV,GAAQ,EAER,QAEF,UACG,GAGH,EAAM,KAAO,GACb,UACG,GACH,EAAK,IAAM,qBACX,EAAM,KAAO,GAGjB,KAAU,EACV,GAAQ,EAER,UACG,IAMH,IAJA,KAAU,EAAO,EACjB,GAAQ,EAAO,EAGR,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,GAAK,GAAO,QAAc,KAAS,GAAM,OAAS,CAChD,EAAK,IAAM,+BACX,EAAM,KAAO,GACb,MAUF,GARA,EAAM,OAAS,EAAO,MAItB,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,GACT,IAAU,GAAW,YAEtB,IACH,EAAM,KAAO,OAEV,IAEH,GADA,EAAO,EAAM,OACT,EAAM,CAGR,GAFI,EAAO,GAAQ,GAAO,GACtB,EAAO,GAAQ,GAAO,GACtB,IAAS,EAAK,QAElB,EAAO,IAAI,EAAM,SAAS,EAAM,EAAO,GAAO,GAE9C,GAAQ,EACR,GAAQ,EACR,GAAQ,EACR,GAAO,EACP,EAAM,QAAU,EAChB,MAGF,EAAM,KAAO,GACb,UACG,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAmBV,GAhBA,EAAM,KAAQ,GAAO,IAAmB,IAExC,KAAU,EACV,GAAQ,EAER,EAAM,MAAS,GAAO,IAAmB,EAEzC,KAAU,EACV,GAAQ,EAER,EAAM,MAAS,GAAO,IAAmB,EAEzC,KAAU,EACV,GAAQ,EAGJ,EAAM,KAAO,KAAO,EAAM,MAAQ,GAAI,CACxC,EAAK,IAAM,sCACX,EAAM,KAAO,GACb,MAIF,EAAM,KAAO,EACb,EAAM,KAAO,OAEV,IACH,KAAO,EAAM,KAAO,EAAM,OAAO,CAE/B,KAAO,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,EAAM,KAAK,GAAM,EAAM,SAAY,EAAO,EAE1C,KAAU,EACV,GAAQ,EAGV,KAAO,EAAM,KAAO,IAClB,EAAM,KAAK,GAAM,EAAM,SAAW,EAapC,GAPA,EAAM,QAAU,EAAM,OACtB,EAAM,QAAU,EAEhB,EAAO,CAAE,KAAM,EAAM,SACrB,GAAM,GAAS,GAAO,EAAM,KAAM,EAAG,GAAI,EAAM,QAAS,EAAG,EAAM,KAAM,GACvE,EAAM,QAAU,EAAK,KAEjB,GAAK,CACP,EAAK,IAAM,2BACX,EAAM,KAAO,GACb,MAGF,EAAM,KAAO,EACb,EAAM,KAAO,OAEV,IACH,KAAO,EAAM,KAAO,EAAM,KAAO,EAAM,OAAO,CAC5C,KACE,EAAO,EAAM,QAAQ,EAAS,IAAK,EAAM,SAAW,GACpD,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEb,KAAc,IANZ,CAQP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,GAAI,EAAW,GAEb,KAAU,EACV,GAAQ,EAER,EAAM,KAAK,EAAM,QAAU,MAExB,CACH,GAAI,IAAa,GAAI,CAGnB,IADA,EAAI,EAAY,EACT,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAOV,GAHA,KAAU,EACV,GAAQ,EAEJ,EAAM,OAAS,EAAG,CACpB,EAAK,IAAM,4BACX,EAAM,KAAO,GACb,MAEF,EAAM,EAAM,KAAK,EAAM,KAAO,GAC9B,EAAO,EAAK,GAAO,GAEnB,KAAU,EACV,GAAQ,UAGD,IAAa,GAAI,CAGxB,IADA,EAAI,EAAY,EACT,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAIV,KAAU,EACV,GAAQ,EAER,EAAM,EACN,EAAO,EAAK,GAAO,GAEnB,KAAU,EACV,GAAQ,MAGL,CAGH,IADA,EAAI,EAAY,EACT,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAIV,KAAU,EACV,GAAQ,EAER,EAAM,EACN,EAAO,GAAM,GAAO,KAEpB,KAAU,EACV,GAAQ,EAGV,GAAI,EAAM,KAAO,EAAO,EAAM,KAAO,EAAM,MAAO,CAChD,EAAK,IAAM,4BACX,EAAM,KAAO,GACb,MAEF,KAAO,KACL,EAAM,KAAK,EAAM,QAAU,GAMjC,GAAI,EAAM,OAAS,GAAO,MAG1B,GAAI,EAAM,KAAK,OAAS,EAAG,CACzB,EAAK,IAAM,uCACX,EAAM,KAAO,GACb,MAeF,GATA,EAAM,QAAU,EAEhB,EAAO,CAAE,KAAM,EAAM,SACrB,GAAM,GAAS,GAAM,EAAM,KAAM,EAAG,EAAM,KAAM,EAAM,QAAS,EAAG,EAAM,KAAM,GAG9E,EAAM,QAAU,EAAK,KAGjB,GAAK,CACP,EAAK,IAAM,8BACX,EAAM,KAAO,GACb,MAcF,GAXA,EAAM,SAAW,EAGjB,EAAM,SAAW,EAAM,QACvB,EAAO,CAAE,KAAM,EAAM,UACrB,GAAM,GAAS,GAAO,EAAM,KAAM,EAAM,KAAM,EAAM,MAAO,EAAM,SAAU,EAAG,EAAM,KAAM,GAG1F,EAAM,SAAW,EAAK,KAGlB,GAAK,CACP,EAAK,IAAM,wBACX,EAAM,KAAO,GACb,MAIF,GADA,EAAM,KAAO,GACT,IAAU,GAAW,YAEtB,IACH,EAAM,KAAO,OAEV,IACH,GAAI,GAAQ,GAAK,GAAQ,IAAK,CAE5B,EAAK,SAAW,EAChB,EAAK,UAAY,EACjB,EAAK,QAAU,EACf,EAAK,SAAW,EAChB,EAAM,KAAO,EACb,EAAM,KAAO,EAEb,GAAQ,EAAM,GAEd,EAAM,EAAK,SACX,EAAS,EAAK,OACd,EAAO,EAAK,UACZ,EAAO,EAAK,QACZ,EAAQ,EAAK,MACb,EAAO,EAAK,SACZ,EAAO,EAAM,KACb,EAAO,EAAM,KAGT,EAAM,OAAS,IACjB,GAAM,KAAO,IAEf,MAGF,IADA,EAAM,KAAO,EAEX,EAAO,EAAM,QAAQ,EAAS,IAAK,EAAM,SAAW,GACpD,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEd,KAAa,IANV,CAQP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,GAAI,GAAY,GAAU,MAAU,EAAG,CAIrC,IAHA,EAAY,EACZ,EAAU,EACV,GAAW,EAET,EAAO,EAAM,QAAQ,GACX,IAAS,IAAM,EAAY,GAAY,IAAoC,IACrF,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEb,IAAY,GAAc,IAPxB,CASP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAIV,KAAU,EACV,GAAQ,EAER,EAAM,MAAQ,EAQhB,GALA,KAAU,EACV,GAAQ,EAER,EAAM,MAAQ,EACd,EAAM,OAAS,EACX,IAAY,EAAG,CAIjB,EAAM,KAAO,GACb,MAEF,GAAI,EAAU,GAAI,CAEhB,EAAM,KAAO,GACb,EAAM,KAAO,GACb,MAEF,GAAI,EAAU,GAAI,CAChB,EAAK,IAAM,8BACX,EAAM,KAAO,GACb,MAEF,EAAM,MAAQ,EAAU,GACxB,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAO,CAGf,IADA,EAAI,EAAM,MACH,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,EAAM,QAAU,EAAS,IAAK,EAAM,OAAS,EAE7C,KAAU,EAAM,MAChB,GAAQ,EAAM,MAEd,EAAM,MAAQ,EAAM,MAGtB,EAAM,IAAM,EAAM,OAClB,EAAM,KAAO,OAEV,IACH,KACE,EAAO,EAAM,SAAS,EAAS,IAAK,EAAM,UAAY,GACtD,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEb,KAAc,IANZ,CAQP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,GAAK,GAAU,MAAU,EAAG,CAI1B,IAHA,EAAY,EACZ,EAAU,EACV,GAAW,EAET,EAAO,EAAM,SAAS,GACZ,IAAS,IAAM,EAAY,GAAY,IAAoC,IACrF,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEb,IAAY,GAAc,IAPxB,CASP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAIV,KAAU,EACV,GAAQ,EAER,EAAM,MAAQ,EAOhB,GAJA,KAAU,EACV,GAAQ,EAER,EAAM,MAAQ,EACV,EAAU,GAAI,CAChB,EAAK,IAAM,wBACX,EAAM,KAAO,GACb,MAEF,EAAM,OAAS,EACf,EAAM,MAAS,EAAW,GAC1B,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAO,CAGf,IADA,EAAI,EAAM,MACH,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,EAAM,QAAU,EAAS,IAAK,EAAM,OAAS,EAE7C,KAAU,EAAM,MAChB,GAAQ,EAAM,MAEd,EAAM,MAAQ,EAAM,MAGtB,GAAI,EAAM,OAAS,EAAM,KAAM,CAC7B,EAAK,IAAM,gCACX,EAAM,KAAO,GACb,MAIF,EAAM,KAAO,OAEV,IACH,GAAI,IAAS,EAAK,QAElB,GADA,EAAO,EAAO,EACV,EAAM,OAAS,EAAM,CAEvB,GADA,EAAO,EAAM,OAAS,EAClB,EAAO,EAAM,OACX,EAAM,KAAM,CACd,EAAK,IAAM,gCACX,EAAM,KAAO,GACb,MAkBJ,AAAI,EAAO,EAAM,MACf,IAAQ,EAAM,MACd,EAAO,EAAM,MAAQ,GAGrB,EAAO,EAAM,MAAQ,EAEnB,EAAO,EAAM,QAAU,GAAO,EAAM,QACxC,EAAc,EAAM,WAGpB,GAAc,EACd,EAAO,EAAM,EAAM,OACnB,EAAO,EAAM,OAEf,AAAI,EAAO,GAAQ,GAAO,GAC1B,GAAQ,EACR,EAAM,QAAU,EAChB,EACE,GAAO,KAAS,EAAY,WACrB,EAAE,GACX,AAAI,EAAM,SAAW,GAAK,GAAM,KAAO,IACvC,UACG,IACH,GAAI,IAAS,EAAK,QAClB,EAAO,KAAS,EAAM,OACtB,IACA,EAAM,KAAO,GACb,UACG,IACH,GAAI,EAAM,KAAM,CAEd,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IAEA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAcV,GAXA,GAAQ,EACR,EAAK,WAAa,EAClB,EAAM,OAAS,EACX,GACF,GAAK,MAAQ,EAAM,MAEd,EAAM,MAAQ,GAAQ,EAAM,MAAO,EAAQ,EAAM,EAAM,GAAQ,GAAU,EAAM,MAAO,EAAQ,EAAM,EAAM,IAGjH,EAAO,EAEF,GAAM,MAAQ,EAAO,GAAQ,MAAW,EAAM,MAAO,CACxD,EAAK,IAAM,uBACX,EAAM,KAAO,GACb,MAGF,EAAO,EACP,EAAO,EAIT,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,EAAM,MAAO,CAE7B,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,GAAI,IAAU,GAAM,MAAQ,YAAa,CACvC,EAAK,IAAM,yBACX,EAAM,KAAO,GACb,MAGF,EAAO,EACP,EAAO,EAIT,EAAM,KAAO,OAEV,IACH,GAAM,GACN,YACG,IACH,GAAM,GACN,YACG,IACH,MAAO,QACJ,YAGH,MAAO,IAcb,SAAK,SAAW,EAChB,EAAK,UAAY,EACjB,EAAK,QAAU,EACf,EAAK,SAAW,EAChB,EAAM,KAAO,EACb,EAAM,KAAO,EAGT,GAAM,OAAU,IAAS,EAAK,WAAa,EAAM,KAAO,IACvC,GAAM,KAAO,IAAS,IAAU,MAC/C,GAAa,EAAM,EAAK,OAAQ,EAAK,SAAU,EAAO,EAAK,WAEjE,GAAO,EAAK,SACZ,GAAQ,EAAK,UACb,EAAK,UAAY,EACjB,EAAK,WAAa,EAClB,EAAM,OAAS,EACX,EAAM,MAAQ,GAChB,GAAK,MAAQ,EAAM,MAChB,EAAM,MAAQ,GAAQ,EAAM,MAAO,EAAQ,EAAM,EAAK,SAAW,GAAQ,GAAU,EAAM,MAAO,EAAQ,EAAM,EAAK,SAAW,IAEnI,EAAK,UAAY,EAAM,KAAQ,GAAM,KAAO,GAAK,GAC9B,GAAM,OAAS,GAAO,IAAM,GAC5B,GAAM,OAAS,IAAQ,EAAM,OAAS,GAAQ,IAAM,GACjE,KAAQ,GAAK,IAAS,GAAM,IAAU,KAAe,KAAQ,IACjE,IAAM,IAED,IAIH,GAAa,AAAC,GAAS,CAE3B,GAAI,CAAC,GAAQ,CAAC,EAAK,MACjB,MAAO,IAGT,GAAI,GAAQ,EAAK,MACjB,MAAI,GAAM,QACR,GAAM,OAAS,MAEjB,EAAK,MAAQ,KACN,IAIH,GAAmB,CAAC,EAAM,IAAS,CAGvC,GAAI,CAAC,GAAQ,CAAC,EAAK,MAAS,MAAO,IACnC,GAAM,GAAQ,EAAK,MACnB,MAAK,GAAM,KAAO,IAAO,EAAY,GAGrC,GAAM,KAAO,EACb,EAAK,KAAO,GACL,KAIH,GAAuB,CAAC,EAAM,IAAe,CACjD,GAAM,GAAa,EAAW,OAE1B,EACA,EACA,EAMJ,MAHI,CAAC,GAAwB,CAAC,EAAK,OACnC,GAAQ,EAAK,MAET,EAAM,OAAS,GAAK,EAAM,OAAS,IAC9B,GAIL,EAAM,OAAS,IACjB,GAAS,EAET,EAAS,GAAU,EAAQ,EAAY,EAAY,GAC/C,IAAW,EAAM,OACZ,GAKX,GAAM,GAAa,EAAM,EAAY,EAAY,GAC7C,EACF,GAAM,KAAO,GACN,IAET,GAAM,SAAW,EAEV,MAIL,GAAiB,GACjB,GAAkB,GAClB,GAAqB,GACrB,GAAgB,GAChB,GAAiB,GACjB,GAAc,GACd,GAAe,GACf,GAAqB,GACrB,GAAyB,GACzB,GAAc,qCAYd,GAAc,CACjB,aAAc,GACd,cAAe,GACf,iBAAkB,GAClB,YAAa,GACb,aAAc,GACd,QAAS,GACT,WAAY,GACZ,iBAAkB,GAClB,qBAAsB,GACtB,YAAa,IAsBd,aAAoB,CAElB,KAAK,KAAa,EAElB,KAAK,KAAa,EAElB,KAAK,OAAa,EAElB,KAAK,GAAa,EAElB,KAAK,MAAa,KAElB,KAAK,UAAa,EAWlB,KAAK,KAAa,GAIlB,KAAK,QAAa,GAIlB,KAAK,KAAa,EAElB,KAAK,KAAa,GAGpB,GAAI,IAAW,GAET,GAAW,OAAO,UAAU,SAK5B,CACJ,cAAY,YACZ,QAAM,gBAAc,eAAa,kBAAgB,gBAAc,gBAC7D,GAkFJ,YAAmB,EAAS,CAC1B,KAAK,QAAU,GAAO,OAAO,CAC3B,UAAW,KAAO,GAClB,WAAY,GACZ,GAAI,IACH,GAAW,IAEd,GAAM,GAAM,KAAK,QAIjB,AAAI,EAAI,KAAQ,EAAI,YAAc,GAAO,EAAI,WAAa,IACxD,GAAI,WAAa,CAAC,EAAI,WAClB,EAAI,aAAe,GAAK,GAAI,WAAa,MAI1C,EAAI,YAAc,GAAO,EAAI,WAAa,IAC3C,CAAE,IAAW,EAAQ,aACvB,GAAI,YAAc,IAKf,EAAI,WAAa,IAAQ,EAAI,WAAa,IAGxC,GAAI,WAAa,KAAQ,GAC5B,GAAI,YAAc,IAItB,KAAK,IAAS,EACd,KAAK,IAAS,GACd,KAAK,MAAS,GACd,KAAK,OAAS,GAEd,KAAK,KAAS,GAAI,IAClB,KAAK,KAAK,UAAY,EAEtB,GAAI,GAAU,GAAY,aACxB,KAAK,KACL,EAAI,YAGN,GAAI,IAAW,GACb,KAAM,IAAI,OAAM,GAAS,IAQ3B,GALA,KAAK,OAAS,GAAI,IAElB,GAAY,iBAAiB,KAAK,KAAM,KAAK,QAGzC,EAAI,YAEN,CAAI,MAAO,GAAI,YAAe,SAC5B,EAAI,WAAa,GAAQ,WAAW,EAAI,YAC/B,GAAS,KAAK,EAAI,cAAgB,wBAC3C,GAAI,WAAa,GAAI,YAAW,EAAI,aAElC,EAAI,KACN,GAAS,GAAY,qBAAqB,KAAK,KAAM,EAAI,YACrD,IAAW,KACb,KAAM,IAAI,OAAM,GAAS,IA+BjC,GAAU,UAAU,KAAO,SAAU,EAAM,EAAY,CACrD,GAAM,GAAO,KAAK,KACZ,EAAY,KAAK,QAAQ,UACzB,EAAa,KAAK,QAAQ,WAC5B,EAAQ,EAAa,EAEzB,GAAI,KAAK,MAAO,MAAO,GAevB,IAbA,AAAI,IAAe,CAAC,CAAC,EAAY,EAAc,EAC1C,EAAc,IAAe,GAAO,GAAW,GAGpD,AAAI,GAAS,KAAK,KAAU,uBAC1B,EAAK,MAAQ,GAAI,YAAW,GAE5B,EAAK,MAAQ,EAGf,EAAK,QAAU,EACf,EAAK,SAAW,EAAK,MAAM,SAElB,CAqBP,IApBI,EAAK,YAAc,GACrB,GAAK,OAAS,GAAI,YAAW,GAC7B,EAAK,SAAW,EAChB,EAAK,UAAY,GAGnB,EAAS,GAAY,QAAQ,EAAM,GAE/B,IAAW,IAAe,GAC5B,GAAS,GAAY,qBAAqB,EAAM,GAEhD,AAAI,IAAW,GACb,EAAS,GAAY,QAAQ,EAAM,GAC1B,IAAW,IAEpB,GAAS,KAKN,EAAK,SAAW,GAChB,IAAW,IACX,EAAK,MAAM,KAAO,GAClB,EAAK,EAAK,WAAa,GAE5B,GAAY,aAAa,GACzB,EAAS,GAAY,QAAQ,EAAM,GAGrC,OAAQ,OACD,QACA,QACA,QACA,IACH,YAAK,MAAM,GACX,KAAK,MAAQ,GACN,GAOX,GAFA,EAAiB,EAAK,UAElB,EAAK,UACH,GAAK,YAAc,GAAK,IAAW,IAErC,GAAI,KAAK,QAAQ,KAAO,SAAU,CAEhC,GAAI,GAAgB,GAAQ,WAAW,EAAK,OAAQ,EAAK,UAErD,EAAO,EAAK,SAAW,EACvB,EAAU,GAAQ,WAAW,EAAK,OAAQ,GAG9C,EAAK,SAAW,EAChB,EAAK,UAAY,EAAY,EACzB,GAAM,EAAK,OAAO,IAAI,EAAK,OAAO,SAAS,EAAe,EAAgB,GAAO,GAErF,KAAK,OAAO,OAGZ,MAAK,OAAO,EAAK,OAAO,SAAW,EAAK,SAAW,EAAK,OAAS,EAAK,OAAO,SAAS,EAAG,EAAK,WAMpG,GAAI,MAAW,IAAQ,IAAmB,GAG1C,IAAI,IAAW,GACb,SAAS,GAAY,WAAW,KAAK,MACrC,KAAK,MAAM,GACX,KAAK,MAAQ,GACN,GAGT,GAAI,EAAK,WAAa,EAAG,OAG3B,MAAO,IAYT,GAAU,UAAU,OAAS,SAAU,EAAO,CAC5C,KAAK,OAAO,KAAK,IAanB,GAAU,UAAU,MAAQ,SAAU,EAAQ,CAE5C,AAAI,IAAW,IACb,CAAI,KAAK,QAAQ,KAAO,SACtB,KAAK,OAAS,KAAK,OAAO,KAAK,IAE/B,KAAK,OAAS,GAAO,cAAc,KAAK,SAG5C,KAAK,OAAS,GACd,KAAK,IAAM,EACX,KAAK,IAAM,KAAK,KAAK,KA2CvB,YAAmB,EAAO,EAAS,CACjC,GAAM,GAAW,GAAI,IAAU,GAK/B,GAHA,EAAS,KAAK,GAGV,EAAS,IAAK,KAAM,GAAS,KAAO,GAAS,EAAS,KAE1D,MAAO,GAAS,OAYlB,YAAsB,EAAO,EAAS,CACpC,SAAU,GAAW,GACrB,EAAQ,IAAM,GACP,GAAU,EAAO,GAc1B,GAAI,IAAc,GACd,GAAY,GACZ,GAAiB,GACjB,GAAW,GACX,GAAY,GAEZ,GAAc,CACjB,QAAS,GACT,QAAS,GACT,WAAY,GACZ,OAAQ,GACR,UAAW,IAKZ,GAAM,CAAE,WAAS,WAAS,cAAY,WAAW,GAQjD,GAAI,IAAY,GCjiNT,GAAM,IAAe,CAAC,IAAK,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAEpD,GAAqB,GAC3B,OAAS,GAAI,EAAG,EAAI,IAAK,IAAK,CAC5B,GAAI,GAAI,EACR,OAAS,GAAI,EAAG,EAAI,EAAG,IACrB,AAAI,EAAI,EACN,EAAI,WAAc,IAAM,EAExB,EAAI,IAAM,EAGd,GAAS,GAAK,EAGhB,GAAM,IAAa,WACnB,YACE,EACA,EACA,EAAc,CAEd,GAAI,GAAI,EACR,OAAS,GAAI,EAAG,EAAI,EAAQ,IAC1B,EAAI,GAAU,GAAI,EAAK,IAAM,KAAS,IAAM,EAE9C,MAAO,GAGH,YAAc,EAAkB,EAAc,CAClD,MAAQ,IAAU,GAAY,EAAM,GAAU,MAAgB,EC7BhE,GAAY,IAAZ,AAAA,UAAY,EAAS,CACnB,EAAA,EAAA,QAAA,IAAA,UACA,EAAA,EAAA,UAAA,GAAA,YACA,EAAA,EAAA,WAAA,GAAA,aACA,EAAA,EAAA,eAAA,GAAA,iBACA,EAAA,EAAA,gBAAA,GAAA,kBACA,EAAA,EAAA,iBAAA,GAAA,qBANU,IAAA,IAAS,KASrB,GAAY,IAAZ,AAAA,UAAY,EAAiB,CAC3B,EAAA,EAAA,QAAA,IAAA,UACA,EAAA,EAAA,QAAA,GAAA,YAFU,IAAA,IAAiB,KAK7B,GAAY,IAAZ,AAAA,UAAY,EAAY,CACtB,EAAA,EAAA,QAAA,IAAA,UACA,EAAA,EAAA,SAAA,GAAA,aAFU,IAAA,IAAY,KAKxB,GAAY,IAAZ,AAAA,UAAY,EAAe,CACzB,EAAA,EAAA,QAAA,IAAA,UACA,EAAA,EAAA,aAAA,GAAA,eACA,EAAA,EAAA,MAAA,GAAA,UAHU,IAAA,IAAe,KCA3B,GAAM,IAAQ,GAAI,YAAW,GACvB,GAAO,KAEP,GAAS,GAAI,aAAY,CAAC,MAC1B,GAAQ,GAAI,YAAW,GAAO,QAC9B,GAAmB,GAAM,KAAO,IAEtC,gBAAwC,GAAQ,CAY9C,YAAmB,EAAwB,EAA8B,GAAE,CACzE,MAAM,GACN,GAAM,CAAE,WAAW,IAAU,EAC7B,KAAK,UAAY,EACjB,KAAK,UAAY,GAAI,IACrB,KAAK,KAAO,CACV,MAAO,GACP,OAAQ,GACR,SAAU,GACV,KAAM,GAAI,YAAW,GACrB,MAAO,EACP,KAAM,IAER,KAAK,KAAO,GACZ,KAAK,YAAc,GACnB,KAAK,SAAW,GAChB,KAAK,mBAAqB,GAAkB,QAC5C,KAAK,cAAgB,GAAa,QAClC,KAAK,iBAAmB,GAAgB,QACxC,KAAK,WAAa,GAGlB,KAAK,eAGA,QAAM,CAEX,IADA,KAAK,kBACE,CAAC,KAAK,MACX,KAAK,cAEP,YAAK,cACE,KAAK,KAIN,iBAAe,CACrB,OAAS,GAAI,EAAG,EAAI,GAAa,OAAQ,IACvC,GAAI,KAAK,cAAgB,GAAa,GACpC,KAAM,IAAI,OACR,gCAAgC,eAAe,GAAa,OAO5D,aAAW,CACjB,GAAM,GAAS,KAAK,aACd,EAAO,KAAK,UAAU,GACtB,EAAS,KAAK,OACpB,OAAQ,OAED,OACH,KAAK,aACL,UACG,OACH,KAAK,WAAW,GAChB,UACG,OACH,KAAK,WAAW,GAChB,UACG,OACH,KAAK,KAAO,GACZ,UAEG,OACH,KAAK,WAAW,GAChB,UACG,OACH,KAAK,WAAW,GAChB,UACG,OACH,KAAK,aACL,cAEA,KAAK,KAAK,GACV,MAEJ,GAAI,KAAK,OAAS,IAAW,EAC3B,KAAM,IAAI,OAAM,wCAAwC,KAE1D,GAAI,KAAK,UAAW,CAClB,GAAM,GAAc,KAAK,aACnB,EAAY,EAAS,EACrB,EAAY,GAChB,GAAI,YACF,KAAK,OACL,KAAK,WAAa,KAAK,OAAS,EAAY,EAC5C,GAEF,GAEF,GAAI,IAAc,EAChB,KAAM,IAAI,OACR,0BAA0B,eAAkB,YAAsB,SAItE,MAAK,KAAK,GAKN,YAAU,CAChB,GAAM,GAAQ,KAAK,KACnB,EAAM,MAAQ,KAAK,aACnB,EAAM,OAAS,KAAK,aACpB,EAAM,MAAQ,GAAc,KAAK,aAEjC,GAAM,GAAuB,KAAK,YAClC,KAAK,WAAa,EAClB,GAAI,GACJ,OAAQ,OACD,IAAU,UACb,EAAW,EACX,UACG,IAAU,WACb,EAAW,EACX,UACG,IAAU,eACb,EAAW,EACX,UACG,IAAU,gBACb,EAAW,EACX,UACG,IAAU,iBACb,EAAW,EACX,cAEA,KAAM,IAAI,OAAM,uBAAuB,KAK3C,GAHA,KAAK,KAAK,SAAW,EAErB,KAAK,mBAAqB,KAAK,YAC3B,KAAK,qBAAuB,GAAkB,QAChD,KAAM,IAAI,OACR,mCAAmC,KAAK,sBAI5C,KAAK,cAAgB,KAAK,YAC1B,KAAK,iBAAmB,KAAK,YAIvB,WAAW,EAAc,CAC/B,GAAI,EAAS,GAAM,EACjB,KAAM,IAAI,YACR,kDAAkD,KAGtD,GAAM,GAAI,EAAS,EACnB,KAAK,YAAc,GACnB,GAAM,GAAyB,GAC/B,KAAK,SAAW,EAChB,OAAS,GAAI,EAAG,EAAI,EAAG,IACrB,EAAQ,KAAK,CAAC,KAAK,YAAa,KAAK,YAAa,KAAK,cAKnD,WAAW,EAAc,CAC/B,KAAK,UAAU,KACb,GAAI,YAAW,KAAK,OAAQ,KAAK,OAAS,KAAK,WAAY,IAE7D,KAAK,KAAK,GAIJ,WAAW,EAAc,CAE/B,GAAI,KAAK,aAAe,EAAG,CACzB,GAAI,EAAS,KAAK,SAAS,OACzB,KAAM,IAAI,OACR,wEAAwE,QAAa,KAAK,SAAS,WAGvG,GAAI,GAAI,EACR,KAAO,EAAI,EAAQ,IAAK,CACtB,GAAM,GAAQ,KAAK,WACnB,KAAK,SAAS,GAAG,KAAK,GAExB,KAAO,EAAI,KAAK,SAAS,OAAQ,IAC/B,KAAK,SAAS,GAAG,KAAK,MAMpB,WAAW,EAAc,CAC/B,GAAI,GAAU,GACV,EACJ,KAAQ,GAAO,KAAK,cAAgB,IAClC,GAAW,EAEb,KAAK,KAAK,KAAK,GAAW,KAAK,UAAU,EAAS,EAAQ,OAAS,GAI7D,YAAU,CAChB,GAAM,GAAO,KAAK,aACZ,EAAO,KAAK,aACZ,EAAgB,KAAK,WAC3B,KAAK,KAAK,WAAa,CAAE,EAAG,EAAM,EAAG,EAAM,KAAM,GAG3C,aAAW,CACjB,GAAI,KAAK,UAAU,IACjB,KAAM,IAAI,OACR,uCAAuC,KAAK,UAAU,OAG1D,GAAM,GAAO,KAAK,UAAU,OAE5B,GAAI,KAAK,gBAAkB,GAAa,SACtC,KAAM,IAAI,OAAM,iBAAiB,KAAK,+BAGxC,GAAI,KAAK,mBAAqB,GAAgB,aAC5C,KAAK,oBAAoB,OAEzB,MAAM,IAAI,OACR,oBAAoB,KAAK,kCAKvB,oBAAoB,EAAkB,CAC5C,GAAM,GAAS,KAAK,KAAK,OACnB,EAAiB,KAAK,KAAK,SAAW,KAAK,KAAK,MAAS,EACzD,EAAe,KAAK,KAAK,MAAQ,EACjC,EAAU,GAAI,YAAW,KAAK,KAAK,OAAS,GAE9C,EAAW,GACX,EAAS,EACT,EACA,EAEJ,OAAS,GAAI,EAAG,EAAI,EAAQ,IAAK,CAG/B,OAFA,EAAc,EAAK,SAAS,EAAS,EAAG,EAAS,EAAI,GACrD,EAAU,EAAQ,SAAS,EAAI,EAAe,GAAI,GAAK,GAC/C,EAAK,QACN,GACH,GAAa,EAAa,EAAS,GACnC,UACG,GACH,GAAY,EAAa,EAAS,EAAc,GAChD,UACG,GACH,GAAW,EAAa,EAAS,EAAU,GAC3C,UACG,GACH,GACE,EACA,EACA,EACA,EACA,GAEF,UACG,GACH,GACE,EACA,EACA,EACA,EACA,GAEF,cAEA,KAAM,IAAI,OAAM,uBAAuB,EAAK,MAEhD,EAAW,EACX,GAAU,EAAe,EAO3B,GAJI,KAAK,aACP,MAAK,KAAK,QAAU,KAAK,UAGvB,KAAK,KAAK,QAAU,GAAI,CAC1B,GAAM,GAAa,GAAI,aAAY,EAAQ,QAC3C,GAAI,GACF,OAAS,GAAI,EAAG,EAAI,EAAW,OAAQ,IAErC,EAAW,GAAK,GAAO,EAAW,IAGtC,KAAK,KAAK,KAAO,MAEjB,MAAK,KAAK,KAAO,IAKvB,YACE,EACA,EACA,EAAoB,CAEpB,OAAS,GAAI,EAAG,EAAI,EAAc,IAChC,EAAQ,GAAK,EAAY,GAI7B,YACE,EACA,EACA,EACA,EAAqB,CAErB,GAAI,GAAI,EACR,KAAO,EAAI,EAAe,IAExB,EAAQ,GAAK,EAAY,GAE3B,KAAO,EAAI,EAAc,IACvB,EAAQ,GAAM,EAAY,GAAK,EAAQ,EAAI,GAAkB,IAIjE,YACE,EACA,EACA,EACA,EAAoB,CAEpB,GAAI,GAAI,EACR,GAAI,EAAS,SAAW,EAEtB,KAAO,EAAI,EAAc,IACvB,EAAQ,GAAK,EAAY,OAG3B,MAAO,EAAI,EAAc,IACvB,EAAQ,GAAM,EAAY,GAAK,EAAS,GAAM,IAKpD,YACE,EACA,EACA,EACA,EACA,EAAqB,CAErB,GAAI,GAAI,EACR,GAAI,EAAS,SAAW,EAAG,CACzB,KAAO,EAAI,EAAe,IACxB,EAAQ,GAAK,EAAY,GAE3B,KAAO,EAAI,EAAc,IACvB,EAAQ,GAAM,EAAY,GAAM,GAAQ,EAAI,IAAkB,GAAM,QAEjE,CACL,KAAO,EAAI,EAAe,IACxB,EAAQ,GAAM,EAAY,GAAM,GAAS,IAAM,GAAM,IAEvD,KAAO,EAAI,EAAc,IACvB,EAAQ,GACL,EAAY,GAAO,GAAQ,EAAI,GAAiB,EAAS,IAAO,GACjE,KAKR,YACE,EACA,EACA,EACA,EACA,EAAqB,CAErB,GAAI,GAAI,EACR,GAAI,EAAS,SAAW,EAAG,CACzB,KAAO,EAAI,EAAe,IACxB,EAAQ,GAAK,EAAY,GAE3B,KAAO,EAAI,EAAc,IACvB,EAAQ,GAAM,EAAY,GAAK,EAAQ,EAAI,GAAkB,QAE1D,CACL,KAAO,EAAI,EAAe,IACxB,EAAQ,GAAM,EAAY,GAAK,EAAS,GAAM,IAEhD,KAAO,EAAI,EAAc,IACvB,EAAQ,GACL,EAAY,GACX,GACE,EAAQ,EAAI,GACZ,EAAS,GACT,EAAS,EAAI,IAEjB,KAKR,YAAwB,EAAW,EAAW,EAAS,CACrD,GAAM,GAAI,EAAI,EAAI,EACZ,EAAK,KAAK,IAAI,EAAI,GAClB,EAAK,KAAK,IAAI,EAAI,GAClB,EAAK,KAAK,IAAI,EAAI,GACxB,MAAI,IAAM,GAAM,GAAM,EAAW,EACxB,GAAM,EAAW,EACd,EAGd,YAAgB,EAAW,CACzB,MAAS,GAAM,MAAS,EAAO,GAAO,EAAK,IAG7C,YAAuB,EAAa,CAClC,GACE,IAAU,GACV,IAAU,GACV,IAAU,GACV,IAAU,GACV,IAAU,GAEV,KAAM,IAAI,OAAM,sBAAsB,KAExC,MAAO,GCnbT,GAAY,IAAZ,AAAA,UAAY,EAAuB,CAIjC,EAAA,EAAA,QAAA,GAAA,UAIA,EAAA,EAAA,MAAA,GAAA,UARU,IAAA,IAAuB,KCdnC,YACE,EACA,EAA4B,CAG5B,MAAO,AADS,IAAI,IAAW,EAAM,GACtB,SChBjB,OAAoB,SAOpB,YAAoB,EAAO,CACvB,GAAI,EAAQ,GAAK,EAAQ,MACrB,KAAM,IAAI,OAAM,uDAIjB,YAAmB,EAA2B,CACjD,MAAO,GAAO,iBAAqB,aAGhC,YAAkB,EAA0B,CAC/C,MAAO,GAAO,eAAmB,OAG9B,YAAc,CAGjB,YAAY,EAAmC,CAE3C,GAAI,MAAO,IAAQ,SACf,GAAW,GACX,KAAK,OAAS,GAAI,aAAY,WACvB,YAAe,aACtB,KAAK,OAAS,GAAI,aAAY,WACvB,GAAQ,GACf,KAAK,OAAS,GAAI,aAAY,EAAI,IAAI,SAEtC,MAAM,IAAI,OAAM,+BAExB,IAAI,EAAe,CACf,MAAO,MAAK,OAAO,GAEvB,SAAU,CACN,MAAO,OAAM,KAAK,KAAK,QAAQ,IAAI,AAAC,GAAS,GAAK,EAAO,aAIpD,GAAS,WAEf,YAAc,EAAkB,CACnC,MAAI,OAAO,IAAQ,SACR,eAAQ,GAAQ,EAAM,WAEtB,eAAQ,GAMhB,YAAa,EAAU,EAAY,EAAqB,CAC3D,MAAO,IAAK,EAAK,EAAG,EAAG,KAAQ,WAM5B,YAAc,EAAkB,EAAY,EAAY,EAAqB,CAChF,GAAI,GAAS,GACT,MAAO,IAAK,EAAI,KAAK,GAAI,EAAI,KAAK,GAAI,EAAI,KAAK,GAAI,EAAI,KAAK,IAEhE,GAAI,MAAO,IAAQ,SAAU,CACzB,GAAI,GAAI,EACR,MAAI,OAAO,IAAM,UAAY,MAAO,IAAM,SAC7B,GAAI,MAAS,EAAO,GAAI,MAAS,EAAO,GAAI,MAAS,GAAQ,GAAI,MAAS,GAE5E,EAEf,GAAI,MAAO,IAAQ,UAAY,GAAQ,IAAQ,MAAO,GAAI,IAAO,SAAU,CACvE,GAAI,GAAM,EACN,EAAI,EACR,UAAM,GAAI,GAAK,MAAS,EACxB,GAAM,GAAI,GAAK,MAAS,EACxB,GAAM,GAAI,GAAK,MAAS,GACxB,GAAM,GAAI,GAAK,MAAS,GACjB,EAEX,MAAO,IAAK,GAAK,GAAK,OAkBnB,GAAU,IAAV,UAAU,EAAV,CACI,WAAc,EAAkD,EAAgB,CAEnF,GADA,GAAW,GACP,MAAO,IAAQ,WAAY,CAC3B,GAAI,CAAC,EAAO,KAAM,IAAI,OAAM,wDAE5B,OADI,GAAM,GAAI,IAAQ,GACb,EAAI,EAAG,EAAI,EAAI,OAAO,OAAQ,IACnC,EAAI,OAAO,GAAK,GAAK,EAAI,IAE7B,MAAO,OAEP,OAAO,IAAI,IAAQ,GAVpB,EAAS,OAaT,YAAgB,CACnB,MAAO,GAAM,GADV,EAAS,OAGhB,YAAgB,CACZ,MAAO,IAAI,IAAQ,CACf,GAAI,EAAG,EAAG,GACV,GAAI,EAAG,EAAG,KACV,GAAI,IAAK,EAAG,GACZ,GAAI,EAAG,IAAK,KAGpB,YAAgB,CACZ,MAAO,IAAI,IAAQ,CACf,GAAI,EAAG,EAAG,GACV,GAAI,EAAG,EAAG,KACV,GAAI,IAAK,EAAG,GACZ,GAAI,IAAK,EAAG,KACZ,GAAI,EAAG,IAAK,GACZ,GAAI,EAAG,IAAK,KACZ,GAAI,IAAK,IAAK,GACd,GAAI,IAAK,IAAK,OAGf,WAAe,EAAe,CACjC,MAAO,GAAK,AAAC,GAAM,CACf,GAAI,GAAI,IAAM,EAAK,GAAQ,GAC3B,MAAO,IAAI,EAAE,EAAE,IAChB,GAJA,EAAS,QAMT,WAAgB,EAAe,CAClC,OAAQ,OACC,GAAG,MAAO,SACV,GAAG,MAAO,SACV,GAAG,MAAO,aACN,MAAO,GAAQ,IALzB,EAAS,SAQT,WAAe,EAAe,CACjC,UAAW,GACJ,GAAI,IAAQ,GAAO,YAAY,QAAQ,OAAO,IAFlD,EAAS,QAIT,WAAiB,EAAe,EAAe,CAClD,SAAO,GAAQ,OACR,EAAK,AAAC,GAAM,GAAI,EAAI,GAAO,GAF/B,EAAS,YAvDH,aCjGjB,GAAI,IAAU,GAAI,IAEd,GAEA,GAAa,GAEb,GAA4B,GAAI,KAoB7B,GAAU,IAAV,UAAU,EAAV,CACI,WAAc,EAAkB,EAAuB,CAC1D,GAAI,GAAU,KAAM,MAAO,GAC3B,GAAI,GAAW,IAAU,GAAO,GAChC,MAAI,IAAY,EAAO,WACnB,EAAO,WAAW,GACX,GACP,OAAO,OAAO,EAAQ,GAEnB,EARJ,EAAS,OAUT,WAAc,EAAkB,EAAuB,CAC1D,MAAI,KAAU,GAAU,EAAO,YAC3B,IAAO,GAAO,EAAO,cAElB,EAJJ,EAAS,OAMT,WAAa,EAAa,CAC7B,MAAO,KAAU,GAAO,GADrB,EAAS,MAGT,WAAa,EAAa,EAAe,CAC5C,AAAI,IACA,IAAO,GAAO,GAFf,EAAS,QApBH,aA8BV,YAAsB,EAAsB,CAE/C,GAAI,EAAI,WAAW,uBAAwB,CACvC,GAAI,GAAO,EAAI,MAAM,KACrB,GAAI,EAAK,KAAO,OACZ,MAAO,qCAAqC,EAAK,MAAM,EAAK,MAAM,EAAK,MAAM,GAAG,KAAK,OAG7F,MAAO,GAGJ,YAAkB,EAAa,EAAoC,CAEtE,GAAI,GAAM,GAAI,gBAId,GAHA,EAAI,aAAe,IAAS,OAAS,OAAS,cAC9C,EAAI,KAAK,MAAO,EAAK,IACrB,EAAI,KAAK,MACL,EAAI,UAAY,MAAQ,EAAI,QAAU,IACtC,MAAI,KAAS,OACF,EAAI,SAEJ,GAAI,YAAW,EAAI,UAG9B,KAAM,IAAI,OAAM,oBAAoB,oCAAsC,EAAI,WAI/E,YAAqB,EAAa,EAAoC,CACzE,GAAI,EAAI,WAAW,UAAY,EAAI,WAAW,UAC1C,MAAO,IAAS,EAAK,GAEzB,GAAI,GACA,MAAO,IAAQ,YAAY,GAK5B,YAAc,EAAa,EAAoC,CAElE,EAAM,GAAa,GAEnB,GAAI,GAAW,EACX,EAAO,GAAQ,IAAI,GACvB,GAAI,GAAQ,KAAM,MAAO,GAGzB,GADA,EAAO,GAAY,EAAK,GACpB,GAAQ,KAAM,KAAM,IAAI,OAAM,yBAAyB,MAC3D,GAAI,IAAS,QAAU,MAAO,IAAS,SAAU,KAAM,IAAI,OAAM,aAAa,sBAC9E,GAAI,IAAS,UAAY,CAAE,aAAgB,aAAa,KAAM,IAAI,OAAM,aAAa,2BAErF,UAAQ,IAAI,EAAU,GACf,EAGJ,YAAiB,EAAyB,CAC7C,GAAI,GAAO,GAAK,EAAK,UACrB,GAAI,YAAgB,YAChB,MAAO,GAEP,KAAM,IAAI,OAAM,oBAAoB,4BAGrC,YAAmB,EAAwB,CAC9C,MAAQ,IAAK,EAAK,QAAmB,MAAM;GCnHxC,YAAiC,CAIpC,YACoB,EACA,EAClB,CAFkB,aACA,cAJpB,WAAc,GAad,SAAS,EAAW,EAAoB,CACpC,MAAQ,IAAK,GAAK,EAAI,KAAK,OAAS,GAAK,GAAK,EAAI,KAAK,OAE3D,OAAO,EAAiD,CACpD,GAAI,MAAO,IAAO,WACd,OAAS,GAAE,EAAG,EAAE,KAAK,OAAQ,IACzB,OAAS,GAAE,EAAG,EAAE,KAAK,MAAO,IACxB,KAAK,IAAI,EAAG,EAAG,EAAG,EAAG,YAGtB,GAAM,EAAG,QAAa,KAC7B,KAAK,SAAS,OAEd,MAAM,IAAI,OAAM,iCAAiC,KAGzD,OAA4B,CACxB,GAAI,GAAM,KAAK,MAAM,KAAK,MAAO,KAAK,QACtC,SAAI,OAAO,CAAC,EAAE,IAAM,KAAK,IAAI,EAAE,IACxB,EAEX,KAAK,EAAc,EAAc,EAAe,EAAgB,CAC5D,GAAI,GAAO,KAAK,MAAM,EAAO,GAC7B,SAAK,OAAO,CAAC,EAAG,IAAM,KAAK,IAAI,EAAI,EAAM,EAAI,IACtC,EAEX,KAAK,EACD,EAAe,EACf,EAAc,EAClB,CACI,GAAS,EACT,GAAS,EACT,GAAQ,EACR,GAAQ,EACR,OAAS,GAAE,EAAG,EAAE,EAAI,OAAQ,IACxB,OAAS,GAAE,EAAG,EAAE,EAAI,MAAO,IAAK,CAC5B,GAAI,GAAO,EAAI,QAAQ,EAAE,EAAM,EAAE,GACjC,KAAK,IAAI,EAAE,EAAO,EAAE,EAAO,IAIvC,KAAK,EAAe,EAAe,EAAc,EAAe,EAAc,CAC1E,OAAS,GAAE,EAAG,EAAE,EAAQ,IACpB,OAAS,GAAE,EAAG,EAAE,EAAO,IACnB,KAAK,IAAI,EAAE,EAAO,EAAE,EAAO,KAMpC,gBAAyB,GAA2B,CAGvD,YACI,EACA,EACA,EACF,CACE,MAAM,EAAO,GACb,KAAK,KAAO,GAAI,aAAY,KAAK,MAAQ,KAAK,QAC1C,GAAS,KAAK,OAAO,GAE7B,SAAS,EAAwB,CAC7B,KAAK,KAAK,IAAI,GAElB,IAAI,EAAW,EAAW,EAAc,CACpC,AAAI,KAAK,SAAS,EAAE,IAAI,MAAK,KAAK,EAAI,KAAK,MAAQ,GAAK,GAE5D,IAAI,EAAW,EAAmB,CAC9B,MAAO,MAAK,SAAS,EAAE,GAAK,KAAK,KAAK,EAAI,KAAK,MAAQ,GAAK,EAEhE,QAAQ,EAAW,EAAmB,CAClC,MAAO,MAAK,IAAI,EAAG,GAEvB,MAAM,EAAgB,EAA8B,CAChD,MAAO,IAAI,IAAW,GAAS,KAAK,MAAO,GAAU,KAAK,QAE9D,OAAqB,CACjB,GAAI,GAAS,KAAK,MAAM,KAAK,MAAO,KAAK,QACzC,SAAO,KAAK,IAAI,KAAK,MACd,IAIR,gBAAoC,GAA6B,CAGpE,YACI,EACA,EACgB,EAChB,EACF,CACE,MAAM,EAAO,GAHG,WAIhB,GAAI,GAAO,GAAK,GAAO,GAAK,GAAO,GAAK,GAAO,EAC3C,KAAM,IAAI,OAAM,2BAA2B,KAC/C,KAAK,OAAS,GAAI,YAAW,KAAK,MAAQ,KAAK,QAC3C,GAAS,KAAK,OAAO,GAE7B,SAAS,EAAwB,CAC7B,KAAK,OAAO,IAAI,GAEpB,IAAI,EAAW,EAAW,EAAe,CACrC,AAAI,KAAK,SAAS,EAAE,IAAI,MAAK,OAAO,EAAI,KAAK,MAAQ,GAAK,GAE9D,IAAI,EAAW,EAAmB,CAC9B,MAAO,MAAK,SAAS,EAAE,GAAK,KAAK,OAAO,EAAI,KAAK,MAAQ,GAAK,IAItE,YAAgB,EAA+B,CAC3C,GAAI,MAAO,IAAM,SAAU,MAAO,GAClC,GAAI,YAAa,IAAS,CACtB,GAAI,EAAE,OAAO,QAAU,EAAG,MAAO,GAC5B,GAAI,EAAE,OAAO,QAAU,EAAG,MAAO,GACjC,GAAI,EAAE,OAAO,QAAU,GAAI,MAAO,GAE3C,MAAO,GAGJ,oBAA4B,GAAa,CAG5C,YACI,EACA,EACA,EACA,EACF,CACE,MAAM,EAAO,EAAQ,GAAO,GAAe,GAC3C,KAAK,QAAU,YAAwB,IACjC,EACA,AAAM,GAAQ,OAAO,GAAK,KAAK,KAEzC,QAAQ,EAAW,EAAmB,CAClC,MAAO,MAAK,SAAW,KAAK,QAAQ,OAAO,KAAK,IAAI,EAAG,IAE3D,MAAM,EAAgB,EAAiB,EAAsC,CAEzE,MADa,IAAI,IAAc,GAAS,KAAK,MAAO,GAAU,KAAK,OAAQ,GAAc,KAAK,SAGlG,OAAwB,CACpB,GAAI,GAAS,KAAK,MAAM,KAAK,MAAO,KAAK,QACzC,SAAO,OAAO,IAAI,KAAK,QAChB,IAgFR,GAAU,IAAV,UAAU,EAAV,CACI,WAAc,EAAyB,CAC1C,MAAO,GAAO,AAAG,GAAQ,IADtB,EAAS,OAGT,WAAgB,EAA8B,CACjD,GAAI,GAAM,AAAQ,GAAO,GACzB,MAAO,GAAgB,GAFpB,EAAS,SAIhB,WAAyB,EAAsC,CAC3D,MAAI,GAAI,SAAW,EAAI,OAAS,EACrB,EAAuB,GAEvB,EAAoB,GAGnC,WAAgC,EAAyC,CACrE,GAAI,GAAc,EAAI,QAClB,EAAU,GAAI,IAAQ,GAC1B,GAAI,GAAS,GAAI,IAAc,EAAI,MAAO,EAAI,OAAQ,EAAI,OAC1D,GAAI,EAAI,OAAS,EACb,EAAO,OAAO,IAAI,EAAI,UACnB,CACH,GAAI,GAAa,KAAK,MAAM,EAAI,EAAI,OAChC,EAAQ,IAAK,EAAI,OAAS,EAC9B,OAAS,GAAI,EAAG,EAAI,EAAO,OAAO,OAAQ,IAAK,CAC3C,GAAI,GAAQ,EAAI,EAAc,EAAI,MAClC,GAAI,GAAM,EAAI,KAAK,KAAK,MAAM,EAAI,IAClC,EAAO,OAAO,GAAM,GAAO,EAAQ,GAG3C,SAAO,QAAU,EAEV,EAEX,WAA6B,EAAsC,CAC/D,GAAM,GAAS,GAAI,IAAW,EAAI,MAAO,EAAI,QACvC,EAAuC,CAAC,EAAG,EAAG,EAAG,GACvD,OAAS,GAAI,EAAG,EAAI,EAAO,KAAK,OAAQ,IAAK,CACzC,OAAS,GAAI,EAAG,EAAI,EAAG,IACnB,EAAK,GAAK,EAAI,KAAK,EAAI,EAAI,GAC/B,EAAO,KAAK,GAAK,AAAM,GAAK,GAGhC,MAAO,MA3CE,aA+CV,GAAU,IAAV,UAAU,EAAV,CAMH,eAAoB,GAAc,CAC9B,YAAY,EAAe,EAAgB,EACvB,EACA,EAAiB,CACjC,MAAM,EAAO,EAAQ,GAFL,YACA,gBAIjB,WAAc,EAAa,CAC9B,GAAI,EAAI,SAAS,SAAU,MAAO,GAAgB,AAAG,GAAU,IAC/D,GAAI,EAAI,SAAS,SAAU,MAAO,GAAgB,AAAG,GAAU,IAC/D,KAAM,IAAI,OAAM,qCAAqC,MAHlD,EAAS,OAKT,WAAqB,EAAkB,EAAiB,EAAwB,CACnF,GAAI,GAAQ,EACZ,OAAS,KAAS,GAAQ,EAAQ,KAAK,IAAI,EAAO,EAAM,QACxD,GAAI,GAAI,GAAI,GAAM,EAAO,EAAO,OAAQ,EAAG,EAAS,GACpD,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACpC,GAAI,GAAQ,EAAO,GACnB,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACnC,GAAI,GAAK,EAAM,GACf,EAAE,IAAI,EAAG,EAAG,IAAK,KAAO,IAAK,IAAM,EAAI,IAG/C,MAAO,GAXJ,EAAS,cAcT,WAAyB,EAAuB,CACnD,GAAI,GAAY,EACZ,EAAa,GACb,EAAS,GACT,EAAU,EACV,EAAU,GACV,EAAqB,GACnB,EAAU,qBACV,EAAW,2CACX,EAAW,cACjB,YAAmB,CACf,AAAI,GAAW,GAAK,EAAS,QACzB,GAAO,GAAW,EAAY,EAAU,EAAS,GACjD,EAAU,GACV,EAAW,IAGnB,OAAS,KAAQ,GAAO,CACpB,GAAI,GAaJ,GAZA,AAAI,GAAI,EAAQ,KAAK,IACjB,GAAW,EAAE,IAAM,EAAE,GACjB,EAAE,KAAO,UAAU,GAAU,SAAS,EAAE,KACxC,EAAE,KAAO,QAAQ,GAAY,SAAS,EAAE,MACzC,AAAI,GAAI,EAAS,KAAK,IACzB,KACA,AAAI,EAAE,IAAM,KAAM,EAAU,SAAS,EAAE,GAAI,IACtC,AAAI,EAAE,IAAM,KAAM,EAAU,SAAS,EAAE,GAAI,IACvC,EAAE,IAAM,MAAM,GAAU,OAC1B,GAAI,EAAS,KAAK,KACzB,EAAS,KAAK,EAAE,IAEhB,MAAM,EAAU,EAAU,GAC1B,KAAM,IAAI,OAAM,0BAA0B,KAAK,UAAU,MAEjE,WACO,CAAE,YAAW,aAAY,UAnC7B,EAAS,kBAsCT,WAAyB,EAAuB,CACnD,GAAI,GAAY,EACZ,EAAa,GACb,EAAS,GACT,EAAU,GACV,EAAqB,GACnB,EAAW,+BACjB,YAAmB,CACf,AAAI,GAAW,GAAK,EAAS,QACzB,GAAO,GAAW,EAAY,EAAU,EAAS,GACjD,EAAY,KAAK,IAAI,EAAW,EAAS,QACzC,EAAU,GACV,EAAW,IAGnB,OAAS,KAAQ,GAAO,CACpB,GAAI,GACJ,GAAI,EAAI,EAAS,KAAK,GAAO,CACzB,GAAI,EAAE,IAAM,MACR,KACA,EAAU,SAAS,EAAE,GAAI,IACrB,MAAM,IACN,KAAM,IAAI,OAAM,0BAA0B,KAAK,UAAU,MAEjE,EAAS,KAAK,EAAE,KAGxB,WACO,CAAE,YAAW,aAAY,UA5B7B,EAAS,oBAtEH,aCvSjB,GAAK,IAAL,UAAK,EAAL,CACI,yBACA,eACA,eACA,iBACA,iBACA,iBACA,iBACA,iBACA,mBATC,aCME,GAAM,IAAY,UAqDlB,YAAuB,EAAiC,CAC3D,MAAO,CAAC,CAAG,EAAoB,WC3DnC,GAAO,IAAmB,KAQb,GAAwB,aCCrC,GAAM,IAAiB,IACjB,GAAiB,EAEvB,YAAyB,EAA4B,EAAc,EAAc,EAAe,CAC5F,GAAI,GAAO,EAAK,WACZ,EAAkC,IAAC,WAAY,EAAK,WAAY,QAAS,GAC7E,GAAI,YAAiB,cAAc,CAC/B,GAAM,GAAS,EAAM,OACf,EAAO,EAAO,wBACd,EAAS,EAAO,MAAQ,EAAK,MAC7B,EAAS,EAAO,OAAS,EAAK,OAC9B,EAAK,GAAM,QAAU,EAAK,MAAQ,EAClC,EAAK,GAAM,QAAU,EAAK,KAAO,EACvC,EAAO,EAAI,KAAK,MAAM,GACtB,EAAO,EAAI,KAAK,MAAM,OAGtB,SAAQ,IAAI,qBAAsB,GAGtC,GAAgB,gBAAgB,CAAC,CAC7B,IAAc,GACd,MAAO,KAQf,oBAA6B,GAA+B,CACxD,OAAO,EAAY,EAAe,EAAa,CAC3C,GAAI,GAAM,KAAK,MAAM,UAAY,SAC7B,EAAM,GAAQ,GAClB,GAAI,GAAY,IAAI,GAAI,EAAI,KACxB,EAAa,EAAM,MAAY,OAAS,OACxC,EAAa,GAAI,EAAM,SAAU,GACrC,MAAO,IAAE,MAAO,CACZ,MAAO,iCACP,MAAO,qBAAqB,aAAqB,IACjD,IAAK,GACN,MAYX,gBAA8B,GAAgC,CAQ1D,YAAY,EAA6B,CACrC,MAAM,GARV,SAAM,KAKN,aAAU,GAKV,OAAO,EAAY,EAAe,EAAa,CAC3C,GAAI,GAAQ,CACR,MAAO,iBACP,IAAK,KAAK,IACV,MAAO,KAAK,MAAM,MAClB,OAAQ,KAAK,MAAM,OACnB,MAAO,KAAK,MAAM,OAAO,OAEzB,EAAY,KAAK,MAAM,OAC3B,MAAI,AAAS,IAAc,GAChB,GAAE,SAAU,IACf,cAAe,AAAC,GAAoB,CAChC,GAAgB,EAAK,OAAQ,EAAG,CAAE,QAAS,KAAK,WAEpD,cAAe,AAAC,GAAoB,CAChC,KAAK,QAAU,GACf,KAAK,OAAO,kBAAkB,EAAE,WAChC,GAAgB,EAAK,OAAQ,EAAG,CAAE,QAAS,MAE/C,YAAa,AAAC,GAAoB,CAC9B,KAAK,QAAU,GACf,GAAgB,EAAK,KAAM,EAAG,CAAE,QAAS,MAE7C,aAAc,AAAC,GAAoB,CAC/B,KAAK,QAAU,GACf,GAAgB,EAAK,MAAO,EAAG,CAAE,QAAS,OAE3C,IAGA,GAAE,SAAU,GAG3B,mBAAoB,CAChB,KAAK,UAET,sBAAuB,CACnB,KAAK,OAAS,KACd,KAAK,UAAY,KACjB,KAAK,QAAU,KAEnB,mBAAmB,EAAW,EAAW,EAAU,CAC/C,KAAK,UAET,SAAU,CACN,KAAK,OAAS,KAAK,KACnB,KAAK,IAAM,KAAK,OAAO,WAAW,MAClC,KAAK,UAAY,KAAK,IAAI,gBAAgB,KAAK,OAAO,MAAO,KAAK,OAAO,QACzE,KAAK,QAAU,GAAI,aAAY,KAAK,UAAU,KAAK,QAEvD,SAAU,CAEN,AAAI,MAAK,SAAW,KAAK,MAClB,KAAK,UAAU,OAAS,KAAK,MAAM,OACnC,KAAK,UAAU,QAAU,KAAK,MAAM,SACvC,KAAK,UAET,KAAK,aAAa,KAAK,QAAS,KAAK,MAAM,QAC3C,KAAK,IAAI,aAAa,KAAK,UAAW,EAAG,GAE7C,aAAa,EAAoB,EAAwB,CACrD,AAAI,EAAI,SACJ,KAAK,oBAAoB,EAAO,GAEhC,EAAI,MACJ,KAAK,iBAAiB,EAAO,GAGrC,iBAAiB,EAAoB,EAAwB,CACzD,EAAM,IAAI,EAAI,MAElB,oBAAoB,EAAoB,EAA2B,CAC/D,GAAI,GAAM,EAAI,QAAQ,OACtB,OAAS,GAAI,EAAG,EAAI,EAAI,OAAO,OAAQ,IACnC,EAAM,GAAK,EAAI,EAAI,OAAO,MAetC,gBAAsC,GAA8D,CAChG,OAAO,EAAY,EAAe,EAAa,CAC3C,GAAI,GAAa,MAAO,MAAK,MAAM,QAAW,SAC1C,EAAW,GACf,AAAI,GAAY,GAAW,KAAK,MAAM,SAAW,gBAAkB,kBACnE,GAAI,GAAW,KAAK,MAAM,MAAQ,KAClC,MAAO,IAAE,MAAO,CACZ,MAAO,eACP,IAAK,GAAG,KAAK,MAAM,iBACpB,CACC,GAAE,MAAO,CACL,MAAO,eAAiB,EACxB,QAAS,EAAa,IAAM,KAAK,eAAiB,MACnD,CACC,GAAY,KAAO,GAAE,OAAQ,CAAE,MAAO,YAAc,CAAE,EAAU,IAAgB,KAChF,GAAE,OAAQ,CAAE,MAAO,6BAA+B,CAC9C,GAAa,KAAK,MAAM,YAGhC,KAAK,MAAM,SAAW,GAAoB,KAAK,MAAM,OAAQ,KAAK,MAAM,SAAW,OAG3F,cAAe,CACX,KAAK,SAAS,CAAE,SAAU,CAAC,KAAK,MAAM,aAI9C,YAAsB,EAAa,CAC/B,GAAI,MAAO,IAAW,SAClB,GAAI,CACA,GAAI,GAAI,EAAO,KAA0B,OAAO,eAAe,GAAQ,YAAY,KACnF,MAAI,GAAO,OAAS,GAChB,IAAK,IAAI,EAAO,WAEb,QACF,EAAP,CACE,eAAQ,IAAI,GACL,EAAI,OAGf,OAAO,IAAkB,GAIjC,YAA2B,EAAK,CAC5B,GAAI,GAAO,GAGX,MAAI,IAAO,EAAI,IAAM,MAAO,GAAI,IAAM,YAAc,KAAK,UAAY,MACjE,GAAM,EAAI,MAGd,AAAI,GAAO,KACP,EAAO,EAAM,GAEV,AAAI,MAAO,IAAO,SACrB,AAAI,GAAQ,GAAM,GAAI,EAAO,EAAI,WAC5B,EAAO,EAAM,MAAS,GAAI,GAAO,IACnC,AAAI,MAAO,IAAO,SACrB,EAAO,EAEP,EAAO,KAAK,UAAU,GAEtB,EAAK,OAAS,IACd,GAAO,EAAK,UAAU,EAAG,IAAkB,OACxC,EAGX,YAAyB,EAAwC,CAC7D,MAAO,GAAO,KAAU,EAAO,QAAa,EAAO,QAEvD,YAAsB,EAAqC,CACvD,MAAO,GAAO,eAAmB,aAGrC,YAA0B,EAAqB,CAC3C,MAAI,AAAM,IAAU,GACT,GAAU,IAAQ,EAAO,QAAQ,UACjC,GAAQ,GACR,MAAM,KAAK,GACX,GAAU,KACV,CAAE,GAEF,GAIf,YAAuB,EAAa,EAAqB,CACrD,MAAI,AAAM,IAAU,GACT,AAAM,GAAK,EAAO,OAAO,IACzB,GAAQ,GACR,EAAO,GACP,GAAU,KACV,EAEA,KAIf,YAAqB,EAAa,EAAc,EAA6B,CAEzE,GAAI,GAAQ,EAAK,WAAW,KAAM,CAI9B,GAFI,EAAK,WAAW,OAEhB,GAAU,KAAM,OAEpB,EAAO,KAIX,GAAI,GAAU,KACV,MAAO,IAAE,OAAQ,GAAK,EAAS,IAC5B,GAAI,EAAO,OAAW,CACzB,GAAI,GAAO,GAAc,EAAO,QAChC,GAAI,CAAC,EAAM,KAAM,IAAI,OAAM,8BAA8B,EAAO,UAChE,MAAO,IAAE,EAAM,CAAE,MAAO,EAAS,SAAU,QACxC,IAAI,EAAO,YACd,MAAO,IAAE,MAAO,GAAK,CAAE,EAAO,cAC3B,GAAI,GAAgB,IAAW,GAAa,GAC/C,MAAO,IAAE,GAAiB,CAAE,OAAQ,EAAQ,MAAO,EAAO,MAAO,OAAQ,EAAO,SAC7E,GAAI,AAAM,GAAS,GACtB,MAAO,IAAE,GAAgB,CAAE,UAAW,AAAM,GAAI,KAC7C,GAAI,AAAM,GAAU,GAEvB,GAAI,EAAO,OAAO,QAAU,IAAK,CAC7B,GAAI,GAAW,GACX,EAAQ,CAAE,MAAO,GAAI,IAAK,GAAG,UACjC,SAAM,OAAS,mBACf,EAAO,OAAO,QAAQ,AAAC,GAAQ,CAC3B,EAAS,KAAK,GAAE,GAAgB,CAAE,UAAW,OAE1C,GAAE,MAAO,EAAO,OACpB,CACH,GAAI,CAAC,IAAE,KAAK,GAAmB,EAAO,OAAO,OAAQ,EAAG,EAAG,IAC3D,MAAO,IAAY,CAAE,KAAM,EAAO,OAAQ,MAAO,EAAG,OAAQ,GAAK,EAAM,OAG3E,OAAO,IAAE,GAAyB,CAAE,OAAM,SAAQ,WAAW,KAIrE,YAAyB,EAAsB,EAAc,EAAiB,CAC1E,GAAM,GAAW,IACjB,GAAI,EAAM,QAAU,EAAU,CAE1B,GAAI,GAAW,GAAQ,EAAO,EAAG,EAAM,QACvC,MAAO,IAAE,MAAO,GAAI,OACjB,CACH,GAAI,GAAW,GACf,OAAS,GAAM,EAAG,EAAM,EAAM,OAAQ,GAAO,EACzC,EAAS,KAAK,GAAY,EAAM,MAAM,EAAK,EAAM,GAAW,IAAM,GAAI,GAAM,GAAG,KAAW,MAE9F,MAAO,IAAE,MAAO,GAAI,IAI5B,YAA6B,EAAiB,EAAiB,CAE3D,GAAI,GAAO,EAAO,kBAClB,GAAI,MAAO,IAAS,SAChB,MAAO,IAAgB,EAAyB,EAAM,GAG1D,GAAI,GAAa,AADG,OAAO,QAAQ,GACJ,IAAI,GAAS,GAAY,EAAM,GAAI,EAAM,GAAI,GAAG,KAAW,EAAM,OAChG,MAAO,IAAE,MAAO,CAAE,MAAO,kBAAoB,GAWjD,oBAAgC,GAA4B,CACxD,OAAO,EAAY,EAAe,EAAa,CAC3C,GAAI,GAAS,KAAK,MAAM,SACxB,MAAO,IAAE,MAAO,GAAI,CAChB,KAAK,MAAM,MACX,GAAE,QAAS,CACP,KAAM,QACN,IAAK,EAAO,IAAM,EAAO,KACzB,IAAK,EAAO,IAAM,EAAO,KACzB,MAAO,EAAO,MAAQ,EAAO,KAC7B,QAAS,AAAC,GAAO,CACb,GAAI,GAAa,CAAE,MAAO,WAAW,EAAG,OAAO,OAAS,EAAO,MAC/D,KAAK,SAAS,KAAK,OACnB,GAAgB,gBAAgB,CAAC,CAAC,IAAK,KAAK,MAAM,MAAO,MAAO,QAGxE,GAAE,OAAQ,GAAK,GAAa,EAAO,YAK/C,gBAAgC,GAAsD,CAAtF,aAzWA,CAyWA,oBACI,SAAM,KACN,OAAO,EAAY,EAAe,EAAa,CAC3C,GAAI,GAAS,KAAK,MAAM,SACpB,EAAW,GAAiB,EAAO,SACvC,KAAK,MAAM,SAAW,EAAS,OAAS,GACxC,GAAI,GAAiB,CAAC,KAAK,MAAM,UAAY,KAAK,MAAM,SACpD,EAAS,KA6Bb,GA5BI,GACA,GAAS,GAAE,MAAO,CACd,MAAO,kCACP,IAAK,KAAK,IACV,QAAS,AAAC,GAAM,CAEZ,GAAI,GAAS,EAAE,OACf,KAAO,EAAO,eAAiB,EAAO,eAAiB,KAAK,IAAI,SAC5D,EAAS,EAAO,cAEpB,GAAI,EAAO,cAAe,CACtB,GAAM,GAAW,MAAM,KAAK,EAAO,cAAc,UAAU,QAAQ,GACnE,GAAI,GAAY,GAAK,EAAW,EAAS,OAAQ,CAC7C,GAAI,GAAa,CAAE,MAAO,EAAS,GAAW,MAAO,GACrD,KAAK,SAAS,CAAE,SAAU,KAC1B,GAAgB,gBAAgB,CAAC,CAAC,IAAK,KAAK,MAAM,MAAO,MAAO,SAEhE,MAAM,IAAI,OAAM,kCAAkC,KAAK,MAAM,YAK7E,EAAS,IAAI,CAAC,EAAO,IAAU,CAC3B,GAAI,GAAM,GAAY,EAAO,KAAM,GAAG,KAAK,MAAM,iBAAiB,KAC9D,EAAY,GAAS,EAAO,MAChC,MAAO,IAAE,MAAO,CAAE,MAAO,EAAW,qBAAuB,IAAM,CAAE,QAGvE,KAAK,MAAM,SAAU,CACrB,GAAI,GAAc,GAAY,GAAc,EAAO,QAAS,EAAO,OAAQ,KAAM,GAAG,KAAK,MAAM,mBAC/F,MAAO,IAAE,MAAO,CACZ,MAAO,eACP,IAAK,GAAG,KAAK,MAAM,eACpB,CACC,GAAE,MAAO,CACL,MAAO,eAAkB,MAAK,MAAM,SAAW,gBAAkB,kBACjE,QAAS,IAAM,KAAK,gBACrB,CACC,KAAK,MAAM,MACX,GAAE,OAAQ,CAAE,MAAO,6BAA+B,CAC9C,MAIR,QAGJ,OAAO,GAGf,cAAe,CACX,KAAK,SAAS,CAAE,SAAU,CAAC,KAAK,MAAM,aAI9C,gBAAgC,GAA4B,CACxD,OAAO,EAAY,EAAe,EAAa,CAC3C,GAAI,GAAS,KAAK,MAAM,SACxB,MAAO,IAAE,SAAU,CACf,MAAO,EAAO,QAAU,qCAAuC,mBAC/D,QAAS,AAAC,GAAkB,CACxB,GAAgB,EAAQ,QAAS,EAAG,MAEzC,CACC,EAAO,UAKnB,gBAAkC,GAA4B,CAC1D,OAAO,EAAY,EAAe,EAAa,CAC3C,GAAI,GAAW,KAAK,MAAM,SAE1B,MAAO,IAAE,MAAO,CACZ,UAAW,AAAC,GAAqB,CAC7B,GAAgB,EAAU,MAAO,EAAG,MAEzC,MAIL,GAAgB,CAClB,OAAU,GACV,OAAU,GACV,OAAU,GACV,SAAY,IAKT,QAAe,CAClB,YACoB,EACA,EAClB,CAFkB,eACA,eAEhB,EAAQ,UAAU,IAAI,mBAE1B,YAAY,EAAe,CACvB,GAAI,GAAQ,EAAM,IAAI,GACX,GAAE,MAAO,CACZ,MAAO,iBACP,IAAK,GAAG,EAAK,YACd,CACC,GAAY,EAAK,OAAQ,EAAK,GAAI,EAAK,OAG/C,GAAO,EAAO,KAAK,WCrd3B,YAA4C,CAKxC,YAAY,EAA0B,CAClC,KAAK,YAAc,EACnB,KAAK,SAAW,GAAI,IAAS,SAAU,GAE3C,OAAQ,EAER,OAAQ,EAER,OAAQ,EAER,QAAS,EAET,QAAQ,EAAO,EAAgB,CAC3B,KAAK,SAAS,YAAY,EAAI,OAGlC,WAAY,CACR,MAAO,GAEX,aAAuB,CACnB,MAAO,GAEX,mBAAmB,EAAoB,CACnC,MAAO,KAEX,qBAA8B,CAC1B,MAAO,MAEX,YAAa,CACT,MAAO,KAKf,GAAU,OAAY",
  "names": []
}